From c853d77aa41740076e471a55d0c56ea11b528a04 Mon Sep 17 00:00:00 2001
From: chiteroman <98092901+chiteroman@users.noreply.github.com>
Date: Thu, 14 Dec 2023 11:11:36 +0100
Subject: [PATCH] v14.4

---
 .gitmodules                                   |     6 +-
 .idea/vcs.xml                                 |     2 +-
 app/build.gradle.kts                          |    33 +-
 app/src/main/cpp/Android.mk                   |    31 -
 app/src/main/cpp/Application.mk               |     4 -
 app/src/main/cpp/CMakeLists.txt               |    15 +
 app/src/main/cpp/Dobby                        |     1 +
 app/src/main/cpp/json.hpp                     | 24765 ++++++++++++++++
 app/src/main/cpp/libcxx                       |     1 -
 app/src/main/cpp/libcxx/arm64-v8a.a           |   Bin 0 -> 2045696 bytes
 app/src/main/cpp/libcxx/armeabi-v7a.a         |   Bin 0 -> 2372904 bytes
 .../main/cpp/libcxx/include/CMakeLists.txt    |   934 +
 .../include/__algorithm/adjacent_find.h       |    53 +
 .../cpp/libcxx/include/__algorithm/all_of.h   |    32 +
 .../cpp/libcxx/include/__algorithm/any_of.h   |    32 +
 .../include/__algorithm/binary_search.h       |    46 +
 .../cpp/libcxx/include/__algorithm/clamp.h    |    46 +
 .../cpp/libcxx/include/__algorithm/comp.h     |    66 +
 .../include/__algorithm/comp_ref_type.h       |    79 +
 .../cpp/libcxx/include/__algorithm/copy.h     |   126 +
 .../include/__algorithm/copy_backward.h       |   143 +
 .../cpp/libcxx/include/__algorithm/copy_if.h  |    39 +
 .../include/__algorithm/copy_move_common.h    |   163 +
 .../cpp/libcxx/include/__algorithm/copy_n.h   |    67 +
 .../cpp/libcxx/include/__algorithm/count.h    |    35 +
 .../cpp/libcxx/include/__algorithm/count_if.h |    35 +
 .../cpp/libcxx/include/__algorithm/equal.h    |    86 +
 .../libcxx/include/__algorithm/equal_range.h  |    87 +
 .../cpp/libcxx/include/__algorithm/fill.h     |    52 +
 .../cpp/libcxx/include/__algorithm/fill_n.h   |    45 +
 .../cpp/libcxx/include/__algorithm/find.h     |    32 +
 .../cpp/libcxx/include/__algorithm/find_end.h |   227 +
 .../include/__algorithm/find_first_of.h       |    52 +
 .../cpp/libcxx/include/__algorithm/find_if.h  |    32 +
 .../libcxx/include/__algorithm/find_if_not.h  |    32 +
 .../cpp/libcxx/include/__algorithm/for_each.h |    32 +
 .../libcxx/include/__algorithm/for_each_n.h   |    43 +
 .../cpp/libcxx/include/__algorithm/generate.h |    31 +
 .../libcxx/include/__algorithm/generate_n.h   |    36 +
 .../include/__algorithm/half_positive.h       |    49 +
 .../include/__algorithm/in_found_result.h     |    49 +
 .../include/__algorithm/in_fun_result.h       |    49 +
 .../include/__algorithm/in_in_out_result.h    |    56 +
 .../libcxx/include/__algorithm/in_in_result.h |    53 +
 .../include/__algorithm/in_out_out_result.h   |    54 +
 .../include/__algorithm/in_out_result.h       |    53 +
 .../cpp/libcxx/include/__algorithm/includes.h |    75 +
 .../include/__algorithm/inplace_merge.h       |   257 +
 .../cpp/libcxx/include/__algorithm/is_heap.h  |    44 +
 .../include/__algorithm/is_heap_until.h       |    66 +
 .../include/__algorithm/is_partitioned.h      |    38 +
 .../include/__algorithm/is_permutation.h      |   238 +
 .../libcxx/include/__algorithm/is_sorted.h    |    44 +
 .../include/__algorithm/is_sorted_until.h     |    56 +
 .../libcxx/include/__algorithm/iter_swap.h    |    32 +
 .../include/__algorithm/iterator_operations.h |   175 +
 .../__algorithm/lexicographical_compare.h     |    62 +
 .../libcxx/include/__algorithm/lower_bound.h  |    68 +
 .../libcxx/include/__algorithm/make_heap.h    |    56 +
 .../include/__algorithm/make_projected.h      |   126 +
 .../main/cpp/libcxx/include/__algorithm/max.h |    71 +
 .../libcxx/include/__algorithm/max_element.h  |    57 +
 .../cpp/libcxx/include/__algorithm/merge.h    |    70 +
 .../main/cpp/libcxx/include/__algorithm/min.h |    71 +
 .../libcxx/include/__algorithm/min_element.h  |    70 +
 .../include/__algorithm/min_max_result.h      |    56 +
 .../cpp/libcxx/include/__algorithm/minmax.h   |    69 +
 .../include/__algorithm/minmax_element.h      |   101 +
 .../cpp/libcxx/include/__algorithm/mismatch.h |    63 +
 .../cpp/libcxx/include/__algorithm/move.h     |   130 +
 .../include/__algorithm/move_backward.h       |   139 +
 .../include/__algorithm/next_permutation.h    |    78 +
 .../cpp/libcxx/include/__algorithm/none_of.h  |    32 +
 .../libcxx/include/__algorithm/nth_element.h  |   258 +
 .../libcxx/include/__algorithm/partial_sort.h |    96 +
 .../include/__algorithm/partial_sort_copy.h   |    88 +
 .../libcxx/include/__algorithm/partition.h    |    98 +
 .../include/__algorithm/partition_copy.h      |    47 +
 .../include/__algorithm/partition_point.h     |    48 +
 .../cpp/libcxx/include/__algorithm/pop_heap.h |    73 +
 .../include/__algorithm/prev_permutation.h    |    79 +
 .../libcxx/include/__algorithm/push_heap.h    |    77 +
 .../__algorithm/ranges_adjacent_find.h        |    78 +
 .../include/__algorithm/ranges_all_of.h       |    68 +
 .../include/__algorithm/ranges_any_of.h       |    68 +
 .../__algorithm/ranges_binary_search.h        |    63 +
 .../libcxx/include/__algorithm/ranges_clamp.h |    65 +
 .../libcxx/include/__algorithm/ranges_copy.h  |    67 +
 .../__algorithm/ranges_copy_backward.h        |    65 +
 .../include/__algorithm/ranges_copy_if.h      |    81 +
 .../include/__algorithm/ranges_copy_n.h       |    77 +
 .../libcxx/include/__algorithm/ranges_count.h |    62 +
 .../include/__algorithm/ranges_count_if.h     |    72 +
 .../libcxx/include/__algorithm/ranges_equal.h |   115 +
 .../include/__algorithm/ranges_equal_range.h  |    78 +
 .../libcxx/include/__algorithm/ranges_fill.h  |    59 +
 .../include/__algorithm/ranges_fill_n.h       |    48 +
 .../libcxx/include/__algorithm/ranges_find.h  |    63 +
 .../include/__algorithm/ranges_find_end.h     |    98 +
 .../__algorithm/ranges_find_first_of.h        |   101 +
 .../include/__algorithm/ranges_find_if.h      |    71 +
 .../include/__algorithm/ranges_find_if_not.h  |    63 +
 .../include/__algorithm/ranges_for_each.h     |    78 +
 .../include/__algorithm/ranges_for_each_n.h   |    66 +
 .../include/__algorithm/ranges_generate.h     |    73 +
 .../include/__algorithm/ranges_generate_n.h   |    62 +
 .../include/__algorithm/ranges_includes.h     |    95 +
 .../__algorithm/ranges_inplace_merge.h        |    85 +
 .../include/__algorithm/ranges_is_heap.h      |    74 +
 .../__algorithm/ranges_is_heap_until.h        |    75 +
 .../__algorithm/ranges_is_partitioned.h       |    81 +
 .../__algorithm/ranges_is_permutation.h       |    89 +
 .../include/__algorithm/ranges_is_sorted.h    |    61 +
 .../__algorithm/ranges_is_sorted_until.h      |    76 +
 .../__algorithm/ranges_iterator_concept.h     |    51 +
 .../ranges_lexicographical_compare.h          |    98 +
 .../include/__algorithm/ranges_lower_bound.h  |    66 +
 .../include/__algorithm/ranges_make_heap.h    |    80 +
 .../libcxx/include/__algorithm/ranges_max.h   |    93 +
 .../include/__algorithm/ranges_max_element.h  |    61 +
 .../libcxx/include/__algorithm/ranges_merge.h |   142 +
 .../libcxx/include/__algorithm/ranges_min.h   |    89 +
 .../include/__algorithm/ranges_min_element.h  |    74 +
 .../include/__algorithm/ranges_minmax.h       |   134 +
 .../__algorithm/ranges_minmax_element.h       |    72 +
 .../include/__algorithm/ranges_mismatch.h     |    85 +
 .../libcxx/include/__algorithm/ranges_move.h  |    71 +
 .../__algorithm/ranges_move_backward.h        |    73 +
 .../__algorithm/ranges_next_permutation.h     |    73 +
 .../include/__algorithm/ranges_none_of.h      |    68 +
 .../include/__algorithm/ranges_nth_element.h  |    80 +
 .../include/__algorithm/ranges_partial_sort.h |    78 +
 .../__algorithm/ranges_partial_sort_copy.h    |    92 +
 .../include/__algorithm/ranges_partition.h    |    83 +
 .../__algorithm/ranges_partition_copy.h       |    98 +
 .../__algorithm/ranges_partition_point.h      |    88 +
 .../include/__algorithm/ranges_pop_heap.h     |    81 +
 .../__algorithm/ranges_prev_permutation.h     |    77 +
 .../include/__algorithm/ranges_push_heap.h    |    80 +
 .../include/__algorithm/ranges_remove.h       |    64 +
 .../include/__algorithm/ranges_remove_copy.h  |    76 +
 .../__algorithm/ranges_remove_copy_if.h       |    90 +
 .../include/__algorithm/ranges_remove_if.h    |    85 +
 .../include/__algorithm/ranges_replace.h      |    74 +
 .../include/__algorithm/ranges_replace_copy.h |    91 +
 .../__algorithm/ranges_replace_copy_if.h      |    93 +
 .../include/__algorithm/ranges_replace_if.h   |    77 +
 .../include/__algorithm/ranges_reverse.h      |    83 +
 .../include/__algorithm/ranges_reverse_copy.h |    67 +
 .../include/__algorithm/ranges_rotate.h       |    71 +
 .../include/__algorithm/ranges_rotate_copy.h  |    68 +
 .../include/__algorithm/ranges_sample.h       |    74 +
 .../include/__algorithm/ranges_search.h       |   135 +
 .../include/__algorithm/ranges_search_n.h     |   117 +
 .../__algorithm/ranges_set_difference.h       |   106 +
 .../__algorithm/ranges_set_intersection.h     |   117 +
 .../ranges_set_symmetric_difference.h         |   117 +
 .../include/__algorithm/ranges_set_union.h    |   121 +
 .../include/__algorithm/ranges_shuffle.h      |    71 +
 .../libcxx/include/__algorithm/ranges_sort.h  |    79 +
 .../include/__algorithm/ranges_sort_heap.h    |    80 +
 .../__algorithm/ranges_stable_partition.h     |    88 +
 .../include/__algorithm/ranges_stable_sort.h  |    79 +
 .../include/__algorithm/ranges_swap_ranges.h  |    68 +
 .../include/__algorithm/ranges_transform.h    |   170 +
 .../include/__algorithm/ranges_unique.h       |    79 +
 .../include/__algorithm/ranges_unique_copy.h  |   116 +
 .../include/__algorithm/ranges_upper_bound.h  |    75 +
 .../cpp/libcxx/include/__algorithm/remove.h   |    45 +
 .../libcxx/include/__algorithm/remove_copy.h  |    38 +
 .../include/__algorithm/remove_copy_if.h      |    38 +
 .../libcxx/include/__algorithm/remove_if.h    |    44 +
 .../cpp/libcxx/include/__algorithm/replace.h  |    32 +
 .../libcxx/include/__algorithm/replace_copy.h |    36 +
 .../include/__algorithm/replace_copy_if.h     |    36 +
 .../libcxx/include/__algorithm/replace_if.h   |    32 +
 .../cpp/libcxx/include/__algorithm/reverse.h  |    65 +
 .../libcxx/include/__algorithm/reverse_copy.h |    32 +
 .../cpp/libcxx/include/__algorithm/rotate.h   |   221 +
 .../libcxx/include/__algorithm/rotate_copy.h  |    31 +
 .../cpp/libcxx/include/__algorithm/sample.h   |   112 +
 .../cpp/libcxx/include/__algorithm/search.h   |   201 +
 .../cpp/libcxx/include/__algorithm/search_n.h |   181 +
 .../include/__algorithm/set_difference.h      |    81 +
 .../include/__algorithm/set_intersection.h    |    99 +
 .../__algorithm/set_symmetric_difference.h    |   105 +
 .../libcxx/include/__algorithm/set_union.h    |   101 +
 .../libcxx/include/__algorithm/shift_left.h   |    56 +
 .../libcxx/include/__algorithm/shift_right.h  |   102 +
 .../cpp/libcxx/include/__algorithm/shuffle.h  |   175 +
 .../libcxx/include/__algorithm/sift_down.h    |   114 +
 .../cpp/libcxx/include/__algorithm/sort.h     |  1001 +
 .../libcxx/include/__algorithm/sort_heap.h    |    55 +
 .../include/__algorithm/stable_partition.h    |   329 +
 .../libcxx/include/__algorithm/stable_sort.h  |   247 +
 .../libcxx/include/__algorithm/swap_ranges.h  |    60 +
 .../libcxx/include/__algorithm/transform.h    |    43 +
 .../uniform_random_bit_generator_adaptor.h    |    62 +
 .../cpp/libcxx/include/__algorithm/unique.h   |    59 +
 .../libcxx/include/__algorithm/unique_copy.h  |   122 +
 .../libcxx/include/__algorithm/unwrap_iter.h  |    74 +
 .../libcxx/include/__algorithm/unwrap_range.h |    97 +
 .../libcxx/include/__algorithm/upper_bound.h  |    68 +
 app/src/main/cpp/libcxx/include/__assert      |    55 +
 .../main/cpp/libcxx/include/__availability    |   288 +
 .../main/cpp/libcxx/include/__bit/bit_cast.h  |    36 +
 .../main/cpp/libcxx/include/__bit/bit_ceil.h  |    46 +
 .../main/cpp/libcxx/include/__bit/bit_floor.h |    34 +
 .../main/cpp/libcxx/include/__bit/bit_log2.h  |    34 +
 .../main/cpp/libcxx/include/__bit/bit_width.h |    33 +
 app/src/main/cpp/libcxx/include/__bit/blsr.h  |    34 +
 .../main/cpp/libcxx/include/__bit/byteswap.h  |    55 +
 .../main/cpp/libcxx/include/__bit/countl.h    |   104 +
 .../main/cpp/libcxx/include/__bit/countr.h    |    70 +
 .../main/cpp/libcxx/include/__bit/endian.h    |    38 +
 .../cpp/libcxx/include/__bit/has_single_bit.h |    37 +
 .../main/cpp/libcxx/include/__bit/popcount.h  |    61 +
 .../main/cpp/libcxx/include/__bit/rotate.h    |    53 +
 .../main/cpp/libcxx/include/__bit_reference   |  1360 +
 .../libcxx/include/__bsd_locale_defaults.h    |    36 +
 .../libcxx/include/__bsd_locale_fallbacks.h   |   142 +
 .../libcxx/include/__charconv/chars_format.h  |    77 +
 .../include/__charconv/from_chars_result.h    |    37 +
 .../cpp/libcxx/include/__charconv/tables.h    |   154 +
 .../include/__charconv/to_chars_base_10.h     |   185 +
 .../include/__charconv/to_chars_result.h      |    37 +
 .../cpp/libcxx/include/__chrono/calendar.h    |    44 +
 .../include/__chrono/convert_to_timespec.h    |    56 +
 .../libcxx/include/__chrono/convert_to_tm.h   |   127 +
 .../main/cpp/libcxx/include/__chrono/day.h    |    84 +
 .../cpp/libcxx/include/__chrono/duration.h    |   622 +
 .../cpp/libcxx/include/__chrono/file_clock.h  |    85 +
 .../cpp/libcxx/include/__chrono/formatter.h   |   716 +
 .../cpp/libcxx/include/__chrono/hh_mm_ss.h    |   112 +
 .../include/__chrono/high_resolution_clock.h  |    36 +
 .../cpp/libcxx/include/__chrono/literals.h    |    49 +
 .../main/cpp/libcxx/include/__chrono/month.h  |   103 +
 .../libcxx/include/__chrono/month_weekday.h   |   106 +
 .../cpp/libcxx/include/__chrono/monthday.h    |   129 +
 .../cpp/libcxx/include/__chrono/ostream.h     |   238 +
 .../include/__chrono/parser_std_format_spec.h |   410 +
 .../include/__chrono/statically_widen.h       |    52 +
 .../libcxx/include/__chrono/steady_clock.h    |    44 +
 .../libcxx/include/__chrono/system_clock.h    |    54 +
 .../cpp/libcxx/include/__chrono/time_point.h  |   251 +
 .../cpp/libcxx/include/__chrono/weekday.h     |   185 +
 .../main/cpp/libcxx/include/__chrono/year.h   |   102 +
 .../cpp/libcxx/include/__chrono/year_month.h  |   101 +
 .../libcxx/include/__chrono/year_month_day.h  |   307 +
 .../include/__chrono/year_month_weekday.h     |   255 +
 .../__compare/common_comparison_category.h    |    95 +
 .../compare_partial_order_fallback.h          |    74 +
 .../__compare/compare_strong_order_fallback.h |    71 +
 .../include/__compare/compare_three_way.h     |    41 +
 .../__compare/compare_three_way_result.h      |    44 +
 .../__compare/compare_weak_order_fallback.h   |    71 +
 .../main/cpp/libcxx/include/__compare/is_eq.h |    34 +
 .../cpp/libcxx/include/__compare/ordering.h   |   326 +
 .../libcxx/include/__compare/partial_order.h  |    74 +
 .../libcxx/include/__compare/strong_order.h   |   139 +
 .../include/__compare/synth_three_way.h       |    51 +
 .../include/__compare/three_way_comparable.h  |    59 +
 .../cpp/libcxx/include/__compare/weak_order.h |   102 +
 .../libcxx/include/__concepts/arithmetic.h    |    52 +
 .../libcxx/include/__concepts/assignable.h    |    41 +
 .../include/__concepts/boolean_testable.h     |    38 +
 .../libcxx/include/__concepts/class_or_enum.h |    40 +
 .../__concepts/common_reference_with.h        |    37 +
 .../libcxx/include/__concepts/common_with.h   |    50 +
 .../libcxx/include/__concepts/constructible.h |    56 +
 .../include/__concepts/convertible_to.h       |    37 +
 .../cpp/libcxx/include/__concepts/copyable.h  |    39 +
 .../libcxx/include/__concepts/derived_from.h  |    35 +
 .../libcxx/include/__concepts/destructible.h  |    32 +
 .../include/__concepts/different_from.h       |    31 +
 .../include/__concepts/equality_comparable.h  |    54 +
 .../cpp/libcxx/include/__concepts/invocable.h |    40 +
 .../cpp/libcxx/include/__concepts/movable.h   |    39 +
 .../cpp/libcxx/include/__concepts/predicate.h |    35 +
 .../cpp/libcxx/include/__concepts/regular.h   |    33 +
 .../cpp/libcxx/include/__concepts/relation.h  |    44 +
 .../cpp/libcxx/include/__concepts/same_as.h   |    35 +
 .../libcxx/include/__concepts/semiregular.h   |    33 +
 .../cpp/libcxx/include/__concepts/swappable.h |   121 +
 .../include/__concepts/totally_ordered.h      |    58 +
 app/src/main/cpp/libcxx/include/__config      |  1255 +
 app/src/main/cpp/libcxx/include/__config_site |    39 +
 .../main/cpp/libcxx/include/__config_site.in  |    49 +
 .../include/__coroutine/coroutine_handle.h    |   203 +
 .../include/__coroutine/coroutine_traits.h    |    53 +
 .../__coroutine/noop_coroutine_handle.h       |   112 +
 .../include/__coroutine/trivial_awaitables.h  |    46 +
 app/src/main/cpp/libcxx/include/__debug       |   266 +
 .../include/__debug_utils/randomize_range.h   |    43 +
 app/src/main/cpp/libcxx/include/__errc        |   217 +
 .../include/__expected/bad_expected_access.h  |    64 +
 .../cpp/libcxx/include/__expected/expected.h  |   973 +
 .../cpp/libcxx/include/__expected/unexpect.h  |    32 +
 .../libcxx/include/__expected/unexpected.h    |   122 +
 .../include/__filesystem/copy_options.h       |    84 +
 .../include/__filesystem/directory_entry.h    |   527 +
 .../include/__filesystem/directory_iterator.h |   165 +
 .../include/__filesystem/directory_options.h  |    82 +
 .../libcxx/include/__filesystem/file_status.h |    72 +
 .../include/__filesystem/file_time_type.h     |    32 +
 .../libcxx/include/__filesystem/file_type.h   |    43 +
 .../include/__filesystem/filesystem_error.h   |   104 +
 .../libcxx/include/__filesystem/operations.h  |   201 +
 .../cpp/libcxx/include/__filesystem/path.h    |  1091 +
 .../include/__filesystem/path_iterator.h      |   134 +
 .../include/__filesystem/perm_options.h       |    77 +
 .../cpp/libcxx/include/__filesystem/perms.h   |    95 +
 .../recursive_directory_iterator.h            |   185 +
 .../libcxx/include/__filesystem/space_info.h  |    43 +
 .../cpp/libcxx/include/__filesystem/u8path.h  |   108 +
 .../main/cpp/libcxx/include/__format/buffer.h |   573 +
 .../cpp/libcxx/include/__format/concepts.h    |    78 +
 .../include/__format/container_adaptor.h      |    70 +
 .../include/__format/enable_insertable.h      |    35 +
 .../include/__format/escaped_output_table.h   |  1038 +
 .../extended_grapheme_cluster_table.h         |  1661 ++
 .../cpp/libcxx/include/__format/format_arg.h  |   302 +
 .../include/__format/format_arg_store.h       |   254 +
 .../cpp/libcxx/include/__format/format_args.h |    80 +
 .../libcxx/include/__format/format_context.h  |   223 +
 .../libcxx/include/__format/format_error.h    |    55 +
 .../include/__format/format_functions.h       |   661 +
 .../cpp/libcxx/include/__format/format_fwd.h  |    39 +
 .../include/__format/format_parse_context.h   |   100 +
 .../libcxx/include/__format/format_string.h   |   163 +
 .../include/__format/format_to_n_result.h     |    35 +
 .../cpp/libcxx/include/__format/formatter.h   |    54 +
 .../libcxx/include/__format/formatter_bool.h  |    78 +
 .../libcxx/include/__format/formatter_char.h  |    93 +
 .../__format/formatter_floating_point.h       |   757 +
 .../include/__format/formatter_integer.h      |   107 +
 .../include/__format/formatter_integral.h     |   363 +
 .../include/__format/formatter_output.h       |   570 +
 .../include/__format/formatter_pointer.h      |    73 +
 .../include/__format/formatter_string.h       |   159 +
 .../libcxx/include/__format/formatter_tuple.h |   178 +
 .../include/__format/parser_std_format_spec.h |   954 +
 .../__format/range_default_formatter.h        |   201 +
 .../libcxx/include/__format/range_formatter.h |   255 +
 .../cpp/libcxx/include/__format/unicode.h     |   489 +
 .../include/__functional/binary_function.h    |    54 +
 .../include/__functional/binary_negate.h      |    50 +
 .../cpp/libcxx/include/__functional/bind.h    |   389 +
 .../libcxx/include/__functional/bind_back.h   |    64 +
 .../libcxx/include/__functional/bind_front.h  |    58 +
 .../libcxx/include/__functional/binder1st.h   |    53 +
 .../libcxx/include/__functional/binder2nd.h   |    53 +
 .../__functional/boyer_moore_searcher.h       |   315 +
 .../cpp/libcxx/include/__functional/compose.h |    52 +
 .../include/__functional/default_searcher.h   |    57 +
 .../libcxx/include/__functional/function.h    |  1216 +
 .../cpp/libcxx/include/__functional/hash.h    |   693 +
 .../libcxx/include/__functional/identity.h    |    46 +
 .../cpp/libcxx/include/__functional/invoke.h  |   546 +
 .../include/__functional/is_transparent.h     |    35 +
 .../cpp/libcxx/include/__functional/mem_fn.h  |    59 +
 .../libcxx/include/__functional/mem_fun_ref.h |   173 +
 .../cpp/libcxx/include/__functional/not_fn.h  |    54 +
 .../libcxx/include/__functional/operations.h  |   580 +
 .../include/__functional/perfect_forward.h    |    94 +
 .../__functional/pointer_to_binary_function.h |    46 +
 .../__functional/pointer_to_unary_function.h  |    46 +
 .../include/__functional/ranges_operations.h  |   100 +
 .../include/__functional/reference_wrapper.h  |   105 +
 .../include/__functional/unary_function.h     |    51 +
 .../include/__functional/unary_negate.h       |    47 +
 .../libcxx/include/__functional/unwrap_ref.h  |    58 +
 .../include/__functional/weak_result_type.h   |   294 +
 app/src/main/cpp/libcxx/include/__fwd/array.h |    26 +
 app/src/main/cpp/libcxx/include/__fwd/get.h   |   115 +
 app/src/main/cpp/libcxx/include/__fwd/hash.h  |    25 +
 .../libcxx/include/__fwd/memory_resource.h    |    27 +
 app/src/main/cpp/libcxx/include/__fwd/pair.h  |    25 +
 app/src/main/cpp/libcxx/include/__fwd/span.h  |    37 +
 .../main/cpp/libcxx/include/__fwd/string.h    |   110 +
 .../cpp/libcxx/include/__fwd/string_view.h    |    50 +
 .../main/cpp/libcxx/include/__fwd/subrange.h  |    38 +
 app/src/main/cpp/libcxx/include/__fwd/tuple.h |    29 +
 app/src/main/cpp/libcxx/include/__hash_table  |  2715 ++
 app/src/main/cpp/libcxx/include/__ios/fpos.h  |    79 +
 .../cpp/libcxx/include/__iterator/access.h    |   129 +
 .../cpp/libcxx/include/__iterator/advance.h   |   203 +
 .../include/__iterator/back_insert_iterator.h |    73 +
 .../libcxx/include/__iterator/bounded_iter.h  |   231 +
 .../include/__iterator/common_iterator.h      |   281 +
 .../cpp/libcxx/include/__iterator/concepts.h  |   300 +
 .../include/__iterator/counted_iterator.h     |   310 +
 .../main/cpp/libcxx/include/__iterator/data.h |    51 +
 .../include/__iterator/default_sentinel.h     |    30 +
 .../cpp/libcxx/include/__iterator/distance.h  |   108 +
 .../cpp/libcxx/include/__iterator/empty.h     |    44 +
 .../include/__iterator/erase_if_container.h   |    40 +
 .../__iterator/front_insert_iterator.h        |    71 +
 .../include/__iterator/incrementable_traits.h |    78 +
 .../__iterator/indirectly_comparable.h        |    34 +
 .../include/__iterator/insert_iterator.h      |    81 +
 .../include/__iterator/istream_iterator.h     |   105 +
 .../include/__iterator/istreambuf_iterator.h  |   119 +
 .../cpp/libcxx/include/__iterator/iter_move.h |   104 +
 .../cpp/libcxx/include/__iterator/iter_swap.h |   113 +
 .../cpp/libcxx/include/__iterator/iterator.h  |    35 +
 .../include/__iterator/iterator_traits.h      |   539 +
 .../include/__iterator/iterator_with_data.h   |   100 +
 .../cpp/libcxx/include/__iterator/mergeable.h |    41 +
 .../libcxx/include/__iterator/move_iterator.h |   335 +
 .../libcxx/include/__iterator/move_sentinel.h |    59 +
 .../main/cpp/libcxx/include/__iterator/next.h |    84 +
 .../include/__iterator/ostream_iterator.h     |    71 +
 .../include/__iterator/ostreambuf_iterator.h  |    77 +
 .../libcxx/include/__iterator/permutable.h    |    35 +
 .../main/cpp/libcxx/include/__iterator/prev.h |    77 +
 .../cpp/libcxx/include/__iterator/projected.h |    41 +
 .../include/__iterator/readable_traits.h      |    92 +
 .../include/__iterator/reverse_access.h       |   100 +
 .../include/__iterator/reverse_iterator.h     |   533 +
 .../include/__iterator/segmented_iterator.h   |    79 +
 .../main/cpp/libcxx/include/__iterator/size.h |    59 +
 .../cpp/libcxx/include/__iterator/sortable.h  |    37 +
 .../include/__iterator/unreachable_sentinel.h |    38 +
 .../cpp/libcxx/include/__iterator/wrap_iter.h |   286 +
 app/src/main/cpp/libcxx/include/__locale      |  1816 ++
 app/src/main/cpp/libcxx/include/__mbstate_t.h |    44 +
 .../cpp/libcxx/include/__memory/addressof.h   |    76 +
 .../main/cpp/libcxx/include/__memory/align.h  |    25 +
 .../include/__memory/allocate_at_least.h      |    62 +
 .../include/__memory/allocation_guard.h       |    83 +
 .../cpp/libcxx/include/__memory/allocator.h   |   273 +
 .../libcxx/include/__memory/allocator_arg_t.h |    80 +
 .../include/__memory/allocator_destructor.h   |    42 +
 .../include/__memory/allocator_traits.h       |   410 +
 .../libcxx/include/__memory/assume_aligned.h  |    46 +
 .../cpp/libcxx/include/__memory/auto_ptr.h    |    84 +
 .../include/__memory/builtin_new_allocator.h  |    70 +
 .../libcxx/include/__memory/compressed_pair.h |   177 +
 .../cpp/libcxx/include/__memory/concepts.h    |    69 +
 .../libcxx/include/__memory/construct_at.h    |   120 +
 .../cpp/libcxx/include/__memory/destruct_n.h  |    64 +
 .../libcxx/include/__memory/pointer_traits.h  |   242 +
 .../include/__memory/ranges_construct_at.h    |   125 +
 .../ranges_uninitialized_algorithms.h         |   319 +
 .../include/__memory/raw_storage_iterator.h   |    70 +
 .../cpp/libcxx/include/__memory/shared_ptr.h  |  2008 ++
 .../libcxx/include/__memory/swap_allocator.h  |    54 +
 .../cpp/libcxx/include/__memory/temp_value.h  |    56 +
 .../include/__memory/temporary_buffer.h       |    87 +
 .../__memory/uninitialized_algorithms.h       |   646 +
 .../cpp/libcxx/include/__memory/unique_ptr.h  |   746 +
 .../libcxx/include/__memory/uses_allocator.h  |    59 +
 .../__memory/uses_allocator_construction.h    |   221 +
 .../cpp/libcxx/include/__memory/voidify.h     |    30 +
 .../__memory_resource/memory_resource.h       |    75 +
 .../monotonic_buffer_resource.h               |   120 +
 .../__memory_resource/polymorphic_allocator.h |   224 +
 .../include/__memory_resource/pool_options.h  |    38 +
 .../synchronized_pool_resource.h              |    94 +
 .../unsynchronized_pool_resource.h            |   106 +
 app/src/main/cpp/libcxx/include/__mutex_base  |   523 +
 app/src/main/cpp/libcxx/include/__node_handle |   254 +
 .../cpp/libcxx/include/__numeric/accumulate.h |    52 +
 .../include/__numeric/adjacent_difference.h   |    72 +
 .../libcxx/include/__numeric/exclusive_scan.h |    53 +
 .../cpp/libcxx/include/__numeric/gcd_lcm.h    |   100 +
 .../libcxx/include/__numeric/inclusive_scan.h |    60 +
 .../libcxx/include/__numeric/inner_product.h  |    53 +
 .../main/cpp/libcxx/include/__numeric/iota.h  |    32 +
 .../cpp/libcxx/include/__numeric/midpoint.h   |    95 +
 .../libcxx/include/__numeric/partial_sum.h    |    70 +
 .../cpp/libcxx/include/__numeric/reduce.h     |    47 +
 .../__numeric/transform_exclusive_scan.h      |    49 +
 .../__numeric/transform_inclusive_scan.h      |    58 +
 .../include/__numeric/transform_reduce.h      |    54 +
 .../include/__random/bernoulli_distribution.h |   145 +
 .../include/__random/binomial_distribution.h  |   228 +
 .../include/__random/cauchy_distribution.h    |   164 +
 .../__random/chi_squared_distribution.h       |   144 +
 .../include/__random/clamp_to_integral.h      |    60 +
 .../include/__random/default_random_engine.h  |    25 +
 .../include/__random/discard_block_engine.h   |   205 +
 .../include/__random/discrete_distribution.h  |   263 +
 .../__random/exponential_distribution.h       |   157 +
 .../__random/extreme_value_distribution.h     |   163 +
 .../include/__random/fisher_f_distribution.h  |   162 +
 .../include/__random/gamma_distribution.h     |   215 +
 .../include/__random/generate_canonical.h     |    53 +
 .../include/__random/geometric_distribution.h |   143 +
 .../__random/independent_bits_engine.h        |   267 +
 .../include/__random/is_seed_sequence.h       |    31 +
 .../cpp/libcxx/include/__random/is_valid.h    |    61 +
 .../cpp/libcxx/include/__random/knuth_b.h     |    26 +
 .../__random/linear_congruential_engine.h     |   398 +
 .../main/cpp/libcxx/include/__random/log2.h   |    71 +
 .../include/__random/lognormal_distribution.h |   299 +
 .../__random/mersenne_twister_engine.h        |   534 +
 .../__random/negative_binomial_distribution.h |   183 +
 .../include/__random/normal_distribution.h    |   210 +
 .../piecewise_constant_distribution.h         |   358 +
 .../__random/piecewise_linear_distribution.h  |   374 +
 .../include/__random/poisson_distribution.h   |   280 +
 .../libcxx/include/__random/random_device.h   |    84 +
 .../main/cpp/libcxx/include/__random/ranlux.h |    31 +
 .../cpp/libcxx/include/__random/seed_seq.h    |   177 +
 .../include/__random/shuffle_order_engine.h   |   283 +
 .../include/__random/student_t_distribution.h |   155 +
 .../__random/subtract_with_carry_engine.h     |   352 +
 .../__random/uniform_int_distribution.h       |   292 +
 .../__random/uniform_random_bit_generator.h   |    45 +
 .../__random/uniform_real_distribution.h      |   162 +
 .../include/__random/weibull_distribution.h   |   155 +
 .../main/cpp/libcxx/include/__ranges/access.h |   230 +
 .../main/cpp/libcxx/include/__ranges/all.h    |    84 +
 .../libcxx/include/__ranges/as_rvalue_view.h  |   137 +
 .../cpp/libcxx/include/__ranges/common_view.h |   137 +
 .../cpp/libcxx/include/__ranges/concepts.h    |   147 +
 .../libcxx/include/__ranges/copyable_box.h    |   180 +
 .../cpp/libcxx/include/__ranges/counted.h     |    82 +
 .../cpp/libcxx/include/__ranges/dangling.h    |    42 +
 .../main/cpp/libcxx/include/__ranges/data.h   |   112 +
 .../cpp/libcxx/include/__ranges/drop_view.h   |   308 +
 .../libcxx/include/__ranges/drop_while_view.h |   129 +
 .../libcxx/include/__ranges/elements_view.h   |   423 +
 .../main/cpp/libcxx/include/__ranges/empty.h  |    82 +
 .../cpp/libcxx/include/__ranges/empty_view.h  |    53 +
 .../include/__ranges/enable_borrowed_range.h  |    40 +
 .../cpp/libcxx/include/__ranges/enable_view.h |    50 +
 .../cpp/libcxx/include/__ranges/filter_view.h |   280 +
 .../cpp/libcxx/include/__ranges/iota_view.h   |   434 +
 .../libcxx/include/__ranges/istream_view.h    |   149 +
 .../cpp/libcxx/include/__ranges/join_view.h   |   452 +
 .../libcxx/include/__ranges/lazy_split_view.h |   465 +
 .../include/__ranges/non_propagating_cache.h  |   114 +
 .../cpp/libcxx/include/__ranges/owning_view.h |    83 +
 .../libcxx/include/__ranges/range_adaptor.h   |    77 +
 .../main/cpp/libcxx/include/__ranges/rbegin.h |   131 +
 .../cpp/libcxx/include/__ranges/ref_view.h    |    88 +
 .../main/cpp/libcxx/include/__ranges/rend.h   |   135 +
 .../libcxx/include/__ranges/reverse_view.h    |   191 +
 .../cpp/libcxx/include/__ranges/single_view.h |   102 +
 .../main/cpp/libcxx/include/__ranges/size.h   |   148 +
 .../cpp/libcxx/include/__ranges/split_view.h  |   232 +
 .../cpp/libcxx/include/__ranges/subrange.h    |   291 +
 .../cpp/libcxx/include/__ranges/take_view.h   |   343 +
 .../libcxx/include/__ranges/take_while_view.h |   183 +
 .../libcxx/include/__ranges/transform_view.h  |   467 +
 .../libcxx/include/__ranges/view_interface.h  |   177 +
 .../main/cpp/libcxx/include/__ranges/views.h  |    35 +
 .../cpp/libcxx/include/__ranges/zip_view.h    |   512 +
 .../main/cpp/libcxx/include/__split_buffer    |   656 +
 app/src/main/cpp/libcxx/include/__std_stream  |   361 +
 .../cpp/libcxx/include/__string/char_traits.h |   836 +
 .../include/__string/extern_template_lists.h  |   131 +
 .../include/__support/android/locale_bionic.h |    72 +
 .../include/__support/fuchsia/xlocale.h       |    22 +
 .../libcxx/include/__support/ibm/gettod_zos.h |    54 +
 .../include/__support/ibm/locale_mgmt_zos.h   |    53 +
 .../libcxx/include/__support/ibm/nanosleep.h  |    55 +
 .../libcxx/include/__support/ibm/xlocale.h    |   129 +
 .../libcxx/include/__support/musl/xlocale.h   |    52 +
 .../libcxx/include/__support/newlib/xlocale.h |    23 +
 .../include/__support/openbsd/xlocale.h       |    35 +
 .../include/__support/solaris/floatingpoint.h |    13 +
 .../libcxx/include/__support/solaris/wchar.h  |    46 +
 .../include/__support/solaris/xlocale.h       |    75 +
 .../include/__support/win32/locale_win32.h    |   282 +
 .../__support/xlocale/__nop_locale_mgmt.h     |    47 +
 .../__support/xlocale/__posix_l_fallback.h    |   115 +
 .../__support/xlocale/__strtonum_fallback.h   |    69 +
 .../include/__thread/poll_with_backoff.h      |    71 +
 .../include/__thread/timed_backoff_policy.h   |    46 +
 .../cpp/libcxx/include/__threading_support    |   706 +
 app/src/main/cpp/libcxx/include/__tree        |  2758 ++
 .../cpp/libcxx/include/__tuple_dir/apply_cv.h |    70 +
 .../include/__tuple_dir/make_tuple_types.h    |    84 +
 .../libcxx/include/__tuple_dir/pair_like.h    |    32 +
 .../include/__tuple_dir/sfinae_helpers.h      |   196 +
 .../include/__tuple_dir/tuple_element.h       |    93 +
 .../include/__tuple_dir/tuple_indices.h       |    37 +
 .../libcxx/include/__tuple_dir/tuple_like.h   |    51 +
 .../include/__tuple_dir/tuple_like_ext.h      |    44 +
 .../libcxx/include/__tuple_dir/tuple_size.h   |    75 +
 .../libcxx/include/__tuple_dir/tuple_types.h  |    24 +
 .../libcxx/include/__type_traits/add_const.h  |    30 +
 .../cpp/libcxx/include/__type_traits/add_cv.h |    30 +
 .../__type_traits/add_lvalue_reference.h      |    53 +
 .../include/__type_traits/add_pointer.h       |    55 +
 .../__type_traits/add_rvalue_reference.h      |    54 +
 .../include/__type_traits/add_volatile.h      |    30 +
 .../include/__type_traits/aligned_storage.h   |   138 +
 .../include/__type_traits/aligned_union.h     |    56 +
 .../include/__type_traits/alignment_of.h      |    32 +
 .../libcxx/include/__type_traits/apply_cv.h   |    75 +
 .../include/__type_traits/can_extract_key.h   |    56 +
 .../include/__type_traits/common_reference.h  |   188 +
 .../include/__type_traits/common_type.h       |   134 +
 .../include/__type_traits/conditional.h       |    58 +
 .../include/__type_traits/conjunction.h       |    58 +
 .../libcxx/include/__type_traits/copy_cv.h    |    54 +
 .../libcxx/include/__type_traits/copy_cvref.h |    46 +
 .../cpp/libcxx/include/__type_traits/decay.h  |    71 +
 .../include/__type_traits/dependent_type.h    |    25 +
 .../include/__type_traits/disjunction.h       |    58 +
 .../libcxx/include/__type_traits/enable_if.h  |    31 +
 .../cpp/libcxx/include/__type_traits/extent.h |    55 +
 .../has_unique_object_representation.h        |    36 +
 .../__type_traits/has_virtual_destructor.h    |    31 +
 .../include/__type_traits/integral_constant.h |    50 +
 .../include/__type_traits/is_abstract.h       |    31 +
 .../include/__type_traits/is_aggregate.h      |    33 +
 .../include/__type_traits/is_allocator.h      |    36 +
 .../__type_traits/is_always_bitcastable.h     |    82 +
 .../include/__type_traits/is_arithmetic.h     |    34 +
 .../libcxx/include/__type_traits/is_array.h   |    52 +
 .../include/__type_traits/is_assignable.h     |    31 +
 .../libcxx/include/__type_traits/is_base_of.h |    32 +
 .../include/__type_traits/is_bounded_array.h  |    38 +
 .../include/__type_traits/is_callable.h       |    32 +
 .../include/__type_traits/is_char_like_type.h |    28 +
 .../libcxx/include/__type_traits/is_class.h   |    31 +
 .../include/__type_traits/is_compound.h       |    46 +
 .../libcxx/include/__type_traits/is_const.h   |    45 +
 .../__type_traits/is_constant_evaluated.h     |    32 +
 .../include/__type_traits/is_constructible.h  |    33 +
 .../include/__type_traits/is_convertible.h    |   108 +
 .../__type_traits/is_copy_assignable.h        |    37 +
 .../__type_traits/is_copy_constructible.h     |    36 +
 .../__type_traits/is_core_convertible.h       |    36 +
 .../__type_traits/is_default_constructible.h  |    33 +
 .../include/__type_traits/is_destructible.h   |   102 +
 .../libcxx/include/__type_traits/is_empty.h   |    32 +
 .../libcxx/include/__type_traits/is_enum.h    |    31 +
 .../libcxx/include/__type_traits/is_final.h   |    36 +
 .../include/__type_traits/is_floating_point.h |    37 +
 .../include/__type_traits/is_function.h       |    43 +
 .../include/__type_traits/is_fundamental.h    |    49 +
 .../is_implicitly_default_constructible.h     |    48 +
 .../include/__type_traits/is_integral.h       |    72 +
 .../include/__type_traits/is_literal_type.h   |    34 +
 .../is_member_function_pointer.h              |    64 +
 .../__type_traits/is_member_object_pointer.h  |    46 +
 .../include/__type_traits/is_member_pointer.h |    46 +
 .../__type_traits/is_move_assignable.h        |    36 +
 .../__type_traits/is_move_constructible.h     |    34 +
 .../__type_traits/is_nothrow_assignable.h     |    32 +
 .../__type_traits/is_nothrow_constructible.h  |    78 +
 .../__type_traits/is_nothrow_convertible.h    |    53 +
 .../is_nothrow_copy_assignable.h              |    38 +
 .../is_nothrow_copy_constructible.h           |    48 +
 .../is_nothrow_default_constructible.h        |    32 +
 .../__type_traits/is_nothrow_destructible.h   |    89 +
 .../is_nothrow_move_assignable.h              |    37 +
 .../is_nothrow_move_constructible.h           |    45 +
 .../include/__type_traits/is_null_pointer.h   |    41 +
 .../libcxx/include/__type_traits/is_object.h  |    52 +
 .../cpp/libcxx/include/__type_traits/is_pod.h |    31 +
 .../libcxx/include/__type_traits/is_pointer.h |    57 +
 .../include/__type_traits/is_polymorphic.h    |    32 +
 .../__type_traits/is_primary_template.h       |    34 +
 .../include/__type_traits/is_reference.h      |    70 +
 .../__type_traits/is_reference_wrapper.h      |    31 +
 .../include/__type_traits/is_referenceable.h  |    41 +
 .../libcxx/include/__type_traits/is_same.h    |    44 +
 .../libcxx/include/__type_traits/is_scalar.h  |    62 +
 .../include/__type_traits/is_scoped_enum.h    |    42 +
 .../libcxx/include/__type_traits/is_signed.h  |    57 +
 .../include/__type_traits/is_signed_integer.h |    33 +
 .../include/__type_traits/is_specialization.h |    45 +
 .../__type_traits/is_standard_layout.h        |    32 +
 .../include/__type_traits/is_swappable.h      |   165 +
 .../libcxx/include/__type_traits/is_trivial.h |    32 +
 .../__type_traits/is_trivially_assignable.h   |    33 +
 .../is_trivially_constructible.h              |    34 +
 .../is_trivially_copy_assignable.h            |    38 +
 .../is_trivially_copy_constructible.h         |    33 +
 .../__type_traits/is_trivially_copyable.h     |    32 +
 .../is_trivially_default_constructible.h      |    32 +
 .../__type_traits/is_trivially_destructible.h |    45 +
 .../is_trivially_move_assignable.h            |    36 +
 .../is_trivially_move_constructible.h         |    33 +
 .../__type_traits/is_unbounded_array.h        |    37 +
 .../libcxx/include/__type_traits/is_union.h   |    31 +
 .../include/__type_traits/is_unsigned.h       |    57 +
 .../__type_traits/is_unsigned_integer.h       |    33 +
 .../__type_traits/is_valid_expansion.h        |    31 +
 .../libcxx/include/__type_traits/is_void.h    |    47 +
 .../include/__type_traits/is_volatile.h       |    45 +
 .../cpp/libcxx/include/__type_traits/lazy.h   |    25 +
 .../__type_traits/make_32_64_or_128_bit.h     |    48 +
 .../__type_traits/make_const_lvalue_ref.h     |    26 +
 .../include/__type_traits/make_signed.h       |    86 +
 .../include/__type_traits/make_unsigned.h     |    99 +
 .../include/__type_traits/maybe_const.h       |    26 +
 .../cpp/libcxx/include/__type_traits/nat.h    |    32 +
 .../libcxx/include/__type_traits/negation.h   |    33 +
 .../noexcept_move_assign_container.h          |    35 +
 .../libcxx/include/__type_traits/promote.h    |    99 +
 .../cpp/libcxx/include/__type_traits/rank.h   |    46 +
 .../__type_traits/remove_all_extents.h        |    47 +
 .../include/__type_traits/remove_const.h      |    42 +
 .../include/__type_traits/remove_const_ref.h  |    27 +
 .../libcxx/include/__type_traits/remove_cv.h  |    44 +
 .../include/__type_traits/remove_cvref.h      |    45 +
 .../include/__type_traits/remove_extent.h     |    47 +
 .../include/__type_traits/remove_pointer.h    |    45 +
 .../include/__type_traits/remove_reference.h  |    44 +
 .../include/__type_traits/remove_volatile.h   |    42 +
 .../libcxx/include/__type_traits/result_of.h  |    39 +
 .../include/__type_traits/strip_signature.h   |    79 +
 .../include/__type_traits/type_identity.h     |    33 +
 .../libcxx/include/__type_traits/type_list.h  |    44 +
 .../include/__type_traits/underlying_type.h   |    41 +
 .../cpp/libcxx/include/__type_traits/void_t.h |    29 +
 .../main/cpp/libcxx/include/__undef_macros    |    16 +
 .../cpp/libcxx/include/__utility/as_const.h   |    33 +
 .../cpp/libcxx/include/__utility/auto_cast.h  |    22 +
 .../main/cpp/libcxx/include/__utility/cmp.h   |   111 +
 .../include/__utility/convert_to_integral.h   |    72 +
 .../cpp/libcxx/include/__utility/declval.h    |    34 +
 .../include/__utility/exception_guard.h       |   128 +
 .../cpp/libcxx/include/__utility/exchange.h   |    38 +
 .../cpp/libcxx/include/__utility/forward.h    |    38 +
 .../libcxx/include/__utility/forward_like.h   |    46 +
 .../cpp/libcxx/include/__utility/in_place.h   |    59 +
 .../include/__utility/integer_sequence.h      |   153 +
 .../main/cpp/libcxx/include/__utility/move.h  |    44 +
 .../main/cpp/libcxx/include/__utility/pair.h  |   721 +
 .../include/__utility/piecewise_construct.h   |    29 +
 .../libcxx/include/__utility/priority_tag.h   |    26 +
 .../cpp/libcxx/include/__utility/rel_ops.h    |    59 +
 .../main/cpp/libcxx/include/__utility/swap.h  |    54 +
 .../libcxx/include/__utility/to_underlying.h  |    40 +
 .../libcxx/include/__utility/unreachable.h    |    34 +
 .../cpp/libcxx/include/__variant/monostate.h  |    64 +
 .../main/cpp/libcxx/include/__verbose_abort   |    57 +
 .../cpp/libcxx/include/abi/CMakeLists.txt     |    39 +
 .../cpp/libcxx/include/abi/__cxxabi_config.h  |   106 +
 app/src/main/cpp/libcxx/include/abi/cxxabi.h  |   177 +
 app/src/main/cpp/libcxx/include/algorithm     |  1926 ++
 app/src/main/cpp/libcxx/include/any           |   712 +
 app/src/main/cpp/libcxx/include/array         |   542 +
 app/src/main/cpp/libcxx/include/atomic        |  2673 ++
 app/src/main/cpp/libcxx/include/barrier       |   339 +
 app/src/main/cpp/libcxx/include/bit           |    91 +
 app/src/main/cpp/libcxx/include/bitset        |  1159 +
 app/src/main/cpp/libcxx/include/cassert       |    32 +
 app/src/main/cpp/libcxx/include/ccomplex      |    27 +
 app/src/main/cpp/libcxx/include/cctype        |   129 +
 app/src/main/cpp/libcxx/include/cerrno        |    42 +
 app/src/main/cpp/libcxx/include/cfenv         |    91 +
 app/src/main/cpp/libcxx/include/cfloat        |    89 +
 app/src/main/cpp/libcxx/include/charconv      |   847 +
 app/src/main/cpp/libcxx/include/chrono        |   788 +
 app/src/main/cpp/libcxx/include/cinttypes     |   271 +
 app/src/main/cpp/libcxx/include/ciso646       |    25 +
 app/src/main/cpp/libcxx/include/climits       |    57 +
 app/src/main/cpp/libcxx/include/clocale       |    62 +
 app/src/main/cpp/libcxx/include/cmath         |   836 +
 app/src/main/cpp/libcxx/include/codecvt       |   571 +
 app/src/main/cpp/libcxx/include/compare       |   167 +
 app/src/main/cpp/libcxx/include/complex       |  1568 +
 app/src/main/cpp/libcxx/include/complex.h     |    32 +
 app/src/main/cpp/libcxx/include/concepts      |   166 +
 .../cpp/libcxx/include/condition_variable     |   276 +
 app/src/main/cpp/libcxx/include/coroutine     |    63 +
 app/src/main/cpp/libcxx/include/csetjmp       |    57 +
 app/src/main/cpp/libcxx/include/csignal       |    65 +
 app/src/main/cpp/libcxx/include/cstdarg       |    55 +
 app/src/main/cpp/libcxx/include/cstdbool      |    32 +
 app/src/main/cpp/libcxx/include/cstddef       |   146 +
 app/src/main/cpp/libcxx/include/cstdint       |   200 +
 app/src/main/cpp/libcxx/include/cstdio        |   179 +
 app/src/main/cpp/libcxx/include/cstdlib       |   153 +
 app/src/main/cpp/libcxx/include/cstring       |   152 +
 app/src/main/cpp/libcxx/include/ctgmath       |    29 +
 app/src/main/cpp/libcxx/include/ctime         |    87 +
 app/src/main/cpp/libcxx/include/ctype.h       |    61 +
 app/src/main/cpp/libcxx/include/cuchar        |    76 +
 app/src/main/cpp/libcxx/include/cwchar        |   244 +
 app/src/main/cpp/libcxx/include/cwctype       |    98 +
 app/src/main/cpp/libcxx/include/deque         |  2443 ++
 app/src/main/cpp/libcxx/include/errno.h       |   399 +
 app/src/main/cpp/libcxx/include/exception     |   384 +
 app/src/main/cpp/libcxx/include/execution     |    25 +
 app/src/main/cpp/libcxx/include/expected      |    54 +
 .../cpp/libcxx/include/experimental/__config  |    66 +
 .../cpp/libcxx/include/experimental/__memory  |   117 +
 .../cpp/libcxx/include/experimental/algorithm |    53 +
 .../cpp/libcxx/include/experimental/coroutine |   344 +
 .../cpp/libcxx/include/experimental/deque     |    52 +
 .../libcxx/include/experimental/forward_list  |    52 +
 .../libcxx/include/experimental/functional    |   436 +
 .../cpp/libcxx/include/experimental/iterator  |   126 +
 .../main/cpp/libcxx/include/experimental/list |    52 +
 .../main/cpp/libcxx/include/experimental/map  |    62 +
 .../include/experimental/memory_resource      |   443 +
 .../include/experimental/propagate_const      |   581 +
 .../cpp/libcxx/include/experimental/regex     |    69 +
 .../main/cpp/libcxx/include/experimental/set  |    62 +
 .../main/cpp/libcxx/include/experimental/simd |  1585 +
 .../cpp/libcxx/include/experimental/string    |    73 +
 .../libcxx/include/experimental/type_traits   |   155 +
 .../libcxx/include/experimental/unordered_map |    78 +
 .../libcxx/include/experimental/unordered_set |    64 +
 .../cpp/libcxx/include/experimental/utility   |    47 +
 .../cpp/libcxx/include/experimental/vector    |    52 +
 app/src/main/cpp/libcxx/include/ext/__hash    |   135 +
 app/src/main/cpp/libcxx/include/ext/hash_map  |   990 +
 app/src/main/cpp/libcxx/include/ext/hash_set  |   670 +
 app/src/main/cpp/libcxx/include/fenv.h        |   118 +
 app/src/main/cpp/libcxx/include/filesystem    |   469 +
 app/src/main/cpp/libcxx/include/float.h       |    95 +
 app/src/main/cpp/libcxx/include/format        |   212 +
 app/src/main/cpp/libcxx/include/forward_list  |  1803 ++
 app/src/main/cpp/libcxx/include/fstream       |  1763 ++
 app/src/main/cpp/libcxx/include/functional    |   550 +
 app/src/main/cpp/libcxx/include/future        |  2457 ++
 .../main/cpp/libcxx/include/initializer_list  |   118 +
 app/src/main/cpp/libcxx/include/inttypes.h    |   264 +
 app/src/main/cpp/libcxx/include/iomanip       |   663 +
 app/src/main/cpp/libcxx/include/ios           |  1054 +
 app/src/main/cpp/libcxx/include/iosfwd        |   266 +
 app/src/main/cpp/libcxx/include/iostream      |    68 +
 app/src/main/cpp/libcxx/include/istream       |  1647 +
 app/src/main/cpp/libcxx/include/iterator      |   742 +
 app/src/main/cpp/libcxx/include/latch         |   114 +
 app/src/main/cpp/libcxx/include/libcxx.imp    |    45 +
 app/src/main/cpp/libcxx/include/limits        |   830 +
 app/src/main/cpp/libcxx/include/limits.h      |    71 +
 app/src/main/cpp/libcxx/include/list          |  2386 ++
 app/src/main/cpp/libcxx/include/locale        |  4368 +++
 app/src/main/cpp/libcxx/include/locale.h      |    50 +
 app/src/main/cpp/libcxx/include/map           |  2361 ++
 app/src/main/cpp/libcxx/include/math.h        |  1710 ++
 app/src/main/cpp/libcxx/include/memory        |   934 +
 .../main/cpp/libcxx/include/memory_resource   |    65 +
 .../cpp/libcxx/include/module.modulemap.in    |  1724 ++
 app/src/main/cpp/libcxx/include/mutex         |   712 +
 app/src/main/cpp/libcxx/include/new           |   410 +
 app/src/main/cpp/libcxx/include/numbers       |   138 +
 app/src/main/cpp/libcxx/include/numeric       |   181 +
 app/src/main/cpp/libcxx/include/optional      |  1591 +
 app/src/main/cpp/libcxx/include/ostream       |  1197 +
 app/src/main/cpp/libcxx/include/queue         |   970 +
 app/src/main/cpp/libcxx/include/random        |  1745 ++
 app/src/main/cpp/libcxx/include/ranges        |   400 +
 app/src/main/cpp/libcxx/include/ratio         |   532 +
 app/src/main/cpp/libcxx/include/regex         |  6876 +++++
 .../main/cpp/libcxx/include/scoped_allocator  |   733 +
 app/src/main/cpp/libcxx/include/semaphore     |   191 +
 app/src/main/cpp/libcxx/include/set           |  1605 +
 app/src/main/cpp/libcxx/include/setjmp.h      |    46 +
 app/src/main/cpp/libcxx/include/shared_mutex  |   509 +
 .../main/cpp/libcxx/include/source_location   |    85 +
 app/src/main/cpp/libcxx/include/span          |   598 +
 app/src/main/cpp/libcxx/include/sstream       |   883 +
 app/src/main/cpp/libcxx/include/stack         |   371 +
 app/src/main/cpp/libcxx/include/stdatomic.h   |   235 +
 app/src/main/cpp/libcxx/include/stdbool.h     |    40 +
 app/src/main/cpp/libcxx/include/stddef.h      |    53 +
 app/src/main/cpp/libcxx/include/stdexcept     |   310 +
 app/src/main/cpp/libcxx/include/stdint.h      |   127 +
 app/src/main/cpp/libcxx/include/stdio.h       |   121 +
 app/src/main/cpp/libcxx/include/stdlib.h      |   163 +
 app/src/main/cpp/libcxx/include/streambuf     |   503 +
 app/src/main/cpp/libcxx/include/string        |  4633 +++
 app/src/main/cpp/libcxx/include/string.h      |   111 +
 app/src/main/cpp/libcxx/include/string_view   |  1031 +
 app/src/main/cpp/libcxx/include/strstream     |   409 +
 app/src/main/cpp/libcxx/include/system_error  |   548 +
 app/src/main/cpp/libcxx/include/tgmath.h      |    34 +
 app/src/main/cpp/libcxx/include/thread        |   421 +
 app/src/main/cpp/libcxx/include/tuple         |  1863 ++
 app/src/main/cpp/libcxx/include/type_traits   |   545 +
 app/src/main/cpp/libcxx/include/typeindex     |   126 +
 app/src/main/cpp/libcxx/include/typeinfo      |   406 +
 app/src/main/cpp/libcxx/include/uchar.h       |    54 +
 app/src/main/cpp/libcxx/include/unordered_map |  2653 ++
 app/src/main/cpp/libcxx/include/unordered_set |  1824 ++
 app/src/main/cpp/libcxx/include/utility       |   282 +
 app/src/main/cpp/libcxx/include/valarray      |  4940 +++
 app/src/main/cpp/libcxx/include/variant       |  1839 ++
 app/src/main/cpp/libcxx/include/vector        |  3366 +++
 app/src/main/cpp/libcxx/include/version       |   424 +
 app/src/main/cpp/libcxx/include/wchar.h       |   188 +
 app/src/main/cpp/libcxx/include/wctype.h      |    94 +
 app/src/main/cpp/libcxx/x86.a                 |   Bin 0 -> 1524412 bytes
 app/src/main/cpp/libcxx/x86_64.a              |   Bin 0 -> 1911100 bytes
 app/src/main/cpp/main.cpp                     |   191 -
 app/src/main/cpp/module.cpp                   |   264 +
 app/src/main/cpp/shadowhook/arch/arm/sh_a32.c |   446 -
 app/src/main/cpp/shadowhook/arch/arm/sh_a32.h |    41 -
 .../main/cpp/shadowhook/arch/arm/sh_inst.c    |   523 -
 .../main/cpp/shadowhook/arch/arm/sh_inst.h    |    41 -
 app/src/main/cpp/shadowhook/arch/arm/sh_t16.c |   284 -
 app/src/main/cpp/shadowhook/arch/arm/sh_t16.h |    46 -
 app/src/main/cpp/shadowhook/arch/arm/sh_t32.c |   408 -
 app/src/main/cpp/shadowhook/arch/arm/sh_t32.h |    36 -
 app/src/main/cpp/shadowhook/arch/arm/sh_txx.c |    60 -
 app/src/main/cpp/shadowhook/arch/arm/sh_txx.h |    39 -
 .../main/cpp/shadowhook/arch/arm64/sh_a64.c   |   310 -
 .../main/cpp/shadowhook/arch/arm64/sh_a64.h   |    44 -
 .../main/cpp/shadowhook/arch/arm64/sh_inst.c  |   203 -
 .../main/cpp/shadowhook/arch/arm64/sh_inst.h  |    42 -
 app/src/main/cpp/shadowhook/common/bytesig.c  |   291 -
 app/src/main/cpp/shadowhook/common/bytesig.h  |   157 -
 .../main/cpp/shadowhook/common/sh_config.h    |    55 -
 app/src/main/cpp/shadowhook/common/sh_errno.c |   107 -
 app/src/main/cpp/shadowhook/common/sh_errno.h |    40 -
 app/src/main/cpp/shadowhook/common/sh_log.c   |    53 -
 app/src/main/cpp/shadowhook/common/sh_log.h   |    70 -
 app/src/main/cpp/shadowhook/common/sh_sig.h   |    49 -
 .../main/cpp/shadowhook/common/sh_trampo.c    |   172 -
 .../main/cpp/shadowhook/common/sh_trampo.h    |    52 -
 app/src/main/cpp/shadowhook/common/sh_util.c  |   538 -
 app/src/main/cpp/shadowhook/common/sh_util.h  |    96 -
 .../main/cpp/shadowhook/include/shadowhook.h  |   191 -
 app/src/main/cpp/shadowhook/sh_enter.c        |    47 -
 app/src/main/cpp/shadowhook/sh_enter.h        |    30 -
 app/src/main/cpp/shadowhook/sh_exit.c         |   420 -
 app/src/main/cpp/shadowhook/sh_exit.h         |    34 -
 app/src/main/cpp/shadowhook/sh_hub.c          |   538 -
 app/src/main/cpp/shadowhook/sh_hub.h          |    45 -
 app/src/main/cpp/shadowhook/sh_jni.c          |   139 -
 app/src/main/cpp/shadowhook/sh_linker.c       |   409 -
 app/src/main/cpp/shadowhook/sh_linker.h       |    41 -
 app/src/main/cpp/shadowhook/sh_recorder.c     |   517 -
 app/src/main/cpp/shadowhook/sh_recorder.h     |    37 -
 app/src/main/cpp/shadowhook/sh_safe.c         |   133 -
 app/src/main/cpp/shadowhook/sh_safe.h         |    37 -
 app/src/main/cpp/shadowhook/sh_switch.c       |   343 -
 app/src/main/cpp/shadowhook/sh_switch.h       |    34 -
 app/src/main/cpp/shadowhook/sh_task.c         |   333 -
 app/src/main/cpp/shadowhook/sh_task.h         |    40 -
 app/src/main/cpp/shadowhook/shadowhook.c      |   328 -
 .../cpp/shadowhook/third_party/bsd/queue.h    |   551 -
 .../cpp/shadowhook/third_party/bsd/tree.h     |   759 -
 .../cpp/shadowhook/third_party/lss/LICENSE    |    28 -
 .../third_party/lss/linux_syscall_support.h   |  4867 ---
 .../cpp/shadowhook/third_party/xdl/LICENSE    |    21 -
 .../main/cpp/shadowhook/third_party/xdl/xdl.c |   910 -
 .../main/cpp/shadowhook/third_party/xdl/xdl.h |    92 -
 .../shadowhook/third_party/xdl/xdl_iterate.c  |   297 -
 .../shadowhook/third_party/xdl/xdl_iterate.h  |    43 -
 .../shadowhook/third_party/xdl/xdl_linker.c   |   234 -
 .../shadowhook/third_party/xdl/xdl_linker.h   |    40 -
 .../cpp/shadowhook/third_party/xdl/xdl_lzma.c |   187 -
 .../cpp/shadowhook/third_party/xdl/xdl_lzma.h |    40 -
 .../cpp/shadowhook/third_party/xdl/xdl_util.c |    95 -
 .../cpp/shadowhook/third_party/xdl/xdl_util.h |    71 -
 .../playintegrityfix/CustomKeyStoreSpi.java   |   105 -
 .../playintegrityfix/CustomProvider.java      |     7 +-
 .../playintegrityfix/EntryPoint.java          |   159 +-
 changelog.md                                  |    12 +-
 module/customize.sh                           |     5 +-
 module/module.prop                            |     4 +-
 module/pif.json                               |    12 +
 update.json                                   |     6 +-
 960 files changed, 221769 insertions(+), 16574 deletions(-)
 delete mode 100644 app/src/main/cpp/Android.mk
 delete mode 100644 app/src/main/cpp/Application.mk
 create mode 100644 app/src/main/cpp/CMakeLists.txt
 create mode 160000 app/src/main/cpp/Dobby
 create mode 100644 app/src/main/cpp/json.hpp
 delete mode 160000 app/src/main/cpp/libcxx
 create mode 100644 app/src/main/cpp/libcxx/arm64-v8a.a
 create mode 100644 app/src/main/cpp/libcxx/armeabi-v7a.a
 create mode 100644 app/src/main/cpp/libcxx/include/CMakeLists.txt
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/adjacent_find.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/all_of.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/any_of.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/binary_search.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/clamp.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/comp.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/comp_ref_type.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/copy_backward.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/copy_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/copy_move_common.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/copy_n.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/count.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/count_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/equal.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/equal_range.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/fill.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/fill_n.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/find.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/find_end.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/find_first_of.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/find_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/find_if_not.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/for_each.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/for_each_n.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/generate.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/generate_n.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/half_positive.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/in_found_result.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/in_fun_result.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/in_in_out_result.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/in_in_result.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/in_out_out_result.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/in_out_result.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/includes.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/inplace_merge.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/is_heap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/is_heap_until.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/is_partitioned.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/is_permutation.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/is_sorted.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/is_sorted_until.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/iter_swap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/iterator_operations.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/lexicographical_compare.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/lower_bound.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/make_heap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/make_projected.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/max.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/max_element.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/merge.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/min.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/min_element.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/min_max_result.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/minmax.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/minmax_element.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/mismatch.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/move.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/move_backward.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/next_permutation.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/none_of.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/nth_element.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/partial_sort.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/partial_sort_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/partition.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/partition_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/partition_point.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/pop_heap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/prev_permutation.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/push_heap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_adjacent_find.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_all_of.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_any_of.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_binary_search.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_clamp.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_copy_backward.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_copy_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_copy_n.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_count.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_count_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_equal.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_equal_range.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_fill.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_fill_n.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_find.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_find_end.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_find_first_of.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_find_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_find_if_not.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_for_each.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_for_each_n.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_generate.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_generate_n.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_includes.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_inplace_merge.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_is_heap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_is_heap_until.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_is_partitioned.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_is_permutation.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_is_sorted.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_is_sorted_until.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_iterator_concept.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_lexicographical_compare.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_lower_bound.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_make_heap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_max.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_max_element.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_merge.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_min.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_min_element.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_minmax.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_minmax_element.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_mismatch.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_move.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_move_backward.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_next_permutation.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_none_of.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_nth_element.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_partial_sort.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_partial_sort_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_partition.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_partition_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_partition_point.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_pop_heap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_prev_permutation.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_push_heap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_remove.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_remove_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_remove_copy_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_remove_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_replace.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_replace_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_replace_copy_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_replace_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_reverse.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_reverse_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_rotate.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_rotate_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_sample.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_search.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_search_n.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_set_difference.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_set_intersection.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_set_symmetric_difference.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_set_union.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_shuffle.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_sort.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_sort_heap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_stable_partition.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_stable_sort.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_swap_ranges.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_transform.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_unique.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_unique_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/ranges_upper_bound.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/remove.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/remove_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/remove_copy_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/remove_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/replace.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/replace_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/replace_copy_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/replace_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/reverse.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/reverse_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/rotate.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/rotate_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/sample.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/search.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/search_n.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/set_difference.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/set_intersection.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/set_symmetric_difference.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/set_union.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/shift_left.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/shift_right.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/shuffle.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/sift_down.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/sort.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/sort_heap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/stable_partition.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/stable_sort.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/swap_ranges.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/transform.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/uniform_random_bit_generator_adaptor.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/unique.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/unique_copy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/unwrap_iter.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/unwrap_range.h
 create mode 100644 app/src/main/cpp/libcxx/include/__algorithm/upper_bound.h
 create mode 100644 app/src/main/cpp/libcxx/include/__assert
 create mode 100644 app/src/main/cpp/libcxx/include/__availability
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/bit_cast.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/bit_ceil.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/bit_floor.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/bit_log2.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/bit_width.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/blsr.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/byteswap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/countl.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/countr.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/endian.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/has_single_bit.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/popcount.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit/rotate.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bit_reference
 create mode 100644 app/src/main/cpp/libcxx/include/__bsd_locale_defaults.h
 create mode 100644 app/src/main/cpp/libcxx/include/__bsd_locale_fallbacks.h
 create mode 100644 app/src/main/cpp/libcxx/include/__charconv/chars_format.h
 create mode 100644 app/src/main/cpp/libcxx/include/__charconv/from_chars_result.h
 create mode 100644 app/src/main/cpp/libcxx/include/__charconv/tables.h
 create mode 100644 app/src/main/cpp/libcxx/include/__charconv/to_chars_base_10.h
 create mode 100644 app/src/main/cpp/libcxx/include/__charconv/to_chars_result.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/calendar.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/convert_to_timespec.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/convert_to_tm.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/day.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/duration.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/file_clock.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/formatter.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/hh_mm_ss.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/high_resolution_clock.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/literals.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/month.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/month_weekday.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/monthday.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/ostream.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/parser_std_format_spec.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/statically_widen.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/steady_clock.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/system_clock.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/time_point.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/weekday.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/year.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/year_month.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/year_month_day.h
 create mode 100644 app/src/main/cpp/libcxx/include/__chrono/year_month_weekday.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/common_comparison_category.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/compare_partial_order_fallback.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/compare_strong_order_fallback.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/compare_three_way.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/compare_three_way_result.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/compare_weak_order_fallback.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/is_eq.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/ordering.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/partial_order.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/strong_order.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/synth_three_way.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/three_way_comparable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__compare/weak_order.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/arithmetic.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/assignable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/boolean_testable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/class_or_enum.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/common_reference_with.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/common_with.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/convertible_to.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/copyable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/derived_from.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/destructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/different_from.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/equality_comparable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/invocable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/movable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/predicate.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/regular.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/relation.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/same_as.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/semiregular.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/swappable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__concepts/totally_ordered.h
 create mode 100644 app/src/main/cpp/libcxx/include/__config
 create mode 100644 app/src/main/cpp/libcxx/include/__config_site
 create mode 100644 app/src/main/cpp/libcxx/include/__config_site.in
 create mode 100644 app/src/main/cpp/libcxx/include/__coroutine/coroutine_handle.h
 create mode 100644 app/src/main/cpp/libcxx/include/__coroutine/coroutine_traits.h
 create mode 100644 app/src/main/cpp/libcxx/include/__coroutine/noop_coroutine_handle.h
 create mode 100644 app/src/main/cpp/libcxx/include/__coroutine/trivial_awaitables.h
 create mode 100644 app/src/main/cpp/libcxx/include/__debug
 create mode 100644 app/src/main/cpp/libcxx/include/__debug_utils/randomize_range.h
 create mode 100644 app/src/main/cpp/libcxx/include/__errc
 create mode 100644 app/src/main/cpp/libcxx/include/__expected/bad_expected_access.h
 create mode 100644 app/src/main/cpp/libcxx/include/__expected/expected.h
 create mode 100644 app/src/main/cpp/libcxx/include/__expected/unexpect.h
 create mode 100644 app/src/main/cpp/libcxx/include/__expected/unexpected.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/copy_options.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/directory_entry.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/directory_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/directory_options.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/file_status.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/file_time_type.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/file_type.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/filesystem_error.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/operations.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/path.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/path_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/perm_options.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/perms.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/recursive_directory_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/space_info.h
 create mode 100644 app/src/main/cpp/libcxx/include/__filesystem/u8path.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/buffer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/concepts.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/container_adaptor.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/enable_insertable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/escaped_output_table.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/extended_grapheme_cluster_table.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/format_arg.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/format_arg_store.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/format_args.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/format_context.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/format_error.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/format_functions.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/format_fwd.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/format_parse_context.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/format_string.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/format_to_n_result.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/formatter.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/formatter_bool.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/formatter_char.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/formatter_floating_point.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/formatter_integer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/formatter_integral.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/formatter_output.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/formatter_pointer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/formatter_string.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/formatter_tuple.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/parser_std_format_spec.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/range_default_formatter.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/range_formatter.h
 create mode 100644 app/src/main/cpp/libcxx/include/__format/unicode.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/binary_function.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/binary_negate.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/bind.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/bind_back.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/bind_front.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/binder1st.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/binder2nd.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/boyer_moore_searcher.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/compose.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/default_searcher.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/function.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/hash.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/identity.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/invoke.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/is_transparent.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/mem_fn.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/mem_fun_ref.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/not_fn.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/operations.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/perfect_forward.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/pointer_to_binary_function.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/pointer_to_unary_function.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/ranges_operations.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/reference_wrapper.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/unary_function.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/unary_negate.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/unwrap_ref.h
 create mode 100644 app/src/main/cpp/libcxx/include/__functional/weak_result_type.h
 create mode 100644 app/src/main/cpp/libcxx/include/__fwd/array.h
 create mode 100644 app/src/main/cpp/libcxx/include/__fwd/get.h
 create mode 100644 app/src/main/cpp/libcxx/include/__fwd/hash.h
 create mode 100644 app/src/main/cpp/libcxx/include/__fwd/memory_resource.h
 create mode 100644 app/src/main/cpp/libcxx/include/__fwd/pair.h
 create mode 100644 app/src/main/cpp/libcxx/include/__fwd/span.h
 create mode 100644 app/src/main/cpp/libcxx/include/__fwd/string.h
 create mode 100644 app/src/main/cpp/libcxx/include/__fwd/string_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__fwd/subrange.h
 create mode 100644 app/src/main/cpp/libcxx/include/__fwd/tuple.h
 create mode 100644 app/src/main/cpp/libcxx/include/__hash_table
 create mode 100644 app/src/main/cpp/libcxx/include/__ios/fpos.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/access.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/advance.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/back_insert_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/bounded_iter.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/common_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/concepts.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/counted_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/data.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/default_sentinel.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/distance.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/empty.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/erase_if_container.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/front_insert_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/incrementable_traits.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/indirectly_comparable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/insert_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/istream_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/istreambuf_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/iter_move.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/iter_swap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/iterator_traits.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/iterator_with_data.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/mergeable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/move_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/move_sentinel.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/next.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/ostream_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/ostreambuf_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/permutable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/prev.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/projected.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/readable_traits.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/reverse_access.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/reverse_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/segmented_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/size.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/sortable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/unreachable_sentinel.h
 create mode 100644 app/src/main/cpp/libcxx/include/__iterator/wrap_iter.h
 create mode 100644 app/src/main/cpp/libcxx/include/__locale
 create mode 100644 app/src/main/cpp/libcxx/include/__mbstate_t.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/addressof.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/align.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/allocate_at_least.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/allocation_guard.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/allocator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/allocator_arg_t.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/allocator_destructor.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/allocator_traits.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/assume_aligned.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/auto_ptr.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/builtin_new_allocator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/compressed_pair.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/concepts.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/construct_at.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/destruct_n.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/pointer_traits.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/ranges_construct_at.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/ranges_uninitialized_algorithms.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/raw_storage_iterator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/shared_ptr.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/swap_allocator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/temp_value.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/temporary_buffer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/uninitialized_algorithms.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/unique_ptr.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/uses_allocator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/uses_allocator_construction.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory/voidify.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory_resource/memory_resource.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory_resource/monotonic_buffer_resource.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory_resource/polymorphic_allocator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory_resource/pool_options.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory_resource/synchronized_pool_resource.h
 create mode 100644 app/src/main/cpp/libcxx/include/__memory_resource/unsynchronized_pool_resource.h
 create mode 100644 app/src/main/cpp/libcxx/include/__mutex_base
 create mode 100644 app/src/main/cpp/libcxx/include/__node_handle
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/accumulate.h
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/adjacent_difference.h
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/exclusive_scan.h
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/gcd_lcm.h
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/inclusive_scan.h
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/inner_product.h
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/iota.h
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/midpoint.h
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/partial_sum.h
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/reduce.h
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/transform_exclusive_scan.h
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/transform_inclusive_scan.h
 create mode 100644 app/src/main/cpp/libcxx/include/__numeric/transform_reduce.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/bernoulli_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/binomial_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/cauchy_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/chi_squared_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/clamp_to_integral.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/default_random_engine.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/discard_block_engine.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/discrete_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/exponential_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/extreme_value_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/fisher_f_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/gamma_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/generate_canonical.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/geometric_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/independent_bits_engine.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/is_seed_sequence.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/is_valid.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/knuth_b.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/linear_congruential_engine.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/log2.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/lognormal_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/mersenne_twister_engine.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/negative_binomial_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/normal_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/piecewise_constant_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/piecewise_linear_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/poisson_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/random_device.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/ranlux.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/seed_seq.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/shuffle_order_engine.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/student_t_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/subtract_with_carry_engine.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/uniform_int_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/uniform_random_bit_generator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/uniform_real_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__random/weibull_distribution.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/access.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/all.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/as_rvalue_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/common_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/concepts.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/copyable_box.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/counted.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/dangling.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/data.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/drop_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/drop_while_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/elements_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/empty.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/empty_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/enable_borrowed_range.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/enable_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/filter_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/iota_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/istream_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/join_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/lazy_split_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/non_propagating_cache.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/owning_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/range_adaptor.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/rbegin.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/ref_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/rend.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/reverse_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/single_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/size.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/split_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/subrange.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/take_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/take_while_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/transform_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/view_interface.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/views.h
 create mode 100644 app/src/main/cpp/libcxx/include/__ranges/zip_view.h
 create mode 100644 app/src/main/cpp/libcxx/include/__split_buffer
 create mode 100644 app/src/main/cpp/libcxx/include/__std_stream
 create mode 100644 app/src/main/cpp/libcxx/include/__string/char_traits.h
 create mode 100644 app/src/main/cpp/libcxx/include/__string/extern_template_lists.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/android/locale_bionic.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/fuchsia/xlocale.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/ibm/gettod_zos.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/ibm/locale_mgmt_zos.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/ibm/nanosleep.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/ibm/xlocale.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/musl/xlocale.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/newlib/xlocale.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/openbsd/xlocale.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/solaris/floatingpoint.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/solaris/wchar.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/solaris/xlocale.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/win32/locale_win32.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/xlocale/__nop_locale_mgmt.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/xlocale/__posix_l_fallback.h
 create mode 100644 app/src/main/cpp/libcxx/include/__support/xlocale/__strtonum_fallback.h
 create mode 100644 app/src/main/cpp/libcxx/include/__thread/poll_with_backoff.h
 create mode 100644 app/src/main/cpp/libcxx/include/__thread/timed_backoff_policy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__threading_support
 create mode 100644 app/src/main/cpp/libcxx/include/__tree
 create mode 100644 app/src/main/cpp/libcxx/include/__tuple_dir/apply_cv.h
 create mode 100644 app/src/main/cpp/libcxx/include/__tuple_dir/make_tuple_types.h
 create mode 100644 app/src/main/cpp/libcxx/include/__tuple_dir/pair_like.h
 create mode 100644 app/src/main/cpp/libcxx/include/__tuple_dir/sfinae_helpers.h
 create mode 100644 app/src/main/cpp/libcxx/include/__tuple_dir/tuple_element.h
 create mode 100644 app/src/main/cpp/libcxx/include/__tuple_dir/tuple_indices.h
 create mode 100644 app/src/main/cpp/libcxx/include/__tuple_dir/tuple_like.h
 create mode 100644 app/src/main/cpp/libcxx/include/__tuple_dir/tuple_like_ext.h
 create mode 100644 app/src/main/cpp/libcxx/include/__tuple_dir/tuple_size.h
 create mode 100644 app/src/main/cpp/libcxx/include/__tuple_dir/tuple_types.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/add_const.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/add_cv.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/add_lvalue_reference.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/add_pointer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/add_rvalue_reference.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/add_volatile.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/aligned_storage.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/aligned_union.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/alignment_of.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/apply_cv.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/can_extract_key.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/common_reference.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/common_type.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/conditional.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/conjunction.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/copy_cv.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/copy_cvref.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/decay.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/dependent_type.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/disjunction.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/enable_if.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/extent.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/has_unique_object_representation.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/has_virtual_destructor.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/integral_constant.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_abstract.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_aggregate.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_allocator.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_always_bitcastable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_arithmetic.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_array.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_assignable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_base_of.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_bounded_array.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_callable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_char_like_type.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_class.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_compound.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_const.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_constant_evaluated.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_convertible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_copy_assignable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_copy_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_core_convertible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_default_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_destructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_empty.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_enum.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_final.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_floating_point.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_function.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_fundamental.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_implicitly_default_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_integral.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_literal_type.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_member_function_pointer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_member_object_pointer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_member_pointer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_move_assignable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_move_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_assignable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_convertible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_copy_assignable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_copy_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_default_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_destructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_move_assignable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_move_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_null_pointer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_object.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_pod.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_pointer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_polymorphic.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_primary_template.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_reference.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_reference_wrapper.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_referenceable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_same.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_scalar.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_scoped_enum.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_signed.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_signed_integer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_specialization.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_standard_layout.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_swappable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_trivial.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_trivially_assignable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_trivially_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_trivially_copy_assignable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_trivially_copy_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_trivially_copyable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_trivially_default_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_trivially_destructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_trivially_move_assignable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_trivially_move_constructible.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_unbounded_array.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_union.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_unsigned.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_unsigned_integer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_valid_expansion.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_void.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/is_volatile.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/lazy.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/make_32_64_or_128_bit.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/make_const_lvalue_ref.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/make_signed.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/make_unsigned.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/maybe_const.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/nat.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/negation.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/noexcept_move_assign_container.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/promote.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/rank.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/remove_all_extents.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/remove_const.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/remove_const_ref.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/remove_cv.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/remove_cvref.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/remove_extent.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/remove_pointer.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/remove_reference.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/remove_volatile.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/result_of.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/strip_signature.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/type_identity.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/type_list.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/underlying_type.h
 create mode 100644 app/src/main/cpp/libcxx/include/__type_traits/void_t.h
 create mode 100644 app/src/main/cpp/libcxx/include/__undef_macros
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/as_const.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/auto_cast.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/cmp.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/convert_to_integral.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/declval.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/exception_guard.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/exchange.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/forward.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/forward_like.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/in_place.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/integer_sequence.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/move.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/pair.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/piecewise_construct.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/priority_tag.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/rel_ops.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/swap.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/to_underlying.h
 create mode 100644 app/src/main/cpp/libcxx/include/__utility/unreachable.h
 create mode 100644 app/src/main/cpp/libcxx/include/__variant/monostate.h
 create mode 100644 app/src/main/cpp/libcxx/include/__verbose_abort
 create mode 100644 app/src/main/cpp/libcxx/include/abi/CMakeLists.txt
 create mode 100644 app/src/main/cpp/libcxx/include/abi/__cxxabi_config.h
 create mode 100644 app/src/main/cpp/libcxx/include/abi/cxxabi.h
 create mode 100644 app/src/main/cpp/libcxx/include/algorithm
 create mode 100644 app/src/main/cpp/libcxx/include/any
 create mode 100644 app/src/main/cpp/libcxx/include/array
 create mode 100644 app/src/main/cpp/libcxx/include/atomic
 create mode 100644 app/src/main/cpp/libcxx/include/barrier
 create mode 100644 app/src/main/cpp/libcxx/include/bit
 create mode 100644 app/src/main/cpp/libcxx/include/bitset
 create mode 100644 app/src/main/cpp/libcxx/include/cassert
 create mode 100644 app/src/main/cpp/libcxx/include/ccomplex
 create mode 100644 app/src/main/cpp/libcxx/include/cctype
 create mode 100644 app/src/main/cpp/libcxx/include/cerrno
 create mode 100644 app/src/main/cpp/libcxx/include/cfenv
 create mode 100644 app/src/main/cpp/libcxx/include/cfloat
 create mode 100644 app/src/main/cpp/libcxx/include/charconv
 create mode 100644 app/src/main/cpp/libcxx/include/chrono
 create mode 100644 app/src/main/cpp/libcxx/include/cinttypes
 create mode 100644 app/src/main/cpp/libcxx/include/ciso646
 create mode 100644 app/src/main/cpp/libcxx/include/climits
 create mode 100644 app/src/main/cpp/libcxx/include/clocale
 create mode 100644 app/src/main/cpp/libcxx/include/cmath
 create mode 100644 app/src/main/cpp/libcxx/include/codecvt
 create mode 100644 app/src/main/cpp/libcxx/include/compare
 create mode 100644 app/src/main/cpp/libcxx/include/complex
 create mode 100644 app/src/main/cpp/libcxx/include/complex.h
 create mode 100644 app/src/main/cpp/libcxx/include/concepts
 create mode 100644 app/src/main/cpp/libcxx/include/condition_variable
 create mode 100644 app/src/main/cpp/libcxx/include/coroutine
 create mode 100644 app/src/main/cpp/libcxx/include/csetjmp
 create mode 100644 app/src/main/cpp/libcxx/include/csignal
 create mode 100644 app/src/main/cpp/libcxx/include/cstdarg
 create mode 100644 app/src/main/cpp/libcxx/include/cstdbool
 create mode 100644 app/src/main/cpp/libcxx/include/cstddef
 create mode 100644 app/src/main/cpp/libcxx/include/cstdint
 create mode 100644 app/src/main/cpp/libcxx/include/cstdio
 create mode 100644 app/src/main/cpp/libcxx/include/cstdlib
 create mode 100644 app/src/main/cpp/libcxx/include/cstring
 create mode 100644 app/src/main/cpp/libcxx/include/ctgmath
 create mode 100644 app/src/main/cpp/libcxx/include/ctime
 create mode 100644 app/src/main/cpp/libcxx/include/ctype.h
 create mode 100644 app/src/main/cpp/libcxx/include/cuchar
 create mode 100644 app/src/main/cpp/libcxx/include/cwchar
 create mode 100644 app/src/main/cpp/libcxx/include/cwctype
 create mode 100644 app/src/main/cpp/libcxx/include/deque
 create mode 100644 app/src/main/cpp/libcxx/include/errno.h
 create mode 100644 app/src/main/cpp/libcxx/include/exception
 create mode 100644 app/src/main/cpp/libcxx/include/execution
 create mode 100644 app/src/main/cpp/libcxx/include/expected
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/__config
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/__memory
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/algorithm
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/coroutine
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/deque
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/forward_list
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/functional
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/iterator
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/list
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/map
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/memory_resource
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/propagate_const
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/regex
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/set
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/simd
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/string
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/type_traits
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/unordered_map
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/unordered_set
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/utility
 create mode 100644 app/src/main/cpp/libcxx/include/experimental/vector
 create mode 100644 app/src/main/cpp/libcxx/include/ext/__hash
 create mode 100644 app/src/main/cpp/libcxx/include/ext/hash_map
 create mode 100644 app/src/main/cpp/libcxx/include/ext/hash_set
 create mode 100644 app/src/main/cpp/libcxx/include/fenv.h
 create mode 100644 app/src/main/cpp/libcxx/include/filesystem
 create mode 100644 app/src/main/cpp/libcxx/include/float.h
 create mode 100644 app/src/main/cpp/libcxx/include/format
 create mode 100644 app/src/main/cpp/libcxx/include/forward_list
 create mode 100644 app/src/main/cpp/libcxx/include/fstream
 create mode 100644 app/src/main/cpp/libcxx/include/functional
 create mode 100644 app/src/main/cpp/libcxx/include/future
 create mode 100644 app/src/main/cpp/libcxx/include/initializer_list
 create mode 100644 app/src/main/cpp/libcxx/include/inttypes.h
 create mode 100644 app/src/main/cpp/libcxx/include/iomanip
 create mode 100644 app/src/main/cpp/libcxx/include/ios
 create mode 100644 app/src/main/cpp/libcxx/include/iosfwd
 create mode 100644 app/src/main/cpp/libcxx/include/iostream
 create mode 100644 app/src/main/cpp/libcxx/include/istream
 create mode 100644 app/src/main/cpp/libcxx/include/iterator
 create mode 100644 app/src/main/cpp/libcxx/include/latch
 create mode 100644 app/src/main/cpp/libcxx/include/libcxx.imp
 create mode 100644 app/src/main/cpp/libcxx/include/limits
 create mode 100644 app/src/main/cpp/libcxx/include/limits.h
 create mode 100644 app/src/main/cpp/libcxx/include/list
 create mode 100644 app/src/main/cpp/libcxx/include/locale
 create mode 100644 app/src/main/cpp/libcxx/include/locale.h
 create mode 100644 app/src/main/cpp/libcxx/include/map
 create mode 100644 app/src/main/cpp/libcxx/include/math.h
 create mode 100644 app/src/main/cpp/libcxx/include/memory
 create mode 100644 app/src/main/cpp/libcxx/include/memory_resource
 create mode 100644 app/src/main/cpp/libcxx/include/module.modulemap.in
 create mode 100644 app/src/main/cpp/libcxx/include/mutex
 create mode 100644 app/src/main/cpp/libcxx/include/new
 create mode 100644 app/src/main/cpp/libcxx/include/numbers
 create mode 100644 app/src/main/cpp/libcxx/include/numeric
 create mode 100644 app/src/main/cpp/libcxx/include/optional
 create mode 100644 app/src/main/cpp/libcxx/include/ostream
 create mode 100644 app/src/main/cpp/libcxx/include/queue
 create mode 100644 app/src/main/cpp/libcxx/include/random
 create mode 100644 app/src/main/cpp/libcxx/include/ranges
 create mode 100644 app/src/main/cpp/libcxx/include/ratio
 create mode 100644 app/src/main/cpp/libcxx/include/regex
 create mode 100644 app/src/main/cpp/libcxx/include/scoped_allocator
 create mode 100644 app/src/main/cpp/libcxx/include/semaphore
 create mode 100644 app/src/main/cpp/libcxx/include/set
 create mode 100644 app/src/main/cpp/libcxx/include/setjmp.h
 create mode 100644 app/src/main/cpp/libcxx/include/shared_mutex
 create mode 100644 app/src/main/cpp/libcxx/include/source_location
 create mode 100644 app/src/main/cpp/libcxx/include/span
 create mode 100644 app/src/main/cpp/libcxx/include/sstream
 create mode 100644 app/src/main/cpp/libcxx/include/stack
 create mode 100644 app/src/main/cpp/libcxx/include/stdatomic.h
 create mode 100644 app/src/main/cpp/libcxx/include/stdbool.h
 create mode 100644 app/src/main/cpp/libcxx/include/stddef.h
 create mode 100644 app/src/main/cpp/libcxx/include/stdexcept
 create mode 100644 app/src/main/cpp/libcxx/include/stdint.h
 create mode 100644 app/src/main/cpp/libcxx/include/stdio.h
 create mode 100644 app/src/main/cpp/libcxx/include/stdlib.h
 create mode 100644 app/src/main/cpp/libcxx/include/streambuf
 create mode 100644 app/src/main/cpp/libcxx/include/string
 create mode 100644 app/src/main/cpp/libcxx/include/string.h
 create mode 100644 app/src/main/cpp/libcxx/include/string_view
 create mode 100644 app/src/main/cpp/libcxx/include/strstream
 create mode 100644 app/src/main/cpp/libcxx/include/system_error
 create mode 100644 app/src/main/cpp/libcxx/include/tgmath.h
 create mode 100644 app/src/main/cpp/libcxx/include/thread
 create mode 100644 app/src/main/cpp/libcxx/include/tuple
 create mode 100644 app/src/main/cpp/libcxx/include/type_traits
 create mode 100644 app/src/main/cpp/libcxx/include/typeindex
 create mode 100644 app/src/main/cpp/libcxx/include/typeinfo
 create mode 100644 app/src/main/cpp/libcxx/include/uchar.h
 create mode 100644 app/src/main/cpp/libcxx/include/unordered_map
 create mode 100644 app/src/main/cpp/libcxx/include/unordered_set
 create mode 100644 app/src/main/cpp/libcxx/include/utility
 create mode 100644 app/src/main/cpp/libcxx/include/valarray
 create mode 100644 app/src/main/cpp/libcxx/include/variant
 create mode 100644 app/src/main/cpp/libcxx/include/vector
 create mode 100644 app/src/main/cpp/libcxx/include/version
 create mode 100644 app/src/main/cpp/libcxx/include/wchar.h
 create mode 100644 app/src/main/cpp/libcxx/include/wctype.h
 create mode 100644 app/src/main/cpp/libcxx/x86.a
 create mode 100644 app/src/main/cpp/libcxx/x86_64.a
 delete mode 100644 app/src/main/cpp/main.cpp
 create mode 100644 app/src/main/cpp/module.cpp
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm/sh_a32.c
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm/sh_a32.h
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm/sh_inst.c
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm/sh_inst.h
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm/sh_t16.c
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm/sh_t16.h
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm/sh_t32.c
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm/sh_t32.h
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm/sh_txx.c
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm/sh_txx.h
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm64/sh_a64.c
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm64/sh_a64.h
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm64/sh_inst.c
 delete mode 100644 app/src/main/cpp/shadowhook/arch/arm64/sh_inst.h
 delete mode 100644 app/src/main/cpp/shadowhook/common/bytesig.c
 delete mode 100644 app/src/main/cpp/shadowhook/common/bytesig.h
 delete mode 100644 app/src/main/cpp/shadowhook/common/sh_config.h
 delete mode 100644 app/src/main/cpp/shadowhook/common/sh_errno.c
 delete mode 100644 app/src/main/cpp/shadowhook/common/sh_errno.h
 delete mode 100644 app/src/main/cpp/shadowhook/common/sh_log.c
 delete mode 100644 app/src/main/cpp/shadowhook/common/sh_log.h
 delete mode 100644 app/src/main/cpp/shadowhook/common/sh_sig.h
 delete mode 100644 app/src/main/cpp/shadowhook/common/sh_trampo.c
 delete mode 100644 app/src/main/cpp/shadowhook/common/sh_trampo.h
 delete mode 100644 app/src/main/cpp/shadowhook/common/sh_util.c
 delete mode 100644 app/src/main/cpp/shadowhook/common/sh_util.h
 delete mode 100644 app/src/main/cpp/shadowhook/include/shadowhook.h
 delete mode 100644 app/src/main/cpp/shadowhook/sh_enter.c
 delete mode 100644 app/src/main/cpp/shadowhook/sh_enter.h
 delete mode 100644 app/src/main/cpp/shadowhook/sh_exit.c
 delete mode 100644 app/src/main/cpp/shadowhook/sh_exit.h
 delete mode 100644 app/src/main/cpp/shadowhook/sh_hub.c
 delete mode 100644 app/src/main/cpp/shadowhook/sh_hub.h
 delete mode 100644 app/src/main/cpp/shadowhook/sh_jni.c
 delete mode 100644 app/src/main/cpp/shadowhook/sh_linker.c
 delete mode 100644 app/src/main/cpp/shadowhook/sh_linker.h
 delete mode 100644 app/src/main/cpp/shadowhook/sh_recorder.c
 delete mode 100644 app/src/main/cpp/shadowhook/sh_recorder.h
 delete mode 100644 app/src/main/cpp/shadowhook/sh_safe.c
 delete mode 100644 app/src/main/cpp/shadowhook/sh_safe.h
 delete mode 100644 app/src/main/cpp/shadowhook/sh_switch.c
 delete mode 100644 app/src/main/cpp/shadowhook/sh_switch.h
 delete mode 100644 app/src/main/cpp/shadowhook/sh_task.c
 delete mode 100644 app/src/main/cpp/shadowhook/sh_task.h
 delete mode 100644 app/src/main/cpp/shadowhook/shadowhook.c
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/bsd/queue.h
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/bsd/tree.h
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/lss/LICENSE
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/lss/linux_syscall_support.h
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/xdl/LICENSE
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/xdl/xdl.c
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/xdl/xdl.h
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/xdl/xdl_iterate.c
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/xdl/xdl_iterate.h
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/xdl/xdl_linker.c
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/xdl/xdl_linker.h
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/xdl/xdl_lzma.c
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/xdl/xdl_lzma.h
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/xdl/xdl_util.c
 delete mode 100644 app/src/main/cpp/shadowhook/third_party/xdl/xdl_util.h
 delete mode 100644 app/src/main/java/es/chiteroman/playintegrityfix/CustomKeyStoreSpi.java
 create mode 100644 module/pif.json

diff --git a/.gitmodules b/.gitmodules
index 15d4b83..b79ccd4 100644
--- a/.gitmodules
+++ b/.gitmodules
@@ -1,3 +1,3 @@
-[submodule "app/src/main/cpp/libcxx"]
-	path = app/src/main/cpp/libcxx
-	url = https://github.com/topjohnwu/libcxx.git
+[submodule "app/src/main/cpp/Dobby"]
+	path = app/src/main/cpp/Dobby
+	url = https://github.com/jmpews/Dobby.git
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
index 9d7f727..bfce638 100644
--- a/.idea/vcs.xml
+++ b/.idea/vcs.xml
@@ -2,6 +2,6 @@
 <project version="4">
   <component name="VcsDirectoryMappings">
     <mapping directory="$PROJECT_DIR$" vcs="Git" />
-    <mapping directory="$PROJECT_DIR$/app/src/main/cpp/libcxx" vcs="Git" />
+    <mapping directory="$PROJECT_DIR$/app/src/main/cpp/Dobby" vcs="Git" />
   </component>
 </project>
\ No newline at end of file
diff --git a/app/build.gradle.kts b/app/build.gradle.kts
index 7b18a16..7849f3d 100644
--- a/app/build.gradle.kts
+++ b/app/build.gradle.kts
@@ -8,10 +8,6 @@ android {
     ndkVersion = "26.1.10909125"
     buildToolsVersion = "34.0.0"
 
-    buildFeatures {
-        prefab = true
-    }
-
     packaging {
         jniLibs {
             excludes += "**/libdobby.so"
@@ -26,11 +22,15 @@ android {
         versionName = "1.0"
 
         externalNativeBuild {
-            ndk {
-                abiFilters += "arm64-v8a"
-                abiFilters += "armeabi-v7a"
-                stl = "none"
-                jobs = Runtime.getRuntime().availableProcessors()
+            cmake {
+                arguments += "-DANDROID_STL=none"
+                arguments += "-DCMAKE_BUILD_TYPE=Release"
+
+                cppFlags += "-std=c++20"
+                cppFlags += "-fno-exceptions"
+                cppFlags += "-fno-rtti"
+                cppFlags += "-fvisibility=hidden"
+                cppFlags += "-fvisibility-inlines-hidden"
             }
         }
     }
@@ -39,7 +39,9 @@ android {
         release {
             isMinifyEnabled = true
             isShrinkResources = true
-            proguardFiles(getDefaultProguardFile("proguard-android-optimize.txt"), "proguard-rules.pro")
+            proguardFiles(
+                getDefaultProguardFile("proguard-android-optimize.txt"), "proguard-rules.pro"
+            )
         }
     }
 
@@ -49,8 +51,9 @@ android {
     }
 
     externalNativeBuild {
-        ndkBuild {
-            path = file("src/main/cpp/Android.mk")
+        cmake {
+            path = file("src/main/cpp/CMakeLists.txt")
+            version = "3.22.1"
         }
     }
 }
@@ -58,8 +61,10 @@ android {
 tasks.register("copyFiles") {
     doLast {
         val moduleFolder = project.rootDir.resolve("module")
-        val dexFile = project.buildDir.resolve("intermediates/dex/release/minifyReleaseWithR8/classes.dex")
-        val soDir = project.buildDir.resolve("intermediates/stripped_native_libs/release/out/lib")
+        val dexFile =
+            project.layout.buildDirectory.get().asFile.resolve("intermediates/dex/release/minifyReleaseWithR8/classes.dex")
+        val soDir =
+            project.layout.buildDirectory.get().asFile.resolve("intermediates/stripped_native_libs/release/out/lib")
 
         dexFile.copyTo(moduleFolder.resolve("classes.dex"), overwrite = true)
 
diff --git a/app/src/main/cpp/Android.mk b/app/src/main/cpp/Android.mk
deleted file mode 100644
index 310689a..0000000
--- a/app/src/main/cpp/Android.mk
+++ /dev/null
@@ -1,31 +0,0 @@
-LOCAL_PATH := $(call my-dir)
-
-include $(CLEAR_VARS)
-LOCAL_MODULE := zygisk
-LOCAL_SRC_FILES := $(LOCAL_PATH)/main.cpp
-LOCAL_C_INCLUDES := $(LOCAL_PATH)
-
-LOCAL_SRC_FILES += $(wildcard $(LOCAL_PATH)/shadowhook/*.c)
-LOCAL_SRC_FILES += $(wildcard $(LOCAL_PATH)/shadowhook/common/*.c)
-LOCAL_SRC_FILES += $(wildcard $(LOCAL_PATH)/shadowhook/third_party/xdl/*.c)
-
-LOCAL_C_INCLUDES += $(LOCAL_PATH)/shadowhook
-LOCAL_C_INCLUDES += $(LOCAL_PATH)/shadowhook/common
-LOCAL_C_INCLUDES += $(LOCAL_PATH)/shadowhook/include
-LOCAL_C_INCLUDES += $(LOCAL_PATH)/shadowhook/third_party/bsd
-LOCAL_C_INCLUDES += $(LOCAL_PATH)/shadowhook/third_party/lss
-LOCAL_C_INCLUDES += $(LOCAL_PATH)/shadowhook/third_party/xdl
-
-ifeq ($(TARGET_ARCH_ABI),armeabi-v7a)
-    LOCAL_SRC_FILES += $(wildcard $(LOCAL_PATH)/shadowhook/arch/arm/*.c)
-    LOCAL_C_INCLUDES += $(LOCAL_PATH)/shadowhook/arch/arm
-else ifeq ($(TARGET_ARCH_ABI),arm64-v8a)
-    LOCAL_SRC_FILES += $(wildcard $(LOCAL_PATH)/shadowhook/arch/arm64/*.c)
-    LOCAL_C_INCLUDES += $(LOCAL_PATH)/shadowhook/arch/arm64
-endif
-
-LOCAL_STATIC_LIBRARIES := libcxx
-LOCAL_LDLIBS := -llog
-include $(BUILD_SHARED_LIBRARY)
-
-include $(LOCAL_PATH)/libcxx/Android.mk
\ No newline at end of file
diff --git a/app/src/main/cpp/Application.mk b/app/src/main/cpp/Application.mk
deleted file mode 100644
index 90a229c..0000000
--- a/app/src/main/cpp/Application.mk
+++ /dev/null
@@ -1,4 +0,0 @@
-APP_STL      := none
-APP_CFLAGS   := -fvisibility=hidden -fvisibility-inlines-hidden -O3 -mllvm -polly
-APP_CPPFLAGS := -std=c++20 -fno-exceptions -fno-rtti
-APP_LDFLAGS  := -O3 -mllvm -polly
\ No newline at end of file
diff --git a/app/src/main/cpp/CMakeLists.txt b/app/src/main/cpp/CMakeLists.txt
new file mode 100644
index 0000000..db7c56f
--- /dev/null
+++ b/app/src/main/cpp/CMakeLists.txt
@@ -0,0 +1,15 @@
+cmake_minimum_required(VERSION 3.22.1)
+
+project("playintegrityfix")
+
+link_libraries(${CMAKE_SOURCE_DIR}/libcxx/${CMAKE_ANDROID_ARCH_ABI}.a)
+
+include_directories(libcxx/include)
+
+add_library(${CMAKE_PROJECT_NAME} SHARED module.cpp)
+
+add_subdirectory(Dobby)
+
+SET_OPTION(Plugin.Android.BionicLinkerUtil ON)
+
+target_link_libraries(${CMAKE_PROJECT_NAME} PRIVATE log dobby_static)
\ No newline at end of file
diff --git a/app/src/main/cpp/Dobby b/app/src/main/cpp/Dobby
new file mode 160000
index 0000000..b0176de
--- /dev/null
+++ b/app/src/main/cpp/Dobby
@@ -0,0 +1 @@
+Subproject commit b0176de574104726bb68dff3b77ee666300fc338
diff --git a/app/src/main/cpp/json.hpp b/app/src/main/cpp/json.hpp
new file mode 100644
index 0000000..8b72ea6
--- /dev/null
+++ b/app/src/main/cpp/json.hpp
@@ -0,0 +1,24765 @@
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+/****************************************************************************\
+ * Note on documentation: The source files contain links to the online      *
+ * documentation of the public API at https://json.nlohmann.me. This URL    *
+ * contains the most recent documentation and should also be applicable to  *
+ * previous versions; documentation for deprecated functions is not         *
+ * removed, but marked deprecated. See "Generate documentation" section in  *
+ * file docs/README.md.                                                     *
+\****************************************************************************/
+
+#ifndef INCLUDE_NLOHMANN_JSON_HPP_
+#define INCLUDE_NLOHMANN_JSON_HPP_
+
+#include <algorithm> // all_of, find, for_each
+#include <cstddef> // nullptr_t, ptrdiff_t, size_t
+#include <functional> // hash, less
+#include <initializer_list> // initializer_list
+#ifndef JSON_NO_IO
+    #include <iosfwd> // istream, ostream
+#endif  // JSON_NO_IO
+#include <iterator> // random_access_iterator_tag
+#include <memory> // unique_ptr
+#include <string> // string, stoi, to_string
+#include <utility> // declval, forward, move, pair, swap
+#include <vector> // vector
+
+// #include <nlohmann/adl_serializer.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <utility>
+
+// #include <nlohmann/detail/abi_macros.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// This file contains all macro definitions affecting or depending on the ABI
+
+#ifndef JSON_SKIP_LIBRARY_VERSION_CHECK
+    #if defined(NLOHMANN_JSON_VERSION_MAJOR) && defined(NLOHMANN_JSON_VERSION_MINOR) && defined(NLOHMANN_JSON_VERSION_PATCH)
+        #if NLOHMANN_JSON_VERSION_MAJOR != 3 || NLOHMANN_JSON_VERSION_MINOR != 11 || NLOHMANN_JSON_VERSION_PATCH != 3
+            #warning "Already included a different version of the library!"
+        #endif
+    #endif
+#endif
+
+#define NLOHMANN_JSON_VERSION_MAJOR 3   // NOLINT(modernize-macro-to-enum)
+#define NLOHMANN_JSON_VERSION_MINOR 11  // NOLINT(modernize-macro-to-enum)
+#define NLOHMANN_JSON_VERSION_PATCH 3   // NOLINT(modernize-macro-to-enum)
+
+#ifndef JSON_DIAGNOSTICS
+    #define JSON_DIAGNOSTICS 0
+#endif
+
+#ifndef JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON
+    #define JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON 0
+#endif
+
+#if JSON_DIAGNOSTICS
+    #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS _diag
+#else
+    #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS
+#endif
+
+#if JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON
+    #define NLOHMANN_JSON_ABI_TAG_LEGACY_DISCARDED_VALUE_COMPARISON _ldvcmp
+#else
+    #define NLOHMANN_JSON_ABI_TAG_LEGACY_DISCARDED_VALUE_COMPARISON
+#endif
+
+#ifndef NLOHMANN_JSON_NAMESPACE_NO_VERSION
+    #define NLOHMANN_JSON_NAMESPACE_NO_VERSION 0
+#endif
+
+// Construct the namespace ABI tags component
+#define NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b) json_abi ## a ## b
+#define NLOHMANN_JSON_ABI_TAGS_CONCAT(a, b) \
+    NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b)
+
+#define NLOHMANN_JSON_ABI_TAGS                                       \
+    NLOHMANN_JSON_ABI_TAGS_CONCAT(                                   \
+            NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS,                       \
+            NLOHMANN_JSON_ABI_TAG_LEGACY_DISCARDED_VALUE_COMPARISON)
+
+// Construct the namespace version component
+#define NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT_EX(major, minor, patch) \
+    _v ## major ## _ ## minor ## _ ## patch
+#define NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT(major, minor, patch) \
+    NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT_EX(major, minor, patch)
+
+#if NLOHMANN_JSON_NAMESPACE_NO_VERSION
+#define NLOHMANN_JSON_NAMESPACE_VERSION
+#else
+#define NLOHMANN_JSON_NAMESPACE_VERSION                                 \
+    NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT(NLOHMANN_JSON_VERSION_MAJOR, \
+                                           NLOHMANN_JSON_VERSION_MINOR, \
+                                           NLOHMANN_JSON_VERSION_PATCH)
+#endif
+
+// Combine namespace components
+#define NLOHMANN_JSON_NAMESPACE_CONCAT_EX(a, b) a ## b
+#define NLOHMANN_JSON_NAMESPACE_CONCAT(a, b) \
+    NLOHMANN_JSON_NAMESPACE_CONCAT_EX(a, b)
+
+#ifndef NLOHMANN_JSON_NAMESPACE
+#define NLOHMANN_JSON_NAMESPACE               \
+    nlohmann::NLOHMANN_JSON_NAMESPACE_CONCAT( \
+            NLOHMANN_JSON_ABI_TAGS,           \
+            NLOHMANN_JSON_NAMESPACE_VERSION)
+#endif
+
+#ifndef NLOHMANN_JSON_NAMESPACE_BEGIN
+#define NLOHMANN_JSON_NAMESPACE_BEGIN                \
+    namespace nlohmann                               \
+    {                                                \
+    inline namespace NLOHMANN_JSON_NAMESPACE_CONCAT( \
+                NLOHMANN_JSON_ABI_TAGS,              \
+                NLOHMANN_JSON_NAMESPACE_VERSION)     \
+    {
+#endif
+
+#ifndef NLOHMANN_JSON_NAMESPACE_END
+#define NLOHMANN_JSON_NAMESPACE_END                                     \
+    }  /* namespace (inline namespace) NOLINT(readability/namespace) */ \
+    }  // namespace nlohmann
+#endif
+
+// #include <nlohmann/detail/conversions/from_json.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // transform
+#include <array> // array
+#include <forward_list> // forward_list
+#include <iterator> // inserter, front_inserter, end
+#include <map> // map
+#include <string> // string
+#include <tuple> // tuple, make_tuple
+#include <type_traits> // is_arithmetic, is_same, is_enum, underlying_type, is_convertible
+#include <unordered_map> // unordered_map
+#include <utility> // pair, declval
+#include <valarray> // valarray
+
+// #include <nlohmann/detail/exceptions.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstddef> // nullptr_t
+#include <exception> // exception
+#if JSON_DIAGNOSTICS
+    #include <numeric> // accumulate
+#endif
+#include <stdexcept> // runtime_error
+#include <string> // to_string
+#include <vector> // vector
+
+// #include <nlohmann/detail/value_t.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <array> // array
+#include <cstddef> // size_t
+#include <cstdint> // uint8_t
+#include <string> // string
+
+// #include <nlohmann/detail/macro_scope.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <utility> // declval, pair
+// #include <nlohmann/detail/meta/detected.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <type_traits>
+
+// #include <nlohmann/detail/meta/void_t.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename ...Ts> struct make_void
+{
+    using type = void;
+};
+template<typename ...Ts> using void_t = typename make_void<Ts...>::type;
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+// https://en.cppreference.com/w/cpp/experimental/is_detected
+struct nonesuch
+{
+    nonesuch() = delete;
+    ~nonesuch() = delete;
+    nonesuch(nonesuch const&) = delete;
+    nonesuch(nonesuch const&&) = delete;
+    void operator=(nonesuch const&) = delete;
+    void operator=(nonesuch&&) = delete;
+};
+
+template<class Default,
+         class AlwaysVoid,
+         template<class...> class Op,
+         class... Args>
+struct detector
+{
+    using value_t = std::false_type;
+    using type = Default;
+};
+
+template<class Default, template<class...> class Op, class... Args>
+struct detector<Default, void_t<Op<Args...>>, Op, Args...>
+{
+    using value_t = std::true_type;
+    using type = Op<Args...>;
+};
+
+template<template<class...> class Op, class... Args>
+using is_detected = typename detector<nonesuch, void, Op, Args...>::value_t;
+
+template<template<class...> class Op, class... Args>
+struct is_detected_lazy : is_detected<Op, Args...> { };
+
+template<template<class...> class Op, class... Args>
+using detected_t = typename detector<nonesuch, void, Op, Args...>::type;
+
+template<class Default, template<class...> class Op, class... Args>
+using detected_or = detector<Default, void, Op, Args...>;
+
+template<class Default, template<class...> class Op, class... Args>
+using detected_or_t = typename detected_or<Default, Op, Args...>::type;
+
+template<class Expected, template<class...> class Op, class... Args>
+using is_detected_exact = std::is_same<Expected, detected_t<Op, Args...>>;
+
+template<class To, template<class...> class Op, class... Args>
+using is_detected_convertible =
+    std::is_convertible<detected_t<Op, Args...>, To>;
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/thirdparty/hedley/hedley.hpp>
+
+
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-FileCopyrightText: 2016-2021 Evan Nemerson <evan@nemerson.com>
+// SPDX-License-Identifier: MIT
+
+/* Hedley - https://nemequ.github.io/hedley
+ * Created by Evan Nemerson <evan@nemerson.com>
+ */
+
+#if !defined(JSON_HEDLEY_VERSION) || (JSON_HEDLEY_VERSION < 15)
+#if defined(JSON_HEDLEY_VERSION)
+    #undef JSON_HEDLEY_VERSION
+#endif
+#define JSON_HEDLEY_VERSION 15
+
+#if defined(JSON_HEDLEY_STRINGIFY_EX)
+    #undef JSON_HEDLEY_STRINGIFY_EX
+#endif
+#define JSON_HEDLEY_STRINGIFY_EX(x) #x
+
+#if defined(JSON_HEDLEY_STRINGIFY)
+    #undef JSON_HEDLEY_STRINGIFY
+#endif
+#define JSON_HEDLEY_STRINGIFY(x) JSON_HEDLEY_STRINGIFY_EX(x)
+
+#if defined(JSON_HEDLEY_CONCAT_EX)
+    #undef JSON_HEDLEY_CONCAT_EX
+#endif
+#define JSON_HEDLEY_CONCAT_EX(a,b) a##b
+
+#if defined(JSON_HEDLEY_CONCAT)
+    #undef JSON_HEDLEY_CONCAT
+#endif
+#define JSON_HEDLEY_CONCAT(a,b) JSON_HEDLEY_CONCAT_EX(a,b)
+
+#if defined(JSON_HEDLEY_CONCAT3_EX)
+    #undef JSON_HEDLEY_CONCAT3_EX
+#endif
+#define JSON_HEDLEY_CONCAT3_EX(a,b,c) a##b##c
+
+#if defined(JSON_HEDLEY_CONCAT3)
+    #undef JSON_HEDLEY_CONCAT3
+#endif
+#define JSON_HEDLEY_CONCAT3(a,b,c) JSON_HEDLEY_CONCAT3_EX(a,b,c)
+
+#if defined(JSON_HEDLEY_VERSION_ENCODE)
+    #undef JSON_HEDLEY_VERSION_ENCODE
+#endif
+#define JSON_HEDLEY_VERSION_ENCODE(major,minor,revision) (((major) * 1000000) + ((minor) * 1000) + (revision))
+
+#if defined(JSON_HEDLEY_VERSION_DECODE_MAJOR)
+    #undef JSON_HEDLEY_VERSION_DECODE_MAJOR
+#endif
+#define JSON_HEDLEY_VERSION_DECODE_MAJOR(version) ((version) / 1000000)
+
+#if defined(JSON_HEDLEY_VERSION_DECODE_MINOR)
+    #undef JSON_HEDLEY_VERSION_DECODE_MINOR
+#endif
+#define JSON_HEDLEY_VERSION_DECODE_MINOR(version) (((version) % 1000000) / 1000)
+
+#if defined(JSON_HEDLEY_VERSION_DECODE_REVISION)
+    #undef JSON_HEDLEY_VERSION_DECODE_REVISION
+#endif
+#define JSON_HEDLEY_VERSION_DECODE_REVISION(version) ((version) % 1000)
+
+#if defined(JSON_HEDLEY_GNUC_VERSION)
+    #undef JSON_HEDLEY_GNUC_VERSION
+#endif
+#if defined(__GNUC__) && defined(__GNUC_PATCHLEVEL__)
+    #define JSON_HEDLEY_GNUC_VERSION JSON_HEDLEY_VERSION_ENCODE(__GNUC__, __GNUC_MINOR__, __GNUC_PATCHLEVEL__)
+#elif defined(__GNUC__)
+    #define JSON_HEDLEY_GNUC_VERSION JSON_HEDLEY_VERSION_ENCODE(__GNUC__, __GNUC_MINOR__, 0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_VERSION_CHECK)
+    #undef JSON_HEDLEY_GNUC_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_GNUC_VERSION)
+    #define JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_GNUC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_MSVC_VERSION)
+    #undef JSON_HEDLEY_MSVC_VERSION
+#endif
+#if defined(_MSC_FULL_VER) && (_MSC_FULL_VER >= 140000000) && !defined(__ICL)
+    #define JSON_HEDLEY_MSVC_VERSION JSON_HEDLEY_VERSION_ENCODE(_MSC_FULL_VER / 10000000, (_MSC_FULL_VER % 10000000) / 100000, (_MSC_FULL_VER % 100000) / 100)
+#elif defined(_MSC_FULL_VER) && !defined(__ICL)
+    #define JSON_HEDLEY_MSVC_VERSION JSON_HEDLEY_VERSION_ENCODE(_MSC_FULL_VER / 1000000, (_MSC_FULL_VER % 1000000) / 10000, (_MSC_FULL_VER % 10000) / 10)
+#elif defined(_MSC_VER) && !defined(__ICL)
+    #define JSON_HEDLEY_MSVC_VERSION JSON_HEDLEY_VERSION_ENCODE(_MSC_VER / 100, _MSC_VER % 100, 0)
+#endif
+
+#if defined(JSON_HEDLEY_MSVC_VERSION_CHECK)
+    #undef JSON_HEDLEY_MSVC_VERSION_CHECK
+#endif
+#if !defined(JSON_HEDLEY_MSVC_VERSION)
+    #define JSON_HEDLEY_MSVC_VERSION_CHECK(major,minor,patch) (0)
+#elif defined(_MSC_VER) && (_MSC_VER >= 1400)
+    #define JSON_HEDLEY_MSVC_VERSION_CHECK(major,minor,patch) (_MSC_FULL_VER >= ((major * 10000000) + (minor * 100000) + (patch)))
+#elif defined(_MSC_VER) && (_MSC_VER >= 1200)
+    #define JSON_HEDLEY_MSVC_VERSION_CHECK(major,minor,patch) (_MSC_FULL_VER >= ((major * 1000000) + (minor * 10000) + (patch)))
+#else
+    #define JSON_HEDLEY_MSVC_VERSION_CHECK(major,minor,patch) (_MSC_VER >= ((major * 100) + (minor)))
+#endif
+
+#if defined(JSON_HEDLEY_INTEL_VERSION)
+    #undef JSON_HEDLEY_INTEL_VERSION
+#endif
+#if defined(__INTEL_COMPILER) && defined(__INTEL_COMPILER_UPDATE) && !defined(__ICL)
+    #define JSON_HEDLEY_INTEL_VERSION JSON_HEDLEY_VERSION_ENCODE(__INTEL_COMPILER / 100, __INTEL_COMPILER % 100, __INTEL_COMPILER_UPDATE)
+#elif defined(__INTEL_COMPILER) && !defined(__ICL)
+    #define JSON_HEDLEY_INTEL_VERSION JSON_HEDLEY_VERSION_ENCODE(__INTEL_COMPILER / 100, __INTEL_COMPILER % 100, 0)
+#endif
+
+#if defined(JSON_HEDLEY_INTEL_VERSION_CHECK)
+    #undef JSON_HEDLEY_INTEL_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_INTEL_VERSION)
+    #define JSON_HEDLEY_INTEL_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_INTEL_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_INTEL_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_INTEL_CL_VERSION)
+    #undef JSON_HEDLEY_INTEL_CL_VERSION
+#endif
+#if defined(__INTEL_COMPILER) && defined(__INTEL_COMPILER_UPDATE) && defined(__ICL)
+    #define JSON_HEDLEY_INTEL_CL_VERSION JSON_HEDLEY_VERSION_ENCODE(__INTEL_COMPILER, __INTEL_COMPILER_UPDATE, 0)
+#endif
+
+#if defined(JSON_HEDLEY_INTEL_CL_VERSION_CHECK)
+    #undef JSON_HEDLEY_INTEL_CL_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_INTEL_CL_VERSION)
+    #define JSON_HEDLEY_INTEL_CL_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_INTEL_CL_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_INTEL_CL_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_PGI_VERSION)
+    #undef JSON_HEDLEY_PGI_VERSION
+#endif
+#if defined(__PGI) && defined(__PGIC__) && defined(__PGIC_MINOR__) && defined(__PGIC_PATCHLEVEL__)
+    #define JSON_HEDLEY_PGI_VERSION JSON_HEDLEY_VERSION_ENCODE(__PGIC__, __PGIC_MINOR__, __PGIC_PATCHLEVEL__)
+#endif
+
+#if defined(JSON_HEDLEY_PGI_VERSION_CHECK)
+    #undef JSON_HEDLEY_PGI_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_PGI_VERSION)
+    #define JSON_HEDLEY_PGI_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_PGI_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_PGI_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_SUNPRO_VERSION)
+    #undef JSON_HEDLEY_SUNPRO_VERSION
+#endif
+#if defined(__SUNPRO_C) && (__SUNPRO_C > 0x1000)
+    #define JSON_HEDLEY_SUNPRO_VERSION JSON_HEDLEY_VERSION_ENCODE((((__SUNPRO_C >> 16) & 0xf) * 10) + ((__SUNPRO_C >> 12) & 0xf), (((__SUNPRO_C >> 8) & 0xf) * 10) + ((__SUNPRO_C >> 4) & 0xf), (__SUNPRO_C & 0xf) * 10)
+#elif defined(__SUNPRO_C)
+    #define JSON_HEDLEY_SUNPRO_VERSION JSON_HEDLEY_VERSION_ENCODE((__SUNPRO_C >> 8) & 0xf, (__SUNPRO_C >> 4) & 0xf, (__SUNPRO_C) & 0xf)
+#elif defined(__SUNPRO_CC) && (__SUNPRO_CC > 0x1000)
+    #define JSON_HEDLEY_SUNPRO_VERSION JSON_HEDLEY_VERSION_ENCODE((((__SUNPRO_CC >> 16) & 0xf) * 10) + ((__SUNPRO_CC >> 12) & 0xf), (((__SUNPRO_CC >> 8) & 0xf) * 10) + ((__SUNPRO_CC >> 4) & 0xf), (__SUNPRO_CC & 0xf) * 10)
+#elif defined(__SUNPRO_CC)
+    #define JSON_HEDLEY_SUNPRO_VERSION JSON_HEDLEY_VERSION_ENCODE((__SUNPRO_CC >> 8) & 0xf, (__SUNPRO_CC >> 4) & 0xf, (__SUNPRO_CC) & 0xf)
+#endif
+
+#if defined(JSON_HEDLEY_SUNPRO_VERSION_CHECK)
+    #undef JSON_HEDLEY_SUNPRO_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_SUNPRO_VERSION)
+    #define JSON_HEDLEY_SUNPRO_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_SUNPRO_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_SUNPRO_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_EMSCRIPTEN_VERSION)
+    #undef JSON_HEDLEY_EMSCRIPTEN_VERSION
+#endif
+#if defined(__EMSCRIPTEN__)
+    #define JSON_HEDLEY_EMSCRIPTEN_VERSION JSON_HEDLEY_VERSION_ENCODE(__EMSCRIPTEN_major__, __EMSCRIPTEN_minor__, __EMSCRIPTEN_tiny__)
+#endif
+
+#if defined(JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK)
+    #undef JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_EMSCRIPTEN_VERSION)
+    #define JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_EMSCRIPTEN_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_ARM_VERSION)
+    #undef JSON_HEDLEY_ARM_VERSION
+#endif
+#if defined(__CC_ARM) && defined(__ARMCOMPILER_VERSION)
+    #define JSON_HEDLEY_ARM_VERSION JSON_HEDLEY_VERSION_ENCODE(__ARMCOMPILER_VERSION / 1000000, (__ARMCOMPILER_VERSION % 1000000) / 10000, (__ARMCOMPILER_VERSION % 10000) / 100)
+#elif defined(__CC_ARM) && defined(__ARMCC_VERSION)
+    #define JSON_HEDLEY_ARM_VERSION JSON_HEDLEY_VERSION_ENCODE(__ARMCC_VERSION / 1000000, (__ARMCC_VERSION % 1000000) / 10000, (__ARMCC_VERSION % 10000) / 100)
+#endif
+
+#if defined(JSON_HEDLEY_ARM_VERSION_CHECK)
+    #undef JSON_HEDLEY_ARM_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_ARM_VERSION)
+    #define JSON_HEDLEY_ARM_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_ARM_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_ARM_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_IBM_VERSION)
+    #undef JSON_HEDLEY_IBM_VERSION
+#endif
+#if defined(__ibmxl__)
+    #define JSON_HEDLEY_IBM_VERSION JSON_HEDLEY_VERSION_ENCODE(__ibmxl_version__, __ibmxl_release__, __ibmxl_modification__)
+#elif defined(__xlC__) && defined(__xlC_ver__)
+    #define JSON_HEDLEY_IBM_VERSION JSON_HEDLEY_VERSION_ENCODE(__xlC__ >> 8, __xlC__ & 0xff, (__xlC_ver__ >> 8) & 0xff)
+#elif defined(__xlC__)
+    #define JSON_HEDLEY_IBM_VERSION JSON_HEDLEY_VERSION_ENCODE(__xlC__ >> 8, __xlC__ & 0xff, 0)
+#endif
+
+#if defined(JSON_HEDLEY_IBM_VERSION_CHECK)
+    #undef JSON_HEDLEY_IBM_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_IBM_VERSION)
+    #define JSON_HEDLEY_IBM_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_IBM_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_IBM_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_VERSION)
+    #undef JSON_HEDLEY_TI_VERSION
+#endif
+#if \
+    defined(__TI_COMPILER_VERSION__) && \
+    ( \
+      defined(__TMS470__) || defined(__TI_ARM__) || \
+      defined(__MSP430__) || \
+      defined(__TMS320C2000__) \
+    )
+#if (__TI_COMPILER_VERSION__ >= 16000000)
+    #define JSON_HEDLEY_TI_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+#endif
+
+#if defined(JSON_HEDLEY_TI_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_VERSION)
+    #define JSON_HEDLEY_TI_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL2000_VERSION)
+    #undef JSON_HEDLEY_TI_CL2000_VERSION
+#endif
+#if defined(__TI_COMPILER_VERSION__) && defined(__TMS320C2000__)
+    #define JSON_HEDLEY_TI_CL2000_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL2000_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_CL2000_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_CL2000_VERSION)
+    #define JSON_HEDLEY_TI_CL2000_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL2000_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_CL2000_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL430_VERSION)
+    #undef JSON_HEDLEY_TI_CL430_VERSION
+#endif
+#if defined(__TI_COMPILER_VERSION__) && defined(__MSP430__)
+    #define JSON_HEDLEY_TI_CL430_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL430_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_CL430_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_CL430_VERSION)
+    #define JSON_HEDLEY_TI_CL430_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL430_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_CL430_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_ARMCL_VERSION)
+    #undef JSON_HEDLEY_TI_ARMCL_VERSION
+#endif
+#if defined(__TI_COMPILER_VERSION__) && (defined(__TMS470__) || defined(__TI_ARM__))
+    #define JSON_HEDLEY_TI_ARMCL_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(JSON_HEDLEY_TI_ARMCL_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_ARMCL_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_ARMCL_VERSION)
+    #define JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_ARMCL_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL6X_VERSION)
+    #undef JSON_HEDLEY_TI_CL6X_VERSION
+#endif
+#if defined(__TI_COMPILER_VERSION__) && defined(__TMS320C6X__)
+    #define JSON_HEDLEY_TI_CL6X_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL6X_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_CL6X_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_CL6X_VERSION)
+    #define JSON_HEDLEY_TI_CL6X_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL6X_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_CL6X_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL7X_VERSION)
+    #undef JSON_HEDLEY_TI_CL7X_VERSION
+#endif
+#if defined(__TI_COMPILER_VERSION__) && defined(__C7000__)
+    #define JSON_HEDLEY_TI_CL7X_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(JSON_HEDLEY_TI_CL7X_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_CL7X_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_CL7X_VERSION)
+    #define JSON_HEDLEY_TI_CL7X_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL7X_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_CL7X_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TI_CLPRU_VERSION)
+    #undef JSON_HEDLEY_TI_CLPRU_VERSION
+#endif
+#if defined(__TI_COMPILER_VERSION__) && defined(__PRU__)
+    #define JSON_HEDLEY_TI_CLPRU_VERSION JSON_HEDLEY_VERSION_ENCODE(__TI_COMPILER_VERSION__ / 1000000, (__TI_COMPILER_VERSION__ % 1000000) / 1000, (__TI_COMPILER_VERSION__ % 1000))
+#endif
+
+#if defined(JSON_HEDLEY_TI_CLPRU_VERSION_CHECK)
+    #undef JSON_HEDLEY_TI_CLPRU_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TI_CLPRU_VERSION)
+    #define JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CLPRU_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_CRAY_VERSION)
+    #undef JSON_HEDLEY_CRAY_VERSION
+#endif
+#if defined(_CRAYC)
+    #if defined(_RELEASE_PATCHLEVEL)
+        #define JSON_HEDLEY_CRAY_VERSION JSON_HEDLEY_VERSION_ENCODE(_RELEASE_MAJOR, _RELEASE_MINOR, _RELEASE_PATCHLEVEL)
+    #else
+        #define JSON_HEDLEY_CRAY_VERSION JSON_HEDLEY_VERSION_ENCODE(_RELEASE_MAJOR, _RELEASE_MINOR, 0)
+    #endif
+#endif
+
+#if defined(JSON_HEDLEY_CRAY_VERSION_CHECK)
+    #undef JSON_HEDLEY_CRAY_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_CRAY_VERSION)
+    #define JSON_HEDLEY_CRAY_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_CRAY_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_CRAY_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_IAR_VERSION)
+    #undef JSON_HEDLEY_IAR_VERSION
+#endif
+#if defined(__IAR_SYSTEMS_ICC__)
+    #if __VER__ > 1000
+        #define JSON_HEDLEY_IAR_VERSION JSON_HEDLEY_VERSION_ENCODE((__VER__ / 1000000), ((__VER__ / 1000) % 1000), (__VER__ % 1000))
+    #else
+        #define JSON_HEDLEY_IAR_VERSION JSON_HEDLEY_VERSION_ENCODE(__VER__ / 100, __VER__ % 100, 0)
+    #endif
+#endif
+
+#if defined(JSON_HEDLEY_IAR_VERSION_CHECK)
+    #undef JSON_HEDLEY_IAR_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_IAR_VERSION)
+    #define JSON_HEDLEY_IAR_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_IAR_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_IAR_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_TINYC_VERSION)
+    #undef JSON_HEDLEY_TINYC_VERSION
+#endif
+#if defined(__TINYC__)
+    #define JSON_HEDLEY_TINYC_VERSION JSON_HEDLEY_VERSION_ENCODE(__TINYC__ / 1000, (__TINYC__ / 100) % 10, __TINYC__ % 100)
+#endif
+
+#if defined(JSON_HEDLEY_TINYC_VERSION_CHECK)
+    #undef JSON_HEDLEY_TINYC_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_TINYC_VERSION)
+    #define JSON_HEDLEY_TINYC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TINYC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_TINYC_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_DMC_VERSION)
+    #undef JSON_HEDLEY_DMC_VERSION
+#endif
+#if defined(__DMC__)
+    #define JSON_HEDLEY_DMC_VERSION JSON_HEDLEY_VERSION_ENCODE(__DMC__ >> 8, (__DMC__ >> 4) & 0xf, __DMC__ & 0xf)
+#endif
+
+#if defined(JSON_HEDLEY_DMC_VERSION_CHECK)
+    #undef JSON_HEDLEY_DMC_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_DMC_VERSION)
+    #define JSON_HEDLEY_DMC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_DMC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_DMC_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_COMPCERT_VERSION)
+    #undef JSON_HEDLEY_COMPCERT_VERSION
+#endif
+#if defined(__COMPCERT_VERSION__)
+    #define JSON_HEDLEY_COMPCERT_VERSION JSON_HEDLEY_VERSION_ENCODE(__COMPCERT_VERSION__ / 10000, (__COMPCERT_VERSION__ / 100) % 100, __COMPCERT_VERSION__ % 100)
+#endif
+
+#if defined(JSON_HEDLEY_COMPCERT_VERSION_CHECK)
+    #undef JSON_HEDLEY_COMPCERT_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_COMPCERT_VERSION)
+    #define JSON_HEDLEY_COMPCERT_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_COMPCERT_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_COMPCERT_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_PELLES_VERSION)
+    #undef JSON_HEDLEY_PELLES_VERSION
+#endif
+#if defined(__POCC__)
+    #define JSON_HEDLEY_PELLES_VERSION JSON_HEDLEY_VERSION_ENCODE(__POCC__ / 100, __POCC__ % 100, 0)
+#endif
+
+#if defined(JSON_HEDLEY_PELLES_VERSION_CHECK)
+    #undef JSON_HEDLEY_PELLES_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_PELLES_VERSION)
+    #define JSON_HEDLEY_PELLES_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_PELLES_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_PELLES_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_MCST_LCC_VERSION)
+    #undef JSON_HEDLEY_MCST_LCC_VERSION
+#endif
+#if defined(__LCC__) && defined(__LCC_MINOR__)
+    #define JSON_HEDLEY_MCST_LCC_VERSION JSON_HEDLEY_VERSION_ENCODE(__LCC__ / 100, __LCC__ % 100, __LCC_MINOR__)
+#endif
+
+#if defined(JSON_HEDLEY_MCST_LCC_VERSION_CHECK)
+    #undef JSON_HEDLEY_MCST_LCC_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_MCST_LCC_VERSION)
+    #define JSON_HEDLEY_MCST_LCC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_MCST_LCC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_MCST_LCC_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_VERSION)
+    #undef JSON_HEDLEY_GCC_VERSION
+#endif
+#if \
+    defined(JSON_HEDLEY_GNUC_VERSION) && \
+    !defined(__clang__) && \
+    !defined(JSON_HEDLEY_INTEL_VERSION) && \
+    !defined(JSON_HEDLEY_PGI_VERSION) && \
+    !defined(JSON_HEDLEY_ARM_VERSION) && \
+    !defined(JSON_HEDLEY_CRAY_VERSION) && \
+    !defined(JSON_HEDLEY_TI_VERSION) && \
+    !defined(JSON_HEDLEY_TI_ARMCL_VERSION) && \
+    !defined(JSON_HEDLEY_TI_CL430_VERSION) && \
+    !defined(JSON_HEDLEY_TI_CL2000_VERSION) && \
+    !defined(JSON_HEDLEY_TI_CL6X_VERSION) && \
+    !defined(JSON_HEDLEY_TI_CL7X_VERSION) && \
+    !defined(JSON_HEDLEY_TI_CLPRU_VERSION) && \
+    !defined(__COMPCERT__) && \
+    !defined(JSON_HEDLEY_MCST_LCC_VERSION)
+    #define JSON_HEDLEY_GCC_VERSION JSON_HEDLEY_GNUC_VERSION
+#endif
+
+#if defined(JSON_HEDLEY_GCC_VERSION_CHECK)
+    #undef JSON_HEDLEY_GCC_VERSION_CHECK
+#endif
+#if defined(JSON_HEDLEY_GCC_VERSION)
+    #define JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_GCC_VERSION >= JSON_HEDLEY_VERSION_ENCODE(major, minor, patch))
+#else
+    #define JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch) (0)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_ATTRIBUTE)
+    #undef JSON_HEDLEY_HAS_ATTRIBUTE
+#endif
+#if \
+  defined(__has_attribute) && \
+  ( \
+    (!defined(JSON_HEDLEY_IAR_VERSION) || JSON_HEDLEY_IAR_VERSION_CHECK(8,5,9)) \
+  )
+#  define JSON_HEDLEY_HAS_ATTRIBUTE(attribute) __has_attribute(attribute)
+#else
+#  define JSON_HEDLEY_HAS_ATTRIBUTE(attribute) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_ATTRIBUTE)
+    #undef JSON_HEDLEY_GNUC_HAS_ATTRIBUTE
+#endif
+#if defined(__has_attribute)
+    #define JSON_HEDLEY_GNUC_HAS_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_HAS_ATTRIBUTE(attribute)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_ATTRIBUTE)
+    #undef JSON_HEDLEY_GCC_HAS_ATTRIBUTE
+#endif
+#if defined(__has_attribute)
+    #define JSON_HEDLEY_GCC_HAS_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_HAS_ATTRIBUTE(attribute)
+#else
+    #define JSON_HEDLEY_GCC_HAS_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_CPP_ATTRIBUTE)
+    #undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE
+#endif
+#if \
+    defined(__has_cpp_attribute) && \
+    defined(__cplusplus) && \
+    (!defined(JSON_HEDLEY_SUNPRO_VERSION) || JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,15,0))
+    #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE(attribute) __has_cpp_attribute(attribute)
+#else
+    #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE(attribute) (0)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS)
+    #undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS
+#endif
+#if !defined(__cplusplus) || !defined(__has_cpp_attribute)
+    #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS(ns,attribute) (0)
+#elif \
+    !defined(JSON_HEDLEY_PGI_VERSION) && \
+    !defined(JSON_HEDLEY_IAR_VERSION) && \
+    (!defined(JSON_HEDLEY_SUNPRO_VERSION) || JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,15,0)) && \
+    (!defined(JSON_HEDLEY_MSVC_VERSION) || JSON_HEDLEY_MSVC_VERSION_CHECK(19,20,0))
+    #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS(ns,attribute) JSON_HEDLEY_HAS_CPP_ATTRIBUTE(ns::attribute)
+#else
+    #define JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS(ns,attribute) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE)
+    #undef JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE
+#endif
+#if defined(__has_cpp_attribute) && defined(__cplusplus)
+    #define JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE(attribute,major,minor,patch) __has_cpp_attribute(attribute)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE)
+    #undef JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE
+#endif
+#if defined(__has_cpp_attribute) && defined(__cplusplus)
+    #define JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE(attribute,major,minor,patch) __has_cpp_attribute(attribute)
+#else
+    #define JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_BUILTIN)
+    #undef JSON_HEDLEY_HAS_BUILTIN
+#endif
+#if defined(__has_builtin)
+    #define JSON_HEDLEY_HAS_BUILTIN(builtin) __has_builtin(builtin)
+#else
+    #define JSON_HEDLEY_HAS_BUILTIN(builtin) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_BUILTIN)
+    #undef JSON_HEDLEY_GNUC_HAS_BUILTIN
+#endif
+#if defined(__has_builtin)
+    #define JSON_HEDLEY_GNUC_HAS_BUILTIN(builtin,major,minor,patch) __has_builtin(builtin)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_BUILTIN(builtin,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_BUILTIN)
+    #undef JSON_HEDLEY_GCC_HAS_BUILTIN
+#endif
+#if defined(__has_builtin)
+    #define JSON_HEDLEY_GCC_HAS_BUILTIN(builtin,major,minor,patch) __has_builtin(builtin)
+#else
+    #define JSON_HEDLEY_GCC_HAS_BUILTIN(builtin,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_FEATURE)
+    #undef JSON_HEDLEY_HAS_FEATURE
+#endif
+#if defined(__has_feature)
+    #define JSON_HEDLEY_HAS_FEATURE(feature) __has_feature(feature)
+#else
+    #define JSON_HEDLEY_HAS_FEATURE(feature) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_FEATURE)
+    #undef JSON_HEDLEY_GNUC_HAS_FEATURE
+#endif
+#if defined(__has_feature)
+    #define JSON_HEDLEY_GNUC_HAS_FEATURE(feature,major,minor,patch) __has_feature(feature)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_FEATURE(feature,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_FEATURE)
+    #undef JSON_HEDLEY_GCC_HAS_FEATURE
+#endif
+#if defined(__has_feature)
+    #define JSON_HEDLEY_GCC_HAS_FEATURE(feature,major,minor,patch) __has_feature(feature)
+#else
+    #define JSON_HEDLEY_GCC_HAS_FEATURE(feature,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_EXTENSION)
+    #undef JSON_HEDLEY_HAS_EXTENSION
+#endif
+#if defined(__has_extension)
+    #define JSON_HEDLEY_HAS_EXTENSION(extension) __has_extension(extension)
+#else
+    #define JSON_HEDLEY_HAS_EXTENSION(extension) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_EXTENSION)
+    #undef JSON_HEDLEY_GNUC_HAS_EXTENSION
+#endif
+#if defined(__has_extension)
+    #define JSON_HEDLEY_GNUC_HAS_EXTENSION(extension,major,minor,patch) __has_extension(extension)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_EXTENSION(extension,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_EXTENSION)
+    #undef JSON_HEDLEY_GCC_HAS_EXTENSION
+#endif
+#if defined(__has_extension)
+    #define JSON_HEDLEY_GCC_HAS_EXTENSION(extension,major,minor,patch) __has_extension(extension)
+#else
+    #define JSON_HEDLEY_GCC_HAS_EXTENSION(extension,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE)
+    #undef JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE
+#endif
+#if defined(__has_declspec_attribute)
+    #define JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE(attribute) __has_declspec_attribute(attribute)
+#else
+    #define JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE(attribute) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE)
+    #undef JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE
+#endif
+#if defined(__has_declspec_attribute)
+    #define JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) __has_declspec_attribute(attribute)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE)
+    #undef JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE
+#endif
+#if defined(__has_declspec_attribute)
+    #define JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) __has_declspec_attribute(attribute)
+#else
+    #define JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_HAS_WARNING)
+    #undef JSON_HEDLEY_HAS_WARNING
+#endif
+#if defined(__has_warning)
+    #define JSON_HEDLEY_HAS_WARNING(warning) __has_warning(warning)
+#else
+    #define JSON_HEDLEY_HAS_WARNING(warning) (0)
+#endif
+
+#if defined(JSON_HEDLEY_GNUC_HAS_WARNING)
+    #undef JSON_HEDLEY_GNUC_HAS_WARNING
+#endif
+#if defined(__has_warning)
+    #define JSON_HEDLEY_GNUC_HAS_WARNING(warning,major,minor,patch) __has_warning(warning)
+#else
+    #define JSON_HEDLEY_GNUC_HAS_WARNING(warning,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_GCC_HAS_WARNING)
+    #undef JSON_HEDLEY_GCC_HAS_WARNING
+#endif
+#if defined(__has_warning)
+    #define JSON_HEDLEY_GCC_HAS_WARNING(warning,major,minor,patch) __has_warning(warning)
+#else
+    #define JSON_HEDLEY_GCC_HAS_WARNING(warning,major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if \
+    (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)) || \
+    defined(__clang__) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,0,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) || \
+    JSON_HEDLEY_PGI_VERSION_CHECK(18,4,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,7,0) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(2,0,1) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,1,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,0,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_CRAY_VERSION_CHECK(5,0,0) || \
+    JSON_HEDLEY_TINYC_VERSION_CHECK(0,9,17) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(8,0,0) || \
+    (JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) && defined(__C99_PRAGMA_OPERATOR))
+    #define JSON_HEDLEY_PRAGMA(value) _Pragma(#value)
+#elif JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0)
+    #define JSON_HEDLEY_PRAGMA(value) __pragma(value)
+#else
+    #define JSON_HEDLEY_PRAGMA(value)
+#endif
+
+#if defined(JSON_HEDLEY_DIAGNOSTIC_PUSH)
+    #undef JSON_HEDLEY_DIAGNOSTIC_PUSH
+#endif
+#if defined(JSON_HEDLEY_DIAGNOSTIC_POP)
+    #undef JSON_HEDLEY_DIAGNOSTIC_POP
+#endif
+#if defined(__clang__)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("clang diagnostic push")
+    #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("clang diagnostic pop")
+#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("warning(push)")
+    #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("warning(pop)")
+#elif JSON_HEDLEY_GCC_VERSION_CHECK(4,6,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("GCC diagnostic push")
+    #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("GCC diagnostic pop")
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH __pragma(warning(push))
+    #define JSON_HEDLEY_DIAGNOSTIC_POP __pragma(warning(pop))
+#elif JSON_HEDLEY_ARM_VERSION_CHECK(5,6,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("push")
+    #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("pop")
+#elif \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,4,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,1,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("diag_push")
+    #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("diag_pop")
+#elif JSON_HEDLEY_PELLES_VERSION_CHECK(2,90,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH _Pragma("warning(push)")
+    #define JSON_HEDLEY_DIAGNOSTIC_POP _Pragma("warning(pop)")
+#else
+    #define JSON_HEDLEY_DIAGNOSTIC_PUSH
+    #define JSON_HEDLEY_DIAGNOSTIC_POP
+#endif
+
+/* JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_ is for
+   HEDLEY INTERNAL USE ONLY.  API subject to change without notice. */
+#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_)
+    #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_
+#endif
+#if defined(__cplusplus)
+#  if JSON_HEDLEY_HAS_WARNING("-Wc++98-compat")
+#    if JSON_HEDLEY_HAS_WARNING("-Wc++17-extensions")
+#      if JSON_HEDLEY_HAS_WARNING("-Wc++1z-extensions")
+#        define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(xpr) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("clang diagnostic ignored \"-Wc++98-compat\"") \
+    _Pragma("clang diagnostic ignored \"-Wc++17-extensions\"") \
+    _Pragma("clang diagnostic ignored \"-Wc++1z-extensions\"") \
+    xpr \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#      else
+#        define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(xpr) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("clang diagnostic ignored \"-Wc++98-compat\"") \
+    _Pragma("clang diagnostic ignored \"-Wc++17-extensions\"") \
+    xpr \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#      endif
+#    else
+#      define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(xpr) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("clang diagnostic ignored \"-Wc++98-compat\"") \
+    xpr \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#    endif
+#  endif
+#endif
+#if !defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(x) x
+#endif
+
+#if defined(JSON_HEDLEY_CONST_CAST)
+    #undef JSON_HEDLEY_CONST_CAST
+#endif
+#if defined(__cplusplus)
+#  define JSON_HEDLEY_CONST_CAST(T, expr) (const_cast<T>(expr))
+#elif \
+  JSON_HEDLEY_HAS_WARNING("-Wcast-qual") || \
+  JSON_HEDLEY_GCC_VERSION_CHECK(4,6,0) || \
+  JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+#  define JSON_HEDLEY_CONST_CAST(T, expr) (__extension__ ({ \
+        JSON_HEDLEY_DIAGNOSTIC_PUSH \
+        JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL \
+        ((T) (expr)); \
+        JSON_HEDLEY_DIAGNOSTIC_POP \
+    }))
+#else
+#  define JSON_HEDLEY_CONST_CAST(T, expr) ((T) (expr))
+#endif
+
+#if defined(JSON_HEDLEY_REINTERPRET_CAST)
+    #undef JSON_HEDLEY_REINTERPRET_CAST
+#endif
+#if defined(__cplusplus)
+    #define JSON_HEDLEY_REINTERPRET_CAST(T, expr) (reinterpret_cast<T>(expr))
+#else
+    #define JSON_HEDLEY_REINTERPRET_CAST(T, expr) ((T) (expr))
+#endif
+
+#if defined(JSON_HEDLEY_STATIC_CAST)
+    #undef JSON_HEDLEY_STATIC_CAST
+#endif
+#if defined(__cplusplus)
+    #define JSON_HEDLEY_STATIC_CAST(T, expr) (static_cast<T>(expr))
+#else
+    #define JSON_HEDLEY_STATIC_CAST(T, expr) ((T) (expr))
+#endif
+
+#if defined(JSON_HEDLEY_CPP_CAST)
+    #undef JSON_HEDLEY_CPP_CAST
+#endif
+#if defined(__cplusplus)
+#  if JSON_HEDLEY_HAS_WARNING("-Wold-style-cast")
+#    define JSON_HEDLEY_CPP_CAST(T, expr) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("clang diagnostic ignored \"-Wold-style-cast\"") \
+    ((T) (expr)) \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#  elif JSON_HEDLEY_IAR_VERSION_CHECK(8,3,0)
+#    define JSON_HEDLEY_CPP_CAST(T, expr) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("diag_suppress=Pe137") \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#  else
+#    define JSON_HEDLEY_CPP_CAST(T, expr) ((T) (expr))
+#  endif
+#else
+#  define JSON_HEDLEY_CPP_CAST(T, expr) (expr)
+#endif
+
+#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED)
+    #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wdeprecated-declarations")
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("clang diagnostic ignored \"-Wdeprecated-declarations\"")
+#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("warning(disable:1478 1786)")
+#elif JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED __pragma(warning(disable:1478 1786))
+#elif JSON_HEDLEY_PGI_VERSION_CHECK(20,7,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress 1215,1216,1444,1445")
+#elif JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress 1215,1444")
+#elif JSON_HEDLEY_GCC_VERSION_CHECK(4,3,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("GCC diagnostic ignored \"-Wdeprecated-declarations\"")
+#elif JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED __pragma(warning(disable:4996))
+#elif JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress 1215,1444")
+#elif \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress 1291,1718")
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,13,0) && !defined(__cplusplus)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("error_messages(off,E_DEPRECATED_ATT,E_DEPRECATED_ATT_MESS)")
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,13,0) && defined(__cplusplus)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("error_messages(off,symdeprecated,symdeprecated2)")
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("diag_suppress=Pe1444,Pe1215")
+#elif JSON_HEDLEY_PELLES_VERSION_CHECK(2,90,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED _Pragma("warn(disable:2241)")
+#else
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED
+#endif
+
+#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS)
+    #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wunknown-pragmas")
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("clang diagnostic ignored \"-Wunknown-pragmas\"")
+#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("warning(disable:161)")
+#elif JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS __pragma(warning(disable:161))
+#elif JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress 1675")
+#elif JSON_HEDLEY_GCC_VERSION_CHECK(4,3,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("GCC diagnostic ignored \"-Wunknown-pragmas\"")
+#elif JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS __pragma(warning(disable:4068))
+#elif \
+    JSON_HEDLEY_TI_VERSION_CHECK(16,9,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,0,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,3,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress 163")
+#elif JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress 163")
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress=Pe161")
+#elif JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS _Pragma("diag_suppress 161")
+#else
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS
+#endif
+
+#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES)
+    #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wunknown-attributes")
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("clang diagnostic ignored \"-Wunknown-attributes\"")
+#elif JSON_HEDLEY_GCC_VERSION_CHECK(4,6,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("GCC diagnostic ignored \"-Wdeprecated-declarations\"")
+#elif JSON_HEDLEY_INTEL_VERSION_CHECK(17,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("warning(disable:1292)")
+#elif JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES __pragma(warning(disable:1292))
+#elif JSON_HEDLEY_MSVC_VERSION_CHECK(19,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES __pragma(warning(disable:5030))
+#elif JSON_HEDLEY_PGI_VERSION_CHECK(20,7,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress 1097,1098")
+#elif JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress 1097")
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,14,0) && defined(__cplusplus)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("error_messages(off,attrskipunsup)")
+#elif \
+    JSON_HEDLEY_TI_VERSION_CHECK(18,1,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,3,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress 1173")
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress=Pe1097")
+#elif JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES _Pragma("diag_suppress 1097")
+#else
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES
+#endif
+
+#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL)
+    #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wcast-qual")
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL _Pragma("clang diagnostic ignored \"-Wcast-qual\"")
+#elif JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL _Pragma("warning(disable:2203 2331)")
+#elif JSON_HEDLEY_GCC_VERSION_CHECK(3,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL _Pragma("GCC diagnostic ignored \"-Wcast-qual\"")
+#else
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL
+#endif
+
+#if defined(JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION)
+    #undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wunused-function")
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION _Pragma("clang diagnostic ignored \"-Wunused-function\"")
+#elif JSON_HEDLEY_GCC_VERSION_CHECK(3,4,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION _Pragma("GCC diagnostic ignored \"-Wunused-function\"")
+#elif JSON_HEDLEY_MSVC_VERSION_CHECK(1,0,0)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION __pragma(warning(disable:4505))
+#elif JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION _Pragma("diag_suppress 3142")
+#else
+    #define JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION
+#endif
+
+#if defined(JSON_HEDLEY_DEPRECATED)
+    #undef JSON_HEDLEY_DEPRECATED
+#endif
+#if defined(JSON_HEDLEY_DEPRECATED_FOR)
+    #undef JSON_HEDLEY_DEPRECATED_FOR
+#endif
+#if \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(14,0,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_DEPRECATED(since) __declspec(deprecated("Since " # since))
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) __declspec(deprecated("Since " #since "; use " #replacement))
+#elif \
+    (JSON_HEDLEY_HAS_EXTENSION(attribute_deprecated_with_message) && !defined(JSON_HEDLEY_IAR_VERSION)) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(4,5,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(5,6,0) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,13,0) || \
+    JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(18,1,0) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(18,1,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,3,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,3,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_DEPRECATED(since) __attribute__((__deprecated__("Since " #since)))
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) __attribute__((__deprecated__("Since " #since "; use " #replacement)))
+#elif defined(__cplusplus) && (__cplusplus >= 201402L)
+    #define JSON_HEDLEY_DEPRECATED(since) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[deprecated("Since " #since)]])
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[deprecated("Since " #since "; use " #replacement)]])
+#elif \
+    JSON_HEDLEY_HAS_ATTRIBUTE(deprecated) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,1,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10) || \
+    JSON_HEDLEY_IAR_VERSION_CHECK(8,10,0)
+    #define JSON_HEDLEY_DEPRECATED(since) __attribute__((__deprecated__))
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) __attribute__((__deprecated__))
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(13,10,0) || \
+    JSON_HEDLEY_PELLES_VERSION_CHECK(6,50,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_DEPRECATED(since) __declspec(deprecated)
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) __declspec(deprecated)
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_DEPRECATED(since) _Pragma("deprecated")
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement) _Pragma("deprecated")
+#else
+    #define JSON_HEDLEY_DEPRECATED(since)
+    #define JSON_HEDLEY_DEPRECATED_FOR(since, replacement)
+#endif
+
+#if defined(JSON_HEDLEY_UNAVAILABLE)
+    #undef JSON_HEDLEY_UNAVAILABLE
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(warning) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(4,3,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_UNAVAILABLE(available_since) __attribute__((__warning__("Not available until " #available_since)))
+#else
+    #define JSON_HEDLEY_UNAVAILABLE(available_since)
+#endif
+
+#if defined(JSON_HEDLEY_WARN_UNUSED_RESULT)
+    #undef JSON_HEDLEY_WARN_UNUSED_RESULT
+#endif
+#if defined(JSON_HEDLEY_WARN_UNUSED_RESULT_MSG)
+    #undef JSON_HEDLEY_WARN_UNUSED_RESULT_MSG
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(warn_unused_result) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,4,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    (JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,15,0) && defined(__cplusplus)) || \
+    JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT __attribute__((__warn_unused_result__))
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) __attribute__((__warn_unused_result__))
+#elif (JSON_HEDLEY_HAS_CPP_ATTRIBUTE(nodiscard) >= 201907L)
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[nodiscard]])
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[nodiscard(msg)]])
+#elif JSON_HEDLEY_HAS_CPP_ATTRIBUTE(nodiscard)
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[nodiscard]])
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[nodiscard]])
+#elif defined(_Check_return_) /* SAL */
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT _Check_return_
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg) _Check_return_
+#else
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT
+    #define JSON_HEDLEY_WARN_UNUSED_RESULT_MSG(msg)
+#endif
+
+#if defined(JSON_HEDLEY_SENTINEL)
+    #undef JSON_HEDLEY_SENTINEL
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(sentinel) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(4,0,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(5,4,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_SENTINEL(position) __attribute__((__sentinel__(position)))
+#else
+    #define JSON_HEDLEY_SENTINEL(position)
+#endif
+
+#if defined(JSON_HEDLEY_NO_RETURN)
+    #undef JSON_HEDLEY_NO_RETURN
+#endif
+#if JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_NO_RETURN __noreturn
+#elif \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_NO_RETURN __attribute__((__noreturn__))
+#elif defined(__STDC_VERSION__) && __STDC_VERSION__ >= 201112L
+    #define JSON_HEDLEY_NO_RETURN _Noreturn
+#elif defined(__cplusplus) && (__cplusplus >= 201103L)
+    #define JSON_HEDLEY_NO_RETURN JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[noreturn]])
+#elif \
+    JSON_HEDLEY_HAS_ATTRIBUTE(noreturn) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,2,0) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_IAR_VERSION_CHECK(8,10,0)
+    #define JSON_HEDLEY_NO_RETURN __attribute__((__noreturn__))
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0)
+    #define JSON_HEDLEY_NO_RETURN _Pragma("does_not_return")
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(13,10,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_NO_RETURN __declspec(noreturn)
+#elif JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,0,0) && defined(__cplusplus)
+    #define JSON_HEDLEY_NO_RETURN _Pragma("FUNC_NEVER_RETURNS;")
+#elif JSON_HEDLEY_COMPCERT_VERSION_CHECK(3,2,0)
+    #define JSON_HEDLEY_NO_RETURN __attribute((noreturn))
+#elif JSON_HEDLEY_PELLES_VERSION_CHECK(9,0,0)
+    #define JSON_HEDLEY_NO_RETURN __declspec(noreturn)
+#else
+    #define JSON_HEDLEY_NO_RETURN
+#endif
+
+#if defined(JSON_HEDLEY_NO_ESCAPE)
+    #undef JSON_HEDLEY_NO_ESCAPE
+#endif
+#if JSON_HEDLEY_HAS_ATTRIBUTE(noescape)
+    #define JSON_HEDLEY_NO_ESCAPE __attribute__((__noescape__))
+#else
+    #define JSON_HEDLEY_NO_ESCAPE
+#endif
+
+#if defined(JSON_HEDLEY_UNREACHABLE)
+    #undef JSON_HEDLEY_UNREACHABLE
+#endif
+#if defined(JSON_HEDLEY_UNREACHABLE_RETURN)
+    #undef JSON_HEDLEY_UNREACHABLE_RETURN
+#endif
+#if defined(JSON_HEDLEY_ASSUME)
+    #undef JSON_HEDLEY_ASSUME
+#endif
+#if \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(13,10,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_ASSUME(expr) __assume(expr)
+#elif JSON_HEDLEY_HAS_BUILTIN(__builtin_assume)
+    #define JSON_HEDLEY_ASSUME(expr) __builtin_assume(expr)
+#elif \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,2,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(4,0,0)
+    #if defined(__cplusplus)
+        #define JSON_HEDLEY_ASSUME(expr) std::_nassert(expr)
+    #else
+        #define JSON_HEDLEY_ASSUME(expr) _nassert(expr)
+    #endif
+#endif
+#if \
+    (JSON_HEDLEY_HAS_BUILTIN(__builtin_unreachable) && (!defined(JSON_HEDLEY_ARM_VERSION))) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(4,5,0) || \
+    JSON_HEDLEY_PGI_VERSION_CHECK(18,10,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(13,1,5) || \
+    JSON_HEDLEY_CRAY_VERSION_CHECK(10,0,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_UNREACHABLE() __builtin_unreachable()
+#elif defined(JSON_HEDLEY_ASSUME)
+    #define JSON_HEDLEY_UNREACHABLE() JSON_HEDLEY_ASSUME(0)
+#endif
+#if !defined(JSON_HEDLEY_ASSUME)
+    #if defined(JSON_HEDLEY_UNREACHABLE)
+        #define JSON_HEDLEY_ASSUME(expr) JSON_HEDLEY_STATIC_CAST(void, ((expr) ? 1 : (JSON_HEDLEY_UNREACHABLE(), 1)))
+    #else
+        #define JSON_HEDLEY_ASSUME(expr) JSON_HEDLEY_STATIC_CAST(void, expr)
+    #endif
+#endif
+#if defined(JSON_HEDLEY_UNREACHABLE)
+    #if  \
+        JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,2,0) || \
+        JSON_HEDLEY_TI_CL6X_VERSION_CHECK(4,0,0)
+        #define JSON_HEDLEY_UNREACHABLE_RETURN(value) return (JSON_HEDLEY_STATIC_CAST(void, JSON_HEDLEY_ASSUME(0)), (value))
+    #else
+        #define JSON_HEDLEY_UNREACHABLE_RETURN(value) JSON_HEDLEY_UNREACHABLE()
+    #endif
+#else
+    #define JSON_HEDLEY_UNREACHABLE_RETURN(value) return (value)
+#endif
+#if !defined(JSON_HEDLEY_UNREACHABLE)
+    #define JSON_HEDLEY_UNREACHABLE() JSON_HEDLEY_ASSUME(0)
+#endif
+
+JSON_HEDLEY_DIAGNOSTIC_PUSH
+#if JSON_HEDLEY_HAS_WARNING("-Wpedantic")
+    #pragma clang diagnostic ignored "-Wpedantic"
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wc++98-compat-pedantic") && defined(__cplusplus)
+    #pragma clang diagnostic ignored "-Wc++98-compat-pedantic"
+#endif
+#if JSON_HEDLEY_GCC_HAS_WARNING("-Wvariadic-macros",4,0,0)
+    #if defined(__clang__)
+        #pragma clang diagnostic ignored "-Wvariadic-macros"
+    #elif defined(JSON_HEDLEY_GCC_VERSION)
+        #pragma GCC diagnostic ignored "-Wvariadic-macros"
+    #endif
+#endif
+#if defined(JSON_HEDLEY_NON_NULL)
+    #undef JSON_HEDLEY_NON_NULL
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(nonnull) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,3,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0)
+    #define JSON_HEDLEY_NON_NULL(...) __attribute__((__nonnull__(__VA_ARGS__)))
+#else
+    #define JSON_HEDLEY_NON_NULL(...)
+#endif
+JSON_HEDLEY_DIAGNOSTIC_POP
+
+#if defined(JSON_HEDLEY_PRINTF_FORMAT)
+    #undef JSON_HEDLEY_PRINTF_FORMAT
+#endif
+#if defined(__MINGW32__) && JSON_HEDLEY_GCC_HAS_ATTRIBUTE(format,4,4,0) && !defined(__USE_MINGW_ANSI_STDIO)
+    #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) __attribute__((__format__(ms_printf, string_idx, first_to_check)))
+#elif defined(__MINGW32__) && JSON_HEDLEY_GCC_HAS_ATTRIBUTE(format,4,4,0) && defined(__USE_MINGW_ANSI_STDIO)
+    #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) __attribute__((__format__(gnu_printf, string_idx, first_to_check)))
+#elif \
+    JSON_HEDLEY_HAS_ATTRIBUTE(format) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,1,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(5,6,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) __attribute__((__format__(__printf__, string_idx, first_to_check)))
+#elif JSON_HEDLEY_PELLES_VERSION_CHECK(6,0,0)
+    #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check) __declspec(vaformat(printf,string_idx,first_to_check))
+#else
+    #define JSON_HEDLEY_PRINTF_FORMAT(string_idx,first_to_check)
+#endif
+
+#if defined(JSON_HEDLEY_CONSTEXPR)
+    #undef JSON_HEDLEY_CONSTEXPR
+#endif
+#if defined(__cplusplus)
+    #if __cplusplus >= 201103L
+        #define JSON_HEDLEY_CONSTEXPR JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(constexpr)
+    #endif
+#endif
+#if !defined(JSON_HEDLEY_CONSTEXPR)
+    #define JSON_HEDLEY_CONSTEXPR
+#endif
+
+#if defined(JSON_HEDLEY_PREDICT)
+    #undef JSON_HEDLEY_PREDICT
+#endif
+#if defined(JSON_HEDLEY_LIKELY)
+    #undef JSON_HEDLEY_LIKELY
+#endif
+#if defined(JSON_HEDLEY_UNLIKELY)
+    #undef JSON_HEDLEY_UNLIKELY
+#endif
+#if defined(JSON_HEDLEY_UNPREDICTABLE)
+    #undef JSON_HEDLEY_UNPREDICTABLE
+#endif
+#if JSON_HEDLEY_HAS_BUILTIN(__builtin_unpredictable)
+    #define JSON_HEDLEY_UNPREDICTABLE(expr) __builtin_unpredictable((expr))
+#endif
+#if \
+  (JSON_HEDLEY_HAS_BUILTIN(__builtin_expect_with_probability) && !defined(JSON_HEDLEY_PGI_VERSION)) || \
+  JSON_HEDLEY_GCC_VERSION_CHECK(9,0,0) || \
+  JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+#  define JSON_HEDLEY_PREDICT(expr, value, probability) __builtin_expect_with_probability(  (expr), (value), (probability))
+#  define JSON_HEDLEY_PREDICT_TRUE(expr, probability)   __builtin_expect_with_probability(!!(expr),    1   , (probability))
+#  define JSON_HEDLEY_PREDICT_FALSE(expr, probability)  __builtin_expect_with_probability(!!(expr),    0   , (probability))
+#  define JSON_HEDLEY_LIKELY(expr)                      __builtin_expect                 (!!(expr),    1                  )
+#  define JSON_HEDLEY_UNLIKELY(expr)                    __builtin_expect                 (!!(expr),    0                  )
+#elif \
+  (JSON_HEDLEY_HAS_BUILTIN(__builtin_expect) && !defined(JSON_HEDLEY_INTEL_CL_VERSION)) || \
+  JSON_HEDLEY_GCC_VERSION_CHECK(3,0,0) || \
+  JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+  (JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,15,0) && defined(__cplusplus)) || \
+  JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+  JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+  JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+  JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,7,0) || \
+  JSON_HEDLEY_TI_CL430_VERSION_CHECK(3,1,0) || \
+  JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,1,0) || \
+  JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,1,0) || \
+  JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+  JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+  JSON_HEDLEY_TINYC_VERSION_CHECK(0,9,27) || \
+  JSON_HEDLEY_CRAY_VERSION_CHECK(8,1,0) || \
+  JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+#  define JSON_HEDLEY_PREDICT(expr, expected, probability) \
+    (((probability) >= 0.9) ? __builtin_expect((expr), (expected)) : (JSON_HEDLEY_STATIC_CAST(void, expected), (expr)))
+#  define JSON_HEDLEY_PREDICT_TRUE(expr, probability) \
+    (__extension__ ({ \
+        double hedley_probability_ = (probability); \
+        ((hedley_probability_ >= 0.9) ? __builtin_expect(!!(expr), 1) : ((hedley_probability_ <= 0.1) ? __builtin_expect(!!(expr), 0) : !!(expr))); \
+    }))
+#  define JSON_HEDLEY_PREDICT_FALSE(expr, probability) \
+    (__extension__ ({ \
+        double hedley_probability_ = (probability); \
+        ((hedley_probability_ >= 0.9) ? __builtin_expect(!!(expr), 0) : ((hedley_probability_ <= 0.1) ? __builtin_expect(!!(expr), 1) : !!(expr))); \
+    }))
+#  define JSON_HEDLEY_LIKELY(expr)   __builtin_expect(!!(expr), 1)
+#  define JSON_HEDLEY_UNLIKELY(expr) __builtin_expect(!!(expr), 0)
+#else
+#  define JSON_HEDLEY_PREDICT(expr, expected, probability) (JSON_HEDLEY_STATIC_CAST(void, expected), (expr))
+#  define JSON_HEDLEY_PREDICT_TRUE(expr, probability) (!!(expr))
+#  define JSON_HEDLEY_PREDICT_FALSE(expr, probability) (!!(expr))
+#  define JSON_HEDLEY_LIKELY(expr) (!!(expr))
+#  define JSON_HEDLEY_UNLIKELY(expr) (!!(expr))
+#endif
+#if !defined(JSON_HEDLEY_UNPREDICTABLE)
+    #define JSON_HEDLEY_UNPREDICTABLE(expr) JSON_HEDLEY_PREDICT(expr, 1, 0.5)
+#endif
+
+#if defined(JSON_HEDLEY_MALLOC)
+    #undef JSON_HEDLEY_MALLOC
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(malloc) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,1,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(12,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_MALLOC __attribute__((__malloc__))
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0)
+    #define JSON_HEDLEY_MALLOC _Pragma("returns_new_memory")
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(14,0,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_MALLOC __declspec(restrict)
+#else
+    #define JSON_HEDLEY_MALLOC
+#endif
+
+#if defined(JSON_HEDLEY_PURE)
+    #undef JSON_HEDLEY_PURE
+#endif
+#if \
+  JSON_HEDLEY_HAS_ATTRIBUTE(pure) || \
+  JSON_HEDLEY_GCC_VERSION_CHECK(2,96,0) || \
+  JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+  JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+  JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+  JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+  JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+  (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+  (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+  (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+  (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+  JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+  JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+  JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) || \
+  JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+#  define JSON_HEDLEY_PURE __attribute__((__pure__))
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0)
+#  define JSON_HEDLEY_PURE _Pragma("does_not_write_global_data")
+#elif defined(__cplusplus) && \
+    ( \
+      JSON_HEDLEY_TI_CL430_VERSION_CHECK(2,0,1) || \
+      JSON_HEDLEY_TI_CL6X_VERSION_CHECK(4,0,0) || \
+      JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) \
+    )
+#  define JSON_HEDLEY_PURE _Pragma("FUNC_IS_PURE;")
+#else
+#  define JSON_HEDLEY_PURE
+#endif
+
+#if defined(JSON_HEDLEY_CONST)
+    #undef JSON_HEDLEY_CONST
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(const) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(2,5,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_CONST __attribute__((__const__))
+#elif \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0)
+    #define JSON_HEDLEY_CONST _Pragma("no_side_effect")
+#else
+    #define JSON_HEDLEY_CONST JSON_HEDLEY_PURE
+#endif
+
+#if defined(JSON_HEDLEY_RESTRICT)
+    #undef JSON_HEDLEY_RESTRICT
+#endif
+#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) && !defined(__cplusplus)
+    #define JSON_HEDLEY_RESTRICT restrict
+#elif \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,1,0) || \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(14,0,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+    JSON_HEDLEY_PGI_VERSION_CHECK(17,10,0) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,2,4) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,1,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    (JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,14,0) && defined(__cplusplus)) || \
+    JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0) || \
+    defined(__clang__) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_RESTRICT __restrict
+#elif JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,3,0) && !defined(__cplusplus)
+    #define JSON_HEDLEY_RESTRICT _Restrict
+#else
+    #define JSON_HEDLEY_RESTRICT
+#endif
+
+#if defined(JSON_HEDLEY_INLINE)
+    #undef JSON_HEDLEY_INLINE
+#endif
+#if \
+    (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)) || \
+    (defined(__cplusplus) && (__cplusplus >= 199711L))
+    #define JSON_HEDLEY_INLINE inline
+#elif \
+    defined(JSON_HEDLEY_GCC_VERSION) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(6,2,0)
+    #define JSON_HEDLEY_INLINE __inline__
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(12,0,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,1,0) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(3,1,0) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,2,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(8,0,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_INLINE __inline
+#else
+    #define JSON_HEDLEY_INLINE
+#endif
+
+#if defined(JSON_HEDLEY_ALWAYS_INLINE)
+    #undef JSON_HEDLEY_ALWAYS_INLINE
+#endif
+#if \
+  JSON_HEDLEY_HAS_ATTRIBUTE(always_inline) || \
+  JSON_HEDLEY_GCC_VERSION_CHECK(4,0,0) || \
+  JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+  JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+  JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+  JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+  JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+  (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+  (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+  (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+  (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+  JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+  JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+  JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+  JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10) || \
+  JSON_HEDLEY_IAR_VERSION_CHECK(8,10,0)
+#  define JSON_HEDLEY_ALWAYS_INLINE __attribute__((__always_inline__)) JSON_HEDLEY_INLINE
+#elif \
+  JSON_HEDLEY_MSVC_VERSION_CHECK(12,0,0) || \
+  JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+#  define JSON_HEDLEY_ALWAYS_INLINE __forceinline
+#elif defined(__cplusplus) && \
+    ( \
+      JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+      JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+      JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+      JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,1,0) || \
+      JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+      JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) \
+    )
+#  define JSON_HEDLEY_ALWAYS_INLINE _Pragma("FUNC_ALWAYS_INLINE;")
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+#  define JSON_HEDLEY_ALWAYS_INLINE _Pragma("inline=forced")
+#else
+#  define JSON_HEDLEY_ALWAYS_INLINE JSON_HEDLEY_INLINE
+#endif
+
+#if defined(JSON_HEDLEY_NEVER_INLINE)
+    #undef JSON_HEDLEY_NEVER_INLINE
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(noinline) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(4,0,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(10,1,0) || \
+    JSON_HEDLEY_TI_VERSION_CHECK(15,12,0) || \
+    (JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(4,8,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_ARMCL_VERSION_CHECK(5,2,0) || \
+    (JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL2000_VERSION_CHECK(6,4,0) || \
+    (JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,0,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL430_VERSION_CHECK(4,3,0) || \
+    (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) || \
+    JSON_HEDLEY_TI_CL7X_VERSION_CHECK(1,2,0) || \
+    JSON_HEDLEY_TI_CLPRU_VERSION_CHECK(2,1,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10) || \
+    JSON_HEDLEY_IAR_VERSION_CHECK(8,10,0)
+    #define JSON_HEDLEY_NEVER_INLINE __attribute__((__noinline__))
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(13,10,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_NEVER_INLINE __declspec(noinline)
+#elif JSON_HEDLEY_PGI_VERSION_CHECK(10,2,0)
+    #define JSON_HEDLEY_NEVER_INLINE _Pragma("noinline")
+#elif JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,0,0) && defined(__cplusplus)
+    #define JSON_HEDLEY_NEVER_INLINE _Pragma("FUNC_CANNOT_INLINE;")
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+    #define JSON_HEDLEY_NEVER_INLINE _Pragma("inline=never")
+#elif JSON_HEDLEY_COMPCERT_VERSION_CHECK(3,2,0)
+    #define JSON_HEDLEY_NEVER_INLINE __attribute((noinline))
+#elif JSON_HEDLEY_PELLES_VERSION_CHECK(9,0,0)
+    #define JSON_HEDLEY_NEVER_INLINE __declspec(noinline)
+#else
+    #define JSON_HEDLEY_NEVER_INLINE
+#endif
+
+#if defined(JSON_HEDLEY_PRIVATE)
+    #undef JSON_HEDLEY_PRIVATE
+#endif
+#if defined(JSON_HEDLEY_PUBLIC)
+    #undef JSON_HEDLEY_PUBLIC
+#endif
+#if defined(JSON_HEDLEY_IMPORT)
+    #undef JSON_HEDLEY_IMPORT
+#endif
+#if defined(_WIN32) || defined(__CYGWIN__)
+#  define JSON_HEDLEY_PRIVATE
+#  define JSON_HEDLEY_PUBLIC   __declspec(dllexport)
+#  define JSON_HEDLEY_IMPORT   __declspec(dllimport)
+#else
+#  if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(visibility) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,3,0) || \
+    JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,11,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(13,1,0) || \
+    ( \
+      defined(__TI_EABI__) && \
+      ( \
+        (JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,2,0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__)) || \
+        JSON_HEDLEY_TI_CL6X_VERSION_CHECK(7,5,0) \
+      ) \
+    ) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+#    define JSON_HEDLEY_PRIVATE __attribute__((__visibility__("hidden")))
+#    define JSON_HEDLEY_PUBLIC  __attribute__((__visibility__("default")))
+#  else
+#    define JSON_HEDLEY_PRIVATE
+#    define JSON_HEDLEY_PUBLIC
+#  endif
+#  define JSON_HEDLEY_IMPORT    extern
+#endif
+
+#if defined(JSON_HEDLEY_NO_THROW)
+    #undef JSON_HEDLEY_NO_THROW
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(nothrow) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,3,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_NO_THROW __attribute__((__nothrow__))
+#elif \
+    JSON_HEDLEY_MSVC_VERSION_CHECK(13,1,0) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0)
+    #define JSON_HEDLEY_NO_THROW __declspec(nothrow)
+#else
+    #define JSON_HEDLEY_NO_THROW
+#endif
+
+#if defined(JSON_HEDLEY_FALL_THROUGH)
+    #undef JSON_HEDLEY_FALL_THROUGH
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(fallthrough) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(7,0,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_FALL_THROUGH __attribute__((__fallthrough__))
+#elif JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS(clang,fallthrough)
+    #define JSON_HEDLEY_FALL_THROUGH JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[clang::fallthrough]])
+#elif JSON_HEDLEY_HAS_CPP_ATTRIBUTE(fallthrough)
+    #define JSON_HEDLEY_FALL_THROUGH JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_([[fallthrough]])
+#elif defined(__fallthrough) /* SAL */
+    #define JSON_HEDLEY_FALL_THROUGH __fallthrough
+#else
+    #define JSON_HEDLEY_FALL_THROUGH
+#endif
+
+#if defined(JSON_HEDLEY_RETURNS_NON_NULL)
+    #undef JSON_HEDLEY_RETURNS_NON_NULL
+#endif
+#if \
+    JSON_HEDLEY_HAS_ATTRIBUTE(returns_nonnull) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(4,9,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_RETURNS_NON_NULL __attribute__((__returns_nonnull__))
+#elif defined(_Ret_notnull_) /* SAL */
+    #define JSON_HEDLEY_RETURNS_NON_NULL _Ret_notnull_
+#else
+    #define JSON_HEDLEY_RETURNS_NON_NULL
+#endif
+
+#if defined(JSON_HEDLEY_ARRAY_PARAM)
+    #undef JSON_HEDLEY_ARRAY_PARAM
+#endif
+#if \
+    defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) && \
+    !defined(__STDC_NO_VLA__) && \
+    !defined(__cplusplus) && \
+    !defined(JSON_HEDLEY_PGI_VERSION) && \
+    !defined(JSON_HEDLEY_TINYC_VERSION)
+    #define JSON_HEDLEY_ARRAY_PARAM(name) (name)
+#else
+    #define JSON_HEDLEY_ARRAY_PARAM(name)
+#endif
+
+#if defined(JSON_HEDLEY_IS_CONSTANT)
+    #undef JSON_HEDLEY_IS_CONSTANT
+#endif
+#if defined(JSON_HEDLEY_REQUIRE_CONSTEXPR)
+    #undef JSON_HEDLEY_REQUIRE_CONSTEXPR
+#endif
+/* JSON_HEDLEY_IS_CONSTEXPR_ is for
+   HEDLEY INTERNAL USE ONLY.  API subject to change without notice. */
+#if defined(JSON_HEDLEY_IS_CONSTEXPR_)
+    #undef JSON_HEDLEY_IS_CONSTEXPR_
+#endif
+#if \
+    JSON_HEDLEY_HAS_BUILTIN(__builtin_constant_p) || \
+    JSON_HEDLEY_GCC_VERSION_CHECK(3,4,0) || \
+    JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+    JSON_HEDLEY_TINYC_VERSION_CHECK(0,9,19) || \
+    JSON_HEDLEY_ARM_VERSION_CHECK(4,1,0) || \
+    JSON_HEDLEY_IBM_VERSION_CHECK(13,1,0) || \
+    JSON_HEDLEY_TI_CL6X_VERSION_CHECK(6,1,0) || \
+    (JSON_HEDLEY_SUNPRO_VERSION_CHECK(5,10,0) && !defined(__cplusplus)) || \
+    JSON_HEDLEY_CRAY_VERSION_CHECK(8,1,0) || \
+    JSON_HEDLEY_MCST_LCC_VERSION_CHECK(1,25,10)
+    #define JSON_HEDLEY_IS_CONSTANT(expr) __builtin_constant_p(expr)
+#endif
+#if !defined(__cplusplus)
+#  if \
+       JSON_HEDLEY_HAS_BUILTIN(__builtin_types_compatible_p) || \
+       JSON_HEDLEY_GCC_VERSION_CHECK(3,4,0) || \
+       JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+       JSON_HEDLEY_IBM_VERSION_CHECK(13,1,0) || \
+       JSON_HEDLEY_CRAY_VERSION_CHECK(8,1,0) || \
+       JSON_HEDLEY_ARM_VERSION_CHECK(5,4,0) || \
+       JSON_HEDLEY_TINYC_VERSION_CHECK(0,9,24)
+#if defined(__INTPTR_TYPE__)
+    #define JSON_HEDLEY_IS_CONSTEXPR_(expr) __builtin_types_compatible_p(__typeof__((1 ? (void*) ((__INTPTR_TYPE__) ((expr) * 0)) : (int*) 0)), int*)
+#else
+    #include <stdint.h>
+    #define JSON_HEDLEY_IS_CONSTEXPR_(expr) __builtin_types_compatible_p(__typeof__((1 ? (void*) ((intptr_t) ((expr) * 0)) : (int*) 0)), int*)
+#endif
+#  elif \
+       ( \
+          defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L) && \
+          !defined(JSON_HEDLEY_SUNPRO_VERSION) && \
+          !defined(JSON_HEDLEY_PGI_VERSION) && \
+          !defined(JSON_HEDLEY_IAR_VERSION)) || \
+       (JSON_HEDLEY_HAS_EXTENSION(c_generic_selections) && !defined(JSON_HEDLEY_IAR_VERSION)) || \
+       JSON_HEDLEY_GCC_VERSION_CHECK(4,9,0) || \
+       JSON_HEDLEY_INTEL_VERSION_CHECK(17,0,0) || \
+       JSON_HEDLEY_IBM_VERSION_CHECK(12,1,0) || \
+       JSON_HEDLEY_ARM_VERSION_CHECK(5,3,0)
+#if defined(__INTPTR_TYPE__)
+    #define JSON_HEDLEY_IS_CONSTEXPR_(expr) _Generic((1 ? (void*) ((__INTPTR_TYPE__) ((expr) * 0)) : (int*) 0), int*: 1, void*: 0)
+#else
+    #include <stdint.h>
+    #define JSON_HEDLEY_IS_CONSTEXPR_(expr) _Generic((1 ? (void*) ((intptr_t) * 0) : (int*) 0), int*: 1, void*: 0)
+#endif
+#  elif \
+       defined(JSON_HEDLEY_GCC_VERSION) || \
+       defined(JSON_HEDLEY_INTEL_VERSION) || \
+       defined(JSON_HEDLEY_TINYC_VERSION) || \
+       defined(JSON_HEDLEY_TI_ARMCL_VERSION) || \
+       JSON_HEDLEY_TI_CL430_VERSION_CHECK(18,12,0) || \
+       defined(JSON_HEDLEY_TI_CL2000_VERSION) || \
+       defined(JSON_HEDLEY_TI_CL6X_VERSION) || \
+       defined(JSON_HEDLEY_TI_CL7X_VERSION) || \
+       defined(JSON_HEDLEY_TI_CLPRU_VERSION) || \
+       defined(__clang__)
+#    define JSON_HEDLEY_IS_CONSTEXPR_(expr) ( \
+        sizeof(void) != \
+        sizeof(*( \
+                  1 ? \
+                  ((void*) ((expr) * 0L) ) : \
+((struct { char v[sizeof(void) * 2]; } *) 1) \
+                ) \
+              ) \
+                                            )
+#  endif
+#endif
+#if defined(JSON_HEDLEY_IS_CONSTEXPR_)
+    #if !defined(JSON_HEDLEY_IS_CONSTANT)
+        #define JSON_HEDLEY_IS_CONSTANT(expr) JSON_HEDLEY_IS_CONSTEXPR_(expr)
+    #endif
+    #define JSON_HEDLEY_REQUIRE_CONSTEXPR(expr) (JSON_HEDLEY_IS_CONSTEXPR_(expr) ? (expr) : (-1))
+#else
+    #if !defined(JSON_HEDLEY_IS_CONSTANT)
+        #define JSON_HEDLEY_IS_CONSTANT(expr) (0)
+    #endif
+    #define JSON_HEDLEY_REQUIRE_CONSTEXPR(expr) (expr)
+#endif
+
+#if defined(JSON_HEDLEY_BEGIN_C_DECLS)
+    #undef JSON_HEDLEY_BEGIN_C_DECLS
+#endif
+#if defined(JSON_HEDLEY_END_C_DECLS)
+    #undef JSON_HEDLEY_END_C_DECLS
+#endif
+#if defined(JSON_HEDLEY_C_DECL)
+    #undef JSON_HEDLEY_C_DECL
+#endif
+#if defined(__cplusplus)
+    #define JSON_HEDLEY_BEGIN_C_DECLS extern "C" {
+    #define JSON_HEDLEY_END_C_DECLS }
+    #define JSON_HEDLEY_C_DECL extern "C"
+#else
+    #define JSON_HEDLEY_BEGIN_C_DECLS
+    #define JSON_HEDLEY_END_C_DECLS
+    #define JSON_HEDLEY_C_DECL
+#endif
+
+#if defined(JSON_HEDLEY_STATIC_ASSERT)
+    #undef JSON_HEDLEY_STATIC_ASSERT
+#endif
+#if \
+  !defined(__cplusplus) && ( \
+      (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L)) || \
+      (JSON_HEDLEY_HAS_FEATURE(c_static_assert) && !defined(JSON_HEDLEY_INTEL_CL_VERSION)) || \
+      JSON_HEDLEY_GCC_VERSION_CHECK(6,0,0) || \
+      JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0) || \
+      defined(_Static_assert) \
+    )
+#  define JSON_HEDLEY_STATIC_ASSERT(expr, message) _Static_assert(expr, message)
+#elif \
+  (defined(__cplusplus) && (__cplusplus >= 201103L)) || \
+  JSON_HEDLEY_MSVC_VERSION_CHECK(16,0,0) || \
+  JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+#  define JSON_HEDLEY_STATIC_ASSERT(expr, message) JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(static_assert(expr, message))
+#else
+#  define JSON_HEDLEY_STATIC_ASSERT(expr, message)
+#endif
+
+#if defined(JSON_HEDLEY_NULL)
+    #undef JSON_HEDLEY_NULL
+#endif
+#if defined(__cplusplus)
+    #if __cplusplus >= 201103L
+        #define JSON_HEDLEY_NULL JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_(nullptr)
+    #elif defined(NULL)
+        #define JSON_HEDLEY_NULL NULL
+    #else
+        #define JSON_HEDLEY_NULL JSON_HEDLEY_STATIC_CAST(void*, 0)
+    #endif
+#elif defined(NULL)
+    #define JSON_HEDLEY_NULL NULL
+#else
+    #define JSON_HEDLEY_NULL ((void*) 0)
+#endif
+
+#if defined(JSON_HEDLEY_MESSAGE)
+    #undef JSON_HEDLEY_MESSAGE
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wunknown-pragmas")
+#  define JSON_HEDLEY_MESSAGE(msg) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS \
+    JSON_HEDLEY_PRAGMA(message msg) \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#elif \
+  JSON_HEDLEY_GCC_VERSION_CHECK(4,4,0) || \
+  JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+#  define JSON_HEDLEY_MESSAGE(msg) JSON_HEDLEY_PRAGMA(message msg)
+#elif JSON_HEDLEY_CRAY_VERSION_CHECK(5,0,0)
+#  define JSON_HEDLEY_MESSAGE(msg) JSON_HEDLEY_PRAGMA(_CRI message msg)
+#elif JSON_HEDLEY_IAR_VERSION_CHECK(8,0,0)
+#  define JSON_HEDLEY_MESSAGE(msg) JSON_HEDLEY_PRAGMA(message(msg))
+#elif JSON_HEDLEY_PELLES_VERSION_CHECK(2,0,0)
+#  define JSON_HEDLEY_MESSAGE(msg) JSON_HEDLEY_PRAGMA(message(msg))
+#else
+#  define JSON_HEDLEY_MESSAGE(msg)
+#endif
+
+#if defined(JSON_HEDLEY_WARNING)
+    #undef JSON_HEDLEY_WARNING
+#endif
+#if JSON_HEDLEY_HAS_WARNING("-Wunknown-pragmas")
+#  define JSON_HEDLEY_WARNING(msg) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS \
+    JSON_HEDLEY_PRAGMA(clang warning msg) \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#elif \
+  JSON_HEDLEY_GCC_VERSION_CHECK(4,8,0) || \
+  JSON_HEDLEY_PGI_VERSION_CHECK(18,4,0) || \
+  JSON_HEDLEY_INTEL_VERSION_CHECK(13,0,0)
+#  define JSON_HEDLEY_WARNING(msg) JSON_HEDLEY_PRAGMA(GCC warning msg)
+#elif \
+  JSON_HEDLEY_MSVC_VERSION_CHECK(15,0,0) || \
+  JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+#  define JSON_HEDLEY_WARNING(msg) JSON_HEDLEY_PRAGMA(message(msg))
+#else
+#  define JSON_HEDLEY_WARNING(msg) JSON_HEDLEY_MESSAGE(msg)
+#endif
+
+#if defined(JSON_HEDLEY_REQUIRE)
+    #undef JSON_HEDLEY_REQUIRE
+#endif
+#if defined(JSON_HEDLEY_REQUIRE_MSG)
+    #undef JSON_HEDLEY_REQUIRE_MSG
+#endif
+#if JSON_HEDLEY_HAS_ATTRIBUTE(diagnose_if)
+#  if JSON_HEDLEY_HAS_WARNING("-Wgcc-compat")
+#    define JSON_HEDLEY_REQUIRE(expr) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("clang diagnostic ignored \"-Wgcc-compat\"") \
+    __attribute__((diagnose_if(!(expr), #expr, "error"))) \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#    define JSON_HEDLEY_REQUIRE_MSG(expr,msg) \
+    JSON_HEDLEY_DIAGNOSTIC_PUSH \
+    _Pragma("clang diagnostic ignored \"-Wgcc-compat\"") \
+    __attribute__((diagnose_if(!(expr), msg, "error"))) \
+    JSON_HEDLEY_DIAGNOSTIC_POP
+#  else
+#    define JSON_HEDLEY_REQUIRE(expr) __attribute__((diagnose_if(!(expr), #expr, "error")))
+#    define JSON_HEDLEY_REQUIRE_MSG(expr,msg) __attribute__((diagnose_if(!(expr), msg, "error")))
+#  endif
+#else
+#  define JSON_HEDLEY_REQUIRE(expr)
+#  define JSON_HEDLEY_REQUIRE_MSG(expr,msg)
+#endif
+
+#if defined(JSON_HEDLEY_FLAGS)
+    #undef JSON_HEDLEY_FLAGS
+#endif
+#if JSON_HEDLEY_HAS_ATTRIBUTE(flag_enum) && (!defined(__cplusplus) || JSON_HEDLEY_HAS_WARNING("-Wbitfield-enum-conversion"))
+    #define JSON_HEDLEY_FLAGS __attribute__((__flag_enum__))
+#else
+    #define JSON_HEDLEY_FLAGS
+#endif
+
+#if defined(JSON_HEDLEY_FLAGS_CAST)
+    #undef JSON_HEDLEY_FLAGS_CAST
+#endif
+#if JSON_HEDLEY_INTEL_VERSION_CHECK(19,0,0)
+#  define JSON_HEDLEY_FLAGS_CAST(T, expr) (__extension__ ({ \
+        JSON_HEDLEY_DIAGNOSTIC_PUSH \
+        _Pragma("warning(disable:188)") \
+        ((T) (expr)); \
+        JSON_HEDLEY_DIAGNOSTIC_POP \
+    }))
+#else
+#  define JSON_HEDLEY_FLAGS_CAST(T, expr) JSON_HEDLEY_STATIC_CAST(T, expr)
+#endif
+
+#if defined(JSON_HEDLEY_EMPTY_BASES)
+    #undef JSON_HEDLEY_EMPTY_BASES
+#endif
+#if \
+    (JSON_HEDLEY_MSVC_VERSION_CHECK(19,0,23918) && !JSON_HEDLEY_MSVC_VERSION_CHECK(20,0,0)) || \
+    JSON_HEDLEY_INTEL_CL_VERSION_CHECK(2021,1,0)
+    #define JSON_HEDLEY_EMPTY_BASES __declspec(empty_bases)
+#else
+    #define JSON_HEDLEY_EMPTY_BASES
+#endif
+
+/* Remaining macros are deprecated. */
+
+#if defined(JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK)
+    #undef JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK
+#endif
+#if defined(__clang__)
+    #define JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK(major,minor,patch) (0)
+#else
+    #define JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK(major,minor,patch) JSON_HEDLEY_GCC_VERSION_CHECK(major,minor,patch)
+#endif
+
+#if defined(JSON_HEDLEY_CLANG_HAS_ATTRIBUTE)
+    #undef JSON_HEDLEY_CLANG_HAS_ATTRIBUTE
+#endif
+#define JSON_HEDLEY_CLANG_HAS_ATTRIBUTE(attribute) JSON_HEDLEY_HAS_ATTRIBUTE(attribute)
+
+#if defined(JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE)
+    #undef JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE
+#endif
+#define JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE(attribute) JSON_HEDLEY_HAS_CPP_ATTRIBUTE(attribute)
+
+#if defined(JSON_HEDLEY_CLANG_HAS_BUILTIN)
+    #undef JSON_HEDLEY_CLANG_HAS_BUILTIN
+#endif
+#define JSON_HEDLEY_CLANG_HAS_BUILTIN(builtin) JSON_HEDLEY_HAS_BUILTIN(builtin)
+
+#if defined(JSON_HEDLEY_CLANG_HAS_FEATURE)
+    #undef JSON_HEDLEY_CLANG_HAS_FEATURE
+#endif
+#define JSON_HEDLEY_CLANG_HAS_FEATURE(feature) JSON_HEDLEY_HAS_FEATURE(feature)
+
+#if defined(JSON_HEDLEY_CLANG_HAS_EXTENSION)
+    #undef JSON_HEDLEY_CLANG_HAS_EXTENSION
+#endif
+#define JSON_HEDLEY_CLANG_HAS_EXTENSION(extension) JSON_HEDLEY_HAS_EXTENSION(extension)
+
+#if defined(JSON_HEDLEY_CLANG_HAS_DECLSPEC_DECLSPEC_ATTRIBUTE)
+    #undef JSON_HEDLEY_CLANG_HAS_DECLSPEC_DECLSPEC_ATTRIBUTE
+#endif
+#define JSON_HEDLEY_CLANG_HAS_DECLSPEC_ATTRIBUTE(attribute) JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE(attribute)
+
+#if defined(JSON_HEDLEY_CLANG_HAS_WARNING)
+    #undef JSON_HEDLEY_CLANG_HAS_WARNING
+#endif
+#define JSON_HEDLEY_CLANG_HAS_WARNING(warning) JSON_HEDLEY_HAS_WARNING(warning)
+
+#endif /* !defined(JSON_HEDLEY_VERSION) || (JSON_HEDLEY_VERSION < X) */
+
+
+// This file contains all internal macro definitions (except those affecting ABI)
+// You MUST include macro_unscope.hpp at the end of json.hpp to undef all of them
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+// exclude unsupported compilers
+#if !defined(JSON_SKIP_UNSUPPORTED_COMPILER_CHECK)
+    #if defined(__clang__)
+        #if (__clang_major__ * 10000 + __clang_minor__ * 100 + __clang_patchlevel__) < 30400
+            #error "unsupported Clang version - see https://github.com/nlohmann/json#supported-compilers"
+        #endif
+    #elif defined(__GNUC__) && !(defined(__ICC) || defined(__INTEL_COMPILER))
+        #if (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__) < 40800
+            #error "unsupported GCC version - see https://github.com/nlohmann/json#supported-compilers"
+        #endif
+    #endif
+#endif
+
+// C++ language standard detection
+// if the user manually specified the used c++ version this is skipped
+#if !defined(JSON_HAS_CPP_20) && !defined(JSON_HAS_CPP_17) && !defined(JSON_HAS_CPP_14) && !defined(JSON_HAS_CPP_11)
+    #if (defined(__cplusplus) && __cplusplus >= 202002L) || (defined(_MSVC_LANG) && _MSVC_LANG >= 202002L)
+        #define JSON_HAS_CPP_20
+        #define JSON_HAS_CPP_17
+        #define JSON_HAS_CPP_14
+    #elif (defined(__cplusplus) && __cplusplus >= 201703L) || (defined(_HAS_CXX17) && _HAS_CXX17 == 1) // fix for issue #464
+        #define JSON_HAS_CPP_17
+        #define JSON_HAS_CPP_14
+    #elif (defined(__cplusplus) && __cplusplus >= 201402L) || (defined(_HAS_CXX14) && _HAS_CXX14 == 1)
+        #define JSON_HAS_CPP_14
+    #endif
+    // the cpp 11 flag is always specified because it is the minimal required version
+    #define JSON_HAS_CPP_11
+#endif
+
+#ifdef __has_include
+    #if __has_include(<version>)
+        #include <version>
+    #endif
+#endif
+
+#if !defined(JSON_HAS_FILESYSTEM) && !defined(JSON_HAS_EXPERIMENTAL_FILESYSTEM)
+    #ifdef JSON_HAS_CPP_17
+        #if defined(__cpp_lib_filesystem)
+            #define JSON_HAS_FILESYSTEM 1
+        #elif defined(__cpp_lib_experimental_filesystem)
+            #define JSON_HAS_EXPERIMENTAL_FILESYSTEM 1
+        #elif !defined(__has_include)
+            #define JSON_HAS_EXPERIMENTAL_FILESYSTEM 1
+        #elif __has_include(<filesystem>)
+            #define JSON_HAS_FILESYSTEM 1
+        #elif __has_include(<experimental/filesystem>)
+            #define JSON_HAS_EXPERIMENTAL_FILESYSTEM 1
+        #endif
+
+        // std::filesystem does not work on MinGW GCC 8: https://sourceforge.net/p/mingw-w64/bugs/737/
+        #if defined(__MINGW32__) && defined(__GNUC__) && __GNUC__ == 8
+            #undef JSON_HAS_FILESYSTEM
+            #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+        #endif
+
+        // no filesystem support before GCC 8: https://en.cppreference.com/w/cpp/compiler_support
+        #if defined(__GNUC__) && !defined(__clang__) && __GNUC__ < 8
+            #undef JSON_HAS_FILESYSTEM
+            #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+        #endif
+
+        // no filesystem support before Clang 7: https://en.cppreference.com/w/cpp/compiler_support
+        #if defined(__clang_major__) && __clang_major__ < 7
+            #undef JSON_HAS_FILESYSTEM
+            #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+        #endif
+
+        // no filesystem support before MSVC 19.14: https://en.cppreference.com/w/cpp/compiler_support
+        #if defined(_MSC_VER) && _MSC_VER < 1914
+            #undef JSON_HAS_FILESYSTEM
+            #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+        #endif
+
+        // no filesystem support before iOS 13
+        #if defined(__IPHONE_OS_VERSION_MIN_REQUIRED) && __IPHONE_OS_VERSION_MIN_REQUIRED < 130000
+            #undef JSON_HAS_FILESYSTEM
+            #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+        #endif
+
+        // no filesystem support before macOS Catalina
+        #if defined(__MAC_OS_X_VERSION_MIN_REQUIRED) && __MAC_OS_X_VERSION_MIN_REQUIRED < 101500
+            #undef JSON_HAS_FILESYSTEM
+            #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+        #endif
+    #endif
+#endif
+
+#ifndef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+    #define JSON_HAS_EXPERIMENTAL_FILESYSTEM 0
+#endif
+
+#ifndef JSON_HAS_FILESYSTEM
+    #define JSON_HAS_FILESYSTEM 0
+#endif
+
+#ifndef JSON_HAS_THREE_WAY_COMPARISON
+    #if defined(__cpp_impl_three_way_comparison) && __cpp_impl_three_way_comparison >= 201907L \
+        && defined(__cpp_lib_three_way_comparison) && __cpp_lib_three_way_comparison >= 201907L
+        #define JSON_HAS_THREE_WAY_COMPARISON 1
+    #else
+        #define JSON_HAS_THREE_WAY_COMPARISON 0
+    #endif
+#endif
+
+#ifndef JSON_HAS_RANGES
+    // ranges header shipping in GCC 11.1.0 (released 2021-04-27) has syntax error
+    #if defined(__GLIBCXX__) && __GLIBCXX__ == 20210427
+        #define JSON_HAS_RANGES 0
+    #elif defined(__cpp_lib_ranges)
+        #define JSON_HAS_RANGES 1
+    #else
+        #define JSON_HAS_RANGES 0
+    #endif
+#endif
+
+#ifndef JSON_HAS_STATIC_RTTI
+    #if !defined(_HAS_STATIC_RTTI) || _HAS_STATIC_RTTI != 0
+        #define JSON_HAS_STATIC_RTTI 1
+    #else
+        #define JSON_HAS_STATIC_RTTI 0
+    #endif
+#endif
+
+#ifdef JSON_HAS_CPP_17
+    #define JSON_INLINE_VARIABLE inline
+#else
+    #define JSON_INLINE_VARIABLE
+#endif
+
+#if JSON_HEDLEY_HAS_ATTRIBUTE(no_unique_address)
+    #define JSON_NO_UNIQUE_ADDRESS [[no_unique_address]]
+#else
+    #define JSON_NO_UNIQUE_ADDRESS
+#endif
+
+// disable documentation warnings on clang
+#if defined(__clang__)
+    #pragma clang diagnostic push
+    #pragma clang diagnostic ignored "-Wdocumentation"
+    #pragma clang diagnostic ignored "-Wdocumentation-unknown-command"
+#endif
+
+// allow disabling exceptions
+#if (defined(__cpp_exceptions) || defined(__EXCEPTIONS) || defined(_CPPUNWIND)) && !defined(JSON_NOEXCEPTION)
+    #define JSON_THROW(exception) throw exception
+    #define JSON_TRY try
+    #define JSON_CATCH(exception) catch(exception)
+    #define JSON_INTERNAL_CATCH(exception) catch(exception)
+#else
+    #include <cstdlib>
+    #define JSON_THROW(exception) std::abort()
+    #define JSON_TRY if(true)
+    #define JSON_CATCH(exception) if(false)
+    #define JSON_INTERNAL_CATCH(exception) if(false)
+#endif
+
+// override exception macros
+#if defined(JSON_THROW_USER)
+    #undef JSON_THROW
+    #define JSON_THROW JSON_THROW_USER
+#endif
+#if defined(JSON_TRY_USER)
+    #undef JSON_TRY
+    #define JSON_TRY JSON_TRY_USER
+#endif
+#if defined(JSON_CATCH_USER)
+    #undef JSON_CATCH
+    #define JSON_CATCH JSON_CATCH_USER
+    #undef JSON_INTERNAL_CATCH
+    #define JSON_INTERNAL_CATCH JSON_CATCH_USER
+#endif
+#if defined(JSON_INTERNAL_CATCH_USER)
+    #undef JSON_INTERNAL_CATCH
+    #define JSON_INTERNAL_CATCH JSON_INTERNAL_CATCH_USER
+#endif
+
+// allow overriding assert
+#if !defined(JSON_ASSERT)
+    #include <cassert> // assert
+    #define JSON_ASSERT(x) assert(x)
+#endif
+
+// allow to access some private functions (needed by the test suite)
+#if defined(JSON_TESTS_PRIVATE)
+    #define JSON_PRIVATE_UNLESS_TESTED public
+#else
+    #define JSON_PRIVATE_UNLESS_TESTED private
+#endif
+
+/*!
+@brief macro to briefly define a mapping between an enum and JSON
+@def NLOHMANN_JSON_SERIALIZE_ENUM
+@since version 3.4.0
+*/
+#define NLOHMANN_JSON_SERIALIZE_ENUM(ENUM_TYPE, ...)                                            \
+    template<typename BasicJsonType>                                                            \
+    inline void to_json(BasicJsonType& j, const ENUM_TYPE& e)                                   \
+    {                                                                                           \
+        static_assert(std::is_enum<ENUM_TYPE>::value, #ENUM_TYPE " must be an enum!");          \
+        static const std::pair<ENUM_TYPE, BasicJsonType> m[] = __VA_ARGS__;                     \
+        auto it = std::find_if(std::begin(m), std::end(m),                                      \
+                               [e](const std::pair<ENUM_TYPE, BasicJsonType>& ej_pair) -> bool  \
+        {                                                                                       \
+            return ej_pair.first == e;                                                          \
+        });                                                                                     \
+        j = ((it != std::end(m)) ? it : std::begin(m))->second;                                 \
+    }                                                                                           \
+    template<typename BasicJsonType>                                                            \
+    inline void from_json(const BasicJsonType& j, ENUM_TYPE& e)                                 \
+    {                                                                                           \
+        static_assert(std::is_enum<ENUM_TYPE>::value, #ENUM_TYPE " must be an enum!");          \
+        static const std::pair<ENUM_TYPE, BasicJsonType> m[] = __VA_ARGS__;                     \
+        auto it = std::find_if(std::begin(m), std::end(m),                                      \
+                               [&j](const std::pair<ENUM_TYPE, BasicJsonType>& ej_pair) -> bool \
+        {                                                                                       \
+            return ej_pair.second == j;                                                         \
+        });                                                                                     \
+        e = ((it != std::end(m)) ? it : std::begin(m))->first;                                  \
+    }
+
+// Ugly macros to avoid uglier copy-paste when specializing basic_json. They
+// may be removed in the future once the class is split.
+
+#define NLOHMANN_BASIC_JSON_TPL_DECLARATION                                \
+    template<template<typename, typename, typename...> class ObjectType,   \
+             template<typename, typename...> class ArrayType,              \
+             class StringType, class BooleanType, class NumberIntegerType, \
+             class NumberUnsignedType, class NumberFloatType,              \
+             template<typename> class AllocatorType,                       \
+             template<typename, typename = void> class JSONSerializer,     \
+             class BinaryType,                                             \
+             class CustomBaseClass>
+
+#define NLOHMANN_BASIC_JSON_TPL                                            \
+    basic_json<ObjectType, ArrayType, StringType, BooleanType,             \
+    NumberIntegerType, NumberUnsignedType, NumberFloatType,                \
+    AllocatorType, JSONSerializer, BinaryType, CustomBaseClass>
+
+// Macros to simplify conversion from/to types
+
+#define NLOHMANN_JSON_EXPAND( x ) x
+#define NLOHMANN_JSON_GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52, _53, _54, _55, _56, _57, _58, _59, _60, _61, _62, _63, _64, NAME,...) NAME
+#define NLOHMANN_JSON_PASTE(...) NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_GET_MACRO(__VA_ARGS__, \
+        NLOHMANN_JSON_PASTE64, \
+        NLOHMANN_JSON_PASTE63, \
+        NLOHMANN_JSON_PASTE62, \
+        NLOHMANN_JSON_PASTE61, \
+        NLOHMANN_JSON_PASTE60, \
+        NLOHMANN_JSON_PASTE59, \
+        NLOHMANN_JSON_PASTE58, \
+        NLOHMANN_JSON_PASTE57, \
+        NLOHMANN_JSON_PASTE56, \
+        NLOHMANN_JSON_PASTE55, \
+        NLOHMANN_JSON_PASTE54, \
+        NLOHMANN_JSON_PASTE53, \
+        NLOHMANN_JSON_PASTE52, \
+        NLOHMANN_JSON_PASTE51, \
+        NLOHMANN_JSON_PASTE50, \
+        NLOHMANN_JSON_PASTE49, \
+        NLOHMANN_JSON_PASTE48, \
+        NLOHMANN_JSON_PASTE47, \
+        NLOHMANN_JSON_PASTE46, \
+        NLOHMANN_JSON_PASTE45, \
+        NLOHMANN_JSON_PASTE44, \
+        NLOHMANN_JSON_PASTE43, \
+        NLOHMANN_JSON_PASTE42, \
+        NLOHMANN_JSON_PASTE41, \
+        NLOHMANN_JSON_PASTE40, \
+        NLOHMANN_JSON_PASTE39, \
+        NLOHMANN_JSON_PASTE38, \
+        NLOHMANN_JSON_PASTE37, \
+        NLOHMANN_JSON_PASTE36, \
+        NLOHMANN_JSON_PASTE35, \
+        NLOHMANN_JSON_PASTE34, \
+        NLOHMANN_JSON_PASTE33, \
+        NLOHMANN_JSON_PASTE32, \
+        NLOHMANN_JSON_PASTE31, \
+        NLOHMANN_JSON_PASTE30, \
+        NLOHMANN_JSON_PASTE29, \
+        NLOHMANN_JSON_PASTE28, \
+        NLOHMANN_JSON_PASTE27, \
+        NLOHMANN_JSON_PASTE26, \
+        NLOHMANN_JSON_PASTE25, \
+        NLOHMANN_JSON_PASTE24, \
+        NLOHMANN_JSON_PASTE23, \
+        NLOHMANN_JSON_PASTE22, \
+        NLOHMANN_JSON_PASTE21, \
+        NLOHMANN_JSON_PASTE20, \
+        NLOHMANN_JSON_PASTE19, \
+        NLOHMANN_JSON_PASTE18, \
+        NLOHMANN_JSON_PASTE17, \
+        NLOHMANN_JSON_PASTE16, \
+        NLOHMANN_JSON_PASTE15, \
+        NLOHMANN_JSON_PASTE14, \
+        NLOHMANN_JSON_PASTE13, \
+        NLOHMANN_JSON_PASTE12, \
+        NLOHMANN_JSON_PASTE11, \
+        NLOHMANN_JSON_PASTE10, \
+        NLOHMANN_JSON_PASTE9, \
+        NLOHMANN_JSON_PASTE8, \
+        NLOHMANN_JSON_PASTE7, \
+        NLOHMANN_JSON_PASTE6, \
+        NLOHMANN_JSON_PASTE5, \
+        NLOHMANN_JSON_PASTE4, \
+        NLOHMANN_JSON_PASTE3, \
+        NLOHMANN_JSON_PASTE2, \
+        NLOHMANN_JSON_PASTE1)(__VA_ARGS__))
+#define NLOHMANN_JSON_PASTE2(func, v1) func(v1)
+#define NLOHMANN_JSON_PASTE3(func, v1, v2) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE2(func, v2)
+#define NLOHMANN_JSON_PASTE4(func, v1, v2, v3) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE3(func, v2, v3)
+#define NLOHMANN_JSON_PASTE5(func, v1, v2, v3, v4) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE4(func, v2, v3, v4)
+#define NLOHMANN_JSON_PASTE6(func, v1, v2, v3, v4, v5) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE5(func, v2, v3, v4, v5)
+#define NLOHMANN_JSON_PASTE7(func, v1, v2, v3, v4, v5, v6) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE6(func, v2, v3, v4, v5, v6)
+#define NLOHMANN_JSON_PASTE8(func, v1, v2, v3, v4, v5, v6, v7) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE7(func, v2, v3, v4, v5, v6, v7)
+#define NLOHMANN_JSON_PASTE9(func, v1, v2, v3, v4, v5, v6, v7, v8) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE8(func, v2, v3, v4, v5, v6, v7, v8)
+#define NLOHMANN_JSON_PASTE10(func, v1, v2, v3, v4, v5, v6, v7, v8, v9) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE9(func, v2, v3, v4, v5, v6, v7, v8, v9)
+#define NLOHMANN_JSON_PASTE11(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE10(func, v2, v3, v4, v5, v6, v7, v8, v9, v10)
+#define NLOHMANN_JSON_PASTE12(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE11(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11)
+#define NLOHMANN_JSON_PASTE13(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE12(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12)
+#define NLOHMANN_JSON_PASTE14(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE13(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13)
+#define NLOHMANN_JSON_PASTE15(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE14(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14)
+#define NLOHMANN_JSON_PASTE16(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE15(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15)
+#define NLOHMANN_JSON_PASTE17(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE16(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16)
+#define NLOHMANN_JSON_PASTE18(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE17(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17)
+#define NLOHMANN_JSON_PASTE19(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE18(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18)
+#define NLOHMANN_JSON_PASTE20(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE19(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19)
+#define NLOHMANN_JSON_PASTE21(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE20(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20)
+#define NLOHMANN_JSON_PASTE22(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE21(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21)
+#define NLOHMANN_JSON_PASTE23(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE22(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22)
+#define NLOHMANN_JSON_PASTE24(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE23(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23)
+#define NLOHMANN_JSON_PASTE25(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE24(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24)
+#define NLOHMANN_JSON_PASTE26(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE25(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25)
+#define NLOHMANN_JSON_PASTE27(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE26(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26)
+#define NLOHMANN_JSON_PASTE28(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE27(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27)
+#define NLOHMANN_JSON_PASTE29(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE28(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28)
+#define NLOHMANN_JSON_PASTE30(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE29(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29)
+#define NLOHMANN_JSON_PASTE31(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE30(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30)
+#define NLOHMANN_JSON_PASTE32(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE31(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31)
+#define NLOHMANN_JSON_PASTE33(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE32(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32)
+#define NLOHMANN_JSON_PASTE34(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE33(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33)
+#define NLOHMANN_JSON_PASTE35(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE34(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34)
+#define NLOHMANN_JSON_PASTE36(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE35(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35)
+#define NLOHMANN_JSON_PASTE37(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE36(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36)
+#define NLOHMANN_JSON_PASTE38(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE37(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37)
+#define NLOHMANN_JSON_PASTE39(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE38(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38)
+#define NLOHMANN_JSON_PASTE40(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE39(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39)
+#define NLOHMANN_JSON_PASTE41(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE40(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40)
+#define NLOHMANN_JSON_PASTE42(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE41(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41)
+#define NLOHMANN_JSON_PASTE43(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE42(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42)
+#define NLOHMANN_JSON_PASTE44(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE43(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43)
+#define NLOHMANN_JSON_PASTE45(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE44(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44)
+#define NLOHMANN_JSON_PASTE46(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE45(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45)
+#define NLOHMANN_JSON_PASTE47(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE46(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46)
+#define NLOHMANN_JSON_PASTE48(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE47(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47)
+#define NLOHMANN_JSON_PASTE49(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE48(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48)
+#define NLOHMANN_JSON_PASTE50(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE49(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49)
+#define NLOHMANN_JSON_PASTE51(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE50(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50)
+#define NLOHMANN_JSON_PASTE52(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE51(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51)
+#define NLOHMANN_JSON_PASTE53(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE52(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52)
+#define NLOHMANN_JSON_PASTE54(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE53(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53)
+#define NLOHMANN_JSON_PASTE55(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE54(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54)
+#define NLOHMANN_JSON_PASTE56(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE55(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55)
+#define NLOHMANN_JSON_PASTE57(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE56(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56)
+#define NLOHMANN_JSON_PASTE58(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE57(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57)
+#define NLOHMANN_JSON_PASTE59(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE58(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58)
+#define NLOHMANN_JSON_PASTE60(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE59(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59)
+#define NLOHMANN_JSON_PASTE61(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE60(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60)
+#define NLOHMANN_JSON_PASTE62(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE61(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61)
+#define NLOHMANN_JSON_PASTE63(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61, v62) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE62(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61, v62)
+#define NLOHMANN_JSON_PASTE64(func, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61, v62, v63) NLOHMANN_JSON_PASTE2(func, v1) NLOHMANN_JSON_PASTE63(func, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49, v50, v51, v52, v53, v54, v55, v56, v57, v58, v59, v60, v61, v62, v63)
+
+#define NLOHMANN_JSON_TO(v1) nlohmann_json_j[#v1] = nlohmann_json_t.v1;
+#define NLOHMANN_JSON_FROM(v1) nlohmann_json_j.at(#v1).get_to(nlohmann_json_t.v1);
+#define NLOHMANN_JSON_FROM_WITH_DEFAULT(v1) nlohmann_json_t.v1 = nlohmann_json_j.value(#v1, nlohmann_json_default_obj.v1);
+
+/*!
+@brief macro
+@def NLOHMANN_DEFINE_TYPE_INTRUSIVE
+@since version 3.9.0
+*/
+#define NLOHMANN_DEFINE_TYPE_INTRUSIVE(Type, ...)  \
+    friend void to_json(nlohmann::json& nlohmann_json_j, const Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_TO, __VA_ARGS__)) } \
+    friend void from_json(const nlohmann::json& nlohmann_json_j, Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_FROM, __VA_ARGS__)) }
+
+#define NLOHMANN_DEFINE_TYPE_INTRUSIVE_WITH_DEFAULT(Type, ...)  \
+    friend void to_json(nlohmann::json& nlohmann_json_j, const Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_TO, __VA_ARGS__)) } \
+    friend void from_json(const nlohmann::json& nlohmann_json_j, Type& nlohmann_json_t) { const Type nlohmann_json_default_obj{}; NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_FROM_WITH_DEFAULT, __VA_ARGS__)) }
+
+#define NLOHMANN_DEFINE_TYPE_INTRUSIVE_ONLY_SERIALIZE(Type, ...)  \
+    friend void to_json(nlohmann::json& nlohmann_json_j, const Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_TO, __VA_ARGS__)) }
+
+/*!
+@brief macro
+@def NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE
+@since version 3.9.0
+*/
+#define NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(Type, ...)  \
+    inline void to_json(nlohmann::json& nlohmann_json_j, const Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_TO, __VA_ARGS__)) } \
+    inline void from_json(const nlohmann::json& nlohmann_json_j, Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_FROM, __VA_ARGS__)) }
+
+#define NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE_ONLY_SERIALIZE(Type, ...)  \
+    inline void to_json(nlohmann::json& nlohmann_json_j, const Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_TO, __VA_ARGS__)) }
+
+#define NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE_WITH_DEFAULT(Type, ...)  \
+    inline void to_json(nlohmann::json& nlohmann_json_j, const Type& nlohmann_json_t) { NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_TO, __VA_ARGS__)) } \
+    inline void from_json(const nlohmann::json& nlohmann_json_j, Type& nlohmann_json_t) { const Type nlohmann_json_default_obj{}; NLOHMANN_JSON_EXPAND(NLOHMANN_JSON_PASTE(NLOHMANN_JSON_FROM_WITH_DEFAULT, __VA_ARGS__)) }
+
+// inspired from https://stackoverflow.com/a/26745591
+// allows to call any std function as if (e.g. with begin):
+// using std::begin; begin(x);
+//
+// it allows using the detected idiom to retrieve the return type
+// of such an expression
+#define NLOHMANN_CAN_CALL_STD_FUNC_IMPL(std_name)                                 \
+    namespace detail {                                                            \
+    using std::std_name;                                                          \
+    \
+    template<typename... T>                                                       \
+    using result_of_##std_name = decltype(std_name(std::declval<T>()...));        \
+    }                                                                             \
+    \
+    namespace detail2 {                                                           \
+    struct std_name##_tag                                                         \
+    {                                                                             \
+    };                                                                            \
+    \
+    template<typename... T>                                                       \
+    std_name##_tag std_name(T&&...);                                              \
+    \
+    template<typename... T>                                                       \
+    using result_of_##std_name = decltype(std_name(std::declval<T>()...));        \
+    \
+    template<typename... T>                                                       \
+    struct would_call_std_##std_name                                              \
+    {                                                                             \
+        static constexpr auto const value = ::nlohmann::detail::                  \
+                                            is_detected_exact<std_name##_tag, result_of_##std_name, T...>::value; \
+    };                                                                            \
+    } /* namespace detail2 */ \
+    \
+    template<typename... T>                                                       \
+    struct would_call_std_##std_name : detail2::would_call_std_##std_name<T...>   \
+    {                                                                             \
+    }
+
+#ifndef JSON_USE_IMPLICIT_CONVERSIONS
+    #define JSON_USE_IMPLICIT_CONVERSIONS 1
+#endif
+
+#if JSON_USE_IMPLICIT_CONVERSIONS
+    #define JSON_EXPLICIT
+#else
+    #define JSON_EXPLICIT explicit
+#endif
+
+#ifndef JSON_DISABLE_ENUM_SERIALIZATION
+    #define JSON_DISABLE_ENUM_SERIALIZATION 0
+#endif
+
+#ifndef JSON_USE_GLOBAL_UDLS
+    #define JSON_USE_GLOBAL_UDLS 1
+#endif
+
+#if JSON_HAS_THREE_WAY_COMPARISON
+    #include <compare> // partial_ordering
+#endif
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+///////////////////////////
+// JSON type enumeration //
+///////////////////////////
+
+/*!
+@brief the JSON type enumeration
+
+This enumeration collects the different JSON types. It is internally used to
+distinguish the stored values, and the functions @ref basic_json::is_null(),
+@ref basic_json::is_object(), @ref basic_json::is_array(),
+@ref basic_json::is_string(), @ref basic_json::is_boolean(),
+@ref basic_json::is_number() (with @ref basic_json::is_number_integer(),
+@ref basic_json::is_number_unsigned(), and @ref basic_json::is_number_float()),
+@ref basic_json::is_discarded(), @ref basic_json::is_primitive(), and
+@ref basic_json::is_structured() rely on it.
+
+@note There are three enumeration entries (number_integer, number_unsigned, and
+number_float), because the library distinguishes these three types for numbers:
+@ref basic_json::number_unsigned_t is used for unsigned integers,
+@ref basic_json::number_integer_t is used for signed integers, and
+@ref basic_json::number_float_t is used for floating-point numbers or to
+approximate integers which do not fit in the limits of their respective type.
+
+@sa see @ref basic_json::basic_json(const value_t value_type) -- create a JSON
+value with the default value for a given type
+
+@since version 1.0.0
+*/
+enum class value_t : std::uint8_t
+{
+    null,             ///< null value
+    object,           ///< object (unordered set of name/value pairs)
+    array,            ///< array (ordered collection of values)
+    string,           ///< string value
+    boolean,          ///< boolean value
+    number_integer,   ///< number value (signed integer)
+    number_unsigned,  ///< number value (unsigned integer)
+    number_float,     ///< number value (floating-point)
+    binary,           ///< binary array (ordered collection of bytes)
+    discarded         ///< discarded by the parser callback function
+};
+
+/*!
+@brief comparison operator for JSON types
+
+Returns an ordering that is similar to Python:
+- order: null < boolean < number < object < array < string < binary
+- furthermore, each type is not smaller than itself
+- discarded values are not comparable
+- binary is represented as a b"" string in python and directly comparable to a
+  string; however, making a binary array directly comparable with a string would
+  be surprising behavior in a JSON file.
+
+@since version 1.0.0
+*/
+#if JSON_HAS_THREE_WAY_COMPARISON
+    inline std::partial_ordering operator<=>(const value_t lhs, const value_t rhs) noexcept // *NOPAD*
+#else
+    inline bool operator<(const value_t lhs, const value_t rhs) noexcept
+#endif
+{
+    static constexpr std::array<std::uint8_t, 9> order = {{
+            0 /* null */, 3 /* object */, 4 /* array */, 5 /* string */,
+            1 /* boolean */, 2 /* integer */, 2 /* unsigned */, 2 /* float */,
+            6 /* binary */
+        }
+    };
+
+    const auto l_index = static_cast<std::size_t>(lhs);
+    const auto r_index = static_cast<std::size_t>(rhs);
+#if JSON_HAS_THREE_WAY_COMPARISON
+    if (l_index < order.size() && r_index < order.size())
+    {
+        return order[l_index] <=> order[r_index]; // *NOPAD*
+    }
+    return std::partial_ordering::unordered;
+#else
+    return l_index < order.size() && r_index < order.size() && order[l_index] < order[r_index];
+#endif
+}
+
+// GCC selects the built-in operator< over an operator rewritten from
+// a user-defined spaceship operator
+// Clang, MSVC, and ICC select the rewritten candidate
+// (see GCC bug https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105200)
+#if JSON_HAS_THREE_WAY_COMPARISON && defined(__GNUC__)
+inline bool operator<(const value_t lhs, const value_t rhs) noexcept
+{
+    return std::is_lt(lhs <=> rhs); // *NOPAD*
+}
+#endif
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/string_escape.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/*!
+@brief replace all occurrences of a substring by another string
+
+@param[in,out] s  the string to manipulate; changed so that all
+               occurrences of @a f are replaced with @a t
+@param[in]     f  the substring to replace with @a t
+@param[in]     t  the string to replace @a f
+
+@pre The search string @a f must not be empty. **This precondition is
+enforced with an assertion.**
+
+@since version 2.0.0
+*/
+template<typename StringType>
+inline void replace_substring(StringType& s, const StringType& f,
+                              const StringType& t)
+{
+    JSON_ASSERT(!f.empty());
+    for (auto pos = s.find(f);                // find first occurrence of f
+            pos != StringType::npos;          // make sure f was found
+            s.replace(pos, f.size(), t),      // replace with t, and
+            pos = s.find(f, pos + t.size()))  // find next occurrence of f
+    {}
+}
+
+/*!
+ * @brief string escaping as described in RFC 6901 (Sect. 4)
+ * @param[in] s string to escape
+ * @return    escaped string
+ *
+ * Note the order of escaping "~" to "~0" and "/" to "~1" is important.
+ */
+template<typename StringType>
+inline StringType escape(StringType s)
+{
+    replace_substring(s, StringType{"~"}, StringType{"~0"});
+    replace_substring(s, StringType{"/"}, StringType{"~1"});
+    return s;
+}
+
+/*!
+ * @brief string unescaping as described in RFC 6901 (Sect. 4)
+ * @param[in] s string to unescape
+ * @return    unescaped string
+ *
+ * Note the order of escaping "~1" to "/" and "~0" to "~" is important.
+ */
+template<typename StringType>
+static void unescape(StringType& s)
+{
+    replace_substring(s, StringType{"~1"}, StringType{"/"});
+    replace_substring(s, StringType{"~0"}, StringType{"~"});
+}
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/input/position_t.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstddef> // size_t
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/// struct to capture the start position of the current token
+struct position_t
+{
+    /// the total number of characters read
+    std::size_t chars_read_total = 0;
+    /// the number of characters read in the current line
+    std::size_t chars_read_current_line = 0;
+    /// the number of lines read
+    std::size_t lines_read = 0;
+
+    /// conversion to size_t to preserve SAX interface
+    constexpr operator size_t() const
+    {
+        return chars_read_total;
+    }
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-FileCopyrightText: 2018 The Abseil Authors
+// SPDX-License-Identifier: MIT
+
+
+
+#include <array> // array
+#include <cstddef> // size_t
+#include <type_traits> // conditional, enable_if, false_type, integral_constant, is_constructible, is_integral, is_same, remove_cv, remove_reference, true_type
+#include <utility> // index_sequence, make_index_sequence, index_sequence_for
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename T>
+using uncvref_t = typename std::remove_cv<typename std::remove_reference<T>::type>::type;
+
+#ifdef JSON_HAS_CPP_14
+
+// the following utilities are natively available in C++14
+using std::enable_if_t;
+using std::index_sequence;
+using std::make_index_sequence;
+using std::index_sequence_for;
+
+#else
+
+// alias templates to reduce boilerplate
+template<bool B, typename T = void>
+using enable_if_t = typename std::enable_if<B, T>::type;
+
+// The following code is taken from https://github.com/abseil/abseil-cpp/blob/10cb35e459f5ecca5b2ff107635da0bfa41011b4/absl/utility/utility.h
+// which is part of Google Abseil (https://github.com/abseil/abseil-cpp), licensed under the Apache License 2.0.
+
+//// START OF CODE FROM GOOGLE ABSEIL
+
+// integer_sequence
+//
+// Class template representing a compile-time integer sequence. An instantiation
+// of `integer_sequence<T, Ints...>` has a sequence of integers encoded in its
+// type through its template arguments (which is a common need when
+// working with C++11 variadic templates). `absl::integer_sequence` is designed
+// to be a drop-in replacement for C++14's `std::integer_sequence`.
+//
+// Example:
+//
+//   template< class T, T... Ints >
+//   void user_function(integer_sequence<T, Ints...>);
+//
+//   int main()
+//   {
+//     // user_function's `T` will be deduced to `int` and `Ints...`
+//     // will be deduced to `0, 1, 2, 3, 4`.
+//     user_function(make_integer_sequence<int, 5>());
+//   }
+template <typename T, T... Ints>
+struct integer_sequence
+{
+    using value_type = T;
+    static constexpr std::size_t size() noexcept
+    {
+        return sizeof...(Ints);
+    }
+};
+
+// index_sequence
+//
+// A helper template for an `integer_sequence` of `size_t`,
+// `absl::index_sequence` is designed to be a drop-in replacement for C++14's
+// `std::index_sequence`.
+template <size_t... Ints>
+using index_sequence = integer_sequence<size_t, Ints...>;
+
+namespace utility_internal
+{
+
+template <typename Seq, size_t SeqSize, size_t Rem>
+struct Extend;
+
+// Note that SeqSize == sizeof...(Ints). It's passed explicitly for efficiency.
+template <typename T, T... Ints, size_t SeqSize>
+struct Extend<integer_sequence<T, Ints...>, SeqSize, 0>
+{
+    using type = integer_sequence < T, Ints..., (Ints + SeqSize)... >;
+};
+
+template <typename T, T... Ints, size_t SeqSize>
+struct Extend<integer_sequence<T, Ints...>, SeqSize, 1>
+{
+    using type = integer_sequence < T, Ints..., (Ints + SeqSize)..., 2 * SeqSize >;
+};
+
+// Recursion helper for 'make_integer_sequence<T, N>'.
+// 'Gen<T, N>::type' is an alias for 'integer_sequence<T, 0, 1, ... N-1>'.
+template <typename T, size_t N>
+struct Gen
+{
+    using type =
+        typename Extend < typename Gen < T, N / 2 >::type, N / 2, N % 2 >::type;
+};
+
+template <typename T>
+struct Gen<T, 0>
+{
+    using type = integer_sequence<T>;
+};
+
+}  // namespace utility_internal
+
+// Compile-time sequences of integers
+
+// make_integer_sequence
+//
+// This template alias is equivalent to
+// `integer_sequence<int, 0, 1, ..., N-1>`, and is designed to be a drop-in
+// replacement for C++14's `std::make_integer_sequence`.
+template <typename T, T N>
+using make_integer_sequence = typename utility_internal::Gen<T, N>::type;
+
+// make_index_sequence
+//
+// This template alias is equivalent to `index_sequence<0, 1, ..., N-1>`,
+// and is designed to be a drop-in replacement for C++14's
+// `std::make_index_sequence`.
+template <size_t N>
+using make_index_sequence = make_integer_sequence<size_t, N>;
+
+// index_sequence_for
+//
+// Converts a typename pack into an index sequence of the same length, and
+// is designed to be a drop-in replacement for C++14's
+// `std::index_sequence_for()`
+template <typename... Ts>
+using index_sequence_for = make_index_sequence<sizeof...(Ts)>;
+
+//// END OF CODE FROM GOOGLE ABSEIL
+
+#endif
+
+// dispatch utility (taken from ranges-v3)
+template<unsigned N> struct priority_tag : priority_tag < N - 1 > {};
+template<> struct priority_tag<0> {};
+
+// taken from ranges-v3
+template<typename T>
+struct static_const
+{
+    static JSON_INLINE_VARIABLE constexpr T value{};
+};
+
+#ifndef JSON_HAS_CPP_17
+    template<typename T>
+    constexpr T static_const<T>::value;
+#endif
+
+template<typename T, typename... Args>
+inline constexpr std::array<T, sizeof...(Args)> make_array(Args&& ... args)
+{
+    return std::array<T, sizeof...(Args)> {{static_cast<T>(std::forward<Args>(args))...}};
+}
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <limits> // numeric_limits
+#include <type_traits> // false_type, is_constructible, is_integral, is_same, true_type
+#include <utility> // declval
+#include <tuple> // tuple
+#include <string> // char_traits
+
+// #include <nlohmann/detail/iterators/iterator_traits.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <iterator> // random_access_iterator_tag
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+// #include <nlohmann/detail/meta/void_t.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename It, typename = void>
+struct iterator_types {};
+
+template<typename It>
+struct iterator_types <
+    It,
+    void_t<typename It::difference_type, typename It::value_type, typename It::pointer,
+    typename It::reference, typename It::iterator_category >>
+{
+    using difference_type = typename It::difference_type;
+    using value_type = typename It::value_type;
+    using pointer = typename It::pointer;
+    using reference = typename It::reference;
+    using iterator_category = typename It::iterator_category;
+};
+
+// This is required as some compilers implement std::iterator_traits in a way that
+// doesn't work with SFINAE. See https://github.com/nlohmann/json/issues/1341.
+template<typename T, typename = void>
+struct iterator_traits
+{
+};
+
+template<typename T>
+struct iterator_traits < T, enable_if_t < !std::is_pointer<T>::value >>
+            : iterator_types<T>
+{
+};
+
+template<typename T>
+struct iterator_traits<T*, enable_if_t<std::is_object<T>::value>>
+{
+    using iterator_category = std::random_access_iterator_tag;
+    using value_type = T;
+    using difference_type = ptrdiff_t;
+    using pointer = T*;
+    using reference = T&;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/call_std/begin.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+NLOHMANN_CAN_CALL_STD_FUNC_IMPL(begin);
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/meta/call_std/end.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+NLOHMANN_CAN_CALL_STD_FUNC_IMPL(end);
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/detected.hpp>
+
+// #include <nlohmann/json_fwd.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+#ifndef INCLUDE_NLOHMANN_JSON_FWD_HPP_
+    #define INCLUDE_NLOHMANN_JSON_FWD_HPP_
+
+    #include <cstdint> // int64_t, uint64_t
+    #include <map> // map
+    #include <memory> // allocator
+    #include <string> // string
+    #include <vector> // vector
+
+    // #include <nlohmann/detail/abi_macros.hpp>
+
+
+    /*!
+    @brief namespace for Niels Lohmann
+    @see https://github.com/nlohmann
+    @since version 1.0.0
+    */
+    NLOHMANN_JSON_NAMESPACE_BEGIN
+
+    /*!
+    @brief default JSONSerializer template argument
+
+    This serializer ignores the template arguments and uses ADL
+    ([argument-dependent lookup](https://en.cppreference.com/w/cpp/language/adl))
+    for serialization.
+    */
+    template<typename T = void, typename SFINAE = void>
+    struct adl_serializer;
+
+    /// a class to store JSON values
+    /// @sa https://json.nlohmann.me/api/basic_json/
+    template<template<typename U, typename V, typename... Args> class ObjectType =
+    std::map,
+    template<typename U, typename... Args> class ArrayType = std::vector,
+    class StringType = std::string, class BooleanType = bool,
+    class NumberIntegerType = std::int64_t,
+    class NumberUnsignedType = std::uint64_t,
+    class NumberFloatType = double,
+    template<typename U> class AllocatorType = std::allocator,
+    template<typename T, typename SFINAE = void> class JSONSerializer =
+    adl_serializer,
+    class BinaryType = std::vector<std::uint8_t>, // cppcheck-suppress syntaxError
+    class CustomBaseClass = void>
+    class basic_json;
+
+    /// @brief JSON Pointer defines a string syntax for identifying a specific value within a JSON document
+    /// @sa https://json.nlohmann.me/api/json_pointer/
+    template<typename RefStringType>
+    class json_pointer;
+
+    /*!
+    @brief default specialization
+    @sa https://json.nlohmann.me/api/json/
+    */
+    using json = basic_json<>;
+
+    /// @brief a minimal map-like container that preserves insertion order
+    /// @sa https://json.nlohmann.me/api/ordered_map/
+    template<class Key, class T, class IgnoredLess, class Allocator>
+    struct ordered_map;
+
+    /// @brief specialization that maintains the insertion order of object keys
+    /// @sa https://json.nlohmann.me/api/ordered_json/
+    using ordered_json = basic_json<nlohmann::ordered_map>;
+
+    NLOHMANN_JSON_NAMESPACE_END
+
+#endif  // INCLUDE_NLOHMANN_JSON_FWD_HPP_
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+/*!
+@brief detail namespace with internal helper functions
+
+This namespace collects functions that should not be exposed,
+implementations of some @ref basic_json methods, and meta-programming helpers.
+
+@since version 2.1.0
+*/
+namespace detail
+{
+
+/////////////
+// helpers //
+/////////////
+
+// Note to maintainers:
+//
+// Every trait in this file expects a non CV-qualified type.
+// The only exceptions are in the 'aliases for detected' section
+// (i.e. those of the form: decltype(T::member_function(std::declval<T>())))
+//
+// In this case, T has to be properly CV-qualified to constraint the function arguments
+// (e.g. to_json(BasicJsonType&, const T&))
+
+template<typename> struct is_basic_json : std::false_type {};
+
+NLOHMANN_BASIC_JSON_TPL_DECLARATION
+struct is_basic_json<NLOHMANN_BASIC_JSON_TPL> : std::true_type {};
+
+// used by exceptions create() member functions
+// true_type for pointer to possibly cv-qualified basic_json or std::nullptr_t
+// false_type otherwise
+template<typename BasicJsonContext>
+struct is_basic_json_context :
+    std::integral_constant < bool,
+    is_basic_json<typename std::remove_cv<typename std::remove_pointer<BasicJsonContext>::type>::type>::value
+    || std::is_same<BasicJsonContext, std::nullptr_t>::value >
+{};
+
+//////////////////////
+// json_ref helpers //
+//////////////////////
+
+template<typename>
+class json_ref;
+
+template<typename>
+struct is_json_ref : std::false_type {};
+
+template<typename T>
+struct is_json_ref<json_ref<T>> : std::true_type {};
+
+//////////////////////////
+// aliases for detected //
+//////////////////////////
+
+template<typename T>
+using mapped_type_t = typename T::mapped_type;
+
+template<typename T>
+using key_type_t = typename T::key_type;
+
+template<typename T>
+using value_type_t = typename T::value_type;
+
+template<typename T>
+using difference_type_t = typename T::difference_type;
+
+template<typename T>
+using pointer_t = typename T::pointer;
+
+template<typename T>
+using reference_t = typename T::reference;
+
+template<typename T>
+using iterator_category_t = typename T::iterator_category;
+
+template<typename T, typename... Args>
+using to_json_function = decltype(T::to_json(std::declval<Args>()...));
+
+template<typename T, typename... Args>
+using from_json_function = decltype(T::from_json(std::declval<Args>()...));
+
+template<typename T, typename U>
+using get_template_function = decltype(std::declval<T>().template get<U>());
+
+// trait checking if JSONSerializer<T>::from_json(json const&, udt&) exists
+template<typename BasicJsonType, typename T, typename = void>
+struct has_from_json : std::false_type {};
+
+// trait checking if j.get<T> is valid
+// use this trait instead of std::is_constructible or std::is_convertible,
+// both rely on, or make use of implicit conversions, and thus fail when T
+// has several constructors/operator= (see https://github.com/nlohmann/json/issues/958)
+template <typename BasicJsonType, typename T>
+struct is_getable
+{
+    static constexpr bool value = is_detected<get_template_function, const BasicJsonType&, T>::value;
+};
+
+template<typename BasicJsonType, typename T>
+struct has_from_json < BasicJsonType, T, enable_if_t < !is_basic_json<T>::value >>
+{
+    using serializer = typename BasicJsonType::template json_serializer<T, void>;
+
+    static constexpr bool value =
+        is_detected_exact<void, from_json_function, serializer,
+        const BasicJsonType&, T&>::value;
+};
+
+// This trait checks if JSONSerializer<T>::from_json(json const&) exists
+// this overload is used for non-default-constructible user-defined-types
+template<typename BasicJsonType, typename T, typename = void>
+struct has_non_default_from_json : std::false_type {};
+
+template<typename BasicJsonType, typename T>
+struct has_non_default_from_json < BasicJsonType, T, enable_if_t < !is_basic_json<T>::value >>
+{
+    using serializer = typename BasicJsonType::template json_serializer<T, void>;
+
+    static constexpr bool value =
+        is_detected_exact<T, from_json_function, serializer,
+        const BasicJsonType&>::value;
+};
+
+// This trait checks if BasicJsonType::json_serializer<T>::to_json exists
+// Do not evaluate the trait when T is a basic_json type, to avoid template instantiation infinite recursion.
+template<typename BasicJsonType, typename T, typename = void>
+struct has_to_json : std::false_type {};
+
+template<typename BasicJsonType, typename T>
+struct has_to_json < BasicJsonType, T, enable_if_t < !is_basic_json<T>::value >>
+{
+    using serializer = typename BasicJsonType::template json_serializer<T, void>;
+
+    static constexpr bool value =
+        is_detected_exact<void, to_json_function, serializer, BasicJsonType&,
+        T>::value;
+};
+
+template<typename T>
+using detect_key_compare = typename T::key_compare;
+
+template<typename T>
+struct has_key_compare : std::integral_constant<bool, is_detected<detect_key_compare, T>::value> {};
+
+// obtains the actual object key comparator
+template<typename BasicJsonType>
+struct actual_object_comparator
+{
+    using object_t = typename BasicJsonType::object_t;
+    using object_comparator_t = typename BasicJsonType::default_object_comparator_t;
+    using type = typename std::conditional < has_key_compare<object_t>::value,
+          typename object_t::key_compare, object_comparator_t>::type;
+};
+
+template<typename BasicJsonType>
+using actual_object_comparator_t = typename actual_object_comparator<BasicJsonType>::type;
+
+/////////////////
+// char_traits //
+/////////////////
+
+// Primary template of char_traits calls std char_traits
+template<typename T>
+struct char_traits : std::char_traits<T>
+{};
+
+// Explicitly define char traits for unsigned char since it is not standard
+template<>
+struct char_traits<unsigned char> : std::char_traits<char>
+{
+    using char_type = unsigned char;
+    using int_type = uint64_t;
+
+    // Redefine to_int_type function
+    static int_type to_int_type(char_type c) noexcept
+    {
+        return static_cast<int_type>(c);
+    }
+
+    static char_type to_char_type(int_type i) noexcept
+    {
+        return static_cast<char_type>(i);
+    }
+
+    static constexpr int_type eof() noexcept
+    {
+        return static_cast<int_type>(EOF);
+    }
+};
+
+// Explicitly define char traits for signed char since it is not standard
+template<>
+struct char_traits<signed char> : std::char_traits<char>
+{
+    using char_type = signed char;
+    using int_type = uint64_t;
+
+    // Redefine to_int_type function
+    static int_type to_int_type(char_type c) noexcept
+    {
+        return static_cast<int_type>(c);
+    }
+
+    static char_type to_char_type(int_type i) noexcept
+    {
+        return static_cast<char_type>(i);
+    }
+
+    static constexpr int_type eof() noexcept
+    {
+        return static_cast<int_type>(EOF);
+    }
+};
+
+///////////////////
+// is_ functions //
+///////////////////
+
+// https://en.cppreference.com/w/cpp/types/conjunction
+template<class...> struct conjunction : std::true_type { };
+template<class B> struct conjunction<B> : B { };
+template<class B, class... Bn>
+struct conjunction<B, Bn...>
+: std::conditional<static_cast<bool>(B::value), conjunction<Bn...>, B>::type {};
+
+// https://en.cppreference.com/w/cpp/types/negation
+template<class B> struct negation : std::integral_constant < bool, !B::value > { };
+
+// Reimplementation of is_constructible and is_default_constructible, due to them being broken for
+// std::pair and std::tuple until LWG 2367 fix (see https://cplusplus.github.io/LWG/lwg-defects.html#2367).
+// This causes compile errors in e.g. clang 3.5 or gcc 4.9.
+template <typename T>
+struct is_default_constructible : std::is_default_constructible<T> {};
+
+template <typename T1, typename T2>
+struct is_default_constructible<std::pair<T1, T2>>
+            : conjunction<is_default_constructible<T1>, is_default_constructible<T2>> {};
+
+template <typename T1, typename T2>
+struct is_default_constructible<const std::pair<T1, T2>>
+            : conjunction<is_default_constructible<T1>, is_default_constructible<T2>> {};
+
+template <typename... Ts>
+struct is_default_constructible<std::tuple<Ts...>>
+            : conjunction<is_default_constructible<Ts>...> {};
+
+template <typename... Ts>
+struct is_default_constructible<const std::tuple<Ts...>>
+            : conjunction<is_default_constructible<Ts>...> {};
+
+template <typename T, typename... Args>
+struct is_constructible : std::is_constructible<T, Args...> {};
+
+template <typename T1, typename T2>
+struct is_constructible<std::pair<T1, T2>> : is_default_constructible<std::pair<T1, T2>> {};
+
+template <typename T1, typename T2>
+struct is_constructible<const std::pair<T1, T2>> : is_default_constructible<const std::pair<T1, T2>> {};
+
+template <typename... Ts>
+struct is_constructible<std::tuple<Ts...>> : is_default_constructible<std::tuple<Ts...>> {};
+
+template <typename... Ts>
+struct is_constructible<const std::tuple<Ts...>> : is_default_constructible<const std::tuple<Ts...>> {};
+
+template<typename T, typename = void>
+struct is_iterator_traits : std::false_type {};
+
+template<typename T>
+struct is_iterator_traits<iterator_traits<T>>
+{
+  private:
+    using traits = iterator_traits<T>;
+
+  public:
+    static constexpr auto value =
+        is_detected<value_type_t, traits>::value &&
+        is_detected<difference_type_t, traits>::value &&
+        is_detected<pointer_t, traits>::value &&
+        is_detected<iterator_category_t, traits>::value &&
+        is_detected<reference_t, traits>::value;
+};
+
+template<typename T>
+struct is_range
+{
+  private:
+    using t_ref = typename std::add_lvalue_reference<T>::type;
+
+    using iterator = detected_t<result_of_begin, t_ref>;
+    using sentinel = detected_t<result_of_end, t_ref>;
+
+    // to be 100% correct, it should use https://en.cppreference.com/w/cpp/iterator/input_or_output_iterator
+    // and https://en.cppreference.com/w/cpp/iterator/sentinel_for
+    // but reimplementing these would be too much work, as a lot of other concepts are used underneath
+    static constexpr auto is_iterator_begin =
+        is_iterator_traits<iterator_traits<iterator>>::value;
+
+  public:
+    static constexpr bool value = !std::is_same<iterator, nonesuch>::value && !std::is_same<sentinel, nonesuch>::value && is_iterator_begin;
+};
+
+template<typename R>
+using iterator_t = enable_if_t<is_range<R>::value, result_of_begin<decltype(std::declval<R&>())>>;
+
+template<typename T>
+using range_value_t = value_type_t<iterator_traits<iterator_t<T>>>;
+
+// The following implementation of is_complete_type is taken from
+// https://blogs.msdn.microsoft.com/vcblog/2015/12/02/partial-support-for-expression-sfinae-in-vs-2015-update-1/
+// and is written by Xiang Fan who agreed to using it in this library.
+
+template<typename T, typename = void>
+struct is_complete_type : std::false_type {};
+
+template<typename T>
+struct is_complete_type<T, decltype(void(sizeof(T)))> : std::true_type {};
+
+template<typename BasicJsonType, typename CompatibleObjectType,
+         typename = void>
+struct is_compatible_object_type_impl : std::false_type {};
+
+template<typename BasicJsonType, typename CompatibleObjectType>
+struct is_compatible_object_type_impl <
+    BasicJsonType, CompatibleObjectType,
+    enable_if_t < is_detected<mapped_type_t, CompatibleObjectType>::value&&
+    is_detected<key_type_t, CompatibleObjectType>::value >>
+{
+    using object_t = typename BasicJsonType::object_t;
+
+    // macOS's is_constructible does not play well with nonesuch...
+    static constexpr bool value =
+        is_constructible<typename object_t::key_type,
+        typename CompatibleObjectType::key_type>::value &&
+        is_constructible<typename object_t::mapped_type,
+        typename CompatibleObjectType::mapped_type>::value;
+};
+
+template<typename BasicJsonType, typename CompatibleObjectType>
+struct is_compatible_object_type
+    : is_compatible_object_type_impl<BasicJsonType, CompatibleObjectType> {};
+
+template<typename BasicJsonType, typename ConstructibleObjectType,
+         typename = void>
+struct is_constructible_object_type_impl : std::false_type {};
+
+template<typename BasicJsonType, typename ConstructibleObjectType>
+struct is_constructible_object_type_impl <
+    BasicJsonType, ConstructibleObjectType,
+    enable_if_t < is_detected<mapped_type_t, ConstructibleObjectType>::value&&
+    is_detected<key_type_t, ConstructibleObjectType>::value >>
+{
+    using object_t = typename BasicJsonType::object_t;
+
+    static constexpr bool value =
+        (is_default_constructible<ConstructibleObjectType>::value &&
+         (std::is_move_assignable<ConstructibleObjectType>::value ||
+          std::is_copy_assignable<ConstructibleObjectType>::value) &&
+         (is_constructible<typename ConstructibleObjectType::key_type,
+          typename object_t::key_type>::value &&
+          std::is_same <
+          typename object_t::mapped_type,
+          typename ConstructibleObjectType::mapped_type >::value)) ||
+        (has_from_json<BasicJsonType,
+         typename ConstructibleObjectType::mapped_type>::value ||
+         has_non_default_from_json <
+         BasicJsonType,
+         typename ConstructibleObjectType::mapped_type >::value);
+};
+
+template<typename BasicJsonType, typename ConstructibleObjectType>
+struct is_constructible_object_type
+    : is_constructible_object_type_impl<BasicJsonType,
+      ConstructibleObjectType> {};
+
+template<typename BasicJsonType, typename CompatibleStringType>
+struct is_compatible_string_type
+{
+    static constexpr auto value =
+        is_constructible<typename BasicJsonType::string_t, CompatibleStringType>::value;
+};
+
+template<typename BasicJsonType, typename ConstructibleStringType>
+struct is_constructible_string_type
+{
+    // launder type through decltype() to fix compilation failure on ICPC
+#ifdef __INTEL_COMPILER
+    using laundered_type = decltype(std::declval<ConstructibleStringType>());
+#else
+    using laundered_type = ConstructibleStringType;
+#endif
+
+    static constexpr auto value =
+        conjunction <
+        is_constructible<laundered_type, typename BasicJsonType::string_t>,
+        is_detected_exact<typename BasicJsonType::string_t::value_type,
+        value_type_t, laundered_type >>::value;
+};
+
+template<typename BasicJsonType, typename CompatibleArrayType, typename = void>
+struct is_compatible_array_type_impl : std::false_type {};
+
+template<typename BasicJsonType, typename CompatibleArrayType>
+struct is_compatible_array_type_impl <
+    BasicJsonType, CompatibleArrayType,
+    enable_if_t <
+    is_detected<iterator_t, CompatibleArrayType>::value&&
+    is_iterator_traits<iterator_traits<detected_t<iterator_t, CompatibleArrayType>>>::value&&
+// special case for types like std::filesystem::path whose iterator's value_type are themselves
+// c.f. https://github.com/nlohmann/json/pull/3073
+    !std::is_same<CompatibleArrayType, detected_t<range_value_t, CompatibleArrayType>>::value >>
+{
+    static constexpr bool value =
+        is_constructible<BasicJsonType,
+        range_value_t<CompatibleArrayType>>::value;
+};
+
+template<typename BasicJsonType, typename CompatibleArrayType>
+struct is_compatible_array_type
+    : is_compatible_array_type_impl<BasicJsonType, CompatibleArrayType> {};
+
+template<typename BasicJsonType, typename ConstructibleArrayType, typename = void>
+struct is_constructible_array_type_impl : std::false_type {};
+
+template<typename BasicJsonType, typename ConstructibleArrayType>
+struct is_constructible_array_type_impl <
+    BasicJsonType, ConstructibleArrayType,
+    enable_if_t<std::is_same<ConstructibleArrayType,
+    typename BasicJsonType::value_type>::value >>
+            : std::true_type {};
+
+template<typename BasicJsonType, typename ConstructibleArrayType>
+struct is_constructible_array_type_impl <
+    BasicJsonType, ConstructibleArrayType,
+    enable_if_t < !std::is_same<ConstructibleArrayType,
+    typename BasicJsonType::value_type>::value&&
+    !is_compatible_string_type<BasicJsonType, ConstructibleArrayType>::value&&
+    is_default_constructible<ConstructibleArrayType>::value&&
+(std::is_move_assignable<ConstructibleArrayType>::value ||
+ std::is_copy_assignable<ConstructibleArrayType>::value)&&
+is_detected<iterator_t, ConstructibleArrayType>::value&&
+is_iterator_traits<iterator_traits<detected_t<iterator_t, ConstructibleArrayType>>>::value&&
+is_detected<range_value_t, ConstructibleArrayType>::value&&
+// special case for types like std::filesystem::path whose iterator's value_type are themselves
+// c.f. https://github.com/nlohmann/json/pull/3073
+!std::is_same<ConstructibleArrayType, detected_t<range_value_t, ConstructibleArrayType>>::value&&
+        is_complete_type <
+        detected_t<range_value_t, ConstructibleArrayType >>::value >>
+{
+    using value_type = range_value_t<ConstructibleArrayType>;
+
+    static constexpr bool value =
+        std::is_same<value_type,
+        typename BasicJsonType::array_t::value_type>::value ||
+        has_from_json<BasicJsonType,
+        value_type>::value ||
+        has_non_default_from_json <
+        BasicJsonType,
+        value_type >::value;
+};
+
+template<typename BasicJsonType, typename ConstructibleArrayType>
+struct is_constructible_array_type
+    : is_constructible_array_type_impl<BasicJsonType, ConstructibleArrayType> {};
+
+template<typename RealIntegerType, typename CompatibleNumberIntegerType,
+         typename = void>
+struct is_compatible_integer_type_impl : std::false_type {};
+
+template<typename RealIntegerType, typename CompatibleNumberIntegerType>
+struct is_compatible_integer_type_impl <
+    RealIntegerType, CompatibleNumberIntegerType,
+    enable_if_t < std::is_integral<RealIntegerType>::value&&
+    std::is_integral<CompatibleNumberIntegerType>::value&&
+    !std::is_same<bool, CompatibleNumberIntegerType>::value >>
+{
+    // is there an assert somewhere on overflows?
+    using RealLimits = std::numeric_limits<RealIntegerType>;
+    using CompatibleLimits = std::numeric_limits<CompatibleNumberIntegerType>;
+
+    static constexpr auto value =
+        is_constructible<RealIntegerType,
+        CompatibleNumberIntegerType>::value &&
+        CompatibleLimits::is_integer &&
+        RealLimits::is_signed == CompatibleLimits::is_signed;
+};
+
+template<typename RealIntegerType, typename CompatibleNumberIntegerType>
+struct is_compatible_integer_type
+    : is_compatible_integer_type_impl<RealIntegerType,
+      CompatibleNumberIntegerType> {};
+
+template<typename BasicJsonType, typename CompatibleType, typename = void>
+struct is_compatible_type_impl: std::false_type {};
+
+template<typename BasicJsonType, typename CompatibleType>
+struct is_compatible_type_impl <
+    BasicJsonType, CompatibleType,
+    enable_if_t<is_complete_type<CompatibleType>::value >>
+{
+    static constexpr bool value =
+        has_to_json<BasicJsonType, CompatibleType>::value;
+};
+
+template<typename BasicJsonType, typename CompatibleType>
+struct is_compatible_type
+    : is_compatible_type_impl<BasicJsonType, CompatibleType> {};
+
+template<typename T1, typename T2>
+struct is_constructible_tuple : std::false_type {};
+
+template<typename T1, typename... Args>
+struct is_constructible_tuple<T1, std::tuple<Args...>> : conjunction<is_constructible<T1, Args>...> {};
+
+template<typename BasicJsonType, typename T>
+struct is_json_iterator_of : std::false_type {};
+
+template<typename BasicJsonType>
+struct is_json_iterator_of<BasicJsonType, typename BasicJsonType::iterator> : std::true_type {};
+
+template<typename BasicJsonType>
+struct is_json_iterator_of<BasicJsonType, typename BasicJsonType::const_iterator> : std::true_type
+{};
+
+// checks if a given type T is a template specialization of Primary
+template<template <typename...> class Primary, typename T>
+struct is_specialization_of : std::false_type {};
+
+template<template <typename...> class Primary, typename... Args>
+struct is_specialization_of<Primary, Primary<Args...>> : std::true_type {};
+
+template<typename T>
+using is_json_pointer = is_specialization_of<::nlohmann::json_pointer, uncvref_t<T>>;
+
+// checks if A and B are comparable using Compare functor
+template<typename Compare, typename A, typename B, typename = void>
+struct is_comparable : std::false_type {};
+
+template<typename Compare, typename A, typename B>
+struct is_comparable<Compare, A, B, void_t<
+decltype(std::declval<Compare>()(std::declval<A>(), std::declval<B>())),
+decltype(std::declval<Compare>()(std::declval<B>(), std::declval<A>()))
+>> : std::true_type {};
+
+template<typename T>
+using detect_is_transparent = typename T::is_transparent;
+
+// type trait to check if KeyType can be used as object key (without a BasicJsonType)
+// see is_usable_as_basic_json_key_type below
+template<typename Comparator, typename ObjectKeyType, typename KeyTypeCVRef, bool RequireTransparentComparator = true,
+         bool ExcludeObjectKeyType = RequireTransparentComparator, typename KeyType = uncvref_t<KeyTypeCVRef>>
+using is_usable_as_key_type = typename std::conditional <
+                              is_comparable<Comparator, ObjectKeyType, KeyTypeCVRef>::value
+                              && !(ExcludeObjectKeyType && std::is_same<KeyType,
+                                   ObjectKeyType>::value)
+                              && (!RequireTransparentComparator
+                                  || is_detected <detect_is_transparent, Comparator>::value)
+                              && !is_json_pointer<KeyType>::value,
+                              std::true_type,
+                              std::false_type >::type;
+
+// type trait to check if KeyType can be used as object key
+// true if:
+//   - KeyType is comparable with BasicJsonType::object_t::key_type
+//   - if ExcludeObjectKeyType is true, KeyType is not BasicJsonType::object_t::key_type
+//   - the comparator is transparent or RequireTransparentComparator is false
+//   - KeyType is not a JSON iterator or json_pointer
+template<typename BasicJsonType, typename KeyTypeCVRef, bool RequireTransparentComparator = true,
+         bool ExcludeObjectKeyType = RequireTransparentComparator, typename KeyType = uncvref_t<KeyTypeCVRef>>
+using is_usable_as_basic_json_key_type = typename std::conditional <
+        is_usable_as_key_type<typename BasicJsonType::object_comparator_t,
+        typename BasicJsonType::object_t::key_type, KeyTypeCVRef,
+        RequireTransparentComparator, ExcludeObjectKeyType>::value
+        && !is_json_iterator_of<BasicJsonType, KeyType>::value,
+        std::true_type,
+        std::false_type >::type;
+
+template<typename ObjectType, typename KeyType>
+using detect_erase_with_key_type = decltype(std::declval<ObjectType&>().erase(std::declval<KeyType>()));
+
+// type trait to check if object_t has an erase() member functions accepting KeyType
+template<typename BasicJsonType, typename KeyType>
+using has_erase_with_key_type = typename std::conditional <
+                                is_detected <
+                                detect_erase_with_key_type,
+                                typename BasicJsonType::object_t, KeyType >::value,
+                                std::true_type,
+                                std::false_type >::type;
+
+// a naive helper to check if a type is an ordered_map (exploits the fact that
+// ordered_map inherits capacity() from std::vector)
+template <typename T>
+struct is_ordered_map
+{
+    using one = char;
+
+    struct two
+    {
+        char x[2]; // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+    };
+
+    template <typename C> static one test( decltype(&C::capacity) ) ;
+    template <typename C> static two test(...);
+
+    enum { value = sizeof(test<T>(nullptr)) == sizeof(char) }; // NOLINT(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+};
+
+// to avoid useless casts (see https://github.com/nlohmann/json/issues/2893#issuecomment-889152324)
+template < typename T, typename U, enable_if_t < !std::is_same<T, U>::value, int > = 0 >
+T conditional_static_cast(U value)
+{
+    return static_cast<T>(value);
+}
+
+template<typename T, typename U, enable_if_t<std::is_same<T, U>::value, int> = 0>
+T conditional_static_cast(U value)
+{
+    return value;
+}
+
+template<typename... Types>
+using all_integral = conjunction<std::is_integral<Types>...>;
+
+template<typename... Types>
+using all_signed = conjunction<std::is_signed<Types>...>;
+
+template<typename... Types>
+using all_unsigned = conjunction<std::is_unsigned<Types>...>;
+
+// there's a disjunction trait in another PR; replace when merged
+template<typename... Types>
+using same_sign = std::integral_constant < bool,
+      all_signed<Types...>::value || all_unsigned<Types...>::value >;
+
+template<typename OfType, typename T>
+using never_out_of_range = std::integral_constant < bool,
+      (std::is_signed<OfType>::value && (sizeof(T) < sizeof(OfType)))
+      || (same_sign<OfType, T>::value && sizeof(OfType) == sizeof(T)) >;
+
+template<typename OfType, typename T,
+         bool OfTypeSigned = std::is_signed<OfType>::value,
+         bool TSigned = std::is_signed<T>::value>
+struct value_in_range_of_impl2;
+
+template<typename OfType, typename T>
+struct value_in_range_of_impl2<OfType, T, false, false>
+{
+    static constexpr bool test(T val)
+    {
+        using CommonType = typename std::common_type<OfType, T>::type;
+        return static_cast<CommonType>(val) <= static_cast<CommonType>((std::numeric_limits<OfType>::max)());
+    }
+};
+
+template<typename OfType, typename T>
+struct value_in_range_of_impl2<OfType, T, true, false>
+{
+    static constexpr bool test(T val)
+    {
+        using CommonType = typename std::common_type<OfType, T>::type;
+        return static_cast<CommonType>(val) <= static_cast<CommonType>((std::numeric_limits<OfType>::max)());
+    }
+};
+
+template<typename OfType, typename T>
+struct value_in_range_of_impl2<OfType, T, false, true>
+{
+    static constexpr bool test(T val)
+    {
+        using CommonType = typename std::common_type<OfType, T>::type;
+        return val >= 0 && static_cast<CommonType>(val) <= static_cast<CommonType>((std::numeric_limits<OfType>::max)());
+    }
+};
+
+template<typename OfType, typename T>
+struct value_in_range_of_impl2<OfType, T, true, true>
+{
+    static constexpr bool test(T val)
+    {
+        using CommonType = typename std::common_type<OfType, T>::type;
+        return static_cast<CommonType>(val) >= static_cast<CommonType>((std::numeric_limits<OfType>::min)())
+               && static_cast<CommonType>(val) <= static_cast<CommonType>((std::numeric_limits<OfType>::max)());
+    }
+};
+
+template<typename OfType, typename T,
+         bool NeverOutOfRange = never_out_of_range<OfType, T>::value,
+         typename = detail::enable_if_t<all_integral<OfType, T>::value>>
+struct value_in_range_of_impl1;
+
+template<typename OfType, typename T>
+struct value_in_range_of_impl1<OfType, T, false>
+{
+    static constexpr bool test(T val)
+    {
+        return value_in_range_of_impl2<OfType, T>::test(val);
+    }
+};
+
+template<typename OfType, typename T>
+struct value_in_range_of_impl1<OfType, T, true>
+{
+    static constexpr bool test(T /*val*/)
+    {
+        return true;
+    }
+};
+
+template<typename OfType, typename T>
+inline constexpr bool value_in_range_of(T val)
+{
+    return value_in_range_of_impl1<OfType, T>::test(val);
+}
+
+template<bool Value>
+using bool_constant = std::integral_constant<bool, Value>;
+
+///////////////////////////////////////////////////////////////////////////////
+// is_c_string
+///////////////////////////////////////////////////////////////////////////////
+
+namespace impl
+{
+
+template<typename T>
+inline constexpr bool is_c_string()
+{
+    using TUnExt = typename std::remove_extent<T>::type;
+    using TUnCVExt = typename std::remove_cv<TUnExt>::type;
+    using TUnPtr = typename std::remove_pointer<T>::type;
+    using TUnCVPtr = typename std::remove_cv<TUnPtr>::type;
+    return
+        (std::is_array<T>::value && std::is_same<TUnCVExt, char>::value)
+        || (std::is_pointer<T>::value && std::is_same<TUnCVPtr, char>::value);
+}
+
+}  // namespace impl
+
+// checks whether T is a [cv] char */[cv] char[] C string
+template<typename T>
+struct is_c_string : bool_constant<impl::is_c_string<T>()> {};
+
+template<typename T>
+using is_c_string_uncvref = is_c_string<uncvref_t<T>>;
+
+///////////////////////////////////////////////////////////////////////////////
+// is_transparent
+///////////////////////////////////////////////////////////////////////////////
+
+namespace impl
+{
+
+template<typename T>
+inline constexpr bool is_transparent()
+{
+    return is_detected<detect_is_transparent, T>::value;
+}
+
+}  // namespace impl
+
+// checks whether T has a member named is_transparent
+template<typename T>
+struct is_transparent : bool_constant<impl::is_transparent<T>()> {};
+
+///////////////////////////////////////////////////////////////////////////////
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/string_concat.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstring> // strlen
+#include <string> // string
+#include <utility> // forward
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/detected.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+inline std::size_t concat_length()
+{
+    return 0;
+}
+
+template<typename... Args>
+inline std::size_t concat_length(const char* cstr, const Args& ... rest);
+
+template<typename StringType, typename... Args>
+inline std::size_t concat_length(const StringType& str, const Args& ... rest);
+
+template<typename... Args>
+inline std::size_t concat_length(const char /*c*/, const Args& ... rest)
+{
+    return 1 + concat_length(rest...);
+}
+
+template<typename... Args>
+inline std::size_t concat_length(const char* cstr, const Args& ... rest)
+{
+    // cppcheck-suppress ignoredReturnValue
+    return ::strlen(cstr) + concat_length(rest...);
+}
+
+template<typename StringType, typename... Args>
+inline std::size_t concat_length(const StringType& str, const Args& ... rest)
+{
+    return str.size() + concat_length(rest...);
+}
+
+template<typename OutStringType>
+inline void concat_into(OutStringType& /*out*/)
+{}
+
+template<typename StringType, typename Arg>
+using string_can_append = decltype(std::declval<StringType&>().append(std::declval < Arg && > ()));
+
+template<typename StringType, typename Arg>
+using detect_string_can_append = is_detected<string_can_append, StringType, Arg>;
+
+template<typename StringType, typename Arg>
+using string_can_append_op = decltype(std::declval<StringType&>() += std::declval < Arg && > ());
+
+template<typename StringType, typename Arg>
+using detect_string_can_append_op = is_detected<string_can_append_op, StringType, Arg>;
+
+template<typename StringType, typename Arg>
+using string_can_append_iter = decltype(std::declval<StringType&>().append(std::declval<const Arg&>().begin(), std::declval<const Arg&>().end()));
+
+template<typename StringType, typename Arg>
+using detect_string_can_append_iter = is_detected<string_can_append_iter, StringType, Arg>;
+
+template<typename StringType, typename Arg>
+using string_can_append_data = decltype(std::declval<StringType&>().append(std::declval<const Arg&>().data(), std::declval<const Arg&>().size()));
+
+template<typename StringType, typename Arg>
+using detect_string_can_append_data = is_detected<string_can_append_data, StringType, Arg>;
+
+template < typename OutStringType, typename Arg, typename... Args,
+           enable_if_t < !detect_string_can_append<OutStringType, Arg>::value
+                         && detect_string_can_append_op<OutStringType, Arg>::value, int > = 0 >
+inline void concat_into(OutStringType& out, Arg && arg, Args && ... rest);
+
+template < typename OutStringType, typename Arg, typename... Args,
+           enable_if_t < !detect_string_can_append<OutStringType, Arg>::value
+                         && !detect_string_can_append_op<OutStringType, Arg>::value
+                         && detect_string_can_append_iter<OutStringType, Arg>::value, int > = 0 >
+inline void concat_into(OutStringType& out, const Arg& arg, Args && ... rest);
+
+template < typename OutStringType, typename Arg, typename... Args,
+           enable_if_t < !detect_string_can_append<OutStringType, Arg>::value
+                         && !detect_string_can_append_op<OutStringType, Arg>::value
+                         && !detect_string_can_append_iter<OutStringType, Arg>::value
+                         && detect_string_can_append_data<OutStringType, Arg>::value, int > = 0 >
+inline void concat_into(OutStringType& out, const Arg& arg, Args && ... rest);
+
+template<typename OutStringType, typename Arg, typename... Args,
+         enable_if_t<detect_string_can_append<OutStringType, Arg>::value, int> = 0>
+inline void concat_into(OutStringType& out, Arg && arg, Args && ... rest)
+{
+    out.append(std::forward<Arg>(arg));
+    concat_into(out, std::forward<Args>(rest)...);
+}
+
+template < typename OutStringType, typename Arg, typename... Args,
+           enable_if_t < !detect_string_can_append<OutStringType, Arg>::value
+                         && detect_string_can_append_op<OutStringType, Arg>::value, int > >
+inline void concat_into(OutStringType& out, Arg&& arg, Args&& ... rest)
+{
+    out += std::forward<Arg>(arg);
+    concat_into(out, std::forward<Args>(rest)...);
+}
+
+template < typename OutStringType, typename Arg, typename... Args,
+           enable_if_t < !detect_string_can_append<OutStringType, Arg>::value
+                         && !detect_string_can_append_op<OutStringType, Arg>::value
+                         && detect_string_can_append_iter<OutStringType, Arg>::value, int > >
+inline void concat_into(OutStringType& out, const Arg& arg, Args&& ... rest)
+{
+    out.append(arg.begin(), arg.end());
+    concat_into(out, std::forward<Args>(rest)...);
+}
+
+template < typename OutStringType, typename Arg, typename... Args,
+           enable_if_t < !detect_string_can_append<OutStringType, Arg>::value
+                         && !detect_string_can_append_op<OutStringType, Arg>::value
+                         && !detect_string_can_append_iter<OutStringType, Arg>::value
+                         && detect_string_can_append_data<OutStringType, Arg>::value, int > >
+inline void concat_into(OutStringType& out, const Arg& arg, Args&& ... rest)
+{
+    out.append(arg.data(), arg.size());
+    concat_into(out, std::forward<Args>(rest)...);
+}
+
+template<typename OutStringType = std::string, typename... Args>
+inline OutStringType concat(Args && ... args)
+{
+    OutStringType str;
+    str.reserve(concat_length(args...));
+    concat_into(str, std::forward<Args>(args)...);
+    return str;
+}
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+////////////////
+// exceptions //
+////////////////
+
+/// @brief general exception of the @ref basic_json class
+/// @sa https://json.nlohmann.me/api/basic_json/exception/
+class exception : public std::exception
+{
+  public:
+    /// returns the explanatory string
+    const char* what() const noexcept override
+    {
+        return m.what();
+    }
+
+    /// the id of the exception
+    const int id; // NOLINT(cppcoreguidelines-non-private-member-variables-in-classes)
+
+  protected:
+    JSON_HEDLEY_NON_NULL(3)
+    exception(int id_, const char* what_arg) : id(id_), m(what_arg) {} // NOLINT(bugprone-throw-keyword-missing)
+
+    static std::string name(const std::string& ename, int id_)
+    {
+        return concat("[json.exception.", ename, '.', std::to_string(id_), "] ");
+    }
+
+    static std::string diagnostics(std::nullptr_t /*leaf_element*/)
+    {
+        return "";
+    }
+
+    template<typename BasicJsonType>
+    static std::string diagnostics(const BasicJsonType* leaf_element)
+    {
+#if JSON_DIAGNOSTICS
+        std::vector<std::string> tokens;
+        for (const auto* current = leaf_element; current != nullptr && current->m_parent != nullptr; current = current->m_parent)
+        {
+            switch (current->m_parent->type())
+            {
+                case value_t::array:
+                {
+                    for (std::size_t i = 0; i < current->m_parent->m_data.m_value.array->size(); ++i)
+                    {
+                        if (&current->m_parent->m_data.m_value.array->operator[](i) == current)
+                        {
+                            tokens.emplace_back(std::to_string(i));
+                            break;
+                        }
+                    }
+                    break;
+                }
+
+                case value_t::object:
+                {
+                    for (const auto& element : *current->m_parent->m_data.m_value.object)
+                    {
+                        if (&element.second == current)
+                        {
+                            tokens.emplace_back(element.first.c_str());
+                            break;
+                        }
+                    }
+                    break;
+                }
+
+                case value_t::null: // LCOV_EXCL_LINE
+                case value_t::string: // LCOV_EXCL_LINE
+                case value_t::boolean: // LCOV_EXCL_LINE
+                case value_t::number_integer: // LCOV_EXCL_LINE
+                case value_t::number_unsigned: // LCOV_EXCL_LINE
+                case value_t::number_float: // LCOV_EXCL_LINE
+                case value_t::binary: // LCOV_EXCL_LINE
+                case value_t::discarded: // LCOV_EXCL_LINE
+                default:   // LCOV_EXCL_LINE
+                    break; // LCOV_EXCL_LINE
+            }
+        }
+
+        if (tokens.empty())
+        {
+            return "";
+        }
+
+        auto str = std::accumulate(tokens.rbegin(), tokens.rend(), std::string{},
+                                   [](const std::string & a, const std::string & b)
+        {
+            return concat(a, '/', detail::escape(b));
+        });
+        return concat('(', str, ") ");
+#else
+        static_cast<void>(leaf_element);
+        return "";
+#endif
+    }
+
+  private:
+    /// an exception object as storage for error messages
+    std::runtime_error m;
+};
+
+/// @brief exception indicating a parse error
+/// @sa https://json.nlohmann.me/api/basic_json/parse_error/
+class parse_error : public exception
+{
+  public:
+    /*!
+    @brief create a parse error exception
+    @param[in] id_       the id of the exception
+    @param[in] pos       the position where the error occurred (or with
+                         chars_read_total=0 if the position cannot be
+                         determined)
+    @param[in] what_arg  the explanatory string
+    @return parse_error object
+    */
+    template<typename BasicJsonContext, enable_if_t<is_basic_json_context<BasicJsonContext>::value, int> = 0>
+    static parse_error create(int id_, const position_t& pos, const std::string& what_arg, BasicJsonContext context)
+    {
+        const std::string w = concat(exception::name("parse_error", id_), "parse error",
+                                     position_string(pos), ": ", exception::diagnostics(context), what_arg);
+        return {id_, pos.chars_read_total, w.c_str()};
+    }
+
+    template<typename BasicJsonContext, enable_if_t<is_basic_json_context<BasicJsonContext>::value, int> = 0>
+    static parse_error create(int id_, std::size_t byte_, const std::string& what_arg, BasicJsonContext context)
+    {
+        const std::string w = concat(exception::name("parse_error", id_), "parse error",
+                                     (byte_ != 0 ? (concat(" at byte ", std::to_string(byte_))) : ""),
+                                     ": ", exception::diagnostics(context), what_arg);
+        return {id_, byte_, w.c_str()};
+    }
+
+    /*!
+    @brief byte index of the parse error
+
+    The byte index of the last read character in the input file.
+
+    @note For an input with n bytes, 1 is the index of the first character and
+          n+1 is the index of the terminating null byte or the end of file.
+          This also holds true when reading a byte vector (CBOR or MessagePack).
+    */
+    const std::size_t byte;
+
+  private:
+    parse_error(int id_, std::size_t byte_, const char* what_arg)
+        : exception(id_, what_arg), byte(byte_) {}
+
+    static std::string position_string(const position_t& pos)
+    {
+        return concat(" at line ", std::to_string(pos.lines_read + 1),
+                      ", column ", std::to_string(pos.chars_read_current_line));
+    }
+};
+
+/// @brief exception indicating errors with iterators
+/// @sa https://json.nlohmann.me/api/basic_json/invalid_iterator/
+class invalid_iterator : public exception
+{
+  public:
+    template<typename BasicJsonContext, enable_if_t<is_basic_json_context<BasicJsonContext>::value, int> = 0>
+    static invalid_iterator create(int id_, const std::string& what_arg, BasicJsonContext context)
+    {
+        const std::string w = concat(exception::name("invalid_iterator", id_), exception::diagnostics(context), what_arg);
+        return {id_, w.c_str()};
+    }
+
+  private:
+    JSON_HEDLEY_NON_NULL(3)
+    invalid_iterator(int id_, const char* what_arg)
+        : exception(id_, what_arg) {}
+};
+
+/// @brief exception indicating executing a member function with a wrong type
+/// @sa https://json.nlohmann.me/api/basic_json/type_error/
+class type_error : public exception
+{
+  public:
+    template<typename BasicJsonContext, enable_if_t<is_basic_json_context<BasicJsonContext>::value, int> = 0>
+    static type_error create(int id_, const std::string& what_arg, BasicJsonContext context)
+    {
+        const std::string w = concat(exception::name("type_error", id_), exception::diagnostics(context), what_arg);
+        return {id_, w.c_str()};
+    }
+
+  private:
+    JSON_HEDLEY_NON_NULL(3)
+    type_error(int id_, const char* what_arg) : exception(id_, what_arg) {}
+};
+
+/// @brief exception indicating access out of the defined range
+/// @sa https://json.nlohmann.me/api/basic_json/out_of_range/
+class out_of_range : public exception
+{
+  public:
+    template<typename BasicJsonContext, enable_if_t<is_basic_json_context<BasicJsonContext>::value, int> = 0>
+    static out_of_range create(int id_, const std::string& what_arg, BasicJsonContext context)
+    {
+        const std::string w = concat(exception::name("out_of_range", id_), exception::diagnostics(context), what_arg);
+        return {id_, w.c_str()};
+    }
+
+  private:
+    JSON_HEDLEY_NON_NULL(3)
+    out_of_range(int id_, const char* what_arg) : exception(id_, what_arg) {}
+};
+
+/// @brief exception indicating other library errors
+/// @sa https://json.nlohmann.me/api/basic_json/other_error/
+class other_error : public exception
+{
+  public:
+    template<typename BasicJsonContext, enable_if_t<is_basic_json_context<BasicJsonContext>::value, int> = 0>
+    static other_error create(int id_, const std::string& what_arg, BasicJsonContext context)
+    {
+        const std::string w = concat(exception::name("other_error", id_), exception::diagnostics(context), what_arg);
+        return {id_, w.c_str()};
+    }
+
+  private:
+    JSON_HEDLEY_NON_NULL(3)
+    other_error(int id_, const char* what_arg) : exception(id_, what_arg) {}
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/identity_tag.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+// dispatching helper struct
+template <class T> struct identity_tag {};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/meta/std_fs.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+#if JSON_HAS_EXPERIMENTAL_FILESYSTEM
+#include <experimental/filesystem>
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+namespace std_fs = std::experimental::filesystem;
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+#elif JSON_HAS_FILESYSTEM
+#include <filesystem>
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+namespace std_fs = std::filesystem;
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+#endif
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename std::nullptr_t& n)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_null()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be null, but is ", j.type_name()), &j));
+    }
+    n = nullptr;
+}
+
+// overloads for basic_json template parameters
+template < typename BasicJsonType, typename ArithmeticType,
+           enable_if_t < std::is_arithmetic<ArithmeticType>::value&&
+                         !std::is_same<ArithmeticType, typename BasicJsonType::boolean_t>::value,
+                         int > = 0 >
+void get_arithmetic_value(const BasicJsonType& j, ArithmeticType& val)
+{
+    switch (static_cast<value_t>(j))
+    {
+        case value_t::number_unsigned:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_unsigned_t*>());
+            break;
+        }
+        case value_t::number_integer:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_integer_t*>());
+            break;
+        }
+        case value_t::number_float:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_float_t*>());
+            break;
+        }
+
+        case value_t::null:
+        case value_t::object:
+        case value_t::array:
+        case value_t::string:
+        case value_t::boolean:
+        case value_t::binary:
+        case value_t::discarded:
+        default:
+            JSON_THROW(type_error::create(302, concat("type must be number, but is ", j.type_name()), &j));
+    }
+}
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename BasicJsonType::boolean_t& b)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_boolean()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be boolean, but is ", j.type_name()), &j));
+    }
+    b = *j.template get_ptr<const typename BasicJsonType::boolean_t*>();
+}
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename BasicJsonType::string_t& s)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_string()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be string, but is ", j.type_name()), &j));
+    }
+    s = *j.template get_ptr<const typename BasicJsonType::string_t*>();
+}
+
+template <
+    typename BasicJsonType, typename StringType,
+    enable_if_t <
+        std::is_assignable<StringType&, const typename BasicJsonType::string_t>::value
+        && is_detected_exact<typename BasicJsonType::string_t::value_type, value_type_t, StringType>::value
+        && !std::is_same<typename BasicJsonType::string_t, StringType>::value
+        && !is_json_ref<StringType>::value, int > = 0 >
+inline void from_json(const BasicJsonType& j, StringType& s)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_string()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be string, but is ", j.type_name()), &j));
+    }
+
+    s = *j.template get_ptr<const typename BasicJsonType::string_t*>();
+}
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename BasicJsonType::number_float_t& val)
+{
+    get_arithmetic_value(j, val);
+}
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename BasicJsonType::number_unsigned_t& val)
+{
+    get_arithmetic_value(j, val);
+}
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename BasicJsonType::number_integer_t& val)
+{
+    get_arithmetic_value(j, val);
+}
+
+#if !JSON_DISABLE_ENUM_SERIALIZATION
+template<typename BasicJsonType, typename EnumType,
+         enable_if_t<std::is_enum<EnumType>::value, int> = 0>
+inline void from_json(const BasicJsonType& j, EnumType& e)
+{
+    typename std::underlying_type<EnumType>::type val;
+    get_arithmetic_value(j, val);
+    e = static_cast<EnumType>(val);
+}
+#endif  // JSON_DISABLE_ENUM_SERIALIZATION
+
+// forward_list doesn't have an insert method
+template<typename BasicJsonType, typename T, typename Allocator,
+         enable_if_t<is_getable<BasicJsonType, T>::value, int> = 0>
+inline void from_json(const BasicJsonType& j, std::forward_list<T, Allocator>& l)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+    l.clear();
+    std::transform(j.rbegin(), j.rend(),
+                   std::front_inserter(l), [](const BasicJsonType & i)
+    {
+        return i.template get<T>();
+    });
+}
+
+// valarray doesn't have an insert method
+template<typename BasicJsonType, typename T,
+         enable_if_t<is_getable<BasicJsonType, T>::value, int> = 0>
+inline void from_json(const BasicJsonType& j, std::valarray<T>& l)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+    l.resize(j.size());
+    std::transform(j.begin(), j.end(), std::begin(l),
+                   [](const BasicJsonType & elem)
+    {
+        return elem.template get<T>();
+    });
+}
+
+template<typename BasicJsonType, typename T, std::size_t N>
+auto from_json(const BasicJsonType& j, T (&arr)[N])  // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+-> decltype(j.template get<T>(), void())
+{
+    for (std::size_t i = 0; i < N; ++i)
+    {
+        arr[i] = j.at(i).template get<T>();
+    }
+}
+
+template<typename BasicJsonType>
+inline void from_json_array_impl(const BasicJsonType& j, typename BasicJsonType::array_t& arr, priority_tag<3> /*unused*/)
+{
+    arr = *j.template get_ptr<const typename BasicJsonType::array_t*>();
+}
+
+template<typename BasicJsonType, typename T, std::size_t N>
+auto from_json_array_impl(const BasicJsonType& j, std::array<T, N>& arr,
+                          priority_tag<2> /*unused*/)
+-> decltype(j.template get<T>(), void())
+{
+    for (std::size_t i = 0; i < N; ++i)
+    {
+        arr[i] = j.at(i).template get<T>();
+    }
+}
+
+template<typename BasicJsonType, typename ConstructibleArrayType,
+         enable_if_t<
+             std::is_assignable<ConstructibleArrayType&, ConstructibleArrayType>::value,
+             int> = 0>
+auto from_json_array_impl(const BasicJsonType& j, ConstructibleArrayType& arr, priority_tag<1> /*unused*/)
+-> decltype(
+    arr.reserve(std::declval<typename ConstructibleArrayType::size_type>()),
+    j.template get<typename ConstructibleArrayType::value_type>(),
+    void())
+{
+    using std::end;
+
+    ConstructibleArrayType ret;
+    ret.reserve(j.size());
+    std::transform(j.begin(), j.end(),
+                   std::inserter(ret, end(ret)), [](const BasicJsonType & i)
+    {
+        // get<BasicJsonType>() returns *this, this won't call a from_json
+        // method when value_type is BasicJsonType
+        return i.template get<typename ConstructibleArrayType::value_type>();
+    });
+    arr = std::move(ret);
+}
+
+template<typename BasicJsonType, typename ConstructibleArrayType,
+         enable_if_t<
+             std::is_assignable<ConstructibleArrayType&, ConstructibleArrayType>::value,
+             int> = 0>
+inline void from_json_array_impl(const BasicJsonType& j, ConstructibleArrayType& arr,
+                                 priority_tag<0> /*unused*/)
+{
+    using std::end;
+
+    ConstructibleArrayType ret;
+    std::transform(
+        j.begin(), j.end(), std::inserter(ret, end(ret)),
+        [](const BasicJsonType & i)
+    {
+        // get<BasicJsonType>() returns *this, this won't call a from_json
+        // method when value_type is BasicJsonType
+        return i.template get<typename ConstructibleArrayType::value_type>();
+    });
+    arr = std::move(ret);
+}
+
+template < typename BasicJsonType, typename ConstructibleArrayType,
+           enable_if_t <
+               is_constructible_array_type<BasicJsonType, ConstructibleArrayType>::value&&
+               !is_constructible_object_type<BasicJsonType, ConstructibleArrayType>::value&&
+               !is_constructible_string_type<BasicJsonType, ConstructibleArrayType>::value&&
+               !std::is_same<ConstructibleArrayType, typename BasicJsonType::binary_t>::value&&
+               !is_basic_json<ConstructibleArrayType>::value,
+               int > = 0 >
+auto from_json(const BasicJsonType& j, ConstructibleArrayType& arr)
+-> decltype(from_json_array_impl(j, arr, priority_tag<3> {}),
+j.template get<typename ConstructibleArrayType::value_type>(),
+void())
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+
+    from_json_array_impl(j, arr, priority_tag<3> {});
+}
+
+template < typename BasicJsonType, typename T, std::size_t... Idx >
+std::array<T, sizeof...(Idx)> from_json_inplace_array_impl(BasicJsonType&& j,
+        identity_tag<std::array<T, sizeof...(Idx)>> /*unused*/, index_sequence<Idx...> /*unused*/)
+{
+    return { { std::forward<BasicJsonType>(j).at(Idx).template get<T>()... } };
+}
+
+template < typename BasicJsonType, typename T, std::size_t N >
+auto from_json(BasicJsonType&& j, identity_tag<std::array<T, N>> tag)
+-> decltype(from_json_inplace_array_impl(std::forward<BasicJsonType>(j), tag, make_index_sequence<N> {}))
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+
+    return from_json_inplace_array_impl(std::forward<BasicJsonType>(j), tag, make_index_sequence<N> {});
+}
+
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, typename BasicJsonType::binary_t& bin)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_binary()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be binary, but is ", j.type_name()), &j));
+    }
+
+    bin = *j.template get_ptr<const typename BasicJsonType::binary_t*>();
+}
+
+template<typename BasicJsonType, typename ConstructibleObjectType,
+         enable_if_t<is_constructible_object_type<BasicJsonType, ConstructibleObjectType>::value, int> = 0>
+inline void from_json(const BasicJsonType& j, ConstructibleObjectType& obj)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_object()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be object, but is ", j.type_name()), &j));
+    }
+
+    ConstructibleObjectType ret;
+    const auto* inner_object = j.template get_ptr<const typename BasicJsonType::object_t*>();
+    using value_type = typename ConstructibleObjectType::value_type;
+    std::transform(
+        inner_object->begin(), inner_object->end(),
+        std::inserter(ret, ret.begin()),
+        [](typename BasicJsonType::object_t::value_type const & p)
+    {
+        return value_type(p.first, p.second.template get<typename ConstructibleObjectType::mapped_type>());
+    });
+    obj = std::move(ret);
+}
+
+// overload for arithmetic types, not chosen for basic_json template arguments
+// (BooleanType, etc..); note: Is it really necessary to provide explicit
+// overloads for boolean_t etc. in case of a custom BooleanType which is not
+// an arithmetic type?
+template < typename BasicJsonType, typename ArithmeticType,
+           enable_if_t <
+               std::is_arithmetic<ArithmeticType>::value&&
+               !std::is_same<ArithmeticType, typename BasicJsonType::number_unsigned_t>::value&&
+               !std::is_same<ArithmeticType, typename BasicJsonType::number_integer_t>::value&&
+               !std::is_same<ArithmeticType, typename BasicJsonType::number_float_t>::value&&
+               !std::is_same<ArithmeticType, typename BasicJsonType::boolean_t>::value,
+               int > = 0 >
+inline void from_json(const BasicJsonType& j, ArithmeticType& val)
+{
+    switch (static_cast<value_t>(j))
+    {
+        case value_t::number_unsigned:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_unsigned_t*>());
+            break;
+        }
+        case value_t::number_integer:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_integer_t*>());
+            break;
+        }
+        case value_t::number_float:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_float_t*>());
+            break;
+        }
+        case value_t::boolean:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::boolean_t*>());
+            break;
+        }
+
+        case value_t::null:
+        case value_t::object:
+        case value_t::array:
+        case value_t::string:
+        case value_t::binary:
+        case value_t::discarded:
+        default:
+            JSON_THROW(type_error::create(302, concat("type must be number, but is ", j.type_name()), &j));
+    }
+}
+
+template<typename BasicJsonType, typename... Args, std::size_t... Idx>
+std::tuple<Args...> from_json_tuple_impl_base(BasicJsonType&& j, index_sequence<Idx...> /*unused*/)
+{
+    return std::make_tuple(std::forward<BasicJsonType>(j).at(Idx).template get<Args>()...);
+}
+
+template < typename BasicJsonType, class A1, class A2 >
+std::pair<A1, A2> from_json_tuple_impl(BasicJsonType&& j, identity_tag<std::pair<A1, A2>> /*unused*/, priority_tag<0> /*unused*/)
+{
+    return {std::forward<BasicJsonType>(j).at(0).template get<A1>(),
+            std::forward<BasicJsonType>(j).at(1).template get<A2>()};
+}
+
+template<typename BasicJsonType, typename A1, typename A2>
+inline void from_json_tuple_impl(BasicJsonType&& j, std::pair<A1, A2>& p, priority_tag<1> /*unused*/)
+{
+    p = from_json_tuple_impl(std::forward<BasicJsonType>(j), identity_tag<std::pair<A1, A2>> {}, priority_tag<0> {});
+}
+
+template<typename BasicJsonType, typename... Args>
+std::tuple<Args...> from_json_tuple_impl(BasicJsonType&& j, identity_tag<std::tuple<Args...>> /*unused*/, priority_tag<2> /*unused*/)
+{
+    return from_json_tuple_impl_base<BasicJsonType, Args...>(std::forward<BasicJsonType>(j), index_sequence_for<Args...> {});
+}
+
+template<typename BasicJsonType, typename... Args>
+inline void from_json_tuple_impl(BasicJsonType&& j, std::tuple<Args...>& t, priority_tag<3> /*unused*/)
+{
+    t = from_json_tuple_impl_base<BasicJsonType, Args...>(std::forward<BasicJsonType>(j), index_sequence_for<Args...> {});
+}
+
+template<typename BasicJsonType, typename TupleRelated>
+auto from_json(BasicJsonType&& j, TupleRelated&& t)
+-> decltype(from_json_tuple_impl(std::forward<BasicJsonType>(j), std::forward<TupleRelated>(t), priority_tag<3> {}))
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+
+    return from_json_tuple_impl(std::forward<BasicJsonType>(j), std::forward<TupleRelated>(t), priority_tag<3> {});
+}
+
+template < typename BasicJsonType, typename Key, typename Value, typename Compare, typename Allocator,
+           typename = enable_if_t < !std::is_constructible <
+                                        typename BasicJsonType::string_t, Key >::value >>
+inline void from_json(const BasicJsonType& j, std::map<Key, Value, Compare, Allocator>& m)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+    m.clear();
+    for (const auto& p : j)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!p.is_array()))
+        {
+            JSON_THROW(type_error::create(302, concat("type must be array, but is ", p.type_name()), &j));
+        }
+        m.emplace(p.at(0).template get<Key>(), p.at(1).template get<Value>());
+    }
+}
+
+template < typename BasicJsonType, typename Key, typename Value, typename Hash, typename KeyEqual, typename Allocator,
+           typename = enable_if_t < !std::is_constructible <
+                                        typename BasicJsonType::string_t, Key >::value >>
+inline void from_json(const BasicJsonType& j, std::unordered_map<Key, Value, Hash, KeyEqual, Allocator>& m)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be array, but is ", j.type_name()), &j));
+    }
+    m.clear();
+    for (const auto& p : j)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!p.is_array()))
+        {
+            JSON_THROW(type_error::create(302, concat("type must be array, but is ", p.type_name()), &j));
+        }
+        m.emplace(p.at(0).template get<Key>(), p.at(1).template get<Value>());
+    }
+}
+
+#if JSON_HAS_FILESYSTEM || JSON_HAS_EXPERIMENTAL_FILESYSTEM
+template<typename BasicJsonType>
+inline void from_json(const BasicJsonType& j, std_fs::path& p)
+{
+    if (JSON_HEDLEY_UNLIKELY(!j.is_string()))
+    {
+        JSON_THROW(type_error::create(302, concat("type must be string, but is ", j.type_name()), &j));
+    }
+    p = *j.template get_ptr<const typename BasicJsonType::string_t*>();
+}
+#endif
+
+struct from_json_fn
+{
+    template<typename BasicJsonType, typename T>
+    auto operator()(const BasicJsonType& j, T&& val) const
+    noexcept(noexcept(from_json(j, std::forward<T>(val))))
+    -> decltype(from_json(j, std::forward<T>(val)))
+    {
+        return from_json(j, std::forward<T>(val));
+    }
+};
+
+}  // namespace detail
+
+#ifndef JSON_HAS_CPP_17
+/// namespace to hold default `from_json` function
+/// to see why this is required:
+/// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4381.html
+namespace // NOLINT(cert-dcl59-cpp,fuchsia-header-anon-namespaces,google-build-namespaces)
+{
+#endif
+JSON_INLINE_VARIABLE constexpr const auto& from_json = // NOLINT(misc-definitions-in-headers)
+    detail::static_const<detail::from_json_fn>::value;
+#ifndef JSON_HAS_CPP_17
+}  // namespace
+#endif
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/conversions/to_json.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // copy
+#include <iterator> // begin, end
+#include <string> // string
+#include <tuple> // tuple, get
+#include <type_traits> // is_same, is_constructible, is_floating_point, is_enum, underlying_type
+#include <utility> // move, forward, declval, pair
+#include <valarray> // valarray
+#include <vector> // vector
+
+// #include <nlohmann/detail/iterators/iteration_proxy.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstddef> // size_t
+#include <iterator> // input_iterator_tag
+#include <string> // string, to_string
+#include <tuple> // tuple_size, get, tuple_element
+#include <utility> // move
+
+#if JSON_HAS_RANGES
+    #include <ranges> // enable_borrowed_range
+#endif
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename string_type>
+void int_to_string( string_type& target, std::size_t value )
+{
+    // For ADL
+    using std::to_string;
+    target = to_string(value);
+}
+template<typename IteratorType> class iteration_proxy_value
+{
+  public:
+    using difference_type = std::ptrdiff_t;
+    using value_type = iteration_proxy_value;
+    using pointer = value_type *;
+    using reference = value_type &;
+    using iterator_category = std::input_iterator_tag;
+    using string_type = typename std::remove_cv< typename std::remove_reference<decltype( std::declval<IteratorType>().key() ) >::type >::type;
+
+  private:
+    /// the iterator
+    IteratorType anchor{};
+    /// an index for arrays (used to create key names)
+    std::size_t array_index = 0;
+    /// last stringified array index
+    mutable std::size_t array_index_last = 0;
+    /// a string representation of the array index
+    mutable string_type array_index_str = "0";
+    /// an empty string (to return a reference for primitive values)
+    string_type empty_str{};
+
+  public:
+    explicit iteration_proxy_value() = default;
+    explicit iteration_proxy_value(IteratorType it, std::size_t array_index_ = 0)
+    noexcept(std::is_nothrow_move_constructible<IteratorType>::value
+             && std::is_nothrow_default_constructible<string_type>::value)
+        : anchor(std::move(it))
+        , array_index(array_index_)
+    {}
+
+    iteration_proxy_value(iteration_proxy_value const&) = default;
+    iteration_proxy_value& operator=(iteration_proxy_value const&) = default;
+    // older GCCs are a bit fussy and require explicit noexcept specifiers on defaulted functions
+    iteration_proxy_value(iteration_proxy_value&&)
+    noexcept(std::is_nothrow_move_constructible<IteratorType>::value
+             && std::is_nothrow_move_constructible<string_type>::value) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor,cppcoreguidelines-noexcept-move-operations)
+    iteration_proxy_value& operator=(iteration_proxy_value&&)
+    noexcept(std::is_nothrow_move_assignable<IteratorType>::value
+             && std::is_nothrow_move_assignable<string_type>::value) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor,cppcoreguidelines-noexcept-move-operations)
+    ~iteration_proxy_value() = default;
+
+    /// dereference operator (needed for range-based for)
+    const iteration_proxy_value& operator*() const
+    {
+        return *this;
+    }
+
+    /// increment operator (needed for range-based for)
+    iteration_proxy_value& operator++()
+    {
+        ++anchor;
+        ++array_index;
+
+        return *this;
+    }
+
+    iteration_proxy_value operator++(int)& // NOLINT(cert-dcl21-cpp)
+    {
+        auto tmp = iteration_proxy_value(anchor, array_index);
+        ++anchor;
+        ++array_index;
+        return tmp;
+    }
+
+    /// equality operator (needed for InputIterator)
+    bool operator==(const iteration_proxy_value& o) const
+    {
+        return anchor == o.anchor;
+    }
+
+    /// inequality operator (needed for range-based for)
+    bool operator!=(const iteration_proxy_value& o) const
+    {
+        return anchor != o.anchor;
+    }
+
+    /// return key of the iterator
+    const string_type& key() const
+    {
+        JSON_ASSERT(anchor.m_object != nullptr);
+
+        switch (anchor.m_object->type())
+        {
+            // use integer array index as key
+            case value_t::array:
+            {
+                if (array_index != array_index_last)
+                {
+                    int_to_string( array_index_str, array_index );
+                    array_index_last = array_index;
+                }
+                return array_index_str;
+            }
+
+            // use key from the object
+            case value_t::object:
+                return anchor.key();
+
+            // use an empty key for all primitive types
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+                return empty_str;
+        }
+    }
+
+    /// return value of the iterator
+    typename IteratorType::reference value() const
+    {
+        return anchor.value();
+    }
+};
+
+/// proxy class for the items() function
+template<typename IteratorType> class iteration_proxy
+{
+  private:
+    /// the container to iterate
+    typename IteratorType::pointer container = nullptr;
+
+  public:
+    explicit iteration_proxy() = default;
+
+    /// construct iteration proxy from a container
+    explicit iteration_proxy(typename IteratorType::reference cont) noexcept
+        : container(&cont) {}
+
+    iteration_proxy(iteration_proxy const&) = default;
+    iteration_proxy& operator=(iteration_proxy const&) = default;
+    iteration_proxy(iteration_proxy&&) noexcept = default;
+    iteration_proxy& operator=(iteration_proxy&&) noexcept = default;
+    ~iteration_proxy() = default;
+
+    /// return iterator begin (needed for range-based for)
+    iteration_proxy_value<IteratorType> begin() const noexcept
+    {
+        return iteration_proxy_value<IteratorType>(container->begin());
+    }
+
+    /// return iterator end (needed for range-based for)
+    iteration_proxy_value<IteratorType> end() const noexcept
+    {
+        return iteration_proxy_value<IteratorType>(container->end());
+    }
+};
+
+// Structured Bindings Support
+// For further reference see https://blog.tartanllama.xyz/structured-bindings/
+// And see https://github.com/nlohmann/json/pull/1391
+template<std::size_t N, typename IteratorType, enable_if_t<N == 0, int> = 0>
+auto get(const nlohmann::detail::iteration_proxy_value<IteratorType>& i) -> decltype(i.key())
+{
+    return i.key();
+}
+// Structured Bindings Support
+// For further reference see https://blog.tartanllama.xyz/structured-bindings/
+// And see https://github.com/nlohmann/json/pull/1391
+template<std::size_t N, typename IteratorType, enable_if_t<N == 1, int> = 0>
+auto get(const nlohmann::detail::iteration_proxy_value<IteratorType>& i) -> decltype(i.value())
+{
+    return i.value();
+}
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// The Addition to the STD Namespace is required to add
+// Structured Bindings Support to the iteration_proxy_value class
+// For further reference see https://blog.tartanllama.xyz/structured-bindings/
+// And see https://github.com/nlohmann/json/pull/1391
+namespace std
+{
+
+#if defined(__clang__)
+    // Fix: https://github.com/nlohmann/json/issues/1401
+    #pragma clang diagnostic push
+    #pragma clang diagnostic ignored "-Wmismatched-tags"
+#endif
+template<typename IteratorType>
+class tuple_size<::nlohmann::detail::iteration_proxy_value<IteratorType>> // NOLINT(cert-dcl58-cpp)
+            : public std::integral_constant<std::size_t, 2> {};
+
+template<std::size_t N, typename IteratorType>
+class tuple_element<N, ::nlohmann::detail::iteration_proxy_value<IteratorType >> // NOLINT(cert-dcl58-cpp)
+{
+  public:
+    using type = decltype(
+                     get<N>(std::declval <
+                            ::nlohmann::detail::iteration_proxy_value<IteratorType >> ()));
+};
+#if defined(__clang__)
+    #pragma clang diagnostic pop
+#endif
+
+}  // namespace std
+
+#if JSON_HAS_RANGES
+    template <typename IteratorType>
+    inline constexpr bool ::std::ranges::enable_borrowed_range<::nlohmann::detail::iteration_proxy<IteratorType>> = true;
+#endif
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/std_fs.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+//////////////////
+// constructors //
+//////////////////
+
+/*
+ * Note all external_constructor<>::construct functions need to call
+ * j.m_data.m_value.destroy(j.m_data.m_type) to avoid a memory leak in case j contains an
+ * allocated value (e.g., a string). See bug issue
+ * https://github.com/nlohmann/json/issues/2865 for more information.
+ */
+
+template<value_t> struct external_constructor;
+
+template<>
+struct external_constructor<value_t::boolean>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::boolean_t b) noexcept
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::boolean;
+        j.m_data.m_value = b;
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::string>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const typename BasicJsonType::string_t& s)
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::string;
+        j.m_data.m_value = s;
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::string_t&& s)
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::string;
+        j.m_data.m_value = std::move(s);
+        j.assert_invariant();
+    }
+
+    template < typename BasicJsonType, typename CompatibleStringType,
+               enable_if_t < !std::is_same<CompatibleStringType, typename BasicJsonType::string_t>::value,
+                             int > = 0 >
+    static void construct(BasicJsonType& j, const CompatibleStringType& str)
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::string;
+        j.m_data.m_value.string = j.template create<typename BasicJsonType::string_t>(str);
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::binary>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const typename BasicJsonType::binary_t& b)
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::binary;
+        j.m_data.m_value = typename BasicJsonType::binary_t(b);
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::binary_t&& b)
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::binary;
+        j.m_data.m_value = typename BasicJsonType::binary_t(std::move(b));
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::number_float>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::number_float_t val) noexcept
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::number_float;
+        j.m_data.m_value = val;
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::number_unsigned>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::number_unsigned_t val) noexcept
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::number_unsigned;
+        j.m_data.m_value = val;
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::number_integer>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::number_integer_t val) noexcept
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::number_integer;
+        j.m_data.m_value = val;
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::array>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const typename BasicJsonType::array_t& arr)
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::array;
+        j.m_data.m_value = arr;
+        j.set_parents();
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::array_t&& arr)
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::array;
+        j.m_data.m_value = std::move(arr);
+        j.set_parents();
+        j.assert_invariant();
+    }
+
+    template < typename BasicJsonType, typename CompatibleArrayType,
+               enable_if_t < !std::is_same<CompatibleArrayType, typename BasicJsonType::array_t>::value,
+                             int > = 0 >
+    static void construct(BasicJsonType& j, const CompatibleArrayType& arr)
+    {
+        using std::begin;
+        using std::end;
+
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::array;
+        j.m_data.m_value.array = j.template create<typename BasicJsonType::array_t>(begin(arr), end(arr));
+        j.set_parents();
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const std::vector<bool>& arr)
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::array;
+        j.m_data.m_value = value_t::array;
+        j.m_data.m_value.array->reserve(arr.size());
+        for (const bool x : arr)
+        {
+            j.m_data.m_value.array->push_back(x);
+            j.set_parent(j.m_data.m_value.array->back());
+        }
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType, typename T,
+             enable_if_t<std::is_convertible<T, BasicJsonType>::value, int> = 0>
+    static void construct(BasicJsonType& j, const std::valarray<T>& arr)
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::array;
+        j.m_data.m_value = value_t::array;
+        j.m_data.m_value.array->resize(arr.size());
+        if (arr.size() > 0)
+        {
+            std::copy(std::begin(arr), std::end(arr), j.m_data.m_value.array->begin());
+        }
+        j.set_parents();
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::object>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const typename BasicJsonType::object_t& obj)
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::object;
+        j.m_data.m_value = obj;
+        j.set_parents();
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::object_t&& obj)
+    {
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::object;
+        j.m_data.m_value = std::move(obj);
+        j.set_parents();
+        j.assert_invariant();
+    }
+
+    template < typename BasicJsonType, typename CompatibleObjectType,
+               enable_if_t < !std::is_same<CompatibleObjectType, typename BasicJsonType::object_t>::value, int > = 0 >
+    static void construct(BasicJsonType& j, const CompatibleObjectType& obj)
+    {
+        using std::begin;
+        using std::end;
+
+        j.m_data.m_value.destroy(j.m_data.m_type);
+        j.m_data.m_type = value_t::object;
+        j.m_data.m_value.object = j.template create<typename BasicJsonType::object_t>(begin(obj), end(obj));
+        j.set_parents();
+        j.assert_invariant();
+    }
+};
+
+/////////////
+// to_json //
+/////////////
+
+template<typename BasicJsonType, typename T,
+         enable_if_t<std::is_same<T, typename BasicJsonType::boolean_t>::value, int> = 0>
+inline void to_json(BasicJsonType& j, T b) noexcept
+{
+    external_constructor<value_t::boolean>::construct(j, b);
+}
+
+template < typename BasicJsonType, typename BoolRef,
+           enable_if_t <
+               ((std::is_same<std::vector<bool>::reference, BoolRef>::value
+                 && !std::is_same <std::vector<bool>::reference, typename BasicJsonType::boolean_t&>::value)
+                || (std::is_same<std::vector<bool>::const_reference, BoolRef>::value
+                    && !std::is_same <detail::uncvref_t<std::vector<bool>::const_reference>,
+                                      typename BasicJsonType::boolean_t >::value))
+               && std::is_convertible<const BoolRef&, typename BasicJsonType::boolean_t>::value, int > = 0 >
+inline void to_json(BasicJsonType& j, const BoolRef& b) noexcept
+{
+    external_constructor<value_t::boolean>::construct(j, static_cast<typename BasicJsonType::boolean_t>(b));
+}
+
+template<typename BasicJsonType, typename CompatibleString,
+         enable_if_t<std::is_constructible<typename BasicJsonType::string_t, CompatibleString>::value, int> = 0>
+inline void to_json(BasicJsonType& j, const CompatibleString& s)
+{
+    external_constructor<value_t::string>::construct(j, s);
+}
+
+template<typename BasicJsonType>
+inline void to_json(BasicJsonType& j, typename BasicJsonType::string_t&& s)
+{
+    external_constructor<value_t::string>::construct(j, std::move(s));
+}
+
+template<typename BasicJsonType, typename FloatType,
+         enable_if_t<std::is_floating_point<FloatType>::value, int> = 0>
+inline void to_json(BasicJsonType& j, FloatType val) noexcept
+{
+    external_constructor<value_t::number_float>::construct(j, static_cast<typename BasicJsonType::number_float_t>(val));
+}
+
+template<typename BasicJsonType, typename CompatibleNumberUnsignedType,
+         enable_if_t<is_compatible_integer_type<typename BasicJsonType::number_unsigned_t, CompatibleNumberUnsignedType>::value, int> = 0>
+inline void to_json(BasicJsonType& j, CompatibleNumberUnsignedType val) noexcept
+{
+    external_constructor<value_t::number_unsigned>::construct(j, static_cast<typename BasicJsonType::number_unsigned_t>(val));
+}
+
+template<typename BasicJsonType, typename CompatibleNumberIntegerType,
+         enable_if_t<is_compatible_integer_type<typename BasicJsonType::number_integer_t, CompatibleNumberIntegerType>::value, int> = 0>
+inline void to_json(BasicJsonType& j, CompatibleNumberIntegerType val) noexcept
+{
+    external_constructor<value_t::number_integer>::construct(j, static_cast<typename BasicJsonType::number_integer_t>(val));
+}
+
+#if !JSON_DISABLE_ENUM_SERIALIZATION
+template<typename BasicJsonType, typename EnumType,
+         enable_if_t<std::is_enum<EnumType>::value, int> = 0>
+inline void to_json(BasicJsonType& j, EnumType e) noexcept
+{
+    using underlying_type = typename std::underlying_type<EnumType>::type;
+    external_constructor<value_t::number_integer>::construct(j, static_cast<underlying_type>(e));
+}
+#endif  // JSON_DISABLE_ENUM_SERIALIZATION
+
+template<typename BasicJsonType>
+inline void to_json(BasicJsonType& j, const std::vector<bool>& e)
+{
+    external_constructor<value_t::array>::construct(j, e);
+}
+
+template < typename BasicJsonType, typename CompatibleArrayType,
+           enable_if_t < is_compatible_array_type<BasicJsonType,
+                         CompatibleArrayType>::value&&
+                         !is_compatible_object_type<BasicJsonType, CompatibleArrayType>::value&&
+                         !is_compatible_string_type<BasicJsonType, CompatibleArrayType>::value&&
+                         !std::is_same<typename BasicJsonType::binary_t, CompatibleArrayType>::value&&
+                         !is_basic_json<CompatibleArrayType>::value,
+                         int > = 0 >
+inline void to_json(BasicJsonType& j, const CompatibleArrayType& arr)
+{
+    external_constructor<value_t::array>::construct(j, arr);
+}
+
+template<typename BasicJsonType>
+inline void to_json(BasicJsonType& j, const typename BasicJsonType::binary_t& bin)
+{
+    external_constructor<value_t::binary>::construct(j, bin);
+}
+
+template<typename BasicJsonType, typename T,
+         enable_if_t<std::is_convertible<T, BasicJsonType>::value, int> = 0>
+inline void to_json(BasicJsonType& j, const std::valarray<T>& arr)
+{
+    external_constructor<value_t::array>::construct(j, std::move(arr));
+}
+
+template<typename BasicJsonType>
+inline void to_json(BasicJsonType& j, typename BasicJsonType::array_t&& arr)
+{
+    external_constructor<value_t::array>::construct(j, std::move(arr));
+}
+
+template < typename BasicJsonType, typename CompatibleObjectType,
+           enable_if_t < is_compatible_object_type<BasicJsonType, CompatibleObjectType>::value&& !is_basic_json<CompatibleObjectType>::value, int > = 0 >
+inline void to_json(BasicJsonType& j, const CompatibleObjectType& obj)
+{
+    external_constructor<value_t::object>::construct(j, obj);
+}
+
+template<typename BasicJsonType>
+inline void to_json(BasicJsonType& j, typename BasicJsonType::object_t&& obj)
+{
+    external_constructor<value_t::object>::construct(j, std::move(obj));
+}
+
+template <
+    typename BasicJsonType, typename T, std::size_t N,
+    enable_if_t < !std::is_constructible<typename BasicJsonType::string_t,
+                  const T(&)[N]>::value, // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+                  int > = 0 >
+inline void to_json(BasicJsonType& j, const T(&arr)[N]) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+{
+    external_constructor<value_t::array>::construct(j, arr);
+}
+
+template < typename BasicJsonType, typename T1, typename T2, enable_if_t < std::is_constructible<BasicJsonType, T1>::value&& std::is_constructible<BasicJsonType, T2>::value, int > = 0 >
+inline void to_json(BasicJsonType& j, const std::pair<T1, T2>& p)
+{
+    j = { p.first, p.second };
+}
+
+// for https://github.com/nlohmann/json/pull/1134
+template<typename BasicJsonType, typename T,
+         enable_if_t<std::is_same<T, iteration_proxy_value<typename BasicJsonType::iterator>>::value, int> = 0>
+inline void to_json(BasicJsonType& j, const T& b)
+{
+    j = { {b.key(), b.value()} };
+}
+
+template<typename BasicJsonType, typename Tuple, std::size_t... Idx>
+inline void to_json_tuple_impl(BasicJsonType& j, const Tuple& t, index_sequence<Idx...> /*unused*/)
+{
+    j = { std::get<Idx>(t)... };
+}
+
+template<typename BasicJsonType, typename T, enable_if_t<is_constructible_tuple<BasicJsonType, T>::value, int > = 0>
+inline void to_json(BasicJsonType& j, const T& t)
+{
+    to_json_tuple_impl(j, t, make_index_sequence<std::tuple_size<T>::value> {});
+}
+
+#if JSON_HAS_FILESYSTEM || JSON_HAS_EXPERIMENTAL_FILESYSTEM
+template<typename BasicJsonType>
+inline void to_json(BasicJsonType& j, const std_fs::path& p)
+{
+    j = p.string();
+}
+#endif
+
+struct to_json_fn
+{
+    template<typename BasicJsonType, typename T>
+    auto operator()(BasicJsonType& j, T&& val) const noexcept(noexcept(to_json(j, std::forward<T>(val))))
+    -> decltype(to_json(j, std::forward<T>(val)), void())
+    {
+        return to_json(j, std::forward<T>(val));
+    }
+};
+}  // namespace detail
+
+#ifndef JSON_HAS_CPP_17
+/// namespace to hold default `to_json` function
+/// to see why this is required:
+/// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4381.html
+namespace // NOLINT(cert-dcl59-cpp,fuchsia-header-anon-namespaces,google-build-namespaces)
+{
+#endif
+JSON_INLINE_VARIABLE constexpr const auto& to_json = // NOLINT(misc-definitions-in-headers)
+    detail::static_const<detail::to_json_fn>::value;
+#ifndef JSON_HAS_CPP_17
+}  // namespace
+#endif
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/meta/identity_tag.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/// @sa https://json.nlohmann.me/api/adl_serializer/
+template<typename ValueType, typename>
+struct adl_serializer
+{
+    /// @brief convert a JSON value to any value type
+    /// @sa https://json.nlohmann.me/api/adl_serializer/from_json/
+    template<typename BasicJsonType, typename TargetType = ValueType>
+    static auto from_json(BasicJsonType && j, TargetType& val) noexcept(
+        noexcept(::nlohmann::from_json(std::forward<BasicJsonType>(j), val)))
+    -> decltype(::nlohmann::from_json(std::forward<BasicJsonType>(j), val), void())
+    {
+        ::nlohmann::from_json(std::forward<BasicJsonType>(j), val);
+    }
+
+    /// @brief convert a JSON value to any value type
+    /// @sa https://json.nlohmann.me/api/adl_serializer/from_json/
+    template<typename BasicJsonType, typename TargetType = ValueType>
+    static auto from_json(BasicJsonType && j) noexcept(
+    noexcept(::nlohmann::from_json(std::forward<BasicJsonType>(j), detail::identity_tag<TargetType> {})))
+    -> decltype(::nlohmann::from_json(std::forward<BasicJsonType>(j), detail::identity_tag<TargetType> {}))
+    {
+        return ::nlohmann::from_json(std::forward<BasicJsonType>(j), detail::identity_tag<TargetType> {});
+    }
+
+    /// @brief convert any value type to a JSON value
+    /// @sa https://json.nlohmann.me/api/adl_serializer/to_json/
+    template<typename BasicJsonType, typename TargetType = ValueType>
+    static auto to_json(BasicJsonType& j, TargetType && val) noexcept(
+        noexcept(::nlohmann::to_json(j, std::forward<TargetType>(val))))
+    -> decltype(::nlohmann::to_json(j, std::forward<TargetType>(val)), void())
+    {
+        ::nlohmann::to_json(j, std::forward<TargetType>(val));
+    }
+};
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/byte_container_with_subtype.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstdint> // uint8_t, uint64_t
+#include <tuple> // tie
+#include <utility> // move
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/// @brief an internal type for a backed binary type
+/// @sa https://json.nlohmann.me/api/byte_container_with_subtype/
+template<typename BinaryType>
+class byte_container_with_subtype : public BinaryType
+{
+  public:
+    using container_type = BinaryType;
+    using subtype_type = std::uint64_t;
+
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/byte_container_with_subtype/
+    byte_container_with_subtype() noexcept(noexcept(container_type()))
+        : container_type()
+    {}
+
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/byte_container_with_subtype/
+    byte_container_with_subtype(const container_type& b) noexcept(noexcept(container_type(b)))
+        : container_type(b)
+    {}
+
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/byte_container_with_subtype/
+    byte_container_with_subtype(container_type&& b) noexcept(noexcept(container_type(std::move(b))))
+        : container_type(std::move(b))
+    {}
+
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/byte_container_with_subtype/
+    byte_container_with_subtype(const container_type& b, subtype_type subtype_) noexcept(noexcept(container_type(b)))
+        : container_type(b)
+        , m_subtype(subtype_)
+        , m_has_subtype(true)
+    {}
+
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/byte_container_with_subtype/
+    byte_container_with_subtype(container_type&& b, subtype_type subtype_) noexcept(noexcept(container_type(std::move(b))))
+        : container_type(std::move(b))
+        , m_subtype(subtype_)
+        , m_has_subtype(true)
+    {}
+
+    bool operator==(const byte_container_with_subtype& rhs) const
+    {
+        return std::tie(static_cast<const BinaryType&>(*this), m_subtype, m_has_subtype) ==
+               std::tie(static_cast<const BinaryType&>(rhs), rhs.m_subtype, rhs.m_has_subtype);
+    }
+
+    bool operator!=(const byte_container_with_subtype& rhs) const
+    {
+        return !(rhs == *this);
+    }
+
+    /// @brief sets the binary subtype
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/set_subtype/
+    void set_subtype(subtype_type subtype_) noexcept
+    {
+        m_subtype = subtype_;
+        m_has_subtype = true;
+    }
+
+    /// @brief return the binary subtype
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/subtype/
+    constexpr subtype_type subtype() const noexcept
+    {
+        return m_has_subtype ? m_subtype : static_cast<subtype_type>(-1);
+    }
+
+    /// @brief return whether the value has a subtype
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/has_subtype/
+    constexpr bool has_subtype() const noexcept
+    {
+        return m_has_subtype;
+    }
+
+    /// @brief clears the binary subtype
+    /// @sa https://json.nlohmann.me/api/byte_container_with_subtype/clear_subtype/
+    void clear_subtype() noexcept
+    {
+        m_subtype = 0;
+        m_has_subtype = false;
+    }
+
+  private:
+    subtype_type m_subtype = 0;
+    bool m_has_subtype = false;
+};
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/conversions/from_json.hpp>
+
+// #include <nlohmann/detail/conversions/to_json.hpp>
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/hash.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstdint> // uint8_t
+#include <cstddef> // size_t
+#include <functional> // hash
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+// boost::hash_combine
+inline std::size_t combine(std::size_t seed, std::size_t h) noexcept
+{
+    seed ^= h + 0x9e3779b9 + (seed << 6U) + (seed >> 2U);
+    return seed;
+}
+
+/*!
+@brief hash a JSON value
+
+The hash function tries to rely on std::hash where possible. Furthermore, the
+type of the JSON value is taken into account to have different hash values for
+null, 0, 0U, and false, etc.
+
+@tparam BasicJsonType basic_json specialization
+@param j JSON value to hash
+@return hash value of j
+*/
+template<typename BasicJsonType>
+std::size_t hash(const BasicJsonType& j)
+{
+    using string_t = typename BasicJsonType::string_t;
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+
+    const auto type = static_cast<std::size_t>(j.type());
+    switch (j.type())
+    {
+        case BasicJsonType::value_t::null:
+        case BasicJsonType::value_t::discarded:
+        {
+            return combine(type, 0);
+        }
+
+        case BasicJsonType::value_t::object:
+        {
+            auto seed = combine(type, j.size());
+            for (const auto& element : j.items())
+            {
+                const auto h = std::hash<string_t> {}(element.key());
+                seed = combine(seed, h);
+                seed = combine(seed, hash(element.value()));
+            }
+            return seed;
+        }
+
+        case BasicJsonType::value_t::array:
+        {
+            auto seed = combine(type, j.size());
+            for (const auto& element : j)
+            {
+                seed = combine(seed, hash(element));
+            }
+            return seed;
+        }
+
+        case BasicJsonType::value_t::string:
+        {
+            const auto h = std::hash<string_t> {}(j.template get_ref<const string_t&>());
+            return combine(type, h);
+        }
+
+        case BasicJsonType::value_t::boolean:
+        {
+            const auto h = std::hash<bool> {}(j.template get<bool>());
+            return combine(type, h);
+        }
+
+        case BasicJsonType::value_t::number_integer:
+        {
+            const auto h = std::hash<number_integer_t> {}(j.template get<number_integer_t>());
+            return combine(type, h);
+        }
+
+        case BasicJsonType::value_t::number_unsigned:
+        {
+            const auto h = std::hash<number_unsigned_t> {}(j.template get<number_unsigned_t>());
+            return combine(type, h);
+        }
+
+        case BasicJsonType::value_t::number_float:
+        {
+            const auto h = std::hash<number_float_t> {}(j.template get<number_float_t>());
+            return combine(type, h);
+        }
+
+        case BasicJsonType::value_t::binary:
+        {
+            auto seed = combine(type, j.get_binary().size());
+            const auto h = std::hash<bool> {}(j.get_binary().has_subtype());
+            seed = combine(seed, h);
+            seed = combine(seed, static_cast<std::size_t>(j.get_binary().subtype()));
+            for (const auto byte : j.get_binary())
+            {
+                seed = combine(seed, std::hash<std::uint8_t> {}(byte));
+            }
+            return seed;
+        }
+
+        default:                   // LCOV_EXCL_LINE
+            JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+            return 0;              // LCOV_EXCL_LINE
+    }
+}
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/input/binary_reader.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // generate_n
+#include <array> // array
+#include <cmath> // ldexp
+#include <cstddef> // size_t
+#include <cstdint> // uint8_t, uint16_t, uint32_t, uint64_t
+#include <cstdio> // snprintf
+#include <cstring> // memcpy
+#include <iterator> // back_inserter
+#include <limits> // numeric_limits
+#include <string> // char_traits, string
+#include <utility> // make_pair, move
+#include <vector> // vector
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/input/input_adapters.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <array> // array
+#include <cstddef> // size_t
+#include <cstring> // strlen
+#include <iterator> // begin, end, iterator_traits, random_access_iterator_tag, distance, next
+#include <memory> // shared_ptr, make_shared, addressof
+#include <numeric> // accumulate
+#include <string> // string, char_traits
+#include <type_traits> // enable_if, is_base_of, is_pointer, is_integral, remove_pointer
+#include <utility> // pair, declval
+
+#ifndef JSON_NO_IO
+    #include <cstdio>   // FILE *
+    #include <istream>  // istream
+#endif                  // JSON_NO_IO
+
+// #include <nlohmann/detail/iterators/iterator_traits.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/// the supported input formats
+enum class input_format_t { json, cbor, msgpack, ubjson, bson, bjdata };
+
+////////////////////
+// input adapters //
+////////////////////
+
+#ifndef JSON_NO_IO
+/*!
+Input adapter for stdio file access. This adapter read only 1 byte and do not use any
+ buffer. This adapter is a very low level adapter.
+*/
+class file_input_adapter
+{
+  public:
+    using char_type = char;
+
+    JSON_HEDLEY_NON_NULL(2)
+    explicit file_input_adapter(std::FILE* f) noexcept
+        : m_file(f)
+    {
+        JSON_ASSERT(m_file != nullptr);
+    }
+
+    // make class move-only
+    file_input_adapter(const file_input_adapter&) = delete;
+    file_input_adapter(file_input_adapter&&) noexcept = default;
+    file_input_adapter& operator=(const file_input_adapter&) = delete;
+    file_input_adapter& operator=(file_input_adapter&&) = delete;
+    ~file_input_adapter() = default;
+
+    std::char_traits<char>::int_type get_character() noexcept
+    {
+        return std::fgetc(m_file);
+    }
+
+  private:
+    /// the file pointer to read from
+    std::FILE* m_file;
+};
+
+/*!
+Input adapter for a (caching) istream. Ignores a UFT Byte Order Mark at
+beginning of input. Does not support changing the underlying std::streambuf
+in mid-input. Maintains underlying std::istream and std::streambuf to support
+subsequent use of standard std::istream operations to process any input
+characters following those used in parsing the JSON input.  Clears the
+std::istream flags; any input errors (e.g., EOF) will be detected by the first
+subsequent call for input from the std::istream.
+*/
+class input_stream_adapter
+{
+  public:
+    using char_type = char;
+
+    ~input_stream_adapter()
+    {
+        // clear stream flags; we use underlying streambuf I/O, do not
+        // maintain ifstream flags, except eof
+        if (is != nullptr)
+        {
+            is->clear(is->rdstate() & std::ios::eofbit);
+        }
+    }
+
+    explicit input_stream_adapter(std::istream& i)
+        : is(&i), sb(i.rdbuf())
+    {}
+
+    // delete because of pointer members
+    input_stream_adapter(const input_stream_adapter&) = delete;
+    input_stream_adapter& operator=(input_stream_adapter&) = delete;
+    input_stream_adapter& operator=(input_stream_adapter&&) = delete;
+
+    input_stream_adapter(input_stream_adapter&& rhs) noexcept
+        : is(rhs.is), sb(rhs.sb)
+    {
+        rhs.is = nullptr;
+        rhs.sb = nullptr;
+    }
+
+    // std::istream/std::streambuf use std::char_traits<char>::to_int_type, to
+    // ensure that std::char_traits<char>::eof() and the character 0xFF do not
+    // end up as the same value, e.g. 0xFFFFFFFF.
+    std::char_traits<char>::int_type get_character()
+    {
+        auto res = sb->sbumpc();
+        // set eof manually, as we don't use the istream interface.
+        if (JSON_HEDLEY_UNLIKELY(res == std::char_traits<char>::eof()))
+        {
+            is->clear(is->rdstate() | std::ios::eofbit);
+        }
+        return res;
+    }
+
+  private:
+    /// the associated input stream
+    std::istream* is = nullptr;
+    std::streambuf* sb = nullptr;
+};
+#endif  // JSON_NO_IO
+
+// General-purpose iterator-based adapter. It might not be as fast as
+// theoretically possible for some containers, but it is extremely versatile.
+template<typename IteratorType>
+class iterator_input_adapter
+{
+  public:
+    using char_type = typename std::iterator_traits<IteratorType>::value_type;
+
+    iterator_input_adapter(IteratorType first, IteratorType last)
+        : current(std::move(first)), end(std::move(last))
+    {}
+
+    typename char_traits<char_type>::int_type get_character()
+    {
+        if (JSON_HEDLEY_LIKELY(current != end))
+        {
+            auto result = char_traits<char_type>::to_int_type(*current);
+            std::advance(current, 1);
+            return result;
+        }
+
+        return char_traits<char_type>::eof();
+    }
+
+  private:
+    IteratorType current;
+    IteratorType end;
+
+    template<typename BaseInputAdapter, size_t T>
+    friend struct wide_string_input_helper;
+
+    bool empty() const
+    {
+        return current == end;
+    }
+};
+
+template<typename BaseInputAdapter, size_t T>
+struct wide_string_input_helper;
+
+template<typename BaseInputAdapter>
+struct wide_string_input_helper<BaseInputAdapter, 4>
+{
+    // UTF-32
+    static void fill_buffer(BaseInputAdapter& input,
+                            std::array<std::char_traits<char>::int_type, 4>& utf8_bytes,
+                            size_t& utf8_bytes_index,
+                            size_t& utf8_bytes_filled)
+    {
+        utf8_bytes_index = 0;
+
+        if (JSON_HEDLEY_UNLIKELY(input.empty()))
+        {
+            utf8_bytes[0] = std::char_traits<char>::eof();
+            utf8_bytes_filled = 1;
+        }
+        else
+        {
+            // get the current character
+            const auto wc = input.get_character();
+
+            // UTF-32 to UTF-8 encoding
+            if (wc < 0x80)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(wc);
+                utf8_bytes_filled = 1;
+            }
+            else if (wc <= 0x7FF)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xC0u | ((static_cast<unsigned int>(wc) >> 6u) & 0x1Fu));
+                utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | (static_cast<unsigned int>(wc) & 0x3Fu));
+                utf8_bytes_filled = 2;
+            }
+            else if (wc <= 0xFFFF)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xE0u | ((static_cast<unsigned int>(wc) >> 12u) & 0x0Fu));
+                utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | ((static_cast<unsigned int>(wc) >> 6u) & 0x3Fu));
+                utf8_bytes[2] = static_cast<std::char_traits<char>::int_type>(0x80u | (static_cast<unsigned int>(wc) & 0x3Fu));
+                utf8_bytes_filled = 3;
+            }
+            else if (wc <= 0x10FFFF)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xF0u | ((static_cast<unsigned int>(wc) >> 18u) & 0x07u));
+                utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | ((static_cast<unsigned int>(wc) >> 12u) & 0x3Fu));
+                utf8_bytes[2] = static_cast<std::char_traits<char>::int_type>(0x80u | ((static_cast<unsigned int>(wc) >> 6u) & 0x3Fu));
+                utf8_bytes[3] = static_cast<std::char_traits<char>::int_type>(0x80u | (static_cast<unsigned int>(wc) & 0x3Fu));
+                utf8_bytes_filled = 4;
+            }
+            else
+            {
+                // unknown character
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(wc);
+                utf8_bytes_filled = 1;
+            }
+        }
+    }
+};
+
+template<typename BaseInputAdapter>
+struct wide_string_input_helper<BaseInputAdapter, 2>
+{
+    // UTF-16
+    static void fill_buffer(BaseInputAdapter& input,
+                            std::array<std::char_traits<char>::int_type, 4>& utf8_bytes,
+                            size_t& utf8_bytes_index,
+                            size_t& utf8_bytes_filled)
+    {
+        utf8_bytes_index = 0;
+
+        if (JSON_HEDLEY_UNLIKELY(input.empty()))
+        {
+            utf8_bytes[0] = std::char_traits<char>::eof();
+            utf8_bytes_filled = 1;
+        }
+        else
+        {
+            // get the current character
+            const auto wc = input.get_character();
+
+            // UTF-16 to UTF-8 encoding
+            if (wc < 0x80)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(wc);
+                utf8_bytes_filled = 1;
+            }
+            else if (wc <= 0x7FF)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xC0u | ((static_cast<unsigned int>(wc) >> 6u)));
+                utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | (static_cast<unsigned int>(wc) & 0x3Fu));
+                utf8_bytes_filled = 2;
+            }
+            else if (0xD800 > wc || wc >= 0xE000)
+            {
+                utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xE0u | ((static_cast<unsigned int>(wc) >> 12u)));
+                utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | ((static_cast<unsigned int>(wc) >> 6u) & 0x3Fu));
+                utf8_bytes[2] = static_cast<std::char_traits<char>::int_type>(0x80u | (static_cast<unsigned int>(wc) & 0x3Fu));
+                utf8_bytes_filled = 3;
+            }
+            else
+            {
+                if (JSON_HEDLEY_UNLIKELY(!input.empty()))
+                {
+                    const auto wc2 = static_cast<unsigned int>(input.get_character());
+                    const auto charcode = 0x10000u + (((static_cast<unsigned int>(wc) & 0x3FFu) << 10u) | (wc2 & 0x3FFu));
+                    utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(0xF0u | (charcode >> 18u));
+                    utf8_bytes[1] = static_cast<std::char_traits<char>::int_type>(0x80u | ((charcode >> 12u) & 0x3Fu));
+                    utf8_bytes[2] = static_cast<std::char_traits<char>::int_type>(0x80u | ((charcode >> 6u) & 0x3Fu));
+                    utf8_bytes[3] = static_cast<std::char_traits<char>::int_type>(0x80u | (charcode & 0x3Fu));
+                    utf8_bytes_filled = 4;
+                }
+                else
+                {
+                    utf8_bytes[0] = static_cast<std::char_traits<char>::int_type>(wc);
+                    utf8_bytes_filled = 1;
+                }
+            }
+        }
+    }
+};
+
+// Wraps another input adapter to convert wide character types into individual bytes.
+template<typename BaseInputAdapter, typename WideCharType>
+class wide_string_input_adapter
+{
+  public:
+    using char_type = char;
+
+    wide_string_input_adapter(BaseInputAdapter base)
+        : base_adapter(base) {}
+
+    typename std::char_traits<char>::int_type get_character() noexcept
+    {
+        // check if buffer needs to be filled
+        if (utf8_bytes_index == utf8_bytes_filled)
+        {
+            fill_buffer<sizeof(WideCharType)>();
+
+            JSON_ASSERT(utf8_bytes_filled > 0);
+            JSON_ASSERT(utf8_bytes_index == 0);
+        }
+
+        // use buffer
+        JSON_ASSERT(utf8_bytes_filled > 0);
+        JSON_ASSERT(utf8_bytes_index < utf8_bytes_filled);
+        return utf8_bytes[utf8_bytes_index++];
+    }
+
+  private:
+    BaseInputAdapter base_adapter;
+
+    template<size_t T>
+    void fill_buffer()
+    {
+        wide_string_input_helper<BaseInputAdapter, T>::fill_buffer(base_adapter, utf8_bytes, utf8_bytes_index, utf8_bytes_filled);
+    }
+
+    /// a buffer for UTF-8 bytes
+    std::array<std::char_traits<char>::int_type, 4> utf8_bytes = {{0, 0, 0, 0}};
+
+    /// index to the utf8_codes array for the next valid byte
+    std::size_t utf8_bytes_index = 0;
+    /// number of valid bytes in the utf8_codes array
+    std::size_t utf8_bytes_filled = 0;
+};
+
+template<typename IteratorType, typename Enable = void>
+struct iterator_input_adapter_factory
+{
+    using iterator_type = IteratorType;
+    using char_type = typename std::iterator_traits<iterator_type>::value_type;
+    using adapter_type = iterator_input_adapter<iterator_type>;
+
+    static adapter_type create(IteratorType first, IteratorType last)
+    {
+        return adapter_type(std::move(first), std::move(last));
+    }
+};
+
+template<typename T>
+struct is_iterator_of_multibyte
+{
+    using value_type = typename std::iterator_traits<T>::value_type;
+    enum
+    {
+        value = sizeof(value_type) > 1
+    };
+};
+
+template<typename IteratorType>
+struct iterator_input_adapter_factory<IteratorType, enable_if_t<is_iterator_of_multibyte<IteratorType>::value>>
+{
+    using iterator_type = IteratorType;
+    using char_type = typename std::iterator_traits<iterator_type>::value_type;
+    using base_adapter_type = iterator_input_adapter<iterator_type>;
+    using adapter_type = wide_string_input_adapter<base_adapter_type, char_type>;
+
+    static adapter_type create(IteratorType first, IteratorType last)
+    {
+        return adapter_type(base_adapter_type(std::move(first), std::move(last)));
+    }
+};
+
+// General purpose iterator-based input
+template<typename IteratorType>
+typename iterator_input_adapter_factory<IteratorType>::adapter_type input_adapter(IteratorType first, IteratorType last)
+{
+    using factory_type = iterator_input_adapter_factory<IteratorType>;
+    return factory_type::create(first, last);
+}
+
+// Convenience shorthand from container to iterator
+// Enables ADL on begin(container) and end(container)
+// Encloses the using declarations in namespace for not to leak them to outside scope
+
+namespace container_input_adapter_factory_impl
+{
+
+using std::begin;
+using std::end;
+
+template<typename ContainerType, typename Enable = void>
+struct container_input_adapter_factory {};
+
+template<typename ContainerType>
+struct container_input_adapter_factory< ContainerType,
+       void_t<decltype(begin(std::declval<ContainerType>()), end(std::declval<ContainerType>()))>>
+       {
+           using adapter_type = decltype(input_adapter(begin(std::declval<ContainerType>()), end(std::declval<ContainerType>())));
+
+           static adapter_type create(const ContainerType& container)
+{
+    return input_adapter(begin(container), end(container));
+}
+       };
+
+}  // namespace container_input_adapter_factory_impl
+
+template<typename ContainerType>
+typename container_input_adapter_factory_impl::container_input_adapter_factory<ContainerType>::adapter_type input_adapter(const ContainerType& container)
+{
+    return container_input_adapter_factory_impl::container_input_adapter_factory<ContainerType>::create(container);
+}
+
+#ifndef JSON_NO_IO
+// Special cases with fast paths
+inline file_input_adapter input_adapter(std::FILE* file)
+{
+    return file_input_adapter(file);
+}
+
+inline input_stream_adapter input_adapter(std::istream& stream)
+{
+    return input_stream_adapter(stream);
+}
+
+inline input_stream_adapter input_adapter(std::istream&& stream)
+{
+    return input_stream_adapter(stream);
+}
+#endif  // JSON_NO_IO
+
+using contiguous_bytes_input_adapter = decltype(input_adapter(std::declval<const char*>(), std::declval<const char*>()));
+
+// Null-delimited strings, and the like.
+template < typename CharT,
+           typename std::enable_if <
+               std::is_pointer<CharT>::value&&
+               !std::is_array<CharT>::value&&
+               std::is_integral<typename std::remove_pointer<CharT>::type>::value&&
+               sizeof(typename std::remove_pointer<CharT>::type) == 1,
+               int >::type = 0 >
+contiguous_bytes_input_adapter input_adapter(CharT b)
+{
+    auto length = std::strlen(reinterpret_cast<const char*>(b));
+    const auto* ptr = reinterpret_cast<const char*>(b);
+    return input_adapter(ptr, ptr + length);
+}
+
+template<typename T, std::size_t N>
+auto input_adapter(T (&array)[N]) -> decltype(input_adapter(array, array + N)) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+{
+    return input_adapter(array, array + N);
+}
+
+// This class only handles inputs of input_buffer_adapter type.
+// It's required so that expressions like {ptr, len} can be implicitly cast
+// to the correct adapter.
+class span_input_adapter
+{
+  public:
+    template < typename CharT,
+               typename std::enable_if <
+                   std::is_pointer<CharT>::value&&
+                   std::is_integral<typename std::remove_pointer<CharT>::type>::value&&
+                   sizeof(typename std::remove_pointer<CharT>::type) == 1,
+                   int >::type = 0 >
+    span_input_adapter(CharT b, std::size_t l)
+        : ia(reinterpret_cast<const char*>(b), reinterpret_cast<const char*>(b) + l) {}
+
+    template<class IteratorType,
+             typename std::enable_if<
+                 std::is_same<typename iterator_traits<IteratorType>::iterator_category, std::random_access_iterator_tag>::value,
+                 int>::type = 0>
+    span_input_adapter(IteratorType first, IteratorType last)
+        : ia(input_adapter(first, last)) {}
+
+    contiguous_bytes_input_adapter&& get()
+    {
+        return std::move(ia); // NOLINT(hicpp-move-const-arg,performance-move-const-arg)
+    }
+
+  private:
+    contiguous_bytes_input_adapter ia;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/input/json_sax.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstddef>
+#include <string> // string
+#include <utility> // move
+#include <vector> // vector
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/*!
+@brief SAX interface
+
+This class describes the SAX interface used by @ref nlohmann::json::sax_parse.
+Each function is called in different situations while the input is parsed. The
+boolean return value informs the parser whether to continue processing the
+input.
+*/
+template<typename BasicJsonType>
+struct json_sax
+{
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+
+    /*!
+    @brief a null value was read
+    @return whether parsing should proceed
+    */
+    virtual bool null() = 0;
+
+    /*!
+    @brief a boolean value was read
+    @param[in] val  boolean value
+    @return whether parsing should proceed
+    */
+    virtual bool boolean(bool val) = 0;
+
+    /*!
+    @brief an integer number was read
+    @param[in] val  integer value
+    @return whether parsing should proceed
+    */
+    virtual bool number_integer(number_integer_t val) = 0;
+
+    /*!
+    @brief an unsigned integer number was read
+    @param[in] val  unsigned integer value
+    @return whether parsing should proceed
+    */
+    virtual bool number_unsigned(number_unsigned_t val) = 0;
+
+    /*!
+    @brief a floating-point number was read
+    @param[in] val  floating-point value
+    @param[in] s    raw token value
+    @return whether parsing should proceed
+    */
+    virtual bool number_float(number_float_t val, const string_t& s) = 0;
+
+    /*!
+    @brief a string value was read
+    @param[in] val  string value
+    @return whether parsing should proceed
+    @note It is safe to move the passed string value.
+    */
+    virtual bool string(string_t& val) = 0;
+
+    /*!
+    @brief a binary value was read
+    @param[in] val  binary value
+    @return whether parsing should proceed
+    @note It is safe to move the passed binary value.
+    */
+    virtual bool binary(binary_t& val) = 0;
+
+    /*!
+    @brief the beginning of an object was read
+    @param[in] elements  number of object elements or -1 if unknown
+    @return whether parsing should proceed
+    @note binary formats may report the number of elements
+    */
+    virtual bool start_object(std::size_t elements) = 0;
+
+    /*!
+    @brief an object key was read
+    @param[in] val  object key
+    @return whether parsing should proceed
+    @note It is safe to move the passed string.
+    */
+    virtual bool key(string_t& val) = 0;
+
+    /*!
+    @brief the end of an object was read
+    @return whether parsing should proceed
+    */
+    virtual bool end_object() = 0;
+
+    /*!
+    @brief the beginning of an array was read
+    @param[in] elements  number of array elements or -1 if unknown
+    @return whether parsing should proceed
+    @note binary formats may report the number of elements
+    */
+    virtual bool start_array(std::size_t elements) = 0;
+
+    /*!
+    @brief the end of an array was read
+    @return whether parsing should proceed
+    */
+    virtual bool end_array() = 0;
+
+    /*!
+    @brief a parse error occurred
+    @param[in] position    the position in the input where the error occurs
+    @param[in] last_token  the last read token
+    @param[in] ex          an exception object describing the error
+    @return whether parsing should proceed (must return false)
+    */
+    virtual bool parse_error(std::size_t position,
+                             const std::string& last_token,
+                             const detail::exception& ex) = 0;
+
+    json_sax() = default;
+    json_sax(const json_sax&) = default;
+    json_sax(json_sax&&) noexcept = default;
+    json_sax& operator=(const json_sax&) = default;
+    json_sax& operator=(json_sax&&) noexcept = default;
+    virtual ~json_sax() = default;
+};
+
+namespace detail
+{
+/*!
+@brief SAX implementation to create a JSON value from SAX events
+
+This class implements the @ref json_sax interface and processes the SAX events
+to create a JSON value which makes it basically a DOM parser. The structure or
+hierarchy of the JSON value is managed by the stack `ref_stack` which contains
+a pointer to the respective array or object for each recursion depth.
+
+After successful parsing, the value that is passed by reference to the
+constructor contains the parsed value.
+
+@tparam BasicJsonType  the JSON type
+*/
+template<typename BasicJsonType>
+class json_sax_dom_parser
+{
+  public:
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+
+    /*!
+    @param[in,out] r  reference to a JSON value that is manipulated while
+                       parsing
+    @param[in] allow_exceptions_  whether parse errors yield exceptions
+    */
+    explicit json_sax_dom_parser(BasicJsonType& r, const bool allow_exceptions_ = true)
+        : root(r), allow_exceptions(allow_exceptions_)
+    {}
+
+    // make class move-only
+    json_sax_dom_parser(const json_sax_dom_parser&) = delete;
+    json_sax_dom_parser(json_sax_dom_parser&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    json_sax_dom_parser& operator=(const json_sax_dom_parser&) = delete;
+    json_sax_dom_parser& operator=(json_sax_dom_parser&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    ~json_sax_dom_parser() = default;
+
+    bool null()
+    {
+        handle_value(nullptr);
+        return true;
+    }
+
+    bool boolean(bool val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_integer(number_integer_t val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_unsigned(number_unsigned_t val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_float(number_float_t val, const string_t& /*unused*/)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool string(string_t& val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool binary(binary_t& val)
+    {
+        handle_value(std::move(val));
+        return true;
+    }
+
+    bool start_object(std::size_t len)
+    {
+        ref_stack.push_back(handle_value(BasicJsonType::value_t::object));
+
+        if (JSON_HEDLEY_UNLIKELY(len != static_cast<std::size_t>(-1) && len > ref_stack.back()->max_size()))
+        {
+            JSON_THROW(out_of_range::create(408, concat("excessive object size: ", std::to_string(len)), ref_stack.back()));
+        }
+
+        return true;
+    }
+
+    bool key(string_t& val)
+    {
+        JSON_ASSERT(!ref_stack.empty());
+        JSON_ASSERT(ref_stack.back()->is_object());
+
+        // add null at given key and store the reference for later
+        object_element = &(ref_stack.back()->m_data.m_value.object->operator[](val));
+        return true;
+    }
+
+    bool end_object()
+    {
+        JSON_ASSERT(!ref_stack.empty());
+        JSON_ASSERT(ref_stack.back()->is_object());
+
+        ref_stack.back()->set_parents();
+        ref_stack.pop_back();
+        return true;
+    }
+
+    bool start_array(std::size_t len)
+    {
+        ref_stack.push_back(handle_value(BasicJsonType::value_t::array));
+
+        if (JSON_HEDLEY_UNLIKELY(len != static_cast<std::size_t>(-1) && len > ref_stack.back()->max_size()))
+        {
+            JSON_THROW(out_of_range::create(408, concat("excessive array size: ", std::to_string(len)), ref_stack.back()));
+        }
+
+        return true;
+    }
+
+    bool end_array()
+    {
+        JSON_ASSERT(!ref_stack.empty());
+        JSON_ASSERT(ref_stack.back()->is_array());
+
+        ref_stack.back()->set_parents();
+        ref_stack.pop_back();
+        return true;
+    }
+
+    template<class Exception>
+    bool parse_error(std::size_t /*unused*/, const std::string& /*unused*/,
+                     const Exception& ex)
+    {
+        errored = true;
+        static_cast<void>(ex);
+        if (allow_exceptions)
+        {
+            JSON_THROW(ex);
+        }
+        return false;
+    }
+
+    constexpr bool is_errored() const
+    {
+        return errored;
+    }
+
+  private:
+    /*!
+    @invariant If the ref stack is empty, then the passed value will be the new
+               root.
+    @invariant If the ref stack contains a value, then it is an array or an
+               object to which we can add elements
+    */
+    template<typename Value>
+    JSON_HEDLEY_RETURNS_NON_NULL
+    BasicJsonType* handle_value(Value&& v)
+    {
+        if (ref_stack.empty())
+        {
+            root = BasicJsonType(std::forward<Value>(v));
+            return &root;
+        }
+
+        JSON_ASSERT(ref_stack.back()->is_array() || ref_stack.back()->is_object());
+
+        if (ref_stack.back()->is_array())
+        {
+            ref_stack.back()->m_data.m_value.array->emplace_back(std::forward<Value>(v));
+            return &(ref_stack.back()->m_data.m_value.array->back());
+        }
+
+        JSON_ASSERT(ref_stack.back()->is_object());
+        JSON_ASSERT(object_element);
+        *object_element = BasicJsonType(std::forward<Value>(v));
+        return object_element;
+    }
+
+    /// the parsed JSON value
+    BasicJsonType& root;
+    /// stack to model hierarchy of values
+    std::vector<BasicJsonType*> ref_stack {};
+    /// helper to hold the reference for the next object element
+    BasicJsonType* object_element = nullptr;
+    /// whether a syntax error occurred
+    bool errored = false;
+    /// whether to throw exceptions in case of errors
+    const bool allow_exceptions = true;
+};
+
+template<typename BasicJsonType>
+class json_sax_dom_callback_parser
+{
+  public:
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+    using parser_callback_t = typename BasicJsonType::parser_callback_t;
+    using parse_event_t = typename BasicJsonType::parse_event_t;
+
+    json_sax_dom_callback_parser(BasicJsonType& r,
+                                 const parser_callback_t cb,
+                                 const bool allow_exceptions_ = true)
+        : root(r), callback(cb), allow_exceptions(allow_exceptions_)
+    {
+        keep_stack.push_back(true);
+    }
+
+    // make class move-only
+    json_sax_dom_callback_parser(const json_sax_dom_callback_parser&) = delete;
+    json_sax_dom_callback_parser(json_sax_dom_callback_parser&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    json_sax_dom_callback_parser& operator=(const json_sax_dom_callback_parser&) = delete;
+    json_sax_dom_callback_parser& operator=(json_sax_dom_callback_parser&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    ~json_sax_dom_callback_parser() = default;
+
+    bool null()
+    {
+        handle_value(nullptr);
+        return true;
+    }
+
+    bool boolean(bool val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_integer(number_integer_t val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_unsigned(number_unsigned_t val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_float(number_float_t val, const string_t& /*unused*/)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool string(string_t& val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool binary(binary_t& val)
+    {
+        handle_value(std::move(val));
+        return true;
+    }
+
+    bool start_object(std::size_t len)
+    {
+        // check callback for object start
+        const bool keep = callback(static_cast<int>(ref_stack.size()), parse_event_t::object_start, discarded);
+        keep_stack.push_back(keep);
+
+        auto val = handle_value(BasicJsonType::value_t::object, true);
+        ref_stack.push_back(val.second);
+
+        // check object limit
+        if (ref_stack.back() && JSON_HEDLEY_UNLIKELY(len != static_cast<std::size_t>(-1) && len > ref_stack.back()->max_size()))
+        {
+            JSON_THROW(out_of_range::create(408, concat("excessive object size: ", std::to_string(len)), ref_stack.back()));
+        }
+
+        return true;
+    }
+
+    bool key(string_t& val)
+    {
+        BasicJsonType k = BasicJsonType(val);
+
+        // check callback for key
+        const bool keep = callback(static_cast<int>(ref_stack.size()), parse_event_t::key, k);
+        key_keep_stack.push_back(keep);
+
+        // add discarded value at given key and store the reference for later
+        if (keep && ref_stack.back())
+        {
+            object_element = &(ref_stack.back()->m_data.m_value.object->operator[](val) = discarded);
+        }
+
+        return true;
+    }
+
+    bool end_object()
+    {
+        if (ref_stack.back())
+        {
+            if (!callback(static_cast<int>(ref_stack.size()) - 1, parse_event_t::object_end, *ref_stack.back()))
+            {
+                // discard object
+                *ref_stack.back() = discarded;
+            }
+            else
+            {
+                ref_stack.back()->set_parents();
+            }
+        }
+
+        JSON_ASSERT(!ref_stack.empty());
+        JSON_ASSERT(!keep_stack.empty());
+        ref_stack.pop_back();
+        keep_stack.pop_back();
+
+        if (!ref_stack.empty() && ref_stack.back() && ref_stack.back()->is_structured())
+        {
+            // remove discarded value
+            for (auto it = ref_stack.back()->begin(); it != ref_stack.back()->end(); ++it)
+            {
+                if (it->is_discarded())
+                {
+                    ref_stack.back()->erase(it);
+                    break;
+                }
+            }
+        }
+
+        return true;
+    }
+
+    bool start_array(std::size_t len)
+    {
+        const bool keep = callback(static_cast<int>(ref_stack.size()), parse_event_t::array_start, discarded);
+        keep_stack.push_back(keep);
+
+        auto val = handle_value(BasicJsonType::value_t::array, true);
+        ref_stack.push_back(val.second);
+
+        // check array limit
+        if (ref_stack.back() && JSON_HEDLEY_UNLIKELY(len != static_cast<std::size_t>(-1) && len > ref_stack.back()->max_size()))
+        {
+            JSON_THROW(out_of_range::create(408, concat("excessive array size: ", std::to_string(len)), ref_stack.back()));
+        }
+
+        return true;
+    }
+
+    bool end_array()
+    {
+        bool keep = true;
+
+        if (ref_stack.back())
+        {
+            keep = callback(static_cast<int>(ref_stack.size()) - 1, parse_event_t::array_end, *ref_stack.back());
+            if (keep)
+            {
+                ref_stack.back()->set_parents();
+            }
+            else
+            {
+                // discard array
+                *ref_stack.back() = discarded;
+            }
+        }
+
+        JSON_ASSERT(!ref_stack.empty());
+        JSON_ASSERT(!keep_stack.empty());
+        ref_stack.pop_back();
+        keep_stack.pop_back();
+
+        // remove discarded value
+        if (!keep && !ref_stack.empty() && ref_stack.back()->is_array())
+        {
+            ref_stack.back()->m_data.m_value.array->pop_back();
+        }
+
+        return true;
+    }
+
+    template<class Exception>
+    bool parse_error(std::size_t /*unused*/, const std::string& /*unused*/,
+                     const Exception& ex)
+    {
+        errored = true;
+        static_cast<void>(ex);
+        if (allow_exceptions)
+        {
+            JSON_THROW(ex);
+        }
+        return false;
+    }
+
+    constexpr bool is_errored() const
+    {
+        return errored;
+    }
+
+  private:
+    /*!
+    @param[in] v  value to add to the JSON value we build during parsing
+    @param[in] skip_callback  whether we should skip calling the callback
+               function; this is required after start_array() and
+               start_object() SAX events, because otherwise we would call the
+               callback function with an empty array or object, respectively.
+
+    @invariant If the ref stack is empty, then the passed value will be the new
+               root.
+    @invariant If the ref stack contains a value, then it is an array or an
+               object to which we can add elements
+
+    @return pair of boolean (whether value should be kept) and pointer (to the
+            passed value in the ref_stack hierarchy; nullptr if not kept)
+    */
+    template<typename Value>
+    std::pair<bool, BasicJsonType*> handle_value(Value&& v, const bool skip_callback = false)
+    {
+        JSON_ASSERT(!keep_stack.empty());
+
+        // do not handle this value if we know it would be added to a discarded
+        // container
+        if (!keep_stack.back())
+        {
+            return {false, nullptr};
+        }
+
+        // create value
+        auto value = BasicJsonType(std::forward<Value>(v));
+
+        // check callback
+        const bool keep = skip_callback || callback(static_cast<int>(ref_stack.size()), parse_event_t::value, value);
+
+        // do not handle this value if we just learnt it shall be discarded
+        if (!keep)
+        {
+            return {false, nullptr};
+        }
+
+        if (ref_stack.empty())
+        {
+            root = std::move(value);
+            return {true, & root};
+        }
+
+        // skip this value if we already decided to skip the parent
+        // (https://github.com/nlohmann/json/issues/971#issuecomment-413678360)
+        if (!ref_stack.back())
+        {
+            return {false, nullptr};
+        }
+
+        // we now only expect arrays and objects
+        JSON_ASSERT(ref_stack.back()->is_array() || ref_stack.back()->is_object());
+
+        // array
+        if (ref_stack.back()->is_array())
+        {
+            ref_stack.back()->m_data.m_value.array->emplace_back(std::move(value));
+            return {true, & (ref_stack.back()->m_data.m_value.array->back())};
+        }
+
+        // object
+        JSON_ASSERT(ref_stack.back()->is_object());
+        // check if we should store an element for the current key
+        JSON_ASSERT(!key_keep_stack.empty());
+        const bool store_element = key_keep_stack.back();
+        key_keep_stack.pop_back();
+
+        if (!store_element)
+        {
+            return {false, nullptr};
+        }
+
+        JSON_ASSERT(object_element);
+        *object_element = std::move(value);
+        return {true, object_element};
+    }
+
+    /// the parsed JSON value
+    BasicJsonType& root;
+    /// stack to model hierarchy of values
+    std::vector<BasicJsonType*> ref_stack {};
+    /// stack to manage which values to keep
+    std::vector<bool> keep_stack {};
+    /// stack to manage which object keys to keep
+    std::vector<bool> key_keep_stack {};
+    /// helper to hold the reference for the next object element
+    BasicJsonType* object_element = nullptr;
+    /// whether a syntax error occurred
+    bool errored = false;
+    /// callback function
+    const parser_callback_t callback = nullptr;
+    /// whether to throw exceptions in case of errors
+    const bool allow_exceptions = true;
+    /// a discarded value for the callback
+    BasicJsonType discarded = BasicJsonType::value_t::discarded;
+};
+
+template<typename BasicJsonType>
+class json_sax_acceptor
+{
+  public:
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+
+    bool null()
+    {
+        return true;
+    }
+
+    bool boolean(bool /*unused*/)
+    {
+        return true;
+    }
+
+    bool number_integer(number_integer_t /*unused*/)
+    {
+        return true;
+    }
+
+    bool number_unsigned(number_unsigned_t /*unused*/)
+    {
+        return true;
+    }
+
+    bool number_float(number_float_t /*unused*/, const string_t& /*unused*/)
+    {
+        return true;
+    }
+
+    bool string(string_t& /*unused*/)
+    {
+        return true;
+    }
+
+    bool binary(binary_t& /*unused*/)
+    {
+        return true;
+    }
+
+    bool start_object(std::size_t /*unused*/ = static_cast<std::size_t>(-1))
+    {
+        return true;
+    }
+
+    bool key(string_t& /*unused*/)
+    {
+        return true;
+    }
+
+    bool end_object()
+    {
+        return true;
+    }
+
+    bool start_array(std::size_t /*unused*/ = static_cast<std::size_t>(-1))
+    {
+        return true;
+    }
+
+    bool end_array()
+    {
+        return true;
+    }
+
+    bool parse_error(std::size_t /*unused*/, const std::string& /*unused*/, const detail::exception& /*unused*/)
+    {
+        return false;
+    }
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/input/lexer.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <array> // array
+#include <clocale> // localeconv
+#include <cstddef> // size_t
+#include <cstdio> // snprintf
+#include <cstdlib> // strtof, strtod, strtold, strtoll, strtoull
+#include <initializer_list> // initializer_list
+#include <string> // char_traits, string
+#include <utility> // move
+#include <vector> // vector
+
+// #include <nlohmann/detail/input/input_adapters.hpp>
+
+// #include <nlohmann/detail/input/position_t.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+///////////
+// lexer //
+///////////
+
+template<typename BasicJsonType>
+class lexer_base
+{
+  public:
+    /// token types for the parser
+    enum class token_type
+    {
+        uninitialized,    ///< indicating the scanner is uninitialized
+        literal_true,     ///< the `true` literal
+        literal_false,    ///< the `false` literal
+        literal_null,     ///< the `null` literal
+        value_string,     ///< a string -- use get_string() for actual value
+        value_unsigned,   ///< an unsigned integer -- use get_number_unsigned() for actual value
+        value_integer,    ///< a signed integer -- use get_number_integer() for actual value
+        value_float,      ///< an floating point number -- use get_number_float() for actual value
+        begin_array,      ///< the character for array begin `[`
+        begin_object,     ///< the character for object begin `{`
+        end_array,        ///< the character for array end `]`
+        end_object,       ///< the character for object end `}`
+        name_separator,   ///< the name separator `:`
+        value_separator,  ///< the value separator `,`
+        parse_error,      ///< indicating a parse error
+        end_of_input,     ///< indicating the end of the input buffer
+        literal_or_value  ///< a literal or the begin of a value (only for diagnostics)
+    };
+
+    /// return name of values of type token_type (only used for errors)
+    JSON_HEDLEY_RETURNS_NON_NULL
+    JSON_HEDLEY_CONST
+    static const char* token_type_name(const token_type t) noexcept
+    {
+        switch (t)
+        {
+            case token_type::uninitialized:
+                return "<uninitialized>";
+            case token_type::literal_true:
+                return "true literal";
+            case token_type::literal_false:
+                return "false literal";
+            case token_type::literal_null:
+                return "null literal";
+            case token_type::value_string:
+                return "string literal";
+            case token_type::value_unsigned:
+            case token_type::value_integer:
+            case token_type::value_float:
+                return "number literal";
+            case token_type::begin_array:
+                return "'['";
+            case token_type::begin_object:
+                return "'{'";
+            case token_type::end_array:
+                return "']'";
+            case token_type::end_object:
+                return "'}'";
+            case token_type::name_separator:
+                return "':'";
+            case token_type::value_separator:
+                return "','";
+            case token_type::parse_error:
+                return "<parse error>";
+            case token_type::end_of_input:
+                return "end of input";
+            case token_type::literal_or_value:
+                return "'[', '{', or a literal";
+            // LCOV_EXCL_START
+            default: // catch non-enum values
+                return "unknown token";
+                // LCOV_EXCL_STOP
+        }
+    }
+};
+/*!
+@brief lexical analysis
+
+This class organizes the lexical analysis during JSON deserialization.
+*/
+template<typename BasicJsonType, typename InputAdapterType>
+class lexer : public lexer_base<BasicJsonType>
+{
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using char_type = typename InputAdapterType::char_type;
+    using char_int_type = typename char_traits<char_type>::int_type;
+
+  public:
+    using token_type = typename lexer_base<BasicJsonType>::token_type;
+
+    explicit lexer(InputAdapterType&& adapter, bool ignore_comments_ = false) noexcept
+        : ia(std::move(adapter))
+        , ignore_comments(ignore_comments_)
+        , decimal_point_char(static_cast<char_int_type>(get_decimal_point()))
+    {}
+
+    // delete because of pointer members
+    lexer(const lexer&) = delete;
+    lexer(lexer&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    lexer& operator=(lexer&) = delete;
+    lexer& operator=(lexer&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    ~lexer() = default;
+
+  private:
+    /////////////////////
+    // locales
+    /////////////////////
+
+    /// return the locale-dependent decimal point
+    JSON_HEDLEY_PURE
+    static char get_decimal_point() noexcept
+    {
+        const auto* loc = localeconv();
+        JSON_ASSERT(loc != nullptr);
+        return (loc->decimal_point == nullptr) ? '.' : *(loc->decimal_point);
+    }
+
+    /////////////////////
+    // scan functions
+    /////////////////////
+
+    /*!
+    @brief get codepoint from 4 hex characters following `\u`
+
+    For input "\u c1 c2 c3 c4" the codepoint is:
+      (c1 * 0x1000) + (c2 * 0x0100) + (c3 * 0x0010) + c4
+    = (c1 << 12) + (c2 << 8) + (c3 << 4) + (c4 << 0)
+
+    Furthermore, the possible characters '0'..'9', 'A'..'F', and 'a'..'f'
+    must be converted to the integers 0x0..0x9, 0xA..0xF, 0xA..0xF, resp. The
+    conversion is done by subtracting the offset (0x30, 0x37, and 0x57)
+    between the ASCII value of the character and the desired integer value.
+
+    @return codepoint (0x0000..0xFFFF) or -1 in case of an error (e.g. EOF or
+            non-hex character)
+    */
+    int get_codepoint()
+    {
+        // this function only makes sense after reading `\u`
+        JSON_ASSERT(current == 'u');
+        int codepoint = 0;
+
+        const auto factors = { 12u, 8u, 4u, 0u };
+        for (const auto factor : factors)
+        {
+            get();
+
+            if (current >= '0' && current <= '9')
+            {
+                codepoint += static_cast<int>((static_cast<unsigned int>(current) - 0x30u) << factor);
+            }
+            else if (current >= 'A' && current <= 'F')
+            {
+                codepoint += static_cast<int>((static_cast<unsigned int>(current) - 0x37u) << factor);
+            }
+            else if (current >= 'a' && current <= 'f')
+            {
+                codepoint += static_cast<int>((static_cast<unsigned int>(current) - 0x57u) << factor);
+            }
+            else
+            {
+                return -1;
+            }
+        }
+
+        JSON_ASSERT(0x0000 <= codepoint && codepoint <= 0xFFFF);
+        return codepoint;
+    }
+
+    /*!
+    @brief check if the next byte(s) are inside a given range
+
+    Adds the current byte and, for each passed range, reads a new byte and
+    checks if it is inside the range. If a violation was detected, set up an
+    error message and return false. Otherwise, return true.
+
+    @param[in] ranges  list of integers; interpreted as list of pairs of
+                       inclusive lower and upper bound, respectively
+
+    @pre The passed list @a ranges must have 2, 4, or 6 elements; that is,
+         1, 2, or 3 pairs. This precondition is enforced by an assertion.
+
+    @return true if and only if no range violation was detected
+    */
+    bool next_byte_in_range(std::initializer_list<char_int_type> ranges)
+    {
+        JSON_ASSERT(ranges.size() == 2 || ranges.size() == 4 || ranges.size() == 6);
+        add(current);
+
+        for (auto range = ranges.begin(); range != ranges.end(); ++range)
+        {
+            get();
+            if (JSON_HEDLEY_LIKELY(*range <= current && current <= *(++range))) // NOLINT(bugprone-inc-dec-in-conditions)
+            {
+                add(current);
+            }
+            else
+            {
+                error_message = "invalid string: ill-formed UTF-8 byte";
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    /*!
+    @brief scan a string literal
+
+    This function scans a string according to Sect. 7 of RFC 8259. While
+    scanning, bytes are escaped and copied into buffer token_buffer. Then the
+    function returns successfully, token_buffer is *not* null-terminated (as it
+    may contain \0 bytes), and token_buffer.size() is the number of bytes in the
+    string.
+
+    @return token_type::value_string if string could be successfully scanned,
+            token_type::parse_error otherwise
+
+    @note In case of errors, variable error_message contains a textual
+          description.
+    */
+    token_type scan_string()
+    {
+        // reset token_buffer (ignore opening quote)
+        reset();
+
+        // we entered the function by reading an open quote
+        JSON_ASSERT(current == '\"');
+
+        while (true)
+        {
+            // get next character
+            switch (get())
+            {
+                // end of file while parsing string
+                case char_traits<char_type>::eof():
+                {
+                    error_message = "invalid string: missing closing quote";
+                    return token_type::parse_error;
+                }
+
+                // closing quote
+                case '\"':
+                {
+                    return token_type::value_string;
+                }
+
+                // escapes
+                case '\\':
+                {
+                    switch (get())
+                    {
+                        // quotation mark
+                        case '\"':
+                            add('\"');
+                            break;
+                        // reverse solidus
+                        case '\\':
+                            add('\\');
+                            break;
+                        // solidus
+                        case '/':
+                            add('/');
+                            break;
+                        // backspace
+                        case 'b':
+                            add('\b');
+                            break;
+                        // form feed
+                        case 'f':
+                            add('\f');
+                            break;
+                        // line feed
+                        case 'n':
+                            add('\n');
+                            break;
+                        // carriage return
+                        case 'r':
+                            add('\r');
+                            break;
+                        // tab
+                        case 't':
+                            add('\t');
+                            break;
+
+                        // unicode escapes
+                        case 'u':
+                        {
+                            const int codepoint1 = get_codepoint();
+                            int codepoint = codepoint1; // start with codepoint1
+
+                            if (JSON_HEDLEY_UNLIKELY(codepoint1 == -1))
+                            {
+                                error_message = "invalid string: '\\u' must be followed by 4 hex digits";
+                                return token_type::parse_error;
+                            }
+
+                            // check if code point is a high surrogate
+                            if (0xD800 <= codepoint1 && codepoint1 <= 0xDBFF)
+                            {
+                                // expect next \uxxxx entry
+                                if (JSON_HEDLEY_LIKELY(get() == '\\' && get() == 'u'))
+                                {
+                                    const int codepoint2 = get_codepoint();
+
+                                    if (JSON_HEDLEY_UNLIKELY(codepoint2 == -1))
+                                    {
+                                        error_message = "invalid string: '\\u' must be followed by 4 hex digits";
+                                        return token_type::parse_error;
+                                    }
+
+                                    // check if codepoint2 is a low surrogate
+                                    if (JSON_HEDLEY_LIKELY(0xDC00 <= codepoint2 && codepoint2 <= 0xDFFF))
+                                    {
+                                        // overwrite codepoint
+                                        codepoint = static_cast<int>(
+                                                        // high surrogate occupies the most significant 22 bits
+                                                        (static_cast<unsigned int>(codepoint1) << 10u)
+                                                        // low surrogate occupies the least significant 15 bits
+                                                        + static_cast<unsigned int>(codepoint2)
+                                                        // there is still the 0xD800, 0xDC00 and 0x10000 noise
+                                                        // in the result, so we have to subtract with:
+                                                        // (0xD800 << 10) + DC00 - 0x10000 = 0x35FDC00
+                                                        - 0x35FDC00u);
+                                    }
+                                    else
+                                    {
+                                        error_message = "invalid string: surrogate U+D800..U+DBFF must be followed by U+DC00..U+DFFF";
+                                        return token_type::parse_error;
+                                    }
+                                }
+                                else
+                                {
+                                    error_message = "invalid string: surrogate U+D800..U+DBFF must be followed by U+DC00..U+DFFF";
+                                    return token_type::parse_error;
+                                }
+                            }
+                            else
+                            {
+                                if (JSON_HEDLEY_UNLIKELY(0xDC00 <= codepoint1 && codepoint1 <= 0xDFFF))
+                                {
+                                    error_message = "invalid string: surrogate U+DC00..U+DFFF must follow U+D800..U+DBFF";
+                                    return token_type::parse_error;
+                                }
+                            }
+
+                            // result of the above calculation yields a proper codepoint
+                            JSON_ASSERT(0x00 <= codepoint && codepoint <= 0x10FFFF);
+
+                            // translate codepoint into bytes
+                            if (codepoint < 0x80)
+                            {
+                                // 1-byte characters: 0xxxxxxx (ASCII)
+                                add(static_cast<char_int_type>(codepoint));
+                            }
+                            else if (codepoint <= 0x7FF)
+                            {
+                                // 2-byte characters: 110xxxxx 10xxxxxx
+                                add(static_cast<char_int_type>(0xC0u | (static_cast<unsigned int>(codepoint) >> 6u)));
+                                add(static_cast<char_int_type>(0x80u | (static_cast<unsigned int>(codepoint) & 0x3Fu)));
+                            }
+                            else if (codepoint <= 0xFFFF)
+                            {
+                                // 3-byte characters: 1110xxxx 10xxxxxx 10xxxxxx
+                                add(static_cast<char_int_type>(0xE0u | (static_cast<unsigned int>(codepoint) >> 12u)));
+                                add(static_cast<char_int_type>(0x80u | ((static_cast<unsigned int>(codepoint) >> 6u) & 0x3Fu)));
+                                add(static_cast<char_int_type>(0x80u | (static_cast<unsigned int>(codepoint) & 0x3Fu)));
+                            }
+                            else
+                            {
+                                // 4-byte characters: 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
+                                add(static_cast<char_int_type>(0xF0u | (static_cast<unsigned int>(codepoint) >> 18u)));
+                                add(static_cast<char_int_type>(0x80u | ((static_cast<unsigned int>(codepoint) >> 12u) & 0x3Fu)));
+                                add(static_cast<char_int_type>(0x80u | ((static_cast<unsigned int>(codepoint) >> 6u) & 0x3Fu)));
+                                add(static_cast<char_int_type>(0x80u | (static_cast<unsigned int>(codepoint) & 0x3Fu)));
+                            }
+
+                            break;
+                        }
+
+                        // other characters after escape
+                        default:
+                            error_message = "invalid string: forbidden character after backslash";
+                            return token_type::parse_error;
+                    }
+
+                    break;
+                }
+
+                // invalid control characters
+                case 0x00:
+                {
+                    error_message = "invalid string: control character U+0000 (NUL) must be escaped to \\u0000";
+                    return token_type::parse_error;
+                }
+
+                case 0x01:
+                {
+                    error_message = "invalid string: control character U+0001 (SOH) must be escaped to \\u0001";
+                    return token_type::parse_error;
+                }
+
+                case 0x02:
+                {
+                    error_message = "invalid string: control character U+0002 (STX) must be escaped to \\u0002";
+                    return token_type::parse_error;
+                }
+
+                case 0x03:
+                {
+                    error_message = "invalid string: control character U+0003 (ETX) must be escaped to \\u0003";
+                    return token_type::parse_error;
+                }
+
+                case 0x04:
+                {
+                    error_message = "invalid string: control character U+0004 (EOT) must be escaped to \\u0004";
+                    return token_type::parse_error;
+                }
+
+                case 0x05:
+                {
+                    error_message = "invalid string: control character U+0005 (ENQ) must be escaped to \\u0005";
+                    return token_type::parse_error;
+                }
+
+                case 0x06:
+                {
+                    error_message = "invalid string: control character U+0006 (ACK) must be escaped to \\u0006";
+                    return token_type::parse_error;
+                }
+
+                case 0x07:
+                {
+                    error_message = "invalid string: control character U+0007 (BEL) must be escaped to \\u0007";
+                    return token_type::parse_error;
+                }
+
+                case 0x08:
+                {
+                    error_message = "invalid string: control character U+0008 (BS) must be escaped to \\u0008 or \\b";
+                    return token_type::parse_error;
+                }
+
+                case 0x09:
+                {
+                    error_message = "invalid string: control character U+0009 (HT) must be escaped to \\u0009 or \\t";
+                    return token_type::parse_error;
+                }
+
+                case 0x0A:
+                {
+                    error_message = "invalid string: control character U+000A (LF) must be escaped to \\u000A or \\n";
+                    return token_type::parse_error;
+                }
+
+                case 0x0B:
+                {
+                    error_message = "invalid string: control character U+000B (VT) must be escaped to \\u000B";
+                    return token_type::parse_error;
+                }
+
+                case 0x0C:
+                {
+                    error_message = "invalid string: control character U+000C (FF) must be escaped to \\u000C or \\f";
+                    return token_type::parse_error;
+                }
+
+                case 0x0D:
+                {
+                    error_message = "invalid string: control character U+000D (CR) must be escaped to \\u000D or \\r";
+                    return token_type::parse_error;
+                }
+
+                case 0x0E:
+                {
+                    error_message = "invalid string: control character U+000E (SO) must be escaped to \\u000E";
+                    return token_type::parse_error;
+                }
+
+                case 0x0F:
+                {
+                    error_message = "invalid string: control character U+000F (SI) must be escaped to \\u000F";
+                    return token_type::parse_error;
+                }
+
+                case 0x10:
+                {
+                    error_message = "invalid string: control character U+0010 (DLE) must be escaped to \\u0010";
+                    return token_type::parse_error;
+                }
+
+                case 0x11:
+                {
+                    error_message = "invalid string: control character U+0011 (DC1) must be escaped to \\u0011";
+                    return token_type::parse_error;
+                }
+
+                case 0x12:
+                {
+                    error_message = "invalid string: control character U+0012 (DC2) must be escaped to \\u0012";
+                    return token_type::parse_error;
+                }
+
+                case 0x13:
+                {
+                    error_message = "invalid string: control character U+0013 (DC3) must be escaped to \\u0013";
+                    return token_type::parse_error;
+                }
+
+                case 0x14:
+                {
+                    error_message = "invalid string: control character U+0014 (DC4) must be escaped to \\u0014";
+                    return token_type::parse_error;
+                }
+
+                case 0x15:
+                {
+                    error_message = "invalid string: control character U+0015 (NAK) must be escaped to \\u0015";
+                    return token_type::parse_error;
+                }
+
+                case 0x16:
+                {
+                    error_message = "invalid string: control character U+0016 (SYN) must be escaped to \\u0016";
+                    return token_type::parse_error;
+                }
+
+                case 0x17:
+                {
+                    error_message = "invalid string: control character U+0017 (ETB) must be escaped to \\u0017";
+                    return token_type::parse_error;
+                }
+
+                case 0x18:
+                {
+                    error_message = "invalid string: control character U+0018 (CAN) must be escaped to \\u0018";
+                    return token_type::parse_error;
+                }
+
+                case 0x19:
+                {
+                    error_message = "invalid string: control character U+0019 (EM) must be escaped to \\u0019";
+                    return token_type::parse_error;
+                }
+
+                case 0x1A:
+                {
+                    error_message = "invalid string: control character U+001A (SUB) must be escaped to \\u001A";
+                    return token_type::parse_error;
+                }
+
+                case 0x1B:
+                {
+                    error_message = "invalid string: control character U+001B (ESC) must be escaped to \\u001B";
+                    return token_type::parse_error;
+                }
+
+                case 0x1C:
+                {
+                    error_message = "invalid string: control character U+001C (FS) must be escaped to \\u001C";
+                    return token_type::parse_error;
+                }
+
+                case 0x1D:
+                {
+                    error_message = "invalid string: control character U+001D (GS) must be escaped to \\u001D";
+                    return token_type::parse_error;
+                }
+
+                case 0x1E:
+                {
+                    error_message = "invalid string: control character U+001E (RS) must be escaped to \\u001E";
+                    return token_type::parse_error;
+                }
+
+                case 0x1F:
+                {
+                    error_message = "invalid string: control character U+001F (US) must be escaped to \\u001F";
+                    return token_type::parse_error;
+                }
+
+                // U+0020..U+007F (except U+0022 (quote) and U+005C (backspace))
+                case 0x20:
+                case 0x21:
+                case 0x23:
+                case 0x24:
+                case 0x25:
+                case 0x26:
+                case 0x27:
+                case 0x28:
+                case 0x29:
+                case 0x2A:
+                case 0x2B:
+                case 0x2C:
+                case 0x2D:
+                case 0x2E:
+                case 0x2F:
+                case 0x30:
+                case 0x31:
+                case 0x32:
+                case 0x33:
+                case 0x34:
+                case 0x35:
+                case 0x36:
+                case 0x37:
+                case 0x38:
+                case 0x39:
+                case 0x3A:
+                case 0x3B:
+                case 0x3C:
+                case 0x3D:
+                case 0x3E:
+                case 0x3F:
+                case 0x40:
+                case 0x41:
+                case 0x42:
+                case 0x43:
+                case 0x44:
+                case 0x45:
+                case 0x46:
+                case 0x47:
+                case 0x48:
+                case 0x49:
+                case 0x4A:
+                case 0x4B:
+                case 0x4C:
+                case 0x4D:
+                case 0x4E:
+                case 0x4F:
+                case 0x50:
+                case 0x51:
+                case 0x52:
+                case 0x53:
+                case 0x54:
+                case 0x55:
+                case 0x56:
+                case 0x57:
+                case 0x58:
+                case 0x59:
+                case 0x5A:
+                case 0x5B:
+                case 0x5D:
+                case 0x5E:
+                case 0x5F:
+                case 0x60:
+                case 0x61:
+                case 0x62:
+                case 0x63:
+                case 0x64:
+                case 0x65:
+                case 0x66:
+                case 0x67:
+                case 0x68:
+                case 0x69:
+                case 0x6A:
+                case 0x6B:
+                case 0x6C:
+                case 0x6D:
+                case 0x6E:
+                case 0x6F:
+                case 0x70:
+                case 0x71:
+                case 0x72:
+                case 0x73:
+                case 0x74:
+                case 0x75:
+                case 0x76:
+                case 0x77:
+                case 0x78:
+                case 0x79:
+                case 0x7A:
+                case 0x7B:
+                case 0x7C:
+                case 0x7D:
+                case 0x7E:
+                case 0x7F:
+                {
+                    add(current);
+                    break;
+                }
+
+                // U+0080..U+07FF: bytes C2..DF 80..BF
+                case 0xC2:
+                case 0xC3:
+                case 0xC4:
+                case 0xC5:
+                case 0xC6:
+                case 0xC7:
+                case 0xC8:
+                case 0xC9:
+                case 0xCA:
+                case 0xCB:
+                case 0xCC:
+                case 0xCD:
+                case 0xCE:
+                case 0xCF:
+                case 0xD0:
+                case 0xD1:
+                case 0xD2:
+                case 0xD3:
+                case 0xD4:
+                case 0xD5:
+                case 0xD6:
+                case 0xD7:
+                case 0xD8:
+                case 0xD9:
+                case 0xDA:
+                case 0xDB:
+                case 0xDC:
+                case 0xDD:
+                case 0xDE:
+                case 0xDF:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!next_byte_in_range({0x80, 0xBF})))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+0800..U+0FFF: bytes E0 A0..BF 80..BF
+                case 0xE0:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0xA0, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+1000..U+CFFF: bytes E1..EC 80..BF 80..BF
+                // U+E000..U+FFFF: bytes EE..EF 80..BF 80..BF
+                case 0xE1:
+                case 0xE2:
+                case 0xE3:
+                case 0xE4:
+                case 0xE5:
+                case 0xE6:
+                case 0xE7:
+                case 0xE8:
+                case 0xE9:
+                case 0xEA:
+                case 0xEB:
+                case 0xEC:
+                case 0xEE:
+                case 0xEF:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x80, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+D000..U+D7FF: bytes ED 80..9F 80..BF
+                case 0xED:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x80, 0x9F, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+10000..U+3FFFF F0 90..BF 80..BF 80..BF
+                case 0xF0:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x90, 0xBF, 0x80, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+40000..U+FFFFF F1..F3 80..BF 80..BF 80..BF
+                case 0xF1:
+                case 0xF2:
+                case 0xF3:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x80, 0xBF, 0x80, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+100000..U+10FFFF F4 80..8F 80..BF 80..BF
+                case 0xF4:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!(next_byte_in_range({0x80, 0x8F, 0x80, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // remaining bytes (80..C1 and F5..FF) are ill-formed
+                default:
+                {
+                    error_message = "invalid string: ill-formed UTF-8 byte";
+                    return token_type::parse_error;
+                }
+            }
+        }
+    }
+
+    /*!
+     * @brief scan a comment
+     * @return whether comment could be scanned successfully
+     */
+    bool scan_comment()
+    {
+        switch (get())
+        {
+            // single-line comments skip input until a newline or EOF is read
+            case '/':
+            {
+                while (true)
+                {
+                    switch (get())
+                    {
+                        case '\n':
+                        case '\r':
+                        case char_traits<char_type>::eof():
+                        case '\0':
+                            return true;
+
+                        default:
+                            break;
+                    }
+                }
+            }
+
+            // multi-line comments skip input until */ is read
+            case '*':
+            {
+                while (true)
+                {
+                    switch (get())
+                    {
+                        case char_traits<char_type>::eof():
+                        case '\0':
+                        {
+                            error_message = "invalid comment; missing closing '*/'";
+                            return false;
+                        }
+
+                        case '*':
+                        {
+                            switch (get())
+                            {
+                                case '/':
+                                    return true;
+
+                                default:
+                                {
+                                    unget();
+                                    continue;
+                                }
+                            }
+                        }
+
+                        default:
+                            continue;
+                    }
+                }
+            }
+
+            // unexpected character after reading '/'
+            default:
+            {
+                error_message = "invalid comment; expecting '/' or '*' after '/'";
+                return false;
+            }
+        }
+    }
+
+    JSON_HEDLEY_NON_NULL(2)
+    static void strtof(float& f, const char* str, char** endptr) noexcept
+    {
+        f = std::strtof(str, endptr);
+    }
+
+    JSON_HEDLEY_NON_NULL(2)
+    static void strtof(double& f, const char* str, char** endptr) noexcept
+    {
+        f = std::strtod(str, endptr);
+    }
+
+    JSON_HEDLEY_NON_NULL(2)
+    static void strtof(long double& f, const char* str, char** endptr) noexcept
+    {
+        f = std::strtold(str, endptr);
+    }
+
+    /*!
+    @brief scan a number literal
+
+    This function scans a string according to Sect. 6 of RFC 8259.
+
+    The function is realized with a deterministic finite state machine derived
+    from the grammar described in RFC 8259. Starting in state "init", the
+    input is read and used to determined the next state. Only state "done"
+    accepts the number. State "error" is a trap state to model errors. In the
+    table below, "anything" means any character but the ones listed before.
+
+    state    | 0        | 1-9      | e E      | +       | -       | .        | anything
+    ---------|----------|----------|----------|---------|---------|----------|-----------
+    init     | zero     | any1     | [error]  | [error] | minus   | [error]  | [error]
+    minus    | zero     | any1     | [error]  | [error] | [error] | [error]  | [error]
+    zero     | done     | done     | exponent | done    | done    | decimal1 | done
+    any1     | any1     | any1     | exponent | done    | done    | decimal1 | done
+    decimal1 | decimal2 | decimal2 | [error]  | [error] | [error] | [error]  | [error]
+    decimal2 | decimal2 | decimal2 | exponent | done    | done    | done     | done
+    exponent | any2     | any2     | [error]  | sign    | sign    | [error]  | [error]
+    sign     | any2     | any2     | [error]  | [error] | [error] | [error]  | [error]
+    any2     | any2     | any2     | done     | done    | done    | done     | done
+
+    The state machine is realized with one label per state (prefixed with
+    "scan_number_") and `goto` statements between them. The state machine
+    contains cycles, but any cycle can be left when EOF is read. Therefore,
+    the function is guaranteed to terminate.
+
+    During scanning, the read bytes are stored in token_buffer. This string is
+    then converted to a signed integer, an unsigned integer, or a
+    floating-point number.
+
+    @return token_type::value_unsigned, token_type::value_integer, or
+            token_type::value_float if number could be successfully scanned,
+            token_type::parse_error otherwise
+
+    @note The scanner is independent of the current locale. Internally, the
+          locale's decimal point is used instead of `.` to work with the
+          locale-dependent converters.
+    */
+    token_type scan_number()  // lgtm [cpp/use-of-goto]
+    {
+        // reset token_buffer to store the number's bytes
+        reset();
+
+        // the type of the parsed number; initially set to unsigned; will be
+        // changed if minus sign, decimal point or exponent is read
+        token_type number_type = token_type::value_unsigned;
+
+        // state (init): we just found out we need to scan a number
+        switch (current)
+        {
+            case '-':
+            {
+                add(current);
+                goto scan_number_minus;
+            }
+
+            case '0':
+            {
+                add(current);
+                goto scan_number_zero;
+            }
+
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any1;
+            }
+
+            // all other characters are rejected outside scan_number()
+            default:            // LCOV_EXCL_LINE
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+        }
+
+scan_number_minus:
+        // state: we just parsed a leading minus sign
+        number_type = token_type::value_integer;
+        switch (get())
+        {
+            case '0':
+            {
+                add(current);
+                goto scan_number_zero;
+            }
+
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any1;
+            }
+
+            default:
+            {
+                error_message = "invalid number; expected digit after '-'";
+                return token_type::parse_error;
+            }
+        }
+
+scan_number_zero:
+        // state: we just parse a zero (maybe with a leading minus sign)
+        switch (get())
+        {
+            case '.':
+            {
+                add(decimal_point_char);
+                goto scan_number_decimal1;
+            }
+
+            case 'e':
+            case 'E':
+            {
+                add(current);
+                goto scan_number_exponent;
+            }
+
+            default:
+                goto scan_number_done;
+        }
+
+scan_number_any1:
+        // state: we just parsed a number 0-9 (maybe with a leading minus sign)
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any1;
+            }
+
+            case '.':
+            {
+                add(decimal_point_char);
+                goto scan_number_decimal1;
+            }
+
+            case 'e':
+            case 'E':
+            {
+                add(current);
+                goto scan_number_exponent;
+            }
+
+            default:
+                goto scan_number_done;
+        }
+
+scan_number_decimal1:
+        // state: we just parsed a decimal point
+        number_type = token_type::value_float;
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_decimal2;
+            }
+
+            default:
+            {
+                error_message = "invalid number; expected digit after '.'";
+                return token_type::parse_error;
+            }
+        }
+
+scan_number_decimal2:
+        // we just parsed at least one number after a decimal point
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_decimal2;
+            }
+
+            case 'e':
+            case 'E':
+            {
+                add(current);
+                goto scan_number_exponent;
+            }
+
+            default:
+                goto scan_number_done;
+        }
+
+scan_number_exponent:
+        // we just parsed an exponent
+        number_type = token_type::value_float;
+        switch (get())
+        {
+            case '+':
+            case '-':
+            {
+                add(current);
+                goto scan_number_sign;
+            }
+
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any2;
+            }
+
+            default:
+            {
+                error_message =
+                    "invalid number; expected '+', '-', or digit after exponent";
+                return token_type::parse_error;
+            }
+        }
+
+scan_number_sign:
+        // we just parsed an exponent sign
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any2;
+            }
+
+            default:
+            {
+                error_message = "invalid number; expected digit after exponent sign";
+                return token_type::parse_error;
+            }
+        }
+
+scan_number_any2:
+        // we just parsed a number after the exponent or exponent sign
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any2;
+            }
+
+            default:
+                goto scan_number_done;
+        }
+
+scan_number_done:
+        // unget the character after the number (we only read it to know that
+        // we are done scanning a number)
+        unget();
+
+        char* endptr = nullptr; // NOLINT(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+        errno = 0;
+
+        // try to parse integers first and fall back to floats
+        if (number_type == token_type::value_unsigned)
+        {
+            const auto x = std::strtoull(token_buffer.data(), &endptr, 10);
+
+            // we checked the number format before
+            JSON_ASSERT(endptr == token_buffer.data() + token_buffer.size());
+
+            if (errno == 0)
+            {
+                value_unsigned = static_cast<number_unsigned_t>(x);
+                if (value_unsigned == x)
+                {
+                    return token_type::value_unsigned;
+                }
+            }
+        }
+        else if (number_type == token_type::value_integer)
+        {
+            const auto x = std::strtoll(token_buffer.data(), &endptr, 10);
+
+            // we checked the number format before
+            JSON_ASSERT(endptr == token_buffer.data() + token_buffer.size());
+
+            if (errno == 0)
+            {
+                value_integer = static_cast<number_integer_t>(x);
+                if (value_integer == x)
+                {
+                    return token_type::value_integer;
+                }
+            }
+        }
+
+        // this code is reached if we parse a floating-point number or if an
+        // integer conversion above failed
+        strtof(value_float, token_buffer.data(), &endptr);
+
+        // we checked the number format before
+        JSON_ASSERT(endptr == token_buffer.data() + token_buffer.size());
+
+        return token_type::value_float;
+    }
+
+    /*!
+    @param[in] literal_text  the literal text to expect
+    @param[in] length        the length of the passed literal text
+    @param[in] return_type   the token type to return on success
+    */
+    JSON_HEDLEY_NON_NULL(2)
+    token_type scan_literal(const char_type* literal_text, const std::size_t length,
+                            token_type return_type)
+    {
+        JSON_ASSERT(char_traits<char_type>::to_char_type(current) == literal_text[0]);
+        for (std::size_t i = 1; i < length; ++i)
+        {
+            if (JSON_HEDLEY_UNLIKELY(char_traits<char_type>::to_char_type(get()) != literal_text[i]))
+            {
+                error_message = "invalid literal";
+                return token_type::parse_error;
+            }
+        }
+        return return_type;
+    }
+
+    /////////////////////
+    // input management
+    /////////////////////
+
+    /// reset token_buffer; current character is beginning of token
+    void reset() noexcept
+    {
+        token_buffer.clear();
+        token_string.clear();
+        token_string.push_back(char_traits<char_type>::to_char_type(current));
+    }
+
+    /*
+    @brief get next character from the input
+
+    This function provides the interface to the used input adapter. It does
+    not throw in case the input reached EOF, but returns a
+    `char_traits<char>::eof()` in that case.  Stores the scanned characters
+    for use in error messages.
+
+    @return character read from the input
+    */
+    char_int_type get()
+    {
+        ++position.chars_read_total;
+        ++position.chars_read_current_line;
+
+        if (next_unget)
+        {
+            // just reset the next_unget variable and work with current
+            next_unget = false;
+        }
+        else
+        {
+            current = ia.get_character();
+        }
+
+        if (JSON_HEDLEY_LIKELY(current != char_traits<char_type>::eof()))
+        {
+            token_string.push_back(char_traits<char_type>::to_char_type(current));
+        }
+
+        if (current == '\n')
+        {
+            ++position.lines_read;
+            position.chars_read_current_line = 0;
+        }
+
+        return current;
+    }
+
+    /*!
+    @brief unget current character (read it again on next get)
+
+    We implement unget by setting variable next_unget to true. The input is not
+    changed - we just simulate ungetting by modifying chars_read_total,
+    chars_read_current_line, and token_string. The next call to get() will
+    behave as if the unget character is read again.
+    */
+    void unget()
+    {
+        next_unget = true;
+
+        --position.chars_read_total;
+
+        // in case we "unget" a newline, we have to also decrement the lines_read
+        if (position.chars_read_current_line == 0)
+        {
+            if (position.lines_read > 0)
+            {
+                --position.lines_read;
+            }
+        }
+        else
+        {
+            --position.chars_read_current_line;
+        }
+
+        if (JSON_HEDLEY_LIKELY(current != char_traits<char_type>::eof()))
+        {
+            JSON_ASSERT(!token_string.empty());
+            token_string.pop_back();
+        }
+    }
+
+    /// add a character to token_buffer
+    void add(char_int_type c)
+    {
+        token_buffer.push_back(static_cast<typename string_t::value_type>(c));
+    }
+
+  public:
+    /////////////////////
+    // value getters
+    /////////////////////
+
+    /// return integer value
+    constexpr number_integer_t get_number_integer() const noexcept
+    {
+        return value_integer;
+    }
+
+    /// return unsigned integer value
+    constexpr number_unsigned_t get_number_unsigned() const noexcept
+    {
+        return value_unsigned;
+    }
+
+    /// return floating-point value
+    constexpr number_float_t get_number_float() const noexcept
+    {
+        return value_float;
+    }
+
+    /// return current string value (implicitly resets the token; useful only once)
+    string_t& get_string()
+    {
+        return token_buffer;
+    }
+
+    /////////////////////
+    // diagnostics
+    /////////////////////
+
+    /// return position of last read token
+    constexpr position_t get_position() const noexcept
+    {
+        return position;
+    }
+
+    /// return the last read token (for errors only).  Will never contain EOF
+    /// (an arbitrary value that is not a valid char value, often -1), because
+    /// 255 may legitimately occur.  May contain NUL, which should be escaped.
+    std::string get_token_string() const
+    {
+        // escape control characters
+        std::string result;
+        for (const auto c : token_string)
+        {
+            if (static_cast<unsigned char>(c) <= '\x1F')
+            {
+                // escape control characters
+                std::array<char, 9> cs{{}};
+                static_cast<void>((std::snprintf)(cs.data(), cs.size(), "<U+%.4X>", static_cast<unsigned char>(c))); // NOLINT(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+                result += cs.data();
+            }
+            else
+            {
+                // add character as is
+                result.push_back(static_cast<std::string::value_type>(c));
+            }
+        }
+
+        return result;
+    }
+
+    /// return syntax error message
+    JSON_HEDLEY_RETURNS_NON_NULL
+    constexpr const char* get_error_message() const noexcept
+    {
+        return error_message;
+    }
+
+    /////////////////////
+    // actual scanner
+    /////////////////////
+
+    /*!
+    @brief skip the UTF-8 byte order mark
+    @return true iff there is no BOM or the correct BOM has been skipped
+    */
+    bool skip_bom()
+    {
+        if (get() == 0xEF)
+        {
+            // check if we completely parse the BOM
+            return get() == 0xBB && get() == 0xBF;
+        }
+
+        // the first character is not the beginning of the BOM; unget it to
+        // process is later
+        unget();
+        return true;
+    }
+
+    void skip_whitespace()
+    {
+        do
+        {
+            get();
+        }
+        while (current == ' ' || current == '\t' || current == '\n' || current == '\r');
+    }
+
+    token_type scan()
+    {
+        // initially, skip the BOM
+        if (position.chars_read_total == 0 && !skip_bom())
+        {
+            error_message = "invalid BOM; must be 0xEF 0xBB 0xBF if given";
+            return token_type::parse_error;
+        }
+
+        // read next character and ignore whitespace
+        skip_whitespace();
+
+        // ignore comments
+        while (ignore_comments && current == '/')
+        {
+            if (!scan_comment())
+            {
+                return token_type::parse_error;
+            }
+
+            // skip following whitespace
+            skip_whitespace();
+        }
+
+        switch (current)
+        {
+            // structural characters
+            case '[':
+                return token_type::begin_array;
+            case ']':
+                return token_type::end_array;
+            case '{':
+                return token_type::begin_object;
+            case '}':
+                return token_type::end_object;
+            case ':':
+                return token_type::name_separator;
+            case ',':
+                return token_type::value_separator;
+
+            // literals
+            case 't':
+            {
+                std::array<char_type, 4> true_literal = {{static_cast<char_type>('t'), static_cast<char_type>('r'), static_cast<char_type>('u'), static_cast<char_type>('e')}};
+                return scan_literal(true_literal.data(), true_literal.size(), token_type::literal_true);
+            }
+            case 'f':
+            {
+                std::array<char_type, 5> false_literal = {{static_cast<char_type>('f'), static_cast<char_type>('a'), static_cast<char_type>('l'), static_cast<char_type>('s'), static_cast<char_type>('e')}};
+                return scan_literal(false_literal.data(), false_literal.size(), token_type::literal_false);
+            }
+            case 'n':
+            {
+                std::array<char_type, 4> null_literal = {{static_cast<char_type>('n'), static_cast<char_type>('u'), static_cast<char_type>('l'), static_cast<char_type>('l')}};
+                return scan_literal(null_literal.data(), null_literal.size(), token_type::literal_null);
+            }
+
+            // string
+            case '\"':
+                return scan_string();
+
+            // number
+            case '-':
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+                return scan_number();
+
+            // end of input (the null byte is needed when parsing from
+            // string literals)
+            case '\0':
+            case char_traits<char_type>::eof():
+                return token_type::end_of_input;
+
+            // error
+            default:
+                error_message = "invalid literal";
+                return token_type::parse_error;
+        }
+    }
+
+  private:
+    /// input adapter
+    InputAdapterType ia;
+
+    /// whether comments should be ignored (true) or signaled as errors (false)
+    const bool ignore_comments = false;
+
+    /// the current character
+    char_int_type current = char_traits<char_type>::eof();
+
+    /// whether the next get() call should just return current
+    bool next_unget = false;
+
+    /// the start position of the current token
+    position_t position {};
+
+    /// raw input token string (for error messages)
+    std::vector<char_type> token_string {};
+
+    /// buffer for variable-length tokens (numbers, strings)
+    string_t token_buffer {};
+
+    /// a description of occurred lexer errors
+    const char* error_message = "";
+
+    // number values
+    number_integer_t value_integer = 0;
+    number_unsigned_t value_unsigned = 0;
+    number_float_t value_float = 0;
+
+    /// the decimal point
+    const char_int_type decimal_point_char = '.';
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/is_sax.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstdint> // size_t
+#include <utility> // declval
+#include <string> // string
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+// #include <nlohmann/detail/meta/detected.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename T>
+using null_function_t = decltype(std::declval<T&>().null());
+
+template<typename T>
+using boolean_function_t =
+    decltype(std::declval<T&>().boolean(std::declval<bool>()));
+
+template<typename T, typename Integer>
+using number_integer_function_t =
+    decltype(std::declval<T&>().number_integer(std::declval<Integer>()));
+
+template<typename T, typename Unsigned>
+using number_unsigned_function_t =
+    decltype(std::declval<T&>().number_unsigned(std::declval<Unsigned>()));
+
+template<typename T, typename Float, typename String>
+using number_float_function_t = decltype(std::declval<T&>().number_float(
+                                    std::declval<Float>(), std::declval<const String&>()));
+
+template<typename T, typename String>
+using string_function_t =
+    decltype(std::declval<T&>().string(std::declval<String&>()));
+
+template<typename T, typename Binary>
+using binary_function_t =
+    decltype(std::declval<T&>().binary(std::declval<Binary&>()));
+
+template<typename T>
+using start_object_function_t =
+    decltype(std::declval<T&>().start_object(std::declval<std::size_t>()));
+
+template<typename T, typename String>
+using key_function_t =
+    decltype(std::declval<T&>().key(std::declval<String&>()));
+
+template<typename T>
+using end_object_function_t = decltype(std::declval<T&>().end_object());
+
+template<typename T>
+using start_array_function_t =
+    decltype(std::declval<T&>().start_array(std::declval<std::size_t>()));
+
+template<typename T>
+using end_array_function_t = decltype(std::declval<T&>().end_array());
+
+template<typename T, typename Exception>
+using parse_error_function_t = decltype(std::declval<T&>().parse_error(
+        std::declval<std::size_t>(), std::declval<const std::string&>(),
+        std::declval<const Exception&>()));
+
+template<typename SAX, typename BasicJsonType>
+struct is_sax
+{
+  private:
+    static_assert(is_basic_json<BasicJsonType>::value,
+                  "BasicJsonType must be of type basic_json<...>");
+
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+    using exception_t = typename BasicJsonType::exception;
+
+  public:
+    static constexpr bool value =
+        is_detected_exact<bool, null_function_t, SAX>::value &&
+        is_detected_exact<bool, boolean_function_t, SAX>::value &&
+        is_detected_exact<bool, number_integer_function_t, SAX, number_integer_t>::value &&
+        is_detected_exact<bool, number_unsigned_function_t, SAX, number_unsigned_t>::value &&
+        is_detected_exact<bool, number_float_function_t, SAX, number_float_t, string_t>::value &&
+        is_detected_exact<bool, string_function_t, SAX, string_t>::value &&
+        is_detected_exact<bool, binary_function_t, SAX, binary_t>::value &&
+        is_detected_exact<bool, start_object_function_t, SAX>::value &&
+        is_detected_exact<bool, key_function_t, SAX, string_t>::value &&
+        is_detected_exact<bool, end_object_function_t, SAX>::value &&
+        is_detected_exact<bool, start_array_function_t, SAX>::value &&
+        is_detected_exact<bool, end_array_function_t, SAX>::value &&
+        is_detected_exact<bool, parse_error_function_t, SAX, exception_t>::value;
+};
+
+template<typename SAX, typename BasicJsonType>
+struct is_sax_static_asserts
+{
+  private:
+    static_assert(is_basic_json<BasicJsonType>::value,
+                  "BasicJsonType must be of type basic_json<...>");
+
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+    using exception_t = typename BasicJsonType::exception;
+
+  public:
+    static_assert(is_detected_exact<bool, null_function_t, SAX>::value,
+                  "Missing/invalid function: bool null()");
+    static_assert(is_detected_exact<bool, boolean_function_t, SAX>::value,
+                  "Missing/invalid function: bool boolean(bool)");
+    static_assert(is_detected_exact<bool, boolean_function_t, SAX>::value,
+                  "Missing/invalid function: bool boolean(bool)");
+    static_assert(
+        is_detected_exact<bool, number_integer_function_t, SAX,
+        number_integer_t>::value,
+        "Missing/invalid function: bool number_integer(number_integer_t)");
+    static_assert(
+        is_detected_exact<bool, number_unsigned_function_t, SAX,
+        number_unsigned_t>::value,
+        "Missing/invalid function: bool number_unsigned(number_unsigned_t)");
+    static_assert(is_detected_exact<bool, number_float_function_t, SAX,
+                  number_float_t, string_t>::value,
+                  "Missing/invalid function: bool number_float(number_float_t, const string_t&)");
+    static_assert(
+        is_detected_exact<bool, string_function_t, SAX, string_t>::value,
+        "Missing/invalid function: bool string(string_t&)");
+    static_assert(
+        is_detected_exact<bool, binary_function_t, SAX, binary_t>::value,
+        "Missing/invalid function: bool binary(binary_t&)");
+    static_assert(is_detected_exact<bool, start_object_function_t, SAX>::value,
+                  "Missing/invalid function: bool start_object(std::size_t)");
+    static_assert(is_detected_exact<bool, key_function_t, SAX, string_t>::value,
+                  "Missing/invalid function: bool key(string_t&)");
+    static_assert(is_detected_exact<bool, end_object_function_t, SAX>::value,
+                  "Missing/invalid function: bool end_object()");
+    static_assert(is_detected_exact<bool, start_array_function_t, SAX>::value,
+                  "Missing/invalid function: bool start_array(std::size_t)");
+    static_assert(is_detected_exact<bool, end_array_function_t, SAX>::value,
+                  "Missing/invalid function: bool end_array()");
+    static_assert(
+        is_detected_exact<bool, parse_error_function_t, SAX, exception_t>::value,
+        "Missing/invalid function: bool parse_error(std::size_t, const "
+        "std::string&, const exception&)");
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/// how to treat CBOR tags
+enum class cbor_tag_handler_t
+{
+    error,   ///< throw a parse_error exception in case of a tag
+    ignore,  ///< ignore tags
+    store    ///< store tags as binary type
+};
+
+/*!
+@brief determine system byte order
+
+@return true if and only if system's byte order is little endian
+
+@note from https://stackoverflow.com/a/1001328/266378
+*/
+static inline bool little_endianness(int num = 1) noexcept
+{
+    return *reinterpret_cast<char*>(&num) == 1;
+}
+
+///////////////////
+// binary reader //
+///////////////////
+
+/*!
+@brief deserialization of CBOR, MessagePack, and UBJSON values
+*/
+template<typename BasicJsonType, typename InputAdapterType, typename SAX = json_sax_dom_parser<BasicJsonType>>
+class binary_reader
+{
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+    using json_sax_t = SAX;
+    using char_type = typename InputAdapterType::char_type;
+    using char_int_type = typename char_traits<char_type>::int_type;
+
+  public:
+    /*!
+    @brief create a binary reader
+
+    @param[in] adapter  input adapter to read from
+    */
+    explicit binary_reader(InputAdapterType&& adapter, const input_format_t format = input_format_t::json) noexcept : ia(std::move(adapter)), input_format(format)
+    {
+        (void)detail::is_sax_static_asserts<SAX, BasicJsonType> {};
+    }
+
+    // make class move-only
+    binary_reader(const binary_reader&) = delete;
+    binary_reader(binary_reader&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    binary_reader& operator=(const binary_reader&) = delete;
+    binary_reader& operator=(binary_reader&&) = default; // NOLINT(hicpp-noexcept-move,performance-noexcept-move-constructor)
+    ~binary_reader() = default;
+
+    /*!
+    @param[in] format  the binary format to parse
+    @param[in] sax_    a SAX event processor
+    @param[in] strict  whether to expect the input to be consumed completed
+    @param[in] tag_handler  how to treat CBOR tags
+
+    @return whether parsing was successful
+    */
+    JSON_HEDLEY_NON_NULL(3)
+    bool sax_parse(const input_format_t format,
+                   json_sax_t* sax_,
+                   const bool strict = true,
+                   const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error)
+    {
+        sax = sax_;
+        bool result = false;
+
+        switch (format)
+        {
+            case input_format_t::bson:
+                result = parse_bson_internal();
+                break;
+
+            case input_format_t::cbor:
+                result = parse_cbor_internal(true, tag_handler);
+                break;
+
+            case input_format_t::msgpack:
+                result = parse_msgpack_internal();
+                break;
+
+            case input_format_t::ubjson:
+            case input_format_t::bjdata:
+                result = parse_ubjson_internal();
+                break;
+
+            case input_format_t::json: // LCOV_EXCL_LINE
+            default:            // LCOV_EXCL_LINE
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+        }
+
+        // strict mode: next byte must be EOF
+        if (result && strict)
+        {
+            if (input_format == input_format_t::ubjson || input_format == input_format_t::bjdata)
+            {
+                get_ignore_noop();
+            }
+            else
+            {
+                get();
+            }
+
+            if (JSON_HEDLEY_UNLIKELY(current != char_traits<char_type>::eof()))
+            {
+                return sax->parse_error(chars_read, get_token_string(), parse_error::create(110, chars_read,
+                                        exception_message(input_format, concat("expected end of input; last byte: 0x", get_token_string()), "value"), nullptr));
+            }
+        }
+
+        return result;
+    }
+
+  private:
+    //////////
+    // BSON //
+    //////////
+
+    /*!
+    @brief Reads in a BSON-object and passes it to the SAX-parser.
+    @return whether a valid BSON-value was passed to the SAX parser
+    */
+    bool parse_bson_internal()
+    {
+        std::int32_t document_size{};
+        get_number<std::int32_t, true>(input_format_t::bson, document_size);
+
+        if (JSON_HEDLEY_UNLIKELY(!sax->start_object(static_cast<std::size_t>(-1))))
+        {
+            return false;
+        }
+
+        if (JSON_HEDLEY_UNLIKELY(!parse_bson_element_list(/*is_array*/false)))
+        {
+            return false;
+        }
+
+        return sax->end_object();
+    }
+
+    /*!
+    @brief Parses a C-style string from the BSON input.
+    @param[in,out] result  A reference to the string variable where the read
+                            string is to be stored.
+    @return `true` if the \x00-byte indicating the end of the string was
+             encountered before the EOF; false` indicates an unexpected EOF.
+    */
+    bool get_bson_cstr(string_t& result)
+    {
+        auto out = std::back_inserter(result);
+        while (true)
+        {
+            get();
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::bson, "cstring")))
+            {
+                return false;
+            }
+            if (current == 0x00)
+            {
+                return true;
+            }
+            *out++ = static_cast<typename string_t::value_type>(current);
+        }
+    }
+
+    /*!
+    @brief Parses a zero-terminated string of length @a len from the BSON
+           input.
+    @param[in] len  The length (including the zero-byte at the end) of the
+                    string to be read.
+    @param[in,out] result  A reference to the string variable where the read
+                            string is to be stored.
+    @tparam NumberType The type of the length @a len
+    @pre len >= 1
+    @return `true` if the string was successfully parsed
+    */
+    template<typename NumberType>
+    bool get_bson_string(const NumberType len, string_t& result)
+    {
+        if (JSON_HEDLEY_UNLIKELY(len < 1))
+        {
+            auto last_token = get_token_string();
+            return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                    exception_message(input_format_t::bson, concat("string length must be at least 1, is ", std::to_string(len)), "string"), nullptr));
+        }
+
+        return get_string(input_format_t::bson, len - static_cast<NumberType>(1), result) && get() != char_traits<char_type>::eof();
+    }
+
+    /*!
+    @brief Parses a byte array input of length @a len from the BSON input.
+    @param[in] len  The length of the byte array to be read.
+    @param[in,out] result  A reference to the binary variable where the read
+                            array is to be stored.
+    @tparam NumberType The type of the length @a len
+    @pre len >= 0
+    @return `true` if the byte array was successfully parsed
+    */
+    template<typename NumberType>
+    bool get_bson_binary(const NumberType len, binary_t& result)
+    {
+        if (JSON_HEDLEY_UNLIKELY(len < 0))
+        {
+            auto last_token = get_token_string();
+            return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                    exception_message(input_format_t::bson, concat("byte array length cannot be negative, is ", std::to_string(len)), "binary"), nullptr));
+        }
+
+        // All BSON binary values have a subtype
+        std::uint8_t subtype{};
+        get_number<std::uint8_t>(input_format_t::bson, subtype);
+        result.set_subtype(subtype);
+
+        return get_binary(input_format_t::bson, len, result);
+    }
+
+    /*!
+    @brief Read a BSON document element of the given @a element_type.
+    @param[in] element_type The BSON element type, c.f. http://bsonspec.org/spec.html
+    @param[in] element_type_parse_position The position in the input stream,
+               where the `element_type` was read.
+    @warning Not all BSON element types are supported yet. An unsupported
+             @a element_type will give rise to a parse_error.114:
+             Unsupported BSON record type 0x...
+    @return whether a valid BSON-object/array was passed to the SAX parser
+    */
+    bool parse_bson_element_internal(const char_int_type element_type,
+                                     const std::size_t element_type_parse_position)
+    {
+        switch (element_type)
+        {
+            case 0x01: // double
+            {
+                double number{};
+                return get_number<double, true>(input_format_t::bson, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 0x02: // string
+            {
+                std::int32_t len{};
+                string_t value;
+                return get_number<std::int32_t, true>(input_format_t::bson, len) && get_bson_string(len, value) && sax->string(value);
+            }
+
+            case 0x03: // object
+            {
+                return parse_bson_internal();
+            }
+
+            case 0x04: // array
+            {
+                return parse_bson_array();
+            }
+
+            case 0x05: // binary
+            {
+                std::int32_t len{};
+                binary_t value;
+                return get_number<std::int32_t, true>(input_format_t::bson, len) && get_bson_binary(len, value) && sax->binary(value);
+            }
+
+            case 0x08: // boolean
+            {
+                return sax->boolean(get() != 0);
+            }
+
+            case 0x0A: // null
+            {
+                return sax->null();
+            }
+
+            case 0x10: // int32
+            {
+                std::int32_t value{};
+                return get_number<std::int32_t, true>(input_format_t::bson, value) && sax->number_integer(value);
+            }
+
+            case 0x12: // int64
+            {
+                std::int64_t value{};
+                return get_number<std::int64_t, true>(input_format_t::bson, value) && sax->number_integer(value);
+            }
+
+            default: // anything else not supported (yet)
+            {
+                std::array<char, 3> cr{{}};
+                static_cast<void>((std::snprintf)(cr.data(), cr.size(), "%.2hhX", static_cast<unsigned char>(element_type))); // NOLINT(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+                const std::string cr_str{cr.data()};
+                return sax->parse_error(element_type_parse_position, cr_str,
+                                        parse_error::create(114, element_type_parse_position, concat("Unsupported BSON record type 0x", cr_str), nullptr));
+            }
+        }
+    }
+
+    /*!
+    @brief Read a BSON element list (as specified in the BSON-spec)
+
+    The same binary layout is used for objects and arrays, hence it must be
+    indicated with the argument @a is_array which one is expected
+    (true --> array, false --> object).
+
+    @param[in] is_array Determines if the element list being read is to be
+                        treated as an object (@a is_array == false), or as an
+                        array (@a is_array == true).
+    @return whether a valid BSON-object/array was passed to the SAX parser
+    */
+    bool parse_bson_element_list(const bool is_array)
+    {
+        string_t key;
+
+        while (auto element_type = get())
+        {
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::bson, "element list")))
+            {
+                return false;
+            }
+
+            const std::size_t element_type_parse_position = chars_read;
+            if (JSON_HEDLEY_UNLIKELY(!get_bson_cstr(key)))
+            {
+                return false;
+            }
+
+            if (!is_array && !sax->key(key))
+            {
+                return false;
+            }
+
+            if (JSON_HEDLEY_UNLIKELY(!parse_bson_element_internal(element_type, element_type_parse_position)))
+            {
+                return false;
+            }
+
+            // get_bson_cstr only appends
+            key.clear();
+        }
+
+        return true;
+    }
+
+    /*!
+    @brief Reads an array from the BSON input and passes it to the SAX-parser.
+    @return whether a valid BSON-array was passed to the SAX parser
+    */
+    bool parse_bson_array()
+    {
+        std::int32_t document_size{};
+        get_number<std::int32_t, true>(input_format_t::bson, document_size);
+
+        if (JSON_HEDLEY_UNLIKELY(!sax->start_array(static_cast<std::size_t>(-1))))
+        {
+            return false;
+        }
+
+        if (JSON_HEDLEY_UNLIKELY(!parse_bson_element_list(/*is_array*/true)))
+        {
+            return false;
+        }
+
+        return sax->end_array();
+    }
+
+    //////////
+    // CBOR //
+    //////////
+
+    /*!
+    @param[in] get_char  whether a new character should be retrieved from the
+                         input (true) or whether the last read character should
+                         be considered instead (false)
+    @param[in] tag_handler how CBOR tags should be treated
+
+    @return whether a valid CBOR value was passed to the SAX parser
+    */
+    bool parse_cbor_internal(const bool get_char,
+                             const cbor_tag_handler_t tag_handler)
+    {
+        switch (get_char ? get() : current)
+        {
+            // EOF
+            case char_traits<char_type>::eof():
+                return unexpect_eof(input_format_t::cbor, "value");
+
+            // Integer 0x00..0x17 (0..23)
+            case 0x00:
+            case 0x01:
+            case 0x02:
+            case 0x03:
+            case 0x04:
+            case 0x05:
+            case 0x06:
+            case 0x07:
+            case 0x08:
+            case 0x09:
+            case 0x0A:
+            case 0x0B:
+            case 0x0C:
+            case 0x0D:
+            case 0x0E:
+            case 0x0F:
+            case 0x10:
+            case 0x11:
+            case 0x12:
+            case 0x13:
+            case 0x14:
+            case 0x15:
+            case 0x16:
+            case 0x17:
+                return sax->number_unsigned(static_cast<number_unsigned_t>(current));
+
+            case 0x18: // Unsigned integer (one-byte uint8_t follows)
+            {
+                std::uint8_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_unsigned(number);
+            }
+
+            case 0x19: // Unsigned integer (two-byte uint16_t follows)
+            {
+                std::uint16_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_unsigned(number);
+            }
+
+            case 0x1A: // Unsigned integer (four-byte uint32_t follows)
+            {
+                std::uint32_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_unsigned(number);
+            }
+
+            case 0x1B: // Unsigned integer (eight-byte uint64_t follows)
+            {
+                std::uint64_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_unsigned(number);
+            }
+
+            // Negative integer -1-0x00..-1-0x17 (-1..-24)
+            case 0x20:
+            case 0x21:
+            case 0x22:
+            case 0x23:
+            case 0x24:
+            case 0x25:
+            case 0x26:
+            case 0x27:
+            case 0x28:
+            case 0x29:
+            case 0x2A:
+            case 0x2B:
+            case 0x2C:
+            case 0x2D:
+            case 0x2E:
+            case 0x2F:
+            case 0x30:
+            case 0x31:
+            case 0x32:
+            case 0x33:
+            case 0x34:
+            case 0x35:
+            case 0x36:
+            case 0x37:
+                return sax->number_integer(static_cast<std::int8_t>(0x20 - 1 - current));
+
+            case 0x38: // Negative integer (one-byte uint8_t follows)
+            {
+                std::uint8_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_integer(static_cast<number_integer_t>(-1) - number);
+            }
+
+            case 0x39: // Negative integer -1-n (two-byte uint16_t follows)
+            {
+                std::uint16_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_integer(static_cast<number_integer_t>(-1) - number);
+            }
+
+            case 0x3A: // Negative integer -1-n (four-byte uint32_t follows)
+            {
+                std::uint32_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_integer(static_cast<number_integer_t>(-1) - number);
+            }
+
+            case 0x3B: // Negative integer -1-n (eight-byte uint64_t follows)
+            {
+                std::uint64_t number{};
+                return get_number(input_format_t::cbor, number) && sax->number_integer(static_cast<number_integer_t>(-1)
+                        - static_cast<number_integer_t>(number));
+            }
+
+            // Binary data (0x00..0x17 bytes follow)
+            case 0x40:
+            case 0x41:
+            case 0x42:
+            case 0x43:
+            case 0x44:
+            case 0x45:
+            case 0x46:
+            case 0x47:
+            case 0x48:
+            case 0x49:
+            case 0x4A:
+            case 0x4B:
+            case 0x4C:
+            case 0x4D:
+            case 0x4E:
+            case 0x4F:
+            case 0x50:
+            case 0x51:
+            case 0x52:
+            case 0x53:
+            case 0x54:
+            case 0x55:
+            case 0x56:
+            case 0x57:
+            case 0x58: // Binary data (one-byte uint8_t for n follows)
+            case 0x59: // Binary data (two-byte uint16_t for n follow)
+            case 0x5A: // Binary data (four-byte uint32_t for n follow)
+            case 0x5B: // Binary data (eight-byte uint64_t for n follow)
+            case 0x5F: // Binary data (indefinite length)
+            {
+                binary_t b;
+                return get_cbor_binary(b) && sax->binary(b);
+            }
+
+            // UTF-8 string (0x00..0x17 bytes follow)
+            case 0x60:
+            case 0x61:
+            case 0x62:
+            case 0x63:
+            case 0x64:
+            case 0x65:
+            case 0x66:
+            case 0x67:
+            case 0x68:
+            case 0x69:
+            case 0x6A:
+            case 0x6B:
+            case 0x6C:
+            case 0x6D:
+            case 0x6E:
+            case 0x6F:
+            case 0x70:
+            case 0x71:
+            case 0x72:
+            case 0x73:
+            case 0x74:
+            case 0x75:
+            case 0x76:
+            case 0x77:
+            case 0x78: // UTF-8 string (one-byte uint8_t for n follows)
+            case 0x79: // UTF-8 string (two-byte uint16_t for n follow)
+            case 0x7A: // UTF-8 string (four-byte uint32_t for n follow)
+            case 0x7B: // UTF-8 string (eight-byte uint64_t for n follow)
+            case 0x7F: // UTF-8 string (indefinite length)
+            {
+                string_t s;
+                return get_cbor_string(s) && sax->string(s);
+            }
+
+            // array (0x00..0x17 data items follow)
+            case 0x80:
+            case 0x81:
+            case 0x82:
+            case 0x83:
+            case 0x84:
+            case 0x85:
+            case 0x86:
+            case 0x87:
+            case 0x88:
+            case 0x89:
+            case 0x8A:
+            case 0x8B:
+            case 0x8C:
+            case 0x8D:
+            case 0x8E:
+            case 0x8F:
+            case 0x90:
+            case 0x91:
+            case 0x92:
+            case 0x93:
+            case 0x94:
+            case 0x95:
+            case 0x96:
+            case 0x97:
+                return get_cbor_array(
+                           conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x1Fu), tag_handler);
+
+            case 0x98: // array (one-byte uint8_t for n follows)
+            {
+                std::uint8_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_array(static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0x99: // array (two-byte uint16_t for n follow)
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_array(static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0x9A: // array (four-byte uint32_t for n follow)
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_array(conditional_static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0x9B: // array (eight-byte uint64_t for n follow)
+            {
+                std::uint64_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_array(conditional_static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0x9F: // array (indefinite length)
+                return get_cbor_array(static_cast<std::size_t>(-1), tag_handler);
+
+            // map (0x00..0x17 pairs of data items follow)
+            case 0xA0:
+            case 0xA1:
+            case 0xA2:
+            case 0xA3:
+            case 0xA4:
+            case 0xA5:
+            case 0xA6:
+            case 0xA7:
+            case 0xA8:
+            case 0xA9:
+            case 0xAA:
+            case 0xAB:
+            case 0xAC:
+            case 0xAD:
+            case 0xAE:
+            case 0xAF:
+            case 0xB0:
+            case 0xB1:
+            case 0xB2:
+            case 0xB3:
+            case 0xB4:
+            case 0xB5:
+            case 0xB6:
+            case 0xB7:
+                return get_cbor_object(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x1Fu), tag_handler);
+
+            case 0xB8: // map (one-byte uint8_t for n follows)
+            {
+                std::uint8_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_object(static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0xB9: // map (two-byte uint16_t for n follow)
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_object(static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0xBA: // map (four-byte uint32_t for n follow)
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_object(conditional_static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0xBB: // map (eight-byte uint64_t for n follow)
+            {
+                std::uint64_t len{};
+                return get_number(input_format_t::cbor, len) && get_cbor_object(conditional_static_cast<std::size_t>(len), tag_handler);
+            }
+
+            case 0xBF: // map (indefinite length)
+                return get_cbor_object(static_cast<std::size_t>(-1), tag_handler);
+
+            case 0xC6: // tagged item
+            case 0xC7:
+            case 0xC8:
+            case 0xC9:
+            case 0xCA:
+            case 0xCB:
+            case 0xCC:
+            case 0xCD:
+            case 0xCE:
+            case 0xCF:
+            case 0xD0:
+            case 0xD1:
+            case 0xD2:
+            case 0xD3:
+            case 0xD4:
+            case 0xD8: // tagged item (1 bytes follow)
+            case 0xD9: // tagged item (2 bytes follow)
+            case 0xDA: // tagged item (4 bytes follow)
+            case 0xDB: // tagged item (8 bytes follow)
+            {
+                switch (tag_handler)
+                {
+                    case cbor_tag_handler_t::error:
+                    {
+                        auto last_token = get_token_string();
+                        return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                                exception_message(input_format_t::cbor, concat("invalid byte: 0x", last_token), "value"), nullptr));
+                    }
+
+                    case cbor_tag_handler_t::ignore:
+                    {
+                        // ignore binary subtype
+                        switch (current)
+                        {
+                            case 0xD8:
+                            {
+                                std::uint8_t subtype_to_ignore{};
+                                get_number(input_format_t::cbor, subtype_to_ignore);
+                                break;
+                            }
+                            case 0xD9:
+                            {
+                                std::uint16_t subtype_to_ignore{};
+                                get_number(input_format_t::cbor, subtype_to_ignore);
+                                break;
+                            }
+                            case 0xDA:
+                            {
+                                std::uint32_t subtype_to_ignore{};
+                                get_number(input_format_t::cbor, subtype_to_ignore);
+                                break;
+                            }
+                            case 0xDB:
+                            {
+                                std::uint64_t subtype_to_ignore{};
+                                get_number(input_format_t::cbor, subtype_to_ignore);
+                                break;
+                            }
+                            default:
+                                break;
+                        }
+                        return parse_cbor_internal(true, tag_handler);
+                    }
+
+                    case cbor_tag_handler_t::store:
+                    {
+                        binary_t b;
+                        // use binary subtype and store in binary container
+                        switch (current)
+                        {
+                            case 0xD8:
+                            {
+                                std::uint8_t subtype{};
+                                get_number(input_format_t::cbor, subtype);
+                                b.set_subtype(detail::conditional_static_cast<typename binary_t::subtype_type>(subtype));
+                                break;
+                            }
+                            case 0xD9:
+                            {
+                                std::uint16_t subtype{};
+                                get_number(input_format_t::cbor, subtype);
+                                b.set_subtype(detail::conditional_static_cast<typename binary_t::subtype_type>(subtype));
+                                break;
+                            }
+                            case 0xDA:
+                            {
+                                std::uint32_t subtype{};
+                                get_number(input_format_t::cbor, subtype);
+                                b.set_subtype(detail::conditional_static_cast<typename binary_t::subtype_type>(subtype));
+                                break;
+                            }
+                            case 0xDB:
+                            {
+                                std::uint64_t subtype{};
+                                get_number(input_format_t::cbor, subtype);
+                                b.set_subtype(detail::conditional_static_cast<typename binary_t::subtype_type>(subtype));
+                                break;
+                            }
+                            default:
+                                return parse_cbor_internal(true, tag_handler);
+                        }
+                        get();
+                        return get_cbor_binary(b) && sax->binary(b);
+                    }
+
+                    default:                 // LCOV_EXCL_LINE
+                        JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+                        return false;        // LCOV_EXCL_LINE
+                }
+            }
+
+            case 0xF4: // false
+                return sax->boolean(false);
+
+            case 0xF5: // true
+                return sax->boolean(true);
+
+            case 0xF6: // null
+                return sax->null();
+
+            case 0xF9: // Half-Precision Float (two-byte IEEE 754)
+            {
+                const auto byte1_raw = get();
+                if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "number")))
+                {
+                    return false;
+                }
+                const auto byte2_raw = get();
+                if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "number")))
+                {
+                    return false;
+                }
+
+                const auto byte1 = static_cast<unsigned char>(byte1_raw);
+                const auto byte2 = static_cast<unsigned char>(byte2_raw);
+
+                // code from RFC 7049, Appendix D, Figure 3:
+                // As half-precision floating-point numbers were only added
+                // to IEEE 754 in 2008, today's programming platforms often
+                // still only have limited support for them. It is very
+                // easy to include at least decoding support for them even
+                // without such support. An example of a small decoder for
+                // half-precision floating-point numbers in the C language
+                // is shown in Fig. 3.
+                const auto half = static_cast<unsigned int>((byte1 << 8u) + byte2);
+                const double val = [&half]
+                {
+                    const int exp = (half >> 10u) & 0x1Fu;
+                    const unsigned int mant = half & 0x3FFu;
+                    JSON_ASSERT(0 <= exp&& exp <= 32);
+                    JSON_ASSERT(mant <= 1024);
+                    switch (exp)
+                    {
+                        case 0:
+                            return std::ldexp(mant, -24);
+                        case 31:
+                            return (mant == 0)
+                            ? std::numeric_limits<double>::infinity()
+                            : std::numeric_limits<double>::quiet_NaN();
+                        default:
+                            return std::ldexp(mant + 1024, exp - 25);
+                    }
+                }();
+                return sax->number_float((half & 0x8000u) != 0
+                                         ? static_cast<number_float_t>(-val)
+                                         : static_cast<number_float_t>(val), "");
+            }
+
+            case 0xFA: // Single-Precision Float (four-byte IEEE 754)
+            {
+                float number{};
+                return get_number(input_format_t::cbor, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 0xFB: // Double-Precision Float (eight-byte IEEE 754)
+            {
+                double number{};
+                return get_number(input_format_t::cbor, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            default: // anything else (0xFF is handled inside the other types)
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                        exception_message(input_format_t::cbor, concat("invalid byte: 0x", last_token), "value"), nullptr));
+            }
+        }
+    }
+
+    /*!
+    @brief reads a CBOR string
+
+    This function first reads starting bytes to determine the expected
+    string length and then copies this number of bytes into a string.
+    Additionally, CBOR's strings with indefinite lengths are supported.
+
+    @param[out] result  created string
+
+    @return whether string creation completed
+    */
+    bool get_cbor_string(string_t& result)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "string")))
+        {
+            return false;
+        }
+
+        switch (current)
+        {
+            // UTF-8 string (0x00..0x17 bytes follow)
+            case 0x60:
+            case 0x61:
+            case 0x62:
+            case 0x63:
+            case 0x64:
+            case 0x65:
+            case 0x66:
+            case 0x67:
+            case 0x68:
+            case 0x69:
+            case 0x6A:
+            case 0x6B:
+            case 0x6C:
+            case 0x6D:
+            case 0x6E:
+            case 0x6F:
+            case 0x70:
+            case 0x71:
+            case 0x72:
+            case 0x73:
+            case 0x74:
+            case 0x75:
+            case 0x76:
+            case 0x77:
+            {
+                return get_string(input_format_t::cbor, static_cast<unsigned int>(current) & 0x1Fu, result);
+            }
+
+            case 0x78: // UTF-8 string (one-byte uint8_t for n follows)
+            {
+                std::uint8_t len{};
+                return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result);
+            }
+
+            case 0x79: // UTF-8 string (two-byte uint16_t for n follow)
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result);
+            }
+
+            case 0x7A: // UTF-8 string (four-byte uint32_t for n follow)
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result);
+            }
+
+            case 0x7B: // UTF-8 string (eight-byte uint64_t for n follow)
+            {
+                std::uint64_t len{};
+                return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result);
+            }
+
+            case 0x7F: // UTF-8 string (indefinite length)
+            {
+                while (get() != 0xFF)
+                {
+                    string_t chunk;
+                    if (!get_cbor_string(chunk))
+                    {
+                        return false;
+                    }
+                    result.append(chunk);
+                }
+                return true;
+            }
+
+            default:
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read,
+                                        exception_message(input_format_t::cbor, concat("expected length specification (0x60-0x7B) or indefinite string type (0x7F); last byte: 0x", last_token), "string"), nullptr));
+            }
+        }
+    }
+
+    /*!
+    @brief reads a CBOR byte array
+
+    This function first reads starting bytes to determine the expected
+    byte array length and then copies this number of bytes into the byte array.
+    Additionally, CBOR's byte arrays with indefinite lengths are supported.
+
+    @param[out] result  created byte array
+
+    @return whether byte array creation completed
+    */
+    bool get_cbor_binary(binary_t& result)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "binary")))
+        {
+            return false;
+        }
+
+        switch (current)
+        {
+            // Binary data (0x00..0x17 bytes follow)
+            case 0x40:
+            case 0x41:
+            case 0x42:
+            case 0x43:
+            case 0x44:
+            case 0x45:
+            case 0x46:
+            case 0x47:
+            case 0x48:
+            case 0x49:
+            case 0x4A:
+            case 0x4B:
+            case 0x4C:
+            case 0x4D:
+            case 0x4E:
+            case 0x4F:
+            case 0x50:
+            case 0x51:
+            case 0x52:
+            case 0x53:
+            case 0x54:
+            case 0x55:
+            case 0x56:
+            case 0x57:
+            {
+                return get_binary(input_format_t::cbor, static_cast<unsigned int>(current) & 0x1Fu, result);
+            }
+
+            case 0x58: // Binary data (one-byte uint8_t for n follows)
+            {
+                std::uint8_t len{};
+                return get_number(input_format_t::cbor, len) &&
+                       get_binary(input_format_t::cbor, len, result);
+            }
+
+            case 0x59: // Binary data (two-byte uint16_t for n follow)
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::cbor, len) &&
+                       get_binary(input_format_t::cbor, len, result);
+            }
+
+            case 0x5A: // Binary data (four-byte uint32_t for n follow)
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::cbor, len) &&
+                       get_binary(input_format_t::cbor, len, result);
+            }
+
+            case 0x5B: // Binary data (eight-byte uint64_t for n follow)
+            {
+                std::uint64_t len{};
+                return get_number(input_format_t::cbor, len) &&
+                       get_binary(input_format_t::cbor, len, result);
+            }
+
+            case 0x5F: // Binary data (indefinite length)
+            {
+                while (get() != 0xFF)
+                {
+                    binary_t chunk;
+                    if (!get_cbor_binary(chunk))
+                    {
+                        return false;
+                    }
+                    result.insert(result.end(), chunk.begin(), chunk.end());
+                }
+                return true;
+            }
+
+            default:
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read,
+                                        exception_message(input_format_t::cbor, concat("expected length specification (0x40-0x5B) or indefinite binary array type (0x5F); last byte: 0x", last_token), "binary"), nullptr));
+            }
+        }
+    }
+
+    /*!
+    @param[in] len  the length of the array or static_cast<std::size_t>(-1) for an
+                    array of indefinite size
+    @param[in] tag_handler how CBOR tags should be treated
+    @return whether array creation completed
+    */
+    bool get_cbor_array(const std::size_t len,
+                        const cbor_tag_handler_t tag_handler)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!sax->start_array(len)))
+        {
+            return false;
+        }
+
+        if (len != static_cast<std::size_t>(-1))
+        {
+            for (std::size_t i = 0; i < len; ++i)
+            {
+                if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(true, tag_handler)))
+                {
+                    return false;
+                }
+            }
+        }
+        else
+        {
+            while (get() != 0xFF)
+            {
+                if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(false, tag_handler)))
+                {
+                    return false;
+                }
+            }
+        }
+
+        return sax->end_array();
+    }
+
+    /*!
+    @param[in] len  the length of the object or static_cast<std::size_t>(-1) for an
+                    object of indefinite size
+    @param[in] tag_handler how CBOR tags should be treated
+    @return whether object creation completed
+    */
+    bool get_cbor_object(const std::size_t len,
+                         const cbor_tag_handler_t tag_handler)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!sax->start_object(len)))
+        {
+            return false;
+        }
+
+        if (len != 0)
+        {
+            string_t key;
+            if (len != static_cast<std::size_t>(-1))
+            {
+                for (std::size_t i = 0; i < len; ++i)
+                {
+                    get();
+                    if (JSON_HEDLEY_UNLIKELY(!get_cbor_string(key) || !sax->key(key)))
+                    {
+                        return false;
+                    }
+
+                    if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(true, tag_handler)))
+                    {
+                        return false;
+                    }
+                    key.clear();
+                }
+            }
+            else
+            {
+                while (get() != 0xFF)
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!get_cbor_string(key) || !sax->key(key)))
+                    {
+                        return false;
+                    }
+
+                    if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(true, tag_handler)))
+                    {
+                        return false;
+                    }
+                    key.clear();
+                }
+            }
+        }
+
+        return sax->end_object();
+    }
+
+    /////////////
+    // MsgPack //
+    /////////////
+
+    /*!
+    @return whether a valid MessagePack value was passed to the SAX parser
+    */
+    bool parse_msgpack_internal()
+    {
+        switch (get())
+        {
+            // EOF
+            case char_traits<char_type>::eof():
+                return unexpect_eof(input_format_t::msgpack, "value");
+
+            // positive fixint
+            case 0x00:
+            case 0x01:
+            case 0x02:
+            case 0x03:
+            case 0x04:
+            case 0x05:
+            case 0x06:
+            case 0x07:
+            case 0x08:
+            case 0x09:
+            case 0x0A:
+            case 0x0B:
+            case 0x0C:
+            case 0x0D:
+            case 0x0E:
+            case 0x0F:
+            case 0x10:
+            case 0x11:
+            case 0x12:
+            case 0x13:
+            case 0x14:
+            case 0x15:
+            case 0x16:
+            case 0x17:
+            case 0x18:
+            case 0x19:
+            case 0x1A:
+            case 0x1B:
+            case 0x1C:
+            case 0x1D:
+            case 0x1E:
+            case 0x1F:
+            case 0x20:
+            case 0x21:
+            case 0x22:
+            case 0x23:
+            case 0x24:
+            case 0x25:
+            case 0x26:
+            case 0x27:
+            case 0x28:
+            case 0x29:
+            case 0x2A:
+            case 0x2B:
+            case 0x2C:
+            case 0x2D:
+            case 0x2E:
+            case 0x2F:
+            case 0x30:
+            case 0x31:
+            case 0x32:
+            case 0x33:
+            case 0x34:
+            case 0x35:
+            case 0x36:
+            case 0x37:
+            case 0x38:
+            case 0x39:
+            case 0x3A:
+            case 0x3B:
+            case 0x3C:
+            case 0x3D:
+            case 0x3E:
+            case 0x3F:
+            case 0x40:
+            case 0x41:
+            case 0x42:
+            case 0x43:
+            case 0x44:
+            case 0x45:
+            case 0x46:
+            case 0x47:
+            case 0x48:
+            case 0x49:
+            case 0x4A:
+            case 0x4B:
+            case 0x4C:
+            case 0x4D:
+            case 0x4E:
+            case 0x4F:
+            case 0x50:
+            case 0x51:
+            case 0x52:
+            case 0x53:
+            case 0x54:
+            case 0x55:
+            case 0x56:
+            case 0x57:
+            case 0x58:
+            case 0x59:
+            case 0x5A:
+            case 0x5B:
+            case 0x5C:
+            case 0x5D:
+            case 0x5E:
+            case 0x5F:
+            case 0x60:
+            case 0x61:
+            case 0x62:
+            case 0x63:
+            case 0x64:
+            case 0x65:
+            case 0x66:
+            case 0x67:
+            case 0x68:
+            case 0x69:
+            case 0x6A:
+            case 0x6B:
+            case 0x6C:
+            case 0x6D:
+            case 0x6E:
+            case 0x6F:
+            case 0x70:
+            case 0x71:
+            case 0x72:
+            case 0x73:
+            case 0x74:
+            case 0x75:
+            case 0x76:
+            case 0x77:
+            case 0x78:
+            case 0x79:
+            case 0x7A:
+            case 0x7B:
+            case 0x7C:
+            case 0x7D:
+            case 0x7E:
+            case 0x7F:
+                return sax->number_unsigned(static_cast<number_unsigned_t>(current));
+
+            // fixmap
+            case 0x80:
+            case 0x81:
+            case 0x82:
+            case 0x83:
+            case 0x84:
+            case 0x85:
+            case 0x86:
+            case 0x87:
+            case 0x88:
+            case 0x89:
+            case 0x8A:
+            case 0x8B:
+            case 0x8C:
+            case 0x8D:
+            case 0x8E:
+            case 0x8F:
+                return get_msgpack_object(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x0Fu));
+
+            // fixarray
+            case 0x90:
+            case 0x91:
+            case 0x92:
+            case 0x93:
+            case 0x94:
+            case 0x95:
+            case 0x96:
+            case 0x97:
+            case 0x98:
+            case 0x99:
+            case 0x9A:
+            case 0x9B:
+            case 0x9C:
+            case 0x9D:
+            case 0x9E:
+            case 0x9F:
+                return get_msgpack_array(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x0Fu));
+
+            // fixstr
+            case 0xA0:
+            case 0xA1:
+            case 0xA2:
+            case 0xA3:
+            case 0xA4:
+            case 0xA5:
+            case 0xA6:
+            case 0xA7:
+            case 0xA8:
+            case 0xA9:
+            case 0xAA:
+            case 0xAB:
+            case 0xAC:
+            case 0xAD:
+            case 0xAE:
+            case 0xAF:
+            case 0xB0:
+            case 0xB1:
+            case 0xB2:
+            case 0xB3:
+            case 0xB4:
+            case 0xB5:
+            case 0xB6:
+            case 0xB7:
+            case 0xB8:
+            case 0xB9:
+            case 0xBA:
+            case 0xBB:
+            case 0xBC:
+            case 0xBD:
+            case 0xBE:
+            case 0xBF:
+            case 0xD9: // str 8
+            case 0xDA: // str 16
+            case 0xDB: // str 32
+            {
+                string_t s;
+                return get_msgpack_string(s) && sax->string(s);
+            }
+
+            case 0xC0: // nil
+                return sax->null();
+
+            case 0xC2: // false
+                return sax->boolean(false);
+
+            case 0xC3: // true
+                return sax->boolean(true);
+
+            case 0xC4: // bin 8
+            case 0xC5: // bin 16
+            case 0xC6: // bin 32
+            case 0xC7: // ext 8
+            case 0xC8: // ext 16
+            case 0xC9: // ext 32
+            case 0xD4: // fixext 1
+            case 0xD5: // fixext 2
+            case 0xD6: // fixext 4
+            case 0xD7: // fixext 8
+            case 0xD8: // fixext 16
+            {
+                binary_t b;
+                return get_msgpack_binary(b) && sax->binary(b);
+            }
+
+            case 0xCA: // float 32
+            {
+                float number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 0xCB: // float 64
+            {
+                double number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 0xCC: // uint 8
+            {
+                std::uint8_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_unsigned(number);
+            }
+
+            case 0xCD: // uint 16
+            {
+                std::uint16_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_unsigned(number);
+            }
+
+            case 0xCE: // uint 32
+            {
+                std::uint32_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_unsigned(number);
+            }
+
+            case 0xCF: // uint 64
+            {
+                std::uint64_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_unsigned(number);
+            }
+
+            case 0xD0: // int 8
+            {
+                std::int8_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_integer(number);
+            }
+
+            case 0xD1: // int 16
+            {
+                std::int16_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_integer(number);
+            }
+
+            case 0xD2: // int 32
+            {
+                std::int32_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_integer(number);
+            }
+
+            case 0xD3: // int 64
+            {
+                std::int64_t number{};
+                return get_number(input_format_t::msgpack, number) && sax->number_integer(number);
+            }
+
+            case 0xDC: // array 16
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::msgpack, len) && get_msgpack_array(static_cast<std::size_t>(len));
+            }
+
+            case 0xDD: // array 32
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::msgpack, len) && get_msgpack_array(conditional_static_cast<std::size_t>(len));
+            }
+
+            case 0xDE: // map 16
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::msgpack, len) && get_msgpack_object(static_cast<std::size_t>(len));
+            }
+
+            case 0xDF: // map 32
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::msgpack, len) && get_msgpack_object(conditional_static_cast<std::size_t>(len));
+            }
+
+            // negative fixint
+            case 0xE0:
+            case 0xE1:
+            case 0xE2:
+            case 0xE3:
+            case 0xE4:
+            case 0xE5:
+            case 0xE6:
+            case 0xE7:
+            case 0xE8:
+            case 0xE9:
+            case 0xEA:
+            case 0xEB:
+            case 0xEC:
+            case 0xED:
+            case 0xEE:
+            case 0xEF:
+            case 0xF0:
+            case 0xF1:
+            case 0xF2:
+            case 0xF3:
+            case 0xF4:
+            case 0xF5:
+            case 0xF6:
+            case 0xF7:
+            case 0xF8:
+            case 0xF9:
+            case 0xFA:
+            case 0xFB:
+            case 0xFC:
+            case 0xFD:
+            case 0xFE:
+            case 0xFF:
+                return sax->number_integer(static_cast<std::int8_t>(current));
+
+            default: // anything else
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                        exception_message(input_format_t::msgpack, concat("invalid byte: 0x", last_token), "value"), nullptr));
+            }
+        }
+    }
+
+    /*!
+    @brief reads a MessagePack string
+
+    This function first reads starting bytes to determine the expected
+    string length and then copies this number of bytes into a string.
+
+    @param[out] result  created string
+
+    @return whether string creation completed
+    */
+    bool get_msgpack_string(string_t& result)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::msgpack, "string")))
+        {
+            return false;
+        }
+
+        switch (current)
+        {
+            // fixstr
+            case 0xA0:
+            case 0xA1:
+            case 0xA2:
+            case 0xA3:
+            case 0xA4:
+            case 0xA5:
+            case 0xA6:
+            case 0xA7:
+            case 0xA8:
+            case 0xA9:
+            case 0xAA:
+            case 0xAB:
+            case 0xAC:
+            case 0xAD:
+            case 0xAE:
+            case 0xAF:
+            case 0xB0:
+            case 0xB1:
+            case 0xB2:
+            case 0xB3:
+            case 0xB4:
+            case 0xB5:
+            case 0xB6:
+            case 0xB7:
+            case 0xB8:
+            case 0xB9:
+            case 0xBA:
+            case 0xBB:
+            case 0xBC:
+            case 0xBD:
+            case 0xBE:
+            case 0xBF:
+            {
+                return get_string(input_format_t::msgpack, static_cast<unsigned int>(current) & 0x1Fu, result);
+            }
+
+            case 0xD9: // str 8
+            {
+                std::uint8_t len{};
+                return get_number(input_format_t::msgpack, len) && get_string(input_format_t::msgpack, len, result);
+            }
+
+            case 0xDA: // str 16
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::msgpack, len) && get_string(input_format_t::msgpack, len, result);
+            }
+
+            case 0xDB: // str 32
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::msgpack, len) && get_string(input_format_t::msgpack, len, result);
+            }
+
+            default:
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read,
+                                        exception_message(input_format_t::msgpack, concat("expected length specification (0xA0-0xBF, 0xD9-0xDB); last byte: 0x", last_token), "string"), nullptr));
+            }
+        }
+    }
+
+    /*!
+    @brief reads a MessagePack byte array
+
+    This function first reads starting bytes to determine the expected
+    byte array length and then copies this number of bytes into a byte array.
+
+    @param[out] result  created byte array
+
+    @return whether byte array creation completed
+    */
+    bool get_msgpack_binary(binary_t& result)
+    {
+        // helper function to set the subtype
+        auto assign_and_return_true = [&result](std::int8_t subtype)
+        {
+            result.set_subtype(static_cast<std::uint8_t>(subtype));
+            return true;
+        };
+
+        switch (current)
+        {
+            case 0xC4: // bin 8
+            {
+                std::uint8_t len{};
+                return get_number(input_format_t::msgpack, len) &&
+                       get_binary(input_format_t::msgpack, len, result);
+            }
+
+            case 0xC5: // bin 16
+            {
+                std::uint16_t len{};
+                return get_number(input_format_t::msgpack, len) &&
+                       get_binary(input_format_t::msgpack, len, result);
+            }
+
+            case 0xC6: // bin 32
+            {
+                std::uint32_t len{};
+                return get_number(input_format_t::msgpack, len) &&
+                       get_binary(input_format_t::msgpack, len, result);
+            }
+
+            case 0xC7: // ext 8
+            {
+                std::uint8_t len{};
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, len) &&
+                       get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, len, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xC8: // ext 16
+            {
+                std::uint16_t len{};
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, len) &&
+                       get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, len, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xC9: // ext 32
+            {
+                std::uint32_t len{};
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, len) &&
+                       get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, len, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xD4: // fixext 1
+            {
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, 1, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xD5: // fixext 2
+            {
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, 2, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xD6: // fixext 4
+            {
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, 4, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xD7: // fixext 8
+            {
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, 8, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            case 0xD8: // fixext 16
+            {
+                std::int8_t subtype{};
+                return get_number(input_format_t::msgpack, subtype) &&
+                       get_binary(input_format_t::msgpack, 16, result) &&
+                       assign_and_return_true(subtype);
+            }
+
+            default:           // LCOV_EXCL_LINE
+                return false;  // LCOV_EXCL_LINE
+        }
+    }
+
+    /*!
+    @param[in] len  the length of the array
+    @return whether array creation completed
+    */
+    bool get_msgpack_array(const std::size_t len)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!sax->start_array(len)))
+        {
+            return false;
+        }
+
+        for (std::size_t i = 0; i < len; ++i)
+        {
+            if (JSON_HEDLEY_UNLIKELY(!parse_msgpack_internal()))
+            {
+                return false;
+            }
+        }
+
+        return sax->end_array();
+    }
+
+    /*!
+    @param[in] len  the length of the object
+    @return whether object creation completed
+    */
+    bool get_msgpack_object(const std::size_t len)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!sax->start_object(len)))
+        {
+            return false;
+        }
+
+        string_t key;
+        for (std::size_t i = 0; i < len; ++i)
+        {
+            get();
+            if (JSON_HEDLEY_UNLIKELY(!get_msgpack_string(key) || !sax->key(key)))
+            {
+                return false;
+            }
+
+            if (JSON_HEDLEY_UNLIKELY(!parse_msgpack_internal()))
+            {
+                return false;
+            }
+            key.clear();
+        }
+
+        return sax->end_object();
+    }
+
+    ////////////
+    // UBJSON //
+    ////////////
+
+    /*!
+    @param[in] get_char  whether a new character should be retrieved from the
+                         input (true, default) or whether the last read
+                         character should be considered instead
+
+    @return whether a valid UBJSON value was passed to the SAX parser
+    */
+    bool parse_ubjson_internal(const bool get_char = true)
+    {
+        return get_ubjson_value(get_char ? get_ignore_noop() : current);
+    }
+
+    /*!
+    @brief reads a UBJSON string
+
+    This function is either called after reading the 'S' byte explicitly
+    indicating a string, or in case of an object key where the 'S' byte can be
+    left out.
+
+    @param[out] result   created string
+    @param[in] get_char  whether a new character should be retrieved from the
+                         input (true, default) or whether the last read
+                         character should be considered instead
+
+    @return whether string creation completed
+    */
+    bool get_ubjson_string(string_t& result, const bool get_char = true)
+    {
+        if (get_char)
+        {
+            get();  // TODO(niels): may we ignore N here?
+        }
+
+        if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "value")))
+        {
+            return false;
+        }
+
+        switch (current)
+        {
+            case 'U':
+            {
+                std::uint8_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'i':
+            {
+                std::int8_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'I':
+            {
+                std::int16_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'l':
+            {
+                std::int32_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'L':
+            {
+                std::int64_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'u':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint16_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'm':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint32_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            case 'M':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint64_t len{};
+                return get_number(input_format, len) && get_string(input_format, len, result);
+            }
+
+            default:
+                break;
+        }
+        auto last_token = get_token_string();
+        std::string message;
+
+        if (input_format != input_format_t::bjdata)
+        {
+            message = "expected length type specification (U, i, I, l, L); last byte: 0x" + last_token;
+        }
+        else
+        {
+            message = "expected length type specification (U, i, u, I, m, l, M, L); last byte: 0x" + last_token;
+        }
+        return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format, message, "string"), nullptr));
+    }
+
+    /*!
+    @param[out] dim  an integer vector storing the ND array dimensions
+    @return whether reading ND array size vector is successful
+    */
+    bool get_ubjson_ndarray_size(std::vector<size_t>& dim)
+    {
+        std::pair<std::size_t, char_int_type> size_and_type;
+        size_t dimlen = 0;
+        bool no_ndarray = true;
+
+        if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_type(size_and_type, no_ndarray)))
+        {
+            return false;
+        }
+
+        if (size_and_type.first != npos)
+        {
+            if (size_and_type.second != 0)
+            {
+                if (size_and_type.second != 'N')
+                {
+                    for (std::size_t i = 0; i < size_and_type.first; ++i)
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_value(dimlen, no_ndarray, size_and_type.second)))
+                        {
+                            return false;
+                        }
+                        dim.push_back(dimlen);
+                    }
+                }
+            }
+            else
+            {
+                for (std::size_t i = 0; i < size_and_type.first; ++i)
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_value(dimlen, no_ndarray)))
+                    {
+                        return false;
+                    }
+                    dim.push_back(dimlen);
+                }
+            }
+        }
+        else
+        {
+            while (current != ']')
+            {
+                if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_value(dimlen, no_ndarray, current)))
+                {
+                    return false;
+                }
+                dim.push_back(dimlen);
+                get_ignore_noop();
+            }
+        }
+        return true;
+    }
+
+    /*!
+    @param[out] result  determined size
+    @param[in,out] is_ndarray  for input, `true` means already inside an ndarray vector
+                               or ndarray dimension is not allowed; `false` means ndarray
+                               is allowed; for output, `true` means an ndarray is found;
+                               is_ndarray can only return `true` when its initial value
+                               is `false`
+    @param[in] prefix  type marker if already read, otherwise set to 0
+
+    @return whether size determination completed
+    */
+    bool get_ubjson_size_value(std::size_t& result, bool& is_ndarray, char_int_type prefix = 0)
+    {
+        if (prefix == 0)
+        {
+            prefix = get_ignore_noop();
+        }
+
+        switch (prefix)
+        {
+            case 'U':
+            {
+                std::uint8_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'i':
+            {
+                std::int8_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                if (number < 0)
+                {
+                    return sax->parse_error(chars_read, get_token_string(), parse_error::create(113, chars_read,
+                                            exception_message(input_format, "count in an optimized container must be positive", "size"), nullptr));
+                }
+                result = static_cast<std::size_t>(number); // NOLINT(bugprone-signed-char-misuse,cert-str34-c): number is not a char
+                return true;
+            }
+
+            case 'I':
+            {
+                std::int16_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                if (number < 0)
+                {
+                    return sax->parse_error(chars_read, get_token_string(), parse_error::create(113, chars_read,
+                                            exception_message(input_format, "count in an optimized container must be positive", "size"), nullptr));
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'l':
+            {
+                std::int32_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                if (number < 0)
+                {
+                    return sax->parse_error(chars_read, get_token_string(), parse_error::create(113, chars_read,
+                                            exception_message(input_format, "count in an optimized container must be positive", "size"), nullptr));
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'L':
+            {
+                std::int64_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                if (number < 0)
+                {
+                    return sax->parse_error(chars_read, get_token_string(), parse_error::create(113, chars_read,
+                                            exception_message(input_format, "count in an optimized container must be positive", "size"), nullptr));
+                }
+                if (!value_in_range_of<std::size_t>(number))
+                {
+                    return sax->parse_error(chars_read, get_token_string(), out_of_range::create(408,
+                                            exception_message(input_format, "integer value overflow", "size"), nullptr));
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'u':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint16_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'm':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint32_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                result = conditional_static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'M':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint64_t number{};
+                if (JSON_HEDLEY_UNLIKELY(!get_number(input_format, number)))
+                {
+                    return false;
+                }
+                if (!value_in_range_of<std::size_t>(number))
+                {
+                    return sax->parse_error(chars_read, get_token_string(), out_of_range::create(408,
+                                            exception_message(input_format, "integer value overflow", "size"), nullptr));
+                }
+                result = detail::conditional_static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case '[':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                if (is_ndarray) // ndarray dimensional vector can only contain integers, and can not embed another array
+                {
+                    return sax->parse_error(chars_read, get_token_string(), parse_error::create(113, chars_read, exception_message(input_format, "ndarray dimensional vector is not allowed", "size"), nullptr));
+                }
+                std::vector<size_t> dim;
+                if (JSON_HEDLEY_UNLIKELY(!get_ubjson_ndarray_size(dim)))
+                {
+                    return false;
+                }
+                if (dim.size() == 1 || (dim.size() == 2 && dim.at(0) == 1)) // return normal array size if 1D row vector
+                {
+                    result = dim.at(dim.size() - 1);
+                    return true;
+                }
+                if (!dim.empty())  // if ndarray, convert to an object in JData annotated array format
+                {
+                    for (auto i : dim) // test if any dimension in an ndarray is 0, if so, return a 1D empty container
+                    {
+                        if ( i == 0 )
+                        {
+                            result = 0;
+                            return true;
+                        }
+                    }
+
+                    string_t key = "_ArraySize_";
+                    if (JSON_HEDLEY_UNLIKELY(!sax->start_object(3) || !sax->key(key) || !sax->start_array(dim.size())))
+                    {
+                        return false;
+                    }
+                    result = 1;
+                    for (auto i : dim)
+                    {
+                        result *= i;
+                        if (result == 0 || result == npos) // because dim elements shall not have zeros, result = 0 means overflow happened; it also can't be npos as it is used to initialize size in get_ubjson_size_type()
+                        {
+                            return sax->parse_error(chars_read, get_token_string(), out_of_range::create(408, exception_message(input_format, "excessive ndarray size caused overflow", "size"), nullptr));
+                        }
+                        if (JSON_HEDLEY_UNLIKELY(!sax->number_unsigned(static_cast<number_unsigned_t>(i))))
+                        {
+                            return false;
+                        }
+                    }
+                    is_ndarray = true;
+                    return sax->end_array();
+                }
+                result = 0;
+                return true;
+            }
+
+            default:
+                break;
+        }
+        auto last_token = get_token_string();
+        std::string message;
+
+        if (input_format != input_format_t::bjdata)
+        {
+            message = "expected length type specification (U, i, I, l, L) after '#'; last byte: 0x" + last_token;
+        }
+        else
+        {
+            message = "expected length type specification (U, i, u, I, m, l, M, L) after '#'; last byte: 0x" + last_token;
+        }
+        return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, exception_message(input_format, message, "size"), nullptr));
+    }
+
+    /*!
+    @brief determine the type and size for a container
+
+    In the optimized UBJSON format, a type and a size can be provided to allow
+    for a more compact representation.
+
+    @param[out] result  pair of the size and the type
+    @param[in] inside_ndarray  whether the parser is parsing an ND array dimensional vector
+
+    @return whether pair creation completed
+    */
+    bool get_ubjson_size_type(std::pair<std::size_t, char_int_type>& result, bool inside_ndarray = false)
+    {
+        result.first = npos; // size
+        result.second = 0; // type
+        bool is_ndarray = false;
+
+        get_ignore_noop();
+
+        if (current == '$')
+        {
+            result.second = get();  // must not ignore 'N', because 'N' maybe the type
+            if (input_format == input_format_t::bjdata
+                    && JSON_HEDLEY_UNLIKELY(std::binary_search(bjd_optimized_type_markers.begin(), bjd_optimized_type_markers.end(), result.second)))
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                        exception_message(input_format, concat("marker 0x", last_token, " is not a permitted optimized array type"), "type"), nullptr));
+            }
+
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "type")))
+            {
+                return false;
+            }
+
+            get_ignore_noop();
+            if (JSON_HEDLEY_UNLIKELY(current != '#'))
+            {
+                if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "value")))
+                {
+                    return false;
+                }
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                        exception_message(input_format, concat("expected '#' after type information; last byte: 0x", last_token), "size"), nullptr));
+            }
+
+            const bool is_error = get_ubjson_size_value(result.first, is_ndarray);
+            if (input_format == input_format_t::bjdata && is_ndarray)
+            {
+                if (inside_ndarray)
+                {
+                    return sax->parse_error(chars_read, get_token_string(), parse_error::create(112, chars_read,
+                                            exception_message(input_format, "ndarray can not be recursive", "size"), nullptr));
+                }
+                result.second |= (1 << 8); // use bit 8 to indicate ndarray, all UBJSON and BJData markers should be ASCII letters
+            }
+            return is_error;
+        }
+
+        if (current == '#')
+        {
+            const bool is_error = get_ubjson_size_value(result.first, is_ndarray);
+            if (input_format == input_format_t::bjdata && is_ndarray)
+            {
+                return sax->parse_error(chars_read, get_token_string(), parse_error::create(112, chars_read,
+                                        exception_message(input_format, "ndarray requires both type and size", "size"), nullptr));
+            }
+            return is_error;
+        }
+
+        return true;
+    }
+
+    /*!
+    @param prefix  the previously read or set type prefix
+    @return whether value creation completed
+    */
+    bool get_ubjson_value(const char_int_type prefix)
+    {
+        switch (prefix)
+        {
+            case char_traits<char_type>::eof():  // EOF
+                return unexpect_eof(input_format, "value");
+
+            case 'T':  // true
+                return sax->boolean(true);
+            case 'F':  // false
+                return sax->boolean(false);
+
+            case 'Z':  // null
+                return sax->null();
+
+            case 'U':
+            {
+                std::uint8_t number{};
+                return get_number(input_format, number) && sax->number_unsigned(number);
+            }
+
+            case 'i':
+            {
+                std::int8_t number{};
+                return get_number(input_format, number) && sax->number_integer(number);
+            }
+
+            case 'I':
+            {
+                std::int16_t number{};
+                return get_number(input_format, number) && sax->number_integer(number);
+            }
+
+            case 'l':
+            {
+                std::int32_t number{};
+                return get_number(input_format, number) && sax->number_integer(number);
+            }
+
+            case 'L':
+            {
+                std::int64_t number{};
+                return get_number(input_format, number) && sax->number_integer(number);
+            }
+
+            case 'u':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint16_t number{};
+                return get_number(input_format, number) && sax->number_unsigned(number);
+            }
+
+            case 'm':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint32_t number{};
+                return get_number(input_format, number) && sax->number_unsigned(number);
+            }
+
+            case 'M':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                std::uint64_t number{};
+                return get_number(input_format, number) && sax->number_unsigned(number);
+            }
+
+            case 'h':
+            {
+                if (input_format != input_format_t::bjdata)
+                {
+                    break;
+                }
+                const auto byte1_raw = get();
+                if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "number")))
+                {
+                    return false;
+                }
+                const auto byte2_raw = get();
+                if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "number")))
+                {
+                    return false;
+                }
+
+                const auto byte1 = static_cast<unsigned char>(byte1_raw);
+                const auto byte2 = static_cast<unsigned char>(byte2_raw);
+
+                // code from RFC 7049, Appendix D, Figure 3:
+                // As half-precision floating-point numbers were only added
+                // to IEEE 754 in 2008, today's programming platforms often
+                // still only have limited support for them. It is very
+                // easy to include at least decoding support for them even
+                // without such support. An example of a small decoder for
+                // half-precision floating-point numbers in the C language
+                // is shown in Fig. 3.
+                const auto half = static_cast<unsigned int>((byte2 << 8u) + byte1);
+                const double val = [&half]
+                {
+                    const int exp = (half >> 10u) & 0x1Fu;
+                    const unsigned int mant = half & 0x3FFu;
+                    JSON_ASSERT(0 <= exp&& exp <= 32);
+                    JSON_ASSERT(mant <= 1024);
+                    switch (exp)
+                    {
+                        case 0:
+                            return std::ldexp(mant, -24);
+                        case 31:
+                            return (mant == 0)
+                            ? std::numeric_limits<double>::infinity()
+                            : std::numeric_limits<double>::quiet_NaN();
+                        default:
+                            return std::ldexp(mant + 1024, exp - 25);
+                    }
+                }();
+                return sax->number_float((half & 0x8000u) != 0
+                                         ? static_cast<number_float_t>(-val)
+                                         : static_cast<number_float_t>(val), "");
+            }
+
+            case 'd':
+            {
+                float number{};
+                return get_number(input_format, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 'D':
+            {
+                double number{};
+                return get_number(input_format, number) && sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 'H':
+            {
+                return get_ubjson_high_precision_number();
+            }
+
+            case 'C':  // char
+            {
+                get();
+                if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "char")))
+                {
+                    return false;
+                }
+                if (JSON_HEDLEY_UNLIKELY(current > 127))
+                {
+                    auto last_token = get_token_string();
+                    return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read,
+                                            exception_message(input_format, concat("byte after 'C' must be in range 0x00..0x7F; last byte: 0x", last_token), "char"), nullptr));
+                }
+                string_t s(1, static_cast<typename string_t::value_type>(current));
+                return sax->string(s);
+            }
+
+            case 'S':  // string
+            {
+                string_t s;
+                return get_ubjson_string(s) && sax->string(s);
+            }
+
+            case '[':  // array
+                return get_ubjson_array();
+
+            case '{':  // object
+                return get_ubjson_object();
+
+            default: // anything else
+                break;
+        }
+        auto last_token = get_token_string();
+        return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, exception_message(input_format, "invalid byte: 0x" + last_token, "value"), nullptr));
+    }
+
+    /*!
+    @return whether array creation completed
+    */
+    bool get_ubjson_array()
+    {
+        std::pair<std::size_t, char_int_type> size_and_type;
+        if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_type(size_and_type)))
+        {
+            return false;
+        }
+
+        // if bit-8 of size_and_type.second is set to 1, encode bjdata ndarray as an object in JData annotated array format (https://github.com/NeuroJSON/jdata):
+        // {"_ArrayType_" : "typeid", "_ArraySize_" : [n1, n2, ...], "_ArrayData_" : [v1, v2, ...]}
+
+        if (input_format == input_format_t::bjdata && size_and_type.first != npos && (size_and_type.second & (1 << 8)) != 0)
+        {
+            size_and_type.second &= ~(static_cast<char_int_type>(1) << 8);  // use bit 8 to indicate ndarray, here we remove the bit to restore the type marker
+            auto it = std::lower_bound(bjd_types_map.begin(), bjd_types_map.end(), size_and_type.second, [](const bjd_type & p, char_int_type t)
+            {
+                return p.first < t;
+            });
+            string_t key = "_ArrayType_";
+            if (JSON_HEDLEY_UNLIKELY(it == bjd_types_map.end() || it->first != size_and_type.second))
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                        exception_message(input_format, "invalid byte: 0x" + last_token, "type"), nullptr));
+            }
+
+            string_t type = it->second; // sax->string() takes a reference
+            if (JSON_HEDLEY_UNLIKELY(!sax->key(key) || !sax->string(type)))
+            {
+                return false;
+            }
+
+            if (size_and_type.second == 'C')
+            {
+                size_and_type.second = 'U';
+            }
+
+            key = "_ArrayData_";
+            if (JSON_HEDLEY_UNLIKELY(!sax->key(key) || !sax->start_array(size_and_type.first) ))
+            {
+                return false;
+            }
+
+            for (std::size_t i = 0; i < size_and_type.first; ++i)
+            {
+                if (JSON_HEDLEY_UNLIKELY(!get_ubjson_value(size_and_type.second)))
+                {
+                    return false;
+                }
+            }
+
+            return (sax->end_array() && sax->end_object());
+        }
+
+        if (size_and_type.first != npos)
+        {
+            if (JSON_HEDLEY_UNLIKELY(!sax->start_array(size_and_type.first)))
+            {
+                return false;
+            }
+
+            if (size_and_type.second != 0)
+            {
+                if (size_and_type.second != 'N')
+                {
+                    for (std::size_t i = 0; i < size_and_type.first; ++i)
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!get_ubjson_value(size_and_type.second)))
+                        {
+                            return false;
+                        }
+                    }
+                }
+            }
+            else
+            {
+                for (std::size_t i = 0; i < size_and_type.first; ++i)
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!parse_ubjson_internal()))
+                    {
+                        return false;
+                    }
+                }
+            }
+        }
+        else
+        {
+            if (JSON_HEDLEY_UNLIKELY(!sax->start_array(static_cast<std::size_t>(-1))))
+            {
+                return false;
+            }
+
+            while (current != ']')
+            {
+                if (JSON_HEDLEY_UNLIKELY(!parse_ubjson_internal(false)))
+                {
+                    return false;
+                }
+                get_ignore_noop();
+            }
+        }
+
+        return sax->end_array();
+    }
+
+    /*!
+    @return whether object creation completed
+    */
+    bool get_ubjson_object()
+    {
+        std::pair<std::size_t, char_int_type> size_and_type;
+        if (JSON_HEDLEY_UNLIKELY(!get_ubjson_size_type(size_and_type)))
+        {
+            return false;
+        }
+
+        // do not accept ND-array size in objects in BJData
+        if (input_format == input_format_t::bjdata && size_and_type.first != npos && (size_and_type.second & (1 << 8)) != 0)
+        {
+            auto last_token = get_token_string();
+            return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read,
+                                    exception_message(input_format, "BJData object does not support ND-array size in optimized format", "object"), nullptr));
+        }
+
+        string_t key;
+        if (size_and_type.first != npos)
+        {
+            if (JSON_HEDLEY_UNLIKELY(!sax->start_object(size_and_type.first)))
+            {
+                return false;
+            }
+
+            if (size_and_type.second != 0)
+            {
+                for (std::size_t i = 0; i < size_and_type.first; ++i)
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!get_ubjson_string(key) || !sax->key(key)))
+                    {
+                        return false;
+                    }
+                    if (JSON_HEDLEY_UNLIKELY(!get_ubjson_value(size_and_type.second)))
+                    {
+                        return false;
+                    }
+                    key.clear();
+                }
+            }
+            else
+            {
+                for (std::size_t i = 0; i < size_and_type.first; ++i)
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!get_ubjson_string(key) || !sax->key(key)))
+                    {
+                        return false;
+                    }
+                    if (JSON_HEDLEY_UNLIKELY(!parse_ubjson_internal()))
+                    {
+                        return false;
+                    }
+                    key.clear();
+                }
+            }
+        }
+        else
+        {
+            if (JSON_HEDLEY_UNLIKELY(!sax->start_object(static_cast<std::size_t>(-1))))
+            {
+                return false;
+            }
+
+            while (current != '}')
+            {
+                if (JSON_HEDLEY_UNLIKELY(!get_ubjson_string(key, false) || !sax->key(key)))
+                {
+                    return false;
+                }
+                if (JSON_HEDLEY_UNLIKELY(!parse_ubjson_internal()))
+                {
+                    return false;
+                }
+                get_ignore_noop();
+                key.clear();
+            }
+        }
+
+        return sax->end_object();
+    }
+
+    // Note, no reader for UBJSON binary types is implemented because they do
+    // not exist
+
+    bool get_ubjson_high_precision_number()
+    {
+        // get size of following number string
+        std::size_t size{};
+        bool no_ndarray = true;
+        auto res = get_ubjson_size_value(size, no_ndarray);
+        if (JSON_HEDLEY_UNLIKELY(!res))
+        {
+            return res;
+        }
+
+        // get number string
+        std::vector<char> number_vector;
+        for (std::size_t i = 0; i < size; ++i)
+        {
+            get();
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format, "number")))
+            {
+                return false;
+            }
+            number_vector.push_back(static_cast<char>(current));
+        }
+
+        // parse number string
+        using ia_type = decltype(detail::input_adapter(number_vector));
+        auto number_lexer = detail::lexer<BasicJsonType, ia_type>(detail::input_adapter(number_vector), false);
+        const auto result_number = number_lexer.scan();
+        const auto number_string = number_lexer.get_token_string();
+        const auto result_remainder = number_lexer.scan();
+
+        using token_type = typename detail::lexer_base<BasicJsonType>::token_type;
+
+        if (JSON_HEDLEY_UNLIKELY(result_remainder != token_type::end_of_input))
+        {
+            return sax->parse_error(chars_read, number_string, parse_error::create(115, chars_read,
+                                    exception_message(input_format, concat("invalid number text: ", number_lexer.get_token_string()), "high-precision number"), nullptr));
+        }
+
+        switch (result_number)
+        {
+            case token_type::value_integer:
+                return sax->number_integer(number_lexer.get_number_integer());
+            case token_type::value_unsigned:
+                return sax->number_unsigned(number_lexer.get_number_unsigned());
+            case token_type::value_float:
+                return sax->number_float(number_lexer.get_number_float(), std::move(number_string));
+            case token_type::uninitialized:
+            case token_type::literal_true:
+            case token_type::literal_false:
+            case token_type::literal_null:
+            case token_type::value_string:
+            case token_type::begin_array:
+            case token_type::begin_object:
+            case token_type::end_array:
+            case token_type::end_object:
+            case token_type::name_separator:
+            case token_type::value_separator:
+            case token_type::parse_error:
+            case token_type::end_of_input:
+            case token_type::literal_or_value:
+            default:
+                return sax->parse_error(chars_read, number_string, parse_error::create(115, chars_read,
+                                        exception_message(input_format, concat("invalid number text: ", number_lexer.get_token_string()), "high-precision number"), nullptr));
+        }
+    }
+
+    ///////////////////////
+    // Utility functions //
+    ///////////////////////
+
+    /*!
+    @brief get next character from the input
+
+    This function provides the interface to the used input adapter. It does
+    not throw in case the input reached EOF, but returns a -'ve valued
+    `char_traits<char_type>::eof()` in that case.
+
+    @return character read from the input
+    */
+    char_int_type get()
+    {
+        ++chars_read;
+        return current = ia.get_character();
+    }
+
+    /*!
+    @return character read from the input after ignoring all 'N' entries
+    */
+    char_int_type get_ignore_noop()
+    {
+        do
+        {
+            get();
+        }
+        while (current == 'N');
+
+        return current;
+    }
+
+    /*
+    @brief read a number from the input
+
+    @tparam NumberType the type of the number
+    @param[in] format   the current format (for diagnostics)
+    @param[out] result  number of type @a NumberType
+
+    @return whether conversion completed
+
+    @note This function needs to respect the system's endianness, because
+          bytes in CBOR, MessagePack, and UBJSON are stored in network order
+          (big endian) and therefore need reordering on little endian systems.
+          On the other hand, BSON and BJData use little endian and should reorder
+          on big endian systems.
+    */
+    template<typename NumberType, bool InputIsLittleEndian = false>
+    bool get_number(const input_format_t format, NumberType& result)
+    {
+        // step 1: read input into array with system's byte order
+        std::array<std::uint8_t, sizeof(NumberType)> vec{};
+        for (std::size_t i = 0; i < sizeof(NumberType); ++i)
+        {
+            get();
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(format, "number")))
+            {
+                return false;
+            }
+
+            // reverse byte order prior to conversion if necessary
+            if (is_little_endian != (InputIsLittleEndian || format == input_format_t::bjdata))
+            {
+                vec[sizeof(NumberType) - i - 1] = static_cast<std::uint8_t>(current);
+            }
+            else
+            {
+                vec[i] = static_cast<std::uint8_t>(current); // LCOV_EXCL_LINE
+            }
+        }
+
+        // step 2: convert array into number of type T and return
+        std::memcpy(&result, vec.data(), sizeof(NumberType));
+        return true;
+    }
+
+    /*!
+    @brief create a string by reading characters from the input
+
+    @tparam NumberType the type of the number
+    @param[in] format the current format (for diagnostics)
+    @param[in] len number of characters to read
+    @param[out] result string created by reading @a len bytes
+
+    @return whether string creation completed
+
+    @note We can not reserve @a len bytes for the result, because @a len
+          may be too large. Usually, @ref unexpect_eof() detects the end of
+          the input before we run out of string memory.
+    */
+    template<typename NumberType>
+    bool get_string(const input_format_t format,
+                    const NumberType len,
+                    string_t& result)
+    {
+        bool success = true;
+        for (NumberType i = 0; i < len; i++)
+        {
+            get();
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(format, "string")))
+            {
+                success = false;
+                break;
+            }
+            result.push_back(static_cast<typename string_t::value_type>(current));
+        }
+        return success;
+    }
+
+    /*!
+    @brief create a byte array by reading bytes from the input
+
+    @tparam NumberType the type of the number
+    @param[in] format the current format (for diagnostics)
+    @param[in] len number of bytes to read
+    @param[out] result byte array created by reading @a len bytes
+
+    @return whether byte array creation completed
+
+    @note We can not reserve @a len bytes for the result, because @a len
+          may be too large. Usually, @ref unexpect_eof() detects the end of
+          the input before we run out of memory.
+    */
+    template<typename NumberType>
+    bool get_binary(const input_format_t format,
+                    const NumberType len,
+                    binary_t& result)
+    {
+        bool success = true;
+        for (NumberType i = 0; i < len; i++)
+        {
+            get();
+            if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(format, "binary")))
+            {
+                success = false;
+                break;
+            }
+            result.push_back(static_cast<std::uint8_t>(current));
+        }
+        return success;
+    }
+
+    /*!
+    @param[in] format   the current format (for diagnostics)
+    @param[in] context  further context information (for diagnostics)
+    @return whether the last read character is not EOF
+    */
+    JSON_HEDLEY_NON_NULL(3)
+    bool unexpect_eof(const input_format_t format, const char* context) const
+    {
+        if (JSON_HEDLEY_UNLIKELY(current == char_traits<char_type>::eof()))
+        {
+            return sax->parse_error(chars_read, "<end of file>",
+                                    parse_error::create(110, chars_read, exception_message(format, "unexpected end of input", context), nullptr));
+        }
+        return true;
+    }
+
+    /*!
+    @return a string representation of the last read byte
+    */
+    std::string get_token_string() const
+    {
+        std::array<char, 3> cr{{}};
+        static_cast<void>((std::snprintf)(cr.data(), cr.size(), "%.2hhX", static_cast<unsigned char>(current))); // NOLINT(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+        return std::string{cr.data()};
+    }
+
+    /*!
+    @param[in] format   the current format
+    @param[in] detail   a detailed error message
+    @param[in] context  further context information
+    @return a message string to use in the parse_error exceptions
+    */
+    std::string exception_message(const input_format_t format,
+                                  const std::string& detail,
+                                  const std::string& context) const
+    {
+        std::string error_msg = "syntax error while parsing ";
+
+        switch (format)
+        {
+            case input_format_t::cbor:
+                error_msg += "CBOR";
+                break;
+
+            case input_format_t::msgpack:
+                error_msg += "MessagePack";
+                break;
+
+            case input_format_t::ubjson:
+                error_msg += "UBJSON";
+                break;
+
+            case input_format_t::bson:
+                error_msg += "BSON";
+                break;
+
+            case input_format_t::bjdata:
+                error_msg += "BJData";
+                break;
+
+            case input_format_t::json: // LCOV_EXCL_LINE
+            default:            // LCOV_EXCL_LINE
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+        }
+
+        return concat(error_msg, ' ', context, ": ", detail);
+    }
+
+  private:
+    static JSON_INLINE_VARIABLE constexpr std::size_t npos = static_cast<std::size_t>(-1);
+
+    /// input adapter
+    InputAdapterType ia;
+
+    /// the current character
+    char_int_type current = char_traits<char_type>::eof();
+
+    /// the number of characters read
+    std::size_t chars_read = 0;
+
+    /// whether we can assume little endianness
+    const bool is_little_endian = little_endianness();
+
+    /// input format
+    const input_format_t input_format = input_format_t::json;
+
+    /// the SAX parser
+    json_sax_t* sax = nullptr;
+
+    // excluded markers in bjdata optimized type
+#define JSON_BINARY_READER_MAKE_BJD_OPTIMIZED_TYPE_MARKERS_ \
+    make_array<char_int_type>('F', 'H', 'N', 'S', 'T', 'Z', '[', '{')
+
+#define JSON_BINARY_READER_MAKE_BJD_TYPES_MAP_ \
+    make_array<bjd_type>(                      \
+    bjd_type{'C', "char"},                     \
+    bjd_type{'D', "double"},                   \
+    bjd_type{'I', "int16"},                    \
+    bjd_type{'L', "int64"},                    \
+    bjd_type{'M', "uint64"},                   \
+    bjd_type{'U', "uint8"},                    \
+    bjd_type{'d', "single"},                   \
+    bjd_type{'i', "int8"},                     \
+    bjd_type{'l', "int32"},                    \
+    bjd_type{'m', "uint32"},                   \
+    bjd_type{'u', "uint16"})
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    // lookup tables
+    // NOLINTNEXTLINE(cppcoreguidelines-non-private-member-variables-in-classes)
+    const decltype(JSON_BINARY_READER_MAKE_BJD_OPTIMIZED_TYPE_MARKERS_) bjd_optimized_type_markers =
+        JSON_BINARY_READER_MAKE_BJD_OPTIMIZED_TYPE_MARKERS_;
+
+    using bjd_type = std::pair<char_int_type, string_t>;
+    // NOLINTNEXTLINE(cppcoreguidelines-non-private-member-variables-in-classes)
+    const decltype(JSON_BINARY_READER_MAKE_BJD_TYPES_MAP_) bjd_types_map =
+        JSON_BINARY_READER_MAKE_BJD_TYPES_MAP_;
+
+#undef JSON_BINARY_READER_MAKE_BJD_OPTIMIZED_TYPE_MARKERS_
+#undef JSON_BINARY_READER_MAKE_BJD_TYPES_MAP_
+};
+
+#ifndef JSON_HAS_CPP_17
+    template<typename BasicJsonType, typename InputAdapterType, typename SAX>
+    constexpr std::size_t binary_reader<BasicJsonType, InputAdapterType, SAX>::npos;
+#endif
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/input/input_adapters.hpp>
+
+// #include <nlohmann/detail/input/lexer.hpp>
+
+// #include <nlohmann/detail/input/parser.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cmath> // isfinite
+#include <cstdint> // uint8_t
+#include <functional> // function
+#include <string> // string
+#include <utility> // move
+#include <vector> // vector
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/input/input_adapters.hpp>
+
+// #include <nlohmann/detail/input/json_sax.hpp>
+
+// #include <nlohmann/detail/input/lexer.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/is_sax.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+////////////
+// parser //
+////////////
+
+enum class parse_event_t : std::uint8_t
+{
+    /// the parser read `{` and started to process a JSON object
+    object_start,
+    /// the parser read `}` and finished processing a JSON object
+    object_end,
+    /// the parser read `[` and started to process a JSON array
+    array_start,
+    /// the parser read `]` and finished processing a JSON array
+    array_end,
+    /// the parser read a key of a value in an object
+    key,
+    /// the parser finished reading a JSON value
+    value
+};
+
+template<typename BasicJsonType>
+using parser_callback_t =
+    std::function<bool(int /*depth*/, parse_event_t /*event*/, BasicJsonType& /*parsed*/)>;
+
+/*!
+@brief syntax analysis
+
+This class implements a recursive descent parser.
+*/
+template<typename BasicJsonType, typename InputAdapterType>
+class parser
+{
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using lexer_t = lexer<BasicJsonType, InputAdapterType>;
+    using token_type = typename lexer_t::token_type;
+
+  public:
+    /// a parser reading from an input adapter
+    explicit parser(InputAdapterType&& adapter,
+                    const parser_callback_t<BasicJsonType> cb = nullptr,
+                    const bool allow_exceptions_ = true,
+                    const bool skip_comments = false)
+        : callback(cb)
+        , m_lexer(std::move(adapter), skip_comments)
+        , allow_exceptions(allow_exceptions_)
+    {
+        // read first token
+        get_token();
+    }
+
+    /*!
+    @brief public parser interface
+
+    @param[in] strict      whether to expect the last token to be EOF
+    @param[in,out] result  parsed JSON value
+
+    @throw parse_error.101 in case of an unexpected token
+    @throw parse_error.102 if to_unicode fails or surrogate error
+    @throw parse_error.103 if to_unicode fails
+    */
+    void parse(const bool strict, BasicJsonType& result)
+    {
+        if (callback)
+        {
+            json_sax_dom_callback_parser<BasicJsonType> sdp(result, callback, allow_exceptions);
+            sax_parse_internal(&sdp);
+
+            // in strict mode, input must be completely read
+            if (strict && (get_token() != token_type::end_of_input))
+            {
+                sdp.parse_error(m_lexer.get_position(),
+                                m_lexer.get_token_string(),
+                                parse_error::create(101, m_lexer.get_position(),
+                                                    exception_message(token_type::end_of_input, "value"), nullptr));
+            }
+
+            // in case of an error, return discarded value
+            if (sdp.is_errored())
+            {
+                result = value_t::discarded;
+                return;
+            }
+
+            // set top-level value to null if it was discarded by the callback
+            // function
+            if (result.is_discarded())
+            {
+                result = nullptr;
+            }
+        }
+        else
+        {
+            json_sax_dom_parser<BasicJsonType> sdp(result, allow_exceptions);
+            sax_parse_internal(&sdp);
+
+            // in strict mode, input must be completely read
+            if (strict && (get_token() != token_type::end_of_input))
+            {
+                sdp.parse_error(m_lexer.get_position(),
+                                m_lexer.get_token_string(),
+                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_of_input, "value"), nullptr));
+            }
+
+            // in case of an error, return discarded value
+            if (sdp.is_errored())
+            {
+                result = value_t::discarded;
+                return;
+            }
+        }
+
+        result.assert_invariant();
+    }
+
+    /*!
+    @brief public accept interface
+
+    @param[in] strict  whether to expect the last token to be EOF
+    @return whether the input is a proper JSON text
+    */
+    bool accept(const bool strict = true)
+    {
+        json_sax_acceptor<BasicJsonType> sax_acceptor;
+        return sax_parse(&sax_acceptor, strict);
+    }
+
+    template<typename SAX>
+    JSON_HEDLEY_NON_NULL(2)
+    bool sax_parse(SAX* sax, const bool strict = true)
+    {
+        (void)detail::is_sax_static_asserts<SAX, BasicJsonType> {};
+        const bool result = sax_parse_internal(sax);
+
+        // strict mode: next byte must be EOF
+        if (result && strict && (get_token() != token_type::end_of_input))
+        {
+            return sax->parse_error(m_lexer.get_position(),
+                                    m_lexer.get_token_string(),
+                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_of_input, "value"), nullptr));
+        }
+
+        return result;
+    }
+
+  private:
+    template<typename SAX>
+    JSON_HEDLEY_NON_NULL(2)
+    bool sax_parse_internal(SAX* sax)
+    {
+        // stack to remember the hierarchy of structured values we are parsing
+        // true = array; false = object
+        std::vector<bool> states;
+        // value to avoid a goto (see comment where set to true)
+        bool skip_to_state_evaluation = false;
+
+        while (true)
+        {
+            if (!skip_to_state_evaluation)
+            {
+                // invariant: get_token() was called before each iteration
+                switch (last_token)
+                {
+                    case token_type::begin_object:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->start_object(static_cast<std::size_t>(-1))))
+                        {
+                            return false;
+                        }
+
+                        // closing } -> we are done
+                        if (get_token() == token_type::end_object)
+                        {
+                            if (JSON_HEDLEY_UNLIKELY(!sax->end_object()))
+                            {
+                                return false;
+                            }
+                            break;
+                        }
+
+                        // parse key
+                        if (JSON_HEDLEY_UNLIKELY(last_token != token_type::value_string))
+                        {
+                            return sax->parse_error(m_lexer.get_position(),
+                                                    m_lexer.get_token_string(),
+                                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::value_string, "object key"), nullptr));
+                        }
+                        if (JSON_HEDLEY_UNLIKELY(!sax->key(m_lexer.get_string())))
+                        {
+                            return false;
+                        }
+
+                        // parse separator (:)
+                        if (JSON_HEDLEY_UNLIKELY(get_token() != token_type::name_separator))
+                        {
+                            return sax->parse_error(m_lexer.get_position(),
+                                                    m_lexer.get_token_string(),
+                                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::name_separator, "object separator"), nullptr));
+                        }
+
+                        // remember we are now inside an object
+                        states.push_back(false);
+
+                        // parse values
+                        get_token();
+                        continue;
+                    }
+
+                    case token_type::begin_array:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->start_array(static_cast<std::size_t>(-1))))
+                        {
+                            return false;
+                        }
+
+                        // closing ] -> we are done
+                        if (get_token() == token_type::end_array)
+                        {
+                            if (JSON_HEDLEY_UNLIKELY(!sax->end_array()))
+                            {
+                                return false;
+                            }
+                            break;
+                        }
+
+                        // remember we are now inside an array
+                        states.push_back(true);
+
+                        // parse values (no need to call get_token)
+                        continue;
+                    }
+
+                    case token_type::value_float:
+                    {
+                        const auto res = m_lexer.get_number_float();
+
+                        if (JSON_HEDLEY_UNLIKELY(!std::isfinite(res)))
+                        {
+                            return sax->parse_error(m_lexer.get_position(),
+                                                    m_lexer.get_token_string(),
+                                                    out_of_range::create(406, concat("number overflow parsing '", m_lexer.get_token_string(), '\''), nullptr));
+                        }
+
+                        if (JSON_HEDLEY_UNLIKELY(!sax->number_float(res, m_lexer.get_string())))
+                        {
+                            return false;
+                        }
+
+                        break;
+                    }
+
+                    case token_type::literal_false:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->boolean(false)))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::literal_null:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->null()))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::literal_true:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->boolean(true)))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::value_integer:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->number_integer(m_lexer.get_number_integer())))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::value_string:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->string(m_lexer.get_string())))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::value_unsigned:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!sax->number_unsigned(m_lexer.get_number_unsigned())))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::parse_error:
+                    {
+                        // using "uninitialized" to avoid "expected" message
+                        return sax->parse_error(m_lexer.get_position(),
+                                                m_lexer.get_token_string(),
+                                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::uninitialized, "value"), nullptr));
+                    }
+                    case token_type::end_of_input:
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(m_lexer.get_position().chars_read_total == 1))
+                        {
+                            return sax->parse_error(m_lexer.get_position(),
+                                                    m_lexer.get_token_string(),
+                                                    parse_error::create(101, m_lexer.get_position(),
+                                                            "attempting to parse an empty input; check that your input string or stream contains the expected JSON", nullptr));
+                        }
+
+                        return sax->parse_error(m_lexer.get_position(),
+                                                m_lexer.get_token_string(),
+                                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::literal_or_value, "value"), nullptr));
+                    }
+                    case token_type::uninitialized:
+                    case token_type::end_array:
+                    case token_type::end_object:
+                    case token_type::name_separator:
+                    case token_type::value_separator:
+                    case token_type::literal_or_value:
+                    default: // the last token was unexpected
+                    {
+                        return sax->parse_error(m_lexer.get_position(),
+                                                m_lexer.get_token_string(),
+                                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::literal_or_value, "value"), nullptr));
+                    }
+                }
+            }
+            else
+            {
+                skip_to_state_evaluation = false;
+            }
+
+            // we reached this line after we successfully parsed a value
+            if (states.empty())
+            {
+                // empty stack: we reached the end of the hierarchy: done
+                return true;
+            }
+
+            if (states.back())  // array
+            {
+                // comma -> next value
+                if (get_token() == token_type::value_separator)
+                {
+                    // parse a new value
+                    get_token();
+                    continue;
+                }
+
+                // closing ]
+                if (JSON_HEDLEY_LIKELY(last_token == token_type::end_array))
+                {
+                    if (JSON_HEDLEY_UNLIKELY(!sax->end_array()))
+                    {
+                        return false;
+                    }
+
+                    // We are done with this array. Before we can parse a
+                    // new value, we need to evaluate the new state first.
+                    // By setting skip_to_state_evaluation to false, we
+                    // are effectively jumping to the beginning of this if.
+                    JSON_ASSERT(!states.empty());
+                    states.pop_back();
+                    skip_to_state_evaluation = true;
+                    continue;
+                }
+
+                return sax->parse_error(m_lexer.get_position(),
+                                        m_lexer.get_token_string(),
+                                        parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_array, "array"), nullptr));
+            }
+
+            // states.back() is false -> object
+
+            // comma -> next value
+            if (get_token() == token_type::value_separator)
+            {
+                // parse key
+                if (JSON_HEDLEY_UNLIKELY(get_token() != token_type::value_string))
+                {
+                    return sax->parse_error(m_lexer.get_position(),
+                                            m_lexer.get_token_string(),
+                                            parse_error::create(101, m_lexer.get_position(), exception_message(token_type::value_string, "object key"), nullptr));
+                }
+
+                if (JSON_HEDLEY_UNLIKELY(!sax->key(m_lexer.get_string())))
+                {
+                    return false;
+                }
+
+                // parse separator (:)
+                if (JSON_HEDLEY_UNLIKELY(get_token() != token_type::name_separator))
+                {
+                    return sax->parse_error(m_lexer.get_position(),
+                                            m_lexer.get_token_string(),
+                                            parse_error::create(101, m_lexer.get_position(), exception_message(token_type::name_separator, "object separator"), nullptr));
+                }
+
+                // parse values
+                get_token();
+                continue;
+            }
+
+            // closing }
+            if (JSON_HEDLEY_LIKELY(last_token == token_type::end_object))
+            {
+                if (JSON_HEDLEY_UNLIKELY(!sax->end_object()))
+                {
+                    return false;
+                }
+
+                // We are done with this object. Before we can parse a
+                // new value, we need to evaluate the new state first.
+                // By setting skip_to_state_evaluation to false, we
+                // are effectively jumping to the beginning of this if.
+                JSON_ASSERT(!states.empty());
+                states.pop_back();
+                skip_to_state_evaluation = true;
+                continue;
+            }
+
+            return sax->parse_error(m_lexer.get_position(),
+                                    m_lexer.get_token_string(),
+                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_object, "object"), nullptr));
+        }
+    }
+
+    /// get next token from lexer
+    token_type get_token()
+    {
+        return last_token = m_lexer.scan();
+    }
+
+    std::string exception_message(const token_type expected, const std::string& context)
+    {
+        std::string error_msg = "syntax error ";
+
+        if (!context.empty())
+        {
+            error_msg += concat("while parsing ", context, ' ');
+        }
+
+        error_msg += "- ";
+
+        if (last_token == token_type::parse_error)
+        {
+            error_msg += concat(m_lexer.get_error_message(), "; last read: '",
+                                m_lexer.get_token_string(), '\'');
+        }
+        else
+        {
+            error_msg += concat("unexpected ", lexer_t::token_type_name(last_token));
+        }
+
+        if (expected != token_type::uninitialized)
+        {
+            error_msg += concat("; expected ", lexer_t::token_type_name(expected));
+        }
+
+        return error_msg;
+    }
+
+  private:
+    /// callback function
+    const parser_callback_t<BasicJsonType> callback = nullptr;
+    /// the type of the last read token
+    token_type last_token = token_type::uninitialized;
+    /// the lexer
+    lexer_t m_lexer;
+    /// whether to throw exceptions in case of errors
+    const bool allow_exceptions = true;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/iterators/internal_iterator.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+// #include <nlohmann/detail/iterators/primitive_iterator.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstddef> // ptrdiff_t
+#include <limits>  // numeric_limits
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/*
+@brief an iterator for primitive JSON types
+
+This class models an iterator for primitive JSON types (boolean, number,
+string). It's only purpose is to allow the iterator/const_iterator classes
+to "iterate" over primitive values. Internally, the iterator is modeled by
+a `difference_type` variable. Value begin_value (`0`) models the begin,
+end_value (`1`) models past the end.
+*/
+class primitive_iterator_t
+{
+  private:
+    using difference_type = std::ptrdiff_t;
+    static constexpr difference_type begin_value = 0;
+    static constexpr difference_type end_value = begin_value + 1;
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    /// iterator as signed integer type
+    difference_type m_it = (std::numeric_limits<std::ptrdiff_t>::min)();
+
+  public:
+    constexpr difference_type get_value() const noexcept
+    {
+        return m_it;
+    }
+
+    /// set iterator to a defined beginning
+    void set_begin() noexcept
+    {
+        m_it = begin_value;
+    }
+
+    /// set iterator to a defined past the end
+    void set_end() noexcept
+    {
+        m_it = end_value;
+    }
+
+    /// return whether the iterator can be dereferenced
+    constexpr bool is_begin() const noexcept
+    {
+        return m_it == begin_value;
+    }
+
+    /// return whether the iterator is at end
+    constexpr bool is_end() const noexcept
+    {
+        return m_it == end_value;
+    }
+
+    friend constexpr bool operator==(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
+    {
+        return lhs.m_it == rhs.m_it;
+    }
+
+    friend constexpr bool operator<(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
+    {
+        return lhs.m_it < rhs.m_it;
+    }
+
+    primitive_iterator_t operator+(difference_type n) noexcept
+    {
+        auto result = *this;
+        result += n;
+        return result;
+    }
+
+    friend constexpr difference_type operator-(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
+    {
+        return lhs.m_it - rhs.m_it;
+    }
+
+    primitive_iterator_t& operator++() noexcept
+    {
+        ++m_it;
+        return *this;
+    }
+
+    primitive_iterator_t operator++(int)& noexcept // NOLINT(cert-dcl21-cpp)
+    {
+        auto result = *this;
+        ++m_it;
+        return result;
+    }
+
+    primitive_iterator_t& operator--() noexcept
+    {
+        --m_it;
+        return *this;
+    }
+
+    primitive_iterator_t operator--(int)& noexcept // NOLINT(cert-dcl21-cpp)
+    {
+        auto result = *this;
+        --m_it;
+        return result;
+    }
+
+    primitive_iterator_t& operator+=(difference_type n) noexcept
+    {
+        m_it += n;
+        return *this;
+    }
+
+    primitive_iterator_t& operator-=(difference_type n) noexcept
+    {
+        m_it -= n;
+        return *this;
+    }
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/*!
+@brief an iterator value
+
+@note This structure could easily be a union, but MSVC currently does not allow
+unions members with complex constructors, see https://github.com/nlohmann/json/pull/105.
+*/
+template<typename BasicJsonType> struct internal_iterator
+{
+    /// iterator for JSON objects
+    typename BasicJsonType::object_t::iterator object_iterator {};
+    /// iterator for JSON arrays
+    typename BasicJsonType::array_t::iterator array_iterator {};
+    /// generic iterator for all other types
+    primitive_iterator_t primitive_iterator {};
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/iterators/iter_impl.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <iterator> // iterator, random_access_iterator_tag, bidirectional_iterator_tag, advance, next
+#include <type_traits> // conditional, is_const, remove_const
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/iterators/internal_iterator.hpp>
+
+// #include <nlohmann/detail/iterators/primitive_iterator.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+// forward declare, to be able to friend it later on
+template<typename IteratorType> class iteration_proxy;
+template<typename IteratorType> class iteration_proxy_value;
+
+/*!
+@brief a template for a bidirectional iterator for the @ref basic_json class
+This class implements a both iterators (iterator and const_iterator) for the
+@ref basic_json class.
+@note An iterator is called *initialized* when a pointer to a JSON value has
+      been set (e.g., by a constructor or a copy assignment). If the iterator is
+      default-constructed, it is *uninitialized* and most methods are undefined.
+      **The library uses assertions to detect calls on uninitialized iterators.**
+@requirement The class satisfies the following concept requirements:
+-
+[BidirectionalIterator](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator):
+  The iterator that can be moved can be moved in both directions (i.e.
+  incremented and decremented).
+@since version 1.0.0, simplified in version 2.0.9, change to bidirectional
+       iterators in version 3.0.0 (see https://github.com/nlohmann/json/issues/593)
+*/
+template<typename BasicJsonType>
+class iter_impl // NOLINT(cppcoreguidelines-special-member-functions,hicpp-special-member-functions)
+{
+    /// the iterator with BasicJsonType of different const-ness
+    using other_iter_impl = iter_impl<typename std::conditional<std::is_const<BasicJsonType>::value, typename std::remove_const<BasicJsonType>::type, const BasicJsonType>::type>;
+    /// allow basic_json to access private members
+    friend other_iter_impl;
+    friend BasicJsonType;
+    friend iteration_proxy<iter_impl>;
+    friend iteration_proxy_value<iter_impl>;
+
+    using object_t = typename BasicJsonType::object_t;
+    using array_t = typename BasicJsonType::array_t;
+    // make sure BasicJsonType is basic_json or const basic_json
+    static_assert(is_basic_json<typename std::remove_const<BasicJsonType>::type>::value,
+                  "iter_impl only accepts (const) basic_json");
+    // superficial check for the LegacyBidirectionalIterator named requirement
+    static_assert(std::is_base_of<std::bidirectional_iterator_tag, std::bidirectional_iterator_tag>::value
+                  &&  std::is_base_of<std::bidirectional_iterator_tag, typename std::iterator_traits<typename array_t::iterator>::iterator_category>::value,
+                  "basic_json iterator assumes array and object type iterators satisfy the LegacyBidirectionalIterator named requirement.");
+
+  public:
+    /// The std::iterator class template (used as a base class to provide typedefs) is deprecated in C++17.
+    /// The C++ Standard has never required user-defined iterators to derive from std::iterator.
+    /// A user-defined iterator should provide publicly accessible typedefs named
+    /// iterator_category, value_type, difference_type, pointer, and reference.
+    /// Note that value_type is required to be non-const, even for constant iterators.
+    using iterator_category = std::bidirectional_iterator_tag;
+
+    /// the type of the values when the iterator is dereferenced
+    using value_type = typename BasicJsonType::value_type;
+    /// a type to represent differences between iterators
+    using difference_type = typename BasicJsonType::difference_type;
+    /// defines a pointer to the type iterated over (value_type)
+    using pointer = typename std::conditional<std::is_const<BasicJsonType>::value,
+          typename BasicJsonType::const_pointer,
+          typename BasicJsonType::pointer>::type;
+    /// defines a reference to the type iterated over (value_type)
+    using reference =
+        typename std::conditional<std::is_const<BasicJsonType>::value,
+        typename BasicJsonType::const_reference,
+        typename BasicJsonType::reference>::type;
+
+    iter_impl() = default;
+    ~iter_impl() = default;
+    iter_impl(iter_impl&&) noexcept = default;
+    iter_impl& operator=(iter_impl&&) noexcept = default;
+
+    /*!
+    @brief constructor for a given JSON instance
+    @param[in] object  pointer to a JSON object for this iterator
+    @pre object != nullptr
+    @post The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    explicit iter_impl(pointer object) noexcept : m_object(object)
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_data.m_type)
+        {
+            case value_t::object:
+            {
+                m_it.object_iterator = typename object_t::iterator();
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_it.array_iterator = typename array_t::iterator();
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                m_it.primitive_iterator = primitive_iterator_t();
+                break;
+            }
+        }
+    }
+
+    /*!
+    @note The conventional copy constructor and copy assignment are implicitly
+          defined. Combined with the following converting constructor and
+          assignment, they support: (1) copy from iterator to iterator, (2)
+          copy from const iterator to const iterator, and (3) conversion from
+          iterator to const iterator. However conversion from const iterator
+          to iterator is not defined.
+    */
+
+    /*!
+    @brief const copy constructor
+    @param[in] other const iterator to copy from
+    @note This copy constructor had to be defined explicitly to circumvent a bug
+          occurring on msvc v19.0 compiler (VS 2015) debug build. For more
+          information refer to: https://github.com/nlohmann/json/issues/1608
+    */
+    iter_impl(const iter_impl<const BasicJsonType>& other) noexcept
+        : m_object(other.m_object), m_it(other.m_it)
+    {}
+
+    /*!
+    @brief converting assignment
+    @param[in] other const iterator to copy from
+    @return const/non-const iterator
+    @note It is not checked whether @a other is initialized.
+    */
+    iter_impl& operator=(const iter_impl<const BasicJsonType>& other) noexcept
+    {
+        if (&other != this)
+        {
+            m_object = other.m_object;
+            m_it = other.m_it;
+        }
+        return *this;
+    }
+
+    /*!
+    @brief converting constructor
+    @param[in] other  non-const iterator to copy from
+    @note It is not checked whether @a other is initialized.
+    */
+    iter_impl(const iter_impl<typename std::remove_const<BasicJsonType>::type>& other) noexcept
+        : m_object(other.m_object), m_it(other.m_it)
+    {}
+
+    /*!
+    @brief converting assignment
+    @param[in] other  non-const iterator to copy from
+    @return const/non-const iterator
+    @note It is not checked whether @a other is initialized.
+    */
+    iter_impl& operator=(const iter_impl<typename std::remove_const<BasicJsonType>::type>& other) noexcept // NOLINT(cert-oop54-cpp)
+    {
+        m_object = other.m_object;
+        m_it = other.m_it;
+        return *this;
+    }
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    /*!
+    @brief set the iterator to the first value
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    void set_begin() noexcept
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_data.m_type)
+        {
+            case value_t::object:
+            {
+                m_it.object_iterator = m_object->m_data.m_value.object->begin();
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_it.array_iterator = m_object->m_data.m_value.array->begin();
+                break;
+            }
+
+            case value_t::null:
+            {
+                // set to end so begin()==end() is true: null is empty
+                m_it.primitive_iterator.set_end();
+                break;
+            }
+
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                m_it.primitive_iterator.set_begin();
+                break;
+            }
+        }
+    }
+
+    /*!
+    @brief set the iterator past the last value
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    void set_end() noexcept
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_data.m_type)
+        {
+            case value_t::object:
+            {
+                m_it.object_iterator = m_object->m_data.m_value.object->end();
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_it.array_iterator = m_object->m_data.m_value.array->end();
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                m_it.primitive_iterator.set_end();
+                break;
+            }
+        }
+    }
+
+  public:
+    /*!
+    @brief return a reference to the value pointed to by the iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    reference operator*() const
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_data.m_type)
+        {
+            case value_t::object:
+            {
+                JSON_ASSERT(m_it.object_iterator != m_object->m_data.m_value.object->end());
+                return m_it.object_iterator->second;
+            }
+
+            case value_t::array:
+            {
+                JSON_ASSERT(m_it.array_iterator != m_object->m_data.m_value.array->end());
+                return *m_it.array_iterator;
+            }
+
+            case value_t::null:
+                JSON_THROW(invalid_iterator::create(214, "cannot get value", m_object));
+
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                if (JSON_HEDLEY_LIKELY(m_it.primitive_iterator.is_begin()))
+                {
+                    return *m_object;
+                }
+
+                JSON_THROW(invalid_iterator::create(214, "cannot get value", m_object));
+            }
+        }
+    }
+
+    /*!
+    @brief dereference the iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    pointer operator->() const
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_data.m_type)
+        {
+            case value_t::object:
+            {
+                JSON_ASSERT(m_it.object_iterator != m_object->m_data.m_value.object->end());
+                return &(m_it.object_iterator->second);
+            }
+
+            case value_t::array:
+            {
+                JSON_ASSERT(m_it.array_iterator != m_object->m_data.m_value.array->end());
+                return &*m_it.array_iterator;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                if (JSON_HEDLEY_LIKELY(m_it.primitive_iterator.is_begin()))
+                {
+                    return m_object;
+                }
+
+                JSON_THROW(invalid_iterator::create(214, "cannot get value", m_object));
+            }
+        }
+    }
+
+    /*!
+    @brief post-increment (it++)
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl operator++(int)& // NOLINT(cert-dcl21-cpp)
+    {
+        auto result = *this;
+        ++(*this);
+        return result;
+    }
+
+    /*!
+    @brief pre-increment (++it)
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl& operator++()
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_data.m_type)
+        {
+            case value_t::object:
+            {
+                std::advance(m_it.object_iterator, 1);
+                break;
+            }
+
+            case value_t::array:
+            {
+                std::advance(m_it.array_iterator, 1);
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                ++m_it.primitive_iterator;
+                break;
+            }
+        }
+
+        return *this;
+    }
+
+    /*!
+    @brief post-decrement (it--)
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl operator--(int)& // NOLINT(cert-dcl21-cpp)
+    {
+        auto result = *this;
+        --(*this);
+        return result;
+    }
+
+    /*!
+    @brief pre-decrement (--it)
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl& operator--()
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_data.m_type)
+        {
+            case value_t::object:
+            {
+                std::advance(m_it.object_iterator, -1);
+                break;
+            }
+
+            case value_t::array:
+            {
+                std::advance(m_it.array_iterator, -1);
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                --m_it.primitive_iterator;
+                break;
+            }
+        }
+
+        return *this;
+    }
+
+    /*!
+    @brief comparison: equal
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    template < typename IterImpl, detail::enable_if_t < (std::is_same<IterImpl, iter_impl>::value || std::is_same<IterImpl, other_iter_impl>::value), std::nullptr_t > = nullptr >
+    bool operator==(const IterImpl& other) const
+    {
+        // if objects are not the same, the comparison is undefined
+        if (JSON_HEDLEY_UNLIKELY(m_object != other.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(212, "cannot compare iterators of different containers", m_object));
+        }
+
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_data.m_type)
+        {
+            case value_t::object:
+                return (m_it.object_iterator == other.m_it.object_iterator);
+
+            case value_t::array:
+                return (m_it.array_iterator == other.m_it.array_iterator);
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+                return (m_it.primitive_iterator == other.m_it.primitive_iterator);
+        }
+    }
+
+    /*!
+    @brief comparison: not equal
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    template < typename IterImpl, detail::enable_if_t < (std::is_same<IterImpl, iter_impl>::value || std::is_same<IterImpl, other_iter_impl>::value), std::nullptr_t > = nullptr >
+    bool operator!=(const IterImpl& other) const
+    {
+        return !operator==(other);
+    }
+
+    /*!
+    @brief comparison: smaller
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator<(const iter_impl& other) const
+    {
+        // if objects are not the same, the comparison is undefined
+        if (JSON_HEDLEY_UNLIKELY(m_object != other.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(212, "cannot compare iterators of different containers", m_object));
+        }
+
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_data.m_type)
+        {
+            case value_t::object:
+                JSON_THROW(invalid_iterator::create(213, "cannot compare order of object iterators", m_object));
+
+            case value_t::array:
+                return (m_it.array_iterator < other.m_it.array_iterator);
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+                return (m_it.primitive_iterator < other.m_it.primitive_iterator);
+        }
+    }
+
+    /*!
+    @brief comparison: less than or equal
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator<=(const iter_impl& other) const
+    {
+        return !other.operator < (*this);
+    }
+
+    /*!
+    @brief comparison: greater than
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator>(const iter_impl& other) const
+    {
+        return !operator<=(other);
+    }
+
+    /*!
+    @brief comparison: greater than or equal
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator>=(const iter_impl& other) const
+    {
+        return !operator<(other);
+    }
+
+    /*!
+    @brief add to iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl& operator+=(difference_type i)
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_data.m_type)
+        {
+            case value_t::object:
+                JSON_THROW(invalid_iterator::create(209, "cannot use offsets with object iterators", m_object));
+
+            case value_t::array:
+            {
+                std::advance(m_it.array_iterator, i);
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                m_it.primitive_iterator += i;
+                break;
+            }
+        }
+
+        return *this;
+    }
+
+    /*!
+    @brief subtract from iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl& operator-=(difference_type i)
+    {
+        return operator+=(-i);
+    }
+
+    /*!
+    @brief add to iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl operator+(difference_type i) const
+    {
+        auto result = *this;
+        result += i;
+        return result;
+    }
+
+    /*!
+    @brief addition of distance and iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    friend iter_impl operator+(difference_type i, const iter_impl& it)
+    {
+        auto result = it;
+        result += i;
+        return result;
+    }
+
+    /*!
+    @brief subtract from iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl operator-(difference_type i) const
+    {
+        auto result = *this;
+        result -= i;
+        return result;
+    }
+
+    /*!
+    @brief return difference
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    difference_type operator-(const iter_impl& other) const
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_data.m_type)
+        {
+            case value_t::object:
+                JSON_THROW(invalid_iterator::create(209, "cannot use offsets with object iterators", m_object));
+
+            case value_t::array:
+                return m_it.array_iterator - other.m_it.array_iterator;
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+                return m_it.primitive_iterator - other.m_it.primitive_iterator;
+        }
+    }
+
+    /*!
+    @brief access to successor
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    reference operator[](difference_type n) const
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        switch (m_object->m_data.m_type)
+        {
+            case value_t::object:
+                JSON_THROW(invalid_iterator::create(208, "cannot use operator[] for object iterators", m_object));
+
+            case value_t::array:
+                return *std::next(m_it.array_iterator, n);
+
+            case value_t::null:
+                JSON_THROW(invalid_iterator::create(214, "cannot get value", m_object));
+
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                if (JSON_HEDLEY_LIKELY(m_it.primitive_iterator.get_value() == -n))
+                {
+                    return *m_object;
+                }
+
+                JSON_THROW(invalid_iterator::create(214, "cannot get value", m_object));
+            }
+        }
+    }
+
+    /*!
+    @brief return the key of an object iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    const typename object_t::key_type& key() const
+    {
+        JSON_ASSERT(m_object != nullptr);
+
+        if (JSON_HEDLEY_LIKELY(m_object->is_object()))
+        {
+            return m_it.object_iterator->first;
+        }
+
+        JSON_THROW(invalid_iterator::create(207, "cannot use key() for non-object iterators", m_object));
+    }
+
+    /*!
+    @brief return the value of an iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    reference value() const
+    {
+        return operator*();
+    }
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    /// associated JSON instance
+    pointer m_object = nullptr;
+    /// the actual iterator of the associated instance
+    internal_iterator<typename std::remove_const<BasicJsonType>::type> m_it {};
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/iterators/iteration_proxy.hpp>
+
+// #include <nlohmann/detail/iterators/json_reverse_iterator.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <cstddef> // ptrdiff_t
+#include <iterator> // reverse_iterator
+#include <utility> // declval
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+//////////////////////
+// reverse_iterator //
+//////////////////////
+
+/*!
+@brief a template for a reverse iterator class
+
+@tparam Base the base iterator type to reverse. Valid types are @ref
+iterator (to create @ref reverse_iterator) and @ref const_iterator (to
+create @ref const_reverse_iterator).
+
+@requirement The class satisfies the following concept requirements:
+-
+[BidirectionalIterator](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator):
+  The iterator that can be moved can be moved in both directions (i.e.
+  incremented and decremented).
+- [OutputIterator](https://en.cppreference.com/w/cpp/named_req/OutputIterator):
+  It is possible to write to the pointed-to element (only if @a Base is
+  @ref iterator).
+
+@since version 1.0.0
+*/
+template<typename Base>
+class json_reverse_iterator : public std::reverse_iterator<Base>
+{
+  public:
+    using difference_type = std::ptrdiff_t;
+    /// shortcut to the reverse iterator adapter
+    using base_iterator = std::reverse_iterator<Base>;
+    /// the reference type for the pointed-to element
+    using reference = typename Base::reference;
+
+    /// create reverse iterator from iterator
+    explicit json_reverse_iterator(const typename base_iterator::iterator_type& it) noexcept
+        : base_iterator(it) {}
+
+    /// create reverse iterator from base class
+    explicit json_reverse_iterator(const base_iterator& it) noexcept : base_iterator(it) {}
+
+    /// post-increment (it++)
+    json_reverse_iterator operator++(int)& // NOLINT(cert-dcl21-cpp)
+    {
+        return static_cast<json_reverse_iterator>(base_iterator::operator++(1));
+    }
+
+    /// pre-increment (++it)
+    json_reverse_iterator& operator++()
+    {
+        return static_cast<json_reverse_iterator&>(base_iterator::operator++());
+    }
+
+    /// post-decrement (it--)
+    json_reverse_iterator operator--(int)& // NOLINT(cert-dcl21-cpp)
+    {
+        return static_cast<json_reverse_iterator>(base_iterator::operator--(1));
+    }
+
+    /// pre-decrement (--it)
+    json_reverse_iterator& operator--()
+    {
+        return static_cast<json_reverse_iterator&>(base_iterator::operator--());
+    }
+
+    /// add to iterator
+    json_reverse_iterator& operator+=(difference_type i)
+    {
+        return static_cast<json_reverse_iterator&>(base_iterator::operator+=(i));
+    }
+
+    /// add to iterator
+    json_reverse_iterator operator+(difference_type i) const
+    {
+        return static_cast<json_reverse_iterator>(base_iterator::operator+(i));
+    }
+
+    /// subtract from iterator
+    json_reverse_iterator operator-(difference_type i) const
+    {
+        return static_cast<json_reverse_iterator>(base_iterator::operator-(i));
+    }
+
+    /// return difference
+    difference_type operator-(const json_reverse_iterator& other) const
+    {
+        return base_iterator(*this) - base_iterator(other);
+    }
+
+    /// access to successor
+    reference operator[](difference_type n) const
+    {
+        return *(this->operator+(n));
+    }
+
+    /// return the key of an object iterator
+    auto key() const -> decltype(std::declval<Base>().key())
+    {
+        auto it = --this->base();
+        return it.key();
+    }
+
+    /// return the value of an iterator
+    reference value() const
+    {
+        auto it = --this->base();
+        return it.operator * ();
+    }
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/iterators/primitive_iterator.hpp>
+
+// #include <nlohmann/detail/json_custom_base_class.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <type_traits> // conditional, is_same
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/*!
+@brief Default base class of the @ref basic_json class.
+
+So that the correct implementations of the copy / move ctors / assign operators
+of @ref basic_json do not require complex case distinctions
+(no base class / custom base class used as customization point),
+@ref basic_json always has a base class.
+By default, this class is used because it is empty and thus has no effect
+on the behavior of @ref basic_json.
+*/
+struct json_default_base {};
+
+template<class T>
+using json_base_class = typename std::conditional <
+                        std::is_same<T, void>::value,
+                        json_default_base,
+                        T
+                        >::type;
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/json_pointer.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // all_of
+#include <cctype> // isdigit
+#include <cerrno> // errno, ERANGE
+#include <cstdlib> // strtoull
+#ifndef JSON_NO_IO
+    #include <iosfwd> // ostream
+#endif  // JSON_NO_IO
+#include <limits> // max
+#include <numeric> // accumulate
+#include <string> // string
+#include <utility> // move
+#include <vector> // vector
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+// #include <nlohmann/detail/string_escape.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/// @brief JSON Pointer defines a string syntax for identifying a specific value within a JSON document
+/// @sa https://json.nlohmann.me/api/json_pointer/
+template<typename RefStringType>
+class json_pointer
+{
+    // allow basic_json to access private members
+    NLOHMANN_BASIC_JSON_TPL_DECLARATION
+    friend class basic_json;
+
+    template<typename>
+    friend class json_pointer;
+
+    template<typename T>
+    struct string_t_helper
+    {
+        using type = T;
+    };
+
+    NLOHMANN_BASIC_JSON_TPL_DECLARATION
+    struct string_t_helper<NLOHMANN_BASIC_JSON_TPL>
+    {
+        using type = StringType;
+    };
+
+  public:
+    // for backwards compatibility accept BasicJsonType
+    using string_t = typename string_t_helper<RefStringType>::type;
+
+    /// @brief create JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/json_pointer/
+    explicit json_pointer(const string_t& s = "")
+        : reference_tokens(split(s))
+    {}
+
+    /// @brief return a string representation of the JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/to_string/
+    string_t to_string() const
+    {
+        return std::accumulate(reference_tokens.begin(), reference_tokens.end(),
+                               string_t{},
+                               [](const string_t& a, const string_t& b)
+        {
+            return detail::concat(a, '/', detail::escape(b));
+        });
+    }
+
+    /// @brief return a string representation of the JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_string/
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, to_string())
+    operator string_t() const
+    {
+        return to_string();
+    }
+
+#ifndef JSON_NO_IO
+    /// @brief write string representation of the JSON pointer to stream
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ltlt/
+    friend std::ostream& operator<<(std::ostream& o, const json_pointer& ptr)
+    {
+        o << ptr.to_string();
+        return o;
+    }
+#endif
+
+    /// @brief append another JSON pointer at the end of this JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_slasheq/
+    json_pointer& operator/=(const json_pointer& ptr)
+    {
+        reference_tokens.insert(reference_tokens.end(),
+                                ptr.reference_tokens.begin(),
+                                ptr.reference_tokens.end());
+        return *this;
+    }
+
+    /// @brief append an unescaped reference token at the end of this JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_slasheq/
+    json_pointer& operator/=(string_t token)
+    {
+        push_back(std::move(token));
+        return *this;
+    }
+
+    /// @brief append an array index at the end of this JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_slasheq/
+    json_pointer& operator/=(std::size_t array_idx)
+    {
+        return *this /= std::to_string(array_idx);
+    }
+
+    /// @brief create a new JSON pointer by appending the right JSON pointer at the end of the left JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_slash/
+    friend json_pointer operator/(const json_pointer& lhs,
+                                  const json_pointer& rhs)
+    {
+        return json_pointer(lhs) /= rhs;
+    }
+
+    /// @brief create a new JSON pointer by appending the unescaped token at the end of the JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_slash/
+    friend json_pointer operator/(const json_pointer& lhs, string_t token) // NOLINT(performance-unnecessary-value-param)
+    {
+        return json_pointer(lhs) /= std::move(token);
+    }
+
+    /// @brief create a new JSON pointer by appending the array-index-token at the end of the JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_slash/
+    friend json_pointer operator/(const json_pointer& lhs, std::size_t array_idx)
+    {
+        return json_pointer(lhs) /= array_idx;
+    }
+
+    /// @brief returns the parent of this JSON pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/parent_pointer/
+    json_pointer parent_pointer() const
+    {
+        if (empty())
+        {
+            return *this;
+        }
+
+        json_pointer res = *this;
+        res.pop_back();
+        return res;
+    }
+
+    /// @brief remove last reference token
+    /// @sa https://json.nlohmann.me/api/json_pointer/pop_back/
+    void pop_back()
+    {
+        if (JSON_HEDLEY_UNLIKELY(empty()))
+        {
+            JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent", nullptr));
+        }
+
+        reference_tokens.pop_back();
+    }
+
+    /// @brief return last reference token
+    /// @sa https://json.nlohmann.me/api/json_pointer/back/
+    const string_t& back() const
+    {
+        if (JSON_HEDLEY_UNLIKELY(empty()))
+        {
+            JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent", nullptr));
+        }
+
+        return reference_tokens.back();
+    }
+
+    /// @brief append an unescaped token at the end of the reference pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/push_back/
+    void push_back(const string_t& token)
+    {
+        reference_tokens.push_back(token);
+    }
+
+    /// @brief append an unescaped token at the end of the reference pointer
+    /// @sa https://json.nlohmann.me/api/json_pointer/push_back/
+    void push_back(string_t&& token)
+    {
+        reference_tokens.push_back(std::move(token));
+    }
+
+    /// @brief return whether pointer points to the root document
+    /// @sa https://json.nlohmann.me/api/json_pointer/empty/
+    bool empty() const noexcept
+    {
+        return reference_tokens.empty();
+    }
+
+  private:
+    /*!
+    @param[in] s  reference token to be converted into an array index
+
+    @return integer representation of @a s
+
+    @throw parse_error.106  if an array index begins with '0'
+    @throw parse_error.109  if an array index begins not with a digit
+    @throw out_of_range.404 if string @a s could not be converted to an integer
+    @throw out_of_range.410 if an array index exceeds size_type
+    */
+    template<typename BasicJsonType>
+    static typename BasicJsonType::size_type array_index(const string_t& s)
+    {
+        using size_type = typename BasicJsonType::size_type;
+
+        // error condition (cf. RFC 6901, Sect. 4)
+        if (JSON_HEDLEY_UNLIKELY(s.size() > 1 && s[0] == '0'))
+        {
+            JSON_THROW(detail::parse_error::create(106, 0, detail::concat("array index '", s, "' must not begin with '0'"), nullptr));
+        }
+
+        // error condition (cf. RFC 6901, Sect. 4)
+        if (JSON_HEDLEY_UNLIKELY(s.size() > 1 && !(s[0] >= '1' && s[0] <= '9')))
+        {
+            JSON_THROW(detail::parse_error::create(109, 0, detail::concat("array index '", s, "' is not a number"), nullptr));
+        }
+
+        const char* p = s.c_str();
+        char* p_end = nullptr;
+        errno = 0; // strtoull doesn't reset errno
+        const unsigned long long res = std::strtoull(p, &p_end, 10); // NOLINT(runtime/int)
+        if (p == p_end // invalid input or empty string
+                || errno == ERANGE // out of range
+                || JSON_HEDLEY_UNLIKELY(static_cast<std::size_t>(p_end - p) != s.size())) // incomplete read
+        {
+            JSON_THROW(detail::out_of_range::create(404, detail::concat("unresolved reference token '", s, "'"), nullptr));
+        }
+
+        // only triggered on special platforms (like 32bit), see also
+        // https://github.com/nlohmann/json/pull/2203
+        if (res >= static_cast<unsigned long long>((std::numeric_limits<size_type>::max)()))  // NOLINT(runtime/int)
+        {
+            JSON_THROW(detail::out_of_range::create(410, detail::concat("array index ", s, " exceeds size_type"), nullptr));   // LCOV_EXCL_LINE
+        }
+
+        return static_cast<size_type>(res);
+    }
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    json_pointer top() const
+    {
+        if (JSON_HEDLEY_UNLIKELY(empty()))
+        {
+            JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent", nullptr));
+        }
+
+        json_pointer result = *this;
+        result.reference_tokens = {reference_tokens[0]};
+        return result;
+    }
+
+  private:
+    /*!
+    @brief create and return a reference to the pointed to value
+
+    @complexity Linear in the number of reference tokens.
+
+    @throw parse_error.109 if array index is not a number
+    @throw type_error.313 if value cannot be unflattened
+    */
+    template<typename BasicJsonType>
+    BasicJsonType& get_and_create(BasicJsonType& j) const
+    {
+        auto* result = &j;
+
+        // in case no reference tokens exist, return a reference to the JSON value
+        // j which will be overwritten by a primitive value
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (result->type())
+            {
+                case detail::value_t::null:
+                {
+                    if (reference_token == "0")
+                    {
+                        // start a new array if reference token is 0
+                        result = &result->operator[](0);
+                    }
+                    else
+                    {
+                        // start a new object otherwise
+                        result = &result->operator[](reference_token);
+                    }
+                    break;
+                }
+
+                case detail::value_t::object:
+                {
+                    // create an entry in the object
+                    result = &result->operator[](reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    // create an entry in the array
+                    result = &result->operator[](array_index<BasicJsonType>(reference_token));
+                    break;
+                }
+
+                /*
+                The following code is only reached if there exists a reference
+                token _and_ the current value is primitive. In this case, we have
+                an error situation, because primitive values may only occur as
+                single value; that is, with an empty list of reference tokens.
+                */
+                case detail::value_t::string:
+                case detail::value_t::boolean:
+                case detail::value_t::number_integer:
+                case detail::value_t::number_unsigned:
+                case detail::value_t::number_float:
+                case detail::value_t::binary:
+                case detail::value_t::discarded:
+                default:
+                    JSON_THROW(detail::type_error::create(313, "invalid value to unflatten", &j));
+            }
+        }
+
+        return *result;
+    }
+
+    /*!
+    @brief return a reference to the pointed to value
+
+    @note This version does not throw if a value is not present, but tries to
+          create nested values instead. For instance, calling this function
+          with pointer `"/this/that"` on a null value is equivalent to calling
+          `operator[]("this").operator[]("that")` on that value, effectively
+          changing the null value to an object.
+
+    @param[in] ptr  a JSON value
+
+    @return reference to the JSON value pointed to by the JSON pointer
+
+    @complexity Linear in the length of the JSON pointer.
+
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+    */
+    template<typename BasicJsonType>
+    BasicJsonType& get_unchecked(BasicJsonType* ptr) const
+    {
+        for (const auto& reference_token : reference_tokens)
+        {
+            // convert null values to arrays or objects before continuing
+            if (ptr->is_null())
+            {
+                // check if reference token is a number
+                const bool nums =
+                    std::all_of(reference_token.begin(), reference_token.end(),
+                                [](const unsigned char x)
+                {
+                    return std::isdigit(x);
+                });
+
+                // change value to array for numbers or "-" or to object otherwise
+                *ptr = (nums || reference_token == "-")
+                       ? detail::value_t::array
+                       : detail::value_t::object;
+            }
+
+            switch (ptr->type())
+            {
+                case detail::value_t::object:
+                {
+                    // use unchecked object access
+                    ptr = &ptr->operator[](reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (reference_token == "-")
+                    {
+                        // explicitly treat "-" as index beyond the end
+                        ptr = &ptr->operator[](ptr->m_data.m_value.array->size());
+                    }
+                    else
+                    {
+                        // convert array index to number; unchecked access
+                        ptr = &ptr->operator[](array_index<BasicJsonType>(reference_token));
+                    }
+                    break;
+                }
+
+                case detail::value_t::null:
+                case detail::value_t::string:
+                case detail::value_t::boolean:
+                case detail::value_t::number_integer:
+                case detail::value_t::number_unsigned:
+                case detail::value_t::number_float:
+                case detail::value_t::binary:
+                case detail::value_t::discarded:
+                default:
+                    JSON_THROW(detail::out_of_range::create(404, detail::concat("unresolved reference token '", reference_token, "'"), ptr));
+            }
+        }
+
+        return *ptr;
+    }
+
+    /*!
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.402  if the array index '-' is used
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+    */
+    template<typename BasicJsonType>
+    BasicJsonType& get_checked(BasicJsonType* ptr) const
+    {
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (ptr->type())
+            {
+                case detail::value_t::object:
+                {
+                    // note: at performs range check
+                    ptr = &ptr->at(reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(reference_token == "-"))
+                    {
+                        // "-" always fails the range check
+                        JSON_THROW(detail::out_of_range::create(402, detail::concat(
+                                "array index '-' (", std::to_string(ptr->m_data.m_value.array->size()),
+                                ") is out of range"), ptr));
+                    }
+
+                    // note: at performs range check
+                    ptr = &ptr->at(array_index<BasicJsonType>(reference_token));
+                    break;
+                }
+
+                case detail::value_t::null:
+                case detail::value_t::string:
+                case detail::value_t::boolean:
+                case detail::value_t::number_integer:
+                case detail::value_t::number_unsigned:
+                case detail::value_t::number_float:
+                case detail::value_t::binary:
+                case detail::value_t::discarded:
+                default:
+                    JSON_THROW(detail::out_of_range::create(404, detail::concat("unresolved reference token '", reference_token, "'"), ptr));
+            }
+        }
+
+        return *ptr;
+    }
+
+    /*!
+    @brief return a const reference to the pointed to value
+
+    @param[in] ptr  a JSON value
+
+    @return const reference to the JSON value pointed to by the JSON
+    pointer
+
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.402  if the array index '-' is used
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+    */
+    template<typename BasicJsonType>
+    const BasicJsonType& get_unchecked(const BasicJsonType* ptr) const
+    {
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (ptr->type())
+            {
+                case detail::value_t::object:
+                {
+                    // use unchecked object access
+                    ptr = &ptr->operator[](reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(reference_token == "-"))
+                    {
+                        // "-" cannot be used for const access
+                        JSON_THROW(detail::out_of_range::create(402, detail::concat("array index '-' (", std::to_string(ptr->m_data.m_value.array->size()), ") is out of range"), ptr));
+                    }
+
+                    // use unchecked array access
+                    ptr = &ptr->operator[](array_index<BasicJsonType>(reference_token));
+                    break;
+                }
+
+                case detail::value_t::null:
+                case detail::value_t::string:
+                case detail::value_t::boolean:
+                case detail::value_t::number_integer:
+                case detail::value_t::number_unsigned:
+                case detail::value_t::number_float:
+                case detail::value_t::binary:
+                case detail::value_t::discarded:
+                default:
+                    JSON_THROW(detail::out_of_range::create(404, detail::concat("unresolved reference token '", reference_token, "'"), ptr));
+            }
+        }
+
+        return *ptr;
+    }
+
+    /*!
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.402  if the array index '-' is used
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+    */
+    template<typename BasicJsonType>
+    const BasicJsonType& get_checked(const BasicJsonType* ptr) const
+    {
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (ptr->type())
+            {
+                case detail::value_t::object:
+                {
+                    // note: at performs range check
+                    ptr = &ptr->at(reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(reference_token == "-"))
+                    {
+                        // "-" always fails the range check
+                        JSON_THROW(detail::out_of_range::create(402, detail::concat(
+                                "array index '-' (", std::to_string(ptr->m_data.m_value.array->size()),
+                                ") is out of range"), ptr));
+                    }
+
+                    // note: at performs range check
+                    ptr = &ptr->at(array_index<BasicJsonType>(reference_token));
+                    break;
+                }
+
+                case detail::value_t::null:
+                case detail::value_t::string:
+                case detail::value_t::boolean:
+                case detail::value_t::number_integer:
+                case detail::value_t::number_unsigned:
+                case detail::value_t::number_float:
+                case detail::value_t::binary:
+                case detail::value_t::discarded:
+                default:
+                    JSON_THROW(detail::out_of_range::create(404, detail::concat("unresolved reference token '", reference_token, "'"), ptr));
+            }
+        }
+
+        return *ptr;
+    }
+
+    /*!
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    */
+    template<typename BasicJsonType>
+    bool contains(const BasicJsonType* ptr) const
+    {
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (ptr->type())
+            {
+                case detail::value_t::object:
+                {
+                    if (!ptr->contains(reference_token))
+                    {
+                        // we did not find the key in the object
+                        return false;
+                    }
+
+                    ptr = &ptr->operator[](reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (JSON_HEDLEY_UNLIKELY(reference_token == "-"))
+                    {
+                        // "-" always fails the range check
+                        return false;
+                    }
+                    if (JSON_HEDLEY_UNLIKELY(reference_token.size() == 1 && !("0" <= reference_token && reference_token <= "9")))
+                    {
+                        // invalid char
+                        return false;
+                    }
+                    if (JSON_HEDLEY_UNLIKELY(reference_token.size() > 1))
+                    {
+                        if (JSON_HEDLEY_UNLIKELY(!('1' <= reference_token[0] && reference_token[0] <= '9')))
+                        {
+                            // first char should be between '1' and '9'
+                            return false;
+                        }
+                        for (std::size_t i = 1; i < reference_token.size(); i++)
+                        {
+                            if (JSON_HEDLEY_UNLIKELY(!('0' <= reference_token[i] && reference_token[i] <= '9')))
+                            {
+                                // other char should be between '0' and '9'
+                                return false;
+                            }
+                        }
+                    }
+
+                    const auto idx = array_index<BasicJsonType>(reference_token);
+                    if (idx >= ptr->size())
+                    {
+                        // index out of range
+                        return false;
+                    }
+
+                    ptr = &ptr->operator[](idx);
+                    break;
+                }
+
+                case detail::value_t::null:
+                case detail::value_t::string:
+                case detail::value_t::boolean:
+                case detail::value_t::number_integer:
+                case detail::value_t::number_unsigned:
+                case detail::value_t::number_float:
+                case detail::value_t::binary:
+                case detail::value_t::discarded:
+                default:
+                {
+                    // we do not expect primitive values if there is still a
+                    // reference token to process
+                    return false;
+                }
+            }
+        }
+
+        // no reference token left means we found a primitive value
+        return true;
+    }
+
+    /*!
+    @brief split the string input to reference tokens
+
+    @note This function is only called by the json_pointer constructor.
+          All exceptions below are documented there.
+
+    @throw parse_error.107  if the pointer is not empty or begins with '/'
+    @throw parse_error.108  if character '~' is not followed by '0' or '1'
+    */
+    static std::vector<string_t> split(const string_t& reference_string)
+    {
+        std::vector<string_t> result;
+
+        // special case: empty reference string -> no reference tokens
+        if (reference_string.empty())
+        {
+            return result;
+        }
+
+        // check if nonempty reference string begins with slash
+        if (JSON_HEDLEY_UNLIKELY(reference_string[0] != '/'))
+        {
+            JSON_THROW(detail::parse_error::create(107, 1, detail::concat("JSON pointer must be empty or begin with '/' - was: '", reference_string, "'"), nullptr));
+        }
+
+        // extract the reference tokens:
+        // - slash: position of the last read slash (or end of string)
+        // - start: position after the previous slash
+        for (
+            // search for the first slash after the first character
+            std::size_t slash = reference_string.find_first_of('/', 1),
+            // set the beginning of the first reference token
+            start = 1;
+            // we can stop if start == 0 (if slash == string_t::npos)
+            start != 0;
+            // set the beginning of the next reference token
+            // (will eventually be 0 if slash == string_t::npos)
+            start = (slash == string_t::npos) ? 0 : slash + 1,
+            // find next slash
+            slash = reference_string.find_first_of('/', start))
+        {
+            // use the text between the beginning of the reference token
+            // (start) and the last slash (slash).
+            auto reference_token = reference_string.substr(start, slash - start);
+
+            // check reference tokens are properly escaped
+            for (std::size_t pos = reference_token.find_first_of('~');
+                    pos != string_t::npos;
+                    pos = reference_token.find_first_of('~', pos + 1))
+            {
+                JSON_ASSERT(reference_token[pos] == '~');
+
+                // ~ must be followed by 0 or 1
+                if (JSON_HEDLEY_UNLIKELY(pos == reference_token.size() - 1 ||
+                                         (reference_token[pos + 1] != '0' &&
+                                          reference_token[pos + 1] != '1')))
+                {
+                    JSON_THROW(detail::parse_error::create(108, 0, "escape character '~' must be followed with '0' or '1'", nullptr));
+                }
+            }
+
+            // finally, store the reference token
+            detail::unescape(reference_token);
+            result.push_back(reference_token);
+        }
+
+        return result;
+    }
+
+  private:
+    /*!
+    @param[in] reference_string  the reference string to the current value
+    @param[in] value             the value to consider
+    @param[in,out] result        the result object to insert values to
+
+    @note Empty objects or arrays are flattened to `null`.
+    */
+    template<typename BasicJsonType>
+    static void flatten(const string_t& reference_string,
+                        const BasicJsonType& value,
+                        BasicJsonType& result)
+    {
+        switch (value.type())
+        {
+            case detail::value_t::array:
+            {
+                if (value.m_data.m_value.array->empty())
+                {
+                    // flatten empty array as null
+                    result[reference_string] = nullptr;
+                }
+                else
+                {
+                    // iterate array and use index as reference string
+                    for (std::size_t i = 0; i < value.m_data.m_value.array->size(); ++i)
+                    {
+                        flatten(detail::concat(reference_string, '/', std::to_string(i)),
+                                value.m_data.m_value.array->operator[](i), result);
+                    }
+                }
+                break;
+            }
+
+            case detail::value_t::object:
+            {
+                if (value.m_data.m_value.object->empty())
+                {
+                    // flatten empty object as null
+                    result[reference_string] = nullptr;
+                }
+                else
+                {
+                    // iterate object and use keys as reference string
+                    for (const auto& element : *value.m_data.m_value.object)
+                    {
+                        flatten(detail::concat(reference_string, '/', detail::escape(element.first)), element.second, result);
+                    }
+                }
+                break;
+            }
+
+            case detail::value_t::null:
+            case detail::value_t::string:
+            case detail::value_t::boolean:
+            case detail::value_t::number_integer:
+            case detail::value_t::number_unsigned:
+            case detail::value_t::number_float:
+            case detail::value_t::binary:
+            case detail::value_t::discarded:
+            default:
+            {
+                // add primitive value with its reference string
+                result[reference_string] = value;
+                break;
+            }
+        }
+    }
+
+    /*!
+    @param[in] value  flattened JSON
+
+    @return unflattened JSON
+
+    @throw parse_error.109 if array index is not a number
+    @throw type_error.314  if value is not an object
+    @throw type_error.315  if object values are not primitive
+    @throw type_error.313  if value cannot be unflattened
+    */
+    template<typename BasicJsonType>
+    static BasicJsonType
+    unflatten(const BasicJsonType& value)
+    {
+        if (JSON_HEDLEY_UNLIKELY(!value.is_object()))
+        {
+            JSON_THROW(detail::type_error::create(314, "only objects can be unflattened", &value));
+        }
+
+        BasicJsonType result;
+
+        // iterate the JSON object values
+        for (const auto& element : *value.m_data.m_value.object)
+        {
+            if (JSON_HEDLEY_UNLIKELY(!element.second.is_primitive()))
+            {
+                JSON_THROW(detail::type_error::create(315, "values in object must be primitive", &element.second));
+            }
+
+            // assign value to reference pointed to by JSON pointer; Note that if
+            // the JSON pointer is "" (i.e., points to the whole value), function
+            // get_and_create returns a reference to result itself. An assignment
+            // will then create a primitive value.
+            json_pointer(element.first).get_and_create(result) = element.second;
+        }
+
+        return result;
+    }
+
+    // can't use conversion operator because of ambiguity
+    json_pointer<string_t> convert() const&
+    {
+        json_pointer<string_t> result;
+        result.reference_tokens = reference_tokens;
+        return result;
+    }
+
+    json_pointer<string_t> convert()&&
+    {
+        json_pointer<string_t> result;
+        result.reference_tokens = std::move(reference_tokens);
+        return result;
+    }
+
+  public:
+#if JSON_HAS_THREE_WAY_COMPARISON
+    /// @brief compares two JSON pointers for equality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_eq/
+    template<typename RefStringTypeRhs>
+    bool operator==(const json_pointer<RefStringTypeRhs>& rhs) const noexcept
+    {
+        return reference_tokens == rhs.reference_tokens;
+    }
+
+    /// @brief compares JSON pointer and string for equality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_eq/
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.2, operator==(json_pointer))
+    bool operator==(const string_t& rhs) const
+    {
+        return *this == json_pointer(rhs);
+    }
+
+    /// @brief 3-way compares two JSON pointers
+    template<typename RefStringTypeRhs>
+    std::strong_ordering operator<=>(const json_pointer<RefStringTypeRhs>& rhs) const noexcept // *NOPAD*
+    {
+        return  reference_tokens <=> rhs.reference_tokens; // *NOPAD*
+    }
+#else
+    /// @brief compares two JSON pointers for equality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_eq/
+    template<typename RefStringTypeLhs, typename RefStringTypeRhs>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator==(const json_pointer<RefStringTypeLhs>& lhs,
+                           const json_pointer<RefStringTypeRhs>& rhs) noexcept;
+
+    /// @brief compares JSON pointer and string for equality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_eq/
+    template<typename RefStringTypeLhs, typename StringType>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator==(const json_pointer<RefStringTypeLhs>& lhs,
+                           const StringType& rhs);
+
+    /// @brief compares string and JSON pointer for equality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_eq/
+    template<typename RefStringTypeRhs, typename StringType>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator==(const StringType& lhs,
+                           const json_pointer<RefStringTypeRhs>& rhs);
+
+    /// @brief compares two JSON pointers for inequality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_ne/
+    template<typename RefStringTypeLhs, typename RefStringTypeRhs>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator!=(const json_pointer<RefStringTypeLhs>& lhs,
+                           const json_pointer<RefStringTypeRhs>& rhs) noexcept;
+
+    /// @brief compares JSON pointer and string for inequality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_ne/
+    template<typename RefStringTypeLhs, typename StringType>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator!=(const json_pointer<RefStringTypeLhs>& lhs,
+                           const StringType& rhs);
+
+    /// @brief compares string and JSON pointer for inequality
+    /// @sa https://json.nlohmann.me/api/json_pointer/operator_ne/
+    template<typename RefStringTypeRhs, typename StringType>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator!=(const StringType& lhs,
+                           const json_pointer<RefStringTypeRhs>& rhs);
+
+    /// @brief compares two JSON pointer for less-than
+    template<typename RefStringTypeLhs, typename RefStringTypeRhs>
+    // NOLINTNEXTLINE(readability-redundant-declaration)
+    friend bool operator<(const json_pointer<RefStringTypeLhs>& lhs,
+                          const json_pointer<RefStringTypeRhs>& rhs) noexcept;
+#endif
+
+  private:
+    /// the reference tokens
+    std::vector<string_t> reference_tokens;
+};
+
+#if !JSON_HAS_THREE_WAY_COMPARISON
+// functions cannot be defined inside class due to ODR violations
+template<typename RefStringTypeLhs, typename RefStringTypeRhs>
+inline bool operator==(const json_pointer<RefStringTypeLhs>& lhs,
+                       const json_pointer<RefStringTypeRhs>& rhs) noexcept
+{
+    return lhs.reference_tokens == rhs.reference_tokens;
+}
+
+template<typename RefStringTypeLhs,
+         typename StringType = typename json_pointer<RefStringTypeLhs>::string_t>
+JSON_HEDLEY_DEPRECATED_FOR(3.11.2, operator==(json_pointer, json_pointer))
+inline bool operator==(const json_pointer<RefStringTypeLhs>& lhs,
+                       const StringType& rhs)
+{
+    return lhs == json_pointer<RefStringTypeLhs>(rhs);
+}
+
+template<typename RefStringTypeRhs,
+         typename StringType = typename json_pointer<RefStringTypeRhs>::string_t>
+JSON_HEDLEY_DEPRECATED_FOR(3.11.2, operator==(json_pointer, json_pointer))
+inline bool operator==(const StringType& lhs,
+                       const json_pointer<RefStringTypeRhs>& rhs)
+{
+    return json_pointer<RefStringTypeRhs>(lhs) == rhs;
+}
+
+template<typename RefStringTypeLhs, typename RefStringTypeRhs>
+inline bool operator!=(const json_pointer<RefStringTypeLhs>& lhs,
+                       const json_pointer<RefStringTypeRhs>& rhs) noexcept
+{
+    return !(lhs == rhs);
+}
+
+template<typename RefStringTypeLhs,
+         typename StringType = typename json_pointer<RefStringTypeLhs>::string_t>
+JSON_HEDLEY_DEPRECATED_FOR(3.11.2, operator!=(json_pointer, json_pointer))
+inline bool operator!=(const json_pointer<RefStringTypeLhs>& lhs,
+                       const StringType& rhs)
+{
+    return !(lhs == rhs);
+}
+
+template<typename RefStringTypeRhs,
+         typename StringType = typename json_pointer<RefStringTypeRhs>::string_t>
+JSON_HEDLEY_DEPRECATED_FOR(3.11.2, operator!=(json_pointer, json_pointer))
+inline bool operator!=(const StringType& lhs,
+                       const json_pointer<RefStringTypeRhs>& rhs)
+{
+    return !(lhs == rhs);
+}
+
+template<typename RefStringTypeLhs, typename RefStringTypeRhs>
+inline bool operator<(const json_pointer<RefStringTypeLhs>& lhs,
+                      const json_pointer<RefStringTypeRhs>& rhs) noexcept
+{
+    return lhs.reference_tokens < rhs.reference_tokens;
+}
+#endif
+
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/json_ref.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <initializer_list>
+#include <utility>
+
+// #include <nlohmann/detail/abi_macros.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+template<typename BasicJsonType>
+class json_ref
+{
+  public:
+    using value_type = BasicJsonType;
+
+    json_ref(value_type&& value)
+        : owned_value(std::move(value))
+    {}
+
+    json_ref(const value_type& value)
+        : value_ref(&value)
+    {}
+
+    json_ref(std::initializer_list<json_ref> init)
+        : owned_value(init)
+    {}
+
+    template <
+        class... Args,
+        enable_if_t<std::is_constructible<value_type, Args...>::value, int> = 0 >
+    json_ref(Args && ... args)
+        : owned_value(std::forward<Args>(args)...)
+    {}
+
+    // class should be movable only
+    json_ref(json_ref&&) noexcept = default;
+    json_ref(const json_ref&) = delete;
+    json_ref& operator=(const json_ref&) = delete;
+    json_ref& operator=(json_ref&&) = delete;
+    ~json_ref() = default;
+
+    value_type moved_or_copied() const
+    {
+        if (value_ref == nullptr)
+        {
+            return std::move(owned_value);
+        }
+        return *value_ref;
+    }
+
+    value_type const& operator*() const
+    {
+        return value_ref ? *value_ref : owned_value;
+    }
+
+    value_type const* operator->() const
+    {
+        return &** this;
+    }
+
+  private:
+    mutable value_type owned_value = nullptr;
+    value_type const* value_ref = nullptr;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+// #include <nlohmann/detail/string_escape.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/output/binary_writer.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // reverse
+#include <array> // array
+#include <map> // map
+#include <cmath> // isnan, isinf
+#include <cstdint> // uint8_t, uint16_t, uint32_t, uint64_t
+#include <cstring> // memcpy
+#include <limits> // numeric_limits
+#include <string> // string
+#include <utility> // move
+#include <vector> // vector
+
+// #include <nlohmann/detail/input/binary_reader.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/output/output_adapters.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // copy
+#include <cstddef> // size_t
+#include <iterator> // back_inserter
+#include <memory> // shared_ptr, make_shared
+#include <string> // basic_string
+#include <vector> // vector
+
+#ifndef JSON_NO_IO
+    #include <ios>      // streamsize
+    #include <ostream>  // basic_ostream
+#endif  // JSON_NO_IO
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/// abstract output adapter interface
+template<typename CharType> struct output_adapter_protocol
+{
+    virtual void write_character(CharType c) = 0;
+    virtual void write_characters(const CharType* s, std::size_t length) = 0;
+    virtual ~output_adapter_protocol() = default;
+
+    output_adapter_protocol() = default;
+    output_adapter_protocol(const output_adapter_protocol&) = default;
+    output_adapter_protocol(output_adapter_protocol&&) noexcept = default;
+    output_adapter_protocol& operator=(const output_adapter_protocol&) = default;
+    output_adapter_protocol& operator=(output_adapter_protocol&&) noexcept = default;
+};
+
+/// a type to simplify interfaces
+template<typename CharType>
+using output_adapter_t = std::shared_ptr<output_adapter_protocol<CharType>>;
+
+/// output adapter for byte vectors
+template<typename CharType, typename AllocatorType = std::allocator<CharType>>
+class output_vector_adapter : public output_adapter_protocol<CharType>
+{
+  public:
+    explicit output_vector_adapter(std::vector<CharType, AllocatorType>& vec) noexcept
+        : v(vec)
+    {}
+
+    void write_character(CharType c) override
+    {
+        v.push_back(c);
+    }
+
+    JSON_HEDLEY_NON_NULL(2)
+    void write_characters(const CharType* s, std::size_t length) override
+    {
+        v.insert(v.end(), s, s + length);
+    }
+
+  private:
+    std::vector<CharType, AllocatorType>& v;
+};
+
+#ifndef JSON_NO_IO
+/// output adapter for output streams
+template<typename CharType>
+class output_stream_adapter : public output_adapter_protocol<CharType>
+{
+  public:
+    explicit output_stream_adapter(std::basic_ostream<CharType>& s) noexcept
+        : stream(s)
+    {}
+
+    void write_character(CharType c) override
+    {
+        stream.put(c);
+    }
+
+    JSON_HEDLEY_NON_NULL(2)
+    void write_characters(const CharType* s, std::size_t length) override
+    {
+        stream.write(s, static_cast<std::streamsize>(length));
+    }
+
+  private:
+    std::basic_ostream<CharType>& stream;
+};
+#endif  // JSON_NO_IO
+
+/// output adapter for basic_string
+template<typename CharType, typename StringType = std::basic_string<CharType>>
+class output_string_adapter : public output_adapter_protocol<CharType>
+{
+  public:
+    explicit output_string_adapter(StringType& s) noexcept
+        : str(s)
+    {}
+
+    void write_character(CharType c) override
+    {
+        str.push_back(c);
+    }
+
+    JSON_HEDLEY_NON_NULL(2)
+    void write_characters(const CharType* s, std::size_t length) override
+    {
+        str.append(s, length);
+    }
+
+  private:
+    StringType& str;
+};
+
+template<typename CharType, typename StringType = std::basic_string<CharType>>
+class output_adapter
+{
+  public:
+    template<typename AllocatorType = std::allocator<CharType>>
+    output_adapter(std::vector<CharType, AllocatorType>& vec)
+        : oa(std::make_shared<output_vector_adapter<CharType, AllocatorType>>(vec)) {}
+
+#ifndef JSON_NO_IO
+    output_adapter(std::basic_ostream<CharType>& s)
+        : oa(std::make_shared<output_stream_adapter<CharType>>(s)) {}
+#endif  // JSON_NO_IO
+
+    output_adapter(StringType& s)
+        : oa(std::make_shared<output_string_adapter<CharType, StringType>>(s)) {}
+
+    operator output_adapter_t<CharType>()
+    {
+        return oa;
+    }
+
+  private:
+    output_adapter_t<CharType> oa = nullptr;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+///////////////////
+// binary writer //
+///////////////////
+
+/*!
+@brief serialization to CBOR and MessagePack values
+*/
+template<typename BasicJsonType, typename CharType>
+class binary_writer
+{
+    using string_t = typename BasicJsonType::string_t;
+    using binary_t = typename BasicJsonType::binary_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+
+  public:
+    /*!
+    @brief create a binary writer
+
+    @param[in] adapter  output adapter to write to
+    */
+    explicit binary_writer(output_adapter_t<CharType> adapter) : oa(std::move(adapter))
+    {
+        JSON_ASSERT(oa);
+    }
+
+    /*!
+    @param[in] j  JSON value to serialize
+    @pre       j.type() == value_t::object
+    */
+    void write_bson(const BasicJsonType& j)
+    {
+        switch (j.type())
+        {
+            case value_t::object:
+            {
+                write_bson_object(*j.m_data.m_value.object);
+                break;
+            }
+
+            case value_t::null:
+            case value_t::array:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                JSON_THROW(type_error::create(317, concat("to serialize to BSON, top-level type must be object, but is ", j.type_name()), &j));
+            }
+        }
+    }
+
+    /*!
+    @param[in] j  JSON value to serialize
+    */
+    void write_cbor(const BasicJsonType& j)
+    {
+        switch (j.type())
+        {
+            case value_t::null:
+            {
+                oa->write_character(to_char_type(0xF6));
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                oa->write_character(j.m_data.m_value.boolean
+                                    ? to_char_type(0xF5)
+                                    : to_char_type(0xF4));
+                break;
+            }
+
+            case value_t::number_integer:
+            {
+                if (j.m_data.m_value.number_integer >= 0)
+                {
+                    // CBOR does not differentiate between positive signed
+                    // integers and unsigned integers. Therefore, we used the
+                    // code from the value_t::number_unsigned case here.
+                    if (j.m_data.m_value.number_integer <= 0x17)
+                    {
+                        write_number(static_cast<std::uint8_t>(j.m_data.m_value.number_integer));
+                    }
+                    else if (j.m_data.m_value.number_integer <= (std::numeric_limits<std::uint8_t>::max)())
+                    {
+                        oa->write_character(to_char_type(0x18));
+                        write_number(static_cast<std::uint8_t>(j.m_data.m_value.number_integer));
+                    }
+                    else if (j.m_data.m_value.number_integer <= (std::numeric_limits<std::uint16_t>::max)())
+                    {
+                        oa->write_character(to_char_type(0x19));
+                        write_number(static_cast<std::uint16_t>(j.m_data.m_value.number_integer));
+                    }
+                    else if (j.m_data.m_value.number_integer <= (std::numeric_limits<std::uint32_t>::max)())
+                    {
+                        oa->write_character(to_char_type(0x1A));
+                        write_number(static_cast<std::uint32_t>(j.m_data.m_value.number_integer));
+                    }
+                    else
+                    {
+                        oa->write_character(to_char_type(0x1B));
+                        write_number(static_cast<std::uint64_t>(j.m_data.m_value.number_integer));
+                    }
+                }
+                else
+                {
+                    // The conversions below encode the sign in the first
+                    // byte, and the value is converted to a positive number.
+                    const auto positive_number = -1 - j.m_data.m_value.number_integer;
+                    if (j.m_data.m_value.number_integer >= -24)
+                    {
+                        write_number(static_cast<std::uint8_t>(0x20 + positive_number));
+                    }
+                    else if (positive_number <= (std::numeric_limits<std::uint8_t>::max)())
+                    {
+                        oa->write_character(to_char_type(0x38));
+                        write_number(static_cast<std::uint8_t>(positive_number));
+                    }
+                    else if (positive_number <= (std::numeric_limits<std::uint16_t>::max)())
+                    {
+                        oa->write_character(to_char_type(0x39));
+                        write_number(static_cast<std::uint16_t>(positive_number));
+                    }
+                    else if (positive_number <= (std::numeric_limits<std::uint32_t>::max)())
+                    {
+                        oa->write_character(to_char_type(0x3A));
+                        write_number(static_cast<std::uint32_t>(positive_number));
+                    }
+                    else
+                    {
+                        oa->write_character(to_char_type(0x3B));
+                        write_number(static_cast<std::uint64_t>(positive_number));
+                    }
+                }
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                if (j.m_data.m_value.number_unsigned <= 0x17)
+                {
+                    write_number(static_cast<std::uint8_t>(j.m_data.m_value.number_unsigned));
+                }
+                else if (j.m_data.m_value.number_unsigned <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x18));
+                    write_number(static_cast<std::uint8_t>(j.m_data.m_value.number_unsigned));
+                }
+                else if (j.m_data.m_value.number_unsigned <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x19));
+                    write_number(static_cast<std::uint16_t>(j.m_data.m_value.number_unsigned));
+                }
+                else if (j.m_data.m_value.number_unsigned <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x1A));
+                    write_number(static_cast<std::uint32_t>(j.m_data.m_value.number_unsigned));
+                }
+                else
+                {
+                    oa->write_character(to_char_type(0x1B));
+                    write_number(static_cast<std::uint64_t>(j.m_data.m_value.number_unsigned));
+                }
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                if (std::isnan(j.m_data.m_value.number_float))
+                {
+                    // NaN is 0xf97e00 in CBOR
+                    oa->write_character(to_char_type(0xF9));
+                    oa->write_character(to_char_type(0x7E));
+                    oa->write_character(to_char_type(0x00));
+                }
+                else if (std::isinf(j.m_data.m_value.number_float))
+                {
+                    // Infinity is 0xf97c00, -Infinity is 0xf9fc00
+                    oa->write_character(to_char_type(0xf9));
+                    oa->write_character(j.m_data.m_value.number_float > 0 ? to_char_type(0x7C) : to_char_type(0xFC));
+                    oa->write_character(to_char_type(0x00));
+                }
+                else
+                {
+                    write_compact_float(j.m_data.m_value.number_float, detail::input_format_t::cbor);
+                }
+                break;
+            }
+
+            case value_t::string:
+            {
+                // step 1: write control byte and the string length
+                const auto N = j.m_data.m_value.string->size();
+                if (N <= 0x17)
+                {
+                    write_number(static_cast<std::uint8_t>(0x60 + N));
+                }
+                else if (N <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x78));
+                    write_number(static_cast<std::uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x79));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x7A));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+                // LCOV_EXCL_START
+                else if (N <= (std::numeric_limits<std::uint64_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x7B));
+                    write_number(static_cast<std::uint64_t>(N));
+                }
+                // LCOV_EXCL_STOP
+
+                // step 2: write the string
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_data.m_value.string->c_str()),
+                    j.m_data.m_value.string->size());
+                break;
+            }
+
+            case value_t::array:
+            {
+                // step 1: write control byte and the array size
+                const auto N = j.m_data.m_value.array->size();
+                if (N <= 0x17)
+                {
+                    write_number(static_cast<std::uint8_t>(0x80 + N));
+                }
+                else if (N <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x98));
+                    write_number(static_cast<std::uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x99));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x9A));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+                // LCOV_EXCL_START
+                else if (N <= (std::numeric_limits<std::uint64_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x9B));
+                    write_number(static_cast<std::uint64_t>(N));
+                }
+                // LCOV_EXCL_STOP
+
+                // step 2: write each element
+                for (const auto& el : *j.m_data.m_value.array)
+                {
+                    write_cbor(el);
+                }
+                break;
+            }
+
+            case value_t::binary:
+            {
+                if (j.m_data.m_value.binary->has_subtype())
+                {
+                    if (j.m_data.m_value.binary->subtype() <= (std::numeric_limits<std::uint8_t>::max)())
+                    {
+                        write_number(static_cast<std::uint8_t>(0xd8));
+                        write_number(static_cast<std::uint8_t>(j.m_data.m_value.binary->subtype()));
+                    }
+                    else if (j.m_data.m_value.binary->subtype() <= (std::numeric_limits<std::uint16_t>::max)())
+                    {
+                        write_number(static_cast<std::uint8_t>(0xd9));
+                        write_number(static_cast<std::uint16_t>(j.m_data.m_value.binary->subtype()));
+                    }
+                    else if (j.m_data.m_value.binary->subtype() <= (std::numeric_limits<std::uint32_t>::max)())
+                    {
+                        write_number(static_cast<std::uint8_t>(0xda));
+                        write_number(static_cast<std::uint32_t>(j.m_data.m_value.binary->subtype()));
+                    }
+                    else if (j.m_data.m_value.binary->subtype() <= (std::numeric_limits<std::uint64_t>::max)())
+                    {
+                        write_number(static_cast<std::uint8_t>(0xdb));
+                        write_number(static_cast<std::uint64_t>(j.m_data.m_value.binary->subtype()));
+                    }
+                }
+
+                // step 1: write control byte and the binary array size
+                const auto N = j.m_data.m_value.binary->size();
+                if (N <= 0x17)
+                {
+                    write_number(static_cast<std::uint8_t>(0x40 + N));
+                }
+                else if (N <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x58));
+                    write_number(static_cast<std::uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x59));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x5A));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+                // LCOV_EXCL_START
+                else if (N <= (std::numeric_limits<std::uint64_t>::max)())
+                {
+                    oa->write_character(to_char_type(0x5B));
+                    write_number(static_cast<std::uint64_t>(N));
+                }
+                // LCOV_EXCL_STOP
+
+                // step 2: write each element
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_data.m_value.binary->data()),
+                    N);
+
+                break;
+            }
+
+            case value_t::object:
+            {
+                // step 1: write control byte and the object size
+                const auto N = j.m_data.m_value.object->size();
+                if (N <= 0x17)
+                {
+                    write_number(static_cast<std::uint8_t>(0xA0 + N));
+                }
+                else if (N <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    oa->write_character(to_char_type(0xB8));
+                    write_number(static_cast<std::uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    oa->write_character(to_char_type(0xB9));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    oa->write_character(to_char_type(0xBA));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+                // LCOV_EXCL_START
+                else if (N <= (std::numeric_limits<std::uint64_t>::max)())
+                {
+                    oa->write_character(to_char_type(0xBB));
+                    write_number(static_cast<std::uint64_t>(N));
+                }
+                // LCOV_EXCL_STOP
+
+                // step 2: write each element
+                for (const auto& el : *j.m_data.m_value.object)
+                {
+                    write_cbor(el.first);
+                    write_cbor(el.second);
+                }
+                break;
+            }
+
+            case value_t::discarded:
+            default:
+                break;
+        }
+    }
+
+    /*!
+    @param[in] j  JSON value to serialize
+    */
+    void write_msgpack(const BasicJsonType& j)
+    {
+        switch (j.type())
+        {
+            case value_t::null: // nil
+            {
+                oa->write_character(to_char_type(0xC0));
+                break;
+            }
+
+            case value_t::boolean: // true and false
+            {
+                oa->write_character(j.m_data.m_value.boolean
+                                    ? to_char_type(0xC3)
+                                    : to_char_type(0xC2));
+                break;
+            }
+
+            case value_t::number_integer:
+            {
+                if (j.m_data.m_value.number_integer >= 0)
+                {
+                    // MessagePack does not differentiate between positive
+                    // signed integers and unsigned integers. Therefore, we used
+                    // the code from the value_t::number_unsigned case here.
+                    if (j.m_data.m_value.number_unsigned < 128)
+                    {
+                        // positive fixnum
+                        write_number(static_cast<std::uint8_t>(j.m_data.m_value.number_integer));
+                    }
+                    else if (j.m_data.m_value.number_unsigned <= (std::numeric_limits<std::uint8_t>::max)())
+                    {
+                        // uint 8
+                        oa->write_character(to_char_type(0xCC));
+                        write_number(static_cast<std::uint8_t>(j.m_data.m_value.number_integer));
+                    }
+                    else if (j.m_data.m_value.number_unsigned <= (std::numeric_limits<std::uint16_t>::max)())
+                    {
+                        // uint 16
+                        oa->write_character(to_char_type(0xCD));
+                        write_number(static_cast<std::uint16_t>(j.m_data.m_value.number_integer));
+                    }
+                    else if (j.m_data.m_value.number_unsigned <= (std::numeric_limits<std::uint32_t>::max)())
+                    {
+                        // uint 32
+                        oa->write_character(to_char_type(0xCE));
+                        write_number(static_cast<std::uint32_t>(j.m_data.m_value.number_integer));
+                    }
+                    else if (j.m_data.m_value.number_unsigned <= (std::numeric_limits<std::uint64_t>::max)())
+                    {
+                        // uint 64
+                        oa->write_character(to_char_type(0xCF));
+                        write_number(static_cast<std::uint64_t>(j.m_data.m_value.number_integer));
+                    }
+                }
+                else
+                {
+                    if (j.m_data.m_value.number_integer >= -32)
+                    {
+                        // negative fixnum
+                        write_number(static_cast<std::int8_t>(j.m_data.m_value.number_integer));
+                    }
+                    else if (j.m_data.m_value.number_integer >= (std::numeric_limits<std::int8_t>::min)() &&
+                             j.m_data.m_value.number_integer <= (std::numeric_limits<std::int8_t>::max)())
+                    {
+                        // int 8
+                        oa->write_character(to_char_type(0xD0));
+                        write_number(static_cast<std::int8_t>(j.m_data.m_value.number_integer));
+                    }
+                    else if (j.m_data.m_value.number_integer >= (std::numeric_limits<std::int16_t>::min)() &&
+                             j.m_data.m_value.number_integer <= (std::numeric_limits<std::int16_t>::max)())
+                    {
+                        // int 16
+                        oa->write_character(to_char_type(0xD1));
+                        write_number(static_cast<std::int16_t>(j.m_data.m_value.number_integer));
+                    }
+                    else if (j.m_data.m_value.number_integer >= (std::numeric_limits<std::int32_t>::min)() &&
+                             j.m_data.m_value.number_integer <= (std::numeric_limits<std::int32_t>::max)())
+                    {
+                        // int 32
+                        oa->write_character(to_char_type(0xD2));
+                        write_number(static_cast<std::int32_t>(j.m_data.m_value.number_integer));
+                    }
+                    else if (j.m_data.m_value.number_integer >= (std::numeric_limits<std::int64_t>::min)() &&
+                             j.m_data.m_value.number_integer <= (std::numeric_limits<std::int64_t>::max)())
+                    {
+                        // int 64
+                        oa->write_character(to_char_type(0xD3));
+                        write_number(static_cast<std::int64_t>(j.m_data.m_value.number_integer));
+                    }
+                }
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                if (j.m_data.m_value.number_unsigned < 128)
+                {
+                    // positive fixnum
+                    write_number(static_cast<std::uint8_t>(j.m_data.m_value.number_integer));
+                }
+                else if (j.m_data.m_value.number_unsigned <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    // uint 8
+                    oa->write_character(to_char_type(0xCC));
+                    write_number(static_cast<std::uint8_t>(j.m_data.m_value.number_integer));
+                }
+                else if (j.m_data.m_value.number_unsigned <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    // uint 16
+                    oa->write_character(to_char_type(0xCD));
+                    write_number(static_cast<std::uint16_t>(j.m_data.m_value.number_integer));
+                }
+                else if (j.m_data.m_value.number_unsigned <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    // uint 32
+                    oa->write_character(to_char_type(0xCE));
+                    write_number(static_cast<std::uint32_t>(j.m_data.m_value.number_integer));
+                }
+                else if (j.m_data.m_value.number_unsigned <= (std::numeric_limits<std::uint64_t>::max)())
+                {
+                    // uint 64
+                    oa->write_character(to_char_type(0xCF));
+                    write_number(static_cast<std::uint64_t>(j.m_data.m_value.number_integer));
+                }
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                write_compact_float(j.m_data.m_value.number_float, detail::input_format_t::msgpack);
+                break;
+            }
+
+            case value_t::string:
+            {
+                // step 1: write control byte and the string length
+                const auto N = j.m_data.m_value.string->size();
+                if (N <= 31)
+                {
+                    // fixstr
+                    write_number(static_cast<std::uint8_t>(0xA0 | N));
+                }
+                else if (N <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    // str 8
+                    oa->write_character(to_char_type(0xD9));
+                    write_number(static_cast<std::uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    // str 16
+                    oa->write_character(to_char_type(0xDA));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    // str 32
+                    oa->write_character(to_char_type(0xDB));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+
+                // step 2: write the string
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_data.m_value.string->c_str()),
+                    j.m_data.m_value.string->size());
+                break;
+            }
+
+            case value_t::array:
+            {
+                // step 1: write control byte and the array size
+                const auto N = j.m_data.m_value.array->size();
+                if (N <= 15)
+                {
+                    // fixarray
+                    write_number(static_cast<std::uint8_t>(0x90 | N));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    // array 16
+                    oa->write_character(to_char_type(0xDC));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    // array 32
+                    oa->write_character(to_char_type(0xDD));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+
+                // step 2: write each element
+                for (const auto& el : *j.m_data.m_value.array)
+                {
+                    write_msgpack(el);
+                }
+                break;
+            }
+
+            case value_t::binary:
+            {
+                // step 0: determine if the binary type has a set subtype to
+                // determine whether or not to use the ext or fixext types
+                const bool use_ext = j.m_data.m_value.binary->has_subtype();
+
+                // step 1: write control byte and the byte string length
+                const auto N = j.m_data.m_value.binary->size();
+                if (N <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    std::uint8_t output_type{};
+                    bool fixed = true;
+                    if (use_ext)
+                    {
+                        switch (N)
+                        {
+                            case 1:
+                                output_type = 0xD4; // fixext 1
+                                break;
+                            case 2:
+                                output_type = 0xD5; // fixext 2
+                                break;
+                            case 4:
+                                output_type = 0xD6; // fixext 4
+                                break;
+                            case 8:
+                                output_type = 0xD7; // fixext 8
+                                break;
+                            case 16:
+                                output_type = 0xD8; // fixext 16
+                                break;
+                            default:
+                                output_type = 0xC7; // ext 8
+                                fixed = false;
+                                break;
+                        }
+
+                    }
+                    else
+                    {
+                        output_type = 0xC4; // bin 8
+                        fixed = false;
+                    }
+
+                    oa->write_character(to_char_type(output_type));
+                    if (!fixed)
+                    {
+                        write_number(static_cast<std::uint8_t>(N));
+                    }
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    const std::uint8_t output_type = use_ext
+                                                     ? 0xC8 // ext 16
+                                                     : 0xC5; // bin 16
+
+                    oa->write_character(to_char_type(output_type));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    const std::uint8_t output_type = use_ext
+                                                     ? 0xC9 // ext 32
+                                                     : 0xC6; // bin 32
+
+                    oa->write_character(to_char_type(output_type));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+
+                // step 1.5: if this is an ext type, write the subtype
+                if (use_ext)
+                {
+                    write_number(static_cast<std::int8_t>(j.m_data.m_value.binary->subtype()));
+                }
+
+                // step 2: write the byte string
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_data.m_value.binary->data()),
+                    N);
+
+                break;
+            }
+
+            case value_t::object:
+            {
+                // step 1: write control byte and the object size
+                const auto N = j.m_data.m_value.object->size();
+                if (N <= 15)
+                {
+                    // fixmap
+                    write_number(static_cast<std::uint8_t>(0x80 | (N & 0xF)));
+                }
+                else if (N <= (std::numeric_limits<std::uint16_t>::max)())
+                {
+                    // map 16
+                    oa->write_character(to_char_type(0xDE));
+                    write_number(static_cast<std::uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<std::uint32_t>::max)())
+                {
+                    // map 32
+                    oa->write_character(to_char_type(0xDF));
+                    write_number(static_cast<std::uint32_t>(N));
+                }
+
+                // step 2: write each element
+                for (const auto& el : *j.m_data.m_value.object)
+                {
+                    write_msgpack(el.first);
+                    write_msgpack(el.second);
+                }
+                break;
+            }
+
+            case value_t::discarded:
+            default:
+                break;
+        }
+    }
+
+    /*!
+    @param[in] j  JSON value to serialize
+    @param[in] use_count   whether to use '#' prefixes (optimized format)
+    @param[in] use_type    whether to use '$' prefixes (optimized format)
+    @param[in] add_prefix  whether prefixes need to be used for this value
+    @param[in] use_bjdata  whether write in BJData format, default is false
+    */
+    void write_ubjson(const BasicJsonType& j, const bool use_count,
+                      const bool use_type, const bool add_prefix = true,
+                      const bool use_bjdata = false)
+    {
+        switch (j.type())
+        {
+            case value_t::null:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(to_char_type('Z'));
+                }
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(j.m_data.m_value.boolean
+                                        ? to_char_type('T')
+                                        : to_char_type('F'));
+                }
+                break;
+            }
+
+            case value_t::number_integer:
+            {
+                write_number_with_ubjson_prefix(j.m_data.m_value.number_integer, add_prefix, use_bjdata);
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                write_number_with_ubjson_prefix(j.m_data.m_value.number_unsigned, add_prefix, use_bjdata);
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                write_number_with_ubjson_prefix(j.m_data.m_value.number_float, add_prefix, use_bjdata);
+                break;
+            }
+
+            case value_t::string:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(to_char_type('S'));
+                }
+                write_number_with_ubjson_prefix(j.m_data.m_value.string->size(), true, use_bjdata);
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_data.m_value.string->c_str()),
+                    j.m_data.m_value.string->size());
+                break;
+            }
+
+            case value_t::array:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(to_char_type('['));
+                }
+
+                bool prefix_required = true;
+                if (use_type && !j.m_data.m_value.array->empty())
+                {
+                    JSON_ASSERT(use_count);
+                    const CharType first_prefix = ubjson_prefix(j.front(), use_bjdata);
+                    const bool same_prefix = std::all_of(j.begin() + 1, j.end(),
+                                                         [this, first_prefix, use_bjdata](const BasicJsonType & v)
+                    {
+                        return ubjson_prefix(v, use_bjdata) == first_prefix;
+                    });
+
+                    std::vector<CharType> bjdx = {'[', '{', 'S', 'H', 'T', 'F', 'N', 'Z'}; // excluded markers in bjdata optimized type
+
+                    if (same_prefix && !(use_bjdata && std::find(bjdx.begin(), bjdx.end(), first_prefix) != bjdx.end()))
+                    {
+                        prefix_required = false;
+                        oa->write_character(to_char_type('$'));
+                        oa->write_character(first_prefix);
+                    }
+                }
+
+                if (use_count)
+                {
+                    oa->write_character(to_char_type('#'));
+                    write_number_with_ubjson_prefix(j.m_data.m_value.array->size(), true, use_bjdata);
+                }
+
+                for (const auto& el : *j.m_data.m_value.array)
+                {
+                    write_ubjson(el, use_count, use_type, prefix_required, use_bjdata);
+                }
+
+                if (!use_count)
+                {
+                    oa->write_character(to_char_type(']'));
+                }
+
+                break;
+            }
+
+            case value_t::binary:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(to_char_type('['));
+                }
+
+                if (use_type && !j.m_data.m_value.binary->empty())
+                {
+                    JSON_ASSERT(use_count);
+                    oa->write_character(to_char_type('$'));
+                    oa->write_character('U');
+                }
+
+                if (use_count)
+                {
+                    oa->write_character(to_char_type('#'));
+                    write_number_with_ubjson_prefix(j.m_data.m_value.binary->size(), true, use_bjdata);
+                }
+
+                if (use_type)
+                {
+                    oa->write_characters(
+                        reinterpret_cast<const CharType*>(j.m_data.m_value.binary->data()),
+                        j.m_data.m_value.binary->size());
+                }
+                else
+                {
+                    for (size_t i = 0; i < j.m_data.m_value.binary->size(); ++i)
+                    {
+                        oa->write_character(to_char_type('U'));
+                        oa->write_character(j.m_data.m_value.binary->data()[i]);
+                    }
+                }
+
+                if (!use_count)
+                {
+                    oa->write_character(to_char_type(']'));
+                }
+
+                break;
+            }
+
+            case value_t::object:
+            {
+                if (use_bjdata && j.m_data.m_value.object->size() == 3 && j.m_data.m_value.object->find("_ArrayType_") != j.m_data.m_value.object->end() && j.m_data.m_value.object->find("_ArraySize_") != j.m_data.m_value.object->end() && j.m_data.m_value.object->find("_ArrayData_") != j.m_data.m_value.object->end())
+                {
+                    if (!write_bjdata_ndarray(*j.m_data.m_value.object, use_count, use_type))  // decode bjdata ndarray in the JData format (https://github.com/NeuroJSON/jdata)
+                    {
+                        break;
+                    }
+                }
+
+                if (add_prefix)
+                {
+                    oa->write_character(to_char_type('{'));
+                }
+
+                bool prefix_required = true;
+                if (use_type && !j.m_data.m_value.object->empty())
+                {
+                    JSON_ASSERT(use_count);
+                    const CharType first_prefix = ubjson_prefix(j.front(), use_bjdata);
+                    const bool same_prefix = std::all_of(j.begin(), j.end(),
+                                                         [this, first_prefix, use_bjdata](const BasicJsonType & v)
+                    {
+                        return ubjson_prefix(v, use_bjdata) == first_prefix;
+                    });
+
+                    std::vector<CharType> bjdx = {'[', '{', 'S', 'H', 'T', 'F', 'N', 'Z'}; // excluded markers in bjdata optimized type
+
+                    if (same_prefix && !(use_bjdata && std::find(bjdx.begin(), bjdx.end(), first_prefix) != bjdx.end()))
+                    {
+                        prefix_required = false;
+                        oa->write_character(to_char_type('$'));
+                        oa->write_character(first_prefix);
+                    }
+                }
+
+                if (use_count)
+                {
+                    oa->write_character(to_char_type('#'));
+                    write_number_with_ubjson_prefix(j.m_data.m_value.object->size(), true, use_bjdata);
+                }
+
+                for (const auto& el : *j.m_data.m_value.object)
+                {
+                    write_number_with_ubjson_prefix(el.first.size(), true, use_bjdata);
+                    oa->write_characters(
+                        reinterpret_cast<const CharType*>(el.first.c_str()),
+                        el.first.size());
+                    write_ubjson(el.second, use_count, use_type, prefix_required, use_bjdata);
+                }
+
+                if (!use_count)
+                {
+                    oa->write_character(to_char_type('}'));
+                }
+
+                break;
+            }
+
+            case value_t::discarded:
+            default:
+                break;
+        }
+    }
+
+  private:
+    //////////
+    // BSON //
+    //////////
+
+    /*!
+    @return The size of a BSON document entry header, including the id marker
+            and the entry name size (and its null-terminator).
+    */
+    static std::size_t calc_bson_entry_header_size(const string_t& name, const BasicJsonType& j)
+    {
+        const auto it = name.find(static_cast<typename string_t::value_type>(0));
+        if (JSON_HEDLEY_UNLIKELY(it != BasicJsonType::string_t::npos))
+        {
+            JSON_THROW(out_of_range::create(409, concat("BSON key cannot contain code point U+0000 (at byte ", std::to_string(it), ")"), &j));
+            static_cast<void>(j);
+        }
+
+        return /*id*/ 1ul + name.size() + /*zero-terminator*/1u;
+    }
+
+    /*!
+    @brief Writes the given @a element_type and @a name to the output adapter
+    */
+    void write_bson_entry_header(const string_t& name,
+                                 const std::uint8_t element_type)
+    {
+        oa->write_character(to_char_type(element_type)); // boolean
+        oa->write_characters(
+            reinterpret_cast<const CharType*>(name.c_str()),
+            name.size() + 1u);
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and boolean value @a value
+    */
+    void write_bson_boolean(const string_t& name,
+                            const bool value)
+    {
+        write_bson_entry_header(name, 0x08);
+        oa->write_character(value ? to_char_type(0x01) : to_char_type(0x00));
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and double value @a value
+    */
+    void write_bson_double(const string_t& name,
+                           const double value)
+    {
+        write_bson_entry_header(name, 0x01);
+        write_number<double>(value, true);
+    }
+
+    /*!
+    @return The size of the BSON-encoded string in @a value
+    */
+    static std::size_t calc_bson_string_size(const string_t& value)
+    {
+        return sizeof(std::int32_t) + value.size() + 1ul;
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and string value @a value
+    */
+    void write_bson_string(const string_t& name,
+                           const string_t& value)
+    {
+        write_bson_entry_header(name, 0x02);
+
+        write_number<std::int32_t>(static_cast<std::int32_t>(value.size() + 1ul), true);
+        oa->write_characters(
+            reinterpret_cast<const CharType*>(value.c_str()),
+            value.size() + 1);
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and null value
+    */
+    void write_bson_null(const string_t& name)
+    {
+        write_bson_entry_header(name, 0x0A);
+    }
+
+    /*!
+    @return The size of the BSON-encoded integer @a value
+    */
+    static std::size_t calc_bson_integer_size(const std::int64_t value)
+    {
+        return (std::numeric_limits<std::int32_t>::min)() <= value && value <= (std::numeric_limits<std::int32_t>::max)()
+               ? sizeof(std::int32_t)
+               : sizeof(std::int64_t);
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and integer @a value
+    */
+    void write_bson_integer(const string_t& name,
+                            const std::int64_t value)
+    {
+        if ((std::numeric_limits<std::int32_t>::min)() <= value && value <= (std::numeric_limits<std::int32_t>::max)())
+        {
+            write_bson_entry_header(name, 0x10); // int32
+            write_number<std::int32_t>(static_cast<std::int32_t>(value), true);
+        }
+        else
+        {
+            write_bson_entry_header(name, 0x12); // int64
+            write_number<std::int64_t>(static_cast<std::int64_t>(value), true);
+        }
+    }
+
+    /*!
+    @return The size of the BSON-encoded unsigned integer in @a j
+    */
+    static constexpr std::size_t calc_bson_unsigned_size(const std::uint64_t value) noexcept
+    {
+        return (value <= static_cast<std::uint64_t>((std::numeric_limits<std::int32_t>::max)()))
+               ? sizeof(std::int32_t)
+               : sizeof(std::int64_t);
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and unsigned @a value
+    */
+    void write_bson_unsigned(const string_t& name,
+                             const BasicJsonType& j)
+    {
+        if (j.m_data.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::int32_t>::max)()))
+        {
+            write_bson_entry_header(name, 0x10 /* int32 */);
+            write_number<std::int32_t>(static_cast<std::int32_t>(j.m_data.m_value.number_unsigned), true);
+        }
+        else if (j.m_data.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::int64_t>::max)()))
+        {
+            write_bson_entry_header(name, 0x12 /* int64 */);
+            write_number<std::int64_t>(static_cast<std::int64_t>(j.m_data.m_value.number_unsigned), true);
+        }
+        else
+        {
+            JSON_THROW(out_of_range::create(407, concat("integer number ", std::to_string(j.m_data.m_value.number_unsigned), " cannot be represented by BSON as it does not fit int64"), &j));
+        }
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and object @a value
+    */
+    void write_bson_object_entry(const string_t& name,
+                                 const typename BasicJsonType::object_t& value)
+    {
+        write_bson_entry_header(name, 0x03); // object
+        write_bson_object(value);
+    }
+
+    /*!
+    @return The size of the BSON-encoded array @a value
+    */
+    static std::size_t calc_bson_array_size(const typename BasicJsonType::array_t& value)
+    {
+        std::size_t array_index = 0ul;
+
+        const std::size_t embedded_document_size = std::accumulate(std::begin(value), std::end(value), static_cast<std::size_t>(0), [&array_index](std::size_t result, const typename BasicJsonType::array_t::value_type & el)
+        {
+            return result + calc_bson_element_size(std::to_string(array_index++), el);
+        });
+
+        return sizeof(std::int32_t) + embedded_document_size + 1ul;
+    }
+
+    /*!
+    @return The size of the BSON-encoded binary array @a value
+    */
+    static std::size_t calc_bson_binary_size(const typename BasicJsonType::binary_t& value)
+    {
+        return sizeof(std::int32_t) + value.size() + 1ul;
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and array @a value
+    */
+    void write_bson_array(const string_t& name,
+                          const typename BasicJsonType::array_t& value)
+    {
+        write_bson_entry_header(name, 0x04); // array
+        write_number<std::int32_t>(static_cast<std::int32_t>(calc_bson_array_size(value)), true);
+
+        std::size_t array_index = 0ul;
+
+        for (const auto& el : value)
+        {
+            write_bson_element(std::to_string(array_index++), el);
+        }
+
+        oa->write_character(to_char_type(0x00));
+    }
+
+    /*!
+    @brief Writes a BSON element with key @a name and binary value @a value
+    */
+    void write_bson_binary(const string_t& name,
+                           const binary_t& value)
+    {
+        write_bson_entry_header(name, 0x05);
+
+        write_number<std::int32_t>(static_cast<std::int32_t>(value.size()), true);
+        write_number(value.has_subtype() ? static_cast<std::uint8_t>(value.subtype()) : static_cast<std::uint8_t>(0x00));
+
+        oa->write_characters(reinterpret_cast<const CharType*>(value.data()), value.size());
+    }
+
+    /*!
+    @brief Calculates the size necessary to serialize the JSON value @a j with its @a name
+    @return The calculated size for the BSON document entry for @a j with the given @a name.
+    */
+    static std::size_t calc_bson_element_size(const string_t& name,
+            const BasicJsonType& j)
+    {
+        const auto header_size = calc_bson_entry_header_size(name, j);
+        switch (j.type())
+        {
+            case value_t::object:
+                return header_size + calc_bson_object_size(*j.m_data.m_value.object);
+
+            case value_t::array:
+                return header_size + calc_bson_array_size(*j.m_data.m_value.array);
+
+            case value_t::binary:
+                return header_size + calc_bson_binary_size(*j.m_data.m_value.binary);
+
+            case value_t::boolean:
+                return header_size + 1ul;
+
+            case value_t::number_float:
+                return header_size + 8ul;
+
+            case value_t::number_integer:
+                return header_size + calc_bson_integer_size(j.m_data.m_value.number_integer);
+
+            case value_t::number_unsigned:
+                return header_size + calc_bson_unsigned_size(j.m_data.m_value.number_unsigned);
+
+            case value_t::string:
+                return header_size + calc_bson_string_size(*j.m_data.m_value.string);
+
+            case value_t::null:
+                return header_size + 0ul;
+
+            // LCOV_EXCL_START
+            case value_t::discarded:
+            default:
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert)
+                return 0ul;
+                // LCOV_EXCL_STOP
+        }
+    }
+
+    /*!
+    @brief Serializes the JSON value @a j to BSON and associates it with the
+           key @a name.
+    @param name The name to associate with the JSON entity @a j within the
+                current BSON document
+    */
+    void write_bson_element(const string_t& name,
+                            const BasicJsonType& j)
+    {
+        switch (j.type())
+        {
+            case value_t::object:
+                return write_bson_object_entry(name, *j.m_data.m_value.object);
+
+            case value_t::array:
+                return write_bson_array(name, *j.m_data.m_value.array);
+
+            case value_t::binary:
+                return write_bson_binary(name, *j.m_data.m_value.binary);
+
+            case value_t::boolean:
+                return write_bson_boolean(name, j.m_data.m_value.boolean);
+
+            case value_t::number_float:
+                return write_bson_double(name, j.m_data.m_value.number_float);
+
+            case value_t::number_integer:
+                return write_bson_integer(name, j.m_data.m_value.number_integer);
+
+            case value_t::number_unsigned:
+                return write_bson_unsigned(name, j);
+
+            case value_t::string:
+                return write_bson_string(name, *j.m_data.m_value.string);
+
+            case value_t::null:
+                return write_bson_null(name);
+
+            // LCOV_EXCL_START
+            case value_t::discarded:
+            default:
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert)
+                return;
+                // LCOV_EXCL_STOP
+        }
+    }
+
+    /*!
+    @brief Calculates the size of the BSON serialization of the given
+           JSON-object @a j.
+    @param[in] value  JSON value to serialize
+    @pre       value.type() == value_t::object
+    */
+    static std::size_t calc_bson_object_size(const typename BasicJsonType::object_t& value)
+    {
+        const std::size_t document_size = std::accumulate(value.begin(), value.end(), static_cast<std::size_t>(0),
+                                          [](size_t result, const typename BasicJsonType::object_t::value_type & el)
+        {
+            return result += calc_bson_element_size(el.first, el.second);
+        });
+
+        return sizeof(std::int32_t) + document_size + 1ul;
+    }
+
+    /*!
+    @param[in] value  JSON value to serialize
+    @pre       value.type() == value_t::object
+    */
+    void write_bson_object(const typename BasicJsonType::object_t& value)
+    {
+        write_number<std::int32_t>(static_cast<std::int32_t>(calc_bson_object_size(value)), true);
+
+        for (const auto& el : value)
+        {
+            write_bson_element(el.first, el.second);
+        }
+
+        oa->write_character(to_char_type(0x00));
+    }
+
+    //////////
+    // CBOR //
+    //////////
+
+    static constexpr CharType get_cbor_float_prefix(float /*unused*/)
+    {
+        return to_char_type(0xFA);  // Single-Precision Float
+    }
+
+    static constexpr CharType get_cbor_float_prefix(double /*unused*/)
+    {
+        return to_char_type(0xFB);  // Double-Precision Float
+    }
+
+    /////////////
+    // MsgPack //
+    /////////////
+
+    static constexpr CharType get_msgpack_float_prefix(float /*unused*/)
+    {
+        return to_char_type(0xCA);  // float 32
+    }
+
+    static constexpr CharType get_msgpack_float_prefix(double /*unused*/)
+    {
+        return to_char_type(0xCB);  // float 64
+    }
+
+    ////////////
+    // UBJSON //
+    ////////////
+
+    // UBJSON: write number (floating point)
+    template<typename NumberType, typename std::enable_if<
+                 std::is_floating_point<NumberType>::value, int>::type = 0>
+    void write_number_with_ubjson_prefix(const NumberType n,
+                                         const bool add_prefix,
+                                         const bool use_bjdata)
+    {
+        if (add_prefix)
+        {
+            oa->write_character(get_ubjson_float_prefix(n));
+        }
+        write_number(n, use_bjdata);
+    }
+
+    // UBJSON: write number (unsigned integer)
+    template<typename NumberType, typename std::enable_if<
+                 std::is_unsigned<NumberType>::value, int>::type = 0>
+    void write_number_with_ubjson_prefix(const NumberType n,
+                                         const bool add_prefix,
+                                         const bool use_bjdata)
+    {
+        if (n <= static_cast<std::uint64_t>((std::numeric_limits<std::int8_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('i'));  // int8
+            }
+            write_number(static_cast<std::uint8_t>(n), use_bjdata);
+        }
+        else if (n <= (std::numeric_limits<std::uint8_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('U'));  // uint8
+            }
+            write_number(static_cast<std::uint8_t>(n), use_bjdata);
+        }
+        else if (n <= static_cast<std::uint64_t>((std::numeric_limits<std::int16_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('I'));  // int16
+            }
+            write_number(static_cast<std::int16_t>(n), use_bjdata);
+        }
+        else if (use_bjdata && n <= static_cast<uint64_t>((std::numeric_limits<uint16_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('u'));  // uint16 - bjdata only
+            }
+            write_number(static_cast<std::uint16_t>(n), use_bjdata);
+        }
+        else if (n <= static_cast<std::uint64_t>((std::numeric_limits<std::int32_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('l'));  // int32
+            }
+            write_number(static_cast<std::int32_t>(n), use_bjdata);
+        }
+        else if (use_bjdata && n <= static_cast<uint64_t>((std::numeric_limits<uint32_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('m'));  // uint32 - bjdata only
+            }
+            write_number(static_cast<std::uint32_t>(n), use_bjdata);
+        }
+        else if (n <= static_cast<std::uint64_t>((std::numeric_limits<std::int64_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('L'));  // int64
+            }
+            write_number(static_cast<std::int64_t>(n), use_bjdata);
+        }
+        else if (use_bjdata && n <= (std::numeric_limits<uint64_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('M'));  // uint64 - bjdata only
+            }
+            write_number(static_cast<std::uint64_t>(n), use_bjdata);
+        }
+        else
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('H'));  // high-precision number
+            }
+
+            const auto number = BasicJsonType(n).dump();
+            write_number_with_ubjson_prefix(number.size(), true, use_bjdata);
+            for (std::size_t i = 0; i < number.size(); ++i)
+            {
+                oa->write_character(to_char_type(static_cast<std::uint8_t>(number[i])));
+            }
+        }
+    }
+
+    // UBJSON: write number (signed integer)
+    template < typename NumberType, typename std::enable_if <
+                   std::is_signed<NumberType>::value&&
+                   !std::is_floating_point<NumberType>::value, int >::type = 0 >
+    void write_number_with_ubjson_prefix(const NumberType n,
+                                         const bool add_prefix,
+                                         const bool use_bjdata)
+    {
+        if ((std::numeric_limits<std::int8_t>::min)() <= n && n <= (std::numeric_limits<std::int8_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('i'));  // int8
+            }
+            write_number(static_cast<std::int8_t>(n), use_bjdata);
+        }
+        else if (static_cast<std::int64_t>((std::numeric_limits<std::uint8_t>::min)()) <= n && n <= static_cast<std::int64_t>((std::numeric_limits<std::uint8_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('U'));  // uint8
+            }
+            write_number(static_cast<std::uint8_t>(n), use_bjdata);
+        }
+        else if ((std::numeric_limits<std::int16_t>::min)() <= n && n <= (std::numeric_limits<std::int16_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('I'));  // int16
+            }
+            write_number(static_cast<std::int16_t>(n), use_bjdata);
+        }
+        else if (use_bjdata && (static_cast<std::int64_t>((std::numeric_limits<std::uint16_t>::min)()) <= n && n <= static_cast<std::int64_t>((std::numeric_limits<std::uint16_t>::max)())))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('u'));  // uint16 - bjdata only
+            }
+            write_number(static_cast<uint16_t>(n), use_bjdata);
+        }
+        else if ((std::numeric_limits<std::int32_t>::min)() <= n && n <= (std::numeric_limits<std::int32_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('l'));  // int32
+            }
+            write_number(static_cast<std::int32_t>(n), use_bjdata);
+        }
+        else if (use_bjdata && (static_cast<std::int64_t>((std::numeric_limits<std::uint32_t>::min)()) <= n && n <= static_cast<std::int64_t>((std::numeric_limits<std::uint32_t>::max)())))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('m'));  // uint32 - bjdata only
+            }
+            write_number(static_cast<uint32_t>(n), use_bjdata);
+        }
+        else if ((std::numeric_limits<std::int64_t>::min)() <= n && n <= (std::numeric_limits<std::int64_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('L'));  // int64
+            }
+            write_number(static_cast<std::int64_t>(n), use_bjdata);
+        }
+        // LCOV_EXCL_START
+        else
+        {
+            if (add_prefix)
+            {
+                oa->write_character(to_char_type('H'));  // high-precision number
+            }
+
+            const auto number = BasicJsonType(n).dump();
+            write_number_with_ubjson_prefix(number.size(), true, use_bjdata);
+            for (std::size_t i = 0; i < number.size(); ++i)
+            {
+                oa->write_character(to_char_type(static_cast<std::uint8_t>(number[i])));
+            }
+        }
+        // LCOV_EXCL_STOP
+    }
+
+    /*!
+    @brief determine the type prefix of container values
+    */
+    CharType ubjson_prefix(const BasicJsonType& j, const bool use_bjdata) const noexcept
+    {
+        switch (j.type())
+        {
+            case value_t::null:
+                return 'Z';
+
+            case value_t::boolean:
+                return j.m_data.m_value.boolean ? 'T' : 'F';
+
+            case value_t::number_integer:
+            {
+                if ((std::numeric_limits<std::int8_t>::min)() <= j.m_data.m_value.number_integer && j.m_data.m_value.number_integer <= (std::numeric_limits<std::int8_t>::max)())
+                {
+                    return 'i';
+                }
+                if ((std::numeric_limits<std::uint8_t>::min)() <= j.m_data.m_value.number_integer && j.m_data.m_value.number_integer <= (std::numeric_limits<std::uint8_t>::max)())
+                {
+                    return 'U';
+                }
+                if ((std::numeric_limits<std::int16_t>::min)() <= j.m_data.m_value.number_integer && j.m_data.m_value.number_integer <= (std::numeric_limits<std::int16_t>::max)())
+                {
+                    return 'I';
+                }
+                if (use_bjdata && ((std::numeric_limits<std::uint16_t>::min)() <= j.m_data.m_value.number_integer && j.m_data.m_value.number_integer <= (std::numeric_limits<std::uint16_t>::max)()))
+                {
+                    return 'u';
+                }
+                if ((std::numeric_limits<std::int32_t>::min)() <= j.m_data.m_value.number_integer && j.m_data.m_value.number_integer <= (std::numeric_limits<std::int32_t>::max)())
+                {
+                    return 'l';
+                }
+                if (use_bjdata && ((std::numeric_limits<std::uint32_t>::min)() <= j.m_data.m_value.number_integer && j.m_data.m_value.number_integer <= (std::numeric_limits<std::uint32_t>::max)()))
+                {
+                    return 'm';
+                }
+                if ((std::numeric_limits<std::int64_t>::min)() <= j.m_data.m_value.number_integer && j.m_data.m_value.number_integer <= (std::numeric_limits<std::int64_t>::max)())
+                {
+                    return 'L';
+                }
+                // anything else is treated as high-precision number
+                return 'H'; // LCOV_EXCL_LINE
+            }
+
+            case value_t::number_unsigned:
+            {
+                if (j.m_data.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::int8_t>::max)()))
+                {
+                    return 'i';
+                }
+                if (j.m_data.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::uint8_t>::max)()))
+                {
+                    return 'U';
+                }
+                if (j.m_data.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::int16_t>::max)()))
+                {
+                    return 'I';
+                }
+                if (use_bjdata && j.m_data.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::uint16_t>::max)()))
+                {
+                    return 'u';
+                }
+                if (j.m_data.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::int32_t>::max)()))
+                {
+                    return 'l';
+                }
+                if (use_bjdata && j.m_data.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::uint32_t>::max)()))
+                {
+                    return 'm';
+                }
+                if (j.m_data.m_value.number_unsigned <= static_cast<std::uint64_t>((std::numeric_limits<std::int64_t>::max)()))
+                {
+                    return 'L';
+                }
+                if (use_bjdata && j.m_data.m_value.number_unsigned <= (std::numeric_limits<std::uint64_t>::max)())
+                {
+                    return 'M';
+                }
+                // anything else is treated as high-precision number
+                return 'H'; // LCOV_EXCL_LINE
+            }
+
+            case value_t::number_float:
+                return get_ubjson_float_prefix(j.m_data.m_value.number_float);
+
+            case value_t::string:
+                return 'S';
+
+            case value_t::array: // fallthrough
+            case value_t::binary:
+                return '[';
+
+            case value_t::object:
+                return '{';
+
+            case value_t::discarded:
+            default:  // discarded values
+                return 'N';
+        }
+    }
+
+    static constexpr CharType get_ubjson_float_prefix(float /*unused*/)
+    {
+        return 'd';  // float 32
+    }
+
+    static constexpr CharType get_ubjson_float_prefix(double /*unused*/)
+    {
+        return 'D';  // float 64
+    }
+
+    /*!
+    @return false if the object is successfully converted to a bjdata ndarray, true if the type or size is invalid
+    */
+    bool write_bjdata_ndarray(const typename BasicJsonType::object_t& value, const bool use_count, const bool use_type)
+    {
+        std::map<string_t, CharType> bjdtype = {{"uint8", 'U'},  {"int8", 'i'},  {"uint16", 'u'}, {"int16", 'I'},
+            {"uint32", 'm'}, {"int32", 'l'}, {"uint64", 'M'}, {"int64", 'L'}, {"single", 'd'}, {"double", 'D'}, {"char", 'C'}
+        };
+
+        string_t key = "_ArrayType_";
+        auto it = bjdtype.find(static_cast<string_t>(value.at(key)));
+        if (it == bjdtype.end())
+        {
+            return true;
+        }
+        CharType dtype = it->second;
+
+        key = "_ArraySize_";
+        std::size_t len = (value.at(key).empty() ? 0 : 1);
+        for (const auto& el : value.at(key))
+        {
+            len *= static_cast<std::size_t>(el.m_data.m_value.number_unsigned);
+        }
+
+        key = "_ArrayData_";
+        if (value.at(key).size() != len)
+        {
+            return true;
+        }
+
+        oa->write_character('[');
+        oa->write_character('$');
+        oa->write_character(dtype);
+        oa->write_character('#');
+
+        key = "_ArraySize_";
+        write_ubjson(value.at(key), use_count, use_type, true,  true);
+
+        key = "_ArrayData_";
+        if (dtype == 'U' || dtype == 'C')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::uint8_t>(el.m_data.m_value.number_unsigned), true);
+            }
+        }
+        else if (dtype == 'i')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::int8_t>(el.m_data.m_value.number_integer), true);
+            }
+        }
+        else if (dtype == 'u')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::uint16_t>(el.m_data.m_value.number_unsigned), true);
+            }
+        }
+        else if (dtype == 'I')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::int16_t>(el.m_data.m_value.number_integer), true);
+            }
+        }
+        else if (dtype == 'm')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::uint32_t>(el.m_data.m_value.number_unsigned), true);
+            }
+        }
+        else if (dtype == 'l')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::int32_t>(el.m_data.m_value.number_integer), true);
+            }
+        }
+        else if (dtype == 'M')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::uint64_t>(el.m_data.m_value.number_unsigned), true);
+            }
+        }
+        else if (dtype == 'L')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<std::int64_t>(el.m_data.m_value.number_integer), true);
+            }
+        }
+        else if (dtype == 'd')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<float>(el.m_data.m_value.number_float), true);
+            }
+        }
+        else if (dtype == 'D')
+        {
+            for (const auto& el : value.at(key))
+            {
+                write_number(static_cast<double>(el.m_data.m_value.number_float), true);
+            }
+        }
+        return false;
+    }
+
+    ///////////////////////
+    // Utility functions //
+    ///////////////////////
+
+    /*
+    @brief write a number to output input
+    @param[in] n number of type @a NumberType
+    @param[in] OutputIsLittleEndian Set to true if output data is
+                                 required to be little endian
+    @tparam NumberType the type of the number
+
+    @note This function needs to respect the system's endianness, because bytes
+          in CBOR, MessagePack, and UBJSON are stored in network order (big
+          endian) and therefore need reordering on little endian systems.
+          On the other hand, BSON and BJData use little endian and should reorder
+          on big endian systems.
+    */
+    template<typename NumberType>
+    void write_number(const NumberType n, const bool OutputIsLittleEndian = false)
+    {
+        // step 1: write number to array of length NumberType
+        std::array<CharType, sizeof(NumberType)> vec{};
+        std::memcpy(vec.data(), &n, sizeof(NumberType));
+
+        // step 2: write array to output (with possible reordering)
+        if (is_little_endian != OutputIsLittleEndian)
+        {
+            // reverse byte order prior to conversion if necessary
+            std::reverse(vec.begin(), vec.end());
+        }
+
+        oa->write_characters(vec.data(), sizeof(NumberType));
+    }
+
+    void write_compact_float(const number_float_t n, detail::input_format_t format)
+    {
+#ifdef __GNUC__
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wfloat-equal"
+#endif
+        if (static_cast<double>(n) >= static_cast<double>(std::numeric_limits<float>::lowest()) &&
+                static_cast<double>(n) <= static_cast<double>((std::numeric_limits<float>::max)()) &&
+                static_cast<double>(static_cast<float>(n)) == static_cast<double>(n))
+        {
+            oa->write_character(format == detail::input_format_t::cbor
+                                ? get_cbor_float_prefix(static_cast<float>(n))
+                                : get_msgpack_float_prefix(static_cast<float>(n)));
+            write_number(static_cast<float>(n));
+        }
+        else
+        {
+            oa->write_character(format == detail::input_format_t::cbor
+                                ? get_cbor_float_prefix(n)
+                                : get_msgpack_float_prefix(n));
+            write_number(n);
+        }
+#ifdef __GNUC__
+#pragma GCC diagnostic pop
+#endif
+    }
+
+  public:
+    // The following to_char_type functions are implement the conversion
+    // between uint8_t and CharType. In case CharType is not unsigned,
+    // such a conversion is required to allow values greater than 128.
+    // See <https://github.com/nlohmann/json/issues/1286> for a discussion.
+    template < typename C = CharType,
+               enable_if_t < std::is_signed<C>::value && std::is_signed<char>::value > * = nullptr >
+    static constexpr CharType to_char_type(std::uint8_t x) noexcept
+    {
+        return *reinterpret_cast<char*>(&x);
+    }
+
+    template < typename C = CharType,
+               enable_if_t < std::is_signed<C>::value && std::is_unsigned<char>::value > * = nullptr >
+    static CharType to_char_type(std::uint8_t x) noexcept
+    {
+        static_assert(sizeof(std::uint8_t) == sizeof(CharType), "size of CharType must be equal to std::uint8_t");
+        static_assert(std::is_trivial<CharType>::value, "CharType must be trivial");
+        CharType result;
+        std::memcpy(&result, &x, sizeof(x));
+        return result;
+    }
+
+    template<typename C = CharType,
+             enable_if_t<std::is_unsigned<C>::value>* = nullptr>
+    static constexpr CharType to_char_type(std::uint8_t x) noexcept
+    {
+        return x;
+    }
+
+    template < typename InputCharType, typename C = CharType,
+               enable_if_t <
+                   std::is_signed<C>::value &&
+                   std::is_signed<char>::value &&
+                   std::is_same<char, typename std::remove_cv<InputCharType>::type>::value
+                   > * = nullptr >
+    static constexpr CharType to_char_type(InputCharType x) noexcept
+    {
+        return x;
+    }
+
+  private:
+    /// whether we can assume little endianness
+    const bool is_little_endian = little_endianness();
+
+    /// the output
+    output_adapter_t<CharType> oa = nullptr;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/output/output_adapters.hpp>
+
+// #include <nlohmann/detail/output/serializer.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2008-2009 Björn Hoehrmann <bjoern@hoehrmann.de>
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <algorithm> // reverse, remove, fill, find, none_of
+#include <array> // array
+#include <clocale> // localeconv, lconv
+#include <cmath> // labs, isfinite, isnan, signbit
+#include <cstddef> // size_t, ptrdiff_t
+#include <cstdint> // uint8_t
+#include <cstdio> // snprintf
+#include <limits> // numeric_limits
+#include <string> // string, char_traits
+#include <iomanip> // setfill, setw
+#include <type_traits> // is_same
+#include <utility> // move
+
+// #include <nlohmann/detail/conversions/to_chars.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2009 Florian Loitsch <https://florian.loitsch.com/>
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <array> // array
+#include <cmath>   // signbit, isfinite
+#include <cstdint> // intN_t, uintN_t
+#include <cstring> // memcpy, memmove
+#include <limits> // numeric_limits
+#include <type_traits> // conditional
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+/*!
+@brief implements the Grisu2 algorithm for binary to decimal floating-point
+conversion.
+
+This implementation is a slightly modified version of the reference
+implementation which may be obtained from
+http://florian.loitsch.com/publications (bench.tar.gz).
+
+The code is distributed under the MIT license, Copyright (c) 2009 Florian Loitsch.
+
+For a detailed description of the algorithm see:
+
+[1] Loitsch, "Printing Floating-Point Numbers Quickly and Accurately with
+    Integers", Proceedings of the ACM SIGPLAN 2010 Conference on Programming
+    Language Design and Implementation, PLDI 2010
+[2] Burger, Dybvig, "Printing Floating-Point Numbers Quickly and Accurately",
+    Proceedings of the ACM SIGPLAN 1996 Conference on Programming Language
+    Design and Implementation, PLDI 1996
+*/
+namespace dtoa_impl
+{
+
+template<typename Target, typename Source>
+Target reinterpret_bits(const Source source)
+{
+    static_assert(sizeof(Target) == sizeof(Source), "size mismatch");
+
+    Target target;
+    std::memcpy(&target, &source, sizeof(Source));
+    return target;
+}
+
+struct diyfp // f * 2^e
+{
+    static constexpr int kPrecision = 64; // = q
+
+    std::uint64_t f = 0;
+    int e = 0;
+
+    constexpr diyfp(std::uint64_t f_, int e_) noexcept : f(f_), e(e_) {}
+
+    /*!
+    @brief returns x - y
+    @pre x.e == y.e and x.f >= y.f
+    */
+    static diyfp sub(const diyfp& x, const diyfp& y) noexcept
+    {
+        JSON_ASSERT(x.e == y.e);
+        JSON_ASSERT(x.f >= y.f);
+
+        return {x.f - y.f, x.e};
+    }
+
+    /*!
+    @brief returns x * y
+    @note The result is rounded. (Only the upper q bits are returned.)
+    */
+    static diyfp mul(const diyfp& x, const diyfp& y) noexcept
+    {
+        static_assert(kPrecision == 64, "internal error");
+
+        // Computes:
+        //  f = round((x.f * y.f) / 2^q)
+        //  e = x.e + y.e + q
+
+        // Emulate the 64-bit * 64-bit multiplication:
+        //
+        // p = u * v
+        //   = (u_lo + 2^32 u_hi) (v_lo + 2^32 v_hi)
+        //   = (u_lo v_lo         ) + 2^32 ((u_lo v_hi         ) + (u_hi v_lo         )) + 2^64 (u_hi v_hi         )
+        //   = (p0                ) + 2^32 ((p1                ) + (p2                )) + 2^64 (p3                )
+        //   = (p0_lo + 2^32 p0_hi) + 2^32 ((p1_lo + 2^32 p1_hi) + (p2_lo + 2^32 p2_hi)) + 2^64 (p3                )
+        //   = (p0_lo             ) + 2^32 (p0_hi + p1_lo + p2_lo                      ) + 2^64 (p1_hi + p2_hi + p3)
+        //   = (p0_lo             ) + 2^32 (Q                                          ) + 2^64 (H                 )
+        //   = (p0_lo             ) + 2^32 (Q_lo + 2^32 Q_hi                           ) + 2^64 (H                 )
+        //
+        // (Since Q might be larger than 2^32 - 1)
+        //
+        //   = (p0_lo + 2^32 Q_lo) + 2^64 (Q_hi + H)
+        //
+        // (Q_hi + H does not overflow a 64-bit int)
+        //
+        //   = p_lo + 2^64 p_hi
+
+        const std::uint64_t u_lo = x.f & 0xFFFFFFFFu;
+        const std::uint64_t u_hi = x.f >> 32u;
+        const std::uint64_t v_lo = y.f & 0xFFFFFFFFu;
+        const std::uint64_t v_hi = y.f >> 32u;
+
+        const std::uint64_t p0 = u_lo * v_lo;
+        const std::uint64_t p1 = u_lo * v_hi;
+        const std::uint64_t p2 = u_hi * v_lo;
+        const std::uint64_t p3 = u_hi * v_hi;
+
+        const std::uint64_t p0_hi = p0 >> 32u;
+        const std::uint64_t p1_lo = p1 & 0xFFFFFFFFu;
+        const std::uint64_t p1_hi = p1 >> 32u;
+        const std::uint64_t p2_lo = p2 & 0xFFFFFFFFu;
+        const std::uint64_t p2_hi = p2 >> 32u;
+
+        std::uint64_t Q = p0_hi + p1_lo + p2_lo;
+
+        // The full product might now be computed as
+        //
+        // p_hi = p3 + p2_hi + p1_hi + (Q >> 32)
+        // p_lo = p0_lo + (Q << 32)
+        //
+        // But in this particular case here, the full p_lo is not required.
+        // Effectively we only need to add the highest bit in p_lo to p_hi (and
+        // Q_hi + 1 does not overflow).
+
+        Q += std::uint64_t{1} << (64u - 32u - 1u); // round, ties up
+
+        const std::uint64_t h = p3 + p2_hi + p1_hi + (Q >> 32u);
+
+        return {h, x.e + y.e + 64};
+    }
+
+    /*!
+    @brief normalize x such that the significand is >= 2^(q-1)
+    @pre x.f != 0
+    */
+    static diyfp normalize(diyfp x) noexcept
+    {
+        JSON_ASSERT(x.f != 0);
+
+        while ((x.f >> 63u) == 0)
+        {
+            x.f <<= 1u;
+            x.e--;
+        }
+
+        return x;
+    }
+
+    /*!
+    @brief normalize x such that the result has the exponent E
+    @pre e >= x.e and the upper e - x.e bits of x.f must be zero.
+    */
+    static diyfp normalize_to(const diyfp& x, const int target_exponent) noexcept
+    {
+        const int delta = x.e - target_exponent;
+
+        JSON_ASSERT(delta >= 0);
+        JSON_ASSERT(((x.f << delta) >> delta) == x.f);
+
+        return {x.f << delta, target_exponent};
+    }
+};
+
+struct boundaries
+{
+    diyfp w;
+    diyfp minus;
+    diyfp plus;
+};
+
+/*!
+Compute the (normalized) diyfp representing the input number 'value' and its
+boundaries.
+
+@pre value must be finite and positive
+*/
+template<typename FloatType>
+boundaries compute_boundaries(FloatType value)
+{
+    JSON_ASSERT(std::isfinite(value));
+    JSON_ASSERT(value > 0);
+
+    // Convert the IEEE representation into a diyfp.
+    //
+    // If v is denormal:
+    //      value = 0.F * 2^(1 - bias) = (          F) * 2^(1 - bias - (p-1))
+    // If v is normalized:
+    //      value = 1.F * 2^(E - bias) = (2^(p-1) + F) * 2^(E - bias - (p-1))
+
+    static_assert(std::numeric_limits<FloatType>::is_iec559,
+                  "internal error: dtoa_short requires an IEEE-754 floating-point implementation");
+
+    constexpr int      kPrecision = std::numeric_limits<FloatType>::digits; // = p (includes the hidden bit)
+    constexpr int      kBias      = std::numeric_limits<FloatType>::max_exponent - 1 + (kPrecision - 1);
+    constexpr int      kMinExp    = 1 - kBias;
+    constexpr std::uint64_t kHiddenBit = std::uint64_t{1} << (kPrecision - 1); // = 2^(p-1)
+
+    using bits_type = typename std::conditional<kPrecision == 24, std::uint32_t, std::uint64_t >::type;
+
+    const auto bits = static_cast<std::uint64_t>(reinterpret_bits<bits_type>(value));
+    const std::uint64_t E = bits >> (kPrecision - 1);
+    const std::uint64_t F = bits & (kHiddenBit - 1);
+
+    const bool is_denormal = E == 0;
+    const diyfp v = is_denormal
+                    ? diyfp(F, kMinExp)
+                    : diyfp(F + kHiddenBit, static_cast<int>(E) - kBias);
+
+    // Compute the boundaries m- and m+ of the floating-point value
+    // v = f * 2^e.
+    //
+    // Determine v- and v+, the floating-point predecessor and successor if v,
+    // respectively.
+    //
+    //      v- = v - 2^e        if f != 2^(p-1) or e == e_min                (A)
+    //         = v - 2^(e-1)    if f == 2^(p-1) and e > e_min                (B)
+    //
+    //      v+ = v + 2^e
+    //
+    // Let m- = (v- + v) / 2 and m+ = (v + v+) / 2. All real numbers _strictly_
+    // between m- and m+ round to v, regardless of how the input rounding
+    // algorithm breaks ties.
+    //
+    //      ---+-------------+-------------+-------------+-------------+---  (A)
+    //         v-            m-            v             m+            v+
+    //
+    //      -----------------+------+------+-------------+-------------+---  (B)
+    //                       v-     m-     v             m+            v+
+
+    const bool lower_boundary_is_closer = F == 0 && E > 1;
+    const diyfp m_plus = diyfp(2 * v.f + 1, v.e - 1);
+    const diyfp m_minus = lower_boundary_is_closer
+                          ? diyfp(4 * v.f - 1, v.e - 2)  // (B)
+                          : diyfp(2 * v.f - 1, v.e - 1); // (A)
+
+    // Determine the normalized w+ = m+.
+    const diyfp w_plus = diyfp::normalize(m_plus);
+
+    // Determine w- = m- such that e_(w-) = e_(w+).
+    const diyfp w_minus = diyfp::normalize_to(m_minus, w_plus.e);
+
+    return {diyfp::normalize(v), w_minus, w_plus};
+}
+
+// Given normalized diyfp w, Grisu needs to find a (normalized) cached
+// power-of-ten c, such that the exponent of the product c * w = f * 2^e lies
+// within a certain range [alpha, gamma] (Definition 3.2 from [1])
+//
+//      alpha <= e = e_c + e_w + q <= gamma
+//
+// or
+//
+//      f_c * f_w * 2^alpha <= f_c 2^(e_c) * f_w 2^(e_w) * 2^q
+//                          <= f_c * f_w * 2^gamma
+//
+// Since c and w are normalized, i.e. 2^(q-1) <= f < 2^q, this implies
+//
+//      2^(q-1) * 2^(q-1) * 2^alpha <= c * w * 2^q < 2^q * 2^q * 2^gamma
+//
+// or
+//
+//      2^(q - 2 + alpha) <= c * w < 2^(q + gamma)
+//
+// The choice of (alpha,gamma) determines the size of the table and the form of
+// the digit generation procedure. Using (alpha,gamma)=(-60,-32) works out well
+// in practice:
+//
+// The idea is to cut the number c * w = f * 2^e into two parts, which can be
+// processed independently: An integral part p1, and a fractional part p2:
+//
+//      f * 2^e = ( (f div 2^-e) * 2^-e + (f mod 2^-e) ) * 2^e
+//              = (f div 2^-e) + (f mod 2^-e) * 2^e
+//              = p1 + p2 * 2^e
+//
+// The conversion of p1 into decimal form requires a series of divisions and
+// modulos by (a power of) 10. These operations are faster for 32-bit than for
+// 64-bit integers, so p1 should ideally fit into a 32-bit integer. This can be
+// achieved by choosing
+//
+//      -e >= 32   or   e <= -32 := gamma
+//
+// In order to convert the fractional part
+//
+//      p2 * 2^e = p2 / 2^-e = d[-1] / 10^1 + d[-2] / 10^2 + ...
+//
+// into decimal form, the fraction is repeatedly multiplied by 10 and the digits
+// d[-i] are extracted in order:
+//
+//      (10 * p2) div 2^-e = d[-1]
+//      (10 * p2) mod 2^-e = d[-2] / 10^1 + ...
+//
+// The multiplication by 10 must not overflow. It is sufficient to choose
+//
+//      10 * p2 < 16 * p2 = 2^4 * p2 <= 2^64.
+//
+// Since p2 = f mod 2^-e < 2^-e,
+//
+//      -e <= 60   or   e >= -60 := alpha
+
+constexpr int kAlpha = -60;
+constexpr int kGamma = -32;
+
+struct cached_power // c = f * 2^e ~= 10^k
+{
+    std::uint64_t f;
+    int e;
+    int k;
+};
+
+/*!
+For a normalized diyfp w = f * 2^e, this function returns a (normalized) cached
+power-of-ten c = f_c * 2^e_c, such that the exponent of the product w * c
+satisfies (Definition 3.2 from [1])
+
+     alpha <= e_c + e + q <= gamma.
+*/
+inline cached_power get_cached_power_for_binary_exponent(int e)
+{
+    // Now
+    //
+    //      alpha <= e_c + e + q <= gamma                                    (1)
+    //      ==> f_c * 2^alpha <= c * 2^e * 2^q
+    //
+    // and since the c's are normalized, 2^(q-1) <= f_c,
+    //
+    //      ==> 2^(q - 1 + alpha) <= c * 2^(e + q)
+    //      ==> 2^(alpha - e - 1) <= c
+    //
+    // If c were an exact power of ten, i.e. c = 10^k, one may determine k as
+    //
+    //      k = ceil( log_10( 2^(alpha - e - 1) ) )
+    //        = ceil( (alpha - e - 1) * log_10(2) )
+    //
+    // From the paper:
+    // "In theory the result of the procedure could be wrong since c is rounded,
+    //  and the computation itself is approximated [...]. In practice, however,
+    //  this simple function is sufficient."
+    //
+    // For IEEE double precision floating-point numbers converted into
+    // normalized diyfp's w = f * 2^e, with q = 64,
+    //
+    //      e >= -1022      (min IEEE exponent)
+    //           -52        (p - 1)
+    //           -52        (p - 1, possibly normalize denormal IEEE numbers)
+    //           -11        (normalize the diyfp)
+    //         = -1137
+    //
+    // and
+    //
+    //      e <= +1023      (max IEEE exponent)
+    //           -52        (p - 1)
+    //           -11        (normalize the diyfp)
+    //         = 960
+    //
+    // This binary exponent range [-1137,960] results in a decimal exponent
+    // range [-307,324]. One does not need to store a cached power for each
+    // k in this range. For each such k it suffices to find a cached power
+    // such that the exponent of the product lies in [alpha,gamma].
+    // This implies that the difference of the decimal exponents of adjacent
+    // table entries must be less than or equal to
+    //
+    //      floor( (gamma - alpha) * log_10(2) ) = 8.
+    //
+    // (A smaller distance gamma-alpha would require a larger table.)
+
+    // NB:
+    // Actually this function returns c, such that -60 <= e_c + e + 64 <= -34.
+
+    constexpr int kCachedPowersMinDecExp = -300;
+    constexpr int kCachedPowersDecStep = 8;
+
+    static constexpr std::array<cached_power, 79> kCachedPowers =
+    {
+        {
+            { 0xAB70FE17C79AC6CA, -1060, -300 },
+            { 0xFF77B1FCBEBCDC4F, -1034, -292 },
+            { 0xBE5691EF416BD60C, -1007, -284 },
+            { 0x8DD01FAD907FFC3C,  -980, -276 },
+            { 0xD3515C2831559A83,  -954, -268 },
+            { 0x9D71AC8FADA6C9B5,  -927, -260 },
+            { 0xEA9C227723EE8BCB,  -901, -252 },
+            { 0xAECC49914078536D,  -874, -244 },
+            { 0x823C12795DB6CE57,  -847, -236 },
+            { 0xC21094364DFB5637,  -821, -228 },
+            { 0x9096EA6F3848984F,  -794, -220 },
+            { 0xD77485CB25823AC7,  -768, -212 },
+            { 0xA086CFCD97BF97F4,  -741, -204 },
+            { 0xEF340A98172AACE5,  -715, -196 },
+            { 0xB23867FB2A35B28E,  -688, -188 },
+            { 0x84C8D4DFD2C63F3B,  -661, -180 },
+            { 0xC5DD44271AD3CDBA,  -635, -172 },
+            { 0x936B9FCEBB25C996,  -608, -164 },
+            { 0xDBAC6C247D62A584,  -582, -156 },
+            { 0xA3AB66580D5FDAF6,  -555, -148 },
+            { 0xF3E2F893DEC3F126,  -529, -140 },
+            { 0xB5B5ADA8AAFF80B8,  -502, -132 },
+            { 0x87625F056C7C4A8B,  -475, -124 },
+            { 0xC9BCFF6034C13053,  -449, -116 },
+            { 0x964E858C91BA2655,  -422, -108 },
+            { 0xDFF9772470297EBD,  -396, -100 },
+            { 0xA6DFBD9FB8E5B88F,  -369,  -92 },
+            { 0xF8A95FCF88747D94,  -343,  -84 },
+            { 0xB94470938FA89BCF,  -316,  -76 },
+            { 0x8A08F0F8BF0F156B,  -289,  -68 },
+            { 0xCDB02555653131B6,  -263,  -60 },
+            { 0x993FE2C6D07B7FAC,  -236,  -52 },
+            { 0xE45C10C42A2B3B06,  -210,  -44 },
+            { 0xAA242499697392D3,  -183,  -36 },
+            { 0xFD87B5F28300CA0E,  -157,  -28 },
+            { 0xBCE5086492111AEB,  -130,  -20 },
+            { 0x8CBCCC096F5088CC,  -103,  -12 },
+            { 0xD1B71758E219652C,   -77,   -4 },
+            { 0x9C40000000000000,   -50,    4 },
+            { 0xE8D4A51000000000,   -24,   12 },
+            { 0xAD78EBC5AC620000,     3,   20 },
+            { 0x813F3978F8940984,    30,   28 },
+            { 0xC097CE7BC90715B3,    56,   36 },
+            { 0x8F7E32CE7BEA5C70,    83,   44 },
+            { 0xD5D238A4ABE98068,   109,   52 },
+            { 0x9F4F2726179A2245,   136,   60 },
+            { 0xED63A231D4C4FB27,   162,   68 },
+            { 0xB0DE65388CC8ADA8,   189,   76 },
+            { 0x83C7088E1AAB65DB,   216,   84 },
+            { 0xC45D1DF942711D9A,   242,   92 },
+            { 0x924D692CA61BE758,   269,  100 },
+            { 0xDA01EE641A708DEA,   295,  108 },
+            { 0xA26DA3999AEF774A,   322,  116 },
+            { 0xF209787BB47D6B85,   348,  124 },
+            { 0xB454E4A179DD1877,   375,  132 },
+            { 0x865B86925B9BC5C2,   402,  140 },
+            { 0xC83553C5C8965D3D,   428,  148 },
+            { 0x952AB45CFA97A0B3,   455,  156 },
+            { 0xDE469FBD99A05FE3,   481,  164 },
+            { 0xA59BC234DB398C25,   508,  172 },
+            { 0xF6C69A72A3989F5C,   534,  180 },
+            { 0xB7DCBF5354E9BECE,   561,  188 },
+            { 0x88FCF317F22241E2,   588,  196 },
+            { 0xCC20CE9BD35C78A5,   614,  204 },
+            { 0x98165AF37B2153DF,   641,  212 },
+            { 0xE2A0B5DC971F303A,   667,  220 },
+            { 0xA8D9D1535CE3B396,   694,  228 },
+            { 0xFB9B7CD9A4A7443C,   720,  236 },
+            { 0xBB764C4CA7A44410,   747,  244 },
+            { 0x8BAB8EEFB6409C1A,   774,  252 },
+            { 0xD01FEF10A657842C,   800,  260 },
+            { 0x9B10A4E5E9913129,   827,  268 },
+            { 0xE7109BFBA19C0C9D,   853,  276 },
+            { 0xAC2820D9623BF429,   880,  284 },
+            { 0x80444B5E7AA7CF85,   907,  292 },
+            { 0xBF21E44003ACDD2D,   933,  300 },
+            { 0x8E679C2F5E44FF8F,   960,  308 },
+            { 0xD433179D9C8CB841,   986,  316 },
+            { 0x9E19DB92B4E31BA9,  1013,  324 },
+        }
+    };
+
+    // This computation gives exactly the same results for k as
+    //      k = ceil((kAlpha - e - 1) * 0.30102999566398114)
+    // for |e| <= 1500, but doesn't require floating-point operations.
+    // NB: log_10(2) ~= 78913 / 2^18
+    JSON_ASSERT(e >= -1500);
+    JSON_ASSERT(e <=  1500);
+    const int f = kAlpha - e - 1;
+    const int k = (f * 78913) / (1 << 18) + static_cast<int>(f > 0);
+
+    const int index = (-kCachedPowersMinDecExp + k + (kCachedPowersDecStep - 1)) / kCachedPowersDecStep;
+    JSON_ASSERT(index >= 0);
+    JSON_ASSERT(static_cast<std::size_t>(index) < kCachedPowers.size());
+
+    const cached_power cached = kCachedPowers[static_cast<std::size_t>(index)];
+    JSON_ASSERT(kAlpha <= cached.e + e + 64);
+    JSON_ASSERT(kGamma >= cached.e + e + 64);
+
+    return cached;
+}
+
+/*!
+For n != 0, returns k, such that pow10 := 10^(k-1) <= n < 10^k.
+For n == 0, returns 1 and sets pow10 := 1.
+*/
+inline int find_largest_pow10(const std::uint32_t n, std::uint32_t& pow10)
+{
+    // LCOV_EXCL_START
+    if (n >= 1000000000)
+    {
+        pow10 = 1000000000;
+        return 10;
+    }
+    // LCOV_EXCL_STOP
+    if (n >= 100000000)
+    {
+        pow10 = 100000000;
+        return  9;
+    }
+    if (n >= 10000000)
+    {
+        pow10 = 10000000;
+        return  8;
+    }
+    if (n >= 1000000)
+    {
+        pow10 = 1000000;
+        return  7;
+    }
+    if (n >= 100000)
+    {
+        pow10 = 100000;
+        return  6;
+    }
+    if (n >= 10000)
+    {
+        pow10 = 10000;
+        return  5;
+    }
+    if (n >= 1000)
+    {
+        pow10 = 1000;
+        return  4;
+    }
+    if (n >= 100)
+    {
+        pow10 = 100;
+        return  3;
+    }
+    if (n >= 10)
+    {
+        pow10 = 10;
+        return  2;
+    }
+
+    pow10 = 1;
+    return 1;
+}
+
+inline void grisu2_round(char* buf, int len, std::uint64_t dist, std::uint64_t delta,
+                         std::uint64_t rest, std::uint64_t ten_k)
+{
+    JSON_ASSERT(len >= 1);
+    JSON_ASSERT(dist <= delta);
+    JSON_ASSERT(rest <= delta);
+    JSON_ASSERT(ten_k > 0);
+
+    //               <--------------------------- delta ---->
+    //                                  <---- dist --------->
+    // --------------[------------------+-------------------]--------------
+    //               M-                 w                   M+
+    //
+    //                                  ten_k
+    //                                <------>
+    //                                       <---- rest ---->
+    // --------------[------------------+----+--------------]--------------
+    //                                  w    V
+    //                                       = buf * 10^k
+    //
+    // ten_k represents a unit-in-the-last-place in the decimal representation
+    // stored in buf.
+    // Decrement buf by ten_k while this takes buf closer to w.
+
+    // The tests are written in this order to avoid overflow in unsigned
+    // integer arithmetic.
+
+    while (rest < dist
+            && delta - rest >= ten_k
+            && (rest + ten_k < dist || dist - rest > rest + ten_k - dist))
+    {
+        JSON_ASSERT(buf[len - 1] != '0');
+        buf[len - 1]--;
+        rest += ten_k;
+    }
+}
+
+/*!
+Generates V = buffer * 10^decimal_exponent, such that M- <= V <= M+.
+M- and M+ must be normalized and share the same exponent -60 <= e <= -32.
+*/
+inline void grisu2_digit_gen(char* buffer, int& length, int& decimal_exponent,
+                             diyfp M_minus, diyfp w, diyfp M_plus)
+{
+    static_assert(kAlpha >= -60, "internal error");
+    static_assert(kGamma <= -32, "internal error");
+
+    // Generates the digits (and the exponent) of a decimal floating-point
+    // number V = buffer * 10^decimal_exponent in the range [M-, M+]. The diyfp's
+    // w, M- and M+ share the same exponent e, which satisfies alpha <= e <= gamma.
+    //
+    //               <--------------------------- delta ---->
+    //                                  <---- dist --------->
+    // --------------[------------------+-------------------]--------------
+    //               M-                 w                   M+
+    //
+    // Grisu2 generates the digits of M+ from left to right and stops as soon as
+    // V is in [M-,M+].
+
+    JSON_ASSERT(M_plus.e >= kAlpha);
+    JSON_ASSERT(M_plus.e <= kGamma);
+
+    std::uint64_t delta = diyfp::sub(M_plus, M_minus).f; // (significand of (M+ - M-), implicit exponent is e)
+    std::uint64_t dist  = diyfp::sub(M_plus, w      ).f; // (significand of (M+ - w ), implicit exponent is e)
+
+    // Split M+ = f * 2^e into two parts p1 and p2 (note: e < 0):
+    //
+    //      M+ = f * 2^e
+    //         = ((f div 2^-e) * 2^-e + (f mod 2^-e)) * 2^e
+    //         = ((p1        ) * 2^-e + (p2        )) * 2^e
+    //         = p1 + p2 * 2^e
+
+    const diyfp one(std::uint64_t{1} << -M_plus.e, M_plus.e);
+
+    auto p1 = static_cast<std::uint32_t>(M_plus.f >> -one.e); // p1 = f div 2^-e (Since -e >= 32, p1 fits into a 32-bit int.)
+    std::uint64_t p2 = M_plus.f & (one.f - 1);                    // p2 = f mod 2^-e
+
+    // 1)
+    //
+    // Generate the digits of the integral part p1 = d[n-1]...d[1]d[0]
+
+    JSON_ASSERT(p1 > 0);
+
+    std::uint32_t pow10{};
+    const int k = find_largest_pow10(p1, pow10);
+
+    //      10^(k-1) <= p1 < 10^k, pow10 = 10^(k-1)
+    //
+    //      p1 = (p1 div 10^(k-1)) * 10^(k-1) + (p1 mod 10^(k-1))
+    //         = (d[k-1]         ) * 10^(k-1) + (p1 mod 10^(k-1))
+    //
+    //      M+ = p1                                             + p2 * 2^e
+    //         = d[k-1] * 10^(k-1) + (p1 mod 10^(k-1))          + p2 * 2^e
+    //         = d[k-1] * 10^(k-1) + ((p1 mod 10^(k-1)) * 2^-e + p2) * 2^e
+    //         = d[k-1] * 10^(k-1) + (                         rest) * 2^e
+    //
+    // Now generate the digits d[n] of p1 from left to right (n = k-1,...,0)
+    //
+    //      p1 = d[k-1]...d[n] * 10^n + d[n-1]...d[0]
+    //
+    // but stop as soon as
+    //
+    //      rest * 2^e = (d[n-1]...d[0] * 2^-e + p2) * 2^e <= delta * 2^e
+
+    int n = k;
+    while (n > 0)
+    {
+        // Invariants:
+        //      M+ = buffer * 10^n + (p1 + p2 * 2^e)    (buffer = 0 for n = k)
+        //      pow10 = 10^(n-1) <= p1 < 10^n
+        //
+        const std::uint32_t d = p1 / pow10;  // d = p1 div 10^(n-1)
+        const std::uint32_t r = p1 % pow10;  // r = p1 mod 10^(n-1)
+        //
+        //      M+ = buffer * 10^n + (d * 10^(n-1) + r) + p2 * 2^e
+        //         = (buffer * 10 + d) * 10^(n-1) + (r + p2 * 2^e)
+        //
+        JSON_ASSERT(d <= 9);
+        buffer[length++] = static_cast<char>('0' + d); // buffer := buffer * 10 + d
+        //
+        //      M+ = buffer * 10^(n-1) + (r + p2 * 2^e)
+        //
+        p1 = r;
+        n--;
+        //
+        //      M+ = buffer * 10^n + (p1 + p2 * 2^e)
+        //      pow10 = 10^n
+        //
+
+        // Now check if enough digits have been generated.
+        // Compute
+        //
+        //      p1 + p2 * 2^e = (p1 * 2^-e + p2) * 2^e = rest * 2^e
+        //
+        // Note:
+        // Since rest and delta share the same exponent e, it suffices to
+        // compare the significands.
+        const std::uint64_t rest = (std::uint64_t{p1} << -one.e) + p2;
+        if (rest <= delta)
+        {
+            // V = buffer * 10^n, with M- <= V <= M+.
+
+            decimal_exponent += n;
+
+            // We may now just stop. But instead look if the buffer could be
+            // decremented to bring V closer to w.
+            //
+            // pow10 = 10^n is now 1 ulp in the decimal representation V.
+            // The rounding procedure works with diyfp's with an implicit
+            // exponent of e.
+            //
+            //      10^n = (10^n * 2^-e) * 2^e = ulp * 2^e
+            //
+            const std::uint64_t ten_n = std::uint64_t{pow10} << -one.e;
+            grisu2_round(buffer, length, dist, delta, rest, ten_n);
+
+            return;
+        }
+
+        pow10 /= 10;
+        //
+        //      pow10 = 10^(n-1) <= p1 < 10^n
+        // Invariants restored.
+    }
+
+    // 2)
+    //
+    // The digits of the integral part have been generated:
+    //
+    //      M+ = d[k-1]...d[1]d[0] + p2 * 2^e
+    //         = buffer            + p2 * 2^e
+    //
+    // Now generate the digits of the fractional part p2 * 2^e.
+    //
+    // Note:
+    // No decimal point is generated: the exponent is adjusted instead.
+    //
+    // p2 actually represents the fraction
+    //
+    //      p2 * 2^e
+    //          = p2 / 2^-e
+    //          = d[-1] / 10^1 + d[-2] / 10^2 + ...
+    //
+    // Now generate the digits d[-m] of p1 from left to right (m = 1,2,...)
+    //
+    //      p2 * 2^e = d[-1]d[-2]...d[-m] * 10^-m
+    //                      + 10^-m * (d[-m-1] / 10^1 + d[-m-2] / 10^2 + ...)
+    //
+    // using
+    //
+    //      10^m * p2 = ((10^m * p2) div 2^-e) * 2^-e + ((10^m * p2) mod 2^-e)
+    //                = (                   d) * 2^-e + (                   r)
+    //
+    // or
+    //      10^m * p2 * 2^e = d + r * 2^e
+    //
+    // i.e.
+    //
+    //      M+ = buffer + p2 * 2^e
+    //         = buffer + 10^-m * (d + r * 2^e)
+    //         = (buffer * 10^m + d) * 10^-m + 10^-m * r * 2^e
+    //
+    // and stop as soon as 10^-m * r * 2^e <= delta * 2^e
+
+    JSON_ASSERT(p2 > delta);
+
+    int m = 0;
+    for (;;)
+    {
+        // Invariant:
+        //      M+ = buffer * 10^-m + 10^-m * (d[-m-1] / 10 + d[-m-2] / 10^2 + ...) * 2^e
+        //         = buffer * 10^-m + 10^-m * (p2                                 ) * 2^e
+        //         = buffer * 10^-m + 10^-m * (1/10 * (10 * p2)                   ) * 2^e
+        //         = buffer * 10^-m + 10^-m * (1/10 * ((10*p2 div 2^-e) * 2^-e + (10*p2 mod 2^-e)) * 2^e
+        //
+        JSON_ASSERT(p2 <= (std::numeric_limits<std::uint64_t>::max)() / 10);
+        p2 *= 10;
+        const std::uint64_t d = p2 >> -one.e;     // d = (10 * p2) div 2^-e
+        const std::uint64_t r = p2 & (one.f - 1); // r = (10 * p2) mod 2^-e
+        //
+        //      M+ = buffer * 10^-m + 10^-m * (1/10 * (d * 2^-e + r) * 2^e
+        //         = buffer * 10^-m + 10^-m * (1/10 * (d + r * 2^e))
+        //         = (buffer * 10 + d) * 10^(-m-1) + 10^(-m-1) * r * 2^e
+        //
+        JSON_ASSERT(d <= 9);
+        buffer[length++] = static_cast<char>('0' + d); // buffer := buffer * 10 + d
+        //
+        //      M+ = buffer * 10^(-m-1) + 10^(-m-1) * r * 2^e
+        //
+        p2 = r;
+        m++;
+        //
+        //      M+ = buffer * 10^-m + 10^-m * p2 * 2^e
+        // Invariant restored.
+
+        // Check if enough digits have been generated.
+        //
+        //      10^-m * p2 * 2^e <= delta * 2^e
+        //              p2 * 2^e <= 10^m * delta * 2^e
+        //                    p2 <= 10^m * delta
+        delta *= 10;
+        dist  *= 10;
+        if (p2 <= delta)
+        {
+            break;
+        }
+    }
+
+    // V = buffer * 10^-m, with M- <= V <= M+.
+
+    decimal_exponent -= m;
+
+    // 1 ulp in the decimal representation is now 10^-m.
+    // Since delta and dist are now scaled by 10^m, we need to do the
+    // same with ulp in order to keep the units in sync.
+    //
+    //      10^m * 10^-m = 1 = 2^-e * 2^e = ten_m * 2^e
+    //
+    const std::uint64_t ten_m = one.f;
+    grisu2_round(buffer, length, dist, delta, p2, ten_m);
+
+    // By construction this algorithm generates the shortest possible decimal
+    // number (Loitsch, Theorem 6.2) which rounds back to w.
+    // For an input number of precision p, at least
+    //
+    //      N = 1 + ceil(p * log_10(2))
+    //
+    // decimal digits are sufficient to identify all binary floating-point
+    // numbers (Matula, "In-and-Out conversions").
+    // This implies that the algorithm does not produce more than N decimal
+    // digits.
+    //
+    //      N = 17 for p = 53 (IEEE double precision)
+    //      N = 9  for p = 24 (IEEE single precision)
+}
+
+/*!
+v = buf * 10^decimal_exponent
+len is the length of the buffer (number of decimal digits)
+The buffer must be large enough, i.e. >= max_digits10.
+*/
+JSON_HEDLEY_NON_NULL(1)
+inline void grisu2(char* buf, int& len, int& decimal_exponent,
+                   diyfp m_minus, diyfp v, diyfp m_plus)
+{
+    JSON_ASSERT(m_plus.e == m_minus.e);
+    JSON_ASSERT(m_plus.e == v.e);
+
+    //  --------(-----------------------+-----------------------)--------    (A)
+    //          m-                      v                       m+
+    //
+    //  --------------------(-----------+-----------------------)--------    (B)
+    //                      m-          v                       m+
+    //
+    // First scale v (and m- and m+) such that the exponent is in the range
+    // [alpha, gamma].
+
+    const cached_power cached = get_cached_power_for_binary_exponent(m_plus.e);
+
+    const diyfp c_minus_k(cached.f, cached.e); // = c ~= 10^-k
+
+    // The exponent of the products is = v.e + c_minus_k.e + q and is in the range [alpha,gamma]
+    const diyfp w       = diyfp::mul(v,       c_minus_k);
+    const diyfp w_minus = diyfp::mul(m_minus, c_minus_k);
+    const diyfp w_plus  = diyfp::mul(m_plus,  c_minus_k);
+
+    //  ----(---+---)---------------(---+---)---------------(---+---)----
+    //          w-                      w                       w+
+    //          = c*m-                  = c*v                   = c*m+
+    //
+    // diyfp::mul rounds its result and c_minus_k is approximated too. w, w- and
+    // w+ are now off by a small amount.
+    // In fact:
+    //
+    //      w - v * 10^k < 1 ulp
+    //
+    // To account for this inaccuracy, add resp. subtract 1 ulp.
+    //
+    //  --------+---[---------------(---+---)---------------]---+--------
+    //          w-  M-                  w                   M+  w+
+    //
+    // Now any number in [M-, M+] (bounds included) will round to w when input,
+    // regardless of how the input rounding algorithm breaks ties.
+    //
+    // And digit_gen generates the shortest possible such number in [M-, M+].
+    // Note that this does not mean that Grisu2 always generates the shortest
+    // possible number in the interval (m-, m+).
+    const diyfp M_minus(w_minus.f + 1, w_minus.e);
+    const diyfp M_plus (w_plus.f  - 1, w_plus.e );
+
+    decimal_exponent = -cached.k; // = -(-k) = k
+
+    grisu2_digit_gen(buf, len, decimal_exponent, M_minus, w, M_plus);
+}
+
+/*!
+v = buf * 10^decimal_exponent
+len is the length of the buffer (number of decimal digits)
+The buffer must be large enough, i.e. >= max_digits10.
+*/
+template<typename FloatType>
+JSON_HEDLEY_NON_NULL(1)
+void grisu2(char* buf, int& len, int& decimal_exponent, FloatType value)
+{
+    static_assert(diyfp::kPrecision >= std::numeric_limits<FloatType>::digits + 3,
+                  "internal error: not enough precision");
+
+    JSON_ASSERT(std::isfinite(value));
+    JSON_ASSERT(value > 0);
+
+    // If the neighbors (and boundaries) of 'value' are always computed for double-precision
+    // numbers, all float's can be recovered using strtod (and strtof). However, the resulting
+    // decimal representations are not exactly "short".
+    //
+    // The documentation for 'std::to_chars' (https://en.cppreference.com/w/cpp/utility/to_chars)
+    // says "value is converted to a string as if by std::sprintf in the default ("C") locale"
+    // and since sprintf promotes floats to doubles, I think this is exactly what 'std::to_chars'
+    // does.
+    // On the other hand, the documentation for 'std::to_chars' requires that "parsing the
+    // representation using the corresponding std::from_chars function recovers value exactly". That
+    // indicates that single precision floating-point numbers should be recovered using
+    // 'std::strtof'.
+    //
+    // NB: If the neighbors are computed for single-precision numbers, there is a single float
+    //     (7.0385307e-26f) which can't be recovered using strtod. The resulting double precision
+    //     value is off by 1 ulp.
+#if 0 // NOLINT(readability-avoid-unconditional-preprocessor-if)
+    const boundaries w = compute_boundaries(static_cast<double>(value));
+#else
+    const boundaries w = compute_boundaries(value);
+#endif
+
+    grisu2(buf, len, decimal_exponent, w.minus, w.w, w.plus);
+}
+
+/*!
+@brief appends a decimal representation of e to buf
+@return a pointer to the element following the exponent.
+@pre -1000 < e < 1000
+*/
+JSON_HEDLEY_NON_NULL(1)
+JSON_HEDLEY_RETURNS_NON_NULL
+inline char* append_exponent(char* buf, int e)
+{
+    JSON_ASSERT(e > -1000);
+    JSON_ASSERT(e <  1000);
+
+    if (e < 0)
+    {
+        e = -e;
+        *buf++ = '-';
+    }
+    else
+    {
+        *buf++ = '+';
+    }
+
+    auto k = static_cast<std::uint32_t>(e);
+    if (k < 10)
+    {
+        // Always print at least two digits in the exponent.
+        // This is for compatibility with printf("%g").
+        *buf++ = '0';
+        *buf++ = static_cast<char>('0' + k);
+    }
+    else if (k < 100)
+    {
+        *buf++ = static_cast<char>('0' + k / 10);
+        k %= 10;
+        *buf++ = static_cast<char>('0' + k);
+    }
+    else
+    {
+        *buf++ = static_cast<char>('0' + k / 100);
+        k %= 100;
+        *buf++ = static_cast<char>('0' + k / 10);
+        k %= 10;
+        *buf++ = static_cast<char>('0' + k);
+    }
+
+    return buf;
+}
+
+/*!
+@brief prettify v = buf * 10^decimal_exponent
+
+If v is in the range [10^min_exp, 10^max_exp) it will be printed in fixed-point
+notation. Otherwise it will be printed in exponential notation.
+
+@pre min_exp < 0
+@pre max_exp > 0
+*/
+JSON_HEDLEY_NON_NULL(1)
+JSON_HEDLEY_RETURNS_NON_NULL
+inline char* format_buffer(char* buf, int len, int decimal_exponent,
+                           int min_exp, int max_exp)
+{
+    JSON_ASSERT(min_exp < 0);
+    JSON_ASSERT(max_exp > 0);
+
+    const int k = len;
+    const int n = len + decimal_exponent;
+
+    // v = buf * 10^(n-k)
+    // k is the length of the buffer (number of decimal digits)
+    // n is the position of the decimal point relative to the start of the buffer.
+
+    if (k <= n && n <= max_exp)
+    {
+        // digits[000]
+        // len <= max_exp + 2
+
+        std::memset(buf + k, '0', static_cast<size_t>(n) - static_cast<size_t>(k));
+        // Make it look like a floating-point number (#362, #378)
+        buf[n + 0] = '.';
+        buf[n + 1] = '0';
+        return buf + (static_cast<size_t>(n) + 2);
+    }
+
+    if (0 < n && n <= max_exp)
+    {
+        // dig.its
+        // len <= max_digits10 + 1
+
+        JSON_ASSERT(k > n);
+
+        std::memmove(buf + (static_cast<size_t>(n) + 1), buf + n, static_cast<size_t>(k) - static_cast<size_t>(n));
+        buf[n] = '.';
+        return buf + (static_cast<size_t>(k) + 1U);
+    }
+
+    if (min_exp < n && n <= 0)
+    {
+        // 0.[000]digits
+        // len <= 2 + (-min_exp - 1) + max_digits10
+
+        std::memmove(buf + (2 + static_cast<size_t>(-n)), buf, static_cast<size_t>(k));
+        buf[0] = '0';
+        buf[1] = '.';
+        std::memset(buf + 2, '0', static_cast<size_t>(-n));
+        return buf + (2U + static_cast<size_t>(-n) + static_cast<size_t>(k));
+    }
+
+    if (k == 1)
+    {
+        // dE+123
+        // len <= 1 + 5
+
+        buf += 1;
+    }
+    else
+    {
+        // d.igitsE+123
+        // len <= max_digits10 + 1 + 5
+
+        std::memmove(buf + 2, buf + 1, static_cast<size_t>(k) - 1);
+        buf[1] = '.';
+        buf += 1 + static_cast<size_t>(k);
+    }
+
+    *buf++ = 'e';
+    return append_exponent(buf, n - 1);
+}
+
+}  // namespace dtoa_impl
+
+/*!
+@brief generates a decimal representation of the floating-point number value in [first, last).
+
+The format of the resulting decimal representation is similar to printf's %g
+format. Returns an iterator pointing past-the-end of the decimal representation.
+
+@note The input number must be finite, i.e. NaN's and Inf's are not supported.
+@note The buffer must be large enough.
+@note The result is NOT null-terminated.
+*/
+template<typename FloatType>
+JSON_HEDLEY_NON_NULL(1, 2)
+JSON_HEDLEY_RETURNS_NON_NULL
+char* to_chars(char* first, const char* last, FloatType value)
+{
+    static_cast<void>(last); // maybe unused - fix warning
+    JSON_ASSERT(std::isfinite(value));
+
+    // Use signbit(value) instead of (value < 0) since signbit works for -0.
+    if (std::signbit(value))
+    {
+        value = -value;
+        *first++ = '-';
+    }
+
+#ifdef __GNUC__
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wfloat-equal"
+#endif
+    if (value == 0) // +-0
+    {
+        *first++ = '0';
+        // Make it look like a floating-point number (#362, #378)
+        *first++ = '.';
+        *first++ = '0';
+        return first;
+    }
+#ifdef __GNUC__
+#pragma GCC diagnostic pop
+#endif
+
+    JSON_ASSERT(last - first >= std::numeric_limits<FloatType>::max_digits10);
+
+    // Compute v = buffer * 10^decimal_exponent.
+    // The decimal digits are stored in the buffer, which needs to be interpreted
+    // as an unsigned decimal integer.
+    // len is the length of the buffer, i.e. the number of decimal digits.
+    int len = 0;
+    int decimal_exponent = 0;
+    dtoa_impl::grisu2(first, len, decimal_exponent, value);
+
+    JSON_ASSERT(len <= std::numeric_limits<FloatType>::max_digits10);
+
+    // Format the buffer like printf("%.*g", prec, value)
+    constexpr int kMinExp = -4;
+    // Use digits10 here to increase compatibility with version 2.
+    constexpr int kMaxExp = std::numeric_limits<FloatType>::digits10;
+
+    JSON_ASSERT(last - first >= kMaxExp + 2);
+    JSON_ASSERT(last - first >= 2 + (-kMinExp - 1) + std::numeric_limits<FloatType>::max_digits10);
+    JSON_ASSERT(last - first >= std::numeric_limits<FloatType>::max_digits10 + 6);
+
+    return dtoa_impl::format_buffer(first, len, decimal_exponent, kMinExp, kMaxExp);
+}
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/output/binary_writer.hpp>
+
+// #include <nlohmann/detail/output/output_adapters.hpp>
+
+// #include <nlohmann/detail/string_concat.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+namespace detail
+{
+
+///////////////////
+// serialization //
+///////////////////
+
+/// how to treat decoding errors
+enum class error_handler_t
+{
+    strict,  ///< throw a type_error exception in case of invalid UTF-8
+    replace, ///< replace invalid UTF-8 sequences with U+FFFD
+    ignore   ///< ignore invalid UTF-8 sequences
+};
+
+template<typename BasicJsonType>
+class serializer
+{
+    using string_t = typename BasicJsonType::string_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using binary_char_t = typename BasicJsonType::binary_t::value_type;
+    static constexpr std::uint8_t UTF8_ACCEPT = 0;
+    static constexpr std::uint8_t UTF8_REJECT = 1;
+
+  public:
+    /*!
+    @param[in] s  output stream to serialize to
+    @param[in] ichar  indentation character to use
+    @param[in] error_handler_  how to react on decoding errors
+    */
+    serializer(output_adapter_t<char> s, const char ichar,
+               error_handler_t error_handler_ = error_handler_t::strict)
+        : o(std::move(s))
+        , loc(std::localeconv())
+        , thousands_sep(loc->thousands_sep == nullptr ? '\0' : std::char_traits<char>::to_char_type(* (loc->thousands_sep)))
+        , decimal_point(loc->decimal_point == nullptr ? '\0' : std::char_traits<char>::to_char_type(* (loc->decimal_point)))
+        , indent_char(ichar)
+        , indent_string(512, indent_char)
+        , error_handler(error_handler_)
+    {}
+
+    // delete because of pointer members
+    serializer(const serializer&) = delete;
+    serializer& operator=(const serializer&) = delete;
+    serializer(serializer&&) = delete;
+    serializer& operator=(serializer&&) = delete;
+    ~serializer() = default;
+
+    /*!
+    @brief internal implementation of the serialization function
+
+    This function is called by the public member function dump and organizes
+    the serialization internally. The indentation level is propagated as
+    additional parameter. In case of arrays and objects, the function is
+    called recursively.
+
+    - strings and object keys are escaped using `escape_string()`
+    - integer numbers are converted implicitly via `operator<<`
+    - floating-point numbers are converted to a string using `"%g"` format
+    - binary values are serialized as objects containing the subtype and the
+      byte array
+
+    @param[in] val               value to serialize
+    @param[in] pretty_print      whether the output shall be pretty-printed
+    @param[in] ensure_ascii If @a ensure_ascii is true, all non-ASCII characters
+    in the output are escaped with `\uXXXX` sequences, and the result consists
+    of ASCII characters only.
+    @param[in] indent_step       the indent level
+    @param[in] current_indent    the current indent level (only used internally)
+    */
+    void dump(const BasicJsonType& val,
+              const bool pretty_print,
+              const bool ensure_ascii,
+              const unsigned int indent_step,
+              const unsigned int current_indent = 0)
+    {
+        switch (val.m_data.m_type)
+        {
+            case value_t::object:
+            {
+                if (val.m_data.m_value.object->empty())
+                {
+                    o->write_characters("{}", 2);
+                    return;
+                }
+
+                if (pretty_print)
+                {
+                    o->write_characters("{\n", 2);
+
+                    // variable to hold indentation for recursive calls
+                    const auto new_indent = current_indent + indent_step;
+                    if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
+                    {
+                        indent_string.resize(indent_string.size() * 2, ' ');
+                    }
+
+                    // first n-1 elements
+                    auto i = val.m_data.m_value.object->cbegin();
+                    for (std::size_t cnt = 0; cnt < val.m_data.m_value.object->size() - 1; ++cnt, ++i)
+                    {
+                        o->write_characters(indent_string.c_str(), new_indent);
+                        o->write_character('\"');
+                        dump_escaped(i->first, ensure_ascii);
+                        o->write_characters("\": ", 3);
+                        dump(i->second, true, ensure_ascii, indent_step, new_indent);
+                        o->write_characters(",\n", 2);
+                    }
+
+                    // last element
+                    JSON_ASSERT(i != val.m_data.m_value.object->cend());
+                    JSON_ASSERT(std::next(i) == val.m_data.m_value.object->cend());
+                    o->write_characters(indent_string.c_str(), new_indent);
+                    o->write_character('\"');
+                    dump_escaped(i->first, ensure_ascii);
+                    o->write_characters("\": ", 3);
+                    dump(i->second, true, ensure_ascii, indent_step, new_indent);
+
+                    o->write_character('\n');
+                    o->write_characters(indent_string.c_str(), current_indent);
+                    o->write_character('}');
+                }
+                else
+                {
+                    o->write_character('{');
+
+                    // first n-1 elements
+                    auto i = val.m_data.m_value.object->cbegin();
+                    for (std::size_t cnt = 0; cnt < val.m_data.m_value.object->size() - 1; ++cnt, ++i)
+                    {
+                        o->write_character('\"');
+                        dump_escaped(i->first, ensure_ascii);
+                        o->write_characters("\":", 2);
+                        dump(i->second, false, ensure_ascii, indent_step, current_indent);
+                        o->write_character(',');
+                    }
+
+                    // last element
+                    JSON_ASSERT(i != val.m_data.m_value.object->cend());
+                    JSON_ASSERT(std::next(i) == val.m_data.m_value.object->cend());
+                    o->write_character('\"');
+                    dump_escaped(i->first, ensure_ascii);
+                    o->write_characters("\":", 2);
+                    dump(i->second, false, ensure_ascii, indent_step, current_indent);
+
+                    o->write_character('}');
+                }
+
+                return;
+            }
+
+            case value_t::array:
+            {
+                if (val.m_data.m_value.array->empty())
+                {
+                    o->write_characters("[]", 2);
+                    return;
+                }
+
+                if (pretty_print)
+                {
+                    o->write_characters("[\n", 2);
+
+                    // variable to hold indentation for recursive calls
+                    const auto new_indent = current_indent + indent_step;
+                    if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
+                    {
+                        indent_string.resize(indent_string.size() * 2, ' ');
+                    }
+
+                    // first n-1 elements
+                    for (auto i = val.m_data.m_value.array->cbegin();
+                            i != val.m_data.m_value.array->cend() - 1; ++i)
+                    {
+                        o->write_characters(indent_string.c_str(), new_indent);
+                        dump(*i, true, ensure_ascii, indent_step, new_indent);
+                        o->write_characters(",\n", 2);
+                    }
+
+                    // last element
+                    JSON_ASSERT(!val.m_data.m_value.array->empty());
+                    o->write_characters(indent_string.c_str(), new_indent);
+                    dump(val.m_data.m_value.array->back(), true, ensure_ascii, indent_step, new_indent);
+
+                    o->write_character('\n');
+                    o->write_characters(indent_string.c_str(), current_indent);
+                    o->write_character(']');
+                }
+                else
+                {
+                    o->write_character('[');
+
+                    // first n-1 elements
+                    for (auto i = val.m_data.m_value.array->cbegin();
+                            i != val.m_data.m_value.array->cend() - 1; ++i)
+                    {
+                        dump(*i, false, ensure_ascii, indent_step, current_indent);
+                        o->write_character(',');
+                    }
+
+                    // last element
+                    JSON_ASSERT(!val.m_data.m_value.array->empty());
+                    dump(val.m_data.m_value.array->back(), false, ensure_ascii, indent_step, current_indent);
+
+                    o->write_character(']');
+                }
+
+                return;
+            }
+
+            case value_t::string:
+            {
+                o->write_character('\"');
+                dump_escaped(*val.m_data.m_value.string, ensure_ascii);
+                o->write_character('\"');
+                return;
+            }
+
+            case value_t::binary:
+            {
+                if (pretty_print)
+                {
+                    o->write_characters("{\n", 2);
+
+                    // variable to hold indentation for recursive calls
+                    const auto new_indent = current_indent + indent_step;
+                    if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
+                    {
+                        indent_string.resize(indent_string.size() * 2, ' ');
+                    }
+
+                    o->write_characters(indent_string.c_str(), new_indent);
+
+                    o->write_characters("\"bytes\": [", 10);
+
+                    if (!val.m_data.m_value.binary->empty())
+                    {
+                        for (auto i = val.m_data.m_value.binary->cbegin();
+                                i != val.m_data.m_value.binary->cend() - 1; ++i)
+                        {
+                            dump_integer(*i);
+                            o->write_characters(", ", 2);
+                        }
+                        dump_integer(val.m_data.m_value.binary->back());
+                    }
+
+                    o->write_characters("],\n", 3);
+                    o->write_characters(indent_string.c_str(), new_indent);
+
+                    o->write_characters("\"subtype\": ", 11);
+                    if (val.m_data.m_value.binary->has_subtype())
+                    {
+                        dump_integer(val.m_data.m_value.binary->subtype());
+                    }
+                    else
+                    {
+                        o->write_characters("null", 4);
+                    }
+                    o->write_character('\n');
+                    o->write_characters(indent_string.c_str(), current_indent);
+                    o->write_character('}');
+                }
+                else
+                {
+                    o->write_characters("{\"bytes\":[", 10);
+
+                    if (!val.m_data.m_value.binary->empty())
+                    {
+                        for (auto i = val.m_data.m_value.binary->cbegin();
+                                i != val.m_data.m_value.binary->cend() - 1; ++i)
+                        {
+                            dump_integer(*i);
+                            o->write_character(',');
+                        }
+                        dump_integer(val.m_data.m_value.binary->back());
+                    }
+
+                    o->write_characters("],\"subtype\":", 12);
+                    if (val.m_data.m_value.binary->has_subtype())
+                    {
+                        dump_integer(val.m_data.m_value.binary->subtype());
+                        o->write_character('}');
+                    }
+                    else
+                    {
+                        o->write_characters("null}", 5);
+                    }
+                }
+                return;
+            }
+
+            case value_t::boolean:
+            {
+                if (val.m_data.m_value.boolean)
+                {
+                    o->write_characters("true", 4);
+                }
+                else
+                {
+                    o->write_characters("false", 5);
+                }
+                return;
+            }
+
+            case value_t::number_integer:
+            {
+                dump_integer(val.m_data.m_value.number_integer);
+                return;
+            }
+
+            case value_t::number_unsigned:
+            {
+                dump_integer(val.m_data.m_value.number_unsigned);
+                return;
+            }
+
+            case value_t::number_float:
+            {
+                dump_float(val.m_data.m_value.number_float);
+                return;
+            }
+
+            case value_t::discarded:
+            {
+                o->write_characters("<discarded>", 11);
+                return;
+            }
+
+            case value_t::null:
+            {
+                o->write_characters("null", 4);
+                return;
+            }
+
+            default:            // LCOV_EXCL_LINE
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+        }
+    }
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    /*!
+    @brief dump escaped string
+
+    Escape a string by replacing certain special characters by a sequence of an
+    escape character (backslash) and another character and other control
+    characters by a sequence of "\u" followed by a four-digit hex
+    representation. The escaped string is written to output stream @a o.
+
+    @param[in] s  the string to escape
+    @param[in] ensure_ascii  whether to escape non-ASCII characters with
+                             \uXXXX sequences
+
+    @complexity Linear in the length of string @a s.
+    */
+    void dump_escaped(const string_t& s, const bool ensure_ascii)
+    {
+        std::uint32_t codepoint{};
+        std::uint8_t state = UTF8_ACCEPT;
+        std::size_t bytes = 0;  // number of bytes written to string_buffer
+
+        // number of bytes written at the point of the last valid byte
+        std::size_t bytes_after_last_accept = 0;
+        std::size_t undumped_chars = 0;
+
+        for (std::size_t i = 0; i < s.size(); ++i)
+        {
+            const auto byte = static_cast<std::uint8_t>(s[i]);
+
+            switch (decode(state, codepoint, byte))
+            {
+                case UTF8_ACCEPT:  // decode found a new code point
+                {
+                    switch (codepoint)
+                    {
+                        case 0x08: // backspace
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 'b';
+                            break;
+                        }
+
+                        case 0x09: // horizontal tab
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 't';
+                            break;
+                        }
+
+                        case 0x0A: // newline
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 'n';
+                            break;
+                        }
+
+                        case 0x0C: // formfeed
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 'f';
+                            break;
+                        }
+
+                        case 0x0D: // carriage return
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 'r';
+                            break;
+                        }
+
+                        case 0x22: // quotation mark
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = '\"';
+                            break;
+                        }
+
+                        case 0x5C: // reverse solidus
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = '\\';
+                            break;
+                        }
+
+                        default:
+                        {
+                            // escape control characters (0x00..0x1F) or, if
+                            // ensure_ascii parameter is used, non-ASCII characters
+                            if ((codepoint <= 0x1F) || (ensure_ascii && (codepoint >= 0x7F)))
+                            {
+                                if (codepoint <= 0xFFFF)
+                                {
+                                    // NOLINTNEXTLINE(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+                                    static_cast<void>((std::snprintf)(string_buffer.data() + bytes, 7, "\\u%04x",
+                                                                      static_cast<std::uint16_t>(codepoint)));
+                                    bytes += 6;
+                                }
+                                else
+                                {
+                                    // NOLINTNEXTLINE(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+                                    static_cast<void>((std::snprintf)(string_buffer.data() + bytes, 13, "\\u%04x\\u%04x",
+                                                                      static_cast<std::uint16_t>(0xD7C0u + (codepoint >> 10u)),
+                                                                      static_cast<std::uint16_t>(0xDC00u + (codepoint & 0x3FFu))));
+                                    bytes += 12;
+                                }
+                            }
+                            else
+                            {
+                                // copy byte to buffer (all previous bytes
+                                // been copied have in default case above)
+                                string_buffer[bytes++] = s[i];
+                            }
+                            break;
+                        }
+                    }
+
+                    // write buffer and reset index; there must be 13 bytes
+                    // left, as this is the maximal number of bytes to be
+                    // written ("\uxxxx\uxxxx\0") for one code point
+                    if (string_buffer.size() - bytes < 13)
+                    {
+                        o->write_characters(string_buffer.data(), bytes);
+                        bytes = 0;
+                    }
+
+                    // remember the byte position of this accept
+                    bytes_after_last_accept = bytes;
+                    undumped_chars = 0;
+                    break;
+                }
+
+                case UTF8_REJECT:  // decode found invalid UTF-8 byte
+                {
+                    switch (error_handler)
+                    {
+                        case error_handler_t::strict:
+                        {
+                            JSON_THROW(type_error::create(316, concat("invalid UTF-8 byte at index ", std::to_string(i), ": 0x", hex_bytes(byte | 0)), nullptr));
+                        }
+
+                        case error_handler_t::ignore:
+                        case error_handler_t::replace:
+                        {
+                            // in case we saw this character the first time, we
+                            // would like to read it again, because the byte
+                            // may be OK for itself, but just not OK for the
+                            // previous sequence
+                            if (undumped_chars > 0)
+                            {
+                                --i;
+                            }
+
+                            // reset length buffer to the last accepted index;
+                            // thus removing/ignoring the invalid characters
+                            bytes = bytes_after_last_accept;
+
+                            if (error_handler == error_handler_t::replace)
+                            {
+                                // add a replacement character
+                                if (ensure_ascii)
+                                {
+                                    string_buffer[bytes++] = '\\';
+                                    string_buffer[bytes++] = 'u';
+                                    string_buffer[bytes++] = 'f';
+                                    string_buffer[bytes++] = 'f';
+                                    string_buffer[bytes++] = 'f';
+                                    string_buffer[bytes++] = 'd';
+                                }
+                                else
+                                {
+                                    string_buffer[bytes++] = detail::binary_writer<BasicJsonType, char>::to_char_type('\xEF');
+                                    string_buffer[bytes++] = detail::binary_writer<BasicJsonType, char>::to_char_type('\xBF');
+                                    string_buffer[bytes++] = detail::binary_writer<BasicJsonType, char>::to_char_type('\xBD');
+                                }
+
+                                // write buffer and reset index; there must be 13 bytes
+                                // left, as this is the maximal number of bytes to be
+                                // written ("\uxxxx\uxxxx\0") for one code point
+                                if (string_buffer.size() - bytes < 13)
+                                {
+                                    o->write_characters(string_buffer.data(), bytes);
+                                    bytes = 0;
+                                }
+
+                                bytes_after_last_accept = bytes;
+                            }
+
+                            undumped_chars = 0;
+
+                            // continue processing the string
+                            state = UTF8_ACCEPT;
+                            break;
+                        }
+
+                        default:            // LCOV_EXCL_LINE
+                            JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+                    }
+                    break;
+                }
+
+                default:  // decode found yet incomplete multi-byte code point
+                {
+                    if (!ensure_ascii)
+                    {
+                        // code point will not be escaped - copy byte to buffer
+                        string_buffer[bytes++] = s[i];
+                    }
+                    ++undumped_chars;
+                    break;
+                }
+            }
+        }
+
+        // we finished processing the string
+        if (JSON_HEDLEY_LIKELY(state == UTF8_ACCEPT))
+        {
+            // write buffer
+            if (bytes > 0)
+            {
+                o->write_characters(string_buffer.data(), bytes);
+            }
+        }
+        else
+        {
+            // we finish reading, but do not accept: string was incomplete
+            switch (error_handler)
+            {
+                case error_handler_t::strict:
+                {
+                    JSON_THROW(type_error::create(316, concat("incomplete UTF-8 string; last byte: 0x", hex_bytes(static_cast<std::uint8_t>(s.back() | 0))), nullptr));
+                }
+
+                case error_handler_t::ignore:
+                {
+                    // write all accepted bytes
+                    o->write_characters(string_buffer.data(), bytes_after_last_accept);
+                    break;
+                }
+
+                case error_handler_t::replace:
+                {
+                    // write all accepted bytes
+                    o->write_characters(string_buffer.data(), bytes_after_last_accept);
+                    // add a replacement character
+                    if (ensure_ascii)
+                    {
+                        o->write_characters("\\ufffd", 6);
+                    }
+                    else
+                    {
+                        o->write_characters("\xEF\xBF\xBD", 3);
+                    }
+                    break;
+                }
+
+                default:            // LCOV_EXCL_LINE
+                    JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+            }
+        }
+    }
+
+  private:
+    /*!
+    @brief count digits
+
+    Count the number of decimal (base 10) digits for an input unsigned integer.
+
+    @param[in] x  unsigned integer number to count its digits
+    @return    number of decimal digits
+    */
+    inline unsigned int count_digits(number_unsigned_t x) noexcept
+    {
+        unsigned int n_digits = 1;
+        for (;;)
+        {
+            if (x < 10)
+            {
+                return n_digits;
+            }
+            if (x < 100)
+            {
+                return n_digits + 1;
+            }
+            if (x < 1000)
+            {
+                return n_digits + 2;
+            }
+            if (x < 10000)
+            {
+                return n_digits + 3;
+            }
+            x = x / 10000u;
+            n_digits += 4;
+        }
+    }
+
+    /*!
+     * @brief convert a byte to a uppercase hex representation
+     * @param[in] byte byte to represent
+     * @return representation ("00".."FF")
+     */
+    static std::string hex_bytes(std::uint8_t byte)
+    {
+        std::string result = "FF";
+        constexpr const char* nibble_to_hex = "0123456789ABCDEF";
+        result[0] = nibble_to_hex[byte / 16];
+        result[1] = nibble_to_hex[byte % 16];
+        return result;
+    }
+
+    // templates to avoid warnings about useless casts
+    template <typename NumberType, enable_if_t<std::is_signed<NumberType>::value, int> = 0>
+    bool is_negative_number(NumberType x)
+    {
+        return x < 0;
+    }
+
+    template < typename NumberType, enable_if_t <std::is_unsigned<NumberType>::value, int > = 0 >
+    bool is_negative_number(NumberType /*unused*/)
+    {
+        return false;
+    }
+
+    /*!
+    @brief dump an integer
+
+    Dump a given integer to output stream @a o. Works internally with
+    @a number_buffer.
+
+    @param[in] x  integer number (signed or unsigned) to dump
+    @tparam NumberType either @a number_integer_t or @a number_unsigned_t
+    */
+    template < typename NumberType, detail::enable_if_t <
+                   std::is_integral<NumberType>::value ||
+                   std::is_same<NumberType, number_unsigned_t>::value ||
+                   std::is_same<NumberType, number_integer_t>::value ||
+                   std::is_same<NumberType, binary_char_t>::value,
+                   int > = 0 >
+    void dump_integer(NumberType x)
+    {
+        static constexpr std::array<std::array<char, 2>, 100> digits_to_99
+        {
+            {
+                {{'0', '0'}}, {{'0', '1'}}, {{'0', '2'}}, {{'0', '3'}}, {{'0', '4'}}, {{'0', '5'}}, {{'0', '6'}}, {{'0', '7'}}, {{'0', '8'}}, {{'0', '9'}},
+                {{'1', '0'}}, {{'1', '1'}}, {{'1', '2'}}, {{'1', '3'}}, {{'1', '4'}}, {{'1', '5'}}, {{'1', '6'}}, {{'1', '7'}}, {{'1', '8'}}, {{'1', '9'}},
+                {{'2', '0'}}, {{'2', '1'}}, {{'2', '2'}}, {{'2', '3'}}, {{'2', '4'}}, {{'2', '5'}}, {{'2', '6'}}, {{'2', '7'}}, {{'2', '8'}}, {{'2', '9'}},
+                {{'3', '0'}}, {{'3', '1'}}, {{'3', '2'}}, {{'3', '3'}}, {{'3', '4'}}, {{'3', '5'}}, {{'3', '6'}}, {{'3', '7'}}, {{'3', '8'}}, {{'3', '9'}},
+                {{'4', '0'}}, {{'4', '1'}}, {{'4', '2'}}, {{'4', '3'}}, {{'4', '4'}}, {{'4', '5'}}, {{'4', '6'}}, {{'4', '7'}}, {{'4', '8'}}, {{'4', '9'}},
+                {{'5', '0'}}, {{'5', '1'}}, {{'5', '2'}}, {{'5', '3'}}, {{'5', '4'}}, {{'5', '5'}}, {{'5', '6'}}, {{'5', '7'}}, {{'5', '8'}}, {{'5', '9'}},
+                {{'6', '0'}}, {{'6', '1'}}, {{'6', '2'}}, {{'6', '3'}}, {{'6', '4'}}, {{'6', '5'}}, {{'6', '6'}}, {{'6', '7'}}, {{'6', '8'}}, {{'6', '9'}},
+                {{'7', '0'}}, {{'7', '1'}}, {{'7', '2'}}, {{'7', '3'}}, {{'7', '4'}}, {{'7', '5'}}, {{'7', '6'}}, {{'7', '7'}}, {{'7', '8'}}, {{'7', '9'}},
+                {{'8', '0'}}, {{'8', '1'}}, {{'8', '2'}}, {{'8', '3'}}, {{'8', '4'}}, {{'8', '5'}}, {{'8', '6'}}, {{'8', '7'}}, {{'8', '8'}}, {{'8', '9'}},
+                {{'9', '0'}}, {{'9', '1'}}, {{'9', '2'}}, {{'9', '3'}}, {{'9', '4'}}, {{'9', '5'}}, {{'9', '6'}}, {{'9', '7'}}, {{'9', '8'}}, {{'9', '9'}},
+            }
+        };
+
+        // special case for "0"
+        if (x == 0)
+        {
+            o->write_character('0');
+            return;
+        }
+
+        // use a pointer to fill the buffer
+        auto buffer_ptr = number_buffer.begin(); // NOLINT(llvm-qualified-auto,readability-qualified-auto,cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+
+        number_unsigned_t abs_value;
+
+        unsigned int n_chars{};
+
+        if (is_negative_number(x))
+        {
+            *buffer_ptr = '-';
+            abs_value = remove_sign(static_cast<number_integer_t>(x));
+
+            // account one more byte for the minus sign
+            n_chars = 1 + count_digits(abs_value);
+        }
+        else
+        {
+            abs_value = static_cast<number_unsigned_t>(x);
+            n_chars = count_digits(abs_value);
+        }
+
+        // spare 1 byte for '\0'
+        JSON_ASSERT(n_chars < number_buffer.size() - 1);
+
+        // jump to the end to generate the string from backward,
+        // so we later avoid reversing the result
+        buffer_ptr += n_chars;
+
+        // Fast int2ascii implementation inspired by "Fastware" talk by Andrei Alexandrescu
+        // See: https://www.youtube.com/watch?v=o4-CwDo2zpg
+        while (abs_value >= 100)
+        {
+            const auto digits_index = static_cast<unsigned>((abs_value % 100));
+            abs_value /= 100;
+            *(--buffer_ptr) = digits_to_99[digits_index][1];
+            *(--buffer_ptr) = digits_to_99[digits_index][0];
+        }
+
+        if (abs_value >= 10)
+        {
+            const auto digits_index = static_cast<unsigned>(abs_value);
+            *(--buffer_ptr) = digits_to_99[digits_index][1];
+            *(--buffer_ptr) = digits_to_99[digits_index][0];
+        }
+        else
+        {
+            *(--buffer_ptr) = static_cast<char>('0' + abs_value);
+        }
+
+        o->write_characters(number_buffer.data(), n_chars);
+    }
+
+    /*!
+    @brief dump a floating-point number
+
+    Dump a given floating-point number to output stream @a o. Works internally
+    with @a number_buffer.
+
+    @param[in] x  floating-point number to dump
+    */
+    void dump_float(number_float_t x)
+    {
+        // NaN / inf
+        if (!std::isfinite(x))
+        {
+            o->write_characters("null", 4);
+            return;
+        }
+
+        // If number_float_t is an IEEE-754 single or double precision number,
+        // use the Grisu2 algorithm to produce short numbers which are
+        // guaranteed to round-trip, using strtof and strtod, resp.
+        //
+        // NB: The test below works if <long double> == <double>.
+        static constexpr bool is_ieee_single_or_double
+            = (std::numeric_limits<number_float_t>::is_iec559 && std::numeric_limits<number_float_t>::digits == 24 && std::numeric_limits<number_float_t>::max_exponent == 128) ||
+              (std::numeric_limits<number_float_t>::is_iec559 && std::numeric_limits<number_float_t>::digits == 53 && std::numeric_limits<number_float_t>::max_exponent == 1024);
+
+        dump_float(x, std::integral_constant<bool, is_ieee_single_or_double>());
+    }
+
+    void dump_float(number_float_t x, std::true_type /*is_ieee_single_or_double*/)
+    {
+        auto* begin = number_buffer.data();
+        auto* end = ::nlohmann::detail::to_chars(begin, begin + number_buffer.size(), x);
+
+        o->write_characters(begin, static_cast<size_t>(end - begin));
+    }
+
+    void dump_float(number_float_t x, std::false_type /*is_ieee_single_or_double*/)
+    {
+        // get number of digits for a float -> text -> float round-trip
+        static constexpr auto d = std::numeric_limits<number_float_t>::max_digits10;
+
+        // the actual conversion
+        // NOLINTNEXTLINE(cppcoreguidelines-pro-type-vararg,hicpp-vararg)
+        std::ptrdiff_t len = (std::snprintf)(number_buffer.data(), number_buffer.size(), "%.*g", d, x);
+
+        // negative value indicates an error
+        JSON_ASSERT(len > 0);
+        // check if buffer was large enough
+        JSON_ASSERT(static_cast<std::size_t>(len) < number_buffer.size());
+
+        // erase thousands separator
+        if (thousands_sep != '\0')
+        {
+            // NOLINTNEXTLINE(readability-qualified-auto,llvm-qualified-auto): std::remove returns an iterator, see https://github.com/nlohmann/json/issues/3081
+            const auto end = std::remove(number_buffer.begin(), number_buffer.begin() + len, thousands_sep);
+            std::fill(end, number_buffer.end(), '\0');
+            JSON_ASSERT((end - number_buffer.begin()) <= len);
+            len = (end - number_buffer.begin());
+        }
+
+        // convert decimal point to '.'
+        if (decimal_point != '\0' && decimal_point != '.')
+        {
+            // NOLINTNEXTLINE(readability-qualified-auto,llvm-qualified-auto): std::find returns an iterator, see https://github.com/nlohmann/json/issues/3081
+            const auto dec_pos = std::find(number_buffer.begin(), number_buffer.end(), decimal_point);
+            if (dec_pos != number_buffer.end())
+            {
+                *dec_pos = '.';
+            }
+        }
+
+        o->write_characters(number_buffer.data(), static_cast<std::size_t>(len));
+
+        // determine if we need to append ".0"
+        const bool value_is_int_like =
+            std::none_of(number_buffer.begin(), number_buffer.begin() + len + 1,
+                         [](char c)
+        {
+            return c == '.' || c == 'e';
+        });
+
+        if (value_is_int_like)
+        {
+            o->write_characters(".0", 2);
+        }
+    }
+
+    /*!
+    @brief check whether a string is UTF-8 encoded
+
+    The function checks each byte of a string whether it is UTF-8 encoded. The
+    result of the check is stored in the @a state parameter. The function must
+    be called initially with state 0 (accept). State 1 means the string must
+    be rejected, because the current byte is not allowed. If the string is
+    completely processed, but the state is non-zero, the string ended
+    prematurely; that is, the last byte indicated more bytes should have
+    followed.
+
+    @param[in,out] state  the state of the decoding
+    @param[in,out] codep  codepoint (valid only if resulting state is UTF8_ACCEPT)
+    @param[in] byte       next byte to decode
+    @return               new state
+
+    @note The function has been edited: a std::array is used.
+
+    @copyright Copyright (c) 2008-2009 Bjoern Hoehrmann <bjoern@hoehrmann.de>
+    @sa http://bjoern.hoehrmann.de/utf-8/decoder/dfa/
+    */
+    static std::uint8_t decode(std::uint8_t& state, std::uint32_t& codep, const std::uint8_t byte) noexcept
+    {
+        static const std::array<std::uint8_t, 400> utf8d =
+        {
+            {
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 00..1F
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 20..3F
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 40..5F
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 60..7F
+                1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, // 80..9F
+                7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, // A0..BF
+                8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, // C0..DF
+                0xA, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x4, 0x3, 0x3, // E0..EF
+                0xB, 0x6, 0x6, 0x6, 0x5, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, // F0..FF
+                0x0, 0x1, 0x2, 0x3, 0x5, 0x8, 0x7, 0x1, 0x1, 0x1, 0x4, 0x6, 0x1, 0x1, 0x1, 0x1, // s0..s0
+                1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, // s1..s2
+                1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, // s3..s4
+                1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, // s5..s6
+                1, 3, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // s7..s8
+            }
+        };
+
+        JSON_ASSERT(byte < utf8d.size());
+        const std::uint8_t type = utf8d[byte];
+
+        codep = (state != UTF8_ACCEPT)
+                ? (byte & 0x3fu) | (codep << 6u)
+                : (0xFFu >> type) & (byte);
+
+        const std::size_t index = 256u + static_cast<size_t>(state) * 16u + static_cast<size_t>(type);
+        JSON_ASSERT(index < utf8d.size());
+        state = utf8d[index];
+        return state;
+    }
+
+    /*
+     * Overload to make the compiler happy while it is instantiating
+     * dump_integer for number_unsigned_t.
+     * Must never be called.
+     */
+    number_unsigned_t remove_sign(number_unsigned_t x)
+    {
+        JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+        return x; // LCOV_EXCL_LINE
+    }
+
+    /*
+     * Helper function for dump_integer
+     *
+     * This function takes a negative signed integer and returns its absolute
+     * value as unsigned integer. The plus/minus shuffling is necessary as we can
+     * not directly remove the sign of an arbitrary signed integer as the
+     * absolute values of INT_MIN and INT_MAX are usually not the same. See
+     * #1708 for details.
+     */
+    inline number_unsigned_t remove_sign(number_integer_t x) noexcept
+    {
+        JSON_ASSERT(x < 0 && x < (std::numeric_limits<number_integer_t>::max)()); // NOLINT(misc-redundant-expression)
+        return static_cast<number_unsigned_t>(-(x + 1)) + 1;
+    }
+
+  private:
+    /// the output of the serializer
+    output_adapter_t<char> o = nullptr;
+
+    /// a (hopefully) large enough character buffer
+    std::array<char, 64> number_buffer{{}};
+
+    /// the locale
+    const std::lconv* loc = nullptr;
+    /// the locale's thousand separator character
+    const char thousands_sep = '\0';
+    /// the locale's decimal point character
+    const char decimal_point = '\0';
+
+    /// string buffer
+    std::array<char, 512> string_buffer{{}};
+
+    /// the indentation character
+    const char indent_char;
+    /// the indentation string
+    string_t indent_string;
+
+    /// error_handler how to react on decoding errors
+    const error_handler_t error_handler;
+};
+
+}  // namespace detail
+NLOHMANN_JSON_NAMESPACE_END
+
+// #include <nlohmann/detail/value_t.hpp>
+
+// #include <nlohmann/json_fwd.hpp>
+
+// #include <nlohmann/ordered_map.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#include <functional> // equal_to, less
+#include <initializer_list> // initializer_list
+#include <iterator> // input_iterator_tag, iterator_traits
+#include <memory> // allocator
+#include <stdexcept> // for out_of_range
+#include <type_traits> // enable_if, is_convertible
+#include <utility> // pair
+#include <vector> // vector
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/// ordered_map: a minimal map-like container that preserves insertion order
+/// for use within nlohmann::basic_json<ordered_map>
+template <class Key, class T, class IgnoredLess = std::less<Key>,
+          class Allocator = std::allocator<std::pair<const Key, T>>>
+                  struct ordered_map : std::vector<std::pair<const Key, T>, Allocator>
+{
+    using key_type = Key;
+    using mapped_type = T;
+    using Container = std::vector<std::pair<const Key, T>, Allocator>;
+    using iterator = typename Container::iterator;
+    using const_iterator = typename Container::const_iterator;
+    using size_type = typename Container::size_type;
+    using value_type = typename Container::value_type;
+#ifdef JSON_HAS_CPP_14
+    using key_compare = std::equal_to<>;
+#else
+    using key_compare = std::equal_to<Key>;
+#endif
+
+    // Explicit constructors instead of `using Container::Container`
+    // otherwise older compilers choke on it (GCC <= 5.5, xcode <= 9.4)
+    ordered_map() noexcept(noexcept(Container())) : Container{} {}
+    explicit ordered_map(const Allocator& alloc) noexcept(noexcept(Container(alloc))) : Container{alloc} {}
+    template <class It>
+    ordered_map(It first, It last, const Allocator& alloc = Allocator())
+        : Container{first, last, alloc} {}
+    ordered_map(std::initializer_list<value_type> init, const Allocator& alloc = Allocator() )
+        : Container{init, alloc} {}
+
+    std::pair<iterator, bool> emplace(const key_type& key, T&& t)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return {it, false};
+            }
+        }
+        Container::emplace_back(key, std::forward<T>(t));
+        return {std::prev(this->end()), true};
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    std::pair<iterator, bool> emplace(KeyType && key, T && t)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return {it, false};
+            }
+        }
+        Container::emplace_back(std::forward<KeyType>(key), std::forward<T>(t));
+        return {std::prev(this->end()), true};
+    }
+
+    T& operator[](const key_type& key)
+    {
+        return emplace(key, T{}).first->second;
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    T & operator[](KeyType && key)
+    {
+        return emplace(std::forward<KeyType>(key), T{}).first->second;
+    }
+
+    const T& operator[](const key_type& key) const
+    {
+        return at(key);
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    const T & operator[](KeyType && key) const
+    {
+        return at(std::forward<KeyType>(key));
+    }
+
+    T& at(const key_type& key)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it->second;
+            }
+        }
+
+        JSON_THROW(std::out_of_range("key not found"));
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    T & at(KeyType && key) // NOLINT(cppcoreguidelines-missing-std-forward)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it->second;
+            }
+        }
+
+        JSON_THROW(std::out_of_range("key not found"));
+    }
+
+    const T& at(const key_type& key) const
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it->second;
+            }
+        }
+
+        JSON_THROW(std::out_of_range("key not found"));
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    const T & at(KeyType && key) const // NOLINT(cppcoreguidelines-missing-std-forward)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it->second;
+            }
+        }
+
+        JSON_THROW(std::out_of_range("key not found"));
+    }
+
+    size_type erase(const key_type& key)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                // Since we cannot move const Keys, re-construct them in place
+                for (auto next = it; ++next != this->end(); ++it)
+                {
+                    it->~value_type(); // Destroy but keep allocation
+                    new (&*it) value_type{std::move(*next)};
+                }
+                Container::pop_back();
+                return 1;
+            }
+        }
+        return 0;
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    size_type erase(KeyType && key) // NOLINT(cppcoreguidelines-missing-std-forward)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                // Since we cannot move const Keys, re-construct them in place
+                for (auto next = it; ++next != this->end(); ++it)
+                {
+                    it->~value_type(); // Destroy but keep allocation
+                    new (&*it) value_type{std::move(*next)};
+                }
+                Container::pop_back();
+                return 1;
+            }
+        }
+        return 0;
+    }
+
+    iterator erase(iterator pos)
+    {
+        return erase(pos, std::next(pos));
+    }
+
+    iterator erase(iterator first, iterator last)
+    {
+        if (first == last)
+        {
+            return first;
+        }
+
+        const auto elements_affected = std::distance(first, last);
+        const auto offset = std::distance(Container::begin(), first);
+
+        // This is the start situation. We need to delete elements_affected
+        // elements (3 in this example: e, f, g), and need to return an
+        // iterator past the last deleted element (h in this example).
+        // Note that offset is the distance from the start of the vector
+        // to first. We will need this later.
+
+        // [ a, b, c, d, e, f, g, h, i, j ]
+        //               ^        ^
+        //             first    last
+
+        // Since we cannot move const Keys, we re-construct them in place.
+        // We start at first and re-construct (viz. copy) the elements from
+        // the back of the vector. Example for first iteration:
+
+        //               ,--------.
+        //               v        |   destroy e and re-construct with h
+        // [ a, b, c, d, e, f, g, h, i, j ]
+        //               ^        ^
+        //               it       it + elements_affected
+
+        for (auto it = first; std::next(it, elements_affected) != Container::end(); ++it)
+        {
+            it->~value_type(); // destroy but keep allocation
+            new (&*it) value_type{std::move(*std::next(it, elements_affected))}; // "move" next element to it
+        }
+
+        // [ a, b, c, d, h, i, j, h, i, j ]
+        //               ^        ^
+        //             first    last
+
+        // remove the unneeded elements at the end of the vector
+        Container::resize(this->size() - static_cast<size_type>(elements_affected));
+
+        // [ a, b, c, d, h, i, j ]
+        //               ^        ^
+        //             first    last
+
+        // first is now pointing past the last deleted element, but we cannot
+        // use this iterator, because it may have been invalidated by the
+        // resize call. Instead, we can return begin() + offset.
+        return Container::begin() + offset;
+    }
+
+    size_type count(const key_type& key) const
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return 1;
+            }
+        }
+        return 0;
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    size_type count(KeyType && key) const // NOLINT(cppcoreguidelines-missing-std-forward)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return 1;
+            }
+        }
+        return 0;
+    }
+
+    iterator find(const key_type& key)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it;
+            }
+        }
+        return Container::end();
+    }
+
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_key_type<key_compare, key_type, KeyType>::value, int> = 0>
+    iterator find(KeyType && key) // NOLINT(cppcoreguidelines-missing-std-forward)
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it;
+            }
+        }
+        return Container::end();
+    }
+
+    const_iterator find(const key_type& key) const
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, key))
+            {
+                return it;
+            }
+        }
+        return Container::end();
+    }
+
+    std::pair<iterator, bool> insert( value_type&& value )
+    {
+        return emplace(value.first, std::move(value.second));
+    }
+
+    std::pair<iterator, bool> insert( const value_type& value )
+    {
+        for (auto it = this->begin(); it != this->end(); ++it)
+        {
+            if (m_compare(it->first, value.first))
+            {
+                return {it, false};
+            }
+        }
+        Container::push_back(value);
+        return {--this->end(), true};
+    }
+
+    template<typename InputIt>
+    using require_input_iter = typename std::enable_if<std::is_convertible<typename std::iterator_traits<InputIt>::iterator_category,
+            std::input_iterator_tag>::value>::type;
+
+    template<typename InputIt, typename = require_input_iter<InputIt>>
+    void insert(InputIt first, InputIt last)
+    {
+        for (auto it = first; it != last; ++it)
+        {
+            insert(*it);
+        }
+    }
+
+private:
+    JSON_NO_UNIQUE_ADDRESS key_compare m_compare = key_compare();
+};
+
+NLOHMANN_JSON_NAMESPACE_END
+
+
+#if defined(JSON_HAS_CPP_17)
+    #if JSON_HAS_STATIC_RTTI
+        #include <any>
+    #endif
+    #include <string_view>
+#endif
+
+/*!
+@brief namespace for Niels Lohmann
+@see https://github.com/nlohmann
+@since version 1.0.0
+*/
+NLOHMANN_JSON_NAMESPACE_BEGIN
+
+/*!
+@brief a class to store JSON values
+
+@internal
+@invariant The member variables @a m_value and @a m_type have the following
+relationship:
+- If `m_type == value_t::object`, then `m_value.object != nullptr`.
+- If `m_type == value_t::array`, then `m_value.array != nullptr`.
+- If `m_type == value_t::string`, then `m_value.string != nullptr`.
+The invariants are checked by member function assert_invariant().
+
+@note ObjectType trick from https://stackoverflow.com/a/9860911
+@endinternal
+
+@since version 1.0.0
+
+@nosubgrouping
+*/
+NLOHMANN_BASIC_JSON_TPL_DECLARATION
+class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-special-member-functions)
+    : public ::nlohmann::detail::json_base_class<CustomBaseClass>
+{
+  private:
+    template<detail::value_t> friend struct detail::external_constructor;
+
+    template<typename>
+    friend class ::nlohmann::json_pointer;
+    // can be restored when json_pointer backwards compatibility is removed
+    // friend ::nlohmann::json_pointer<StringType>;
+
+    template<typename BasicJsonType, typename InputType>
+    friend class ::nlohmann::detail::parser;
+    friend ::nlohmann::detail::serializer<basic_json>;
+    template<typename BasicJsonType>
+    friend class ::nlohmann::detail::iter_impl;
+    template<typename BasicJsonType, typename CharType>
+    friend class ::nlohmann::detail::binary_writer;
+    template<typename BasicJsonType, typename InputType, typename SAX>
+    friend class ::nlohmann::detail::binary_reader;
+    template<typename BasicJsonType>
+    friend class ::nlohmann::detail::json_sax_dom_parser;
+    template<typename BasicJsonType>
+    friend class ::nlohmann::detail::json_sax_dom_callback_parser;
+    friend class ::nlohmann::detail::exception;
+
+    /// workaround type for MSVC
+    using basic_json_t = NLOHMANN_BASIC_JSON_TPL;
+    using json_base_class_t = ::nlohmann::detail::json_base_class<CustomBaseClass>;
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    // convenience aliases for types residing in namespace detail;
+    using lexer = ::nlohmann::detail::lexer_base<basic_json>;
+
+    template<typename InputAdapterType>
+    static ::nlohmann::detail::parser<basic_json, InputAdapterType> parser(
+        InputAdapterType adapter,
+        detail::parser_callback_t<basic_json>cb = nullptr,
+        const bool allow_exceptions = true,
+        const bool ignore_comments = false
+                                 )
+    {
+        return ::nlohmann::detail::parser<basic_json, InputAdapterType>(std::move(adapter),
+                std::move(cb), allow_exceptions, ignore_comments);
+    }
+
+  private:
+    using primitive_iterator_t = ::nlohmann::detail::primitive_iterator_t;
+    template<typename BasicJsonType>
+    using internal_iterator = ::nlohmann::detail::internal_iterator<BasicJsonType>;
+    template<typename BasicJsonType>
+    using iter_impl = ::nlohmann::detail::iter_impl<BasicJsonType>;
+    template<typename Iterator>
+    using iteration_proxy = ::nlohmann::detail::iteration_proxy<Iterator>;
+    template<typename Base> using json_reverse_iterator = ::nlohmann::detail::json_reverse_iterator<Base>;
+
+    template<typename CharType>
+    using output_adapter_t = ::nlohmann::detail::output_adapter_t<CharType>;
+
+    template<typename InputType>
+    using binary_reader = ::nlohmann::detail::binary_reader<basic_json, InputType>;
+    template<typename CharType> using binary_writer = ::nlohmann::detail::binary_writer<basic_json, CharType>;
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    using serializer = ::nlohmann::detail::serializer<basic_json>;
+
+  public:
+    using value_t = detail::value_t;
+    /// JSON Pointer, see @ref nlohmann::json_pointer
+    using json_pointer = ::nlohmann::json_pointer<StringType>;
+    template<typename T, typename SFINAE>
+    using json_serializer = JSONSerializer<T, SFINAE>;
+    /// how to treat decoding errors
+    using error_handler_t = detail::error_handler_t;
+    /// how to treat CBOR tags
+    using cbor_tag_handler_t = detail::cbor_tag_handler_t;
+    /// helper type for initializer lists of basic_json values
+    using initializer_list_t = std::initializer_list<detail::json_ref<basic_json>>;
+
+    using input_format_t = detail::input_format_t;
+    /// SAX interface type, see @ref nlohmann::json_sax
+    using json_sax_t = json_sax<basic_json>;
+
+    ////////////////
+    // exceptions //
+    ////////////////
+
+    /// @name exceptions
+    /// Classes to implement user-defined exceptions.
+    /// @{
+
+    using exception = detail::exception;
+    using parse_error = detail::parse_error;
+    using invalid_iterator = detail::invalid_iterator;
+    using type_error = detail::type_error;
+    using out_of_range = detail::out_of_range;
+    using other_error = detail::other_error;
+
+    /// @}
+
+    /////////////////////
+    // container types //
+    /////////////////////
+
+    /// @name container types
+    /// The canonic container types to use @ref basic_json like any other STL
+    /// container.
+    /// @{
+
+    /// the type of elements in a basic_json container
+    using value_type = basic_json;
+
+    /// the type of an element reference
+    using reference = value_type&;
+    /// the type of an element const reference
+    using const_reference = const value_type&;
+
+    /// a type to represent differences between iterators
+    using difference_type = std::ptrdiff_t;
+    /// a type to represent container sizes
+    using size_type = std::size_t;
+
+    /// the allocator type
+    using allocator_type = AllocatorType<basic_json>;
+
+    /// the type of an element pointer
+    using pointer = typename std::allocator_traits<allocator_type>::pointer;
+    /// the type of an element const pointer
+    using const_pointer = typename std::allocator_traits<allocator_type>::const_pointer;
+
+    /// an iterator for a basic_json container
+    using iterator = iter_impl<basic_json>;
+    /// a const iterator for a basic_json container
+    using const_iterator = iter_impl<const basic_json>;
+    /// a reverse iterator for a basic_json container
+    using reverse_iterator = json_reverse_iterator<typename basic_json::iterator>;
+    /// a const reverse iterator for a basic_json container
+    using const_reverse_iterator = json_reverse_iterator<typename basic_json::const_iterator>;
+
+    /// @}
+
+    /// @brief returns the allocator associated with the container
+    /// @sa https://json.nlohmann.me/api/basic_json/get_allocator/
+    static allocator_type get_allocator()
+    {
+        return allocator_type();
+    }
+
+    /// @brief returns version information on the library
+    /// @sa https://json.nlohmann.me/api/basic_json/meta/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json meta()
+    {
+        basic_json result;
+
+        result["copyright"] = "(C) 2013-2023 Niels Lohmann";
+        result["name"] = "JSON for Modern C++";
+        result["url"] = "https://github.com/nlohmann/json";
+        result["version"]["string"] =
+            detail::concat(std::to_string(NLOHMANN_JSON_VERSION_MAJOR), '.',
+                           std::to_string(NLOHMANN_JSON_VERSION_MINOR), '.',
+                           std::to_string(NLOHMANN_JSON_VERSION_PATCH));
+        result["version"]["major"] = NLOHMANN_JSON_VERSION_MAJOR;
+        result["version"]["minor"] = NLOHMANN_JSON_VERSION_MINOR;
+        result["version"]["patch"] = NLOHMANN_JSON_VERSION_PATCH;
+
+#ifdef _WIN32
+        result["platform"] = "win32";
+#elif defined __linux__
+        result["platform"] = "linux";
+#elif defined __APPLE__
+        result["platform"] = "apple";
+#elif defined __unix__
+        result["platform"] = "unix";
+#else
+        result["platform"] = "unknown";
+#endif
+
+#if defined(__ICC) || defined(__INTEL_COMPILER)
+        result["compiler"] = {{"family", "icc"}, {"version", __INTEL_COMPILER}};
+#elif defined(__clang__)
+        result["compiler"] = {{"family", "clang"}, {"version", __clang_version__}};
+#elif defined(__GNUC__) || defined(__GNUG__)
+        result["compiler"] = {{"family", "gcc"}, {"version", detail::concat(
+                    std::to_string(__GNUC__), '.',
+                    std::to_string(__GNUC_MINOR__), '.',
+                    std::to_string(__GNUC_PATCHLEVEL__))
+            }
+        };
+#elif defined(__HP_cc) || defined(__HP_aCC)
+        result["compiler"] = "hp"
+#elif defined(__IBMCPP__)
+        result["compiler"] = {{"family", "ilecpp"}, {"version", __IBMCPP__}};
+#elif defined(_MSC_VER)
+        result["compiler"] = {{"family", "msvc"}, {"version", _MSC_VER}};
+#elif defined(__PGI)
+        result["compiler"] = {{"family", "pgcpp"}, {"version", __PGI}};
+#elif defined(__SUNPRO_CC)
+        result["compiler"] = {{"family", "sunpro"}, {"version", __SUNPRO_CC}};
+#else
+        result["compiler"] = {{"family", "unknown"}, {"version", "unknown"}};
+#endif
+
+#if defined(_MSVC_LANG)
+        result["compiler"]["c++"] = std::to_string(_MSVC_LANG);
+#elif defined(__cplusplus)
+        result["compiler"]["c++"] = std::to_string(__cplusplus);
+#else
+        result["compiler"]["c++"] = "unknown";
+#endif
+        return result;
+    }
+
+    ///////////////////////////
+    // JSON value data types //
+    ///////////////////////////
+
+    /// @name JSON value data types
+    /// The data types to store a JSON value. These types are derived from
+    /// the template arguments passed to class @ref basic_json.
+    /// @{
+
+    /// @brief default object key comparator type
+    /// The actual object key comparator type (@ref object_comparator_t) may be
+    /// different.
+    /// @sa https://json.nlohmann.me/api/basic_json/default_object_comparator_t/
+#if defined(JSON_HAS_CPP_14)
+    // use of transparent comparator avoids unnecessary repeated construction of temporaries
+    // in functions involving lookup by key with types other than object_t::key_type (aka. StringType)
+    using default_object_comparator_t = std::less<>;
+#else
+    using default_object_comparator_t = std::less<StringType>;
+#endif
+
+    /// @brief a type for an object
+    /// @sa https://json.nlohmann.me/api/basic_json/object_t/
+    using object_t = ObjectType<StringType,
+          basic_json,
+          default_object_comparator_t,
+          AllocatorType<std::pair<const StringType,
+          basic_json>>>;
+
+    /// @brief a type for an array
+    /// @sa https://json.nlohmann.me/api/basic_json/array_t/
+    using array_t = ArrayType<basic_json, AllocatorType<basic_json>>;
+
+    /// @brief a type for a string
+    /// @sa https://json.nlohmann.me/api/basic_json/string_t/
+    using string_t = StringType;
+
+    /// @brief a type for a boolean
+    /// @sa https://json.nlohmann.me/api/basic_json/boolean_t/
+    using boolean_t = BooleanType;
+
+    /// @brief a type for a number (integer)
+    /// @sa https://json.nlohmann.me/api/basic_json/number_integer_t/
+    using number_integer_t = NumberIntegerType;
+
+    /// @brief a type for a number (unsigned)
+    /// @sa https://json.nlohmann.me/api/basic_json/number_unsigned_t/
+    using number_unsigned_t = NumberUnsignedType;
+
+    /// @brief a type for a number (floating-point)
+    /// @sa https://json.nlohmann.me/api/basic_json/number_float_t/
+    using number_float_t = NumberFloatType;
+
+    /// @brief a type for a packed binary type
+    /// @sa https://json.nlohmann.me/api/basic_json/binary_t/
+    using binary_t = nlohmann::byte_container_with_subtype<BinaryType>;
+
+    /// @brief object key comparator type
+    /// @sa https://json.nlohmann.me/api/basic_json/object_comparator_t/
+    using object_comparator_t = detail::actual_object_comparator_t<basic_json>;
+
+    /// @}
+
+  private:
+
+    /// helper for exception-safe object creation
+    template<typename T, typename... Args>
+    JSON_HEDLEY_RETURNS_NON_NULL
+    static T* create(Args&& ... args)
+    {
+        AllocatorType<T> alloc;
+        using AllocatorTraits = std::allocator_traits<AllocatorType<T>>;
+
+        auto deleter = [&](T * obj)
+        {
+            AllocatorTraits::deallocate(alloc, obj, 1);
+        };
+        std::unique_ptr<T, decltype(deleter)> obj(AllocatorTraits::allocate(alloc, 1), deleter);
+        AllocatorTraits::construct(alloc, obj.get(), std::forward<Args>(args)...);
+        JSON_ASSERT(obj != nullptr);
+        return obj.release();
+    }
+
+    ////////////////////////
+    // JSON value storage //
+    ////////////////////////
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    /*!
+    @brief a JSON value
+
+    The actual storage for a JSON value of the @ref basic_json class. This
+    union combines the different storage types for the JSON value types
+    defined in @ref value_t.
+
+    JSON type | value_t type    | used type
+    --------- | --------------- | ------------------------
+    object    | object          | pointer to @ref object_t
+    array     | array           | pointer to @ref array_t
+    string    | string          | pointer to @ref string_t
+    boolean   | boolean         | @ref boolean_t
+    number    | number_integer  | @ref number_integer_t
+    number    | number_unsigned | @ref number_unsigned_t
+    number    | number_float    | @ref number_float_t
+    binary    | binary          | pointer to @ref binary_t
+    null      | null            | *no value is stored*
+
+    @note Variable-length types (objects, arrays, and strings) are stored as
+    pointers. The size of the union should not exceed 64 bits if the default
+    value types are used.
+
+    @since version 1.0.0
+    */
+    union json_value
+    {
+        /// object (stored with pointer to save storage)
+        object_t* object;
+        /// array (stored with pointer to save storage)
+        array_t* array;
+        /// string (stored with pointer to save storage)
+        string_t* string;
+        /// binary (stored with pointer to save storage)
+        binary_t* binary;
+        /// boolean
+        boolean_t boolean;
+        /// number (integer)
+        number_integer_t number_integer;
+        /// number (unsigned integer)
+        number_unsigned_t number_unsigned;
+        /// number (floating-point)
+        number_float_t number_float;
+
+        /// default constructor (for null values)
+        json_value() = default;
+        /// constructor for booleans
+        json_value(boolean_t v) noexcept : boolean(v) {}
+        /// constructor for numbers (integer)
+        json_value(number_integer_t v) noexcept : number_integer(v) {}
+        /// constructor for numbers (unsigned)
+        json_value(number_unsigned_t v) noexcept : number_unsigned(v) {}
+        /// constructor for numbers (floating-point)
+        json_value(number_float_t v) noexcept : number_float(v) {}
+        /// constructor for empty values of a given type
+        json_value(value_t t)
+        {
+            switch (t)
+            {
+                case value_t::object:
+                {
+                    object = create<object_t>();
+                    break;
+                }
+
+                case value_t::array:
+                {
+                    array = create<array_t>();
+                    break;
+                }
+
+                case value_t::string:
+                {
+                    string = create<string_t>("");
+                    break;
+                }
+
+                case value_t::binary:
+                {
+                    binary = create<binary_t>();
+                    break;
+                }
+
+                case value_t::boolean:
+                {
+                    boolean = static_cast<boolean_t>(false);
+                    break;
+                }
+
+                case value_t::number_integer:
+                {
+                    number_integer = static_cast<number_integer_t>(0);
+                    break;
+                }
+
+                case value_t::number_unsigned:
+                {
+                    number_unsigned = static_cast<number_unsigned_t>(0);
+                    break;
+                }
+
+                case value_t::number_float:
+                {
+                    number_float = static_cast<number_float_t>(0.0);
+                    break;
+                }
+
+                case value_t::null:
+                {
+                    object = nullptr;  // silence warning, see #821
+                    break;
+                }
+
+                case value_t::discarded:
+                default:
+                {
+                    object = nullptr;  // silence warning, see #821
+                    if (JSON_HEDLEY_UNLIKELY(t == value_t::null))
+                    {
+                        JSON_THROW(other_error::create(500, "961c151d2e87f2686a955a9be24d316f1362bf21 3.11.3", nullptr)); // LCOV_EXCL_LINE
+                    }
+                    break;
+                }
+            }
+        }
+
+        /// constructor for strings
+        json_value(const string_t& value) : string(create<string_t>(value)) {}
+
+        /// constructor for rvalue strings
+        json_value(string_t&& value) : string(create<string_t>(std::move(value))) {}
+
+        /// constructor for objects
+        json_value(const object_t& value) : object(create<object_t>(value)) {}
+
+        /// constructor for rvalue objects
+        json_value(object_t&& value) : object(create<object_t>(std::move(value))) {}
+
+        /// constructor for arrays
+        json_value(const array_t& value) : array(create<array_t>(value)) {}
+
+        /// constructor for rvalue arrays
+        json_value(array_t&& value) : array(create<array_t>(std::move(value))) {}
+
+        /// constructor for binary arrays
+        json_value(const typename binary_t::container_type& value) : binary(create<binary_t>(value)) {}
+
+        /// constructor for rvalue binary arrays
+        json_value(typename binary_t::container_type&& value) : binary(create<binary_t>(std::move(value))) {}
+
+        /// constructor for binary arrays (internal type)
+        json_value(const binary_t& value) : binary(create<binary_t>(value)) {}
+
+        /// constructor for rvalue binary arrays (internal type)
+        json_value(binary_t&& value) : binary(create<binary_t>(std::move(value))) {}
+
+        void destroy(value_t t)
+        {
+            if (
+                (t == value_t::object && object == nullptr) ||
+                (t == value_t::array && array == nullptr) ||
+                (t == value_t::string && string == nullptr) ||
+                (t == value_t::binary && binary == nullptr)
+            )
+            {
+                //not initialized (e.g. due to exception in the ctor)
+                return;
+            }
+            if (t == value_t::array || t == value_t::object)
+            {
+                // flatten the current json_value to a heap-allocated stack
+                std::vector<basic_json> stack;
+
+                // move the top-level items to stack
+                if (t == value_t::array)
+                {
+                    stack.reserve(array->size());
+                    std::move(array->begin(), array->end(), std::back_inserter(stack));
+                }
+                else
+                {
+                    stack.reserve(object->size());
+                    for (auto&& it : *object)
+                    {
+                        stack.push_back(std::move(it.second));
+                    }
+                }
+
+                while (!stack.empty())
+                {
+                    // move the last item to local variable to be processed
+                    basic_json current_item(std::move(stack.back()));
+                    stack.pop_back();
+
+                    // if current_item is array/object, move
+                    // its children to the stack to be processed later
+                    if (current_item.is_array())
+                    {
+                        std::move(current_item.m_data.m_value.array->begin(), current_item.m_data.m_value.array->end(), std::back_inserter(stack));
+
+                        current_item.m_data.m_value.array->clear();
+                    }
+                    else if (current_item.is_object())
+                    {
+                        for (auto&& it : *current_item.m_data.m_value.object)
+                        {
+                            stack.push_back(std::move(it.second));
+                        }
+
+                        current_item.m_data.m_value.object->clear();
+                    }
+
+                    // it's now safe that current_item get destructed
+                    // since it doesn't have any children
+                }
+            }
+
+            switch (t)
+            {
+                case value_t::object:
+                {
+                    AllocatorType<object_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, object);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, object, 1);
+                    break;
+                }
+
+                case value_t::array:
+                {
+                    AllocatorType<array_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, array);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, array, 1);
+                    break;
+                }
+
+                case value_t::string:
+                {
+                    AllocatorType<string_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, string);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, string, 1);
+                    break;
+                }
+
+                case value_t::binary:
+                {
+                    AllocatorType<binary_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, binary);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, binary, 1);
+                    break;
+                }
+
+                case value_t::null:
+                case value_t::boolean:
+                case value_t::number_integer:
+                case value_t::number_unsigned:
+                case value_t::number_float:
+                case value_t::discarded:
+                default:
+                {
+                    break;
+                }
+            }
+        }
+    };
+
+  private:
+    /*!
+    @brief checks the class invariants
+
+    This function asserts the class invariants. It needs to be called at the
+    end of every constructor to make sure that created objects respect the
+    invariant. Furthermore, it has to be called each time the type of a JSON
+    value is changed, because the invariant expresses a relationship between
+    @a m_type and @a m_value.
+
+    Furthermore, the parent relation is checked for arrays and objects: If
+    @a check_parents true and the value is an array or object, then the
+    container's elements must have the current value as parent.
+
+    @param[in] check_parents  whether the parent relation should be checked.
+               The value is true by default and should only be set to false
+               during destruction of objects when the invariant does not
+               need to hold.
+    */
+    void assert_invariant(bool check_parents = true) const noexcept
+    {
+        JSON_ASSERT(m_data.m_type != value_t::object || m_data.m_value.object != nullptr);
+        JSON_ASSERT(m_data.m_type != value_t::array || m_data.m_value.array != nullptr);
+        JSON_ASSERT(m_data.m_type != value_t::string || m_data.m_value.string != nullptr);
+        JSON_ASSERT(m_data.m_type != value_t::binary || m_data.m_value.binary != nullptr);
+
+#if JSON_DIAGNOSTICS
+        JSON_TRY
+        {
+            // cppcheck-suppress assertWithSideEffect
+            JSON_ASSERT(!check_parents || !is_structured() || std::all_of(begin(), end(), [this](const basic_json & j)
+            {
+                return j.m_parent == this;
+            }));
+        }
+        JSON_CATCH(...) {} // LCOV_EXCL_LINE
+#endif
+        static_cast<void>(check_parents);
+    }
+
+    void set_parents()
+    {
+#if JSON_DIAGNOSTICS
+        switch (m_data.m_type)
+        {
+            case value_t::array:
+            {
+                for (auto& element : *m_data.m_value.array)
+                {
+                    element.m_parent = this;
+                }
+                break;
+            }
+
+            case value_t::object:
+            {
+                for (auto& element : *m_data.m_value.object)
+                {
+                    element.second.m_parent = this;
+                }
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+                break;
+        }
+#endif
+    }
+
+    iterator set_parents(iterator it, typename iterator::difference_type count_set_parents)
+    {
+#if JSON_DIAGNOSTICS
+        for (typename iterator::difference_type i = 0; i < count_set_parents; ++i)
+        {
+            (it + i)->m_parent = this;
+        }
+#else
+        static_cast<void>(count_set_parents);
+#endif
+        return it;
+    }
+
+    reference set_parent(reference j, std::size_t old_capacity = static_cast<std::size_t>(-1))
+    {
+#if JSON_DIAGNOSTICS
+        if (old_capacity != static_cast<std::size_t>(-1))
+        {
+            // see https://github.com/nlohmann/json/issues/2838
+            JSON_ASSERT(type() == value_t::array);
+            if (JSON_HEDLEY_UNLIKELY(m_data.m_value.array->capacity() != old_capacity))
+            {
+                // capacity has changed: update all parents
+                set_parents();
+                return j;
+            }
+        }
+
+        // ordered_json uses a vector internally, so pointers could have
+        // been invalidated; see https://github.com/nlohmann/json/issues/2962
+#ifdef JSON_HEDLEY_MSVC_VERSION
+#pragma warning(push )
+#pragma warning(disable : 4127) // ignore warning to replace if with if constexpr
+#endif
+        if (detail::is_ordered_map<object_t>::value)
+        {
+            set_parents();
+            return j;
+        }
+#ifdef JSON_HEDLEY_MSVC_VERSION
+#pragma warning( pop )
+#endif
+
+        j.m_parent = this;
+#else
+        static_cast<void>(j);
+        static_cast<void>(old_capacity);
+#endif
+        return j;
+    }
+
+  public:
+    //////////////////////////
+    // JSON parser callback //
+    //////////////////////////
+
+    /// @brief parser event types
+    /// @sa https://json.nlohmann.me/api/basic_json/parse_event_t/
+    using parse_event_t = detail::parse_event_t;
+
+    /// @brief per-element parser callback type
+    /// @sa https://json.nlohmann.me/api/basic_json/parser_callback_t/
+    using parser_callback_t = detail::parser_callback_t<basic_json>;
+
+    //////////////////
+    // constructors //
+    //////////////////
+
+    /// @name constructors and destructors
+    /// Constructors of class @ref basic_json, copy/move constructor, copy
+    /// assignment, static functions creating objects, and the destructor.
+    /// @{
+
+    /// @brief create an empty value with a given type
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    basic_json(const value_t v)
+        : m_data(v)
+    {
+        assert_invariant();
+    }
+
+    /// @brief create a null object
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    basic_json(std::nullptr_t = nullptr) noexcept // NOLINT(bugprone-exception-escape)
+        : basic_json(value_t::null)
+    {
+        assert_invariant();
+    }
+
+    /// @brief create a JSON value from compatible types
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    template < typename CompatibleType,
+               typename U = detail::uncvref_t<CompatibleType>,
+               detail::enable_if_t <
+                   !detail::is_basic_json<U>::value && detail::is_compatible_type<basic_json_t, U>::value, int > = 0 >
+    basic_json(CompatibleType && val) noexcept(noexcept( // NOLINT(bugprone-forwarding-reference-overload,bugprone-exception-escape)
+                JSONSerializer<U>::to_json(std::declval<basic_json_t&>(),
+                                           std::forward<CompatibleType>(val))))
+    {
+        JSONSerializer<U>::to_json(*this, std::forward<CompatibleType>(val));
+        set_parents();
+        assert_invariant();
+    }
+
+    /// @brief create a JSON value from an existing one
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    template < typename BasicJsonType,
+               detail::enable_if_t <
+                   detail::is_basic_json<BasicJsonType>::value&& !std::is_same<basic_json, BasicJsonType>::value, int > = 0 >
+    basic_json(const BasicJsonType& val)
+    {
+        using other_boolean_t = typename BasicJsonType::boolean_t;
+        using other_number_float_t = typename BasicJsonType::number_float_t;
+        using other_number_integer_t = typename BasicJsonType::number_integer_t;
+        using other_number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+        using other_string_t = typename BasicJsonType::string_t;
+        using other_object_t = typename BasicJsonType::object_t;
+        using other_array_t = typename BasicJsonType::array_t;
+        using other_binary_t = typename BasicJsonType::binary_t;
+
+        switch (val.type())
+        {
+            case value_t::boolean:
+                JSONSerializer<other_boolean_t>::to_json(*this, val.template get<other_boolean_t>());
+                break;
+            case value_t::number_float:
+                JSONSerializer<other_number_float_t>::to_json(*this, val.template get<other_number_float_t>());
+                break;
+            case value_t::number_integer:
+                JSONSerializer<other_number_integer_t>::to_json(*this, val.template get<other_number_integer_t>());
+                break;
+            case value_t::number_unsigned:
+                JSONSerializer<other_number_unsigned_t>::to_json(*this, val.template get<other_number_unsigned_t>());
+                break;
+            case value_t::string:
+                JSONSerializer<other_string_t>::to_json(*this, val.template get_ref<const other_string_t&>());
+                break;
+            case value_t::object:
+                JSONSerializer<other_object_t>::to_json(*this, val.template get_ref<const other_object_t&>());
+                break;
+            case value_t::array:
+                JSONSerializer<other_array_t>::to_json(*this, val.template get_ref<const other_array_t&>());
+                break;
+            case value_t::binary:
+                JSONSerializer<other_binary_t>::to_json(*this, val.template get_ref<const other_binary_t&>());
+                break;
+            case value_t::null:
+                *this = nullptr;
+                break;
+            case value_t::discarded:
+                m_data.m_type = value_t::discarded;
+                break;
+            default:            // LCOV_EXCL_LINE
+                JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+        }
+        JSON_ASSERT(m_data.m_type == val.type());
+        set_parents();
+        assert_invariant();
+    }
+
+    /// @brief create a container (array or object) from an initializer list
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    basic_json(initializer_list_t init,
+               bool type_deduction = true,
+               value_t manual_type = value_t::array)
+    {
+        // check if each element is an array with two elements whose first
+        // element is a string
+        bool is_an_object = std::all_of(init.begin(), init.end(),
+                                        [](const detail::json_ref<basic_json>& element_ref)
+        {
+            // The cast is to ensure op[size_type] is called, bearing in mind size_type may not be int;
+            // (many string types can be constructed from 0 via its null-pointer guise, so we get a
+            // broken call to op[key_type], the wrong semantics and a 4804 warning on Windows)
+            return element_ref->is_array() && element_ref->size() == 2 && (*element_ref)[static_cast<size_type>(0)].is_string();
+        });
+
+        // adjust type if type deduction is not wanted
+        if (!type_deduction)
+        {
+            // if array is wanted, do not create an object though possible
+            if (manual_type == value_t::array)
+            {
+                is_an_object = false;
+            }
+
+            // if object is wanted but impossible, throw an exception
+            if (JSON_HEDLEY_UNLIKELY(manual_type == value_t::object && !is_an_object))
+            {
+                JSON_THROW(type_error::create(301, "cannot create object from initializer list", nullptr));
+            }
+        }
+
+        if (is_an_object)
+        {
+            // the initializer list is a list of pairs -> create object
+            m_data.m_type = value_t::object;
+            m_data.m_value = value_t::object;
+
+            for (auto& element_ref : init)
+            {
+                auto element = element_ref.moved_or_copied();
+                m_data.m_value.object->emplace(
+                    std::move(*((*element.m_data.m_value.array)[0].m_data.m_value.string)),
+                    std::move((*element.m_data.m_value.array)[1]));
+            }
+        }
+        else
+        {
+            // the initializer list describes an array -> create array
+            m_data.m_type = value_t::array;
+            m_data.m_value.array = create<array_t>(init.begin(), init.end());
+        }
+
+        set_parents();
+        assert_invariant();
+    }
+
+    /// @brief explicitly create a binary array (without subtype)
+    /// @sa https://json.nlohmann.me/api/basic_json/binary/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json binary(const typename binary_t::container_type& init)
+    {
+        auto res = basic_json();
+        res.m_data.m_type = value_t::binary;
+        res.m_data.m_value = init;
+        return res;
+    }
+
+    /// @brief explicitly create a binary array (with subtype)
+    /// @sa https://json.nlohmann.me/api/basic_json/binary/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json binary(const typename binary_t::container_type& init, typename binary_t::subtype_type subtype)
+    {
+        auto res = basic_json();
+        res.m_data.m_type = value_t::binary;
+        res.m_data.m_value = binary_t(init, subtype);
+        return res;
+    }
+
+    /// @brief explicitly create a binary array
+    /// @sa https://json.nlohmann.me/api/basic_json/binary/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json binary(typename binary_t::container_type&& init)
+    {
+        auto res = basic_json();
+        res.m_data.m_type = value_t::binary;
+        res.m_data.m_value = std::move(init);
+        return res;
+    }
+
+    /// @brief explicitly create a binary array (with subtype)
+    /// @sa https://json.nlohmann.me/api/basic_json/binary/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json binary(typename binary_t::container_type&& init, typename binary_t::subtype_type subtype)
+    {
+        auto res = basic_json();
+        res.m_data.m_type = value_t::binary;
+        res.m_data.m_value = binary_t(std::move(init), subtype);
+        return res;
+    }
+
+    /// @brief explicitly create an array from an initializer list
+    /// @sa https://json.nlohmann.me/api/basic_json/array/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json array(initializer_list_t init = {})
+    {
+        return basic_json(init, false, value_t::array);
+    }
+
+    /// @brief explicitly create an object from an initializer list
+    /// @sa https://json.nlohmann.me/api/basic_json/object/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json object(initializer_list_t init = {})
+    {
+        return basic_json(init, false, value_t::object);
+    }
+
+    /// @brief construct an array with count copies of given value
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    basic_json(size_type cnt, const basic_json& val):
+        m_data{cnt, val}
+    {
+        set_parents();
+        assert_invariant();
+    }
+
+    /// @brief construct a JSON container given an iterator range
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    template < class InputIT, typename std::enable_if <
+                   std::is_same<InputIT, typename basic_json_t::iterator>::value ||
+                   std::is_same<InputIT, typename basic_json_t::const_iterator>::value, int >::type = 0 >
+    basic_json(InputIT first, InputIT last)
+    {
+        JSON_ASSERT(first.m_object != nullptr);
+        JSON_ASSERT(last.m_object != nullptr);
+
+        // make sure iterator fits the current value
+        if (JSON_HEDLEY_UNLIKELY(first.m_object != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(201, "iterators are not compatible", nullptr));
+        }
+
+        // copy type from first iterator
+        m_data.m_type = first.m_object->m_data.m_type;
+
+        // check if iterator range is complete for primitive values
+        switch (m_data.m_type)
+        {
+            case value_t::boolean:
+            case value_t::number_float:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::string:
+            {
+                if (JSON_HEDLEY_UNLIKELY(!first.m_it.primitive_iterator.is_begin()
+                                         || !last.m_it.primitive_iterator.is_end()))
+                {
+                    JSON_THROW(invalid_iterator::create(204, "iterators out of range", first.m_object));
+                }
+                break;
+            }
+
+            case value_t::null:
+            case value_t::object:
+            case value_t::array:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+                break;
+        }
+
+        switch (m_data.m_type)
+        {
+            case value_t::number_integer:
+            {
+                m_data.m_value.number_integer = first.m_object->m_data.m_value.number_integer;
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                m_data.m_value.number_unsigned = first.m_object->m_data.m_value.number_unsigned;
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                m_data.m_value.number_float = first.m_object->m_data.m_value.number_float;
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                m_data.m_value.boolean = first.m_object->m_data.m_value.boolean;
+                break;
+            }
+
+            case value_t::string:
+            {
+                m_data.m_value = *first.m_object->m_data.m_value.string;
+                break;
+            }
+
+            case value_t::object:
+            {
+                m_data.m_value.object = create<object_t>(first.m_it.object_iterator,
+                                        last.m_it.object_iterator);
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_data.m_value.array = create<array_t>(first.m_it.array_iterator,
+                                                       last.m_it.array_iterator);
+                break;
+            }
+
+            case value_t::binary:
+            {
+                m_data.m_value = *first.m_object->m_data.m_value.binary;
+                break;
+            }
+
+            case value_t::null:
+            case value_t::discarded:
+            default:
+                JSON_THROW(invalid_iterator::create(206, detail::concat("cannot construct with iterators from ", first.m_object->type_name()), first.m_object));
+        }
+
+        set_parents();
+        assert_invariant();
+    }
+
+    ///////////////////////////////////////
+    // other constructors and destructor //
+    ///////////////////////////////////////
+
+    template<typename JsonRef,
+             detail::enable_if_t<detail::conjunction<detail::is_json_ref<JsonRef>,
+                                 std::is_same<typename JsonRef::value_type, basic_json>>::value, int> = 0 >
+    basic_json(const JsonRef& ref) : basic_json(ref.moved_or_copied()) {}
+
+    /// @brief copy constructor
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    basic_json(const basic_json& other)
+        : json_base_class_t(other)
+    {
+        m_data.m_type = other.m_data.m_type;
+        // check of passed value is valid
+        other.assert_invariant();
+
+        switch (m_data.m_type)
+        {
+            case value_t::object:
+            {
+                m_data.m_value = *other.m_data.m_value.object;
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_data.m_value = *other.m_data.m_value.array;
+                break;
+            }
+
+            case value_t::string:
+            {
+                m_data.m_value = *other.m_data.m_value.string;
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                m_data.m_value = other.m_data.m_value.boolean;
+                break;
+            }
+
+            case value_t::number_integer:
+            {
+                m_data.m_value = other.m_data.m_value.number_integer;
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                m_data.m_value = other.m_data.m_value.number_unsigned;
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                m_data.m_value = other.m_data.m_value.number_float;
+                break;
+            }
+
+            case value_t::binary:
+            {
+                m_data.m_value = *other.m_data.m_value.binary;
+                break;
+            }
+
+            case value_t::null:
+            case value_t::discarded:
+            default:
+                break;
+        }
+
+        set_parents();
+        assert_invariant();
+    }
+
+    /// @brief move constructor
+    /// @sa https://json.nlohmann.me/api/basic_json/basic_json/
+    basic_json(basic_json&& other) noexcept
+        : json_base_class_t(std::forward<json_base_class_t>(other)),
+          m_data(std::move(other.m_data))
+    {
+        // check that passed value is valid
+        other.assert_invariant(false);
+
+        // invalidate payload
+        other.m_data.m_type = value_t::null;
+        other.m_data.m_value = {};
+
+        set_parents();
+        assert_invariant();
+    }
+
+    /// @brief copy assignment
+    /// @sa https://json.nlohmann.me/api/basic_json/operator=/
+    basic_json& operator=(basic_json other) noexcept (
+        std::is_nothrow_move_constructible<value_t>::value&&
+        std::is_nothrow_move_assignable<value_t>::value&&
+        std::is_nothrow_move_constructible<json_value>::value&&
+        std::is_nothrow_move_assignable<json_value>::value&&
+        std::is_nothrow_move_assignable<json_base_class_t>::value
+    )
+    {
+        // check that passed value is valid
+        other.assert_invariant();
+
+        using std::swap;
+        swap(m_data.m_type, other.m_data.m_type);
+        swap(m_data.m_value, other.m_data.m_value);
+        json_base_class_t::operator=(std::move(other));
+
+        set_parents();
+        assert_invariant();
+        return *this;
+    }
+
+    /// @brief destructor
+    /// @sa https://json.nlohmann.me/api/basic_json/~basic_json/
+    ~basic_json() noexcept
+    {
+        assert_invariant(false);
+    }
+
+    /// @}
+
+  public:
+    ///////////////////////
+    // object inspection //
+    ///////////////////////
+
+    /// @name object inspection
+    /// Functions to inspect the type of a JSON value.
+    /// @{
+
+    /// @brief serialization
+    /// @sa https://json.nlohmann.me/api/basic_json/dump/
+    string_t dump(const int indent = -1,
+                  const char indent_char = ' ',
+                  const bool ensure_ascii = false,
+                  const error_handler_t error_handler = error_handler_t::strict) const
+    {
+        string_t result;
+        serializer s(detail::output_adapter<char, string_t>(result), indent_char, error_handler);
+
+        if (indent >= 0)
+        {
+            s.dump(*this, true, ensure_ascii, static_cast<unsigned int>(indent));
+        }
+        else
+        {
+            s.dump(*this, false, ensure_ascii, 0);
+        }
+
+        return result;
+    }
+
+    /// @brief return the type of the JSON value (explicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/type/
+    constexpr value_t type() const noexcept
+    {
+        return m_data.m_type;
+    }
+
+    /// @brief return whether type is primitive
+    /// @sa https://json.nlohmann.me/api/basic_json/is_primitive/
+    constexpr bool is_primitive() const noexcept
+    {
+        return is_null() || is_string() || is_boolean() || is_number() || is_binary();
+    }
+
+    /// @brief return whether type is structured
+    /// @sa https://json.nlohmann.me/api/basic_json/is_structured/
+    constexpr bool is_structured() const noexcept
+    {
+        return is_array() || is_object();
+    }
+
+    /// @brief return whether value is null
+    /// @sa https://json.nlohmann.me/api/basic_json/is_null/
+    constexpr bool is_null() const noexcept
+    {
+        return m_data.m_type == value_t::null;
+    }
+
+    /// @brief return whether value is a boolean
+    /// @sa https://json.nlohmann.me/api/basic_json/is_boolean/
+    constexpr bool is_boolean() const noexcept
+    {
+        return m_data.m_type == value_t::boolean;
+    }
+
+    /// @brief return whether value is a number
+    /// @sa https://json.nlohmann.me/api/basic_json/is_number/
+    constexpr bool is_number() const noexcept
+    {
+        return is_number_integer() || is_number_float();
+    }
+
+    /// @brief return whether value is an integer number
+    /// @sa https://json.nlohmann.me/api/basic_json/is_number_integer/
+    constexpr bool is_number_integer() const noexcept
+    {
+        return m_data.m_type == value_t::number_integer || m_data.m_type == value_t::number_unsigned;
+    }
+
+    /// @brief return whether value is an unsigned integer number
+    /// @sa https://json.nlohmann.me/api/basic_json/is_number_unsigned/
+    constexpr bool is_number_unsigned() const noexcept
+    {
+        return m_data.m_type == value_t::number_unsigned;
+    }
+
+    /// @brief return whether value is a floating-point number
+    /// @sa https://json.nlohmann.me/api/basic_json/is_number_float/
+    constexpr bool is_number_float() const noexcept
+    {
+        return m_data.m_type == value_t::number_float;
+    }
+
+    /// @brief return whether value is an object
+    /// @sa https://json.nlohmann.me/api/basic_json/is_object/
+    constexpr bool is_object() const noexcept
+    {
+        return m_data.m_type == value_t::object;
+    }
+
+    /// @brief return whether value is an array
+    /// @sa https://json.nlohmann.me/api/basic_json/is_array/
+    constexpr bool is_array() const noexcept
+    {
+        return m_data.m_type == value_t::array;
+    }
+
+    /// @brief return whether value is a string
+    /// @sa https://json.nlohmann.me/api/basic_json/is_string/
+    constexpr bool is_string() const noexcept
+    {
+        return m_data.m_type == value_t::string;
+    }
+
+    /// @brief return whether value is a binary array
+    /// @sa https://json.nlohmann.me/api/basic_json/is_binary/
+    constexpr bool is_binary() const noexcept
+    {
+        return m_data.m_type == value_t::binary;
+    }
+
+    /// @brief return whether value is discarded
+    /// @sa https://json.nlohmann.me/api/basic_json/is_discarded/
+    constexpr bool is_discarded() const noexcept
+    {
+        return m_data.m_type == value_t::discarded;
+    }
+
+    /// @brief return the type of the JSON value (implicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_value_t/
+    constexpr operator value_t() const noexcept
+    {
+        return m_data.m_type;
+    }
+
+    /// @}
+
+  private:
+    //////////////////
+    // value access //
+    //////////////////
+
+    /// get a boolean (explicit)
+    boolean_t get_impl(boolean_t* /*unused*/) const
+    {
+        if (JSON_HEDLEY_LIKELY(is_boolean()))
+        {
+            return m_data.m_value.boolean;
+        }
+
+        JSON_THROW(type_error::create(302, detail::concat("type must be boolean, but is ", type_name()), this));
+    }
+
+    /// get a pointer to the value (object)
+    object_t* get_impl_ptr(object_t* /*unused*/) noexcept
+    {
+        return is_object() ? m_data.m_value.object : nullptr;
+    }
+
+    /// get a pointer to the value (object)
+    constexpr const object_t* get_impl_ptr(const object_t* /*unused*/) const noexcept
+    {
+        return is_object() ? m_data.m_value.object : nullptr;
+    }
+
+    /// get a pointer to the value (array)
+    array_t* get_impl_ptr(array_t* /*unused*/) noexcept
+    {
+        return is_array() ? m_data.m_value.array : nullptr;
+    }
+
+    /// get a pointer to the value (array)
+    constexpr const array_t* get_impl_ptr(const array_t* /*unused*/) const noexcept
+    {
+        return is_array() ? m_data.m_value.array : nullptr;
+    }
+
+    /// get a pointer to the value (string)
+    string_t* get_impl_ptr(string_t* /*unused*/) noexcept
+    {
+        return is_string() ? m_data.m_value.string : nullptr;
+    }
+
+    /// get a pointer to the value (string)
+    constexpr const string_t* get_impl_ptr(const string_t* /*unused*/) const noexcept
+    {
+        return is_string() ? m_data.m_value.string : nullptr;
+    }
+
+    /// get a pointer to the value (boolean)
+    boolean_t* get_impl_ptr(boolean_t* /*unused*/) noexcept
+    {
+        return is_boolean() ? &m_data.m_value.boolean : nullptr;
+    }
+
+    /// get a pointer to the value (boolean)
+    constexpr const boolean_t* get_impl_ptr(const boolean_t* /*unused*/) const noexcept
+    {
+        return is_boolean() ? &m_data.m_value.boolean : nullptr;
+    }
+
+    /// get a pointer to the value (integer number)
+    number_integer_t* get_impl_ptr(number_integer_t* /*unused*/) noexcept
+    {
+        return is_number_integer() ? &m_data.m_value.number_integer : nullptr;
+    }
+
+    /// get a pointer to the value (integer number)
+    constexpr const number_integer_t* get_impl_ptr(const number_integer_t* /*unused*/) const noexcept
+    {
+        return is_number_integer() ? &m_data.m_value.number_integer : nullptr;
+    }
+
+    /// get a pointer to the value (unsigned number)
+    number_unsigned_t* get_impl_ptr(number_unsigned_t* /*unused*/) noexcept
+    {
+        return is_number_unsigned() ? &m_data.m_value.number_unsigned : nullptr;
+    }
+
+    /// get a pointer to the value (unsigned number)
+    constexpr const number_unsigned_t* get_impl_ptr(const number_unsigned_t* /*unused*/) const noexcept
+    {
+        return is_number_unsigned() ? &m_data.m_value.number_unsigned : nullptr;
+    }
+
+    /// get a pointer to the value (floating-point number)
+    number_float_t* get_impl_ptr(number_float_t* /*unused*/) noexcept
+    {
+        return is_number_float() ? &m_data.m_value.number_float : nullptr;
+    }
+
+    /// get a pointer to the value (floating-point number)
+    constexpr const number_float_t* get_impl_ptr(const number_float_t* /*unused*/) const noexcept
+    {
+        return is_number_float() ? &m_data.m_value.number_float : nullptr;
+    }
+
+    /// get a pointer to the value (binary)
+    binary_t* get_impl_ptr(binary_t* /*unused*/) noexcept
+    {
+        return is_binary() ? m_data.m_value.binary : nullptr;
+    }
+
+    /// get a pointer to the value (binary)
+    constexpr const binary_t* get_impl_ptr(const binary_t* /*unused*/) const noexcept
+    {
+        return is_binary() ? m_data.m_value.binary : nullptr;
+    }
+
+    /*!
+    @brief helper function to implement get_ref()
+
+    This function helps to implement get_ref() without code duplication for
+    const and non-const overloads
+
+    @tparam ThisType will be deduced as `basic_json` or `const basic_json`
+
+    @throw type_error.303 if ReferenceType does not match underlying value
+    type of the current JSON
+    */
+    template<typename ReferenceType, typename ThisType>
+    static ReferenceType get_ref_impl(ThisType& obj)
+    {
+        // delegate the call to get_ptr<>()
+        auto* ptr = obj.template get_ptr<typename std::add_pointer<ReferenceType>::type>();
+
+        if (JSON_HEDLEY_LIKELY(ptr != nullptr))
+        {
+            return *ptr;
+        }
+
+        JSON_THROW(type_error::create(303, detail::concat("incompatible ReferenceType for get_ref, actual type is ", obj.type_name()), &obj));
+    }
+
+  public:
+    /// @name value access
+    /// Direct access to the stored value of a JSON value.
+    /// @{
+
+    /// @brief get a pointer value (implicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/get_ptr/
+    template<typename PointerType, typename std::enable_if<
+                 std::is_pointer<PointerType>::value, int>::type = 0>
+    auto get_ptr() noexcept -> decltype(std::declval<basic_json_t&>().get_impl_ptr(std::declval<PointerType>()))
+    {
+        // delegate the call to get_impl_ptr<>()
+        return get_impl_ptr(static_cast<PointerType>(nullptr));
+    }
+
+    /// @brief get a pointer value (implicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/get_ptr/
+    template < typename PointerType, typename std::enable_if <
+                   std::is_pointer<PointerType>::value&&
+                   std::is_const<typename std::remove_pointer<PointerType>::type>::value, int >::type = 0 >
+    constexpr auto get_ptr() const noexcept -> decltype(std::declval<const basic_json_t&>().get_impl_ptr(std::declval<PointerType>()))
+    {
+        // delegate the call to get_impl_ptr<>() const
+        return get_impl_ptr(static_cast<PointerType>(nullptr));
+    }
+
+  private:
+    /*!
+    @brief get a value (explicit)
+
+    Explicit type conversion between the JSON value and a compatible value
+    which is [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible)
+    and [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible).
+    The value is converted by calling the @ref json_serializer<ValueType>
+    `from_json()` method.
+
+    The function is equivalent to executing
+    @code {.cpp}
+    ValueType ret;
+    JSONSerializer<ValueType>::from_json(*this, ret);
+    return ret;
+    @endcode
+
+    This overloads is chosen if:
+    - @a ValueType is not @ref basic_json,
+    - @ref json_serializer<ValueType> has a `from_json()` method of the form
+      `void from_json(const basic_json&, ValueType&)`, and
+    - @ref json_serializer<ValueType> does not have a `from_json()` method of
+      the form `ValueType from_json(const basic_json&)`
+
+    @tparam ValueType the returned value type
+
+    @return copy of the JSON value, converted to @a ValueType
+
+    @throw what @ref json_serializer<ValueType> `from_json()` method throws
+
+    @liveexample{The example below shows several conversions from JSON values
+    to other types. There a few things to note: (1) Floating-point numbers can
+    be converted to integers\, (2) A JSON array can be converted to a standard
+    `std::vector<short>`\, (3) A JSON object can be converted to C++
+    associative containers such as `std::unordered_map<std::string\,
+    json>`.,get__ValueType_const}
+
+    @since version 2.1.0
+    */
+    template < typename ValueType,
+               detail::enable_if_t <
+                   detail::is_default_constructible<ValueType>::value&&
+                   detail::has_from_json<basic_json_t, ValueType>::value,
+                   int > = 0 >
+    ValueType get_impl(detail::priority_tag<0> /*unused*/) const noexcept(noexcept(
+                JSONSerializer<ValueType>::from_json(std::declval<const basic_json_t&>(), std::declval<ValueType&>())))
+    {
+        auto ret = ValueType();
+        JSONSerializer<ValueType>::from_json(*this, ret);
+        return ret;
+    }
+
+    /*!
+    @brief get a value (explicit); special case
+
+    Explicit type conversion between the JSON value and a compatible value
+    which is **not** [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible)
+    and **not** [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible).
+    The value is converted by calling the @ref json_serializer<ValueType>
+    `from_json()` method.
+
+    The function is equivalent to executing
+    @code {.cpp}
+    return JSONSerializer<ValueType>::from_json(*this);
+    @endcode
+
+    This overloads is chosen if:
+    - @a ValueType is not @ref basic_json and
+    - @ref json_serializer<ValueType> has a `from_json()` method of the form
+      `ValueType from_json(const basic_json&)`
+
+    @note If @ref json_serializer<ValueType> has both overloads of
+    `from_json()`, this one is chosen.
+
+    @tparam ValueType the returned value type
+
+    @return copy of the JSON value, converted to @a ValueType
+
+    @throw what @ref json_serializer<ValueType> `from_json()` method throws
+
+    @since version 2.1.0
+    */
+    template < typename ValueType,
+               detail::enable_if_t <
+                   detail::has_non_default_from_json<basic_json_t, ValueType>::value,
+                   int > = 0 >
+    ValueType get_impl(detail::priority_tag<1> /*unused*/) const noexcept(noexcept(
+                JSONSerializer<ValueType>::from_json(std::declval<const basic_json_t&>())))
+    {
+        return JSONSerializer<ValueType>::from_json(*this);
+    }
+
+    /*!
+    @brief get special-case overload
+
+    This overloads converts the current @ref basic_json in a different
+    @ref basic_json type
+
+    @tparam BasicJsonType == @ref basic_json
+
+    @return a copy of *this, converted into @a BasicJsonType
+
+    @complexity Depending on the implementation of the called `from_json()`
+                method.
+
+    @since version 3.2.0
+    */
+    template < typename BasicJsonType,
+               detail::enable_if_t <
+                   detail::is_basic_json<BasicJsonType>::value,
+                   int > = 0 >
+    BasicJsonType get_impl(detail::priority_tag<2> /*unused*/) const
+    {
+        return *this;
+    }
+
+    /*!
+    @brief get special-case overload
+
+    This overloads avoids a lot of template boilerplate, it can be seen as the
+    identity method
+
+    @tparam BasicJsonType == @ref basic_json
+
+    @return a copy of *this
+
+    @complexity Constant.
+
+    @since version 2.1.0
+    */
+    template<typename BasicJsonType,
+             detail::enable_if_t<
+                 std::is_same<BasicJsonType, basic_json_t>::value,
+                 int> = 0>
+    basic_json get_impl(detail::priority_tag<3> /*unused*/) const
+    {
+        return *this;
+    }
+
+    /*!
+    @brief get a pointer value (explicit)
+    @copydoc get()
+    */
+    template<typename PointerType,
+             detail::enable_if_t<
+                 std::is_pointer<PointerType>::value,
+                 int> = 0>
+    constexpr auto get_impl(detail::priority_tag<4> /*unused*/) const noexcept
+    -> decltype(std::declval<const basic_json_t&>().template get_ptr<PointerType>())
+    {
+        // delegate the call to get_ptr
+        return get_ptr<PointerType>();
+    }
+
+  public:
+    /*!
+    @brief get a (pointer) value (explicit)
+
+    Performs explicit type conversion between the JSON value and a compatible value if required.
+
+    - If the requested type is a pointer to the internally stored JSON value that pointer is returned.
+    No copies are made.
+
+    - If the requested type is the current @ref basic_json, or a different @ref basic_json convertible
+    from the current @ref basic_json.
+
+    - Otherwise the value is converted by calling the @ref json_serializer<ValueType> `from_json()`
+    method.
+
+    @tparam ValueTypeCV the provided value type
+    @tparam ValueType the returned value type
+
+    @return copy of the JSON value, converted to @tparam ValueType if necessary
+
+    @throw what @ref json_serializer<ValueType> `from_json()` method throws if conversion is required
+
+    @since version 2.1.0
+    */
+    template < typename ValueTypeCV, typename ValueType = detail::uncvref_t<ValueTypeCV>>
+#if defined(JSON_HAS_CPP_14)
+    constexpr
+#endif
+    auto get() const noexcept(
+    noexcept(std::declval<const basic_json_t&>().template get_impl<ValueType>(detail::priority_tag<4> {})))
+    -> decltype(std::declval<const basic_json_t&>().template get_impl<ValueType>(detail::priority_tag<4> {}))
+    {
+        // we cannot static_assert on ValueTypeCV being non-const, because
+        // there is support for get<const basic_json_t>(), which is why we
+        // still need the uncvref
+        static_assert(!std::is_reference<ValueTypeCV>::value,
+                      "get() cannot be used with reference types, you might want to use get_ref()");
+        return get_impl<ValueType>(detail::priority_tag<4> {});
+    }
+
+    /*!
+    @brief get a pointer value (explicit)
+
+    Explicit pointer access to the internally stored JSON value. No copies are
+    made.
+
+    @warning The pointer becomes invalid if the underlying JSON object
+    changes.
+
+    @tparam PointerType pointer type; must be a pointer to @ref array_t, @ref
+    object_t, @ref string_t, @ref boolean_t, @ref number_integer_t,
+    @ref number_unsigned_t, or @ref number_float_t.
+
+    @return pointer to the internally stored JSON value if the requested
+    pointer type @a PointerType fits to the JSON value; `nullptr` otherwise
+
+    @complexity Constant.
+
+    @liveexample{The example below shows how pointers to internal values of a
+    JSON value can be requested. Note that no type conversions are made and a
+    `nullptr` is returned if the value and the requested pointer type does not
+    match.,get__PointerType}
+
+    @sa see @ref get_ptr() for explicit pointer-member access
+
+    @since version 1.0.0
+    */
+    template<typename PointerType, typename std::enable_if<
+                 std::is_pointer<PointerType>::value, int>::type = 0>
+    auto get() noexcept -> decltype(std::declval<basic_json_t&>().template get_ptr<PointerType>())
+    {
+        // delegate the call to get_ptr
+        return get_ptr<PointerType>();
+    }
+
+    /// @brief get a value (explicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/get_to/
+    template < typename ValueType,
+               detail::enable_if_t <
+                   !detail::is_basic_json<ValueType>::value&&
+                   detail::has_from_json<basic_json_t, ValueType>::value,
+                   int > = 0 >
+    ValueType & get_to(ValueType& v) const noexcept(noexcept(
+                JSONSerializer<ValueType>::from_json(std::declval<const basic_json_t&>(), v)))
+    {
+        JSONSerializer<ValueType>::from_json(*this, v);
+        return v;
+    }
+
+    // specialization to allow calling get_to with a basic_json value
+    // see https://github.com/nlohmann/json/issues/2175
+    template<typename ValueType,
+             detail::enable_if_t <
+                 detail::is_basic_json<ValueType>::value,
+                 int> = 0>
+    ValueType & get_to(ValueType& v) const
+    {
+        v = *this;
+        return v;
+    }
+
+    template <
+        typename T, std::size_t N,
+        typename Array = T (&)[N], // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+        detail::enable_if_t <
+            detail::has_from_json<basic_json_t, Array>::value, int > = 0 >
+    Array get_to(T (&v)[N]) const // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
+    noexcept(noexcept(JSONSerializer<Array>::from_json(
+                          std::declval<const basic_json_t&>(), v)))
+    {
+        JSONSerializer<Array>::from_json(*this, v);
+        return v;
+    }
+
+    /// @brief get a reference value (implicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/get_ref/
+    template<typename ReferenceType, typename std::enable_if<
+                 std::is_reference<ReferenceType>::value, int>::type = 0>
+    ReferenceType get_ref()
+    {
+        // delegate call to get_ref_impl
+        return get_ref_impl<ReferenceType>(*this);
+    }
+
+    /// @brief get a reference value (implicit)
+    /// @sa https://json.nlohmann.me/api/basic_json/get_ref/
+    template < typename ReferenceType, typename std::enable_if <
+                   std::is_reference<ReferenceType>::value&&
+                   std::is_const<typename std::remove_reference<ReferenceType>::type>::value, int >::type = 0 >
+    ReferenceType get_ref() const
+    {
+        // delegate call to get_ref_impl
+        return get_ref_impl<ReferenceType>(*this);
+    }
+
+    /*!
+    @brief get a value (implicit)
+
+    Implicit type conversion between the JSON value and a compatible value.
+    The call is realized by calling @ref get() const.
+
+    @tparam ValueType non-pointer type compatible to the JSON value, for
+    instance `int` for JSON integer numbers, `bool` for JSON booleans, or
+    `std::vector` types for JSON arrays. The character type of @ref string_t
+    as well as an initializer list of this type is excluded to avoid
+    ambiguities as these types implicitly convert to `std::string`.
+
+    @return copy of the JSON value, converted to type @a ValueType
+
+    @throw type_error.302 in case passed type @a ValueType is incompatible
+    to the JSON value type (e.g., the JSON value is of type boolean, but a
+    string is requested); see example below
+
+    @complexity Linear in the size of the JSON value.
+
+    @liveexample{The example below shows several conversions from JSON values
+    to other types. There a few things to note: (1) Floating-point numbers can
+    be converted to integers\, (2) A JSON array can be converted to a standard
+    `std::vector<short>`\, (3) A JSON object can be converted to C++
+    associative containers such as `std::unordered_map<std::string\,
+    json>`.,operator__ValueType}
+
+    @since version 1.0.0
+    */
+    template < typename ValueType, typename std::enable_if <
+                   detail::conjunction <
+                       detail::negation<std::is_pointer<ValueType>>,
+                       detail::negation<std::is_same<ValueType, std::nullptr_t>>,
+                       detail::negation<std::is_same<ValueType, detail::json_ref<basic_json>>>,
+                                        detail::negation<std::is_same<ValueType, typename string_t::value_type>>,
+                                        detail::negation<detail::is_basic_json<ValueType>>,
+                                        detail::negation<std::is_same<ValueType, std::initializer_list<typename string_t::value_type>>>,
+#if defined(JSON_HAS_CPP_17) && (defined(__GNUC__) || (defined(_MSC_VER) && _MSC_VER >= 1910 && _MSC_VER <= 1914))
+                                                detail::negation<std::is_same<ValueType, std::string_view>>,
+#endif
+#if defined(JSON_HAS_CPP_17) && JSON_HAS_STATIC_RTTI
+                                                detail::negation<std::is_same<ValueType, std::any>>,
+#endif
+                                                detail::is_detected_lazy<detail::get_template_function, const basic_json_t&, ValueType>
+                                                >::value, int >::type = 0 >
+                                        JSON_EXPLICIT operator ValueType() const
+    {
+        // delegate the call to get<>() const
+        return get<ValueType>();
+    }
+
+    /// @brief get a binary value
+    /// @sa https://json.nlohmann.me/api/basic_json/get_binary/
+    binary_t& get_binary()
+    {
+        if (!is_binary())
+        {
+            JSON_THROW(type_error::create(302, detail::concat("type must be binary, but is ", type_name()), this));
+        }
+
+        return *get_ptr<binary_t*>();
+    }
+
+    /// @brief get a binary value
+    /// @sa https://json.nlohmann.me/api/basic_json/get_binary/
+    const binary_t& get_binary() const
+    {
+        if (!is_binary())
+        {
+            JSON_THROW(type_error::create(302, detail::concat("type must be binary, but is ", type_name()), this));
+        }
+
+        return *get_ptr<const binary_t*>();
+    }
+
+    /// @}
+
+    ////////////////////
+    // element access //
+    ////////////////////
+
+    /// @name element access
+    /// Access to the JSON value.
+    /// @{
+
+    /// @brief access specified array element with bounds checking
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    reference at(size_type idx)
+    {
+        // at only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            JSON_TRY
+            {
+                return set_parent(m_data.m_value.array->at(idx));
+            }
+            JSON_CATCH (std::out_of_range&)
+            {
+                // create better exception explanation
+                JSON_THROW(out_of_range::create(401, detail::concat("array index ", std::to_string(idx), " is out of range"), this));
+            }
+        }
+        else
+        {
+            JSON_THROW(type_error::create(304, detail::concat("cannot use at() with ", type_name()), this));
+        }
+    }
+
+    /// @brief access specified array element with bounds checking
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    const_reference at(size_type idx) const
+    {
+        // at only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            JSON_TRY
+            {
+                return m_data.m_value.array->at(idx);
+            }
+            JSON_CATCH (std::out_of_range&)
+            {
+                // create better exception explanation
+                JSON_THROW(out_of_range::create(401, detail::concat("array index ", std::to_string(idx), " is out of range"), this));
+            }
+        }
+        else
+        {
+            JSON_THROW(type_error::create(304, detail::concat("cannot use at() with ", type_name()), this));
+        }
+    }
+
+    /// @brief access specified object element with bounds checking
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    reference at(const typename object_t::key_type& key)
+    {
+        // at only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(304, detail::concat("cannot use at() with ", type_name()), this));
+        }
+
+        auto it = m_data.m_value.object->find(key);
+        if (it == m_data.m_value.object->end())
+        {
+            JSON_THROW(out_of_range::create(403, detail::concat("key '", key, "' not found"), this));
+        }
+        return set_parent(it->second);
+    }
+
+    /// @brief access specified object element with bounds checking
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    reference at(KeyType && key)
+    {
+        // at only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(304, detail::concat("cannot use at() with ", type_name()), this));
+        }
+
+        auto it = m_data.m_value.object->find(std::forward<KeyType>(key));
+        if (it == m_data.m_value.object->end())
+        {
+            JSON_THROW(out_of_range::create(403, detail::concat("key '", string_t(std::forward<KeyType>(key)), "' not found"), this));
+        }
+        return set_parent(it->second);
+    }
+
+    /// @brief access specified object element with bounds checking
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    const_reference at(const typename object_t::key_type& key) const
+    {
+        // at only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(304, detail::concat("cannot use at() with ", type_name()), this));
+        }
+
+        auto it = m_data.m_value.object->find(key);
+        if (it == m_data.m_value.object->end())
+        {
+            JSON_THROW(out_of_range::create(403, detail::concat("key '", key, "' not found"), this));
+        }
+        return it->second;
+    }
+
+    /// @brief access specified object element with bounds checking
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    const_reference at(KeyType && key) const
+    {
+        // at only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(304, detail::concat("cannot use at() with ", type_name()), this));
+        }
+
+        auto it = m_data.m_value.object->find(std::forward<KeyType>(key));
+        if (it == m_data.m_value.object->end())
+        {
+            JSON_THROW(out_of_range::create(403, detail::concat("key '", string_t(std::forward<KeyType>(key)), "' not found"), this));
+        }
+        return it->second;
+    }
+
+    /// @brief access specified array element
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    reference operator[](size_type idx)
+    {
+        // implicitly convert null value to an empty array
+        if (is_null())
+        {
+            m_data.m_type = value_t::array;
+            m_data.m_value.array = create<array_t>();
+            assert_invariant();
+        }
+
+        // operator[] only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            // fill up array with null values if given idx is outside range
+            if (idx >= m_data.m_value.array->size())
+            {
+#if JSON_DIAGNOSTICS
+                // remember array size & capacity before resizing
+                const auto old_size = m_data.m_value.array->size();
+                const auto old_capacity = m_data.m_value.array->capacity();
+#endif
+                m_data.m_value.array->resize(idx + 1);
+
+#if JSON_DIAGNOSTICS
+                if (JSON_HEDLEY_UNLIKELY(m_data.m_value.array->capacity() != old_capacity))
+                {
+                    // capacity has changed: update all parents
+                    set_parents();
+                }
+                else
+                {
+                    // set parent for values added above
+                    set_parents(begin() + static_cast<typename iterator::difference_type>(old_size), static_cast<typename iterator::difference_type>(idx + 1 - old_size));
+                }
+#endif
+                assert_invariant();
+            }
+
+            return m_data.m_value.array->operator[](idx);
+        }
+
+        JSON_THROW(type_error::create(305, detail::concat("cannot use operator[] with a numeric argument with ", type_name()), this));
+    }
+
+    /// @brief access specified array element
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    const_reference operator[](size_type idx) const
+    {
+        // const operator[] only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            return m_data.m_value.array->operator[](idx);
+        }
+
+        JSON_THROW(type_error::create(305, detail::concat("cannot use operator[] with a numeric argument with ", type_name()), this));
+    }
+
+    /// @brief access specified object element
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    reference operator[](typename object_t::key_type key)
+    {
+        // implicitly convert null value to an empty object
+        if (is_null())
+        {
+            m_data.m_type = value_t::object;
+            m_data.m_value.object = create<object_t>();
+            assert_invariant();
+        }
+
+        // operator[] only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            auto result = m_data.m_value.object->emplace(std::move(key), nullptr);
+            return set_parent(result.first->second);
+        }
+
+        JSON_THROW(type_error::create(305, detail::concat("cannot use operator[] with a string argument with ", type_name()), this));
+    }
+
+    /// @brief access specified object element
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    const_reference operator[](const typename object_t::key_type& key) const
+    {
+        // const operator[] only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            auto it = m_data.m_value.object->find(key);
+            JSON_ASSERT(it != m_data.m_value.object->end());
+            return it->second;
+        }
+
+        JSON_THROW(type_error::create(305, detail::concat("cannot use operator[] with a string argument with ", type_name()), this));
+    }
+
+    // these two functions resolve a (const) char * ambiguity affecting Clang and MSVC
+    // (they seemingly cannot be constrained to resolve the ambiguity)
+    template<typename T>
+    reference operator[](T* key)
+    {
+        return operator[](typename object_t::key_type(key));
+    }
+
+    template<typename T>
+    const_reference operator[](T* key) const
+    {
+        return operator[](typename object_t::key_type(key));
+    }
+
+    /// @brief access specified object element
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int > = 0 >
+    reference operator[](KeyType && key)
+    {
+        // implicitly convert null value to an empty object
+        if (is_null())
+        {
+            m_data.m_type = value_t::object;
+            m_data.m_value.object = create<object_t>();
+            assert_invariant();
+        }
+
+        // operator[] only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            auto result = m_data.m_value.object->emplace(std::forward<KeyType>(key), nullptr);
+            return set_parent(result.first->second);
+        }
+
+        JSON_THROW(type_error::create(305, detail::concat("cannot use operator[] with a string argument with ", type_name()), this));
+    }
+
+    /// @brief access specified object element
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int > = 0 >
+    const_reference operator[](KeyType && key) const
+    {
+        // const operator[] only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            auto it = m_data.m_value.object->find(std::forward<KeyType>(key));
+            JSON_ASSERT(it != m_data.m_value.object->end());
+            return it->second;
+        }
+
+        JSON_THROW(type_error::create(305, detail::concat("cannot use operator[] with a string argument with ", type_name()), this));
+    }
+
+  private:
+    template<typename KeyType>
+    using is_comparable_with_object_key = detail::is_comparable <
+        object_comparator_t, const typename object_t::key_type&, KeyType >;
+
+    template<typename ValueType>
+    using value_return_type = std::conditional <
+        detail::is_c_string_uncvref<ValueType>::value,
+        string_t, typename std::decay<ValueType>::type >;
+
+  public:
+    /// @brief access specified object element with default value
+    /// @sa https://json.nlohmann.me/api/basic_json/value/
+    template < class ValueType, detail::enable_if_t <
+                   !detail::is_transparent<object_comparator_t>::value
+                   && detail::is_getable<basic_json_t, ValueType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    ValueType value(const typename object_t::key_type& key, const ValueType& default_value) const
+    {
+        // value only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            // if key is found, return value and given default value otherwise
+            const auto it = find(key);
+            if (it != end())
+            {
+                return it->template get<ValueType>();
+            }
+
+            return default_value;
+        }
+
+        JSON_THROW(type_error::create(306, detail::concat("cannot use value() with ", type_name()), this));
+    }
+
+    /// @brief access specified object element with default value
+    /// @sa https://json.nlohmann.me/api/basic_json/value/
+    template < class ValueType, class ReturnType = typename value_return_type<ValueType>::type,
+               detail::enable_if_t <
+                   !detail::is_transparent<object_comparator_t>::value
+                   && detail::is_getable<basic_json_t, ReturnType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    ReturnType value(const typename object_t::key_type& key, ValueType && default_value) const
+    {
+        // value only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            // if key is found, return value and given default value otherwise
+            const auto it = find(key);
+            if (it != end())
+            {
+                return it->template get<ReturnType>();
+            }
+
+            return std::forward<ValueType>(default_value);
+        }
+
+        JSON_THROW(type_error::create(306, detail::concat("cannot use value() with ", type_name()), this));
+    }
+
+    /// @brief access specified object element with default value
+    /// @sa https://json.nlohmann.me/api/basic_json/value/
+    template < class ValueType, class KeyType, detail::enable_if_t <
+                   detail::is_transparent<object_comparator_t>::value
+                   && !detail::is_json_pointer<KeyType>::value
+                   && is_comparable_with_object_key<KeyType>::value
+                   && detail::is_getable<basic_json_t, ValueType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    ValueType value(KeyType && key, const ValueType& default_value) const
+    {
+        // value only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            // if key is found, return value and given default value otherwise
+            const auto it = find(std::forward<KeyType>(key));
+            if (it != end())
+            {
+                return it->template get<ValueType>();
+            }
+
+            return default_value;
+        }
+
+        JSON_THROW(type_error::create(306, detail::concat("cannot use value() with ", type_name()), this));
+    }
+
+    /// @brief access specified object element via JSON Pointer with default value
+    /// @sa https://json.nlohmann.me/api/basic_json/value/
+    template < class ValueType, class KeyType, class ReturnType = typename value_return_type<ValueType>::type,
+               detail::enable_if_t <
+                   detail::is_transparent<object_comparator_t>::value
+                   && !detail::is_json_pointer<KeyType>::value
+                   && is_comparable_with_object_key<KeyType>::value
+                   && detail::is_getable<basic_json_t, ReturnType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    ReturnType value(KeyType && key, ValueType && default_value) const
+    {
+        // value only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            // if key is found, return value and given default value otherwise
+            const auto it = find(std::forward<KeyType>(key));
+            if (it != end())
+            {
+                return it->template get<ReturnType>();
+            }
+
+            return std::forward<ValueType>(default_value);
+        }
+
+        JSON_THROW(type_error::create(306, detail::concat("cannot use value() with ", type_name()), this));
+    }
+
+    /// @brief access specified object element via JSON Pointer with default value
+    /// @sa https://json.nlohmann.me/api/basic_json/value/
+    template < class ValueType, detail::enable_if_t <
+                   detail::is_getable<basic_json_t, ValueType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    ValueType value(const json_pointer& ptr, const ValueType& default_value) const
+    {
+        // value only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            // if pointer resolves a value, return it or use default value
+            JSON_TRY
+            {
+                return ptr.get_checked(this).template get<ValueType>();
+            }
+            JSON_INTERNAL_CATCH (out_of_range&)
+            {
+                return default_value;
+            }
+        }
+
+        JSON_THROW(type_error::create(306, detail::concat("cannot use value() with ", type_name()), this));
+    }
+
+    /// @brief access specified object element via JSON Pointer with default value
+    /// @sa https://json.nlohmann.me/api/basic_json/value/
+    template < class ValueType, class ReturnType = typename value_return_type<ValueType>::type,
+               detail::enable_if_t <
+                   detail::is_getable<basic_json_t, ReturnType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    ReturnType value(const json_pointer& ptr, ValueType && default_value) const
+    {
+        // value only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            // if pointer resolves a value, return it or use default value
+            JSON_TRY
+            {
+                return ptr.get_checked(this).template get<ReturnType>();
+            }
+            JSON_INTERNAL_CATCH (out_of_range&)
+            {
+                return std::forward<ValueType>(default_value);
+            }
+        }
+
+        JSON_THROW(type_error::create(306, detail::concat("cannot use value() with ", type_name()), this));
+    }
+
+    template < class ValueType, class BasicJsonType, detail::enable_if_t <
+                   detail::is_basic_json<BasicJsonType>::value
+                   && detail::is_getable<basic_json_t, ValueType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    ValueType value(const ::nlohmann::json_pointer<BasicJsonType>& ptr, const ValueType& default_value) const
+    {
+        return value(ptr.convert(), default_value);
+    }
+
+    template < class ValueType, class BasicJsonType, class ReturnType = typename value_return_type<ValueType>::type,
+               detail::enable_if_t <
+                   detail::is_basic_json<BasicJsonType>::value
+                   && detail::is_getable<basic_json_t, ReturnType>::value
+                   && !std::is_same<value_t, detail::uncvref_t<ValueType>>::value, int > = 0 >
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    ReturnType value(const ::nlohmann::json_pointer<BasicJsonType>& ptr, ValueType && default_value) const
+    {
+        return value(ptr.convert(), std::forward<ValueType>(default_value));
+    }
+
+    /// @brief access the first element
+    /// @sa https://json.nlohmann.me/api/basic_json/front/
+    reference front()
+    {
+        return *begin();
+    }
+
+    /// @brief access the first element
+    /// @sa https://json.nlohmann.me/api/basic_json/front/
+    const_reference front() const
+    {
+        return *cbegin();
+    }
+
+    /// @brief access the last element
+    /// @sa https://json.nlohmann.me/api/basic_json/back/
+    reference back()
+    {
+        auto tmp = end();
+        --tmp;
+        return *tmp;
+    }
+
+    /// @brief access the last element
+    /// @sa https://json.nlohmann.me/api/basic_json/back/
+    const_reference back() const
+    {
+        auto tmp = cend();
+        --tmp;
+        return *tmp;
+    }
+
+    /// @brief remove element given an iterator
+    /// @sa https://json.nlohmann.me/api/basic_json/erase/
+    template < class IteratorType, detail::enable_if_t <
+                   std::is_same<IteratorType, typename basic_json_t::iterator>::value ||
+                   std::is_same<IteratorType, typename basic_json_t::const_iterator>::value, int > = 0 >
+    IteratorType erase(IteratorType pos)
+    {
+        // make sure iterator fits the current value
+        if (JSON_HEDLEY_UNLIKELY(this != pos.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value", this));
+        }
+
+        IteratorType result = end();
+
+        switch (m_data.m_type)
+        {
+            case value_t::boolean:
+            case value_t::number_float:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::string:
+            case value_t::binary:
+            {
+                if (JSON_HEDLEY_UNLIKELY(!pos.m_it.primitive_iterator.is_begin()))
+                {
+                    JSON_THROW(invalid_iterator::create(205, "iterator out of range", this));
+                }
+
+                if (is_string())
+                {
+                    AllocatorType<string_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, m_data.m_value.string);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, m_data.m_value.string, 1);
+                    m_data.m_value.string = nullptr;
+                }
+                else if (is_binary())
+                {
+                    AllocatorType<binary_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, m_data.m_value.binary);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, m_data.m_value.binary, 1);
+                    m_data.m_value.binary = nullptr;
+                }
+
+                m_data.m_type = value_t::null;
+                assert_invariant();
+                break;
+            }
+
+            case value_t::object:
+            {
+                result.m_it.object_iterator = m_data.m_value.object->erase(pos.m_it.object_iterator);
+                break;
+            }
+
+            case value_t::array:
+            {
+                result.m_it.array_iterator = m_data.m_value.array->erase(pos.m_it.array_iterator);
+                break;
+            }
+
+            case value_t::null:
+            case value_t::discarded:
+            default:
+                JSON_THROW(type_error::create(307, detail::concat("cannot use erase() with ", type_name()), this));
+        }
+
+        return result;
+    }
+
+    /// @brief remove elements given an iterator range
+    /// @sa https://json.nlohmann.me/api/basic_json/erase/
+    template < class IteratorType, detail::enable_if_t <
+                   std::is_same<IteratorType, typename basic_json_t::iterator>::value ||
+                   std::is_same<IteratorType, typename basic_json_t::const_iterator>::value, int > = 0 >
+    IteratorType erase(IteratorType first, IteratorType last)
+    {
+        // make sure iterator fits the current value
+        if (JSON_HEDLEY_UNLIKELY(this != first.m_object || this != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(203, "iterators do not fit current value", this));
+        }
+
+        IteratorType result = end();
+
+        switch (m_data.m_type)
+        {
+            case value_t::boolean:
+            case value_t::number_float:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::string:
+            case value_t::binary:
+            {
+                if (JSON_HEDLEY_LIKELY(!first.m_it.primitive_iterator.is_begin()
+                                       || !last.m_it.primitive_iterator.is_end()))
+                {
+                    JSON_THROW(invalid_iterator::create(204, "iterators out of range", this));
+                }
+
+                if (is_string())
+                {
+                    AllocatorType<string_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, m_data.m_value.string);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, m_data.m_value.string, 1);
+                    m_data.m_value.string = nullptr;
+                }
+                else if (is_binary())
+                {
+                    AllocatorType<binary_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, m_data.m_value.binary);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, m_data.m_value.binary, 1);
+                    m_data.m_value.binary = nullptr;
+                }
+
+                m_data.m_type = value_t::null;
+                assert_invariant();
+                break;
+            }
+
+            case value_t::object:
+            {
+                result.m_it.object_iterator = m_data.m_value.object->erase(first.m_it.object_iterator,
+                                              last.m_it.object_iterator);
+                break;
+            }
+
+            case value_t::array:
+            {
+                result.m_it.array_iterator = m_data.m_value.array->erase(first.m_it.array_iterator,
+                                             last.m_it.array_iterator);
+                break;
+            }
+
+            case value_t::null:
+            case value_t::discarded:
+            default:
+                JSON_THROW(type_error::create(307, detail::concat("cannot use erase() with ", type_name()), this));
+        }
+
+        return result;
+    }
+
+  private:
+    template < typename KeyType, detail::enable_if_t <
+                   detail::has_erase_with_key_type<basic_json_t, KeyType>::value, int > = 0 >
+    size_type erase_internal(KeyType && key)
+    {
+        // this erase only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(307, detail::concat("cannot use erase() with ", type_name()), this));
+        }
+
+        return m_data.m_value.object->erase(std::forward<KeyType>(key));
+    }
+
+    template < typename KeyType, detail::enable_if_t <
+                   !detail::has_erase_with_key_type<basic_json_t, KeyType>::value, int > = 0 >
+    size_type erase_internal(KeyType && key)
+    {
+        // this erase only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(307, detail::concat("cannot use erase() with ", type_name()), this));
+        }
+
+        const auto it = m_data.m_value.object->find(std::forward<KeyType>(key));
+        if (it != m_data.m_value.object->end())
+        {
+            m_data.m_value.object->erase(it);
+            return 1;
+        }
+        return 0;
+    }
+
+  public:
+
+    /// @brief remove element from a JSON object given a key
+    /// @sa https://json.nlohmann.me/api/basic_json/erase/
+    size_type erase(const typename object_t::key_type& key)
+    {
+        // the indirection via erase_internal() is added to avoid making this
+        // function a template and thus de-rank it during overload resolution
+        return erase_internal(key);
+    }
+
+    /// @brief remove element from a JSON object given a key
+    /// @sa https://json.nlohmann.me/api/basic_json/erase/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    size_type erase(KeyType && key)
+    {
+        return erase_internal(std::forward<KeyType>(key));
+    }
+
+    /// @brief remove element from a JSON array given an index
+    /// @sa https://json.nlohmann.me/api/basic_json/erase/
+    void erase(const size_type idx)
+    {
+        // this erase only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            if (JSON_HEDLEY_UNLIKELY(idx >= size()))
+            {
+                JSON_THROW(out_of_range::create(401, detail::concat("array index ", std::to_string(idx), " is out of range"), this));
+            }
+
+            m_data.m_value.array->erase(m_data.m_value.array->begin() + static_cast<difference_type>(idx));
+        }
+        else
+        {
+            JSON_THROW(type_error::create(307, detail::concat("cannot use erase() with ", type_name()), this));
+        }
+    }
+
+    /// @}
+
+    ////////////
+    // lookup //
+    ////////////
+
+    /// @name lookup
+    /// @{
+
+    /// @brief find an element in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/find/
+    iterator find(const typename object_t::key_type& key)
+    {
+        auto result = end();
+
+        if (is_object())
+        {
+            result.m_it.object_iterator = m_data.m_value.object->find(key);
+        }
+
+        return result;
+    }
+
+    /// @brief find an element in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/find/
+    const_iterator find(const typename object_t::key_type& key) const
+    {
+        auto result = cend();
+
+        if (is_object())
+        {
+            result.m_it.object_iterator = m_data.m_value.object->find(key);
+        }
+
+        return result;
+    }
+
+    /// @brief find an element in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/find/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    iterator find(KeyType && key)
+    {
+        auto result = end();
+
+        if (is_object())
+        {
+            result.m_it.object_iterator = m_data.m_value.object->find(std::forward<KeyType>(key));
+        }
+
+        return result;
+    }
+
+    /// @brief find an element in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/find/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    const_iterator find(KeyType && key) const
+    {
+        auto result = cend();
+
+        if (is_object())
+        {
+            result.m_it.object_iterator = m_data.m_value.object->find(std::forward<KeyType>(key));
+        }
+
+        return result;
+    }
+
+    /// @brief returns the number of occurrences of a key in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/count/
+    size_type count(const typename object_t::key_type& key) const
+    {
+        // return 0 for all nonobject types
+        return is_object() ? m_data.m_value.object->count(key) : 0;
+    }
+
+    /// @brief returns the number of occurrences of a key in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/count/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    size_type count(KeyType && key) const
+    {
+        // return 0 for all nonobject types
+        return is_object() ? m_data.m_value.object->count(std::forward<KeyType>(key)) : 0;
+    }
+
+    /// @brief check the existence of an element in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/contains/
+    bool contains(const typename object_t::key_type& key) const
+    {
+        return is_object() && m_data.m_value.object->find(key) != m_data.m_value.object->end();
+    }
+
+    /// @brief check the existence of an element in a JSON object
+    /// @sa https://json.nlohmann.me/api/basic_json/contains/
+    template<class KeyType, detail::enable_if_t<
+                 detail::is_usable_as_basic_json_key_type<basic_json_t, KeyType>::value, int> = 0>
+    bool contains(KeyType && key) const
+    {
+        return is_object() && m_data.m_value.object->find(std::forward<KeyType>(key)) != m_data.m_value.object->end();
+    }
+
+    /// @brief check the existence of an element in a JSON object given a JSON pointer
+    /// @sa https://json.nlohmann.me/api/basic_json/contains/
+    bool contains(const json_pointer& ptr) const
+    {
+        return ptr.contains(this);
+    }
+
+    template<typename BasicJsonType, detail::enable_if_t<detail::is_basic_json<BasicJsonType>::value, int> = 0>
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    bool contains(const typename ::nlohmann::json_pointer<BasicJsonType>& ptr) const
+    {
+        return ptr.contains(this);
+    }
+
+    /// @}
+
+    ///////////////
+    // iterators //
+    ///////////////
+
+    /// @name iterators
+    /// @{
+
+    /// @brief returns an iterator to the first element
+    /// @sa https://json.nlohmann.me/api/basic_json/begin/
+    iterator begin() noexcept
+    {
+        iterator result(this);
+        result.set_begin();
+        return result;
+    }
+
+    /// @brief returns an iterator to the first element
+    /// @sa https://json.nlohmann.me/api/basic_json/begin/
+    const_iterator begin() const noexcept
+    {
+        return cbegin();
+    }
+
+    /// @brief returns a const iterator to the first element
+    /// @sa https://json.nlohmann.me/api/basic_json/cbegin/
+    const_iterator cbegin() const noexcept
+    {
+        const_iterator result(this);
+        result.set_begin();
+        return result;
+    }
+
+    /// @brief returns an iterator to one past the last element
+    /// @sa https://json.nlohmann.me/api/basic_json/end/
+    iterator end() noexcept
+    {
+        iterator result(this);
+        result.set_end();
+        return result;
+    }
+
+    /// @brief returns an iterator to one past the last element
+    /// @sa https://json.nlohmann.me/api/basic_json/end/
+    const_iterator end() const noexcept
+    {
+        return cend();
+    }
+
+    /// @brief returns an iterator to one past the last element
+    /// @sa https://json.nlohmann.me/api/basic_json/cend/
+    const_iterator cend() const noexcept
+    {
+        const_iterator result(this);
+        result.set_end();
+        return result;
+    }
+
+    /// @brief returns an iterator to the reverse-beginning
+    /// @sa https://json.nlohmann.me/api/basic_json/rbegin/
+    reverse_iterator rbegin() noexcept
+    {
+        return reverse_iterator(end());
+    }
+
+    /// @brief returns an iterator to the reverse-beginning
+    /// @sa https://json.nlohmann.me/api/basic_json/rbegin/
+    const_reverse_iterator rbegin() const noexcept
+    {
+        return crbegin();
+    }
+
+    /// @brief returns an iterator to the reverse-end
+    /// @sa https://json.nlohmann.me/api/basic_json/rend/
+    reverse_iterator rend() noexcept
+    {
+        return reverse_iterator(begin());
+    }
+
+    /// @brief returns an iterator to the reverse-end
+    /// @sa https://json.nlohmann.me/api/basic_json/rend/
+    const_reverse_iterator rend() const noexcept
+    {
+        return crend();
+    }
+
+    /// @brief returns a const reverse iterator to the last element
+    /// @sa https://json.nlohmann.me/api/basic_json/crbegin/
+    const_reverse_iterator crbegin() const noexcept
+    {
+        return const_reverse_iterator(cend());
+    }
+
+    /// @brief returns a const reverse iterator to one before the first
+    /// @sa https://json.nlohmann.me/api/basic_json/crend/
+    const_reverse_iterator crend() const noexcept
+    {
+        return const_reverse_iterator(cbegin());
+    }
+
+  public:
+    /// @brief wrapper to access iterator member functions in range-based for
+    /// @sa https://json.nlohmann.me/api/basic_json/items/
+    /// @deprecated This function is deprecated since 3.1.0 and will be removed in
+    ///             version 4.0.0 of the library. Please use @ref items() instead;
+    ///             that is, replace `json::iterator_wrapper(j)` with `j.items()`.
+    JSON_HEDLEY_DEPRECATED_FOR(3.1.0, items())
+    static iteration_proxy<iterator> iterator_wrapper(reference ref) noexcept
+    {
+        return ref.items();
+    }
+
+    /// @brief wrapper to access iterator member functions in range-based for
+    /// @sa https://json.nlohmann.me/api/basic_json/items/
+    /// @deprecated This function is deprecated since 3.1.0 and will be removed in
+    ///         version 4.0.0 of the library. Please use @ref items() instead;
+    ///         that is, replace `json::iterator_wrapper(j)` with `j.items()`.
+    JSON_HEDLEY_DEPRECATED_FOR(3.1.0, items())
+    static iteration_proxy<const_iterator> iterator_wrapper(const_reference ref) noexcept
+    {
+        return ref.items();
+    }
+
+    /// @brief helper to access iterator member functions in range-based for
+    /// @sa https://json.nlohmann.me/api/basic_json/items/
+    iteration_proxy<iterator> items() noexcept
+    {
+        return iteration_proxy<iterator>(*this);
+    }
+
+    /// @brief helper to access iterator member functions in range-based for
+    /// @sa https://json.nlohmann.me/api/basic_json/items/
+    iteration_proxy<const_iterator> items() const noexcept
+    {
+        return iteration_proxy<const_iterator>(*this);
+    }
+
+    /// @}
+
+    //////////////
+    // capacity //
+    //////////////
+
+    /// @name capacity
+    /// @{
+
+    /// @brief checks whether the container is empty.
+    /// @sa https://json.nlohmann.me/api/basic_json/empty/
+    bool empty() const noexcept
+    {
+        switch (m_data.m_type)
+        {
+            case value_t::null:
+            {
+                // null values are empty
+                return true;
+            }
+
+            case value_t::array:
+            {
+                // delegate call to array_t::empty()
+                return m_data.m_value.array->empty();
+            }
+
+            case value_t::object:
+            {
+                // delegate call to object_t::empty()
+                return m_data.m_value.object->empty();
+            }
+
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                // all other types are nonempty
+                return false;
+            }
+        }
+    }
+
+    /// @brief returns the number of elements
+    /// @sa https://json.nlohmann.me/api/basic_json/size/
+    size_type size() const noexcept
+    {
+        switch (m_data.m_type)
+        {
+            case value_t::null:
+            {
+                // null values are empty
+                return 0;
+            }
+
+            case value_t::array:
+            {
+                // delegate call to array_t::size()
+                return m_data.m_value.array->size();
+            }
+
+            case value_t::object:
+            {
+                // delegate call to object_t::size()
+                return m_data.m_value.object->size();
+            }
+
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                // all other types have size 1
+                return 1;
+            }
+        }
+    }
+
+    /// @brief returns the maximum possible number of elements
+    /// @sa https://json.nlohmann.me/api/basic_json/max_size/
+    size_type max_size() const noexcept
+    {
+        switch (m_data.m_type)
+        {
+            case value_t::array:
+            {
+                // delegate call to array_t::max_size()
+                return m_data.m_value.array->max_size();
+            }
+
+            case value_t::object:
+            {
+                // delegate call to object_t::max_size()
+                return m_data.m_value.object->max_size();
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                // all other types have max_size() == size()
+                return size();
+            }
+        }
+    }
+
+    /// @}
+
+    ///////////////
+    // modifiers //
+    ///////////////
+
+    /// @name modifiers
+    /// @{
+
+    /// @brief clears the contents
+    /// @sa https://json.nlohmann.me/api/basic_json/clear/
+    void clear() noexcept
+    {
+        switch (m_data.m_type)
+        {
+            case value_t::number_integer:
+            {
+                m_data.m_value.number_integer = 0;
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                m_data.m_value.number_unsigned = 0;
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                m_data.m_value.number_float = 0.0;
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                m_data.m_value.boolean = false;
+                break;
+            }
+
+            case value_t::string:
+            {
+                m_data.m_value.string->clear();
+                break;
+            }
+
+            case value_t::binary:
+            {
+                m_data.m_value.binary->clear();
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_data.m_value.array->clear();
+                break;
+            }
+
+            case value_t::object:
+            {
+                m_data.m_value.object->clear();
+                break;
+            }
+
+            case value_t::null:
+            case value_t::discarded:
+            default:
+                break;
+        }
+    }
+
+    /// @brief add an object to an array
+    /// @sa https://json.nlohmann.me/api/basic_json/push_back/
+    void push_back(basic_json&& val)
+    {
+        // push_back only works for null objects or arrays
+        if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_array())))
+        {
+            JSON_THROW(type_error::create(308, detail::concat("cannot use push_back() with ", type_name()), this));
+        }
+
+        // transform null object into an array
+        if (is_null())
+        {
+            m_data.m_type = value_t::array;
+            m_data.m_value = value_t::array;
+            assert_invariant();
+        }
+
+        // add element to array (move semantics)
+        const auto old_capacity = m_data.m_value.array->capacity();
+        m_data.m_value.array->push_back(std::move(val));
+        set_parent(m_data.m_value.array->back(), old_capacity);
+        // if val is moved from, basic_json move constructor marks it null, so we do not call the destructor
+    }
+
+    /// @brief add an object to an array
+    /// @sa https://json.nlohmann.me/api/basic_json/operator+=/
+    reference operator+=(basic_json&& val)
+    {
+        push_back(std::move(val));
+        return *this;
+    }
+
+    /// @brief add an object to an array
+    /// @sa https://json.nlohmann.me/api/basic_json/push_back/
+    void push_back(const basic_json& val)
+    {
+        // push_back only works for null objects or arrays
+        if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_array())))
+        {
+            JSON_THROW(type_error::create(308, detail::concat("cannot use push_back() with ", type_name()), this));
+        }
+
+        // transform null object into an array
+        if (is_null())
+        {
+            m_data.m_type = value_t::array;
+            m_data.m_value = value_t::array;
+            assert_invariant();
+        }
+
+        // add element to array
+        const auto old_capacity = m_data.m_value.array->capacity();
+        m_data.m_value.array->push_back(val);
+        set_parent(m_data.m_value.array->back(), old_capacity);
+    }
+
+    /// @brief add an object to an array
+    /// @sa https://json.nlohmann.me/api/basic_json/operator+=/
+    reference operator+=(const basic_json& val)
+    {
+        push_back(val);
+        return *this;
+    }
+
+    /// @brief add an object to an object
+    /// @sa https://json.nlohmann.me/api/basic_json/push_back/
+    void push_back(const typename object_t::value_type& val)
+    {
+        // push_back only works for null objects or objects
+        if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_object())))
+        {
+            JSON_THROW(type_error::create(308, detail::concat("cannot use push_back() with ", type_name()), this));
+        }
+
+        // transform null object into an object
+        if (is_null())
+        {
+            m_data.m_type = value_t::object;
+            m_data.m_value = value_t::object;
+            assert_invariant();
+        }
+
+        // add element to object
+        auto res = m_data.m_value.object->insert(val);
+        set_parent(res.first->second);
+    }
+
+    /// @brief add an object to an object
+    /// @sa https://json.nlohmann.me/api/basic_json/operator+=/
+    reference operator+=(const typename object_t::value_type& val)
+    {
+        push_back(val);
+        return *this;
+    }
+
+    /// @brief add an object to an object
+    /// @sa https://json.nlohmann.me/api/basic_json/push_back/
+    void push_back(initializer_list_t init)
+    {
+        if (is_object() && init.size() == 2 && (*init.begin())->is_string())
+        {
+            basic_json&& key = init.begin()->moved_or_copied();
+            push_back(typename object_t::value_type(
+                          std::move(key.get_ref<string_t&>()), (init.begin() + 1)->moved_or_copied()));
+        }
+        else
+        {
+            push_back(basic_json(init));
+        }
+    }
+
+    /// @brief add an object to an object
+    /// @sa https://json.nlohmann.me/api/basic_json/operator+=/
+    reference operator+=(initializer_list_t init)
+    {
+        push_back(init);
+        return *this;
+    }
+
+    /// @brief add an object to an array
+    /// @sa https://json.nlohmann.me/api/basic_json/emplace_back/
+    template<class... Args>
+    reference emplace_back(Args&& ... args)
+    {
+        // emplace_back only works for null objects or arrays
+        if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_array())))
+        {
+            JSON_THROW(type_error::create(311, detail::concat("cannot use emplace_back() with ", type_name()), this));
+        }
+
+        // transform null object into an array
+        if (is_null())
+        {
+            m_data.m_type = value_t::array;
+            m_data.m_value = value_t::array;
+            assert_invariant();
+        }
+
+        // add element to array (perfect forwarding)
+        const auto old_capacity = m_data.m_value.array->capacity();
+        m_data.m_value.array->emplace_back(std::forward<Args>(args)...);
+        return set_parent(m_data.m_value.array->back(), old_capacity);
+    }
+
+    /// @brief add an object to an object if key does not exist
+    /// @sa https://json.nlohmann.me/api/basic_json/emplace/
+    template<class... Args>
+    std::pair<iterator, bool> emplace(Args&& ... args)
+    {
+        // emplace only works for null objects or arrays
+        if (JSON_HEDLEY_UNLIKELY(!(is_null() || is_object())))
+        {
+            JSON_THROW(type_error::create(311, detail::concat("cannot use emplace() with ", type_name()), this));
+        }
+
+        // transform null object into an object
+        if (is_null())
+        {
+            m_data.m_type = value_t::object;
+            m_data.m_value = value_t::object;
+            assert_invariant();
+        }
+
+        // add element to array (perfect forwarding)
+        auto res = m_data.m_value.object->emplace(std::forward<Args>(args)...);
+        set_parent(res.first->second);
+
+        // create result iterator and set iterator to the result of emplace
+        auto it = begin();
+        it.m_it.object_iterator = res.first;
+
+        // return pair of iterator and boolean
+        return {it, res.second};
+    }
+
+    /// Helper for insertion of an iterator
+    /// @note: This uses std::distance to support GCC 4.8,
+    ///        see https://github.com/nlohmann/json/pull/1257
+    template<typename... Args>
+    iterator insert_iterator(const_iterator pos, Args&& ... args)
+    {
+        iterator result(this);
+        JSON_ASSERT(m_data.m_value.array != nullptr);
+
+        auto insert_pos = std::distance(m_data.m_value.array->begin(), pos.m_it.array_iterator);
+        m_data.m_value.array->insert(pos.m_it.array_iterator, std::forward<Args>(args)...);
+        result.m_it.array_iterator = m_data.m_value.array->begin() + insert_pos;
+
+        // This could have been written as:
+        // result.m_it.array_iterator = m_data.m_value.array->insert(pos.m_it.array_iterator, cnt, val);
+        // but the return value of insert is missing in GCC 4.8, so it is written this way instead.
+
+        set_parents();
+        return result;
+    }
+
+    /// @brief inserts element into array
+    /// @sa https://json.nlohmann.me/api/basic_json/insert/
+    iterator insert(const_iterator pos, const basic_json& val)
+    {
+        // insert only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            // check if iterator pos fits to this JSON value
+            if (JSON_HEDLEY_UNLIKELY(pos.m_object != this))
+            {
+                JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value", this));
+            }
+
+            // insert to array and return iterator
+            return insert_iterator(pos, val);
+        }
+
+        JSON_THROW(type_error::create(309, detail::concat("cannot use insert() with ", type_name()), this));
+    }
+
+    /// @brief inserts element into array
+    /// @sa https://json.nlohmann.me/api/basic_json/insert/
+    iterator insert(const_iterator pos, basic_json&& val)
+    {
+        return insert(pos, val);
+    }
+
+    /// @brief inserts copies of element into array
+    /// @sa https://json.nlohmann.me/api/basic_json/insert/
+    iterator insert(const_iterator pos, size_type cnt, const basic_json& val)
+    {
+        // insert only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            // check if iterator pos fits to this JSON value
+            if (JSON_HEDLEY_UNLIKELY(pos.m_object != this))
+            {
+                JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value", this));
+            }
+
+            // insert to array and return iterator
+            return insert_iterator(pos, cnt, val);
+        }
+
+        JSON_THROW(type_error::create(309, detail::concat("cannot use insert() with ", type_name()), this));
+    }
+
+    /// @brief inserts range of elements into array
+    /// @sa https://json.nlohmann.me/api/basic_json/insert/
+    iterator insert(const_iterator pos, const_iterator first, const_iterator last)
+    {
+        // insert only works for arrays
+        if (JSON_HEDLEY_UNLIKELY(!is_array()))
+        {
+            JSON_THROW(type_error::create(309, detail::concat("cannot use insert() with ", type_name()), this));
+        }
+
+        // check if iterator pos fits to this JSON value
+        if (JSON_HEDLEY_UNLIKELY(pos.m_object != this))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value", this));
+        }
+
+        // check if range iterators belong to the same JSON object
+        if (JSON_HEDLEY_UNLIKELY(first.m_object != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(210, "iterators do not fit", this));
+        }
+
+        if (JSON_HEDLEY_UNLIKELY(first.m_object == this))
+        {
+            JSON_THROW(invalid_iterator::create(211, "passed iterators may not belong to container", this));
+        }
+
+        // insert to array and return iterator
+        return insert_iterator(pos, first.m_it.array_iterator, last.m_it.array_iterator);
+    }
+
+    /// @brief inserts elements from initializer list into array
+    /// @sa https://json.nlohmann.me/api/basic_json/insert/
+    iterator insert(const_iterator pos, initializer_list_t ilist)
+    {
+        // insert only works for arrays
+        if (JSON_HEDLEY_UNLIKELY(!is_array()))
+        {
+            JSON_THROW(type_error::create(309, detail::concat("cannot use insert() with ", type_name()), this));
+        }
+
+        // check if iterator pos fits to this JSON value
+        if (JSON_HEDLEY_UNLIKELY(pos.m_object != this))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value", this));
+        }
+
+        // insert to array and return iterator
+        return insert_iterator(pos, ilist.begin(), ilist.end());
+    }
+
+    /// @brief inserts range of elements into object
+    /// @sa https://json.nlohmann.me/api/basic_json/insert/
+    void insert(const_iterator first, const_iterator last)
+    {
+        // insert only works for objects
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(309, detail::concat("cannot use insert() with ", type_name()), this));
+        }
+
+        // check if range iterators belong to the same JSON object
+        if (JSON_HEDLEY_UNLIKELY(first.m_object != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(210, "iterators do not fit", this));
+        }
+
+        // passed iterators must belong to objects
+        if (JSON_HEDLEY_UNLIKELY(!first.m_object->is_object()))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterators first and last must point to objects", this));
+        }
+
+        m_data.m_value.object->insert(first.m_it.object_iterator, last.m_it.object_iterator);
+    }
+
+    /// @brief updates a JSON object from another object, overwriting existing keys
+    /// @sa https://json.nlohmann.me/api/basic_json/update/
+    void update(const_reference j, bool merge_objects = false)
+    {
+        update(j.begin(), j.end(), merge_objects);
+    }
+
+    /// @brief updates a JSON object from another object, overwriting existing keys
+    /// @sa https://json.nlohmann.me/api/basic_json/update/
+    void update(const_iterator first, const_iterator last, bool merge_objects = false)
+    {
+        // implicitly convert null value to an empty object
+        if (is_null())
+        {
+            m_data.m_type = value_t::object;
+            m_data.m_value.object = create<object_t>();
+            assert_invariant();
+        }
+
+        if (JSON_HEDLEY_UNLIKELY(!is_object()))
+        {
+            JSON_THROW(type_error::create(312, detail::concat("cannot use update() with ", type_name()), this));
+        }
+
+        // check if range iterators belong to the same JSON object
+        if (JSON_HEDLEY_UNLIKELY(first.m_object != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(210, "iterators do not fit", this));
+        }
+
+        // passed iterators must belong to objects
+        if (JSON_HEDLEY_UNLIKELY(!first.m_object->is_object()))
+        {
+            JSON_THROW(type_error::create(312, detail::concat("cannot use update() with ", first.m_object->type_name()), first.m_object));
+        }
+
+        for (auto it = first; it != last; ++it)
+        {
+            if (merge_objects && it.value().is_object())
+            {
+                auto it2 = m_data.m_value.object->find(it.key());
+                if (it2 != m_data.m_value.object->end())
+                {
+                    it2->second.update(it.value(), true);
+                    continue;
+                }
+            }
+            m_data.m_value.object->operator[](it.key()) = it.value();
+#if JSON_DIAGNOSTICS
+            m_data.m_value.object->operator[](it.key()).m_parent = this;
+#endif
+        }
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    void swap(reference other) noexcept (
+        std::is_nothrow_move_constructible<value_t>::value&&
+        std::is_nothrow_move_assignable<value_t>::value&&
+        std::is_nothrow_move_constructible<json_value>::value&& // NOLINT(cppcoreguidelines-noexcept-swap,performance-noexcept-swap)
+        std::is_nothrow_move_assignable<json_value>::value
+    )
+    {
+        std::swap(m_data.m_type, other.m_data.m_type);
+        std::swap(m_data.m_value, other.m_data.m_value);
+
+        set_parents();
+        other.set_parents();
+        assert_invariant();
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    friend void swap(reference left, reference right) noexcept (
+        std::is_nothrow_move_constructible<value_t>::value&&
+        std::is_nothrow_move_assignable<value_t>::value&&
+        std::is_nothrow_move_constructible<json_value>::value&& // NOLINT(cppcoreguidelines-noexcept-swap,performance-noexcept-swap)
+        std::is_nothrow_move_assignable<json_value>::value
+    )
+    {
+        left.swap(right);
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    void swap(array_t& other) // NOLINT(bugprone-exception-escape,cppcoreguidelines-noexcept-swap,performance-noexcept-swap)
+    {
+        // swap only works for arrays
+        if (JSON_HEDLEY_LIKELY(is_array()))
+        {
+            using std::swap;
+            swap(*(m_data.m_value.array), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, detail::concat("cannot use swap(array_t&) with ", type_name()), this));
+        }
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    void swap(object_t& other) // NOLINT(bugprone-exception-escape,cppcoreguidelines-noexcept-swap,performance-noexcept-swap)
+    {
+        // swap only works for objects
+        if (JSON_HEDLEY_LIKELY(is_object()))
+        {
+            using std::swap;
+            swap(*(m_data.m_value.object), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, detail::concat("cannot use swap(object_t&) with ", type_name()), this));
+        }
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    void swap(string_t& other) // NOLINT(bugprone-exception-escape,cppcoreguidelines-noexcept-swap,performance-noexcept-swap)
+    {
+        // swap only works for strings
+        if (JSON_HEDLEY_LIKELY(is_string()))
+        {
+            using std::swap;
+            swap(*(m_data.m_value.string), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, detail::concat("cannot use swap(string_t&) with ", type_name()), this));
+        }
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    void swap(binary_t& other) // NOLINT(bugprone-exception-escape,cppcoreguidelines-noexcept-swap,performance-noexcept-swap)
+    {
+        // swap only works for strings
+        if (JSON_HEDLEY_LIKELY(is_binary()))
+        {
+            using std::swap;
+            swap(*(m_data.m_value.binary), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, detail::concat("cannot use swap(binary_t&) with ", type_name()), this));
+        }
+    }
+
+    /// @brief exchanges the values
+    /// @sa https://json.nlohmann.me/api/basic_json/swap/
+    void swap(typename binary_t::container_type& other) // NOLINT(bugprone-exception-escape)
+    {
+        // swap only works for strings
+        if (JSON_HEDLEY_LIKELY(is_binary()))
+        {
+            using std::swap;
+            swap(*(m_data.m_value.binary), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, detail::concat("cannot use swap(binary_t::container_type&) with ", type_name()), this));
+        }
+    }
+
+    /// @}
+
+    //////////////////////////////////////////
+    // lexicographical comparison operators //
+    //////////////////////////////////////////
+
+    /// @name lexicographical comparison operators
+    /// @{
+
+    // note parentheses around operands are necessary; see
+    // https://github.com/nlohmann/json/issues/1530
+#define JSON_IMPLEMENT_OPERATOR(op, null_result, unordered_result, default_result)                       \
+    const auto lhs_type = lhs.type();                                                                    \
+    const auto rhs_type = rhs.type();                                                                    \
+    \
+    if (lhs_type == rhs_type) /* NOLINT(readability/braces) */                                           \
+    {                                                                                                    \
+        switch (lhs_type)                                                                                \
+        {                                                                                                \
+            case value_t::array:                                                                         \
+                return (*lhs.m_data.m_value.array) op (*rhs.m_data.m_value.array);                                     \
+                \
+            case value_t::object:                                                                        \
+                return (*lhs.m_data.m_value.object) op (*rhs.m_data.m_value.object);                                   \
+                \
+            case value_t::null:                                                                          \
+                return (null_result);                                                                    \
+                \
+            case value_t::string:                                                                        \
+                return (*lhs.m_data.m_value.string) op (*rhs.m_data.m_value.string);                                   \
+                \
+            case value_t::boolean:                                                                       \
+                return (lhs.m_data.m_value.boolean) op (rhs.m_data.m_value.boolean);                                   \
+                \
+            case value_t::number_integer:                                                                \
+                return (lhs.m_data.m_value.number_integer) op (rhs.m_data.m_value.number_integer);                     \
+                \
+            case value_t::number_unsigned:                                                               \
+                return (lhs.m_data.m_value.number_unsigned) op (rhs.m_data.m_value.number_unsigned);                   \
+                \
+            case value_t::number_float:                                                                  \
+                return (lhs.m_data.m_value.number_float) op (rhs.m_data.m_value.number_float);                         \
+                \
+            case value_t::binary:                                                                        \
+                return (*lhs.m_data.m_value.binary) op (*rhs.m_data.m_value.binary);                                   \
+                \
+            case value_t::discarded:                                                                     \
+            default:                                                                                     \
+                return (unordered_result);                                                               \
+        }                                                                                                \
+    }                                                                                                    \
+    else if (lhs_type == value_t::number_integer && rhs_type == value_t::number_float)                   \
+    {                                                                                                    \
+        return static_cast<number_float_t>(lhs.m_data.m_value.number_integer) op rhs.m_data.m_value.number_float;      \
+    }                                                                                                    \
+    else if (lhs_type == value_t::number_float && rhs_type == value_t::number_integer)                   \
+    {                                                                                                    \
+        return lhs.m_data.m_value.number_float op static_cast<number_float_t>(rhs.m_data.m_value.number_integer);      \
+    }                                                                                                    \
+    else if (lhs_type == value_t::number_unsigned && rhs_type == value_t::number_float)                  \
+    {                                                                                                    \
+        return static_cast<number_float_t>(lhs.m_data.m_value.number_unsigned) op rhs.m_data.m_value.number_float;     \
+    }                                                                                                    \
+    else if (lhs_type == value_t::number_float && rhs_type == value_t::number_unsigned)                  \
+    {                                                                                                    \
+        return lhs.m_data.m_value.number_float op static_cast<number_float_t>(rhs.m_data.m_value.number_unsigned);     \
+    }                                                                                                    \
+    else if (lhs_type == value_t::number_unsigned && rhs_type == value_t::number_integer)                \
+    {                                                                                                    \
+        return static_cast<number_integer_t>(lhs.m_data.m_value.number_unsigned) op rhs.m_data.m_value.number_integer; \
+    }                                                                                                    \
+    else if (lhs_type == value_t::number_integer && rhs_type == value_t::number_unsigned)                \
+    {                                                                                                    \
+        return lhs.m_data.m_value.number_integer op static_cast<number_integer_t>(rhs.m_data.m_value.number_unsigned); \
+    }                                                                                                    \
+    else if(compares_unordered(lhs, rhs))\
+    {\
+        return (unordered_result);\
+    }\
+    \
+    return (default_result);
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    // returns true if:
+    // - any operand is NaN and the other operand is of number type
+    // - any operand is discarded
+    // in legacy mode, discarded values are considered ordered if
+    // an operation is computed as an odd number of inverses of others
+    static bool compares_unordered(const_reference lhs, const_reference rhs, bool inverse = false) noexcept
+    {
+        if ((lhs.is_number_float() && std::isnan(lhs.m_data.m_value.number_float) && rhs.is_number())
+                || (rhs.is_number_float() && std::isnan(rhs.m_data.m_value.number_float) && lhs.is_number()))
+        {
+            return true;
+        }
+#if JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON
+        return (lhs.is_discarded() || rhs.is_discarded()) && !inverse;
+#else
+        static_cast<void>(inverse);
+        return lhs.is_discarded() || rhs.is_discarded();
+#endif
+    }
+
+  private:
+    bool compares_unordered(const_reference rhs, bool inverse = false) const noexcept
+    {
+        return compares_unordered(*this, rhs, inverse);
+    }
+
+  public:
+#if JSON_HAS_THREE_WAY_COMPARISON
+    /// @brief comparison: equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_eq/
+    bool operator==(const_reference rhs) const noexcept
+    {
+#ifdef __GNUC__
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wfloat-equal"
+#endif
+        const_reference lhs = *this;
+        JSON_IMPLEMENT_OPERATOR( ==, true, false, false)
+#ifdef __GNUC__
+#pragma GCC diagnostic pop
+#endif
+    }
+
+    /// @brief comparison: equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_eq/
+    template<typename ScalarType>
+    requires std::is_scalar_v<ScalarType>
+    bool operator==(ScalarType rhs) const noexcept
+    {
+        return *this == basic_json(rhs);
+    }
+
+    /// @brief comparison: not equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ne/
+    bool operator!=(const_reference rhs) const noexcept
+    {
+        if (compares_unordered(rhs, true))
+        {
+            return false;
+        }
+        return !operator==(rhs);
+    }
+
+    /// @brief comparison: 3-way
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_spaceship/
+    std::partial_ordering operator<=>(const_reference rhs) const noexcept // *NOPAD*
+    {
+        const_reference lhs = *this;
+        // default_result is used if we cannot compare values. In that case,
+        // we compare types.
+        JSON_IMPLEMENT_OPERATOR(<=>, // *NOPAD*
+                                std::partial_ordering::equivalent,
+                                std::partial_ordering::unordered,
+                                lhs_type <=> rhs_type) // *NOPAD*
+    }
+
+    /// @brief comparison: 3-way
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_spaceship/
+    template<typename ScalarType>
+    requires std::is_scalar_v<ScalarType>
+    std::partial_ordering operator<=>(ScalarType rhs) const noexcept // *NOPAD*
+    {
+        return *this <=> basic_json(rhs); // *NOPAD*
+    }
+
+#if JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON
+    // all operators that are computed as an odd number of inverses of others
+    // need to be overloaded to emulate the legacy comparison behavior
+
+    /// @brief comparison: less than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_le/
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, undef JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON)
+    bool operator<=(const_reference rhs) const noexcept
+    {
+        if (compares_unordered(rhs, true))
+        {
+            return false;
+        }
+        return !(rhs < *this);
+    }
+
+    /// @brief comparison: less than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_le/
+    template<typename ScalarType>
+    requires std::is_scalar_v<ScalarType>
+    bool operator<=(ScalarType rhs) const noexcept
+    {
+        return *this <= basic_json(rhs);
+    }
+
+    /// @brief comparison: greater than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ge/
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, undef JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON)
+    bool operator>=(const_reference rhs) const noexcept
+    {
+        if (compares_unordered(rhs, true))
+        {
+            return false;
+        }
+        return !(*this < rhs);
+    }
+
+    /// @brief comparison: greater than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ge/
+    template<typename ScalarType>
+    requires std::is_scalar_v<ScalarType>
+    bool operator>=(ScalarType rhs) const noexcept
+    {
+        return *this >= basic_json(rhs);
+    }
+#endif
+#else
+    /// @brief comparison: equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_eq/
+    friend bool operator==(const_reference lhs, const_reference rhs) noexcept
+    {
+#ifdef __GNUC__
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wfloat-equal"
+#endif
+        JSON_IMPLEMENT_OPERATOR( ==, true, false, false)
+#ifdef __GNUC__
+#pragma GCC diagnostic pop
+#endif
+    }
+
+    /// @brief comparison: equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_eq/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator==(const_reference lhs, ScalarType rhs) noexcept
+    {
+        return lhs == basic_json(rhs);
+    }
+
+    /// @brief comparison: equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_eq/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator==(ScalarType lhs, const_reference rhs) noexcept
+    {
+        return basic_json(lhs) == rhs;
+    }
+
+    /// @brief comparison: not equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ne/
+    friend bool operator!=(const_reference lhs, const_reference rhs) noexcept
+    {
+        if (compares_unordered(lhs, rhs, true))
+        {
+            return false;
+        }
+        return !(lhs == rhs);
+    }
+
+    /// @brief comparison: not equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ne/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator!=(const_reference lhs, ScalarType rhs) noexcept
+    {
+        return lhs != basic_json(rhs);
+    }
+
+    /// @brief comparison: not equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ne/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator!=(ScalarType lhs, const_reference rhs) noexcept
+    {
+        return basic_json(lhs) != rhs;
+    }
+
+    /// @brief comparison: less than
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_lt/
+    friend bool operator<(const_reference lhs, const_reference rhs) noexcept
+    {
+        // default_result is used if we cannot compare values. In that case,
+        // we compare types. Note we have to call the operator explicitly,
+        // because MSVC has problems otherwise.
+        JSON_IMPLEMENT_OPERATOR( <, false, false, operator<(lhs_type, rhs_type))
+    }
+
+    /// @brief comparison: less than
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_lt/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator<(const_reference lhs, ScalarType rhs) noexcept
+    {
+        return lhs < basic_json(rhs);
+    }
+
+    /// @brief comparison: less than
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_lt/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator<(ScalarType lhs, const_reference rhs) noexcept
+    {
+        return basic_json(lhs) < rhs;
+    }
+
+    /// @brief comparison: less than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_le/
+    friend bool operator<=(const_reference lhs, const_reference rhs) noexcept
+    {
+        if (compares_unordered(lhs, rhs, true))
+        {
+            return false;
+        }
+        return !(rhs < lhs);
+    }
+
+    /// @brief comparison: less than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_le/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator<=(const_reference lhs, ScalarType rhs) noexcept
+    {
+        return lhs <= basic_json(rhs);
+    }
+
+    /// @brief comparison: less than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_le/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator<=(ScalarType lhs, const_reference rhs) noexcept
+    {
+        return basic_json(lhs) <= rhs;
+    }
+
+    /// @brief comparison: greater than
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_gt/
+    friend bool operator>(const_reference lhs, const_reference rhs) noexcept
+    {
+        // double inverse
+        if (compares_unordered(lhs, rhs))
+        {
+            return false;
+        }
+        return !(lhs <= rhs);
+    }
+
+    /// @brief comparison: greater than
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_gt/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator>(const_reference lhs, ScalarType rhs) noexcept
+    {
+        return lhs > basic_json(rhs);
+    }
+
+    /// @brief comparison: greater than
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_gt/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator>(ScalarType lhs, const_reference rhs) noexcept
+    {
+        return basic_json(lhs) > rhs;
+    }
+
+    /// @brief comparison: greater than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ge/
+    friend bool operator>=(const_reference lhs, const_reference rhs) noexcept
+    {
+        if (compares_unordered(lhs, rhs, true))
+        {
+            return false;
+        }
+        return !(lhs < rhs);
+    }
+
+    /// @brief comparison: greater than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ge/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator>=(const_reference lhs, ScalarType rhs) noexcept
+    {
+        return lhs >= basic_json(rhs);
+    }
+
+    /// @brief comparison: greater than or equal
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ge/
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator>=(ScalarType lhs, const_reference rhs) noexcept
+    {
+        return basic_json(lhs) >= rhs;
+    }
+#endif
+
+#undef JSON_IMPLEMENT_OPERATOR
+
+    /// @}
+
+    ///////////////////
+    // serialization //
+    ///////////////////
+
+    /// @name serialization
+    /// @{
+#ifndef JSON_NO_IO
+    /// @brief serialize to stream
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ltlt/
+    friend std::ostream& operator<<(std::ostream& o, const basic_json& j)
+    {
+        // read width member and use it as indentation parameter if nonzero
+        const bool pretty_print = o.width() > 0;
+        const auto indentation = pretty_print ? o.width() : 0;
+
+        // reset width to 0 for subsequent calls to this stream
+        o.width(0);
+
+        // do the actual serialization
+        serializer s(detail::output_adapter<char>(o), o.fill());
+        s.dump(j, pretty_print, false, static_cast<unsigned int>(indentation));
+        return o;
+    }
+
+    /// @brief serialize to stream
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_ltlt/
+    /// @deprecated This function is deprecated since 3.0.0 and will be removed in
+    ///             version 4.0.0 of the library. Please use
+    ///             operator<<(std::ostream&, const basic_json&) instead; that is,
+    ///             replace calls like `j >> o;` with `o << j;`.
+    JSON_HEDLEY_DEPRECATED_FOR(3.0.0, operator<<(std::ostream&, const basic_json&))
+    friend std::ostream& operator>>(const basic_json& j, std::ostream& o)
+    {
+        return o << j;
+    }
+#endif  // JSON_NO_IO
+    /// @}
+
+    /////////////////////
+    // deserialization //
+    /////////////////////
+
+    /// @name deserialization
+    /// @{
+
+    /// @brief deserialize from a compatible input
+    /// @sa https://json.nlohmann.me/api/basic_json/parse/
+    template<typename InputType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json parse(InputType&& i,
+                            const parser_callback_t cb = nullptr,
+                            const bool allow_exceptions = true,
+                            const bool ignore_comments = false)
+    {
+        basic_json result;
+        parser(detail::input_adapter(std::forward<InputType>(i)), cb, allow_exceptions, ignore_comments).parse(true, result);
+        return result;
+    }
+
+    /// @brief deserialize from a pair of character iterators
+    /// @sa https://json.nlohmann.me/api/basic_json/parse/
+    template<typename IteratorType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json parse(IteratorType first,
+                            IteratorType last,
+                            const parser_callback_t cb = nullptr,
+                            const bool allow_exceptions = true,
+                            const bool ignore_comments = false)
+    {
+        basic_json result;
+        parser(detail::input_adapter(std::move(first), std::move(last)), cb, allow_exceptions, ignore_comments).parse(true, result);
+        return result;
+    }
+
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, parse(ptr, ptr + len))
+    static basic_json parse(detail::span_input_adapter&& i,
+                            const parser_callback_t cb = nullptr,
+                            const bool allow_exceptions = true,
+                            const bool ignore_comments = false)
+    {
+        basic_json result;
+        parser(i.get(), cb, allow_exceptions, ignore_comments).parse(true, result);
+        return result;
+    }
+
+    /// @brief check if the input is valid JSON
+    /// @sa https://json.nlohmann.me/api/basic_json/accept/
+    template<typename InputType>
+    static bool accept(InputType&& i,
+                       const bool ignore_comments = false)
+    {
+        return parser(detail::input_adapter(std::forward<InputType>(i)), nullptr, false, ignore_comments).accept(true);
+    }
+
+    /// @brief check if the input is valid JSON
+    /// @sa https://json.nlohmann.me/api/basic_json/accept/
+    template<typename IteratorType>
+    static bool accept(IteratorType first, IteratorType last,
+                       const bool ignore_comments = false)
+    {
+        return parser(detail::input_adapter(std::move(first), std::move(last)), nullptr, false, ignore_comments).accept(true);
+    }
+
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, accept(ptr, ptr + len))
+    static bool accept(detail::span_input_adapter&& i,
+                       const bool ignore_comments = false)
+    {
+        return parser(i.get(), nullptr, false, ignore_comments).accept(true);
+    }
+
+    /// @brief generate SAX events
+    /// @sa https://json.nlohmann.me/api/basic_json/sax_parse/
+    template <typename InputType, typename SAX>
+    JSON_HEDLEY_NON_NULL(2)
+    static bool sax_parse(InputType&& i, SAX* sax,
+                          input_format_t format = input_format_t::json,
+                          const bool strict = true,
+                          const bool ignore_comments = false)
+    {
+        auto ia = detail::input_adapter(std::forward<InputType>(i));
+        return format == input_format_t::json
+               ? parser(std::move(ia), nullptr, true, ignore_comments).sax_parse(sax, strict)
+               : detail::binary_reader<basic_json, decltype(ia), SAX>(std::move(ia), format).sax_parse(format, sax, strict);
+    }
+
+    /// @brief generate SAX events
+    /// @sa https://json.nlohmann.me/api/basic_json/sax_parse/
+    template<class IteratorType, class SAX>
+    JSON_HEDLEY_NON_NULL(3)
+    static bool sax_parse(IteratorType first, IteratorType last, SAX* sax,
+                          input_format_t format = input_format_t::json,
+                          const bool strict = true,
+                          const bool ignore_comments = false)
+    {
+        auto ia = detail::input_adapter(std::move(first), std::move(last));
+        return format == input_format_t::json
+               ? parser(std::move(ia), nullptr, true, ignore_comments).sax_parse(sax, strict)
+               : detail::binary_reader<basic_json, decltype(ia), SAX>(std::move(ia), format).sax_parse(format, sax, strict);
+    }
+
+    /// @brief generate SAX events
+    /// @sa https://json.nlohmann.me/api/basic_json/sax_parse/
+    /// @deprecated This function is deprecated since 3.8.0 and will be removed in
+    ///             version 4.0.0 of the library. Please use
+    ///             sax_parse(ptr, ptr + len) instead.
+    template <typename SAX>
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, sax_parse(ptr, ptr + len, ...))
+    JSON_HEDLEY_NON_NULL(2)
+    static bool sax_parse(detail::span_input_adapter&& i, SAX* sax,
+                          input_format_t format = input_format_t::json,
+                          const bool strict = true,
+                          const bool ignore_comments = false)
+    {
+        auto ia = i.get();
+        return format == input_format_t::json
+               // NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
+               ? parser(std::move(ia), nullptr, true, ignore_comments).sax_parse(sax, strict)
+               // NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
+               : detail::binary_reader<basic_json, decltype(ia), SAX>(std::move(ia), format).sax_parse(format, sax, strict);
+    }
+#ifndef JSON_NO_IO
+    /// @brief deserialize from stream
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_gtgt/
+    /// @deprecated This stream operator is deprecated since 3.0.0 and will be removed in
+    ///             version 4.0.0 of the library. Please use
+    ///             operator>>(std::istream&, basic_json&) instead; that is,
+    ///             replace calls like `j << i;` with `i >> j;`.
+    JSON_HEDLEY_DEPRECATED_FOR(3.0.0, operator>>(std::istream&, basic_json&))
+    friend std::istream& operator<<(basic_json& j, std::istream& i)
+    {
+        return operator>>(i, j);
+    }
+
+    /// @brief deserialize from stream
+    /// @sa https://json.nlohmann.me/api/basic_json/operator_gtgt/
+    friend std::istream& operator>>(std::istream& i, basic_json& j)
+    {
+        parser(detail::input_adapter(i)).parse(false, j);
+        return i;
+    }
+#endif  // JSON_NO_IO
+    /// @}
+
+    ///////////////////////////
+    // convenience functions //
+    ///////////////////////////
+
+    /// @brief return the type as string
+    /// @sa https://json.nlohmann.me/api/basic_json/type_name/
+    JSON_HEDLEY_RETURNS_NON_NULL
+    const char* type_name() const noexcept
+    {
+        switch (m_data.m_type)
+        {
+            case value_t::null:
+                return "null";
+            case value_t::object:
+                return "object";
+            case value_t::array:
+                return "array";
+            case value_t::string:
+                return "string";
+            case value_t::boolean:
+                return "boolean";
+            case value_t::binary:
+                return "binary";
+            case value_t::discarded:
+                return "discarded";
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            default:
+                return "number";
+        }
+    }
+
+  JSON_PRIVATE_UNLESS_TESTED:
+    //////////////////////
+    // member variables //
+    //////////////////////
+
+    struct data
+    {
+        /// the type of the current element
+        value_t m_type = value_t::null;
+
+        /// the value of the current element
+        json_value m_value = {};
+
+        data(const value_t v)
+            : m_type(v), m_value(v)
+        {
+        }
+
+        data(size_type cnt, const basic_json& val)
+            : m_type(value_t::array)
+        {
+            m_value.array = create<array_t>(cnt, val);
+        }
+
+        data() noexcept = default;
+        data(data&&) noexcept = default;
+        data(const data&) noexcept = delete;
+        data& operator=(data&&) noexcept = delete;
+        data& operator=(const data&) noexcept = delete;
+
+        ~data() noexcept
+        {
+            m_value.destroy(m_type);
+        }
+    };
+
+    data m_data = {};
+
+#if JSON_DIAGNOSTICS
+    /// a pointer to a parent value (for debugging purposes)
+    basic_json* m_parent = nullptr;
+#endif
+
+    //////////////////////////////////////////
+    // binary serialization/deserialization //
+    //////////////////////////////////////////
+
+    /// @name binary serialization/deserialization support
+    /// @{
+
+  public:
+    /// @brief create a CBOR serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_cbor/
+    static std::vector<std::uint8_t> to_cbor(const basic_json& j)
+    {
+        std::vector<std::uint8_t> result;
+        to_cbor(j, result);
+        return result;
+    }
+
+    /// @brief create a CBOR serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_cbor/
+    static void to_cbor(const basic_json& j, detail::output_adapter<std::uint8_t> o)
+    {
+        binary_writer<std::uint8_t>(o).write_cbor(j);
+    }
+
+    /// @brief create a CBOR serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_cbor/
+    static void to_cbor(const basic_json& j, detail::output_adapter<char> o)
+    {
+        binary_writer<char>(o).write_cbor(j);
+    }
+
+    /// @brief create a MessagePack serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_msgpack/
+    static std::vector<std::uint8_t> to_msgpack(const basic_json& j)
+    {
+        std::vector<std::uint8_t> result;
+        to_msgpack(j, result);
+        return result;
+    }
+
+    /// @brief create a MessagePack serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_msgpack/
+    static void to_msgpack(const basic_json& j, detail::output_adapter<std::uint8_t> o)
+    {
+        binary_writer<std::uint8_t>(o).write_msgpack(j);
+    }
+
+    /// @brief create a MessagePack serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_msgpack/
+    static void to_msgpack(const basic_json& j, detail::output_adapter<char> o)
+    {
+        binary_writer<char>(o).write_msgpack(j);
+    }
+
+    /// @brief create a UBJSON serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_ubjson/
+    static std::vector<std::uint8_t> to_ubjson(const basic_json& j,
+            const bool use_size = false,
+            const bool use_type = false)
+    {
+        std::vector<std::uint8_t> result;
+        to_ubjson(j, result, use_size, use_type);
+        return result;
+    }
+
+    /// @brief create a UBJSON serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_ubjson/
+    static void to_ubjson(const basic_json& j, detail::output_adapter<std::uint8_t> o,
+                          const bool use_size = false, const bool use_type = false)
+    {
+        binary_writer<std::uint8_t>(o).write_ubjson(j, use_size, use_type);
+    }
+
+    /// @brief create a UBJSON serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_ubjson/
+    static void to_ubjson(const basic_json& j, detail::output_adapter<char> o,
+                          const bool use_size = false, const bool use_type = false)
+    {
+        binary_writer<char>(o).write_ubjson(j, use_size, use_type);
+    }
+
+    /// @brief create a BJData serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_bjdata/
+    static std::vector<std::uint8_t> to_bjdata(const basic_json& j,
+            const bool use_size = false,
+            const bool use_type = false)
+    {
+        std::vector<std::uint8_t> result;
+        to_bjdata(j, result, use_size, use_type);
+        return result;
+    }
+
+    /// @brief create a BJData serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_bjdata/
+    static void to_bjdata(const basic_json& j, detail::output_adapter<std::uint8_t> o,
+                          const bool use_size = false, const bool use_type = false)
+    {
+        binary_writer<std::uint8_t>(o).write_ubjson(j, use_size, use_type, true, true);
+    }
+
+    /// @brief create a BJData serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_bjdata/
+    static void to_bjdata(const basic_json& j, detail::output_adapter<char> o,
+                          const bool use_size = false, const bool use_type = false)
+    {
+        binary_writer<char>(o).write_ubjson(j, use_size, use_type, true, true);
+    }
+
+    /// @brief create a BSON serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_bson/
+    static std::vector<std::uint8_t> to_bson(const basic_json& j)
+    {
+        std::vector<std::uint8_t> result;
+        to_bson(j, result);
+        return result;
+    }
+
+    /// @brief create a BSON serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_bson/
+    static void to_bson(const basic_json& j, detail::output_adapter<std::uint8_t> o)
+    {
+        binary_writer<std::uint8_t>(o).write_bson(j);
+    }
+
+    /// @brief create a BSON serialization of a given JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/to_bson/
+    static void to_bson(const basic_json& j, detail::output_adapter<char> o)
+    {
+        binary_writer<char>(o).write_bson(j);
+    }
+
+    /// @brief create a JSON value from an input in CBOR format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_cbor/
+    template<typename InputType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_cbor(InputType&& i,
+                                const bool strict = true,
+                                const bool allow_exceptions = true,
+                                const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::forward<InputType>(i));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::cbor).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in CBOR format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_cbor/
+    template<typename IteratorType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_cbor(IteratorType first, IteratorType last,
+                                const bool strict = true,
+                                const bool allow_exceptions = true,
+                                const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::move(first), std::move(last));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::cbor).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    template<typename T>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_cbor(ptr, ptr + len))
+    static basic_json from_cbor(const T* ptr, std::size_t len,
+                                const bool strict = true,
+                                const bool allow_exceptions = true,
+                                const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error)
+    {
+        return from_cbor(ptr, ptr + len, strict, allow_exceptions, tag_handler);
+    }
+
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_cbor(ptr, ptr + len))
+    static basic_json from_cbor(detail::span_input_adapter&& i,
+                                const bool strict = true,
+                                const bool allow_exceptions = true,
+                                const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = i.get();
+        // NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::cbor).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in MessagePack format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_msgpack/
+    template<typename InputType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_msgpack(InputType&& i,
+                                   const bool strict = true,
+                                   const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::forward<InputType>(i));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::msgpack).sax_parse(input_format_t::msgpack, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in MessagePack format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_msgpack/
+    template<typename IteratorType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_msgpack(IteratorType first, IteratorType last,
+                                   const bool strict = true,
+                                   const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::move(first), std::move(last));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::msgpack).sax_parse(input_format_t::msgpack, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    template<typename T>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_msgpack(ptr, ptr + len))
+    static basic_json from_msgpack(const T* ptr, std::size_t len,
+                                   const bool strict = true,
+                                   const bool allow_exceptions = true)
+    {
+        return from_msgpack(ptr, ptr + len, strict, allow_exceptions);
+    }
+
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_msgpack(ptr, ptr + len))
+    static basic_json from_msgpack(detail::span_input_adapter&& i,
+                                   const bool strict = true,
+                                   const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = i.get();
+        // NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::msgpack).sax_parse(input_format_t::msgpack, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in UBJSON format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_ubjson/
+    template<typename InputType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_ubjson(InputType&& i,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::forward<InputType>(i));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::ubjson).sax_parse(input_format_t::ubjson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in UBJSON format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_ubjson/
+    template<typename IteratorType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_ubjson(IteratorType first, IteratorType last,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::move(first), std::move(last));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::ubjson).sax_parse(input_format_t::ubjson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    template<typename T>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_ubjson(ptr, ptr + len))
+    static basic_json from_ubjson(const T* ptr, std::size_t len,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        return from_ubjson(ptr, ptr + len, strict, allow_exceptions);
+    }
+
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_ubjson(ptr, ptr + len))
+    static basic_json from_ubjson(detail::span_input_adapter&& i,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = i.get();
+        // NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::ubjson).sax_parse(input_format_t::ubjson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in BJData format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_bjdata/
+    template<typename InputType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_bjdata(InputType&& i,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::forward<InputType>(i));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bjdata).sax_parse(input_format_t::bjdata, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in BJData format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_bjdata/
+    template<typename IteratorType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_bjdata(IteratorType first, IteratorType last,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::move(first), std::move(last));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bjdata).sax_parse(input_format_t::bjdata, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in BSON format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_bson/
+    template<typename InputType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_bson(InputType&& i,
+                                const bool strict = true,
+                                const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::forward<InputType>(i));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bson).sax_parse(input_format_t::bson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @brief create a JSON value from an input in BSON format
+    /// @sa https://json.nlohmann.me/api/basic_json/from_bson/
+    template<typename IteratorType>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json from_bson(IteratorType first, IteratorType last,
+                                const bool strict = true,
+                                const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = detail::input_adapter(std::move(first), std::move(last));
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bson).sax_parse(input_format_t::bson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    template<typename T>
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_bson(ptr, ptr + len))
+    static basic_json from_bson(const T* ptr, std::size_t len,
+                                const bool strict = true,
+                                const bool allow_exceptions = true)
+    {
+        return from_bson(ptr, ptr + len, strict, allow_exceptions);
+    }
+
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    JSON_HEDLEY_DEPRECATED_FOR(3.8.0, from_bson(ptr, ptr + len))
+    static basic_json from_bson(detail::span_input_adapter&& i,
+                                const bool strict = true,
+                                const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        auto ia = i.get();
+        // NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
+        const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bson).sax_parse(input_format_t::bson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+    /// @}
+
+    //////////////////////////
+    // JSON Pointer support //
+    //////////////////////////
+
+    /// @name JSON Pointer functions
+    /// @{
+
+    /// @brief access specified element via JSON Pointer
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    reference operator[](const json_pointer& ptr)
+    {
+        return ptr.get_unchecked(this);
+    }
+
+    template<typename BasicJsonType, detail::enable_if_t<detail::is_basic_json<BasicJsonType>::value, int> = 0>
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    reference operator[](const ::nlohmann::json_pointer<BasicJsonType>& ptr)
+    {
+        return ptr.get_unchecked(this);
+    }
+
+    /// @brief access specified element via JSON Pointer
+    /// @sa https://json.nlohmann.me/api/basic_json/operator%5B%5D/
+    const_reference operator[](const json_pointer& ptr) const
+    {
+        return ptr.get_unchecked(this);
+    }
+
+    template<typename BasicJsonType, detail::enable_if_t<detail::is_basic_json<BasicJsonType>::value, int> = 0>
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    const_reference operator[](const ::nlohmann::json_pointer<BasicJsonType>& ptr) const
+    {
+        return ptr.get_unchecked(this);
+    }
+
+    /// @brief access specified element via JSON Pointer
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    reference at(const json_pointer& ptr)
+    {
+        return ptr.get_checked(this);
+    }
+
+    template<typename BasicJsonType, detail::enable_if_t<detail::is_basic_json<BasicJsonType>::value, int> = 0>
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    reference at(const ::nlohmann::json_pointer<BasicJsonType>& ptr)
+    {
+        return ptr.get_checked(this);
+    }
+
+    /// @brief access specified element via JSON Pointer
+    /// @sa https://json.nlohmann.me/api/basic_json/at/
+    const_reference at(const json_pointer& ptr) const
+    {
+        return ptr.get_checked(this);
+    }
+
+    template<typename BasicJsonType, detail::enable_if_t<detail::is_basic_json<BasicJsonType>::value, int> = 0>
+    JSON_HEDLEY_DEPRECATED_FOR(3.11.0, basic_json::json_pointer or nlohmann::json_pointer<basic_json::string_t>) // NOLINT(readability/alt_tokens)
+    const_reference at(const ::nlohmann::json_pointer<BasicJsonType>& ptr) const
+    {
+        return ptr.get_checked(this);
+    }
+
+    /// @brief return flattened JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/flatten/
+    basic_json flatten() const
+    {
+        basic_json result(value_t::object);
+        json_pointer::flatten("", *this, result);
+        return result;
+    }
+
+    /// @brief unflatten a previously flattened JSON value
+    /// @sa https://json.nlohmann.me/api/basic_json/unflatten/
+    basic_json unflatten() const
+    {
+        return json_pointer::unflatten(*this);
+    }
+
+    /// @}
+
+    //////////////////////////
+    // JSON Patch functions //
+    //////////////////////////
+
+    /// @name JSON Patch functions
+    /// @{
+
+    /// @brief applies a JSON patch in-place without copying the object
+    /// @sa https://json.nlohmann.me/api/basic_json/patch/
+    void patch_inplace(const basic_json& json_patch)
+    {
+        basic_json& result = *this;
+        // the valid JSON Patch operations
+        enum class patch_operations {add, remove, replace, move, copy, test, invalid};
+
+        const auto get_op = [](const std::string & op)
+        {
+            if (op == "add")
+            {
+                return patch_operations::add;
+            }
+            if (op == "remove")
+            {
+                return patch_operations::remove;
+            }
+            if (op == "replace")
+            {
+                return patch_operations::replace;
+            }
+            if (op == "move")
+            {
+                return patch_operations::move;
+            }
+            if (op == "copy")
+            {
+                return patch_operations::copy;
+            }
+            if (op == "test")
+            {
+                return patch_operations::test;
+            }
+
+            return patch_operations::invalid;
+        };
+
+        // wrapper for "add" operation; add value at ptr
+        const auto operation_add = [&result](json_pointer & ptr, basic_json val)
+        {
+            // adding to the root of the target document means replacing it
+            if (ptr.empty())
+            {
+                result = val;
+                return;
+            }
+
+            // make sure the top element of the pointer exists
+            json_pointer const top_pointer = ptr.top();
+            if (top_pointer != ptr)
+            {
+                result.at(top_pointer);
+            }
+
+            // get reference to parent of JSON pointer ptr
+            const auto last_path = ptr.back();
+            ptr.pop_back();
+            // parent must exist when performing patch add per RFC6902 specs
+            basic_json& parent = result.at(ptr);
+
+            switch (parent.m_data.m_type)
+            {
+                case value_t::null:
+                case value_t::object:
+                {
+                    // use operator[] to add value
+                    parent[last_path] = val;
+                    break;
+                }
+
+                case value_t::array:
+                {
+                    if (last_path == "-")
+                    {
+                        // special case: append to back
+                        parent.push_back(val);
+                    }
+                    else
+                    {
+                        const auto idx = json_pointer::template array_index<basic_json_t>(last_path);
+                        if (JSON_HEDLEY_UNLIKELY(idx > parent.size()))
+                        {
+                            // avoid undefined behavior
+                            JSON_THROW(out_of_range::create(401, detail::concat("array index ", std::to_string(idx), " is out of range"), &parent));
+                        }
+
+                        // default case: insert add offset
+                        parent.insert(parent.begin() + static_cast<difference_type>(idx), val);
+                    }
+                    break;
+                }
+
+                // if there exists a parent it cannot be primitive
+                case value_t::string: // LCOV_EXCL_LINE
+                case value_t::boolean: // LCOV_EXCL_LINE
+                case value_t::number_integer: // LCOV_EXCL_LINE
+                case value_t::number_unsigned: // LCOV_EXCL_LINE
+                case value_t::number_float: // LCOV_EXCL_LINE
+                case value_t::binary: // LCOV_EXCL_LINE
+                case value_t::discarded: // LCOV_EXCL_LINE
+                default:            // LCOV_EXCL_LINE
+                    JSON_ASSERT(false); // NOLINT(cert-dcl03-c,hicpp-static-assert,misc-static-assert) LCOV_EXCL_LINE
+            }
+        };
+
+        // wrapper for "remove" operation; remove value at ptr
+        const auto operation_remove = [this, & result](json_pointer & ptr)
+        {
+            // get reference to parent of JSON pointer ptr
+            const auto last_path = ptr.back();
+            ptr.pop_back();
+            basic_json& parent = result.at(ptr);
+
+            // remove child
+            if (parent.is_object())
+            {
+                // perform range check
+                auto it = parent.find(last_path);
+                if (JSON_HEDLEY_LIKELY(it != parent.end()))
+                {
+                    parent.erase(it);
+                }
+                else
+                {
+                    JSON_THROW(out_of_range::create(403, detail::concat("key '", last_path, "' not found"), this));
+                }
+            }
+            else if (parent.is_array())
+            {
+                // note erase performs range check
+                parent.erase(json_pointer::template array_index<basic_json_t>(last_path));
+            }
+        };
+
+        // type check: top level value must be an array
+        if (JSON_HEDLEY_UNLIKELY(!json_patch.is_array()))
+        {
+            JSON_THROW(parse_error::create(104, 0, "JSON patch must be an array of objects", &json_patch));
+        }
+
+        // iterate and apply the operations
+        for (const auto& val : json_patch)
+        {
+            // wrapper to get a value for an operation
+            const auto get_value = [&val](const std::string & op,
+                                          const std::string & member,
+                                          bool string_type) -> basic_json &
+            {
+                // find value
+                auto it = val.m_data.m_value.object->find(member);
+
+                // context-sensitive error message
+                const auto error_msg = (op == "op") ? "operation" : detail::concat("operation '", op, '\'');
+
+                // check if desired value is present
+                if (JSON_HEDLEY_UNLIKELY(it == val.m_data.m_value.object->end()))
+                {
+                    // NOLINTNEXTLINE(performance-inefficient-string-concatenation)
+                    JSON_THROW(parse_error::create(105, 0, detail::concat(error_msg, " must have member '", member, "'"), &val));
+                }
+
+                // check if result is of type string
+                if (JSON_HEDLEY_UNLIKELY(string_type && !it->second.is_string()))
+                {
+                    // NOLINTNEXTLINE(performance-inefficient-string-concatenation)
+                    JSON_THROW(parse_error::create(105, 0, detail::concat(error_msg, " must have string member '", member, "'"), &val));
+                }
+
+                // no error: return value
+                return it->second;
+            };
+
+            // type check: every element of the array must be an object
+            if (JSON_HEDLEY_UNLIKELY(!val.is_object()))
+            {
+                JSON_THROW(parse_error::create(104, 0, "JSON patch must be an array of objects", &val));
+            }
+
+            // collect mandatory members
+            const auto op = get_value("op", "op", true).template get<std::string>();
+            const auto path = get_value(op, "path", true).template get<std::string>();
+            json_pointer ptr(path);
+
+            switch (get_op(op))
+            {
+                case patch_operations::add:
+                {
+                    operation_add(ptr, get_value("add", "value", false));
+                    break;
+                }
+
+                case patch_operations::remove:
+                {
+                    operation_remove(ptr);
+                    break;
+                }
+
+                case patch_operations::replace:
+                {
+                    // the "path" location must exist - use at()
+                    result.at(ptr) = get_value("replace", "value", false);
+                    break;
+                }
+
+                case patch_operations::move:
+                {
+                    const auto from_path = get_value("move", "from", true).template get<std::string>();
+                    json_pointer from_ptr(from_path);
+
+                    // the "from" location must exist - use at()
+                    basic_json const v = result.at(from_ptr);
+
+                    // The move operation is functionally identical to a
+                    // "remove" operation on the "from" location, followed
+                    // immediately by an "add" operation at the target
+                    // location with the value that was just removed.
+                    operation_remove(from_ptr);
+                    operation_add(ptr, v);
+                    break;
+                }
+
+                case patch_operations::copy:
+                {
+                    const auto from_path = get_value("copy", "from", true).template get<std::string>();
+                    const json_pointer from_ptr(from_path);
+
+                    // the "from" location must exist - use at()
+                    basic_json const v = result.at(from_ptr);
+
+                    // The copy is functionally identical to an "add"
+                    // operation at the target location using the value
+                    // specified in the "from" member.
+                    operation_add(ptr, v);
+                    break;
+                }
+
+                case patch_operations::test:
+                {
+                    bool success = false;
+                    JSON_TRY
+                    {
+                        // check if "value" matches the one at "path"
+                        // the "path" location must exist - use at()
+                        success = (result.at(ptr) == get_value("test", "value", false));
+                    }
+                    JSON_INTERNAL_CATCH (out_of_range&)
+                    {
+                        // ignore out of range errors: success remains false
+                    }
+
+                    // throw an exception if test fails
+                    if (JSON_HEDLEY_UNLIKELY(!success))
+                    {
+                        JSON_THROW(other_error::create(501, detail::concat("unsuccessful: ", val.dump()), &val));
+                    }
+
+                    break;
+                }
+
+                case patch_operations::invalid:
+                default:
+                {
+                    // op must be "add", "remove", "replace", "move", "copy", or
+                    // "test"
+                    JSON_THROW(parse_error::create(105, 0, detail::concat("operation value '", op, "' is invalid"), &val));
+                }
+            }
+        }
+    }
+
+    /// @brief applies a JSON patch to a copy of the current object
+    /// @sa https://json.nlohmann.me/api/basic_json/patch/
+    basic_json patch(const basic_json& json_patch) const
+    {
+        basic_json result = *this;
+        result.patch_inplace(json_patch);
+        return result;
+    }
+
+    /// @brief creates a diff as a JSON patch
+    /// @sa https://json.nlohmann.me/api/basic_json/diff/
+    JSON_HEDLEY_WARN_UNUSED_RESULT
+    static basic_json diff(const basic_json& source, const basic_json& target,
+                           const std::string& path = "")
+    {
+        // the patch
+        basic_json result(value_t::array);
+
+        // if the values are the same, return empty patch
+        if (source == target)
+        {
+            return result;
+        }
+
+        if (source.type() != target.type())
+        {
+            // different types: replace value
+            result.push_back(
+            {
+                {"op", "replace"}, {"path", path}, {"value", target}
+            });
+            return result;
+        }
+
+        switch (source.type())
+        {
+            case value_t::array:
+            {
+                // first pass: traverse common elements
+                std::size_t i = 0;
+                while (i < source.size() && i < target.size())
+                {
+                    // recursive call to compare array values at index i
+                    auto temp_diff = diff(source[i], target[i], detail::concat(path, '/', std::to_string(i)));
+                    result.insert(result.end(), temp_diff.begin(), temp_diff.end());
+                    ++i;
+                }
+
+                // We now reached the end of at least one array
+                // in a second pass, traverse the remaining elements
+
+                // remove my remaining elements
+                const auto end_index = static_cast<difference_type>(result.size());
+                while (i < source.size())
+                {
+                    // add operations in reverse order to avoid invalid
+                    // indices
+                    result.insert(result.begin() + end_index, object(
+                    {
+                        {"op", "remove"},
+                        {"path", detail::concat(path, '/', std::to_string(i))}
+                    }));
+                    ++i;
+                }
+
+                // add other remaining elements
+                while (i < target.size())
+                {
+                    result.push_back(
+                    {
+                        {"op", "add"},
+                        {"path", detail::concat(path, "/-")},
+                        {"value", target[i]}
+                    });
+                    ++i;
+                }
+
+                break;
+            }
+
+            case value_t::object:
+            {
+                // first pass: traverse this object's elements
+                for (auto it = source.cbegin(); it != source.cend(); ++it)
+                {
+                    // escape the key name to be used in a JSON patch
+                    const auto path_key = detail::concat(path, '/', detail::escape(it.key()));
+
+                    if (target.find(it.key()) != target.end())
+                    {
+                        // recursive call to compare object values at key it
+                        auto temp_diff = diff(it.value(), target[it.key()], path_key);
+                        result.insert(result.end(), temp_diff.begin(), temp_diff.end());
+                    }
+                    else
+                    {
+                        // found a key that is not in o -> remove it
+                        result.push_back(object(
+                        {
+                            {"op", "remove"}, {"path", path_key}
+                        }));
+                    }
+                }
+
+                // second pass: traverse other object's elements
+                for (auto it = target.cbegin(); it != target.cend(); ++it)
+                {
+                    if (source.find(it.key()) == source.end())
+                    {
+                        // found a key that is not in this -> add it
+                        const auto path_key = detail::concat(path, '/', detail::escape(it.key()));
+                        result.push_back(
+                        {
+                            {"op", "add"}, {"path", path_key},
+                            {"value", it.value()}
+                        });
+                    }
+                }
+
+                break;
+            }
+
+            case value_t::null:
+            case value_t::string:
+            case value_t::boolean:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::number_float:
+            case value_t::binary:
+            case value_t::discarded:
+            default:
+            {
+                // both primitive type: replace value
+                result.push_back(
+                {
+                    {"op", "replace"}, {"path", path}, {"value", target}
+                });
+                break;
+            }
+        }
+
+        return result;
+    }
+    /// @}
+
+    ////////////////////////////////
+    // JSON Merge Patch functions //
+    ////////////////////////////////
+
+    /// @name JSON Merge Patch functions
+    /// @{
+
+    /// @brief applies a JSON Merge Patch
+    /// @sa https://json.nlohmann.me/api/basic_json/merge_patch/
+    void merge_patch(const basic_json& apply_patch)
+    {
+        if (apply_patch.is_object())
+        {
+            if (!is_object())
+            {
+                *this = object();
+            }
+            for (auto it = apply_patch.begin(); it != apply_patch.end(); ++it)
+            {
+                if (it.value().is_null())
+                {
+                    erase(it.key());
+                }
+                else
+                {
+                    operator[](it.key()).merge_patch(it.value());
+                }
+            }
+        }
+        else
+        {
+            *this = apply_patch;
+        }
+    }
+
+    /// @}
+};
+
+/// @brief user-defined to_string function for JSON values
+/// @sa https://json.nlohmann.me/api/basic_json/to_string/
+NLOHMANN_BASIC_JSON_TPL_DECLARATION
+std::string to_string(const NLOHMANN_BASIC_JSON_TPL& j)
+{
+    return j.dump();
+}
+
+inline namespace literals
+{
+inline namespace json_literals
+{
+
+/// @brief user-defined string literal for JSON values
+/// @sa https://json.nlohmann.me/api/basic_json/operator_literal_json/
+JSON_HEDLEY_NON_NULL(1)
+#if !defined(JSON_HEDLEY_GCC_VERSION) || JSON_HEDLEY_GCC_VERSION_CHECK(4,9,0)
+    inline nlohmann::json operator ""_json(const char* s, std::size_t n)
+#else
+    inline nlohmann::json operator "" _json(const char* s, std::size_t n)
+#endif
+{
+    return nlohmann::json::parse(s, s + n);
+}
+
+/// @brief user-defined string literal for JSON pointer
+/// @sa https://json.nlohmann.me/api/basic_json/operator_literal_json_pointer/
+JSON_HEDLEY_NON_NULL(1)
+#if !defined(JSON_HEDLEY_GCC_VERSION) || JSON_HEDLEY_GCC_VERSION_CHECK(4,9,0)
+    inline nlohmann::json::json_pointer operator ""_json_pointer(const char* s, std::size_t n)
+#else
+    inline nlohmann::json::json_pointer operator "" _json_pointer(const char* s, std::size_t n)
+#endif
+{
+    return nlohmann::json::json_pointer(std::string(s, n));
+}
+
+}  // namespace json_literals
+}  // namespace literals
+NLOHMANN_JSON_NAMESPACE_END
+
+///////////////////////
+// nonmember support //
+///////////////////////
+
+namespace std // NOLINT(cert-dcl58-cpp)
+{
+
+/// @brief hash value for JSON objects
+/// @sa https://json.nlohmann.me/api/basic_json/std_hash/
+NLOHMANN_BASIC_JSON_TPL_DECLARATION
+struct hash<nlohmann::NLOHMANN_BASIC_JSON_TPL> // NOLINT(cert-dcl58-cpp)
+{
+    std::size_t operator()(const nlohmann::NLOHMANN_BASIC_JSON_TPL& j) const
+    {
+        return nlohmann::detail::hash(j);
+    }
+};
+
+// specialization for std::less<value_t>
+template<>
+struct less< ::nlohmann::detail::value_t> // do not remove the space after '<', see https://github.com/nlohmann/json/pull/679
+{
+    /*!
+    @brief compare two value_t enum values
+    @since version 3.0.0
+    */
+    bool operator()(::nlohmann::detail::value_t lhs,
+                    ::nlohmann::detail::value_t rhs) const noexcept
+    {
+#if JSON_HAS_THREE_WAY_COMPARISON
+        return std::is_lt(lhs <=> rhs); // *NOPAD*
+#else
+        return ::nlohmann::detail::operator<(lhs, rhs);
+#endif
+    }
+};
+
+// C++20 prohibit function specialization in the std namespace.
+#ifndef JSON_HAS_CPP_20
+
+/// @brief exchanges the values of two JSON objects
+/// @sa https://json.nlohmann.me/api/basic_json/std_swap/
+NLOHMANN_BASIC_JSON_TPL_DECLARATION
+inline void swap(nlohmann::NLOHMANN_BASIC_JSON_TPL& j1, nlohmann::NLOHMANN_BASIC_JSON_TPL& j2) noexcept(  // NOLINT(readability-inconsistent-declaration-parameter-name, cert-dcl58-cpp)
+    is_nothrow_move_constructible<nlohmann::NLOHMANN_BASIC_JSON_TPL>::value&&                          // NOLINT(misc-redundant-expression,cppcoreguidelines-noexcept-swap,performance-noexcept-swap)
+    is_nothrow_move_assignable<nlohmann::NLOHMANN_BASIC_JSON_TPL>::value)
+{
+    j1.swap(j2);
+}
+
+#endif
+
+}  // namespace std
+
+#if JSON_USE_GLOBAL_UDLS
+    #if !defined(JSON_HEDLEY_GCC_VERSION) || JSON_HEDLEY_GCC_VERSION_CHECK(4,9,0)
+        using nlohmann::literals::json_literals::operator ""_json; // NOLINT(misc-unused-using-decls,google-global-names-in-headers)
+        using nlohmann::literals::json_literals::operator ""_json_pointer; //NOLINT(misc-unused-using-decls,google-global-names-in-headers)
+    #else
+        using nlohmann::literals::json_literals::operator "" _json; // NOLINT(misc-unused-using-decls,google-global-names-in-headers)
+        using nlohmann::literals::json_literals::operator "" _json_pointer; //NOLINT(misc-unused-using-decls,google-global-names-in-headers)
+    #endif
+#endif
+
+// #include <nlohmann/detail/macro_unscope.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+// restore clang diagnostic settings
+#if defined(__clang__)
+    #pragma clang diagnostic pop
+#endif
+
+// clean up
+#undef JSON_ASSERT
+#undef JSON_INTERNAL_CATCH
+#undef JSON_THROW
+#undef JSON_PRIVATE_UNLESS_TESTED
+#undef NLOHMANN_BASIC_JSON_TPL_DECLARATION
+#undef NLOHMANN_BASIC_JSON_TPL
+#undef JSON_EXPLICIT
+#undef NLOHMANN_CAN_CALL_STD_FUNC_IMPL
+#undef JSON_INLINE_VARIABLE
+#undef JSON_NO_UNIQUE_ADDRESS
+#undef JSON_DISABLE_ENUM_SERIALIZATION
+#undef JSON_USE_GLOBAL_UDLS
+
+#ifndef JSON_TEST_KEEP_MACROS
+    #undef JSON_CATCH
+    #undef JSON_TRY
+    #undef JSON_HAS_CPP_11
+    #undef JSON_HAS_CPP_14
+    #undef JSON_HAS_CPP_17
+    #undef JSON_HAS_CPP_20
+    #undef JSON_HAS_FILESYSTEM
+    #undef JSON_HAS_EXPERIMENTAL_FILESYSTEM
+    #undef JSON_HAS_THREE_WAY_COMPARISON
+    #undef JSON_HAS_RANGES
+    #undef JSON_HAS_STATIC_RTTI
+    #undef JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON
+#endif
+
+// #include <nlohmann/thirdparty/hedley/hedley_undef.hpp>
+//     __ _____ _____ _____
+//  __|  |   __|     |   | |  JSON for Modern C++
+// |  |  |__   |  |  | | | |  version 3.11.3
+// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
+//
+// SPDX-FileCopyrightText: 2013-2023 Niels Lohmann <https://nlohmann.me>
+// SPDX-License-Identifier: MIT
+
+
+
+#undef JSON_HEDLEY_ALWAYS_INLINE
+#undef JSON_HEDLEY_ARM_VERSION
+#undef JSON_HEDLEY_ARM_VERSION_CHECK
+#undef JSON_HEDLEY_ARRAY_PARAM
+#undef JSON_HEDLEY_ASSUME
+#undef JSON_HEDLEY_BEGIN_C_DECLS
+#undef JSON_HEDLEY_CLANG_HAS_ATTRIBUTE
+#undef JSON_HEDLEY_CLANG_HAS_BUILTIN
+#undef JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE
+#undef JSON_HEDLEY_CLANG_HAS_DECLSPEC_DECLSPEC_ATTRIBUTE
+#undef JSON_HEDLEY_CLANG_HAS_EXTENSION
+#undef JSON_HEDLEY_CLANG_HAS_FEATURE
+#undef JSON_HEDLEY_CLANG_HAS_WARNING
+#undef JSON_HEDLEY_COMPCERT_VERSION
+#undef JSON_HEDLEY_COMPCERT_VERSION_CHECK
+#undef JSON_HEDLEY_CONCAT
+#undef JSON_HEDLEY_CONCAT3
+#undef JSON_HEDLEY_CONCAT3_EX
+#undef JSON_HEDLEY_CONCAT_EX
+#undef JSON_HEDLEY_CONST
+#undef JSON_HEDLEY_CONSTEXPR
+#undef JSON_HEDLEY_CONST_CAST
+#undef JSON_HEDLEY_CPP_CAST
+#undef JSON_HEDLEY_CRAY_VERSION
+#undef JSON_HEDLEY_CRAY_VERSION_CHECK
+#undef JSON_HEDLEY_C_DECL
+#undef JSON_HEDLEY_DEPRECATED
+#undef JSON_HEDLEY_DEPRECATED_FOR
+#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_CAST_QUAL
+#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_CPP98_COMPAT_WRAP_
+#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED
+#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_CPP_ATTRIBUTES
+#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNKNOWN_PRAGMAS
+#undef JSON_HEDLEY_DIAGNOSTIC_DISABLE_UNUSED_FUNCTION
+#undef JSON_HEDLEY_DIAGNOSTIC_POP
+#undef JSON_HEDLEY_DIAGNOSTIC_PUSH
+#undef JSON_HEDLEY_DMC_VERSION
+#undef JSON_HEDLEY_DMC_VERSION_CHECK
+#undef JSON_HEDLEY_EMPTY_BASES
+#undef JSON_HEDLEY_EMSCRIPTEN_VERSION
+#undef JSON_HEDLEY_EMSCRIPTEN_VERSION_CHECK
+#undef JSON_HEDLEY_END_C_DECLS
+#undef JSON_HEDLEY_FLAGS
+#undef JSON_HEDLEY_FLAGS_CAST
+#undef JSON_HEDLEY_GCC_HAS_ATTRIBUTE
+#undef JSON_HEDLEY_GCC_HAS_BUILTIN
+#undef JSON_HEDLEY_GCC_HAS_CPP_ATTRIBUTE
+#undef JSON_HEDLEY_GCC_HAS_DECLSPEC_ATTRIBUTE
+#undef JSON_HEDLEY_GCC_HAS_EXTENSION
+#undef JSON_HEDLEY_GCC_HAS_FEATURE
+#undef JSON_HEDLEY_GCC_HAS_WARNING
+#undef JSON_HEDLEY_GCC_NOT_CLANG_VERSION_CHECK
+#undef JSON_HEDLEY_GCC_VERSION
+#undef JSON_HEDLEY_GCC_VERSION_CHECK
+#undef JSON_HEDLEY_GNUC_HAS_ATTRIBUTE
+#undef JSON_HEDLEY_GNUC_HAS_BUILTIN
+#undef JSON_HEDLEY_GNUC_HAS_CPP_ATTRIBUTE
+#undef JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE
+#undef JSON_HEDLEY_GNUC_HAS_EXTENSION
+#undef JSON_HEDLEY_GNUC_HAS_FEATURE
+#undef JSON_HEDLEY_GNUC_HAS_WARNING
+#undef JSON_HEDLEY_GNUC_VERSION
+#undef JSON_HEDLEY_GNUC_VERSION_CHECK
+#undef JSON_HEDLEY_HAS_ATTRIBUTE
+#undef JSON_HEDLEY_HAS_BUILTIN
+#undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE
+#undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE_NS
+#undef JSON_HEDLEY_HAS_DECLSPEC_ATTRIBUTE
+#undef JSON_HEDLEY_HAS_EXTENSION
+#undef JSON_HEDLEY_HAS_FEATURE
+#undef JSON_HEDLEY_HAS_WARNING
+#undef JSON_HEDLEY_IAR_VERSION
+#undef JSON_HEDLEY_IAR_VERSION_CHECK
+#undef JSON_HEDLEY_IBM_VERSION
+#undef JSON_HEDLEY_IBM_VERSION_CHECK
+#undef JSON_HEDLEY_IMPORT
+#undef JSON_HEDLEY_INLINE
+#undef JSON_HEDLEY_INTEL_CL_VERSION
+#undef JSON_HEDLEY_INTEL_CL_VERSION_CHECK
+#undef JSON_HEDLEY_INTEL_VERSION
+#undef JSON_HEDLEY_INTEL_VERSION_CHECK
+#undef JSON_HEDLEY_IS_CONSTANT
+#undef JSON_HEDLEY_IS_CONSTEXPR_
+#undef JSON_HEDLEY_LIKELY
+#undef JSON_HEDLEY_MALLOC
+#undef JSON_HEDLEY_MCST_LCC_VERSION
+#undef JSON_HEDLEY_MCST_LCC_VERSION_CHECK
+#undef JSON_HEDLEY_MESSAGE
+#undef JSON_HEDLEY_MSVC_VERSION
+#undef JSON_HEDLEY_MSVC_VERSION_CHECK
+#undef JSON_HEDLEY_NEVER_INLINE
+#undef JSON_HEDLEY_NON_NULL
+#undef JSON_HEDLEY_NO_ESCAPE
+#undef JSON_HEDLEY_NO_RETURN
+#undef JSON_HEDLEY_NO_THROW
+#undef JSON_HEDLEY_NULL
+#undef JSON_HEDLEY_PELLES_VERSION
+#undef JSON_HEDLEY_PELLES_VERSION_CHECK
+#undef JSON_HEDLEY_PGI_VERSION
+#undef JSON_HEDLEY_PGI_VERSION_CHECK
+#undef JSON_HEDLEY_PREDICT
+#undef JSON_HEDLEY_PRINTF_FORMAT
+#undef JSON_HEDLEY_PRIVATE
+#undef JSON_HEDLEY_PUBLIC
+#undef JSON_HEDLEY_PURE
+#undef JSON_HEDLEY_REINTERPRET_CAST
+#undef JSON_HEDLEY_REQUIRE
+#undef JSON_HEDLEY_REQUIRE_CONSTEXPR
+#undef JSON_HEDLEY_REQUIRE_MSG
+#undef JSON_HEDLEY_RESTRICT
+#undef JSON_HEDLEY_RETURNS_NON_NULL
+#undef JSON_HEDLEY_SENTINEL
+#undef JSON_HEDLEY_STATIC_ASSERT
+#undef JSON_HEDLEY_STATIC_CAST
+#undef JSON_HEDLEY_STRINGIFY
+#undef JSON_HEDLEY_STRINGIFY_EX
+#undef JSON_HEDLEY_SUNPRO_VERSION
+#undef JSON_HEDLEY_SUNPRO_VERSION_CHECK
+#undef JSON_HEDLEY_TINYC_VERSION
+#undef JSON_HEDLEY_TINYC_VERSION_CHECK
+#undef JSON_HEDLEY_TI_ARMCL_VERSION
+#undef JSON_HEDLEY_TI_ARMCL_VERSION_CHECK
+#undef JSON_HEDLEY_TI_CL2000_VERSION
+#undef JSON_HEDLEY_TI_CL2000_VERSION_CHECK
+#undef JSON_HEDLEY_TI_CL430_VERSION
+#undef JSON_HEDLEY_TI_CL430_VERSION_CHECK
+#undef JSON_HEDLEY_TI_CL6X_VERSION
+#undef JSON_HEDLEY_TI_CL6X_VERSION_CHECK
+#undef JSON_HEDLEY_TI_CL7X_VERSION
+#undef JSON_HEDLEY_TI_CL7X_VERSION_CHECK
+#undef JSON_HEDLEY_TI_CLPRU_VERSION
+#undef JSON_HEDLEY_TI_CLPRU_VERSION_CHECK
+#undef JSON_HEDLEY_TI_VERSION
+#undef JSON_HEDLEY_TI_VERSION_CHECK
+#undef JSON_HEDLEY_UNAVAILABLE
+#undef JSON_HEDLEY_UNLIKELY
+#undef JSON_HEDLEY_UNPREDICTABLE
+#undef JSON_HEDLEY_UNREACHABLE
+#undef JSON_HEDLEY_UNREACHABLE_RETURN
+#undef JSON_HEDLEY_VERSION
+#undef JSON_HEDLEY_VERSION_DECODE_MAJOR
+#undef JSON_HEDLEY_VERSION_DECODE_MINOR
+#undef JSON_HEDLEY_VERSION_DECODE_REVISION
+#undef JSON_HEDLEY_VERSION_ENCODE
+#undef JSON_HEDLEY_WARNING
+#undef JSON_HEDLEY_WARN_UNUSED_RESULT
+#undef JSON_HEDLEY_WARN_UNUSED_RESULT_MSG
+#undef JSON_HEDLEY_FALL_THROUGH
+
+
+
+#endif  // INCLUDE_NLOHMANN_JSON_HPP_
diff --git a/app/src/main/cpp/libcxx b/app/src/main/cpp/libcxx
deleted file mode 160000
index 12c8f4e..0000000
--- a/app/src/main/cpp/libcxx
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 12c8f4e93f196a700137e983dcceeac43cf807f2
diff --git a/app/src/main/cpp/libcxx/arm64-v8a.a b/app/src/main/cpp/libcxx/arm64-v8a.a
new file mode 100644
index 0000000000000000000000000000000000000000..4cb0dd5b2da8119447fd8c96f82bb72860148020
GIT binary patch
literal 2045696
zcmeFa3vgY>c_w%Ph!P1(&e&EWn~q6}cBU-Ka&YlRMjnEXs~93JVM(l$_3q~I;@$(`
z5clPKFK}_~*_B8qS&_7-qS;htR<#*9nn~4&6>Y7nygSCMRi>5k)~uXV#hI$q%vR0l
z;mM9HCbdzb*n(q3`~BU0-jD9{0+<a{I3jRP_y7O>_uu_L`tR=hA1=2mD}R6ZXOFu7
z8*%)}e|P@>=+WZz%-F~@6}mWFC>&TS4F2&y*?Sauu<zXO6at^mzEjv2^>lu@u+My+
z_=CbemFMc86!z`(^TVTseF4v%civm@Js+Gc+)2-okM91{-e0&g&2#PU!kxF_bJqvI
zQn>5r_}&x3gZ;m~zu<cQmotU^xA}A6o_|s}@Zqoh?R&oP?+OR@o;@Dy$-tfr?8(62
z8X36f@Bf3s-<ao{zgD=%`F!`E7w&OB|Nbk5d-k3^9_-1$o($~Cz@7~3$-tfr?8(5M
z4D89ko($~Cz@7~J|5ye-_{>5f^XJ8{6h8Pj_&M~!hYLIUeEQYGA$l(SPCifP4+@85
z&lkIeL$c=|KUFvs^!$rE3Wrpl|M>3;hf+KrD*S^&qUXN<weX?6XO9ON$iPqk^_jxo
zhUdfm>B4RQ{K3724`=nf`+J4MLw{gD?_DSyHlIUp6b{pK?4yOl56%`2PuyWYpZq}K
zaL{w^YlXw~EWBesEB{U5aM-i4zi?Rg{3`JN&o|Ycul;i2Fg@RRGT-Nq(55V(x1TB;
zz73xvM}N7H!J~clu?yYNqIPcX)am(o?c}LB?Xi=eE?t;EdAc;IX`N=fJ9qxE3mSf}
z>7CA8rBW)*<5^!A(JoAA3tAxxLb0f6Mx)zqGB^NJoYGF$%AJl;IayntZ`O=TzvKsh
zZn0P*6h-aAqy|J(al+{8?Q*x-*1GMo(e2FPQ>i#nHI|n2w%(}dTDRZQON-I;Ol#UA
zD(hXXRc?2UuF-6qnp!VTjo`nz5c=jTUJ6Sk6diAsjrJU<TP&3>OlkN5y^+{Qr-&OJ
z9f+F^##;PYY1Ugcy{iXuc~OnaGa7GBxh9|jq_kPyM$K2ypQRFKI`Mr}dmQK^TNETA
zy&fb4PfilT!QW;Q(sMGCD9l|#OfK(~gm8S>NJzO13Bi+-gmCb;nS_*`5<(Q_E+HnD
zcS=GyzHB69Wd#y~CnpKv;BPYtS#e4TQJA}gm|Wf|3E}v%k&sRY5`rfu3E|*xGYRQ9
zC4?x<T|!JQ@05gaeA!4yw+jiulaqvS@VA+Sbe$4H6y`1=CYN_gLO8x`B*ZWvA$W3<
z5Dxw}lMurxAw*&B5@K?BrzC{q%SJ*jU4n$*$w@*u_}ffEE;%KHD9l|#OfK(~gm8S>
zNJy;)3Bi+-gmCb;nS|7w5<(Q_E+HnDcS=GyzHB6<UWbI>$w@*u_}ffE>P`tE3Uikb
zlgm3LAsk;e60)%Y3Bi+-gmCb;nS^XOC4?x<T|!JQ@05gaeA!4yzYht)laqvS@VA+S
z^qmqy6y`1=CYN_gLO8x`BxGp`5`rfu3E|*xGYMI8N(fPyyM&lr-YE&;__C3ZY84WK
zCnpKv;BPYtsX8TuD9l|#OfK(~gm8S>NQkaOLh$4yAsqa<#S!#E4r{yWtE*-^)%pmF
zwzPUZ;aZ?IL0sYswBSGgk*$ZPUa94XL;L&eg>G?lv0T;4jlNbXce>-fm2$VVPOG@=
zo4(P~+eTe)bj!8k#L`-$TIPRrwDn?WRWH;tBOD~Xj{#9sTlkC@9>`nx3=$DyK`TWr
zO^=RgT4iHHL&`wisA!F5*I4Rn&4yl@|IAs&kI=k_;HqUfg-TUx#$u(_G7;CC4Fg#V
z3ROptV&SUVL!JYxXC!Ya&uMUS!a#DsoPqbFqb?3DmOHw}KVpC;VXoj%ekk4Sad0*#
zl%YM67+-Wxj*X*7nvG7ky;kXJi{*CP(A!$Mw%lwR-IY4tboA2sTBJ0LA?1cDuIpg{
z=Be+2DFpsXG<XP2RR@L5ei#4={7CS{(N?Wo(N~(as^0F5YQ<<d^cEkDS9~m9@$q=Y
zC*l>Kj8}XrUh(O8#b@FaAJd8>(dCgRgh{ZB?5nl0QT$T6G+&9715u%fNu13~#SyA$
z<uoA$?UGV`z^NL`$oMkBDAPGPPIT5KbWV4hT4kl&?tr2TBid3VQJ%upIED2%g_mf4
z8fA28OU-s27C>b6;<WZity%6Gjb+Vjkj3k{b2MK}`AcZcb-j&h)l#tp=ZkPon6<UG
z-dU?bdsQxsnHhX;f+RCxF#z9+zM*wiV2fe?vB`@-Ju1sj^!CV(^R2pje2YLGmv4GZ
zzIoUlAg<BUkyc(uvzOP&0C`>38%SBLX|1+iF*>ePQ;E<<H-Bt202vLAtPy$osp{|M
zXhPHXQ-qKvn^$7?Qv`k*B+<=}(@&`odHN|}I7Sm{YTHTeG;|p(&~>3Tqt%944Q6ty
z*@KE6lh|LQ6WY&v$As1`FCw#iZmERa@W<O#qfu`6wO{0~qw!0?O==ff7<d?fsi8r|
zWl0>s#UyUBveIrgn#Ivhzth$0TBX*ktd2FBJ<|^lOW_ZyHv=u*MGQdemd>Aj3}#Dl
zg#FoSB3FOzLJ|4)BieLz4e9onwB|N2>?hdobLVQs5+2HyAE7V~{TFFj1kznBF14F=
zlZ0q@#s<*U%T>fQQZ?M@XkZ`Us8a1fI-^**IE?{RWm^lh^>W)F@h*-y;t$cmhsf&W
zVaKmN&H@P(3N04b8ph|=bd9)3`yD3gYh9gI-y(Z4kfsTk)?ALNngRkKGyBphZI2<8
z<(6s~k`oHjrzn7<6N2+#9YQi%ccqQ~*Ypj9Rv1SDdW)H|*>UR3Xo5aFQ<PMKFSU$q
zEY(FxxgtD$D#+pr^5Ot%AXrw_rBtINh1IN*EPxj>4OwNQ<;*H(#}`8Y(#9eY4XQ4l
zmNM8`+H4rYp(?<Okn<&@QAK0ftYwtu&1h<@>gM*P(!3=4=xQ3@Kt)@IG@}B{@hV&U
zjo^Lr%~OK-(572GfL52Wwm`8QyyGGf-Fa@hVH5DJP8uWo5dnxxObI%Me#W#IAQ3u8
z8z@Gp+z3$K*6VOnledFxoW^>&W>m{v9iceHfMaz(x<E)z88SrEZae^J0<Ryh+T>b;
z;gTo|=eV%=OC1)i4xH6!e3;UONv73DZ6T$qBMdx3v`-iN_()%xgG3bq=_0*?zNU4J
z`1R3r2)kL486+_<ch(j=mA28cFvkHvL3r9&3B^=yfPZ!DOEd|&FdDu4&Nbr3JH2uX
zyvMkT(RubTRT))6GbpGgp&4W)T`f2rtF%y%STmYlYgEc>%PU=I^@`pio0a4jUuOJY
zIzqIIV^(3U)oq(f0hQbzpj*zLy&zcX`BuK*{5IJ@SV||;LJ%R;5?k%^edGjARo2?r
zyy~Hx7Q%cL92EM$iRCy5t-oS%ysg9PY4$WuAhQ=xaLRmb5$tO`7bH)sZOg>-0sZG-
zm5)ffd;K)pFhg`IjF_cPab(HBSYaMeak^?Ctb&!bzBT=@zIqG;09$jrD{Rg$j_B<+
z_6%2Gr@*W$Vgs^WugPSkLpmtRcp1eY>A){W-$GI}9qVUUq9E(pPZh0>7;QKiurljp
zN6tWHG%K`kd5+Yb%+i)X^t3RnLCmmqww!ll2ybcC7aOvPXas=gDxkVpq~Ni+(;C~o
z-7Ue3(rG&yKX;~q#DTNX5q;;5WJMIr4tEo`K*3~eQ7)Apzc8cCpT$1q$hP_U86Y>@
z$P((qFE%j|xI|#8TwO0?b2|4ma_*AJa;v2`s&;4`eZsp=Z;(#WjHS6>?6g^;L`TCK
zHG&#g9_W?ZRcj2*Er7QZFnHELGo=}fvu*VkPHOmx$BF8?MG1>DnB(%ocr>77@`$!*
zbg;m312ZtJ-9{Ov+Sy7ylICQnFpg+_!}z=ot7EB*bq?5whP@<FVo1X+2sNR^(wD<3
zl6ZMOkfYO>9oO0&S_iggJkwB9oJYuLcg>(+W=1n*G<`)3A~EG6Bf&HKKz^k2=tNaV
zm?P;NUE~HK)(k7F$f9YLD@M1UZ4ba=Z8c%91#me0K#p{+ng&AFq-<Nlc*Q5Vz}CbV
z2hl<?W$J5Y!es^)Ol`qh$QCFqT<11=Gu2noJSXq23lmFBCe22m#3GykKb0GqEcvY6
zF85(>_Tbtymb)vK9uUTNh#``#p=BG)JA=+jiQ5r$SU^BBoA!CV-4rvWWK?I%TvCB<
z^jc3ZuVzPsL@ed{A<OPhPfUiwk(!v;qLWVTOjK%mxqTZ+Ml#u@IC`g5Gmw|JMn_J~
zk+SodU1Yd~JAlk^nQ5(cR=6I1Txtqug|s-rup)xp=)!f9S>Q>~lGEw*c3ERxco7|t
zAolY!z+Gc;hGcGjxM}6X96iiDG=w?g0S1v)U#lS(c|6iD@lk^@`-m0$I8C8lg~i_h
zD0Tn^!E^*h#4H(Q)GI)Vj^Zl-kgoSAz#x+gK0Jl#S<ZWO%7Y&uqCDlrPP2vuQJ1?K
z(1#Ic=K0~`jTz+&4ok(81Qy$>e#SDXDCQ=K6Z>g`_O6s0$V{)mOQswE(>IUT*ktbW
z?uIFn(fl_w+65z#Ey*~$7;`Y2u14vLX8Kg|I^Hi)B;^FJ)34Wz#;QxGfH4q!3>S_`
z{WQ&94eVF3g+JP%@R6A`B;^A{E*NVsk>qV`4(x?{CFV9OnB&D7$l}n2UVn>7R`~Q8
zrw?Nwu-kyxGS))#5)&k%Va=3Fip1>nb0NUqIAce;V}k<%mTwZo(v%%W4xL9P487x$
zia-o;M;+-^EK1TU71Liaha7T1y=3CZ*TgEv*JJwU?AgExR+yS`TZ?EGUxcOQBCHlU
zmqxU8L+=Hzk4O@zd{mFxqs<!7vF6Sg;||DO28feOff5n}HryQqS`DlhKt5dE8aC<2
z0FF79#<50`b{FilRAZ^Ynu5^XYaY_mg2#Ya>S#z8#8M&R##!<kl;im1uGYhbFywC{
ziE}5xV?+e!@L^rm=b&KxIP>@#s2r3<YUlA~z;^6yts7Vb!X7#oUq~ZQ(8ms_0<oj?
zdsem&CODC0lx0t2WO1l0=_o_Uj9jv!TpY?^xI*m3s+i9xs;BH*h<yjEFm94l!UP{W
z-Ew!$Eh#C1Qfy7=`W&EB<O<o}Eys#p7A_^JXo}v}Xv?^=R~T2b7AI@Sx`o3DG!5F6
z##5Q04}d=P+JR5QGLM0hTv)aSTN7^3!~m%m{&L&~%+R_rgJD}7aaWBvRp`ccv)R?y
zC`<+da>hVd)&n<9<F<*`cNiR!BduK)`w0?((QDW*faPY}N{kDJ1`p&rVN<|WtA`ST
zn6^c<Et+G?OAO0pWTlK4ugIcs*t(IS9va>CwKjf6HA-2+nlpi!tDmb+j+aUm%4b-Q
zn_9pGZemeiHX6xzGKP#2UQ@mO+*>!34cyC>G2I70C@ax3E>(0{gqbo1Yqi~H!TKhY
z))Mqq{1xEhB<VS^A%{g%9fxg%GAmj9>9)&m32k2<d0w$okNnoC>h7HoJu-u>m00wl
z9KeoFDY|r|N91Vs0rHEBH0zPv&#Hz)S}N?u5YnB}WzC>EeDyIZ$RAKEx_JQ=%;tp8
z`gE|$(pq<|t@G6fm>XRkhg<Z=RWxB}?WsBvsLRWGDLUj&$K5d8CRWJ=QXF;Cij*k|
z2zXNXB6;enFJY&vth|%m#bv9@V)kev$8&9w*`+!es_q4R88>)-ofF0k-J`>mT=c9S
zfPZw{s_fmC6&qG@j9^)5%%zY#X6V<TTaJQ=n|1;85||o3DV}<HRfp=Ky@;_JJkEmp
zv8z#FlmtLww_fDb7QivS#V|HSh_>k)$Wz3UTXfw?J{0HHk$22fko@8pJ;H1V($QrX
z9mCE!31w3)>}54NIwy@<5jiKsCEEdBO1GnIafJ5#ai*y^KzTqrF{K)O4nT=#1SgD4
z2kw|iLA7L0+5?!0_(lP%3g06l+mqv$3OTBPIx;;FszI%T*}@YfLhD8kJC71A1}V{S
zr0&|Lfe~tZ+5;E)87z|HXHqn|HUud$huGO$TS9b<qpTFJUxwsWpidg`eQ^K?MT8|j
zB4sxlO}<4Xo&^?IQ`P#K^5K+BOw*{qj%}J+DjPKzjUsCu;algbOz?sXY&AzR5^Y#v
z;m%kFoR5HL+3^)8Rdu#Pp<5r?aFO>xk<JAE8nSu7szFvDc@^w`l<iLO@eyr8U#I1q
zNF%_4F=5mf*LY-Bo20!?SP-Y0;ckFcbrMPnHB{wba)WKAQY{WK-@wLgoQtE}l3uf2
zm3R>r@e{2$r704*Y#_RYzz$kLye`c@vhLvac`)8kMJ|LQ%G9t3RcyU92g?E|GCHGA
zV6#e()7}`_mSU^)6q&Y5by`aVKhz{}oNe(Y{wbDcTV>VDkHKvvhXBqvE)T`gsyGY)
zD@+Cw{9(bf(6y>ejv*{SplC)*3#&NM={G7`4@X17r>h!G+2yA}^S*-S51jQCg=%K8
z*{qdot(CH3g)xNp6pKzQ85??4vG5qq$5JdhjZ<*={xL;ys_9FrljT^mqFQvKZD3Ec
zBF)8-PQ}2SZ7kuK2sN^&ag<(<4p&qxKSSl&5kZO-rg#Omzg9utO?Fm|R!_C`6b`cK
zA`@GYmYFqdjcnsUWYyLdi{<L2wN7`*&}*tPHbdNuQvn;A>Da|MRVMi)q}c39y}5*G
zMzJ)rvtkrqZZ>H`RD?c;-Kok&5fD(5;>ksJV3=a*QLKWf!5wR^sWxl^$MrT;N1bKM
z(q?%w3^TN46$Y6DeHNyv?8F93txH`P8avp74wFCFo-awwU^xVtSuBO%G)~5%jg8`j
z<)h#v08CWT&5APQR6#{cwki~<8K??qy0x|#+ci)HuI4$YLc^AvMObB|PUb7o=h3Nx
zq>V3tsjoJ1hX<XYXAOlZdW)6FQndXX8&RuC&YL#AgkR=n>Wh@zLPz{%glCG{1A9|q
z>8g?qBTFl<!wSv_-eiXYAX!m2*;!nxx3YpZ(Se_vDKKoq%}7pXI<2)Xd83t5^!XjC
z9Xr)oYh>D7(3cf$6VzDn?rcWPLx3lG*+P|R00e(GBbCBK&KUvY$4Z^ginfVm8d#Dj
zhbq@-32~W@7$4X06KU6}f}Ch&OdpPTAo{W)E<~M%#=})xJ(;ocV=69h#mA83tn|h+
z)OgH)uH#;wtTe&o2I-XyRRJyo(%bMzWrqr@iq*tghQMZ8q@^fsmeK41_GPOLrs+Ne
z)?!H>%9!wV_!3NrV*r)FR<Qhj1kzVa5?fylgIFUA#}Mh2DB;M0PO0ZtR3b&VpbP6G
zS_9YLggeWzz@-Mmozl#xlKHr5jZ@Y7N{okgp=?XCabQL)Myo;ru^BlwCYEYALqTSH
zDG^6Ew>(00K}lyJtQ;QvFlR7<jaVF2mnj0vp)AocZAx6l`V%sa>LD`@kxmh*@cAIE
zumi(+N&jOnfYHFbj61C8$}7EVRIF_Kxy8VP1F^D8WP7^XJSXtNly-hWVt;w624f-O
zJCST23m~2^&otKRxOK0BJ+F1#MPxUq6O3x-8q|$!5N!+z?~U$m6CbT+<M)QK+YORL
zgd%(6(ryzkiJL_dU)ycsCC5ZY5?|kK;x|$Z;*H%VzMq2l{%#W=ecxO3^trU##7Eyh
z7fpP1w~5zNh>gD6#LLdtkDPAi*OQPxosku!kP+>*#Dd9XfX+)|&Ps+EgCvcI#{!iZ
zS<Euc&!FZ^j4;}>Xvh?0=^1o!vMg+_#A7G8EXbS0k<ZPxUaCc#gKAPa-ooNsCXOXe
z-N((C*{}>}IhU)QCQ^H|frqs`w&o*S@=@x~3AWyo4bN1<t!hMd^;&H?6QU+)y>>Zx
zX*F62sZq+o2QLvT!H<rWWD!S{V8|qn7>z?Mz7Y*WIgTg+!;@arBX&yQ9t&T@5n?0(
z6E}{i1THOAG2@8QG`Zu584L{pFeACB#f~IKH<!ap6-iV?kRXyMg)9m4DakZA5FKzc
zb-I)qNtjEO8Z`?;N{uAUqe_h=;Gzmf68caDBMCyNf{}y+RKZ9bb5$@B7g-gI#937Z
zBfb1j8Bm1Bkion<2J=$Uw2U4r6YQ8Xg?t^QhEI@9*iy6!C4`aD#_lEYr`u(~KxT5b
zLed7K;g4H+v{6evsf<EJ6mqNZ^kd;hj~bHF2-b0ZOFtEJg*<ZoS`kAQ?3P;?YQ&gJ
z*eeZe+)K?o6PkQMJQj87=@O=FMy*sfj1^nS;iYb+qG{|{M(&ZQyDnzyVOOhEw&W0G
zEs{b=l@}k`tjH1Ui>n2LlK75_P!i<D2a}UgUVJd{q<Qhd(42YkJ&C!g$i^J<;)7|o
z5M`Dk7>p-zUVJdP<azPI@RH`mhe1o07at5QVP1R$FeF1}B&UwN_+GRLpeXo>^Wwvr
z3nRNy%7!*8FFqsY!Mu!{7a!b8${9<L7at5PVP1SNFh%w4Po@e6moP6r7?{Y5?<LBM
z4+fbqFFqI;(TBWvqA!!76?OtexObsAX05#VjK)RAdGW#A%{DJS7)P?a_+VHm^5TO5
zT6ysq^%`ywPns7WOkl#i_+Vg;ym(1mQB~-zy!edxXXnLB2ozBqGfOqNy`iCtp6T^R
zxMpe?!Xg(IhDfhO35UcdQGy}${LJupG(*+H0BTgp_Jk`^rR=t=Q6=+n)u>X{`bspp
z*R$d+m;{fFM0xSSpm-j8lDzmRc<$9KKAvLd#Y+$*Sj~zaAfb8j)_jn5#z~zQAIy@h
z)5wFd<dPR3jB4i^Bv~+wOwjA@Hu2HRlnL_Uce_CnyCJeSF6}n)lDJtU@wMG1Ua~kG
zNql{`iI*%%M-soW+r&#2!Xt_A?>6z0<@ZS9mv)<Y$)bNG@zvcXUXp4MNxZ(>#HY-Q
zPeOkDy!c=&3G(720G*e_b(Q=Jo)<53;$wlzjI7|i_{<FIh`e}?Ba4REiR_v1*a<ER
z@~pggiS?u;07>%VgXLS~#b?4YM_zm;@T|P}Ecl-&FFu543G(8DA+a2&xOwp*pt8z~
zj|87VUVJe8EaHewv7bH!Lnd*=XdG&B#Aq1GaYPB2q<Qhd+!JBR$HEtJ#Ka|`DsCK6
z30zvLV#X1pX>!LAqgT|Fc$PFTKDZ;3=fy|COBG3s=BJf-pCFPbg`7p0H+EipC?h3d
zE+uIJHPHblGqf({jhdk%1tST#s5VLx`cMTU2|}oXk%R+O!AKl)RWK44Srv@LSycrS
zH!nVPI0PSm6T>TsmQ9uyuVz|C1G4hs6|G(gv?O`)!8{a+>zJHV=EX;XPhu0=i{C~A
zXHbS5$4pv<-7!M<JI>LqF)$M!$N5Uos*#JnNx@6(x1?Z^>LjRsEZlxd3fwea7*`^$
zd2!@E#pC%H%xd)nvIMXLPhLm*0G$DrQ;#G`B8k^BM<R$sA1Cd2JCP$N1nKglrmYj#
z!MLcC&itcXX}pLuc$!ReML?_3`5-WNI4nhRr!?Md>FkhXHG7OMK@Oczm4U?}Eo}Ju
z`&D-Kxxm`Yh9PmFW!DB_B}I1w)R^>YN+m#&=}`#=)2Xuasg)ophc2SIqm<65L=djV
zYT}L=N%pf6DEWpHB`~J8&V=9US_~J<v5T?j(k$F~*6CV@9%jNEx>KGGMbYZbYBuav
zSD#93SJstE(CETowih<L_FB2kiii3{kDzp#TZsp$@|u+}q{$<XXRFEQt)w=ZeAY+`
zITim?*k)#a>SrQcnH1n93M~a>(G?4_eXMCvh?skxD3k-}8MH&b6*&zOX%2823tvS{
z)4-R=X&TU`pvt+Q3XAgkP%12{ot((aiqXl5;H!0VBG9orIT@C?otzAdw3F4`NtNzY
zgCyxVH6ZF;qzF&BGZf*evR&d&$6&hzk{a73Kw`691}`q#W$-xL7ZxH6AYtFqXbL~z
zpSYz0g(6%jpqRp>049SIVAx40))6okPIEJuN_$PN1ur_p<yr)k2oqN5yzu)k85wE-
zA}ENGp%kVSBQB~l)4=9u{P?8G>fwCxdPi37XwwLE8p}!AhpB+O4r+=wO3k5>BrLAl
zs6=Ln?DVOq!DfncbmUn|z9JYG_s!|fJ|;_nP>GIGB~%8+MW|0q9t&N}G-V|G`e3e<
z!y!0UE2A&$%?i-z3;`(|lHr}luvp?gOo~>!%~Ud6PMy(JO>T&>lG7?tBnlfcygwZh
z5v&iT5d0F6GoS<#5lj&P#g~X+Q11TAB74mZF_uI`k{G8y<3(%1PI)$kQiNIF!>V8&
z$M{s@U3A=D%Cwm?&AG=f%r%Uz$`ay;rggeiqrujLC8-o+6{Eq_MubsI%RB(s#BueM
zvLk^wUO_<u89pnFSM+vUR;1QkmJ;S{DURWbM%s(rR2j&Lp1iFnBW*0oh}MSl%oYLZ
zvW1l~JMNH}aLDfBQs_k|(<>$6w}*rGl#jo><Ho1H`01&qX>=j>O1WK<%%ARhYRAO5
z>!`0{dPbI<nVt&qx#<C*wCL`sqkd<rr=s$5tdpI+m?G9I#b=5eUosKvm1Yu&80b~H
zq1QvBeG#uDLCDnyD$Mj$h|f(AfcPTTE7>9@ORn`Gvqen87IappTW)trv*DpoTPIq9
z*fX%yfUt{7Rl9rkl|ptGH=&;mb;*ioXU$lwv|3sf31Z8*Nph(<-dibmB^e;2cE$2y
z6MW*;m)07UuF-73v?a&DE@VTG=Hlp-MGy|4^Fp0}WIY0~1oD^#*+XljT~M5=>Xll#
zty3xs^uuBe7yL+4hi1$wji%OW8jY?_$J11zH!F-5=?F89DqcNJvui37iQ|B4wQ^U7
z!6wz|&az^8AzY*!g^MHArdDazTVNj@5Kku+u^-~N8iY|m=(fv^&Qh~o7ci7-PoeTk
z8J7@q+>!lkk&QV}b~2{3tU5n>B@aJ(arprVUVab^MSk>34t^-q!+p496Y-0PXGA~>
zCcb7so_X$lp!1Ii1^AAdC4ROgZ6mklrPBFJlG}wRD&2mI#B$WAMvv&pTC-BF=_rRp
zHUr*|WX_sKi&`{6sQ@pILjzRG4Q*BL_nPghl^Qq4Cbk&tm}gVrs59|-j)nr@c=j>S
z{Z&@;5$VD8$ha2yLP@)DhJMbUT_|ejFG=iESyErbxXZ1_*>0~~5EmyjjZ2%>!5wpY
zb*@$tatG=2iJs(=Y3M792c;rZ5o~~EeH6mg)mm-6#m=^}WqH0Lxf?MGUai?|l_~~c
zV721>rAlD3G0B?iG<mq!0dg~c={$+ZXmqq;6uc766U?H9>C5eM&6aMkZ$abp<@rl&
z3qdaZCYd7GhP+%5`vqnrg}^AW6bNnuma=W6`LGlNMU26<h8Tt2G)x6NQ%+5Q0g?(7
zyU*4O(=zpIO(-;$W2sS^fV_OYls{jAV)yxao*BzKCa(4T*$Nc50bAJ?<sD;dKYz9Y
z#cjY=wq-jPwvNJW6_dbHty%73RfPMLb4w|h>o!dAmoRh~iZD}$Z?O#z<wgVL_Rjgm
z^A$3A#<fani>Cy$34kKqI#TzhE@6$cEgkUBmK=!>m3$JH7&>f|{tgRHHHF|r@DpHn
zpPzbe9T`3l^?djVu)EJsS*QzMvN^oq;OZD{opvSKZ6~uv#2h>1VJ~Sl3ee2cN)Y$x
zweE$Y_W8(h4KEjqVioT3D~unuDjjHj1+Q0U6U6ArgBW&DLZNViphQUXf`Sqh6LLG3
zba$B}D8c@W2ukcmKd6Ql;tPP^Q_Lu|fG{40fF!iglN>MUP_{mJOx5<R&_XYLXknh6
zh_V~~s~QQ&qJI@40lUEhRnI*E3j#b$1<!pKn4s=wXTt>rKYJIrpzIZA!vqDdcsH1!
z>ceKk1O*><H<+O6amHstxS^Yo#|eF<;&DO)#_%`;fO0ixdz`)0ijX|c-BX3CzG9YL
zuHY-~hV-ktd0DbT!OhzZR&WnZf*JQvigny3Pi9eG$E9oHeJg1dwg$PwI8`kDWbG7z
zc2o{nX0VKY_hMp&`R0*6sw4fS(`ezis4jDLD|MHv3)eT=)fJXLYg%a(2~9ntsyDQ9
zqpB^pn`<qi8QCRR{o_Bho(NBl8U133T;h<!nQq~j7J`W6Tp+T8WWo9U<P#QWf<$RS
zgMWy4$RySfAvQ4E@Z;v32-)qh^r-j|IY^J?Qn-0wOV19oL1kGb2R2xi<ZZ$R6%#TC
zHdwagZNdf>iy|2tgb|6#ntR#8o?0x^B8(X-S&QY4J+aQaV~8;)R;;slCssze%GA2U
zgILA-$*tQgGbpUvc9<E`gM~$innaO8)J3{p2MV-nEcHq4VJFNo^)XVbC{fGK?on7t
zASQDYGe{S*FRttz7C>d`aj5Axt9q(tRhBqa&8qk~lbBUKxmo3~hY&KC*hBL@+9XK^
zEOl;bb10-scg7rw-vhMx7%XY3=1_c`k-Z*b4%xk~FnPo$DVz<e=1_c`k!%Pthjxt(
zs^(C}YzQ%jc8v|H=1_b#BsYg_W`vqU?g>$9$AnLbJ3RPQ&6r%+9b(4V?A~E!a5Dyd
z4D-Z3l(pP$m-|{n?`bu?vD{s;tY@|ZC7i_Ru2I($X796m*~oYI=TFa%cI%WId|Hz9
zm<D}u3`(ntohcf!?saj-d_FBL7DZ+iaVuoE0yR0>5=_-tlLBh+?oco;c+k`J)oQuF
zJ49d|5*tP|K|`aA?l^BymKX`)C1$(X8zXY;4w0>e6MP%p6-Gw*K**5{q|p#NY$|qz
z8K!LZb?l0c=0m7%8bwkMH3ebHZc}S$Rb$!ccC2YE!RDfpaULN?tPHv3VgXS{$##WQ
z168zx@nSc6BRY?eW~oXgM~O5C=n6J}X`NQNf&seo!xOd*2~$gNSKz?!0tGO&hya==
zcS8s$MUL>VG}qd@LxAW3oOQl?G{8a<ouJWhqy)s>VFqFkL<pOvcZUKTInO9C8f&m0
zc10uw6Uue1wM*R~n9$KH%|>;1m>`CQX+!O1N6?TM&wvZu>k8WE%Dx1|HKmS2FNWg~
zAAMrSApt7WG|I?vNI^kHjza<pvUeO35MkOS+<A#|9K>l&DxPElI`VKF5|E+lIONL=
zb9ChCIK*d87LG%Ftft8p<v8Tp8(BII37T&XP?_V9D-Vh)jzg{#$Q_4V(VJ2jWwhr@
zfSTiwFAXsqhkOZ9aUAlcK*@2)mjo5ZAzuoV9EW^KP;(ser9pH=q~oAS0VPDRl)=E{
zz>s9Z61#JmBE7Esi^}}jSj!E`aFcorTq5V_WkEHXSlL<&U|@O?z-Wha5gCxmQ8}WW
zE7v%QB*A>^3BIX%Tgh;T@{OZU$TwtbDDtg1g0PF;7w0*hTO28sibNBRP&4Y~8s8%?
z+a4MQqzgUSK{{+l>)_BI$y!?w5M}{WaxNtoC8$rnRb{Q+);j(AVzZV61nZz?$LJdC
zh}hz6q@+L^`ZA6kNCAWzv(zqEMDRZe9keFcYIZa_1<pL1Fx-<1>Jfr~mL!Bw%tE?M
zAgQE_fTWQws-IH2%yytdl1rBfB$afTjY%P01R|YunGh06S1*gX%K;?0bO|7drAyRL
zBVCSmB$qA+kmS<kXiQS+5+G7Ymjgm_=`u%Ja?J=bOdzSGi-4q&E~=kWy3BT@k}eZS
zD(NyClR~-(L^|m*A;gfbDckPS7W))&ovS3B!lGftleKVIu|zH$OkBwehZNs5i-r|X
z4#Qzl3*(4mIHZ_T84W14aGK*a-V7K_lnE;f;UriY2q%HbMmWvJ#hV?Y8I^@_nk`H(
zoCGNo;WPoI6HcMv<2$YaJa@oKEt~>YTHzF6G7wHj<5CN!16FF`bhI#~a0*E2h0_5j
zwQ!mfLh6|lM47O%5Ke-Xfp8L-Y=qNnTo%G<!pcH8%@(E?PJ)z)aGHSBg>#0PoRsO5
zAYYW`R@4*;tc&g#Gjd4TE`-qhRV2DmP`A<SuCRTA(KkP&B9w=ZiByqUx#-%nc8N~T
z_hdp-V~Qhd4dZiby4LEp=PI}%V}2cnww=e0#!pL*#zfrT!C3SzlF7>56}^oU1(up6
zH+qhWm#1x%Q>}6r_W<CgkBZpgU-TStPqewRgo4j5zwn60f6lY?-O!$(oql{{M0*XJ
zH?h3|7iTrwbaY^J-fOB(kx36V($j9=DSC8iqvQkz4+u5ZO_p0Nz2Uf-U|w)oZ_qU*
znz1zZi=8&zsA6<9T=9Y}X^5Zp%I&Isg#)EcPpp?~Yn0DBp_Rtz@`cic84W+g*3j<o
z##k|`r584M>mX(?uR|w2uIQCje%J*KLN*AzTvuaRY5o#PE4%zBJbvtunD`kFGKq<v
zZ&IO-JA+_R&o_hg>=~pNZwA2$ObKU@Ub-0sZJ5z$`RpYAPv=#hX8+<8l1DZC@OfpI
zdfPuggq*S&J=omy0~1Qu)XJLeyiNo!O8)sl6x;Fnfm?s_vF=>c<7TW`N7{X~iWz_9
znFcFrl5ya%3@Xv%lrFvG%8()Ui~f#kPl@XE5{r34ETr+<N1(AT(Y8M9si9r+_D(C_
z2r+H5(-SPUpYHhX3+FWaNcQW9xiIsd4b&guT3bo<;xFEZi(W5|=mpHWs-l<Uv>Qtx
zdnJcJA_IUOUj>1r<NurjiP<YcAk&@hM|et1i98~d$fryt@?XS|(@e!6NKPZPN4T6$
z*Y!>Z7a4VM@fF<x)`Z!Z%8Fu?IS<oN!)=;IHNyyMTVQ$+<|FSdS<&Xcv$4}?ERG59
z=q1T1Cw3)%OWN*m2p3y|VDbP%IHaifnX{qNB^Y^b4uzZhxVITWpmm&~Bi4K>GxbHB
zVU6v8UHOf9#pvqd5<PY7y#VYB5qDJM#y&><oU0<^Q&Oa{X+F~lAUeXq^0LfRKR$jV
zC4P7P`1m_#)>6sL84rN?6c}kK@BoleAf`y{$}sA!)1xIiNgzs0UFAtSqY7KMP{Qkv
z^d4MLr;G+hZLLPv7&;-8O6&9Nc047NP{k=xl7pgx(l$nuA++nqL6^9F0-b8>ta+*8
z9Gl5`%O^QEFst3+b4`?l1kIZkNQtoUy6%Z9ZR0%9Vv^#T!%~yth8B|)_iUD$77w_X
z#JDH6)WmqeDG_7egpzndbAgD7H1UwPkt&b+<kv|h?U@u9mH0SiBH$iSoNdEto0I^f
zdXtg`AJQ}_A;x%3itneUZBhb^N=*t_Q%Fc^5TryTU@0Uc5(rX!5_se^3lapRL?mRy
z1s*z9<AP)HgolEIrlG(n1F<=oeVGoY5@#JK63lg}o0R}(oMt7Q?@~1@A<nqXN-*c8
zZdL-EO3g}hcvixpl?r9dMkNsPWL;%9DgjERMw!ms5)SF=66>R!G)_*!@sNfC2~jF>
zz;0B6(U7)L2~esv$`Qm*I-r~&Vj@lM9$848?ooIwB3WX`=~4Sk!847LnH3Zo+;xP$
z%q8Z~vXkq2rQ2-J%_C&y9$a`qw?uY2O${NnW~EHUu#$MLK8D<u60K|T932+<3vaVU
zjlvzE!674QBdlt!2)KGRci1IHJy(n*Mm={tBSuAc>_J}9^jzbcjOwuC&-H4slg*;)
zu;Wi=QrHe_HV2M7py$AI0X-+KJD}&lciZsDf$cW%9Jp?)b540P#ua8#akPQw!E;OZ
zRpgnD&NXN$*`^*cSC-POr?c~|bI^X1<qn-YFgH&c(IADmz98~SqfAm-E3VaOVcA@2
zPU@QnK~ge%d=(R0KS7YxNEoe9DsFln_~0Z#pS=BU^iC5{CIf8o$ZCHE>toax5kS@W
z;)UTdrxM!bKEm8UlM&`N*s`L`12rLOE}Jkj(%euJlIAu$Go#G|HX(6t(>62WJYdy`
zn}FTSPT#SHsAQTh2Gl@uztJ#oeI?(-5w3*DxvJ?rk;0k65CoJIjXamZUsE>81=Yx*
z0m^e^z#dS(6F*uoilOz!Q}#tDV8tE@t}k6k2x$=N<<lVbRhfVWsVvR}HHg>Cp+T|M
zc!C?0sE7E%PCgBC^-y@&g{}f*JIRo8sdW&$L5?g^WRa+q#+;T!T#FMHO4GijFw)Ep
ztW{-#+L~Nr^0l|)e2wplMo*kBpUbU;yj_|AwZ+#+yO;|P0uYwgWx^B3B~I7Kbf^<H
zGQMk`StApmR&1mh8?bs(Vn0QQUjV3tM96HQ7(_VjnDDuxRkH*4EWG2|*CsZ!+QD_a
zpdEhRO}FgY@r5Ebv*OzEN$qjj?p4u@sY;Dv6cv6Xp_=u{v;$75R9`1DYot*s(R-s^
zy<(z6)Fno(;;2Xr#tA^pdO&vY`LnSa9RZIEMrwGj%-*b^Wkj2`+Tu&aO--l;+V6^I
z2;1jNX9(Nx3ug%2@5^Qf+!vNf4LT&}EOWTRAkG%9?Kxx)H!FG_%R%v1J;-ZK-7*IS
z$&A9RC`h(wl_d{|f@J1YY981*+RT7R->o*ltTaaQW#~-$C`|%)7UP8B-$fa<@b8v{
znl5C5BaSi=fHX_E84|FIB9LY&I2#U_ejI{O83Rl-OPQVo5}!u237${LHd3p3N@j?p
zl(7Dp(KvqD8L=5NeBZOnOPX2h=vwS16-VpkRULcEW4n#TBCEMvYc7_>dHymkB03qT
zIC?AkbTZL?-m4=@4y<YylrJD;3L#N(ih*Boxrb5eclK4o1d7Bk!a<RevurXicVFH_
zgwrr2$E1jE9cP!{DM>(aoR;0#Heii18+qTw9;K5)I<20U4!xO`GVX9-dC54mX+%>^
zb3r+Nvz_ej2*C@-;CA7W5~zPpU5@#LXiht_!OTk+v0m70XrI^HO|7$1ZtGRGF$)IZ
z2C;^|(bbG<bZpa?al#ffAm7nxKEc(}h<R*$(#a-(Mw9*FJsVJ|I6|jhH0v#N0L?{+
zl<^;$G2%fQ1*C4f-00AON&;5oyyGK>t&7C(p47`JF}tUycF2b-aSL^%N;!ZZp6;O|
zZxVG6jz;o!55bD;9&7);oN}w^1Z2SIl<GYd$Q2wFCd>z|OUE?IrZg`aIu~h7n`hk@
zE~{28#>`Ho++ZZ~%F$wOSEUnnSydc=TB^sZOGB)S3y^SEdx<edl~%LTJT8)oS+Uma
z#mB}g#lc2r=Jbpz&QOw^JZf>$uEA%UdDVu^09B)mb547uo+>g&9o}V?c~&)4LkTj4
zo~SQI&kR;+>2z(El+FTHQ6{dY2&lCfBg!dk^SHPzW<@Rni7LgxW=nx8D!Yb|8`X*q
z8Iaw?X0hH;hhvk;P0^j(sc2^eRLarH@M4os>%LaGq)XBP(Uld1B@BR)h(=eou!l|r
zp8ATGiJQfF+a+FXu{*R^a_Q@EwdCW5sK+N&nF99Jj<1OQAmS@zKMdzwDN#ewl@(NG
z7yu<j9bGvIc6&OFH;nl)d0geIDR3X{j>%P~$fN42DRgUz*tPmBA1T50=uE;U&dB9g
zbFx!naWE&&m!Hzk<B2vVgF&*9gd-@~WuKWqWTR`X(OEH;1f><aP!>-T`q<qPdIQ@9
z6z=Z~ZX&ykv|Q_z`yJdKP-!;SWrlt*91@(G-dOIgIM^jI{(~X0+Z*cT4HH~+sK|oh
zTJ%O#D%v^>t%h-vq-G4EbrI?oT6U6b0-<$*3>Mm6ykX#im|AGv&`3MP7Fst5Vp}qy
zb-_s`v@S>qh1Q)L6GMpH72Q&Frb7o3ClDhy&|o<N@L2Py8)j-r@_<VuN*)-=WyuXF
zl`y$MC6*@lxuH^b)|v%9N0x@k)0wrno$n&ZB~gGSq%^)rxuE)G3ZP@@R8Q-ZX;m+f
zG-BmypHHqB=Tudzmn^y(DZX+&<I1y(Gf%lHdgRJ5B_O7a=BCCaRhE%<#)v7ZE<*h>
z71K;}lbBGV+$5zCC>J1~JQ2^7#mNOK={)65evBnfuAvboPqF7IH$g6ma?De)Mao62
zU#4QuQ*JVoN|l?cG-Bm~<dds-^OUD;LGx5Z3<N91=BDYj?$R{w*Rf>7KFgcD(pZ)e
zEkJv~nzG@9YE3$7Ms@&Hw`@3It4%vW5aXCeLG@$HMF0?|NH`kBu5gjeI04WCXPX!@
zai$Y26mjikA87y_DHe(bP7vIz1p}nUnl=JyN-r89BTLz!R;8RU&KM!W5z|QVGt7_(
zhniLif}6Q;7-@wA05T8`BU|ABQ89%BNj#2ezc@L^w-98aQbJ%yP9TbUB?NR@F$n`3
zOT&Z#i7zf8kkZU2At1958|)CtO>6)=FR=mWJj8~;rWP9ll8x8^Qr2Qa#HF2W&UDT#
z;uxwxxruG8_+(o^kCYr$izN(r=CUJ*PANPllnkUtfXY;SO!BgjAIM>j@&oAk$qx-7
zTK%<_$sDeOqCXTUmjpN6<U<`qP%@GqfXZBch`iMDV?@k9aqVG$S8(Xj@}p=JhXK!C
zemK!-<wrotLVh@?Y~@FgmxcU54uj{POymd9^OGMMLYdD$U@gH-IsXVK8OaX_%3OY^
zk@4hbbj0OtO=}3?k;@e<KQSYCp}-@>N6p^~g`HA*!r{h|o^U9!r6&|r3h4=jnT_-y
zA{0FR#9SK>Ars&u1xV3;4u_tP2vM9Y0~sPPSqTwfWiLfUU?!7LR#CyQj?N}F7!Exr
zF^U-{jG!+wF-jFPj36*bjKUL>v2BiTgTS5=(qq$e=jz4DlC{4mUd^#lm6}r;-{rv$
zM2d$ru&NSP`&<c@P9L2zXBTE!*Q$jp@~vDpWE2+ZE}=ZO3oC3Aa}|~*(%7Z3%Y$SZ
z=QkVma!qSBjYe0NQEAu4R<IPc1@7)jbFEWuR6ANnZ^g!)ur_d$W?61yFO@<vs;kM#
zDhiC<_L^>QDGpx_^kH;Y43!$sJumFo4cFOkII;kHza5vq(-{W-dtM|t>^6C57i|Yz
zD%U#k8x~MAyk!9g9V2m8ngQ$Kh~hT)A|@Mt(7uN4!Fs!a;|1iXf=SGABTfK9>BJIr
z;Ia}UeaQ0Ol@fqZ-Z~^fh(mw0#d1e4!e66<XzBM7wykT^Mzh2JiriRAE0_caC#P^Y
zqnbv$k;~XCjyaNT`&qmc4+KC85KFaYSpZ=$!Y2Y!_U0irTE%gmE@?wuU+u`I%n$&*
zQc3_7x`(OWY;;$WlaLldg&I*tC)Lw%Aq{{^X-v~L5@SzMnPL9LG?<fCW|+n4p0NeD
zM+{3^nPG0HX|t#tu4Np<jZccvL)=|F%}lS1N4i5e<N$6Qby0>I>wjJ^RT!bx9#z@V
z7r2X!wz{wC{a&+OwNIACB$)gh8Pv21D3umQwDY*f=CpR<6#bk(i*sksUs{ajO3+E;
zy;4|1Vd+GJ!~7i5&|W}86>Tdrw?sqPaZ#Byv?31TkJXpK9OLK3I{`^~H424lkUna|
ze&z=d%I!?+?jnE(TV`M};;aVESepCAPJ0w{xzW)otrm<g=*eEWUDXWOUhMwA1)M@W
zv0kpNL5m|TvNTTj_>^!WvFuRdkkMcb?&yQT9m=<>*IRUiShNhechV|2g@N>$n}mTY
z9)0qDb6tRByO!Y-c_4u>`>~out|MJ3g;@bdM6j)IG2y_442C10p<$U>ofv)+Hrap7
ze&WURpP_+AK0~`lkD^a9fuYdRt?8E?*j<Db*e<u&IGKZkA{Eah!&U*YOzy0`JFb0b
zaz<fFcI38ErnHg=;Hrc8YJy6JLM7jVF3-G^V+*Q?wWtIYMHWWFnhA08mDeOV`I4Zt
zW=M!rq4z^-A~c>9sfzem=e)*04_Qi<dB7q&;Y~VXEK2x^t3mgl1R5@g0!b;cPIKk0
zjB`DPI&4mN5bVTs+lR0w=pNbmkEwu5gTSWiFOGPQ)t%~;=O8Ot+=?R=_7KzLjD2l2
zH%h{di43j{GDSPW^2q=TTOo{LY-NB_H9(X_S1U(?vOuO9G|B>(O0***JaP*>1EElf
zSY^~69-mrRY2bX%r~@Q3Xq8LUcLbwb;CBS2OYC<9qb2-1g^dq^ox;ZBzB`3Ygll8y
zvIJ^fW-|n8T#6#tZfW!hIR3dI0hQ7f?kupR*0}K-=9-3LO?mNgxhJ5Uk-4UxoN-x`
zPX2fjXx#W6l}zI%!jo9z#>eIo^#oIBe2i{^-w~89vELDlmhkTsw!|7Yeg|3uVW-+A
z)42B4CJ6!}GEJKbxLRBRq3Q%zN16Vv%n$)|>k>{{CY%Y1=`hB*7LM2@E%I2D%^ogD
zLBQD;7jT5BDbOY3y)YjfEl7Yw)&~K%)X7;pf{Y8j&u)mH!?ol}@mpsd)d01pjuM`L
zYpnUr>2iLDSCw)xxGE7W?d9;QNw5mmCc&!OD**(fYSOlfs<O5^?%GQbK8*oAzDAIa
z7ePBsbP1+tMcQ+kMyDP3R!JLb7gks!DNdN6tqEE_;rc5nVe&7aOWQ&#!e-oCW2^2e
zn4B{fpLUSd(5*?9>pitFl;YOnV>dx9HC)y`M40!Z+agM0rIlS5qEwhCrYIGiCe70=
zxBE(^X{ktW;|}P^Yzeb*)Z0oWEiqRrJ%$^uqYD;CL^=c()+ahG+@Tbsd<&^B-5BL7
zjcz**J^Y%FNCvv-=jVT`moL{^E9DsUSB+&OPJ5Y^q7Hv@BQAo)TDh^Rj$oo(gH*;S
zzl_X^mFV(T3R`i6-8-Xo4CL3z(ssf&-Xy9>J7A<0$=#;QRealSlGRkg>CfGeBJ)<k
z+I##uhP+Nt{sqo3k>U!fhj~1HJ(0GNtYR{ZJZU2VMxL`Fs~D1a!4rd`lGs8jB4Z;V
zN+C3lg*vFFibOWwnWAKc*eVMfL{^q=-NII?b=&W)*oT26sP4{{ijCcUN^^Yb-KWAP
zsPDd#J^=vtDVtINW~L1CNb9ZBMaiN1-qLAO1EV(y`Z3{(hDbdfSR)OAO4o2=cH@j=
zH-qCov;?(c-*?H8s`f2<HF|wXa1Q0H3p7LL0Z}#vZe&=h^c%xYF|R~<o;2-+PhOq|
zf+D3}G8vM)5SfU~D^_LP7Z-lY`qg)%A$IZ>6}IGIN_O3z$f~7bLiA7%AX6${zB<VM
zPSP}1Z3mmCpb@Q&57J<qT~a0qmdVYSq<*oU46f&fAVvA|=KC}8Pd@Y|(&fb_mo0Y<
zMac@Nl%rgEu}K?cC6l{vVv<E(L#oN-!m8#n$I#EweHB_wx{WxvraD(VcAqj^JoS|M
z;<>azI@GQ9c`K@8be-!T1EITK41BJ$<KrN7SCnC-o2-M6<dF4Zc+EsO*|8dlaI%_G
zoT2duDQ{_KesCy5Izoc0sx>tbt5RE?XC+8y4ZAR#s-veEyRd>IYZq3~+x{~G6xE?`
z%YNSWRsce|2nAJ=imb1aqB0Gxm!m!nK$w6fDpF$Zt-}Ee%ovMyj;yVCym%T8M0!Y0
zJn}gKX+hRvQ>WW(mzQ<Kg;bgoS~I_v1)(&>Fq$W!HS;6Zln$(qs<6{td`HNVO9veI
zD$dy`uWGGsTRw{1#l`w@#KsU;`SIQg4h4x0Z_u$Mot1K1uVP>1T0>#0skee`QM-uk
z^8y2FH%F7G77^RlYdRL!7!PG_3&K2JYgSfy#RxtI)hr@kj81;3f&%O!r+83zhIWnP
z0GFj^<Y>WQ>9n-^TGxR+G>%~vo?L6##D*3x;vg9!iz7e;Bf7(}Xk{!nO7;5r`StVB
z=0K6wJDU~SF0Yl_%d+UXSCpjXgP1I><dX2{$QDJ*9D_}&kiC*Etq{}z`Iru@CBrq=
zs<$a)qTX!xF$Ox#wRT09W<Ic5GY!2bgx0Dl897vMbfmFXt7#sTN)`DiSt_s9y74e}
z*zodHWD#Ir+oQXlHDDS?sP`L{m3Fg%Mbs)zqifbIdT7{`t1Hb4drf28oLMk2mv#y#
z4m=QJOb^3Zj~=A4TZ;HN9kZaz@XoJu%;B@70%~|UjO&Xuk@2-`7F|vQbQC>TYc7vw
z51C|wk!v)n`Ud96$Vpw^d>ki1X2%HP_6%&Z)is)pPFPO^ThzLy93LAKX;?dDQW&j6
z<djT_!K5->L=RIs9nlii)IGxY;5cMoO~@xB<`E(g$IR%TTf>olqPx8lwZddIfpn;5
z7c*5wTU=XO(%aTdMeEr{!{{0~P_wFcDs7_$jXa8R+=VVMdBYPiDl2QqU{PUHI6l(j
z3=R&>X~NLS5mW5W4X0Y@UFiS{hmfk1lvMF(IP!#o838aOxr`j0Qe#IxQ<#iPGi|Z6
zS2Gxc5yM<nydpp-$X7&dlTV?30AqCo0LCP9wosZPqJYuC&`ujd%%hRijX}LSY*CM8
zNvQ%#jg*6l-BbmTAq|ceTLrk;3{#(ZtTr-fbs)gVSMG|@2mrA=Are?3_D4cgWxPzI
z$orTEz6?qfsVen-0wAAld{v~;EBS1WxLiz&H#{+A0`U@kLnUIuOHPwHq!2LSr4@rK
z6K%b+*6tYVI)!ia4Vd)NwsFy0Lpl<DHB_4HtCX-ks!S^uDX3jlWrDM`oB__#N{x3`
zNYnx~ZjBc0-jCD#ka|)^gw#`ENk~;y=7dyNV^a}_23BBMXw3%pJDmSaeSUrZk@X9s
zTJ#)*+c|XdbJ&oL^t2&-7}~f~LZRqLxe6y%rKESDV(yANw52tif+~maEG?akL%K|g
zC8VAdAD=d*GAxR5&Rpoy5_uO9xE>BYuX1OVnB3@5Yz6;kL3B92tVoyMmD!iF|4X$t
zPgUt3UoCn`^{QoF2LJfW;HAI{x{53guHgh&jiK$;JuiLrL7ArrC)e}RSC44(lo8GF
zybY`wfRh^OsVbW8dFuyAEbtUU)eGGz(FOPe3b{B#oyB88;7_?y(K{Wx=Yv1ni&KH$
zU5io0QGKI@?Ob)e(Jj{k%RA616z0emJ`+Man#Bw-1-xR;3Z}^#?+SpV1B#-J?GC&s
z7VnlD7OvtHqmj+8t_my`iBKf(;nAXYZtm3S`FZW+sX6Vjlb<eKm_K<MS8q5;vb#X3
zc%>$pKe4cd_F{2BQqE0<bVBnLhuFt!r`4@t?Hp_4LYZbAeYI{>bP?9gB^$fwMkVh8
zcX_i9!rf92f+>u^cC*!&b%`4d`Xs;gbT=ybFoKb`tZ!&~yWMP~YbaM1s-0d{5Nz+3
z8{JNEgniZ68Q<n)5Z2jFcoGZ7SybLtuF|pvaEkiUIvP(m$Fc$P_^_!}wqbzwI<smu
z+%{v@V5i=Pi^M1vzi<ypWd-N?_Yr;WQk14<G$?Nc4!*vjSJ+J_P~~7}mtHfzB!P%~
zErTG+j(aXTc?aoJ>Ev+F(gjT}VD^G7a{<})E%NC)sFsQ)@5q<1(W%<;ft3}l_#lFd
zMZR#yGDKu^L?D0((<>KAAc=sC@k|Is5Yr;vB#z5g45*~kTLJZyJ1d~BVqXQ+jMY^^
z_2c$b5R7;o6(lfnbsvD&u0&i|#u}Qb4M<IO!)AKqhdAz>z=0lEsdXLigNcq_I&L>(
zrwIuw*@McOn*B6f5N4O_OZftnsP$#6jqEEJ#5+Q{51CE7?^7s^Zu(u!;O4=O@SSaJ
z3hEHHVbA2dr&amV=R+3CT_=soLK-BaUJ=Fmd#gsLPt@x`PF`=EVW5Hm<kEGA@awS#
z-Kb)<+C*5#f1<_V7DBR}j1%o8q-L;PdU>=7rU@;y=LVnqU=uPQ%sVTobcegcbLelA
zc1#E3tN~f~ZE=$NR)gIN`?J~AnoGI$gK4T~-h?UEge9Y$e;X!^Mn`XVF~B8B@;)V}
zB2LiEVsHZi{g;D8L4V{yx^oZ{)meA)C~~UvV29PA=7gO!;l(kBbmlm^98*y)vMDb8
zVzWaIVo4F}_&2pC8fD-V#_&3{bPny9EVo*^P?ouX?{p}U9Qt5F<MTt-0*kHo2u#ga
za+!TheTGE%yfoT4Ggfl3zRXE3p8;m7mYl4(;;60ZbDW1}T5FvZ1Z%L}BNsg*#ux8`
ztYu$Vy7>qXpWaHj2oJy8O_pDl%=|Z}v>fLg>?N<aupNrDOCHvP1>bhevKAdTiX5i?
z+$<m=mpQSXPse0kF?E|G+a2;5Blx6Zm-CoQE*_*gxCHkzCfs2Z=Eoh=gr?O2|3#L$
zC;?b-bU<S+Q>ob;vQSJLOSM}9k17XW9HC4)yWG(&^JiI3hH{)p5rZsF)WZaYM$vX+
zJ58kBF85iga7}M4cUP>tU|4>R^1xN3&<ZN`;u)HX;7wDF_#4a4SA=gGvT-JQMbK{P
z$N_;#I|MvtP)V@`fkCBw`XP2uNwo=qL8W}!V9hvn8kSj41*w8cirj*N%!732ASTXa
zJqN`$sTA2^b*MSJXHB?2sFaUnI;NsrWYZ2R<)Q^aeu7AkYA0Kfo?K`*S>v!mvX&wd
z>B&cQOeK>f(xcb|+_lJu`(jNhAE~z^J#5y@x?g>fo_u=P5$VZg@;4(rx$sDspZN%n
z8R^M`Er}vMiUZ1YMsu8VtS|{wV;(Bqf=`hi-n&^3FE@%DEVkUt5-ZY^3+v5DkC<(8
zWV=H?Gxp4rM0#QlE+P0C6Yj9o^5c$a*9Js-5Z1_Jwwp8~J-Glk^{@)ZS~Y(6ls{9=
z8Qo!tYQ!G*%H)E!FrqCKwGsl{7bZ2}n~`L5Pyol7k%ElmI?k$?WA}tnmNJjq@JJ2M
zUgJ5Q;loZ5WD}Xl%_R-F_shB@ZFC$b?HQ?Z(&y{Z$DR`ge!hp7rGZxtx<hTOGh`Sh
zfMG3v6u81DP42#|6_czL`Qo6ySW4N7NNq_7s(B)yzOLnpA$&wAYKfApr^81?Rv02i
zM3yK*MnqO9qDDkkIKoGSI);QJA|nJ5BO)UVGuS}f>Ee#H<x=!iPr<%!vrNanwwgWs
zgJYQ^nPXPKJ{o9BT|<?%F~<$|^OZ}H^&OPeA`6;`EXpRw)hI(nb{Sg7Brv*~gP@H_
zf*b{vn;5+a;(*wXM2!p5np#h(LtRCqIqWJL-F8>e=+?W6Mz`NpG@1hrRxL%c%2BYY
zT2PNH=%O+jxvOY2dRI{i0dBKa(FPlDw3?l0(f8QPigQnVz={;Jot9YrjqZ&^%rHU2
z2jGius*a!{>GF+rsmOMOb5#jf>`ap}ad;jRbZnk0!jH>yMX)AE)Oe0L89#ctj)M#l
ze5VOF>iDDLsI!7>bUMod`1~U{(E$Hn#|>z4s*)yUTRkc@+1+Vw`Uq!|I%g{q#pB`v
zVJRn|>})wMmX#z}R^nhW7sew-sk2k1XTZ7pW4zNVw@T;bJN}(GCYRc}j<g-NF<OzX
zF#wPSHr%95w%A$clF)^_&UABKZ!h8IU5SnAt~Jx5G}ooFQHxh?4d>i)Y?702T*5ik
z(e>5l(o$&yQI2V&$&E_(wraFX5>v<zigYp{jW6MsImZQ;GDsta)u(b9a~9_3Jw(n)
zj^Z?}EG$GMLwL)sk7$k2aZRm;e8zTw7h_`~9tPP_1I3YM97Z|{t1!|oE@z~ttU@#G
z8VZbb6cz`@#KRzC<cvBS9Yy6#v<u5v=qb6<z%@>fg-&pGX~8_XVEL*jK^NRsCr7n=
z9OQ^9r^5*<I!01y1boqoV?44=6AA2<;J7-!HaHTlEm&^2^gcOUyKw^QxS%#;u$eHy
zK`fIwi??!O9}5*wx0Zty8prNH@ub!vRgG=rv7P8~35;#z5tevH9%{rk@(4>jBTssU
z(l|eY2iJ+{%echCH1on&iHe>YqhsQzEWXG@r~6cKDtfcQZ60+%I1T7?YX(k!!`VkA
zgD-|4nE}TKIbf3Wmk=a}D2^PW8@#0i;@B;mr(DM=Yq%|HO8hIU1rq~D{WNflnmFzP
zhcI&9j<bV*B+1g@)!hVy56(#wyNOq39@9ZXoqngQ*Uc`BMQ~VcH@)GV7K&aXS>YU*
z5Up`DAiTUsqD`wcoaCZcF0Hmode=Phip0-dC!D%bXWy6(vR{}<ZzhV|Nd0q%Xuts`
zJkCLsX4O(2f^gtYNvC`Rjg!v-4W+3^v6oO=Okf_-O0{^I2?4R$5Ymts#F*nrk$I*H
z3N3DDH#mE&WXPN5oX_QGLML*0)v!5H)Qs|R!xaGYGCmV7gP{|ttfE(?OUt_yqhwrq
zMu6NObj^1#`7)kx!ubcY)-l}#V3rG*1VD^I1N0#yFXe<Aqx~TS#AZVXoEY4YO3ftF
zo%C{5I@O4B<CmI7LlOZLMJKCzw_I6KD?B=aBl)U5>{KS36-U&!^+rW{if6IAf@@NE
z3uZbsU2oxzAG*m9qCd$lN^4G6*V<*Ws^=)WH^F|NJ69`~@Qj%MVdo$}0y1>!q=N`K
z9y*GfZZ0Z!%aW#1T9~NQY3UVX35G2$W1FLKNw*y_#?uo1TBTbmLG?ukE#rZs`>xAf
z6N$b-$3R8HcQldH#IDVdQ59HgbOI+H8B6RoCm$8m{AtVC!HLyvqr6yS_r+=av~9`6
zXm^E8=O|7&sh3xEoZD5d0<Wj#gp;3xf(!CGYm5BgPYE7xA4z-2*Q?S|<*Sh|=e#Y-
zfotY`BK4nxdQm!C`S^v|ULw`rHp_9$v<$tX_Y7pduoHLL_>7!$r{R2;X_N0<y<{cU
zQeFh+lNdXJLua4K<xUL;HJd&R%ea7(Rh*`C&Dj8Ibj7je?sLfl3Rsp@aD8fLxc^2L
z<hov=8&p|lPzJfPN)ThD&a&$ijm1i<1xnkCP4r@Uv5Aw#pnX4IV85D?i2@EC-zcLc
zxGWgQv^oBygOv>=cd+l6sLk{KJsY`M4;RPjn$NWc9RXkI>QyY>u486lRqeOh3QiTQ
z>1|$RjH-0?cHL+oWZ<k}y>wTYpbB)^lmO$b;&?64(uv8-wdP{E*73j5mh84JuR-fV
zau7di>t<2*PF#5CddHY2+Ds_y*3lS*Ji)xR-w6`w{fPZmlpLe_R$IkO(w82dp!SUQ
zP86G<x{gNUHDk8XsI+xDf*(gbS9EqaCDg$ZTeK8Ks=BlYw>`RA3&;7FaZQH>OMqzW
zTpq%{uQe*=wdEBD5u&3113Krkk5O7)Wn-hfXsj1WnWAwell;?k>NNxxy6eAe^yoN2
z>r+rw$cXh_R1K)fW)CM;GAxYF<7;hi<zT$#n1G^%o+ZmdG!PR5b&LD2QOBP&Z#e!$
z*)hkT70>6YyL1KjWH;7YjtczZYTpYdMqb3k(prOgxo)((xY|-w;{`B@nr|soF{7Iu
zU@LIPJF#qrS<-&#o_4VUQMCof^m=K=c7JizVwY5~3+;rVLDxUnFR8<we><Ssg<Jqf
zM~DojmmG&rIDiKi;E001IgkbyunAz)TZ{xycAJH}{i01)DO)#t7-jc^_k*SXZ6??@
zf&I<~;CN@%4Q`7KC-}P!GvqsmzjrrGz>P6T80*eB@5x~|-e7=u?y<@IZWxRq*QwQ_
z6Pa*2&wS>h=`LyyeAjzh<_Wm_v}7lE_ZNY{{n9bMJb>ItMsa&b*=X=(2eT58V;>nz
zQG-VP@*1f^$G1`EmL}(Wr*Y+YUt}AVd??1vj2_>Y2`l}^^@*|8MX)&;_^35MxJb2L
zI_WfDI*Byjc_=hrd&$FlpD<W6f`|K#iOJOxdkQGJ-`jwEjdaxUf3xekc;Kkxe(xyn
zWRJ7F>%Cpx$vH=H*K519ho_DT-Y<3?FT)*`e4ngZGh})rmvO0S7k9i9L-0bEc{XIV
zJM@|Lj(4r~rwz$|Wsha+oqLEe<;nd32a2NOwGbf38yk_coH?dQ|2qoX=$NXs+Rec_
z+HCR0qSV$*)+>jEI&jzpotRnK!q5Kf(OCbD7e__;i^Kl#%_o{a8}ODc_-65~W}6Bi
zosKz=eQZe45sKq)jRri2X<XD|)VkO>N(GUG_X+$;m)#gFddJ?@^yPA;515N<%cdhl
zrN#ReLX!Zib;?V6w@)8DSMst~bnB&uEO8rBX9X9P*K{gHZee+CLlc)6n6JzQd*OsJ
zqNu24z#y*FY-7#atk7s$pUhVx?8hx<dfDk#YsR7t!|{%s9B!dHUZOk)>UhWG6k~>7
zm21dHFuE&s{6QTy;^<}mJOBUW_&EDgoR}IPVXrO@KT$gO$l$<0!TfKa@GlGYU*_9F
z;R7EVwEmc7zs(l@3MC&X6mI>SpLp{81Mj{0f1kkbA1yq2e*eA$-}&CqQ_rB-z1v^-
zSI_^|!NS&$mIt4IM;m(n2fuK~^KU=C@A>Va!qYz(y5sm?4h`P;i=lxVZx0o2{2c23
zaOmC}pBfta&f7!x-B=yG?>kTYWZ|v34;L1m_-_ku{r-c6g})lwf8)r$!dtUHTUfZX
zee&NLf38hGH8_0ziG71_ePp1paQDFM%=N+9nP&$Mu0DsqPYm3>dg_kC!qvgT%-;n)
z^lcbro){Qj9UP?Z2UlOZv#@YrpfK}u_)g`Y8{&W0{`|=F0RfN7y^it(=OD`7%gUne
zKK^bMWv>d@CkQs)6U=KUKY34KvWD_s5_O4Yg11=UWvK4lz`fV6-#I%|e_fmY__j99
z=*RbOf*!*A<vR;A9|8>e`xNMV2(W9fADMm-^nD5Sp1}JnD0dy@K8|niMOmVg@UH;h
z5zs{Vp2FXkfbTc<7bbt6XhQi187z*I%254Pz<!iy8U{^&s7;^y@T`lbm%!UE4;N<M
zCulkb+@B^me|Tj2EYXB|MAIV5T}Qcd__m+$;rFwwoQ;pZt)kvR)cZJ|PvbG`eiMB9
z2w)S9-$&oy8oK8=@!)R!T><P{Lw6s)htU9j;%|ceCM$P0D|Zk6zJfLpzX;DD$`TCf
ztLxwe_0j)cC`?^tax^=0VqpL3OW^OTki*x8-hboup`W|~IsWx`AfMkFC`|JAAF$rv
zcUR%*t)as4S0S&?@<;C~Os(MCzyJPSQ{Nl<(0BgzVBvj1b$>8)<T!ml{qDQ>kz5=Z
zII#K>=%sP+{ll~T?|0u_H~_k@-dTA1heHQ$oEUijt>;kY`@nhpC#lTv>M4}@KInaS
z(ERrP8^<9>^zC=??cKoxw`e@PiFT9B+(O%rqwQ}p9K)+Gq0ED<{6VYy_x>6%?<{=x
z#K66`E&|_i)FXNN80!5Y=q0-UV(0@m`mf(L`OiTg`uErN4-}rhS}6RTVPkdrfdj+W
zj}9F9Ba%PjH?{55`?(Ankimb9I!{4%&2|r8zIteX@#-Ox&!-@lRENv%fmP?XYp6rx
znA&C(uN~Td`Pv~Gmq!R5-d~065iYaNRg}L5xg*&pc+|(oFF$qYW5uT!u4|~H;oThG
zeG2cuX9gp*Jm9&?6KvF}nE3JCh5tRkkMCjdo_Y_*7uZ(Rr7`GgEAUa9s9s=us1Djh
zV^G8RnJZpD^yua5hfZMJtQNm?=z+^$Iz;rJLt7t3o1X=*Xe<!#uc8mG0WRY|@O%Po
zdKNMT`ky}Y-U~l^<GyDP{nWm~<o<nysW*m>-1t7^^e&Wn6aUiKJHD^*G`>BpK}KK2
zIC^j&AJg9-8oohedJu9(<MYdyvwvq_Vdl}le)ns?^OiRK=)S^t={v^3!Zm!u-%tMu
zWQ=fs1#)YT$M@g(9>(O`kC&iJ&OoP}e*Q<xr=VkIx3<6VfBp;7IV%{aVc%~KX@5j*
zVe~=1N&ZOA-UfZtXU7<Q_uiO8TjpNlbkX}S;{B)a?k&*to4;AO>qCF9VC%l^Q~x9B
zKGK0%=|9qaqytIctpNTJ=)nV|2miZ)w?2Iw|K3%2>*hm+g<;ZxFKJ(YV&DF^o*Ev$
zE_C1~`hSz@5b%!rUFg6~p#wLe12><*_!-39dIB;cbl|2(2X5A0I`VbsKn9P>kuJhm
z+dMc>*!1YY%~g~IFB$9;1e@!?P0SgaqytycH_(BsF40Wz7BR124(4@1KXl+`{fhSW
zkN>{*bw)qFe-rc*Ug*G0j}F|dT{-e~%x9a>foPAV12;bom_i3K{42mmV~Fr!9By6$
zt)v4VA({Xe`US8!PAWt7R{{GP(KHO2PHA61_vu*|O+p85dUW7s?bMO4LkDhR{4tt@
z4%~$P*~A=4I&c$X1?6mf^lcUOpaVhs>?U-eRrj0VlhA>i9v!$Dq60TQI&kv}+5{cQ
zXcz<yLI<K>3!B9M-yj|M+!GJb+!#y$y+4KiLtU5tV}0b%e~-<g&+s?K-T}~j^?d>Q
zuS8`+^dDr1zIpT?`g(Q~`fn5ZZ}UxtL+C$N-lPBC=hA;nmZ1MOz54He0)3$I*B*fW
zy9WLDps_Oj=z)XRXG#B|T{JGJEw8_q%bx-H`x5G4{@J9lK;KM#MY4(cca!RHxpjZL
zeth-;YL`RzZGITAu01#V0M(&Bd{F2&*j}3??*zxGvk1Rg*3^a2o10G^FFZhH35NNe
z=z-4Nbk@I0a6#jLO>OwQM2}75)%S$MfzH|_Ji+Zc`2h49_%sYX#r692V*`QoeCZP>
zAAsJ*7~y<ag$+RS+@nIjJpuY_&~K|kzgfENSmA-IpBQ-HA<)hA8f41UYd^T7F!{zE
zfqHH8_<Nz(@Q~iP3BC65hh`rzb=oneGc299d5Lt|x3sT6`d*JtL;XL^OQ)e7rcS$h
zZ1w?DpPjPx+2-73P80Q&&}W-}4toC4KPudHXxgFAcFmW2#pBD}gdKB}`Eoae9(&Z~
z%iV-8cXNhhU|8s}mp#7R4fGY}w;Arsad@P6-sF00271i$<z9CAavb&vf*tA0y)sSk
zE@6HpJhm@)6TaLl@a0}%e$x$nCp|`Zoxa?oppSeL?#tbTFGuaUdlfn}#Fu+zn#Kp=
z!?+Id<v30%13l*O<v`OPz5-wFri-SR!CR*<cO1AsO*AoI4m1sOnl7PSurFuhgB}yU
z+)em$H{r|KbxDss2-wiIK3{GXu${gf;ew9z`Eu9LCb=(1a&&Ws=CGH+U)y%vNneio
z>A>pCpqKk{H~HVDE(`SKsLb%{qbTF|<#@k;2j9YdIbQ!|lz9+xcLe-4%V+1yy#inE
z<_xv%QJ*h&6TTd8_wcvi%YD`9%iV;p;{SFH@^1NZU&WmNEvGMc6Mh)SWx~6P^0qHW
zV-I@jTkz$+YWi|F;q$<k!@E!69rxvK3g0WBJm9&?yL>s|$9JaNM0>8j2ly>t&JU0K
zav^O+UCWm<+sb@7(8qi^KfG&H2mGcnsG&dSz6xLNTf&$7Dtx(b311FveH3ke7X89}
zIq?1}XwKG`<73*?d&7`3zc2TS<;$JL_nr0S&|lz{sr!yI`b=Mr(?xxG9q&VZxn0wJ
zdvVOYI3~q+_u`m--KR0V=<(zB;+UlS;NR@UG56w_*~BqV<{Za7$>Nv~P#p8c!dow3
zJ&)p;w3f%>n6JOG@x;D6-g@dzGmd$)58J2zEapUy|JUbn%$t4qfBgXeuW!aNh5y%w
zf3<M{WeMI1z!UyoAO2t8jAIJ_uaC8_4cHM3w!{DH!zb%I*78_g12hvn^0naq@w%Y@
z`kgoX^_O1R`1qf`vcc%bcZdJiH{+PX|LY^py73_Bga3#2SpHuh{##$fF&X|9;B)wY
z{Y#+Lv6k0|Zv|K!C(%Up5trS#Ml=nBrsrPSIQP&^7fr(d>zi>*;s5n(&mGw~OEjS#
z(Iou8K772sh-3EQqoJIQkG`#<-a*uZ|JR5AXVv{C_$2(lz9){^Uk&#E`kpvu{~Fo^
z|Bun&h-0E(3w`20TgwBF;QyhYWBPvwqhpzyQEPdqYsNAWbGeV?f^5x~K`-<FK5>)(
z4cqeoVo!*l`PcG(hRTHae~=^kX8LntEf4)Y+rNdjA4l8YWH^Rbng7Sid;Gs)S1gms
z6JnWtXDsu-5^H&&F*ufqcG1|Nwh8~QZ$Jk5THa0k&f9JJYb2kD6ZWYNmtDjOP2UjT
zu0h`6{{bH2c&1N;_VBg5n|=6y43}94{#YOWUmvj#2G8aH5j@~=`E!IDFha`%o~t~;
zMjgJE2mJU>ZME>f2l(+l3?BSAhA*(Ks0;tk-B#cu98{0$_}W8t&?Xv#8pe;J|JNtq
zTljyhJ&?D)wU!6jGh?0+YkB?S2N3hbW3T1$F&*On_1Rk9Yp-lPdVt40E&mTNa$Czo
zTg<rUQ{W@XS%Cl7pZgZ4%i;g^gV*wQTL)?$9XQLz2k8(R^CvJ5i?uwV181S9W|<E3
ztmRocP~@`+9mwIG06ejl=hA^9pGD|E4*LYgrdZ1h(SaJ|)>_MR=)hU%Kn*%jWBTSf
zp##NQo}~jtK8w(Sv(SOm9&0TxKnH4UE?fjW8i&C;kmIB>ZXF1kp3|TMXI(UjwLD7)
z9^)}kp#wn^#x2n#*75>$ppDPgfwQ1}7CO+b`%UmktmXN1V8~jYPX}H>o8&rBgASbS
z(|i(ZJug!oNd4qk&-=tI|2t9#QkjtTJjfA!^Z0=t9mwmy1RM{t@}Bj)Omv_I9Z2)I
zmCxePfwTCXx7%9JvvlAr=6L@%tgYEPP^^1lja}%#S?Cjv%Y=6o<!v2EW6$9SG95U}
zbsBs_k<Y?laGe!U9`KkBG|RhmAn@Zm(}9<Heh$|696HbskL$pYwxX`31I@NF9XKm=
zpda2fssn!07}PL+6!Tg7)|wx5E3-i|(SdwSn>uh1a^{GE3LU6fI`A~Uvl!@(=|J=s
zcxCFqV~jo)1BDLcbWvZ5^}i4uc>CtFc>F+LKFcuXZPG<z9ni{W5q{vNH=jlLft&CH
zt$Y^Y2lAX0tT98sZjufZ>wuf^14Hv!$mfC|!s`a)v)sV<Z$gg{US~dw@B@AMEWkzU
zfSb@^f%z<i594|>DxZbQQ2nrc7Lz972U__o$GHyN^yae&Kak~;2tUx3&qDa10|WC}
zs4nS1;RpKiSwj3kUp~t<;D8QfGz`L@ippnsInEkj4*4uEgI4APihLIG&km3e7?IEN
zD9ZTapdz2e;{$F6<+Cs!P~@|i<=Glw#`!F7M&+}ZeqK;Mi{qP>&tm(3{(Kg!ZP6N^
zFP{bPX`RoN&mzkD@>#@tS3ZlVADGV~XoSAoe9D;@<A4KQx9Q4faka~l&m!99%4c!F
zapkk1>?+nl$<}{Vtnobo9bZE`S5fC#%-@!OmqR|wai%lE^I0svZWr=dXk1XP=^Vzs
zGoR%;-eXNKIG<%NKa=HbA`bX<*ant9+sn_ib1Z3IA)OVZ&&Y=i(`V!lI(#~xJ`3^b
zeELlIbV~XxmOqz+K6}Zd&&b!3>9bQP6Q<8R{#>9wBODLz<!8F}&}Fgqx0j#!w<|w$
z`*hChbf@k82HS)F{RUUGcb?eyciwvHJ?1*y>=yj<t!D=g-V*-VEs>|WCH5O^!H3#<
zVqo~zF!#@H3IA+Mtkd1P!Sgh?kk9`P_8TyG@Z)ZgpM+S*7W}g<u}*hO_-9-2XWoH6
zW3b_$-4g!U7JQ~H$9@A=*8t4~k9-sOXS^=xzkcWJR(()==i^`2-eL6PJNz?-7yj9n
zSf{%s{Ijjv;E{J=Z*L(+iT2!m3%JNX+k$_!CD!Q}{uSUutcu}-f3|fAv^w@1Y(0qb
zHQ*(jL=)9t1?+1?(=ced@=NcW`|_-dCgGoLiFLYL$GLw7o*jPYEYXB|M3eB(wxF}N
zgg)CkOZWiO#7Ey&QSTt?Ax61{7^PMBo1jVfXIo;O?gsJXZmPrA>28QUcMKQ77VC7Z
z+&%bP_-Bj;;h){0zQQ`)7V%%~H+UYgt6Q=BvyVit(M9gJLtS%?4sn_LNG1>qxn=oh
z|8SQ7ZR)dQ0c&)>LS=?;1^Q=@A^K+eTNJN<6Ky7W!5ZDxapDuhF?@^pXRQ1|t3311
zj=9$8m@Hw9Zp*nwNBiv}_Zy&H#A|As@Xxjk$e-A6fZut$v8MG5{D@~rHW44&qB>k|
z58QHogMaoswF~QW&mceZ85)mbzrpiVhx+irZ$0%4{Ih3ZM{SY36CA`8Zy^u!8Te<<
z5Pq{P@-<mm_)S~ztDdK_1jBq!^dKg><*X0?Y>Q|V`wc*kO(XoXP&n|<wg^vfyG}lj
z*e3Wid}~#-4gOgmJ@C(-zlOFxA@~6Q?3oi76Y$TTK@R3KPk?^-XV1Vtdj|g5E#fQI
z-=4X4tnfVc8$56AH-Jo;Yi|+z4YrQokF_^Ej{OGDi<sjrkAJqs_8VN*-g)$Xw(fSz
z^3PB|xBUiahq>-{_1Nt5BHqZxh49a|<_0)T)K|hk+X~!oa2xA08pG7jV$IE`&%~PB
zEwO*j(r04L&8N@Anwv|Xi8VK$J`?^~q&_3xBubw>C-j+EbF=iBSaX98a_h4z5`9Ma
zWcrNCMCmh=rkB85>^rdZ*|89PMm`qJD`EPK@P+9!s!RGzthxF0nefjneMaSj^w|~Q
zK)g{&pT+Xea?oclfmRl86#C5a&m#0$pnoRxna4j1)Mv~;6Z*_7pNBpZ`{#o7*=6Xn
zVu(I-e6#df5&G<Mh(5av9aRj_XLye_HMc$!WqtZgym#p{Q9n?h2^xL+%mK%z&s^<t
z=rhqamp*gAap^OZ#r`?2&x+7zmxVq<JF$O`>of2bd&6_lXUAY~Io8m8`V6)jUqjmk
zeMaLVNS}QX?-6hO8>i3q{4@9_!agOt?-J%pnLeX3QTpr#zLS5n=bsgR{k|OZ*~=b%
zM!wSlT0e`>XM6q`+Yi3ypY8c)3w!?A!9D*Bwn}Y~#~aCCiqdD#34ONbpXH;^_WZMe
zc%#dY5%I=7|BS~Q_x!UzLL4<P-k8ik%Rax+aGclmF~@mbCvaZZ?~C)gW<SCAxm|oo
z`^E{!d0m48voBsAoPBZj=>3O(8}X;Y(PM{8IOpWa!NQBQes%@l22h5+??a4?zJD9%
zoZ$G)7is;B{{C&OpV8loFCF<tLBK1Z{2!w{!NC!qFVgxMtBdnY=pB`PQoyFN`|zG%
zT*fzZ{S5IyR+ng|GCFhvl_{g{Rpd85dFSkli&wO7-2eO9H*mP<;oru0qLc7mxwG&h
zt)J1~CD3<_>RmbVjiW>#>JhwOA^K46ete_#vq6F1iH~R{eCGPuWt2b4U~!y86V<;6
z*mPdklf$6tl=h92pPqHm^lk9=%5dRDT0bM2eg?Qt5u8&;zA;NQp&rqsqui4ycM{)d
z{p>P+pJnB2eDv)i>JhK+$8!pgS$7tE_$Xi#jkB{y4-+n0M;pN3Rlq)qceH*+<p>wS
zrgv11;vj?g`&ZDWWB8Zw3{qKqCmAvOlGe{IUwPu8qk!@4UCM7P3z_&fXr*}LYmdz`
z8Tq#G&z@rWjX1AWoLBh<&a)dR@iHZpdBbsDCH+1C86qD3YkYfma6db*@-?)X#s}ip
zOb(qm23h%IR(XmyzJdJ4BjUVD8Z#uz1@O?je)gN-DSXJlJ#Hj>#B0`{@8e^I<nPx|
zhveOC_px(F4;Rkef0&IU$RyP<<<|M_%AK<h5v)@vdlYqOOwsz;l`FFkQ61{TA@S{t
zkTvRKf<y8#aPHXQS=1r?X4yeemgE(3`Vf^R80LGThsKxl9mze7GmW=_(PPqh`8~5Q
z(pWX|I_t5vy$5XruHd$veCUf}EL-g(T&P3kFS0g#<nTq&hA$4EWNju{KZAB0L;IdQ
z`jNx;pZmz+%DImoo<;dHC_9Mv)OYml3Sbq)cWMLi$XrjO9NLeHb19wcX%w@gb1CV3
zN*afA;{2`?;{2|Y1G5jkiL+FxUw#JiM&tAP;DPJqeT5edoZnUcmiCPYaDEqkKZEaA
z@eP0Hww^}qAlhDq45ObPdRx%O$H~2H?ijeNeFJBZF`9lEG?84>dfIRNhUfgQ9M;p^
z`pwP{If48TpMJZd{rH3<KLq1<8*SR2Jz5s}ZPC<k+d{u>W3008`!H`7jxL(|ZJX=2
zMN_|RFJ3wFW6Ze>UIFk(&p>Wbzp%~q8|rfX#>zs!G1ydA=r`0YY&-NDt9ubNQyJ1F
z;OjQ@)Q_(s7X#ycdvQ?v@%>-ceth)kMWNp~UW}P-uHVY0e%me&9{Dl!+cw7EHo+76
zZTo(}6#9+fcj6=Z37<p1Z9`@Oi{ljfZTli%Q+^2a8`}0uKR)^8Sr<)0zio5<RyOq;
zU?2W5^xHPZFr!K6x9yX_A@tk!ENk;GF?fWJzFkB;;`RM_px>;zv*3f!Z`-r87cpkb
zrhePz`t737Zx>DdwtZBT6Z&oYSGay-G;sZPk@VZP*_T4U)rse^^jn7U$Fh)#Z=3q<
zAI>rvvGf~@KYH}rukbQ~`VBHfGU3s0+cZ9)-<TY}=D;z?$}d{wnSMilh(o_ISt5Cj
zrQgsl;x&_ZuHTsa3H^rOIi1JOU4(usAEq&fd6$hjQ*NE#px^2Q>lDf!MIGq3ZK2=l
zgopZYNPNTG&H9+&kQ@!1TZDeQc$nnhEITO5lDtB{)u}AOFy9kBG`^hgpx?HMMxoyr
zJtmFNZ`(9hNw$JuL07S{5!|+ub?7(7E318k3w5acMb?H2^c!yj^c!n4jfpd8$1$|;
z$)gqMw+i%I^)R*h49X7TJ<UV(4f<`nAih%@h)0%wgN!NYx9vHRFXGT|b*|qq54iQ)
zHq&pHwI4r#d=ct5OTXo~zDBWnhkmPb{f2oHw7mfxP4oA_fc9hLyfB)Ce%lV#Z)ZaD
zAKyJa_}%R<3_br>AE7%3_ThZ!J8@3*UAS{#|MT0wOZi-P9RI=4&<(nG;BDMH@E17O
z{T<kzPYr&6on?Mt8?bTKvN2g$II_L(t>2$5EZ}m#ul*d(S^guOh5qE=D-R#pcl51|
z_Z_<am7!-J{$1Gbg`u0DEDzrN<ZDBP7jXXcuiqSeXYwmUuRQ$PT{k~Tf8#8J&t1E#
zut4uF4nFzG)38e}qWl2rS#^f|bsoK&*C`A=`AGwHyf81p2c&oO{Z-(4a`0LF&S@dq
zUc2i_3qR#Xn)s<K)%i#O%;UrEas<<))eH0G{cil!wqMv^nEF2e_qCzf7wGQ+;31w-
zU6U8IUS`n^dI`r0_*uU5<|nTV{>O(ucoH%&@XEulgMNk+FsSa)fp;c}_TQp53%*jj
z=-tITpZw$q@Or=B5Z{ji2H|{i@Si?>lz0SO-u6(=D&rAg5ge*R^BA>-_*F)G!rDS@
zeO0uj_Y;Lll867^<S*V6efI;#lW1QMF9;W}|4%tDhKU#d;o(Ck3r`pJ-Tb5qFOHKR
zNW2&Zt^i)JJWG6^1uo8u-+XwMcmZ5qUR;7*#drZ&1e5B#$JrjdKgrtj9|GG$<#~I4
z^Wj0@AUyZuAw07`{oG@(9pq!BfIcNW=2&?ZW9QX_voBB|(-|PnZ#0f>ppEp6Xd>An
zJV$@}w;p>9ut_Ee=Z}UyaD&PW{`6NKyE*XA)G>S~n~3_6>Kw&GaH%|%+d_G&NARgE
ztv6C%5$roq?{(lJ8-?J}SXe|~7x3+ee|Fc@#b12_v~t-l-2KiZ!TS-;#iw^GgNLqv
z_B8LmS0T&v&BS^1-FK%p@SWzq51uZ3S38Y!kZ3M}+@sIG>n!`m(4iYd8|D2S1RYf8
z$k6^<gBX8d<qPk=J9%X2(5*%Ai+E3M{42nrwlf*Qzi$kE@WxC4eY2qLjiC?S_yXu6
z_^+a@lOCdF7_<=2P7HnMR%QF$1;F|4iJ|x3x(MDK#d{hLgrE5M&(N+{F~`0JeCB-`
z)4=;9c5lW9@cv%w{p@gI>R<iayQcmVyD!78^Sz;;!n9HN^&jHC466I<fBo)#KZ4Ij
zIEJ>~U3d+C&}BBya30fK!D0#+J0HLpGW+`t@ZlnOLwxL=Dm?uTViNBT-h1nH&`tC4
zeSmG2HQPzCjUz+%-a=eP=&Dy9z7Kt5mZP`^U``zwy6@I8@SEVg4mqLkgJ}P2;059R
z0ALS*9&=u%?`FRej31sVe0Ko+ehqb~t@NGx;`O^`Um)23416Xzr1$&5?<4RRiQfYQ
zH0MJe!JERslb`%Fc=I-R{n`KPu1WHNVdJxVIj-Sc@`Hw9olE}q<DY_V{CVieM{tKi
z>G|z1oQB?<-GUB%n(j%UxsK*B8nY(NL@&;H;d29Uk}T2uO?jq^gR?JCA5hto7~@p$
zb<vi>J^s1-<@>~Z1vs#=?=26{zOaTqS-(<v`Xc5e8Z$IkJV*EioQoJ^gwvEq8u!%C
z--mqAJaF-zcczFx7w;^*z~*i6k(c>NR)*-Oat}hc()?TozD3}xyi|Dlm%)FM(?4eS
zON8?VeRJ;<keL<Kz2m(LKl(oI#Q25b!sOMzyld(&G4_7|7{qs?i~8f=pxpn4huQ6K
zQ>@{qP-g#)`v+!U;PV2XKZv#);O!5Ae`WAK*cXuHeVoVta{Jw{k!+BRnDY%{1yfXx
z_^}@{{>SJ8qHFdo8k;nBXk6VZ?#qa7kCUfNCjVc+09?{rL<jY88U1U@!l%$aZ=FY>
zYpGx8{kPDk#P_e@Uy^0JpMLTN!8>{f&HK-?viE~W#HXJI%;yV*$<Lx4#9QLmt8ems
zV}B9Cub08EzeHOJ=5LX16*38aTYNf-F+?=cw>JTs{SMqD-_CiN+I{Ii^LF1vS+m_Y
zF$R7sU>pqpKkqIqig8Z*i*)qGUoE^qvQKR$cyIovcP*Zj2MaHJ1o#Oq@#7+7)N4;%
z`kokDWP_j#@%^Vzr%>2`??+FvGuppH_UWgfpNBE79~~$>{W08|bsb~-9LDzQfxE9?
z#GL~V{FydAT$r6XfpZI<!yJKF=gg}^`;Q<0vm?_qw&{2J_fKH|?!N<fVxjEShi0dd
ztG#;gGC$`7x$f+a0e-grew?lU)S(Bk=WPGog{QCMZ0;ii1GhlK%z--!Ghe|z@b5$R
z-^3hrH~Nv_LLS~r<+S??pDW<|LAuig{rCX>ePih0jVDn5)t|t7+$;1Yap%+P=+8ez
z?CU*+d#-=;K;f&ucMo7=-upe=BlCi|BL+NNxEtTUbWh>w{|w#`{nTEf-8>_O+PNQe
z9YDK27VvEtbq?Yia==&{hjD)Z@sarS3!r~Lz8ydrC(HwPgHM2o`IN!Lo(1dtO@{Ao
z;M*U94|NaXn~9I^EIP2CcsDx(eg?uDraGYGZq(Bh&pm-&o4H5a<3sHk2JCx?55Q&i
zIcpoE#pV~$F^n={Z6o=>ehll5B<gc&YiN1EGs~0QFx~<_@z11#-kHDCok1i|uVOAG
zx!k|M@b~_Q`9k4ig~E3Z(Ee?bdFbCLnKxnGg6s`{boPOjFVB9R`sm|gpX9UX>#I0(
z=1br`y|?6fr0{g@|6}iKz^kgRw9m~=AdtU{qN0Z620{5J2q;*nm++^E2WshzojM-@
z0)oIL2yMxyEm5Pj0veP~Eu%FkQK3eoLJQyE<3%aj0To8;*w#uA5Hui3{V8cl`QEk9
zS~vTylM7g-wlg`;b8>Rlea~8J|D3(o-g~Wm5c_NDb9bj##H-7_?+TP(Lv@+>q0V+9
z%;l)dRUv$54s*fvsLS}q1L|_-x`&{9IqGsI_6nJU6LD5^s4jnq?+U%r$!W}()qi6Q
z^*F=HUix7$Yuy}ti-9mymore8527CTicQ&weBN|9y|b`sP!~5*ntI3bH<~<2jcg)}
zT_@?c^i+Jq1<&<t<+qHUE#C@>*YTcCFUhNP<de-0b$nAgekWd(N3y@Hk&_8I>B;1b
z?1egnJZ$-PM@Bf%Dxb{0BYROgm+-rHvTt`J)aSuYuMT|!as4}1MS4-%N!LDH&Kc<@
zj@#tN6wt2(9X{LV^+H|=R?<c3NtRx;5u4<Bsly%DwB%hv{Y5>n>#yS!4*lNMpQXLt
zjrKY=jLLr9N!#lf+H34}-jDYCM|;hCPMG|R?;U~q{WQ|N<#e>y*pHsS>+nI+_Bs}C
zulxAg>loVW#BTw#wAV4Th5p|<rp8*@YoxIw_Qx=7O1!;}p)HLKGj*BsqeCY0Dc)Wu
z?ycX_UMG=<XXEWP<k5Ety!JZA?X{m@M|uY3l9?Vu+jnYvHJbLC_iCi{wBBALZQz-Z
zHl($sy>3Mp=wa$E%AfW}@!D(XZu+iP@ZcwSsy8NY|BCjy7uxGK`=rf2N%oz=|C#m)
z_6$80o4juKVzk?3RvTYt`uDp0#kNgO_C|Ut_MZlJ_SLb)^xkK3oAwa;haaLnT88%M
za<XBhjqhS?m@;F-IM@q0)hR1yJLW&pt|&XEjO>^?vSY9>ov~wZ6+0$o?3h^D9PHgp
zHVU=z#*XP=?3l#~b`17aB@DIkV#ko~y^vPBz3PoLrbDL=NK?;Nenb0S23r^Ud;0)e
z?R%MLkH?Uv7=CZrix=&C8QS+Uv}uMX<%fI=#>mTry!0gU@GRQ*xIAv(jSSf1t@1<r
z4jp4<Xy3~|L;GHqmDs+Q!5)WRjwyR%*MTSLnUFT5743V{v{BuV_L|#w!y{Q<Q2q+u
zYTr%%i7iNNzWh)7{@V5o?D5O)m?-x6sn+)?sP7R|-+2srg8GiVW`Ui3b;PUhJO(xO
zePAm#`xjo{BdG5YQ{Urud#m-`+vnA`+cEw`eNWuiv!%XAP?!9_b;L9A`i}I)ZFAIR
z9)F@PQvI~XXqm{PczsXYC$pu#Cy|F|<Mkc#c>HN(c=g@S593dxBgUUzeLsco$fA8O
zOR(4RF8S+w1a(!V4QXwu@2%*9x?$=s+w#=D5f87vw}J;h!Hexq?;Pcy)bUfV@1Jx0
z2^$Q1Bb=AC?LJN8&v?6ig7K%_ZrkI}btfBta(~q7_|y6=KK?|X6>rm98-MaMzVRpL
zU902I1Uc6D6SAm1PZ)n%d=kc=z@BWcy@dArMB`7E;TwN~PHl9;_>-}y!<!PupO&6z
zBR1(a`?HQed$!G=w9TK`^MNO-zqfe%iTUa;=wH_SiC2HI-_>WI|64mNYvj?(u`f&C
zE#7`JXn*TrJFkN6yo%_sgRpnYovYG|jqTiIZ0GLITABar81&iAP4W4^0=AoR6}y?|
z|C(S&G{GjWkGH=C#%?~EU^ioL6v8C5zvWYo!Uk%(9C~v5+hoQE<@rZ>{;#PQFt7>Y
z`}6e1Z?LPIFt63rvz6b_{>Jz2LHoOk`n(Q3owd>jV*W2-FCDbMO=yqS5--Xl*^|e}
z$%LHrWO7EXg}s72Y}rc(?Qg4m(EhHabS?pw_7pnVUOH%h&0adBd&j}fTFn2&^~e0*
zT1q?VDti#2{x-obF!?bB^ea)uXn$ArLS6}0(naY>mR_{KP4Ya|6(fI5OWx6aJReaH
zY<pSe|Gtp=i#-@<FA7tC5etO*Yp?!-hV_`!R)6Dm@CoX#Z3k1`l={o_*U9TI$9uI}
zf34r*^%v=ejhwvx@-x2r%X!yo{Y{W#)nCYheY`56{#twz>MyV-+dBjHu-QA~r1h6&
z`06j{wC6}d{bj7L{#ts*>n~`qfxo=^yQQuDrFO2Z{cUT1Ka2g)*8W=dgVnD6?`wZQ
z`}{*X<`hy=BmIh(M>dBMQzh|b#fTN1irA`Ah^Hbt_CI^B2=P`F$42%G{LA{uys=*Y
zE(SI}Z`{iIH_aP6h`F1}v5@;QZ(NV{@41+N2+ZoU*|UE$mQF<+6TbCsVz0WJdE-p8
z{vD1@*&J}ZxVvi1Kfs6PIkK+`V)>iN{&i9jYY7a+WJ&B=H~i+LA~q1u(ewH@$^)WF
zY#P${9O1=o1J8t5xIiZ24e>k4CVrGh5?5zrWkObZGFc=01)*btymauwGsLSHyaLE~
ziiM*z1=C0NBfTROV|J2QxB&E_Shy7Ml2|xOM-coaEh*&@!_O{n`d!izG4j25LXvOt
z%t{}n%Sm_owU+Jx(q-p`bEnf!<R;j`t*nEWV;%gjwS#GFhBBO2oHg=T7_k!)M^cO!
zv8jlm7=^eAqN5%+7a^{K;#IgF&y#wr$8o5~&GCBN$~cbeaWm?1GsQ>5>oM$L)Z=6E
zdW?7luO3g$OQ^@?Q;s2T&9hvOn@v3~&p*cXxVZor;@ypP?uOq`p3U@JxRu{14+t+Y
zD5%HHgqJcvJvP4!Kh)!9)Z=E9z2QfBB=IvwRwiVnCzCaD9_q2tKQ1pFyzmU^Rt#PN
z<U7T@6hLp(<9Vcagknif67zz3Y+_zekK-{fln&I>cv?`84L{OZ%A0<dv_y=2FK&qB
zn>@49N9jU6o=3XsbfX?O+cebUd6I_-^|+Ps9M$9FF9u9}$<ZmP@SROVTuD0<S3>n$
z;z`mGLz0jAipSxj2Ol02V;sg<@h<r2^_e{@?th!izxIRkJ>PqJrkMR1$q(?i@I^8{
zvbVxV7XFdsBTIht<VQ(<vdEv6Rq2WT^qy}ld@eg2y>t)7WWeW;{0|9x5Pqod!`GDj
z6n_R^@+*ixd_2k5_EzId4gX#EG!i!4ivR8ho#E?EV_@<Vg`Q7}e$b74c!>|`NdCLx
z%S*hzNFQFrDt6wFSf1AWcu5xRd2IYGp(EW>TK^M%WP8XT)cA~geyTC(Prr*Vah2oc
zBl)G0A7&WW@4Vow*bV>Mx@?Mf&+px(UHLUx;7`x|v7OV2^5J+l_&Nex1<cFHhfk2l
z<o8YfzU0s9WI2;#>`$tFfA2znNq*v_*I6T-#^M_uA0CF!*sPRv<Kr6$yfa*Ue+hFC
zWfwC(z-KM3gZ~)G7r$sq=eiCpu`z@fAKpDEQ>rrqpu2viH|p%E`tW+O8;L%=LFP&P
zseXIByu2lyI&wS?<+tc0`9aT+Zc<JZ>v1yw+Phd^sfSbHV;hn(N4Zgb*FLr%z`u%Q
z(=+7XOyx^?gEqA@(LSCy7Vq{L_{EPlKJj?xjXyk<r}0UKkK!MZ-|xNW^cZrDleA4p
zabobvPhB?>SBg0c<4SR7A0h7SW32I0S(2~tyBs$bQL!+TUw0u7NY|mzs~maOTFlmX
ziCe<&RGwA17Nd^cB0kIPJ5T(^Grwz@AEmt*c=B(Cld*}BAvsfVR`K)k^1ypTy3n)q
z3_Tk_Obp3O$Fo${NAX^y5g+J5`AIa=JqBKsUaIrL4{LG8$DE!gzA={BYRm!3nJ`9f
zYiYFj_GUf1<T#zmNl)PEIf~`!(%$JrdUeUb`wE@5a2gZp9qOp)L(kUXS)+ezSkBKX
zmJ`F3@~yQrP+dLMG~6I*I5RN~?Kll4El7h&3({E^?9w|~y+wY<j|l%)E)+!oUvr>5
zy+aZ3ZkZ#@S4R=hzncSkd54b>;UCKR>L`K|=s1d?1fox6Mq%&j6X+v2ilT0P9F+i{
zMoK|Pr${9bYWgUO;Nz$WK8+N?m!dcUF?{C8;Vb-t%z=K)9PqC;2iEb;A@u-uj5$#M
z%z^k8bBJPi=glGIj(#BF5C!BaIC);=sD$`)N<W|(wlVP4-@m6!lyXm2KO$Uf%BA)w
zf-e3qzI9LneJ|_j*PyL^a-1)#efsiC|I62)t^R#^^-s4hx;C7wyVLEVukAl61Kok@
z2ed|7<2DT(pM`kprSN&}D_t78v~+3e(rzog&r^DM)*L!lb*@JkSI$>mYJYtxeBSz_
zHPxEwl<AcCG}jE<82m%q=ejuC>W8DvB|RbGYyAI_-;tAz-?%}G=gDWiZ>wK^<3Z=i
z|Kuk0v(~TU!FIcjeC5n}hX-|@SKsHXdGB9v_Ppl*F#fRdJr!QSeE$cSZ@;2zWGMVZ
z=ez))1I%Z2PEU1K(0-J(Ui>gH2jQ!baTZ}R<`e-l1@v1%?|E#BdG1Bf2t#z@*~f_t
zqx%WiyCUN(XJ}u<*7iwtc1;VUZ^sI7WBp)fGUnSVF_x`FnN?!{&&osCBjYg6SRh9G
zX;t>i3b=JwVU8O2gsU5e`Ekr26TWT~_Nv1FjqS_tt-Bm^(ELo@S1kOc7JiV08DL@h
zSeT0}%mo%E-@=@4Va~BIXIhvX3zN};`JL!U^YNUHW1vym-jUye*jJ5zJI=rTihoOI
z`Ugzk!SoEKV}7#p^8u&vU97=8gzE(<53Nc+H)ZLZKyaza_oIQvdA;ymLC0Bt=nQ9l
z&4tc}kFi$cq+#!xA>nAsn)HbWu8NIt)}-eg1@BR7LOFlRh>b|a)mamoScJ3Pn(zQ;
zO?dtoTo2?HyLIDYBZ_c;5AH*`)7-jIu@M!xkK(>lZVA?J#??&6{pukF(XqKRT_<<C
zyEkKO&Gg*)?x$ytsVT~x;r4*s0>~TyIR%hWksEb~;Q0bP_atc5puL$l)!lPZY{Yud
zt3m&$Iy|5Up51dnY{Zf3@cjS6{Q&UXlOG%LD(+v(d(3?kY3L7Ld(MxIh;^-UKkWLn
zTaf#0_mgw5-&*dY?o+w7Zo9Ka)~wH4<ldV1u>0tc3!|T$85>bOq(^io^m#UKq5DZr
zY{b*huNwEy<lX3w&RgSN{Aeg=;G?05+d$s{{VshpoHIS|5%+cczX|`pnfG1y9F)mq
z{NE+N%q_$9W61a>{yzuLuFTuyR)EjPSU+jPZ`+W*m3d`u=lu2VQLG!?23~Kh3Fj<)
zG(7PdoFT~SoWIDWe7G-vp?hQ38{IeZ*1Ol_J?oy0=Sg?uOHL%O%KZcI&*I#+COmPV
zc{U8)!xO)g{~dQ_*G29#`8T>>@4C?4mOs-S*mZ&1kYDPib)Dg^%=@`}W8O3Fg?W#<
z)yS7y@>YZYlkT?Mr*Qum&PQG1Uw}2aX}N1qj@9l+>=hNp8do6VM4jB#*;&rapUype
zd_!@k-NUDLdT01s$bTn2>{1;nz|{dx>KWBBs$WvKW}sXbpj`K&{)O;A)iJ7X!Q2Z>
z9UBK4)w4Try%*QfxnWb++&o+_kBu0BYd8{!?)eIy&ns~ET#B_m)aiF~@&BOMh;6uj
z+I~#UYFyJ$ZY2LP$nS)c>Ne%=SuB_8*x9+4xOJ#+RM!SQiaJN~P}h*B^Z$U~2a;UW
zwFCHl4f5jv{f>Gz5P9|?(tQB=wt+CHYqfc`?u#hXm2{8#MdekD|35<Aa*(exJN<t6
zHF<;Fk;wBKJH0)88}jO!j$wCOq+RryqBEk^sF#lpxj6a^bbcMWqu%8#LOoiDdVzX5
z@xPG<s$*0akKj5qf2eyd>fgWN{|~$Ncb~%b&Aegmk*=4yZ{|JaZh@RXeJfJ)P4J*}
z4|ojEqOPpO`Dxcn+&8=a+>N2Ee~vmub;qlR^bTI;QeEAUHyml{gF5k5cVS*H_w4+i
z<9>rXBd^-M7P4MI`rgE|KfpUU__6TBPr#S*Xbi4YFT3P_1$y+wGb4~ky}{>l)U%$T
zZFJY8UjGtxYbWw-Mc&iyBe{>b)A4L~@Jaz+)HC-s&>ZsVz*XvAChA_lw~nvR#QAU_
z_S@TV7KLKJola*UxP1-wM_TS=-E}*zsk5gIeZtASYbN@rcC)(;EkWOO^_$1nPx#C6
z4Yk-Gj`|?#i=GT*uFDQM8?HuQ=%za>sBL|9!>y}cZ60}FZ6JF)t>wDMoL!;x@@sN%
z9zNUIush9ZtVjR1y8!JluEgsI&PMd5)xgvJ&v4y6(rN4lzY_T!bN;3eboM#(-wo!h
zd#&+%_jb<;WKVZuBj~pP=-p7JRbA6vtVdOrf_?$kj@yCWDUh@DS=6~}GSl4|ID^=m
zr#<Ldft001PR{lPpcNtSMxhQ)LcUVF@htXYE($wOFZ^ov{tF*XAAtHaAN6U#k5Io+
z4+eY(SCspJ4S79KPCZaIJy6y-$NnMu=GcblhOzHPSB~8qonF!ChVE!|ufbV_{~tp+
z-GMfQ>R2)A(3WHHRYV;xKpR43C*?(L#r4PsN(=S<)CZ>EB)u;~zh8y)&~KDx`h5@X
z3A2Xj7lJ+z=^urBNJ%NbW<Th!9lrVAGw^&Z{_l+IVdUePxSoUaESz0%o{e*0cDhUD
z@lE8*SK4hEUW2l@>GI2>H$Rp>|E9;%2R!&#X#N9_g$8^d*PC#C{;}}<=N=0WxD(f3
z;d}u9zk~Az{C^X!$MXle&*4n(I?(Nf^8x(-4$krT|0Y~-8rKjVKjyvYJLC389~iec
z+H1_dX!@9UqsPb9MV}kDCt6+6<Zi<mx}(Xhz;!y#BAf*{9h{%y{o0tn(LJl{26s@`
zXWbv?|H6F(eZ@6hpK-6xf6Uzjf6%(zU%0yiIrX>T9in_5iT80D+H`8Kb-ov4{rv7j
z`Il0?>2`Kx=oF{JoOdsM=)9uvYpaf6uc@n@taZez05;u`VD`EXgQ0a#aNVABwpX_w
zM%|`&qygtX>{mv08{^$ds;g9vRAyAiZ?$m6z~G&!#5|0#`LMoPN%gk^W%w}89w^Tj
zaczh444`~>qC7j{_i~gcmE#QjM&&zqgtLpvaUAZcoC|@KGTw+X-4A_#gDcgee^1*z
zygGvN%?P_UjXFR2txLc1Im&q`%6TZtc__+xD9U*#%6TZtc__*mrzz(HCoJa!D9>c&
z{7L=>_ZKMJ&Ry5L7o%+d4dwoN{<H4aV7JW7f7D%#a*pNx9OWFUpPKgzQ?3PQFN;vt
zx}2#!bl~F@b-G+y5(sUFV@YRfLnv=dn}RlCH1e+-@_Z-Snp^QdwLOE7m$#senHxyk
z-UICqJxgWu4DyrS&1GGkT~9lq?UQhCw<}~9QM+>A?Ng2o?1pxwV>tWS!GliHwiKdm
zDMZ^+h_(f%X<POsv@I2AQ*_%xebZF5FRRhEkR9isZL#eTN;~Z_x#DAtO;S3{X}sv6
z^9FX?xhmAoS<yEo6LmXe>UO^rXMHA4v=_f!firYQ?6(7PE(mnm{xJFpya#vPhHJ{~
z(xG$FUvy823`?C|IJ8>|`U}|5)L&4aa3t{1Dzdj<#Wfx8)Ex8;=rh)5I_39LA8~iV
ztE=XKPfeizU2xu9|754wZ(ltt@?SZD?4?Wao;i5WN-<7q#Myv70T<x>2zL1_yo=cT
zZC8H4smHrx_5y_O!Lau)_@{X^&Vp~|y81rfn70S-F1~X<?C_w;^NxJw>lou<pVDAE
z<Cm3*?{#Fc9#29K+DmR3^q7D>Gw)_S=0o3n)+1!;(TVlQcLMcc?1$2m;-#_g!&TU?
zyEpdyCjWK3%bi~XZZ7m(f;=Ff->b3rHueCipM!MuL;Z?2EqQ%j(~@Uj#l9J|H{ouI
zokSaS1lUTFhp}gVN~bxYTUVTSXyCF{uMAwi3T;Sd`YqeZSo#{S`6)Sbrs0|QkS}}r
zxsqIZE)~yJoHw^{*{Yg>D^?Niwm%=A+-TaZOpHgf>I+d`^?y1(nfi-b=<+ml$?8bD
zbXxj6bXf{NLXvej*l8U--wnQo+l`#Sy33uE`Z}by7t#x#tQCkqThSMM4#Q84%C<jv
zWA8=S1}XLBNcWTAlLNZ~?WY+h=Oe$KLjGVpJ8V1nPNcMewgu(cfc&FA{CFUH&R*yM
zKab9(`2BbwH0Q`ImFJZre(ts&%T}4+QP&$WPNy**y~8=Ei;p7x#{=zvz2m&v!pc?C
z3o8tEI?}%nX=w!R@<6cu9+HjpcZaO`N0+=_a&*bFdr=l4Cw1u($4fu)+Y5g@l11tN
zPm}(Xb)+km)w}S~tAl?Y`Do*QSO=<?`0XI}qwI%rM!ncYwoFH)y$|w=_P9j*-njw4
z4?vna<&mzPpzDhBI$Zoil-1p<?g5`e`2Bg*m1U5zHjugWDU?rt=t=uvK8bQV3_Yog
zwj+Ot&ta4+?R#H<xrEE{4pbqneFDz*zL1M|Y{eYt)E9hvBh6IiH$ay@crMfFxO6$L
zkTs_p=pRDv`>02+0Q&*n<?%?*cwlWDeNzIwhy4=rjt7I7OKFF>l=hfQNyl7Dhk2iT
z-D&!GVg|+7n*H?5{0Yj{%%@x(*=X)5Z;%h^p;qQo#t=r$r|j_d7Nq$UdcR~or6*+2
zJ?2w3%^Kru#C*!8o*`#fyFkYF-TT@%E-g6ud<yl;RNpFa?$5`(i8X)GFDn&elk)hy
zL>=ZZ!srXy;gtEAI?QFn&==F(Oedz3&te^DWShOjzjc=1g5@I`__zP!-)LM+{61p(
zubF-x(?4Z8jU7pj%!M>DUFJ|^F60=~W&T9wLiF5;o->iTlJ|J7<T2-=RdWj3Elm%!
zUuyESu6<)a?7_Sobz?`!S$}nBZ?2@+%#~C{-^I8t8)Ls;LO#Z-16B`N9gXA`yYFIr
zHvn|ZT?}wB_pmo(WX*icOMKY%NsO1Lx_dF^pEhD-4fR(K4|zB`5?G9D2TY~kF!q0H
z$Wzg2m`B-*`3#!ZcoFj@M`&K7>uQX<A9m+w71b2vKIumA{FA^wGUSoy3&70>51MC5
z$(!clYZ?Yyk~OLZb0GsJ=FNBe=SAH$L)Jt|k9&Z_9L<1xKwpzr;#PoPIrx<f8(l;E
z-tGFZ8QT+n8sRWz10LhLX>RxY68Bc<v1Z7VQIdBz==g2oUdYVJpYQJN`iNTs42{v|
zcN$aU=11KZz>m`PVRd*S(v)*IXiou4awr`y;F(7tt7O>N8k$pp%pCBZNb+CEpGNu`
z`Fr!HyWP9C$j|9I-;K*Bx%kbKJFdp<>X%FWs*#sDsB3rQ_lJ=V8aKR%XN6BS%4{F=
zq2H%MAJS3V(94b--;e`)s6Tj--9&!Oa|7k~rp!Jxd^&8SW!MA#p@FGS7o}IZMUj*!
zmGx*Y>k7<i6ydxLxT4W}q7|b*jJ|sNUfBD4O*u@&+`$&KcXgPvlJOGRG|N9YzJ4yw
zM`5e{0OvN0Z4cnw_VM>$e-`am`ws25&r8X=YbE|)ID6*CWht3=eS&u5+p{m+_z~KR
z<p+<i?+cp+^SALa?o$}!zIv?az8s8mUqSo%nrUyH#t%2#9UteCE%j=1%Q$zQH-ETc
zJm`A7OJiN?2O2RZxD>zB|73eo+jAS*9U2$V*p_V3c_W<_MQnpop3%596?AHM(r{hS
zA!jMsp5yQvjfqQf9f)@7nO#e2&O~0-+~TbG2Cf*#HeU19r=u%z{u9Qnm@^yjV;;x8
znRgNF(u>?b;#^7pW8C`Y*gA||KZ$-c_M@m%(SWg5gS!>>E6u;m#Mt$A%wz09e_MsJ
z-(u#v634BSAKk`AHlEVBsYBwNKsWSrG-jf)6OBPBZ^(u`1ly7Jr=F$qifnVrtIUDU
zt`p@|rw*Q-?&Vb|o>%w%YDrCJ<k7NQoL!Pv3p-X}eyPe`SahbDUmA4Dv(bw$c_#W@
z<eB6jjs5MsTWICoLgd}YV?Xxg9gX{G4rpqUyc4^;+qNlQ-oY*}3VU|>1gFI=zZy1q
z-&XAM(5K&jo$T^X9Xf3n+kD#W(v57JZz`ExxDmGbCbG?`o>RV(Z9WI}Xae}nOK~>X
zw(uOp<B=`ABk06!;hYZH+bx@X6KwKLu*o;UCf`IhIe4s32gbJT>AQ2<wx8c2d#Pnp
z$N9jfHheN5dlsIvZ2L{H?Kgcq@v60A+rNLom15g(s_%0JY>#oU@5jRKAp1UO?0d4!
z>$<RQ&fix38QJHs$H<<sZ1hdGjlLYVYJP#!I30Ed+3K{{ini5vV=tA=^sJ?pt-h%d
zc1;pneN%S2vDG(;t-cTW#kTsUk_q&j-&P;xx79cOjBRzY(`#T4*3h^ioow|EVykbm
zZS`LnIi9VK*tW@ik@k+Tw=%*gU*rL$>qEBJ=Od3_Mc(gbdmUqoO(C?AWOLKH7UjuK
zlo9NiO=Pc6!tX>Qd%Y3%7unF1KC#yq(C<8USpa)|O^@Yf46+yRz+Sf3--9h)m=f9a
zlF5Vi7_a=`yj_JWR#g<<Zm?vp?}vT87r2K4sr9ua8+kzUA(gP#Z->2}it)-rPKWwV
z>1j)8yh8l;1=Hf=mAJi**t)Bb2kFg4uhZBJWw*(;)#ssZSho76R&4c6o!rRAR&4c6
zwypld4p}X>I`Xp>TODP@wmR%oWvg$ZcW()Fg{{7+H`43b>P2L$ZyL{aH#6PX?3>7D
ze;0Efmd(ED1KVb|aBQ=0g8h7sJ!VP17V7PBOt$)eitXMtX4W*3rzcnoB}~Sg@#g)J
zwNP*GV2mBx)<W5yr*VXg8EE_<V+FC}P0SNxwJl#4{L<D!-P61l>iz?)g}S^J>b9+g
zp0>46Q_ucJYoYG{khM^((_ieit%bI&g`S4B(CoIgP_q{5{_k81jd^RKzxZFX7Wz5L
zxos`<Gp>c6q-{CfYoQpM&|2tYZEK;lZuj@O78=7^D85@n^9e6tE%a%ug+8s<LSw^@
z-%>aS>&VtxXlz(XE<K0&l^3uUT8p*Nr&p{Z+%o_C$|<jf()0Z=2lCgig~qTJ8Z&F5
zG*0%fg~ohqp}TJxFy~NwEfi^`wa_hC3&kFhw^c7&Wq$Xqg~qTJ8uQjdw_q)_7Hgrk
z6$U#O>HlljLP-{-KR&neg{+0fuog<XVl8wF)<U1bTIkb%%e7E^gUPIg#>`r1?~|^D
zdbs+8wa_-da!2Mj+WgA5PigZjhyPWZUwNBfd7EE(n_qdGUpdy}+x*Jg{L0(>%1=3d
zplvSYGtQ;7`ITc1qs_0p&9A)8ulyg}ulz;wE6;#$S0?<*v*1^rJ+Fh~eU~-CC#7F(
zvAGwY6vQF;;`4hDM){;1+HIaApA_X!UdI09WwUxXi{VdR)-xTkF7PLx@^P@S{$jsB
zIr(yu-=g?)^vg<d>kvOLJ{@(4pO4RrT)^@9Iq)+_{JcC<hxqw89{%TXJbcgN82F6D
zG4L4?jQEU`&xl~f*IfL@>)<mYKIP(TF23X9Q!c*d;%_3pDB^1_zT@IkF23gCLoV_7
z;%hE(_#M$EKLnpcioYk{LyEtj(=`P?<-w&UUmJpr^Ljdym%(?brjxUNSr5;rJUSv$
z^W>1I8><dY+}nrZ*F!l0_+7)VdjR~m=Tj_nlzhn%kNnh-`ED`%%=aP|nf%1x%NbQ;
ze8=(Z5j<Cd=k~MjIQeJ427l-G;Hyr4<nO^Zy%@gCzs#NC9yotwjq!hmKloO}>E8lh
z*OIJ}HEV{Hz!y3MpYG7a*C6{2@PL0e=`mm*a1Hqp_=rz;+vUx4OW{9$0D47%osMUK
zH~J!ud%!dBH~$d7lMcJ`7Pwoxu5s^%i~_`m-UeUs0r0IJ34hTr^qGoy^J&Jfy&698
z)8Gp}-5m{n6#soa^S&KE;A3&ZS01{Ba~g0$PEHE^!^tO|;@EfPFEBB}-QmkyI%ZT2
zVzVcXMVveNlGhF?bsx*W-hB`8V(k(4JR^UGdmH@8rz6&QKYphe`x%IXr+DKu#3_^C
z_bA*?2mU?C0WIgkt}~JMRql)M3El?3@ijvhxQ)0{{5<95?a&qZhPd+Z#7aD~E%$o2
zJ?04!LrpqQoDRS4BKX=D=9RkpQ3e(8GpFZ*h|7(EFO`9p9}oND*=jyKzQHNjJv>nG
z&hYn8N1XIxH&pQZ;RST<SZreJ3lRSvDheUSzSvzoWGZ}1LK6|&o--Qdk%rTYsYiXv
zz0iFRb?E~9j{O#Lis&Bo=^|hdw=lmN_l@U|LY%=sqemm^PX%a!g13jy1cu6#<W9%$
zji^)8kcLN)zX#|ZG3}(se&p*mx<~B)R^-=A$Uz;M_!6Ei#R(n*wh=GFASQzJJ&-%d
zdj@e3p}c|aK-TYK_##u>{WW=)ni%Gb@mv%<g9X1EK05Cb#4kMRPKQ4CKxSIOZ-)=e
z8-jT8T2nTZo?D^c^hhwe2AG1}!8pBm!PTf|w?$H;-Ju)pJApcuLv`;$T&3PoJ=>N$
z)D7ibjynIS3*B?7bBE#nt8N;6okIn`84ei}sjg8uP&pUmUS{eXmBoSF5$+z8Yenu?
zT&jc9bBCMyM=|aD=o!?zirhXXZXp%*j_TKKxxG!?L9pPh;S|>iTn?qLJ?daZZZG6h
zPj?#9a~smT4{4{mNOg<e9g5``gS6n?G4*f~o_!BxC-o5T&qT`G>fDP^7yG&tmrwO?
z3v`S?HpMwi1&!*V#2!$r_JrRYU*8Yst%y5#1gFH-7r{TZ0zTQnwBYt-h>@(u|0T1h
zEv`ZAB;xDKX3p-m81eOG6aE{|!zX(q;_Imop}ypvK-N0<*hmw5u!Ca{sQr}KgUUem
zb{%^#7j5U^^PLS*w6*crgOOgWJ;fe)e)SpazJ=fE|EaiA>_HG`CQcK7fVkpR#2QfS
zIK{t~;2NZuWBA#ZBQM+IN^$2Dd$1raXK4u6xrkMuSY(PrrWj<3JN^d8CESkdcW_>c
z{_rQCEUD>Iv7h|ySNsdEMHG9C>#)ne>pp<%bGUvL<HBKxD_@K2bGYtC96804_r!G=
zuDz?n^LwE!{Tc2l?)-TE5X2b|LEP~WcNnhYaqWe34$kLrKWrSulkY{`u@_UmdEBw+
zO=JEXy==^%qSuZ&8ZD~$)SZsA0;hwsA-@*;f1n-g`j}ggzuN3Oa!vj-?n1;GugHJe
z#FH1JoxT<CPyu2hMxovp@SY2Hy@>nsUl?0#Vj(QQ3D2KDF^0TfwiOG3GLu*cFJ2_w
zlogf#Ve;8e%UX(lGG2CBTy_)_o~-PuRM~Y(3vH*e%NmB50bKoM7g}eR-KITDYR*F$
zA+BWCx47(Xrn1W@b|1vG3$DXPog3{ks!O!#k}~(`C5zo&D8oFQT~Llxrc##aD7!9J
zS@z+wwac=LDoZNcE~+etjcbnHJmy&RD=5!@L3y62ECVRZ$=Da*MwI1!D9eE;%c=02
zK9#bhcihCaytmscOZW*$Y=*ZVfEP1OaTF9cU5Pf}X`B)>9s1Lf*KeiRjI>VMQTBH|
zg8vblv3MTZ0mMz0AvR+%Vl&Dn;Qgg`fXdm#X5jszc#pY=&9GxC5XZTKVk%xiY(_j@
zIxQhKqYSYbWr)ovLu^JF#b$uV`gCCI7>{)Ll2eSwT*O_+<DJtIVl(1=5SwB6WI*;T
zJeS`Rca3koJ7w=*;97ClS4(V0+2KJG5SMY)yyGvn#AL+cF&QK8%g=Helf-0{`C>AF
zErzXr!kCOyJ0>Gm)`+n|5}$#x>{N=$h?N~*?fDF}#AL+EO8U}s%4Yz$34Wh}vQ}d<
zQWIh_$|xp-<j|UVt1%fEvt%GHqm`J9GKvjviOGnSg)j!9wSVI`fN!KBCZh~78D(Bf
zMyxC!G&?4P<ci<G0;E^+V*&gI)>JQFWq$X?WW>r|GI@ZQj294-QHz+2+S?75{03A^
zMp@FBjMR8cMj6FqNFK!f22iGbOiac|iODFlV=}HzjL9goV=@k#_~}^L(<o!{8CZ*N
z{$@R6d<M!SCIj_*@>-6aE<|2ZJjM?Lp{4mL>Gkzq>@><JdmX(e1sLa1JVp#@<k;yl
zdf%2nPsC%CAs(YF1HXB()3LI6JVq+TW5miR9;0KT-#}SHJcfm1zk#x?Iv%6dac`uo
zXWbMtUVTAgG5STk`xB0P38Uhu4|#lAiKA{C_oAPqc<sNFac}e#$Gy?hJnoI2!nikj
z8ppke<(`fh;V*pL8$Au<-ss=yxHpP%B=#}<n~r-i#`|33UOfLdANNLE8TUp{<G43^
zn#aA-wsEf)bN_cZ?v3)eH~K$s+#B)6N|(083;Zt__eL@9jsDLY_fGN3(%O@tZQL9A
zJ0AB&Fz$_b<6i&1VLa}QU>xY}8`d)J#au*RdhV3=A~@x7uk0K4`Nq8wjC&(y+-vqC
z@Qr(s9yRV&dl7i!UgXC~_9DQzm-670_98gtaj)dT7dP&WVB8z=#=Y1#Z0$gddoTW5
zje8?%+#50D-jtJ$dp#WQL*O6xp5i`Y@x2ImA2H<VN%s+>xf0qt<W`KGd-6VFt*raD
z?IUK5ePwM|)`DftSJrlAEm+okWewO~^L-w3nSbRzVs0z@h+!S(Gw&njj>I|_)^-M1
z`-ou=uv6Yg4C{A~xL9vK)qTXwer6}xN6hT+H4^Jd*mujF2Hj*IFSU=DStFMHw@zUn
zG55n0?<0nN%zXQZxhL31%ss_@#Nu)(JzwHJVptpZ%DQbIvD31Tn2UYHT-gWfZ?=z^
zwRYy&or!B_PyA!-Bj#csG52r2kC?Sq<&D3*wJKUy>WfqF@7uPI*x%7UV*WVSgnh(r
zz`BNIySMBkX2rRZ-FcON&FVAlBi1|Fn$=&ij~Llur@D_At<BKBzwv#<kRP&UMd_;d
ztyx+7h*@h^gq`DGv-(W?h*2KIZTBy7AF;$Z*DrM+u@6phA2D9HYGog>wtaxx_5nVA
zPI22lz-{{g!)K;#A7H0#AK+8@e#$?F{ob|@uzZ`NZ6DzHH#^$)0dCs|*!pJ2mukO%
z-hF`at&XOi<x`F#ma0BJ$G$w`-OC(1_Ko(%R^3jRjQWH*_GKQQR`&aC;%}ceW!&x@
z?dv#AeZtPJ1^D*q<=b)^e}?Ze(Kj&YJ0}xyia&ffE8Pvi@4Vsi@_S#v|9f$E#MqGL
zmm3jNL_V`A^i9tmo$!sJl%<B>3ptInr}J|7)sk=S@>DOTi1yL%fw|Xqvk%kv&FC8{
zjoXITA-<xUyKVITXf^hPr?`v&(tJB&AS!aJvzNo3!S{kT(6fi|%^-SyCcbCz67(?N
zGbl)Zn!ZWcZt#2HbCG)hbdT2o!)rChkHTvicwPM`d~X0J`3Y0p0DW7D;syr(;d`$e
z|KO~Y?c^V9;s<6gIJyje!(&iBX|o3&9fdr*`l$E4f*5=UCH9QISJ3}2qfYp}0@~lp
z{$9c1c9!2c*3aI>`Uvrp@ACBkp6>hLO0fd3ee(T#N1<G3ukYJ&W+DG5HlR~h&e9;R
zv=2XhkATXn1b+YIL;fhv$9}n_W>UpI^Id|Xkkfbo`91Kfb%@vK;SR*N^A3!DH(H2q
z=M`1FXJSGq?qVwPtQh%h$66Ra>^mYy;ZtA#?#bo_Ic;;WpZjj4?O~*i>JxoqfWE;%
zX`?jlRB4)9;OwF_EyxOOZ%I?gm!`@Gm(+X>X`=53P?}6kOQd}?G`PWSKllLRV301P
zkJ1(z+nA8H0+qISyuck(ytIARc{|jbhv8SgAgg8ne|($k=v?pHTut~k*HQSGH|hQV
z>Af-E=0f?+$;#fo96sd<zUIgay?=jBR>HTrn&4~R1Yh$e_?kDFZ*vvk+gx}qzr{zq
z2|nUYvUfj!ldFlom$XBFgA31+PdeVU7N2zJWqmIoE)PEGMqc7R|D*29?~&A}yvgTN
zKJpay`Oma{$|FsUXcOT>U5|a}R;hjHnzA#^KL1UabE;SKb4?}7=($upSFuX=p(9)?
z^K(tD`jlrT_>?#CKL7Pe=jYH?XGB`{DQ|ie`P|}D9%;hbdJ}xgO&gw%Jb_Pn6Z~MC
zJfHGN6VYs+a?;zHpF?`R{IKTd>RXwgYkJA#L3`xE4_1j!Iq_;`ey%C0PkCnCr@V>x
z`8RnGpPxhdd;9#45})!W+oxRZ^WS9ql=C;anmXMbISQZhdhA2D%G!snNqoweVea*Z
zS=K)P$j?^x`9~S?KL6<B)IR@BbMVX(=nB8`rryZwdaR${&^(Iv`EQE*m1mlL{+r-e
zUa#ionm$0kHXiT1`8Jn@<N3KJz0behzrP?p<lMi%a0>l9`CY`<(7AsnA9D3=^S{^r
zJ^BUp@8Hwczn?<?9!38S|J~2gzgxb8t*-lhdHs77{d@Ft_3xH1-6^fhwe|1bH#VF9
zhW-1k=-(5+xtY+v(>FJ*^|zM({Z{nvE#KU%Z{<5apQ(TE23xUJ-?_h{e>c8!r`W$+
z-|_MKcjSlVJ6GSzcYIp<_gm4ww|vK^zLoFze5U@L^5C@e@3)|TZ~5ltm)gIp@q5z#
zo&D!d*uVd$>fe!fo{!vLF@9Hjqcri}C{43?{N59`O(*P)(%Sf4#-_=}?==3P@%!_*
z()fK2#_#DEzZ-r$en+hHdh%CTrpE6y{>IpQ#Y3ksey1^a7LVT#^Z1>{|1^Hb9Kf#U
zKg0N)<^m>Q?A{OO3XI(!R^#{EV3Va_{7z%9HTZuz#_!89mZ$Oi3?9Ev!1$eFeQEqI
za~u@&FXQ*m67x^7<3ll)jmP}+INpx=r?D={Nj8qB7=CZed*X5Y4|p6;G5mk+IKE}9
z>mSE^ePN=1Prvqwa}+u@z8BI)^~l7=!zQ1cWL%$xF{w9KapG}(EsyId*8TI2>*KNG
zt&HnEo8~03<LLKI>^R2t$Qy|rKT2~$h#hZ2?6?`%`(np2o^LgF9Age&>^R2P)_48l
z<7*kuo7iz+5@N@Zm%i9>%nO`ooSp&Mv+&%h%nP)Q>A$!>pXO!T#`KZ4F+Kd>X%3Xe
z>lr*}pKMJ357OtKa7_Oh`uvlQ>D&5zGtVu3{%0QB`}%xqZ2x!O=YQt0zOT=>#`<l2
zekAEyz?atNw~h0~&$exx4;%G#&*OjIaX!9pjeSwuV_(#C?2Fm~`=WN7_tCeUCdY|9
zR}h=B*$Efq{Sy8B`}oFk!POD(UdI3M*?u42R?m;y0v*-`#(0=9z|b1St$4OzhsS3t
zXdhso9ir2kK>=jYeYZg5xshX>&D|X5xt{ojal1gr?YsB2Z>+z-nN0hUVej2a+DC=f
z^6N3~q_O8}?5!eum8F1w0oIQzaPGmrr(5tFJ+nW*{NAk8RCf>dKi$K7vFySAr?mD@
zy!K%KQ{l4*`=82lh+{Ck_hA21d2Sc;d{%x7mXG)Y{wKZO;NO1EzkR~=|7Q9orXOYc
zZ<)TC>3?SW@0tEQ)BnQsmzlnf>F+arJJS#GJ^3)u*p*`Bmf-rB^U$jC1??~g(tfGQ
z)4KMJ%g^=pMeTE@v;K**Js*aV9U?WW_pgrbKR-6&;r$Os3$6`EFF@>50b<GA5hJlb
zWe>LqG>M0La{rUj{n)E=I_UecFJ%#3u^%PHpuO<TFnk<vkNqfb!(Mju%#-_{@@Uw9
zl49px1;#vs{U>EF(<5DbxUY6CH2as18CF#DZddGE3Vy_+dVh6v;<=-09)=Fpko^?+
zi7wTkJqe!J`*VH;_6MoPzLQ0{7lYRzv*+S|$a(?1fSC`>fLF1XUv=&!W<OA)FZN5V
z-v21{dBh!c?&z8|;D`Mw2RyR>k!S^;c@)1@U|-7VphvN%BlgqGd9~{>qo+G!Oigv}
zrPyl{`%q$!$X}8!(C<;&yAs%K*o(3n`%u!}kH3T-FG2=>n~2}A*X0QO_EobF>eSrT
zX0KD)-*eQtV{59BK9WzmkbLNqW6Q73y&Up-$7PNkF|G!>PJFd%FSi1FR?;)H4=mDb
zWWCz8uhI8O)RS%C`4Z8w7bfk&x<9wS`x59>M%y5Vbfq;Z()B&iN$+gDFOPAWXphTk
zJVQ9b(4L>9Kkc8{4f~Pen%x(3T73>5-;e{phyHk$=1ItxV@{y_-r(%|;pEFPXQZ=h
z$-va7r>9q$JwqwIGmzi3Uuku2cciVmTLIj3_&ZdO{xJIL?fcv!_(!aUtohi3a|_}*
z_H<nxm)Qq0`yM>LJ_F|+m_xfB=QjAj9KgBl<L|$IALh>5cWA$TZc64|3-SNR*)uoK
zNy)hDU9>?(voGAd2W?N^_l~dcgL$+8JdZ|g&E0{Fb*~&Nx-UE6Y<L2DXFiGjyXYNz
zWyA7SHO(XM!#tbWJF}+Q*_D%CeoZ#cxtL?b`?Ue{D4m~Aa~kW>);(X~`NMq3?N<ZF
zO~ddzwPly%O8aHriuQ}zr6(J|cW(;vY{E!q#RbT}fuN5@UZh|z%{0)d{h~cHCw0hP
zN_%J)W~aN2SR4KtFlV5>yKmQ$njxMq$%^mbI<TA5`1SXmjZS`VeRSc!grgKUwi4Hc
z*zfgz`XARn<`udNadye~zK^(Y?B3`f$L@))9Q$eXtZ|=23o071w`HTdAA7M*%X`>;
z4Et8zf&D61BW`93%Klx{e_aR2za}s?vN;?M=QWO_?;*ar>Q&@n-;~UC&j+&W3(y~Y
z7|g;Rr8(>1tF^(-E1H+1IY%mk2J|r_z>D&IJNB#`-yvh^ER|<Zah_!ibatI6&q5t?
zwzuS2PCU;Rz2fEB9L&>6o~`Uy<u1gzvZ!-(VbPf;|0o|N&nO=$5C7V{o0=r=s4knl
z+cw3^yMLy<du`Pb<XxYX4CI|Rr%8TjeQ@4`x?YO&2z+X3pU5MheE;<osN<myq3y`)
zyB3)GK7TWwy(=Y!>idArffVOCn&+eXPWeiHJL6HGt^z;I(Z%<OTwd_Xs_~ti6>|dp
z?%EE2o_UZ_b5`WPvO8pLpMo-UP=+JXf4_ipOTc-q2xokcNMJHBKc0rNng>4VooJq~
zpV=dFIrDKlWMQ7q;}fv>q%fb3kbMQ7%V+-|!UXWHzJI~^d1Ob_p>EXoxzg+r>EM~e
zgRa0Hk>g;)zy~F0?Gt$pV)Y$odxz$t`|>H~3ch^3vG*kTJJ9?@JLnk0^R`b<Klpl4
zeA#rQaSD7U`rz6Z?_w1D|INj|f8Jh-9qO~vGnaNW^)(B2N#waY*hy69XW+f3x_t=m
zW_EhUQu-~1lYXnlZ~M{C5RLA;qb?i)j^2kUfz0|n&}Av&%=$szJ&?B?@{XYGIfUPj
z2S_ITh_H^;fcuBRBj83hM_{Ynj&|{IFa()7>)r?dy}<z5mz4Tqq_+>!+YvU~9HcoD
zYd44S8<mZNx`2Js;k%ep?;y=p#1HKv*?wflQ68*@J`VDoe0Y%0rp#|Ox_8UF9ceid
z%v|R}SM2}W`3Ulpd@lD$+MrVd?8j96CbSZyw-I_aK+h%A7C?vXNbdkVw+rcg4e1@&
z(OK~!e#iGz>vPg`OnUd?{$22$I-w=KM}k4*TPIF$$~r1vZy(4a<FgZn?zYd))w~ZR
zwJl`l_C|h?eM@;!0NzUi9qVtQx{%_S{3k!1dC;d9+8rwUUdXF@<ohcq5BPi5-+(;%
zknPwlD0?c0Un0%#qdW;$k8&u0T}$<~3Tf;eaJG}}OYhYb=vn|-VdO3O?2K<NdOZvs
z#AhcXz2nlUoR9kvQ%AbI4}U|_Z+z47xX+G_+XsELzYfybTu?scm=m7bV$Uy+c=ssd
z4oG`C>V(gpzum(m*z?OgKCRgE&1}y%kG$PE27A7l*7HKJ=kwVgm+WP#(^OZe@1rsZ
zq^7&?!qzwff80l~hPD+a*|JN}E;YcGrS_?j+NT~N*s`6L8h*T<w-jv{wS!A}J&*dw
zvFMM+!Onn<v0@3<^Df$VAbLIah(9p;z34XdhqPxp`QttsNsCtJKAQbAw72AsOV5%&
zE<N8K>w&e<18ai29>RLw0r+APp98st?oQA>UJZs9`Qr+&C&23}_Q$0*nb!2;d-r1f
zWg6PzPFR1r%E`FvR{TF^cIh!%i@7i*(mZx{;jtbmPV-fkKQ84D<x>>?xLNSWB|GG2
zY==<(h#fM&6+2`O@}@7Z=f(S0Ue6;t#Oqr-uIqukrvGU@kL-{q;lo;l@{uvsRmexO
zM<!uSCKXreU&-E}avKAiV<yfY;4H;@-i_G58GY!AfoC|4h5H(!1NSvXcjlJ5A=neU
zau>J*$NnKYz2ZRp`vK&ady8c|#{0fIBFDnv;sm?F>-!SzhQ3(Ov(qMa1LYan4YZy|
z`Lu)TPgbT`&!aRxrP7#*wIoVoC@W`sOB!>0X<V_zOC$N|QW^&qbu!-qpmdt_=3Qvg
z7{Zm(Y^Rm{bnUc~ooxE~JEnMPwfcF_M)LZ3>XZB8oR7LxY4`Ju-+P_<_7HrFsc)w~
zf8^}>$EeRoKi`ag{uuiC=Bub4png+6n0_ARNbk%X^z(NAJidVZW&7Q=1O2@8&)HcC
z{d_a}`Q|MFry2cxGxhV}u|6Fb@$)5nAsu;1_QD+O1ugc1i?vj%pO5oFKX3SSgzPKu
zTz*SG-;92~S^9YL^F_bYOn$yJw-<}|=bjHwlK#Be*Po9(h5kG<p+9e~Lpw=zafaQW
z!#8&|@&f&NGyPWG(x03AR{Hbi6ZYri7mWJB{dsfX?#QtS+Uk?`=V-G{e;!Hb&zozI
zpH_d4yo@wc+i&`F<iTp>CHnJbt3Pi>e-7QJov1(e(w5kt8(J&<dGiVT^UQ?)ym{)f
zmh}4ibNID-{ki9Zi~hX%1pRrl>d%|GKX3N+=ULpJBd?P5=gnJC_EZkO{@n7x<^H^x
z-k&MZ75#ZL`txS5KOaT?d2_r!hi~mvt~07XZ%*jXEnI8;`SIIQb~WFWy7t)ow6%Y_
zzTMiRQ`)cn^q<q$emt?m+U8(j#V0}7L3mH<&UYqX0=xGk*f;<Em(lm_9_uvjY40>;
zV4v)R9i3fWVEZ%$yR4&js19>B<-zh1J=?=p2|A5UXg^<}c!yiPcP2l0uCakHL*LNz
z&r4pv?9WS{?M&n0lymBDI^(>hAK)D*ZXc;Zy;_;?I16sT{Y|5s6@LnLUU%~u=PoVA
ze9tX7tAY;=r};L*If0{>kl))L$fn=vH+i1kmxICFb;p9|ud52~9-bdOuigoikJt`7
zsV8)}5;|M~9R@>(KS5VdkMyPMP(MWv;!C>p22FH%5Ay!pKGJj)e3t~zs*fN}i1K1l
zk+b4l<j2joIxCKSJ+L;OCn@D4j(vUPT6&)F<**+~*Qw|SDMo*_rSk`Phe=n;vtr~W
z<!LdV$2e;;>h0umJVSXPX}k-0bQEd)7o>-5=cC9g%3spkvGOB)?D(Z02hTL+q<^FI
zQJx&cvmc`@N&e-WR~ag=hD%-r&#7O0hL=|kmzkYcT}-*<uA{s<8a!(q<rmeRtB_Z}
z{>$jsDQ`$l3~7739ekcTI*p&846a7KdK`KANA$nNNNZ>0=cmw{%9ZTv7-+{+I@gDh
zH|T>*IsWR5bCxy*&t7-%PfMP?WF%}*eB<Dc;B^^vor3%(`#RRHrCxo2vV0R|^~d0O
z>kdIbl*_K&Dd*RhqrOnNyqt38_H^*cALBHVexxUr1?5qC^XS*NKnMC>0qI8d@VjSp
zURnp5UH5K)t$h$WeHuK+<fjuTA2AsH*_}u$<r6)tpDX{%@k^<^{{uRGf^w)szI{CL
zO1zg>;Qbtj_jD}Y*D-6GZyLQ8@9zrg%bbzXk{jpGE(!M>SU6<J#f29S?Hispb>WN>
ze2OZ3<KUr}UOM>Fl3wBIbEihH4}WLIjSFXkKJe21h5auM_nft8QR%|V1`L?$@#ug3
z{Q1|<ow0EKw{M(2qyO~z^9C%MKY#A@SyN|62h5%Ooq7FAZ=8R_jOmNQCBtS89X4}t
z$-ql4xnxkukivl%&lobjaM<8sLuL+|HmGpM^cjOnE*^Br#W0@ez?_sh0{{0KCvbCK
z;QY*dL+iryFki35wJ-nw1_sp5=<MQaGrJbwm$EYTNA3PC{l^{e&-_XDs?fi8{^{8d
zcIg-#-Yzr0_}Xme^*4U~=6}ESo8SKKo!^hn=s3C+qNl^1%)2{ZN!|ne|C&>f7y69y
zjxz5sUrAmjj1oFdNBU+l@34{JI3(}p(<tvP=56QaA*Q``3i%oNjQM#57Ha6Q<z2_L
z(;;tTEAn<Q?R3<ao@l^z`i3*@bjZ8E6?spbMtSL&z|rZ;W!mXT-{Mx}!Ee_br$gSs
zR^%N!jq<KVhe$_v?_%C}j91LD{uJK7@MnDgUT#I++ow_9P)Y+1N#7#;KY?j)VS)$!
zLuKH)6Lb)n?KAU%&^<)TvDV48t&t&y`me1l_aMLjL^Ev;uF_5r?NBQ?2gVK^_OqQ^
zp}}tU;f6EKmNBUnT1hLk#jVhmwL+_Eg|?n)F)O_<E80+K`!>@ush*F{E}fj&HDdSI
zKh1tH)G@dtn3-QXS;~RBX?nH`HdLddiew~tHdvaH_$Z)P;3OvzI<CM%J)SKOPJS>o
z?TU73SEi?p@0fN~X4-`8w5vmD?ipzlJ9i8o%*u9t-|mWbSGF79?y7bZ+FjkwZ8vdr
z1|Fp{t72ZM-1ZUw^-Q~;uA{SKfon~w($lW!n094m+W73Wt3qiL&PcnubDDd0+Qcrw
z#pxz_S_tuXI?x}-k@lVVW87noFGBxf=4I=@=nLc@Q~V>){0*kPL76x@yCE<s?TVDN
zD^t_Pw@bS!J#9kAw5v1I-0ZZ8q2T6>Y)5B{XaCVVjH5f}dj$XYW!mTATdMd{epfK<
zizv^X%*!s%eP1B|LdsJd!k_ApsjRqe<o<+c*S3P2%QPET-U@Cd({@<=9&ZJ=xfR?_
zg&PfB_Azaryf2gQOZq+rU#54(S0zlH=$i><IHWF9IwMT8b)BqmRK~NI_A=F{(b-k4
z_YG$}V1^IDJJBWqB8?J;4{yKodpzi1nh^4FQrAZRQxiwYqAE}KlvEN$|5NjWH3_3T
z-JgN;Oq}%pSvb$ec@E#7i|cv(e=e?Fapv)T7}o;+{{mdQ<Ltrr7vb8I|L=`!ADn&p
zzCW%5`2T^pUW{`P-w(kRb2mm8YH#5$;9SP{G)Y2}2&5<c2b>7bkvQpo6izBr`hP6W
zaX2Y|>3%%UtN8z`admM{<omDTdJX@NxEJReIRA<7X)N+h{vY2yajwJpuY5lR*JA#E
z8m`lEmhk;dT(9T<XXAPU&N+NP57#Kp`Fy_s*Bfyz<oj>q`W>9#<@+*R|1Zv)`2Ksi
zejn!&zP|<6TXEjT_qXGE2hJbx{SR@y3+Gb4UykeDIPc;66}aAu^FF@+5w8D+^T&Mu
z6I@r}{CB>85Z9mLe2DK?<N7epNBF)P*GF+a#`kM+UB~~^B-xYve=T31!Sz}Ge*<5C
zf$K*8|NrrIGp^6^|IhPv3$8El|6BRG4cC|W|6lQSJFYwU|5y3C6W3k*|Lc7HHLh>+
z|8Md2x48a}|NlK-cjH>e|G&%EeYo!D{}1r>eOy1_{}1u?LtKyW|BZb82-lBsp6m#k
zH#`wFcre|kCKCBBC`O$1>mLTuO?!*d@^4T&{T7n5*5Er>l$L*krd4UVr~j@s_>4p%
z-vv#}llarw2A`csjN_>#O+4PXnC|^_q6SS%M*p=O_Zs{eEd=YoplR(a0{*?y;Ll1V
z@?FrhiitmE8$7j^{v+s|>m$BCkVt+yQG*V(u!+Y-rhNT$LIq7roQU6V@{?L<{}FV;
zKH>ug@23+m=v?5#UuE!qx`(IMKk?{b@P0a>g3d*WVBEcA^3zZE@V$NbWd`r3dwA+`
z5|2>^@23+g==4tn<1XFc{d5m+3NzuER}9Hd_wXh&67U74eEoC}KO_N5H*XoJpYGwQ
z$4or#F?c_nP(jnPCgR5!{AGzmz6(0Tee|Hg`{@J>nqE5bku4@aFHa=$UC{LAi9ani
z_>qakIDV9mKEmMrbOHvAWsvwtiouUfB=TL*SP+Rny=01(EDQe;G?qpp{d`lt;}eN|
z7j(!PNj(0`<forbsGzZ067fGYc(P{vN6`72k9fJk`{@J>I+K0)W|KdDx`!uADe?FZ
zgZI-36*RLwiTE20{@O$$-vu4Ax)P5|4c<>DRM1#wiTGoty#6(j$ag_!ijTg<;Qe$0
z2Ayd>{8^@a{d5mc7GdJC!{oo8PN<+WGZBot+YH`M_wciQ_+bX`r+av^LKBZan*8+B
z2^DnaC4zCc!QlOL4^LKY;xX6Y{d7VFodt<t+zm8%Ki$JG^x;1><>jY)_;360|6%Zc
zx`!vLJMqXd<?E*tD(H}Po_K6C`R}I_Drl_uMEv&*{-#7C-vyoT`RIcT-cKiB(2NQa
zA89oCxg?RucR}YCAN?tV_tOa&G^32fM`jxQZHYv_3p%&^=zR>{PbXl|j9L;OX)xvW
zgG3_V1)U%I=o<{)PbXl|jDiv$>0rutX(EyDg3fXuJ!bOXPbXl|jH(hJ`L4m=lSt&d
zptHh9?`QCSIst=bl$Q8Ny~)q}5{Y~lbbjQcuQhl-oq$0z>Pvj2*x-MhNaVYq^AjJv
zhr#>l1Pq!{Wa1+qnDYAfL?Yh>od<pNrwratCt%QwN)sOmn(}=pk;r#JXSI+1|4jb-
z=>!a#QEuWR3k?2|L?Yh>ooXNbB7^tS2^ch^=EO(#oBVt%k;r#JXRVL^h{5~m1PnSq
z^Wp!+;Qe$DU*p5)8@!+H;b~N#c<eLf<);%W=sc4M#@$+j_tQQ61|PoJ<fotR;eX-7
zuQzx<-NVytL*g;V;Qe$$1)a@_VB8fLyr1sjpZDQ+oBZ_CJ^U6Q{y~HH(>?rFAAYjI
z`{^E@W=j%}a}C~4Csfe+RU#O7@0jxP(>?rlAN~=8_tQQ6t3Lc6O@8|69)70}|D?hD
z=^p-dAAW|x`{^G3*FOCD2JfePc$zgzJbq*H(@!T<(4pC-#N)>X@23+g==?qrj62uh
z{d5n%+lN2X;Qe$DPqSHx$6Kbn{B%MEoqdU5+&yUUe!7Q0;KTPb?X#cm;otY+>rMXq
z=^mbD*%FV34c<>DRM7b_5sbU98N8qF;TwJU9E11MJ^V*L{3|B^{q%PXpHF@G9~t^l
zAN{9iJ5INh)HprN|NUzY(c8!A#%Bk2oq7?yrQJ4bc%UySAo{#GUe<dbDI|JJyDe)Q
z6VD`iMjYRr|C<sddUl*{d=+r_iwlVUOq_1kvT&DoF3}gn>9SUw*N5mW?YXQc)tmI5
z5yyx5KMIiUmU32{F6mum(%aI`OL~jC5&qk8yrlO6)Z1<;E$zId_Xe=;mI7t@2=jF-
zvY=Z^u8=+7DBOMLBBHmn{~~uGrsTS%l*REP_ow}d-qQYy-1kjBhvRt3=U=7~9+}FA
ztmpp<fNm)*{eoGG1ZK^7ME{<^<Lmi(m;&pTvNcZcj`E}90V5ZQ;6vozn@aeWc{Y(7
zF>+h_3z56Wl<zIVCNB4<rhI=Dr;FUKCZCZRe2Cl?9Z4<<hYzV&hc6`hb|E`buWGvz
zy=8n6uU96YUyb9XUhV8m_#tt+$o)SZh(0t<7r7-yZcG0nau1^_bW8bR94~Tz+K=e3
z$LS*XHY0a<oGx<V^9}svak|L;T@RxFI!>3h(%wey@)mlE_ivt&+tTld+)IqyQE|M;
zJ=%`=kB!qs?lnekOMfJCuRovgE8_TgdQH7*>5oKiim6vE^I#&kFZAt}a&?@K$n9_1
zjh22&)=|IJh44R$<KuEsHM^y>^iv{t1DcF(DPN1@MQ#%)-BKpU=_0q<v=95@bdh`i
zIfVa7oGx<njNF#~OXU8-)aPsCc#-?ZOybire`S20fI4p4jrZetvnGwZOY#Z-V4N<#
zEqMco-qNp0yYV&CPELvAMQ-nG!cU9SMedzgr0tgSVVo}M-5e(R>Ns8GUSRr##yDN%
zrW(03<8+bxVkhD=J5Dz~P`LZoL9MUiG@0~P$MKn|-oO9Hl;hesy$bb)jz>&BeB|BW
z@5|hd;k7Wwc>&Cs^Z#_&%Fmq-`fn`y+ZMg0wqso`3B3!;AwD+$Lrgyt^fZe<VnNMu
zmZF#9y`zKl{GIo&`5Wf{iQe)yCF=i<g}3!@d215&x9PV2Hh)`xbaC;+*59U&w)C%y
zqn-Fl7U}=4MYr>RuSK`@-)GV7{I}`0{x*MGe^kBrVe4<x?fl;#M<?pv@^&ZY|3M3H
z>)-MgC+5FRxAnLA+xnx)i66H9Hr>|$gE-o8!u&twe@iQY_rt2shb?@aMQ>>h9Oq~f
zdahOfZT_Ms)&H&*|BtQuZ_^i9_2-C%5A*+|e@knVsQ(`<ysdvrYmlhFO}F*8`P=$m
zVDY#0x9PV2A6xh^|4;gVYSHcb|3`~%*Po*n-LC&O-L5}2f4lzlviL~4sQt0&_WMhH
zq8wrVhxGrm5OKBjKW5Qw{hKYit-npT^|$%k`lD%&AGZEB-PZpvadcw+H%>tOo2`EU
zX_Ld&AMu&-!`9!X+xpx5ZT(xUO2@JFx9PV2K}&9!HK6=Yv*@<|?JT;je|w8=>u=L-
z{cZlX{$GjbLZbdQ-PS+dl56YV(W2Y>XIOMwe~C9C@wWap-PYgcZ|grYiT*a-)<4VA
z$JRf`qTBk1EV`{fzN-^IZ2fJzt-sCR)_+`_OJe@pbX)&3EV;J+oh`bpKeYvN*!rJs
z(QW;0x~;#>-`2mys!!D4rcbuo|8p$4w*Kc@bX$LVH{`JOC!0(TTYsBw>u>Y7_5Zps
z!PS0$ZMv<0t|d3j&ytRL7QLM5qzmG{<40u@`uZgFtx4!&BWeCpS2cYo>!9f+N$3wG
zp-Wtq=5sI!KHah_?0guUggz??{qZF9eM#tceX!+rw(J?39!Wx9oP_>F68h#O^tY1G
zk0qh^P4x<1=kwwu^r|Fu8Ruy}68od+5gyEF`gKX@*tg#tgb#BaAj0M(bcx9!y#2nU
za{Hj=<|d(Ek%TUGvgU(0-ngE2xxbu*E-^4<-+t43)cozz-n*eT)uvy^bS-yf68f4X
zbctEfd=4eShcJ&shsKvMo!TYD?8lFdN$>}g&=G%b4&u|z;uB%ImMgIxn!Yj#{$LV%
zsG}!W^BJ0iUXp}<XA=6xBy>#Mn1jmwU-^H!VEWk{RPL?O2|txFbiwqSIS6mlZT>SD
zLl>LBO}Fv0li*vUlRon-yseK-7rBIAkOXhjZTz>B;BC5%FH3^A={Ej*N$@t^#@~_z
zZ_{o3?Md)9-Nyeg3ErmL_~l9PHr>XrNP@TNg^Z!{`jLen%>Pq;v+36{UB5>UB%wc%
zg#L08`o~G=snCNCEjN;cJ}C)(Q4;zS7Ts>&Hd}PNoqszCeR2}}p&|)=O%nQBN$B>x
zimlJkB>jF#68fD<=*jGj(O&lZ@_%v?`r;(?HA(1oN$7=1^7*<X^gEN#Urs{*I0-$R
zB>%AwhdFdTtYZD?J^Bg%PZvqA(B=JnT;aofFYk-s<^9~qzxPr6H!D67zL)n)@FI7I
z!cXG+H~1>}FyFt$SJ9`K@9X#~c+vBaqDT0?fv>`+l<#G3O8AIAGDjr%a>h$LAoyaY
z%N&B>E153i7r~2M8G8!8it)Kz9|T{{bg@MRU(58K3NLc|GF|X7#t&BbDyGYLO7J_G
zF72D>BXUP8{&kF>p!mm_F72W4Z(#bh3NLcy{Sv&xI2qrGK6T7zmeNP^y;SiRxzY{`
zf63pQ6<*|)EB=Lif2YEW++_+M;rmL37d|T$zL@VHQ1~$4S1J4?zF(v8BKL8HFXemb
zcO*YWZmq&s^8H4>3SQ)HR`_zhk14#!-Ky|aeE+h-i`*RwFMM|@yvTh+;cNL`#`~hb
z$bDPk>-b)-f{!tMpTdhC2bnH-k$Xtt8~A=Wx95Tvd2sSEhtP%p&5AC3%6Yu3@r%<E
z`3V1GiY|Pf;BlF}7n4}OT1AgAeJj&NuHa?=0^w84_?-$beBM(0OBpZYN8vAgWc(;}
z!LQ+QpU8EX&*O?7X8IF~9%6c}q8BoKGt)(`@Q*2cgz;MyUgW;4@WqVZq41*5PKBSu
z_%{?@<i4fwrHp@D;YF^j+e^A6y@wQD<Q`RY;V=6ENdAjHi+Fr0bm6mD(M6w|6<zqR
zRP->X>wZNqWcmY&9%6cxqB~5-erO5ro#_9BqKn-1iY{_DE4s*iS<ywV>~kRbKZ*6J
zQ}|-0A5`>GrgzCq)L;076<zqq9snXY!h8lRyztldWI5v>_ry9<zLiXWLeZ<3E_Q_A
zYnd+gr0663V~S6V@mm$WlG{PC8-<VP^R~k8WIhL(E_l)Nkiyq7UdD-n7yY$8DR^y9
zhPWMfRKFnYc)IFGB)ypm-@y8W6khmuR(P2g&Q*BHhp@s+Kh#~}MQ%@p4|BTuD!j-o
zRQOWHi~TA2DRPG^d?Di_ioeJmt?-i=e}%$}+zAR_#rR1IFLEa<d@<v-9V>FLQ}}Ym
z7c2fEw?yH0GJclAi`=;iU&;7Vg%`Pt6uy@6ixpnv-mLHvvR|(7BDX@}W6b|fg%`QY
z6uyq}l?pF%S1NoVzwh@eyvTh(;TxELmBNeMH3}bM{*NoX$bCZLOBr9Q@FI7;!iO2Z
zQQ<}IW`&P1KBn-(XRE>&GyY|T7d|@_eiGxmaJwS!qtJJ7{s~>uE9*f*7r9-SpU}(s
zKCI}Kd@t)Y(k}@83bt2;E_`HPHsLRL*_%!1f}hLlBf>}U;twNq!B;R|_z3=fMHhUP
z>MyD|U27D*mg&0Rj4@sJn>(4lk@<)|!e9DL(Z7!IFDtyr-J$epV7#7(5q+dT75?HR
zSf}`lp3-lMo}!P8zlBeT%T@QAqL1!3!;DW=^;z^uSM|A&@gap5xt$eW>R+zHi`=ln
zPh$Q(6<*}_Rrq4Y4_0`QJ5=FI86Q!2kvm%9%NajG;YIEwg|B4%wF)nCuT%Ic#+N9(
z$epF|wTv%Sc#*qE;bV-yS>Z))xx(*c{GAFfa+fK59pft%Uihq3c!%Hf2NYiPtWx*}
z=D$YaMegGYA7cJbD7?t6Rro^2>;6LIZdUj(<70}y$la>&5yro)@FI7I!WT1sr^1We
zHxzyn<KI$vk^8p7movUj;YIE~g)e3NL4_B&hZMe&@p>Lc<T|>)W4xY+5kBSIj!L^H
z`sjHW;jiamgpZzwX<)f}9;S}zdLBmbdLBl$P}1`-!bi`;gm_*?&%+2GJr5&zJr7gG
zdg^(Y7}NDUOs%9h-Roeazu3uiJr5)N^*oHEOV7iITs;pX>C*EsqK}@3k$l$kFd|pa
z!$|(<c^Hwa=V2thdLBmP>UkL9ujgSzA3YBveDpkw=%eRhgukALk^I#2FrvSnhpFXq
z)blV^OxN=;qQ9Pp5xIIEM&#;w7?G>zVMMN;hiPDa^gN8@kDiB-{L%9;!bi`;2p>HU
zBk9%iFv7oz?JjvQ!u+1DQS?HlYdbT-bZuu&V!F07g}=5liy5!&Op&YY%u>c{J5%)0
zc4j%_>o{G~u8N-8&J=yLomt6zw4EvXXgjlt@u{jG5q;8CKT^y1kiv`H&I%u6e6GTa
z+_1v$WPDGB7rA{EzK-#O6<*|OJF|iD5rr4IqZNO%Nhiu=g2Id3NeVB1UE0nRxz{Ot
znA`ml#b4ykQuso~mnyu-U8L|4#^0>)BDY-OCo%p`g%`QY6uy}8l?pF>Rw{fs;~!9X
z(X&e7OBugL;YIG_3SY_iClp@f)+&50<F%bBayKh{72{)yzsTLH@G-`}tneathr-t}
zey75V+&2_{C*!r9DRSRdc-ca-PVpDH`xL%``5#nxk$XttLmj*ZOxu|vSKFDwU)!0&
zN86c#*LJ4x*LJ4x(ROAj>nZJu^e@Fs*LJ4hwVheccxgYR-4;ID&a7m-wljr~wlf8<
z?aVOq(ROBp>DtaLWO^-^r=)ih)3u!`{G}cVzL@da&J?-Y&MarVwlhT^sYk-Ul=0fm
z6uH{YtYo~lGexepGbO#+&J?-Y&J_OI&J=yLohf{@ohkZgJ5%^;J2S%R(st$~rfWO1
zkm=ga3^QHZnWDe8GexepGexepGexepGexepGfP<?ZD*D<UE7(JOxJd%@X>ar@X>Z=
zG4s)Ortp7&?JlW@RgAAv^jfBC`!mM$#}$4j)7LXy+6Un;_NU0LWBgWy7r8Gh{tb-Z
zsqmtY*q_4R;q}zF6<+i_sOX}P*q_2D#C$$hc+p4fPr-*7@2Gx6^hs6yNFn1h6<*|q
z6h6ZEE($Mla}|CP<GU-o$nB}{#f<N(@WQ81;ma96RN+O>;R;{M_=v)b+|deO$@nW2
zUgS<t_*%wKR(O$nt-@C^{yK#hxy1?}V|<Cii`-cXU&r{l3NLa?6@Dk<#lDsINaQY7
z_y)$`toV!Ea)l3Z(0ql$i`+XEUbfa=rtl)SQsKkQU+iJgU*z7e@Dav8p!kd2DutKt
zJFHQ7k^8v9Ph$R0D7?t6RrqqouUB}HyHVkb8NXTKMQ%*tD;d94;f2r33SY|jje6da
z>9Q^=`7HX&`lrxE?sYt$Ep)+4{HD-F?kt`!5xVdx;qj%kdok8$mZI-u`dme?VtT2f
z*E0QPri)zRU!my2zf#eK|NV+C{KMRzX#Kk@y72F*=)%9Rq6`0_OxOBH6kYgFP;}ux
zS<!{R?#Jsm->SHul5{mNUH9YWBOJi$ems=vG0^?E@Ynsg*d@9j7rDA0FJ%6@9~XUe
zKOSMc?#D$>-H(etx*wm!d~`o9`sjYVnDLH!Peq?p{hl&DQ{hE!Na4#F-$mg?Zmz;t
zGQPXQmomMl!dEf9ufhwTLWPepeyGBWp2HQsmhlmV7rCPqekbFvP<W9$LE#%1ulsS4
zd#%FPG5$KmU*r}myp!eC^Ad#@xw8~L%=ozqFLFy2KE!z4kBi*J3SY?hn-zbNTdwev
z7+<0ABKJ;(k1&3j!i(HWg)e5j?#D&${R&^s_y-h!kz1wkrHo&r@FMqdg|B4%6ACYK
zYZX4mc-@bS+>Huf#rVyNzsQX#{7%MiRe0g^vclIgUiafd*ZsKYulsS4tNU@m>waAL
z>waAL=zd&2jiUSU5cch&L-*r#oG#suH!xlI<HBF}<HBF}<HBF}<HBF}<HBF}<HBF}
z<HBF}<HBF}<HBF}<HBF}<HBF}<HBF}%VExE-7gn1{Ryua;(oairq?R^B&Kg>y4WGY
zKc?`-jF)~~?1#dT2YgHM5q+dz7JMo5(fzXMc}U4EXT0v0MStm+MSsB`Q+#TfkE7nZ
zFzcVL-cw0$rovY;pOC@}|IP|u$M{@@FJ*dI;j5V5UExJ;Plb;$zOTZI+(Ly9<#-u0
zRN+PLaE0H={38l4az`tC1LLnyc#%6n;UlciB!w5blNH{45DrPWR^dhNbqXJ5{>2I}
za!VAxl<~6^UgXYI_(H~)D!j;Dr0|m%zgXc#?#&8c#rSfC7r7M*U(EPB6<*{nQ}}Ym
zS1P>7U8(Rp8GpaRi`)kkzLN1(3NLckD10sBA6Iyh`-H-W`2DR_c#*qa;bY8yqr!{a
z%?e+~_?W^ApREcn8zH=`@WN+@!Z$E~?SCtD?SCuj)&934SNq>e`xZ|1-g{{$rQMG3
zcwgFQp=<wJ;iLU;1+V>Y1+V>Y1+V>Y1+V>Y1+V>Y1+V+Z2-gSQKTcx0?jMV#{;2+<
zl<B&E6#g-VFK4{&A1Cov(7JyVeRTg=$$WJGD0=Gtv5N7!e-!<7|0sCfKkj5cj;fy#
z)<0d<XGw3S!q+mNkirZ9&I<2z@-i}4;VYR>Sm9$#@2>D7x2M9_F}|<Di`+tmFJyg&
zD!j-YuJ8@aKces=ceKKXnEw?DFLEa+d@<uEDZI#?tngvRU#svU_d11-FuqvfMQ(}0
zS2BK<!i(Iw3O|YQr3x={7b$!x;}<Ku$h}$NV~j6Xc#&J7@a2rZQ{hGKGKH^Ve5JyR
z+?5L7!1((WUgSQY@U@JuQh1TOM&Wld{&9sDxlbs3A-})13NLckD|{XE->C2+ceBFF
zrz~R%FMPHte3<olS>c7x4uuafUiXhe*ZrfUSND%1SND$*=CAw5Nle%MqtJE#D13DP
zD0tmJ3SRe*g4g|{;C25fc-=n={!Z0T6?3|(m@f8!(8C-DB=&&NN2~ZCq02sX8s9~&
zM+jc)Q<_8{p=*7FuJsYR)<@`CAE9e~%9H3L^qwkzgf9EENPY@Elk-9HN9ctre}t~}
zsZ64e(6v57*ZK%u>mzinkI<!_i2hZqkG8vNnf|z{Z!xB8yK5)YH>!Fl{Kf7Pxpj<>
zDgITRJ%YBoYMK6q;xBrNJtq7cnEyeA7yY%}Wj;g>thT!(U1E0$|4P=!QSF|jD^<69
zXL^ccD!k|!Qur|AJ1cyM>0J~)!t}7hOS-x%d?Dj|D!j<;tMHQ;U#RdRcd){jGJd$i
zi`<C97c+je!i(H16uzAC6BJ(LPEz<P#!pswk$bJeS2F%Og%`QS3SZ0k5``DJvlM<O
z<L4^8$Sqa)7~>ZyyvSXw@O6y8S>Z))xx&i^ffWiba_?052Ijv^;YDtx!iV^MS*h?M
z_kM*hWc&jPFLJ9CKFs(v3NLaWSNI6ypHO&_TdVNJj9;(tB6p+0Ph$LLg%`Oog)e3N
zR)rTnFDraG;}5BRNAyfh_1YWhzl49Tq6?qyieAb5ixs_!>9Z8Qmg#q@`3Ip_D!TBg
zQvL~oU$5wb-^~6A(hduLtD+134du@u_=Acrc->#eI9*j<b~=)uLf8GZ&~<+;blqPI
zUH8{Qe}Luc{o=MJq09V(#&_rXqv`UVYP!@<O+S=`PdeLC8b2usUF<rIzn1H>rdKAR
z=W;&KUh=G(p%hwle$-HwS#)+4F_bEc&Mp{+a?GOh5|^QbSQyFWDL+G(_MGV4L>hXz
zg+GgV(&cT7ey&Atu;}Mobg5UwAD^s=AH|%{L@$U_vG1`(?_tqpzYxM-WYPO_W)Z!Q
zMUPnYeir=!i$2hz*IM*J7G1upL;Nqb=rUd-`Y?-rGq*EDA7RleE&Ama{g6c;WzijO
zPl(SLi!SS`M8DFams<F%Ecy<MKGCArS@f@2^x@pj5dUvj^hp-|pDnuV|4jIAS@gFp
z{1l5WacP8~ZqZY@aufY}i{8be&#~xzE&6<m9<k^PE&61O{#}bM>&PVcCW|iX!bD$U
z(PjOY=(kz)H5UILSoDn+eW^v?VbSlg=n~IF{O_~qx#`{w(SK~wueIp^ZqX%9f$$Gn
z^o<t&A&Z{MjR@gaTl6j#{Sk{^V$rKD`eKXzm_^@e(brn^w=DY4EP5{cjgme!7QN7-
zKV{Ly|DW(rTl70E{IeGQ4U4|PqKn@<@%e>CADrRc5Pg$Hzrv#bhef~6qCaQROD+2I
z7QMovZ?Wk2Tl5z#`V$uYmli!{(O<IY^1VUQ|5q0MpoQOV(F-%Z8^XV0(MMbK*DU(A
z7JZjRpKH-yx9Cp)MKcyJa{5o7KX2ZQDE^r{J342^js51AE}A_*y3px={f+a#UF!6Y
z&R;a6|2X#>{T42oI(?4Q|Hc_}r}m#QYs$<Ur_P(<^k2B>#zj-7;aWD&T+Pq_pS(AL
ztEy<@$IrbN?XqNwXylUDr2<mpvSS)o1qDP!z*4g=$ReBUD!5YVn_DGDWok*=o04sB
zR#x_=)?1`jmMyluE?HUhzM5J|iTu9LoSAzMhq*$$__N>tKOZ<V=Q+>*%*>fHXYL&0
zJk&mILULJ<)t(SHYII_vedMS(`-G9>W0Dg`j*hWf?e?64vXa8m!jiJM3CVVAxP5ef
zT4`xc`pEp5iG}$&=@l_afQQ-b`I)7qaTOIYF^LrkGpsQ&F>_L^_T(^oN}!zxLvzY9
zOVY{;OYCJOX*p%3akvy?4b8~O%E~OsEJ)9^msJ#H#z4iA!i==Cw7;NU<k60IS$R2J
zR{qy>S%>I#VO%zME?hSEujjH3(d)vvtgH+!EBouYtV8s=FfJ=Ch099+dM@h_y)KN)
zX3c`jX8rYC)**Ub7?<Ve!)5t@J(qQeUKhq?xw&vz?qAPk9irETaam3dT$c0Kb6JPz
zbzxkVoeh^||MgtfA$naHmt|$aWm$hcmvx9<7sh278E{#~U(aP7qSu9SS$aBLmj2gs
zS%>I#VO*A$2A8G%^<35=dR-WoWoE)<nF%uj|6(&49ims8To!J()3i@$oOXgo6(19m
zi)o$YQ0HHYoliNnIzfV|A~u_(<*H5_(UcM6`oA$#CoVdOnfgfILCn;L-40@=J_dFW
zGxY(fgP5t04jsfy9aMJ^Gj+JxLCn;FSO+mvhbSGyOf=FCX-?`$po271?~xtEOuc)w
zgIN%|ww!{}%o3VHXT1?lF~MGxpIMgKth*B((+o|=)cW-F|Hi*fopakoi0<%0nIPle
z!6t}K_(GW=<KMw1h_3%anIPle!6t|s&V@2T#=nD25VyGtWrB=<2b&;nt{2J#8UGG8
zLEO?WlnFBa9c+RaNL(lrWc)kW1TlQMP$tOucd!X!&~%|pkn!(e6U0#MLYW}r-@zt`
z0pf)+LB_v>O%TJ<3uS_ge+Qc&2E!N11R4J}nP82u+h<_GM`oG5C=DZS8gq{dpJNRV
zL~^yJB(Xw2JrEOvRU{!rX*nfv7>mz{iAfH(;}2_0+B)&jK1Is4iqKg1Vkt6Ls|bx)
zFP0)@T19Bwd9f5J)ha@x$BU)NEUh9m2E15`<ZBh7k=(^nBv-2ljmIvQA~{+`XjFBv
z6v@^qLSv(grAU@m5gOrKEJZT3iqK8|VkwfYRfKNU7fX>ets->8J)a`2PPAJi?dlyj
zEuYVEVS=mGJFiv+b@mI>{4p`=T25Nd8DyV`8?d@8_56!8|7ZE?)Y8S1ug(iyJo)OR
z&c&0j&d6Lm`Ra7a#gnhjg<L%O>O{uHldsM~Ts-;e6vD-muRi~~kl)4?^#5}ws6N5F
zP~!i>O+bD8zIgK0XXlG2Uw!bE%O6xeG%`}bF@hb#*)fbAL)kHe9fNVq7#hUNR(4bm
z5sZ`_!*R?Q8pe*H>=?q1!8n!=4Pr+tgRo*`I3s1paCQu1$53_*VaH&048k#EsFju3
zAu^1S;+QcsoE^j1F_axca4a7h%*sJwjvr&BmzG)C74^u9k)ezcJBG7k7(0ftV+f8J
zLxWj4h#jr!F_2wg<;W1m0Y|99j$!N=%8ns8LKSulVh}4UTLW3f4w1o(13QMZV;DPz
zvSSE42IC0tv$9n^2C5en{A#7FEGvk3M6zQ9j?jf2!`LyD!9!R%n3aQA*=l7c{20h!
z3=(N&DzRfYJBG1iD2^FJLs&VO9fKIeYULS`Sp(S>c8CmQjBtcT>=?$5p$s0vj=>BP
z#L8BFWSRJxtoD~g?JAD}l}SQ*;1quFgoGG2ODfa}qI3G^KXY_kusKT23;buE4xk04
zZjLi&A(3yqz<)NS{EkbX;a|{;d~HuIpZ{J~aIo=$MF4m%=mhv)&@-5hKJ`x3QeTcp
z@(GXsY)}z!3t%$+r*r-Jwq#6y+UrEf7x^35r<3_lFCVy+#P8tMGbg<`e--pH{mZ%j
zn>ZrrPd~NP>p%H2RlZRtKZO4-Qy*8=D?+-WSWuMNpD&3Y{l;C`E%LbTa{GsK`GcII
zSV_<ca5U%{OsBtPS<Cp*PyF=uTL6>kUoMH?*T5C>MZObqrSaqXKdy72paUzG=y%>S
z{Uf;k+W66yu6q4%LgOX*`uMr={a<zB8Llc>Jz9{->|Z8{-(lbi{YCz*i}vTm<r9Bx
z5_AG~$VK}*B#9qw4Wzf<0+>wyYDxT#09VKt`AJ^?JL~GtV6J~_?e9OJXS{UuXC(2X
z{R8y+FGB|*i=V<b8)$F*9+$-LJBj@nkRz+VW-i|X8f_AO6EHjQWcJrAC$5U4pQQeW
z_DRs&Zvjjezvm?J`yRMLzR0geqn7FK$MtV5e*Hl&(|;S+e-mU<BK>L43cdc@xqN;5
zJKLM6THY5`uc+7PXu-eC{vDF|)dN@9E%I+%^q+2ggN;F;(I!DBVE=Z}f2OWz89xh%
z^!5`>rvF|^{C)zikT3FUu>XQIeq8?px&|QVz>1{-pl2{$`zz=AYvVT%6ngz%=koRO
zQwSMJC!Xo5UQv%0WHS4|lEm)>aE1ONzu!gt%v}B;RgB{(=men3Mf@x)TgLAi5b5o=
z04CG_m?VBb16Rlw`DuRtY0-aj{acIQanLhfy7)zK{k8E6km$bx#AK;Her|+})ZX}=
zk;Ly8@Dp~6{Bra&vij@A<qu+7I1hqOK)hY_pNAyz8w#Sf#?LKBjlXvM`77v!e375R
zz7sP21G)aKjbHu?dd5o^zcZ5fSta@}_mIc$<3QCz?Tw!gw_p4GAja^-S=hfD`$Wm?
z|BA~Wq^jXK3OWJ!7wBd7*YFM2#B&144#j_4<7bh??+?%m`6Ax|hBEyXayC+H@p}#Q
zGX1x4{Wqy>*!?d8Wxf74^7^B1e~*W&gzb%Apd@}xU@7bt`9c@*+rs4!;`)nB(24VM
z7x7EIOKm^e_zee<-hK;Uvi@_pBz_bqAz$Qo;W<GTzkOW)*5bDe^o*CT{gre5wegFR
z=syq!k$ipp%5DG<slD+_ki^eTVt=5E_$}b_2dQc}j>2yOaIK5@S?(sQnvXw6<Gii$
zn<9xH?Exd?i+ma!M3VIPzZ$N8Yw?>5dd5o^zX-0sHhyCy`qMsABwruD=okQzaJgAh
zz2XE}P?Xi*Y)SmwCH9}iLz&F}1TKG&Qxq!+zX|YfpqJTyND{wz5VbXaWs>-LNc1N$
zGX0CV{;kDtx!|db-x*2##!K`c1UizhkDpJ1>Y?_=Z;2#+U4*V+E#mO3i}>~7@>`2v
zt&8~8+(TA1Z-0|;-q!f7mc;KeiT*c(CrQ$`KO5J-wfNl#T3P+u#`V{>zZ8l7KXdu|
z_#I8c1*G=IuSOC-+B;LkP2|tJ7=Ql6<+m2UEiT5NseFS;?fq{G>}hNKwn*aVBhh~<
z257SQbxmgOQ?}|HDC}0RDoP6I8BEvy%DMj9_)%Ta>wlcf*T?Uzsj38>c&4k6O}PdC
zvi@_sB!0dU`^UMMKikXYw-&!KF6PfHRpiy??az*Lz5N!zWct@h;&+8a|5caD<9CAV
z-&*|c1idVN5nO+5{ANh>AAor}vQ!_x$5R1BYH$1wNaEL5V*fc8?Qcse6R)%uzXliW
z?~o*ZSzy`L_#KtR?@EdOS0VW1KYjnXkL!N`&u7}iVx<9CKrf5m8Ls~}%&$<Q=bs$>
z>-B$)%h$(mQyx*ZKYphr_J09>LVuB8(O+)=b6oy0UB4pem~uGyfL><*a}SVL6@@=W
zGW%!YTyOteE?;l|+5$%2?)vMNtIF3t{~rWPp})wtp@Sz(ef(><{B5n+{{rY`_8*ei
zUo5e|CnkkSzTW;RgpAbQ_Uj|D|0wtgyG8yL_rKo$R4%`@_<sg^nf+b)#^~Dk&xU+`
z{D%#Y+aFs-*0<mOK@$6a06$^3$S=K89{)rxzcu^KpqJTilh|JY`Fi{FxO{#5Bj%Fz
z?YBQfV*h`^PuMN;8+ys@w{iKc*&hjdnf*l)`xipK-u?|-zTSSnd1QV2?T?n&e+vAB
z-6EgQ+n>Jv2XgtX**^#LGW%;J_TL8idiy_j(f)nOSxD_||0xpt&w!t>TjcS5<?*+0
z`K|STF`$>(zfWTSQpnfazlqD&$N#`$vcCQHXGrXC1V3T7$nV5^7V3ZX@jt}nw`TwC
zpqJUNJV;!d-~X25TyOukT)y7^wYM|!cE`U=V!sh83A;u97T(jz?62YSTeJTS(97%(
zl-Pfl#Qp&;?4LrF1*yIDe~HBYOC<IiT-cw=<+o=4Sr`3Zs>J>(*rSiXoy*t9-**`^
zzuop%OYHZO*#FDr^7vc0{MPJ00eV^dS4-@_Phx*EAAjlXKd|C|v;T34{oN$?2f48S
z5SQPY{X<;Xze8gGgA)5!bNPDv*HU9aYH$7DDzU$(#QuFQ#y>S&{*G40zk6Jae@;m3
ze+c&I>;KSxYW>sOpSqfv-){TglGsn*<`Dg!$ZxdB>wh+v-<tiCKrgHRmUR$@q#gf0
zf^)t7TP<??{q7~|_Q(HYiTxId{r7VJ>+gSoT)z13g{qCyf8zXZ(97&k<o5gV`tv&o
zp1{A}{-0gMfA|Bcg!b0|quhQ>Z?Q!3`%CPf;$r?cn#-?grT!<onEx&3AAlmCQzH4B
z@vpakQIHycuxXY~P-lU(5AS!hsVhGbxdrFlv<SR>LSp~txF+ho$UXh#^?%1RDx=sg
z&6x{20qqQWS^U>Nq#B;h=TFG~r}3}1-vXFS|Fc|wflu^b;$O%Y`9o-6BuQU?&94K9
z<c9SX+9c=%%z}bUzFVHEzqbDT8@PgA<j-TBhfKcL4j?0~6$YrM4tjp7YymyvrK@Mk
zCRM%#?>8xt{r|wfV29f#OBNhu`gi5}3w)wKgnyy8$bGMs>;HHikdge_=|5kI|Goh~
zAy?$pF6!UjJxsjPTK&7nMg6lptNKq{|6T@5;g8n*H%Q{YZzcNowaWeH^M$H^d+Xm|
ziT{pC<QH8dm+$+vD!(=V<$<2XLRbHmz0%Tu+rhG}{)>?K??;LLYlq79Ppwz=Z?FGs
z694^2BLB@na`_oFS%M_Km!h6I>#sQfC+KDVJMpIKzdB9(-3g+$`Y%D^zvG~1vNXBx
zV7dMg)Zmc@wX^-ENc?va{PgmN!G5w--~Udhhi#<R{1*y(##2}Sw(V)@zqi4!t^P}u
z`0q66_4==M(f<XytMc3Hzif&Bev`=m{%X1ZQs`j~skQsZ5zx#0SGixM*WN#<OKq$F
z$|U}40KMLSzAoDDPxP`AslE4)1rq<AmB_!<h5vkf+vdNiF8o*XMN9wfgZ#GoZ<)k@
z=Op^C9U_na7Cvxnum4s{{AYkk`uKfvm0bSE16BLC2?FR&Nq4I313iQ3+V76TD*bAe
zjE!GDLAkB|+aU3uNus~63;(V1Q{}hUe~(N2*I6Pz!G-^}UaQJ)&3|KE_%HE@O0V@F
z4Jq2{zvm?WGfVVe>*D^AAE?T2um845{O2i=?}za(Nz&gxs)JSedvz5~cd85oy{!Hn
zlKAi7pYY#X68~K)(SL1#T>sPvRsZ(-Z?D9ET_y524v@=Vc75CYw+{3&{}p|s(rfGA
z(Ldq80}}svOZ4}3;lC7{D!;w{J0$U64~hH+7vtvzqgDAwMT3Lwl=SuQw2Sexa#W?)
z-hY1py<pec^T$sT|6MN8-}gFs{8JND`RyG)pO*Nqmqh;UescL46IJ=GwcmxHm(@Q@
zy-KgGe>5a-tN)aIm0sY}aJY{||Gt58{R2}}`u6(I%;jt64+co&Kjb2QAvdY=>slGV
zuLZr#f6sCM@nHnJ|I+(U;SW*&x&mfMXevZjiGN2rJ581E0PunyN{=@LgBzPALBFvX
zRK+Eb;DhGlC~HyI-z+e+(3ZHvIlXT9q115t=R^QF8)3iT8jb?_&n5so-}jR$-%JJ~
zQT;iCe?c$&HvurcY=9JB9{*Up-=Rd@KEuDBKCPf)XyJ7hM+$V5EEct_9>YRH*p=Y0
zK#r2?u{b7SjM3oqlL22Ub)Jz_HFXt2acW~A8-AC_FsXS}?J(ItMeZm!&j07;Q=Upg
zqe-bcWm0N!t@@Cud+jMtTSMdgU7K+3(-xc=X&DySXGu>h<*O+`*^y~vK}JboPKL$L
z8W<WH6c`jS*fJxnG&93eSYRm$i3kr53D5Air01s<%(TqOEGfm-j23J7(7>TV7QgJW
zvZB&q*Ik#U@)$a^uy7{6@mV;#Bt4V9MtWUYVPSrHc3Musb@};oW(_GSDa_4GFSBGs
zW<^A1g=AR6!oq?xLIbTqnW5={ks*<xS-~@c12fYzgENAH!-6m`MQw|cVP2AASa7AG
zw^u&~6Lm*aO~S)4j3ogZgfp88QrFN$cd^8J^|jpV_HgHi%n4roESTBZ|L?E;fRo(@
zJVK#}Q&n*1Wl!Wn9*WXrlI)J~Bda>Pj)_y7#0RT2+&*Raoiq?<(d1|mPS}SGpEPZm
zObTh;JiX2ETfzy;q+Hq@8E3CC{Fd;S7`#gh{O1{5MALbB4}*7i0(fZ$gZF3wCrodn
z({IA}!x-G@9|5OVFawNEKTw^ZG#mddwNc~SRni%~1pEO;r+)+=`aMTCqtjkLVvaPQ
z!JQHWT)m3#!{a*DA(5#6q(tK@EnJ1R9bZW74L;iUAr{Vv#vfX5w-=wfOf7%W9tp0U
zOBZqpewi=^xsZE4KHAqdT0Vl7*kS1dOB4tEIZ_}m5!_i@6eU^%ch(j~$=AU7?Mj8%
zr)A_P&e3fkJ1)7*8icOdj;`5GU319X?6k5NDOzTEQD#XFeV92d-x``VyC4H!Tc(pz
z`yA{LBjdupw;VxNh<9{Q3&wi!(ScHwKOtJ>Kzl`TQ`rZWv4Iu7wTvzNQf}0XyfB}e
z)=R~Ar*U&=y9Z-vCmgmj5!*sY-4clJ<bx~fRy^viJdTZv@ZD?cP_~_ps5HDTv?rUY
zt8apbrL$T(uC1g1=}wjZa2Q7y<c|B81HcQS-w<%>k%^}(deJWmd_6t&lmxR01fCah
zMB$>#0jG8)dREc?LjaS>PvCr7laHaeRDO*_KDA%He46sm_CH*#63F{>A)oXoJYm1c
z?*feJue%3K;fx0HTx5byoG(Lx!F2TdIHJ~nq<dTSA1=|K`bQyO<j(;n(|-Zrlm@Ap
z<0$9^;3*UsOsBsXl4$j(yP;nHFCm=d2MLBeui?3V#6Y-|M1F>swS6{SC%Y*5shQ&_
z<O{$l6i9!Y0PsAJclNRToZ?S+Z9y;UZvod|FaH3iYfV1=WI!grTq3`#L_SR!%bq12
z4&r)<O!!Tl)BT-bB2EG>=v#Z19LDJ#biA-pFNnkSV4AWZn7;bdaKzO*#=`#s91lF1
z|8{WyrE)}yAB_$Ly@+2L==HLRB$flkS{hP^#v?80%L-@Zq&puc`GcZ`l3G@e;#o2*
zC`f&%w6y(Ma-XJyvOx!`t-atidLBGI(Xg4G8U3DK`jPvBh5OAjUq9(_Hg&&w<ku(t
z`zuw)UORQt-{7&^qEsgNFEp=@e?4w@oWXs!AIk2Hh5P*s=6L^0E0fF%-Fsskx!T{L
zRGItQ)`VPPUU{##Qgs;5pb%KS?A$@xo+-rURhdMv0bMJTOv-cKM@{_#zQzA{_&+^y
z<Yw`#D$4Yn`~Qlbt@-fJ_|FgiGj~&}l*WV0R3E&)`4>FjpPp!B@d`k^%!ro<;^j{9
zLaaOxGc#iIBVu;SWC);`nHPGj_kTThH{!IL%B{uhu*s+PKE#b;hIX-f3FaEqnDwYN
zB4*#1x;x@UIEqr~O*B+KJ#iFtr1^$7H<8XA?hp6^uZThpV}65lqB=AXHfrk-^ziw=
zC0k#Ag>2<)`(uW^X=*7>ti81{ZlS0vhfO_L44TKx=R7e}@%1r-4Q);>`n~@L=XN4s
zt?0`)k>z5}##qf}Z9I%i_`J=>|Nc7K(^&>8(WVd$(x0WJd$G7TO=ld``J~5rc`N17
zT>=xl`Uc($UG6hK?D3G7vD&L&U;-wQKK|t2U$bZ0k2$^=ZxP>P64+S|6ZfA$oYT80
zN^Oy)V!A%c=A0ftWo-U5?4*~?Ijv#%{Ko4<WhIl+>?xVS?qc{Y;dId?nblav@MW_d
zgioW(=IIWG-x5w(vN@_n3|~LuRC$`3%|@uOQiiXcrBLB?G&yE0oUm+$PZ4gJOwDFT
z)a&UCUps5!q%$>}l~LihGJNf9jS4Sk@RoC9vlyI4M$OY&oNDLHSla;X@2GDw?U%ZM
zCow+G`XKnwGnKc|8F$fsXwK5x=!`F`*TAK1Wn^;eG3fTz%(00!G>gHVaTM_5=<vLa
z&UlHo)QiEL5`^4D$fiVdZ<-;PqtBqZH!VC{MOSDpP4r0wB7ah%vGx^eksU8Ie;b#j
z*FT!W_4-e7fiL2t$1mdeWN%+yrmT#YNv^gwmUB4q(ZZ`aocL({Q=@@v{b}Ryw%R51
z(fhxn_z3^#^-1M={#E?ehwG!C`xJ54&wYxx5Zu{{`Mnan2<~jfigG~1-`R>4<tGii
zS#Jz_O2o(6S}_3Bz@4oXh(p`9L4Hs$HsQ{hkzQ0}Ph*c~_F07mIc0?<F^M;h)6cmk
zmjzkv32~!FCnnlQj*7ES7&$&BIdSCZ7~+y%UM^S^6qe;=RoK(;0f+ycOJPAK=fY=D
z#Rq_=VFJ^IJ_*52vx@T5%CZVeX4&Va<&@d+!Qr%wjFL=zTLY@$n`Tygj98<34nEQn
zmjifEP%}8ax3jAk>ANsFG5D}R8D^dfXJb+quj6RiSs9w2Q;?TgGNiDGzOq)Tlvb3c
z!wJ~uJT0vxJv%JKo}U5fA@;QNVmso~@&W;e!hM-T$4;0$q_iw8J+IA?4Ae)G3}&v&
z`QLf8-&0(6X0|=61hezXP|OLJrOiNIF^lChN=wiCA)ADtP={sdg#~5sG<`Q3wE3Aa
zZTJw*d8>H4?P{}2&(}0Al62mr+Akf`{p_0x>|+S(7Y^7r3E0~K^+N;f3j^#U0qhk4
ze=mSN_5)cz_P-w1VH~2LM<kwsymQ>Z#%oR~yqk0Y_M=2FS9AFeL|)LbQ`WRXFUD_z
zkDmT6Tp*ZDAn?3~-waauIo;#QPBH!x_x1$9WcnZDbgjuB3p|;8#Y1I~%K4Cdx}WLg
zliy_W`L<4qxX*JoOqM89PP8)lsa(FOB_yBjn|k^Cz(6LSFN;y1^FSw(-v9J&Tqb`t
zmoNNB@+l;G`QIWaGWj*Amy{N$nd7LJe+cw4`4Rl4AIm98K7sV|XS$HzhbjwFYw~Bf
zkY6d0PfbcM{|DG9vwtm@FYuW%IOy&7aY0|h>9-0(p6lr^1HH_DbzJ{VoR0k075_pX
z(SB+{PcSZyV=GFf5M*<JSV4EHd=4nt4>rw`peLEyB;*U&Y!J)dMXVO`1tQN$mNwDy
zErN-5BCZMg*4{<D#_0u}$gk55UIh@jUjAwxKfV3pU64&jptpY|2xajr;x7?*aM=_;
zdg>PRB7Tp8UN4(Sig<?}$OB7i$mnOJm6YUUmN;HUwDv9{I4~lDy{PyT?;;X~($K+%
ze>z?UPd3hfee<t38Sp+ro!|b2*032XX$qivlhM{dYuXIv%A}s1l&aZArJ?S}`TO5J
zH-Ep+xAWFS8I+$ZjT^rpT%tSZq5S+9rsfV|PV_L|D;(kT)3hFLc4wMH9|c+Tu0frr
zZk+$>=Cg%{&A-nyZa!l-;hG!t=)~sP&5Etza)Yg*2|Q<jrv>xPVR*zKeNJPJJ=9I<
z7G`FT@zuvVD^+Jq{c6pPBky%L*RAur&Ah$=us=+f*M>KZ-2Z!L<wNwFKISWWtvqD%
z2{0ObF>l*5fb{OCgyh*wN(%PIt?FmEy#B0d*}Ck`wuX(SUiBj(cmBCc!p&Fo(a`m9
z&{>R1N<Squum8EG6rzFM0mPT^NruWF*BhHsemC{0jfF10kP~&8^0WDmrj$KRO_v{H
z?_XkIdo+A78on3>pOBB<W^?&F49eCP>j&Lz4U6H=R7@dKY)FoN%^}UjD}V8MVd(9c
zAJVS-qkcrREq3qF&c}AXU!9Si?wFDN6jQRSPSZGq(jaPR(Opufc=b(XbGV>+z+<h~
zgI(5jUGKfY=i#0Y`5J%n>X$l&&FFsm*@4f$`0^`tec)=wK~aWN9;;nP2!VVZAxCkU
z$>wB#V11CjhgVt1=490+@$wE(HYa<K@z*}ptGvHpa6XXGX#5F-^A1h}zYS&W9HO{)
zPX%1IUM|E1occNaeFq@r5dOW5PP<sF07G9Q#kb>{jL#h4Yv&?aynu@>Hl%uzxibAl
zJ)=1+t(T&KPl@3CHqOpd*-?dSy{E-@t`by~N)5htPGp-4_#qeYK^nMr?vngZiRQ?>
z)gn9g;boem!Ji`~YT(-1=xWYL5$odA2@f&5Fe`HwzT!?7(-P-k?UpqyKWAoveGa}a
zOVEO}S$d#;J_1N{XK5xKumaBNn2TuRgi&w^=0z~MQC2cLz0A&UqnPTMSy+-&mOTrQ
z(#)8ocF$r2TQOOJTl1VuSG*JP*ct>ST!_wAipsJ}GO@m|G&4V|)yapp&5{LUGAJVx
zHWya7lG}<}w06$<$lS3{!#AU{Y3r4!c&U6W^j~dd#6{gH8(R^qz0bn)IZs#gqCXRQ
zxrqYL=O8DTjh~Cm#=ERo4xlzpc8Xz@=tpQUB-4L8rxX1hKV`B+netEYFO$EF%TFaF
zB$7`cz5F5wm&rdwKqS#ms%NS!QKmc(cry9NxcoqlO!8&V!f}Aho+bJiIiW7&YB`|9
zmtaDUxFG0TdzSbYrx$c0f31!3CqX#L*Q4*?0MTy?zQX_FJORWq|M~I?sjWYB{}A+|
z{-lFmFPnIm^F~!i${|rEn+uqcQ;^|!kZ`PJQlA!N>zaZ>gZ}ihL=CSCq=$_TICf(i
zu@gG{KQQui=-Q${^Lesf>^=sk=r&LE{HeCa=5TthY}u13N+pB09IMS|a8V<iyyh@C
zMZ0+_W^nDOMZKQS;M!4(3ZKc~+EI%NU&`Rr@^lICZkpd<@T#Z0i$XV}(+>i^hQXbc
zL%`{t(9P)Vkp-Ok!fu-P$pZc#sL@UHTMhxI-)3~vyk{2h#SHHBgMd?8>!x|nEa2hH
zE~g&^T%Esn{R*YU%MktBgA(yN$o1PGYY^T6rDtXr=4aqXRzdbiyftVCSw#ED!rMm{
z);_Y(_K}6Ok1V)-WI^pCv$lsU*lrDEzg!TbFMQ3{#Sa<qy=1zA!5MzdKnMK|5q0~|
zCSoBQn+f1X)(<$jI@$#X(K-D)Te5n=re-aU&K^R&bOyvkuM?x#I3-=vCjI$N7xW`J
zkse=vzQP6ls5a6kyPzN4Mtb^9HR+_cKe~<d-vUoYAJazqXI#*aX(Rny7xZJ>NN;mN
zFUCY<n>OjsuY==c_S2Y?k{(}w-j#49zu%5$)GZHsdb(p1Oy3j*eQRS=3#UicEd9{z
z%z2`hAAw8yx<l9}IEk3wAUf&TG8=FH3k&9m@nLK8%t7H1kzs7;*!DH=5j0W6la1vz
zWg@(G%%lVyG8r&0Yz_d}#~iyX>6oFWBuX*oJ!()={1&(+_uJ`ST-QlSiCSeSj=dE5
zAf>p@S4r{Tp>*@Z{4Yj8kr*+rq`6IZ%Z8-Q|0H_%ycw4O$6VLz#}C#dd2}b3N1oqO
zbMI{M2za?F$@9pPq}@tQiT_Te8~n0*71qjoEUaBm{Nfu^_s2fs**ou^+mlvQ<d(aS
zFedvi^z6M7>zqBhD&_tQyCwVK`tqqc<>nE#HSU2*`SObF@?)e=qEasO@vFZ*$$vqo
z<YQs4mPCCRSnRi8(|U8`to_TploWT!&jo*s$Y`sfD)*)Cz0J@iV4+8EjP@dzL00_2
z?#Z!Fn0x0;%~j<<b`IohA~}#L<OG=C?NuN3VA8nKCt;^&UL1HG^Hfr<b+79cPxe99
zEXcxWC=&mx@jHvEZ1DAmem_9BaZ~fk-4||N?+@KPA;a$xuikMLIptokd*#AQd#{2n
zBrgwkXVW#{GrJR&@;K<@XTbF$r#^nejmbHX7q#KCV)`w@a?qPWOFDT#A2alWpVi+d
zz<;EdKlo&mU6Ajv3;GHF{0KcAb|6kU@O?b=jfFnoRgr@@k-jU0zHUlIJY>>!hyTok
zmtAfqeZ7<lA%|i?u@?1!VzF#$c6k8!#q+o$CMv%tDDFHSkg**6>PT<!7W~NXf*1LH
z1@N{0hP@RYkhxOpckrV6<@bn3@8$5l2a|niZ{n-kp^*#SNp39J(bXvzI<7WTU7DI!
z9!okwj?hWOeH`o}|5N<n+ln~wSw^^!FL3GokM{Qs^nS&R-!&Xllo!?Z+8w_SasIx5
z+HQ}^4Ij<Et@h+(Wyi@)c(=0HXs-VO?@G!%K3S*I_yhp2`rh|@tf$`$Y&!VhN7P>Z
zRy}u;+N|G^_fO{STc5P7;+K<o>6=P~|FRd=ttTH^{P0_r#%cTA-*aET3_1raw5^F>
z_|$q&^cnT&GyEt%jV1fz5T9#NZ|YHBsO?@0oNTJs@OJ=gbjNj~zZU+@MO|S&7e3a+
z)*n75JU{qXYb*6L+TXyKm8-8L|70s?!hb+NhWmlfVxytH67P@PD-`eAPL)X(!!=jt
z_EaJ~PCT1rH~8m{MBf%LRVg`ye3S7^nB9<AoQC&CK8UA?p)dH*`<o+p7esy|8GZ{=
z*Z426t?7qrWr&%;#rtocV|dq<<6fCWbOJ779%b+-$pQYg;2&#Pwyw;ue4W42eNU9Z
zr@j_3614c8N-b!aT=dD1t^Ste2k<7GQlrmGgTcL)^m6r^AhVM7F!#sH@JFriM-BO-
z!L~;A$IOSBKh7Qh2>$pnjr{SR?IdnwDRss(FPRO805{iPSf7kPd0~Chyba;~WG(rH
zVo5$iebM;Gr+!Bp{9}QCj%oaJ8_s(mrntAS?vLLFUEzqGkF?(4J&4b2)B}O9tv7f#
zBdIq|AB{x4nT>k0%-DTTKSK{)z42jjR_m+!TNY=X>7l7J&OU?M(Kl+{W_zKC-@dtO
zPlwvjo^0@k*`&6oohWPD6Sk3I_1fN5DNaM3r#N8T<RjYFF~r9o?Mv3S$d>GOwk<*H
zs%=rbA{=U4X7p+O4dxc@OYSFmJHtd{tL-cmzVS0T+u8p;UpecOtRLzKU$wk<83U;8
zu{8{cxw;O4+DG>Q@~gIQM_r)$(5yaEy>RD!d=C2fA5HGOk2lv_;OhYN@lT<Tx1o>E
zLm%&nK7O$wfc5d?(8pK8*Kw$mi_ym$P=~2biuQ+f_C9tmr5Ka;DR#3`oJzTyQf%m~
zq&#-XnQ(X8gGq51(=En$7T>8)i3C3N`+}a@FZnDDb#oZXVoW8*Om_79xxgO`nQ3Ud
z)rJ-8+zo2KzXEMQ&<223ZM$lJk98W3Iys16Q||{Rpeoh4H~YM4Xs#dTs8dLfo)UcO
z_o!{*9i`8k&_~%Z;7XFG<w^GmSJ&{I!01ome&UDwpRA3@<EFL|#O-Cojo*vR^)`wd
z?nP?cW<Jc~hI<j>#_mPqa4)Js+;Y%H+;J~jY;dptGqJlv61xc4=PGt|t!3=SpKMF)
z{6Om}b_4h|t)I^qJ5+wgON%dJhxgPhKKi&}-bV^=OU(4^j82(MXsgD6U(n`$<@d@%
zrk<!LJ!mX~_NtCM#d;w%=5MgILDWt?(N62lN=VMa%aa!yQj7f?4U=jwtMrbyF7MS(
zG1u3am6ZIciZ@;J>|B{ND|BTq{O+iBRu3g&uTcqEj4_7|&y63TJ$ss!s#O*JlJCO0
zC#u(7@Y~wU+>}W8VKw&gs3Kgv>`FOd@(TE{|9ic<Uj5#>RR*ia)7_LwCvu7+ioo-y
zb4{UM2G2bk-IbqLqR!b3O7Sf4eg^-k?n;$cm&&B~p1-SC|0h;Vb2lh^qOMYY&NnEL
zvpOk}gHiv`*n&LW@Eq7}$Fy97$GB_P(KDfEZ_&Qv7kVY<P0ii5*kH)3e_&&;c!TG-
z_)bbUjQ8q2(H^O-QXHr~Q(wVkbW?t=McXHvXsky$X6Jp(o$tnP!EvAK^!E~Tw6cxp
z4xzm@&fm$_95v3@`Z?=i_<8HB#<Kmjiz~f1H(oaB4cHcM(D?a1+Zuu~KX+>8=dHre
z?{hz2hFFjumnxNOy1>VH>#+KL?qdsly!xsS)*Uxp7SOeeZO!xjQHGEA!N>6T3i9*b
zb4@S)f5p#DqfH++&NpMtmpj&ed0-8gC)U4tp^h7?rtG`^6B<XjUv6ulaT5JLdGj6p
z&X`emcNx!wA3^Sp=b<0)JY>f`V;ACV@1qpQp)T2Llwy-N_4&qtBdAjz@G;E;;I~^o
z8;#xT@uQs-GvYvXU>WXXr!e*}$F*JPuW6h#0C}97GAZ6q>E@3)3PJDR*N_|^=f9Hp
zj*A<x@+Xr=ZQdlM%5LziuS6aE3Gh|FEZTn;V07(ngYA`r2F&k3w^jH}J=)99X-!SQ
z^Q>KF@YrK+9JSx0hcXFuI4}C$m|+c{ZR{0wiBe2sUHoo-+-B&G-{N<pdq}_glwynv
zt9m`Zycg<gmEEKizY9GLpBSnJJio3N)qm<oeuGWF;NK2DxoC&fXGZNb6r0ih{GMOd
z3piE1I$>Uk-<x)RYN#@To_G@vwvN%L)Yrfs!mTsfBKzHED5mpIv8M2#u}3}G@GJVM
z-|$az0&orW*ylIW3+L44;4_@}WY_C)UU$wO(Ql_xyaTlTUQvo|fDu2k<x``1Pqxtq
zW9^>xxqwsqp#B-p&Q(~ii2krASSr=k#-1x5RFp7^8^sKLgU^e`%Q<b2`f*r?Nce}b
z?(qn8BO1cJ*VtpF8TDxM9riQ*aDSs`FzVY+PfS3a8;80Vk2)BKHHWdAQ773RhZN%y
ztWP8!jq|r}{tbH|{CblS_0z=qU>Yac71fVyy!-s^z3`mteJ%RqIP|4YDM~2yfz&7e
zXj;(=?;U*n4d$R+^wR{-Lw~RZ|0$DKOv^PYdmeaxCHgdT{T|fKjcW|W;}D;`(3R^p
z1_1Y}jqCb>CLgd>omQ>OGkC3}I+usJwSHG9#RE`ZJWP1zh1_^|^SHslL%%wSV!5LK
z?p|9A?g8j8J>m^s9@s;}Ghm@_a(t&gLA9v+o1iC+rvwafi`)&puDvB?e?Qa{5A;!h
zvGy}ACocl`ib#5<=;5VQ4F+93#)$pgq2u_({p`9Izur};qVW{FekrbxNKmhL<=1_b
zDy-2`uXn@sA+hRpAAa3esiHc-=zHLL-)Qx^FTdUg_Y_?3VNt5^UDRU#OKof7a&jWv
z`zVn+pdXEW4QS({?!1V)Q{#d8BD8~S`1|F~N@PFWgEkwLNH2_4mm8HJ541Ob+<)Ms
zaRIphG;8~~|HMzt*=9HR<o$^I5B4S*=a2gj)h7?sC#th*of?fgH462G_M>=<-A}Mj
zMF7<!8edR-{1x?zt^GxvlCAx18twIA^ZqaEVbT9>GAdhVn9hXXZff5D;q`KgeYjGL
z-vXrAKXzmD$RciW;|Hv?7a5EFA5p4Iu$Ata28^+PKpzzXA5x!qs7uQ}@lIT8wND&j
zNRA)xzmjASe>?nPfj{cOJ0I(pH=<4-K|J#M(>MZc5AC0xziEt$Uv^_m?^#RzvJrjx
z5%lF^Y$$ZU7X2jYnb$b_-u%Xq`~PDaTs!nqua$X*OILod)OMx`{PV1<*1c<8zRt6$
z=|w-*ua4gDj((Ny3xhQMY8reKtC+{dVa+i0tJLT9b2k*X=u>-mx$INp(WhPmeeGvG
zi;vkc$MjtDK6PhLum9imr!>b$bszP%>hwh2T5i@3)V18M`ce<f5pBYA8}+A~F~%~Z
zFQq<p9L8Mncs|L;nCl1A@?MM42aYo&{9~|TRj)V$`bM1RqOYQ7o9fA{rp<kRMK9_v
zXP~|Xpbw-mAN8el9*=XpkM-I3=w-#ZD94AcSeJ)>AP@CtoCo?*P5+91a^+&Qk(KU%
zhbqORP;XYCFS)j1@qX%Gz0NeP83G>pz*~hmLh5I0`|n<dK6V9YSD^n`89=&g`q%-G
zEnukIY9ISv(SGVjJv4o60`;-zcfHWh(sP*~#+Gvy+U|9Sd{2xSbFdyhzyG`I{JSY1
znhk?j;2!#+*H!PXTZR5FAtyg#3;Oh5F&3w1mA`r)7#J964Ganl4h#tl4Gaqm4~z(m
zv<6zSS)?`C8e$E#hFQa{5!OiT)@uz43JMMi!D_9rpzxrGpvd6BU~6ztaBy%)aA<H?
zaCmS;aAZheh&3cABse4_Bs3%}Bs?SnJM9LBT0?_EgF{0?Lqo$t!$TuNBf|p2tYJZ6
z!C@g`q1c%>JS-wCGCVNc8XgoLjBS8J!^6VE!z02YBLX9=5kV2b5g`$w5n&PG5fKrQ
zkx(%b;%O7#NRUMWlv9wU6r>gSVd<Ga71&8B3jPYV{0$BX4a1AXv>E9cnOQTlb8_?Y
zXB89{6_=Ej&7L#2ykZ`jg}U}S13AV+N>_9+HGeZGwo#WUmG`ezl*7MtQg*Mqe*3U@
zBJ$iThJEuy@8Q$$*)<|KxHJm4l95l=?u*!zd;75DP6LNO`SzX>leR623J&f!vZ?9q
zQBfN{jCj&;$FOd@1`faPAA3h!e{gZs()xZQv%Y(0RMWwV=<KZ@M(pf*$FQG29yol+
z?!6;kIlDOORAax9MUC%_+IzMlx@kn8F(1A3VZ><fJBEGy>A>O3_wF6BrD<{0o~C{y
z|Jn4;sArlgqW4Di8S}=(H^+8;`NN1@;JJM^aQNH6`we)%1Fr#izX9)e;57j6w}EAG
zJ%L*QTzBB^1#S~?n}FK{+$P{Q0k;XbO~74zzwfxqIlf05@%wH6XTmjk1ryE~dnCR*
z`qfEKe4L&9{gQ5zE#JL(<7RvMly`e~nYR7W=WovQy!DoW?|9hj%b!lY`m-rB%Kvsr
zM$hccnZ0)<&zv;XE$4~CCvxxEGa)}R%2060J&zQ=dor$gLE+hwr~ma(*%je2a}F-~
zb*^XkbrtVFV4J_|^%DyooOAyo*s}N`ue;aW^u2G?zwWWl9nybd)Rzs5a<`Y=5jAPs
zl}qa<ZHvlc>A$d<(g53}&%XF0rAM!*HE(D4ojg7<D*Vi@jM~&CQ86!_YW%qTm8j1i
zD;nYP*>RQbyMZ=Fc5sUA{`$I~?hNh~b;G@lr$SN_qb@yjHgHt=lBjNB!(UIj|COlw
zMz75O{*U8PAbzZ<ai9&p-n;kg6qWw^du+L{9&)=YtXI_SWnKe)XCy{FR`tQP56@c?
z<vHigmtr1#CF<_vvOy0t9gm9KS~usPO#^LX56|;?rfG`pK}u2gFg|bG`KIlPi9J)k
z0H4C2?<$K0pFOjlulfRfZg{tESQYWP{)sz&0iTGNu_X=Qb7#-b-~SDK{7{j90Uu)5
z06t{bZ#iddw?v0tb_D!hjlV5!Jox22ba?$C@O#tki(PBM@AT5ur_O=jw&Y<`n!xYL
zW3fY<z;EAxFB{H*->zT$rZ<5fdWhgA@FTv9mJA&^?#(MdA--LP1^<iqt}$1J9R}Z*
zJuFKe1mDa{{l0AiU%NT-IPskue@Q*@_38WWw@u(X<R1?mC%zO$;)^hTw-|iE{`d#p
z=_Aih{NWh!Z~U<8L*l=1%&#%Tzt4fv2Z;Z`_Y)h5|EHBn=ZL>&|L<`=#WvxG)JEd}
zVb%0=#Gm3${3&Y0A9BtSf5>UP<Ff}wKKa`>Ka!lfdGCKja^_!gJ3_N0>hp~=;K^5_
z_KkgwREj#{^$GHUwqA+5kx#MpKf1k%<WzV0w29;lTZ3O=K@LTi<e;83ksQ>LCX&<C
z^hQ(0d+&|x^k~m|k~jLQ|1x>i&unJ$B70Rcd3BZsCU4=^KbX7?kNnQ$nc@M5yixB1
z4tXE#1RV0H7LYttP9|^c;oq4&)B+~2sp*e?_8Q};%U<Zs<o+=6XD0WX$DU?#zw)9Q
z^GcLYBE-N>uQikpwB0j@@+r396l9QFQ;i&Q>ne~#F4Y#2i%QMp{%1iGlZ)EI<UaUd
z6O-Gtxas>jvEifM4C%w<|6ZfYk8pp6$^Y9*Rett=!58ukzfeBVHu5CpQ*0j+9P&pK
z9P+CP4*688NIn_^lYbO&@-u1`lfUa1Reta(Resa)rbnuK%^LOENL7y>n^irgbyxMU
zu2uCIf!aiRe8=*Ewi=dCvBgpjJ^n*E^w>l>^q|^DdY}<8J)T2OdZ6|(JsQrbdTcwV
z>XCI$)uZWL)VCV~A02hcXjPx1T%TKgRDEWXI*7|h5JUQW!}5W)uUJ0C_A%wq=P2dS
z=WEKL57koA2aS*E^Kay&4{9mX2XGdbgH5VFpEaraeAlGvbFk^2E8p7w=_o(0R|D5;
zF4yZmt`}+{((x!XI;4TNvn-!tV{quj;LwY~p%=kPFM_l7jhyr%IJFDFnO?wW^#yPi
zFEnQ6r?XtIKbnHC{w2?A^kA;vA6!55rmQ|O^&WgB3T%;%N3jh0sX6bjp&vVkek_N6
zl#_mx^ZtS9N9Uv;GPOQ){cz6oLlBsLO<cbwu3yvQL*W%~jvU>z@xaoXLgtKadS}AS
zSv#K^-88%^_2`ttqoY>6Sl;*99?=tzANllXuW`{;pN#MP!HLS~U*iwIV;u5g^wx(y
zuNYnaWAtjH-{63imY5Jz(95TvPKhxrId`=9^W`zOdH1{S`)hW@^#AO;-w#<&$NaFW
zCUWWx{$mC`XI^&vF8i3C1)W}eaofFPHoQA#z&C%d8)I5<;K%j*&W*W!{5vISqk_jC
zu~dA};GI3Tcg{_tw_X15*ykVV8L<ETkH+?m-*EcQ+b@ZIeEOR|`=^hH{qBlh;lJNf
z5}R6c=&kZ!{vKOi=lkoY|M)6)+`<p0zJ0t~+{4pHpLjWMOx)YSDL*~Yc|qLGHCtb}
zX36t$C3TO~Sik)??w(=0&5LgB9sgj)qJMSiJt=-i<JWUON?RHqxbQxov9G=we?!67
z`T1K<#J~5h&$2rY4;p7XdqwUKS4<nXX++`?YvSs0-s6u>yCLJPaW|zt^z-<I4dZ5Q
zb1Qh{tLqY?PwhH-^oR6>9?zZXd+X7)3B5KHJu$oQ2MMdwvhK_&F^xan5cPv;V#N58
zGxvP+){KJjWB-Wk@>=7g<FA-k_o4smpN-$RcG#G*EtgJ6-+1(?x|O3Q41eeAPhTB6
zcY<f+eXDYQ-!kFJ(O>^|Tc0Bns;WPp{pe#oC%*VfT=$g;2@|{dbouGiXK$O><H2rE
z?(O~3#G9Kw+4shy^%K{=vGmBxG5r%4Uw6%yS3NK}@zy_1OgescMPl!V!tU+y?;VLV
zqTSA{>+wtCyvdzjGTa<6DSz^t-42(hPI@OG<i;x=sGd|2y7Q@n+uxm(zjMkS&z?%s
zJ3kNo=iR+Sk|LjZbymrMoTPWA`nzA2w=t>Dfmbqrcyxc#zzKeDJhsxDyd~}AGpnAt
zA=z``P5-%kNNMtf=}#ZK<;;`GGhR3_WA?9KC-*IS=N9)@y;H7Ah<tHn_Slr68}EGd
znNbT<7Q9(~)zfkRNSS`Rp}_a6?@~&Ox2?GH-aeDRAM--bQ(sP+{D^PrSI3k7HhK4z
z<@=xd{<X<BbiX!ZPtnhlyBr7|ac=KbH+GwF$KDaPn{V9H^`nhfo2zbYtbTiJVEn&s
z95HO$)a@I7zcFi2_ievC5_r?%|6G1`>F$i14jy~x_+^a`-n8=hUBCF>u<xe--V$88
zb-de@+)%7TNQ<2EuTjeBoL35`yyjmSab*8vQvyP2-u|NQz?6`YvE|+V=rVPO-;nwr
zr;nccbIF+}t_mri`t&_>F1v2zGgJ3oQJeGnu_IHXYJA@M>CwxlO{}}(mnT<_pJweF
z*bqDS_Gya-EeP-3<K<}&4Y|3~j4ytgcKg{WqZgV7-2B+}*Hv#=apTP^J+6Oc^pI6I
zKk(gK$?+R@-aNwc(y{5LUvEy>^v!^fCD%^BF7EyNYJ$?H&;N4dYq5*(n?5bc`^R1f
zcTX=b9rsbu9_5xB6aU?L{JD@@@{isZduT-NEpI+^%aAQuHMf-YdNJar%8zgHPCL?h
zR*n0uPc0ZfDB8_->!)9)4w>Ak?AATruawtz-hAt#o4)TkIriYK&)%OnH1w|S_G#OX
zR@`0`YcH<9#rLsQi|p6DFzooZm%m^?VRz3v`1SYppI+V*bJHh%Q%@&tTzTUYNvY3Y
zbLY@46YfOo@Edm1fY(!v4@_M$C-h|MuCs+#eZ1@Hv{QfV8M?f5dRqCysMka5s?t84
ze$U|1!`@Ew40++V{dIq&-Kp%Gx8xS<jLpiD2fy8#Ib*-_ZPS$l*3VdCIc`t>W#5b^
zj{O+EDX3HW`;UGbleBnP`p%`#=G}WwQMz^J`Z47%Jf7ZY8#U#|L!YNVobCTx=-{py
zZ|^!)Haa{yW9|!qNj@<Z8Iuof&zgGwvl*dYVTXQu{hN%@_l!O;`)S|I?xiUc_8*v#
z`O`b6yDk}fN9Okp)*hKxY|Bh5Uo`EX{r;Od-1D9@pY9)!<@NqQUfR3trmTBzvmb5B
zy(_EXx!3-CaK^5z@P~4LeBh5?vzA78`gY-~gJ<rKANcIur_*LG>-*ERe-z(8^T$C?
z{(NPZy)(V%ns3^_%#i(A_3pvu`q1o4hc$-p&dke>jXpQy;eL-~Py6KcKbFq?B>TDe
zr{~Sw>5=oyge_YRZL{S}oAKFazTcPSoEY}rr3WpwIiE(?WUov)l;d?{-Kb}Bd~)x}
zo45apC2_eWou|fHzFnMq$>ZTeLXN+X>weeL2t)m`+=LT<|J%;1`sH1Bqu=SZbCdI4
z%L}qDp1drtw)5h~f9L))FCe4v);-2kd7&db!xp`HP5$j(cfWbd)?4yFd?#YvtE<=K
z|Eu9`+Yce{<cDuNvwEPhF@Hem`e8Tr51Lg!an!p{ZO)qY-8XAq>zT4)R^j{Chu*#Q
z!&#oYR_uDdf9Ha`ONInrS$loKgEP+_Oo}fqSbW<b4}8DjiGqV^zc1|X_GQ7f3%CEb
z`bgKpIUDi<hV_mqtiGf3i{=^g3Ws|SDvnwBT;ZOcv);RZ!_mS;)9Wg?zj;N`2ayZ+
zP41OgG-}y~=z7bNqU72)dtB}RO3|_EkoAS7$BVjst?ayN)4<}%J|nHyt(j7sH?^wq
z)tBxrKJwYTe}@FUS^VW)SM=O<?ziHkpEs^AIX9$a|F5GTx#W!*CCg4%FMqe-fs$J5
z@AdQJ-z)L3FDSihg0b|yIXCYMJQ7w~nNs5R`nvqmeP!<qc<In1rEW<TPkl4x)6%7X
zzv=!y$34rs*Zul+@$8XhzVpf^zyHzfvWM4x_~UJ3pDIgl+7<M?*Wt43-zZ)D^~4^t
zJ)TWG`0-=$v$JNc@yz^t<?J2ixf9NPuyyu{-9ASeO+U{5^jyNzi$+=Ith}LS%9Y6}
zbB0c+`|r0im(O`MZC>udoo~$XS-9%aYd=3VXX=LQR?hjrZ*I{Ye+)@6+2>vz^!f&$
z8TZb8cF|97J~*sy?#&N>A7YC;H@9I|*Zy_?2`Yd2REqzw%`?lN2&{c!*}V^y&%8Ch
zD0IO`<%VCU?;X|ql8W1c%NBP(GQ1+NX47>EmzGqFs9SUW#?^nXNSHU*<DHPNDhju(
z$U0loZQjb8hE!hfK4xCQ(-EmFR?eT7nLltrSorhv7L6U;+imH$^KPB`TmP8vdd>gh
zfnlNbA0*EIaKv)scc!KDWA3{4j)T#!&L0=?$Mc?fC+6SUdEUeCFCDbt*E@a3jCykF
zf`*h2@|K%dFNg?u^X;cR-dgbX>C$aCUfQtW%+IT{wj^G+@cIXO?Z{h`zR-O{|K~c-
zUAr)0mH+g*>h~8u``d$&jeSgu*3VX!4L=&b$at?(JMQaQiw@sxi=SBg=%UX{_VxKD
z<+DYr?{PcYJK)mAuYP`e!K7iM7W=Ipxcl3>Ig5kKwhZq#f6L;Hb@fY6?LE90<0z!#
zi~s7s^rJQZl(hRx5X_fBoqG!q4DWMTTE>4QL%)@^sUQV&`jUNtJyIOIP|z;L#;-J|
z>NgB3IX&C+SGUKp@r-j@W4xzSws2gwkD?y;tP_{?Jiu|;?}@ehW3b&ZOl}5^CS)7d
z3bTYcVU~yo{T_u9w@v+K7T<r_WCjPe-v#zx1`hE^knl+5Fs?^)9$w9PkW8^Bmks5X
z`z)twv{q&A;QTRn%@XnWn8UVGuJe;=Lvxv=x0{iXV!51}h=(tSJtyO_wmFYL;Ky?O
zXkwxDH{XvW!=X9bj)Z-GV*#hhR%LXJ_Uha9VdFz?rYYdxHM)xe&kh2+$J>Bs10L3`
zu!MJDq{BV~HaJPtZ*cOk_d`A&rVOK3KU{b2Z$i~G0%Toz-A++?*b=?^+8ivr9`5o`
zR}Ygfh;50SmIz54{u4Ou8I@MLzlyrMiic@Ccxd-m!S*VQ54EXk&d2LKI_!gs^g4i4
zAy?Ax&#;D!mGSP3E#xCOwP~!2WpJ$RR4lwqKE8^V{gKnlNW!OjFoc({Lr!rfco6=B
zc{vn0_8nqy@*mdavGVmizk%mAo{!==`HOhbZ>uPe#eZu_wr|YyUPQ$mrek1g@k=}`
z3}*P`p_WPZ{kTeoFM5UMG^S=dqNvwqFnqkhktCDk3we_mK0CCaFtJ?>nuBc&Rq|V8
zpvm^;#@c-(YUM4HY_Dx^hEKJoWiqiZjWmZF7(U+AN|MQO7ja%ZL5)QMC#VTu|InwW
z82^@V6(1`EbZI5SZwXiNsn$17^B8_hIANKT{>_nbHl5+Ogsb?}lA5P+48J9uuuRI;
z&5?07jN!M0tN7G9o2P*cza^ZoOpZIYlg5kT4|W1HC6hv}ym|VA#j7QpuuLt!Zlowb
zGJNVGS|*c1y+!l%1k<M_oUlynO9svHmoj|nX_}`p2B%)9Wiqwc)k9HkWcbwEHcv4O
zPQ6z16vE)P=0KeFWpL`%ny1bTPQ6_7gx?Y&QLooL9cA#Az2H#BC%!o{&Ms&0gcfkD
z*~Gq2&i+ue{7-;6K(ohy7{fgcx&4h!ztwS$Zj6t!-?LCBjWixzr?=7Bzp-%};Lie8
z$YO~6Kx8ubUdD$R!7$mF4kf%(m*Q75d}qHW_KBGZ7Bc=t(8t^8ydo@_<3@gP_HV+j
zRj_w}(b<mJm<0MHKp$_TvwstOp2I@X0Y<u`s!8Z`j`0~Rz>45Q+cJ0?o&A`NW6)T^
z+vx1CpdL$~BZLEt&VGrF<#44M4jo{0wnsMB0i5g@V05-SHhuy89{fAKfD@i>L@tBh
z4Y}UN{sPT0ChX4ab@pRyTnMa6=s&>dY`<*m12~Oc1{j^~l#OKoAI<n*?cgt3$d~X>
zf1|VA2}xzFe%c)Pe!SERRj|KNP&>biR>$DZ_IQ@#lZG;TX#t-MUd;H!a%x4{2mL5r
z$@Cecp5Q3<tr0bu_8FrwkVxgcKzry96F}q(c$xOl*TPS`z(3;xKLhlX^!!D=)ARqy
z1^x*R*W=UPuQLAP`9P0P^+ATegv0gtV$81Bf1e9{8}Him_|Y7$=Re&AeyR)nKvjLV
zUz|3MQ#hRVyVJs#aJXKdWgOl@9}WIcl->AwD$faD3oqhuk~@NzDHHrjF5!!`iWdYQ
z0k7c&fsZxtEIrP1fiK{jI9%Y1J@vNe@CE!Q4ktaGtyob~b$o=q89F`!UZ&w=<7LW(
zT|ysmX*Dkh{RLduCGhoj348$;b_sl8*K<1l0)B$S_4fK|;G={x$n$ww@E7)q_zHal
ze2IpSjh89gz{`S<xKzUnf{%c2<pqH+?A@lr7x3*md|~en9ln5z{#EY>VF&ex(VUjD
z>AWoT5qPN_F7y|0ZGDL0IFv2mWqrG-=5WEEpE|x(BlrurKJLN~`nU_Y-k-t`dVdP|
z8I7LWb|LH||BMyNAW!9Gp})Y(;BcY8fR}SP`N4U&!hKl-xA8J%Yk67l7ne5hg5WRU
z!Vdyp?+1Y|;KC0AU-)6Wj=zAP<#2ud>7#*b+tF|i*ZYlwS-(9_oFGr-WucGon=60T
z=<xZe@;EODdj(u?ukeH3UIE|1357nw4{z!C3%E=FAl{V7ZwYFV9mO0Z!N+UhMH>7G
z8u%&=e4+*}isa`>;sm+yo6z5lU(4pX@Q;8$&fx-|pQ_)b!->EbaN#$BulJk47x1@q
z{Dt4@I9%WhxT3LF+aASp0QoIRD1$svgP*K{yYlBU4ZhZ&7EVk2we{J?;d(!d`vUo4
zGRL7z^oL}Z7Ji!J5I&9VMLNR^gs+8*xoy%%JD$<rr?mWqJ{L-^s6V9tO+tC(LLZW=
zg>T|Ggg-@tFZy%B*TS{!LR<e=1CJ8<K^w2ZeEdmpZ9PeK0T*-Bgg;efsUA6heH`65
zT<^~v98P?uY51Jg@X^Lm;rb9CEj(JIr#8MBoG0mXvxdL$Kk?DRcWCgZYw$(8BYZ8~
z7w41&fAQQT>YLy%;G*3Le3hE-QH~RVFW`@J{^TER9FJ<?+Bk~m5q%uDYW$;(?`aKO
z8%M2O+IFF}OA9a8=%bCJc#bD~wei}<@yT8-T*RI9*T%6AcZh!f>Oc*gKjJV*v<8kx
zc}H5Jfn(~zk;HwU`140!cI_*UL2x_@JCYa9DG^-s&2%o}OYqAGz?0}#3GV2daZNnW
z65KgUqt1H}DZzVi9+bU>b4moKXL*qhXy8`}AaXO0FX8vrz{UQ#1jk+kj+CImch1JB
z^B#mm`28K&_=cPYf1m~~o@WXFDh=F+2Z`X<XyAz&xW5K2zS%<f*J|Jjb{tPHs?cxI
z$@d}GZ!SJ`W=Y}fBJ3{CzFKBa&(5=FrRB8T2;6?2@3vVZu+Mf-W_gi)#_X)D%#zFu
zdqGTMdUBvWBNtnoyWZk62p>Po2+GPS2Ze;RjeDDi+3ooBU78i2>|)=0vj*B{2M3J`
zpJNTj??wWlNp4#|`-L6D$K)5LmE{!7w3ija8)+q__Uz1Zdr?VddQK@mVCG;OmlYF3
zpW+I2;NkOhv-9!kw)Es6dy2iyUvCQzlgONzS&&(RE#fbv+&^J!#znHVqvS@2AgR?d
zivky<MwdP^m{u0k=5Xm)Wp*5^jQ@cZnqZ5H>#V8?;2ad*62o3NC$j|gJtHP4<~-Fo
z*q#z-zlh3N|H{e*#hj;-UVP78K;?8Tq2*T_+V+(O9h=Oy_SHJNjJDG8+Xe1fv%^Ag
z--wx&nBETB;2@&SCE6C7TW98{4W+Muoc9Bn_-00nCd=+MrP+lgW%z7`v;Cf@ZPKl#
zt=j(yiRY;{e@3D%Mv{K_yyF8aVwDwC+G1=V<I~2$f=(kz_uW=+>NrVy?^bQgkk}^U
z)0TbD#V9DuKALY{YtP7;nNwEUw(Ym^wbrrvF^BrG)>4dg@VVWIB^fydX(bi*DUNTr
zwqZB+^RdmiFl?c1m_4}&<28(*I#StoautEWShuKfE(WK;ZQMv*5F%G2DTcRfWAq^G
zj9xy}%8qQ4^dR<GS1UW>fF04XV>&R{k!_wH%s%uQ#J>4zb$<CZ7$1EFHv9Ce<14TL
zu+P9+*%1c-*e7AF>==wE27F7XAiXRrBa3al9;AL9haJ@eHe-i)^@v8L?)Z<s(n{O3
zmk$jJWY^hIJgaISWBzQp7!R%5=UhQw$tOi$@)8g=$755oWX2i6u)LsIvNbz%p13)S
ztTYVr&qv=?hp(p(1wFxRIy|vt#h1fru7m6(eJKg}P?WXL&+H-&%lJ|NVLs8*{DF`!
z@(%!G`t#>joU)Y2bFof@pE~Hp`EC>#FCD$_a24Y@?r@S%KGy4h4nUdz4)CB_IK9fv
zslPbKcMPTetK%<AQ#m5ZC)s-WV_nEU!yVMM75SrF$oJ!uN+&e(v814d{I^}mHv>*d
ztcy|4TH3$Ug?!&Al|n0@>Vn?>yIsidgL+A6P%HK?cOl<wW8{u?)#U#!_}9zN1wa;m
z8%GrQDz}#QX99sjWfKTI?>bT~h;~BqsVxeA0zMQlS^KG$w4Z3;@@nD8ivVEy>*{|j
z7t~t)%>zB-siXJf`kRS466sI#VS4??U~-PhCnQbE=96{;UtALUi}R7dBbZG9cpf-P
zEeJo6e42L?`~=*U|7s-u8w+|NU*xrzjFkDWi0j{4{d)rRjF--Tv0Q(x|43)O{$~M@
z`LCK9E0T>Jod=<}fcyq}g4qOs=ZT}$LLfgU|MkMZUj9kwEtCH-m#>$nKmQNtW%4Vz
zd=V#-Pjkk4`L5!(MG`-HuPWq=d_VeWS^N%g{l$DYNLdne;{1KkGZ^g9rnOxE2x5*z
z`qTWYUVpkj$^5s9-}v<M^yhbQ`8M#@rhU=snbv>(0n*EN<-ctb|4jnDkT3E}UDW^8
zTz_%@6uJpIac*`||BrF~wf-9<(SL*s|Jk~z5;z+n&Y`~mM7Z#uWsHiUt^Zd8)K>q!
zCGlSj=!N|v|C<<p>FUoCuD@6ZC-fC`;`}x~{!(=GiCq73j!5;-AOCIDf1gDESkMdk
zB0u9o|DX8FlGgM;<wE~DiT;ECg#KSi^iPoJe>WN*YkxZbrSO}ocpm~%mW18nd^w02
zOh<1Ut707Bh~)q4@ZVPdACu@$>mh`Ek<)v3nf_<_%O|mpmaE~Q7w7c8PNu&v1siF#
znz8<iRBEgKrzQF)fnMk>@_F!^O#j55s$j7mm#g8R7w7n9xm5p6Tz_r<5elNV>d$^4
z1bp6&G5cx#gwR{$on7c3%U{}wb;CkmK_|`)F7!VXr($UR9|2HX_4f)^=><O3KU$|N
z<cs_XyaXlx8=;3brSO-Fby^_GgsV;W!$Ab&;dWf=!(Z@f-%-*<K`-*5fXT+MJ`(-u
z{j|_q<ohwsB3^p^!@2xHxTZ})u7J6c-$x>!-fIiFBF}f>zv*1QpAf`zK_|ej<PVa_
zpCXaJ1LG8#{Y$v~vqI3Hls{M^pVqGk{YCEWLVhKG3H@9<<%dY*PnXE=>B9ekSE_==
z`gWm)Xb<AtmH&rJ<kPwmVYkS0T-YBwNR=Sgi3oXm`J|@on`OSFm?Y`zZx`SYOpH?m
ziJ;#o06Z7;BB$G|C~Hw)ZlnCgoq7G!5~IA0)9=IhN}Kfd&jUUA(xyd1xhP%*h;N=v
zz$x9o1--9&S*gJILDzM$E3rI&+c*K)DC<Advr7sK3dI-GESA>3nHG%Q6fG>Z{hMjq
z__H7>W}^d+KJa>z$$<UAjhj#PRvH@bP^yx#C-~uk_?}l!Tf-rI&teny0|#<-rBMkz
z_M~ldF5pjLk7wE&`8MpG`D4SwAJI3Ha&xzztjFH6wPpKHuJAp2(tlz6`hdo<_r^8G
ztyHe^T;Di<6lB;MAdl_+Ogy2(EAR>X){J_tROhV!+ec=_*6{AHubzzC_vOi)^kXN@
z3**+iHzwU{X^dS--+2+=byF6Y*VFm=Y_MPtQDH-kp`{IvU|&@ad>11g-^Ea_@@TW3
ziXlC}Fg?#cGqbELXI7@)=!A)*$Jvu&Mkb`hjgRrS&{B}h3`K@Ce&U3QDHA8ejdo!D
z)i*dmaJu53l6H>+Kb(s;z{UvCU2F+neJ%I8J>2;rvxjjCeqNn`pLo;HvWY&L7$EU(
ziSeAGf*kw@<2;|k*gDPTJQrwKGAwFS=>Ay$fnmUTlkB(8dsxHObr7732_I6?r<WOi
zOE}@lek=VChK~+Ll1%Iu=FKlW$?(yk=+XuTCrg{B2N+y#xvAMIGL>!(!`H4ZQ{h_}
zT)VnVg+IdJEk{QaaasEtNfv*=`XV5ruBaT;<I~7w@L?|SUvz=*4Sl?gPXCL#v={i^
zn%`y$S>zdS&G(<h+TRZ#x4-5$m{gA_tzdAcKLuRKp*4hpH{qAl0g2#RFI6(Ax`q?O
z14mlIOZ3d6g)if9;^XbWcK&9E;N3NFSNhQSgpyvL3>D1Ql#<-5_<1(Zg+2nF&*6G~
ziZpPoK76Rh*78ABM~dYoT5G3mWkOGaJEMtvt_HtZD`?|e>M-?YY7Hta%S_9tu(J+0
zxS()u%$&Bqo_4aR0FznGS<vEy^L)KqtO?94DJdwFtPN~+ZG%*})tXgOILl5q8hcqx
z%O!@*?lRoW%xrsBN!qN;^S(-_WrSrIeay9&s<uM!!jhPr#Bs948LfYL+^N0B`;j@N
zSR+Z%Xxj^QClihTn=xsh7bCHhjk_>u+ytz#v<9-%qQablvbba`7HS3BBQj=}U=?Fw
zL0mc3ZH2OOTtdDz2LH4s600KBMDKOkTVeJNn7!r|FL-gq>U^7PmAt_XbhMB57D{yO
zN$@$wZ#81Atbl9VB*E^)Kf&~OCL3U~<fa4C)WG@ZSL^Wg^wGFZFq;l9n|B6+p86Q-
zH_RMQj5labLneP8#~Z|Rk?G~XjSDh*@f(n?f{^EWdh(l$-i?4r;y$CEIiK0YIibny
zKO?c9`a!+@e+Nu^zY%;zCoAyDf3&7s=r8hjpaAKhpR*|E`t!`eR)6kFzL|IOTKN<+
zAy?$LgCX(M%dg;q^z!uQ+j;!;b3XGp;y8!qYC+J8{C<FC&%FN<2rlRa_%5Qyf1m*H
zT+p}n%zG(_Wuh`*mn`XV13A4OJ(~m8>X?Xl2=KL_r&!nofalAoVk4!pqdMlGdM4;a
z`y)T=WfO_m`)LZlNP5$#Qcr)K_8}L~vf5L%tRBNcLfDfozBBNrpLtJchPgKAK-SVT
zFOm=ai*JzmS!|JYiW1Tv&z*o*AHw%~#COVoy}CcPJhI?9lCFt!D$AZb>A9JnH;Lyl
zd_Ts|@1c)!?qBnf`Ov>kzWc@FC(T3ZPr5JMdD4#W$Gv;ik(2ng$vTpI1kc>=c+L%I
zoW`D+e~fx?P3@{}C;j?+tpDLLWi!c3g^vBU8H(wdmE?$TE!~E5{qwcZQ>HiZYWb}^
zLoI#(hOVjKwzR!MWw`4_1>X&!viOExjnVeXVg9`+hJ)vL%4ZmD4fqaE?P8<Suy}wH
zN#DZMep?UUh0n;Ld#im;T1igYjQq@D!{(;tlnt}YnvGk!rJ%6PLJ!sS+}r}yLYR)n
z>K2!W4WoN`2E%F_KZbADa{a46hKqZW_8FXDqD_jvm0*MMPf5TAp==`nl8p}0T^xJG
z(GG*^R&mjuez=rP*O9i<q51Q-QTqTMg3Hx}gT(H4l0EB;&fN>uP3u&2mq*z%`i;y8
z?bCykT=tAUis5UYDzx~`o+{XdaE9L!P8Uthez~Rc8O-oC6KX1$9Zk)i>eLI@FnsOP
zo|8cKj6Q(jYdSBEKAgc@KBHS1yya+s-W6z{(HR<G#poPFU2<xozGu=tTMK-H3;er`
z&7ZApoEg3ElJVc`0zMO=^`^~zcw+Sq<^C@4Q(eGm9f!Bk>1S3a!RJ2w%k<gig3mO9
zgO@(N>w?eYF8I*CFEY7;Z!Z^g1lP_1_;3Px78hj#4dQV69i-E0bx%;bB%bLxnq#a&
ze0m5V@(^AYe6Ho^5j+=s1bjG$>-lKs479%^+@Rynr`44j9e)Ae<bwYe9iRF9{5c&T
z0pIF^&o&KQ^qm9}WwMLb8HptPOmOYH#6XTf@IC?=x$qmowZDUm*5LD3LktqDfotU^
zYT#PAMI27`gx2$jBy^xT75q7p(39ZWUR3BqaBXiX;z)39ueg?TB)GG+0@%j68EZt#
z+qyLncm15K3VT|9e%q&L&daH=AQPO<_v=Y(B%AiYl!P7Q4J>xgNGnTgjV9DVgO%8`
z)5}I%NnbV}RD?McVn*iKXO!S)Vd-h5nrWhD*V(v(h8;>XFoWoSV``sPFn3nVX{2U^
zr8zST(pt_5sWEZP0tu4R%(7Bi;h&Y0?vRgn7!KI^-1cW?i_XW#s&{2jsIwB-)5>T{
zirkr5o`WBS($D846^C62Wdlc=R%+7^hh%(0$nh~rB*i+rAg6eCCe?|&IGX)YxyQ7b
z|M~1-5@dFCh-8^%<mL=@$}5A7b6c?ziioK<?ZnuG<WT(Nlg|&bnMVA2H?$2CWzFZx
z*pDRGPa^O$2+af;iY|ZXAUZBbPu9MI8}7r}eot^&%{#H1-2_C<(Y-ZGf8dN@{L$EP
z&E_aIFX-4Q)Q_K!UXQOo9|wAZ+3>GTJGesPzU6AJjL>BAqd7CZJpDP*%H$uA$fx^=
zne!ET-3kB8<cs^BjpK_<FaLJX%jBQn^2K<8?3c}zr6Kq-`OCP#?Lsim_3~-|JDL2o
z{N}iW(~*3tQhNKpcVT}tDTP#~W{#s?{t*}UPvL@ga7vO-<3PRqv0zA|^mAo2{-spI
zj?M!IGa7=%10b6#6LUOHO0^{D1>BeDaiVX|g1)u6vZb6}@DurO@QW<z<*(!PdUUa_
zuTIBA_)mcE1HCN%zP$e^=ZNHg*<2aTRqJIF$qvye@tpLQ&XolPS+q%=8B-x@Sv`um
zGHb}6pDR12QP4)pDK^w4=1HHw`n(8f+m#MTt<8<7Sn{K6?%^ATDgx!C`!_4{4#){s
zK4)cp4N~_vkv)r(hlTDMHf;YI8NR@wvA<TjtFgahkjKWR8TfH@Ng;MPY5#aBI;gdQ
zvSg4G?Hnr)O)s1^E3*Kj<NTb0yv&jzg+(+aSgH)g7%+3_*a?$|unkqXj*bDW{<q>7
zLx?wT<wNy7i||t0^LK&TGRgq*c5zI{inR<4Y$eJB)5e4@+vp%k`aYhX@6JcB$Jd|J
zQe{~mwT~+*?!~l%gzOYGRKVAf{Dh`LWR>`Lq-aN}c|mV~6)qD@9|=L<S|3jn&w8FD
zQEh)zYM%7CZ{RY)G~E~@5OMQsPVTT@fL}#H=D%ZHknj`vk9?>1--m$dWdo#$-#+f3
z6C`3M8zW_8&X_&ZxdgD)_aQ-6Yna;Ww|xzu-zcU6JJ|Sf6f_d=L15Er{MM_=+<4Hu
zN&O_nYM@n#cOfXVbL7>Qrlt_(s8T3s9M^7Bp2qtE`sHZ#34A#D!t(y-=2M<nw`fwT
zPSLvyH(SFFMWJb*>eSA*hEwdj=(}Kw;v>qmUa)b#j?T;0And^VGxiQB)dTN>@Evek
zi)c1bIqFk_2|jwB7RB;0`2(#7OPwl52sx)G8a504e88*PsBF!KZX1o}`bY51bgZ5A
zsUDzI(YX!paVqf+rLw81nOuTFUNzC-lctxK;rtNZvk<JTi>=`_^vw2l^28Xz!829E
zlkgq9fd3nKot`*ybL0G7n@C^cMSKMe_;^S5&&|RH{(gwn0s3}4@mu!yk(>J&-0Lxx
zNg4d~(vNZ%E!^)l^YxQ?=Ti5__s6F~Mt*$~-)!Ig(`%<r`Wwu9;um_Y_ir41Z{F+i
zyK@a5yXib0Wy;67zq>AHv-^5;Mb4Qz#L*pok1}+xPlcb%ooo%unwnlTyW1M*T6dhI
z9r+wH^{XWqT|0#`baK?uL#FNyTgX21<EpNyT-SgFs;<|bZNIJxblm}csGjsQ7?`e9
z4-vx`Nha3N)~a=3`{v(JSAV_92!EPbozVL87n8Bp;nS;a%%_!?s6MUbK7Hzc@M%xz
z*|U?fwGMTtpP@&6C4BlR>ht~3a{&BEaX$=y!GG0tS7WU%+7rd~FxL2fjCx@<_|%&l
zNBtl6-UmLa>dYIzGZV-p0YnHPpf({;4Z$LTgd_@Ok`N6_g+i)SZD(Q<OdyaD0)mPR
z#@1kHO9Wd>>=M-03@yLcKWO2tT~O@1QQWN*wQje&4(fJ;v7bUgOkC3WeZS|PGjrz7
z9SBzY?!KSBFuC_W_c_n=oaa2}InO!w&$Dgpn4LR<f8KDEc+lfs-YX0x8z&EeUeB3(
zj|N?1b~{gQc!>7_iKFba=P$)a10%+^y*a|@?;7E5dnL{2PlA2CGRo-3x^w^9WYO<L
z+nrueiu;Bo(3huw;O>{ZKqr;72JVj4;h4_iKmqLTH0*IK>@F$Q(?1qANBKX7&AA<8
z4o@Cpw5P%5<~Y)N=M8}^p&oF;9J01MaBoxH*9<0__3=FhJHh=~KkVc<=wMt(oeWv$
zINZHK=pzSq`5^k}4Y{7ciVYi%E+6n6-Gl3UVCQ=_jO|$d%dfn;+%f#s<>L4Tv0st&
z){dX<N$XgCa>LO*%a-?jWr)$gd)bt}4_w1`zcvtht_OXQ@^p<zYg_Y}BhZRA-;DNl
zgRbH7FLFDQUUh@s<X@J*n(c6lV>gZoO9JieU1=R-LHqe-clMD^=dyx6^!>fOPn^2M
z2xPd8e!S<1=emu4tA1&p@$~DSWZDAttL$Nou!k`*_F%vssLN=3NR#$3M%sh9r#-v^
zdsqv5=!QMiNqeY+J>Y%)bIOQ^&tV^te#Evegbkn$!hX_W2dB}W(qRW5LGC`-0qb{X
zmM2gLn|C|L4%#MsZe#DqpzlN3LD|I9b~cf&*#wVi6X_kgP5hBIk!19LU}F<Ku!%df
zj6fG`BA{$ysIrN4%_h=2Oq)m-Hc<$hICIxJVGo%YcaEWNzKi?ze&?LGs0TcsuzQ&~
zwg|nkpOmjJ?8EycVg2`cIX>up@RtGPU%_>!jSq_+6MUbc{~8Vdbt=KwOL@KUUmPoY
z;ICH0pUnWg4)8gESB63rb$}(Ie<99IU54Z2^^^NHqaW0w&Zy&&&9Jp{=)?Fi`*~7t
zCTJzYe|s_39E2ZB&NSL@_?D+{BhFt0J<kN=2>Sn#EQisXbg|Lz1C9eYv?-1;+~X&G
zR|)h(zjes;TmBbkCCy5|(QPdKJN6&J3;x54vEm@;uzx3m7thHH=aQGZH)*8N?<X(d
z1YK_ONj1lk^Nh(DKQPwzb|wsBOom_N*n7V5nEFb>n9K2)GO00l7-UKc6bHPrZZ|;w
z4_qm`Q=q4ffX)Awx3AZgyn82Xn{9(SNIjWx2kUg+7(>=4b1*T+AnFqyvoTI*pguv=
z$8eitwvrEfv~5OI{E!15lZ}`m8UAH5Vg}K6@G<nwA8@SMkR0xdDU&<_p0htrcBC8@
z*C1OmVx00_NgcJr-E9W!APF+KJsevcy_=vP>5GMqOx;BHHxcJb9n!Z^&RVG--_SwC
z3xm*4D*9R~`qYEyJCVMYx_dkNPX&DZX24Zn+YDF|+LnFoK^(KM`8j@~uh7;p#vkc%
zCGFk}zdi@BWZ1)T*s?cb58)Vr{S#x<k=m$OAi6)<#Q^5>N~T?%f#2s?MZI+GrX0z=
zzTrm2X86uF_|7ZQmnNeflhB4+FkUB#_|$#)INI-e=w{1?B=m*(7{7<XNAsAzI;o>R
z>D3)=dy+dwuV3DW;Aii0_?wN0iF~jf`k-xyqYi_|Yv8dQJXHBDDBlJ?idG$HO#!XC
zAHz1F=k9Qvn`Zh08RwpX?ajcmSF@nkG{m>y`5a>_6<5&?o*jzu9XiWET;oC8e^x$i
zBlQ0k+L>`6<1#hw$BP3!pJ5z`c9Z@gUJQ61-zVoIzQOoD$KdB9J&2{$e8f-xC)){2
zz^Mk>Cn)CtjG^fpIbTE@<zP)974woDRWIzf`<%uoHOCs1KmV^#r{Nb`r)a;W_t8^&
zAC-0U%l3K@eTef%_SL^;{^;g-CFYN*=6EIBD_OReA?Nn&Pw%qLE*?z%BEHCMxBq5!
z9P|0rF#w;>`4RmP+mP)yAAXQyCdW(q+GKOAJj}6j3&zHXpXKoluhs*W0w3I(ba;pR
z>6DJ_^|iu34nsTcl)hH=yL#|g0UlexV+-b5q_+ot`)BamJl=xi2eF?IS`P+NIwr4Q
z)`vCTy_~x-&hw!UPliowhTkq{-$kDdU_Tjqj%8d|IF6s{xAcLh#_r_fIgI&o_-w0+
z^OP-|x!Hlay%`tN-e+oak~HXmcAo|vaC|x==Op?(&z$3>g=2_74r7Qk5kp+>NJ0#e
z*1<6<1>;BUuH=p>h#_iGpJAv+N-@@upd-c*%b}b4sBtI_`cUH#=AdFsOA}+-gBa6t
zh9|ep1Dz?LlLI=8dr2n;eLe-h<l#pD6#R0~M^f-hMr=0)zZ}?83Vz9BaE@Q{9>#$w
zy`9kQd=b;8^tNK0-vwIPh!Hs!^I8h7@wiT2Q#!UjFU)6@^|=O~S=;)Y(`e_q3CBXU
zUZSsE5U#fkXmjo0uiJ`ORyQ@&RcB`BPRq}qK5cs8m6`lrdUa;Q%FL#`!h(Xlg6hec
zRrQrC@5sb=q4~A*%-n*h)22?(%&u*2Zd`r!RaaG-G^XCs&~Qh6&FY3VO;t6#7jji|
zLqk12s9m@6s`~o1E56j&)Ud3ksyVZ|XlY^5(!A>2nKNh3sLr33JG~~qYFbfVQU1~y
zx6hbXQ&lsgdiso+(<evnAL;kLCZWb^&H6UhUVq*fFXpP}eTnDcb!_Ltn}+MP0!u#M
zrgCDN@A~2?Uy;b0ulj}$S>{n$hJin1FmrdCWg5eXTA7hRdtH{nx{KHddtW=|VIh8;
z*m8TBe-v$*TRhqMh$N5P;&W5VBPZtbk$G}m|23Pk&b<+A^7cvGdx(pTyqhIV+{4E+
z(zZFSZSqUAtok06pc|)bo=w?2l>JcheFDdPHrs};bKS7$wASP~34sVVKg(OoB|jpw
za#!eF-=^ZO1UljsvGJV~l%0lmyr+qL-ew;7ktj5c?|HxR=D+<b^|e*vi#Er3Hhxb?
zm}px|TRHbd^i5p#?pha)t?laE8o?#6vy!f|O~TYWD43gyjdhp=r_N2>kBO;+^MqCf
z(Y~1Hm>cO^^(D3ShOR9t3#gQTt1SBlDOl_JLPUPzzA#8!)&c7^ViSEKwhk}rbs&Cv
z!iC|NOZ;s6c6RISJPoARN&E^czRXweq7h5W;KTov>1VP`IYo=9Lv0uz=;z$*?$!4p
zxQlZa*RXp};F!SY-MHAz?%n)X1-|}7Y^0psdjk6fK4u6uo85Z?T>_t06ua5wJ^z8g
z9~O%Yh~0Yy-xm18<KW}2k!4#W@MGabbJ@Io_)UR-v4x6x>WX@z-Gp5y@bxF%BSl>{
z!}gyAerg0sJ8~Jk10KEoi@=YC6U#2I`pW`8J(`F-v&*agtiWeT7`wTmo(MOuKPK=m
zjYS5;W#~_Yn<(u9KNilbE+f-K(*F7dek`0QE+b3BG!GjDek|O?pBRI`MBvB5P5dv$
z;1>)0Sh$IQMGXFj0zVdR;v>+pY;OwuSh$Hl#e!`Ze=qQ3;U@l<V(|9}{8+e&e^m_r
zqXIt`ZsO<0;I|3<Sh$HlBL@F2fgcMu@$+Nw`CTZy$`}JDz-1J~z!wSpSh$JLC?a~h
zM&QT7{~+K+(a7@5Wn2>j|Fyu6g;xnUA0>$1<_q|oXduphgt0|`W=h1ffd2+An{k14
z`};WXDnTbQE+{&$3pfhNP1XFPICO@9g#KQWiih@MNVwP;(T_*cTZD&)^!JzKP-(0b
zbRvFU)#YjdkNESKC7rKgJRaqY`0dvud@2a4vJxbAhY(lT!Fv(=jB-Z&xr%?g1U%xm
z)pM*I-$ywk{#nJ%pTyA*!v;IP?l|xc=*JG<fdY2$JD}%L&WQhiLev&<lz>P4yoiZ$
ztwZQ7;?G6A3;6SK<o|-86Y=M&eeXn>QO=0peqHi?QNT0h8S<RTqwzwY5kFij;h&&g
zMmZz?R$0Km3OT<RrXylnoZTkqToHyFIOn!W(3xzW;O`sqXr_Qi{Goz>9rYdMjQG9x
zCH`;$kN7tQ-wgeaaz^}^h#yhr-vm73uSA>(INyCArRBRXm-M&A(etCi&T&z0s^9$|
z0Y@XqP3iv&q8}-3MQr0loc;na#m4vFbT6bR@clO(t}KW6kzO2m2aNbSJUb43_7`qe
z`qNCX_=ZoZJmzkeJht-nNVt{nTn%5BU+LS*SLu)Mt*Npk@jv=86&X)I${wh<Yo*S)
zQ|-=Yb+6Olsq&cZI1k6lcPTn-7ag7{@kw8&quR(ye|{W%UmW;W4X(@ohz8gB9+Yq^
zUsVs*>&p^{J5^uSONT4Z$$IhIifVgG9$4w@m2fMaeG*PO3ltITl|HR>6kjVH)m~P4
zx-|NWH2SY=@WmSZv<9!x;Ab_suFpx3o10Zm<wvb@&XV}lzg}ODgj4>nnIy&Eh4Ps2
zn>6@s8vJGr9@OBvoJt<j(d&C#9KN$OIy$~jgX{XK)!;hcP7SWtOSPj_Z<!L`s<%Ro
zj&5&04X*2_UW4oUIibOIIn|n?RX=Lnv&y+d>dh+WItjP7?>%w!oGRt9(pUCxrJt$E
zuj@hOpQZe_N*wM|HNJX%`Cbn<E8j~c+{*V#3Affu`76S8z9UWYG4xe^t@M>WP=38$
zFT|m9P{OTrUXyUEoS&6ETjI#GHI6*nC7kur`@00k=qDi#9k+yA>!tK*ZO03>pP-~q
zIdwbfi39JGa4X-l5^il5WuI30m7G>O${wtAvNd^hJ4t}t+$g{9=hZxhaNRz)YWTW;
z+pEDVOp@a73mRP4Pf)_G^1m<PR{8rR+^UDO8hzbQepYt7Pu9gMr|Mr;IS)#FtKI%r
zljlP1f09-&-F{w<qn~aGx9Ugv8LNK&UzNv*W9O>hS@omlwO0LHXn)U((_XXU$fM#Y
zt2_(i^t%hS=XmxrO_NjiKXWDA+TRsl2jnW3INT}y5PrP|&y>f6FVo=4A6nr`9xJ>s
z4jtuh`F#-l4{u6-!m;EK-s<HM;h36-w@!IPcw!hDS+^iOGV8~Bj)t$_JyGKb@gu8b
zxPOatZiHWC9*V!!8a%S<h5K9@e6)tI{5<K5(cmXE{IME5Tdv0tf1Cza-~1!|5)F=b
zg~UeqWg498Z`=saFb~DwH#GPJ4X%_<{D~SoRW=6UU)12)8vF_kzC?ph*5KPUcw{xn
z2*2M<`jOQn+{4!JuhQsTnqZy~KeC#HZ|-aG85;gQ8a!WvKc&G7G`O*%W<^!wdVCsY
zaWnF=$}ivEjxUYi<1-CagZ@BpZm!o`Uw3;|W23kFb`q*vxw@vQ*<06)%=69oe(u6g
zNs4((SFWwBufz9fYQz_DVkq6PxOsZ6cmBMR(uE7X#U=B+Hx_@TZ1KY4(y|z-me%2G
zG*w<acp|=N@~Nf5H-c3KV`&Ul9(;>L$|F8yTo+4ea23Osd!XdiHQv9TLY0s~eM@+d
z6+!ZAvmT$e0{kkAG8B9;sBt|AExh4V8Vn3kH4SSc=v-ihD37R-5~?g#nnCJDd~l|w
zs;P$Wck}a(e+4P@s_L4inx*)ytf~nUJJ)B0%+K}AT(gqj@8P$ZqF!<zWE~>K&(A8)
zmQj2=&hs)|1iuosx*47$M#Q)!VRS5bfko=PD;uh7#QXZusyG*)stYa@<#$YO$^_#w
ziYiljzAp-(`m!$kjKI0t1(>n|=fjMWKzyFyTy&$bBOm@cXO{YiEYsN1;zMC^KYnmd
z=F`32mH6zux3LMII4xUYOuc>eYOucL#`yZ3?!9jQf|BC-Uhj?G+!^?eRoU9IT$KDY
zU4q?u^_tsPS2fi&hPyRBIQD61!F^X&SF7$^k58Lbt*i7lu4$_AuB~foUSsniGYr}*
z8rI@F_5$^eHI+@(Ua+pgAP@zstXj3EuBpcQ-H4@4H8sWxF~A%6)Em0&AoQnoxU%Wh
zx2qD@-E<C}$CSaRHlQwJ>gx3?#QxLhYdYE<Pm8WbtWvoWo?}I0Ws}n0;^|&XBgD4{
zJz~jQeP?AOMhkrLez4`kwu}R~cQl9i{2I>8jydQrq=gB=reFy6RQNSMS{E{(!^|sg
zif`v(a)TBiswX3*yc$2n@OdpiHW#4@1@Zq3uYKD18D_3{Yx4LRB5k}Sg*=kBM<<U5
zAUbV40OIRt;k5ApM5T>q;`iuG@zqmjnEBw%52(q{sNusXGem0m&pJ)KvC<tqe^a4#
zwhXcd#B&)68a)Rj^d8)oMQCqe7qxk!&LSr=j1L2T0KmD*-xkI+53J=M0)Q}&1<xZV
zKba(str$N}QBYm6srmFb;_!b|;+>EGk~sW*mzxB1{+th6`M(;6f1l*9=H>EK)KwjG
z|EoCs{c@70=KHKa=iOHRp*Z}fNxkW7o#Y4fsO^(D{GXEieG;4eIls5^pC8A5?w9<n
z{H*89EkRVP{k6*SYCT1Y5hH(Iobr#z@-M4`a&P5-70MIlvEYr&HUaA-ycm0~S6J(R
z1Ne}YRenDA!A-3vnrE^4zZQk<__s>_TV+A==emfM|G$He9e=f6aF1dv_tyG97N`6Z
zay?)!iEEp+{EtxHPX2Vc7~z)XDL<c1vdYhHW+#7-WaK*!{|P8>$3HU%7qIE=$2D9l
z|4JCO9shFKpic-Ykv~$bFyJ<nx8wha<nNQ1#n|(yCoBJV<M97b^7o&o{{I?>f1l*9
z>p$Iw|HGhfSO0n`sPZGS8ltZ1nES0LY*&BvvHOD(xfpvs#bvEOzt?BS|53oXozH)b
zj#K}GSDNKnXKv(wDSlS|s{pg(e?szq9oO~E+WuTGwX6TzlE2=6`Sh8U|1SWu<Inu9
z+`7zN_^*}!^SENizg8~p>HIT+YvrFBr~lW=McdjiXY;_yAMbtH%Ky47KkPi^|Ag{(
z^7l#k%Vl}C-$eYZ^8Xgfv(w-2CI6AUsBKpHe}n6G{5@06LI-8pV(h<&pOybjarF10
zsyMFeo0b1p<M>aJ6dVOJrTpa2A=%3R?l}7YaD>VA4RaU%YvsQ-j{Y;JnMHK_nGBGX
z|Fk&#56VUS^YNb&hyPPH{JD;8<-Zs~5mjUzf47e`<$vGYh5uUXe<R8h<_Tk%2OhcD
zt=FF>Y2}|7hyOZxv*LXGnFi60|LZpVxh`+z-vWSL{cq!7i%mTrWS*J4)G_z>qP!h{
z-*gj8uRley@_#!H|NG@l8TFivNiCND(K!51*zo6l1}pzWRNk)sZ*#E6R&MUXe_2<3
zbE2?a{r&Q$h8{ogeukC58vw#!#!*|Qy!j-}IDAc&SAeU}Q{IYiJ%1A86zd<4zeh2W
zdu#c};*6htvi^Ge^Z8j-UX82W=y-%#`TJ!3vn~9s`fo#dyKh{o@|NPFt~%^KmIuJ9
zXH|Zuj*MgCa#Q=C$o^|WBY#6u{s_c8Qsor9SC+T9c{A7p(%Y5_EB&eRe~8onTk}ke
zPD!{Jr+m9Yl~?*-3qTBS;Jqy$na6iq#74PG@Uxb$SyxpfKK3fVb7_9RGE;2kvH4eh
z$9U$n!VAv%)hfpV3gY1({GEUnP~V{hU_0)at_uEk=XmYAmgvFwHUb`X%f_DHeB<|)
z;Lik1|2`4FyW$2;CVu?JO%P$D`reGs{Fc`CR_tq?2EL^j{ry4xyOYq3_|~RLPw>Gv
zD~<5?CDnI9BHy<Z-+$t_L!xl-PN?|qCA!wu$qwWY(`1g6HE|SA%0@j<KK*-^p+g38
zfy-|gl$zhv<TsF-zw7BEeg(ckBg!FHnfg{>5XXc?^egnZoiO~)zx_9Vx1Mo6-eV2t
z(weVctp|7{ejfa|sjf*F^e8sfKM1RpuvEFv#$L^*%L%i*N333+$J^~94^WpZCw!B_
z74O;OWq<i<{v_bMF7bFArYZ0sxx}M9Y;bO>?-O4=f0xG#Q9N!7m!&@Pq~n@p;_-d)
zOujG9tl+$^#%WPkO?N~;*Jk(5@8e=Hu#N~O6}xwS9}%cnh_Tu1-ueBGz=z|s+3eo=
zZ58<FjW(OzJHIUgUrrz_W$fPJy;tCKbtraoMLo@8USBWpHK(W*vwMfPS>VfnQp4q;
zD=GuEd9hC5%K$6}KXzdIrofMdoAmXkWlUl}68N$3hXj0_g`;7t6mVKu^j0O{k$1Ax
zRX*>nzcZ*x@|*qa2iA>KExR0P-2xu56Spk*I{Jbgoy#GQ{%)Y^_j}^thaivsZlLf9
z;K64xM>!+*FirAhKKF~A5&dLJ_+4@8#SmD3XHfVDz&;f4h&?EO&?fjs+Fker;QH~i
z%boU+pc83#;Tr&JBtCxDEmzbx((Xz>x5SbEDj`p-{!8NMna_IJ>8)JAW9zHhlg}dR
z&uA&R`D~sJPmmV~*R4*~mGDee7<;8}(%0cvN*uy<I<!M>Z2yVaE4pgWXBTz2vTM>&
zyjWi0Tj8p{R{DysmA+~pYkd{mN=Mm|l};vw!e*`SG!tx)ezrX3POq1)A5}-vk;{{!
zl%hkp{_I?#q)9mE{%TY8C0w-yujzWz=_@#&nY>&P!Cuvu@GCU9lAq7K;eU9WD~||=
z35T~O8eAX6>NR+z7nuE#mq<q+m42q->!Z&b8a(1v@SPP6u8$^a&5QISy(an@%ZQgS
zj3u&?#E*Cb5RZDC0MF+Ytyx)Bx#o`AW~2d=(}vZSXL|S)U)7o>JRzhZ#o`pkQsPr2
zi<^t^yxxksm3Y>U=hgLg58LI=T#1|+HB3e(rO3@|szHLXhCA_42CvvW#*;fEjO}e~
zZnAv@CzkLa(ISt_SlNW1d9k5=j%()gEKyG<K(jIRo*Q|L#e5W_Zl!$GE20}b9I&*i
zVGXi-m?+iiX)rsK_z%N~Cp}_Y4LL$|DcSt0DZ=^&Fk1Oi5{1ZTXeyi5N92*$l^w-i
zH+fp0NwCw<g{Clxstq1;ut;9HxNOl4i({YBu%N*n1e$n+$a*c;yoP57ibU2m@vwq;
zZXs7ZrXc=^CljLbv*A$#fvz4YST{9SJW`;%r*sCNV)s7AZ{43M5<%&Nx-1u^yHIGx
zlK>EgrI@JA6Ll6jNr)VZqlNf;uJXzst76vjH{b$c9)%$HemP(&Kc5LWtD?qH1*hD0
z{BHxCo0XsSoMr9!KVrk5<Aas|OMuz&_W{mL;hSf%^86AP?D#)r!=K}jqNnPg38mQa
zuayi{ybzE7B`9ylzuSgC$2%+ke%PNK|9d3Ea>ZEgt@=NW@^<`#l9B2mnJ7<_w({q<
z5A68AEcvPO@>K9r$K3NCs~!K5a&TAjX9Abwx0OF*7(4!_0p~W!+=c&=m%cG}vE#o)
z@(;H&@E9jp`TqehJO1eeVpHYKGn1D(=KdIdcKjP{>d$z@%Kuy7W5<7*<ex_-+Gef4
zA9!~B_euUfSvC`U#ywX4TL81;uiibGh3ooe<^KRK+VM}9Yp*_8I1_uuS62R0;@E$u
ztpEA?-{o=af1Tv7?3esGd$aQ2DfwI6ys=O6XE}XS<rQp49RB9F(;{p0nJB>7uPU$X
zitk9;-2-@A@>hJ+-U>d&^0=t#sqj?!^W6jZm8`!ir}lROZns(a|4x>-qOX&HMoR%z
ze?|LE;Mv*F+p_)WU$|xB$N7{huk`mJ%3FB@E&Of5N2I}$jNLOBSLNr6^?vo|eD?rm
z%$!*?Qy>pM&sBOeB{DaU*m;Z<XthwO6YJXvf&M8*f1h_Ka)>12d%bStv2e71{q<|!
z{K)0X$sX(JXYP<Q_(m_+=DS)l`k(``R-bW?5jYld271~Yf&1{SVA%40kl*gdx_v0c
zJVqSTZ;bLUB3zYA_Z#iZA(C;{2)u{&a=>wKARXUwPs6vT$8h?%eGR@LzwVnxU=6-Y
zy$kuE48zYQlkGvQxp(1y0>5jkzAMgSUPCqa23ro!@;m*rYk}j&H+-?S|6DU@ZM@eA
zG=tVA3$0c`D^;Uq=IQB4@$7HK(rvH`Yx{CdpSlRNc=4^?q+ZNhD^4#cht94G^m(sE
zPLR3Kqo*G_ZRfoT$`fjF2>qUdeyP)W&}lZl4=i+uJO{OqXEM%rgXSE3|F;<5{LVBE
z&St(a(mO?ZEe=5s_Oo?@A@4y*c`6}$PYZHk;2dq!Po6y!Jw>(1RTjL+yzkKCLOy~C
z{1&xw@_6FT@wi8GGJDA8@fk_RDnFK<Glm$eD$OPM?JTc;As209NZ_Lx%x#hw7$|kL
ze+}{r8$j+5xOZ`Xg>^apfHM#ZxdOYOf8P7Sy|RcMTw)%xJ%Xc+{$o|)+#TBwCKv^T
zC-GbAn-0!84qFMj{IfF#ke>(NSN>G(b_v?eVdSCSMIX3~_Twp@{_7o{XV6EtmOy`~
ze^c;rqrKFzc?V??Is>lI8E|>th5D&>J_g;G_pPo&8<#;JXcL#-#%3Qn+b|^X$sI#s
z3yH7^H~LYM=toPSGwQ?*+fn_8Jl3M#{3bTmT=whzCWt=3>z&9=h4r(oc*dmtQtTha
zJ`MY~@V#fmF{we<SkYgI>q#{7?*zRA=zr0)#tK><<RfsGdy0@t;;R{7GFEk=PVUP*
z+tx3yE!=@0#-7xEe3SnZ{Kn2_`<Uh4rF?GVWarsXg*U-CiT17Nae9g}_QQ4n%QF0n
zTAiN#n4|Df(A4K}yas)SGCk}x0^Iu`7xx(nMsBgRGu%VV*@$~?)QQrw1K&wMy<i@6
zR}LLs2VGtpINMMr`c<gK)OU&GS3VHR&l(8reb?!1qwODqyv^v>p^y;>U1XU3pvCOB
zD&N*=+}mp%QBufu_Ki1X>bZn=eBw93l!LQFrN;WZ9&;46BEN$hzJ@-;_Xo#S8!sOc
zsLe_UuwSkJiK7V5W(<&q>R*|V>7Qh-Dt@2)ENobP^E}j&a^$^jNr4ZlobCVKksRnv
z@IUk)UZelRQt0>rW6$-wjP`fG=h%~S;+;Rg{{!cqEe>b<A9lL-l*49{;1>euTY*DH
z`-fLu6gWO*M1Z+bf{EAd2__ERvl+gFz9JL8!Yy!3zck?@qXK-}`OWXMuxIAop+D+|
zoTClo`}xQ3ED9zX$g|SfM8DqiUP4h%FWY?d?xd3!?PFW9-GlEXgzsq@;NyVpO+f!~
zyFLAEhv3cr**(u97Y2MdY`8yIIz;p(2XNmzG*sX@GX0C*MLq#Mr`CVW>z^G=ymn8|
zA+1bRVtX*ry(jp<F#Lw^A#dkBo^2UtU8_PHM+HJ1$c@JS*8*99%j*}@_IVE37boD`
z=Qt+3r)6%@gHF#g$2&az<R45d-^0Gn`?4PN^>^V16_4I07X>~*x!|E8?JP(CKwS4g
z@zG-7Ivs60NK@5~IIT{jpyyCoQ8)LcWkqg$FtX>pxu)NEQrc4@>?w|~%|xCw`dSC}
zq#cBuLT=D(9Y~xRJS5LSyPW6G%5(5=4<r^Gmo~;S{JGJV#wJ6I4WUCW`0A9v$5qUy
zHyplaL}1{Mv;Ah_ubnwP@Mp}8gLV+(cQ)EjjNKcZ0k_8}a-(hCxL4kDkt6UpeE1oc
zYxhR!!w+&Scge9Fb`yj>zUN|}WA3ccIie0O&wjTPV<qhR7_KQ;E&VY17@lX`OIQ%c
z-0Qv|bcxZw7;Q?t>}232N5=}xA^9-IZ?*;G6gj#wCK>&P|Grs<zh##3olUdQHWw5p
zY==*3OYkomj(*<y6Hj2<OGeR_t4jho$k)Jp0?gZReSS*EVaKqx4_puK;5Ym?(GFz}
zKb8@>?+^oQ&M66y);vd2+Xt&2{Y~;eJpJcom;S?_UtM+f&p8`jMSg;^qw{{8g4{OC
z`jSWZ7iCXK?!Z`N=2JkOlkj}P@hdQ<Ko7x|L$i`F?iri>vyO9|!I&BxdvJErIKYzp
zvyZvv?g@p4V606DyqkeOxyiZ5d9i<XE7}*ny}cEAyn0HDO`Ak{(GKs)u?;-Lxn*oS
zz2HXp+^@jT-T?an&qJ<o{4#L&F9QAWXMJ8La9psf1d-#c2X=G{Hp20XaUuLjPR6&4
zzR8BC=oP~#cm+9l4mu%s66A(|!n`l_?SDhQxLb{r?9cAIGZuGVZnSr08AXUAQZq`8
zr%T}f$6e%kCNt5rpX?N)eV@}2=z{&>IX&2wIVRC3(?8R1AGp^UI56JmKkyr4eJA{K
z7yR@A`0H+rQIvswI&;kTMPKg3c#{dA$ykv-;q-#Js8cD%niABJe)3lkO?;Yd`xwKs
zpSoHDyL!WL&pa^GSjG0om?hvo$YfVu#eMqoF&z6j?xTEEeC(6sVlDRc-`$K|As6$n
zs9ZRdN5w$sKvA))ALj~>d|N?>_8EzZqv@Ej{t(nxi}OEaOxFxvuveiA+8*P&Zp0X8
zVE;crUr0kANQbSjML&28{a`b4t1{MN{w(D5XoIaDN!suh@}8C*&E7S(<9g(M%E)xR
zX-rP<px%8+@U4jBdYndnxX*!4H}gUQUW*umHo&n!>E{jPs?=k9#6-{8>4fxWpq%V8
zM<|=>x9rEN?^4br^k2$s%9$eMOhUcflao3auQF~8B3@<Onz6wVfPepVG3#d-t47aB
z$^!a)M2s0PdWvW-Ja$ipog*gXc@oZh(0*>TT`k&e%H)zjH`<OlVUVx3jk>uW?N+{_
zyTgrkn~YpEY%@1<$<VL4znBc2nB&o4?7y}I@hHXzW%Fzo^v{B3*frX1e>XnV%yCLx
zuPqUu5Z%sm-R{-c*XJFE{u~+mI9E}9uM4&lHD5_|1VR}5tbMW;cD)7lO#Wg?AO-bK
zhpr|&lEZ$Txe}FqDBphbkB4=vg>P45q#L?md^H)e_uS&{aR0ctD0@Qp__yH~=OJ$?
z=8nrcF>bKFzknUqIZfC>#04zN@ss7KOT<cIEX@YqX2`{|LFD`+ULR?H@7hB2rHkE{
z8KW3mWXss1oV*cpjYPS4xX`bVVV=NE%E2>!{aC6<RrNr=pB&aBopU3Hk*{dk$=7$t
zQ`CbPpa=aD>n3>-8lL^6k)3ShXQUXbjv+RsJazO{s2k%5)-?-ycA&o0iHHM`Yi~7h
z)EHfh@wR?Y<FlE2lK32-snfboF+Oul662_d@jOLc+_QczBOl+l3Xk24{nhxbkKG)z
zIev4@=GYy4pj3?8?_Pnq{Sb`V<FGyfo8*|y{IgesW>6ciyUrs1Q{y%GW)C&;GV(D`
zhuzRd-O!iY;hx!yIii~HK{h<2nUT|qu?hFtMY~hCN#iI7<e3OLF5=wU8OXT!Q~D{i
z^9N|R;}dP>)TMGxjW!kS2;5rElYq-}%Eo@E=6lCre=7Fq^UfFXM|A8Fo7<TAjo_z>
zPUBhBSJ0n0FL7f&;&&nj!n}=fM%o*mz&p2?aYpxD8H>f3m}(TVP2VXoo_+~yEWaJ$
zc_uhi%9(7mfB!xs(2DrrCBPWhn(~^qgmoT_%VsWUYo1`>rK<6XzC_>+G2_=|utBs{
zk(yUb7_$xYiU)TP$BqtpMxGhP+L4Rv3Qo*{U6>0eVB8)8|27mc7}jE1jP_eaY;WwY
z#T=SzFiBT>0+&KJIsF?SY7G@1-RUx#=&#c-m+6L&af5e-;ph#b4=zJ&GzYQKm6sJC
zWuEPiq1QIxErE;~E=O+{>@3BV(zektwzm|=JE=F6+X=n8p}$t>75<_<AM+;IT~QYF
zkm5)?%>0kHqtCtKOl?bc`X8FYe1iBfetr)*Cv#l>hdv1X>Cen{mCd}<{Tq+6pJs1r
z-GQ<6nT&53Cwn04xctpKNHZILtqyHM9bOIjrvUbSwB143c8ou}(SD~}i~!`oSj^aN
zEaoNV8s33rd4*g9>V47^;2e)*2l{ciP4u}Q;qFA(t6T%h2d{CcL(nx&*aN;jzWaI6
z#^b>w9X!l+8r&zF$+b(iU$)Eh3~~~PXPwJkX>B|2Gfv(PJ3kJY#(>^y&hc%Vk!yL*
zrU)GOgi;^;;O>WdOE9;_SaaN&+_t6IX#XQ}#QMIqanEx2#XZ3He{0U3EjX@3?y#Ls
zGjAC3jTJKQDDsUJGN%~yg!yS|8~kh0X7msD`i#Z3PNRtPjav8x+KTFbo6xT2Sb81o
z>RQ-W8SHE>?5z}iu_U0caj|avx#c_&d-iFOr&c{vt*$ZFmDjhEzWzM5{=B!q8_9Uk
zoE!QOhmnUqH{6IEskP4HqHffs_AwDJ6exO(S$sKW8D1+7CC>DH0c&g`mVc>>@|iM5
z=S<@qI4ELr2j(y4Gvs2uL-ujXK)=HIF?~xXd`lPF6zgD!`Olr>j&&k!#vP(A9^>hE
z(I3P*-xA|wD{P?)eFr|j5IRbIUbAJ|@f!Fcw3k>Xr0&dIjHW-@xGcX=&j-i)lSjNc
z+Bo<Eq2mO^ukZ(R;16;ft(eO?dhbIYUXF2uu-DMva*X7|b?_S^7c|yC>fskQqR(vy
zel7ao6h|uhc5?6Sh&>*GeX?(-xRTJflSJRHLSAe76!z0>^zk0_@vp&`uy1#v{@Li~
z87_CPyCu4xk3~Pnt8%I15cg%TGxfq8)_5i$buH+T7yAu!x>mw|-3~|FIGm3a{nDHd
zGQav>(J#}WFRn?LeSf{^m!|HHV_k@OTZKP?ektcGY1?+7JqkD%RefX~cw{@$+t`oJ
zJ-_<}`icX6CVF1X7@EG8y64&&*Id{J^vRQ<NBU#xoW3~2;q1lx-xWEiOPe#|Cl6sB
zto-w2=<+ypc@zDzBdIr=u^)7~)9LPQy)Ramqol6ppngghX(+4KlxyJ^x=?5O@87{s
zu-+`wjC%8&zDU=tqS1#sj5ku-Xm6%oP2bl8y*9sV+AQtWi?Kl0+b4H0r}eMI`XkG_
z|7!p7OZcitPRY?emHW^fs~^6lByhl)*30<1^V{Y-8a$_O+?-W{e2YoF2hj(S3;ZzJ
zqkZzp4G(di$8{4Q`a>t|Nbh5iIaNQGeGYyvHa2lT;R&#<Mcm1?Z0O@d%%_H7KJ{J1
z?)8{cjYRDG;CD;<+V1oAy@t6J=T$2<yw))vzde{!ZNYEM@ZoJg-7})&!N7=);p^-B
z{ukupJnPQcBRg)&AK4K?eGqF@;9g`ZkMaBn*W|-~G>Bu!9py(uu=$?*WIU$UzO&@{
z2ot{x<vxDN(cS}F%y7&(Ibk4F@pHWA@*h}tWIW9=r1>%E47x+i**~YuI5`n|HXPCi
z1IInVygsMcILYxQn|Uq=N{?c0auT|&z&$5%51|$MAiZ+*m0I|CYdl0fW6fXOJBxQ;
z<t7>bbR(t|_tQ9*v>PW|ppU!$fY=Lk>rl7TuJOC)xRQE*0DGXF9~*B}tU+B{onv|@
zyV0Mp-k0S{J)DGCJUNMZ$BmQpyXDWd?%;axn3Efh`kiAAQ>V393n+4pIqY_fIb8b(
zBk(fnK!3Fi^zQtPCy?}=;=V_nV-HVpBp>bwm2TU3QCn{bb=0?M(Hz7^e)vh!;XTn~
zrRJJD&k<LoE*~h_#(RM4#_Zg226LvQ(1xQuSQ9)x-gqwU)P|#~504vmNgKzL@kUx(
z5I%^sKN)L?Hm5J#=t}P`PC=}eXq-HZ`qg6XtPX2w@M$NrpX(5HD!RyhxF7dP7J_fK
zYfP^jyxriNG_c`l-B{zf|3qw)hI*4{`asE1%IF@J-j?G^?M(vTevF%ET$k)Vh?wvO
z^r3OEW9GTvc+5EY5_o@r>#ITAuCAhO!tLS?x66bPk#?y)1-r4x6&N*mx$vM-j9giW
zKPlI}kgGLRvTdhxY;QX1?1rAZFEXA>6*@M@4tJ>JDDO|x=ZzcYZlivwYjvObBgAuT
z?;ga4q?3lV&mOFS(eIo|^z?7fGLD#Q;U+!W4SjYo`ol-?i9O3p0(W9e<9#>cp9Vc2
zY$)VR?WN7GSqh)J4Ez>50v})D3>-w?X@y;3p5N|<zR^e9$Pa5b82XIuobM$={u><z
z)~nsSU&DC4bCYqh6ywV>^uK>XJb44`yZ(>&KJ*>5>z`c1b|*WAw{3S0Z~ID>(cXzT
z6ESA{pDs2|9z>k^PcqKj=or@93Epk!J2#+?UdK4$OMO{JVEyHez{6tPHOJWXs80c6
zaE{gV1GN}$**8_Z`66PD^WES3yz1cpBotGJUu*YM;>A$unZ?4VGoEAog71}7thvR5
z^=0@D=$5|2=}NQsj<hJ>aZvLe>B@It%q&Ekxh*#S3f3&gqJ74p&#8N`?qTEFl3i)&
zcVpZ7(6)Z)k$o;*>vNoAu-(UjW)AFNfwY4UF(;!PR4F^a9D{c7C)k6sg%i>i{t>ot
z5O%<}A34f68H64DN!q~~*YMrS77mAPAw6sh>nygg4mQvVdv;swL5~g8ntLRUeF5>5
z1LM0Bb6l6W&)}{w$5iV70Q!#)^*n<Zk83b%vx)=n0LJ;I8})n%dS-htX3>4Q@Z%rd
zdlY(osM|TVEzRLPtbD1kRma%2wT~HrBDM$SQo1ix?SXqT;+}Y+^o6gY{nOwN-Ds2J
z@R4kjd7wWZKJXPM?gIhV3psYeA5O%0M7!p>*)D0j|A_J9fb5?SqJRE>XqWl2UA}`p
z`cv4z3F!P)XG+^o@r&0kI~~JC|Ex#;==q|5CYfz=ixH^Hite9l;e*&F-S=hm(I26Y
z9^n|R#@;?JW3`vVu^MBX|7j1S{l89oM903#lS%?yuWv&v#Wj1zo?N#VYxWMz(GoE4
z!+axKuGf#jJ;(~I*}D;gKEKG_(aruT=iUc#%yC4Yd%uGikGNgHb#D^$hMDTz;F=<1
z0(E_Y<vO3|!S%YwJmTKyaNMg|IlUy1jQE@PR~d)%{%RZKJC6IS4?0G)VV(W(a>U_~
zxqZ$A$H_zJ>&7N;AL+<3<wz~Y6l*+QjZa)w;TzNI!ygg8`s!F%_SC6UCmXTwtFLZo
zG`~?jWlHvBqp~@(siC1cGwX}1vkcH(gVg0~YrL`L&UrD0Xmia9yylNw=#nI|q1UZ!
zZZO$Qoodvr%rvgfL{0z3o6~8S{~U&M=nxzy7!HFk{r)$62i*hRrAz(!95|ReVyk1x
zu*(*T#N0^0`~xKQ{^7{K8}*~qWY;9*Va8RFqWi7izWvWyuIk$)jTg9|JHjX4)i(39
z*AL6^F|D`2o`%b<5;xoA=XW6axRwY!*?D$Y27odXIFhadU(m&#@6&>Qr{lI^m-(V(
z9I<0$$EZhB|1RxE>B+7uAt`XelK$>res2m({^-AAt2b$d^N>F(@{lJx?@`&KWtow{
zRyiJqnMFlz?}d`i5|hpeN5wEa9flXwAEw@9a_>pbVHvn0B@sek{$Om8WeZImEJRT|
zl{=A)d!Z_9Dm)p<tt}wXn~Psi(%eoN)qC|SkA1UzwO*vLPgXD5i?fQzC6OC2oAtq#
zVAgAEbiKk!-d`8i5EjnVFLj0W5wR&<5q6J+@t7O;D!==D0WsglRQcWO3A5C}sR=p@
zmsNiEw=p3Au0{W0IiGOpEg-Vdo8Q<``Q1;OygV>NYx6n%!!kUkCBF4r)-V}*i~^u6
z`_FBZ0h_3^_ALV1?mBr*<YAaQ!hasyEr-PbC)ReUvzH|;rN>EtiTYzd4ZpC?EZ=O%
z<2Br<<krYPO1EYoT^IiF!rT<4Wsy3ad<tbbxfAcNs$2@9-^b)%5BH!qNrb#rj)nV8
z-r+vSuJU)uKN^<o^r>F=CUU&bO#vR;c&}uNXOJm#ynf>Hz!<H)!h<5GW%;=M3~s}8
zZVAy8eiyOlLivKMu5-klVmp`4$shL`#TLKbP<JG^{oEA&3?<2PpQItHBJ}y1go*b(
z=8mwjUDqsBNHbN_<`b|;%&nfp&hJO}qVIIt*&^F!p`>;HdD>=Sv}T23F^@C0%JN&y
z^3in&ci(Eg8lv~I>}#L0EZYnBtHhRW@{O@YXJ2$95G@%$+9Z#$_G{ptsW{HWeu6xn
zi2Wpad^z@f$BFop@yn6NS7QGqd3+W2l!rLe@tYx!^Rb^Pk6BmDu>{UF*i-Ms|1y4f
zUR)d(V_zbV=VD(bkFUd?{)hP2<9CBR{tEV(3kvu`?7u3H7h_)`k8i^MW_kQ|>~E3B
z?C;-@$3E;U<#84E)%cxnv-|eS&T%Xy9h-%K-M3d(3w+rDV(?|-YVZ%~pb?(gZ7$KW
z(O2FS_-ygm&1HJ{s0)8D@P+4(g7d^>jEI3fDez<ACjLb+_*(^jEZoGWHAZi%1%51?
zSgvpu)kv9}1b%7+pdGoy7hp924(AB`v}m9_bA_YH$mJi3_7a66z%ahJ7zG~?sIhP&
zxy0K*QRv1W1pfGFpgeO$eNDpz{#xK)5(i(;kYu9l6Zo-kUUeCnCX)7dm%xvO6UAlF
zOGIxE3jA0&v0Mf{N%Xct;K#y=<r3Z|8h@d{rx%LdTv1=6Fs~O0e0r+b&80r_sa@J8
znu^{mc5?~O77hPc(5J_X-SDVT3@|A0W8p+}iAX%U$SVTBFd8V&Tu~XgP2e*EpWZcg
zb46tuHm`RGe0t#6%_Y9t8x6l-;L}UTZY~kIN5k(B`1Itln=2|Krg{B(flqHAySbt=
zx0%;x2z-tRv75`_=n%bqN3?G&oLDY{BS`diQqYfu6U$|Al!@McC-7t8#BxPt8aB%v
z68IdUVmFuZ^%&sK1b!@>h%SR8TJ-j?z>kF!%Vm5s8X0Hz3jA1jrGWcl@aGCRN6gsG
zWz@s~za;Qu;Y4&9OJndK5bYHUUnl6)#^B#7;LBp*3rF(XMv-yZ$3OzxBJ6P~X1f|g
zrrkH24va;N<n)E{3+2&*iwz^o85yTUjE-wRL7-(v|4*1h+QA==ga4m^XE_x&!?<7a
z-7%c-h(A#+{cT*glYe`XJ>OBIsh>z(A=WcM;~G>c%NdCu#F_=*zl%fX<v8%8ao{tk
zXIU40cVC=#`9&N$|ALSu%NZF*#QYQl&mz>wa%P4}pO#0@$Km_yIQqW<_*u?~pH%Ie
zDcU9CZ^hgWJk}zl8|93|MJl4YSLits|A_S#;7<^C73oK+r60kyEayTgwVdnV?4RSv
z`D`5hv?C-M<&4Bd+a<-#u){2;vKq|)Wxx0mLZVU5NL(b=Pf%t*u8(r2hviZAT9ZJy
z=&a(JYSU3d50Q9gzAX7D>}r%V61UVViem_m#3yP!;2!~3G!-iM4RPSfaqMR#n#7I{
z^N85ND^WpPIP{$5oER2G=>hLd+2X&6u9fAS9L85P&knW6{|`6uuMFc)lSdnXpXH3i
zCyf%`3)hzAjKm?Rj@V`kzQyt^!fSz`KQ|0l^xs5#WjQ0`@BI?v5@9EiaZ}9IaqY{3
z@AY9iif<qEoaKy+gJNC{thE9j8Slh=8Sr(YpGL+t1!sN+rK>O#9J~skoj<3E>)-5C
z{Y&*HesgV}Mrf8i<~P@Lc!h*t0=POR$QK8$?3egolQ`U|_90)^TGgdl;*hTnXMg8L
zI-Ikr?J0Rc_!0%g{xuCA(O%@+WLA9DzX{jzuf#bw!qKGR?KTb0d9&K)%LAp)m*x3F
zxmWsBaOGi0|5il=d!--36%H@^`3D=}oTIDlXYzn>JxbB_qr>;c!QZFB^?GGWxT@Ec
z@_drqt9mK8N5UzOZYN4VR=7{YSH}eD?XI`4F2CMhuS+^gPSrEtkZ>iZg7-)`<w2JU
zZ+#kE*YhOcaU;I2pF9&R;Fa>2yK)V#>p>lp&g~k$YHP}`WaMR^#G(8;yjsGEzd#;y
zS1XT+ufyvlT<PaUd9LhD=|{o+@;c?LlE>U_*Wjuy1a)d~y<Tr?a3wQAsi4b^^lQvR
z@%K^<uG81`zf{AYrs3;!wrlV^H2fztxY89b@6+IVyYpKx+$g6Gcf<cHxNZ+Gn_z*j
z*Y^z#UMG*a`@K9??b0pJgL1FhMZv|w9<EUyosLJ7bD1p5or>#;zg&Z_)9{sT@UpHS
zoz80-zRowEe$;&?^40y%G)-^1K0R^Z3**3j8eFGe9S5%NTTvdpy*yGUO8@HGTnShD
zS8(NvNJqC%)z(({J(3RL`uMd~gX`nV6B=Bn|1%A)+y6cduG_!zhvch|zse3--v*Q&
zDa)&V%KGZ?kvQi@I;!qG*T+ZQ57%q>%C`_dU27M;-E}+B;T0Ob(mm;{;~#9+dg=OH
zWul0`s^1X5NrRt|$NW~TPlKP9$HcGH;Ab_su4mnk>Ft$=^4v&Ax6eyWuz>6M*&4iA
z9&=YNk16LG4epc2q_4M&(gX4Jc9|scm7U)y&lO)~=L)XupY(M()v*=crOD%y$K1Uj
zkBP6>>q8B$%dhU=6JMAA9-MO{T*rSzgX{P|lW<jEHFiEF;i|q0{<20#j|bk+;JSU{
z$&j!-x_!oL-#imt$bXkS=1$dx_0ro{wTqHpwab;Vtdd{B<F(foiBI~f?FiZz2OiYm
zcgth$bU&cm|13>EI=n)I>wNth{2q<I-i|uHKJMJC;j6VA)=T#@uW9X~x7Y9Ez!RkN
zwd!ZS23KuF_O%*Zx3_yFT(#F@QdYl&tM*dx?HV23-c+7L%A?EwhK8@(TeajveBIA0
z-4d?*!}~S-4f2?~C*(2x#=RO`A9pyHSDW6i{R)V^>er;B#|g^cQXbtOx@B1_JQH}_
zto734ocl}^@mC*rbiTUZ(Dk_`4t+iT(e<YM2IbM|v}$&x*K120_*M<Bx1*{G?MI*g
zCddo4A00kS!l`G~rUWUtmCndGbaa2E)45Wkuh%zS!l?(npJr-sJw8!%h#%!2G<=<Y
zy@az~I$VOqx7~Gkrbee)Az?pFgX{L7*H_0c*YNdzRI9;td+=*;z1`1haGj1GC+Ku^
zJJ;*gi28G*-gNqVO|XFLbl%tCI^RAGuJ@M&jlRw|Ufd$dh+G1Ce3&3F&^~pzvcq%P
zr;e}Nrw-TK>wYB!_R6lTcB13AY52N5==E)sI958Us1^Q*ykNEeP7SWx|IakIZvO{0
zxGvA@ap3y+tK)Cg@O685TZ8NN(4)b>BagY$?Ni5}rrC)OkLN%2I7-KVL!<LujqfDQ
zAL{t);=mu#;JO~VHTd^5`glK7Y-}$b|7UUF)zYAeze%H0tHE`@?UOjf*Y&U4iC(Yy
zz~g3>M~{nizREtW^t((lG2`QHap>#q^|z$IM3Yk=FMJwY?=Q;#v%Y$N(d}Gs$EP$p
zI=n9qe58cq8x}^3JmxN4gMUkdXKL_oYw&Chu4E%<ng)MB9&@MjZPnm9-_064Qyx>!
z2Q~O$_-@hgl|N)I4g3#pK6ymA><R*+$`U>#jE%SdHGJGc32(zBQQ{|sp@yO2G{SLf
zF1%G}_`}0cJTIuhFVf)eYw(LT_?5E1lRj=ChPQeRJ|+ys`nd)ltHITMQPLTw!Mim4
z$Xz+Zcte9<rs1bbC6Z2t2KQ<32^w6@7l=PmgLiBAU)12g*Wg!Z@C50XNN2JJpQXX4
zXz+y^{7V|#ufea<;QKUqt_JVZ;4?J%ENL{9Ctrgv)Zhgge4Pd_(%>&>@M|>q>l%Ev
z26qoNPso?gPO7a!gBL3x_S-dhsRn;tgO_RWVbbVH|2hpGoo?jD8x}WD&-KoqS5mrg
zp|`kXp7+M$uaqrbSX^3`=k+dKojYx5U46~!^~edcVrF$sb7ft9?sV^U^B0s9&-Z$7
z^ycPHFKcRQXezH<SzTY#G;eL$%%+;ghNfnu=(usQH+NbMuX?K*s%y#?-cWUyv7%;0
zRpWa5%rtRD$*-<iwWeks2*wBnY4~c7cXe}9P34L*pcGZs*EdvE;&q~Vi)VPt%F1$!
zyxz*{YVYlpRm;6qm5r5Eb<OLM;0C!xE}-^#jg`%{xih_9zFZV}o5-XSSMuC^Q+MFo
zTyqEBa5^9U%sXmU)-=^s=>?`X*Q{%vdST*DFFe<)PX!GkW$9{2W6jqR#~S{+CdjX<
zuc>VMTX8FFY-kj%eLiKwFjm)AHX#wxoi&xP4JP@?g^3{{Pfg|O8UY==(9@@d$ss?I
z7w?PJS610u?YUcrHZA3<ThVB>={(vrTFKk6(tB4;Q-eZf6+RbX2hqjOA<k!RyRgK@
z=3299FS!4riRjQ)R<5X_u0C_&a%aFD)gWOMek-d!Esxy7*tZpJDC>EnkZCDS&;47P
zCH-TxS^nR$NLxunHmNvj;wTa03~aNP#Ub#w)br;g*C2ZO=fwH1c8F#ox6iys3`Qd&
zg`CbAU9r&XHPh+cURmv}Y-*}pkHmU+df|EQXs#_OSesig4V&~pM&<2@n2flo<M4X(
zN;m|gs=i@$4G$3NRC7P|j;4k+jUuL6(TJRH2)0%>oI9?uHFNrwJ8BTsVBACcK&Dqi
z9>MjEHQu_FOB)QtRuCL?SKhf|u<=6f^xG>}BaA^=yfi(piosxR6$V>xb5mtq^Xhq3
zWtM>rfU?{Iglel-*WIxax$Gdx%F23%jVoBExDM{qv6@-gNVS^e2N?u?I!+uMn`&0q
z-G!IXYnE27sc(i_>zcz>P=@M3Pa-<4UG80q7#o1f%BHH?nR(v&YP5Bsx3X##!;+Y6
zd}~*)M0UTG%}Z$oD;n0;$OfvZ^)79~DEIlcSLyU{E#}Q#Sw>}k4oy|mxMp>&8PHW3
zQ(;lfmA7NReudcUJ@0cel1L>{LDOy#Lfl@D{;_o4lGRPqVYYRvy;Y5kFyN&PO?Or{
zRfj)iFs}juTmIV0`ZYCWix%g5%ktQ>$`%)U@qe(*(^wyoVUT@^-OFOI72b+z-ilnv
zvtV(Nci|0-XL>(}=BgAa9`grXH%8p68|&+uy|=Gfioj{!!V911iJ&-lnlO~5O${rX
zQNz5yy#$)2e(wAiS?0R2Du5dwybfY!*41mnCMPEIxn3~^F8ga}+6A^E)#r_i6?ry(
z)Up9D<rYK&Vl{O=r{%`f#+EY^iGCW+gB&hmg@{_Luv9!=J=xAt3K^`=I1l@R%IdY1
zoTJz=Xb`Dkr_Nt}XI*nu?Nm70`Wmi4#2tkH8fG>1mEoD#;2E4JWW=Bw&gEMcV^p7B
zhjvr5&xzN$YdA>riLLqtHRE|?i0(o0OgL7CPuqjeEl$4Ii>05>u(i+4E*Jco@zJ92
z7lCXzUy!mnX+>C5U$=5O1H$GttIzGAF3bgDPBJK>pHJI}MOf3}oX;FCU{&X@U6Yo6
zz?uj<zMuPB&hpDXPw56Rvn^w~>>0?hjm+8NZ?5<&l5WosNw=qqzqyeF+<C~ojWQww
z_jK_$oRYhGY94ZO<D$sSJzf0G6@SH_86sErbn!P={1ty@<O%lTZ?5<&{>+#mz~XPN
z_-p<_hHnTf{^pv;1k4aAzo(mtzjLA0zuoXQHCLt^S4=T|$(;%q)FHBu&k%p7i@%>$
zK62jfIXEo(KB>9|)F>YYctXE<h>N&Q6t#U9H%AGRx0k}#JmI7019^Kb47?sUkk3`#
zXJKe9UxxC8dBPOUgKT-TY@saA`|rHf=$3fu{`8JCd;XoW+zS$4?X3JCMtM8_>pW(O
zw`D={=Pf=f|6#bvYghl<<o#Iney$`Vc&TIV6H(rd|H5JuD^sgKZ}nOEzlQeH??0QR
zaKB&P@P~Pbjq>~OQ}tK-ZWI>sOL+w{{@gF`>khNPRXK%s2;~LLg4bALVyNd~$v+uC
ztNgS(JN<2y_fyq<bCX&`es#{W<nK`cx%baC51!KWM_pL?H-e8H|FiPGs?wh#Z>|5j
zIPLG2jMRIL@yf4`)Be-0jg_CzA6Vs&*Z#9?+MmxUEBV!aUYz##v9YifO8uE<k@D(%
zZk+ZH%A3&#B_i7&uM)?|-<E2x|3~D*8QW!fwNrAd^KYX(VIBpL`_6LnV4XZCf1t+j
zzaozRxKcK}dY@X73F}XtXT|X!>GMpCTFw4|8pHotT(`5oX?XvZ+xhIT0hPBaKTDQ}
zdyU$x`WqI<{_*idvCWSv9ozojN2A*De?*q2-u2DOza8c6+RuNzSxPpeK{|Zi#cKbb
z#Ic_Q`LK?9FI~xC<^NF}`{|ba)q6nX&*y5a{Nwe%a-05Fi}H%U+Mj`(LVp(j`FnO2
zY^Tj#_^&Fb04Gsiz%1oY$c8&85h;HreuI_2!bbj0D6jad{jDl~u<(B!evR8Oa~J-r
z$|=B2C~qhKQ}P8EHO^E1iTDjxexHr}cc8rDul8?3KwJGw`PFk+N?uh?oxhIqcJg;i
z`A<kh%6~b2gO$JDM*bF*SNzrf*BGbl<Zq<2!8X#|h5xE@3h*k*+sVK0MiZl4B2xaz
z_zhP6bvE*U3*{AmwLb=ecJlkB{F026B2r!fevk5Y@~fAOeG-xKUy0vf<-gxX{%@na
zl3VTXL;zza|5H-_M#*38R5^9tgz|Rs`xclO`uKGfK!cTktBw2*puFO*_WzDJ&rbeK
z`7olwQ}SBRgD5Xxmj3^?lwa?^(=R~&M{VT4%|`z1cv#a;{z+1PmeDt>{NF=)JNZvY
z`K1_Q{NZzhgVleRjr_NwyyCC+A0f`Mlix4pzh4(#E3d#OP~J}d%!MX~Pa@L(3-KGQ
z{CjQWCk-XH+K-PTe}ZiIW>!wyR5=A26Gwi(jr@Gxa<K9rw2^-~$}9eAUxql>PXFuV
zy!m|buLtD?EsOmJrTlvT{qhCK|C){btv2!(#PR=6jR!Kek>)P^SJhhqrpNLBOTKDi
zluJameKCH6)&JWz@^40Y#b52`fuNoK4@&tZ87W1iyaLQcc{}}gO8I>fk@C;QZ?N*e
zZzKPMD6iyJ`(La0+0y<er2O|w{%WVnsq<G+UcfBnjYTF#xkRM=*Wou<`A^u$zXjzL
zf3+`+<Nuo(Y-{-DS){x=pApCZmrMC||Id(mu=1a^k-troN69}1db6{ibyEInUeq>K
zPJy^SAz&8$`=tC^B_j3DkZ!Q@yK~Kg!?f~^I9B}C{vp8Z<o~^VK|*{pS<>K6l~bVa
zD40e56H<P^tUu*nh~Hr4PqmRh%uDga{?C}_*~wo%0T;2|FZr8ivGV^B<?Zy}SYej%
z$%2%BF@A%UKhsA3@1nfYpV~LZk^i+Uld*dL!#s<WSLe&)$p5;H{5PS{VCBEkM*i=i
zypmh(n=Z1~|80{@3C}103X~VLEcP=^z8vN=$%y#p>o^{){Dn61H>13gTkTuG*Uo-E
z{G!P?{XF(_FUs4=zg5bw_g}_>R{1&3lf`tCUHEUp73SgLFvL7i;;4PR`Tty-`m_C2
zz1991#CfFUvgrSH$)7QszA5<?Y!AxY)jyNWu<7xK59g}9^2_n$UuYwL1IjD8)jl<j
z{O)WZV>_Sx7sZkP5gYldK+h`wq*12+Eb22nlE3o5LKyr}a;tNfY=3L{`GYL~IM+Ys
zho~CAqRIUdSzd?nSlNw&?_hbHOj7{4SLJtF;HtdZA3*%9j&;<J2g&~rvb?qaeX@KZ
z;zNCN>nAuqhVs;@#{wUDvk6e|nbChQ!%vl0_ScODvhrq0pR~Vj%+I*7j&}b4s)B+{
zeVeA8n8)VdnR$8QO76_*=0T<}d1Kl9Yn_gW_8i8~ZFTtwVjQ)3#DNFz4myl@x#+Tu
z;@_NcB_N-yOXQVh9%HxRM(%FsZnWqAZo_yk8~Nxnkh44F8vV&3<Rn9PPeuOZ-ymP$
z?#T62Tp#nvA><{?!1b=bY}{6dU$P_h)fC5=SHF&&y*ZAtudZ{re>cT3`qdKTYN~Q1
z{ccW*aWcb|@yQLyx8`*lCpQ`ypY$T%A#*tyj(MMK5}!!$Kjbh@JcOztFM7sq9RCJY
z+n!;J>z!kye{wr;C?noq-rsZY8y&%WQ#*RH#&lF>rFO*44fo$L7ZLrFvc-`!g}C`X
zoIy*r4`B)M{@CRlSSOG*W0Hl<Pyq`;mTiGJS3M?ju^NZ^H#LRafUU%DWCSgI^twFa
zyURKk8DbiIcaT*NZ{jhn_z$X2UD?oFGxfR~zxE~ZIJ10wA@V4)<<VW-1IMlZ>Z$n>
z(R>@nyJAg!Lvvjoo`GIdUAMNmPTbkIy1}qW7jnQ`$FW*QJ4@gO3$duW;~LNT({;rn
z9{#b}tYZqli*c^<s=X8`Yk9_5c0RR7I!a})Sb7lkR2HJ(v;n&@X`!{EQUEKME}t-K
zW2o}y8<R3+dF-OLKUo>ct5z`A*$A_a3nwJv!YHbdF-3tXx1Ii!Q7Ao8f7G2-f7bzK
z<qeSGk-#pVV52ygzQ>d|^VHQftXw^{;VO(e=NprXit-9goWYMtOOQZTZ60ypG5#46
zg<KBgVs-{jAs_KTi_yLqxtEVkM2=VFcZHwNVg6;HZ_jiZ`8_{H9%RoC7tLG!WK%t^
zr))^-aBrB`!91{E8Q8eZ=Scpk!!dlvPK+DH7(WK?E&*NSzI8d;RW49yg`b+<I>9j7
zNteHYyZ;_}K^-D5D03aArXqhKaPSSacI^AHCb)M~7V-TL5kH9WuoZa?gUIFVPC`CH
z$DFr#EUqDE^XUc5cli?4j(pyqEp0m<p;A+aA3=ww7bFCz$FD(;$ZeX_1wFA&N{`2I
zyffKY)d~IV9BQm8##miDO5{}B3fk>S4o^`s>cl+nC1YB5^tentrE<Kt!Aq(16b%~_
z!FSgf?Hf_n<=7G~3!6i6L(o_BNb3~x%GQl2Ev#cIp9yAO$Dr%r?4A@4a;E!dGbbbE
z59j&C7|*es?fMbhwKUSMc6RhGa=X@{JnGyYfE|T48i5e<V^fDcE>97jbt#~oh3VVa
zOc1i@IJ+Q&Zdahix@`}+m{Z&p_~ecR<Tf3GT(d)AQ;C6rLq_`&v;||Sk01|YtE91J
z-6_+3NZ*AV>ibC}h@7cE{GBI|gE%G#nRhrnMWKz3zy~cxk=JE3m4}LtzLK_mhuiVP
z9mgjc0a1?@PZ4sTui6B;SSAb`Zmg<AeQrrG3f$nQ>bME{tNqS{vs;lzSLygh)Pe1y
z@&b2(Z!OxS6F5RH*(RN6lP<K$Zy|G!)3d)7Y0Ea=YXmj|Rs<TN9CX?V`du3Rt8i`3
zt;pLBd9v@$SX`TC6kZJ2^KW?q@7!XXY=sSW-<7dAh`!@aH3~C{Uur!4?hvCQ?;_7L
z{-I{QT9b|T_4grvHS&kjruBL;2Xq$lk(0(T<j6g};5xLywP=env<YpdG=Mguep25l
zF`mu>&)<&lJOiDZIs@&slJ-l0G1sqIchZx&yEQ%1zr^Da@inG@G4stQLLN74A_+F(
zXg71rBX)-UF$Xd8t_NC-BO>3t^gRbQemQW!mC+ZxA|cR|=n9~X_wJOo0-f~tR2l8N
zP=>j~--V2)aZZ_gsysyxIz7)EhrGuSD<eO9lgF`n2d{OyjJ>o$X99An%eE`O)Kl0K
z3gw%+Q+~|clNN0u2wE)P<@#nJ&pTaa{#44ZY-<AIca?{G;O^@JsCU@!ro!*C{OJ}W
z5Ih9^PBhw?-(Jb<9!M-WF7sxGTIkOb0;i^6On~p6hyIfTAF~_%g}G-D{O`>)4$k&C
z{Ie$uxVMk_?TcXp85@iM`a}P~-E&bMKBC3+5f16|X*WUeCf`c<@SYaf49)=;_3N1^
z>wA$|U-*gsqzT0V_`{RO6L*e>E>C6;**u<o&W}EqF$Db#d(zW?19$)Lz}W@|Y|jZB
zbfN7N(Dp;b7!ztqJaP-_WX`voIc)zkkgFUz#`JpYWQ;pqEnnyheDCT&=L6TkER4My
zWxM;(?!S1?IC8)>ZlB=yzR}=L^DjaU>t&rS<NAUviF<-AZv2w)OWxyyogZkqRN!`_
zUw67L>w5)#^VlI*JMAKS%=dQ$;fG0!IeLlT<0{_oL!WmKPaWkR;`wT)>xZ*4ay_eF
zLVt7*%xB6CA!9*ZZDE(|>-$<q8TmQrR~N$P*x8WKS-P}~eJ!&BA7}U%k#9x{#wYL$
zqK{=PHpeQr>=S`Qjw5F_y3sGj?d!QBQTRYnZ}h2M&<pGFG2;fvg}Hb>;;PiK4&)lf
zc{$Dv>MIrJPIq#!#RVND;5P)np?k7jMqX&K>5E&TtKd~e|7M{pht$>fC|zYzS1q3X
z!LhNrDzWIQ5W2b?vRnxL2?M5%#z`IZyM_e%pd<3boLT4yaZ$w_=!m+~b+k7$Tj;3k
z$ys3?bwWSKN*%)X`=BF)hpFk%%_9j$-p_}i?tgKu@<HyNQN~v@h8wvq9A|`Ft1y06
z^xW;~KYop;pL6nEu=k#gIG<ylAH?--78?yAw(y{Q2(gC8jr|BS*2s5d7m%h0G?pYA
z@HuJ1zrHJd!NriNv&wN~7up$1DXH$!rYw&GpR`{5&rn51BE~!H+1B02QO$Pmg8i@@
zVeChNmT&e^)=lXs*OJ(NdO;cb;9T^@QuN6Z^i9TS|3~B`fA}v21z#IdSn%*rPXTRj
z!Wh&KdQ!REyQJP!j7NUF_O5G8&U;esu9n+Ozu58(5wG@?78iB@XX4D@4AYPN3w+y0
zj>3WiUxqJ6T|W9GW2Vx>IwbTWZH`+?5Aa8OYca-l^@s9Pp@%M~e-Y+6So?_9*RMb~
z8`p%+gdWVkegJSQ?*9gC27G7G<-qu6@_G+;K%J3S>j)zsb4c(|*E4pj>!BHDzkq-2
z4`vws*~5*!)XQ<`DcRw9CL6!!oMWf=Ofdps8i(X~gfd+zh#6*h_PbM9SJMXR^VBhA
znBy^?eks|g=mY#?_{2F&jFVloHN*z}iJ;MPX`vhPoyEBA$5_uY{lINaG1`CbnjOIP
zzMyLy^q3Akjuk#_&hmo7R`g~1l>pi%nCPE<e6-QuZ5RbA4hoL-&+eIF^p6JZNB+$d
z$Uv+@zHY=SLHK{zLJ@pkYDTFUlZ-=5k}3ITgLhxckO1o4?*#0a<Qs%uj+L4+vd>xV
zh4uj+1wEynq8{wgF3&y7Hk0;3cx?#wGupJDZ6Ae%J(PbG%1ah)r0gJKgC!_WJ2)ow
zu5>#KaOz6^?8et@jH4p<!1#(dZLf7)<#=mgy#2pDuG-CYD#Ta{J3uVLI^;`#`4M7`
zV;I{R*Rbxqu40uJ(Y|r#5~XqHQ@guB;}~N3Q}~e=<7U!c4gXim{)*3a1p#BssQNNu
z2s4JlT!OfyF(^6U0~rUMxp@d;hoOiaRNQFJBf3FHjm4DZc$*^-e83ra46=L#`MieN
zXFCxyw4x7iEL(>Ca_l+wXO7vv!;5|8m~A39<oNHvI6@gmOC6qKyjEq#YlM?$wCvYH
zzB2gIxq;9jZ9ewjSaz<HpT#_}&+A0pT+lt{)M(R?%YEc#*xG5AGv}0y*?TN)5cuA#
zz^<0r0gP9B&tN@$qilnNXanl+fa?+wi*=zLI$JL33!p6=#wM(-GZuR|D!%Xxh3^aP
zT-50rwXgGW*O6VY%ja4y?t31`U5Cc+qwO7N8DA)D%602Le7h~btL2tL#H1&SG4}4O
zLY&z01;G!tiP$frua5Cdl~cwu+rs=X|Hu*XA9?;1vAT@^GA4KsXLQVRBpDT5EsOe&
zFEGdaVxGGe_Z?qsp1+7OUW`K+6FA?7Y$D#r?Pd&L5qokQ{!!1mt_gIZPK?cXttW-?
z*);*iC#)l3r!X#cx)$xDOdj-Afv4GC<#5h-N9UkTFt*P{JC$N=$GDC@HgNZ^#JJ8f
zYTmK8<;wxCd$3-tj}J6=E;3dzw#jn)7d_sxSm=}dmA~kMPVv3cJgZz-6WC9=3>kyG
zCH*VwfqIL2PzV16c<YyqQC<Cs1+_y)7PKb13n&xybOzVlDy9X`Q<&$|HhQiw=k>G=
z`jK5|LzdYO`~yRw3&eXpXoKUZC*zw5nDg|Y4US{JB4RVt=fx8GJfr<FsY~ON!~#J}
zp8FvW?TIofoM2z#%o$jBcm;gATub_nBi<vu!>2+OS>oPLQtz=dArbclT9)+9!M&V6
z{y9|f4DhoNLkb;1R?J(3y*&>&%k9RV@(<koLf~WcsWUe_(Vtv$t<AAJ$?z1N#{A<I
zjDZHm7`NNg@5ed==K5khPJ6>#Bj`eVnQH`CbHf?|$73;%hd!+H`0ryL--<PY=y^Qj
zE3VCz!d6Nk3+?1(kd^B<EvC<pnya-K?d<Pdr#dcd&s>XSoN^!Z&N(~hZj4j9Azv%v
zl;hCpOvFO4gCewV>LZ9%kXBiY5sY^b|Fm-sjO$oG<QQ(w-KnE@mgN-&VW0Z?7yXO!
zxAe_=9LsemHNRzf{z9%qj2Y>Hv)*y2=XmJ)66kuUSZ|=Lod42?M~@rH7&lUE$BpOE
zCl&2h_>g0d8|@rN)cC<`><gKkH(Z1G4s*tgi#@B3;k*|3!ruUH;+x|PVz)e&8;da}
zbS>ruiKrLk!n4UjPwXE(E=PbkYEDU7oV$|VuJ@crNUz7aIqbhge*~SbmapyO`je6)
z=<?6rg+9T#7wM^S?OFI}tXr+>9C~ne5HX<-?YEKsfb9tW!N;ALPdZ`GsluMqP#*0m
z)`X9j8tr>S`GL@AV}I9^c|y+MMMi%o@OM3K>Wk$W|1oCIL_gr3{D0n(7f`f$&NXhf
zhic<W$a;Fgt!TSj(1u^fxVi-ER*7OAWjo>vmf4HB4t*Kx$@+C-E=^zN!#*sd%V>W#
z^ktN#jI&J{6Coqy<NW2f;ePq|fm7(09N$JG_InoNR;9Mq?Z^2k(N|s)J{9c%yTv+P
z5@H##?mc?9x(?Y=|0lLg>OFsK>A+Z}#TKv=t`Q?%$l=;B){4XN1%2ajwA&mRNB9s&
zV2+W~h5qoaD=jAw?u!qL7!E#0jN@G2M_cVbj`-nW_`>fe8~b;bIEyxaANR){xR-+V
zHs_pXY|J?YZHs-9d&V8A+?`G%z_P6<%Qe^In2T|2U|-S4-hsP|1Nxf$z}>$L;CXS}
zlW+=uKVhV2KjUV@ZSp{$7qY^}D%ARxyjQS&jFe*yWXFAqT-G}{cIWuh3$XSt?D3GW
zM=KA;Wu(t_PuAnJ;bAv+nd|xV>0>iJ{a7pC|1NmGi2ZwV4oIH{zx4D$)bC?wYVWbX
zgw9vbr$s%n&S)K{xTef8lyRv(hK3S7N4S<uUL2=le0$;xfgoawU1Cmvu}a!eC-m7$
ze}2^T=UK*mA_nE0fO@0cLCBqv;5m6*&IxLh;FmFXR&AtWtJ8o5$8tQwJfS7Bu8T))
zQhPvu<6n$`a|qU((Uuu?nT2Y-nY>l3rTajRbEp^MZ3kjIbG$a=x|hRoU8rRU#<`0F
zXYUw=zBC&CG8JRpn7}}3g6K<XtfRd~jdc&W0>My1%vw6@%pdwp(XlE=JI5J)%;NY$
zee^7kjB&;A)r?aS<BPtdY!-1r-~jwH$MRr`Ikp^tf8K;xMb(!vMAj&yg7(AvLX06=
zL9dH31o#&)hNyBBeL>RZm`J&Lu+|WK&uC{{?N;LvbS`}TM9tTuJ?QHh<FQ^W!?xiu
zWnP5x`w^RD%Gl&%$icOYk6c3oJy`eTy&!Xq$h;2{T9#iJZ28r!4+=cE=AV5AbJ`DJ
zi#_lKul%L>=sQl#UmUGFx}3&d#tdrQW-P;)Xfo<U9FF0v2XXavXM=GqbQ?8xLw7Gi
zCzM<14eL+)!6Q$v&v>b$H0d**$N2b;8Xu+p-+}%eh)INv%JqOwmoc*&dgXc*;-VbR
z)5~%Higqhv0P2i7ztx<}P;b_`Jnc)3-IUemG)A3X@HN<D1?+M$>~j&u@UJ3H8zRPV
zlfQXyrJ_Hy7kzMl`9LWDA21&4?fC(87Lx6`8{@cWL)oTkottZXg!4CW_W|K!bDr=7
zvJq3$cHINTM<<Ngw8QCm(CpJltw0|-aQBO%AB9TUheig@wsEdI3NnvIA4&zC1Q{>d
z#EMv72!>q3pU~GTe?q^7x)dFo<6pEn+;>c0Lf!f-F<&Kg#rXN>u$4#jxUVHT?judw
z3~3&lXs*M%UD0tL$GV<du?}yE`^e)mX&WE6Bp~kMI)<YiN=tnXdZ*r=gRO|ZDr2dG
zpvAuG$3EO1Xp6n)h^0i^kam^Xzv#>0>sHY&sBeyyX6#-89WRDm&?Xi_@4Sa?+68HZ
z4h=P9_nXI|9mb;_hPMBEM^fN;g8!lSwz&heiT}9S=<l8AY!4<Hdy-DP^XGRja_qU@
z;cS0@taA@z`#)s3_HaF{6*6#5sCJjp{?kK7dp`Qc?ki>nemXH<*iz>MckQViioX27
zkUh0n??c|10Lv&_o`Czrrxzdwy;;VfhlUFKZASbz`5(Wts2eeDQbK1FV~8%SK?Jsq
z7jg2tkU^|L0?s-anA17nrzYUp0?zG9P_EPU=&UZZX~tRHt25xIT;`nL0o+}s&LhOz
zdkFUcTz@w!_(0j7F05O0;auT^u6ULJ_r~^+$L=TB2ikDIv$F;BPuJHAmF-vJo@dzh
zB`;pDbs7b{j|o45{cVLk++*FOmiIMVZtWw@+RKXrpmVYZWAPm9-9uW%J-<x&Dc<vQ
zU{AbG*DV5H&>KjcsqTxCZml>s?+1{6HtunLp!Hdn$C?@1{QtEzKASiM{W=tK209Uk
zh`30`A%6G`=s~pSF4zWjLcd@nn0<-!W8xF;ft?=1u`|xSYvRy%a~~dyG1ta@uB|1o
zKedjj?mO!-2V+^<^63T9>zSY>=!Fg?gni}d1*3$Ie0*DBfHBvPJBk8<_Z&x_Y#HCz
zi@wUf`62o$`{rcyKlaTO^i{oYZb6^j{kU=D@lpron6z)B{b&E{%K^^SJVQKtIv<!V
zY+K!<*Zby+koEKe&4(OH5Pg&NR`&GK6vo}=nlYaRqHpLz|BjA@uwINd*(KT};>+14
zweY)kG0^$ehsi_v5L3=;#oF*kQ{d|kY3swd2R?B3c+7Dxfls^?{_Zk7w`8tUa9m-V
zvwf7jAGh$Hct&5K&AcaWx5lmRi63yK3t#l$PdowM@9k_!@8dWUoQN?sglB*-S64n_
z0^(ga#>Xtf-4=A>Ua)h>p3}e!I)~yI_tL-MpB-#*;Qp`^Kin@yJV8B&<C}@{SqrSc
ziP)yaTw5)N@6qEMF-AR$_@?Fev($a{;I;nQysr+Q8FgPh5BG}kI#`q)bDTPjd%r9%
z#w(Qdzz1=xV(g^GD&8Oe0P<58v?Ucg@E$qiK@~fkMl6GVk(!FNJH%Ax{Rz~8b=!&i
zz(_(<aoTO<ErSk~-e?oiy4x1k-6`<2>SY<9K?&={5Npo1dcl3cD7}=}>t%+f7d7|b
zTF5D>mz|8cQI>kyY1NC%DfN<W(Mx)iUKrz1FQaYrvJrampzkflvxuxK*L%6%(}lGp
zj(LPx*K>9ujyS#G8?f=)VC%P{FWiDy&|J^yx#If32UnF~oJsD@blmU>V}+A)d@%jZ
zMS-&|obO$X{sEtJ$R(cZv+K)&2hcA<*Vy*uz3-W8Qp#r8j%qCp{xs%Z0OvZwUPpWO
z`(;d}o&#}j7`7PC2CV8tES+%~#zEL_5YOUa92fR#jlo%-&vG1u9vFlBwYZA5%6W^j
zRqD@br>FjZ_TC0Qs_I%BKQjY5`4AC<g5pg;tO+0{kU-L6NhE0aP@~3{TG~lS0ttj9
zCQ+fq5(HZ`w2gw5f)%XxHbLp7Ep72$y~gT&Uj*A?r7i8XHK^?yz_xx+4T{bCJp1f5
zS#!<|9~SQY-{1c|zsxyjo>_aXwbx#I?ay;!)&@SaqsIL=IO~2GDloR@{s7WD*psPa
zPKB}e4Y2q1u=RDYALEW2AAg9xKKFry|K6APXR-52xBb<7jsC~1g_<_$zt2YsVQVR0
z+7;v1T-F0!Hp7nN7loJ;p<g(->KJxBzjz(xhdpUe=(1-U&UP_g+0$2|bt*C#G_iF`
z<_pMA+8oo~*m|`BZRDn)I}T*~_~VaIr@CRU9@MEWPn}{L5X8Eh-dmN4Sl0=g)?#nS
zIBP?hoBIi3UJqg(`Sfv|Yxhd^!H%0xvVQd--WfR<Q|q#09Mrab2Kr$PK1S?&G*W8n
zm(;B=;wAYUz*v_3W9q>@a{F;*yTi4YGRzHdpQ7w3S&cCm<&+?vaz3MnaRhzscMu2n
z+xqE^vA+e*c{btEfju3PW_#%Ky)Eze#qQNU(wA_r_D+cb)7ZB=3-Ngn{NilH+QFDd
zl2{us{U-KD=nwP*jP1<Wu{@3+AW!|{)o5&u-8WVao3QM-4#_pf4%C}-!_M~2q5qtM
z_QO2eR32=-A}3C{v%Dp32I>sUyc_$(qIG9l;6;vAxt1vN{#;AcZU1Y?_gYUr4m>iw
z^Z7vUk2}!EPQ@Pku>+lZXJeoJfvMlTuXD|gx6i`<`lLY8V+-$?y>Sp?Zp|I38y^b{
z+Q7M!WYEt9?bthJZp^wPd1EqYGXmkqDgwzHv=6bZIDB0xY>c=ZxfcF&O=sUUH#X}r
zWx$RXsq?GwtB#cy<v%|pVES}221L2r@!IFj_{(hz%v=a=9fXrUOiefr_Fb9dh`rj!
z?41Jsh~ou|!{5w-$NS7N(q7%YyJvL1_X)PccK`0mfLRwjY@V0nUJz$Xk0)+mkCB;o
zeH3=)vvr&7c&E!9@2q2a1z|Vt-Q`}9D`7wQ^cE+8Im5HvK4uSW-vQevE!(*<d0BX4
zR>0YvH9EYpBrx=`WIX?t6-e8Va&*RH<8oJQSdKo#ra=1p!0-F>rJF8@1X2zqqnsjv
z)b|hK`zF+@ncx5F1rgNE{aCwXS&u1PbHmJU{BzUO!DP_B`O8hg<o8qXTMG1Y1~_jq
z{VeD;(n&@?FXgeUyt_A$F5O9fY%F9x7Ic1uzRP3iA0FXvS@>QH|9|ya=iY^wuPIM$
z9m0BwHSHr)F&|Z=_L;C>1QSQs<KDp>vg`+td1gJQOj_Dl#uoccte*j2DuEweh4SHE
z-~Ro^eId?mxou-_<Q&iqLA^fL^r77O@&MLYV#gSt9)Y!b)bRsfcgIEC!|^w@hhsC!
zZryliNMCY#Q!DyEoaf~F8g;{%@5tnV!zRb=W4#u?k2MlJm{#wB<$BF##0JK9?nUh8
z`X2jQ*yCA_tJHJOsUB;6&)5sLCqK@Cu^h5+JsJHnu)pEJEO$;e)9wYPK4vd4?9cWp
z8Gbwy`;|-3Ua{ZIb|C9AXUM@&;S=}Z`2aKKhOWc$+XGH`@&nG`Nx6aCWYXpa(#Eha
zNt^Z{=7&Bv?8X}S5B-K?PqY<d5ZjwZD!&PM{bnWR^D8m;1{*WaJC%=+_V9H#qU>+L
zoSW(ohV-19+y6Tq<7N1lS>GzMI&;jzF-jL~M_tWcc<O$!t2<-ma;$Zkc|*)Qao+G5
z<L3#+(9fP4-TP9k4`V+6Rp>(dv%NMxguN~uQjS(n$J6INrj9H5T+9IMw;hOmw`ZUn
z)N>G_z`b+L+(dB8YRsbto%J_xEhHavKf%D}CbYR@SRXSnpPhv{LDv^n$of={gFQ#s
z|2c+wI@piOwUl1eLw@HTQjAHS&}}vMTktpR58u+7<ZQ>fLHo@iJo5x!yghV&TRQ4;
zJo*f@%@@w*8pMSrJ?A*n@tm@Qa*ZHPR^VELwS)90+_rcW=CRy8uooh>UtrQ?eAt)E
zxlj1_6Pehjh5p|5d7)ri_ezvM`1UOicJ|@<E$X))81}J_;r_vGeSHt~tSl_}05W^t
zKXVetTBO-)`!4JgGT+3wPRr{I%E8=j1!TPnUI#*$v&TGDQUG(e=M)~vz`8wjpUh`E
zSkA9vO(pE$nYW?f&EL*&CW#$rEB4`sqdqT%ACUi2$mu{m#eCVAgINCw7NYNG=lqN8
zb0!=^w!$v&VQ!!MxS1cO<wwTu<lTZb!E(e^+A9q*_&YG@>y{P$LSlXZ<;`^|dB&tS
zay5MFD)^S&f2iXB-5Bc~&jy8|#5O3$oG^7s8mRb8qb<=k#Iq&lIgBmQzt^_R2=?2O
z`J~NgJM>|rYxe=HXHXVxR*w2U8Rhp=l<!`YANNtwPXBJpTjuxvf3qhP^ON5;?XZ78
zEA7p7A;tx@Zhh+Zu&xXtcBP>GNJZb_Ec6|M(RH!-Ywhq2)Z>SZzWwv5>^H1NneTtr
zU2Er@r0Coo!n|S#^NJzNJ=%VssXN@)_t><~8F%d5IO~q^#=cO}AwGY!2=!$q_}8K?
zCLs>j;`_l%3y=8dATx#z-w$98b`1E9HT;qfacyG}_Sww<zZ&ohgI^84>o)XZ%%z=;
zx=H_(dW*Q+*^Rouxg+A5ekAI=;qz_xIlaTzT?6~gMjve!=DkAw^VG(+$(`?gmi=mL
zU({dsxwycV=g}5&%=I_aH9jXP`&em5?qg-Sv)!Z}Gckv&=UQR^GV0YoUj8KJj4+k}
zeUI&L%X1rA_x+}=6@6zyH})z2hwE(m!R{Jwv=1B_VCNCT{xyM>Xos-AyBR(~`?C$D
zEnDF~xSDkuen;7F!944ayx3+u$Kb`#*2G|8@Cl>O2;Of60<9ZHVLgY>xne)v5!o9;
z|2m8hWyy!nM6BbSGM<T$wcu9l0p#zjGhOgKt^>>7KeONBOw5sRp90eK^#wZ1F|MYM
zlUEq=f4KE+@4O}FquJLjhfi>RY9z+4Omh#~70T~^g#9*mJ(}xDE1}21S+1=}hx!zK
zc7y%8Xd8xlEq&7H8nEq;ie1>ZKZv}`-aVPa=NLne<0%LIXtTBz)d^`?CqyUOhIAbt
zoH_Xq(uSCIf9##nYyKFAbB&pCP1c;b*330$$lb~{XRc>)&6(?2Tyy4n7T1=TKl;j#
zAK_fMU2{g?ZZi5NTfY0r&c_~c_aAnhQMi?JSE4i5A|6@E{nlw)HlG>0-lc8k)=PKo
z{HR$w$9@XEZXV)V(s}3yoR9v%F!V9i-q)1_%{v9yuVg=o`{`<+FZz7$bC!rD2fl(m
zHGOB8JwZ>~xgEyrorpEhqaT%weH64Q`!*Hmx3TOGUx#(1<#^T`_kCDv<Jx8)o{OTr
zcVW$BGxGK{p1~szrsZCYEIez;wWeKY-#Z_f(z#{jKjo9YW98@b-$xsdHJL4(JL9-8
z0R2W{&60C+uR`~y`##?JH0E(kdA=4fxICkb=QUk_Lwx7&-7Ek1l)iVIr9D^E?{3cT
zKDYG>KA)6yZvXoB{qTE{(G7l-(bsooXW!Ls9*FgzT%s~wD=H{Shfjm&dq_)Nsq+zh
zeuF;Vg`vV9aF6Sp<`o^xyX4Ev1s>@u+ww1W7+XAV+v}P@a@&5?nFEiY9tHxt(Vk7l
zvyn?V2XG+WyicHj{b92%2OE>0e0q>(KlCFVZCkGTPXRnXM!Noez6I_+-<7|e(yjLS
zR$Sm<ukh#dvrraCkq7i~+lRr|Ge_>cU`8t6b(FO5Vbp#0BYEG2GTHIY9i5TT@I$Zl
z_LY@{(srNwVe#4;<UQ%bWiMr2;QS~H*q9Hey%fRT_>vW?Hyk{)><4@<Im!9^eZzC^
z-tb$*)XctRFZB#_ew6XoWiL@rj)OVp7an|WTO^crXxJ@IXF1~70r+WQ=#?omr#UZ9
zEOK6aKa{*B5=g^3(WWT}5N}5I^_4L#>+A5r!`m(>a_(&bf7T`PJq((MP~SN}D!x7i
zc@5+J4(Yc9Zjo4%k9}Co(=_bm-wpa6*ww@~w3FoH^)1?r{&fI;z_O)p9e{7O9_%ZF
zPi@!rXH)QkLmAjdg1y}LP6@T%_YQ119Q(jNK%e?(-(TOxTw7WXd=_O`(08eGr0C-1
z=vxQwy$N|{xl{i8(Bo<Boh(G(zXbbfGBH0{5{mSid_3jc!ZM<cJF&N-Z>6*JugC*=
zFzt#D`?mA99{AQ!)W4^1#`B}-&%BFg1b+oxxL4r7#l@XjN0#50hy97^fuV;g@cYyv
z?0tmZ??ShygCh=Q0_#9IcfP+IaUkhX=Kc3?NII+V2kD=4-dZw=b7GkH7@j`lJ@5@D
zIp-k11!=(ELwfdK*nb)p#J&JLmq@*2Umf?{@jLW-s~q`|F;5tE={?xA2lHx_%lWep
z7UnJ4Ve{65XA+sN1??(r*nMu-6^Aj-q%HgU26P_4@7OzrabD{cnMrtmiSi59of@`H
zs5|6A`@C}|p7|q&^u!n+J7Hty^%*l~>+VPI#eVen7tBGN{WSV>pNj5F7hmGO_=Ajx
zW?%frvG)9lPVzH*;}ORme#EYkR=UqdN<MNw==;&{kT=rmPq?+PAO+*n)U%xHH({RW
z+ptj*<^e9l+~&imBa9W{fp|U`>kRxY6aJmPEYKNlbqcs&Haq}vK9JHz`V7<;@>q>@
zSZiqiIr<+pDDyG+d>yZ$+EZJX|JS6!ZQX(NUzf0+fJaJhpp$%Nqt0xCuLbaYK^Az8
z!|!YI*8FZ}AhnHk9dij~*MR0}(3C?CF~*g#d3XQr0O~E$wDEbFLd1}9mRAMndO}HC
zE<qlIKjZ#E#DWRH#=jNGr`{s#74RMjKm1xCsf{#0hu*(H4DAD72WvCGs9l&(efmIG
z2;Lo#pM~EKhLU$PFG-nhUPNaH<vI(xEC)Sx848)?i}j!_u<5;bBmK-kc=t@)Cn0^<
zrk@I(#^Sd{d2Pslipl?G*k1BLUW`iz;rC3t+SSA8kUZMep$1qA?xmdg{ZW?xfDt3z
z`S!%~MV~=`gZqQBFfYK^$FTwCPYcdtS>ydEn8RtB9QekD^Dl6=JLRo696_InKE?Nu
z@Hh5TST>w*3FCRYp-$?(>}wu))+y+TxO)%TrlD;cgZGWKKZrKrJ;YSDZ9TzA?|bu{
z7Yjn+-5&=JrX%m3XVHei4{Q7S2H&%&CO<1Fxh(^J^e%M#_22upe}MktE6L7Vn^AtR
zoPoLyADn~qdE|-TBtCm%^Cu9SYeMe4QY)VANJm*^BHb|TMVo{xb;9pUpZ|}$*hVd)
zt!Lnqf6nR)!s*VCB<M61b)ynx&3V@H_rc>FJa2>Rp?3m5IEc@zoA$rG@TU9U-V{9l
zP#4Ov=gtV9AH1b|kh^|Yj<yb!@ZP@Q&_myb|Ff<qalRLFXrlw8ux}9eJy$vf)aSRs
z;ccY-DR}Ys4{mlkd+{6WhCP&MUxI17DL4G#w6&B=JubkS5%nm+UgUK6SIG#ctP^xu
zpy7Jbm?O*k+thcQA8gsu{Wjaxa8BC>(s!UO4-X8t4Snm5m$;t7G6{!J#%MQ6Lg9@U
ze#Yq>R^$|9K!3KY2k(sZPO88&{CECg$|02Jd!dvq%h9%uS&`nGvEm`LuXrvCYir|8
znWychuIE9IoruMhS9AVJ>WB9U#M6)EJ_fdAne7aQH?j<pFL63q_mZIRX4?-qQGHqO
z-bMa~Iz!veuZZmruq+NEUpJx*cz->vl;^-FFTg%%Q||DUzhNGpv0zTBGdWYwy$!}X
zF4iUVdws44o%A6whQplYxm#qv8q1&;?aCz3{0;J0?gwnS*P`5oHa#Qst8jJF#^o53
z1&Z=aoBuBA8`H8~t#SK{1(+8<^31oN>0mnP8@vMjF$OK$i9UKJ`UN|&H&yowYJ#Yj
ze?N0F<}#OZUk%ezuV>IN;QfB|L-?J0GVc$d{j<NXFzsdk?~+IU&VDk}?1enN_nU14
z`(DSIn?$-aou&fu{#f*Ed$uG0<{e3>PkjE7?@pp!`0V4AsMo*39)65fOdRS^?=a%p
zR!sT9PJABH<og8lWFEbr?<WmOa=!04@(h0T+31zg_l=qP1j^<(um`b|JbDnr_{@-u
zqqqkwjJ*K0D4&HWyRqn-O+`O`A;v}}XwRmhJwwM~a`I9>PkHW^F+-jF5b|6LThzc0
zrq*WW--EQPk#+{s%|!ZHh?Tp+vkf%hb;~!9*E-A#tzmnMdHF)rC0&l3qo;0$&-V&D
z!Dk5hFfDELOt5XkmEbA**RX$-;`Wd9*fapXq?hNQ%rlwO`u909z57g@=RH8MS-fXU
zxeo<%Xxp()^cHpAg!W<uu3@xsTwlO%WgL5<j<)|O=-kV?ir=DbK!)j8q~p2TG_?I`
zyV(~ZpRs{(8``KB7olIV9DIsEcXu${hW^jJktF9W`V#q~u5R%@$9l5QsXk0z>U}Hv
zIn_-;yz>>l*o!ul@6#BCd+N$}Zsb8n*co~Z+wuzPWSV;S7su|a;otnN*FHb%?K8T5
z8S2Dd#3Ov~8s8<zzASw)8P7#<j>*_DIv#H|<MA=@g>Lxjfr}mUt~Hj~fw4uMTz6T7
z^p9iQ!9FI&UK@(=Ssq9=@4(?Z#ooCXeQj0Vr&0&Xr(DD%_?WFr#L$*kpiFz<kJ5KQ
zOfc)PBas*BNAR6rtT!BA@_9JZuV-G+uYVXkkEOqP=fMfsFn6eHL-whtBlgaA9$0C%
zSFAJoLs#~DL<i=l2>#K1W>M#Xv3yp=X=6W?I<<mM;y3%c(L7&TgmGcomQ46ZAdt43
z@$W?P?#-|Jz7M<yPL~(vpFYHU`~C)>G4JO(!8{K|tjd%;e;Utod-A-~TW08Ytwfzm
zA1>wTmI=o&j4P{yLy<RUx7PU?)&<lfmeb$pXDj>TiW^g6^_ICf`aAtR34LOTxn=N$
zmI2Ooj-N2zZldn24--*-v@`X8=SKBTL6qCE^1!m%Y4gu?<Q266@{=Ao7jqS{WytbN
z3!J-~&kthX*B1IFuZ%k#9CKRVgdI@!?tAx6CjYv=$IJgZv=83==c)Yv?IiNQ!szI)
zS1Zi?uD{I0R+JHAE7WJ!9mE_nx6XR1=b-owFqwlYr%$2YaPQ-Z_`k$Qc{Yr3Z7SBS
zyTE5E)~(BthXCgA<#{mOjuhdyBIu=lGwly!5o3(t2cR#<jLDe8pXwwX+6;YX)mG$l
z42kjIi&?m`y%`DL&ve4OF($cpD%zV$jAy1g;X@;{S8oX7p1Ns0N1_d+uGEpbK8&l0
z-E6yXZ=dfqHWOX6{!X+V44@qh9J3wF!d#QIgPcboZ^kR(%X~cxJjn^P?MJ(Xy=`ss
z8};s+#&yCl=0=h*_neINt`w{nrgnZ93dXFn6u@q5-=#g``yH95Cqn7@tdpE0o&<k9
zAF*Zgv(Ae@j=1yYe2#&0a$J{LjegIOivtBhpN~FH8t8jp3Zl#8ti!xb{*jA|3Si?~
zXtSx<LsWt5xA8u-9>kCcY`#CuDGQ=5Y{q`c{dOLxFwM#1d{`#tv8D!wFQShyR=1vu
zIgbm0;XVWR#47L`^`pE@{6>s^K^=)veh2hO2cK@>oEsxe#yOayvGiRSPcVNR$C4Lq
z@nhJ5>B)!rVSe95UWuilexUwxA5nV&;+5>(z<U|me+?XyNA2(7%Ge^hi9S213*H$w
z;KHlE;Goal1N}J0<$Mg|F|qVec+oScyGbd|_1s^|_GUHag~lwZ%@1Qd?_fN?Ips^8
zyMWCCHZv)ujegI)dxiLI|0B~nX+Jy%*2})7w87oMZ*1s+jpaMz?tWk_2m0~1v0s(>
z!`M8RdmxN%(5Vpip^kV#I`+7vkLh0d(<%E`K09SE#`-;%79NrOb8UvtWV0Q?0Q{V2
zn~Au>If=V5CoxmaN$`1$1DKOw{FsXO1hvvfP#;Hf|8<~nX?h@S5ynSl;B`Is$dgWV
z?}6Ut9(C|x)Y(7c_iqM!ClALva-@7@{Kvf9iT;|zaprL;-Z9AU<jwDazSwctVepgm
zx;@yBx!=Rr%|^YNh59uU^=t;(#1gdQ?%FJE$~pV+$bH;1wGeAGF)<T!*1bCiV&ATP
z-zoY`X&e*YiMa}`pZE>^B@7*<ZzXx-ywJ=K`Ua21UN@FM%YFNTFLh#q=|`O7W!bZi
zi@grRUaYU2x7m++P=ouDqi0UiV_NoesRQkScN%Ut`q**lKKvGdUysB(P`vT=Pw+d_
zIS5S7nNI46FopsnoH3V;`2^mp&6spX=Lgug`u>72?3M)kB_l4S;5jSIv7>Lyx<@<n
zoeVlIab1gX>D_7laVE?5^SYm9KRIM#P4~s<@BISpSzn;@-ACL$-{EOR1sJ=SaY}at
z?`3+VumE#kw=j<5os(N6KP&_JjdRT0<AS`nZQyG~ou7hk>7nxv1t&hR;ZBUlnNN%>
z$F$-(kiOusLq&N16Zei&)=tJA=tUYMAMcuEUyE|hZ_ty!8F}`%iFg<2Cfu(;+E;Mx
z!WI8-Cyn<RSVQ7(KE6XNU-`}Q<(xX_)hN>&k7QlR8@Dj7yQL6*y6FPcaa;`#)b}nM
zlUi}TJK4GZ1K5S*uX_-84lQ)!4*jmXp}3QE>;Pi=Ct$0rKw-gDtm_npzPTZs<Xq1_
z71tT=M!IBG|M$OCWYYB@4&*9dEke3Y!3z)FIbq|5dDh;DC3(xSCT05T*1jzBsGX6A
z0Ok^@JM+PK#(2t@axUKUH5mGZaXmM0_024&16X6)2%jZQ1?<iDO>xeU<;b`#w4BFc
zS?d@;-l!XR{$LjTcqaUL2I7Fb_xA(t{SEc+({O^Q4fym;bN3z|!CFdh<P4-c6aF7Y
zyBxTe&q(KOz3Z2&;r~MyJoWa_qTj#$w|{%*ZE2g${4mGd@y3eNSO@T4?q^+}XCL->
z<xX4dPr1@OOGo>K3!QtzMLX9f;s2my-7$1y_^BDY!hxh+VRK(%uIC1vU3!k0?GnqB
zalP}yzQG3<_RlqQ9$B|LBSY&qFg`PX(yt!r+7NRUC9uWSu%WxJ^vGC_Vf*(^U*w$c
z1h8q?wIAL&t8F*U-TThD_a5-(T)c@R(J^+&jU8A6^V*Jk9S>aW_EWg-wER=pFLid;
z6*8AWpM8GR&I@KDmScW*A>(z;Po0ADWcM9T>?gBtEdAkb<mWKj)=iiTyA$<=?}Xok
zwX_)+o5X$Z7WVG-U_C&dHIew9jJPus^RT);+=TIxnFoQtPvW~cE_Mpy&V#J%n!>tN
zF8fN9y#v%Q#@5r(X7$^de!#t8&m&(+&%l>fI9na8*<mm1k*-kW*T=TM`^<qE>!o5|
zD%^ENN+<e>*h7}YSOCAxLVvOZ@9@tGv~5W4!hTKIzvt2*-Xq}lsaOVP-0mp@+FZsU
zw7qFl5u@YTeH3EXf3@A&j`Ce;HJFnt$9x~{*nNz0i0}9QviK<Wrmbo7|7Y*x#hEzv
zUdiXK24Nr4*@#Dj5u49J-y~#WbNQbFmos)H;dzr}>`P>v;k+`RyQ9yiw>wMIN24E-
z;e5DdP_Q>S&0Xh<`+Ni9HDggGo+Hrv1Pc)-(0-cd@#OgiK9iM<XIvwfVXYW31%3MV
zMTiaTW3EA4x)|%MYm&}tYegHp6WBDwb^2fbUc)J!eQ4{t?DJjaXy^Eh7W)}|ri0I8
zOg3$uy9cgwnmhxW_<1ebB8hwM&-`L1pTAjtpR=^{W7sD$%K0$qj`I7Kj|p|oBu_kh
zfjxC;nRxz!@6xNe(%p|n{a9!A!w$8mFSJFs+BesY{x$6&HZaemV@=!pe8(*C?m(W+
zI0aXZIZAM4d%YT0KKHQ&*P2m*g4(N`Cl-DzP*8%gLHdVyo*ZK<j%V2Ja~#@%eXAJ9
zJc0ELQ-7)Bfk&=7rO%*YzUi@AJcCyAu}~*%M_b(kpLz`QOp!p!p=VIO;X4ZN!+0KT
z;`Q)Bypttz9mW>dVz26e=w8)$W!r7{2C{4!=UJ{SU(RW<9B7M$u*FkogTwHlFns7h
z==jg<gj-!7sX-ajhP2Cm_&vv(oNL)5ef}#(7mc1ax_I=*Mo$e7Mm>23|F>l%#%lk8
z`4yC}gE;}W4dHW8LpqOc<oqVy?Sp*1wl>M^^V{DR?nHZxcg!Sr9y+7-zW)<(j=TXK
zIi}3o@4ml+@2%i|KfbR*zrTX-u6TH*|J@ZGp}>oUe1C=A&$l`BGM;h#T(7i`x<B#^
zeBtnQWw7@R(2so(^<2(0z6)n4%Huqg%lU{6!|+VzK>OUC+xK8R;J&`@iv#z*wi5bc
z9L3m>F`#g3AOrK!$Vc~?fvvP*a9QEn^rN9$Hla^}zUYw-$mae{*)PTM8}IpU=TF&p
zkE}+WA>X@EXV~xBjQxwOJCwuy=E9r(An9Z6H+h-^oj(oTKZU&Agf`!OcMkR7yM>RW
z_}?u&9DPmZhkI7Cu#aIX_9~3w-mF02(4D9|i?Fsy>;>#w8sjAIuEm}u%&on6H~J}c
z7Zts<9D1$eeu0aeA!9K|z8vf0^U!9m4<@%IWA9N)C~5c1KoaJ`QVvyOt&-2@F)x|e
zm(_#4ST`Xya*qn?WmzWH+c6(<D7<oYbe~fX<erab{MdIIj%P<Qm$++@+-J&oa2xnh
z7T2RVzQq_E^9F%7jC<0~H+!Gl_px&w2ZOoo-oDgQuCLj(`vchHdmG9q6M5nOcIx^3
zd22VU#+o4C$zBt5xbHP>31nmjhGFf%DUkIyz61CO<}CC(fNAsh7kJ*e2tQB4-lCn{
zlLp)4ozBLWSO(Z{a9<W=bN-Sx=bp{<K=9DFVVg0?OIr~8Vz4)cwtN=-AKG#%bj*S+
z55Sh6f-Sk8kqP^UVarXy@S)Xr`fWMH+KOrAJ+SAQHp+eWr3U^7Kb_2e=<kAQZOk{*
zv>@O7PM_7b6&`%{=>n{&(cfIVy8L=z*Oph^efgYch=gM8_WlC?PlW&IVBBzh)qSTJ
z?`6Fq`hQHGb<AFUJ|D?FHQcW+`*A8!zO8Kk&?jDvXIM%CXalat902MD=K;C4BW)q`
zRC|W=1mAO4g7-rv;W@)B{LhgwcMQ5Q0@~G}%~H=9&Zw=;cgK}(Ox=&Uho0X!o%chg
z-h0S#s{G#`zRMExJq2v9k`SB2h|Tb;f*Q!(sp_s9kKF$g!8Mnd^_FKDkA`<1<$JkM
zpBXa`Rt8NhJ%o4unAkZDvGXg=)|n3@7JWTn-ud(T12%SU3T-XHm@^5_SaHu%=SsZq
z=kiINon!MllThdRKCbRF&)8avdG8FT>xvAF1Nc0a#FZlKM?8x6aees3&vfEFVWw@u
z9@p4+abax3a*h8!E_aT}0q+3Xqmh_X3S%wkO0-cY@;<H~K5O5{b>>wk^gb@cs}p`7
z7s}YYk87uWA6FRr^1bil>cRejq>=Ie4^IYsgnbLFWt7oZ^*gy%d)~=a;&~@mSpDB2
zrsaqKvrXQK%lGNguQQ$gxd8o6J=!yUnbS#Imc!p`5V!Db;1PKzF6)x_9i^-<*rSU6
zEdTG5`@eTyHJJO3YFCebzMH|f!}5*y{?m6q9YFi&zGIc~i@Z6XM?UFz&*ZDH3;WOM
ze8(i}V29mD5=MRaG4_vi+5ICsF<*P@oo;+^`M7Iv_&+Cx*K)iAlJejEG~<N({#D92
z*8e`!@17b1U*r6=%r#El=dQ`qw)`Jw_}|%0!!c&vdESZ*S)m6uVBc#e`5$W?{9)wB
z%$cI?Cha-M6Tjod1ZJKJeKWK*{d;*3j|v{Z|5$^pA(WLKa`$@_g}$+26l9V|hl&aP
zW5@XaPfTK^Yl9&6#>V*{aH#8_Mct=OYp|z^eUzkeg`FdiZ?-k7(cW)DJHz(oJdD-Z
zCb7*aa{`C3cQ)F-j6*xm|Leg2jnW3XIc#S_fkPeWf2M>|+Lq)0^G?G(=R<yqbeszb
zqwgU5Ir2D<ftWuEHcAPchdx5up?UC)=h2q1kAOWQ(RS@M%&(3?dv*}*SvvX>nd~d0
zEn^=cb46@hHXQu|@-*!=?9TT3<IsOBux}{;q7Tx?`rm)fcORUOJymYmJ&iFvpEo)5
z-NMe9(3R!Z6Y8&beEuScd>fwtjyd}1o}4_$8gBX-!;K%j4_QAp{frABgZ~f4Z3CB?
zeuldbI}`h?zkqsGgFZ${=)AT~cRFv)gFhXBPVC3L5WJx6?!fuGr>^M7+2-DJ@Qe2y
zx)Sj-klc0veV#Q%&b@!eKHu`YmTz6O!nt=V=v(iax^)fixgQqqRXDU6eDOcb@~2{t
zc{27hJq(=vmYuMDEqwBB_HD4=3A&iR4cew7^c9K!D^RYqhxdQZ9c`F~x_Bk_VteM5
z;KwPg7!!;x?5x3jF!zky2_3@OMV+g$e#!aP9_U;*)VY2W+SzI7tIP-_nSB`D@QFIi
zF%k~}U(P)o@T2A2JBoHFjAvj{0`A^nz88jl9qtLP!=B(nh-Zti4|zGTLX067gYIdp
zf0QG?7enSw(CIze$nW-4&<GFiE8fKQ66E&{@LCf{Y1;%|)ak2=7t05+Y<n`W2<RV%
zp4`8DDR8s*80jL^0ea5{4SBLGI6giEI_g&h8E6O7-oQTWG5CK=wb1RJKzKLi?4vXp
z;Cl!<)(H=MKY;zB=YobhGp5bTyXSXWCd*pO41)F`WZVr}_8XI0o#=jQj_EjN&H^4r
zyOE6Fl2YCIKkCT+-(SUE^EV)KP2enJ3-bRO^m)bRiDORY0c%s+IS#)&kg_`kytu!b
zYk2RRo!%R1MJ#~skwW|*MwDS>G}hqLxo1AumW6)ASj>f|U>-cYBGQ|Jx$r}n3r`LN
z+h$(&(+%(o%u%OooQXMVxzEBqF^rvey>n(!FXLdu3A`1?zTqtJ{PXB9|8h)5QRm_#
zKX@B4xqV#0^3JcO{Pu0spZ090uybom@7rT9`BLW!$oM(@aU}YS+zXmrc-F@5K-U$E
z0?F*(wm*Y%JO}&KoFMlJrL={D3mzH={~F~icxW{4lbz(Y1%U+*p-<TUN2I&+qG8vz
z1qQVh<9aDRXMk^L#IS2ii~m@EW$~Zt@4|HzuJen#>nn@**LUN(AJ;2KY`ZpN#O7<A
zRj*!KIpUwMT{Yr6*H*52{aR<oTc5AMC)Jt%P!>M-K(7+$doXGBFBhS{B)|Qgw-;Xh
zv$x00edp~(cbv5`d|5K)@-csZ$ypn-P%gCZ!fPM;<)1;H{L)X}&dM(AJPT<K{_NLp
zhc8>+xfp3@-uLd?mm&RMU^DJ_u7}OO23suzzdvtT^UI%|yXEb%fz;i9?)}}{S+Lh-
zSx4Uf9_$By*tKZu?zPt}-L-bj^)IY_4E70MHVE&DN#&lZ-D6Ou$t+WpUoy({Aj&ih
z{#noub0b(|aCLQXl`<RyeKV0R%ydXI>xw%%dywwhoG*3OLiY7V%R27{zl#T4*?SqD
zBd$f>l8~>IU`pEo<mr-Nu&wo}Yj({*p3ZX4+VykTs4#1J=cAx~%t>i`>#U@WS7NWo
zm9Kx{zOzuK?N1i(S`%>EzK1d!{H5^5Kf%7;fq`u=AP<;sYkM|uMq5MR>^9nc(f4<+
zUGx1H*5d6+Yb(p1UAqW$YmlxU>DvOKwl_k--8sRt+cpEcEO=JiV8rH}@RvH*1One5
zy{52p@R#?j{rU8yjhA4)d@J(uu@TGBzX-K`-8s8$>-|4ly9+WV4k+$Dr=x4_X8dpA
znSnFgF8gHCM#o9nb<UTPHZBUB+jgCEM%$f8GZy*%1@zj3Jk0~I!NGxTSVL&r78u<2
z+V_94ws_l5*ZvjhXWq1H?ch)CSzGT6YHI`S&mm)`Gq7zD=-xydwF2vBvjb=Est*j>
zwFWl&IX*L=n!Rh$Q`hdovl_b=0e>9!oC$mpKCnH0pNZdR?V52(c;mw9;f-#cWICyz
zcvleaGe9rp8X4@o^(^9@t?y4nedC$Pjv1-&W9uJ?L#WsE3wJ&0cEpcv_^tz=Er+jW
zz)$C4|8&XGqL*f1Kg<~PVKQs54uyTCB_px79{#!u{yHO!=TzXY;X9m-W8kmkX?za8
z=KvGE+<w!5PCoAx{hzs5pOd|@Tp!{53g-<D^u6*+&iAnY%sy1tpcPY|zY?+XPG@V^
zodJA;Tf6YSPI;fn&O0MJ@En(!yTQEg81@_ZobYD0rC2XuzxwV`vGblmv=@BGVKU+g
z*Mv$wQ`3v*K+GJkJR|%r_MhH^`55w`P8`d=f;nIED@QxU=Y=zHMgQ8&`yIryp&Xm`
z{KkF0WHZ|K?n*vC?DkR3+#dLFd@6H?S$CAbgnGMW^-Q;a;-6!3`=k87TYSz;xBqx%
z9b?s$&c9W1&d+^s0sn`pey`zb^o#ZXc;g<645!Qdk2gNE&*%03Rtdf<-E~zNGn%mr
z=FPZgfMb8!bOmhDF%8f00zYh@w-Ne|*PItO<2TZA{;cO&<a?UCFN9-d;vFkN1G@eA
zjo*8o#oli7PUgA!JI$Ezv-unoa&Jrx`)`-KYd$A4ChW$Xvny+Ez8MqZxk&Rp^x1rO
zOgPtkr;K=GLZ`B>p>k1VL3K+@?c(apX|u1JHY;+&^rG2iGp?DQl`+4fwywI$sjR4P
zsIRT8sB<bC8kd?=WIldzDx0b+TB;*ewN2HPEe%bz)y-aLsnb$ZozdJ_U0FN7wz?{#
zqNSy&cHXTm)ftTyEj1an%^9`zw^h{DLP#vHrIF^Pi|cCZ7s(Gb6-`wU4McyxwW+DP
zz9mA2&Uh$WSC`S!kbyi^-d-hHsJ`XaTF3#NL(L=2wO^=qqAVko4Y%T#+U7|0;>MPx
zPF+QFOXT*ZTI7v(aT=?e7S}d6^MA=ZP_rtkTT}JohTE!v@e+Y#+}2khMN>5;xK?Uz
ztf;JZTEIGLsim&AW!IDz&$t1P*_AqF)9s1C<y93e6_=xED(Wt8S=`71sBdV=sHm*0
zZf<rhH|mn+QI4@8?`TLvks)QV)VaO7Vo}}FNPpou<HwuKH!p35G8xrPO$|*S&$y&H
zE|~FI^8MVgeiM?$hUVHOk>-{P*w#1<&0kgBLZj7J_ZN9{#{7n+j97m#g;rai;e0&9
znd@8*-#w{=3C<W84u%JW1L08kOw8Gu1LFX5AXb?JeN}VFcf_Qa@2J-?-_iGs`HuY@
z?om`<)zna1m64f~otHNudqV!WjCmE!aO{TqjHcZD$&+&@S7l{X)>YIm$hfV#i7u0o
zGkJXW_z4-AH7zZT%^$z~@(P#7_yr9O3+k$y8*Xi?tR7$4u=w(phK9Pznu^-`%j@cH
zTYOn#Q^P{ktBk6G`S}I&bE|SDO`0^ZDla={LUmqcc0q1I-u#L4CT3SxR!^*&FmciZ
zbj;9SG)LeIH#mW1{}i||HQmVsg1)~wR`FassBm`bMHy=cJaopl!pXtesp*BY2RSeO
z;rGQUq%Ag-4vNFjW|WXNxXw@qi&N7xN<h5#55FgEqou8iM+?S6n~mQew6p_g?BYSC
zrKuNXlkffEhmyaQnjGAhnqFE;*1w`A?n{~W*fg!Y#_GL9shwP=zLbMBYzuS*3%+<z
zYhX_5MWsgA8Q%y$ki0(in}aqCerU+I(vpLlQ`1`m#VN_bJ-nG?6!`UT_WkyE)FL@p
z5(jm4tFtn)-TZ70L^A{#(JTRWS(;4IW{=u*&*2`rm8-I7Nlh=8qA=yK$I?DX#|AC3
zQSQyg#vu=;J#^l;h9!quLP)Q2@SiVBnGUlR;7PyCIxUmsRBUN&nR?3!c8@70hiR7B
zG^<_y-Za6vo<zBzdpuUBM!)&mQ_~x@^<2BZ{t?nmfxHp6QkU@x|10yj#DlIwgw_Y3
zES{!@Bf<}i3C#<_=Gyd|ksRp@p>JWdEK(mD^sT|kK@?!2)%Z8GeLhIn*>pSIbmfrS
zpAN3*rbJ%Lqe6|ZQ0F~1Z8q~<Jg6%aoA^ODap-ZVjNh!zuF6K|!2>ANaY}hA9^}?#
zx8BdOwUe??eN0XL!|y>xAI18%IZni1@ce~2PSjs$lMb8a4W@L<B92XV=z=gd83*#$
zW94O|{-`*@2$jt`#4zHJKFu};R=;D?(=UrHz4hfd<s2-JDQ2W$x@9(9sv8et(%FIv
zcK0VVrBsM?+ikkRu3vTs{jo}1vo)BSj^D*Me`|P*29I9LgL=T8gNsuy8vIc3TLY?6
z(+3w1a!k1v;-?JTK(@O&?(xYINoDXT{3?>HOPPFDSssU79@|3w7570K_m-um12&1>
zl+??_FkG!qop62MYvoyAiIc9&7bh5#Qf;H%fqU3wTTt}WS_X}lMoFeAj7`%ot3P8l
zA{lpdSVvoI8qBFtPIrPjx|e0=t)r|9+im(9YtNvr<5I&%qdc|+Z4GyA%6j^yO?$k0
zN;xCKIN`AE6}YKDBo2DiC&uJ)j!kRY5!zCxeIQx1#1vM)mcOx1LmREP>0fa3*q$Ig
zy$-)wue0f?`#zg~hns$LAV$88f~$}kzu45KfC`Z|EeR(anKp(d^!YcCzRU0P^ou!`
zhtGGdU-Y+Bu3s?C8k^=(3NIey^CdK-F}_p+vM!sZ)b*v!fw{+Q@N?l)ppjbo+uyk@
zz8jBHG1%wf(>dBb>DT(#uG*%47u$5(m{{u_O}8qlxujzmFSF_9x@FWIr$2NURe*gh
zWF0@dY8%Nc<0ozU?XKMJcx4=HWy+W$c9^#JA4r>vz9x?}@el1=;@QiLZ^YC;=DE?P
z-9rY&gZ9Mt>)?Y7rlPfVYlr2%&8FYS_|5kH*yUX~knMb&@*a%j_#cYqc$4<W(TdOD
zRNf)>y8MslPixSD+{^+B4K{VjCn>o!uEQmxPQ`UZ#{G3x2OD=vB@Ev${uFW`%=Rg*
zL$OR>u<2}EOwez7+1GE%MB4CKIN?~u6Z#jbkIlxrR65zD&9$^$acEI+QQC3%z1-5i
zscG%lC^`6orN-b01DI^kv|IWeE`514?>26%f%a}a=#LxE*))z@k9=wN#!1s_(~L`y
zX0;~`eRmu-J@M$^N%a|$QI>9}0giy4Ve}qlFZYE=QfJfKyhZyQ$&LMV$!K(=i8M2$
zCy#BGN9zE5LH$WQP79U5H}QLatfR$>k?gSLan#n|_%YKCk#-<rcEv<YV|dzQ3KnK~
z<hwR(_v>OujA$eAV^k3`F!9f(uafjSj&RIrI{G2Dk?qkCw$Ckh*54;>`VmG8=!5GX
zi!~mbXMQ}MOh1^6aeUPDr8fN(+aAS_Z=n{pL*4+#r0q7n<S852qZYG%v&YvjL!|&n
z`<hV6eC)Gn_Te6W(jLE$6?_z?^>(q09fx7Djz^1YN8i}*n|AD1$VeoCdf#tN;S?g>
z9Gl+yhCjVbCxiyXaxk+9?)=MxmWK&zs=hHs?y$f4>b%6rV1KQbHkY=1)24gF&DXY&
z33R~+?bJ>S`{9gr(&mgtn$g&7$D@>|m@y%mWjhRHteb7==DKvAanmwA%yP#+mfptP
ze)?!05P9v;O!80&-rH?DJ1=ysxtg8vCS%x+_F5izmX>*HjUNM|6D1|^SI|VOaJ1h<
zH!H>>IFB%S;b8g9vDkxdoEp4#Kyt7g$=OtP1?<gU_a?Xw-;pLCpLUy$FKID)#l!>~
z5i;O1t<i{Je2y|-h)t{dQ*Psdi5uxexj_VJC}tEs7u)+waQ&FQAA{>ydw&J4pS1U1
z#C4gyf7o8Xi!0j&^4o&XWA=V4uHUow+j0Goz5fZWtk0zXSA71>-am!wzuWsRT%WP`
z&*AzX_I|g$?!om~N629iial=2;dejoqU`j<9+wz;KTfKUV+T_z$!n}+ad4s`JfP}5
zzG~?GxJz$4Xe!YRL+{63dg%!CCm3Yt{kThS8;gE&=cUW}#gDu65_I|#++*ndxJz#x
zvY*_!&d~dDmma%WJjYpv-jBQVeC#*&s5Rx~$4M1(unXIB3^Vk8oMa*ALJzg${My*l
zkGu32`RKo5=>51$k6k#PW16A&<1RgGYU~j<^nRRFA&0d&_V}5xrynO($hkC@7~fVI
zdOz;cGeX23R~mXhPO6ZZU5ll6S8&*R_>T}4=e$RyDK9@xx{&EX$EFx!=#7zLe=zhD
zeApgC>c>fle^2G3Ut#F|xJy6DM}LK(_v0=-TY%UjXz2YosY1@jV~O$Y31fdh?$R@g
z#~xoY^nRRFA!lkVF}_VP^nTo>FY?j9Z;Hx~yY$n1^q({3<;Pw6=|1{YL+{63`m25P
zyNo^kxJy67NB>1b@5f#GSw8y7hTf06^w;?4j~aXWahLu&AN>yvy&re!ulLa}G4y`i
zrN7ZfKgrPhahLukAN^rdzJA=L|Fn<()26)qxJy6BM}LN)_v0@8%|80)jQ#z%OK*Cn
zF==i!^nTo>|9lKBzvLKtKkm|(^AdBsYwTGbgUOeWGf!@#*R6)$kCPzeR7L6JrpeIz
zahHC+kVUWAhTf06^fggBx%rDJUq9~BFBG!q^?FlYe%z(6i_%4J41F9N1R<wBN+vh|
zZtU;J`Fkk3x-8U=(_rWu`vG-_t>)^Rdpp+9`*Hpna$0=!ZyJ00ahLv9AN_X?y&re!
zZ}-vH8G1kN(l7DRk1_Oq+@)vFJ@)7^<?F{u6~YEJ?=j1immhcOmwU;b_l-UMxJ$pn
zN58|+`*D|krH{VW(ED+h{w^Q=C5GOQyYyf2(H}JS^y4o5-9Gw<4ZR<C>Dzqt^9{Wp
zcj>?CqaSVP{kTj2bszn!rhNUlOW*FJpKi+6kGu5u`RETDd-`#geyxxG2Zr8{yY%<_
z=qnAqA9v}$;iFGC^nTo>U+<%T-PqHQyY%1m(Qh>Le%z(s=%X(;^nTo>|CW#bpA5Yp
zcj-6z=wCMF>&IRChkf)@P5Jt9m;T#6`o9=^`f->3Q6K%|hTf06^xyT-f6mbRahHCJ
zkAAqJ_v0@8Rv-Nzj6MChOaCuE`uh#NA9v}$@1wuj(ED+he!Gu;n4$OMF8xn@^uIRc
z>&IRCfA!H9nDX`GF8xzJ`W|CXKkm|Z`RM=I(ED+h{--|rPaAqa?$ST!qd(Ws`*D~4
zfBES58GHJ1mwu;@{_BR`kCz#Iw~yZC^MVf_V(9(&9#dXF^U*h$a@pg<UH&in@P9J&
ze%z)1rH}q)V>druV)WeWqd&vozxLrD4>`_|AWrsJWv^N1^zRjv-*~-rP<*^L0sYm3
z<I|TVQ|`bhYw3}H1yeKU1pDooX({F;;Is0~`25#{Ka%*4^HL}miR@8juZx4A$H#ko
z3rvOtlcKPhgT}YZpn5$17iW<kLhR9MuRkY$0oC>1i%CB{io9X(K0!Oj(I+{9ozESH
zdEH=ty%s$mIV-;0%Pytdv!im&+AF^O1xm)#GwWRP?~2l!d31dHR04heo*=)EgML)7
zKVFHyEl4BYANRx`o*GF#A>1CaN9YF$^7TXld}ccN^w0aPw)~zzQH=^-BJ3TB6xHVu
z9~H$n+q)b<LxNyt53^Sg_kX{LIE-o!vmX!l+l|}{1$OsZ;9Eup>5<4DPueU0AyYj2
zUk^LP!+!+VjE7$Wd`R#s!rn3KzWA1!%6yH9;-&WPUgHn>Q9L!^-rfS{@%Z170RL8Y
zeEN$M_{q@(<#l<2I5RH+pWzAcYZBl~6X^dYTwzG?<54@9J$Lx_%QK1J6~)a$2EN@e
zn)uWx-fr#ogz=v%qIj;ot3-P-B-kFs&6+g6<tE7QKvYqv>O1!S6ZuSw;^IGn1o^EZ
zpE&X4vkB;1SbyWt_ZmN$5tZ9v?}7>RuQPhiiqdD;rY3^GJ|uWe6gPV~@a-vM&+DVO
z#HBY(oV+oL%YNlAn|OOu6o0|m|2nw%kl>ssZuW)Y+qDV&^WPKr;bW%0-yG#*_K4xz
ziwWqTHTjb0W%pKren<j4f9_+{vwwc+Q7h@b1bX7(!npo$P6GR9B*1qj;DhH_<MRJn
z2KAh0wd>E<RSEL-fQg4yQTlE6?t%pLZ<=!KpQkc=#E|A-0zKPJJ*|oImmc<|24CpI
zFE{>E7sbt9E_|C$KaZmQH$OGy(ijEI{wsW2n4ms>!o-LEc^<Q$3iR_$yxkh*gRkZo
zG9<p-v(BfTmqh8s|Eo<q)jw||^`*(g`8%TYtL)vEk*^`a<x#xL-nF6r4GFG@;&0l!
zQDNdMqxcSc_sAK<?~dXf_U@*E#M`2{(EqE^|Ep2l?AyV&(HD@ue;&Z>lK_sr2WXF;
zi_)9*b9{Tm@b4ejn>{nY&qlv)NN|0WeuTaIy~$VqIK9!vfpr5&-#;D~e7DK(x1xN^
z{uO-tBj`s3ACBU}|2;TKJU`)!p+*I_MCm18zl5KR3Vt_=n|&qt7D?c5c$YQk#f$CU
z3()@_{i1kscO<A6kztNAGPpY`*P6i@hpx}a;2t0Tzl}X%Y<o!L8g0K{2nN59A90l$
zM7*CH_RUxtyt~!uFHJo6Vez3Je3`|`=S6$ZORK#nu17a8gE`25FYd%9$gVlaU*qE}
zPCmb~_q>!ST#tt4So{Le|Hj_)a=PV~T3OUn%PqG!_4%#6=OxqLlm0&yUTp8h{sZA>
zJS4wjf5FSmuZ}}LkJx)&q<n=B-dSaiM)%?fAHg5AxR=kP78gEmLJp4(_Y&nJ_%@4s
z`Rr7<wuAJ)NU!}wmpejc^bkMv+Ee?X=2K`>lK=0cT>AZ-_`fN9wW8O!*8dNRexIV(
z`6{<|BL7zueTT)Vf49P)OhCU^;hMf%;rkUI>FZJMs|uHP(u+&~i@3I1woNPLj^@}L
zx%MjlBe?c|ZD;XA^4I04?fkms$&2=%KPr5Oy(gbPDO{I}wtu2>(f+na@d<-35Ay#%
z?yWhGP&k@`=po}UuieTlh1l&bTkqyrT<j)zmBq=YC(6A)-V#5caBVl8-|dQzE_ZD=
zjX#-yzDwcSAM!0O`MTVGpJK0)FTuqQ)L;99&acMXm0XQ$e>h}mczN00Qy=jGLfsap
zJ{s?}xL2QHpyNUO4focZM=M<Wi7t2TC#9BN>?6-sn*D&_DE1Lt`h8w~mMFRZqV&=6
zLEGnLMX&86dm6p=NwxmywU2pz7V^CMOtJJ{`;;hL+ox3F+CChI^6=V6o+tI%XN}^c
z^ZTH}wS9UOuIY2ppX5RP|LoqHbCtrio=X(oKU)P~QutpKpM47dtHR$<_?rqps&HL@
zQwO+2)KlYA6#katQ>E~?6~0X2Llxex@OKpcxWW%B{DlPgUWIErhi%uB`u|Pw$x!&a
z3LlpM&sO+*ioQzWx;<T`@NPx_y23U6QH5)Iyc5hE)PKL?GeY496+T7by1Zs5z#A2=
z{h?Li+TT_yTw)i+w=4WrrO&zq_<Duwcs|>vmHH^{QK`kHJ_<h9;<S%$ry3Qm+o@KC
zYx_K|aIOEg1o(-xYdT+<ijS_>(tc5YZRc`DulZyv{D{5hMeIgCy54E~==`oyd^G>j
z78m<VK1F}Azu?7+kFIxh3V+|;^Rh(YdlcTPaBZJ<g=_olQ24R*f5g&x^%wj^^#8!}
z;N^7dFXb!t&$Y7UD)yJ}rS^B0ySD$F1bBG@yj9^x?L9Bs6#lfr_b6P;eN*9YDEboU
z$Afxixwqyl{S)HClRwN+^x7Zl65y>0zf|#Gr|=IIzEj~^?jD6}xdT)?K34J3;}k7-
zoTArqa}}=n&rN{WSX}%;`e}6*7k?1ERq@f~(ynmbKY2mnm#KWctnkYf{-(ln6ke$M
z4>9Gda9vNUY+9DPZU>hsyj$^KZ|^xi-LLQm?LGOts&J|A#C3aJuIRPgR)u%ldtSQi
zy_f%U3fK7(xl&%&Te@-fD&-}3iQ=Qnt1JPYs9rZJdR^}}EBx>Fo|g`VYya<3xc1K%
z6t4B$n*cwoaIKFXw`#e1T%+a6IED8AgyqT0Tzuytb{7Aa`3<qN;4PM(e6;?n6t3&V
zg9_LBJg)FdT@}n(&wFTk$JQ6Go&zlI)l<h4t*4GB+TTW49hfgY4>{Z7tS@>VQgG2n
z`cb8pUi1-suHxTg?|ISw_CKY6rOT__=7o0C_MD<{ZGUZtK1;*PIz_MB#|IUz{rpjd
zYd;a&di5Eh=w*(GP`1Lgp7{#batjr%<!b%`>)RwfRs3_6+@RuLs&K8pj&EB3az(H8
z&$PJs^8_nnoW;eT1us#2wA>nnhm@Yn6t3m2QMlGq`-7%`T+yFx?|Ip$@INYC&--cr
zlzd5kKWWoQc}ac+Pn6$8_AgWVX#3PD{0*gNyTY{{)+=1w;Yo!LRCX4g^nXo1z|u&5
zC7z3YB)@{|_C@Qj=f`xMm-RHty;S9Ewv|g<_Y-vgvs=+Ws_3;`-OrRfGTC88e}=s$
zF7snvef0dfwzF<8wA~6-KkZD#zfs}3pSDWjdYss$a48Gwx!2;}a@l8bZ@K7xqqYwo
z3NQ!rtIGxNC5_^*y0_+>s&HK|GAs@Gh;I<`#s}$ljkENkr{Ia|i|()LepI89tIK7L
z!gaamdZF#GS<!2}OX1podK9ktOB+EuXgtIEfVaFxTU_iQ^+?wXtxt)i_m-FLr(J4w
z<7JJa*X31{K>sd<C)u=w#I}^1tZ<2+lCQh1|GjMaNWKI=s`zU@nU<&UnP=%FZU`U2
zb1gmf`HrRKMUPuG|J90K*RO2~*M7c3;hKJD0(@Tryhq`h{~HPLHx;hSYqZUy*ykSm
zUFw(ENAP0%JME+Wr%vJjmGeRwR<7v(to<(e68!})w7+}xm-rxj#4l%Cdf_9uZckIK
zZAn^g>B;{rg=_l^Qh2+f*Zl+?Pedk3H!FG_2RbY+`b!x<ZgJ6HaNS-PSsGqmxAz=h
zoUQciu{iT3JP5TY{26=C%cBa{^cfZxJ*8Yuw!G#j{^uw?s}!#7rtPoowoK9MdB{Zi
zOT7^N#V+G4AF;FGvlV|`U$p)jFHb<P%S-#oa|!50KFjM3OT$Z=wH5W>sqkSIr~Vq3
zc7%MiJtck;*Y=coKe3OrJJODbeFU$wa>+;AVVS~p|6#qtb^P3`aBZKL6|VWq_}yzC
z8IODIlO1%8<+YDquhjOD{CVwjvh#kctX!{s)+t=uXPd&ceRO|MmzVVS$p2F14<kbE
z7vj49N<EeGeaEKBv{xx#!HX^K)xR_Wo~T|dQS{oMw<}!RU)L9%-<K`D=r85eZE?|G
z@WYC~_8;jpGhf>NQoo36xw;<BusnIG0v!*poh5FFo-%JEb`w1XpX;(Qe5CFZYE=0D
z7v^)k{_~;L&+9*epKkwoP}xV9ONYX>Uu{#kE?=RM@)G~qYw4xD1eY@M){9=nU;CAg
zx4J%x-9)bRImUV93Vyon`KXmkeRkS=Uc{cXgT{3|6&sTNIi7HM>rsyj`{suwCV1_v
z$4$Ea4p#L}+gZj7l&j<68bvQLfvV_!evCgPpx6CyJ+GUp;<ldGO;flo_grfSum2P#
zz)KR~H3}CS64LcTmy49Iw_K#W#1F;KrL4W>^0Jbv%SCh`e_bv|6VSI?JB!@&?Duu{
zDslzyusHeaaa@<eb-VeT!e6yI@S?|Sx?H5*dG*P*X}$W)wz#((%M#$yK9ax8ZIHCl
z(vS7vy4{pM9!X18zVQEvqsLr@>vGral=kyRMX&MI3fKMW?Fv7Z-9BdNymk}3)N1Ut
zTU`QtSpr=9x%eJQI~2XP!#0KM{O+^3l)L!9__>t3;BP8E+W&RD(*B=l{&R}5r{0fO
zV{z&ub&w*ZzfFBKzDMz)P36%2XKjbq6}`5@VTJ2*ADtkMWmrLCH~epBbBwmQ*iG<4
zi+jsm>ILzOEDw^_D0;2Gt`}PW)r$U7d(X=bg=@dfu(;@dRRaA5FI0SVxhIMP<%<5Z
z_MVp(h3kIHW`%1#bv(iU(TpBdieBat32FY?ZmSf%*1uihBNczCUt*s>+ut@@dMRJQ
zw<|uHf0x2Ff6<NQuICj8SUJQ;*?Y3cR=6G~mML7v|3vXn>KFNI|49@NpH%#HzI46Q
zd~`j!*ruiax}WeN0ecKq^-FBRpAxMj$avPPzaGzyR&rYuf34?}32;5nuk)L!#+5o>
zvlXuWR^ov8&-GTPOq*}<AHj<)&U|UPx?PYqgrqtSXuGv4K03eJ&vkrD6d%0$&q<)a
z;ED7vSNdeCa?$zH`s@0u^<Sm<X#F2o__6FS{Q$511y7{E)@O{;Kh@r|ytMvl3fKCJ
zPm*5iFZLs@_0LuL(*97U@Hgx|FXi^$tB-C+v_9INTWwliwkbX*tB-ES%M~AOpHrpJ
zXv<&f*FtM|Z}|$IsC;L8_<YIoDYdxNQ^B?U$6H#GmRow!=PvtOmBodR;MxwFkNBJL
zx!dxQ`YwC~*Zo7yXSGM4uUS58Jo*UUZgKjL=CjVj=Np#KdJiALyA&VYPCch^?aw<C
z;IAuO`?;=1+OPCHgZ6XXuGLzeytLYUFu%IpeB9z<f9dybv$)t_@STc}&euML>;7=J
zhyOp@@2}gd@E2Uq_ZBJrb-StSsrV1`rR~sa(@MVn-O5{Kagi&ylrQ-_qvXC|?}=-<
zxgP%iY5C`S_zN!ei+r@*#6O8=TOMTbq~$|=vAySIuf3Oiy<yYrv$*6-aPcMb(f)bV
z(i4Bp-t&@b`4QKCBD#6;d`s`uN5(r|eM%L7txvhawLa?<uI(WH<IPu(qStm7dyrn^
z1603AY(+b0f7A6YQ9n)Uhu04BJe1cCJCt0#zeV0h;<a-|h+6gUw_Ib>kG8n*7hIli
z5`DgA>GM7Gg3qxy<-X>MGUpnFYkz20xVEQ$?n#$#+5nd+`Ro0_`Z*(QhbI+%x6(&H
zf28#}tmt#B4=`EgKsT}1p7{yz*$MDgi;F#_yyZC~vA^K*ehA9d_IX_K*KzVmg`chR
zyHnw>D*Oe7%icQvyhq`hey_rH9Ghc#GG7gf|6F^|d}+MQ;>?#WuU3WY=c6UQk$<zL
z;YHeC^4Ivb1bhx#T<kA?-fMBOzu*JFmxs`cpNB0j^n!2p(91aYQ4hV~QqEpGyl(56
z7k|UzqL1)-)8e9!;PT!n^3i_2&DJ~NBe7|_#f6XHJ5@dXqiYiPtm=!zcK(p5a7|yX
za9w{J6+Y40ihNoXuIcsjhMJ!5@!%o(l6bw|;*u}HA65Ldo-bRR`y#a6bbZ%;EA^N3
z-9`iVv|7~{UBA{ST-UGm1o*lH_<Duw`Z&(&z;e%1_S|7{v5%Cm^b^EBg6n>!o<Em1
zj{G&Q`vcl;GKM9+&hI#@8*#0FrqW-RyTlFAU&>M9kLWM>3yM#-z2~J+$<^hk=YO=G
zx?iF3D#b_ZUt(o3UpkJpD*Qy~C4PGOG+I7l2Z=u|78g4RzQjW>@okxhUU2aTZ@DDO
zSG(oo)$?(WT+wHnN3P)8J@lfF_^sqiaP5cMp0g9^Q=R}9x!(MWUwQLYmw?ZDh3kH%
z*nxaBuIr1||77Jpmq4!6WAPKI7ke$e*i-P6ZSPX8{|kR9m%$bn{(|c`pz|A6`s@1s
zsKRx<OGKY-=|vyOS8js*>T=io6V<!bN*`UXyA-bHpL-Rq>BVkdznX3B=EZgV(R?KS
zc=KE1vA@`%PL)@i)s2@%MX&J|54~*`oh2T6!Ivp|`lQtBRz<JzRUUfrlhq!2!Sy&!
z+u=b=@3mWD(9I-qT`n@eO}jC_;!jH~J^fbW?TU|<JHXSAl75%Whl~FUF5@if^G8=T
zbCz)yaqa)bs^2vczsd2O!Zn{46t4A@@s#8juOl<Z%a&g9D|olXy?*t&qGvgZUlm&i
z@akWtaIODbiwl2=Q_?>ay9wT+_~`uV_fhD0QtoEY>?hH7Xi0!e+!lQ#Uk_S((MNEJ
z8(#Vy3FsvsUOzmXKp%;pq}Te-wm#s+rM`P{si$5&rJj28CH0i_U$?sPBK4H?8kc%1
z^tPCy&kG2>;O$m_(MRHg)N9d4@bw;gi33vKg<kMP^}Q@X{hgZt?^U?=tEvR$CH(=(
zm-tDer58N~7e6HZT1&&r5=F1^Wfm9yVxLw;{~YcGU*(|}`$+pG`Uo!mPyhL(wK-Yr
zw0yjNm1}8;Yx~SeKwo2V(O>K!b`yOBXI^-azwV!R8?=9XC;5Hd;=)Jp9uK|b_YDud
z;3HJNx-AVaa~1xo!gaf>?U1PdAo=y$A(5XvX=Qosu+QScNAml!#l3du_Rvdyy>=5k
zP32e8l0~M%_4rQ5A8nsHMW4t%x<CB??Bf<xse3X0ujl=A{nGdnMSsZN^YW;@r=M(6
zc!#~GpJ-gycWJXoD);n5y*_f(@)19j`7FnlyZE8t+OM?!qb)u8|BL0xi}Y`aYkKW(
z8khEq^is#k=TXa_dP*LNcUYWyYFt0Rsrjd>c0uEhDqL(u{*NnM+pWjqUc0?vaj)GR
z)vwcX^*q0}o9<_7dYQMUeRO?XMrCmj|BicW&eG5E($BUu#HZsUhtyx<S1G*J5)i*y
z;o^s0K6@3t)>HhA^txTpe${Q$@{(a?kzU6u8SfB(RnhDGb}L-sq*rdQr6FEoWf2-+
z@4a$$yQ$@d6(5baTHNcmt1RyI+jd3&9PXvwtyA<G*Y?+bvcu9-f9+S={<>VW-SoaJ
z%HlyjdY<qF7mm);%5$Akcf|h%f78-?`AB;$_2@cVf27=nkKmcAT(qChR=C!4nZmXI
zNZg=4y1cd}pzlh6?@54nD_rw`JptaMa9u8$3G9}ka9v*63fFcRp>R!KqHtXwYZTsX
z?|Esp_g=frRk$ASG$z1TD}1KSJE8Ro*W>68g-=xU;)h<pauV26{EGBCzlDlk#{u2{
z(e_N_S8Eg>&0pFt%I&s!;U$s3t+w^RYiH@-d2v0zq5Y@T%3}TE{__m`eT@enY`;Hh
zud**a!+zi9!G&JpjPTF4bg$d1;Dz>kkG%?ip_jNMxX{nB^vti0Z@QhDh2P{5|DoJn
z0^<6hy=Oepxb~|(ihi5Dr(E6czie^xXKa-C+--4*SAxH3aj*W`KXrUA1z#Sd*X3B|
z!qIpu&yk6JM6Tf4K4NpSXtjLEUq4^A%HonQiQB6!F8l?T_Q=cUam8Q9=O-0D!{(8Y
z_zC&w_&nIs5ZCc@n8G!^ZWlD3pMYNKxR<|fN3`5T<ucgji|_1t$=>raOyT<!o}ut!
zs~e#a7U#QI6dZl8J8|2EG?XohexSYQWwX5}{h9Wjm%R#4Qh2HrM*0+mH!A!rg?A|Y
zY=!St_&Ew6VdEJ2pQ~`$4?|qPhjy8wKVQ*rQ}}R&OFx`^E>yVelOcYQ!pp4@iKi=k
zy~0N-e6PYUR(RR~_Y3)4qVU-Yzf|E%6rQDU+4n*|V-?<`=r2?FFk9H9zg*!Z3eQov
z>{lWEM1}8A^mz)G_urC!vcgB(_rww}P<V~PKcVo=3co_(`xHJ^;e)NSl7ErHixoai
z;Y$=gUEw<vezn36D}08+Gs5l{%AKX~xeC8V;SVbOI)%Ti@Ea9A%vLt?ze(Y975-_3
zw=4WJ3V%-FpH=waWcLgCe@@{g3XdqfRpAv1?^1ZB!jCGvTH*ONSWxZ)g|{fYR^i(f
zzDVIts{4g}^gL3U!f#RZ>lJ>h!uKfrc7><f;6?sR6`rr~FDkrB;ddx}ox+zZoc~{m
z2l=mXZ_Szi?~DiWmF}%MXWIoD;&&;$QQ==v_;!Wgt?*uje^udyHYk(-y$Wwt`27m+
zQuqT3->dL%Dm=|Lc;vrP;bjW{mcrL5{9%Q6DEtwHzpU`@D13x%R4Dhm3ZJX+PK9q)
z_+tuxQsG+_epuoEqVUWi?ib4azQRit{zHYgD*Q(Z-=XlIDEz3xpHO&-Z7eDG-xNMq
z;ZG@iox-11_#TBnqi|<@Q*~X%_?GG=E#o6MUwdQAgq+Ci8COm#EsYdiIU{my(KXX=
zEG?QgJvS1W-<*>@zqYQrd1-S?_2NlY)h!jZbvY9vSI@rg%A(nk$hDE2oQd-rnif~I
zM4DTgYU>wFFP&BS1&@ST|EP!w)0>(ano26_tLmzoX52P?Qd4zfLsQH28)jX5V<acL
zn!iRW8>*`R3#4CrV@@Quv7)7B`hTk$^J1mv!UmQ9jk#Cy7gsN?Y+ULrsBWpQzs-r<
zTvb<UE)}@MdfrL+g|T?fq)4Qxp`j&GRohfu+0xLobUHaF_TZd6*Ks426)n{ZPJn*W
zg6jI}rrJuKAXeuScV%dMRkZ3%t81uSG_k(nc4!>S@T859XN^D~j5JmFIi9$R#;W<X
zE!9mGux3t9BvM;n*;Ku_y1s>ao_vIe4GohTE1H_Cn{u*Cp=znQFNhKF5#x|w?W*cH
zYM+E<b0+mixrhlTxwqF;&<JoZ@X49jbZdP}?c(a#AOFFUguM}itLvL<8|wdIzsQ?c
zy`a|5=ER-hxMjC^u~D+2s-mUh<Qk3>Wv!c~lPEpo4~PwHqyAw#=1i)qUQ%0GQCGJ#
zQqPvHE;iREt5;lp#|&Bp$Vp8_Q*~A3_Uej7XxHF+IcSVgTdFIXs}1^(XLDjCg6fHy
zjtd&IQxcX?el4}PRmbOe5}ueB4e${t*t8V>6RB!|0p>SVH@mui6fZmhw*QC+=47M8
zgos~XvAFslw<m&wY3nREHx8X>Pc0|E--6NbjuNk`h7IwluQVD;fInHEo>*O9<;&qo
zl&>$^7Eb`XV^)d@wk0>g`MBi1uB$)57w4SX9Ax|0ovc+0qK(0olW)tJoQ>lj=9w=J
znV98Clv^CHDxQ##GZ^PbA}uvd4Yx<;Ra8YPnwlyQQ>$-}ppGnPsfi}ET@6pi=*0Dk
zKQ76S8J9$A7dO_igM4EP;_Gb{k-FOE7LUY}D6se<W5+3Kq>z*2j#ykR;tpG4^s1PL
z;f*uCvSBg%VoqIiOGS$_-<)q{H>AE9-*2t2tF2$eA1Z4WGafqQ2~;;-*3j63E=9A$
z1h>s^cIH<#G@{DZHaUwI@myJB&UFpV)x2q{uBhU5{DP*2TN@pA;1@SK=$te))i*dy
z3QkQZG*r?0+ZTJRmav=<tRjnVZNlG#2*+o&ElX=Enrmh(p1pWd?)2%EERNewm|M<-
zc@@p*nY+Wx8I>IQ<y4}bjI=aW)V4IwsGL3>SOFUD26Xoung~qKnH-5!G&k2Ss5f1$
zrg}8zaDv6h2{s=^)TD|=8d=yQZl4ArlhFWHH{Dh}{WRN+Wd~8UU#Lc#F~8#0x)ux#
zYFnaJ7V_EOs;ET&q-IfMKBff#R8%xo)=bKc)K$Tu@*@?Mx3JUVG%sCD$25LsZpPO)
zv{aA3`r4Z=Gb~Qjp-v#G=b(|pPyoZdi0Q!BQfM7}IL>X&^^KUJXqoTuYh^?Ie0uug
zhTEz^V=nVs(97pg(WzwB;2HVDK$ca`Dp_3<ncsv49%<MzJIyF^##jeklWGonD{rr|
z74n$HKLMQuH#F*oZF()7^F+<@(Q3rB{(wEBxPCg_^_Yr&G${p*w>H-x>Q^qBj{Km`
zwp7f+b?IVr{fOhf_(3=KDww~xy1BBcwvnUQd@280jE@-sZ*872vvwhZ!Hv0*Qp_01
z{LKyC$)n=NvdHN*zKs#lYBU4Zcf%IEX<l7*q;~#{In7NI5VdNXBbAMfh+k;NZm(#n
ziby|hMp<O~^t{_D>Ta!`e#4D<k?FZDOB<`F-&hpE--)W<Sl6$^35HTeSC2E4Mar@x
zWjWC2x*H4ryTzBzx^YtEG`MobjhJVIoln%Xz9<#nZN*I)Jgl2e_jx3H3Q>2Rl}m3f
zg%?8=cl<MccJuAEEtNInQLXB#Pi|0tTGZ0xr-U5?pM|P!i+ZD()0Hf{S^a1{t8Y2=
zJl$DHw84#a6_uC^ica3ZK_++|<Rp5NF5mqAi3bKqj-=^%hH-SbdrG-}G|L)ot3IX8
z>rwK=OWr?8T7bZZiJXe6rPGgDnSD+aZ_GPwLX1C^dLuq-SI%VgeckEgi0wE}k5;f_
zjY)kPxW!n|XvWx_ziF<<6bt*JWJqJ1sWaT6{-Uy$eJb(PwU4=f1S?Es6n_#{&t^v)
zqaf3Us2KCn@||-Gb|1~f;>V^5jSbDUOCs)Y#}w?uNRFrZ2W-NmFO=F6IC*2m*Co&D
zB3;Hr>eQWXMRF?}8kd@RCp);j_Qp6?LHl*u74h`La_w|o!p1G?Y^S~z^EgG$iRkjt
zJT-P|J15T_N<=UUb&I1mrV01PpO5U69Ou~a89NX$QEss>%zbn*n82~!>1dFQk;N|c
zsmm0md8==^wH9%SD^S{Ur&P`atQB~36|sZV(<hZv_@=I&eo6iLJN>fyJp^+xRhU+*
zUv&Cx2x0EH`}B#J&8mgPhKhO34RyD+#8$0Rbaedweo~!;c-@rPl~=!j*mcGeZ|CU;
zXdS%9GQFM&#uuf-bLwO=FVQCHzg98|uCcmlaV_TiF#8!Jn_14|kIfjyqR%&h_tEa&
zsmnd*&9DmD*uO==T?{*Q5=<DmwW)vQ?i8|y0p~Y!<^efqiFKP(D5XDQ#BWnhp(xCw
zM5B_skQ(C^r%)1?pWSKBXn#lbt52OE7|)&4I!zhjyridXtgVi%OQ$X~T-WXIFrB6x
z<-lZINXL49Wkr2MJ=gY6mng=*(=7wt2rk%&yPdAAu(zVajP8w{LJxq&+!-(|HJqlb
zm`(#H_)immuKUODEu6ZZF#=g#MRQB!_9jdNN4Oqwnlb}H&5fAcI!)}k9(Syaz+#gs
zv0_}`kdtlpTQxRd$!3OWvwi#N(3Iyz@~dve6bl;s8TCk<XYOaruFIK@50}u*fysX!
z$Mf5hm|TlLD-gQ?e5{SCo*~&Omb^H2cWBHO+0!f8voH0(P%?eQ%)lLMWA5qAyr;n3
zO|hp}q{rU>s7PZ#Y>>dt1MUtpYd(|pYIx+f+Uncmuf9)@nKnHMkNyXRj;<PCP~ePS
zGCm*Ys_~P}d6Gf$%sJPbCz|sFbI!rJYJ5(%`C{%1@(l-bo@~yO%sJ1TbIp08IZrU>
z9GuC)d@=V0lMM%Ro@~yOaIPAkXYO;&d7?Q_Fy|a|Hm8C~CaF13Hs?v^oM+Ct<~-4y
zCrpAnxr+gn%`G_wbI<0sAkQ!|=gH<g31{eF?sLs~qB&16=Nxl3r-EFQ)SM@q^CWZ5
zGv{1$o@mY!%sI!!vFcw{ds|EGM5Zn<=X{(|4Ca24Ip>*kt~pOM=LzPV<09a}O(uAT
zV1m8H4cVD<zBx}e=Sk+AXU@6iJkgvdm~#%!EE5+p9CA#iaE3zWev&!onRBi=Pc-KV
z=A45wIk;b<rpEep&Uk|rWE+O&JlUKlnR6b_RpWEb{X}z~V9q%PM?=J9+4>=jkA8m(
zo*N0pNxsj%P~nR?u|MK5l9*#Ho|htKAIFRSRv5jDy|IrYMnS&s?pWzpMJe4IZ~DuT
zo>-xWu6w%+v|F6d&N83&@w(`9wb$agw0QELv+3sAt6aSDXCQq%`Hl9Woh3FQ<qyQi
zD}OMaXNxC4gCLG7_YysO<)<KhJo!CVzRo`%UG&O-0MALqlfTN!A7HPdfLH!~NFPuB
zk{`P%Bp=K_A3gNSzbGrde0gs{tIH;O_R1fI^zr1cw+}~^*p!qHQ~Bf{%7`yt-rFe8
z9a}a=mfZ9Dr;PaWyRCeAZk+P@D4#d~mtGoQ{%AT2j_l*ue-zTk%l|O@5SW(FNAbM!
zmye4tzsy$X=ZqHpC$Ig#fb{X?m;S4phWX~fD<6&X%Kyp8`0|I*S#dn*2`pauKS26;
z@-ywjZu0(m%I70&Uis&YjW2(@eeP1;H$Yu@c;%-eeLVTSU54D`n|G8y6d$kr;AQdU
z%X6GnOso#C{0|e@f6p^+q7s{y^3TV|E5A5BzWlxRxzN=%y<EKVry_m4{15x7o1)w%
zr2OIdc;$aDf&97lxzXd<zcYdSC02fyl7C?w`4?ow&;KyQH6F*4KQtqL{_~$T$(=6u
zV#@y_+<Wssc2s=%d#(I3Hd^ZN+W%unAJ6{1R=&K~fcA%}eDa5*ob4m4N(%n(;X3y#
zns;+B{a^7B`Ere%XY~)dbaKv2bMH0_V6T!+;G2=&V4n2d|I4K)w}h0Bte&v`&&ARI
zFGw%)<@!T33JkGlc;xT2`tQVV`jB*jeGlp5>0kK2U5X`^kosSOkGK4L;S@%`rISlL
zg9VOkk6vE+?;t&~LK3TEhn3%G(^Ed03ZMK$<-aG6{d$pJ<jeI8I7mGEburlBD0MH<
zv!oLsfb<6Q<TG=ZOOb5}ss9*!y!IQ2_!rN9gNL~Zk5_*kq^JBsmppo&W93sW4_-m)
zlYeW1`2B*FU&X}g@aDe}>Ep@I-t8tTv1uuPJU-t1e;NJvc=^v}u*LC)dx@UC@>d{z
zJo!tk{C1m?@>v#M`HdIEmp=kHk1F>PJ$vOZ0$n`$;TPN_<u)bdPr%13|7ZgFttTk|
zy#(@W;>gd9BmXWmD)H?9x|P4$>Ms{>{#%hgUjBE+kv}Pp{5DkTc=GGm*x``(^0?nz
zS#r<omytf6{LG)ZRBu{h+CLv3ul)}qsKt}NWQ3bg-b-oO7+G@9>mQLmp8R1ycd3Ti
z_K)&Ej*nM<qWJZ4ocMJn6czi+^@j=CuhncUaj?wwA?XDBUV`>3`$d;xm?fnCSK#B-
zfA;A3_IuLGZ>Mq9;gx?i(i1CGG`uab^4Ht+ls^?8ul&XMog|)awljMqKpcl{diPtu
z{p5QMevc==`<E`oHk+REi}3Nv|M@?~mtT0XoBnw5`+1~~C%=8Ko4(7vnD{*n_g?vJ
zkV6%{`9EsqA1{7>8FcaFm;TBX+^X_FJ&yc80gETUXSAEX!@We$l%<dT_!3Y4o?p9E
zy8XNwkT?HtCx{>I?5yB8p8P*2h#$^x-1J@U#n^ua?!EHoCn*2?kGTou{acoe$*bJ+
zT9KgqyR3Yf+@k-@!pAHBGnw)2KL_&)Jm}y0@Y=r&>EqeI>vwJ{Nl*FL;Nz9wHa5Qe
zE_QZs9MAv1jP&v3XTI#Fr(7PqUWboY{!d27m%j{rc^q&4;Ri?`Prkflu~hm0_2B1~
z|EC1?@9}X)eDwcVyWd<{a?k7jMD_0vE>*9Re<L8T{MH2XPtUQlh2w?el>ZkK%s-WM
zo8*p;zc&H$%76ND*Z$~+#T@On;+Dps_&<{NyIg0$PpG0des$aQJC37&G1A8?zwZ66
zpnRL2{xb(3um0Z|6<_{(cGhrYdiwR0rH{=>A5Z?U*IX)Hem4X1%6}>|zWgrRa38P!
z>_GZ>@(2IXmEYxFO#PV~NB*Y~r{dXvS)QBlQJY>a-u&Ny^zr2HvGO}?LfZfH_;~Yw
zL4xsP20M#5N<;2d&R+RL6O131{K-ur|5udq%klBbU!4&@|BVG8#&JCRugr*_|Lg-M
zxzpudjQ!`~-Yfs!1o<Dw&LWO&?j?Hm=6_9s{J$ATeigWQ<sU@-k5~RLTlsTs{SgJc
z^8bkR#0rJLUbh`|Z@TPv+J8PiUitT+osK6ze~O!MyG<__ul&1^KA!x>LvD(8n~?Hr
z@bStYnLz#<Cn$eJ0{Jp<)$$j{k)MV5A20u#uW%Jl3%XZ1d-FdU>Eq?U-FE!+_@ge4
z{MR8op8W0XY~$GDUZQ8O{8x}Tp8O6@w&7UfUX1_O<KAokClNp5$zN6ICfqmBGO!n~
z{GT9wJoy=Kx(RmL1T6nXe7y2s2mg5T=U(Nef0I9|!z=$4q>m@R=dhb7+oq-bCVaf|
z|1W#r0w2{?=YQ`EkC{Mugz)IYW}sM;Kq(1HNL-K!j~ZHRk)lPdn}j5EhF55S8l;s_
zP!rNBRB9_)OVz)diS63DbcI#7sdZN>Ra;wY*LBxWT{o2az|xkuMgHIKdCZ(Sb8jA$
zDy`hl+`0Gu&hK}Azw<l4^StN&&g>zQzm?6-qDo0<^RvWp{zuW{l6EXs^m^Z29cahb
z1wt?RC%h~vs#X0<`8VRU<)1OsTmBc>S;S$>Wy?Pl^K4%FKd$Ke>c0g*?<IfJ3CX`x
zUWENM;og?tZ~Wc8TM`a8=u04|)}Ovs4O8-48914pRUEqiET2;J`uT&P7jaqiWjzw3
zQz26Sn{nFmuMT_b@3zH~aJ!<{7cIAbz5(=vMKwTOPbmJT{oaBwn}0Lp_R7Ce>@4Hx
z6#uC|oBw9ed-2cvlcZ@^q)h)7oHqZD!#=(EKdJctLDB1r&A%D+Ui_c*;J?*_|3whU
zi+|@5$#K7Ctgbfy@u2tO-}HZypi<E>{o8Qb>3>3%Kf9bYaj?LH!WoCn|NEf#;@_$G
zHz`{3|2R&Yf3A=HH7%8dQ~Th5fsg%_y(Z~({*nJDJ^0^)gnQ}#D;%ugXqT7dzn%WO
zLGP9Rypxi|wEtFs?DSvb(|#;^zog%v<ScJ&{#W|6AIlW~YDLfVx8bz;|GiKBIp{h`
z*laPh9-R;P)Svqm|4yU+zuklXHxz%X`f|2^Nb=8-m*l@?4o>%F-uZX8qJPbb*p~lS
zpeHPv<REXF=!hQ2GDT1Q?Zj#8??V_T6Vqbj?B-wvhsKvr8O6!@G2T;n+20owy&ivR
zdRzV<fZj{~CxcS{h`fmQ>obNt6I6tJPvIs1GgT77t`}5vS{&ydAN&1<qOY?EZ27rw
zx0n2XPz!HDhWwxPkUyN|t-olE6!D^@r1Hk*|1+QZ|9VBgt`GTt;#2>hpu=Gtrv5*N
zXKfE!|DS?D#I*JN#Bx%n_M??gQdjz(*H+Mb>2Crj`*E23KaXdd|5^aN_|K{n<jyQr
ze&tgp|2XKq_?M}SGvB}7<H7$i#osPJO*cr6y8op4%T(zntf?5`{r>*A>VN6<vi!~m
zF=geUufN2NNWUe(cE!Ih`(eI$>2I&1-!HhO{xn|=AuVB14N%v1wMmZIetZdGIz8Hc
zz6b?*@n05`5i#B7Ve|hS=)L$qr}#H1V#f0ooHl<y{lDhX|K)yXn!mn2G16QA)8mry
z1}4rpG@S;0AM^rd<=^6AlCWAKQvQFy*<blXcS=HSf28L=ZkoTo?uPx5lf8c8D;%uj
z=&SzzH0ZtLe^AM9>c0c=^;iBJ5BZBc<geEDW9jb~tAzM^TLJlif1Pd(_>i(6y8+Bo
zFJ31oMC$JWoVNV4$9mgux8g69tC`_y^DhHEVNnBzw^7BvUBSu!>o{%xF~CIrDLj4Y
zUM=rlWT0`_{A&^B#lKtezgy9h|3f%!{(j{r;*o#c???03*XOaQPsnfO-!p5a(2M0I
z`LF3T;J-jGU>1Gz2r0OkfBQhxU-_qc$bSU%n!mo*po8Zn|KtWK;q_Wjb=7nld_CyB
z<iA_VZ`PmR1W|wGFY}PU8}ypLzJ7JIxBSgY{_R>&b=7nld>`lq%+misC4aR-r2YI0
z&i=|j-$VYxpx6BM^*m&-m;MK>lZ;h2Og<R&8V~}#m;8AnrTw%kM9Tjioc)!5v4{Ns
z19~mDzFy*E|DhWt<K32CHJuD~oQr+z|4AkP9~2_x@5E`#pN9yA{uG|Rd||!33-!U@
zul!%{k$&z+t>xF(EBxA@jgtQtG@=sBdUPs$+Mmu*GXFXi9n=3koOb$0po8R<{^&;~
z;ZhlmiX|n#282ORnW7q?uFaz*q1pfccZAveN1f-*fA?k?QD6Lrf!>RMOSa^1*53y`
z`1|EwOy!@Jm-<_TD7F6e^|}dC{(xmC-8W15E%gaq%MkfrP$=ou>&9fz5k<e#idV;{
zuOC(8Ppg~nG;^{HN1nVS|8;saV586YGm;}YR4PQK|A#m=J(4XBKmD!q(BFFyrPiCi
zPFC{U`fFG6>vSr18Txx{tkS<mP}lnvz3%_%V9i%Qw<`O$)a>k6^wk<sU3L03_~*3W
zMW@(WG;0{I6VjeiA$EEa%Kmjbr!h7Cy&9mdnqFUT9VOFmp*i1dwjuIa)9KJzs{PAI
zzotj~Y#w&{XR7uuY9ir2rtD{(BB1?nNsp%2_OmHFbMA#vH7Wav<?>0U@khAY^ef<`
zmLELVte)0zc_b2<j#D4<UjCOB7YlIFjOp?wQk}JB!J;byZb~Dr^UVzVBJU{XIP?(}
zH&JJ##LPLl`Ck(+4Rd-<2Ay3m1s!(rcXtKHbi6by+H-RAciZu7X;4Jq{a3NJuCXCr
z7s)G}UQ$vty{K$z1fQGM*F_rEMjDIDX3i|0S(hKFU0t*GhR99zjr8miDV#ZN`m~}*
zUTnjLb?e`G`Q_Lbh;dB2p`qah>{ZmTv9Y$EzOygi(9p0NE~4XWFJHa-rZtzXYiw8v
zM}LvJ@)c#}D~jt1OG`^<)RjyxEUGW5onBsCUb14w@)^_XYwKs!70oCu%1^D`a6h`l
zac{oZy>NK0SkIyJQkSjCNZnMGLf$*`M?@-zzb*2aL0=qlPiWEb+(_jJ=js3cFNNZH
z2|9L-<~X;DtjdHlf}r?1Ej_9hfp27<3f?B*L(`G*^f3X)gp_q`5^%dFk?Rq&11WiQ
z`Xiu6vCKHW0Z4WrC6CYzV2pm0T>t^&cy)9jC1)OBJXi+2;%Aq|OCHkjxB&5m<*oSF
zad7WX6CP1G#K-HY<e~9dWOO-Xpw557P3=V#CE=*%k_W0>ad3(azvMAp-4UMBDuBs-
zleqm1b_S@e7e3vMZD~xf*bt$gUZM)|J$GG|u0-IkWcBJk_fznq8NmJtUgTnL1A1dj
zxw*I9*L%AOPkP|?b}QX~7n>eZE#OzY;(KuMNw@r}_zZr!>rA%uS>=Db%KSS_<3O18
z==?^(IEQB*QS-sL*X2`#%5lRu{pf9c`?(mjghg?hhyG?smkV^!g+1#sqv7`h?!|w;
zifpnODei6loDcKjuM3YZPvp;9$L3!S=H#DN*6<v|$s<o*lK+}s1ByZH#eceruu>tC
zKWi~fuhaiBU|xNvor=!BP*(GJ5f6mvbm}lo-&fzsu75QB<u)S~V1rpd5@uK3dd<RO
z9ih7F^lLEplJ?SHlhU6~7xl;1N7HNlO$EKpn{hW&C>$|$<%P61{fdnnHa6DFep3WT
zpM9s|8LAi6|Gv|63n_^_qT&+8{;xtXX49_DU=_QCVo!EnEBJ>4!y<7^Q`h&ZYo)r@
zsOvIyov5xCt803{EYvY)lyhTc&{^6YbPLed?aX(bT|3Z>PKn3Lt_%-ri@LebI>Vd!
z)_%7RhrV`JXE{BQ!4(fUgWLxqqdR8@+|JpdYIj#bezeCK)jWHm8+~ATpm}yyp3{R=
zJur*?y+JY_((AYwk4xGnXIBK*NryXU)qoDUH9OGNJPYZ}ak6^nPu}DginzPTvtVLW
z@XU%hJxF(sGsKTR`T%KRY!6&=_|aLR{f?jyc5R(C%7^a{1~)H}X^%dT<+$afWgOH+
zXprPjo#eVsx$f(Vyo^kL7qj5x=0_6j6H^D61K1Th`O8qd<CG#u<on6ZkG8A47tet2
zj+{EhDs?CHxD)xg3%0#;uGqd6x<<IB<^AtYof>~?p8M3v&B4U+YX&7wKIZIN`sCmJ
zlzs4)anYWxT4z`Lw%illkl}Efn;^|$+_P`a`|e=0JO+8X&`;-c*EZ+{{3vVnkmlL3
zfYZZx65Fay<htRb_c_ke<JZhjoZLJw0lwO9DO11303io?H8|Q6adMwM6{Os5;+5+H
zkUf|<InUYkKFB_%+Szp+^0!ld$k{#A5wf*>x1t<v%FHgv|Jkf)&#9n<zdztS+|n35
zkZ_upGzZ*WAvavm(&!uz=~3xqTt|jRdzgm9A`SDvcP`RVk$@a#I(GZXl>@n`S1DIc
zQmz=}$_q-lZZhQhEaZwoF6go-rsQ#)sF3ThlB+A2Bl2ND@`?O*6DO(yNQ26E=<Yg0
zcil>NF9+SEoYY?oa=rqd)FJiv+=z-3)DzYRKim}@*Ks&FR>(trN?l%DWb2Y~Yh9vG
zE9~Kw>*hforO$M`*e&hTTVAbGDQ`}PDKGUZ<sH+fyi9|iZU-ta>&)ZVxT4%@`E))p
zKdXg}U7XBQh8@4A0=6W_xu>?t^7!&4PS5dc28%LDyVh~FLx1_ORnoC+9v|uS9N8we
zQQyt@D+8luhTI7=H-OLKT9#F5Bh*LBsqv**C~Kij7iAN!?J5?KW#ts&37v<s?9O?%
z3pQ~IWAY6ukDqa!hr73l@?P9EQkHkhqRV!T$jb$yY`=U7%GWkoF1jv3-J$Ij_fpr+
z?vtCplXw~NAHOCb>$r80-5oWPW#l;QE`~I0L>jtaQ-`fI9KU8RXgN3Vn5h4lp4Lf_
z4do>6I>pUM5BV@%_fB%kU8IS1fl0?YMAwlK=#%);)&hx_FQi<k54XuW#aH*JTaL^#
zbPxGk0!sHttF8O)c}jn%OUTdE-=hItHzI8pLVv0pc;yw-W74utlIdgJnxbbK$w#*%
z@;+Vf#i*B{2k0lK<0a^wI2&O{8{N>%nn`G9m2TPtxkcJ$Og#cWN5-3)!x@8m`kx$U
zAL$*Z`3{CR<JoNEm^W@%=8J|?UbD}^crbM(@{V!5-uT4a(ny)t&aa(@kZP-P*Et75
zH#=wo@Ork{#Tj^@8f}-Bi*2ke*XgG(UH>^qV{yRQ_nGC+E=>0&(|RZJ;7;Vh){HzD
z)4@8`D-Wn6ul9#+dJD=b+rqKn_i)hJ_fO!b+wpeP4Z3aoXQK^b+t>~{*f#D}ZDYG?
zi!?3cO|Q@W+eRVZV~%LIMY*3R`x{y|=Jy!rg6#`&&Ax_)nfx9VZLw-M9!vIv*`F|M
zKH5_a+hbn|aAB*b{$etmsWOpnGprx;pexZ&L)zSlsdBmz<qB)8_uXfdy}b_d5pdR}
zA(T1R?=9kaOh+uhx-PvwHQO**A9GF?eIr#~T86ly-LHlXQP;YjlXXz4Eqguj$aq<2
zr^naVJh2>)IZI>p5p2`fP#eeYYjqJ!)WVB*eFVFdM3&druZ`5z!v)*MS{W8^XpC%V
zh-^rwp;zR3U}N4F+t5eoB6rg?5wYYUBCA;~;4;$2dhA$Ve-rqv06!6*W(*E+g1V~a
z25jQ8p=SLm8Ifesup$kWGNwhlzJ9|r=NkAI7hXvt*y=7KypnIA^q9S_SsQ6sF6N=J
zbyKWi;|4;E#0xIdu)E{>b@jFJ6>-WZMy=eBu{I($ZOKA#{Kk#-RotQOo$tg>kh}_B
zysNK6e!O{(H~BjNJxiVkjZaltZ$cxT{th5m?HX?ZCL>sn<3(o8A2DkF@VAZnV&I-Z
zS<8m!j+#Hh`S1UlKaBA;<K(fOfAdEyUc~nbf!*TGLRO%9c<$mwc(?Ej(ZwA3gT%uz
zNM4-DxPH&LPnRq8ZekR0UQ~EGO~rg>T5#OWzxgAgi-*5$I{Du@<g=kKX5BM9D-au=
z8(mBpe)_DCLi%9P>&W){(yhy&D+8`xzbev!^e!F#wy5TJSJvIbzc}KaQCWc|q<g94
z`LpK)SJK|EWF06i^R8RbMsc6ik<v3#DBj>e%VO?Lf1}ndajTO$Q5tC<o?9(7A{Bx;
z5~os4T(QAJ{L_(-Qjd~m_3+&3A|roFk}PmE9-|;>QS{GA`o%U+M6fu;Gb{ZOG!t+>
zq2dtvYuMa$gmtU1WiozSz71&t0f)A6kvZ>~_Rfn|tX_J}AC@vQMW=maEtb5DcV$^H
zXm2{&@om2RU`vXOa_#fQ^OuV{cu~<+<K82WV01>N0EN6Fs-W$~y?6OQR#@eO<$9T-
zi%B}_+bGvj%}N*$)83-+#k(XU@3Jb>>x%~m5HIELQuvip4l^%&^N{jSP_OmYNjl43
z0*iG5V9#P+y;9+)@loYV=N`*f9^%`eaMSEV;UW`~Ws$gh6)ts@EVmx-U0J*_`RH)6
zj`vZV73zK-uJdvBb$Gp_y)K(n%5ba*yx!3k3VbDW2EP4f2JbKhekNRU4OuZj5`muy
zm-v{SwT>4@6OaifG??}_ln}@HvA{Rql1e!LgK2L)CHxx#-+UWt;*U%{sJq(*ekPp3
zK@ZP&Hwk?4ml0Rc5z0t|R|(WixQst14VMq^6{wkTi9ap_e~Q4*giCzZ!s$njz|Vve
zE9l^37wb4F<j;f?E$HYs%_*Ya2>eXA#Mf^RQuvPx{7ksSkE9UQ-TeYT6VBkE@BpX~
z)#Z}{e^NS7Jq1N?B|T`Jz!#-EJpfNZ=h6(=2Lyg5oQT1UH+=9hBlORjB=ZOg4|eJB
zw+sA&bf9_)CVPOX;1L3!HD=}!6dvNz;jaq$^;@9yu%PIDq{F%dK3lKMBPcwurNbW+
z_(kbJ^%N8>T6)mk0-r5K<`ERHH`3u-1wLPUWFA4`kt`j)Qs9@R1JzSdco0hux>n%7
zGaZ=3XAPfzED-w7gcB<$T7h)@T!9}=2dbx_!<Hib2nqa5II)7xf^=j&9TW0r!X^F{
z8TdaJ_?htU2zX@%zKrL}4EP-aKNG%Lz^}@{uM_b1WWb*haM3cSg?&@Nm!!e?@Fbc>
zbB&JZdjcLu6OtVmlEfEdCOqAi<-InDB`!OVYNzTH<qkwRDj7@argM-t`~l*tzHSQJ
zaUMmJ=@rjSKJh<<CMr9SY6rKg$VT|^?MCEY@w4XllIOQ*GDine`J!v6JE$L1aCLtf
zx)j-gR67eX#Bn{~Uij}qdb0zmc6PGDuLNOsKxC$X==}OFbe0_u#xCG@EBxC5_lo~p
z$XYM>Bp>`5ANV(X^5u`<pB+fG%X^hPxB2M*Uwra$EfyPi$=L-{%MPU4@ds7><Dg<M
z{A_`rYR5G`*Q{g*QtfqA#Zxcfsdl+r!9Rn@z2YzO;rrh{`YA&s*@09$zFWorBOg6*
z-FS8&qOhd@F+Nm^@;fOB*Y@yV&|7vuTTN;{gMDjH`C$*)flHI|RI0l#``Gi(g*<sl
z{Ke`nCgNdjAP*hSdYJO)z<V?}*;0N-l#8iJxW@mqNLQ+ztyUOe0iT}4->dFsLC)+z
zQ4$_gcl^dFJCJH0b&lR5>><?-YW(9uo>Y6M<@o^eH#?AO*Vd`{KL-3sfmHjY@q<`k
z<fZ4`KIQJ1Pq}CcG5)CHmh%7GgZL)}<|W}er@sU_M+dYNun&dtgik(R=u^HrP<49A
zKh&ol_`Oek`;4#$2&E1rQyjShUrU{`&%2N=FFX9MfM?oOnSf{7Po02g=A&ZojDcOG
zw3nKX;~FRvuI+{Rh%$LZ)E)6nxaP<;tc#P_jx$T$YrdK$YQ#gn8b05^58{5hdS0fk
zQxLxiZ&q-d?{)<zU*bpAbBh5dU#=bFahtq2S`Qko>nF`Os_^!!tIhY@3a-;zt)4s8
zRmZR4-&1fcXGA?eqpq5-hM!Pyo9}B1uK6a^vz{l_d^KEukEZ!*n^&JJIhwDA>$P+?
zU#>mmq4_>1ACuqfYQ7pi%fM&8=wqpZYrYzeYCs%}UzceDbbZhGP51<fF63FD?s?Jn
zOneibXW*Oh=#pi}ukDd~Fng6{DxR5uU#sqUG40>v8&x>AJf{6GRXDt8*@$n#7bzUh
zYnyx*D>&tRpStHo)7tu6rf}@^Ua#Pc=l$xQ7p)({H7(&<4}^b!0Ci~j3ICu5;;QAO
zJajdp?M=%`c}#e-qGdc<HU$zFmfOEK06IS6oA8LjA-*Y(nXctVJUU+(Pptv3R`-P0
z8St0^uQ%X34fqNJzT1GC=^Cg!Ixi@XmVr@M8}Y~0Jue!E_$v+gI(1LDDgWID+?4+d
z2Hcdt*npe*Tx`Jo^toE$@Up?cH}!n80XOArH{hn6_Z#pxLQXB4t$&>s!cF~~=`!_y
zrqVURNUy1X)2_74M4hGZSuRX{n&sMzXQ>gtwi$x-y=_0c4SX}-&HOU?K4;+HsP1{`
zQumC%QQh<MYXffP?{ovMWh1ECfSY``E4XggxJI8xi@YTJ2^zjr!6}c<Q-TJnH`7i`
zdG;FdoA750xS8IN0XOYGV!+LOEH>ax>YkUy>fW}8r3%jUn(<#`z(1<)d6{6q8w~hl
z18(By7;r5EK{|fs%Pn{wrSKx^%J#y9YkbOS#&7a9^<d_gsRx~2TMx?=Ut144FKqa9
z1K;FZX~4~LQD?yQJwbkUvfIEn^W|<I_!kVgmYJYD18$bPVgtTP-SaZbfSdAH8*oz|
zofhiH<g4?YdcHx?@-o3Ep8m+W#)#)k$$60>k7-w?Jf{7ad`*0vF58}U{I)%tcKb;q
zU1ojWV!+M(GV^7=!l9m94g9~BJf?n3c@`ORe$bFpmwVce+3$_`;A>K>7Z+naO|P$n
zoAGEp5Z<PVagC^Z!ml>qI^PMu-GJ-zPWYz`c$pE;rww@2fL~+4O*uboz)d-;40uG{
zlkZLgZpQNo18&B%!+=NBJ>#i1;AVPnGT_>7?QgoY9ta<7;9sxq2@f0a?FJlEGRb3~
z0Z+}YIL<)>jwzPp@dpE*nmxw62l(+I-!bx5{Oj>4;bRT>1_OV*0e{edpKrilG~gE+
z@CgC=!1&*0z!w>C^{KrGz0H76H1MA^;FlQi7Y+E^4R|CdAISF|27H+T&o|&Z4fqrT
zzTbdfX2Aboz%Mu8lLyHM@+~yr*BkH|2AuQcJcwT+Z^i#U13uG$|Js0;8}N&ikujdX
zGvJF1_-q5-WWeVb@UIx~3ImQkfop0SYh$IwRjcc2>gvj>8tYfrH0e*I`}^5*iCRTj
zi*=$mG&F8naFew&_q7{}3ab_^oI7vv;;M?d3#+cKc+Y}s7gx+%z)kDL0?n%R8<$s!
z^_j)B4eMTC424BiRcmTi)gv)jsrtHvDJsUA(<-qrv<jOjZ-_C<s`{q*hW<x8Q!Ra6
zc+-M25uKOHK2kFffl6g|L7o{m)H5MfALOU-g@vmdZiv@%Eo?($+Sl-YnO9cZu(mEv
zhZ#^&W4vbh>iWXzSd|-Jv8f8*zRQ?>^S)%wMtr1RDp%O{3%8gnaQm-#4^5RPv$Oxv
z82NWP<X%!#!G!8-k^Iw=qHsF04Q>Yby=_JW{+q)W&8SjDGK=A#Ko-~HwKZ!Pku(Fp
z%$_dn0^8Tu)z4g0zkWSdaFaRx3`_&1Z#H|RzpxbBlCQ1$XnkWt)%sXXV||_E?jJ{a
zl`eZQftuA-bVbk?O|cSKrLu2N48>JS8YFV#+6@Ep{7{ryNZ!zxVwF~=1{7gt#W)ah
z!)6CURyaduhq4pY5Cfr3)hh#`GDMwM)JLAmDq}wVV+fNgoRM_jQMGPEV=BPUh|{wv
z8IK>jM+Mg>4<kK&;(F-2FPRJ__l0UmGLN|ZY|ee_iTT2@2zv<qDD~-@9tfp}<)=KF
z)GTjkH2j)WRn<1tpk-!@?AT6Dsy>KDZ6>}&i8VHS1U0U5^a5bI+4NU29yM7}85@*j
z)OH`?v{@Nh_eQbsNDa)<OwEEbA$~vNyrHpS<2n@RwI5l74k<c;wX3RXW2>rG)Wlb3
z_E2kTZ)7jkv0d2o-g;S$LD7u5`V}=BS0nG(+d+k|Ix-95mNlG4dzx$>8CQewn$xRr
zz6H*RsMiPzt<)7xufK6)9KF{1wHp>Jx$5d`s{m2ytgBBZQAyTY+nw37U%+03Gi~|$
z^=S3q{r=M-mWB3)jWvyR%*lE<B||o|AWIl>cw@Y=US&kmDN$8b-TH>A7+jLAu6Nd{
zt~h!^>SL~2*(CT><wes)4+8bT`c3OM)UT2Gz97E%s#?ePcI4Hx)LaWiUR&ka?4WWL
zVg0OMGb?==d0~}GasT}+`C86`0Y_DsR$(t-Lj6s@SA&a7i!0F<r%P6^`BPYu?BU7p
z5sT0aqy}+z#k!a_o!L<6WcS%AO|_!vbNEIk48g~sj2H_2V~{4%{|tRSX-dyQq{}Y%
zy=OpL{==j*sQYW)nb}f^!pHHw7^W^^#D&I3mJ0!p9lHe!gx&cM13da;#r=*ntuGGs
z&`f>jC5qrG5o2N4B0hOtSbO!g(;+k*9yV5OXvAQ9{leM>(9ra%a*T5^BH7T;NC@Pg
z+%&BSZqAyf6^ei1@oWZMo&hZW3&p?ifi`2N0E_=Z@sGc{X){U%xHQ>#)UMx9C}8p*
zw{_EsO9U$Z5wZ9$6#oKTTr2|dk3jKXDE=jQh5(EILi~dv0W*Y0wj$}5P2LM|p}-dZ
zh4`<VR+y9v$|=MniKh!J@n0zZ^-QTb*);I`A($LhQ*vp<O=|M&`s_5YUM7?T-XD_R
zBMnJH<W1Ci){kl$PCq(70CP;e`TBGlp2U<lHvPYWp0KEemp54gw3e3Qk?DlE;?VQh
zU&LfD`CG|MzRz5&@bzVsy3yAQFzM_i|6YZs*M)0(TmG@2_mY2^l3#x}N%^T`TmBlw
zUrpy~HpzW#)wE<1PFc-^Y`o-;s0iy!WZY9$^WYpbVNnx^`>snRfa`L3P=3za+wy-6
zlki^rw=4eJNo*W8|F44Hi+@v|B-*KH$sel9;QtON$cukS6$+c5{X7ZuUi?F9l3d#v
z`SU%5o&GWay!a1S{3nCPJZ%0mK<~vrqWDi&#N^NS9X9{DAok*~eFFAX{=SWT@}k%K
z*xYRjk9%AGZ-U-S{>4guGyhmdZTVjW%!~gsN`HG1ZXP!O|3#n||1QP9QxQ{tIXG?p
zKM#BJ-=G*hsOa^@=KoXBd-30^mh!eMLh|Qoew+VrAO4e7!S9RzP#^x4QzYZ(4F0rb
zoBw@)dFo&Bk1Be7vD5zr1bC%CGF4JkDnh3J0-QE~zRUFDpQ9S2Zbh#zHh;b=_TnE?
z{5usP`SYEn&A(`rH~-fZ|J{mSUu^!Df!>RMo_cB4qzK8MUqjgZ>2uX9{X2(BLY;pq
z8o^87^GYAhUi|lZ@Q(oB=06wZ%!_|aA@)^&%m%#|{|V~T2HG4CrhgJnoBz+SKHrP~
z28Fnc#KvLk|0kgL;y+#SuU53=KN+XZe=73Xi~kb}u~O0Ni_QNXp!edx(<A+tdhmY+
z%)R*Mpj`7<EHBA_oBxkN?8U!b@t>|Jnf^SScKVn5q`yw_?<@Tu_DTP9iod2Oe^!Y$
z|8M%V-}m>E|2KTv?}&OiZQ38J1e<@WkNqE4{HsA@9=86s``CY(;@_l*nSQFo<{$Lo
zzcfn{?v<D1zs>*8KJD*=ihsMJB!Ak1&7V&GyzK9|;vY+LmNz#4Lg0DX-!f%*X8Maf
z_|NmP|LfV=!=cxi$S285-}9>Xc!`=o+&`)KoAzG}xSjrwAfLU`-=z5WmHtN1d!=75
zf-uw1ud!_Yzw@#GF2%pnN|&wwBR=-uq!wYA_Fv|~|5|ivz0#kjD*knS@V^@LUg_Vd
z_?!BFrw9L!!+tP?%Q!mKq8#1+(0)IGQ>R~Fxt>GFk8)rhcPqla^tWE=&#~w`mHazZ
zq~y<aBzFG!$^V3h{5wFe<<{3mMCc`dmy&<6;;%27PCu^!y?|NrFJ@uG(Jn8d{f*+j
zzw$rlA%7d_HGh453H=l=`KQA!cuba;<iDoVfZu^$z%2PsDEUqMnFk_U{!$Do$X}uB
zXq}~s{|6Xo9QsjTPokXh9@TK#@!$ygsQKwY`}qXuDSuQWsB4~D>|~a|D-fpXHT+Ih
z{%rpH75_>rUQMsTJAKMuRPk?Dh_qkErRg>Qa@ZMRHh(eLH1KgN4o$D0yL{x=^m!Ul
zU2XdR^pU??$zQ4HDF0PBHNBR91qQ`l`IiSc4{bm4DMhcJYk=pKf76R4MzumD|M%du
z`Tqz2FQ59$6n{mYylA`Afc>P$gDt0~zgHuwtESi2Z=?Ry_a^GA{p9~;<Ui@H;^&-D
z^aoKtnukumhH*btFa7OQ`qO^BsJ|sRHNDQi5y*d=H{<SB^-oll1Il={2R%F>#!?>j
z`}V0{JiW9yB98w1)ZeS>V#*ceAO6pS*0itO+(p4-A^7AC!yi1-Cw!V0oUC~IXt1DT
zcsQ#q-yPO=`-15HM_lJ<e&LQiErl(6!lzC>?6}bb+An)<xAV~RCC<|J&eoqSya4fh
zVecP@Bff*-U;MG9^T;1VHy`|b=;ReopLa|6^XPI2fBIR@d54Y$!yTUjuipo!b*u}I
zXuHiF**5x$=>95q^wHb4ernIKTif;w2d|ZG_|R2|_sWxVKZE4#ybXTWr)^rff3G{D
z?e;+Pl266g>>nBW(VkQ8h@-XtcWUYHZW;0UTxZ15=IPGT2Sz))9yt~`cKFYymaZvo
zUh<C>!KXBC@K2|f{$AjYJc>T|(yyN%eCkK}&aP3RAMeQxj5r$XIkj};$3`M9gu|2N
z*GD5fY=oaM!Y@O(i*WEu(!XkiPepi7Af5gdBYX<Nk09Knf7u8xK=@M#Ki`P|xDlR@
z@W-wAUoyh;5dM%w|3@SI9SFbA;(yEtzZBu0v*Q1Q5&m|Bw_5bSH^L_){6>ra?~L$E
z5dHxx{I^E<B!s`$;{T!%J`v&N7X48pJc96igpW4#_kt0gi|~n7{6~!NixD2S;_o)X
z--hrWH$DFUHNr1K_+f;b`S%+m{6d63itveseE(yFUx4t3toVOzgrAS_1j54x{jZGh
z2?+n3MgP1JJ|5w_Ec(Mn_&9`bwdlKy@UaN5LAWXZFOBdVgfB$6ng0Ja!p9)I+=~Cd
zjPPuPPqgTNVT6xH`1uGo)Bm4F_$Y*jt@wX#gpWk{F(+NV|1iQwAp8iz&G?@)!p}qa
zQx^TtjPT(IKVXGFYlII&cmm<3eg4!4&qDZp7XN3A@G!!6S@cgE;UR=?viSeR2p@{@
z8?E@CGQx)-`~w#KlScSpgfF!C|JVp0gzyS0{vR3P*l*?Qg%<q}jc~M4U(dJbpD@DV
zmw#mFhkICmvmLnP5Zi(CKL5bN;4ZcW6_E8kgV7c|>KqG=ZQ1j}&>efuyJgtt*Z%nw
zKb6?cmXU2a`;zQ7a0(OMWAWaEW4tjqiOBCE_}=O5IP-B%!Ff5(5}aJa&vDi~obSfD
z5a%^Guf@sl%xiGg<GcaqDx7O@-iUJx&TTkbakk;S6X#tx@4@+Hod1CH0i6GY^I@Ei
z;CvM4zv28o&Zlv*kMWn1cN2KoGJhH{FS!$do3eik&$j$e0p`33eHrILY~2?eH53n~
zZ_%4mzD1e5-VQI{nAj@^2dy#l@bZnxZ{*UyT1wFcGv09HyCH#(2~g{hzBP1DHx)Qc
z;G@HC9h_<~eUu4307i9;vT*sBqhS1&&`h1yBjqyTO$I*8r9N&}H^evL`xV@d|Jw$>
z8UJt!ii6+inW@urcl<U7ztkZX$2!(RReNn}e;3o>Q<k+@VPCbbF^)C*Ycf_n%6O7%
z<m{zv#`?ov*1A-^d(ky>D;8B%U5!O9MeEmKO^al>o(rmyD;WD3!^}8VeAU*27OO?l
zcKqYw5v&%mM}sNV4dm_?Ae;H5Y4zMD_X9K!>rvzxVYY=wO(Nr7%;Ol(tk-*^*LJQ+
zZ2C(P;5D|~uZ*l+5psCObm|hP%fan{k-t5@T&(Q16Jh3I^Zzjdz34|NMx7=x?rnO$
z@AaA+cv1^$(UX^XoQDU(Y-`Z;_nOEGmmnPv{h;W3!u8P*)_3Vw8+Sc|3A6RLPSHox
z$&>om;I+8%%D-whvN&`;G5?sQS}hv>almZe067mT{@CwI9J~-@)5jaun^OakzW3Xk
zUMz9?KR3`lU&_G$sJM;7Ka3D;Cm!{FU;1@`bBVyoEK}y5F)szNf8HSH#xA@zo%7n9
z8}G-p8+#JzJ!TL^a_>3lZReG)-1lwa)t_2&<URk`$bICZgQE|G|KRS|`_OU!y4>5+
z_m0!^7tq@qwr8A~u3up<67CUF5sD^|hTWQP4Eu`cwAuUT^p}P@F?osod&GVt>3Yl9
zOKLLqN5UQ`a_<tiVC-P$sn}QNC9qFP0r#Q`ZQ6KZ(x#33xev<2L!74`8R9(To;roS
z$n1Sk()V3a@pWwcF89s}CHFf^+oS5zXip5ha}>`A_Rf(!H-P5`!4v-Up1RkEr`svx
zmT8y!|H1OaUVe;=I@a?`CpUj9(Stp-()M!0-Z`P-Xiw?Q(a%ucpAA93KM*>ak8wt*
zXUo%J=g)WKy5o;lPmA`1w%)bpR3Lmb?7Vizgu>Q6V_&-EX}yOV3i-ZGMbVz)h@*O%
z(=#VH;ph)AmdFE6M<A!IIS^_)9Ly~UN1R=A+^nPdTX*bvAz0jz?`E~-xuHX$W4GK9
zz?hfvHkCR(DDycRezPDkCpi9S^N4Y6dE4&V6D#80GxM<zo!tMeN9^hKZ(>ic*roIH
zQ5O`=aYHL(lbi$h$>j#3{N-X#s6S%wLa7TM9Yno#5WDq?1a&}NP!FaK&W8?4EFCnx
zOX=X9PET&|e4&HTY3N|nT&08M?@r_@9fYWZcby3xd<QyovG1JROD)_!Kk-s9P{950
zn16W~-{m5Y!mxpbNOu;}54|33z8HJSZEe}Zun=sZ6myu5{_z$Ln|60%NY!HGK@0L=
zBF3UElcGJ3zVflBn=j^GRiO?)+{3VyR+NS2Nlwpa3!EOxumk+ww<-U`4#aWoru_Xa
zmon{hAv^c@k$br@KA!g8K_QfBv<G626xXye)&)E4t&CNpyfV&e@E2F`7gv-4aeXK9
zc!2v1CF|K7$Tc~70OOKl-Q(}QAmq9QwAoO^IZy+e)n%1@DE}O|Ywkv#xH(SG3&4+H
zKhTBFtxK|Q8I<n~YM#w~$-*J*KZ$z4*}83(vvoVpkK_CV&QH!lJg5`Djr|ghy)Rkj
z^Ju4TM=A95GUCs5#~q!EJm^&US&covSRZsE?<h+b_St#`&*)?2yb{bs9iH2fD2?{C
zpv==YzRU7<OxnV$z^jHmpk2y&m3VW3hjL-#oltm;{{-+_vZ4p}Lif!>I%jXiwLQx@
zuowG+GQ7PY+C%%`o|?-c=U$aJdyzN)1luAGWoiM=Kf{J7V>|5V5!ei2n490%4Okd5
z(yoTT{IRD)u(7Y<{>pg#L_6?S#`90K7R*n44RPkjSMR5t$KzA?*J94Q9cgVvTFL);
zq;;>d1*ZR-sPCB0cGO#sppGJp?a2$22Y3mbSAy@b_{tMg;sqx<5Pl_icL28y_f_t&
zqd~MM?a)&z^pxZQJ7c=2yZxw7sH1k&3y+`<AdKyXP7~8|Kk(ZTwqx466HHSs;@yEX
zG43X8NzxUZAj;oI#Qk`2f0MW$C+=So_uNBE?#XtdiskHk?T{hIhUqq1?_HS}iXPy8
zfUG|vgRtkWvdM{~q9-T9Hk*-;_l|RVwq`pgnWp8pes5Owt&h!eVZXQDx_wsjt=nc*
zU(h)_23^(g`GV%zHH6*z{aG#0ZwzVMf@=-nEzrdloXxj>a#jsaT^1>m-v9H}F|Yw^
zztXXgqZ|9rX*o;zj6Losdl)BW&c})89z6Hpxd+cZdBgFHGc+8}IP)UF$H_9Ak24SD
znPoaO**VaKvXzgkZWm=+FZC<;r<3=@qaI?gzgC<ru;Dn)7;LW<C+g3hIL;Vsmv+y(
zFOD<Da)7f1wjIYweYN7Gj^a3DuqWDS3v4TnGe)~*IfZS;aZ-=1IH|)p&KT^7HrE2X
ziQ|mX2648)&f++!FTG#iVc5NHf4P_Kt7B68PBJYa>I7{t^}@W6&le}3vrwNM!G;Ev
zZnPXei_6g-6lgo@Yo9js<2S&o#G15i$uuzejebOYO$Ay0s)q~i=)Z_@PYBmhI3qZt
zIGb@M2UHvwSqKjTbR|yutTE#ODDBxKV_0v8dzMcMQa?Q0k1lcCn=f`R9G)w5rpJIB
z8}cZ|IaS;#zkB}sJ?Slau$zxue^RID#MPW%#12Dxud~U(xlQ4bSNdK)*C+RPBHq4!
z;4xjlP<VsXm9&2_?$ddswy9z|C(r<JEaP9seqBgnaw{mQmr8}d!4p5Q)Fhy6`nwjb
zUy*(lM?}Vv+!GF)DM>W}&Q8TXg(rL~$vx5*n|q{vZqygE@5#vu+;8rZ_8+Oe$d11b
zdgcxGKo!R`{5N%z+!GF*m45V|aCtyot>|u+baJmLwXaj4F14`}b#b@C<-K1%F|1SJ
zQ7+&mb;g~<v~5w}-3qUgcsO`{O~ID&D)+X_+-oj)Q6RN}m)vYF{aLQ-tyB|zyBWDI
z8#-;6N7tKHl_7Y8!o8XKVDE7!ceo2yV#C1X7I!l1M7exW(K1auc>SIS>^TL~<(RtC
z`<wNqQ;Nj3Tr+U?b$HGB-!qm}in$em*PMTqz&B^VQ$${K{-pxno)MKa!Q>27Dvt96
zK5OjEBbYW@F2jGF!z)@#k0Y4$hMfw0RN(7UoPzT%=%~dr2Kb8tKNBwTb*`oe)(HGe
zxWvy+A*#D81%4)6;*ZI|e}}-&giCy(yfm7-1Sk_O@j1*-KRzH(GvUMvI_IY&<7v9U
z&xA{S)5Du29V+lM;S&FC63O`gZ;{?ixWvb7g>`&O;Ag@m{zMBK^_IZTgiHKOGVpH@
z_?d8t|Mm?0`2s%^F7e-yfj?2;XTl|Zeg^(7q0daX#GjIZf33jJgiHL(GVluoekNSv
zPs_k}1%4)6;`6O_`th7dZzh~rUi)D^Ebv+5WgcGpVQm-q#hJ)}1k*g}Nt7CaUy_0U
zE&-pJ0Vg0Rwy94Kx=`SkrvvfSCiKIV-RZ}B1f0Ev^kcGs&rS#8>HkFh@5+GxM8Gi<
zVjW)>@TdiKoR0~3MF#vs0zNkbUMAr4GT>tce0~P}<3j!g8Sr-t_!SxOiv|4M8Ss}y
z{JJ-g3VuSs7p4H}E+OC?9i$&k0)ACG5Kr$D@I@K$A_0F-27IJ|U!4KpBILg&170EE
zi!<O81pK`j@ZXF0mt?^IUBIu+fPY!QmuA2l1^j&(@M{G8{TcA70)AZvJS^a%cbyRy
zOxw{w25%DS`alLQ0l~DL1tiMf34DH?n0{mn_=nPg>M7`aI0Jq}$e9Tb3V2lp{(2FA
zO$HqEW@&2-bdTX4bY;wa&^9Q_p9AjI>feN}lGlD=^`OfRr208^DxMO6yy6*+KCc&i
z8Sz!W*i6KAgS_!4`ozB*k!J@|{itFUSu464UVLvJ$$f=V^;n+5KM8ntKx<2mLm9Nm
zhwnp>Jv)%<UqNhf%=Jm{C?I49QW8y8_!r>nrH9$Wh@a|TX$#&j<V^LWbUyw*?491n
zeBl2e>_ixmkVL2ac>z!LqasSqWneivpruH?1HYYiqHxU1mxfaQRR2o*=e^NKpLIU@
zUg-mmi}+LhF&+OrVdtrS*E33}n?-)5`d4CXh_DJ_52<n*QTTH(wD3w-y^s9=3H)rl
z+|q~6-$$XJ>_DpDrR{Sn5VHes*XYUpU~cf?`)TB3b|BTi5@ShFuk?`z+2|?%QV~yn
zlJ9PHcfNq9`d4Dih_IV|^7r=$%MPUaS6Wy12zaU=rQtt?oY{fP6}QxyfIUd>BxAob
zt+&fiq(=u*{gz5a`FkIE?mEvqy<B^uWk@o|%{!qWFZd*3=c)b-%ugJ@M^PMY?2o45
zR|<HlKcnG$h5V`hjD}A}l`%RHm676K!}%TC=s-mV{0RY{n*pyC@Oc^VeL|l38Sqnr
z?}7~Y5Y#iH1F8OumZt>z936Of2L36*SLa4b{_92j3p4QlUBFZQ86E$g(TqRUpV9Eq
zLjFY=@jNT=Q~eo@f0>Zy>J0o&k*;ep;H?6_I0OEQfT#L1I{wu{4@)xeKO@q0Z3cX$
z$oHig@IQ)p-j@N#i&y9&)t}LPw+KC?`ZF3n272&n@8-dnz1pwyP`<p{sbBfjhgv|c
z2`teMxN81fLukUMDjcq<tT*s=J!kKiQKoQo{HS)sp-Y^OU&Es+++L%oTcY0f7fZGB
z>HCYB@CiozsoEy>Ju>An;dutW8IRTj@lE)2g-<=i)IBd+58PiYZosu3m|l}_RN>h2
z%vW&YuQcM(C6xFkT$ijei?1#blyj94kG5pSZ>CG@-%juKik9)LHsaBGCVZ^{zewFP
z{s!E`jKvXASH^F`&3JB9IJ^ur9!*NSU9TT-)%+=^36Cfo;%_wYC#!qnHyLm<-!~cX
zkh*6)CccJK4>ue5!___YV8U}0oP2LF@Ru3zEe8B62E5sT|3Tf8?*|R|adl6=CS1Ir
zLKyjOHSk{#-|LNdOui=EkMCkdOL@%nYF*jzCk%X3{wIClTF=za$AL3S;Z0Ci>c@ne
z@_a(!@M7xclLow6-BV5zuImaL-lXtpKPJAGi}>4(_#+0sX}8lAocLP}e0|IGqUlJc
zSL;F7x0;`>e<)9zCdSo_|8@f&Rrlm;!gXC?!*~1O?=|3`Qun-cs(Z#`mb>Q+xT&{a
z`@olho(JPG@xSc@ACC6a3t#UKV#hPt2S2LdcK(*h=!HDm1_-*%2Y$B!H}zoF119`_
z1K+e;{r-^h?@~DCg?3V90CYVz&VmnDI5u3{5#u-8!HB}A9!$H{thj&8XYruv^_6fl
zo(YP8@H;gzt`P%XYryji_+18E+cV?Qx@B;gf&V!JKWf1147e$0qX9SN++e^X>YjY}
z7;rP5?FQV8r^SF@r0(r+G<3QMA8g?3`iJnL27IRxkM5%pwBLZEE1f*L)E(nN7dUww
zH{c_aP_*N~<3W6Mb(6;;1CAkD^3dZ{;*U*2u?WS$A8)|-8}RcD_z44^npHsls`AMA
zQ?m-#57B_<8u5I=fKN2w-!tHs81NSj_}dM*sC@BEzV9&Li&!b+AUt2*ivK19KE;6V
zGvJpQ@Ph{Yas&Pg172vr&HaF87;t#fg>Q5?x|Ocwmt#*D;Rlx664b3;+;3O=WmxA^
z1y8f}#qqV+!KMF%g)=i&2+_fRpMH;%3}<k&3+^HUAM4BG8>-+{n@-Tz$Ls1F;gnmX
zYk)DrF*sv{GJ1(nx|J@R(TEK;@I{k!!>u=)N&hIS7x&ZH4kRP}dKZ)aMv_!TDSU{-
zhj0HkNJvpOiChO|Z=RxUXW3$Nj9v+fOdsU~*-IlS*=Z5Yq%mMmnLY(fvFU3IiX>(-
z?!G8W#Rf0+eQuqh@CLH6MWL733}jP_WNJ=}D5-+}?Pjs2ehrFK#-<k1yoE>cst@+&
zec!8wSWvjWf3ExcAnt{4Qb#50KGM)ww;;YiI)c}H`$ZbJNC&b*L~)hh4iV`!gYVaj
zsT9;=Z-T}JD_OdGsf?`67y7@oMBfr{_mUgp*slOPRG_L^j-4?UEWY9<Ivy{nze()w
zfZKR-M+aU1_ad!V8R+*u6ZjgnuAxfp{?u<OOF{kIokFLjZ!Kv{Q+pl^fKb_)Gp+CP
zl(dS%lJ%R`)>eHaz99zp@OANq1<Mx{7O!ipzbW3ZalPEbE^RxD)7|1?MPq%v!*6jL
zY8@;P7T5ka8y^1uz4p2oXqoUx{eab8y#6CK>lQ45<qn*5O~Xy~r$;)I`wFgD!wpf$
zxi?L!wnc8s(LY?d2S_qS!k&=v_<9=Kq%3`ZFFOr*70CX5cAYfI(&h2BHQ08sUmt5H
zsb<9Ln+8hKuyMlxNy^v98a}eFA&#AB2GT#}7ICcdlJ(wtvE72I^#+zu(eR>AIzY)w
z>l;=KoNDF`4Gru750shgHV=@hq%nR&Y@n=)SJ$r?D9wz9+JTaku3r^j_mO^j5J(#3
zOld9yC7V&RZrvNQXH9?HA0&k@imx4D29}{*)HklJSv^3ynb<#N!}5(Q21qsoJEaYf
zq<rJLb@h$47^4o5u#7p$u`TJiXI%g5#H2!B2dVCD>nH}&D_FC9BN`d*o26QUfk&d*
zqZvlCE8<GqgR9r}Cz<|aEZAbmGnRoi-^mE&_BU098T;ILZF7^c%gq@`kBs7su^&)5
zEiA05Te)%lh86Mp)pg9<zFnLov!rnPiq#D@r$t)M(r`LFOIF02ut(~^1TEQsIhNW1
z5*1EgUmM4`BEBL%P*UuuH&BxD<qZw1YgVs|)j&+Sqnv+7DVYQ4Fg3x&Onp;TAG<}R
zO{1V7a^op;AH3INg7j@uDxBMti2q`_(UbVk*#D_SZ1+?wH+>TS8GAvMh^?QB<pxmV
zzX<=>MN0e&K#AP=N&It<sJdxIz3&lKA~%B)|1-qyP#HT#m542&isi;oVvned{h~_6
z9#JLYzgX@UB{qyI693#m3j03^bzs-1x@jfizgYZx?kNSmiG8F>#DB5)pCSAL6^Vbp
zU8d@$&BV@9pceln;=fq@zfrqSInKY}#g3X9HfMjGsG2<fk~#Sf3`|d_9e(@QMANWR
z4}(&-;_iAx$T){s@Thv$@0WD2O@AGT3Dfu*Z`397PQM4K#Us;+<cdSTPuYPNpyZEb
zIcdjY^%O~iX1<rY3xa#ezfRGa?|cZd<-Y^;Uh+qk{QA8N<)@Bp`T35{i~p|y=TRpw
z$$y(a*8q6&e^T+kn~~!nfAY5Ze`=IBfBijUF^P@C=HCi>Fa9z0(xg(+l0TMIW$>q;
zWUut=_eXv4|0C$V_&?~upSEbH|7&>9<Hi3$r8hgh_VZUk@5TRw;;-$L>BrKv4E|Xl
z_TsO<@th1A^RW3327s`riG=%6mrB5N1t))GRR;f=cq!<`|2dWZWr|*3Z2sTy$-n8)
z3y;3a&jUXB7xj>z?-%X-yAN`D$^R9_zpwh|3n2E=-#W$L%s*D8HveDv@PAP8kATKJ
zZ2kSrhd+D{h{G&Dd|ztw{{mhDd!_$L#b2+#)-u@q?*hG7`kz$%n-n4Khwo)={<S{*
zp9xCBzWD#W5C6({NP3e$-~ZbDXAkjC|8pv#&&X(!|91MzK<}0QPQ|}kQ8N8}&usI*
z33~R@|NVm{p<eH#q7l6GJ+C){-iv=EPhzzzWb)_xY@7d2p=U4tc}N$J$?}r?x6}V5
z=)L$KRQ%2QV<KX)`F{)P^y0rr@$akt{%6p8@js#Xo8|8k5B`?|=Ec8R@vls#T;AB}
zXPUhDk5Vu3H9hsuD&0<hD;8UL@js~e>+b<1cgaiN^ST}MUi_CS{)-to4)Ui-+WfEf
z;U58<$8LE^{@dwa=))iWd&FVtpCZ}($N2Eyr}*o3Tnk|HAK}BlQ}H*;Ki5y#{Eq<U
zrT^(_u?yQg^RW4IEs+;}w4d}phCp8Qixs`rpO(Sq{{zqy7S#yqTE@iUsFW9x|Ci(5
zPJaW+kGUR4p*u|qsM|l<57${~{`$H*sN`4eg{F@w`6p|Dx@tNN{xs+X%%X2r@|*QX
z5r}O0>(HoDe+)B^+Z2CuZ4ASS%R^tA!JPLHBkkaK20S!B`IPy*8T6Dtsu9%nK_$P=
zKkBapr;bm<Bk0t6@js~eS6cCEdJVo1^j`cAD*o*Xk^E=k)byJFw?Rypo&HfO<2AmD
zCP}ZK8&v<zk3LT$s;eE}N}vAQx~Y<&QqfWVcjDCaTK)^rsiXcZ^Kr_Q{M3zk*w6oq
zfu9%stbWqZ^`VdUlm2d%|F-<|`$>Nh1_fU7SN4;BC-A)J7xk0=dp`7w`$_*HANr;J
zq`%)s|I7MG|EiDvuJ0%PpMCPLx}WryVezDw{_FZl|0?jj=wtn)U+R<o)%~RZS0DOy
z{iMGG?TnZF8~RBf_R0UIe$r#F2~Ykv_mlqZ!1I#7xu5j=QO|qPZ|^7lRv-G7e$xNW
zhyJ#H(%1ReFY6T^c71C<xB1x5?taoQ_bGq;?y^7pU+|It3;m=&<ime&Kj}Z>W4~YN
zC;hc(|JWwl?QeTO>5I|->y2Kww^Ey__E$gmAVXgdeX&pfLCYV}jMUYZ=W?I^!~Us~
z!0bQrYj91k`wvfI{($Ar*55&;KZcoyZNIAk@bVG=xS}^{d2h#eHR%D@a%y}{f3F6p
ztESi2uOk2Sy@?uwU3(oi?$uBTVRrvR)6>6!d1(D<*g^n^64d~8?N<8N<5%|IYH(_L
zt^e-=VDn}aEo%IsuauE-*z}i|mqyH^Zy)icGiC~s0r-f2EG1zSGBCA&3JOiaKkvUL
z`tpBi`!~*Y+@sCd%ZEOEyWpdozO@nQZh4>6!TXjgqVTyqrla+a=z$9O0*_q*pPqNX
zS1`jajlx&yn2wrB(F3tdC5+FeFIDJC`h?%^oB&OloH~p?f<rP~@YX)uC4Ra;bov=S
z4j<6;zuNwZ=!sAm{%zq?9e&m=-{_Ph<y)O`xsjBg^N<tm37!}2sdjRo<^7=1@Efh~
z$ENPx^P@cx!oO0H5PpN<zcd10<H9#7=-ju-a8v)`y%q3<?R3yraToCO;a4|40{+bD
z{~CUWBk)~{@qA7!Aaxtcmubiy<P=5`9{*BBg1C>uXE1Txw@W;&7s{jWg&az@z2FrF
zuQ2?}I^dC%5%HU8s0LnIIN}%K)X7AtlW;`JK>5QbtIFoM6IX4;eaMP?;zjuU`?6?H
z6f$WVCC5`jj$>72NjaS66mH(U1btG|k9#NLjUb)^$ewk+(=!o%T}cymqdknDKEEfG
zNFE~J3Z;yu&Z%z)`KxUz7Jv>oZ3N%I)dBZ`YWNN|b(UThq|af}Pc-6aQE^nmmvl4e
ztFv&;!gU0$BbsNMcJ37)<6@kYgK^MC`--Pm-@}MY`yHlF-BLVv!3Qw?1k(pG`Sj^4
zI19dcakgZk9OI0Qz%$Mk*e7i?mW^keE!lX+83UhIoGtLX9LE{E0M9sEF2FNR+xPH*
zeEklGKjcRzw$Y}T-)_iF1V_pH&;%7WL4|D(Bmx)7d*bqh5B3h%X}-hbUibuNIK%w*
zET|gf9BYGr`s2Ys$1A8$Shvvs_XOv`Y;=cm;8*=nYhcVFQI3P-I`ST(-}(th$3JxU
zp67$(JN_duzKuF>hyGp(p5GCAbY@#Sbof$WOxu<~j_})mAIq{6I{M|4@XamC``8Y%
zyzhnW&qTf2InF8L{sQDL>rn4K3LKOnnWj{I&oUwEP?TfGo%1Z~5ys2BWqrVWWqCL4
zKNZin6R%=FhgYr(z?Xk8aT4}Ky`Vp_6#o2C*SgS+1Ks3ypo;^YIEUhau|g+@Vb3$6
z6Y7F`I0(Dg4V}Ck7~2+d$G07XeLNBvbF=_$Oy{I|iCpL*h&t_{(8IWnt$}EH2<2MK
z+y$AjPsJ|mkFkq%tAL9ZFNeHo*V=#ht76ZF?}<GdQt3$PBM<sOJ%GI?{{BS%AoxNb
z<n$ayTEels6Vw&qW1LVM^-Q@#(CHSmYcaHIrjE?|Mb|6TbND{ivF?f3$DBlx{%X*F
zDV?7AgeIEhKS%Qofv-~`VP^cI{*t&JZD1;GIv&bjJy+H(Oox`6yv(|2N+g=dnjB4p
zpo4szl}LMBrN7t-3mq^YnGUw~ahyBQ)~~|Jw!RhTO6a8xr&-_iR!=c4tOr;p;ayL;
z$Pe(0KxX>$ZgHLBBM5(CDE;|o9eou0F}m)>MP7cvnI78U%h+4Ona?&rxJ}+YHtfu7
zfgLd~xi3g)a<n`aij<;F5%sN$eh2HuiO6rJjW*0@kxoU|0=lti>tDt`1Jl5#UD#!+
ze3lG$_O*Xiw)=-+o5^saoT1aXRO2)QCxmhqa?46boAD|9&_&TZVs6>Y$5H?0ZHk>h
zSt`}Ek=ITwrT=}_9~)mgCH6hgVR$#}$(u5z=>WQQ2j>>qX$(yidqv#Hy&_@(r+grF
zv}vQXJyFj<=faMmJ1hp-7e@T80jDIi0C_I_|I0l(VoJ|3=-C0TuwC@0ba|)z8mF3h
zNcrLWo$_lqX~Up>9D6S$`Mf<^UKz+MC7u&-W}3JI<zto|me&aSF@9-AufHwgu&<da
zZ@zUgbkrNZ-t&MuVg01_N}4eA5QmGni6|2bl>O88yOizg^v0o^eCR$g)G5hvorkxg
z9Vr98(6j1OYTRTVsJ>z~bk8;culFRrVbjgrbLCRh*Vw0GFYwrgw4yG@0IfU({1)V^
zEBa+Q9cKNFyjY681`?vbJH+V;LkICdxGjSG3%9dBnRPURJ)s%Sz9Gx*&(Y>Bgxsv>
zk6`=}n-)z>MY<Wb1^b({x~&(iL^`iTIxF080qunO&O9*dBfxTGofJsCd?ELE8I(A=
z&Dr(7C;#rJ)Gh0fcGNjt^VnY+)A2lbwQtKk@yNW~{fw`BUbMU&j#9P0$fx@fqb|X{
zu1kpXl^M=ch@<0wP<K++THsUfH94?zj4Np4U5eg}vwdFGe&+8)H&j5rlqs>T3j1t?
zkFq?-bj`<}85p}<n7%i{8A;<{D~&-Tjkved_&-Pk)0vS*jF&_j75x#^<soOM*yHCm
zq(h|B*|`MM0y%RgMvom;up_5Fy(EPEZHL}bXKccJM-Fj$ABSG^q04I6%wJVUXUYy#
zU3WIx!NE7w4j#1Z;K3!bo_TNy`_kGL!surkws63(g#&LnTfjWQSz9NZDSOv-0_qIb
zZD&=zcc#*a`H{DLKC)kTwzgkqDj!vU=WMK-&saZ1^#R|~X~f*)Ti#YN-}#nLW62wn
zMsqHN{d2Fe7AA4TSc`2|4(5U`L7$Z4tqAtUGutse-s0Gdc;^Gp9#`#E<0X!7axlKa
zYrVAb*m3M#1{n%FF{aPQxCeXh6~r-C^6T$l&bYuF=Ntsh%NR46>EhUiV;suLxTBDv
z8RL9=jMUql4d*^NFQDiAICn#RvER=zX}9X<yVkr4aVp&AB_Y+n!8}WWo@bGB(K#4v
zjp_JRaGV(L3~cTpb8gbiL(bcBzfmnC=MQ4Y8_p$h-26%~DCUg1tZ_5*jB_IG7&qg)
znPZ0r<DJV8&P9zs+JXCLFLtu+e2XERd$-~{ho!n-W9NM}^zJvNu135ejG3`V=Bh5v
z=U~1!J_+-37z@Xc{~Y(&V`T?(LVB!B-dEvS+6&%SA$={d1@@~6%R-vxV7y%Ewp{QC
z^4`y$um|w5s~{(Fq<zSJ8qGP?O2qrWu(4A?_o<VcjXgi-IlJDE@ic6><Djq=SG;#P
z9Xo-&8Fs>VcN~+C6*j`SIiBR0_)*BJ=Y6?fAY{^eVeih^gW0Eiv%GRHr4qX0JR-|W
zZ}TZfU>6U=29k3luVXGH0(+79K6Vx7Ray(?iFuH{NEhFC?ZCWBULW%+tSkDOSLysy
z%2rq&eun&`U2tB7`AK^i1|8_}HSIkM<%KpAgUwW^`3PwfsrROw-+HUp8)4|-NFdb)
zP;X{A8JO-e%adO{q}!9$*G`qN&Ou%D6zd&b=9x#lXZyfB9Y}q{dFe3fn>na&BAl1g
z^%rcA^;ZJ*kJtR%M9xFA-ZyOizhO&$b)Ey;WF5wLcp=EnI_V+c)8@X8Yg$~8Aq-qu
zhdDj}fbjm5VY6Pp3_MWp7qH&<D#N;NZyAL7Xy*@iJc515MfnlwAA58a>S6L9hj=Ip
z+iBL>LO)K<DqSCUsdw*Qdapp3nJ%`uE?`WvU%l&9uEhIp@Q?7F0c6Pqe`oaj{>1j+
z1(atUm)$OS@#p&krr~!&r~is~d9HYuM>+e`=ZQcc{ps^iZ?s#^>1JUrxe9f3GwL$V
z-7ZBs!Uz|-QR6Gx4f{OQqqcXHtwPSPaxdzMgR?}PZ})ThV;5nR+l0|~Yk~eJfWPh+
z^pzgsV|kS5!|@&Z^L!76bP4&@IR7AUkS|BOgDn?S_u5ZOUvDDc3#6}I@ym-Ncpt|0
z$wB{(GU<G`=RvEHzvh}2@-WldW%YBkzT+oPmDqL1^T;!<V~L=T3;TEoYc7QS9@b@6
z_2(j|PCd->@}Gb+FR6>12Y2t$`qJei1if*+2G?rfodj%p&a<}ee&AEy*>^>GE?|8`
zTV<SKyqjddGY|c=oJ|*J;~k~26I~C{ewhEJ?sf+*E;7SeZ@8|c^D2K{^@rA3!q8b4
zbfnj|bV6@(Jxs}}8r-wq`<2q!eW=4jYCOt1;Xb_U*d1_+s5`U2PCH<lPba;P8@AGS
zdb#)ZcjbHX`Tp;Z9yiju*GMbNHR`3On8x3zG-AC)S{hx{J4_?nh~D0tiM%q(D%NHc
z=y%q%<6iUP&nf$@hJ4gt$as&~iM17GzPreG_Fo;y%BxphLjBXu^!v8Q4cU(4eaBd=
zD`8#In_Q18xv*}oV-m`35aXa^{h{VUDHr?8dYnSLrF<;wdd-?$rYY|$*SV;}1Iap^
z^2#+Tfu!8D@7~HrT&0QQ)ZWsu5bthTKODvy7xck9($ax)&AA7rqZQ?A4(f`0clQO<
z9n&JqSXkBJvJQOZI@;Z1!tVM=i)a^^2X9bX3ewVI<jLu!CAAJCk2dJYx{7N|&eZx6
zt}PL^iMYeJIj~Q)KIKZRFWKX<z65K)fFs*n<cWAMKT*QW^2j(HiQE76C6nYlKI=|h
zR>{k*%krrU@aEWp>r!6Nx)M`n>X_?CT-7GzA?`5RgCqEaO{8Z*YCT9E%3lm)S}mt+
ze^dDtLLRYwqKqLI?-ya$uzRtlAk4K3SW|G&%_|l0Lg%PwX2#Ionl#C>ZPY!@s3T3D
zCXE9=v}>+u&^Xjz#ChY_7@XQB$L>92oSqX^LDVOMP@fD=oWvOZ1L~c4-gvo2N7Sd#
zOBnhsfPP;X;*?;FTo8eNk-oG!FqV10xggFVb*XtGT_4{B{Kv4C=w}$yZ$X<l5n~b3
zccHF<E_Qp(C%J=C^GPR+d4gcBll>UhA+@6}+8*G#(6N{|7>_z@T!((=?qD4Rc_&~G
zUUig~i}l?bxvqq|J)-6?*te4Xj|Iqw`H2%%^H4ulBznf+{r<Mpe1^`mKiv=j&H(ca
za~8ej*}^dN5sDtTzzt{pwezp)66eNHsCmi!F_j->Ubem~ddH4;ML(nSbF#Z*PY882
z^ObGSn<Y>Gbi-VcuU>ijmMw?KJDqQ$9ICqU&5~#5%3-P;9>ExE$H&f<!#87l_-o|d
zTeTd%j=HnsZ0^ID`Gx%JV4L@5YVUfhJO5_#>@C#Z{mtZ=n$vhI^ilq1@=VP~zuEJw
zdzf?b<YsGpx6RqLOpVDyy^P62(a6OEZO=IOXphM^V(j~6jLH8wV@y7_Ut{uDjWPMJ
zFz5YcjLBOtj&mNJbg`V%l=Fxo^$z81$usJ<_c8h0ME9`hNqhYE`tq#$?9Q`_>bGQ`
z^;O3B?T1%CpXIA7*gV^F-V1YQ$vG?B>u)7Q8B<|;e#x_p0f&7)uQ(`+IqxOPn2OUZ
zV`lm43U<!MyyaQdXJi@E-?L!e(_`LiZo)2KTx0Y%(~hZi6=zGGcslcxe(!WR-^%w7
zoTG0IiTTJ5$C#tnWrK6bOYz;{D}2v}@1?lTitPt&TdzBL7HeTzjBhWK;mY3mezh8F
zTr>{KE50F(mSewUEZs8VQ~3N|ZEO(Vb6VfEC9wVqb}H6swhI~X{bz|RQ{)ka4Qn1<
zSd+nZ8bUUFr}-S-E%Lns<;T9WV%}NLIkx~F#@xUD&P%8Ljh=Vb@43_8!KJSU5$~6b
z`TmZe|J<=&>*3&CNoaEVH-TY%n~(1f%i-chynout_uq!@4kJ%=x>N58|MK5=n(JqK
zdl#&2H#{iyjoe=<zg`yKw99v<$u%8D+1dSnr}j~o_PUGYJE=ltvsj-Ift~v4U9Q1+
zB>7&sL%k;vY2O+x$2XcQ_afi4Z-tYaAC>C|FlI`==MLaq0^j+m`3jBWrCX+j_NL!|
zXQ6&ri25PyIweu0FM{{^Y!9`(di@3EqAYx0B;QTT^*KTCPNrFn<M>Y6+t%co8Xfmv
zBQJe)Qg8-!Qjn$-l_zf|o#f%&toCaXa@0HZkX*NBzgHg%`_X-<5Y~4*a)r}_dFzgL
zj6q@}@Lm0R?g`exE8)YWAfAUclkim%ka4cWcxT5-z~H9>Yi={vQl-DwmVS%)KA!zM
zQD@%lBw9b^o?tsgn+;<ve7=jdkC3CF!rirH3D@ysEjMUl9nOIrxTlX5v;GllU8?2#
zdB^MBeT~n%dr8ylyZbRw=P4CuuXv*DLPx@f#PYu1@xM_%B%s4Ie^Ash_1fEd1LB<X
zTQzXMRkxx}&%=5@=j7ba&<1G(UcRg7=St`p>pD9@gZ|t882UQw3$Z^x40*;f#XQn|
zHHPhFTd(?SyvLf_G+!#D@$zFuzW{h2E&M<=gAU`b{o(VZpC7Kh;CjM|=reQ8g!aKz
zt>RCn1AROZjx=fiRaui|yj-8!1^j{^R_(8HUE#y3i)#%n9+Q+0E0a#h13DX*Yv43~
z*zjYu7kn7^#0Ad&F#K3iKAnbh{;U4(r(;py>3W{u0lg*sS3TZ~|0;&P!TzfbVGP7R
zmg&E0Jie>XVV_+2uL_~ebG;3}y_Y_$#vh&V&|P~1uYT<5{|E%I&K7<s&~}EmR6i~J
zSZ!(*eyqj>GyPcA_TtB?41KoFE1dmj(vKC(Alr3a59xJOq8&v!<n`p{Z)3fT@tsmo
z`mp*Mbfdp#(>|<53%y7mR@4i9A5kx5@MAR|`mlXjjSc$yvU&`<I4J5u;mhiPIriy-
z+`F^;_GNXVifbj$`La42d|92S3SfO!5bNaNI|g%a_ME(*FRL)-ytFT?t>>ltvN}<v
z)&$LS#X3!XduIEx`l*L6tGw{(`?4yAjdu&X9G`5XUp9PMRl_#fKGQc#yTHSohngp0
zTmEYB&OMx4=~nGI@dLmY-x}(875?*h7of|)M2;nu?;Ff-m1_FESO*^(jqiTYk9hh2
zPCd+TF4~Q_dy|FZx)$(cpS~IMMq)i>KYU!7bN!4%`xZ0vL)IY<z9Tf&iJ}i7`ugC<
zF)_!Q=X_kTj`h|N*KS7~Z=YCweS@Uer(Xek=<A!z#|<A><-iwX7~>l?+6Tw?Vs1eB
zxY~<+$DH5+jD<ztHKOU1?H-2hGAwHNyJ{v4`fv1a$#3y!dtzSFnAgHwSfAfxI`ne|
zo7aA>{sVJ`3sFAK`MEmh=PC}H;yQHu`>uBMiS@e^)>(2c_YL#~cBXu(s5LNWqo0w3
z=lop#WqseB^K-R7Y`ph*)0SzqcH?X;)9q)f-cs)m-qLAQeVw;-8dX2=EuF@5ey-jc
z^{N_2oM~H4e|II{o#}C`{>C|BeB(_2Rd2`mhTjGIy@TcWjCk0u7IXgTV=K@s&B0uK
z2;YVae-3!g$M{D3_6X^*mMWWghen?&g@@rM;~?<-`oI`#rTM!u)5S3&)8t^jlJgW%
z^pTqb&H>p^PJQeChWe{f<?w9rbH%Z<pMM$V8P;GPIOyT$>L_%_yrMr9Jx-;Msg;=b
ziK+P(JJ0umhI2L4J;x^(={z>(j=C^5&UK{EnK=Ag?ZtdB*Ub3&xXSQ1gKusr$5D)*
zDWCRp#j$uL?FQkNuPa|)v4#&HWh0rsdEO8oSIS2I8a}Sx4L#v~K!Ns;v)5;R1?N*Z
zpLaU*D3djvHILGXd6YTuVZ-?pz0OL{r?jj2ly)(nlD@{O6Lm+d55M8Uzm+kc@}}``
zbr#eY9FH9F_irW2Pyc;`WtJho`bV$jp?@p-wxYdVi9F0go1yE3JfC?xv!0<J4q>N8
zJyWgf8D3+m&bShG$99EvP66Uw8OUmjqK}_-Km8O9J8IW8te@z&g!Rg|arLYBI#Jhg
z{+ewa)6fF^2Z5hfcIYbr^_*`1+7a%x_6K!ma(-F+y@;WmrO!gU>~>k--kbHg_H7kO
zrhn{Fz6&IO?BSN9-#h2?-8sIYW}O{@?<=7z!_QT-<>yNH@kvNu{atv!rQgSsej;$0
z7hZ8kwHzvL?Z;{d>Ty%AX8iQqV#a?uKD5mK0rSJwFKyrM_e79}{`7nL@O5<{jCf4D
zWIEZ;;as$~{d2yq(*5k1{+d{h{Q7}s($`f0?TcRf!oDtSB<b&}OP6EI-xc?zV1B+H
ze^-zD)B)_np3VNQP?q;;e^(B47seWxIquk1_pu&C9ry_P@fE^PptOIiNiEQRuh{1i
z;VAd?3&l0kb{S>*&qm)@j#%R?_xoX;pU1U7NN?_7`0_H+Yx=;#+NA;!uF|W0ed)az
zSwGn0up`De?3^F0bAGV69)N9z?hm{HKE2NQ!5ZfDaBn*?e<0W0dag4y%PsRntdTwE
z2kV?4EUPbmI)1R8Q+}{=hhjYf`palL`u2mR#*d~Stmk}uVErmMp}<&wbIuQzN1nYN
zKUiln{|4d%i~0Iy@(Xgd`@uSs`Phyz!gk9CmMDjBA-^DJn?JfUnSXXU?9B((xpL_L
zo#@%n9@;*z-fHFWZ1_h0OqM;?ou&^g=GQqtSV{k@XUuomUnI}oLhaq(OgU5QpD@Sw
zrXMT(&E(lRKUgJa(ht@*l^?8AnA1*;$qgSp7^7=HKb*^T>6==O$xT04-}Lc;^{e3c
z0<6I}>wNUQnf+j$@jSD9V7-;{>}>FZm62cgwodzSaJio#o_j502zRjNOP4WzkE8dh
zU|yZ`gC%_};a&O}@z?(s=`X5vfp6x%2fsUh74H>Zxh{ZjMuSP8I{JN|_9v7d?%fyG
zzM;;(R}EiS2gSGudm1Pmy=wTvs>XXsu8rZhn=JwlKC_H<F|P!7i*Gj%s_!eCf$sue
z`^8GeZLHlg{bKRGC%=E=daXHJ^MUujBf(3L)$}*chw<K%;e0==c}3|T3+rSk??HU)
z`83}BUgzN#i{HTI;oU#iX8d*hV`Z*k@_I+j_dm%!G5X;ni|@^~k1Xmj2YTf9|6Bud
z7<vk+^&;HMO6xJXE*AJP<R^Ka^OfbT2f5BSeQ(NhzOteR&iTsfxBsv=ov$ppmfi46
zuubm4i?wIM_Z0Wa9fSAT^ijn%zw~R0FwCos5$oigUpoyipudE=XJ-h$s_y;spu`dQ
zAgwxY(216S)6*PqA7~!ZJiC2)^gzpU=Rn?h^UJ1&qdimH51+_&oyL~2t$W(AX6pWb
zu1Ktc|DfA&K7jKd!FMg-U!OZK@gqF{9_Oe)=n#1448z`O!*QO6lX$=T^QnhN;C>{|
zQ8*)rf9nu;SH$g{{m?Y*;S_dyqHgo-M{adC?FdwqHy1>Es=&LzY2LGCu=5b>(yQEI
zZHwIDZSQf<YilcV6Srr>&lc8O{!)c6a!0gX<&J8*-5uF>+c>A^_G!UH9^{!5aE^sW
z-~03X@DBe<H`Io;IuCURckJQ!7cJAAo_6r-06(TR5BtuvPjVCOlL9z{iFSlL=y$fD
zUOo(b@f|p1=es!eS-EF1!)2JfC!8?-eFyVLf7AOY(xLqjoZJjQsPGA)eGr`57QkN1
zgA%Vb3{L#%h9U50G8DcjLg-h7(XViKRl+~?3FL4082A&zmFp<~ggh61Y)8&73&VdP
z(+~=N_(bX0yZ0Q#yU*5+io{rV+@YB`KZKKO>AA1nc$^pFY=La&4Rv-2T<l9c8aT6X
zMiuU8;9P_g`{>>AQt*O~&mpg3Bj%TNJ5FiW_nky^O0?&<Bc+bIz8_8eb|mU;$Z_RR
z__}~^+8BJFRR@}9=LVhfN8l&2GFVZ*5Hyst(rw*?bz%>N-LY+1?)bK0?uBhff~|XA
zK;9e;w(XgNu!U3H#8pTy^FQp42A<P4#l5KQstX;l|26g;?RWua6`rRA#~qpzbdIe;
zUN0Pv^~JCk+79;Z+;e5F)3X)%zqi(Ts`7HDrv<iNSxcYQ73Hle@7p0y3-Z1NdEbJ(
zr)@AFD}&LV`#{%)^oLa5FNH1ao##A7-!a6I;qsnv!pMu)ZtU^IywWyMfqnqvI)2SU
z<ZmVN`Q6CxE0FIC;0I<teB%aEHW8FI@#+-zF^9kwh6-D_4z_TFwt)Q8-^9=kSazpC
z#sXD#V<@{jP)6HOb{C<1uEhB@oVSB+4d9<f+5Ja6{}$&+Rd%zG*Sh=?@3*S#vMjUw
z{suO`6L#>_@cCt(@X;3nT`tPlDCiw!t??=6!zV&HpV))M@2mbqMWPVlSl4uDB2L;L
zZHo4UHFS3@NBrL(<m~z`aBIiSOUwsOEzbX^a0dY=h;uN`JCSEM;am>h8&OYv7ANbE
z5~TN0r*rnRkfqaUp8eC1(=!ouNoiQt4=a$z8<EGqbezWDICt*37dG*PGra8wPFC9?
zXIR^d!P}BH$GT*7fty%`x}_5~_XB4Ha7LouIj?Os`ool;_I4EK7Cb-UjB3k;oidJ<
zsB>0b?DVXL-LMX81J5ehdA=)cxd8S%1@=4Db=$O!lkQ%uMcpyYP28q<7Py0eHyAvF
zZMRuG@5OT^bW`QXI_*x_bbhi<Yu(dT%Q|Un#}3HS23fQX-vm6?M;tTLCjIL(IqxOw
zGkM=NFTFmCu`UE3wlBIobOlp!%P`4@aPp&EqAVc4bvZaJ>cV%U3|t}X{#Dcqr-CWl
zKe_o^iJoEHyUu9)5MQ_&e&yg3F5yIGJ|37bbIZq^#1_;utC2V3rbc_lPhgoC*YV51
z_@m3o1N*~`pX&6`&+y%Wv4?W!IS)NQ9N#E?$T?PtH8`Qox!1<97xp88oTG>F{9eWb
zTgn*~?YT2B?$9H1ori86<}7{WgU+#bte<cHsKoyz@GFKmOBVqD{E^XbL{N`1jd{bI
zT}`(-i5S{ejsqEQ^H66g<vDokU3;?Jv4^U*I>&0cUY_#cK8X9Pj%>bT^;~CHA~38i
zhVud3|1LPJWADeeJn+C)XV;H_*ZlE058Q_Pnp3Bi@_UA@NFTr7Vtd|={3sY3Et})!
z9L*Z*l-&oMOA+?X5z%jS4N>~fa&~PrWMdlkf;ZaTV_z2Xj1%(A!+pmKo9|c!86FR0
zL7uF(CvgAUU{*&n<e?0Z=~y-7fkQnZ&m)1Xqio;U{!<oyuXP0Z;3XI8|8m_9(jQL`
z+KiK%|4sUtg$}7lemi0AftusEV(lK=V1~y~7i>XUYjG!(uIiYdSdIQf9OZ5f%iPI|
zr+1(&XW3hbJs4M_Oviy6M;XftMM_sro1eHz;m1%;-_x_@j;Wv_Z36q<-U+%V;Ai%S
zftEe3Xcrc}t>Wn_H~Pmm!0$(UH4(aJIZq(Hl;?STb3vIxNHc_+S+FVh+HRyB{y)n(
z){S3^HN^4!vXx(*54)%+NBSFwf#1PE>z??n73C`-YnGeUHfONY82eHnu@Yss3we<E
zbJf!eF{V7St>zo(<NxGJr}K}AK)9{omLGgR-_1I-aPY#mEcklMKl%4hhd@7NYt7Ry
ze6r>naW{Mj>)qRcd#D8P80w9UsAEGFCE}j@&6@t9Lnt?4l$%^PEXquGFx(MFnF%*n
zl*ggpFv<dbq_I35LD>t9Li;*Ah3~-cw(Q49e{5mIhqY}TS%{PV5aGvH(PnjIUFP%*
z%dbdm0qj<^g;<MU*o^D2t*A3mrms3yRkp>Ah_&WdAuopgKQ|FQmRn}V&o$FmA}kAG
zg!|PMoS%qr+zr3gXeWiw-SNxh`tH3*%PO=bGmt-wkL8$o5r+(DpRz0PyfFZqLY=h|
zc=A1UZo&D`?J}Iq?>Ow}2e1?7=~UPd^R)$XRk|&E3ScvHU^7?3W?ZCI+6sLbOIu+%
z0c>U#Y$Xm`Tp4i7gOmaG7=yjciRTG>S%oldGa=Z_YS?24_R@;{ZE??UYjY>Gtwwzx
zyEK@{LVtKQ(!jc5RY}X9Rj|=T$iLN)Z!O|kgSgqY-3vLN2#i1UL-%&r^YFGc=ub26
zqtI0|e0Z;fz0j|>Um0Z^Kwsa166%F}{?3Oz%|l-%RhFal*Xd(dD+j%;k@~M1<lM+Q
zqpHTak#!mS1oS)2JPpC_vz&_Z;e*^=!}4TXx&yjIIXSc(dtg_EoExhlFXO1dcS-Zy
z2{VVGj-TQV6Jrpz)6Zjn=A&3!&AGCpsJp1&;Zr$|8GdM$>wb;=zJhWl^o1)jbziMB
zp)?D&{Q~+&^PEU&0@rPTh0!MDyTjVTd)>q~*vMhj%}H6om(QU`rwD(K8gAEN^rNf&
zUuI2?CPMfYEFWhj=6vEf>D#yz`<_c%lWl1G715rW<*0{oZN{|&@2d{sOu+B)L7ZR1
zd#4}Zq&>1OvdgyD9HkyBvVCg#MD#=gC+D5$lV}`dm?>l!C-zolyxri<xG4ks7cVFo
z$o~jV@;{oCf%f1vzm{H~pSCX8CQ%o-4qO*0A7)JZT<2{?PE@vyv}t~m!g`B-nPRX7
z_&YD4%?O`!_&!hjo`g=)_duQ%?P&)-^WF6IT-kJSHowIsFNWcp$M@#`*1548_KNZ^
z#_v1+d}`E`c&zNo@UXU!8ly*DlpS@?y$tj{zr)w}@|#FGrXOp-vyFSs+iHCJ+|&20
zd-T2h23W=;(yI8P-bVh1L|a?^E{xB6PVL)({im0@p;G#RpNsih+D0e7WvPA_#>B$@
z&@Tq=BbfJPz3?4eA&&$3CPLoHkiQ7e7vuRIcrL)ReG~zJBs=KVIMX>NtJmY_Ini?J
zF(2hn=Ns$WiDS3!0q*YDY2=@dTiU`!MUMI|;Pu3nE~kw1^~mY>eY&<E&M*9b_TC3R
zs^V%N-|QlW5HV`3s3;+#21E=HASl{^L8GFkLKQ8Vgd~taLL!7eS}GCI20?`uD<Wz@
zw8S4)YO$r2SJBeSt7!2p^-qgREw-q%MN2DMtiN++&fNRlJ9js`o2CBwI-hK2_Sxs2
zIdjgLxiho(-pwYxxedDyrE_*Dr1~n`g!g`opY<F)`{B8?|1&q2&KER4EvLPoa@zYT
z4@Vv;4|jTG?gw2q@NsDr1I#zy$>DwMgTu7;r_apV*UzQrcvAhkPnD0P^<ju!a?Jwi
za%9b|;bClFjt`EbaA=<M%t&sF`Cj^IIv<#Egnws{?BJ}6aj)L2f7y4v=w;f=?c=uW
zrg1BS+H+wV>2%oB!@Kt4b1k)<+8sJ%)7j-2ly{-LTl3jn=o+T4)48*m>b~_y#cj2@
z%AVP^6VjF}qH`y|U)Z;}?Ls=oETmUoo^#PTVe*eUwecR?qMx4EcF|$y?XMd``)c!^
z9X@4X=%e=tuRoLOoA=$}^|zJmucz^{{t#M!Ur1P&qEG58iiVY668fZmUU*pjk`c4(
zkIa}|pLW&$N9eqB`;elKo=WTX9?wA+ok;aR6mDCTcG&ZG{9<HVKRR!}kaqa<eQ0f3
zJ229A1oi1|^t|l9(Q&suGooz?9s6inx91NFcYFTLv?JbYr8f1Wy|L33Kdp_|vJ2?_
zZS=nGl(e>bnip`q^z0S-XznMprlRNLhtfiigwoO;p?Se0a|eX3!?6v0z_FK2W1z7;
z<sVTH(Re6(Vq^pM1^b=H2jhF13pu~rT{CawuofOma^2r_uen7qYD*D~uPnpVQFBX(
zp2N@Q8vWc4`i#cp|7rUttr_=S8dl%Mu})+8JDHH&gGc`5y*nMxUY)vxj_&K%>+5Nu
zYn#INFIW40)CNAc;_r0e_{26~{a6N`Ct^K|<Y?7z)9CqZ)ORWNlYJg`J;mpO4Emje
z4E=ipHQnepwdvK;jo#C%hJFiS0liwt$Girrp}H2(tA*x`we;fOLs&pBe&%H@y=o}d
z7SOBZ#1QS3(Hxla$>f&>^x}2ECZ2bt9rj)`<+oCw;C@ki3jMYMy%wB8Tzc_5_Evf=
z=u7YEbsG6+;V+8Y8lIuG8qJ?6zTSVHa^3@ZlgfXic^&WjeM;rOM{Zx<Eu5kDmHtL$
zu9IR>)wz;#uCImbq<Q&*{-KZf+{XHB;(kkbJ-zx+U#O+ec<#r%40_*%VtO)R+>X8!
z`+aE7_|}IyQ9tMRne?9eGQS^4y3=a`_20?#s-^h5m0k;|Ur(l2?V0qRUJIySPo`Hb
zo&V_f%jtK_={>z_N78$GEf`7f=~YYfm0RhxfcpMqdevS?@9DLG#(>H6s$E|6^IPe)
zfX=Uz=~a6ly{FfL`{+HrYN>DBO0NYpMogwxE%l3A>9yb%dQY#~Tj@Q$7SPzrW7TBJ
zZ_VI2a~JI+@->&!XpXy(_IcUwQ^@ug(yJ@Anb)2R`$pQ*$yT@iXatRKU1)yX<$1>W
z^A=h^FQmActYoGunfzNCWohY3<`k02aYXy;&)3k4$3<R$)`-l>N~ZU-T9R2qGCA(e
znEyvL=IgZtkNF?c-l=zwJdO6q!)+hZe(%4o=tTRWhqQfiQ)mhAhq4^C7e1WgmVW1n
z`(u|CML(~NbRSwnwwb&tZON2p(w5YP>32GAh|qc`bZyPNH2O|p(efHvugxX>yQVc?
zb|J+{I=!Zl-AkwqlW9+w^{k=sjDJ()9a?AXqj9Szt?5S4J`&Hpc)d80a_)CDw|o5I
zLA(YmddwWl$JPF)=a5>m-$I%<(VoQfU#B?l^WcKzv{&){uOAV5zhJ<^<t%e$m(bX9
z;-#f!KmV2)H%b3BwC1THycgdyPx2}$-uQXQxoII<w$QmgBeb4BPfyEUNO8XKOw#9{
zG#0H~wYe>vmZrvk9$T4PL;DcCFTrd1e-Vd#^?Vm<JIj9V_LBY2&->Q?t<QvBdSTwx
z`=9Gf=YzD&_sYo@TW`OiEsxfW<YS79(DMsO$GK_rI}y3V+a?U4=q1^k=sDAB4o&gj
zO63Ws6u155B)vbli`EV&aa@p|+=nV@TsVaE%?QzNfTeX=SR%h&(=#)4?MjM;8q&A6
zZ_!8mJp#{D`8bXhZX=Hg<rL2~52dw*X#b(6+lc*bWOrW2R?x9#Uy$R%>^bt@`@Ty@
z(OOkMQ}x5+DZXwp^NQvp|4#E&WlL&DI>k;2?Jss|896MYmDZq}(w1b>9#qdckv8((
zwOyKZ?9|e^xo5T;J3Q`mT@m^@?>lAmPHXFuMSDMKCrsOU%>Bpdy$b!?OI%MEiq$^6
z&V}EqSVcOjJrmg%$*7>dP3z6Rv@cR7`y#ZUeJO)}zaq!CFVcr_T4y-FZSm<Zb$|JI
zQiRs#ov7W1P@n0n`V2qYoS%_x`plNh(0V=((fYJ+dgI7pC22WBTLu<=bpH)$ZTD0B
z_dJ>QDM_~l6pOVKi+7W6XkL|lH`#YNohuHb^2gLKKBCwC{|UF<f1>u;-K)-POQ(H`
zyZ;<+JC5{QPIx-)nY2*<x{1y?bLrZMR+9TbDD?OP<iDCw(PKB=PT#>0Z+a*+Y~HGo
zZ4uhnxQWh7GeY6_I4*cy^H${8hxt99gIc72+(dn1C;b)z$MIVfYi#45p`+jXBkkLA
z{aiQKw=?qn<M@2kLTzZKIOTbBYp2lqJ9EQJZYFFO&0o3g9JgI4HhIna5Uq>z4%738
zcj!Bz7HYRTFVQn+_*q~avpMwql{Y)nxI%Hco8px9XeN2A*D=&z%x??y3?1_x$0Bn_
z&~pRcB6(~J)@2@zLpPD0o9H>|Iu@Ic#NSlp^WVNp&m&)sBA*u1cSq;a{yBY@_)8tf
zd>-fDOyN2QQ@`dl7|UUwrblvyrsvbX-5lEQ;kYE9o<#CE#xEeBcFEzs)n#Fq)!{Z;
ztG<-pL(hME9tgMfq_SEot|ouBhTHgi2adNcgtI@>Ddu&2d)N6qr=<Ja)iY>$Oiphe
zIV==PdnDAU`RtZB=6g?_5_*5ez|cp3BEQchKkuV)_+`?yDVKan=R!Vb)l5iR!s8cz
z&R7k7R!hfRPQ1Bvew_QC&TU5#&s=lJ*B+G<r-ry+`}EVnPvz40DRg}6GcC)@>3mKb
z(CeFqkbF9p=MQW@bqrxOgz0&wcMsLS*Q4fxMfB_)8Uxcq{GEh;CRe)5L2JlAyQ%MU
z?98D0I2NYxcox=cBg3Pyl;)*9A5Npas{1oS*S3(q=v*|I_Luv<8Kyljl0)Z-zUkjN
z`ku6>X|77T?j*aKWBmI;X01-wZ#`U2bCUfMAO5*>`fwT>$kwbo|Aq$5nUxQXUYkOp
z!L3v`e+O>%G;_$_d~Q5S?c?z^nmj-E&Y9QK{O2R8GuFJA$87GCtix`yjj`p<!{{7G
z^P(0S4@(YF=i$EJB>&XX7{TK{)$iDk>_xwULVbt!D0%+Q`^<Em!PqA1<Ge2AK0bl^
zCa+^_sIPNBKbQMBeOGJN2)n6YmJ^5jF`sY0ruwknm!oIgy|<FS|9Oi1)=bYadWw9L
zL+_1!={z`?pM6quA)Ui0F3FGleL+F(su6Afq%k_1<^VaQJKNXTv~pE(8|is%c3R~5
z_bA?(`!4yP`P46;&;CZnJsih1a&6yEYA?5ie7S_@7Tg{_mv$m<NiW@w+T7x{!K8nm
zr*jsz(0qaG4U-I($+}YepU<VwIc{3Xe{3_hKc8pSxs+m(_Wt^sJzoF3jAFNd?Nmd4
z<?}W9zwcZc+vom==1r?;uYu0pdnCrV4qP|texaY~Xl#(C_8zin3@81G&m7)UXd)Zp
zKEnOs^eMcTK;!mU9%Fd@X!bLx9Yg$MOYOtwwedK>YfA3dwYj?g^ZcGVIQ>=*tvx9Y
zxc_s#*xz}5q2?kq&ah23(f%ECSx(Ko&g53%i%hd7)#IVNho#0p+SBerZR|t)5tM&a
zL)TK2(;P>)Rqw-@wJokA{cFwi7;<=gN~b!gO-s_}hxW5<|GJdz%D=70eYX?MyP88i
z)o(nwzuBOVXPvvyZ`)<8)YlkwCAm{rF6o|LPS;O#OW&W-k9^JT7^2%zJ`eU`X#J_{
z=k+tL)$un;Q(u>9bMkf4??dNs`wpe{(f7IBK3YezT#83`pNZzj!R_<zMHqi5dy4;g
zzLi0?<*~IZ**BBwYw6Z=|HD*g*WRHv`cAu@I^{ch-`)i2<Jq6)vCY(P{Kx*}{r+s)
z>u3M|gJiUXdA(2Hfss%7ngnihv-q?be9HR@?b$b0okvNX`zTIpsLmRyljCTz)Y)Df
zwO6-kE8CZUzmaWDb5*qm*p+NtOZH9A3$;z*_K8pV`vh}bi{n%O{!)~fr8<-^p$?84
zQ%8Go(_VXcOgFl5doEOd%b<0WZWH@%VXkghOW%&QE2yrc=vo<57yE1q)y3_rk-9qC
zKGQbr8_sxBG=k@NA9YC&eRS*Xhwf*e@z~2YE1%%{jMs?Tj&Y7N(g!<IPkVmjG1iRr
z{QX)s%`e=x(!MnLa^Xm_CF#z6Z?d$nS=z_n_ZfbR)4o_S>8+2SU1W}Dzj1w2sJ>c~
z#r-Z`dq!)g`ToSzq5Ma6q<2c&UweDk!1Ipx{IAD-&u^^Ku?w7I^&YLBZ+p)jrtWC*
z%Ezz{tc%g#e?B$mx>z#UZY(1aoh*CMIk>i4lJ=lu7dXdu&>kcw+I#^0(yl$?(1~pR
znWwBcHQ4*9P9~4@un_q<u0(4rl}sMjK}6~vC(-E9p8mT<50l3!{tH9<qWk*`W9ZLF
z(RllViEoofQ`hvHXrCM0^jnh~Jkh*4&I1~S*Is{ami}z=IK_9E)*PpVRJSAEdW}6y
z9!*`NU$oB+zF6#Ra)bNxRLk?r_rFhdeY5=)M0wvL_Aq%ATDx$n>)X(7jhav*`kOq?
z!z@~=>sx2l5Db)x{w5D*wU4H{zFF0wit5lb`a7*UG>cvpoKK*fUeow>8vUEa|0?)j
zXvEa2X$`eiIe7!}2M->YKd`W0&V-8T)m1qSQ*)*j6b>C)Ftn;qPGw!i)JZurtEWw`
zC49ip{`vg}=H%5hH8oB@^Ncepw2c0f8X6|mRZnl2F|D$?e`Q1c8BGlhb(J+0wNuZi
ztD9MWdgHW)$<>ujIaR|Z77m+OP&Hu4kRgMr2ImhLSUtEhe^|k=!4n5f7?fXKSv{y~
z;GiJ``-DPSV#2iRFAJs3IWg_{%$^GCE;wC7qf&4B-w(>6;%+%5nJ46Yzter4?@b?_
z*)yl4Tj;lMyq-s#vBGQO-0;Fn6*D|usN3Ioo$GF94ke=p*Rxb1ba5Q#=6H4VIHw-g
zWux#$YhM27%oFmzPxaiHeqYADnRS^x^GB0T+kf}Q>stOE;b%&&>ZHwBPKad(V0i)9
z@Bpk-upA|oHjXK;5^N4*p7vyf-4+#hbs9%B)@_9x$2R4}*gBtl#x@IvZFp5MuAdY0
z_6XKbAsP$OMmeWKohe?nU`8JMBu}v6%=5IN%2Av3EEQfU^2GPEUDt=0J4d)B0o+F5
zavRnNcaP?lj?FxwNcp<+57O_-ysz86SsCFCnLSI#Dv!VX${Vj2cjY$kl;gO}iSvDe
znf5W39^p^LCX)9M40-v2by952FAl)Q1sq!!fHe!24)T`zF!s$F!L~B5xEr^>)M<al
zvdp`)?mP0{?C=UO!K<%P;B(vPdmxoe9qdnf)~-rL{NLlx8poe}EPdark~x-rQ6ShR
z{-n5DQK{vN@UqOFMWv1_h{m$&e6m=NX2Hf%*{jDKM-S$$5nhqS^Xj`zc#`S%%Nx@M
z)@8q7*({GzZ+d0Y7onW;_@Bonr5;@hgqLse+}_MG#tW|sd1f3mLne)bCG>fVaCdVb
z)&BLzHyOke-WiedG#{jO-!8KDV!e9webs3Qea3d6-~Coe%%SX%Em*AfvAu@J!Rtr7
zD&dXQZPVusu|s4ywLzUb$PmP3otFA^Vm;Ofwv)<iABs5`>odaZ$r3u?xaVs*I|AhF
z6)Z>W?3c4IKu&ME(TkI@5$jVZ*iQZ+PJQYE<j{R{D)o+{&;9^?=vgW%p+5BcXDaRF
z|8eSbAV5x*bdp5m6w5KF&$uMyEDDg*nuMI~0djUHA*TmzY;(eP<qNixKZw)LRRMBl
zCn0BTfSgT9$k`VlC!N0h;Ixzf#nCSA*TdzQSM@QTeyz^Nre9Ns%p*>n@cA4<b$IwN
zEmU)+Wx`#jxq;_<|A5Hn$!&66v+hp;=cbHEDGfPrcH-ee)tSi!O0E1)pV#ylLvswC
zQD%gj+ynJ6qvpg)03A}J>-5b-BPCRwGZW>uH%UE-w2hBjE61&k-nKBE4Lwccv1*qb
zC*!YAzl`t>(2v`~zUnTMp3PMD`zpNF9kMwNioIN){P1cJujcek!dLU`;%+{EMz|Ob
zV12j^Yvh>yS|95eobB^5tk(`XW|uz36K@%8DPMeM(gl8;mhnFmpX$7s;ZAZ%ILj^+
zuK3WWPk1pjLFr#3{H<EH%a_<<n@W(p%qK!_^NIwI=}pIMlVeJCJ-W@R4YQq7KlAnr
zugKyVyXf^<PB$jFV_+7Q3j~uPRh_eG^`{cfr^XA$@#M9qcRn>=c-&?$&pV%5E4=Z@
zGxI458skoG->bqMja+31>cfio#_MVvq6;lK1^C=qs&ZF%HPLg6LOHIJK3vV4Mhh0J
z9jseZ96VlUtq|UN-QUZ{1<v_1BC~0LDIX`ZZJza0j26-HJLLH7(T?x7T&)^1BFnrI
zey;~N)**)-PAOR(%H{Zu=&-s2I&d3yb@2G!bmI}HWNg6oS9S3C)g3s#i0a>EAMdU$
zXzj?W=R-=e{ekqx>zzw@C{?kP$2U1r0vjYGgU`)%B16t!<(@UX=pjm&W&EogiEP6)
zcKreCUw;#HU&yE9cgyi={{+uDGX6#uyJu-0fO*X7K^G!&%GCYGbN&d^LcxqTEWbp!
zoix`S-(}`7-x=O@-{NED$T8!%lHzVz#hE8$-50*M6Q6Ceio1oFN%JCIBnqE**2yv1
zf%ULf&QwG3cP7Zsk^x-CLti_>bP{ppvyF;`UqxkS>^5UEtZ}&u)(O{)nT$0HhUb!{
z0oWSBBva$<MtRfT`DIs}yv(Dy5wZ6jxvm1?#na|;;hHx0rsJCg<FaEjb#5{S)BC6^
zgx7>TV_TRovmLhxm&=@3_71`F8Su<!+_M?SR44ioP)>5L^!XfTR{GpmApA^ym_Gjp
zVB-U@#sF-70JcmpWh1JmfL?0_o5S^b+LIA>Emz#tEo*&u$#L9PPHZE32!KjCI#XCC
z-$g(P+m$02k6)bl*aE?nT?H!%z{dOJaa$S%<1x+K26u|dF}6&2rN|TCQztY-j~b^o
z3%4YI>)%J+E8IPr8@R68Kzj~m0Om1>+nm>(576y5`EbF|UZnxNssP?>!8$3aTJE9%
ztTo`+^#Rxx!O}tA4j)!XpY0WFJM(Cr8)YALHJHHJN9}j47H;Zbe-;TA%b#q&8sD)T
z&vOLZ!eagVsB%6Gx59#s&W0>&y-ybFu|=@4S{BUvX_YMVUFPi-UXjJ~&ilI`#{}=Z
zzn@^H{j5uoVA+bT$DOf)<uT^zr`~!09O30#Ja>Fz8LNd?g*-D3n$Aw!hokB9ZNd%l
z9>4alHBZSPlQ;pcW*B<j;KlShI7c4fuovrAV|Dmd$FTGn+hVkEJ296M+q+z_SZ!op
zOB}p@#9Jr4aRGCZND<9poRLB6w9}^(>#<L;om6HU`S(EAlX?7msd+t^?8XDj87^2N
zd#Q~9a^?%RlPic*pA7+WwhETWUTWwBuGHJEY{7Q&2XX3C5+G-M5^@#?$XT6)oL2+n
z>`6jS4nL`cl8I^ddx2m(`GYv^QxhO(P7-p~1<2W)gq-~Wa_FmXm3H#~INMbu$Dn=2
zCMbu;xE49)Rb97tt+C1N*34ZmTt0`8o*pht3)P%yr*PM4Zs7SIheJN!v)t}Ed;p!J
z^f(i+j~W?EqYdme>N#3zjyf#iJ=7LCt}1X{6Df9AXL{degYXk=*IqepP1JU&ok3_<
zaaSI9^Lo)gO7ZB&J{l+d&3us0NB;fO`ChJX{%!A{t`~myG$q@|58glBEyqM#pW-av
z?4S0?W#wtk!2f)02--g#E&OH3SLaH5|8%x+#ecpw*!!nzguhkGcKI>(Pj@7E44;Ry
zPT~saItKn{+N|1OX5DYR&b&h56<Iv*JgQuHW_-vZev@G7d@Lo#S_H#+)C$2kp1itv
z=TV!5mv8aB^Qb+-8;?9Qk1BS@7;ay8{zr-DRNlJ1`=>?13-Ec&{nOcUTql-KiQg^~
zELJ<1vOW&paN_L{9_(4gy=PQJ$M-my{!!Yl`<cD}8pr-=xyVRXht?G6u&V<)upN7!
zqRfDMe{tK9kFV<B@vA#{{H_ihU&QS{)oQ=Brf6^fw5EeH3Q2{vA|sjo)7^Icar=<x
z19@r?3Wc`nz7RAYSnZz=@FC@Loa|S6<|^R>?wG@UevxpaoulT%<|Ch@_?S&{%s493
zI2G3(>OQYd?zu$m)!KWgz5B3my5ThNeCy@2t;P!9T+8FEugv$zk&R?3Sz^&<Gq<IL
zj$35v3DcY6ZmntKGfyb@T;xRq&OJx2$iDAu_jb>SY$GAWalZHY{U3H{SsW{`imU@#
zR&$zXvt3^>7ugcd>`9+E*J+U=#dK_TU;4*M9~)(lB!f;arNvz{BJ_AwSWfFLcjcS$
zBB#!8H?!wXKXzcYlX=fQi>h2K$CN4s^to}hV2y(DIcbAn%e3rhI;thHyRKKt(aF<;
zsCv^+6X7h66312#!R9j%@SQ=Jw(RgbTlRga9MhtY3Fs%`a^JLB)zy+<U3_ZWD96M)
zNB1M%F5%^ATY36m2JD}39CFvl=7T7C<_UVw!^{%+D{6JlE)s4m9av^foHE&lONA@_
zjcu53x`Dn9W4CKU9rEhCj;(Us{D5{w>L}J=Z-jL^ApE6NcIG%{K17QmLuXpv=}e;i
zTmFZ!pvMe~DffF3_RToqbJ>xtY-kMr#_QZqn}s(zqIf~;vq<*{M69%zkKHK8*6Dug
z{XR{)ct7gm<(?j{`_z6pR*jn^t2@0i`_n(p`5%m>S@bqfJ}c+XC>7CbxZ&&i8?EoB
zo%s=uca82h)bjl@%WW1JHB{!r{cfpX`x!u6o4G#iy!rdx7CB~9lw&f&EqD-zx~eO5
z1|Ja3uNmPI=O}k<Es$gOyJL?#9}v6qH|owPBR=D{HOjGjxl*&fkeE|C<`j2zzRaLK
zO^%<{a!d&xqhhI1f>iUi3a`}Sxoej!`fQ)@vYAJT`$9S^N2!kg`Sc2pb^8Ky3xwMg
z#DxtA=9b4Pm;2Zv;Wlfz{_`@8n{FRt*&7qkW4CbUXxW}IkjHV;*I91%04CAAmH+u|
zVY)B*hPg$;jmK_v32>JQHy#^r7H&<DzGkT?`tB8OV-VLY7llht_Ejk!Zi#Sb2gxPR
z8T)cPHwm{8xhkFwQNI5aUNQ2duh4#l5vk5YTY|VsreSKCdxcjTAk*{`YQB=$V-S<%
z-Ut&10eTh-FCIM`gSY{DE)!mRda{0<=yeFaI@9Y=dhxK-g<cu-;>6?mVf5-oufyrZ
zpC3W5Bc;sa0Do1?IDb9JIe$&WIe%5aId2_v&fAHc_mZ5q6!<+aF*)aD2IoBe<eaA-
zob&01a~XQ*M-}No+4SO6K(E2{;?IZDi{paJXVU8|DW5I**Cihz`MHvhlKgzhFOd8q
z$uE}tQpvwT`DIcbEBWP;kCXf=%D*M$t0ga^yj;o?D6f=qwd9j1=YGigPo~!tDc4gz
zRm$9-u9fn1%2gkyd?vkS34R^r*GrklES7hJ<js=Lqx>c*-%R-}Qf{Gqfs_|gzDUZq
zQ+|h(mr(vaDKDk`PAT6-`7$Xlr~Do%-%I&@Qf{SurIa6_e6^GxqWp(aZlnBRDX*pc
z5h*`P`8p{-M)^;q{5a)5mGTD4e=g-GDBmdMCn<kQ%1=}NjFdN1{wpazOZgTlKS%lV
zQhtH*7p1(7@|UFiTgtaf`DMyqk@9Pl|6a;FD1TkbZ&JQf%5PErCn>*8`Jbh{oAP(0
z{2t|dr2IF^|1RbCDgQvq`zZgXls}|=zmz|w{NGakg!2DLnS&vXU-X`yR~h2<GM78k
zzeA<mh4Kt3^Yu%IN%?TekD&ZWDf2v=emhmkpl3LScwd?RLdVg+<E4B8<tH*oDTnf2
zQl@7shI-SB-<~2luQT|4U&;GXe!7&;pgdp711TRQ<-wE>k#ZsB!=!u`<$RwV{e{k<
zfAm~ZRUSe4NGTUnK1#~xQ(hwF3n{-y$`@09iIn*sy>Cc)4CP~`OwUpb(Qmmb`BzeY
zm6XRzehuYiQm&wUf|RQ$ua@#8%4?)NS#n<g)=Rm8@<u67qkOuQXHY&<%CjlIPRie=
zoWFyizt9czZ!Q-o-AMU7dfh~?`ShZ{&@J@uyIi2Ofbv`EwUAzm=tX~_+v(pOQeHy&
z_oTd3@*haPO!DQDuaNvc$y+5~CHZQ}ACi2H<PS@}mU2!%qWn=Q|CsW}=*4f>)4#{1
z{4>foNck6%Z<PE=$u~*<jO3do|Fz^>B!5owt&+b;`ER8BlH|XY{CASSLiwvw{=MWo
zD1TkbZ&JQf%5O=&i}JUn{1?i1OZi>O-;?rRDgT?4_fq~oy*T}Y@_mB;i}DYp{E_7U
zmi!aRKc$@aWmHCaM9POy-dW1&ly{MGSIRS`+>P?XrF;bCM@pIR_dHt4$57r~%EwWD
zyp&I%{6s0|P~J<*CsE#8%BN6%s+9Xs-dD=~C_i1wXHcFm<$;tBk~00~LTHGT3n}Lx
zmEty@Mfq?kpF=tQ{+_}|P(D)1#gvbd^7)jPNclp_FOu@blwTrczDM;NQXWG&JwIQ`
zyqxkYq<kgiS4nw1<yT9&jPi0RPoTU~%GH!llyVK_wNjo!Ij_&TEmJ9Pkn**ZPm^*J
z<ujx_i}Kl0zMk@LOZhvL-yr2?%5RkNO_a}<@-38qSIP@0zg5bMB)^^VJEXjX^6yD`
zDdl%c`7X+rNqITt_t1;ey_DZ4<yOj9(u>>lfaDKK{zJ*zD1TVWYbk$3%8ydMPRfr_
z{u3!bPWexzyn*tcOZf@PH%j?Q%Ab<*)096W<;|4;O3KetzD3H<QU1J?U!eR&DQ~0v
zB`N=w^6gT7netbp{F>x{pnQjv-=LhHN2}5wDSu1wU6j8q<-btATgvZJ{+^WoO8MWU
zyjSuMB;QB*Kc)Pk<R4M~v6K%`{)v=7r92eTwhvPtk@6vwcc#~&^1ch@8B)%q{4gmW
zPI(r+I2}p(QBppd@~=s`JLSjH>jZk8NH6yD@s#uZ&|J=;yqA<uqP(}1Pmw&2@;*{N
zP4d$z?=NM(hnnRKq<oN+2U9*o%7v8k4}~%3EXs#V`5emW_fHi*g7T44=KHTlN%?%q
zFQEKFDf8ai#ZtbM@=_^ZM)?>if0OddrOfwkUn%8pQ9fSE*HB(2<qFCtNV$sgYAH{m
zyhh5CDW4+cddjCtxsmc~r97STCMnOPe3q22qx^a)&!PM~Ql3kBvy|siev_1Mru-Hu
zw@|)7$_pu9B<0&FzeCDPD5oDDRkq~&&F_@*U6e1A@^Z@Wk@CHi-zVi(%2!JH0m@fP
z`60@GDCIWFAC~f3${&&Pqm-|c@?(_$M9Pm-{!=M$p#0}jeuDCiQht*1r=<Ke<<CfY
zGv&XM^0Sn0k@9ntKQHAMD1TAP+bDlY%D<(2yOdw1{1qv`M)~ihyo2)BrTix4JEi;<
z<$sd$+m!!V%DX9lN6PO}zDLS`qx|nuexLFW=oKx!@-_Y>m=IAbe(#Z$tN1<d1lTEJ
zZt{kY#;@czyklUeh}u2y;#arw`z~IP-W_`kLtQPLfrxV@wfpfk_j8$dB<vJXI}~1g
zA}=}va7H6)7lTV~n#v2+0G!c?ddxYO+%$6qm$O{}N)fdi0ss|n<^^#8&S*sKnsCWY
zOL-9;fHN9VyDMCB(*t*N`FIzAQp8-W2v~{o`w4)!#faLiao=-kgz|e&FDUOKp<Wg~
zvXvnlXEYKzi8D_+SNYe*nG{jGL>_wRBIVzcy`a2{sNE#*M`M(KPxXQhzmJ7~OZnHv
znHW*KQ{F=+EB~J61?62t?P7U9x=#7`bT8=e&#>?o<zE~BK=q@1i_btr?Us2zI$imF
zfET29cQr92n}@znBWkD33!b9lp}-5uyNKG2^L}({E59G=1?62t?bvxg%2V-hrWbVh
zXIpr_iU%8KVkGo+i(jbX!NxUzgvBpX@nGYcf3C&9RK<ghYyK#Ue~pR<8`u2vEq=X<
z2OHP?3oQPT%I`L=`4?IIuFAhQuK5>R{LEH{Y@E?Z=u*x+=`iJA8)s4^^bHS}-yE&{
zYvcSG{mckwo^*opuZ=S)61v>O<u@lQ|Jpcz772~x%##X~e{Gyek<e8hF26Zf`Patz
zvq<P_&OGTd<zE|TQY2L7;qsdgmA`D9KZ}GWaOO#STluYxGa3n1bLL6!D}UKIlOmx>
z9xlK6K>5qY`Ll@H;pUQ?K34wXoo_ouLiH9HR(u<0Vnl!2?l~qy`ImRl?Gy>|Zn`%e
ztNd%@hbWiN@RH?SMD4_TKgv^npXmi1{&f~URQcV;nHUMpvG_Zb-)&s;Z?O2kYh}pB
z8I6RRIrF5KmEW5^n0XTk%`-(Oe?|G-#+eWa-R$s8;Z5a78`pgPM#7u^qWoy%%!-5-
zddc+e@5+xhuKE1UhBy63`OC(cML#9tCDXgZ6yL@*f2qaqq5Ny(ntzwYe_Hw1#x-A6
z?m6Zct^C%;8I6RLvAO7^CzO9}oC%RotHU#ejmp0^&Ywp@4;Y%0Z&sphT=V&xA8*>K
z{A=UPiiFy{WO}z<`ParZpT9x!ravju*f_Hyp+~)BdiR0ymyK&ae-q_RX^L;-%!-8g
z+bVB*Ncq>snH33b@RI4>{jChyIHQr!6P$TctMadnGbs{!(!=F9E0uq3oIi_%p61Mx
z+LV87oJo-of5YZYKUV&=ab`tA&w9!9Zj<t_jcY!CQ|C>;QU0}YW<^3Tc**qc4dpKz
z*L?oQ&zt_bjNjWhqmdAQE9gz%Q~tGaW<^3Td&%@}ek(&Z&S)g`8fTt#v+}QvGbs|<
z;o<U|+mwH8oIi_%-sH@a?o|G@aVAAVZ+W=<=3eDr8|Tj=p|?5nq_xVwHqN9-h`$l_
zrYDqtZJb$=(0g7oy?aji*TyxUzghLB*OY&4oLQ03`(84=yFvNa#x;MR#cyn7$i^9s
zgg)fVlde_%wQ(jzLLYm${N_64UmNGoBB4(>^Q0S<e{Gye5xvdl;V)4BRoj0aT=OGo
zesG!cuZ?SdXN&(s<zE}ueExRYn|`YNYvY=qY4Lxh{A=Tyf4IdTzluMxam_!%;(v1`
ze`4dBpKb9kZ{<&HT=S2y_*bZSuyM^l&f=G;c(8HJ=Wpk|X_ATu8y}~p&OI%@mXl-Q
z4JuA-{69zY5xEv$%Q?xyZ&2}L<C=ep#lKC(kBw`7p2c6G;>X4{zpup~q2j^DHNT(5
zKXWC2V&j^BhQ&Xtl|Qj@%^zs-hpTw7an0weBfP0t#e<D&exb!5t>VGPHJ`7t@TRfK
z?>4Ua=UDto<zE}u{1Fy^n)0uWYkslCzft+u#x<X>`tYVxlz(kp^DngcJy-H4Hm>=6
z^@um+wDNl!XEYMxD@?qpm-4TTGb<9}t5CeDkMggLGmG{;EdBuHUmMr_D=q#o<zE}u
z{P7mQMETdoHUAome}(d|jca~|#h<ABYvY<<W%0Wz|Ju0bPqO%(R`Mq{uKANK{voaW
ziH$QF3DsHr&dR?wuK5iXznk)}jcfiii~lv{UmMr_85aLU<zE}u{Mi=&bmd<g*Zgl=
z{Nc*KHm><MSp18We{Fp9*Z7ELi?8L}XyJQT@+UT~`8QeocUt)q8`u0>EdIO7k2Ze0
z(zC_lYdL(il{dYo{A=Ty&sSx6(?67dZCvwjxA^~7{<U$<Ut;kiif`kZztrL%sp7%L
zHJ`5(^QK-Z9&B9mms$LL6%RJ9`O7W-?^g0BHm><AEdGnF{E3Zg{(TnzH_GoeuKBGN
zf1C2JjcYz%8Rt!}D*xKJ=C8K+JC(m|T=O5Y_`8+AY+Uo#So{x_zieFdAGY|N72n1+
zf33woTKU(;+m7KQ9<lgZ&W|ko7c2P_8^5rL@pTrT(MagW7XFh~{=~)^jp#d@x#*<z
zDjwEba+nYa{mjB2SMgxun*R%n|34}oY+Um<TKr$Bc(8HJf70T=pyI*CHGh-E-=X|#
z<C_1B#eYxv*Tyw}v&H{dt=DW^^M7se?_bHE*tq6zvG~hc`4b!0{O2tG-O9f<uK8On
z{&MAC8`u07E&eLyUmMr_mn{Cn%D*<Q`FxeCH~n1s*TyyfcNTw(@~@3+{wo&$73E(W
z*ZkjG{68!I+PLQLu=opC@+UT~`EOeM@3itKHm><^S^OK6e{EdzcUk;flz(kp^Z#P;
zZ&&`cam|0%;{QPT*TyxUuMYO62bF(qT=Vx@{PoJeHvW?<_=pcIzLxV33;(6^yNzr9
zzbyX$DZkse=6_`IXRYK<Y+UpIZSiYc`4b!0e7-8$n<gv2+qmX`YVoHjzuUOxhr?d!
zbWNV}yNzr9Ar^n0^1F>|e!9h9qWo^-n%~vpw<^EexaN1W_>U_8+PLN)Vey|-{<U$<
z&$jsAT*aT*xaJ>Y@h?&FVB?y9oW;Mil|Qj@%|F57m#TQMan0u|*}Z9;iU%9l{F5wx
zxrzrH*L=Pr-kWMvJlMGA^HuZSG)u*UjcYz%S?^7^sCck(&F8D{z3EOB4>qp(11<iU
ztN0Te*Zjd2e~|L8jcYz%>F-Sit^D4`8I7pB0l4I*!OFj9S#p>W37uo%XDk2OxaN<r
z_@k76ZCvw<E&j#Izc#M<=Ue>o%D*<Q`4?LJDayY#uK5>R{Ogr}ZCvw9Eq>2c{E3Zg
zKHn|jP2H7$ZCvyDjtXx&ww2%8IHQr!l@|Xv<zE}ue7-Zon{t(ZZCvxqEPh|*UmMr_
z2^N2#@~@3+eznCPq5Ny(nqOn_OO=0ZT=S<`{4(WV8`u1)7QfRf{=~*L|5}UxNh^P1
z<C@=O@&BXzW#gJZ%i@2k{AJ^sf4#*&RPk+G^S@*94_E%Ran0vDX}swe<zE}u{F^NP
zDayY#uK9dNjyDZf{<U$<=eu^isaW~f#x<Ys?D3{|RDZN_&A;8^ztzg0*tq5|vG{*d
z{<U$<UuyApDSz3x=HF%U_b7kaxaKdn`1_Q<Z2VC5J=Y40ujSlp;Rlo-ZG4^jp6h;#
zujRB_cvmII#x?%|i+`Mo2OHP?2Q7Xd6%RJ9`9HMyFRFO3am{bD_|LZTCpND6Yc2j3
z6%RJ9`FyvRH~p`Q2OHOXz9Y<=UQ+R3<C@QRjd{~+DjsZH^ZCv)Z~CM1myK&a-+ksy
zdzHUzT=V%3HE;S<`OC&N|7nZgP4R79^EX@kpD6#@xaL1=@z=KUCpND6e8-$OJ)-<;
z<C_11#s87=uZ?T|HjDpL<zE}ue7-x+o1RquwQ<eoJNUfm*UG;(uKBN7{NE}6+PLQP
z-GJV-OZm&jHUABZ{|~jEvhhjklG&XWU(5NUg)dWnw{gwiW$~A^@+UT~`G2wa-&20K
zam|0%;(uTH-NrTluNMCv<#!v`{Jj?c0p)ia*ZdDG{$tATHm>>mEdJBV?>4UaA6oov
z%I`L=`5#&QH<jOQT=V%3Pj8y9{A=Ty|Ea~F*~*{TxaNoH5+HAyrTlB-ntzDJpR4?9
z<C=e{#s9AIuZ?Sd7mI&~@~@3+ex}90Px;rzHUDsn|A_Lhji1$>k2u2OYdJ?+_(tV-
z8;?xmBeE^NmUFa)Kd<7!#wV!nM~<=hT26NhZ&Yz&<C=fG#h=j1pV+wO^Buq5RH@>`
z#x+03;!ja=V&j_6cME&dbQLEyuK9dNu{V8N#fgn;exAj@RmF*oYyN2#|85m0Hm>=n
zTl_UD9&B9m^DX|*l;3S!^9Ne|OIGnGHm>=DE&ll`9&B9m3oU+0D}Q3+ntztXzd*%<
zjcY#Nq3uoIQ1M{nnm@wgU#a53#x<Ys^!BC-6%RJ9`R7~wMimb>uK5>O{JAO~Y+Un4
zTm0KqJlMGAUuy9ODgWBI=3i#<`zin0xaNP;;-B8ipV+wOkF)swm49tq^S@>BhbaHr
zxaMDD@y}8IwQ<d_u=wXG|Ju0bS6TdTD*xKJ=1;QtRm#6MuK9cizc)=+{<U$<uebQ!
zm49tq^BXPx5z4<duKE150B<_7mEYSqqjVpW#Xm~<*TyxUpE}@8$1DHZxaRYd3B2hf
z<zE}ue13X?H=U;ZYvY<f&*Gn{{A=Tyf3wBEK>63kHNVB;k5m4&@lTXr7Fzs&wX!6B
zvVu2#sO-#7S@5R)%AWkh1z%D)KYhWQ(v>~=NeteUrR>H}W$>n+%08_Y-e1{)pVr__
zXRG$|lN-G0E!EyO3;#na^VVAU4%OaAE&O%WuE#9=ZPl*FE&Q*lT^lU?pQ>F?Sa>Ie
zKWX7dsrEi?;kl~4n=SlV)!t_<e3NP~KS{!yo>uLB!NQ+W?cHYK&#CtE(<Z#>|5SVV
z$rIl6d(|#}3WYblquRw!r0}Nws$Kka3U4}8;cr>^TGigSE&Rb&K7O}_Kcw2rPqXl*
zAFB59lP$dIQPp04%7vXGp?_HT&y*c({MJ@J{+||qq0;9=3+LYo%MH8F!7!zQWA$^7
z{n~Usjrs0#FnSAN&LPCNR$256sp-t`;)qd~A<?^cX9ml^CJO%IdBObGj%WFqj{Gbs
zW#7rq+;YdCX2Bay43^XF43^W)k&`c_(bqA4goBTk(vwm2{9Y71`zV%^?Z`12mk(!L
zEn?JX27j=aadLtrgFkyd<J4#${-lzBf`OeUhP>L9`8^#xM@qxUP`Tk=4n9Xp1CC_;
zBnQuv(oV%c*}-$9#6LEh8$Q*+jh=5^&UhaOFOX6TnKCy_K_sc4<aa3k=>}HMH03wj
z&S5?|N0O0WNKMTR4=`|u)KDpn6gDy7d`N}!XE5JrA-`8c_$MkphdR^}DU~-c|4awp
zBc*fC3YOn?3G>f(_(q4n*D?Ne2RHgh6n}(+8-9`EpX=a;f7tabXOx4Re)@A|e+mjo
z2A@mR-0%ekcH-fFYG7{oA`3s9_U&`S7dv>mlx{zq@k=fIak4{h_!|zsRZ8C?$h5`z
zkP2N%U~YJ<0~z@hhcZsimsBMA0cD?Y1`Zkibt)dNa_~)3dY_t<8@}4X4S(KkjF&mM
z(O@7AVL^I6cRTYZIQ$}0`aX{*?!2W`@b9Yer`oWbCkk!PWjT`^+~{+?!qw)b`Yc-*
z<rMn4;d+OkC#B8`Z*=f{DW$9Uq~MiQC3*iS<IhuM%G@x0C~0?^E(|)1aT??#?Uj5k
zjRRQ*g#4aw2jgi`@Ck<m^B-yEdd;ZgK8dNz4UE%2Nv6F+=Q2(Q`S2GOGCt41>e;0H
z<|qo0-0;l~Zu-Rza!GEu#ld$<=`~U%sJ+JxW<FIS$;eq>$v6dzq#Uv5ra_D^F|ZR4
z1&Y7a!FNjO0Ts7*Ik=I(g+eMfyxhTii~PThWc*$SH~bRCZ*}mUQhJ4kp4{*Q4sQ5c
zsu+LB!3}@m5XRda-0({jf31TXejDkP8-CQm4S)Rv#@+kD4WD~rZuoJFU!eFK9Nh35
zN}2zJgB$tdCo=w|gByPTF^oU$;0|B;eY1lb{u?x2<%XYiaKqoB<h%D%8~!^K&$;0j
zEdIi8F}}^g4ZlwY<G*$ASEW?&O~zk#@B%57oyGWT4!%xG^Jw784exO9W{HPuRQ$i`
z;H^?R=L+V(<={2KucuQ~Zuo5nH}YRo@^?G9xe|T<h0K4?!N-c67CJHIhX3Z^#<IC;
ze16};pH=nlbMS1D^SZLbhYr49N^`rg{Er=cmz18$X8aQeUnZqD)i@Rssrs4O{Lu&V
zm>+R)bDp|>HshTw{OH>l@8aMTekxt9&I_3iUL<(w_xQZvu1^jB%;Q<k;SS%#RbDRR
zM>x1SFTB``abp$t32W>7F@B80H|K?`6n>n8=Zik;rZWEo2OlqZ*0qeAQA&QNjz0Ty
zcg9b0_{N@B-pKeV4sP^sRO54=gPVFkRO54B3*Vr|;eHOjUP|AIGTuI=#@jO-{&p!<
z7qC799o)#NyqNL94sQ7G&=e{+T<GA2Kc|TCvn)KHrhvKOb1eLlFykXEyb~e0;bIHV
zR^!R}7XDi`E?sEhH(kbZ-1{O;zk8}P<E0k=%tefkad2}-#{$)lE_ZMfsi&#&-@R{<
z_2x97E6W-0@W*L5bfW4n*Eo2#lvdATeuahqQ0Y_U;3j_luKLj=2d@(OlNWG*arY}s
zf4Of7<L<uAY~k-Yj_aN5$T4yF?Ou%6Ik@RZ&*m`h-Y01A9L0C<2c%&{r9)Len&HSX
z{cFr=EN8ZbuT{8vAD@Z;D^$O`!Qq?s*3uF#H+-Xm8~qRK!?=5&U2oCn!)c7);_#aU
zFI9F};NV$;zrUF6=I&oL3;tMNmgC+ZXY_oV3`_GCN6u*B|Kdo-mpFK);5QXAzSP2p
z6f^z<3%~Mw#@+kWjGWq|7+-Gj=czbc;o!y&Z>x33eGX2;g-Wj<!E#z1oZP3<ZDf$#
z@G1w-5xl?Bf3<@feO8hqX#V5iL{n*ylE22mjomI${D&=k`I#)o^jh~xox6H4{v(G!
zT;%_q9GV;cv4fWi{@`@R%_yaR-;O`}q@Hp2KB+yzzx)!$f8ofX=BxCBI>t9TxM}Y?
zHBLV1;D-P16y|SoaKrx*EeUeN&p0?WU!@(&o|`Q^dld73?chev;1b5SSa=O}z})b2
z4sQDCQ04cn7XGRlpWXX|wu?UN4`n&-eLzM|H-)?R`xyI&ReZYl^%(xS%8%~-J6lBl
zaCIK}y`|5cH*>x2{WxQV-*5}#?tM2!f{$3t{nXu0Hh%w)8Xw+r<QqG`+mq$&a&V*P
zVuic+(U2KcDp&peU5B41cxQ#X_r>H3{-BC0_x_hE!6%I4df|Q+I{$HcogA7Q{+A<v
zuZBZsemi*GbVW1s-TPKdyUzL!<L><_MxR&Iyy6o_zQHe<&wTfOlX1e>bS2~NeI-Wz
z`U=Jm5v}!akFct}XaLC)oiTg1fcftIBSy}ms~LCi6EQQV`az6$bL1O-rs5yr;5(&~
z(u<g%?cj#rTE_S>4&GbZb<aq~k8^Ot&r$pn9NfsC|8?f)IJn`rUc>lF4sQ5`YJKP4
zPht2uir>fL^Nb=l+|R)cf6;ix-TNSneD3!&PqX-$itpanVE8>sneX1eVB{B+Gk%sM
z$MFB4=1b=|xWiX|AK~DJzfjG`iXGhW*DLwwJGkNBsn&NFI=JCysP)~&4sQ6rQ|pvc
z2Y)rB6My4O^E3yiFjHxs8pkeo@O6Uo6|lMCD;<1}#KW66G45WU-zxl1NHN;ia`;uk
zA3BV2_j-FHpRc^i4OcsSbB5bh#JGF?ypc0V^>_C=`OQ-A9wmROBgf!N6z*R4-d*(h
zx3WW%!|x<`A7!^$4!&39cc%d@H+;Q=FB5#hVT^yr!A-kb<}u#v;9G@%_-w}A>&y+F
zr^apfdh$}?ht;^fz>!lV_>wz#+;+d$GyESP%kmdFd=n?<sPWmoKHQAkyG~@jdmXqL
zx7VwA;8I798Mm)e_+1X3FZx`p#%=fdZR%Dkt#4%c?)BKC1;4F3;~ZT&8GA-<WZb=u
z+UUPZjnD4&(x%?K<}&|>jvRweyoz!6`e!qP`BjwjLcLnwt##yVmv}fzjl=GB&PL7=
zYTn{r&usX2sq?aX-Lm2LEn<D#>yr)sh8p*taOySq0ji(&ku3Z%G8gS5S@<)hjJwwl
z8#y<QVf<N(KR}IF?)AWCrZ}ZD^WE!yjhrXuGrrA{V`f4>RQ<@kjyGHE_D?l$aj(}k
z{cC3i%X!U_Gfw=!Uisa<{?^DDHjDZ0b+!io&1A;i>t=ULz1L76^$NS+UpI^V48?b^
zn>A;?@ii>Ry*}1lsrenHCtL?B8uuc91%015hR(lPQWs|9)i~*1A6qASE};2s5dXNb
z!T3h%u({#Aj@`)JDy_McargSzM!_GXj+PtV=kU$Sr|;##^2eRWd>)M@iJte@GVWgQ
zN@1YVv&wG9TA@&j;DZ$3y?)j3?;OE$!W1n!nQ`FUk&L_7qvlDy$FrRc8S-Bi1>=+H
zd>X``bs@{|;?!%#rQu2+_qtP~&%Z8U{^1sX(Fu$n>EI>~r{2l&=3W=kEV@=j8E3X!
zAFSuNX)OO}NB(@V!|6R3@9yABMgGL289&Rx_Y40fnkNLs=iqM4Ki=V+IGJz;<L-5#
zy+!^n8W?x4|1?*^O;T~_UgudS5%V04Cqec<O3h2%>ozk*{+mi4_xevW4vbOpe43+Y
zx$sA;cy_PP%#?a7qxk(6CEvY1lfqS{?6bLD10DJM1wS=PzyA9u<_~uGn}nYoB|Z;}
zf_GDKRp`hu_RlB{w%fH7C$#V9@b^l+b5%UJ*HxAX{-c4+cdwr$u`10}^`7s@G3WQy
zr!wEY9<omO^X}q!cCWXYE%<p#zKH_&w=REu3d?b?do*%t1~AUEO`V!0FHrS<)4`hr
ze_8RzIrtpGZ#tRfe9OVB1pl?_ckcB$roAWUGvB=~(dcuelH*=~Xz=wa{@v>gjXqba
zc1?2XHSx3h2W%hrdLC2nr>b7}dcsE0bC0Umy>8Ipw=2GTeW0=P8PoxD!|ru}g(7DH
zb^Ko8w;X*+1%IMH^WEzJiv{0)665ameg-dBeD}IOBj-lNcdy?w^{)Fq*Xv#{WcY_E
zIrAKSjQmrS9QQgsgFkjU>*HRJXXK1i^4;s}vPAzi-{X4S>*x&r;S$E(>*b7|_1|Uu
z2}d6z|L(<%yVu1TIq%%TxO@GZ!7ozsA9v*Bh(6~izI%O|!S|~E;$DYl>iyF#EdN<Y
zj`8n~TN!t+Lo@uhl>Y8@Xa*mw;?2F@%+$NHh2^-{n;HI5N+0*SGQ+=2)$3kYX82F2
zxN@%_GyFFeuzdIWF~jeo`0jOLhF_=jajz3I{OgGjbRE~M-i&94Ov;kNv^>UXFpxA{
z@;}aCyuiRABfs)W#%DUXnFl_0E#qc)#Qk2Wms;=G-z(jvaC<*|Kn}~X_qY2fJ?(we
zrAkkGAN2^Or@enwq4c!ZN556`4SRjmPwk7^^WG<vKKA@%)il=sXeSQMyke8Gzdf%o
zhCGhu6Tfk1gU-4AcppyYQHl940iVRH#C&&kK))FY_;%or1|0e2fd3Bo0*8(w`L7Ue
z;-`~*aI_CMk;Zzy3UUnYmt*Al<<RL@C2kkW=_k0~4%l9Ib>r@%Gk*u@lMZr_pDnmw
z&+dZz^~@2R_1pvUjsAW)hVPd{VWkqwL4AxI#!-LMU;X?Nkc0fOQSkAAqn&pH?yiRD
zxBUQjS0%2USs%pBd4utY(>vVnN!UKTDlzuOct9NE9OaleWd8>BBR_8Z%laVS$oIz;
z+8_DR;?RtoEZ<%A=-)VJ)3JQ)Uvt2o-M~I80C!hOp-`*fLrG2+@Ye`l=)>27oFjn0
z0dVyD3Ob$>>yLWw0vzK3{fqiHX)%@@Y?nKVQfx=z4+k9O7lA&gr_hz1-BFkB*aA6+
zfgP}4pq<AFpY41s@XG~fJ0o5N^3l#q0Y^Kp103~7JD{C~u76`3^!dECYj2cx^#FfG
zYnQt^{&M-N=jYg8`=a>E%;<O=h~}?epW}9Qq<^`)E?=%VJo!uNuT#II?dtO-ZI`?2
z_~q(f?yl*Vt6gV&N#k(9m#AH4J>s9Y7s2@*=g%7f$N6VA;O_2yD1>rwo?I+^|9WJ!
z;QsYUDaglpavk6}Pi_W$F!&4CH8?*p^|BqXz2-_<zkP82jO{Y(4u88$d;RUgbvL#P
z*9F+FCTQ1CXx9qBv0bL#c-vJ3a<E-Sj=x>TZvJ+4#9zapUD5ny?Ckdo+6Utk?SuX`
z?eg1a7uW&i^oxR{-B5nC`DA_+ImVuTeb5f5PdsvvkM==5quJA}XXCZ=QfL>-F900%
z!8k#@E(*T|aFm}1ILe9U-)Me}#>aM{{AleO5Bi{<>j6L5a&W&ZQ|je?v-7Bbb(i;9
zlJmYI;=Msnl+#IY|NfYf<Hxf>4(@{)`5oOiLqFoa8Ttk7kK;D(BQ1q?p<hOW{wSv$
za2zMA1m|&b42)xSg7Y|ucq7Qc@qZ5BIR38&9P2gvc>eKu9n_2aei(;X?>3N+^_uG`
z{NuoIY7ZyI(VlYvM|+z4PMDA9sc3dKc4I!a*VxT(=h<4Fkl)T|Pi!xaC)i$NH-Ejx
zZhkv&gnH4=n*?V$Snm$NvEG6xb{h{k+Ia=wXy<K!$7APm&<E}ORXl6Md=<~y4x1oO
zzKUl(?qUD^e{Fm&hj{pE+&FmW!LRJB18q2**YG@;s`2?NJAY+ooWGfQpnreE%me-N
zy3gDE`Kx&TDxSZH@m!+arq-3X?j8>~&Nob)``3dt!uPKSab1b?ShIfQevR|G)+qIw
z`JR70xEAUSvcG@a*b4Ho-YhuZ;rfo-!-?hKd2lx1$T#=xG5@RepgnIt*!vp=+Fe#W
z=ST6^IKa`r%K%6J=0}mg7;xlo037A-2ORmM0Z0BKz>$yVN9?}`qVNj=NB&a4QNG!4
z@yGvXCBGQ-#QoAt!Fk`cCd$4m;{Bq?G5%#awIIjD74P37-bv*6_hX~sSyA}epieye
zw~6w5M3Hao;NKrM?Pb5?ey@m8*SVpdrd`ZOJVy@j%kK^P;C0T%{wya|*G2PPAx1yr
z7xp9KCVp5?JTDlW;{o|bo?i~y8RbN?GqxA6D>mn4)(5W>P6vA;-^7Do&+fwa>zM=g
zk9J)&w%73ea`He9>VtMb{f9^4oA$Ebkv|srh>r&x?YtXsJpYyhegLimFO7oZI2mo6
z;k$2)eK8&o$2dnhCJx!Z*k6nsKW_Z%?_Wkf^YOj|v_Hy^7KhRLdyUwK<>Pr_4%qEM
zvV%!00LOV_tKd9;bMHb5h1Lkp^DM;If*hPTZU7wpzMhWf#P&fw4*-twfc{1Oo3t29
z4z>%=%R8d*hXaoCi$NdMQ|M}3b??UVUZ=Dg?2P>a?L1Bdv7H|Qe!1XmXT+-nXS<=D
zmjaG<UI#epk9I&i3thGAQP2nN|9NQF-YD(r0se~Ct{;Dn+tm?&{p54pu6<Gb70-3i
z?p=*vuKxA2&#}Kc5{EzklD5meOZUqahyU{>_19Bh(ssE|IrwtL;V-|W{`%FIs9k0~
z;-9w{!TBBM&zk|q`DZrZzXtoD9GoW?3*WyU87;VfJyHttah_ZUIL?!s0smjn2iG+?
zpEUKd9k9J)Vg8Bj#rZR~%d9*6?K184w+q+Z*e+ZbV7r>2UC%?iRsfFeGWGh~H9AVW
zia-vw%gFJ!%h=7|u8#QY1!z|^e;GUb;}-3M{zChpe@(mMwNF2=56VZoq5Np`uKXx+
zj6MDOpdGN@c;p}-?Spzov!_|l#%t%L&@Pl;066M{ae{bV6n+cfC_fKyloQRr(fk;V
zkL^PF(b_d0^g%t>1AegO;C@%8)XV#mzo-7yUEXI&&ijgp_Xa&tPA9?r`(s9qAI}Ck
zxDRIJcXZzj{fPVI=ohp<j@!78v=rKfei;q=qnvWUah$9YoX5$(z&KVXIFFNvH-a1-
z|K|XX<Ns>Fv0k%}=O3TfLA|)YhjEDYZUgyP@4^1wFq)l>-FW=L_8PnS?K~UWi*`nP
zVta8s!S))v`Rg@y^V@kN)QfiB1op&wcL0v{7En7m`N!MwfMeXQ0372sp6jB&if7x-
z!@-_t=Q)6*o!0@5^RBPrS;z5L@vQCeWgVZ(b@SACh2!&A=Rs|lRE-;7*;(83V2{sV
z+4(Cw<NVFc1O59OW**4%G@RFc-saC=#q(G3{6&oC674oMufTQ6c))SKVdC7s9;^|*
zf8CAiO6<R8{mA_q*JZ6y>NV?e|9WsO)Ei`f|G2Rg<YT@6&FiAk&gGyF+WD(_oi<FO
z^E%vjLOYkh`VrTajez4i6xW-`&j){@{AGY6e-q#+KLqt6AJ?<UUj%ZHkLO3!=Rg#G
zH2W-#!Z-UZ+>cP7&q{uG(UbRA@j1Xf1n2!##D_z>@cK_P?y;PI)Ba(W@QnRg4&u%9
zo)g;vum5a~f}7u0VLo2ZxgPj9{%nkbM|<8W`US6tTnchf&ka%V&48nx=J#G$f7Ek3
z@Db0FYfYJt`!nVjul#l!3w+eGDGF|WS;=qD7T}{ki=*J{0LOYa0*-btzp&%C!&cy9
zz54-2J77Qk6!xo2!Jdfk2i*DbZi>GHQE(IgtY^5B3RU&b%&QrX0Nx}N#t#KN8ovnm
zxc^@V_yK6w!RDKBfb~BN^f&$5e;u#Uhx>bp_=r_6=6{s9zau_Y!|HkC?yn|=LgNHy
zKH}v*zA;6Wk8f~eH`a&c(9d|O)ac_Ie74|*e}ufB<Kr8AzK?&Jyl?UG4ZhgNr=Ocq
z$($EVdkwzA$L}ofTO~JqgRk-N>2dcet(DyH4Q~32X>S+dZSe68zDaPy?<May`}hXm
z>f_VTx~a5Ha-)yIUlrWQr=JT^X@}&7Z}8oMb9{E|ByT9|MDIB<emLMb|I7kBPtz42
z<J`odKhC>H;g<;R=O-(l?SSW5Gybq05HAFM@cdgOILkSj+M6ZsizR0{h?{=FcEfSo
zjAOhm_!`*F^b1~(Al@wUS<W%QUj#Ug=O)hm^|lJ%U+)^h{q>qSXF0eI+7P8)j0ZfA
z7(4szpCfYo_DBDs-SUO+w|@c1LHlP%;hT8#`wQzm4(x2|WjkP;my3MHj|aZ-uOFWc
z`e3{nzx(a5Soj?O=-+7iWPv`%f<8GQ2j^YGfsb}B0UYNQW24~X0Y^Pc<ix>tz<AgP
z`~z@a>rOmQ%+CS+@xBb?<2)AmRWP6F1#-+Ub^7&5*VU?eao!RFeNF~BIA2A46Y#O#
zbkGOwfa46t&uGvG@m9d|K%ebV@D{-P0w4SJX@GA8KI&ftILbjj+F=LqPY3yn!9FNw
zFW^}3KETm#IU?Ubj+y@JAIJKEJ~)m=>!+)MACH~0h0o&>uD@`cLEPxcaftoV=;<FP
zO@H@~55-cie|$)lKBiv3J_S;*U!UP%Hyj5{JhPtI-b}FDAc_-XFEfs@e8hVLKggcU
zN8H%QZ)c;Azg?wK+BGgpyJ`gIcH#9)U-WjBLwm7ZjnLlz7yM}AkmCg7(DW~VeD)Cg
zFdySEM{s|9nmF{w=U9+~^8^!zEC=y&;j<j<cP2g=M?cOHzP~>v+FsLN{p~e&_;0rt
z;}hHaMQ>L$KhBQgM;w37j54kwo+EPnel+8)-;X%X<2Yc(Tb6_ISt9cNaa$_5KW@tf
zk2S8M{>Hy7AMqTK^Lc5P>A(K|X#5+iKVrLZ{6XCK%irESv4h`_#$T)t`q7L_em@$2
z`TdCP3L1a>el-4K`KbRFrCsG>Prn}<1^4?A`{UO;1<!L3Pjp-@0)5brrr-JfX#DH<
zqdD*R`(qWf3&+(jdb`Gh-LPGC&|b7B#x0)TF>Vph5jkvs^snisY=6X!zx@5t^gF*F
zjlcYU#CBnS#CBnOzv%5U@#*i6O;P-aaa$avKO%1Y#qx1qr2yokJrk90#%I6$e39>O
zR}s`3Ek03yj8DW-KDG<xW4ka;P);=Y#y<Xb;rs#RkB-tVwC4p;{DpW&{DpE%d%1rh
zelYxn^3k4%cf?;PCz||J`ODZXjqLU^?(d0z8GjA%9KinxxUn<y{{^_Q1LGe8UI=pb
z16~C9M}V90mgRg5cq#Dz4Y---F#i+4%YpwNz-s{i6!1pCL*~mh!e#@W2Dq6IaJ`2D
zo&)?YfENLt4mh?q18|{-SpFe|oBGm04&z3y`JDM?kC&-A{Ergj7lQmEg=+i)z)_!z
z02jKFa~|QQKGcVCBiDS+^-cjfIZ*FZz|C>YuLB(QX#l(i<kSO>eryC>=t_Tl9v$kB
z&%4V4`HUO=uwA7v?&ScVal_98oa;4u=lgKO$9iXg{#frUz;i&(9e`uKivh=amjGS}
za=r(+(Tn}^eZWhAzZCFN!0!Zn9N<3yyd3bm05^8xdY1v-2>iPNpAGnOz|n5^1D*r?
zm4Fuk-U>LjcNO45S8;{UF-r$Ij2pSA&km521N=7tH^;FZUI!fYc@uCEqx8Z1Ls1{b
zja-bkGbnCNLOt^V&k+LaljwON9pn^(oB@Cr0iLS!LMM=44)UX&7Y+eF##^-WLTBKk
zJ#qeq_B;XjIiOE}!1Dk<74Uq(`v8vi><4%e@Q(u=<0sMcY)_C=4)UYf^CaNMW6$2e
zM|-{)mdYqYdv1$@AB^)d)_X9{v)JBg(66!H=~3{3V7DCbO99|TfDZ;7<6#KkHNYPV
zIQp>=aG|U52lwaGLC)pGH|@dpUIDoIoW~i)i{$tmkTVYWc|N>I-sc0(^_un+`f$TH
zIoHej8-5A!88<xC^YbvzL4Cf6@sIisBRiXvBL()$S%4P-J{)lL*V%vzUBxHvbEbow
ztB7y(!1!d`)Mq|teOOKqelW%dtoIyfR}Sc31h~<Q^&9~>+Gix-B1YK<_rcIU<B4zd
zK>ILm>NB5ny(}jPKiKhkF0?C08pisJ0^I1u_<4Y%ea;75#3=jVehb>?8seMwqkR}R
z^_kDPUX~MtA8h-SK)Z6JVXV)EfE&FSzX))&&uG9!jIs~zZ=ik3iErAE_F>%AXFlh8
zSxyjsF#1;yX}}>=Z`d@3@_fLtx#Ivg*QhcyA8>PRDMQNu?<!@^Hc6T5HP?zVv={Kh
zrOcVR{*(FUT3yD?^;(P{#ek%K^qv#r=Gt3+Uj+Cu3`iOaxVd(iKdJ%zctfVV6>xLy
zEq}Zo@Secm0(dXLcL078;O2TH*8gO{JBgDRKNaxqfcF8sAK?7}H}?^+oHGD#2L1rR
z*8)BW@Lhlp2Hfm@vHYQcn`_`19|m}i%<&jM3-AKK&j#G|1?GPp@bSPO0l3*4Vg9**
z&j<b}z|9(*`R4<^7Wfwcz8mn105{k6vz&_oH*<c*F9qDpEgAm?;EmD=86N}qe89g6
z_*%fP0DL>(R|38p@NWTr0Pw2;&pJfEVSUN~F9f^-@N&Q_0bd08M8IDKyaw=2GU#x<
zlL7AzcpczHfKLUy2Jl9}mjONv@U?(90lpLPnSk#Dd^X^Dhw3-1|Mh?m2Ye3Tjey?(
z_<X>d0p9@lJixaCJ|FOqoTylzTL8}nyan(Qz;6Y7Jm8A}Ukv!|fUgF8G2pKP{yo6=
z0KOFP968yr{yzY`0B~~-;*V<pUk>~^fUf|29pLu?z8UaV!1n{b3h>Mf{f6~i4R{gY
z4*}i?_!_`h0RAxG+W}t-c$S=Wx!xZEUIO?!z-I&g7~tywUk~_hz<&yOk4*iB>)il&
z3E;l~d^X@40bdLFlYs98d=ubVGMV6dp8<S0;F|%j1N_&3w*tNe@a=#<2lxTNw*ua~
zn|{Okya;$9;M)Kn4fy{7UJm$nz*_)+8Sr(0zY6#c!2bYvCz))qo^Jp?9PpihmjeD4
z;IjeW1$Zmqe+GOf;JX3uou%KfKJNlv1^6Do*8u)Ez;^?_7w|lpM6&!30IvajAK+^M
z{}<r90pAaJza#Y<mj5x}jes8jd@bPr0elbOA(CZMj!br0ei-o4fSWlpAJYtYXW*{~
zJRR^|fM)=novk(CdNTnp2D}^Kjewhbb6CQBz>fs}GQhI|Ukmux0N(_-SqrfI-GKA8
zP$p%`Vu1DU0eB(cCjwptcrU<b1AY?Vt$?2l_*TI40N)9CU%=D9rZr|g&02<$Lcse2
ze>C9vfR_V45b!3z3jl8cd<ftx0OxxfOj-x{nSk#Gd^q3-06z!tELn_kd(9e+>*x*m
zNZ=O&Ztl%t{%F9@1AaN+C4e^pei7g+0KWwAEr6E-z7O!r0PokGwbJWQv&Q82MSx!p
z{IP(K1H1<Cs{o$^_;|n<1AYzQs{t<ud;{PU0N)CD72rDop9uIqz-s`{mqj)EcQW9`
zfY$+D2l!OLn*nbGd;{Rq0N)CD6X5#*p9y%6<JddeU$X(v2mE@#ivgbl_&C6C0K6IS
zX290~J`eEifZq&wZ`q7sdwv)2Qot7gUIq9<z!w328{q2!zXR}HfG+`jKj7a7yk8I3
zo_7LX1o&NmHvxV(;4OgP1NcV3?*)7t;P(UGNj7WPZYu%r4)_Crj|Tifz{>&uA>c~^
zZv%V{;Qt@sI{<$K@V$UP3V81mU3>l*@It_U0(c$Zj|1Ke_|E`e5BSdk-vam(fFA(-
ze*n*t%`dj|Q-Bu({xsm@0RJW6iva%>;2Qvc7Vuqw|1aP@a$LJT5BONXUjTd&;J*QU
zBj7Iqz7O!<0^YAzNF}zz?*JbU_$z?70R9@_8vy?U;Cldn9q^o7x864aF9rOMfX@N^
zPk^rl{B6K@0{$1kvrlsCeFyO2fWHTL72tmbd^X^J2YeCW?*rZn_&)&O0{A}x-wXJM
zfcNO_>i;p|#ejbT_#D7L1$;5!X<;ps|8D?10{BkA4*@*qWLKX<0j~nQ3*f5(?+W;C
zzz+jF?-W=5;egiwegxoa06z-w-GCnrc;2b5{9^#G1N>OP*8zS!;Clc+0q}l#uKb>W
zR{`D&@Wp_i1o&paPX>HH;HLtf*T=2558&efH+%2QTnu=B;O_uDAMoydUHJn6F9*B;
z@TGtc0elVMg@A7a{7k?zPjl-X4tNgW=Kwwy@FKt$0X`D&O@J2zz8moK0Po(<)#pOM
zivb@Ecpc!E0KN?HZvegxaPysrs_}HU-YbCL5AZ7i9}oDq0G|)|)qrmTybSOIfL8#X
z)!)^p67YV2R|8%I_$0vR16~XGGQg(*z7_C#z&oAc>eB#tA>h{n-URq`z}Emi1MqEt
z&jNfu;MW13neXcJZNLiw{|?|)fX@YdG2k}>z6tP~0N(@n&470w;Og^Tz>5K20C*$d
z3jtpN_-%l10sIcY_W`~H@SK6JKHmp?G~jmvJ{$160B;5SZosz!eh=XL0KXUToI$QW
z_XA!6_)5T=0Dl1R6@Whoc&Puh>bi>lP1UoT`j=gG$(W{r1Ik8UF!J2e(y|dFFDScY
z#Koh=l#V!e)PO+~DyG*~meo#gnpRy=f5EIv#*_^hP+3zkt*mKUMQzjc3ucWPHEP=Q
zQI}nptjJ1BWM#4<8)9l%H+@vXN*am5N+u(*eM`<xy(JSCY1$p^Z)$ha5~Er&VTrLV
zIcQRK)2Px}b+eMSW^mJolGwW1snrKTw9@#pg!PT>szHr2nnoooGq!1mlFSJel~Y)5
z`y<F;J%Z@2Ibp`cC}YUr=_Iu>r6Py1NLEydP33^6UBv^J-MTRY%SKT%%B~vIG@x+C
z)XIt(lWLmEs%KYLH#XHaOr1%eRMnNLtb($X55&pK4DOmdxGQxpiF%eOtZkTHMsBVy
zsGV9%y)NNa#g1VbZb~moT4r#ojLg)<?~I9c4YNj(nn{QZ)^Tu0L<SFE!)8pas-Bi|
zO}%0h>uD2f>#BKJ2)2P&aw4X!ojNJ1Sn9dMD(dPQDl3{Ard`1E4R1Y(wIKFrIe5lY
zJ{2V#zeZ}XT{<c?I6Tz2mSRl<WnL6@EP)X<F%J%+GfaHlPv*3-2c5x9)pd1^NePVN
zu>=I#XBBIb%=7NT+Nos~Gb?KA;#1R-8my>CYASm|L1T6GlvH<wB!#x){E2llrq?8{
zs*xIO*uhCkH6uZApH+c6DREtm)F`@gv?d`n_Gmu1vaVrzb$rn(y)?GK0Rzj*W=*SY
zsxGT<s7k5e0cB;h;;l+RuGPJQ{WWZQO~b7EimBIC#%BjhY_P*REH+r%A=9VQ9zkkV
z?U>A9JqJ&xlWc0$?2yP{Er(85lY!Lg*+HSfnhu#hVMcvpY87>5(w0;78Gy5z7{Y7q
z2Bm}NG!*?%m^{#KRrJMXDkKMYLy(-vWHqL?wBDXD{ko~Cbp{IcSU392EUvx4f(~dJ
z9Ey&_<kSrIlOr?<FSR2vF*ReK-;A2^?9rOZN3a!#Os}5WH0`?L!F1M1L|SlT<CQi{
zwvQWVqd0I1+rB>5`7cR9ph|F?l29dCL2=D(lF%pEH0QSKbIZoT4QpReTn$rV65RKS
zFSrLLJ`Fa4gIjFkoCU|~HO@J!H~|$PB7+^Lg|$CIiPcS0QX<SO4`K<6bELDPtK%}k
zbis~`*K`HW0Hwd+>X<a2BT^#FI3kv?WF3(LnQ`^_M0y3x;S$>bO0treQ?GLq=+2<H
z$P6}bLNenruaX#Rcrst(#vUQeU^k$h!Okx&xS8=v8^YVLb=Ae~)e2oc%J{(&Jg1eh
zGxN))4lF3Uq}@4fY{MwsJd#r{F@9amfDo@0+SfG>i7}%q-T^)V7YE0b?TE28QwI!*
z<={96_+(-yS<x{ZlB~%1qsK&gyatY;Y<y?CWGpL^O<bl<*F+`8VOMck!$i6GBn8SQ
zD>8m<Yg4anJR%btMPgVorl7danE^vd`)3O|2XP;wxk)UC+utzS6~^dVsjVoExG-ne
z|5nSmBc{NF?GFEi&ebQWsIC17NojpC0;Hq$#OgpYBRjXf)3rU}4W5!DAt<=(w=XEJ
zuCK(zIh`~8BKiha{z02{T9RYLgYR4%?1*AZVjLrb?_3<O<o0zn=i(GdjCTTRwLiL+
z;P~KR3@~Pj=AxFCad;`tiK8Vtx&a0xD>4pkebE}Pfnz9}q{R4jHPM<nT@#fUhpur>
z9FvHG_NKR%$oREwZ{lc)ju8eXX4{$GCL+=rTT&MRvA_EX7+~6;e{^W#n21?YTTvX*
zVg}@-CXPw8EV&t~RnbA6q1v^zA0Zu?Ia>9_=!*ZXdffh*;C68$jTur_)>JdCVHREG
zTvb+CF}-Qz(3t~<=2PO?AAds=s+iC)ttr&MvZ217zG?MtM8+^vT+=JQ20Lky!Q)j@
zA{%7M8$4yBYpN4g(nt(eQcI-!Ev8gYJH0_&KR-S7mQ7k@u+nVVghd)VM73<v5`&c_
z%aX)N(;8+ph9>g0ehs0C)9La|${HH0r_z_5Q)kul|BCw58$4-|!EIrKCoHmEgC{L9
zSV=N?!V=94F*qpHh1GP2Q{4V>N6MJrc@3G(*V0YpJDifbnITwPbv0e8g%0B@qpF+e
zLa!8SOJ82OQsew~HLj5y?;nfXadAm5<jYm3H`J?J(^4zCfJJKy$7zfBLyd0HqNuni
z#jyrb<J8!<fQ%Bv>RMy1Zduv%Cc3w*tg>cG*+jYqKUtFp4;Q*~SH>^ZvUspur*pID
z_OC37Q>y9QDHV#HJEel1&YggHB|KuU*g7EC4E4cYb4QKDRgNtgMvYX9mQf=Cv2jKl
z#jx~mmYu>N2C2!78o}NhY(|X)OcB?R&l8{cM+l$DU|o|E+3s8_VI_^kU?piTRi~$`
zq5e}FnyUMsf5|sbSEF&VgK+S0Kcsfj)P`x*qv|HdEjPX$xB{MI(`lqKVZrTemL(xL
zu93|nx1p+{sUoh&M#LU2Jwj9bIEwfU8+W%Lkx7g-!I4$iFjH>BO;}OWHG&0G*GO7o
z)XtX5mJi5Rb9P#3PMkPuHhoR*Tsk|H*Pm6j)3^ai7&=({gH~Oz`BfYKJ1uL!s>IG=
zvHNQKwI$-R#CGc1tvlA2*-m)Ty@%Bm$p%-jw}&<I(<ONFpJdDii*;hQv0?fs>LCRa
zsc^xt`U!N3qdOg&MkQHWJ3S=DwFS3L`7*^d1-Gl+no{09Qq`;^dPl6P<7{UlGndOQ
z;+uH};<YswRMLY_?5my<I2*<H-JPB^925oOnh7{_!rHj!gg&{!9fK#{NsA2b0U|Py
zfjQ=d>+Yl_VMSw~T#^y&t`!sOF3Hp-4s3Vkm9SZi#9;r?T#h6r;lAJq8{EjZ^d>1X
zSi=s9jG`qywI$VBrd}kR`QvhtL{RK*kf_jPyMU*jiRz&gsUOQGCMz;H(s(ROSfuG*
z!I4JYD`|<rN-Bx<)%EqXx(iKIyFQ_b>X8>>jOv=QiPI|TtCO`&a6{NONsA0_Nm3%)
zHFv^F8i~P5lDWyu{M|(A?U}U5U{%?k35ztX5B55>K52=;N-Bx5)>8f%A5Q{34+Etq
zY1vc2Ar+0Z+f_BHzA{-i1*>bmB1y4W+-py<Xr=LG2@5rG5XB6%YdtDqnX$hWaGvm3
z8S}2^<l=$8*O^{J7t+uJBuVWgrZ>TMkOxSnQY1V;GQ|egk-+`OJ&BvSw|ami)koLb
zG*wKX{JMJ1V|L8AmKbtJCf$C2*_c6PiAfB$xnE+O7uA~^NKFt14{%2KKv6eI;juM0
z!c%A60V%hxk(i_bg00JEBnqxLHwS$26>QU_M4G`ZSW7x3C9I^87_4MM5(~@9YNyip
zT2?{N7^|tTZmO+xF8sTobY`&5qb}oq?X%d}{IanF=)tgK3d=4VTNbz7+fg96iT^bP
zu1m%MLsMsf*`IO!O$WXHK>-0!Hj84hZ0d~q>S^?3_PW}7dJMZ8mD3NpP6GmTa_g`E
zjO(xajO(9#(Cbe;CTb75PO)QR;%8ic^=Djv)n{D)gwMGC>ykN7rSd%S8Q0%*(Cbfp
zOqhPqb&5SE)PKhH*L}wIPd@1NCms{E2VJMwF){HouD|*-uD|Ltu7AS8uixG7NbGC7
zg6Xp=8fj%cIR3R$NA6Ip7&Ge9B<kV~4QiL%B^78*dw(?1x;k)UU7}Sb>n&4H%w3ga
zh1333LcU45o`JfagVTrsaR~QaV8Po8?Qge}?Jv7X#cmQ?tHBe+0=gTfk?#K(Q$W2h
z38{e{VU$R%Ojc@iT_<T>lNB6YT@uXdD#3~EoS99jXiDqRZBYE9n{R(9Wpdr#67wc8
zGae_PvAMp-m?D~)lQqS`l52LUQ>L$F;*?32poo2$0k|&a&?dr+S%V|YY|`uR6yo}l
z!Uzm*wNGGz8`MU2Y-RPPf83j}K10OTTV$usvU>MFg_cb~VC+CrC*lMKfViTQo@II|
zeLEFbd)rZuPqFc<XPz$+^+``dD;pZGn^@n(r`M#!1_w@ZV(sq@gF{}=2I5!OmK&_K
zBR6KCTO(btlKhRNvT0(%f;Dr5#XEGwt0eX8L>wQlB`M&OX?zq*Qs+*cCF2q1TwiZa
zEBUeeuEWQ;Z|4|!Af1l6__*|pH!?&!Tt^prge*PPqpnW<<0}*Ry8HaH!PPVAQ68g`
zJy8U^XfWUA(ir8|mt?C7?g}Zb%1nb|v}#g{T4kz=(W(wt6=$z6q`Q@B>6c`xDV%8i
zC6O3^NLbYbw<&5hNvyV_I4H0cNr(?_z~DgfiLH@hpUwkopc6*)Ujq_n4Xde`PIu^6
z(vL9GH}m;r18b{B@${no17}RH4mvRE)5Hf?HeJ_PO+Sfks))*@!LO>ia%R&7m6dQ`
zPrHXn1(k7BK;I9S(UlAOXIF;FyqF%8QAR(OHckEPWpJE~ic>Z{B1B|MZ%v_W)?0;H
zpx(g&n26q5c97mNWyi7gAyZs4fCZbFu9GP}k1rCzDW|&XYs`=`8d}=#l)e>7a5Z$L
zOKPeytqC?xP;2;JAiCBixz+?%6V#fdsxhqzHk#8KXKpZx_R<n@ijg1OjE>8Xy~K6Q
zl(havez5)>mv8J7%l@>!qCK`$TRm~9#umZ4YFi{PHI{`PsfnFJV=FB4K^l4NTS^bg
z%rhl5#SR$Nrb)rK$tKz+Q&X^GQc{yUA584~FZJuj(e8TWz7qeGG_G@0j0==!slh#2
z+Xi<f9u_HB>@{<8mBsD`+;9JDmC^D(m6e$g4K`znD~oMLT4MhfTNYPk>cJ#5V)mcb
zK+h)`d+sGsC*T7*@Ga`7e7@1yem*w#iv%=@?|YF^>Su18>xzwQ^b|-sV*-_Sr1`1U
zB)<F3#pb?=Z?diL$fW_P)g(^m>xlD>+{w1y)EWCB+1_@VaVOb2%~B_s3nWsjNk<~T
zeK*9tc5@8MLy7-e{ZTPaza9^ysJf`9-{dND2B*NbMLqo{SeXgq*tJDHB_>##f8+^l
zT8b-+9V4l#EKWN{I{_aQJEpd>cI+5eWxjLk<<X}WW~ht$MWUIi$1l>{O=Lnnc=i`X
z?%3$6c1Ugv6BxP1@Tt}}DY>!qb(du^uX>4M;TV!37=l-oiHo!+o`GXg6v45gA-<6y
zir^SVFyUarHz7;JQaG+bIeC3en5A0Zq~yl3uQ;xqA8CnVh*$>hkl;8pZs&29$!naP
z;8+@4LqtMR5lgZ}aqO?ZqL?C<+zzdBf|r!BV&x!I7f0*3FC~1*brfU9(YjPt7prw0
zS*0ZIy42Set8H#i`v2K`8~7@!Ywv$f4ljonF=Bv-*o2pAP=uT$KvHczNTN|uqeP90
zCLsv~1ri`gRMhy|sI(<5)|9GXwQYjdaur%=ZH<-Qn^xOmrHYnnP}&BeEh<W)&^*7j
z_u9$MoHd*?;C=3M|9|!;nKiR!uf4u|?KOMm%$yg0_dxTUakUdOa&kz7wb09qY^~Em
zFEgfUofdkTF-7aNpk?{Q%*jfZp+#5=T4Gn0-lauY3tD1VrrxDRSPNce=v`Wbc}wXs
z!+Mt%VHSE<y56NlSPQMn$<`fKLT_YbYn>K)nK4!Cw9w0pDO#rmEvdswm!U;i3tCc#
z^)4;KTF{a@taoV<)`FKAdY2Yq-cq{Eu->Ibn1$Yzu6Jn>)<Uatrs@tWp*J$JwN4AY
z%$TZmTIglQ6s^;OmegUT%g`dM1udz=dY2YqEoey{*1NO_Yr)G5y-SNQZz)}7Sntvz
z%tG%<*SoX`YoS#+Q*?)w&>I=qTBn6xW=z#OE%Y*Diq>gCOX{%FWoQxBf|k@_y-SO*
z7PO=e>s?xewcurj-lavDx0Eh3taoV<W}$bb>s?xewa}`Z$-2Wz=#7kQt<yp;Gp1^t
z7PJKB6s611BCG{1so#2+7GW)DN&VKlv<PcKOX|1YrA1f^US{ZBT7-E^=`zE5mlk0b
zdRMyMrA1f^t;)&L{Z@iD$|q)IYn>K)nK4!Cw4f#RTj?^i2x~!0>bKsdMOX`3Qor>s
zEy7yRlKQQ8X%W_fml=AO7Gd5}y3DZNrA3&9-j%L*X%W^!t8y}Rzm?D%8QEH=g<fV%
z)jBO`N&Qy33@yT1(31MCcWDvUf|k^8y-SO*7PO>(>s?xewcurj-lavDx0Eh3taoV<
zW}$bb>s?xewa}`Z4Bc-f^hQRu)@eaYAWc=e3@yT1&=R|*=v`WbwV)+-P1d`#2x~!0
z?8?%+v<PcKOYF+jyR-;vVU~JVh7w^d^fEK7cWDu3p>&z)dY2Yq-lBeI<b-wimCzd*
z*;=OsErB#u=`yqkYe7rwnxc1U5!Qm1*fm-2(ju${EwL+0@6sZy1ud~FQ}5CutOYMK
z^e!#Jyrp!RVZBR>uo2X|%yhj=i!cjZg6VI`$JJ?gqOOsXuA`xZ-pI(-IxX}vW2)9^
zK}!mQ(q(87)`FH42E9v*uokqWFz8)cgtee0g+cGqBCG{3GxRPk!n~z)nPI(4i!ckl
zD_!r>BCJKabF}4&s~jgNG*UM@L1`<$*L!E6_oj1krsI&VpGzNcZJW(LW`$+HDUNf3
zOGleUU0RvM`#J$hevG}5kBwyi8kcK3PK4J?J+s5T{T<jVoy)%MX5G_dHYER4FT~qM
z@0=m~&*ggKSQ?>xnGML#PM7_6uzxec<ey^f_U{$H`5eE&?2GLGh&~$sM&>V(`77D3
zhNTh4&TLPIz0$ejmv)PeUkO(v{{yfdFMq8t{$y+X8~NJFGXD<to5<1#V`sL14||Ef
zp84~+BJoo!-Ta|Rvj4qoXU5O?bNdg%Uh=<Hh~E&wzt{M$5XS#4Vf@d#S>_+5htHW|
zz*)Nar@>z0Prp?+VERw-qvPBiKQI19f&VW8|Bw@9{z~RI`ER=6<{toiiNA#T&2dir
zG#ACo|0MI9`egsMz<<rzGJj2+{9f^UTJZml;D1f7?7!|P{cjNbw+a4VJYV*|;wb$;
zFZkan_}}D_KaEG}e~aM%UBUk!2g&_^lKrQe#AWHuU$60hMezTg;6D=+B)RH`eRkQx
z{+HWItjFtro8W(!;Qx%Fvi}J4q#dFE9fJSA3jW{n=zk^qPd!5ay9ED#6a4q}IR5L|
zf2{e-Yy9^L{{Jrc-*KfJ|5fZi>j?Y5U+~{9_`eG$1u6ep+5dzi^nXzBzgzHszeoS~
zv;XWP^xsGIs^@$`^Z)yT|KEN^?*9bTr*fp@KbZX+d-9J<)$Zfh9LE`_$o{k0Khm>T
zF?L3IChV1t<7M=<eE!U51^EwS-JB22dDSa_lLh{Xus8mVoVHZvuVMZI1H{tU8THw)
zm-t%*emWN7<sT>T|5F(M1Gs*c@_!5SoA?=CH~)vQm-s`=^#pF>O!1%UgFjv1|Chjj
zO_j_)m_hd%aF%ZVD_}42r!s#n+Y$eleDI&m{ARq!{sV#kiA!Yu4hF^Pp;vM9d*yGg
z;QvFx|L*y+|4?7;)*QbEB3}P91pgli{tsO&`%hy3N80~F!9UHZhTq69dGvqWQTBh9
z;QwR6fB#$L{-?8l!|6Bv<%0iD1pm)@od2_q(*JzH{{g}O&3SVFvyU?VHG=;R!T)zK
z!AbL9?os+*F8J>h{0|r=`!8VsX8!Oy{`Uy}KNbAfA20haI!ga5*uR-SX#V?5@c-kp
zWd9}X{}t15mhR(W9qg43ZQG?$IR9LR3MQWByyP{1HVW}OB=Gk|gHrxX;2V<0pJ8+J
zd--20`2V-y|Jwet|19<&F^*Zr>%U3x-zE6}#N+%`bCmsG&;ITFp&P}9-^e8%*RRXj
ze@l%1FND2n%auRth5We&ZJF_ml|Ro5@e2t2doGg4?`(`K72{8D_4MCtd*#m-A$|#h
z|K(qk{pYg(LgR>~iMvrRgS`~LRv~`HFf#p#6~C<le;<K=%hzT8M&^$gP?m1~7ho^(
zw=sV{+tK_r8|(4%?-0hnpTK{o$Nl5&%<txPZ+ngZE+KyX1^>SvBgbz?ocZ?~*h}$C
zyDj?qf3A=C?GyMz0)LGM|1RdId!}}A$FItRKO*qofQI57|APYm0D=FSGv)YqFn^j2
zk99Zy6|k4$U&Q?BY)|>Szz2UQpvTXie+LTujt74#2g>+2-Ei}NHbLgE7x=4v@FxlU
zg9QErkJpa{%wKN6S-SZTEtL5;3HgJU%5mpUs=!|Xd*k28%|&wlY+(L&J&fJGFm^_<
z0rpClU^H58W&Z7~ru?}H>)fmpYyO@f@DCB<f97#A|04sn<9+Pk2seKk>?QuD+jYlF
z*pT?~s3>m!Z00xpCHoTv{vX!K{3~!@or;^+z3nxBM+E;#g8$&{vj3IrKi2W*<v(BW
zKTPl+zC-rka+LlHg!~yU`2Vj5W&iuwe_@RL{}t?|{0ZHm4Nd%L{O`hentX_r|FZ=C
z5d!~lxTqvg?&lx5$ZIO@d~t7wU@!4!Gr!>^{(I40y!@2{f3m>;I!@{me?IfKQ75e8
z=6@CT5`O{nx3Deo*JC|i{u+UQq`;pvS>{h0q8+<=-P^~*UgA%z)A?h^AE_2Mf1SX8
zvcUgLnan?d`BOCpM=?5|nqe>Tr!jvETT=XSsT?=|3W0x=!2h#MnSTcEOHgsg+r7OJ
z_7Z=)5dQ|W7jOPF3jC)C{1XvBDgO(Yzl}O!6*vEQ*h~D*oqFI}*p}kI3hVLmKPm8k
zLEwM%BAGuuQ9E|?y0;r)FY&i9zn%XN``}+M@TUm;zrsb46#p#d9~UG4e*t@mf4dO>
z)js&27x+^J{`PZa{vte=q~eaZd;2}uOZ<&@>5kj+e-!P-n?J1r|7d~#T#xwAV*WPj
zgjL-9U-pRqdggCoTgv~nSdW)~o4`Lt;D7ZTIsRwkeF0S5yzcE+U@yhL`tIoXKY{k*
z<!=-C#|r$vDwp{q%-=?xu!@`i7qFN3>zTiWZ7Kdgz<Rv=dj<Y+0{^{u|D|;Nrk<!B
zyLsK)b+DKC^Y4j{f3pw%4uSuR0{^+?GXFT{Z`0lAUb^|e410;cg!x<8lH&g~*5i$T
zp9I~1`}O;&0{;`JCdI!G-#Bsey0;&LvBaNxul8@xKR@=tpD6I3Ch$KqTjmcje;dco
z2seK->?Qte=5Jv`ivP1%k2n6K1pYLE|7x@;#lJny_!q)n;_ndRztIPOn!rC^;GgIb
z|Gja>f4oQh6Ytac(*kBH6#q?-@y0((;6Gj9pI0Eq{}nu!qvFmN_jWn#rTA}Uemnnv
zj`rf^j|lu{2>e&hk@>eWe;akeDsKMEU@!5v3-SLY+KHEchQLqnDKh?zOq(h5uOF_V
zO+C{E_x4!WD_w%Ap=HxoqvxL&u`6EwB7y%*f&WU6*S{N>zpXb`cmIw0GLP54EzIA-
z6)FF>U_D;`a)E!Mz`q?2MWy*?)d=m_9dGycYp|E%UsoR;|NrvAUoG%Y68K;D$p1#>
zZ`0lAUb^{T^~nE5=5Jw3ivMr19&h}Y3;gK<|9gGq_}B8p;pTO3zYTjS{zdmk$NzUe
z`0EA!u)u%swKD&5=5OQp8R6!ygT2IG&HOEFNb%o_^?2jIO5o2B_{ZWtvy}g{PSTFI
zvwtJp{9k~*#Gn3vj(<KI68~#hkC%U~z@I7bPrO3r&l;&6XBlvoZvOGGm-uU$-#&l6
z?t}knfj>*&zxphhzmoaa$KWr7y~Mwg`J33D;{T=({!Ie^WPyJ<F2JPxNj_OSuG4AI
z-3xd8m%(1*&wfxFrd#|weDH4(_@@Z`MYt&`@i&grj@Pn(Bi#HmVK4DlGQS=FchE?@
z`M*`*pDOTYUnTQr<9)$Y%;#|Q7PFcS$V}Kv{E7Sl5Ig?wqJF&mI|P1uPqT@ik#oN+
z^RNAahK!Z}vtcjsN0{G^|6hIZw+s9^0{?3s`CpKt`JaxF|G)Rh|90lj*UhNw|8^hz
z`vv|l3H%>kD98U`s&*Xf`O!aMFU3FoYthH=9v}QpP}|$D-_H{G??MIX_$?Tt`L}4%
zy)=1e6t}@%;xA!-JO2NKQHTxAdBN-X;b4LPY=M6i-hU<WCymvPV)2iFy~N)n@PFWg
zKUv`avcUhM$ML(J`IGc8a@3f$d&_a2_c(s{3H<wg@Q)MtzasFz;c@-2cbtaouvlqT
z#oE&S(c}6d`|G;nC0v)zzXz}$Z~mkU{O1V#H{(OSQvU4vqISHC{Tt!tuYtYNxn4gu
z3jCk?;6Gd7j|lvmlVtwZQ#Em;0cYvv-vE1wzk~Vh^VcCC{P_a^G=cw3Jm;0-UvioT
zj&=Up278G=?Hf9O?D>Zr#hX8c0{^)J|K7V~{=_uR{|d+52zUJd4tt5eTHq(7c=<~N
z{^<gLO|8toBToJ**h~DI1pa<L_~#4!xdQ+3Uz7Qp#_Na|n834i$A2K~C4Oh6&Yxtq
zqxolm5B^$#KTqJl3J=A}ll%P}9n2qL|3<j^FNeLvpUnLEY)JfreemDI{3hSX{(ONy
z3$Ifo{_NAWV>hpR+w1(lLWp0!;C~FRQzZXqvwy?y6~9wpFU7A!82=M|#II4{zd+z`
z9WC?cGC!v0Ud0{1mtZgP*9!b}En(te^4cr@PYV1O3jEJZkok+4Kdl!%vs$`l*h~B?
zncqJDjPSv~Uf{n-;4k#xuVa4W-ypl=f2jw5i@-n92mkW|{|teD-9kD3>zRL+0cYvv
z|32)c`0o?)=M*3OtpfjBU@-oT9Jom4AAE)eo)Lq;FYG1$Py=95OrF#HmFk0ko524U
zv}d@DY=Z;x<etBan7@%AtYYkp>d&y3_*0qR<R9^m^}*l9{N{Kk`%8uVnR%zozmNId
zyzXtU`J-L%Um*Cu;da^oe)ezrZ{iiN|9yi0%LM-)+#&lPhvS;ck^1jo|ATci>i)y!
zg8yf)k^R%WL}dddmsQ;T{}Jq!F2SmV)dJ2RbN`CQe}a$v>C;C$w)qPM{>_tR{?J6t
zvn>Yy2G~pdo4%<HZT?9<_!9;GD+K=HESZ1DB+VZy{@1`>;!j-_&7a|ef0V#~rNDpP
z#WMfOaD4GEg1y9F|4=mlWFP!#0{>M4|9jJA{_@QD;{P`6CH{Tij^@wy!Jj4Y7YY0~
zMP&YD<TaI8`Lie@^B3_K_}KY>mJj}jz<;&CfBICJ{}sG1ib^d0FT!4mf6I5G<Np;O
z{4)gpYXts$%zNa?eg3V>R`@abr^8<2Py22(|1=-`MFRh|0{_2(De-50DL(#ARFn8u
zJ`&BJ>w~{s;GZS%54lX{Z^v^rDzWls0PH3Hjz^>U&-cM!E%09_@c$0){~%B9{CNcT
zRjI_{Z-u?YU$Q2e|3V-9%LV@H1^(MEm-!3uzEUc&o}bjhUgB?E8_j>Q5B_?AzgXbk
z+)w5|7*Y5!<G%s+5`X&lqWKGa@UIg1O9cL`6*B+&b2a~ZjiEQNRIJ@wjx!1N5`W_p
z+OUM{()HU+AN*?t{!)SeZrpz-PwxCL$<>bOo{?SL{I|ni;_ndnuk^wHw7@@G;Qu1>
zT;iXfr>VJ_?k>3bQ(-Uh7d@#vUc#0X|EqoQZ(_&x>#s6_|BOL0fAx9VaZxw9UUBn#
zz5Z$u;#V&CPrgg`-^%`zbQroR-2P95y%fJqLj11x5x-Xi{tAKrv1Ky<j`KBgEdKAn
zUgA&we)Ra4`rzL#@XrzWANQC)_T_8-SoaSe@t8kqnIE?oRH6JW_rbqQ;GZk-@AkO=
zUVnl1Th9KCaOcl1kNfW{nZK3|iGQvS{(a1EAAdIp{C^uM=g(f|ck{Zpy^g;QA$~Us
z{+EuH{qJM{hTkiG)v#AgxQ?|;=m!WEiaq}GeZ;R%Uu{2_8>RTq7x-UHmH9j3<bNLa
z5`U_|U*&^8QQ%)7@Q)lV^E(&nj>o$HJ`DB}f40EC*a!b8fq$XEADAHXCozAT?nd|0
zoxcZhpH1Q~V19G|i^hMc5B@ZPze?c082-_0)b+>Naq{PT@Yf0awLbW>1paD){|6rY
z<;-v5X9mC>|HnP}*9-jgm5ydUFvqpm{1XxQ7YY2Ac|1Q@#r)+4oTZz8hR5@RHX;A%
zD;479pTYd*_@n$wg}w1_WEtLP3w2cfbTGfEXS(6uz8>~U=bAq|1pYe({{G`-{|DLs
zIOEtOehILb{3rg9dew9PnfiaX;NNTfON8;K?-VutH}ZqUGJont8n{M_?xnFaioLLx
z_#@0;!WD`CJ|Fz^h4DWP_Qt=F7kZq(S22I00cC0Ij5-hY68~D}&$syLE#>a~efo4c
zeowOhSjYblVK4b_7ve{6iFNz;8vi<B{A-2re+L&>Xg2Ej*~a`cOrTi0<M$TqCI0*-
zYPEO%(p!q+<zFH2-z@NN7%KCpGPt>ZVf^m=G21_ey~JP3{AQk|{G~@K@$xq^zo}35
zw+Q^VWy|~%;^g-l|FweuTLu5=xw8N4qx9b-_+KvgpNZFLQvT&0rT_JU|JwxrWhcu1
z3y#wNCc*#hg8$`%WdF0+|2UJVELE;rI<N6>5&YjF_<slAGa<#lj{PsUe9>yW{#ynA
zb%OslPLTZ{Wd9S6(EnD!|DA&Wui^wD^*;^I#i*pJWzQns{%;rj-zE4@^Em$V+5g}k
z*J>?Z|80W*y9NK>MT1iR3)w&LdX;$nw+sI75&WO&G5#yqf2{MTSN`u4{NF41&-dv6
z^GE5wL-2o};C~gK^GNaEdz9nv^rKdLzJH(2KlJ>;jGvKj<8wNa{|@$lcCXRzu{Y{B
zVXxY9T|ckn^JhL+B>&IAkvSil^QzbQ4Ho$6`Ges$ayKqeCH|~SwBrH;%F@^w^)A>;
z{M!Zo|M0<|Eb!kijQ^S?GXFiyZ{lZo-TbRzFY%`~Q&f82|JmS!f1JSofWUuXfz1C3
z^Y1m_EZzJc!d~LfX8u~Xqx|`)5B_xKH~B{P4+{JR;G{^opMPw+R6EA$p;vM9d*yGo
z;D3eSf8~7He=GYx()m9k`2U*Ve;tl<ssG!Kvj6#l|E~-Fcikxa-*uGzFA)5HL-5~p
zv+RE#`*)AGd)sULiv<5G1^=&mod5S9rT-Gae}mwE2%eKk<KJ<V@vjv8e^c;32@{;;
zzYkB`N1FfDg8y#`{%7L`ljJ{<{hRs2Oak$af34tumEb>oyzD>uDE-&5e-l5N{~i+j
z|Iy?9KdJ10o9Q@9cmIFq@&2Fn!ujX-2(*c3tn>d0A%5Q$_@C)7$8Y~p#&4D2|6##@
z$ix3Z_8;r|$!q?2MDX7z_&<o}v{L?N<9#($OuY40&-Ihp_VWLvkU!rM{D0Zw`ZdD-
zTa6=@?)=Gyz0$d^A6td|dBaEktQX?9THv2DU5;Pqat(Z>@!KTC@4JHkZ`>>UPh|gv
zG2-_C?4|g%3Gv(EBYs;1{znA<dH2cu<;)+6!Cwx0iNAyS^Vy!}uXlX#ZxzP>F@e9s
z<N3jp%<s-u_qNyZvt5Ya8o~dr6ghrPapvDUu$ST&Sx2)%@9Y0vKH|4a;9o27Kj6W?
zp80Wl?N!|IyVrxiNZ|jw5B_}u|KkGxH6Hixw=jQNFM5u(rMtr8{(Uv`r*mD(-}im+
z9~Ah%C-6HS{Ck<-_&3Pz_<!c{{AsPg{|_Jhq5i0hVqbqeA@Hy9c>OpE@2jLzu0{9K
z&A-~?_2X6{fA;y{PZId=fxYo><g6n3_^o4p$8}yacBVsD!CvWH_1c+#J6ELq`N#)<
zs=)t!A^vY*fM}%LuYc?CzCJ4ZwCG;C`Tq!eiNED3YSnQ{)KY){-X}izCosP`|5E>d
zDDYoaC-YZdsU5p{-P>OCcb4G4N$@}UHram-`;T?}dHFwE@ZT)>f7RpjQ%@eH|6Cz|
z)(QUe?~(hzjr|wtG~g`gIev^{I_%Y$xbi=h-?(hzN8{h+BYz46{-*@~pIt5UPrz|W
z#howi?TxUP_zRdnSvR9T|CN9~ntV2TukoKH@INi^KT|66r!#*W`!~YP-wb<+zmoY|
z*pTAi*9U*4!2gWE|6-QRpNP0par3&jpNGA~pY|i2cqY!oAM(LpBk=!N;J@!WnLmm7
zQ#FR}jL@GuVK4DVn7@TBiGPp}{yKqwy}&;=Q|8aQMmu)L+r2#-_7cCk*^egd_z&^H
zze3>u4}rg*NBpyyzm4N(gquI$5&vX*Sb@@_miqj4f)D;if&W>7|3bXaf;_p;zsc8X
z$8KKtb{_1d_-|)^JN`*N_@5N`pA-037t8#kn15W1{C^1c68}CS{v&+wuNU|?2>cJ7
zEAvNY#TWmTu$TDP|5$h2j{is>{Lc&g8wLK69`Vm*{x;o>?xj0_hIz!lmHAuPlIEXN
zeDJpl{67)+Z$C$l|2Q0%RNTDo?VDjQ#lN0Ecw@&u)d&AJf&Zrh|LW^y{xs%qQ@!X}
zxcMJ~y~Mwk`CHhO;y>00f1AL+N#M_zBJ+p9Ma9kQ-aZrd5`PIjEJd;7f2t4uy#oJc
zfq$e&{0B3Co1*AhxcP^9#J`sLTiBH1Ki&s_hrs_cfxiG@qDZ;t|Gja>{~{Pm@y~uX
zI{p)U@b?L6d;9hK&jtSbFwaQ*`{IoMov@eq3z*-I|0Ey$i30!g0)IcmUgF=1d69}c
zU)<YdEAb~jr{ibme})hKQ3C%jBz}+hZ)5&8>V#FI_&wsE#{4a8OZh+92Y;Ht|4V^?
zc!3=M4JF#Ko7cU40_>&uw+r#l_Q9Ve@V_ANPXwowKbx4pO?RVv>E<7gdJ@0+;A;z8
zQvA>I!5<O$TLk_;;Xa|n-&m?0yLsK)TVXHpx6qqSQ0)BwiVyx70{@Ew|3q*~{Esky
zo1*AhxcSGUp2WYM`CHhO;y=v?f04ldD}n!BJSUU*m(SLY-MsGYI@nA6jT@=e-to`%
z!Cx-$za;QKQzG-%F@GCDSjElXTq5(YXZ{wprTCxkgTGqf-y-mTqp!?gQl=fddEMI&
zz+Q@f^-rSXf1wZl<pTe&1^zyGoh9W@IrF!1{ETq(cj0xi#9z<+Eo?~fzt{(Vy}<vU
z0{<Td$o#qG+VOS+&eF~QTi8qd`SfNn6#MyMfe-#w0{?#r{Pdk{Qv63%Xkgr)>Q&tQ
z=bJXcW|x)BZ_l4Ieekap_*;!HI5Hf|J>LIO!2IiND9g^MmwCMZqlx*OxFY4xl|J~N
z7WjW7@UKRjQv97c+A;qOyTR@5w^2L<dntbkHtGDa?>}GdgMX92|676o&AVm(<#RRR
zS_8_`jGIw!gT2IG$NYBuXZhgYBJjT~@E?G4DgL7>HDS39qrr`e|A(-b_|rB=$G_MI
z|5kzj6@fpTBlFkI)5x*%e*)|!{vzhL<3HO6{|<rwcLM(hXj6)R`VE@DDMtMF!d~Kc
zex?ocdF1H$t?<F$F7W?e;D0+J^KZxdLaD^cpEn~ie?Ifu$8V(%{`~^~9|Zn0J)WPQ
zjpx!-wrJ74RI%>fa-1}e=clzo{BQKZufD7pe(cxpTLu2VdE~#dP(#Mz-|3P6Edu{S
zAN+#{==`(!UlsTt^x)sZ{K+x$|2_}?(9fgue~}OVWP$&W0{_R*ktg^4pB+^?{(WNb
z?=x+J%`OGZU&2Z{ertU2j}!P`GrrKK$>Xse*Kcjr+VMX2Z-lWk+h6dwep@f_FZ02l
zF7R&?_=n;RN>co{F4BaJ29%|n|2Wtyoh$x{&+CD+=bu}A@SiR4|4HD#`#71ua<K+p
zAA|pP*h~Bo=C|kn+kEin3;eGO{CC|Y^CvIS;IG8szYX>hf4#t8=Yzjc;D1BlA5bgv
z?~0SZ59}rWtpfkuKKM%n{_O()n0saZ^))*11u^1(3hX8R<X`Cgw_m^9=YxN~!2hPe
zf6#;9S*pP!G58O7@TW7so&Wdy;IC!=5c{Y3_s;_VQzyysk1)TAt<?wjw%7Yd>V)|1
z5d3GS$o_NLzu`9sZvUCEm&U(V82_*Ph~El<|1Sdn+h36RXD~me=U&Cl|0e7u{*?lM
zgAe{jf&XoR|C#YJe+l!a^`d81OV<p0iNA^Y?eotnAN)@W{O<_-g&zF%%y0Y~WOw{8
z_2Azw@IUN>f4#upCh(t+>vZY-zlr(rc%)Zx^PdZQDgL2fM$dnAufiNpW?u9<exDck
zJJF=^Z{#!8GJn!d8hb`B`W}0uZic<YpDOS_>Vv;k;6Etve-(j{;$Oo2jRusZ>9<ke
z1$&7<oB2)t(fqsC2mdzaH{(V2?+N*Hs7~hZV175Rd)sULcL@G>3H~3sP4<6~{hR)q
zc*W~~m*D@eg8zm)Wd9SEX^%(hf3J`~e-r$d;QqCgKeO0BKgKcL?>>Hv;#!aU-<6y{
zmDD&2jeoO`{OJ(*+Xeo)lV$$Io3-C<>|bw1AHTC<FXjK%7qp?x|FjSOJ_EJA{rY>i
zz<*qp%)jdvO&lx!A=pd&*)K-(|JVnAqQL*Yz(43>nZI#)eDUuGdx?MTucG;%^}#<%
z;NK(gH%yoL=ieS*{8zwU;ty?!=HKXpKTY7@EAWqt$o#2w@$sj?UgEF*bu|AbAN*MY
z|33u&?Nem_ZFk1U{~GKi{_X!6&Hr;B{1Jiwp8`L9CWAb=??2Vw9UuP(FqZfut<n6y
z^ua$v;QyDv|1>Zq{<HDAj!LZg=ZB~x@i+Y@n*T)~{6zwP_q{sf6Y}{2nSbAX*ohL0
z|EI8*_!D1_=HKFjzg*z|K#2dXGiClK>*M3U3HB0y?JLpz|K)?fTHyas;6KCT{Vzoi
zXny_}gx<hXv374c&Z!>ne`)(&H2-gX@GlqmKN9#W@CG*W<UW4;tk96L@}~s$QvCD(
z5Y7KPAN=(K|9*jg<2^F}rmty!PJ`}<yW_te_7ea4t(w1tE$RAgs}KHF0zciWH~x*J
z&y-5>zvmm;agxUH<nR7WHQ4Nu_-Zu&Yd-kb3jCi4{Qvrr%-^_D)5LoI@ILIN_*V=3
zulwMCn)&V5Uk3#Kw+71mk2GlhB0H#9H{)j1Ua!A42=VI>{6BN2?0-M|k2U_yu$SVu
zRfyl8eZ;Rt;HP82^xw!#yiTG_bI%{4Z|Mld;-3h6i9h|1(fRwf5B^sK{xe{2xQ+Y`
zo^wn5qgHADc8y_%yW8F<w!mKEU&;I-wx`(b^ufPf;6EtDzmErhpKo*g;nOar-$vIp
zPv&oYO@lXaMdIJ(gMXL6e@NiJvQmzJGT*p47=!;Z*h}$`Y}5R9{QvHQf1kkrZ-IZA
z$NZ7>T@G9f{>8AD`1Ajy`Ae+$zwd+ppuiu1BQyR+UU|11|D;E?<N2JwjL~gxwl9Od
z#NWjH=Kc-k&p&+dhX(QZS^e)L@c#r8Jk@m1KXs33LtNhWDyH8?={0{R3jX^F{=bLs
zxsv>EW&hR25zBb}C$oS1{z*T<|C$-H|HvBcurbE?t%ki~a^>lEVf^;{7{75s{6Yf%
z<>$%#+t+fyV(@#7-vl9k0|fuy!TcwU-}c9~|9cq22o)={0lCU!{tUgY!R`F-^bx;o
zfq$UD|DwnIIqQ2Gvfg5)RX6|h9`k3mz)y2A4mVYB+guf|_~#1zg9QFFJ>tKM`R`#r
zM!5OYJmOy|@OSy(FA(?#3;f@hCg)G(6Pg%@SFhsce*pGM2R6Gj3j7I}L*tGAEap$-
zMrr;%PT+6%;NQUfX*!L&(cJv+dGNO~KixB<LjL;-{AZo3<450ZV3!?F>aDYFCDvUy
zj#vK87sl@dq5q36l*cdm``U4==XdjAuVUijuX|II+Q<I@q5od|wF3W8fqx3(PoCW8
zzZ&L`m49K_OZ@8v{=q)@?-BS<6!__PiX{G)IOD$u_7Z=az<<0C{*?khz5ieNLcEQ<
z?-ZGT)DLw2#CrX6C+sEu#J4Caj#H<FI(~-w;D1Emr}zIGZX++p`@E$1r_+s1lzZ5}
z-s-V8+ZV%L;$Qh^ZCJ|{>G&V!gTIOS&HFFNp5Fg&xQ#q*l+3@ONjv73aR#^B-YCYv
zUg8h!(EQsi{$wBg&kOM%1xJS4$Vo$F{`_X`IM(&!>9Cjh+nC>+rzw6X3;eSt$^JL7
z|8XWzEDg6&Uj=)~e+T=w=f6_~|6cQ7s}R30z>)E9<c2Dle+To=fKR&^JEQwC?3K<n
zf2aK=I)77r@NX0NQ{c$>H?kBbbn@h$zteuC3Fo`GjGf`11$(7))mzK_E4d<#|5zXV
zZOm`3H^_br92x&czUh&_tA4B<7a35N#?Gj{#=l*N-)O=AahY=b_Ok!M#*v5r5bPC`
zD}L#3>+!dbpEMuw+b_g#tiXTqr80j9^OwZn_ln;^A%5co|L5TXLCU|P_1f`ZS6o!A
zET(C&m*SVt@iY9CKWF-gUudw7zny=l3jB2*`B(m|hOD$$Y1Pf|6~9FGZ}NxuPZRtP
z`LZ0pSJ;0?4F3aQFU7A(h+l?}_>B_y#|!+s^JM-l&uQ?M82r0nFY$-y%T`hH*`DGz
z*$01`z&}CY58?Vx%HMl7XveY6pF!A5`~}Q!AOG1t__GB5kph3oFqwZp^LOYlaulQU
z_gdIX{FTgKYsLR8AN&!4f1<#DBi^SY#eeTlwBvo<<a$N1TDm!~m-yS5-#&kR#RvZk
zfq#;~f3wH+<Bp$dNRz(?+09?$as61`rU%aEpXP(VNZ?Nw_?t51_>bG9i3<!kOE>=$
zuva?QJn!t({7q~}$8W9={&MCIS@vOpzuM#Ytzmw1{cpPA=J%Sv=L_-65d1%OnjF7+
z_CMb^X6g3-9oQ?KD}GHJzwK84FYpn+T7f@H;E#BW|9<ALiNSxC$N1O1tH<9Qzcl`I
zEp5g#ncMY>|2+c#WP!isR5|{Yo3(>j@&7sOrTACBr}^#pU+RN@rNBQ$;GZ3q`L{8D
zU5xl&2YZP>e^+$;FZaR!h`>Kp;GgJ`|Ajx(;IZ;&yhr|L|1~=PSNPy>68N(P{;eMI
zZ)N`FG2;KSNBk5279Ia0AN(5x{v3h-wlB*0llyZGULJ$L7WQb?aeq&=^Y`fZU+aUv
zMc_Y6;7>`H`J0$O*6}+M_7eYg=C|jc>wWOQBJiIr@DKKgf70_h@Ui&&d&IxBJv#oS
zKKQo_{9hLMpP3}bzmEB19ly=6m*T&6cXa-j`{3Ut@P9?%zsh6&-_QJ&G4lU%kNJP)
z`_b{A>w|xvz#kF#J3aD$)-N=8bqxOf9{FFnCp!K&_~1V%@J|!?|K^eZuf)l}(<A?j
z_D08lfe-%BaoT<`$B(W*&K3CUJ>q}%FSTK9jQHQ}5&!gmM906{2Y-^lKV9G-KTbY=
zH!y#84E}MjN3&7$f9gLqe+k=D{FeCOPZjv{1pbW^W&XX)pUeJ@P^@MHay{%N{yOG2
z<462A`QV=*@Si8}|9-5@pZ<b|jK%*O*h~B!Li}&`!JjSgpD*xV;}QQF<}a{fO{<F4
z(p}*Z|Du2C{ITP|+y{TIz)!!GYWy2{t4I8|Fn_H4zsV#1TbaLv`%3vkzh4~h>z4w7
z|3ZPkzeoHJ#+g3}9`R4#7af24{oi=`X9@fl3H+&uA9->=e~7f`z~yrMj4<P7woit=
z(z##%GJgqIr1;<KgTGSXpCRx+eWuKRPm6XOEB}88dx<|pA51~9^S|B)e~rNZ24ZC5
zXJr3}G=I<)zwIr`y;G+}_tK2NQ6#`#;;&==0^JSu{Fr{f)YvC;175G+>jZv!|Ayf<
z@}qCc{6#Nn2k!VA|Azmcu$TC^eyG7qxFY4x*M0D>5cn^KBg1XvMR=bwd2+|UiTM)^
zC`&j0d9auG(?8Pu=@x&35B^4h|2!f7(>>z9iTPv2|0^ExFJb-?i+`05{wD?gON97;
z*MmRwEA2Q|{J-tN-y+2SVITbK1^#(L{2LnN{7GhhGk<UxyN^G!y#n@9{_JD^l~(-e
z_Xkb>#X5eU7x*s~;{Uz}|4Qc1HlQqxf201Z2Y=muo&QZ1|D!(mTLpf){!_6+n?~+J
zfXI{k_-$qWI`(gboBtiyOYu+pSo7QS=UN~9+XQ~<zu`7A%Y#4vB~4slz*)NaCwcJK
zexmtH*pBAUCw%a?3H+A<+Hf1W!h^q&`4eOCf7OG3JM*Vo{6Fx)zgOUY3-*TFNcx<W
zls`?(Ul4=;4%n-<5_(q*9f*#9vk(3bf&X$iGTcV)@Zj%Y{#fyU!-Kz)`R({W?SsG1
z5Z!<K_4{YAH{3>E)+on6v_;3Wu6J0w=Rc#K0ejV!EB=klZy&!u_Q9Vh@DGC{!);`#
z$MswNmiYK*d0fA>^MhZT|5+dWqXhn$0{>S$=Ks*IHGirJG)wpVljAY}XMd{4-_D<n
zKKRoF{z@T#uDf5(pETx=b^I2=UX7(Ie=3>3g!@hN=O!QgSpt875dV^|%KWu)@?Q&k
ziN96g|G5wTh`?Vc@P|F-pVm0@XM)H4llED3{`}Gh{|tdYQ{Z3vupIw(=C6&B|JAUU
z;$Ou4E3N!_(FcE#z<-6n|DFeb$$x6cvGV_I5B_%M-)HgD_urf2KbiGjuOG_={woFk
z*YA_#zn=MH#s5{<OYz@MUlxU8$Dh7`JzoB5f&VIj{|^ty{AvHC0~9O%zlFWTUwKIL
zm*{5H>v#J8?|Au_3;aa_|DU|(pE&uqdd)uq|L=V8*9-h#68JZJoPS&6<lo?N{!ROL
zbo}Z2kK>L1DuMrMfj<qO(<M*t*DuMfdf-!e{EaaF&GuN>OZihT@YDD28v9ts?^=QX
z8iD_{dYM0)`D5k(?_n?Tw+sCA{jc%zKP~W|Bk(`$5&!x)`M>EA|NO4#{CU#{|0aR|
zT7kcx$NayY`D5izz+?Vz68P!+KjV%67J+}3z@O(ae|E$f|A@!@8R9oYl<<K<*KhRw
zlkxIz75H-n{wr3=`JewA?KoEc7r-9PMm@i)6!_ou!M{V`zfRzP#)H3+`BQZ_x|b$?
zM$zoS-zxCa_x~CDSo2T2z<<5K|EkCJ|E4(O{|fA-_@@Q*3xX2vDCJMP5B~iE{{;g7
z6CU@UL%-FIW983d9`~Q?1%CSew|L|49Ixju`}KRVz<<z#zlix$IetbM|7QDu2Y<W3
zPv1Xg>|^E6V1d6x;4iM1kKfuj<9`k8rTod~544tWM=5{k`>)*mrH^a>873esTiJiQ
zORq;o+t9A3v#>s+s|u@iv~5ZU+na48jlJ2vI#ajh_G9eVn2Icoy^+6(^sv}fAAZ^1
z>RC5-Msw3;+TQi@+i7I`7Vz1{#Lws!!JgtDF$$JV9RKZK&<ct_egBWKH~I6_RZ&x~
zGDzn9X}v+)6Zh`{>9(I&wWMZoMd^ZxRg+Swq^qS~=ykoEl9i>DnHf3RdaY#O9eFd(
zO9=EtB;fp1T?=ZDJ<FomJ?jy*8gXtx&93PQuO7NJ*nF_6PxGg9`!;tJ_iO&-s{YOU
zFAX&xddX?X-+I=cPQ*)~B?(SL`|(a^Xjr7PEqLO(rn^%*(9Eh4*oXeC#CN1L40P&-
zmX2{6)=qa`J&+LT9FA@L-bts~f5Y|8=4E4?&O7c3<W!#Sbdr4~>OGG7)MjWvq|*tU
z^E%nnKC(L*|F;I6hMlxO5a}Ec2s8}5cUlMT<8<EfL#MeWIPk%?VA49OZ#b!~HRm~<
zc&<b5pk38IJE37D+PMbp7{2yFPA7f~p|cV^R3{1h$?q!g?Bw=74m#^>7V2YLaM-$~
z-|N%dgnFS<H1BZOj>12_N2>wMLy7fu?5~_1$l0C{Xn6C!X&v7#bDAFto&?rmy;wtt
z5%InN-X_EQt3KVF#Ms`yhm&{=AHK^>;7eLp1HO8TZy4C{y_pRg5>9%M_$Xe)_><XA
zGci*C2Y`e6L~*+x90Oo89{mm7d3{G_fVeT{384q4lse4;<baMD#y1%0yaP7Pu&sfe
z83VE-o62D5!BKfmXBxK2e&B$}<_iNSW(*wQY&JUDPwjzC<&ha9%9RnW9I8PM`N<y~
zqbu>5+o=2rA%9YkKS_tlpNDxoOzyM~igX&b&og&U0%MMlJAX#*>_F~JsdAbp2S-Ka
zj>(&!n!M>R^BrBzjOv{;3wv_L<O{{AcfJtoiR-2;aB!T29yIw9Lar=BU6U`ABO&C+
zNip(+_O~C8;|+P&e0On2N?^dA(E+D$|E2kutIo%qbspxfJj`La&4+HC-i$e|p(R-S
zI_1=%TVH6#cShk3v$~B#5?7mtUq5u~i%qDLWNb}dh7P?Gs&t$ww4d8wiF&HdlCCbC
zMSI%DjJ$F*_F=lGpJ(so*R)S<9J=+F%^zVdB1U|-qM92hb{`?v4&C}I=IE)@9t^Cb
zwyADgFtl#8qmRW9WXY+RYfsX1Qst@Gz6RrhIg{#*$6S?)xwZ0|2#wXylrK7q=G_;_
zdBAZBjW2hfb_P>Ur#Osu>MkeQb$39WD?YiZ56%yL)%oEHoF8Z&Y8oEt#B1X)ofkrN
z({kGSpxt2L^iW?XtM0zs=J#hh4e#QAdLZ)bI?Q4BUmw|g-e{UHBb~d(It|~4?(bzz
z!|s_*PUtw@2YlDhWhn!kMNcF+g(-ubMK6N28TIO6J09&c1yizj<DB#p=qNu@0>k&*
zkGvSr*Ln5MF_BK%=X_9{P2+;kO^0{>yQ>i6k<{uqStnv%!MG-+p>N;9oPzUz(znp=
z9sQhed;c{f>v4{vKAC*m3Evo()AwJRhn(X)yF1XGXI(*k9_<|KbaoW?MV)?#QGXSq
zD-k0auU53TA2Bg8N=tCEO5hU-Ifc#xYF+~i)iZue2T-1$kM_<(p699j?i?HGgg@n*
z#`EJ~%DPR6K}ug|(THEK8Cin9n?A2S)K%!*I5~S`Kc}H9Vc4G0U0sEh_f5+o-%Y{d
z?53B#kWK#AzI1(d34HJD>Kd^>IO6n;Xm3?N=Yuo)I)!U5tjR95+MI?q-ax&kna-=^
zcNoT^1Y;Zwj(G5U*xofA<B5HL$GH9t=Q|qX9Q=n)(Bq1+Sac`Gsq%F6V~q2`Ndc#G
zEw*j$RBSspPR%|5?%nW}5^@&RVGJk_BA<2@z6KpGSBGwdB=+ajHXZLh$I9W3r~Q`(
z)Vx4!$kTO{!{*ot;P|3r&_1^6=-A@(J@RH~J<gl^FP(<*_?4Oq^s$kEF$!X=`1rWn
zX}Ahw-+_1#OFPCj2{EDZr+B>!J>~v;I3E)S&2M!5(~fx@*B+;rA?9tUL&x9nK=RA)
z28XNpA;lTK=W)d1g?`SW7L4x;1D!>s*rs^&MILv@(Qy{F1=n0deoa2@L_L$k9mUhZ
ze{M6_yYu+at-k<&0J)o>;`323VI5f3g-WL7Aa~cL1)QuWhzrcb^)BMH|I%||L$P>C
z%~v>vK6n}9_X+Z{DS_$^TX*LTH)V$=caML#4IHmyZ0|@IzK4#>PtXn>n`G05e%fu)
zykw5APv`bQjC&tnS0l!0BYNhaHu$EwM~x}CA4iV2Bj4`^_gds7agV`2A0r=7UeSC&
z{y)N;M{SvS1^SuezULVHbS@wNL46GV3_1T(wEJ;F<k>4Ro}Xeqr#Y{CUc(r^8yvCj
zJ;dQ}=$jgAp5th&QvxIQI0w55J22*y-ww@p{hdXXpLG?|H3yx)iJiDd1V$ncMsOaC
z*fR~s!U1Xn^-Ivkt2hp*ZX4?Sr_W=;oQM9`pJPsN8V-Ao8R2X`c8=-E@&60wm`!|+
z*>uF`7>w!v@HuAFv2)D-{d3Hne$Fws+_dR`@Eo(rKF1JuyyuwFe$FvNoreFH&M|aO
z>N(Ho*IKwfQm^Ab@7GH>U;mGnr3;rVt*)+GTvJh=I=`x{bbdwZoT|mCOKM6NmX|Ir
zPo1~0dTGu7IOQ>b?g&g<SiZPwUU_O-IDPWujP#7`38}M7mtgd&7N#!F%APtkYijxU
z)Ux@d3+JZZRIzx;Jm|wyC#Fx#NKLD(si|J_rAd=8w$#SNxm8tj=T|JLTDrKbVq#g<
zf=M-1RrAX#OXn?|G=Kh03(l-wTy;Z5Sxstr&YbL=Ia%f5DO09omQPL(XH-lsOV7#5
znLH<Rc4m4-Sw&`fM&^`^@s5+opn+R1cLK}55IA{oiu%4Ab8i{1qw%E~LskZ64L+sh
zTM4WBJk;;op@#=H4*t%N)rsF7`bg4a!yio^7<{D9;1tvu;=H!)Pp`kR{mr-jyyNY^
z<PLJ2aWF4uA7_)y9g>(k_>{!Q5+3a{e{f1-?hxngzd%j*?pM%$loDE4^#&H0in)Vo
z%_^!8dkg-l5GED!w@t0-b+nV3Klqf?Z}oYs-=m=!gHuxT0r~b{(op9h*Q+JjtKPtb
z!tR>6gUAnFcc_B7MHSMW?b2mIXWr{LiuUCWDJd9yO1cT#V*?)@JTPJ3;FOXA9Vi_l
zhvHJtZ7G>Mq%Kf2_>=-;sN$XY*w9Cl1|~!Xr(kDyps5M!b1U1^dhfpU?(;sbS7_J6
zuu^oEbDy_iMChi)D7+w{(n<^TrEu^m5gX~TA&({wOjw2f6dE4YqX?=Ov2CNaO`qY8
zL;2v8^cg*2NXWIf9f#U@gxgSY7Gr`O)KNiec2wR{92AQ-ZX;G)a6eX+cyb|&>)N@H
z@6u5&%wnD2Tv)|+N16-U*gjUD4|2VDav`mcj?a<gLOI(WO)fNX8xeh63CG9bbAiTV
zFSk)bU5R6Up=#s~)0p}Vd0HQW|Kssb>nGrUD6c0$;yH)X<HnGa%<H&!@8B7d(w_oJ
zkMhVi75}4oeJtcSUOyG`G+xK_?9dHRsy_k$_?Vwsp9D$sCF$vzD?MJM^~w03!t2?P
zIlO)rB+W5Y=PUR>hu5b;p3CdGka@g*K4d<xUkG^-ug`&;%j-8l-pK0<AQ$p_HRK}v
zAFc!)PCTp9Pzscw*IL|Fa+R0y&;sAa?9%GZpwmA}|2<VdT2B>&4(>?1%FU{Nw4SO3
zRYvqSxKh=pOo=W*l{LNfnW{czQ*;Tc%<8RARP`z2qD#=B?CV`Vq68H5qzyWhp}ouN
zs(!SdY6TrNIK2!utNPJ;U7s?&cR8T=qxDoP=%n_pjICd*`q6r-7<A}}>0KUC^`rGv
zE9lTs)w?WF^`rGvE9lUX*Si#``q6r-6;wxO@A_w|`gGJrm!LyOaPKlu)sNOwt)M!}
zd)NPmia#Cw(Iu#6g5LVAsy@vS(Iu$P_PzDbsruQymAn;nXh!K>K2ZG8da4yvvrg~&
zFR1!78%39(Lo-wF@@-W=T2Hlt4$WS@%K}wDT2Hlt4$W}A%Y~|bw4Q1O9hwDum(x`J
zXg$>mIx~7###SFyKU)8H73WK$>i<^hFOAawNa+ir^m|nMmqqC}D?Qz6?p;<Y{mkA<
zY|T}Abw$u?U#`+$(Mv}gqm};3C_O2H&Q($Re=GiIy{=yrRez_dAFbE*ua2s}Mb(ei
z>-yJ3)&HTYAFbE*uZ^nzSJmHWy{<nis{V7TezacKzb>l&1FC+sUe~`qs(z`eAFbE*
zi=*m)Mb(ei>-r^8^-osyqxHIeX;l3V70+nBu0K1f{-0I-XuYmq7FGY3s(!Ry*DsH%
z|G26jt$#=Li>_#*OVFu|QvOKQkJjI#^mH}UyIiaEbY;}LWGg*gCG{@Dlzwq<CANO3
z^h=}kw=4a!DE%wABpR9!?AEK-@7TJfU(aj(?wwc}i%W_`Tfyts;8I|8LQj0^SbqSO
zrTVAf(n``_i}*|WvvA3BLPF2H*Tn6IAf@`ril-;ehG)ibx&Dq}vVNEcPrsqWQ@|AX
zopfG12X81kA)#mfH2Mb>f6qK=^kI)UzX8tC2|f8x$L;?C{gV3oOXas`{x|V?NVQYV
z)_CH|Yr{O^aKA_U_hH;mNa#6VtmSrIP;uxvFBtu7)!&}^-{@Bll==VAhw`xJ`kY>W
zP<aur$EE(><e^VMJclOqT(_5~RvhQU<K=dSq47kt<t~pPu_V85d$dC@EruraT>qmx
zs$7S5#w7Gy=Z|B3E$U0{2e4n{L4J-&=(+x{<#xssKd;;35i~R=0fWYcjuR>`pz@f6
zp6hUPAE^%e#w1|SxS0CqqrYPkkQ7|hy$P(3@$fs&LqA%@q33$u#Gyd-E7del4{TJy
zvt{@l+pTZqwKqKCztuy3B|<+Y;nePS8hLF4LOCX(=lWdTGs3>VA$7(i^jwD<&Pg8Q
z)mQOP>TchR%hf9W8Qppl&*duqJ=eV^{?kx%Ov2=-`bEc)KD%3Q;=fLD_FNAe&dnIY
zF$vU~E+(FvRXlTzTHm9?Rw9naF$w2)>rH$<Q*pbnTOUDxs7zGH`;~eFOIACdc^ud6
zgXR3pL;Mkns8ZWU)?WvHss2+Qe!l^Jss3IMzhCs2Pw1`6Qag8e<l9C}0aE?DJ>swv
z<15vt?|ql_^m{~-zQV)r1s?Iq^x&bNkd)frfRU2)D?Rx0ke||Z#Y<{_j-KbMRedbD
zl(77#svkYCntVSIyb-QTB8}IFx%B3Iax(ODtojjNp9=k4OK*-8YQGYC)AxL?L+#u8
zBGzZS+9_u}wR0}7lOS6v)Q+uRuGJ24&f|3w=C~yN4VL~9UMKz=E&W<vC%^M8{gb>-
zer^5JtS5fEomSS9-=3=x$9aYI)V_%oskXA7+PC#>tar!1o%PhtLaduO?`1u;W9!Xt
zE4$+pLOm)Jhbq0QmWiyVe%bnD)>AvxR{e37-i~t`>xuI`tNsMm6Q`}uWj*mMvg+rv
zp4wS#>1VK>+OhRTtS5fEof_7=$EB9_)PBCz{&Ln+`?h{1>)qq>w57N6aFeCC<F>`p
z+i`1UJ@H&<@w~!%;<5F+tolo=`t4SITi*xsHWhaql37oFYjhR0G|#BWudUDaXor6P
zj0&|gL$9hOy)l;xwPWk+t#+2`Dr&jHYUd_sOrEc_+OhRbR{cw?cAmEC+xq8OPjRrv
zYrCbl$7KiWDL<E4?VIOc)Zbc5Prrjqh5Bpj_p+Yy({9H+A9IfjoxiA1`vrPcEfZN!
z?c4fP)>AunJjYq>+>91XJkzXpY<<LP$Bs`f>nRSmSUmK-|5T`7w!YA6r&?E0%Mwd(
z$GM#K)Zfdk`jxDw{@VIF))UXIR{eXdcFZ|~cGp|&*n0C!kofI()^mOLxNNZ6H`k2R
z{wAw^Ti<H6V~<OlrMKg}*V5Z@qw9Ps#AC<JJZq%5^;~VDVjopq<)N)lW<AxvO;=G%
z`u#a76lYsc->Xl>9fy3Yo!fO4wWROiq(bf3`bv*>c3Ap5w5eK#c%3-yd44eKseM~-
z@|rmBwAx9s+Og-cWUC!pKZ^D4c2cc&?ED#LwPWkktak3=brKVJo%&_RC!O`~xMj0`
zB<kDk*zvLNvfA;n^{JL$TW|B*dYk_qwk2UWDLxgJK8x3>Uv-w=@Ke8R{n=LiBCCFc
z*Qvg(&$a5`Yt_%U>f3sAt|89*toj93J9d8yt#)kvEY?%}ziPE(=i398KGmxKprtqU
zX}+?ruSRhlntyD)X@~f$t#;<~I>p((n{Db)+-$wcZEELhRy%!oo%;2SIP{yi4z=@5
zt9~-JsgT}2ephO>(tnHBN$j%pc01;JkJ_>8-{aA~i6_;MC;qAI*ByV8=kEBM<CNMr
zv85&|xgF9!%<ClV{x(|rExb<k?f67kPw}_gF?r~2-&~)&^~6oZ-M$^4M|2gnOyza*
z>y@9kSoQ7vwDqPP@@vQEzau}_SUh&#+WP;O^E00Kn|Qjfuk8G^<Nv=UKh6C@cYcO=
zOlcmo=i9-or+LiQoA|ivkMpQ+;zoY&;W{MJd7bpf&R@7Mi8$EvXEMi!^!M{RiBw)E
z{R&<uVd6~sCQEPPO!{U^pUvx}UuWqfmi{SApKs}(w)6#-{zsO+$kKn^(wA8Jm6pEJ
z(l=Q8YD@o&rLVR0KeqIVmfkC#tE~E|R{e)8{eMS1ziqXDH1S+-wNt|DG>-pa>Fszv
zYw7KHe#g?=@my``?ReVrXEN6zzu&d$r&{_)ExjGj=PZ4?Reyt}&$jd%Eq%n&|HRVU
z@%*W!FR<!wvh+ok{xM5mV(HgfdOMzvTY5X5n=O4UuTy+}X6fUJ=l87osa88rSo;5t
zcs^;he>Cy@xz$byuTvbJxAb;Ae_`qEcz)l~+wuH?r8le8{$#TOX|9+0LXW@hV*HYx
zU&^a}E4c>g`*zoMoGq5V=Wf5_Y`63Stop_owKK@loBOV$$0LaD62UeV(jTu^)w0mi
zpJ3@%So#w!y}3V0?F_T@{1xx2{SlTvmG6U5{gW*HEK7f~rC)35PqFmoJ{z@@V(HC&
zGt!T?^w}JA(vP+D=KdAwzi8>reJawQX6YNPcE(%!?Uw!wOK<MOP&;Q@dU|d}h4hp3
zs#==+B%}{p`lqe>nU;Q^rML6YDZZwBe!)!;m&~lm2p7+|;N0m21;x|Oy`cD#X&2|s
zESNSuFB@M_R7@Y5$(pxtUQHfqPh4CvzjR_vMQzQ*!x@Iti;I`kl+Rl@d+D4DmgP-e
zI%j^>vb-ZRFY7Tstjoy&omU38^o>f&?<F&f!(n_%XK``O;?j9FOF)u$q>YtDHCARf
zc4TqMS-P;iV)0SMrdJc6M|_T=K{-b8H<+nMkiQh`f@M)5SK~Kl{?a9t$fd(}*430u
zHaV`Q;>@d@C6!gn7L+c$xhxi2RD&{IuLk4Iudq7qs+QL1121dI%?pX=h|J6KjQL?h
z9n~Fq+>Wd*IW(rNIJ=dTTXn&uGcUjtmYYGrh&g@r%zNENpGOFkcYh7Z{ny=yZz}HT
z{B+g%_^f(IKw0_&my_TK8j>Rrv!R}D=Z0e(kiGjFv-%YM>ED?3dI+ZbBT&`jOzp7i
zfX_|$akTe7N&7PG<+d!(m#yvAn9?EX&?jpbR4lA<ii^u?ON&dPoCodvc?)l>SbSzx
zbqzkEyTq9|d&v@9e8hFxLWeJfGcP=au3(C5Dl7N`p}U>)uRQvedX6c49DH%j(rRbo
z+{IN8pT{vXrFO~OikgLa1<U4tKJ6{3ptFN&?+CLDNcgZjkS_YXn0hscAu27qvAC@A
z#^O1p^ZfQ&o-n$jSoS%!XQGJqjwp&{c|B45yqLP9NKgx_YAPn4f5{bRs%Rb=<g&c%
zDttCxU7_Caxn$qx-QLtC6%{vD&6$%|i>t-%nOteh=Pl0j3oR#4OegVXfIams%gd>r
zjXb9m_suDvUO)E+RmZEVmgFJ0S#z**LC%8N$fuf$;+j0)(1!``VSL0JTh}S6C(-8l
zOk5e$ZZBRWd$`N&;r@J(tl^&L%uz39oH@%D&#S56Gw9r<_-2w~oSiC4m-N<^mMvO3
zZ*c|B3Kf;ba~78_pep4{s){S|wHNa%oTUqK-YGk5@NnM%=hVej%Ze8-U05@3K}B)J
z;>A^qabhTQCgPQNP3dgNn-?hAbCx{pY0(ZEj*;SGqQHyzJT!F#O(5=e6NhunS9Z8y
zxcs7->BWe~lJm^vhWAa98QBYF7cVQrYp%RFDo-tryYA%p8wEkU08?;r6(4I>ob|#8
zu)6NSvfNx=#S;r1IAlybl~v&4tBb(JS8>Kv3S69ZDRA*s&5E<0a=)x>-okkL5BG6a
z&5E<$j49On_`FX>=i{oG8DBLF(fq2par8Tj>&1EG_c{sS#^XHP39P{3jPn;C-S8P_
zTfHZuqiU)b7H(*MURWMYVUoMZ^QJDxA!q553S3^7Rn+8NehFr~jCtjGhn?%EmQ|Hk
zl-*Qw!Ll;zA|QUVvM4h>5ap#crL;D2aTQ+H6<+B*)4E^mnxXX3Lhms>f(Be8c?2!k
z2)Kugm>;&!t~;6Xg<rg_%+q(rJ#MYW+lskCD_<zZ+lpcFYGqvc#H<_#%S^S*z_NB?
zSS^(zD_iYU%M2{BQ!SMuYpU9*mKj)Lr&=mS))ci9%i4(<Y8h5brJg*Qc4nz%CYGq8
zmSMG2>d9HEidtr3i7ILtR!gOxoT;j)WhR!WqLyK`RO%@iRAsVSW~pT+mZ+$fVZBaO
zri4{Rwaik>Oe|4REyH?=S*=PP2N>b-L{)2Yx?)hvOe|rcmf>`s0@W>%(#4BQZ=M)V
zSG&@!2S-P^T8anB{HUu}3lV;BJ7Q!nwRtSrt^8U@KNs!St<ftH*S6W@$6IF8`A<9~
z#iKFD%f8KJ;M#OvggxmZ-7V^s{E1p_0v{E6PdxRLH`VtJk^VO@mi(vk!`ri|l2zRP
zw?HBJccyBiRB9ZB{8N)|{|7z#Ka2gBz{W0a{|8V{@}HWmt?DfQ^xWC)|5F%C{ePbQ
zyZyPhug61c`?<1VZR5N#@BgCy-;aM|Z{$?~QvUh5u(5Ap|Kp5;rLi;W%VDo{F8j4P
zx`sJK$Ui+tclY0mf3Lt#?~^kAjr=wql1u!%nBTnLK-2Wto9zbJOZ;1z-@KoI_=n&>
zUj7b&pWZ)ZxQ+Za;3fW9d_Wq1hS%7c?FJZ2{3Tz~HIlg^@l&3d_Ke;u{(bmO19tvU
zER266Z-GwYFOQRdscF-dKeYmXk`Mkwfxp4{vg9<pSwrHV&-~_d&oEKN^xJHo4SOm6
zE1BQUe|q0Wyzw6;@P7mL#=nu96J`E-ev?Z*b<Qfr&ZsuPUgB?I{t~W8`7;v#@$#n$
z{Pcc3<KM`W(V!InM1C{QIQDOZu`}DlVXt(q{7F4a*RbPH?{|rpKTF_$2=>Omkr#T*
zKUvIQXh2ySJEP9?n12eGKc6d7{8RBCFMmYfr}r%y|3-d@ld=^5dggD1ja`hL(ftGV
zO6Q7yqrg8FM)C5`5ct0Xd*k280-RJN{(^y;u+f0BG<HUP5$q-YHs&|;B*p(!{Kv~*
zB=E0>z4344GdQV8{O!zd-tTRAjh)$UhP}k!A;f>Y5B_q2|GNTz8|E2_e;l7U#u-qS
zZvH>RUgD4Ng`a)=PVm8BE%4L(SdD)pyKqvG`16^+HU|Hvu$TC&nSUkQQ~uEV(&EjZ
z<pMvwztwOXITP>_e+%;)e~i&>Z?-RivBd9uS=X@hKLaY$p3!?<Khz8SYhiD=jXVoF
ziN7^Y{wbzS*Zh+#@J~kFc==Ze{Er)7mb@Hq0+sl;GJmY=hl^n^#Xp_-?flR7!M|4E
zr_cA8xEpy>qRhXS-`pDO`e705CH@lTFM&@gl>ao=@y7pYf&Y83H{3=(=`sJ*;JS>;
zI4!!D#?C0#c+5X7Lj1o1qj>o@3H(pM-uO52Igk0Lk@;g?KRn|x|LkM_eC{a4f0_^e
zEdu|O62Hgw!(QfZW&cK)ew*!QJgy(IDcC4Be=fG;jsI4G|NF2v{*4@n^Q?6I(sePF
zMlHIR#?C1E!d~fI^G_Y~n|YGre?I=><=-Lj{{Z&JzmXq%T>s4An*tH)oK=jSQSI}%
z{%I8Ae<6(A`~|p9RPi$nvRpA#uavm-ZvPj-o^%mcy*Bn=$NUt(8TfbmpMv}+9nz>*
z*~k8ydTD#?jhcRl^Jwe?@N+o(wZ;)ks%w`!F-}Kg|D_oGYi(y(cl-a@QS#pxBmS}c
zUw4%D<74o<(qHAO9g@K@{8!qQh4}4^5r22Q-8`?y82^$O{@2B@kLCaP82qvPzZWC^
zvHX8MhW}XcpB=+Kmj5ea#4lF=(_+}i^8fW1@r&iZG=_aF|C>>P>Uhnc?tG2f#{7La
zd$)i0w%6;2cH#V22~KnVF!EyDR3oOK>-=lx|2pimi`#!b>{VMX`;v&ZD&P*&`DYIP
zjlDUqZ#_x-&(PJom(|EiDs<1lE+&3Pdi8(5(Eo*K$n@LDK_2~YWdC)xbF3SFqweR?
z|Mk;!4ZHt0SoWs>Ui{{Rd;Bs;UH{(%d&6zyZ->j{myCItN}XEvEZqFRhP`UbHGa-?
zZDaE<fXdj%;vdW(Jhb^K2Mo87^&b3<aq{2o!C#OY&0j6>(^snE7Esjjn~eL4R7`*M
zR`m8E<S+FlVk)p)o2OSyoT%@M@o(BQ`erBsGrFp<s}BF&C6)bmD|p4^z0rS*?6Hw<
z6fBLs{hbuF%h(&)#@D|tbLWLP{nL*oQCsfxX<>Ww9MZIJ`fs-T!Cs2rCXS!^UN(x~
zGW;8R6Tf+|cl)NclR5v=F~3tG#tQtq?I(r9*{N1Zk6PE7DOp)+PuAoqT)$-C9eFd(
zO9+@ql8>Ku$CrGXLf-{zN<^(h@Ov@=r|Tv9E$4pCooCT+IfwAuwgd2cxC5IH;dgS2
z)NeV5)`jpJvHS76xb$1T!|~g_^qaM4VpU4S`Hy!8JB9R{xhX}?2Tk~G*``}kW*)%r
z+qMsPveD0^%|jy3ruNsr34Q?e(gryVOYg$(swX(=cUyO&t#|QTvD9AOz{uuy{HAQz
z4U@BJ8!=VCC*B4fexG~YSp5DT>G4ZkUq+ABZ;ppTk<N1y>Mm~^RQF|^Z#q*BI?ed(
zYiHZt=6A?jzT9-T^XdT93*on$*9IRuyE&NB(OnO$Pd#;eb93<e>~jLn;_-*3y%q>O
zuzF13LAuqustJ1h9?;bGyCXU6B*#W_D)G}dZTJmt+W*i%iihTZ7yYB(Qr^kihLLpV
z1~mJsAyhv}^|z<K-ljO4-{PHy-^Ja3>4g}N3-BAj`S`uz^DsvE4e6Kk@9?e-7I%<;
z;;Q_t|CF|qH4pKneb#^KTl{;tRHrLQzh$1#{1M`F2yvkpe}sQ!kNP*@w|sY_KZZ92
zalqKEJU4LvYQ(J5d9jbGOXEN`$_{<SWy8u;j7b`P)0%#__)E^0QoBD?J9B2<<%OxI
zIj5!4yS*#QC#E`ITrv=*T>cmSR$T<>=9pLCHJLkPz1MH21?vKXQ?S?kSlOHW`)f2M
z%;FFflFS_v!S9vvZ^r3g(OJ&>`SinE-a`6~BmEg}_Z6XTBdFd*(Yw72Rkd$#C2vW;
zadeuhj~j17k$&T7jH-`}ag|e)-pUK!f1c7?lNReIC_Uepvf83cCHp&r&3A$R26{}-
zQDrOXg-QGGI0&TrKk?ANPVGdsjtRn}KGdRLnh>OR9`b1C3t+du^Iqi=+86@8)XqB|
z?Og2P_a)VS&-j{Lyc7Bp5_-l9^MooiVN;>+5VA)NbEPVzr)wNj>Uo9q_GmU*db=Nw
zu%5o_sE5jN*0P?y8_CwMx7s;@*GX*Rb<+;IqssFvO*=-vgZ0G8r*Wk*&jj3h^Q@2b
zeEF{G+u!A8$EOJOsJPpi#d^bOE`>^1Z#a#9zDGN?mfrSjo(Z`9K5x~x`OSA)xcjxk
zs&8_H`qO6V4I}Bz{7LPY>vGbk(E`QvH&t!*d^e=&uhD1me)?`Oy!`1dXY(3;2b`_v
zOK}xv!$4K(ek2v*!DV!JDd08I+x?>JL@LC|FYna0>B|>fdbJY^x<tdvgzhqm*XTPf
z@Yh{Rc#ZUGs^jfCOW$jj=I^xV{SI&Mw?fk=7v|5KT~=LPTwXDI>D=OZ3+Gg2Evqc8
ziSd!)a7Oo+P0U+3_X6=Pta!_LPU(F5uy9S);tS~8B6>c3?v&2PFA4X2;MM&ZSG<XH
ze#Jt(HF)8&1&4i8_K|_$!>~&#7T4r0z~^-STiP$JuC7>EP9Fn8^X`vxx<8qCxR2!I
z)Kt+YN)Y5ce8j05D>ZYR1r-Yx;A4sWF4pc3FS$Q(q(8nB-<$n2dNM%`4d=t0r3=gG
zQ^)!f1Y)}MdI$L7x{{IUO1AFC<NZWJ20jDB>55OEx)BS`yGeb{L8i=8?**oXem63$
zdB1fSZxP1Zh12;kJ8JQ7*YVrkAfGxfvkz|UwC4b-`y}i7(S}tb*1ElF<|U(}xt`ke
zvNzX9roP*r&g-O$m<lZGxxq9(LDIREx<d7-n7Ng{LtXMej_nF{_3owH|B0w4`CreD
zTG*2O(|qXm{|gWQwd~)X)2S)9|4knLtN9YvBntVb>kha7sR#=7KLh`EG2i7r&Q@aG
zjK7h$GQTTLob}9a{F!Fl+w>bpQvB93zZoaur<64IM!%VugnL317pWL-vyZO7NN3_?
z^u|8cJ)s}K*xe?zag{qD+_1YYeb*N0+_*(-zmn~YF#R{%|AMg;zfBy!e6C3Gqw7~=
zZ{pVvj@`b=q@De*<(<Sx*A8y`N#U#v>o!notb0P?oa`)JKmL0{bym_xz(7a)aflkd
zmbd?%|AnvB6VV$p7N(n|n?T(}v2_up>Cw^LVCE-NkE?hJ={2~%wwDt&*iF#W<V;Ei
zK~GxgH9NiUOV55JdzWC;%<niCsQT_R0&YPly~)6yc5puorRTMt*^`SE`?a=-(OXJy
zwt9N<h|>35wVE0<Zw{p&UE^Z(Uf0HEE^%KQ=dwNNd%W~~S32qK*M@O?9TI)Yo4%>6
zY<}tD3VfWr6d%W)J-<SIA6(4uQVLJ?HuSy#j{O}?8Q~tJg;mAXRk$>)SiB^!0GFJx
zt;0EnD#}*;-VD!+Ok75(Pot@io|#K4eA?`DyMCI4@sf_3R90T6^3r5Y^m&5r(NmS4
z%+hruT0|{P-kBZrww1%#yX(8Rw|Ur`JayN1Z-3jv-kfvX_1)XVF7cb!y6*b!?fb}H
zIQJJoFBS4-m)o#GI&-|5ea1f4xu3q*-Q6a&@h{VmOS<cRk?q~*-+gRX>9Tjve5tUf
zm_%IlTDZXy*3)@gx^|*_5^mpQV(#@+GB61|`ieUD>u=kdST%_+0Aii{r%p`|>nB3-
zpZhoch%aQ|KZ1W+UKCPbNr!IzW%Eaa@T?$+=LERVkDaUN8OBG0BAthB{Z$jTlkRZ(
z>_I0B>z&}sX-??DbDV@dZ2_lnyo2Wn_&+Bw@WwK17Y7C?Il7P2P=<f9d;H&Bg*$_x
zb;_pynvry^;W%|eNv7g?0?9+SKHq!*44+(;fag)cW@0IH0xz#Q7tfr6PT?oPgmoVW
z1M5CQJ8Q0SK4`@$yB^P;D)HRug@oaIO5q#VWl0a?`BPgze%3M2X{h06Pt-4}*8)59
z%;sHwF0&*d>A^b^oSglaPRH|?bHPFV-qNHwomIpgLHliZCY6>H$)@el3C@E9j?4Y#
z_(QeNr3OO3oz~S=NcE`>+r=H%wP>5#Y=KO3BAe&oKLv4|PWnJd$<c|3C;m-5W5u$g
zIDo$N#PUifu;<A>^z1HS-F}YaJC`^gv?Cs^w@-U5bW+OD%JZD;H3`G^JPyCOCQ5qa
z-{*d-qhI9N(1F`u!w1nCC@(^Ip0~`3Db-I!{nnw*s}$GJ$G3lTC*nE`_04m>B?-eQ
zzMD;aJBp{_`Ibj~b0eGLiLZH%`RUyLcwW}~Ip)>sIcDE=Y3ey<pLGX<LF7(?dY)OC
z8p+v-Jj3hRsUbYu9N^S_^RG{6*7t%V*6jj&=!8h;?h#I>6FBGfcC?|MclLEYhzxNG
zD~C86DOZ*vKJ;9z4K^w+cs7Q^sR57nS6+kM?Mgu|_m6b8?@4G59eSrVrLXfJltb<C
zwfk-r%ayQez`UWJdG0KO{)s>{wS^;fW$WqFn#Tv~HeVPBy*$3J^XfUrJ+S94JbN8}
z^Sq8L2Rj=&&^C^tZwAKdaarp)8$&^Q)|k95GywaE9sAsT#C6~(xY`A-U-fqiM}X_$
z{&8|85a)<>9Zxt715QGWAXCA+8~RY0W*&b^q?2^Pm#{q@<AXZ%oOKtTAO96&bSgg^
zPH~d=v<Ii<>>jaZ<i|K}=V5Fr>3QuL6dyb<eIk;RAHa5s-o|xdQYGr(x-lsYZQPH4
z+P)w8N%_+KJQia`&w1@<vY*a9Up<#K&t$26`tO?F2hUpvH6N@R-2Ca><B*R-aO@qA
zc`UK{5T4&wItefD{wVNl=+N|U&AZ~E5C3+Sv$+sCdh%@pzWZ^oFXpr$ax`Jxr@=n!
zI&o~)507+yg8Ax>hXWrp;o0>|YR)=Y<=Okt*I}&5FU>XYf8;dmM?UYzdRM}Ud)lsY
zn%_t6redz9{_RGb&j>_vCiIPTjxTi@7T|gJ9eCdRRA9ww$Pe})Zi9!_k6bl;)#_V=
zgI+!-aN?dB!<_6=%-J1i^OJW1&A1Fp>csQrWIWezp|NwE4WTEeHDiw2gLTX)DW|^~
za5kQTdXwSvW~}2lNTTB_^hKSEDSe!91Wc{4Pl4Z$;WsD2*^u@_-A)PGX-7M_kCl|B
z^7y26wrxA=cLu++n#PTMyo2`><ovs9BlVG(UPuVt*mj&#_~+w#*r?4>=sVfiEcm^!
z)7#IAZ0^MKam;^H^Oe7mc#c2n^w4pdm+DYFBOP6Zo!}adzJH8Z9zc#z4&B<{d9@39
zvvIc5Z~*6<7pN}g*Y<=+4vzIjbUtXpdNbZHfc`E{8}`uZz`WXQ^4n_pH2!wNUww)*
zG$k<l#?gn^wqK-kAjXUA^YLsxB`|!?PV^}seJ1~_;5P^B?cjJD&;MzC2TA1nC+|#a
zrns1Ka*)rVzD`4Eu+td=KkcXSq;Y)^HYz^jb>B%>pK$VnDFd7jf;jh599l4TA=IaQ
zdLJ>Mm{LAnh&Cx_=-hP?VtvN|-FK67z4I-!rv!Ng?pKQgPR>5~C59UzF*mB5>cH{+
zG3KXF;Dhoj740IoPd_Qa**G0OX<rulN&6|!aP8h}Y$?xL`hgW=N_n;)d9%4+PoA}4
zjBwCS#n@~P1yVAa=)8n^gZfA@YNhc*AMk>t@Bqg4b;OwV@p!`K3(BSq?MHANI5-aJ
zcx}e}Gl=(2*wJ}#|D^?(11`l}a0%vwi!nFMz}#_BGv<m0x<2>_ailgJ<S@m-E9dJI
zLKilD+JDL$s6+iu2|AsdJG(X}ecFHOAE6`v_)qG(yC3GDB={Kyf5YK-1pFss4mt_f
zQhgipG2dJ;pziX&;vBOd^Gs+M&B6M-_z~tDnrA9Q6q5lrP|Q;TfkkVPYbm3hMU-<R
z@SYpIzDgQ__qE_!Iq3k#1m~`#tFYZ(7HD|<Ip@`PUkWt*9Fmyc#s0Qnpy5T>b=}dY
zx$6w4a|hNxfsXdmoc$KP4+Zn|`>zEWKEXWSHObjbxn2~!fA#xi!RF^M&n3YJ<t@&;
zotc;~Du1Boi#jmTarr0Y0M3_~)2TnW{;=koPK^CW!Edd`WV!L`1ZPSa>d`T>v8!uC
z6Sq@>c92I?XJH?50&NWI)yBuchgQ?vb51aHW6408qj0V{4a_*74B}(+W*nOXf+sy#
zjPb{JYZRW--}&HWv`hWp89WK^cS<>(`aBRm#(#FlYfZ?%({E0h*&ZCZ?)_jOhvwII
z#9{YoPG`!z@!7l2$ZaM+XLR22O^Qb)&j0nn`qgKgGVQf<0+A1I!26W~fq{E)v7mgI
z_9+g~O&y4~cUx^!jN8%nIrGx86+gC3oI~Jl$2Eb8E5*a%Iny1}zrHjr=e_rwhF#A&
z4Sy>OH2fXowlg^5^mlR1@ky2XiJMiCfHT>&HSNQ$!tOSBZaMM8u8nJux9w$!V`lI9
ztrBxUJLaBG(C&c1@R!fIE#ZT`;MqMXvRUc!oK5teFUmXG-ia}w>m9m|$F-Y^@ou!c
z2W_;Y?Foq8=@_H@K>g|)&|dK{=Y#k0z9%qtK8S0UN?fm0p5VMn`Imxt{^Q{_BZ~ur
z)a#nx1)Qwi(C@+Pjq$jaogav7o(Os7i^ZEJyqL0S!LL&`orAi&gG1Jh#avH*;cw`k
zsgcfqAT~e3d(YMcoJCLJePz`4Z!mwp52o?A1!j_dJjRgx&I=3xijy=UFzDqA(f%4-
zXWsay2UiydLVL#GIE3Gv30+-TYYqh$wPEhO7#uGI2H#kRbsFz^*gqbu=g@w{3h&?A
zjN|1p%tbdM-|>2_?(%xfaUWr>GUHN$Iq(zY<U=?v($K~f)cI2%r~8;#i~YDKF}0rO
zNV2EAskE=F&|kHU{!(tYpNMk}<`gpzKHfbKUX6LE2=mcZn3t}^{B#B8!NO+DS85)t
z6pq_Z__%%Ov#yPw;Js}-kuOccu}Q~eE9S>m%#YiT&4tJ2Ld>_v=E7rh;jy{!*mdEt
z>%wDm;SpRH-hAx3@Yr?XvDe7QUL(_M=Kr6+M&5jEE<83D9-9k~&4tJ2!ejRfkKHdk
z_Uz=?vlBeCICfol?Agixm!F*k`{OzCa6G3Of#)^Jcy4nNp5KhbbL5lp9T9yS{(53U
zGd)YD=Wz7=n4bC2d#mUf^5ZYz8E|Go!+T>B8t8d)`%8g_pFu~@ht%_6JQq{XgS+}R
zcTIIV|BUCs`=L|MkMKO{5qchs=SipIdDK&(y30GKC*Zl9v-pz}0}T)3nehIxfd+bB
zy5}P&r}G^=Q$F9>9P1e|-otX(=OP{atcjix7vULkIi81Q3(tu0x!S4MVW0FI$~+@Z
z!877IdPa=C(6i0=F;|#p#I<-vygMPe`x$YHc}9%>?^Mq)d!7*w==F?v)VlY}_!%)`
zvpdt#&xoJOYbHPTGvZ3GXT<O!KNsm~o8sP%w$(G@|HIz9z*kkC`TlF|9mw7ZD3@?Y
z6HGfM0jJ|Akks1j5UT-oP{4a_LYeb10T~b4X{%NVO?w)Q&KS^kN;`*8+GBQ<nW=@A
z)R_U~%nTMgGmNb>J?G5d1ib8Iqb+ht!e#dV`+L_~J8SRkgg|X;ZQzs7+Us3wz1Qb?
z-sk?R|J-ZtHSaO{9m9T~v>y&(BYv}RL0M<eZhqs61!V{EO?tf&JMmt-S-y2AR@u?M
zr33B6vohF;j~+?v_@A;9@1-y0jz5U!3nN?PLgup^|BkF_k%yMkpJTv^?CUXX^ZFgO
z^NjuYIi7W07il+TvL9my?_^!%e|8XG6Tw~=ZN&L5MmwoC<2=V^jBOK}@!zG$!v;1p
z*o-M3w#}G!jm@|cn=x~g(Pm7aQf$W5|Ld?B@5^8_mLHC1GnOw(y3H6zl==Hyo3XwZ
zeAdcl3@jNOXT0W~@tS+=^qFnOcR_RRg!bG44Z0m#bQ?C~Tce3!_MkRn`T5A#LpI}M
zXR#T}r)Gf7c!cha&^_RFgzm{#CWY>u8KHY4bZ>;;W6#1LUH+vb{9eDG<p-DFtG{}L
z?tL)nUZPUI(i7n;^WZNh!Dmi}-<*PsJC%5itY*azNwzJTqCAMBh|S0{@k5@UbPV|>
zkwE_Zh-LWLkQ@7hKjxG8Vm2qPvieRG%I9`;GWMqiU(VLO)`6}DBk!ih{t(*|#wRs4
z#i>vAWQzYen2&ERaW*aa_{tMoLG+%<iMW+|FR3LCAs65NS&_aMxEHPJp$`@@LY<fN
z#|XuYALW!}jF6GbY2T5{15w2X89!~x43AFyjPcXP*S4F!pJ*_#P3@8mZ<C+)MB<4G
ztv+JecgR1y*7N6d{e3qgS4*Bg&UK=myMEUe^Wn<o{eGvEkuPGtWbkA?K7VdcR(~3w
zdF1hVck*6q2ER~0eJ+qZ&KSCoHM*IPv&!R)duVwapY5%d<Fn12bfE_^KHJYOh^igG
zJU*z;Hf>~<$NTH<qHgWEMjluHx%cMW$m7hpH<vX-$m4GyvmF9nUw;6f?LuU6*3d@p
za!~TP>$A;TBz?9mWO2{m{(Jap1L#w_Xg|i>bu)*v@ux=azCUD7*`MNvejZ~&UVm~C
z_@c2*=C{UIb>_8@;Houb&D+D;dhv0R*AL<6Etpii2K(?DjXRTnbHwN0d?_#@|K=S&
z|K|Ek{>_ZBR<bI6F>qh#%Bml6?nMhc-{y7r_&YHkw?j8>gMQo!9k~U1vJ5$ODKQ>r
z_if&RoI3e*_WXlq@okRb+x)YB-)2KM)W3qB#FZZYcl0!{p7~~Oh|^L3lkfet`)w`s
zB6p@Wp^NyLd^-?t!5{rcR;28&D0?|8(sv{4TFv~onYgeERw*AT0Uq09L1H9rbaHm~
z{%ZN-kJs4qOCGZ#?Iq|_M7N0VZdXi8$?`}U{`0G5fycF@>X#7foOd`FZhP!I6{RXy
zTxmD=_fcN*-<)?lPZ8_HyQ*^`@xpbM)mLR%WnP_n|Hg|VrMvjPfcQsqf0=XNlIz}I
z?LPPJZ*-r7`{w<--RIu@YWI2Aeg261+`E6meI9b3|E2rfyWi$MCx*b(|99?l@BYW`
zbK;Q9^Z#_8d-rd<&w(TJ{EYkDyB}L&#w$O3^ZX*`zQDV`%zciJy?K7M``o*~(S5F%
z1I^#v?sM;cwfo#%j~gFxpL_RDxX-~a^Zj2s_ltmyg?4y<`Q6r$)uK6W40m~fWnzWO
zBi5P%>L@R=)(8g5D`v&xzW21of|K$)tRs){+{1sf_H}ioImG#_Wc`7uvPR$wIyAn~
zg{>T5R_(PAYf(*H+Pz$Jj#QUc@3Gd{`t8yZ!A++6)NUd;ihX}v^mO%j@OA?G{X}A;
zvYNMUERA+$)o=LDH_D>KS2jP>FunKLL-v7=Y-^ihe-B=0Zwvq8wRc~i64<uL4m7`+
zAKZ2;Ji<QWzKHQ5o;uL>gRRy9<x8&JVl_Vty={Bu<I!igUL6&#c8rc}Q~de2DyftB
zBE?6yeC6tGdPbh*k_U**5Ixbo>hxkzZRUvF!6nBQFQvar==aUgmz&UojWT*Ly?^H6
zU5tUaKE@w{mWH99`n?`nMjQ`u?0dX8_9RWv^8#W@GSLq`V?RitAu4+tIx-S-t-W9*
z<~sia7IWR}#$5Nk4`QzIvuNvcW3GGQw-kR`z#d%h#>W!ZW%6)<+wERVbrH|uolH#i
zU%+RNV}G3s&+{Mp#*MFTftKhS<;ali;E$8Ei6ztf<w2|OFWi`Fa6T_Yy(XW4j|W%G
zRd4VwHmOgFx!z68^$P=IuG<HTx$cFhjbSIKGIhH#*TniuUP+I+{tw1}J~7vA6Rc)0
z?pkrv_Jg0@IUw%ZZBudAn}hZcG1pV$o$O&}i@DZXl_8V#5m&9b@#3yK_%=jbpW?0+
z=cngd)AX3@O!3zHc<;TAw^rNiol|zZ@Z^uRj=&#ya8=K553Xce`48ZVe8?&B*TaRc
zJ;bxiUgW{oGHj{j(is%KWS?mSMp|84QY*Hk_cBI%kJ(qxJw{vmEq{55y|R%{gWsPH
z-#-KXe<u6$Meq|BN6*0f`(v$-`eLocCn$%_FCA+QZ*q{>(HFR?Pez7^=NMM3^`XqM
z*0O&WXib3CR${Gp1pDJbYsAArJA~7$2{a)!Mp|*!lDU^5FEsk%s=aR-%{Sy#@zIfE
z!KadO)my0lR_d02Q6BW?!5q$A2x5!*0LEFjW|*J!Iep`Ek@l20Yt}4NoV8cia%A>o
z9j@MGF0%V`;JN3E;MvYa4{N<RYw8^kXRR`SoVD6UCU)YiC;oDA*3^|T&YJRJ+sv`i
z8Jjsa<zdHJQ~$5SW?l=O`YF7;w=Nwn-h_c|=^#FXj_d^bt!abck>Z|(N5}pvF>E~Y
zVxSwLm$fdvR6ou&Uc183MCH5r6twJaXxb;CZFfQA?nLIeBMQw+${f&~5gIr`1J66x
zgohtP?JFZR@IB5oF+u~M8sLwVma}4n1_q-eeBiGq-_GwC4NQ%z9^nH=_`nfaIO$I`
zA`1_$U-$s=fvNG-BQ$V?29D6c5gIt64;+|x5!yJS540{H(FdMG{@D?m$Zu`#+21i)
zI5mEHgb)0{@PTI@{vq}f8@ovW`$-TxN)|TZQN}-u*u?{xVy8Wu@RrKJz}RWZu(b>t
zJAHITf9&)Z&JsI)v~XbT^e?09lP~u9+I$r!?b&?g8!nsg=VkL%{M`pIZhAQM?ae7S
z7b|W$W6bp8{+Ma6t|4u{dxsY@eYCPaW?H|)_QaH!X;XI2G1C)&r(>oEv;SV<+JBD@
zVgEgPp7!5b*I#CzYyaIR`!Bdudk(SJp6x?1*2flq0@`&AG^`R@wg8%@^LqZ#^CLAr
zFe9|CUuV@ggn!EjtsCew^Z})HzjJZYBeafKxDmeYa?gG-LhF84Xx;B#Z1nE}txGh>
zuX!r`-Zc2W>F|Fu-~(qO!(N08J31vU`luTh?a8ku-xo4wVlBD7$Rj1WHALJ{NHIxV
zi@7GsiHlaArDxLOqS4)P_Mzg9O^lKk^VzxAjf*B`K=rAfOmWfQa^s?F(&M73*Th9%
zNL=*g#6`<rT5-|zL2*2tXN!xbeaELd7)=mwYvQ6QQ(t0x-MHvN;$rFhiLH$9Qs?|C
z6BkV^cMrLy{?v_&ZuR`8UH@Fk-bVK2T(g})Yu>%`2_1$lKrtUl+4~&)MEx|{#6;77
z#ocx@7iW!$X3S@eiQenRL^B^<#E?7ZSXD+fPs56drj0>kqTRZ?s9R@MnV4wxpL@j&
zYraiPH1j>2IW#fR!0PK8iHWWxCYtrj6cg>$RiKz?*DwA!e$^ZBtL~zG<r>pDV1vd)
zpU0TII7W>vJtn#_V@$LYH+YnDt^6_3?<-$q=E}&TjLG0mr7N4F>(RYGwtAL1H%flU
zcSCzV2@SdnT68Bg=?-Mj+c`HX#Sb|d(-;|MJoMkNc51Vh7$`3mTCpyQh2Bpb^bKwt
z^kX`=%NjLk9P}JwaTRAeNE~!KvD7JX(2AqI{>#_yTub>De672Q^CCu5anR;n`}ELp
z(6dKH+ReB4lq)~tLwxJS)6Nb%&zAFS5zmMx&6_>8zicICf1<MS{bi3)R;RK_{bg;G
zDfhzcY5iqCqO4kF7xkBQQ>NStvuE{}<!}z*Eh_tPe_07-H>s?+zibg@*Q@NZ{<4*n
zU8}Oo`^z4qtU_gT`^(xW`<Tkg`pbSq*?g5<-Cx#C*&nK`qQ5MMoClYw>=XTEC6pDZ
zY+--dBFYL?c4L3pO3E%)+0FfBk5M*FWw-Q~wNaL*vOD_AengpK?q=WJU)D_-c%C<V
zd4E|>uzrc+Yi0uvT4$|g31ubWoTf#@TvxBLQ(~?co>{QbA9vls`-;2n)RnmFXSpg~
zT5-?S%kAGxyme&&ej+Q{H{0s#tsV_NXTwW`;3e$l+lZe&#@TvZ#5>0db?&%x7A5CH
zwnd4f7LI!S!&LVDsX_Kva*gz5^Zp7unO7wOF2yQ|_p3B{MpO8QEi0@8(XAhksxI*k
zMY9K<seF)_ev?xrl$ulJ5V;{QsV8o47BmW;!Rw3qV9s?u&pu@0UtWZk=v?QolA~gu
z;S(medFR5maJFj)eNnm2rB+{Rd}U$suf~WcFQEJ=b0fZHxsR`@HT99NDeQb3^Tn6X
zV(yMDu3}xTgU((HeZ7XY;w)5j!GasjoBqiE5gkjOi0&XUpZ14W+0f|O(97AAtt*?L
zqdz8pLpeDc?j?Tzam(skZChn=o*#yu`p<uzeUY`Db7A{d+Bqhd#B(#9^9n`BYSA;#
zwyi$3yPvj{?_oJ~*{kPIpv&OJ{rky5@GS95ru_-lmHztXOm}E<4zX%0-TLxvCpSf$
z{qdb(ZrjVF7L;zb#~S=P%>5(aoUVU<QKU3MdBKI&GIM{KbKk<5-{$^m_qlg}qx+or
zSM&UC_qlh!+I>#W3iJFC_qlifg!`PF73TS0y3f7)ZSHe&R+#61=RWuDf9yUdXN7tG
zpYC(-{%!X;@NJ%-ai4qlV=K&fTgX{qo?qnL7kKxVxzEX2VV+;@KKJf#bf1&6!aTp*
zeeT__cAo>==J_M;bMO8M_c^d+p8uu$+`HfAJ_iQO^S^VSd-p$fp990@`G304z5BP_
z=g>j({ETz|xcz6F9_Osh&5xw!u*iiztU^Y4f-_fF)!kdViyRf;*|J^Bts~+|8iDhC
zI~XsZEKJ^sMZou*FWWa?X3to%xz1X11HYq}ub+OSd*62XW7Es+oK-Ef{}wz)D5ri&
z6*!`L!r+Nup8dZs7hDm{{|VpUNS*ib{cF_s&gD(hUjrWZ(B40fvTy!td&VEC{O!x1
zn0_PmT*kX^>)cO%zs>J=z_q^yM|OcDZ!^ZR;K*g*TAPb&;N>#mMH_f=8F;pyer&$Q
zI#NPk9-|-NUYT-wcsxazclEoN93151F!@~)L5H6AR*!;ajE0tH8(OYh7^3AbC26@6
z=bBE(VZ5H~2{?3I=hw%o&yS9WGSKl$Tslt9j+ES3hltaX448?IEB5((`_Ni4a4!h}
z+moQ<KUM6kp}WM%rqJw3Z7M%knw_2#<k;ftnEz{`*`F{pn{`Q{*U<0Z{(blI-}t@@
z{14c7lV#_+hUdHQN(Rxs>+QMmY3H`*=FUppb006ryyxayqf_=<|Gw?*x4G>1Df{ik
zL+`huyHAX&+6hf^_uKroZ?NC4Mwao)<{(RaRb|L9UfB(lp=8NhjSS<J-AfrXEN?Y3
zj92zJWnWPlGK^RD9A#fr88VDl_A+JK=T{@ccx8tv`@G6#^_Pu7ZjkJ>8X3lWZw_UW
zomL~mcx5+GCfR8<GK^PtFJ+RQRwKiBWsg%P*=aR0j92y?Ws;p%Bg1%QFH<JjX*Dv8
zS9X{($xf>)`pd>3H%N9`jSS<xH-|FGPOFh&ys{f8lkBt_8OAHSmomvttC3;6vd1Zt
z?6evg#w&Y{GRaP>kzu^DmnoC%v>F-4D?3bCk;<0$myJPQk?gb@8OD2W4rP*^R@e2H
z-9VXSr`4<b%kHI2veW7{{bi3+CfRBApZ1qMN10@&)erWUy-b;8r`3=2mmQ|;-td?v
zv)3O<m7SW9oyM{kZDYTGwr*AF6Mc_t*oBN__WO1AFTLNt`F`E+Z?=DT_WKO`$FF(6
zXRr7*?e{KU)`Ohw=gS-!JF7%{kI7w%TwPUw-je()A^5*h)8K!6^57n1moEh(8#>8F
z=J6Pk340_H!eg{p`L9Y=?;vhLa$yJ@3i<W>6Rkco$CsWTUzd@mLY^@^74o^{ZppWM
zeDdu+!)GBcyYlVk0J$l%>z9N_E2rS3wxaQko1(mPtkP;OuB+{pu0XPKS0(e%P!TPM
zUoL@fUSv0#d?elQZcpJ$r}C!*^_xV0#IM&)xB6^&<SxD;(P?vx@AG*l#JA{zHigNn
zp<E2)$7|XZ2*+EHL%xT8zV`Pjqgw)cHyl?UoLbXg<ng%<e<OXq&MoMMW>k^GLG$Wg
z6UpdKu1SaI^RI_rMu+}A`5nvHCdkbo{x2K;Fa)0%hELBSudUsDyW!IVZ6R`5qHift
zE}FKi`X$O+*IH>ESQsMbo*j9<Etub1XWu?=Q5gM`os&~N%UaWcY*206Yb4L;-Id7v
zA$#rfZ4>iL>#VAIE2$@El2zJ<ECO&``7F5{b-!{_r1VFL#N1?E)L}6u)yaG=E4L@y
zAI|053+tC~rpNRw=DTZb{Ss_IdF#ipj?B3SXVQm<l;19F&3ln~Y}slZ*h*h)X#My3
zt+{K=iL}4^VnI`Qa{ZDX__vT9&dFa#|B<8eE37r^xVARjU7Ekc$sd}(jWUgi@24<!
z_JzFskhSJ|`j)@P>0|50yGujJU-_N3@7=Y}tB=b27Yhm}oZO`9)1ehQ_rz*`qY(Q7
z&&b`9JZt0xyxiGf_)t?M+DRRP-`A=4jo`!*jZN#8%ngW4dTj9`)^{Q6T!kEP9XUFZ
za)8l;DQ~g9d!6>{Ph`&bw>x0bAII+Iy&H9P<RdUO0#ol-m=cYOT2=E6y@KX+Th`nh
z@Np${$fHZ|B`u0xFhYwy2()MfZhp7+F!+flzvS^n!K?$Z>#Z|q9?rp@oQqv~414ET
z_RtI9kuKzXyFl|N;gLd-nu{CRYvtRL$|qgi+uGppNo~Q4d)HgH8~XE-b<=$1cI@Yg
zE`}$%DajK(R#3mB6h10{VwTBS{-aNPc}dQPt<PgSHoQ_(8m}Zi$J3SO2eS<Cl|RwV
zsSLmL5@+N62;OKWZHj-2a^J>1cCtLRA-jpnizzRmTzpkq&^{nusvBRJ*nhni+Bcc}
zz!fzY8$OC>TN&3L_$cuJ`Jb`Yyexjnt-p(Ux(BJJ>cakdzBD1y-jbm%<m_eY*A}j7
zyVm_?k9cADoNv*#X%}925AR$-yUK$)hO6Fh^}XLf8|mM4pm#lieW!=N&=(>b*TVzm
z!2k6ILQTcY`$^8%D~AVc(Y(L|R&ectCogw-z;bxN<?w(f;p^3Ae%M-rK73g@{9h;K
zU85sq#qfXS@PFpL9IIKp-%0qYDC14Q?|1N?)wlK)jYD~4Pw`iekB@Vo-*yUL6F;Bm
z=MR<JzB4!-9&sx9^=25Jt;gjPJAJZF%*YP?XE%sX6pz@+H-6fDl(ru<Ii;tWx;|@u
zJ7?VquA>c~>XkgQ9G$r%TPy|#{s>&S5uCUI+_)Zoa#1vPedJ7n{MfFXVR%Z7r~Vhi
z<0T(*_{ijUHN*Vw!L;uRhWXv+(!R60hS$%JyZmlCtvDN<5Pi^mrqYOhSxS4&;50&V
z(|brGg7sH-0E3z6#0+57PbZ))hE50%2GEJUmP04-Uo*G|oiH?la>-hL8u1+8OSh*w
zQfNe49U<`7t3xy*y`FUX(8&9SHf)79&}K()_tk<s$;z4N!#>~pq7Uic82Z3E_3-y=
zrw`1<u;{}p(kb-Ik*_x(KSCSdG-Vm+17~1JjvSgkRGcS$s5bOr&spe0CfcC2Y8fWJ
z>fLl25gF#UpHIj2VSe}7wC@aT4U<mj-K$+%kq8FSv5bzMy2|Q1c~1!18HR@Dz(?f5
zN7%+!_5|{GkxL&uKUwYT(zkdz4e2vtW371yq3uDQt$<f)dB8fb4*mM;=r6v{Z^6Fw
z8q?X^UJXn)x{XtV={71qHBh%f9Wz|rMs;qQZe!`EQgs{VT}QX^0>Axxme=Pn{WSi(
z@^NLKianF2?*neTfLr=)Xg_=9lM5JEXCdWVomfWI5zAmh{WSgqQ?Q}VA7yRtb@xD<
z?=%N3?582hOipsopM`nbLO&1Drgx_654e}Tx0f>c%hU#^><<Q~H-&<srnSMz@lRWg
zn=<KFv{tG5mFrp4MXc>Y_C@Jfu4TQY3k`aE;#1xj)xVA-nfIHHG#$&AJs8@X1q@xt
zxenuKXFRYo0X<!?`P);<qFurI4gV|uqvkvcokQ{LUUEKj4#f%fcAZ0^^C)x<g><~q
z7wTLJ>1B@@KPqxe17o%8+_NYy{aEzb!mFZY4!`n<Ig3JPM#;X}3IA}=oJaBTZF-)5
z9)({QDSe%D9>o&+do%sMi8)z}-YLl=JXM7bQMxxz?<W5&Pw$4#xy-M3+ajI`-dFsE
z&e71d*s}JQbG}EezJveT!#km@NSUX9tI#(g=Nrc#ArL)<fB4CJvREgdUqXY`d?#}w
zUZ{$7)qGfC@>7qA^wnAR{@&oIl4IcK3D@t8{>Ja1e9E59o60$xS?$*verqE0Gp$Yj
z<ASApYg&8@J}`;V){*`2orzCbM_!~)T|wygL-|X~z%y`0I?KFM7et<~$#!73HrHwv
zU)a-NMR^VkPh;+<mgpQN&3pN(`K58y5sZ|rqK+=;yLhve^g-`P*Ss7ZbCuf<z1K^9
zwTkgHdjb1na7tYJ<Ew#5`(LAf;$gipIO~i)G&zpR@#XY;Gr7LO&%C4X+nOg2{ww&_
zuXmQO!O45BVZ9eH-;O=N(?5HDAtUyO@>hpze~|q^wgj!Ka&uqL+IC|<00yu>Jo>!K
zWq%mQ+SvH))M9_o`{nRJ`c^gr^X(({QhiHu{$}jCrjDj?E;fkVcs*-)wBH8NE}nl&
z1{*|Y&?@PICM|le><^XhIXg}A`<wu+m<Vml!&fNl17m|IdcWBq3j29SV}n56e0>Ex
zWTno1OS3@?!;W?+w<6j}9Yfh5W*HmAGS+t~w08-#;il;6Ci#yh&nGhbzuyi~a}IWh
zR(GFFu|tf&*00~bH3D11qFe75-SP-+3desNY10V&3}T!30Mnloo#Woo2Vz@gpO}OW
zb~60-6!z7r?61?{pQdxR(5Rv96WAo=#~?qBwuXxa*FA2$=)KiFB1dG>JD!t$qHqZN
z1kbiIF2C+^Q2Rt$Jyovl;6>ypW1q-SSGxYO*8OIW<i8c@AZc4N+F<&}R^R(c`-JbC
z->7|p@h0_;M;`g@uulZj?Gtx`19yN6w}TV6fg88NYu=*smd_;iI%n;&K1n-6{V;Wb
z>AJ_7VSe|%uuniM&PFFP+9$9{w65@I#1J;jjqkAy^S!c992&$vLHSn3<);yY+9%TL
z2!X$%4=t1%`$Sqj>GYwI_YG~>3T@zBqeC8oKJ4?oZ|oCk-~2}H6O4IS^x^$vp9rSg
zCo<EAOte93^*dpoFuLWj(8>#-nHNGkeLCjK;0MP(;o}X_xu*IfqZjT`jMt@s)Og_r
z>=5kh-kyQ})3HxfQeJ2qJ^8Tg6RsX*SoR6pOtDX(hwY^-X`jfQZfp~sl!bCbP13u_
zPT{xf542A>diY-S@F(wC%v%2u`{Io$`gm`Q;$P0$J`t23@j2+%$Moyhi;1!D>)2<Y
zdpwSP;&Xd9Z>mDio<GXbPuD?rr=3~wigeA=vlk`x)6?S1@%@&beHAgOvA4ePd?FBv
zf06jt#N<?+dx8C^(YX`DnHL)!c|L6QZji2X0pCx<ce|kHQN#BX1tZUU`ge5jZC&_H
ztSz*TY(-DH^5`QQ>T)9+awAsr;b2Z%D3sG=U6}PpHS5Z^t-_A-_$=$l7S0)88_bE<
z!|xIod1NYj**%oye}4YXe%<|}=dHW%q#ygx-D_^H=eOo&vO71P{=R>HhSuM&<NM+2
z?*$wB^K6=@@5=_B2HG?`vG;lBo=*g49w3(UWN>s_54nI&VN3DbHI*;tr^FbX#=asx
zM7E09;$SKs?j2s-ex|s9ZxQP~4Ljk3(-rUO;Jw;Z8%wbfVprYAJbqX9r`Rytsm)}M
zoMJ7TPCFl+Vr{Q7w#VshCiagy6-S`_Hp-*pKVP$PytVx_Ha{C1&FO6N)oi!c2xd;p
z59vAlkLVMyXly_;u@8mZvxsA?w_**tWG}Rd6%NeYf9ftfia*kkTx?B^)F+$R7R4iH
z_uIsz>+tHciF@$Zw-LLOzfRem^zJ%+?`!uo_;+-omD2v^U|xI+{gw^lG|zP3Lf;!l
zTL<#(nem1EUQhpXY+|A5_iW;#OOE81<{r;4Ew@AQuHcxqLhz%?oi{HQR`q-lJFnK|
zB({f%vYBxf+bQCW@%t)yIuP0~KYVXY>!w6X{e9&O<MG5`9Py9KVh&7Bp5Tm<?!ri4
zIrfvfz+;<;`JgY>n%xr?KC}+oM;CLfHWc^V%{+gUdDeISJU(?c-;J^kXbca3?Hkko
zKlISC`Q$-`-s}4ud+PqCU{2FoXiN+3p1P|dTEzSLc5Zwj_Y3WrO?-dWc~M;#_{Qnv
zSjxi(Y-XG6*V-Ez15@|Eja_a%wrjzKY;|g{l|JmU^Wu$^7ZJOnG1OvLtdl*E@e7~#
z`C@wnbH^5^+OtpJcOCo1wb3+t_EU*U`8H&;pM;<TVR(le<gZ+G5MxXniF_m{fpa^+
z|3><D3>u((V7<_Q9`M~y2X>*8c-4yZorDIQ!p7Tr+tr2!bSOuZi=VA~$<tA3WNahD
zdHZpC{*HYa@bkqYhYozbsGkm~O=5WZytdA@oyH99eDTBBouLDf4?FSY9l7AjB-)_w
zq65dE0iR=idf++M$+ytO`QzBu({cW3{0u#KmVH)mT*tS<`CEgN_V=y|ME^a<I&unM
zP3?WHiXQ^+ZT-d<(X)lG!w&7?h#&7&=L`5K`s?-Zev7_$@m}w(4Ni~y-~04M*0NsU
zuQf2aNq(ru*(39~KE+zcpk-eOM#>uT$t>cmb0Y%<XO;-oI%Zf`J`64B0WUi_PyRoF
zQ!gfF_kSg>?C5D&VpGp7{6NU_Wo+KN8MF7!+u+!)!1VaHz@J{8zd-xbdEaaM2P;2c
z>a|;8=*bk*ZcV_taw_e<7T}zA+7+$x>Kv@y2zcVXqjpchYoUkBdm%8j>7?M9wQLRE
zT^en;yY~dPZa-}=%C)xd3e1R$u8S7dW()5p8Cn=+UC%}fWvf^0okt5*muR8jNWK@M
zO+EZgg(f}(ES#oqgV92*AM-u_PW%=8YbaV6rT?+u<dQaYDWZkpU_UMFaA{$kzISQi
zO4i~^;7{MRF>WuXnV%NE`qi%*T6kh<WmIj89%{a#fxP`c3WS@gp_jXvlaQf>Iq^Dv
z7u%DEMGFOohx9({;KB3?+Hm-u8A*DmcI%iI{56_t>9fB3BI8{aoUvc<xBO^zY57j*
zJ#~5Y_~BjeJmu~k9?mTXZcgEU8y4(%>oeA&ziQ7vw}K6?UZ;OE;9IAs^lu@3QN9`V
zaiyKNf2}<|{!$>Psg1b}W2;xcwcp{7-M12Y-NG6PheS&~|BG4pRvue?19bO#=<g!v
z@IvUZ8|Q`mCf^I;=B>c5_==^1W7b2zZ{oM=)8BA-I?sp5&(j?{3r~0ASHRO<;_`HT
z)B0)ouY#vLIN9OpemHsfJYDDlYx_4@HyipVUdW^G9#1#R2XBU_yUg3axgsYt^6ftO
zIq`DO0<VqKBbr{J-#%V$59{v1m!avtdY*=t^Xl^Gx#8n{?}%P_?`+1`ZHvpl9fzjt
zUNmdpFU`MAjt3-@x%}HH^0<h16D<)hcO2UIQ{<Qdbj#OI(Jk?CUF3}^V1Cv!KP~XM
zL-BAP-C7S$s;!UmUH9HdnZAvKm;T&+i=aWGN8;aJ10TFOb$G1F4v*!^n)_THs}Z?d
z>og5I&`2BF6HZlEM3wtdam}aU0i(RTJ~!MX-mrtY<Qeoo9AD4x^|@2`7l$V`74ts(
zK>Hl7v-ec*EZLL4Gxs0zcj_CDCl>#vaqO}u$JOp&Je=SE?!DyUs(d_L3|=e*FXQoX
zC*k8HxAlVKnRq$zaXrX$=gVJZ;^RK;@^NLqVm|H?myhfCkjuwO=JD}yUts+^Q~0+j
zhJW+p_i^!WE-Y(*5Wb0~Pi9{_^_s)GofF^Yt7|)an^&KQ<A!JRy|Wo!$9v~R__fpI
zqU#mUlH}R);I;FH#kWOfz88Gk)c8T@nEG*=z3?~6zd`3tuc(Oj48_BdOF(>=XyG~Y
zZ|vJ4E0uq{M0~l+ziAG{!<~c%o|TXDt*OVydGt`ciRj_E@NriHhvG5x?X&Q3ndqT-
zI6pm1;jvtL=<!&=aJXp&b%`G8J^ZlpPH-kj5W05qXe8PTj|0p>4@1zyprMDg<NWk+
z^04XQ+Thgqr-7loG(Ju=)}!5iob&iN|9pv$Q{PU(1BK{ohqqQ^oxNCNsJX`4sWEwV
zDt1b7SDs&N93Cu8A2bIm?aA<NQ{y4#VSR2Y|Aw5O!n^tD^l*4L;iqIn@o(bWdgz1T
zR(xENcWZF+c%8m)6#U<4_`q!V!4PtI*yLRk4VO=`<4+uH6AeER%x?2^az~-#y{<eS
zD`XFYo*#pDtA6GuRaXujR6k<pnY*JlLr%6YUSchqfy{i@CFsMb+ag|N9sN-IE%@>`
z8aWPKhwIB<4S%whvuo<%13yFlx<)r2c0Dj~8l0L$nU|B<f=`+mwC4X4>-;ftIo*;-
z?0`R;x0m}y)=u(W=)=ys%Wi)f-&*Csp2S&GCz#__^A7pheDCNyE9LOm%=uIW@QAgh
ze>2)D;MJ6y+Iu%de#-o(9X(tX@<cv+cuOAoTK9b$eVE=arf%s5P9xWuZzkC${!@IP
zbaqwnbNY7ogu%akD>$=6-&Zk4>58g?yUSXw-udB+A{%OvRl>~gOPnd>&DCz|Rr|=<
zd2i8&BEBo8Uw5J>(tgs(yc~o_JOsQI(ZAQx`@MmG`J1#OeG@Wh8}elH@A3UYuH_mV
z@@a{^yX;4!dgm{qT|F<Be(S-Ny*Y{O`Ilvw^G^Eg&0omHKi$t{?lhkrL1a3&d~>j1
zmCYJ^W6*jdLpH0OM*P!*s-JPN$F>Vb>e1_ipY5@C5?3ztw_WV4_rJ2fCy8yyBlo&;
zUY#WO@^;{@jNhtPb^c^@KYUp(e9cwfJ|E2eKj!sy>KY23o(7&|cQ_k7Er$<3KwUFW
zW+&IGp0W^Y6|zg`kt1b5JE5784UN6!^RY|x6+KwnThyC9&zqw?eTikse!1g*sxQHK
z>z5qosvK0_oPCCI={v>hh*zx#Mzlvw@{QMGulXwe-<sEuo&SfLYd=k^;JI+>*y4rI
zpekt5b<m`1kxAVggbhya5w$UoKHPF9vE%z^vgiLi!?=WxI@{FX<LSZiQMkB|v#n}R
zWzYLh>Ji=0UxfN4|0dXT&pd2LrMEs)i7g>({l6`RCN6yD+wXP<xnKBC@778O`p4bx
zUN_6h#S+WLj~?2sdi1Odx}-UgoOI^l3hKgtd9M>+qIb?b{I`siJ^i)-bT<gy6&<yV
zzB4qYqSuQd=`r%KZD_FYNcJTsHg_ucHU)f}Y+`hCqmd~2T-w5{yYw=}`2Jrzsc};g
z`Nsdr3N;;DTuECCXj5ly{qI)#kT+C5$2%CWVuEBF?10uw534?j){A$iAI+VNSz`%h
zp!p_#>pW?GEQ6l(AUa9KZ~XxL8czJyz6&aP6^8^K7=5?K5{!&$?kJScx?+<wZ&RRA
zdC;hQqw@<{llSLeJ?h99_JFRV_Vb}Ll^g4BdHUVZBjImEKeYbe7H;_VyTuFt?cMbs
z>UuZ)$ii=woLT#d=9yUV+~Tp}>(R^P5>L_I!P@(6s^am7lMgu)OgOMGig|ZpiUbcD
zlk#o}9%TPA<6<nGj7dC)W80nN8`sodeq7*fIt&?HsT@2f==%+ZUUXsTYv&3>qkJ%A
zh0hK{XF^8~v*zhAq<g{B!du=L06&kBm$7I|&Wzd#zXteWJSp&_F`W&5ewi^120K9q
zc2eT&f=)g$(VP&p=UnNI@?f1WubD}IaFG2;In=*T4t3Eq@tU1O<WA_PFS55yZu=5@
zifANzYFUvzZhrW0E*hWzq`f8-$sb?*-TLYIdHnwF`stzXUUYNqWM}O)Zckq;{>96g
zH&|ZYGY|hgdx&lJ5YcGGYifNvnZtwJAA)wDQ$NglX`gt}oXwbMaMtP6Y{f$klo#%D
z_ljC~ujmVoF7ejQv)gIE(B7dvW3y$oXWTciaf!B{uU}23{LP=9V=bG?`jyVHwx4v@
zucEMDR;Z$^Lwa^sRw&B1CWM~0ZqC2iUW0724BfqnNq)?-#?5}P_VbH~fs5GruO|1G
zA!)<Zf%^-1gwMx$(}pwb+sU?v+}kp=&EEDLdYyE-bS`_FvA;2Y&K@clpW1d!Ka97B
zv#guTAGFpKA!~)EkDFg}fz|%6^tqF7v>!V%LLPh6R3k6G#4~S>YjeJ|q?5g~HS4eL
z?`}XAV0_nIhJEmXz|Jmsu}|}EDt@K5oqyO`b1(8$)nwWoZM8qI_i0mmXlPobZ%&5q
z{dlo2Z`}OQ-#B=<m3Lde{lve;zVq#O8xQ}(yR9Gk`MV#_@V$TR`Jc4bJb?_cf%o7U
zm$Z`S5T5aVjY;FVZW3eJh+jaV)&3FH4_{dYPuU7T*$OWy*(ljxSBA;?b|i{ks7!U_
z!`CS<<nK+Y-xR`^KzyC@WDGVZ>&0`k9{HD9YtSbz>l!z1zV?@U`DU>7_;2dhhnoJa
zm2tOjW87al{B9S0SNoU3>&94zH@WX$%PB6u;hYylOnKk3A^HRzbYMh%Vy<E#)+)zp
zzwRvG<p082^Empj+HBs3K3&E8`;4qjtT}yi;L7QX^cCWT#UK4)hI;*LUNq|LG`S!{
z9e?bD`TXsp*2pKgF+krgw%YU5H;?~x>5A4cOfLPLnn+phxJcg^)=}%(h}~`>zpKTw
z>uex9{A?$3l;$a9U;KxSj8*)kXsfp;bRsvW%S+1Nd1^K?hAS_n!^DUD{hey9nS;+t
z=**P)HSnu3WS}D2dV{OslXtVeg&vNJPfn#Jwd9NlTaFDV|8ghC(OTB<RlYChT!VEd
z@m*tmZ{Qlb+!|lYvw!i)S$|_qwa@22d87F9LH>Tg-=o$(x1LYA*Qs`+^;1Z@Q};^i
zPm<+MiN61;RnC9itFF`L*H-HWt|7{na@Fstc9Gp_#d+Vqw@UBj<U&Z@TRj?3>%lhk
zFKk~tq2TM0hw6<iezB2z<zrKywzr;Z{h~3Z?w`H)bsO5vy1kcu_wYn>BRu(4^u12F
z;?lVi<~`!hyI@-S2F<(h=-A?Zp5~nAoxNrFegE5NPp)z%_sjOm*`l+EynHP!(5~I+
zj_`#sx}(q-^zxKN0@#nft@!<Lyaw2ju3!2&=trNYCzPI}g=ek24-GlegFZt#^!ecU
zE_BcuuYUi8{9K-1NALfD{LCNb+2`=FDdgH{=x3@v(>u=(pV(Cq=#cv4^{3vzGWm_I
z(s|hQQ~D&G(muO%{!2NIPN|kQ{NHx=LJKs8Vn>$Jv)#Rk9ikcf-9cZycKB`dNIyZ(
zrv6IrgWh(>C24JH9@Ix~9;ExZ($z_6{vz<s>AELRhV4Q3B|V5_*i7@_>4=K{D|_Bi
z`lvo=Zm&fD^i}jv?@%_Fynfu(l_&>@Y@OmQJ$Z{c81_CO-4T6D?gJ>Q@?;+kiatY=
z9eH1S-lP;hvsQG-nqqWMN%{=@E0>_?v+5Onh7WM)v%!s2{gCG6oN<IbdiXffFS86r
zSG_$;<H={wI-k0SBM;SDF5fqRMhuR}%5hx)JPV&|upfA^+XBo9XVDQSaSxncHYLlN
zH;wrhUM|C?@HK1<$M8oJuaJ)0<aSBIv~c?;z}zw5Efbvj@l|*uTuSzZdmDYA)_ouC
zlI$#{E%=O*eZoD%mk+c<NcQyCw_EUno?EmkL|u*4S>)B}!|NJyEO~vXrw-|aKLcI!
zXp!b)9%qv(j?<%A+fO8RyucU-%tac0A7d_Fg|;9wWTamn-nOE1uA+b18;a~uNv#jY
z{kSi@UUn+6BksfTpPWqW(Ai379)1B`G&b<+0J_s4GIo}cv7zPor085Z>1&m<UT|Qy
zG5^VN^IQIgC8A;Q9eFyFRWwXvP9I}E^U=yWh?eUNR{vbpP|sBCPolStX00;QYn_p;
z_0hbjEzv5?)nDKTrhaJs1#5!279Wh%^NnDn6Plir);Gb&7OQlA5wyL_rR%NsAIw*M
zT6_Q8LXS$0Exv|%s${+vFmKvx|H07LnCZ82mG{G##yb_8O*pDt`N`Oa=I~g{*n`ny
z1DBz;V&JL(KK@ShV<GyNULIOIeFlEpH&3<8ay2f?hl>TkULS2v-D};P$9cE~d|yVt
zb^p{LYf<A{i$2yu?=JJfZVmGlqfYI~nbt$_C!8GZwxxA2?PJd=qHXoDoVDrzu3yWs
z*2rfoi7URfcrFbWv=*Jm%2U>&_SpP+gUv0*trBl;$&I485;M2ksdu*zPFrYG_^I&-
z7shZ+hflqu^%8t)kColb+Yi%uj8}i2JzsXKul_vytT<ZxPPW0(KcP>aj_JL!Nqc;j
zHHdxUy|ziec!^_^{>C}lq&v`){FL=*b?t*4%(aD&m+)9NH$yX^mHWBZ8p!tJ=L2Pb
zmVNoyd7RlSdvr^xJ-XfC=v;?KOR+~!bZp86lTvKT=KUh~{Y>`gPV}c$$da;0M<x#b
zt=}Fk8tK`17X%~ivzQ0Zrn?*3e<yvBy*5JK$@i{{?DW59VL#@*19P(+Tdg<0=o&=t
z+Ha+e6g#$wjguYQ$y+y=9a}WtYkv=CD&9jqvI!rDmluDUTqAcs+~Ko@*0^gcUOoBV
zhn>0hd<nFc>GVeMpl=$@`e&y9T1)YD^LbBjlLx)|=4fkva@;%%P><+RdfWI|C2i{d
zIjo0g@xDj1kUXpUY3#t-AJgj*jq=tb=^KrHRd7+kIvU%&8zZneXsxP%K6~}EuBLv?
zZ7X(kt?wTCtaDPd*J%G%Sq<;ivZvR+nYc3KAB#KRU#DN*`+mH#_)hbvJx;Vs^uLR~
zO@<F69$>(nc(!D%$4|}yw^XOcgEXeuy^GLGc{-fs^hdayuE$BYdy9VQFKL^uw6RSG
zqely|P49)KyZUL_r{4@(&9XfgjEZdQ;`gP*7s^(PPHvm(FgEK3C&pQ@a^~Sm>QP=T
zJDGPflT33icIhyFQjRaIW1Cjog6xsGTO9ke^jwS3cP&EK^?Sq@{S)z!o=i4koA&G6
zMr_l=woCYUdk=<2Y}14IH~cbo+!5Qf$=5bwn|AgP=?8w}w&~!|`Lf^7w&{bj9ozKI
z+2?MXt}Xo4*rvzK8fYILuHOpI5&d?r^RP|N`6X@BKcoE)WDP$L@7ZP=r4w~+)2-9c
zt4_mKhi&?0zUkzfetTxWZTcU029Ig{nPp?N;Hv_A_IxbXU^Qodmv6G|Z3p)@e60E`
z?aD4a201G>i8irI|Fz!t*`<p!eE%hQRPk)|yR6n{mu~U(Nj|7UjaRm!)!0~Zj859v
zWs}xe3hdoi%dUIr&DeCWz{Z$cf3^H=z43lnb$fkuZP8(L*P(Iv=ROxfXXE%7s;**e
z(WB*O7z#ICG(?})vj!p8P7@nvEqlqeN3Y_W!Pel9eSOmWo4JRtRlA!15nJ@sHqXW;
z82`=KqEqAl)AQM<!>Fg%H~sw$+oHFT2K#*e%a)vHf1bbX{5@>_Z?~Si-D{rxWfBkk
zxqDY<txlFZt?By>#ulx6)zxd>Xu%epXJ=8il&gN{*&nk1(|U{d&($8|(K}-|8L>qt
z@ub$plk>4B4Q8wI_L({#jr(o0MN1E&m{iXez1wGtE^zfH(u+t3)9UJjjeQDT3VMhE
zdSm5HNZNPMkKKkHV>a)p3_Wzx9#n%aVmLZ3*`#aGm$%Tir!&{L(rZaS=GR+Gr?t=M
z%O<z^bz1a2#V)-rgI&4?yY#=KM^ZcWK6`?NZ9x4rc4wcRKss@hG&__dLb|1&_-ubI
z?z~Bl<?o;Bu$doEkNy<;x?8c&OaBgCM9-V5=Nn9?<mpcQHmyuL9QnYF*rneapBZoe
zGIZp9W|x*7vH*Led~J98U^n7}-Fkit#$?YC{-P({aa)!(|2Vcm(E#D+)8MD4n*|39
z+-LGb(b>~_e=~M2#VpA$qSe4}s-41%ffEjQfV1_y<Kb`%_cnMnY&&(DeL`}mzrNkn
z=h3l{@QMBvdHCn*iS@qUPVM2T@UnyYy!jDs|CD+3=E8d~6Fw_WRQT-8g=eSEG#?&5
zx1NKY`nYSS9?ULHj0kyN<YUxtm+k=`SihuQI-Q1j<CNX`Yc36w{rKPcCg$3tcDw5@
z`j&}?>3xm)Ypnn6#J1u8&?Y^5%)kNX3i@muJ;AS;SV-BcJJR4l>qdT>_7LBCHtTPs
zwMo27lCImFA4$ARiDw&P-RA8xZR-3Xoq>bB*@YF2({FE9+sdaPd$ZS`;AAcBrQ4W?
zvOSY)!q}b#PrycUo(ID>&!+qX=6V8cdG_d@Va~VkP2Xs~Wmo<jb6&)~#t_Re--0vE
zx%wx&a{)H9UD%z;E10x9*Dx2;GVGzUA@4JFPHuDNdRlU>t!)2XPa81Te*1Go_Gfpl
zzXyF74m=+B!Q))U=Z8n;+0dg*IH)~U?|blg3w!F=A?Bu)IKb8nI5?C)17}xbgBeAP
z;%NLFvhjBa;r9^6KO~1->UOi@rxllluXj}bqFxS+KK#PKPkcw5_zV+Ax59}<VEt0#
zriq0(NgRBpScu`|G^@%GH~lSSZsi<&Xq>hE6m?s~vMeujV<F(-lD50BYyV~5YR&pj
zZ1eC)^igL7;Z)RI9?XkdW3caH^HL1OtU=<L*8yvDd4E?RFCHNV%X@zdx(&Zi2xpr*
z@yu7d@yx_Ecd}P~jCf|{_N&M5+52`~T3c`Mt#Z+5t*<zh*k1d4l~MIaet;d=E|qIZ
zeXirYBle3j#mv4DoKd3uG9lA{`O_&^sIgm>ypDgM=*pYCBR}#!Y;{LjQw*rhFY@hD
z;(`2aSd39^c=c-^y#m{>|D6`_%>Rz|yG-+2KwbJy^P~P(fb*H&(>lb^g9yGnyW$pb
z!^zLN2$)<5Y*qoI*8!{7;*awQa=1G2v^tmT2;;C^`=aB2;mZTC*KWQAI6f4V-zxd_
z6z|Fz=&#MR?ibu*Uo3kg+bVlA*D6a~XqAbEyvh9=+-HS=2kf};;LYne-&bwyMwZaN
zbb@m24TFsbUmlZ3E5bOS6=weSxbsj0Zu{r&IQ=*Ma&4NO^uZas6H9#N;p?KFKfL;o
z2+DS9M~@T3U}A17Ei*>>aEWj7#<+_ynt0xcR@v)Q7}E^KnD3174enp(Uj0AFShC=?
z#H-un<5C-q0n6kMQ(axGjn;1u{Su$9IN;-o0}l4vTYp<=$tA>-h?bnpKuh2;2GA1G
zigm21^m*xP-wE!Pdvt|4)w>aVD?D5Wk2CtE7`npy8R$yN`<dv<7SR=GpXdsFV6v@s
zX>ECQC0F>|PgmNtuDhWt-Wh7j4RBucg!9!j-Yv+X(w%PXrx~V=0{ZE-As@hv;E_vH
zoIXG+yyu!j?e8w_FwbX!GegaHI{jEjd&8k0gVj0fbYhukOLq!w$p-JHM^FD>`NYp;
zpS*~(Oh-2_Q`{hH;L(^yaOR~2qnj;qC3jLT`tf>jRLL8`(Iqa;Vb8LjIu5;lEiftG
zLSOZLh<WkPf#~9^%&Xpk*YML3GbdXHnG?}N^}(a1c9NFf4K4j7_<JW~0Dl{@ll~G;
z9=x=i#=$_da^HD$Mg9{pmwt-2n6VT>M=pi7%!amn#HB6Vzs~))wdXEn{ESWXvzOl*
zx8}TetrczI8iL-C!+E1K9~OHT^T_+6MT%`#xng<#6yGxWndqLg8^0^wsWE4=p;4w!
zF74D<{dru^JX|#(e``m6y~&T@UGpEYltZ{rw)Vk(FKqep65c5b+t!16uY>(o*GLWf
zLVe5q>A$_Yz3X80`peI?4fvi3YS+8^>l*Agwh{BsyZ%0RbNCzX6?=;L_ut*?9qx6d
zdwtNoE_JUrx>x9>`B&v$SG(7R?v?d5|32ql3*0OExF;9E2N&3pGdb`(R)uwXIP>q#
ziFX}rKK$k9-Bu)0X4c^v=X&PhzXQ)~=tIExS;J$%dxY9bo~S4-fsdEXstDe+CQyGh
zF=g!G3wU3C#(RyQ@uZs;M0ee39cg60ZRN~V;;Bo;YwTKJefJ>n{e8|&-3@=i6g{<%
zd}x3AMT>l+7O@#t+qWne-BTVLf4#h$r}qc#+t|wC_3d9PfBk)X;+o<0?WRxs`ujHa
z+Tr!>U$6a@_09Txq}{;Z7u;*TdmVwxUoFmzz~zv%W>B~s=fY>6a~+f>eNgD-1RpKG
z)+&|0N9T3y(s>>5eyzSUIWFOTGV=HC6V90&`vQ^Y{q((+a?$qydZ@u@{E&41TwwP7
z)bDelv%i6UkHC8MtCPeV{08QJaQbl$e8c;x-@m1>o@mgSdwJ;SCZVgFjLvQfeC<^D
z;A!x|qs*CFFMQ8FP-OD!C<mK!E{4v(mOfeXWXRPYEAHusg@FU7$h{oP&f+Y?LG;U4
zkZXtfVwa9eo}E(zj~qjP9X(_pfEGT<Uo)}f<_xPX)LE5l^(_oqMg|wppDEwY7pFQt
zjkixlPqEQ%ew|zqU3)nb<q&$)fHk3`&~83NpWfW)&|&52c#Bx(gz}<nwW8$LGxb|z
zO^oN0#WwzFqrb9b3w<ieZn=Le{V2w_Q1Q=I57;{w(kJy-I^0W&(FM$Mbl1J)lMMx@
z?9YF~K9Y-$+6p`KAeoq4L~ZpGt?gYKBV~1#b!Bu^{gUt`t29CW<AcQBMrq?&>MWtY
z!{{EjHQZLZ%O108Ida8ebQ{QgdD}Mjm(4-WDpuLn{<0e=`;f}M*I#xoW%&K%ZQI*l
z_BdtI6>oc`zw9~6CaLUDf7#2F$^N$OXn)yZ%A}Xt7Q8*#zcIu~D#qupCf;89Hs?*f
z=JtCI<(JuGnx3=6``_m53GxCr-&=PtV;&nH!`Sztf3jKAS*&>nFra)Y*oVusC!+IT
z(}^G9XN@kw(Jgdb${P6M2&HGieylj(9Tl`M8%!R*KhAIB3)=)&n(yeb#N7Xdo+aIm
zSb$w1MxC-r%l4D!%cEI<PV4EkSej$NE;8zdqkOZ@myfGax)b?MxHgOq@-?Ho?W>`$
zu|fwngh!r^XF2*aN8fb^ICnd^cN;i(E4X+Ia^*7g$IdyR$$EXZOxf0CKdK^+<o{z#
z8gt@O^4}0Yyn}q4@*&au`TrzuoO$?%)Nj*HfcAp4n+2|qGBR%>n0w%@k6766t+qF*
zi?hz!Ucb$1m#$2@Da9S13I?$AqOT6-bG}3BI<O|vzm;HnHgU&S(5KJx`)qN?M;Xg!
z(Jk(CZNALcvWfWX2oB+;m{am7rH%bW@T;6T5n8m57-OR!rLA4a(<g{KeuXk{vRyEt
zJT{@A)xIvvfrZwqh?ky%{N9k&+<T$bw{t${ePEY}m0Nv{=>KYh)`WvAvYHPq&1!zV
zGOIau9kgs|p!tnM!R9v`g3WIg2I1kRw6$Ns+9ocHCcc6UPkCbP1<@X!B_6gY9}`X7
z$F-U{tkiu@G_gY0aP(xM71f$_0hdM4jXHQm>_BaO^Q}JOh1-~`C%+lwyew#B*NTAh
zP(4ro`+7fuP9M8m7w`Abcjcs7$k}gQ(4a8$q`JD^x;85MB>ix~|FD)BJK03*NXHt-
zZ;ACu+KAudwVMCgVCJ>bItf<S;(M`&b-kDO1Q*^~O<Zlwk1^k&x(7@1$6IS^$=kzv
zKDi3o%S4S^$yry$;hd(vt1SG6^It8$kh6HItz~yokK(IafREkSvnMkLUVZ?TMST8a
zH7;Cc@*!#ASu5`g_XUUY<?{N+{$qZltV_bC-v1u@pzrYP0c`%t)s+cG{o{@hd#XNp
zJ}33mF`d}7lUAvTQ})xN>BPHlBJMpT8{mTv^%iCQ!Ti{v%CfG8)H8cpv3-1foONZa
z@|v>hU?@Hd`)cgENFP2f@e1~lDV(FFdG9*8*2(q6oQKA*-xRifu|a2}PP}~c{|RXy
zWuA%OjMqTtM7v~%w17|9%Ob?D{)Bn%+In3y<ib@AeebS}0ItYG;7%{N&?CJS_RrJ7
z8Ew|ANc1Y(ig(fW%2R7!DaTiP;i%1<a%flQ3|>LIz^mC?1*fdjGOta3@7PIuqKRG~
z>Oad~e&W#$!i&a0sOf8gDNVx3ZvyXq*IGMGj6HqvzOnw4y_J5UdwViu&1gDh`lbF&
zX)CamzkX`lBE}+oDj8+<X)INg3vY_;iA`P50onP$o$(7PpUyti;#<4U!x?hP98T=`
zEcEuOY->k(u65*)_LKXrDeJl|(w-HLJQT~`JpH9HRr6cNSaXHz(|I>mSXtJ+id@&s
zPcAWuEAeCh5oheFt(@m7qSc(cw)+BW8GS8#i17*TTb8E6Q44Fvx|D@RmCl>XyloCl
ziFcG(%YIe@TzIg+{W-(Jr5Rx1QftS}v=M6n79WoE#i4)T%>CW0^8@4&`}$~W$KTUW
zKP)RRPi%SV{4lVrT+fZm9sfu1haN7p08g6lFnK*@FqWh*WwEng%6=AGv7qd9A#|91
zcqVhT`7Vbi=!2K|e}VcX|JN3bE{qoUt=;f3b57IDc;{8tvhoUS4u4D@hTFiUVEu+z
z;^*%Q)(@3wf2rT_Grk*aJhQW{n-4>mnij4qT|3HJqnLsC=g6J*h`qF$v-g_DH*Lxt
zYi++bklQqt@pS{Ue`N12`?E2<^Z%KA;(ztvpY;Cz7;D}l#<q&HFK2OPU^iz6ell&2
z1P3|FMPXYL;`f;|{?;7EPTNFG!z$(jI52s{{cuqOeyiRb=1h52y7n$8i&q2Btj8SY
zN8irIN5H@>u%t8mEO;cr${4jjEq}sE=8hbA<6|oVWzR4V{&iD*iod763Go$?K8^P<
zWAyq&eaSwB-1>Jz<C653Haz&wWxfO_G5RMMpUr(a_qD{|u7s}E^7lUi#6bTjv7Psh
zbiq@JZWV!dH~p8(tGTeCIyFzin~+n_8s#G7EW9Hz_TCxmzOl*W<H{=dR%>z?*ty=G
zxc}{?k-k3@?9ld)?I$*^wa3P*pgr#Z8!9`@eEgaHXPc_+iN<dCV|#3q`0Z_W?*6}m
zSG{lLy``_&7n(Tt$C>-J_Lz7DYkCwuw;Q;i@AnHQ)Gzg^4xA8Q;>}6-Gk+9)0KQl7
z=HZU=De67FPo9`2_Q-e#YpZqZNZYGL=RCejK3K!ytK{#M&R0#tM-F??kb9PVwX|2y
z;61hF?bRgrnr~prmm^FtmBd+>M-%MSA-nWlWq1)2Yw!PVc~2@0ZHFG}-5B(;_J@n-
zX|B#TPX+CXWxXEUy6_>m70e3Oidlzh;8tf46*C3{Bk*}1i~vVvJI^Ghc>9L-yMoH0
z_nO$(BJF+b7u2<;X?r5$I=xr??-k7TZpL>u-lCIr`abV@Jd60>rSq)$l6(AfUc-BX
ztyS03Ys%P*SFO7;b$_YXH^91l^0NfX@cUj4HO+<Q;YYl)oOvwfJ<)LRV9mB?fAw?o
z;4tUrzO=b{;Ie^pW5x*_E4SPV-uKf&lUr_f{~lI5`w!+71>v>J4Q$6}u?LF}65mti
z@;xPKd{21>zNdwG^Y|Wq?|6uIJy`7ceLoK~tx0@~coxB)c$T7ID!<YKy$H8Dxr}P4
z7rW~KoK&B+&ldA7dx7C;w1)bQHNH9aHLG2@koFu&#Z9x$tm)&FzjYcP1^n37Gd}Td
zMNfZoQ+RCT`TV<~zwE;k=dRx*I5`PTJ&o;DI&*JKot)Eg5MJygcxJ(0vWFj0Uv++m
z?rV{2L<3IV#y-CoS&VjKORc`D;LN5O^!L=!$|&$=`Yl**as6F|Z|ch|?Qeolmj=mK
zuwHt4<_4HFynQ+?ocOiudFtcYaBTO}iDja3ejK~v>Fg9*SkG95UxJ};F;D)!2!>iW
zmM8h3s*Twu4&;3KpjPCMFnfo`|CHZht%)3E-F*AH=JGUWglK>NYv}6${^;F=;g5FD
zaQGwfLw+7<?=KR|n)&Wj4m2@{t|~iK{?M6!LGsx=z&gnX+wc`Gt<d{9@^|E$+aKZl
zar&zLv6j6qpR<P+hJLksTp6@;%~{q}dz@&ea_IQ?xCh4!qz{7A!Dwe4V_gYvRL=OE
zvzb3%Dq1>=xoH9RJU(|;+Mf3V=2rZA3$jAjp~^DpZ(<GLH*=-Bs@S)>19|(aCs{|D
z;0bE8(IHLHIaGP^h4_rE$H%A}9J?Oh>C3Py&EZVG*__FDgE^Bghco%cnschVsXKls
z*xdD%NFV&<^VRC7S%<uM6#Y}2HvMO6#gXMo>>Qf3@@_z1w~D$q!(SEubp58ab|@YI
zr{)0Xa}tRwH=hZv>A;_9HGPndvYy}a6Vq5wKIL`OrrK7!W`5vvkh9EKyU=}>^L>jm
zx9y@qnzv7LFL_e!cU`Dh5}m=A*H%Ou(&ZG{<P3(VlMW6#I6uaoU#ly;VXLn2S20}~
zcM)+V_@->v`2zJp&YhMYRM5#EAi9ljQVBY*=3|RLfgbD{^kJ3g#W)lDKKXV0qw(wL
zfR<U%C$$qhojtE(g?q2|bPvyNp3`ov?jLsV)xPeT13m8{exidl*YA|SzklX=a+(oe
zxy$I_^enMA3!VJf=;;TP^Zr8mHIDv`M^85aAMc>i$)7~OovxGDS=E_z@+Z+1#l8}V
z##RiXkG~YTn7NKUlXjN<A@ooyZ27FD=;J%3Pc0mUdd7N6vV5j9Q!YVX(wQke7jhmc
zea*^67f*f4MQ(KQd+`}tfi9l<WfOID@l)CoE9?|qd}I`Ppx`B2k^SI9AB?T2fW}&L
zrORn0FJL}<!>-Yck8)t+%9wa()_V(jbuSMT{%IwiADZ{v_MItzFrPDdk-4g}I3L{#
z#Xl`uL~s^oodlYS$#Y&p?0L0aV0eGvrWsg0vK-#O6Z-1a+c9Gx&o0;{9?zWDB%JsR
zzsu;ie{aw}W%SQ{&sc`1e`c+W{+Vyq4W)l(ObOP$1{{ciFY+Z9%y|0eSxNo#65#7*
z;Or*ge=)FsBe2J}d$WwMVWXMTfiZyt^v~!gGwGibLB%Wtz^fqjXVK0m+8Yf#XXA@$
zH7ies{Ge*-o9s#9Ig#j0=DY-XzA=H!79?*Ia{XlF+I{dDl9vd=h<99QEn5i;h_=kR
zsNxmHohjx>a_a4qHg3uf+VNJ_GB=ppwAP*yujKb;{IOo-yUqA&g`feA_-b_pt>(GV
zDCkDnC9F@bIU_GG{%L64OM$$m9QMZ9c4+@1{-l>VG?uf&&?j`GPsoR7DuNz|`lRa$
z#f#Q8rtn15;E7ac(M8Ba$bYQy{U4?Ovnl(k&nHYeclm`KYp|m90~nr!E>3wX^9+Bq
zYvq-t*r%G~&qSi|g3pVuim~^oKFN_4(DVS~7EY=>M2w8ieb)V4+M31~JYGvY*!K-x
zoK71$%gM2;d;z_=Y+L%K2;K5S__@`hQ?Ck6Zrc1s>xgJ`7k!dm{^h{*ruFue{pIWW
z%f(AQ*8T8?_yTZ*J*12Cp&zfXnq>>B`SRLrtJYb~+jzhJ%jMf1=eKZZb08<)LcJxE
zBBkZ_q<9YYpe>X$uCjg1z2wOC;C|>qeCh%gTRT47;JaYOgX49qtLDR>59Z`O*8p$w
zdtZPrsS|ggae05v`BTB@sY21%QNZMAU@{w+3`NiE<(xKPvX^rQt7zvaHqT=wekKd}
z3byqDXM)ogkoV`pb6Vs`3`yUJE>-lfm}>&PeC$#y)xOF4MJufV_RY=}<VwSy(uF-j
z{Zk#S?m1N2M}Jjy3!aO?tMajr#RK@fPl8_m6n?MO;5#vtmpL?}0Q-sHQRU%T>=TSb
zc~NVDvsz%L#)Y$v;O?vSUX1&iAbyg}f%)d5{%=C=H&%vkEWQc3-z4MeSaYv!?|k{)
zzA~M2>-DD*SW$oKp$VEte}C%n+iV1$O@F5Ke^cvzQ<LGF8rRqJd-I`7jNOwhYRLH|
zxbWbw0{HWvv32quogY^TY(YaSQ(;eeOcq)8{t)Le%og1OcN^jL#OLjY7i`7$SjBmx
z<yOF)J(_RZ@hJ5dllx>i{GRHk-U&Ix!K_7YTf})CrVeP?7}}IxMCHZy<C_-RVZ-Om
zwsZDlKWJXdzP9M6k8RQ(cnNJ@53e>GK5wnd=gqMq?VHj4iO&N@^A_?PST}rJM;afu
zg8N4HJl4bbISy@i%sHU*x=w8k4&Z49^D~gm?iBk?>?=WZMT77)AHi<M9vFKjD~X2@
z#uY2fz|*V<HdjG+@5DCf;b0~ogBM*NgTIiELFH)2$6zaKv)AQog7_HFpEn;!^D%fJ
z)yE)`=3~%F`$hN|9AaGX$k2a$42}kNE~GzQJOghWAA`#soa}vVf#YNF;n7D{u^)xb
zEO^CA^D}6XpTPqI{R{%gUtP2lr(TjQ%g><w?e94}{BqXK^D}t+2mNJpSj%G8{OuR|
z%Wj}deg<#v>My&OGWi+2y|=&YamuEv?4SC}o}*0r$lLq-%U-5Teg<#<OMls6%A`kq
z`<4DO&(GkUf2ZH+eg<LJ&j9><oEU{3<RtkS$lqWLd&^e8uK{pyR$l{fxZW3A+X5b0
z$Rgs~I`|#qIeV4i+t^%oXiSFJ!~WRl+Os3>H+eiW{s^>d*5zno?l+MM()mI3Y0Fec
zg1t$3v=v7x`MPlkKCCg_M*+AuJR<#DHx!Qu519auYQ!VL2dDFhTfi6Xt%+dHkaCi6
z#{V}YzVFRB@Fq4O?XRz2XSFW^_p6}e;(-*W>iHR%xH#9(!1CL3)7C(=S!*EsZ60go
z&3nE3-c;sJx*O%bzanhS?_;0UI;dQ8FCD%|+hsG*+G-6vea};@!Mm)JH~%M6-k)sV
zm(Ah?xwqw$5E^aGQybmPtNaa4HUyg67hfB#k#9jEJ_XnqV-o|-hbH1<5X@?RV=KM|
zmG~AM3K-vl)0J7MUM`3x)>?f}L1PkY$3{=_Jb^se!#jyYZZvU^)t9)9KYR)jcj+2R
z`WDm$AAP<rF*;fV&FG`9<B6=O@h2z@G?&<qKHn91^m+J-Cwl_qY=yt;zBCYB$T#vO
z5dQI9(s!bWy?+(H6J6|qwal|<lk{zo$AEpthAh;K-Tp}ID(v(3J30^lS{3-#s)pa*
zTAgIRCbL$a&j;Tayi#2HM_H>|S*uO>fP4X)V>*6xvNn20c8STvpr2rE_8Htr^%L=I
z@YU#gBCDZ!^f$)*hwAE#uR+M?Yp~wuYal-ZjV*sHa$d2u>@NCn5?QWAZGhu*T)6Rc
z;iepWo2TnRH`z}k`0b7Pl!1}{F+*3(dzt(amb1rR<&N>IjBz||4mHNLjBytA{ZI7`
zosE}Arv|-)>iH~Z(w>?y(0+r>bwK_a*<7{XXb*B??`I@q?_1z?Ynca6|GgaFEa|_G
zvDY5w{a*CBeaHws=z66SztYu-KZYMdIsDFg`cgdpG2;&)-v481{s8sJWS#mJdcyA=
zKa<UQt7CJ{fmZ_0(T%O&)Huf4{?HiY{a{7A#%|+hXJQ%Qp`HrNG`<h(Gx$Di#`j@{
z&-X$85*<bko{21k{{rojGrDbe(Ax1s+U{`s(t#g>a3Du~zLl5M$shZOqmzHE=g|$q
zrPGXEIMQS0LGv-G?f9j_8{{GIp7Wo_&)`gZy(^loywu4yAF#FyFKemm>%qLHr#Rob
zhq?afb=FP~{yZ4#L_b>%+{b342gC2cz$-f0z4ATy2)+l``Fsz?;(IXGnwywy^-a__
zhZdA|uSoMfC`k1^=pY|r1lV|&K6<!Nkmi3-!&(J+NA|?c!D;ah?CSrg41SQ9(&hX<
z*L7%_r@bb19qQ*<J8l;YR00F&B;v?iIl#a}z(5=vg@N6H-6e%a9Q48OEa1(PCGZ7E
z$-gB0oAHUrPT@*d;exW4*k_9bWB4I;!XuqT_Lg7EH>o3uqs7i1DIC!^>p7#RYb$Z?
z?z_c49|Xw-9nf6C^Ci@Ai0kY8y}{nYxxZ%JW8CLJL%SABU$6G2w{>4{^+`YAjk%jK
z3-0e^%-xJR4h=&ea`UQ%D@&P+3GnS}Liy-&?{jSR@==fu<S^eo&Noe*8(AI12SDc{
zx_G?+8t<PQwWYdtPqpU7pScnL6Y@qf7s`q5uj_5#rx-g!3BChe6Y+Z}43rgxLrpUt
zv5G|pMVBLfe#xbAhF{{hM+-&&v0EnT|Ji7vX#Mx0gAcu&Js%t#k`{{I7wmUzkRHC&
zz}E^^({0s*!AikPj*Uj^>eW$C9Ui<S>+!*ZU_~&o(1jzxjbN#Uai`Cj_Bp}LF9R=v
z6V1H`H(G<utdD=c6t0I^*Y0~9-;y|dvHUR5A+_gQIY~bb&*w<?h(+ul@-3OKJ~rT6
za$Blz$tvQ+wbq{RhvwFzKKcIo+t#<n9)FhumvLl%`F(^;+t6(0C8eG`;M3i^zC&Fe
zol5$U(2v1<NPZt5lExQY9}@Uj&xhpSu}zykx$Bgi59pugL(&CLmGmPKJw=BXn+=af
zJ>Xs0KT?NBdxRH<S>t!Empx_urW=E~`~Ms~*$jSeL*94?ACg`61@SuO<YX|nP3!z~
za9hvi*YoH0pKlT_3f|udU(mGe_@l2#-uh>I?EZhLyLab*=PzN8Tcz0f$C(T4D#p*m
z!)?(5$H$}z`Q7y~apz1pEPU;H_C|bu9KB$Oce?mSc~S){;6}XO^)VR^pC+DVFg{Iu
zh4{2@z^7fBw)Vnz@o63pGaNom`*;g{pn(aWkBML_>3`tbcdMXZ`If`;_}|}>W@pp6
zPBHev*0#m-3_U%|+|)!9%f8|5Coaq+;TZVy`;~Mx1e&o)A2E9{Fe5(`4{pG@vQpz;
z;@jV^9DIL|eZ}#o*#B*ZZu!?H;^U#~hv1<L-1lUI^LXg#uD^rI{J5$0+2iA*<u{_7
zCPVR<qO0{K!&{$Nc7<6V8~)k9KK0;*hvUgL^>EXj1NNb1uX{Fh|1)s!$KQC5=jTI?
zz4twvpINEntzo=p+jqocdpt^geky;x4jxPVwf3Rm@Y7eN@zX7|@A0+#-Z9GfnK&>R
zf#>t{wBkJqY{%E6WR%sn(&cHz&wBi83v@rt*JQw+D*3>2d0fG@zL9-b-^IS-_?Z;o
zPh#?NxjsYpa(@qNE?jENrC*}M(l3r0=y%Y7ZC&rl@8B4G_C)C4Si!eT2lcJ|59E8`
z)sgOlQ0Mv}3<uBTN9U)3ems-!fN0>)#t#igejkIg;aNF&7QsfPdF%7>A2qCHCR&)B
ztFXf-)&}q?eDL!-MIUW+gJ%9+dfG`oH2;3M1DqG{u6@4?IZJw{*u$xQ2qnRp#t&gX
z`$j8%2t}N2lyA?Bua_SJ`^|9l(%sY@N6*o<Hr)?lCcX;ruC$rzhcI(UKZFI)x}p3K
zN`MD57WV2|{6T)7`)=A+A6A`%KSF@M^}*N0sHYX#w}ZXhLPm_i+tlhF-p1S?T2NM`
zd-yDK&t4p3U+j3my=VNbx~C6%{vf{Y(g%7z4r&8f?e}p|d#AJUXE1&T_%l#HXMbuB
ztJPKYaedI(@uszP1j=9So`DS;J(}m^upByy?W82JcbK}ny=^~$CgY1hj8LxZVwqxu
zLPl4Aa%*P)19W!-VggU1!;WPSp{JjXJ`Ua}c4?ZP9$k7@Lnd84<y%KZHIHHB<$bQL
z%x};7H2%nwv1f63;r1$YXvY75`nu88A5<*hA^Z=dr>FjY|AWbGiH21FgZhx;f3Q#f
z2jtI34k?Q@I6erH(Oe&dcH@IU`MxacN^cL{A|HgySZ{1)QS3~dpIY(~^>{L-@<9Cs
z_$IzNdP&5{0;R@(eQMmuj>ZN&)s-Emx@TegWyh&Tc8p@XYQrWfnItJ^@NLN_tWxoO
zQ;-Y1J{i9Uw@(KP@q3s8%oux9D1H$7QjCqK+_o^)TFYb;k}YTj_E_2AG~bG8gLh5p
zx}cv)T~~zPF3+6QhfAL*Jj4$osh4d5E=9*=FE+Hu<>|ze*zmnZ_l<s7d5M21-8X$*
zH<a$1vEz~B=)S?7bltauKhk}N2I{_Zb%w9wBcyrJpOeQf3%m0u{2WGOQ}*Sw1NIi9
z=T_`o3>=legKWq%J{gHJ2W7;{Y>-c%`1U)10ol&x+F#pb+h5=GNzOa32c92dosqrn
zUx`iQ^Z6C8DBkwT#Da}g_NGl?@@(pyyAW#-3WuBYdn@xiGq3jtn-^P0;!~{l?rf{?
z=jf%YpxcdWD_+qV4DuPg5}hzMv@+4iB5TtAe0yA6^tClGu1UK8fNk$T#QHmD{W|d1
z6TA@J);M&1IR-9jf$whi;$NTx{5d)>^)*+z33xX4hy#o0WBD5ENL6@JljBD)x$Q36
zdzRb?tI>_M;d4=qZ@{-?o5CMq8P6t>W8oJ;bm+>fz}~JoZk3M&a~G3O6S|C8Lm=8n
z{U+}6_@f(iF7YJZm0d^gZ(ccfr+kj^tt(r^IOESONXkZe=tyEyBJI~9BQfu5H0PS{
zwZX`{lbBCuF7o1EWFA}bMaVoCj(>*guVSAOA1PRmWn+J(o-fk(PV5|$8UOB_Nlofg
z9do7n)^kQ)7{7)(Xv%93741|VwerCbEb`vZFO2kEOnt@J_Fl%P0-mgSTZPqp{o9Xh
zs6%di2l+CD4fmx$xTzlhipSSk&Hp@$I3fHiw((p374lbU0hdeAbCu&em;+zt`d74T
zebtxs8T=~*qn>@+1{NIu3MaQ=Z}oM+_qD*e?A+H7r|Q_a<(J`&Bi5HaUwP>?4*iYz
zThzDv_ow%<zeUp5BQ)NjiM#Q4@O&_S+x#ttv_m$84k%Y%^cDMn^3loO*urn+y*m}m
zBB!hI^(isFIjiu=npjV`6*1{g+G}L**ehBqdw^{<gZEE{&b$_?oo>xr4&RQSlF41r
zf!(fS;%?_V_O}S<|6pGzIl78{bZum#>TAK5K)C^ww^w_(p36R|T!uSW1P>^-$=iRu
z_QKR(OuLFVJ_gSjyYzyjk3$XgD%Jq6y)}@*cavD>+t7DkZy6e+dKxqEPY2m=lw<RU
z@K2re^(p#_&IOy$^fsMOdaB%NzXUso&Vmfha^U1BbboWUwPru`CdM}*<hT4C)*9)M
z<hP}Kx3O2?-45B!1;!Q{Y(BIi*!=p$VDlS6Y@qb_txD<3XOx(j>1ynnYq4)Gm3=ci
znz&ASdMAFm=X3S#n}btUZDS2$hbqdtD$zw(qN{{Im);tBet%<N%Kr7xc2BN|jSe+E
z2F;f&E4pdPcKMWjM1FpXy*|yHi6<YlKI&RX-PP0`BNnxox=cOzU8tTz=u@<w<ew%M
z)@thrTid%CYn(A{B^SjgY&x-tm1Tz+XIBt;Xm%jl&G<XF;)l>+v&OOyOvN@ZoxBt?
zN_sdO=`j0sS0y}Wp~e2{tl6R5YooF$Xg}`wNTlzL@<_Yd)xPM-1G?8Zdf@SD@q>;r
zH?6vEMQ+g^Q_Y(3&T%8J)Nk10<C9u}U%^`_?5wLl_rm9lyfMYu^L_r*%h6M44^A{>
z;FbLT)Ym!fn*NZxpkt|fuYR4%p08X6>X-Xx{Eqdz=8XiVL^nr7PXoEv9s5ZQb^)Fz
z-<#!rpQw}%^@Y*Xi^t*57i|8{H_D>Xz4n1`2dDMM@!fo;VS4Z3pw7{<wiUBi9=y=r
zmivp>-hF*aVB6z%p!v=G;5MCWTFV&Qwps@cK^u^bp8OIyD!x-`9}w@>3SaTuUw=F*
zdZAp>t<PK?jc`s>%U7=6ratRiZx7u9PMltR6Z_@jD1Gzg@Ek=y$3;(9kH`OT0{({+
z@dM9l-ny|g+LcwmLH(BBr~0eBAnLFDB-G!q+uucQe{ZF~`)IR+zKS>e0sU4#Yqwa<
z&j#)0wr4&beRk{BQT453bYz>!J;+$J){=p|egj7(514g!;;>bxHx3)x!a8%_`cnG4
zgnr-5m~O(ya#a7AD&_Axv~T56*SGQ*zLh78&qo&YPxRI{@}qn!Z?S+4Wa<GlFBjhL
zx5&5h)99<@TRGSDt(->Q0Lg`hrXw3NMtCvDw^DHr@+%nd>>_Bq;FYyH7vD=yuh;>P
zsc+SeZ(mQA{kHAvPVU>$@Sxf7qG>sBp{1=GBkjsx^1X8D(6ZX1TPw=sAKtq6;+@B!
z9j*6OMZ1uRx~#~C@9(WB`y9U6e+$gvr}pHX%yVnQMZF>Rhb=S8qgyL4+R3|p9qc`|
z=oKTD)%Qa1;@%jvxd%B!a%@|0ZPX@5xmicxw#vpf$C^o|G-cEk6|KT9@Dy!rCU;d0
zyg=is&p3H6;MKd%B*raT<>b4N4~o8%E~kjPjzZUvRr<>C2{?tERUVug|CZzua_H(_
zw7M?18(UxR{9@wI!@yhA`h$57)8DncTS)z<*jrlnero4mQ7?9jHBI>Zu0{73M&@E%
z2Y$%2HlB3_rxQ~*Esn3k&0~&NmtIfbpQZ0N(Dyp%SUKPBK~A4Rxqi<=cPRe^<=3rd
z|L^Ah<IG94;coh#s>78HJ6d`7&Tv-MJp9nN>mBXYl9vv$@4Z0##f(LM5jO7{IvSkb
z^g{4cy~(wqFN$fa4GxS;D>_czc4YHzWTz-~DUM2VlX#IfzGE)STKLwh>o57OarXo-
zXlr3Ejef)eN8Gi0N4_lRrZg`6YL`{vzoB}8jhi)xs$2CIP;V7;tTprM4)aWF-i3@Q
zdywY3o;qrgx#~vu>$PRai{d|2hs<o|Li$_!JBvB=`lSA$CrI{7?Rb6j+7WE2{59eb
zI%tPJ9?-ny%N|MIikIk54)xCAI{Qd<X~~iN(%j?urHWhVA~%6x<PPRT-`vJEM6P1;
z)Rc7dCp}Ir{aedg={^>~jw?SZe1k*dH{baz?JgQ+jbELpF4Z{irH$tp`)c}x4-#@H
z@pizB;H#MTJeazb=c|~HmCVPz@K&n-F>IC9_?R`4&s%ME(U<hK)|}19_O_mJ*0J7Z
z-dJ;;p|F!SWcRe`gBQ<0KCY%#`Xks2O|D-;ynRl7g|(&wc<u`F{W@z+1;4ent-<PE
z){7j!sb>qGzVABrx@(iUsV7;VxO*A^dbS*DI?F)k_O`N*YOj-Qam<x1dfBTbU$hnm
z6c_MR2>KI(uMcxA=DMq4TJQH7ZtHD*rZk1WZ-p07ejvUvypJbubOzz?7aN|@@OP@G
zHUocu3AT0<p9O!vkNNK<57bNPFo_=HB^M^Wn5v>lU)|Kj98Cm{Jo>gaP_Rm8_=v~X
z**P)dy}ICO#p8dAacvC-4t)EHz=7{n1`fPQpWmX7IwQyUE+UI0)`p^q>&4@bjwZ_K
zyUXLhLcjLWr_=Y;x7Ym_uo1BCp9?;34o+GH&Mk{U)8*6G9b8Zrhp+Vb{?@?E6u!SP
zduYD@hs>qn`v<A75m@s0{zmBUP<%f$t*r*We;@PK%^buTtNPsl|9_aVXEA@RmA93C
z*_zZ84c=BN8K8~%>0E&fP$?N;I{g0><)te*Jt+VG3Hbl%@c(&j9fk1!$O?iT@pBKl
z_5j^$e&l=Bs(47|D5mQQm;b+wy@_|W16vlk%+~q%|3=o==+mIXX8#iZ2TsWEQ#xx$
z7c_LvvJUoL(+Ao$ago=%_q0!3<otu+w4Qr^L(1uU#}8jlzlVL=FQ?BQrkq|lh@5_p
z<n%|+DyR2;FWejp4k4$14tlZz9`2d3DR>-Pft=ou0gns8W8~g0WM0jY@c689I(;2d
zPQTn)&lEYGZ?xA8kkh{h4)1m4bjEe45;^^-@}MCb(cib|pOMqolH1JnKTbe*5^Isu
zEBkS{=RTjD4xc5z(e6U<6?pLQ^=xvw_^|w^eR4W;CO`YwVD<U%)i0-qB&So4k<-zi
zYF<5AeYa$F#v5l`U4^$58+ko9ujw#jHF7%R?`!}^R}3MiPb4-u7d^Wtr#A^tT{(UB
z5OO->NXqHVjgiwETs*zY!JFg2j_~w7lhgN(A86C?%juO)yT<M*IUT)<=F8YU-%~k#
zL{{|ch2JN#VtWQzF<JIoCo5J4(MMz>D-t7dPZ+yg4!Vn6bS-1h4UuyeS+EB^gyhAx
zRpj_VUX=VOc~SCX6j`u4AG}6Zl+VgZqhHBy`~Cxw_HD?Fit|{BOxKlb_0{1IF%!P~
z0_gQW!@q6aJ9B3nI+!lx#Ma<Nz36ZH{(tt~1wN|d%JZ+=Ex~O`yd~bY1mqzJ+mpl?
zp(I|lz;-0CAqEoXF}o6Yb|Zo9ERGYK5Ud8`jfAkra_r0u+5aN!WTF<}89OFHnVm)0
zJF{RplkqU?nf!NmkRT5UB~Gw;NEo^I`@0XR)oKaxaO~_f{>Zm)-KtZkPMtdE)TvWd
zVPjZ#b?1=#u>G|DE4#f6x#7<Z+c}q`sd`{;7>dOvzU-Za=+6yhlgSp-yi;ZK@hSN8
zO~3wq=xxQ~+$MR+x>9kbjU62B_2-aH+pg`=`j*~1Nf*qu#MTXpNy1;aiFRooc>){0
zDaf3SxlcDS_p<f7hzrqqme}f!e}VYXS8umw)$d{sS<gCe=Ei~p-N8^Hc7H=PHukPy
zrZX2{k8s<jU`D;(Wt$uPB!WHD3boA#-(>Sg+5OEg{o#R^&#qV)JsW$W*`Gf$2lyB=
z{YSLncyLzpQfwF5QWkRw$*r>Bta{Nxa~q#F=b2Bd-e;1`FSN&?=}mVosW|6+?9M2#
z(UmRv&{OlerzrO$@b&2yzqT$KmosNvM*K*{JhNe~GtaP_HILGq(PX79U-sqAPkb(z
zx$IZ0<AsRPwo6IhQnJt9Vj6a^j;D1xt>3MoY$s<8$Tzf<`KNv}*SfQUK2YB_kxy;u
z%4MFZcW_g`G!8S@EN3s3Ki8E1KyxM80E(d+t}Q;zoce(O0rF~o=%;I**v+3mPu#^k
zZZEKvrv0t)bH#gpQgJ~0_SQ2G6rOv*89#on!M4==u*RD!ewuX6tu<e~hq=Id<^qp0
zM-=Qm_}*)<N1K=<s*Y~@qKvWmS08*hs(#j-w(;l0I>C#wTg&;avCI6o<vO18IWMK~
zQ0{?D=e(4G`EOnlUJ%dW=Qwo)dg`nfXRZlP6u@sk1m8u}!Cj!N#ctne0b66p(UpPe
z?wk{Tjh}P2(w~}d%IBdur+7u<_w<U}kxR>vPfL+g<;bft=9}CjhwafC<j$b1TX7kA
z@j1ht;kzyL>S*Shoi8~y=aBhkY(2gvY>v(kW(~GegV?D{lGv#ytcK2I*n7;|)MnYK
z$>y7Dz4>NQwm0AWr{IwJCiHdYn=cdJAR7B~PK`y$Ip&-#zKml|HF(bXCG6F0p1n%j
zPMiod{OtSKtIuGsg7+`M)0uN7tS7~4m~*mstt)ZPSuxC<a~n2n5i<WoX>m6;l5fLa
zY|fcz!=8tpjtx5uyy51Y!`ZNd=AF=?oAw@oj{e;9eT>0hL5Hq+pDK97&Z&27T4<!R
zT#nBhX5Kl(p1oyY-kCeXypuMandi+rp;M>kol87>b`?4bJ~{2!wU<8cjBN{zY`1>Q
zg|D?QXWsb<@16RS%{ygNYiuRnM^Hyhj_!ZL2U8R=tvA=QpWZ(YApVXfm3`{(!|&KV
zLC(0pS~$K7_a(Uao9w<#|1J6^_EBHZG{{dO9*`g5P2_3crWc!dAC$*Nj>P-HRED%(
zn|>%{on3NfDeEYTO_qGGM2-%e;V>93upJ*+6aISDtFle_3iIAhzNV<U@ue!SQ!c*D
z&(II?Z5a)o+eg4tuoLOv*PDoMd*7ww>-kv*(RMicQ}4TyFLCVU6Ngp6Sxn|<=8GBh
z0sY*N8DZaUBu%oU*&=NY>#!N`Gtu(O+LdP9wvXF;t*FBzHax<2@s2S8)?tJErSX@}
z-x&VJ@@MZ0RR%WZ9!@LH|C$?5;KTIGs!vAxR#Iu4vVQ)2>Q!G}DxBf!KsP+TKVTG(
z@VN3cy?xBipJ5i(q6Zz^u5x`BYwvJ)9(m-El`32EwLnyP3i8ax5@PyA3(>}>hsGST
z6x)b3W$p!3{sQvn*{09W@8|Vtdbv2I%DFu4)6u7EXp8i`%hv@S|BNP&Uw$fm_!>O9
z(BsF$oO4hMKgRd1#z6scI({tp`D;0oYBc$MoP1p4VI_Wx*Tv*xxVSP~akeU_c+kpU
zB$t~J%{jdMe%^fKdwiPT_ST-!!SM6{C=Sk<eq4x29VMI&*6Ou4BT+U=#<}qwZu@e>
z<~icox&Op8=YA&c&NA+wgjU%j-8(7zD(=INm91HK)1r8Kdb<0`*h{**I>`MN#OdFa
zj^AVqeiPH6coV<x6(i!yYTel_d=z`qHQz*a7FK@WvBUTbo~vXIg$y6nIauoJHLOeI
zp$}{;(lQOdiu&m^w5k2TA?~`c+Y0-Ze6xbH-Kv1wg%4&9=dnex1+;#lytVMB_L*t^
z9U2#^kB&FJIU67Bxrw=k>r0J1p?r<(jcRga>p<L-%1+r>)Ds{7(gB>)oaJ%$F87Ql
z`E8-kK<rD3R{gO;DO#oYDm4aE@@g@*ddJ<wRN?FH^5$SE*`CsaDVss}!0Wu{lzrvL
z7pH87l+BQ`8B#Vw%4SH-ol|~>l%FBxlS%onQog>_+&Se#PWjvWxKknJZx1^$o~gBo
z)H+UT%`3G&m|9CstvjcD$f-5@R6N6bAogR4_Ohi#IlRAj(0y`2t3l^Xl@rt085bv`
z7#YPlDyB!VGKy_fOk)A@F4?VV4T@`Q8gKOw_t+33_Hm?mM!V69<`c7gSm#R;Bb%p~
z<qXps;SRGY#J?>1=WsNaJC~b?U$HmkuB!aow1%n|(~61T$<AFu3=#J=%$N{<K9BPv
zBv0})Ib(3^lxWpX(;Fa7aa2mTiOErHC3ojI=UtV3h_g(Biou=I9Rao#Dvdg4myox5
zZYgK&g}Pgb&EYQ0W}R)7!QP(zW6Y$3<GFK=^umo_?pYU$y-+&Gjq_0*DyKVLOfa%i
z?^Q3}QaqIy=<25jWc@?nuRQ{yp%tv#sq=s`K4YTooDHNhjkLY-dfol17$^5Ez<79m
ztdd{~hRO?`U?sxIyDk9^=X&~h`SDNdfRhPL)<YW~uUuk8t>E^ZQ@>-Pg3tHfe*7kL
zW<+5E+_?5$3Vx0G32?Y0Q~1q*W`2Kl&_?@@ppW7&`4&$LwO@3Yk>=v((_$*L@cUi#
z%=-Z6etP}y)79CxC3s$){`VpEz0=>h&sFVO2d^9^CUrgS@%u*YtDtXfVpFYP{mxus
zPjiV;4M7i;@!R6iB@T|-k_?XGSL5LrVpx;Hn&jf-;~_p4E*kU7FPi&2XChlZZX#Rx
z+s5D5`Fn)F|Mc-8`2A~!S?ki%=P}VzF|DRj@+rHy=|7lg6h0Nr{5+vG0Vn2FGC;iQ
ze>YbXR@}H9ZY)Wz2rrEzGj4=&6bH+fd4kzLCK;oG)h|bY7v{Wlzr8*$k2o$RCw)1P
zFfMJrNk{qX@ul4Fq_M30@poM6+|OS2wCjFL+SMO-t2Rb{5?kQM3b&&-bkB_6C;nLA
z-Pv0)m3?m^cdx~h_q{z3d&_yWPM@lr_vhrl(sa&n>eppH4h~Gxub?gm$7K6L(7leH
zY+?^>Wq@;kz5Om;Y;FJk680S~P~I;QUoBdXM6)T-OL?o^_~j>0qAOD|Bm+E~iXlPH
zq~e)VvEQjU`BdC#YX3!QuS#mK3VS9~`+8D)pi=wAQu{Ab`w;y(cxwMeYX3!Qe`{(l
zaBAOlYL9tziL<xf@ka*mEvEKgr1oE=_Fts-Uo^31k(xXI?#>VC+w@nQ{b+FpWPme9
zf}FLI#(hBC{rA4osK3US$-2Jo3(F-YB=>^FIVc%zFSBk~z*#8vbtYP}(VSYeW&2J$
zw)yBW;ztgL%zm9gqd1e?P3F{L;xu%|)&nn^hH2MER#t6ID^_gAv^O^&_0O)<T~dEK
zemZv^W)nY=Tc~>#9$>BUA>tOaPWBMzs5G&jUB;bKO)sW3RP&b+QfzYT&4nRi1+2);
zHG!ON)*)8!&QMH<8$a^ET4F+i*@I$2>|nMR6H@EMgw%fZ%RN=ZgjjJgAu6Yskkcz}
zfi6p+&tm9Q%K4ao)1<YumVa3lE%D-8@)P1)N{DZHkyw+D65kT`;#<myZ`tU@x6F0o
zTii1{h4Ys4vDN>i_!DpK(Y?Dcd0fwDoHKBUv*7$yKW0O8)*3(e$2oTy=`JQeu17IG
zOT&+>tO;1%m4U#%YG}`&6YFDVSv{43;J(U08h`2hjp1)BfA+rWKewXm)&@4#yqs3t
zuKu%2Ig8PDVmYclP#V>Fr;4-Dy>aTxLe9o{jX0ZQUYt$F#;**Cvr#$G^i10Hg?>Cp
zE$6IGgTLxB2HNBB8u1fagPxP~<j#yg9Eh`Ng(o66`0*!GoBxb6cpSQU>)3+l(?u`^
z%U{c$qga~+Snd6>HZH%M$ubL#7jGk2{@hiuE!%+?A9Lg2NzBa*;%!R7(~q}NeZr{~
z-firUxtZGhCzpV02Y0e$D1OF^FH*Zr!9cs6HYcp54~c<^qls`8JrZMX&QVW?cYdtu
zXdDuAGqw4!x9<CH$K0H;@`|3yvWq@7X<|{%to$O40Y7eF%RHTvRK{5S1Y`9!#_2%3
zfV1}P#j%LjY^{+KH&sXfYTSr6HhfVFeM;av#l~3l=g9FfF29(B_!#kw;5jijz!c3D
zb0a>!c+Ac37tH_p=7fdDi(gU<l;|n?`s2@`D=|<$UHv#H(N^P7JnY7gc<uIJZ3m9}
zs2<w+<4>>@Q>9p_HI(;ZIk8YlVCDQ~+QP(`8^I8M@i9Dy|DA~*(bxhPpDzYtcwFB1
zzbAut*|3s~&1nhoa1PH%jtIXYF*mO4>mQq=f#<~p30|1{C;ayMec;3T)X)E5p+DBM
z<Hn04Up_fPEDzt}$7Bcha$QO+&y~j7(1%H5cH9^oSKkiGbA>TDiD%`7;&@;7jIWd5
zL?6e;+DaeqLLV#Mwhn#FUxRdU1pORAA4kx~5%h5ceH=j_N6^Q0=;Q6^<6TMgaqVU5
zW0jLW{**PnD2KbGbJFvQa%|*l#>ArknVDadcs8GFo4N6v@xMRy_Sl8-@9)I#PrdcQ
zcfO9E30JL-oU_v|8P-#${~&3Z_<n$Yvxkel(mCwDylje#`_}o0;>RmJA5pO5&stx|
z`G~UjwsODwH0-^*(z(0WJ3mqK^i6E}st?4Un>f`uH}S}za}!;Ds$$+3e{NzO_I@@n
zxrFtFEx^>d*@D?foKdYaN6hZOFIHuzZCu!+Hv9H~?hPI3+(f}j(NS~l6dhCim>Sn9
z`8fDo*_3=t>6r>ErLQ#(Qg%<ueoQ<EBqbkH@-ZbJUB6jMKBnYjN<OCi6e)jC@;IiH
zd`!v5lzdFd$CP|b$w%n|-Ak8RpGmFH=zg%&I+q&@FMmo(KBnYjN<LQf=nS*e`n7w1
zVoE-y<RiLa#C<}k`E_c3otj_2bMtHM5h3uMGe(EsBce0o;`fJS5U-{EA@kEsLk;^w
z+K5lx_*C6aJKsd}*(Y+4eIm74X8-A6kbNS7=5xfTDL%I(Zofz?`$eX+U*s?`l8Oym
z<m?xj?!?y5$eK~_?h~2bta#R+dizAmh^<`X#i0F^7_wu;OCBa}QugJsz%=K~&<<yR
zh<iq77iWJ;-?kGk*5mDE(3zpr$C^pG6SjBHCB2#WvZWgz>RFm_Zm7zhA%4=YPjwt7
zrgGq(;A|(}t!_}fn_F*FLcH4%aGkpGfu4oLyB$i1cRTFFyG`wncT?FZ8yEC^-<TIv
zw;vnV&U^fRm0suUH+R2^V&p9L%ed$24eV+0^W>Ra=Wf8nnAX!?zs$*V^^p2X?L5Q&
znx;XqeN&vaR*$-^UmA5=vp3$@6CVSqcz)q|2A({<BH-*-a`wPv4aAFA5j(E)>T-?U
z9dYif&gD!&yLk+JR7t<-Ojz~+v>hB@+r5=O&VK02J*(;8Epha0eLFTJ*6<Ylt#dVN
zb-v!yVJB|9lDZ82R`sH3sH7iNXC-@PL?`yPX6LpBi(R@e2Ip{Z-=>$E_?8`iexHLs
z`IXN<v(L?Q&}pB|ek}1-NmgC=(}KNmO%HXv(6{N3vmZ%y^=)$Vy1)Nh^iAlay<Ex8
z`6G{`Q~5UNjKFxDZ1QNIgv#4}$Lw0mEUXgm@vd_Nbx*d%o~bHte@Hy;iRTT5-yZqA
z!G3%=YcRgveDAEr<Ivr2pZ`4sPWoL(U$8F#y7tq;X`ASv?>g&Hzx}y|(){}TvmllB
z8>f!Je5G{JK<%%h{q8$siFWgwbC2D#CdHqA->U6?IrXdfPW2N5UML!M_Qe+X-*W^X
z*qy*`g0|Vb!!-T0t@UWD{65av9!&)6e}l81t~%O*?ZZ%P=Sb%|z5r~${T*@i%{N2a
z=hHTxKc<jRvd5J{=E(^B=<}{<P(^!und7HR&Loaq)h9V4TKPPswtSiLg1_4tlWy#<
zXq31=RCEvzCia0F-y4Yb&XVp*V{edmm;5%<pnY`OtDu<Z-DAL;x=mqZrS>hVZp8!o
z=Su6&`=^O<mVVNm_lFsOhrgP;s*ABzWQCunU$tK)`={f>{pVSqBd^Z1KD&+cO*wN^
z`y6#9>~U{jBKsmZcQf1Bn-*KQaFOcl42FxV;N^B?gx)2KM2`n(o8II1R+PrYH}_QB
z!hWa4v~y?-pUNfD+u55yTNM|s?;X%jd)B1G^)7m=-lx2JhtM^sbH@YGx1j6!FQl>G
zDjnL6VejbJXdkrw9JDR-XuEjq0BzCrg=alouX<FU_GzAT`q?}wIv<D5J#lo_+2Nvd
zaU7jzv9Gey+gI63-YV$a(@*Ca(0MBDaqWcT4xMvIo7Q|Hm|a-1eo<0d`)&TR*Jk1G
z$C9scX#EM=cpGiKm3^Qtz26eOgMkK5);*~<>923oe~q3)_MW{f08N69{1)$szutrf
z+Mnt3*>2i?96mS^oKh&BQTYy!{{PfZ|0UGD7?_fA|J{-Ims*G5Z>6qFtK+Y!*P;!s
zjtv>klSP&l9=fG?sl~bPhuBBT{#zTnqLOpptFXhwD`)T0KG~NXJa2k+RrKKJ%&A(&
zOcP_KYN}b3!B{!Cn7)RtKVZzXdix>|XPAaBZ#7YkWsS$DN!QrcS<CTop%Ef3Ih|!k
zs_a_yvFI)PQatC-)uHuN@j*YYOFy3>J+c2!uNX@6*f!mp9EhHS@6X<q23^t}e%HPW
z)fsj6ALRD<dZqxmUNFHd)Y-%uPe-U{4tm3vxmCO?UAjd0{Uh%NdAB7_-qn(p7^5G8
z{)eFvaEk1>K4=d{Za$3+>4f*tE7{Y2yeb-l_J^T8GN_^JS~D3v`TT;7xvSI%G5TQf
zIQ;PRLB#6=&hT$I$5_g~#!QynI!?OegYfIx7M3h)*cISxbKq=$*jiO?VbfcYoh9k!
z)FJ92y*M{&HoQ4)*GvXOk?i(2+0VUNIvN;XN;gG^X_MNJ4F9tp{?IHt8~k^He<yHj
z!Ci7-D!AuSH{(hBe6x3{4P(vfZzb^2Y1%N=Ys1#KHgqzE1g8KP$7n|@^q*tZI%j1k
z%HR0?B&BIuuecT7cE|oXjs0zwKlY`Y8_xFY`Kis7za7x=C}{WYf`D1rN!zn8LC1F@
z%l@OQ<00qZv#IqSxdeTG+T|HXm;4JbU49Nm&&<=fg_mD44Xfd0pMPuNXXyy($c_)1
zXb$7wxfkz(d!|{K@hg7NSuTvD{xe)OW}AYXXEMRnTTRS~)@4Lm=3~E>vuCJeT)kt%
z+8e9!b(&M{V|UHeIBbVcRHrX@#ZRKS?qNGKZxFqoj4g5RFn7)?NQ$?+->DtEg|mH$
zI9Gvh9k?`atLQ1QGP;F}0e8)>gb(%megEXUNk`3H40NO~UWlh%#|X3&-wfE&;obuJ
z)wwqV-8=5NRnZK_ru{c*4cc$JtgrN_v3BfSYdyNNBF&uI0^BU_{n*7A&kLH>*OB-7
z|1aG882NUQ|HsN_#&wr6=emA3uz{oWIizQ>$METZd7&CQX6A$!U6&nRRDj$#S+r|r
zjg_^&9hp%I{KDASBH!K=Px!xI#J&{nxyEczUO!zj)c+lCpGqbxzxdI&KY7o#X|I(o
z*(+OgV4kG>7JNL1u`HM>Yp0n>=(QHVymY;5SEfbJ%-6UXgMPOfqyu!{iev_I>2dU9
zgX}EXRsI;#nGF7Z{)qPA(r3!=^LvM5XSjRU&&-G4UvhcO-M{MHqXBI2YDjX1{17|O
z-}iUMlS?PS$JM8~;Fayr#&B;-?$_A2YlnLq(cw+tm1`%lrJeB>h@L_BIb&{{N!n(=
zPPJQd!*6pwJX1g&jCc0JZ*k;pG8$}gXyD4&Gm^0b<IHV0^2XOk>L2|j_MxF38#>wa
zfouuoN#udimPuANw#~hF=PmmG{1?Vx6OKhM*w_OhhZki3-es&d*^tt)qQldfx|1f2
zeVD=K9_*2`o}D8744$hyHJ^Z{j-9*B6dwyr@0Q&;0e*c8-Ii$Yp4%3Pc22>+MZQ+X
zOncC`d)<A`#ldOyKL}*Em7ph&fy0aF$YWkz&fI05H+Pw5ig$4aiC@=0Q<w2<YuSpn
z<}g7k+Bw$rDxX`I<}#YQxcm0c1*X==0;c%vws7%j`b@luKekvl!kGzSa5VRKQJ=A%
z+?h`rdGEKZr*^KD--Nzl+!a2kc@Og=y?@2|?eb?$z-;hs@ssF@@a|ooldKZHr&p9i
z_cG}J32btA+`Of6vu&tN?#~6!e<4Wz!E?dS(qE?;Bl+~#r|CD*OMMog&(3+ax@5y3
z`UOqHBHGdkeGlSS^y&BiL%*;`Kh0yx;^u(L=hAOF^c$E9P7hA4&jrp&V9Ex$3%Fg_
zDagL&yP=WBlE#hB1QC5SPg>00ddKJbhvpP=(Xp-1(kF+pueqCRe-?amAg(Xnel*Qb
zVPDrWCN%GI{iiO?RqwHNH!Z5;?1humt@>1V?X%%%M_~KT65b1t@%h+Fm7Kp2z^^M@
zRIVy+&MF%E@~qV9Blk=z%~8*PVTm(O_2rt%`+x6Mnd;gZDY-{KW&3jP!WYx&%b{{l
z<4FDgIb(He{G>6r@MWIHkuUQqR+v-y@J3lp=~2l%dq(c$Mb^X5BR7zH)4F%_Et~p2
zA6xv*uZ;~qUwiK1qh^xJZyHmzjH$Q!<=?dKJi(e`UTtU2Z=ZSi3C;hfkzZ#>iNB^J
z3x62M?q-a&eBCyyW6Rz8J0GTg<dW)NsQNuw=-1!#_Tq2Or2ewF`ZbT&nC^*_iK@SI
zvg*f2@6?~&oa5B*j;+@MIrYfEmZ9?T;Ux0$;Y*f}{+PR%e7x{Q+0wT}lgh{7$UYtU
z%OoRh`uDS5|9&S+J~7vqA^BM1^=rQR6<H>_7KyHojGWrvuOFpfKM!52;^-<}Qw3em
zdw!gQfvHZv<~#j5&7*5h^HhhfgY-_zfZTj|M7i1d%db5z-+TaF=*Z6O1lf6;S+pP7
zIT7A#8WVm#WO|;Eu95F=2J$XX_`*;5L1+HiFH4_3`!MI2x$;!s9a;L-n+`~p?wD*E
zE+$VSR{gN@RP^@c=@$6x^or5@p@hp2JBPGHTd3lKwV~RvA#w}jeb@G9*D^n|PHKMU
z`M4Y#OuyT)UrJ2CSvT`-Ev>DDn2VT++)2l`>aUxgR^Z|{YANZnHWb8StGm!;J<L7Z
z;TsoDpt-^XyBlen4@W)&7e=t#knWe~jJDN+Ujj~s-){NfuyFixwqSVW8o|ehZ2_Yl
zdrWW!)5$6<fhM(aIQeT0)%fWxOS*YVq3Bz+)!eE1$d>}OGnE!UPvE;lFXdC)!mNS#
z^9#)bq}Tm#v{Sawp!~mZeDXtmiL$Xp`&RiRpriZ?T1VI)z(2zCHJ%yJu*2~ufny-t
zA{;|o%$>%nn^}3AIZ%T<Y-EmBsc*DZv~7BuHIBE(7B%LY7T*?Q>=riWhFhBOGYDtb
zx9Z~E?${Boj8mSUfv;lt#9zt$XIDVuNxw%lp7d_gIB&L@EPjTU2L8ojF?c-|;4jEu
z8h`2hjp1)Be>Q(1{xbN><S&cAar}+vZvuZN&CZ&bJ$-iG`|_{*(1JxD_uu*C{KH@5
z{No%z=ikTpe-VH1rJ>(Ay2_Z{{2?FAJq&=0eJ9(Xf4;0~M0b}N)0R8OoO%WsF1b<1
zc&@hXdhF9~n>6_TaqxLOcZ)f-mT%p%of!+`Nn<YccxKn8C&Kuwv%<Q+we{wEjn(iX
z&lCK;9?We1`cpOgc5E>Xe@FTMWP;1TVFJq^H`em68?*d5-oH1aWZ$2Y_C3<RQ~GcA
zeV6n<zt!6J-D|$Sch1|f)wxz?cNo7&Zu;go!i=x1Q=6X{XEN*Wvoq^euQ6HmciUO@
z>#VFc)&KM(;R{RWnCF%NZ!xf59Jgif8pdL-mDRlk{KrZbQvPnr+xSZ)SF3I@2X;HM
z%ax&$RpH1MM@IX!YG>{uT7@RzZ`<I~;w1A=oEq8r*eJ-vdK+DuYo&E}QBSR1UT>r0
zu=~5Kc~{;~C~x25qa~-TQ~D-)N`B{)&ivx>(9btL(LOe~A_E%ML(jEY*77a1=~ux}
z^O8vqi;kzhvY_$4TW8eldy41(ocXEcFYx^2t>JzDgXi6q*79%6{KWF93mflSc}MBK
z1w5BpfrjtR9J~A<XRcoU8Qve{FKw;0eA=wLmM@w8z5AY=Ic@nZvtPLH?uL?m>*=RM
z7euR2cNkeHnj2`ZzRvvh<|it%tnpcPsJ;Unw?jh%4Iee3`T{GnO?|#?(xJTt(EdLx
z*nQt4{N0@wSpGNDZ(aVK{5j);v%ho0Gmn@H9bTWRFW{?e1HA3Pux|+;$VI1BMQUfN
zPs(!4BK4cE*Q)RZk>82+4^*-~_;nNIy|)w}md2;eH~OG~1?=9T`Uk&Nf)67?xvI6{
zV)}FegJXyeA1qr(SN`H~timnUq9PyHN__BYlh&)t(1UZ(gMu-V4)n{qI>lWF7Ytvo
zXf530eGWdYi|Is_lb$(#5xv+rf?h-xWgFH7ItFxOv9B9#bfea%q#G+4yH$bK;@ViO
zD2iUJMlVVyHlZ8U<|goHy@*a!o}XW$P8=n@ht-F_NAxEC=66qT<fCKb`f@T4KMG^Y
z(J4Xfy=s1!Ah%91-lap1JF+mhnV6UCE^Ng-?|CiH40K5dxwoFbUj;Lo^B$?$SAa~C
z+^c-Vl~1lL&**N2pCq4JsUs7ekYzIJt0j~8yO-Zfkx3Cx7c?SwB;Tb=wot#T1C&3b
zUkBtPZ{l@8{%kV^*}WnBmxJ{HzNkU%tMl6TjMu&wc}hp3t7%_aGjplt5Aa)hQf=Gr
zv@Nq4S-N~q-9Y>1HRUb8g+FWdGxr5%f9Jl^x{`fMX}d2kD?J^U=jlMn;yQF+27l6r
zkMXx29k`n|uSW*YZOR*O&3^iZL$uwcnXCU8^Vu2Xt>dpOr*)CqSoN2+Gb^k>w`ice
zzRVrYhXjoNJy-I{`~LVcWVG(gmK|<$hOeKGXaBv~5#kENSJ_X0F`rVR58WTr!Zp;0
zub%cey2HaWsc$_A-tPSI3VrJnhx*nP|K{T)e|sc}u9D15oOk+bQ1I?#3%JBdIdiIk
zwVc7RSpK|+{&40!n!{HH!o|BMyLzb7lilKpfqBT_xU6@h&f)m--Ci%c7$3@();d-q
zKfagNbdvMc;J6iHR*5^ZoS2VqF*P~On&MQ;E|QOYH@xf5<z)w)#@F$hu@@$$KRIUC
z%ufd<7M%@DFZxz6uV`Ufe$i`bA1eAv`l6z#W5PwRnX;s1h}|fRk6n?imkjn-`f`(&
zf9=8tlcq1c@CQlLzx7s8()6?EOOmF4`ur!7rvIRKMbWFCoz+uevCc9O%jAzkCU*GI
zf~;xDw`-cG!!OhE`$=Efn;z_GLKb`p|JQ!vSsa^+yS*R8-w=D-+Q58s^&yA$(+Urg
zPyHCdwr#>LvswR8S^xXsZ#5%)dw7Izn@9NewGqB;8sXblNBFjJgl`WG`PO<i=C%F7
z=bukvGxk&{rfT@uFU4g$el+yG))*CEraqA`O?}|_d$4sx|NX4j#M73E`Az%b`S`TT
zbfrxkl!m{FwCRJ=@|?81L1~eo^5qXoYY!;xLxa-7PTHbDX^ochg$Jb>($4g*7?f7o
z8(R>dZ3A+CXuMXk7`fr-g#OBoZ+|Pi=+jL$qUe@GTtXt9+TV_W?_fIN=Ob+}of`X;
zHkeMvNgGV3$_vUjm`<&4DQz&F@|?86bc&ph-E;;y6yJ{a-q=kSqf;j~vBiAT)4$n?
z@uL2CPtdz9yBWV4o4!ABB)$8)s6%t$(<>||-cs}D1=tnBPiqsB!}^W=SNJ9D6WJnq
zcjdFj){FgdmBY!qMr_%5d8d0XzC>)9#?}w<sYb9%TA>NNQY_e7t0L~#sh9PQ!UJ!|
zsMn24edD5Ie6a1K_DGL0uKjiZJIDEr9aQ*$(<XP#{NNb#;mW{MGZW)>hug>F_pf{>
zr<ntsB}VlO@<eMglI101&4)D>4hQ~hrtT}L#m-V&+iB}Y#>GHeXE^u}lUw*uTw8zZ
zv^B@`3lH6UlGOj<^v&S7ol0VIwqo=CoIjNr?p@#V$Q%ExGJ!Vvy3B{azB4{Ow#^XJ
z3C}Ds4f%0Cn^4|>ovnF+d>)69oB8-W<g@A9RLVM<abm!b9gaQTPK<;f>#s8MakP&O
z_f}nk-(TfaM!x^|s@)jxYx3JJybBy#k(d$sNAX03&`jyu@f8toNlZbgyOQ~)<_qrF
z^T*)ee&(CA4$|bs4+=&TaU|`R=qpkg`HC*KZr$-sD_X|-rea)92gjm2$H4o6=JUaH
z=8D1Q3ycFhM|a7%I#z4j=p@!Yr*St5Ya{52*BBqi0#mxTVAq^QwscM*4u$uf*fG;s
z+X+v=UmeWpHavU4>jE)}p<uZ8a9~<ngm{ZteT%=@i+^c<U}jr12z>Zo^|l9RHg^E)
zcyJbR%Q?+I^W?`{eEXU+=4Ur6?=0KAP&3v%XYi5NVnba3=1gl=eMNAFgM(|U&1e>m
zVb(KMr^=lNPU9-`suK$WUP{xr|EdFfrUN@R#yppYttYrm0lO_0u)AyVu@z}vOxZfp
z&y6vs6w_CTpLjcMo^P4rQfScy?xKgrjn?Elp_%AH+1^HI7_!1G<(66C`l1Kur?o`U
zP-Ul4Hpsi;Yj;wY%C}O#=-F{5wt61lG~V@88PQz(+OQ+Z%l<Fg`zB*5kF+y!^6F{g
zRvr3!a#Z%xLr%M08GVd)w;~hO?sN3-OlxYr58sEqrZ2WS$E#O(3OB8ns=lhY*ggy0
zkr=O(xE>#-4US%*tm@Ibc;|I^SpDMO3l)rB_+lFI7wN<?jlnJ-i_Wv1*xmLi1AKf2
zKJI~!k>w5_%SP|TCKMlwr)4YpeC(XNfzA>iyZUUZ!^dy3rrilo>|!ncN6<7|d^}!s
zpWbbFhJrKO^5NkkcvtaCUkhZnDegBf<nobt)S<7&VQ@D5I}QGw;qa7rdy_-!S<d?|
zc(;{)YJ%1?L$l%A=}w)M%o&734LD>&U-d_)csH>Q)*a_UuM-}8>HK*3H`->uV0Qt_
zh7UEr5Km^quWBDo=wA8CMxurCg|P*H1RUXK^~6@+puPvD=p&x6d0zw`s_V(X^!l0N
z`MB@9;Kw|#4G%&uza84g@=QNJDz?szU6Bp3(V>$|w?%!i7jiSrbM3&$g=Sj+5T7{X
zg?dCI<Yl&S6(6c@^_#vcpXLLn>DT`6@S1qSk1<%on2f(i>HHUNh2Q*`XE&}c4>%|L
zc~WuMR`eXPi2e7+p-b;Vp1z4K(a9L_=OdD@(%-UW#LpUU?Nb!bsr%mCb!7Q;zT&jk
zjqzy0zRC@`>sP`bgD$%o+LDgk38B+N-PPz6;grd@d}LA=FxQcXHLFwCA(NKT$Lr~z
z+dY{?TwS5?>Z0u`-$8kQ->mfdImTXG+-Z`yT6cX#ZIC|^c#5TK-U<#%OSH$n%(yZp
zGMRO$Z0WvAa8y3=s1GCFCf$WBReZDTcC{<fjuZZ}Vfr@xDEbz9<op)`$bulUz}u6;
z99(-YzLRENkiF{btvqL4B+c1tExuBoj|peSQ%hiKn{bgnaAR3!^z)#2GhQG3l>W&l
zR!9A^4Swki&M1_8E(TUUe^aa}nKj(G_cU~UEij{g6Y-G8up7mz^0oN;D0(WEAjcNd
z2JLJ5ThIO;Y{Tbyv=W_tnn675XxG*ijc%k)7jC>AKRB*iWo7gG@fo~l59j~tMDJ@a
z&zs0l`Ico9cR<Gz=$|OM|7Xb6pVyn{arpe_^Gw4p`VLP1CA3r>UC)G__{wVdEk3sU
zkjG=%r<V}d{A8Fh@eF_82-pj2O|UI@oH@15<7xGCRT_JDu8FK%Hx0Q$KKLD3%{Ygz
zqr7Lp*C(BCgVUChr^2$j*Aj<kN4~vMda9YUdXv#sL*HehyXJ4c?da_qAL%ncvKLs(
zfR#BhvQqix=a?Jy%}*~Ujk^}v7hrWSCGXQ2W_7t0-dJLd>8|CsVtg2XtNZI<{B`%n
zR%`t2AwPP)SbJ<s`f@iMc}sOKJ6cn1HbjxB^EWR&TJux0!Pal#HwpZZugk6vKXgyd
z)XBRnd;J>Z^ImY+VY1qG>HE3ZYSx+y?|pyxiAUf6mGAE@4YSu^Om{vogx_`VAG1oh
z>_|709^D*RwIhA@s(s^Tf8@HHz>UknX@@oABL$>Yzkke)&yv4@_dCE*W$xhnKGGyJ
z^zPF^ZODK=QPS2ypX)sO6q0^GZ7U9Mn1`<KrvZK0c1mr%-KBGA)=)ZMKgOYRBjx?E
z9fqgX_wO|xy`6Ud(wew1pFR+u*3;j$7JI(_I=Equey8*M*MSY<_u3G@`vM!*@O#HN
z({MZV+y(C(#|GX59J}WmD?{enD>LBD8s=tCll~~M4$_A<zwb4Ris-wBCGhRRP;kTD
z*c=Bp2RC$5&kfXnOgv25W7PSR^qG@mR$xOZy#AZuxWXUjgrE5Jq_2Kou$qWd+yUQy
zSa87euwNehGx_$%ls~vXxZyGIHR#oYTY?)(dHyyuYjW<^z=kltSF7x+!3|~bxl=d%
zH=o~5S<+Q@$GC8@WbDC1!3}G8{`QbHX(DUpxi6XxOL$j19GHQ?hDK;oqIdAl<$Vjh
z{rBGQIsD$Y`GKRq&iU&1X~*}E<z3&s4W1Sa@3qWE(NXkUPn$HZ)F-0r32fnf!5lZ+
zfvGyQmgm<Yocua0en0Njx107oZZg|)C)1y5H}spBao^G3<~;EIzXylM!67#=rn?Hh
z-WR%d)eg}%C+)`HjJtN#E8}L~`0E+t3U^o;&^+zNeU_cM&tgo1=RMb(hlJlU@Vf^)
z=pT~sxAdF%yppGE1O4{Lz`!%$$lv40;S<Q(pSiL&yAz#Ip!H1kBe?1Pzr&lv{T1tX
z34L8kUx(7XcaJZbn>u`1MV+>_Yo~4O`dsL@72ZKszMvSF4EV6Z3U+tGAI<Qg8yjPF
z2YFu$O)KC>{jPu?ZR(zHY)7W9XP%S^KivaucfpSx@W^`TwG3XY0bUjFOp1xKvAUnZ
zwp}4u9#1+jXv;Fvvw%?nPiDebmGnskJh_JFqwwUxErAV6LvLhPz<Y<`7pE*dxt`z4
zOvu3{$nSB2L!K<)WQsopOZ>_6S@`qsh=n+I2>#^#I^YSubn2tve^B_tC--{4xA1%E
zxCf4IhbPv-6ApbSXTz6j&pdw5qU^Kq-!aOH|CqRBKTCPNZ-GvadB5lI`#$gYA^K=(
z=)R-P@LN1=n{@VvHOO9f`UiM=FJbLB_-1T1bMR&2mx#wh@qP*4wtBDX{P&7nznpP*
zDfHGnGk{ORM$XG$`g3B#784(=^u_QeHbqO}=83E3-<dPHqSS2oqlU7twj%3fOB|-Z
zUpDD&71$B$NsDHiMLK^)_Cqba;e0~})H81^+&pHL?3Sh2F|u1&ByVWOPTG@Zice6c
z4LC2ej!+|60UsA`&T{f+sSG-KK05e1mCG6^x7Rks|43QcBJ1JT!p)QW%ZyVwY>D}|
zX5DxlWv^FR+U3`&viq`3@qhPZp5|R)_*7#n&y#h&ACqzXj@W-?$X$(_m%!bZrIN?8
zReT#J1Kf2+(~xx96Q3?v{x~cH##U@c8{bW6bLOg&d(DQxq}$F{(GQA=%cpN-9}y?#
z^j#Y^p!`D6hB>z>{xvkor4I+?Q$J$wWzdhRSN-_E$R{|N@P}Y^8*@{I<Rf-p2L0#c
zqwm_tS3w`upH=!~H=Vv2(kA*!We$>GeeqtjuS93rR|V)3={4C`_{fT-%Vb}Lkmn_y
z9t$DUOFa8ZGFbhh{(c%gCc0(7Yc_G7_~Kght%)?^L7h2+&l`);VI|mJTX|+#t;O4~
z2|rPfPS|UDiYjE+qtC>z@<G)|=kZ>H&N~b)zRuf&P8+22&|lJdqOq&@#&pZx2Z!t$
zPuE>X`*zX3He`czR1LaLI?A9!YCQXE54xyki)(*<RAtd)HZsF0OMiDG6UM77>EkGy
z<>|K?PrtPtvL>ykEj6Bg!&b<4V0yag{dz|S)$m@5OsMyMcYwn(^xPiwTs?ZO20E0H
zR!MvILWef=o61PPWdozlD<_@i!;?<);jQ8KGW1&;`Yj%26Xheo{1agM<5M&fU*>sF
z)%mX5MY4Ia%nJqJk_nHjgGcr_{DBV<ekde;HFUTaTFXuskH}7s=aKcp@JPR11kWr5
z&SKyk^mxR#hw9-G*+a6?We<r*WTRU=eS1i0;*o<MkNEb`9*;+q?%P1DMLRZn2hShF
zBm0CmJR&(M9!a!;WcT<s(3~VTP%U+@19!y;{uthnjQ=q_aS$Ha4NTvbD&@Birvsjl
z&GT}C%_Et(9ay%N;n<{4!y}TNvU$3QF$|u*Ji8~QhutwYk{<ql!6qB74JYwg?ZKxd
z-&PksE%~;5zt$dnTJmj;;ru-LwZ`TVW9|92+OgMu2H%;>^liP@@EJ*-c6xrkAaqEB
z2J-zKhc2`|I}~9K$+#@BuD!pGXP#B-?6(M2vd<lVcAaG}Jc5lWoxP4REBReSxvtHB
zva%cBTr+khzPgQjunT_<JvAP;VlT=6;o8L+&5N;FmHwh+j0taCHYo=^6IyR3Ej@oX
zX|iD}u&<;yYUEqPpW2K~tTm$w?5Qebhx~f;NneH?CEIpAcGT_IaxBWq#w*^7J*=4Y
z8u08suY6ffKH0PDv88Uu9=t>O!Pn2f51jwm(@~ObVcND8d&0M0owar8a_YCIhg)i~
zU$8IweL`i-zkQ!jS;E|VF>`N6HX;8Hnlar0o}%Y6<La4eWV3WlE@!aZjUJd!-5&vm
z67<XoY=IK=OegiOGl8}W`GZJXN`1>boqP!SzZ6@fkomV@Ea4qFTDVMoC^+bvCi-DL
z<wcWBe&0^{5_HWnaBYXyCFmO2UUk?bC0ha;@JZ9ZCfj-U?10&Nr%vSbhB@eiYVY?U
zWPbUNA2?cvEm18$%AA63`3Kii|4GK;V&a<B{_^*mhn@zm!yDKeL2P01klsVUmVKaD
z45f)*)CcmpEB(9lZG3-J@=fo_d?}sqbTw@ipUwx55dEdJBlH<_G5jWhe!odMba381
zdo!``%ILdWSa;6Fuc0|!NNfJoEjzLv8$mW?2{G*R=o9tZhro9S{ke<2lRs;hXCtil
zd?($|UUsCfBiE>3=(~FQPH;{z2Gnngz28N@;TOk8Xty0yzwukP;4b=2wxIfL7yYKS
zomc3$UG$sMrcze#;^SB7qh0DR=&;xOExT<!wqG0lwTJ$4@K+l3+EykyIq0lwEJG((
zU^ky+&)7El%2)x%7a@6Yn7on`)jWMUaYb?vx;k>1zIso{<#zy|k$Ki#e+g1=8Z;Or
zm!Wr3xg0?*>pWOrE+ZR!xvVwYBe7j8qwg~hY3v<`cS880GiJH#sNXf?>U|#t^Dp)X
zi0{HJ_b}Jp#a!1+T6TULY4<WOeFd334!^=K$zA5e_ieUU{fcpY2Yvq-`x7+R)mp_e
zWb!?mGgduL9Xlq?octf(Z{PTs70TR;oPCtME9NXOyzl0W8~+kn`xnURXOYu7qf6sk
zysGgYKgJ!IOP$N$O&eWh`!csTxM4SZ?#SFeWFzZ{i*L!VXRN$hVQjap&?N)ClZoG5
zvShI_$RN9WFZ&ABR>|R~dES9MkSu)m|2%Yb?==tMi=K*2o3UQwNcbGIGS@36u7tgc
z$7#FPX75F|9MoK#^gEEB&*oe^`Phcw292xbS-ht|^!>+Jt9gaB8kN(Yn+ULu(N^_E
z`v-T;jBlsvxxlwPp67X1^3?YcWgB#%-&Tj9i{w{9ylhKCpEBt4N9mkPrTrkR2XnT`
z>I`TknUw{d#zChE%)upJe*15yuX_EO={HW8I+gW?to70bF>BoVO6XNldV}Kwb^W`c
z?j_J52bz2l85I)`@IC?A^jm0>d%sJQiOgAl3r+qWnv7o@My8B+XyW=>IC}tE--oQx
z`bc+heDh1pqx)qIJnqYyK{m+<yk7`DUB?D^e{CG^%Qp7;Uj3iQ^YRh<JkQ#g!}IIu
z_dSdw*&yO`*(Bog$2>m24?f=kpUdvKW6te`_rT-N;uqU1TLgdEKG`F|tY*b&T{5r3
z-~GH!zg`iq!{@A{Tt2Uhx8r$Ty#H?VdJ_7Kir3-u@$mZ<^SXFDp4Y|uSDV)>UHdzk
zoR>`&FXuUXZnbQ5$v*meW4&WvXJB97em=;z0?AYM`#y>chhH0HEBiJ%{0^UHHZS43
z_*B0&UPi^U=&aGo=egh^J4$lTk;BLr<^sjbCS5bRW=(KICGX4N)pc_+noF=}Paq#$
z9PRFA#^K%ImrRaclHBxc!qLdhuj@QNPi_kL3~+bkCj9d#I3M(ImXB}moUG;wWd5&;
zcFnYJy{`Tq<XT`(`T4aUzU4d%Yt6#FU$)V&wa`FzR5?%Ij*@+)`N44g9WUE1xxeY-
z{{D94(pBj1Bx5jMA1Cc^`gc%&)BnHo{!W6oWXG`mP5%z+Z~Fh8?(hHS?6^yi6OPTw
zIQUm#$6bOv8e+%!^60&6$05^_+HoVuy5D;{E}qwu$eMT=c}cwf`)<c2<Mkx;NovO>
z^7?zxjvI#8ugE{bT<vQ6t;5VQpW*M_iOC$ZO7VvB-7-(QcuXd1x)rSZE+wxQli4!=
z=I|3*x2$5_ttLrarq<-;!_peLVj7+GU3|z<=9iA2gSgB(d~}-2?IJF-lR5Eq#AWW9
z!yJ$G_uKCXA9&R92iWUN@$c<pZTV3%&YAmnvkw0#F`4%=r`^LmUwHU2ne)Av%=N@%
z-b+lT;xQGAsrXC9US6LQaAG#^O`lCHnH!&3M|`GmReYxKRla8Gi^t!OXV{()x1gBJ
znz)$E9cqJo)x>13$M@~f`6|U^zFTW7KCd!g_hK`N<)e-AfmC6K<^Hwnzpg?a_<r~*
z=3;(q=6YfWmO<AVc<4pqE=60#>xA%o$j7O;%zJ>di+)sG<~_v2(SJ@{rhK`I%akuy
ze)#K&BRt4FN^zO@QlB6DrMS%3gIR@p@#nsRKUc66m#G*=#bwH$d)O~8e=gtdqrCjN
z_kyd|cjeD5<@po*w=w*=VSa1fc^7NDW$?LEH$I5@{C3KcuCnVD7l5B**C979^CyR_
zNx#7l9aCHY>59vAVB!mIWIm<1Oh2AfahZRCZ#X7DF~4`<8-4}fFzs;KP|Fw*{fHB8
z5e-GVrHsdBeycx3Q$H^AC#($%j_OccreDVzaPaG}`29t%zTLF%kKxxCV@`3Izkz<g
zVa@m_tQr3WID8QtVjAPjyLJ$lDPQ?3#9;m%ahZFF%Y0=<R^fVLG53<T!?Nz&VcCTa
zo_Cl7!fz?~Ed$rfjmx~8^|C9H^XRvfA3WH6DSq%2y+hrH7;o;q4MX={jO-V=^mT{P
z#Gw8z^BjKU5n}A!y}5<*(|j!uwe!rz5ce?VX1RWJTi^MX!E-5lc$LRk;XZxO;LZZ}
zl=jKro`|=NE$74L*;~c_=t^P?Op?7ems<8}z=+@Lb2aKW;c&6&U?y_*o1V9L@7eCV
z&P|BFFR6<dbmzXLM@ttGb6J$fnS=T4TdW-BuB4n#E`A5^N_y|&wte|yD?=7B63_0v
zKR1UnuCVViCYb}GvCotG&bO8@G}L!f8u_@(lY`r(xNn{9ru*c?L;ji1ThX7|TbMgB
z?k+0Md(J`+H^rUxycS(L72BqjGo4lba3K7A{GC+$owJ_ZJE{CVi#6+RI*@qAkIL%r
z<?D8=EC=`P_da|7o~#J%blaABr+LW5e_)@QNz?sc?iq<1lYZNyl&j2O-z04>Rr@)A
zKs;ob$jv^F3s(GC*BI9L)mSfMY==0{0DQ8!uZ;bgY0-1@wO`Y_vyJ;pbY6`1Y-(Sm
zXlPOY9HaZUIP;MBAg4X)#ybO8cNe&405`I3=I_nZeoo~}+{0P9*fi`8Xb*6<^PTfT
z8g`Evc;C;SNdLTH)*qWI*J@9wyB}2e^zTij54G>lKLcB5nV*}_Ud>=YcM)XA=e6j^
zWcfs=_IU&FDfc*kN$*p+7(MgNkULE{J7u6hMaPTDNYQJ^9tH27u|az}w++6tP<7j5
z%mVeB>M6kQ!QO}kqNDbD>&_#=)?R*pucWiz_D0iiVu{;+e~)oue;v%=JU)-s+~3h6
zI8Iq_pFI6t_?5Uly6ji|a0DHjho7Fi3X3z<7wKPLc`#tFuO$5-d#HBvwBc{%!Coy6
zkVk7L@#mX&IC|Q>W2=X~q1r1McgNO~8WZK74ij%nM=8xlXGurd(pBQ|B`%M%5W&5V
zaeL%FKKJh_7>>^y?V)_mKJ<(7`48an!vXfu2h<N!n`7*W7VX?~U|imJ`UCzuL4U^I
zQz-gA=+JbUGe(Y$H_uf;5B9pZR82N5KVZDPBe18MmXXGv&pY{X=g=!&CVr2&#$m6<
z;SzU$_-MzM`VPCnIXA?YSL##AEA?jxne|SMG1ib;%0r6j39V~~&bgMg!FkRxPRx)A
zxN+FxQOOL04A(R4J(pOYSy)E-Dr0AG9`%M+4@QLNTI`^zbYK&kcQ@xTRl)cAt+q6=
z7aUuw!FgwI`r%mYrhYi!pm+koE9F^ZCf{#oqBAD2ubOy6=;hcSo#TM#{jM<P{-*Jf
zm38Qd{7G?n;HS0bGYhN1BSaj^TJy<;)!?Dub$OAM<tCI-GAV6CCHTI4>mw^Oh(9X?
zKbUX9eDKR4AA7tOy$pWr4{&HxGRZh`a24S7vK?93MxEmsZ+dU$UHUD9cfoB0?n%<R
zNz-?&mFihY+I-U1S=(nSUpr?MWS|p8TmNiE+UAUD|IGb5=m}r2NBnBs@9W*C?A4)j
zee!er@AbtGZ;I;Z<9-~VgU(Ly`SfMvSAIHiZk(yGuKBT*1=s!Y%9kJAdp|Po@!T2M
zE+Mm#_O!_Faw)KyyB@tLtRo}fbutdG>c@7h-0tA^7xy>c^Q?>8HQ@GPb08kKa(H~W
zb{0~X-%k3}nHLnmhid0ioiQ=VX=ktB&d><3GU8y>Wjy*1f)`!>>>KcTarI-byisu7
zZ{ENz>MgrOn!Q}+(!X#7`i~Z`>cSlkUUkp9c$Fu?>j*R+j$Z5H=@0GI#v|hz@26cY
ze!E6nJ_;{fN%=aj{%F?a)!)^;!>PaSGRxD)PWkBg%d7tg{i^mCTqgbK%awIr-N|G|
zW4m)7xMTNWhdjO*`%mY07<4s%PP%@-_4e=T&heo#sqDjseaz<Ze8yS<<07NC=82`c
zJCl33>fp6G*7ltx)6J;>y4c4#<C@Z=xmNg%!+a-J`0-!Tu25RIH(*(9?3r%<Thf<s
zU+d2~%R=p&7$?_M&gbnm@)aHmbH)|(Rq83siu^<2gw{9Efj4J_INPbz^dRe6e(&*{
zot%E1!_e;+3G~z5e7;_Yr=L%|LTG0lYW=w2VK>}ddMNVod}vp3%_wO1zT~*&BTJL@
z?FUGY@7v*Un@>Imzx41v;g^q0FPp=>I^FD3zgE0|6u9Lj$ITuFw=oI0jT?z>9$tba
zoE&<A-|s!Iy$dvR$FpmP4AMQf4z_6q>8^~(KfH{686DsHhID<Xz(jo=KUx^kkPD-0
z+~vcl1CM6x#4Ew03mDr4BkKzBz`hP$L0gX4$WLfmeg!nGR$IWMfVQYllIgX`-;GYM
zt$P>sn!RAKtvy<sHhRO3l}iiorQPrs_rJVvc$;>#_TG^u*WN3?-L?0kH@xyj`3-~Z
z&~jvuuM;(Iik}BGBh!8RI0{}F>fig^c>p?cqwGF^+>91Zf&JLZ?SgZ|KF4NHgfnRT
zCEyc3h8=tuy9E;l+h3s(+Os{bJ>^l)e%*&Zc9P?d?YChs6-M3le=!6`-3WNR9EV3?
z(_<^EAA4-&$-Q2GCz)TBk1+2@His!^3=KDjIWhuXC*$zyx?{)6lhr#`MsI)i{_U^3
zeU+PJel==d>~iNsN1om5%!#6Ryz)l$_SXl^iAD>n&g1Lqy~D#AEgzMOui>L3muZJH
z#+>rympPB{`MCTt=MfrD!vAv1`}HS|qfyh(A4iu-KYtw7U1s?L#*f<Hb(!?9_U3`1
z%cOr7V?_1WU1s?s{yg|H%QF^MR(owvrY~FDMyD@Vzl-|v@Ul_N1K-Q@n0LYMz35zl
zdtZ~yo12jF$>vsnPWou(R(r_j&;2xSmQCQynJ1YRXU@#}<$DD;*%^trUCw+#wtgXV
zNZF-{^MygSLc*LQ-rne+LqjL6k?UQ!;rnoWs8<2byY53-H(vJpW%y8jM}B}Z?4nEd
z1El26rTHk{1zC7GW14j_#|MyXOb@bs62|npI2&1W-lbPK_m*r~>dko*Wy@&sC=edN
z2wlP4dn6e*T0DH3My~)5!I0d(5*VV#$t(1$$QO|TO`}O<{%GmZrM3X0`U+qi5uXC1
z>k51`b<ks-$EU;jRm=;cvlGA7_wKD1RHY5}tJE<Thx1)5jT@&0O?8fqo*Q!J`5Vjp
zHMmih4>i{*rfH+fC$q6D-x?k5+`GmGuY>%q)_-dgXje<yeVZiTlW{&RMLW*m)0x}7
z`S6bBH%+0|H%daLC7-l%=y!xQWZ5@9j6x5F@-8J-Wf|Yffx+1gz4pzfLFH6F8U4be
zq~G7O&mlhc$j8^ex5i&1ijNob)3g?3VzC9BU-tNyxI5nBIme0pn$qli<9%SAOle^!
zt|h*FXR7`b{o`WaQvBz}u>3B^-*ERuDL%7_I7<J1ZQb|f$8<&l+<T&XeB$CPJBU3x
zz2Y|37;cH4QC!zcmUGXQ8`m`;6Bz$V<0gmObKulVJ;KMwMR+8M@p>{DURxZzF75tW
zPgW84noiv7c<wTpz?~Blxi4c9vD%ZlJ7-F?Z(ES~SG(D{1B$pw$!*<<B6+R*0^bT+
zg~C~LQ{8W4bC*Y~COxWH+}KgGF%5axxyrOO5nt8uJ*&9=`&Ps8XRL-3FPVld*cP!H
zxfkpk*1ij*cRphk$M#solB);bHc{Pu87VL?M7igrcJ73RZv{>LpKxF1pRP@B__MX+
z8@jkNC1hsTcX1b1b*`EG7I=2eGc8&}RjlW3>J+SsX9B14sSEp#yD)N^=R8+CQ|T9o
z+uIeK+Fkhp&f^cZ5`WfHWOFuGH8HpO8>@QCY*W<!4EI=k(~n1-#yuC)IrDEy^Dl^f
zyD-i4#y;rYc|OxjYpW<pKXnIZybLZgoiZ~9l~LU@&Gfd4n0+dXeN%&Q-IjK$3|z|-
zaP6EIZprPiHmu=Xx~?~^=gVSCzFGaLr{1tPhrS&OV$a;k^WUd8WURTh*xs+ZEzJGI
z#qG4M*5boGvBB-?DO%Y4=iz7*@tEDtJul{dyRY<UHSrI&*1aveK8h_JI+eTVhtAnE
zIn9<w%PMG7$DJi5*3|As_IDKmzj;hg(NgI4pGhwuK0IUNx}FT~gN#zPcJ1=wx_>C`
z-Tvb8;`)Cn?aiVd?y0`Nmb%LMEj$aX`kkCDw5O7Ijlr~=0qtfDp`C4JwB`P_IrS^z
z=;CRo-xfA+9rdbj)Tb7Bby__|!rR`srYAq}p`wx}-55gUS6}!rw1#zoJApQ-JZC#@
z^xCdGJ89bm?i+i6v?^j*6_-q$ccJ}$^u1N`n$3NR%3~igcUFj}=+|=UkB;prn&a_Q
z0reM*{m{Z{$}eR-g*%`eII}iq%o4184^~w$FLNh%$oQ}t+4m+`T@wdjy%i+(1$fc4
z0eC)6f;R}(gaKG#Xe?ND<A=g34~zm9_Xi0t)vtE$rVqM47;ZUFOmBge`;jijLuiJ%
zv*iDn4Nb@-%}v*1*VP&`ab0!wB0H2(Z>(JIF&G%1`rSdl-46Y8pG)6BjPdH+oAR7k
z)5Lspi1{QYDZ7)gn`_PNuH>wH3%gSJ)K5yc;X!@tga_tu&)O4SKl<`Oc`f2oKa?OR
zoVviHFiH9x^1m-h`fkRF&fFV<Cw@Qf{2h|M8#p=(EHVF@44tPnG+i=Me3_WPR6a`D
zE1vubK6v%V)3mcQllJGZFCbXaqw~7vIC^0f@_Z$7{Z8cjCz10j&|k}=$bCn5367aN
zapJ`M8~C61Z?^Zm%}+>pew6p{#09Y>Y3PnjU}gb(9CeJRt_kRliQKyuXwX?~l2>-0
zE3ewW5s0p4FU3sc))~%%(|v2YgQ=JEMQhQ26@Ox#k{<cR$4raP@6jD;!tWO!3%9(E
zo{1Q<U+=^oH^2U-X*i8e;?8R4?!NZBOjP`x&m5u)emu#UVDsUP>zGdztl@qT<V_9o
zW{<UFC(l#eod1@UQ#<p?sZZ|wTrjh(#G2C0d7z8daMn)e_ZCNACq~^S#!PgqWY6vA
zIOq8sb)7}u%m(fl_ATW@_jcraM{stbJ<gQ{!u10C0Cb;VD`$50Ft*=9hn)eZv)rGB
zA3ghXW6i6_i1pvkeva4pc96Vb#`$4na&9{E3BHwljv}`tFY|Mr+G$lkxab$mpZq%G
z>+7JtT6AEpHD~=C&K+~g5*MH0$=fpIZLT$|y91h*K_AusB=zb(w!`3|^YrxlfAgHq
zobM##s4g(G{w(s4`PV7tzRtKRvrO;Z?0-<(@_2Ru<0S3srd>KOZz*)v{^ts4nMYsT
z1D$q--1gkg?>p#=$G~Y9ZF<FebmuP77J7rrtMo~+?n70b&N!ydu2~-a!JB&&8$NeB
zw%<?dLU(N;J)g7oZDdbAaRsO0f8ll#d<?t~-o?4pZ@~36Xic1;a~GxP>z2FLDc4Rv
zhS_5v-Vz`B<L3}CBv((b_#}M20{&hOpWgw$-_96X7KQ(vF{Jwd1;e}@+pjhV&Tl^U
zgL{8{qjhih{J_0k^MdzkZ_$M>rc-_laK-}9W}Jk$lh<m9Ey;ZK4;dG-wQ8Zg?5vCg
z8>=Ze%d@XCqO!Lf8|$0a#?EJ4`%1P}#|MMOjYk8o9-kL%IKkc@$Hw}+>HPs|?PJsS
zb<PVG$L0qe8!Lhyirvj#rxN4LS=~J_!G?|#*k{3D!&YRE+Mzuf@q1cyw_fY_*}L*E
zHX3`c9(vBa(0OC9VLP^29k$u@(DZuQYxUS@KO(JVF?V$BNsp>cow<xDp3U4Dd6qK7
zZ}!P{v%UQ)-FwoaYIoNs-1Q*sc~JiLOw*UgZ^39EYx=_cR=)OGrmsKGw1GU_QR9}I
zGLRQp;FKT7vwec;gC89jH}G7+pUxxvHe*1twgbCkF27y-V^;Ie8TZ(Hjx6frTLyeo
zKz}a{;_C?6^##x>wAmD#`<U+K)IFZlyBnK0W5BZ&UgU1gIl%MBEWEie%J{AhGM+U?
z**~xwn?d#Ko|w0e-5PCw$!hpHc5z3X&3X1?rdK${zGzzfJxbHCJ!AhS{nYL7xL`)d
z4!|s(;ljKbn9;f6XaTXZA0t*)vY^!A?MrK`qtoK>a_(OJV7S+}iG`ndW}2DR7JJ)1
z#T``+P6g8kaO$|$#pw_@70k$;To^Kwx|mBfBZurW4<FTivH8{c7mh*0$bX5W;cejq
zgJ_72`A?J0tKVU~U5&PF1D{K=R~wOU=V*I;Kb^>RX`#N+9KolDO&`f-&4T9Yqa$+%
z=&|KPE<L7NCR_ZXGU6A>9gBH@&olpvG<`Qy%tEF4-|2%w^o?VOn%V5H@puj%E_7_v
zn<(SisL-onHujtNlYK<}{P`BJ{kjBC`737*g;lONAmIJyn$Rresl`_PC&suBGmrlE
z>rV!=b=oLleq;b<1UiodGcRY9Fp)z(o?E84dhje`>#1S*F!o;prwZUh^_S)v<!J+b
zwuXBgG*;(Q_DDMEo82*N{w20rJlz?z3*-6v95!0?DvZDDsPAgP`GX{I!v7pw{W5r}
zf5lrq|M<L<`xN`XXt(Iml|4X<(p;Ao-y4pO52p>HV|8Gl>>=zb(GmY@c9&$KN5>8?
zJvRwVN8U0nzH^mmTAqX!mm?c>Hp&IYynN(cUktaL!zN%ZUD%1NuAOD>%+;KTGh+NX
zQJv;Q8>=2FU`~|BoJe%NfKFkprC%p(DRt?C-34sZt33akv09KhkY~;`H_vCUQak==
z7@Er`VSC>a`CENb?&-j;PlQ`a@Kx;oAFi*W^KH-e_vKl<&tk(+pG7tDD}YUx@7dFp
ze=~Mr6YY*RhoiEE<*Tr<XQeX=<gcJ^$6s+M_dwozj3+(~y>@*+eM2RBcvlf~T5tR~
z{d~hfA8z@#ZXf<f`Z<|S^ySbI+5f)1fLzqr(fsgg$OPH%$?E<CWZ=uJ-zEE&46j4j
zAy*SG?W0VrTYc{6GHfo<@|j`qQy$^?ZN7J6n<;OuHLY8B4`@wNcwW@rqg)p@*L-Zg
zLdq{=9F~Vd_3k;;)4CUeLnk^r{FmH00iRBVcMF*t%D<(3q3!qtm!cE6yKvG;cy<qV
zj^+r>9|%X6Vvl{^*}F8WyOs0BekohVmjm%*{QWLXKcl|(zL#eW@Pd`^eqS5+y>8sV
z_l`pM`#o{rkBlGqe&~AlJ9d6Q{LsXK@4G!4B@*|&eA2-8EjPO5x5s_2n>_G+%|iD(
zo5=d%ADJ@ny|mc<{$ITB)zjQ>PJcneHD&JiztZ=sphtgnmEio3s|4pCuM!;Q_g95J
zuU{oNZ(SugHgfT5^n1=#f;0Cj!MWdqBR;><x!J?ON|ckDPbHJlyXUy$>1yeYKKgmI
zbszHPe^;w+d}5=nyJObXZTC+up>E5Yi(jpFAGn0N=S;o2?cRMUbu-txn)X25rPMv~
z>ejvCQtIYh$E(?H+4rLzV{<s?@oLsxI!xW|v%-CO*jG#5N^T#vPjkP2Y`E`J-0wFI
z_kDu<ef}`t3#t2k!+e|1w`+#^b{*fQ4)g7LzD*eB+YNlPhxwLF&Te6i^lJ8l)}Thq
z1G}%X9j<ltWOcWXb^GYW^TY5!ru+Rze3x%K8vMMoHYMLWe(#3UE6VYOm*Ert1itax
z@R8r@#8-69TY~R=F+TLtdw=t>m+#RzDDo}3e*x>CjsDB9CVRi!cmMx06H@0Uy!-iv
zdlq{6Kf?2)*1zI)u9hL|T-Uh%#9v&+buO(3_-kEStFksecmTaVu+|k<r`Ec51+8~(
zor`l{Q|nx#U+0Q#(;D!&=!GwgXADnZEKg)zYf`jtNwDEFtZ6yt4gSo0QD=(vvW8+K
z19Dme4O3aac`aZXSS)+|98bkN#W<I&eVetfJu`CiAIXpXP1d3~4@~P=$ML82vM#Lg
zuXH_iCSK#yfmb`c_n~E`IcqlY`IT35ew8mKW<zVRCAsF*7Ut=~@5{$SLvR}k7hG;k
zg3H#lE63$V7Z=u}9^VgLw4Ob*{+#B{`9tfkWX;W|MH9aIQI~shpj_uXoozU!d5uGJ
z_iVPRxhsml%$i=6&M|$x)LG-{WSv&|+PAfSyp*^JonhF-dZ5ZTat5R5TeX#PTfK7U
zhnBO5lSo?bIOUFe<;E-?QlCW}NYZkPKUw_1;)yPvlihN{Pq;?FsTTaifBw0N7CPwk
ziaX)iPr|z^;Nj)yo;x^O&t2D58~Qf=2%Ti1n*!tsk~a<hPG{ZLG{k}#uPQc9Jl;9h
zIOjtec>OK$IdK@`^Z$C(diDI9))1ajoP!hp77XlbpAfk@h7U>o)kuCnK2ALU)-t!B
zEBU587l?TfUcK;sJ8(OeaAqEBa`Ef68=dp=W;i@<!{fvhoGQPD`;aoH*E{2da)L3m
zK6kuaX<eb2Ze1PJ<BzpX-dL+)tR3QBNYO}RZ8-W2#SL04xjM8c$nj{Q@%j$aqHEF!
zv|y}@7XBCyFy<E%I~vae_!e9C!xQQ+zhBNwb9q4LQ#w5G%wQhSTK<<E9&qK{u`#UK
zGau=st&$Oe(A0Xr-M*Z7C+jxMN1VEmGx2qI!n>oAHN<l`vSuuC5Am{w@*~QcxN?JJ
zO?<gzvL?P<ysU{YmqgZdsvI~<&U6x=BAF8(kJTZYH<*FVJ8+ig`7bO+zLX+&{<dkb
zjqBUG15fvi+5q{3$fGpmQ9AO-JF9k^dk(6zzXcihS!1<*G`9GgI`h;&3spKclQ@xC
zCR|*F@3|((dJ6t$#fs`a;iW;ly9?j=z0ZfE4`P#*u-;OAP3h4BVs*|2cI-SB$m!1K
z`;m-LeTkLR{Sxi@X?D*KOIDau$o|#&HKj*c$7`_hcQ3Rae!eqkiVp^|yDio|IFB*=
zLE@RN;W;}HdE!Fsmv7VsZQ`ynx?h^i9dp6R6J4<rZz$dh`)jq`TXVDme9E@f?hK`e
zpXZF@Q%&f?**Degtc^W<v}}^uA35iqMXa+!H=&z!wy4HQZ7}@&gY-d&HdPTv%sHV>
zTe7S_*(rSTm>cC!Ar4}LIThr0ot4v8vc;TwhPK&#i;wPGOdKoz{$;=3{6sZAwAZ=Q
zuGR|GM+2ey9i{NxBQ^W>Z7~gh$NdA5M@shX;P)D0iYmB^m$-)2A==o<y={v1(z6SD
zqwv=7ff6gbJL6V!U^jVL%hGzj&b=%W-9$5REnYyGuZ}UjAL04=vEk>d)JAMlwM*l=
zirCQe+e{SN_Bw5WR%(mdj=%2-oe!K%e*aA2*8<t~#G1AIihk+d6OQhnU%G<yKl<ce
z>Q^5ZuvYO6?aPKI77&kH4o@5;U3+y(vB$RttnO;)RIQjY_(5lSX*}xev|ph2<M)7f
z3by)!SS;ZjuWz+Bq;mfG!#x$Z!pFD3&)%7~#4KqHR6B8R;WxH&rgR7Qv7ZUl?ez7C
zXjTi&YQLJhO7uc*Wj_GD4t{mP0o7f5VeG;VF9u8X`+x4)w_~Db(4nVS*u=J54WDv!
z_sDwy8ac-~GS@i=uQ2d+HzvwPPTLl;>)f`L9kfShJ`+n-9DBw&XZOi=oo`DyKOb`z
z<Xm>M`b_w=BPaZC{b|rEJ}rX$?z}r(T*kShP8ne68NVOFf}T2Wwr|sIv<v&dJ7>0W
zn|W1uDL;SCxqZ~ru$y!*?McO2C+2BVInw<+ddBaak`2!p@BMgcY$;Er;;TKHC@li+
zRcqsMpVI8_uOh#9)^?oiTH^M_rS5~s8#B0XzCw(k@Tr1FGQdZB%EU|lo(jg?{jqJP
z_z?UQn{P#xw;f$djP*cY&GY&Sd(Qnn&^Fn4P8#;4-(ICf)K}Z$+6xTji|?yaWQ))D
zeVcA2{?_Gn^11y(nYjMw?>DDU2Kv(BXIBrTN6)Z-;`EBK%(X_x%fy%t;pIU*?6*%g
zW;{)T3H+PDs}4=blh|gLKR*F~-U_bpr`P88y9c$^X}{A>(gnkTH;O#UH-ta!fxhwi
zQ!-}||Gi{6XT6`jD;-;Yj1z+?S#YWR*P1}jc>WVz#e0ryfS%$#@txB)Vu%}qBk)`T
ze>r954W+NkQ@3FQxIQy~KN9&}p4v8u&iy>qIW+yrQ2UBv+br(QOk3PrsI_bGEyFIT
zWe-%=&n7tf^CWU^2m0aB>UE0_5)aght|O*)QZ72Y3Y{idOrApSj+!*iD-$LE{PKGi
zt^fDdoi$tB7#L#RAK$^)e3TfN$Ew#a+7}vM-$)G1Qr5@?s|&dEsiTHEA_;Zqdjwl{
z8FkDrU%#lPf%B=cJ!<w_8x&78S{RksBxS(JFRxmZ3ycn6RHE;se?|)<Oni4g9;%<1
zy3v-^9udF(F7AZ3p%1ptx_08yF9iq1-1Xx?J9ZOCK3W{Y=#OML=)P!nF0Z;2Jlg3e
zA6723Si^h7qi6qF;a}<hH`o8Q#Q(t)zBMEA;cpZ8aO1iI7v)2*jKhbYz2|_>hgHO4
zjfxMcV>mtx`+WG>^#{a<jUFFvN#w&3VC4CH_}Quh;=|p;@!<$CjL(O{1KMv%<iiol
z=J|X`{SFUqoOypz9vlG%wvNk#9v!wM^56(%Ws5s}6IcJR{5Jxee*P03hvUBo`v1-K
ze=YWZ@D%^0_KFVC8Bby}p)W1$4CZ#oZrQ#e=8>|ow2!xnc=j@jy&{&~-N?8%eCyj(
ziXY9<S={~M{+2xP%QH`mwtIKFV4D^S7W0zm;l9`ci{Ep!&mJ8r{YkexsdB{4%l>k7
zo6?kD<z(;scUzqQLOS!}!FOA@erWC-VP5RR)STGg>svY5yx`cjz|<T|uoLh8_!e`*
z-Rup~JnOh;k5w`c>CAQa(0uDQzRw)~`wy;lzX`Vd){(WMvpZk?;pA}dw_cQu<@(?B
zUG;Q$?@hOrawj482nK6s)_#@!9-k{Mwu5HD59bQzK$*x~?H6$0oBmyCag*|VAR*7z
zfjoz?lgo%}ZVj~Fd{}lee)rB<ruReW@!GkRr+xA#)PBHfsGDmQr;%Q+_Z!$BRLK1L
z{g13<e~s=X+UV4GA$C*k*0^&2iE>-x%6*h_3kR1I4mNYPKl_&@(UQ-bQ-|T7f=#)r
zWTO}>{CpSoy5`d*OU!eNSx^1wgz)oWe2JoC8FS&@ZGmVf^R2n0`ECC$^ohJ-HGF4z
zX>kW|o>^L2tXO!J`7U&c1Og4;`8404@iQw2zR8BK(%f}c*tPS$evY5Rx;9rCHrFTM
zv)h=zdbZb+OS|Jkxb$uMt7tE_VNXQ>ctLE@G{>)eHke*`CYV+zdsO?Yi8oSQf3Y+F
z#x|2J>Fnv6WKQ*<t7Ug-pIH_AP_=)oRep>a=B7WLXcjo-o*jst&0s$NV9qypmUEY6
z1RdBJ$f&OX&Tiyz7voVhEbgmVG}oHe#+~zR!n2oo_6F)Wd@b;a$IB<4<nXoOC+HXF
zj*{)zar3LI7A*~B)`zj<s>6|$P1l<HLy^Y&>+n4o{H@xD)tb!{{PMU1vr&Bt4s*~|
zUE|?HaOkFu_@9cq$D3m5(yqzQez;R7$B;h86rY@Iirdk3ol|+w2p4x|nBuOfrg$l^
zs^LrdE2wv}>Z0D_?Z9cr|EfAQ7b)ZW9`cHZ*Col@h#$(q4?OJ&<|aE5S^3xqunqK6
z{xEy)YR8$I1b?dsKN&8Db}PT0c9yxRiu@Qo*}|nen8BXKP;>RTBRdQBWqg}`%=@<o
z%nM!gPa*wrJ$GsTitpXQan0kbac%NR{Wie8ve0ncc+>Eco5G8JeCW}g2l1c%v1N*X
z#rNIptt%nkbsg^=;Mm`P(0s)Hquoybg}wg6MsWI%@hAM}@O)^DDXIqdI&e=$%Stb=
z=x&E2EC0}=<5Kb`_L2O<4qbSb1<g&h<dF;-4t4~XPJZo~w9HNK^YSKx-6-5ebNGg_
zeUn`oSviCJWjt;8vljl;9f)V|TEci<%y^XU`Wwd=n;(v>oTR*Yk(I?fRdyE7D&8}B
z{xkAXb4%Tkp#5S&Z=bx{TRYi2bP~N(OJ4o%xe!}W4S!eRLyMnZ+4$PJ*h3P+-mac%
z7Igvddes$i%Po3qtW$>t>|}T{KC|=5D?CLv$pZ0}>ikTvTQ(lQVPRCdWe%K+xiSNN
zAUQJ!S>gKZhSErNYmQrm|E;7tf6=q@yIqsNAZ(`2y&eMnUhCxX7tzU!6Lj+ZqtMA;
z`5o(I)%RY}$<W8q$^XIA$!klCHD;t=z6+j?PQK66$?FEb{qA)#>%HjYr0cy)#=fdM
z(xj8~hqEQGxwtL)1MJAd$bu&SJ~Z~liVp65Xs+MZxepC{`@{*?PCU+DHRX|g`k=G6
z=h}Jw_n}P*w`lC!oWa7_Z}|bX=sQ{m_oIzu(>7t#N^ZokCw;%EaBo+8=4rjs^siZ~
zt?0oQ{Pmj{>y=@2a3^_X7Y9Pq>O1)De@|u)ALh=#CdVEgT&F`v$|lw+TF2AT+1E_G
zsOpp*9bg}`>J-f#+m<^7n;cvE^5M5@4OZ~6!Q<hppK9an@Uht8*tClz)8p;%j|^jn
zr$_z){oGQJ&K(HMksN%_C)nao3}cHYloc+A-x|B{PqD{yr?~cbNcQ*=+2gDoEiuK~
zljGbU%KF?|^sCJ}Rmk)_p|!gJ?=x9D3wvvGWvs>ZY_p=Bj47Km*_Q!tJ!_Di4*XHu
z=}SC2opluTkN8YajY&VYqXQc_wq)$kwN^*JyKAlO)al=+NqJ{pss2$+h2V|!_fFaF
z?cm)x-Q4sLw);BH=~>U(WfgrQU97!t4`RQESgVum9G3mAwb(@a{l^st672VuFVbhe
z{nv>-KBD~>_Uu2;es}D4Z0d+-zl)ExSEqor(ZUa#S1UejPOYKe^GnUET0h06X~3p$
z;d$yL`xUY2TTYHQE$3)UDSqPHDO-)~-_Bp6Etu!o;J&@SkG$pNTbCqnyO*~TyvjU#
zolYDUw&*2WQ1<#^&tCt!2R|7uVb5OIv&^&CA0q$KzQx}Z{@vK)UD)mG#=X3A>Aujn
zw_~$MWwX;K!goIXaKnd9!>`HrE6yVsZ;fx`uKMO<&}(^UdE0OQCVb%ajPdoaA9`%(
zU$P$jYkgx3`F49fX(_w?y=%9Jm;*U>JNG5aZodKEc(?8Lb&N6D<dPR!yC0S9zA^v6
zKH2Uw-uI!8d$zk1_m;AQ2H6NnZLN#hLChoGF*_*99ONCfgEXJ`eX@gu@9%>h6hAkT
z9W>gx(R;!U8o1Zn#)fj&23)_OeCnk2+N{YJvQ8j>Au$;X3s@_Vtyqb#SFt0qvouEH
z*XT)e?6D@+%Jp4kn^+gmdwcZj1AdvGA=~2P1V)4B_7U*B6nxt+VLijg_jm%n{@O$$
zjpExhnmoU6?f!kkcQk$QyUdfK-w>I?TI7JddZ+sWIWemGMw@R4?v?I5^`deiE?-jF
z<$ljL5#yc-+3KAQ**e~Rk4$i%?cOsy(S2|9o?)+C#48u^%7wlBjo#CE`77P$|I6)>
zEH7Z4Ts-z((|^O^_FmF?DIA$MTm{=<I6A%;?6Bc*doS_fJFO#z$iO7FaAF=iQmU8;
zN51gvZQ{J4D*VKqdcGJg&gYD^s<p0<w34-kWHP^!SPZ4BT-DoS7giF};k>K7-tnb7
z@4)Ho8(X9^ixTlj1~)NJ3fB}}N5d!oy7IX9`KZlWM>zili`av~F+j2zKFuDkX~fdS
z@8S9>=jnxr%_*5s*NuI#`k#nFui9!F9%KzZ7O=ZpiH-1M!e(QCRuOM7o%}PoGoU0m
zvpdB4g1&3rLu-mZ7(cUKcvO?`7<;1{iIb=e<h0q=^fr4Ad!#zdskMr^!G~Q5yn(WA
z>{{pe8TJ2;^w^8R;!ffqYB(3TCd2ej&FcAKh_!%|zuEkJi8Z6UV9TFz26aZaZ7w`f
z^x@i_oo{bGYG<1Lv9Fp_o%jK&7T=<Hvzzkqn^)4Fs>Nx=LDl!h=A**T&YD)Q{Z5qu
z?p+6d9_>6l7yQ<^d$>X-eh=4@qgmLb+QX&2T+4p_@DtUiHaq*cn%Kh?GNJ#=-n+nQ
zHMRf$d+xi#G>uLsC8;SBmDH3DQ=(BLQ$~#xA)0DRG1aJvBus>%5JE_L2qA=!M+l*m
zN1j3vk|Km6N{Zig+WX#nK6?&L{r>;&_xEbOy1Ul>x!>#BYprYT!`i2r<~_qj*G@`$
zhKue|v}d^L(s_R8$%Gry>D?7cKeoKV+0D;zjiNqJraE%paGsxSYe~<N^`^cXOwW@I
zrFQXebx5aops#tF`no#RiSMJ&qdGl(D!m(@>h(z^ej5MX1+G(Xx;FOo6z7hIsIQVM
zPgyX8mUC@f;*WF5*NPj{cXN!Y+4A|m3;+EbdoJeZ2=(3-?lb<BG`@Jh#`i!vbJL%w
z7U!(&mUy!~<F$*<!~9UC`|cy1gq3MDW~xQ&PCI_z)oZ3vtm5MmR{luwOrW?9rt>$w
zrto{kt4mC~P)sM$wGWQt;H#V+&VA{Vl4-1E{&V%3<<*=Q(|^-A@-^TZ)E^(y_1=dm
zwsdbw%OocvW00SbqWgyEF@GoN59%Yn-;l=xzf+mV!`d44r*RqPxZK?lEjKDc_l;8D
zCOFl8bokz58n=Uo#L2UL)tw_&UK)4gN_zHS$Msa7-V}%bkRN((LB_>s>i=KpUa3Uq
zu$43EeyR`X8di;T=c6~LT>JEYrZ^w{!q?WObmQm!KH^wxq-!+%oFB&{VLH8MpO$&c
zZH;9-<V4c{EI3EUXF5GM(b%c?<3{4bVnne?x|Z4$_8Z?POTU*IziPBySWbWA`$#9f
zvw!>0lAhsf!OwE?dj<LVPP$guI4<(z!_@Yc^xWmNNIZ?t_?6s-x9J|OOX&PtH@a4!
z&tLxX>p67451*TB&i8H6Gnfz2Hl^q~dIs|_dIs}CT32bA_2?N)9@G4HHMp#9OOl>E
zLhcpP?ZU{2KHJF8>3v4eAkwoqow*D@tH<AKQobJ5$K6)BKKQzP11Cww!<D{gI=4pB
zpD)-%eH(G)eEQ(1Q)=JsyUPDJ)8v`Kj`4g>k<LAG-*P@a?vP$qKa8Y%+}yvv=Jp?d
z=ka@}kDY@urb_SQ*Xh1sy7xZn+;MnjVZS6Aw=*No9lUQGKh)W=k+v^Ik;A7|n{rXw
z&Hq&G=u8>Bo5%N`biBT^FYgcDl6x8XxcuPwDc^ckdYca1M?7u+X#M>&?ooOMfNXl@
zo2QMU?FH*`qlWBGb{c<Dd@kZt@Yz-F&oa-k(eWCuAAJ3Tw^42x*ZQw*?7M2o6T9fz
z>L2GuC?-*fZNj|tC#ddnpGW(;h4)vZdp$bRw!4Fqv~mSKcmEA-zj>d%tLj4yy3ya{
zc$?y07^ypr@AHUr>dE$UByDq7MCz?9qII@8-A_vOkmsZM*o4`KE@_drvu_W&*R?w>
zpYL;B=Dl+utWMSE)3HG<e&)mKMfKr&wWK<Ar04nu(0veGH-3iRU$<|lZq2D)g$Z@1
z#l_c~7NPq@xF1TbAF&TjYO%Pa`u%e~KeHM4#GiCuRNy@<biIt9@8G{j#`ozrcH(~I
z`_0nnIN<kal>R<h+>?9{7%$(A5A8Ewp?8bF!p9=s-_oSNdlIE_^fj$#yieK`t=p2z
zET{WdM#eeqzo&O}^7H#s=$O0l&Gh#g*gDRRYR>jMi|807`OTX@<LCX?N1Ru-63fSl
zg}iRkZ~XUaC>F19{l2I7Lh$~z3H6!(JrMki%%5~W6SY&%t@6Ig(et}p?_~OWm*ssf
zhWQU@{pb20>bC>yH@FY9gz?7D!11w|JLY(7b$i*lYzmD5{u@7h+`f@w&M|SvVFMe7
zJU-oV*rKw39P+b9Iu5s%Fb>oCIBjqCn)s;mA}`NLDm<V3C++c#!;LgnZ5*~NJ`Ue3
zHV*lHB>KFTj>E?3={tJx^9?+X|9PmN{e7Fj*eu+$e|@~X*w`#@9~aU(T~;6Gl%tQU
zmD0ys>3s|Cy3X&1;&purZF}qQN1ryKdivMx;(Z#wH)l-|{VgjuUOT8ixPKkGclRgl
zn?V20-Ov7AQNjLQT8{pmTaNyHBCstDj^XCMZRx4jzi(3iTKn(hZD<K&7q+2O${4%W
zzn}dU(x=XTZckSo>QmV-{a@+R9=dN2oCBln?76mIr{}%A{kp?3r+qqaU;W$C`nE0Q
z=Qib;R2qZ2FW33#eA<2%+1QKQ?6l#1Iq$>c(vutUI!^O-ejYrD-rv@S$0Bb-c|XqV
zV%nDa_vgt}hPR_!FL!^=W7t2Jmu)D$m&4}r-uj%gALDMdJLdj>?Vp?q^iR(J>i%)}
z#W&L!ig?F_IF8&g#N%f!jUPU*MdN11&ActAztJ{|#t2=XN#gP29uv-`;{j&)cOGZO
z$5EVY(_+tBl{AjnM@5eb{c}M+ZjVpT?%bUIZrDhA7ura+^xnq#Y@7D&Ovlo6O{q`k
z=JfY)N7CPO9Z7SnoKN&!j!85h<$35#n}?31^E%byPU|f5&?odf3(rGGMo#NY_a$~3
z`EW+(c=p#lqjM(PO+7jnvAwQG=jCjh_UIhX%XzDN=S*2%_s&IZBi%bMXZtWcV^xi8
z_ftD(vfV`IZ`fW(&n&QQYS+Bzo=e^~<k0yzcMeS7lXC2xklfC#yXhL2y<1Y+%irxC
zmE7);{N3JlDedR)o3!2B4_kLt?X;BImh+@8i`$m@CoyyEJGC*Mzu#%!sjbV|$Bp)#
z+FZonC)syudnSJ$W8bL{;`#ef`#zNVU>AKq$G%ga6!G`o_MQ4BlfR#0->Hw{`FlJ2
zPJOlf5Bg5euyEgSpB3?UdQM2bQ{QF&QMJ<x)TTq@<IwmhZG5D*ZFge(4jntCbsjQw
zSnlu<r*`j=aazxb1CKu;KYLWKF@2n7`A(jbm*+THPP42LPK<Y&wN53Whttv-Ha0JB
zNWt*IL$4e&Wc2W^!$uAncS@HoK{a{AkWqQVbCV0kCJ!4sW_-c83BwAKM~oepT)gxZ
zTzqf=IA}h8)TH5q3zEkTA2Gf~Dc%aM%!iuzv~rg8)uMcb$L0<nc6ou@1y;OOGB>7G
z^5~)C3%G-{RerMM>QE02cSa1!8$a9`GhuZ8gfYWB@7BS^<dR(#1G~l=SL~OPT{Iir
zrde*AW>-4RGP^W8vrDtHon}Lln+;8FmYeJ<$<5Aln)T9OlWEu#j2b<B@WsR3T9@Mc
zRC4At>+Uogs)h0=lwD}_*fGPe^!G~1{?DE;CU?k{&Y5Gy^q(+%JbyiRc<va@^&B^f
z1;Utd2;d*-I_3n2esazpQsDF+GG@Y%apYsjxM3rmQ}f4-%A@?1&Z!eFo-n?^IeU11
z!SK;ThmUjm4l5YTmI^pMhY#ffj61!_dG85%T!3ljoIYbOcQS?#qfNHs?>OntW~7a#
zPaFP?KDoa9m8P9XmYy${-<fsu%yOAb`gF1UnZEqlruFh^#eYvWCf{svUnEPS^H_o8
z|4zp>4u7vjA9|kEp=*FnGJWXp>;11uZhN@?oVX2~xNV%cZJd(jf5%BTTWD4~fb-@c
z$MlV6z2DvM|Cg;>{{yv^tv&R&<|LJ54|F*PyL{B@eVx_&|7+Xb2Gqf_6|H|ut4F!5
z^%tK==k!0#?r%S|v-X$UYO|eo|3htA?RVEBtNtN#s0R-9z@Z*E)C2#I_do%)ZybH-
zZ%8=9t*s--4xtZC>YefQarI`D=Xpd)a}N5c%z1^&u>WM^hx+olzI^dHg*#W_`AIT;
zxIR3`;l%m!&R3XcAKd0K^x<W4eR$r)iRU_F=@a%FU(|K`iu<N`*>g$b{$icWb3Tk?
zKO^bGzPSIxn4b3AD6++u!}aGnbNpN%VT{{G!UFB$@BX&%cYod8-`zU$cYl5OyT1<n
zy*GWhPTX!@F6X&zZohJQ?hlT)JLZZr-1n}=Ghbdlr&H;}b4@PC{lR0Clgqoy;5xW%
z=4EkmH7?_F?2oyN&2s;9UvlDhaamp-Yn<nC&-La!*MU=C`fweY;qg-Z_dcf6`;JQV
zkzv2FpOTj2?^nVk4$SiMIJte`*2~{l{JYzJjteLEyW5BUzTn^e?dR|QcJg<ByZF1m
z4gCF3I@AM)df-qG9O{8XJ#eT84)wsH9yrtkhkD@utsbCzgC+e>Z`J>ndRDX_54EqN
zJ$I<wp&mHY1BZIxP!AmHfkQoTs0R-9z<%|>sbg}-jUAPn+`MgShYsyh+oiQi9y(+^
z-M~9`O!Bz)X`MQ?@08mjd05_%F&8IaK78ExQKYx+)H=0wyX5903kvebcWKjRi27)K
z@z}8!=M5h}cEY$}!&?s<JGxE5*s*zZ6YHokZSwLiAALgpxUrWEr`v&ZJC8`~JfeMW
z+m0POo|xN#?lm6XVOVPC_MJP7IC1ESsl$g2KQXu6i5=Uuh~0M=H;Eq4nA|AtsKmx{
zFCIPHC#jOz6tb;+c_*Vra%SSu$#+$nQ{}<<ti;C2nKhg>Uw*;&@$vOCPC4?w{;_8F
z`qXUJGHRq}Cmx-CS7c_TyQ|z2e{bTP8V}Y=h~y_WPR}MUYd`+v(=WfssLsCTGEb?!
z8mZeN%lqrL+%&FdX?5FfoLk2<`d%qc#f5B&*DYa|)o!Y<cI&u$QkQfq>((!wT=X|>
zdPMv!j2oDEbhg)6a(G{j`)kdq^I%d!G%J$Wn0~iLuUr2aJI<tHv&=^!H!`EfjL4wG
zqjQS;c%aVgq&Y`CSU(}UGn&|#n3$i>H%Jwwj+@Pw+h6Q|w`uhE2-yGJXzBhZR!VG4
zOt}9HZYL$b|AD3*4FB^&{L}M8k`9LdN>TOYuYY~h4u=2S5dRYoqW@(f{?{Eu|0&in
z{{Bg`FFV<0)L2@^_{pX5LrnPinHu7M)<N{YImG|&gXEvrr3_w&C|O_3D5Ec$Q(q7h
z-WM~>mpdlAlHYlzt>uMKUq|};H=YTzZ38uzx;R1)+{yOSR(~gjifp#>aveLPMy-s*
zqifBHJXk4VU}EE188sZ<Qlt}?ScU$hbRgTUZ1XXZ`?u`vRton;N!zX2=F37Q_u(%z
zjovN5{<oLW*GtGhG2wl^H^hG}de~ahLGVAweEI92e-QmI3Gu)BAo_0@uU+A<f2wH*
zqyHy|_@8kQ{ckAdKZBaH-L$RTsEispv}-P9x4M9aPmXWztb0{HE=j8v>>Ku-W!i!I
z<`?^Oa{HZq&p!yhGs(|(^RrFczp;$<CyzRSnDF(dYXaAj?zyskO*-YXO<T^#7qtH4
zv5y`36vfe+?>q9*!xcGRnQ1=atpj))IN!AS>bEd1xDB*}v}itgrQh88s#C7l)`L*5
zR@KQ7B{?P|%k@e(ts?cxVqaFi5+BcG)F{?2-Lg;iw~3pS5S<ukr?2l;o4-VI$BFB>
z*|bbu#=;W%ZZ-L&--3O|V?D*3`F*C@mx}tF7~*rfX{}1H=c1D8xhllx#sl=3d>Hp4
z?Hkq5)0;FGF)dlwp~6T`DI1Z>nGNaioDTB|bGvr^XS^Y)l4)~@sl}GT>*=iG%P9T$
ze48vFWIg3=$7b^-$LVzZ5EtspW)jP&cZu*-RYn(&qgFNOKT38Svasai5c<g+xW^$p
zj`FO0o_L|*PPWjrB6qzmt!^1I>Y;8NljY{;V68{>YicFkxTn+CR;Fd^_*@++KChc?
z+csX4=vTK7{e6%h;&<vn@Vh+3?*`M_msMY0qe`f6G6#;5zaQG0b|8M~Z}|oMatx=N
zX6x0$Xt~xa!rYE7wq9*0whY<-6<<c^c=P7fyk0E~+yAkzuJi|nIoW!(u#7o6uUW(d
zD@&UISr3ZL*Y@(P2lK+$1Fq9*^CSDt64!OFeM{-QL2zxi!OFfG*5TGU&MG|?ULC&O
z@O+J|Ort2U<?#6$X};)Pro5jkVH@Q6T3A}W7MZVQ<*QdtY4vgrmnJ&()z{oI+E_rx
zL&RVVd01tcuXuIoG$)&5S}toDHBz&@b7l#V^u)%gS>%d0uzdb#y0KH04W1*j^H4O#
zVkgPyG*mjV%dFgtvW~g3Y21VybMdm{lX#)@0%HEJgmYk#>A384D>uEYWoMPV?5XBs
zVQI@Q3ND-XM@y_+rn}CB9~0J+wZ+{b>8U%3&0Z^?qs!IvnRHH)&uB(6?Ud$PiVpqW
zye>m@e9Lo2I$st(PHZ1qKqD?VN@O3(<00St<WQdcl(<Z0XB#^xjLnGEkJ;t>;dkeL
z_)R{77jEZr%cyUbv1Qel&$&)CcB{rNIM(&BH_B6lzzJb0*PcF$tn5b0mpE1z`^r+x
zxsSG$vwqCh=Ql-CDyuEbW*D2v1&Z|%ozs>x<1~yMZg;-1@*I2d^~~D6B&6NxRCa-t
z&C_jYHVyX@PAk_Z582*`*R#s{9)s=XBe{IryLF{)@4DJWf_SPMC+>@E({fnIsFCg4
z-qAEB+uhtr948xFq-<~uxZAs&U>wtlU1a4BWP7*Ud@L$$*&*Az)FZh7ZL1GpdskpS
z_IG=?z{*v0d$-NX=Wqjxjnm@WyZQ|nqWP_E@0OOjz00NT9TC30qPM-vF+Vx%tdwQ)
z*qLr@dDgkb`{8%<e)z3*6j!u-+q<sDmQ`QgW{os<XNlXp=&ImquiLu0R&FC#s`&Q8
zT}MK;b?eGmH}3aJ4cU45wson-W^#dI@hrZr8)R&0+qz<n=EGq*XEDpl7M8KCi)Pc2
zVsKL@=ZV)@`L*u3gwl`mr^<CW{|L5YSB_l@{SgaJoB2Q9_tVA8RQFokoP-Ax6CxA=
zl63`;v7bulAS*Xh%klP2i^Xf9k=~|Fib%a@xXUVEy(gAb?=)KG2J^K+m%lOUKR$A=
z8qDVte738wHg_eyej_eK`%M0ikJtTW@3n!K5Lv`4zPF>%X2?0bfmS}A%Twax<Gc{9
z&@^{`$=u8kjs7OOBtN&rG%mx5?P}Bf%iSDOc6W$Im%b(W%O;0t?M?I7B{M`D6r$yu
z=CAWq)BMYw6;gIVh_*DO?Aj1*Ye?C>AzH0u?E`<?QcSa5ru1`~Y5qEAg_O++(F#J!
z7KLcDL&`1;(Uyg1>rC_4d7EkeIy+4qN&faGg=o!9^Ox;fOyhY%wrR83tIqd=n+iIf
zkx3uj<iM*-0`GYJ0vDsttb^od<3aM%yeT(`<|O=I1>41AKHvQK`*CWBHY-G15TY$D
zrg7h`HSIv^%6=LiL;q1aP(Qf`$<Km=;D=+d)BN~j5T7DV4ZM%5VThI*qGc4*GRW0H
z(+;%n=9-_yT)lFQyJ9OC7o*SCgXAZ*8CS${4x~ODgNf$HAA{*3+T0LrQHZv@n8t11
zVA_GkAmvzY@qx9O>yvko{46>MemDku&5u6@wT|PK2H#7UQcTOF-_uOn7NswAOjyQs
z)Lc4BCB`>HvSTf-$5iuGiSnGduV$GxgU{`id7XN9ov`cFyzkp+eq{gVyZ3{avDbcE
z9g$^(pTBnRFw5p6P5;?zZ2<R0Msxa)68#Mxu4`fVT+utXn@OIC!M@-+%`jgR)z^%0
zUv{1?l{^vQ^CU;0+^6fz&u+?dV&B_L+paMy<J$jx3K?GeXFu&*utz!%QLfk&9A1*2
z$>t}ml=`^cznhxsuZ;~KnKLXiKMidxhWDA*|4Yf$+(56HGj3b0meMrmK>DBk3^YG>
zzQ2sV9vIr!spMy_`I*nv;`@o@gi>U-oTN>NOy%2$_@t8CA6*GsYh~7Inf<z7itC<q
zJQt+<8p<;U8-|ZT_A|)*$o*|)UGs=$(5bfINfc_6#CM+g$td5pW-Z4zY+J*1+HSrM
zBrfbHtrh)8=|KCa(EKc~M9wm5lzxpVT10&WmzZSTUT%J}N?Dg;x65uWwl>A?>#22u
zG|M{<;<l!kHj94>I|iX^GX6vOuw#1OCgqtQZYn3%3PYAR)3iklm1}u;%)`Dnge-4+
zF)f9-O09W8)K31-J*QLbzHZ)hwldDvMc@7334ATf?f}oI&g?*A7lKde9gpRDPBqr;
z7p}*wa@2{-E)6NWwwz`6hLo+<hAUipU+{9%jPutys~lzdd{TjN4J*@^u=qw>(Kz>y
zC_NXrz{*XfVxi^eMwDX3<UIRkE7vMc%H;=6<=D-myAvDdyXSFuC(89~n92*HxbJ7V
z{uL}Yy@KVIRj}ON3YKf%wqpH~SHW`gDp+nq1<NJ1t62N8Dp+o61<Ng|V7Z+YEZ6G9
ziuFrw1<TE@V7avwESJbDJ*E9!-!m#$ZgK_7EvjI-Z51q+(xGDgGN^*(W>&D=stT5?
z)Ujgi>so<w>9nW<D<=n8rQIXEtV-zpDtvsg*nCXpst1l)_^Af(@Iv>06{sf<m4=<z
z`TnmD{VP~*dIifZt6;gk6)e|2tz!L>SHW`gDp+nq1<NIMu2}oBDp+o61<Ng|V7Z+Y
zEZ3?_#rh?;g5_pcu-w`TmP<UTV(rVQV7bW^D3?xETx8{D>T!7~_W{L+-Urm5eC#$K
z^Q+RA(zd}3>C{Z|dj=Dtg(0fLb<5@xFqG{45#R3^y#5tg9h{@cqYSaR4zIE^&4=CR
z5;k9n@=bk#2@93uva1iEY~sn}fKo-4n|T0bryfArr3X-U?*WueJEh`%Rd4`h7al;_
zZ3j@cdAEwUH}?R_&OLy#8xEjs{q%~rxBmf@opAtVR~<mv_){z1-i!k%TX+CvmmEOZ
z-3L&%efNs@RsI2#U2p(pw;n**lpYmtZ%zfvX44{PTiI=K^o8!Fh5LQ&aif{Ry}aC3
zLT}{o-4!R7#T-7}wcUK$Ib7I3M~eKrXPWy^nUoCrkJ2*!&wsvB?qiG0^GeY5iWEZn
z8_)UR+${E<5dLkladPV3cWu)DTzY-t<{6i${=Dbc*~e1*O%C+~^FTTmYSTcTFK#t%
zw)*g&yDsoRy8DoQCY{ER{w)EjzqdSpy|^#C8n>5W=$8b#z0ZzowEM+(zLnwS_<i?x
zAH^q`=bp2SlWGUrl|ZOBzm0V$mEnF|ZRJK%9_!@0*@$8#he|yer0d-}#`23l(srMY
zvB)wy-0~i1Tdxh`<)vGB9<R7Ox+B!<0{WSdeB+aKd2}5(G2{Vky}lb+Tl_+CY#c8(
zKe@Wx;JxE=PMdBw_dPto@!GbZWw^e{r}F~nIwb$+k1@TsM(*Ow^_p1X{ahT+k>)2~
z{e;w)W8<qZaXhByS~<H$pA&NKKDw3G{~Z6xdn(86-C$*xP@d|ZQ~dtZ8B|Q~S&hZB
zRwl!AFE;<@-oJ0p#3V#$NN4laR(>d^x-28z_(jUYGNu+=2IB=*W}TLatzVH@?pi=M
z#%1{O*|EGQ>ouCC<|{>g`PS>$s!@x6+iIL_L+Cs6drjl`P+NUv>4KiEV%(1@y%?Z%
zlK;!7kzc$YDRBA4`*EO^8Kh-m+gTYkG&X(f1uvt>_}R*57heXQ)XMfRgX_P<%9K`r
z<~AEA>wBP`G<e-j32}+NdEqp_)OC~Y5h!`xjE<y1M?~>^FVd-efAcf9q-~1#`lCTS
zi;Hbm<n2c~c4wK7^7c9R;VLV$KYi$&K?Nz5)rZZEE3FTCIAt5Rq0~O~?!}k^z396a
zW48HPSB`C^JS;_9)8g@v_?sWj2giAE9ZAe$K%e7b%j-?DY3_Q%T6@!M^${*JL>pvU
zI+fwnoId%cSzLYVTmr2W?qIAg@tAGwDlT07*$3Ii^RY*8o5{;qyC2JtKMF%-_GcN~
z2We;0f0W|YNFQXGCi^zhnaeRP(Z>~-R>X0o#9WbSsiNriX|`$UtOeFv+74S+aZHyP
zC-DeywEs1Z`(>MP^TA)jL=U9xI<E`$`!Gb$74m=KeLpv>@3XC3d6qG`0?XjOT4d$o
zxo(tLTW;EFQB>Pt8vo9T?RL|4ilW<^N`3W<)fu+$wCxRS-%|-svoZ^~DD5YUZ?Abz
z>EB*ACoIp(4AL^bu^*wmngxn}<CxAeHd$G3AL;E0NpD4;rN;GFuGoHt4sCt=8TPxq
zoPO(PvqO8ApZ~Z=_FqB2+#i|7@6YynvX$AN?e#({Q`&Zz$L~7hvUJ-S>lgR9EmG+9
zjU2d9nKb&;I*b0JWan0c$7%N1OEizR+TLb|9xf%GmziZ{o9i-zWo3I6b^Il{AeWn3
zfpWE|+!8Ctc}_eYR-0Cy@gU{;Nl{rhTpvlMmB$B<>kQ*F*nzwKv17(O8`%8(E4MY@
z*dk?vedIpRMpHL`_j0@D??;_Dj_Ztf$5!~<IYQM7Op|r~cQ#i}*F&#8#qNjVzUyk7
z+y88{L$qAe64@yw<|djJFN$i@L$tXe{uUMEc)eb3nzfg=E&7f(3jiOmrxLf_xbm*2
z9N!cf2#&Lm>*~hWZos5tUvH<KNk3;ByF4On3CED$@z2PT?nPx^v(1;?S6srqz@9I@
zuQ+%&upLYBxZ7&JHdCIr*CF$$$U@&>;Qr!qmpp(A(0$4LA8ZHtm8G!_EXOt5csH);
zq~)5nmh$8y{9ag@@<wI{@ACazwk;fk`R0TB#fyQhWA0v_*D)RoYmMc+#}*sEJQnsE
zSEL;5!)O*1*oSfZQqN(Su8nhiDY2gn)Aq;DL@SeHe%SYP)BNknT+`xtVU(C#6rwFR
zt-esoZE!i?GPb*#aok6h&ebnv^;aw7%G*xvo1FbD!|j`CW&Hgx-!y+eED6z8o96F_
z&BZuw=Wf$VYctm+c_95qDaCiJ+TOIurg1wnO)GETu<yxMroJyeGfeZheV%Flwl5CR
zR=NJT!jyO!8%^8ltN+eoWw{UH&*KthZ}U@K&e!$~)ApzB6RnKDozqS8w{vcYw#c;l
zT4ibH@?spvWP@olm<u^ZrP+UA{pK>Y&S%)$-oZAZcp2{F3@hVr%RtloZOIGK3QcP$
zOVyaoG|k_>`KGz=YUbrGF-_hBLEl+hZJNI>n@#iAWp{{{c!5?T$2V4zO>^tQebnBx
z8H|^+Uq|j|8E(sLE8}m=Leu<hSr($LGtJ+x+e~xY!pqPXoX~p0c}lD$4U(+0Ta9SV
zP4m~Kt7-naWQS<Erfv86n`oN9F4Ik0?c?T}=C8{l)BJT=ZkoR?8$z`0rupkq=|Wwg
zzb^Gno8_xZE7NB9v~<(_b?I-Kzb+#~w8^H;^!b}%n!hgdO!L=ev1$IgtTN4CmyM?R
z>#{RMi@!)K;jc?W)BJTwHEpA>&Kaid_Gtr6^VcQMG=E(RL$sNu`C~NSG=E)|n6}!t
z+|{P}>$2H2e_eK)=C4cQV0Glzl1=m1rM+oxT~eu7rfD<SMLD(!wFsMRW&FodGb-R`
znUxvj+mEg@&EMv2rup0F<Zy+9=dqG<L~<Ic(e>Xnf1A6SR^B#qKjrUd8SbZfR>t3!
z#ise&vMNN|Xqvw*J5BSqC4Pt_X@A<%bwA5+Tk@@pzb#Wu^S5PIh_=8qe_NKC=C*~8
zW!9Qj+OZw~wzr&I%24SVnOl@JpJ0Dk<>0sv3j7>>XRXMz=9K5e{$`ujm4(2(la50C
z=Rb|h0M0%8@Z}fmZ(BM2B@JUov`G2Se_bf%kL%pkIDg!-L$urwZDKKvmo?qA*}7aj
zXGP~lY_?hAwMO={_8|D-_BG7qijY+!aY{8U*|hd#GfbPyntzV$ool1h%l?WJ#{MT4
z^OZu{4AZhGAB;JjbF`Rq*~P|j8BUq>S!J3%zfc%_XN^7Rv;bbFOs7-{wF@Ua?`Qw@
zhqG5bKgX7r)5^3A76RijHZIcWr~by(j}tC<&DMK$&Su|5TYV`ZFL#EOb=QM*(&m{q
zU;UN*PVG!OyIA~QO)AfRx0(;GA17|lUeiiz50_0D!6oQgzx=QM(oCD{)3QukWEw9c
z$FyA5O1PJT+gfB?YNcXabSvFz>i(4it@omG`rKe#L6zb@ThW6BL7(v#6GN%2dZrq;
z3VcolpM%QjbE<L6s!;{}eH5Kst#~~bmec1t<JNJb{5~Ty{4Ql2R2s=p*==uS+y;gN
zK4%7eay$nbTd1t>T1W8t3}&b92fJ`T*bV!^#*gBP((}0dUtrzF`nKN>HfKNB>E&co
zsfvq@Ez<fHzh*@n+`uI(IZwCE%1qZXFt?|3xq<TmyzVDo!f@>PFq87_O{=8qz|u0_
zd%Tq24(NY#g!{LN*jJ(XvUeBED8tusKF1s8E1!I=GGBx0(HD9rN8HH7kb8^ld~xN>
z29<j?tlYa%<uj5iXEm*SW=iEg$5!s!JR!RG2)?snr0+^Poky;cS*2H%-c`=1l2zr*
zDt)T-rOTwU&q=?OmPP46>z__Orkk&g5&A;)hxd!$SHpe7_&h#u9(%+1dO6dbLB&>^
zkLkJ{4L{fHoib0WRP21S_~E$J&!hh+b&b-0Wxvy7KGml%aQA_od*`v5YrfLl{a5je
zrOSA?6}wuRLS<%Inf{ayu8*<X1o+rvsd4G*yD;S4e6*t_S;Ohwx3t^JB|<s9t&49(
za!YX`u2ZYgTp2qi2y7$hOt~GKaGm-am!!U9>!x=+wAfoc-D{7$u1&Xc@=gW%&e~kl
z+_@e1=OWYgXWidwWu{Yk>d!LQeO^w(F$~l32mhz-)oV(2`vLb$g0@`xHJz|*E3-()
zaLBQWck>UwQO19?B6t5xBp)-)$66i3CEoX%Pe%rUt9Sf5HQK!u*XZc1xI{<N#UxrT
z*T2?S`j1jY>z_eo`<svETK~{>(0#AVB5Fg}dtJC6W}Ba~`XR64{g4~h58Q_O`Sc&9
z18GBZDxYJ1=CiZFI+FnJjF@ih!VuPfoiT-eUu-PrgMPETb&-GDSPqWs8Gji&D*GBI
zv+c{t^73<xEvueI<>VHYlUr8~j@#ml<NwNTH`l+Fv1PTTe>u6y<=|@3a_1RWi7QHp
zm%q3iWtrPpPA+~tdsg2ijVG>4s&W3hWR$aPUP#%(a+KwE%r{PA7FdsH`szCuvf8**
zZcKn1=yBYR-NwZ;M~St>0?7vMX-f{#+J|VFA=;o2Ek8t?8lue#(H4YgOGC7^A==gu
zZEuKHYeKLOxbIU;E35Cbj4P|}3yLj+`@Sedn;oJp4AGW_XzN0>Z6TU-d9b})m!uG_
zd5G3EM9U7*aznI<A=>m}8u#~H)9jp>e;ye-Aw&n`%&sza9ycj4_JjA9GP`>}*pw^S
zVc<B({_ZXM%{I0?^_^T!zq0-t%lTm2g8RGG<>YpklS}3U5lW>km-{o*xFUv2>3jB5
zP)?t-_rvG%a{Ao9A3hsi$&D$y?HR_Er|tRW@X38NtDM}@a&lYC$<>-9O)fRwT)(t(
zayjMXipt3?EC*Mg>bK6gL~f4nTva-K-D$tcy+<?`f_nqKDN1viqWI<s_IyHr@{x8G
z{YPo3&hbj|!8eN*_rVXh6xVeAF~j`YT)7m#l|uaL{a9<wN3Pb*yLUJt%6~x3J?}|J
z)S8uZL-CWfJ>@OK>wH%$lgUNhbw1>tG-gMZljVKqOk*?DZ>;__Tfy3Eo0sor8Q#zB
zwK6=OIdMH}T`k$*-+hsL=OPp{JJ2G8%XBriD;IIwFDzBmcRnE3xS7fY?|HS$5;Udu
zZh7U&bbDfFTe-QVl%t(spd8m_t(CJe#PiQ=_s<pZtNYz&`sgf#Z|W&iczGr;=^9=j
zjd2}6`&B-j%JsMMHkPowyMFPzAbd5j)l25#v&@Iwi=+2U2HW8ISX!cw4d$bNN$v1_
zEHBYV^0nL()TRphNTag3<|A2s@H(CDkH?%E57tTu+<mIogShP611P(}%BGgOTp9(j
zO_2<OR<zvuh4de#WId0g$6elYfE#Um$DRYsEEK$4ypsC&Z7b6kK8;+JK3vUeX6f{*
z{LMkuYS4!hud}u3Q-?l>(}#bnYqlO)-tM#3z-&XZM_axz*<{N%C3}qJn~^=%^1S}H
zu>A34xgXeHYx=aYd|R^ZEYIs`2g`RN%kg5q3w=(q{K;fbv3xq&Q!U?vEN|bK?@6E2
zE#Hf5Z_8(qJ=5}i$!1%=AK9}lKY;8xmLEv=Jj-7|c97*SB0Jdfd}%n>@*~LdWg@Nv
zUmD=k=bX=@51%gNJfDKfw>(d!dD_T2PbK&en)4Is!-p4~=UvZa%k%2TLy+|;^tsOR
zQ_0?7`J2cVS^gHX(=2~0+1o5XgX|razl$tyN7?5+^tspa_mREd^0Uc4X!(c8&b9o*
zWFN8oqhuem{Cu)cSpF%p3oQQ(*=H^P9NFhBzliLMmVcS-V$1)V?5mc4jqK}|UrP2(
z%fC%_ndRRl`<~@jkbU3stH^#}`47piw)}s|uCe^bWIwU|I<o66|2f$Wmj9CMSC;>p
z>?X@^A^WZ6x03zd@;{Q@X8E7V{$lwZWPi2%PO`sSeizx@mfu76FU#*E`?uveP;vaB
z?@{`%lI5$At!nvdWD_jU=i?8vd`+^oEMJH0;g+vU_6W<@Cwrvjk0RU9@{PzgwtN$^
zO)Z~d_E@sVS-u6?mX_yx2Trhj8?wCZq<>C3`tL-`cOcu*^1P4iZ26POcD4K|WV_KP
z-M)7x+r#pwk?m>uOtQT!e+Jns%l9GM*YanP?Pq!3579s89QyBE%b!Q~e9I3ad!gkA
zlg+XGP_w*Grhm=|`tM@Pk1~5H**wdSAv@OcmysQ3`2w;NEPn;riI$&4_A1L?P4*hg
z7m}S~`RmC}rOyra{U)+SmcNDUG|S&g_BPA&y}fr>{w}gJEq@Q$do6#T*$2qZw)`Bj
z4_W?SWFNNtJhG2k{&BNUn0<=u0?R)`_F2onKz5PkUn2Xm<zF@Xn%OtZzG?Ptv+tOF
z&+H1bE6sjj_CvEDnO$S{W3!){U2pbtvtO9~%Iw!>zcIVT?005=Ap4``e=_@v*&Swo
zGyA*QU1t9@`<K~$WdF9j6Vb61F<Z%O6|?bX6UbJ#{9$BkSiTn7+Lk|@Y?9@VFw4&g
z(4w3MX8FEJ{@%zeAFDL6{4r!xEPpK7<1F8TY)i}Y-x=rft<9#IZD+Q<*^Xp8S-vyb
zE|%{~_GHU<Bb#pd?q)O0_B6|XE1j3u+iVuuGcDhjY_{e5kv-e;1IV6Z`GIE7H_O)q
z+22KE2U~t9*<tj_weKUzj<WovWb-UPhU{3&k0U$Y@)O8jPM<66`;}xTS$;Cvt1W*m
z*+R=-NA`Nl-$b^^^0$zkX8Bvm-bSC>?fV^M@3j0(vUgklUb3?+e?Qp==rh~C&msGe
z<^N^&5wi0v|CrhNW}hVcl;xi$%jsFN3+eM5eV#Xsul2o1pO@(KvT3i7{WpDHrOy)6
zUMKqoeU{SaP1D{cyNo{X(C1y#mXlpUpZDprl0F=x56P~!{C~-=vHZtmKe7Bevg<AX
zIoS=C|B~!imj9aUCd+RoyT$U~k=<(fAISb_`Jc%CZ29eEcUb;6vO6vR2iaYg|C8(<
z%kL$-&+`9}b)wpq2-&FRE0e8a`FOI`EMJ{$qUCFlt!eq%Wb0TyiELfV*CSis@(suy
zW%;AYHnMy&*(R1hhHQ%Ek0pDY<y(+#Y57#LZ7qKy+4h$2NVb#ZJCp5VdA`@-WXpFW
zn{N5;WP4ctG_pM{pGmft<<B6?e|vyq-G^*n%b!KIpXK|L9box$$quyq`D8D!{DovM
zvV0ENA(kITHrMha$X;yuQDiT%d>+}+mLE$t-|`d5UTOKO$WFHWHDs@~{1md+S$-<n
z8!Uel*&@r|LUx+vZzX%1<!6w+!}52LooV@d$lh!D`^esJ`PpP2wERP4=UV<@vX5B)
zQL>L&em>bJEdLbQ1(tt??6a1Cj_mW6Uqtpr%fC!^vE~0w_EpQjM)q~fFD3h?<=-Z|
z%<}J&eb4eM$i8p+Rb)S~{D)*$TYdxCFD#!}iH>9G!{eb}W!j$8hx2pDK4kfMWFNKs
zQ)Cxd{u8pFT7Es*&n&-z>=%~*itI+qZzB7R<+qUi*794)esB37$!@d!&t!kG{0_3e
zT7D<l-z~q3>~72NA^Vr*{~^m0c5X|AY}E3V$yTv^JlSfNuTD16@-@iTw0v!{bu6Dm
zwyx#tk*#m}24s)2{Ly9`n{8tD7_-gH9%r_N+2hTgV786fwq{Q>+rexnvz^Iyv3ysu
zCtJQ7*>uZyH=AL$r`b%iz0GEs?PHezhPaFiv;EDUV|Jj~^UV%2dlA{emLEcPsO59X
z4!8WpWJg;560(<Cel*!Jmd_`9ndQfm<@;l~K9`fd!tz&=on-mRWUsdTwPXt|e;wKD
zEq?>q8!cZ%_GZgZBRk#lw~@Ww@^_HE)ABRP-fj7N$<DI;{bV1o{DWlYSbi?qe_8$!
zvhyte7}>`y{{-15Ex&;5)0Tgh>_W>wPxb}Nzex5a%fCu?iRE7>`-bJ;B>R@-myvzP
z^6!ydZu$4guC)9IWdCFN)nq@i{2H=rE&mDGPc6Tm>}QtWK=upEe?@kq<u{T2#`0Up
zerx%yW`8id&Fprwzna}?_7Agr%>H9GuBwiOsM*S9tD3E5wz}EF%+@qp+w9?H>zb`+
z_DHiwnLXO<6J(#X`~tF1TmD(H3oZXV*%vJTBH5QLznJVRmVcG(63f3%_6^IwN%k$v
zFC+Vo<=-Q_-16^}U1|9b$o|LjtI2+3`88zMTK*HVpIUxB+0QJ$f$SHS|BCEJ%Woq4
zjpetH{nqkZ$$oG7AIWaB{Lf^6vHT9Qzgm7L+21X{i|lU8?;-n_<@b^O+wy!vM;w1>
z9gmW&Wcey&t6IJq*#yfcl0D4wHObbpd>yifTRxrash00SHiJH;rS*LB(xIJWNQyeN
zqb!z2@gzM&XDsT_U@exO;0b<+&RA5=DhCVf=92><y7JY7Fnw$LAoHjzUjz7$_@sn)
z<~sKC34J+VGbZ?QQ8~ly6DV86CptoOrlN8toO7}CDW4<>(V2+K+4306x%zx^B}C`n
zqE0<Ffi#9s%!KF+Mdi$U0CyVmNu3Z~`G!H5zNJXqQCGe(@VOFq)Rk`v{8JKl)Rk`r
zd={Tja!^;kIq*AYF^{_P#{=I(;)}ZSt%1K&;)}ZSe03t2*6;~52X&^R@<yH@e+Qp@
z3(=MD6olzpcRq3FpsqY$2??gJ_yn9>AqndIE$Z;ql3;2q@kO1fsFNOq>Dvg2FX{|N
zogQogsj9>mb%vr&&j8C`o|X8b&c8*SUTgyC@4LCZs52CGvH~oB=_c_-oqvluvhm=o
zmu{2zqRv3n>F057CQIUry7B{D%(MG$=K7<q{6LR$Gxtk;QCI!~7xV0Ad~()7UHOYV
z&doHD_@b_Sj*EHrEj}sipw2+l8OA1%E|K`6&QR1D5n%btD-vJS`M0QCRpVSN?YWcd
zGb$$da#6YR<`XE}OX8as6zyA7uFeI2sw(jv8x%c$9O#QBzNj-8m8*QgA_FA86M~|B
zi^`S2;7@l;d?yA)kG~4^|L}=>xrzusQGKof@oI@L>I_DmDZn?A_@b`-RNxCFzNjmI
z6Ywued{I}PuW$xaC5bQUOhp~O3K~prP3QhWovEn4r7BQhyu_EUpkj(Td^I(gYDs)i
zXDTXJT!VbJ#FwwcVv0I^RW_JzmiVI1R8;@cdZ0j>#Fww=Vv0I^bvKwc@<pK#ovEnv
za1f?%Z6v;^EB`3)`4V5$m7fp%8@F?PP*?sb;IEeWqOSZiz_*t8qOLq&wGO70k8piZ
zXDaIOmF-}vF7ZX3si^aE5T<V#5?|Dn=PTsF^xOShAJmzOI(!v9m>!V$qRv#*SsH}t
z+YfxfFhplC>b%V+kdBx5qRvp%c{jlFmq`*|)cLolvw}?^rAd5IXDF&~p$+ig^99ln
zUHK0KEPuIC;)}ZS{{{Ztx$GZx<v#}gADIWCuKYUSpON^YuKee~pCj=_UHLD8e^la&
zy7FHG|E<h-P*?sN;5$fsQCEHo@W07?2X*DQ0zXgUi@NeZ0)MK+7j@--27Zdf7j@-#
z0RL}^FY3zk-5<d;O5%$;Q&DGE5T<XnCBCRD&v%goQ;x(Jb*7@uz93BB{w486U3obL
z5-77>=Ci0PALW%Jke-qFqRtSVmjHgS#20nts{y}P<~yh>p9p+ci7)EP*93lo#20nt
z>j0l3@kL$vy1=iJ`7G+n*9ZP6i7)EP9|im%i7)EPHv;}Ci7)EPHvxW>#20ntQ-E(E
z@kL$vV}Tzk=QmJSz6J0P%XmOt`BuPxFY_bRm2U%lQyCAaE8h<I_vO46>dJQjeu|6-
z)Rj*IeznYhQCI#X;A_ixKwbG$fWKJA1M14B17Bap1M13m2mWY@FY3yl2K<E*U(}V)
z1b&{x7j@;&0RA*Nzk#~)eSrUI7E7ore-`jvCBCRD-yisC5?|DnKL_|#GCx9H`SXCk
zMdrV#D?bSMljQsr>dFrWex1yZP*;8^@bx9Ws4Jff{9uVM>dKD*UT%1kyZM+1COZEB
z{CtTo>RdAFTnhZIyIDeA`7yw!NqkXP{xaZilK7&od;##MNqkXP{tDp#xS1u?m7fIs
zT@qi^mA@MJH8MX!UHL-b8%TUnSN?k7Uwwcj)Rn&h_+b)X)RpHuE`#ZLi7)EP%gPZb
z@Y|j20(IpjI03%9#20nt<;MW;2pXajMdvG^{?AE#QCI)6aSHhFBk@IDdD*!I_}e7D
zs4FkQ3GnaD;VPo8y!;s8FBcSb<z?XkzLCTib>*dT0e-Z^7j@+yhyHv<;)}ZSPXNE~
zc9u|A{wd&Joz4>K%0B~qp2Qb*<re~9O`3|j@-G12OS%$u<zE8+Itdl($}a}Kt;82~
z<zEGUz08kLSN=8Nn@fCASN;v)M@f89SN=`l7fXCmSN?6_FPHeDuKYW|A1CoeUHSKb
zU-k$~s4Kq$_(~FA)RkWe{K*nu)Rq4L_-!&jLS6X}fuAYyMP2!ifd6JDOQ<Wq2KW?-
zFY3yF4E%VBFY3yF3Vd6MFY3y#2Y!>xk5E_sbKtL)_@b`-7r?(UmnGDd{|fls53+>1
z@?Qi0xWpHA<-Y;Guf!L1<+lJoN8*dR^4|gf)g3IMuKZTuTT6UVSN;d!w@qUSb>)8o
z{y~W^>dOBDd>4r?>dNl`ev-r&b>)8p{soCI>dOBP{7{K6>dNl|K0)G(y7GSlf1bn_
zb>;s8{(gxs>dNl}{`=clLS1<$!q%T2m-wR2Ow@@0KTzU}y7HBP|6S%gs4HIu_zn_Z
z)Rm71evHHyb>$O)KU(68y7Gqs|Bf6QqON=`;FBc2s4IUs@B<{is4IU2@be_Ts4LG;
z#01k&i7)EPHvs-{i7)EPHw6BIM|r%Vu6!flACU2Yy7I}uZ+eLRqptihz#k>!0d?h%
z1^(^(*gxvZ^V31WG)cw->dNyIM8UM;F7}T)Q&D-+D99(sc;F|HFh!kI&~s!wpw6YE
zPCMXh%XmOtd49qvn2wP6qON>L;LnlxqON>r;2)IuqON>b;7^hBSEwuB4ft<meuTR6
z-GT2Q@kL$v4B)3qd{I}vC-CpcR2FsRGl9SURvtg7E8iRV_A(VmU3q@OESNr$`4Q^M
z_XWPT#20nt`vE^t;)}ZS1AzbY0d6nq$`1toUlL!`l|LW&?RT?()Ri9ud|Qbx>dIdP
ze4)e_b>(w_KSkn;y7EJT|3&6Us4Jff{B(&g>dFrXewECRP*;8=@P|u$QCI#_;1@}J
zQCFUyLJX!s5?|Dn&j<b~i7)EPj{|<2%#To4egg0(NqkXPo}ZEoraxtVgu3!q0{^7M
z7j@+)1An^27j@;Y1^y<9FY3x)2mDf*|Dvw^RN%)-d{I}Pp9T%4dJ<pMmA?h}5fWe2
zmA@7E$0fd~D}Ouif5`j@b>;af)nHmA@kL$vnZOU1_@b`-y}(B#zNjmIKk(fpzNjld
z8~CdvzNjld2l$o}U(}W7r*MPmzcN2UUHM0VZzAzUUHQj=A1d)hUHSRIKPT};UHK=0
zA1m=iUHPYhPnP(ie!o2L@C@+k=ULESlX)@f%Jb98!L(22O{jk^w*tQay!u%LdPf-#
zs4M>x@LOa)g?a;N?_%K9&nuwcD&quo<@u@WVA>$_EY#1J<-P{I`gtAnqh<V{uKZHq
z^JM&>exCI6TfnQIw?S_y;|g`<-vRz}nU|q{zbyAX;MLD^&?m~cLS6ayfnO}+3U%dI
z0l!1$U#KhpA@Fl${GhJ<e}T`Gae}(?9|M1{j1$zAUkCg;nSY_KJU@jWOvlN1KwbGS
zf!`wYFVvOir}=~F9*H~Z%5Mh#M2Roz%JW+Rf@!?O7j@--0DghQ7j@--0{#MtFY3x~
z2R<tCMO}G*OF=O8llY>p{2##ICGkaF`9Fc*B=c+3mEQ~eT!}C0%KroWSrT8=m5)T(
z`qR%c|3aOasKakx2&UE&U(}h3I{b!)V7ge(r-9B?)Zw={1k(``U(}h3I{c=GV0vBV
z*QhfUb!r2Dn8X)#<&%K#Bk@ID`Fg-VDDg#I`3AsWAn`?A`J;hPl=z~qd@}I;<$Me3
z${z##Oc@WTD}OBTpUZp=b>&+CpCsb}b>)u-eu<n<LtXh3fFCd80d?j1jUB=CmdwXd
zSDxSM5lm4T52!28Z~h3T^JF}rt~|dTB$yIpJfN;Tzd<CJYD#=jSDxQ85=?z1zNjnT
z9r$}BzNjmI8t|Rud>ZP?^BYZq=_{G9p|1QHz_*t8qON=&;IEeWqOSZ|z`ri@anzOX
z5By{~--5dG=K_C%oKHht`SXE)U*>D5D}N#I2@+q_mCphGEQv4b$`1qnSDCM&uKWn#
z@0a+ZuKXzAznA$M>dNyQXo9Jw#20nt`7JfUbfv@>b>%MuzLUfkb>+tczg6aIs4G7K
z_!}g?s4LHJ)(NI}WIm3%^8EIlU`mwuqOLr@p(mK0miVHsJio;!m<C9EQCFVd^b<_;
zB)+IC&u;??rY$m`LS1=&V^A=)m-wQtJik>an0}Rc6Y9$In}>qw5s5GA%HIWiy2KZC
z<@pUp!Bi;mMO}G*%TX}BBJ*q1mFG7h1=C20FY3zk+meE*mc$oz<sSxqu*4U2<sSup
zuEZC0<@wD_!SsusZvkETr$B#N;)}ZS&j5ds#20ntp9B6cnIEC9{375_lK7&o{L8=>
zNPJOO{@=hKBk@ID`PYD7Df1)Lm0t>c1Box{%D)Z#1rlG>m46rbCndh9E58ExkrH3j
zmFG8U1=EodU(}W7w`~Q}OA=qymH!C%KV*J{y7Fs)ZzJ(VUHOlJ|5D~hs4M>|@Ha|)
zQCEIF@E^<k2zBK*0DpwU7j@;o1b(>07j@+~0)LFe7j@+~0l!w}N2n{m8TiZe{08XC
ze+&9^5?|Dn-wON>GT%X6`5%D4PvVQZ^4owvRpN`f@;?JVL*k3N^4o#`Naj1JEB`C-
z$r4}GmEQ^cmonc$UHLzNzg^;sy7Ie$Zzb_XUHLu0=Sh4~SAH+>k4k(|SN?C{`%8RL
zR~}zTv{&Xks4E|V7aN@+@kL$vO2AK-_@b_S72rRY`7G+nR|Wn)i7)EPR|CGc#20nt
z`K^b+^qtIiP*=VN@W)AfQCGee@HrA+)RnITd`*cj>dGep|FXmvb>)u$zKX;bb>-^=
zf4amMb>$lXe~-i$b>$lZ-(TX3y7G;HuPpIJUHN3-&(!l*pex@L^jl>-pssuh@M~p$
zgu3#_0)Lo{2h^39zh=o<FTE(|uTW<o>a+y^c`_bQSH2bSugd%vb>&+FzgOl*s4Fjj
z9i6jY>L=p?bq45uFz_Fh@qoJW?SYTi`@uk0z9Z<F5?|DnPXqpTi7)EPcLqLH&R?Of
zd>7!?$@~a)<+}oZoWvJ(<xd9wa)~eM%69|)Wr;89%AX4S1UbKfy7E1MKUU6Pp|1RC
zz`rf?U(}U99r&ok7j@-(0pDBVi@Ne>0RN-Rk5E_sOyKX5_@b_SAK*91{0MdB`vQNA
z#20ntvw<Hc@kL$vvw%;P_@b`-*}#7-^CQ%i9{~I{5?|DnKNtAdW&Vr0^5+3xS>lVj
z@)rRAn8X)#<u3%jkHi;s<p%@*pu`t-<%a<OrOb~|SAH1qCrErzSAIC~Kg#?Fb>%Mx
zezwFHb>&9^-&x{|y7HF-f2G71b>&9`|Gdn9QCEH}@IxfNs4IUN@YN)~s4G7n_<<5%
z)RmtA{CyH%)Rn&i_^mQOLS6YQfqzWmi@Nex0e`N<7j@;Y27af^k5E_sTHxDDd{I}v
z5cts&U(}VK0(?V>FY3x)2mCUb|Dvw^^}ru4@kL$vslfM__@b`-4ZuGl@kL$v8-X7p
z@kL$vBH-&td{I~a7T}+i_@b`-bl`uH`4Q^M-v)ehi7)EP&j9{YnIEC9{GGsGEAd5L
z`I*4~N9ISUD}OieH6^~ND}OKW7fF0kSN=ZW8%lgpSN;LuKalwm>dHR|{3Q}!)RmtD
z{F4%2)RmtL{5LY+L0$QO0e`2&7j@+y2EL2L7j@+y0sdx*FY3zA1O9!P|Dvw^W56FN
z@kL$v$ASM;<~yh>KOguai7)EPKM8y@i7)EPF93eH#20ntp8<Z3#20ntp9TI*i7)EP
zF9iN~neU*k{Byu(NPJOO{srJ~kocmm{377j%6t}e<zE8+PKht-%D)VJ4~Z}8$}a|f
zqs(_uSN`9?Crf-$SN>Jt&y)C~uKW_<<0ZbREB_ks3njj&EB`w1|Hym?b>)`=pDyu5
zUHLbGzg^;sy7F%Uf2PD2b>)`<|MyM&ybtQizXN<vIlqCr^6vqEql^dCm0u402QoiG
zUHKKjSCR36y7KP>|BRf!LS6Y)zz>)4fV%P@0KZ7a1M13u2>kCdKSEvkkAOcz#slig
z{}=eZa()AK<<|foC-FsH`L)2GD)B{K`A>i^lK7&o{HMUTkn>llE58o-k7Ry?y7KFR
zPnP(iuKZ`fkCphMuKee~FO>MAuKWhz$H@5&)Rq4N_{I`n)Rq4d_$4y`MP2!g!0(m$
z5$eis0=|dD7j@;o0e-X0k5E^BGw{<TzNjm|1^CZpeuTR6-vQrH;)}ZSTY<k+;)}ZS
z-vi%5;)}ZSKLG!k%#To4{zu@ikocmm{5IfUmiVHs{7=CDE%PJPmH!#|ha|qJEB_1d
zr%QZMSAIM2_egwESAGZZpUV6Qb>)8r{#c1G>dOBH{AQUSp|1Q+;P00BqOSb!z_*k5
zqOSZOz>kyoqOSZd;GdHCqOSaI;Ln%%qOSa(z(*v$s4Kq*__HLws4M>$@OMglQCEI1
z@L$XP2zBN60soN17j@<T20mNji@Ngv0RNNBk5E_Msm#`&PLTMb&P>#a1Ac_W7j@+$
zz}J=dqON=t_}66qi@NfafKQb8qON>p;Lnu!qON=u;AcyGQCGey@aIc>QCB`5`05g0
z)RnIW{CtTo>dGeozg6Z(s4HI`_$Crx)Rj*JeznYxP*?si;3rCaQCGeO@bAg|7j@-p
z0v|8&MP2z?z@IDeMP2#Yz}J=dqON=$;NO+`FY3xC0Y6OQi@Nf4fqz8ei@NglfZrhV
z9n_Vt5BxNVFY3x43H*r?U(}Uv0Q_|lU(}U93i!8W{)@WuM+09+;)}ZSjeuV*^Iz1J
zPX>O9#20ntn*!fR;)}ZS#{hqk#20ntQ-Hr$;)}ZS&4BMI@kL$v<ADEJ<~yh>-yHap
zCBCRD-xBz1B)+IC-wOB-WIl_!@+Sa4P2!8X@~wgID)B{K`8L3>m-#H}%C`mnNQp1%
z%C`f)pTrk+<=X=vC-FsH`HsLpA@N0B`842n%X|lQ<+}jiS>lVj@?C*1lK7&o{3*cq
zl=z~qd^+&E<op%t%6A98o1EW3UHJ^)ua)tDy7E1Ne^=(es4IUu@c+p94b+v-1paY3
ze}%g8y@0<+#slig_XhrH84su{p9TESGCx9H`98pB$ap|q`M$vaF6TE;SH2(cdt`ou
zy7K*j?;`O<UHJjPPm%bduKc;cH<kFJuKanxzc2G6)Rn&g_#-90s4IUV@FOL@s4G7h
z_$MU3s4G7N_>1NI2I|TW1HQh*7j@-_1OKAL7j@+?2L5-MAEB=NDB!zFd{I~a65zj(
z`4Q^MUkdyU5?|Dn&jWs~%#To4ehlz+CBCRDpAUSl#20nt#{u6|;)}ZS1;DS7`4Q^M
zUk-e}#20ntCj!4v;)}ZSlYrkP^CQ%ipA7sgi7)EPUjux)#20nt3xU5~;)}ZS*8#s;
z=0~V2KNa}K5?|DnzY+K^WPXIY@<qVkCh<jG`CEWLUgC?o^3#F8RN{-e^0xs$PvVQZ
z@-u)xTjGnl@^=FNm&}h)SAHh&y(PY=D}N90(<HvAD?bbP&t!gty7Kn}KTG0^y7IGu
z?<Mg?UHLh{e=GAN)RmtL{IL>W)Rli2_`woi)RmtHd<}^&>dHR`{7VvF)RmtPd}WC*
z>dHR_d{2ol>dHS2{M`~?)Rli0__HOxs4M>*@RcOKs4M>h@c)wdqOSalz<(|CBh;0D
z8TbYgU(}U<1^5**KSEvkSAoAw;)}ZSOMqW0^Iz1Je;xQZi7)EPzX5!<#20nt-vqvf
z#20nt-v<5-ng61${5!x8lK7&o{CmL9miVHs{0iVd*6a14EB`*|QzgErE58c(RuW&-
zmH!X$S4n(PSAI3{OJx3wy7C_ZUtQvhy7Fs)Um^2f)Rq4P_(>99)RkWkd_9RT>dJ2b
z{#=PK>dJow{0xaN>dJ2dzMI4sb>+7J|DDWtP*;8{@Es+-s4M>?@K;EDQCI$F;NO+`
zEb7Yd0Dh{(7j@-#0^dR6i@Nf=fd8+|XHi#v5Aby)zNjm|7x*(IzNjnz5Ab{Bd<E*t
zN2;*(r-voJs53+F?*e{@%y&>%J|6gX5?|DnuMYeai7)EP*8sko#20ntYXiSs&R?Of
zd=l_!a{dZ+<?8`IQN{!6$~OT14VnL<uKdx!@0Rl$s4L$X__;D3P*=VQ@aM{SKwbG`
zfPYNJ1M12*1O7XiAEB=NaloG};{kQ$TLAyFoZmoQ`Qw5AP3A|aD}Ms;CrW%#SH2DK
zlO(>VE8iCQqa?nlD}N&JZ_E4_b>%w%Uq|ALy7HZXA0qKZUHQ(yKP>S@UHPuS=g9dD
z)RpfBd~Jy@>dJQq{uzlc>dI#T|Fg`GP*=Vu@Es(+s4Jfd{3kL$LS6aZz+WTrMP2zU
z;6IT05$ekK0ltRB7j@;cfxl4Vi@NgtfImv&i@NgtfnO!_Bh-~Y2l!DEU(}T!2>cTg
zU(}U9ANcJuKSEvkLBQW3@kL$vi-7Me@kL$vA;1?&d{I|E7x)!2KSEvki-E5%@kL$v
zOMw4G=0~V2KN|R(B)+ICpAUSB#20nt#{-`$@kL$v%YlDT;)}ZSR|20U@kL$v$-wWF
z`4Q^MUkiK>i7)EPUkChDi7)EP-vIm?nIEC9d=c<>NPJOOej4!ICBCRDe;e>$$@~a)
z<?jH#vBVd3<!1svP~wZa^7jH?RpN`f^7jM(ti%^}<sSt8Z<!yVuKZl!yGeXeSN;*;
zZ<F|<uKZ)bXGwffSN;j$_sRSSb>$ZTf4{^Rb>*K0{xg{$p|1S%z#lI0MP2z9fqzTp
zzo;w!GVqs3d{I~a72scy_@b`-tHAG(`4Q^MzYcsai7)EPzX^O*J%0td^2<P9Eb&EM
z`S*YyAn`?A`S*dpTjGnl@*e>IADRE6uKa4?ua@|tuKXI{n@N08SN;>=3nad%E59E2
z7bU)^E58BwN)lhxmH!I(w`Bf{y7HTVA20DmUHL7**OK_6o-J|Q3jECyuOC29lelaH
zeWT1rega+V^E2per2kRRmww(3{2MZV{1x=8rQddf-dg(S574zfyFg#5=YK%2F8#9`
z^bF~rJ)o=qzd-*@=I^L0zZduiq(4ztejo5Z$nihw$4h_y1N<cE&$z1W&!5tyKck?3
zFXvk-gWguot5gO3GU?B1pf8qrR&~&K$b9)Q(C?Fes|k9x^iOTjACi7J9Q2KHJX{y_
zj?xeHK>tqWr$>UmO^#!a0=<>A_h`_$Z=+5l(8o(Zpssvl;FF|(P+ubRj%47gOaC+h
z{e0=4rl3C{{c{ZH=gGV;1@r{zpJt#xF8y;X=-<il-f^I}mVRgsy7og$&_9&pI@Fav
z9{4Mye^6Jx74YxMaXaeDp8$MS=}**^Zw>r8($A<X-v;<3>3`JUk>m4J;D<{8w*~!S
z>HiZ!|6Y!}I)HwQ^m9kh+ev?R0)2|~TN>zZ$#HLI&}&OSbOHTCInFr=^g?NGSJ01^
z_MQy-h0@+rK)*-Y+YR*7q`m2&|0Ks1r-I&9+S?uUtEIg?Kwl-t0~w%e+<St4i}VBP
zCrLk?4*WXVzxM*YzVyQxpr0lEkOjIU{ctAe^Q9m9g1$@k<Jq96Nk5zg`c2Xg{XjoW
z+Iu$Wf5?8kKj?Q!dk28NM)ud|g0B619_WeE52(K?$2sQ%KTP^z5a{avBG8|g{y|;&
z!NC6}`)kyd&jG%>^e5`d4*}kheh$&8K-3uu{BzR(sH^{B!1s~3pssu_@V804P*;99
z@bAfS7wXE70RD1`BkIau416PrFY3yV1b(!{7j@-F0soA|7j@+?0e+txpP;V%rNF-`
z$8V@Bp9g%N#20ntM+09?;)}ZSV}S1^@kL$vvA|y^@kL$veBj$kd{I~aGT_(CaS`gu
zj|0BB#20nt#{)k~;)}ZS1;8(s_@b`-1mG{1_@b`-<-i{&@kL$vD}Y}n$FZm@KN0v!
z5?|DnzY_S9CBCR{ljHnJz|WL;O$PlNIqtd!^c3m;LeR%cKVJuWTj|fKpl_1-&W)hA
zl=)5(=$A;p-2(b^a(p`-^dIDS{x;C>lzx~2dN1jRJ3*f%{V)^s^>Tc559n>AA7+8R
zQI6;D2YrhiU(E)+nY4Ef=y}rKxu72=?R^;Z7v*?z9_W>%y^n!@wzT&N&}T|}7l7VR
zj-Q_eJu2;e9`w1=-WNgND92HYK|fB~`zq+m<v8kf(DS9eZ-V}Y98WF--I4ab2YO#=
z@B5%1Chh$I^w;IMaW&`{NPE|S{(!Xi6VNxw@zQ$Gub1|20R4Dr?^mEtlJ;%_{Z%<`
z+yZ)nw0A4$%jJ0HN6@d7_Wlg|5z^irpr0e{-3j{b(%xO5pCawu1Nyge{IC!74$@vH
zp0|tsbh)%Q3i>;8TvrA3>!rQbKyNSYO$7ZT*<aTLy|%Qs4(MFBsFMVGZ|Mirm9Go@
zpR!*@UHKz`|CjU|>dMyxe!J|KQCGe`@NK1^QCI#*;0vYyQCGeJ@TW*zP*?sa;D3?*
zGV01V1b({25q0H{27Z<7mr+-~5%85IzNjnT82CjJU(}UP27Zvl7j@;E0RNQ47j@;E
z0>4f6`=~2_4DcsOd{I|E1^7SZI01F#n*sl%#20ntj|Kj8i7)EP9|!zR5?|DnZw~xY
zIqpJT`4+&BmH48rd`sZ#NqkXP{&?U=NPJOOz7_C~OMFpR{siFvkmDTGm2VCFB8e~R
z%C`Z2xWpHA<x_!=NPJOOzAf<GCBCRD-wybzB)+ICe<JWLCBCRD-yZn?%JCTL%69<1
ziNqIm<vRjDRN{-e@|}QxPU4HY@@c@2mH48rd}rX3CBCRD-v#*B<aii$<xc{BpBy)$
zu6$SEJ4$>}SN>$+x5zvKb>&Y1{#J=E>Ko+vGadM&C0;#1-!ARy33>~ue<tX^pW`@9
zBeB={xVe+ha-3RR*<$JTJmzDUvr_E$%Myu)zk=*IC#A*_U(NH9W4V>BS+DNtvn}_~
z4dH$sr`J7()o1jia6P9D`>)~oZ*RHV`f>eZp4|4{HJtT29`Ckmj`*qT>HRJD+X?Ky
zo~JLgT#>Y^fv3C69sND~Z|LdMt*;*I6<+@<`o=l6Bi+5@ShvOtk93?mk*aRB9oPT6
z1L8vaXX?Cg|C{=-|JeCn*Z-N{ay=V+^(?d{U3ewyvA-`y;g&SM1pnLq6TaLn6moZ2
z-a;sI;)-y6-DAAmrXK1xyvr}FH}mv(yMzC=HLO47>GSzDp_I=1Fx>waGCnU*i2ko+
ze<^DD0`?QTA0y5D@EhBjMw-WX%Psnm_2WI=t<MWom8Ox{eHyNxEmyJL+T-1JZQRCs
zTTgfW)R6kb?%&9@`m{cr$Dun4sQy-R#CG=63H%)MH0!bZI&#d<)%UaB#p7K+HGXFO
zWKVbNbE(uPcE3k|^RtA;b<;??$Gd)teqg<ar@Ma6k^YI@2jcqK`7ZN4J>K<m{|?q^
zrLp9`fv$53_rs&E>@2tX+$Z{cPmec8Bc5bGvHMAqjsNBY*0Vg`U2ct?toQYFcez!h
z{;~T^TtA<zWS%xQmRvt;e`S4uD?6^Am!v+i`%h?CN~(Dn^8<lzM(ca+NbG)(CPsWi
zwrS)dk6&xKTb759|AZ3OyUR=98<oIcNbw3=ufL{H)rsVI^~tl`_glH1!#v&H9-ek4
zw<~tN&-J-5i}n7nJ-lTL`x)W+nP?r||1s7_dAi&GkIHy<Ye7HTb|bqA^NT#*-EQy|
zy{3_eJw4a94|(LUX=JRYyZ#&h$oe=>cl{5M^?ib;yL_*0%un=mmw%!Tk7p`m$>l$k
z?cO!6?A8Cz``FJEPj~q%eqw#9r@Q{sWIesf(_MbY_srko=`Np7@ogHp)ze*mpKNDl
zc)I&W(JPv8{h#r4cYS<H`uRCeclR%YWxc!0(_R0U{l?3^$J1T^{bc>3Mq6_EPO^Tv
zM-z_Y^0y?ipNCxBao-$zzKp|{J-rh33#T{dG5>G<LjO~7N#B0X`fK*haWakP-<w9h
z_H=i>YjisIL)|#{2Y36^rWNZncr6tf@dk~rrjezt>@D}n&scxk)7|BMbSLW+97}FJ
zGo_xivRZ0o^?Zev(=@Wml|BE7;-7Ys#rTbcHjVt(l|8=s7p#Bm>B$xV-tsh!++<60
z9Je2Ck$$M}^@IDQ>pN7%rjd1?AGiKfH?U5Pu;lvhRfF{}UD?U7C1p_;xZ4WvN6Pd$
zEsnN7-*{4<<$jwK&hOjI{%KHHa>v6zkFZWFw<Wip$5PdsMrfmADckDPvnR**D6hTl
zU%tHic-Cp<wzS=H=@NI^xmj}k|L_U>-|5PZ>wn=5tnc!4moNI1^*x^6-s*EAEvIQ@
zpQpQgmiTwP`ndf0tC){^y33DT&w3S4cjNM$w6~F`FSG6Hp7)rq=IO4VWzuhnp6>ct
zF8jNhp6<rC3&pExBzFI^>nH2c@Hh@FLI3+O?tj`iS*maKY}11M)4_tJc(b)=Q`j_e
ztf%Li{znn(Ej)dy>2KV~I<4H6W>{|DXkIQ&CM>yonl{szZ|CXLEjMEf^Bp{Wp_SV}
zo9w0$_b8IKKStdBBJ1u^q2uJyc;eLIQucF_=O;&0$2sRC=1=i--v4oWBcFNqD2%qB
zMsyN=sK+}tu4as4zPqRAh!@9ca0%<Q@>v>W_A$}jT02gT>2FFs&j5Z?9{ZumiY1pH
zEB$$vr@Q_K2!D>JZ?tkv#<HLDJl*Bvr2d0Ie^&Uxo}OubeoACNBRoCX#!q^4?oV=N
z$sIq}-^@BS&QgxqQ8Iog$d>4<q&6~sF7tGE{M<xUY#J%>ba(tbDC6@APj|;pgA19T
z<mvAC=_}*sYEO3~QAx(n6P{jZ<L3?PvZj$jPtUP>p1zvfb-kyj+xY24UDh-rCqIPT
zX~dfsvCgx2OE!KQ3}pQ#PtUQR=ZP*C2}N<^l`8eQ75FpGXFqOlIgZQcUBJ4WL=iu(
z|35{SlP&@OUx}XwJpUWzSI2ou`cqEQ2l#2{vVXal6VN+Ld*^w6GR;p>4d$Qn^tILx
z!)X^w$4j10yCF%99t+>Tb)tE0oybCupK1IRvVD8O(>I&{uVj6H$<sF&|06B8PGqsC
zZ!`V<!tmwRIFjr6s>i$I{G-;azXp1Z?ySGz>F##><j$<W33~swtiKKVw<ogxj;Fi(
z`bUykf6vq1`fNFh^%b7(F89<%tgi%pZ9UdM@O0PDy(h5#A?RPGv;L8%yZ+<SSYHEr
ztyI=O2K~Wytbgk1Zo4j{Q!q3?^>nvBFE?QQb5D1dd-&0;e*yYs^;!SQ(_KI9C0<{H
ze)*})f8*({|A(YqTR?wa+Vvgi84|A_Je{f`DIuBt|K#azefmhee(`j7xlc;Fc7WbV
z;`N)SyMFexV*kH`-ZP!`U7qgxAJ&QWKS3YUhV{Qd|4YW_K2LYswNA#ByH|9)3(d(A
zuZXRMv3bPghV0)xx{T@P$@*2r<K1>Ol={SjeqML>li=yIwVRzW%fr{-X|moO2K+o}
zSL_U~>!)LT_J26=+a!)hc)DB96Qo`BLBCo0rvd1VWqdXSeUq$rjX-a4D%U63)7^UZ
zmGOBD=s7Yzj|KfFS?^ka{%=|D+}Tnrj{is;TYJ3Q-V0=Wrh>ji+SLy9Yh}H2kFsO_
z-;{QB^mw;jKS{efd-`IFFP|c88tDr9Oj+-`fqu5ctGlPW^}k2fJNGC%R-a#`T|I%n
zPS!hj_8H?(lX&$8{*H96XO^eC?RrkuyS|?8w(E5n=lwuGL*g|6^d=Iofu8QRYox^M
ze9)K4_#6cK%J;dR7kT<NJN~)-Fgbta>6NViJIHb1P*0z6xc+d_yW#8Iy)Ur;F&;nB
za=-m2oWJoaUhZ&@cehtpP2l5)k)FQVa>vjCgS+prDvH@#i}_1Eex~J)xILV|f)4$g
zM5<PGeYifq7d;C4)+e~0`JVsXRxm^QbDXDdxBgt7!1bBn>5Hu2{(O%6=UPv9`)9+g
z;q{z1p8Z_u@oDD&6lw2dPj6`Yjn%^aoFeV23GG@adUeoytl)ZH=lOT%^=HumIh{B2
z^jyoGvyk;$J$<STpf=QRZr{3n&9-|9<EQ22+}=ApKN;4piSMz0H>!@~)@Q}@tl#VL
zZhe+M!}|T6zTE0_b^-gJ<LO!Ee*#Sq==j#t-Sz7esm~*xKFb=hXFmIX%+uZV<+sz>
z&wNjJ{rn@#ebUq2dCeQ*=V?!O{fw9EmCu5H^Ci68=R7^d>a(ps>x(>{+)COvjL#>>
zp0mg?y*b4<EG}P<WIr!?ekiPx#tdNn6;F5TIc5~=uX?&$pB=)#?&&VSSNNr#?(*x;
zW<PIxy34<PG3)Pmy31cA?OpEaE`PSv|9ww)`2i2}`n$^08`^xfKTYXtN1A)%zqz${
z<w)K>#P0u0H~rbYT%Z4Xep=ZP(g2ztHHpOT3w8Oke`o$<;0KN4<z{%xrD{v!Q&)7J
z5cqF%n2+6`Tx9%X;{S8tR}5!9cHeT2@jd=x|6c<C8*R|&ye{Z>)2Wu)k=T9CuAi6x
zWPUU7ZDhHz`<z|=>OIVV2mCv9s-<=$cE7aC58K8355NzR@f^Ef+U1Xz`u_xcHHu^H
zNbLEYY)4a7iQ{(Q?>dM1*mFHD|I|*d&u_qAHihFJyYIKq{7<jU+kroT-*GkbvHO8t
zeo!3qe**v9wamxv6L!Z*L6rHuz_*>ueC+;Vm(Tcz>;Dh%!|0SmlSu5o+<dG5In~&I
z#I}x(<BszoH!vT&U)SX~RAs(0@V^QlyN}o9?~7+X9{BCov;Wxry)NHa{8tA)BK;q`
zFE`EVUsd|Q2JqKO|Htmvb@@-})Ns>CZQ#30|Htm*b@^W+%qIc=)>T~p*!{gO|Hj|k
z|Mh_XQtBVOuY11Lzb2h}ZW?I-{6*KW|JeQBF8`H`pQC~AbSjVM*z*p}&3_|0)zu^t
zyWcz2^j$KplEKd$8CS9Uz+L`58CS;uf4XcxWA`(soBs=By*n28k7&JX5{cdC?DGG}
zde;K@6?EK4=PSJNJk|W)aYOiit!H2MAAA2mE#rIBj>FBHBxc$J>_7INkfpYrPdbzR
z#NJonmVJy)-PVqr;cd@deLL~BBUzxg6233!qeMRo^aAmd4f^w<_XGW^v$>wJ_b0gZ
zX+x)yn?z#oJ#h5_{aBB^_rTSwWwRc8?}4k=7ypODa#smo7xZ6cx%EJQOyY7R=o`d;
z?7a%^a%YI2*!vJ%{Uxb??EM3-eu>m44*Vy{a%0ceyZojsZg1@QdRN~~<DpLEcyAoK
zCq8P{jH7W9d;d(1jmTr@xV?6yt+(8C8(h_8JCN%6akr~a4`Kd9;Gg}2$Ki><j}-r>
zd%U}yA0hrb0{^S{=d1jhip(a+ezr64wdvG<lSnk)<#R0aFFAhb3jAqwoX{i^dyc^6
z&ywSWZoq#jeC+uGmp?*|6S@OGaX9;rJ$K;p8-za%_?mQ_&?FLj9>L|`miA@>|CI2t
z=M-Fi+HUUuGl0KWj^EDr`t$#=_x^#E<@5dj-I1-RVQ0sbV6@i?Qi7;K5CqYUni3T&
zyHdS~-5@GUN)UCcL9|1IAghBQNC~1Hghrb()nK$~jW%UeFl~oUbud0gjryL~$?JLY
z@H#oZqc@3^y?^XX9{Zf<`}Kak-|yFXpI^CMrM1t^{>A3WmA<=NKW;uc-Pb)L=X2Y1
zTzYdp$G%`b>)*RE<Mrn|>3;7~IiH#IIKKY=%b>?|zx4ci{r5%d4B>t0@x43e^Y-+3
zz5c$8eBPG!YyI~;%je$das074pL@T=^1uFmjeO3eKDsMjDmD4W{cP%URnF(0qvo^z
zK8}2@N`2OUZ?k-!m+ljOGw0LzT)RL1zHD6DJ)Z|(Wd7^#Nv(R`UY#C)D><LH51Y^W
z??2z?KF8AI^7?yK@_ACaPk2(!=TLh5U4MV7#oK*;-9^cKyE>=eo$g!K->Z`T;U&{Q
zC8z&FGCyy-YyJJ8cK3g8IuCW%bbWqalgz{0?ow4Nm85@kT7RCA^KaR^@pG6TzSQE`
z?W4MWf9kQnX7l+jna_yFbNm68&ucS2;rYDt2TcF0jL-NAxkYmQWbdxu$+)hc)ZNS4
z9nN^C``q<cj6Xlee=F7hZjQe!)&E|O|Jwoc8O`yAl)p5`UzqYg$nh_y{x8q*U%Q9-
zkLUQGru@}8er=Ms<awbSf7ktuUzg)IP4$O!yff9mDaWVpXFhMq@!nSBZ_Dx0eT~oL
z_<Wk@cjfrO<d%POA27$CeRt#U%kjIn89$QaUrporV2-~$jpxHT{?L1y&qs26A@yI(
z@uB;e{$n}bkml#(Ili3we<H_c(*7RH@qbAB`*%71#&_5}|ND%e_WAtW8RMVHc=BWV
z`P!q5e>USsoxiis_&;U5(Rpv`|IZmuZYQOmz3DprmyGNDWi`2<vUk^N#t*x`@xI2t
zobjZ&^z-1~G=4JU$+kcJeEos8-v2G*isyE}Vfs@U?{NJGQ~lR6-tYW9tESi0>*V^p
z=chHT&tK2<U9PXb+w{6RTPl@Zzwd*_znSS3|0~iub2i7%cAEbGWqiv0@0gB@u1c0l
zI!--5jsL$hy{=>LE4co4*JS^>ch~t$zu^A=aZ79We=>f^`7={}sm^~a9r3?BByD&7
zg@+aA&o4MXx;E+f-d%N>PowMmA7=dLGOp|M-*~v~S6i}uiv(|&-uQg#)8poIBgsmW
z?%)23jrCW)(eyXX^qOz4eXQ|489$(YJ>B@;jJG)-Yq5Op%lHu=_Zt;FZ?NxfroVZn
zpK|?Y-?nj_A4~2p?A_In>D8~VCIRo=b*qdk{>J1w=iXiWGp_hwc(w6g%(&wJk2D@V
zHC8H}@OXYu5Kr4(E&j_gpB2}CszCqACtJIXnZD8U_74{uzeC2GoZmT}587?5-_N}$
zJwLirrcahh`uVN9SUk-+{)yzoXYa1NX1v|?|MT<KZcE0M&*v1xf6<Lh|0|jPnESlE
zK>zI2|3Idf{|5{7*Vdc=y)wQ0hrVLGHRFja{d_4|5qo#tH{+@^*CzMB_U>xSxYkj_
zapU*T_?VAZ*Q<>`Fyq?qHK+6cK^brNc83$gJ=xU|hshrwA26SXWO|LuH@<BAp&6g?
zf3omd<CkZA$@x=K{lhXYeRHaRc*dpwMw*{r&v?E2oJ#xqh>R~g|J~16yN}HH9_Q~!
z^<5c1>->^en*LE4S3Jkly7B0Y&$|A@X?=K1#(SOLJ&p6R8818ktAhDZ`bTT`%1qzw
z`aenY^SF%5=XC`>gK6G=Gt<lG;<QfwR>n0y``%#fJ|W|(Cx4OFjVEPXb>k*KXZj~+
zJUL9HpI<Jhd-p7e^JWG5FBa(ET)-bt;Pco5{XhY4FW?VO>(4b=e<!@ZZ%gaXQ!?J<
zd{4@smg5h&vE}XQ8P`0VEok?lY5jRdrq?)rAgwdkW?VimD)4!KvOtpaolGyE_oegm
zcQW4L^X<t6_tWi7@V&d9lj+A?KbO{@=Vn~~*Z%9q$F;{FH=pNcdd;`XpKAOC8E<s|
zze)<--d!)uxcYmm+ZwOtc-x(g|6ayb59d0}|3w*3x|4n$bTi|>pX1Zl8Q0zB^}bx2
zEQGzgUYyf^{4K^`l5zFxq3OCC%edCvoBB=v2N|F9cwVyK;y;ve-HH5Sbv*``rhh!A
zAkX*z1@n1D=A%2@#|wOV3&#BccQT*x%;%&x{+WkZ{IAM*(#`bKSKxDxM7hT`{Npiu
z&1WL>(YVYciQ2pCH5pH)P5PO9@y0%{xS#1?m+3oQf9Izdzb@mA&VT0@tzUnf@iFI@
zHyD3oj=w6+!<#d%d9}a8{NIvs#sAi{UvJIv@2CBm&Uk~j`_F0o@5s1(UU-f9&t$yO
z^{-FI_njG6{8!%G;-Ag&d)(gmdor&0ThnoTZ^qT``!BV2=W_gm>Hgt;8CU%Om7cHt
zS;pn_p)~(TGT!L%U!AV&53F;qpV!^W;+)U8`t|Q={{KAVivQ{ki*q64YWJII{y&oA
zk51S1Uu0bI-#%T}f0c3hT+(m;AI*59$N!x)|3}xk$N%<p{`_^u75^Wk`Tv`YEB@b4
z^S_jFwR>?I|0i<%k_n6FlNne1ZRz|umT~!<OY`~ZjBB0#+087^f0yH5O5^<dj4RH!
zKiJy+hm6brmgzkCOpafZ#(6yB`#o=0rt{<<Gp_i*nAW|2%6M|QGX1<iozE*7A9wz`
zJ6QbxoN>kZ-42WMa~W5hf0Wkw&*%89USs+b8LzniLOLJ5ka5NN*|cu_OU9MY8{X35
zS<UfB-qHA%Gp;ya{!nZ8D;ZauciCtBWR4$C<NVi*E1%u>H~qh7Tyg$Vn$J@iU-kU|
z(>{yms~JD%y!^|?zm{>uS$Dbl|3}6Z=SP0Q_~{&f?dy#HXU5OC|7Ray{OcK4oFBQh
zwfkQgUv~Yo(>Tv$Tyfqo*=X(E^^J@x&fET~`F}Ixit|%xKEIXYFMF-&&t_b4o=)@m
z?TjnV-RZdhzl=|MoL{_!#q*tvYd*Xn&F8s{E6zuz`TTCi73WQEZt?tgj{jGh&+lbC
zSyt)ivIm;}e8v^$%xx^5?`K?bj-+w^PsSBzUz*P!WL$9$r1{j_tLx9H-Z~xki!Sys
zvJ3lPPV>1d<BIb>>A2q@<BD@vTL0@ZzUqc|PwUmi89(Rz^JzYRF5`;xkJEhKFyqSS
z<I{ZVE&28MAC@E}xn7j%HSU9HK7T&rit~-XWcj>t#+N;wzfITs?u;wWkEZ#&NyZiD
ze45XjW?XR&r1`ug$J^3z-;;60`O-9>mu6gXUX`w+y&2c|?n~FvFXZ@r()y{l_tvks
zoKEZfEi=91>`UwXt#W)Z8R)&cZk=(}r8lQ_{x%s`oDWIo=PzblaW<s$Q*VQnO5$hI
zI4{fe%4hpSt=-#YTycIrt@DjJK9tta+h<&HUYxG?J7!#Q-X|URri?3|r>5h6ryQS2
z>wI&@73cAXTAX*uxZ-?nT9@vc<9AKh(cLnxINy-QdH0Mf&esi@|F2}c(dXx7zhnGB
zj-N>N_sa2WQhjTV*T2<#?wjMUNY8iLGT!9ve&h<%KOp06&cFCH<Lw#maDK&a7=Lia
zrT<Ew@s5m3|E+Xg|7ymS&-bSM@*Mv_v-x!9_%l=fupGZ(yXk)|<A*)YkEQkDV2<Cp
z)AWzXxW?;rT9+P~@v{3|oSeTWzt<w;Q_lb3#T%d3yf^jl&h+wmM#>+P@q_Y7ChFc@
zkIlH|!%%_$=aTCZd;H(>k9WPo;#~iJqE_D*ec=t}|G3Qmfd8ZK4H*B;jBC8A>2>TU
zWW34sPfrq?Tt~`ytMeZ`+4waXmrv=TR)?RG@pjk0=}%1m)QnF#e@x1smhmIb&)?Sc
z0~zmg{_dqD54-#a{PAzk+c-aSsn1}}=W|KI_wE|X@t3E3ILABhY5I{IKc6HvxxSI(
zdoM9Qn(?Z~`uLuW<NV}JP5+Xd{)Pqm=3h7cSWbU3nPAEFiX310HRFeJd_3i^$nmG$
z$@Jqne!G;vD#wRbO+S(GG4JnRKgZ_7Ycqbx`Ews-`pJyfJAcQurhk3L>wa$Sf4u+S
zZJxg|<9grW?#YS3-d$4}@4dyEeov~O&bag!J=64W&-kj(r9Vu4W-@-LZq4Uq>GNIh
z%6Qui)_BvGEdF<AT<h+|{q`J1ySh{AUz3+U`&iSzH`8}J|H`WIKg;;;i`M?fC66_q
z_1}A@d_L*Xrhk8?*Sh}Z9gTk|<9ZL`kttuuxZVi5Z`$r(W?cTik&f5;_t$H@_N3$W
zu}nYh@qe%2I@0f6WB1M1zh7*^^;Q`+s$<VDsBiUGn9ut6i%q%DJCg(^_rbGxW)#oW
zHc$RB<8#hG^Hk&O->aT1^Yn9Na=c4^-&dv=|M_9#U(C3Ce&yN5zntTbNcI1karrzu
z)t}1oSEu^*?=hGD&r|)^bNc&UW9@z;<BI3HH2$+0m(R^ozWzPq;yuqYpa0J3-<OW>
z`Ha_je(DEJzyAH;@|nBV`1&u%6R-TX@r!-cmP+FNR~fI*xcvVzjpxQ0m%iyr)891X
z(mx}O=hBQzznuE-%XpK=|MlmZ&-(Y5m3_V6ame^BGJT8d-}cMKZ<X<S@!J`{O^(0x
z4#s~e$G>qe<G0Q6Ym@qX*{=2Pzm|Vpv+>*K^zYhZ{Ej*P*N-s1{=L=mxl0=7opbt|
z-of;D$?@l=ao#P*zyEO4-#y32?`-@YIezan&h_t!Ry>bN<GgoHKc0^7eKOwUd45Ye
zUhCf<r}6rybllrAy~gVU$v?bo*8?-IcK`e`;}6d9Kfb;3jvT*Xnuqo8WtPt$rFrPg
z=`Tz3@M}5#iR8GSya$@&UrCPF$?x~b@rR^w>bH`tpZ{K##`zmL{U0U!kmUE4<oK=A
zIIqa@_aw*b<oBxO_+!#IugdXfq;dA<cqv_9>)$)9{q`-MY5q^h^wU0$f0NdMz8rsH
zs=p@37n6O?WxJl5arxiv8OEQUarv*L^>Z-essp9xnEqKg{^FEBJICLhoKGe1SLXQn
zUgIMfAM<|QBAuTv%(&VeO!Y6yxbzQ9+kJ7yrT;*xAIrG(M^pVDW?cF^rTSN7T>8^#
z{IATo^#7ISc_PQ(l;-nwIevLs&tIS8-%0M9U$*NFIev=)<Llout9EbwWaI1KCo6ux
z)Mx#BW5pkMwdvQtA6ER4ssEp6?Izt%KaWoR*T2uS&H0O7yz#!`+i%;Lf31LD@$rrI
ze|v0We&FpJ^XEUr_HP&8(8DYFwyyMp2OGapj^97k-z3NXD%D?_<6lh9vo76L&Ul?S
z^yv=cx6Sd{RDW5HKce0Ax6AP-JjQrqj$it##&4hF(+@I!haCS#(yvQ*-7&`((&xwS
znelp$e>9EfUOE1u)aTwgzBkFwrMp^l{BvnM_sQ|srv18aj(<CC_kKA(kovUc_(G~*
z|2{aye_5LU2juiGOXGZCj$f7P+jIO?DSt?gfAmGx-?5BWJa1S2zVY?%g%Q6=%GbXa
zMtnNuugLk_^NHp&p5srr+W4z-{97qs|6UmR|Ncu%zy7^2;=ea)d@|?r=~Vyv9RF0R
zKb+$YFEyVx=J?HDY<w!mpO^OQEjfOl<UHllUDG-Kj<jFv-wUJopY%klS6XfBzlZjB
z9&bF^1o=mb?>xbH{ypwjCWafmuU((&^Y2+#Q=WgH`c1!OKKb{iZ<+e*sf6`7@0ngF
z%)bZy;5XU%RQ~;@pG%)3z1GiqOQi`fWUv2#>GRL$|N8rk=bz92!aI!TpJ)E&ZyL`(
zxBP%U<N4=@Z<VaOjh-JaC;8v#`QgPc8P7i_e9iOBC;y!A+`CPme@^%XA2gnSPWUg<
z{^p+(KAQF`e?E29tIX#{njYD6umf*4e$$K}_IdR6WWH_myz9s-jW=ZaN!Q<I%6R^{
z(^4`|HhS*#!@prXALpCXeCGM@zS{Kp=Mw)Yjq^cSJnbIOE7SfyD&sTGPo({QbjD|$
zU-l&P&tE6`v$VhY=i**IW%?&%KFZsHw7>c5BzM1J<Nhu_VPig?u9y7tLZ{Mr^3Mxh
zRWYCZb%{GaW@G>5RG-iDYaYF^{_3<}dHs6|{5uQ!b*uFHN#19*!2h0)+c=)?biDFD
z?<~-NqCo$Q0{trr^d}4SH|X0q&c8{=F@JyLNhxo;*r#8q$^UY%bUx?rk94N%B7Yy`
zvUHy3ujhYn%Hqjihri;n#`FFkDrmPOop1T;^RsU<pZxXtlj*w7$N8y(_+R-Y^T}Vo
z{lRmsPUf%QzAmkA`RlihUpAlob<z7j-+c1#-+e7@H-G)}lWBd<zi0QvRG+_Y`MNaD
z{B_Hxrg7%4TWY+M+t{V`-?qKJmrrif{tz$wKQR3j*>0g!>T+)SE5Vb~)AVC}{VmZ_
zR_~2J4tkfDYK^A{?J}N2;EYFgH^xIfzh!mYeUitLN_~i5*LRc0t$v8>xMcb#L$5k*
zdh*2r|D(>M{}S{!$j%l^rDM>OuQ<2<UX6H8z{mPk??0dPKa<<xX}`pEo!)$|flu;U
zL;5k!yd|%pq#w&eKlBHjTffMA3iQ1N`U>>yZy)sJgU(|fhTvoIsJ|o5Ef3_=@L?Y6
zcCF{(Dd=w_IM>mE0zL}<RQQa6KMlNpt=W?GYXCgC+?#%kKOJ0eS{eUs@Dblp7^lD6
zr0aALdajpi!MVPk2|kth+Q<CKOXwFl^YASA)ZJj+X9#=%@iWit7kQl@0e@6~pAG+=
z(BJ1Eo~`KbbK$=e`ujY@vlaavf&WhE?+XymR`mCU@ZSmjUH>gxN$uK#_4}e7*5BVp
zJX_J<7sEd}-AO-I-(CXF;{xlgj(4#>pD3u?eW=?ng};8onE8x>_Y{n8e*xDMwm+&q
zuV4L3_O3gizkj&J{e3z7cS3*Hucnqtn>D@%F^=3%>bxWF!<C1)Pu6)s+=utNf82*x
zok#ys=(+zNgP!|L)m8H+*Z$w;Gxy<B@Zmmu#(CU_FG0V4)%u6`|Kw*~Z|!ownmi7i
zevGpYG+|wnbN@-c8~ZWt(|W<FA9HSbei+VQ4mr2HkxxK>IrRF?8_DDECGuJ5*PkLN
zmFD12zTn*Q@Jg(&azR~cDd2jO$b7hOpLc!i?}GE#-$nSp3i0So9P_dG%Ra8h;6uIw
zpI5`@g!7oURp&8Iz3~y_)EgYu-}Sp8rBYGd)_Z>D&-pp&^UeIpSDi=w$pZb5=fmQ8
z4f?C|cjK=GpDNHVgY!J7-g(T=Zs##S`=GxZ^LD@UnExi|Iscmr{9Bw`zc^10z=!R&
zfpea;JGc1BS%*1)ScmD~?LM(zti$XV>o9r6ed4_8b8h)(yQ;UQ=kY@0Zu;vm?i21~
z{UxvEx($7f7WlJn^SE#fdh!doZe#6gUY>LxJ6@32a@}VA?qsRN>o(-PZbQ!NHso7z
z-NyWt2km1m59Ake-R6%mPa1I?<aL9e)ODL?ug^BmdEI6Rob}45Lweoj4d@rw%lh5q
zQfb!zf%)@zeK`5qK9Qd<;8o=9O=!1-<1DY+%prc}na4r$^UxRd_swW`C-j%sZMLGn
zZ{1=2eIDZ3ivGS0{ySlOdEI6!`umO@)?Z$?*^2(I{}%dEX(x;?uiI=zf8T}i)jrDV
z?fP%mFO`PY%5bg@4;R$ol>)B!A<X~XX!jKAHm}=EqTaF&&lGT-FPMK(eO~|V@jras
z<|ozPKSUn3qQCEh|4tZRUboq-{vO2q<UX9|3*09w4{;yP^99}~<@o}6)!U8x{88u8
ze++u=w^e6MPkz|-HlK^G+i<@<<NCM{UqZV)&pqbc+9f}Wb}!_*4fm_uzl~yDlh<QE
z#(i23IQ9BXu<`s?*K;g>p2v;5Pds0nb{@|Ybv?)Qb{?vauIHFP`8?v}b(_9|y2O1l
z>)0&xyl$g9AN#B8Jh8v?@Oc&1yY{i_SJ^vu)b;9@_%eKW-hJG8%-f3d7^klD#5i@G
z$L2Gy+wgi0>-JfnKjzQ*dCs}{lec5s$vd1!y{=1GJggh-o+oRU*IhfDn-6&>^sEo6
zOQt6ugq}V+&PM-X=vf~|5D&TPOspHKGwN5p|N9C5GhXjKf_9nDd9+KedSd?e+=4#K
z(37jqME$t}{dwo6XMan{&-Ssrk@NZk>*pTVt6k-x!MWwZ;uP0;z2%ejaMAU~xqgp=
zb3W_(p|#7rY5!yKlOI^?R=V%v{A_h@KAb<A&vE{=L(h50`ApsqJ^crqM}N*|=6?u!
z@~ZPVKS!ObU&_DcZJeL8&@*py&SO50LeF`)1U>ob0{xi+J?As~%lS-Rhk3&JS?@f~
zPtDsnKXqLz&d(|MbAIxA6z8YrkNI%EwIdJQM{)j;cS6s3br5+Y=lr1$=MVWX{F%>M
z>Y@2-zD>Bl<(d2l+U0zkN59CALC@=u%g~c^{*ZJ2kZ(mjG=JrR^^knC>Y?t_#d=sN
zI9?y{yv6z1iac|kXg*sVAa94B^N{nIydQe{3^<SeoX?z}L(r2~o&TtM$a#3k^>KdA
zI*<9BbN-|1A?MW+^yH`EPkyFA&-u*$az2w^NIm2{WIZI`ta_;Nit}w4dEoJa^@qF)
zJ?E8<cQ!8MGtkpV<7;|yjjxS6^LfO5Oi#Y(JkGaxd{iAc=K6Tt(fFDV_eIB&pY3Cu
z=R3S^&*KrF!{qU3&81Ybe%bk#mxWTD{}1aIx#G3wy4SzOuT)xgz4`Dw@i=_QSD?Qf
z=YuDm$MYb~XY20=u<zydF&<AR6P<lb|3T<yz?skE;OpNum>A&vi1F9q{D^$Fb8DC9
zi4E|ve3mV^<g*_><a|zp=ZVd(kNIhVKjYE;EE`AiR@YmcJWuQZ|55WqFPOx6BF=g8
zVdVe%d9pU{KP&U($Eha^m?x^Mv7XGYr7t}X<$PXnZhF>}CFgOyoNylNNpJG+?PHwv
zg!?hplS9z6p3H-@o}6?Z`*q5BT&HK?!+N4RZ$7LWs#mJp<+L}+?^(pUW<AmG9*g<e
zS5Qw>$6}nSW3isFj%`*wS^u`sQuh5YF`w7ZleK~WX`3fHuEgVxxc;>L$s+2>jIV=O
zAGF_#^GEx=IM4U_dW`F(5$lxu6V;QbA1u(17x*8Be*N41l0FvbmkacLr~^OrJ`p(I
zCmI81J)8mmDDpfH&U&cpa#kN$4|V<7IG=mbMl|v^KcK|%(sk)LUb-%AKCGVy;lujb
z<vi9;okyDw>!;46<M{T$pU0_w_>&JfH-GNOh6;T2&497LBk*B=N8!W%^8OCFp39B>
zophhr-^1`{zowkWIH#S*{_1{E9A7@)OaCMAVSg785Bs%<c*u{zhvU2KJofiE{29**
z{K-$ipW}P7z~@wf&uRFuzh~jYew~94d7T%~IKK7HV}Ex$kK?k(c^uz;@MnMbga4@g
zz>U0KyFA_RS^VOx^G8vCrV8r(G&sja$AuWb?rX$6>`&IGeJpRR^IguPzOO)EEzqm}
zn?LLPT!H>5{HgCj9cG>H2WOoh0cV{*49+?~3(h*f0?s;r3Y>MmsQx!&K6AWUFrUc}
zIJdlUUFf)A^Op0!13u)c|8ZS(yFQL@kMp=Ldg0GFb-XZtu8V;JpTPp3A?LBbBk*Cr
zs_-E{1RvJDap$qW6YyuhbX<t*=rH`*U)BGZH$5j1eP-dq@jZfg*spo#=0koIKJ4$3
z^Vr{G@MnLQ;ZJ@X{_L;nf9&sSfsc+0aeU7p9`@@je8_bnFV1Jx|JYyE{}`w0e;gOp
z|2UtE>U`^3`An}jUXJU2?cmI3hx6EOm-85ZH+(D)`t<l;G#|tV{4W+i>-iaQ)<a#7
zwfykD?K$|9pLcG0UVknnKikLRA=i0C^w;}brl)_i`<R~BpIe-pp1jSu^_TZU+nuXj
z9bY@0+jVJcSA5X9`LO;kgR}nYda3DoUAo?n3)U{jUDqotesW!}Fdx<dU6(K)&VOB(
zFdy<J9FJHBnw`gawOQ9!+tDufKZ9%2A>CILz2Efl4fZ*f2kMvMLx1gaOn)VOmY`n(
z*Z#-!SAdTuKikJR{fE|Y?z-8qa~l`l&*FU?@+$OP7o*N?9Ld$M=&$p7)6;(r{#+Nj
z-e`LAMb}$@xn7RK$NaS}cprycb;EqPUXCR{+b8DvJUG{juJ6VCuetp1?&Ew4<9pnV
z;(A<hZu#MQ)OA$Tv!0)FeOyPXhZaBU?FjnIdV3iB7~-4-XFgZJKMnnlTW56r)8b^E
zDWhJoo-{hQ{E(||m=EjBfr2{I3V-Ig4gTb;C){rwbp8L|JkkA{I*hNyFRpoQ*VFzE
z`MiFftR?JcWuEx<QrpSwd|aIK<nJ+0=6znpda{7|#`(MmJ?n|;YOE)#u8;MklFV28
z7-v1vdAD)alX2)-PZq#gPfk0J{W{}3*2#15VLj2l$b48gRIg$^;e2B~(f%jqNBf@`
zr|MXYQ+3Sp!+OFx#^e54me-Fvsv8$lPd;<~Jjvb1{8^bNsuyvdi0e-~?tB*WWX30)
z&1cpJ?f2q5*M2X~^Xu>9tR->=`-Fc)p69_?4^M)#9-al~^}UiGAgrE{w>gjF)$Tlw
zm#){D59{Ya_^^I<!H2xpx%seuR-DKB*$00fr~2VfJ^+8#&!GaJ;R2r#_^`jD@L|8k
z;6pwEANE(*>tcTo!=L?{f<O5*{Mlb!uZ!b5SKxC5KJ4#;bMs-p7U4s#>veH_b-gb3
z_c;97uNC-{pKxye?C;3}pHl@sr{Tl?o`nzlbq+q{x{eq7tLu2Nzq*bW$3@ri;=0?;
z`#3A8KT`#Dej1$PqT@o0U)M2W9`+~WXCKQO&qKSMNBvLJeH_;L3%QTOI)AF5&KK4H
zX3S@fR}1Dd`2puPE?gHnF2p*}0Uxdl)&ICIx?LZ~x5s&07rpRjoH|~ZKkL9ifzM!p
z&ye%j-x2t*Usd>!AA%3-{J8Vj-wF7$Upg+tb#xg1?62y7%-f9Xqt7gSIKD>^5BoI_
zAM&H{VSksL$NnCJKl{53fAZt-XMa`yV}Dl*d~{rh<9i12uwQ54L#`9=IG<JjV}Diu
zW1Oo0aa>gY<9z;ExR1m4O?V%NT-PlvpS=EjA@_0U!}~bo&3@c5e_nrXac<*9-sarK
zi`S)jAIJQ49>x1O<b&|xK7SdU^<UR3tX*E0*7b_qeDmW)Zoc6-!aAVq80N$Iuj?4*
zL*4`*)`6eYeH>k<viw|${Y-!Iv-TTTfS&~C@6SI4{yFG%-O2oU9j1BBKE1EX`Pt&!
z@<!ePJ?|%WLQl^7IOHP*`YQZ6Z%3ggA9o(-^8|c&|M9T%cwds&8~OeYuQ!sf!k_%4
zbITj~Dd-vhY3RvSPh!7VPt0HIw9dypz6Ye^m-%r1@VLPBsN+JMCyj`o^PvgxlV3ki
z))KRdym3D4w0Xihd^w(f(0%h*pLIPs)@Rk#xUb-K;LoEj@qQEQd5_oUSkHTLTwp!#
zE2!uF&SN}-&~u+Q=G@w49u9$Xzc=nY=3&ZtY<I@Ft*;Zv!%=YNVcB`i!*S=<F7t2#
zK0L0iI*;+3f}VNMH^Rrdanvu=8)w~E0^h9T3->uZzL4|yLeAq0c@^uC^>);`<&*qE
zjxXk~I?Uq>Igc-Vu7JlE@>Rr1&bmQ<3VOz0%kjnh)h`}j$QN+F!{dw2Q{p_)d5Uq)
zlSahP<4BWp8yE6}&~tpdpeNUSuysUUEzoN|n4b9@gPvUb4eJ;8)swDQyUOR3b30yh
zo@hRpp5wddddma3=0nt<D$r{_#D1NDp8Y!SJoZcHFKSo)s!!sxkM)c5ME9pm&$_Df
z0^_W!^{8*;+Rw*2)`&XB;|rg2U|rR5$J%B6>_WTbIv!abSXXsCit+Gx#JW1_{xJ_c
z?y$c)?%24KA9kPE?lkhi<I5sA^KcCDu)jL)Si9sa@L?Ww+==m=gr0dA!1020V*#AU
zmql>ajh?mXmb+iy>)i6p^Nxyh>lb++^sF=e(32m6o<2HWM1R!>i-+q=^}+Py)9xSF
z-Arg#>u%0@Jg-@S56{#0AfL?hK5*u_4L)DMzNG?Aebu?$ho!y)dOly#={$~?>U_+n
z>b&VWF5T{9dh+1{{}Jdpj#cP6E~C(sYuw{_aoo*c<8|15;&>f(Zay3@-H$NN?-3hI
zezuQsj^iP4j*IdWeXbvuwLEUtxQrtI92bt)g^UZ=9oI|yTDa+T8_rveV_Yv>UtAYl
zU*v-Y{zJ~AKi3!61=kn(nETi~<bEmERjn7Tqqtrc;KTKD3jE(tuXLR=u9pss7ssWk
zz=!LI<I>~$SjT#u$GlabXa4)3Cs*F0zw#FSRhLZ9{41ZPC!g|m<G4&CPS&wm=W$$)
z!-wN?9zI|2zo&nA{w*GIjtlGFqU&QFYs7wo<IertS1}(d*#F!G*FE~2TRh}b1^%lA
zyo~cB#-saI7C*V}`y2ln;%us0OO|mSPdmZsGg83y`$A*84LI)8hv)U=yFFLt!*S^Z
zXWcspej)3tXx(i!*Sd)P+N^d}AIzV1L-oPdDbG(UzD8^wlJ_|`J?le1^yI1!(O>l;
z`YR8yZcM_Tbz|DO_3LWP+Zn{k^V~V-RyW93;KRDX`N?^;AM=*;Y7g4IdouUh{pWrD
zr}dY-)w#w0ZN#r}F;4$c*W3P<`VRPTd^?@T{2z24^WOzM$FUoF@?q#XPe!08uR_mp
zRKF}9a?O)CzMLl<$HVR)$M>jn^Wpe%f6MP%;eLtZej)o?`dmLQYl+{iaj9j0%W-ML
zeBgR%cOKV^#xbrJt}m_&t}pVz0{<cB(Vy#!>w@cxe9V2~dWm(o-gR0>alI_ShwJ4O
z`2V0@)v~{(kLrxY&vEJTcH_A8I*)m)K+pX5K~Ju{MStZj`l~LPp7~ckO;0}M?Z$DL
zMx3l;v(DqV9ET6b<ve^YN!rdn{&$Oqocmj@3+`{pxxeLjaesS}CRNfn_qX@(J($JB
z{Vln!D_VZ&uj_k}>-jy)za3BYIfwl-`9AE2>EGnseC`RKX6KeS@-FCk9PfsnT+fxo
z`1M?t@m<K9p1)GR%HA>U&n+JF7jLLr6POS81Fhif??3@RTEOeE&!NwJ0Y4AU`P1sT
zwK#b^Z3E{%r^)*r^Y)YCTGtj2`?Xo|Xy0Z2tb3}5HXnGsMfK3;1G(y<=~>?@o=?-0
zk2;V3W6;xI_0aUJZ>oppPkz{atY6%pPla~t{pT6~)9N12_m`cU59^-pBN*qr(tQNu
zoL9<^@k`Wb;=Kxg>MP*XtH06zLdKE%VU8oY;{4x?BYilI<XbV0=C71;9LbBuk#(Nq
z$m<&%mxCCWo2k)+t$<VC56*F{g1-j)nMv?{@K?WV+^Iha{o~+s3Y_scUVHv6@zO_4
z+5N01gX{mN^C98V=}+nPbHD!si}OmvqdI2ik8KhsTK1RmU+=S)$m{d7mWLmA{)`mN
zL+x+lJe-4`^Y94x=P;lDulsM-`ue|~hpmpk!{?9H&)-7b>vV4W7V-+_8~0;<@Zr8l
z;~4j21JHBdHRwF<$F#mIPWr3<ME}F^=e}zS{^VR=+>dE}sa>UL!F}R>Y)=xOeeC#B
zkvRFe!MXX^^Bb3>s^s^^JGc1B`<<H)fA1fkOELY8-G|Smkn{ZU35aJ7_ec0XZ-<|+
zS-ad%^1SSa_94)-F6n&De4dWFr1Lf7Jnr-Q)e{ltRHCy_oS)OqEpMEk)7~%B|D9{>
z-_PLumt61BM1Q?U6a5?O%*}rv1>zia9(~4~N1w?8pBZqD`@HjeCw=00Eje!u{6vAz
zsRExmKR=B=4SpUP`?cSB>{p9(8{a1(Kl^;58fU*6oyUG1a313sxyf4oV?0&oF`jYf
zF`g-K#xv_Y#xw6c#xr!&wRp^*`^iyo?k6X}`JB~(o2~nhcNFmM0^V1^hYENVoa=NH
zoa=h5fFA<qy4Do1{LrUkt-HB(-RV4zW3Tgc98pgy@ZoWx4?g7m(DS&X<B_#XJ`O#7
zbUZRWxsFFRKY4u7@yPV#GwyHw;&Dg&K=Uzw<x$6@c-*N^boMbH9(Q`cua-%on*+ZF
zyamSv*8e4N)_-1S;JBCJ&vnrbeig=X0K6aZjDT}p@O~5hbzHDKaNV)L^wIIu^qikM
zo<=^7Jg~oAY4+ESQ%^zs-Og>?$$OyZeA7IS^Kb-u`cw=2N1^9@8-t!)^Va&yd8m17
z^U&H=*QVXa<{>%f?NcRAwAx=;zsNP8&7XOgN1Ws<&P`9B6VQ{dLeKu5gr5AY^O%Qo
z@G<|aYe^jTu{@A>IX559H|}%DR}1uduP6EpVjglm4uNxicC3YY!S%M{dTY06pMM?J
zZ@=qpe92W;<M<9j&+%owrOyQP<eInU&vDeewRp%iKjZjnewvT@YkV~iZG6djfBfkZ
zCo$^x5t$G7^9{+*_OW=#i}v}dKl0H&U-d^m;!_xR?(>g;bKh9SzMXY`6`b>m`+3$$
z?&rCGI1L}p!(q>Z<^Q*lw;y+(ul>B`=Zo%X`JMItT7Jlz>+JvL&m&r#o1W(p?atHr
z&o~QwrVD(uZ;w95;LrW%iu1VtJn1~{Kbvu1i9W5)qfckSKEJ78pWj@t&u=f-=Qnyy
zu>L*+dF%FH_#gT1f_->H!9KjHU>`o>C)73{IF424aeT*}$8nhgXFg}0$9yh0kK=M;
z@7jDbf7bca1^j#g-;I4WefAgdS#Yk$IdHDWj<ql^__)yP`ZRB-{}uSKKKD7d{FC=X
z&-$<9h3Uz+`nWLT@mRmO|IzWn<`wI|_AT+az<oH63*47-T{NIRUyJp!49@!8g1XB3
zd;px|t9^_0i|tmDpY3D(N{r(;IQQr0z@LdY`TPU-+XoRp=PjQ%;Blm(ApWkkFw^<@
zEVSG0+~x^+5A>WrnzwOYjX+PIYJvYK^xRjBK~JvzNt{>OpV+*zcGb0M_py0J&UrW_
zaiZ0}#rj3A`Dy;lgZ48q4=d;weNLcX<g3uLzbBz5KkGc^;T(L-KkHf&w|y)R<U4I&
zt@&yF`l`olaaZg=$;a}~_XJrF$@|yjss3_5wi+689^c~|hTis*xALDgpKW}}$Nc|W
zocw;7DR3U|j)8OkzwF%l#p@o&om;!)oL8KOoLA(f<loyT`qw#+{;Id8=X}%t-1OwS
z-X7;+Ikc;J*yP;iA+N*mduE?4aS}Jr%a~8r^XEW+3U!j-v!Lg-EKcs*_oGg-uIjlg
z)AM+75PJIP_oPMt3FzrRUBHik^LV7+_htUvhv@zExGomm$Ht56;wb!o=sj8I=411`
zY?CJWEW?MK_b>RKtj>4h`qKGMj8o@3F;1TE@V(lzh@Z#h?zM2!dCqm(<J|notIjQ-
z!<auhUKppp>V|PXk1-CP=fY<SoO-SI=&!nG`Qh~_^~>TXSHDcp_1^34nx0&BEc#cW
zr~jyP({sI#K~FyE-1^1+-eLIgx|Z^6b%315WnOohL%ZZh;LrZfLr=Z}J$+a|$ycFg
ze^0`n{H*hshjZ{T|7@xx{kM<hfqc-p`LJ#rE8r#6J?eYGSx@xbY@CNZYvH8p=o{Xa
zA<irEQ;3KA)w9lR{!p)dugy>Lc8@daJDf+o?!!jCuG>Vtu2)!p8E2>W*Eo;M2ayLJ
zf3;4{pIqzI;^BN#K21-~^+=zpw;TPpVm<Qs%k@a!oy2V)%MXvsb(mK?E)Rh7xI7BZ
z<MISJkEiqCoX@;(!s9Z}cc^c|@q)Y+oa>?uoX6RAa2^*lA1psVYx`ARe>lE2P15VJ
z<gB-x|E#y<+^^Dy`&II-*sq$u>NEGN<lL{0NSx$=_Y1f#xL<t%^xUt08rKc3-><Gs
zsGrvTs_KRvFL<3q#}TXl<T{ST;|q_=Tt_^<(5H%ZO1>4x7xULt=kbM{`#oL{;eL<&
zh{qrEFpqvQ53E1*Vf`Urg+KRoC*e<i*16Sx?t9O{$NZHC)wg&Z<|nn^8$z7lOZuSC
zu>Zy8A-Vc%`6pL@qn`Ux?z{H*@jd$Na~^#<{P-L7ozA1aw?JPh&=1wEb=by{advth
zj2G<>c|6j(ws^?9-6zi59^{$xmg|>3Rp`mLV*Q%G<}KGRc~8<$`&fQ>9Ndll8;^rL
zKJqwt2znj|wa+(y?hhBC=e~}|S?&+ZKJMm2J+J?hbHB&^q2{6aaDS+IXq@}QzP0q^
z?+ZAO&!ta5&+GYGkLG_R_6aiuKB}vxr;qBYaX#PfHYJOv8~%F`4|y5wGH<(`+dLmj
zCXfET{<L*Lz7Kj{r)qF+dh%xIFUNJ=1J2`hrw-@V-<N4JCrs-x_E+oC;%B=&&XRL{
zc|EPaAkHChUQg5bT7St$5kIf9jlqX`IOII$VH|qKKjA#)dD6M%jo04}!-wtuUm5p<
z=oja+#@FTp=W_-9W!^OIF>eF#=X@B15A()4&vCE1KF$Y?uZ;`m1IL&C8s9h{G`?}3
zYkXtBraYcFAEup~58HKIb3OTK_1TZSO`uMeom>9NTcE!b_4xqw<XzCe2L9d9lUJSF
z_`WvL>!bQ(<9jo-tNLScl52jN{&i?q^V9U?ns3(bB-)+w0L<qX(5~j2`H;^*e;wML
zb#8j{1?ZoJ<H#cP<V(&i&etQ(WAM2J;#`Ig`Els~7;&yZPkz$5wR;%to`TOU(e7#Z
zke`A64QTf)^yE5Ev3B2xc6A-b#^u&%SJz=I&*ZvqXnG#^_ar~t$Mod;oSUBYwgGx_
z-G4Ma>rb=mW8G_YZvA=_`qk##d~Sn&wL7;s$vdE*LOwg8C+Bt4H=|wcpRL_rLc6{2
zA+Mm_x1ilV=*f9r`Bt<$1fScY-C_8Uk3c_-cB{~nA98MaejC~yhtKWM?gV_uC!v2k
z+C2<C`HXXG_Z?_=7CyH}yL0d%KLY&>+MS1<{J3*#_fOF73ViH6>pg4JzH|coj)-T~
zxy?87lhD5t@tlI5{ETy(|7@4n?caqs>-~Jn=HV|R9-YToJmfropG7=8e<v^FeC^$6
zw-N2$8SOSXw|2>!p??qBZGoP=&AE-sd(mz?eC~pFJK#g!3H=<}JqSH{k8^AHeP~zr
z<1Ej2L%S9DkoTe8KSjI!(3A80`p?krFnsQgc1PetUWNV$+8u?SeB8P9_x)&h0zUUZ
zyOZ!C*ZIEX=L2YW3VQNcwEID{JBN1fiFS{`hkPFTd9=F#J^7Mz>+grq?lJh>8|^N`
zhx|D7A4a<?(378ZZtea#+C2rI`=H&^@F70~{Q}xO3q5%W*H1ozcI$AR?S5#t9@p8(
zcSHXdXm=0v<olglfBzEg>UxgNll!CHM);8HKA`Cr(XO8Ju{uM}`-6Xlc6EQyd>)8)
zb-l=Z$aTHQ^dCjLx?W^@@^19^V`#U>x%nK0kFIl?4|xUp2O-Wr<cEA1?fx~|9f8ls
z(QXw!<fG6(1nrJNPkz|Bjql%}-6{Ay6h71NA)kSM331LsPrl$h?hhB?^9lGIg%A00
z=NA7b5&sH&E=T+);6twGonky^;PWZOqvxP(+{x?e);1Ux&oRVP@7(6k!w`?&*ESz=
zy{~QhPorIZ@2%;{%V_s+(QYH!eK^`}a&A84dQQXI{X4YF_e#h+-N&xmETi3nXqV>;
zU1*oQ$GPQ=*KPXX!|OBs@FC}Ygjb`#!>*6xtKVasjtkC1tMF%>qs}c(UY8qp9(^VX
zd?w+;{vL)8*Vhz$$Y-Eu9%i8@pLcHYGd~N?V}2Il&paH3Klu{;nV)0uVf@SRAzy)>
z{`x%t>3YF<okY9L=Nb4g4`<OXc?s_yF+ci!0x>`Oy?Jrmce_uFli!QM{OEd=jmtk^
z9d-Koit#HkpZmevps#{I4tn`poS%Wd?0Sonyve!gpA4U7=*fGar%x~R<Q3?7KerEh
z@*(Gz2j1r$hL8EHYopHXJ}>zp_#BrwVe{ah1z!cf26<>oeC=cLJPn+A{zv$fQ}x>Q
z7V;+N|C>D1hj}Kiz@Pc7CC}!st})N#+nHxRzgPDD+I%LjCC~I>p2@c&&*r~Tp2@c}
z&(~p|GtcC;<e5IqGx=8J+59)kGx>Jr`JWU_GMAZW@>=ptALf~SEAnjq>Kf|?`F7@c
zMZttTlh=}G`Y_MrTajn;SJ#+l^6kv?KP#A!XYyL|OdsZ%d@J&7{^}a@Oun6Y{+xmd
zc_yzV&-7uQ$+sfU=C7_X&*a;g=g%vckZ1B*@=PD*nS3kqZ2syR^Gv>-c|M_FLY~QM
z$uoVJXY#Gcv-zuQ%rp6R=9%9cUQTjtAKO2Z*OF)YFwf+bwAHouWH;+P#r!wQGx>Jr
z`Sk_+XYyL|OdsZ%d@J&7{u||)d^_{}1qGALsj|;2o6qF6<e5IqGx=8J+5FWt)(!IQ
z%=5n}n2=}kTJlUE=9zpe@@)R<8uLuPoq7JEf(dyhuO-j)VV=piBG2Zpt})N#+nMK8
z1rzd2UQ3?o!#tC3MV`%HU1Offw=>W7p0z$@|BKaU@>=ptALg07;_cdX*Uj2*n7_Kl
zJd<x{o}Z#%lD?L`zm{k6TJlUE=9#?W?QUkC&0k$(p2@c}&qE3(>1)~hYk4NGCC~I>
zp2;iT?q=rM{M9w)nS49*{452N^tJ5$wLFv8l4trb&*T+vcQf;B{^}a@Oun6Y{*r=8
z`daq>TAs;k$uoVJXYz`-yP0`5e|3#{Cg09He_6pKeJy)`Ezjh&<e5IqGkL|^-ON0j
zzq-aelW%99zoKB0zLveemS^%>@=PD*nY`ldZf2g%UtMFK$+t7lClyT6*RuE5@=RV!
zp6SCplUKam&CIj;t82_N`F7^{UlmN!*RuE5@=RV!p6SCplUKam&CIj;t82_N`F7^{
z-xN&J*RuE5@=RV!p6SCplUKam&CIj;t82_N`F7^{-xW;K*RuE5@=RV!p6SCplUKam
z&CIj;t82_N`F7^{l!8h6TK4{0p2=&;Gkut6@`|^+nRzyUb&Yu@-_AULRly{EEqi}0
z&*Zh_nLf-jdBxk^%siXFy2d<{Z)cvrreKo3mc750XYyL|OdsZ%yyER{W}eMoU1Off
zw>r<v+e8wK-kWPip2?S-$LCa6!Q0fSgq?J5dF#P*yr-PoIFg@+z8m^;&h5Eea=rIz
z@tj7xdT-SDaq#ZsXZytX^<JmN`JahidFXe&#YsK}A3i^<_a)8$>u7fx`YUmNknc<W
z7ux0flH|+qVY_;7(b_$Oc27gkcF#Ju{__3nbIz^5<R!ev^bN#WhxeGso19xbjI#~=
zn~1XmoN?;CKa2BQXtxXPk`Ka%?dp9xi{~ubJp?`5<@<EsM!S5Uj(i3_{}29i;Plsf
zXE8r|@67u99ki?W&TL%B&%ys3+AZOI8Ma%8_guaU|9ZSHL*4+N|Av1Voc@jQ{~r9C
z;7{HPpY!l<2d94r{J#(XPWY4ez~_J9Uje6oAN+p+|9<$B55uSA-xXr@r3y~}arj@9
z=v8MX;7@)8KD*$*2z~?bC2+R8?A+#+y{Ft@K_;IS@H)i9_ov8Dx!&q9eM)s}em0*k
zMm)R0e-2#lH<_MsHn`s6ydmP*@7(4;c{lv);a>s25xCwbitP@d-JeIhgJ_pr@8g)y
zjp2U;?d}HGdpEINzISsIw9EHy$j`(7rtsJMDdv9(INw8Ip7;5CE0*UyXtx3HvygY;
zeVI$)-wVDMybql1_B*$Bk79idIJfa7AA`@$;C~1{`w;&)e8^|u^9%5q181B^;Qw*N
zIS+sG<M6pT{8!*}3&eQ>KICWN(*U3I;Ec2Edn6lo9`E%1N0#SXqFsH@spXlR--~oB
zwA%@PwmS&Uc1N6BySGNWRp-_&`8a&`quohxwtE=<w}Jl@{K@Cw^NaAG2dDo6{C^4l
zi|{8u=iJ_lEW`gie7L_Y`QFd+KwjtE#*y!}?RIYY{B`Ub_rQmIKYU(|<6Rj(S9okz
zu^Yj;uWo`rc{B8kzXf{o1J2{Vy%n7Cv^lpt@V&VX=avV1kFRm<a8v4ZZuundhR<y=
zE<NCUZ>~4^Khgaw!CzdzYtiDQ|6qatQ1G8~|KZ>-J_;ZDkAXA(L&5)R?mr&<#Sg=W
z{!`%ep9TMW%&R%)8kajJ`LNFs=NcFBMfhBXaXAXkc9(+xGkm{$EclDBz=!=h0Z#wb
z0{@c*{%7Dr|FhuqKUcudgY&(@-D~MfzZZb(Nc+TCH}*l#byRk4>yEqydio!59{pRL
z$GX%GAJ(4^_>gzOhjpnNKCCl61)SGssINfJe)Tzz{pxof>(T&xn72Xb$@#wOgpa97
z_rvEiSTAMg77uw7^nBlz*I~$+ANnvq<Q4dD)^kwiuda={|Ml<Tt|h|i;b!HT@7prZ
z<cB=}woZAyYaV>F-goZ9JTJSy&1dpj<}-abpUErU?q=rM{5P7<<lC9&>k9HrUQ3?o
z!#tC3MV`%nqdb#uXP)i7RDH_+7n{%Iwd9#T%rkk#+uh9hZ2syR>jwFD=9%xqGSB3-
z<e5IqGx=8J+59)kGx>Jr+1^Xlr|f^R`Al9*p6SCplUKam&79BXudZ=ElW%99`93W3
zOkPW#>BBseZ$+NXf1^B;Z)cwEy;Ob5{ui6i<hA6PKFl+D#oOJ?`E35`8s{_lcIMgM
zOVy|Bf3ZB1*OF)YFwf)_Z+A2EZ2syR^Gv>-dG0UR*OAwfXZkSD<Xe$v^WP}X<lC8N
zz7JdWd1dpNyp}xEhj}L7iaeYDMtLUR&OAR=!6Z3mp2=&;Gkut6@~z0T`KxQJ8|2%W
z=cg!`kZ1B*@=PD*nS3kqZ2syR^Gv>-c^*<QA<yKs<e5IqGx=8J+5FWt=9zpu^ZYCY
z6Y@-6OP=Y&Jd<xlp3PrfW1h*kGtYdUzntXSK6V@=uO-j)VV=n=X{($2dq2#7qdb#u
zXP)i3dVR|N7t1qwEqSI7^Gsgxb~khXZ2syR=QH_s=9$m)GtcC;<e5IqGx=8J+59)k
zGx>Jrna}ex&*Zh_nLf-j`BvoF{5Q%o`F7^{s|u#{!~19QTJlUE=9zpe@@)R<8tVr6
zcINqO3MS;4yp}xEhj}L7iaeXYy2d<{Z)ct-l3?__LOIE`ee5_$t~l*}<(0S|GQB2G
zpU+<cKLO6?{P!jQ-ahfZr=I7J{`!6;<84Y>^6wA9htF?}7x1RE)wTT$`_=3`_V=)J
zYnSmK2S1K@PJuH&=bYQ|o$n)@cW&*HHz0mKr`H0`_Y_*e*>1aYYnSgMbU3$m$(et)
zJM4PP1K(2^1!ub&7i*XABWPT#U2?sDVS2ugFy;QHCqL@k;$fWn-YDaIPvIo=j8pGf
zSi9d!#!>VCjO(pk@;!KNpY1k+pT&G=24}l1&aGX(k8r@bwM)+TEcl*+-m|d&(til;
zGERPP(Ra{ay=P(VlIwj6^FN1v>3fJ`yZRm?>(_VTKaGBoA3>b|4S#*FQ1oAPz4?C+
z{zu_YejNVi;eP_0d0T})-$ytJfAX{N;d=__!RcSZbNhTBLGO21{>k^b-txfr6!?Aw
z{q=r?<%iGP>-`AxC+GLe@HzY$w9Du4=fK&n-gmHe`MmwS>#bdKeQ%5Pi_hVohd-ag
zud7=tlyN@PJGXZEyuIFEuy)Bi;KS$eyTJJzeh)bN+lzMjyuIFEuy)BO;lt<fr@{Fg
z{v0^l<$DJg;W=l%cR+p$K70>F->+f$<a;Q5Pl4^~`!y`j_WnrOk6Zd44dZ;@MDH(H
z9?19m^YD5PMLq}coIKw{X$R+fC<nnAr`~t4c=$d-x9cq)@*()}J%wTC=EL_9M&Ls}
z0Uy4na2T9%PQm}<sAJRcCtrjQ-%~gWAHI*U1RwHM`0zc2Q{aqqw?A`k^MuEd20SOv
z_Yw9xw>*>U{RQ*kdkU@aXS==NY_}in@_mE>v`an$AHJtB2F`Z%UW1K0-$$5$KlwC#
z_@2TnIQ{irgZcA)gd^}LKkYoer*Ou(`SAJqv+yA=`JUYJ&*z`(z`1{}cP{@YYP~zR
z@il+(2Kdl_KREr%!GF&E8-u@i3w-E*0G$4<!C%kMw*`OkPWaIOAUOSd!1-K#uXE*1
z&(Bw!D{tZh@ZodygWzm;DERC7`QhL%J_;Z9YYd$JhYI}13;YkmhyGLG^q&Uj^Yi<B
z{4H-hFKcjac_SZnZu6PvWeeauFVp##>F<d57wVFq?PI(Noad*%3|@x*PT<YpcLwKq
zSu=PC^mhU80>3MGFZkWS^`5)M-vZ9_wY!6l!sl1ObzWvZ_W;*<nehYQGw``5_!01X
zfiHsJ8~hk}D>%>N?gM@b`ul?Gy?BfBe&8kS!`r}jgWn&#0sH~rd@ufi;0K^@2X6;|
z5IE1*9t_?K{X@WqoLl|x0N=khZPWKnK7;d`vU6K6<W11?eFR?jAn$>mKD`D073eqX
z`FU$sU8}l(d{1H8xs5y5`!YD6pJyH5_l315|K2|4^Hi@<_A}Qh>lO2F&-3e3_P<#E
z$!p0!eVBjpinnX^bF=bq{_0xQ{Vo6GJ0bsl7_YL&Y56CwCI9qc{>dxe?q=rS{5Q%!
z`A*3Hbp`n+uO<KVVgAXtBLC*UQU1wyLjLW&0Da2-7n}d&wd9{Z%s+X>+uh9hZ~p39
z)%~shkne>2+jH#tl>IN3fAU)LPao!=yyER{X8z4zU8}mk<)3^f<e$&gmpx9)KY1<r
zrw{W_Uh#G}GymqlQU1wyLjLW!cYVtK7t23+E%~Pp^G{y!b~iKs=C7_*-QVUv`A*2c
zJrA!>+5cksC$A;{^kM$VE8gyA=HL9)wW|AD{>gVj{`sC-+2geQlh=}e`Y`|G6>oPl
z^Kbqe<)3^f<o~G(GRZ;N^I-WWuO<KVVgAW0-tK1R-~83Js{7mgC*KMAe~N-kVk~={
zmVfeE@=qV;pS<GjZf5??UtO!ZzvZ8NC**%fK_)SlJx<F%c`f;;5A#o6@pd;e|K_i*
zRo&n6PreiK|11TW#8~z?E&t@T<exswKY7L5-OT)(zq(d+f6G7lPRKvMm!#}*TK>sv
z$v=IVfAWgAyP5en|Bdobz7z7#?<-;c$!p0!eVBjpt;oOmZ<K%XosfTij|uZnUQ7Pz
z!~BzPMgGlyqx_Tag#4dWkfk54|KzpgpFYe#`BvoL{MEH;(l`59{U_fE`R^~d{!Cs=
z{^`T~lULI0Z0>tf=D$(?$#+8j`QCKd^I*qc@>=pwALgHYEAnst8|9yTC*=PN3Npz(
z^G{w&{^`T~lW#@-&0k%sCVjJy)gSVmkbnE$VSUQ}7n}d&wd9{Z%s+X>+uh9lr}?XE
zRrk02lkbH5e^EguF_t|}%RhN7`KJ%_PhRnMH#7g{udY?y-||ns6Y{^RAd?u&9;fA>
zyq5gahxsS3c)OdKfAd$@s_t+3C*KMA=lj}akJIu`UQ7Pz!~Bz1yxq;rzxi*JfAXD>
ze|w)=pR)hO@=sn%{^`T~lUKam&CI{~t7}#FxA{-L6Y|gZyUQM@<)6Hk{L_c|C$D(B
zo0)&}-zfj&J0bsk@0<B2uO<KVVgAXtBLC*UQU1wyLjJ$1Ad@-B{FB#`fBG>0<Xe${
z^H<lZN#E>a^@n^X<o|05GKsHjK_(xoKjgLKpFYe#c_nRibFV*`zq(d+f6G7lPRRd6
z5~SYSEqk1nfAVqX_I&S^xLz~^z65?0{J4^kuoZB=cfj`rsBcQzvrl|Jna}z2`D8w~
z&*zh;;X}^n;rX6L<65)%cENwBU2yt0IJe^(^SR%7%yXr{XAJxb<eBq_e9`sx+<Q0l
z8fVMr<#-;x3_X3CoX6+7HKfLwx81I{{_=Ye)UNfHTzN2`SIac<D8q-}cc5`GA9A+K
z??GU@<a}R-K5939KZ4q|eqH77h*^lrkHtgY>hW8@IG+zXHy_5+<=lM8yWzv{$59=N
zd9J{Rc^-fd^E~L>e3*wJaDMN@FgW8JaUSEZI*<7rg%8^ugAe(k0{uAr8Rvv^%Rj%L
zLQ~B8`*@6_=8wfs&UvDDD$QE+*7`-R`4Ih^J)Y>_f;c(82b`M^{o9~_IM#1F^qhws
z&aGYYPUz`>5S)47{3P#oeau6T^O%3mTeiEWpk3uZ=B*4p`=xbi@sKN@aXm5*?3eNo
z+hxBvUj2xN>tevU`H&An&v~wO6xT}?diG1}D30%h>tlZ>;lunN24^0ooX0#&JCEZ&
z<2;W05$86anTL7!lP|!Bc|Hms*0&}2kROK+>)r}{ST|09b6i%PTOP<yLeKb5K~H|#
zc^uy};Ed<2^O(;Da2{XCxesY9&>sM&z7?GNy$<kysP`X|KZe1np9H@O`;b}i|9}t2
zo%@hu(6hhi!MP79CF5it%Nuze_(t!enV#`Cui2zNjI#}#@i0I1>4u(p8w00)2Ap|Y
z1iwA%|1vo9whGQTx!-1f8jv6I{ou@76Z{!J^TRj~LeF?E#ODs^Z;{Uc{27ntq3ws;
z>RpulaTt2`m*Y;KcIY39czVD$>eq$t2U^|7^sMu0Hy+oD^3YolPsMrkVcu8=4i)HE
zoyYZZ9-Mh@$Nb^^>~tRE;rSZ#zX%`t^L^(lF)sT3R2C=O)qBcuT=x6>!tr?5i1&+m
zJmT-6Vx8A}&E`Yi>OR&kk0Tw<<8h%Add>&E2W|f3d=HxQumT?*_xr$k-0ycD^DyAt
z;-t@@bIUXL+ausyU)2IW3eGw+=G^ked>(Qh^E?h8j@Kl7xKB6?AMzRaaQ`q1A0Dsg
zz&XB0;7>jeJ^Qr)J^7;ZI8Tm(GoB^qaa<aFomxKm-uiy$mQQlk8PoIq=q~8V`%nk2
z#&Lfhoa4LCd5lMK#&~p`jq!9A#KU^Xc*Y9iQM)mot<KLZ;^BMrbKuMy^Z9txy*<$L
z`cK)p9S2ztrMLb*0X`ZR%RjmDVDsvU(97R^`1=?ey<PJmZ+C7!{5?g(;QakCBhJmA
zzn`b--2BOP{4#(3ewcCivo1}5GtcZV_iruG_tlVxF8DAHRp+t4qt0W0*)RS+8TO0)
zokY9ruf{!&qt-<n$1;3ghW(ZD6R$&VmVXo4<vee79_Kmd755cW@Zo;@BslfEllf#H
zn^)8y1b+(VLoYbjU4H?e0q1zl7VtT6j^p53m}#7hpX1K>m!N+d;y({gAD$QR`hPd$
zflnVe^DqI<{!SL~!{F?1+2gc%%iqh&`a|B1esSG#p8Tl#^F;smRsU1#QGB!NPucx1
zv|krmPZVdYC*oUCPniD(<c(bYwe|Jm))V^txc)zGJ*j&97AM!m5pb?AUYDT$0Om9G
zL*Un99gTu>9r5>2kuO8f^>w^}uYhxX>G&J_J6F)(Rq$sa{wDY{4>}(-f7TQBmp-f;
z?C%o%+23OYocZ}2_N&Yf^RNf~;&G?!JRWzXxAn{4+pOcD)eUmDNq;{Td7b}{sNd~8
z`m5dT)@$8aJP*Tt7VV=f9&*)Z(_apKv-iu+cgPPow|Vk>%&TtXf&M+tW4pcZ;dx>O
zK5Vxi-1eDe|9QawG=K78=N2cAFIq>jzg5@A{;EF5e2$@A_Ls*Uo{x{aKDJwwf7Qd-
zuEr(ivjzUlgT^c7r>&sB?anQ4FTnUJZ^k)Zlh8BIhYS3tp=W-!bKbrX{kneMt_{df
z)4b*QZuPv?dbD-=5dR(EmQk)p<2oL6`23f?>_2w~u7BU<{LaB&byZycm7p*C&wYW*
ze<^VPF?(Jp`uDp)@wfZWRsU0Z@wy~#`$(_;XdfcIc-@*j)n8Y?p10($>Bs6AdD*%7
z^LX9p-1Ox8pr?=OPxROLTHSjo>W1p)k2=4u#b0&X+T}h+^C#|e*e@QB*e`PCjmKH_
zHy#HyU*d5=<7WA%zv`;xlf2^jkH-<sPxE0sLl`d}*M^;&Klv#9c|00}5B*j5Vt>b>
zXZ#armwXcK^0=nsVC<LXXXH%<?P^?NJ~b}p!#o^7oaF7!V}CWT;`kQTPvyb%%(L<k
z{inQL(=$K&oLl_N=T^*H9v7~kw`+;lc*Sw~zc_C>zFR$SH9u|M^7yjf=d-O-@^;K~
zejkw5o$1LnKjZpR9W&1BW2$4S19RTqIO4H7Ag=K>A6}oIa=me$zfXhne7wbZ%meFB
zEqSP*UDg@(EB04)Nyi2CcM3kdKF@x!zcbLYzpPgrFU^NIj%E1pdK&9I_X(`?<n8d`
zKBN<z`-C3nMf(IB-`8M2qjn=#e~nKT=*i38u8qsL>eu&gjm|AU<n7MQpW{0W&UvnN
zt#Q})AXHtiaTnLRFn`W-%^%|&cg-K;9QU&OUueI&Tp#;Yg^#UA#X0Ic#?Lr8Zy6`!
zpG3QiU*j0#=e*^(l;N|{ytRIDzO}kO&bI^bc_Ze}LGU+$SHY*ixgOsPz6kwWz*oR|
zo$3tuTcNK{`ePsK*EDz;{B7W^;BN=lI<h>o?zODhr|;L0_dB<CnIFvu<IK+#^vuHo
z_=V)*EcDF79`uWOXa;8<c-@$J;Qc0!BgdWntsoxucL<#Q9Rp{7d0gYT&q2@r9tCHA
zIe*yS)6lcOyuZNyYF)(ft-$A}slU6uUsea+wZXcuJdjiWo&r6&>X`Yw2KNif$mjdu
zqjeYcozT;#8=O9U;MDIg;7#C15D(`AeR`lLXS?*_x}bg!d|02$&SQO+-s;s@{rd4*
zdA8#bx%z8*p0CN@^yH1+uIVqw{RNFnJWuR^o<16{=+E)ub!p`@w%ZSXo)-@|*YUUP
zKM(t#Hh;K38F3!{tIlJ;MxkfF#+=7~9dd5%@_cz5KFntsoa3eZn?HHG>tnyz-ygN_
z()U1B-A8#7XZ*G7yHp=6&x~L5Hug*N*7VGC1L7oab{@y^fb%$xnxB?8?u!n(-Z<A?
zuk*O>D$Zk^ea_>27;tX>oack^;e6oy<UFs!pZpN~InRsc+l1?5ekPsAejP@;%>R^g
z>lf$wG<?{vBha(%ErWj)^>!7UdOmMY&VA0u;M11GXCI4``aQcg=8fR=(eugCN6(QO
z=e~V*%|6%e68K*u&K2+<inAboU5B@JKMo)6Z|TG56UfiNpFSnzfqFhC%>K3(#LxA`
zd}@8ge6GTW{;C5}-wgdHkcT#K#@}7Q8P6x-Gf<%KD&VRE7U!qoGgP48SHSm!GamMr
z{n`UP>sZ-&tYeJ-{kZ=%3Loa5`VU=zUj4FmKL-8JLY!Yje~a?T{CpMqTJlp%yFD29
z&m*2g;G7TCv)v-S*00S6_Ln|Csdisb=bcRcD2ktP{@w-X*<a3o`f%M{NV{BjMfwYA
zcRTz0<Id-urq@v0zG$X?{X8rAYx=SM9=YT6KDd2vb&~_>&F7u)+3o+|e8^QFY@bFS
z@feTBJ;tN<?RdoJ{aU?UTaP?mY?gnE`&+y8Z%4a~hwU;C>=$`0{i4s0>;L2Ss~>sb
zbDI;$1K-P=gr3)jH_ONE)A{)#oY!lf+x#KtKIDp@*S}8QWka0oR~7t1`gIt3K1Ztg
zVDpFm8ZVpw_Iyso|GnZgZt?5im;L{%U*gTq^&CsZe^wsM=b~i)rg~HlAM&zuTSvRF
z-_!gwAD*wNU5kgj)qSkLS0T>_!Fhhy1I~S51^jXF83d=k3jTR@K4Iepoa4p!dS;>T
zMY}7`Ek8W(-ktnxAL}o#SLiyn@}}pQ_qkqq6X$h)Uax3`Ki3h@o4B7**DrM3RR`j@
zYkrvzj|-Z&7C*V>iRFRyQ2xd*q<(g;r8CVZ$E6#b<30e+^S%*q>Ny|CIUjhPlk<Uk
zjidF8`S)hC<EHw*$Nz_pgW}9{9o8xHOy1}|HeMHFoi;nyd@K9UYDe=;yv_f=#m{xx
z1<rNa3(h?BfpeV>fm447oZ~wQPW>D>$9EB&`cvTaKMPJh*Dw9~eiQY)E<u0Zhhp96
zO7d$T%QNf77&z<3A?F&$qyF=_|EX~l=lf8s8&mLS-IxadQS-KSE$kBO3Fl$G|9^{z
zT=QA;Ts{X}ALp&~*5B>i&nSLtcMSW7-RKuN<9rG9`(1DSC2w*b{k2XlZ}itXwRytp
ztIC`C(4Xt~KQ%~6o9$@#yNI*HxwT8)2|fJ}f-_FlhZuji>th~zoLj#paKB9TB=(Er
z@;$`QaUpL&oa~pz<>sNk92e?2F65fO7N>E=r~E6Q;_9#Tim%_}R6OECA%5{;=kgaH
z4f?YGJQnog)6Nx-=GhVFibs60K!4P^;*owi=v)2g<3TTeHt0M3=ei`n_E9|I+(%jd
z#dZ8uJmT6%slQ!owxve*mtOpUbJN>C_MiQFvFg0($=ji~cq;C%I<NS}dkgdx=ZZ)A
zfuQeq|G}Ua9}RlV8yy!EkN8Z1em3|^KOgi}k7pt1#dUpN`5$-vDc36=@w35S{9N!C
zuk-Pd|D^lZJ6Ar%_Xquq>vbPQ@rbt<=sSYH^j$$e=l<P6FWw*Yi>@DXu6V?&1^Ut8
zFTL(-C_hW?KN0le`aLJouekn5h(~-e#3QczN6NqWa?r23|M3uy_^F^j<NCACl^^kv
zU*lE$;&sjykNBRTKj;4Yf?m8S=<9u69&oOB#M=w>9l>AvuAo=F>kfMH{-9UA8*;9A
z#H$7R(cmxrc+fX_e<y-od?x5sH;*`1JmQN5`lG>L`sJW+_jry6z4$rkxlcF`J-Ifx
zao<&6w>B|sUR{*bd3|;}w|Par2l}gV-C!T|<olglyVpQph7aRxgb#TWe7L`=_kb<_
zLyX_K#ZSHu`aghP`zYJjkvBn4AMT^bTU;OWd;mW5*Z#`%-|#+~v>p2IBhC)z)-Uo-
z=;_b>E#vHh4|%uqn1>$c7AN!HThK1Y<p+qL`&;q`_^@9b7xJ>}ZQYT#7x)zAP5rg`
zW7i>757l4GGx?DFTOOXNP9|(5w5y@4I@frKk3moWL(r4YLvQ_6z80L@c#$tUSAL{l
zb#DEo{-kroDg9aKEgtPh&p}VF{~z<SKWWcCYFFc`daQQERd+Qm@@;k>jf;3s@Yg!j
zzEt@Uuee_M5w8~bX#c4=rJsP_^3dWxPx_yVQ~ZeYm>=ykm7fD^=_)P4$Hq&1$+_|)
z|6|ZIp0m)KkLtxa=gN=xdFRTHIQN<KDPx~Q-hzFO#na`!2cRd{J~QU02R`Pny4DLH
z@;>P4uYIY;Me%SyX+9Ot|AhM}KjQj5d&-YEf8QN_`1|h2kA*mgJwMt{Do*j!u8;ZA
zzESh1&*MMmdd*w$67~<4ANg}XN!|#(#Xs!++BYgc;?1sCe#8$J_-KEqIHj*ZZ}A-V
z{Pa0je#EQJV}8cqWAUqAAA%3L_JLYo@}GpB@n~PC{EvHnmRzs=h#zyV{D_}+9(~TB
zU5itC?dufhyyvIR4>Zb;xb|H!KiXfZ-3gDs89vso_yOm!-B#!=KWeuJdh?la|6b?H
zgLr>|egOXT84mh6_a6y*@yVcHbp4cb#Unmjpq~r=(k}%4lKU?Pz4(csUvd3O=ZZ)C
zOo9Gv@Rz=H@tUE=ch&vtoNL{QmxKO{>zkY_9`OSO`qtnteMiurbN|ku7w-%DdY|V5
z&J~aNaDjd#_)9+)^n2X@P|%Cd1ikh#bIuiy_(FkxG5AY=Ea;m&p5>qyKOOX~u0QKs
z@raj_HE18r2k|=Rnh)Z8g1+7T_XWLp8}!`gw?j|f;oRyH?+YA+kDZ71dAnWkA=mGo
zwSMtDRKH`^`bAzryF5SbL%WQ#AMKJ4z=!8Y^=oNP^E~bvLp%>6-v|9Gpx3_Gjw9qv
z(9@^cx%HR4#d*xL_LY`5`nN&<ZLckc+MS#JBHZujaBl6AcS28p?c>acadyFnyxV!q
zLyvRo7xUj+&@RX228f^ILf!x$_Dkbp>x-P@Le6m^Zw>y6Px)6q#n~_OQG5gLqj<!J
zgTMHQbNP#p1%26nJ{0ugQ_eLXG|%RpD<1Kq1^OlDibwk6LEq{>uLQmL*`V+ApG(O&
z*+=n+?{=>E#Z~VWkNEze*L+p|mR`Iq=qqUy$$40aN4&d0-{V~V(yJ~i{(krG4|?&D
z;6Lp8G3UyUIL~u!zKKr;fAQ(yUv>YPpch{V`f=Cmd{*&@uN3G{1b^vI1^uM^pALHQ
z63)x4zca4i<6QBG^SqdPo)?oh2md+uZ*i{i6+amCi>}xCui_Ecd9LPz_(1R%9}fOY
z?mrUr;)kHO`-Zpo^Anv%Tm0lYUsgOT?yvhYieLN){4H<dI=@za#C2ar{;Tf46yg^@
z75vY*Ugyh-M_lK{@)xhid6~s2z7OYd#?QHbL(q#i2YtQI%MRy?M_lL2ibuRV_>1#A
z+Tu}N<9RgsaEM2BZ9K#yez-tC72=V8Ht3tYzjHw^&hu-FQ~T0o*DF8bCxXBDYVa55
zdAIqudpu`?UR>wb%72&Zb$>+hi0}8kQ`GBxT=Q9aop(#$<Nht~BfWS>@b7nhmvhA<
z-dmur1b^vu-mQ2B-G4CX#YcmG)%D}f6_5Dg0=>@1)nDm(K5pYR=Kgab9`U2Wf712K
zAs%s_kDI^vYVa379sH-<|4h(}>%3d}oOAsioUd8C;`?!aN3Qd9<wyGFpr3dD7U$B7
z^L*U=mt5Z!;t}r+{^FJ3FFp|T%kDoI^x~sIzv}vN=bAs_hYR#m!C(5>pg-mQb3reD
zH0aN{e%ZO=5kFC&Uk(1!^ZecNul>iFpcmJ9y5^7eC42mwQSpfHcOLa+=b8`FHwS%#
zA1_;iUR>wz@^5l|m+KXexV~E_>UBP@c%;|)we&6SKN#W>pFsRPkDG*^{IK(QUOWvS
zyUwuW?asi5d=`3MXPASYeBQaW%j*vd@L`;b@F716AD;i#`@X~Srkoh!c`o@r=wIcY
zhIF25=iTH@(9?(Kx#TUbk9j@-ANuS3*Yw}@T58gE=r6YQ;-3!x)8-F(r*q2#{SSgO
z&Mx?ncRP=H=y7gwGXFeJXS*Di8zO#=3wZ<LWWP8r<Ym{}x+8Bd@F~ih`fGW!>-jnl
zQGYGZ<U{Unc__L+Zt-X+tFG60iH{*p`X7Rx{0Q{suYAorxA7uhaIXAFf1<!=)w$x7
zUi*FJN9R{(p|?22_at%HC+4TYx%pU}8rS{K)vkCW^z?6np1c!!^Vd2&=v?^`?{cpE
zhz}O{3^`Yv(vL!K@r--@9D|-**9~HRX5nM;A6QFcwm(w4;`7kcU)LE-Pks`5^H;sl
z@n887*L4HsM|`*UPva=A<Er8mFGFwf%=piZ{-@#;Z+9N^(+MAoUv*9ERqcv*L(g`5
z3fiqgZ~hg}|EP22L0sdkJc#Rly5bR^3jY1>KaF^-UGc@BA9lTt&x%L<c!7Q;_)C8>
z=&SC3D(J<}L2vn7_Mgu~Pp<0*%Fnp_@A30Z#V@|!dDNG2eroxVp4StMPr83g(2KXj
z-{MsNb^Sr}P`nFz^Ph459_Lyw;=Rt*FY%EApQ>}s6Y0mHw>Xt|-LF@i;&ZN#>t!B3
z7XPfrzYy9L=k*7+tNZ)0-Lt`e(f!XkSAN9LJ6C?hdELO`6fgUMQuz^Yac=X(;?#90
z-LF@i;$5zf`QiO~Yxihr?W5}kYFE6kpk3X^kL`{_Z~iOpKjB>Y5!d~C<wtzJz-Pg^
z;*|av^p>AC&-*g;<T|g9`O$rLtw-$}&cVm}C0@e$ApLb6K>1NTJbyQzGoGIo_fdYt
zb^l%Y5${I3^y$HQC3!#e7H6;LN9XT~Q(X7WV}8crWB%F?O@wyEdH&9JdHznm82sz~
z_^tDF<wtzU^~#U<sRAFJk8A!&e;#^^M|G-{{M|mvkGRgeV}2T4ulcjv<8OkG<xO1Y
z-CEc3KL9=B=??y7_t$-J<w3l!K+pT#7LW8pLEq&5!-&W9;yQ;?e_LIz^KQi>uJh}t
z*ZH-^MS7h_OW*GPI**oKd?m!M{qCxB#Up;YKz}CmSNiio-{bL=lALIsSboI!J6HVu
zu5Wa%c*I)@^aq@)ztXn{z4q}PK`&kj`l`p%?_BYS4;AQ#gTM5nK|kjHV?i%I9rTl~
zpLMQy#ODk23&CG{eHWYZKjr?%f?oVo@Sk)28Rv>e{Ct64FIsB6q~Be?Hcu4Ky!-EQ
zF1>hj&@Z|EfOEwo-d>>Z2>#M{1^u%7cL%-rV9>9+e%QI<5g#qkj|G3}CxZTz`%ebF
z_>rJL=lTWbibs5@Kz}UwOTQBICExd-2zv2zL9g?}lK-v)#UsAkx#olT9_N}5;`@WX
z!Q&|hy?9&DH@UvUx#AJ;D$sWaf9Weh-{Ss#K`(v?dR_+`hn{@GxgBTu{Mcdm*mc@H
zzMs+Wj<&p!Peae^v@>Xzd=BmM`mKJqhK(2FoQDtj0(^M=(5FfI{Me))Q>-%VUMmmj
zeuI3Ub8Gjt(CfO9?Tg5ppr=oBfq#qhm}gygiS4#Q|9#&Z8)|oM`Wty|G}PhT#)Z5S
zdd7bcobh+ThrHW)%tMcJ>lgFi3xBrDak(+#=eUqJz=!?PxY+t4=eUq_T*zC4zv5H=
zl}~ZyNBLKL>aXGv?+^as1J30yJ{<IA|9K?n#iyKGJj~lP^yD+n<2;;$kF9H6k2nG!
z@_FdFt{0#uKkD4t<$7O&592%rAM$1RaK34LEDzcno0Rj4oa_Dd1?!!>$=i+ooLBU3
zL7c3sT<`SPe6##q<mXCe(e6Ih?oF^>xZcS-p{M^raK@?mZ1a$u>zzJ5?(?J8JM|ow
zOAtTDg<R_(_IJOxYwL^s<+zY@T*zCI2jhxQ`L{ffD?f@y@l`@R;se27e9*c4#Ycj^
z>_1oiPwB<At}PzsZ3cSsS?6)RYh9a<t?R>ne4mF8`GRxPb6qb&Prl?luJ>c`VVukG
zAwLcuuJ_&WnZo+r10QnDAB+Eu(3hbnZz=HC`n7SPf2-?bp4;I=f39EhPU!79z#IC0
z@1S#Qmt5=A+U4(w>T&(O6aL$Hf4mp|9Ip!e$@`tR2A=`vaeOt;Eziu)5d6u9;Zroe
zdX~VX9A9#d?^_DSmz?8EAC52ig^Vx#Ilkl^-xnouHhcd$zT_O=$6y>ezJuVkj4ypI
zWPF()jxYIzjIXX)#qlNQ_`bbhe91Y!^x^oDU&#2<pW{o;@wIiT^Gc2{ImdUWtzYJc
z<4b-a<Ev|raeT=+zV9p;UviEweK@}47c#!|=lGIyd~Ka}6|7%zj_*!ezswKEm;6G;
zSI=n0@g?W@zNcV($vM9C;rNnY$oSHq<4ex*wRL*Sg5$3^$9Jc#U*?D7OMW5adj#XP
z$LG84L&!P4e+qpWdUB30eK@}47c#!|=lGIyd~N+IFRahx9N(R`ewiQjBaX|3jPE?g
zi{neq@%;ew9A9#dFMT+^<QFo&^ym1Jb9`<6-nC%;igSE-+WKXFIKJc;GQJBKFODxc
z$M?g~b9~7;zVzYvl3&R9(x2l?&hfQ%y5#jGu3vGE?@n94%n!$xyl8xte>?x;?_uuu
ze8lrX?dR>h%+|$yeO(N?UgwqKBk<wx4X%Ro_XdxGKMmJ;+QAv8+Kurr4~(-4pWFI1
ze?x4S@r*&wc<P+T-_zdg+~Tp{x3Bm#pT(=L)BM!$)t6rLO<ekM|93Vnm(=?Y$sZ@c
zuLeI`z}u65Zy)n{KF<3F3-}l~{ih1J?mL-3^|L--V!KDdsn_#+(WmU!nIhNoQI_Xh
z<N9aC2h8Rt`H1uAGhM)!3OJurV*Gl(DEjaB*do_+M3EmX(DxPakpiygf1>|vfquS#
zm%O%{57$NC+O$gN)d1G7)}!g44!(?W|84LFj4%D$++XWR>!CgHDgU|G|I|8?z7qJ9
z|9sg0v^crGX2JP;+K+<o!@4^TPW_(5*FF}%eNRn$`cv|}eBd+A^_;ogFQdNM_2SaE
z1fL%FvFmR3QM*&=Pf7cMcRB9}{_^Pz`bpP!1-*Ru9=*k{{PzaE;;97xG57BedbK+c
z^i|jEd3fbV?GFEc?7a_s99MPdFB(%!3E+TfOff|i)0mPN?O#d76op8{CMFTK0|rc2
z>($y)qJNQAkqm|yFvS$pn1?B*m|}`4ri5ZjDCQA<m>;2-M*veoF~t<~2*p4sri4d$
zn8&+!&b>R|xjUns*<H!bYxa}u@qTsZoO93pGk5OXJL9CEHR*Ra`mLUwPWmB}-u8!9
zzx8vElYYXa-|OhNcDb)#$7jH#-|wWic5Q!a?OOeI-M%f~HAc^2M~~Hio5OATyA9X%
ze|)h~qQoHD=__%*I0nx2cKxr`!}Rw4fUAEo`c<ayK|e$NyCb-r`*ro7GJT87mzg~3
zxINkQbvoC}4cF%j@<WEZdhGfHm!HMD0{VZz#L!KjeT2l^<#$H#-H!}Ue<Fe}dsKM(
zfe3y$f}f4xU5^gezcYd#kKjv|gzMQH!B0l;jhBS$IT69vJtjQ;@d)1g*zoknBKYd1
z;pvY?@SfidPk%=Q-*~B?p5xd};5?ts_xZX@-0{vkdK_Ld{e?Y`+v^3(dz|!JP5NHL
zZF<XX|EJr_qtRd4{#A3nKV`SkqdDK7auA$)4uezAQE=+9=Y8Fu===^F|4*9q)_==S
z8E(_teQKwj^p>A9+|BPIWlw+H{4NEjpLYD<>d7KK^J~WgZrnDR^wxjzLdDi_n_tWA
zdDgYNE5fclKe~2rM|zgm9pLo;E^x--H2BMLUb_#R@0qge^|U`se>u*BOy3XA^gN$3
z{qBhL2f&&B6gb=U8WV6^F1CGfeuM3?-$`%V*G9u_Ia<EUaJL-yfpgr;@iWKCcSNMO
z?M3U~iE=rM^ep!_lo#zT1E<}U;7reYPP=yeY2#_z?}*W3<74@R;WoW(zZECF<#v4N
z#?y}XG^d|OjULUJujAlMe-AkGbq<{IycqS0dRBnbZWf&BS^sI*=G(@{6l>dr(PQIj
zIok#O+#g~02sr)Zc$I##9nsG-Mvv>~y%Byc!gVYCwEMl>a<uyd-Ev$FJ@nJAr_<@_
z=Lpj8Kzp(KRCIdw8;2s&9|dRnQ{dEp7M$sqVm#0EE5Vt50-WQPN(7&c;GEB)o}Cft
zcSZ2s;OtkIqP_4vn=8PXFSakH??C;03FbWxf=^;R!}?79ZHPbLAIf^gICLOAc@~`S
z73~6N96Hbsb3WFdcXWNTdpdMdd*0FQXv$o>X>QLuy1kPR=|8HE)<gXj!QOcCHL9L3
zF~9A2PwOGyZT_zHybA4NFZBFW#o6ky=P#{?`~dXu{d$L>=k3sQ*l?|foaejOWB&P0
z=--I?a347DE8P#foZq(NLv5FQvHGn)Iu4wNzZjhLf#*%yU2f9b{_u#Xt?o;+b}i>P
zlXg2I>}J7P-<BFX+Ahmwnc;4EwHvPU%ko+YJuH{Yp@+N&dRSilhU@u%mKW2r-fo5-
zwu?c--F7i#xXu^b#ct@Kep_#~9@hW;&_izPr`s-Uxw&z^9eNml)@R1q)@QAU@jMPa
z<fo7?#`zv_#@W_et)KOLiTbTSwjSF1P`2Lc{PMm}yGgG(>%Z;Kt$rI9J8rc4EoZ%@
z{;ml9tHD{%JH-8(es2vp>ksP{>%)*qul;`=`pFT)wg2Qhp#K*1le?hjXN&!QayRsl
z?}Z-L2U`zyoLP>?k)Hj`U9ijYJpsGqtUv5$PD4M-_g-+?J!`lv_aB<ywjZ|TZaJ?z
zXm=6Hmv-3?v)tLgF`n$-$lKvR<813sv;7k51M8J7ceh^cG5)yq>Hz#?y*gyL*28=q
zh92@G(8K&51!uiFZMZE*+Yi|O#FnGww%pzR!Irz*Kiu!=xAozi;a0!pEO+(~wjXo#
z+kQ-Q))U))b-ubWUp)c4<V^ppi1g&P{%E@__aUQSbG8@i*X?oKj9=*wIqMbM%TDNL
zd$IkG8;2gGr=QlYEqCir#iY08V);(!VY$#Q{jv4m_2*)vN84SC@$C}WCAaNbr@tEM
zSD5tr{to$S!`<};>muy-N7&tLxb~m>i3XvEcHMZkn{;kGE#GPWuJyBAY&_lk+IYJ8
z-DC8)@!V^;E=R_5AMEbK`1t_zFkf9rPd|IXdEIT}tn<b9k29W3Z{w!Ze{+#hs)Y65
z<+k6`ob#6K-#Bl19DXwWNpPk=2hQ~Df0&-*BBtlKo$1dizx7A^&+FX9xSr+pDd&-{
zM!(d9^yK~Ey#Cz;&hx@vaQ0XB`B%DLU8dTdoj<bD_7C>=A?RU$br_ue!)+0q*YE7l
z4@ua(xG_G*4EO3k;&Z3rUi}B(Y3$nc_D{PEx9Kgv8`t%Fe#a<PqSw?_-Oq3xi=7YA
zoav7t{hOfY!S*FFeXxB=9Bg}9==QbRRBhcav7cW9&VIWeoc;U&IMdI9v!C1r&h++t
zr2Y9P%>UdLk^U4o^`8N!eqN7IKgW|y&+As|?^XWkkM@)O{3dYfnE>Z}`%ZACKM2lw
z?7P63{vL4ZzYm=0m!Kb}{>#Ccz89SOH-a<$1UU7tL%+)N;1D?b`CZ`G+0I$T{a^&=
z^YnNg<h(u4gZDuX&x7|H?w$wF8Sb`IuFv6l@M6>d>w3cT;F1W=`vOeAEF%5#2;L6P
z`RWzmJkN4`#rWUp)pA)E_X5P<j<0ka$ak1>*KyO_9%9eGHofI15dXix`LW0Nsn4gk
zg4_EMnlnAmvwM;L!TwDO@WK8~;_zVqCUN+$*1uhheoQ~JYl-=7rS6x=mm)o{qn8=3
z)01D0^t_JF8tz`d_ZqIx3p^ifG+g&@oUhvi{j|H;aMzzf=;u7f5cJT`3b?-RYd62`
z_)Y64-(~);{pYxGH}p{d9>d)@*z0}ox(xF?`%HQ_U;AM<&OF8grQFvcUo3Z9zPdhe
zJTqX@yK%GS?#68d`dJ?)poitP1Dxf)({Q&w*z$Gj1Iw5CZTY(O!IrO^uLH2l`hU=H
zZI|`okl|Vn?b`OP(=*QPCcPWyr0E~5ZxYA{>zl;k!TRuEeOSo;Cux6`H2s71`N8^p
zA=hUqowhc2{G7C&&v*J(`PnKxON}BuE;@|)lNE-$@r+8p9C|pux*U2qj$H))df27@
z{|+9<AEs}{pWU#_evji%TTk5acDu=!JN{g0xI6CcGF-=>*Mn;ecjLbf`sq)<;jTZM
zpr7Oa&CtVk&FjR=a6LEz{p7RI&+EY*5&Cx;?#5vk(lcN7y3)<p9+Tc3|L=t!=IeZw
zV-NgfyRhZuUUzJS|BQnzM>h@w(9iN6gdWCW0-WVoF<k2>-)XpxGs~CdMg6wC-14>M
z<zC;}@^bUF4|aKdx8HELeLYyd5|{_eSK`nfQBPJH?$*yP!`*(k2mHbIEBAxgFFnxP
z?;2CS51wZw5N<zg`|StMvl1U2hyTjw*(DMEVY}h(c;-S&Z?7-(_~Bt{or(2tnekuO
zfASu~b-DBUr62j_dBKj;-1I{cdS)ZI^-Jsd8m>p$VVC|eU%wNPFY=xUy9=4GuP4mc
zBO~%fej()R8wvBZBqCqr7ec<i86#h;w`>>froLV1{lf#@|HUTGy5HbBqNsk!UdQS5
zT>o<i^pM;AUphV4ac#o7FWTK4!8xv=p2M)q{amLb_<rSw{<!t(sNrrL?f~cdsM|$N
z&3fZ|!0G4x;M}Lo{Y~tjxt@^mvE`-DN553_Ep}g=y`I(Y;~-~0ulX92pJm1$eO*J&
zc`*9ZZqi%3?MBZE!>wJ*FL%;+nDiZnTf3HL4cGCf-7ZIu-T$-NaBJ7{UMKxBV|R_=
z)~@C240r9?^P0`?S(9#~k=Cx|n+><=+l<`-!>wJ*2Mu@a4mo;Gn%^TvTDz84ob+eR
z?^z?QUCVbE?%LgHxb^>-`Mt|XYuEBUhTHTf%<sKMTDz9-Gu*Yi-_di}{61i$wQKny
zC;d_L+y33!wfr{och~L_N00UUcEhb*%kOZ~A2h#@8ENfWey8EC-Q$MaxY=^L%W!Mg
z^1Ge%yUp*DMq0a;pEBIFd)jbocfkC<$4G0}@_P-p=_kzZvqoCGmfvT%YxjOf&l>al
zoRQY9<+eYxb~l-HwtZW>mUCYK`whE}(dy|idX}1YY3*8W_chz}Jtn>F&#Ya`d0wO4
zl}5kSv&`tZ+_7u9?dNU!l_tII*R5U4x!;*~dmOt)O<S*H*Yb@{`X%NMn+&&hEgvx4
zJ#UUc&#!SlnlN0)nS9nszsCIDVWhUJ(_6mNaJOFVGF-<^r*AjEcN=N#TE5pwZ_hjX
z47YYI-*32U_kg2kvH5+_NNd;f!%q5T=J#zzTDz7XG2FF#yQAl<DX*i3Tf3GYbJDk&
z-**~m?OJ}^aM$i#j-Hdo?g_)KUCU28>Cc$-rwq4tEkA9zYxf>U&oQItjN#U<<!7Dr
zCrtYL47YYIzu$1z?m0)#VWX$bj7zOu%k92ATMv(#^cS1-)~@B;Pr>%P)TFn1_8L9Q
z9J`jcJLwOa^mad>wQKoGlitm*UFU4=&Kf-(j$O;U9J{+s`qhS8yO#Gv*tPpatla^l
zXN_am@_xtegh_Arl~}u$^ZJ5uw$~Td?i!<Kz_DxjkYjg~Nk3w^wQD)|v(RqE(bHk{
z%sO^0-|3|9G3o6-L~Gab-6p+TzIz-!%Z#4Aj$O<5JLy-N^al*Lb}c_>xNG;2qsORe
zJ8ZaZN0uLT(l0T8xWjO3*YZ0Jch5&Bq30pkzkJGYJzqzD&T!ZNcI@lX?>D!f71-B9
z-i!SyEcXHE(eF96aUL{W$AR2Fe@xd;&25|~OnMy$@=Ao=S;wyRe}`k&@;y#^8|S@-
zTf3I;H{6Z?A?VTXZM6A4Y`D%Zx!s4Q^Q*bd@9nTle$;TcyzX%9+I$^z>{@R36Ir`9
zUv@vQ&abv>xqWV%o8P5Iq1N-$#eRC5Z(ZNW+f91yKi6;Ad}}>?p3mhbz1BnC13i4s
z&l+&fr)@HPF8}$Q5c*Hv4*g;N>wM8}SA^Y-(8Kwnz2Kbp7yxH_d!4B5GJOxye;@OZ
zy@u;J^S-2wn~pR2W~Ar3g+ar0Jt42a?ituU3q90tubW)E_d^fwAKB|B?LX}<Qor>_
z^UL&j*!!j4r)s#?PrlS}9XGDiu;Wly|8kSw&2PKmZah~Q?&fQy;o9y#)xPY<ULU!3
zvq;Z<h&|>&t>?k=^`Fz#ZsPJlFJIeVx#i3D$aXYf^6l0)+aBF|wZo)$>+>GNwcQ_}
z{o4BP)^l6`UAwmaYdvhgw*I^R*y~Qs*-mZ!ciV4|N~b?sKihAw;jaEQhP(M)hxCkR
zzu|7aHX5$&vi)v?9`;KENYD0rp_MQDJ;uS7yBh~v?r!<oa(Cm;{*C2p%iS&C)rcF*
z*Ot4h-<G>uzP8+TdgjZPyPGdt?r!<oa(C@+hMyO5`Ce@NbmOqZa5oO@KiPg+Pgu`w
zebD+@zP3KN<!j5`ZNIj?yK(L^e!Asr>xr8$TTk44*?QuZFY5{O#rp7I`PPoF{$DL$
zJ8swYgyXB#a@z66ne0z`40r3>fZ<xt4{<&{ZMa)+?fnQ>&l%`pd*ry9?T+JW@;1|s
z+;+FfaJStpHr#D@&GaWcZ`$*V_J{3jKH~qQ2jlOJmliVq8&S{Mui9~}Td#&t&+kQf
z*>S0^pZa}>M@+hXM%wqXS#G79{`QFUwtczn(cTAi+oNrFy56!q+IHu*qjSct=3(to
z>nFGE%WbFjeC_JD=W92fJYTcFvhB{zmpzYbyR0X+pLgwEuF~m`+kWjlgXWwMWciZY
ze$P#B<EiIuINxI9>85AgsNd$-O;7)s-i|BW^c)W`{Q%-XJ`urpM)186{9pt>62Xr}
z@DmaIbOb*e!P_F{jh9652kV2hlZl9U{#UCHOC%g^4^i>BTCL}_pJm`{z}vwGz^P{|
zIQ47;kJ7Ue`iGFd1N;VXJ3i6=Z^k?x{TV}g`ZEq5$DawLr$3Y6^rsl%&z~VZ{n-s3
z$DcPKJ^lG}aQgE`@E*i-5BM7JH-Yzq{{{Fa@LRzL!1sc)TwaTD1>^7*q;H2F);HFZ
zeMrwZ{3ST!@HX%s=zlx-LdN0GBI0lW{=|vHJCUAocpo_9VBc}6L(rqY)JM0Y_ai;y
z@OR*>54VA{K70^-z|$`JKLkDmegu31{2#z)!9N1N6a1s#OTgb85$9t_-;VTA_3hJ0
z&p6)+&NzP#ya)P^gEP)w0B4-<0%x4R1kU`fjmYowz~kii`AE<FUI)(nz5ty0-2l$~
zz6hNDUjx1jaa#u-$Ny`Qp8ofP)BpA0^nW8b{oe#m|D)pnr$`^i{|hbt#f1K!ulT<U
zezN`)&|aeA&vJ~?Q;DHxWt)6-zdDWdtcNq;tcSDUJ<ziqob~YK;QdIy1AG(stH1}q
zcY+UrzZ!f3{59aS;I9SW3BC(FPMrS{>D!?vs(=0%(lgFS!5Qa|gZDuHe+OrrKLO4-
z-vQ1ze-b=Se!q<Laq@ct>6zcJfHS}U49@(16`c9K8=U$58aVU&FW_<V`*oy`li!m_
z&-{J^ocaA%aOU@$;LPtSaOU@0;LPv8fyc@3w~;<heorGk^ZOle=J$VsGr!*jXMXPi
zXMVp2&iwv6c%1xxAL--d_YBfAzdrzHet!tg{Qd}>`MnpM`Ta3C^ZOs*aq@c=&O34P
z`#^8My$SRCK(Ehz3G@3vFW=`T%<luGe50-h|69WR{sjF4`>V6y?5}<b&i?8@!P#H^
z44nPdec<e`ehwa|zj{l;{QfWKXMTSH&ivjF&iwuoocaCV;LPu@z?t83;BoT1FJXRv
z4gJjT{{d%ye*@0^w!tp*`w(#E_qV{A-;2PR->CZhR-}(}K3atI%<n_Nncv?AXMP_B
z&ipP0XMP_J&iwukc%1zHCDO;q?<0_&`MnsN`F$if^ZO`p=J(Oy%<mF#=JyhC<~Qm(
z^leBVC%=zDdgk}B;LPt*aOU@M;LPvuf-}FDf-}F%z~kh1Khnp^@8gl4`Tad`=JyHU
z%<pn==J$!<%<u1mGrvy)kCWfGBYm9wwj(|B`($wD_Yc6C-=}~xzbn9*-=~5zzkdiG
zC%=D%^l|cg8PYSqE5VuHr-3uSe+16_J{_F-y&RnRy#k#1jq0D@f%I|my9()<-)Dd`
zza8MrZwj3GO@lMP8F1z|3(ovT^;ZXwK2CmDBR%u`EO6%cPr#YqXM;1pJ>bmmmEg?p
zbHL-|_nk-|C%-wQXMXeG%x@<+^V<c^{C0ygzkdwQ{5}($`Q3o~o6FkdqvtuV2al8A
z7a=|Ky9u26jk?eKGNh+Je+nMQp90d;p8;_C6Lp_As{a2q;u*)EEwD>}#=+^&G<Z*&
zd~~_Yg0nun0=ysTUj@Di{MFzC;Jd(wz~2Bq0lo)(7W`K5CE!u<JeV+^`=OulJOIvk
z9t7`!KYs(xcpd_0JpUG)@jMJZ0R4Xl&UpSkIOBN)obmhz@Hp{&cfxpn1o|1z+rb&n
zkApLwp8#h(KMBrwehQrN{0unb`C0Hdarm2rariv+GY<a)oN@RPIOA{voN@SPaK_<o
zaK_>5;EcmJz!``4AivAn<fHqIL*VV;QTJc|4f+{}Z-X-qr@?!m|2yD}!*{_Mhwp(i
z4rjn8pudcK&4Leu?*zXQd^h+M_+Id7@crPU;0M8P0$&3DUhrk$e+%9Y9#t;?3vuW`
z`d@%|f!`0_1O7{Jmdmfe`;q?F;G4kP7MmYROn?s|U$fvhfbRq!0cW{X!1p5k&EWgN
z$H5PRPl7K2e;@cV@b`nagGZIi-ywYm(q9PeWdQzs0DcaE-v-Wd{2(~X@$bQRLeGc5
zS&m1*S&knDKMXzp0Dc7gBj88DZwEgH{!#Gb;Qt7I0{mm(C&7<`F9H8JIP1?Rz}t~N
zs{Y)8^c_flA++lO`148l$@=sEflna)r@&c%j)Ct)`cH$i{`~*ody)P#;H*D)f*(Qp
z&w{i5{1f;wr2iZ^>(6oU6G;DgaMqvy0loz3zW~nqa~F6!(nr;wM=dsql%W1ELl5<T
z5j>9m$3*Cl^8ZT-^(XcJL_+;h{zqMpd?lg&$00r)D6iiI?*hLRya#+4_!{uXgZG2~
z9{48kCx8!tF9#n2e<C>RPgH#VIbnQ$ANm=eCxJ6Q?chD|^U2_A!2bZ8@p%e3<Ff*M
z0D7JZJ_P=U;Bn&f)r9f64Eh<LmEere)4+S+=O2Nu0e?C;<8wJU<8uZ00Q9T^9|C^{
zc%1m$oiIKf(9ig!z!{%3cn|!{fUg11f-^ojaK<MOJ^($P;6vbD;Ed1L5Qk+*|1aR}
z;8Fd5H}o?;e+<s}JQKVJ`kw{92K-OJ8J}l^Gd?}w1JH9N_z?JWz!{&fBMywuN$_^)
ziHgrv(9ihvf-^pS;62d)T<|sESA#P?Yrq+wwcrEL^E~h&@N2*spKl-zjL*M<w?j`<
zeAYof<MVuQ#^+k_9_YUgd<}R%IOFpIaK>jn_yF{503QP12+sI?6LDaCPJy>WPgH!a
zhknNAh2V_Oi@<xJe-ro`@E3zKJ}&`hd|nDZ06m+*hrnM3&iF)~-@lbGK7R`Rj87Rn
zj@^GtXm<qqX?FrVj@@r3v^x#`wEJ@KICf7bwEGI^r`=b9$FcjJgm!O%e%jp$&iemq
z@Hqbb&xHQG2KwpGYr*NyF7P=1d^e##^Btdi68h7s_`D8rTZaDR&%oQkqx#PW%6k6S
zBVWw#pM%HA?*nCj*&C5B=64Txocume*2lgH`C@+m0z6KBPh))``=1MKJ^!u97xTLp
zJWhTeDEl?ujC?V_{|!7&ejh0N7ha3=0`vPl@HqMXe|7)$zbA~tgZr;#e>eAEFK?62
zL)Cp`^GFg8*nUs*MJA0Fo6Ns8SC5aaen!C29NP|oqqy3Rf<LmVrLFBQ@JEB&=i6wz
zmw?;nZfX8laQpl^%^wH8N&VIz%`cUIdfx}Y9}j*8{0ZRaz@G?ipG&XxKM8!Z39jZ(
z2Di^S*Ze8q_Ic)-KNWnjc}}(Fmw_(_e;W7@_|w7d^S!m6E5MH<{WHMrbFFpy6!=P0
zIW*6JuLjS7?*{J#KLFkheg^!R;OD@f1-|B?@<aRcZ18>HSArh~zY6>ecpvx@Q|Yz-
ztHC#duLVB{ehv8T;LitdGxy@P{_DV(g1-RVu6fhxH-J}={(A6Z;4cEVYgDwJ7lYfm
zdd*)7Zs$}re;K&FX4Jd@zRz?Dnis)OgO|YX122QGHe)lbXB&7w_%Qf>@EgJHGcmND
zQE<CwNAq!Ty9QPBo4_}kPEGSEaJvRx^J#E<FJAK*@Oz<WJ9x(<<cCiG3h-X=SAy>X
zzXkkm@K=MM0e>y{%8TWPw);Bp)!?rO-vRyx@V($~1U~`(Ch&W}Zv|iRNco}tc{6wy
z_*=ktgTEF00QlR$&w#%jyyH>wL)(1^_yqVn!FPeb3;ZtdcY`l~wEWQe-vizO{$B73
z`1`<jgTEjAF7OY4p9cRR_zE+DqW$?0co+DG!FPav1bi>}N5M~ne+>LS@Q;J{Tp~ZT
zKc4{K1O7?yyTLyN-u@V0&!@phz&`_i6#TQ`iyrIi`5bsZ_~*d~!M^~$7yOIh$HBi0
ze(_TIq2urs@Luq*g6{_Z8u&5ruY=n`lGgtX@XH@3KQ#X)cm@31;0M9K1AZ6ycfs!m
z{~q{?-<2QQ?)Sm_!G8e01N=weN5Ov#eir;E;L9(SAKLCu!PkKQ47>vVbMPbJzW~1v
z{FmT8<^oUK{T28|@Lz-P1pf{AQE<IB)PBx^Uj&|gyrj@}_5b!W3;r<hBj67QKMVc{
z@a4bf>whHpAowNVd%^WHH0|dOaQ!S!`#A%CDfrSSND7^&$AkBP>t|Nl&j|Pv!4H8y
z3H%iJlff683o32*Dd1V~r-BcFUj}{v{Au8)!1c3S?Pui^<zL$F72pHl&j8;Co&rA&
zo&jI}`@a4h_-61<@Cop4@Lk}~1m6$-Eb!aFpACKt{7Ue<!LI^81KtOI4*Y8HB~SA6
zyB2%}_%+~N;LitN2Ywy+0Qd{QE8rWzcY|LKegOPM;77n;41Op0OTkZqzYP3d@B(;S
zyC0t-_)_o^_)73?;H$xh!TZ5)1Rn$+1)l{U2j2sJ6Zk>!De&9Dr@@bd&w!r--wu8j
z{1xDfp4{erbUS?|_%iTYz%K`XHFyvBYr!{yzYhEW`0K&%0e=Jd<$vJ&`9|;x_?y6Y
zgWn2%0Q}A1N5J0#ekb@_!B2v}4ZQs+zMpRg9|C^|_!01Tg5MARF7S(2`1;=s-VXjA
z@GSUy!PkJl4}3HD`@s)^e*pYm@DGA#pX&ShA@CjG9|qqG{t@s);2#A)3jQ(hyTCsV
zej5A};4A;o_w$qB6X2f$KMMY7a69>>+tFvhmtN-U|19`Q@Xvv-2LC+xZtyRF9{~R%
z_&wlX0k<!z(|&#xe9cPV&#!^+1OGbsDe!NAp9TLWc-PZ>{oexL3H}}M<KW)~U;0PB
zp6`Kg2LC?zA@Co7p9KFA__C+_`hN^Q0R9v3!{9#yzYqN9;Hxk9_5T8V7x*v1?*jid
z_|hwUJ--283I34Zk~I2z0{kNIUEmJ|-w*yU@YCQA2fq*8zC%{qUA#(v%UJ$VNZ$c|
z3HWC4$Aa$$|6T9{;LE`81b+hfN$@9vw>`u6vmJaX_#c3;27fAeKlo+fv*1qyKLY-A
z@H607fVX$}em(<y6L<=IFL(z0ICu`+PNwVrp%c6-<=gEBp8$U*_+jv8fu9C{Hu$o%
zum4K$e(<ZncZ2tV9|OM{{C@DY;2jy??ls^;;Lis?2!0*-N$?kdFUk7)H-N7JzaD%i
z_=~`gg1;F2Eci>oSLS@XF9RO{FM#g{FM^){FM%)4`})h^J>c8GXTgWT?*P9M{0#Ug
zczdUBcN}~Z_)Xw@!Kc8FgHMCEb@}>dz`MY=gHM3J0{k%eE5T2L-vYj@+qe5_@P6>u
zg6{@@9r!Wu*Mr{={s!=lKlbgu5qt>zP2dN?Zv{UI{$}tc&-C@b1$+(oTfujNzYY8-
z_}jtHfxiQM<7(gTJHhvZzYF|s@OOhRd6uu|J>cuW-wVDQ{C(heg1;ZU?N5CD9{^ts
z{z33r@DG9C4*p^Av)~^Azx>(0-H(C~fqxAA5ctQzPlJB~e0h(r|C8XGz&{1P5B$^M
zC%``ge({yQ{?CH10skEMF7VHT9|Qja_&M+|f_FW~xBF%A3iwyRkAQy_{9f>{fv>#E
z*Z+0!LGW*Y9|Zp<_<i8t0$<td>;E?RCh+fo?*#uY_+jwxf!_)Keeiq1e*nI$&-dp?
z;630!2Csns1pEN_Pr>g7{~7qA=lXVk4&Dp?3-Ai~FTw8s{}uRI@Lz+kxZ1b-8}JeE
zhg>9S^!Fj~i@;BVKNNiF8ejjzz<a?T4n7P12=F_>9|?Xh_@lww*7|lY0bdFJSn$o@
zj|1NWeku4d@W+Fn0e=GclIQvUJP~{o_>;g7fIk`h1o%_H7hU7)e=7Lp;Fp1K1b-U%
zLGY)8p8>xDe91cB?lZtwfTzH_z%$_Mz;oaO;GN(V@NV#f;Lij<3H~hbMbG#Be>V7P
z@GHUl!TZ1m!LJ6N1z!uk2mBiFgW%5xKMsB!_*w85fG@w+&({X<jo{aV?*xAl_)+i|
zgWm=IQt;E@F9W|1ya2xVI^WMC_-gPH_yl+v`~dhi@H@eW!S4gV5qx>S@6RasI`DDu
zo!~ct-wr+nehPdVeCZ2(yEEYZ;M>7>gTDg&82Br}?*_jGe9?N}?yJF<fxi}f4fyN8
zE8wpOzYY8i;HSXf2)=BC@6VgSd%$l6-w6I@@FDQGfbRf*EBIdUw}Br5e>?b5@OOaU
z1^!O(`@r7?zH+0V-*<y=1b+|sLGbs2-wXae@D<nl`ri+}5&Q$-L*O3-zYY9D;3vU9
z4Bqxa-|k1iv)~^EUjzOz@EzbE2j2_+3GhSUp9DV&{weUgz&{Os8vHZh_kn*FeDRC?
z{C*C+1N`&ggWz8P-w*yp@Y}$@41Ns!E8us7e--=;_}9SCfqxx*#U?*r-vI9d|0ei4
z@Na?d1phYpKJf2=9|r#}_#NQi13v-&eeiq0e*k_z_>aIZezBk5AA@JXe*(S+{HNeM
zz<&n57yReohroXUeiZzd;CF%l3j8$qufdnT#Lw4nz}J93WRaxN-<!cN0-peXDEKb$
zhk@@0e>nJU;Ew=52L4F!yTKm~eg^y!@N?jg1z++~KMs!rUjcq8co+EN!AHQK0Dchs
ziQu<`KMDLe_>;j;fj<TOEcjEw7j5?Qbs6|F@TY-a4*qoT9`Gx`H-bL{d<Z-Rz5_f1
zz85?Peh9o1{3v)g_+8-71V0V_Eb#llpAEkFWq#bQ1YZt*6?g}DA9yeL)!>`J*Mg6L
zUjx1q{Q2Pfz^?;84E_S}JHR)9p8&re{2uTZf!`1QV(^Rq)Q{Us!P~)K2A%~kfUf~B
zf^P;dflq*!!FPdg1K$rm41OE<jo`<?N5Ss~9|u1JeiQgP@G0;m1wU@n;48pqz`MY=
zgRcXB1^7<zSAy>YzXkj__^ZKBfxi~~Ecold7Y+FNdOi3u@Hc>84*o{)9`HATSHN!t
zKMek6@H@cY0)7Jgt>E{7zYY9;@VA3sTx|0``o82lz<a>o30?tz7x-@QcY_}Qe-HQ(
z@b`k>3I0Ctli=?MZ`<Pg{{iro;2#9<2mcWGEcl1P_ke!{{2=&8!H<J~4E!wk$HAAC
zeE&ZI-UI$g@QvV~0v`hZH24ni&w%d*|19`P@Xvv_5Bh$79y|;F1@JZCUj*L?{$=oe
z;9mj11N^JtC&0f3zP#-F`E~FP@Na-`0{<rXKJagW9|r$6_`TrY0dL#t`}1A!mEhk4
zUk(0!@P6<gfDeNI2z(FtkHL?E{{;Lr_)ozv-sb!NGw>|<&%p=4e*wN5{FmUjgZ~Qr
z6!@>f7Z3UV{06)O{2>pOH2Qlp_(kBm!5<2KJNU!EPlG=k{NiEXpGSaqfj<&_5d6{L
zd%-UOzXSZS;Ag=f2fpG4-=9mtyTBh0z6<<`;3vSJ1m1h2um36Fd%>RyemD4K;LAsR
zJx>E40)IOA0q`rp?*xAa_&M+tc*m%3Hv_&2JO{oPyc7Ho_%p$ef<GJlUhpfy+sAx=
zt^(f(-Uq%P{A%!}<G!A2z&C+EAN(Nrb>Pb<d_5b$2f?og-wXaC@H@a?41N#zOTjO`
z$+!D5@GkHI_#k)@d=GdD{C4m%_$lyh;EN`Ge}=(3z;6WK1U?GB6MP)}F!)X2cYsfU
z-vd4ke({v==L~ojd^`9W@K=COfWH!a7x*pUw}HPJ{BH2qf}aC_9r%)p@Biz;SAf3(
zybJt|;OoHO1U>+MD|iL`&EUJi-vWLB{H@?ez~2UbC-~dJPlCS#{9f>Pg4<2SdVKya
z@TJp!+};ho68t^j{owBfp9Oy(_#W{0gC7L{0Ql|T9|S)R{vq&F;2#D*3;q%CMK}BT
z{V4b{@Q;CC4*qfQ9`H|qZv_7&_z?J~z;}Ru8hkJKXTT4Ee-``%_~*dSfqx!+<%}PP
zFMw|Z|04KK@Gpbk2L2WByTQK-eh&O=;45Z*f4&aB4*VP7v*6zZKM4LU@Vmgj4SpZ^
zcfi}X`~G|vd=2>bz$@V22R{J*1MoY+e*}In_>aMtzTEfcC*Z5We+oVb{xk4B;6Dey
z9sC#Ir@(&+en0rHz*oP*_w(1_`@nw#eiHm4zb(h=?~8Z%dNdzY{g(dpIQ;l;2_JFz
zl8c1zclaj5?{fG7!`ogd$LW6ZBKWfu{Gs4I;12^I0)II8LGVX_p9Fs-__9~|{yZ9d
z6Zj?I2f!Z-ej5C7;45zN^<N4;1pavNL*P#UKMnpw@Z~#w{Z9g42mWO6wpEkmk>aXK
zdA72u@RDmcRMM%!y0y=_s=vQ*<#W~+uD$a4eH;3(ys9tNT_}tUZz)Yo6sE=|CWpr=
zTMHw7{iV_VREPS@c&Rv2E>!xjDZRV_jm0TnV}GfR#&uoRf&S9<sm_Vw)Kp=7%MImH
zr7$)8@^Wf4krSPMwx&wOF)vfs1YOvWD!7@tCNfT)W7DIBiRsGPnQJ!`Qr+WImC15(
zbj$SC!f>TLS*(mt%3o5Yq2gqrGFcq1Os$>i)1Um{xIVIPL$<J99o#iMK2_LKoGSOt
zY;PMakCrC3JE4u?MJdt??=Jx_N^^TrN@#vt*#==aVGz`jItVp!SbxL%27HhZg!wR6
z2wLYut1H9o`K<-BZG}RqvVEdlP$4ReZYh+eCkvxRjf=&}(ojBI7#S=M4t5oE$CA+5
zd8soE_|Wn?qrx*+=bBdSe7ICl?PPdtTX+Yd8gh4WM0d1aAENt<;jyXmWTkI(bS8F{
z$azJlI-H#9Y=)=$5*(UJOR;a+K2{tp&!Hl+Z&arc-8*`P+?P^4?^LC@t(-2XlSyG>
zvOLij?DqO+*1H*tsahE_s<)1e7c1)YG(OQcvwq9^Qh#Z^>Q-iE)?cGL#$eb(yMtiZ
zy)Lr<hV>iz3hQs^Z_vA7#>KZ`?O0kVZQ8TmLXBV1=ZR`{=u*{TW_YkX)~C*%8!}0B
z)YOY6bXEOHbts1_<0IoU<;lMOnf`0sSV!ln#-Ap1x&BN~Otj1&>S}%GpoVdUZIk0O
zg)Q3)#j!!v8BdH9OJ&tr=ud4tBU_f!NW5W9VA!ArFTqBlM>AKYpVN7Bs<T6V*7lC|
zsah4k0NtQVC5V6g+!Y|c9@h^ku=vME`C;|6zR<fTrl*F~n6Y$Y-%Oi~$xGv7H>-2c
zhKlZQD??t5C=M39Gs(?uF~<GsFg3OxDU6Sm%Bq(hpWW`4tSa|hWqM+yy!Lt5dHreO
z>UGyW=gM`3!nK7|O4Y!v#T(0oEyH7j-q5n|=6>zV;E0H#62YsF=tk`gtLJ5O(1;T)
zA0B8Y>R*DT3kB6Hj*VA_)F`1ZspG94hxT8Su=unC61lLeqR_Li9_6Skhh7zxk~ol7
z7paxuQ5m%Af!6q>8hWTfOr}tn?Teq02tB2$9#e`NhsIL*!nM&AI+d%sV+T~a1$BpA
zr-b&oDm2!2TXPoFS_3&u-fWu5;k;VQs$Ow?uw1&iQkbr6?NSvfr7LQ2WTv=%N;Og4
z?dob(zi4!gqAIN~m2W~}r_r{ycdB=~dvuE$30KtAOv4WP`i5JpZ>H2z@1|O-Zn&lD
zO0CeAa%)}hRKukjQSF-0SnJ(z%e`w{V=5PDX1ax~+mh;Q*uz?Vy;H4LINV}|D#snI
z&T(rMsvI|=uuIJ@OiYiJ)V!mVtLmVKM~fqciE%Z>5U)G-b(9*`k?I&7A1iM+uK0!6
zfIF#9UzNI)lbM(1G}5_JbE-m|Yf>YfLv?Lk<ZSh7L?fM3`D{j2c;q5A#=A$8mrK6%
z@L;~6Ce?<$DxdUF)laJHtayzjtfFW1czt}TuyuTLv=~=UNH|RQ+>kn_pmaCike(2?
zO#N<19o;gOyCFRxZZ)HhZkcM`Dz}<ZN4HQJ#>(4TS+^3aqg$v9iS>jOVl(RK7Aiw4
z+-gQ0-9lw(g<H+2qg$qKWmUhmb+TA03=VHo_he&sfFY&Wls-CUszb{hYf2v-GZms`
zjy0u^j+rXaGRLCz#XGC6OQrN_Slw?bmv8i{RNUh_<hanoqNjNxW~XNQ)Ff`W3yF1=
z0=gD*wu^bFKdsV=`Lz&>3o`2!VmHxDV)B_UT8vvo(^5s%^+{zYQQej{5pi7N3OUo)
zRVcJdSt+P&A***F7YkFr!%Qwn1rIYk&ow+?GEl{%Yg|elRGp>wZyD&RA2nDQ)YGct
zlY{Dpu)cpVu6`Hw61o=Y<Ep%bD%H$IOI?i6SHF^W+31<oa7k`%cvoyrjAO>61-Dj0
ztS8BC@*X(EVBA_-lih{19y#Ptw{E0i#4EH2J>HEqPtQX3#n$)wMc#^GhGT6(dSJ)q
zT%A@6s#kn#{`9Mv!mSLAPfw`@EK`LkwLmP^9W`HvnZj*AN7&4kzQNass_1LPMm0Lu
zJoYw5i<~ppiLG$XT-i0MDm-#_mb8)VI+1HeRfu!uda=>$(m6AWpjD~a)ZxnT&1JQ`
zecPBf)`-`o*1303qc%owM-Nd=YE;ENb%n>!*5?|v2|YyZt5Ma2hjXb-=piahD?Mz5
zS{5}bqnf!Z&O>FaQJXxFw${|BYNDu7#~W7b1k!dn4eJYOGpLa@YLf?YK0HK?tnn~V
zK9TECt8-~ZwZCSxrW>5&IGIZeKP>vnDq=wD&84+Smp7MI)ny8*f#IKQHA-@ErRIBF
zyNQN?EwR`@PLp5RG@H|Tx9D^ax);;)*J@YIWMOLi=$7%3nz|lcY3DfQhbT?nHMHJ4
z)5A9Jo#_KZ6b1U1#Ie)8VTjV?v5QdDgm<P>4e>6ZG_q?n>jl(Y(eUU*DmAJXYi}DF
z-%_lta`kkmnKJ*#7_o6zvZ<>*ea~6#BP)!Q$F^05;$7<LPC9(?WFy-Am5$EJ$>x+f
z%O-1;1xhQrf>zxNE}X2@S3mw$RlUJglg;T0E}3jfS8%;#BdThbBdW!cjVOw!V|t}z
zBkF4XQi~cJQ55A@gX(G*G@4O=Bfixtv#TRpq|GdiY>hT^>S&EJol)J@w@8~=5m~D(
zW~bp#hN&(#rMg(PDQtQ|?;nZ3>A}~bCe&OV^*fuexinWx%-qZ|zHv1s^vjGxTrExb
z6`?VqU#4!h(60!M3H>r-j~4nBp)rPEA%h9+S9weg4NOh1uO*^8HLWI@E}UM2TPBjb
z<*Rar5w5D3HMOcQIEZky)sI(Iku!v7MpJMA(S)Yp@FBUP+LN?8+b35OQK$6KA-S?z
zpVXN?xtb`S8d6q!o;QPr<bKtvvO|WJ=rRL_R_H<pnygz0&!QeIw8E`kGgNSO#q1dT
zlf3EjDwES?z26|-m6(6H86)uUMqEg%9(-$YWU5ggYL1WTgt;ir+N=i-i@Xdrd&O1W
zGo=yrL?ZPtk4kaNNFaET2ixoLt!jgQMQs~Zd#wvEFHeparqnZn%7dx^=3G`%eNa$d
zE!<aI0BS~d(T3I4bFu?uhk=<fNP9B|Ccg=+ijvN#1Ea5ib>C%|loXs@ytUa*tjAky
z;OQ}^zXoO~lh2H*o8z=O&-1X3wFYvSd`8r<nJ9;iTMIPY#C5^j8NR8eQYY5q)hSQU
z0@o?pOce2kYA~%WRGp&DL^*7zPHAg%J+VWLhet-#l0dchus2sHZ7ORgEzOobXRCGt
z3W8S$$rS`H2a+Eiya;IE_`uLV`SF1Pf8E2YWmS^03O<D-@^q=6bm*Oa)bl8M({;;O
zJ%q|Tf2$el=`lGVsUdYj_YB26E-;X2<UsFEKm!LRIm90+s+OXo7&CL#LNkZW)flUf
z?(q!Fl`@sHn}(~~YZG~;o3hvL8$8^7s9Ifzaoru5TSyYhy8TbR%I!Ph^g9X4v(|~m
zbyfWdc4N(WQ>$sNYE*T==?I(gAVgI>7lM6hQ!do1iseGEJ8s5<hBf)!jOyeQc%VvB
z&g01rt6l)sZNRlXPBKe1Jx;>IgFTKpc&<`y><Mu7<IvF47n2mFY(Hr1xmU^UH1>3|
zBz9V{*gT0nKYlV|PV(5U<aTuYl8?-j*r|<QgZAcZEo%N|tT?G3v{xCIheNF!P38Nf
z6Poi#y$er2gH!E89v@A1XqeGVx?!W$Lt~E3qVLNkDxZ+0jdB;QSuHYU+pHG3LzP5}
z8IWJ4&p&e(J+CZMaTDvSgL;XBmjrQB%XL7^)OCIEPsM8JUQcQD{2L>!Kg_SEwf3YN
zLw(JeHqJ4@(`$?)FmwzK=<DXG-Yh~r1-@lx<X!K;x<mJR3aXZaqwIQz)!0pTc-5*i
zvQBI^;qkuR;BY#*-DJmC?FI+YiOnWE+;8n_Y+28ia<Mwvu9wyyV%JMq+uCEeQq$Vw
z920EqagGQ(Q+vaMx|xa|9@ITF%&2#cuX|*u(O8GtbDuU5a~KgkS#=~oP|jNk4)iOl
z>Zy|)H(H*WQcsZ8@9s!)oW2EIy@ORLk4_{!zS>@rne|VU3G!Imijo;k<!q2JH<rYH
z$kbYr!-H)zq3^Y8ijov_#3GAiK2*DJ_wGQFAk-TpB+%vi;|v!P=%_h^_cpGp>Q8VK
z(2O??YpVL<3=Nubrg2riH^BizQ{FVJs_IQ}9MOz3O=t>k7*G#MPSk%#H0*?0!j^Ki
zpnK^ZPLvn_+^5DZ2}+~OcI#`C9anqqOLn}fN7b=n0(bpkV}gTf&wa^!tv&Z8Jl;L`
zB|JQM?n`!XxA(}|247;9q#`x(uCyd({Ao;C+7LF4>HWoht%-WXeiA!odQr_cSI0Zv
zBmL*go++mW=baNYh9+LVktBZ2JS`}Ro!V*O<V#+X*h712U>-ebIqBOS^J~U$PxEW1
zwmr?SJ+vn=6t<(<`%9pskk=+AsSwrnG{0v2_B6kCYTMI1+Y6h`@TO1_v=#k2q==g>
zNwkEy;?0gEQ4;D(VlA~B$&=K{Iqu*j$%>lZuuI#_drZ71%qQ}sMu*u5(4-RC0gy-u
zLuzhBB?(6K?W`nP=!ChCmE`acCmPUFQzos@VYW&pDv}yU%(jO_N*GdeQ?JR8HlRgy
z9sc{+O2w&4^}TBG=RG5yP}%FheXmJf>dGNnms%*PpOERlRBm#zxV<n|o-up)s~Iwn
zZEGuT8K11QttyR=j+V#NKekLwsV8R6@nTdJBiW$Pm!B+8O^;NMx%!2Pj#6r7iv_hh
zcXqg<-=#cNR+<6}#3L7duFG_khRUTI%Y)|itopXT_wr`_jwk*8RrOX;=Z(>h?&wA1
z)saB*5vYDLm>T*=y(rnuUko3TpSA1zFfu%LV|nt5@rlat_}Em860bhy$2_mPFX#Qk
z9yw>Z*Ex2M8nZ4Hc;I$2qjMcP*W+L#ceCj6fIRs-#F6NNOs=m1@A&-hR(LmuzB$Xw
zdHQr;ULFA*v!2vBdQQv1$5$sbJomv3lt<w4*I~{yP+#z@WLIMY9tNJN?dsF*IkAV~
z8r7TbCM)AJrKvXcuQBsa^;7>-5nD4FuxH;A*_WznX~^#oJq>tc-!<8+Hz9f&@W#v2
zWZ%urdK03j0dKrKwZNMYJq>u{<w@=BYe{T^dK&P?%TrKGL$x?WPXpd~u~B=fS`wR}
zo(8<}@)Xq4cx<d5e|)K4!8xhkliaq-d-zJ*RAsU>I-$p*S`-T9$;q+tHq}+BM_=hb
zYB9RS6NQ(I&5R}+PBymQ*?Z9Jv^ShwuV$^Qdy4xKnD-}~k`HISXRN95tT*x*EN+h&
z*Y>9?@x$T!lYD49zy353AHA(#$7g%FIC<WKGk?xB5gGlmfD0xvt#_u0$mkVE7ffVY
z?@R-cF;}kg;u!By4;!)t^<S{>TYtmC^*6~psylO1y%sjldF{)2|FENAeRhkU^02S1
z3O{zvBLffHO=fhiLmN1!^GUrSjwHV7m_uI!-tpPLt?({P-<&%Rg1fK0CKR}>HPhFp
z#sS^M5&g7|%J`&OsMy!ntse8KceZTV-Z$!f=HAs1wBenE12)vHv!D%qFD*YjHl?T4
zM%ApEd#;bHvd$j0n5OhiApNkGZDWP<Y^6Lork;H2SxpeRn5Oc@iHY*qps0^I^;o+I
zWu{MUB}o()cO6M`4Z)=(iI1<Y{tB$EOPY<EUD~ClBavJ~FcSXpbJms`&s79dF=|;z
z!NoZ&=wm!v5k(ZoTuts&RN@@x<}T)8!QA-=1sha!*Ir$5Bo_o>D|15Iv+kDE_*-3C
z>0wlGkPyF<s;)%yYX9h#(K&lhKeZ01P8~a!<`%44+!)wV)UC2$p02!pL#oh!P4D!E
zT%i%Y!9}~x>aAH0Inzg#-D>u(qF=UFQ9WNGha*;N)>U8s>4!Bgs}-R0>T}EV*LprY
z&z{%SA0yl~w|&+9XZ0}pIw5aFu~}>|ADU$a!aQh}oAL9Y*xaF?56$wl!aAD$DKvGC
zougZ~9bRCJLET<=m#p)so)v@Z@LQ%eu%13jYyBErbu+LgK1yHQfU1Y$=-H+Q-rH!d
zV<V;;)+adISRdqEon$dy%Y3Nro64zE=kSy|56^7K6#C<5A{895%=FEzDDwIye{;E{
zFT(oO^-^G$oW6k43+tz*#tZ(nnsRd8XhuC*v`@d#)?9kHUPl|_Qy$e=W&JhUNJAHM
zeX)&3T<k22ZFe~8UF9r{X}5x$zj%8WGz*hyH{J_qIvDR37@q6u&o)(WU#hw=YA(8S
zSqg1F^J>s7L+@I19y1s$xcRmgeqlS0*>l6`UEI#2y<j+7U@drc8vEoD`vl={SMz%3
z*vC}|NP)qj>SkkW@GX1Y#oU+eZj+xowXfQ%&~qn_$Vp1&WUj8kx8aqto9#J<)p`Wh
z>f6a9>V~(voG;y|7E#`)p71@aL9sYl8p>x2BZI}k!LCBFbW=f%RNX&htA7aAwHP^Q
z<$TXb+wj!P#N_Z;rQrQ@c5ryxu>2eUobjpuubGMIv64A#WPGMPsWhlHOZK0`Q}$n#
zar-Z2Yg$bmo0RsS!&CNO74<q7`LkL;FuQefRH;;J2+Y6K(WNo9qClWZJ5v3p_b+vf
z-c>1oHvdw`Y#Awz-6(LY_qYNtqf-;=0p(WH$e{X{N?IJ57%HlNCMuG7xwL4&hn8Pj
z#P=c4PjpXDl~r3%kALrTHN@^n*I%PAa<ARcQOH?MbM*=V``*x`=I~&V)^kKpEU8;J
z6?GL-(AO$zu%mnlI+RSKx~x$zrt36H`y5sEFOB_;%4(IQx`0zl$*0OXz)22Oiw$vT
zp>XrmnAi5V>i(;3)!2BYyz1&}ufM|U(|pyD(b8cu{c2%LajL9;Zylc;EmjI!N5+el
zzJ9%&{Dwv}rK_4$-z0jr#8RY}+3Pj#{>!178F=*Hu%WB4UKtKdHbe(R6|=e2mk3n1
z4XoYT*SAqkQ<v1`Y)kZ&TdZ%e5q)WO)6wR4dQ9JZR9g#Fft9yS7DxQNZ>R3zxWP;#
zn31Yy8&e(6@5+2CA8kx|oS=*}raE3wZfHok>7u<E0o|2eQyQLgpl8$T%RZYvZX-+;
z^jetmb{X&KStIF``ub<qZ%7wZ3%o&3e&q^Y&rqEg>)Rqdh3u&EI<(G-VnyFe@0*!v
zrWeu2_7(I5<a5=xUMR4}lYM;~UQp2OVO%Y-Dyr>6(d$@J54=p3M~c<6Q*@6R$d|Vo
z-WFELFDyOV&B9V^E9NMyQmL83+OV#m{%fREE-de3g+DlQ($k}A<fIx%ti~y08av+d
zj*8htZR_?7b`(^jjAc+vne;JD`3=V#sH>M6sdYca%8<GW86Mj@Zt9V7s88PxH}7~1
zb^z;V^gy8Txnp%`x7Pz)X?lRGY!C3f!iMJ+*2g|8`uXv$W^3~!4dc9KsFB?0($TM+
zYOHih&6SSom*u}kJlEwA;(6S1Xo>6EZ+j&W+1KhN1S-sh=?T5>bFAQ9%TM{kwB&0~
z`-azVRLxO!&Nr}o-dO1CYlTC}FKOp?DBd7Gv`=j2j1sGF3wEZ>nTy#qI=ygnHs>0=
zSVLwo*PNjkJFVrOpBnes_qg|^w#8a4Y#a?ga*okipvpLJpYO|Tncixx$JXJzk1no~
zRJw5Wy6c{E<+?)Q+CnO;Uuw5jowTa!ulk<XJGMoQ;QQ8ZEc8yOw%erQK*sx?*Fw$y
zOs^U+w^VWUk#8+ltfsW(nQkrC>tCR>G7QxTcxPc<OJnUD39ho6A0vUABJ*P+xPE4y
zYy?)*%#V%00-Kha@Y}7rNNZ(<^=Cj^thm~4TdWt)N|TXQ*b?2)%?f(0ODjWHT`GK@
z{qUc*cAg!<<I%*EuoYPgS2T^?LTYIh@%NXW=YXKqB)`$w(vVbJ&3X32Z#C!H5ww~H
zuFP8Ap?Na~dPb%@to3>xx;wO5-Ld+u<~#?)%vpK2<k!l2@|L!RfPQ&=-2Ca6CE)X?
zUmkE4rvK*Rl-v+)tKJ&b3lJ*fTNRip701+tTwoHR&T@^$I`%qCejD&1dF^bO59rU6
zpY*jCW~0)U;7+BPa<Y<W_0pfRe&ogI_|0Xtutz_SZQFEla!@byDXaV70j3rJO%G36
zcgsWSjcCPDon%lga~>*=4UXu)**idUOb}Er;!_#(y7@w-xMifQA3UPw7=}kG!(&3)
z)N|`(4x~*z9nSnqEz2<f+B#Y0KVt_HMJW|3Y(N{;??xA8$;QS`VAg3=-h8Xq?>A^a
zSd$W%#|bd`C@I*Yoa(IRPvb`cZZzAln{i|Q9{3kO6jdLZ4Mea`Br1;TII*ezE$G0^
zpqzIGV>iyK7fm(Ipckct=I7;f*MJW#uMC6w8AkenY)X2fdb1_Euc}Vl>HSOc7R^4T
zAny2~X17gH&8W9Qrfsq;a<19;#&)|@A6+n7nscE>gWByrp7;Ur$J)*Iy}?Q@4@N0z
zN9;*>j_r91;015oM^`W3kyh7s{hXNO;g~lsl7yqxqrCoWY%G#`(aK&psTV1{fmPkg
zGGl1H_(^Y+PnM$yU21I(bk!fYRmZOA#k@MkxJKT%R*z~is|@vxcC}1REl}N7R*Oc|
zvh|6{@`Sf+!+*?Me`$UEZY8XnmaUPc{`gwv>aC%zu|UbHQO}(O3iMK6@2vp(0Uc^_
zPJ-N2ODol(l$iDVvIw`)^Oq{O#&x;=c)J8z<WD2Is$;F>BR*Ywr9p<TlMQ=x*NnGt
zICkXc%R9By_5$`!EvLPJy;Cc4&#!lBwXn+6J8x<J@YuG(#JK7}{pCO92Y`=im3k}V
znEWi=Nc$}{*nV5=T}1o6K)j1+zZZyi5$$*3ylcGuUQj+pwBJx4BZq@w`@_|?pW(4#
zwNvOCchHtVO{uRDHQ{fiQBU;ACiW;qmE3G;i7L6T(h^m23nj6tv|8;i?^v0f9`iP1
zs^>+k?R7~?t)XXkT;;#{Wo_?RUm}CJno`?WlDKM*RP$oVj<gFVlbKW3dR|PGIdz3J
zKB=ye)NYexmP6md<82k!8J}~S$>vsFgsX-6v6JiI)K6|BQa@#A4!j-dbzKSzptsMw
zw$P&|X55PvZ}W4X+bcyM?_5ec7f$i@xPHimPW<De{HW@QeJv_GR^?i>Vf&7f*v4hg
zt2I7n1#YNk>7JOL8d7^jN;m2<uKO%wQ;$2%9Xx&Su6o#<4>ArvFv-p6R!@#?QIGkr
zjO%ajtt8I%Y4mAVZ4%bE(hE11x6h1E4*C}$k!v};%k02f4z<KqcjEepV5#Y6S}E#0
z>sLQn%CraXNVV`;Er3>g@;3D9|JGl#F{QRJY?;R_cw_lM7Sw9P@GR)bnqU^Zq<$8>
zpYxW5{u%vXE;p<i1>9G03_9rr)_0O|zN)a{Ir_iW#aV4EuXQps#z80Nh-4inqdV;C
zd`t4{HQW>r-jpb*x~LbP6t&zw>d7Q+eO~Uwx$UD)NVE?Uk|gW1g15<oQBk*L8}K3d
z?ILrLug6h#SNmGEhh1hK)OU?n8w*a?F)yK65VsnLmfE_crj~THWSjol>P*9VjMe-*
z)j*_V@;6Yg)H4Py#Cp|ow^|de>MYTDtXUz2*mAcTh*nL7ug+PW$5_q3Qw>BaqyW{%
zwF|Kow%o1c(J~W{y3Y#UIM7eDIo~l`K<8Q+x$=b^xt2TE%E(pckI!G97G39(ITv|>
zY_9ZG*NG>F>0P}3);jOv>gN8MVP^w6xf`~xuO&LG8|qr;CNJJw;$zr71a&>$BHcEq
z>g7WEg<RhIhFYZCeYR@rV(d)#wNA0W3pn@=kCw$-#bmHty18P*?QUsqQMvm0aCS4d
zNPns(AM<0UnvdXy>G{gVyjZE`!P${LUzwO6Gkz|Dd%ou_7xQAKnv3AB^7+cdyjbzi
zt=<%2OU?s<9qTQMhKjX3WTJI$R&NxwtUnHU;CSnFyXV%{1w!|~UU2Psq=l;8N0hfJ
z9@vv5<Lt0KQQlwN*?Z+dtDLCLfS*4XWI23ex42prhE&eG{jQv_73loM1AD~8iLg2N
z1*sQm=AeOB@3g8+{B08FFASz$=qVI?J)m!1g>GA)?;=5ek^FX5s|uysUz|S|{Qlzn
z`B2+moIhXCUx*W7{e}0Jz<I<wL#k@gnu}YnUg-Yf{JG%w7w6B1+Wz7^`XWz54m?<*
zMWvkzS?y>ZUC}BFblyC*qE)IxoNuuOI&U6{F^|r-*aDrG#iFh1B*LmqLl)5GB_A8e
zzB<)c^{tniAi>AI-k_H%c+a`?XD;=sfmFxz*zir$<-$Zoy@kC0xi|OUtm3l1e`dq;
z^%8>W2Gq!j+zZg@cw6}7iR_Ja?n#5K&Pp}GF8RSOH4yCNJ@EWE&0t3_GV#x1$!m5-
zS8A!#?m8E}Gg$9tyej^37k`{3o+P<E&8RCW?Mcv$8E*?~LvA!y`|1Xy)L1~IN`(c)
z`%B0;D?A|T9V=eBgt!sejWqra&U|r7uku;juU09p8`iJoyjiWJ>~?EJq~*pI7FMmQ
zyApauUwKSF`KB<ub?v69N&Oa*;i*DtVnVHuQg08K(U0O8R_|>n>er0whf(KlE{;r>
zRac!W^kpmCC(3=w;{|Y9z0GP23tamz2=7B{mkz4`&Q(3E&&wkk{N=g*ik^qqPvAu|
zF<sYgI`wR0K`oe7t9<p6+YR}`b-M89S`0ohA{QZUE3A!EePimS3N`H`y6>)D1SRjf
z=UzLh9+AHgs}x)3gnpfry|Xu6+1jOUqk69#9_w4*J-S6b1E5kaRMgfC{rq|LzZyh!
zs(*CG&!v7KJ`EI<l~g{ynfjX$^y`daK`ZxO_8v1I4H{6ra!dnp*A$yPtPR}Dvo^d(
zK{Q?p)!RqTZChQD#?=Tw9yQTBWsA9Yx?0Zl<Krt2-b;0q4~HmE8XL#`Ky;MPrjn|B
z*jifO`<fQeJ2iL7LVHa2BicX$Lou>Z(+Ya0>Nf-ArBM_08Ujqj43}S@rb>P%R4tTX
zQ)otgu)0Q7rr~O3is^rCjT){x@8<`dYHwl_Q8g;Qp@xckI7W@~^U|n^x;4r-5wk@6
z8Wp%XA1Lu^=bF4UY6^U&uiE#qz`ggO>9c4lX_bm7@A!5aDGND`#?48C7F1!!wUD&1
z11Hj|5wH6QDTx^VyJIEQfmhYCoK>G>&P1&$=p>e6WF+cb5j!`H+K4LcCL-py?ZDZh
znia3So6uj=xO;~qO1(P3X<4Z!u+&hANPk`pRiF-s<fc&@k)_^{4Zpwxoq07EQsB+0
z4y=C)YObCq{8FwTm#WVJ#o^~4UvHqpi=6GjliOzcQtFp^a+|l6AoSU7GwMxyIrkDS
zQvW*rd^-J@je>epr(R}zvrPQTY_onRarG6R-XDUSg*WPbw!v+!%C@_))kErqlckal
zZ>(AR^Wqk#hGPay&FEZ+0b3xqVg(E}SUrj%P7PL1A52h#=hi<mK0eV`Qn!-S)Bp61
zrsiI4+JD1(wdZ~P4N8&!y1+SRqU=?_b7kv2$xm&J9U9(huFlovt(vA!tTuR!)1=y(
zbD`>R^dkqWj^YebO5kqf@U|t|YrIyYsg@{?aJyCNYyBRcU%y+VK59a)B{8p6Zss}W
zOS_Db=1IG(2$(13IxuSJHDB6QVB%>H3}a$+g@Nm~p!a%gm!xB<j=O?;3tFW#FaT|l
z(!dCDE}em}Mh-?&>Tzom#leDl35K5ORkwTnyG`ERkHFm*Z$pwEuyu#sGxcupsC|`r
z^@wBDyQ`ZW=9R$ybAi3{Q}dpM-h}c7jV<&nx++!|l%!JX?B+d5XKcLE=iQjkxC7^C
zH8s1vnp5X{rO&yZSHn{+aH<(?s)5-Ta;DPCtIA|?Y)ZdfUfl!K&k2fsH>_r3fErqa
zD~xruWu59&J`EM8hLXBd&6gUGx^C!)2Q{9rNQDXVRq8{&#GM33n?YM?d~~8XSvHYT
zd1@+Kb1F^XoOu?T@0`wFv(Cj=8rhEquOZZG2s|HMt{{f><wIHx{Y%Zfd|6*Vs0U`H
z-5M6@SYRu2Dm^@=92*%?Z$KI!4cpMHZj`55rrYilGMjH(sk_<$y;IW7tyEp@NA<#*
zRw~A5qj%cB6jEm9%TDm>Zr<z!Mr8A5B{)W#KQn<*+q{_xjN@8u#obET%3ADhscfb0
zYOB_(pIX}}Osj6aVr=J0zP_^6xvXyMIsdLSv+T6hVQFf~cB`FfVs%-oU1?^Ka;tqo
zJMu2?LN75RF8q`)t?ezU?dbfw;<uyo?+e<IIFodXT1!tB)fW<ZGZN?16~7&w|F8t!
z6D(^qTHQJVCj2c|tt{Mt37H0+?_8+a%H~X{$Gl4j=33PpxE@naT@MRd^pue~x_py9
zt|RG%T7KKe_?F^GL&p|3G<2B6M0pw`CK3%VSM_&cnMic$+su{X<o3Q;cZE|OCB64R
zJuG~xob%o@o&31`?BMV=^`4952CK*E+n$5PN>RUwQf)a~Rd~t97hYTU5`Js3r1k|R
zH|y;jjdxr%s^zIE_3nbHct-`IDi7OF?xj4`ULDt1aJ)ygHQ;V>M4d+B9_OuT;6_~a
z`i;s+14m1z+33;IA2xcl?9@zjG#X85tTGuh$EGr6)O=Ii5W&!vk>c2m4IH;^vN$mm
z@3`tUVXDJ>jkkJu^2^Kd4mEkR7p&?aJBb<DjP?CmGi34lAH8lyZHM#z?YurQfi~|^
zC#pBo@7x$3EUQ<#Y~8N!=nSgYi>deXso6Yly3xM{6RTyK>`8zUMI<|>I^<+W=ts8b
zBa$ozQQ20riuz?X-g_my`&Zj0$EPRsJN<ON(|VFrzi?Ac537X{`aK0EQw^F@Z*Ox=
zc}u8TZ>&@|UwR%{=P=WB#+0qP8H==Lt9<l$#h)yi@$N~CtKE2N9H9s7!F6EXxH)jI
zQO(q-WX_H_Io2=8Bp%3Jk@@l<ve~aocj%o{>K&f4x2Z5v9@|#YcbtY);~X9JVqrHZ
zjjE?8s`_cO6|FSYT~%6|%C<;nrm9nK!ZIFudw(jrs;U1Q^)_1b4NYoJSAAA-pv%oF
z)-J2N<5Fy0N^?c`rRx9wp(b6f(R@RzG^eL^W$;~&r#Qwl4+0~+sR=a@Rkc*!v{QH7
znjRk1cgM=J6?KAgJKyN8!!+`4b$hlTBVV<Aw4<Q3CD$=MRj$=h&wYOqU7ct=t96gS
z4X=1d*ztotm&Gzsy*U*xdDJbZq(=vDBqcmLaC<1>vB8@@Ne>R(%1L-|;08^+WBnSV
zPOGts(?37PJ)&A;;vP^P<i_&|)3C|!A;dFLom`zS1OAlhd|ALmsF(<wef0hk7}Iz+
zt7BG;CT<hND+Yhka=x;Fx|DqGI$kEKb!ol~_;qQ%ETArliLkol{UuPBygQjm>(YD~
z@axiiS#T$W)yrMu)sVn}GVjvBfimUNz=1N`A_vA9XgQMvYAfE<WJ!;BVo!<cCQ+Uo
zj(JdEWLF%S7%KM7Iaixfm)s@2f@pk94FcD{aJ2ts^;jo$iRg~XBClPXE5FcQGI-^u
zyUm<>mdsSSx;WK)<cGfcSF=6dgJ#yM1%-Xqhxl`={wcemqcPx1Zd<Qauf8p|QXZYq
z>!cD-fK~?t{=xS0F?w+Ax7Xx-e@aal=y|J|a{0!=;`YAv!{+&G>Va$e%Dy^8wRxFe
zcht3o_T~cc#7^i9jZaUW@2J>9N~H@Igga)gb9=dX{zIc?N==O^Xn*vi?0GLP)s<<V
zilc>z3&t6Bw?oZSo#*DQDzF!s(c!V_iaOz(-_AzA{}FwkezVMZcS)T^v`b!TT@VhL
z5}PWQ#>WQFdw5LC(k(qZr!(_=nz9}8M0v8L?$X$2mWG@&=h+WigNM}P`3f?X7xVlb
zJ)%=RYIPvvzxH08nTun^k?rc9nyh&bj120JXCq!CKeyUgH<2PVt9zpAzJB;1CjO8z
zkjrE@vqN8rm3Ty$%GqIQ^<no7j4MNS+}HtK{8-d%acV$?`&bo!oEzVdh^@GdsEV3W
zZ6s&*wvTxyfwRdwxklf&;Dl{*O?6*{mAF<`eG5znx4^R|^;P`}PBpi{v1S$eo(1Ny
zTj5!g3ag$4CdpgiSkw9f&wA`ytM=L__bQ^ZXh>JsCjHiVG+fP{9W+FrqZ_*49%I%;
z%|j;c3;bD^hK{zUx3!HNT|4X2h!)iXsxJXE*|$XyXVxY8EU6to)|qwj^D@8g)Sq=(
zC{N<dx-6J4W@@a?tjmJA6Jyq8!F)+D>#|@z#hG<kXlLe}by+ZHV$HfNm^b#CRc4&$
zn&en8m*UR4ESN*FW?dG{n>e#Bo-^}%nzCojIcHrK!Vg=6>&?2<7EttvE^OAN)E6~9
zBAOeVb*ZPe@mZHrU+t`mAB6Z<_|;`D$w#BLvo4J|P&@0=kd}}ape7z(JF_mnAN3m>
z79%9TGpL`0sivaMt82CdUmBxkI=!W?YU|B#Nj)B8QY}zltDgZ=d#~3PVQhE3)!<rt
z=%&%oJIv~qvUXP;soiyaoe5i_+^nzuS}%DnvyRlr@NlRpotMCB4>eQOf;cIY4ZPSd
zd9mt;vIN~#b+CG!n5bCgN-6AdQ{G<!LGp~uQLN!lUTM--zgSD2={bru)Z_YbiarCV
z@x6WD?Nxg7p{_O!UFW+kuD(f?%>^=P76LDjwTN2-=hJ$ruUYGJZNAjk&(%t#_oFsZ
ziDKE&HD?~}*y=KmCZg)dLYq_-qe+uVcUxjbrwk9mI_9YJt?gvu59+F`I~T&3ztVFd
ztfgA<rt-ui!={FJ4VIrCbVx+Q7PhvovNW@%EqT^V`KioRZ?fu+Gua!(8!bOQ-c3F*
zN}kDT`&$TOe*0SpYqjlfA*`bPiMg;Q;r%6KVB28%>Grn}#{BlT5Y}qj--1|GkINk^
zPEL-`*j;vO*Nv*JlGSUQ_~$mgluR}h>t`|Qy`f!=>k4x#lWv_`4eH`6sLi8j5_frF
zFPm;ymzuS;Yc9O)o#tJD$y-+BbH-buN**fSfGP%D_Bu46B>KJT$qSDT$sUT<IMlGN
zuo|GB{F6LuHJZ!=)mx%Uo}S)-Dh6Eko;08&yasq-S~0k)tGl~RiB2tMSLH?IL}W!|
zM5INeMCk9qRoz{l=n~PXg;F9SCn75%BO)y#B|?8IC7q%~i`iA3BJv_~BC;YfBGMvK
zBJ{UXk{2afC?z8DB61?KA~GV<B2pssw^EW5C0ZyYBJv_~BC;YfBGMvKBJ{UXk`*Od
zC?)bMFTZjkvLZ4f(jrpkZ=xh4O0-Z)MC3)}L}W!|M5INe3=}14QKE%XA|fv$Cn75%
zBO)y#Wqyg0lqk_cDG`wukrR;>kr9y=kusuNHAcBnv1*;}u+=k*)gzLwjkB;K`GrPs
zcGI1+*6&*{l~xrBTSr%E?^IcJNanOqnG=y0krR;>kr9#BVsKSTe))MTO;x(|AG*3d
z(W!-QPM*k#$co5_NQ+2`(BI0PE>Coc=+r_tCs86ID<UHzEg~gCe=8-OqC^XoClPrO
zIT2YA84+m_DG~ZxDanfxEtC=wc@a4gSrHi#X%Q(A`dcZ<i4rZ85)pY3IT2YA84+m_
zDG~ZxDancwEtC=wc@a4gSrHi#X%Q*&H&K!iC0ZyYBJv_~BC;YfS`4mA%deDyq9iR!
zv`|V!<VEB}WJP2|q(!96FHw>bC0ZyYBJv_~BC;YfBGMvKMs!`E%}FxXA(_)cWllt1
zL{3CjL`FnfL`sAl+})`Qpi>Lof;^EEkrj~<krt5>p}$pa>GDLEh)ykZ3lb$FvLZ4f
z(jrnK^tV#dDN3|Z*$|NzkrR;>kr9#BLiGyrOMZ0cMTr(liHN+2oQSN5jEJ;|lnDK;
zTaYNxLMaiE7m*W@6_F8<7LgL6zjX@|C0ZyYBJv_~BC;YfTByn|zf$IJq9h|qv`|V!
z<VEB}WJP2|q(!6*6eVd<qJ>f-A}=B*A}b;zA}u0ieu<KlDA7VG5s?>>6Ok2>5s?;=
zGD4Jeh!QQ75)pY3IT2YA84+m_DG{QhJFlbFC8ARcU12?u6Ok2>5s?;=5~06!g%u?t
zI<?RhR+NayipYpai%5yk-@3wz5-n72<X2vP<wRsfWJIJzq(ta%r6ey(v`|XqS6+VQ
zL}W!|M5INeMCfm&BqvI=P)bDPMdU<eMPx*zMWjUNZ>1zFO0-Z)MC3)}L}W!|M5INe
z%-=*wMwDowl!(ZS$ce~`$cRXbNEs+f(xOBQr9?ztL{3CjL`FnfM9TciS9@zUKuC#7
z5nWm+l_K&Yaw4)KG9uC<Qbvf94o`Gxp_GWoi^z${ipYpai%5wO9o;z{>@E?VTIlNQ
ziJXY6h>VD|h?EHZt%|Bkl!)lmLRVi=A|fjyBO)y#B|?8IC7q%~3zZuYc@a4gSrHi#
zX%Q(A`dcZ<ixMrA5)pY3IT2YA84+m_DG~ZxDanZvEtC=wc@a4gSrHi#X%Q(A`dcZ<
ziV`i95)pY3IT2YA84+m_Df2f`k`X0ZC?z8DB61?KA~GV<B2os5lC&t%LMaiE7m*W@
z6_F8<7LhW)L`h1NXrYvd$cxB{$co5_NQ+1rAxb(#i55zUh`flLh^&Z=h_r~52+`4<
z)#2?D(W!;5u%5_?$co5_NQ+2`(BG<Xx<rYHPAznW6(u6FA~GV<B2pssw^Gt6O0-b9
z5s?>>6Ok2>5s?;=5~079lDsI<LMf47dHIzSkrj~<krt5>p}&=qoG8&kDG`wukrR;>
zkr9y=krJW5m6EI|(LyN^kr$B@krj~<krt7%fAf@NM2QwkiHN+2oQSN5jEJ-rYS3h$
z_oF*4O0-Z)MC3)}L}W!|M5INe%r8-r5+zzFB_i@7aw4)KG9uC<QbuH}op$0Y*5uRH
z39eWra~+a7EmY=2<VEB}WJP2|q(!96->P|2i?*_>L}hnI7etqcPAzo1@<dKVRzyZb
zT0}~O{#JFUOO%M{)Izr_Q6eHMA|oO#A|*n9D<z$xL<^NU5qS|g5m^x#5or-A5&Byx
z$%_&#loAnn5jhcA5g8F_5h)S+TPewj5-pSx5qS|g5m^x#5or-A5&Byx$%+y!loAnn
z5jhcA5g8F_5h?RGQIZiQS|}wV@*;8~vLZ4f(jrn8dY+_3i55zUh`flLh^&Z=h_r~5
z`Q;tmof0KlC?z8DB69M#to+J|NQ+1rk*U_b3#(m8<~k&ETByv4$cxB{$co5_NQ+2m
zp(ljQAH8UIr?u!3(W!-QP@c$%$co5_NQ+2`(BG=^bcqrXom%JyB}znOMPx*zMWjUN
zZ>6MDlxU%HCBO3WD<>i=A|oO#A|*n9D<yeRqJ>f-A}=B*A}b;zA}t~%LVqhIIZ>j8
zQX;?d@+&7ID<UI*OUtj62w~k>QKE%XA|fv$Cn75%BO)y#W&W0~)<88J&v?4JMRaMQ
zREo%p$ce~`$cRXbNEs+f(w^wjLMaiE7m*W@6_F8<7Ll^Qya=U4i55zUh`flLh^&Z=
zh_r~55#G_=9il`Fr9?ztL{3CjL`FnfL`n;<8hZzNKf1e9nstfj)IwKdPvk^oMPx*z
zMWjUNZ(WT=iHJ@ubTt+wBC;YfBGMvKBJ{Ve#-c<El`9c>5jhcA5g8F_5h)S+TUTRI
zqJ>f-A}=B*A}b;zA}t~%LVxROEK0OcN<`#E<V0jeWJIJzq(ta%r6em#v`|V!<VEB}
zWJP2|q(!96-$Y49lxU%ph{%h`iO7n`h)9b_87NB9qC^X&L_}UhPDEBjMnqaf%KQ=~
zDN&+@QX(QRA}1m%A|oO#B4vdalMYd$g;F9SFCr%*D<UHzEh1$^wPmYuO=^{=tGl~H
zYwi-!sfDh;p2&&FipYpai%5yk->R&-M2Qy4FA;eWIT2YA84+m_DG~ZxDd`j?S|}wV
z@*;8~vLZ4f(jrnK^tV!y7bRLKB_i@7aw4)KG9uC<QX=%XQj!xTS|}wV@*;8~vLZ4f
z(jrnK^tV!y6(w3IB_i@7aw4)KG9uC<Qs!@>BqK_+P)bDPMdU<eMP#(lQ}SNQlz|@W
zPJ5zD3#CLvUPMkrRzyZbT13kH5+x~7qJ>f-A}=B*A}b;zA}u0iged6{C0ZyYBJv_~
zBC;YfBGMw%z(F6-(boLuOJ~~JE(%ezX7OT=j=lFGfxiZSwY6<~d0U%iza2=`*4E?v
zwm%oye;7IXy0*4U9HxJ+`J#BW)coyv${lUT9&hDOUTEz9mPu$tkC8T={j2-?hw6Bb
zImh3BpQK!74%GHFk*Kt_S^kERaQnUHxE0p0k)qXyyVUU>bL=nqxumpZtnKR<yY{2v
zx7ozcrq{>6=wY?-%XK_N%FnSsWLzBZUG@Iu`X6O~(AdA&9Ix$f3bFs$RpIuJo8u1D
zv42b*9~QqJ6TdaE{|NPO<%ajM<rn4uL`eKLhxq@JXN3DdXc|h^*s~&T{ANSyzmBCn
z-pbwU!|UIEW8bEWvj19jyqCr)|J^2jHcq<ymMA4|{N7X!w|~IcUttX!>H4!<9Uo@@
zU`YLcOo;uc^4k+qeua?o+aFPW$Bh3Q>-ZmKe_u%b9|*Dk<151J&r(w!N9x!=qmB=Y
z--(d=e`$jF9Sn(IF~tAZM6};KjsK0-|HC2i+Y(}b+YiF)-~Gn^9;aTr^>2$hJ}iFA
z{+FaYYL3_Se|duV-5%oqaESj`|9iOqyB;b9zteHp`Pudyb$porC+?S&1EQu)`~Rc_
z{vQkRe>}whfBxHW{}=s^7<T=2e}7ROALf6@FC``WpFc?8|6L*ePlWiN{Ykk0i;e$_
zO*xn_im&#ElFv}bhxxz8_<z!*)$xC-`nTJEM)e;jL;Rl(@&AX)xbCWc+o|VE9xa9?
zipB{g+~40*z+=ww?f+X+GX5*o@p1jXC&d4oL;U~yABFqB)c9X7{_j`Ehxy-S{Ac{1
zp1}XJA^y*X`2X!!g!{kT3|u9O(eeLRb$porOMX=w|5XY6KNsTv_7MO7_1<v*+l~MA
z;{P>ue3<_$jsJ{)DuMrtza-;-jvrqU;{VFWhMzxIK3-y8FaA$a$A|gfcCI%5`dk*b
z{x1#je@BS_182kIf4T9$Ui@FGjt}#Hnem_T?@Zu-dx-z93h{sDufqM${(ijpPpad?
z{68BK|36OP|K%b6-xA{g;{OQuzsvYvFa8&)<HP)4{A;N{jQ_I|_}>-c|Eoj%|3}qt
zhxPwGPl*@*53A$D{6B5{UnXk2@k37n|9eCHe@%%0ulZrP|GmcldhvgyIzG(*`$OV?
zRRaI}L;T+r;{SjAQ@H=@^vP0vq!!4(!+!rj9UtcZiT@)<GXBq13gY%Zn?wA6U5Nkt
zej4t7zwzHpgH$u%=I2&*e3<`djQ_0vYZLfC6ypCILj3>M7sLJUy+T}e{dIqzRL6(;
zf9yAslJQ@c!2e2!|9>9h|Kj_?{a<7JuNVJ|)bU~dpEUk6{?{e&e`kpQdqVs_@r7{z
zSEu8}{|oB)F#nIV$-tZOS5p<S>;Ik*|KAki|CjzV-2Wcqf4%sBUL7Ci|8e6#<9~eu
z|M!RZe`|>U4}WC1|7sbo_o?UqB6WP2{|6r;@jofUFt7jLl)(Q(A^uN=`2Y2Y`Nx&3
z#s5XdzWg%2+8;{(vpPP^|JjF%{{tqizW#ct`gh#^^GJyQZw~SQTS{lx`S<c?i{ZPC
zeJea)?GGh&{Rs2_WQhNNs?xgte^Yg;o_*-_{@Ej7#Nn>}e^JM4W|CJ^cm1}+&(0(2
z_zkGPy7r^4U+)Ns-~N#JefLaw{6>sJ_2zH>O&uQ=zY`A=|2cnCO5p$T5dYs1;{UGi
zh5LX1bCfalnRNp0{A{~L9UtcZ?%xsr2RtopUi;gs{v9{|cZc|YAjJP`|2EwJiL1r1
z>#zHJtvWu;|1-va_TR$^{68Jy|2sqce^<o#y<+?~-LQ$G@wNJ^t?jQO#_w&9kodFz
z)@><n{O=9%|6qv!TUGGF`j3hpY^aYLZ})dm0gtJ1JU=Im|BU~*N)Xro`$PPHcZmOw
zSMx7n{?8i!>&1VmIzG(*vmx=HOyK{bFUyJJViOeIfBj8}|1XW0znOi39O%Z|{r$p-
z`J3YxOZ{Q|rxW<UB*g#sg!q5ez2WiSVf?Qb|36X3hsFQ2@t^g7Hi7@kL;OD!;{SUd
z6Fz^lL*19vA2;6a@4r^Zhxvc>k+tzxMHRdLuMF}3y&?X8{wLw_-)a1>7ymoe@nQa-
zF#a?CuS(#5HpKtG4e|eHZ;$X_50=!&jko*zKh*JI{vUo+ZTw%Y^u_IedP4kvUx@!V
z{W#qJUB>@<@gGsghxvcZ_|N$7O5p#x5dRN{_@7q&c3A(pYd{%OA2;6a?<>^tVgB!b
zbZz`!uk^)@|E3WC-yh=tkA4vD|Ly_pz50k7@^AI+`v33h_%Q#E82=gnKUc@c^?xwL
z|Gx|I|Av2x@V_iByZ*Yr%j)<r|93B`jsKex_&*Wi{|7?+|3$?7@gC#<8OLGgXWM^9
z%pV^#{xkl26ZpR)#Q(n!@&CnN43B^1hIsMcsE!Yd|Li5T@qbGK|96M@|Dh27Z~R%f
z|Fg#bdhy??jt}#HukoMp|H}ma?+fw&NQnRI)ci|W|1+Qmi|XUn7x(wo>i97KhaOWK
ze|4&e-F^>-`2XP$|5Fk3H-pCidhx$JV*X~Q@t^V6YmwsiKevVW{|_Pl?@|NQu=ua5
z=;*h#-RlJ0`Pp`hIzBA^n;t9i=lspPl)kwB9}V&UT_OHorC6B%UE4kP+Xm~*-~5Ty
z>0G~bTq^z#h#K$u_iqyTe`kpQe`akdJvNS+72)I013Sd<ah*AQ>~R*YQpbnIf3NX>
z!sJU|f4o;66gU1SLi~Syi2rYi@PAMb7PURcVdrPtUqtxd_Incl4pHO9|FG6)elIgJ
zYX0X`i2pZ*`2Vr5hS#5w*NB0`b>jaI>iDqucNqT}{|_Ya|4fMgw}tqB)04yN&(dAu
zf4%xMqK*&q|KM_oKmGsv1peO_;{OLj{D1FnhsXca>%{+^PK9xPwjET*hxxzcNwxLo
z!wLLvJ5hW6{?{S?KQF@n&3dq?KK1HPUxfcX#(&2DcBL<F{l7TG|Br<Dzwu0X{1@%<
z+;3a-f7yE<_^#&u|Nm?Y@6}{w7@~I!E6J*rMf9!~!!QZEh%K!wO-(I^@J23EaSdHe
zk|C~@FqdHwhFpd)By(M1h-<FmvzRPOzvt_`p0DlfbsjJ0oa_Dl{BFP7@AiG&>V4kl
zwevWS`|J67zFz0g`|Le!Uex1%7U@y^YX`{qM|u2+`RDln{HcJy4)DLY0`rINko<Ib
z>Q;3A=SYwEGY*&hIjk1^FVK5h*u`u9Ndx@P0{)hNVg3~6&+&-=zetbx%bCB$5&xG0
z@Mi%2HGqE&4HIFZKmRpZoUBvvihmvH5r6&>?)W#*{`|&&G~j;$@UQqM<}YS`ulPSm
zdc<GN{Lc8l9)Ldw@V^N7-?<C(*HXPGUh)42ZHM@yN4eww589vK_)h}-YXSc_L;kO2
z{=pvkf1)A(8=2o3|F;707Xtp50RJ<T{3!ohmx$<l$NxzZqxjbhbjN=^?ay!gO921N
zfPYUz{<kx~SN!7)`QOI;&iKC{fWI8@zXJIGNkKvJ58o@I?;Zb-Nsr>+bhJDEAJYE(
z#(x3eZvgy<(FeGQe=zfhZ8*Cr_KUV^9YT7<pE_9bSIdQc{`_$O{z}0AI^chW1{LDZ
zy<akW%|9=Y9`V-?b;n;^3;T`#GQhtM@L#_P^XD_aSNyLgJ>s{9x#Le$m2dtU!2br|
zAKx4Emy3&SD%l?M=SieT{ME-v{#1DyZ0FDCv_HS`uLJzg0e(9Dh557gAwh3h8|0$%
z)n@HnlUl@If4t-`<ZZ?I+n4lS=g*nI*H4apino;y%Zd`MUiUX$e>Q;j*Ms&C9E`8u
zcCvqk7+j8``=^l}wLkR)cl*Dg{pjsC@vjH`Zvp;aHsk(VutGw6T|fLtdc<GO{84Vd
z=)cwg{LO&>ZNR_d5zJrlnB@1GzuHNU_&Y|+_~*#o*yCqQ0RGK@{~f>|rb$tRNI(Bx
z!u)w2<NsjNBmT&VlE1|f{~rSIw*mh50RQnczaak2H8OBs@gG5Y#2+5xjz2vr>O22;
z0{-^_|K^RDzm565;{OHd5q~lBJLBITfIsvB1%`@>pBO()fPd93m_H(JRyp)?jak(S
zEgvO4;?EiDj{h&TJz?0z>-sqb@P7dKZ~6rD=Q4k$NB&<&dc<GJ{Lc9Q8h}3x_&)^v
z^y`x_|D#XHIH~@VYwq}`lOFMxj(5j@R{;LOfd3=Ff3hL}7c;+C{Kp#dzn=M>@fU&e
zn?G5Ae*@s3v>wO5;VFOdKa2Dz{#6s)@lOcApAGmw2K<+Niuu<wf7pgo+2hWii%5_7
zTbSQ@{jg^M{yf0{3E*#k6Z3C<#$WvZhxCX)db&IQi2?X01O8^f|FYru+rj)^@n2&&
z{x&kdGyX{d_=^Gmr-1*py>a|g>t+1Ct{+|^J&J$v*)sml>xX>;@RtGpcLD!jj>hND
zlV6bhZRF`J+HkNIk{<C#CrSQt7K`I2J?iCq{)qzq=K+7}DVRTZtu*%f{A^#+BmNHN
zPv_&G;NLF*|6;)Z8sJ}G;GfhW`Pa)ZaunV3&kY9t@cB}h#T_R2Qv>i<0si%XKXNjT
ze^}h?q|zZzqvQ&`>iKg5=~4XiFO>Yw_#YgAe+A&*2>2g2@Ta~lk=J>||1kr9^dfis
z4-LRy3-~_+{2hDa_-_(73#p`f@c%@56#x1uQdmsPqKN#Vk2-yi-?hw7GP?-<=YW6U
zKs<l8^NkCo=iRvS$8`O@4#e*Z;NO!zXB17;um5(ke~~igrJlcgkRHV^JXOZe`T6^i
z0piyL_*(#fTLtDX6gMlWERc)NSDk+g=@EY(^QW>>^xwb${F?y(mw<oGpE3Vt=C2f;
z<0v|R9qAE&G4n@RFZk(JkMI0#1^izD{$DP~<FAaai$tlDi_TY_|3}gz{?;OyKhF5m
zSKavLZwLHe1O9=FaQxGoCGujA_@|K`@mtd*zcc>B0`OZOy05=C1OA1xaQy4&yj+x8
zx#)b=<9`e35r1^LJN_dA@FxNOZvg+sTXFo0=yM@aay;Vy0qGHc74tjepA~>V74ZKX
z@E<!9$A7iBSx=?Ve(ieE<3EV>h(ER19sd&o@TW0<GFyxB-wOEOZo=_TqR%Bn$=g#d
z)vM0`2I&!h2J`3e`H%2F3Gko!f%K2p?z2q(N;<Am#=O)vvrNaoOwfN@K>HWY!2K8c
zS{fE={(AdwAw6n;`Am2JjRWmB@kapvR=}Tf8Rjo${>dKv`;Z>-R|0<esKfXCn+y2A
z2mI9r{&ha%f4_mh2JnlygwoJ1>bPQxe?H*<0r0<Q82@RTrH@zqpEHdA2Ec!M0RAGt
z|383#Qwh$WDDxM}W^}&Vxzf32S)Y&|<xex<KQjP-Dd2Ad{4)&aA1yxPUt~D{XaoFb
z2jHL2{3_qX{P!K;UsH<XKl&RP<W}-@7Cru^{9ORzw+;B8W$6F3e@oXEr#ZdX{ZBLW
zf2hPg|D6{gewBd#N5FsZY#hHHtrFa8{OwPAl)quX|EB=_%K-mRfd4nTz!Y7qUw;+)
z<ljzu#GeKDCkNoK0sQTNf2AS*YneaCBY##H;-3fj3j*-hF@K2t#rXRV;2&xje?7iq
zp?1Qd=f7$Etp)zy0{_1}i_gD$Y?1yYeEy`u=+}Q8=)a$V|G$%P{*{UkYpI0gFqSLy
zs{4OMdX#^~+<%mwb`kNP9-#l4K>W4?{^Qee{3?HvzN-J_nw#I$f6X9%zX1R1Zo~dn
z>|dyid8x;*ob)JuO_$5SE4_#xohtY~f7uN9I{^RG3e4ZZ{Pg2)Md!bmHbDFtv)uDP
zU26K~Zv*^00RKS4{gbHpu$zk4{gX7q{gWK#cV0hU5rBUu;Qtly-$;`(?bbE_CvUg$
zJ@22)Cq0UP<7{{Q%L4F+K9UoU`uter-*15bUc>#vb<Dq5G|o}<{JG0;|FDJmo$<da
z0DlVL-wF6rF2eE8>yXf1_fPgAJ&J$f74G<76M#Pq_;&&RQ*XuN*V-ZZb3EdoO?t#%
z&iu~!Ul)LXFyP+}_}9=$l|a<be{#gb5>yK9*RB^mf9gn&_&esf<1gAmX>1p->%T1K
zciuk{V&$)vFVg1>h`)yUBOdopo+CZtPo69J)#rC&{M`)r$MF3d{r*X-O=VgC?fsJ+
z(0>V_{VDml|CYpwsCf6^KBPzOPrb_Bf4746n~vX;0Dlj_zudsz&ir225BC}PGXVd>
z0Q`l3e-FSv$S{8L;{C<{2*dcv0sOZI;4cCEdjkFm7vTJ<Wqz;tM@WzIrx5Uqa{)rI
zi`V!s2mE^h{^=KD{v`3R4wXXtwd+OA8>(gs=@EZ9;J-Tn{{p}-{v?X>SIeIa{3Xoq
z75^U${FQ+Jo&fxn%&+=O%ztr!e>`0jib(6nk4ENim))Sk-PwLsVVXaxK>QMc|EGrh
zUAu=gZc#?ORB>0;8w~kd1LAjofcUKd{5=8xqlWXJWqV3~ul}z#oc}Zc{^bGqYXN^R
zz<<m6xc@tR@<&OJ#$Pkwe<%R|TEL$K_=jJN`6ulq<Da7v#gIQkNRRm20RM^r{Ef^{
z$aWFqFCOr}Xy9MQ{MLVY|D*}{{|?R{f2R+aMWpoczf3%=M<x1S-alyu{kJ!0|4qGd
z|MlBj`fu=P|8=BC{TC{i=ReN-Cyxi{zs-QZH{dUzUrIyqYuiWiZ?>b@^<uMjty&k5
z9`To6E%`HeTaiCc0{)>NvA<)V;_ZfH>Ays)*Zl{RUeraj?W%!)E$}zZ|7{?CeL(!K
zpnevldj1vnk^GxI`oDzqD1J@M@9cl^yP||(7q9b|oq)eD;Qy3Af7SVOQzZW;_EQTz
z{u@Y-__MBc_y2Q%{~MKm%7B;Y;$cH7TX|hAbpIC4zlhp^m&NQ~$?GEj>Vdzh|3e$(
z#G&FX^!tJMg$~5yCuM)huk;E}=QsH$1ONSj|2splf4><0Q-S{hz&|t&`=_zLx_=b3
z{bAsr3jB{7h5a*P^iK!=2Lk^yhhqQHG5Ti!|AT;k%W&+U!~W|2MbP+X0sn)6{{vy{
zpU?gz=~n#ae+2mV1O8tejQtB^jDHUBKLq%na47aKiP1j~_#X=V-#Y;Nm&X|YeBj?7
z_}_U9_K(KsUkLoez`r?y{VQUOe=+bM0Q`SD4*M^O(Z3Y<9|rt;(g~J0(&)$U>KOgY
zf&bya|K4HPe>MC6xARXF_@@E?ne<2DQ2W=iKS{b3zw=K8@IM0hKYbAPUl(KiD}n!!
zz<=*UuzypG{#C&LDBwSnPDD}sH^mtLYT%y^{D&CMe>TVHUjzIH0{_ynxcysWjDIcg
z9|ZjG%fkL0G5Xg7|D%EbYQy}~;{cHrUB5r92BALw(iX|<r@m?fUM91?R;wojyQrn<
z{JDYo)%mA5e;*9^Pcoc8HL$<B&QcgU|0vSib=q}a2e|(E4~0Z=tNohz*Ms;U1NeJ{
zasM|nzw$HjoBTHb{~^FX$8i4D;<Nuv{+odRvA}<YVgB11qyJ{$p8@=b8qU8uVvPS*
z;6D`jw-3hsZ~w9zbvjA96+M4V@oxwI!+?Jzg8f6O{>Hz_e<$!C4*V}NoPVXn=-=aG
z_w|1!@Gm|Vw?7=Ce-isU=dTgK|7XMX=V10%^NdOYz5m-tkLIuR`R@BSy8_H#sUUtM
z0sn`F>!)nyCrP)W^PBP~4E&D+{s$S(-*RK@zjWZA1^ln<hw~>tM*j@pKMMGtW4M1+
z6l46efdBEpe}BXHDT&cP!v4<ja{}-`$8i6ujQy8&%RU|}j=D2RkH$|vkDnagR-AwI
zq;mvX*hP&?Q~u@x{u2TJEr$DF$p^~$*NZ<&dc<E1`1cOLpAYy?0{qJj^Ve#h{P!8=
zuU5dH9Du(F@Q(rf8JT$e<{acN{zsD@#XsXZIsfK3@@L-w{H4rK$aWF=7Xkd=hB5zU
z=2v>&jbv3Tv^3>!Iq)9~{Esrse_Lbpj{^U3!2f2$@uxjT{|ewg9{3+f6M@JS{r=6)
z82u}Oe>U*nWVnCV<6xP;B<WWC9)GLY-#PzI0RD%M#qCdGf3NxLP|~CEQx3*YIKcQ>
z0r*b_{HJDN{u-bB*`!DO4S@gf0Q|Lp{}jM~f#Lc+yPxcTulS!!dc+^P-aUUE8GwH+
z;Lid4|2EuzZ1Kte73mRw9^fAsfWMLX3E3`U{yi1&*BS0#&Oao!@z(_W1%usIB2vp8
zhV$PAG5R+H|I>m0xrXca#WDJ~0RLRz|D0j|T@s^zEAT%9_+M?ff4MA1|2Fn_&c9~@
z{}&DO?+W(!8voB3=HDtXentiuKRW^cS%ClFhWR&gs2o4_JpR-|<-J<}$}s=7Fn=L$
zD8|mH0Q{ki^8SG{{&|3Zr(yo>@X7y+Vg8NWAm?8v|L6exDS-cMz<-C~{%LK0fAPP~
zaR0O#@Q(?=A7*|+wu|V$iGcr%Fg|`4hb6z#^KLrlO|@=1|4j$}=K%jo!~N6J82vMV
z|0LkQ)iD2-$LOC0{Lcmc^9}b;qcQqNfd6^Ge~jV$w<1RW9QJpP|MP+Wq6p5vO7{1f
zfB#H+drqUV(XB+?=U=%2#?K_cpAYySH{5?6Jiy=he~k2qKZp4Xxlv;Lo)v(<5b*yA
z@YfseKW+BO{|xC7e+}TD7=XV7@LvG<Cm7CummTIW{t?6ZZ|Fw%@#EY8{N>C~$aWF^
zcOl?E*l_+k>G0U*-ze~(4E!%Koc~Ua(Z2%tUj+PL?uW;JQH=hTAb&0f{%^dE{Y%(?
ztH<-x4Wvi;U(ESaK{+Fe=>LmB{@h02|0#M}`!zW$|0vo2_P*^s$QOOxbo^b$?N4T{
z@Gk`Izor*{es?naSMKXDr?<NQJkq1~x7{qqkMr*rUIN;G4FCSU{`-4dkC*M2d+B13
zwO#AcFL3<YS+9;iN}=;#OL|ckQ5*2G@mA?fmq&IH@tX$tP4Qn1@^2c5|GarP{?-Yy
zrA_4NEINNF=~4V!n7@SsCisg3@Ye(WO9B6OdQM$f==blMPL#$=JovYf9`QHaCgb16
zjTihg1Msf{{Fea!JD<VhzbGR4%RTrPlOFNcE|mP$tQY*V0RLAjasF-+UzSCsgWInb
zdjFg9uL-oj1hoGo!~C~ly!3DLnEyr@=D)n#W&54;-yG0>6aOaWcg|mz1OB~x;{028
zisY~Jn7=}#NB!6Q7s+4A?HBzw5AZjzzdnDJUnu?MUR3YNzV2Exe}1qP^j|4x|MI!G
z{ZaPM^60<&NRQfIe77Wb&L3BU_M7^z1Mpt~__GZ2M?L*sl_>o@_=g+jkDR|s{swz5
z^7uPH0Dq59q_H}F*y9)Q|MWDTKQ>H}{9g0N52Q!&58WgAo%6>H0r-;v|2)8d;#-(M
zw@C7PeSdQn=@EZTmE?DR|MX3Oe--tQaMI6zviTQ(YPkQ@!uC=tw0xBQi@FH?cb1lA
z(!Y=^MgJ`T{-*rx2jcfC`2D+l+P}?D`*xPC%)h}|N$++3b5xzCk38V!zcm1VI^e$&
z^#AE~n7@I(*HM%rjZ5c0ne=v@wp}&zJLms}0r)eS-#PzZ1^DlJ3iGFxNd5&Hu(oR5
zPI|<jUM=JAJpZ^I@Sj;L{q_03rd0aNz1X3&Uu139x+(v%LH}I?+MjkMp8spvKigye
z>`!{s{?vygd4&5_jGsF}`%V0Lfd5*+Kj%%{f9-T!62)u&xt#QfKmQTQ@0@?cxhNsn
zMV;51_$LGY`GEiRzhnNbS4n=a@$)k25r5_1B)@a~+#7(u7>u9m0RJ~nVE(*oB!8m~
z$3dfowraJI9`UEHlKf##c#%I#0e}6Ic>JW^Acb--UH-hg&I(iim4p7f9<=`q`cf#d
zPyPBO%>KC^<0psosQp=wOLFJ<Sq|E7;$Oi0glrcPzZ(Gm>>SKra+8dd((`Uy{b%xD
z4B{6B{!NDYr;Poplrb;${CUSP|CB!=<Cnua(f&sQ#IFj(??%AiUW4;L>1G)}omXEs
z#jhIp-vs=>r|T4yf644ml5WMXe+}rrn}PohL;k0-KONq?72UtxkpB(be}$|T{kJMW
z|J8x`Edcy$YH<IpkFo#OvVV$$zZdbV_N(RP=VAXQpZ>+9xA#T+c9!syGXK?aO2qFe
z5Wkx*!~PrCKh3#Qdat-u_4TAj{#opw!5a$yr-8pI|C>Pk#Pf&BUoF3#g!wy|pSrhO
zQ94!mCFv1=G4prGVQk-jtpoi3D#rfR3#5=v@46M;e<SIUe_^fcKhb7UMEsru{-*eC
z2Jzbu#IN{V%%69Qzxit_=@EbF-`)AQ2Jjcp!2XliKTS5j^Hq=ERMI2=3ifyA-;2QC
z6u%A-zk@*hwix19?lXSh8sb+E;`cJ(-)@NCe4p{#W{6)Ch+hNnH^ncBZ`?cQzy2V8
zAJGLYI(}9AjNf~tNBwU-<Ica=0sl*vV*eFB<5y35<e$p^&is1=_?zMv2JuS+@yj>N
ze~mulcaCBH%K`Cg1pH?h=D+nm<CkNa|3LiS2L5L~%>CCnL&!I6?B7qOLFZ5P`QtRw
zi@HeX7V=Fc`&agr>tg<05ByF2m&yI-y#MzB?L+yi<?HJ6C)&5OB+>76in732N$-_T
zRlm%iKUtbS{14giLf%mDzaM}<0{HI%{400j@l(nCgJm-mu8V&K>FqXY{88q2et*x0
z0r+zPe-+?A<7dpjmcMw{i$90-h`;qs8Gk4L#{u~B0sm6Kzta%^R`F$%RJ{0qF~mRb
zEjNF20RAGtzYOqK8{(hx7k~Ws8{%L8wwwQ70r*P+|8l^8;%_*AB9;F5vq+EfC%oRx
z|9JrZ`GEgH!2f**<}bO^AAc+95r4(IZvHO=@K*r-hXDW6J1~FMUH<r2lOFN6z31lN
z9Dsib;C}@0U-c{IUw5}Z{yC&a{P|68{(lGHuLk^&0{)AB!TfDY{PE|L9`QGP;O75N
z0RGj0|8Ic*2t)q&yT>1Y*pUC}AG!Iz55Qj!_*Vk{IK%v(bFV-Cord|Ra)X<{Edc*I
z!2dYlf3zLvPg#{e{%X>r{OS1E&HqyX{wBcx1mOSk9{B!S^?m;MZzMh9FZ{&KzdZo|
zCcys`;6E=8^RHj(kN<4aBmTx_H~)?R{H=ihX}~`#0rPj<?~i{5=@Ea%Ki&L01Ms&4
z{$~LHNxO0Wr#;}0e-!Bvf7QR-{JR72Tc5h0Uw9Vq=h64X3R3;^kG$pn_)jN2;<r9?
z^T!hsA=o9Am!|8lB*6bX;NQ3x=AZwdKmHF$kNAr}ck}NNfIk)RuL1mbhcJIlwLktl
zNRRlNzHsx00`R8+{ucrNfrj{Rc*q}riXr}4U%L5w1>nyB{4W9iIK%vJJ>rjlXAd0z
z>aX1Vy#w%%2K=u8{tsyM3Q~Ri4i;Z_O~vc_aXqO~{)9HW`TGRm&jI|e0{-vfF@OG}
z{`fbO9`Toc<K|BZz&{D_zYh4<{Ep}U1&{gTuOmI;Z~oTJe?S2KLcsq9;7_FQiAVWU
z`!|35JxGuEBdu=!g97lE0RA@t|EGrYpG`IX_%|5Ne`>yS^B)p`zZ~$t4fwYi&VNFy
z{PAx!oc|<mar1`*@Gk)T>jD3(hV!4y$NllIHJtyHZ*}t@9)Q0R@V^K6&ox|s6|VNj
zpJ%xL*7CiZ|HuIR%K(29;NM}m{#yKmKmK;Z^;gdSxcLVH{vYq>`OiMubiLGzFS{3o
zn4QI*D;yQylU~$C9ChMtZJYG3+(-UE-2Xlr_@8~6!T&kwKVRFg?w?C~<R9TDQX9D$
z!v7fHZ#sXi0sZ#_=)XM-$B)eC{q>(^IDUlU<rB5V4*rY){B?l84e+m|zjG%n^z)Cx
zdVl;YNN@KEUE4TIX@Z-7cmVze!2cuQFEqq|@fv^p7aHQ<+{4X3G64U2z~2t|dl>HD
z)xY46f43q2kv-k~qXO_Z1ODxR|9-lEh4N?fi~jiUG2H*E*~`s8IspG>z~2G*PdD7Z
zPJYQB|H+2?*U5=){xJdg+W`NsfIr!A|9bSx{`h+t?q8Spbn}l3z`qml?*#lC4gAHg
z_~ZY;z~9o#%|9Ukf9RjIF%{?M$G-#qmki@~NrONBdc*zqoW0%rIRW@n0Kb*Ub2YU~
z9Y=35+<$L))gOP<aR0rwx10a;0Q_OVp8)vJ*oEhxt*`mx&mlcJex)Y6`Ogf%KN#@u
z3HY}eK7UPJ=Z}A@;q%vMA2<Km0r;~3e<I+2+;IOf`wf5mj~VViw)S=NPYS@F4fvA)
z|4_RBCP?-3pVEK$;~z|Vls|bXZvOKF@aF;keE|Ot2L5Gl`s4r3z+b<goBx6U{F4EH
zU%+2xxc}JL=#PK4;r?Uz05|_d0r-mn|9*h~cEkOb_P6};R~YWURHVB33j^?%0sd6L
zf05z-UHBb;{P~9acWno{`KJcpj{^RK0RKF?e=A7!@teEeAAhOg{%`)lZvN>3_!k5I
zet>@h(Ifuycm454NR8&7hJJ4T83FjK0RN$Yf2HC0yW%~6{3{H{-}FP>{3QYSR{;Jn
z;6KA~{oC}uKmHuU^;czoH~(zF|K3U5|CGbdva?D0^J5&HKT_vys^Trui@J!a;AKZx
z`nU1Axc_kl@IT@?K7Z2ml^;s~n!URJK=%)m9{INpkp5Nl{V1Xc|GB`wkNW*<xmo9H
z)<31c*Y95^@$X+pI+gNG^jPUH?wN=p{O19G)BT@XkUvL({P}$Z9>2AlB!7-vNC<k>
z<F|wKcAa+rq;{C(kFs9ymj~cq3;5FkfBG=Y-|?A0{=-R+_%kxy{MQEHZv^}U0so&y
zV*bb%{`e=69`V<XaPwaufPVwv9|ZVsHpIW8#UKCmruZM{=D#rje+%G08t}Jd;`ldx
z>5u<kq=)g(a`P_;z`qsn4+i{w4g9HJ`{Uo+z@KrvoB!4T{2hS*7{GtEfxmFGKmIZU
zf9(lw{)GYfd;E(wrsBMRG6e8%GUR{FH~#oPG3Eb>ZvNW?@FxTQV*!8maGd{b-}>Vp
zLwcD1C%O5>ciGTkz%E|T-}D3g8GwJafj_I&AOGJB{2389|J?!j(*gfbz&}%+KWWF$
z=y(43r}O!f{`(uXW8M7s1mMpE{KEkMqx3ynf>ghLY5b2r{%X>r{K**a=D#lhe+2Lk
z2mB#J{FAr(<4-WfKikc}EC7El;Lim7;|%f7|K1<}iKh6U?B;(k0DnH<9|8E6pMdkH
z`Uijf_mLjuPwgpg{)Yqb7Xki}fd9NK%-{My{`k)(J>t(e)y@BC0RB?Ie;nZdbrj~$
z*yfM_XVN47+SA<pH39hN1O6<)|98XrbNP?{_@6MGKWF5+`5zC!Ujg_>0sfN>*Ix}k
z`QsmJy8b%D&HrQo{w09_c)(ve6z5OqXMg-NNssa;<19D-(*gLa0sjer|LD<}KX1D~
z{v%0`_-pgr{B;5NR|Edhfd6a5{8ROdKmN~6^Up*#|MLO(>jD3XfdAIxar|34{PEvJ
zdKmw6-25*D;9m#$PXhd7j>G)vzxv}pp7e-6<6JlYO9A+s0RI@k|C}NJOMmmn|FkLp
z&vWxP1mNEU_#=RSmf`qSztbQ848!p&Bj3&cdI0`bz&{r7_cfgVSik$@-`jNl^Cvg|
zKLYT#1O9P<|7}D5=j`^!|As05FLd+26@cH`L>p6aUcZkA{0|$Bzm<GJ<#qq_0n_n!
zvYUT>0RAMvpAGoe8;-xtaq@!Fi~mj2@%Lgk|NDTy>Tme|dpJS*^JSFX7vja9>pIsg
z>u%DEx`?Arysa&e{$ZI$_Wkb<fdAYY?4PuU^rs(pE4u$I+5q`C6-xgcR*U=B9|8Z(
zXJh|5_Fvb{-QE5#NRRwer%3-whrjrfJcMBvb^l~V5%w?V3-UDHUM+-|vph(8Q5SJm
z()$|rcYgnf_(~hy|2#wgFJu3~+J1Havkm><%>JsKBL3o$EZyJq`9~@kKbP&*6@SHX
z{?!~mnJ%5Qjm)p+5A_43Q|l8+Z`W!1Hoz~Cbp9m6^TQk1KT8?$Qup7>@ceM-5}7~c
ztP}D39Qglp6waTdy<~%ydH8=!dchRYwu`cVI>$x$w*db`kH`Ks>|dnqS8xA;q(}ZW
zMY8=>j``y&;6M5z?4J~p;PiNXx1#$WM|$KRnJ)dEpWkf;{;gy9{IQ!0<w>ISPt)pk
z|F21p{7Yv@f9Lr57Wf}B5x0LZ`)7Ojr;;A|R{;N3;QzFt{iW<*?BT!K(Ee)ncg|n`
z0sb{Dxc$xSAL9H`7<&94Aw6n;6Z<<qzZQSXLm&Uc%5nd<^pyRdr;K^2`yWGk<lk_a
z?Ef6riShRX@V`cV|ElJbA--&oiaP$PAM5_}`1@BQY6D(|W=el&``dtj@8@y+^OB^0
zk+xsmKaupP{T=M@Z2ynIzryhOeVtGLn+>1eM@roBZwLNA5THmgxph}#Q^g;9rc!Oc
zcD?BB|Bm#i{T0A}JMbS+gZ=B-zqHHRey98QBR%qO0{$Jqf1Y9dr}via_x$@KhVh?z
zxr}HP1B?9s75Jy;;_=tPU!1tsqy2}I9<{&r3h7_Tdf~ql_<wUCj(=Sr+5W{I{w<_O
z{*gIu|KEXsiJ|?GzS6(W!~ar4`<vLG(!(yI{Q^`hL{Z136Ak^}&i>7E^Uhc9&d&8L
zL;si0mF-tP!apAP&n&|6UoZaHH<h$bC;3MApH6yF7tyw>Wd97V7ydnHL%sc%oQnP1
z*x&2?bCn@~cCtQG<I?#bHRMkN^XEAD_X7NHQi7xTD<eh5ugb&!HPWN_h00|Ass0!7
zO9cL=^Zzt({(l&_ey;1o<6q)-(l#>x<jxxTMvvc9q_^udeGBtD`#%ZrpR*jtFHL;e
zDiyEu?=wj+{3BvxM@gP1<JZ7-B7VJrf93huzk&U|@@En0k$)5W7drftf&aYAv41=J
zk7m7E2rp+TB|Y-bxKg&ioHrKj?+g5I%E0q~#{M$?bspz`*O4Ci*RX$^!#@T1_dXW;
zZ$3c!S9|y;k{<b2T_xM^^xq%&zw{Rz{{;t1f3NXdPkQ8EQSKhUslfkhN^mrP^b=o}
zOT{byKc@|lf8o{c{67fzAF94TmitL9>e=5b{}1HvkBulHFT>YJ|3Y3D`PUElUp*bS
ze=GZY<$oFJQTwCp@67*0f&Vv#{7XMr#($GX{<RqLuY>)a`4<NMBZuJp?{SFqZ}#vX
zN_y1()@x<_)%BZ*|6#y?-83BkO@~VVG_7BSm$SS=dgR|WU-~=e|1{t)zNQi7za_rx
zm`b|SjNa@1;%h>YfA~7L|B=A|2*deDI{SN_e}qYo{PTc+I`IE(DQ<rz`{#JHe>>@s
ze-!u+0{(wG2It>=pZ=3bkNj(a|6t(%`e5w8j{PGZ?SGl{$iD^n4*~uiJ#qYdgk}DD
z&Hq1<9{DF<FY~XK$FCTF8NmNHsz>?1jQ!Vpv|s&Bw;rd48{Ff681OGOw7+<OzxK~G
zw7)UxZht25pJ`~nb(r+`YX5Z7qxhHK<Zk~+;6LkY9RKy~PrL6{gqO2SxLf8gf6aC0
zk6KvY&{-qjB=fpj{)_I(qyDcxT(&>V`J;BD`)}lX`VqAOFQYfh_B)S1$Ak9Id=L9K
zh%Za0;x+&E-GKG$SzqD7zc=Ycn<B!@QA!s`{z9%3<L5-cf7;#Hf6|eXUmbtcuJ!m$
zAU*PL0{&xw|B;64hXw2(QO3N~{RbGXA2M!nw|^|~Zz#d-U&sDA9{w+q9<{%c{hjAe
z<AMK{udsj8Q8NBD9{%5w9{Gp<EZgs#KPLeH=RU^%b?o2h;r}%0k$?TI(%*UhbPDjF
zYH0s_{@}-}{TCbB-%#Oh|Ea+LNJIP62Fmz*wSR!2{iO@t?LQs(Z!yfDTiHM45&y3Y
z^G7@Dn>_U8AL0IAH%PW$&9iDZqOYChA%p)0*0(!1ruVu&@lNdDc(nBQ>i-_37yFE8
zKIMzt@jn~H|2@O~lhVP`f3>z>o&PPv{gdco>F+##oCEyp4EHbk9V7iGd-y+PxPMW4
zyYz2hy_o;c1^!1H@~@oz!yf)el3v6lqHULPhxAY7df|UQ@c-2?{;Jr2lD1#r<t#rN
z#$OKb{}b?k<SU$iTYa{FIq6aR3xWTI!2dEs`;&&q{`YGCG(-E#f&WFof4AZOO(FYx
zoxlHTxPMd0{>|K3qW=qk|HTjB_;;|s*ZrG6ksigr_%H7Kp91{rr(^#m$IAG7-9LGT
z^vFNGQu;fO|5Jg#_?jnl{@TR;^zlfyBD|bMd`%kiuV#Pe{4)*sk2ZY&UB98S{YyOj
zk28G#UFDs!{p$Q%^#7&6|3Sm`bL}wcpYGwm)O7uPm-KhGe+KaHY4C3z?$3V@gMani
zZvUCUKdTq+e`|#F_d5O#Cq3=fia3*k-d8S>{?7ULa^NqX=|%aM%>G{Uk9wwG_pbr|
zvw?rD;rhAAXZs&FTt7De|0{sM_)dD%{xYBKUqyNp|7PGn7x+JJIQ}-Wf40`I!pm76
zGaP^0*guCi7UORo@b7PEf6_>qe-%zMdawH*M0!yd(YDL_tIWR~t{47S0smEo>*pox
z@0EX#k{<a-f&bOOKYs)6|5o<*I{utPdgR{-{I3Q6V=u%03yzcVPt)Qmyqsk;>5+f(
zJu?0oys?P?b-@2cnxIks*Ra3W{F5>O>+5~$M;?v!jjZ>&f3hkY$8Q7csoC9%9={Xz
z#rjP?^~>+W`prJuKa)-{Q2g6{`Zqj`^*dSbmA@~N9_3Gj^QTe3Q4#s`XOKT*DzSf6
zmdszT^T*>!kNiVbGJl=tj}^fGzGCd3F-rQ^O8m}O;pHq#NRRwm*x&j0PZt9JXg{34
zE$lD;W}&m_{@0Qo`L`{V?QdhTi2q{Xf82i9zh<;F7JoC|S#<wlq(}ZO_q+Y?0RCBn
zu>a^W(s;AeoZjpH!%2_)o0ducLe`7+R|5Zc$K(DFN2EWcSGS`3H<BLtXFMSNm0tMY
z1^myV8`o(3*0Mjzx)t63VHzMvU(b3vymTwN{sGb>{s!jHVYT4@E8wp<0sAi=E90m1
z3PSh4ne@m%v|Pqd>4pEj!2gID*nb22rzvAz>i%KUBmX@1&v3N=KHxw5P@KOV>|f#G
ze;MhKe-!xN5B&dj8upKllkx8-7o8Ns%UQ;zV*RpgDfHqWO?t#%3;34<{-vj4|Fj9x
zztDq!v0?sLaEcUq9sl>w#`#mpdP=))MUUSDhVfhFQ~!%${8qC*wVS)lRcF<YhVk3N
z@mG2=epZ0^Z_B~)uUGsY@&Cv${u@q}La+E;eJPHABkR+gjivW`{L4r$>LS{99U%W|
zK>L>%j(=O(-z)$BVmSV#KPcxf=lrn>_@A>sj(^!{GJanEXObSZKOgw72L8t!f&F)~
zzt{K~W;lL^PWRXUPxZn5pX^irwBhr|RMxBfSLq>Q<t(cWpFdV`{FGjdpQl0mzBBy(
zP=-(bXAH-$EY_zvVd=fj|D@sgRSo*T4)7O-asN+N{(SzfFm(S5PsjRbuI&H$9{Rfv
z!up+O_{;x0NH3To3Xqpgp#Alr{bw4Ep9{{E{;6`&xp%$&UmA`-%kreqYy1>u<NU8-
zz1RG?)o}c&^{GF@aQ#`&dX@hw0DAj#NH6LlY6G>bmh+#|i}CX^ZK&F#>Q6Qt|C`vq
z)gyoU8?JxrC(8IMKZT|9Cl=%QH?TfU33;jOdyrn#MYQcwx&6-h|25iB@u>E1GaP?5
zD}RsnR~ydXLX%|sD>N>h|9->yTMpoV1Mn{}96u`A-z)#GGaNsbv0lYXHACm$Z8(0c
z@TpH+g8P3p>s3FQ{CkjIFh$e`yetR#|2Bx<NW=NlI-mSM8s^XStXJ2c3Qv#U_lEhi
z67>JOfd7eo@%%mcT$z7f{xzgW@oND7?*spT8S-x{`+MbI^*G%B9jy1tzkLn)XPqb8
z@1>t&$iEQl`>BrOrQUy&4f)pw@^1r(-#Lc!mo)bG%KuLd_pe5?p1vNuThaNSGMxWL
z&gcB`(BF9^&cCL7srTytpR#fPZ(_Yy|J`P||GU|zKIO02e=F+?J=*`A;rN$(fo#85
z|GjUxe^JDGukrh~;r>PFA@}vq=OF*$4#fS}?$dv#;rNvW{9AzksYhY|1sD3upIay3
z{;OoYSN<H8g7sBC_3s(-r<(O%^T%7H7h^KgZIoJ8F~?8kk2rt(2E^~o6EXi<_E&nf
zd*S6Q2O8#&4Xkf*ZcOiW{Rb(y|LP{o{_F72A2bl_S6}3>|9?Ljx4)kCUj6_4epuh&
zQ(t*6);F@g&7=MApM>@G7t8j0_22Uc<M=hPzRAPC)X;y`1^)Ukjvnw3Q>2`2y3DEy
z{q^6$hW=Z@dawR_!!UkV`_$ij4~~Bw>%IE#Tf_KUF~wj1?P-|**RsB<E2Q>2ef)iT
z0FM8pOQgTo@#8AP_}k2SujBWrr{MUtvEHly_SzroJACTDGmJlLs%$@<o^>mF{Q8Z-
z{!3WzHU1tx1jm0h>%IE#N<;r;7y0YIiw)y%1M9u|Z@OXpwXoi+|MoM?pRGRin+)Tx
zjrCsrH{39PE|}(T{O#<I`)?WRTe@YB`}lXX;reg>bm`yWq5s%0{>m<udawTbt6}^_
zS?|?<`G)aV;Zr}J5**F{m8|!gKQA+kzi6?){;M+dUlr@Uj(?4Y^WWkb{`zmNVf+<d
z=CA+$ZWw<htoQ1_>4x!F=2Jh?Fn`Wxy;uL;Xc&JbGyV17B*Xd30@iySzs@4PnA0QL
zIE#YokG}M~vMQcxUXL@}KTj!<{9d2m_BNb9Wz3R#FaAW*BmP>zzaQXlH{8E%V1GUh
z?~IOq{2Ok#e(!gM<oB9?z8#0he>&?`ycK}%f3e~IO@>eX3v_@$^G_D*y{^BWB|VCN
z3%LF|7{vd6!~L5{?6307)cz9<=MN>U_sX9v(j)#3kUxh4{=SCukDWgK_a;5^Pk&fm
z5oB<~#r10#`2WX{e~ah%%fI6%;Qp^-y;uHyY`A|^?NdLCuHRAq)v(?x|7MUL#V?=Z
zr}9U{?+6gT-G=*5>)2oEP5C$6aQxiFdawK&LVCns3i>}C@D~}5za?}1&7TFNNB-5o
ze-QA0*l_=8C;NNNfA1OcFH|P^z4C8v3eKNopZave`Ex4kz4GsH(xdn_f&4ob#P43i
z^=~Hod*$DqWw`yhtWQ&k%S*xPEQ?8x_*+5$4+H%D=3)O*pZ*7s9{Hy};-3F9f&WHB
z`<M9i|G?1x9N<3^_)jskzuu?+WJCMQfqxe8kADQmf0IxDT@T~<*8u<Hfqw<*(fn=A
zljAqtnQZi4&%c`u{>|)P$a*n<j|TqFpNIX^*`KEOZbkS1JLysWWv!6;SIBDNe-iNj
zbSCyMV*l)J?(X()AU*Q0V*hf7e+2mFO~n2+KHGmf>5+f(qwe;P1OA^CVgJoO+uuxj
z<X_7E&h}>m|L^z5{^?iB{PQ|~tTgB|eClflWB)9l`Vxaa;!__N!Tvd{U*?g2JL&!b
zihnD|KgW@Or-AstWVrvZ*{6TK!9U|MnSW0IT;P8MZGh&V=vA`+y^i1C8t(rrV|~~o
zeqWLv#jl+Co#*do0e;i>FJ^%6Up$w8*H0h`Pf>O!a{Fa-WhK3?W&Y~U8u>=)RQ0c<
zx9c>04f8w4-$cN_(h&d2<#LB%WyDL}e}+LnpY^#O`XbVceMYqH!he(b<K#aV@Gqbf
zbd*1h?4PFXSLeTh^vJ)8{Rz)5;`nhs@ZbA$?7x-$>FcSw72Q8XdgR~2{?6||`4jN}
zgnoY<wLkS5*?*bc+&Nbqbsv%*`B$!VkKYS{|Ia1ZKbQTp9bV$C-u^byBmZXhclQ59
zz<>8O*uRqf>ErosMfd-e^vFMNm27_lt40480RL+Y-#<`ut&D$qH+OgY=NZ0#Ao+23
z{!an^|M(2Izlr^8Jlg*%=~4SD*gqnhVgLTzRN#Lp9iUMDm0u@?Ssv}bg!IV2@d<bP
zrvd*R)3ARn`)7Ojx04?EN1k;1Ukdzx&BmXfw6lN2!~edOm_PG+8NX@|{aFV62G-Yk
z=(i8R{uMV!{~{0lHqxW`)pPu+IRC`>DFN}DYw+L7{^C3HoJCu;W*PkRYGwcB(D6|e
z;Xe!buQK@eTi~z#j~e`|)<}P6`%8iU2?qZt`<Kbx$VSks-u{sW|BM%<FtoRniuTU|
z{u|P8|F<vn*Z%iOFPI|Irt>wc(cS(s;D46EKYx+*U+>ZW(+vJiZ%JWmZ;2$@e<kq0
z)!?6Ym%sMkWbm(VcDKJA`0sD<uVDXmoWCltJ=7as_A&V9{Zsm<r*yUd8sI-}1n&Rb
zW&YZKBIyNFgn87W{0DdY=L7#&=maH>L~?7TroVs1{>@!g_B*}(FOVMjC%4Hx=F4W-
z<Ntc#zun+p@qoYfZ!`E8|LAUi6!_n2@ZZY*n>^ZolfmC=cenp0;GeV)j(_8F+5V`9
z|6Zg=@z38b{aZxmQW4{C0q|c(;}i9N&V&B^Um-p6&+2gd{~7onc?R}x^yxo<^vFN;
zSGRu!@c*1HkYM|({k8v7(j)(l-`xHSf&Yi6VgE*-{_m0=`8V%!`!5Fm3l07`5BY2V
zEe8Mk-ERLofd8~XhW7jPFC;x`e^uOGcHTSlzY_Q#V(`y-*kAio4gTc`ZvVT0|Ev~6
z``N$3ZbjFNXsff#Xu<8z-$VM>@Wx{NF9H6qT!qh{^B$4yU+gra_qzWJq(||$_LTnW
z^E=^x5AdIRHg5kW_9t1lqWjMxJ@T()|5R2B|0>{r+7-C{o7umIOyf=l-G2h<k$(;Q
zTM1Gs{Feg%2iadnyVJ&MT`6ny>o=axJ2y1l{~8VMe_h+NtN&Cxp87Y(UjqoQk`?`!
zUl}T$T3<zayH3;BB+C9T<PAmpmxK0iD8TU_{e;}%<O7tGT<ZSslU~$Cx^HHMdP@I1
zxv-Ca)xdvXq4d}At*Ujhrc~RnzMU!lIUxSmf%x~N_}RxFZO5TEWQAA!_aHrre|{g?
z@IvMn@m~Sj|C=HI)A);LS~M;_{@V@tU(f#Kj{JWN_}{|u*M^zZ;~i-%zO%+zv{frg
zdQlf~Zba`h_LJ?;Cr?pC`)h!|ssAQ{{)>YCyLlhZUoB3R@5_qO9^>bF(%Ws)^c4q5
z{typ%!T&hmKkQ39f3E*f?l4Q6F!cBxLV6Ux%7dkUDRT+`CxHL^=VSjK8>DcO41edV
z?*BIFk-v4Q^siy1@P7*UA9^*OKl0f>;?e#CNss(%*gxWE|I@(#vliU`s*j~G$-}>y
z^vJ(8EZg6~deQ!8fd573VE+{xr9WMsbSrxN^GT2VTMm={g{&6-&jSDIavc9=_NT`S
zyA|F4e$pfV$l=nz(b4|rf&a3jaQnA@BHLfY{ih&w|9eS~{6j}b{|ra_*8u<ju)k(w
z<^5CE3{b|r)WTuyI1=-hvEJ+X$#&8s{w%=17Vw{9;BVUGk3X{o^S86ULTkSs|6@sy
z_=}mphV>%<UIF~MhV$3?pGkhN^Vd@h=dZ~}%KmqrzrG6mdm7GPL!V3k6&~&1!*Kpu
z&Hm2MpI!(4Bfh}#U(Nn?5~GtskADW~QT+4LW&0~wFXI0O@Q*(nkN?6irBM9Nv9oBa
z)~>_w_-`I0{nh;^;V=Hy5H0MY&g<`Gf32BT=C`tj4%yv`KK>pwe0~^Vy;uB}8a_X)
zJ=z_=w*miu4F2t{l3)DIB4^Q7t#1teSwp0Mhy@~k>w*6VhVS3(_r1UVTTgmn5phC_
z^<nP*dk^?er~VgxBHg-n(zZ?3c=g{TL;QBK-Yb4*8RC~Z+#SCU0RIX)!4drW`D@yC
z$zRjeB>SD-e-Dx##V>rE^miWrKLY-y^VdRf{(2WUfBktn^J^Wjp80D%_}fTtw@K5d
zj*|SzTrcu(V*vgVz<)R3fA=!XKmQkLoaVvbNP5JdeuCt89{)cLz+VpdmjM2A)bnpz
z{HlHOpUKa^=>sSq@NWvhzX0(674Y{c$MIjs{9gI9`zjp&3g&m_&ldssD*^vKfPe6n
zn7^z;c8C}MQKU!tQ+1*{|Gx^rzYOr-3;1&k@lV^~FaO7r9`V<Vap(Ux0r+bGe-+>_
zHN-#1C;v=C{F?!PYXJT_z<(d$zugf35}*7PhWLjf?)YyBz~2D)mjeE04e_t^$zN-T
ze-_~XAprk+z<)pB&%6|m-#X^^8o$Sq9_4>A^E>CCZ2|b30sk_<f45=&FZ$Kr_`Sn0
z|Cf(*=TCb8{>^~@0l>evfxp5hf5^aJ1NeUlz~2V=mjnKZb8-Hx_Q`(+=~4bP1O8tD
z|Ko=1$0qi-_w6``(bpd{Tt9}!%l=PgtvLVM3H(jxk2^v9szLnXOL6=*_>AAK**Jb-
z=Ff2O?+(Bp`b^$<O>*cT0{pA4!2BIP`5z@c>i;~zA5Rwv)D3n~{bGuL3gCYj@Lw<s
z^Y{DB-~4ed=@EYv@b3|TKMeRE0sNO-fcYcLujjkIei7*re=W%WPyqhHfPV$xUt^d*
zvVF$C&M<#8g826ez@G*99|in}{Rzjv*k}9?Aw7zJ2Z(>~0Q}j2|1rQn!!ZAp_>6xM
z=@EZ&w)^<mCjfsQ;Qt%of7_7%mCT>c^MzXI`TvF?|094uB>?|qz`qjk4=BU=Q_uWr
z{x<RVBRz_LDf8#BP#nJw2*6(q_*Vh`2M1#QR_0gpwTXWz=@EZD^Q(DY@E;U_zl`~n
zztF3{RV7$d9z1wB=5O=KZ#w?W2mY%;{BArF`*+0XzX13@0sOa&#QxS!dHhrHGxeXT
z{fmMBlfZu_J^y9j|C4sg#tOygzXbR{1^j<M8v7^5=)Vm3i@&v|@=h%uO~(GIG5W6n
z{!at{SI)%#;TZi_1OLAR|Dz1!FFi*8I^h2d@DCZrUq+1nYk_|q@SkfKe_1j5uLJ(i
z0{>r5$Ne9P(SJSge-8LBG>pHT82vW@|L1}KP{a7ki_w1*@UI8{ryIs!evJN`+248n
zwg&hwG@QQ{vVVH#j4a=%c}rE_VmN<o0_RVo0vx~F0RM}C{{uSzM8}T`=Jz^(T2Fer
zP1^Ctnjp_#bGV`6{9$we{+)n-E#R-E03-f-pZ)(h=@EYp^E=O<#suIGeJ-#6so8cB
z?SBdIKYJMFZ}7=)I)6w8{x1XnzaD}88)NiO1^%x9|2V_^-4vsL82C2;|Jw}ncXN#X
z>A?S0;NQ<Mf49Wwp8@<|1OBh8-~Z6YZ)=SHS-}5w;QyKW{R_>%Ek^$c@Lvb~Pc)3b
zju`!Ofd3o7zn@|JS-WIF)cnEINay*lS~rdVJmCKi;D4L?{Vy&4p&0%1f&ZJpe?P<c
zOODaM5coF&|C&K~{!5L~zZm$x1^mx4jK6S<{-wbGZQwt{F#ghG^e<<B=lRn+!2egn
z`BMh_)31kjEBg7<&xZ4-LOy;wpWnPV!0~$l;9n2;`^>@lv!3}^bffROepS^;q(|o;
z>8Hr^rxtN?Lq(iFObNhW3HaXy{I44B-<SR_Cj>A4wTAomp;O)bMFIGi0si*@|J8>0
zr|kB}UuKAZ>uGNOO9SxN0RHy@{|oszf9jdvEB~J*J<6ZPT*>du|H}gK*8%<}z(0^a
zKSSr=llT{pyz(c_@cCQineO;s9)Q0A@P7dKKP<=m9n7C5hhOKb9qZ0D%X*jeDE_7V
zi$Ci6NsQmp0Q~C#|A&D8S9<;d#lK&iy#Daw|C#iNzZ&q*4Zz<F_&);tH_-D}h(F?!
z{~E*dTTOuf$^iVE0sjWT|2O*nKg3_;lmB7Tqxf5A%lvod&(#6=+W`N^fPedB%wNI$
z6^>jNZ*5jb-8RxA{tV`?;cZ3!&kw-A6Yy^Y{C%#*{K@hD@;{06h`$-c|Aqkkp)aJr
z^Ze%%z<-$`{+Z1075{05_=hIS{Bg$rrU3jYfWH~=k1~wkwLasYX&Aq?%<s(qTLSQh
z0sp6fzt#}{7N7Bd+z|g35dVq*{DT4iKLP*ChWHmJ_{;w_hWJ;U<DP#O1>nyD{Qm;{
zX@>YOW`3{y?{A2IJ@Y&B|Be9s*?@l&;Q!Vz|EKiu7ymB}^MBzacl_@Rz@G>BKLh;V
z8P1=xeDZHLoIh6r{v`qUCj<V^0sno5^UujX`Ii{ZKN|r5y#e@(0sj|(f2`s8uc%M{
z(T3;0+5rF30Q_ZuzXkAbyBr^XSNP=LN_uqs4WH}I{|5r_M*;trfWJ=(=5O@LpG11Z
zp9lD>1Mn{f{9gh7{ib35tv>maNssuWfM0y2bBNF9Qh8~*|5ye1zXtpx4EdA1hrjtV
z!;n9<fM0wis$c#UfPXXKA2l7vKhr0FCh1Z9TL8cKN=(1}wSfPhG^A`V>N~Z}yaw~<
zGru~2<?im(sr6$?kNA_%ljB$Ai8%jX9e{r=;NMF7P~2*nX!!nvBIYmD?rSTZ;_qSj
z{)2SpujCB{|5E|@8v*~vfd7{Jas1cqCG)>QTwFSe&L1VcU8l9P9`OG?0RINSKN;lz
zqjzBb1&NYB%Y(m~^oT#_e3?IVd&Mpy{?7vbf?L?%5hL+-ZBOanA{U)M)#G;o=|x?n
za|`*Vf&DA@k?X?$dEozhFYLdpw=_=E_N)7w=Fb)o|8GG2Pc<CB8rYvskGmD!KihQt
zx>Ux$fz_h@;wvR-VHY*7P5fH{|F?ku48!rO-##*aquEa_bp9N}@hiF5oj)%J;O_wZ
zw*&t2OZoTDwegqF{7V!#FLnO8q_^udeFgJ7uYX?+z~6%tU(Mg5|0)50{CSvvEAv--
z@b5Yo^Vb9ZbpiO30e=~FsfwRkzP1|AKZ}!P{&>wlFOeR_zm@r0c>WUcdouukKfr$#
z;D6$A%)hRWKmHohBmTzAWd1w(-wwc^4*0JD{2@d9clMS1MIQ5if+7AjC2szA1Mp`8
z{_6n$Ay44=7p6%5LJ$5_(xdoS%yRQL1>lbW{wUy|W{7{oev*HZ2Y;a<{>7zk{*MCi
z=K}tl0e_w$|5Fa|$A7vZ|8wTJ`8NjO&j<V!fWL4R&Y$8`$shKJ|AnMS`I9atJ1SAu
zi}~l%0Q^OOe-Yrf4Dqix&>#PA2L76PZvIUH_)7u*9e}^q5dWHkB!7lS{2w>)r;Ev&
zN`#NgBK}_l;GYlpYkG2D(|+wfr)8_*^NZ$#IsV#tfzk;!QNA{Oeo=h2<ahr5@K*u&
zD**osfPa~RzvB>p{P!C8%dd6we-nUz3G-98*+ul<NAzFCPc6ru6=$E*CTMX^4NLxH
z)~kiupISGa|1Jam8-f2mXZ-K@uK@m^0skw{iOv5II{y<xObef-;x|AAikI4Ow4Que
z>W69DjpF!EmEF+!Q>9l+Q~Xzh_J0oAKj>`S{_4YH>;F37{{`^RoA|%uzZUqn0RJ9&
z|2zKcfd4nZ{}V(0`Hla?WjOzozE@}F$Tuo)RQ0b_SpPWp{~l^XUg~;N{;db?{}!}=
zks<$TedgbW<&wXz#;Np$TD_Y0!d!pv?YRBPX)^x@8}zC=XCc;)W_^m<keA9|Rh#0s
z0mSd$Abw99#!nvm|F`q^Cg9%+{HGblPptl%f&XQ|e>0unQ?;cZzhd>@3jDtZ$N#zG
zx&O5Tfb!SJi@t8^|90R%1GImRq5b(W_Ww@c{{v|MFXM3gmA~Fzecjal9$(7wC;C<t
zasE;U+W)wr{e>~MKMDB%4`}}gL;ov(y}kOnsr@Oye=cbMC`0>;V{Csv;NJ$?zsAu2
z%3p7<zHVxN8u0%Tw0~d2@v}6>_74XBUjhF&4f9{D{+Yo4YvBLA;rJP=|7hU98TdbB
zxPFM$KO6Xe2mJT>U-Hid{{I2~pXK7?kKgvsr_T>*x0ZIAZz;X_nX~BYwK3{HnSjq<
zl)rwyqOZTffB#K8{8?o@{`Bqj^%VyHa-aH>Bba}_PyL?^*Kbju`oxp5{{o--Wn;0v
z!l(W_b^LKA3B6zJQ-2E2-+KO4vOZngubzM7NH6*{qHR|pZZ=cN;d*iWPNyoRSD&9P
ztH=3Y&;DwA-c6@ot>3gcHvO6y_4zUKfBSrF{D;Qqzx8yUzf?eZsp7AXSABi|xiWwC
z{89RdwqLzJ`;cDjQ{S$M^T+x8!BCJt)l;y42j`EzU)}$H(j))E>t+5r{l!-jE4|9!
zI*Ok-r_txXtRuRgztSdlQF^sL-!OkgeCnSzjQ<>;`kw0iO#$&T&!_%F!~B)+Q-6nH
z{w?&W|K1S4VxRgV1AnPceVxI-+^7B^!|^lfQ-7nO|0;ayCmQ@Ked;6X{;ifjRjl{A
z|1d|Lzx|i`g$91*ua7r<{j527{-|dDVvS4JpGJB#f3)%Z;r#nC;wvqbUd<mbG|JD<
z^!X!nB+sZyz#Q7Db)jMY4God{Vh{fF4D)Zt4RZc-@{3=|RQ`(p8^iot%KjA|{w;?2
z*Sb;q7xM+9IDZhoQmOktbS6H2b+Erz{%tYjuU~!JRGdFbU+B^PEu=^JQ+$(be;eyX
z`_BOFKg!Vl{9|SRd$oVIq5XdKMKSt65u^WSG5SBQuHUqN^4tEM{QMJ-*3P{seO_mc
ze53MLRsX`zKSfjpFZ0F20#q98S9$+SJQAz)YW)3~pI_4bYq<Zt{BI;Z%D>bFZh!Ge
zpzgo%KAHde=T{x<KS}J|QPiqhE;P))d6}|BUi`Nh=HF((e*xf6G0b1pKK=JG%wJWv
zxZ^h&_;0^X##HaWHuhKXRw2~av#*a$pC6<DV=?N}qp|Uq$Eg4F4YB!ej8T8m?XmeU
zj!|E|I5z(uV$_%4_{aWgo-^hD%N}}tyy)xy@yH)9|BM*@*Dr{z{e9{AZPBLxcK$di
zM*jsKdOhCydhN}B%<mQd?H+pFPhUUGL+|BZ?4j5F^z|h-#n%3RdgygOeSJ?4y;u8l
zJ@mStzCLIyK7UrnzjQV5d8zA<AiX%3h-lm8|5+Y?bGTldKa1ygm0q>$(?aZ@IwHYV
zR%rWGdR4uF^vJ)O{hik@^MU``Y1qG-{R@>5FLnRtNss(P;$clHZLAaR7nh_;ui9Tx
zg#E3Nvi*guR|}<A>o=1g`F8++@%*mREC2dSuz#UX|7S>#{9A8xw_jXR>Hdcq;@{xY
z{}4m`n-{wM#VM)oKgn?Y7(UKl{LeC6KQ@YoU8y+xU!<h&|LjdT{!yR)wWLS!uV3u;
z7b&6p=iZF{TYUPTLVDz1bGzGLbcyb78T=zz{^I|eq5W0jVO=f$A|$&1y$1hkpZ<3l
z+F$V(x4%Hr{nKguh+8bOwKlSR8Rf72hm#(~zr51zFRFC^Nz<`^p-=y_NRRxB?{xd$
z1^mA?_&50U|I*-}FU+Vo$KMj*f90QX`@_fki~kj*NA1tK+wFf3@Go0{{i8npXOkZJ
zXNksY?XLp<4Tko&`1F6#(Ejwly8V{||CbHzkDTBy{%Z{FPZhz|+P@6=_qr9wzuKq&
zo}@?d58dnbUk>~eZ^8c7Xn*bRL3-rh0sO0h|K*1Hr_iT=v0?sc70IT>|6$-i*l_=@
z!KeRGhWmHT_qqL70RN@aas0z4`iuWxNsr>+D3V=k|6{=4^!(K%e*PuN-iy5d_*a^|
zg_kI5`7)j0+Q*N0S+8EB%pXw|yj1hQs$N5SdtaKq{(i|{$s3CE*OdYI3jzPVfIsJa
z%-`UXe>~|Ce~uXJRGj>)1Mrss{?&lL=tj(Moh0)oYEyK*=<zQgJ>qX>etNvkE+YO<
z1>i3S{7(Y@&DUZ6s89YcNRRl_#bigt$^Z8N{0jhoE#O~q1Ln8J$oLoA6kRX0i*DsX
z(j)%z2PJ>V5&vfc@K*x<zXSfX`Ix`hCx3s^BmStE?5Q~U>jUsF1N`d%{|AQrZ({zM
zZqe>K|5VlM4f$X3kmRRdkFbl#{}%)B*8u*10RFSD$MG+Z$o%o*&m}#IfA|qM|H}dR
z>i~aBV%NNHds1Y^+=ThVV<mr!3}5Ffg`itGp7e;nUK}i`MEJNM;{R#@{szE*0N{Vc
z5Pxf&KmHdC@$V1^TaABR0RHuW|1FR|eWE!2EzF-`Q*^!P@lPT>ihq_k*itF9U*+-t
z%>ew(fd3u9f2U#oNgglb@5R5^F#l8m{<j10ZwCAag8aF`5dVlz{%Z{J?*RPo2H<Z4
z{09U6-G=y=`sDxB5dZvD?)+&Az`qml*Ma;wPhCH0=a1FQU&{Hb7JB}l&DT%*1AO(&
zA9l?D9|hnKeI@hPdH(zy;Gd+fzcl{jY^nF+KZ~!wbpGbYW&EA|8w2pC0RDQw|BZn^
z>XX04z~3QGmZ>=TKMlYi2K+Ao{;$>jH!c2cKKVcA`)_*uQ=fG6ZwkOa81U}}#_#=x
z{4bo~FMsYa<bRep+1KL#MF9RRz~2+_-)G35CZGIE4Ed8^>*oI|0Dm^%-y84`QunX4
z{E3|GFaAgH{VP3x%Aa=ge-nT|5AY`g{&aQ!OXIKg$$vQC|I+!Z#Ko4DKdk}yCj<Vq
zVEq0Z#pgfaQ)K+JY>KWI+C{h0MtXGqQ~!+QFXyer`RA4Z{KbI(WxzkraQ&O_lfTq(
z{hLwe=Kmo8e;MF!0Q@5i*T0oM`7;dHzcqk=TLAtj;C~J9KYK0CpGKejwWLS+6BZZi
zRGj(K9)N!_;C~nJA8)w-X64BIkJuDlFSLtpWrX4WTNU$H^422%e+j@}1^C|w{Oi>7
zi`x7X@yY)RKfkEYKk3iO_&fQ34Zyzw@E-!^&nET!qQ)Qf$^Q;Nzo_%q1O8nB_-g@w
zf53mi6rBGJKKaijJ<9)_=iTuaAO5NQQ=k8v?mw>u{6B;I>7nkQYw@>EmHA)TE!(^N
zRrT&^n7^6%+Z_3y5P-iC@c#n%vx;#13w`nrCq0UPqqx~d#mT>C0R9bte+S_Iz`)<&
zlYhN|zkZFIKQRD*3*i3^@Xw_F7ngYY_eX?J^Orx<4f#{^f}1}n0RL9NzYFlkPsRLE
zpZvS{^D}+^sS-Ckwfxy90DlMI-wpVe8~9s%^4~{#l>ZfL-TZw4|K|B}PLREAH`#uP
zoGxqB=LhO1w2N-#5X1A&O0RFPug{9nzs5ta`|0bw4bLwt{)jfO>iSbX^!oPt`VzzQ
z>wf*4JoLJszCPIS{Ic@T=+@ir<Hs})z3!*4Key<Q^Uuq_%|oyI>FdA0^vC|mTKo0&
zlV6BU|7HCj>%$)Y%VYHaZtWlY>+RLoUw-kA^<Mk~V)VZyMtysX@%xiU`}KI~>$x8J
zm*LU>OV<2x{Jr!~zy8O1omXGKwjnnC{;$QRZ+SU3{a0_qravr3{Y^3IUt1R&|4}ja
z|F&0R^I!aGZ2I$J?Eg_7@$;I$5<K|5^vgZ+-%DTY5q~fJqaO2*KHl~9?>*)peS3ZV
zcn`gP{;BIt*Uvq^mgld|&!27r-``bkxPPS1e~PW{ML&O-Yq)<@{*pZZ4mmzQi;!69
zy{`Y00sk$4Ki=^CRt=xOS9Hhk^jFop4EK+s;$aCY)I7V0`(NV$|HX9v9hbYC{)(0r
zm0QZ!j9eLiXPtP@yX&l;OW)rl>M}ZO<Qt`bP^(vZwH&k3y-y)|->3g0jZ&|j=37my
zFOPNypb&H`%SkV;zargg>3f}Dk?||ckv|ae%c1}D&n~L}H@3RJJ4I{|=KgQ)BU>t7
z&!JuF`pc(XK6}p9LuMZvmL-FiVj<tl*O8f-_D`}#9XC>LQrPo`3Arc7$Eiq)I6Uv_
zAHmY3VCj8CRM6`{xn;_(YhPaZQ!i`Bt_17OpAxK9^h5gU<$YKE)GM-M*R`+J(7N~v
z&`SD$XG224M)5yvg*S-*PHkL7>eF|A(MTbwqjb7U>?=y|)xLzbI6kr?u1{o#(<5y4
z-zfIgepcK{!4V2ucc$$6qVd5!t)~m)tVx3F#yzb&FFDM*vn3(LX6$dJY^k=aN$vEr
z{ynUx<96?+?fS10`)xmK>`K8d{933^EUC>qh=<xDm+4R3@?qlq>pluy`qGa*cNTsW
z8vEIg0|!`lw!Zk&j|1a+zCG}|(EX>qbn4ru#wEU;PVW<U&HgAoE_52*f~*`EM~r)i
zdWHH#?h5Z6S|s*AgZ4WpE^f;u#H2h=r@B_+6YEKFy%x15gx*=ahxI{4TxemhxL)tv
z5Z7}H1$fdxdf$=|T9sp2J7&;-oA;6_MFm$)n=-SYRQ!qS|6BgQ6oIj`issCoQ4~%e
znlWO;u#90@gTt3hnLDj0JbPAnPG;6|$7LQ@G%!51WXh~d!&gq5Gj|5n4?S*3#*ks*
z^y0Fz(z(YUd+Zdsk0F=No_%S_w7IkA&6zrF$kf@FA6qticFEM@DKlmrTT*i6<;RrH
znSI%`sb%4!QPZ<VP0uVEI&$R5;YA}dh7OxHVrs^y%uyqz55Hu1#<Z!^h8GPRK62PV
z%TmYKxN9a_aq|z2J2<JoU8kl2G2e-jM*j!f@8o+cyLUJz>5%Z<J(lnJKqxn<e>kVN
z_0i{_iTzFD?bPvD)D?4`+MlSS!--v-b(LCOCatgFx?HjB=G${}r*U?#E(qEzo&IkU
z+f&IGFG?4`#3qi9uyTWBR>$s;*p`am>&Mfjvn~VFWpiDgt(4k)t&V>L7YXj)NV4ka
z`|rVTD%tu3YY*3c#NT_gK)t9<u;lScyjSHf_V(_2@$&?WW-hHPu(x;Di_H=&I$6<*
z`1{oss28;fmi|rMmNm=X-d!)ZSD7T%WVy)R-d!(#nqc+jt-2Pu_V(_2xxMJ^?q#gK
zy}Mp)m0<PhzA>$hw6}NH%kB4dZU3aby}Mp+zn^P+@%L0M%Uv(GKfty9ZT9x=`s?j_
zHM+aY608HeSJ0aHJMb2$7qto2L1NLZ6x-Xo>%~S1R=;lBik0*2?cMb!+x3UIwm-qH
z@9(P5u<Hl7>MybD#q8C+oNd=1*}an1cG0-)8{c(4tLCP`@m+JJQ#6S-?Hk`U9+i_A
z{_5{>IJZB8R{F+wjXRaWuiCy{<4gI9KP}TYzH5A``c1^sH@<7UsQR(?e$-wqE0@i0
zq76_s@3MKi#)UmsQr%3$_TSk&U3*e<Bi-5{p04~?^{*TDL$`8i`>y;~+dpa8UToPn
zzAOLpXkC;DZQnP(E6-JZ0`+g7_^vz`{UOT5)Kz`ryYebsR$KQQd=Id<@5;9<-oDzd
zAHZw!cq3N+X7`Ibf3CFa-Tixuq2D8h?Ums{q*LsoPW8yaT78%WV*5e--nrP9>YbyH
z!eE#EwE8gDi~VQtd$AbosCRxZlG=~(9pTvCS$~|PUd2`L9O|ea&F=+|vtDf?E@{GQ
zg_bIhRK1FkijS&Sd7?5z)tB?W)IL>xHP@^Csrp8)S20obZCtO~rRr0OSCokTO4nh`
zAL05OtzKP|D_*sIC2yavZC}szg<5?J*B5K`A<8pRO68)HCxh!%Jd|%f*GIMOqg-F1
z)z@%+rB>g>^;KGZ2iI3?^<f@THCjDCx?$C7^`*Rhy;fhv^$l8m1J^fd^>j^UmnN+~
znG?BLtIy*47OlRJ>sz(@3a)R{>T9{aL#uD*`eaAF8iS%L)lq*8zZZ)zzZd<e#+0b?
zv!5ZX6^k&x*Y}g|s2|Sn#UjH|Z}L6LvAvUjprbzQ*w4|9dNp_LLG7Y{okjVIdhSB|
zXZgH^sHZ8svy?dMyN=FuXTnk6HG9*|3P*j{QP{Fnev19?&D)4Y3%?ij{AXtEnj~5m
zMbvj4Jt@wP`mUp-Wo0_*yN-r*zsXVGbu_fB$&UJNXLkh`6qV#%X$_e(tz^oOvT5aI
zLkcc9^PI9_Lkn_G9XCENuVC!BQwz=<d&Y!w^2UyzFmzZ!!KKs63g(s;Tt2UCLf+}R
z^7KEDI&V*8UR6A$Y=W*fin9vXa^$>OC9|i_{4bQ5!E{4Mk!A6eIn(%-%GBBOW|jS)
z*vHV!f&vQmG`je=Z`M##{xIT*BYT(#fOl_^6}Q30momRS?d&dFX=9F>Rz7uFX&K#~
z=&Ca%3q&94)nFakQ!uO>so2~{XdqjLKdnw^%l@mdb{bmZKF;OSW|i?sESgd_g+^ka
zp*SIv#^hXUNXd*@GpEftX13i+w65~x55^{n#?aw%tQS$TmQ9;8VIt{Am0evrtzgEi
z>9f0bYaFyArj*RMbk>B+FQ1rq<;2Uaf`Tbi=1eUfnOQJ(%G|7iDO0Zy<G@i}QZ%Kg
z$oYe*<x>hu=gpZ`aOI3SW%H(#SfypfbEeTvPHN}0@&Y*(Xq94=TSI2eE}J&wlrzsg
zW^UOOv2J(HwBmy4bEaHA%^EVdY);vfOK5rZ<@VD4u^n=HH)PIiiu|PW{$LhF;hNy=
zIe)v+^60<VL$}l?{Uvkf{^9(cn?<23xP)RN%w}_z{Xt8IPbr~@PAQu`r(nvQOD9-q
zMMH*;veL?j&<nlI5^w2+-X163(o4~hVI%DddMzJfza2KhuAtZQA@XgecuOy&8!q13
zFGGikxAx1>q2le(PDbjmp|mRMGQ_JotjmLD46i@ad6e_KK<z5IuY9-0zCWO9yPsQ#
z+M7u%4z1c|Rz&;|6h3Y1{K+pQ{v*A<y}te<iA7zcbC2>(BcF_@^C)p%CfXU|?Nt4l
z2L5c`E{&IJq5F$RUXgzb`>T!;{^C4K_dkW|Q2UG7Fo~CHq5F@cA0Yo^7CQaK`JC?m
zq9OieY^eL`>*7ydBmQ!q`i*p*gY@%#>Q6B6M_HfCOSRDXN0J`JFT(Ltc_R8xRO#{i
zh3XLhdN$1GrCR9zKhh77e?IURcc*lJ@sTO=PZO1n?d6*EQt!o*9;JZ#!9Ml$C>i80
z1^nW?Ugy8X;IGc_)%LWRUG(@xsTRer0{DyT2em)duj1MS#cwpXKaYOyEV{qgAM&qe
zf9LoU*D1RH@gzq6i+%e4Mw5!zl!j5avWfM)==_<!PM;UsdgnbWvGHfTq4U~J)GNJO
z-plz%i*BV&ZJ?I?Q`LU8@m(ZD@oVDvse@BG3B=uWrC0s;9<^W8x%^c?#H8yedjFlx
z@iXa#ud^tBRhLV8$j=wIIlQ6RkGR{a^oqZy!C&0(79~qAI$xDuRqSE#PfeCvl=Ftd
zU);S_dgXt&!9S1vh0a-&Ue(=U@ULY59NtjuX8`?IdgcES`JiWM%JmN6{b=cA-6r((
zGd0e5GfU|oR27<D?Pnv8KW#JX06kGOz1n^Y>s7j``c&4d`<AL+wO_4&OWTP}BdUUz
z%^bfh1{Lu;lKv~bir+30>)v7)QR){_a`?nd?B*!?uj`K;I`X)%qj)__Gi><qQN!%*
z{Xa_+9xF&>iP(#XHG_IBOwYs6Y9;-*pObOEC(cUxEc#B1o@o)!cI>+L75SVC*HbQU
zqc&9zAgvV_T}s*|yRLoJetu=wwJ)vwnV!#SKP#R!ksXb3^h^ysSJIvkw`#vVA}hr+
zF}KlkH3^B49X;dX-bvp(vSZv7v9B>3TNCzMH80-U@$v7wpKU*D9PLXy*Yi5u_YGld
zTRJ_nk{B1Acv?T}&a&ujOHbW)-CZMSU&1d$`)?u7FKM4&iRW-=|Hb5+XzjNs{l=G9
zW+u|}E9B+&aXi~2_P<AD$C$YIEfh9-W+${N6c^c%9&gpD`YH4*59L9M@El0n_l%2w
zCxx~V-lB~;#50iE_+>&oafDWdiKEQ+?RxGfJ;~}b(27nB4`^H}VjiY-`?;EMWKBWD
z+EyHIO-iSqhXyn(?N86`d`&E4toSYI(VLcr=oy{<1FUVA$Y*&52^~GdGbprc{6~qq
z#(va)4{IAGdY{&W#8nl<Dt=DiBegQos+l+_99h|m;zv_{B^~$f>>ro7g??{pW#Z7=
zmX4u)9)05?^0T%j##c{Fk6W~~C-r5)Sm~7*ADu`;Af+HK+y42fq)AM()`)iWKf>Df
zI`Q-reY4|+j|T2x^(lx8ZFz+J6T{XT!H{TW4-{=0m}vEh8}OFh?p@ceUD;6(w{rXW
z@$`IEf}KNlUxp$(YRJ26&&Up6In-0;(3IYh9S`-e>gF95S@X)C))g}otV!GH`6j`=
zk)F}|B7VOug%sOj+D`2IfIj;#YNZ_6y{EM!w0n15s%O5YuA<Kib~IDIZr#260O2RR
zXndp;(*7R4e*WDF6oU}uMTl}h<lqgxMb3?<HjbmViX2$S`HkBy`oC2$(tbs32U3oV
zp&S@bbs`5s*G29gNO?dp{y_AZ$b+9n{}Y2)4x~I7M0qfV^5EG$tv=r+^tAKfmH5!i
zDYOs4SwLe+jH5v`jwbOq63k*OsqrJmlRbudYGa6EJyEom+TIXnJuCJX_x=2j;%R@0
zw2yS9J1n}UklJ2Dw~*uM=U)<=m^*}S|E3X(+7tF)6}=<UQAp3=32(YrpVCNuLEGD7
zEfkmdP9pJ$vGyJHVNGuuGe<Nook2ezn0V?Unr>4PqtS^yDKAC+7|PRuH!fUy*^!Yo
zy(rg{D2HcKz2J+dZ76TANTuazLl++;o^88q=t7EX&n*LKIf&wX9K~7iZ#mSu^IUpg
zOmoY=<S*LuB|Wz%Vj=hvt$pqJq?K|hi{_NK;^{w)Pr<l|e%_Pjo2@hl?QJD3I(^2#
zj>U2NEgDGww<PSnN{qL$G$uk;;-U)D;k@XYkHlEGf%2izl@IY-4yU>TD`Cs2(VLeJ
zqFgB8Tp$iR7sT>3%7xP@7YZmB#F+d~LN7ZP#>9nYJ|y<pdu&JHO$8ltZj0N}Lb;^o
zyqwNCFK&yN^F(aK{4M4>F@KA>PR!*ZE@FNY{UOFx=!1ca#Qx&;uyzczL>s&2y)pDP
z4=o2gc#xP6LOr;z?foXcQ=mPcm`Gk*65`*X=MNWB?yP!C<Vjr5cSH<}iStXE-x7OR
z_PlHFZ$)I~ptz80Kk2-m5bcMaog}@rP3-TmJ~_Y2{m>jA>e`Purfokzj^-nIOjGlb
zIG%}P+YHL5M9R%EaVcBIQ@{6&OR+g4wEqU1F;RHfjD<8-#)`P~<zvXo$jZ}6djn|`
zNSjOA@2QQ^xV;yiM$cJ_W9_&;kzZ%*NqtLWRLrMh9Gn|nNV!S-A#YJXgW^ojd%h#a
zaOe=qR~o}1%Gc11)}4j>M|RvsIowms!&G<LH`WKeD8>WnXQ$CR_5GI9=>1oeqa$g&
z6x;c|zn$MRh%;pEzbG;8<&`w|zY{t)Ze;<n7WcJw@bQN7n#P^o=Kbux5zmh%Qe1jc
zYzwGwX#CPMrqnkyHpJMaN4xA}?)LLV9;jn`_Z%0wK<%@iU8Us?>X$l^OT`pF5xWZ7
zzi3wq&Cena6DaRG&n2iWA_rUPm|sSm8|-t5uAFl|yKDF5|6woZGrcswrP#+?i^h`5
zb3Ts>QM<&?ozEpxoqg_QbIG5(o^N)J8K;&twqC`q_|H~HVp2i}`MCDujDzwO&nGLb
z*k46Ay?mBgZ=XIs_NV8ee<p1U&F4SSIgc18!oQ~X_>LCJu`j7#zM}b49Z!Uh*j6!$
z^Re!^v3BJzy{sM1bAkgpJq{p`1oDVqwcX{jzkS~KweaG3sU_h6dfr+ddw=OA&Mnu~
zh&~Yi#rax6wzX}lJ(t7_p3eFkI_ncU>z(}|`dDnQ&Xwu?5>e;ehU)%r`F|?{|37)=
zSzL+^=9tkrx?MzFM8370b(6S`FJJBFrHi@F-bZ%t<m{wFl9$In(1RXYPR{Oaef}B!
zT>MO22#PXUykz&z$W1yV<8FFR`LChnJs(J#pVU7im!7TO@Uakx?Hj~)RP6n`wvW$o
z3esu2HhXK!DicfnIcW6+H9rTfo_SX75X(P$<~g7DEw)q7JTGw6mC(t!C}J>+l1cxg
zT(?tHWcQBbB^?s6+q>sIp?iB)B`xp$Kyv(sr2dgSyV)B*Y5x4PEZS5(+muQNGLtT$
zEv~zeHWe{wXU|Ra-W7v&-Jb;yi~Un^_HQQF<;fq}&&|*|nO$<YE`yenxsJZ-L-=&{
zCACfTW<oacaer>44i#*btSJ%u(femo7n|62EpJ<jw$1O_R`f?JZ%fx(b`f<uxz5?P
zWWMJlelALy_|J72qCzp*PtGe7`P{tv)ho3>p)F)BT|;QvA_n~YGtrg`-p-Dn^5Ez5
zOS_t4-{Y#|Z42c-U2zr9^E<+7Yt*w_MN-o}&+IItvDKMmvOWDcSiG?NIfGZ!y(bZ;
zY*3fabt)EOyArPBg}uM1Rwwqm#Hn@66=EOiSunK^F_zXjx2JVcM9LjX|LMHdem{Vg
zhw=L~ULMIy5&wbw{%Beb=J(=RFR>rd??d^$c%Dm)TTwrf{)^`}#rsk8|9E~c`uaqE
zPsd#=!tck?ay-AEz)R8Jr}F#LX_?FK&*WtuFX_70I)~q%OUv`<zgI!OOYyG#02L>Y
zwu1yqMYZb(wf6Szda*@<>l0tgy4&8KuDC!+=)CjT^}{Re?L%D^j(6yHDbBIC@9Eg8
z>uo~kEY($)VQ;Upu&Z9YOX&7gn*7<m_V)TG9`a}CcPX~_6+aW7%DGEIx2N0W&p)-d
zcRuyjrAz310<o*^HG6xJ`R;;#_u@^P-}&@hmoCAwch*%w?^fB{|3B=#3w%}8nK!)8
zIjARrD#mc}(sDrB1`tdFNNDYFxY?joQ^ad8Cm{(W5R#aLn_7vNc7oU`D7L<|Q)uhF
zFX7b=w%Wm|(_-z{!P4p2(YDUKGc{gj3dOcw5TR9h|Nph0=j?UXStl2DzOVEBX8n@0
z_xkT=t>;<Ky05*~v-5EhC9*wL6y)=UUVE?z59#e)c;T~lL!Xa_^rLelfbV05J|7S1
zwbhA&O*ZuTcu1eK%g+RQkD<@ULwdel%5^Up)#T%(N(5);62teTq0h%d`g8K=A2Ia#
zcu3C{EZ041<j==Rl?d3%<+^(feLhaAgz4RK>Hpl&vxUre3G?<L7hh@U*^=hFM9!}K
z@cBm#JzLy-mk8MU=DLZ7J|8DlB47)h>rOHB`8cT(d2fh<;5SD9Y~k}=BAA{B{)3^<
z$4QtlJwk4f?-+Xa6!|V;dW~HCyGDNYCiyOrvs*cQ{#8S7Mi+Sj5&?UkTz9jf&&NrX
z2-rjAx&}j^kCQ49uoug9a}9kyPO3z3Q7$oj?=$rIcu3FQG1tWmeLhaAM8F<2*S%o$
zpO2F&5wMrdb$@T@^Knuo0`|taZjYhQ#~(6sF3BZ^?;eA*2hVqj;Ho_E21B2Zf7;;J
z<k5fF;Gf9D#~S=odH5fV{FywQKq9Ei!+&My^YN=q{0({ZGY!5x4^Lo7;X7N_8zUZ#
zH?-#-Z}5||@hIMC@M!#?J>|#I#oA}Z&XbT|86NHP&qjuue>#=)8mr7dfqww>CGluH
z&?JFqCc7k#K;pXO`mcsQ>fcqKS%|tMuD<9U?D-JgJ}Y*$#PbqZmc)&+4RV{{=KwlA
z9_4$L;C!!J5|8?2z554)NB!>`Lcak+sFHZp&zgB8o=wF&<48&&#^n!CeTj93>|f>4
z6&Pxi#H0RHHTXG`uBhLv5&Aa_9`%paf=@8=ME#(dGvZlU9OL$Q)ZeuT{Q>YjJsy>F
z)dS}u6XN5ADmu$UNqlDz??t*M#3yFywd8d}2@~QU$l{u=P9slQ7FS(;!SJ1u#mnXH
zkcnqn7T0(lHSs7_bPlE6<Zo0THC;T0sl2k0;pX2A-|1OM_4y?9IUyePJGDabm$>@k
zxvl_yHOl#fc+?*?NIc(xJQLzkzoUA49E-LS;!*!HR_HHgxk8#<_e=r&qb6VGWyv+3
z83pJ^8a*$}(yN|-ZQ6&6vbf5*(#Wsc3in@-=sF|+C0Tln2hn)-b{O(Zh)4Z}#{WOj
z1Wbt6<i&F}>h<{ek}R(Id$Pf!enIg)z)z1y?Y83IMmyun$4N+6NjyKjpEm7VetV*V
z@T}qG>cLgh!Lx=ot|UsI6u_ld+@_COt=#x+T*GPn8ea3kl}Fn-(%bQ9c_F=xrzAq2
z-CU-T<Epx3JS#1~#?N?c{D>7#s}+yZGoCe8JhnVGK2-V^;l;D0>ny%{>&kEEi!HzE
zlksSrj6-oZ9@USl2W_#bPdlFTL?BmAjfe5y1RC|L9vHuktKM9Bl&>pKnecVx(RxF9
zHVO?dc6x2TD%U%eNA=*!GsBY8mS=(BuHGhE^tZ@8FVz-)tA*QqZTecFVf;3|26g$W
z9*F<B65*=(MZCwtZTj0S+@|-HTbHl41Jv6Wtavp381OqRT+0dZ&sum&?umcS!nK?b
z-(=zC7X4-m9}M5mTl6U_p1-hgo9`A2xA|_haJ{9RcfzA`sD6mwW#Rgq`1KkXS6e?f
zSa?eANx#~{Z8_U4+?Ml33%B`pS-8!2t%axLo_sqk+~&L9!fn1AEZpW>s60fyXAq<$
zEcxDT#bfieahtD=+k8J`#bc+p+rm?FPrf%>xXt%A3%B{UTe#jb9=l)G_K;_1@t1WP
z4{;0)vQFC>;uykY-PLkO97DgXYq4+)k+N=^g=0vPbw9Ll3}LeFh=oV9B;<<-O}-e~
zXPuq_Abv&`%{}8g%EIk4zGE!B-HQKA3%||6qge^wEm`<`E&5{?KF-1?#zPO~9B<)O
z7JjaUFShXaTR8Rr8pn7zr&G7h!Y3(+>plygV&N}Z_*4tmLcsXXxA0Oa9K<Uuyv)L<
zTe$8GC;dzdZ?NcRS@<0mKHI|gTKI=8{6!1@h=r$yg&y*aW*K-VW8rfx`f3ZGZ{eS`
z@P!uMZs8xb@Y^hWk%ix5;g?wWgBJcV3*T?ymsvQ@KVRNeF)Ne7>CU!wIGxy#F{ciB
zFgiS(KJW?F>FujKDy!DCc5Y~`M=Y()*W=)JJItctjA>{nZI+ye9pL!!Omnt0I%eMA
z+3b)udnjC`EO;Px5JKYMC{Kp-9I`o-I=DE?Ti3L-WJ0@;*#r+Y4xa08Xk1>mrlsp`
z#!)f5wQ(Kd;CbPkC<c{^ikVIVhH_lpsCMS+HXQs#=GSMIty#Xju_G(QkfZ9iC=EHb
z3kny@0Z-9~g>1n<r{Jl8d<~kz@Ixp_7i2QNqLgV~-M(N5r`##bbeM{;ii4B4QH*c1
zYz$GF%6`hmP^0R<Yz#HF{>p}liwcU&13-_Rja||*qS>r4hwL+J>sm5ITi302!905a
zraTO6V1SvpxN>GD+bB3$xNup`rI(jy@(SI;g$RRIH<-4fqis!lDAXX#1(+(_PXVl$
z-p~eF<Uo4k!kV?KR}ZC?9JoOGISi_R_EWyzNv!=AHGjlIsqKZEC4bz5Q$_zmqgkkH
zXlkoBy>kVNS8lHQ%T$=z%D=EB3sZ;&6u=A&np+zh*TXu+V2ftq7NoK~1DhDlUCpS3
z4UL`k9nI}9n82#j)v+NQ%haJqT;9>PI#b`Yrghc3!j*<(Ol+CuZ7_E+Aitp$jKbYO
zMFsLJTL<6u8kiTmW_kaEs=|5mPUP)>K>3bh?x)qyk9Tl77_ih^)efdz>})L1kRx{^
zqb;55+WWQ5l4o;8rG7`16|(|US(nkSOQsXU`i0F=g?%ScSE3<mX<Je0i{Dh0!I+Eb
zZ+5_@2==l*y7;nra~Eeamu4!e&?}mTV(6A$2I?H&UW@~GiEl67{4v2$I_mzb-TX>e
zA~Kysr70OYtt(K5G5jcO-e%z5Vt&QYxMhtk_1|6%v96*#8hc@|>%Op1I)^l0#1Jw&
ztkVf{;g|<mllvRHv0ZQO%rssHGft{ecfN<RHaJcL7hBVYzH9vY8{ECC3G2V)zsrdl
zs0$i|`b;}Hc)MAqx)tuK-(FkOzs}xfoc-tqHn3o?%GkiFG{0GUSb&W^tV;81*~Xe-
zY-3F~zm?|KvX(W&*vXo1erY)iCa%mcej29DFgCNMn_pVd!b9_mpN45OjRCD0#+KG}
z^IK_tE6gu`Kmx;Bh$XbKWqvC|Q(GZo9vXvN(?i=^q4BNo-aIrmx2Bul%FzB+_-h^-
zQ(V){Z>9Ntca3xH9Fe<juS<s2vZ(t{_M$i*Vp%lDy$_4~#IT(r$E9<8kw=y%vjDy;
z(r<W|-t~V2%zgY92nQrD$GPFZionFuIaFBp9v=ewexnIq(j|pX-^1|zp^tx!&<(_Y
zbOHV^dH7SuF8@pc{+|^7Bju_WH~rTZ;GdchhOpC5-Y)-3@R9{l<mJD<&pA&S%hlz7
z5yJcQUnBhW9bFT`7vtaM{}b#x@$tV$_^BSmYk28BuPMA#@`cy;NaSlfSN>kS#PWsL
z_eA!)O2*@c|3v}*PcTxrf%2~c1<c34Pr|Fd!r1cpPXd82{6Pt?@9PSM{|#Qg`NF5=
z{m^Y1P_AzJ{~h6pr5(Ecp7O`tMVcP1f8&Aq`2SG&mpbvf{Qtf{_@^cO8v}&zM4|NY
ze@fmj>Apve#^v9N@V@jPlk{skSq{0I(oO#nGzvccFUm{Te^thEb@^Y0m!ZD!`=vo2
zsQv0LP=210@Y)Wl7%u;#1;S56y`rlQFWFx={5b{m-y-34pQlFPhJPA*vfl?Q-956E
zP1E0m2dv8)Uau2SPK^GfylD6*kS@BG@RI%2a0<K^;SA=4A9-#_VYk2Br7F>8_gfT_
z|6Y&$+#jL*_4;SH@yUOoyo7I8LFKC96rK&hV2=E0kzezV`Wuh`!O9=*dynWDem(w`
zzh1wp<=^3dpUAIt2x^?`FQmV{qCb_F{JAeg!|U~WG|)c%?GgT3enRe1c=Z?Jzt59@
z+;5|N^|~7A_VIs2_(QxLr{NTALU@BY`s?xJUl{_aKD1pbB>zu5@^fF1^4IGo-1y}G
ziO8?zU**+s>gRiNgE{g)A@bJ>A@h&>7X~Z;)1Lgl5#g1;UY{?J|8Km*{O|MVkNbd>
zuU@}fApesbEWuqEUb4R$PJ!<f$p7+*A;lIUr2d!}gVo=Q9{IZwUis_wm$>oe{{oS}
z8ewdw;S~EP00wjNf8WHAVwVt7e(o<Bto+A3^52Z`%3rVlp#6`-{|=GA7GZ3s;S}2s
zI)gdko8BK%X!)o7+-*Nt`G?88P1_%azYYJ&U$0Aa{Oa(3QRHtx7~5$$#Xg4c26MvS
z<B^~Hat15^NRRxVMR?_}*F6b;`KiIUnoj9LU%vl;BfL-k{UX1%bJQQ}(qQF3$0Pse
zEO}I}$Iwpr%KuW4U-=i3|9c4UlfTcSf9_`*to&sj`8Rpw=eOH@^0y39{tFS_C;!L~
zgekVm|GXi{KSSi#^fLc8d*m-3>6iaDkzeaiC{2F(c@~K`=~n`|Zjtbs&-&Q)7wSJR
z^yvTdh(yEdmHXj*`rkH4{+R;hKP~##@<;tu<6rfucp>?#J@Rv(vdXR3RRzlbJ%iN$
z@&e`mYLEPv3_<>-p7OKBBmcjj<k$bbgVcW^{e9BIf2)W8PF;U-+TUG+)L$X~;kn%C
z`~vg;P7nV}Wd5IU`0o||RS07{EkBA~B=i5k3EwXHw_XUze+m9I{6OU|v<r|c|6K^L
z<xa21QNdY%T=`!br2Iz^-o)j|f6ycU6(0E?QvP^mJJ?Az4$V`J)ATF2NBE}|kZbJ+
z!yCK(yb6$pSN)xaagIs96TV9L50rn!2+#DVo$y<Pzny>AfX3zjJz0N1GnC`hw);T*
zA4Yf||72Mhoz4FffL#9H(DIwZ9p9E3Wct4<<u~nw@AmNjl!t$P0sZ$4lK-a*=>M39
zf5yYVOWH42|6`FZI@MR`%lEe-yifn_lfn>VC14Y-b@<o#6o-Azz-OB~CHy6L_QJAi
zyNM#dmUDfk;ddw?R}HV%AEBP>y-oW4LGu41@`>S{>L2Wr@cIooja$>N{;de_(_fG1
zZ=Ylg^|u`V8ea9sa_aJC+}+ZDq_I9uM;U$P&+NpGK65YMwoe%s+UX8|^*i?!(`QtK
zAG#mBZSGyt7Eq2ffABjU64^EcYq8B=ZEHi;(B?KwHQ6-daD0}wC6x{lm7bU%``Mc}
z#Cu;mo3=KG^}cy4Y=S=V;h)pi;x5?D?3*8K-F54@W1!u(FCNUKe>`m7(%%jLv+&c-
zBmJ-mIhoIS4;y4N)A(l`y|-qL(e^6s#vZwB0c?4~UiaCsojgBgY>M}t7CemUQYo(*
z{$%)%z>mBQap9q9>pLy|F!{)Tjy=WN0=fWg4qcu;UI^NPEw^15bO-mt@Z0?;1s|bp
zM%Q*Gd8T5}g~(L<^)Su!ziMnn{$Lk*sjQ?gq-WY`rjCrhq36C+g5!tg8^a^pY7@cC
zre$+y!-naMF7SBvT<SWst!eNRCuSa;pPtP)nwQ09_aNP<&ZV@K-2{K%DX_5%-gX|0
zhwWHj9@w%njBWFivJtDrF^(g!4U8dUDfz=z?R7^`o=~@DW_gNEAm?P;ey>l5D8e(T
zyN!^Q@%N{{0C_X6+}J@yzA$g%_rKeDbM&eNZ1;wB;7X|j`;j+V{!zYnGo40G<kLaP
zr@mpxr^@v4rLZ+yjsG3-<lz|f+%zqHeB4RF1L<MGQrKSK+B7XVj_$U!8ur5ZjJ9dl
zWb<{D(Xqi#oOp<Q4k2%w{^_LNO?JM*ulY*ZvUN-H_2^aeP5sikW#_Bj*TVKM_050R
z4!`C#)0!>c$amTYM^{-&`I;biGtx`!LD<_}WYS!880BLrmNQBp4}yo7?r!**?wKr)
zlsj8CMxkuDHv7NV`zma=;(fNU$#3LC`$2w)<7Mh@r?C&5TgMpZ#!6Ezwy`V~s(-W>
z@7jiyv~pUqm3CoY6T7fYag%Q^*FmRvXS4<1KiZ13YFl2%mG)<!g>6{Mr*yTjan1WA
z^Z-1J&tp4Q;|j~r=-pU5HuaOXZoA`iV2eMrZJP|b@8o^cTRZlXPk(XZndyR3+<TZ>
zUf0~x*bsCy*01U4Y+l<KeuOSn-`0wcldY-8hTlRY{@`8Bt8qlhV$jmOy16Tb@7vWk
zfe+oExcyX$IFdhbvFn!vu^ZnPJA1@9V_8eb02BGpvSU~btE8dP(*?u%EY0U|=kUj(
zTdZV&$)kzS;f945v)+57-2af*1*g`)eyC+HwKxuwrZu7I&|m%A0*s{?&mIY*@lXa6
z9#`JmGT5>*?2CL3XNNU|7hnU)Uxo&PPW4iT`wInIzz1sg(%9B4uFV?Agy7|PjCR2|
zBflrD>z%YR{;x=w8iv&P#jYmkQ`I!9Dz-=W3vJq_4P{Zwuttg0gW6EF(~^{d-au)Y
zf$(ZW^^K5Mly71iwK)D@HZ`z~%B(YXDO-d`PZ%z;{b?+!#+$O1KanQ#`HIljhV-fG
z5${dim9O988cW%f|0xOgbQsQKFVvJR%VOw);c?g<wE%`J=zO**{}CO(f437+j656%
zgX?hlIMGDT>185VA2IakK|C%2WALuK*+BU?=@J2RB-gbY(tMm$K3kI+LoXAN+^9g0
zg(Jt|LkDpAI8mQ1$VG-8BLa_0<ea7s3I5E`%f!S9<Ff@h-O!ghl%Y3ac0=SoqHUmX
zmqad3Un1KoM9;oq=(UDLct{`FmeMD882WrXq&KaTlA7xchCUw;>ED|}OV3I}pO1(1
z80|am8bhCthxFqe>L9q((C6bJ{keJc^9_AI9@4)*j~?Fyfy>9I8r+%$N=Ux@2rWhn
zAeX;1_@rD=e3+u;;h!_~`8WxEHXqj*`YCzwg!Jd-;SGj9AOAapPs^kKlEK-d<ho&)
z%iA{TCd%W}&}6X9cU@Bfya;V)Njz$ow1mBYNvAKKVd!^C;!(RaOc>GTnvcE$1SN5k
z2t)Zpq2FGBeog^7|GWS_#-d)n>>hpcJXs(fet)eb9<_&>u6ag3QM)%$<i8Ntl6cg<
zDgB3yexi0v_4&U*P!f;YD{U!`8NN}wv_RtDhAi>Pzq$av-^htkwYWWUeLCrn2jAL(
zJSs(ywHEm!ge!?h?NVCenFcw1@-&-tX)2@f(nBU)QTwCmy2Z#DwKH!>{FMdreWQ_c
zyii5<duactBz|rdua&#6A-yH>sNFDQ0z7-5K)$aifX_xer^i2-jUQqdx60sUdH5*?
zpOl9`j{NeK|DPMZ<(IeVkjGa}=9qZ$%L%`ySrX6J|0xE~*FVHGj(d%#XQhqujkc@o
z)=y)mZ7Ca1Nm$0iv70(Oe(o`F9c?F7S)gi?@qEa_m4>)&Yol6dh+k;YFSYQGSopRA
z_<a`sXBNHI8`T5m`NlmcSJi{!j|lGSVV{N1k$d|>J=lD0z4ezbYQMzI7sXQ+Uprrv
zx2u1fubp37*O@L`9_341^N4XzwD?}6%y3m1$oHcbu3=Tr`bhIs^{jYWZd^T=TevOf
zVhdj+_q?pPaFv13PQhJy?iJjXXP4lvJa)OV^WD~`t!GWIt52KWPFKp}t7#;pdT{es
z_3x%j)9$9rmPf-f{zCHnsg(!29M({9adx_FefG$6>fbIW4_dhDiqO9b?&`Boa95u%
z2=11XgHAjj7ypY+Jc=JF5YI6Sx650ph1+^aS-4#e+b!HqZ=rnGvf-Aubb)wO2GZN*
zcB#<2`n+0jSD&A>;#V06jTM~noG16ZX!&G3HeMz)%on>nXxbT%JsQ{Y!+2~wE%CT~
z7YOe1RXvcerk$is1>$Kb5Kp(@uKsT;5RaB~SDt%>p7Lng3GK3QTR(d(+@^m-a93~p
z1b6lJl;D(~dl}See$i$Y{<2Q>NgPAVtW*6E$B-xMy5){IhL&0PpoK@Xk|5Y`;nAop
z`UVr@iDm&<Q-q(6cr*(@8ME+c7JzkA3qK<aYJT-QON?ifh3~ZJImc1=6AM36L0oNH
zZ)aQh2#mMs7=JVxL|$8XG#ZBuY6~A91~tDsEj$`^2Z5e#Vf^p6=!13`2Wy07FtcDz
zD;r%MZ5wjYx~{H{?2|zrhpw3EEa*p;zXlmYWknQ&wWdGhcq%I1Nodz>*&v0_OMVqC
zmhgqe;H`%hP{7-WDMtlwBYdcYw-GQ;4OyFRgEN{^Km|jLB`5hq44Z3;u0NXx6;*g;
z)c|8PZLP2x)zMtHtfjG{9Cp*1mv6|lwGP4bT%Oj3Vi&D|%7zj}j=qKz(5>{aDFK6f
zYJ8xe>4pL_4>EL)xF$@$+2qPNpar-B(hV3cN3H>>2WgJZSIP#AJFh^&`UZ_a7B=8f
zAk71Y%Sp4LHo2eePgq4V%R1WX8tUshE$eH!y%23aWrLWG$#g+Eu!(719SB`JY?(}F
zR~?Mn)Hkil@a1xDOf((EcGyAJw0b}Tx%PKd)Xv71<++g<Az=ZeYeRdZ*k#Guy6IQh
zFmn}}=<M9k+10o@)7a6`*0Hd;=92ng8v5g|x@EX-SZ%J$Iy<NJ7un*<`n535Fd*4<
z=#@qs+QeX8;j&OsUe^F)Fk$aC$Plo12`iDNzZ+bL3igj(ZP_4=Ep-F88x<9>)CHSa
zXkP0Z7cRMSb<NtEi`HIVnOWFx;r7*`87xW*mt1;zrlMj^Yx8w$8jUE60E9Jj;X)Xw
zXqaXhrN|nhfbj@pd?K_!p++WhOiJV#kjOI^QR$k9pmB(XX}QKBG`mnJDyEs|v=RZT
zcil?FP7KEF@w*NgpOC@nQ}&=74`sNkWI-L)M~UH*<I*|4$TKXuHFs}e9NS;`i4MIR
zo*&~TmUifxWKdr#cqOh(XHxuQ<;uO`KK>2zT<1UH&F)=L|62&`<G)|{D<AUbe8}bh
z7BC<GZs2rodR;#^>G=5fdH8eQ<?^3`z&`%BkvZHC!%Oy;ylnRY0L0QZi2Gy0|0Thh
zeikK{e+M$f$G@5&oXgMkuSR$u|AVDrcw7IRN4oqkERg?;h5y7bn(VL3e-^^~`0M1c
zRzfoUoUgk4x#r_bzuFvk`MLfIg!l2UmC37}e$I<s{xiYc$G=O`KT!EE2c3`qdJlij
zzg_-cLtr2OEy7>rM^NM3^uJP|{OpqO3p8MX@V_lkezu7GyCfX*k44Ir{|5!i&x^u;
zkA&BYEC1gWC_h!B!w@!qLN5Quz=y2d_E-1r==xS6{@+7j%9K_Dx%LVFa`7|$%nO(Q
zK43onYC}Ga=eBdx|6M%v@gFIREL$Wn`SUHP%fB9hef-ZuzS0d;e*U^Z`B@<07lhGd
ze_i=^7brhFMSeT~*rmGi-&mmh=r^6;$Z`&ET>k3{l%Hxzc#_J2qyD(A<nrHu=RW<Z
z&H5e&ww%kK?F6y3MZ?<~Sq!Tdoczb*-{rp^n2-MmSv;)8bKAN6JMqxR{~qDLO9GSs
zx%hYae;I&}e~a*cTEgqa<^M&5_wi55D|_7+Nd8=pbNN>Ye`I5hTObvhvf0k{*B1!C
zaFF3oU{Js~UH%shGW<8usWUv&XFGm_jqdvJlKoZr_4-Tjr%t50W$At>;mfi}c;o7S
z&j8`I{nBXM@Q;Cy?~Ic2*Km4Oxz&FY!^7k9(eOKzP_7zYuM<T74p~qS+~+i$KKrzU
zck_??i|EEWilwe?cMa%#<u@rEzg>QrMh&m+>Mn$Lc{Bd*;*iTh2|&47M%?h{S5$>Z
zj#8luPbAs*&Kac{l{3PpgFmD6ge73wh?T|;Ory!t|Ehb$M<N}X2X2`*NpyaEduI0=
z8mE8&d(7Zc0j+qxXYMrzqX!dkYwvwid8lE^>AFP#eDq4kcThHW9fR_nhRHQ0)FqnS
zcN&9Sx|fAGu3YxF&SI_Cg-cx1>f2VYZfwn8k8&4~LOHT4L+%O>rt`)Mr7<??HXoY8
zAzi-->ipaUDCPejoY-=7iD&KjCuZxOLDKy3IL&8$#C+;6yi4!;Ib<T1#=q^J5J9!P
zvuR;EwInLO5ty$nUtmXO-Mi^u%kcPjGeg4<)Ruoi!dooN?ei`mewY8fz==tAWkVg5
zyRs}2-e~$2rhGpA9TY~YC+d%3HN4{A0p{`s6pWPc`{;qA*SD5|ua#J*O;ZD&H?69;
zplYaX`N0w+g850y?+i#}pCz@=^NkCFm(M8Ov0cx1?Zo*n1lv}NvtjrO)Gz*U;=~v|
zm&G%Cc*bd7zyBu^JeL~leeDdMOHK5?iF2hqms*6gYvji>jpR8e6}&v7d(-xVIFHwd
zvt!TVeB^UD6Lun@XRFf3cRKPMg**&@2<IbtF7;7tOE`k_T5sMk7yNK8H4&amg^b&L
zaz2Z*Vm2Q6|FjQ7X+L3~gJQYVvN;0x_SvF|@XjCxcOifDe2zJv(vUro!gxQ)=WwhW
zbi~@tT`qQ;2fN3E-RHsfd9bHE*g+5WhJ%&EuXV16&la4@Gc@kmEIBR{oy}Sx_0&%1
z)gDauIM{UE9=dHFY?ol#c2Jl4y*oQTZL<|)g?hmW%cS+^d}EeJOb6%f<<KX{q|J(y
zHlV`R$^zxqcg|<Kp_jq46U2AU=L?43StQTKZ|__Q!P^XdKF+7Ub3Pjky}i>#A~*E*
zPL~jGHT3y7pZd=E)EjzxXG|DRNH2@H5fm&j^!a#5FN<at{aizzkB9WKNMh0R+u%Wv
zkB9X34x2F0Um5y*JfydG-h}kq41GQx(%U<7Li$aHJ|7S1(b_xiCPSZ(hxFqe>LBPe
z^!a#5e{LRqlcCSYLwc?-<hoB8`h1*JiJY%QhT#?)`VZztBECd0DG&d!q0h%j=sTZ7
zn{J`CMqVSg!{AdRK<=(G`1yJGMF!{Ucdn~~*PdILegoJI_-9+?x^H2?Gr>A<WBL*h
zO+@@YdM=Cl@Gqcko8UQzbI8OWwGY}Je$&uL?SSI!t0u&w`mXr60`lB#=%f0s^p6?7
zQN32Y)zC-vS8)!CCd8w9syNP<1CQ#X;-?urs&}TJLLB!1_vz>N1@P%c4^e&8_&ZJf
zQN2^V&d^8oOYwg&_;^SVI>mnu?*!{yisI*+_@jEE{n_tKJW=^qdhRcr5Rb~a;vYBh
zOi{MkF*S4i^mtUB5!^WC!~LChsn&50al2HfBph*fjg5~uS1uPC`_dn-<0hAWmJP@~
z<GJ8n!tL`U8YSbm@dfgL>9x;e)L6K!hubWCjz(%-8UIHtzuxwT&s8GpO8P?jnQzf)
zxgfobD@lL&MM{LL9gmHlBQ)+>2-`h6;%F+eu2$}d+oPi{3%5r*T8~K|wOTj}ZqY}r
zR%8!=^iiu7y*DNvwNBWdYQ+<^PLXW@(nqZmh~cLr9<@%Gpjmj-I^}-bIcl9S2e9a)
z)&}zc3y)eG*i*IesI@`+X5r&Q(ai6C7JjaU@3ZizwZR#A3y)fxAkeuw(;Kxmh)}nL
z@LRvLu-lNI`o+Q(K2|xCAD-oxLYwMZ8(JDWoKN2t_%v|NDp~lIV0*7-LtTyR=nLwW
zwRKoqxbgxn!B@m)i$wT_X6|!D)9>?^nzhdNHv1(<bVDG||Cncgk+;^lpZ@HZdfn=N
zAJ_H!m<o3ilCQXa3G&nCL;wzMdK?NUvww<wjpS{@Yj5jpUe7Nlo6o4`GJuG=08{Nk
z6e5=jT=CgFXK&vCi>u2!8XE)1fSqW0Tj}`GAM>Fh{9p@}`*9)XgF+zo?Cb)n9|gj#
ze*6cw(WicLcW{B}yT4fr&A=2i?sogGO-)J~*+-p+(#$AXum*R;-tHPN``-S->v&rk
zYCooaj);h*6_D#ed0(XCpy|Mw6df-qejmnLKK_d(9v#1nH`|Y@|9>I8kH4Da(6JQx
zv%hrtZvt~4f9*Hj^tyibD?a|^(y3}X$)EkQ%m4WT>AwTCbS^*F|EmJ&ulDd~|L^kW
z`j0RDTMYMs`SY7jzVz36_!DyZUkS{|f7>AWe;jl^{_8#bIi7L(f1v>Xdj`q>_5%FX
zrnH^^tkN!j?icc<U&m)|e!Kp?1@d2Q3fufSK6Cju0rT<S37pR5=lbh~CQV|??eplL
z<3N}HUjy^;zgOaN`MG{BjuT4@y<VR7@aK5b<<ED?KK{ETBA1`*KTtsbYLnR3KgYE$
zf7%D}@xM>__sCT*F8^T#_$Q^|u9kpoe>i@2`A-FNAO9Hy;qv%}aQ3$hbfigVk?^KQ
z_}l5{INjx+{U(YNzG{&C^_wVZCw!BKKj#B3|4)DqS-JhE+9De${Z|%9f47G}=N&Hp
zzc0W)O`+fh;{SsJ{O|GbACLH4{{IM!tlac37$pB6i;QVpZAV+zbawuq3%|>MQi1Yc
zE&P?<M1~(%9}^3d|NS2RoUdtoDi`NxzVz1&GX2kk&R71`CbaTl{o}mQ<zHyO_|if0
zKQ1~+<7&HOp7eA6>GHp%fd2J8lhSM4uKq77p#PDwcwnc0iibaw$$vzX<7y@Sa>+h(
z{XLX_@rgDNbZ3ch!*xZUbK#poL`=tt8b-tKP(ZF4UauU~X76oUH$hH#B^@Q<^T-7_
z=0xu1$4G?tmA^94zlLY|<2s~<&*lrl=kW#|?IzK^Bn<<_;JJJ^eE7BLx)$9iFwlOl
z>9c1HdB0bawQ!Y&4D4;jhFXV><$PPN+#8^K06@%Fl^o6*`_J?bCd@J%t=6<<>gwwo
zJ3A5dU3P!kukf?${`Nckkx+q_9c>FH0y|Gs!~5KK_pn@QENlMi-xzkO&`I-Tcr*!S
z$9JP({lzCF-iz;D^KGV}OTl(R`Q9~$XZ7t>)+mtgUGpjvzrFfu(_4jD;N^xsALnDA
zP03FfdKuV8QJXv8yXG20FAaf3&o(~@PPLHmmTkH3ZBMPi&&Z>{!r=BQZb<S;T<mvt
zny(xyunf44XI5+*c_z<6#5QN7;gK7HlGrx#v@Ctj;E_I+@3$FGZWPAH@A29;>6GvN
zz)z1y`YDsJXF-<J<55hC^L<K$MvQ)iTb~}@G<d$88j|l6tZh-*xcLsn##0i2^lao@
zM_VCwX;FQQa&QgDc<i-zO%wUrcuE4ee3d>1diz~~wim?hQl#+^w@Z;758uzKv*Xcw
zK1&G!<FVfboFh2b-tm`p<rZ$Y23K3SUF%yc+^*f-79Qm$z|6Jz3-Fg>RlQ=ir(2n^
zuBomo+_XxPik7w&&Gq3?Vttge1djv1-gvwR{wpdQ*S9xzz_fO2S6xftaAwDB4sR2k
zfoC_auWxLpeS`?}$CN#tJ{Yzn9$do8eUyVpm<dNC20^sP*Sr%kN2hUzcQ81Uz4Xcg
z8qHfAA7Ihi-4Pt7&Sl2@8(4UAXc-5S8>X4>-kY7p*(GZnXO5Pv!}G^bWq2Z7j~K6?
zro~)J>D#|>3~ARBjp=C_8*XyiXuGbF_716k?i@3%5jj_FrxY%<MyTOkde>iQjc}w?
za&1f4#xb4l829`F@-GkpC(2bXF8|30Pb{qjaxD}7no;CW$mP!-oH}*&*944C`@hha
zKSySKKK@sG`1{tVyAj^Uze^ap>2>`#6yV?E(LdW!H~rTX(EobjKT)oFartvDO)RYh
za^2}kKl@9U{~DBUrr+MDz$kQ$*6n*qOQ+YJxZ%B9hxQn%e5=aJUmgcvMqr=(Pl){0
zLdf#NQHzGxa{V5W-{t?bge#M)UNn5xkMKVJW2Hda{6`{?hFAWyh3lK6XBDK3<Vs!H
z?oNgWp!FpCOb7>>qyMvn&xVtm9TMKfU6^}_h(QfGZl@6L%t52{D|`raKK<2-{<Iu3
z|9orIWbE>0+-U*1hD}Ftd~5vYSC$XyOxDcuDw)O){!G@`Xt*4tDGYwcKq6}&{}zB-
z@xKk_V++3{R1^yy*6%|RD~hEbo^(=hI&tpZx3KGor7?Y!J^dON=JMa~<#$|2n~Vip
zi{5-DsrQpk4lXEqbkXti?!Eb+7N2$RE2mxBz2v^R|MJRYd?#kaz0baK$(swFoI3O5
zt>46T(#xNDa@A*k^5vi4f7P3FpIq5{+Lt%uI-<Gx*tk^U=c^t%?aS}ku=3a)H`m=c
ze8Z|^-(0it&iiBOyM7WIvHN#te{spF<G<ap>ZHX#zAtv_?W<xVemvrd+n3z&SKsa!
z-aP3TWhmOve60A<qT^F~FL|;#R`la3b!T1<y4!zp?C+Ks|J>7!pZBRni+-$nfxa}Y
zMsG}G?eP;ccAvL(3EHYHW#7DI33d6K?)y8MV!`p@Z+`m8rdaY~K3fIa<ok=yZrU*E
z81%Yz&Z9*y$MF3a>PO?nca^w=n2q~EoL5ktDvdsO^9=Z({5M%f8X-|P3Ve^HjL)s_
ztX%DUXC*D+wT)+dO9h)KSH{sK_h#MJimy2SgvMyT+rco~tZ;>R3yJsQTiaM>8h5va
z4}<&GHo|?x(t$W!d}|w5o2c#CPZY?vkN$E)pEE1U2Jo$ITx#g;*=k5W-{ARc7<`)W
ztYK6cdaE(YawR?Az~;K?hCUxBRU$j{j>6DRyKlB%ZE$;b9)|gd!L{^6@o-JTUK=pw
z5Lg!)aV@hEbr8IXHvV+aKH^5;_S%VZ+F;_3@=MDq*F1dj&oT5-e(C#%4<dda{TT&t
zjz#S?6;0Ra;Ok2-_ZR!*f3AT1N#Jx`+px#Ide5~Dy(gW@&NU2sjY0Lqc<eO>T{C#E
zgEKBVm!ADPolCDWxOhnY&g0Rsm8%Dp-_=7(7<0{r?}63X`cz%<naa<2Y~0qHUCUG+
z(%X2SFru7xJTD0D#(z+7=9j&e^P&}x9sf&KJU0GD0s0Y$m+pOzoMQ#2oOV3t2=1n9
zhC|;i3tLqdZl_n@C%frQ3%$yt@#y<k>Ou3Aa#vgN+j1@z+?CVLU(Hj-qxYoOd*Ukd
zJFPD&v%B`TfK1?so2D`J23O0KxZNwYSa{T$Vc)KWN39k>cS)(TBC~kWy!kaXnYr^8
zWiFljv4xk{%$>imDwFBx%wVUjXKkrKkcvtZ1}5_A*0glhx4hku-i5kB@f_GlW{!vh
z+n3BCx6D39>t!v?t*aV4riQP=I&<wNW(IG3QS2J_W4SV4y9+M}^GJ;%e)P(>7aX<*
z*VkoMtf}j0$Y9a0v97Zb`%xpTuKv0;%^i7`AN{L&1KLE*O$TxeyNb&*{hB0jf>cP5
zfo(yCg*Y?_IgsJVTqZN109aeZ@*=j+HcX2a8Y|37WA1X}`e|mhQ5G7p6SiC`-#fTm
zjDFv){~Fbv;_z;T^H7>MB{TNEiMeZH=`2O=jrP-u-jAF9!j~zbT;1@yfD=p0bG>YF
z=JXs}Fe%y&Yd@Jm`hEPHBqHr+HC~thwFvLypOi+jS^|<k+f$c+ComuX8ztOCx$4E`
z---u5{x!mXiv%QpLN5Q=z<m670;kjQXXp!g={>JA@bBZ_C;a;uIUM=>))bjdKK@4}
zTp0sf&P_kbeEj!GXS80zlD}_F@fh-tI&q45a1L-fm!IqBzQg{)4<!GWkN{u!l<@Dd
zU(`V!(%SB+0m8fVuKzNG_pJ#kf14NYsc+j|#P9&zrbxpNv?loH65fuJ_urTFySU3g
z4LV{j`91;mIuW?(|1ju$<)=#8KfC;}Ezt1Vek?(Fmp56imjX3bu9VRiz5{2A+E(kX
zoq=t8;7jsDUK7+kz?3V^AN-a;YlXf~{wltSOj{ZJ9yGs$T^8Vb<4M}h2s%=uZr=VZ
zz5$I$_$~N{)3IZ-NSpm8b%F1_lfE=C-*0D=wDq8|+kyQ-xboS-M0)nhc=}t1@GW(I
zN1VLo#x`x|v+&=9Ema#KN3V+GyWOFU5c|8`N6rYg-i>uQ+6F<}LX{(Y`r&aSgX^A!
zY<J^(&9(9L!=cTPQ7|*ueJ5$g4GSLF`PPZ0sd(_<L-F9iws^4l=Wm^OsPB~Y!}~3}
zAzw4!+@9Zi^s0Hrc8J;yLH=$TFYBs$zw?yno7*QI3yf`(S7F<Pc1<paU6WY)_9ab-
z`#H#bbFim_GE-I~^9#ZGeZjF=2f=?AuH$YFt}7bWy(C$&>8v2O?0pQUwoJZ;W}0?P
zUZowA$FlpYwuNO2U!GXoT;C`kflhU`rP|sXTT?;q(-m!9sfCwa<U#9NQ)^oJ_PV~S
zu_0wlYyZiwHbR4NBg0G1nj_mOt-JT}x#ye33$kDNjckA{mbkS3&w#&HFw@4^wnVbu
z3vQ1-zAN7gE<>1mBwQD-3r^+tg7y2qaeVW)d@;U%EaXC&fAOt7e!#Rf(%?8jd~1&*
z45>ZKivs!99%F`HI`)Xv-1*iXUo{P5&a5yS%D49TJ42tp_Lwq!^Vc3vHhBJ;;aJ3D
zuW^}t250v5S|+lB;09~?UVKLZ{Hg-@=mPjA@UYj`v<%HFK!2&BkMwNH7qAZ&pdVrA
zBR!jP1&p?CeCfTlfPUEU_~g70I33p_?6r=T5H`4-3(B8sIFVG*H|e<6VdFhkJhr^|
zS~%aQsoNztl*eA_)v=koABuIJj`X&iOGDV;93QIF`l<5IkOyCptIDtVPQe+!EvL$_
z@w`vyRDO*|@jV6NdC<b`^qyzoW96Qgb_=)Z3#|p!2)(-&)L`LuE1`NIeN;+8oV(_O
zT~viuQ>N#1KC`eXs-vxa!w?p7aw8bh8c=S~Xe-s=WHoC!0~jpKaMxICThQEA-_??T
z<QA(b{9qJ5uMxN#nd)2GuqYC$F>BzkKP!rrL-_PXfAO@pEUGu(Zm4gn>%b>I@G*zZ
zMfD380-J44|JHT2br3L6Mdh-(PHc|D9;fEk6^oW;mX>FhR%8|~thwa!3o=+}nVoUU
z!eEPnS*M{Oxf}*7TmQ>DxjBzzwk4Om16EkBF-MoDBZoPn%0x$&EAVLvoMDCza`%E^
zznJ;Zgf>W0zuxYJwsA}s=tQtZIvAd5wjIcG+#&dgz1_8&67(beh1Y&pnQHs2e(r}M
zmR3NnO(KxClWbF&6iHTg{B|oaAO9C69;Fv=-dz4BJn-=!DUF)8spRilyQv25<9|dL
zYQHVsJpS|Xz{kH#_&+TH$)Av>N98KCcA_>jx+J__T>VpaAAe<}#gzQnU%UKIN2V~2
zO8nanb137kwL#pImQJt7c<(tgbiIT(#MY07Q|R{$kAIa@aScDv+CwD*yKyp(Gg;U?
z&ZYgBgm=Xa$E!iG&xu3zr!e0k`Sf2dgtbCQ{d3%+;WhuccI5JAkUo*0XR_!hH%HHI
z_>RUEjq9VOhXL)1R!pBgE8M^|g#Ae8Q-aW?%_SYY4-)b0&ymYwX3r4T8zytDp=?<2
z@o{s5>-J+li}JQ*686oM{qwH9<73IqNKz@%VdmIaAJ~nkvU_Ea&f|BL1P>p%Y%b>H
zKiH-AMhA1g=*=4*={=T-VLmVG30RMyEUzY#yN|x7dkNlEZ^3%N)?dCg_eri9>@69y
zIXGo5i!RnIX6+sqK;C$A^Qdp%y?yipU)uf)tQkPhW)IZ&<H^GtZwh)h76->uSU31u
z+^lUF*>?uP%xbJt^iD|6Zi)x9n@<jA(;g|;6^><?jvtzI_~cW49fe)gcPby`$dRiL
zOS*kn-|@+^t0cW)-1zi$bqEujwq?od*rPP=r1y3d$Ih-ibjpsiHpYuqrcduV>t*0&
z6X*8Q&MM=_ezMtfW(L<yJoDn~zefL!-6eC%g5#5daDUk%_=~YGDmg4|u*u2bcp08E
zA2l8n8OHPQZ-(7gGC5W}JX3`DCVlMse&amdA7}73+*~KjJjXxZ@h@=v3myMOj{l>M
zzuNIHa{L!N{!1MHV#oh6$Im%tf9^8pq0SK${<z-Ab&2D@-0?4U{8u>sD;@t;j{j=M
ze~sgJ`x=zd94B3B7W+W<F1-1m<DcyKmpT4VI)2po99N&?%eCRfN1t|{yMEht8%cGp
zr@_*CBi9DUKhg0wI{qrh@7i)3?>t}b_-8u)5srU`<DcgES2+G!$Ny)Jzsd1W9l+o0
zJYVVfS2_L`$Ird;wsZYu_Cwr%!tr0|_%n`wwc~Gf{Kbxcw&Oq7@wYkt3di5>_}}mN
z-Tay2JipHI&vE<{9Dj%7ck9b%oae3|eM64>RE`h!T^;|29sexHe}Ut-h9%~S>rXlK
z?pV6Wc|P6ob8cZfcZ|Hoeu#Uwe5`ez-{|<=Rnm3N^YxB@gX6#6@w;Q_TIYGn@w)?0
zj$>_?wmrCa{e8~!k&Zv^_`4l{YyiL89tQ;?SlZN>!pn^goGZt{x)i>O+Ev%wiWePt
z?a|!27S`7q0JgN$bz!9=g<UH=!Iy$5wZ>_|pu%E3r4DaSI#Ts5b)B6<2-(<KU)K&n
zxFTa>I4{-Kk*Z5^aR$4AAdDdxoEXdSLDy6VKPuXYPkr_iW_5Gt>bkD_CNTa4bkLCc
z)ZmEA4DqDF5#L~lKhqDfrF|?Fu4qJFAn7-J#>%U~h0ba(W#Tz6)w!m=DOJ~*`oyxS
zb)RCitJ^xeQqW3U1C-inV(n;5tpiDOYv-Ef%bV+)ndLCW*VeItug_3M);4x@rMhy9
zPID`s)uop6E4z&;nAyYc>bm+Sl%{FHWvz{=w&khGbEe#2qJ~+=6bfB^V*?buYy-lD
zMGaH3H7#`=dCA1LQQBJ?*Ee@<U^LJUzLnd!x}9(2Rx`U&bt_P8k&rs%vKs|rt8X-%
z>d15|KCzo>X<UnQmn_2lC$^yxWp_2wkXqN&h!l62WP5njx2<VWVW^o-yfAED-fS1(
zRA(c;3v0^X+^BY$S!ilSN8RexNO%+UzN``NCp$=sulY7i!>5E&OzQ?Ft#N&-8MO%N
z<Fe#BM2{>aznaS~Uv#xb6PAtkx{gi=+<+>~0LZt_HLDxLd~5B(Rx^*TrUh5Du4-*t
z2bTPZaLRm(cy2HcMrRiU3xkV-j|SDjqTu4-l3;Q0vEb6+(km7RmjyM!$Acxo<(L;;
z5nLHug>97A1lI<2K^^Rdb_I2-arU<pwJE5BT}Q5UH#G+MelrdPcdiPS1+1N&Xdarv
zyY{;J#-Ki^uj{~9&{s50?P%;;)6p8#H+R&pS-l*^z`C7En;7_L4%(<Tkl+(Kb>_FR
zqrSPWWolhl&=54R{py(7*}S4PXbc*gS2T46&~9Bzr(o;RHlY}y0i23FSQRV}mN&0$
z43@Wbte(0YB?otFI)deET3V)dcD1z!D*|NK+D7HQ0_)jG%hWCyN)2Od3Ys<`jjeK-
ziUPEzGiVN02CIUWprvtn*VJWb)EdLv`ZXOb8w{|ju`7g-bx2iHV`p<`2y{YT6kUc2
zi8?ziekci3(I&!FWzZVHWUIMvCD6KN^)iTN(%u%}GxB&lg3O@KLXfAj+ZuxQmNlY{
z>jG2ovdXw_O&jWR*4q(upz5GtP3>$$=YV8&P@$5Z@IE&|A!es2M4Tjb2Az$oo5OtU
z1dG-H7C?irSSYJbQ#85)e#sh^Y8xAauI82o{H|+*1<Ez84G^rp4SOip25h35@p0!+
zFIgW$t_#)&8}J3W>l-`TP(q<1{I)mM1<P9MT2}@2cpK9aG&HZkx51Im?M(qIT1U{1
z#eRHNd`)Y8SFolXdJEQvL{3-y_PqZEZLn|-Fji7q%d37XCBDskEhSzpCRd&cZLTa3
zS{*A*gkR^iyw8R=p(A@OoJ)1{IowYEgnJFrcY)8{*lX~m;(JDX_0+!{8DAf5H~8h#
zzxp@M@%EA)&Rh$GD~{v4F7nlrUoap}NO3%N#Dv6NcexVdyK=gv;icbS-yVfaPGXQm
zUbrtpDKVT3DZ!P_-uC9(yYM~}kNF7$Siio#3uXa7_ibf1gm3S{K_iDd$`6D1_AWeO
z=-pAd(sT7S*X=d*`8cV3=c#rY`crcwfp4q9Ps_sz_`XZ>8AHz%<$RaO(R%p2+0fg$
z5rs?Soa71dg(gd|D(Sd$fir(~UaadICkd|eosUVl--0jc9}_?80Nu|8e?9aDQ|0=1
zf=`t4srX+B{&5HI5&R~>b-kfW@J9sKb*Wmx`Ob?@*RMV-@~;qF(|4-i-w<5qzegpW
z6N0Y~qYHi|_&TW?D*ulJzgKY8!#4$gT5#1Tqf6wRqzV~~g*>?@tU~-2#FKjxDa2b1
zes<`weoMj6-dj^E&l;gGcMiu#Ymv^=<5Bt4b(3;Dv-g@9cEGp}=8I>Kp^sMaCc;n0
zZ1UMAnuZ4@@u>dpBr)8Z`1i%X+0aMzSKG}~Ay|oZ-cQ>?eov>wvQ4DzVX{E{JQwQI
z8|UplJ*0rsaqoz|R;lUc-VqzuazT35K5a*<Of0}0JS{l)tk`Qk3j}98Tys=iX}TGY
zjSIQ?UWUDfq~RF9ji)34_vn;sU|ba^U%Pd((`)0JF2--Kt!O@IJZd-ZYT-rs8IR&!
zg1hn9^4P7PEsu>4Mjq0?B>Zf7Y+TnNU3pZWw5_CV1EU%%@e#Mzuu>N8u6^+l=~+(R
zKP)7)<0t+>!BgSmEd3<GHSaW@DT1dR`l*7~IQaR3*E)EG;O!1RUGQ!PpDFkj2cISQ
zP6wYY_#OxUu;BX~{3C)t;ox%w?{o0Eg1_Y83k5d~7M`izJ}Nl(>d`5_Nbr<{Um|$9
zgMUo$w1ZzJxY|+G_&+XqtwVpg;O!26h2Y%|ewE-`9Q+!=cRKhd1mEM}pAvkZgJ%SP
z!oeE_?{n}r!C!Ll>jl?!OVz`zf@>e5_-6%ANk6Ul7X&YN@c$ur+QGjpc#VVqZ^3IF
z{5yiTJNSOVyB++ef^Tu~rv%^W;Li!Z$H89^e4m5AB={2!{)*sz4t`AVmmGYU8GoRF
z%XmfgIZANaPo-0QjNmB;KS%I#2mgTJX$PMoc#VV46uj2KX9?c!;0pxrcJM0&-{RnE
z(`l!JXM}!_gSQC2&%s*-f5O4r1@Ck44#8h?@Gim4h7(KA8wDRJ`KJ26Q}C37e?#zc
z2mc$v(+>V4!D}4+9|h;QnojxtOz?IGe^T&n2me2UZ*lNG!FM|Ni-PZQ@ZSl(&%s|2
z{0Rp?B6y#J$4(B@^OA!n1rO(;QF==RA1U#v9!dpIIrs#@%N@Kz@U(+Z7re&7=L=rz
z;Fk%m<xAzM7rfh{UnBSy2ftnLoeqA7;CmeWi-PZS@UIB|goE!CywAb^r{FI+_%{XD
z&5oL`2L&G~SH-_0{*;6Nt@z6we4qH!4*nzY*Esl(#b4{-KM{Ysga1<e-46cG;@{%n
zzZU;a2R|bIJq~_U{QDgInE0P?@IQ#Z&%xgie^?8mavqbZ+emq!dOk()l!L!V@Nx$~
zL-4eNYrj_G;AaYbt%HvfyxqayFL<|uPZ4~JgI5T?)4{d;?{RP~hx;6Smc;XfgKK{E
zIrv9}Uf{g%xJmP4@G&4#Kj)`(+`G@YgZf7pG{n!uz4}L5_*uADf2oCYl|cPEA7T9G
z09QZn>4?7<SM{d|!V!NTt|@xpCWaS-V~<_dUuNMc+^e5+QaZ*n9#{338#Kfx;9mVR
zEc{&DtG~*^DTDeiv~YH<>Q7tv`*E*+O&{gKU)EL29dXSQLZ7s7y9(WA;hI;39<gwH
zugEbA*E}So_EyL@XBAOw<l=Aut=>-WSc5lXs~h{bdt2zJM1^@l7lw@vRydJH4+a&D
z&php*0{X1ZI#x9BDz1KYd)_Gw=ln(Psg{B#8F&<fUksGp0&T4s?h?R}i2CqUf};kU
zbl{^wMqV*fBIhOojdxkzC)vW-axLA$&TS!mRc1cA__BF(7iTh;W-2NwL&+N%edj`v
z>}|$XKA(bKS~#YqSN0>9U5-?cfen7xp`cwJ?U)%BNWS^)s%!1)tSC2cbu)acs}ai?
zjcJQvlLT+aS{h-Bc#yIUip$_*s~C*Ts)xd-t172wGI*O?-;}9q-H=(f#(cz*Z$uZZ
zqbZlh^^Nrlmq0tS%*Oz`2tya|B;I;|yf`itOj}I*Ez`^=0?kiFm14%?iTSCRrI;~*
zlJ)5q10|9Rl#0et)=!(M-t3JUW)}JxN}yJn1)rY9<;afUm029;cW_omPw|9F$UDv>
zp?IX{-8<OxJ+#j<b(5AnyzG|^aWyio)rWT9LhM)gCua8{#MAuoIJ*zx<6W4y_ZPm_
ziNg)g_Z`I24qYt=6>z)4ix~qjo!Y1AIDz|aef)PyIG3O6XCLh2pXA^LPWf;QLRGr_
zcLVeBzZW>&#PE{+b@~4lp7{8ugujkI$e%+vmwy?U`}pq{jyvV57nlFJ2<+ouBmB2W
zK=S9?5tsjG3-E8EP;h(0OZM00-(7%zpNBu+wz&M0h>)z@@|!}rqN@%s*<Y7G*HwJs
zamK>9rP+|-jT^ohbPVs-!F>|G%n7gZE8GA&#+g<?uI=(FP35Ql`BqHBYq@+9%zgY1
z3jdcJ#b|hC_frJ+@!u=_n`E#^{(KLj;g$b5@bU3~T3)5Sq>SXM;T7h$Ieh$69|$S5
z9FafYduVv&e;z6&`P=Vw7;?YJy}+6Gkd`icmHZcVg%9yNq9nXskVV29%4)ke3drB{
z!I0`6VMO^y<KLD4x4?X7+G>P<7)$i4ax3xz!{cAu3B@)14h7_@;q^KUH+pZA{(g}B
z&y?`4{$7&sYM)W#*7U2NhqS!;Fa6gpA*B9TBsIL||Bn#f<;@^TnPBR=D$~fm!VTYv
z-Lj1h8Q5YAkG6@ioD^MnAO2n-pTDY_IkVC{Obz}_+b$Ir{L}d7@43|a3qf13@6S0k
zydSxM|2X~=_wyW6AzM4N<-7~FTwn*s*xKoX4VXjo18(=<)^vON;e)}k3%b4@Y<>3J
zV5^>cBi?i3#H^xNtg`v`;9=~^nbEZ@mPa#g1I)R=&h)|gIAg|hU8kgvGhXsjdp(b0
zE6<V37T~<uyx!N&hW(iNG5tQ*w%jv%0lP*c6XKd#6zo|--u%WFZ1r4sWXuk>@Y`s+
z$3BPWJA+q?^lU`fkUsYtVXCL2S0!*ha9Hn~w+36UfUTT?^mKIHxXN*{(W`oKPRyq-
zK5K$54nY@5*fwth|4m2-nwwJf_ottuSIsv%8c09Q$eXeaLCGBG1Uf1i_O(UVAHmtU
zTIe~;2Ra+9t~9<$u~-Shf4nGGG?{vT95#UtnKT!zVjfbbX!=T-H?=4WKHdIz`TYOB
zd_F#e@_7h#_Epqb=BrzFe0BK$7iIKMd><(4Rdx;3wq-vOxONM=_QyV4*C8KdK##4d
z9>>;H8OUl$3uneE&YseiXiKS?i`)^ChT{dLHTy?lL0`W2$F)tvAJ_XxZ_AOjRn?u9
z<QJB$suxKQSHmBTU-q|RyQ$%T?X6}VR>ualHf`=sSWt%gQ@hHxuC8XM4mT8C-63HH
zqpQ6_YsOZZ7LTs_gl-Ro@#^X}udZl!if$lXu}mxw+FAz4ktMrp*yxIn`*XfMw$scU
z0j-9|CCun7_rZG&Jx6W%E|E7A!`?DOZ+`LuB(fv2=+P;LG#LTbT_TWyy@kEOiMa<S
zn#jJHpf7Z<8~PFI&AIya(uVJJb5_B#VSL{j_^pY5WR}Lh@$IoaXz1<TYEcN^9^2;)
zy}g^vrsr;~TvulFnU9kyk@JPXFx(hJ&$mGNE|Ft}K72mH(4U!43?z|b4L&3Z-+9Xf
z(+c%(CS821lk38F*r{9)KJLl2_eg5n@D}Q0Njxf_+Loa&&9=pMWIf>P%dO9X$cI-K
zpkHM88fBR1O&f!|NAO<~kIHkoc^b~UeDR-b(iN3+(*`5VDpb*ucvNm{B%Yt5ZLs&2
z)(SogxG#S0{VK7(hpBqoYUGc~q3SJe@Tk0Lx-J2ql6X|EG+o~{az^E6kH~Y5!J~4b
z^51OakII9}|EiHQYL`^b?-h_=`ExJic;U%QwcHb*VBswV@E!|4*P_>SFrJAPKGLGM
z`P%Z>@f4!h^f7)}J}@z#C-HL+tR0UXzs<MClE+SOw}spB?6UB|r0YV9-j1hGx)xjX
z_TJ%73O?9${dYcw3cJnHr>+0{Ec{O)AGJKY@3ght5>JTCyfnx?anluue~X3N%Xxb(
zT$URR@{)yf%~+j&6NK@<M?qYx;in@Wojkxhb_<VMMHuU`@TgTpJ8$7ptB7SD3y)ew
z>}f!|r+lMU5%O4g)GC6q-&ccGcx&0v%!7xSwRJcMiZ_!L<v7RMynI6jXJ3b4EU`)!
z#rR@hmc}j!KN*2Y`jcU%Sw@R!2m7*mHr^~+>u?!Z3v3*EEFQ6|x;i#wTH5MY4I%YD
zVct$W9&u)fC<E(IDc^|(HIDwcRrFVCaQbx!dh?{WVtQC?BzK1pnJ*LGer!I`W@^!R
zmxOx<@%hBV=cMaby-T9Gap|l3!W%t25@GKGzWY3IP+!iOu>BXq{3geI)~4S;URGxR
z55=@T9_?)7G5Z*xU077jEQfK70XOtuM*`15PwU*Un%91X@>Hl9>tG($Y@w*ASku~!
z<Km`GT7*3nVT%bXsb)_AHax87)`#`{y32Zg-DN#LBh9S~_%YT)b!!6r6>2~fx3cvB
z8w)Cp#n5-vZs>Y+#&$m)_FAwTEbn-9&#>as-KjUgH!RINrf6mqK1ydPa&Ly^dV^a4
zFwR2Zb)2EW-0;T`*cV>MpE}Pe6#i8NW}Imykn0v1M64G-$J(SzieK0F<`>{Ul0v~P
z2rt=RSN=aMz&|NV5;~qDf9lBP{~cgt<?3&#@YnDlG0x@x08nCS^ECRY68<_aCx7yG
z`7^MO|82rw$E_N(%m0rkd_Ml&!oOAml0Rq7F8@Y^_wg@}hXHFOyk1=XwFUV1dGtTR
z!+$^c`1p4V|5{}%SC{`|p!21FqzqPV{Zk}2{X8?~<KHLz2dY0j>*@>7ci(ga)t}EH
zuuuN0MSi>faGdSR{{}E0e?1ekfI?V~ylnS6JU;$U2!AdA6F}$NW3Ujok3Z~w8mHky
zU&u@Ec}?Tr$6ps`?EK@r!A<`|1<LP4N$4Jgv7MWK>dD8ydSn=?Rsu8qoS(S-M;G9)
zXU1wIyk1=XwEOGhzf1U+OF;7HJjmsLL)@?bi84v7mGF9T`SVP<kN?xc-`2lxk3kjt
zFOS{f+l0UJ)ho-2?apU-0GdvHrr`(Lqj8Od*Km40*KN?{fy<v~!iYf)IWAlmMnCR6
zQ2i@$Gs64ymy$_wjWC>m04e-yc<ukX5#C{8qP|B6^$Z}R;of~Wd}mh!EmF02iS6Nm
z_Grwk8v1w8_exoyU}^r~_e^N*%^Us>Hg;p!TM*BFubg`?lCkvh<XqT`4PblL`rgqD
zeD6s2UAzW5ENW~;WZOp923x;=a<FyO(x8`if$@DI?1dO@-s`VDIXHggvU%V`JHC&J
z9bZ4+Bly;m&AShN#{bTE+23M^O<ma4W!lD%4}O-M81$yF=Y%};+vfH@k226wAEmg)
zNIwj=i-rE?3Bk{TpqryaelO{|M(jK2UPg@X)z8?SyYIuFUOTP-t><^HXBbCo=xBq5
zv$BeEY-K91tU52n<(7sNtQmI9sG2ov#;k@(G(HH6fwWtN^`unAtZC)bDpO@mU0v;+
zA3FbhSSDi}(^j;#t!QcNgt0H!2!t)M^Sj#GT3|u1x%K>(mbI&=ws*9x#Al#V4YQY5
z&0apEq2huIE|}ghv%I3Rab|t_>>0CXE}y<^dO6J6O>d~2enBPnd}%eb-<7l7)V9Qo
z6~b>Im8(6YuNMF1h&Wzfn-3v9^>e(A4%=E?cWyy=yffu@lXAnrWRe|bBFMT)3uoGD
z>wECE`ZahwE5rXT62UFykG_wU_uMyH@3|SzQ>1|#itN~<W!z9?zfi*TC;NGbwL$0x
zl0B55@UQP(^6${s`)7+p(GfWAkfG1VN#?W5^n#(cSAnAleRi3iG4%H8uuX5T4u|+t
zhCUzX(?rgyaY+BTp|@9)Lp-FnSCd2hhlV~M59y^tjiLy?Z|L*!e>QljMH$}y)ZpA{
zn(J;v2W-D9HDwVb3-CWOm(=*KE`Vo<dpdI#DPKH41#a7`G36N;_T2%G^3jx8;OHZ~
z@qEhANBL;VE@;vJdgU2r(i`QYrgvI__*tKAyFDuBErxHDUn=JX29NSZ<yi{-`}7>X
zLygM0#{WzKJ^Z?W{J$<B=VJxr)I6Dm=XPlsi+Jd&9K0%o%{Q*>cNi=ubbL2ym#$ia
zhPeH1qYz)6Yr1^dF3~Z5o3Aa8%~$nJdYdoH1D%`R5h0wHUbgvkj7N?f7=IyL^WUXU
zn^0jqnnpsl9_*bBw*GD0POq(pccOngewB^-xAFfB{oC=|`nT~ydM<<yRsWh^zT3lJ
z*44-zanodq|27McYOCyn!!y!HtyT~`ZP7=qQ||fMs1?GjLWE#EcCVr59EeA)4I+mf
z;rjLsSaWV@sgVWvepa@xU3z8Ssa%9LC|(1sz(=^kFLGi@y9FjgGuO7RTa6D=)zx*>
zH(f9z)6!7a&@dx|Ppk8j>jN%~gQm`UCos4ps};5&cr{S)#A}81C?`z#V4x4ZJJQr$
z&hNA5e`qX6oPtET2c04Hz;P*&d0pTLV?HJZVZvul;`~v2B<SbZY2NqH%5h>h?_+J{
zd0%VGJ7Aon9+Ra146X%r^q<EpPwD>|tniv9=PeEnewx=f_`&UTzSc26=2eb)iK7ji
zv@37-!v4u_*EF7e(hy_Lp5vrh%3^GTh`CEl=`2O=&9GdrvE$fZ`1KCG8~!?se~6_W
zI&%mSn1&yVdnQHuefsJ4<KM@BuX!54s&uY%`9FroKK|>ak+=D?pK$qq1I&H=ClZ8n
zv)SeURnYnPza;#t!)VOBnEjE<|EdD~^_`E7pClT?OYeDIQh>jH=iKH`kzD@VgNeVq
z^0SK|oa!(1g=y7$UXK^x-!0oBHT+o6vVV2?e;t^Qe+uP_ZlL`COVIfAf6T+5{kY5j
zMlkpBzeD&Bl>h4rq`zGT6Sn?YS6%+)1^7QA{0GYaDFyiN_3-B`$mP#5o^Q>3q|@$z
z%sA@Gb{zW>bM>U*2U;_~Ny6K4^8T*}$^R}1FY3xhqwkz_512mC^sE0baN{dKx*dI=
z5VHJoUZdgZr{lS7mpAdW3`+M&I;bPxJ1dOu@Og^pV|@dynO9WKm{~r9CmRQUuJLNV
z*b|pF*L2Vwiv=ehi<xiNztI-&{lkg`zE3v{YuhJb4gKU^e#?F=*2|MvFD^PU_sMaI
zpyR?=&-R`~?C|ra2TO~C^zm`A_~FqNw`}LL1M%)9M-sz!FFL;Q&es!(-PlX;Gp;wk
zhIQ}e*rx3V;^!Q=_`N~Ns#wwHjj>^e<B4EtPoi}5lz8`@$ym_=;0Kbi(FZohl7|zg
z1xr^Ir;lf1LC54o_np5v@%vXcjJj+4oLKSUg9r!u&6AFAe3IXxOWwR`d(nH+-x~L+
z;N^pmA(**oJLZ|C%@Y1Y2=`39^l%-P0FPolzZ%ad_v6W6=~(c)CNXL=pD#KoSlX93
zbN91}F}t6W?+~US-}uDn&Ceyq?*0g;<&c%<IHAIAe?ZzE!YkFj#90V)Cc=y|>-(QT
ze2k+nadtMI{qa$ozm!NG-Uk`V@VplB#$t?jj0uA_@&fW^ya#bE4Bx~1Ru94y$Hr`~
zP84s(+4bWqe-re65Hie3j5$0n9xSa+oU?gcY|P<9ICoYC8F`O=?N%DXcNRZKJg>(~
zH*brNK5#TKZa0c!X%FsS$F~iuAq&$M#6o$<KP~dB4oKS^M>&X{v$+@3^`Z^qF0W1`
zDbsAm)pT-joPIekif<iWgfg@cWoZG*)coEz+UDV1$=qI)we0y*@_F-yzs0i{XyTwv
zAj~k7yOYejn=(@-Vh5N{=OUkyD2IPcoU*$p$#)nh?|waT((a=uS2&;A!7_Io<&E!E
zsz!BhFGG1bi1IQgNFJ_+KB|M!n;-v!zpR{vvVyu>dKU8)`AE6mKs*ncd_4#GIyRe!
z-v-u=e0$d9Yk1D{AoMyL`PzqkWmzu5e-Jxk^LXUjbCRFWTpPSxi|2jRGvaSXnCe9O
zTa#jEZr+7_?R_Qa-LYy?)sf2<LI(?=i}}#WJm`k+n0}<+yu>##)3b|qrSa{>pd<O_
z+$W1rr>c?OIndE$)WIpS;sY1Q5~y2=!xyto#ELi1PXrH6#{U$AeG%Wi{7s^0_vi7=
z#_z|5ui6Qj?!dPhcc2dOEb&O_VJhASZ4BOXI1Ro1MeIGBpTRTUpWn2)>VDAv6k(r<
zowlm)trJW6Ey&*_M(qB*xfbotfVMi8JkXF#{~?I&_!pjycHhZuOa~84K>d9+5jX7u
z-plXacy;h{4`gY&e%$3fqk}56ucd28q`$Qf@8GB}*az5p*DXPB4|GL(zO#E4b?rGh
zYrA9Rbm%VkogBltyvv{iwnt^LU{)E*Q7YK?5!g&PUK{WJh#P+96Y1XXBi|_3F38mc
zxr!mz_vZx<JO_Pz=hR&J)<C`{$jA8k?vQnX?+)#FAycVOuA?SR34E6{vHOVVg>+ay
zM_NZqT1$67Z{EX2>12HWRno|^%k;7Q^1Y~*;UvoNl_<lk=gGTo*`7q7@fynMxRZhh
zFsNAiD(c*$E7w#p&o#eyogDlO<?o?BlmT16EN|q4_I(!b1LSe2qepsQA08aHzXMA;
zyDm|VD<H=h$bt24l+VQO@5JMqZ;b^HQr<_={@F6@gIvErKEHl)@bY-nognDGlkLd9
z_^1Q=ebv{8r;kV9di~qpKSBmyTX!~ONurN!MjyKo{pg3#$7a~a7UTRr$^*;PEk(hD
zXoHXQ`H#`Zy_QH!X8Tu$zLq+xMwrRyTZhNaLjPHM_y_187NIQ~j&|)l)X7!&-xwQl
zxE^h(+pn%i|2Pi)YBj<n(WlNq|66u*PfnkDCfZ31Crg{8PaT6W^Ae*Er%{)mjgQ`(
z3efJM%wl|0dZuYh!@lfw$o?JEmX49OH0+ZYb|>oAL4=K=?_&SM@Hd!#Fl;Bw&_=F9
z{cJ+L>H{6>{ABHu*dJ9ReVe2|VqZl4voAWavJB;g@2qp%(?6R0h}u)~V;@u~Uy@cI
zlsF~qgI+`5!#?OJ`X82yW9WNWmf8O>pJsXcAILd`{s(*LcJDPhI~zLVSR~ZP{`gq*
z@n@R8W<nx)peZqS^C4hCY!vz%=n(1Ik?m{3aRvLC8$^c#>4SA*7xcLZeE`N-yNgBz
zRTvkS(mq2HX)eNk0Sp;uqi)Xjwe1;C+n({Y?M~bI_S$yc2Z4Hwx>Jn)kom9(^>|J!
zcK8s=7W0W%8S(^1h&St=2<mB|aql@&CpV!^?m(UUFzVMv)XB$2Al@K-oEYoj5#;+(
zsiUlm9P6?^PC{K|oy7N(4`k3EKZm-t4&`++%GBX_68&@%`0&H^sN*Y9r{+M;Nf@^r
zrHv4bU9L5C68-70uuh)9_offtl3ORoqE2EDRB7oc!Go-qjDz)ZSz^@T6xy(Z@v}ES
zi?JW<V;oMQeopAV@((?C?%4hdjQgmAK0JFC{fk|vnjqt(Vc{6>Am~`Hu+OJ-tf|vs
zIfT&y8TWFmd=|oo<KCmV{}9HGW;~2Btj0@ux{)7g#Qi9ElJ||Ko`-Eg5z1&;V$9}s
z{}J?ppRtL+dQASvKeW57%Yz$JvfQ#Q9^RYo#Ta_F(JRVE^(eHDvCZ3I!|cHf+IaB6
zH>cwmUl(tl0=gHGkH1CUeG~T^W2dfS-^1|^#z!x6Y=pVYR?a=XhH=lKL@~w?$piEU
zr|USU@L1L@OKjh(QI_gamUIqvHpXu(Q=CJ+mKZj95y}$Fmd>Hr)^iTEDsh%Ihf0_^
z6x%_z^U)mYY_#>s!?zas+j`2K9AFN`_MYQGokPts<uQJ^2zuF=C^hq#ILbEL?{MyL
zw#nBSiQpl;#~D-~(1dn>p3I3DPm%Nk<6~i5VHp{?FX)M%E%TGJy!`>o5BmhS{d33H
zESLDlnCiP2f5$Kmk7GP8wrcS0c-H&<$e%OOHt0BwZT@8B73=%OsP}V_hsoIOW<2wC
zlrh%#%~pMX?Bv|~&bof3)b%pv3Hsk1sOvpWT_1z|z~(H||FTSn<KNQVqY+m3rZu5Y
zWc%HN@#?=|j)8u2Hp6tGF42#*r_wQ|9*2E{#&Ha3I7|BP4OYE87*Btz>$z}TOC4qs
z{Eqzs=wv>0GY>lA{N(@1&QE;bv!BC00evUd5zN>aI-H&SV>o7EIv$5UC!s#D&7Oz(
zck{_;%g1r8A^pl#DDQke8P89|V`%?w-aef3{A+@jn{M7@#w<IbGtT>$p<H&M4XnkO
z>^b~%?9Ke-n2pzi9K%B&SpO<5MO{{$?Iw9K4Cjy3C)-4Z3FqYDeGhc8hW+TL1I$t9
zLkIJq1E&9nR{HxHOO&O1nHH9tv!Da^6D&K!QFfr$j#cb4&^`@+FZ;3dD{E1PCdWpj
zkBFPG-2XxTu`I1h6rt}ZGJVJM&@1~6((9b}D#*|A8|ydvBaA1LhnsHA?>DH2Bf~JJ
zl<-;>SkF1uV){A8+7G^q61n}sScG-^gK&(eYbT-3QmD@wFXOx3l&!Grg>C-Xn{Vj1
z&F_Ew_T~-Y7@!RLoaBrFCP8oWQ6?tK7~o>;^_+u#xUAyV?Q_xYKZiL6#{-Z{=49XN
zeHG*LH&M?y4l2rvFLC&J#8-^?INzSmH7}H3&Pg~2=ibgF=HAaDUZ$1x<yAA@{DD<I
zzT0~oJlu9=7WkEc-=VkWK8bIKb(EpJCn-Pr{&A3bG-Q5;^G@Wc-R@LD7OpMypl{tT
zbJQf#^UoMxrA`Uw&Sk@ct!u5hDdVSX$uW0te-7n5CgbjnD=$F%7}f3LM)s&~GflR=
zFH?^p^JMg`tj8SdQ07fp9R(fZ&k0H{hi+;ykD|UAM>06$0LBw9v)|-+oqe^fCwD%}
z_G2E>{aPYE`Bmtc^Zz-Y3|{^^(%ghJbG=}CEO=-H;#xcKxDxY+aNVZAHG|iXN4kfY
zZ9<<J-^I;%pJ{mBV52bh3FoAogT7|;^_VG7ZW@fPOu0ed0Da8I7^E1wn<Bak=l!wW
zqtOO5qu#T8&BR<7-?Pe_`#yxZZ~DZE2dTSJ(4B7%>}!XqH<oMYaPmR)5u?HTZnSwQ
zKi9>eU-oNwH&WVjEyhh~lgc2=Gw6qIMj4zlH+Wzt+UC2_R&b2UK8x$F`;pg0XiJOD
zoU!=uqPsE1Li;=i?eQVRH*4nY+wo4aG<oK@l4MbEdQUu<jrH$rA9Pg8MA$}*##}12
zL&q{*i~MEUsPBVld+#X@jwAf>{g9b*^qd?V--UMS44IF-oi>^6@7I!O11G0@nSPeB
z8_?!)UN;3g*eLCC67BL7w972#?C04w7n`;@X4+=<t;J}YFTtEl$Mw&9`uVHTwyNIP
z&u7p!S37Mp$6a_wnC<5oH^=lGiw$O8J=pnk6Vlm(a!`Fk*e|j?T@Rg}Soxtr&7F(x
zOZT!ou?^%}WHI{cW|ZxfD6{Od%24;yD8n4T?!#Pma&v7}Ff904CYD@vGse?qeFo(>
zoJacGMUIV`FC1^#^?wn^TZnfK^2e-!B2PGe;CPGquqqz)kvMm;^mfz7p<R`A;j2b%
zGks(k=uIDqa^B>Ow>Y;dhE6s~*b5K_XA2)f8JuO>9h7B`t?Yh~>v-Y#DeU8tnAdz!
z%B`&9W!s+~_N{N8a=~5DImaT;m^IA8?XTOWQ1^BpwG{f_gfY_dsIM&7Fsbt(zOVJb
zv+Nrn^Q86TE<cF2k8}EDEVh~NN5Zi~&~b$sGsF*HfIjVU(C>`LHcvqLj$z%L^^av`
zQ+zbu&0yUWYyVA1JL@&aPIZu<@$o%Cv#FCs)|@R`s|@p-eMtX(Hr}OW`|N7zvt#J5
zC!i0^?XPpsAcXBS`-kw1#V*L)%dsTNCd=rR&=1ZvJdj47KNAlQQ%66j?B4zy%4V<R
zG28RhsJpi_&E2rI_)Pqa!w0_v+n3{aT<fkglEyw;;pPX|A$EY@KJbHm$HTYc%69!#
ztQXDTTrWQC@GX_MZO2~I2i<jwXEE<n8Fu8z!11O%p2%O<)U{;J9bZSk#c?L%+7Ep^
zZs~*aQ6Jcl0r^H9e$2=>#^_~M#g{PN4h}yD{ZPKgE&Y^@`Xbg+!Z|#3bRtK-a9nJ!
zdxm;?XKOXKp2PKjj-A7FVN4|N1EMo3;E6fhBN(5@FiwwSyq=KrK>2IFSE0=shkQw=
zcKi$1dh1dC`Y>KOhP4Ow%NR!=;27*;;773zw?97Sz%%i&X5R1Xb6EanqHZQ*XB>!Q
z4SN~Z3(&t!rXGT~PCTe%2Idp7?l(`&;Cqgc&l!g=2K|5FeTtptmG`E5n-J%4{J&>U
z`2Ocql<Trlw{HJ2`l5{}-_7t(iG6<iCZuN-${W@>mTpA4I#Jdx#=BOGIhJN(Cmmi|
z@mZ9;Gf?*K+Kw^QgDKSASZtW7=R1*~8}S}AiE}{7nLXF`C3?=X&;6J*m~x-5Th^y>
zLF{nfaE!}P)+RyLgXmu#N897RYq=8nGX?JfOn(ZwL4SM(`q(Q_-#PY}gZ1l8khd1)
zPUjDt!;Y3Y>OzE{@l?8(Yn?d5w6q7~K#pmZ7WRaz#t1FS@$3(Q{&w^UTqD68eJkHH
zZ^RnNd~5#1{zUr+&c`{2>OtLL|4?W?j(rcMJr@OA$Ni7sWsHNC?)VnQ;wN=4;oN;J
z#zEM8YTjR|T+DNoD~WM=*S~~wYs$#^m_0Y=Sm;5s20S*KF6v+B`Uf#48jW=you5C0
zIH&_(nT+!7d#DRBQx^tbkHWgk^4B~pYERjIOhUP0d%Y54Teh*)D35bc#u6w`6H(6W
z_IjZ8*5dQR`7zq8$y_gEdE%P$S;K;@i%}+aps)Wt)?%?9_p?%z@$Yg>7Q18n%%JqZ
zBJ}?oV`m?RZL*~sKZ-UU>s~Bd$50pl=CN^muS)b}-wAU*Tn)M=<W2J*!*{}EcYitW
zT}LtUgK=Dmux9-dVYqggf;`lxJ04@+?m)ZnEXoY&>rgJk^{a3!P=>L<-#nJtyB6bt
zCX8d7!T*;lXI4G4a#9uROAqSGB=oJ#$VZOF*q1g-yIY;uWZK+;)<DBC2HzKi<7Udy
z_s0|H|FO=?byt*q%6{V?Pnq?vXk&Pvgs$yz1oM?+sbv@kj1P(qfTna8WGln?f%R%!
z)A%a(<;<HH-Up0p4*lA%S0lbfdF3Qw%E`sqa&ilJVE+f^%jZ_ymQzmpdmmGTxRZ!m
z=bTqy&bbR?o`kiIItJ|>^KBE}S#V##B`7;b(T;O{g=LCmVm!*uA-tzUzr2}p+=4Q^
z3*&4vFOJ0yJP-ZFV`C1yfcF01@&4sMFfRDDtO<RDd4qgeRT6B?VBO_<=<5X9Oztgt
z9du=Q&i>?a<p0@-<C@`PH}m--@VMvbO;3jVOStA9u4|_74rl!EF`JjYe$$g&H=Tp`
zV)Ibes)vW`_J<Iz49~fS&p4j5;$Z$A!~36K6mxIKm;<k8_jZgq@QY&X?Er7a8x&!0
zN6{G5#;1YZf;e=Is|Vq@&XYu+z6trvy&YNxn@|QbH<axS+m-&;Vg{<;WoUa3p7`}E
zuxpNW^Z4P%@E(%+IeaAMk0=-Ro(|?8^NwS>_2}O?=j8jfLnoep<=1#WGAAfH+yh<Y
z?dv!RYlEYLmv<rWxv!)8#7$2&p$(;;&O+HwQx~}B`?aq?2VwilcWm6_agOPaxyPe+
zc<JV4)REX!KZvrSdpw%3=cWk%K@s+NK&KNV&Sy$=&Kl-x-X4$N1-%<@n6!7GI!yUY
zIj3GQ$D%GKp^uydJ#ZdM-Ff$V6cul-$3BmX!@V94w;Z|Y$=_mr&HWyDr}6MJvftzW
z(}S(w$J|}_d;A4-wIg<_+2irou~Rpnz%%amC~s=r`%}>V9$`<!Mq2wl-s9cxk$iLB
zU4{019Q^f--`a@1I6pw!h<ThDqq8n<9BJ*ZxG1RN8cx%&^tXzFV|Q|%ybSdKYa(0s
zAup(x{ak~!*0LS~9`^fOhY8!fjVotD$NBRPhIi*sWhj4?qinGIL6FBisOP)5)&_aG
zp3by=AM?jsAnUG^BiSbmAp0(nJq{gnOlZptS+Oo=-bLietmFG|%_th*|G%<V<WC^|
zcHPi*GrNwAk~&hxy(F*Q^knk%;Ai7b4<4vRndW-atEk^!Te%i(TC|^Je@VEXWZzr!
z?qc7|HAy=^On-;6QjPY}%wy4BF^@RMaQBrA$GA3$x=T4#u2HDFWsr;g0^4)S{hi|Y
z=EpGKpp2X|j46sAz#fx_ZMpVA)?c8Xc^!J!JtmxIqdz|opuXu?&z^4;ocCCLGUvk2
zpx^uk+TiT|61+o3KVZgjJ!liSzvOkuH5vUU-)qH~hF~=2LZyfKu4TXUmvPfyj^6zO
z`pJJs|HHnLWp_RL$l;KcYXmEihB@dfuSS23`IFiA5ksFAN7_@#aNoyp_zxlM!Nl<0
zJ0=7#e*-*jf8{fGZYoaS`6Ax8?mTtarA=t#R>9Um?ag!UUv)Fy&5jRV{u<VjGLWeo
z^%7(Fmq#rO_C5-XeHvx-^=ad>eOlr7IED5lo`Zhu4fJE!0}EZm57*1SkYeUJ$_4j_
z=-!ZVXuFT2A3KKpW;?_8S>YVxd9ydM32CgxJSAsuh}DOkgFdW>eb}(zp>FACxaai4
zxPKUBBiwh&@!r`+=lkPlVw`}vDdJ6HEpk!f?9IQy9)MKQsLgYWMjL%IZ+2w+s&H)D
zgR$xL#o@SgFz-k?X55duun6VkAmk}ph@+aH2_~^_OahkOD<YWN?y}9yc>05kr$4aU
z)OWu>=zm?J2zq3mGH;oe)yTh~D0d%;ufCZ!${MF$iE_{S#`z|6XZC4?<5TWg4fl6p
z4IO)?W4l?`#&gVry2kfa1J$)(OTYJC)U|Es`#CmceH&-$+a^=r*q;{-$3836u{l`l
zVV#@MeZ?PG|2APi$V0_NW^5SXc{nx<`_gw(hyE{n-veJ&apiyCdmt|%YJ?ytDiN?I
zh?xI>S}YHN8kA}lutjT4kbnsU5<`%ns8MMf{^&xbHWjL9X-!z{vMaXOvTdyXx>#*X
zD{bkPt+8vj;ZL`yXv0>^?|Wv>+;`r+bIA)3y1)G~A982z_nnz@=FFKhf9~9i^n>J2
zjW48U<8%(=KlmI*JI2YB6r97LzKuD{Sj;#62p{lY(8W)YeiCO*$)0I0g1L)6i-EN5
zEQXqcxaTqKd&;)9*@d?G53Cu@Sq!;`ptBgXhM@g4{~F?aUPDCG8p8NQ?1y3valUU2
zL49u-+Q*!$Fl&fquq*N<*{CP26*|e6VV)kv`XLi@cbaEXTTy;I_}P91emj-EGQI{l
z-|8=Ejx_;3^LWn(sgKL&W@P7N<It%(EAa=kC;32n-c5R}K!3WF#%d?5bXP-rlNak}
z-w%dEuM*F<FrG|;ZfH#TJ@ilYH@Y)6uI+WemYYClo)=Z~dYblys>6CcP5VdRzq^3f
zGV$ki<g@6!hwZs6`6)U>J`&?3)raJ#`p_N~?H5rUR-um9fp-Pg%p>WU59%>c)x&9^
z=S1{7t*NR1zl!q<weauv!;ZiFz$&a8Qw}y`op=oX82)tT64*u~`Y!%o?scWeN6+IZ
zJs~voU<$^86pRB7eE$&acaSb<Y<&UGb8C=?_Hznpd{y(xj4gUzsr#{hCZW^E&UfB^
z5WIG=Zs>ep6#l=F{QoU<wjuZ#1o8Cx@+kIgsGX^OO<R+m(x4-yANFS{+_r^i^K55`
zS_57Kdv8maM+`xm4@sCu&@+|-*u3;>rp;*{(~+w8qRCfLS+?>1jl0bnHgR3xwb?AR
zZMK*v={>IS!3f&*3XB6I(B9-D#$r5xJ*c(AYO-PY>1n8M0iIE;M16^l=1_OQuZ18Z
z?D=2~>RJukm<m16zJalCvh7i5H)-G0uGFSPXX;9Ad!qKO+pXvG4H5WaT8q;flg>A!
z@VIw7Y$^-3tj;*3oY)zMBIqj%x_t#_9I#jEo^cq3eN)<B9}3-3e>;Y?)YIq_-g6Gr
zM_ORFUA*?9wPKfCZ((hD0oIC{JWtAkO)nK|#Wv`Z_(nsmsK?+fA^6oJsFyjTc>nx@
z<N7z!p;wRIvBaE#Xh&O<9%*l50&HP1bXSS_zV{4-8L!Nm<9O#Fj4yf``jXE=CuE4T
z5LlBwhi8;@UK6(FuA@gnpWbz}JagLx8{7|_+|Tpw`IvX3zkPA_HO@Mkd$**fuBQ37
zf8IUVH}8J(?)>AfzvUQl%Fb3m&)RPF*}I2=&R1Y9XwFw;V|`eNF|`nDFuY%oupWFK
z>p?nWvFSMLL9g#1|4a5j=PO>J{n8IHmYwI^`4sxpm*5NNdFjfLvG#2E3H--&@DW1}
zPK2G%dXJtDj06qsJI4Lr2sPey0ZWBlV;yvK6~-{UQkapA^Ay=QPq7m1P4j@Pl<4Zg
zm}}FT)tp1o<67b~Qu50aX`MGN)=uLRtvhL~BzqbQxs>06Y!l&YvS7E_@Kr_1U(;MP
zXx(={`)e&Pl@|>;gW~?$xs&G22Owt})*!UD+mCmKXnnUDc7|v3U!?gS+1JXHfveYG
zeb<cj-5RX#p5^u3{k*=z-1zN6Uf<0JpI6}TS3%cfuxB|x9N#w|u`Jsi=jC_$Xg`g7
z8u@OjE1g@Q`6!*cYk?i8IT&n2y@vwZ=)xLnOilF;+C#wjuFfscx?Al5Byo0u#sGSM
zQuf!W&@;^)MtIIHT!TJJ=R4-(In`0DFR#EkKlO|Xa}PSdup0i0WH#%^rI4GRQI$cD
z31=9@`jO6(WMSS=c9!$J@r$&7q|Y_#wO<zeq&cIYY?SPbdC~a#9Qslh=CU^b@GAR<
zUA^!REoiqEv{^O$cni0gdj>-Jj$Y0`pkMj?!kmMkafR$1dUel1;2CTD90b;^QLN=I
zK!2ih5HuGj{Vq{@)n_60W4y`2IfzZEct#qHub;`rk9!^h<+|q~u(m?E*w>+FbBXg0
z+k9#a>O<q?RM=((wKw`AovZsA<{&8rv39~}{z3B*Gascn2#ulChchsaw!prKj`}#w
zK~#T6U!H*Z#1K3q&cghQ_HlYM|C0MSW==xu+LM`o+3KI{IgU#BRgCBEIgT*;Z#&v?
z3%4Wfsm5Tx#H0BXo#p5RPdqbH&(>*<<UPwV5;EBK3r^>Gj!evh=sXA3*LVi%KhHrj
zz5+e{Na#uLYn<9M9m(yT_{S%jW12H7=x6GEPnz4){s`@jOn_a}dV}^z!Z>fR68=xF
z9p${5){eA4BInleammcBhioA~XP&E5-zNXm;#oVsA=Zv^OtJ0%(D*{*42?G<Ag>u`
zid8?=XH97Dm&U+O%nQ5mtd7oqsPiTmU#KtR99_bB6Ejydd%p7QIiERs!JIj{Mw~h6
z{Lp{qq>|2@p#6y_l{+Fd_~01idCPO|WC8ZFt5J^{)F%yp=WLHZk23o>Pf~lpSJ7N|
zZ0M24Yv5n7=u!4}Kl+F{e}Xxg{rm}hWhh0TKk4N2C-f|}Gcp3NEn{s;-=xJ^l-{00
zp)&wvH(8Jye!MsfzTbNeWg^NSgR?c{PpO?2z}~2>&Vp@y0X9*s=0s;5Y=`WP=rg~-
z{?waz2c4cZ&BI)b=5FL)p2Rb!aVV<@?+nv(z%tP9g8h&!{s3zX@<q|fbS5RN_Sr^)
zb`I8puQ<_HL$K+QnBN(@HMV*oXtKi1KaV=y@4SMuNYT)J|4idO-shhA2If%FQ1kR%
zbY>CH%Az#p<9Qi9gBpgiXpey8GQ7#B8s1Ti_jmo$J$J(6l6@bX%CJ4-pmB%#DcK#-
zRP%h2_>j)ipf}Y|QMZZEqgngM=aLTZYtp-7gRxJh_sibGJVQT27=q{RTDP?RFZ8Vc
zpJtuXetKuBd{@E#4Evb7{`a3xGv^knVJ9^hcg=Z0bG~H~`r&+xwF}rrs@41eXIx;j
z-ZL&XUyza$YafcdSkI23^IN1l+8?K}`AX>NezH5*++8@!axmQT_!Z8;SGPiMOVBT`
z16G0O{<FzXKu`3{Uau4Ad5hjB`3TCPHlXJ%DbN*-@!co~&xrUr%MksX1u_ubE7(uU
zxTkQ(2t126zAot8NmrQmyN9f{`5f;)kY4+sZqT7QpK%@L2edEtAm+A3PU^vC%w;ie
z$NqxTuo`lcPRx9GHrjG3@ar&7p>rL2j&i=T6FTP|w-f&wiRyvzW>9>NLTe7}xuc(?
zLH?(qKU#Affd1(H<aY80IL|`QaOq4e`5DTq&a(2H@Kvl$e#C2&=HskQ-Uts=YhYTN
z6o|D+J7h-ZP-~NDO3G?lpO`rz-NWC!;GGW|TP%Z}O!e7fM7_^)9c<_N1Y5*88tlpV
z&(YZ5VWV@C)KAUX`zGiPdj;<IT?(MLuY{e|6DB$T^fcOy-rt_^8S*!n3y*LH!7p!#
zV!idoeNOuusW^|1dPSkXkDeR*=NO-Nn~Jk-zsBB67WOG$3FC|q+LhM0PR3(+=VU0_
zK%Ye+ozpsq#$MWo3E|uw+2|Yd3rgfZr2joL{oICVjm{{2EE2}IZ2GnT`3id1|19if
z4!~Kr(7KuUKj!B@@(9+~;W58M{c%QXOUwE6jg{u<2d;d!p>q`8{lZ_{LnFHPk8(;6
zJnHN?R_v5gnbcoLbmSil!MApeg0AQtrgPQv-}O{R`$HAo<a=MlvmMyzm?Jk{i!-O6
zz&YK?kRx^!GO2H#96{bLyd$y_`(ICDA1WVuzU!mdlfrvFlQ7;9ujg^Tf!=)}UGKUi
zuIpp>hue=0$NR7kX<h#c@40lMA5)(F_%_D-4~3Pk_YcOq!w)&@4nV#ld_RWt-Vtub
zc~7U|sqiZ3e(;tIXRsQB&}M7FXWf$@bxK1>U+UobC4DD<cC33P+N|Yvr@QMRjGe>v
zz9-TD0RA8f8t27+iZ}76zhe>lh7g~#1^?sf`(fxi!n(%$ga-yg*F&|gyCT{@Djh>t
zRCa=n)x1ETas2R}Yudrr{hrLRNxJQiqV2mY&O#duK>J5k`_DrAPeofththmfzehxE
zT@9P)diI;Nr(3!ove4Z9*tyU%WNJCPd3pu(cL1_}8oDgRnZvFb>QiXzX$_5c5?;VQ
z+Y4{bp|P93MUpXw<lTj5_`eQ2FN|2}+)3+&F0=*CRvo1G6lsrW2KE%Hp<k-2tS8B4
zY-#p6WJ`1=qzv`Aw!OPT+tX39r%7y2$lrzYNz$H{z@EMjdzu6LAz6;tXg;1u^L^M`
z7UXOTu($Kjw~3}2>**kxD?lT^hw=(+@;$FjqCE@QCO5H7zIh64@@b1ro>Eyp?&%+Q
za{p-X_Ya#as(+lQZKAK7vCUw+J7b%DZ<{OGZ?1ayVKrZ)`GfSG%5TDd9)NEgNd9w#
zQ%e4`3x0C~{O3^g`6ck3<X5RLobjC_X2|jUjPJz$2<8^Y^POFzoDV;|r$5F)F|JPv
zt@||3>$)%xJMiPJ4cay@>87<Ytw(5Xp==WK3)mz5DVsbWHrXg_lIFwMrx)Y7UVFA-
zEZ^Z9%QMti9*t#Q5;T^RJnawNrsjn-mOB$OFG(EBr?g`(`QiW6vHaVf`DHR=`HOut
zmY-5tPSIGNls!Ity6v&D7xq|r#vYSc@7R3O|3rHX@{P3SAzzd*W}7+XBwp_frS(o|
zM@t&7cP2UOJ_Y|+pw>GfJSx=xUzzJ4zZU;?iu8~4o@*D@Fj0C|i?xpH8z-r6(iC+L
zj$yyF8L!XKJ8T_SYaglC&X>YRdi|s88<C&ZP{&>8*l3bi=Y0SEkGFq6GNQXJa!E<h
zTvF1|SnX~9=O6mGT6?!gF6nN6$obg;)YH4pIT7F37P+mYJwo~k9v@GsEXVPU$;hJC
zIgvB_FK6~&?E5dY|3-Tp<dY6y&xM{B$-S5;@4?WVjrL(yVgH5J3}pW_Z&T|C>=DyC
zqc`ga2foPc!F2E*%wp`p&~vXd`!ITM@XS6;XdUelCfF#($ul;3X0Px-Z}u&ZGlqKi
z(rt4~HHJ<){yw&`QQDUwKWg)#E3sEYew5Bc(teEeq4aLre)v#&C#|=8GG~0L=Q&Gn
zY@-*?S!}lPKXFg{c<bO4UVD(eChX0KXDwu-^z6sjC+*9SeP&>sH@2C~-b~ys@m*4k
z@w7K{yfOaF{tSKhq4&@KY<B5ggPhb}(JAtuN!z8|qd6^hS=mdwJhM-e%ya4gSL`xq
zpN4!S`6RVA;(4dpvr+3J?A08=9*tTTVV?#*Q?H9AIqTG3wpte@zgMH4OY>gMCiu$)
zUwLM~rs4ma{hEjLxs5;LY>E4S?>t1`qj1K23hSZHd}rOe_-4W`*k;C9eP-h+r@N>P
z-?(y|*gwA+30>cn@07NL@r|_0oVUkf4=~$t@>2WZo6hHT+%h$ka{ZXck-j%|cq+yl
zd_!$r_PuE{uDiKr2fa^m0N>Wj4y9h7-QPKn&d@C2b1-yH0_Cpz626;F=NZB{heT%(
zTJU=toy+C_BSwxrT{v?fzYRk9>5O{^^1O*OogXvb2w9A8A>AK#N~vDv%mw~m1METS
zZ`{z?l0W0z%dv;z=S$SwJV0M0uhQ4xxW0yzYkh5Zy1!-gbtIDUDxQtvJw@p2lUiRZ
zaposAs`T}5$I(}J1?u9{7tS2D{I&A+Hph7$XH3=k6Phm-VxMwo^TwYqePGKwpLROl
z>B2W-=^JJ^_l9q{{tDl>*59Ms{_~+5+TQre&r>otPS0Ai?Va}TZEDE+-A~?`zk9><
zmSyj~Gk;E7!@#nZ>3G*}?HaUQ%YC~x91Lx0Sorr3PLF<g%j-k3aAxRdDZ^WqRX2^f
zcgu$BK5Td$^NM9tzdmsI6$c-jez52}4Xc*TZ@S{%f7np{;lkGk{%*ze)PByg6#Pzk
zuDCipWB$Eo4_^(R7L7W~uDkcV8D;ow<<0Y(qF2Yhn3Co!BRb3pmqBmqw!<EtWP5m$
z?LnQ>W_$Rucy2}Z&?w&jqx|&Fm9ht<wLR$Pe2eiO(HVQdyX9x>VGH&1Q*96A8_1`=
z0)JzC>XCeBT|3U85x)$4!;b8FB>Wup-(K4`%5rTR>AtjWstd_TbxHl8@^u;?s2)Fp
z59-7|t?@176LEmj=ZEN9N&Df4w!;r;dhNHq^vj_e=sj4%Y(8lL`=kZ%NyZ<w!5@(?
z%77mtf0XizlnvS!#lCnQd=B|8@>k@O$T#(gUxK_RHBKSFJ5C|pm*do#w)2cB{{!33
zId<$=2!CPxMex@TfBo@y7XAj{FN(hu{H5Y=ApX+ucQ*dc!QZ*~JCpz9^mhRqGKCBs
zIX&HDj;PK)+vd<W@f`XHd}JH^<>2GYq46y0l+K~)+&ayH@4}pkz8&xe{O;{|CyL%r
zqIopEpVWf)ALu&@yTrEwZpS+sL+O1ayki3utnb47^fAn%FvnN#;^}$yU^S1LkFqNs
z(BB`R_s~b9EQ&vZ7(RDx3jWAfpM$^a_uuoyKSCZS)NyrNXdwQ-vW}})rVd>FAmTOQ
z(7I<QI_q9S`oHil_~tL&|Ln65;QyLL*`IeJH+;bf->}vR-LS%OZomhtZ}`Fm6Q2DB
zuxALH`0;1I4*c^|LeGBg;uTvj#d~b@|7vYQ9aD$IO4Pe;crSy#6E*?wTu?ihIsc_e
z%=t+NL2XRqpm*M%!Snv-#k~K$$PhK}SL-C6_qQiK?;m2F_qVz8em$3`@zyr)r}38N
z{WRX1H3E&bwlOwn-cRGKocGgsi?Q~!&HHJ5B^#!?kPUyIZCI@Z*@oMCu;GNY;o$g~
zyDGtk2eS<i4z^+Bl{Q?%HeB1MHk@&AjId$3Zarhe$*o<_*s$=!|I2Kc##vflwe$Ll
z#@qKX)|mCx`S_Ne83XbEsH*QmoEZmC-8kr7SCIZ~YeJfn9B)ndoVz9*toE{&oWz=N
z@ZWe%xa2rvmYH|;G-iEC&b!n)@dW2x$ScRJzs0=kRE}9^?9IQ9J!5b9hQ-OwkzNY@
z4Ew}**Cc{>P5R;8%l>$W^sM#|Uvk#b7(;tqw0@vHsu%J9QvD9!sGze3n0v45!dXSE
zzVS|~e$R>C?~J}U@{;{{NAoev^-J)+JJytI*N5?45WMeCXCCPL1@t{HDv!!i>n-Hl
zk8>sTyEC!!k~i_5FTESxLGR*YEz;q17vntSm}8g={~7Yk!Q6f@${0FeD88MHyx?cb
zr*9a%8BRGE{qWe#HoS|zA8S7SEhqghI=zqlXM9h8L`^Z?gO8Q|4&VRSkN5z}F#k8*
ze4G=)|Jil$2jCM5rQ*Asaapm(%UFqWQ}8bRe!O2p@3+5?GP_Xb8|wey#yM}?SB9If
zu1>}O*9P6~$60QA)}x=d#Q#s<5AT`O-ZdES#Jm)L=0g9cK=0cF&&&hbgW7@gbEYj$
ztSxN)g3k0O^o>dJzHtO;dRGuTGVRCke<~{bo)jxp?EpJCZaW~a+b57`KhD)tpD_J_
z-XTb;Pf%X)>akDY89Ui8Z1Cux>D)2(3FK9M0x`W)AJ`{^tO<RB%X}YYl7CQrVgULC
z?q#1a`w?%VkIDZZg8GEDKl~-!eslz#vlc$;Yj|%1KFYzfG}@adzoho&@qPp8-FeHY
zqdgh?|4c{Ugzp+r?z}+y4PnoP`U_~Db)3+%PI~jz)W_dMyQ=nz#QoTp!}nSJ*v;@W
zRPP}JF2HwT)H47)YmNJ}qj*1F`m{^&oe1)2o$S+Me?3-=y_7K%@c-3Buz%w%L%lB|
z{D_)MsCOe$4(j!<@FRb@2D*X1gM3L+x~n{8x+9$h`JDeJ^cJD>sFC)gqsZR+V@%}l
zYP>|xDw?k*n<IN8yED&%66_7%r106>B#*t}{>=ewZ|G}EX94~pL1&ateS3jz4SAKV
zv9ECL489`J);wi&ditlFx9TxVf8V3KVhX<TF$sFXIRXC02i4pEJrcX_=)5`pU!pPm
zO$zmGZ1R;^IEQu&<7YO`?vlSN#Q%v#<<fUp+;2{dBHhzBC(hS%2E3<wl;2a$r1!8e
z#?dz?=$sEe1hJj=ZsqqSCaU+Xg6pw_zX{WhZ<Tx>-wvT~!aT;`Dly-du+re2t2gi*
z)6l%Z-<C-HmI=lJ*hCk6BfWD)G}ZXFL=X+VbM-6nTz|j%-bqM*?*zVVKiZGJ-&lmR
zqognT-U-P(5#N#_A2S&LzXIuxd|wo281A>6!>xgSs_A<tupcwd5d9A<-<CL~vRKYL
zDp}~;5=qEH_0r$G3AV8@I8RG$Pqv1$;(>NX-%sz2oyCNmIXFYs$nVsgv9<rbwid<n
z^e#M4$2aj8&^NWRmiL=6;>DCZccK4ISQEOl>}<rNojZ38!#S`H=e#VedGHJfTRzd%
z^vzs4XGCX=@c(x$xE*JgvZK2$Jn+*mPEQ?7Sn7hT&qaq<ql_`%UN@c23jN60)R6t6
zbDnwLpNca^RNi$TR=!^L)WG2j@a&(?7p34FQTDw9)j1;kUmZ=^I7gI)-&fvTqt6lL
zI87^Yj;M>|DW~_xv^-fjqm;e8|BNo2Q=0IzoIA6Yw{3{xoKg$^Ke-g}pO5kf!VfHf
z-$?mf%J3*;8H2NI@C~K(zU+1P4#s(<=<phIUJ1Nwz^9G)fT!UzCi=>S2Pb@G`t^&S
zK|Kd9n2NHx@c(39k+SQ;>!^O<Mduh&Q7-<}Ik{?-n+^H)L$>R0UeJ_sZ~KO9Izt5>
zSx==6pSrB3DGl{rjq_7$APezZfO=QcZ=hG_r^=nCsgNfNXYo_&<ML#U56`FpzX==9
zy)$}m%J7xQA4Oi0DHZZWAs_U-HXHS(a!9Uhlv7Rh0)Mw&kk9Dn0OWM*fp)5a?yrNq
zWsnDDEvrF0k-V#nyf_D@&U@i^SARGIM*54Ayg2)1_)uF=TN^u|wrIH-XU<UGb=>Y~
z6aV=!@K}lRc9GmD+muIoH)WCDSE2o+zER(0so=R<>K$d#Ikl{(QirdE?o$=-vxif;
zx*mz=)`)Kz)dOeO3|}(_rQAHbsf=U-AM=}O_v=wF(m&}Px?MIE<+Knj_#0aIX?o0`
z5EeJq)i}7+(q)Od)^b`!^9Zj}6jjb;^PJ13&2v7Qxu`C4PTiur<~A&@saxb+wm217
z-IB)4x_Oxmvlrbl*KsZbuX)4}fzs3PXYL7u+)fq#uqWZ9U+y@YJ|A*o*PQD#Ki29v
zZ@$;x`O)Ja%gM>f&B@Ej&nd_$%qhw#&MC<$&CSWp&CScr&n?I;%q_|-&MnC;&CAKl
z&CAQn&nw6)%qz+(&MV0)&Ckit&Ckov&o9U?%rD9>&M(O?EyyXzEyyd#FDNJ|EGQ}{
zE+{D|EzBv*EzB#-FDxi5EG#N4E-Wc5Ey^j%Ey^p(FDfW1EGjB0E-EQ1EzT*<EzT>>
zFD@u9EG{Z8E-oo9Ey*d#Ey*j%FDWP~EGa4}E-5J~Erp1sU|))&OOdS<5Y^WNsy79y
zI|Zsg1=0Zp(gOw31qG!KN{~({KrbqOYv4?rdqM$smC=95>7;*sPZ!0T8g3W{194(^
zr@wm(;^rT2zVBgT@?zaPpC5&I)n}WgV5a3%J@eeRI?qM{EBlT5*HzBMMO6)THC35e
zxjBV}&}hln%-d%#o?De!w<xorprjZTugcDxQ;X)!<c818EgqLME-y2yy0Ni-@kg(^
zYPK$8+#Pjwcht^ZT(_iQ&fIZx>K0zrSXWm&r+RkHqN{3a?^<|eeM8;+xpNvbt4imU
zl+G)t%7vEms|s^+^X3-L$syIv%fCH8XYQQ2`Bi!OMS0n%9wes_x_i14T7F4rc-jbO
zGVX^d)Nz)RGA5r>e{0&sm5+wk_xsXWk43+n+M4#2a~@CMFlb}O6X$<*SZbsooHnBV
z)^nWK_x$3QzuNojfBVh8-~RjLfmBW<my<*4pL|Z`tmBmvK9V+~a+bFkC1V?xvz_At
z#5*~S|JRku&Y6~WagLGkiPW#ArG{svjmVj%%Oin^41Y(69sxbVp6}MgY^mY0L;%@x
z@HbwYl<I>v{<Sg}vBF<H=Q&y4JGh)ClxgFgSasdbhd56L<v}1FI?C7`X9cAvpA#!j
zyEtZa_~o=G&iQJ37}|)HbEEwB--!%=C7iF7$_#2(wvJgLPqT7c#E`X_%Sr3GobYZ-
zF=W3la~aeo6sTT%8S9O0j7Gk6_8T#zQLpsLX&0wI5&mkwR5WJ#<Z~Qj*CkB1SIgZ)
z|5ytR`1=RR-pu8wb|jYgThG|8<LSihdo5n=s=h~M@8fd%Ax$BMzr&1`=(5Xard?d_
zwm0|dCkA~rBQ??w<(AKkcShZ4B`Bl76sXHcv>B8^R+AduBg|&6%1m{u=e(*P^k6py
z-kP!9j7B*-xEvb)656RL-cDKgsgvodG+ky{+QpfV_Iu*2uSQj`&MZR(so3%OJxz}U
zPKT!T>n2@kCft&s7%dd>n#TG4yu#DcMldVTk$pBXZ8Or4-{QMGP6%XU@wbihP4?!C
zlE<rZJq~qL>JObg@CjGCS$;`*sC_feqQaq%<F;?7wSCJu@2un5F8hUx0@{~sx0TCL
z?TdSApRJ6I4zgWtpTm~+A)O!M{JW60>wL3Rh8izMgLL!&%HTL<bdf%xF>Y&A{xqgr
zq3JAbnxJe|KDFrz&eyE-X&c2@tF07ms!V5(GBo0|o$1>&ePaLP-nU$|4rQcz9O8U2
zozLpq$d2i-AO+%u`X<N&t2ELmTZu7kho()G#q|Z{LK^K0sNTyt??#<Bflq1}H87l@
zDYDD0OuyrJb{Qdm=#E#4Sr+nkao(QlM0(1gc^*O;T>{#BGJYD*bgf#R9>##tkjp*>
ztdRUrF3Hd;vE#_l!E~$>`}~Ug+wy?^Ms<nu1bSLhb%_SnrJT#@K$#Rs-&KsY5@7Xp
z^}c>bGHv91+k^6XTx4pZGgJMGeBfKAZUN=k=4r!dvWRf9yeqk!7AnkA_i(kWx}K-4
z=R6sd2Z40h#@KoS?DI5K!?k-gPoqAA=SwO~K5m~G=Ib-0|BKRe-b|g>Zd+y^62^EC
zFn6!wa;PmRP<@&h>y1rNzu3n4NWO%=2@^8&GphGqrW<y=dWR1Qm1)03V^0QFZxou<
zRgXPcjPblBXl@W04^4_$lk(YPQ4aReRM<&ZX$NZD4sUd=04+yjT`SX%)$#}NqZN~v
zof`M|a{kx6{IGtbnL>E0%TbN{)HZ227*633U3@a8hIhGH;&YxD=c(3t66ROa+)0m~
zU)3^gr=|_86GmZQowAT;Yap*M2AIV8)n2CEqj_1z;sgb_V{y9P9#HdezYhHKs~FQK
z+rP;c8adBquWY(yRtPn#w%pA0>Dm^2bqODKbEvi?8{W%#W)cqsvZ+Ii^<={(78|BM
zi~pBJh23<O_Q5ulnrKu?r<AXX^Wpyu4#>ApR=~}-k@E%VHZ>e?4^-T3!#$jDg_hGZ
zuYki9^9qu$A0B*B*h&|xZ%qw13r}I@Q{y?`@qAGZimYO~mv#C6_JhI4w<+`-yp{9p
zw#nqqt1tk%E<Zl6+LKrxPyN><)SrB1Km4aI6snHrD<iZTOJqj6i*epgD!{6{@D7nr
zjZ33J+Qj*$>3s3Is93*I`J0%IeUf#48Gc!CfEq~WdpY0C0Gm_Q5lSbS(r|E#!trE^
z;r9Zj+egHc&++>)?2YM_Vq1bI`!}}HVaV3RWu)mc-1^gR>jQqHw%W$OHR*aahp>S6
zY}llRYtu&H2Y1VcI>uP!J;ZreXr3|bmu1r0U#~N;Hi@adG9@MXi;FUd5c4qFOPPGm
z+7LGH5;qIDnrLDC=x!BI0hIsNlgz)7^Ka^j|4u*u82Inw{A)%2xURSp^)Jg%eoIu~
zxBq@t8R?A5$Q*(T!iknadZ^+u))+Yw+RW|D+o%?%)pT#xzF;%wKan=?<h;qYc{=_>
z9txX{tU+zw;nz9UwfrRWujTx0J@H4M7ftqSvbh-e@8<liBEP-Ow<i=J+dM;U{9_Jw
zf@P2%W^oxfU#k0#z0Fn6@wRyZvb1vk9No_=6SDIfzZ)}dlb7mG{$V%gOV@mD`67Ga
z$rCanALUIW=Y!DOyd-ZK=Y5R|z`mYM-t``~#Iu?6?F_DGWJQ3yJ5M5SH|KrpIDFdz
z_!eA1mE?VAdtD<fcp_rcas5f;-O72Jk0bNs0GYcuZ~bxXf}Y~oWFCE?u5WMi#*nR&
z^RCr0*TbDyyJKV~1h03;5YrtUDq}O3v8Jao%I#&4opo^;E4YjV`!p^%q6#owO1WU-
zKYBPW2<mx{eil}ixM%)E`d0_3fdpMr?D23dV#r&~Wt1>~JWmTM14}x88RS#8avAIs
znghpUlz<--#$z(~L!93`=b*Bq7vX|XrR^iQY)pi`WmEn#&R^S8{uY0Jny$BS{uX{d
zL2BxUKia;gG;Li*IZfL+gi$?snd{KfhRPwFrhYutacKCXA%Sqx0e1t3R6#5WzXX5y
zzoS(8Qp6)UO>@G_IDI+C*@(w*n&wnja{4O7H1DMH@;D~HSjg#O#AJu``$zHjF;3H=
z-j8!ShIk^UCn289=}#cO7Jn3`;_o{AQ90A__eoCQh`5~7(-F_$^i7CA#pzjyZ|3x8
z5Z}t_+c>U7Je$*V5La<}9^yMVU4wW&r)v=}<a8b4dQLYWUd-twi0|Tb6XIo@z6bGg
zPTz<4eojAt_(4vuK>RsQe*rPA1F7Dt@VA=N4<mkr(`ym0<MgA5*K_(Yj$09b1%DJa
z;BO=TsJtie_ay!(JcYlf@kjV({CypN6rRCf8~zC2g1>*@^s|V+$?0u~|B2Jjar`{u
zZ*h7D;ukpmUBo*%{XLF55WmRjmk__q=^rBgS5Ciz_(z<64e^gT{Zqud@kin3_<J3H
zB<nBm_e)OiMf__{{|50sPX8A18=QU<@$WeO7UJJ?`VSoMM|^<OhY<gf(|<yInA7hd
zewWklA%36J-H4BJ`Y(t-;PhV+ALBI6^g3buk?j3&>Cfo_h;d$2;i-rRa{6q<=Wse5
z@p+scj5veS=OZ4<=?f5F$mzL==W)6g@j_15aeODoOE_N2@iN563lZhH5-GM#r2Bq}
zAm2rlcT4<fyrLhF2)gvCKK!>ag8Vq45#=c<6%WlZN~gsEPW?SOEr&PHJikVimrVo*
z$LRjtM3C<y$`dF4v~vR84@v}aH?EYR3?EKFM0xSVpXRD^h9rV~7jaLoh@TbxFahY~
zvoxqUJUQ_E8d0M}BG~?Mx*whh@?AuYB#A#wSM--8f-e1~KKyH{-TgQbM%0s`#4J}S
z`q7CX-$k6uefZB}1o?47BThC&31M-JZv8l+5w)v8sdzXmM(MF}K%^qhRpL%3|53Gz
zAE#d<Y9vj}GE33tC4zhx(N8QBetTExUm0}*PB-{3sD0Q*MeoNoJ&oLnVTz*n<3ts4
zXmn2ukE!<Z<3ts4Vu{4K8>#61I1xr1nk6KLmt%DA#|e!%G?PdS^I~-G$A3~pco|)M
zA);m>iSSX?E>jahzKiG`wS?cER`k;nFmn@eZZt_ZzFN`yaUzH~(_K1~_)pa?eq7Vv
zWXRn3?-jit*YvYoI+G|-^nP5^f5wox@k-T>eq7Vv=F*wO5Jm6DHGQQabK`HvC|OAt
zUx+w!eAvw~g8Vq4k%SYagkbHU^gmDEc&-tr#)CM{mlVApC&GwR>!Z(6^nP5^*ZJsw
zt@Q85HGPAR{y|0W$2I*DAN>`I-j8egCLjHB)n0yF)8FHxk1BdUuIcad(Qk<n<i`n(
zI1f;i5T?cG){he!(Wm_=>4rCy{#Us7G7)jUAa7N=MbZ0l`Z1zr=!scIDf(53Am2qC
zn#CuE*OdPKI8j9$n&~HoC5qmU6IH}{G?5s0mneEauIV51(buW=^5dGm)kpuA7(sr#
zKn+EY`{)UXs8vbgPhXAE{f0!4?;>jDlK9hv7~MaS2;%N1B?N7vi!VgfswWZtwQ8@Y
z5<$L;sFhLTPY){k&50oHKBeYY-|*oCMAWJ(@u!PbInN}5e1})=eE1JlJNj`VjL<8z
zo=~Ug{Wy_DoNXRztS1z`AJ_EH`RH#~cH+l1{qsKh_hJP3aY7@`4vG@Omt%D6#|e!%
z-=!!al*Z`Rj}sbkzDH3)cwOn=j}uYE=}4fZo8^k$kJE1v=Ou~~!cax;$B8K7{4jx*
zZaS3y{W$#=abBS)A=D^(KTbpu=d}b{x*4eG{W$#=aehisLbz46uOF{f^QE69(3+cw
zT9KPO9semt@z3>*=NeI~_C#=9jP8Gt2=ZOT+3UmeV+8qeLL<&^C`t%FR_)@)i74Xy
zHi4FI?o#xAoPLWqZ&H*H&QtV$oQNWL8QvSdquRxfYx+NU$(=ch-j8eg{XY8sir$ZF
z`a?eYPpNkI<C^|YKKlJJg8Vq45$7F>62j^j-THAtBhGsiC4?(ubnC|njX2#DC4_%f
z`uF2R6mkBNKub6Eir$aYZxQFO6eWa#ir$YCQN*ELoy4$R>EDkN74}bj^q*Dqeq7Vj
z?oeVlrj}TKT+`DIQer5dNcVo6(1=63Oo`z?Vs!7v35__k6O|Y~7o&SWPH4oT-KxZJ
zd5rG;IH3`TcC-@1i%S1~oTwrW?Rq7K`HJ3;6BYJ7eDwVly&u=~7yIbHsoKkrYkIsH
z?g^h(^nP5^U+SYjs@m6&Yx+?>`u2(RiyznYm-*-m6}=zV^q2eSe-)!&{J5sao131n
zEJlDICp6+*;iFHB(Jy|S(1>%TkN$bpUVdEDU*)5}P0{;tO`q$dKdRcxk8ApTAN|vc
z-j8egLLdG0ir$ZF`eGmb#)<TcAJ_DyKKd+0@5eR$$9(iZiqS8AT+?6eqpwx;eq7T}
z@X;Sr`uF3Sexi@QP0{;tO+U#;|96Vsk8AoVKKesS|9)K4U+bg)lA`zHntrN}{^N??
zk8Aqtee{1nk$&;xnqHk+r=%N(D|$ap1QF*3U-|zMqhI_up%JItM_&=6U;H?s*pKqj
zzoYc;$2Gk=rAA3NY*6%moCqS$r+noXDSAJy>1X-q-%$GZ<C^{!AAO6W_v4!WRv&$?
zqW9yP{x%=|gA?f&Kd$L3ee~xjdOxn|Z}-t}i_tHBT+`3>(N9<Oeq7Vv;iLb((!U?q
z^ff;EM-;su*Yxx>Dlud$dO!YirDu9#l^E_(I6cAghltbQ!$&K6KTf$L&SD?^l8N+-
z9}g*<o|q+uuf^zosSlr`@MS)HsFLR%A6`9?%DLBv?;MW3@^C-;Q3dthGEyV1(B}de
zcB26U`J9uB=mZs<?!oBx(E)b)?Rey7qkm=`$%9NBa#-S<hY*fT9JX^jaxmd(23F6;
z>E<(qgrDo;t(<!FD#8c3_%xHEdYQC{`{5DA$S|05Fy;IKkK9IvhZ&eYCZWP_0_t^V
z3eiK^9FSdwI#tdke8=w-<L-&EM1QG^x3V5y3Ml_NRB2>*v`e4H^aJw<zud)hIJN#F
z!n0j`Ij4R&l5jBR5aT#o(L;G0_Hy|xO8;QO!RR4h$zNb#N4=AayT7V(;?IeU<yBuy
zeB;l9O1S(FMiH(it-376f2-(YZu#|$mtH{hlU&@i?+Z#lpK$RiPPIXlk>RN>-odGV
zK$DCNo80<L2mLhQO2ThsDxAaP)G=jO(_MTrr#?{nxyi+wIrWWPDrc69oA#QZ?Ef<^
zZbq6(N}k(X+(=fZ<f(M=(X59*Tu9~5aq(T88m#bnE?&l|pTjUlhHG4W1*Z-K*xL=t
zZ`8W<&7As((nFn#w{dEYva1Fck8!F-@m=EL#$sMZmm3*2)`a~mrg-vv!tZhEH*)IN
z`Gnu+;yYLmS1Ua~;NqtI=AlGyY8iiGw-Ba0GW-RXzLm@QmD2Mn7dLvlZ5Yu%?883~
ze=;(>*2RrHpNSCusEbeI@*jYnM~36$W*SqRbspjI{qqjSe|iq#t!_Cc^&ToXGQ7dX
zw{z;+euO{a;>LcC2DI;2aIRov_$im(l(Rma@XapX!l{1?DCb<|_nvX-GdOjTDrbv}
zujdra^hSoCb@9oppWi4wY;*BU#=n0S(Ld+nIh?u;3LF`J-o=f6j$KOl4i}%ysdrU-
zeb>c@aruSk68-mFyqQyfKs++s!FTcRQ|wZFUvlxCoLWDM=zr+qW4Zjivk8C2#b4vp
zYr_aPcX*D-_&n9_KXvJ=IrTB+$A0eOot!$R%KwFn8~X2p|H$xO7vICF=ailN#>I_(
z+La!D>*A)}Z&CVx)5SM)>fJDv|CWoVbA7+8<RR_pFq7j^ihjR=-S2%gD}QBbA3v-0
z4dv(m<kCA_{^$D>-*;Tx$cgXmS;u#JUv*^oJ(qq3r~Xa#({2~v%BhW)68&FX-00_G
z#rLl+{xYZTRCXI;>EiN_Q+_PIFK5bMto+yjm%fTqZ>#d-`)r+De!B8w@%^-EjN_Y;
zkke>AZa=G)o(H?-o0ZaGRZe^#%#`!r${$|f((mK)zmD<;g@?O%8sm{D;TQYx7qbbE
z?^87~#RKE*?egRpJN}i?c6@0Tl^@^NGVPe6@KLTj>YW_O`gVXl%nm4jhLZm>Upean
z=-*O&FL&wHyEx$696<l+Op-s_rC*D7qVUZCJ-n1j^znTyL;uVbcKuv+DbdIGwbVN`
zDF0gl^cycH`uM(<X|L%YAw0f+W%T^kWrWA~snmNgDF5bw`i@iO$M>lW{mKCP?<>CX
zeJb^y3(8*_KtE^%$rInFQtzaI{+R%M-lyo}`&5R0Q-FRBDEjz5m3m(V<$p7Pz6yK?
zh2#5FW?i!qQ`<|!@pT`}Mun@O&ynF;*B;FI?t`fBpm2QuDxK}5T$K}F4{qXeexUI9
z`f(TIG-3`4$M>~NIonh_PI39Z#`KjKzXpY`b#e9H34WWZ%8Bns8GM|oubJK8TLPT(
zc_n{*zvyL_|6Wy2xm&)$?^g1}_kWt1VvLf<crT2<T+U!sPJBPd;O{GWX1V3B<<w&V
z_HYdCI4B(7w^_sVOBEj9pIO0phblk54>O+ehXcxgMU@lZhbdwDi3*SJw-`IA53uu^
z0Q^tztCxo3`x{Z{g~B5WkMD07{JbKvHw^L|S~-3hOETN~cSI`T!wtE60=2e;aIy*=
zIynATA>kYNj=v9qyDC-wQ$BoG3ei8~;%45Ms>=7zb1q{2(TEiHx_Ea$;8~oeLXD+)
z>CJdcc-$LfT`tOz<r_O9`Z1#X&H#GT&%Asy*?zrvqrl_d-f@}&a5Imla%6qCvL?Od
zcL-e8_bq|T`W_Lutgo5RQu$KOn4p*PR0>>{-z0EZPL;rAIcpiGv+1%NsRvmOx{C@V
zXM7Zkum7l=kKoUQQ^j`{7f5^yMEO_-sX%<CKFb5>lW7;JpETy>ZTHauxbZhcFXb_w
zoN&{pNJMG>QqSu}`4TtnMde62+eCe3JDTywE5DhCdgY7;@QsP`CErScOTIyN2=}Q1
z@s;&5>kqG-=|Ub^zR@AkOL@uz=&J=T`{{Cl%ko<UF57Xpz@_|q0`PtUm*o!=xRgIf
z;F3P5US=fqwquhh$LNX_-yv`*|H}cmZY}-pN_^H7AAh{<CHt4GS2q_#^iuy)KT^-8
zj}yI=Q`*1OPpc?jma|RZQl6lGu~*Q`ay}5alqaYh>E|WiAb%pqU#TCH*W13e0qr%J
z<s^S7+p8=<{%Hc2`m7YVtZ%)*jcf!-{mXK82zpu0&Hy|naAN}mnR<~PB;P7QFYSD}
zz$M>Ify?nL#yIIMzAC}{^nzZ>vsK_y9$7D`2WcnLuA%|$xF?|eLjsrOcMDvWpCQVZ
z`k5(ksh^icIkH|-9$EfjK`+bC3@E=z&`bFxUnx(F>8V}ftF1(Pkn|Uc@@4zpD)9Jf
zDE|Dx>t}-Kmy2>F-z<SkzLH+@-7M&3IpYKHVFH)s=P>T=?`s9Uv|Gtn$|L)=#DnI6
zt)hG>zpSrp-=O))SYap9-eLlm{;*QulD<jclD=8s(r&j2T*|*a08d8$(mrFNUF3Xt
za)92Xe~^0HC+KB;KM=UASG|y5meUe|uNSz~LnfC`c4g+S1jPg{{bW$RHZnc+FVl7e
z1^F>)4^n<P&ylzs2PGcVj#8f4Tz8U3+Nad>%k(1x$uG;_t6_ypdz0-V>C>1Ol_T4$
zOyE-gGe!AQo+g3I@@0RQ<;eak>nqEV<r_UvyUX&o3cj-ZZ336&j}|z+>uf?9C#d`i
zf%mmMmCTp)UnBUY3wdO_+!{c?Lf{KUIoky;^(Ot8)LW~dm--JXXP=;#<;#8~<sZhf
zQGF#}InR{s)z|hG6Y@)Wq&}s8*d^#?efI|783FZ`_AlFOPe3`+pGY~Y1ih5AMc`6S
z*^aV(gW9o6lq1_w?lVYvOqtZavK?zhIZ{rk2PvoY8<JkiFX^S6Ql4_bSJF$pNqX7t
zrY=-O5Z^tbd|8gP2Z>8POZ~(|Inocz61bG-HG#|WcMDvWpDA$Z_hO8b-@B7-m7q$-
zy?#mRP1<d}pqIGx&r<%Kf?nEHbwGcS_Al$zEXtAX8>F9&f?nFy%L13>d?0YC=Zgd`
z^;s$K&k21>yOQMu(Km~7Bz=~^C0|J|`L+pqSxzhf52{yC|CRkz>P_ld+VeKSSIXHG
zfNvJKls~9mQqNMJp#CfSsk8?<9!a~E`(Sc@CFg-sPE)4WA7+Yr$#z^WaFdrHsRvoF
z$xQE^x0H!;q&!m3vY&1e^s@XGflGSHSNe@0zN1Asa-AsUk$RT$NImZm<w!YYJIeY-
z1${Djxu72+`meNq>92MQdRhKqfy;WCG}(ice=PH&6C8BP!syZ18_6PZv!`L`O?!;z
zatyt}jeXLS_Q#lpM6BX8l_zoOZ@(<)<vLE*w~=Y6Uaf-O@F!gAbC%GL)MvB6WjWOX
z-yq6gA@Gd?m+d0UPiGpEN6KFifVT+Tv>mbR5V&kdvtMo6#kAutrZ??k@ZF3XdZVvB
z9(scxVcgq}A29B1$A02@qHM>gz@;8C1TO14P2jS=<%}Eo3%EUIGH&W?@LN6fre2jE
zdV@DJ?yWEWA5Rs$^<B$2wXdwNImh8`cXJ+u@ZQ?n6RdL*<cz)P_Bdm2S`WRoH#xp+
z5O&p~i&OhKn*`n=aOvMNn8s`8)K4gQ@ihXM{oVL6qL=;M_%YMpjURiB%Q5}k;Kq*`
zdeg7>dgu+_&A7L}I|2P&`Z3wx(}W+8{%x4RWqpkw^VZk+F(be6W3#v%Q(uD{KW6An
zy{bI)24BIrx4z~aAGMntm!)0F`bs}0>ub(MQoUMPw`2#EbU`3|gTUo{>}i3^dAqc?
zeoRB<NWMn5UVOQrH#8*2c7aQK+rhZer?IP@j2rzM+}N$5H+nX9Yv>K$#pQVQf0%Kv
z{<|5cdP)78@z+~lX`iybF=2<YzLOa@@*BG<^VpBUjoli0Q!it;-ugBM*qeDj%v)b$
zpWgbK@z+~lW4DC2vaYCoE9rtj_y&PXd)qAVGxnzSb;jPb9{R%GzLA8zIZWfV^U(o#
zlfY$v-zIR`-;Lih{nz-h9ZYZfufff_!_b@lZv391H~3pzj@Q2(V!Q;g9AAzwPW6@k
zP1>RK^ZkS$ll2`ha9LmD_l*3;j~Tyb<TtokcNlt8FXQ(Ny}|1P{96;_-ugBRIc0sN
z-;?!~cG$|gA`6xK215ld=XG-2l<Ngq{+WFP-QP`nk{wEY_IBSu>R*mKEt-uQkG6>R
zdRgGIy@oN3*AI*jz}E^~_KRHtm;J)bpN*ZH{%-aMjGY^NFPCHJjlT9VZs-ke<|oDY
zUG{g=f4%)e&Yxw!NEiJ@+U-RGm-RLC5Yn5hubDp^`AvVnmCG^m8@!5fLvQL;?V&fg
z>8IZMu4Q^}edYXF)^{V*d)s}Jz*|}8WID;%+g3sU@)>(m8aQKb+7NncZ}q}{q<>o@
z@NWux+a+-6-!5VrubsyN@bv<h{oVL6Z+|y_%=BO5$M$eJroS89_%TCo`gNy=-rx@R
zM{j?R2K0C7$7Fxc5dB*Ew@iV{`Wipxt*`N8Mt<YRD!Cj}UxOPzX6Q}5YCZG@U&FY!
zzUvwH`ZsA;vcA%f$@*^Qa;RR?zf}qQ*}!c<&~kyBxh_FF1TO6@jq_6Zl5b7`zCz$q
z|2qXP#~1HB+1QnLo@{Vqw_g1lyEW})^naN7diCGUxL5ziKB>M^|7QI4>OtD4tZ$iU
z7g^tFj2rolU6nI#<TtpnTSIT^W$f0_8+<vJ<E`%s#=Z45_UWy!8GpU?HFisQZ|&`$
zS?6c$jXN7f+%8`IpRqTsqm!{Wvu3A~g8W;QZPIJ!V*~JJfy@5BL*TN%8^34zukmBX
z@0tE<@LgPvp*Q{7_&q~!@Iy@R?eAuPz}w$H5OPZYChbuA`7~jlvc8iAF6(Rjo{``9
zG2{1){05)N<rsQXFXQ(Ny}_H9-do>h#=Z4z5pv4<O1~%TEB&7IZ)Uwfa(;_-NOooB
zbtI?6*VB&(WLMu7^t&{yaH-ED0+;6~49)TEGf2)C1Yaqq#5W1PQqI=`@NULQ58n~x
zf515DLE>#pL-L!t5UH6@5-#f-740S4McU#2&-FF^#%otqtbebb*9u(f`DKAiJxlwP
zdLA$6rJb05;gx42(|he?6XRYxnHgXw(%(w?jc+HuQvMyHoc~So8$F+_|Jf(nQTE4S
ztT!tEDAQ1Mkq1xb-!eUTCgY<$cn;%cy+Cax%P(PigPZbW9^8~a&4Zir_cHFahkXK<
z=TSQaF6~6>S^CL(t_Rtz#5XbSwf|G)Kh6As%9ric&GMV}im@DKd^dPG<7Rv}cqQXz
zo@sDXPqVHu?Gj`9VeFp`ZpzQ};HLbs9^90_Bf!t^6u4}!4uSt~Xs>40r?<V<GVX1!
zO^kcnYa8R<_G)I_+g_%8Z+mTGdT)D~@=sNJ1&v=#%-?J0+Zi|Z*}?Z_K5y{djPLZ&
zck+FQ2S3dBrk@&nHgtRVcY~YqjsG-wC)0I#=uP>J!p~416Pg4r?R>ewrJaxGj9x!u
z{FN8q$n>NiIUn1^xOe=m7JQ|j+03}nv%~jo9z31zw|a0hPHgkwW;`(d&FIsVZ}xu-
zZpt_7AcLFo_j36LH|19ezd^s5P%Ut&|5}0nPt<>m>)_RYIpbdaS2DhhW7CfHeDBr2
zDc`GqQ@&UKrhKpdP5Gxv|7Lwmc0P?|r?#x*2Bmt@x$7(W-pq%|&L!T=zkAEsB=8@K
z^2c)8OTR|o(oTZpyp_xM%2~;{SI*@^9$8=0uSp&$r|Gj^Ia>ncH0x<E{Vb21Iec&A
zH*y+W`fVv^tB_yHY37GszRdx0mWXmp9SMptZtU6QpUJrK0|u{WocOL~UIeu;PUXbE
zj_5dR7^nJ5d>iB5a?E%^_>V;SM*`?en1<-3{UlpoQwMK-4IWhA6#?}%dhphFYk>T_
z1upA*Sl~t$f(ioaTOjCV`;KSawC^U)U(UE`UxUkWQ1WdS<xo4O@x9T5sjtD?_;+vn
zz9w*4-$MeIe5K!z?Hd*Jay%*%_y(>kLB@}fJU<rrUO_L*`5*u<=e$&o)U)&tav#t5
zH{-92e5Q`Z4;b9k(a;<JvXS{3dV`yBrx?G>a}H+Qq5dK9*SH*#|I3`Fs_quJ)Wbf3
z%lc-B@m<!}%#)4$#x5^ndLzHVM>B5dO}(-_^ad|u+*{vr#=Z5O#kjY==D82yvc8pq
z-n0ejXBu4)h<*d>gzl^9f<X9B1m3Aojmz@;F^!k+EP+cs8#^I-sps`fZ}jH1AERf3
zoBnO+jXpPXIfmZg#(undHumGy^By6;w5z=WmwI?h;Ih8PPQ3Ls>ntO`*M5xr1~=<3
zLvQMp!|iM64Q}kmTVG>8-ug;Ak@Zbxp4Q5BClhI6J0Usc`eHfbB&WoW1kiT}&{r`p
zZ~4`Xd&@r*Kz}%Z-uMA;`Nj`;%Wr1=d+Aq*c9HdcEr5P^0DUZ?72z#^GUHx(ZVjNX
z44}V=_1qu&V3jDOO5mJTAzKCBpVJg|aGJ`&C#c<E+L3U4n$!(3W=43Li#m>37ZV=;
z>M7pO67=|Vw;N155`Bh?I!-^<C*k;{w;RR_e3*;kJE8)|r_J54OW;OV^y5B(U*b|j
z238jF%@p`}fsYjU3W1Lnc&otiiDfr*3Ovh29p{L^@o8H(l=Ra{l4q=oLeB!ne{JE0
zodVBsQG6#@;P~{o8`9YbsC;}%)(zzX$0zXJuw3ByuMFI<UEm*cQScQwKAG%>VQ1+i
z@m2qo5dSh$;1gYH$Jr?GNdn&{@F@a6Ebwaup2fyZeB)o!#ra`@UoYre1pY~Z?-2Nn
z0zWM9zZ3YdsJ<b-GXy?a;5P}pS>T@*_%?yxEbv1D|BS$g;d{Rni0@~0Qe9&LuMl{P
zz-J45qrm3~{AGd96?hsu3*vi+z-J1)M&Q)~Um);J0$(KXE`iqz{Gx&ShWIWPc$L7H
z2)tF`X6&P%w+j4jLI0M(&6r3(XR;F{zV`|GYJoQke7V3M6!><5uMqe?fq!1$!|?w;
zP$0f7I;pN>1-?q)wE|xw@Qnh0MBw`bzE<Gr`2R8}5Z^EAq`FQP_<DiY3;fFh-zM;{
z2z;Nw<6pOif964j_<mK;PZs!-0&f!dQvz=j_}2u!PvBn{_+f!RBk-JbeM9oJ3%pw3
z{~+*90)JNEdj<ZF0*~@wN#*~Oz+(cZZ_b-gE%4_Jh<KyGzb){+0)Ii^(Lwr#_<mR5
zlLh`S0$(oh?+bjhz+V*jK7qd^@O1jnJOc6kKRT(dB?A9ffiD;MD*|s7_^SfnF7O`<
z{II}(D)3C6l#o0>6L_V-Ul;f$f&W6_odW-rz()_!H&p(w1zs)i-w3=-;Quc0w*>x%
zz%zLAMCHFJ@R<Vt4}q^2`0oY2N8o=D_^_e+hRWYB@LL6bP~aN{{zrlD5%`}3p3ajz
zD*tVPPZRjN0$(BU_XOS{@IMRu1A+fV;3XI68{+$+z#9dAOyJuD9zq@y4hcLW@GPFB
zQu*{}LY2S=2)s?;DFQzv@PPu)8m>#Evd<QHt-#L}_%?x`C-B1pr!|ZTX*`*x@@WlY
z!Zd*o75Ex~Um$R2;oOCD>X$j=8s^r{9@jXxsc~GzEjP?)%*(BqHuaiG<>eI<ubEnL
z!^BTcnNdD*(v;ks#=457iyIqi7Tqx=>0G7A)Z07>oSKrAPjE^)Pj24rvlrLQVF{-$
zy<tX0Ztk4w*$owq4YO++7f)R}WeTv;*|oKGb7nWzH4reRxM6O6?d&;orz~8!aA~sQ
zofxa4nnjD}HZ+1$Uo)zxs9974Mt#j^_Tt4gcP#3AJ`Hmh*W8UJ>ht>4*Uw#4)#rTB
zDJ$-1s9Rcb`?8AJi>fMw3Bn4?ulH8-`rv+iVm3dgZejiG2C{iSvs2A0Ub#N!<#w>X
z=fsxpXVhnH<!5z@TdHWbw*Ee6R9e4eadpM*v*#?B0!#0CtU4hZpFM*LPjWOoAr8jc
z)HqX7v9w`!eML><+=i)8;1n>gxTUJL{4S3S!RA3uK@MOQ=%fql7EPUYd+wAec{vpo
zjn(8bYUeJxqp`YTZbL&|!<18Adfk%7in@6f4YL>BF&CvDcM5SrN}F8RyJF|~M)5h`
zQ5?V&RcxQO_T)UDwv+9D$<~25^nu26dsl3-(o(Sr8izVcjFsL#yQ*S#L&NN46^rH?
zo4uy^uH51r1mvSm@65ivuA$KxM|M7UQ6tS@7th6gZOx(ua~rO#t8c8STeR3&N;BK)
z24@^b%q8{uc456!L0w=`owIb#Vsr@y(^85mZdtT+VWL<!1b4X;o5mF<jGkU@$r?rP
zr>Af$eay^wG@2FkH7lN?o(4|wp}Mc@6dypr$&72K+WZO|=G9=1>T94=&8Ofrv6)j>
zzidkR(uIB9IKtriuyu0tNo^JLY8n>PNIHe=+gr0!-BP)Eif8TY)5x+|RC7_?>8ol{
zysC+8`?$NEj&{^N&c^8!4=SbZ@{@Kw5IiGhvh0$aD)huI>Hd%;zXI)2=Ja*Fid>hX
zSoPWhldO*4rTA-hs#WN7DW`#@)uo&UzBZTArwz&@c=`2xUpeDaPJ&ai6V>>vc>47-
z3M+h_?^K(pn1<UKChNtLtzdj3>*V+)+3m%~^vUr{vVQL5|KzwOS-VrjE!n#98sPL)
z?UXP}x@LOQ?ljfxR4_}jW`%PbW-q2K>b{+v1hMHucSVlBZ!0ByN8dAZyYgvZC1zZG
ztHC07*PyT4Dz~_zLNlwtrr6wuMYC(MYV2#S@y&kX)K^nip6U21bE-R+p62-21kL~o
z7B^yTKK**yTt1;~>?!3*_h8~xb((k;f>-V7Viv5#B<BF9M2V-K*Kw41>Y1IG`Q^>V
z!+nnfOuA1cIsV#s1a>G-HImemjYZPcI0+uX)sV+xyb2D?B@U}3oyViFB-;ezI!=(>
zg;|lO@dIV^@JUi>f)AdrG}bMtr3Wl3R`+~cOHW@2b$@2W0EjDa9tTf)E9O)$sF*jq
zrZ#E8Wm6=bOEd-YV25z-xNC2?=}IL+vYcsKr?GB!ZoYaRJGUY?r(#Kdp8ND_O8K1m
z$rhDx_$ldJq7q5xA*Z#Z_9Taynq=!muK%<#E7B%*y6UFf|7oinX|m>YRxQ9tl5`9h
zvQL4L^Z~Qu8A%_oJC2d`0k>cy=>uj7J}c?Q7Cx)SS-i9!2TL30Ig1x@Vjjn8yZ}yv
z$-HE}O@c&8=Moalqq7AI>+YJ%9OqV7%xjpv(A=8UPw*fr$D*Wj2?6HnfwD?hyh`8I
z@-5<oa}-IQ+D$r_kR$0lCp>L%&(h9Gx>AV?up}+o-E>&k*Nk|}q0jm7hC`q8F=uJ}
zT5o(9qOa@I(^*<?HBa^WLOh1Ru1((>ed4xW-|})hSfAHQY_)l+)MssV8tP=u()O`Q
zh_kfd)bmJoLe3UvY5TYu#@Z}rX>q(0%xT6j`*y_37OFV8gT3{&Q<EG|=*<w%pf|H(
zW=_S-+=?mKj-63dfhR1b6&?c(o-riqImzWc^sJuaoFJDZtLkz&^=C~d6><f7QFM}0
zyG18ES302<n3Q)qTEOMf3pFKaLX&d)t_4n@=wzj4yIHsp_FquZn^VxeG#|s^v{=!}
zF-x{)Y_f(~-`Ug&a7eZeY+5J4p_dlc*Y>5$KP}dEGOUtq7q+clYc1JU;dbwJ`N_(k
zP=3;_QgQ9H8?Tu-t)k)vyg^z#dokXoY@B<?+=hzkxwZ9p!Kc<gSx8c#DdnH2#pJWR
zd`=DCTA4|cieg+a(ZI$U<{HV5{3jq|l8vHeTv}ef)W~?ljJyh(Naf>7Z{HNEcnU_E
zxZv35{{*D3tD4<7`}nUOpU}Wuu&BOn@stx`kYvmBf`NHJfOoR$>z3m2Kv6+*lKC>`
z=k+cl3aF~N1Mf1^n_~22Vu~}mX<TV3T}#xpSY3<MwGh{;ak&NRhOW5DS2y~ao2PE{
zH8)q?@HI!>=u3$zU0sXSwMbnH)wKXuDpuX-Yi^#p(bwEub;H*jb)zn&#j03!Emqee
zbuCoa0$izBb)&DjdFn=A(Jd)EUvt!rx|9~FV%4=+U5nJUP+beuH8)>H`kI@kZg4fm
zi$_|ynvNrVlcOSaDJ@h?)U{Y$i`2DHT?^DTH(y2inwzI?^ffnE6X<J>iqxgFKozU5
z#p+t5u7&Dapsu<3D$>{7Jawb5xw)D^UvpGc;8qIjr-E?`E6rD2)U{Y$i`2CcSF#p$
zqp!L7>PBC4^VE&L=H{v!zUF8$Dz`LGm9DPE>RP0(g}74b>PBC4^VN;M=H{szea+2P
zH+;>}zo^o4Rq5(ltgc1sT8Jx^u5R=-H(%Z8Yi^#p(bwEub;H*jeIpf>J5FJxIf|LO
z7OQI!u3%HBZs<xp)s4R9=BpdJ;+H&iqp!KS>c(8vO^*52!^y;N<T*~nQoyFk`r{DK
zPfYw#elmi7`6j;qL>PbO%O#Gvsl)_-{>%k`hy48M8yBNQ*>n1qKey!E4<;YMpUH3H
zZ{fQbia&ox&J+^k#BvXA@)^2+LVksL=wfeaiYOJ1K>Uf0Kkw!6=SrL)`Da?>A8V2S
zsd0Ascd|S=%wGwCi&y@Q$ZwOsj6WK)mNSz419~BUCChK>OZl&~$Ug($yCD(J^62jn
z8`XB^Zz8Y!LHet<=x>~b|3!oC{5LTp`E4+g!OMRr^4s*cm-Sc1f>Zs;7L7i7YX3%y
z{3(LJk>jR9yZjgR*Nj`4zllsfb6<}9Hu*FEQ&UL!>C;)s%HM2}pKQ_aH}S()+2uFi
zA)ICe<=Esia0~L=<gaG=jguq&)2FJEm4A&ze)^P|;cw!<mfGbv4y`BsA4Ptf{H+%K
zqpKt>f2&3Qe2f0y#P_TK`}$uiJLD$(CWEQB!S*4)P5w@n-`F|npVG<df3rpY!N_m;
zn|J{_g-!l+a#jfZxh{Q!tI218dB|^*zuO`|eL^W&`L|i*FS6*rCP4qAS^gD9P>#Lw
zR|V)loj>j+^-teNO;-M$7WwHL#)iL%TgTe<-^TLGZxT}#Og^rT^C<Ew%;W#FSpE(s
zB>TA(>15^KWs$$sB0qfx53tYv&384^=tmK}@=rj1oBUlYzv(|D|7etxto(aeenU_B
zKZ-xY-^Bef{~{5+<L5N~uBP#SrV1vXxeppY_gVD!F$@1k@I5da|K-fTr}1+o@++A<
z?O)lYB`jk>ss7nW8+{nN4wApiBL8@c{2e3h@^`cRG3IX~ul~M^{5JX9SbifX$q!Rc
zTK*#z`LDLfKPo`~CH#F;^PTh{`7a63e+SFImot+57;2N2-`TD+n)agnAGgT=;9$G{
z)A@U)rvC)VAJqO)=AS0ypJ3sCWq|)`Vg9?2M+R^EX9f7L*8MtH2WO`G7a(o)VeBGE
z{tS!!F^l}&0qtK-lQjgdyx#kF1KNMq0iEB-N%9v1N>=_%i~JKU^51^3z5Qph{PcZ%
z8NBj;7WozC@gMapzp)>Z|D(N-f2>9RYb^4=Kgurunsk=B2l?Mdew+MVEWccTUEK@$
zODytFvdF(TK>uraQC;7I{I3V-zllE<D&>#$LjK7X`DshRw7-e-@m)?5(L4TqK$Crh
zX*zPRCZ7SuA-_%k(L<WTjGtsblK>@a|K%3>r&#2FE@1vq2ERz5N=NS1EB`kG<{u>%
z`9FbDl9m5fi~I%1Z}^+|X*dO&{<pIH9j@d$Ve%RHtH`e~PyelE`74=_^gk8pWaY26
z$bYRx|6j+X*d~8%hGtyF{7vMQe-rZC<ln{eOaD2o7xFh+<S(<xAG*>m|8ADQ*$B?D
zSN;#i+U4(L`O7#T>HkKglhuE-MgFN4`Hx~!Vbgy(Ep`zm>&U%&<v)V_HvMPuM~P+s
zosLqHm4A&z{_8CAzaKDvS<mt}yOQgKSN^w=-zNVomS5V>O}&u6)gu4(7Wp^j+V!8o
z--+&N{j&l2ZSvQ%{FPjPvY%PKkbkp9{%IEZO9S>lGly!%vyevyul@@H_CI&C{Br*A
z85ESP{cL0T4L#NWlNR}}4)8xs-0<WxWbn!#G=JP-(ccXg{xw(H+y7<eKe`9~RUyBv
z{mcGKOI^vrQ~fDz^ufgk?ti~*k^e@E{BPpB*(9QO{O`iJPGOgh+^biA`;gxze;dm$
z{l^@XlC1o@E%KLJ<Ucz={%yc1l<CO5dgYG>$iLSj|2&kEto-{d^8cMh{@0)&oBq35
z{uQp|I^mW7Uy<LY|LC7Iy{SLhPfai6@3P20!y<oK!1JHwwAqKytgi8kSN=($v&mo1
z@=N=vMKQ_h|A<BYnHKpo1IEt}SpK%S=qlxve|W(7*=*5&T`%N!p4W`im_N1OO&0k-
z8?gVf8S7FCF?Ee!yz<XNew+SxvHZr*5dQ`gldS&JEb@QKBLAEK`+tk&FNlk-QeOFQ
z3$XuAmS5V>l3vI^%p(7%E%JYFh`s*~!@7<_hq}fuUin`@ew+T&59>Tq{w6@l>VLFF
zej3XSe-nQN^Ax~7|4-{$3LACgUQIp&(EpQRlRw7tmoXvP&pk*dD}Rnf{+liGzn*WG
zzmYcU5q41JMDWW06Xdta-@@|m<-8>SeMl!O|9Ff1w^-!IDG00n$7X8AJ=s5wL|Emo
zd|T(2_VYk5<S(<x{~3$?cVnIi*k?bLnVP?8e|;CXKXbnX`EB}NYmt8iG9|13nHKqP
zwa9-*o?ZU7Of6w6RZax2{oIcHHu*bP{<WN!?B@$eCo6xYMgGrP<o{W~{4)l>PN66L
zzZNk6EPqGmm;Qehpk(E*wa9;)MgCb}Kq~gmKU<QNe+Kf~^k2>LOZ$Jg7xFh*<gc*E
z-;C!3Hu-n6{5|=fdywBIe=Ex`?T6CI>VJhr{z{AdH%097w~Pie1X?r7pkx(5Ir7`&
z&w5uAwJ|N(|D#AJEB{)S-_TS3+b#0b;UyB$Yd?D~(~LWG<X*k<2d)2FE&7{d;s44x
zcK+)>qFJ`OoOQy>|7GO2>2Ejduafgq{i!UY5173QLGo|5$iEOd41W{<2?LBxe`7D#
z<?}RJ--!GMIDq^%`E!nFib^IV`8Ob)to++7^3S#Ce<GOM<nLtpds_dGM}C|9YgvBj
zKc47?{5vi3Hz2>_CE`bMe#IvL*enns^rZhskl!YMheiKSp}b`Ezsn*&{oll1`5#HQ
z%iqcJx2RggFDAc1RwBPm{>=9@g|Tz8pUr@hm4A;#{-wxo_?tK-#V&t!w&tIqBll|Z
z8K58XD=cgf9hX?-e+EA#D}Sd&{sk8OpC6$A<t+dDM6ulZ8~D5c{g+$h-_i^D4_V}|
zwa8E73;y~1clsDDAs>S^;`-!wpGkQ1U(NEDaZa+IXOT`;|J@e(7h2^1MZowo^9s#4
zlPV{I*M4>*zs-KOvHWW}FUh|R>15^a_br{#&{O_J7WrQ|%dY>%u{wVa^EZ)K{-E(E
zjrq&{i#iMcSs(!HYyZv6zo+qY2J+kV7kghzT*-n{{i#WfK8#-pl7E;*etMQ`>Tlws
zm)hkYk9jqP$vSecCZ7S0Aiu&q_PdGYH*%8vJCG?^`A1viztbZB9|PvE%`E>g<dMNE
ze^<c#b%#a&-|dC`IV``aFV(-nBL7wA+V$T$PD|Y^g-6;ee^C3ESoF8p!v9T_3D{@9
z!>-bddwTxA&&cFy|6zaD`O9>q&cAmcZS-O6B1rzp7WwJ_q&M|9@ecy}Uki8qoy^}v
zCZD<gmw^6P$?_ZjLGAZaFXS(`$iKuQ|0AR9`k$PuB^*nQBZ61{mB_C!kN(%P{7syf
z<o_Yk$?E@Bi~M(4<fs3innd)jU+VKT<JXwKiM;Y(j{G+Hqun}()c-4hl9j*OBL7m0
z{6B;t+T<UPeKiV)bmU&W^1q1uHu+0ferf-ti)7_*w8-CNk-suv{gzdrMXq)w*9ouu
zp9xsMHCy!m(_YBmY?1#l<Tw0HjMwd~`d`cPcWSZStI1~oyn1KV|2CGti3!R6e~xsr
z`d?#_|89%^j|SO)p=R8Z{*MIMf7Vf*f0&T}7rl_b)gu2r7WtnChJU{PyO-tP!~9L;
z)&DkArpN!pSpG83Nc!K4bh7&2Y>|Jt;e~RH9M2+QlYeWGW;~hso5<ud_iX?a=8?aJ
z<(K~FH^`K%{M#(@-)oWoYXRf`VV1we2+FZn{wI*%CjSnL{rt8U^6#|Bf1gGEnE~_f
zCiF`Rn|0(~z4G6P{5JV_TjYNer6jBWT^9Mt1`U4`{}JsD*k}J2m1vRE=|>SvJ_B_j
zzfJxwi~MgPQ?l~!VfhU`$=+;{e_eq88C$9)oM{B**eid~{A-^@e-BvrUmT#nX6E11
z{Bc--{+$2T0#~x!RR8@*8+{nR7$kp}Mg9jZ^52bf3V?m>fB2)C@owgCBCr0IAiu5s
zD_MT&KWHwIto%nT@;_vef71na`8z(w5>w?w@XEgd`EByAW%<iEFX{hJNGB`5^KG3m
zP2^u;k-r)5DUyiZ`D4d;ow0@Uo5(BwJ;-m9f3HP;dL)so{Am{XKW~wLP{8`L>}oCX
z3L`kjUir@sSbt{zMQ4!q^B$mN<sW8|{|grR_u%=5P5-a4{9AjF|EI`r(|<Y3U&i^#
ze!6=h|7eT+Ef)D7yVNd!)5kUA$vw!w4*6~Jx3c`k&yf5CC9D4&i~K7s@(&HL|D7!V
z%RR_HD8T-=S@i$cUdTV*BL6Cj{0jp151S`w!F%$b^8)q{yIFo|{~_>CR{v!d`Bz)y
z&pO|3Kjkqke^2&53i)mJll6hlFYUiyFXW$Tk$;Uv{)Jel0`~dO4_N*x`cVWWtGKU5
zew+ODEPor*lKl_BU$XkIw8;N3@*DmpJ{VyCmDgy-okCVhntTTS&j9-$_MxVb`cLhJ
z{IwSOAF;@vI@GTJ*d)z=nh}&^ul)UyUtyRB$xzAiOZz{&7xFh*<o|n%{KE&><zK_{
zACf{L?Unz0<hRMc)*?U6rIWRv6&Cr|TIBy+!2GjmvKE}qOv>Puzd2z3*}?Kl|3A1F
z@~^eXzs@560kl7f=$-$(HbqO_ll}Z2`EB~&YtjGty^w#SMgA{Z<UfLaKAZf*KB48`
zCzX%1SO0%Pew+MJ8mthSbfor=FR;k}q_JP7Gtm*|pJo7#z5E|%`;B?%nwh_B|KS$?
z9|rJuuGIzh#J@X$f2)Q6#TNeG#dA`ne~<iW%%AoQW$@PjTgXpXOcEizjro^ze)9h#
z@aOHncV^l7uVBZ!!c(r7e=YLc`0G;R=f8;mr565?0RGXbn(;=DU-k0;>*aR-WlF1#
zQ_uN{|0oOpPX_3J^YzK`FALEBjxd-ZNdA{u`2RMb{;?Z0|4lvA|JMQf&+6~zf4PPK
z-(}j{zq4HPU)ux!X~=JD|5lo8AjtY>TloJA@)IStkrG1v41L=Z{~eij{!yANAV~gK
zSomjOYUl5KN@aJ}^icoN$ZxBEQ<|Uul@|Vw!G4L-TmLn)H2<FZ|GEJC?>a~Gm;L`L
z3;$^!vGebDi{`&VNAA_z|E@)TTm4IDvVc&=IjR5UTKNC=GCThk=D)cI{r?*IZTy>=
zzifZ{eomC-G2=p3fd0pRRulHbe^h|}4-eAym;4JY{9g#r|LzLSzpaP*Zx7Ia<q$uA
z`u>Zz{%IrZ`fs{j^Kb2e{{ZB->3{c7KY#jui<f^>0RQy4$?;ztz(01OpFe&7#LNG!
z0RC-vX#VSasQ()Q{I^}?=TG1N@bbS6=ZuK*EX~fnj-RiSIl34Z_x8V=k>95OOd9MF
z+BhfmzX|yB^8fv4JOA1RI%9ed_3uP}8~<I*|FGas-;eO}e-^)!q~7{3Uzi+!s-KPj
zj!Y`maU_5Geu9_(mH_{=rcPydUel3#C0;UoJ;498(PRff&VQ#^_}?<hUjJG3n#)dI
zjK0Cu%l{_ix79y$q|VsEIjQ}xweY89B2jwvpV6Q*_Qe0=AhYrBwD70*$G!TWG(qzp
zq}jRG-HUZ{8wn>uI;TyX70`d0muSMbJo&x)8x_!hHqm4efzF&#ApOx<L9hJ(INGki
zs--&L%RTg;Ey!=vUz8?`2&VqTpWgrV@+US#>21HPyD7Kh^u(W<*~WhdeQXm!@-MgW
zZw%-^hnB1C>Y0~L=_~P)p)R2RRA*`aB|1|2pKjqlI-vj5-lw^k@z?P5@*fe<e>Tx%
z6`@)1r@aWT{_*(Es{eh>lsi8E)OT9fCQUJwXVZTsO;!;ke|mq>%l~kI{ZD&HWp~!H
z{QAz%|6q{)^TDMy&Pet*%fkQY6#?~Mp)=B+rwm^GA3=Uw{mW>wj3D{b`)l6%-x<Ka
z`tzDAJ+qR*%fB{&|6vRNTP^&*6QKV?U(j5~_rU-80R6X)(;4OXMei?p>;F<f{j*kT
z{-*yJ9eC^iy@2|+&|(2W@~^b;|5yP3%2k?UjxI*u;OgaH6u`fUGfMuqTlfb(KW?+^
zf6YdI!{5aBq_X{b{Pfz@TI8Pgf9^tlRhB1zH7#}!%sPYm&s>ZA*&nm_pN-7F%2Te9
zTT6#;5+XlgF#~Yi%=~9@e&T<Jh5wHO_&bm2f@*u<zbk<MURrD+Nd7ez{z2`x-O_&F
zMt)O&6K9+8$0KL$S}lJ|M91c8@|pY5JpMSI{5eHh{%tx^<4<ib<nLhlO@Af*{}g|Q
zzlr}aUblbP!@v7cEuqP8<n`VM>2H^X|85Ka&j;{#)+fh*;zTV!wt*8ul=FW&0oAkw
zK@=5+#q9YjIsZjWXCk9F69?6Qx268yvef^9t2KYG{+BcVEW?;%!`Hw;{P$Y;f5*cA
zI|2MRGyh$N5ywVv1`guiY2p8Zg+HBhpfbJnum6(fu*opu*lT}3BL6w<7_F9?C29I&
z@-CkC%Kshqzd3Odl`{FC^x!7Hi8HwWd&r!BOp^at9=|-@&)LTLTRjHot^ef#<5wqb
zwjgxy07Ctr&JUXWW?c9KI*yk&<?G`1n>Cj1bQ{r>+?yZ&F9ZI~oxN~e-Bp<gIdtKm
z)B0LeP@vF!{3i!RDpi?!|CDK;2#2(sn#Z@@eyN!9WykFJT}&lo_^w^Z`S70awI8`L
z)c#?_S@&)vwB<;|*@B<fL&mkykh5;3(>(pj`}()Hgq@=+uW?>@^drvEBR5WL|L~q4
zv~@%(e)-`&|I+^6K*GXYMi^y;w!CL4C)IgyI`+bjwxgUaKkwK6+&Id24f4m1et6GI
z0p&$dmX-_4(d`wE^LEtPHpuy>2Or0?!0pvxXZ52$3AeXg;vDUdPfd45hA8=G96R>>
zbNKB`p9-}<I>^rF{ZEHbcO!RX%lnbA%S-CuNyuw-5JeqYpaTpo+usNqSsv@PEbo7s
zbZD>hdys>4_^wBXQ_&Xpqb*S9qa;TS<f?`&&*K%(@4K>m>2VB~&_jmO1KMqM<MdE_
z^%)(U(Ltace6Rgo^kMA-(Ep<`*q84AWNVew&#sBRkR58C9u1|Wj_B{)`J&^@tR5FT
zT1~GPhbH_I{x5_2OlM^9mUmTu{y`h=GswT3%Cdua*nC*^Hzv2Q`sU>JmT&ZHC;3<6
zZ~iy?wa<s#E$BNfh^Y^)f*-0@z9{b3qOsTuT~2xtwze8lsNTyi8kBwBlNX}?W1=zV
z1@e7FQw^GE=;A!WNN)<yiM^1L6??%6rChIl<agVTLciS=;r91G9f8m3r+npveok(4
z$e9@(J*geOcMSR75uucWnZV%NN-HmM2DMy>w&?GyYq`)liesYa*CWOZMND<c?tjUk
z3FkR?P7FIUR}P9D9T9TgZcU9HEe*9izVhkG?ZuH{uO9gC`(K|BN<EnUz^cc||4snS
zO`(;Klb^)Cm}<NC!8aD7R~wrL9l3EbWSrFAU2zR$CcpfDlwT&j6WxT!u!Eb>_78wh
zXXN}Xzl#jrLccYSoY=nl8`re2f*iv_&Z{lqiKY0~&a1_tfv<KsP7&$a*b4cln0_sN
z{jTt^)vtsvSiK7Mc{My_^<yJL?OCCrt5<#`+>X7*yq0m1b{cnf9y>NPb@asc3h1X9
z_3eTzozNNSuoLp6h9;I~_ji7l8j2RDob4Qi4ogY*gptk&qx&(TSZPHla{-3KnFgbJ
zt9IKwv7Pi^iQgR15tcHH^qO+;L84E0jvCzLsc|kIRP9_es3Pjz*$kSBe$Jhh5ohM_
zB2MA`{Vr}eFyP4xv5YSmm=-&V`NP`>BC9Th9twYizcJ9mK$LIrAN6yJ23{09nwqY$
z>qDy_$DFQ!%BD6>gMHP8(q4Ta6#9qX<NiYAA9HVHM#Xt$3y9Cu504f6C-igx^<DYF
zu|i58iiF1yJ=U!=@tRRaTBWn@><(ug?BLF=p*4@6jWXAS=<jS*?q<}1_$&aQ3C_TS
z592=MG=C8~+(P<T9SW^ReG0qqXR!NWUsH2eKR$3X#+hTs3ZfY#fAnB=Zp-7*t>Jc;
z4*DP+z2polib5YPc%4?39fdAxpi9C=Kv$zvVt0o~m*MVjr$R3&&`T7uRp7TVp;eDx
z7mB`G;iMisM13d}Ui}ctrMAi@zL4c1C$soXjHQNu3gn`DqDjeJ`FP5vxNP2eOtusE
zfi#yf<8g}P9L;{<w(c>IKeal$yX~A%_a^j(O7fA@Ek3d+ZufB?splvUjC9tKzm#(z
z2W{k)CCa{-<^$lr7TcQZQlE0xk-t#$Ea-*&^r~|PbhksE6Ojco$hDU`S{}#%Kc10<
zTxb)PCkmYmcA~3|tVd8UlJPynmGB9F8~OAYcDnVZ^_NV${%!S_tei>rg-4utU%1ZF
z7xGR+UqHW9w)V(b-R+P^^@U!_(x-jloWGTPJ@kb>(p$1N7KOh}%9r$!{*slm$G(uM
z$A#?Cv7>E|=&_;w!4cXHZ?W`=kDlT_F)`$h4e-V8JYJ0x82{#{Vjcg;fNqja^^IQ2
zbRvDjv}+cRSz{n0`DBtw$q3t9dCrJ#LpPuMZX3qbl(N_hV=({D4yC3}z`6rl9Wzt@
zFMHntUsqM-eR6LpX{n`zLW=^ueV_qrNz(KY<Z;`k5Trr|Ds+(XCQWXeK$^rPEh!WU
z59g~EHN~oxXYiR+s_1~=CyoV~u`@6;MGzPVr6|tSDKi$W&^oRC)_?D{?pb%AeR6L~
zoss!{`*-iz`~1&(?Z???pMCbDg6OIJxHDP0B}MNZ_I<b1v_s|nKeW@n2N(049iyK4
zW64H5=Z_D@Y#3wgKA!A7ehccBh7-fKK`W)_$N!ttQ=YNrx%NMh-*NX!kPe=vYZGxV
zqdh=9T^n#t|Nn8<S)>L1hpZF7NVW)BO9b%)n^~XueyYM~Z($NcA$ILyy>V>o`MUUV
zbVnLL()lFuEo7&pzxZ+V|5NE)tX|14@#Ergq|+r>(B9nD(b}9UudJ9er>dfA{>&8i
zr*2Mlw5PhN=g*s0J+JxnR8w1H`^wasY*%+H;g$1dRm`eNmACZtbatP0=9!IF#;lbc
z9V^?i-5smDnzFN+I#!+8)6vn^)Y916er8+SnpN-V?CQ8W+tib4u30g^W<_;#<=nY*
zXE)EOsI1D)X{xBHu9>r9_VU>k*{1C5=Bn9qt4<Gs37ilm*IgQvtUI;j9W-dNoUqA^
zr{UL*Pt}b(CH3jVrcw8dzPq$#+>}(^_~4mmfA&+eZ&)qU)?3<&CF4%10PSZ=?-_gd
zxXy7?Dwcry$3$-Edzjv&b?tbEK2fI`Du|Zey^XsKM@>KavqnRrEywYk=y<`h*fDCF
z$8s#oaS#J^P@leWBhew_A50l6LI=LF!i_}70P_^11NnyUpm0~=Ao*r;Em6zah9ok1
ze1K`2qqIw0+H!hHhg*t+$mQ~|PL&6gr=?6g1GMCTQTxC+DObQ`|6+vU=yPq*&vbRL
zt#*9<(s8HMo3ccC{kgH5$9;anJ!N-K9GloQZc06M+)$}{?)ew~`DZ_^J;v(U!Tb%x
z4hPw<Fjj34i|u1<CZ_@D#_{*`yO<82r&5eX^2{xHl&YY|nyqk~afp_QUR~}$-^cU=
ze)>L_{(%wF?_~Nxzx?&C{0XB#=qaNy@l7**vGMI>`T;13rcWfk10$s0!Suz(H=vJW
zaGP+5+SB8vPX*Ht_~|3|H!yv%_VkaCe%lD>QO5T$eJSiGH<A9Mcz~tchvvdChh)Ho
zO3~Dr8#{`FBq@ok=-+MV*%*ae`lB5r2*w-wC~oQL4asq@(Z_%wh~hw#0aX@`d)ClL
zagZegjD*a0-!$}598}5R*nDC-`=p_d;+CE!nmg{phCYg0`r{pHs&fr}6u0yzMCj)k
z`Y3Mc&BZ*Pg(m%@xTU8rFpfLT&_{7g{|<+mp1+1Zid%YTpaOxrjVV#w(w`EM|Br?~
zid*_qBlKT0^ikZ>ry}(04Sf{1^iw1B*BJUJZt15*=r1<(QQXo`kI+{d`Y3McXGG}F
zHt8S5E&V$q^ivFd6u0!{5&DFokK&e|zW6u}bBBW<iUUoWCoMvu+ivLbM2)&+Fe?In
z+0aLE5GGBFFrVdSLtl{(@>w!)M~KmQNJAgR!ICt)t>%lWGxX9z$-kBi=H>%*_HIKT
z#X*=1=11t~n)Hw2mj0{={Yi#Cid%ZL)biZ{V^0(ZRWiU#ihTEyp^xIAN(SkCVmf==
z&_{6)CWD3W^4z_KK8k}V8Cf}&+M<TOHctjlG6p|Cf-f|9T?9YP;O~pz6(&8GMDXJc
zesKhU-N>nr;Qws!OC$KB245P%KX35MBlsGFFN@%RZtyE3_}K=(DuRF8;57Qkai2DL
zql3~uHT1EyED^R7(oC_3AYc3ASZbggmk86pkLm9tyetv6A0(w_(Ic}g5w;UrnEteJ
ze)(O7K5Qr4#`Jg7qrEH<wg-9{|D~Z1pZh{T&crKxz6<?#DN<#L@HsB@=a4;RiST(X
z^bHB%;d5D19FpDnYB1@mG3oX<6s59+$pmA0vpL!^c0M`F%0M4Jucah4lKsAXd5?)#
z_`H@U$IGOrEO9bx3;PkiV({?!D>6Sr5i3iC&sp={N3=63eSCJ7&^6)BDWSmAMouaR
zHE^hv{IW#&oULa3*CxNF@fqoZU~*|ACwy++W#QmAbiFJgvE=t7y4Dbr{s%^ZK72lI
zW;ySmEI%$0)*JPV|GB}#dLza7r>H#m;`^wPA3je9nEt1w&>KEC1;5+iGnp!!dxCMh
zWr<liT*~K3G4Z<9=&i`nOT6x-@^f5bNe-8I{nX$W=kOGVYK@$#96rFItg%yaDF_5V
z&EVnlZjkBEF!#%RKI8W|I(s@M-M&s$Mp+_!u8I85ne-Q{!?}&m82r+le4(f|a?Z}-
zVo#^R!{?gdpECDjIzoSf!58Lmil%XYX7Jh^K7m8$P`xMN+(in!hWkYW9B!ig_2HPp
z?ZfYjk#i!+^U*J$s?djLiQ%|})FRX`!uI?ZRc*&5!sn6TryG1(E(X0E`X?hNd>#q?
z?S@`z$58$=RQ3Dp`9Aj#<rHw>))@NE82WQ!=ueNK|Ig8Wdww$3kAEeG{`MI9(ir-^
zRDOKvaCr><!Wj8mOg%}J0lPH&FH$-5J%7Iv^E~~hnCIz9R6mp@qR-QFjb1$UtdsKa
zYl@WbdD=nc*7rR9XLCPBpQmKLaacDeEM4LAipCiRA0!G%LwTZM=>Z?^%1K%Afh%VQ
z<E|XJ(;??WOam{)VOPG$apjjYy(_;($<gv9Uaox6>&h3su6((3|G)h<q22WPpGtoz
z=WaeujwvT~s+_FgFg(d$EIqMO;YUh-J<CM-(efJ@hu&6?UeI5o@FzG7yi?&j75-s`
z)0kZ2K(FIF(s=3o)pEoJH(u-62E^-HWslT1$gj18OFoG`C|4Sn``69i6w4g092R3|
z56gl4>nL2x=e<h4#`_pYe097wF^>3N&tZ5HFV}vFw`;%DKW_SzvrIRAbo%S~iv4cB
ztYbNDeEXDq9bd^uH@<f<y&K>Et@*3dLFcbd2jBhszb)VUIp0wpbUJ)Vm4`Qz4lPQ)
zF3-B0>-tmj1?8}hdEx1Dcr%^L{U-M#?jw!=ch)nvkUga^lAPS9ut(#4=4ucioh1zD
zk5SL)bSP)NZu;o-*ZCs$4_D9l;^oFy^3jd2zQ1&N``?<sIvsR;bvnG6`%6Dx{*?2*
zpUdGNtDYHYc@}$6&qyA@L|qO)PUpUQM&mO%UhZ?Df^pmzA5?NjYUes7e*=X}`Mi&P
z$k({U1?endkm~ZL%i&1lJD>Hs@jYAFqvNaV6J5{rF}+*Q+^XdJ;^oG-U&+z&{SxDD
zdq$oYuwUn+<TK=JT;k=%H_h_h{QXml?@06atx}$KzU%U=^Ig}gqf~kLB!}TqH;i#8
zCmNS@!<76i)4-E*0=z}xDGmeQsPJ-y->&cqh4(0YzQR{4Jgx9gE4)tO(v|>Jukg=s
z7~V34cPqR>;h$Bw#1Zl8Qh2AL|D3|5{DZzj;X2)f2A5Mz1Ns{{3@^=L;8F(y(((NW
z(`XO$`hByMF9P38VX;H!FYq+e$#s$A!*60*cqtBp{-Yd*m*y~VsnY;y`~Q+@v<G_q
z9M|@Lo(RQ0Z9nid3z6$0$A^E6Y2l?f40>Ju(+a<h!|=5IpHg@Whau+^3fJYNU*Qr2
zy{>O{eD5G4iI0x&oeG!hkOMqTf4G!6(pnva<Jl*4<qn?a^9qGSuf%7*gQxjie6e5X
z>l8iWC3K=6^mj82ycCCl-@{>eX$}Lwm&5S1`~ih)`S&S2#bL<#g2K}Z|DwXRe5p%u
zS<C;jqEB%c^1q_+w8Fota4mmO;Vp`ONa4EtY*Dzj=dGBYCv#kmqI9EQ&Pn<JPv+3@
zy%IQmBFH&OL*Pf}&>(n`!@$QVd>oy_0YAnD%`vU;@aqQkNh&=2x<O;y6&{Wj2!dx7
zPM;z}m#{(T4Zm*CcWi}+U;o3k%0PcoC?$|J(15=~;eAR@_|=}?uN6K;(Lby3sS4kv
z@aYOapzzZaK7lg{_Pk5sGZcQh!j~%i-3q@|;qOuSg9<-W;jbvXQsEQ1p#ytnD;(di
z;egMvL38X;_&kMwN#QjLe^%k|Rrn|_l#qXp!tvc14)}RCXpYSaU!d?!3SXq~CltO|
z;d>Q+fx_{f5e|AUv_X4Zm0i`;xi-jL+1ysY2417_F21a%sxq_W!i9_K>oW@$UYNOf
z!TT3qR=;4;;>tNR|E0AlW0!VXzIw%lO&4F5sjQ@VEM1wNuEy4$?hBh1FJ3%n^@_HR
zYZtExX7yxyduC;>97beSZmB4eSF^gkIostjUleap9{1eNrjFI^J%^!pHW@)|!x~y-
z+-tg9I<8&S*uJ*u2nnq2UfT{?v%0cvjYTAAMMo}0YpX`W*LqldHHXDjnU`_K&fyZj
z#+JL*4k};X5?4?{Wpz%3S(ogv<;=EnkjS*W*_#!EG=DQ<iY%0clcz{Qiy|dz>6(g6
zdsTI2m|I+z$jXtFNL7*}e8uQhB|5@CoV~;GEp2J9oI6Zx)%_6BS=i>`xZ^E$xQ4rv
zoEr}&X09w0r($m&mR7h#6nQgRdGYZ+;&v5xa~CvgBw`AeiAok%pspy^sv^YXJ!*<D
zP~YGchk1iX_=?f1Zqx|>FvX@~IKDzRgSy!wIt$x89Cy6MhsWjI>#+97-Rmsvh~4W}
zUVIW1d#@L5S8+FKL9<38rf~5n@?J02ssi^q#F!RkfGO##vh6*=thUznYqDMM>FDgC
z>FnJBwNKiz?Nn~s8&?(G1kG#QQInzmqL#Md8`t?9l|^tA*<hL5+r2W|)4sUAselE=
z%InVd(2L5Elh@nbxf=FeL<Z*7yTjZH`Kg8UEfl+a4y5m!QrB1@F{A2;<8Wg)LS3Y&
zy`v{P>w=3v@Sg6T#-?jV{1!T|JDa_xW5tTaz4WdzpI$mL)aK6`w7Iow@zsYXu(P9k
zG0Cf5L4gZvRxKynda{|G#gJFzt6g5Q&hMZ#C(NsI>xd1i>0C|;v!b!JZ80$$?b(*h
zimt|0*<cpk@;!~q$zQw5_#=FWpSz+fo4qc(c=_;me3AECb@#Q6or^EMY<A}GQVF$B
zOWS3Ync=O;OW8$qe^{Qw%9y#COlx~<52^_0JuDe8+p-tmn1|VKQf1>|q?F}3tXN9s
zR!Ax}H}*6_(yXoy>NQ$=`7m{$YI82;G<LX`zA5fub%*W8!_i%kdl=neOK{|x3-S)5
zH@_{pc=)@i$a{NE>#F6evx_gih^oc8Z5>UGZCQ!b2<sf&F6Y;;Sw+V+bk7wqFLJZz
zvD%XCl%+-SWl5!K1@#MLifpJ#Ob<(u>4C^dW3gk{PNb15s?_(EjZ;yr+{4kN?u9%}
z!?#>Vt|^jBMZHun4rVmZnq3pj=$%z%j+N#}hvr$;^UXy%(nWKuG)Dth&odY4NEgkq
z(i{z3Js0q7bF4DQN^_(`^Q<{@jBq*<i8)r8W2HILfk>(i2_1>V9IMQ+(j4hP#?3Yt
z&9TZHD=lI!R+)?DSY?itHf%0dnv3RGWsa5hXf9Tmi{@Bmj+N#ppN#d_g%O7*(T8pR
zl#|EX!XGW(FCRMjDt*q#bE9bh3o!oNk-L`8h4KUZ`6dUhrg=-l@w;+d{!Zct=F+8R
zSrzg<vx!a-&r%ELz9-*F1G0Sj`<SkteeqoVpCx{uep(0KIISO_id_BW^zqWCe+MgU
zVP8B~|8(N_>3@LrOZFlD_&)3EZ;R0{dxhz-7qG$AzcNPucGlkjCUVe^@4&A9&(X(T
zU;Li{NUqm<xudK9cH;NNznni-HZUjj<9oBK|D~AtpUvM}3&sB@G4WsT(U0%iuKv;E
z{qf(<`U}Osg!p~&-{sMNtVjPtbpQL(KaHD(T%q_sK>R-abrqJs!FneDDXAjypBGbq
zJjMD8#lMR9efkGI`Y|5BP5&z?oqh3_@6}ha{o+BFb{`;qpZ?NHOVz-{D1R7t;OhTA
z-4s6k1FWc-`Nebf|6k(w>2G2El77&S@eQv2OKCo-PrrOmUn+{(clE!Y_<j0!vi`};
z2mKgF;p%@^O!-^J-_>U@zj&_xf1wLL``0nQ=#S$ch~bxU0AyaCbM=3UZYrPtFR^}E
zpFxDU{2wQNU}+&>e;=n`9iJopPNlz_eow~ef0ZA|4a_f|s~>WG_AlYVJk`R;zRUls
znEI=a`DL955##co6=VPX98rv&)6V68m5le<Ux$YcxkB~VzY#NJra`P+y2_sD`)3A0
zZu-AY%s&0kvi{9VCW5a0uMq$&jf=`X!ut0xhJ1P_{ayXvj?v#X)-n!QFL!kHe=|n^
zAP?Tr`pZd*tN(cdeDNR0gS!gp{}J)~;=h>-o~$#9_@Cj?|G60b_p|;%;?d5H|LrmQ
z2Y8T@)<2U35xH?vuRKVR_r-rHJ(u7LmA`KgvoHRGb1lCve`r#<`aeR<KK(mcf1&cX
zmiT@8Q#=?;=YNGq|G6>xd(qe-H(-w80lKuSiP1k{zNOOoaZ9-Ir#)@F@t;if65N0}
zh6h*wmBbG$9g^4(4?5HNk0R;npAw`05!OHG$aVF<Jw|`&S(Z`jN0D&#&q(;=-$3;$
z+$QVgj;{VG#P5s$1Rh+c%OA4D)jvqjIbZqP%lZd$nr*<<|3%{W>0i(Kb^aqsT>Z0R
z^lzGA^$ix#Py0G~_4l4_8MS^uuKufI^q+lPar(0{`dfGqqt<_}NB_rS+K;akssGlP
z_Tw@rgFa*~In=*t`n&NzHb(z#)GmY*dV6NmTEg(h#^`V0!J3nq82T5|U*rjXQH=gg
zte=YkONr_~KSqDAM}MtHe`2C7|H+&N8yIB$eGV@63w)4XN_^$NpY_+P^go}NgkR!6
zp7=rH>MzI34!L^k<&MHHz?c~QJJXh;feDfRb@Ug0(Z3`{e=qA#F~4}iFXtD;=ua=O
z6b(!W{qLi{@QeQ2DV=@s-^}_8#s3q;?@RvykNzbd{X1gx?<z9>PsZq%B^nz@CmiB`
zG5y{6f1LFA;$KST60X;Jxuft4@X?s`Z@|q)uHSk_Khje8CH?<4Mt>jcFO>d|#pvI|
z`u8aPmwNOsqxG(Q@!wIT{>zBpm;XB#S;Y-X|5A_s|D>0CpZ*kH_Q@5B|F4M7r$1e5
z`5UZf(*JS_yXk*&jQ&p6Unu`4#poYk{ryV+GLQbpW72;Y>n{}l@5Q8l#bT?tLFvEJ
zqyM8Z@t;p};R@;Ri-~`~M?d<4-1I+z+S$H6uh+AFV}v@OtY|k5`~*~Jkix=$uY(J}
z`2S4pObKh!cj?J2>VixAwh5L$p=b~+Xa31f$G*g0$V-XeSAO?!`t>F)CF-w6`U}6*
zA5)0m)eVj`PomjL*WqCIpVQyv?_S&8lU<d`c6D`hVcY9MdtO&nRn8mfp4S6h7r~A+
z4s@(1i&8=AS=m4IW!ggu`&#OKYD;PVqTkX!k)>}-(|(`lJ=Zdt_N7duzcZzzg!X1l
zU$=A8y>FL2ZoykVD!rff1*7W$U0-OfTbbV-I^fy&_0XaTPhYX)y+5XXt<U%s?IrbF
zvSH|!Df`Gkv&ZUWlJ)X*?8SJ(8Hv8WOZQS3*U0qhDYW0|0$K)r8|+yYeE6oLf~8bt
z_S1Z&jq4NXnnCQ#N%XG}ukc|n#}^W`KP}0ak`BK4IPIy4y|;+}we=)x@VY6NwVW8t
zr#zbY?eXbvZ5wU%Z66zKTzzw3_M66DQ`kf6Ws>!C-edd5tLMz$MfMNflG%qnH5bs{
zTokvBdJowH&K|NR9`^O7pTZlFPTXY{Od|kJ&ZpW_vqyQjhj8hZ^G2mV{BGL+G#K57
zN6RMaGU<O`NwAUZ@Bh{NKY3{b?a7rsD!p|~I#`=1*>(;U^sUPiedkPBAJpi4+ePt_
zbCN^*ZhqhF%L_Twe%@Gm@TJm0+Pjvn8Cwrt|CsEBYtErNMf;t~b)5f>_FR>7w_G8g
zVf!&LwqH2D&)B|TjI})=+e=D=tqo+m*a?|YyTd(}jeP8fs^YM#B$zAb)V)XhbA|D%
zON7_3pDykPt&1M>{oPcykoWgZv1RDKDe3QsjE0h6&TlBrh3HbWH?7D(Iv}kO56JpC
z@gJ$QNBWGR`>}-XA=>Mg_9z~+W#LKb{pnyzEPiNF$<qg~S9>$x5^TJj?oZm2dCT8X
z`QFR-CuB|?6;!v-eTMs|mFk7D2Nyg;_kC9#?Ww$r_N1fwF1L^BLfWq#@w|`j)d8X<
z9x9`>&mq}E_0LA^UH9)_O%Hu7k^UCaW>+#@16idcvytQ_XpdW)PU)H!Du+AiUcz}p
zV%s@4(mr%8wD0VVe+Y*9sC=xaGQVBji;vNLE%)KU>lY4D9L>E3{zHor6yKwU-k2Ti
zfBlN1X+P@Hp@Ve&118SFmO+v;NcB-mkgmCJ!?{D-gJ51mu<e|dQlw|!IlHJ%qdI5e
znjPt(m#z$6qw7omj_MG^DJV&Q>sQI3hF;GmzO*p-CM{jP^m(dNc5<Dvi|UluZwZEo
zcK_pqp*}Hjyd~H;&=frVGGvgAFVi{F#9rh0zr)5K>7>(R;Fh1AUCL#;VRYX)EtEEh
zgVakj$C%Qhj`p>_VCdlWiz(je{gei|^w4RtFEg6x!ZblWjk*u@+|Fc@_5n_ALE0c)
zz=!&D`RK4dMOvUf{nhkf<6KIMUDJaavTfoclm@}kHg4EQyYv|BjaxFb>*#>wo|sp!
z?vk`1881;CTQEJQb9x+W)5n({u-}&+`!eU7G>N3g4{%Q$MP*~ODH}^U9oCZ^<P*{W
zb|M|{tU7eOSw3O-d@I6E$QL{BGi8|V`++LIx7hN#pUUsP%+ZuzrDW$AW2eopgvl>F
zU$IBBlx4E>J3pU9_eo57?tLLWH06V~Jde3PTArsY3cfjw%JWIbroWZqyey}D+{fja
zmSd;#e4;6{gSP}v@1*pR@_Zl8xvUQ+KQzCE?&pDI#ys=g@=WE$Jbyk@7JTQ^<AeR{
zsXXian`+AQg%s~P+Na%?>HR3vw>V{*)9LpsM-yFsI{i82C(@>Tk}cP-Q@KW)2Wf`%
zlC+XCelwNvH;5i>21>uBySR+cS7rS7RL0YsF8heKj?(6hTp6ECWjx$3K9@dJcBWi2
z&y?|D)5s}1zBEEyr0lq9^!t@uj@&d#+OqWe6{D#P9c{`G>VBldb}EZVBjh8}2I&I3
zkv1svC`(fA->mJ>CAQnT`vS^ewmF%XuhdQnpZBPnkVmL1<+)AgxwZ_hp}h+X|3iyL
z(S3dF(1A-P3?2MIa^udUgRMh!uYdW@nxWmvzT3Z)JZayn$zbDGZ+ZK^({G|U9$T{Y
zm_0B3=9Ni_t+$mVHva3B<krh5eOk!gEnhUtkM~nEd*c`B8CpVZRZgRg_kZKup~0`7
zGnA%w*ueieXDjRgkHiu8_JK?4sqVRio=u~2b@9q<d$y~!DOla!-I;A_UC~NA2r`yw
zqA}nrJG$1U%v(cXUm@}+`K`hsJS!ChA85a(z2n+;%bGf^ne6%h?vIrMZ^6AF@wz&h
z(*y6taKL7oP`JL^3_4FUW<E8@9)V`>!RFj{g5ae(-Z+s9`gM$*TtWfQzJGV|zJELQ
zzJD)<`~E%3{M7wmTs0kcaM<X}vuA7~owKO+7`-tf;!z44$kpLcJAOj#xKk$Flel}-
zSlTsmLhbkfS`m*5rqeoW88bIhzE0UD5$sx}*^6-<^F3j8+Wj_7+Ko+w#I?u3zQH2x
zlf58EK_)ra{0j3*+5_9?U`V@h2|AG5g9GJ9z3l19dv1<RJV7~8Z+Bp{*<f}Zs%5^3
zkXbvvzl1h$Oy@Rm9Cy$7yC;lIyf|(OUEtjtEi=kMAM;M|^3vvymiq<G{Q~PodECbQ
zcTt#hchWwjxjjqACTQ!$PO}fG;eft9OkZyG4U{a4*=%yxxG8ioZ@0-b@mFwP(2Q9A
z@po{seI;MQPmB#n=N^{v0ENlszLID{-#Tsz!78PZXZJIo<Soj@HnGRbQe`OI&J+1g
z?-<6Ja;wTW<c?y2A{W?X4>r@mDu^!4*Z_r*_X(Q;cX2VM@=p-OgKt~vwz2($@T=%Q
zoBjyTp+7nohI76>2rq)M0Y}bZP6iUA@WN?^K8jl@^dZx6;|+ZjxAacOB7tw1Z^lvF
z((`~KrDLa|kK&e|-W(nGcZNQSTY4TaqIm8%^ikZ>ODz^M++^sZxTWU-0U>#CwV{vV
zmfj?uq7H(~41E;0^ksRpI9Y5+qqwC<GcMnuFV;5i@^PFcgJ_2~`hEisZt11Q#F=%k
z8T+F+t|s$VS+ev$G4v<d6X%!=-tHhl@B>31#X*?NTdm2me#OwgBO=Gra|g7#dcC2K
z;+B4jqO`$gLm$O0{nQBk`we{*xAfB^^yiuMkK&g8v<Ur4hCYg0`gcX>6NWyDTl&)@
z^t+AyQQXqMJ3{}gp^xI0{yh=;?-}|iZs{u`^tT)OC~oOdgXX){hCYgeDw(%xmF4@8
zp-1f-b;*DSP^n8782Ts<66)$wlr~sn(m#q@`m-YR#~b=6e!%F(6FlmCdky~5(DMKg
zhb5V}ik7|jkA|KHEGYVi4Zc7jVK5mi3Qst6o1u^59R{zB&@VGMMn&Yi1qL^*(Yy=a
zH26h%7*77u;O~#%f04u<IdotrPrf<yh$>6SnQGJ1qeAcTBPsqNdPJ2a!snXQfYS_4
z2X>|{PvJA@k!iA0F0em22Cs_2Yk+f`O^f<Asr1QDQj~o7Ju&jnpvFg8B7C08lkdkS
zedH{Be_2mPlqJIFo#fDuV(j_r82n`;C$v;Feaz?$pLfk1>7SDQWf-W#?g{ph<7J8P
zxhD4PGVzjJvfnqs(qZuMc_b8HH+cBm5&Q!b)v`qReA&Z#&x=XV_tJG=eqH`H$O)f2
z=3RkkpC$QWDzI?!_Kd}zVYNA+oI^h=g`DttWZoO-8rs!9Iggw2JT)iByeH7vg_PiB
ziRn4qybsXXA|wB_9B$hAbXG?8lqKGk!yn)f#x9m6!si7QKjSVV+-J|{&HWfYFJ>@3
zJ_?s5!smjNhkqpcX^9G<%C%@uHh5Uii{9r+@3cf%p9_9}Oga1qD*DGI<Sq}_M!nhK
z3vznvIP@LzeewFb$*=Px^xudnCm*AH(R(6_e5_4bW;YHtvc&!!G393p+370}fyv)!
zzW;qpzHf-h_bX!Z{qC52mz=_y?3d+IBM6po82D0!w{RG1qn|_JEBL&PeXNbH@mm>(
z9NcT-`Z)mn0|Ju&sKPH-_=^e`oq*(if}CZFUhY>H*Lx}bxuTb##7oX4KP6s*pUeTs
z*LJ2D7dezo#?4?~<Op8QIOwU!<eZf7cRP49Q(*1#OLNrW7!Al-sBkJi#zC*frM?8c
zZbeAEK(BFar<OA_M!qgrf59~H=5yG!Q{wB|nPz&V^M^RBJ;*_MlN!p+FTo{Vh4M>k
zC^x?Z*Xe-#lDb9gm;4gEfsJ+ZOP-9d{{p6gC;5VO(74zG`dURV_JCgFlKyTw<GBMD
zm(HNq`7Sa+ukov_7_)bvwzGk8*M6xVkp8+n^e8!^3sA3;qw!l6y)K9A6}`qcG4ATU
zOUcpk8c=dH{-Bbh%VDXKqtij(cN&-cb@Nfmr<;$Gzo6H0^nIss$#*xt`o7cjQf}S+
zO2@=^iHa}oyQO?y&pza6T*?XTS;;i;B>i3dex?E5qUc{$xURRQoPb`}!~Ke0KQ9Ip
zzJkN>wBD-~{wRlCd!CBHpJg2Rbq$3l@c9euBYiY3YjZ>XGNys2pKCh4)l36={oIta
za?@eGqF=>fcsl)cIt(g$oeqyETyz229)s^-+)W2bA2%IJDL!y+I_UI?O9yR#+DNf-
zwEa>(Az$0ypy)L&Vb}gPrg!b%tmJ4r*DG9?&jE$&^7(+mb-Z*r)bWZdhc7BQ5*I)_
z8F%CL3gd3PQZe}=?-@u>9bc)df$Q?w%kqKibkOOh%cs5{bvo#BsMBG)lCR_YLJThH
z<EFz-rgzgp`UznFGNys2(<d$+wEemqYWo{lCgf}TJ7e%3#$Ee+8F%g1>8b5x@&N6V
zZaE=;0*7Ib##4-gUfWr!=ym!qY~*YDI9$>P@xpUNWG!U|#7pB6U)Z@;gp#l8H(z{d
zT$$M`RN^T<@Fpc^GKYa*tMHV<uT*%s!Y@&Hg~BC{faWXw&o~S(&0*;MAcwUF{CWb!
zZt;h+U(yP4QaF$UeZ~gOQQP0B@Hb<BgOa1|>{7T+XDQpboMIZ-xsJo|w4Av7x>(Vt
zI1D)-QMiupk;*SEzZg5$D0}`p?bPp&C$kOMJAr;VC;1MXx^Qw%>UrSQWs-C9d<1@U
z4h@1n4g;qykeu7bA>ha4Q0iw>xalh9b7>EN{y0TnP3LgHkGDZ{tW)?23hz_+B!%Cv
z@RJn&tis=+aP(WkLGLLxXpRRIK1Jcu*9iKl3a?Ap6X4SoeyhU6UcMlBLgDXH^m`S4
zy27hD^B`Z|iE&xxiU5C)qJKcqpQ-RC6fR@^ahb-Q83#GDZO|M`M}_ztg`ceOc?z#k
zc#XnkZ5YVc{Yd$%PA-|>-QL;N+TOFGzUc#%^Ew;5yE7fjug*60WV&0g%T}(U<zTN1
z^0xyic0tEE&HyzmDO}`orgPm<aKuZ?UD9?Rm9x8OBahZqSv#Ai`r4L8v#m#-;P`Dp
zs%B?0dNxjOm|ZokVw{awIE<j`Oh$|}BlMz@WTnD*A(eBOwWGbc6{{-GTb1qZZd_>$
zDT2L1*qgIH&iKtys`E`A(QY7BI{m`!Bb<y0FU0K_<JwSgmHK?eATP2w#b$b~S>`&g
z=)|TOZDbLX;Z}-dSFC_aH^L)OPHSwcDP+Yetjc7XJ2G6PLZ+Z`c}Ewm=N-4Ow_4^h
zbLDUw^h9s)#g*N`tmWO^v_$I#mmdbJ$qKXX<?xz4^+VCBV|cMrCg$g5x`J6NyE;~P
z1{qW_?Hy{N^J`ZPzq)Ca-2sL~wYIPHZvaEffYvm&wb7EMJsn+UOQgAtot@eCW-Po-
z;%NsZT7Nmy)N)M*i!c+=)Z3WpT-}w;tZD7)S&h}Q-9@bP3UGXF6MGv}&2G-FXk6Xa
zW9!sRlT=4o0$R#-yj-_n4=e7?+M289WOeGo_Ql`1has#o@21iM3LD}kRAoi>!>e1@
z(BihVHI-TGmJm}0n>w1al=y4p;fyEnDq7W>i^Iy*ja|(dO3Ey)KAwj)Hj%`xEZ2<T
z%H4U%9$Q6KRb(<fEnOYg<~<`9w^Gq8wyw>usc7}xRvR&=@<VAaa4+c^j~1{VMoy8B
zfrx2Xl2<4Ah;8x-h%AzBlHOU%cbMgrWAD<Km2HO;75m5%SyE<WOGG5iVzS|g<RzD}
z;?v5#p(I)(kdXIaC4Nbf;;Xy7yO@*5ZPy)+Vfx`M{9;}4`Q;YTk!4hb`*3fym||n=
zhQoSn7F@|&HJIY7k2ht&;U<Qgs&C4O0=od@r@|4{d|1(!Ef8#+b?pn=-b_hwUO?#4
z10As&Rz_4+M7OKF__7MOwKm+k-?Pms-;ou+XUDJgO-qQ&THmy>fvL8dx_j)J-#9kU
zGKXrjxOdE&-!bca&-SnIJ=?#w_iWFq-eM6oXDesXbu#vku)KEzb#8H2i0ZwdHBoo~
zLA`Vc@>S~2$a4pY8QADNH0%#{;N18s!LKO5&)q9R9^pTe6#MkoGKXV+g#T3P#Pjh>
z|NYrH%{JiLvy3_oef<5*C;h}C#^pabhJTP5<U39r|0Lpv%(M`&-_M<R@|_ZW#Y7re
z8wKCReD*&9klZ-y<&LiXw1$9J|K^lsk^WfdM?Y$*g>&OZHdALQRFyF<-VWBE5`cZl
zPx1dLCja*^e~ZKK+W+^&?@Pb!tXT39_9HD^`)?);s@(FwjQcg~=$dw}{u}6`Pye#1
zmTM0)LqA5vy88cxFrWSb)?X<9o+Eyr{<>*&fn0_40_aDYyZUd5N&ov<e>3xo=f?jd
zG3npS`gQuFjJW!rr_Ov|{AJJUCqyy(uKphpKd`hzS32DS+aa7B;y;o8uKo)M^XY$<
zE7dx>uAQrYAzk$8-!a2->HI&DAXop-Nx4tI^jEw3-1F8L{uC1ys=o$f_~#eNe+d<8
zpZ)dBFY%W&bnSm1@dHZ>0sGtd<AW|g_zvQxUp)<q^XX4hxqy>#nfA=;k}&*>h~KBb
z{+*Ue>__>*_ZC<G3k3M|FXakF#?@G9QT@*lzfXVqU6w=F|9B+0`X7yX{x#!aK~BC)
z+q0<thl$^(zpmVJ3^F6)Kb8Kj{zX(l`Qk5x<+!LEbZK`k@%!}eVf{M&aZ9`U&mq94
zzZ?%Max!kjo<-x2g{*w~cb;xJbo!%6y86eB_3K|kINSr)%N^bLA5C;V{kzVvEQ8F6
z^hc3!^`DyX>p#HyU48EPNyP8d-_IZIr2c?@B#Ep4(=qKo`M5fRc(il%f0Fop`UhEm
z1v5iGAXoqIshs=re+HFnxI)j*-x0r0{|lb@<9ns6e>&AO`n#}EN{0uyK_v9BAK%?2
z{^D<!^rL*xu7d3sI=SYa$LW8B^-KJrALB`cU;Gne^j8<D|2WRSz_EXiC;h5Ozodth
zt2q0g@Yvt$vHxi)|Bn9oMcV%q@tL%6_)BM!GIC-k(huL0UHehZ`^w+htbc&6YbWV0
z7<hrD1z<nL`WyHh`tjY`)qlnWs~>5r-HWWhRf80UJ~;93BjpHFHs-lHE;yo3F1qJ;
z5x>v=K2Q2#)}ruBx^AO-+NZys_1B4F_Jv>I?-IXH|7O-d$b?8gybB7y=zo!zfw}SD
zTx9&;Mf^Vdi{+n2{672BJUBw^g#G7v>|Y&|egj3OUuR7EEo1#U{T6uiH^!vjt|HU#
z7xbL+rJwMZlTPg<{{;J4%=0stWhv^I5b0M-f8m#Oy)Q=p1Zo$;3BNrH`Q`ks82xpu
ze~<~G|9twp`q$BY>WlxfBK2QO{J!$D$D<!{arKuGvu|zN0oKpv=RDY|-5Br_AkS&J
zCj9pbz`pQ{|2REAC9Fx$qxS-zb7^<;^WUkygEaGZB5{<H_zU!}G0*?aXIhF!STOSM
z{qz@pDL*ZA|G2uri8aIFw()%cyDz4{%TM16vyIJI)z-Q~Yui><&aS97qzz+lT)gD`
zL`j$;CBehqwA_^<#q83?Pt(||5?U)&)-X-)ZwZ2j)S9K6qU(lXecRx{my=Vrkcds&
z=y8a3C1oA4ZM2r=wnX2hWQ|$V5;Q&;J89j^;`yz8sd08~OnU!$E!cMN9b)I9q+N^i
zx9<q{AEb5HWUVo*D^?n$_fI)0c<pPne(Kfl+wh|?2QPf)>f;~$&A%V@{BJ&9y7M=u
z-|+W${`+~KzkSPXkNoEJgBLwhK6UJ!zxrY@g!OP=rax@N`nmVnDJPpq-gl-P7koH4
zbZDu&HW}8;{4K3FN%rK{Cev}JJU46f(Kx|=Stqt3L2LP%^==>ct`iGdSxXhRKnD5v
zZ=|ux`*9ukf2#FRb=o&j{zy7${NVN9qqX8nX#Ki`S-*DTvkQi>F5JC|6LwSnF6|?`
zAh(a!AcenaVXzU`7ErubUzr}FvOe*lX~D+tCr;cwK=cDl|Df^vZoi4Hfp6y@4n4G<
zFsx%(ItFFuyyvj?Ys2{T{st-o4P}9m-#|3ma6UTNzxR@bWZME-=j{iBBx9mJNBKH<
z{i8!~(0Zb;Uy&gDlg9orsf9y(X}vwff!5*Ma$ZU4?k`ZDl`jZ3&iON1kC^nlhh#x7
z&1HY`@`JUXrar@s7ad&p%!Z?ahv@z8$yax;`_?fB7d>-h$=Kaj-}Lc2rj(4^T^ju1
z_A4sa-|;-zw(~#NJwx`;8nnTdhOaCzX|Rj#gR#e*xS{m8NgFOAUFXqy&L1FsX-bos
z3xcOpB`=-*AIY&>-bdkICC6>Km#z<#+<W#^N=Mjo_18;=XdPt}_q~@aqIfT)xTW_W
zy#5J}dp?Hv!v<d(j2lQ(8U&OEC8VcxcOS+7(;p4?-9~A;fa2aqY5ZA==a2ue=+lD~
z_b~@=c&4>9c<Ar`u<)6G|Md;uLYkG|wEm8l5@UCd2@c#osq$ks-oLpa7w^6*oA-$K
zn75s<VeH!`ZP-og<$i+V)lIq@Mg>c^P7R*^eq+gN%Srz(it|aN`;#T5PyS=ciBG<C
zQ;@@{>`vTD={<quY&|O2`1Swz$nF31+6~XFFFE$f)9HWg!r<xKDBboX$8WjmrW?23
zc2n^5gtFkZmv1_6>#r%?NNM=}lJUC-NYA)WU_I$z_smbwI;(^ut{<Bf41FByI&)pq
zNM$m`>+8B{9j2?ZP9m=t9lR2BG*CSk1i{vzG=FVneUBec_04ZlR(Ks+ca6pTd)?ey
z)E#O4om8(v*4|4>OqoVmo=DfIq9l2C&D+pFe#_oVaF0B0$_ebZ&ycguy1JvaJ%wRU
z+2%m7<}3|}Y7x|oPod{crrR!<*p%t)=}OUnCHhFUx(P!lg_7bM1aHB$`DT#W@@zI^
z%+*?6W9!1T>dJ{OO@Fvra~QAI1{-^oS_;psMb~C1nJ0e@J6ZuRRYyyBnf1${e>2mj
z;4A(0qMl&r-$s8p(??f3K5do;<AuR!Wwtcd1%pt~zG^6gz}QhhzsxzG2_B_?Y|en%
zW72eq>MG+N#j$pL1?jJlW$Er2d-u4piQC3asW9uq{rEW;qR+rW|65tcDEJfyTB<Fw
zv>mOAm*%zFo`;yR&iQ;|eTwBQi<gs}S>iAfAJV&&9!hZ4IOL^Gn2i;5se<XCFQ0Dg
zQk93f-~=LTW}Z^;kOS81U`XfN7)w()sN=Gf*kp3Efh9isv!CK>fG9!^`i&5tO8;r}
zAI|yKcC*W}xNojjN-}SjgvEB5NN~rvqb!*>d%|A)siCI^vd1OO*TDP>*yk^Qwncb7
zDIJ0#6#UT8b4P{35lrT-PGB#7+tB-8Op+!=^M!ob&?BXzE*be^83cD2dTzKoEJ^eA
zC?EWkp{Hux<9utW-D>FZ6)5VGxmqi{cEHd}Z5HAP`PN4JxuFl&sL>qBz|@8s3b3zZ
z;K6|=%}%5Uh3+Xse`*M*P|}oQ1yJxYLyyuOb;-P0C-(XShJJdKn2@Bo)AKLgYv@q}
zL|rmKZ+*T)BRcTlK$B+YO@u=CF+=~(5a7^v4PG9>w;2442>v+L4SJ0!$qD4FuXN6&
zN<ptNg?bjQgl=6QecT!{|6t^V_ix%rq4&@jIlrXqdab7v)Bi;b{YezxvP5|Qn&%kt
zbd2)bxjzP<7$g5ElWyVtZk~N4|F#(VDyj;n*#+&4<>vWEq23sJ^hZuhgyl1BxPk!t
z_4(5ICSy-nKbYqx@mxXa?4zePw->*IczpDy#pp#zlX+ZhqVfJObw2Agugo);u8fBq
zvek7L#-#sOsEFt_vdlA>n8|#voxd~b5Y|iPxl6RQ1`q2W^PDAofw5Cceb@&w&*%;7
z6Lb3zJ?#lW_Jq$h;ruIuN7Mf}ikDs!N$k1F&`0eN%Q1&n->sqtxRf0-CpTvnbA+i6
zBInNL5atMLJk2=d(7R{OX}#RNWUh(5B43^;l71pzaMA0^AIF-2SLU<^!Bq;Mt?(9w
ziw%G_D_qZ^6Zx?7G^T+kWf^vAT<it?bVZ-y@Tm@7!MH15Y;)yH`XIh~PG4HdnaW{!
zwH$^VjW1ywazrMedd6M*mnvMxcNycZos#};d>fP;oj%Qs!=4%r!;||1_Mq+(C;0-s
z8kc;596g6I#f*@Hax3@148|cx<EVe&AV-&Hp$C4BB{9dD90q=_!X@2+pQmsg-?YMS
z<1pwKD14B^SQ9|w>lFPWMZYVC-c)dO4f1OheJ6*3YdIBk4(Hl)w!+W1B<8qO;aa}j
z7q0xt%nMxZaX^y(ZhS{EJ@ADbhNtnx3Quu3PQDv2xffi$C$k*PjpZmBMB)fM$u#gJ
zJ%Jyk@Vht+JZz=VTw{e(_j=ClQFz$upcX6}0Xbo7f$~)0$L6HazIzJCJD4~bvj{oV
zN0oEq_*n{E&*`pK_@o>)ty7_J>I2KUbqdE=CUN}=#~7oW%VZiGyP8_&R%hCp8=ITw
zW6n}zFU>)?tf!_Y+qJ5-op!mv)ZXT{`r@Z^R(gAZF2n%xIpHPKA+&gLC5<?5?7_4q
zbQ@)RTYDChs$oaX&m)fR?vAER_v+=CkJppMtgls#*JR25#^$xf&pe%L)mBxs(1fjP
z8)*_BbyYR3?&`|6H;r6OHTuU$`LM>%&&}S;tZD3OZCu`#t*oFKgRLvpW@zGJ0roko
zR?{4lxvSf0hT=6Nj^|w4Sywz?Wlb)>FeS1rgCX!EV0W{7L=%}q-L~^E)4Hm2Bmy{d
zN5T>*pEOJ1k5ulB<Y7xnB=HK)!1ktCAudU#LUhrzF;l!T<*DF|WjkTFy|KNcyDgjT
zlsU-5%|H(0qD$UlS|1?CKKvBs;RMLk;ZCl0aO2W#+l~pu(HXu@9Z7RIQBOwZ`HC=m
zlVL|7y46<%0$-C|n`xr@sV9F%C`l@ImgsP$W!R~qbpP};E)QmPuU%z)I|KaiQlG?_
z8Iy&ly1C`IYED?qMXG!}96VLy;(EGZE4||9*o8SCRviCr$|JF+r&ai9^2R&*JbROI
z{o|^v>}hH3<_C6-xt}vDI=bux>A6ibJ-NMOe)H<CMttqLuowAf!WS-St6WU~3UQ0!
zf*HNDYA|=H(oD{x0|m{5EILroOusUdtg6f;t4ccd&N9KOY6L6I(FV<wDs!l`)2IxA
znL1TT#nw*XqB3EoOA)J?E>)3h4IOsi->A{4+oK|ACpX%T){RWM$jw6`3l>p>8W?qB
z<hgX-S$HDtZ$TcV_T6y&(w-K2m;Yhn2bLBB_UCisRo)x$-i3IU@^!)ANy>ftuVT7d
z_QiAcPbFrb{(9Emz>Lt3_PwkBhcWsGm@mz~c&`4(WAs1Z(U12CSN}_d`QpEm6{gr1
z&(;4Ey5NgHeUmm$(i!nbQF8SkPk>Lq0f}DTgN!gbxcbKvzfXTT>#t)*=*N4JtN&0;
z`riek$hBE7cXajtp6Gn~J6V4p%YlBpf4TZwh*`g9iK0jNz8l8?`0>su`o*6~g&HbG
z^LrAL=f3-aPdnig>|MlfFo%B+zvT5ZA>>S;zia>X#Ao!2K=$SR?@<SL^{*j*U}=Z0
zk2?aiek7@@|3RvFeERore5Bu3#Jl>xLHs`b6ZmDeju{bunB?jopqt94pT?XRC;i3t
zEX+SSzmxcV`j@f(1}21l-yEr5$E5!f?o6l_MeMur|M!^me}whx`xjw1{^!Q%?_>Qa
zv)Z}(Yhv{8VEyulL;TTO?dpGTO#VN@`h{L>aP`lP$$#0_Nyi`0B9SL}Wla8WD^mZ=
znEap2pF%|s;*YNZuKu|C;|Wjwf&Nd4zxXI0zWQT3+n=WE+6kXv=&Lsv<)d~LY=0et
zuzxE3UHkuo0O+q`I`K*=U*MKnFLwkjocM2$osh}5o4JO=Rm|_&>z=PAz{gKx?u-+A
z?OABQoImm=`IiyDZ;Y|%7d_%jyyg57@Y9LhCxQ$Ay#lZ={NkTW=_g@LdWhq%F@#;(
zFEhWB{kcv{86zxm-1HnEeu_en76SHrx%{-SLX;o$#S6dO7r!R{h;E|W!R5b&?k_lq
zIi3D4f6v;^Y-{_94jE-!XpHf^nyQp_#g8%8&ww=9fY=@li~hvNkQq}whqS?vYmPHZ
z+zhk&o4dN0^Ky@6ARLK@b&7kztq&kb=9?~dq`GAq=lHv~K-%GxQ#U0h&;{Q;9mntL
zN09~Q-qXTg=$=k7KY4i$ZGE3}_0K0F-#xXHnZ+*ffzG|BR`;~Fwf3x)TPjuPo~oHU
zf5i9Hc4c(h*p((b0KPSEsy-8kXsNy4;8e*uu8z)+Q{w<~$?+!dLFsB3uEVafrn5EM
zl)bjK+kAAeJymA)8tThvo+ZV@v3O*s5E4xdsyR8LA9cj#;?FqF@ju*qIL-X-eE=NJ
zr_Wxo#|fZWa;Ss6K8x7n0)3*wuDrN9K==>04%n%5>Y%H?P#w^~%-};lxpe?7J=oaQ
z)tIXU3e^F#t1FnK_~&XVKjUFa8V5QaM>&Ie9KWNv5HgQL=0MQ({g?;QKx4{VXbuO)
z#&4r0=9r-L$<t2>HlF_44Y!w;jM>maa|1}&rW-#J46RNE4-Wp}hGzzo!9xQ)=KuRN
z-o7Cb?7!KJ<v(Eyjmg<U@Aeb7y#A5f2S=xGKPDY)e3j-mj2Sm}L*Mw)iyLTc{xvrR
z8*e)<cn#z5GbJbN?jzn(nuAkK^8+3utd-|@{LajC_<_uOp*aoT9s2#slA(Q>1kHm;
z(m420W*q!US7Ba53C-&Ww!EG=X?L3D@|;+<@8O-v6Sw??<}$#3nvZnG&*>av=5c<A
z=z0?;Zg}J9d*7ZpI(V(_|J-{A?Sb~%&&ifw(cA@kzn-{{{NK|54f@mj?!+<sZ@m58
zH0S3Gnj`Qk&1qQmog0U)p*bD55#Pf%OuF;$Zy0+g<{Vr>;VC6!cJD;IO2#~S`mtj+
zobl20KEx5%5bxKMCv4d^?eQU`e_YxR(!3AYin$aoQTksoCU|fcrGNP`!9#CQ`tM9m
zGI6nSo3!P1irWCsm)V|}v;q86N>1Fp^XOpd(Af0;3CZK19He;<V<}B8Ix2YjZ8U#k
zX32yNJ4ycAO5V2NlT(AIk6lD_C<yy7&9iux@|EtriH}{^u#fhG+&FFRHT!lZlUo)9
zB^w^QZu-8)t3SMND&dV+SME!+et6$`L1On8|8QvO&q>~>pzroyB#+(la&pv`+LFYE
zdq)MYZA%7Ao2lG=lz3*03ZBj$`2OHm)-K<-kiy>&M(_Rt@jk)2{)TYq`cg1z!xN<I
z3kME8nA&s0Go<gEiK`p-^|dw_zS{oaPF$Z(X$ty(p}9k^lYYdzao?e(G<L<zwb*+}
zEtQ!?RCX3p8N$4XzZs;orMW{<Je=!c=anH3{?s3(sAJ(uuDdiSS$As5JH|~hZ6<j)
zcnTNw*!@yFa(^&4R^LoZFz=X4KufMOK?mBup0=T{m+}6eqpjpWFI%%GXC!DNd)bWs
zg?~0%v(u=37a}p}FZdGu;l|;h<{RJ?btl@6c)BBu>TE3ihjYGt$*WA|?Y2U#lw{-y
zNaK_Yz58SodR3{iA?1cXicdGViCLb>7|Uf>bjpK+Tj_LKBDB-w4`Cqpjmhke!O=B2
z&9m?7<Am#dW=&oa_5sMDzw6E?z=zi|A;$dZ{J2WtdW_9>h3nM7GZYSTG<}_g4X&s1
z?p3(fE9>;Qa%{d>`C3jr$}l;MP117O7>68fXQ?GO_UN%dD8FzR+e5#ctLG4K-9|&@
z0tY;=#p)Y`L(3=5HzPD?N#Nx)e8#jEGVR%GGqh&$%AS^m^VU?(!}m5C#Nhi-Ps<i}
zXKAVNw$}D*vR&`#=)^ZWS|Xem*ft-;i~QU>Um7bHu39{|D~sI;7Oz@W?8oA{E4$lT
zo3gU{B=Nbgx#pvDxL|Vht=D`-v@1NC&we;m*tC2z$MH`7h^!slCo)fGDqVC=gEV7q
zO#$5J!aLhuZ6nY3ZDSV`N*TmGh}uQ?#s3Ilu*v<lktPi8DeL8q!Y9C53K)#bz2JQu
zA-NBsA9Qjb$n)b-!i;`lWPcndl+-VB+139rT>zFA0`|AFez{+uACRj*F8%hhBAtE+
zi+=I(y~&q;>-eS>ej+nY_~ab+7|cn(PA)%^PLhAF{irW}??CHyr6I~dtHKB_VXVTz
zg}=}{(65=_VGpn_iO;$E@$Cqh6aAo^`L{VjB>n;)q5w$K0<gcH)31)tk$$MZg<sP3
zL{jeRHY{AZ_OZe6aR0dcW{_TcPtpA_RkNjYv-o!~?8z=JZ36ZkjDr32H*@~=Twr+@
zapwTz5y19l8k?GEuM#7y_`{!gw-53dPPbKoNnXpnID@d6AS8!y{#?u@x%rpKbJQ7J
zlt3BleDfnuF=fYpBl_BmNkh*Sm!m0}D|z9CKbWAD$PmZNoh_{)hLCOhNGgQaCK<iD
zbz`rg4XEeA2q(T5O-qD!nlvPA4*ew$D425)?`wO0n(*UP8?!veVFQ>Spo)I3?#287
zjf+mV&6Q$#XrrN?7AN#2giD-oP09&y-Ih!-BXHf;i)*`8FumJ$^AD7!rRpo^M{iBp
z8p(7L)?|B|vZnRr9j@x*R~yEJTg8}GlDoXVUw>Sy?=V|lH0-K*mKk*w9co46xQ^6N
zE0glC(9w6-?O|{l<)e1aY0yO%frTa9Qm3sKIgWCWT${kb(|oSW93Yn;cQmjx{k5CS
z_DlIfIR+#(fRx|ACd}6+9N>tGe(<B5i+=GhCd|a&c`z;^9Bzj7a!274;6e%*%;B%|
z*pD=J?Jp(e(C>b)?qmh1m$c((86Mz&Nq=Ch4v=x{*)L~bJkc-bH&Fogrv+eN_KvIL
zbEKcIP4IQXeQmM_n9udZe!+XePyY%5*cbjnZL+^%euq7{#8t!uE{ySJz?|$0>Y1?K
z5$vYlkLkKE{kD1X-`6I4)uS6KA7K40?88HSEc&JVuc7_#I=XUAvVz~nDsvy4i*J)j
zTwqrk2RgouQcc#hB7pjp-`f3rNKZ*qQ)j5YH9Y&O=?~{#vuOO$*H*IqS?(QcW%$;T
zILVX&-3qX@wjW1IL}<gYhF(9t?KRl$YvVjd_=J!>7iu;1p<WYr!bBt5AQA?Xgk3zY
z?Jyrq<RWc{{C<}B{cSMP-`)V!<zqe`($-V$7cN;|xp;9n3&8gO*bT!XQ&`@t@Q&3z
znT{2iuEzFoE5w3xKt|l5W5$A;q2Oi&w_91-WE}Ak?~}e#xS1<M+aDW>HN`4C4ZcfZ
zV29gw0N-%@Qr<+R`|Jg;ukM}C_Uro@@s#o@cvFo2C9JTJ{tw0Im;O@G139>hT>U!;
z^F2G45$<zt`u~uKfVss%_zOKdcQQYDdG3w8v+%^#|2w(_jFUS@xQ|2iIm8Ae{sQlz
zfG_`KPN&2R>F0a)9Zkwz-H=_!hC)6ZPVrtV`Xyi1WV@DkP_<z;nWRT(p>N7nRr7eT
zR`JiyoniGEq{#+6JI9elhkkI>(+96Ve&|4EB7IXkfxg3@ICSs_qc-kJ1{?Q|?z{bj
zlElVc(-Rvf?s@4qC%znPe3;fdq;HU0DGvR=`1F{ehb}wMtR?vH2hSb4FL~qEmp7CS
zeSy|!{N<fvhhC<2(f%zH?Em?(C0k#al-T;OQ<7WnOP;&6w1n0`du-H3GGY_>2d0-i
z4gN3upyX*IgZS>d<?OAvK5)wik&T<^-%tOI_WS6RGk|@8u2GuyPbECfYrQe;rnc7Q
zP49kpa9a0UWZ=vMG8|6#qm<LRl#v&3v3C5P1bx5@7uy<p*SLGe-z~f#@j2hKKVizI
zuhvCftO^SY{7>UY@n0D{+FSFA!O>FBcesb9sqsA~UWC0we_uTAj=|B7;iG>j2ERE5
z$2cUPoR7!gOJeZ(gu~(6gWTUZ@4<oGd<S1=Ve@TDr_x;t*Da?nDO~rH3^I;>8=af?
zGmd^6jX$E~ATPvi<ABJK9DRaukt6t1jH8XE`+0UK9Pb(8p5*}Oi}@B;>{qHPnr4oB
zy|a^AV5%C$ZkgBlzpzC<tvSsgnkCxSu`=kOEoR|2wNc%Sz?#NxyYF|fW(5aq12Ojr
ztg*ehtD}`xTFmy?%3O95rg@(E^F3)w>-p%NF*EAST)Jo%%@O%l_D_`VI{zg<Ucdv7
z9G+d;Ij3g*YG8k?ww2ufVgs8cr{<XnES*DaK)#jWzJkL&fq2TjHyI$g-_jo>ZokH4
z=F|5W=o!xW9|YzZ@8<Srffr8r?O709%2<T}><fRPw$U}r@304txr&&;g}=u92}i(o
zCQLiHq@TcFp@1*_w{b>EIwSp2j|sov&lBeACMY+LtB>t~=W838Hj&&$#k7s8t4BQE
zZoMkpX&6VPEo>W=4IQ{M*uPJ=k8T;Yk>Y9EKWOjZ+Yj11#Mn>&jcD_rjnr7ucPZLF
z)2MAC?H{y#CQ{qy7re&n@2HK1w$`txjdcRrSk&H{NA0Xf7L{y7I|^&Sq8;_^E6y8w
zBxBoHXhV^nO=*(<GRwjBfhOW3nlId<+EK}KY&+^$YIDW4qv#r?|1j;S#^tSNr2^Zg
zqVQX!StZZ)xHgrULx(oiGG|cKT@&spyL%!fSG@DJseWO|eYGv>rfAy<b#wk#6$1o+
zZ#;R@S`5d(F+ts0u-DLL(ETYgH*g!_k_ML29vfruWij}c82sWG{Mr~C>qYtOnHz&I
zj=_;KJ~`6A<F>&nh#pSbHufy+OOv*Z;7d8+w%HmOM;k`xLR_0|P|>4)6t|rNkfYmR
zI~1<lRMK`5`-SHPrWgAKe?`gBZLn7v7dbo?DcIx45qzJLquXo;6rPt46dyRmOMeTI
zd_n&jlUPFU0H`C_JX>*XS1YaUQG6>cTt*}Bxf87DT-`(ax&IF};vS&X^3^H>T&3)?
zshK<Gr7@v6$6r0>3~kyRqX&Mp=PrDfLc{S(eIpDmKVI~KrG<cf`8K$j4aPm<Yr~=Z
zgT!sa)iU2nEKfX!4G%DsXI~rcFN9DS*>_>wi@+)zI^i$WhI=RTJM6&$R}mAq@G9ny
zw4)eEJA$cglIL3J%$NS_x%^05Ev^ms2=PaB6P9LBz7fH0UmNbss;cUga@;^Ohz;B0
z+-gf!RZ+ncr;6|2nyd<4n(RPnJC<@ye-DZa|EZ4$M{J~?)omH%o8+CT`_;E1;MHIx
z=et&KFGa2~?Dc$Y9(;H7*G~R6&kjS+1<!=TgKs_ZC(Y$(Tj*~M?!LXz`qKuNCt)ai
z8U@Q#Eh-c!vy!$Ubr1{~`p{0H&l)_mM{v34@a)r8jTDc2R?cVR+;3FURskMbOT_Mi
zfjoaMe8OciO}&j~h;mb7Hw`#$>R7cZ+wK{8>~xRlk77myE!Y(^*4cgXMp!Wf$IMi2
zjyzncb0qxQ#DiFl%<y58lHa7G@0mKEL41$b4&_8Uv~PeN?lTqnJRHB2E77T{Hv>(g
zqpwaM<T_dE1+@Qs&(u2z_vv3^r02Iw0lE4=!&n*@mD}dgk8&yZf!LKH%%^`D%PJKA
zD~Zk*{}(*^eb1z`px@K4)6Du^54LJoNhiQ6G)Q6LFVrS@AM-oxfgO+NqE?qiH!wd(
zH+Ko+c;N8N*G|%3u)m~$Fa7qgz&a*G`9WR?zvSO{2y=CVrIYnbzZ_0|{X%C}RnJyU
zf`a2kX4lM~Yw3$`6QtBjS{lX$>EI;FHPsI2ClJlkym2FPoow%?c$<B^reGhklD<2p
z(wsL-|CpJ}c(}B#9FiGvvfOKH`^vY(S1fss#<fu<B8Ek_QDzWnJ*UV_hmUr6nNT}E
zFgvS&uD1xfa-tbvI`fQGcF^eKoIECp^?Yrh*G!rBJx%;=pr0E0yr*?epRWz{f}s!F
z964eN`1WLZ#?Y(6uNZuLvizf=N9#Y|{lMV5C&FHT#NfI|z~X;pa6B2K&bRl<*A0DH
zgxK~?o6?eZ?R$n^dMCn5QwjHtb;h^|DU%^J-RwkPmI%|+lrJLq5&e%-U#Fzb+Z`hZ
zb)DWjL*#tJ$O+R;<h;+&hv_VBz1t0am~KKZKKg5PKMv|+IQ08yT;hs0s7_Up1N?Z)
zYL0@Vzw88si+t%Pl1n0A`kMroc%aVLa#BnHy*k&lUU{B?RO=;{oYQ(WuJvj;Ddrqb
z@7r_IL%pzH<D%D<BdjGvukF#et_{RaxBqKCGZfpVU#IB9(i_gjg`B**UbnZeTv9c^
zIlGF+htbT!l^J=qWHT-F)v_(y<*cc^q^d?yuWrxw((Z9R+2)Wu<^?16HNvcLYhD;I
z8IrZ~8-f`gZ(m3vhDAxD*3c5cvLbNzwVm^6rj36+V7Di5c}G`|d|ZmWf#jtg4cMQ9
z&$`O?`t#SUaaM&Ts@b5*MZ!;04Vo|(mPozuG|#f1gw2|&c8%3=Nma9$YRstqBl5{O
zIFrheF27Q)%em0K?i70GG-xLVV2Ar|1is<;-6sRuvD$&x*S3}UnRQHzI>YyFR86=~
z|5E0YdWugY??z|R1)u&3e&kDC1>g5>^hr|g)8D`fXR<Gz8~=|Hvrm5=>+fYo=tq`H
zeJple9i#s?<}0K>8>4@lN5Ajg0R6i3i<F;7SijV#d>Tpr^J4VR=K`toA5UX9{zHU8
zzk3h7zzT()Pjmco{v`_d(!Y=OOFF|xD?#K5{uE(8{W}SV6MB0VJ^vwH@af;|(T`S~
z$P@jaV9bsGE><Y?e468z^PiLPu)j(G_Jx0(gM$`M{2LJVyqoVeRMCU*$(0`P)4xIh
z_JzODyE(?jxiTT*(>{=J7oNoY?)&j(Cfv^Ui07tf8PWOj?*Y!gUS>pop<N~Xl7DE=
zxw^s9z~FlJVGi1fF8`TTbLWlZ-Mp$|&WPX5*CT@L(#B6yTQ=_9JpWyr$ouKf@9p-Q
zwACaoMx;Kx1?SPuAp0dxO`R9>&RR}%X^!h~bW9TK`QB}9;dW~RE5bLX;lIo!uIL?2
zzIWT#4UKNiTBg^Gm)Dv#$gAcUzC&5+AXrWT-M=r-2-HDRHiQ;F%6*x6`dU=zrTpOC
zN5?|yEWG<@Tx8=N!PoEqX61-o?z=;+HQO_1#VjhK+pea~y^>m-E89AjH@0<WR^;{f
z)5aULgAKtTp&f^4p%7Yb#9e;G{cfP-1+%#M&T`hw%3OKn#g#NCrm44=MhmT}q`iPH
zSaQk21xqrSi!<23hAmmVW^rW&jh^Jw!&qTNJ`v>RxgM!c1TRwh`bvEtgUAo<oKth#
z0OKk<N1D!s@&l?mG#9R-<8b^^E<}pUe+69tmKFl`w{hKH$LDB&AWBm1rM^LV_vwdS
zaE0{aj`ry<<@D3~aX-2G<r(hgK`)e(OPOPM5Pm@}pn$Ipu~`TlA92<0bUFc6p+O1@
zf1x(S_n6;dH{-)y4Ck)?A2G(+m19941zd~uaz{7*|3FuK>0i$YD)B=8``W;-5bo-R
zvH{kgVjrHb4Ucb&D_7GNUOXkV&^Q0;nhN{zKUIAH{-EmoO2arR?PZjb2d{s0=nYyY
z@%1YbG@m7D))g#0@KPzIS@rK|?Z8S}D~{Le=qD!Aj!2IV=3F~EUGqjzI*-<f{_p^;
zZ<ju??^3$HiPpS7gUb6voUb08#-|TpTfU!|cun6?!O|AuTTgsbjtV}!vm{u09MMug
zSpP$bU?a89`ky1ewB*#PowQEi%d~DGt;1LY8Q`lsbgbcPr1b@18`T#RuQ+h*+&UUF
zI*0x}ql51-eQ0Y*Fo$HFvG<ZiG-qca#WlVE;Pp?)+KPsbvUwuuFk#B0{;3>K!Jyw=
zPqLcyAzdaOFuN@0^ie^WBYYJ98nVgQPi0}wL&1c(at$&Y2-|zfLRzO1Hs#iPG_nvk
zp^dW-YpU$Mq{QTzn@8G?9<t*`N*nqcTlz@vgN`j}V++;?d^|60im}6XMwt?f-lWy7
zUHN-NF_xm8rA)tAsw+#I)OEM6$);M{TYFj?+gh(P+wIU;+0=^0*0yYOs;46*Y-Z26
z{7dwN#jaB+dr9l(EBWNhyE+=1&6j&kYKE=-sede*K!pHKe<!M@b9wfZqf)6IpRU(a
zoy<h1v59BLO-a{}51x7U$Im^FRSqkNw4VNOn{e=~i&*EZi#U_WZUrs5^*GdyPt}b(
zC53en?-_k}>DWXquSfH&T}Tl$G0xj&HWjD)<gx;MZRS@I-@I03sLa=9e%a7R+sxqd
zeGhuh&_~<SmR`47t=^{%eH6F!(YE(fhCYh_tHJSv$#?%^@aXrW-9)C_@TMFPb{qYr
z%xFm+G5Gsq@VIfwSWnLP{pbfIN53PO@<kX@-e(WqHOkCY3Xn5pi~MqPX2&1vTthj8
z!#jn>QKsSWPNDTIv2bL3Z9@z$WgPDyI`_pc=+!vV84mQ?o_-5Q?EDhruoLf7;-2Mz
zE9V8q-T1!9IOOQ>QwNkBlrD^!FplWpAV=de_5pf<XAKp7-*M;#pTM}#GkGBEQi^=R
zCo?_loG2jqvKOt$k!vYOui!J{<giRP-BOIZ={AFLx1311a^*<5a^;+@<mmLTV;pjH
zIgxS*IU285a?md&u7v}VK9Y}Zj7vHT-s8|qe)T%^g7-P}oA_MHzsMI{%D>nn{8Ijf
zUT`V@ZoW@YdiDJx`3yN4m*<<CU#S>5lE1E;YNm%AonL7sN9Ri|<B+3q$zRCP`E`|&
zqwlW<B}e0K{z|^M`73yjBVY2x&0oRSIrLxS^FH<^zXX?jck}CHrg!^NmMUC7wWXYZ
z{wSs~o*hdmyNF`<;7r&YQ(Z5#CvfXE*|xQ_qD{2iaLYU?*EY6B2Vi2?Qrd<%w`-|s
zAkybU>^JOy2J){KW;O@)8YIojf`)T5*wTfQUWfmPYBx3=raP#z>H^a*bs6m%-P%N3
zQdeXuE0>rlz3<1)%8M7zZ*8Y7rQ4gb^tJV{#Lc$i7EwlB-q@8VkiNQ_53FW~2eV*W
zZl6k8A}w~GN~ub9sTgq>&kbGPM8Lo}8#>B)0Vnc2hjaW7w~y(?0{qhc5~ZUg!2a{(
z155L{cstmja<-q|hrNAF4-)RPzl9?z_rJ(>^?!pd`1J29wHz`p0s3+OGMszQm`<2a
zzs$>!``=2lx+Dz$RQmh$4|3C4>&J7z)jyMz19Qv3t(<P<bWJ-q{?`}acMGY@k8x{=
zKiaL@iGK89X$M+3@iPc}zSAvmBV@QjK0Xa<S(a<3@E7W1!*#JmWWwKBq<+j>0>5*c
z<@g`aLMbfyC-5N(`0{@l-@kQCi1O$A&Wd)Rs~ar+oKb1M2pfI;=wst?G~MWCE7Zp}
zyJk+6{jOJhA6uttFr;Bzkf!^m1ZhFzVreYw!I!pUj|CYA8wBS)M@0Sf-$?)5xLQpQ
zT%R8a{%|ynBuOfS+SXF{Owa1B_H1*I8=6yq?oWJD&;&|EINgT=Oxl=o9p^JaNX}eS
z-w<&wWz@X}{$?<d)3SOk<dr4$wNKUq%qOz=)a&{BRQ?(_L8PX%?7lvgErvd?)t1xc
z>r?r%q1UbT964!KHvz)~hCYhpvTuy-XAC`B%~6-kTS3KM|G1%#_MPBrQjJj+X&*K8
zs3oE<nKv8PUhgyXsG0KJ9R}BL754h446a9aTD+A!J@;Jl_m_lA*izafp6z9cFkehr
zp-ZO_?(2j3I9=0Yb%lPG!Nc?yUH?G1gejPF=Nr9Y`iq>4iJ~kKrnBIv!pjn2dWy{N
z5-#DKa23GVi;3!-t8%mckH+~CVftD^Eun0@(`a0H-FG#rM~!p!ihO)85?&BW7;>Vy
zY1c10$%-^bZNJ7vKHi~W=jqHNX(RRvuJ!77O>MtVKJ3@HmZQh&ipfZaQ{;qvZNJ9j
z-UTa|7w>$!8L>p+Vd)LO!+~Dc9`eo#JS?T*_e0=eX$*n~mHe<Y5~$wFFygjy4!*pr
zQK-(iU5r2lMeZ>dxn2{0sj?cZ;d3*>TUn8J(GE3;8}VyjdX=d(N*7I*oPK!%Gaic0
zUGTrk7W?X{#w;M^DrsAmY}cyR_Qsy9e_SrDB^4Tx8<lI;yQBfRz4lG9QikHv`=J?&
z`^O)UOU2;bPI=_w5)5*ovvV~Bjkb&LqDv&=u-_G%3h>K)FBZssC+D$iRPxOv_Z{Xn
z;=Yr5LF(h>WW3M*dR8EGqR-Wjx%$A;Lcl(Kzco(ULC_D#)qg8tKK(6*J8XCHX|CRp
z^BXDP)4$!L-}kOqPW(RoeXO8R`cIG1KY`!Xb^4>ea^s&S<v#uWtiMqDzn7SO@u%<Z
z#?`SLq(ACKS3j=%^bay$A^nSp&Zl42e$x6;|GN5NrceJi!r=;~KX`rmrLRP%Kc1(q
z{%?=~$Z+4)cMt~mXV%LdK?^7T*AVu+t4|dILmeJm_zNsc>=a7jFZ8bd2j&+(@wd5(
z_<{?godJwriG@87{%twL1|<Ci#y37+`pZLmkO@)#&@K{wDOa<J-_;G4J_dKN4;#^X
zcKOe&l09hb8+gHY^*L2cQvADmpC~2$Y5L=M0;L*-AIg8nrnSR781{|?UCgyJaE)lh
zH?$i26MtpS-J|-Q8Tl)DY}%Gf#!sjncglo&5_gXRUQK^E_Zsf^dUGW|ubUb3(f2v@
zkg>^wNm-Qa1l^-dhcXNYY=;Sj`uWuB`QE8(O_{~hHtKxu)aMy`eqcE)zIW=g483j@
zhfKb`b><j)iFHVeP%>|Ht-V%Z=()2spPcA*>)KvC&Co}2TutU?ABKY7Zs_GrC&Vp%
zUMt;PJi*XMaZ9fTtFb8iz8l5QFmjN?`EH8A^_O;geHwXs+=MB6grP2qO0nfuk82S6
zpBgz~eo0O|Y;ZXX-yyM9L7B=Ip}5`9hv_Uh*1RlBgy|{xR}3Deo0Rb;gNNxO^b#lc
zU3jE;+&kcWvLDWU2V835$UcxQ3J+5+9Ai}MJK+6FPM8`&uub8*PvBXF=k?^oOwCm9
zL*_-SwY{k;i#1;|xvh>eUD*{)9jmbnj7!~|9gaHgCD42-<?o-X+nX9!uWV83XrQ^P
zhB|7^dNQ=a?yAPFwV`QtF<%x%W9_<N`0!Lwg(AcmpN=8v*`CF+;nSkF#_n!fLAY{W
z<^%25w$kU_+$Fz&DtfnU?Y?AnSB`GPA}}nTriHo!JSL2MC(d3hrPGVWhI_-ArS9u&
z?=1Zyd!)wEn<7f}mhUN3!EOHwO})m2nLN7f^Bl@HFecAkOXouQ0jWO(#eF^;ztn$1
z@A9Kf2rMlG>`&lFp>97Qo>ET<j&UtM{ZgM4(!ZGaefrBi`T@E6pO4Wm^_I{RnQ?CX
zze%Xi{!XSZWIyUPpZ#f%{jf#sk@PzlqyJXcFZ6tBbV(TgZS?oq4;-!#KfcrZ_%~Vh
zg8Tz9{OFT`bJN>BN8g1{|A65xZ2vl<^S%2GGQaCVmv-HB0<1!V6c+wM?|v_{{SJF@
zfvboKTp07sfjQMgZhwuPj$k)G@txaO{+4n1dx7~;j?uajekp&Yq}bIB78&2Li!Z`P
z-@D_Pvnwm@TVHYSesku{9r3$gS{grOLz@0L+O>|pM`Q7W{d+G-*m)52ZT7dxk}a6O
zfbX}IhY!jc)5NrC3N`O2{$|ai(t|IR){P4065db$jksPKq-%DS&}&iB&W%VXf(L(x
zIRi_AAx%eXT5lOcYbD`*acFF?pS}m|C%G6}**}$JfhQH%xfI*XYgS*GJ8z(z<|7Oy
zf|_3*I)o}XXG7nA9jb;cf{9GZhW>?~c@8^>Km0x&ofFYO+h`uV-p(TxnUJsNB4~Uf
z#cOFv@F3<VtRI`+-;xOSuTP|hf|B#-{dnRQ@b)Cq`>PKfdPwt8+Scs7B%F`%$CgjJ
zgYKT@v(CzGk$`D_)QY1H@bc4TRzhogiu>hT=n8FEPQCiAJ>~r224xyfe0vriDNl_P
zKfL0E-h%UQ=Tj7NbpR3|I=7&KrWVv5Gd9udOffL~H7?~OKw%}`T))EDWwPK@?J?za
z3H38v0}jqygal1qNY!D&!_R&S+Ck8eYrtU`T3n8EzP^A9OasjvB5c0CfcF?uu0S0Q
zUtd7Eq1SImA(QX>`gB9Dznp3M@ZD0-Qw@C-$93Pk{Yi#?oUrHlzVGo94ZVIV3t5tR
zt1wx7jG+(TT|;Wvqu=7}l|NABmH)*z<Vbqn;`bYRRq2Q1BtP0mV8>KN@$tsaiHh3>
zlLpscYAyal@^oKADOU_=qogcJ-f<V5`K;VS^gjHJ7<_9Cz5}>Pi#)Z#zr^VMe2kpG
zjKO~zBY$@cy~GLMq4oD^yo12ud$z`BTG-6#(735H=o<RHb*V<31c&eI8n3mmq1Sx@
zb&P{v<4YJvAIdv84DTw1i_L)A7>7N2bVw)TkgxF`#$EaSN{+spHYqt8A5e1i_xtTi
zj!uWClpKxkP;xMCQ``$2fSsnu^ZASHBfh$p+sQcMtMOM9y{@%T{^3Bc@mDQu@{8I9
zIk$&Hpx5|b#$jhFM;!$FIP8{_1B^qCP6v6AL(Wtsr&P(&=|4`%(f9;KuWR**ieBUL
z9EIL#Oarf+!?0i1iZdC9{Ti=e9CD^}7@pYamQS%0a&-9=J0VAxf4RSa&rtG@)cy5V
zu~YJ^gwjEe6OuXseVX*kxn&%3`%L>3uJ4!o6|T!kUWcI5OP9ZjMAz!}Of&5{OdWO3
zIF(^18`Og3{f+I7E3;jmjossyt*EThtc$9!g{w0F#_h|bp3JaC&7)jw^O{bIS#`tC
zcDNFKgJ$H6mbZ8wE#`+<$fSr1E-ysrk&<a$)!7zVcta+oT$5eP?+a|boe)j&#8l-x
zOeRS?vqLhO=I#z2&tvza&8@e$qAQyXR?*Csj;7o+7U}`*riBJuSF}dA+bBHuqsEkn
z3|TGf@<mrB8K!W|vBimsU`IY*53OiY3|~GM)<GGDtFqEsOEbmS(99N^h*E=tS<$4@
z><ecOm1ZeGbC8KD`8~B_Ep1LxIg2K&(6FQmbo5G1$v4_zddE=PN<SAx%pR`DmN*x6
zodDXc^apmheYcMl;FtC%kr_8i0_;CZKCm>Oi}wImI*)MM5%nFSBF{mo|E?v>XMY_>
zv|0qR@9OU&+^4^VKU;2NKIlXJ=;}Y4FrWT)tiOS-Yv<~pM;Cqi%ehf7$js1>Bysg4
z-+cOCEK)zneEN5I^rL;`>VF#v0Ol04;B3w}HiIavbI+?|_^IE@IMK)KIsJ0}4x;nv
z7k)Rr-Sa9k95z*nK=y_Iy$&w+i~lI;N7#*jAKRaD_}%zi9K%0QBtO2*`0}rp?|->Z
z;G?Z2`US^aBG}LBa@KBRK<MRydv5yvJ>!<Py8>B&q?^e5D+&N}YeV6`R|we`e(~2(
zK*E}IrJErRztH|I^SkD@F#irAWZ#YdW5n-E|9(#Y2IfP0<858|CH;>l#jb9!%;$pI
z%XT1+7-#MBquF7%wzmuUaL2Ui$hKj7l)ZcAR>)pI#gAL6L&0H}Hh!AMaL26Uv+l7w
z4<$=?H`4k%rRz%W+)I7g=u3Vhnb;DPB);~AM6mR?$)xFneVuTszaM-qF=@k(Z=SM`
z-T@x`EuFtXYw+w$PTJCtIPbYP5)(H(G&*?grbCC8?j$^BO&#hB_N*zyw%inB%j0az
z0L_VlEq$c_$l3EfTKlJj*2=N{`ZQL8`r%8qOf~(|N$THEY=KV13GsYR#S{JPuU~<F
zXuCeopI+P^9om;EAsfT>o1QT7OKiE>#BUVEFG=w$p?nXv?4xmOI}?*PJVt-Sb#l_?
zX(Q#S<mbK&;%nDP!n#K~?S8>&_By4RlqV{No9Nl`AdL@w`p1`--uZg+#3!+S(<VBH
zj)xK_ZrDWq`_Z(_mwgM#fXoFf3uTk^Jo$m3^v+`B4J3mHefeX)xde$Pf6lglk^F~m
z&g?^)z;^0?dT^Ix`y0yk&ynr;Rw3ylYe*6AL_4N$c)edbmiBdjle+JteMepWsbI=;
z(BDV#KD4NW_NFhPvXG$sN>W)LHFR)Muo30@c#8YY^zG>diu3O%P2Zq+PdujN&Lm;4
z93AXO8c<)`gQZ6YPrrU;>78#RCsF>LxMeb(519L5(uU2H2Cp2Q-cMDaiSu5RBid^f
zd#dieq?U9pBHatA+$<O(TQ>HQZSHp@=&`R=R7+xBhJ04RVo!Lrq4&Mis_d$cuC;&a
z%QEHqWA*q*v~T5EavO!|n}c^<Ci)PPw=NU->OoJgABPyeW{0nWNY{g&+!7r0H<!_$
zExl*#-Q(JFA6uR?dw@U}+WBxJ(FMM}hARjf;JY@C-E3B!qK`YdxV=CcVI$^l!(D}g
z$HsMzjo@iup86P`PKO8fZDO8Y@YMOz9$$!Z=H=4EuE`VxeerztE+5i+6gL(&TfX|G
zdJQg4kFklR<E8|q$CpklJ)!i((n+P0OHVC5rS=%wN2Pu#ug!&YI+<iFWqA`JPkjT!
z>2S{Xjp|e*iyJHsv+o;~jf?Je3YmQ0sIUog{wyv{FD;`G`<|hX;-K)2SG~#5^NU|7
z#)N$1RqZ=oUhi#=%lD1yS|eZg(&os?p6IuzE<+#1!R7nrw9?Q|2!*PU@0-(AhCceu
z$;vk+LP?-{#^i4lxAf6(QGYP<qj;OarPc~nG#XrgWwF=LlrEzfi!=2co#5TW_igDP
zNRA#q+s};OBVVuoW$G`&HX8b{oCy6_4SiT18t5GEcKVm8UVBr=5cUfFeX0K=Lm%dQ
zJ)OgyYV?NrYw8ffkpjMW{hOf=HS`f3+}8{q=A)?_2tSu_pPaJ|mtDUMb$~dj*U`7G
z`;;ZUi^XTKK+sPU;pC&fgmdvu3kPo}`qMZJZ$5`z`g9B~If!ozlb8k`$`2gAF=$*;
z67tI}i8)G|xP9nLna1rym-GRyYqM>NUiYEzQ@H--R6+c3kfUprW`&2Ph~}y)Tz`YX
zH&>CPzbTe-T@U&CTgx(q>wM4a>o*<T+=imfE1Mff(5qiHH+~OFPd9y`wXI<V`etRU
zZ_c!)CNJs*sfWCMbtiX`ua1m-rYN>I#*O5~X9XVUY;2+KcF#7}!>+qT9l)kLxzddM
z&2=h=gMiKO-`-i(v6(R2f2G+N!xLX4qqjK&tA^t>d)Lrmxb>BeWEXa@gvw)ByW6sh
zV~VTB>0CbL3KwrVHES&cJKR3(xIWZ0Ymoa}6mr*$oKjDSzYl01-^3M6iFyU`lzM71
z<3A(;KKq~I>;3GD=jwl)n1Q8*fc<i=_(Tu%`}(jSCfujrwhy?SuVlOWH^kUK2%+Q(
z*^jXu|F6BPfw8N&&d+NSOhZ$9aS2jrcwQS~{_I`<VJEb_5GQOynpj{EO)2ZeKX`@h
zb<AQ+O2QVo!c9$O6p~tjfKeT4l2&n=R9F=%kb+8EqM9l{R+XfiC@7?jB2!3<+obe-
zXU=(Z?zw07y$z;?iqY<yd%ye5`DW(Mojdo=&yC{W3gVBv^Z9o_VUY6Yf4P*KHFV56
zAAg+RDEwXtf3*!v+dlm5g0&n^*BP?;k0RmYkMkVqzaaXnoL#Sf8U>ERuat{wM~CpZ
zUq<=ARr24KUtE$t{@*R=KP>v=9rV#x5$W#>&i~9n|FZ@C3nioWcF^Bf&_5LDqm|{;
ze->e6qE`OCCi=d`EO0wkb7(6{|6$P|6eg};*z)=(Q8|JBBH^j`tO(6lKzwlF)Teiz
z;rMf%Kfz@4qu~_Vg7EaO<wS7}-{~FxbPDWk!p0YDV@i#Z@44th0w$MBn|V;eZ*>PW
z|CEUDsYUsJnl!ew4-@&1wz-Da>v}bXcM@#6Da0dk9UzVv%i_cHJN%JtV>b?O;+OcH
z-r*0dSiYpmuKRcREmP=P9J|TB=ko}UMJL)G`sZ=wt8U!3zPUX`vbllUOJgIWTbfw+
za{anFjg{Q!SXU;z+NU13pWE!aHJo2P$9xT&_ai6^OXwfYA4_QYH+pyS2-BsYxS-Ly
zlg~3JzCfaPCl4^+K7}Na``NQkAql^SJ^K`r@N>zt&*GeR!ahd-(X-~SGe5^u`FaiD
z-jk13pVcgmdLItYYWaygUrTC7#|}!>$<KVSqj<><&L<q6jp(oKmdh6K%GvQ_i#k2D
zY^4imNG_my>pQjD*JZ+%(XsUlF8RO}=hMonYp<68T`sJnqf~f&$}9RM$~1SYk}r~9
z+Hd)IJ15hI&08SY$G>m8wFrxxsmA#5ne;nZcr9;g%ZG2$0bniqx9*Ts=z{{{R)BPB
zxz&2%-GoK@t0i0~{a+(qq_2g|>Z2Tc{ez<K@BJG^|040#LtNq1$Mq1+J;S@N$Z0q|
zh8hJ}zXIZG_)ho!Aqnq-H{R=ogy7*Z3GeT}I{s&sGpzZi@F;CW`9COyTGNH|AGO`@
zBHU}kw!WKbN`&D><7XBwUc4yX%hPYCd;hYfQ=fY_VO|ck5IHLCZ>O_{emvSi5#2-o
zcSie^UumvcqjBu#InMK&*6YOWG~MZ1n#B}AX`~?z4sY8wd^0biwrTyA>&CP!QygF2
z?lm}vY9{5V)@52Z0y|G~+F~ui^xg{I>VT)`%kpj!9>T!E-@{w!`crJbU^eU_!ED&4
zg0K@Vtn7wf)CT(pzUJk^ccG?pEl~x(z*Nnl>appyJ6fZ0FZ2DKE`^KMTloa@eT}7j
z+X_n9F6P&99F68!eU$l{)5(VZhW$~@&;1q3g&*}tZDzinHOmG+_gCnVH0G*~C;O<T
zs%|aYuj61%uY55fh5K9P*ZZRqU$271#qWd6uj6|ex2s;JFn2I+XDcN9HpcDjn1tWN
z_!()({QfoLeFjOJf6Vy28vZyTc8ympkysz6w@3H#b%uLU)K<q>$KIY?KDA_Ees^zA
zE{AFneF(ihxx6X=V&>~!y4H!>xR~NUt0(8%e1PQEaXfRmQu}w%vEH6se$?Vy*nTc2
z$~b}T=loauE7*Q6Cu;v1wx7#`+JBn(vwHIRQacYap3j%!qZ}VTIY>^sruZz|uj5x1
z_}?t#+lvJ|G^U91r*8it#_RcWq+o}}K!tXQ&JO)@b9Be}c;>SGX_~LTpG|{wvZKuu
zZ%1*p1KqP|r+wb#0CX*`{7$-kLiD<ds~zZ`LpzbK#g*Slcc7rFxav$J-CXMO{Tle&
zRgC<mYy;P_38))8c&=C1lnvN9PeJm#v7=!TOt)dj=4Cf_=E8uurueWkPeJla&+Pre
z@z3ll4UT6ibyvv-_;{XCw@EgD+czZR2DfiW?lQQ%I%MR4!EIT7*x<IG_OQWiKkfGo
zUg@W$?$}MW?$}GQ)NrM#z2v5i!(-@gHS?f8^a0|nXt&0Tltukf!@Nje!EB7LQwq(s
zsYNKw?@GO?IGp3bM>t3<oR4RvV7A!hV{z~_JFJooq~4A*9}XitK-tF!OjO%gthKUz
zJPTwj4)g9H3}e+(SI^M?+Uc$2YIHb`!ODng62OPu^t$jB7|*$)oTh0|G~a6Vm9;oa
zajf%l7T4y#rEI7NiPPfWo|Qu9<TV!1Y^|~3YstTPGyK$D-_<%@X4z@l%$@0r(%i4Y
zCyVF<**q)kcy_E`PECW{I*`hPycyEa`I<XO)m+8xp!N>1+#*beTNPH`(fg+&e?=RU
zh4*~FKf9p6QUpBT@Bb2o2i6k4dTVB+Ep6GO%>bUj?dRd8ghlZmOu^gZie$Il?$dqT
zha&wQBBb{z=p&E4KGtA}^jC|3Pp{v{8VHg80THt42jul}4~z8meyQzciB2v3uovk+
zDnd5>c#81)7Z%dLP6TJFu=qax7ZlQeG|)#{y#6(X@;6q{^ZLJ8D1S|9OxXO7`qghI
zohbizh<>O1zm0fN{x27OoBzm5pZ-~e{NE}1o$~+WLjG?I^zpRf^%ocNU)xzezy1D#
zLjLa!@_%-qk8&R6|6WOdr~JR1cv1cz4APIMP@n!UQ~eD6MWUzPe%W}h0^)-Ur~Xn2
z@2dI6(L}2}BLGr;Io#-{fKmJ>B>sa!ME!-QdJV7T`ak6Sd3}smft#Pa_OFIl;NJ@8
zZ@#>8u=-KI`r`%tR+svZ6!f<S`gmKQ@z?a<Q_$borT!lk^bZC4cs}&{w?jXeo4H2|
zh-S3-9{!lbU+W2_Yxw&VaN*U?_awZdH5L*cISr@B&XV%$>HPv|Iaa==U-#z}%C8Qt
z)o~ptzw_u{!|VC`Eeh|oVY?{>x+M>hh<B9#3m5D6+?wn<_3d1+Y}u5@bsRJgjx9v4
z(P|7(4S==lo~LyMe>S~wC&lf#Q)b`yY0RA>!d?4lZF%@>__H<_ed9lA{k`Yk)H?RF
z-}%Y`)5n7<vH1Ve^fdSDC#PWT!s$Hk>x#qg{Q61L#xH~3fm2(@pm|ZV@!XQ}-~aTp
zH0NuA;)1zb-=lcEG(F7$o0#4@=Hv746d#2DA<g|dW7<jo`WSUHU>+LgdHv*+)-lr7
zzAD@bYH|E7=9(J3z5gojpP@MCcPt;dtTFADw@rI1&E!GZ)G~P?NV=}v3HQG7Gc#z0
z7B4{eop0lQ+`@5ksJG#Ot>&#NwlTnN39vl@wm-lQ1=v#oHsP>-+J8Z?UGUQ!ul`T;
z+;zeyc{bTE^jzJZ2=$$BucQ|)NYi|&ENnW_UWBvQssPjR^p>|H;O!Pn>jmiU3wU1+
zuqRzuj#%L*>Wlg?*D+GjxNy;Upbbp5Z?$ruXgm<=w(8q1%a<E`h8nAwU&ld-=0?4T
z`S$HtHWtl|dI$6ETQkeIZ_N^ZHuLK^jz-_pJB|6Kvdrd*Z{M<|1HZ`pI-cxT-o9~w
z^cud7C%%14p6p-G_Um}!=RT6eZZy^~zm6w<?(<Oo70j>WiJ$v6l>a{F*YU*1-L2{_
zVtyS5YkFf&l}vj}m|w>ee{PLGm-%%(@z1RBdzoLy6W_iiPeD&)ejQKzvupN$$_;@!
zzJTqVSL6Q*;|pr|4P>X!^x1HIPON7LNB!a*s*wmsz1C;G)2MaX=h%LJi>)~NsQP;H
z^{e<?vftN}uT#Y*3h}v;`T06k{!Z4-*Q4Tihtk)RuRF!JGoG(6#nI;N>&e%V;)gl@
z`Fi1d1=+wec9cH{3pnmIeWnjm?Jr^7e7z{%$GZ8tQ2Y-W&*fk7PqF<u^qZXGN12b@
zPEPMB_-<5RPcFC0e}ZUzJ-K`;-pldK<xuTt`vBu3ZE0+Z9`N&J+j{7uI@bcSJsG~R
z!1vFopux^Sfj?CoWyw3(xA;mSAiXOLd6mI!KI}C3I}BepVSl;q7=JQcuW3W)d?@7)
z#sI3*^9=hI*W;7n?@|)^){ezb7Y_Qg=&$WG-+Z6hRfhkDHao93>if*b4L{d5^sr&@
zT-)UJl3^#;DtWyC;JH@G-&6vgYn3$j781a7t&-Q@1fFY^ygmT%T&qy~nfBF=z1w1p
zzv8);pzn(sJl7JmX0*X`EkR?R3_d5B<lp@U&$UFOame7gmS{AdGI*{f$W%8UA+7fo
zrs<rnKgafuA;@LuDx`tQ{QZ~e7if4s=%mLfJazpH&}w?uZ5i4=ylH4`QaVj9odSK!
zO`E5}9-b2Wrp=SZlxB%eb{P5QqE_vHMb1x3sHe>tAO)Wu#~_Kx8I*`x99(bS*3lbA
zcF@|8v>+s%!Kwg7u?is79zrClEKIPakLqB6`_S5r*AHzN9;q*NnL6v*Bj4?!ltCxm
z08OgpnYB9>v}e}RCVyEc4Tt9s#bVJ$`P9xLTD6fF{F^rQ`>}-P@5i<~@(7hKJOn##
zD>?p%?(5uSG<5<tm&>rI?e3sl{%tnyIl$15WL?Ydm~Fj3D72aMCkyZIX+AuCV<CK3
z+%NAc`$Y&olH%Jf?<4U@{}u`7_5A*OC@`>=@YP!*`r1B%KJH^)e}5tU<6_9``ThF}
z>E99Pqjm1}M+)iR*`+?-X+-JY6X@f<?DcW)it>L~m-@)xNdG{fkNdyZNBb<&-`%DD
zr3L**1AVkJyuQBc_SeszF7<CNoc|+%KH4*0A8qO={n~Ew<<0M(L*b+RKN{$x-Q@MR
z7WDTL4(Ij!{`JCXfo$9iY3$kS5A8Fre`n$PyGLw!J-@%ZkpIm<AMHS||96!6QU31}
z{axa#=k=eUz`$Bc5P!Mo56V93AG9~U{*MWZ^!<BIF;hDqKcoYZ{&<jnv}?US`bs1H
z^8k|b>Gk_(7xI5^ppW*m*FT+fBK`g@^)V(mO8>z?A9bDA-&N4Z++sMNUcZkqw2}Uk
zfj*uGygup~Ncs9_d6)WsAaQJwZ{0+oKZgij|6fQa(${zD%2(Sy{m)R~DE+zyhQ0pr
ze53Xhf3Tpx5|JY3_541bpCbL4C#UeLgX<5^QC|NM!XV}If3Qpazof8{zF&g_`gmUR
z`X?8zzxRv2@+l}gpZ*gI*PmZQ1NwM-r1mslu#RxlSFF#yNj3jUwA#SMv;_?It<&)L
zS&+6hy!wwx`W>zDyb|024}U|#lUH#s3h{^wpy^jK#{5U;PuK96knl(!-s)<2%|EQw
z;k9A=u(aFPNWp@cbA#{;7hkYA^%8g2S3EGVs6X{5cfSUJ9Yo%uIN)xzn9hX#&e`k}
zTKEne&-ugm(|)(F@igrpYc$3&MCYzEPH231J#{ILU)y*Z`{+~FZ>G`y?3ZgRve}?G
zp<nvt+J3FXGs=UPoA%djzVhYtl{iOq-d=bATRHG5A0IMP^1-fAGM_NL2fZK1b!-TY
zpTOvlvHW>L9&fi&Y^)Brv?i{8%8>iiwhCA8b<o-=ST|Y+h1-qRw*sxBU4}=z@caPR
zNef(U({;lgn}XeaQ{d|R`)=Z(ZJ176&Va&CG{)pfya)^5Is)Z`6>ASMRL7GQyw$3@
z2bfyN!HVWP-_3k2ZB<**dcAv?FE2Q%bh0lEe}n%X^XoV$(U_EvFyHn{Wn<AdB1f5T
zd#fzp_EshQ8s^t=9F4}L{08%F@0PW1d$$t)73SCRWZ(9BCH@zgU&j;Q_J$??KIYf)
zPcm+M$rAtLjN4wagx|`z?Ilb27~^x&j`<y798Zx|m%bN$W)-BpOPG(RuBv;OaXbxG
z-RBucE4}L0GF~6kaT(+NRWj{izNnp_%XKE<kJE$3te%`dsFUE15I!?)R(?^fMDw-J
zp#u>gV{>}V*buHa$i@Ku_x9xLQLnTkjO$)r?{PcFGoLSw=P`QFvGcywKDsJ;d-C<A
z7Qe*&d>twOU5w}JMR7dK^_npwiqkhm2+!qTag4R;HDg8;N1sG*PcF}j-@$k;w~Ei_
z^yYG?>AjQe&+5tLQ1K5ke=emuImP>^Jj^m<IuyT``MDe_{&lvW%c0``&3G<{isM;7
zDpzU#_zaCsTA!cxK12Tz|4$0#6Xi7G`+4hHp8ul2f23d^>rzMdv3`7nKgag#>B5*A
zyDovoXJdhn_0%K&Z3X`B0$;B=T;DjGx<8w?;V=)~;(FdNCPlZwTaF)c!1LLs_DO<y
z%n07=t5cm<O1C9Kh>z7>B{;^O*m&CbpjOm<n-3P(v>(rWu=bCa?#sysd){q)EI!qI
zcs)L;0G6(o|4;ezYAesL$0v<pjOx8<R3Dy|iYEW+b2#vP*KRbL!U2As;cI;f{CtC3
zJLnfy*OU$L`xPYL+9|~cZ9jEQ*_bRoB|CNu<IAzLSR+IJ%dxX$igrr*ytH7al+PtQ
z%Z`(s3%am#x^OUtk^b6F+Yi903E6gIvIU$US!92g!B1?nd2$%<fq#<0CuAG=n+*Pf
z!E<Y$&M)!cz|XCHdd@JoeG1-T@Z8#OH0&5j`&4__@N;Xw(fFysb8DX>qU)vT$|Jl~
z3VpA7Y-IELq4nFgjc(IbOL&!6d?y%`flZ^=jjXK_(kda#Mz+w9#u2Psc-@Vg*KZli
z>yr#D8Qs2q+lEb}H>H5)$kH3PtScN^v~G0s@W_^0kVR=hM1$8?1gRv%$PH{8-g2F!
zFI+37lE54=ufvhCfkmS?jtz}&7-E|SujfR2DU(`G<Ri75$cL&qVem>$WPEWo`T0O4
z`35#8H80EJ(g%7iqw7hH)=a6TIwaLHAY@hZBBoTbC8W3<3OSX`iWxTFLPoWSFeMEz
z=5fXK#ajky8QNH|c62i?r^W&|8nv{9i_dL2Yk`>0@iMcL>yyxI&X;M`+%NO&8JL7+
z&H|049Uk7ccH^=oLz~tOuUofdh`#wgM44S!KBqmVwwRffGgw~}hnBa|;kLAVP5OpS
z{+!LC^m+6=^wtczZ4b946FS`1teZmvYpd(#m_fI%z(P3}(9O`^C;4VYKmBsk_^Q2G
z5-ztDr8RD*z`&%7zm2!rTh$GE4ODUXhW2FP^}U7$^5JJtU|=mJh`&{CwmW1WZ8xNI
zhU{xQb44NkyM?z}eD%CO=JrMU&x-yY2?%{;rPoJWIZFQo;c&`Ndr3>T;r}E3N8z6p
zQm6d;D)FND?~sPI%|FCN<D>caJiWJy^mXi5r~Ladg^%=)ioVT1^mcfC>__?-(*~#f
zv{%o+KP$vv=c;sy|A9jM$E8tc<BxWs#z*t-odx~xOZ+?OFDvNJ>`f`Q`Y4iK|8PNH
zzaP{||L+U>`vQGriPy(m?CAVqOe<U`{VNOCU%xb-ZTbOu{kIhKC%V+f+}o)9J{stw
z-R||TE#!ZiGu%1-zg@`xRkM+Md7Ww0KX^Xy`n*mG;lBP(>nV5EzpbD@5$NNV;`JY*
z%)|MoY^=Bm0p?fG9A4o+r|?n!Z<U9nK_Mdj(b(IOg8mE`CD%!RT|xg)pdXFBeQQC#
zzf1j73;MbQv`s&HcV=*^^0<keQvQAZU)81ltrQT{me^Hq@YJ+r_2&@e^)IHt(fJ?m
zQvX+p7wPW_^ydcpzf3pfNdG{W`uNUMq<<vPKQqw3lLANjhr86@O}t3IDK7(T{^LEo
z&;KV2=l{hn^|4-eq`xuH$9qJt|6D=8iN+GS`N?blYIp^HRM0;d=%cNr;r0IeCFlq1
zL=B3*>Zp%%W!>i_{{0rDZ4KXP?C*1wdEO>W{h&+zHxduwsT!`hXC-{o9nkbEc^dJe
z^Y^0U-*Sl@>QAIm!)yLsMB$wTo1P)Wjq*|rX7FCshhMmO#gxYWE?u@_S(9D&V}HlZ
z3%M4@uGN@Jxu)wqQJiYu`M`KaT|)|Efhib|_tmwcXdibtG%t8PrsH9QY<1=MyCPVy
zckS>EWBIcpV>fSIKeDbX3tf_4gJS|`Qqr_+qFloP)4m6bwQ!Iej>Ey%_NMaY5w;Nr
z$zi)a#*jxC(pTlp`cr#woZQLDV|)9}Ha4MgNHDAMlwgx-puoK#Jk^lhq8E*Q`zBwo
zRB;6^`qsxo%-7gf14ZBZ_*3Tl7G(+-jeWbH`C2o0`*`ZBx=%5`j)N7AeZ%~^d{(fX
zUG%Mw^z8BGOfp;1w?5E@&ZWqZX*2rP2inXu8ly^-z3E)7R1bZW`8fMkhj|+fZRk}G
zk*;0^`M?*MU&kL{ywXd+f$nBJkJVC3H!=P;-EI4L7Hl+{?S0+2fi~>e7A;91r<=l5
zzR~eFY$um1y>2n~XI76ixQH`fgg?amT&`62cEUBRP}$qW@yX?iuSGh7M>#vTORv3W
z7|-QIZLX$#h`#ml0P~fV?z;pvF#oH!Czl7+UCR7?-c=Xt;Mg&AO&B5fX10^BYfUfi
z;r81m8iW6$Fm_Ck@-Jn6JzZE2$bOSV`7BO97$Z|J6=^JBla8ydhQnAPixY(%?DXjl
z`5F#mXDr?n&Sbi|ROI}IuEkXfV~fy6Q9T<^i!1+l$5V6M>LQ+sYrN2RJx3!!zFyJ5
z=Nh~z+rZ};+}go2fjVnPuOS?33ITRXV*#{37F25|kD&a&`)0*m5`W)kd%)nPiP(79
z;I_~9u)%Gg?TZGN*FFi+zE-=K40=<SYvZlm)#@1o{K<*bqKiq!O6t(m4qaNO2H}QA
zwrm*9os+I3v(}+!^pd$sjEq?L`3M```~it}GIQUeiCXT4wAyX79XNjvqM{OYOSZ$r
zUvS9T6872IXmsweYimutqb_H{&)qv^;yP*Hl>2JKjs?8T3w1l09w*w&Jx;p73w^SJ
zI}Yhv5CaSN>karu15uCLsxOVkb#x!gcPqJw$lE8k;BV1!>!|vvIE=9cmRkhraI3<~
zJ6f+QvY9p}3-9@Ue`i5|r3iSw-@lc@18WIiy<PImto11FdEjYFM)Ai8i{d{hhP0lS
zUACdy@KMi2`ujw`U&zo$9((=Oghl#SNjRTgzyCqvMf!(>^h4Y0Zy@nV|7y{nC%$@K
zf0zPC`m|m%JDYwKNw1H4Mx;N^q3cf^ULW=%{nJFq>Z9%F_5Yc$NPoBJcRK(7RL~y`
z^w9?K`uhlr^zR`Y&ZpP!-z}UL$j0e6LbRNt{2?t~AK!qB^!JIadE%?*_3x#?z*<TW
ze@~Epw9dW$Lc${b$Hk7e*JZbsALr14NdM75A5Q^ZU)OE%b?9LcoUg*-Yj}m9D5PJ%
z5i%%5<UiV>8eY%K!#yeecsFR>i?ZXN1&~*8>R%$^ef&=oLZ|p&OyQ&a({Fs(_(y$D
zZz$-uM8C<g%|Dv{Hd4?ZmjQ$J`i=UYFoz?0_q;|ks4bK>Jp2QMr$efvbPeC>-Sb>Y
zzlKx)B`+igJd8eKVB}Su02rHLozFjf<0LwN`i+pI61b22CjD!8Eq|jFUZjMXyctrU
P#$lWsqH#L?`|$q*dkP&>

literal 0
HcmV?d00001

diff --git a/app/src/main/cpp/libcxx/armeabi-v7a.a b/app/src/main/cpp/libcxx/armeabi-v7a.a
new file mode 100644
index 0000000000000000000000000000000000000000..9587228129b283613b85300c2f32de95e737c64d
GIT binary patch
literal 2372904
zcmeFaTZk-6mmbzX8snLNq<OGpGYHK^^UI)zLDN}X)fXd#_u0G7sAlgur`5gZ=VvU)
z$<E5^&fazVv$DE&{|J23gE4xOKz{U#j2{FRSb8wX*x(Ce47TyJjR&KL!DFy60t+)(
z{#Ha@A~WNfm+C&Feb{x**;Ns1tyr;QtraU)toXBkF-XFPzx4fI`{n9Cr@~+P|BL_r
z<zF6Mo?e|^QlsDb{>jN7_fLN6{lk~f7an|(fiE)fMFs|zfuH`bf9FK{`5*t$$xqvS
z{>dMn{ItdAXa42iJ+b=y!q1=l%pbMSfAy;;KO_76&wu9RXH=j6<EKu3hCct-_SJp9
z|Lebd(&^*>{>k^hd|m|)e)d27)sruuFFfc=2L8k!{97lL&;R}VCx7BQ{`ooo@1ImY
zPrrBabN@Vl{)hka<mbM8zVP6S41AG+FEa2&23|l0{-yu*r%%4?pFjCm{?v)~v;4i2
zKPi58|McWfe))Xi!510$A_HG!;EN1=k%2EV@I?l`$iNpF_#y*eWZ;Voe35}KGVn)O
z27ckc`}a-;`~1QGbn**-1V6v{@efa4{PQ>e>d7zC=Rf#c!+rj<zkBkFrq6%-H%@-h
z<@3M&)01D6eg5&slV7y>{L;VjyC<DLSATf&OI<!6|Ix`WeffOh!50}ATn7H^|M@pg
z{(1QP%C~?0<U95GJ3oK&E8mgN5B}8ua`J<p|BLF+ul~m;Kgd7hKYsE9`uuBu?c@h<
z{?^G4{_@{1Ki}dz+2`N*{gWTi=k8<q`D=iw`uzKU_v8nr&)@#NlOOy?|GM4hzxk^t
zKcLTlk3K_w{`Vi9{GjL0pZnhLp1j)6ul$*lKiB=^|MoYx>B#dx%)WYieeJ*bYUY3Q
z<~OIe*KgiV&wYQlNz&QPH@80ie;Ms|voM@aukm^Mc<SFy{Ez;L4ua?Te!NbT4TA$P
z-i7~m8SHj(_-1*3y;;WL^Rx;6!<{!J6rO*3?gJ5ZoWyCA1nDO6(<F$~-3&iXy~#XY
zETSY@hmoH?Z=>m*mYxefqO-3qp1g}w{4=wrX*zx6^l*~2XwER~ZIGmK8gJJAAx<Cs
z=*RnDx%2VYWwc0*_^-n{SEf_q_&MW<XW;s!@85w%QCd>b3L}^^-Ue|p1M0i!^!CEX
zA8<iC_z{>KuXhoKkI~Y^<FDanwOvMOB$cH*D_I(iv&r*U!Sh|@-zC91d?2ATj;+p1
z5@3w&Dq073%gB!xvmfmeECPSO6X9~{2XPqkbUJwomiuV>G#xWRyS?<YKNkjmWOR>T
z8{HUyCFzq_NV=JN4?3$Vh^+*rR6|;^_b|<D%?C>+H!W~MpJJ6WrAJC;<ljK{v`9yd
zA^Q9E{XR(M(Yyr#qR!Rgm05<v0hR%ufh+?D|GF$gKIEfXhJ&chh=Rc_g9PKimLX^C
zQ7uD`^t)ym`ls8hTXSRF(J~A|x|#ZpmLaG57?y$KdO^$JI9Qow2m)9Jd<L=%9Q^CD
z4Ed0cY8e92G7trWTLuZnfh|MM*rQs89O-w>GW1WkS-19N83rNUOnpbokW+mO%fNBH
zpk;6ztjsbzJis#GGmvHA;9r+z$cKDX%kUst2BKha%OJrxuw}>@dsNGiBmJ&fhW_a`
z>(-tu!yu%asqbhRa;lGE891&Nv<!}em05<}4weC*fh+?D|GF$gKIEfXhMi~`h=Rc_
zg9PKimLX^CQ7uD`^t)ym`ls8hTYIt$gOF~fzN2NxsXm5f;J9AUGB^%aW*O2HmI0rE
zECUDsx-3IJ<fB@KRJ064!Qhrbf^lHWkTdqEmLW&_U9$}R({0wRJz0i9NH<g8(K6&z
zAHy<mTrX%D90x123~>z0fX_gdfrEctmLVVVQ7uC(S_YzEaLXXUIIv~N8GBUAkR$!B
zS%&`UHtW`&EW;qAo2l<;8FH$RVHr5C7qkqHgOyo^$46KOd<L=%9Q^CD4Ed0cY8f6y
z%Rm$iZW$yP2eu43V~=VXa-`oi%g{gFX5HG8Wf+8XGxZ%ULr(QEECa{&f|kK?urkZA
zT*5NoGmvHA;9r+z$cKDX%diwJ15q%zWsqPT*fQjdJ*s8Mk$%@KL;rM}b!$(SVGz>I
z)OWNDIn~Fo3>?=BS_a3#$}Gcb1<QcXK$d}ne_fU#AM#Nx!%DOaM8V*eL4t8$%aAkn
zsFoo|`dzaO{nKsMtvy+WK}a`K-_bJUR3F1Ka9l5F85{>Ivkad<!!qDAkY(WDKir){
z6P8ngRs4c?pz|Rg)iQh*Edx>DU>VLvnk(2zeE(o^2U~)FU^|hs+0IU6x7o)|H$8I{
z<xE;!XwNWBD%ZD5NURh9)-?ZPstJH4)!|xhj<sAF+MBAKuH|xEFQ}{>2P;!n&(Ba+
z_za}1IQZA4tnwk3B5t}z-9y2KXHi)Z1xHp^68r-ztDMaPDytktIg@RbRSD^s$|}ct
z3}wY}y`Zvk9IQ-PEf!E#_za}1IQZAK=gx;*iue(f)k0KOM1g~{@>*4wkzgEHJ>`tG
zQ&0H@@T^;@lN>3=_MNIO(?8wjU2D$rjx_`ZA>B-U$31sW^)W01$Mu4i!EvxM%P^nA
zGT<|iW#Hgnmm8Z8`KXp*E?Nenz`-)~vFDcHAJ|UhY__u#t@hkGigG5~y0ImsW4f_9
z)?+9uj_U=LmE&M#$|{PWtne8~S#j{MOIhVZE=BwZZfqnfE27}Y%1VNNU}crFc|c{A
zqbO&xt+Fa19aCB5SdXEsIIb5|R*r)mofSn2m(Q$BVKn!5hhSTVki{icEB1<U8e+SS
z@XOj#xq$QwzpPL)4E*w*`!Mj!+mge;FYnw81Ha7N9tM7y|2GW$GK*vw_~lvTF!0NL
zmnD4fs?ZNv<zAHSEp-Eon_U6thDQ9><PD7Iyl%7IFM~8<C6coW#wGHmV#>-;e?*;B
z&%b%ro&zz>l*4D|e?21rW0)o-u&ZE;!I<k37lpLXK>qDmU+eV@y1QQ0xu`gMx7>uE
z%n0Q?B=%8Z=Tk5eMQ5LHztU5}0yi)k!cbX}>v&zxmO@n6h^eeCMhip}Jt8U}z6w4?
z{zD|1C<W~1;K&1K<#dhWN0@f;BK7B+gLxDxOoWDrv#eDPze+2!j3}y~J^b)b+3K@H
zgb`xXQ>z9KHcwc+V)^({*|=G&T|aoNr^Ryf4F9Clyp#eUr%YN!UP~EtBqM1rcufS`
zs<eGYB>SSMyV_Qi88xmOH?_^NWHq9PP}}YZTB+^4%JoaA?Q)36RNFM-BdBdYxXK#Q
zF2(k0Tg3Eg)V4?zjDvCYc`em;1<&hJ+c{~kMs4Q=37*93QQL|dphm%QQ`;O%R={}(
zwe60emD<irP``xQE{AwbwM`>Fg4*VTJBHd8F})hKEfO`P+OFVvU1~cg?bWF5oS;{!
zwiN|Bdsf>VOIBTZ2(|5wpq1Lr>qEbU+AfE9OtnoTK7!ijgFA-W7BRgVwJj1gq}s0F
zd0lEdC+*d!?VO-jskRl>GkaFs97|UEcnG!aj-Zv=&Wks{gxW5LcuciTBR+!K=7T$i
z+7>ar8nrDFHKf|E;CWqYJ16bcsO_AfSE;rYr7e3_+Z;<)mv{)Z?T(<8+RiI0zl7Q@
zhj>i2O(Q;n+UA2hhT0Y}y&APG5;dgSuHboHYC9+G)u`>9pjWB36?G?jR@)p)Ry24B
zwe60emD<kB9>0XzE{AwbwM`>Fg4*VTJBHd8F})hKEfO`P+OFVvU1~cg?bWF5oS;{!
zwiQJodsf>VOIFc$2(|5wpq1LrYZAYN+AfE9OtnoTK7!ijgFA-W7BRgVwJj1gq}s0F
zd0lEdC+*d!?VO-jskRjr8+%sU97|SicL=rZj-Zv=&I<;=gxW5LcuciTBR+!K=7T$i
z+7>ar8nrDFHKf|E;CWqYJ16bcsO_AfSE;rY<rI5X+Z;<)3wH>$?T(<8+Rm%_zJ%H?
zhj>i2O(Q;n+UA2hhT0Y}y&APG5;dgSuHboHYC9+G)u`>9pjWB36@?{@YP<b~xLPGi
zD@^S!UWu4q%?cHX8ghkJ@Vu@Snv?cwR%lMpt6ZUqYKm6trrnj*TKPmPOzl>vi0Rd=
zP?4x1S7-&#>sp~XX|HC5<^;XU6{@IeXIwXKcb_<xtR(3WTOW4>t+qaSQPr2&`jkUF
z=GKQse1xqJAKWpvJ|d=9qqaq&hE&@XJg-Y_=cK(FwVf06D%G~4zMoNTx8M5I3i?@L
zYUfyqm|o2a6^R;hg;wyqt`(Y-_G(sWPSC4dp^Bn*R_mtS)~8m*&I(hz6)IwSH7isk
zYRDB@!SlLSXinOzS)n;W?N{jg+teG~1#>@GKl@>@OUH+YAe}x@K@;{{^m!X4@hV!U
z!P1*7_Un1T|FZL+JZ0B9)OV*GBz^AyG3)m6hjn-$@8b`@afCM2R%xNyYvJe5evocf
zap<o%X}oy$H|uD6{loW+AGhhq^FPeKdV78CzxitBfAi)yr?=N{-cIFR1DwfObzR1H
z;dYxNUTxNKx=D(zm<0ve@k6kCm=TI;Sk}Lr-j4JIyGE$TQbl<P;*{Zw+jEH5mJ&G_
zqblDl#`m<B6*zkr>>{84NVRZVpv*Ws9Lg$tgc%tKrE*4E<1@@8m8{z*_%rf1i66%4
zGn1vq507V~DWqw7{r>4uJ2PivOzLL6OOt(=`gcK+#8Ki0%ll0drw=Q9vx}xT1~LFc
z-t+Cq)Ym)Ruj3!@BY&GFvo}=Gjtc(Cp;0Zglu9<HQ)1|N9xa0X5@qzFWt2v<+cO_>
zI7y;iB)qqFjde7o_O&N6F8#L;QTXXik_6A!n|Pf@$=l8PDN1(nW<C3eK9i?lxsRq#
z({cK|ji$G6^y{(rk-Qrf6%KQ)tI#0yq7=>CQ>5VB^jgc<>4R2A)H8zDSvXz;1P@9%
zQ^+Jxvj<jBd~_CWR@)$n{OEJ|5UlSb%x|(;-<RXQd3d0y9<8F)CV?7H=24<oHS{jP
zJR&&HEt#R^Menm*lh^6HwHE&wsv!zW*u=mYsyp1V$yX_Fl5|=l_|xPx97HWO-e|iF
z!subM#JucAzNep?dh?N6^E0>RW4GoLx8~<=%`e=VU%EBFa%q0%d#C#LkTLi!0ao|^
zY=r-rK3<1fImkNDGG}f9YQ>>vxs0zvy%oy(L%|2zZM2?WwC_4;-}S0}*UR=@&z-wc
zB|gq4@3iPVL$3REh*fN;YF=k``JgAdTg?(ZMl_G_<8+r#wzV{!k4c)ITS(J+g-(6>
z<y;!2Y@!z`E!cFKZhY9JWJj$}{e@Qi@k-g(%T18R>w7=%S5C|avb`707XAj_2D;6s
zr&F9CkoKMAy?uBwaBT?r8P!T=s+rN_FE+^vTRXi=RwI8tF!}Rg$&a+;*T%YN@=Dvi
z>*RU8PafR4hB%>G@@IedfCA0%ZA#hF$c<4G)c7_(I^X)18V9~<P`mOia^zc$?Gka-
zFYT`KI_h6uuO#xi3u6SE;ss(b+awBO+E!W1t)2t$ft%~&K3Ydfu<Re%Sb}U3f5uxT
zy^m`oK}GAnZ$vc_l&pOH1aucc&H8I)@6OysP(uQ#06hm>MX(z(ClTz1%0UD>A*zX>
zM2YGrz?=AmtHm}erEY;EOe$ICOVPyAZx<BrxhHkOVqd{Jo!#*#&a|#V?pU59b`&J&
z`jk1sRt_-jj?x4%TJAT`9-pRocHj`t(}#lishtN7&vv^xU>|@mA1MB9gwR!?p`LZ+
z^qcp;wS1cTh%M@a>ElJbo)_bqUDNYUA1TU!KR55;(rP(9n)tt7SLl8k+~FaJ*<y+v
z$n6$31@reK{;hrj4A3t8Z<Bev4iI3n0(U_}^W%juy7!MX3BIdZ(712({8cP+d-_|;
z$0>p}h{^CjoQFNmy=g&<)U=+xd9SkvXnoAybF10Y@Jlv(&yv|wFI>-CZVm{=-)(SK
zCraA$GX!nSUPO7KgBL8S340HP78Q;(wKD_D?F(?(`ArF&sYd_pGT80n@Xhl6db5nf
zXB;9tV;4$jDe@4{$*)VFNy&<2;F%pf>w~wE-qX82AIJEd>4`ZH9}w-`c%$9(E{#^u
zDR@`tY`r-cRExCV6}HYP4mfc*aP$5fY}vh2_SY@N_Gh;q^!}-TIo~JPrX#@r8PreM
z|Ia>r_NMrpvVVx9_(#h`DSppeB%4)E!qO5z8U=G4*mfFtyhGTW;Mh_vAic8e>|Mgz
z&0}Jn{}d!KX=3kGI9$~m18sLY26XQ}W~ZI>IFjdOM@YoQ8O`fzpGKcevnZtrUd5ct
z(cHH{0A#r^h|=~AR%BJGu~;S+(gzV_;%5-R(In$MSch{JKYd6r|2Rd#`7h&$WVV=3
zq~(<Qgc`m@j$=o5mu>2BUPsI)Ka8X2XNc43*}ZW7W|&zw$exFzJ$OFsv<{~hMrGF&
z+IJ%ZMKZB?=NURdt76dp{LawM!`UV^WL~GaIl#uqV3<cns?m~i9g3DLt3u%t7H#$V
zqG(noeJB7@wq$nHKEK0}uVFEZt@DAYWv>F9q>VXWq0h8!JiTVfT)W3O?ZtT{vNL!}
zh`N84oZ*<8Q6(A!j@P>gZ>z;22+nXSUG{2cY!UL#1<`s27ZV3&1xWs*<3D`IB}qT$
zv>fdc3XB}9C9{~8swfo9%is)S{Q5c@0hjP8mOcH!X}{LUR@jJ>CCoS_tYi|S<bJ_D
z{7-^Y=O-i%*)y=d>#26d)`$6PWA-AUaT8P-0iC+UYosK^b4r0=xie0(Pfy&@z9mGC
z*c?t^_{nYYfFHcSTetK5n&HyRY-Om$WYO%~&oL>7d|^YwZsEA*YfUY!6~uJe1qa#D
z0-tplk&|QA5LF1EVIGAL9LltF?@uS7^LgHpg+Od+2j<=WZWku;w!rKHfYQ5YR{?V#
ztieCZ%*Y9W;M&i_nBI5>?~UeJvF2@-Xl52I>~dxnO)V?4_|~a)<{co5@p8WogZ=$O
zN(n8|mb_(>U;J{_{AHJkws%%ErX;A`BBE3E2g;>-f1Axi?YH1o{Ox>=Ga|&N3%Hq0
zX8D(mA31>+;XZ-T*C?md%ti-+!sc&Tf+&Qx+0h#(5q!nX!RG`rM*$5l@~;bm8-wT4
zR~vQdmeqd1{0XdT5Lr%dlg1LJ!r6fbx7c~7ix_K#ZCky|d5i-NcoWZs`eAeR4Hm$7
z8>A1+fOw}-l2DQ!oHY329)gf%zYUX>oxz|95GLU=3X)>yZgja=s{9T?%SebNz^pY#
zL+Mj-LWx*Wu$uk`?WITAFtD{iijRbBw&xJ2!v!@SgFWRaS#lpG8ok?^)9uAR78Fi{
z+ma36n%*_`T%p@1;W>k@XMPz>oxtC>LTZhn*94BjCM1uc#q5LqS6Tl}!t*P876=vz
zCaEy_hcJwpEFGfY6IRiF4Glvs8WsZly4vVW3j(?F2yu~=BWGh4VxXQ!=@nUkeuiLm
zb@2FNDzJU_ZjC&W_xh|T@ilWx6l|AXCGI2Te}F&J>9@C6{`GqVf3>!_xuhiuip*WS
z&is_7esV-m(HR%P{3(F<#3K=c)atcc^y6X~%je@m>|qY>XsRy6+4G;`=zxS>a49?Z
zK|}%xyG5XK299Mpyj{ixmAgSMw0^xcn1AVC!vehh;YWxRIjB5u3-8_UlQ1ertQeJ4
zYA8bV#8hroP(s9Cn?egqXvhd_&^&)C2t)7EjG2^c0}#E!otsAZ7RfWc9ZkXI`!zF_
zKKrsn_HBuanHsvv5rhwLWw7T7^zuV@SlpL1ZFrGt75^lH+s?DeW8B*)Nz$Lk4Y9(r
zJae_%-(<6FfrEF#R>oCqN0*qlJ#yiZQeMtszPqZqH!5$2Hoq0Or_1uQ#My8~v^YJ_
z+A-2|#DfaV>=UlUOn+lY2gr$%ntL?S+YX}-<A&Sbd78{4Tmqqha#Ol1)}>~a`JIoe
z?SA)wWK@JSzQs4%DL23`H#Z9Z-*fY*oETQs-cYwwwItbkPL1*EDT0aGZm@fITDsk4
z?-B_4<T=__{YY3Sg?l1yqv?4OxVib=SUF~EfU(iRe(3plk#A1>1&e`hu{G`&D5cm8
zX7zgYne{wpr)r2NWJY+imM=($Ic~aQP^)wlwR>Lq3&G)$u9Yr`5H}_~9dO9}eYt0R
zk==)ynyf%OZ;`}{P6RR^w)7HjaJowxQ=V5w`xZBw#KK1N9|{QGn?tbG{cFJr>{7uE
z=EpirBcs5(#C1|X*=%sMnLF|&O|DCqgB%e^ik_`;0lfxHc_`Cvy3YA#t3-mJAaj6#
z2U5vHk?hhuT>?c=@_+#N`d&!KV?!L6su?DTM;pKroERXnZ1$sFf*T_~k~46l9H$bv
z^Kl3g<eX(kfa3jBlD+bZs&V(wj+JcdI-e&98u$s_)GU}fyCL%LzBOzz+o5G=UUAx$
zMZy(c<1JnYMi%m-T$lSj*iLS#5C_BG=<a>y?jvOHN4O%7Ymj#CtLM*X#`r&CNQuG}
z$mY`TIJ;mL2f-a@5q;ap9x@UqK85h~em7;F9g(s2TaW%`_7pQqK0E%o%)_q5Ix%GS
zdLxz-!fxRQr8%|{skRe$&1B#j`GfD+{IQf=UE)Z;vZptR{o*q2>Uu_3lu1!+BKt*0
zad7CWpG3(f(@KVLPrv9XhE_%IQ;gm~Lpy^&xUvvxn|NJ2q?EPAvqz9)irdN7Yr1ch
zXV^4UV^9>8W1(+}rMa-MG`%bAF4Wi6c~5G}k)(<N<(gjW*S9t;j&zaX$y^F&!{eX}
z9I0w@t4}rDotPe#bZ26mRd}~JQGGe7uOS>$JlYwOZk*tW6ee2*1F+jJV-!f*FOVEI
zqaaBmuu5kDLh3|y)4&}=;{xb7n7imcE^pZyM%4}1S;Y_<Hp+eR&oS+#FSI-_kmt8k
zzI|or*O*$&wIcRI`TS%f)S;Jd(?CK;L0`xxl6y+eL_Z-Naq=uhjyDXp0TmwO!Zz42
zvEj}!*$$H2wq90kdAwAjMkr})*zop`9;aIdq=Ls`qoZ2vQ`?M+4rK+(xGpTYY93ar
zsgz>%PT5%@ZV#;KqL_)Fm2zJ;9K}c}k+#U1!f^!G8%Ut4ae<YqLr$E1GFNZBH`<|A
z46lukImi`$8^yO3TKPO<?<Gc5NN3XocxNntUj$M~d(#GqXm1yPErN?v|8{Cn31YFs
zVWg>k+GrH;-el?swpl*YENQ=!aaKn7yV*%xJNH+?^Ieo(B#|2GyFtAJSnAR{@bBm*
z#;!DCdMBaPVwCBC;(*^4Gi1^t$C{G7%Y-pnPL*UMRaTOA$KJrK-`TN5^O6P?$_8z2
zG+=Z1b&+oVmgdmnl5}Gv-g%j`j&K%o(al!Cm@VCadFkIG6F#_)nubjmv$3F7A1|iN
z!X6WZE$A^`i?o122g*porSxo8uiH@bq*aRJ(GIOyS;D*BW{KO^`lYEAe{m5@ZHju2
z(crl4DYnu8G$4{v%&*GG?{;Vh*MQewt}P<tVX#Kk@i16+V1I)`%M9jgoB~U;l1VR{
zbL&B|=>V~n^ou8)-=Um+oanF{jG~2uE5{5BP71dug`8a(>S|j^o(UfEfR^$4Q$=!s
zQ3~F51zx)5do+ZQa<3Sf1gTEr09>Kn1J}z%;!7Q?lrs*Bgr=CIaACazf^rPF*n%6s
zwzKPkqTo)Enj$Q?3dhKI7gf97oHqqPlH;yIrPaX3?9N&k*JXb$Ty_y@)4SQtq2e0|
z#$382J4&58vCMT%leN#6wIR^l?$q_|i0#)UcYUaQFS}xBv>6TF(s4#@VaL&~BB)Xh
zJ9EdQa4fFVl8?}O+auhGs*q^f)HjArXSuauKUX03GiZ3T!mv#d;dWvXK9M3(N=1#=
zuJeXnM4m#bLL>8M4Edb{UK6rc)}zwklv=wN(^CnOzVTUVZsTzdy1?k9ODpe!XkgYO
zUWNx0nrj2!R6Kgo=aQ}qd!Cam!NrysWjmk@Dl1OqTiFA*bj(R!Te;4ducsU2OS)@W
z^47>U_;j(ZGU~4UM69oHX0TFm3Ak7AP+*H4rQIT<6GvKoN&+ZHUA@#l;9VUQsY9i@
zV}gee$P1OB4nZTjgkZQ^v9hkSN_HbkRxxgd;whpEU&yzg(2qM%1!70^|9x$KU=_0x
zKYh+L);x#GiuAOHELi{7awFP7<;X0w+;l491}$$h3tVG@RNZvYY@lXcUWy|tY3R5Y
zVPZqq7b=q4U7=H?F1w7}*ycWWTw_o_$Pl1g`MQ|7cIVWvoZth!$F;An*p7r!CRFB?
z3;>-{j8JNHTi$139=iN`Rqv*l-SikVNY<Dm^86_qcS+AeT1N-fZgV?VV#4fc%{T9z
zy>C2!=pbZ+zidN&&TASJ<5O;2RSFQ_S5Kcw6~GOl-6P!zs^0g(?w3DFhx~;r{fYDW
z6RS+*NDz@zWH4lR8p?EyVwmQ<4HdiCBToe!N9rVp^^WXPi?^I$?|g~cs)(y&6|L#{
z9aF*D{@Cu29n#9lm!7aFS7v|XB1K%>+V^*;NzH_v3)_?NGLf}+A;#fM^?HQSVOht#
zzO6MTN+D^8k2j+7FV{hmzDMoFEYCz(T356yM*TBX2SuSt{nf7q@J#pA78BQk?KO&P
zc_B-m@Xcs&<@{3fXTL@T3Z)?|%v$5DjH^3AW_Vr|+@$=OORnR^w}Txc&P<S~3?IA3
zh`NDkw5F{XoW<<gv8%?sDqs{^evlxs@`|q};a0wmC}vR*Z3<ngL9olxY;VBkz?E<0
z{Z{W=w<HCrM+^>m5V*0MmDG18hrmQjl+4GacLHUirk#7p%2w0_#g$arHo&tt5@@Z@
zCkd6iEvYg*j@ZUxV9Qu3D#!9sZ=k^6haaw=D0Li$Ft3=XW{ABiIj0J-sZclaQEze@
zDPUydhBA%y>^^22QTFNa@%F8?mpd4BWKabq%!s3qIu*P1H+$4{kCSk}L<vEDM}(KZ
zgQBRUpu=Ckx%~=8U%S(OdA1u<!vsrqRF-?A?6N(}Yn=TCRX@17y(Bm42Fx|zLw_;C
z%?4Y&!WH)BvfP&BTDmmZN+({3kjdkU#wv@>B`6^x=|kOC&)%GoOW4&@RddZ=FBZj8
zOm$-#6XBhrp2-8=M4_kR#n_sDfs-)cvNkI}iW7}pc}C1@T|DAezM+sADG7!f2bOp7
zTDbeemAZy62rlffn}x0-0JQx+N14hv`8fUXIGRpHPZBYA8i^WMgClINC+sE~H^xdq
zly{}Qd{!fpDtnd&n8$9d?Ke}gu5{C_wpLVM<~IteRifHB;uTOuF?m<2qy?WKbEs~Q
z?WWO@Ys^hEeR#}LR`nxn=MPeFphH#8_DEk@X#uPpgl}!@6uHW}_kyLEx>of0QuN4J
z7pl0I^u{+9g%X@1d!xxLx8M@<xCC3eFiCg-L)bjIZ!;X|sBat?A$;R-VZCv1z*pM}
zFmx@p0(c>hm3-2B3Q)wA9R!d&kSb-3(YY5kI&SFP?~{({I$mMp*-5~85<Nu;z15Rf
zJ7Y(R_J$u7saSy%luh@sC&2FD=qz>%tCPLkuMY`!lJqvuJjPLN8VWuk%>ptP!K!4r
z3HU`u^kG*Smz&L&pP)2fZe-pyIf|?$yv--PnaZQkULS0JN429q#1yFjiF_kS)#@of
z^Y&}1T7UcN$7g;I*Y%Y?E4g=Y+x=>AXcj)w6xFXee0Us>uEtmA7o)2QSOm^o<CX&)
zdjx(=?tOI)4z|a3U$HMAoN!xQFHf&Q9<MCQM=0e{u-t>m2t-?uMrc&X@(4;rjKl~>
zcw$WEsR+oZz0;Q(0xe|}*mZPOYHPfR90+Arm6Jt!-tKulC5Xnpj3z?J6!2LU*nkR}
z;>~R+nef9M>d&&VQr*s4?GnQaCQWRxLLxRE!C>a6)$udx<SR%+EZktXo5X2Yfg-qL
zJumRP)=h9hM`y5j@w{Kwt4Bv?t9_%hJ=SG0yyNCHX+)kvihXmUnILQXYH~wlSZvI@
z+Oj7G@fMfAi*R9ry+rCJd(CK!@!>MsHO&159-?EfI8!!@aU&q>!^@`WE^|wI8O}Q-
zq-9U=sm;a+al*wu-6zm#{AD#<qrS&0Y-5|_S7q;u72ZIk`|Cs8#TK$rtX`1vCfNw-
z1uq(#Aqwb?M2=t!%r*{rw(C5iY0%DGrN3d)Ds9c8RBdi5zDGV2qQD!x(Y3#0iJ%dk
zjaTc8nz+$~aYYYE^I*N<d|pNX%r^q&ynnH0H4&kDbK5>^L_*4FTnwcC0JvdX<b&i7
zcK7?1w}edZjL0mWb(|{Rbp%ZxW?#L%zV_dIHS@oD^PAJ#>o;$w5`d%23c&i<JHw|7
zJM2jyx`1h1ZB6+avs>GSn0T`rZSG0VEuNg$+6hl3Y?iO^HYpo3lAH&GdvwufydZ^2
z5c<C7Tw%?gkO;xEu$wd(^iZ<{t5%<;cseYz5Vni8q{gVv%BJ+*y<wD<8*-$R;TdGr
zO86xvd`D%&s;?Pl7o6JOnsdfeze#tU9sVgdBNy9bgIhZhpFNsrt#N5ilzwIf@W$y7
z+Ipw#y%FXb80JOjRksW_gYKr@1mq@lZbMAJs_`rn&tiERX8_D#@5^RO4l==CB{se6
z*^~-1DoG!cL!or|vN}FG$yN5%%Wusa^JLzby7F$dx6!>X^%06v@ql^5gVK{*LNFo|
zM7MlQSz*P6wnn&388UZ)+FT=X)88g^r_ylH<RQ^KLW&k{j+UoWIE;Lx_$~ZPdH{X)
z_=o@(UgAJ%5oH&>=kKp-4KJ%J@DQO6E1qg$ary-?6=r9KNH9PGhj`5+`te5u&+$Wk
zRA(R_XTbvbJ{}remKaFeUo=kuFf;^#Sag~~H*;J=redwl(VqG^G(o@~!yWlIA8|PK
zktd+2cVJX=E8ZXkgqNamyU1bpCGGjTc3u~akr`~sB|0D}Z5LfEf_RB-DI6M}veGUx
z#`_8-MQHWvv{Zut{c>+KCkO0(C`GH*QVl3Z<=yOIQr$%l+5uABg8hr?8q%fUQ-6Z<
zLR<vbF3<wTBwpQRsapOyJ&lceLex_&=0(?Y_!a13D+lMF+2Octb1bIMNH~r@`_>~l
zY?8SlPEim~8z;K0Ssu0;bY;<#AGcVy-nvjlmk#b@ByK0goKCO5Mv0GNR&VgXvF#u;
z;j>yLmRvTL`78J|rk8`K*ZTcV(HaK_+vmlK6(MFX?^vucc36%)SL^naoNR7Cre+mO
zk}r&g$qE9zOy=PPfE_3o1$N`=9mQSZUFL0gDj&PV2tzcTPO|7reuWWVn$k%No}E$R
zA_58sWZt0|Kb@5m39xE7kd0WLl<jIeqa7GMO9)-v6_z*IJ+DLm5aX)FE}h4lDJ$x#
zblRoX&%zCr_Ole@tGmr+87#LChG(=(UL*6+682;fe~#vsjn5vU&z4Ou<24k+8W{_A
zs(rkS7Pe;KY!lixoh0%7gKcA!7Yk!@vKFx|`!076n*%uxmczWF_S+4ZW7*+?ci34r
zKi_?dw+GwS7pT*d;>v?1@T)zpD<+}+Xgx2OKkj$wB94}}GImAWbm`!o!d(xXaGY}`
zWI62fXtRKtv24veNQdV4n++*MOXz3Fa<y)X0G{3AJ4X(BfCCD<)}wfB+42l`Yb={i
z(gdelmW>N9otKerTO+BfyG)z)9-Qv%v`lGo3bk(BPt)3oL)zCVE{7N$d@}@-!*7Hj
zI!}gc62-_-eDZUMH>at@P~q$tyjpL<xxx3i&~kd7==@GwP<rvTg<|wtZ2?_w_jk@a
zCR^Zk8!B69s8DeSmyT@Fb!a%fwVYRay#g?!Pn*SJ`WZo!LYgk<Th!6(Nq`DO+YRk$
z{qX|-GrL;hwkEc0emd<5&jpPK&Z@ypwq-dyG(UKP3*8gE^Bslq`l9Z9ceh_{`+_#v
zVf)`JFudyClbl}dw)>O<BH=XD8erRrz1Z!MEY{<2L0@0AO=z&--TR)Hhq#x1&u+^!
z07BN9!5-NH<A*0b0b@IS1Og1;UV9+GmUokTTKI;bku5OFw7ADgrJQX;il8mX$+l<u
zww%6RmcA-Ls`M>wM}6M2ab_lXXv55q3~ZFgJz8WI99RYG=e{h}`De0wJ(?<<yhRC}
zj`gH<C;J|OU2VyVQc$ob?E&`nYppKn5)d1)!NonxHgbILqS&~=WU;g2ra#PTtZNmD
zahJvd;^kJWH6qV$DA}>MdMMiMnH3Jh=FAF)asO;L+-xKN@#)lGBWq24df)`EGZ?<L
z?~N)`q`+=)mhO*PpeqL@W`D|#I@rZ^nmm*D2nS7nbWrR+osaW!S~gmJFj*}3d2s-x
z!N1z$a^?cXWYc1C(+!YGm_Bc#8A^Jf77OmVvCvq4l0=$BeZ=Y^qn@P^VDnyH`(#Dm
zYxiw%fP{kTL7Dhq<8o)~Qa|+SG-x%S9WOJ0J+1d-hl5cP5ICWIs38sy(<VwiQ~Go%
z*=qRNoGDC8fuNAtDY9w$f(*hXey7=J<x^**{YJkKsjhCkhH3W$6m)-BMQI$CtKm*A
zy1XV-%}Vg>B6er_#_$A|V&Pq^_bVSx8lMP<r9>-LzEqWK-=2Rvtqh$>_{UFBF_<Vp
z1bP{-;<Sv^&UVA_)P6vzc0hW8NMD+Gy|d^(8}UmI$eb&uUY?IHP5iQhC@o)__*Dnu
zS1(Qc=MKbwere*LI}rc;(!?)15Wje7;^!TRpT9KmQ3v9qmnPnjPp3D#*H3N8zeMh{
z{w}zk(_nKksOAjH$z_0U3@1DGkg`)J^>$3$5|E?a+=Cq`lf3YEO@~fSr1dsT_Tr>E
z8q_t^!6!wt59wnd7jWzGaA#ybDYW9T2(AzE&f|N$hk(1%diT<9xs10sQa1&Kt%f<K
z+nYVH?2=&ZHn>`1Jgl{%4JYvIq_&qeGhwH+{qW4@5W;GNlQdc`?|UI?LRl8~@`MPz
zQM03zgO?|ESi#qal)6OM^EG3@&`Z!;kHaoxqlaM~1T%o)d2aUMWh-#s7^58qFs?yw
zD{x(@vJ86L$=T95`lufxhu10kXo;Xj^w9`e9~#s}>7e|xC|!ocBH*o#(sl6Q#&}^)
z2%;MjU@~oLWQ;!MXDw=mNSiG+c20?LP=-j8Ej5Oik1ZHO^u-p8Ar4{-#t@OP1!IT}
z*n%<a(rv*Q_RF?luHW~xs@fl%U)gJ!;MR3Jr(ZZ{P<56*t{%{Yy_jo}?q@YG%sJg!
zI;RH0$a~y&a89kjw{cGKo=%p-&kj`;2XvjhQ%e+`+*4y1f;`iYAHPw%Z+28NFhA@C
zOlKfwN7-&nd3wmh`cju0;s(r|YvKg2JF_y!yPrW?d-0Zo<nTHV($bF?7R#X#vpc|t
zG)k5kf@wrX2oCplny35PVQF)_8bLrgD8okA5=x7!H*#`%x_ToA-uCK^9GZCb=3sEU
zE!kMyi0LoGS5A9@sJAR%IiA*6Z{*<GU%ipTYkT!Z1+CrH8#%O=S8p`Hkk8zcoC;TO
z4*HOxrQo-|dZQXH9Px144{gQOo1T~l7u2vvvSb=1Pqw&vBWGF5t2c6Bmgd{m+_k*g
zqN0smZ8@~M+9C(p@@k757+t-=)fS?!m!;Li)fPFS#nqOc)<w@(TjWIdd$mQ5qutdO
zIjjy>TjT(Xt1Ugv+Ex3jEph@|UTu*B6Rx%xBAS*ux4hcY6aUJqEd~O!NKc-_D<7{i
zym2sR2^%*uR##gr5al6p!%$RVlmdfx`(wo}!{)~dhH;B&H{3jSVGcLgQDrKQVM&#B
ze87$>(`MR^DogjmEYKaVw#e6D^-hKU*eoCKCcB^_huFgf6$*yPv)<L`Y4Qsy3KBbC
zP?5u}GE?smWg@8OW!noXa`M_=P|?Aw9uaeW=X^oMfS|<@v0h&jE2N2Gg}&BA1+BCP
zFm$`1B4^3a7gQKl=>-)9J<6r3j`>^jPk&hLekEe37z4{gtWo7~=_l8VMv=QQ9GgpS
z+!RNCv-G8j*GCQAXCr>;0U3N)?QA^0H1URH1ugN*mnPnjBB3RI_0q%}5;L^Ke|~A=
z4e20S;-6odctaA3miWa>6K_a;(Gov@Y2qWjGpi*&dTHW2UQlU6zWW6gIhGa|R5XBY
z3}*~A7f1ssJDX8&$Bf(ANv8`cdeV9uru>3RZ+isI1r?5?kAajoN=!jOtLYcP^+8^7
zLB-&WSrOOff{I*}vI{D`uuQn1(hI!ef=VC!Z*@UM!Lt?@ROFCaT~JYg>g$4v7JQo=
zz)Yg`5uh$H@_b)vz|c$RT93mnbghSB9lADvX?sCMKL5sQ&32QJzb#-LP&W+HHgv5A
zV;Q=(8)EwlDss-tE~q$0AN8Xz5VVLs8X@Z=?WPMVj3d(2aXGIjNaq?*H+pcLE~v=q
z1k3d?KWkAlMB1!$FR0PSysW9Q^KFbmV~F|K4$2UHu?1s@gV=&GL?mp%7-9pqU<|u-
zTQG+GvMm_b3o6Q0)&8)<LCc62RP0<+y~MK%Dt!PdE~r?#-+HoIT~LwF47)wu#|0HF
z_%_aInPC#IQL9<;tOA|=u_x4mbd#{Ug78<rMG-lDxTw{0dmf&aVsBdU_o|A65!7Uy
z-~t8SR;0&>?vntI&*1@yG+3vzyAO9BEFY-RreCxjtii2q3l`apW*)W$p8Irsj?@7h
zA>GkU0?v>fV9FV7B>;F@klt^bU88;_30}0OH_QBZG5ZmoJi~*tc+f1|Zt=z@Uidr&
z$-Jyn`LX$|+3l5&KYBTB%VWj@{_ad|q)2R{>W~J(sdXaZt`~S|uDtUk+QmPyemt=C
z{I<!VbCVz;56<9!wVj|ck8L0X-O@uZi#Kh+I9)Z^rW9D|j?A?uGdCy#IuIWQL4Lt&
zq2tbUyxB(V845f98yD^)rK#%|m^Xnj3qD2uYR-9NdOgNvz$(qtlok`#%ulspOn*qT
zp>Fz_TNh~kjlqg>@Rjs;E3O`bourI2?&#s^$0yXO2*vk@rqeq%0I{I6G6_c&VNijV
zm5bK;R8|}?*g-28%;PjXo04zT^@402Vbp`cYrGpg6{(+EONwmcczTL*pRX4#+1r1s
z>GM1vFT)0N`1W%n)8GQKH)QF3Sv*I)E6bbr!ft!V!)j>OUWOGkJR#t-LJL-$vI1FL
ziZQ*@WCg98&ts3G?JZC%3|7}+tRQu{%H-xRoAp*(KiTD`v>VNxt~Pb>kIm;bU4V0g
zt}S@c0ldLlc7U88KN-q2bit4vyA6oJ`u0Z;!!V!IbwOgZ`dv0~<`vKhy2TRc0^hI(
zx`56Xfq8B_VX;1c?u5lwgj#LUtwpFEbbAqM1>a7DT7h;Jp>|kYMW`JXqX^l>B+SBM
z3CBV#>>wEgzz&H0R9nKco>WVCw$o>bvsh1`36A~r86eqBp8<&T^qJtfPM-;0Hhr1{
z8tE-9d3kzojE!@&OX+09k2Z_)@Qg(%T#?968}&%EPI0!OB0UuaD@8Rtns*y0`RT2k
z6%5MTZ<K*CFJE2;FsJOyu}*k?as6Wt7^p0qpT~&`Y6=Xxs(LlD<n!gqPYo1JX}-*h
ziSbx^I{;n>Pue)yU0`zwXoyQOK{^rWj<+_&;oxWu;;0b;uZt&ZoWf4PE33G<#w-Ta
z%D1u|R6F36K@~c+5D?v<a%t9|y%@>21k;^RgB7(U)C8tNXhTfCQ5q9L`N^%3*}E!3
zcd(4=)5+cdz2%OKdQ3v%fR-WvvMBgfS7T)I>bVZnysiQu8sA@S7)%R@`Ye!)#A4cY
z0FBciNQB%R8X+|KKQN#c5+SFkl|;xvb&&`gh)xor1?V!LZXtBA)0`%j39tTq&^*Jo
zV7|rrwBntfAS2VR-fd>z-p-H?W;{gqPJMru&f_&xo>R2HMy}ZI>)D6tb$NWQCmLsz
z0I|WlK$HpD4u(j^p&f_{8SP-4h4GrKqFTR?LyXhZBuWxfljY{#(BxpGWpXeRgEmHL
z&?X~Co3kKJ5t0nGY#Ka)qB7Z>8f)TFK&cb)hgxEZbM{Atcq28%Vm6*+7FTh`R%^f7
z+z7p<DzX@nda2afyPx=01<pRRqSnu+x23~}Aeri~71in8FP58wDRZKRYkL=jpB6#9
zG~JD<h(I_sGqcvgotrfPR!8}@K4ry3Q%Xdwqjj!_$j*ZWSE}vZnNscFPQ(t=t5za*
znA+9HtkGDCm?3YoG6y!ytaWhbW(|P5h#jV-h?#Dq)R2`TW?%~@3)df#lzbL^D5SbG
z*n>g?8(qQD^D;VVRqbnpTy361*TtrNJVAellz)GYyxn`;4p?l)hle0FskB!4^>0T-
z)O_}CJ*DSvv^I8IKHen{Xk#B)yF5eJ8oVlTAN{-#+4Xx=)%(_TXQ6Mbgpgs@j<rU#
zG}h4^?s>39e)hazE5!>8SBFNB?QG72yA4E~&-`M)4%2wE1_WYZ*{Bo@{Q{utBN<#&
zw5~(F{`yG+*Z>*VmMT(O(5mO?1yX#MK@w4NBuqPQx=c-VY_9Sy>y5wN&}}Fxa~SHi
z#mJ+Y$Q+ehKi@BVS`&%f<>fL+BkZD#?wHutcpN4)_D<&;+yPr{!9H51*pu=<#BsGg
z5h08KAx(ny4hLqd42FKbs>{}P1>{$n-uH8->5YH;hV8$tMtOljBE$T_W_$&6U}pJA
zuG%dY+uG0DVOpEFgX_EjLVex{hReK3LpfE=Ma5~0t7z}>H~P8bT{M?@J4}Un%g3jg
z@AZB~+k@;;%j`G+ag6eIoK#q8l#mbfobty9s1{OTqNg{HhU%t@{qZDBpSQI7@sDg*
zsg^1Qz)Os8OX|N3OgggOg~8hY6g?j{Nok5^%#1iN>zWy!ni7EURb___8()cBfPKID
z=-*EL+jsN_O!54iN4Aku&uVtZqvQ$Ig+290@mz0>3dF{iB46{yYI@o^0F!97O`l8q
z-zphFF1-^~iD%6i91<$#!aYmFMGpt4+pRS(E(TlHtjL6#OC1o?r8llp{2iX9kLI)G
zG*d26F%A9l(V)4pb~7g6I>;`f;0Cl6`+rs?xl~qK3jk-a;N=vThiUJ0AC0h^Nd0XR
zZELWu!yCQd-)<>5-rm&_z1(cJ(=Z01IP$%D45hc)NWaz3*(AE^`tgR;(nvoQBTQ^Q
z6?|rid+aWLA<#6}AF-7nZ|vsLaP1cMHGGJ|PyT(f*>7<yk~#J@{c1gkThwD@Ztx&-
zZLpK9PRbyNn+xi5hXrLdi$GAD#X&}9U@5EaGYDc*0GW>3uQM%`c3~>u<x3+6C|Mjp
z@$ziNDlzPk3PnjP&%v-wnPRQ;^>KK<0>#Vo^@bH(I-0nyhG#2KyaKke%27vS>+|qz
z1&UX|R#r)C5VnpG3(J%MPM(4khMfnhW{VEYt@=XvTjszq6e<_a6ll}~<u2CE-Azbd
z*4Pg_J6TgWC;+7ORLR`uwuB9?bgsa^QgQ}U;s&eCYNs7paONEZN5fBmeR+OHgH5D*
zAx6XS6JTGSpN9B3Z90~l&~$htoD@*#XyGp@etJ#YPxKB@kt)6Q{GaGoa&7O5g}qBc
zedq?|HifeiRKY?p32`G7l)^6WJ)%fjj3XQ-X2%d2mG^s;$a+^EYVmPfEMFEQl{$aY
z=qUny2ECzAS}0>&rMiRrnMJZF8ryduu?5T)fkXwfWPwDA@>VzJjKmrjG=W5Af^xyd
zJjADLS;hko)4Z`-SZYBK=~$a1>Lng1#Wn3M9w-OjH6AF3+9n>zAoaOAZR3INh@0Vy
zF7ZIYW5Yp^IgWQQyoRBJ$NaxT5n?-Z53yadI;ZLdRfJvL*=*3hw&5vv#LfA&2v5BP
z3v9zlEm+Vlob&=run+$9!v%}r&kJzDI#kmS6D&eCFTn)cz)C+%un4TY1QTq-Anr_1
z@4k8pgTVgTgh5~d9l{_Ipxg|WVUR;-Lr7temotU70gOJU+#-PS64GxQd+3uD2omsA
z6ZL8EOR&NaHmL8*57?VE_T>h;xBEOlXT$S#t@CrxlbBXLJP-9d>e}W^nm|$AoKfD&
zStV7|l=NUf4)N6hcCvnCUfJw#+RaaPmWa-h6Tf1sQ=2*#Cewy;DAqt>V1mmMA5a*Q
z(i8)R1__@CN8Ra@K7|a~-Fk}}%_$3Gg^!gm7U0;0u?kA)9msjKPUFS1zYXTNbaxMW
z5DsG-B)5bN#`7t~t=LO}ez2bNbO2%|L1mFI3VzZ5A*p~eu&ip|dWiIaItCGU-GHc!
zEJ+sw%klH1FJZ9!Z0N0X%90-Y@S-W#0F;!2#n%>rTsB<vlcQ0P#Ug9yDNzA7+q!l*
zwPIcD@Txor3$Z@(>b5z09e@pmWB*FnVB^sbz=p!Le<f_Naq!x)A@k|c*{>dLma3)j
z^i<4H#$Fp59~L0f_zW4>`PM2w*p(_D)<QhFFsl44D#n;Jr9sz~b54*^Js(*S*f_L<
zO?~0ns;2(P%*fuAvcSsydzm-KeyOAovO@{ANjf-rrBd)!uaxk0_e!ORrlMDB6PhK_
z>62HsUa31yt@&1XrH8_ND|M8h7;r#j@Y=2qRLF()ExkBx@+oAu>4taO+-HCS@{pIN
z({`|R+T3w!XI<g6m9u_iMPci-^~?r^)AnL)uyxvcW`n|MdoecHI&JQ3Xz#R@%&=65
zMo&qt5|6z2Y#pUR*sXAsN_HQa8O8@V;fW{F6E51~A-a`#`I@%!7yjENy;c~$S>9i7
zmT~wDPklOlLZ$}K=op>jj_G`}@`EspcDv$Ao{uXi`fMQD61X9Tx8#6W&F9NBUPUc$
z6rQQC6JC$f6?PxDZw<kcF6g~8Sl&5qAN#oL7bT{Qr%tH6EYX#?m4&sd&OZ)1Fl2pX
zs22)oz%N6=IOD+~iayPQ=a(S@C-8JFETdr^U^;GMO4=p&^N~5A#jQxT=7te{FH6I~
z>pkoAfsv8XPze?eE)_^MBzBZkya+S$)$tsmXwi%CA-gTe2+*@YY2im1jQ!S6H~!k6
z$M<o%D+4|(Xe&*{QiXG;@eSFANlh^6`BHXcZWz(jCkT<23JnJ{UGx+-jwFzzAN2Du
z%;0Hb#Pq{M47;$~1|jsr@wEf|L!x3EB_YmFUV?&5m>)L#<YguzV*%bddpR0#l*Y7U
zyxzlTzKA?#B<v!*Vm*Hu5)i#1E|6{<zYGO9NF)lN6c`nB-uW_wWUOH3@<k~KaNzqw
zJjfPi?!|Rq6@2R`tFFO*kpz{E8;66##=#wZ>y1MTRJm)^)5f6#1wCyXT2Rpc#-Rlf
zxnsaLFS?Bbw$`@$xE6E_v2kcYhV8~-SZ3s_qo<8S3qDwE95NQP-Z;2Z)yKxc9c!N(
z2Y2k|jl-~_nCl1A#$i}0Y&H(VQed%h7?uFLjl-}sSZy4RLV|wdFf0i+8;4;jaM(Bu
zONh<J;V2YnHx9#6V7GCwq@i7M&YAR}9VxO-#|`aplX=vjHwD!wFN>YE00zW514acW
zJS3YIQ8}fTfrlKnWpO=R7<bMtogx^CRQ3xW>8;w7WXkv0uMbJEWl6R37;!Wdq%T9E
zgc`%y;G_(NKjy5wBKi=8xHZ4ovM(gZWjym1XI-pin#50WfE*P{|Gi+(<4N;76yenm
z@hQ53l<_u*lNk+egvcrioT20*3NYIE@FWS`RdLCQl1t$slS13QYdhRZDdgx|N+A+>
z+DV~1^X#P%5|-6CSl#WCbaM!Iep!WkdVRRY3FD*i>Psc}@s&yVK_}sii_JJmHwpJn
z5$1}Xvudgz?yy?esTImY$E#q;OZAuzO;tcr1a)^f?B4l1)KoN8`jk+@c7Ay|z!v=}
zrV#Fv#NR!y?l#LdB(SBl*~Mx6grfqKuxtxt9o?h)Q3oJ2m_-tV*_l%tI_NBXyV+%l
z#BCv9BrPF$eMnahq?2?JkS@|i{X0rmJ`PMsd+Ex7bds)oFdd|eKy;I?970R!I`pBt
z1R(9DD+AJ6y0ZRVq)Qk_d+8E@w3jYnFm0tP1JOac1PJY=D_?2tEhEUtfpn5C0@6jg
zsDDT4%E!@3x^f_$q$?jx2k9aZ-J~mr;2>QWrQhY>J=00UENrX7^swAyO%2OQ<kVnX
zB~J~>-8Iw0a+5<fEE=JUII1BzN~Io9XW`7(tD6Rt6P3g2LpTXm55h@c`Vr22aBkXB
z&!|3xGaq4h;Uq}C2xktcn{Z|Zo)ki7;S^wX7S0S-SK-XS^dOwV;5rMZ0IRcb3M1?&
zoEfC<!YKgiES$MQ=tDSjSbYd5!RkRc2~0o2nGdcH;ml$6A)NULy9*~l>P0wnK=#6U
z#avEGvg`aX)Ls2v!wtJaq&%1Cgqk0Ofb2X)_O5b;^pW1Bs^#<(dEV)M9shVA`P(#^
zg?P{J`Uyt?H#kQ4P5sFRvQg>eWxYusSTPer-5Z=~2#m$-B9AdhAEE?BOBS1Hl~_&~
zZ%>6>E^ugqH~a94VVD&WX;-Oddi%A{|J)efSwRW~UNy(tg18WqkFh+oL5aSn2J>(e
zxZob$@xL<gPmh9bLv=+_EA5(}EwR%m<a8%E`NAO&tDs9~Q0!qSB<y4U?{K&^$sX7=
zM*q`?WOMM7J*wN_{u7=Y-y~G{S$}BMN!H1QAxY=i=*?wDa$S27hYz#<tf+Qubr1x#
za<TyK;kz2lNw`FIa3L!^e5_pZ?QqoJ2W1mUq_lf&?*?-{9n<r3Q%G$lxavy<?P#W&
zrzm_x>)prQzWef>u-Oe5dH1d9Rjb;B+RaAs9$_|D?HKgb;Er-a6-Bx0hd;1Oq-NiL
zbhzkm37U>_T|u{;QYi5iPOg2r%6Y#oWu63z=I0`R><XvUYdk)&PG@&4yw~>?PEyGB
zcSqHtEode8v^$elvNrzis9lXeGD{l9<xrZhgVFd`%sC2RwlwF5Zsr_gxbi9M;0^vw
z%J?n&FO1r6`1sS!$OGUJEHJQGS>P9vSz5(a#j7Z}?_x=%XY^#gf+an{kZuy1&1ok~
zYKfz1NtqnIj3u?CS!YQ>y{jd)#9CO=P7LbVk|O*tlqKbnjjoo|lDVWm2eG8JbP+Hs
zf1*O^!PH$9_!Dk@_@p@Z5%3t59VL9ZXYH}05MExWwr2?Sw%IGp9YfqScSqg6n#@{_
zSoj9KBpz}Dvx=aPR8InTsj0?PdBvX(BAb3zK(*L+cYDU`_JfZ<hI`sIGb7DZtl9{;
z^s*{v#}^*P$2$G$4W|`>OmRqaIHf8DtWZn$!9}_y&YZ1u59rM~$^2m|$UO2fSruH!
zJQZ~pWuA;BpF6H5t1{oMW;?;1GT-#;%s2hZxo`Sc9G8N0!mCRGBWb-9dX+TUQqXve
z>ZNeGLfIcYH@(B_^%n^DY_<`?f26SL3yr=qhh=zQu?n&s?tD`h$8i_z`e2wi*h>r+
zudVGOV_}PeLx&gS(4lz4Ou->b>17cCn<>HKu5w82$RN)jXGu>e2A-vkgjYy^PN~dM
zI(;`Xh353#PhGnooUmVHw9nkSd3B<z-JOYkw{xPpfxgz?9e>;rf3?3m{@uHMC!u*)
z1K>_U+?9eF022k7jzqW?b=%&Kruyp1=TA{c8}@6c;k@SprD9T6WE4PlyNzG&>){oB
zcsyevN+alYivDf+aO3RV8W&>tNrX~M<V3UKB47#quw2qn30B~830(mLgnyo{4e@C+
z95T`!;FOMf4^TSNQfQ}8T%I<=D|%KGlTj9Q++{kxswZtIF@vlsubyC56jDzxt2(A9
zpjEZe326C5X2-Qu0_rNj*>lk?&iFfVqQh&2-SM`In)HL$eV5S*uOx`oD?A=`Y;P1Q
z^cA7T{@`_`PdEtUaW+{^B58~UZ0^Kq0W+5w8D{CGq9@ERuu8Hq6XqkYlP>iMJ56(m
zc$it{@Y~I$;6j?bU;bn`_mxHGu?u<|zLxOa1*X^Gxudrkp3*lHBPBfn5<Q8JKm5jS
zqd?&bU1M?cVA~Xg7@C$_0K0}}h=n^|b>t1;i(WMk*}7ZR3AXN5^K-5H)m&LaztYKs
zw`$$ig4Z2<P6HWT+)5kJ?ewULd5r3oM$bTX#lPZL#!S@IyO0azf+h3f9J^Rx5j>(6
zzL<d?0eA~TYzKT8>FMS)87ME^lm1y=!tS5r75iu!qi}#glCCj*t%H1Ya{iQs|H_O{
zlULOq9S;6js$sGZQy=es;%QbBGVa15T>)MkB^B!v*`=Pz6w%L9f5PLQ?13t!7a=$X
z#tey~E#8fa=lUrsOmfAL+jpyk<LtXt9RP=Z6%W9nU)2S0=vegu%pKbsYkS!4>)#G`
zJB4cx+ui9m!WQh1yT)~aJ^;@JOT=lHRls7u)X%BmV%XB&&QCHzFOAUvY%hTiz;zCM
zAW<)Y4<PHJkv30|V5N<XE7l2zDqT_*4Cj8_Y+i)?9Ve63Y;DoS=O%C7o67Cc`7=AT
zD~|l9$KXOU{v#p8CS1|zc6crHi%}A_qv(x7x<>Tk+^>^i#rtZf7vp@L3>(@j>t2jQ
zHWD%_?x79n284>ID8>>8S2prxR!Q-x5N9(yd(Kr|-JW4r+~J;KS6$|wfmhvX8{pmq
zt~D#A_~L3pLP@(3yqL0RjKES)%gd-BFXyEfw30BZiIMk4jO}#}%kq@glMIVT8(-nD
z><_aQ!+M>wg<;vw)`Z=IM<}V#Z<M0!^xU0sUgft7tXy`9743mytL53i<Gw94a^@SP
z`%}sucrM&0WO+xuvB#Zk2lik`TNNCaXo8VFLkLbMiraC<eOGSe%wU2eu*aQj8}_Ju
z*hwBdC?pE-I^>{w4S=G*p*s+7Y$K{05yMeMqj$|2ckW*Gx1GD!Tx#e3HLuy!zrl6$
z!L)RyfJeP|uSk(MS_PjXTts27bPpEYIp>ulX4jM#&K@CnLgg7l<(%TEqq5mUoQG=I
zn^>v6AE7^Dk@+k9Xn7p3<21`O*DeByBUc_ytEWbR84gKD%;eH&g+hjzdw5+iXFg&Z
z%pJ#^xp8{TI7BR5xE(Gx;2Ih{ijILqlVCP{Blmc`VJc<A>b!Av9##wANjqC*q~87P
z#pn~Ly(R53=W{98eRtCIb6F1B-J>uL+TaMejoh6+{m3g;iY-Yzx1tpgX^$?kN`2`#
zDLTlJLoaWXT|+{F<jqQQ7YPR;E`!#<<L+B$cx7TDyvx3z^+a3YE>u0vJ_s#9*WA&5
zVOM?Ceqq-f*?xi7yxd-aSA0L(({z@)dj21~q&NWFER57Iy_rYVJ0CKCsSmiFGCX>j
zVS$1cUPzBTfM?L6d`+J`APQQT=012(Nw4k~U|$xaeePE;bJQi9yAOsIdD$)8)?V?y
zl!WHHzm~T{JF9l?-s1!zTcfU5;Cdq91=UoS4Nfm>P|VTl8DLFIsf(Uewi0Fa*Qq|k
zxY8@%A=xJ=w=d{$o<zI&Cy`ygH9v(i7GY^m&AYM=#9-k|4@D8@(JoCk&pyv^3x!uT
z9TLgk8H;kXPM|~7C)lERk|__K#=<Lk-vx6&40dT*&(~ojp2q^m_sh*4-lMhZ2nt=A
zL!_<1a?wAv3J#d%kf%Eaw@9f(s=rOZ0r)Lzk1$H<jJR59m090<#<1jA(~=lQI4H6T
zMC8mHJWi4$!l|vHKwzfV#`Fr9odkGz9yyPsP>~uwcMhtMPx^T#o#vU3eq5{>?mAe^
zURHswI`tp3+WS<#Cd+wMn~8Q}6F!l|UEq0zIP{^y@Q8!|6i0_yh^d%Pi-8zeZ5%Rc
z>?shjL8AOIe?nV5zHH*J9s<0{%1R5N?(?Z{n+%P1S?yXr6eFVO#}<oR9JgdmN@rEN
zpg+<>+lCXbdVM>@omSf*iAcd9v}l*tz*uKCG+gHST_&;#o3;OwDB1YC2Oyjqq#>Is
zupF;jtfSAVZ@RZcC%esz?d&8^eIm9k?X2}mBQex2vv2u4Xan3$a`o|Q$@q-MM%E{D
z5Y)me>ExYKrM!x$Kw9vJEQTAT5g?^_wqZx5WHYhT+MNbD?4&81S0@g`U3SIf&f&u}
zUl|U3L8;U#hpEzKD-Huvox=o6JMJvzZbNy|bb@J&chl9u26Bix$5{e^p9Xjf$D}{&
zXsF`qnSZ?^WNNk+y%;lhVX$T-^3Jwh>3uHN74H#ES8jc24%5vZPI5A3jIpIP?{s|t
zLR(5Xw&mvFj*WM6!A7Mr5AhtOQw`7Y6q8W);I`%3c3@XPwGQz3&tZD7MJDv&Qx;yc
zuFBi98JX-b{`&puPH*{&)<%6$wlwP5qA3&CTm<Y!j1?sc+jR&YTggq)k&8g9PA=F=
zDX>LV_Q>SMwxb{eVT(Q-n@MhD_ma@lm@QPji^H?7)J{nQOKww?^4#o^ZEn>nsL`b&
zQU(s{J6lMI3V@Yd>N^+MZMkLbQB-Hq=ugy}yUrpkvg<4!rWMO<J^MvJu0Bnswl)Eo
z|KenFn;_gxZxe>76%7VQ-`T=AssLD-WPRs0*h|I9)~;Iku@_s$cj0#H-=&*F=$AX7
zX?#uZ_wk*ZpXx12V+17undWw#06~Lu%WpG=0|GL4;us#gj6op5&XFiGH!4XX`AS!>
zKY2eY62HO2A~#6OAtvIP0etX=<^}%e!m!<vgJk*u74Q3l$n3;^y?clk8KoiKPrSiL
zFEDcY*o(N)8db{a^-mU%b>*5zYzvl$;CY89Hc__asT~}e{AIMhPagz!G0)JMB6@Rn
z6@1RY(Xe!T)q*wEY!u?Bat+A)I7nUvS5@-Z0~dA4Q&KWQZJtb{9Kzi?NjIpDFD^+~
zWUQvg$Lq2JdSj6)p?e7H7tk5(D(Hg_s>Q@r*dSjm2Vwmw=@htt;S(3Yj0&j-a3So@
zh1DH{T>}lseKMl+BCoJjvdEQu^e&3|UNsC98Ac4WZl#pKDwE=e`-HE`GAP{u<ti~9
zluw04YUQIGT!m8!G*?9=`W6U@O0!T-)r3X|?NsepRZs7BEiGdesC=;lxRbT5!tA_m
zYT(EzcD9Z+812nt6_8p)Ef!4`6nm7tW+1JksrrV6G00LF$=dT7DtUUhcb)tSK^2Jt
ztjvFN7pV%=rc42}lgCvXy+j>b&0v+PE@D-I)Q~I2Ia|l8KDL&6s*)V-qNgeyYjPFm
z65!~;zpDVPNL8^Zco#d0Y6WIfrW~F4Dv2#6s!CD^fvNy%$P@9*TAV7N+Ulul#=4U@
zRhEWIo}Bemm7t1533|#|q$<QVWy)DkRmp5CRaL6Gh*bqrL$2KPRBdcBJ*C#dl!B7K
zLbgvAmw4E?kPTs1#h)gGxLd{yBw%yd5TO=IN8AZH5nGiF0k)mmk<jTR9J2n-av=dC
zii9vI7P>KL90@e3wsBzdyPaGpT>a$+X#lJh3rhz_2Dfj)0IA(1g8+0F4M6ErHi)Q>
z3gca@5DrHtr8$YQK{)KJiVSY=!Vz~B4glyuIO2YV14KCr2ePIGYvP^H_`R=QOo{@w
zR)JXB6$R+7Vxj`;vibH@K-|Se0jY~VQGo12Y;X;6FtGvbp~MEDhY%YA+gWS~NIzl&
zNPUY95!Y4QyxV=a!?jqc+&DWc4cX41YbD3lV^IO`U3M~}I|@$@r3dNBK=mp<IeC4^
z59Dw_`2qCd<cF3JWhxYhsKVC4az7-MOM=@?`OpLrl%C`Vpn8`dBCoUj#2WqM>JK-k
zf<xEKkEK(r0^Yy;aH6})PX?tA`Qf1Ym7k2fKI8{-DAzx|$Pb_oCqJ}=de=W-Ey3-m
ze=;aN$qxwXU4CegZt^oiPL;6Ry7Upiqb-+Qex$h<>L8F3xK@1Z_FGEW9i>MN*F}2N
zP@JVl395tiC}H*^J%|X&)sN%ZxPnZ8*9wrO|Ez{Sj0jPjtOpq)FntLTVD&FWL|`vU
zsIRD?YNGpz4XU9JBu0*LLJfVriBYGRp@u-27^zc^kUY#U=isIj*|E#nhez*xTHJbb
z>v=Y^>4}6ecK3)?v2#Nz?P`TptS*GR<?Jv=Ik>VhyGvl(I4lzUEg++@sknnkMt*g`
z0<z7`zY;XA5RpvdwUl@jEdA{!UT1F|s-2XwH?9hF=$+wCA2$14u%7SyU9>gj`ZjR4
z><!#xS?&|u@Uuu&uApt#F~gW9`>3o{V98{{Sna43gxXzZRx7DeZvYovsyEZA@QhIX
zbM|gc^#u&+{v|^&F1n<;2$nndfk}F*N7i`NB)jm(E^Mju&15gj<X8WZe`-kPmi5-(
zJRXgTl-K<_{_#G_u3$j#aCB-?g#=fAZG+O^D|w*yxv~l>jG9C?V56>Tb`q~)sRu0U
z*JW;ux40TIWTP(0-sZ)>d@75P7k?&$6h)tQCat9aaF})k5KfU!zuK(RhxR0Ng%Hvp
zf|b8rb>Tu60O9n^_dmDB-k~$Y{G%?I+jeG{!!DTHc4nB9E|{~<YDF(BHw&dnDluQ3
ztZq=VqKCA^O4SOor(m>KbVNL6EsAB86D24N)ISN<!SWgP&_Y&3skk?;w<(lP!7gNe
zik=UfWL{i(nBg`~`|+Y@Nx*da@zlS;Lkn;H+pp-)&HIm@fAe^!=SsD9iY2GVcR~26
z7z7t4r96=Kq<53{TiT|q{ds&Jr@Nx}4A;D;)A$C|qejuqqsUh(qoc2EMHiA96LpxX
zCdz1F)Dv}(Oq8X2Mjl%>QRJ=lF;SM7d!4AmHK^}(qQdN{3vtek_wnU3&R?z&0U77I
zD*BcjEgm-kcv3-dno&f>j~BBa?UE5}X}t4sofp@EP*mp-By&Gbqa=XOF(YZ7JO#^r
zge#2`e>$dDRjEvru~L+5$hr5dU*0&fDwanYt+xEh3md<=+0mfm<fzz;)OIzNTE>7+
z#+2M`b!3XrO?NYt(u%6wG|HHyM-N6$z3-IjL+tTD2gM13H1c78P^HFjxmOAY@d7y<
zrS30`E~?JD_yWB7aI%y89Kd7r1<sRA3ci&Fiwrhy*&dQ$%N93`IMeDr?g8;Xdhx63
z9m~ZqffCu3M3C;O5%J!rIa?vV+-^{uz`@>I@C(ZZR<IqvEcLVnzl@8w$}daA&ircR
z+Ln7-^}4FxK)@M<d6(bl6kBw{iWkmHi|kZ0Hd#lU*S6@GWh%Ao*%BwuPH2OZADbI{
zDvkjxW?#`0$470E+K5k4z@BL=r<YHSWaZ_pc{$6h(2i323rg6Mlu{yHtWY{eN;;Iu
zw};K?-k?Bh6s+#{i_%AIO?O#czQy#I7~ToE@t`Dksan*<HyZDf@&RPU>*0Af;|Qdl
z7#&s>4vAs^-3yh*%iVooVW;R0K57r_w~gTTF+6No?1H_0AhV6?_JIo_SYtS{Cp_kj
zOAkU}6H@MJJUoE>@nL=GYpSXCfvh6w$3R#W_hVqJ$ow%77J`2yWL)}>gp41_90^%=
zkfL<?nk%4%JvX^IQd0|myo0H2L1hb5>yD+fsdYzLQ9w@0&K*}(_Y91zqIL$xRcM^y
z@w70t?i1C{)V9LY*3`Nqt4O-L0(D1N758IctjPQ^5Eg=eBxG$(t^4E^OW;T&Gnv}*
zl{OwpkcBCvL2C-Hm`rRZ;C7J&df<-Ff{b$ZOFg5`CNNY|-U7IZEtz`*(*3(<$}ep3
zlBhBK)I`!^B&Io#Jh*En>=gUr=y|(ehj>DjU0rhP!wV)j_pyo$UzD^JbHgqy8fD#6
zcQtZR-jxV8ijul(8>|^?+hDbw6$!!U+IFm2SJPO9XM<Y=OdX)}HRkfzr%{eG+DXy1
zP|=pO52Z#|(QX&qM>}L97zbLu*J*Jo;!SeU#X2=(Xm%<vVJ`~5s(d{W&!7a)c>n5<
z6_PIEulk1zuYx5d15*OXVS1VUML5XS-%n_lIYCE??7WyVuJB4^K`OsGp-CUWxpuhO
zJ|pLOvz^fy^M(I*8SL<!+?(b7^=27|&(o>!9wyGdapX-6uVmI%<tNbb^>`b^loW$3
zH9VH~h91X5)*2n1_e$SEN1w_Y(9@@hQXtQ7NA=J1DW{~d%Hh`Z!{ZsMZO8=S`n|Oz
zHNi?DYV#1<zryOlWqq1Qxh$J<Nje~cI3^JuJ6kn{SUCwD&|$qJWgo|K`!Mx`l$Ory
z8n0b_h%sf;CuA&K8Q$fi1Q|OCz-76DgXQ`pYzB=$DT>==3{P>tSVYOJDGPW>(Qgt$
z<6yE!_eG|UkJ%HA1MqQ#I{>=_vSaXkf*;07xL*cIM(&gmS04jtV<~Zll&^ZX7DG4s
zPvh0*sZ`HQ2jUInrzqJW%P&vmyKZ7;Z(g$8PKe2+k9x4$)yGnTJ5J*yTt-1s3XfiW
z(Cw7{nq@8Fx)#!KciSKhAByg5s7Q>$@RQ{xn6tm55Aj294_Go1=7zPzqoYqTUI}LD
zk)AE<khJ_ZTV|zcIQ2i$tEIP7vJtmm56@64;?ACaF4up-o+&L&T38pjV;9{gxNgUE
zMX*k1cWgtzgjZv`WY4k^z{+lvQpr##o4*7Kj1VGSN@CTv7#f#bSa-LP2B#yWgzdhm
zG^~24)I3GN&vICeo+GKhYNx`l`$nnpp#EjKei9dmO<O$$5RL{D`pmI`J9AFbdrtp_
z0PEEOOe)9i$1Cw2R3>pvA52OB(>};7=6}#+bdJ|O=bM!ugdyDSLVw}q$9n_QasMo%
z=RPd`N0m!xL5^|w%wm9E><x-V=Y)^vUN&Zd>ku{tP|6<-4{&yo0VEVQu)D}Wt9(O)
zudft#a^kv49M9r}n7<B*YmhUr#PQkYLRVe)ZW2dnyvWUl*O_jFmA0S^StROT8(z;;
zbf0(Y9#y+*teQ0aPQLFWQB9*=N>?NNXtOAmxoHRCNs-7mZw4gl^-v2!!sExCl5}a%
zleJ!mTDkV(VX_vz>~Lis!g!4kt9~q5OL!mb?QW~a{92P$(@P4Zra|&-)td4!qa+Tk
z8js1;TeU1AN>;7Uu*KCk^iD&%#e)R-T{MA19U91}wBIIFu0gM+MEK!4O<d^VuOHjP
z=Z_`Yw-1)vhroe;cJt4nJv$JvZ-4&T6~WyySbwrdFbS5BN{9B?C2Sw`?X!D<xT15)
zp5yj+F>aS)4s_18r>gwYsw0(PF?OUgZF+OMQTL@?Pb-`-7sAy8dS=0htlkBQ?e2YI
zb068|28t1xCQjB5dfdHVb|<1;$95R`jffT)`Gp8mN5!oM^Q0>};yOf2l$p?|H;TE5
zq%#c9kbYgX#Rk;W)*I*Yo}U7TWi{Fs-7AmUxnr+B6V{@C<@uf#{dbioUs?dDKJ#J(
zkVjK+i+8ns>lq47)mwMDuBeasHZkD^S*@Lx_UJ;O{u;g%9imq)dLgoU>QC53py|?n
zjJ9)&S=EP0v!S5f&3jN{LxBTsQwbpvI|Ws$Apz;O3eAKwMs^j|hUk2NpvY>L^7exZ
zQH}`JAgl=EvSOSA(yeS?Q=Se36GpFJdh%{vnBa`heQ3DP-ezd5+YyImVG%R;7%fd1
zC}m623NKu4#-!DqenN`Y=4lvZd%-M&%We`Rod%qOIyToqSxQzF&CqgH$7UQ9d@__w
zd_ww6#lJF%n4+6W-imG&cMQU(7d&M*qt24|wC76A@3Ur0t)DetYOjVGmwGY2dPjSV
zRnOFZgw=iy_^O_)1Hx)Y6GmlZz{pf}&sI2DU02gEr8rqnBTi*J!aPuQ*LGO#hAPEs
zHCC}$r%`K^jhWWftC+H}#YVPlY+<*Xl_62D$i^pWRCr|l2DFG0gk}+vbutQ1qm!jE
zmG?U)ODx>4=7ifwNnVEs_2Ia5Xm>6}H6h--3kR(67_FxC(qJy^dNh<?ih~PQ9j~lP
z3Pub!G8xKT4Bd(C?AYm1=F)*wWEbh+&4=TmK$clLuz{bW%53n--=>LKu~eI9soI*;
z*Gl{G;UUP%f2)r<5h33_1W7bUY<<5rm%pO()Jg|a{<w$Yi&+OYZjPo^FT$NfNOD8&
z9l<h$ZlsvUNX5-MYWOIlnKC4(aOE5nAn}jlLFpAc?TgoojaGEA%ywIUwNC}?$|)%t
zpYPWtvC8HiQgetbjsOu17SB?TZTt}I9%g7J=50?AUD1w!vISTB1b;@T7>6v*^qIkV
zL=Gv=i^3%#)_WH?E{pHi$TYpVe!9^&_2{IPXUY3P!g7<e=U+9MG{yO)f?@1bSzFXv
zeIP(_I$@a`U4a_?W;G&{PqQ|W_A(K7wp}H3En>Avp0WCNn|%^S#)Lc8>xyni@a0nU
zG^|<bH#%MKmrK8f(yAk0pNn9>Ox-Z<*ut)LWU=SQ*!5G-25^bj1E1I7L$X=p_;!wm
z7&gm-9$K)${9zNauUXzzrqf^&rpLmG6r&<xUxD*czet@&io;GSI$5N-tHyf$#4)RN
zm<4L=uNc?wNQLrKbQV7D0+hW4u(==g51C|wksGh)(P!vLt$HyJ9~u4R@SNhrfPvj?
z(-=1yR2&C3oqjdrV{4)dYcFyN^`|jrN-i=7!A4yem+2z@oUPs?EmL|Lq*#`nrGTWW
z9Ks0xOAgzQ*X-(A_^?OD%V6uD-Y*i@yWPS**XT}S5K1aXKi=a`K_=pL<7A<rCrCcq
zq|nY`b`Pb{&Xhe6uj3SV7C`zgOyVu>>WwIW9QLo^-y%U8HRqnqG^z2CPs`vS3vvUu
zazISZ!lkC#=xeZrs_vh!(rU`5Q3t63cA9f5Z)T)M&a3ALcFj)CH2`}ObFG52n?pSa
z<Brs<u-VH^JuGRB*2qR`6fX@33;ELYwi7T70LG+T`Iy`T&nsUl`b1YICfIqxt8l1X
z#imV1k3zF6cc}#M4CYAK5!C#9%CWKHlNpQ~x8Nx*<2w}TFSL89l`M3-1v#$FqWx(`
zQfWO)qU`)*3%dHzGK~$AonoP!RmnEbS`6q`sS1FT0B~8?08>n#!QC~HXQT2=8p}M#
zq_<2^bey#5-w*(^vTSrQhCIxMBny-~?0M7y9Ii2KqIJCGB{_!{!8+kJIi{1zsibbg
z;`Sz66q$$+KgwEYw}KqKWu$O|%k%qW7vlmigN<FHe!Dd)6;Z7#^O0Lq?bRtUs*FYt
zo4ILpYRM<t*`?)}>FqkZy3Vub(a}&Q6UKR~v^Mirgl)yw?hZzULR<b;I@!(T$SY^U
zg@cNIMqVoV*>F|S)s{Jm?sjZax{S8nv5AFy>TlM#@pSXU)%DZ$*H5>&t*=#HRPzEQ
zE4bp+xAaKCqIwO}vHGT`!5qOPo0fGg1Ph|qhYf{dG+PysHNzKIq7k-Y#*J7M{fzjy
ztuZcvtQqI!ZAwKHgsMq&u0u>-A1KC&f3ssW1Y-~^Klmwq7qDM~<}dT*HFc%`G<wmO
z)NdZ}Huz7o4Zh5<f-aApNBMYxi=kCJ1A@_JU7&{9R;)CCY@2|w)Sxy9z|d+<_;_ny
zHu}-vYHcz;)V`JWl;9*T)w*W9t9{!9NIa}HLf6~$BAY|}1+4V0=md-hb-`d>aG(?&
z`OjrELHc{;Jlh*ZpSQRXic&ynu#~nJ&{;I*$Upv2K|6-U{AdfjnbMQfRHzsWK*kkG
z0p4VXI3+u{GP?!!=9pc>m4+&YlA|~e{xJLM?e(?)=Bt_i&70qx-d?|Xi^royf^aIV
z*QcX1T<XO`)9c7j52%R;TM(`9<8?IS=gJ=*&qre_k#%)J|Mu{&(d7JMe0g^6P4E|w
zz8R0M##iSTqbvG`+KtZ7&aXz7=i^gqLf?*0N280g(~HT7zPV)o@<!vcv(e;?9bSJI
z$P`}n{!XxUyo;i_A*mU;4v=4*+8Rbwl`Er#YczKj^kSJ>2|C5_O}@@qR(oY0J;h;^
z9ncMOqsObFGB4U{`+U`^;~O;u7f`_ossx(mu!;tgI9yIv6_r_!VwZ3qeMXVQWRqZO
z=&BW*L;5N&>a_Dt*{?o(r8Bn%D(Mj68GK-|sd=g@txZW(be2UK5&WhT4uE~CC2V}R
zo{A;0ZdB<p@4?;;R*M83F0QD47+yqv#+h15k=`X~@^FesSoApxS*bTTgFAXY5nnUD
zw1Ie#L*zGu)oz?8@($8xGs%|F%mP-X-tedn6^Jm~YgsRwt)y~0=kRug47crGR7kKY
zhikc&l;QO}+V^E?geEm31u)42bX|a)@q|1}5SLljqf6MqlXSA0a7jPw$&&Q7oGVFB
zr>T<lcbzF247Z7r35?mrkl-yl5f|=}T#y?SvUI7+SRh#t1$C+7Q@p;X63z%=*NXts
zmrmDuDG$AfMJ_mOD4gQLah*ct4{)8b)X++o;Fc0#^+}^L8hF2a*8xugNyn7*egsZ6
zk(Gm%(2)<W)~zz|3QIDNW}tblqbg~y$Qrw+o=;e9RNUhlioOQ2lETJMX3=RZ3fY>d
zFA1cTY?oAY>G2WBDb(Y#>})V#4g2>Lsk%cl5Xz>O2p{oJHe$6?)9wQQBv~LYkk+o@
zJerEXVX6D9eG#6Tg^%Rx)KyAl=gewFUcX1J+B2$8N&hxfMx@0}WKmUQKjcNhOO&7$
z;oo<gukS)CL6AT0OhvsX{*AHxWsTNR^y6t54ltc?O)1&ShPAB(5*inxJ~61tR-h?S
zjA(~<j{@x>lGNa3BZ9I<V%$K&UtL}UOh?Wx@NCR@*7r*C&Y8$UTCqXdr2b}MG4&Mx
zrBzk$T1xvc3#_&X#)T5N!O|Ll`}yv(ccx!3&Mo4^iR;)=7F-wm4$byftMNQu@1i7y
z;Tb|r!9&fA4iL~k1I#}BnjuIRH7rrxw{VSc#cc?76cd{3(!L4z&V*HArH9zAI@d#d
zMF>Sx2eR_5R)b(D23Zg1^aKg+lI3&bu(xXZLGX=gJ1aV}<QR@&QlU4V;IR&{q{&6w
zJz!V)iSF!?chGqIrDx8a2iq->3^g(NyfdGQYr(#kCCWk}l6`ITv|Fu<+`qvc$e}zO
z?j@M^J_rowwza)E9h>(Et+<q%jA2wqZm6L<hOkH8sB{zUv^p))T&pw3^pz_0tL=XG
zfXc?WK0Sz|kf{zn>wPclYzu8#7yay?2U{4K*&AeGOxO!y#=8ZrRy1W8^9RWCEh?%9
zrw{Cfm|-x|wJOb%X9JnN0qqisT=7R>2GUyve4Ef&ZD(5a1#Ji$F;}MV1zg}LqHI0S
z;b0qy(pMeA#gn_LLs+&l{$TJ`dvPwTV~{(%d4*%=-Tn?%6bC4RKO>8JPT`v(8kxUQ
zlEvl*l-2=tLij`@l)WQGskhUD6a2(<s4*63`0G64VV3_CM~4|jf)N9z1NW<F9o#MP
za@u0{qafHNX9)6y!P>uzDA58hjipGgM4B(3%Ch@M0GJ?CbB|P$T|)aaT%Xw?nE_9j
zg-=PenBm1p%w^tc8c)Y8QG<EfZ+zokLB>R>_!N4`7$0wCDf#KrAOT}xSG%TL=5er_
z@rTOjt-ay5(gIQ{I6oj#VHY}p$`yhe!rJcH8s*_9CWDoi#opsQWf1=xwO#0~i9wvp
zd^oi4on))gmSfU)eMpyN_hH#fx_Bk8Jc_%1&yvfn&;Bein9lwVT4Ae@D|_$N$!1%U
zT$~&pOfh5m&galPIYgS(z$b@??BwtORNYPv4^uihJm@E;b|!1d**r)=vS#pys)oQ4
zejX~)%2Yej^(TjeES>7&9AHd2yP#hjPYx~TLwa&(ntJoe;V=uVvOhaabI%=@Z5&Sy
zEt%tda%c(Hlb#$Jxo$o=9ER<!7J6YCABRv=olXudX9+&*5TuJ5b_m<(yy3TGM=_zf
z8)CijvP954IW(;Z!^z<*S`C7s7-T)<CrJ6+^z4KRd#pUtiFm_MCbh-Mp{<DZcXDWn
zvD~u_!mWJXh5bk0%Q8DTG_J)~RwDOr+MFC(&H(okOx%|S_goc-^8tzF5OR|-jOr*)
z4w<>@TYefRhek=#o*cT)iCw_8mGBBDhl4l@`N`oR(~@nWP3xkc{qtZ8BR@GDg8!{f
z4lP%7k0*zg7<)Q7w8WO1y#eh~5wV6NGK3#pz^9Wr<1z_RY#vpQf;ipb0oS50dODvR
zTC%vn!RQ+x_AuB+qBuDmV$~{K)gdILj6WD6WxY5Tc7}{>r}E@bDp?&*4y7<9VeI^z
zpLu$Dth{euLwRyYvDfw|hmK=3o*Z&&TAv(J_m?<1l(M1Jb&e;8QfN)VX>)RD30hDU
z(nCCx(r@K7%8}Be+Wh2j5Tv;|&P-*`(E%a2A=vw#k>ueg$;lzkQ--i4=lRLuAi(oo
zmkr0ZOS(R5lj6;8|5xSmqmSEZxS2+J9#`Oi?`nu!HewkU&^kh*8p`$ZisS6D2s(xJ
z)8Kw;lO#-Ml9h}Lm=Dx8$H6|%*s1;ludB60Ssmotu}ik5Y!FM38`OB%EPPZoxsME2
z^2d11D(+P6<N8tm_HXSV%u)!1shGW6)4b~s)@dBP>U`U}Ev9iyfMGv8isi5<&e<r2
z#X)ni=qOX#y#OJY4~c;0dO0Wt^}4e({8N*>s#io`7&I%QPZWw3(H9Ecis%c6dPUe{
zXt^SKLZDd@Jz=;iato&hgF+8}Z16Hifcj){x(Uj?O3d~n-lX^$?hoFZ!kr<u-5~$t
zB3`G_eS*S=dHJZ>9ka-WT2NJo#L|joLGRf$62pL8OtIW0Bc3XW>h|!b7n|e|By)@h
zsqwflJ}Wmz)2A$95>AiF?-7`|)C!Ey@UyldRh%l=S>-mKEg+5#z-@s#eOQ7R3<;no
zfT(Pfk9SA+XQM(O=(3o0bONH4ZNq16Lm5TqW04|#fA19BKJX-4(?Y1qq~$t1x=dC^
zq?gJ{Q-fTJe9}*H1*(3UD^2wiC5X;KD-rD+;B4ns3XXn^0yT3jHA2Hk+pxk4rxDr;
zBHx?Zj<7<HevFl-hEYPjv0H&uDh1D+EDLgY%Dn%Umrr@KyuaQo;}G{x*+m)zitr~Z
zqC#2_`?+|I6nMP8Ic3@I_;S1rVrX&{R=L2|75~B(_9Nn6XDG8W#)rzSocm}vI<4z}
zw#&So(JmK32t-7MI?YKEJhRtY_|~zYSYIiX6uIk2Dezy86iJ`Mj#Ql$EY6Fi?bU`6
zSOkH^67*|8ZTueF8b1n?X^{#RgdfH*(>8m2n!;f?#Pjr_m~q3^^c)gobGtb}MDZT1
z4Qgbj@pIdY5|hc2X1I#3llEP&+IPKd-}T(NE3J9XC-1cAJcD3l?xqu~D=vaw*XPrU
z|IXukoYv*OkA8ABp4{`Xh51<~%zAs9kGc@%^Ra%sLWkxoVZ=7G)XsK~*W1lbPh1VK
zrO9*$Y^f|+eLR>gt;p7Bb_5NT%hSJYgX)&>%>`boZn7oVoFhV3mo4FzlbK_1;khGd
zXP#TacjdVy*qkGFJjWghf1+S@w_hL!kAeoe=d`?$*uk_q#kK%`{WYFez`vhvaR_0U
zFtID?AXdaKjM3AfBjIe*=Y41ho>aI%Sb`Rmy$@WmJhZ{`;DRN;=%87p;>;M|Gpx$X
zcy|c4INr>wqv9k+{>Xxe<9v}s5$^4=0^OE$odJO97^q6x`8M33Qmf&hr`qRogA2Wj
z<>p`vF^J>2+ER&;MG!CDy6y3DHpgbzqEv+Q0*@4Y+AJ2+&)9Wb#vAVDuy5yaVsL${
z!)2YwCIixVf&ZCZt#BtD#m@b7YJzl%*Do?nW0o<oF@LDw<45(j#uJ*8TKV{N>aX!a
zf?W@@78bx~^6rSiRL0&r-MBDEXl%orvbimD${rTX5gKPN%vi9$(dirI!oIR+jnLH0
zn6fcr%ftFoBQRy-j3Z_VXmqg}V#Y#iYHV39P?L4}p_-n?f_iJ&_LRaf-Wflyrv(qc
zLY}a|cJEq8Ls%1Rg0wVj3L%+RXrS-g(@-+aM1jzf;~!@{upmG)um)Ir*4jZOnJ*^H
zOzStwRa&(aa6w(14m5A;8d6th4-b7DJv{Vq_V5Ucn}>%U&K@3Nar5wuFaM1BJ1`*(
z`~4<)&V4*hie|0H=q!7%i|6Ce8R0xm@jMHc3VT3!lIF+z7-dlq5}wBVH60}5;|&`D
zChZ4Wg5(ghcW=VYJTel9O3Cw$zlwId;6A#@{%aI=F@Z_053vk|`UzA~T#>t@9w{YS
z-A8LY8J9iFfWk9;2FL7;8|F2(>25pB^BjAQ*W`iIn>xE^yo$EU1;vSARqrajnh~o2
z801&21Si>Osti!KudSQhF;<i8)uq1}t6_HY$DK&Xt9{hejl{Xh_u$PXLl&e}aEOem
zZsoQDI*C@>^tlKm8~1Z<mS&bjTOvV($Qbn#nTd!2aZOY_oUg5h%$yUQJ6D-V#&yd{
zm(XcSA%r6!tY`@UQ~0LZJ5&0#h0-Z&trr5E*`OGR12MUFu$;TxY%80W$+O~&O=I)W
zL>p*EqcltAt||qc_0;Vj)Yj0nT$EPH)X}R;DJEA(B0b_*IunL<S%Yofm{->!e+{lj
zg`?dHh-<is*(_k9K*GbX>q>`3Lpu?!T5AkEnhH@8;LHZaKpePXl$vuSNJPQhsA{ry
z<Ht?BHkepaGub;`9Jo)NO51s@PiD$6ozJ5*2p>$iu%fECcsEyUqf?|s&XG#Usy2rE
zB#G8YS~0|3z4QS^8~GrwcFQQ*QbHmZwDS<pf3G)}^F0z1u@jn6ICjGRfA--sUitm(
zo#y|*`8OmtP=TxJI16;;P?^~Gi<io*WRr;Z3X%Oe57NNE7P@Vb_1SHsFkWDLvP~0~
z7(|I7OyH;<<~~Fe84iP<%WmL2xUE5&BZ)rKOGtY7!Vo!4l+R>d4^I(2P(*{`=}On6
zvo4E`FCJk}Vk!(er62eM@|a}S$oC)OIg+0Eo9irX6}NNntNmM+=NWp2l^4w2;Jv;5
z9r%hZl^PGLTk4Ld*J08e%_A^-^X&6+gk}DiK^nRZybETjoQx)Tb17cn<+LT9gs;h+
zg+ypoc|O)&nO|0}C>6)I5WnM7LJPYn!0+#Hs^)Kl^kK%<!qc}O^(4us1505Qe2Vah
zT`<R_NG3$GSgeNLZl%e%jlHAcv8#OI+u>C4mEoOE&77?(X`_l}DN>?ZH>%G@k3knw
z6I*LJQAcX>N$YjB(({K&L^mK^9=gE>Y`0zFAw8scEFxzkb;A^w(n>)b9v@9NDhA;O
zl}@3A0-tVbhH(<^mngl#2g%;zrb;K3k<+c$+e_G1?HX@%bDTp1!_2FpPIkZeC*cxx
zAxd>`@P~#ahAzP~;}7qT6m&(duQ6XFeDd2yc?z(34YpI9trlA@=<QIpkmwO4dh9IG
zD)Q8#n|X=`e{8%$N=zYI%*V$S3}ngRR#9;&>so~!+5J@Eo^GjAvcJg<X{=KfT*Ii`
z76jST{rZqV@6h|W^LPh0B`mYa*`TrKrQD$9CYZCoqYrV$Uv4&A_Qgf>N(A2yV7alD
zc<SLP#!ILCTQ??t<==kge~4*;6sm)mN^^Moj_yy~P7Ur<ebu*Qtzmgnj*e-0E8~}W
ztipJnS#DZ|9i6dP!|ieIVT`tTSKBxWqeG0<!R}GAJ+Rg`UE(k_psOp$kT1$o=o8(=
zF3`3$?XT}EoJl@T6*b*4L4Dk;IltfGW>A!$GwJCP$3zZ@HP3S63!~v(-UV~MF<-;>
zgdq-f$A<?zx0zW)S%V_-EbmWrsO=Gj!uSrC-!<r=l!X;Uhe{Sy&^wDPL4VzCAeq74
z2JgNiTKSU`_P_b*_X%X_bAXZHb!<F0Ec}%oCW&#mjQx%P54|RiR!nY%D_39^xH#TL
zDHLk-8Nneuj)LsqC%9*<Yx%AJ0A0I`65i#Ex};IEir0v4h&_rgs~slPVI3XvZ^bUc
z*BRP-G`?SM?t<m6`HjCQ$9lh~%f>;79EBvxo3ihc2tL-X`W<6lHfBOmj*jFFoB->~
z?=lkU`_uB<tmPT?FUFdE2^&*<RrbCrzRQ|TsIM?+e9f30ufrt5z5+hj=P=q*kP>^1
z1<Q)fn#?0(6CNu~{cRGjg5<e`m4QeiE)S~T@!CzWzkd*j$T~KEz~ub)H*|X_{QNn%
zi=RA-0bp>`oP2ia5P}Pf{afn;z2yFOvqqR{>3@aj<tJHp$Vt7sqBpx{BVs4NAl`ku
zPwD{F`1AFF=mdOUicV&Og_58ts{U;x{FQ=@!e7z$O!#Y9`<Yb!dcPG~%&Yz95Z5%9
zRzl9d5Ha#^axB|DLgP<ylI{b9@7Xwb11Qw|+uz0!(N!T!x#F#S$5RnWW0no8Di{fG
z^HPZN6GPJ8)n6*Tu9&u2Vv@61#m654L-8d|y!dwkYT2j)aC9ouUjlG>1CB`kn}Af_
zpd^4%Uoa9t>5JO<voRH|O5dZ_u$+hb4~2hIG6AP&q&2GCDkAh{yAqpxEF~QI?<G-+
z-#Hy?RuT>WM(irRLa3FQ7A%_IUI*j?;NOj3=1Ugvr~gQQqki*%x50m!ZSW<7eRu@Z
zJ-jM)zlPJW^a-u{5LB?EtP5WKVz2oWdn5iTB*s#M+8_Xfsx{#wt$o?(M<cGap`kXv
zmG+e2BrZt+Hot8GBpx=qf_t8~+}!8+YJwCf?uEe5%$yTgCOGqW4KM4&mV^k5&rTJ7
zsctIYmn)4ZI!ka3B*w#QEYDB`U;QORQ2kO^)ipp>B%}Fe6~yZdM@AQrqqZGnD<)s*
zeow|Y2Z-NBVvRHLd(piUzV}$=vIdGVZA|IXO5>MFal@qY6Ju?KU<{po*`PN6p+ai$
zrATM~rATD{U5&#0>pFS(z9B({zN&G*R8U@JB&EpJzApha1}XGu{#N#@@IdHO{a$D<
zvPW!R`Mzu~a!zPo`MPXf<EhZ0{!7`X&Tyeq<ENt66*>R7uD95f&4up@QD>Vk+BXPR
zwD^usZSmI<Qu$T6mW%JION^Opz7r8pc*572014leh{SgJnj)`5Xk4PB#ZZosgDwAF
z%3eWfX%CC9%2pzdvZ44bYx`@z_RCKHjJ;9T{&&9LJeU3pn_rWBTZCpe2{pilF?P)T
zT*UI|Ta<$G5COQ`$IBG8EZJ9^-Cw}}rU5i5OLt)3E~EP(d<M+B{e8X@qt@B?Tcm|x
zvw~MI7g735Kdhn^^3Smg*=_bo7_qPR@RMs~LC-;*`nv}lZ!B3W+Ls3V&wi%LsUv-r
zXQgMGNk$ZXUwBP8F5e_b?9Mx^H^oo+S6RLSch~95T{?$NDq#rU(JqU-#ln|p&w&cx
zF)_uGp|64^lJ4<#^a_8W2|E>Lng2ik_xX6tei>bzole-){?7OR&FP1)zxTcGo#g*~
z@8r*)lz%%pS$_Cq^wYmEW)1%Q$-nb2e(&TT{)3<TPrmnqzx1!3{LP>J)BoxJ`|tjf
zpZ(K6|6lx_KX~`Y{@MTY|NXOn_@AGgy!qST`?vqz-}~9Wp2MX7{^Nh}|Fd@;@KF_8
ze{R{$rVs)IOhN)75KO3{7ePYGrHFJ81T|DwM2(0T`%=V+EeQGmm4^t3hzhnR3I-8-
ziwRf~(O3~8NPM6Rw(oyt?(W?gLQ`M+%>4GhXV00rbLY;PJNN9&nYqT}ZTGOcw{LJ+
zm-k;_ZSof6BwC9s=4IZfqV3h1dtJ4`%%XMGIy3OCvGAg|{jn?7Rk@feE%W=izSGi%
z?0s=&=0Df?w07*kI-jd*sAqPXXJM<duzQB=9U6Y#;4~|ISzqghoN?BMe&v>{DxA5h
zwMb)G-zFohF_wGbhJJ76n9J5Cj<Cieg?q`lR$ps`RfgXU{oyRVAT8hJ50433z6<Ad
zRfaFiw9>6{7G2f!O%458RC+;SmZvPu8fKl#r7lbB%9=g8J7R6RHQY`)GwXhT8y2zr
zn~iB!2Rog+TJxN1&Bbw<)<S+{_l=&V&sVd$PgrkSeGd8_KdX|sH!Zy+*YYgAYPV+z
z9oyVu2cV0hG=9vLiLBYQ-JgEL4s`8mL^ViED@gEbiL<kM6{qJ%Q0Y+OixSi9a->v-
z-+NKwI`D7%*#^3X_{#7lB&kY#dk>2gdDg8IS2JiMrSNbra3xwL$)c8c23(yJ?hW_O
z&eDtPY}oP*t9xJz#jxTRP`GJ8BJ^vK&L278BV7kVXgj$#=IEAkqINQ?|03%-w38;*
z0=u2O!rMs{Zzmq!PE4nrXoWG<QWp3wNFTCy8(PW+-cp|OQR~=vh~4O_y2azUEB&Le
zd(y1D!F|zM#-X+Fwo+}Povf`kwJ~TB)KVg=ZizIPxvD+PX)R@FFXJp~9UJ<M@~5+O
zZ(3g1@?3v<jM`d8`OT<wZw;*_Wu4SocKOp*%;GKP0NP8ST}4!z9@kQ8F_~5@*L}uD
z&oXKu52CeP|M&>rS{}4av=%CjXW0z27&^L>)MAj2i=|MCiM-wP=z(^Vl;%CxZ;E!4
zHxT7)gLadi6lgc8XgBFexNhBPIgQbBgv?bPWt>{;2|GsXDMh;}020txPSkdeZaF9J
zV`lu0K4xC9k6FuG&ibSJnDhUIeay^FcOPb~;bFR`Jrz!C5WUQLsongZUgpNf2T8rm
ztYh{v7xC88t(#FNHi^oVz{|AxKi1D|Lp!<jB>S1)(^hJqM}NKN(YW97Jep}gj}n8=
zBVo6=`SZx+&m%qLdDNdjj|zS5?dQ>Y-m7fzdG1O+py{qE-LvtK@5a`69?=u(=)PqD
z>=zx+rP)FIC9-M&o=Ry+&NC@s!F2J*v-H9=U#dU8Mhj-<rl)ZycR8%r)VriSbP~Ob
zezXn4pGm@oxkm0?mR(+B@A7maOPL(fyHJ^W@-m@!@wM{n+=_WvvSJ=iY=x&&s1-w!
zN0R=W=g=E=-*Pg~q2JSHuJ~PT=H_6VS;yPVW5;MSN87xAW}BJ5DXp-JpSKv*>P=bu
zhg;0GvenCNn4_&;YB5tnt=__(yhN~i|0C_?6|@(!c~7Rj{6%eE)pq$WvU$<V{EyhY
zf6=ycR6kSue@Xn?K9&DVf6=y6+wc4d|F!?3ZKt;1`4ies#qan}b^S5M_~Q6~su=#C
z$`kUR>NWnKs>oMt|EJo*?c*2iF+SgAuBz8D#z+6D(yR-WF+L9;<MV`!@x9K+_+pMR
z#<z11(>~n8n!gN$Eq@K1JkB?7)2KbVhE&ac371zH?5I(jl+}`zjL|-y813_8w6Cu{
zI_#<TM2OM8q4sDW{*Cj0R@*EZ@4M>pbA#i3qwMj%>G*d=$IIh=$jKh>8_zA~%uFLD
zt~p)BxqI~Hu?bgHY3Al)x|)F~cYBQcVVqA3jQpLBkw4;H)iEJse~B3T3rJnnai=)?
zckHp_{ji}I11B?f{FiT6NA*tseeJ5(|6sd1^=I82>+1ds?Kz1$_MF6O%pG7}!dP8R
z^Af8uV_+1$y~p+R>Z%BPM&g#>jKniOtu;IFoX_&Sy~oo$qG~=yfY^;`A5A%XDDMxh
z&pFFl+YjUR_H4vin70aBxE8Y!^WEmM2;_YhW|c6azhP~^F!TT&ElOYRXY4~ii+KZZ
z-~SpoS7j!jO*o6s9xUFJuuqFvwvQz|wZCsf_5PS6;X8(6ZfhWq4ZnAe#Zt6RYtUB>
zvsxiXn%xOsLcNv6=O#)vQt3o$Pqk^z<;NyVGZVS!sjhi^6z{3@l9iU2lc1vlebi8%
z9>+%n#(>a2)r)U|az!-Ur=e__2~@V6;sq$F3ngw>iJH)cqMs9GYRP%jf<6@UFc=Xk
zqLMZaN+U2kG1S7i&?b`CtrXW7nA;*QaCIl1+xi53(}I6l|5S53^4RT&o_(vU>Dd=(
zN8+h>OYo_uwxd^QB=NGN+fm?&=d`0&csq)zxgG6ekst13jotUZf$!JAsqN_8eR^a$
z;tuYg5cx;jk>?M#BahOKP_D>P`*f5oud!%HbQQTMF|{L)(vCb@1fFwhI}*|eJm+fL
z5!n}k{;0Mc{kOLx@~=4CZ{9v<L!lL((7-Y+S9<h^TJopgXa@!lHahjpPA-VE{RNuk
zd*CmSS-B>0LSizWA=Fz|CJs5kqFA%c+|DIk3v|mUcrq)dG|x(n+n+x_(Oq(Bf!6)W
ztRKsgbBqjDnQUntjC@ae^OC4)Eox|DBkS|s6B5@}Yr1$U)URZVCM2#Ti6JE6mH5rj
zHyb4X0_UZ(YRUSB^Ze$m2ez!N@-Qu9!x7(s%<zM|8O!GW1TnsVF9A{e8n-koh$?7j
zt<NefZfP~j?_Qj0)yYRL&u{tWKqhi67RUOIajdBv>&j0G$*+l>pOY$@OI-Ph1u+Gw
z)(V`}WhFsoTCw?_g63ReSPi%&ikIU6d|-}MhPHcrb)&8Dg4q@;D6$f*2&)h|>Q+Y_
zuUWU?3BJV}S3sU7h=IHnm&fOS;E!4nZ^iU)WfkO%;GO{=_De4qVPzBqau6vy<oCz3
zI>q|1Uk0ZmtdA{?du>qd<n`-`daP-_-Dy9j<w+>CX2&!LX+fh#8Qsq8pX?oDdk!?q
z>krR?ewAjm$K5O`(1uJre?=?G&h1f>V0G~}_CAtTzjUg#BL3yPM)-FUR+8&A&wM27
zhq4v%tUAiYDpS#tTIYGvTcRbI@J?uCRqk$<1WydRB{f7#YL<la=#bfMDH3hT<ZVgB
z(0OZWPv*(CCvTKD*q-uud&)cM_T)8{V_kVkA^A12^K()~bBQZ2(Hr9pwkOEYp7K22
zV0+?{C|-_}Xir|WC$H3=aJ*){F4~iqd{ON7#O3jMHMS=&+LJffo_NX*d4IG$IsH*x
zyFVH}9IdI}V$A);*`5WWN6J1%kJPQ?p2I9pw~7w4j3=||l?QsIu#&qEYkAZ!{ZMhN
ze(BSHW50CQVK#K(VU|g4={4RrJ$p)h6CIChRE~G$FH-Vtk}vWNO&iT+JZ&cOVbro-
z<2}{0yr)9B7`3g}im9(6*~#`*I5K87)jbQeuh)2g^=z=eLirf{L}I9oQCutJuUUaU
ztDe+nQMwTp^vS55IjK+7Z=HF<e#>cRwa-0NmK~gDrt?G-&&=BA9#xV0-0RDqdvZ_p
z6k2O{+e@LDFAZJ_*_ADm9the_E0O}XQ@4_5cu%z<w5Rg9lfp`#KCI{Ic2DIFSWrG;
zLFrLNu%JHO{Q&GGJ;Z`~ATb3`LOsNS()m-5<PYMhd$a|m2cLMyv!9+of3h*OpYiej
z#CNjKJUSj%==4+kc$e=<CEq4?zM*NOowS+A$LXga#}m+payk7Jmqqb%o%k7uBhgRc
zTyj5!JT&WJ{v1U47(7m#eu~G%`^2+Q?x!f-2n*VD`YE2egYWpy!xQ&Y!oCviOzEi#
zyW74EqLpPHqm{uzFNB3&7_`vQ!eF5nQu`tcz2^4y`M<4wH7txO4BAsZZcm+b+iF;7
zD#yBfNg??)vGa3MMRSSEmsl867__G#qt@gp4BAs%a<XkHyb$(OVc>a3c6dh|A81E$
zh3SPsdy2~gZAh`t3t>+c2JI=H@<i?D&#=!o7oU=SUS5NJUh&^(pL3fkkM~vFE<UOM
zd$xV<9P8NUBx_>lC+u^QM01H_pK~h;GRHpWHWZiqKKq>8PdHw+&$%_k<tMVwos@sv
zKCk`1hw+0`Zcl||-{(=^=Cmi0)&Ac*aeJ!mpMrMhmWH+cQ|)+^`d=+%{7CdMwfz%D
z70}yi)*pG^wcWEdayB2`e3Adlt8b4-U3{@IaQJy2!B1jLh@Zsk@RR5dKZ&uG;ngwj
zaLgd}x5vuEtK%5`;{&2Ia|e{@*86+d(9%7u>)6J#s+g8gKEVoyuf_H~?xFQCj~7w0
zV~;-6(_=ivn$;DEV{!No*x!n-)}puKxEHEDb<;5d>WR`Z$J@v%+fC<Ni&4-1{9oQ_
z7zHH>N`i4vk0GQ{7zg$6e}sWJl+2FPlDB*l6)DEmJ@&uCLl{@j<>Trbe0G!Lg#H7c
zO5OA-{sVPWdfd7x`){lpF|QK(Tx(#roQV^SoU=wP#te3xG=n`4GuR%?U=OWfgq$U_
zX4$z}CHEjrg0%?824>|?+i6%|$2Gt>`TTuGLIhH13FaAr*y<h4bD}!2%H|j`pNpeB
z>8T}V29211@GlrKuW9^XAxeA~&b(oN-&TRy`u@cm_Gh-5vyZi+UwtEHBcA49s9|l`
zu)$Y!636&(4CPIAadh6e){wj@KRP$1qgh^Yew@`#LwTW$C(H{a=I1;*FZo*X`-wY+
zu0`A@zPeO~*%nG1k!VpliY&?{+B#Nw;;k)STwB83HD2FM!LpN9X)K~)e=)}s1Am1N
z`%ydTZ_%-R`PowV*+zt%&B<XtQXOmNhZPUUrJT&%kLVo(ZT!Lu4Que&9hhAoBh9XF
z$LxB4%&w0@8;@~ghDLMdf#M9&%B_<3kt)F|!_fhsfj}#dalNw7-8cd%^v0eu0<qM}
z<Lp-c5{~kur<Zs#&?_2^toL`*S*TYOV_(!Ok_6}Hy`qphy<#BFM6X!WXj!0NJi&Y;
z=2XSKUt2HYUU0@teU{(LiZZPvtC1DOpH!Q?JE67rp!I+sM#j#U!MzA6+Cn5^gE7fF
zUjc{MNNQcwQUb>`+)1qqvE+|JvB8*O#YP4^QyL>a(#+5+H9SZ4jKC~%VBWRHdE?uY
ztmnN{P9HC+TAF6ZEKP&sltvGhhUUe!3^AL1+;VIw%!)73QcP=7;;mV+C8-6I3)W}V
zDQ#qF?QR+sR&rCkc4kArK7KuBNpFg0l`gAIzSc3(+P#~`XOA@wy5VX4@xrY7C0U8t
z$ThmeEXXWakrh_j&~o{;0oc7@(2A_XWogJM&f2$o!<L%X-WO)Y6;t0GV~Jjm`aH@v
zw!kQ;Q*eKlSxV(J^Bd$hs9c}bpfoDKVZL4vS+FQ8ved|r$ahz|@+0$O3YKIUr5>cx
zlQ(S900z`_KFZrDsOQ((EXs0~>Q;TfHsryqpGrNIIf*IOZ8%@773<f=J(Bff=>m8o
zAm!PJFN>^<MR^+LN96~O2*fPNsxBMWWOi0!ad?52A7kl$tyj(G7JWIZd*=q%qK1}P
zG#Gs@?L`q?<S9U|ZNmJiQAH@#Empi=YhT1mbynh1>k*XdEUSTEYh8p=z3uN@^l+|G
ziu!GfG-bxZhjRy8VWsH>gRP~0#@v3baaw+zdsbryh&t8D5p}BLBB^I&DXjV1{x&{%
z0m6QBv$a)j^Tsx<DiX3i@41#fRGq44U>^b+-`};zt$DKDwlve;-GS!z1N$`Wf+ykd
zz3@IR&g@F5>)bPRuV#9R*H&kG=o}@x;dSvyoyY1_xAC}^A#a0@ro2OQsk6jbrgbku
z&1nVo^37$Z`BM{7gLy3Z;oP)hEji}$=q2tDAMv^&J3(}XpIoEkJX_lCVPUbD?Ms4B
zz*4Kwa`Us}nj><p)me2)IuxYA-vPCjKfub!&%l*+;wiK)-|eO{3eUr23wuw5QTrD*
zY`#zQMslANouId?Q{l2UG%2!jJgiOFj@I$yYc0H7v|fkkE`q;FP4<o5Cc^Yqy(?B$
z>rwFu8>`0G?e?+W!mR3R4q#dbR;5KO&hnI(Sj+q@5B@aY&C2anyv=H6E%GxT$*kO_
zWkdFkj~;SBk4l6NTjt-98(R@o)z=+3{vI4Zl8zsWw*B|Bar{d7bc$oYDxHgbPUbqJ
z5{j%ks7bAjXIBP18?&%m2<cSorS(2|f@>suR&SkH77c&%dRBtvvWjq4ezcX3yQfZx
zUZA0cr&vD7&uW}zQJn=wTW3Rd{5quk7dBxns1Ang9Tx4fl5-}psHz;dmN7o@o~*EP
z!_o?H58c@pS086}2A7^cGk5Q<6Xv@`Zyj54e-qsAZ7=q0AHNv=5vv;IYKPhEGd7NG
zau#H)YM85owK(fwSx4I&=UBctRL(@J2(`#kGut*O$v>}^wFEOog<1G#$Eek_W>hOX
z@J~?d5}zHDy&eA%_t>?2+&(@e-`Eo5$y!;B{962Mo-_W()|m4*C!sg|%N#UvZ<M=B
zN!cDYrAu~)k||B5S2MR8veeAQM^^c_?O~&nyk&l~^3o>my)Ji?yi0j}wEO(L`;M&t
z;h7`ze@O1i+AKfv*ukfc%sUuY{Opm!ACf!A_}yFYKC;@++H%RksK%)UH;tO-XIr<Q
zpj>VD`0F0=E`jH*9)t2tf6j~V=Gl9r%&fg`SDS1X#xu;jAGB6gxy-Ql@)B89$&3|M
z6WNfx6T@AV3E8Wv`-BfUkja|72T$Zw){?atl-r=(T#~}I!Om0l;mUs28=b9n#y{uL
zdv^Q1B{*k)>pe>=8of7)oo^+TZ1Hxme)gJ6TG@AnaW7Uu)UTHv=hc>aiaj}TdHTK3
zYW+BGy=+hM3hWdVm*=v3G-|gjvWtc9h&OUSDktp?x6s2Mr9Cs-?>%d;78y~kMW8Ha
z?Z*G>W7*f__k~)SGTXY<8ok%WI+WbS>FFiV$AKXSe(R8&K{fyMk(&<q4)if0$w=XM
z^zGU6vp+%^D$p{MbKXE6g;`CD>A6eK+{EH?ND#-g?r-9I$8P>R1D-#uLnYdXwZs~^
z*Ueg&(05u1G=6}!W7WwnIzwDB&VJ~o1ATNV0k!pc*>wCJbjFypoIc&L>IFS_==rcB
z#-j3Q{2XPww|wKljzGt{Zro$s-Z5eCG*2RX2lYPrDcrYs>bA9pg_T(GX7AB{&-ABY
z@3?Zfy_092w7sJz8OSxd1Z^Nw*gI|VM)^I1%--DIK~BHJ-tijVI^LkYlh+{6ws-Ox
z=IP!@FSmE{BJyDG<VEJic)7iUR3~Ncc!&8-+uj-OH@UqNR%s@Yy<@=MNq*~*EI+q)
zkS<{DpfnBhqVfXi12JUn)N9JE9j}%bV`ceGSUbnx8z*4z407xpFY;{@RV1vPv3`?V
zJ7JZPNo4I9uy)Khi%_P3t%JRdLTnv(X}WhXZx8w_X?bMnm?yM!o;vjNjp@4*vcq82
zM6Hu89T%4!-_CI#^39SgokP9?)zXQ2#I@{Lc8)3R9B;imb6M0<)SP7Hgzi`rYUQxv
zcCd5eU~U|%tq1I!rmCI8a;+hIS441I$D0OUJlHyUuyyhrTgN;_TL<UjW0|hBn2Px^
zMX+~rJ>gY1nXIj62YD!Tw0l02+XJvDFcx_1u|Eczr$@!YCW#63yndl-Ro#vidNVCm
ztD3C2swSHYvsl$US6KO4s~!1(zB?7q?OgnmDuXSM?(Lh~xQw3lO{~@!pIwt%ANEd;
zHkoOi1IMkyaoBb0?}KsNC>%$}>@Ix?N1u$X<HndRSv&J$j<$BpptW=S=do<>l;F(5
z-pRoI1AE77zL;Wdg|vU;xiPZ6^CF}tv`Z9w2erk7#bY`ak9UOMbSxfkdfv?3J+{Sj
z+_J;wX;iVS3GVvd!#zX&DVg_WMZ@Zu<L+Wb<z;Og)?}b3-6A>3?#udTS!+I<8L)AW
z_JgK&iYG(v606kDR>0GtWoEnRlCl1ltfMtFSGIlXWSiMq*ZsTk9LPP9u8x(j86L>j
zv3yP?U$WBzc276k?&&1iJ!JC)Y#Z1>hseI+&(a@oonw|9S<5Y*q5hUzlRLx4`IVlu
zFC4k!-~(0jqCfGo%uIjF%;`<cy)M&R&0O!m=5g)yxL(3FZ#ya5=L5fI14{T##U9qu
z+8b@6eHCTxjdH;v(%NLh`dPfHD%>2hcU8dtxqL;{1lT_lJg&-)WdC@`{%QIi?xz*7
zfLgGYZ^KjG%8e<nSu0W5E@<V=J#6H+!v1+D)7rI%&DDy=?~P_Duz&iK{j)S+|Iivx
z?Osnd={61?p!%|UUae}bRxgjNAlOC4KFe6@@vf*UWS*cUM5Q5H$h@CQWaXBXqwlXl
zmuKx|k$!I!N(3wDslB_8-9K_0D0dEQppmeFGD;S5+MHV@N7+DbvQWhTwsJp9)~n_l
zuuYN|!5Trywl?xM$=e1xFFU5`?b&4ee7Kt>V`hRZC1z$|HJq@3CNF`dWx@iY?^JGY
zu{Mqc1dB+rfan~0)lK@!>YoidZ{U0ly-ECh^Rr`;Zp)_J-^clIUoc?-9s9W;Y@o)$
zF`q^y@O>V-_^_6V@sx6D+~+VK_o)aS_xXxi;0eZkV(oFCn35v+<rN*)7;K?(d+g^h
zAN#2gV?R}=IQ9cyV&um%-~~Js7E$^7th(hi0@Mg2K#j_21PHOoh|O4(6;)0aX&4^`
z!f_0CQTfS^1JOC^9p)oJ<roP%%twOCrIDb+d?cuxj|3g&BS94*BSH2N$b+n=ike4)
zPR=$O610tQT?}Ojj0TlsH0UrN4MNF6MuQIX(V+5xg@ir)$U>_4|2-OXY&)sv@3oWo
zcu-yP_K$&|ID?&3e)O2ozW?4aA^84cMFYl!Hj6Q#!x$5S3}ZqSCp9L7do1=ajR|cQ
zV?zAcugd=lV?rK`384>&X>gcEg*Jzb3Z1Nt#K(nj=V4rEG{%L>m2sib!EvFAQyv#O
z2jfEAZ<wB+YmYH{^E<|c(8e(?bT}}w0FS`haiNnN7lJm}IbvMM(Z|1eTnO63xKIt+
zs~s0&>}1D<YUjb=Cs8{ORyz+?I}cVn4^}%5#%I`S=fP^{!Tx{FgEcPEF%R}2JaihB
zU{&eRrw;4(7?9rXrV-@(qo3L3ut~l@fiWPTj=8Xt8v~k?I2Sp`lx)D5&4$CeJqDEO
z*9TzVZ}R`CNJDOM)~SvGVVx%OV;NXs>5KvS8u;unAYVftVv`Xo#(;bgK8ykRB7L;J
zlaB!*?a9oI(K$LC)@gPOV?Z4b>ohxtk(PNuZ=lYHb@B${V?apBM|v;@R9L65p)bl8
zI3f^3V?YaqH&CJGi?LGt`bp1^Ib%S$E{2@jobGQ)9zhrb>Ty`7IWm;&)}TjFr^7mV
z1O>-{P~-9#P~l)}6UGc%`t`<XKAI=fPdHEZONd8M%Njj`TI$E2Df1~FLB1M2f?6Ka
zBS;rBWrg*8=CW@7mWimvlbkC%*)gDIHO`ggVXmw$t)-5^I$SXh<imWK&zUdNyPVoM
zP+-2yNUL9A@%b|B!LQMrnRe8inSKg$W{aD|W6o?O=FBEw&TLSk-ht-4aw5n_=sDak
zSU3Le6h0mlWnulX53-oPxk(i?UzP;_pmg6F?jPjLm(j7K=-528A<UR<E?$QjGjZHk
z<qw|XoLNo{b7uNU&zU8K_y}zX&Y5k%Jr!M|7dG?j@DW<UXU(#eS+fU%vu4Mg+mhzZ
z$U|rnb6MjPGjhmF%AnQUF}Smw5uw6#-^uz3HLAF;33`IIEe>d|><boUMVGsBCVSdh
zk-nUb6Ph$TpqZ|C<AOn+4%VWqe^zv)IX;ZCAIn$BncG6I7MwHdakx=%&deEyIF-4r
zW96#{=UJRlp;O8C&zdvK@HaYY&MYVT1<aWx`x}MKnLYL|n=_kyf;ltXRmz-M&06_$
z=FGBdm^14iGG|7mk>|{C7uTT6f7hIu6`V7BlIF|`oA_4pIkTcBN6(q*e{jw$7jtGe
z1n11?d<_ee`1$5%7bX6lIkWhny#zn$!pVigPdda_@^f1$;3v&(rIYiM7Pb=nqzf|(
zh2Idjll<IHDie0nDf>wm8n8ryenYT&Y`-B`NP1ypA@>`Cbp*d5SVu91+;8Y4Z6l+w
zgP&VQ@RRQ7=av!tq(dwtKevpy=MYi`Jck07k$prUre@2iCLitN_(>O{9098ce$qYs
z+$ut;LaZV@AwvD6@ivhV-ywLx{J*q{{-~dH&Hh7V6Tw%yFb#W8pyrOUhfd8``afb1
z!RHw}oWLF;pJ~`buo0evpCRla?mu)~dkDVOXg%D6h}%Q_xUWk8I`$Cvnl9|*Cu_*|
zn&#F})k*sh!5+f>$L*nUu!l-(u!qLk_E6a=*h3*cL_PeDJ>>XLpNicQVh>6AI?vGm
ztPj!ufIW1S4^hop`8U}^NBI!pE)Lp5jxKBMA@ZU=kq=RP$x(jP@bWpzkGkRy`%xp;
z5I^dQv_IxY4X>d(<z~Q-x;)D9qb@gOKk9PNsrpf4q{#M*E<ehTnvWCN-qPeNB>Pd9
z2V(woKWdB-*?!b0lj27m93is(sBJHyT0d&WLtqUStrx4=4wC$+%m3H?s5i@g)O=j%
zWc;W%JATyVe@#DX+ehe+`BB45=$L-g6@T21`j3tY$^O}n@9lqfOz3~zkJ{17pJN04
zF+XZYm;Wvs=zrUfx&|Alb}d=J1}Z(u2C7|4cHA}dwQI>}@2A?eWVCX=b}d=$TC&v4
z+O=f0YsvoG*OJv>1J#ZL1#F<&aUi~LgxERgFS4G#b{r^ockMXP?_W<}I}Y?0Tu)y+
z4)njgp1uYfsCFDEU<1{T1O4@EpxQl!YWEbX-Bai!_bU3c{G<QZ=fWH>t^bC(uz$Zl
z(EspU*zJW`sU<@Wc%lr;sP;tPk=vwX(Kk8TF7LBdx^ZQd+o)eY$=Wt_Tb!r$=)CZf
z;d{)Mo-+_<BF_B2Vp|+`&bBbxc@w>N;tK0yd#9`8uGhd`j!jD#(gQeSJng$Ux@3=@
zIk9nmm0Pb<K9O=9y%PJi<9wrqG{HJpfxWac={)(?XUE;osHQ!r$tQ&FSDb6!d&r%3
z+IqUmW6Y{Djqvi#RW9QOTx~)*cAt6&XP?)yG9YVS{-ThfjI241&0UjlWtHJ>NNIBs
z*F3rszeeNNJml)yfLyOct}Z&xMS1DT*ke4IRkGw0?g6(2=jc3akDj_LVP=&}_i)c7
z&jq8s=QW;L<#zeYqbgBru2$CV@ZZJRrejxo*K))~xevlqDXDar-*evJK<bKym2{nS
zy;P%g9mD;hxyh*)WbH0Pt!uO!B#vo_t7@3FNADa%d-tATT?^9R!J5An=jnv^lq}m+
z<uR|RiZ*|!(5j3mPwSWxoVWK#?~|yTnN`uokLBT&vP7#`oO`G&)|zBJm~~nyb`+Ze
zZBM~oxywfQJ%7hev@4LO3wgSJs2GWBoa%-4T(iLcSpL;+&l$I(%(NdJt}&N2BX1TX
z?<MSCyO?&KZl+y+;(h0Qbr->3D7D75WR(%;<u)k68(NyvE@<--F0V4o@bZ_z54T={
zB*PkD?>Ft~vL|G3p)uHR`uIM1fqAoV?7{d-a1X|pk6KUWIjQwzzPfs=F@Zf8qc&H4
zS$9~4mg=fn6`?m{MOxJ=ja9wjS_n_NM=V^)E#v&2@7R)WakodiudXuPn~Tr07Fejq
z<%n&x5&O-dhRycmQRGR)&WzAUqaC@a6`rbr+K{~iO%uD;(pt4QT(RZttb7Z5uohQR
z&VzUQqqaU(6=~j36=lx1*plto3s?7SF7AT-L-Q^xhn|<8aR1la1N%2_uVF2k=Oosm
zQ9bLelS9^`;ZD1S_HSH+7GIcEuLLc)Ia+-46bo(W7Tjf8|Hdz2MH*U8WMJQF#NR^v
z@%O=$_pN4C+wFZEJ$xU>I#`p2bH}4y-&uk;b!@EiXjfN7Xu=l>F%8hJ8qCc7Y}bj}
zEbR%0)pLAbN6*{CJ*;Y*d#Jx-#(QY@SK?laLN6U{)-Uf&SJY)9-{moohR17&*P2=T
zE1=hRj(?9+-+97kMd@*#6=naDXGQ5To)u;PvS&qU;JJ`ciq@b$D@v)4rM?z=41HEm
z+T%Sd=(s=ntiY-ssdq0u&a(m@9m=z!>;%sW`N>lDFL+jz9phP1depO`?4+L+Wy-Un
z^gr~hDE<HUtmswqvw~LP{3*|hUPnJGN^74L;#ncq?)(d$6{RP9R+Jt8Ss~sb(>%Dw
zph?MMynAZ#J}vl$vidt?EmyqR25+272rp^4Pfsv=1>R5g{SFhmx0@E;eHKCcx9`GE
zqc!ihS(uerBKB>ME1`F36@{E3YG;gvcX%blP~P1Gc^}$A@Aaa++`riEyql(`{|d;D
z-s{zh-T{WUa`AVBh3|Z7e^vs$ohxZ4<xTJYO0Nva#uu~X{C;?Y7|C1N$MbiL(Gd;#
z5%gBG=t>;hihkL7^Bi3}?IR;}<e~xGjh(;ytOWadQGWIKyW#pqP<|13$J-+C2}yKq
z4ftEUe%KjVX(T0Bx8i>R<=ueCQR;&`7i5K(((#c^DSf<1zazdf(mJiOo;T4On-`yV
z7vk&jV<PPQ8qgW|5%w8&G_WG9Wm#WI`^D?1_mZHF>dX@*7vIjh&$suO#yQT8sJNc`
z$o=+xQNdObxzl4ohY76O45w1|=cPEbGpf>)G}|i5@{}&cRfSiZETGSS?xej^7v@Hk
zQeG>uXFSDZiQ{&#$|B2H_+suL%TxLx*7*$*`^#^C4f|)*S-iH|bm3h(k$9I*MBrUI
zk#`5)q|>hPGuT}|Ex5aUvhDpBIvbv5zgs66?@c*3_@14>TXf7rzL|V?`NepTj@whb
z`jGF+$h%AFEjrKDSs(c*?JQ46lKmN)1HD0~rk&+qJmLFu#+>B)b6VE;|Ay8>#PYWZ
z(mUb;H5|T^{@2i(bm(5C_rg(m%`V@B{KE;nQRi6i(+T{)`7`#I=k{)^e*FK<0MAD3
zFyFUA$G@A&Zu*Zi*>w;8iQHsHl%vOqK#zm_Puwp##b)O&{4I&p7twq6=)P#a15YaK
zH{aZPI1AU75MMDJ@0ZDSPr=(|g85L-h4&PSJ744zn#ZR*>3w^`at@4n9KBaM+0KFg
zFMnYF`7Let>9^{wn}qy_LC>(j*@M2Wy$3z|m<3`F`Yqq;w^Hc>|6kD0EC|TxKa4)x
z=kvXecXU0X-nUfO^gm{RM{n-3XfJvLJ8MkFp4eLFd$J<RsZXN&HKdL+I$Lh<ZCUN|
zzNXcr#~3f5{!DM(6#rS!BSp}EmN^E!*D#=!`a7eV##8^FaPCH}XOwkxitlz%|9OHw
zCz9$4|6>O%vCtbXz!hMB`g$c#f2-ks?})b__UAq6nBZ=y1NLg+v`c*z?NUF0>PY<0
z>xVkpaEv;lwq4VC>X*=66ndWi%6ZJ*TGzeGnHW3Xxu^|cEQi0hr{?|Z|HylLXaqX+
zy*=2|-c0pkNBg1Mu>-@2_pkTWZM)Ai?uZwA*sm}bp`5SajWT$9kNc=y>|HhOVjn4X
zvFC5`p<V1FQ{OX}VE=l*xq+n)!pH%Oq?Y~?-stlb*WkG|Xs}MUJ3F#ki=?;P&>MYT
zvUd4RA8e#o#^bFu$g3!&<Y(`2OIzYvD&BL2GUB~xv>$I=@mza9`&(<+n}hbV-}0?z
zoMyk>hsx%<566YGR4P|)ZYl3`SaPdixg3qV@rEC2U0N5j7yboaw0rjey6+g>caPxQ
zP7u$_zux}#!e(qy;=#UVc;BXRYgUtz9e6+E4!jvO@J>%*HG106dmzJ0M(r~jdwK=p
z0#+lv&(Q;`@#ACePv3;bopk``h$|^UUL_&tAiHrZWJ4+U?t$D7?SKsV##x`Az-~l-
z^w!GOrO4yp{=C-olnLK?aR0={^ebs6<-HAQ(klZpVK=@g<gM-FgYT(q$d5p5Bu1E#
zFa5If<~h1{+DAs#U^gP|F#fL936XU6NZ5>J;4#Xt)0GLE?$FLUG@fjb-RLQ$yy-2e
zfh+$fEXRma%H;uDDs0C?JDS3FOsb^xcq?mbTvKbjXSH!DQsQ`xju%$sp`9Zjdr&^7
zZAX6Uj5Xs}svEq02-<LLb9>Bw3+gnIwTO)Obfzmn&GM`NVFx5_VoQea(_3TI+N2s!
z30jRuOZ6StqX{F-sd!u6x~%w8yhW6koLUr>+|x0T^N%}5A<xy-9yjIL#m=(}{x^7f
zF2Fc5T{qP{Yo_OsJ|D~yW6USA1Ms}y?=Y;{2CL*Y7`?$1B@4ED#|EQv(%VewdGGmM
zHrSsr#!PmB-YPq2gMC@IH@Cr7aT{zEx4~XEJ>@&THG|iXQ|y8LMepz3follVa<dTo
z3)j{7G|B$5^FV5G_lP_~kN<2Zz1#OhbxzOCfbI2r$ByZmh3%Ch+g`VlF2wk8gA!_`
zDb#;N&fdpv4H-XHY%m{Uf1eGu-L}Cz+y=w$aB>~P{-Pe_wk))i$P?RO$uw?^`;Ctq
z8_-TrGYxj)emCPS^rwv-D{PyT=DQu#8<p7aWR?H-)%NGSpReuDYx{Hl?(*9HoK@BK
z=iL85`cM78)SsIL4GK~*H(ywsWHrq1UYuw}7U%`{!SYG4^n6c2T5+=F$*=i6+4MXx
zy$!s<<Ma6OUfpXSpXc%N<MWPvd=d5!#`~Z$D38~88J<NM@NT6HD#cp66l?8L)I4U)
z%kc-V1G|Z4V)ss`96l-s?OUuD+U4+h3VAtv#~Qol<tS`W7_1K;ua82?f!8N;;PrtV
zYT8dPv_5%V<WU(Sd42MlKz;HO9H&12s6GP6|0m9Gk1K~Qv!3@hvTm__d>j?t8TIjx
zzVmtToY7rP%i)*N8DjzUKLQYE%j=ip?QWeBS0C@7r8ryuc(I;=k)O_pt#4$oN-aao
zz8`yBb8DE-@_SiPrj=yfg;J0$i1ClD@NTI8@g9~vHQ|aX-QAYFM6%z43}vg2xX$NO
z`P@y)QMS&A<K=V89m~r{<yOmQ1j}b;z@G?Z)KSJLyv_XBWn{;%qtav4QEAO})c#*p
zM>IQHQyrBaqmFp_j;^Ej#iv$BcVU#V2qSeH_V>jYuNW2XU%X*|W-FS-p<jLZJP^`g
zd@_rV7;<SV*zm0|LzE!Wz}}AtowKq3x89z_+h<gueZpRbB@nc-o9(23J!GrnUri+a
z?+g4hYOs?mZ~CwIp@<E}3?mI7jz&5}E5-kxTMuCV<yh~cr~f~5HaIP{5%x@^mb%GH
zRtf&I1oO_=N&hg(sz+I*k|rOsqz#W#Qs}}isncHd4aX}l>wD?s8JAr&IXSIEMwc!f
zGdgx}lRR<46;mcBUv_EojLzM=b?e-1a(eQl=@Tx!FnQLL8CP5cd53Q8GTL=aPV>&3
znSVvk_U$K#Jlb7&*<}|_pK`@zSI(F;rQM{<E@?mWvdgAV@=mzu()QD*&$^^-{*23}
zO_?+^d2)}b-Fr;!Jh?;Hu3bA#?vl}=<CHFwGJ16G(Pe6<iJda0Oq$YZa>q_xJEpU~
zXJDvq!juUUFJf8;{LJpyE~5u?M}+nDXyJN<5v4`5x>}4@Pp@yrY7N<GMw}L}CFm(y
zOO0WAhM9m1a06k02OxO_5D7#9b%1Dq<S{@!pgzz5hy_UA2sjOh1LA=MfaHll63_%_
z3M2z0PXU?(Er3*@B|!2tARTB0v<BJ$ByR__2QmP<(2fAfI|E&Su0S`SJ3#WD0M$(|
zpf_+PK=MqWFOUUf133W6Er6yt`vU`jfdI(|0cQh)fg!+9faJr05x_`b6fhbf`50g<
za4s+o7!Q#AeBc5g510T<1V}y^m;y`%E(E*)$)^Dq1Ji*^fJ*_A=L44mGk`0AnE=UW
z0apP9z}3Jt0LiZdt_N-aZUlS)$>#ubfqB49z<hw@g}^Pq0^nBQHh|=J0CxgKz(U|I
zfaHsTyMcRvzX3}Ck}m`91?~gx2bKdQUjaM-tOOneRskem13Uz*1s(?00VH1!JPJGp
zJPvFCNd5%yB=8jQH1G^S@@Iifz;nR!z-EBtF95~BR^UZo8$j~yz{|iZz^eesUI*R)
z-UQwP-UdkiE>Hrz2b2P30Lga(?*ktI9|9i%B(DHI26h3T03@pfJ_9}nz5u=iNd7gj
z8~6s;1MCGz{w=T%*bjUM8~{lEJ@8N9AaDpE*^hu9I1C&Cega7T3-BxO8$be$fS(4w
zOuz-WfiM6c7LKn7AQFfI@L|#Tstd#b^?>>SJ}eer4S`0$X+Ru+4@<yTV;~Vo0-6B$
zuw;BS15$wI06r`gU+9k5=|CEg4&cLD<EstO7NB>Ow+HZH9q`o==mc~Ix&ZjFZusgB
z^Z@8R4fwEL`05Ru3G@Ln0en~%zOsQFAQ!Lzd{}>c4FCoLX90r%eAr-o4FQG%!vK8P
z2z-qMMggONa{zqUSbUuej0464=K=Vz3-FZ(OaLYVlK_0!6nsquE(E*)K5QDkE(WFp
zmjIUn_^^C@T@K6ut^j5N_^?^{x(X-&t_H3F@L|{C>w4e@;6?x+HXC1afVsdt;3fbc
zb~C;Tfm?tDz^wp2>~?(J0o(}`0Sf_q*dlx_2JQy#0q|i<@U;|J2HXqW2jIh&<LmFh
z3g7`?C4diu_b*!wtN|VZ)&lsjb@+M&SPwi3JO<#yHsEU`@C5KAfDd~bU(W#lu=!1(
z&jHT^n}IC=KCBpDTY(pWZNN(aKI~<Dy#l-nyav1u;KSa;*IU5bz&pUZ06y$Je3b%a
zzz$$1fDiisUmpS=0p$Qb>|=cG0zLsg1@K{?;p=nY3*butANDoAb_3r4djNb`6~4X&
z_5u3=eAoeeRRiAx{{#*K_^==F^&{X14g*I3eAv(U`UUtE_>Ba*kn5lZU;-{%76yu$
zC>9Px0FeM4QU^2|s0+jZ^#GDL0F4D20*!209B4d{05rB`NuW)Dra&^#44~tigSG%t
zftJAO0LjxqTLG<sHnyxCXnP<7=m2yCC~arZE<jhH8_*pfc~8(YfL=gvTh<3O6X*+M
z*|HqaT)+bQ*|Gtk1A()ELAGo#=n!BiFwB;X038X80!9Pp0CeuLpyvYPfbqb20Ld=^
z%>yO?6M;zp$)|u$1ug`<wrm>c#lUpn65vvR(&mF+4$J_q0A>Otp9OjqPyk$Q%dQ2z
z4!9n;!It?zX9IJ9xxhStj-L;DGf)WJ0xSSXejDiRz#YJywrnBjUBDt>F>p6PY5xYg
z1Xv0z1MUS#en04P;P1c+TecGPL0}cI+Lk>8x)yjCSZB-DgFXs820U)dHiA9@JPABy
z%bo%K2k<Pg33v{mb8iOS0=xhe16u)-Zv%Y^*bcl5yaJH?HPF|AH-I;7+1sG+0Pg}N
zz<U6tEd$*F>;&EiJ^)Dm5okG30eo!BJ^}p{s02Q<WnX}P348^74eSQ!_&uO|fhyoz
zU>`v8??4X#)xh_*>>%hN;0NGGzz<N`BcMM4KLfu2zXBv@1}LBd2K|P}1?mRE0FNz;
z0F4BqfI7CUE@%u;52$a;VnG`Mjeyf^Sv+V0&=^Prk^nkSQ_y6f8IS@r2S}a@+7dV&
zNCVOVlD7tJ1GEL&*|H4K4nRks6VMr;v|T~F0o{QfKu>_=y+C^dX99g}SzpjBAREZB
zWfo{Zpg%AG7zohugFw#)1_MKYp#aH;gN^`30;6o%IiO>JvB0^&IDpcg2YNnm0gwkw
z07yOwbTTjnm}<+spcettfQxO}C7_oAmjU^<YzF8Rz)avuTXq#_0dO^NjV-$l^m^b1
z;6}g)(7ES;&IRTHHv#hjk{5#B0xSS-1#SaKeh28CKoPLemMsEZ4BQRe1N;r3v`ayk
z0rvv;0rvwW|2yak-~nKzEn5Y;8dw87WXm1~T?ae@tOp(i==jG$Hvk)fCx9mbl0Oal
z4Db)&SzGoT=<~p4U<>d9Kxwyvz6fjsUIMlQB!30;Rp2$?bzAl(=v%<sz&p0A1oS<i
z6ezQ0J3-$EJ^((nW#yn1z{kKYTlOhvCGZ*WIq(HQ=l%-xYhX9<4X_6wc@^llz&>C<
z@Et(%YS8b2e*y<>*$<#U0)F5ya0H;VKZE`P{0jUA&>w!1>!1c;0xnw?2I>LAfe2d`
z1zHD)2I>Ma03BZ+v;hzcGz1y}B##4)2NHnBwk!#>3D6Ws2ATnswmE1EAQfl{oDPsY
z9kdnD8fat7+JUwQGJp=YtP^NwpbOB|mURd10rUjUuw}hL&jk7anYJtoG#khPasdmV
zbN2@w01O1q0tNvj9}GGK7zzvnh65xY2|5ZG4V+`k#)6&;j0464=K+-V0?<5Q0x%Jn
z1dx0R=v3fBz-!B<fnE$u2QIN?mx1O3mjg3^D*!tFO3+!rRX_o7H9+!fL9YX@2X3%s
zKG4~~9AGXm51_R3L2m{Mfm?tD0LgCyy&bp%xYL#`1icGb1T3~?_kjKlSOP4yW%q*K
z2iy-Vw`D6p9{^SY58ATTplg7KfVIHG0G<00(DlHhz+=GU0LeFkJ^?%lJOw-rko+H@
z&jOo(=WN+#&@I3VKryftptRdSUjnuRF9WXtB!3O`b>I!)O<VRh=sUo>K#46Y1uX-1
z06T&A0XqIe(2sy}paS?9Ao(Ytp8}P@XSVDM&@X|nfUkkw0Hxgnx)-Pdz6JIHB>xWd
z08kBlZ_5sX9s+&<ezawWL5~1G0YBTaUqOEZm<xFk@Y4V_0T<x5WggIQAOeU4q5w)8
z4O$n70qOzu0g}gpHUt_0rvY&Q$rC^u1BpPAEo%yz3^W5$faU<DO$BWUoDQS`=>W-F
zgSG+M0_|*B251MMBhbl~bph=PbOX8rJpelX4A5RcZ{SRz4?yz1pjkjRkYmd%(0)LF
zU;r=>ptOTP&jtnqLx7<G$%liE07e3%Y}q-WV}P;1xwdRP=y|~Tzy-E!0_a3w5-{18
zO$EIW@B$avvWr2d1D61o0+#`F?#n@E09ODrfhz%$Uj<qKTn$_UTnmu=de9qy8v&m!
zn*%x*m<QYh%m*lKA?Pi@0^nBQHh|=JfZhod0Sj%}BGARa-M~GzYzgR6U>R^Pa34U&
zF9-cQumX4hSP77P73gYU4e*dHdl+;b@CdLTcod+tkArRiHUduoPXZ)=8uS_9AHcJ=
z>^acqfz7}cTUHFZ6?hTYX3MsNz6`tqylTr{2Ymy06L`y(y#x9#Py)PX%gR7^06T&A
zfe!#G&qtu;Kn3tIunQphr=XR<XTayS>`TzEfUkkwz&8M;-3wX;d<*OY_5&n809p-v
z5B$@X9RmFU_!02ivLm2B0Y3x3*s|Y1nH%{4I#IADs0(ldVYVzBGy;eOqHI|-Xk8!%
zsAtO>fW`t1fkw704m2J}02%{{0G+1^Xj32=Xa=MJByRzl3bX`Hw`J*|t$@}*8=x&f
zY1@Nl03CpiKqr9YT|m16-GJ`4tS9IhKrf)TE$aiC3G@ZBY*`LyE@0Vwf6xKIK;SG}
zb~fl>V2I5R104>G07lxf(V*u5V}P;1xd4@IJm`7A`M?E09zgPmpp$^fz!YFAKyokW
zMZh%RVq10z=%v7AKt6CeKxwZ4oe5kC%mS_gNPacwHNdsNb++sV&>I0CFx!^R1)T@n
z1k49+2I%-(Ko<bF0=EIT10=r_v<O%T+-1uagWe6?1N;qG0#Mpzp!Wjz0rvyT0g|r(
zeE?VqJZQ^SgRTJ{viXNW*8z_J>uuR%ppOF^Z2k$*CxNGI{u$7J0M7!OY}xamn}IFB
z3qUbIWq1*E8}Jga9e5ca`KzF>0j~pZ*s`}k-v-_R-UUhkN?QtA2J8TK0`CJP{}A*e
zpd6^MWxGH>0X_vPZQ19bUjSbMU)i$Vpx*#{Y`zNgTVNls-<BN!tp>ig`GcT`fFEq$
z4|*6l0{mplegXXz_zhrTC?^3w4Nwzs0d61+AbB`w1P}>C*|KQRx<Cw252z1N+E~zr
zKqKHZAPyjT0%&6(5lFISO+k}^W<ZK9YXO=Hv;<DKW$B=;fYv}8Th<P=J&*x(uw|V<
zI|E&SuC}Z@Xb+$#aE2}G4SFWf2gtN#S)kcK4v=fh`hoTb1^@$X*&xuffx*BKTQ&@I
zI4}YjY0E}~o&$^l#scR8R1f1p&jZc}E&%cXl1~Jk1WX2|08;^ydqFP(rU4fN(*crS
z3VIokZ}T%iuK;EOR|2yDN>>1SHE<1ZEpQ!hykIbsjr)p@3<NR~onSC(G)^!uGu)a6
zt%D(g{e;2nK|xUjdlLiP!$bIcD>Xh&E)IzZ9!Wn8KEv#Y49qakpn>vWhzb6p9|oU!
zc0>kdo(It2dN4F%$rx}S9~3oWKUQdbzC|Qy#NNT+JdLvl_`ols2A{!pBnD=%dr0+@
z=tT1LO%y(bg-i95!ahR%3=W<zg*}Y=85zP~jryT^0})aJKR7j53x!W(L#6sjQ{r1G
zd^>i!R6p(5ub7l@^wo~-MEyAWYRA^2erR4pgm!@+oEm%v-Vqs?fj>>EpUzGsei?jb
z-Vqs?ncqzlAHmR*{R8zgCMfF3Zbto_AHtu5`oYHzJp(^DHTVp_BQjVfYbVuDrW1)@
z2Fp@-i@BuwvDn9`pV7hdS?o#FkJFwkwgB~mBzCX@KR7kG2Z19p;6ZRmY7c{)Nc=Lm
zXMrO!;92mpR6oPn-KZbu{KMH4)X&7=`G>PEs2ry~4|g)-`HxiiF)T`|pD{}Oxe9+i
z`+_F0g5iAj94_7|&-rYjbbp=Cywd%3e(*^8VX!=fpUldn`kAc6PgVG7>_Mr1rm-ue
z`kBVErTUr18c6jsP04S%!soNSQhUf(;%6xQEcT*QKeN~pseWd$%cT05#Vo0Q$aBL9
z2KV3y<*#EKrTV$fiNr61dv-V?gUw;HrTUq}hM|7EK^4wn%}_s=hVXv02NUxHBFqW=
z;M8FA6uywXE7cEqj5xvIo+F|B9c+zMKX<U}Q9n+3?qDNPKTdh>V69O<PI<`l#0duX
zKndj+vwNiaS?omOm%%+#9FYOfl&MnvEMr|!KTiL%jJc)$XBpdt`k{GN5taphaB6T5
z7e{2U73?XgepWb<_+_w_3crTkD%H;#HWBsXlxGd=f%-W=c>Xmk2KD2VXN{5{dC)k)
zfCtUBQvIxVBJs=Mo;8lhfM?BFQvE!^8cX%_1gpaR<do+LwoR&^C!EZ9{!c0VvuvqU
zKhLs!T)*>FeU|mZ^```nB99&?7~Hcblz)LWLH#)41?MMz8EmV<Z)b;Sf<73w2Y=BI
zgT1Wqud_U<{$6Jps2}I9Aa5Zj7~E?pl!w<4>dy)9vJ%vvV>P_X9zy-K2qqveBPST#
z+bERZ$!?J9kGzkZU~n&_P`-kVlG+z}B{{+19!jBnC2NEFcS0pIP`}RgRytAmWw6f`
z{%ck))$i9V7xm}p_iNS=_2=mKYvp+IfO3KX52&wjKRSUtqMTrG&!|xTd-gQy*9qh)
z<phI!O@;D5vfEJqPWX{cLj4v61>{xb1cQ55h4R0!o>Kk(!s?;^oa_CCeS`bexnA<d
za)KeevVsDG8CtPae@1BGP~R?v57$OY_E)$PAEEHkS_`Q?M{5VsJ{|o=E9qktK33Z<
z=_6KKEVbuY?P94t$12A+QuqWdOKQ&vN_?WiCu{LieJ3mN%@jUWJ0SHBsoJa1hoj$A
zCH?6N-&*S^)o*J}NBueXZ)>d-_2=Bbt(D{3DtrfRrBr_%l=w~x-%Xn#wdZb1e0PQK
zr45kUb1y9!_3P-jmy-TWh0oG{l<xm5?H$ygbG=#GYSf=|y;;ifISSuji;?QDzY;%C
z;RkD#((}jp=R`M&!M*T;w+r|Y+6JkA9ijP9zs~iJQ1T~lJtr9O)*C9-?^x}0)Sq*`
zW3^w=-kj?ls~kU0;V;m3O7(Yv5<fxVr)cY?_Blm~C(l4981M|7i~4uMG;KfHqjSB}
zLL*T>(-l5ndqJw-eC-a@pL4zW+WDwI=X&#%<7X)REUleXf3uYM0)@X$b4l&<Iwk&k
zg`cf`EZy(3wI@-(&h^e#($7`+o3#Z}{obriK>az_d$aZy>d(2}o0a3q8`22|ydm$C
z>hE?Xp1dTTV8Baqy3{@wDe;RHeu>r#_3wlwS`_Nnx!xtAk<jllg<r0HA@!%rwdYWO
z&hu!wwh;B_Jdc(u$FETMRhn0-zg1cv)Sr{zDs3I=&&h9<ay)r<I>CTv=QUFOt<wfd
z?QflyAhkd81a$)JS%u%ARZH!OJVc#fz&rFcsXoYC)CmULr2SoLUz@a9sGqIDB%74<
z&ntYfcD7VM#aaugeHCkWO6{vyIsQe3e_6Xgs-Ks&_EP=4to?@e;I!A5mE*~a)d{di
zwfCj^A+J^^7~H!xlz&fqRH`rXc6EZmy<S84543qw{gD@}6O53NEt10C)W)HHogguY
zmofwYnbuLNU+LyR{MTAI>e~tAN$UiId)0>WRoYDG!wKYN>jc=F3V%S$k@Rsui-kU%
z@iX$sb%Mb?b3^$bv@fOp@dqWnU*Uh&o|p9Xvl9QS!t457lD>4^IXl(2q3~h)MN$=q
zDe>V7Uq{cBR8&WaudDD4^wT7LHBjPX6+TYiFWI|sN_@P+C+TA){Us^!O%=Ymo-XOH
zxe}kM@ag(tsfnd4@vRiTo&LI{-*!rThQfE&S4jHpti*R!_@4Szl74$C@n<M}AAPW-
z-#$uwro!jwsgizkl=uPq&(i%hK#3oy@PqX-NuPt2_#p~ELO)Z|=LkI-`pOBm@)1gU
z^0syY>^J=rNnc}?_;Ct<f&Q4JuM3p;2?{?&ze&>96eXTKx19j{Odl`lYnl>I9^Fnb
z;L+Vl(ieGnJHg<d-l6;~JwnpgEG7L_3V*HsnWVpKm3Z<HcY?uu`m>V$d`kQrg`cmV
zE!p?vN$v!Ldz6Rrx9LfezRAPf39zpeexbfkvY*KN+zGI+6#j4e7O6e_O^IKs@b~Mt
zOYMQY)tz8)&-GA#r9N3|4=a`Q4=Vga`WaGtATM_(z@E|TOZq2|cPAL!`#qH3sPB>b
zSMr8;0><wY{uzC%r2l91*3j3`;QjTClAb*1onXL&{wJybB#(M07~Hcyl;5VmDd}sQ
zl773wzoy?S>5Dw@onUZp{80XF{bEU9<el#XgL~<R@@0CKq%ZQ?cY?va_e1%Q^ms{M
z<jwB{gM0Re@}KAjr2COP{heTNum4c~3;k6|e_tr+X*GZo46FuNF6oa}2ROmts{}&%
z@APo#exy|cPB8cif>8dT{*k0#T2bHxgRd+I<&WqOOZugi22L>eii1#|8COgCg-H?;
z489t{5nz1F7$E7_rKEQ&e1wrK={G`&uWS4$-CuQ;_!xzcHQtf*8LPxMRQPyfwWQB@
z<2vZeu@B>w^o<q1sj*w?51T6S%@jV>_=lvgR3-j&g>P-#Ea|JY65mGQGmLX2ePt-|
z9TmQ-ak`|hu1b7&h3{qjD&1ebl=$8X-`ChF>94O6pQZ4Yv0l=jrNsAF_(8^8Nq>Ws
z_`wQ4+&EXdABQXPBNYA|<7G*|=P2=G75+TqZb`rADe)I5{3K(Fq~A$OJgqQsg2B8-
z7fHWfCH^9Xzr=7!`lZz<PJn%4d@Sj6h7x~;!e3=PDe3bnCB8u6uQL`%`n=AV0DU>n
zuj`cbw9>^1m=86&OZu9l#M25GC%|4Y9+dP|sKnFC7$+E58FPiCFIp+%1cR@d3FQ|V
z*^<5%Dd}l7jS~#4rfDGQi&ob-!QiWGLixWNd!_#H?@Ia=3ct#DQPLl+$Z>+fSLcNC
z4;xD){XMLtr&T*nFtBRpGD&~5ipL2CU(FNBKW$jj{Ya~OoM7;kKB4?`Mv|moTKVGy
z*e?pd)hLwoyH$y&l|fE0urg?jq~BMRcv>~&1dO*BX_9_v6_FDRzM?3UFERYm{Y5K`
zoB;d8cvsRVtu}Ik!B-xI^5w=FNuRV5$q5Eul@!W<YFsbr^HXCa^yNIiK2?sV)k{t=
zuzIPrq%T^{<OGbrD14QnOZuW!PEIiRYNt@X+PFm07p;DB0>)bu{s*JCq%T?-<phJT
zkP790HtI<Fq7_q4F!;);P+m88N&3=FCzg-5D14atl%&5fCEla(QRc0Z{-TulXoatD
zPL%XlUx|-Z_&BqNbU(%^@$m|uWX4GPO;X~UDtvQuxAgz9xe}kM@ag7oNx$hzd@F@-
zXQoK{ZKuSySNKlm_fr4aNr~@nZj<!cU5W3Z@V(8Yl0JJY@n<T0mYFZ<Gt2A;edPrI
ze`P7@a}>V6*+kM;e<gmP!VfkNN%z-aC7xEWIl;gRwznjGja1@CDg0Qoo20L?O8hv5
zzrYNW^mTy}KSANAm>)>`nxe!{RrqP<Lz4ccDe<(5&Ity)%)CL;-(^ZXt*&!|fz@@R
zB>i2f#M7!fCm2|D*G9S@uT|o&Q+S_gNc#0D@pBY@zF98mcfJx|sPMO$8zueHiasY`
zyhY&`nwIqckyiUT!Qd<ZLiu~lMpApAm4HrwePVts^{@9T@%JhG3iBCB|0|UE2NZs_
zIbYKMYV$nk*SWt|E9q&Kp%V<OGVCnrmsTA*0pl+UztN18^h>J|onY`)iJ|;I%+IC%
zlU6A@!Qd+vL;20-CP}}WmGrcd(Fq1tGPaQPMJpSfVDJ@=q5Ny+LFs;^6^~B9c#Fcn
zZElzJN2?*7VDOcZp?s;iSkfP@lyri@S4@WTADWXT{m}|aCt$oq;Xg6YknUevS?L6f
zw<!D<W_?M&wCd6cuwN8@kGV&>A89qF6ENPQ@ZXtRCH>MWO($TyMd1&cf0Oh}D>$8C
z@YS55{9#j<^h>KdodEm9ES2<0D?Ob6|00DqTq`Ag8nh}b7_c5d;XSSyl0H4IEa=O*
zzdTC%2!)S!#Y_5%R^nq6KGt<Wy1!zT_(lq!;CfZkSAr7XSmB$xmP`6-s>C-__*B=G
zlD<-v_|p}>wX0I<4_hnoZ4^GkwL#Kfh7#XF;k&qelK#3V@!b^u4A)Ree`hH1y%oN%
zD_Oc9`zrBS3U9f7l<qG}iSMuQgIw=O`W>Xi4_5f$uGNx$Y2~dG;QyoW=eVwu^m~pH
zKStrlyGBU*9k0YsaJ?YubAl2-QQ@b$?vV63Rf)e);V*WbFX{7QS3Bs-xxX$}($i{S
zCm2`_{Ht_-U9QAmq3~C^c1rrXN{Oe{!%i@;dU(C0uj`d~T3PG_jJLSvO8T0k#LrXs
zLf5&HzGwxq6W~v-@OQX6Ncy@%iKkV{PQd(->pn?;i<Ed;!R!QsEpbhk^hYb2odACu
zg<tOKCFze=Iy(XW;0nLW6(!w|tCV<J4ebPjJ?#2I(l4!!b^`1dg@4@joTOh`HSGk9
zw<!G6u7#3*X*IPIFy5l@&$+ykexFm~pI7)|S072gv<lk^uuoi#Bz<mI;%RlZ6JVdX
zW=r~{)!I%l_{!~2{vFpaNuTd1>1kEB6X4(CY9{HkOo^w}-cB&E+PhlnFKP9+6ENPQ
z@SnO~lk`ce!ku9772=`%m#)7{`utK!Pb<frU|{9=EJ>fVlH3XKZ&COIuCpb5(h74Y
z7<{#PD1XS+LeeL#K6e7<ixmEd>nG{|2dzwZg27j*hw{I<rb_zdtJZ@FFgW85GWY>|
z#oblXuc^d`yWNsL!<G05g^zZ>FX=N{iLa~h4cw1P`fQ-Y$0~fBd!D4vI3+$o;hVU}
zN&0M}#3w6!3wK9JpDmR5RE1A>hfDfQSK?bMe0z7Lq|f$Bd<TW^;yz2#XBQ>DtHSqm
zH<t9-Q;9!A;rqC&r2e#z5}&E?Iqv5r{pKj~{oQv-`lKBJoM5oC-4{vvJ6nk#=FXJ#
zHB5;guJEJXr%C!6?cR_6aC&fjXta`kjKYt1zbxs4b{uem!FL`A<tMr`Bz@3M1Wqvc
zjs&4Rb|jGW0X`%ce76EeV6aQvC6YcaQPN+g@K?B3Ncx~%4V-}S7lpsteU+pi+U>vz
z2H*K0l)u3}Skl)GO8OfWey%%J(%)Pq{w9UL#r?B%|J<U)(=G~5z<iLqOnTnksl?L`
z3r;ZDV)r^pzl)XldlY_|yN~pLahVcNJ2E%{_KCZ$)E-tS@w8im6EGj-{#5EuS1a)k
zyC0YI|F9DOnEOUa-;XKrPq;@*`lX#7oB(^o-B!})GfF(|0^tOMJ?}OpebTNFPB8fH
z5TX2w?g~ktv|EG|48ChbDF3Sa2}z%{i-Z#lzN17a|CT#R(hu!0;RKAQD151VpLGAx
z&J#|+c#6V*=-wjfhjyfJ0_+uq-{rnt(iiPk;RJ*4ToKBD?mkb_AMIq}1cUEt5z6m&
zcb4=?yIeQ{<0<Y)NuRXqg%dD-;{IIfA87{+Cm8IYdy}Lu+7ZJEnD22HN&2B3GMs?*
zTnhh-`zPsspxrZ^fbkTCH^SbO^kYanF2J8f;lso3mGncqZ8!n@D=2()*u|25XeSOQ
zV7~-~j}1FR(od`sPdjxu!N5)(^(Fn#&K*uL_%0ryeABQ!()~ocdN{%0JA8!lEyA`+
z`lB5`oM7<XKSKHRu)j(Aq}@QAVDOzmLiu)KmrDAjokE;o@LfYf`A%UUN&2N-M4W*A
z3>3b5*u#>3X@?Of7<{*pP`-EA)slW`_Yo%;d?%7nJ}Yd1q+i;Z#0du9r6iQ^7Zxw+
zmv$|20`?zJ_(5R@r2C6@G;sp#8HFDf_Nt^`+U>*%*q=b*M~5w!^h-OTIKkjMqJ;9}
z!>*L{OFN`E0rrZ*PYfF*>6dm+aRTfWh4+U2L((tpsNw|p=PLZAVK+<qrJYus0RNV-
zb0mGz&MQtZ_zo<gd_mahl0Ioi7AL?y35&y)3}oKX8l)6V9~ZP2JgGHBk6=YD#Jf5A
z^Z2i|ck2n>%lRs8nkM*>JpBP}?-X(TJ3RhbHfgiq(>VVE>$pnrmvVkPyW=jw7jph}
zw!4qW&*J<CTEQ^EM{)i$tvXZi8Jz!Ei%-H2JH&wYRQUS_i2Rcgm!ik8b+}NvURtxB
zqBml9HWvAb>l>h7<re%@o_??%aX_ReAA}TrguVn@RM7FC@c4IG>RQ2z>)Xi|;pGz)
zFRrhGeSMwa#r0LP2V05!#r5^nlP$rE>&wv}#ga`rUR+-vJ!+IVUg#&0jm8T{D4v>C
zik`yeq>A*kvqp-(Uazh%c-mPaMc=5`Hv~V1r+-FIzEB)b?}$jzzh;|W5PTcXf6Lxl
zE%+Na|2_KwTNu#!K#=}N_ETSx-$2gaululB3&o4_Kcu^|1>c#+uhjbw6~~M6r?Jg=
zkqV`+<mG9{+NOx~qW<d|Q?TTh;=TO%SYst#96`KjU-3r$34#~x>lbz-mgG~ssDDFy
z{Q<#?`VZG$xLxp~{-d?_Jw*PZ{+Ti6Y{852M;JYN3SQK|%b0hTI6j$|r!$+HBKU7{
z(iFWXyCO-X7xh2Gc-|v;QU6yN=i<c}R6bGv*BRzG!GFl}i`Cv+FL+V^3EHbm1uyD9
zS$k%-;6?qXYHzj^`HT9WWMp6oE9EcBe~GcPz2HUtdyOI_r1)fhzD!n#AH;uyuN2*4
zvlB&nQU5!QrD1{>^<Qp0Q7zJo`v25;XRP2$cz&(5Yu5>0)PD!9?GnL@`tPO<#*1F)
ze4_q)Y5!;=@)!00ijme&@S^-B#*0{@OzB1aziEsdB92ey=NrU6Nf*4he}}U(nu+wH
z{N2s$I)WGXZ*TJmUO+<miTgLp{P+UFf5P+2($b$1yeNNvt^EqYi}DZFM&rdZPWeY@
zjj`mJcv1dzb0{(<UX;I+nc7|OqWta5yusr5WTZ*a(RtuRlwOqod^R9iq!;DC*K8Ig
zcv1cp=5W7AFUr5#TywtQMft~SWq9!n<tNI2fp+(D!He=w(e@V#9t7u~riFD8`HS-3
zX7)cz@S^<pnDx2}UX*{KIsI&Ld@?_NGD~SGcv1do?3|_|y(s^$=5G;#7v(ox>wXaF
zMfp9h{PP4a%Ac=Yzftg_{Ij&5?i0Ky|8?5@`GObapRN6~qsU*B|2s2tpx{OM51YSW
z$vV}CDE~pTV30Uols}*4v=F=~|1378iAXQXKf$#NTNcpqqWn``I$mf)yeR+0uAbus
zFUo(jcKYLj7v;ZQn{cn-Mfn$LP38$+lz)l#X@<yOlz+IZ`vAd<@{f1z=^%Jf{&QSw
zQ7}5cDF1b=eiy;Vz|%cNpTq7?5b1A2niPGzYm`gyc+7%--8FK*NdFk;-*HVmNAP&e
zA%3~`Nkfr-I*%V6*7Xb#U&Q(GVRxp9`13jcv@0%G@S?oMuBGXMAI{^Sb3N5h9G}ej
zLe{yH;6-`wV2{L$^rF1s?oOuQMR}v$ad^QHU9Tu_19zLzf*0jorOk*H=|y=bhPA*J
zT$Emv*Bf?iOA#;1d&Cu!BY06>(|yzFf*0le&DCp|I9`-@F<aJF@Ql~*GPc%!KF#6R
zbGG~Dy5jgXoFC>Mh%Gee{4;rdj&}E-D0tkqsNZ#3o#zDKhVvV=B`XELjq^`yEm3ef
zemmzkY1wClmamUH4_gjUyeNNv_se#CCQqN^ZZSd}pUn9c?49m{7v*2WmNys2i}F9_
zel$k#Fw0QBC)`irMNE`Gx<T;IxSyIVc%5HQvGz=yNI!$e&j>rWw}_{mhf?%{uyJRK
zc=7yO;m(IMv{T-P-Mj4g9G-r)I|CI@@yVQD&kl4IyeRJzthrR)1MUQ=ya(L{zl!vt
zyngo$lLRly`?5Chw9xXtr}gh8;zfDi)ZXnCTHepy-XWpot#S|REqGDh-R>81#qmOa
zEy7xz8Oo=Jt;CH?*VB<-PrI<GIFNXezEjxueL~~Aheg}Gi0>UXCp$EKR@m~aP`+Q-
zbA3bkL1FJ_hVsM0%I)(F=I6gO>=7*Kr}K;U{e$*Fyhx91p|2#pFi!B|`kL#_ssule
z$EWLG7YH6^7}B@XpQ;r6mps0+KJFTkzv!QS){@^7@ptfeUH`5?#Ea_-(=)IHo60kY
z$Jf!@KQDN3{swx}hXfBb;e2s=lw!aCI9tS{8$kS6JyRFw6W8O@VV>~(1wUVp{6g@e
zzr9U=&MSB{V;sLwH+BgAbDrPd^akTZ{<v)re}VqWHW5Fc^HcPP#)|lMoS&v=Zxg(@
zo_zhn^@11u`7Awbso*nt`fK%mcMD#Wf3rR-QRFYm`-OgbW5J91*rSJiD|n%g@AN0G
z5xmgHK|Kitr}`B7IHGsDUgR(Iu}#0URKyE?yr#c;t%w);cw0a1Bf*REm+3ce7Q86`
zNBV_p1uyjRiGBvQl%Vs8_SDo^8Y}V_<+qH14FoUBKgbxhNARNj!;QgL3SN}|9OLs{
zf*0jK&-m$5k-sQ^s`1U6B3_igwQ=VqB3_g~!&v;T;6?en8t*<Wcyaz-#&7>e-Pyp&
zHC}&wlFWv#rJ+Hp5nG~SrIFd4ylKjcgoH&TK@c{Z>?T<@FOms~28+<pAV}3q5V|EQ
z2n|AmAc!_dHHbFVAT&tZ_%}4wwEh3iJ?EJ{&&@NlZf5SC^?b7P<hl3U^E=;jo_puc
zotZm#^O)m5y4~Sd^7u@z9+$Vf1h0UJhvUD$9lc}JJbt*{+X#%tJbxZ*H>`ojJb#{Q
z_vTwXMj0?)R<wIzwAP!`Zp@3kp6AbX?M|=e^*n!WYPaW0JU+?W{?>N;KFni||E_jF
zyPe0C-uk9?H(kMFo<AS9qfeAI$6FGghc_Xc$9u&;v*v%N_*LifdX9hpc*C1K=J*ea
ze|k3i=X`zIuH#Bx&+&iO?$S}bp5y<bUD-+=bNt)eJ^LV!IiGFgC*Q_nj(?Z<T|eP5
z$3Hm!<(@j;$?*p|=<)RU<V`&0{QoF^`7|DL{EhLM>v_!aUll*7f&KITds6(i-|%{l
ze?<I=b9p_-e@6VlS9#3yr#gP&QXU`c<-0Ea#6li({O88oUBhFJ|AF{f-(>&H`$oKE
z4?SKNzxppc=J?-@KYl)sIsOmu`E?$1{2#|psAvBi|0D6LS9m?g|3v)H<9R*DzdZiZ
zZ+Xn|KOaBfS3KtUSH&ma#bb{D)%f^1Jm&cKC|X{^{yF|$MH6?^;~y0L{39N7{6`mk
zGMUF5|FK2)y~AUUzp7~3IQGx+cP#qv%e<cB->+zwI$qE5A5iq?S9r|vA6)eEBRuB#
z4=Xz4P9AgoJ&S&O6^}Xo^NaQ`X8#=jEk&>Gs>gR0J^dk%IsT@iE|Yl7@!wx`<T@U6
z{0|r1K9>D+{1+B2d5PC^{1+D;K8DwG{FfJPdzr@^|D2-9OL)xjUsv?!1w7{XZz?*g
zk;h|VbiDX|(GN!QnDyQ%n(-X#VYkEjKNr1z8n0))jYXqY@R-l9J}LU<13cz@Y$<y7
zXFMM1ZU1@EvzPFg^*Xg5dn%7vuS@%~6<V)r`+pAS^{jVj`{~c{nDq{C|HS<~X1!kR
zFT9z@tan8Fx3A-It*1Y#ecyfA|4?syMf;EU<}p8iT;2W$pYWLLbA9{$F640%2eAX&
z&ToIhpLxvnxvl;0&u9M}|Csi@U*+}pc>X7}A3ufHbNmzA|LAu*zG>|bd4k7-J^PvM
zkNY`~kN3uxwEyOfJm&a+-TsOTdCYpxwSVJv*5mWXm)q}q0k3Dh)$ND8$>Y(Uzc<>y
z{UncBZ(aMhf5Bs(FMn!3Z61$V??3GyzzYXDezRV?U1q<g^}eyoQPX%m>+P}2nBVi5
z^*Ziy=`tR(-hR7W-^63qJ7AYi@Lhan9FMq<IfUqcWq8hb3VkuY9<he{QE~5lqWJ8%
z_nWQ7=fu6=T&4a<Y(v}QFdHkz*CjB$V#TB5F{CY4jIT@Ja2YEe6Zd`-vv_PghQn#B
zxHj(nMrAR+F0mHl(fFFgI`r+Jw_e7O^?p~$i{~4-M?1waLE^+d?kz8g#a7Vr`ndO-
zw#E251*T7|n7&3qIt_8}w_m9rOk-?6i~5Oi@3%pVC&j(r@GQpHDjuihQ{pi^eZ`9L
zwTj<RKNZ~6BhF3eDbCI4+d*%Oj3E~*+g;+>3-^>K{glLsb005G%yBQD_&NqozhcD~
z#A6>(kFR5VN&Sqt_uIA9SCSsK$Fz+V&y0J&eOi1`-22VaVthRV<%<>LYZ;GHe{np9
z^2UlUfnVwoC*_giq&&8R-Ub;%CRVnO#DjB6FV04Zv$HJkB5__Ob-!HdeudP1w$vTH
zS9fgh)%{AT`&Cl+A4}cw^^S)quB)Z)*JP+W^sKrcAn|mSy35x<$_|$0hw$s+VtgG0
zPxrCn>rfBsuaC##q&F|_{l+i#$I}?w<7G*#7+(*WOZ|-!AAS_di*J71`|Z`@pT@o4
zS}n%cLMR@}r^z49gLcp}^T5kzH;D(=1iblqi{ukKqgVHy66dY)*dHjq+v46GK#TFU
z5_&yajIWb)l-`@4*dB+ESn(Zk@3(D>?~HrDNn3nZ-208$;)PQ0yW=q&hGWI|aJ?x`
zlRt{L9rP$(ng?E-35ln-#Mvav`^fTsvLF3I_M>}cKccUnkj^66kI;K@V*6RN{C?Sw
zekuDAzK-JUM~h`YdQkSGhcfI((6jcVBP1TY2KMr~MB=QJ<pU&6e2wKT%IBjJC;hk<
z#j{l6MDN9k?Y%f3lQ<ujIPtX>FV1BW=aUlWQyJofo)zaY5)TflUYzo^m$D(U`~->f
zX^Hb0iSt>BbA`l--is64dvQJ|aXv3`z94a~lsI3MIA6*TC-kg1age7BmYpJTu9AG>
z$<|wrC-D`O$5$lI-$<Oll{i;RoantcvAq}Ps}kpH66fm@=NgIgcM|6t8RCSV73ZlE
z&zTbET8Z;4S$?+cM{i<(q<G(od%q=K{I(pA*2TTw?k+|@g609X_nv=Xzlg@~$bS6?
z9M@?4$GG<!$HnU<zCXpi-yEj>i0<W0`^~QC+hO|>8ACQ!hKq(?-o{Ft^kR#a*UIv7
z66Xeq^F4|4eTfra=jlxP=)E|xy%#6!y*M{YoF7V@A4!~lkvKPHh!fjeagLXG8YIq7
zB+iMl9OvxI5qB}Z9`pz5H=`cZ{}tR6-{0ciZ=+N1)g9Z<rsep$5MI8;inqw~&u4M(
zH>!*OPmb&V;OFz=tvJq+9rC#qJ>_#7`gYLUE@Q~W%BDy>(<RO?B+d(D`3#BkpAzRb
ziSu6)=a&*EdM{3F@5KpwFV25UoZBVN|45wwl{o*GAx>;>#W_>rxkTb@Q$*p%$}W}V
zmr0y$i#VV7nv$2#coFBbsEG54-is64dvU_vi?e+ZKcDYX#QDV6lwL!gioa3hogWqB
zYf8?1VtXsj%O##4<F}*`ADxd~BmDyEM<XB9*GQh{i2YprwiT9l*-f~vmF3rCAzIly
z8Q+NCV8XbavAao@-yDloVmX~x&6j==^^-84smJ*hwX&ay{q3SxB6<jpEXwZm%wlDC
z$@p&3Gj{jL@?YRLa$rj5M+nL5o2b7i&gWS;Poh?Kuh{>R-~Z~eyXZY2%OCX2Vr37>
zcnQBx(9YOBBFmRbKChH~qWAK7mE;rWJD%QSV*jM@$=Aoqo|5IuMek`DKP!C3ZiOs=
zLGpQn<P$wmyz>@vQH=8zYGo_MewFZjQ}}R=fGo;zt&CdPY8m6T14<cdXYBCW#j|@u
z@_7f&kFcK3Kd2OR{sHtDoqtd(`@Pt|EqwBIxUzM!oDL>rhie#~UtG(Zjd43;_pU5|
zPxx^D;LR8G-h9D%gg0Ms9^v_UU+g~;y*-8RFS7h&&n#AklYUQcv*;PSzshp#jFm7g
z#(99Jhu+h}`GBYQgy?-H_MeO1UZVGfEZ-)2|B~^)MbFr6m*xKxJv^U#dgwhpJg<9t
zcwVPghLaXA?l|8gwad3euSk~ff`b6r;h^l<74yAy+ZnsvWceO#m=Dj(o*sHn56{n@
z9-f~)KX`A-^Ybmyldmh5;Uv^szK`hbE8}mAp0V3cmg6%GgW<3k&ySeeUcZKVJkO#8
zv0^;WQY-5s_6Lgn2C+x)+2i@nv&ZwDXOH)Gyf_YN6FVLY==lb_rq_EMc-~o0V?6Ir
zE9)lq-P?HYZ+F>S^7nn=IGpc|+s-V<d#9fNB<>kPesG*$D*bP$$MXfITC5n)7u3pn
ziG4q@$MM#)NAKC=xb4~Fxb4{=A@+E2<h{PadT%*Cv*hXGvoU*NK{2-XmJg8S10~);
zGCoemc(U-e!;2W|yU5o`%TAE>C(8PhWjs{I!`j4}NN3+7u1}|;*h@72HgsWHyk8N&
z-o)2Uz2~F4xcB}wJx{|$^Xmp&`|<QoYlB~|!gigDyz3Cf`xkkiZz%2}9H)!j8GLVL
zT2HO)Oj$lk;={FM&mXRNcP4)ah}~#ej%#WA(elzF@A%&3yRshF;Joc{t&mz7t|@xs
z2{OhtQg3`7&x7IvWjnk$^_EX+gMAHt&GN~z9M_IKe^X_gY7?6xcK1+^e9<nS-fp_s
z;Tq5pvfSIxjNciu{vz><_f|Z8yaz+A>=GF_a^K}3i4*T(dF!u`^;gOm*EYTF=d|JD
zaaWutz_9q>qS!Oke^27W*LraXi4}K4-l#`CX-ZK&slL>E{;w8)coFQ?^UxwbPbe$m
z{p~P`=UTD5Uh;|c-uClkIi0kkmE9!cpYlD*i@S^6&9eL!spt2lo;_s!t+F2PWq5uT
z$oNhf;~KTcjrVH0!yujidt`Z&Z}~4|`F*neA{qa(P3!{M{$A>lFE3A~Ubt53={(q6
zPtVS*e@NCZ5x<Yf_*XJsDr3BuBtKma7rrNC{gbl(*D_u%<7e9N^Etjg?LD6-iejrM
zzVafzE>KYv!y!FZoJ3uyM?KAcIRfK!J)aeS&r3afNj-Z@J>~1wWiN=`i?V-WJ+-oz
zWcezI57*wkeEe4S&%R=}T9&^i_3S70JVMsLF6(h^)${v?jMvH-*FZhLZ~OL7T&(hz
z|G~F^{!y0yNw$Ai#v6S5C-P<OpYMs?2hH`g_Ro#7{v+}G7a4yn<4<I~nfosC_4Bg7
z%KE>{`p;zie=^=G$J_pLyv5hlz2ohX$PY}5kCNkUWedmK&&3~JEP4Cq(Q>>UAjjKd
zB;WrMyMIePvEIu&UJQ8o{IA6KKN+`a%g5V+V%N4U+u_Bocf1`W^*mPA7s-0L-F6vX
z410cy+p^AXGREz-yJ1Os|J*~C<HJ1G@peyHF1Ob%!)>)afBUqxkGIH|RnL9J4!6~I
z9&h)P^_?Xy++N%BE4S4yE0ytq+;=%n_zn_#+)mrGKSajeWL(yk_fOmoz}r8E$o_e}
z?4Kvd{#n(+{&|@A!)>;`dY)JmtE7CLROJ1VUh&Bi&*5U1Xv@bttfy91F3aV%+hx6E
z+^4PgdF<k$V%Jxe<96F#Jx^hsF2iI!ZoBPq{!loNlyRkukCyQ<qHm6W17-QKzU9Zs
za=E>B+3_;2YHJ^FkuU3bd!pFkw%Vqi*70_ztRE(E;da_y+;SW3veRTdlKU>hg->py
zU549dd-i9`_UFiWbXz_j8X^1Vsj`2bhV5zp#BCQ!sK@OV==qY4w^itOI3L38wmtu~
zQqMEwczdQCZ_ko=>cnom<PGb+dQOn#=SqC%$#|mFQ*P%_Hc6IGk$Rpj^*l%XoG<IA
ziJz2=<@VZTxUIGq=S*MSE|TTAjkfi?da*3ORQxr{_;O!8kuR&BSBTw}8R~hJte+!(
zua@yoWIR{K*KyyaTKKM)^*6}+n`As+#y7X+^P$mlK2#&;Lu2IlF;?QNZQ*<fx7+se
zbeq((PU<;M>N#HGxn1n;kmDWJd-c3imM@g}?w0Y-rJfVSu1S{PEA_0G<L$Y!{ytfM
zzxes3j2FxJK^Z^ntJ@M;j@xKk_577Ae@wQ2T*kOvwsk&)d|CB;QtW=6p`N&%wwJGG
z#P72*eon^E%XlUCUCtA}7iIm+vi=nr|3=2ErJfB^&xumcNm9?r66cf_>iMepTO;*6
zU+Otk>N!o~`JLGPUh0YUUOm^!^0y?uw`Kf})H5Y^e~{(trJmEJo)^gaKgs$(i=PcL
zeqY8P$oNBF-9D1#n|#YZmgS$y_M2t=H(x!GFRPw^7rW0g)bsyj{Z{e&xs3lQ<83nj
zlKU=l`<1eP%liMw`v1u|M!(RE=dHH56FvIk8B))gQqPN|o<EW}XSGnzcH$4W(e|D{
zFP3^<BK5pf^1X}LeWM+pk6^u5PuyPHi>Cx{Xrq<wE@RwQy9>s}jbew}YI}Bj;Twju
z{4%NM<+A=;vR-bdUAB*mJBeT1Hrv}Cx68Kn!_Kn2i*Gq@o9)@l?Xt@blyTQ~_Wp@{
zS@p#2v%T#Op<gCOoOqtLo<F<EdU^vNtqix%_Uyke;~p}`ZL(>3mn(!XA?qt-eJ>gJ
zmN9ON?bUO()bmQI=T%bAA4{BbTBv6~@z-DKd9~E@8mZ?`Bp%#W+l%`ssVCNZJe9J1
zfW&u<j0Z_Q=ZYO}qwQ^v+h=?AyjJRYova@s>rW6rxQ(`FFSpMwJ6Xo3`09q+XM1)d
ze9KRj<#N01vXL@A(^pUA%c|#DVu#yiJL`FltRF3L*2q|Hn_Y(6Wqa|A<G#!F!Z%**
zaeHiU{dqEOkntoLPnPldQjd8!|3RXQZzzhLM*WTA54Xwo{G_BFSnt(ix-6I5Vwd4|
z*q+@*QjeR&?nkoxVyVY`em&FWr?MWm!S=Rml(;UF@f9-0ZLhucSIPLtGQL{IxXrb<
zelGW2ZWh1S%KGbN{S7j{QO5IS{8JhKO!DwE$-^y@hg-$pEn;_@<N@owJlrnJ?+|}?
z%6OsV;Wn|mTbBP^@^HK4VS%j2?W{eHd&SRvGQMBNzm)M}89ylFhh@Bk$6f9ae~-%Y
zrP4nx_RDZ*X9Qk+XA!@jdRGx&hh10{JCM$Q?=Fh<p#GjB@3)WXe7Hf*ho?yIaX%^k
zaNBC{`22I(kDH2OBgy|SB#x)W?petj)_dEpkmYh4>#`SQ{G#OTUa@;gmamfK_etIs
z$@*7h{cnYHwTxer@#`}F9sL44;=*y$(|<#juk|f|Q<lFi+pm-HAKJyPlI@pKk9>8Z
zJQ;s~6uUoV*q`5(^&7<Rdoun&#v6Iu<$j6pBU!#l`cI_aEZhA}^8QQ7`va2q#j^e1
z#qKl7JJx&L|0m10ioefg{7=d6gJQQ$mVYVBAL7@oT^^S8|CaUt5kLQxu{VqH{L=>S
zr$ex;9X+Ct%ecLacj0lDCF1WJvV1q`cbEQ~vfZBeTo3#dKO(%33h%FE`@O`jW1P<e
zu-?<%TbA!D{yNEczc`-<EET)&$nyPV`D4QSxUBCY>r2JYcV&E#jJwMCdon&m#)rzd
zOvc@1{Cyc8F5{juE|+nIjC;wrw~YJBxSx!FAmjcrK2pX<$@pj)50LRde6EA?i1%;2
z{0x%i$4P$iK90A1uq;1b>^I2r6J+^`VvqN6Jo}Sm`A`|3BHQ787H|D<S$`_tx5ol{
zzr|aAnk*lQagV8W4Lyz?c4CjZ8TGX@dZg-Rq<U1JdD8Gyd7`>%$be&p4y`_Vz>w;b
zjy`eF@S#T^GpM|xx_ZjwDbpKjQgzi+>&H(>RgbApO{+@{=yO4$PfxTV!%iAr-MhNF
zp>Eo=As1daXwXo4xL`!j>Jin$MkK0-&1BJtq?j#LGbT#5APFs332mqw7h*p1p%f&Y
z`Oph@dZtpCp7ap@^voa?B%i@{y$pgu6B?+9Su|VT-SeRoB%S%t3!2SfC7d=5(~};;
zpPm_{g5)!AY%KcKo{j<)F#{wOG0)R8gHn)m=8G&yHiMOL;zUeOdI*1dW{?V!&%Ch(
zNob%VW`GP~dS*}xlFodQ1<7Wx5;inodeTGq(=&rqkbLHiEl5HG6)^*32-7ozQjm1!
zi!4YsgO%{yb1^;XA^ho?K`KZ-^Trk=p@E8+0WyT?nL#N?I`c&qB%8rXSYMCnNe|&q
z&kRyQ@|icbAPEgr#0-!jOwSBTLDHEovLM+ER>BDrFg@uZ{OOrNDo8%_#ug-@fr^*`
zGKA@wK`BT&^F<aUo54yrZXBj3J%m3!Ge`x=XWrO?Bs5SFGeCwgJu@f;NoT&uf@CvT
z3CE7b^rVOIr)LJKAo<K2TabhXDq;r65T<7ar6B3d7g>;O1}kAr4W=hOgg-qqNCnAf
z-q?a9G*A&UK!z|qGbjZ~XFka2YHqB@*vS(o)=k2H8tNyVS2y+hlc%KWCr_Fd^WN{Q
zNu{RNkC~pT!+8AE$<wFAs;g`2YR1%8H#AIZz+hUcX6$*@V<((fJ+7v{A=YEk<Wyac
z<4!vD``!x6VEpu&skN~l(^6CMJ|p^>6TP1D8=$6%M0Iujq}0^O(<V<%4Z)kJi9XfG
zG}KI+RzLRWhVeruH`I@vIcUc>SF6S(2GO39s2<+C8t<~whP~=jbyI6nlc!dvrq<x?
z*&$dpDAB97e%!dasdbaa)>WrwPN^G&SijO7C`e=h=1f823%k1fURrCcZayLlv%2|+
zFYM~_8$_+Ky7`DK%<ASNzObvy@2|AR>gFS|Fsqx7_`<F(zdg|!tDBF=!mMsS;tRXF
ze09GyRyQA!g<0Kv#20pT`QmtMtZqIc3$wcUh%fBw^0npGSlxU?7G`zx5ntHV<x8`z
zvAX$)EX?ZWBfhY!%U3pAV|DWpS(w$$M|@#dmoE&q#_HxHvM{TgkNCo_?#!9EU_Y~J
zOwU$#B{Cn8g<0Kv#20pTXUsr#XSBxZ<|DE&tDBGb!me&z9jaT`8mpU+$il2{KH>|z
zy0x{aZf$F<ZayLlv%2|+FJN{1;9W<&_t(q%3MD^73>tJU-rF1AtNGuE>aY0jU0|;P
zvKrWTJ~F~b)qH0po7Y@3lFfHMGQvlqd}kz^*IYA_&38UB!h3JNGm_0~t{KVZJ77k<
zFKO3IP1V;lG|co4DRs5g(=M!;lI=^{{An9L!qBlL08d`@!e!+5grj40>xIk6?~F#r
z=++CDk>4MTj?t|bE+fB779FEoFI+}`uP8c3w_do6{EkU<jBdSf8ToyK=osC4;WF~o
zb3bFantV;yuNmHRvRf})M!vEc9iv+>AS3Q<<9$9;e-P8WM5B)@;{@s}zcTxZz5-PJ
zD|*ZWvw2CA4`zq29GM*+^T5n^GfGd`oa*fGl_RsmV;-1&C$c#)JACEH?C_WeX5Wcz
zPRtHpIWjvu=7HIFqMH-5!&i>X4v%?Y_MQ0V#O&~uBeTO}9+-V6!Z|TJeC5dO@R$c?
z--&Tf%nn~UGCMrxf!TMWoD;LdSB}gMk9lDBov7!;?C_N%v%_N^n9YUMe4K|leC5dO
z@R$c?bEz~R%nn~UGCMrxf!X&0EvLEd@RcL8!($$peJ|K@Vs`k-k=fxfAagn1KC7QJ
ztqxb}Cr|QTR$_>6Elz2uOVv5w1RN9a6=qHf0rHcRPH0&(uL8r%nnNL!tT}W-%bIx|
z8D7>L3ZZ1pp%Yrx%q!9GvgS|-C2J0y(6VM;%Z8UVhe9Y>bLfPYHS=mXysSACLdlv#
zC$y}Y*VEx;&7lxV)*L#aWzD=I4=-yDg;28Q&<QPT<~4nIS#v0ak~N1;XjwB?1;Wdk
zLm`x`IdnqHnz^nJUe+86p=8aW6I#~Hm5K1O=1>SFYYv^zvSzMrgqJmkLMT~t=!BLv
zb9E%VtT_}y$(lnaw5*xyE8%6$p%6;e96ABBR)L$0@$c+ZPoWQXdKZkm|J5{9k7<}Z
z_PlA$pY8n0w~nIU<)NSC8QzC(95rl2IewgH_<*nax$=l(3Q(DdBP(z%`Sm*eh)wIM
zWeYJCu$C=ER^VFlRRsFQm)29u7Gf%3EnA4Jz_sLS8}#!it*4eP#8kjqwh&o?Yspt!
z=(j{#Pc2)BserX?A+iG3lCJ~N4{x-dTDA~V0c+VpWCgAzU!9^~sc1d5Y$2us*0P1j
z3S3LRW=22h(0XdwLQDm$WebrNxR!h+kADB4_0+P3m<m|S79uNfE%}-c{a8Tjsbvc>
z6|j~qL{{Kh@|7sMvwrKTWeYJCu$C=E7O<A(Nx8j4^~9Q)W9q8MOs$zTb^`rO_D)>7
z8#D-4`TEsOsu|NzS6x4D$jE6^@r&Kn)2C^_{7ofX+QT)zL4$f-P}4BIZqNmTlHSeV
zhxe_v{`L8)*ZsZ*90BIc*MO!l^UQn<=<7bu!sLj4o`p$Mn0aPCIQ4a(XJK+gKhMIX
zDa<@GA2s{B&$BQ&qMv7B(iCQ%nGffE-RD`D9MR9SFlh=i&&<aezwYxaOpfU1S(r41
znP=t$pkMcS7A8mZ^DIo7!pt-Ck=d{NJPVT}`gs;6O=0Gl`H=C~eV&EM5&b+1lcq59
z%zRY#>psuI<cNNrg-KJGd1gLb{B@saVRA%2&%&hH$$6G+h3`Ajn@&4XoYsm`n979m
zo<LzL6B<fkDig|8^ukmoG?c<rCY0;Wg{e$vD21s^C|7C=Q<>0E3R9U-u5A{kGNGXq
zrZS;i4J=G$LPIG`WkR`rR+!3!hEkZygmT4+DpMGoP%dl~W}=0LQkcqwaw(uNl?e@H
zCo5CY+Ae9B{XbPVBh{n&%#((v@TuIYAp?#XI<)%e0Yj=!I{L&x!-pPy%pmiz(^g5a
z6IWzfB}ZXqRsOGGL_Mp*A&7ofg~L&pS(X3mFHz5`a0sHGRpD?HW>)3@+ELWADjb67
zXH_^Hg_%|PzwQ<FtO|!9`dJkYM`31F{;%0ZJ*&bYh<;Xu!%>)7mH+FFQO~My2%?`=
z;cygYR^|U%Y1FeS9D?X)RX7}lnN|6}WF7Ua3XgziR(<V^9#LI;%l~ESsH+hULG=50
zI2?u9$Mb)QJ?dE%4ng#@Djbf0vnqj`dQ7Vym#VIveBq=(_X%nKQQ}1P$+!myJ|CRu
zRiCPxT9cYQwK_Gmram=o$nf6PgA%=J>&K0&n_4$%Y+W_q8l-oyk7X7v$jGv3et_u$
z+)Aa@W;53yBg>}wVWw7{&0K?wESu(Sj#iz`T!V}(o96O<tIlSwK}MEMb6LApXEWCz
zBg>|_oZG6inQM@dWz$^7Y}MJ!HOR=aX)fQj>TKp3WMtVim#tcLHggR!vTT~mPOUnd
zxds_oHq8%Cwd!o<8f0YIG(SYus<WAEkdbB6TncQ}*~~S_$g*iJfwk&v<{D(cY<i#E
zy|88q{T|mubW<iztG=*4HKD%c%X35d2e*1w4^PrBZS@Lt$KAY12ECG+H{l2q&A)~f
zX`*+Oj407N3P+e|{;8@+6TPEkM2X%}IKo8p??^?O=p7{^O7xDx5hj{{<SEib?<g5j
zqIVRIFwy)AOpzvfN6Cm1y`yl1iRPb2iZszXN=B6E9fc!IH2-!{q>0{9GNMH9C>&v;
z`G<ufP4teE5hZ#@;RqAWzxoqtqIZ;xDA79#N0?~-NuEd(y`yAAiQZ8-V4@R!@Szy{
zWoe5ajqzT4<6|(xE9j+nGT;YX@*)@oCA}DolyV2bC@ATbSfrFY2u49kFM}eb+(9r3
zN_q_vDdi4=QBcwgfJiBK5R8J7&b}k1+(9r3N;>t8lyV2bC@AT?Gg8VO1f!s&lfFnP
zcMyz%lFqmyrQAU<AZ0~)b@h~*sj2!@{p3mB+bh*|=TEO`m{yJ9)cWxgQZ1kG%^Zf0
zJom1yre9bbLZ62AelsySrKW!B5F}&Fph3g?RO25$(HrO{w2{YFfZWZ{xucI2x1!ty
ziY;L75`C-beZ6UQspjd|@=Uu>XNx{IoGn`vQHx(uiXe^vFZLpcCXza(be-q}$pxxY
zpg2OWQ=n)fsnaxFC;F&!f$9_}j?n8AD4Iy>G*Q=yK15xhIt7X&^g0EKCXzZe=sMBI
zvkO$GKyid#r$Es}Qm1ouo#=z#1*%h^I6|*eplBkgQ@ySeeWbiVbqW+m=yeJdO(b=i
zpzA~*RxePU0>u$}odQJ@Nu9>&I?>1A3sk2-afDu{K+y!OQ$DU?)ak0x$L+IKEkL#+
zkF5Z?tJS%q57)P%+y#m)VD5JAO2Sy3E&A|$wro*EAzfby6i0v=A5m5~qOWv|oSloP
zM%RfxmS3Pc1&Sl|It7X*;QmyB+k<4hPTo*AZs#tO(_00->0jVW;}L`teTEztoC}$u
z7Q=}?LyimJh0IWk;Y6Py$3@mcW~jw*qR)`y@@643)M7Z%XUK73v5*;RF`Vc#<hZ0)
z$PBd@PV^aaTuduuhFT0K`V2WPV-+$(Ert_)h8!1=3Yno6!-+maj!QR%%utKrM4utY
z#UndI(TC)??osHF92XqykOI7T&BIH@7Q>0YXpR@xh0IWk;RMVOeeYoM)Ks#?&mie5
zFXqml=i=o%zmBJu@;$%m-3Ick8DNU$SviVan_F&1nd{7&Vdpxtaum5XxAciJ*O@iL
z&UI$xC~|FX_!DKWGi!#O>&(hKm+OigkJsM8IyiJ*WTPP7@i-C*aR%8ah|SG}oA;+k
zh%?AWL2PdL8!>SP*(iw3O?e|G&LA5FvAJ<>#Kak7qaZdnw~d%MgKQMU<_5G86K9Z(
zg4o<7He%uovQZG58@WbIoIy4UVso=qA8{1YJD%95Uz_tO-&gvChP+k|cFMQod2VFV
z=AM_ngok~Sn?W{;I-C1aMogSRHXv~VU!1I;G_4L_!NfN%=^E5dy`-TVhnkB|0ZJW$
zdO-g29r&xKPZ~eHW@>F+ZIqb^HI9He$+0Tt)mLHWgiAdjf8J{0iY36_5o#O(bCTnn
zFt1MwGbdc?0r~S*3s)?Km=mrz0_G&gIbmMG7iLbl)C2P8ZBDpiDa4#`#St(kInD`l
zjiWGg!lfRNKW}rw6-y!Jge#7KImvNOn5#gAnG-Jcfc$xz6RubaF(+Jc1k6c}bHZFF
zE6kj5sR!iG+njL4QiwU>iX&i7a-0+9N@8K=giAdjf8OSVE0#jc30E8ebCTnnFxOfO
zGbdc?0r~SbCtR@<Votc?2$+)`=Y+W$U6?uHQV+<Vw>ja8r4Vz%6-U6F<TxkH+XRJ~
z6E5|D{CS%bd59&)TA24u3R4T0dZB8Ohgfo~g?S^XFtu>07pfL{h$Y8bn76nJQwx`R
zp=#lZr4Y|st~dhbB*!^n-UKYnoN%cJ<j>plmMfM*%n4T<0dtZ_%9s6X8g}*_S^VbU
zph4-c1&k=K9+v(9K+E^c2vweI@|8aNkW(J`y|;qpp+)(q^1$!&6f6%d%14z4es7~-
zd1z5Ssyy)Z{DS47Mfs@mz}K(~mWLMQqsjwcw=Gy6T9l6}4}7h%V0ma!KB_$M^|^xO
zp+)(q^1#=m3YLc!<)g|2Uk@r+9$J)-Di3@ureJw!Q9i0X@O6-a<)KCSsPe$C{R@_d
z7UiSL1HaxaSRPuG50VGm)s8*^T|J?$W=bv}{yjOsi|zbsGHt46%vZQIW`31}UgLoJ
z#G3Q!qRw?5H3Q~4kIFld>z$j|z7H@*GOwMQ0dt*a+JMK9ovXByn=0M%1-qTzmz<gb
zbDd|}fVtkeO8Y+i9Lc<PY6i@8o@oQ-dgm(b<PLdWJ2eC5I?uELbG>tw_I-dml6mda
z44CUY(+14-&Q;pU9rC<(Y6i@8o@oQ-dgm(b`w)60^V+EyFxPpe4VdeltF)6l<azDX
z44CUY(+14-&Q;p?LHbDMwNo=-uJcSAFxNX*X(xBc^V+EyFxPpe4VdeltF-US0FlgV
zr)I!h=b1KOu6M4|PVSKBwNo=-uJcSAFxNX*Y2OzbBAM4t&49ViGi|_J?_8yw+#%0v
zr)I!h=b1KOu6M4|zAt4&GOwMQ0dt*a+JL#<xk@{^L!Q@8&49ViGi|_J?_8yQUo44a
zUOP1d<~q-`0du``m3DH6Jg=Ra0dt*a+JL#<xk~%Kq!Y=!c4`L9b)IPh=6dHU?c@%5
zUOP1d<~q-`0du``mG*t%DUx~Z)C`#GJktiu_0Cn=$sO{%c4`L9b)IPh=6dHU?fddr
zB=g#-88Fv*rVW_uovXByJLGxo)C`#GJktiu_0Cn=_XW5}=CxBZV6O8_8!*>9S7|4A
z$n)B%88Fv*rVW_uovXC(OMH>cYo}(wT<4iKV6Jzr(oXJ>=e1KaV6O8_8zk5L?C*zG
z*H4_%uoItG-Qh#KLFRe5F$AeaxRKCIjI=iVnY_Z*CTk3l)+TEtk=KSlS60~CWQ`%x
z+GLF+^4jocqY7J_tT9Ado2-#UUK{>=Pho45HHJuQlQojaYr~&WDQs=B#t><3vPKel
zZTNE*g{@827$U7r)<`0+4S!aku(in=L!`CI8cF1};rF`>TbrygL|U7ykwjh_e$TeB
zwaFSoq_xQ!N#wQR_Z<sco2)TJTAQqqL|z+y@2s%3$r?kXwaFSu<h9}Ve+pZhtT9Ad
zo2-#UUK@T7qp-Ef8bhSD$r?%Iwc+dVg{@827$U7r)<^=@1{cMr)sIV6PtW;A7AFm_
zPV}lz)lIEQO`ckvnp#tznl=Q#^*1QdtG0gJxVouzlg8Fnr)Ey68x)f(<zMOk69tMe
znmjtbSl`O>m}`X5<k9g(?pBt^TqBGokB%=6x3WCu8euefbbL{@mE|$l2&2iP<BO54
zERVTH7)>4>U&L!=dCWD!X!7Xz;#VunW3CZKlSjuFjapeAbB!>XJUYJE(#rCfYlP9{
z(eXu!R+h(HBa9}Gjt}m)vOMM*VKjMkd{DfV<uTU?qsgP=gUPKdkGVz|O&%Q|gl%Pc
z%r(M*c}(=Ft{&Ggd1ftNKC7L4;iR4TWUcw_75YGJSoth)q!H)UT(08Zv}w(G%`wu5
z^J*?%wf?;37-__LHJ7tme_nHpG~&FP%Ui8KuQ^5<abC^kuGXK|93zc5ujcYs>(6VB
zkw%<Xb2+T_=QYPjBhIV2Jl6X2nq#C9=ha*;YyEl6G17?hYA&C({=DWGX~cOom(yB*
zUUQ5z;=G#6Ypp-8IYt_BUd`pU)}PlLBaJw(=JH$X&ufm62F+_vd<TE>l&|*lMYsgm
zySloeZrZdVGiMGOG!%c{4|ezRewNvNfe=67?D~Kmh1v2C!W1aDAfJ{jP>2zg*<1u{
zm1WK~xCqLeYlsn**<6!sm1WK~xCqLeYlsn**<2!Rm1WK~xCqLeYlsn**<7)0m1WK~
zxCqLeYlsn**<3(wm1WK~xCqLeYlsn**<8<Vm1WK~xCqLeYlsn**<4<4m1WK~xCqLe
zYlsn**<9^!m1WK~xCqLeYlsn**}VDCD$AT}a1oR_*AOErvw1J1RhBu|;36n<t|3NL
zX7koet1NS_!9`H!Ttkeg%;ue<R$1m;gNvZdxrP`~navwlt+LFy1{Xn@a}6<~GMo3&
zT4kAY4K9K*=NMwwRF8^&{bK0Kxl3@zj}?7+6?X~l__3l7ui`Gj9Y0p|=2hG!sH^S4
zgNk0fin`h!3GR4VMUq!hhgID1vSfv~s)D<6>R`bgFH4rQ1$DJO%6XKKk+&+DU<>Zb
zxl2$7S8UOfEx0SE4y(B1HU0W>qP#A_BYLduQPG!IahIU3wg(R?`tU0565R1)MQ>ik
zU4lD)tmwt7xJz)yj}=MJdpUI}B+BdLvBDcva97S<LKd=JIa_d7&Rs%AY>{9K?#ih{
z8hFHy$)0S%T{(9N?s!eVKAb48OVFsc2QRDW%d5CcaL11oeRvgj3GVo@qPORwoH`)$
zhzAwDcq{4<CwIK8BFU?`OHfzag9ph9Z&d|%<<wzg?s!?UoGrL3=Pp4V=9jlBnP3a<
z%DGEW2Ul#-lP$O_=Pp5AZ4X}4uQw;k>k>TT$BMpK1}W-*%pE^g^x>_zOHc=Y-m;3`
zyo$R7cl=n<i&t@%;Eo?FlDvvK#LgpmtngM<a97S<LKb?flI3i{T{(9N8L>rzEx0SE
z4k|q2$7D~o;I5pz1b4iqUoTFS*Cl9#8RZQs`tmC765R1)MIT<pU4lD)tmw_FxJz)y
zj}^Um6?X~l_^~3%tGG*WCyy20stWGPxl71GZ&k9KEx0SE4r!1PTO`<myK?Rl(y>KP
zZ>tLGaLDE^!5wegFUg7Wx&)8-v7#@p;x54*KUVbNRoo@0!;JElRrKan+$E^P!JJq1
z;#J%wsH^S4gNh`tqK;;i*YUDsg}17LyK?Rl)ZsAdtxA^jfI2{Om*9mwNG7~h72K6`
zm!OWsXscvTw&1RuI;`T3*YvC4M0s6;NBmgPmsfF@pbiIfZ&^hjUd3I4JASO_&8xUe
zaL11oy?7OO3GVnYnZzmrXAABU+?hvjRYe6`aF^hYACu*5!Cg6ZG_l0q%SM7NxGU!_
zA)U7>*^@1}E9WjD3&}-AzjDr(*Clwwj}?7+6?X~l__3l7uc8hyamULldh;sku!=ig
zR?&-BQHNFB@v>ynTUEhbId=)_aA@~dB`es1yK?H_gF9Z9EN2Vu%DGEWN2d;)FSbZ{
zT{(9N>fnkkda?y~<<wyncf6)wg7bwAYk0(u6@7UXcM0k+zr1A?eRvgj3GVo@qBpPN
zF2Nl?R`lXk+$Ff<$7GWIa#zk>f;)MvU<>Zbxl71GZ&k9KEx0S^E+HefNU#NW<<x<h
zNBo%V$rjv|bC-~g=T}e8m)9lwp~Dg08&ve=Roo@G<Hw3Vyo$R7cl=n<n^$p{;Eo?F
zdhsgm65R1)GU=_V;I5pz1b6aS!4}+=QwLUA=&eeYvjunM+$Chh774bX4s(u23F+9P
zCtGk=&Rv4Lp0Tgms`ih?+9~6b@oi$GKWvj;V*dA5=U9yX-(J=v(-!=nxQvV7Z%?(Z
z>x;2iCyX!KB^EmaMr22SdyNo(ZP}Rob>aVdkFq$ne0VJO4O$`#W*ylkwkw9@&-kM8
zuHvt)*kKqe!JlblOYL0v1ILuh#cni~(e`G&>BsqWXG6CG>_`{?JbT*C&)Z+|o(X5<
zkN&0}Zu3sSvJED=VuLRBS`V9dK6D$goOFxPlP}VpApQ*RVDPwjd%&OO9RWMqo_tXw
zf7Hr+x*d;d=G`6Zjjo?}gyJ0!BeJ8vn}^uEqo7-g<)%scW0kPe_3a8>ijR0H-$r+?
z_%pn-GVuOwu+2M1c*z$v@<;6x*lFGFiuYSsZ*={<4T^UHjL44unlO2(ob3f{9{R10
z`qCuVy8WTsi0z1XAN1sl_-_+`hIckrxavC^`<t%sJlN6p<ck{lqc#e5T6ekP{WjJc
zT|e(^#XAi~WJiDPPqle(!9v&my97I;)?KaYi$h9Uce`)@T?T(H-gDS4z5lL+9r2Pc
zY7`r_Gkv;i74HF9Pj<AOpLc=cO~Hul=x=Dk=3R}28y)psj6<*H-Kgq&p!g!)W5u7T
z?-CqXUA!gmr|Y{McC<bDqDHY%+tsIATiLw-9*p&5=i*(ecrS$!+0oyCp*HVI=(_5=
z`DB|n1zpmi`P@x>(YUYpGrSu!@ZJW0ns<xvk}ql$8?~E#y0aATVOURgr0cKmYQ@_K
zBeJ8v$FUKW)9k<7pu53Q-@Ra`>pK^^jo6NOaR^Q8E*5`=cO8Op)pu%{&ASnH6gT;z
zMzK+w1Us!;a&&WjF_qG~e%_6W_a|^h{^;+L6Kvki5G}=W)8sG~>jpcm+ZnnPAMqy9
zlP?;l#Gm0U!A36Lw~n`YJHd{&CtuXaAGJ4Nr**q3-ac4wbp5>B74KXaksbYw#tx(F
zTMFl!9ra!QU0XK^-9~Iryhn&HiuW|}m*(Bg&D$CNAd@~`b%GsjPrj&8Y}7jWbeAgL
zA7VY((RO~`jxRNzU;PY5WJiD3aGulixfHskSZ<oBZ_=0Nm8!m#FgCi4;?M9_X5f8)
zh|OCiyyS}-`J?tO>~wusE8b(U-st*yyDMIL&LKPcyS&t{?+EB_LgGy$8*1<3;IDPp
ztNI>`^<+nRo>9vF3~zs&1i9w(k?^PMI~aDfJ^7+$bdT`qjvCOs{~{G>T|e(Y#rtzO
zBY*UF5+5hi^&JY`QY<&k)OXuSHg5xTDL$IdRp`kVjR%T9!#gDd@4fJ+d1nbP`JzVt
zsNLh!O(|YTrFH$hqZDrwoRL5JTX(2k-`UW0onIwkr|UZ#x{cVLc!!BE;(bm08QvM+
zbk}!&H=B1h>}Y%PMU7&kHV<}MH-1cWeQ~OkkvFAyABHpXM}KE>p40W63*AyIH_g;H
z?#pvW=u&*dI}$zlqVZ7iXLuK9;C=K&n|GP;k}qoHkJ>}9)4ZJ(?^#%Hbp7?6t9X~d
zi0tU^%R}t?u7IwqzNf)X>vo53Beo~rbHo?%ZV`WmcPU<!y7u44zi0EVfE{g5zNk@b
z)E<SM)?KW4Yp|Z|Xgfb|lj8j~jL44u#&Mq0^<4$sQY<&k)VG5#&&ySPYhg^jNOzR@
zGrXHJ@IHebRqwxBg_nF$BY)JMf}Q4Fsd&d@z0vjaE?2zEVMKQH*O~L2=G_imSAAz3
zZ0oL7^*vYV?j`;V?-smhbJcfUSDSY`>?mL4iyFm7Z7u9H?}&lT`|m`oCp%Yt*DBtZ
zVMKQHH<k08=8boB*SE7T&$ZAc9h%Qm#21Yxh(E*I75-ejzd6C??Fl>Do_tZG*r>e(
zJI&jmc&A}K*|~T(E8bNwB0Ks!va6??=IskzSAB0g$kv?&-9~IrycdWs(oKp#!`mG%
zXkENt9%%FSg&l2AzNk@b)V_e7=H0G%XJS3sxp?C*H=keq9!6wGfA<Wwc`Kn?ish!6
z{kIBsTDN3SbA4yQ*y!FO{tWNvOuWb0ybZ!jzNnEuYG1%k>vn{02P~&NUy9!7`uE??
zigzuH$d3L>dfB`w=youWVuLO=A!+M&g>EC3lkVl{$rt6ht@ty%vvHBoRo_(=Ht#&x
z(e~tv8u_EP5_X!mN%3BZ^+wmvn^e5-!ienX@1f&t-dmtsishym^pUXBx=U4k=fK$L
zHi<vOyDS55d$vozURWu-<ck{lqt@1^yIk@91nZ5ipSSAe=K1_*7?B<Q_24|G_utjf
zb=CKpa+`Oxs_%75x2yOwyzBRK*Y}fzUEfWxqxzCBY7`r_k6@?sTy<>oe7*te$&R-3
z^VTZfk6}c1^w;|oyS`hXTZ-kTnfh+PbqlRK3c932^LajcquX8l8Qu=xar0gWfBN~i
zGwjG8`JzVts9odJtyR1~!+N9Z=bfc^KY<b1(ck><+q_+&Yp$u|e`(z<-EH0!bQ`gr
zcyALsiuW4vXL!5f`l4(99SVP%w<qjqd-6q%Vxv~&)7`3g@4$MpqwV~>^A+#sFd{qp
z>oVNt?F-#fEH};6cNI?Lb$#Q<HP?3`jE!zb@n?8PX5hU5{xol`@RBcT<d51^pKb|s
z&GGr?SZ{Rwyo(j@7ce3_`dii4=52tktG-=fr+GU=w-KgP-+R%MFUs>X;?M9l;PtDk
zzO!*LM)S^q9c@p(sF6Qvjj+?Y3l#7DSZ{Rwyek!NtcdN%wv6+fK3+9Kw-n1wGxc4I
z{Zi{LR`p#BW20Lt{tWNJ47``~ex5!)FBV?%Ma}SD;?rHKcpnx!*L+^Dc-tu6PkP(+
zT?$=SeUF8m=3S}k`>4|0ApQ*R((k(KdoMpvr+HVvj^ZX?)C})Eu+zE&2RF~>$HdOX
zyH)X?183xq{x;UxysM!58kU=8bZ5X$>yChKDU4`7FGEjur27Z)XLxTp(9PR{?b5tW
zu%qqC7d4|>;?qqj-d~HIi??J|^Yd>toRL5JJA1j!yBNCNu-r5=pKpM3%{v>qq(i*V
zpeJ869xnb2@7fH!uRLY%zZ-;?d{HBR)Lw+0)}5<(pTl~i>)(I7f)_6Zy!b}Li0tUE
zdy~z(3A&T8+%&^`px7CXk$C;!Iu4zVgJv6bowXKrl!uk#kTj_chn?nFpg8c-CL>2*
zaCE|Y%5x2zkw5yIbED1C0NpuQZko}3{03Whv8vlEFeW>S_Y(1Ec(=lzi+9sJn>W^#
zw<llJjP6F*Y2KxZceU7&uD@<W6>kHakw5yoaiq<=Ygb%T#d6cghT8XFr*&6Cw-n1M
zf3Kq_JJOva{tWLX_;c|-bGpsD6?U{e`J!fYpMss%-Kcoq5IYy|1jRcM&d4AA9k9se
z-QLx`Uk<;|*4?V=`=-*}Tl^W`t_Qn$e}X4aJ)e8Rj^ZX?)F?J;KZc#=-L81oVLjQ=
zcK-S{u4>*dC&7s9=<nK_ZQj1nb?ui|h@IhBl!0T}Pi>B+!tqCFQ6o)iOJS!uN`^E)
zfBXsS$<D<w9~_;qj^@>57?B<QZNLj+<S%`GupGK`FgA^BsO<qet=k#8q(lBTpeH*T
zza{<*@4)Z5>sI+An|CPeX!{NLqh@sb!%pjVRlFaF9c|~Y+u~Ktyffg8{L$Zj<89uN
z(0vQbO*6U=jk9%=&@F`#@qUD!>`1qR_%pmc4{`Gz3x9f^_J<v9Prj%b-2pz`5sLR?
zv2*dRRJ=3cjQr8xukZw=>pKv--Lc#>^ZfCbr)}O^Ro~4pCSRm`zxXq}Q!?-#0Dqcy
zmhh4<YUGdFcYL}HiudnWZ*=|jT@POKe0dR!$d3MA`i0Fq8@iWZxoL)Xx!4(wcsF<5
zK5Mc$I>3(d@PFcvG^za+c6y%9QXE^cp6qBlKgX6;&GYm}Fd{qp+kzLmx^A7Ii$&>1
zHq^Rcq1K(N>h@2pCp*&pNc<Vz#qj5P{up|b&ASYCv_1KvW^}7yr*-Em-Y><Dw)6Au
z`bsk|eO8D3(O*f8&AS4+uJhQ1qix+L=$2x8+Asfuo_vvRTk&Uj=N;<i?K|4$T>v}U
zo_tXwf7FtrZQYfMmkMQc{k)}$_evO%9sSK*X7e^d7s%;m=IMh^*t%;~ecLJB$>PuO
zuFk;w;o~+hy<bSY<ck``M(sV=eS`iZfvi`&?Uk;dx9=;>`{h-N_l3J{-VM-oJzqX4
zc7|hUnY(U(TWE8Pf*o;u!^iOn>@>$_#j#r!jw*1N=gS`}j%C-{9JSD$16|Wh{yv&(
z>uy(d+e7I-B>oKV<_x@@;18RnUvF&_Uh+lF=yvq!#*c44KiE_0`s-G!c<Hlo<d6RT
zd#24BI}GnJlb|%Cdn4?0o;yOf6gIS9c2v4s#h>9_2Y;^PP#N2$c{jq2>Px<;8Qt&s
zbd!pAU#08kouznhfHU$(f4^O9^KOQ2cM_Cl_RIf0VDk=yF2zT@`zhV$#Gm2q1ZO42
z8G6If2mY{Gnzt+L$RGKlX6!0_x>bsIf2Hf^oe$oQ@I&$42xsJv{+_$l=Ist$*Yo8Q
zVrMuOXW-a;i_Ni2I7)pSn_#Es%P7ThU>1%=s%|$ajwP4b94nyfdcJ(O(bjEHbvsz;
z-YfnL?+9GSEkV9aquf#J&}j3Hh8@+7d{HxYC5^UjO7V76y8gPYP`nEi@2WFw-U-lM
z<0<lk(H#Xlo#)xmErkiqgTs{WGvd$i_U+;3-8$0d9SA$(C12Ex?iSc--6qA`L+Sc?
z*D2mR6z}w3+PqcJ?Z%ScquDR-zu(qfs_L6iy61^M!<)*$``#j(w^4Y>7d6BCC)jD;
z<%&0{bp5<rz-#u)I~DICydR}sm(79hB$o6Z4e$P9XE?TH;28EZn<IWW*R79_<0RN=
zj@62zUlxw|Z<?Pk?@}CtFSYAd0^K=^!{qM*9CWnqdR4dnO7}?dXL#qspKHHdbg|95
zP<Y7~HKW@EJFUA>@!})Np53mn_t&kn;$5V8->SBG7eV)3Pmv#t?zynjx?7=J3KQBd
z@lmX_?rQO8c<1zV^R{KX^z+Aj*iqc%i<;5>?>V+^#}k^*5AYUcTG!8;RJ`{q-h=pj
zGCfZhK(`x9dXHwFp8lAv+ZDPLAMxT+Oj`Hb;?MA|%)op7QoFuugqM6#GrT{6oz8Q2
z#f$%@b^W|m;5GZ@FBR{h3+?)@gRX18JV5LW$KZs!ZX@opIYz*a@^X@oV<_x2M}NgJ
zGz-UQRksHe$IzeH9HXE+2fC)2{9SU5ty`t)HeBf*EB*}c#tghmuC{r%2rv1fW^@<B
zPV<gXyr(H$f8Ay%-ld9nA?7_vq(8R~UDtk@^z9$D&@IJwG*8b^x;KkI!@I8BUEkGb
z+q@fLNA)FN)C}(`*lFI`ig%RK_4CeCypJi~SAS*mZia3*mh>LYe%S_gT6eyxZ?)2W
zLHrrsjumd+evjI`rLZGj@<q+?_JW<(U7&c!C|y7ABJi61@^Qs`{hc;%H|V<d%PYms
zaNLrC<EcArjwa!#^Km>5JI%3Jag5Kxv0T;d3B|DqJ0VG!dAb<7Sd?xifBRse)?KdZ
zcCONWSNs`Xd~@9Sd^z~XHg6^Dc7-bWqGogl!cOb1RJ;?FuD@<;74HhgdoJ%EY2Lxm
zeU~LI-T#iVb=N|-6c)5!PEop}#h>Br*2~R%GyGw*^z$WdJ>c<@FKUMOMxX9h#XC*u
z`gu1i-scqWg^$?v?GN2<Ea^R({qlh&HgCMD`T6n!r8`ml8Q$6qydOMl^G*?7@<q+?
z{uy?<z9rD@fc2E;nM&8s8~<(de)+uO{d|GVI|I6|{qj?>GaQ>TaFnuLx^7#AW0sGj
zGwd`+XT@<z7LHEf=p?)^D2~RfY>w^F#jcfZCVvlIY3p`Zb-PUIULgJq@9f_0dAeb?
zUAK9#qy3V6Q8T*hVW)YMig&is_1CSZ;-&BEkw5xNj<R`gfv#)6Ty>VMI}p01*q-Lg
zkCkqj_%pmS`nY*V!yh(F*OxvwL%igR8pTF!lux%-@m`~J{k($}@2iUUyS#s-k3(~z
z>)J0*eaPlbsrp{4boUj1hIeTO-fJJUc~=N8`J!fcuZEqj?<~bTPwD!3N2~qvHN|_@
z?RI@vLD#iko+5UJ19xI_K7U+wo6Rv0c2u{Ud>og<PIJsv96!y%ky3SgU2$}pZF5vX
zcaE1ielYnv_6l2ffvVdrN_P+OXL#3U;GJ=~&AUN($rm-Fn}VI@ZBo3qD_wux<|^KG
za7O;<Z`A2F?<VNd^?1{a?v~SR-KEeig%RzScPias;?MAI>F2KR9Qea#>HTs$?5Muv
zi<;4$?bBVWc<)xae%>a<`vIJhKl=L~>!$b1_z`a2r%ttbH!9vHrQ2Ej8Qzi~xOs=c
zpXTiZJK`l@)C})QKHd0<&Ci$jDP2GBa>e^M#XDe(UEfmZZevMH_pKV6w<B~*VL|o%
zrPA#y{tR!Y{%+n$@Q2OP_3a8f;w4|y4DY$H)AKp0cpro<+0k}>-nHO0=k0%2yt_PQ
z^LB?WF5RYETlrr**lFE?&?Oz>U7~b<@TAQ#QaH$ln&IdJJMFJZ`Fm9P^K)zhhdCeG
zqBw56$L1If-RD`-do&z#*seLxKjeHp=8JDO>~wr1RD6$TiEo>lSD&f)O6S?}b%*Xs
z6`#q=N!Q!Dqm=HGN_QXeXXe!w_;X!{YrM{`$9CZ*U(}55EZAw@TIiZQFIT$$dUROb
ze7^Rj;(e&r=8YeTw=zXj>kfdO)=fdT6b3Y}o>jU{;?MBzdX$^@4`XfKj<BP7O1`Ke
zM6bOCJFPok@jkC~{k+{2Z&4BZBcC%^H+`J!3|$v*iBGpl@xG{ZCy779TUzPnZ5m_q
zc84ADk}qn8cOmRF?@GnHO6mG}D;4i9igy6^FOo2?larOrpOq)ww)BAZK8~MScP(_y
zapSj2x3Bm!ylX1myjQ^=HcRin>tRR!$QL!kd$~_{z2bdM>H2v`D&F>rcOc%(BniX2
zu@aw+CqZe3_oaQ>SiGAR@9&iE5#rDAjy&4UTLpjEEX`XBJK`l@)C})npYB%0yB4-&
zN89;%r-0WyFN}c^+0oy7N7=j$&^;E*O*6c2i=E+E3cC_xgr0m+JA>`g94lZ)@w|=L
zs2RIcVW;Oy92a8Eap)b`lAViVw&JLT5!un-r<FFxD(Lpaa?=dQdtzrew!zNH!FFkm
z_yCS)y`KYinxmuQcsC2jEsA5T;+T4h%~1kf9iQQt1Us$U6}pr!I-b6#bUz+y&#O+t
zK{nJVcho+Fo%YvV`TIcm^UtfrisLNBaZOj7qZGP>S;~7f9F1aU>M;R!n%Bhl4Yo_y
zBPARk`8bMTr#X_U9-FdotWX@I6vr!j+8nc>JHf&6tk@ZjjTtz4vR#^Ei*S7E<LC}M
z%`s4M{51>5T5xnid^8WvRvfi$Y>sWv9U+>8WAgk)%+?(N-AeJdMd_X?{tR!`KzH2+
z!XGwE^Nxfa%~SG4&FEJ8bmuGHe<)r5{M)Q}_fg03U*H8XNtomKXy^{}6#1d8{C{8A
z={z?<*W~XDrF*;hGrUVP@LqeP&AUQ)$rm-ldo}E|?sCQZFQx0}jlbGl-_DBn)QfE1
zRnT=E|K6Ty>#l~bIc{uMx+jP~!@Dg5@7eH&&C>Oa590cgFU@;~Pj{{2{h!kH^L7TW
zdEVMz@$UCK`@EzCx;V8>H&fpZVrMuOz|M7iId6@9zOhI+%yy=3<6)=kwo!4!Axd_X
zPd`UbRktpR<Kr22-IhSNdzzy8{OUZ|Y2B@=Zo4SmKZ`#T_xcRHpIvCzZIkelFKUMO
zudvg)+ZAuI()IHWR=fu&-ZGpB(9|&d<re5xd5ZiX^06!4vUN*NZazQQUFnvJKf~J}
zCoiu0Zg|t?9Sl3F6ZxWMc-O;D^LAFc^!?*Z^&PF|X{q8p^w&1;Q0NY1N$=6{9w2sx
zV}1sX=}*}l3x(rbK92KYr#ZSSj=i&Rq!h<@700)6kww>S5p;1XpKgZZn__1;HfG?M
zc(2W|ML0V7IO<`iIr=M({jzY(QS)zK#qqmu+sBP<&>fJbXx`t>hMm@}g04AE?yq!T
z7Jr7f|8eg5_g6frAb;uO<Y3s5Kk`M*%)gIer*%gt-cqIO-`^H0-cE}5a@I}nZ$qK$
znt!|dbZZswK}vUq_%pooGw?3h*XCU)yyQ#s-U2(#+n{*Ar*!?i%hWvmw&MNHr*?f8
zL3cJwdXFL>+f(ceNB6<*x-I;~=I9GMs@tJHjs>vO9J3V1VOcm<tGex{I5y0%IVz#M
z2kn5;495W2Y2CTdMTxxgzaC2WE%9e~hYoS`F1pa>9R)k$C12FcJZ*xV)@@R}38m|=
z+eXFv9mV_52Aj7Qx*I)3elWZV*lFFRN;j!=o5Y{t9eli-ciEq9-Vv}PUh+lF@Gga&
z)?KM|`zT#M?{+m$r@$HcqrW@K?BnSu=;Bb6Zie?Ju`?V^894T4yY%s8iEtd@<Jc2+
znq#fv=%0n7!)wjwVN(^yeTUf`%b@Ez@4Q3o49BKS9Bh~7*eV=H`8i;xIW{VeqqA^y
zRUGFlj{T0cIkx-a6ZzOau+zF*p-c0HUT+Olx;NlMe)@R7>j^xs$c7rt0czL6PW#)g
z{2i<O`R7$%#Zj*~uKteA(E++RbflZ%xK!*+Jx0RLb>6fq+okJKD;z_79C6rbjySF-
zbbu=5<%BF8Rf^+W#c_Uno1+1`<I)t(&(q_@&Ty>Fz_G5#uEz%9ILXJc7IvDWqv9Bv
zg<~{0%yIWT#S!0PAJ;ZP7jK!Ro0$hw|85^&x<a=SR+PWtO7~0H(dLFXd7`^+8~<h>
z*D7I0^OSs1GrAjKr+I4??`cZcKmTSZ-h<R}{IkpKx($Xd-U>`Nk&lgqoz_i3*W~XE
zrTZ80XLuK8;C-jjuJ2;uC12DG@0+mGx^opT-4mSbC{KRgd5ZT?#k>1iHt$mC_9a1S
zhWGk2ZQTXXHOGx=rQ1&Y8Q#qqc=v`seSFy_yyT0T;oZ}x+oX8MC|y7ABJi5m-DQe*
z#q;)jj-3>XUB!~#qsYe|7dyi-2X?OG%bskPKEBL{9p$A?92t(?VW;c1RB?=lZKk>{
z2ZxzghbfM`&#>#Z0J=RK90$Qp>#kIFJ6GxcO#B(%)$r%yy?>-#w{@^1Uh+lF@csgJ
zT6eYLov3vEbzA#dGjDgr`$N3hMaK>Ex_bk3t2{-15c$~6&)K@`mF^U!TOs}oZ}*ek
zy#H8X^Y(=u@sclUhWGEV)4ZFN?lh(A=iLlmGf%&-cxx8hyp_;(onM_Uc7|h4295_G
zusP-n#|1u)`(dX!wkwVqSvcs%5r(6O;%IZL&9MNwm0srfLF8lqyoK!y$NCH$r?Opo
zf7>J+Kk{*$0z1u7a!T{_`Ndf{I)cOOZ(S7!ormiAw*|Tb92_sfNb7cnt~pLND&3yq
z&+sOPy64|%@P~hC-b&b!Kk`M*%)eni-L8uF3Z?6xf87=D!HV}&_=d~${x%r814vMs
z$b0vN)VxW>dzI3C58IJH!#g(vFG8?*ZxLSdMa}S%FRj~O@m{TT{k#LgYv$?q6mQW7
zHt#~{&hZra!SMe3eVe1(Dek&m!*=PqC1FQ(n=6hC$5pV?994?rI@ppOZRh70sp@u!
z;#fMt=I9UIPLwQZA|Klac3O87bj`fKLFxWd{F%Cqz?%@R=Y?70?YfPI9mP$)s2ScF
zu+zFJ#XDc=`gx})-foKbKfkwmCqVaomh>J)KGq03tvg%k{!HoqL;M-us^M<lUDz&N
z-;uB*Uh+lF@V0}U)}60(Z&SK{-Z^TX&Vn=YM}MCmZ68lZLl-ag(#`OGDt3lrG3;D*
zo5*%)j%C7ehmWHkcABF}aom-KV}athL~;CYfX%T2y2&&}^XsF}#m;bS&BVcWX^z+k
zuE#xo4%lgqrHZ2|3&#@0ak1jK2nSx;z07$D{ce)Zv&hFTfSuM|30;~m^!n&NrTZC{
z!(W=Cqi~Q7HJSs|{t7$oZ?*Dwzw+mwS1T3Abj302V4I^ebn!3U498TlGxeC_<2CX9
z+xLF=Ea6z}<M^lV{qD8k=m1s9%R^Z>)+vq)6vwA~*&MT>dv2Pdd0xFIc7|h1299BD
zm#zo>t`61h5g*4%u+#O}s5pL=g<~@~%yIWZ#ZiJAZRmLw$LB{!s^hrH^F?iK-L25A
zl>9xeblZwQ!#fHuYV|xd{x-L<=ida_5ij|oX6!b>PV***HP`J)rR$%6@ioo7hpXfG
z(Lc3$r$E>By8Bo2ZQX&;HThevbo+=u!@DX2@1gLg_qVmeOTIMk!9LwliuYNi>*wvP
zczY?{?_X^5u7_?<mh>J)KKAe|o3{bF=D6{^(mhE08Qzl9-SzDSf10-w?8qPaqGsxw
z@ad)$?~6*;&zl5qNBE)rx3}V*@P_?7T?*anJVkymyyu9W;aHM^<4JyBJiT8o7migv
zj>ll9=jm+4@tZ6hgH_%7D30fTWY=vabh|q^j)9%lov-Tls?vQz{2AUY8F*j0$gbOV
z;U!<xOx<3Doz`8Tc-JUhf89na-oA==&v$Iz_(=Eb?sM1Kx{H<W@0IQ@;?M97g+JGE
z=w*IiJYC;Wu%mfOzNi`A7htD(mn+@3l&+t5hMK4S6z^rrZQfewx?Xo*D0YTpaR!c8
ze{I)onQ*-0<9G#jnq#%%_+u81xr*Zm#Zj}!=2!t;*ZbY4i=E-vo`K^reqTIYk6q8;
zdc5o7cm#HuW4+?okcDHRntweN$CS?Yaiart2k;c|9z{O3{X6!4z8SjaIQfCn9Vh+_
z?+EyF&A++ur;n4Pg_nF$GxKkbPj{>0{YdHh=if5Ln^3&pW!?1o<OJvrWJ&MQ@GjoZ
z=8X?;=KWad?koNb@8S%+KY%~YyG(e=7d6A%$ERBY-40k!$NSAn*U!5~&C_zl+h(&}
z-xbiE?J4qu;r%BrNFcuS^@D+Dy6bio+ok8}P}tEt_`8qea@gs4+F5aYmW5-Zs#}HP
zSbUMqF%r72_q+Fio!0FR-A;&)^0!s#-Xs1@-6ovn=1tAC>z0BY@sclUrfySUr*#J^
z-hV1xf8Dk#-lXE)_kEjp7IZhVr1vQDvD@CWbw?=OFO}}@;?MAo9_8l!F8t|v+5kJ^
zC12DG@BTjBTBZ9RrR(SIi1P(={xS#7$RGV3+Rr|orl9M3UN}JP49D^e9C!D%pBGjM
zhxzef!*K`fblp;lqis8mjrjc>-4w?)ilgEPn_~@hdt!UjB#p5{#m;cV&UV-1Zstwz
zZzZtv;z4ZG(j2hU9J3Y2E?GGGD~_ub$1r?v0P`Syob2d}&v2XsJFPn(x)dMnZ^cUY
z6}+jb=T)h2kPS7%@gnTBzXi%)iSp;K$56#_nc_I)K%1i*bO*Df_h>lw7dumrDL!5k
z-@V_pIc5pRH+>xUz)o{Cse0_0g`-w+T&_5(aj?_%m<`<t4vtgB&Twqb!12=VHpe#M
z=;-5k9(I~zsp8lt3&#v_nB(phietgQ?c*B#aGC3K=Ebnnx+|eu30|64-&VReia*0U
zqT0P5&HB<lu8oEr%~SG4&D3`W?6hti!F9lT((SBt{qt|0;{Aa-j`zCOuG<9Y;u31Q
znfZ6$TszMlp=<JYfYLoo{2AWm8F=@HKfS-L5?=B}&G3HPr`uie9;kHvyo(g?(Tex;
zNjC2q=(>)77s5{Gxj%HxapPd6`>FUdys^>l`u=C4&07LH@<+a?8Qy=vPU{X-yxo+p
zpLd1YF9#^z_kU~8=Z>S@ue;ZYo#AMLo$I`~g6-1B`z5d=j>CK$hr>>Dj8Gik&%&`*
z)$JI?aW&^JeY{@=-R{se&CJu?eEF+Yb?d2gFBN}=cjIU`?+p!h-L}Avc*z$vQ@3kj
zr+FI`Z-vtJ*KM=n9jJJ(d)=O=+eW)zcmL%zTX&Yy?X7fYi$B9Vu*S_h5dQRjITUup
zOTMTX-b$bDT&3Gj>H2x&xV~e~uLddJS01x@M?!ZXOL~u{zR!xC;aHG?V{f)g&(lT1
z(cj0hC+u|H7ATG*vv71$9LFk-f8A|!EP-x+2gl#V&Twqbz;Pnmr8%|<$I(8HA+XaN
zixtN)Svb0b!yL!^D~_8`q&A4#ysr@(<9^+J0PM8xa_G{0q35GxmG0Hz&+ra}KiBc)
z;cwZ`gF|6Q{>T?KGyfidoz`8cc!wxm|NI-Mcz>vP2eNLOcO-OO^Y8V&Y~8hrw@T?A
zA^r^Sf(*Rpz#sCQuJ0n@C10BNOrP$0#e1^S_4AGbui4*@RJ<pDY}a=QbZ4`q_t;kc
zKS=BhM{=yYZfiH$9F?%6x()Mjtbv`b+h)ZvA`8b9aF}^|l;RjX-R2k!-92dHN;4e4
zOxe2Ip=<n|u5^zSe};Ett(&(4{OP*Y!j5>!7qvKdu@awd$5Wfn*UnVB{<_Ukyp@V~
z{hw^!2Iy`SE$R$!HSBbryDHtYmF^qj&+rbdbMt<*-sT+zJK`l@)C}+Yu+zFpr8`>b
z`gs?sc{(4?$RGW^*uy@a)<W0ye)q4%&TuTr!0|)2OYd*Xg=4IbqaW-v$3VqVmxW`g
z;<#CHyneXNu@bsTN}M!Pw-?3EaBR!O!FFkm_&Bb|1V0DtG{*?Vac&llRf^-Milc0>
z%~1kfeH=F&--Dgjt%WYl7kXZpsC4f>&hwY%=p-CuLyhJDwL4&^{WU0mla)XJyjrg~
zu2mcpaT9d?{8kFx5iI3B8ji7IXX=si@tXKHceXhig=4CZV-xH&M@rQrm4#!A;<!$6
zJhrRNF$cP?_q!huJHxRx14n1JOV=Ydp6AttK8{YX(;TxE$IL7o@!vNe$FEl$BmQ9@
z*LH=j>;3NM|Ia?Y%!h6zDn|2ameM_5{2AWS6YP0v>Xw8*eH?Fq9nDknMa|gt^y#iu
zyq79n|NQH$c#kV;KCT^lrCqlabkAf-@6pV^+h^N(-Uwauymh(KJwW^!-ZdF`_k=&q
zyIy$77d6AXyH9t!;=NMo`gxOz_e90}^k|!RBXnKo#Ye$T&#MxA0CHEvMfIJdbblrO
z3~y<@yS^`0+q~UjNB+ncHN*QH?6hu2=$h*)KT*1V-YW2Rgdd9UB*i=GMSDIcp?j65
z$PcEz!^F;TEYHC4;7WU*t`d&xd>r?~PIGis9P_epj8=6!S#g}g`AeS{uYqn42gmQv
zvGbQyb-PLF9w+_`FCDD(^M|R&8Stm)X$kD8Zsd!au{+hL+h6hCtaSZ#o1u7zD&F1j
z0bc#Q&=I=$sCl}Xy4AjD^HwR{Ta|7b@n?8zGw?pQ(&n8ayyT0T;e8r*y1t{7?gFLj
z=bfkK=_!hL&xdW^8PFZblHQ}?-9_vS$MOsuXFp_ftP+m9d>m)MPIELUj=QsPG%1c@
zisOdcZH_h2t#okwSnLc(hx6R?@59?{j?S>7`Pby*cn@}(W0vB$Hw(uyHU9=Hju|+P
z==s+bx&s^>aoB0yxzIJo$@`V=B=Ki>CuHEA-`+mHq=c7zQ8V*z9_+O4e8sz1>H6p2
z8pS(A@gB;$>Ep|+47^LRjn-{aybmkg1H_-<U6Fy8t}W{0%WB~zUz(R*YiixaiuX~a
z>*w91=IQZ@_jeoZ`mTlU9G3JR&HnbX*cpyd4eoh*8r!AM*CxP@=D}k=j$yFV9Lp8Q
z6InR6tGb<_II5td=jjxTJJAAZhT|ddY2DS(HRmr+Dcu3$&+yKf=;rMRf4Xk-VMn~=
zi&~t!812_uccbEcTIu@h)^Tm~`DvBnef=$)cL8+Y7cJ@x?=aYD-K|P@h0=Xd{2AWH
zNp9YE-n4n=!j5>!7d6BCChW9s{PgDYmlu?-pSL@B&H2khI3s`b_egj9csd`t$C98l
z!+W3D8IJWCI1XjI^gP`p954Ae4u+lP=%_eWW#On)9QP=WUw_}`*aBVG`#q0{o#7~*
z?5@Y5Y?tQf4m+yHZ~Yvw(;QtD$E#U5MktQE6~}@6IyrruO#0$8_2}Yzot%U&#Yg9-
zYn1M-$J)<tmBK+b)MyS+`zh=+M}Ot-4du^2uO=vtTNTHT_;qrcV=#0Fvy}H}IL;S4
zQ;&H*UK8J!-?2Fs2*;Z~jxS)RIR>hFyq$$(mg2Zgaon_vJ+GReJHf$mwb&Vsk}2+a
z^<{gTqZ90?Zh!D|z)o|FP#o*CaLfaTIqu%BI2M0qAJ<Bui%X;FX7aor?6htzbSq&+
z^Xkt^_a5<QcvI)QdFO7ik86#vBVO`F&FId7oz`tqyzeVr|NL8|c!#Uw__bHqb(;fS
zeDpfq%>4V`<#wKzLf7Q)L#2C#_%pm4GVo4^KmEM5S$N48HN$(pPj|KA-K2E=yeky%
z8H)GAvu)n3&~?4;9uGU6=k?H~dQg2oRl0u^e}=c`RCj&<I?Cql4?FTlzNi`Ak71{E
zH!9x0DP2GBI<;S(sd)ETY0u|@(7lQ!y+>2uxY!wv)fqUdU$E!tI^p=t$8i?yG{;uO
z@sBJVn^oP;QXDfmf9d1o2I%&1aQyo$JAZLpG&6PkLg`Kxe}=ciG<V%DgFih_JHw9r
zkuPedZWsG>OQ72U>uJ9HOX>RS7RPyt*^fpk-md)mH_h7>x+i&x{9x*K@e4L@XQjJc
z>Fy`~3~wp}?;oDGc^ie7d{HyJZ^2I2x4Y8)pVIa7b_Q=p_@TU<t$3e&(B3cSKzD$r
z$Pb41VX-qDt21yEv0eJSWSwxd6#&E026mdGzv76)i0r7|evY1s;~d2?gkLA8>$U;9
zm5ks$8jhpH&Ty2b-1F~_TkU#uhaJVUi;v@0*lCU`#qo_S90S$-8=*Mf!8Y`?XWs8l
zLf2J~I@oF5QP4H}TZz(rUHlo|85wv#$K28T+ic+_U(}?F(eXy>)+*j_DqVlwMk(G?
z74J2yo93OHfp>48Zc6d)rF0v`pW$7TftS8xsd?86FZt5E3t^{uXDQyjm9C#RrRM2r
ziucnG?D}qm?i`l%9?d*`PwWgw!*usNox*nM{cQ&9XdZO(aWueAbIes7`(@#nqw03L
z;%LNmEj>>gq1%ZTNHZMo*W0=aplgo1`zzfG#Gm24<pMYFVEEH@Yl0o|k}qn~#RmFx
zmnz;;rR%TTLd82$@s7iC&AS-7@3W-$Xm~$fYxAyDx(6v;+8@ZD;hlG(n|BKQY2F2}
zBVO`F&G0t(bk{1~?<rkB?=r;E5q{`-VX@ee&%OKD&kJ;)I@jy&-NeptY|g-OZEyQ{
zx=lC^6#(gCSHn)v(~XMbFo}=&{T!<m$3tRAJ`d<?bHrx2Uw7{<c7~%T>`Jh`X(qmF
znK!+^^@knB(?bl5-PN$u99tDfPZ*J%i(`Z0cu?%f_V_BBW1ufSGyjf-oz{(?(fqtn
zp>&@+!LG+p;UF7o(#4*Jo%UCv{Pj}){PozXIDR2^<g?dzZH|%99qcLcgW)(#>`Xlt
z`gl!zOG|Bz#lq2742<0p*lCWA;4tTjN5F{eT=m%Xt>*pXUa=$FAMS2*EQRhk2S<h2
z8II2Q{)=l~HI>*L-C#%Y{E)=Zq>C+to#yDOIF6F|TpXRj(FuNNKfh1x$miC7*~hh>
z(8Ux=H={cSc3L+H-AY)IzX3}36Y*zwXW{!pF5b1<?Bm)T*iqc%i<;4013RsoQoMtd
zu7Ca|6>qgVj^FwdyKeKKdm2l6k7oYu20N`g8@eWcgO%>};?MAI%D{WsHFkZs3NQJh
zW_T}#oz`8Tcu!Eee%>m@Tc>#UZ?Ji{L$@zWdXI+puJdf&#n7dCP<>BQy5ACihBx^m
zcYP0rKmEK_2|MyfzNi`A@A`C?D&A9+uAjFSyykgpoZ_AT8+$$vhOX;%_cdZ?IM!s~
z`0y2bo~{>;5k8LhV5jT0QgNJ?g=2=Q+jzzC$hmgiHbU3+y1N2)T6e9g+ZjstKJjOG
zJI->~?a6w(Zl$oJx{)tx(#0Nwoz`8ic+KxV(02a1%~QM+6z_en+PvMMTjeS8gPEr>
z*lFF(O1E0^-XZ=BZz==t*{f~dM&Tu2)C}(#u+zHRmF^g&>*rmh=4rj+J%6dqI|sV1
z^Q-Y<XE@em;CT91HphD5px23-<4M?Qj*>H*p9jZh;aILX&Q%<bEVMZ`LbsA7y+>2G
z`^3(0biLR;|BBcyeSXywb~KOZo~G2Ki?xBB=IE?A8nSS#QS)!K;@G;Uecb2^-2p7=
zJsOTi*lFGF(53k3I5}DAej@%1@2m{G9oR0-J4blQ7d69M;?qqkUUMH|*Z#Ii@zyBb
zU*P12p61PUhItuyd%{lh4ph9;74Plh&+x9z!29es?c?bN;U!<x4DYXDr**3o?+m5u
z-``?yH$N|oQM~n=Y~D@Kox_seqp5GT*cpx~m$>KY-~M8A%z_=||3^NKPhh7xMkx++
z|0deb&(RSa=6qwU;+Tc&TDoqtq1#EFuNjVaah+D{HbB?-YgGB0D*g=bf=k`Jbp2XC
zpD%(P#ZA7bNf)d1>CRTX=KGB<-tLOGR`E_-Z}TpJ?)xn1JsRFG{%G^gSGrdz-g@z8
zc;`2|c`t@P&ASkG6gT;zW_V}%beoi}`JS+gcc7Z5%OpPX*`}9$JYCf2eqQ)zlI;w~
z7TCGYvuCnh`uMUPb`;NCAIEgq>G`r$aa<?yxj05Dj;9pIZv1*beSC>u=6>DXM(hkn
z5_V1w&P$r35_S~N4So*TX^xeO<EAVe4T|GQ#WCOnyB>pm@tOH|B<!^ATIf=I^t@m`
ze^28lkN5ngIYtNv*-(=%_89E6zxB%BEm=4k6~`lr<Cs#LV-$1;v!wTEIQog5sYjEK
z*Tnby0XD}H;h^_)sTsRxV5d1Ys(RcZ@ljs<$G`cC<596ApWi95IhH}!^}2gcu`?W{
zm%HcH<-6G&-C;-ZEEE9gVwb>9b8J-{_egv$jz!=w$K79v9r>)<W*^s*(5-5N71E6E
zQ~$J&YjM2aRS6rKSLV73=?)NohPUwwH*a_NgG_q<&4nFpPrj%b-EKbJfzZWMyr;Ve
zMr7yWU7>i-Q^)cDTy58FK6FnbL1}HJpA0*l=Mm5~`FlX={zLp3-pv_!Kb&LNcbo8%
zFKW`o-h-XiZBV=qDP8|OU8i`@SG<Gp`iRPD&adc8ZGAmOelWZ*Pq1}oL6`DM^)>r1
zjej8i3~yifa~&s7gg;&1fv}_P$rm;0VnckovlZ`B7?GW;zFWX+UUyGbyvM#`&*!Sy
z?$_P@#m;c7g`JDzXRGXax&d|+&l40Fnsl+7V5jRgUvZe@xQipcu6e(lra0aiZ`W-T
zbX~8z&w`!SZBlhxj^HRh(tTb08QxA;x_RFlXV<MO>}Y%PMNPWcpJ1nT7c1Upm9BrD
zc2>M8#k=CSHg9+6R<We_Xy)m+VW)MME8XXn?&IRm@XpA<d%<sP-r2%SzNi`Asj$<!
ztCjAHO4rYu1h1K=(-rTx`E_!7znlwQ*X!<Yik;zDn}MV5QJZ6faIEri)WA-2tXCYr
z$-*&Maa^D{>hH4awh6kGUgr40)U8_V3`aLy40G*oPv2>CBw<JM?^Peild#hqn-vGW
z*G%TF{cV(*e+`P`RDL~}u1A094sdY1w}-u-Z-*}F&~fq&rF(+-GrWx%c+ZDFeVm*t
zyyT0Tbg_v(-8eqKVx9-zRJ#88mr}eF6>odiP4mvrz<a~)Hg8Ah8s2qEcRTFpdB*Ur
z%fMU8cIoH+jlxU5s2SeQKHbiW_m4`~&pTJm(@Bc=ioe*;3!9-khb6s7Gf!uVo#9CR
z*ga2oWxF&-BkU+I@A^36u+#IjyW-f8g=3+r+hoPD<b0cB4s>0wyZ3^f*6k17PKb}@
z=?6;pUh!vm7a}RH{c^?>d!8<a9r2PcYSP70u+zFD6z@k$*I&0~ig$|QE#}w1>3O;o
zy6>~3_h{;N?H_F2TBZB3(v68f!+XosZr+aYr}xVy*by)JqGotI_;gcBceB#<^R7|z
zbfwsl&%c)2$J52oJ=Rm?2gCb;*cpzk893_LE<I0U*D%N51wgu34eY)_5+X2LaeOB6
z5x<{fqvCi;?8xUoD{PKkq1%)EOEVmQ6+6Sx7j~}sSI2f~j)B6lRRE-m)xb`3%vT&=
zNPI4iZHmJ@pOeoc_;qr6{#E(nGaS8rualdgOFFc_{Y&XSGQ@s<8z~%QLruEagRs*a
zi<Q5BD}Vlal)Te?zVWo!k<U~3b#j_xG;{}hiu_<WjuSgmk3~LS6W^LHHpf!o_^%ik
zyVbDM97|O_VzQsR>QSmVo`Ey+M}Pk+w&&Gy=#F!6{9Wt}N7tXY=hbMoOV6vGu%md|
zAvS7;V-)N($4bRfl!YS+j!y7H^T3=Jlh39v?BjS}=(=8a?*%)pyB4~Y;%`@_dz<((
zytC)Jd1rraAJ^u=j(EuzHN)EoJFVLhpK~_n8@nl8|NN^`ycdcc`K-a~S~@>4uS0Kv
zuIqL8?|*FP`Tx2561Xa=zx}xj$flyAqM}|F4L7`Of?MoYR8&-4qgVt5ML<Nw9Swh3
zYHC_)X<2G%nqg^aX}FbIR$!J|`jgCZ!4gsnbK(DdXXea3GhImQ?fri~@A+`<%sKPS
z_xV0&n=>mu;AQ34fa4t@+hckwYth>m_V{u9uB?}AQDAywG`zhyy^T0tt==?F?`%%*
zMCm+A(Q8~{`@H*lx>|1>c&R?9y|{6_V`O_wZ!g$$5fw;3Ove=1<MqY@NA}1T1%{iX
z;Z5N5vj4A3`)T#g;`-$rPH*)Qb$gBnFQ!;ZVB^a#GLGpuU5k#s5>Dxt7iAsvKUFC(
z9WlW1?KF+k;lY)kR>v}~-sW;TbW-^#^>z)seiEhl%XB=MrmnYquHM>myuSlS?VjoN
zc-D5kIZ8N1uP<;^{$z^+(`%>UoyF<(;&`=sH*<OmIlX6&sr#iFym1nx_{;PL0LPc}
zVvd*npCt14OW7XNJF6DGOOLAC=|WjA*`mPoE&`6{UCZ(M)}ePl*G}hgdJpVS>s<z3
zTl1^;WgOFSx)vSvC7e=k7iAsvzv*}#j==FcwsAVx|2ebO-%fHm=5sncrSoKKI|XmJ
zL@EBVdTTD@n2yd%ZMVNE>(uoT3LN=E-yWyH>SGdcypFw`4)z^uTRJXt?XQ5-@g4>-
z{<shh-bjg3{AD^Kf#Z3PgO_+{oMit;g3{Y$drWUpEqYHlYmS4mUb01j>HPvYp7$iD
zm;GM=TY3eY7qH{jbWZO$iC3w&)wSsT)k)2Jk<-h*S4zB(%l4Swv$g1*2YdW+;j*lk
zY*Ao(XKQ$`aeCSJ(roE<hhBD_YX+xx-B0TJtpx8viBkM!^}9mGF&zcVY`0S{38(b8
zBH+j$`lcxbrlSpTe7)V}bg=Je+S1XPtGAh)j*B^J9gD$h>%7|n9M9|WgmwPHzKck_
z-^%uw-i^y`>)n>EuD4>~Xn(Rrf$7~09M9_mUN&E2-xsi@H=5Hsi_`lm`YYcrcZ2tW
zL@EBVdh-E}=MCa`+56(eyGpjl^sar*w%)Bc598bEX5eUlvPFUEeFHe2H=5&R-)pg@
zH<4?nr7%YJD4sE^j|;`%wGg2knBFgC9Me%<i;lq(PHCsc6_O76Mh69^V*qfxjs#8z
zdmqP^j$BR$yY5IffACl9Z~?DbWR!lGjx#cj>F5O<hE63g{{~AqMMtcxgWkcQz;FYA
z<8`EQI@tS{wsaJ6I?7;->`@HB`7hu8;x+y;9e%*^y!qfI9y%^0%I%rbTVmD6w?tV7
zVJI*in}Fl(&Eo8__q=TBSk37;#_33Eqt=lI-dKrJ{AD_Z$v9RY+cbKafB$W**0EdG
zLC;iCV7PCA<8>542OAIAb3C?mY~ysW`vGM0l%rb5e(;VJ8Kobl<8v9uboj2c-L4*$
za7w!h0*?HlXJ{!f9X){Kb*$ucWN`JXo$v044tD(g493VF#k)7v<61B9+B)wZ4;;_C
z5xn8ppV}3>pG^M#D%)dv7d~%W@7Wvbacw1Vv_ILR!1SI5j_19|>1EfmZPnXpPVbX)
zxsc6||D&$AwcxdN-W>uQ&wCTRto+#hWa9l$w#W3|tVQoz3)JmYctO%jwkR;YTY%$v
zU6QQrl-(b+rMHsP`!uKb`7vs}4&V)yD8*maPMZVA^Ll`nc&L8abqh)_lI=0Q;jm|G
zoLrZx)*C15C0i7j-ZjASygr;>HgB?}*8$h9-C&3Odxq2d<|pd*oB-bch>X$?)4N{A
zF&$@X(Q)TvbvwN*>!52J6qt_Rf#Y=qaXQ%fv@IPT(81c(B2GsKsr;0AaV2>DBuep@
z>DZd0F2885-q`sO@wS!iF}<c$w(HFw_W1cmXW(dmvPFUE?V{n0<Mb|&b=cAy#OYnk
z>HYPHx}64rH%_7yf0^F?!13jr$nh@ZcrVNLnBKx#^ltt{t#`4kmuyjBdN%^c^Ja0p
ztln(tjpN$s5>9Vsv0Cp+@LD8F@t5gMl5tGO*;;h$lD@yD96v70I-b?&*Z~}`V-}}l
z8CQPV<3}>5gKSc{P&~6%t)mjW;i3ZRhw1oI#xWh{)wbJT7YV26=mi{=>k5sI4#4p`
z7IQkDuR}*Z*Zzt)9nGclL8ZS%gE!KKjtwB?dDnuM{G)MbHOE_Dw#W1?tVM4ijPd<#
zrL321QDE(_tA=+Yr}rg}S6gq3IlZi3lFg%Vnx9Xutwrxp;CQ_|IlV7)ydTN-nBMYQ
z^j<(Y@p`YxddU_AruV<V@w|IEy{~e-TD=>&cKRO~M>gO8QLXnTco&L{(hqB=Z^<~O
zW7Znm?X;JKQ`+f5;7|m@MsQMKIzoZtbsXn(ybdhkXg{rv-CVsrCF2O|E}j1>?Q|J<
zZJl?|n5gDG3to5ZPwjLI$J;=*$MkM~(YD_5EOou@1djYBTNIeyv%v9sZ*qFKalBf+
zrJP<ij+4#M)9QNL3*HMNqx8e-?ZZ=QUSqO#-t;!d>nGb|de^^XTW=)n@$GaQaHN-P
zQDAx>)$qD;yzg+lTD_N{m(5?;^BZLIX<zktx)Z$k7eh*5dgsbGro(NmZ5=uZr?gWO
zaHM0GM#sHJ)Z?iSr{n!Pbll~1oPz+;KygI}wGLnK4pCGnx7CHGWgOEnt2P}HPSLSY
z*71Q>2lVpoFNo8zw+<byXRY;dmebKVMy+F+#y?gc4S?f$qrpq%O#Q8d<9#|>w5RA;
zE9)Q(1u8oV3xMP8#c}oyaQ3wA%7@dzo`WKrt6HjcYy|IOkxBYtI+n;dRv+edw%b)R
z38(1j1sv%;tkKaJI9^8rS0A6$p(B*j@eNlWgY48gqQSe-hK?8+$8=n-MaO$ab$#5F
zbsW>^cn3IMM;fQ&vpRIdaXL<MItKot9@p-Ice@Q8(K3$d*!HsR`q=!ldc4{V9M#7c
z8XX&f<8|b7I!f!%kqjN|__0*RQM(#esIHIw;7zrm<H%ff`4xee+53v)?JwJ7dVOB8
zt+zMq@#C`@IMPeDD3EUyx@&mXf|p(Q`G(`w_M-w$FPj&W&ES!0y`kU@6`7<T){ovF
zq1L+%ylgx;!|`^K?J>Q%wdsXDUhgbfFWI7?=+*G<<n*59c(r<$aqV=uj3b+Q2h{Df
z2)u_yM(Ky?&5&_SN9=mr^>%2#x}7EfN9A%}qoV{kzMUTCbbMcjj*VQsJ;&)dHe6kA
ziQx4EFAGdZf8coDlU%)B<akSDdra@*^|tkv;k)>Jy{!h0^pY(KtlmBcj^{ng>Al49
zYU^z;r<cx=$R5Sv`_+2auebgGE8Z?q^Iqe4uX4O`vOT8vChWO@hXtm?1@?Ho!mE;A
zvPFU695lRlIo_W+Uaj7fTsvJU<H)AtR<&LS@D3Llr5{$mHE&8drXv|RTRMhGIOX`3
zCF`iv=okzfUvDnBF2cr_U+d6unbX0}S4qd7Rcami;2mj0$J;WF={R1Cj`|W#(Q#VV
zaZ97a5jb9l2dCrrI&|FSbg<`HNyn7-Y8~a^wKb2OAmf;h@YihD$ItCVdy0-Y;HV${
zq0w;#I9^9*PRHFkbhw_g&i^h$0BN8&7xQ8rmh3sL1n}CL$4-%POvmQhbVzy?9Xn+m
zHCi3O@j7~OI&}7uZ=_$_KYTbHmpC0x(!5jAu~*}t9=0ghYv-NdB_5i`8adv1QR@0Q
zD(fH&1u8oVvw`DvByjfZIeS_ip`4C#PRFJe>iQ@JudR9POEQktN8$$C?aD{ODfN*7
z9O-q`=r94t>qzA4!?_L}ah#6tIUQZ3d8bkzx!~O>mYDRz>cd;cF&%CI*&44_8r1b+
z0*-Vv(CAnO9Iqpb)8Sf&j$}^91x`m}Y2K;m@CC1}d8~tsV>(XPq9f~?dVX+G*3m?x
zBLg^I$1F}q(>iqILkF98z95eWkR$Awqi$E%z?*8LJ~{!%^DYK2v**t7zAf8hdgC|Q
zuD4fbtLrThII1_YMS*;yunst$cO$2_700XXM~gYVt2n)nOY;(?-qOHpYaV+(LCw1p
zylgyZ!|@K4?J>P;Ytfqydl*lZ{<c}xOSUL5y(t>ry_{Z8j#sO9BiByZ^;oj$vtK=r
zEe7vlB9sH`Z!PyrIHn{2b=&ner9|CM3xT6@@zLm*1RP&)$2lGC>(H^AtG6|FQn`?h
zs-fz3x)8j!=CPB3<9W|=^+x|wgKUw%mt=cP?{3($HNM;)qOP~Yz|sC>ivroBa0@t|
z_adjaGsml~w^B~;i=5t^kJNgPgEv8<5`S5}9o?tqy~*)*<#^L&drYtC4cmI#!5-gE
zI|E00$rc5s*Hgo5#C<k4{|n%FwR$ge?UY@=C!0IAsPzVc*Va7t4H?IDEUrbzz0GPJ
zt7RR*8XdQR<Lk|h(-BgKj=P+WwOqYTdO@vYJ$P-+W5>xjrlYzR9Unih)?wT%)khDF
zjsw8)I(#@Cz3R~6`d{n(?^jd=)dj`gJ=Ho~z-w#%7bxSHj%46$^`l)q)H<?c9bp<B
zJAmVL1aUed>d@f>9jyJ)yFg4wiAG00c*CKO1=f#tNjPPE-YNSRt@RH$-oI%0=Ky0g
zPmHO<zaXxhZ*cyN9;hzoz2N1`kNGzoIG#6-<BjEb%Lb^+`KYXeFchd<D0~haZ!dwf
z*N?NO?Z2^HIahExUh`7xC<X6)iAwxsI#x?KrJNJCNbPxm#=n)o@%|-p{tc|dzmZ%y
zv-j>u^Sp*?{}RFbx()xP$vD=Yjc=;!gO%Uq2I_Kl1&-RmV2zH8!0|fLpo6v3p>^oU
zf(|yn`k5=|=zHqpxjT6C=|oKq%)fW;s*k_<;0*_c+UanPw})(x>0P|lwq76D<Btog
zfg`<Sivr^{X?S;XdPi}*+ICgM>0QT-r)AHo>uo)F(<Dmqm$j=X;P`Sr3|>}#i5%|{
z*&fqt+-6(vo+X<41&;KREecHUF5r0Hvz*=}j#sO9EvI(_r}y(oYQ65@wKYE-1RT$M
z4ZP$Z)o&`tdq}p&^v2hs_v>7>-b7h1*`mPomI24}-sJSAbG%x;JGp*I_ln6LMf2zC
z_M8UZ*N9LKtbW_eIHtqlE!*`r@3^|1x&cS!lA+Nt8#rEvag4QJj;}+<QLf%LaXM0@
z@>9+$Jiu#fe)>a>y8PV0%j#_+$2&r{$MnY4qBj%v_<lK3)=Rc1uzE|^@Op51b2(mZ
zy_Iu%*?oJmIi*b9PLsiFYo7B(sakJmj(0N0J3+R`^zMc|8Yfv`Iy%7~ulJ~|muyjB
zxJNX+y*S>f9IsYyHP=qx;Of`&eYM_F@Wx7%;xB8b&1D?Z;f{*}E*y^eH}O5S4j<sC
z9Zc8g$OMjWr*WK)nRV!JId7fUZRT`DY*6dy4Bmd6e@sV+jAJ?qYSHohYib=uvW__#
z9m|2^btG~+3hU5ef(|y0v*&K83<H|0$Bo6{jklrWqh{)Uo&{dk-=5@nePw%0?^)Qh
z)&2&;9^d}1$$H5a1y;ZPG`#to-v4mC+V&U9>3xN(w;!6S_1*-pt@(I1aC|uzaeANT
zc+bf8nBLg8ZR@><hc$S;BY~sxBU==h-rK<Oyo))#i#cAc-gvH^uIKayUsdZ(2Jb?N
zQv7A@w3CcuIxYietG|74MXlqetYfK0$9ur>I@WSJme-*pjjK2IoEDXh+cdR~yWkB%
zfwI7KOr5Ic-3DIP?&*J!k}WECC)pm;Yu;hI-p)=@>kS8v_9t5uSiPMFj@Nsb)4Ph}
z)z;fAPVZ}6y~QA(<gxn(vEaQRGD<&8FC9mD-jf{fiyUuH*&fr|`5oK!I|%mpb{YyC
z=_OkfnBM*x-isXXI*wPXcP0E_&n?}9F|tQ-*rV$4G#tFPuG93FaZJa`T6BEgTRonx
zmvyYy=r{%(Uw$_^9k11)V>5KH^N$)%$0?1D&ESouf|CQQx6dV<a{hKr_HUEcKj3)(
zjA_<!_w_pb+s&0TeM5rEnBw?&bvfVElpphNEO0!p3&*>K<Nbb+x}1e~rS?J?3dBj_
z9B{lnH_qNx&Yrft9OugUcTUG@Z?z5w@XnX0#9yZ4SqZ0<^J3Y*?Hd1{0gm_2gY)n0
zI{Z7!`B%;P_lB$5zm?$KYs0^F5>D|iey3D^?`Zs6103(459i;zb@+FUYX|JRDO4xh
zYt-Y*NbtUA!@rF(j`cU!UAD&!2MMR>@Bog+jrTM<jKJ|aIztERN4x9LA(UI^FYNhK
z(&6}=x}1H$n`T4D%;oCx>jhqRT=<aVtpSe4U8Z+oEqbe#i8w{?N?9-2qCmb;_!&4}
zZvv<HBaT<w?%m6+df()Z3$v%G^{xePsK_M!uy$WFRn42mwU+}N?_}8?(|fWOy$fKE
zKQ5HZddU_Argxr(H;dDInB&#zHJ4kD3tKt8$G=p!)63w+BfLsrdJoDtrlSar+1C7}
zwS-gZZ5eRXPLF7Gv;dB;w^^KyV|D0=F1OYjdtRB!rjb;B%JF<Pc>NR=*5_GQOi|a{
zVy@nfbG-Frdra@qTJ*MnJ-*&f%6iEb1y*lOHM}c1y<c*?+ImYYx9WY1tGB4H)$Q~w
zc$0}x4y@kRo>c4I$nl=wc)QE?nBHFR+n%r8{z|Pk4mhe`vPFUEy#*X!zdJeJuQ^_=
z-u!ZFJKfIdE!(5kn*iQekx}|#dXLCBreiH|HruI$Q`+ffS;uLOjuyc2Iu3I>zO6&Y
zLQV&JzMaaZY?E3?F?i!_>5y?u$K6_Vw3Bd(4u{=ReVo(i@C1(6agx(<z78F0IUNpM
zeH`nh*5L|XTl2{h8OL;_0cWc|A|#xmBUjdOL8GHLaJ-I-oQ{ii=qQE`b{ur#bo7_z
zvC6nn0N!XD^%0?&@9vfTyQK9`JKu$W)IaEY=jA&5+s~D=Bj;bLH2+ilJFF=`*6yFs
z%>V9kycHbpnStv5TPo`y3<cJIzXpykXJfim$IqNSZT~%4ZY^g$r=zuIK6x6v^F>DK
zhv{gdnNKF}k=k>m#=nM|`J@ZyUsWCcUF7^TaQ?YT^F*bb)4*$MKItUkly++RK=SXV
z#y@-D`0{h({JT|$e>dTu8;XS5i;?p$@4ost?F(KE`AT5rmm%X=e=7&hR)0G#-A_?;
zT$6QFYjhk1j@RJ<9jqVyQHKtP@2$tJVot|I%-3lC$IiQNf;UZ3VLeWtU#c#@&fs+i
zj>_d8$2&&0$MlZ;(6-)Tu*V;#(}1IXNwz4kc0X9d8_nqzs7`>T{j}}g#Od9^>D`2z
zUcBBc@P-nh99X?Q0vun?30!+IaJ(<c_L$y{wdj3ovRZGkte0$2V0yOz$MYs~dhI!0
zt=>@RW$l!`M@2U0e4%cqyTSXS$SD0Vz4<bZ=}16lv(-+&{9LrBw9{nZsQeu@Iz9uA
z*OA5PaIQl~99M7ea`o0-DnF&2W`Nh$eDcFQb@|QW>a79C+f}y5^scT&Zv^b2y(oG&
z%6iEb1y*mpHM~Wf-bNg+w%*b>y*oL*iC?MP={E2ti;U6_tG8Vz)OuHPylx!t5ZNBn
z>$1=Ge6lg@@p?UgqxvOV6qw!y8s3c@Z*z`Ut9KUkvUa+Q(>r~)TCWdyV<k%Qm+8%s
zaZE=RaJJg%$I|^2rQQl;9W6CF4gklu)190Sk2-WL<8-{o>3DjhT1O#x<80`dE901s
z<F)8Gw?SPWr)3>&H9F1!$Ll!E>F}&W$3{+vGpA#BjC$NC2XAK^I=0I=ro-hU+x79N
zgj4Fn9XM)NJ{lc8fa7(X<aD&JL&t7Thl`!mPN}W>JgU}V0<SF{EoB_j5eJ;DcJ*d&
z_4qduIMUHUqvLhpcpVox9i8gXah%gppVP6{qSlcN-T)i*@tllfI#$-A!%M;`^|4;o
z;iu8j1~^{FO-_fo4jtv3js~2L<Y={y&EU0FAH!uF({ZvE9X~~>>!V!O5vb8|0XSZV
zajbRT6kLano1Bh@oQ`W@Y8{usYpXsk$T+6Mqr`T*%9C(PefR=L?J88GBO5qgha0D(
zM;$sGE?CE1S5Ak6#H$=v&EU0FANL=X^fDcZz}e~_&q_E&M+R`Dqqj!KGr;jWd^jCp
zb?ETmbTs00%#zxHq9eB!9eFa2=~!Ef4!x#bZI*RJYINL>RO<-hbVS#o!_4Vu%;{JS
zdpeXCn~xXQqT^W^$8?;nMMoP6r_{$~Sw|m@j+Vgj^%2eK=v#-5=nK|%)r8ZrGeWJS
zvKAe0$~dOOW54Zo)kDH5I(&hnb`_`5(G56WM*^o~U>!O}ayr~N9i`!F9cJ*_>K~uT
zIHn^JI9vT=xP()5WB^Ax25WQ-0gl&^#_1SZhmI`hVCQ9LZ~(-g7*97<&r5Q_n}uyG
z=;f8s!128K;3fa)Ja0J1`-N<e={>vOw%&3#_59^BaAc2cQ6T>)oCS{OoyF-L#qnzA
zlSQ1~Z#li@p6Yt5+%E{rL?-En=`HP{F6YIZ-b9YKy=;%^Ej(abZ$9klxbua@z>!|E
zMS<zf)$p$5^d@n<TD@yIy%#yXSyDMG<Hkzx+N$4QnyAZpBd0f&<4u+AF}=dUTJ*vm
zuh#`Q(o41|D0(%#+c>@H9IsaIPEPNSoZdE4IV*bIz-z01KkBZo-@TmP435`Lw#W2t
ztVM4s?D2YwWxZsJ*ZYKq_b{h-0>`V>dmMV%^_-^MICL^v-JW-Ycc4Tm{_5rRPbHi(
zzBn9`>LXj@-zUKF{p}=IE;)7hcNYG!@rC^#2~>+v?5-YPT)~@X!@mIFc;2%dZyv|{
zx@?ctM-lAV8c%mOSGT`qvR<-9fqbK|6F8ptB3B<%I9_di+~oA$g)y>6F+n;HP}<*W
z@V-bya$xmwvzNM@Z*qDIINpA;J*GG4ux-7oVUKTr;lNRUBU=>6Hwr5?ymvXhGdbQL
zJzy`cCI`C|(tfe9#|LnU;Vj{>W|q^0dqrNS1#P3)v9+|MJPMa;v3Cph3>YURl!SxJ
zN?^PRu*b@hHoE+PogR}oMj0i&)L&Avr~Bn}H7UWYteH&Gy7b#EC`jBA5E>dPL6V*3
z#>824I>t!0eMK$I8G6nY!7fN#_zG>YRTo<jo!dt!VZId?7Z=*fE8LZ1srmhW&A!Wp
z;aFl8g!(F4RajeoYD$_3T1;b7Cg+QE5Bd|4otBrAnP&3!HwOm?m;*vPn^IFIr>B{6
zvQ2qGp&=nbA!!{<W3p1R$C;+4=S|K;zJG|H*)PE4n~|TNJGn>Kt|^iYzi~M^<Fe8x
z=S;~PlkPVrXJXg<oSdvN87Z0BU9+;LPVADKmoq+nOui|t``FO#V}sKCyLIapm=<jI
z4@eIlW9}Z*J$P(jYM?oNOnP8iKw!6k4nhPDpF&D{N@}K{^T%pbfS<X$VDD5f!a?V#
zcQUx>8VC(_uDVA0#zr??Q=z%RUDra_Qtzc}FO4hI_v<4zKx~Lewbcl*F=7)$x~5cD
zFrc-SvC0yG24Nr4)OVy{5Q60G#G@0MvJK+WfQ!w$Rr}Wy-c{`{cR+bB14gUuDm*`W
zQQL1MY*B3|HP&DNe<YHmllE+^Hwd`p$ffHEc%?{8Q~USQy9mEx$pYnBTQrU-;KD0w
z9KMn8n+%|`You=`OqTtT((Yo}7|_QkbOe^lN=eJdCMOV)e{E#<I|4+z{3+i_+Fvi@
z^{7PhQIEnVyGlMPRLrM}P8yw-6+cz*%S+Glix@J%FTEf$t-vooy&&H&Y4pJUL-YLu
z&|i|!Uy`W51Wn6G$&Zoo4~DA6YI;F#dS2$l^z8hUEdSuKQ?k=iq{QT;ss0a2`ZtU~
z)zJJ<(nNZq1DKdUyQ$S4ZDv>|ymo|bYY*YBZL)_pK%PpKo0gKFBGz(V4r(@GxYl=p
zMj@&J!7nQ_dqR3%mz>;uj9`-mv0bF(=jUanPRUP4I?iu$exBerE-z<FuHcuQlb`O_
zXW+0dlk-!?Ob}>Weo88q(<h2cYFS!xQ~?IE2X6r}f=|9*F#QAxK52e|v=%^X{t%ZV
zS_iE^lGtEIvwqMp1pN`mNF}UB;v2b-QYP!)=jDDa9j5S{u(F4=B6nedj<2*2kK;!r
zhNJsoG*=2oq~H!->Z5HC$sfW|n)Zdg-1%5i2uGxR<}<TLdAvOnXAi@OVs8i5dH-UO
zw&mYj8hgH+JsO3Xf2oo^#lHlk$rm<KGyk4I9`B!-vq$;NUQfMr%t4kI*27sEE2&)Q
zm_#^=!N?bN08b$ik;XI@<ZQtoAhORUIHBMr9N8n?jMq`Jr_AZIu#I%EvLPG=JB__q
zP6rLA%$`=qPVC2Y(D9UT6!GeXN=H8OZ0UGe!yC`(pu+;=9U<9MbQED5>0n1b!ciEi
zv6sy0pkqC=cMt^$sB+zPG1lqW%>r$scm+SSgc&ic#V_e)f${zb5Z?|mumhdzP<=E*
zWV~Z#US_Wt+iclO1&+5@$k`*i%$^(B<L2Opv5gPpI|XN%*DNK)?=je#gGb6Z877Qj
z2ILHu^Z^bo<?=XNbMVo?;ZF%iVIUrn>`-}=4r&)E`8g9a$5^M~e>Dg19u(N^LFeE;
zEkMA{!TW=q&8KPZ&F0g()+IL{TRQl%&{Y=@aar&dI#rhmUi|DEZ4UEqTl<D*(7uKH
zh=|S6brw6!^l1if?7RP+>Cw81LRTP4NH3-|VjyhkF8$js;!I!H+RL)<a;ZGqk65Lf
zS6p1bNQR1w^SkWdZelT7h%MnV=Dp_V%P8QE)n$|;m>m1*m(7U&{EA?zG!=Rgw}K1>
zQYUn%E;|n&Ot5ClKKWu4eetyDpuH|%s&^UR7DV02I|Nfsr4S`_1hb%D=3b)nt~AXP
z`IjnX!rP{Dt;@C*YZ4hsVa1le#bVjni5_>bQ0Wzmr6*yXRb@y1I>j2j3ZjJ!A;Yjt
zzg)LjzlF-ku*R<6jOfN0jWeE!G?o~P3-?j356XzfGzzSq8pWdYJ2`$exZ2o1GRoL9
zI;!ZZTUvBfYWR&yx=xOz`cB4DLnp_wMFsP(8Y27Cua{%N;Beg?;n(?Bhxo@v6<#eh
zm+pK1O4(z!^oV2+`J?o&|KsOzxXdQdxgd=*y%A{)2}2A=j6jS;tSiuY+#WjED#0L(
z#yZ()kEmCU?h=5`+qSFl^@J8EY{FC9(Btf}HwI}+`-*9@VhsktS=gZ3AOA3m3kDqd
zSF5(G67aT(utb&BM3|4Xhhn3NFhCwi$Oj!d;1V{lgi|_NLDGsrXf8}s*=sHoVM0gy
z#v$rC%MxB1IBA`N0o$`w`+Eo}NXJT>@#`VnmK!4-n{`5rvV~R*;?dBWWe_}tM3p^H
z>qZgptx2~R-c{kX<=s)(tlHjDvwvqzx~s5Gh3~4_?ypG)3D2qUL7MH|H0d6~Q!0E9
zVHVQt7>xh$tHFl}lT`RHVJy;AH&US1ZVd*p<@4z%YXWPAKh=MXP%O7!Bev6Zf%&L>
zs(&f%Ec}9XO4Bi_F;28y(Vi$x^Lj6R58)9^x+zU_n#TI(!cI&ASfG8bV6tf4?kS|=
zAa6}~6uv_jpfruEjrCoHhG;01ra4VxeUK0hM<^YS=%o)6_G;`GQp1u1@lj|aW9T{q
z>2N}u_M&`wvfhz0Da~-O!Elt{5gMu6I0Z|6%YZUBA#IQeI=V>bJ!F^sZbK7EgpQbe
zlAVs2!1-b66e9Hn1BpTCh|56Yc61}`D*7ev&-`jBZ%2nFe`$XTbRE<tzO9V+v~Cyi
z*jeQ9k><qYC(S7pKikRMACc<K2?Hqg1SbrlW-OB*mCpNUNui^!yzC_JN8)O^kTNts
zz&|OjZ)8+_d{RVY-=u*N17e28M?}TM1q37|Wo4$0$<0lYCU;3Vq0SsTJtls5f6aB4
ze`Lhg6^UAW3JBD?G%+VTGe0NqVSIWJBM<4*n1TXz86~A;Wj(A<e`Vw$e2NPQRtjoN
zPIf*np5TH>60U>fr$3Ba4`}BhJfp(@v(TLEhjQz$jL6rPq{}Z!qv^U@Ee$Fz(AuJM
zvr_WM=HyLGnwFB8pM>H{NlVL1pFEigY~au&{}7eunG<uf`eq`Zx(TO<uDd5m8)FbM
zW4b3L<>P8%&J<j~df*FL(iN=9(<hHXLlTmx=Eh7&8j~?0X>3Yn)}JqJ*}h0xt8A1;
z(!?ow_zOtN$x9lOnLj-vWpYN}@p0n=17c#vpzZdbI$pZIhU;`GsmgWNe{Aw$JvA#0
zSssL_cEmQEDGh1XOP;mVaX_6Wq_+ED66-Ydkiy~uf)r(37nRlh?e>PYIy5lpL5t?!
zcH$ul_uqEqA*-kMM)S9;=0Pjv-=Thps`ytN;K#6WQ&RHMY+sLmh(k$SKsQ@GNSUPk
z?TV865N;GuoB7M(<$uSGKbH&cfYmbK1&L!h&C)QEM}|!G4>2Re3=K$9OZs~jQYTNQ
z8*sI<*HRwjQ+i&E;P==2+nl>#gw9IG?ho6Kt;cuy_`%H>|8@&emt(C(QRhtaACNyx
zU;Y>M|G7=pSrXhNN$R6)lKc-!;(>ao?dhUCL;nZl4_OWWmi~WS4f5>!AC$yDsD^(|
z{*SBSAG?5CyWQ!YZ>V_VH-v8Wia-9{Xca%W9gKU#Y0`~if7~e+Zx`qL`HT09#UFp%
zH5P9jBUijxEd7`%m(KAYG(3lEBitnyAr03zKjN-Q(X|;074mf?x=ukseI-n~Zb12O
z+Q8AZ3Kp<g46kE_zu$Ei*GTA6Pd`NRhxVcLW0F1PzARmrqI~8vvpqs%&j=8+$KN+j
zz`mr3=?KSqdqftPfAPrR{d0jax;#Yw(d8WGAK8XI#lH-siC4blBjS)0IeB{?01=Mt
zQ9iRb3&wc=a^-DUh=KW601$7_hqFgloteEZl0C)0d~73Lc4eBCUk8o7&YV4V-;VaX
zjL7>p3u!7B7MOn*k-_^H#Mz_f#r#`?b=Xt<TZ}aEuqMd-dmeeby<VI>{=RV&IKcb2
z68rfevcT*$1dg{C4SRGMkLrWJZ+rm8c>i`|JNYMH5>)DUA3(glM9x2YI*jS{l&`0<
z_O~C~=-Mg^to%-52i{&9?6LOO9AIXzxonT^cN*Jp`BDi??;@=5IxYf1I>;6UhI<Mt
zJa0b7i_4b^FMWFv_LP2f4eN1;EHHc5;U90Wh_grcH3&z3<jeM$j!+o4r6Wz!tF)JB
z;AnrcMS<}qYj{_3ytu5Y@ctlQzh?D8|DWAfeIx?M>)6QI^W^NEk?k=Z_>_Z99cQHL
z<cf}5SqIsoz;t{K9M8Lx<Mokoq(1~8m{972#s^=dSz!Lq|HS3(9mdYIKehYzh^#(d
zM<z@t{;fxXaD<`2{Cf?VyuIT{6OQcp$~a0V%J&6WIn(onw#xZyR61|(Bz9))z9VOE
zh-{DP+7ElS+RG4R@;Z*oI>;6UremOn_aevJMaGeiujTt0Ovg#sWA}{79`k1)aJ-J2
z*qQdHa_Nf5%K0<d9^3D7Ejm7PQtP-W>mXYcn2saB@w|6A9RV_q{BXn%OepQ;E)q2U
zvB3N(!hwvp=Yj;Q51Ioo9W}s_J+_}4R&3P=eZv4arCphTBY(&i1*W401<dn$aJ+Qe
zgz>(Gi2!>hi1xpTv>TRG&bYlJ;t1;`m7nqqzAtz~k<S9-wU^6}3F!=86F_8-?%pxp
zkB~3wkOe2pI@ldPX72;w@TU|^91^6L?BTYIVo$51n$y8>Wb;w{P&u=A{xZNDk2DL6
zH%P|mW&h}TWLx#|J$QH>hh-h?&LgvT4me&%0urnpM1Y)dq$?KXM@zuPa2)o?Ul!Q<
zLJdybA)KKEfvr}_`(q&m7$*BHF#nd24(_=q2j+kbWV}U$L!MdAC)_K{7?!k+;^#7s
zZF-{?d+U&ozg!+i^~D0?eGyJ88nDp?j#tVYtY1=jrl#cOWv1sT4@Ujfb5Wsz5B^+~
zSvuG&?<VwuQt7!H2NOO2;`tZPB314(yxrx>e&=}>kJv$#g2Mod^kj{0nM200YQZ(y
zBd5|N#8exX3Rk0DcUPRuaW5HESz`|OB<uDTeP_F`l69uaFr8U^e#h71Z~44hpy#V<
zGNk9BR@?WT9_^Unm@zL>UlI#{T%0S#XLH7)Z0L9qL(fQUEiS~W60m;>CFt2M$;ax3
z^DI4L8_50{mz}9b3(X*&6py~Hv@G_}Ez9)?w%|oDlYW`LbHA^WJ>YAAz9QaX(A9Y7
z9Tm<_^{PD+-AkUaoWaK{55_bsbF0+pTuSw8go=f(MsJ5`-I`C|d85ixNA{|Bc$U+a
zXT&YSnlHpH0ivq%J<Y2<U5X>?myso-w}eyg@4m;WN~b$?>7YfwdeGI;x<rf4tY7xd
zC3x34v_xkzuBoRyv7|4tE8d4^!K9KAN-jV<jolWpY$^+}ssyQiU3ZvTlb0r?hHX8I
zL|DO7dK%1RDcxraqqhhdjgnn=h;>?mw^|Uy_gRoHcsXgdNZZQE?h4{xjHkNLe~VTX
z(sNvUGmM?vSsY6A?F_x#OFCP0J&m3EpFV%tP-!r@nz{;O+UPrloNy^9y*wyvL*&%5
z{g-393SE9L%PFTVQP@Jyx=CBZE1xWsw*OZ4hPXXKwS9!Lcf7bYT(vb;*&0!9*SSv_
z<Lss62a9_}E8g^1w&Y@uzSzU+OK)Xcs%*`=t%<VD1>0g&``IbmbS8bdU@E!Mbt&yR
zu$=j0Q4oRHJ6Q44sN{DjXL|);FDq{c1>vsBZ>{7zsqz~s`D8<9a#4J+a^1K@T!P7A
zht5>IPcS*>7Rzl${T!a~fBZQ$IxgaHCZ1E%F&0x(@fbqqh%^_W^FJE9X!xb$0X-w!
z7SV+0iRgt$`96s45Zfa@f=GEC5IZ7vLhOu4dGvS&&HLyW=8s5ufrvqfH0SAtSXZFu
z;!60*fO52!_A&@KdE$ZrNB*5EyrZxM=~)U!oEa!7dJc{c2E2*&vTA>vByoYBdt0H}
z-b8p7>6;3Moo!1Q^u7}x3>f{MR_)KvWa;=!XRg*j&!rWq@Kht#U=U2!1lA0wnYk)F
z)s!_DP)p-g+o{&9!GIduquNe2XblF`-gedYKw$&YR<8nu)ks@eskW^FZ=;FtT2VWo
zc1F*6_2K3#^gb8;e;?Xjgy^Mr6zDvN1=^m&@zXrS6Y~{<(7Ko2N9c@%HQh#N&)Wxv
zzBk4K?L*&0Cp>83PXpmQG$~5oMfB1)5pH8U3xs#q?7tHoityx?m)=is#tNmWW*h6>
z#dWNTf&8cIiL{;0#k}+#g!d>R2im?4O_Z`u<Ht)MD9$0BOcK70rvzlrlXZkPn#VhN
zN!K)-yrus;;)Du#g7VQx3uuXsN_`+1owZP2Vj<A;XQaEMtf`IM9O!*F59B+cL&KEd
zgif7L%g)mK=(OA^r+=X(>{A~g`_=Li3-S3i(LM$m8h6MaH!R!8&8j21m$)4TOLJu>
z`6N+!ehuA;_G@Ft4+1^UM&+!e(TJ#eoM>=C=qPumj_5|BU22$hzi(ITogIJkl<dq&
zQ__=i^Yi*fB;h6kJ=h@6dU1zmTuxqQe#S)POist6FybRfN%=8!vmq!geQe5<to)?3
z^sMy!^uBm-0Z+_C2Uu@eKImg+|F#nkaf{*Kc13!&i9JY!N=u2Kig(uhQ?fG0WhYHd
z$x6ycRc5D**Jl3Z%X9Kua}Rlg^?zJ%FrK+e&$qUL=<El)+xoxZ3I7y>%_p%?^waR*
z)I%0xAi4}50>YbuQ^w@i(s^QrJm>=?4{Yrrn)L(Qd`RWB4;E1Y53cwxtvrO%zqIu~
zrZ6-qi7pOIO^?ZVz$RY1Zz@~=BWhI^A5wE5o-dT7)z+Bf>pW0AaDn^}5as4)<fY@K
z>&fX^V^vRDN>3?42z|LAX-Z~V=G2Kf|NOC~e|wnf8;=KlV(0+dJw2Nqnn}tW+jr#T
zynxW8sEqV66C(2RQl`h}Wa6pdyr`UP`Ew9`6R=M(4j)s}W2VLg<xkH|j~N=Fd0^;&
zZxWz62>c70q&~ubQlM6Kfq2f0dw2uK-rSVD^rZ9xd=(>mTsr17c{$nRlp|K(jF^~I
zv3=L}WH6OA)e`<_9uzP!ePT}DbUcZhh9{(kc0;K@L=XP|;N3%x2L5;kNq+c>W`TV(
z;!@2qF#&;pRgf`5GBW;LJ`Xrl{u`tZ(`HcjY3bB5rvJ?$@BwuO{tpm6Ol$k+ba<ep
zI|f>5SVhwxla+@DXY%Rk8Tq*x@rfDsQ3dWP89YWKep^9&ROTN%B}3n9<xY2nESx+Y
zrV}PPuv5)9utMwX)Ha9#<RzUuQMd<VS{$9Xvw+i8F>C^kuB?PhNrCP~(YZ3c6G{G%
zJvzU;A=_j7#UYP#PsAZh7%btGdv7C=NBfg43e3L&$l!T<alE9B@#;X>NZeEU$;UZ9
zohp)lo`{5_cnLqEUfIE9<P{;ZKo|<EutL1-MhV?33q_LbQ9j|w-*Z?Yd+grUMXcM>
z+h4*d-w>#j_ZK;^PWCAD!3xh?gaj*RvP(GPrT=Tk*ITu`4GS@_@?QoV*$bDlg_TIq
z{-gt^=88Q}$(~XlbZvxigrUIvYpt=jma|8GGXJ#ov6!om4l<6gUn8Hd4<i!9%>v_{
z3moZS^|29&a3o0wU6EtFpUL)EeGuMOeRPp<N`1HhM|#=SJ;vKX!+R0DtUjopFkU;5
z@by9WoT>e>fTS3n!{tcQ5iTW#o18tuGkbS{BYSMW&RDUf!&|~B^%e>o>0sPUM_UcA
z5#t8a(Td~M)*JorVzNc$+)l=kO?=);Rd3<oC3`F|zgHoH^fDoC;AQQPF5NJ_9<n`F
zZ}GM0r7{3iskcN~FS|a;^b!Zp>%r;u<ao7u_d+jSzaqUpGLCGvf<f>q_qx++(c2t2
zp0_inm)RrV=)1zaj(k}MVJHwMh3>%d_JTNj?XjJ3WKXN3l+!_%+z3Z;J$QH>vyis+
z%*a~g^Sr${-VU-Y;-!AW>sW>~<r9Vi)8U}87tPu0B;#!9xX9_~EaS-LcI?mVSPlDp
z|3Fd<Zvw~bh~s$a5+&Ip-ma28rCn{5br6OE)6q#|FM+dXmT|UpRC7A$QYP7>xC+kk
zI<|qAt_!okc$dgH)<24{f!E7$*FmnT4{RWR*j0Llt3W1SE{V{=#sl`O3hnnjjPcJh
ztY!ve2brsH5e|7&1{4Tq>sf{nd43?F@T?fhg%8YL6;=SvW!nhXizTpRIDhmHR@b!I
z1;;0o%t80H$X(Kvnwg!ZJjh^T-&VwmvMxQ{z`nESAL<_<ZT;)-EYf@92+FezjTP_2
z{QpCD9QB$n9E$o>KXiYC0@Y6=-1|8rSCo`Cir;3kZnqOAsJ7cH|0`I+*Awm$7(q%q
z2%ktvIqfJcRi&Mj|H&@lorOLsf6!yZx1t{6b=JT95*vF}xAxbH`~&cQ?wIt9oGhFq
zPYy`xPVWLe{BEItZ?}-Yw_CTrw_EVv+b!tt?H2g=b_@7>yZQf}-2#*R%`tK#eSk$c
zFc`j+K=($caRVH+YYMcah~Z8QwVmJ5ahGt+1mTzs+L5i7VTH%hF@SC3aW86c-D<(n
zx4U?I^qizEd+c5=^Dnd(+$}ku;kws?`$&VMd#AQ|pVHuHzGn*;uffqV$QCY4Q_lFj
zg-skCi}>T|qe%0C*~Vc_+}|v3B%H0|DQ#!_5cC}VaDi<zA&)<v63*7~G#2@+jIk=v
zyu27ovO|#_PjUS)54U}$vSaFBJsTJl5ELwZH0`gCr-d^?#2rr?>U4tM;$Ue+Pq3AU
z+mz?)22>mO8S#8weapN^m(!8IHq2cR+3fU~E*(!hb{T%!uF5PJt98yJ$^&8-L^eGg
zh~L1|CQAp)<JHCw_g$_Ozt`o5T=SoDA3<)HKjmI_nB^OEdh<JJo@wprDKeqTtP}1u
zi}%cJgQo=x-|??@6*gAu1Vd2kaxKqar5oUjZRYBxf={*H*(7>cxlg-KSY$(?ru>#&
z&9N7I&V6CE@XCL5;(dGShf(4)cZG#g2}!>Oi>sxj#aSsi>vM^Mvzx`<(sPg5LeE+X
z&a5=t`nI+Vs?<9;v?{2;SDQ{W>i4vTywH1-UcJQ;Q?u9Z2#54{90GS%xES$uF>@o!
zf(Yq3N_&eLUqb7ovRLzjbAoWuIl<QRl4t2VZa(;OoA|A|vo@deqvt58p63_0vDC-+
z=iaTV3DcbmwAhzFAL&)v#nc{Of3rg^8!BtUi>qn|)h~0m<lHzPU%2BvAe){ozE#+;
zaaqg04(+E$w=5S-9q^>3Nqid8tGr2H19BUd_ctBBBE+{WZ*sFx7*uJnZy4*^w;+0Y
zv_pvwPX#)*k8f2RY4}z|nd+7MTBN5b1=E%m*w0m8Ozo)>-?pRvlZr^=7>zx)>V&=p
zcj{-ov*7*t6@B36KMT%Oves|a$$FO*6%(qyrO-0?n%Q}WsM^`$0M)*wUA&>Vrzez0
zVVhUnf1}z*x|X$p?zY3@ui6`%loH<k?0;_J@tG*MvR0yc4^h2-S-6F<dX>8=C2&+O
z0l`Ei;95%w0A*5_0CHT7R04}o0z&27e$bsE>!&eBDg)O-tSaHJ%0Oxtx|Mq~gq2h}
zXJOgaGoW>~jSh9Rjoo6~@DSTZi?Y^Y>3Ej!&M^8K%c!*zr*Ap66KTD!meTNVv=j?U
zA{&wVEwz=}+KJ#zZNRXiXQqAyt23#k;JgmcuKsmf@z=DKNB-1SJjAx*DYuo@WhSvS
z+Lec98h!1{!chW@xnnuC9c#L-*3-ylsr*Ij!RTH&HxA`73z6Cm9rtQ$KYvv=)Q0Y6
z{BO0P_Hr9Kbw%%L=+LE9-@(6B*CDvf+J=J4J(RviqfKXJv~iDhw^>?1nOgj5v~lIy
zr4zSq<ks1UG#=&m9O7uiM5Qd%#|Y|+Gc*5bJL{@xX90g|XD!8c)>dw3t;#xyCFWgz
z>WUF1))gfdj1ucvrfy?B%1uhC(FhfQQj<m~kJ#2WOO4uCTUDvi2-Qr}b{lBY_L{UZ
zqKR#i+T&)#EJW(JwYA9yEXRFz78lHD*et>Ua|g^EOqfZ8x2raGqFF?{YQ2lEJPQy?
zJQPlK-LdgcvKRTQ>m<afG<v~SgxO5TMac>~zBAt+)K0yAWNAipfaH_L8eJ>3HFhz-
z90y9C`HLfJtv;26V_s929Ve9?hdO;CTXfC3E_)B^m+<{9ySnT=j9+Byul#Zz*ur9G
zal@=l@RsHnb!+`An_aF5ct_^lcRegQm2(V+ijyOE-Vz!fwuF}CRL*u;9vM*T->!j$
z@<L0@?J#Rfu&>rVws*%1k!?%;+CA$rAU91g#kzUoeUwKFqF;z~EA{z9cdNl4x*Kbw
zq8<mf=c`pl-LGZKTIqb7pY3lthQ8-rKD4EwQ@ykOJ@F=v=~%VVwPksKFGG3#{(@IT
zwXr9?pMzXe!}45{Ik%H(Z<Ww6wxo+GH#fHAc$MI=!z0!bCAJrumsair#$15<v^9UE
zc19Y9w_JlBRcLYat9Lfm(p22LI8t}6zsU~s@V;W&&LWs-1d*)Twny)sgyY>B$G9DT
z%&Q9jwJh>Ll}R@%dT<oIk>l)~Q0*OF6uGcOU(qOVq(|vKx(8I-yrj#O@`gAX?0nAh
z*j1xGqO@1P_Vx7@ZbMsJj3tA9)5m=ITg{ZgF^`t|do8pGehwvOFU;N&9IADl2;aN3
zG^SIjewm*Mv*V$<D!oH&uDM+ooFmM$jKrM1qo}Dg#$0NT`Ff2R(O=429M$Qn;0znW
zrYfUdtfdA188@st|4`Pf{LKoT-q6tjb+f-(SRawx5jC^_iqN=yd9!|kH)^L7Qcc=o
zEF{)9ahX`>Yj;+^roZU`@Uh8_QD?%Mh1GZqz$A2_TGPEW#Ig`)Jh3JHBlW8ts`TPJ
zNc%1~z&k-giSBMq4b|T}C?{L*1eM^M(wO6Qwm<1OU|Xc|EBJLq@GRM9?<4%;+C#tc
z_h0rqvDrrn><OQ~*i$NR^?M!vQ+DL`)NoVrLQ7KL<re7;FrVcg?%0<>9(h>w%Y-hi
zPqrx?f%8MV6ZN{ZJmcHN7jq)rSC4qwSrP`$iMFqpC$uU*8dI-CRI^<0GJATIpaxn&
z+x#cX?b`|Ex^|gu?5doE*r+}j`-RH;g03Rm-o9di;AXC0<?g)XX9uUxuh=J#6l=M#
zRZb=DjC$!R*6Wr;;(a&W(Gs1f;EP``-BrEQ2UWU;jmipLovWtkeOr#Q*tPbywCl3D
zq+L7VdE;g}8W>mOc2@gl<+|R4$?4)-k|S;#W$_jnjBC<OZ&baiuUGx5i^OSs*=W&q
zarjPWcCFTX=t9jM{wVe9fb*fy^%c%`ThKB#N9u4!<X&#SC0uTeG0`8OFY8NjUSx48
z@78Kdg`H3wdF?x2v{z{~v#YRo#Cv3G4qOqI`K)&0-mq(@dXJ38@B&<La7P@7=u=Dk
zk?O0w;Y*fN)eifcTE4B1G3+sEL>W|R?=t9We|xVTuT{-;wy!FjYApW{{<+iG=RCgU
zpvq28l#a%mfnA(Fs}h`3V;X;F^nR_vMNbwSN(|lxpAW0jFgEJ3biz{S;~o7Xoe6r{
zB}XI=E8kmX-_ZSpyElyv8!8qX^c5Dp&L<$s_=n*}%W(Zwi@sTOKm&c1+2CX$n|h3x
z_GMkmSstbRa2}|$Ym&RIO6Ta_zkTK0aJP1X&&+7peAM)ZU3G&NO{yJC@8rH3V_({P
zM}t4?e$@pni!%1Ey!5MwL;1D}qp{K>rHxtq;<>rSe2;Ummg_mcTDM+bt#9=huA4~X
z0_&5*YbndpD}w+040mb|;#C&9R?xU$VWeHDp<qR%u2g5PzJ#-3i}a?Q^gf-qHRHud
z-5H~5EA30)i|?5!bh1C`5Vt|;+voS$i{~`f^BMXkytQBd`J40q)P~eX3LAF$S-<G5
zTm5DiTE@k$!aBW^xq{vm%s94e@HKa5hp48dy)%U_txkHBCZc!SpJ>>{{miagFU_U?
zt^X?g*WgBWmeFyuqKy>?gy!W>#7rtRdkQ8T1zR1h7LuRQ^z694x~ql40JL!zcVorJ
z0{XS1ui0T)tYyj1PK(gH6U2F%(znZN?c0sZ_PZ|mSy<%T((zZj0K3+GEs^Nmk?r)>
z-t8rLw<ynO6aMS{cAFzZOYAKA=Lt)D88=JEKkDQ4s~YN;R5ui2rC$G%zSchOXxv(1
zFRT~)cq{brrs9>IHR66jN<ZIVsb7v>Zojp{h@O7syAHTkB=vM-g}pP5x79-NQM_q-
zY;}F5uj@+cqZamE(=XDAecqu&dV7@me07aMcn<v?SJediUIks>?7K=ouTUsFR$RQb
z5=kXU^?IL<v2n{RsTTX?IDQUEy6Q3bRJCg{dUu1SmgN5KC3d$8n<iY<+k4Pa*Mg(&
zRH1`=iJ`({xZo%D{RUGbX&i{fI8fi&$xnY`P^Herxjao=)4SN052`e}ymxEH+)yA4
zF7|6SSLk%3VjRCSdc9iVtfPG~R(PdGFOM{0WWbTNFd}&-#+v#KKfhuu?{FeR2)}xA
z1|6kcE20I%vhh_A;Te9_&N0ZezG9JHC%*G+cu{xNQK!4=r1Oe$4aa-Sf{*)v2>Uf=
zQ~1@U@x-FTQG94At{P?7m)o!Lt#3BdI^|-PP;D%B$lY3{bMT2pISezm$8o}`Ao@x1
z>YY?4qb#j(<hEa<t8j9Bx>_%k#?&vJvxEFX^p`M8qKcyM{;!kq(F>Oxs|-5la@`s%
z1v9id8B^L&n{`BO&%-!lG@S!~zua6eUA4Ybq$N;n9rfgqoVHh9lI8$K5NzxCud@hM
zu6m3-=BG2(cG_EV;)+1m8B6#vNc`Uk{bxqE%4n5gSfSf0tk7>IFAQt!mG_XX|2aV@
zX%8+sFQLHR?_C(_PzsiqjV-5C7>v3T4(40pScZ2+<@uX>K0$4Zt~tV=gN`jfbNz5f
zqC<RjkgHH}*e*L`M}>=SYK2}$M`9ckJgGg|RXGSbSBL7{OA_6^Ek9k7t_a#Xcfc17
z{mlX9Ky#2e*xbz=Vh%NT_c#0FA9VQ#`Um+3`*-sX!Tsm%_-}ar0RaJl0YL%50o?*Z
z0zw122bu%@0|NpB1A_vC1G@!=1cnB74>AY&<NA7FP*6~CP`99vpiulLJ9Dsqa6oWi
za8Ph?aJS%);Lzai-OSzmy9IO$>=x8582|Y$q+4jW?jhz7|B!%?K>VA%;E--1At9k5
z-9ycx{-FV(fuTX6!J*wkL+~#LyLX3+-9b<PB(FPm>yE6<?6E?2O13X<t#_amF)<k{
z9R&PKy+B;>4+-s_k~#+ON{!3N96upzVs=jMq`b-bQ>IQUm_9?SA3Sy-q#<6$%?Z~>
z@O%ocXVW-Ph-=$)ZbQd~y*-YEPH>#w<A+VHdL=GB*gG(Aa#&4G^N2UzEDhZ}etwUk
zcHX_-_~f(RgLlsf3k+-<QB(6tWZ2rW&^L5X_Gom_yVvvY9Pi!p{M@hw6>THN{&Xa=
z=KS>NjGbkn2V9@*QFYS0SC>zZ_ug}NZrF``Z6k8;9f>@CcY1V9Zx73f_sT+}8b8_N
z<Tu{Eo<4rO_qLk3VV~8sjrgeMNaXgK>Cwl-JS-)H4)t+;zbte-aK=;Ky*>f%ci{d2
z?ly401NR4Tw}JcJJHKx;V6%aB1ok+vHNe&YTLWwjur<Ke09ym>+!x&YH<$5F4~TEO
z_oKK+CS(t+);EoRKk9?Qn@(m7y;Rg_nCYio!?z@j8F{Q#gVB3m+ws^0=O-TbKH`*A
zQSerB`%@!R3;t6tty#vF^i~IljvGA6n7Juu)A*&I4b18urpvCk^wpeWzxJIpE9Y+B
zTOY5>ZxIqR^?cE9)0~^UIQ@%N;WH2JtDLoF>I-wAWiD0fI+tgk8*#}!?Bk{W)4F&L
z3j6N%obh|}p9~wkyUl`%!Mnr8is2XNrr;Gm_|&&|5}LLQd+w8r*24zGhlNxhOnWoA
zC@ki^8~08Y><K%yA-A{Fsq4~yKY53XyPY2y{zApkYflBX4109Ny&FNv@nQ9=@0ueE
ziozOo>$Pvl3wy$zk6M&<>CW{q?7SiOo_9FP`}py@Bc=U&E)5_5LAh~Bx0Ye^^Ig2%
zQ{%%nEdR38%QK3?oTnaoFJ{f2uxE$n`>d+D9@c&5(WxKRc!&4-eumrjnvvmaD1<E)
z?UX!qD7?j>W(nWIPEOU5{8-reY~qgP-@?wL$69w=PIh{3dh!<RgvRvAyA3-}H9Pag
z@37;G#(WEQ$lPt%Azi;`R);?x9o+B&?0wL0Uf%(*m$~lym&#%9kn!7tt6}fvf@L@E
z!`|+pJx12R-W!)={c2#Z)a$$3_hIkgE#Jf%*uy9hSOa@xcTSOCME^r=z9zd3dIWw<
zcAs-7?DjqEzVBozS_8Z3^?iS=f!!pB?$^ogw0`v}$gW%KV?WlwZkKn~T_?L#jbs<q
z_|sh2h574WHXajkchHr~WdB~-@-nhN+wxls+4nd-c@^3B{v!S!+5e_+$bGW!?0E_4
zk>LZcB;O<ZWy=%qlYOdpvQM=}_Q7+X?1Sgtlc!ciyz%=FSBdB7j4w_Q&&(F{Q8h(j
zXI@D~N$v?N?eihI6n4SoYb?FPTgHEi<;ZZ)i+gK`XJvzLYKW)DbDz}^57jR5pq<nZ
z4_ZkL@zm6m)TDj>d4%0-%_@j5s@*Rl-^%S<M857VSBiW`O}9n9**ouud~09*L*z5`
zLq7N-zd%0tP8>i!_^1^S9~!5~*XR2`L_V|vk*}uaPTQpQ`pAawwi0=-45|`&f7tMr
z$a~g>TFjm>w|LM%r^|D+^bTJ-m6jvJ0~4?S@A{Qkg7@fjEWt~yg?Q1ZMc$uh)rh=k
zEh6ulH8mn{&D@$xQ)5FS4+VLM{C}*M_(L7Hi~RptB=Kkb0=wYX-J+#;c*L)?92s6l
z`QVSDeDJTNeDG7NB7SrRk^ds{shrWOME--fB>un~5`WG0npao0oEZ6GgyculEs`Ij
zn@E26ua^Aijn+hd{3I^D!`F+;k>RnlgdacC5`Ju^CH$b)M}D9aiGCDgNq(U9iGJL^
zFZr?izU0T)`;s3u_rrc%Ykn=VUX<j|McJPx+$4XdkUOZC6QCh~eh`=5;b+C=$ncZ2
zgg+N)34hMf68=ytC4bQQM1TH^CHaF^D*A(bv0l#CNdBCvk^K3oM)K!;&C)i9_kI)U
zEBkd@_G_B#*YmPpXoU#Z!_esvyu<H`%aP$?KKv5%;g^^XzbK#lqI|J`V@ZBdKJ^Ra
zi+%wwwio1!^@YwXmeXC?uRAq??QczRiRvu-cSrUQqp8@QMEBP034>XL>tW&o{z*%D
zyoP^b8vcn(_(x0fkCyWIAo@pX@(&BCJ<I+fE&7K_5dEu>{i~7vtC?FKGW}3QRLv`=
z7mNs+8dY;-;JAqgwno+TTAqAy<o8iwi+2^Ye!FS(pz9aDx!AIQ^zyF<*ne4B82wwn
z?~mxa?26vG?#%S4f~(QX^uC=tE;7Xg83NwF`Bp-VuIT>7NoSspnb){&*GrG=kMTV9
z(;wyjH)F0WUf+Gxqa7?h#SROvFG;dA%eLFKYxfGv+G7^4A6`FdG0ZxB^`+ALmiYsY
z<fTLg_PJo1{^jk)8GTx1j)>ab{N+A7UTxO#t1nLUY29z_&8Ozqi`|%bsH(%5-myQm
zXc_Xy<9V^k>&p)p+<HB>;Hdj=-@J1+w*TxeM}2a=QQwynqblE@VCnlwV8XRc_Otpv
zwtnZkj}-0bn|Jip_5MHp*mr4<PaWnw(W>8?v^gI)Xf?Rs{(I-9o=92H&pi8iw>}?y
z(C^Xgb6HtCEBk$Z%x&RQ-~03rzuRK`l@_D>Z|)s`!9RXk|HcC@j(#-laQ_j>>#7FK
zzTJP~Ze#YVXS>El-#B>j;*~LRO^a`|e&XWlxRz^kH%)2%W!$oqu}@{@83x?E9d^Yq
zD0Dzx_0k^>r)Cf6bEkWQ5AVG;pv8=%WgYgN8t}^M9+v!V^#_i5<>J<(iy{a1I&$ut
z5B#PLbngEA;><s`4SXZ&-0$-|E(~10^5m4)HZ&WwYfs-Mi{j!2HF9fk?VGpf4Qjfk
z(HqBGy*KEwny*VsUaJ_ix@5tH_hUTc=XQPMyLPLF#XoVUa`5%L&&0P{*KI}9|L%`Z
zjW$-l*z{KXjA3@~=^pDiIBVFUM&B1C4?fZ{Xn2cND+f;xKCt!t-eZHa4vhTFxtTEJ
zNR{75&$bF0(tY~}6Z5<>ha4Hz!Li|lSB7|;-jjaiwXcSF5A-eBu*hNPwv=DDFW&y>
zQ0Lhres11n^3Z{aZ(V-8`i-Hf@19Pb^4qzgt#gk&?)X9Dgm!V=cP+~3li>HtQ?G50
zoSiW1(8_ji^?fHH@#gJp_p?7GOrEs+nKmmthF!9}+w8`7gNME9o_zNDkpB$(v`xWR
zTQ7Y$?9nEj(mu<r8rI-+aPRxa+YN6t@X6!7!yg;|nd^yH+B+;CesAR`ea!tn9^Sjh
z?ooT!{xN*4Pm|rZUNw)H`*ZX5lRr%xasKkU>kaR%8L?=`!CM_3EgkX8<AIZR4ls@!
zA1o~MOzA%I<4ECV=AN99A9g4Vz3|nBksX89fAa0o(<6f-VhbAGX)tQPZ<mUziBY4f
z@~Str3o01(*3zjByGCpub-cx!nfoqZ7!|hO?eMkNnvWiIw8gDA77ZBf-`adTcG~>W
zb9`onv}*eP=yhElvrGN<+UWUrM@G$d@Oo@R&#o)iJ~RBWMNU2UM0HvG*s7ln5AC=1
zz+=5l?_Ewb{PtMf<{!L*iaI5B?fb>^>jP2}XMPv)VeH)J6Gsnee6{8IPZJ9!_dk*Q
zneh1V`2X4uxF7U**2U*z%X^Q1{LuEtyKEb~{_*^lyFy14o_xG<$_4w0>m8riI%|MW
zv@!gNZ@x?JGR!XjiO(AEDR|R<%M)`(TxvEf_WToXzYy;iyrfCe=)D)G&(DobnpE+)
z`-a7Hk{)@t$MqkZznfH<<T&B{xl2jc-v2CS#MiBpZw`57(eO<}l6O4vl;5_2Poa1C
z_88%{FIm58RMFJnUy~2s&1rY?VEdFCcRurbdU9e)!R)Yo!AF;;e3Q7eb5xH{Qk;X{
z{r#(>cT%1bN@o;3?w`6vC|dL5&h*r;gdc0#c)gTbWV)U-^j2x=rps4DHV4>^`Qo)7
zV}{J_G3LO6w<oMvnmfjS+)I{%cQ=l?7alosc=?$zFK2Z4J-D-L+9wBZ<VS@>r%ij;
zJj5+#dK#{3jve*F+iAfr-O7L8_d{CL(x}r@-f~ZGGC5)3SEmQ2UpsQswW!aN>6dQ%
zH%)J`J3Xaf&ghTY{*vCyd1>`GUwMsn`Qn}TjxQWBcImvNi#6kyjJ;j_;V<V?4~`94
zH~#9XJHL%x5N-G4><>DR`>LP!+t1!i8Mm<YwbAcPdSTpEpEs)7G&nx4@id1KUoF&S
zoLc#5XNQX5jQTz9g?ySmAtN^We(K9@U(Fc(^}ag`#(kYp-0!U!;|@4wZXdX9Tlwzr
z%+aZ*PPt#o&#dh6dHwUIH#5J9UZ1fjp*+)N_|eGinQr5kPMGmki=w{c^Xx~(ntq%+
zzTU==E<xAd9q+hgL8z|c^7y#Q*Z*^%UE2v=hx^`KJ#FZO4<`ip&mFdK!khMU@BMfD
zM-w`x<vj73{>Fsh-p<|T9C{>czRR<R9^d(RR@srz7e83`T-L|8KMB7QbR;Wecl9!F
z{k<%&$uIR7?inz#Vo>C<ty{)U{OO11K5Uk-c4E#KJ%gX!SvJx6;4=qzc-m(_o7W|<
z&6_>5*NnS+en`Jb*>mUJS#@dcrtI@6f6VqYewW>8_TFDsUU1Esx^_ax9<5?>Rz7LJ
z%OQ0}POrv3lVWBU=X};|;^!}{y_hp6@o3@RLoIT@>^{46Sj+g_$c1a8D@;YXL*G2q
zw0(y?xtCW4y_7TgdTyh0!hv?1y(bNGi}3II+{j52MlHYh!F$h6x^Qa7e}e)JP5N$0
zi)IJ!|2}C*)hjRM-S3k3)o)R+)+<TPTX=Kj)5o$`<-O_uN5#y3pXWIx&6>Pqpnme_
zQy(ieU+6ZuFd@&l@5QXirTIs^-Yb7~vT?}ttv`(XX7Ym9N4(&1-8sL>(cjKZni7%k
zJ|lnF7bm9Vzr4Ea>byQ%^T*U24A|lFeSXi9$#c&QYC6T~?fCO2H}sn_cH(o+>8}?~
z+3zrI;QcRmPO1FV?ZQ37)hXZHk9%uQq-pA+N7s*RGc;kU-@v24{5bCEsUM`w7=Qji
z$yB%5i(l(>=El@fYr8I*`lau*+$ZmJNiZZ$Yag(0ty}7fX>ZTDc4$qHqthOH`BG4L
z-}}>UA9VFR`g1_R`!^Cg^w=`4V3YaHcNeZ$S1|60e!0Q3P88^VOFSOgs^0W@f%$Wr
zT<A63ynb`nxcYh1dmnwS=PS!zpB^`3n$wY>v(t07Ju~+1`bIMrjp$O?)6p^``>oLA
zXBN$zk)Gu}t6Rv98FTt{Ze?8X<BTUp{q7m_Q_Gp(uIdq7@n!tXvffYYe=;nX8MCC*
zljoy9nAtz{&JO1Zl{25PpYie+3w&n%_LRFN@{LimZYO*>;c16uvqC!_`eduq;aQ*D
zoV<H@{oAvutCo%37T<Mt&s8n=Pk3(3Y{%Z7#rD%y&yHK%A@S(SFJ`~}`<m|eJPdPQ
znj$Rhbuna)eueO6|8o=PeE(Q@zd>)lHs?%UsmBiqr{*kMYP{I0WBs`woSC0JxJTq%
z-(}vP{&;li+`#;8z1q&)HusgI6$@@0|9&p!Q3%)P{$Kx=nggz7&^t18jS8>NiSOIs
zlC=1~6ul=%*BI&RUvv+c@>?UeL2Qd?Li9wWd|cKNzdzgo%Z`Zjz7yrsvtRUFbSNS{
z&&-}x4##=~VkBY|Vl*P*2O-8I4n`b;I24icM<LSlJ&z&MGd_<aQvMi3y0(^%I2Lgn
zBIRcyjz^q;NYArOM5O#2#9YKlh<S*U5h;HP;#9<Ghy{q#5h<S@)1~KPW+To)q>De4
zKM!#};**GU-FE>Z<v)eE5b<fmXAl=5QvMReXA$XLj%A3;5h;HK;!4El5nn)Dg-H2p
z5MM-m32`mrIz-BU1#vy%tB9{5Za}2`O^B}}zJW;3@N7Y({H=)F5Z^-Fj`%hr<?leG
z`_=Cv?nK;$Ncrz0?nc~$_yOXFh?Kt%@gu|%#Qlf|5Gnr<;$g&(5kEnsyrYQ65I>dE
z$Fckz@e4U!ie(w%3B<1uPa@KO-yohsJdJn;@moa7KZ|${@xO@Y5z7%N{{rF<h!+um
zMEnVn@-HJ^LA;7sfk=5jBmRPT9kCLT@_t3Ufp`<~79!>Sj#!O&8}ScB%DXEsYviR4
znUrskm-N5gDP2!qI#QyJK;Hv=CzJ;m_yo2(2oqG>9fV#;lb=#>U@PL%AogBsmH}Tx
zyc1$gtN-&lJtN;(IHB6!SlEIz^$RI9W-H>-pxkMYvg!Za7OM7duEDp^q+1IkRQT2c
z{sV{DE+t@VAzLm2BQkV&BPthqY28sy(*V*4>rQey5b63@XLzhC!61%KN)md#1UnVK
zmvtl73>dw(!JaidBBUd|SIKxpS)&#D{vaO=_)=sS)&8CN&A^+5TPl9DW_y4p-Ay>I
z!gmukAiY~b(Wq(-261%d(>;Y5s{MOfH)4(cukB#f_He-$Y3i3!2xlwe(jbn~)+_`5
z?{JOEg&6BbtQmy9!t1K?=&RY@Uy~jrB&qO&gh!C3elLYVY(-oe#G`{X%OE5O*HwBF
ztQ)arz|rFq)%H=sI;5#zOJNjS5tjz>C}Yhs;46grs{Nm^Zp4}aN1^_z?PCNlq^*+1
zXz=Npbf$1yRi2re?GrTV9AUlHIJV^oqmZ^{<!JDeH0ddVrxlECQ-mw<*V-!SXlM-v
z@u<kBXA1jOdS?o&kPcEHbkwv4gLw4h)ANLE)&BE@7#06KD;R4A@hEG}GT<odq1yi`
z;Redj%1=jOYcPmMV?Mn^cu}Q)i7-@EeoL%itQnLyFr{n*j@qqM`>zmwfIoEHlL8&p
zt-&B3-TCwy;RBWbYpffwW)P41)+_^#`pZ@LSA-0tt@TB-0&6gcvjaZ8NeENzze#9@
zw1aY-+GGV|%^=PqtXT%kB7Ro2&#l5r=(qCIEW;WM;%tLY?+^y4%4>(vRJA|NMy$ag
z&Pw?7`@%Vu|L+SskzT0y|GpKBHT)NPO?scONVWeyAr<K$Wq+F8SOdP+YfWIyfLTs=
z)&7Sx+m8yas_oX6KtO|VT)3nvKbjF)g8?J&v#Rnb75X4;J&IUIX4=aj&YbxDzrmxe
z)-=tePQf4R{@?H$vHxjJ`mC^B<^Ne>0n(e5^0AJ@w4*_siCIk;FcV8u?SDZCRP9eQ
zHES@4Gd4bbS^3}GQZCKltigcU+xM#S`&n2Bz1H?evpZ`rU}hJgDi50JS%X2G_3`Q7
z1xFSBck4#18N?Z(HOqkcNdrs?sCZ~TLf`*wf)z@;;>SzxAS|($(ljP{>8A+&F=eCe
zbfovvX9{0p;zDU@`#j-3)>&}H%62<xdoQee>1PUA_4ss-@Np+T{gluV6D6`I;l~JX
z%H>5Z(Nlj{c(%Q?-395!`ugHrp6~^TUi!wud+o3y2jc&%ql6E~x|e>5P~#(|X&e1t
z`tEI{^j>j$Yhk88R^&h!vdx0HkIe6m%*J{z;YV)?Q;M{g{t@90Hw7a6H26a{Bz$L~
z7wl8IF-5&u80I0RNuQU#o6z5vx3@yr3wwlbDdKwyI!yT}eNn`R3)?Y;qqG}-y!4v{
zlL{XrY-lcRm-zY$lVFJO*Tnq?2_L{oN=x;(RVc+|l+tTOd+!So4f*Xmgd`L^Z4VW<
z?-R~L7^Nlu5`@+!DJ`|1QNn^|QrZlR7alf!sfm={FYbR<aB0eK|3>HtN6B8Xxc!0<
zp|byka5Gri-b1vvM(7`i6$Df(+DDD>|HykA_^66=e|+{OVOicn1Vu#LAleWyZeGAh
zZ4Dt=gCeAgmRj3vNP-)MB!-~D+BP6swARKJD^hK#qQz=8@uk%&4O(s0>TR&vqP1=A
zt-TQF3$(Vz*5CF2{m#qT*^`ry4cOby{m*BgGiPR=`99AxGiT16*>h$lk5TE$o^OgP
zbo)WEBHia(qsQmW!}__w75=^}%)K^@BmXw&Mg7?RX83<3&WB+P!%T#q7hiMpyV_$3
z6@z;Zl;aQhZq)jB%5aA7ELZ;9PE+`kkUqozlK7rqh0$yf-Yag_cvEnl=J-eX{!`=i
z;5y3jkM_NpulUi-!T%TW<f$rLBEx?aKbWn;l`{N}{6>Acz72C->vF_T->T*;rhiL4
zTTQ=9h<3z>?^e$~)3>Q-jOq6X+#$e!uX;9}{%v({4s1tx0gFBz*U1jjht47R)4#)5
zgwZ#!9Z^2@3*&aYj6T9E8UFwdaO@*w{;{gx3Ufk$@o2j;9&Pp_gu@T1xri_dmsta7
zdo1Sw3iDC=XnT*-XXU}=W$FC5W_Z1XAC}Q_9qR<ckEl5b;_XD3c+b)Y-t+W<_Y!@B
z2V<l@$Gh-Q8Bkq>zlQ@{UPSZZ+LrcyU(E$k|7}R8JgFz-J%upk?W7NRQofOQqQ*H{
z&3A?M@F5R<{AI-Xfe=^IhaEVTxUUiixVz~C_f7i1?WJ#U(Z@(TX1j3FmZTke*pY{}
zD*4dI)ggcQhpGC9F&v@3;hpLkE&Q~W2l>5-r~J3*L;ha+Mt-5joulRd2#IicbA`AP
zei)$NqmOdp+)Vg6HOCVEv6?Fh{{)e2e~^PW^Q9b)87W7$OCzU5%fVwNR1sk#=S*FH
zcdK^kwBwIz{`u<q=k<WgO|ae5<(295@??53;+YOn$?Ks)^HnD0;I<`rJ<;VY)ai?o
z=~2WpJq71H%~zG=lQ`QXjL7?#PG6c#mpDjI!MRZLEz^4AI+S{Y4@HsG8;_eo>UW8n
zQwzVK+y9GN-lueWT;2b|KUH(9yq@XuYIJ(78UqDh((!dV{!-nJUe@d8qjKK^3+3?s
z5-@UbaY{Wd*Z4ovI4gC0laBAv@y$AZwff#Nyi3j9v0c7Re6-t4;D=wqJTLuD%++dt
zJ^h~xaTEObtC$0YA9xLOpY(r$wUl%`CFQkhIajH67XBslKsxp3nBCF8P4nS#GlYE8
zcQZHgU!(ocX}?{s|8MMDuk&4}<BfgS>-Zbg+-vyt<n_Sz&+FxA`mm4RYtX(H?eqRd
z`*{DQeUHKqyn+6Q{;$yg=y+<BccYf`B~|ZX)K5Or!>F(G=_7n4eb~+Nq1_L_ckI4d
z=f6c=Z`0pY?PU6|wY^`_*Wqs<3sKZ73ZHrvYoDBXn|OqOo5s6chqvhP9SGYifi|yI
ztDdH@&??sEZD?((;c~BBTowz(RIiy^>@3DxQB|uk54n;1u#nPNDs?z`#(259^dPnm
zvDZ4*{*A3{s%dR#ytKNtshaDFtggPazOlXq`v5ez)YmqwZfI(B3S;34xh{0U9ETTc
z?PCK56cUyqURvEyvH08zS6*3BUAwX(b?b%yRUHPjh9js=-M>MJq^E;x1Bm20y4W>A
z9CDL~Mfq5h*tzCbu3X(B^3}!<rYRzBWy(6}gY0uK#8O>YI=-&3zOA`>`I;3g>RamT
zsvFtFqSbYmVQ-4TGZsdfaYaKLa(HA-cUJ{{0b<vYn&#&E#=0|{3jx~bO&W&VD+~&f
zeupq9RGQ0byUi;(66U!<4#PY*)M1);`jIft4RRRfxuFizytzlhJU7T;nCFH%O!MX(
z3G>__hhd%@>M+eq8E}lWYjJ}dhIwwNk(rk=s4BAdWlFpI92zNoLx;v2xwWk=H4Uw+
z<w$bjWmi_5UR`}vLtSek*?7~eTk1I+%#oGAaFEk13v4Gaa73A?ZyU*Ia`-zK96^z3
zl;n}ORS6&NrXmBaK8&IJa0~kgKQW}cRmlfnb2^1y?9sZ_cyk0#OT#VlBP=wX7Jh_9
zr`wsF;ZfYHYa8ktTN_q1)P9hC$_F7ior3=$<fmKuX>{d>dITMAQ$M02(<$#GDmdMO
zPP0!vQiXlQ#imo>M_hQig`QT|cBG2@2n$W8z>l!#bc;Lv4(&*l`3E66or3=$<fmEs
zC1%1_O{1-lyP~Pt-W5$Pt7=*+hPyZDu#nOyonhe}p0)Ky%-X?`l*PjuxVtQ_J7U@m
zj+BOW1tkNAT+Y+$!bMQF@brNk)lJw25`QGrRTNeX@gG4^_0p)?v2a9f?|(_RG+Oij
zl7?wsABU@D!M|}Gk5IRNVI7Z9!+&udNB@oMc!awB3+s4<8vcvxxUgb~A=dwTUp*q-
z{)KgX7^SDQ9M)*z@cZf!l_Oi?A^+O^U()SgSjPn;ze4_nbsQbJmLGT>k5IRNVI7Z9
z!!-M9*QkHRFek(YW=o@F24+4yrRztgbbZR(AeXMGX{mEwAX&4ruHnj6O?3)6jcdkb
zn+7;!bN0@bhFty91l~}=TVi-`tYU3d?J$dF@T?<~UsOo>myJZel@+h^wAL&a`K#Bi
zl75;^q^Q8-X^{W-txhzxv|<DE<iq0-4~BesY?!5ZBn75%Egea*A6yX+aj*YiiujNM
zKbRsuq}VizSYMiW_fx;>RS-?K+qD(u{l;N7(P5*dQ8>fKJd&1Qc0?_=(T<emHfEZZ
zWAs|RvgxY&mg?nAYZ~jS8&);1OjbH)<xa0&u(D?L>W13+D=)2TTG>#$wxa6XwHFjs
zuVpIQN<$t0iELe4fpGE4`qir!UReQ$Nv;b{uU=YEeg3&i3#-pxS_~>e|CWZ)|9a)p
zExiJ(?2^TX@?qiFg;9OM9R5%iQI^Rtuc3m&!&gN;tS79~S77Pn>V_35MqG@yOsms<
zJ9>y-X^#8t=!y$huC1u9sJLKmwfdoS(rO|9PHLywcDz)-Y(ynK#E`<P#4j6I;%Ta0
z%*JB1l-gQc?$vnt9Y5K^Rr5}x`ME}<9)HaY^NJY`P#QhZFyMxI6}td8tQCcL6VCMp
z_n`KTyvRKMl^I!)4GJ`J-8}x28JTWgK!+;-I*;=A!Wqs!*k=4Ow|arzbhf&#;ZnTo
zIK1tc3+Ggy?f$H!8qXWJY2u?2+-aAz)HO8Lw5+XOrlJoYw(f(0g|_IjoAGH3K9M<+
z%6g(=8ZM2-S1<=}i<-}P_*GM~r@}yqgO<U*++o`34UMh!m-5RW>?ypuwWhIk;qpbx
zqZrT(v&nvN;?wB2J~$<Yv0J>kN-#ETZn_FX#G+yDa&9uhSC^If7_CCgY|Wp029I;(
zu^7j?{33Z?D31m5C=YW>BqNS>`Ni@a%TVFGP#z29Q6A==E*a&q7)Kz=^FnznkVko#
zJC})b<gpmX*8C!QER@FrdBmYEf9@QKD38TB0#P0d<*`5>aey(!5)sGN{9<`5lE*@M
zEKu<hu}C7~2xH{2NX8V(V}U#tiG2A*QoanGUML0N2$kh|u{;*Zm_m78P-wEKNai@b
zK+3}rr7X{j<*`V{6w31gd0t>L<3zUyOrR9xOP154Qap|jFVBnRu}B^Z<*`5>`LW|L
z-B};Pca;|J^Z54o`~0X^JA8I2T@*|_&(vXlM`=5LM@tt1o|`YMlH}2^&x7C_jq_3+
zK7enh`3>uMe&-3Fcntpt-=rg|8K105SBfL!jm}0cH-xeA`YpT+@Eg4K$T$&U<F?@g
z(J2T}E<Z0OA88zvmUd``D-p+UhmA9GpMX%x6~?eL)%uOZqn<`?K;!u}-!i0+HDH>L
z!3KaKsd>HTtJ65dqBC;qU2>}+Hw)>MJ4W*{&qh^#PQ9&k$u(+kaFt&ic+5|{aTeYJ
zSADc;{m4US^gGLim$2|AXg=b*>*Fb_KE9**i1|1OqC}=vxE+BugpD(D>kwhrM>FI`
z5Jx+*;ggSY9|RH4)JH!8UiC3a@j3MognZ^F7M+pHvbW`SSoMMB0vx&T&eV1=Gu&9<
zF|To^J{|`j@k({VR;&DuL7cJU&l=C<n}!oFJ3gcMoa-nTe6)jDbi|{(3VgQQ?Uo%=
zkxo9ZdVAHXH<m5=NJZ0A>n#eoPa)no^3Z(=YhBpo_c-LT8)Lm8$&out<C%K<!yxwV
zpC;ux^@feGq~64$GjjKU&z8Fva?N!V(R{Rbtm`^r2gH8EIKWF6a<%(@;4we#m;s-1
z8UE=>T0flAO#vR`$wO!K`w95$`Vb#U;?2~2%;&z2{$SO|!<vtnzdbRvJ|d9YgLvbN
z+%v#umrDq8O?{y2cI<df<C*&4x;I|!?=~2QB5>;CJ@8R)V$m77Uj?5nw*+!ceZV9~
z?iH&1oPI3`0I&L3<to2QtNdnLcu`k<OamVEBM+U?Z?+4s%EHUne9SkuK$kN!!_5SM
z=`$Gi^8oid6sldn%Pc&WH|0t_G@i*<f&{N}-h@oDoCywB4nF2579H{EI$Uz&Ryh|T
z-N<#ftKccg`z6;-As=apy55}rc@ZL?N4#<5p}X(6)cS3P+!Dm|`j`u!eAKr><C%6f
zDZ|^|QNXj?RRny@Pb@kkH{g=H-Lm%#&BuJ-D@?7oT;Q?aGtQL%!{D>)?QyH#F!XTj
zs8x7Qzgw>LBM+U?uiAyT)5624gXgY~X;ytaq4|jU&m3)sR(KKQzJ++>jNA*sXJ2p6
zLzt<LQZSQ`<#JHtnfi!kde_Gzk<|J)6MW2H3ZgS|ABv>P6(3Dr=L<9+^G#Ld=UnII
z!1Jn)qg~~f1w7_wyQ;A8exj};r#|9ZKl0ES{eA>KyMCuwcxP)q;@^oIC`35=C4iTW
zuyLlnECip87qRdbg4vYwS2do=cMb5ouJd<~*5#}PZPa!Ui_X~bH}KhVbFFe-r1@xv
zyImDq?P`bSBj)8Od}*&%umf`cfOzAK+~<x>t=|&JtppS6V+nj?Z;i$??dqCQ-u9jd
zJY;q59~;3(y@^F<<euP?+iux=zUE`T*KxD3>#YNLUhV2N@Y&_pVb$AG3-3CG=d`N_
zw0`8FGy1J_;cd3?F4BBn^|8pRj~{71VjdGot&c|`*XuduiW5@nW2;pkpRnYP(|D#n
zo`o`A?eAyPQ|qG#eAJs*bjIGFf{*2AZg_hkHw!_wgG)3Y^L^M=AG;ChRUfCj%C8@I
z%ul>eTX=iab>!5?+h8IedFYIOzjIxe;;bZIT=OxX`}(M}>f_s*kC-!ItZY~M`gjkS
zF$8p+k^36r?Q#i0t|^yVaFdU6r)oS?A0-HT)yIushFs_RC<h<&6N}Esz1}5viY0f2
z=3_p$z1LXweoONavqH&D-uEFFU9sa#KlXRDOC&k%AlH)HfM{dyhc%wDw;h?h?7bg&
zw!Jrjk9re}&e;2Hm)sId?n=$)W$z}--g`73F;^(Lj=h^8*Q<VyamlTOTr^$TPMa*b
zmuNg=FV|o6viBwQv$nl&YI})AXY73*d`NQ2Id0k8qWQe+eZaDJtL7u-7nEGb-nRg5
z&;1y=B`&$mmfSU#+|Oz}WABu(x4nPFc*VANCiti~vFME4KJeN0wp()BG@qBf&sz3w
z(|p9-uH-uQ&W2pC`u&7UZiiLBpRweAL*p5H6NA`0Uhz5CZ>zSKSainTuuJZC%ihmv
zJ}-OUwCuf0^AYm}98k`Vz1KjlSN&cMKD(SBx8$y~<aTR3V{hjm_MWEr9DASA_7aN@
z$<m$TlKZ?RcZ25hviEJv-g`A4F}o3O+xsl!de!fx;Ir-BZPo7=EV++qJYz2>-@LBh
zqZFTG?^y6rZ(`9IdnbU;mV3am_eRa<W$)P8$^PX5%}31V@>1=c1i7V%H_pgi1wLCY
znM{9$W%{Ikl>4N{Gxjb8o|nDHDn7^FxVD#AbVlxEm)t3($@^f3=JT?5re*K<H6Jl6
za#QV1KyDA>jWcpz{7|aBxur?DUj;MyDEGq}&)8c6W4-LX0C;Fuj=kkzVt!)L8M#Yb
za!X2+a=)hen9qIxJ=3!H1<gmyKg~(CcM;^yL%eb3{#y?|yM8N6lX7ndv$6Lrjc4rL
z2t528XYA-jCt=&W2~5<RSagQ(P4L-rmz5^v-l6%t>|HuL+5Ud2`G`3I^=V(fcR;RJ
zf7KOEm79QE%HcTin;MVd42@^(?ExNsjx%<A9C)_9Z-R;WiA87lE^x_hE=}5N`du%3
zSI$n_`vZ+f%<Z#M?R^V!C$RvuGjdM_pIy%Fr9wo&LwoOmPd>{1hQ>4Y_G9AS%iizh
zrrH}EuksU%&d7Zje74-JrAd3YYd*?#x91I(y+71^#C#NkV47#<`Nu-8SN%r8XUpv@
zP1f)I8jo_nqw$QrrNHyDw{t?Oy^FNH#G*6yJ^(&j?&GCNdmq$%UiRK$*}GHo5%a@J
zu4C`gLF|1B@wVLOOOy6?X*|j;(0In)jmYO^?|j6goSpt^6T-|-EIMQFM_h7yN|W|J
zs`<R^eblnITk{d~MYK1&e(wN2*NivL$Xy6N+uq(%wZ=8uv+3_Ccc;cP_LiW&z3hDn
zk+!|%;A4Jb(HXhVgU^;*GCygrxh}ozeaW)-X^ltBPbj%g{Vsys5-4Jvk^3h4AzN-G
z<eK}hnSY_&B^uAzyJ4cYy|t=ebLzJPe9TWQIwQB*B{y!_yHoRd+4~mkorHAO$1crB
z%x@r!pJVT4mwtYv(QN^fZEy4ZWP3LA8<fkr4E!8BwrM-aLuc&ZdfYZ%n}zqB=JT?n
zA9kQhq#dtlK4LD4rrPlU<YFq#amJ1^#pmevtk&;&&1v-eDEMss+AaNF05AEx^b4Ju
z)Ni-uBkwJzrRw(*<gz}DGx~i&@j3eSYW-f)j7Gm}!Ds8Y(bDf_@D8Tm6zFH#>9d-T
zyq`y5p-P-~uorSs1dcOu|2a8TZigke2i!*P8jWY#{giC)cK;dRL9S!(Oz^Q>iA87R
zUgeUz8FI6b&i0Juq8+*J`&QJl_s5!#n3+nhWAALp^|JR1s3g0bw_Eo9!jk(Q_@IjO
z|MVq;*gID7Irb*By~Lt3_J&+?J1u)(*L+^>uhO#DTt~#b^{CYPZHC;PR9HJBcM|w)
zdv`+aGVrjR--J&-%Kf6oGxZyVzN`=94Bl;!gRG9drQl<JV$m7CuY%8(JEbgHzrWRd
zUiQW<dw-(&h{<+D^US!U5^_5kp`DTYZM1V+ZZ71q9njwYf=@omovQJSz5QrE=-M4;
z@bZCY+Z)7n!2HCbGkke2xyvkjf3Nwx>}`X+Fh%NT+5s^;{i*hjh1_X~Hx9|tJ%AJ2
z-h?H0FF1_7GZdavZ@JnI^3WMOrn~UkfJePqe)}|^mmN1*cKllN5%V#`vzko3MIpBY
zVdIS4F7VlQv_ozLOqBaa_{NTN6`o^9Lfb(eI)it%3va7s$DcKymmOP?&(w#xK8X2?
z{8T%dA$K|jYKLNz?j_A<+EoYmyxP@d#pl>@hqmJ{8pqf%5qx&JY=<4DpL`p<rd-_p
z<fE1yztMc;<+#wUk8O}!sb$hLc6>+k89V+kh#lh;pJPYAw&NX*Y3vvcKHHAREj!)?
z?_hR34?9fz+phV@d)HiLhtZEO(mbza(xZ)ZYth(vUMNH00pD@@oF3Ci?(*xg<i3b>
z$|Nl)Qv60P|G$`tc;k#*H{Naw?<FuByatyYA>7P!4VdO*(2dt?;k~B$h#4(T)h`OX
z_XwaJdFb4Ddo8?QAl>M<-evFXW7S?f5=8Uy+>Lj@!h1vW5%YSNe!als9!SQquIb!(
z{TAM@kZ$yQ-KAgu2^ee0h9+TT+u_;b0Lo?2`%O4)XZZP9JSLr~x4Gm)v>7{)&&)B9
zn`xwPYd*%&U7DwSb2NCL1|NRSCZ2p}ngD#mcQ)pw%(W+zaorynr_#TH2-?f*zBbX)
z)Yz2YbXr8YsP^fpb9J0sTr5+HPM@nzBJuF&D;C9kJ|mIXxsH6w42F3W8K@$-T=Z`~
z(fwHFL&4aj%C>Tm5Q#vC?>-TE|DFGNfBO@^?(<bGdHd=s7#efV)5kpbPrvWkKH&>&
z9=&jF`RK&x#JaLjclQpalSCqjc%GG(O%RJ9VFqYCX#Q=!b)B7KHsI88?T<CZdVnTQ
z^q<2#?K?y_^U;Mi+}7?tXWc*j**p70cJtXLzO%El{kKxzY)fCC)OREG^^H0A#bb8<
zGms5Evs3l_t%siC#VsE$hrCoh$ED~ge6=f^YA?sG8m+AjtLk$XELyVQ-0Jfy<}X^h
z@Vtsy5$=vqUnjhn&Rep0$<if@7cOwP{ts{V&Q^yZmTYh6GKX~BpSp()-f;o(6v9ib
zaG!3*Cn3%!pMac1<jzP2aK`<tA56guiTe<q<Zzi@M@0m1$KIC0KURDb;js>X@{Cad
zF+pre;h!LGMVM_|xe4MCgsJPvpn>{g@MyUJ?BRYzG_elE{T<g>odf#;ZNALK@cUK-
z!|%Al_qg(3>k3bXe$0Z~1>}Xqt*-Q$2s547+5WNO0r(7GBEu8JJalq&jLY#)7Jt+E
zRrnZL)?qwj%s_e=1z$!V4I)M#V}>gFXc)`j$Dssq>Br#*pc@_cwc}|Xs+Tnop2}E+
z_5FkU%dt)=XC8gvf0RD(E9nEDa)`^eM1L9lfa+F69zZ2NjWqk6G++e_^?^(pU+T<N
z-E=|W>el+2y0zFa2Yp0QW7AcxeRBri>tslTG`^P^5+}{CBa>KbVb`j|vdRNtL{@p=
zaFq~|U)!{56+Yh{?v^*sE;scpEsaenOPZ(+ZjMA*6%?#!X<Ajy8%1?%#Y&Oi*wk8|
zfA-=FPsR6GwU?*fB~o-qT~@`csxs6Ug4`^p6@!JVs#mKrf?-W96%AGAVnLGutAaGu
z)wI^+4~3Vke5*;H(XhH&HSytn(3b?U>Ma!{y-(u20r8QXF5~mhU5tH&3ZgRD+=Nfy
z7G6+*H7cXkC3S0BurpRu<H9z49XCgwFI?1CPyvcc$8Y`NhWT~ezd{pyc%;7ClAj>)
zYb1P5g)gyq=6v_0K4%*6{Zeaw6usK8-LKJq>n>g9nT<a8HQf(0g8e$(4{*YBGlVae
zvB`tUa*YRHU6M`qy9`Fb$KiV^18~;>pcMY`AnHRr-mP0S9@La>Gmg9`7-!_}MFd!#
z_t3T>%>2eS!}k{AY`Gk7@HRlXw2gesHvuQWbL{1P5VsM>k&kW+PHeoF5N3Yj(I+4M
z&p;7dzh`wk)9A=YcNO?-yjLwe4%-bL=WlHNUP2n}FwWpjQhZLiya@)%G-YV`vcPA{
zebbVQ#}h~Hy*Rh!zJ)OF;l>%fixFYty@iAl#Iam>8zvw1xC2ByQ@^DM7~K%<lnbWu
z$miIx2m$8Tw{(Y(&l$GdX=u-;eu-h^9zcG3G<FRXARhH2k&jfU>dl!SUW$D9InJEB
z@itg^oIf&ne?&a<n0bW@2f=$98OUemGcH2lTt})(WBLosZ$0mRi;<Qy!JXtoyy+as
z=k>f>uk|w!r3l;3;JuC$6iu^9Bj1@O0N?Qa9`QEBO$e~8m~QHW^>dp2fQu(uJLvVi
zJ2yI4vmE+)w_H`U^SnC?(($a>O?CM!X`l0XG`x03*XRVFMsuHN-w|Bsi>T*WzkaUe
zb!hrQKBFFZEb!2I{lPD7=nTeYI8UUZwed%ej!ix1xXN*{uBof{V_f=1N9@>hj*UfQ
z;zXkRI>bLi@j!3W0a5Df$gZ4~@OSvW6Nxb`)YX_faaUmT1m_vs-yQ7yRDbY`2jmlM
z*wKnl;mjer#oYR5->-Z5`1fDf@?k#HUJpGvKAs7RfEMui`~IwUoI1|vJ}%ZS<z~ub
z<r6{qG#!+oXe>wilp-bN<RxZZF)KblMtyedJy42Rl%^NHU^&W?R%PuD;~Vw52Hu{l
zudHcl;7S7X=3Rx&m*z!Qt-$~<f{{~%gK9oo4`7Xu(|PnBkUVc5hXZwzYj}8)zuHFq
zKm4dJuR%Uqah`M<i2WX~%M(BmP!4DYXeh^L_;=XhIu5;p<pN@qcq1i!l$FXpWQ=$z
zC4G$e3Bqi%%8e2Kr8|&Q5P^vz@mr+xoO&{BJ3gcHTj8XeARa|{qZ2Vf>_Ye)gbP5-
z|3ifN{wJT?2jbax3F<pZJd}dZC()z}r2KnL{;A?SDf}$)qzk}`ds5PARni5Z-#-v!
zz3?8wIRc+m#OymiosvFEthG8^reBGBAoI@#W&6j-|D13t9n;si@b=+GNdE1hZ2tuD
z5m)-{F8l+o@F_0-U!t=l9?Lx2KS`XyfOeEW1^F4pK6QqFsyNBckF-@Tetwge<Uc{q
z!Du*nudlK5BjG$(n7q?5A5F)(2D<6`&w@PgvVRZbV&Hf$jGK2v`)rc|lua&uU1yx5
z;8-{u(Q_L)>ZTZ;q4#n}{`E|U&#`O#L^bB2zZKyC23OnYbKnA(2jQ&eJPd3&4ho}D
z@;(_pS$(Gw#{6-FVJJa8!n0Jpk}s<HV(_Qu;Q*J10+x6HK~ak7yl~+1Fn1!uY!nQ0
z(k|VdRSQZ6_Q?fNblD9n)>hZ7bnhNK_$<h9fzp_o84|Lov3}SyG{XQI>Up{V`@G`$
z9MeNsrmhyNvhWEU!iUVm1z=PjJi)K2ZCy}c)E!s?=U&iSSWvxaVcCMJs_OY=3#%8;
zKd<6~s`(2l5beNlr5m}|R%^>bxq?hGNlK`wD8kgXv(StYXI5hUz=X(2oMvq-TT}J&
z7HmLKTeI4l+et~6_h{atMM|`c8Rovn&LohWj=_G}msiWlpA^8=4VO0744k{EzPRx!
zY+sD&5X|Jrtlo1r1`FFUuhxa{D2$SJ;)ZGm>CNq=H=~kX<0vSA9as#9YYVkhRAFvq
znA0VPEoP|lk&6V`*Gb`=Wam>|(`s6OeOm)IH)pf==&)qM968$5b3g;Hu|Y2}FTi3p
z#ftMOu3$}L!xd}ldF5Zu%T9|K_GHuH!KY!zPz5I~@hZ3@Vc`cMSlNwb$qv2t{RbgF
z%^75`I%dPJQ<Ix@@^R!4%?UMO<|XYZ(8XA=6aP(EbFf%FY|b#IL@_U_CPjxkEBfzl
zL>f)v-`o^T0b}VeEOsRqsj?=BlPhSsXNuK=S%WWmmCls$cQHQ3&vBJ_oO{oDe$m5e
zu^NL*o^wo3H`sjf+emZsalC3A$Eb7%KonC7qT{*<7>cX0IDF<|_*)?0IrD^^b7Z{H
z*<jy^I2(`ORT?}D=^eafIJfmH)oJjgGx{w>$i^$R@c6`Q^dq*dUpc~*Yo3aYew1nB
zRa$tAH+anewDntrG(Dupnc}0r5_~pZ74UKqPZ|R<c%u}aQ+{noqkiO}Gx`Nwcx{$`
z_I&YM$ZYG^4vg&t($3&b2A{28JMb#OlMAxvi{Ahr@l3hrBEaV);|$(8C{QFhb`&Fk
ztOMqYW8kyp^1EI>lTxmkpJcvWh^Jh5(w&I_pJ$CT`YZ;6jkg=&QZNy363CSEPc)v%
zw-I<=cKpm$ADgrt#G*6y{?t_;Q(%{|gYRJ&xqT35&uEn3!XOs)J6ZFQHyeD?UacU%
z9f8V@GkTB53GFo%k_)*kFXC~g!^piG`SEk!AKZoj`OIvHvE!SFxACGD9_OeGp4*N^
zmL0P+A9)LL0HpI?>H`RP*^v)ETW*OZmoqX(?$eM12*-{`5uhDr)`om^JHTh-m0EZ?
zNH=(U!2}3rp8qKXwjyjC(@4*-KCF5EOH2i5M)J^gkPm)ThVb7E!r#>A^bFo)WrvgU
z&q45BK|ENS4I}xy=J_83lMN9^xCarGHw8p{*&a_TEX3@7(j97^zo4kFL~$Q_o<A2d
z;hcH?agg5gm>=)8an?E#>)B!6L36#^HNUa0rKzDVl3Ng+Gp8_GSTZ}Zyk<3Kj++`I
zEyX3LpI&@=-K<FM%9_SYBiJEvHKwa01*hjn^9v)niPqNU)$>j}twv$wU)t1kDVD=+
zTGLWn&zBQUYi(*;iG30q8c$of^2$}GHn%igR$tp1sXJpu$r&q(>k8)1om*5lCt6Tg
zKc_Z&M)4VQRunBSiq_ZG7u6LO%`KcI=6@JQ)zsH4ZxB9CSuQBdkDehi!=vVhe53v0
zz*ygSF~OJRo9NFDPV!9_#{{PMj`dCT&+wgWS_O+`pyS-_r70|`01YSKuX+#xvT%Az
z&OMq$_^i+0f$Vf%Tl{vO&UufAu;zJKKI7M6N0FAMwMS&asl3oVS&`P$n#z8d<3kBD
z<ddq$^HaH;)JgL#7T233?l(LzFf>=btb!pAA4kR6HO{_=>sA_PPN(36=ceB*HVoP~
zecpD2-F$jlQ*xUAp&B9fjioXc^PkAXK9u)A>SOxGZ{VDGCSN(uz3!2`hk(zy*H<A-
zJY$>D53h%%$mP9&ZJ3y}&B*-_;_becV?f(cC%Wn6gKtWld|rL+*_w}e=-yGDb2NCT
z;{-Z4n*{QC^|jUDGi5?vj%}EUIJAL8yXxwfuemh&3h^QTQ!Ol<GiR>sY!BVnF8wG3
zSbgn1klu;DcHDWNEzfQ1{_7{dymOSVC-?Zy9pOdSl&k+VMeg5wcK*3a<Qy*|TWjXO
z`=xLwu2S~xDFoO|&|vQfvj_L#ztv#0eTT7~|GldIy)+T&B1c^QYs;Qq;iUHSiZ=w5
zP&5+nmAqRMxm`ZI!@TkAtxjH!GraQu&u@?b$N!9Jhd(BA=GT<Lj*0Q+vy*8ohm1rp
z_Svp@;<~cYJ-LpITqz?s=P!FA^6dACHC>U0>&imlQ5G1EzwS}`MPi-WmelvArHoj(
za%`+k{`;G&|D$bBgu2QTq8AGx!cKMH>%=?NGoT*ZxmWq>|A2R_@63ozmWX@@+}H71
zU%<DqEW0P6u@SDh;kX;Jh?=>7oe<F3m-tqhzb6>&-y<Tv+ee*qb$NCoJ8@%~zuV7$
ztDjW=R*UW`$mTde{YTv1j#I~(|DY-V_{yVW8)1{u;5co=Yj{I^W7%=gq(I)w5uQI<
zYqGRIr?eF%-C5@A*_L>BPi}0!<jIIdVzcDg1M#rN@of%S|EEh0_5bOO&?W(58^m8V
zp8sX{KNfr_Tp65U-jVm;;@j@OkEIc~J;Sj)i2v!^<$v_V;xh!Dc~9WfzTOGzV#SrC
z503R4JN+G_UJOnB*tD+wTPH+c_vQHZ$N7H3`@tObZ@kDoujlptv0KL-435c&z22WC
z)>lmGd81#z?wrIjX`?Ea<%tXXb3{B|fijsC`}3ag!C?5m_aLvt%h-Rtc%d&)mCz;h
zx>cVS_2*QLjf|C8vHqE2YnRBuTld$ki@)AKDa%*z0*-#GeuLdR_Ku&RYL~kH7&fwg
zWAYt?1MN6<9P9VgJ^|fth>3=VhK*%2cD>d=w!L$ING#bG4~DvZGq*|&_jYB*{If^>
zyorA)?ko34wWg&~ugv`$M52aie~KejM9Y20&#KwkFFJPY6=Rex6;gg@yCWPYN`C)@
z^|3S2x^B>|E7);{ZWUYhjuNK)=j!tJeNELshLkLFm$AG%0}o`z-slgCYb%cJ`BlGY
zfBc}BFtKNMe=tk+W2(LF?hi#!p5pobkcjo?w0Fez?HPl*`_DbVkalM7zfQc^C*r<u
z__r^V65i+&A6uwfH0rQwimr>^u7$C@Sm)Wune_&6=c8__ro9N{F<See^&N)4JEIe2
zVb#lC*#BRkToC&JulhL>?V9hutjGH=Gx4^IxqA673`_A<*^kV^)vL+};dS5IAM&Z5
zWLbYs{5M@9QkeKoSw>Gw0&mCU9UXgT*Ti1`@gg_W9ooOn-<-&b#~XYl@tV#=R+nn)
zQCV)uD?9l$itc;#l`Xn&g5B4HP6kClUhk>AiEBF;n^1X~qrJF=dQ<<LhTs`FHS5Zz
zcZa9?j%SQ-bB5E8gu369SG(w*3v6ERUiS{WkDYGyvD0)Jv4>k%cD&Ws3a77STWar`
zkDk`o(~cglr!SB#P7KbQbo@<a!5)9j`TfC#cgNq^GelW9{ctPvV_%nA7M}gFydO-l
zbUivn*NKDb8j-qYN?nakygP)PJ~H+0a0&FeNb8jBdk5EPqNP(pwgQx%Q(Cw)`9cYC
zFyt#s+*S7OF5m5$gUBs~OpXb??nxYLpr*Ug4@t*+e)2vQjLovz`G=f#&N?iz+PO$=
z=OXtJF(Wfpn%Itd>r52JMD9Dgj_dUw4B=r(wsg^z@WsW9U!dg$&lq$3wcsnL`B;DO
zj4h~NwmjA9w<dfgTdlj=;B9{^wBG_st?#UML^&?mKOd+2M@q_#sh%kq%hh+?%C4UN
zQ2U}Mk||T3nACem*OCJwv^7y$F}^3OOT8&3BJ3Hr#xr_KF?M(sxroRS343bu##kLR
z;PZi3pRL9>V`WV%Z4`1zSGycd-I&OUb(|fHaikN_<<GGaUwgnS6rSUpLt(x+0!(vV
zXU4`?PKvSbQ?;aex>9Hx#TaQuY)r$f*k-M7a%84PNKsu5UhQzW_~#xr{=~}3F*BMp
zZ~O)EuA;JJY}Yn9stk2qNB^WuUFPxQI{(prpmemdM0E3cWw2|?Tt6E++hem)TH|$J
z8|cW>X#VZ0Z{Ka*4Kpy(%t&P58fi#$@p|5_S^{_mz2^H8&m{K6pN`LJ@Hgbu_-Yy&
z${H@KnO}nuZ1yb}uZCW@GyV_RkE+mSgiKErNEsvA?_7QdwrvB=1SR{af!7l5g*!rv
zGf<kJD_7U68J$P@#^jTx{qwoitIo3%8*wKLB)*FNo+E2tEEKb!FM9BNF|qQfSn!n5
zKS$qiZrOt1hszgi*f*)Je8KY4zwYs!GP=iqO0Xwz%IIBRY+JuCP<AelGe)<4tkm~U
z@t5`c&M&B3(7vxH+Oy-<zFnX6x?e%Hq22%CIWs;-bE1vUr1<Pu{&&T=3Q!EhN4-iA
z<2HeA1$|A2H^aXj#6I`yprIV+-yY+`rsD$QD+u!%QZ67$^khBRd?~XFoGZ{1Z4P%x
zG^OB$#3F<_7oZ&OGnV7`kF!$v`GlBs0ogm-;fW$Mg@2;>9p0Pc*it$Bp9SiNm&`23
zcO!S|_v}<Ody1qBh-1Z_De3wpJ<SrpTdM6T=_$%U9<R!z3y2)?Pzp<qxCvqQx60*+
zdaZI05kBz^lOTP*duh7>?xGDTcqfY(!n}_u$GdFO1+0=`YyfYqo|uv!FXJJ+!O5au
z&eP$5IMqqvNdT?#*D3ZFh#w%Fw1=%W=>lSoxGjZ$j<_1(HyxHa&KXYv;&fMdp13bX
z-+8X|GhN}c#PuosXNg*b-*dRma?W@X5c6H(3Q?Mpzd{_3aMC_rfk_t-3&lTD>{}>)
ziSSm3WubG%lR(NB6bvsGkEY~bEN(%#+{v}rIaB$oT;U5uYfAnL#NE($qr-K9bEfiN
z=n5|r?J4#y6Q4r3+2LB|oT>a5yTYFm^HTDEN*sgmQitnP&Y8;3nb)KXh~?t#6#bWr
zT?i+8iRDRVoCU-R@n8!73h_mRA9c7^IA=Tw$QhMnR6txV8dLILF7AZBZ4S%j&KXYv
zVwEf0EUr$mw^@7~;Sz@{S#m0Wi<6?lYeaEM{xxD^O8zx2{;OQ!tHqyE^uJpC6yaoh
zx!T2ljVt_lu{|aK=f!m?`9JUCU*`&A{v##-25}qoPqxZrPr{4=`P7?)2#6a*Yl{6h
zh>sz>(_y*6Ipaw{e9;xYS>&hWzgdhyc(%iJvvbCifaq|AH;KI|`t$CYbOF2}{ai}=
zW^ot7iyRi-U6U^0tb(fI0t5Q*Z;A)-G6L_@tRwz^^|eXK{8>0%?+U+<TOj!v&F|wc
z!UGD!Q)GCo_>PMougA-DmO-|EqL?xjCvXwaME@OPAA~SJpChyVM~i;V&v}Au|FPnG
zI?OuE_D>USLB-EDo$b#NTo=|j>dS8#h_@1y?LS%kVvI>u_xX?EmdbSIpW!bMPrLNp
zV%?&N_mC_71zh~hzX_D>KSlf!KErRx@Eq|HZplgc^TZq&!Z7up;omIUXqa}yf8B+D
z-!Y0`=~p3MaiuelaXcrsaSTsJdtlsH9J2jqi3>0UVz?8O?O!PNp`sXGB*TlvU$s1r
zG-miWi58c<AAy<tn<f7R;$c)2!|gJ>OuU<^!k5VKr^Hg!2h&+C+5Y9?WS#!346hKq
zqwM^bi%qB>@|Vi=W^orDPLts^q6GRdtn|HFT!<l4GW>b*@MINUCi8C)5p7S84BsHW
zia(6VAC=*o#r>}OJsE|@bQBBp9V@DIc(x2r6x(&!w8yJ;xJsr^<M2d;*Q$Mf!sy=4
zM40O|lxiPd@_$~`1(HO#O|?a5JqMH#pUK15sQB<_nG5;QmdT%oGJ;sa_=xs7rVQxr
z&{?m6F9N~wn+EAaX{jIbos0<PFQE@PAJySX?ZXp!C~GMXje+$S-k{f!xK8K4UX^12
z*Kje?>C@$*%w;~by_pDyzo7WS8`ZZrVRV~yh>zc>{zITomj~r!z7y2*BIV^Hp84m|
zNB;Ba-=w~w4Sxyy9xx0&+UWxqStKr4r9NPleus{SC-Nd%4u-32=V5fitY7Aj!lyp8
z$I)x1PXDrs4+D(tD}0N#2f|Q<vOFn|@tf%*ejEL-2=OX?;P0mYRW+t0elNm~oDXTe
z@^twkpRAWnsy}9ZC3JpxBJUK<k72K@R~SE+>CjW=gPyW{pwCLiLm%F8h_jVG;vdlQ
zkJE>|H|V20-=+_J`{_g9_uxxCadEJogW3<lcl1YP1;LkBFwAl-OzJJmANrVjZlT=U
z)L4i5wlfU9w$O)OTj5hK%a{6W*FNoW^ucgl>Qkbw=kR9ehV(EVIA!?&r(E+_+WF4V
z`OX}uAE0D8%6fo4>lp?PidM?K2|o2<d!vu4OX~9xjaxc6ZWZ`x=Sup(ZPxi);S;Y-
z`)qHHo%1y=i~)<R*OTc(DTxQ1rJ8@4ov%XYgYhh<>5v<OPdRjX3kT{s5Anopr;mC;
z7U|PY>ir;n$a@q%^?MvX@t)HDP8|<V<So+jm!PjjnAf}1AN|WrhT#{}N1-mJkM>YU
zAJ=^=eClhLhod))4kA4dj}v3b58O%gffuEZd?oP7k19^uyHw}<c$)c8s8Zf12iie7
zlvl3hps17bF46h$nBlg6$b4~~uXbR*nUn`RX&2?P{%I#nOUkX&`7cfOvnP`u*B>rP
zS-<D#@I^X&7k%Kd9$CLT;j@09g-`tFwf~ZihbQt9TF&JzJyD;zNN4@chVRtdO3mNI
z+{oXoeRKvvhVi%&g75#Fsvm#5x)1ult?HNl6sE(UrhR9<qE+>)YMa;MGqMX>vF|#+
zbiooZ%kh;NzPoFxO@Aq)0(>mCvSE2`b8~gwaw0Y~uC8xst!}^vKQ*mbQKm{`noq(8
zf6Hn(Na?(AH5|NjKe|Z4<hI?7SJtd-z_)qz^25au8tV--Vq3l8yiFba3%vm~yP^S~
z+0|C#jYauk(tw&hOsIk89wwl-!NY8SSRTo=<N=0`5MrQ#BLwm`Y`CR`Z-jJB%GIVC
z2AFqPKm(0DEI4mdhgWX+f);(y>iX(|CXNVTplKt5IU*+24yd&>bx{C^ZBkMX1=Ud3
z=6pRj%!)5D?QwufBLWy`(uiOVr<V8`p1J>3*ETh;g=JOej_f`-7}P*Bht~jx)NNoL
z4igl&MblfdMU2!~FPIS<>ILRqtHW#{EIQe9n!2qRVCUf>4K(%e@DAJBy87CddM=a5
z1$GY0S`VbdvepCd@T|qiwXVLUeg&wp79UL<j=h6njojiv5QqA7Kz%blcTFQdA~&Bp
zC=Eu?NxN{&V1AhGGnxC)8W#_(@8BI$aWz+2Mt|G5x)skN#$=;v+8GCy)u0f#g;8`G
zLQ`@KY!}0ql%AFi)s0Pc^=W+i0zK_K>1k@`^u9WWva@ysy4rct)78$IrmiUuN@<j>
zN4_+4_Q-uWdN1JTP(xjv$(F$Hj}F19OY=~isWzm=J=D@R!)R4eb`OX6hHClh)%p30
zs?V!$xwO9S?3GQ+YgVon`K+Rv*4CDW<ydGA;Y(YZ)-;QJGFM-G@epej6;_|UXi3@p
zMb*`ds|$*-a7e|K6$PtOmV}Y3$y8U@w$)TOuW6~TzOtdEbxqB{#bnZ5aEYs_tXk88
zUtx7qOLc8S>)J%k>cqm!7F||USW!{ClK1w@lx<iYc~~o83=eXsc2ZDSUEK(A)y*wf
zZ?6LKy&Lc_Z!#R7tzNTyb!|&Svom06NL_E{Frfxso`(r|SO(+ywx+Jm3{^&E=>Uuo
zo9IR|3#4PhaaGfm^=Rj8)^gFKYM5P*2lJG;n%XPYG_=%<6)p8l7;K%SHC%9gRa2c<
zB_}Kemd3(>!DGp4&t;8<SzU!_nfMrYHKs>v8Zn|+)m+nJ%K3sq*BVAg3UkCIKP+t(
z`tU}6#j<limw=ujxwKarh93f8pe}><*eQ32;?-BxG~@Ad_{&HQo_%0xk5Gq!#thyd
zbh)_7)x9XzNb?WWWKffe`5fz1?ZPT9a^>9MD^SxF6-%oxDCY0{bC*VSi%&xUz|<H3
zCwPQJ2O!tWO3Fy>mj_jJ7&vLv<S@{@d*nmwhno*N<HIy^5Rj2rI0zKYlWY0&q@@W%
zmZcXBK4x*sYXmEtVSJGMUnn`7E~kfLy1l6;Qi1E4zoP14FB>&N@H7fCrROLZw*L5#
zzW59-u~a0Fg*evb7szvYT8u@Qu+EY^7Rm*g3gl5n%#n*T70Y9hJQm`J{PJ8L=FDY8
zu{;*ZV<C>M`33S^p3a%Wh+=sxlE*?Efg;c4=^VK)K(X2#KpqQm1d2S$!yLJ5K(Ra)
zsT~Ax1d2S$!yGIS1zqH^NFEE-l2P&~4|A~F0CbVZB6%!S`wyri^UsM&6nQMd5nC0=
zV}U&Kf9m17Ui`U@*P0x+IS2a>@DEV!@QQ|XlP0Qnn=*B{So_A~f2?%(>URKbzH*f$
zkB09u@Qp@HsZI;wf8Yqtw}Ge+`S^eB9U9M%bGkOrSb3%n2Cq=@IqMQ^Kr-_i+YDd6
zOKvXYW`S=Th&q#x`QC*P+HUN)3Fjy(#~Hl8fzP(1#KI$v!TX-VbM)JaG^Ug24Bo>o
zyh`AaXB#N2`53MmpQ_(>#PR=Y<4k#FgU{Bl%F+*_9Q|S%&*a;QG^QJ8^xN$!=a;}h
zeGISRd(~CWaZBz5@RN`E-gDXUD&l5?j5ByYblK4iJleYrgr@1>{l#SmE79miOoO*U
z@j3OucO0n?vFHq6yG!my%MP{&@-g3AXhe2<nS_8TOC&qzZzw)TF4y~De!fdaXXO3@
ze0IHUhFtP(1K|}pNA6!xn6}&q0(>9DIHSW}#plT7Iu^vkE2h#Jxo?5bmb=xGi&ICg
z-do<eKDb6#mBylH<TkqSwgV&=>9m904CPXfd$k=V-%Y^ts<)`ij?LN*(`6YuX1nC}
zKrV_@%Ec>!j@%Yx0EA=5Rs>2AHqPLkfD^l1dM!J0z)U{ck<fU?j@`iXvZDtb6Ox?z
zcnbmMCl;NN`x5wUxgoq4Y3!J(`IzrPFag4`;|~a|MA$fkcQN>EyeYuT1=BXr$sqC(
zZ=1$5b}Yk*mmOin=h#sPKISJDospaAl3QxoF-!9?-;Z#x?N|xCO$5@;;I)7ckfKz_
zR{?Js&S?i;ZFKB-LgN8OIh3cD9VaP1$Bwb!LzKi~Mk6=JC70hAnEJ@qe9ZR=bR?!P
zVSe^=>@TR_7eK@#or?=!+N%|u1i4=A?`-hVUUOkR4!IEoiB|w37Ui-d0iLsF8rN!L
zJbCEINB17yb+++#1CM;fD*_q3T{ySvV=3_7LY#3153lp3)JHGy;)o+2UZr&Keu8u2
znffRJfLDE-s`#AxC<h<)BNm;J%eG^;gHm(^raoAX<YT@cqocF!ScC-o`Y`%j1wI?E
z3V0FZ-v*ioGI&pEJd^KnBzW1uy<H*KvEy0rQ6FN_5sxm{CAZnK1FwEMawni%Z9BLJ
z67OBc89es0wjJ%jYX{Rd&{-hzQI8CbXYAOW;cZ6+@N7HY0w41ei_XZM?~==nE=+xt
zX+Gw2UmscMug&#wi{>Nd-MHCFd$odpfLyQZ<D1~4y{2JhL2d*=+FJoK_I^U)IoHQb
z4DhHAdFYHC7rOAGz#|{=&enVkp9g)UemJL_4ZKcuDvt)w4?ep-N`PnjtA*e+`Yq6S
zras;To>#ki5*h6J*sJXz7M+p%eVo{GJFNOxr1@yaTT@c)H~>7R8)xvo0zMmWEAVo`
zv<<WvL_XrZq4A6zXO8l=qg?Sh*GDDzn4eg5MsBG~?(>!%AJcryw*!S@*GCobHWNrY
zgLfI2Y&&)XuM#}81F!x%c08i-j2&3M#<M<-Q+$pcZ)-b<MQ7w5<B}Vhp1eLT(tNao
zd(eZ`xu3rWymo|*Gk6~dpKV7Jc*c%pU?v~&?$UV1j%yI<)vmawJmfldYy=<k6N}Es
z<(^u$+&0UOPij8q`zzX!ZAS+pFCmb225&p~Y`l%Y%LUIi(5FDgjy{cN?DzxlyzHn^
ze2yJh#7EjeEIK3iQ!crkmK|};hpb{TgxGdaSueTgAkwyDr-irN!pl^6j(%g2iE_w8
zXY|8oL@9VZz#|{arB3rP9MR<hPr6CKdsd&*GkCAL`k~#xW8D&Oh2|sP(HhT`^X@_H
zy;=2Fjva4lJBUSR<lg9#8^s{p+!q=&ALYJ*c5avRAAr}6c;gJ-b>KsiDAft2z^lYL
z?Z7MJQZDg&G@h|zB_5)^>aAGuId-&xkNJs3XXJ8?TwCr&%Z^6P$9y-BNwuRLc%_Ip
z&ft}R&&Jyfyj(ERj%E<~h_^xG89R0kV#j|Y-oAcc(smGw&dB{Q#M^RrT6V0~e3W~K
z!gKneR}n5nym1Dv(uLP!*@0K@9Xr0F@r)glV3${Y^g}t@jtKau53%Ts+_%AJ+rho+
zO}lE-e9Tvf!G+zfa)GyqK-w9+w~k813q_LkaW#0!N4#8(XY6Pl#Evb%v+Zctb`Xos
z$o-m2ZZwj#<FlHNa+fGPr#?0gV#hx)31F8?De!WUe;erYAY(^`#xr)jI*1+j0nfIh
zSKC1>I%CH@F1d+F(vJ0-k9IsTIki6a0?*uIknG?s2A^$5TSR?_LpwHTKH}Y_@r)g%
zXjES9>TOkT&UL;BOw3O#I%CHH@Y!;=N0N4YLGv-+R5L!sIUT=Q?NO)lXz+IF=eJUw
z_IM=O@7{no@)0jf;~6_<Vjj)Qj+@ML9`evd!N>f>qBC+gy5wf%B<;9K^D*C-@LY%b
zb=p-4@S+GCXYfkFXO~L^co8sd1KkWVc3i9Rj2($V?05$Zkn7Y(tG0t!bVlx9!Dq`Y
zg<Nx;o96}E;eM`|iRTK#w^`#6^N*(9w1U?_E{e)=M(^J#KIeI1lh$vO<}~{K7JSst
zJbzR{KkBm$bSsE_UiuYV&poF6$a|W)-ki16IS*cic;k%RlQbX4V|0H2pI3W%Wuh);
z&DXE(V42Vvy#D~7ZO1aJoVRE`+A#*td8jvMex1wLL=ZO4;Ee*GU2h5Cv0ZHg-2oyW
z@#2t6AI(O(2=ELBBg}b`2Ol179cTDXq`lS}?!>blb*Gz3KKRs$j(p!#r}D@&(hoJC
zN$MU1Zz1?#L$l3yrU}3|a`&QtF>Q>=m1qaNr!(E$x3X|v-&R}S%so5x+QNrg!+mZ+
zfm&8La_Du1FHtsR6jK4*9X<l-+>@27s$n8B_xWyLPAJyCgQ;9o74h9X=lXnH7Yi%G
zIqUd(t!t%tLWxM6h=Z>Q&$Z%$SkEn#$Vsd#%j}Wd5*aJ?V%1`-sq4AMoWkb{Z(L)T
zx#HmN*}?WdxIPj+KG^#73Nr(kT-7iV^Y3(Y?`C~?;hHkrvA4Yx+_H>VUQfw&E=6Q%
zf3TV;<DTHrtf|IxgO|GAF!5B$Djt?O@#v?x|HJEorP%2Ta4oODm<Ju1W_k_9$bC@v
zq@-ieZaMCQ%6XNf!{Ebm0fElZask{yxF<={u_Yv3AmtwyUjLKDODX&qoLDX(|G`N{
zaNknyQId31#WM&`aU#%(T8?XT*^c{~?nudhf}IR~a$Mn=;_(#znc@+Ilc+OY{3pA@
zv&0`#^3QUmpDO+{CH+)a`f09kq4-4#f1$`kN65Yq-6Yo12#6-ru_MgVp9f+(qqF^^
zL=2rN!%XA8t3@vU&j6q4xLqPWOJupy-_`SOGi3T?akd`6uuQVCPwFhB8%G%z>oCtJ
z`sa$r;1i!+YPSCb@toEtBEvJqpERD*Z<dIXS-ULoK8Y}+l>Ae%gsVwaHuXYZMk)M4
zG1{e1Z3_MvahuED%`SVc(cuU%v;8w=IfiqTOlO}~69zBu&Ec6k9kN+`dAO`_%aZ%0
zG9?d8G9Hn%ll!Q0Oy%UmWhT>cdC?B;r^+@S$io3H50Nq*_fR$mrqku2(qudu1M4q*
zqH3#7K3rZh9bojsv(*@AdOmX_KjzkXPoN$$e^jp(aFYIpy+E>wJj{hloa43pLgZmS
z@YCh#xfj32_p@1hzkiDl#m`vNSX;B^(nM>ua}Qsg`Z?RsOaopV<HzT<Yg+KFjRiRX
z(UWDsJ3K>Sc?m8VXv_e~o;>_!{tSH9zN(=S-+S{N__~$mgYN-?7UM0xg1L>@u%x~&
zS!xBvE%oY?dzHes(D^2o`AB8hnFf?Xdh!OU3vG*>%B^m0ZSne$!INd6Dnnp-3La2Q
zp0Wqw@)SP^?_e+Y4Xh~nIYdg;cvYw38lDEp4=miJ=zRAuPz|})i+qQEVA{}MKn&zB
zm)|_tt<B3M#U;OtP;YEEH0o~vldTwUbgrmvTGQC7U*L8=#`9v~W=8ykP`EeQRqz8Z
zMvreSJnIeGpKh)ur{xZ4dMVe}FtaGl3^u<`sA*Z7v`t%W`mcfMvfa4fvh*r!k$;GN
zdAxgMys+tNLp2vvoPX{Gt{2k>=kjc^sh58WqUTkc%8%wf3=JHvVQ64@Rr7aAD^Sw#
z{-AufQoche-<4FaK+3lcd5~`|79?LtERZiDszbUj7+#C90)`KctHYS#9p2ovGsB!P
zZoE7<N$Q!@aH;#U41vkb$1$RD7)nX^9**|B1OJ!h80Jh6_2GS<;a5PwbLO8ab-dA;
ze02W-vhj*7JPySS9`&~MtI}!kq%-<)NMYlhY2oo{#o!U!)^91o)Z0AK82u>I#w)k*
z7;o@Op@6O5B}mHx8E5o63MV$+A`6dCO9pSQ#xwa=B8_7$<BWd$Ak?;la~!n8Jb4+u
z{|1vScPZpjKh_(^j7IJn#M^eXBaLG_<BUEP;Ir}SEIWv6@GjSQCf_EcdD(HS;&a-|
zR`AgdQ-;Ql$u7Ao5jJ*U%H5IsS5&ZV$9AO602ycW`4RYRJFc<t_;hLP=+k&6-%CjI
zvg0<z=h(3ue6+(nsTw=J>XLhtC6{A&BX>S77~76sq)h`EXYeM1&$i<Z3y)8^2Jdu@
zXY6<nX<l~x9t@D{*ugdBXoq=XHgf+He74*NEV&r&J8~bwxot-l0&I828GY6x!p3_F
zc$CX_%BOE*$2~YFp2-(Mz{`$LC_cxI+2A9dd6GAFT!=VZ?z5I1GmvKFax)FeMY42!
z-!r1m=^4B)gU`l$)xw*p`KZTZ8V{ayOM&NQN3G&>?1+Pp`H4km<W{@nzGcb%kmh5)
zy{>kZ0G_$lh-dV9%hj&lw(w?Ic#kVQN53|$A9?7Eevi8Fg6MFm59{|7%_qwR`SEkg
zxgCKS2pebgyAttsIgbTi1Wd%^V<hDg?|$&%=h(&l`n<~d!-~(bqZ47~H#0594(@Yj
z%bg9mrXPxe-^hIfCt!8#cpL$*cK-|T*?4@f$Kc^{*}=P0;W_#}uk|Aj9p%#9?!sGS
zl{4?9<fC2YJu6g;bUnbc+kwGb=<2VQTKdgJPJ>sC6Z`*xUK(#X6TFCgh-X>Rk?))8
zR34c|TCMt1C*|{|;&lvp=xzWWY-m;?{1*#8wgKY|-xq;rLp+5*vue8{0%qDl`%jxQ
zCt|xp{XbArP*9?H4*mbYwmlGF?K^m)->3KY5@T+}{!^z`ij&O_U!yyo?Gr0T^&fxc
zsIR@;myyGLdV(EqbY;aR%l{Mna*wY-$KKet4<7IL-(RYCyosdjI`->6zwbHh&XnD2
z_*ZFuvk#8hXD(NwMzD8Y=@V){F#qN$T|vD^+-PfG5np#C7UoV}de<`1{UD6m0>X5T
z=YBZqKL8Q2|5Naq_y6r<nGa2hg=1z%pujEStN!~=l$r%ncCGrY+_h>3<gv~M!{VM;
z;zYCK-L5|2f4WZ;z1k;^LfQIX?(-ex+s=Ok0-H0P9kKkdF4);4@!7s74T7(1D#eb4
zL>T<P817FtcA+?NZTV>I)EKy>r%z;KZ@MB#&o<KS{kXoY_v4xkxn}&u|0+81pUy_K
zk*WMA1+_G)Bc5pPf=%4%E@#x{$&LlV?oel^MDcxhB4Sm|&PW8etKD!^_*JwFkvpZ^
z7ZI~?jQVo}J-*z)E?Q$~1#~zcR0>jMocg~Cbz-}nQ7KMRT8-`q-THE0=HwHgWk$!u
zu8^v`TZtI#h$I4X$HD$5(9UM`{Lwe&<v)rsPbd7hJQLs9=bNG0U0`#(>&|{$tzX|c
zDiI5HFPN6GJ#gO`?1M#=ghaI4BWo<IEf(Dypex71oC0Ng^wL}J88zY7&ULXWXD_Tt
z9mHQBI}f^F8(W0q=nfu39U}4~^vT8Ug@XS_p|*M4+_ml+aqy^2-x<-^iw}><`*Jt;
zl3Mt1XiIj#uYIE0gD;ldF`<_`=S925%eMCGzVY&k#0&j1U+$Z@f_b=O(Zw;}iC^kp
z)J|lP``oV4TNvv<QH6Kx;y#??^?rLIQqn7Cztba5ez`BaV(iz#4@|sI=`{YkqYnms
zGqCFw^WE9MNcd+g`TP4<K+2*3_M`L7;I4H3Sm{201of0T`e2q=a^QWm#^A(RF`N~?
zEZe4kCG#s3h3tz=x_z{@7ujTMuReaO5(VXhIL_jA>9tqix=vm4V}9QGWIPzFK<TnA
zpWiVGJ0u0rqPIFN`uxphPK)++Um*J%?mgt|40Si3P3;2T7<X{m=s61~$0}oMW!o5c
zFgG+Ku`pIDtsl4jv~%XiRI7QpFKfk;x7)9Pbr)rC7c+3ank7#h>{FQw`!~MaKczim
zcW`_5eT6dr<lb=yvqA+L?auzJESA*7Et#8N7zLd3vFF)ApSWV0m_d~6?c)v>hk_5z
zkEz@fVOs|F1KfUgDJZ;s``M#F!@252cQ(rKKTw8`gUUc$-<kW2iTgX-5lp&7R@B~G
z$?Q>e2d>GJa7}h#kE-$b=Mx(*boe5X7W8@-j>7esQNZgn*l|?X6ltknUY~)E(02d*
z1+g*}w>j78{r#Ieo(OGj?`p)3TC_Ey_f*rNL_10@B(Lm{Y~#nd?iSOyo2uT?@MdVw
z>vI~&YcE69LJo{k7TgXCI<VIkZ3uKkjz1|*`D~}Cy;8R9XZwN|-cz%!zqIPvzR-+k
z`@*2HI3GW;psh3U!YH(sX;SBSq${HDk>h(+FY;^L8D9WZ@7s7q@U?Nd{#}*QzQE>D
zR@>wKAbGdD33^WfdF}hwi~i8;(dxUUL1Lxuws@25m)S4zzD38ro%g+ehkKRL!`v|=
zi78#?-}NAR3R#ZF^ElWYQ*@WWCjLj|bx-E~Vr(oUHW4*J6t!P)Zlbgyw~M=s?bzGN
z{<S;TIWst^_Z@ZbO^zo9d-vc--Fx+Qwc{pSSNRyDsqz`q5yr?Ybo42>mPR@EI$T{V
zPD%t+@81!4Fwqc)ZM0VH4!7*dz~)@+Ldci{djgxqBkG)YLy_}L0{6j*Pvfl%-WmO0
zAs6q3D`UJHhPrE~jl#Wfg1#53QuOyKKSN%7V^Vfh9h<U`@uR4h?I8Zw8v%Lk--avg
zb9SGC@gVjtRWW=|CHXEz7Iw1+2%H(8jEe<Px5}Q#)g`E9y_4V*<GOJFdcqf(6^pbe
zZTS|;5clR$Td>dGIhA7Oje4KGV>>c7z1$a=6hmqIQQB3q1b3rsGCs#r%8ZFk(m$9r
z+Skz#+dC>tU(I-{W^+l`9go0dd58CPh|TdQ1GC5PTH0GFQ546d6pr0b_-B{zBL3y*
zHT<8;l%<=wxvGnCnGdLa{FE)enbBUAE;d&^GA=hL^NG*3k2?O<U;HsRM$GJN2z8Xk
ze%u!<f3)W1KW2`Rntu1r{wX5#^@bR0_VQ`|?OD2BRS9PH{s8+>`g@e6V&<_{&2kJr
zmA%p^wR14`$i_Y5XwXMdAH4sn{;9bgr;h7JKa&yT4z9i&bB*8HUm$${5C^gjOr4O?
zGf7{WfylJptOGMAjO}@}>(>6L@I`k%?8_aun|k|ma39GE_xdoNoFU8a&i<eX>Q+eZ
zK+3MAr4I-7=&Tu<B*)XK*EDtG=ysf?+a^c1qb7{%VNaCj$eY-^rfZX<S%%gO&pKKD
zUR8cf9ZVC^9fvN-ekxTL_8S<V`))5Aht{U<Jt6GfI59R=%2&Haie3@%-a9)AY<ujk
z%00{3`8Cj?uaN}H(-+O$m5{i+AMt68JzMJYPPe>o@Ve!FW3cOndpAzQ^P$>#yT9SU
z^2ZxGm$x-EFE43`F7HnqsChimSyOTu+TqgZ^=j8kuRehN>m;d>YUP9Vuk6o*k}pGA
zf_70g*t=!q&A@$pQtYzCrm~W5)pA5v=Z-{TYngACh;;5)a=<4_Fp7RZ>fJYl`K;9~
zB6k0zaofh?Dw@{4UFxwlu{|y#uc8Ni4isr0N~a+9ryM73;P^oGS7UTro`RUua#%+u
zW$<_B%sXqS9@!tV4f$f+=UTNN^{j_YhU7Dsce}|&Uc22K2@ICc*tT7Lz7r=M@MQ$M
z&z-hBbnGGSuXw5~xOmF3ER}BBWA+a|weS5=>tZF9<I%>HU86c)?-QZhvA=f&bvN;V
z&%gDc4|}37+4r$fs5?CKv9fb|D)nfwvn%*O0j^-xXJR}pvJUusnYV|!Yo=vv33Zo+
zDpftmV}9>F`!mDau*-T?#h6z_BqxS3cl&~vzaz9iEd0kQUP^u)pCWObHyWey(((tf
z>+sS2zT*U_e~-xVHItuwFO16WegQpIski|>_^6aIUS%v~^`^UF^AwO*A1d2?n?H7K
z;`flbV48@0v24`t^AqCKQ1|lC)bbn4a`8;<-G0r}&t3a{p(zKmCd_z+yY6Pj9zPhK
z5Zt|FU!}<G_l?QwtvoPcG_7IF8-394`*EL`(izW;1$rkVojmtoFIf?ZHYdlWO4roq
zgC2Q(2BY17{p6Rc_KFkEnO?dV+d`hwzl$-xuAUu{#JWTzw(;x;T11Z=dwGr9%yY$t
z&dk`P%Du9OW<R4^cB!l{|K?e-C$U#Bbw(>cm_@C#M8uE#9^>pWwZGfmnO1b4qs!at
zc|h4PKTeFT7#9uI7iFG@J9*@@<y+&SIqZv^F)PLzyso_ZO@-fn$ax%I-x-zbP`lJ*
zS)_7-^LA?YX+PNO2fV!Q{djT+75J!cH>S*`Gvg-abaH9_tSC8?d?v&^*=;6dzat!q
zO_U|tgT77VtjCB^OnesS>*9CeEnKhqW1G!DKQ~s@4rT{bzn(kD7)+H(`f`{r&{mds
z6IaH?p&QGBuiP-zv@7F#>37Q`W`w-~BW#hVO*{jHoqvr5X0&~J$}6MLxA^Zm=*vKl
za?-x3H<pFbAG92Y{vbLF{ekLFB5k5~=fmhx#MVThJ3j3Sk<+{)E^^jgDBGIcx0v@0
zult?9?UhlZ*b4i7r_7JHV{WQ!seO-8&qb3elcOeezxHntITOy^`R6L}netoWp`vHd
zZ~7084WR86j-BDZWx>1a!wcU1a+vjQKQV>6)%+#f{h{X=58d`h)`or9n|h}(?eWqT
zD`a!!SU%l0Ja&jSY-(1G6JG7}UG!KPW*T2+nY_CvlCr0?SKZLI>(MH5Ds%KbC!-@E
z$KuYD>1O}!8_Op25b@W2fvn1Cup^vUKlS0iUDFio#vaoX@Z6B~hdm+^uZbtVl^8vB
z^sLOEtM|d<iC{Dye|yiy5avF6FbBG;BqDmJMItpB)|_y#J5$dHi|%&RS#k_Jj?;~f
zQ}sYSB8TixOrJWgp*@DXb6rVJuDm)k_qY2VEgRjlbN@~ePTYf|0Qu=-y!kx(R5h34
z)mIu!g}AFP=&P7=Byi_*RAu#1>k~JYaTYE(Z+-k-^`C|_M&KBfSMdqXyej5xq-9z9
ze+5%-xOz^`#op)<Usil?q9^_uo`9bLZEtw4&$r@F@s1k*!H9Sb&ri>Qa%Vi(7hLgR
z4NEuPkRSI&<24@llqb#eP#bE6_wd2mlxdH_?1|;2Q@#65Q=XjTK1+|}Mt4LSN^-~i
zyrd+8)>PFWJdWQ;1aAq-`L7Exa>V}&N8gQ<v8R3GxC^I#FY9~z@0l>>l_hUq6W>yH
zzHFtzj-Z~e{YdYstl+^(=qoWdd(x~}sDt*2{nz_~9b*4=VpIq7W!{o;3*$?2M90g0
z{&m6cHs~4NdlPuE8S|#sW6$;AM|1T^>+gGlc+#$Uw>>;Qjv2@7NTM9QP!M@D^?wek
zt&QG1#+m2xcZaQ6I!a4wdE*|@{STBS$ERNHuBXqJRW|jjS-%o@@4w4mI+gRJQ@R8D
zpApG<15=i~mQStR=v>Q@7)t5{l;g^q%RamdWmj-}*-@`QKh<|)%hbUBt!Vu{%@v_<
zp)6$0C+^*UUFN;<tq8~CC-xqkx@2EXCd%&Qf>=<N-N^?6KGEST_ut~X1?4Ev<779+
z0v&3uvJT}Cjjee1%Xuh~yqNBr?@jQTJ{sSO-e7CozViLJ@{@Cyov@$Jj9z8%|0nyR
z&b6J<fg1CzEA#b?kIhHhM_o3dF3)_VZ1O7yrut64cxoo<u<3w5ll7RnuQU|Ei2nMi
zsy4PJR>Vs&TASH>#ejO`H4wPv;55;ZgBop&h00lzcq$h|)#QpqZX(tn9E*OvB#xR)
z&f})mr09MM^_c7*vf2@JoL!f*t+tA5DSmy~nQ6AtnP{bvhG0jsrLrY|knQvVSTdY;
zn(tYUAMJ&mfz4%;UO5gmScV$BJHQ$Y?Em@d%zX<&rRDDWJE`{*9u^*%8npkJwXelT
zhp>_NVUeSHcs?<BjXBe~S9bz$L*o3YcTbtx6?q{zFY@d^_FNnHe#YxM*uLb<?v3oN
zy4`aEevEA=#^pc8xO=MR#&LeS_t#)7mJkg!4WaUqoQmnHFTbcilEpED88P^9E_=)d
zUyiRNUXwb~GJRNkyV64I0y{Z}%Y44v;O<rWj$PTcm3O+aj92$^KH+l4#`~Gd*j<ui
zMwbeoW6O1k;2A6%#?W?_ZAGG|FPKGZ%BL&*3$-=dIPL+_8t?M1!*boV*y3-kv)R$S
zc?08e^Yim(iGlI+<~22|EdozDC3lvnX^pfrHMK@&oV0p|0PdQW)eTqHR}aiLWa0qO
z*7{ZW<h1e9h=y!xj5IX1HYqXrB0pa=G)Ba{2+L%oE;9qKw*)bF$dC2@4}ZsqDQ@|`
zR2V+rb>+KU<3NnZC%<xj6rVfEc{IKk%6Ptm$^H<Zl*>LJpD)RHe4Zr#hvfT;{7>!#
z9iIcAbLc06X6iW3>GHFtLQoN?7)0y^pmI<JC<fwX&G>~NKHr@SS_ER;V$c#$73gE2
z^FfSX3gUZ+7lA$wS_WeL#h_1uE&+WC^l1>|>p?3(mx2<Y1`y*f2dxCH0yTmdcLV4~
z&=)~BfxZM{{Fgx;pj$v+0euz3_*+3=1KkGN3}W0C(APnCfbIl+1H|~Ppl^Zh0^JST
z24eiZpl^ftU(<b{?|>NJ1$r3t2#EdnV<5(VAM`lr3D6HfjN|<o-HZ4kh@Hhw5aXW#
z{Rs3d=sD1jL5zPM^aAKb&`&{(dl~c}pr3(yK#Y3@^mEXwpw~c*`z2^M=ylK=pkIL)
z|7*~1K)(g`f*AK-px=Ss0{tHJ-yp{C1@(dUf%bzK_eap5Kz{}u038G|{;#07L4O1N
z9rO-}@$Z8E0s1HCJ<$IHG5&oJPkbP}wIeXXmGK$y`CaEI5Z}`s4Z=^1!GUYojRTDb
zO#tC1CgQ+%3yuO!0^ukBGvXRrQ$WY+IIg`l4Rkzcx{iy$&jIm&rW1ACN$^hweF&7R
z<M^%PDImTFa;lCy4Sp0<04f9(f$$S^aF`3?JC!A%GeGzWzKh9sN<ISmDCjH@equfj
zWuOJ1a!>^bKXEn=m7s;7b3o^U@Du0Zuo$#Nhd&1Ye9#3TzHfUW2tV<09F~DT0lFCU
zNf3VGQ#gDYR1J!QYC!mjS{&*?^`I3X{6qqW2GC`o%R%^wRX8+)nn2AU{6q^5t3j=x
zH6Z-NRXDVP)`G4E;U})a;j^I6fj$pv2jM5y<8Uo#1L!)?^&tGjMjUPc-3a<3=q3<;
z;$|Ga4C(;g0{RLFKd}jiTR~p~-3HnW!cT0$;p?C~KzD-h6W_#PE9hG~d^h}UpnE{~
zg1!yHPuz#YcR=@p9sqq8gr9f_hfYuz=wZ+!ApFE*ID8NEeI0%R{trM;f}R5H0O2RP
zao7oZ8uSe4M<D#fb2$7M^b^qYpcg>+iJ#)|66j^ne}H}l!cXkN;T6!&L9c>d1K}rr
ziNkKt>!3G4zXIVWevQL#K)(g`g8mbPpZFaPZ-IUf`fm_^VlNJTpnahIApFE1arhJH
z&!7V!{KQ{y_$%mb(BDA#iFa`52feGq|AhY@=>LKK2lPG&KjHJ^`UeF-K~M&W@uT2}
zK%+rn9XA&KIM8^|1RXaKem02TqD%r!1~LB>_{Zw=<KRyN4du9AKqYS;jthvRuUA;@
zi1Uk+#BSVR*hecD5U&-hv)S-`;^-6!0g<8k4EJc!#2b|3MmuLb;d%qM3*gQ_A%%Z}
zc>HGcIS$hV=Zq(Tl$B%|o-95J{-m2M_TWZY?nF#>&Ui9#y@BJzb-b}U?l|X+Cjl<n
zX*sSRFeimSNBkZ)=Msk}$2sFk0OeVbQr;(tXJBuu!*!B)6Zv^B41xxh?}r>to&@lA
z<nomA$`g~(5ZD&Z#KDhMVf{$o<mAc|KSP*xN6m=eitu?jAE(3c92ZDgah&p^;;xkP
zjfyKWl{}8i{NjF5fb=RVAYD}a2IccK&e>2X??!}q-w){U-><?6+*puL9PesRg)+??
z0<dQn@+aLK(S~rYBX5p49p%fhgTYVoGVXLci10j-n}RpbmHrX&Gt@`YeMHOz{x&D#
zBVrQD?_z}6G6vSySq>*p0vKgJ2L7a5ATC6Bs}r%nIpaydS$$PS2QV7_TT1ya6t^Or
z>*QMKobe=pk?PD8{>9>1*qgi_7Q6VXT;ZkS@|5yf>PqKGH|YW>iQ`iEFBZ?B{F3rm
zQb`v`S@DwkR*Pd&u8-;@GtL5{#ucs?+f&N3-j&Xgb<zbevaU?wzg+A^`6RE`%ahDF
z!|EDhV@mloiDMAv7*)9@@esmn!l!@+*8dfnPk8}c>EBN&pX8NKjsTE8oszCE4vi8J
zSBvo}=~wF%<psp&#A7M#^>eQDc31dX5l$)ZYsJ@5J|)iebgftb`|d)n6F>v)yUvAo
zgZOYt`Q9LYh5YRf*A31YPXh93CK(mL)68eUpLAaqVT7BVh!k+-=TlG81@P3<l~O*p
zie(6wIxM$3XFLhui71r9zePNR@~d>Xwm4^spHEIn7r>Q^`F+c6wa$spl1sV(o~Uk3
zG2z~1BF+NxNh=u@Kz}+Xh5!C!qU8UsE8HbsODR7-sU=-NKC#*1?~64l{NGO|;w*rt
zw_r*-pXQP-AfM{&@H686l=6HgnTWH1HIiUL09VraDg4PROQpXo{3+=#i~CSN#s439
z?*mtLb^njQ-|u^Y%LNn=jg;vH(U27HMNlkPfN({#qO!7P0|e|+Dh$b}xrXKXSgUnw
zu94Ht$~A0OP`2f&Va+zzas%g<+w?QGkDHRVNoyNzZGNAx^XK04esiyK6|~>ucOKmL
zx#xXe@7L?~e4W?%f8JcmWMQxT!eSd{h5t3#YoGQA(m{HfH3owXGsfvA`genw_-11>
z$>1#;W|F@!*@I@5!C=Fzvfh;cNA17R|9F7pkAZLW#b)}C@svKQecOchsD++promvt
z%yglN{{3JkzS-D}HF(R08SBTU_JL-w!C+%ESvCEU_OyxqBds6ystl0OOg9*8Y{sjm
zPihaC?8|1r0RkJF2?vtUH%gykqL0#l3VXT&BvFBuiEd$u%#x1N>rD2Kv*agO(n)&1
z$$m-tw~$T?$V;-&kI}s*`Z4-HV4wH^J)PVP2Aeic-)yqqI7_}u|G<RTWyznU-)G97
zWXaFgCz|rJE&0>+ADQei-IDLIr1SM^6MeoVf0iYEss4e<9+z73KW#}D=}(yGi!Awb
zE$MlBp^2VW2!a9QAxrv7{e;QhS6cF~(Z6oWzeYa}`z;Qzyv9O*oh5yv{soi0Z?xp!
zWJ%wmf67FEizUCplCIWYH`%{hzXj=_KUQ1lefn{eeSG>?kq-K!&qBXKzr;kp!jj*p
zzh|;fqb2`N{ZUi?otFGHdXcF=Tw}?nRghq?VHISL$v*e$KBR*zXq6-wY;3heO|RD-
zrsvmN=xG%t7;IQYX*1cER#k$*##UF<^ag#FiJn$lg2BdCUDWhO{aurNX%!|IY*>N0
z$CUpqOa9Y(jw%0X{a3Je(Bw~B=)Y}AZ_~4b#)Dv5$q5FGCoJg~^jA&xdqMvU((wT*
zTJZ@68(aBN(=Y4)HreN83;j<08>al7dN$I#11xBzC>U&P#Yjze>TjFu(W!q9>EQF7
zmgnEFq~FrhP0zoj?}0J90wUhB(9;T3FxapH^(m7*f2KbV`|Jvk&<a&B*w{*yn(o%G
zGTFCV{|oR3M>({T6%01EqNS$a)xTo0-@6uiTImV~j8F7WndoWdD;R8S1x!u<pZ>bZ
zKL2N-r`54w!1zS3G11d%SukKcqNkYhY2_>!@ZTx*SA))s3|d7C1{+q;5>590rzQX2
z`jaMm(h6HJ*w{*&n%0dX6FsfG1q0T<Ea@2I4<`H3id-<*w0L8!DW6v7f&uGMMxrU7
zR_cPm##Zdq^cZ9ODw<bupQQiics(XslupJc!>HAoX(2;|M8xHoQc^z6Su>20+V4Nh
z(+gR8w6+=((ctsrw9BwCLFq!4pRQHs<BJHyFJD=5p!5ebIDHDfXBe^C&C7Y($I>5Z
z&t~y7jj1z?ziHpX<evCbAC+O`>m#n`=}eZMuJ0xwA`t&)f`f6k$M*wFVd?p;_#_+I
zT2wPn*WhM`fj2)a`o3>@eu*Xj#U}oI8Te%wU(;$5c)FaWH)=Ik@N_&&AJU4dd79h%
z8ST0M;c0H)En1U>|1C4|pa_Jg=+m5@<1Nx#u2a*O>IX*fG?vML?-K2rH9XzU(x28A
ztmf%9q%(}U+RS>McC+++?O80bkbQXhUZq`_&C^`pMOqh@JScwyqkmdohm0Wo&Dz=<
zks$)<d(dLP<8_?A26-9AHTu<9GN9*k@kur+w9XiwUcmDIt^a;4Pak0U^;!uEp6Cl%
z{_WZYu{=GMrIU>J;lGs6@i%EV!SIxJ;FE0JsVx)sL4@?(TE$&FpVUk??$J8G$kSzb
zDA~AAdvYC5uSb4{@qqT}`*<2|gY+X>8|2AAcyn50iti~uWJxDtiHP*!_U_OQTkPY1
zkmpYZO@{HBHrB_}<OUhWo7(Y9dD_X+-`762Jg@f9^#4q6z>+e_o5Se$X_GDGGYNu%
z`FpjfQV@#3%5O2xACG$(#=F`o$Rm2PXNIvyYlFYbK=f{lJzlf;@At0Z&wmKo4C9a5
zSQIqz%VO!HTJzOBy@aLT*EU+}!v-}Ce0QPzWgz)|m+<Ggzn;|ID&uKhU!wF*I2y_0
z`EmNRVxD&4UWSpR|8WIRlmBEG+4_O?_<{hp)6$Jp<JAjzKFP{3#^_s;D3=Gi_ty*6
z{Be3Z@<|@&=hEMZ<7qqYWf+t6d2{)*bfxG2tKviY=a+H%+weWZn5X|l=sSj`uhic{
z!x6-Dqu%CL)3@lCn)DxM{Hc)VyV&#9dj4ph=6HPiuTs_Y3jN4Pp62>D>c2omBYC{O
zt<k>#N2D~zbEjSq#nY{f|GoNdC`$QU-}U+n89ZIc^1q@tUBuHREWJU`P3LJYZ=?Qo
zdRPR~@%Wc{KGok0<6C;^B%V%T>23NC;S=;o3N9JO3%WW&r{^2T@_Z`K4C7_pSjyAy
zu=Gy7<rX#FslR!-;K%Zh>K}ZDr}wb*&-7a=dAf_GyY(;T@HDsQyZQtuM*494hxDqO
zdHMjOe@kEZ6?_qao*8!~&qpypzyH%Ot>I~o_kDemi>JALKG1Vb_V}m1)ywm#J<Tw5
zV-_kd$>;taW4ttxryVRm-iWjKTdQS!@T)bPzMXg&pJr=YPE5N|%`_)AeHK!TY4;+E
zFVorHg!6J;BY&lQJkIjhiTnpCM*iaz7wT-q(up?Xhm^+jd^h4sY}S)~ZSW;37fMs0
z)doAo01vlg{Mmi<8SFmV0<xR4L}&g<{M<;>^LZj>^mv%jqwUHfdgxO~G3ZMW6MdP8
z5t;rUGLu^>^np<sACxi7%=nPqiBADy;xk9Yh_r0fHPVOj>Ausev$H==EHf}WqSNuw
zeJnF97jc7#n-CMfW)YKJZDPAH8=#pUY5d#~l}|Q32m2Fl=M_3TGeq`g{4nNQP4^*>
z+>i9xfSCBVBDSUTGdnia)h*&aA}t$ZJ0=G{1d*C^p}+xo#gxYK$1;kq;(F5mo!&(0
zt95O=h+m@^8+N~@7|S1rDZW<MGGS6DmOrSBNiVmEA%f{gdwitdBE&Wn+G2{Q;EWT+
z09z^Y!A{H06nb9F&r%V-B_s#-zKvqoo8d?N7^T7VS&FaM*?A)84LUp5L-&u;{Tp>{
zEcjEoj2Cf+h_i&;sfejONN?M8tO3(~;Gn$?(wjo|RG}9+0i`{Btyry3<af@SMSViO
zsG;;{gg*dmBc-vda}ULz)!FamI4g8kPK0wS?vuPW#I~6@Pa)EXv}}yE?G(?_G#6qg
zjJAm4DqX9j7=GfT80FSNG0K&dANX!Tn)pioNNU*yg5RaQ?{Y3hIpRL)ktOH>If#Fb
zsBh4}P|%f#e8L^D6WUxm(%En-C(+6JHdov)75)dOa8W+&43$}Y8O4wvlCM`hKcBBz
z5k6F5&56N3={>$y*U)@x<Clr@S|I2bf`;f&pD1Lbjb{2`titL&@SL*VmkZpG$Lb^a
zu=;W<Z)eEvtQ??6CHOmW|89z*2h~d_>gz^|f%7SGpURiotv4wK-aUxPe(xZ*-N5H}
zRDbu2`-rq`%oUj4VhotQnC{{}`lM*YB$uU8S>h=TeOWzUF4|Mrhvk1(@TtVJf{x+B
z^C)6wr>iK&avw-pnzcJCb*)9D86Nogvy_G(w^Iy1{(*@9Ofi)M{s@0G#lW9JG4#r%
z7`SEqqM{+(g%sEDb6x>|suKFv^4~+I=b8QMh20y3-En^n$pzmQ#Ps|+5hK#FmkB;~
zqC7t*{1|)~UOayr=;(REOV2ln7?GBZOgqIGW2PZ?V!4yq3-pCZ6Mcz@5oy^g`8#7y
zEK`p~+PO;9ugQFmo8-uP0~ck_v*$i1<UsfcdaemZLCC&C+`m(lH|jqt=Q~7xv&g?&
z<fHLr`M}4X|Gdcm0v}H}SBv}ii2E)4+{O4i#r?ISU1%2R`vl#Wpc5E6??QP}e7DZ+
z@p(~?*YJAi{DOGye(~IT9#cC^A^QQL#}|1&Pxc@`Bs-#M3fco>Bv#K`PDA$<{{KqH
zuNC|s6>`7I=R4!?756vr|CiysPxRaCM8AjUmP0Q2>0=asN%SAk>$uS8gsRu$g8vh^
ziI9y-!Te*B7$@AXv%P`<-pwNaTReaK{|J4yi2F}znhSiK>qUKiK=>z?rEjMD(4!JD
z*{4Rth_vjd#q-Z_oX#%`zTXk|w~6-lA)WEJJuLE3d6~Y?fj9U#WjQ}D?xRw(`}bfc
zANk{fheCFTu;(M(zXJSr@aLRZCMUleFZq36_!Zg*_WVv31@m7O`DjmA{_8^SS4Fy0
z=<|lSkMRlfyA2}$O_9G_<V(MMOWgkn$3OmS9RK*o#dBzM8UDBVdIXg>lm9bue=kdF
z**_Qc7?YVo+;X;xb_eA_O)!<m62!JAg5`sxmfa=z{8E(5M!|o-xc_URue8&<;{I>M
zeb}Aa?||KZYq2}zF*%3$bIxyA?A{~n`b|OiM@AmB`(Ytxi|8kyM;1uNKPl+{Ec7|b
z=ReM;Fn&V56Wa>e6r((uU*fq3DGhu05tBVo#e(&>SMWh4iYB_PI&aq`?)OFhUxl5&
zE##xJvGVyq_^-VGH*x>(0^c)&{vTkDklinSm*hLTmVvahP3Q}~Ybd=<*U%&}eIG(h
z`bxc#)Uy92`2R=f`>f#qUvXa(?b~;SAD~{aesVkSFPzWmY!AkX``;uv&+F{myYmGx
zZf@7LgLJ<`XXn7lZV;&vy&a;QFQOa~lU|7;MmEOQ$fuZyD2@{S;7bA*<lc+>&K-On
zK>T-68vJ)7CVp`FV7bHye$KPx6DRnL(Ahf<PUy3o<Vrh0pQk7deNfeyKByW@4^)Mq
zJ|hL6WYMpJPbJZV&pi}_5BU}Gd5vP=+J%^KNqk6Z*`ov>Y_FFgP5LaO7<^c{gAbZ$
z#)qCGKGH7lAWi%zWM3fojMdqCnNw_6Wsej0Kc#bj{+`93$BTTI;FB)W6FDEM&xzpg
zMEz!RGR1vaA13RXfsFCr7x`Ht#^j3H11IW%n_|>IFVVds@}~+pIYQr^qMbzSB6{$j
zOz{r{{d7U^;jt6-g~l7>Wj(_njr?u=GlD)(jJIX}O!0gHmuGy1w?BrT<HNhSterMq
z<$4>B2|CeE8Jh&%W((c7ATP|XPvA#tay=Cb=NHc{FRv&no?mfQ(Uqmwl^4w|&8w(b
zw#wsPR=2!%)m`}In-w!_YMZL+mV0t5<}JLsxM*QT#Z?s^Pi|>rV|`;;)ykUXwT<&v
zm(FagZK!W-!cRI}bzOzWT}!zY)%7*CrR7&t-);H@5Biy#b1Qt{FIAjt6)GyKYO9vk
zRjjC8QQdGCetm=|@2IP(JKc{Eg*8@wP3`CIsGSdc4=6Jf7QJ>?v8t)DwrWKwNM=_p
zUtV8bg;)LNUpJ$ow6xSS8%osFR4lEkzP+Nls-dd7uIVo8ZyB9y*#ise9BY6dDv7`~
z@*1j|e4d#V74+I;@I6OZk^SIF7$^7S^NIzlH`U&XcP~#zKl9ewm9>p^)#?LhU$1iu
zPW6iBta|n{pR1%t@RF&kX%76()i9Mze)aO&szxbR{;1Zl3p;0?XT}$SSqD_|&<*np
z)a9l-8fz=i1h1?gv>nfwdjy6%V;LcTI|{#`6sCfmUBg(=P~X5>#X;L{2<1g!%^{R}
zPVJjVJ<d6@Z9vvJv#XSN$_@Zs?<!waBYsuz&e|&UzVth69@Gw$Lv7WnT6R}jD1sIu
z*B#)CAOEYsYxB#iszVPDPTly^@Ife8x1zy1e8{8W1FBv{{mP2FYa8n&DPfUXpSIop
z1nD|F79PY9>>S$g?6nzar3eN}r*=2AWDQL|={f@ig>C2ubSP$+=xXa%)k?mnb;&_<
z;~F+qEj|5MXs|rbWZa3`PP4R?RVxA*2ik7P3du7AQ;J&rY9u}@s{<0HRfk*7St0Wj
z4E!G?Vekx;6W06AWfMk|40CfkXt(}ks5v}#HP?4*N5$v4=frYnsz}7cgy7HWMqts?
zv_e6ivNnhH`9X2wnhiz!$TT~pjdGV(t-{P03my0mLG!C=@ySz-u~kJ=V^v+#s`=HW
z7O%jK(jednj7S5tRSnDQnktswu?(%?{PIDpyj*KpdSPRyp!n0;d#Hs*P&7j=I>JfD
zxoox~D3J4`)^NM&`S8;4GKbqq!%H4MA00#oF+5%vk>CjY?3`AF5I=h!X6@(vs5Lxx
z8%)s+i)A7bJP>>Mxxm@2S$QzykvkQ|vsQa%xe??zI1)7mjAHmgeu1xQm1QY^fEd|h
zhsSsp%m-o!I}r1@#R3ghdO~gioqEbmC9JIQl;$_quBvSci}pOLF_d<(`1bH2AEcmx
z*uuNkSymq`JF?xrRSj5stXPWuz}r`aE%NiL#Xzf^!Ucny&3tnuET%K%!L=FGght)^
z4x>#Z*oJJ*5k?o;oQ1c{aBDE!)(AD&JEz8oK!FHsadu5X{?gi8>sCfyPljA-1T|~O
zWk)#JKco3@sKO6yFh*|wbD+aO9~`!x0Ar9~e-zdj=Ry2HuRIS*gm%yHii8<==F*^6
z?h~AWk<W<jKqm^@!JJ*So>9B9CM>9PC3B#=oGZzpeI%@OI`cJf<C)GciH&ET8M#5v
zgmDB`I}`Sinr3L{Qzf})V8mfnArf;Bt0F^PFxGk2u$cZdLWa_~rx6vQ`OdC+Jri3F
zsl*5jJEU?Ww6e#2$I3b!#;u^$n8EA|VO*Gt;ZNXDF1FUOg>?u06bG&53^=Vzdsb)C
zqMU2BA}Fu(V>7Pcpw6*+3IYXGhrRb(@2G05u@nv!<FFmN@>I;fZYG_zqHspV{|N>V
ziKBdiVMN+a3^f!>XK~ea<TUx8D5r@?#q;SF5h)sJ!7FdX%sr!)Jh;edc|H=8omz_l
zZ6hWUaM&haWBr|&sn=9gH8xh=Rk5=6&I%kmyS2#|=#f^NUhs+JF<OAss+Qu_AuXr6
ze#MH~mH4u}ZsqN@jnl*{2wDy)R@H<f9!u|Ns$He!EX+Y?so}S$R^nWj#!mUs7rg6I
zLvhZnjrDglX!NeliUz!E!%o7}D;eP@&!J}+IP!LDEne)v?5L@>5$`r#*EGB7u7=u*
zx|Pf7HRu2{fd8r{_708j_KIbAQ3^L!uUgrF^C(TrDyn_AYdI_Hn`(3BU3L95MhHb#
z-g(=p-w-*YQ!SX>0XRzPuF~6B7zP=bE7q;7YoeFBh6BRPs#UA%Ze2Ni>>J2uIQuYf
z(1f2n4|Ure(GDGN*#pA?r45*W-7K{Ciz;q2)xq#@M|`4&HKB1t(xm-=qf`bot>>_O
zPTjAWN`U<9JbKcZXnH<<<xKRAbl_k)%{U94ByHbP8-^D-2VLn0#U>IjJ)<s)-gv-C
zgSxx%tB|$Js_t0c#JZEfIHGjWc!o`UB>psPN<``;XRJsS>k!XdVVq9<IVp_ODG^~|
zC~G%^SqUmF5Q{*yk=KHu6BR+tSA-7h@`pP(lN}lpoqui5g_Q^NNn}TM?7Vb{TrDy?
zo|!%oSjuxojUVl#<EM-9vSm|!g=rHJ^BQGF$5#D@V<N>{9qPuz{g00DGm$ewtPb=_
zR+a`OpZ*Nc(8(M220awYp?`s7cEcU3eEcPG6dx7>a5fC_T`O1|VTW;c8yC6x6%{M0
z?pj)lfz^t7{M>e^BNb4NlsaumpBq&oaDsEAP=o~*!IJ-g)^Fg}j_R=s=-=n$R<Ps9
zrFeHJx56_k`0AqkmmKs`k$TRM_6M-&Theg#qKZKl^d}oa1P=1a1`^t_PO%JmMlG!e
zO#oIt8!?xvXslX!Yj7kv|Jp0?zS~mf7XyuYe)I@!ldzrLfb&NM73KJ^J9BSXgm?QG
zaz2GwRewigwSt`L$Sn2cz>3v%wReVoLy#)aYF4W(_Q%p1_$VV@dV3J-z=N)5pJ?s5
zM+|N+6hMaN<wsh6tgc_lce^X9nrQGvyQ-cUtoN$JLOc5}RpnyPO7_P)?n{?r)qUCg
z#j6@~XJHL`RYi3}gJ)L7viin5u`OE>cx(|?u<}<|Ex!YAsF&u^Vtwg#r4{(&y9n5A
z7|d(?XLQao<h!2d4{n6@?97JIVn1L$hOzub+p{dHqKfN^2HS^yqBI`Zx`u7hK2ds~
z8!zFLoxlRe*}BWMw8bqd_c`#G;n#lny=V9_MCeHk%Y*JP$k+DiO@2$|SyZveU9rf6
zM*r&TW=GI=44d=_N^;nA_ym+h`4u?2G|0KgaM(e}KhLG1Sb=LYxUtsI9>1-+E>O`>
zN%99<DntB&=|C+aD4XHdW#|`(s;;BcA~5#Qv!0tPSVw$-!7{m_*3_~s7~+4W%(V0z
zs_@gUCs|tSLALYZL`LE<Lyk3)3VbG$C7S01jsuGodyku~GcIeaU)hAZn>XmXJB$iM
zQV7GSMudIb&`s!+rQhK$k&qM00rH2tKnAD9xhRiNRb+rUNRiXGOGD+E1H=z^X$;y1
zk+fH*8*o@wu}jUJ`QV$SvzHTzdCy+jxp3-`)yvfIV<0hj6Q7A=4_bvttUs)ZoQr}v
zbxjM7sfWFIB2;9!3n@Z%A}lJnjrr#%YF4YJrem;tcWm%=A~Kc{m@hKM5gOtgydGu!
zr$2)?>G@QS7to+)(r34OZ0g%*40h~2#4;mr$03#++FwtxXE^BHw!j%y9AGuC5e+@}
zf%Y4E8KEr|cKv@qv%wm)nj6%14m<y5%bY#8ftEOXo)IGV<jb>;;@=PiAfNreFbmNw
zEx;BaTQgQig0w-14O}-nF5wxhl|PZ1M^K`lNd1S`dn}U{i+|AnhCb8NHs{N$&M%_j
z^S1MgD^f4aRZlORx&gBQJ5zrvXTR80zNq5564q+D2i<CYa&+b1GpJFU$Frj9_S&KE
zA;NYCbZ~C)Ha(x(4UZLv$W6mEi^FBzbE9=6t=`~0<J{;TVaqmPTpH?UGuZA^a28H)
zxR{QjQdX!lt7kfz9a<eCD9z!u#;LXi2PfHsQS2F)Lj>(e?dO7hT*&>qg>@dBiCjvK
z5Ml<%4ruUEI8LeZm*;Enl0SZIlKpoReu`(1-f<3fiNHbw%M1V62dB2huWwpvOt=a{
zi?F7eG)S8aoAk4)D?@03p(}}5RW+-t=(mf8$=0XhKXleSm6XQ%nyRL%oScQL?yPI7
z_T}KP>+;&1$Qm0{(VbElcG}LSa8C385AdpR-O6gb)PmNcbU;6IrnTcNg`Q0@o~7vF
z=*>ODW8_es_Gv|(jcLzF;Mp4V)a5zIX8#;H_L*yQHpMbb7K*4nJB<$JVN|%zIZP=H
zU+agl5`KpETs3>)r43){hnG3L^^#s0YHGX-Z%bC+(YOl#*za5!c~F9f&)$O(A5q1k
zpCrT^uk^pV=zZy?J64@~MsmudkOM}scuQzdOd~x6IY7{<+XwtlEjefm(*~UOtkIB4
z96tXzJ<@@#UHGlE0iZqk!S`4(pliGf1x){2ZJF|;GpDie@JkzL-QkxRy0tqSxwN=M
zrbXpESLTgC<j~qU0>Ni(=$SROP5A$Q5IJw*)x|{%D=MzS0qWe+#>V=_vZ|Fe%ki6#
zt4n7#);8e38M3zUR1^9LO8D#rpOw+iUVLcN4}SZ3K;uFGu95$%K=$S*-XTSc5?H4y
zy*jus#@?aF|8cCYs`lac)@gcNdZu&7Ay;Eyv7Bd{u+;-9t;Tw+8Z5dY{C}y7;Jy1(
z_pnrhm0u#WY}4|8T*C`&Sd=62!L>Te`wwj2tyK66FRa1sV4cz12lR{7>>X(C*+F-v
z*B#mND*mNt?X8Vf%lQk`RV$n3FI~8lR$m9{(P#EL##!kVfs3C9?ILWLhVCr_yt*Fv
zm+#^w_+WX{tMB2<+Z`zHNIVh)vWVZ`4^<b>R`JZHoY}KATnpHB7Q4>GwI(N@UGvzT
z8SLuGWw-d%<Kg$%EsuM)_&2~gEX}fJ7cj=S*5u4$-)FLGKD*|z>kM}F<g$ogJsy6K
zU)?NXm)WxzKX#qPt~1#+AJ>|kJobGCyLxh2MAw=ekB3J*$IYTyQd^cadnRLyD->nl
zXR>QPyXLX$40iS8BC5%uYZDmrh+o|^B~M1eZqCkUjM;S-t~EI`+4p?*J&%3&%wP$+
zf@Lm?=t_$7i08OjlrM$k<KJRc)mAO7tHA$Nre-RS9+{0R%934YvFl8B&1cs<cJ<6)
z5x;tJkpLi`<KYp%y7QzgM#65+p27Iz3QMu?Gubtt-N|F$Ju_H>Up=|(9>01#EQhXu
z>SoalDTJkF=Q956I*VOrvTHuO=CP}128;OBlZyoOXIG5=7-ybvvqY}s&r-8Jj6b{1
z!W9L=zUQ;=dF;Dq28-y5GRS2Ke)V|xJ$B3E_DI(JE*gEl+>igI;mKk5X1kd<TwyNu
zeI~o+vuhr^dS<YQUp=`<01nUb@W>sIBhoB#YY~K+Qcbfd^owrPv@89=8@l+qB~R1n
zd$dR+X$p3cN?kROu1lembPqOaS}g7tioES!O>4&Y41?=KbPjw*2!6QDf*nf4i|-Uk
zej4~8tKnXemxu&CFR@9wk3VOYn>kO@5<y3D37eGrcK}QhyeO)fsA;K)iEb`<6CHhy
z&k%Tpf~m+$!F?ITZS5)05nfH)$b($ckNDAjDff?ppCRa`f?p`SOE_J_y@IYl;AJud
zKSbJMi`+R1Ug9g|TJf$?@P1msy8!k>Qi~RH3y~-wK_U=83J*4z@h*g17w!|@k%*<-
zLcvesZ3e$kcz<3m%2&u;2RgDJ@uDE*z70Cn&dU|N$%2lav*O*L;JpmIi64D_^I0?A
zhmf}r_hpcBZv~wyca4H~G>D0g<o-hNlXwq=!TZrIX1s?5UgAYT%Kba&RJofJyyUM^
zt`+Zg1@Gkw-iC|Kc#k8G>?VUSzovsumAf5sr9Y1Yv6Q<^@RNAS|3j7U<Jo4s@t`Aq
z#EXK&`xxj{xjPiR;{{!)^4$%*R4>W@$Y+TkeF{Eh#+yR<xG#g0n+G~o?rx=g(?Lvh
zB=@Z}Gmb?92hmWF{N4ba%I~mZKd2humw3O>k3FqvOTe#1e5XkAd-zM7U!ll54u0kM
zPIxB?I?^v%@WX8u4&qCw@)!YrFjJsCJqkK{o_JA^a-9~rbIOA4X_la)=XTs}#&H7t
zwh|)|B)`i+M|LR`_ZNcSVtgkYDEfe1o)!FXn}rRw&^Ug6ml?+v(2+jGi-MH<Ht1Bj
zTOn8W3)2K0J!h>)2T)kDU${c?tH<sXc!h#(kXwU%8Km4S(5Zf~19DqIM0nkZiH_v1
z7yJytFFq<X-ZxhZyn-$jbo4y&q9En|5Ok{Ch4X`W(PaeWj)cynHua4ZT;Mk+1djE{
zQ|-3|{OBIx$VV)3L<xREJ#7gXhw?v&G5MblbcBO=QII%D6;<wG1xJCPqv!UGFym+d
zKZyz1)GV>Ehtmc8zFEk<MC41kyFsVQ{Sb0V4&l8NvBZ1D8nfIM@M{;mD3bhM`n;Ln
z$KdBfKJojspd<c8f}hma9TVDq6TlC)3E-FmI(nXXQIK-SS>)C%2>L;xprhxket$yo
z`<o$%_|d0?`(I#uPy)GaxG#g0``R5GuQYrU<Q9U6@Xkd{bR_o@!OswYkB7lq0DcUw
zpz9ZSi5CSaH_sw>hl1BD=tALjWCr_>&nS4^d|VR1OG?YSrplda8JFyaTo(ukFN!*V
zcl}B;4mbFbK14%7;#dc|Sh^wb9tJ<6BYsy1I!as1Ee$wid$mNtvGoSwr-EMr9u76m
zNdcWI_qc-NDn;%_!B3XkI`9is&(~jX#_I<i=}o*S1n`1Rl^YL`iO46s*9ba#&Wblr
z!F!8>cT~0+Zz~=SHO{$zidk+N<dPhcyGW56EBHyg+d&ix?|-t)cwYe>@grUoB;Joe
zr{c|2@M4M<@E0rIg$mvZ1@Aoohh)G{cR^^V^34XFDmM>u$)5@D&5GP6!B66i$3vm;
z{uYxc$PLU>Qb9*}i5CTl_t&6P<<=;8ZxM9#-28h44tf~Dg@<zaS9TTdt95^Y^D7j2
zP2lIkcfwJDnB)?_%LPCA+@dfzZUH}r1J6*X6gY?%1&QM(i`)$gj-`T*<XX$EMk%*T
zA&B_V=jsXOa`QnhOdkkRZyj{V3bY4XA(!M3-de=Oi_)cnpDedEVeoz*gK4$g)(gDE
zivsbZ@Dk`$x!V=IKIBWeR=jI6gYD@u1@C2i{2cI8KbRMiAQ7b8ODyB(*Oc<T9kf#J
zbK}f7x&#iQp&<Ef1D%TFAoxl9tq^pS{>@rZ9`rE60X%eoe`Qz6?-tMzze16B82noB
zoyr4UK|sG>2!6QDLc23`J^E9Nz#-^f10Cr@yeLSye`qnwtwAN1?PQ~%qvwubJgOs>
zW1!vOC%@yi>{hfxoGvhqct^->A|eDS_cx$Z@isxOv>&?M0N(4+NT_o63x13lF47M3
zIbA^RK|zOMFbh&{Dd<$WYZST7pd>odqjH2<?qTr5tw4}+m*A$#Z=J#qQ;q<?za*H;
z<3phz(NK{3y$3p#-$M#N4CMm+ZsPNlKpA`tetC=&zexRl3s5S*4d5sHb2McEepd^A
z@;P^0XuqleKa@wn&T~LV_99*sB#zHm<Zg#t=~rt79X+@6i)K5QfL|FExCoNpOwg$~
zUIV`^prQJ4A7WW<F9?1T$3yX<aeN;Nt2kOgNBR&i3R3P%pi|{8xiX03enCgiS=%dr
zX3)+nAc*+U=Nsz;UZLO?$X$>7G7t@g@t`BQ(!rNQZUK^n_W{I2M{*w({ABx_1^)rd
zK#=^t4PXqfkedfOdY*VukaSOiPL;b=!TXS)3x&5WGl+Mkf_D~|8)%>BKrUP(5TxAB
zd(CopK&~7|Jfg^*CiqFbJHRg#-YdXQ#k&i1q&M-RAmz@p$UO|X(oY`~bfNI>0^Stl
zQ+Zsi;N6af4#@!CJ&;?5v<y;i8|YL!e+aoQ5D~wxAtpMKJBITMjE54@-q3xbp&<Ds
zTll41#p#IO*9BcD9Q%PI75PM0uHg7A^j2}CLT)(;6hX?32Azr{4RU3<Z3L~vu}JVU
zAcukv{6dx6i?|870lZD1BfW_i1u6G=(5Z44Lar>g&4Mlz-s1}1>lD1-`5!ahHIPg7
zO$MR1HU@O6+$E4pa>#yL5KFw91wV;*2l$1;`v4jd74I(45kKNZLE`-q=v28ikSp;%
zE$BkwwNDC`@3jivORLRzX&ocfIPrg%n&mbra-UJ;dIUd-_aOL%!uuugQ}G@J9qCQH
zC`i0(Eppc>a<>UOdhYgUfrB1KI01fR_*ZsCv9MqR9oestC$$X<zwhFnEVnAbPd?`u
z85+m8q67}XF9md@5AmWPaeM=Gs@$!L+~);dsB%kF%B@i;H|MS9a!Z3;s&6t#y`NfU
zF1H<!OLE9hI}l5}n&2nPZDAO^mw}&JZi@w8;zdE?y~HB-H3jbuK^F>d9`L3hpY&U;
z;QjNZX1tY<i=j>+NW6apomxNMQSg2r)DrL4IKM#qvRvRG8VVA}qZWSq6@EJfT__x7
zO1U*DI39e^jH3y1Co_rsB5@pjz>MRdBKI{#Zj0b2%WV_*g{p50z)vl=Hi4ITQIL4O
z7P*I&a_bayq3~8Jc<)f~rufWw+aY%*lgKX;?`!ZswcI|0+$@lgAH1o^bqanG@6j-L
zecYb|<@=$)OS~vZyfqfNX;%l^)3*d&D7?*zpWdV3U6E(T`>~MAgyJIc)`3pNI~8(C
z4&mLS$eqgh1#sBW*b^PmP>?vXEd25mes2ppdd@mNeMrIac?HJ=I3<#S@k>19&OurR
zDR&&`R2*|4*99WNu@^DXk=!3b4)_IdlnER}LqYQU0q9hIOB5Wx5Okq%Y*BFBrQj$Z
zXU0(;2FF6ssd8%+9Qzcxy<^Qd9uhc+hJwWLC(x<<)+spl3%XD^b^wPQhkZf8@$1EA
z92+2aJd?;T(ywj;ohtVsMee(b+;;>&S&w#rU#NDY=SDN$T>>xhq9E}e1f42(1LT5~
z`N3}mT`0WoDCKsIg7>pmnDOqh=qK^s3_4ZrRt4`NMegGZ%sBQ797IDw;&=>nD!=Ut
zzuybGP&j&&a=TZ-(SD5?$3e*bkV)hhDfei(S?&(VEd&YGqdy`hI+FX0;3vziD=Boj
zWr82n2-LTOprhxB7X>NTWs&=#Qf_||bfNI}E9G{df;WZRInZt#hTJSBkzW9Z1*f2s
zIN~wr4CR0K&Nt&o1s&;gRPd2F?g5=zZg${G1P$5mJ;c&}*7h$R?U$@?bT)+O=+g*0
zAQ`~ng4`uY%OG)l5B-!XH${>AK8U4UpWr9)t_g$pzgL>^t`~TT7X{)+;a{Lr<x+V|
zyeE(^<y!G(DtJp3yjxL7DqcV2qDu(`iMI%Js@y!trSc#<{|&K}yHW6ycz1`v`^SsS
zc)J8%;zdE?{a?_ja_1;`{~_o|4=dg|3f>Y0@1o^qyayoHM*>BVa+_~A%UuY$ZqN|k
zj}S||3j{xjw{TQwf8KJN8Sg^Sk>13Mf|R=nbSmC83f_+eT`0VZ6uj#dyvHsv<6Q)~
zfE)<2d}o19mHQCnk{rT&60yYl2f<I`^@YLvKeNqvn*?6sMM2`d4|J;B4GLaE;0T3x
zxq|lr1#f4W8Sfg%&Ez6YazB`7mb+DvOJ@!w-j@YGiFZpFyi>prj|JM@?E)|Hq9E~3
zvdG<`$aN@kt^T}D!TX?~Bc3~R&3Jb}Zm9B&2c2r?-Aeh!DRN&B{3PBzVenRa%y{<;
zyu^!w#9IM6Rqi_q-VusiE8b1On*u)Me_vMcUQ}$xdk}J6Bv1q?cOvLixd#=wNs8Qu
zi_ADa7C4B8g5>uA=v02k75j}+_*rqZD>%L)=!oab7npI_0XC6I<QFNo19Ym~4;36^
z6uG&aU%>xTz>n$;(NK{5axDDp*97Z1okb<OQ1xxMg2S)i=)KU4Bh7*X#mB;*K&Rq}
zhg`x-<vUK1yNvS-;Fv0K5Df*1W2uE-nu6m~3O{Rk98hpPs^A!xWX6#PxzSuCyGk4v
zfKJ7csmOIHa@PYKk^vlZ1P-F1AaSe%oyu>j!Y@PNXT@<`!SR@&Bc89unQ@dru9QV`
zC64cdPL-Rd$epCfoyhqGaFhugL_<OHo?ziON8xvo!q19BL;ntz%n#_SEb*hy!4+m4
z<sb@G9tS|D;wVw%W-D?hbAACFiv<p%p&)T&Sokee_|e&Fq6<|&Qh-B_C+8_R95{zU
zBINn!O32M5fg;HAxMz_W$09}UbVcreK}Y;#`@9bPLXDsMuVZupynfJ;-o%T7#QP!W
zRQoM~Tv;!36}i@Oo2uaT3OeHXM2Q)1E99mziTon*P5_-Mcex@rUy=KW;3x6!2!nUq
zTr=KX0x$8RK)O-*Ht1BjYZSS3CZ6a*m2ZiH_eKTp-Q3QB^4$ZunM@MDNW33hYnJ<v
zQoi#12FYy@{3PDvVeqa5Kd2EX-+qCYcu|meZ?nkVpx~9~)<fZ4qTszj!F%ba&E>0&
z4vqIkEE=hH-m1tg68uQ6NAQz)Gr=#EKTiWc6|Wm~^gQvRAn{JI$lamHmGgj5c$*Zw
zUsLezxy+2W0CF)z4+L4hmxE5lyIUz=*&dMG9}0dF@76GQf57b$DBpI0mv~W-c)tfa
zRqi_q-UR|jD7+5=udL^fD|p{1HsgH-azpK>e4o<=^y?D(U1`zpCD5t*9aQXc)hYDb
zq?E@}MZZ7Sne{sWxi#D*Cc9*SPL+EYa^0ZFK!M5iCbG*x!B3XQ9Dohwe@lI4|0@F>
zJx{zS$ny9s=v28WsDIMVi%x-ehl2O(3f|5FGv0E@P39um6>wO1f0kKpCghTSgjcp#
zlzv(8lXz>w;GF<|P$N*j4FWImq9E~(v&fyQ;FafmNv^g3ct^q8s^EPJg+wA`f7u)c
z@4M5@c;_g1<+)9g+bZ};ybp!Jn+Sd?-d2H^cu|me<1KPa6ugxJM<~39ffr3QE02wW
zj(GmQ(2REr<hpQQ1}XP<g=V~q6uH%k+>1bmWT4!32^>U2LGqheXy#X=*soUMXDzpW
z1;;l89r2uwdPpK<x$S{m@_QMi+>1e{){o^14xb|TD=-$40UQSe4x*tT`8^0amERf#
z$88EfD~|ZAV0mm3bj0%)7{rkXiKEAYL)N#SfligXPQfA1`;Z^xaDD+CCj<_np&)T&
zTlj5IaMYgyhfBe+S;6s#k!BqIkQ-|Jd<b+Zj!lYOx$jIk+?-zkhlY71-6t9f630{v
zzpV;CxgSc;S<53&!SO8x$DK|y4hQ5)StM7M$12dNIJPTt?^Nvf28fUh;D{GEh=zjX
z{W|DWemfL?a-S&_jxyjtQL=jeO$EnKr<!r3KrU_tg2ZtpZmM!$gIvjPje?_7@RRLY
zA^61yxCL?i>S8nAg#s_}q9E~hgHDyZA97{C^+iRlwcIKdyjv8!xlv}kiy*g^i!{l7
z6$+?w4?}JND5&3(`zd7SEWuCWJst*c8TdhsK>79yyu^!w#9LyKn}%_>#QUXF;B8j$
zKB?gSA?g>2knIK)8g2!GEZ;)hRPjz#<jQqh!n;H8lXz3XFI4&dn76wDyqTb*=ZO~u
ziT6!QyE{jbE7#ZPIcxd)6}(R=c(-Mk@lJ)@LJ}x~#5)CaD&B>VOLC}u<$4&UzXdu{
zS>jzD2Jds}=JIV8c!?JUiFX_5RJn^3ymH+q6y7!k@6+H({OGe1{T_*s<=X<eB}mI4
z@t(lCj4HQA!Mj25Be^w#pTxU64Bpk?hsOft+a>T4FA5TGqebp=1@G4txz_UC1-x=x
zvQ^L#&#CEVyaymRRR56$Iu-941+N_E5Z)(UW*j{N2hmWFI5xY?{MIS_WIs*(tT^@q
zhpfNPC^-K7WiyVWkUN3|iXhAFAg2r1xnJl<eGvtz-vQ96cpp;q+alzK((f?z154)j
zpH=jGyVk6qhIP#iOd`KXxeGz3%H06D1%jXSQ<A$&@RNSE0sKO>8~bX^<*@~H^gQvR
zAm#oXbgJBUAlGW=P<TI9@P0?Zd-)_Y-Zsc3|C2$M$M-VLat|tY-lo_&U+|N7UkiiR
z1AcfcP`-NvUgAYT;+<xZdsxA{U6E_`zmzG#@@*4z#PbyZA`!CP=pwvArYbiVbgG?c
zU9JHH8Myy~BKLX0PvSj1Hgx&6;~D$~@SXr2l@sxzAn_6=Rc_6qVEMj?JfaI#zEgo$
z`oXh;j%b%d4vCO>`;ksVS_Y`k!ctBb&@Tn&a7fO}^e}?d@3Wv&^=pEDL`Qb{-YN8(
z1N~%u`>vwj$5m$i(jfO8CXrvH+&a*ya@RnvtZzFNxgQ9AvOJE0U#R-_+e&kJd?@e|
zFA7rbuPe=RcPQoYnj+Wge~T2n(oc!!-M5(WejEmG-x9Oj-3s1LMQ(%OC-Lq<;fBJy
z9Q^QDpnUg(j>?UAQIL3j7P%iQc;8gyTJbJd@Jc@=o}andjQ1eq9$*srMau2E$&5Gt
z`e6CKrO3TT@RN9Vd@3~F`QWGG-32<rOS~vZxuq7lC6FuY(H=#v74JF)@AHC=cpm?Z
z8Sfs*-NPjEi<G+*bgDluQt<vvk^4u%PvZ6Cuvw_`J;?16DBn$>BfP|mf|PpzbgJBk
z6uduI<XZ7=Qt-<5k9gi#X~w%1a=S>N2vY9b6=u1c6ujMv+$$?NKZ&<#LTJ22;D^To
zcw0b6c!?JUDfiPBx%(Bo`xUuXygL-U)OHg;`rMUc#=9PJ$zNoU?dgGOX1s?Xm-Nd3
z!MlpwdcjZPZ3Vwj<$Edk;jsYTtpYFcq9F0kvdBHI;Qg&4*NXQY1#gF-Bc2zgnDK6h
z+)(qVjibzXKUU-(Qsj;l{3PDpVen1>KRgz|+a>T4FA5UxIE&o)8-n$>N0DpAdl-13
z3M-Etf{u8OzS4~M0OV4?C4(&AI6)_IoCt#>ZJ`;*#{$RyS#YF+E|!D{0ci@3Kb-<c
zzk=gA1;=Zbn{n7(p~rQvfKHV=RgrsCkvos`3zSDH_>n&o4Fy>qb1nSlfS>gH_Y{8C
z@`%q4mIsYFh#!6OYs@%YuF&%Z59m}JC5qhl6}eyG@5KagxWSL~BN_@Mlfr|bQ~51a
z`2AJkXT{-CaLDlx@toi?<0wEn)ckE6?yGVaDRMth<bHL6*{=%m9N{1u3KGX7pi}uR
zQTTnR@U!B`0}j~_eqYcL&#9LATbV0#d1P4TZ;L@k`u)?Q-+0UXtwzzW{}lR_KtDO2
ztWosa8Dq9{CFCxETp48jy&QC^U6w<x<o9ny?hAsStmoTZq1)%5qA>ATz^`5b9pNQj
z6l8h41v*vkI>?oF{;wj}S{_Rjysrp4;`vRl8SgGv=>Mk>3p!Qq2FL{|YyWf@g?N#^
z8w5Xz_d^hc>W`XB&3LtR{yg!bAn`VVPL;bu!E0CKTJbgkuWX;?_?~!rFunl%z<kC5
zxyd9@1X;e*K&Q&xt;mg0<UWb<8TbXtEluDc8VVA}X3(kp_JbeUD+6?~3O_53^$Lz3
zKoIex&vO&aI5LG?WU(N`YuiAl$~~yarT?);yhx7;oL>M3tryXKqM;yhjI;1NtneG5
z@U!CBr1;;h3XUWwhh(5U@*sCAlgKX;$2XviisQH<H%XBjBlt=Gs|3GL{x=2uAUA+_
zIp_#4@uDE{PO`}T5OQUGOHt$=dW7T1<&SGk;I~(NrwFpx$7+`yunXx&e(*4eNG^ST
zww}}5ggzx1=6Sc&?<b&B?P9+%_`X%DqMudnE=BGWirgHF+{!R=vn_I`Dssmua{qEC
z$AMcctN}l@JjgB-Ud{vE!jtv*+Cu5|pi_gS+fH=IaEnZ$`<6mTdGuMA&tsW&5&TvS
zlHXh4XM-QeJffQ;6Nn|<a<oGd17*Jh`}JV%P5GDLLghhzF@4r7mm1tkf`8}NnR$6E
zXJ$cxpr~|yv2>wV*QG?_ofVJ|)>;G4ih{}rS@2ifC|X(5SYKD;%JR7L^K;#~1yfy1
zt5((4xawEB8uJQf&B~iqGsRWCylUmGuGO{dhjd(?Svl^UTvwK_si|SrCDW(lHxY<O
z&aL(Jw=S<;Rewigb!|>{{fg;L_4UiEeN}ZUr!QZ=dd0Mc#`@c8tD9UkvzHajUY1wm
znK^UjjGBD6C$~1g+C4jOcK)&%OJ}%it7~V}<j$CxJ4GwH6q>UCMy%-`e4U${gMSDe
z?TjgM=&^>=7O#)cM(T-rl96mrF-B__*i!Wi^|3~VJ~?OyLd!x9{f3K1n$d5~X*u+h
zHnok@>KmHy^FXUK_9J&yO-+q;OYdl^MS5j@Q*F+?tFE7hU#O|RUCY7$-^CB@A--z`
z#e)rnAcT(uf(xpZ2U0;FA&u#SE}8{iP9lLw)>-ls)z__b5;=wrjGtSuAi7Y#PWkc~
zBK;*@lpyn5xTpF$(S`E$GTc{vJrN9;&bUv!q_5XE)HYTz)92JrhZmpD*FE{}+}Sh9
z-3Q_8G-%YcfUkGhbnW*qN55eACYLpr;1v&_&986MTqpne-;?Wi9_rQgxGUbiVAsEG
z$-8^CWLs<O{JTnGeX+i^#g5M3zfM&2(R_B?XW!o5cxed)p!s0?2Ss1k*S5DOtRtZ^
zbiHgqUJS|WbLcK_VSnN{de-HA{b*MqzIAGyH0BHcY@yH5!Jp`QJv3d*%k^HOc>QP#
z=Lmj|bzg63hwS^??cVgV1TV)M<##bk!)r{7>(ZyCb-U{H=KFj<jd66&O*7gq1hSDm
zt~%T2i|T%dds<(D9)*1E(OyB3B(U3ijJA03-Bo97Pj#m=&YXW#s{?u5cJ|Kb_I75y
z7U+eg2CWjGVtg<>61d|`Hls2c<xN<y+<SLPvM<?ZdrZsN+l%h)u?$6qtu-njLza)$
zN&IOn7RsI{Ubek3t@lKn-TSGs@m@b{lHlcDFsj4NIA?MG9WL(__ARxi*X!|?vG0Z6
z`7GwCnH_GQt3z|aQ?xCW_8ynF$eYdbZLQG(z3iQ@9~~KYf}z(smqV{H_>_{Le7C&?
zUju=3yRzT@@K;b?Q_4nrM~D(j@N2HUy-qFO?`(_p@9m9Ap9o)y_9u66T@(7^9nNPx
z-iy73O#0^jcx_h<?BD6=gZHOvlgTqGJD}&XD6fw4f2LC3M)&yhjvoCv{w;c&OCo5a
zd?&jmC?#ohj%dH7-~MHZ=bO+TT{v6IpUW^Mwgdp-3;Eyr_IPiaut&_JRlY|%w28ZV
zwHfzS?(5ZzH}HvR9j(~QA$&!Djy#QPmf^Fv@$%s5{k;adwbV}CrA@)rZDiTH^ekI9
zX)Ql1As@#Ev_gEiFPMFdbh9&yMfvC%*r&WbP`}Ky+;6mzKWmTjezPpiI|gO5o_Wp!
z|L8~e_KwQmh%!m`kAmM2FU^(cr#Q*)Zu6znw-IgbXA{3W#XIIi`$(gU?&v*qO>A{_
zB)289^0=~RjG&Hh8w2VhP;W6&Z|-;dclK!`|J1d)zhKL=DBoQ#{wM3=14dTDzMXw1
zM~>;**=HM>yszS451ufx9GyG+^pWx1<9aA<%etVOXzZY|kJNve*fX;GQ12N1P_KL9
zO@-x!j=5uz&Oy3tVtL_BNGEqscE$RW+hUn^3tE>3O3CQFqW$%w+DPsPDFQV~(X-;a
zY*{(o?a_bUPtq>y&O*K5wf4}FhUnkzcSq0Me<JD<<QgLjPu$;<(3cuJMbxl_zD#G4
zcY(K@Sux9djW^djk$vZP%GmdvN8Hhg`^R*QIpNS=0-BQ}FYGQvedSV)ces37)_1xS
zdq%sybtK8P`AATMP0IJjkCb$fSBVw{&n)P+^+-R{Tm~yao8S8(hD`q0=M(x8ousSg
zvTxqo8>{j5;!7_Xt>v$B?d}tL>jI4%$QLk;^^J?sif|<SIgTVAx;F1Lw(;k?nRXJf
z_egS^!7OiQ_3*MIT4y6V)Ea!&p<;VkeLK+t_YMT!*J$V($+s#iUEZ$O!?lCd*4*D7
z?Y*F^)teG%38T>3aO6{(ZT_Fez#+YkPG1`HShu~?V7lz>*IJBiZnPF0Q&ek=;v3PX
zHUd)}wx$uPeUNS5`PPHCQ+DrIF)E1hSNa+{x_h;Bv{dQC(>^VOT~5_Lb+U0vywJ$z
zPhhRo-d??2M>|dBVebDrMISR2e1rX;xgE3mN4W6>$xiU<-VtTw8N7$|F`4ACuARO>
zZR2-CX+q;n8t;W`d)K2aO)ZNT{A2vlXh-dnMgy-6eOn@vHl?|ZjZA!L8O=}n_F)84
zB|I^vTi-6M(8k9dF^Uh`J7q7Tbz&=#jkAMeEVE5`*?%&05&cZuA5kwKDf4?D5Z0;k
z$2`8bH_G#6SjUcDCY4!-d_c=IHc;$gwYA-M^@m!OqqBio3BA4h>JykrbQiN)d#JZq
z-;18}>VKU4T*adg_cs^q?Jcftebw1kyv=x)xEQUKuWs&d*7dB3-C55X-}Q+R&*pxu
z{68Hhr{#7RP1anm_q*2eHsXnXEwR{3?Zj{T9hwI%MJ)Ox;uH<pGrNq|OIa^x^H-o%
zv5WSMYg5&FQ=rYzJ6+zT)T4-zl0Gd7eNh(rq7u<JO-H&A=_R6Xx~MzJrS(*}oZ#wY
zt>iC{@bSu_US|L$#!Zi3^r)8paDQu}d#3}G66bof{k(PMPwhBT@!lR(`HJ_-8m`=5
z@!tA|pZ{u6&&g?{y5ly@-CX`n8V_n2Gnn0r(x!LK9Q*ff*-~N-k@>qLhkE0oUzX6f
z0QzPkT`2T*gHMr{d#vsr*`-Y~zD9PkVLYa>5rXcvcgcHi9dU>fb1*DYS1t29N9MFH
zeqwF$$$u<)!QTDp)|>GCi~qdg1$}bvkyw`l)^IRueD%mo^b^_mRHCm4HQuDQAcf)K
z^(S0gK=p&>5J_b#gf~X{v)FTn7?atbIP|^|_hhA(zWaSG4jz_df0VFADdY3t9H0>O
zF<kpZvf3akH!xqh$RCGxAvSY5Jl_#$7c^Hi>z!kOH~!gZjH^iA=Ke&DMuG*eI@+SQ
z&FD#Q-ojds%Cy(}3loXL@e*A%UsBfiZr+m}LVeiV8?6V+(s<VA<rab0gWmy+BvRnL
z4&g7cJ-W-$V~EzrAzB~Jb<q<s3;1m1!D4%7mKeoqox6ee6@0?AKiWj-)CmHF_IAt(
zGJ<y~&D*E{zw}LozM{0$PAa9VPn>k~5sd6Z%=2nFc6jdZYj3f8FA8|fy#ADU&1J((
zNl(w9-ZS7eQ<{rD&<)w6B=n7o;(k+<7T4AO_m+y}-;mrW{}nE~-~MbJYHM_lUCfOr
z#b<Z1JzBc`Yf~1vyqGa0Jy~gI_3cJT4bFIt&ID)`oGCqyvb`T496QlYF%EkDG5G$c
z%e2XIww~l4(RS^wOMoK5pCsmcagURh@$kpEXQiLI;HOu2xppSB#W8K>_vi)x$%;OZ
z<cjhqv_-Ldm-j>oU)_w?0^f*<e!|gN<e2i3f&4hu`fo-Xeljbj%g7qrwK%}b6?m?&
zV+`8d6qgR3d<L0}JZ{5;jx68eopEAh677w{yhduHO^#x%S&}l7)H~hYWEv;FD(8}a
zfo%@sLu&%uMlCJ)8VIz;v8jEOH&)cLagW``YW+CVY&)&JMT~<o@MMa3T3rh{7ws5d
zV@e?J<7-T!HP@5Hm_=zT^v?EwwVWu7wYPUM&E3#B*jAW*p4x(kFmB2eoZ~QBcf!*h
zqtkIG20r3oHVKZK3O_iRME+v;YJs+IR5vdVswFJXZ$q0W+fZuroLw>Sim09_;r%h9
zl;cb#xZ_{zpm)4z>AnKJTks(t4>jgn+b(C(kF~#AY4^GXh9rMXAJ(A7_?FfOuqIHR
z)H+QW9VD~a=IcjK6zc65-OMAc5B1x(B=n^?Cd@DN^3}M6K38mpuSm?k#x6+cn;JJC
zD@coZZ}r>-^RERZ@4H5{-6ZNWtprB<vb^o{7UNTfPa!^oSz*vRe+aD2_*CLU^Binj
zYA;fZxtaD|^W2QL<DZOirtDK(q6}i-N73*jd*Y{X#}@FTv1L)|&1|KU#*$?9DPBJE
zE9=0@lAl^Ym-oraI%Z*K&k8TMu5DYw71UmSo;}NZ+8AXuRUMz-1A8^#Q-cr9U0nEt
z@}JjUwqw0!MA@gj@E04eS-RihO@bWltE8J;i_?{Hhokc~(H`W0Z@6(s7wQ#Sb%r9`
zoSA6WqkX0s3f1a>%~HsNf;J0|I!Gto9crect`9myy}uUvmEc3`gW=}v(|WbIAEW+X
zQnp@<#Y+7nF+NI|Gz&V!2YNbfvXk`^aefDj6Z+a>WBtDLGKMfwtTJJwwrq;m{<s{=
zM7KG=n=V!?cssQj2j2C9|7K<FBibT`Ht|^pW(U0gk+fLX2W|4cL%oS_WIc!3M&+En
ziwo<pl63!jhQ98-cq3`9V=iy)qA_+i{PAK;rMXI#7SZVRDszFuu*U&>#^Mud9812u
z73DI%Oq;|@W}-i;EqB*ASi~OiWI3{Suvv}lH}NB0Qw@yNQ}m=BqqSfsl^C0=Om%dQ
zR%R?T7Qx3eabwICpD!8b8|V8f#(0^5F<ujNyA7XUyB%td`N<l?NxP+5>_+~5YP%V&
zg@M_Vw2a=9(5j_}vk%R|$-l$dM~vlOZ-Z~=VEiLj1upW(wk_RtF*I_ZB)OkOGmkcp
z{G(g_9W>@=tw82QtrL{K!{yCV#u+q6(6iz&#!18sV2XEZhg|<#-=Sq**mI~iRp&lh
z68qaD<fC%jzwZcdV~kDMiO_tkCQ%Pq63g4SA7Oot+Wt0t?#3t77)IiJ1~@aYwj$T~
zC!ywYbisLulX<F#$-x?9$H5MotDwczF{dxo(%<UU674<CZCPRkb5iTb0BWOivVz&Z
zo%XRf|CqLz1?lJ$2@AhN-|mIJ1^CdIiOMLH?&L2CUhJHSwV7Y_rnpDUf2r@}<<W<p
z{<l8qcNf_HtzY-X1qnS`)<3##PJ0TeeHR%2);-Y+esn={YIUDx%ks9Q-c&>wu+omb
zGi_$=?oe&L94S29-r~KnOv`)%t=(g6y*=LliVywNI-CDmU@{)%J7a`le%XBQ`~})X
zjD`yNdg{Cd@XncA{%zz>8>|1@xPH_z=LpztZt1buxWr?>yQ8R2GxSTB^=a{+8Mo$`
zVMCs+pi`gta-UY(*r!F|d#09M)|uwjr%vyF6-W~f&RFn+V}@~8pH@8icR35jA2UW=
z(Wk}f1yz06)Xb;{_i<w%EK2<ycop9}7V>i+ElT>G6a6dliaL&s&>N1$X%5OS{NXYD
zmw2=+pGTbh+bhrm8^VX<Tjh?)+G5Nll(qKOezb=Dj>KItd;6#Must5#@ofExYK_er
z(ckoRM~l&BG-kHYD(l@YqmB2_`{1M4A-P=IUO(_b?hUk-j1TQig<4aVKKmei)>Agd
zE9+(~FgY-0h|Zse`WY2imC`2G|7}9vm=hyLPU*6-e%bDK$3*Q9jxp^$!SA-##Ez&o
z+qOxld7A!WjD3G&Oj&38dv?3l6F;~9grQ%9(J}QI#I-QiW@I&Ic(?g>VJ)yOjc`-h
zQ!i^1Gjci0iB-m`MyFG$4}9F#4!ptnSW63%fiM(v4H_#1*OSHgD&+#$D%@DXjxkm|
z+r!d)2IgUMU(O~*-#hwFx@pfV=80%!r9rNA(t7e@e1hYL(0$ODKzmPZXzs32CXIBq
zDrNX}=2N_%)HhzzVG}bx+1|%&j8=L=sly`3UvLT?WW9a__4+={*sn@!F8QkW>JQ^H
zXhb!_pVj;TD_M`&%Os0v*dr2cV-|KNPHbp-_-Lh0rQYIQg}#D%E1Jn@u05z5e5@bU
zO8I3SYuD(r-+nPJd-Q?Z7R-O~?vm@5B=sBsmAfNYM}9_iBpvn9iPgd+Z4&19leE53
z&b|FvTX;L7d*l4}jpbf_;=}#!a^kFI{RE>1r*2HV9wou={IL6X;M}t_uC=Q}bJ0!_
z>W1d<JGb#smkVpDH={NG!pSJiP@Y0PqUUU_g%{fV%Ze6xzj;J!#p-S2TA$XuD@Mou
zt?o4#4&A-5%eG0+^Y&@cSN8;0IZ1Qk5$88B3v_Pd*jqYy9E%-k$~DvD-w;i9vo+Z`
ze~R){IUD=L__NRoMGH<^){!pGE328;I4T!(5|fFq?oR8{Go2QFY@4|4M<~4!t?qif
zBUvlv=;ZVLpjKKY;rR0rdN+*Tb)ol(%kjAceiW)bqJHR;ws$Zluunp>0<6@Rzv8p|
zlhH%jL=P35k&8Mth<QOfo4HV(GS3Ul^;)*iw04viSOrUh9*Jn3N2Jp{J0UPLFrMG_
z*K#dB-R&*>Xs@&Iqc@yWnhQUA#7R4Sw0<vl`cTjFGrOWOGq-K5{AhDb&q;UoM<-o+
z&tKinQGfA|L+?H+3UM+%lm6nrl+t#5*L~WQOr)Rux8aKK%<_)**8KH^9@n$d>t^1V
z(8fnJKRH=}zWAiO1X^G`fcd_<gQ%_yy#xF-&!+KzsBwur`_h8FdkVDH6Y8F@)5CtW
zJv3XQ7H1@^Gy+zNPt3!exWH_|bEP)fv+xTgYf9`nF<p!LC-YurCXH;OyqH~m4Rw2&
z<MHU{X#7RB!OljdQRu<#&&rh)2Ub!>cJ0|ovncdesL{SO%^$bT{_MCb3dP(wwdc_L
z(Q%H}Jy?6&!&c9UZvtCovp%OkTgYVbwrgZ-oHE`^r2Z{%F5|bbgS6W&eD~p#g%7u1
zVhg?og7lwt=--nA`*Ak5Dr5M^_y`@w5t!o}-*9>3WP9hr_)}}Ew3*7yuJp3xvm`TI
zxyioZX~<ozjD<5$CgV^h7p6C&Oi}|QW9~mKXj}L8rfK8-Y0uw2-z`>tve3TpalG66
z{T_F7LSLa1Eqd(dFjmwSy&1E&H|2@F{fogh5pkKHRz7*#K0^3oG`Nm`;^F=l?NILs
zjGNN*G_m%zw?EI1l_l(J#61zUJ)zIx*bFK?tFX({+|KqF8qyB+j!%yACzUwHM*GXf
ztaxv~gRQRF{EKmpp_rB2=6)AeSmV0o>7qEXBFlYf-;u1Hso0^?SgXIVCu)1*Hhm*+
z#Zv?&PjL+{#10hZ<(l1ZY@agUC2SG(oW3z#tiz;;kpt(?pGD8oL1lWVH_pDLctlsq
zbL)zuyBu?}gx+zj|2UGejqBj-(ViI7dg%R>xb>Bq>ka0gDcTr+92;RKvTF*vW+<yW
zM(0Fj#JUe{`EGok!RMRs2byDqYuDqOyL<JCDJS$Od*@Qe6=~Rg&ppkVoH%`r-5cfG
zGv1b^?|a5)@6l%)Q%3%>%6HX;&lktxEK2@?Z};hrXZrNm-yhXZ7_k$_8m^0abeA^C
z)ug#Hd&+Q1gX~dQI<Bk8yOw<~O|z$OI~Jv-H|g$C0gBX)!qV8TsC0Yajy*lSsWeUR
zvAJAL4dZtA8s&7VPs1)|__d07ZxoXu?TwX3aYn=3u6Mx_8;i4OFQgME5j=0=W8ef~
zQDwtCn2_xiQ9I{cqhIp-qs9rFBf(*_QJX+$T3+w&HQ4Eeme(Kf#WpXQVsz7Kxf4fp
zT;In$0NpLCpNYf_f!a-3Cm(IU*IQL4XQzo+Wh0)hj&js9`t}UQNUn5h1s&Hr#JC$R
zVkuUQ{WejfX!Z3_uPvF6Aj-=U`s|M8lC|EesO|M{?w_MY(+RGu(yl`9O^mDY%`q?O
zn><*7(kJSZxVQRW)ldUGUW0bYPHw>**paxlctTfVzdcQ#lF?;Mxv+anU%VdsXnDUQ
zKIRF>*cg9mk3MNk&&&n%oIa6{&x~|-UMwAFJSRrA*?Zgza7{Nvt~QBl`4V<<9s2s>
zDP8Zyp#6xN(3#Y4pJQD5(!cKe+byw<v06ra`r9~%_;$a;Mf$`%kyWCX@RkHmdUq5@
zb;<f4pZCurU+B1Cez~ZZ7+1RRtcGW`a_<OHPJEv?(bS42DYZxIY(c$AMfnsUo{3K$
zzIWmCJ$%@jbBJ?52iaPwlPry1PWSt~8apMRoAydv-h*OoG!wj1@Cmi<$j_m;FtSJ&
zYmPSXBlOrGP29sqs%4Jyj*R9i-!CyMyT%ba*5yUto=Y^m<!RX&9RFy|Ia&6ugg|>G
z+d|IM+@H9-_P`ojGxVc1T<T9ktr^g`@LcXwt8LX4X-gd!qUN_30yFk<L+RJW#;vrE
z&PydmSP}EyWWIt#{k@T8?>59PngNf&*hq^}*0X8lobMAA!w$jqZ1X-5wF~-0Taz}i
z1wW<rqe?0Xb$lds39e;x>xa;VweF;uEu?0lR<gBDTI&nvPkj8Yo=FaE30u~MSfxwD
zJj+Nv)N8jTm86!eFHY^!nx|)t7Q6RBuL4DKQc3JsXOFaAjIf>!D+_krRasSOwId&2
zx0vi`ZiD66h_Cz0U0IX9&+~B!zb1Cz=bKznJy~A+H<``H>28!DB&(xahcZgiI?ExS
z>UXHIEtQkq>sn*WvK`><VgHfn0=|MC?z{#)V{1n5kv!^zZnt;d<S0%nPt^;;(F=?Z
zKZyCml)(HUR<!v*gwuotIP1+vwNx5*6J{4yE_vSM9=VGc?LzD6co?G{TGc_%upVo6
zIzPvl)%-l0<F8DMZf!4ibn&}~a0a8@>nLd%r%}1#d|_o}tkPPE6&x|b-2!{jI>)KT
zvxH~D06e~(;gO^=td*6c6&!?tMp@AU2~db}p+p^PDqHh96SZ04%2w8cguuBP%)WU)
z7_>E8?+xv@ZtxD)|ImI*?IE3v&?oXXC(4hJgq|tJ@CSDO3Mpe^x=6R~^!e7~ltB(w
zLwM^=r?~X2u?Ikx%-SNn7hz~oJ)_aLP7$lfQLUrUm+_PS22T11_w>oq^2`)@MlSUV
zGpJtBN;W)W;>g{<Kk_(mJcLgRK3CyWhEJ%v5VV(UKdtLyhkBz<VXs{94QH<+thv02
zzN^U5@vpVm)8->AKE~o>qL1;;z__x>>_lFCI`yhi{z<+Y`W+(++1ngtrK9&Hm#r<G
zu&>e=pU&?c^%__&neXMN#_0V3!d}R(>iZF7wcyz|qPgMv>qpl>-|_f_+Vi6G1tS)&
zDarI@`fM9;(q&>-ujY#BADx!sn^-am=lj3YH`*Xh=98KH9Tu%~rpXrOzJs?pdZmNu
z8U76MP>wO=xbxfX_jw=1xkowj%=9O*{wJYtP3)oGq~tQD)5tb%$wR#(lgEnMxVitK
z!o9ttzh+Fecj5#i^`l***|Y0AGJ6u*Ca}GsxVEt@#@uJ(q22_xde+uK&)QG?m!9dI
zAo@GhTybYCyCZpNF058*Kf@R<v(=~g{Ul|~7Ar=;hk9cJ`o#ovj!7OZ+D|&YfVVfC
zX+4|!YcQis?TpTv*0rwqVs@IHN>7frF^-15QB2<+)KJRfJr1y94--#LJ=jfL_?X&>
znW5BkvG;N@*8KL7Wgk84obOHOTj(glH@8ol?5Hfba`yZ$l-yPFptk^Y+N0?`@;#SB
zy`%JOG4ghF=$DN|PdZA!7Oe@%FU0#&_>GH++D1yXoY1xC5?(&AC*Diocn)-b5Bnxx
z{AcwG<6jEuG~voGl;mKYlJ^_>W&KAcJU90Fc=Vfmej#(L7%%^@<b~r$qNiT|;Uh2T
zfwI)0g;TCeWPS0&wJ-b>^P9^s!J+>R*AHJmh|m9un8vzy;}dEQ+K+KFYLos%aq#Sp
zqg!uF@{VOT=RGg=P_`$cAd%ipqSJnMaq396$zadsQ>c}R+M3ukYeA#A8s_OI{;L~P
z>{!D`3q$@T`f|0s8EPFw-HLmxolbO@239JQ{5tb&%!rcX**7}n!&gx@<GiFXB@H!c
zDr!YqchvUy=VX6pYm0fFmlDnH_^8A#)*E<vX;Vw#i&Hh?V#B=CmSuF!?y+U%b|v(=
zW4VvSh<Y1^_bTEY7orACP1Nx&PxO>=U2bvexKQ{9$>E#}Ugb~o8UX&H*8HC2B}QX}
z8a*Yt3%yL9y(fB#-i`gc9xc;+?#zXAXTjFi?)@u#Wd!^rTw5!~N3TEFt_SvWVzJIg
zUe88DV*aa5TIo&faf?+H8u#dICaw$HM2XYCv<AfM#?fwd?4V<{R2@CgeonZtLl4Gy
zPL!rYnc<N>y5g0N&WG6Sj&LQCLn6pIKHmKR9y`w8%Q3A9k!YVZ7e-~&<43KavyLcF
zm$n<@Y>(HqnwNm|2^EKRuWbqBhQq<<mLmcqAe$HgNxoc)`aYe3y@cSLkot5Q2Zow&
z(K>hZMB8c`#vpUi+7(xgt$agSI|-I+aGx&L{|6s0S=T)@^4pJ5E5?2ptI#Ro;Mk8w
zt1Dp>yFSHBR&lN7{z)qiR1T^=X!m2V<@!n0X&TNQZEauc^<sUPPTAP|(u~O%&0(;H
zk<dgx-Y95DxF7Y-v%5Dc>E5Fm7>7AEZ-3&1Xttk7JB<#U(@tmBq50UGFWRz4brru#
z9;Uf|it#0lIqA&=*Zn`n3d@gsjf~yB4hQ%o&Fy(|X{hr%RL9o!yR|<o)uS)&vZb%<
z_ax%XVg}vAch?`5l18+DoY?W7Ec<U#(0`@q;EvPY2~X_qjZT#Bcsa1@>Jz$Y(A|L&
zkJh1;9@S%aftOasawnR``k6{QqID*t4Iw`dHD1%}ocB0xqxV<zz6-VB`rW<lG^)M7
z{U^P~M0zI~C)*4;QkSRM?2pNDuDMpI?_B9@1le9_wDYr(h0ud^Vf8`}IX8It$L;pV
z=+xAD?7z0Gl4qw%u||%v_^{=3w#TB{v<&j*Xz$4^)c@<hT^V&C3TqR&%oa)5U*z7N
z-V8g>uy3T(_IUbUM`vZ)=hFDIrKUNYSJ|bY^9JGOa5M(BH5dC1!eTc&(8KO~V61#w
zTE@K2o5!wl-v_K&TleTovPP{#Yp40DeKgA7^*66AqxrL``(j)tbmOT$J<8GPob=w<
z2aBEiG*{y|U~tnpN8Y!&nzf!?FD7Dqv&Cm4WLkQ|GQ8`s_IkeCL8nrwL_^J4jOKkY
zF`d{E@7FIbs%-IT8O4j#zMe`S`$^65-d!<ioozm{_7-1TrRLg?wf490akYe7|E6&Q
zcBVxSfOk+>k7Ts+_hLhjPiQ}e=0FtGzJTV569aug6wcVBc3{po2J7!*rue!$QqVIS
zQ=+=5o>x|$bh#Qbu+E}QE`8$yj2U&Y$Ek~XD^X2uNbE_i(>`n{dh+ir*E|?!WZMrU
zEQpP}yX2ZBT8|?gr#al|;ANc$1!s@zq2pqFXw8rMuu%53o++lcM5slQXNoI*TLN$K
z4abS%F++T!_y@qb8lTVNvk0FOeA@A$v8wevF`uW=`B(CqF8GR;ey<NDmPBvitgU>i
zGW5HjXZjrXRfjmYU|>|kTk~-H7esIOI=l%?zu+oSoH&<|iglyu>7=`C*Id{M3Eh_u
zg|8ECtbXL$y%%zg!n_;H?Q{D7xxne{?#{n`=8^KF+Jpt;3y)$pba8(--O)R`UU&J{
z`dr@i^Me2BAyk`1cA|52G*>Wuqw2D~t@AM3a<#vX8tBq}SJb7mmE}~lF`>pev^R8f
zD#OIyBBFPOsMVX+dopINw*b31qs6*?jQ=;inuFfiL%XLXq3zq!r`sK!SHE|S11(_Y
z%f$=2%0!#q-eKSF!O3dg2GXfXw17IjGg6fnwb9X8?BG2j&(G=k_OWQ^)??V&D2+oK
zn(jp#+A<eysN<MZGsbaRl1%Rj(*K&E_XG<|o-ej{jp^6Np?w_Je?&{y8;G9hej1b9
z`O|*8R;WGDPb=WT^;5mG%<G_@H-?`iIe_{>eI4(28(Q!+5XiRnX2W}*?@y39H%)VW
zxj5#)wLWc{1N)0(OCH4j8d*A&UAYalxTlWkj?})yks13^;LFk8SNfbI?FX)YuS|>X
z*W(g<%1(@om2W-9_8Bz3NNul-_S$+zBcEu#UHlQ|<L-vwtRvJIp|xXuaZ;DjJUx3v
zH;skX7vub4Mk3a{vF7h>m}hIAesL<^efawknn`kqRMsv$m)1$o>5$SeFWj^A-UOay
zLHY>I1E}pEtF-<5G3s%Q)zkH3JvuL4-HUsM9jERw!x{T#A|LA-8)@|ryOKI~=UN?Z
z*<bS9C{w?$t_sq+R<Pf1X<-V93-#X}eOg7rKEv1IYZ)88pyQZ-WI^XzhaV+Xf1<L;
z;g#?A^q)NWMS4u_$I!>S#-NmT_u6b1;w@RezMviZv929^%fJ{0h%lc?=DkelK81Yd
zew;~237mz9!rS1$>M{II@@uz^^|bcZ%E~FeEbJ>h>GS#ODz{Yr!Pn;7R@qZo>2sl9
z3;u7C;Jc3tp>Mb~NZy{X_VBd-?}cnMr*jXTO6jzYd590~SBwbkGZoYs{(kHNzT(rc
zJ4+IRE2W|LZ)QTzaQioMM0IK1yS>Kor~4dHjiu3D*Y-QEbX<CaulA_n{l^jXLgRP!
z8b3Ofor`F+!&)r#aq#1Nv64bQ>bT_I%8wL3)qM_MVn-S6VIdcaAt?U)FpcY~eBM;<
ztL?>!IHBWOqZin-E<8Xx{x;jlaZXLHEV(;u>9IZ0V)s8fu;N5J`Gsr;A39@~LDIK)
z+l!spq2?pqtPXqn7PNBM_4gh<5`|s=Hk=apzaydcA@ns5j<;oB*4fo-BsxkO=0)LL
zLQbdVqjsLs5(h7LT9+sPL@m>JkAAB6P!{?&6gz&ob?hdz5fi<!zN8XZd=%do4AsYw
zj8R@E^)W@k-bnT*<}vjAjxU4jO=)^TddJ))`s}Y3|EpW?p_vr5Ld^WC{a+7V=c12!
z^{8W|hIVW%>fXH()V&2{p}bA7`l5dOl45)oy>E+)pHocNOFlTVpwi|uDzB*gvai@T
zxAMWtpZV_f-B(%Wd%Mz68E*U#N!_CQ6jipCpS(D!A1l&YH2Hs(XkDHxKy6Mq|Bbi!
zFPB~Dd)n7p9J`NtYm}8o!<mKT=Bi4g(I&=2RlX<t;<eCYHr^M}9>fIn=k$Mz_znbb
ztK-=yswj=ufGBFM(Sq~4)N1!)AEHdOg~rBTBbQq3`Cd9pp4e!##s}JN-cMWG?qI*w
z1nksyhw8uD;bYD#w-qNIi1+?K?!E;+s^a?pJ`gdYBBG)q#)yg$FuMc@iW(q6USb4P
zRO}Lx1r|dRljT_-)Z&{eDk>^gq*T$OrIuQ&R?(uOMa34aR<yLm`Y1ljuhnYp|NEWC
zy>svGLN>cW`kzncp3Kad@0oMX+_`h-&b@16^e$H|Xg^}j-^($ES6IBF9gTUTeC~P{
zZ27<g4-}-k_GUWgDFgRQ)4B|sjx(U_DY;r{{cQEGr%hWngx9~-zdi$Vo3f|SUrW+o
z*9*A&Nvy`wlX5Jf&kHVgiXE~0dj78+wPKEE=1;YkY{KW#mxUMOEpzXAY^LX`oU{6O
zXVY-yushrLcMx~fZeRzuUOl#+DuyhMyA14Ol(+xz1BSIbey`u3`9-@?Lx#3Hsbc7Y
z54+S>44qv5kN523_uA+j-)^IO{9dnKH|O#X-65lREZS?%ndSCZ*5{XhI5skT==={i
zmTdg>Eg!ske!8)NHr;2MUcq%R<2%mV$&l7JWu3mTkFbvW>Q#RXQ}fNezlZN?*`IZ2
zFIE+MOgnOscxPizu|D+d2i?l$+@PJ<i?YX}$gpX=24E*KR?x+Dsd!r7VdC2|E9G0&
zTz5k~u@Ym>0Uhju@O!28)O6U(p98L*kE9oDwxOtClGyd8t|0pQ(fb2yzZ-F_?4_=i
zop7a}@7*zWT5>G<fqt@S?#d||fv*8|I2_-Bnp;sW?k4v6tef%f>0x;Hv?rdl%u{=V
zu=i<i&ZgxqqkUGMDRzQ?^IyI>xW}{!!&aVFg*Y6s9I<8Zo<0N(??Aj1k#nkHjA`})
z(Z9G4oAU$l)cy2s9YlL~?q~MB)O`f$$ESSsA!6)-`$f4gUfy5o9W^cOhxVKo_H>@Y
zeZ>66)4oTqHx8L(UbCbvhELmPSQ*||=S~tAdokGu_uS!KX*&7&Xs>KfhdKKUYiUdL
zH9NSbmrtBreZXfE?y!R4FCKb`x=wNbnK;kWJe{zfDn!3E*QBhPx`vtyV^ibFWMW3V
z=g`q-3>_64TRC|2_z|a99#=S}I#Cy|wQ8#C8|o7^)pb@)L*ra=h)qF>Rnru&PR3)k
zi6(qww4o`1FL;Ks=32>V@xtcDcuitT0-rebzV%tySe=|!m}o9c)X%D}OF&2vYi<mm
z{N&d{b-}dirrMa9;g!#9YQncgV+6zk7MfXCm~1G7PBpV@wF>czW+otq-ymhnW6g<q
zaZF_uWUQuPCQ1^`vG|O}<Xo$+x;Yt}-IRcCw2OtWX3j`7H;Ye}qM5Z`+nVAt8fL{U
zNn((Uf9tDJqbW`a(n`&Z)irS|324t!b7gDCpI%ilVyp#XjjvP(W}Hx4ovc0quBom&
zAvvRw4#0;|3#)5t;?2#{az#fs7g@rF{Evnd9EI8!bFJC&>I>`U#(d{lefkLHo98y8
zF@^D_riP{y3y*G2n^|~1aWB|WnPzEhXim(D;e)NPt>`c`e{DQTqt(ZKmp2zqX=o}8
z_6Om#M17%kVxcwBIsx4?ZMYQc{Z}AfgLpmS3GMf=uooK-7hG%4_Iq@2I<)IxcW^uG
z`Tx_$b?xBCb)mNS?&*G@e8#vxBF|;!^P9bc5Kl%t1@Tlw=Hn+h#J*L0>RGJso~!ct
z(dI_Pix8U-n-R%B6On78_yn~0*1}v+=Fdm`9^&PQ-$!KL6^K_NUWLf@W9Hq5xDxSx
z#0L<6g2?;_5qS;$DI(Wce}>5X4T${a_REN`AZ|ot{>eC;f_N%oIU@cn{_gg0#1V)i
z5l127&pI84F^Fd%Rw3fgIv<CLh!-G!2Qh|-KWhpO{FeDN#027WMEqHGILtt-M{GcB
zM8uzU0}hK2Z$!Ka5r5W$I6Q>-Q<eT1=);IVN96B{@V6}RXYse9evSAf;!}ug5%Fg|
zgTrqSxljLDM68#H{FgvqMtlWvqsn^?^mW8PAikmUwt~Kk_&3D&RNlv+pCEpU_!;8o
zi1-uVXy<qBJ0LR6@1Gxtco5>ji2U9-^A82(H^93g9<K6^04+p35|Q6JKMIk&M}r=N
zc&thv2g+|>9go-xu{R?5P5>=Ij3Dy2)tJY9BBvsjBMwF!g2?;|P~5*-!w^qH9FEBR
zk)WdxM<bq&I0ljVRiI}gjzt`YI3AJtXM>)DI05lom3KbqM8pdazk?V<ByTn7WW*Xo
ze&;cc$o#3G(-0Gg(-AL3Wd01$dc+3AMwQ2JL^dNP5ofBr*`RX}=OWHS{4OHvUjlk5
z;$?{QRo>;G-$z`4cm?8>h~&K<^ajL5h&LkMgvk8Gptm62ig=sKyB+in#5)m}BHo2a
z-n&7UA>M<y9Pvkp%>Oayy@>ZAu0*^ak@-IXU4{4{;zKHLHR#U}A4dE+;u=KqJ_7nn
z#77Z-rScvJeFE{<h)=4#wV+QUKBLm>K%Yf?4)J-F_bTY`5Py%j3Gp>V%J>858;EZr
z{t@vlMCQK@`VQis5Vs)y8Ik#a1>K7Hu1dcL`aa?Zh#w;U9g%z=fqsnm3F4<J?{m<9
zAZ|zeKg53`lJ^VHFA@KZ_?62059l|D|3$>*NANkIE@C^CZV$RAVh6;%5DO5A*Aa9d
z#C;L>L+pge{LY{UAa+4K5b+>H=63}>1o2SB!&KhkpxqIVKrBQ&5|O+|f%ZT=8u1vF
z7XghT_C+jJdHq2LAeJExRCy<X4njN`@f5^U5s5h%bO_>5l^zK?3UM^z=_+qL=vjzo
zBc6je0g-jj13e#cBH{%qF9tdZu^MqQVhtjB<DgRzr>b-UbUNaNh;@iF5Xsj7+K70O
zN;iWh5ofCOY|uG~a}nnueixDTE&;t1@iN5uh~GnG{`Wx_AYP%;SAkxQcn#vUh}R*K
z?+2jQBi?|x2=PWl=HCpu81WXwTM=(VWd7}-cOc%W(szOW5b<urWh!sEqW6RDD7cnu
z)noO@53V))U+{sK;aV|X@DYwiw5=Zn5M65zQKk<reudzYf9e!z2kU$PhrZ)wb@2Y<
zKdw~}O7Cl3wcX6x*Gzz)vlBnK)&bVCfB0$ibTa||gRMtCH?t15-bRvkoP_A$*H-@Y
z8SIY#WjNTH0)AfWxIjpK7ovO*oR8g9`jJoNb?YdVmi6S(<qy0X!DTJf_d_@9h)1P-
z&TAa&Nb4xzaegHOrTD=WPt48qkycf}Uq@Q!!C&(|mLt9Y_>XI`m40yXT0<=0pJS{}
zFe&Z9^*{%|r198hvwg=~wea5>58@cB9`e{1=(*JX(9`4OKdyDWl?eFrcxxg2b+N~F
zytOyla|P_%4tc3~y**C;<Dz{_0{$!sl}AJAe%7M_`}ec1!sL<qCJ`O0+}dxInXa@R
zep9CBi}I0H$vZM#F4AXM+u*OOIX;Wf&$=A#KLP*qOh|420Li9~E@snTe`02FcI^jO
z%(BgNxfKogyWD!=2H74o8}0Aw41z!Eyej41fBeU_hJ@0U*5H8uE3IMhuV241#IGI{
zs9YCcg%}m^=SZs_{-iBs7^(je)HOyDX1LZF)`Ecl&ahU%KV@F6Gra#K|CyomS=P(2
zzaP%>|HXf<bxtUKp7nmf-sf4}Vb2PW>pbs2{^R0C(F_><tS+#xA7WN-*w43D%sLe9
zSp$as5L5kM?N`NrE>`%u!`^<VwFbbRK3=W02kh}9Fzk<*ipSlgesHaXH7qdxC9GFh
z$o?V6mkPJ{TQWT#)g0>@Yt-Q~eW*y^Y~A`NnJyRU>#aukhjU^X64o5Fw-kx==lg}4
zQBc=vu&zY={m|h5i~n44SLkQCxGP*8@aIfx6Z}=>vCQ=T<3G4Mh0^n^e+K+B58JJz
zKI~JDwcM(~iOKVQn@Il>KN^R*pocQg`Z4UsUY6e8{z%0tE=Jlt0_V?sW_!Wqoom3q
zNE^Y0{SSe^{cw#H4V*vM_(k~7wXO@LueXK=&Y$ZoeBsDAf36SlFAAk^ww4C$eRHV%
zmQZ?$wKj16EV2Fq`>pc0mRJt(qA>72$V=_7T-o-6Yu#o2C1Ah1tj}Ptc65*kcUcQz
zAFeYTfS8JRw`5aC7yjKAu;+4X52Q;xuI1i;{Kv&ALKoQE5BFK6uxFK*!Bqx7xMH=z
zOh0ISC(yqiw62E!gFF_lM)<)Ms}g4VVQW>uo)23u!=6h$mWRFn_>XH`d1d;S*2@9=
z{n8o^;WXbOM913Kc^mfJL}n3wX|+fC8l2BA(zNH}(04Na=ao9uzP}Q+^ue{Bu-*vR
z_X+DW*v}uYp0HkrJ+4Is&U{kwp43o+y4KUU88Wk;w*HKUvHiml9qT!(5bay&u{>>^
zjq&<7NbCMp1$%82yi#5q_V^vr2O*})XH7r2z#kd#-*eW#u&_n>w3%a#ag*?8xmV>m
z??3+I27Y~+=?&JBfIl~c___Mz2iJPldJOIN1JY>!BroGt??3+IhJL-twO+SgfIt24
zy0s4efr(Uj-8v8D?<2K0VyZpf(2Rn*)?3!w0e`$@4FC)6F(1*fwpiQXj|GC8hqtT-
z$YYiC*8|S3{ota0N7VPj7OOw(pY$@ec>nPq*ZNB+{jN0${_w-Q)&khu?|<)Fm!mQN
z0YfLmRDIv`tKvV``p~*JV1J}x|Mec%ht?0#-hE(zz0%@s^EmmBYkgw<BH)ittm`oZ
z(0&sT9c#O_8unU3W)VKIo`n7ffgyc+1DzB2+pQM@{@HH5f%a8tIFy^gwV;d<T<c5g
zivZ-8RuR%%zm(xi{g0ro^;IbSjWs%8|8K0$>!f~V;B+k4ZiGKJd9}W={sR7EfZq{$
zss0eA@wjpSY2Os^2hvcX#OLr@$}FtN+xG<Qy{EktCP;exd)j4R$hF-)k(VleuMl2G
z`xgQGcC=r)SL#=SG1Ia3w|@(J*LwIJ?I_wi3@GW(uYE)K``dpH*nfZfK%}`AD#QNv
zTF7IN_Ikh_jrM#56by@L+K)H&jNqatof`1ZL3T~x{5Z%y4fZ?}wbI+8YY6W!dn)Yb
z2c)5|um558AlQEbYNhw@;UT<2dsd)J7TOn~{uWO_p?xO&SBqNhk(cVPq7dHE_I&XB
z;pkBLarW&2e;yYq?`{7yFdp@`--BQ>QAY<enOEQ+|19rq*8-1g`CU-X_H}`MZbiD2
zN^j<51wp3obq|HT?nQZ5<fZC!0!4Yjg}g5V{)^fNAU(n3h}uWNeq86rv^@=8X$WtC
zJtE-00rvg}Nd10@`i?c&o_m-~%j@l#_6W51eGg@T-2?u43+erpyxy?)Hl)dts?R{L
zCW_H#Pqrrn{LQB=esIN;7c)KB9v3*D2iub&ufNAK*#0i;f1;88=KHcOeURr^S2>q0
zFw@t1XBMlt*3gjr)9f1q{^ye)Ke*xvkeNQ+#vV;0oF3vo(|#-9zccOs!}-T^LxwZ$
z<Kd6aI*Bv!c-Y&YFP>?SL3_9+&xX^!J)!SHBkfhiKdyC_ePY1AXW3hEiDRP<LUgQI
z_KAO&Y3bib?6=SumM;|L>z#hE_hL_rv%LRM4E%FK>GSQ1!1;E*eF556LS_;8G|UgK
zcq(S5C)t+->^;f83--L)W0@4HKRJ}1Vm}|S?-cvbuy2)De@cj-Pv89D;_2Hyf%Ab+
z<NSct&rtdzdms464;R_pU~gaEMIrv?P<obqaG*cW3YE{Zj|tdwo_#9pImr_^FT{Uw
zD1Dh73)u5A`!d*bkyrn+5I=Tp8o|Xcj@=)y=K{Mo1_m;9N5uMo{Sxf!kM|2g^{))2
zudzP~*z1~5`E{Z64fZF2{(D2HoKHmk;957^-vsP=v;8IPx5i_+ImCZUD80n)9I*Ei
z`$(Q&Ui~E@{yReHyX?UMd*5YueplLSEikaYU|$IPmwR}3h3elON-wu>3D|$R{VUje
zl~;dxh<`;WeV_eSz}`s1p1%D1Lj3oK(hu4n2JHD@sQhR4y8(Os%>D-UN_y?%6KOxV
z;>om`e#G7f{C;@E?hX5udl`>}>OUGvKVhE}7;pKc+Yhd|5}N5}?C%Ba`HcNz*t5iA
z;S+H`xZ=sUnSS1WK48!1?F+g{{}zMIv0k;GhkeImJeJ}45Z()+^h@^Z0sFpWzY2Sn
z>+04^A^unG4+HjkHB|nZ{biv4y=EU0uqU75`@yx|w1)=l_ojW_52QYYU~{Zv-J7t4
z!b%5;^zrTt*sq6&@}~D6ig7*QOu!GW^^Scb?CXbj?4QGabG(dqLi}4o>8<w91Lyx%
z`x)4)msfvli2r^2*Ma`{zWqAv)#&m2GZ$vz{w`GiWBc8J{XVw$2-uIi8~oskCqHKT
zANC0Wd;TND|4;keK>z!veF^O2+vA@h{x3r5uk5=6{SRr_$FKiYi2pyKwB<Y$=x>&D
zKkU`h=kj_kwQ?;dly2`l6X<{KL*;upuLkV5m-89yF~Kv@ULpRyL+O2;!vgl(*QtcP
z{OkX|A^uLGbQdQP=x<#@<p+h*hdS2<?0IOY{0Qf|K>s@;RDNVAeYA5&z`jR^%8zqy
z3G~n7LgmMY(kD0%1?+u-vkvwx_3X)=Eq-wEd}nLGetn(c;GlcoM|7+*XJ3^2>xX@v
zuc3bhc=Y}0V>d{=jv%)66W&&O!L|B@<dr#Pf&N_POoaV6dNs<Nf5LuepjLn6rQQ#m
z7{WWnne>HM8ULITDlZSEE1XFI|4|b^xMCNNnI7ph1pLWeJ$}IRr%<}enI7<GRj7Py
zD1EjwH{jp1otxl4-(P2k_|JD%2F{oBL**BQ($&uTfPbq)<u#%7ROj=6f2M}Y6QT4B
zr(=MhJB|E+`EMxQ<O~V;t0`1I+Zht@&ur&R*ngV`$sJ05aK%m~Gku9OI$-}xLj0G8
z(w95u2kd`&sC+>veU+08oL^Uk%CB{<4frQ~zj(d#K)@f@JDXrXe>~=$njc)Ti^@zd
zc0LY_SBsq<u%~~0TO6u?yVE0JPwu$#gDZAknd!TozJdOJx6=pqoanJ|XO<sau|vyD
z|JXS>V9y_i`0op)f8v}SuqStN`N6eTJF^1zT<zQn`&D=>t3&(`htiKYYXkk0yTAP4
zik)C)`f=xv0sC@im>*ngt<yfxf7gb}*E#J2_Ffk%U+)|ku<v^3ci4i$@wO1rv0idI
z!QMSRk?Wl!U{9_^$gn<y_hKmhl2aD2=S!jTSDgs~dvXVxAMiXNl>UP=C(vKHv&|2f
z4~EijJIe$1=8iW%xMJs<nf|NuT)^Jk3Fimbde3=3V9)nL<sXF7A35&_?8_Z<esIO^
zIWzsa^RK{o!QFIz!1{P7{e|;+pnrei?2U9cuL^hF`N6gR;~X0B2Y2B40rMsI#DG7z
z8_y4})!wZQ*q^)e{DA#Xp>#+0`hfjAx(~y?{(OkL`266C-F#-cv%4u^Z=_+*5|4$u
z{rupHU4Le}tNYi0J-G|e53Y5%`%b`qhlk3K2&Ip5{}r&`QK9l<-S&a<W8Gt5Pv0NM
zhWL+ns{-~sK2+X2l#aOb0``o!KZHF?J(aji(GRZG-(4H9AJVYjXpe<E82#Xi-Hc}X
zB=?no{kXf)4_N;Ur3bq&2JAUFR9@l!HDI3#_jA~1z6V(m;vW`Dk90c+`X_f$`oYEX
z%s~Nrj&Y~JUTZy;F(Lk{P<p(3ZQ%Upj!ZweVrQnAKF?hhurGIN`oR^uHqCU*T@@G)
zxQo*duGr0KrsMA80sC`zrysB%#(gAUZ|?T=gDZA@n&}4jm4N-Z3)By;)$G0#urGIo
z`T_e<+;0N*<t|Y_VEz+IU*h%*@N@U5A6&7E)J%Wh9UJK1+*Rra*SgA`74Q#tnfd|y
zO+x7(xJv^5;qFsExMCNonZDUw67UaqrTW1YyHm~d?e2X6|8TdeAF%(!T^{hyUGC$s
zzdwF)H>)39tcTx?2eG{Va*op(!|$KQ`Q@GP?`7q|^qp$IDsx#L9Um;;E0msqg-_!1
zn%>#zV7*)_)18qna`v^Ba$!^j;(feSCc1#^@2qf(B9b4~z(3WgJ4&X>+u1q5YUG1A
z6?k_WNBb#n1!8CCVCx>tFLYp?t{=(rWAJ~GbDZ<rkbHcDMAYXTtFzP1y5VS<mhC;u
zx}%3o4-)lHa7wPjKPnLaJ5R~-W%$3d^R#vJO=kTD>y6*a^jcAVjP*#!-rHx$a*p9e
z&PncnLgmk#WtNY0F2R;2>WgN9zrtB?3jR@n?OD@7r=-8OU<(TQIaBWJ^s^R(%6onq
z<lp|V<mVXP**VYJw?w8VAYJ6lw9a~5r3GHX`s^W@-Xi$tSwq*zH0Su8otU-c7iPNF
zT6dpJ^Z8_vGv7LSxlFTJMa~u0%)T-$?O*M@gy(BIP`}F_)hVgp5<JYJe(XQ6pLKJ{
z9(RP&2frlw3DX&$1zS{(e^em;(sG@W_%|BoAIpCfIv=)&{B`{JVEtD@<;UJG<@X0$
zkyGWojEz3RKS-lJ_HDJMKIc1)A$gtE`9djd&zm9qCFLxUf#n_7OT11H(%HGo8jZ;{
z<w<|uXZ5*RrrH0CoCmG9o|fsANOyJ~wtjVxOg|ygH`@n9W%^LTf3iLM1DWn6@ZYpY
z&y#7{KTmP)`k742{_uqLRH(h@4g-)1JfEGA{T>)7>r<B^XM=T2xtSj6p8K*)*P*<#
z^Qtu~WUoQ1WqCW%zSpg{Cd;&J-+1?yS7dsTsQ;FA>~CaRw)b7@rnNG?NtAzRo&0;5
zmiGC?s()Sa3;Zvw!$R%9JJkQS!jNDU&+I!p-&hZa%AeaP%jXMud)n(m_Nsb8mN$y>
zj`o$I{y8P2{}rM1%20a1k0jo3;1xNq*?*18bVreHa_$ecuW^|y=X!pTGsC$!g!kqn
zvRvBlAp4_G`wzTdmdo}ZW^W9YH^I=f&o;!)PN98T2>;pVWI6Xsb#{)nw?Av9kFy6p
zDbv#5z3qwS^#XN1X^`b|yp6d_UX<yth5rWF>(uo|jz16DUtVbPC)|IT{S|m)E|%q8
z@qdwXn*BF)B(`7TpKdR_RHn;B`D}OQfilha4?8<&*^^K}ep!CL{kFRP;Iso?v)k!>
zSw3H+uXpx2SEjp&^b_`4IF9vY`OoZ{kiKtUCChQz0`DsK-wBzP?YqQX*<Yrm{AcVg
zy=0n~(IRJ^v(IfZy%_1v&LsPu<79e*D4$}#HW>e?&<S*UsQ+KLQ1W+2S&>s`cims6
z+21-l_t{TYsLCL$zYYTn^&x&|=OTMh2brEG((~+l;CPlV5$Vh9#}1b1I+0#r7xk8D
zIX>NBcZ8wHFXi23|F=@6rG4LaD({qOX^&T(1Bc3VA?g%4e{haS$}~@dBIiBl^DQzx
zM5I4*ZY`8)iTAm)Dkjq<qP)HP1Wpvnm-g)H9)*T8oy1tz*?Hb>zE-B$z9Q!(`|vAe
zTKek;?mupkX^D5Zd+9wgJs<p?op<bsa18OvME$$m=T-YlMS83Ky1L#B66uI*qhphQ
z4q|8Lefz1u$+VRJvE2`bV0l+j{ttT<7QUIDFVg?C|Gkfy{>pv{j4Us~p|fK-=R#4Y
z>B}Ogy>m}F{!xK>v5>!KkCgm9P*&u0aoUZR>FFYUgmdgznU?lF+BxJTneHIU4|OgY
zjDJ)hzOh&)+VC3es{_m36J&j9kF%W`oKHHi{MR@?bzu5(7>fFAM=Ww?J9f29_Y~<%
zoQhd8JyE1Dcb+cCKPvEgcJrCCyaahg&SK}H@5^+5k-pt2{i{sZiuB#inME=!_5HCk
zc8pAS5#>K|8t2P2%mlpEP7DoU``U~2<Ic*9WLoy0N1Rn3%e3r&Yn?TVWm=w(e|1Vu
zm+3-L{|jfoV`W<6{l|IiBeTBaj=Vso7YY83?rBvrT_)0<-N%N>bb&}8<t`45-+kaO
zwingV{{HT>=g4$Nksj>c&J#_APN1{R@eKA{^F7JW{#oRl=U#WSSwHR$3E(xjPn~U+
zf8YITs!XGsqyEkApg{TU?(-NA7}&-mo#pQ0r6Q@)_q)$2|Iq)uzoB0W9(2T>s)C0c
zvDd!fr;ZqJ3RXKp&q;VOcRct=CxE)`a6l-A5dK@dhn&9_;Kg0~rTZF3%<tV_Kw*}{
z8G>&wxlg!2E$bG;$RZ!cBQ3ykFzwj=QB@D;D*I8vV^S`D$5re_A#G$nmV0NB;$`54
zq-g&lP_`4@#BvXi<E#rMX$BYP#xhk7VioVF<U<JUS#St!N(#LGq`(^lO1yGKL9Ako
z*`nQt$$c^fPfC3Yo^r(6ZvmE>PXu4V(~fxKitQZEG;k-AKI4erDj@!Rq=~;kQ4p&b
zjS=`q$h9ltS0JD5JC790)b*s#I$|$I0bX*xlxZ~nYSN>yhl~{RXa~}VNFi?xDCIp0
z>f&1cgi3>0#f3`lF>*X6zmWSpcEY2)0L$6qNr5Nq|ALYaI*0k77lRUizM>02-C`UN
zig9kXBRyW8@9byvcY#_KFYcwv`^aY`)Vq}B8&to<@^}@~5xfITia|oyv#;C(UVw68
z2b5DT%h~Y@0CFfP^eG|*?hw+K9kJK6;1$PeVj6zAlyoEfK?*&uRdglktB%+)Qt&%R
zd^e#0%kSLbP_W6dxO1T3HOJx;ezuoSq6=P!JW?#f7b_Yig}gzekjLk@1;2%TNg;2%
zqLWGAfSpOvo_VCub3Q3>uLh-^xi`>7XI-Sy(AX-*HA2{V0C;H!v`6HZseE+KLX}Sw
z75q{5bM~LnOrMN*q)B0~I#9}?zeyR2aSapr7#j<bCceOVD@&Ymg)>yH`A{Cuw*vGx
z48x+oiT1!Q)0js8VtYu<{>OH)|B<r)dHt<I;h%=Fj`h&bI6l#iqP>s@lZbkh>*<G+
zRp>VgyyVyRLt{ifP6iAaR>5WmZ_t9GKlCC+JIhId3(*3P=e>t}hN?eSu79u}3Vrd|
zg?zNX=-+5xI{Ulm^hpzMoWjF3qX+A2ymwlNcYX+Og2I~!A1geZib8*MF+oR?{>hQ!
z5ZX(77huk~m=s1`rTCsB-QtLM0ciKXFg;1`Qz)p09G)k%Kj~yke0zoZ*D?*fMpE!|
z$0Yfelm6Ke-#?*0{=)QM)Om+AchVH#ag^hLBHfV`c-=^WGmLbye3y~_s6yJUm3z57
z|6pz){2N!}6UOn5Z1+|$BNW3aq8y!3`2StipZ=z<7w|v2h|r6EB<^@cL9F70s$b{(
zs~7UwUU9vE{a|{l;5~Jn!1!3tbdmfX9Qm$gx<OvY3UCrUq{<&5og}|+L%VK5n)2TO
zb(`dG<#>9|Q0-{uGfZ5=-dFmeb5TDpJ*$n*OPs92j^7QPmy>pKUZS&!dY8#P)de4@
zcF$M&m&<3bJP(FJkAe@?^$PuOI@3k6zw`Pi?1<~<O6J2}t3YX=)u8T`a!;veukS1T
ztK_;c@%4Ej{04srzfS@N>a(8-dD|QdO%ncELW;uWq<GA^h7^2HlK$Nh-zO^g*s=b|
z^dw83FX&I-Fpc){d|`V!fV$T~f0ahDReZH--$FGHLq953^-4fluT)VGtM~`1|9+BX
z|6Qcy+^qcesUzo2pUH8Q?Hr`!lq(8i6)#rxZu9%S7*Ej8PeD270V7F^@SPn}^z-kK
z!mj9&B43O%ljMAka+V^WdMyKG|6ZZeAXYJqE&9owYCZ@53;&>=z<pj_M=+lexS*mx
z{7{W!pYzQ_$bG@FUR3mDMK^&`t~jq?<jqLC%j9~Pdk?+~!*clTeZ>c26{E4DJ#c;x
zq`h&vrQ`m+p>g_03hzE2PxQy_Y8?7MW!HZ?(w^w&6Db$=olg3Inm_-`5#QCKJ<)Z9
zUU0GHu99|eA5`;a3^Gtbl!I8sIBA4FKUMSJhvhpN#3@&N6^epb#W<-1{~CS)1oFRd
zm~9pRLgoL`*8^SGD)_f*KiWHtX<QFQ`++|RY1+RQl<l0R(jZpxqYCeF|2$>?XMZYF
zRN!HrIEHCZ(I386;{${@G9UiCmK6E7k|Lk_GoOCvdApqy?fC+f?fDwieF_KjynI5n
zXRYdo7&m%?h3ygjAGo4lqJK_e{%_Pc58MSv6ZdLR_gT3|ooR;RrxosVZ8SbVukc^Y
z-0mT02irS^6z#18W&3D97bgqPTd%#pRd}!Xei8i@b{NF^u)}cDNj~1COk-ZXj1>01
zmlX4BbRjYSU90GNP|Dc=>i%BtP4wh$RB|`@_i4wl9^{siLhc08Kge&>Q4b*(<Ad-&
z#)U;Jhu;^IVmw#^N__SQ(q*8WZ>}JH69<Ii*OXig<{gpd`7ZL`Qu*)r_ctXhM|*@l
z@jR3Li1#Z8p&zk5{YhQdn;(s58s|eDDCKjWM7c?o7IOZi<ov~#bBdB9`aQ<g^O$~D
z%_H`3<-Dy(UiXL(7Yg|>osh$R@4gqBNBmXEd0$<3aNh+}h<enE?W3JZ8Hzs$o#%VH
z(*NP{f08;6p??zfSbq+v`-z-ydU)HE{7*CV(|_QbQmDs%3P{l|jvK5$4b=TVdEe;a
zeWvjKsqD6wE9Yee{L%^Pqn)fze@-Xe+m-7Mu-n5-W4q2e(tY@5wxnN>;v-yq6O{dk
z-$p3F2f2okqTX0ip8uryNY^w{;EVb12YiD|@?EX?ZdH6sRr&#y=6XEqttSQk>!iT{
z8|nVondE@No*hY%-wl*{7lLw}??L)+oS&p$L4Q?_=3B-8Qg%V->_L4XN1V3@xGlSH
z!Jw%9DDeKH@N8S&KLJmShX=|p)UbWR-sp#uC=cxp_-zl{8*c=jW6SGHd)vEjsbal@
zUGZ&5;tBr%Z?nSN0!sb2g1QBE@Or(c!rNO?&O;cAG3jat%JYVy7*6d8N_&X&>o8ZI
zSKVCMZk*Q~7g_%%(g*N8I?~RzobRDO{EcbohpsHzgRX43U2JiEaSyb`^~F8Nme-eq
z;Y|E_{k4;7XII-QBo6u!hBU0B;l73xxD!ChKM~aJW{Y-t^$$_?54Yw0EA$Zc@zJ;8
ztdH$oV@ZFb=COsY92YU~TfzK7TiWwTSJ;u`7~3!G#eR3BE#|8QMXLXUA59SJQ(QYF
zt~ejCJ|^x1VGl9BLGC0~F3ty(*E5ZBj&r0JlcK$gNsn@^Wu*8h-IJt8%Qt(-_af7v
zTS;M$_d%)uHc<B{TfE`n_JF;a2IYOEXP@rMKI*mN;$u|0r!BABy={5@=wr+KG^FQK
zf20|Tk5l}3&9?*dkC9(2<9Hy-OH?_G!1C^D`&)5eTi##xl;fj&qHUF<ob9V1JxSsB
zv#mpsE`Yy!km7!|jPy9=KltfvrcbfudL#UCJ<}MUmMW^psqIXkD*IVMIr;-c6coGC
zFYx<treWs^q}YZh{L#ym{^;$BZ{^ay^at&?L{W}Y9AD@kjw>rvdL=3JTBY(=lR`g+
z;z7zTLu|P|-N)VWbp@~WwqrdEst17<l&EnV+x^O!hJD!o3-E!$TGGC*9KX>oE@v9;
zz8aM6UI@zeE>dX_s~E2Z3;dA^zf^vSt)Qj%{rG^as6R&ft9w7?|1(rRUdZnPIR)@n
zcT)IE%#Yx&(M+R#9M9N3p4VRg#KlA4o@I+?Mf4j(@!6?(y^zoHL8QPH*MHznLYjEA
zi-!v*3*7USzGzn=%GoY4E&zx8#G$>|K5ehXNP9RF6;4d`Q{agC7jQ&-Cad<G=*oFG
zaCAGSnK+XaPOUATLwb6~RsK|^_cWEB?w=RMY#-!`>kH%x{ULXl%BNjfUPoGJ%l-hm
znrXCW4Jh?_R8bJC_(CNICqdx+15OFbX(u5Ma)iB*FYE<eAqRH5l6=6Y{fMvahon{9
zpzxcN{q;K2Ox1qWD_8X@6a}%0n^nEpwtS9(^IVMQpyVsShc{{00&Gjw{a%a*r>OA&
zbQQ|k9_r8Yfco>irT#oWpHSr>R`DDq@4H#H6N7g<)>p457tdGi#dss^1}fTns{CSH
zLAkmPVY{rbAM|fTea^?{fU><8D+*#2U#{@4Q1go+YCOnfw<{I@HMU&u#XL^nT&waI
zs`F{+PR5}hDE>vb&H;e^O7uVU2jK^##XJG&2`s<aKaX_3pgskaYF=4xTR&tPbcN!7
zkraCTjud$BkOEK4Bar@FrMuvi;Q852QCzYFE-pC&ufL+`qE-RM@ta7&|3gyr7mmlI
zPbw;|qiDy!nZ~wbF^>d)7YAuv7Y-#wc^N74#d<61^LYmSGeOabpzK$ZNYSrqReBmJ
z`d6Kzjj9~#Sj9IgyWXPgdYZa#$mGvk(MZ<2y@mXD`u@`6lRl3}1E*k_Ew7`XlbD8l
zaUR{HuKS=jF(1afL(xY_VTUIbT~CU78%bfO*A>;zrFiM1o#-c0hGIBFoF_lB#eN3*
zy9evR-=aSOUyNrX)cG<}pD%L0&3=;h{8*uI?^FGHlq=`4;O_-|%BTKbJ8-cU;~eB`
z`-pK3@~haM)7AA9^&3^aq*?zbO5Q_C9<H0>{J^}fi1l$DK9Mw&KYyy~Kdk)vbH6=h
ztOt9FcA!1tyh3{@KcoJ?P<W4qa0;`;`IW+XLe9@P{~bfQxDURX6zN+@;Vf~UBK;xL
zSa0Y6RSNJrP7x{e)_&)_%d`8h75-YK_tWbB27`j|Kj+QFgZ;*n0*Csu{zOGVtm5A&
zoafZMVw~zP*uF2?dzSJa@)v-gIBY+07Agv26+f?VFc@@2x;s9^Tu6G38ZUpV%JEt|
z`z^<3hT@l%ea=;U8x`O0lwQAA^Or{z|7)uJ54L=6H-KMymF+48WxJ@iXQwx8dB2GJ
zfwAO!+ZO9I)MKgQTL$X>NsgoL7F(?Qd-dN^^8T!FP>=TGbI9qWSO=P?sPHT7e-qPK
zCtgPiJ=ZI`LD7w%#NPzU^`SRNm#OvQcWrA6(p)FrN(w%P;=ibN{7qelFi#cv@2UI`
zR6gdhBL72`zs<jHbwNRadd;HvBUS#1D#!i=QGUMo60uc)4`z$=`2ttYH?_P^RlU!Z
z{W1U8q5c11%XKa-_n)f%7fS9UO202v{#UlZ>;4_3$JZ+V8`U5FtI{@}cR-)+>NSvJ
zM_oTBsd28_mFtg~PuEdz*i-lg{p@|F;m2*DwC|^if>_1v_=_H(d#ZMIQ0W4t=VaXH
zpxo=fd#mz&6#u@8c2eVEjk+Gy;(Et=akUOGWhdiMXN7y9!qMl;L5>`6rz-m#qWBI|
z<Nq|(KGjdD-z3QO`cXH<e}p6URTU&~|IK#k^9zeULjNLVU+CM3<@}&JLh(_KIIjz)
z;|op9hnxyf;ty98#40{o;c(H2>El%Tcsz$iy8DF+ua_$CqvYv!lsNMIE>-IexPKmr
zdc1$0Op0`)N`qL%QH4K1;gzZWjQeC!exfQLq^>X8o+qpPQ>DD_b&9`S<quJKLzUfU
zsPalxewr#DuF@lwUF$=39i_@ocjP=0_7vkJ>?_(gM%hKZR#beZ!X2ml+Nk)>QaI-*
zKVUxG695Gl`SaspOk;jrOIohRZ_JMuFb#iQ4N89n#_tIV_k3kH;PxWFw$nsa9t-&i
zleNy|Yf|l-toSf_qXylZReoIQjq9)&XW$oJ=e_&-srVu(ad5q6D4wox>Kr-0Nvd%O
z?Jq?++aDO`XDE9$s(Q^z-b`g@Jx(N5`7FghTg}7qyhn^<xDJc?#w>LmEK=)b*!LpF
zdB~ry<kOzsc{NwzUM%HypRM%1L|unbPxN10H^lgX>&7(H=k;S2DXtsyNpanHm=tyw
z^F+|cRC+Ba<*ie6Jt(gq8%UR_=NnHby)IMjxm@`NKS)prK5xAIzAC>$@n5OZS1Y^W
zbu`gGwcV~!<<}|xg^F)pi0^vEw@C5bsOZhu_XPP|=ju+1>x<~OxV{Lx>vgYNRQ=l&
z{&z$8OH}zC3inP&j!(d4dx={_3S5{*tW$zm#doQCckhJ%V&%7GihsFk$0eb5{79Am
zSheF`r62mKkPClPFZxUOSJ94@^89fgmitGXU&{74W2Ic@ClZ&m11gYqRMhIz6tC+u
zc<kwY;&T$UbNVFXbCP{x=ZzVcj7DOkM+_NSRTUdNWJGMt;L|I|RSh0mSsIH?X^xce
zx5nhpZS}_wV&TWJBGK4sqt6&Jcyuf_CKieG#V=ybs7~U?vzik1Q!A@R)y$Kk+Ejql
zBUwGU?e$1C*{ED?7OmtDmkqD3udRzWjhI#0zbW3>(3GqkJ8I0hSfoV!tQmgLtu~&<
zoV#3js;PH*6VmtGJU3&^xJay&Kjv2XZTcgNR<yZevS`aL@zCU;V@h$J)U^E>vID7Y
z?tvZ1-X#{#)B|>r>02Vc&3({<M&O4!<Mp$wSgbl;Jvk9e)FzNPuePpAkZO<&7vC&~
zFflYm`p05T4Gl^ES2!ybw!Yft2Qeq3W^U<@rW=uda+ZN#`%K2CHZ;wJW;^8XKQ&$-
zZ%Wjd6*8E)<=1N%c$hcg8OmRl?OWe4J8a~9;H8>4AE-Hx3etJ~R5#=0FxFI^Vt}lB
zSvtT}3*-ehy$M=wTw#GS{BUklHGU8{5{bnU_4sAq8TjGd*7t**fTo%vukDrat()}+
zr~CaItDBnRO_7o+^o%O;|G+$$Crcr@m@7+B`R`4&@iyp90nl8`liE=O(CN*Q#d#a)
z@83|y#Enkr>}l0JvoP2LC(^eGzhjMGtPU1t7}&EB9Jp;w(~qMixQvg%UGeya3*+_U
zlGRPgs)lBL%I9(lWw>#!scuZpY!ZsrH)uKfI^Od0zoqE8^oo|s$hmvS%MZp}_#s};
zpDPa=CJUFR2TQd>&XD<0yWiya)I`qu`Y5?8>SLwXu;ra}r=#wS8DU4~9X!<@c^8r1
zOxgA?O!E2j_F;qM0F$bE4q$1O6oYq5R}$rkSyqRY$eQZ9y16kxRwom);#dJ27mZbp
z8P&H(tfZz+TR=A7oWEq-{78RaSUndkJ#0PT<_9r%L#J)&4sV18qPtA1Zi?5&X2+{9
z#JV9apb@Oz!l?1;=D5hsqb2*sVwePCHVlHrvRv;!Q{nPp!&K0;ot6`h?D{P4V^m+w
zkNW8V^I(8<u<1?EatlQI)h3$aHMl978-x3s=3-Ef)i%H&Q<~z<DLo;tz^Nw5D|~v>
zWZgST@W=$K2ldr6;yIreA*@sb<fC;GHK&0Ub2YIdl^3PMV0q9w44Jd5cRH29W1H3w
ziY-Hz_ew1tx*}!%iR-OvV2G@Z<J3j0ukl)(dxz*7udmhmr=qp|tWAH*QOec1ig<HP
zQ=$<AQAJdX(wFfz5s=yq+eA$IuGw-?srS~o*e4TOF2=}!xx?vARILk(#R8$wj@c(y
zH)By)K8_wy!w0I78cdI3$)@T=vUx;JWhL?kV%ph&mF9*fW>ori%A(71j@8^)mq^AY
z&zyquXasOEvrUM9A_L5J#AYSpv(q<5G$-X*dnBqB*pj0XIG-vj#|9fcZeT3X?45T1
z-KDWv^q$?N$yuJ3>6)EIZwNcOG!Kr>kN6y2mzPHD=+sX=iBi@YD<b-Ok;Qr565JAv
zyVDafE40*BW}fv$qUMN`ey|A+A{_bp#b-1o=MEV#D>9%2L93CC;1rG2?ftas=Fr2+
z6fxRbnYGFRJXME`mr`@jO}`r4HaBH#YHKlMYg)8psRgacMz_}Wi}Y5=MlM|U?Oq;R
z?aAG><vChE*AY0M_H3iJq*^H3p=F@=<RRk_kS9plR&zwi6L6Ljmj1KEqE4GmUxODO
zIeX=1mfAQb>J4*avI#YH8Eu|%*xjvLpV}Q;qDL0zM#!#WvY2<f?uz!LS}OC&(7KsU
z>E!B~3j_Ttn-ef!GSi=%nRU%D|A`n&@By8O-|AUaM$~L9)tVM(<NXZyQBF7Y>TCW?
zvSZlX+g+CTCZ|Wt-Gk|I)A#3$qg*8I!z%7-R1d4<ldO#X%PVlIP4Wt#-ZYs{_0|nB
zHM4LHNIOFFNor-llBo)Ro2^N2pUf^OQBOG=lX9so{C<jf9F=I|(qFuK1{d`L%2S*k
z8QV-qs)gH3RNl>(vRYCW8;1qb>Z$RzvSk($^J>^E<YsB*Z)-N%n!di9v^5LQ?j|j6
zeV<4>PILSYKcWafq!_1`fwLdc44dUwdh7g_-!^3FiAc%J`ou*u<1t=B2FJw1q0-v;
zl<Jvvc%=d}kYs!W-U1U(R<gHrtI@NtWUFOlZ7KgH#G$Raj%KW%m9`mC(&~e2ZCNaq
zoYvGZJ2ttxHdfu#R6RFVAD<n=ri`h{X`WAm&*!tL#u-GWw|O#N>Qio6(m&iT3%p7j
zOU!7j<LhnXl9)8ls*cqqnw99CPGj;ZFbjX>Q*2rXXR~1|y^Vvf-Wu<AMI!PgTxs^S
zZ{lWlMCNI93r&*0W~I7o_i0@9WW42U^{Hu?!MACwy5?kc(wZWUGr8x#z8UG6^>vB*
z3t3PzZAL>a{^`SvcvJ6&#w0d`H_Oux1=ZrMfTo5%eef=N4N9_np&k2YV%TTf=)X-T
z_w-fqifq1x-3M>?iK1qUjh!_GZJ?d2lX&TU^2}r$>Ct^~-(gLuZD_;>m_(B`<3b*5
zrio)+Lvx(};Krnuw9nM0hMA4ljQEV28I5>v5W`%3gT<;4(1gJ%>mjD)7lwY=tQSvu
zLt$lw61LMpB_|Qw(v0=DSk1HxV^i=I0jqiL47ydAMErv>uDQMu9}!4SA(z#sz9AX!
zbK01*dW)KPKcs&4^sMbdAJ3TCguiI4p($3ANY2GV(X<iMM^En?t*pcz<El}!0GoQ+
zWE{;~2)Uz2)vdeL$7KNh2A8(EmD5Go@e7izd+vwV-kRgU&t&P$qe;uBcKw@YPDVfX
z`=A!5`(T?1Np*9ZiAsL~%h;>9ZG=4&1KEtpiTZeE<FpPU|J@O*c8U5#l2erFZO{|@
zS2s5&rq;I|d?QC{37_@rWi9XP{hFp=2bb?n*h)ytXID=rqiuS68c7(Jt22%knfq$!
zj&}gMJ)ddNALIJQLPlymO#Zw50A4?v@UBYsN*nj$ZMIP`^h8kX6AU+5_q~i}-5na5
z+JSfL=4LzGx9aN5sRz1WVqP4}6>`~vL$E)(wD`PfGx1rtt#z}YmfAoz#C*3QWB+M=
zL#o9^<Xdyb&cyE$XY8yIS)Lij)@+PrZ8lC;mZ>e^=1ePiY0lVRzWpX<(Yb?-ZTZBd
zGJh7zkI+<|Gtb?>tqT}G7lL=>!~%yg=?e|Z|4Z#o9YX$>TAzOGX^{q5blT9IOYXwT
zUr%V$mZY9l8Hc^rT_$;BD;5=E$p*YPntE1b(SnrK)YKP>B6zV4A6UUhq+;U3B8e7`
z>8*oKJv%a5uT=t|NF86Zws^o2=M=1$&1jevx27cVofLj5%c|kxB9B;I!xv1rjtVBe
zj%hW++}vMe;RW5eg~FQIwODQRSK_A5tZrhC{BBttzFUSBSGDlE!&~|&UQd<JS<JVy
zDigSS+hM)db)o)piotusOv_Rk&E7hR#xt)G74?<A<elC+<xyT1ohy%0(+`;$?VHlA
zqsU1#i{<j_$#rq8<>KW#@g#1<;J&e%s+yY7lOvUt;!0UvKNa7<F~@|~xHzjOM8Ewe
zM85SVRB??Z?|x|cb;>xsvN^R{{7z*Gem194tEJ?Bt!ZH6OsoiV<8mcNJ}jBzZ2{1^
zGX%}@Of}}jE%#LDWm&log}2~d%VN!ScqYN?(+E*I>x}WS7G86AX^XPx0=u+bt@mP^
z-5ZDIvtkXA!#bXo)>YTUMTa!pK6321ezCFR%D8c6Rz+j0{J%Tv(z>3rJ8Sem(&r*k
zv&W4v``K8$L-fDU)mo;)|3D9GnIh>sR_6Qd*3DZZ_`DG|QZ(WDBfd_HIi$A$K4R=B
zywyBe3_+<z{dU@s-X<-dP?yE{Er_9KkH@DfgywS1xw&CxQ;nfH2JO~alcV<7af4%H
zN45CEoigLzwQWrG?Cxw$+1fUI5HU2$cQ@0{>BKuAv+((lmixAKov6ia$ijDR+>%{*
zUbgs_LY#|f&g5|eV!=rnzul0HS93XI+r0HzoFT2%gG&z_=hE1gS)ttsp}U@4W$b)4
zGK+I;cd+NKa6guPc7ONhsgb+F{dsEYE*gUeW65pzcYmH5xhveCr>5>A_gC%y&d*O1
zcY*8k)6iYzc-{@}<`;cD@yJITcZKWo)6y(`&&B4M^|PC*8)NvvJiM#XjJ4((|6ML|
z?}NvYcq-ad*HB$6(x}77q_Mh&hDLdF6dPK{4aGHs>!wyU)Fo=>V*bpTA0|M86K`_N
zO5n5LG8ezd2RM8@TYoQggm@_=o0;&qiWvSzCrTuwTn-#x5*yFg^2ZH}jgQ2}orab2
zEFAa$yD75l8R@>X*k-G);qNkvMe(6gyeTnmXiJ}W>`o2NqTB6G&Ca%qv}&KLdb44K
z7@B$CjqMbCl%1F|VnTCMbbxrkUDMbY84$xOo3pWp!XGEb<LvG?tGaGxymD4$X>x93
zyb^0`_-o-avDPhmv{8$*=_I?GrDfaOaM?}mO7Yj8bL=jBina@TjNDVxmaT95-qZFv
zWI5h6`d_dc(ZX*}i&;qU<QX61Jb@n~I0KKlT0VBPne;3?*=B9X(i15QTbLOnr>U39
z{9ex~U^cV5l&b;v8yef4Mi}G&SgyXyO8|b?W?)ON0J~+&v*-c4W&88gd&Hx+|H<C-
zt+qT5z2{qPf404cca*_il8+n80k|OW!Vu#{p{&Kj$u4S4Ha^}(P0H47;V;T@m$Nap
z>mQZiH6wVzZt10dR;F#QxIWOK+1T(~Z)}#<O?MZW#iciV|1Dm!koVsMT6!w9Z4<I^
zUfVV#y<;+Oeo47t@AOBAq9y#?%FG$@!F6@x;&^YHzogPE-rer6oFT1Y-hSn?0eE05
z8!(2ywS^n6ahc_|d~b-FB8DzC@~Ld=Cw{tRJAHK^#Sd-Qo-F$6E^Jl$j+?Xp#KWrH
z$bWfgPaF6z53S15e{FHAST)KU33htEwW0hh{L_Z5$kHG2i~Koj+8GUYR&wr>=6+eM
zSm3cni^sbB$jbj47uDnV8?^mmZSWQwCMyy;!`Egqj&rS>Y=)O7P2oE|HS#Mmi?boW
zg43P==Z(o|>6B~T=t#ez^20P^8yb>wvcZoA?sSG!$;DjncZ}Jg%&-1@n@y0;Fehd$
zH%Iz!Dwe7DZTYGxUoK6~Y!<&)7x;!Azo;1D=N#~x!DC02lC28w3kA%Qg=5;HC0TUS
zl#bFC?P=oI53BKY!{*ruJn`;>m%i%aeReeF?V4ucL+V*{qWrx~<-ZN*U8k@>-r_#A
zs~VDpZBqPIJIhziJY!m}Wp<FcborgOH5Wq|^8*YQ{?L(wA$ACviy?Lhoc0ow#Xz@%
z*Qt5iTe{=dcs+Av;S2HmK@DoLOMH{i>yz?{_;jp5_HF6NofTR(t;7}|ybv1;eqL`x
z&2-LC!`rz>PcMxQEFIW?Ky+X~Y{$VOY876HfD*8er%I~u%qte@=D_Kv%-)CXJUM#u
zm4EcqPMm)kx%Ou<1Bl>@bn;bF@7LBiJ&m@sQ>6@YJ3~#iOv@)dJHt+Ik<6CQ(D<^t
z_?$!yK1wy0KZaACOyCoPX>5{D+*GUN6Ft3Mvb1~c+1}uj&KkL+rP?5O%=DUPwk@9_
zH^cS#P=@$8F@~`Ic<C?EG`@25bn%s9-w2pQ2j|RrhL!ec+3i6qe(V|pZl&>c2E4C{
zoUz!SKdNSQ)hzCn#JihkV1N!Pnb{|8+lFj<N87eU-3(+k`^U9+81BjBCwhkR3qb?%
zIIB5{uaM8J+~EpG$`}<X!*|QY??le^_PU7$4S#Bu^4WB8qddT`r@r4_3D?Ryo2-<P
z!|=eyrZ|3Uy(wNBYt|1Q2#9+U^NaAY^TwZ@#Uv~BGg1mOo3kPOKyGxTbf|nt!L@^m
zL{lX!)RLuxmUjI-3e2XT=TU6>fim;So+=v4GvYy1w#zfEw{hzw=4Ry9%gxft;oF(u
zZz0HE#^|Sim<7Lez#nD6>5_$Zt(1_Z9;stkiTJ>}+?;FPRJOJ=L^1<rVU29tDWO|-
zg$|!E>4$NDc99pWq`g$^NJbVK8C@s+2FuY2d|Yg2&nbA1h;K-6cXljMi{B!_&q9pA
z!wa=ruZ8_#7q%q}3#D|Y^h=YaoEcQan`@d9jd*w;DaCaapO&7MaRIl5Mrk|oxtvmY
zwLvb<2tGK7;Kx|R+ef(VlRrF^Fwa2owz~O4G_CbPu2OR`eXg?eunL}Y6S7<JPB{g#
z8FlmL^DKtp3_^42=(wj<pQ`6`p}->U+>~2|R(I?yrR3C+vy_$VbS3?m6=`f}PRxmk
z-_8mcb*y}*#!Fj1hKzhk&&A^TYD3$2qC|RvPcnDCBeE8re?Mg1gk0S)I*K_P7L1#!
zYmza%&6|wPZo>PyF@Ewm=mGV7IbY{O9t7uN{yd1!)$|ekuBLj*@2%$qOpaB&{0-`@
z6PAmKbI?zUZRPD)6dn4anF-vI;wGf+44SQ&oJ^Umuw46Q6feJq`({l2ykMJ|G)JMi
z7&u4Kxtg1M*J~OY=eD_tTOlYHv$jH9&ZhKxZd><PK89B(Ny|m$WX{$I%-Nv+l>=X$
zuf<O$*I(FXLx6G3$VOOBMs2-*Qf%ukQ;;fuQKHRknT>>84493aTsz}vKGv;mh*eK+
zZm7eL1P6>)h0P9mn=rLTQZ80(g}kgD^`%=c;qOHx>M?}zr=$5KE!}NyE}fj?6)tN5
zFJV?IAK8fuo_>CrLAc)6)AGkxIf=~0fjJ4z^}L`bg*{W&h1%HMc@Uh7(eofaXVYUu
zYK%9{NZ?CYcy1c#>+I<LSlEm&Qt&Y~|BvOp&vQ`BTN83}M?M>pt7G_OuNM6jeQOs=
zvk;JrQL_+}tI5QCeI|B-)F;KSk7T+gWIrso1UVNYwFEzB>!5c}Y3AGO_z8t%@T!)#
z>le@EEQI7_v+P9WY(9UYoqoM5e>QA|q?`=d3VAtO6JJd8Zjo^9pBY-~%AYZ_7nGAN
zvlo}EDYJYek~hodN3Jw>>uy5Rw;<C)h&EO{OR>4=&6OLqWaI74FkXnso1(3glZ$2;
ziS*loZJ|(B@VV&0&%}flpcC=n<T`I&YMm^p9o`@8ll^R{brN$O=dfi1YfgG^OyEW(
zZ??=%MlLqYPEyXcL(iWbuf7m(lGIe!H`Md3k~XqnD<tJ)$5zP8*_vFgXk#;GBO)jJ
zWg{qO!{I>@e!mzS_2<q=S%}ZyNt~sWoXnS{tbACo#=ONfHwWg`g4syP)q>f`%GrYG
z@LXn$H7DkU7U0vbAZLGl<g#9iMdW0=Yy{<MI1IG%^4m5Sjuyk`Vz3qq$<<g9OaRkA
z<;hzo%R)jfCd*b6DXVoibohGu4tH_oZ-C2QP);_?UR<sn5EAjL7&UD)!nG7V7o)XQ
zMy{6HS*ODZ+rMU7Q$u}2q=fqlV~q`o`Xqir1W!a#-loKZl76wW+L`$LAs(lUn1jmw
z#Q!5k&xuqbmgs<2QW$nwm)_-S<l_6?(kH1STjm$7F)f_Z94X-}K)!36eyu86+0@j~
zG#tNTQx|U<F}D)m1a53-lH2~$J<Zm0kzFb{)seeYeERb{&rO*1ZJB<@g4^8mI~Ko7
zOh5VCGX0JPx4G$eEPj`mp4Tw(5`E>j<%1Tspv|4p!glNuuY}IYQoLAQqdq>+M&o}5
ziEVE6403mgl|!fBF0gV2iEVD>406+3IpbC}<6C(cG7?SlH}ob~;|KKc%%&+(KQ%Th
z5ucs@6>RYndMR_FNR&TgUsc_d9F?fA#bg+B)PZ>KwV{R|4<CWwG(aBrwl~klPyIE_
zOvY*wO*J$5QJl#$r{J3(@|%*tZEmbfBvmHsjU6`xb+h^c!T+Rwt@mNeKUWs^iulZa
zE4+e_`tW`F&`8#j{`PIQHTCS=-CLYxpGb37#!ef3#*o3IW3e%~!^Nlko8wK90qWa2
zaj~*l&u{E=={fDEpVNQ#uBDFOl?}?mySuVkxw=q(7zz8M`1__)>&3tv{MyE@@LRrH
zk&CnP-IiQE6#V{xKFLbd^^hlAWGJ4LCF4WlQxo+Zg0mO|Te~B47c@%x&|DqP;znLL
zaUi#f&%me@&&evgP;6?y-G#!_cGUC6WZQyBfB##Q^$krkuzg^b|1op178;z)<<Mhy
z!`7v^a5rpYT2E*G;$7=LtIz$tatn^QvKSW?ta}TeV{JS>wW+!eXK6k5a$%)>^61I@
z08<M`rEj5KDc;@ftd=@#W}Jm`D|z5{2wuU!*)}(9;h*3VcWhj|uZ`oLa3(&=P@Rm$
z>uddfQiZ#-%>9I4`;`48M~$<%T84EH_cuGyfiHpKik!Bu3mtmY_K6G}Xo2vU>=P*y
z2_BPuq60)CA_<Sk>n}(|5*};&MEglTl4Kv5h?dGcl4KuwjP{jzlJE$;sLUflN**IJ
zj|5E`X!RN02X5kj<SCJ*ASz#^2U?g$#;YeMVl(11YU-NGWL-f9;s`~{L_!{;10;ha
zJVKBDl1~yIA+4X}BdP5p6VXzcCy6{p`^r2?a8zxR>1b4zO2Q+gMPwd`)=%Wi>}ZKB
zmBeF_90LasfJb^vBzQz?2gp2<+CDN7?Jx5rk;iC1nJ0-nMoUGdh$K7$udmD_N%p}}
zYbCOyQCTVpkEjt5B%+8{L#Cr8vIdAk5@}gwV1EMeNMDJBJVpn|Jd$J|d5rd#d6LLu
zw4cnAgh#ZeRFH@yI4Zd^9qlViL9}K9LS{#!vQ!dvjL1Aiym~SnEs>>?c!dHpGO(ZU
z8jkduNbpFn$vhHxO&p{BWu7GR80{zXB$3BxsbG(QXw5_hv*|xsN&^3RJTe`P%2E(j
zS7z`?PYMzNQKig)Ys4{HB1<LlSY+nFQUdUZZeAu55lQ4RIzSXfNZ?R$jP{p&B(;5H
zBHB+RB9h2sv{dp*B9GC&G7m(%QB;)K(Woqy1V^o`$c{z?YlH-T@k(VnS|YP0@d{<;
zz`krMkFZvmNJJ#zk$x2<LIS_ay#68)AxZX;$7ny1h)5!j(Nf7rg7LGjZnVsf_LVgx
z!BML%Dn+BRE{IlD=8H<vh#(OVRmu$bRhE{>1c=6DVPA}{4UO@7TqdLHU;KlXMFt8Y
zkI^!jCy6{p2OtmVB=EI3M*B-X68Ku?^^<ud7-(f)smzlEN7W>mj`kI-5fI%}k-=;j
zKPu}=f}`SLnuD(_Rm3Zm>1c^8mBcHQnFAvP;E`SziHIaT((8gmNZ@sGjP@5KLISVL
zynZr|1XoRQjFt)#0nw@oCYc@WD@!H8QL8QMMg?mGM5`(?n2lCNWGRR$)fu9+M3#c+
zQZ^nb^$kN@ej`W%C^E2wL>{AMA`y{99-{-0M~90dd5rd#d?awVNJRU|JQ6ru=9S7k
zNpMuHk?Ck(Sqh@^nSstJj?t(rl>|q{qtX#ss)$!A)6o)HDoKge;_%G5mgO4UUq5MC
z&0qK#w)%J2NtVU`+pBb`&m#V7r_#6YmC85K;MIJmf)9UIxhku>#j?uq|7tXb?IB+W
z#2XZzgZ~*8A$Ao1$%DrG0L*A#<K?PsDJbh}-8A33$Ta1yfZR^tqg?8y<&Nzh)MEw8
zdLrte@&0{y5N{3ex`K&#l&|rID?F{o29%}K<6hvIdb|NX;xIC3xywUxHyC>Ct@v2y
z2d7%r{;a6N{ImS_{Tz)U9^-mARQOjla0~J}BkG{rJsNzppQSQ3LoVe|-+e)~zE3JV
zNAYb(Svq|;^;P<60cZsAh{d4w-3UHY?p8xz>Zj#SIV$M44#1;-b<koagU{>-+YP(}
zz^w81m3Usi>Z;mD9tPdMf)HN2TYbA6sQ9Q?Y+SH?g}_@uAQd#;zsCmK*AaLVz(YG9
z4656Amcr9|tpi><JKqjG6nT1VRC*ALLCd`*B)1lF_4#qA;-en_cr~cU8^Eg|kO~^_
zD)5<hP6Dqdc&JA=P_4%Y3Qz0N4gaLm;|R&;>CqE>Y!9&*wA{l&a+ex<9HIDF?~q4>
zdXxa~Y67XC@qYZvpdPD$R|OvGaU`hLV?Twb^>{Rc9{qr4`eU8agIEk&ZX_i4YeSD7
zijR8y?zcfbHUMue@^#R7aqyY`=y;oDO#>74I0jVfv0mY6Jr<%ooj<;QF{sB9@UcC_
zV$gEG0G}y03Awso9jEwMZ_VbQ9?O7tHGx#ncs;>q;w=E4_Q&zy)p|Uj@U$L1QIJlL
zWp4%bC<PzeLo5a@cPaQxxtk0<`Y1luD}ZwFuXnv11b~B()<L&t`F=sXtp;8Rm?@Wd
zG#2r6z40hWr^hM4GyByf@UcFz7>LJkVo2_GLvCM`Yq@{?RZx#<C|Il;q4<b*0r*V2
zv|EDfIU2%#)z84&sPHtz*SP4W(_^bVkG%7|!=6$PVlikvwt&x+JLq=5UzI67>L0!i
zE;-A;4!()T5RdVu6P3QIft?_?3-Wc)?H&$3%GC}T4Y`y<eKA$??02=o)7QZsz)PpE
zBl#LHR{~0uzQkhC`hGJoD0jS}?<tCp?fBjULBEv&FG(O3G~So@2klo2Jlc(Vl!KCw
zc(WCr)_+w7J!S&W?0=6cJ&47i<z5t$yVTHQsN$pCy;cSFSerqQ%YPEoW0j#trGfWf
z@R{dPDTJi+$A6{1UjHixAKODL2Cc_e;A1~1XC}f{LyzG|Yx}KwGpNUKfX!zG6*S&)
z;4|^I1Fs4^^v6h0jkjFkX@9H-UOGJ<cq8bKP2j_yz@lg^_g?Usax3oe&!f`~xyA1U
z_1FxsassKK@g90Rh&LX1J;6gg&H&YV6e>KeM>jMgogV#xXZEX};G-VIV$gD<A-NYD
zdSGhf$qkPOtBvvCNi>FdjMp5k^i>Tkf!xl>*Fm@YB=FIGdOTPNxojWx1+*vkGKHtd
zgNh9Le%3?js{~XjeTl`O_5BEZrrgDbz7rH5+wt+kLBCBvrO^aZLF0WFe8ekP`740O
zYX|i>50rew+p6%i{wq)^o!>f2KJPqQ4L;T<7K4`CAtZN`p~nS^kM&Mo6V&5T;LRbB
z3L0<y&x3kw1ztILs7DM`>(N)?X+25`((7>!@XY=<2z+c0u^6=6aUr=q?)1;2$%>El
zZu&(~j|$+W)8jDknf@pRUODPhk6HuoYK5oucp`%yE2X}kKh`Tfh{d4wSOGp$Zqm?W
zs^X&_XFML%V<Ye;=tdZL8y*YdEdbu9D5o9?1FuryX^5Wtr1!_^z%%_(3O=@nSPWW^
z5h1zBrM^Gv6d&t_$Ak4a(Yhj^?Ry4|As*uqHz|Ep0|!BFXXNXk+x^UqQeQnDEHLCY
zfSFj7d!WM8<3UvheG|YF`YHhvmA=Gc(E7$hau*wNn-pI<eYY6;zGCRx0VhA?TJ4qG
zTFB+NqJx&Z>V%-aD<D^o8#BSI_5B8X#MAmdkwM?_lFyqDtylUIi$Tk+3d!AM=*#m-
z%l-R9N)J)nvNi&5i~65L<0Zjo_WP~CBM$q)JjF-*{aN8@f3My*eLuA&pLf1J0Y26z
z7K4`ip9h0-C*I}v(@PXzI=_7ZzjZ-5+qcQ^+mrVN{k9HrG1c~hZuev0qrSSI)<G`i
z5N|%Hw%@4|&-2Fyr3ZN!v>qpg@RA1J<%%zz9v#p2^?1$DW5DvD9-EY0AruF#M_=%n
zdR%PCy~2?D!aV}d(_^#3BM*bt<5}>Tcnb`?s}vvgIQFezzuF4C`N-En<E{8((7y|T
zR|O{8`5I925$|w?r}e7cFMYo{8hAL5ynfXPKGr7|gO+<_NbY9H?Syj5U8wk2Z_%HE
zddvY{Ir4STcwN9pyOgVfZNTe^|A}`!sMh03g{Sp+G=m;X<^0dnW1Z52SPWY367ZRF
zyZq4C14EuCxAO3y9vgsns6dhj-JU;o3*z+v9_>IqZZ_~vQh2)F`x*3T2A=7U?Me?~
zF=#y+LUMZ<dSGeC(_{aaf_i)nyhjC+JZQXoHU#w;1U%iZmKb<@Dm<;n8gznm^R<4!
zGxb;tKH7y?3|ej^BzK{q2QKZN9_`l$^;i$QP7t7j##{7!P>-d+TLdQh16|C+`x<<#
zuJw3h|MYrvmwaBo+6q4EK`aI>_t22sUU&QbYMJ6=y*-`{>ah)YWyse-<JsUd`{^Ly
z6@rO+EC(eY@fNHL+PMcN5zHqKgT|W=J`-;u@W@BJ6^f7P@cg9^<7rpLw++T39^<e+
zN)KhgUXVKh`8tq?;cvaATy5xD$SpxW<=zKMKFS@W@bvY30r1lGt80NL`jwKqNa;%~
z1}*o>kle+FKORtg>GUl#^!>=tw<k_O_7^>WSpvBg6sUrh``ep>`mTW7p5URr4}xla
zyDL1c@8%5pHUZDn_kHlO-Na(ha_d8KHyHY^R(!1Y+S5u8Rz~;~cq`?<;;8Ye!DsfD
z&A^)k4(jnRsMh1R3QxJiT5>>ozkRk=>4CZoE5OJ05Q{;}{b+4a?x1D<dGrg#$9fm+
z5!7Q9@U|ge2aWeO{xS6!z09)agNb_l5|n(z8>jF*Jun$c*Z-<fLHGl87*>Ff^@+tm
zJcbMKk12P<GGC9!P_E_P_Op;4z?(w=6*OK~@R@j<m&t1<^>_lj8t(@RPwUa+!1Q|D
zg-&7WQ35{dK`aI>_jd4^a=YE*>+zK0W4#GT0MDBnmH}@W(mH6o?N0{rdI7HyOw{9P
zP_4%pg{Sp+BZD4`fd{$%_^k9G7K4_%C?t0&<aR<i<*rkF)Z;Crf#>P54S2(m)<NTq
z0-tG@Rlq9*6Y-t{)q1?D@U$MK2c`GNQ(%BxPmgl&u|33M&~hIKpDA|(<Z3-$P<*Tx
z9>=SUaqVBgARgn2fl6Q1z~PWfJRMZFH3)o^tH<%pkV`q#7ng8P-#ZkZ9@i#h(Dw~o
z^n|`jK&{f3SPWX<P2e--ZZ-6MMe(s6<6aK>tqyo~1X4lc{q?1w{k8+I96Z$HRZ#K~
zZ-m0r`oEDukJ-QzdY}%&R;35A7_{8xklfPczTY+}KFaOCI;h7s;I)GQ9W>svKMm?p
z0lfKOq8_h<YCU=>Jgvv42dD3U6M$#x@iq9^9%3<Qx#L4}*BN@esrXp$1~`Y!*7u6-
zy2^PNvP95$Mc_00^CsX82M6`QEsUqf6$(%5u^4#i#^+y2zj^1;GVrlI#A48Le*r#I
zZnq!#{&+|6v0mhjpdKrMHy`;rXuOC15X9>RyecqJk1e3&Bi^wJPwUb1ko0<-06fzl
zrQl=zEr<+S?(reH7aMx~Rq?Ujk-rJ*F$j2b2&96>d+3><9t(k24j$_9E~wVyV1=jk
zSd&4IQ-Npdu~z9pECwz2q>$VVkjrt1a^F{c)MMe=pdRai$MZ)Ajd%FkpdOonHw{e0
z`w&#?aXI+dPqiLPag&#>Up*|ZM_#{L2|l)mSPWY3L*O&}RmBQlkB<}|>kasQP><EX
zTS*`lG~T-31@XoMPwVjsc*#e+-U?6aG2yWEdYlD3(;v0qV|`*VXt`&G<URqp+8>`Q
zKGwVX!Jr;>z?(oI6*S%+;4|&A0eGxWe{2UOAJdmAJgvvN40>F-DyYXsr3bMXwA{<V
zXUg3Kxmu5ZDL%@bhJlX#K#x~%0B;U6RM2?0y%xmV3OwpdJ-!4bAMw7U@U$LPxc^Vr
zuU<swHT^LWe5_9_1}*nF@R@oH`mwLa*NTtz-oXUU)T0)7Tad4V#yb;yCf;b^X+6FH
zv({si!qa+GbWg9x`p1KMRDqA}Ar^y{yAFJ&+!cl%HX5$wc3c<KV*>EXBvb&e1Ncn5
zHNYzb2mRq1c-Q_W*uF)oedJ-#?Yk0uCf+9CQ4iwnVc@OZ7;N7X;LRtH3L5Vm@R@j<
zfj1mH#M{%rdqm-BJ9j-Iy`4Xo*FkR_>H$8sk5~*^?#JLW<@UJO?=J<0+>tK?_2>n>
zMhO+b+q^!AR|>pxa8Qqq241<s(|Rn;phpw%P|ee0rP6~~3|f!+kldu9$9{&~VaR9I
z_M$f01w8J-(m~@r2m70LS%7-n+ebb2H}D22JPons$n^dg2|QHu^w<VI`h!>uTJErr
z+=W=M=!A00?E+r%vEJ_=3F@&Ocyo}igT|W*K2wjSz$*t6@eVTZUQl>ikGi7tdi?hn
zK|SVxkL@8AgO>Xh_)NK*4LuGq<nDKWP>=b*OV_XNUKzyOX6SL4fwzak(|UZGL65$`
zLp9GIUn@O`W$JN4NNz8rwLiKWa_i*y?Dea5N2On9Xcr!zfmaTJ^hcqAH(B9%dH^ro
zbzzyjp8I-$uLJOi#i0GM6nv&XE;jTy%8>iib3uQ!>w&#x5=tC(dmaa$iMJ4VluJF1
zHt^1tcwYND0grs-VbJXx8^T*`;2mq=ef(^&eO)uO??dpJ?OST#9cSQOEb+Yd^-%32
zkJ-LCA-oj^-th)r-zS6Z>jk`Y_hsvU9c<q!;PL#W{dyaC$0<B*_mZR2_k(KSp_-@1
zAn<hn9<dm-oi7N<?Sb<}_vaEr?w{KS^{4<|t%M5TO#q*1=ThL6fP;EO4ZJ@nJgvvd
z40`;2kDwlFlpe%l(0aTAK2vV3p+`SM?oBTS^>_k!Un?vVuRHimyd?3!M?D4@cvmYt
zt;eIsruWA~F9h{i2R{0PSf<<uz-P)`@PO}+6AiiHb((2s`_C^wMPq0e#(knnU)8`3
zkc(ReFX(o=ichb<yq`gjnGvOjs<>V0adJqHi@--c^bOKtLyuDpJ@!5z=#Q^~_d~CB
zzJFJA4%%e}@Cw04e+)M8Y=x)wTG}(cKL!I2)x7g#CHUwMVln7`b#h4VIzx{NLvGj~
z7sDT2fy4G4iKzWC{NkWLRzoiNbkOZy@ZF&OHW_kHGvuD4@U-97XV7=uyrADUDSe5>
zp!Hn~KGSbo4Y?x?xnX@58~v}y(09wCpuU?Sx0@6xj#}T%;4|fJhujX}p#4ra<eo0^
zyyxd%C_Tu-p!FCL!u#65JHx<h#{C+rVmOlFxb*9`4d7$@$`xBX?BguN|7_ox2HxHh
z&+Avifk!>a!=T%@X9%wc@U*_;47>)cBeSY*Uls7yC@d520PvaZ>jk`xU|{>sGVtOG
zPusoS@#)Wx$GfQhLLms9z{mCxi$Ux0OYoU;zlPjSD5u;BhTL#}S!tXfM}wDmjOUdF
z`%72IMV1$|+}{ld_Lq*hUoQj~<(_ZItx|aU{HV&H?-<~rn%A!;Dt(E?pyiGX$?XNX
zTHo&&a`(I~=(k$nEtXILy!&nq+HVl>s=z@#CK-7D0Uw*9{q{u$Jw{1Bum82{CH+P$
z2Cc_wA-M|;J!%ZOVZW_C+aK3T48Prpen}DfIcG=6oggI2gO+;=_}E{xB1<8+1WD>U
z#gKcW!qa}M1ztx9C5{^JU7Y`@=J~A=eC(&hV$ghl2A?T+1LSJIB@DS?ecv$j?Q7_J
z#loPzb08PD@?Ow>>Ht1d?q<kk`>1c7A@{oqPwTq`cpW`7UymEE3+lT9e8eLbgVy&t
z@R@SAuJZM5Fyuao$pEYB@nse8()n#F_=s1I$gmxF+HV&bcxx1%*1uiv^m=rWd|p58
z1U~9PEC#Jdr;ywpSm)DzOB!<Dc`v9(SKu8ap~O+Q=a1ks^(Y0N_Qxy(?^KEBwXa0A
zk30;zeJ6$R1{ru<2P7Zy`{Tf>+RkObn})Ow8t;#L2HRHwJdS_tFY^q%UJ6g^wG4P2
zH5jPIyBv6^=IOBtd~6S~7&PCdA-NYruD0_fhTJ;~f_kh0-VzBFz$*uzY3GH&(|TNH
z;N7V3v>v1Tq}SsEfSGzs03Y=r7K7H~UGSN5*BN?TZpdA8a8Qp)z^ju`0lag;XX0%#
z^jKivJ)rQk9vd>~;YdEuA8#l<h{d4w_y(QVl-uzk-yc^Qa*xGinN@Ya+5)_E<It+R
zf_UA4NBgl~U1Q)KuJE)T)(PqT(GPg2=IPN9e8eLbgVrMwlH0@3W1%58JnnvqaTiky
z(Y_Onakm@#8%5~rOc%(-5a9*g?#_x&kEbOW^!OphJE4cFI7sPnLr9N1z(;@R>sG0u
z$Bl*_KZoB$`&5f6fQO}UFKD}*7xHff@Hp<$A2%C#_bWWD7YE&R=lLFz&-VxT=nrBs
zXt{Ps?ovaKTMfB<K4$9C1$gP^FHPVx`{^p+RY4y0SYqHksqnNOD>LX(DET}+)+jxQ
z#h~@*7Lxn5p~szu-1g{1rXEiKZ@7dC;Qa#kjiw$Qf9mhQy34@(I&^>84)?j~{4q`P
zd3tmLAN@fr2CYYJNNy?Qc0xJrx6F{+@!g;vU4gfjKq_dwi?#;!r~uw1@DOjgf#)bZ
z?T<Gy=<&zD3b~#hTa_NfV$gD52cK!b6^0%^Hsp5RKd8qx;HC4&<1m7Wx5n_teFk0!
zg{Sqvmrc_919+(B=}`_o`h!>uT94Y0+|7m_4;XU8<5jzJe7|*vt%=9@<WWjr)xhD9
zizNjw=ytD>eBL~EqH5oRq4uo?AMK*Yp>1d%^`L(r+ClrepnY8x-*Mp8?RyNyrwBcs
z)<W)lq;()4!=B(X<!*;uWC^)HGvuyTczWF33cPgZ$Ar_AKa>GJRr(T(LCYNvK2z?X
z)xMp1A56Xuh^2p5dayFW7r<ltbkKMUKMeM((ZDMN6Yckifmf{Xw13L`rq|>B50oBC
z&}i_nJ;Y+ra<_tydXzI0q0Z3bSBBhhzv^Z9t*7C)J<kpLZ9L@idZ~kM_g%QCnD)CE
za@juW`-CC)Kj34Nwcn;?(0733^ZIF0=}RmIt#99u+y#cdPZ@H<`c@eF_BQlg-an}C
z#gJPjMF!+<>lf5_vEkom47p1bp4N9w27ONi9;$izu2uRHi$Uv)4~zxuyvES?SwrsO
zOOzh6y0sp7N$o5H@A2D${be2Sh69Iwd)~l1K;dbKLC`DR`E~*DP|X|vhJ%m&fLIJ#
zk8?wE`Tk@llvD1DhTO2<Cc<xezE)}YZN{}hzg0nQy7MvtKC_>8gWN(T_a#H_zpe@T
zgMOqQ<YCZy`~!R@-XP%Ve*cPrcTQ-2unc&`5=tDkT~C*Mp8Yl`xvz%gjsPF!mMe@3
zL+<YkxncV?8ur`AuwUdyLHljWV87nrGxZ&9*zYw%?w!kn_Ukr4+J!s}+J3iz&%~=U
z^!S5;chLu`eX_dM19-g@mWlW2`$4-Tfwu?@>{o9ZcvBUgwmaAF()H(N;Gvr5kBQ);
ze~HDQ^=JsmZTEA(KW{eV&bcS3M=kK?3nY2ac!z_Jb}3h7U4S<n|5J~547_@Ur}fyH
zL67H_1@-t;=|L<8E%%vaLAetRJ^pOS4fm@BM!y<~HWH8V>7hzr)xa+xw-ot0Xt}=z
zU!WgAZXuYc?^Z)@QsQ~zWUqn$kG=PSkE%G=$7gp#2q8d7QPHAqB5FXyB!qv8y2NA&
zhzf$%DmDp8U^fI3Ll96}gQ7)6ixw>^R$9@5e`=`OVuc1<thUuQQrcRtwphIt)V9#l
z+qBjCd!94%o}F{Do3QA;-`o574a}Z1Gw(d_`@Hk#{K+|IbbC;SLGYS=cx!;ib|c>J
zExdpF&J*zg)TGZdJPJ9xJ=OsaR2;m07T!VMdE#ThOV+Qdw4B?owizD8Vh|oz`1HPH
zwa0swUVnS6M|%tf4*6byNIb@8e(!CMozTmEB|-F#fSlbPuS0JUgoyV?OYai~PmXU{
zXC~)+zrGG|+ieKs*dD}U5WV+6&eogrRAL+*wDg{VKkl$<rc)b#>j575N|5nzvX*oG
zTx#_G#iutPa(4R;gI?(`hb+Ah_xI|Z1iUs;immXN0y!IRIPj#u{FjBd!QhF#+kuy?
zzr3IA=yiF#Xm}8dLG<o}oUM0`<-fmMdJhfo^5{&#<1WbAc#Rg1e_D9&8a&}K<E-R7
z&eU=)k2#Q|pNYjFJjVI-@;!YyKlqoW_XRXMt4cqp10J6zkRW(<kh6I_1-uy$Vt?i}
z4&`Xa4udB=)=f&zqmPzzd2ECn>l2GX^agx-GoDWH2w8gl<F_5-SNL9Rjo(=V4PT>Y
zGxSnUg4jJ(%emuio3T%>zr?-@$k8ui_Yl}8{l2ed->)EI`*|nus#(tj!D~d?_VX~{
z6(Ns)?q}h>j6C9rz2UP{_*u)jejWum+D9w~(Mv2_?{v%0IhNis*lqJD1>RZ*N&g7m
z3+P8S-W=dffCzaEwD2YvJmIk`1rLq~=yiE?8Xm-A5WUlVde>Pz23val{bi>$-(O<&
zm#d~3zDCch&^uhKbbiI|eN#1GX^>5p-XWIW`36ts`wvp^tp%RL*C@z3N4FcX7=&+?
zPw!Kf-eWAie!j1Q?-1ayJub8OeoFh<z0Z(q^g2rMW7Mlb#?O+m3wovBA7|;^jd{`L
zG1TBuhCz7z6msk@g7=bz$8Y>mj`)5a?_2G5sm0@8=X={N480A+H$iwTft;;(kEQoS
zOYb3rC+)Tdc*%}42Xy<o^Tv9^mskwK_kGCOdSAENt-#Xj=bLd^VqW`<#W(+AFW-&O
zd$d;R{0iS=w47_-He=t(KKnieIorPXEx(-7gMC9_AEs=lU-4Zw@@35XgV(;D(0htw
znf?*`n&0>8J!I(}Vd>2>c+wvGfS0U2cE9KCe}@cTVlha2{1kFF-w&+z7-i}8x5p^(
zm2t#({Dkki;a<KUKrf~`H;CS~khAsXd|Rn7q&P0mu=Jj;@!WQsaIPK?lwlCO5k9<8
zz>{%VY~hXilCe)$R}tVnX7+8o^|x#LBBrbqcoVQs`^H#!1qRQUquvKzvi8UVo;{Cu
z86L!95FQymy^YW-$MbQP-ZJb1&pm%p5&b?9u^0sJSqRb35oRK+0Nyfe$zy_r$9>{q
z<Ai;Y<UA%o2>;#V(ILpu&#ccNdP{wJ4_Q3Uvh@1<RRsNNC~#=spN$+bqt_U|M$ZS4
z<j14$E%)}TjPE4+!8w-RNd`~GQFwB4zGni@;cN7cf*ko0i$VB~^XbijUTL?<mR>*K
z%PhVx8aZMvz1hpR6ncj{8ugD+ul}&w%XgT?x7^aZ(BKK*%Tn;24?LT1o#9I?2H{)l
z(>vVaJH^uL=i6-YeZj~PbNeM;zKzg3%+aWSjCxfDIeXqHwe(K2^nT0W3E$Nz_`WpT
z%XgjOODqQA`y%9Qz2%nP3oN~UzN;<1ZyPyc=HKJxy8(K~IU4nkQLlcq-m7;u^cF&d
z<70-U_ZWjGeD|c_y99Uvj$fl-ui;B92H|^^Pwxtg?<`BNpYKNSmE*!3*hoCa4@Z0X
z?t|WB$A!N`&i3;f=nbPj`Ce-2-JtPY9>dG@xTFk&@L2D|dklD4C?_7j!$vu#{XCum
zkD*5H_ePGgchq@#jDlYBm0;AX5aetgPg#1eu=IY>;7PkhfS2s}vAovXZqp%0yNSg>
z+ZdKW&epr#YPZi>di{J~viSbe$Pu$?jF<0h=*@F9=^vvW2Su;mmn^<Dmfm`UCwybT
zOUC!E5-;CY$dNCx7=-T~khA&jvG~?mdi{Lgw)lSA$Psf`v6t@(=q+_L>K~(CJ%fu=
zTkqQz-}#o_JcB2E+kuyi@8!U=$K`g&kuR|rgzu$3z3*Fm8!Wwkz8`?EjLTf~ec~}T
zZ1nQo1-&DYFTto+)f=^(@HhauWIX=$fS1PykRy+U21t1P19G<iKCpN+L6&l?=jW08
z*#wV)7LPaTy*x6`^V(<Bt6xLT)|<0U>*0LRV(C3f<GJ%oF7Rj%Wf+9VU?1KP3$N9}
z^Ya)E9z%gcy;X?BV_dP!%VQ|?9zwnZ(fia=FOOl+8-Wn<mRfpS44$-GPPx}Ff_LC*
zZ@UeJ9QhK9LFC?tobA6k&@1OT*I0V}d?#7$R&DY9XSJ7a7<vmGjrzx^R|k!p@Ti1b
zvi=v>a&EiLHatG><53Sen@6L?<GLPr%&^+6#^P~~_MdzIU=H-o(G;9t;c@*Euih1w
z-s>&Br3O#<ZcD-U$F1IW+hzC?iy=dA)DIzN^Ic=<z0uO!b%SXSQ|~3<;SlNu;qgZ;
z=UxYVVDx^`r}tgRQE$W`Y=B<&EB4dXmfq#7ym~V#lIv~Ka<1M|$Pw=rpWX$Kv-NJW
z^xkUe_4m`5)xM{~#tdLHW?$j$r<0(!4fzr%!?5Ubub&@--U-Mj-`g#{%HT=+ZU<hn
z{`^bWV;>h@G<=E0AbNL0&Tikgp;yM`9hP1{-!{~f<3g>)_qLf{zMasELysFo@6C|2
z^&YbPyw1}5_ZeOuDyrL!G7N(ESIF6TA6R&ITX=pR>#TOGvv@4H!OJ5HddF#%&aY9g
zesjH7Z^ko;etM6kx5nT}yG4MPtlcgFp51QK4PRn02;Z4Ly*bb;?Y6<v>*xEJ#kbz#
zJNhjz-`UVxr&W6NF8iIA?=a{MLxTPE0ZZ?2gC~5qrQrL+H@$p!8NS3~5We4soZY^Y
zEWTg2^!oYkviQ!k_?}<j<@*x!9<5b6zec_Ke!f@lbW86;mfpz*Px!u_g74YD3s~1t
z2Mk|gF$mv@KD~1+y_+q)e!j1RuZ+w27T@U?dii!iFXbc{^{Ntbwx1g<y^mUYU%tT0
zBL~m3aXzICgYftf<ZQeZz>|6WaSPAS;{bRJ1rGaF%;M3|=H)R2dZ$yN38MGs*Ln4>
zg5EG>h}UlEt!~qJ(r(qjOExYez_Z(}(eNb}gXo>))4R#?pR5Z-{(in$nE$2S8Z5qF
zzsk$E6?$>$;s&E$tv7PQV{-}~w>5itJY{(BT82S*+zdIp-JY^|Y_t65=P}IU5x01J
zw$RICJM?C1mCmp5xCC;x-d)fu{YCDNGyQ{8y*zdq9+Y7a9vzUg@m{j<cJ#ob2s~sy
zU10He_>W#5FG24>t<w1w9vifrdp`NPv2Ul(zV(o^?b~D7_goM5MJzv$w(J`?%4^@-
zDeTLJoUQkDOYbgAZ|iAZKOZtYD8nFrZibwV_qK)iLksU07+e@fZrgtVyfqGz{t>)+
zkRx8il)Vo;bPZ?x%Kc9EgP#~YV~$!~nSA{Iv%leC@YX?&^@+tGdjAGFTknwXCi=lo
zEFSz$x6NY%@WKv~{t<h=ujSnH&h19;%Rar|gPg5*IP}s!&R0LR^!mr!Z1e+}C(pL}
z!MXPt`;4Al(3|YO=+=9^?KaBN`--J^tihA{WiRmHdN+vwP6eJlPrh&X5{p6PPV(t3
zg<ctNdn~<vzKxeB_?~0&9dw?T?;+?7I~w(mQLi?ZdHI$@Zx%%8=U-WR`xrdoJ7j8d
zzGH!B^9@6ec*J55zQsPh(=EQQS$h3^S6O@~S$zMF^J?gIuNw=YH`)2it&n5CQpTP+
z7T-54y?-)z!Z(tFZ@!ju=e6mEFR>Ve@9{ppbr#>fmR>*K4d5&NpwZ&{&2?VBv!V9{
zt<w25>eVJK=i1k5?0d^+-$uywV@;FaYWYR(x3eAn_B{ssWW1eg*>`NK*S;0di$7ty
zLG1h7Vz1s6mfm+DME_CmAcH6Eu^o8H#@jbqy#4P*!<SeL(jE^&&gQ!cdd1K0T6+C_
zcY*H^;Bb6IEWYpW_44h6-ZCmQ!Khci+pFb-#}ND-KN*jpmUG)J3_1GY4?Z6M`mLA8
zI*Z4jdf@RYcu2cVws@=!dwCQ>Z?bXp>l3|tH(7fBZ0Wtp;0fPI3cjZR&z?7?8@|M1
zkajEZ>3z!5`&Ub^zugXiue94ji|<H%-tNvDv!OTaXw*NV_Y~iG`z}jwm!<df)4e=e
z4G+pN2;OqY+5K-1@YufWSO2i^{5&#nze9K|vUv16)!S|>pf}n1WFN@cdSAEnerV~f
zIK|6jmEl1d2H`OoayH)E7T!k|o}b51@R0G=Wbt_F4_+Q?pckhCZZPWABU;WK9~+E)
zL0~b6eGfy<w(ot*zL3$IY+fsbeKJ1EEc+g=^4hlvdW*D5=U43e_2;~L4_SIMExj8I
zo{Wz@z)LnC<O0tgAA1d7VlfEc9G~6~pjZ6d&(iB}kBG&$+2UJ%rI+tM=v}K-dh{;B
zO<LQ}InO4Zm(Q{Eo@wxe@3Qlg^W6Y@Y`&`?$95tXgYaDsIa}{+=oP+$EWLidm!Y1t
z?^PDx$uqos*Ff(Ct<t0Sx{JJe>ny!_mfrCOPx$Ui!S}ffy?i?jUt%!`-yM*%`L<em
zkFxao`8I>E%p2!fe7`-?%lB32O*Y=X1vy*qD(IE@YN)06k0ZQ1_8A_Ov3a};IU8?{
zg?F5V=jX8sJfz*GSUmo4mzT!@=q=JJonIN3H$u+VyUx;kyruUogD344#(bS@T;^*z
zcODuAIr@cI4AO4L`}A&rUg@V{ORt|V$APq4i^cb;sF!ak^k!?7&ad!ohn&s#F^lg>
zmfl*8=kkac9+Y7a9#uZPrz|}Az7P4|c$=}$sg1b+cww{8jo__>9PNuR6Ja~>q<!V@
z2E^-HWBQdNg?nJeKFTl%-XX}@czZ1S<b7D;t$Dy}Uo-HMo#*62&c=J)!aL3K-}MGh
z{Jt7^IgVxeN9<ewRWFZqkfS}sVi37?khAr^4ZYG|<o*Wh`TI-z6^Z`BH3*2u*m;lP
zYYf}~y~&;%c?ojVE7t*spf`*p&r6CezD*j>?Juty9+Y7a9t(VUL$)X84f)PaG9J4u
z9<3IS!pUA9d!ZLotQ$n{2}VxFZ_x$G+v6t@(;mhzlORWX#`$=>06E()!@xt@V}j)u
ze|x+N9@3wmhYo3vKQ8q0D2Lu*E(_QFYBJ<(y`wC>XIXmRHh99f8hAMtp7>>bqnB?Z
z<j9v;3?jD<a<<+{mR`BfkgVMffUo#viLsBE9iQ>?ZS~nF<K}5C=k}{MV;`?k7{tD<
zkhATZ4*O^i`>C9-G5wQGMlUNPtOnj{z3co6UK!+w7cphCfyaH~l^Y(!d(PmAy}39Z
zC-d`;2aTT%-Z03qKCu`??=z6I^{%u0EXOz2^Y<(MQCyA-a{WQfaK!89;n2(WkRWys
zi+KIF$?~7PKS;e#o@;oRilv4JWf+9V6Ogmp<1q_wI%FwFyn}dOA%JZrBEux$?a{l=
zui(vqob8vVfY%HOw#S7Q-a7_Qc;(`}ELnRzImy=^kfS}sVi3JgK+e`Xd`F@`&$RUV
z+hfR_#5n%|#t@J37ju2>0lmYi&;+sjRLI%>E4B2_w)FnQ;K?|zOu_f_HQsicZTJ$4
zLHI6*oUOOq(kt%=B<p{pz*qX;GGiYxzq!)OcMkM&{*xelHyJtM(VBwC-`c!9+6<4&
zeLVgGIh)69i-$ZvnT$uoYPVq)kNr(v9;=~un2^9$c$@_}TW_7ESDr_r-rpKL;kyZV
z$@=LXi@bc>A;<c}Vvu&b4RW^LR!i?(!y_5r%fMIW=j9gP8^7%3yUk~x@V!>cx%2Zb
zV;}!^ZrisMa<+Y|U?1(__?5pqC$leRwa1B;eScZtweKb9P1YXekhAr!vHT)`f1}?0
z22a{!pO3Hj`JM)EdmJ)+iNzptcR|k9yTQ^c_idB$ZL`|r8jJ5F-|_MTpMBCECBEZj
z)(q`u-czyd8|^z@K4!H?v(cN(zO|Npr&#v=>SS+w<U((<^XHefoZDXtjeU!K_WcNQ
zw*Q{8?344qWcF>e`ior8uuX3Ig4ezx=$)Wl;{1yLzW;fz-tEvEh6MZRQp+zZ44(9t
z81Ryf-yrY;*7FRlhA*)gq`&-Yg;($E(3^{L>Xm+wjPEv!?<iv*F%QMPd{;p4Fe)@b
z_*Ov9_VfFe-p^Zn-!*u`cYO-J_r|<@HyOUfVi3M}L(bOwfu*<2((6C2c7m_?<ywpH
zGnab#KIXGe_&%ZK-2S)C*mr}^zDFTv+n4jb#C)}?2mAI~?IG8L<ov5IdhOc@y~&<a
zI2&@d-XYK%Mt$~!FIswEHh9t=hkSg+&)>Mo+a3zfm9ZZYi$UZbgq*Fn6nb+}PQABS
zdj0LuW$}#~Ibt58^}6@bv!FK_-_PIZ)mv`yz0J})z~BkrNx(}s-riZ|<y&d^5{p6j
zz6Cj(Z=J<=t)<t`H}}fKdEE+&?_cM8+jj=^CL3>2$k}>ZExlj1^uA~Cgl}UCzW2@Z
z@?B>563gcM70B6oS6O=Rw)Fb>7J{$z1DOx#!*Rax*5<QM#@i_0cw1xayT@l=p>Mpc
zgMI9$?0@(6VBZATC+D40jU4T}be*?7)<Lg5-%CHZ7;?5>Hb8IK=)K?4`!C;l&P#>|
zWf%nSAHMUP?G}#*EIhxTr-O&^{es1#<37zp`oSLP#qq=qvcKYQI$y@vFCe#88UfOj
zV|;Ui-Ws!2Y_|5F01A&cAV<GMOu;Vjkoy*!EFM2Q$BVZDc<e6{1n(!1v+-UBUKm1b
z--j(czh7ose!0%b5p#{<A%0l{z2Xb%mi=uH>wR&>ZIH9)4UzlSm%MWKq>y`-e5ZfZ
z1Ql)6^AP0hAb7VJzZ985%Hfuv8z{%PHKMmtP=1N*>8;>hgzIV0Z<bQZO_Bt*BKPCZ
zCay(TJcr{K9iQco!3p#o+h^XAMYXN*rbRW4qnpkMhr>mP67;_Q9amcFWEW2uGftOR
zXJ1z_JsJpzMq(Gb`T?!x=tl2T$^^>tQ2No|{?)-$dwY9Z+tW=^q(9oRuPq|^S*yO%
z#`11q@}jzyrg&Yru()XK*pi}>38TVuYZlkng_{<ITS_O4A747YZbZ1Yv1ZZy@YVG#
zi@_;eJbrZ1=#p?@thKdy@tJ3wQKK<N&u?m)-&nu6X-P|M{pi}Jg=e%jH8s}8YT}E|
zXl%TC;pxpSO%3(6t>L<f^CnE3S6Wv*Zrr#rbz_T)OX|ng7ELUjICkEcxnqjzYwO3<
zm5dozGD1y03kKKJ*UXKpKrwdDD;ZrhQDtWLotzcu7t9Xj1O}=>f!x60U|z<Mz)|X$
z(9poKf#ZS&fm0Ix>&6)wA^hWaG7<r;Z-tQRtNMD%`zjnFopzx6^YDkyuqDqnk3c20
zaz8KF*Vz}5Twv`nCJjO6;9!4eK61;kgFhX5@L6_3CV%m66Y5fLHqsnlCvY-D7zwkv
z8|<U=q1MqK<R2%hF0X5xaWys<o<FN~V*Rq(`eydY(xtJQ)(R)z&Mq%O-sqP4#?g~6
zzF>6yvUuIH(XI8%T1TV)tk#m^s_9e9&YLl#YI51sstYGyP%&%9<nt<u$Iq>)tCHSc
zRa?{8n7}#W+UaU6{)8+q5}YHl+^Nl)ik*L9{UYo%#uqK9Z#limar|QCxVEOXwIx1x
zNozgQi<(;NM^Cx%lG7Kr*3>RgqZhZfwAReUcKJeQ%jT%7X{~YErKJgNG5gZATBAY@
zZyjCCpCa~`!wpZOzu6<A68(3uH6Bb?R;}3KzUii(cMhpbPgQy{_sdBc<pg>K_U+?X
z77EzE2P4uR)?u3G8o+a(Yh;@FVzXd#j<oSO4h0WG#>G3+$0LF=j$;X8-#EzGctcS@
zIogMz=i>bt`?h^EkfvVBFo=DB#J-JJXxYbn;mhwy;=jx9GVF66ksx?K@Yz=cyrB@H
zef<#y?*`&o$Js^!GF$3m;P>pgFP(>S$&RxR8adWs=q~^|>0oe|-_1rFHJfZlF4=LG
z-+vIFQ<mT8+=(q=rQPWFc}rTCwAAZkERUbP9cN3%kDplL9B6w#&Q?!{0;rSY>`$RR
zP`RwUd5Y=~+vIqgF*4)TK2w*M&+ID54eSkKk4NCP9rSme1B3R*F}VHd;1hkKS<xKl
z2px<TM)RG$!f5-B$zKVqY;W(s%7{A~9?J(pr&`wWmn*)svv06-Fj8$hvhhm|s_?%$
zvnu;dT~^+2+VXN0yT-}wYfAUMGY%-HAP%!4`$GhgL2O#x{__5eyo_ibb;VSy@7loQ
z8Cwb++rrTi#zty<V}C|q*ZyFjA0)Gi!qt7(_XXR2v3{|YWx<YcG^@RRhhtes6!>Ap
z;}DZ^gH*5QEP>e6Sk@E(Akf#peLC}rjOY+!WoT_6d|OwR$~c&#0&A%?>{z<-nd*4t
zKp$0IlW{PY=SCj|HuE>MKGU@|tK+whoy=DqZ0e&CwVeYzZSeZj8BYu}^#XSUKL4Y>
z{a#V|t75UJy2GhGYG_AbxY`>S9$3#lpnZ`6U%c*UU>mRxB*X4Rf5?cc<+)qKF=B<I
zou(gnZP2`r>V@|<hj#$HiN&aUSI_Kcz&6e$$?WTJ{C!O2fT->lsXYGTGZ_c7l<p_=
zeMT?7@34H2OH<4D-u|!kAKk0|otFOIxhJ$=?BVX!t$oh%#u3q-c`BZXJ|KNebwr>i
zRUhD-a8r9m^k}20kJGDjon9SsdUa@v?$;_jyDO_IxHjnY=7rCMoNb@={j6S>X~th*
zvu=BOLv_%{VZ>zP@W9idCobs9*pU&9#0Nwt_wBzY&^KofMowm=Z=XFyX7pFb|Mt$6
zT^Y|F*bzREh1NB5L+rU&ILiDT`wm31rkuw)?9sM1sB(jD!$B$i7<k+}!-T9+l+~fz
zipO`(_sQ&+F;r;AkP3&d>f8~W8VKuIm~(ZqzAe{DG?eq8#tBqsnOU!MNAh}XFLf}d
zPX=ahdbc{hvhSch`Nz-Pr_KnJOx~wXQm1vj5;+ibytHFqyK@!hv_n$+iHA8Lwrp$Q
zc+T>~nRNni#;Vi1USUq&GlAI6vDH(;I7*03-oCmQ7&%i_fu4OZOT~iK>JH5$=2&UZ
zO<5gl%p5%m-0kBNeW3C)Tn{AkoA%StFd1b|Q~5jpG(&}}uPM(e*|}fkXB9>M{-tcr
zV*^w8{gdF!whKnHVnes)R@06)&4*3tv?a?GO63|@dtaAr=X^fxn)19@UMz5DMr_m8
zg{CFF{V?D;T5NY`EY9bN`O@1C|F86Z5<X4L16i>F(Ft2Kie~InCkBcm`_M&3cD)kr
z-b2T!(cT_f7z<bH`QX5gWOISGvw!8uIG$t`Rdi+bmm@Tf;cO*6rovGfH>!i@FUiKe
zj9+PEyX}eO&sRLcI%gdET!Q^Lh+Z<dy4pYTO4TUME4a0D2glxyeVv%y#18MVS)YTd
z*|GX?&EmyPwegx(+&{t1j)n2X_2F2};_%%1`bFWodR*Kssnuoirj~GPQ@GVz2N!{@
z^^nHpV;uKeTIy@+mXCITwGIcYrqRjQpe^;dmaM-T`sP8OgC~lip&8edHS_E1s#<Fn
zFVH|*MbkWwC~fq>F0OAKtuAV=Z>ix8gD|dA!$>TQx6*oK)GP`&&2{eOERDCunwGRO
z$0F}&8LgHqTHIV;8=n`aea@MBReeiKZTRY%#wGRHD2`vXq`s=LsdmAcXD(UfY#m+P
ztFLp~lRuwu;5Aq^;ugeL5uIzY|HJpec+Hf9H~^7z@*qSWOPPNfB98&5BaTKq1CjZ>
z*;ax$29ei4V-cBuIU*i8Q*#h;>r;IWk@;~%{7GKn&-~7MUkkBi{!+wch|3YLLA(}`
z`I`_QLVOtU8;F|`ng0mlqlk|oK90z|ClK2aw<3NEk$F!cK8^To#P1+7?-|7JB0h__
z9kHjt`+tQaZHbWjuMs#txLF}}>oGdP{t-|(@LGZQ2Y(LvMChy9k>+)l4t>=;q>qDP
zCnAIO|8~4C;jts2UeF2ii@TBPHV+<KED=JUr^I;;Jy_Lv<OeIR0U2?t3|6n5pc5I`
z1l0G{1D^EvTuJVP)KMzWgLjnrYoWbn;ZZ($;~bM4!d2d@kWU0&^(8_GZ_5>U{B4Xe
zA|X|v4tVqzBr0Psq)t{Zd&*B%k05=SD|NEF$DNQm)t5d^ebH0@G<5~i5m$;MArV5(
zh_KVeYJ#UeM@S-soRMOu$Eh5T{5bU|_=n?02cAVFLdf&iGunTa+U@b@S!x*k=S+%D
zHQpIdgpfKrk-%OE%=pZIB1F^+NLRZV5qFO}Aywu}SEx;%`W0#=($ih33U`k?AvML9
zo~ADG)SsqsKi{%{nomA~tnn^VnV$L=`Q&H%(zDfmkH2QCmyj-ZrDnT(+zBaO5hX$h
zGuzRg{&~528~Vep$mQx7q$grLGq3x6kZ4&}38^aeoX7quX1gJzYSmXg<+W}ZcS5S(
zmyWAzJ@Rp1IcMHP2&qNtB9Hu{L?QM<s>zpbQKLNaElMHH>n<ITwn7Lq`&%A=bEZ#(
zkTc`k=@sgS9{Ck27yeFUtw;!CFQmTUORrSF@z}T0SAM-OeWQBTBY&f>{ARV@Q+~6r
z{5G}3Q+}J8igd)4y3O6=PDp*pm%dY-;;Db9ul#QHj|6#?-L2k0I^s&*?e1|W<XH`r
z>HE}9PyPFR@*8~V2UNDFe?Q<W-{?zkQm=aK-=v;Kn&$#K@Ccp=A?HYLryo&wdg?!t
zD8ya}NA)I8Igj#*5W*4uJWn}~_=yn0(LU@c=g~hALe80ho%SEUzo&lGkK<UM8}aXX
znK&ddJsgpLzk498)5DN12<E6}?wG*yr?2|boKaYR4q{$#u;M$m5-9&U>yXKGp0E6c
zY?0RIXJ^{wL8Z()qRt$e7d%S!^~v+wB@&3A$&)=3m|p6$cZ!XV@<}IYVV<814*o!0
z-Cy&`KsqmYoO%dp3B;=$tjirP!4n+rZaM6|2=>t*nTUD80(C1+q?oRD(kH8DSzrP&
z?)a20uf%>q@HAE5M@qFnHsTb7^=V&0uvlH>^XIrhUinSF`U66`ejUW}g5%Veeg3;T
zPnXlIg5XnXhw%qdY2Tnv>+(kI=LOGFN9D6b2bOOcs>@^8&kIJJzaP`y*-pAb6(GU1
zu0KsZgi{ozdF0CrUZjfiv10=9?)34qCQHYj6)=?b*<TBSm#h2GPzk)*YN4-vzmcWO
zv4OrS^>b9DJZK|bt2V;1OrMEZ5R9w;7@*U<F31ZmQpdxeERQ(p7WL-QI!#*(f=kuj
ze4Q?F($A>3(Elhu%8_58*4zCL{UdfV3J~Bn^tb2LFLSiK*0)lPH{%m(p#Mg7tg)Z%
zpBKDYg@H%>N+*4rde*eBF27T~bF5u{xB9Gy&wc8V0$o1CssDhw*y!gmuOPTdeZkkC
z2KmxmzW(zgYdjPLA5qW2F|<$n=Lz*$Uwix+`We`MgM&NOhqix^*Wl}aQ>;^FVovk*
z?;B3h`sz@|`QakiOZ^#6`Z#qI{LQqqcb>6N+V^aemiBtm)R*@7ttWk-{(CFI5%_!p
z+bMgMz6J`Rt-?r$(1r{nVJqF0eWM<~**7`aY9ulVF%rHf{p{8Hx-<J`-4C;G(fut1
z+saYSE!(^LRy}S)@c9hpuhHX-<(Dyye1?%|a|ic!?dR+-ArJZ4Yn8f~+dH&;^__a&
z4t-hAPfRn6gtHv`%;nDscbR;UWqvl&FkPMS6_d}-j4%?HKaSpe(U*|U#^Je?+YN@-
z{dgCKY3O(C_^Q_qS3f`;{pdRm-UIr%B-V?dKIP~aS3Ydy(RXN9_D1|5j2v$A(MSAt
z6`?%)>&CtZjeVOmem3l!&2r<XY}h#mY3i#sTWr)w%w>+9a4x%PHh4p&!`s1s*x+rz
zH}RPd+{?KI?&r7#ZXLG7jhQVrYUF7K7o9K_uH#qO&vBa#`_JJP_Lp-DJ?szEL%XS`
z8e8fSeMqX2XBa&t3IB{jKHCdf4vu3taHb>8`ZLTH8#NL)N;0?|m#`DAR@sjjze>Bo
zo{O0e9Ebm-hW}#;dp!Kd8{9KZKYHBo{3bvUM&dHi(R+5nZqe)54}B5HQ6K$5yPffa
zEyGAS%c(y((O-rkKfB$G-wH=ejVv>Aa02D&M~0EO?90YB`$;FMMou+y=NmlqgAx>-
zuu*@%(ya$4I(j(>5Jp~P(lhn(AbX4P<F}3fVL#iK_D?cfr{2Z-o=x_5m;%lv2In&-
zAE$+d$PazjDOMxV863S=m^3<tlm48s7d-M%<l0%K^G~=(&*N@>jhXMzekV}=A=BT{
z&Q3psy|k0^5o~F9x!Gc)M%Eg=^9=sieE9Qy_}@qqKW^|FsSWxTnsk#%H=A^e(X-3&
zcs`*ALr$IWL*0K}|1CE4uGZV^9~k>({#$DDZ}sIb*UxjD@FS!DTC@GU!MjeUgFn{o
z7BuyPFKWL8uh++o;7@e_2)?BId+=r5PlGp@dh4{_;N7O)PffnDGx&nZUvKcX8oh1W
zjv%&K$l^A~Y;(<4o~KLu8M(3M-ghnT?$2*(S$_CWnWd_k))RVFRnDFHs>Ms@RyjB3
zOKY2&(=cLuY5;8qo>V)WCk0c(r2WugH>l#0s;Y%G3+k(!zl|KegS&I<j`Z<JcE|hp
zY)eY<2bwD9uP9YDtyQftvaZ4-n|!R(>7Ix20An{F_Kf=RywEdtnjRT%{=_x)>WbcR
zd-X(GXdiRnEv@-@O;joXAFnlBm^2+fPETa;`<VIlhu_z_Rnt!-7Z*1+&5zgePl8P?
zo`;fCJ#0LowrNpaoPUx;=WmJE%x$bMF2Wxt<MWnR;mKok{+^y39=j0F+%6lZ|IjD{
zC7lK>w*Fu_^}<<I8nB|m2ia?nD?SXMbQ-vKxZd4T%D=fDiBr1IpcCE6N$`62NN*_V
zxT80$G&{XDKO6zG9&4x5`I4}z!jxZMi%$Kq{M-#C4XZ46#YLDB@FoDC$31L&da2*t
z61>QeVsa=MQ)RU42?g&W=(DZTMKue%S@bb*^yHPoisB+?Hmj;_s;eKruzvAkJboeG
z=*}i3nd0uPT|BO;3iIAI^({?Ri(@q{^>x7QX<QditdcVWjP07nD!xb1Tb)v4zVV&&
zE=P|_N~?@DpuA*JYvSdPbl8?89u8@0NkH^IZFH~b80$H*B=FKPse1z?aC)~ZRc&p-
zk)AInEJ%ZiHN<rNG;HWrH_fTDc#Q6;W?<sHA#D><L8NI(;uIup3w%|391SIScMfMX
zc+d;aZ%wVmIYMzUUVv+<YHh)p-{PsY6&1*vh;tQ;$kwJ7W*DEONyuuN^V}D=dhM9q
zY8_c;a5VPh2z_Q$&iAtPfE?q#eOA@n+L9<pHH~@)wu_TWJjsb+uR1JW^eUUA7xre8
z)opqcwJbT0vgzJnNO|ZhKl~Tk4g({NNvGJ`eur;Hs*368PBQtXVL(r{yIax2c|@^$
z_%#nf*0SsKx}kV%qR4q9w8FWbDjR=w@%SPH=>jsG|67%$!ztNm325T+QGGMw2pFUV
zscp3npQ&Aw7I2!AZ!&DODPHWXsg0R~T}of1b<)=(YIk>ha@gs5B-J%&dC3tt;xNI|
z;eVKr>C!GTw*+Kl`%Z^>v@gM}Nx;_Qt$NR?G7tPm;G0iUV>%A}B=vG)Q#Es&TC7*4
ztEy_3)nEwmE@toVO;6{W(m1!6)ml6r&%no8nwH{X*u3D5Oz-(d+DFtR1H5DcZ)><Z
z{P$f`=#(iuoq?IYrgYk|`|&M(eQAyo>-^@(boJ`RkEJ0E?|m#iX?iV5AH->>-3Kc^
z!A^G=&}sPT$Zgk34(r<!R%0B7_4Ix^{pc_t({M<7w$5*9TGFgA!!_0~Qn<mwZ$nho
z#uik~tBE&u`)EYf<%^a!^n5Gmh^|X<!zsQ9f3KKveys!F!?~94wo%ELy83xFOByj>
z^4>mf4Vl~a_#9q}i<{KoDX&c2`)dYNTK5xxvOl>odir9#<Ww6Qjq}dNdVUS%<0<G7
zpxEb0+)un}NgRLa!`DPAE<T?Z57r$<ai?Q$)#W{Xr=|N}k}G(_RE?gycriFlx%5aX
z>tpu(B{eN|a*BiQ%Hz1stEq+YE%nH&Tik@pghh3YOeFfVBc__oA24wPSuT}&?9L@c
z&h--x`HPn?ZmnOads#&s9W_<=N`3r2qM>nK;>>Mo`JxIA5v^JJ;QxfaG^U^8PmU#K
zB@6`j3pL4Z@6^mfSDjUr^wtk<a5!Ztrh(Lc`&j3nV_WKR<V>7x&zMzQr9Z}lGtt9(
zdf~r8eY)oZ-EO98Kc~y22N+spPklXqZ7Ai$T%pIp;UjtP`c$yvq@H7YoFe0TjvVVh
z?({gHbh{r@f|KOL(<J^={TZBvyPrlI)@hu;ByJJnhHB5Kz0NC#iIv8jad?Q%_)l?L
z)<P)mg<l$d<&*Hdx5L5v{sZe_&*t`Du9D)U;ql(B>dD)_+Qlh2rO`i=bn;>xdiflg
z^Bl^>^jfMLD`q(K+HpUwl63srz3ZgIr$^@}`3r=8%BB}5IiQ}uSE3hj5=-@W?(T>3
zqGW$$D)Rr8$@vgm=|p}BZVZ0wMwdAI#m=vjQ98jXbbd?lTQ|Dc`E@c%$1`ILep^SE
zIKRct?|3!Zxfe6qNsS%H@>1t_41S@-*)MkXo!zlxnO%xs7~=evI61}6{#b$2sZs~d
z`5l8_z&ZQHI-iAO$2cO+?-=K|1ivud`E`EAmN+8L?-=|7#n~@*ex0AO&KL4Z@e7X5
zeu?v2?Bo<<HfVBYD4hHh>#ymJEuw5GenG?8FLCyZo!=rnGJ4pdPd=Vcwxo*+@IF4C
zqn8jcJ5!I*?{8$9G@pC71D|7N_(8w!a(tFmg2;714*#9!lUWw|w0`y#kJLK$P>#>S
zUZwHeZ|y})zSt~y3w?N%7G59J5xfVE_u5y9vf+pl1n)k`+4ju<-cSh9zP^ZpH%;TY
z_VJNt+D#b-!HfFvVwQc>BY1H<06*BNsekstd7^ifk)!NAVZ$S+<yx^pRX3Pybz)fa
zP$r`pdihK-d9YnX@0TFQww7=1t~KS@IDv8uTTXQ3+;6OJKpy!@8;jgSkRvbA+h*w<
zgly3}1N+n~{c02T=O9WDyy?iW+hZ;8SeHELFTtZ7z;oM!3EC$<6+GtIczdn(_>_fr
z?kQgTvVd2IatVU>hm*Z{`+zqALbQ*s?}&Y44W6`5Bk;s`#1y;-fM@eqW_S>bLFDf9
z=?$Y3Nc*zih~DP@ULI}06Aa?H_CU_|OA+wsEAluFQSeUJc&?vU8T%;1AlM^(coQr<
z?7DbmXdpni{a_6e<RL-qI|p*MeG!W<--QtSK0;+cxb|%@_ECmG?E5F=Y`htkePJU<
z{!{UyiEZB|B&5%x*!ADJTF%w`n9*B6Aq3HT7UXQbmsxsGGIG>=BPJ4C?^8%rBVU5x
zjfI?zR}H)fgxGHABCcPqHF)CBA=pXQ|Mr6%RJlCDkfS}sVi3Lm2{~KuMyovvjU4Ow
z=QVy1M&`Bqj2tm<#o%-J8Uy)F(n{n@5WS-zN4?_scIXWwNxr8cQjU688a$cTnp5!o
z1zx;y_!_+{uw{K>F^Jw*AZP3CwD|I!718VGJJjNPzmcQty%^9o-&N2%1o;w-IqE#f
z*?RXvFYP1WVnorq*5C=>^#DlLz6YSh=DW%8B^HD5eIIhR-hCF|QX@w@`r?4>@L**G
zeviCP?>fJN_YLF|FJj8NfHwpC<bl`MTpnC|n0VMYAs6_`c$}~0+<wY+ooElS7)0+B
z$k}=;aXjYyLcJ4>9P9PNylwLs4!lO>OAx$GnCNW0%Yau2A>y5dNIBwt1UZ`r*Plqn
z<2)_r^4MT_5Q{<dp6k=Q(c*EAk)z%RF}Q3V{H}kDKqd&@8IZGiv;*%l$dE?_QFz>A
z@T5I*P>_sAhdxhqc?^Xd?I9L}=zSJ)w%#mE%+em`89CMqK%vbe41n1LGC}Yjhmego
z6nI6DA&&|~$`S8xkRzV(XhlIX9#?8Pmq#1qSf5x7qW7~ty_FV^N+ZX5!;D@zW~>H4
zvVQdnWNjXo0gpK3F%6M=iI->agvTKiB;#=lWFhME;0KIZpI8jS<0kCedN*1;E--Se
z_rR&%_Q(R>bmU7Adx{`u<F#9Oc-_+FahJi9db5F-jK}k*czIMC9>ii09?wC}*1OZv
zd$ExtkGoI-esPcCF&_`Xn}!`5uM>FEuh<VMN4#4Np73}o1&@%HbK7I5;URsRcnlw5
zyxMyCAukyppFz3k^&e-71|*KF-!yWRy&4_Q;cE<h5qgIsUxMg833Ajc10)xEG4!4O
zcR9AAx6$CqapwILeD@&V>3>FVm*Gn+2GQGzd|Pj!#rH}hM?ZfJKX$vZ0hupB{C__(
zZU0RG9_2WWst|?8OpWKZN0z~(41?Hrfe$ZY;nf&92Y<NNzFgqpl)(*R-%`lg_ElPV
zwHDqF44%{*4!mUJ<76%8@+dMqh{cehH!9z!cLwxIznW*{$iv^SDy@F?q>&@$y+geH
zY6A40iF^rS_nDBh+qW8erC-G%Of2eMYw)CBwWi?v8+~5qUWc|BzQke>zOVVt6PH<h
z8;u<G{sR2$ezh8SJfD*wJbq&2B)u(#eQULx+a9}&eTxjB*tZ69c0X8c+1CtN@yjuK
z9J%w=OTdeWaYl~GPnmHPVFF=2@Cvbg8L<UX@P3IMXIvtWAqUq5^aEuW#J=6wvF+Ol
zJjxNT)yOgJ?=RKhCGGodBS*~tINIA^hCna-p9Jx1738Q_=AjoYy-SfzEb4v5;7NZO
z4!mUJ;~jlo?Dm%;!<SeL!uKuTd3LAO9@iK->V0FNx4%pP-Y5c@Ab9sf&i3D43vUHv
zg~!hgp75_r!J|gYx&5ly@E{h0=)KaX_kgAMIwMCOop6@j@0S5@G=WSIdwyu-B)vI>
zeYa>i*S@EWeJc%~*mo1;Y`>^*Vjj8yvf`Iw2-)^+2OgT-4PwvfkhAe}!wI|_AuV|C
zfHd%2`}P?7D8nH3y#+ZNFC0$v`!5<f`tMU3&mEVq0}oS}8^pdrKD@$k!oHg!E%yBc
z^=<nO82c#0Aojh0eA~VW;e>s+8adi`9Imfy|8=2WCGsT*-VR*%*m#j};{Mfb5ElD#
z4W96dKna@C4T4vvucKT)Plp`sAr^zkRr~ZV3n%=t*2uBm(>NcpdCW#;GCyyHoXumk
zg?FcgccsR2?TZ=vD8nH3eb$G!KAiCLIwME>-aOW8Uo$c*kuO2;mO#$7Z(}&&=er?H
zIpY1w;EA8NAv2ku2WUB$$1cdRKCu`?Z$F>jSHlTE-(%!hZx-fl+s`i{GueDF)yRo`
zA3!ddeVJO$wJ!_gspmdK2C**)IomJ$!U_BCH*&1EslaPrE-KAHz67!7ULz;zYRDzC
zZ<dyG?Q4V_^*mqz#lDLmhawd*`CZ|JeP2VKw447pxD34HIQRo2N7?Bx#__W;uod7F
zkS{^>W<ZX5<v5s?pE#axLbm8FGk9_wd<>P6@!g60vC!)t2e(1a@vBiRdbdN))>{O<
zJWjui_zg?1pD)jQI4&vof{`QU4+eYr?gV(U<9-L^Y`qan?;{3}_Fk*;Tppc<2W1$9
z$5J2O4B)Xo?R(6~G41EE$>Q;%kt61_FdF`I*FJqU1&{AQ&gOBM#p4NsN4*O*p37sO
z;XxS&;Su-Y#Vj6Mja)Jw+bkXr8aZM%=XrS?fL@$Zy1{fy)d)G8N3*5(DM%BGdIK8I
z<<Vt$P=-NxeCTVBWftDIja)JwFIhakW8{eW8tMnI%@l*P^*5W4<pjy@G;%UNN+FkQ
ze9Y8xE{_Q0XwNeSPk3AaIomI7NTZ3Ie)TN2;+KDp(Ds#>`jx=rJtGO+WxNOX6}ZLW
z#tEA+{zMluWdAP6QE!Bq2y62b{rP)Hi{Ae%@ZxO--f*Xe{t>)4A!p;Q2Oj4kj*p#)
zg7*vPr60t;mr~ew#z|hil;eCLLG+#mIa@E=$3IU}-xVi&@%93bauNjZGmx|K_5m*p
zA@X=0QFy$I`<nrzg-2Hk`+g5O8!rofDl~X9uhG5*#{kb-%Phz4R4At|hD#`iZIP2g
z--DbSW0=J<#?|Khig^r=rog)vc;L{irL^26Nnk5_2jshl4ySZ4#u2a0SbjYs{lb2W
z*XUx2mCSly%WUj~@p>t<aPMoGMKCuYxNDj5Ypq=G<MjPqgF<UFqQC7r(C6o)^h!q=
zYe!<Oo*}QQgF6GEN4SzkMl56fZ@cy!C2Ly+u(nm7_8t4wpaagTDAz~z`b6RA?)=>+
zvqoD~{qv|uaP83P!ADk<X8_5pVD#z0x{Kc3*gxx^eGbg-IxV-)$vH#MIQ_)V%ezj-
zx*^5Rx-;!%FZ{guyujF1Wd~pBe=wlh4;J+w+Hpg)s4%M|>tG;jcR1^x>Of$_Z{ATI
zn?Py~V&u;c9=qjWXJ!K9Az-X3`%UMTgFoye>$+r*YcIR!=P~5(M*c20KZyL>octdm
zf2W(Df&7mSt$czto<Yg?+!EIK=uoRu@)%0K>z3#`^PQ3hQ1X;plIhgB+$p&eCEs#O
zG};AD$+?Gad}7PN$J{bq>s(W|6lI&;GOerFl*Li@uv?}vPcmg!pzP~znXY$~DZ2n=
z8{9IjudgXP7iD+*%KrXM`s3U~#VA|nmT7(OnX;2mcDq}qG2bv{N1^N%w@lmeGgH<V
zWvksXjrp7@`};Sy9K7Bw)0j`1viDH-1-DFNK4i+?K-n_4OxOF0Df=19n%%N2r-g1d
zWzV6k(Jj-M*P5~?QP$v=X*(C1vWHMM&n?sSs!Z8eP*&%b>3TCw+07`ccFT0V^Gw;b
zD7(xp({_$EWeZVuv0JA3oodReP<EkPrZJB-WiwG$>6Ynw{Y}|<D2uvf+RhIj*X=$Q
zWo2%e#{82hI~8S<+%k>%rYSoXWoNo&8uRC-tUt<1-7;P8c~kb`<691n_LY6dl>G^1
zBi%A>%NA4iCdvxkGOh1EQ}%O|4R_0Qz1vLL^C&yPEz`DKXUe{VvSDtS#=OduZ9&=5
zZkeuEYs&6JS)N;_^<84hZbMnFTc$Cmn6m3omgAP`dJ|3ARVd4L%XGcdOj#|~RGaF|
zrkMw`1FJDto$$E&XTJme4({%^s_eQ$@yBQW=evEB`YB@6S+ngx8>Ue=<Q~izG@+w;
zimb830<MwPg|)M?&%d_()3Hy-LSGI%s=ge2l=FS)o=mf%)-7cj9U1LrJuYYMCOP+D
zeOY6w-*LC*4vt;1bxu~(yR(Aoy;Xf8FW+7^sbj;?!stoSKbw{2u;6o&_2g(v5RvB(
zFyDF33#Sl#oWXg<2)COR4$TUu4+^*3oaZG*V0#+k8Hi&M&q6#K@jS#Sh*J^ycdS{6
zpGB-etVf)WxBzh>;#G*eZ+8RY&4{-m-i7!T#QPB+MEnNg<A_fpK8@Ic_#EQ%h&*Tc
zIU<ky|5NrZhc3U(UqW6oySE_Uww>qDe*0fRp87w&R#HDu#3h2$Mm+Und*N2DyKWLL
zpPW4QGxqJH5bgV+NOlWcZ|FC2qU@B0)UT1=<w}NBg(=^Oya0Oe7d`2rY7f#cS@J()
zxqHFL(U1rsXJpvve(J{tPv??lB5-}7=RM^E)lQ`4Tv>a-mj9G`)+0}EBtpn@#lf-4
z5t#@fTtU1B$I`d_dmq<dcpDU$=Cw~jaG*LrA?}<X{}E}H^IW+g*w5J)5$4(JwKL6j
zk-+pDm^4_Q_tFZ2pK{j4%|-)8k<Nzjh1{YcFXI;GHgk*ebtb(FTmJ3%MQ$<iylV1k
z7v(bn&g}_iJHc!(HrqzCy~%99ZnobuTl$0b|I2LiU@z07&32mE&NJKV&GxHi`(3mB
zrP==3YzM-x#Nk@;+(ylIuGxOUZ0|MOZ=3CIv;CvlW`jHHpJKLUX8Sp_y~b?sHrsER
z?N812U9-)E?}$@iw&$4b<z{=e+1_ck-!$7Fo9*w+mVLh(7or(vi)L`XLk~4-BrXg&
zcC(LVF4E}k9IM&KVV_&HcM-O%Uuw44sF9qQxgDsl%SN)};L9HMHFM)tOX78Le4U4{
zH2A+>(Cb3)`juY$-N&Tw@}~P*9AAa3jn(7z;CXn@w(08nmU)d$OWhaUrcQ4t#TTaV
zp2o!bMSOj=Dn4)OW%XChu9_Z4!POO|t;?J1D;f^-b(c?6TRJbI;1e2);PtBJmN>rU
zcev*A)4Sek>AWoBuWYxSes7iEps?SCOt<lhCsbka!=?2tRdey}yt=CR!sf<A)9JU&
z&TGWSo8z^U8|TkxYK+$|$E&6dv&K|4I4>;W1?@V#7#we1&L+nD+Ku?);M9f&G<n7B
zqN-Wrt7aEhU3~uRlB$bmmm-cy^QFiC7xtz5RwO<m>v}NZJa~yN^0}mH)>!_BM~di~
z!|e5ZJLhAl&~J|P`0`Lm)s*QMl}(;rRdpfW<tbUb5Fd!seSI-sqe>THd>pUa*Vdyh
zUQWS#Id!A;n>WsDFwQG3+;iT9ao%#_M0l9tSR7MuIB>%poOHj%3D*Q1x|}cwzud>v
z>;%rSc91H2Amo?h`G5qG`!a-h#u70FrI@EXk;ij<+Cw?s3;eOcgPBg41T6dZo#0)n
z<=nqHRYH#Sg`3Fn*lp|00AC&wsF!An-g4~oyih`=Io?o?=Z2JH+=mEA_g?u7fDliD
z*!?y#sMopB!Da~b(mvubpIA&cBLdI8S6*#+ICYI2HqLX7Hr_A`kB2<LE62XgV-70u
zxJkX-QjYOAaFop>2E7xIFM%=)uR+e%I~;n$$R{2Sv98{$G@i?2qv1gr2EkkC!z;IV
z(2ta(U&;|}9?cdHoB}v<l>HSPZu8g-y`zyYLE7VGBPV~mcolNV`qk-L&gJp8;UQ<o
z!ea#FY`;tg59wDtZxtSAV~6&M9q$8grx<7Cn7qy>_gLTLa>F5O-z#sVv#dZ}44+2i
zei0K0lzTw$I=?Jq<h@s^!-D<}DembYWgP!#I(AnlP%hcM@_Y~#t`uAaxpsgMhd!iV
z=%;woV*6HkxG0<mdSCyJD=l>jN=iz{jC1ySzgIq88|L0Ce*)SAxFg;?MRka6?d|Pt
zyf+dU*{Abce{HJ@zUJKZ#;Wsr&H1(+ssl~s1m5@Hy4QW8S<xKlo=gzyjpsXig;>!&
z)!Nnrp;Im6`tLjY20I5M)wUxWztp4(|En{rvftEY<^85DFITZ^oZP;qbl*GUp!pQU
zVOGScu8JTs&?eg7Ke~Ir$|E8z&nga7x9y;h84gzlwRxLBiBE{;Uwd2b`}B#nHRMF2
zCo~Vs?)=66tia5!Q^F&nGrCSG3P;yZ37jK$ev;ky5sbjWVVMJ>L(E?bid;_y@~QdC
zu8e1suRTt_!-^?`)-n9(-9BJG6MxGn8#Z~LI!T?TSN?9EqW@%~c^TceWklN+TsUlX
z^ro^;|9Win+wVnim#jiH9jK1nR94v0bRbd@Ua-Yk$Gm;(p03iJ>b)C-DnDGS-dhv;
za#_ai;1B-!&Yu1F%hTS6khfYrRk6BbUUXh<-@W0ewm(#<@|Tqds=?#d13TD<v@deo
zXtRW1eDHa;-xKyl8nu1He!XY^z+Bom88%)(8z<jxY)n`fF&6IiSvUw5*4HI0Jf$v`
zg{p&7NHQB~)9L$FU-+zHZS;2yH%BKAyQ6IQuLnlAzE=jDE_M92Qri>_H(d1YP1!S@
zQPC$l^cnF-b;Hc)$#dCicJ9W8-_Na|o8K_GE4;Rbzik^E0!16=;%`!Y51@4`oco5&
zZQ?I(_1g0}j(@X?xK2G$GY$@O+AG|UiGDC3ws}f*!{#aB1)HbrMGRwn@_LcS@KocJ
zDE|J=zSg<F4|-Ep$K(TnK%geOEUUxZ6$O^e2|NEZ0~f+u|FQC~JNM%~;Dh17!hVzg
zep~kBKL<mZ!?{;hw{w4>bm#ui$-|1Wt9R^ckFed7*`od3HmDC~nbi&Z8&;O}-+hxR
za#$YN+7{J&FK%5K4eh<?fa-^sRlQ)#f|X@`cDFe`$c$z^({HajCEOTqTv?WBa<4~g
zkR#-?3yweS_`W~x`-4948ax+Z{zgaFpxuQHOvM_WM{98J`L5w>sb^yYHSL?L!kg!Q
ztzmW9z}@)`BO7LRg>%agYZ@Bd{mp2@_unamO>-CAQI@rvDAfy4yZ`3eqUh*awfD(r
z{sL9dP+Pm;URXV|tDq=?7%2JcJKE-~-TM}3-IF%b-f&~APK68W@*7u|_1*pEf_E2)
z-aye`-pRsznGu^2-8khk#7e{nW|JNJvIgzgcOa65`JVG<visv^yzR(|W)!PaYS2!7
zqBqrK6h*MtFBYh_{gZJp9O`p0oHOVrkL??z!V3y(s~5y-H!j#*yLZ99+HhlGT{W!S
zwLfd#uKn4FIrAQ_{eA5zb@S>{&t>e(Inh4RNNj2>UR_<iIrg>Kmg<ew`(kg#_E+z%
zE{x~LN7RICV)2@IyoN1RT|=Abn=K6wHat4_YjgKEyw&jD+&AYIG!!<BoEwMF8*0OI
zYies6Vh!=RTNZqM!6UWRbH7%bzo2lzh}sd21&t%?!nOHzZ!XxkV1I4Aac*Nn-QL=o
zx^|4WRQ>USu8bYmxA%z-u3Us(xvYFd6t6(V0&8_&l%t^h)mG;Q*7wCo>=)}7TUi$D
z2)1i4&~nvr4%&mqv1G@GKwOVB9H*VY;}P>RF#7DgApTM@cv)_9R<wDF9HV<WcHvy3
z6$|VvR7)0_&r{Xcg(cHnW+3c*a)ye1r&QXQ!~ErW4$m=o3?>fGb;5`d#5P2nilh{1
zN6|FI49M7G$nvCZT$b4(@PGK`K7GP-cARQ^?&mX~r+jB4vVWb6$h=0xg@}s~n-H53
znZE+@^N3$SybiIa!2A9i3T%mxx*F+39|@^5O@gP+0o}@Og%JL_b*ZO*Uv)0hVOOHB
zT8K334oB=>KSvdM>f2W>JSUecEDadKRnuUP{9yHu{KR=9ud0H^UiQ&|x>4~tXa=2L
zsT1ZmguC!>p?)G9rCvgsV^|0KE<NozRz2;JKUUohdlK^IhOVg{!j<HFkG;nWu(J)R
zd^N*U?g59slhs5|`N_WeJc~|*5Eex*@W_uy6k;#rzOAgYL%5pk?~%8!E-7E44tY!}
zQEwp4<BksU)S6C(@K)^)J@Vt!6G$%;ag?w0w9i9s33o!Ct8}I(skI*aI1&;eq#~-u
zQyx*%kmeZBA)=xleGf~4vkj>-U%En#@!(bX%FX0$azmKWhI!<tsXj<gaBFeKON5Z;
zO-S;)Nd3{{FaDJ`5kmNj@2@=Nvl4~a3#rejou2Z~_{#a$;zS7Hig=4hevY~Y_RbE7
z%pBQqwjpQr(?nJXe|f&b!?z|;h`o@i^`+;ja*zBxUwO=zZd9jx<Qvt|w9l2|td|HO
zXZEwxSE-LY{H{tAVlRX@lK9+TBD5xUu@_QH)hnLzrRuv#CuXIkYKobX0+0`=Ex!6I
z)PtV-iJnNoP`CMWrLVq!Jox+T7WJhd^=g~=cgb8B$28|xt_y!b!dU0{T!@1-%ZDLy
zo%rvW@qnaL{(E0~1cWKip1^hDAGW4o9`Dzh`4qcO{X2c-KfsL?36%e?T@Kqz@tmmG
z!*!rX<cqY%yO%e25QZQQ4&J2tW6Dg(AFKXg<3Z-cKDwOqdtUH(b;zfGD(q!_+L9N{
zcfL`AT_@zio-6UUK9(0D<^@ky3*jiHM>**c>YLUffEd^N(#Jp_<>~gk;ApkZq{B|S
zM0Ifof%Xl?y4|0G{gh|V;5zUB>Em-uwk~J06a*)!J8<x%JliiXI7?lD69lH)oODFZ
z!wpiV`R-X>utGfqMNCJW^fdK2{3C((^L-iy?hg)rL%rbB|FcY8pXFTleWkCxA4NX#
zCpqPxQNQrvUkLxO{4)IH1?Q;W`0!aKfjU;Bp_$i+m=~;3KgNwTrf+xB^VA01=wNyd
zVnMJ`J@4zUFZu9)24Tv>jljD~HF?sl>aS4Ba?Nk4nrZPZ2(D1?nf4tHnZa1NbtZvK
zV4d$+hj^xM@Qt_Q(5ED@{QF^@((S)meaVx)S-pFrU4D!D953b(wEV5AoHvBs^cuCz
zoNVaw+tmA>^zG^fPx?!0cG#(I@YbpmP5bNmcc@(+eRrx$3_o4|Wp$z_y-uz0*mIZq
zy(fLQI@81FD{8AJy<T1IN#CO`@Ys8=+KchXp!MIUws_JT)X^UK`_&qceP2~idhB^X
z6?*t>RC%8Auc<pc<zIKchn3L(pnB3bU(NK*N7wr1pP42d0Z3kOnsYAA=Q0?$4n4bT
zc9lM7%&t}{jC9EKX?Gp^8a@AI&qW~upAR4e|NhT;AiK`2J6&(qL&sq?g8UHvuvKoh
zmDpC#*WX?Up(D;<eoP-rDR&vu?4Sr--=5t(yFuF(THs`>k@zEplaC7xy4}s^<cx3v
zFFX)NqK#-@HqsmpCz!+TNYgeW(dQid;XB^9%*J7t&5*qWW18C*{2+{kuN}Ft{`(c>
z7)Iu6-l1hCeUkn=NcJ^Kfx61RR-a>rMws$b49-ZsJz<5(KTXf`tOr*(^;i@tGUcb6
zdc|fvaLAPzx#`>@O}|ke!$_R|I`)<tUf^*Y^0V9YIbdj|o+qoXr!?fp8u<x&n|+<n
zUlUEgSY_nT(l{sFWYTAw`sW(C)y99=o&%9=Y-gJ-=gaJy^*h+~Gfl|G&l<DcZMOVg
z8S{A#=-L@Edd}1DG`Q_hZt|nru55xKaGiC>4^z?hNK+n7;I!{(vxSQszg)=eZQ9Q2
z+qFNrWf(cl;9OwR6h;_{&dYuky2MGUkr!*ZZ1ivDyZ!A_T^{_hzJ?8&^5C6%z7Jlh
z$5n8h_FwQW-LHao>v0(ToT;}+;|7~ey|0*j(_T0%;JF)Tc@O#4_gpM->@1wdHO1;0
zXQaPQ)&$(Nslp0v^`-i|_J_Mxa*}#!JV=tHcDm0vjPG{0$-hKY>d%FyuA9aKI4*}V
zT;PW5d}1Mjx$)L2eA1m?_g{?XP+IT_cxNFNvF(WP@lkr>qp^E{$HNr(K6LSz7OXgl
z2ZFpS2&Z@or-u(pW1-A$4o-8`P%gIFGe&oBq_)U)_c(kKA4>&_N9AL>>DTP8J!Owc
zC|~9bH^1_9D)#u)i*Km|XJN)3E0oxu``7C@ra6*aZi(9B)81*Ny>es{ZAa1$<2l%{
zs_v24?5W$6a}&1qwpyVp>0<X*W1O@8Y<;h*EE>5ZS_3iZ08C^3!(QqiNxP+?-Sugr
z&XH(zTcq0(g1z@{Z{1|ixTd#4m%Elg&+C#TJ3LhsFFw3=Nm5qU%Y&J<O?p__#P$2w
z=A}(7brtany>fu4Kdh>8U)6M1?@8xd-^o7p?f=rZXWgC@N5kIx!`NCZS=Vyd&)OzD
z>8W=ly_gHFVTqX5diQb8^sPvWp-&r9ELPxOR^kZOFzVf@T&!+>9BbBKO(Yy#@yFH$
z6*Hn&UpT9%YHa=0&Kf`1jmx?|hktBJ16Vi7VXb=NHfkF1$&bjX&sdU9yy-9P)Ei9C
zZI5TY>zb;}dhM3-o@@C|U=DAsrXv{<GCLjS1Iuo+CF&hXqbF)7Z`0np`&ctIrfs)d
z?}+SnYdhcU@A3HKx~h2W;^m8KtFY2n4C_<X#hWVTRuq>ux71%9Z(6dLOIEdV>8ixq
zR`3az^z`H<UGHjMOMS9MulS62Q?0^-1<tmob2B^<Zmn~L^&y;x|7D4ry86WOQ)zUr
z?(0Y#&avhHU-)YD;^hmSmp+bkP$cPT>5h+-5NWi3>Efj|&F&GF%Tk-u@9ysl)zmC*
zDJhOGu3Cr}jGW7TXVvOB-Y1$myQ-pMEY_!6Qop#Rc!J3Aot62{3rAD&vWiH!?;Bl=
z%vs|O_x+3i6_%zk5&f^Q_eguEV|>NMI15R)Q`$At@RmCR+x3swdiKyGv)-zCMAlpN
zkJS3{wN1^-=Pl$yk4NBtf9)e-;lt?Zpk!tXy#^h6%VEgswg04NrLp8!vYTs%_hOXW
zyT;9pFRE!-o@T8vvHE4{R%u$&nr4-Wi(^eoo15ZT;!_Vg-E@bw2(C-87?*v#rf@GT
z7UML*y{t%UvBSg0Jd8KfTrB7Q0`BRi>6>x&P4m*PHGY0m6K^1=t4!Z^PP5k7miYWw
zx~fVW>*u9gXG~LVx>d$4UJ!3ydYEq!CfZ7O$aJfXscCNhZ&|$Ya9)9QjW3BWO0xkc
zVC2=eEUIZtv)=e6SRQ%ql6h%X8-q)UG^<Qp(%f9%Qj6=2G%HSEOY%=%te4j6o~}QS
zyr$ezGzdpBtBs8>oVx@^bgq0X=cnnOm?XzIlEY(iq$57uoBR5>pu_sXdf`%gap!b-
zin~+d^>m1Ko7+XflAWooI+C_@k@W(HRY!IOs{4Xx73`1UDDCwlS{*r=A?bSf6IP$r
zJXu^^Q`fL$aqGNzePdmk(@Jp>J~L5sL{%qpHaZfWW9P+})u(IdSX`+ts!f~S;@UXB
zt1vH~ZdELNpKg_jbDNqPYZ{wlH84}J#-92w0`4%yDe*GA=3l?8$~oeuycgH&y`zuQ
z1)aq&odra>m?#$AOe`ik#$86V)m}z4v4AL~%>traLDTs_LASL+xjraX>vYxvmGwc9
z!KFa){R00|po!%_p;DIr1h(^`gKkTH`j+`LtC*%(?-M$mbv?PpCk#)2jnCWh99T#{
zI^+Cq#&cU=D@bJE(I6+t+HjdB&1ZV-z-NFMZVu{aENwYHrz1h+@b;<mZb-xwbRMOj
zv-u{{w1;w8h-Ya$_j?EtlP@+4-gqD0s}>#~Qx&{y7(-5CUnTa3BT5jwOvvHUI~6en
zdx6L2;Amf8M8SIo&*cHnwXYFnw3{*vg7-A!Y`iYZKIRMFcTgFR-noI_N*2A<$fX=(
z0ou*s0p1LF?8<pQ&`IFOWUI}1-jDch2A+9DRfh-LMf46ec=8>AwJ2k`1j;d#0MFrT
z6l_2q`HHN_jrQrywe+IM)q4`a93IGH*o4UE*CYtui4d~=7Y5!82(dlrFUrx5HxM2B
zuyq0w%om>u-mj5o<23`1a>SGO`I#P#huUoW_{`ie<Vz4dKEG(=EwlKdsa^ZHcC2mR
zaAO~37zFPtkhAetTlVp>SmE18<GKBLR0{h7KD@P-eSB0?@E!#@+rCO;A7vQCzHdOz
zwr`_lA0GL1@s2gm#L9S^0X)GVp7hhBAZO!kw(wxOi}!O>w(aAyi)<&#FbFokL1*K&
zTX-iLIo3N50~HXi|K=dU@gYI%I~Q^`-ZsmB`4FaF;(Z9BfJn>-NHCu=3}WBkA!p;g
zXxVp?kz>8jps@kr+SiIi5z-RGz6*?;q&GoM#w2B3z0iXq*FJv3f_hFifFk!-$l3OF
zT6|A6c&s;H_ZQc`ZNM94u(%O>j`j7Iy}*-sZ3N`Re^(kjsrPmY9zR1Tvw0jaJcz|0
zJbnT>n@5+$gLaDE!8o7*!sXHB(<}B2fSiq&1;5h|oHs^Wc;>q-uAegiKsm}Vh<!go
zzKxe_;jx{?zT18F<)B`eKqd&@Ek65(T6iUp6}<B`o@?JIV;^N01aFEDFKprQ96;~}
z4D|Z16nHBfB>f|JTqDcoTL?Vq2jeWfkii3t6WXzptUuodJT#TdW4qx&EC$hgvrlgX
zdO6O&i8#^7v3>l<-&{NdKg7sgYvhPI82L_rF$V53dQs#AldT3oj(lYx%&`173EAR5
zvo^Z>eV&&L9%UGWhpde*c$Zmt=NLKixJ3KK?azCF*M@uvg7+z(U#hM4h(K8EJKx|5
zui5Aq$=c%=$h6y|8gjIUSPY`~70B8BV42k(=NUQHtJddNE{_=S@F>0;#GVh0pChJZ
zHSogNXZuzl3Xe+-p48*FJ(KbHs%~GmUmY+!h{Yg0?)B;2Z1Jcxa^&#<DmeXxl@Ypt
z7jgFVkKol{$M(xMi^nvGQjU1CMy2qWfP!Q^PDQ@m9_2{0KCu{x$8ZvMY`w2qJT5>v
z<yh}W`uOIy$8;1VJ6=BTJHG9+@Gi3OZuK26=Kzm-D8oR#3}5u&bpelZY~PuPV&APG
zVf(ob1vsR*LHzYa$k}{32?-wGv=zLm8qe(qZ784|Wf&;OP~pSNvhXfJx!^s7ecQg(
zD3CEu9I>w!`?h_#7T#x2CV2N@pLkMl7YdT~10LV)e$WXy@*oxi@fh+EZM{RGSLVsf
zQ6_pTal&fzcohYF?@xl@@ng3(ULo)<gAm(o4x-?lWAKCr*QiX!V>>2en+Lz6M;^pt
z5WU+VXX|aVcvKlV*1KNgx&65uc#Q-yLF_rlhqo4ZtWO>_h{9u;!IOIJDR}$~7a2B>
z?S==j7=*_^AZPPfZ}F%za<pTY#&daaP08B{WP;e!=EK`;@t6l$;qhIAC-r9I{5M&9
zM6{ecKB^%{dx*s#JSO?{wp%>nMvnFT$KT<YUm@!Fd5w`H=G}Rw{}}^g&?|ia#jf7p
z;lhvplL4|5U=xsJyRn^x?;3+A*T1_`@GSwJ({4s@r{ODoM);2Q>Fu)kHd%Uq1Tg$}
z+wE20fwCLK{~cP+_4C_C?^Q-p^gatYyT4@N!cF>V3uJ|F+^6^b6nd+Cdbvg*@mhU)
zukh*3we&8r^!^Ex2}E7K1hbDH!s9(;+B}9@cuOt3uWLNlFS)>@eUxDkys!H3!WQ0g
zBgcCF{x=DYfg$bmmphFdG0(^Na(I{q8tUUA?ZyxJ*!`~%ddZjlZ-v35-hjq)&;JUM
z$$ZK%2#*i@c=0A!JicJ$Snt{bZC?p1BNQR?biM2R(sst@(4O4lbi@hOkP}_Zko_Hy
zv)dzL>0N2$sP{K!9v8eiWDX~g34-^U@3>G2JQ<faK$ddE`_S|^!CRfezT5Qmpv!}D
zY&Qv__h#SqU>o#eXgck26SkuFyJ77YX~zvI^nTGNw=sp>?{L$Beipn<DdaB2^{Fkl
zIfdLLyliUAJ(fa_^Q<k`o<i<zpWIU^<gWF}aqUU*E$F%X(|vx~o<i;z({AFIohjtD
z`~1SSER*TI0PSh>eKCdHF+Mr2Wtj}G)#vBV6mq}u$?ZuYSK{jjucnaO;*)zlh1?>a
z+};#&6~1<RJB1w2`)&X2OCk3)pWOQ?<Ocfm9!Md#%GVx;Qpi2(^K(}UIo=<(d2kKV
zWbMoE?%Q&l<dVtV?8D1QA$N?g-*ZjVWO#pp987ZOtDF>aD<E_@a+42JZkBJJq+TA6
zB#5mS`R2*>XdgLleFMUjqg|5+YX8anJPdgBrv%x*pT`+%Exh9)X9tn{BIQs}WC|(w
zfF;N>#$Q6Y)M4@V6nKvV54JT^hJkXE^se(O7<Yr5%t0)ef#ZIgxmR!{(&S72XH3*z
z>kXUG>-T-fjU8X=2=)Gb-#xq;Xsw0!Y5cJPUl;6PW>4P%)ZY(XT{fh10M@%x&evvT
zWw~GM&kO8A3`c`bempKK;wAsSZzsOrm=W!R?@y|OS**2_-!}|LJMrCM^4H%}9I%Qu
zN#Hj{DdqpxsC<iZAif6~`00@7^|35`#d7VGLf;p1^>-ALe>;)b8NP4hhGPE_8#+a6
zr(d>X?WdgBhq2-Dz+F3H>aLAbwkQ2|amUk{kUJZTWd!f~Feb7cNo51Eo8$P-rW2^6
zbAKrB4y*$;<GAK2f!L3{WscA2fk074XBgk<?2NG8E;{g05&V|aXBzLsj%mZbU!Ap#
zm^U|c*Eg&~mreDQg<_v>u=#iH50-qnEVDDOD{%I$_%h}9t8;-EjO}j7br@*-gZa0V
zLEj1AuO8eL$f3p`<NK!{727hIC*2E~S;KCq8H}$`4#hfK!PvzMw1n=1(7nK;+u`01
z{l)om?eX*iza5)_-lM{MYxt$uEPT<H{U;1>ChI@!zkQ<pEBVb*;uKaFIyl7Wb1+Ns
zE2i@O(!KG0HT*X9a2Kn;r!UI)M>C3auK|VvMxYuPv_-|Tss$t2w?X~&d;WfDb<O7Z
z*Wz1hHrDKmzZu_Ov$y7d%Qr{A9~)f$T($nXDBC})Xy8tr((QPCd~o?n^Yu}d<14>|
zzi*{&S$m&7X6Jr<94tRz&^2DFd=*aEVDFo6F!x^@y*Zi@Ri{KNj(=^>{!s2pe1*5-
zxXtfn1|KQg)^Sv{GCI<kTlU7bloyuot<KsTj;(A6M^{goJS?NLUss@i;N;QezkR0&
zqfYfdutR@exxEeD!wnpVHU~Y&sn}!(hhuhcZ1S)-tJSj39h6NqX8kzbIh+U%nON0s
z(Cz^ihpC3c#`x%Rve;O&|DAB`o-UPJwjhl8Fi;fg42<h{FwpOfBjAx03s+B#&FIR>
z$)BOZ)zyQeVJ8)KzP!$nmu$>wA8@pimCDC4A~zLp%J!XxRtjHJ9z2*6+O=QdtLWj9
zNLSVwM4%3w9wi;y-Tj_bBz2P66^PC3${Ci0SpZVbkx%z8ZLido88*32!4L%Y?{;wL
z+^<f0WxuMZs6M~?;;x)gx#hF*JGi{3Z&$M(zh_LFc`V(tKkuaH5qV7QX{?{V|3LqY
z=(x%O__i>=EF4;^!r|sDr)9Fr1My?GW;n;=^Y^wj9v#ivO8nnHTj-RJ7+Se}XXe;n
z3^<sT6>&7{-^{4q7RCk~%;?7!FD!412Z0<|8!@XYHa`<wPpm*@zdc)HJHIu!E39_*
z4Rz|=_udI^4s2n0(bmFPX1>N?T5B#WSMm0Lv>k}_3pa<XuN`w;-3+d)ixEa?)v+7x
zjZ<gyJ#+7P`z?;M8PQ{T4&gAD{@51p+#1-d*B7|ID?_zyO_cC>yBZ@Q^ObNc;Mk@6
zZ(uX^h1T;M=<?-d+R|z4sD=%x`W{yf=odr%j>MV=&Rl38*U`S{*=EG7#&^|w8ZW)e
z@mwS$T7Y)XN6QBa=z#!QsJc4lwB-F=N>x7jvc;VICJ)Q&eC}I?jzpknVCSCwDiA2H
zsb>3x(Z-bd&v!ENGxy>%hI>_hbxdK+;f!MOAIk&lxn6+wQ3l#;yW^oY_$LoB*|E;?
z49e&ebFOyVP3;-c6OHxwKo_j<1M4%^hMab|zbi*&JsC#-%gS<QoS}CA%#Q_~(fi9-
z?a+JT8IQcYACDCjwBy_5v@aaXxJUD0s*kUCW%6s<SXY2$SHmV;HYWXce=?g_!{(8d
zs~wMPoBP7%%(Z=t%|p~S*i7A_Z{`ox-}2VK`CyWpqpdzFPOCF%^(a-ad5V_ESfBe>
zby4uOiw>zs#@=@9XZ^>N|N5wTGukn8eFWd|&b%YIH}f8*?bhh)<CkUe`+A!EK8ZHD
z+hO-V+a~!vwn^c~Xp<KmZ)aNlsV9H)zGyoA>67sHFaL-A{Ylt-^uMFc4ga%q%_rgK
zOaBf1eCfZTpYQ%RwE36+hBhC);NNfz{x{mJ&jE*4=0^hs`W)DQ2Ds68{)hWxMT0sr
z^8+|fRQdLKL;x$|d^Fa3ZdYi|?JmP{E!DXluUiJ-%9`g>lZOrMC~W46LCMbp<vv{|
z&VvU;v-5{w-K(6OBIo)sgw=UQL<^$4N5{2ic>a}ajT3z>yc26GomROv%Bvo-zsIbq
z;ywRe{p7ZTfkEN_*nBXMtxl<q&8QgqnsC<Vx|4@}s&nVJDl2k2```+{Iu<CZuJ%g2
z^^VF9?#;;WgEQjl*y!f&=fl*osRL{5G<(-=;r+RszH%M2$($P`TbIeXuNVzP2URXK
zS8;*0`W)SysmFdC=l#qKteQqY2dt}<#2L8im;fF8TV%3xaJEw)cqs>dr`HP|uj_T#
zdb%!^HoG3@z9&^46&+|ip6q%fV$QVWN@DV`A-LMuQZ}g5tZP%0o%D)>K34EAu111b
zxER+PiSu{cr@T6}SHt1oQ4{A|ZEZ-pLG1oy`dYE+YgkdKAN!k%-3wm^*2bc{x-!<X
zO?bVv>`C;rOmF|;71z#h&8W!htch(c8}=IenO8#hy0_lB=s>XFK-_iG+;#t~j!`3f
zCC6t*zeHc-m75xo)iD*hQ=M^Su4Aq1fgt>4_rdM(4*iv^4~oCo&ZqX$&TUUN9Z*>B
zZQ%dM-kX3&QEdJHz0Hykvam=9F-{VeBm@jQB4P+(42Z}k0wQJuCLsbUDk?(Q6c8nV
ztfB@)*%d?)R1B*MiY5YAMY#k8Aq17U#+Bdqbk$6EmBH70uiW?l{vYa@&zwHBb@i$0
z>h9|5Zd^m#OWQR%8e2)%ldIFJ%IcM8`ZlIT{9%s^Mx36}O6=;i>`Z(+Fzu^PG+b#?
z{rhucZQS|>l3ec#`F7OQKm5;q;^IH_i5_2GG`>JqMcdLNsE5KW$$La=M8GKV_lQc#
zAe7-k`<mUBQU8N2$D%Yzy#5OFR9~(9R`?EJ*G8F{k?5xt^gMsnDoRN<%0y!&HQB{p
zrnvv1Oqr5}RPV-38PR%~7F!492`^uR5mVd&`jc|o%Z&ED#Dy<T)$!Hw&HBUltfu@)
zUE0g+$q4l-fuo$6e{^<cY&z9hP@X3}_MGNOG<!!MuFust|32xnZHs49E7pIe7-ikh
zsSdTg`#Hnm@zM7eY5e1VYIpblNm*IDi^=$R%4oNDq&Y%|vEn}|VNK&NccN?;I!1qL
zjunaL2|m*j)N9%Ihw+>I<72_49-qR;$CSoo8NFO-Y@Q{wm5)E4@-Z@TpAhfe@w$9;
z8oq_rC_{~-Z=v0IPIc39M8{Y1&Zq3H&@i--kg4&}6t_ZWFBoTuXSFjq&+T*Oxjh&+
zDa4(b>#Xvbr4#x+!!`<{l#CGSExZtFz)`tcR4BD(q2G(kSnQq4kHA4i{x+=US#3+l
zsG`4Zg(&AX#ri(1&^$Df9GgBfua<9Eo;x1p^Yrv;^NrQrP|Bkir+25SDejU#wzVKz
znW>KpwvBxH_luhDGuX=<`!ANc9A)n2-D-}XQJI5%m*u(RP-e|o-Sa;vuYc^Lrt+4W
zW1sf>2mi{w1Nx?`QWc`bW#a3Qn#Y@3Z3ONHC?#|}t7&}ykM{$NzjQyqjP-~60sgfA
z`uzah*EH_{1e-E~`k26dc4n8ZnTjxCpSZ2CfQ{3u@c;91;#8mi9>nClvQ28<&TXmp
z6*}u5rahu)8+u-TmxGQhY~0&bX8E%3t<oB5wxMvJ_-`J+W^MRa+`DM(AH6fjfUWW0
z41PALNn@!F{vA)Ye>TN9>p!X^&2uo_o8ar=ZS5_s4%w05Jy5L_mS2~$&Es>}#`#(P
ze;gII-*cFOHg%zU4i_5hXLY%w0Cx+^aL>xT=Te@#<HZZvmTy0<V-hZ~{WJLX$42({
zX&da<15@~QfXC-N*V9S8W0S}P?_q9*)RwxpUWvQq6+h3YK7#(8?g~2d`k40E_^;R_
zaP6{Ku*cX!r~!9z>oM}8)#Jr2cliI&a$mCd#&sJD1C1LC7q^{UbbF(JX^ioq#W<^(
zYmSjPY<JiKJ?w^9^dEH0VE@iQ|6=P~ip{euZ;G!k`jgV?dOK3QIBQt^FZHmzN1^_e
zj@uWy4sB8K>qRSf^hGQ;zV-WPi!a@`7~ZD-JDbum&4)hS{Z;r7va9x2tX}B1`j20|
z9o*Hlyoa{nOQqIdwfy$8?pv&To<*=bJGN<)!wU=d;hyX|cm*7_cl&n4dM`)Yx$F;Z
zXArie``O4*|N53#Tk+_Z$|D!v3U}ZxGo2fYTcMQDc0_~ji~e`FqcLjZVs8ibhl_Nc
zlyK3HQ-#<ULcCr1Rh7N>8M`@o^G7&8QJQFv<34|ox}d<k4o}5A1f@uQK7-HR^zoS{
zJ74seeU!4;vx(0=x#sMtTendj2F7SfvKbwz=9PR+XL_k#r|lYx+K|-`iTyr1pHqAZ
z{_Am!@Os$%!WyqPXwIkMZD8B)^&&Q>gl3==;Y!v&%0OGkuD+GUbawhzW}$2}udoN8
zy!Aj$<GXyn-98Q1u?;a+LbF2Zn|rOl92++IOCpRnjiT|U)oD&#@7GikaTLzHu71rw
zracU0xzKnMjXC(Qd4ea@Ip+v-mf|WuFsJX+?KAV#_+VeXyl}euY)#ks#n*jW;~X;o
zw#~-2#o%aW^+>gf40E&~aIHQe0&8kmHaQR1<*nU5I!=Yth(YVtUaiQvy1BO;SLAN<
zikxNu8MZ3}mQyY1nmokz^>rF!q4x4;<7+gIaJf*%pdvP+A(pWL%Glids*lPT&dTU9
zR<}0G$3_g~^08e0IA%b1OjwPK{*&@id!~7>bUZok)4XZb?knQ+Xyl@QpID!onPV<@
z>$5yBBJ)DmEHp<t*c*&~+1+YqW)LLHkJ^Y@)mBq6XV240&&0gVI)#{r+Zg5X0BR%T
z+|w2n{_(mz<WH~5<?C_(6|I@-57+7by#D+;-Q5vZu%-3q>G!31N*7wb&>ZxQ=JoNV
zx$zf&ZhRNajV}zh&yJ`1V*NF>?tf`+yg650+mE^N-anZe@1wB4HaEUswZZ4cQ;vU_
z8;`mDSCk;m<^DBZXl}f=Yf2W&;nKYLHJQbkr+vqL6`AFk33;)3iCLa3UtU&TUe;fq
z7r)D=RZdp@Gu7E##6Qker#SxE>MYLx{(N;0pRXSAK`PDlcD!6!9Jab-diYu;!#p1<
z_XSl>4^k?pEAp)M9@U09YyH!}Y;XTHmw2v2qwjz0m#um0VdfJi$9?L);}<+O$a%2q
zX2mw|K90{>uk%3=-;U+jjz_T_J<RQ(S?m5SDbD)hl*jk+A7-u_K}Y_rZLyC%Uz)p4
z$Kslfd2|f>@6TOthjV8C3~q5G+&_1{r)}=~KZUvLZU3#g>;5YW4Wk)q>~3EQ&VVEN
zHO1M#Y3BNSu<?biEiTPl|5xX&tC+VGQOZWAF3nrNG;jUyf0p3VymkL|ZFnIaAN<aK
z9poPy{5$3*Uz)f6-?8&${|D#!UYfW5-)S3{=B@vC?0jk7x@hPBd5-4)!n}2i?f-Y?
zttb7D^VY|k^VVZ*^VTo>!z|i}(v0r4Xf|~nb+6hwI};<hwkJ4+IqR8!GG{&0KEGO?
zFI<e10P7lNY@z?0fF#vn$e+(y&;P$TXPvGz>X!chVa|HWUz)S-t8vbHcxj*R5$25b
zMn}}W{yP``Iq5VX{p7zkUp@2RnXkST?d(GB&wo$o(tPzx^VRM1r_DP6m*%UR_lxi6
z`%g{xE7>vl(tP!Luu)C(hyB;Om*%U}3?KGv#2@cHTeD^_%~w|xb`SE>eD#|4CuW<}
zz>M@u^VRW0&HpFnt1G3Y+pQVv7n=LQ?&s0G%uDmtsYk5&xr2*7pZ6lo1H3d}{l7c!
z`;xscVDF1I@B7kxb#eU0e|~#uzWVRyYkb}zF!TP>e0A&TfxkBI{?dGPHVScRzWSy4
z>X+uLi%$>)+vd~%*?e_&z43dP;q4QcALcCLdlcRx8x(Q9|6R~{BHVLD;;7i1L@(Y#
zdgTYM$9!s)s_FCGC6{^oR!1hMZCX+33_4t)$3M|Xoj<RUHqSxt_Gk^RI#8j;<>#3(
zf)7_X<DaQ?y5}`g<~jW_Iw|uIujAqB<c+jfKVIz#FV5fR!dq&pVwHwfs_HJ)mMWD&
zy1GP5SJPv&_Tb5bDEMDdqEzDD)Rn=S@<iSA=#o7Zj`-tQ>nfe<YgI~^o90xu+EjJE
zb!16e<Y(Cnknd{bt1oevxV@*d6ECOtA?&R%fKxH}^S_SgWAO}_{mqj6iM_?*(^4*a
z$|cPIoJJ>AQ4&B5#=5+V)X5vyoh!s*z*)BLZL>9O8Meb!R_)#hYbtt?yJRX^GbCeE
zab+#CrnaK8mJ`bgo~$5irI0-}dY40cUtS-IMHZ!4nmUi-DMhB;DPAW$lYw`4dlcB!
zJkpAG-BxwJRj{`f-V8paq4rdC$<&6hunNo8CCkQTxk?q-JXj4*Uy-FQ)zZy3$iywr
z`YdZT)|QpE6&6k$W!kv)i&f{_M3zjA+*47j)qiSbu`S!J+#2?!dleV9uM)Ok;}q}1
z8NudTtLVKK^@{4i#(kq}&E4TD@=?9_tB#DmYEx(wtXsEHRM7mOsNlJ#&03LF51`fO
z<#pW@6y=@^%OZw>82Vg;tl!E#_dtanF~D07dxKG>x(}h|sGaWiR^~rbiSJD`H|=rN
z0My|isvX5ubfiL0p(RJrGx&EFnK`AniVjpblq1#kQu=R#f9R14rw*xVb1ANB)nXUy
zJ<5@aT05GL+FzZLl8`gsSL}Nx^AMg+{NPKa(H^i1%SD+>@pj-N)d`**C{LPqOV#<5
zpd~uq8Wvg7KeClK7&ZKO!#<JjCHpHhBO`i$b$E)aRA1abGBSNXK4@hut`~{7kHjmD
zp{1a0r0lPbPTi04MV4rlLCXH>WCb;=tj*uys<qf%qIq3Q9Lun8rRZ2g-G+wO$=85=
z%7{U0ZjKg&{k1Yw=@zLiS(nv65-rH1#IMfsWv$0HzK-@&nPu85Wh2^RWJyG1?W)f1
z3hbBcEwi<s53Vv)wkOuE>KK%W_YSc6*x~4x3}1$~7;knhzAj`#UvC<Jo;Cq`DyV1M
zTeXt<!oGT$#=aXt&o<W7mds~xMjdoI57lvn98zL;R45UXGYhvrlD9v9DZU%<PIi>H
zN1j&xh%Y#=p*gP_PvXGQvp4>8e!NG+;eVHy;wjJej8a{php`8y9I6PaQ}>+eG^lse
z2D>BDk7r}Ai;K;o_e3Lx2mbCu6>jJ9{5t1U-CZ)!?Jnu+ZI$jhrz*#@yT&AVshtIz
z??0gU$T6H^8YQXTzHT-Bc-G_9DdFe~m6@)PQg=_hNvbQ_!?pUSZoIGjvh?axp_@{$
z#LhXD66{um?EXb~A#F#%(Hnkj&+tsi+nG<_P1uzk;Vr68@zikz9oF(@!AH#s_U`Z%
zVM)Q)3b3aLbKPmq^VGaurtNmacKF6Yw`FPJAM}cjC`CT0C!EHiy4C8?cVB!q%~3Wq
zW=DmdrdO-cW{=lOFCR=kb(B~)W)EEGxx5w?g*c97M7wdn-kDk3d#FO2`B0i(dOW{9
zTAiaD7EyL!Jyf>sr`_nc(K7~@=PN~c1CRGmbv^%)2XEN+<dda~(F^wRN_JM6ol!$-
zAGbUGIrN0(S&v03i(&1{%sn@KZ1jw@j_7Bo4$8BGTp?zyufcI@MgAx3n5IRfd*~Pz
zTY={-sWkq#@zvZO*|9@$J(h>kcPy(;F8&a2-*~Zm=aTobU-U+wi!{<oKdg2aZNppg
z+$E98SC_tueJiMRZndY+?EEjWPPHo5SX*g?(z}I}&}|3}FWpw9g+<_B4T~?k?M%qH
z!6m)&+BPby(7Go#y7A13`<!?e5n=~v<u{)B>b`N_It}~d2weLRv~h1#YK~=HU7z$j
zqZ{=~DRuDScYW#GP`<Xbzi89cOdK8YEc$I{-p$nyD=jIc%8Z#-GTT=#eP@N<lfu%l
z)_Uo)vx>aY-s7kI&rXQf(bRtY?`?Nfh2WSLqSAQ+eLJG2_F#{naCz+Ie>E<BpMt(q
z@n`Yb7`r<q?VMYqcxvDc{jr;rSpPF|MqsI?aeCfIY{$FG3p|^YCJE*n8P9DG_tLxn
zC|4!n+ftREgD44}+_R-?Tup`tAI6-MIHd{2@NDuFkZh8B>{Ju)(Ni_ufBZYjN_m8g
zf5dkJt?2sbhG?zqdnh$+7h9hJ+l2qyw)s2q@b|&=oNhDg&GpQ(9{Qrmo(i`T7FV2Y
zR2gnhk3H2lEA+f&Y^G7wR;4eCbp2@xzI38J-<8(^S=#?joavj?4PE)shWs;g+4*5+
z0ewqm#&y%Ghv4nuO6-l_753Zh^WeD$-F7UZ=j`oo&RUAjc08bCQB8gDh2Dj8A%EUi
z)Cw`T_Uax+RkB9gre?;X@7B>f2DMhRgUXevWL3?^QKsFB{12ikqk_|GrSCx4a_`{k
zw$~o22p`@p=TJrH)Eyw+y90Xv>Wtf_=ichuoBO2CG5n~n`|!&r6jl%Fv$;B=PjU6&
zKK-lP7C1Mr7<DplVHzE;);6N&x`NYpWgV(;G+7%(-zec<lhKseG+4PCAlc)mIl&DJ
zBdEu~Hwm8eDJ{>Soci8pE1jV$My;=OhAd3OxkP1%L#+(ev@G;5^*=u4t_;!Km7%Ii
z`joO$O34Y>@WSuLsvWqNp;~*qdXN&i$&=6C0`++HU}(jom_~gvYvoEw3i7O}t^3=U
zvp{M5+$MVK=j6Nue95Gcw-}6f`I2+-&c(Rhz67*^foI%`yCfOkbYe%{n(F#O&%Ii8
z%D!C@m+z=bRuc0kr$yr&B3WOW<|#wHo~1LY$ddJyS_pjIZ<yNim0IZGil7{&d1T2g
zQA*3ml6#^ir`0J<>mF4Wo1K6bP^->f(5O5qJ2pEzKQBK&J1cud{+j%?*^SE6y1Pn~
zviDSb3WI$;d^o$0b(Q1krJ0lpXGL}3Gcz%tY9%XuZ$(gSZ2qi<4b!u;muDZYs9on!
zMeX*Za-Ppwk&{#qU(h@^D<>}Zvr!eJ&gA45<P?m`&CWfZv!-B0!P?yAxfKPU6`aXE
zp1YuWP&n$wGaXFBa@_5Sw<ir>P(9d#I!c)iVuw$ImVJBP?fLK@0{<cKACiLo&a>8+
zH5}Wn&Pod@&BvKZoie)Kyd}z))h|j<*U~Gq)@HfO=_>V>sMVRwuX)y)%oV;VNRgd4
z1u1a;5Z@>&D=R#zR=PX=b9@iTU5?fWzvY?CFFvcBx7C{4o9CRSdNO*(j8BhFs{7Hg
z)7rVP#KgqQ6BC<z5))g-CnhFAZwkE?^tSOz1GLPs*QF%ZFKwF`R@yN!rnGZnXjz2m
zdztxP*S5_370=k~f=%Br^WSa$QyU+9ozwhRN+zJ~rh*}$DWGdp`o2a6NCg8yM?h_y
zmdW|QAJL-XJnj<=L{4-S<tp+NjNimY29EnyRbB3m-R8#mk$ELPIWCWmVztcc(<$Y}
zKBGx^lu}tbwp+N-ykklC@VRMfseAlrg!E{{z5s+e!xuw}eX)57>G1`@QS2>gO2UxR
z<-VQ`!_)Uv=$?#QZz`wWsPPpa<LwSJ@b-kXC{I4^yJ+jGQm%TNdfib2t25qzt}0p^
zSe>wbV0FFdfff4a^Sa|YFSbv5-}L7z9on1K#ttu11Vzood0DWRtt(-(>dh?Ju^ByJ
zeC?`w!L`y=-!s{VsymmL;avgCeUGIlrXQ%#&fpq)ZY#VoKu^%iJo(G>i!%*uhhs@X
z`egK`D5t87H{aNpvfS6TyH-M9-_assvs_Euw)b(m>H34enTNJODH(v1ZuV{!8Y>Xb
zcjy?{_4Z&_!$WvuLzPG0m8Dd*HPD;Jx#QA?7onZg8+?_jj(Q`Xk~B4wmOC49z9{tI
zdYp>SGODqY&y*?`y3g$IXQ;mEnuXS<6)fGvzC9N9!S&{Od7qR|aK4Q1ko9`!#bs$m
zS^t>bnHtW@&8=<a_Lgq%8?zH{xc=$Xh5E-96-wA6co$_FZ$-gH2?ZTDqn9*~O@}KS
zIgz+dJX{@JRJ*kKwpCTJ`k?63S$iuSZKhT$g$Va_i(Z$dl(+WIPrI=c`?@k{)3T`M
z1>vZ}I5Uspv}@^&7b)rGxSC$*sLBYcUFE4&yDB<3A>Uo(D^L>BOI6?KQSbT^^FygV
zN1;BK_rUd`;q~RYmP}4NR;ne3e}LFaniqtk9kw>}-I#W;Oid0eb1hw$m!DOc_3<e^
zd4JiOyygWVh~r=P&a$IeE6O`!FScPTu7x9U1r{v4iM5vP%9Co|iF&7ZHPm$7SyVkB
ze4q2OL)}KvaRW!Sh@j?bR?tDzczDDnHGc@Mpi3)4>jbB(ox<bk=-O?#{X1X&W0HB4
zg_YTN+b;9c8BKYXJM+(uc|k2l<b)o?e%Xh{bs|fY7FU$<H%iBPvZ*HyDyL9|dS%7!
z$;?4Nt9Y^>-R5rjQHi@LrTQW#l&2~5svewUc<9JM@o^pD-c#MVkWvp;Jb0sX$HEIA
z2mQx8T+d+-t?gBPF<yLI4Chvpy$J>9HVr!CR5bI-CGwL5e%xKW?Ny(i6#fA^x>&lt
zdAlU&7k5>Hd5%1G6Sa}1nb<QGHab>}r`+)zEbqlxtep)IuC6Zl_7v4qP3IB3T<90w
z1sylJeYNq<ugkpbxSwjSgVw<F#okWWWJ+8@0k%GvJ%63TVpS`}6tnVFweR`dX{S^5
za?JJhA4|l(fUT3hKb67vA{~8k>ZVMzZROmw!mQi(JM}|Bu2zSXCcSZ-a;THjg7BUh
zY%z^zwM*k)B}*+esxsX4t*Oj{xcsb9y6@J!{*hhjjfF+4uXB1m`RbDRg4$@^tcPBm
z)}%~rdAd|<8C%M(G)`|jaO!x0HW#fRyx}Gs5!KpJA?56ym*|mO9f(pBntcNQI(?(m
zUzD4ark;YlH1;Of@wDCT^u>|3_e~|>JeZyFk-bClY;bX|CtqnYd^l`#QxjYt2Pr2{
zAwPUa?xWJog6Dj3`7;|ieeLs=x!RhI*P-XGqc(M?uZgT3wa=`xXzW`<v2WE>cN@{i
z(YK*$qrT{ibL^a5^=0N#tEThz>1lN4-mKI*M?IcJXQvUg--H)!YABp7Dsj}VafYmZ
zma_-vI<$`r_TYMSQ|74h9NHo^wm1iV;TyNd=F`41IjyRcwg1dfdn!W1Ssb=+)qEYx
zu7%iKH@8Y}W%V?oRQB`JNNjIS{ja}|m%ro5-WjCC*URgahrX~i-r;k>cLJH~?_qfF
zGvD=;8hD3H$iKKw`CTxwUej~(HTj9<>G*G#r>4AX@)OtB`M<or-2d|WGB5i2Hew&d
zmD2bS?+#aV$!Z_9<znAz^u#opy%%^2|Lpl7oKMtRQK`BktHQ(LKB$K=ey4Y9RdAT`
z(T!&^6er&LA6}kuE-VONUsNdXpejv$vqFj7nCbND<@FIxah^^4sZ8;tjJ5inn)(Z~
z?!EL*i{N~kix$@>gU<ah`o#9Y3!Ph8>GqlL?T_u_F~^_i4Zt<+r+<u3Upf6(*YWS9
z`SWsh%~I)0b%FONQ{AyK1qZHSseHcFLX47LsJ_^CDZW1bce~-3#J)xd%i+kYdTO?Z
zmKV{@zTOLsbNtuJV;-^05|ud7?~$WxBy-_E_;c5gw)*_}^MpN!`dSY#?4Er2SHvak
zLH_t8Wk-3)`G1G>ggq{$wddo3-WHJjPu<1d?*FuWe|P$t>Y*l^|JC}H%a<y9K&NYZ
zxt@2RjtP5oe?4EQuKjhMYEQ(M|LQtwN?TJ|C_mY~jq(z9|Gyf~zil2QCjM%=&WJ0!
zJtzZV_m}hktLbv>negRh$eXYS$@%})beZ-{_;NAwChS3S{(m*yy~CBP;mV!(H6O0r
z3$jRNLxMYr=J>mp{<7##={h?1&M|qpo`hB@?b@|YY27i|lbv<f@LbQB(VjcocI?oh
zZHL@MPfkJB=#id#hTnNt9{gK%XqnQowI{(hZrs?rI$e2X7R#gM$T4F^77V{@%-wh9
z3~!k;=JqScjTuvr<IBn$ePuzxJ-4?Qd*_(^;W^_xxmS(oc-4ruxvko_Z{H@jT}rFg
z!`tPgT-Elfb|czkw@DeEGrUc1>o)CMCn{a9hEcMHXJzLpYAY;uYuz&CD#aP>>gra5
zv|v3%4OPO_a5X}!W7JdYD-HBWwV@iN#i>nku>nW>tpm`p!3C&)3j)CavoREkRU3qY
zFc1zR0J*xL9;gp!T&@9#1PuX=5i|mn{&GNLcUJ%phy~;y4;q6efX4U8F99TiB(5hz
zwg4@`mE4auv^8i0XdkC^?Lh}X`w8it0NIAxHR)ZzwICIA1!;i%(?NIO<$4BW573kA
zy&!J@y}8~8vM=bz^#PDK0UCd#{04!+fW|CIr|Y>}!7xBB6J&vGkOTbt#Rx2q1U`@l
z@&TnU0JnqDU<?=w$e-RbdKVZ6?gsY&@*fZG1NVamzyv`46Tu`<2uPm-rh;i)e+cqn
zFoWx}ARhs<x&9dB98kpdd64tL<6K_|xd<%g`clXzz%s5s1^F~6=K2cAXTVCXKL@!A
ztOjeqT0rGo4>o}3xxNu{6L=A9=6)|jZUL`weH-Mf;5G0%pveuCR|(hwb^_9OgFRp`
zcoVz@$bTQ$58eUqf&+m3-v_0j4153%0`fl${sBJZ`p1w*z$f5Sa1>CyW1t)y2cH4*
zI{{9DFTg2q8j$}PPzlb0F9G>|4bFio@D2DDkpK7K2k;}P20sCEzkpxCZ{T-u9#DK0
ze;UBpuVMfPz)x}E53|wmF){4_06!%Jf3-m<*TW$rKpjw*`_+fM3^V|d+%F2U5uh=R
z%Rvml51$9e{tx0nJit$Bf<NkxngN=FmI&}un&U4Sv;Zvueo6}dS^=6%)dsW$_$lr2
z*8y|{R{{K#tMS(vTm!m*YXN>rSNx@cZXg}tr+D#q9moJZKu>_5(hGk#fZpInfS=MA
zfBiszK;z&y0sNGk@izzz215XT%252>3WkB(KqkOX$;Mv}$OXdze#%Jv`9L1X2crOf
z%I)|Y4aR`606*nU{M`k{fxE#y06z@oWB&*Dg9iY9%7gfu2qu9-Fd5*dOvT?cFdaMu
z@Ka{sZzh-p9s#ofe#&F`n*)l#T!5c4AAgU71z;gq1n^Uq;BP5-0xSdgDNo_=X;2K7
zgB1WjWhMTe1<!$106%37{?>wZU_ICX@KavE-$t+rya+Y}{FImRw*|Zcwt{T{Kjk(2
zy$-g6H$Vx%PuYpTU0^rZ1NH*^l(+ErHrNODgLeRa$^rbn2i^yzpbX%r9K_!ta2Wgp
zd<gJUKE~e>@Co=790m9($M9DUj)Tv@=Kw$DB>uhtr@(1Y0q|2Q@pl${3BCef1N@XK
z{Cxwy1>b@10e;Gl_^Sp#fuF%I06*n7{QVBjlcK?oz@iRm00(da7a;#2NX$r8YJm_?
z8<2k(WH^WbbwFJ}{`DbgPFe#H2^s?OZv+_)E(bB-3PAp`kZ~X$GzLuo`8R`10Er+8
zGzaA00<tBzlIyJ?TZ1;BEocWQUI)mI;409G`*nuA26O?}f>c0p(;&NnbkLpqT?d%~
zdVrpQTrbEQKyPp(=mW_0gX|9mfSbTTK=}@W91MnVeJJFuU>LZK`(;69gB*~{{YF5J
z1U`@l@&V;n0C_tY4aRW4J0R}_cY$%>Za{JGg&Ys=1NVam0Qo-%IT1_(g<vuu|EZAE
zz;y5sco>lXOvqW_5ilD(3dnyBWD%GP=7ITu{1-qj1dG68umq6*6OhZmli(@vG$8-w
zkSoA5U?q4KkpC*k)nE-+3)TVh-vIeMcmZq#n*jN5hI|RU47Pw*0Qql&d=<O~UI*I&
z`IkWM06W1hup5y7UdT7WTi|W550L*mkne&6;63m@ApbJR55Pfi2pk6F{~_c@;A3!v
z`+W*|6#Nq$1Lc6?eg^qDH~~(AF97+UhO7W*KqWW}$p0(IufaJ`#r?j8{0@B2^&cUt
z!B604@C%@{zd`;E&I3hfej20>4B+5?E=V^B0>Pjbp!BsNLqQk_=YDk{>w<cqKKE+?
z83`JKC_pY6@^TOZt^gho3*taLp!}OaHU-T<0!RepnnNao7N8}#5~P4upfzX%D1AG~
z_Mijk2(AL;e>G%ha1H3f{Zb*jf;6tDLv{yVa2@yS0ofB=4|;LG-jFwfK3wky*&htx
z`asB=!5}ag3;|Szp^&$NVO-CI%mUe5&xITgMsVE+nFsQ@UI2MJ7|r#ukavJPxjqi^
zZg3AEHy-jna6fneOaSC2LQVpOU^18jsC?5Pr-O&U!(av=|5=cafZ5<t@E9QfBFMR5
z9@ig-TmTkweKF(`u$1e|AfE(JalIIFIatB<m5|SZ=eWKaat&C^_4SY&!1G++2)PNo
z$n}>XUj|#az7=vCcon<`UI$d}Hy}&E4zBNl+zs}Cz1;6D$hW~huD=8ME;s<*1MdUM
zs|@l3aFFYVA^!nB1RsHq0mb_S@>6gW{1Y4l<bNFUGw?Y$0Zsz)KLvRjRB*i#@+|lg
zd<DJ+6t4>M8}Kdoj{E%p`6H+XKY^bC#r+lXH}E?+&;3*brvX3*25<n1>w<KHAP@{{
z0dln=LqQk_2N8hc*M+PH>VwNb13>-_A)`Pe5Y7E!Ag=%(uE#;fgT|l<_iF~301`nG
z_e+Ls0a}79K?<OCw1#X0+Jbi6uLER9a24nTt_BqM8ptl-T9C^9(jdEmbkH4m0maRL
z>;Za$>$%?zkiEf;pbzK^C~kkq0pKPukoygS91MnlTfk62afd<P1~New_sfCI1;fDz
zFcMJQJji@73KVd^(U4=nSa1ip6Hwf7kavT7z`fk>KFIsQ17HGp5K!DnkcD6}n8N+0
zK~4t`frr5iKyhb5J_2TgN4eh|$RaQo%mecQ#a#fo5G(?Vx!+RAC%`iBBzOu?++xV(
zU<G)F`#lT!99RWbgEfHSu7g|;Hh|~3-$uwy;6<<*yaXuj7RXn?R<Moxy$1O@*bd$R
zC4l1Ygxm#ogFRp`Apf@@-v;}@e((+;{{xWkf%icvC<Ekw5b_W>4E_N=1myoQ<Pq=*
z_!Jxk<bMpZ92^IqfzJW?pM?AZoC2po1t9-Q$g|)}@D=zPkbf2AH{e_F9rzxQ|BsN>
z;3x1i_yv&vZ;-!(^MD5XR04}SqyZej30#2ugCK)JEf4}~1M&}p3<nXQ4yX&rzdqz;
zpaF;k4FUN#f{X^2gBWlHApcm%I1mpSgC>Cdn?WXkM34lU1M+VH*%Dj{Qa~#}{%s)J
zf_9)i=m5z7D#%XYYS0;61IYhc$W+jk>)jyJL3iK<*8z&x1F|Q$9`xdVy&-P|eL!E(
z4^Z3zkT-#W;AZYO7;*@>1q=n`hC$v2GC>x|2IO)fhl3GdB=7;sHy?5oDB${N$T46n
zxP$xM1vw7f4esH7<00<@_k#z(1VH&sgq#El!DQ|?6>=Jw4juvz1ByEnau#?5%m$AF
z@}C1)1m=QyU_K!K1&|BDBCr@N0p$M#<TCIicnUlX$bUKH3h)eA37!SyzY20SSOeCA
zb%6XgKt2y%02{$3K>nK{Uji?KE#MVE{@Wm51+RhE!FE9YC6GJ7POuB?2IRjN@=fp-
zcpK~k<o^!jyWjwL54;b^zYOvNa1a~<hXMJ22>B8C7#sng0P;Ty`A={Rl!N1d{6B|0
z0ZxK1z$rlf6_95@B{<9dzJmN3oC8(h8$fZtgZv)+0Dc73fZWfJzkpxCZ{T-8@f9Z|
z(0~pM(#adr1>7JA1OxI9fvgQeK^XUofUE=Rf_k7nptubnBSAwD#r>ioF9$JP_dv#i
zI1tbMnm{%M%|HT31e9NM$Yjt0wB&v%kgY&#&<3;x6t_KO2hb5*1v&xp?+kej=mM?<
zset^`AiIHd&>eUI`DZ}(06oF=pcf$j-jFwfKA<n?2grW_<V|28xETxr<Ua)R7BCdt
z3Wfpl&xFhZ*&qkx0&*iDM*<(n1NngB7eL+)MuRcj?+(a2!Chb+Aa@Vsy<j}J58MyP
zO@Mq5OazlaA$S<f05icXK<k+TITcI;)4@Z4{AWWx3LXP<KoKDSd64tL<6r^zTLifn
zECEZw6M*7A3HcOw8WeNC6_C$>mEc+Kw+eDKSOeB_zx9wC!1Le*un|z6FG6kxFL8Yf
z<SSq+*alt&6z_G&?cfbS6Cic~^4|ry8|(pl!JB~m--g@=_Jeo8yMX-PgM1&9f->*{
zApb*<hrvI<hu|YX{zo7`0iS}S-0v7<IXDhJ<9;U~Pl7MNDR3H4`ZJJ~;4Ju(`+W_0
z4pf0}xZih>--92(kKFGk$e+P4;8*VVJLGwwxR5`AMIF)r4&VeXK>k6H!Jrlh;eMfz
zVIUktaKE~c^+0`a8TX5XYzU%2BM=QJ&lt!nfCt2Kzj(;Tpb2Qo{SqJ(K@w=r{aQe_
z1XqF-&<aqVZ6Mo%cA!1?>j-%j=mf6je%C;D0oQ_5?w1DH4WxtazzZnP49Fg!C%B&b
z-2mAe+z9$`zkZPY!2oa*_q!Q#5Eu-GfLj3Nc`M{Fa2v=3S%Ca=AalWRFanGO<evwb
z4@Q9ka62IXF_2@y9pFxI7a;$;A@2eAg7M%!K>iOvP5=*riC_{S|H+V3z*I1e`#l8t
zFqi>mf?0s#&W3yxJO<`~B0&E0Am@X}!2<5L2y!u40+w>WWspyTr@+&o7*P5Zkk5dX
z;92k-Apg~nYrtBtj{9wZe4a0FgxtiJH$%R}m$yK^!k4!}zRH(hhuqGWOCWdf<z0}w
z`SM=KH~I40ko)-ZJCN`4<@X@p=gVb~AMoWvkcav5hmarf<s*=v@a3bB|K!W%kjMG*
z=a47(@)wY&_;Lm08NPfL@=Lz_HRL(I{0-!{eEECGANX=L<WGG07sy}v^6!x6`LgQ9
z@gI=A4M+!Hc0s!Naxi2qzFZqJlrM)vM)2jjkoAD<o@-<G!Jvc9=?X4F=*CjO(M5^n
zbj(1QMmL}WPF#VG*$6RolPch92bO3-$1H`@!usn-;dPa*bh9hq>MFx=11#F62NtoQ
zo3k4%A00CszNQ;z0T&rqq6HnZ9p+E5hhHv*Um@x7N(Z_j7jW@`C0fuiBjS@u_V5HL
zJXx7UH}?WAIj}?vx;cBo^3s)7$^p8$7jUftOSGVyGb=1F9WyHi3H8z53N+()QoecE
zo?j;^yo<6>uy+?JJXO-ul}@M+%cWb3Skm$I*8#!)8B%yJ<qpCAy`=CyN`1lJeWdUK
z$~M8?G{eJkI%as>D%g9F6^JDrGd|V{_8qG1Y-^8ln_WTtOr^bG-%O<x_Oxm-Q;MIh
zeA3)*pW#yY2xXjL?-5EQ>}eHYgcRQ==>^I<!M+7jIL$<{oQ|0&HwyN?(+b3rZq87#
zymZV^`L@tr{_)Bp*xR!5cq_7*{(ecHs9Y`BpJujLPFJQVGX?uku>!HAD-S941baUu
zh0ju+7uqw;gt45iJf`#$>`OCaET=2;lppA(dce&KEYX6lEL3I+_FX82FI8Fy_FO83
zKc$oj_M@3KmeZ9L%H2ZyU10@cNmrgz8VdG%P6}Tw>Fbq|f<4zu;Tx52g#MUj=vYoS
zXY1JYmzCLqeQEZN<#c76k|NlbX7gB1H)r+O^%CWfVDAzu5KFqUTNx?Xd$$z6SJL+>
zwFLXqY#__&=ByyQ{=V{pP#^Cr{bB#cfhaU<$a1<ld&sUIR(_-j8UaVMi7clpA1mDj
z`_t?q%jxDUBfEY~DHZDDm=%a6T{)rT3-&)Dg?}OGXOvK(K4@l=<#fzSdQq@H%~G<Q
zZq8P+>)$Kgh5De`OP13yi)n+fi9cI`Skf`8sY2+#e^DNV{jIH_Sx=VJ&Dl?OT~%8N
z`-iF?hW)KxPPJDC)~8FlON|%m!=*kCdxr#8;gaHqs2PI2L!|I<^{jBb3zxzpB)z^`
zB-p#Y6n>ecN2&3Gy`$8(V85b3d84HG(UR^_M+xoQBZW6n!vuRaQ8&Y$vjh1zk>WR#
z^yaE6*i$&T!Tu@gY@t1;s7+zdt%3Ygr2JY-dV6)hVBhvq_|@uY!Jb#ED(q#I|7t1z
zHIm*{eO73XU8QiZ+C#9PSN#(G@8f~;d!_gplHN<5EA$V&r0~A#G2wXDSIvjLtn&Aj
z;`f*In^i+-pEpb4L)F!S{f4T&U@t5Gp;G)|lAf&|6Z+F^DSV_lRj}VkwHfSX<v&u2
zpC{?JtM3TMGny@DIh>!UV+8x%scwh8to&&vo#k-8BI)DR459te3_Hu|m|gdo&_6z?
zJ_LJN`3oyYdlq&U=u_1sq5TOvE5c`}+Xeg0P_tk!D}SMIh%f9+&>vGBLi?kce3sKO
zi*Jo!zxnD7D6*CRd@23{NnfJ=B&?EV|5;AQ%)bYP_W6|BKxm&&N%4y%eWkidu<uGK
ze2sdO&_36wr-l7@jTC>Kq`#of7VP_ingaV;XT>z@&~iARk@T0<Lqe6lEQQmoM9bm)
zMIA5Ln`S9mPB&*O+V!34n}U6Js(oQktN+_6rQa>-Z>g2S{{5CZ2llkCn%<J)@00Wc
zY8%16G#k=#x;ZP-t{+t26q@isH6Qj}7KlQ#CM~C%vnTEP$7(3-Z#kMxX*rzlNcu7L
zMZx~Z)Pb;XX&}ilDgJRuKdG)1?0ZtZ682pmNPkj_e@fCT)qR3}E7jX!U#tC8O7Uqn
zr{!>dq(%t#tx{LQe%4hG&GxjMZqE9&>p!X)Li_zuJ&XN)aUcrK3bmYW&JMNfzo|un
z{eDy1!hY8I!EaLf^OCM>Qw00zT5Z^`Ft7@pW}O9`t~ew;NLwY?FG#yyuwRfAzm}wj
zX<rNdXP7nx_L~q`W0({_LelGNO$Gba*Y*qct1rcGAnA>?(SrRNX?0*f>-gSCihsGJ
z$7-2^{bHr?cu8-jRSI2xGi^HTXI*bJlj0{zdJ8R4=ucZn;jOd-f<0SF;cX<ngO(}m
z?;WJ@&YB_Ex3d)9Mbgu>)xz;AO$xtG>m}IxIxW#-Z<5zb@q20KghOyIDZICKpmm_J
zV4<%R-cRcy)DO-4wVZCw0JiIcw0%PT43gpx)pCUPK2!?7RnoIGmr!3>Qh2tckI>c$
z^*2K6g8H%gUz%xbIo+IbY}X64&xHQBKzj)F5fX?}Af>-UOA_ki4k`RDNxxTnPpFT3
zwP@Ja>TmCr;@>Cf4{ECf`#z|3g*~n9dr*o$Nz$ikCx!lYsx}k$veHkL;!l_KnOd~a
z-e+n%U@t5EOey{&l0HYv725Y4%?<lm>E}rC=SunlZM|T>1=`Q(Z>{tTr1*;@{RwTl
zV817{D+K$|tZmEb=Im{|zFgZa*l)QuQm`M*?zWt6&hobFtF)hm{$Q2%6zpe>I?*g}
z%jxE9aJ#-iOB3w3LHh#zt(Bf;i(5`NXN}wS&Dt!%ew($AU_UGUW-0y4lD<vL5$v~3
z`wjc2Wq+D|ZaJLqNqUL4T(Dn>)*bd+8Aw92)Geo*v(@eTUhN~netV_(G>hGG7_ZVM
z2>bIpng{mF4McfIichoMEr;<cZ4c~gxiZZM`;7~Dlu7XqO8SS|7TDKvA4=ggW8QMQ
z@~PHUu<xhZC$R5~Kopu$Z#mtZS#Q@r(<TY_{Y;C8eWwMY(9C<wVLVLIPitEQ`_hbj
z%jxFKe7pXYHbk)RSK9B`pHl)+Xy(4<aQ>#P5bXJ_6#k>;724;IQaH`-w;aZ|v~Pst
z6V3LwoUUm4J%ar;;f9>9xb$$r-YzLTNYZQTYlY)cZ7IBt-dnJL9Vxtleq8838|aOM
z`*n?^_|f`wp+2IeaF3oS*xw_CH_;CW$EPMzcr*Q0Vf{%`cys*@p}v~yC9rpNz{Jg^
z_$?$oMeixtKSc^}r=Jkc2ii&D^i+f8bUf8CL$LqVQh2JKEZ9F)3QyNd1pB8;;oT*@
zhn^$YzlRjwQ__3uE}=epOX2<WbwYjglfnn;HwyM1D1{G_^r8BbLi-;og=gvsg8eh4
z@LYYDVE<ex+^3Ha?Cq1n3-n;Y-UU+lSp7-C-t+{A<uKl)cNOeAP9NXa3dgJtDgJo<
zq;UKjug`=%lLJY{OY!g59}|XDAC$r;>MaC&Pt+fPJ*^^4l;Rgk`ZV1s*ms%~PEVFt
z4&zgLv0!g{(!_GQ`NWA`FVfQm`_mIBmeZBT_0#CzEk{qJSWZ_K>kkO_Uo3?$)2|Th
zzf1}*)^`i`E|$Vq>LZ2ryiy8Zt=AIlOHa61PFL3JgN61>PrO)8S2pS=g#MYHfU%se
zyrfSQ>`70=SWZ{A>T!bowo2jjq>SZsJSp?0U{88-#&Wu{OCK!Qlb)op9PYPC`dj*M
zLVrL{*;o$eC;D>1zVy_M<#hAu8@pbncNgqUPvck)<4JmjaQvjFb1bKuPwCk8PxKCg
z{pqP4%jxFRJ9hoJzDuZ&<N8q8-@5*$r+X}?n@{=Jbv)%G)CWEFV>w-^)K?1jr>B4{
zr<+d$+4U;DgHRvzbdcqA<p=!}!T$85kmYpqi6OiGt3FAn4|;;ga=M}#@q+zT!wRMQ
zbGoFvjJJgPa7p1o#x27Az7Q$AwozZGpV~$->|Y*OX>BQfn55S=ItlwnUE`nVuL}a{
z>q_zKOL{|NiclX7jry>+bv@iriXUTa6YL!$g~u7U3igeY!s8{qnV|~yZYG5%NP4pI
ztYGhC<6HF4)_7jB6u+gUw>BmU?Yp%U-oc0z?AgJ19rm0ZuxAG;{#BBGjgcwX^BO5U
z&G=U6kJF4ru%|WNohHRkm-GzdYQer4QuqzVF`+-c!I%nrS>?Y$ihrY|_czLf<6VC#
ze2_6zu-_o#2kh_GcpyC?W;xw_Qp~OoGnNYH6T_tVIYt-3emO=N>}8cdM~XjO(({bF
zh4z^zg^xBG3icaqY=^z9{6|ai>4`MU;e5u(651a<p=LQ<xzBh(u-|<~C)mr%|2`@H
z1Cl<;I3)C+^i-SWbY+?`Ua;RZBO3Oy@~0=>EQiim(q|bj2<?xagtMHk%rW{4_M2n;
zi2c*be~uKNo|dzmj;H0G5ZWI-J!d&xS!!G>*l(#(iT=;ZpPsC<oNhj0XV;63F@k-I
zrTEVpK|=d{)_4Z?wDNyeioZ(I*BRFd_NAxvEQj+I<A`uP+GtD^+9y51XF1(`lFzPh
zG2#UK(vy9b!+47ErqCb0X5<U)lb-ss9PXz{`c7l3a6H**bc4Nofh0Sn_`4<jE#s)r
z|Gg!J)6;{N!}*IbS!l2HG@<2i|4h;k8chWI9yGSXo-YNG&{Kz&!}*S+e{2jD+V95(
zz3?R?kOaET;eMK=A2U`8_NAv5EvK7LFWU8!MuyOyPZ|qhUu!&!o^G_9Za(E`*DH-!
zp}o>mkCwyvj-*!^uL<_AGH!!?-wh<8rz0(g@fJz{(a;6^{%9<Oeb)z)&{LF_!~HTz
z|IO$m*!MT%pXe{G_CrrwT25zAT?RaGe&m=U*jINnh5fAieL9}hvK;Q0NqUfDoX~!Q
z9Otn=Tlf2dr1-TYJ<PF0uwR(t8raV|KM0fJM@V{o$8q8KQ{OQT_A3k&xxN&?fuuKb
zL<;t6<ak}MUn430<&qxj$Q0}s>o8!y34!&;O7Y_*y_ut*V83RLqk{dKN%0dUy@lgm
z!G0|qjbK0P_)br&T242gTD9wK93_JN+DP%+N%~ceenNkGmE#BO&y53FUM0o9TGFp|
zEESID*Gl2t99;x^c9X)pOL`B-XTtHRhZNr1ks{c)w-nw-(g!$R6OKm%r0~Ixn*@6g
zc6@Y&{d)gaDgH3WPs08^ObX9*OcL(*<w)VVjwglsp(k`Lr<+ge+Vy-#icmlF<gVp(
zWwhgva6B6=g^!W+yBy<%`npRBA1CSK9nnJljd$!o{aF1kJrQg<-F!0Gu1|D?3iUP7
zu>|!I5{NQUN<Y=nMyQXeQuuU9pXvBesE?VB2Vh^Tznv+?e?-#fI6?*c&T+g5ds^E!
zM~XjJ(ib=e3ie#!_!<3$m41N~f03j=;dn}D?@u_+;&^4He?p4?q@*u*+$*&2<&Fs0
z&q_~ELt75_%Ori3<7L5qs~m%2KPx>wHElWEFO&2Qj<Z64yTMT;*pHsBwjA!4N&03-
zTfu&t9Ulqyqo=Sfr<+e>+x2aZ34;B$IrhVTs{>K!X>H5l{7%wK95)H}D{*{{{?<xQ
zPjy=k_sb-GuVcPozrBtQu%DHFuN0r20=FE-ryTnQ`@Q2BE!dBq61N=A_awc{QAe;}
znPUs=w=$4~o+h`PZa!6R*FSU&5$s1#nOhF?!zKNwW3_NTb=1)Y_R9?<IV#1cr_wEl
z@hZmw*w=EOJMMt}#sxe+m*St4^a@9Pq5rIq!s*F&%jwEjj@5#FzjE|~eP;xs(39_$
z)6FN~?fQ3)b3*_3o#S!XcUm9{Jt1#7jE6aT)U$8jPg3~Lj*f!8e|DTe|7gv+r6=nx
zr<+gM+jYh16YQ@zHP}DhTBXy9P2**nq&uC<1p7Oksjz=?;I5uiitm>65a&UmzYLMW
zBb@gN_Kt8ig1xQliwG%xT}f}?ED`M8Knjm`=D_}zi<ZJY&P~Gc#v_H(+W{=6D@~l8
z1$#D;!kbBYbLT&V;}g9_z;e3zMghB?;=Et5cZw9hwWPOq#t8jMdnvr5q<40166&L~
z6y8PB)0{U6^^+!rr%QT<^CzKy$&kW(N_ubSlS2LVmcsi;`T%EFp*{yl;R7Xoh;xom
zzeA+(p^~2Ij1uZMQwq;^2Dh{73r|Z+;Uk<c3H3d~ISBP>onMTQ;`=1M!1=4tUllm#
zpuVj0p8_fV9nLmF{oLXF5cap?-{CB7VsHO<OX=@%J|Nit9_JOX@2`PPyhn;Z-r1^c
zAP@@=NZ}Klw+r^3;H*Y}(>ai2f)szEq)&0q6YMud3ZEwF4?Ein`wP8I!g9EO=R6|V
zbG8&tZ<4Sao|kjpF6<xkoDr~Zoj{a%&X-|dYd*z1=U~{+IzG&E&gAWfZd9mBefKcv
zO|eWJHR<uN2Zi~=x1;=22){lQ`*RR<gUA04<)NpF{rX~*C&H$8Mt@n~rkA5U4Q=`~
z)F(al>ra0W^%D!-U!H2%ySYurV!-LjBIj?y@n@0qdZf<{G^s_B{pf8Qmcx84=RdH$
zmZP_CSPt{?C4Gf+tWf_er0`YFdP05ETRJSKn{Vu}>+79ch5BFbydL(93>0a-l%C$~
zVL6NkI=_Z}Ek|$qu$-=Jan473u-q0YoZbLpIUR2R=^*THuS?-?Nct}4CxZQVN#T1W
z{cUHWu>Za7d<phX4ixciDL%bf#Bw^`EYe%BKfP(ha=Q7(5xaiK`HgV=Ipkajdp8b5
zp*NCPPB-67V%Lv26NUYa-c({aT{-4FAlRSYT4Fife1nNyKjFMXsE-rQ`mlFoAj%0T
zJ-z9~a+pu$+$PwY-h5&?JYVQ^3HGJ8pjb{<zH`nK+B>}w#c~+Gb0!P+rMIJ4PFH?+
zmJ0U#T?*G-<AnCCyIj<s16k;JtAgb)UMJ~6u62SvgQW0K*NuYxLZ$G!u5X3oZ(S)o
z(zQsiU!?0K`ai3Dky899Nsn=j73>!yg~z*s1^dNI;R&wi1^XpP;VoSK1pBpcokV|X
zm9K>q|4K=3<C-bhuZ<Mm(bYn*Uq>nY8dsTMziXuMG}qmN{nA{!1^dyPVl1bdZ;Y|)
z8Lr-f{W7HZH@Hp<{pSr*ct6){!G8Uu@S9yJg8gom!Us$Gt*+g|`N^$P_-&G&;~FX0
zH%AH|F6nu$T7tdvq;Ps`jpcN_wdMuE{$r$YdYg^qbiB=`zfd3ab{os-=38#;`U9@z
z{P@p&>8&@G!}EEPKG~Hl)EB)C$8xwI=z3GAFM2bM<?uY7q|bKc3-w2D%&{DvzmxQN
zu27*q=}kJ8!|~s>T&TZAuI{KG>->`5vST^i|8rFc$2WT8j^%K?m-H2`M}_*JH}P0b
zH{Zx(*H^n*3H7nsbrk)vRi4#S`ugqyyaI#{e{}v6r{VTf2P?mDEJh7y;j|ow7tzcP
zvxVb2H!@K*(|0t(Yb#xBkMvTS7h44muIBe>8a%`DbDQxeyJq7RBNW49>UEW>3@mU*
z>EF1QrBB6jthT|m0I#$lA6A}7rMN3we@pnqX_qT?r1gIxt^c7GEIrvIPK#IeZ(=$f
zNaC~vWy^e~*E98G<tDt+f!0TTV4T)U>4g=M&f>RM95GC%bKp3wlQKV%>F|c$MLC9(
zM~Z)$si!LglkD*`l##;vdnx#~su@4pjNeCz;^~<_Kq)=Q!lTUaK}y4|OlRd8ssvrf
z^b|8ZQ>hq+1@6dZj+XZN8liN>d_yW<GKkX(lyNakPc!v9m8P|sKGf95D-$2W0(X>O
z@_xU@>g3c8wtiN>6O}I-u=K2aQ<Nq`_(Mt~9?s&=QXWiW@o5MpPJ2vg^&-oU>GPEJ
zk25{g3}2}9c*3qPRhr=yIkY{jJwK&nHnZz16rJ09keU8DW&N92;EuNEN?a^ZdRE@`
zN*)>l>2ZX%QOVe84}V#C2_LedaAu!vO4Y0O@DgQi0o$GgGyQI5(j81^?O~ttGp&?6
zTD*L$J^uU3#=9wZylWA}Y8zemUCr`m_BgCG=+AUY8>fA&g!E%Nv(GUlY!uVk`c5cD
zKGRwIKcn1oIa?o{lg4RZD>pV_I%~h*D^sNX=lf4s`m<*IUzEpJGM&}mJXb0VMI|0*
zhO24|YFOM+85eb8`Lpuk{S3&T;<NVrkZV*N)0w?`X>HISQFw0<r}fj)(wRM=nti~h
zlK#aFEIqSNi27Cr(@~8`AFk$JZ`bRqT}Co}u^Aqvp2r7(Xbr6WcvMdi3rDj<`X=i4
zU6{_wzsR+@&>p|J>id=HJIwegYO4qB;qBGUKQo=>ceT2Jw->g)uIfh`%YT`f-m6ZY
zV^7~pjaTjE>8n2Tus!@{b>Vq?{zKK2Y4-4JHRyMH_(=6$tk~M#+tsE&*~9Nt>5Uau
z_;_{6kM{5f)nR+=;ZxQ7414)zsDs|Ihd-vyciF?|tN(n<9==3%I_=?4shePEYyB(L
zA3tL{v)>xE8V!fS$C~zfLH)jz>8!oKte$y+=_zLTYw9~6GQE$fzoqVbkLf#1eW!YQ
zI9q>XQ$L{If0%`@H1&h(@R#iQeXM@|KGQ!k!;h&SKhJbTLwh-?#(S8~%2%l_-oo@k
zGrUTj@-owlP5nnTocHgnJ^rSSUxWbe!XZyYviLKw9H;5pK5Uq^{XyC=6rA*FW_XzP
z4qhQada<e3*M@XpI%{8zv};D$w>MVXH=5~e|7)gcLjSYH6(jUNEwn*>+4`t#I6i7O
z^kF*de>!M=@|e!*qqElC$8^^Jq-kEf!i36K&rE-vcBlRP0)Ef;X5nmq9;9vPVUIsl
ztH<|umOe{!mb3g>eT~q{u3_<6`3ki2<5@WCZ|>0E=uT^Aj^eyJg@v>FyI1Qt$)4YX
zS{`0mL@8MQQ?;{m?fOh@?M%BqN9%y&r4@gHMk9Kb{)9$P$XNPvZ8(lcq;CXq+A8g~
z19p9bc5<Ix->g;P#KTIzO`GRq+q>ROU!r}FhDqUUd-rPR%a~qZhQFh=*~at<re3C{
zVK9v1cQo}6wRU}3enqDKsrE)&rq4F@&$QEdOmAuGr?qjnGrhB^<9RCniVm`EtoEU6
zE!U$>y~Ndz>l8m$d)>9G6I(y4?{BrmH!_{l$7w%m@87_5c6|O#o7J1?ti5S^(MYDV
z_U6*x;^(g{er<iq2o}!TUmg9?My$MsnSTSl7B-x=pXt$h&rGJX^?P(@0*lY=(?s8W
z6$|&6>6`1T?xNIqcPWU~cDe4zwWm+fho#!>)lT1^%)(iDuGa5d#dKEQRDH)hrnB~)
zu4gS_dL;6X(|YI?{Ct+h@2xNA^~d7((;vW&OeJE+^MU$<!ujY>{rf}~j%I}XGW9TF
z{ki(%C>W)u`ij$h`YZhWmFWd~8y?Q=Jyu_{p2cV78K)~=rl*+c$Lr@X*hcv=`%To7
zlbD`thELN!z$=a@Jk8W+=@0E->4QzZNS`E}Pd={i;rk;CU#!1^S1M6@w;6w#9-hW@
z)}D&>kNNg7eWl*!ah5-8Kdbe!rFMP2{@RsHXYFC5{!3H4{*u1#Ii}NTcAU0V|IIdD
zM{Q<5DuT+x?D2-at}fGAeeBX-MgMMvzon;h`(>N?y`vwUV-GLW-FSr$#b^EVVZBZ!
z)0zE0(KimWhacB};;+o1__5kv*Xz7}v+X~n&+EnVXYIREfB1T)Gka9&yK|V%^8Z2K
zih|MlL(KC1s&8w^*4Nn7RikBNrnBvH8D&RU{L^N5ZKG8z)5n>5UE{ZoEIwO*L*t_>
zna=vFWv-sFOlR9W%+aVlOOM?i_Re)YAf5kB5zhZ&j9<JgJ=-7RjM+WydNU(r5Yrc%
z`6U~Dh4a7GM#v9reP||FUk77DXBMB8ceTq=$ii9sxW*Vz!So$w{4`_g1bcXf@$@Ns
zem5AWc>l}N_c!)@&BB+N=?57HAG4<)W`uoZPoHCa|ByXA&zN%79zNQbGSwbF&iMX}
zJ^Vhy|NR`c{z*oiFYMvdjFBh@)i(>DWlTR|51(Uf+-(nEU<|Lahc7kO?ze{*8<W1X
zhd*niyk!qxXMFRGJ$$2~!qC?Gw-_Uj+rwWozHZ3$v8KIt8m|N~owe7ujCs#8J;e+^
zU~KpY)BBkE$HpTrroV3L2aPQQS^YLP^<&1-+AMsfsh>2yUv1B?(s<U*^h0KNm2r3$
z(_b?6AB_fAFrAg}HzQ#k(+kaT-BD*P(~C_#$nilfrnB}K<~ZDd=`+mm`i@(9f5h@@
z<hU`Og-<iXV;zP4Sov9g%^V?kg&Nt9wWk)2mxkE4uZ?5qtxRY8*Hw<|h5q6lSC-IU
zT<bX4ldUh@TwgcG+dY`h`imY8gZB^2{=FSPWwLPAUkq@p#LXotPdzjJU`J2k{4U>d
z{5pI1Xh&yE=CI=5<<O6@{8)XAcg(~q-zc1wXQJc8y)2ydA5$Gp>HO}M$t;}J&rC<V
ziT3>FI7Yl-*B3Y{itPFmj#a1#S|3~ga!1?gc72uO0f$}R;An`B){4K`k-eAc8_n(C
z<{0{}T`zHb_O@N$>o^@@Pydc1b1>W9^=A4qM|2nqXWRRsV`nha3(WANj@=uWj&2D3
z*XNEI(M(6RLa%U~xsm0E&4m7yV{99y&o=e%9FO4wkjjs465&5Po|(Y(re-+Cw;!NT
z|M^at>ug;Xj%q`E#raYw(>uZrahlWldLy>}wr2VeXGAR)KGf82b!FVd^sS~I;mpAC
z-0!H4KYWIzXUEe9&gTyJLs=Vm0S%8*v;=WlwDb5bruQ;+kF&>irtdfPCeB-Nz2$e5
zzs8TpXRsWnHFvJ8!^#7*K~HfSc;zGIA8G3Coi|0;!#g{TM_K+UW_X%2iud0GOg+On
zX)z0D+c(d78Tx0xqxDzK^lNN;cE2g=+luY^_jX>lg6XV01Dt0cv4;<FCO&P~Go7Is
zOlRvK;cO!ue+!)ZuVULnWr@@7a5fmv?4JrfRy*Vhl8(2}O8WYyEIk=1PP@lB_gc0-
zN*||T{zDVHKE*j7?bq+Z(MGzBVc~534?7>Zg5|f=%x|`{7q4Fot0BKd&IM?QR6=x1
z(4Ta6p^D{>^7!XHEZmLdIBkV9bb>#W**Ao@k5n^!m9y6CEWXFgf4%cvUfzyo_>0ch
zrTVyjGmFpqlP%7XsBgcc?Qtw*;jDjt-5Dm;w_DPmUdG}NGuOAv*{(IyaoL6PzwPX{
z+n+lt|BKz2eTvQa?>WCnXYmtE{g87*H!*%Pw+FND5$Dn;S$x)hjyY#z#bnQDGyMr?
zAEYNe&eU^U^Y16kKOXso>*l*zILq&hbI4Gpv;FgH=e)b@`ghK2Z)JLjncq*&d&k-J
z-<>@NGo7tpckN2G>v^tEd3&Vw#cJQX&W&Z^Z2dv5pKrG37wQV-;cR_%T@!Ax=NIV;
zPGfqES)MVjt@p9*WBLE?dg)Gk{xPoPA@=;^T_4<G*ArY%4P-hie+$>NYnaaRzuPt9
zUVHv7_ZPRba8~{{uA-al`E_)q@NicCYg|Xrkx&jS|1{Uc&UXC)*Oq(i`G>pjFR<sI
z;d-~fJ^veAdq&yyelFK6WX>J6-)A0R;f>)Jr_FXn;e6WfsLbB`?cpn2+0yaW#mhtc
zU#zy-HJFblF@2jWB!}fk?KM_A;;Nrz*N?jT@at(7|83U_etyFA_gp{SVc*_zS5w|T
zVHV`~xodVN3uk(T>w#Q*{%2h?g!O&x8qM1mE6+EssoD1U)vlhreX#IfT;B-gSKXn!
zep$HTo+N|^yN7Xmu<+XMa3TM??zkJ6Jq?tf?#F$>+mpxC>ncNTW8o>Lo~b<DlI{Pj
ze;T1I`ILp9HN$^VYR9v1T3?*jOM51Rh4(h~ep*9*{>Ii9t$*B$g?r5K=6Zy%zVUiL
zVSN+z>-hRkoAGNKugBTfH_UO9u)bVJrF=fY^Y<T*evpnISMvQi)y$vGkBiBs(z5SP
z(^4>W+CO4)xjzK8&EOG+d7KU&X_(i`q?6r(eLNmIDOyT$;~QDzj}JLUL+Yb=crXvI
z&15hhzZKRK%J#!xJZ9UN(vRWkuyQkBWJ>)Yg_BFFYYHW)K9>!6JY2(&OTtN<nT`rU
z`sG|+!SlgjeLZ-^jOY2q^7!#QUSlqsa+$zo5|_zbw&W7VFztlLaw#aV-EDZj?b&%c
zmA|b$9F5H^C&q%w9)a!d%>BD?|Eav3*K+@^Y#fU6qaso|Dhf%;pX^WVGI*L{eq$hW
zx`8h^C<;k(N$9K1^>#N^CCSSr+8DW{o?Q0gk}`u!>ceF}F42dQOTxZoO00yoKbSxM
zn}j~zT+dJ*j$;<NB(zo2Ka1<xQo39oK7xni;@N}6;Kh^*>GOCv`dlaZFX8?L+<!E0
zPl(?b;rbIi9Op!|l!Rjuxg;D@(PYhbZ|XP(o8kAu4<3R2W4slQ+IL|8K%Z^KpTNRn
zp62U$kd-%P1=lC>c$0ZP&v5@K+<zK74+wsi*WYuz{_q$wnK*d0Vcr*|dPPx`;5CL)
zND}RLAxX67Vv_LRND}${lO*c@1SHk_X)Ym@q=)!=agOYP9=z5tpOvL_X1l@T&18B?
z50jed$8rgwB+cUKA7%EB!3Rr2D0~CouE!`A;?3o9K99eE>nJqEOj^wAX{BL)frYjQ
zO<oDc2VAL1(RSTK66Kmr66Gm^r0sc}O9&-t3D0jCX{evgyc|!m^Q~ay-wFP~uxBdC
zmkebXN!XLNkMf^E68Y15D1ZNYpejjE^ZZwkhWz>C*-6h>`FDgr<!_cB`Dc=j{IQ8<
z{x6Y4{#zj_|JS*MP?DbI`L8Ao`ETXrUt{I}AC-R{&;NOz|EoOz7p(j*RQ_>DLiQnh
zQ2G6Kr|qKcAeXd>=T9367egPQg-d$b%Ktwq|0_KISIumd82Yd+<^S5>l>c^~{|+--
zC1wZDf9Kzn|8AcDn>_zrJb#SY#lh=8ZlC*j{_pbq_wf7={7w14&-4F)=l>?p|KQ)0
z|6!j0M?C+xdHx^&P5FPq^QTS`E@nT^|JdJ@|8buG37-GEJpYq_Q~sxT{%6?zM`|xE
zu`22xGe~0p%q5Ba(+5fWCG~58{j-v%|B4@f`0E&wzUKZ_Y#b&SA9_wkx|lLv{%?5r
zclc%@<&X8!sR8xVls~PXx_VmwizKoB8vD2Jc|O%_{ucF<(G(xYHCi9_lW9CXZ4Z^Z
z7ncx9(oa17ul)QH<@CTmhQAgf={FvJ-YREDgi|?9``~zzNjl0qfh5Yim?X-(43gGY
z%q4`9q^Rupq_a7@0lV<mP9zyT+^MqjVb~=V>1ch~B(a`}Ty7+Z_3bB#^_4=>`VMgk
zf$u)@{DRq>cCvFS{3#!^ULj|bj(k>=L_X^wDIdz8B)KGv0n$<u#tNe#1MLLm@{*49
zX8Dl5#&#0M(_^g8U*G0&80qe$^hh@zlGaCd46GMpmF9Xe#^_IH+W&6r_&txOC%aQR
zzuloKNw^njrjJtDc>rF|(V61I4g*NuZ<zB^sQjiKP!2jCQ9h4z385t69<-Sc=H4Yi
z4@N$1Ng^M!-9Et2Ymg6>pSGtElJc3xC4`cMu`)9sT!UQ(ozka~M7lq<AFdJ2bh!3P
z=IMs=bmn;s)<^55^%Zgnp(Hiq>2MEME;rem)=S$-<*m_v&3SrUQ_AVb@$_UbO7FLq
zKOcB2Nw`;Nmb*23$7kR?8)Mj}e>>iu7W4Dz&&e0*+VgOXb((r7RXm@@Jw7u%=6VGq
zLg0M*S}R^1^3Ub@b>;E9vGABv+#h43;S|q*K8>-HXz0N>PbQayxh&>-u2;?b^TB7V
z_HKsbUZxq2F?v()!(~72KY;5PGdJVi%(r(fzs^N})gB3hzvkz6=&$;ae$FuG=TZIK
zPdd(<7m|dXmqAiJ7jp@rBn{&E-@=~73Y<6d*S93$o-}PI^*3hx+jxA8t(f~W%F~*{
zQJ#(@QJz$iD9=EWD9<#KD9<dCD9>{wQJxz63yhhV+l#qc{`^xY{@=B|BY6Ip+j3Fz
z&*%ALuFOTre>Be@V`CR3e~iJI_QzP>MadsyWM=*tYcuzkKWRVxsNT_j%zg^(hx#dM
zKh#fLusvgp(99om<u6M96M6oV`F@S^o9!O$)4a|?`!|nkX#azF`3p&+{11^t`B#!e
z`={e3?T`Nb0IHHSh37wARXot?I=B-_<ey3s`J3kt$bSgwu#b6MNB+}DNB%2FUMT;E
zc>XglQvS1e{*PXy_VXCef3B6kX>W`(^rr2`d4<{UoVU)eWcw6z`%pcQ{r&X-RY{u1
z^IyP@4|Lsc`Y+`Ei}~>v^<wr*SWg-vQ2m<q0{dr@4*TaqQvN<JAuuk$^I2xKpI-2%
z^k#cU`q88#Jsl@0{dg`Rl%ywl`eJ^3SkColto*VOkMg7SQhPAl1@fB#o${N_C4`c+
zlBZu~r5^@=N>Amd^o1mmp7Npe{(PV+NvnDKb^Q3b$RKYeX+8IUUNy%xgW*s1(p?TV
z-spCi`;8vtVDVqz+w-Dz95(ZLiRZILRWx`6j@Pe9$M0=cI^p>J8c)BSrw`@pdxIa(
z{rV2J{+Q*w{JXf0@n^Ffds#kz7>|C7A0ILP9Epe*9FN||%kd6-rkakA)IaH$@$wwt
z;iY^%czst0!UN|aWxPL=$D<GObcfmTJ1`#o4{pzoxIDt+eaiKtTtCM3axOpP`FI>`
zJet48E9nG}{{@eCipvTv{~vST11D8k^*=6)e-I57jSLZWEnJayb_ZCJYE>{$G(;>a
zYFTy{SY2Ra2gTZol#G&+jEW44_jNNX^0lI(qFz!gO)OIKPhnzVQSz!4mKNpjd+u}2
zopYak=Fa^$`g=aiJluQF{eI8)obx>QnLD#HPjUZ$+&{zpU%3Ap$4Tx-i|)TO?h9Ne
zaz9#*|BH|R$Na66e?R&~-hW7qxles9=c%T~%>T7iEvQ5OnWOr{c$<I5sGfhmsQxJ4
z&p%I8e++LQ$36e-Q2i@w%<J0;oG*O%gBa`iXNBrVvi&IDKbp5svCcb<kDt!RUsIDC
z4V)owVB9f$ydEF0p#5?m`ApuAp9%7=Yp}1w@j?7GV)f(rc%E?^Yl7?E0w14H6I}OB
zEZGId%_O!z+Z-Qt9{Y!%4I+O>ozL6&*&r_tEsS#u=iwaQe_oAwJ&O6HKzgPPHuE&D
zXR~R0`rzPw<O>GpR?>dd9lb6Xf;#*H_1J$q^}yLpJ?5i5=xILM%RRbW{Z!_i#&NxH
zuzx?oyFSbq9DW~pI-if9C!+ZK>*0%7??oKnncU-Nh&=tXdHXWnejDfM&4bPQ7<%3a
zydkF#HrFTUl64Ku$E0U1deTF>si#(tpDpt6-)ZniUCMso=Za3n@gcwutPk+DZQlHi
z`K6nVBVIIL6TZy*!h_wp`gb#a8{@x~@#mND1M3^$&m%nGucsdPo2du>7WCxzR_@W|
z>N^;JA>+?s{6!`FRQ_Mi_=_3;9gM%EgkR48BK#x&DIVm%#GQ2c@$X^$UdErx_{9=_
zD*vx!{HqzCzb3E#y&2*6F+TtN(x`dt|H_Q;uVMTTv;XrM|GJFuS2I5UeAB27#$S^W
z{wElpf8J@-0>-~FBm8xY|5=XDBF0~z5&lh#e>3Cr*B;h?AtU^ajDHK`ceDTf8R6f`
z_+P0puQxHDjid31`EeSL&ki1+i+EhpyylP3uk!g{=j+d6_V0Gye@Bg3m-P%b_mSVj
z$G^eHzg1)I4}$js;=w#kJjCzaufY7^U3V})&^$-HGS6W%SHGEYzFTAN%i+4_U7vAX
z8%sEtC(orG=aU{fe+KvHa`jvI{2$bq&ndvq(bzwVzizUAD<A(+$xm-SgP&e}a6Op^
zd-AuBdiYE87x8UCPkbA>N0+O|&surclRK@rEa$k~#mDdF>o(%jg7YXY-gN~$@1<?@
zo2UohPpAjq4)nyglY4Zz`kye~y(Rx!u%FKN@``>9Z3E{v>VZSJgmVY?=yLTxW1Rb~
zI)Pu_>pz@7A9i#;<&Vzq<{n+H{^xxDFH3%SuM=_JG90J#R<J$Ak<O=9{{Wx&tI~O1
z{703p-#5aJ&ZoH3c@lT;{D=7bM{9!jkrCI~blz!$quodTHRC*16TF`)bz8^l8tC!r
z0RF6Ge^zmiE?56s#(9G473X{PiSt6^_d7oC$r@AFIBzcSC~w|627D5?mDumc?+<+5
zp9cC(@uu_Xx?47Wf9CW5Z{YbwK0oyO{WPEdm(sc!r{(JZ%KHy+J;{3d8XgDF@$u(t
z$Q<wYl-9}K_P_Wze&#E1ANfBeyTE!nH^_`T{Os4^02p;0^9&kf?jy^3dhj4Ke_);L
z@f^<Q4H@LVk35u*A3ey}zk>T?c>i&{J)E~s7-Z&Itcx3PhJRo6<Gen_d^MBye`0X(
zJ~GzLpP~K8v()!SZ2NhBCF7qsD7bFsuZ6A0&xuhyhG2f9RzHgEN0<C*q~n-Bz3~Nq
zT4)>oc;giQP#sgfc=Iy+xs|rzk8{2_h4Jf3_?hZGo$<$13I7bnA6q4S{5%@XaP{~Z
zv=b?gS=U3J@e5VL$Ir8Q{x|b@f&b;|XBO#0{dn^f>c^WOQ9m?am#ybXj6b<b_-|nR
z79Q8|->ZAnzxO&3_3vHRQ2%q-|CQ9k|LdrS|NYdX{^`0&<50!{HgomoF#eQ5=Kcck
z1FutnKaI`@{yV5gd_F)u@V#*c{Qsuya`;mje_ECB@$+_GerHsvelBACnI(KL-nh@;
z-6z1h!kc$)F0HTZ_-y3(P#!4$k_T+&>MvpZ*@L|61HJC|_Fu;P-!{ms7iHXm=Uf<2
z{Jp#&{_|)X@$W!S_=~tlhx-DI^UhNJ%)ov+->Y|=zl64NK3ym2{1x1z%hk{2^IQ4)
zFpszAm+<Dpj_`<=>dmVQ;H}0s;jQ5wU9P^J&tFhF-&-%@eDa^pUr9aACmcFoaIl%H
zU&!ZQKFF-sKfvpP{=vCp55al3FF1<&#dyD$dekl6n)Z6U_3Gi$-z5<)y_GuXOITm=
zwuj%%_)7;FKY%-w&I9fU>VfOw16S}{Xg~a&!Z`T45f9(P>tVcJd@~@~0f%m_QvYY_
zfk(F>secXiz@hIBCjT0!2Ty^wJv{t5buGmKKQrjP{`m^m%L=nT81l8j=6=p5-v3^<
z$Il1?CO7Kqyq|w2uzn@y^%}NY<^8#KZpb&du7L9sI#1r;_%PdjgwI>e+xS_)!(lfB
z_r-@(e=GA`&&NN`$NyAo-Y1shpWx$b%bfp7KK`je=Kk$>2YdIkM&a`jW67^CQ8W;b
zb!_(;uB$DB&H5K#SKfl-L%z@R7=K-P{b$+!bBz1LGPpOf-G)KtJ~#NO)!)qfzgWSq
zjcoVd6?kr8yDydM+M8ccC*C;y@nAFmq8=8I9_+uI`a1`k*Cp708*QV0WPZN`+k@^J
z?7tqxX0HCr%=1-Ve{DDKAI!U(b$!iRm&yLyd45`1>wWhv;d*%AWV~;4{oOOztUvGN
z*R|*;z;INT`CN>D-go&t{G8!P93LWi`2p|$q3MVG)OvpdKW{jc?62XxZ)5vA@l9{o
zKj<EOqb>FLqvo~L{|vu4N&S8JWl8FH;2YSezkg6}BlSPWH>gqn3w$#w^*iwkkJSGX
zzl=ov1Ng;8>L28Kzl*N}_w(yqd|sU9%^^P@?BUYq$M^8|J7|0(AMd9A7kC|up2ju4
zo})BB>|*~PX8cEZ``4_0C&!t8=CJ-TKK?k@`GbSa>#<#fbKfUk^uOhP81oNjewx3C
zf28K$!+5`E{=I|DxIx~$bq0E`{vH}^))VNd)&GId+c(I&Pch^Xu0wpi{Yo4sz0~Ue
z#CA^&GV2xCdHeVC{-^N^WY|G|d+U|mgL8M%HthCNkNDy1Haxts?019q{~5;lE5B~Q
zc$h}#!Ef)n27hm)ZSnhWZ2z1Y&qMHa`lE21>az|#T@R?$<7XFZsei%rLw;-3;XgTE
z2ifjFJU)Iu*vxNuKX3%jAGDY8USzu(%=g$o<aZX{pjtCOV?VX}!Myz>Zy#1`UJuIg
zBY0bmA6aYG4^LVA`}zE%3~&7~=Kr(Be+=VczsG+ZZ~q@}AJ6!IvGD)O$6v|#Co=xC
z7XGUl5Boj*lX&}YynQm`|HHz6o{yix_;rl`cMJb?#>0LO|Fyi$KNnDc2IK$R!v7E3
zpUL>+82_M!|2oFQeh)v-+b{BV6JOUlD7(ntc*dK^@Bh~vYS!m6o}2mj>ub&HD%6*E
z-r2k#KeIR-JE-ow{cq&`EwyGnDErUh{paz1%$J`16yAS6<H-Iu^Zx0kr|YO^e?hHz
zA92v3xudaT2zqb-47R_R<A={pc>CYN`!BI@W*Hp+{jgfbna%iv86Ule^ESqLJL6+L
z?d^XD@1JYo9m?mu%f!D1<Cd-mHQgruH6Js2YpyrruV#(8&sy{G+T3We`-B<iH8+^Q
z2di0Y))6%~nmpBf%Dn$rv(DUKsQI+HZq<B-d2VK&FEZX27;mGAOU>tv-_(14J<0Ze
zWcxp`{XVw;J=>%A?2k0{S#z|xzgsiZynkEs3iEl0nxo9TTr<qXspg2m-h5JX#G&5&
zK)r`E<WO%OszFb6M0PYEQGYn~{JDXeS2Ex0%=`E?4Q!Vm>|K{@8rhE~_M<S^d!M#u
zyt%&DOf>h0YMR-<N$lV22Ya7`tvTC_qndM==RC$cm+_{s4!l225vf7%`M-+oasO*H
z?f)>_e}wI?VSDtR9*hU?yghuLT?gM}Jx?%RxjML=^++B359^USxP$q4T~hNi=6j6e
z_bZOy!_4<<=KBr%Z`a)pi|>~f-vi9o#`V!&xemQJgw&lEuVXo0$8nGA$}oyEt|wl+
z|G@tKk@LEb{rVHf|L8+azFxs~H;n5Jy@!LJCGqMGy;pazqjg>ldJiAx*U>h5&)*nz
z@7afp!%F(S<G9Xwe&YJ(`SUdEeTMZN%lhzhDqg(Md*@+)B>ZO?AJ;bz{{Z7Z$N0k;
z|9Hkn@8M#<*H_Yq>zwC5u5TXxKN<gDjDG^-<L6#H|IvH6*dGZW*EtU#*EbIzR|hX&
zhnV@dW(4EEit*8VxY+OYA@!FVx2&^!+&Qx@8rQj^t7FBuV&{tDxYl=Ed}*;U-#TOZ
zx#!KC*?P{o(_1e-=c1{X&OGP5srjb)ZM|LXtzEsvWu0w{r(bpPrLFmV`=YjGt;J<+
zUB%w%S52Kdby@G!SyvnE>=9FV+djbC_LSaML`>lA($Ls;_fCx)+9-g=&tlvB=rs@p
zHeq=Qv^%^hLJ$U+A_QTu2}4kMgssSYgfU`*niX%|fuQ*yskapo6L>4-<(|DzUU8j`
z0+^z_D*2fr1n%&r2tgQNiV%dsR%L`WE$l2#oq1K)Rhf=5g_<B3GRoZbps=eFk%@>%
zch{26?4x2KXC4^~zbeu3qCcw&)k2t=M<n2_L65cm3!m_sdX^Wb#tlU@$OMsy23(b*
zn212kZ)?9Ib}+(6x`s^<km%rXgEHQ{Ixq{^`O6oSd3`Xx7jbEqpu{P^hy;^}fC8V0
zB+_dfGlJ*^#Xz4fZET$?>N0u(6ooGHQiwttw?roKa71;qb`?99wH22xD^n(Im!3QE
z%KXFzwCK@Hjvps{iCJ3TacME%ynIP}+wz5rimjb1+B<uST}zi-nQMJVNB2yxYeQGP
z7v=(<QDM^BULfO)WNVPQ*LNB`w!fi}VK+INyO#F0VkYY>bS>$^A~1P2!Y@5oWzW2j
z!6U1S1{tT8ITO)<;|_NV+?|tDfe4385r}Z$xPcgWl^Ad{if)~aU%sGw=~Yuv6>&U|
z4W8P2cW^TDz7lw9@7*t;CM{pm(YZ|GpPIz2A{_}2rv+WzowU4)N)dT>i31#`Kok0H
zD5AYGDUE@yB@4?22ZL@>TX*-;c5mH5w|_H9NcfU^{PHDqHzDp+9~Cq~BBDaa9R!?b
zfp^zu%5YQyO%aYt&?&>=o_4%dcDA)4kSRh@+1EIOGg4iM*A(T*Ggf%131o^uxNAay
z-4$_R`8Uv#PE$>IQEks4Ri;Uh;P6G{_+n>wcTe2K4cAUoXm>`+C&Yqxr#lnRD?!Kg
zyi`hfE4KXImgcS{t!-Dfb#+Vm#L4Rb4!4L@9M<IEo_PvAot;;Rg4nY|1<VxFLj~lx
zIkjTpj&{0ORKQFTiwejIV^Lw?FX&$0yC`;HL<LO{ji}Hm!{HA0_;lf@1eziom7o)b
zL$3esap=w43u9MDRL}(BhzgxD9A%<S7vSXKs05lK9F?FGh9ms-?D+QXrM;c8t0O9C
zf^bBIu1YxajjgR$EyGRu*2POZ{ID1m(O!e|)hk>@KHu7k507>DESbk?07Kkx4OsQK
zXO~I6i<VxsxNXVR?NUQ=f;E7|Jq9u+aVwe7y96Ko^JP?CUkz}+B5s^4$45_{VR!J;
z$E6}}s<>1{PaPL`UdQ+1hL&G0RjB$53ET=M_Ifwvs;MDU3b%?0z4MnZ?y07T5(C~c
zD}Temf6r_JeM)F)h)3ly9Pgw%-y^XoWU|T}cwkw_p(ryngW*ZydnDk2zL&oP5^=W0
zr%vYgUcDqFwJ|8%BGOP;ubkcErJw~!@XNa$4>Qh89uK)nvv?pHaVp00-kr<<dhA$N
zz)TVA3dpHroiRSgI($u?EY=Y*6T~_ia@dD3<S$La@1{)X?Oak^cJ-9;Sb)btbLS{3
z+9duXn5Fo07v~kKvOf{$+=@WT6}P5}2m`OWNr56&Y65@UF+Q(i&IiQUEvzz7Bw-#*
z(vNLLtMW#9nHhODje(nBl*d4iJF9ZYg~6RU8L!FX5&<_wTq>i7%~}4EdWx^l_!8+}
zjG7qS<EMmLv6^CF#qcoN3}13H0d)Ay)@0BFW|h?89XJDrLB^@a*uKVyu__98otMHJ
zr@$&<#qcm+@UPS6uT`_ejx<4)LJ-GohL+;Z(rb>$(gplCrj@WOW=>)p2{BIT#`QE#
zfTb=nk3v@z!~{`@gd6t~J7981UktGz<HR8raNIydTHck0a^*1*129eyV!*}?0Z-<%
z+`^|P!zPD;AE1mAne;qy0+yaFVH|1dektOZf+s;7Q?SL2W3&H<WK|7gYMMAvOiLE_
zS|Q)41Lpo*c-Y7_IwHNWP^;B=AGD4$Pn72SBph+Fl8z~EU6<HGKeBh8|BA2j#U>VH
zvdBdAHCYicxO?%DDiC3isR9uO9JeAOUDV@*AqHTaAVh}^ou?Q^?(4W;=*oSae5QAG
zE1^xGzY6K@oKne7z3_Fr?;*JF1kS#)p>+v9XLE7I_ng8bRHEPsB75LCqd8Jm2l$*#
z5E2w|)YuLPLG&ogi}y+u5<7iSfd}|rIoeU7D_@hi9-;syNM8il&^ajL6*JC6;JzZ1
zDt<sVW-nUO95xHcEea{sN(53z8N&|ryYd8<)b;F<2Y4Sc1`>Lm5n`NC5ZBWIQHVZ^
z#jU=|DYUK>mCAa6?;-Jy2_1PBixPx5`HSi2fDlAapG=gMqAZg~<n%=a9^iZB^hJe^
zoW3Z43DOq@*7;f>Li%`wSGuQ83srBK89je-k>eyVE_US%#zBme!Z^4ob6DxleexVe
zMoy5!$k>r{7zr^!4x`}4TMULwmZ3mAt%rZ|DQrbpdG<|pKRZFCWy2Sz{<2}LT$Sm0
z;?!z-wxqKVGt<Q?{*CnH6_b)LLB*tGj9f7(coI}h3O0AeRCsxq<}Hc=)$&qs4XBg|
ztE)^!R-Uvop&OtxWFegiVdVjlnkLS8NJ|!W<>vdo=TQNN*{L_a!ru^y59D5RRQ4#+
zn!|%}-;OR{MRMUN{}JZ~>(xglSOe-j!g#h`PnWslYP*{~@BrV-M<n7$A8ntr0gN;5
zV#anr2%<-sE_E1I<vvhvha!960lrs`c1)kM0Zfp-sD8!?LDZY*cH%;U5F0XvziK{n
zPqtH{I~oIPfQK2~_qUzR8g`)Hl@~gER|Q|58v1G50j_6{Jiz;qqD$y?Mu^7KXg|9W
z*V6$}h(2d#pF-<GQfUkh@I55nF`+B3Y-0e%$zKdu_lvj61BEGMzONKz4n_33hzgt_
zeNmw!r!NX%g7ig!O`5)l_ob81pq1WH@R8#rFrn8WBRVeP0B<8yw9KXzKC$mdB>Gs1
zi#)*l%8{vb*W30wL&P}V4p`7doRC7?jSU&cU!FcI+`^9$+?ap^e2q}Yyck`Y=nk(f
z<t5`Apfn`qnJTP0&j4l7V@j8n_;=}(=P)JT0Hu{<o075ewO?MErHkYMWtCoDrMW#h
zAb(Z7Z|-vqR9Ja&nW@N^h;D$+kQ&WWU$trC=qg<@WBx6LUoDl#U3!i<iYBzS78fmB
zdKG@8rK7dIt+!bEouJ?+VnWhT8DpSF<-h((=AE*)%L`akbeDBAQ()t_zNe5Wyz|9P
z$Tx$j(72a>8H6S(aKg|;g^wGW{3L!g8R5sU@&y!qXK%4}!O~@|ol6%asHM#4;)F3X
z(rkk3PG!}Cn}9BTa1)Ty44-S8zjRqKH?Do@;>Gw@r7Hde8Dm$ztXTK6+;8pCkA$W7
z)*Up39oyTAh$hp~{^*h;v6SzvyCZ?$(TW?|D1ZYiGUZ<{mHbQ*0(W>z(2?^cAqWFZ
z5rQyS{G9F;oy*Qz>iq;@uldcdwjy2y&R>qXzKSD|u_MQbuTy2-ouyHd-dlH|6n1QH
zD<Y;Szp^7RZfK?a!T?j0Ul^?Wk{Wq%yTgkSm^1`ofGI){2D@<C(&at51@yi6OLGf)
z@f#!PmiBZmsp8;U9Qf4!#TDaSdGIk}f^rsYcZ_K8CH1x<Vghd~j+MC1MgdGwd1VJ*
z@`Q=U?(kypB@ICsV2Tigz_zyb7V#U+t?i4hXkCEcC#vF*W9-;h5O)G;SfuyX9T|lk
z+uMqW)fjSdLn{UB4lN28fGO%N47OU=yQCp-=PPvxLSVfsTyETwrNz#1Z@&1lv%CR_
zPrWX=>hda$z6o6mmn>b@Ikk%kVi&bLp&B+pwa8_!GI-pYiT2)gftDEf_2>4;QHhTm
zCoJ*N6UL>&JJ*Th5(76uTw<WdjZ37rh~tMPHf)@z#0AIv(pIhcg|3&82N63SKKd1+
z2}-OxG=lA(gcWw|iLfGK9B)f+*o6KqL-W!r`4_R1=da=gKW_S>046BsD6k1fw?Mm7
zhzoww5QG7y2tgQZ+z>>pw0r~oya>JiUa(;53Vc_c|Mk}sX>Ui@G73^0O_>s>R_zYy
zOQ1Rpacb4>^_7>=&^)ImcB{^wIMSss8g1kYLip#?DwD+-L>cNcw9zi6rLi0DGYi>@
zubLNOe`e^<d-!$A&Ngq>OFbIg!*Ej1eB6GaJ1=tmiIbv8m60Fc+Pb*y3jCsEhxtgB
zFlAKiW%1)EDWy4dE#%MDJxhD1;sRAzfd5RNw0J&VMB_Izi&Lw8fePbIT_WxYv-+A-
z@TS)69v0pl@-oCabKXcJG!kn@qqQPeb*@a+$z_5IQ<x)hq?abFjGc%(qT<{(nsp)O
zO#6GPFQu<SZJpGHci-CEic6PGZ=Z@5`PESM_~WFbdR`>VN2J?TRm?{f_!H!#3SPv`
zN2D3p+}x{1I;ut=CmU6BB4#rDb#=a>b47cn`N&P_Q<PEXoM<p6K+#_7B>L+93ClWr
zyWZOw-+y}srb#*9zNl?kYjIgySFx97;DJ+eIl34+{lGQ%b{4%QbA0C`V8rl9zJ)_>
z*}9j5P58y$sWY$Y%Jf4UCC~&zDUQE!!ckgQguV`%u!4U48}D94k4X~bIDtumA9MPM
z`t3j750|UpR3QPAygQ{ud}zFsgDTMATlkZ6@T?zRsuStQu)CIYmSjYJp%Di-P9-Ju
zJ5Kl`Q8eSra5{RIF3vtS7INmnvGC&#vq;e?P;@e{8iks9R1|jHh(w><dY03)d|@@_
zWd$84Hi><YGoT`pjPF$<;wFL1Qr^gOFBQgLwXCa%5gQ`|@p0pXKR$ZGxX5(uzMJQN
zSSRTssxoYXsKoO*PC;68nA>}^1Z>YXBqh+y15$#HTO$L;r#m42x-xo9k|4(kOcMMm
zMMu_^5}Y{o7*U2^S5}e6UsopK;Gq@%7U%$m$jizYxN+(znb&br9BIlat+yrgkpmMx
zSq6a<L?#Y=+yNFTG-}nFacnH)%!6a$S0y^Udd)a83N`bnDD1cqi8x#0a>eV(=wV3&
z9Va%42&xnyf4wd7F+!r<6y-rH>uvXn!C!9+L*(f!25y}2C-XW%Tx7m<zYd{KnI>IV
zRzytUtvicpysd~B$J>a5r}UXvj&U3gu8{C`#sG%MbsYoOc&)!Cq~aeU#z0R#r^I_p
zJ3**QX-+{ECwiF>#to=76}g8sK6xB>o{*U{3@}b`V)~h2tcl0&xgtdf!T?i*APhEc
z6_iRZ^evt7J@c0@?vYxE6XO8{ZtpWBa2MYAh1FJ2Z36Xa%xYa%f)oi#H2eY(gil_o
z@uuY<YaCIf+D*Z@U_tlt-bGdV<4IZ?Ey(nZXN4GNnDZ<x%TD(oSJ;skERhitcq<dX
zd&a=TA2+m70OJ&3)N3F6nIZ)4grx{U7+{JJguu48wsp46?`mD#xp*=DDlNCbd$T3C
zpuKx(Z)X+9A7jU^Xm{1o7)kG~J4^~Ywzm}#Qxu;&5-7g7p{+Rn0GOiqD*2fr1n%&r
z2tgQNiV%dr>Tl~<xV&vyM{WVV3tz>N$JnuJ*_}rk9qGMw2S{PZ_O>Eoin4P@0%aFB
zv=v7l08^A*B|lSyz#ZNcAqWFZ5rPodu)h{d^>NOrm$#=LzHYze&0@ySXizBB1d$G3
zYAWowuUsN6j`dq)*+#`e&O9;}epRC5MSoVdaq%%TkBE<)FcvbKmKi&ETWM<CP(*`F
z5Q%8O2?G&6Bqt&e^cSkJgApAzK|msdXFqM@0~)=H@TKRakQo1?y`@&V-NE+)-R0-K
zZPzX_uL8j&df${pBqE74*_r`Lf7&omH2&mls;JBIx-=`CF7rx@s&QZjQ+yr#_^Y})
zI+v9GaKoCWvPB*kvTX6)lU5{-GD9bW=tM?N7@f%Y?&y?%k8l!SDFWYR?`CVev}^@c
z1Akzos=<QqH^7^zxpBQ$FQz_p_O~W6_sbuAifu`8+12NbpE~Q(rq+0f?zr2Caeov#
z+8;~_OC$U3vBaKf!(-xO$H{H1sQV0Y$AQHXo{0cU>=;GFP7$MM4B6FsKJ!`^#Ol;K
z-T1+nry7Z!J$HpGM3c8@i@Qiwr?6vt>#hWan7~_kZQ+gt?$N{zZ4|%+qag}x!f8UF
z-Qi6Uf-t}oAqazw8-nK6)~+RZEzsJAKbu*!xU<;R?yn1`&%DxI6;r)+wpH%48(L@Q
zv8=zexpmg;)~MsLdi-$$Ts<!`&WAhoFI_%T@MoBh6kcSSkE@dmkBONLk2Lg|Wh0Ff
znI>b!%bSce^qD0ijT4zBqxkYBBMp6K$w=cw%w#k<E?})!;ey_}WclLGWnJy9-Cc|E
z#UiCkdvCQ9^wPQ%BWW+KV=)t%cO<fuw8hm<TJ`8-B&d2$WSWfbmp2({=rc=38YePM
z#^o<>GSbjzmW(t`#7su~Ikc<V33_Q=ijlOJ*0Gq044-QkR6A+aqmPlG>N$~VGCE)0
zWTc_bEE#E>$TS%pFK;r^&}Wv6G)`oijQKBbGSbjzmW(t`WSWetliZxk@Sa!-`plA%
zHU`F#Xm2`&zF=IDA{tZ`mEWPN8hvKTNE?I9l2LqllaYo#vt*=kBIYy|f8E_%?F7BF
zF2zXNOY2z7M24@=7gsxJ)uWG*pz1l1X)?NB-ejbq&ny{foX9j8m%qHpNJF1lGSWB^
zGa2#c(5`AH=%sZjM$%qd$6_Wje6C$k?W9$YK1PD7=R~H-=zMvTk%m6AWTbH-(`0nK
zyvayIpII`}IFV^G=D)njNJF1lGSWB^HyO!(K!!ei*;SlAlYj4}b4lC$?#|Y(1=HvB
zE^C~KqrI)|Jw5q}tqYbey9$5q--@p`U*`Qr*KB;!a{QHT-OD?tUOBZ;yt=1z>ZOxf
z@h|EJFaJMsI8MU<KXN-}i4=OTYU?R|mIHsOHi3R{t-BLHwnjhpqmtj&hV<u=eEO1=
z*7l`K@OLfC+lyT&j_IYu_b$sfi%nZ^Z`VSvdZy#=R0fm={qf4B6Qb6}{}-OdD2o3t
z{Eb-+>W?Dheesni7Js2JK58~IVTzHBO!(qPbJF~_UVO@pKFN=8;u(KlJKcE+q@fo4
zsl&EQr@kddI5VM&6VFTt69$z2(E23`XgaC{0Zm63H=xa?LSKS-X2BFEoLTV2jb`aj
z%Hz$RF~@ppnmBPxOBVVUfJwpem#?MC(Wr^`zGPy;Mnzcp{m0ZaFGYsVV@=h`P~HSA
z6g<(g8G~ikh5nT>S@J`_^0t6qx9h=Ah+SIX#Y`#==jDDXbF^o};r^rvaV#`CvY{z2
z1vDfj5e@&rp8UCEIW2gZ;{641)K`*;VB=)k`a{Ev{g&^NsSF!usz~H>oS>8@z6wJu
zZaNbH#|caV__&J${w?q>DfDuqDQ;wv;l@d-HI%Y)JP~XHzhx+8?00n7IE849&}cr#
z3Ce&<k46z^%@g`1QgWxD2^ZHmfl26hoX~LW!@tU0`%hCq<-o*-jT4r*;Gyd=29p`e
zeeIDiaWP*$6Y1M*1khb-7GTn^;}DW?ug%x0WV(nD{{=ch`r`YZpss}^JPV>CR&B?F
zP7$C;zGqkC<||?{tZ@d6TjPAQ4Qq$#?(z=aY>u-~P6iz#g~<qFuC5e`yF@YxPz>l~
z0g6r#rN+ZAWZpd#x(de(wS3iA1$4T(Am|xgBfT3Ian}uzE|7wpK~(9!hv<$mNvi^O
zkMN1@OM9+fu((J!KLo#GTw|jqE8FNECyR)CSfq_eG}L4fiH03_<PBH@y900TkVP&M
z_10MEi}n(1jF`j+PaPC@>`UGgLB)|X(C<pHse)1gJak@)SQYebk>1o156tbE4;K6C
z5!G9)Lt{*I1JmUm8kp!AHdVSRfmf-9OWtQ%!zI{MK`B!y67hItS0=((KWA6N0#>Gm
z%YWT(eiGmO34Eii+vV|{?^)i~?SH~X%1<Y-szd`*T2(rC<;SITmr@l%8H*@=DC5wD
zjhAM;62!N?_jbzNsD{?i7pcCzUNcoVhd&2quA9+p&+|r91zX>j{Djt4eA2Ajd!lcB
z@5Lw18d}G9UWsovo|^b|iQJ1QGaP$6JFn=Ox&j}#@g12+`#QRoF=yqqL8SX+<HMN-
z7E}4Jp3Z{LJuoA4mZ{uuje3%+E>ntVCRS!RqkZmxGbryFgw*E3Y-%$VQ-Wxw;!9YY
z!WojmjH8)|DMd6B@x_ehq(yDLtqa=PJB$7zWjba@Tq!y_+pjE6Z*QNpcz$oOt=QRG
z#D{{X&YyK54$G&6Bi>2Rf+WUxo3y;Q)1hg6JAEX5`c))j)`hcM6Ddgyo!<YlImuW|
zT%PpGI5YT*gKA|a3_8946Y-6ft@y%fb9>(TgBR{Op9E)Ji&b$ZqZlphlo;{s9pNQZ
z)nb&jGa1E*>d2e<opt2CCR8m(Sv!+aj3{*`My@(~iDQ(tGcjTm^~P6o&+_?Qi|6AH
zvyxo&QnMIE`1PA4cV68yXQ-l75p-8iC|~8*j05g_#$-tq!I)ezSCCPwV|>{HtU|i7
zA&d0xVR@>`Ws!m)PDLcA!ELDWcklRBKxuVPzxmM6+St`GmF`DXKG9!H2Tv?}v%p`$
z3q@H=_Zqh1Y5qdAqGgIzRy6EntCMKh$*$_ru#;U4J?t`f;>#vkK8qlC0^C;${1nm5
z^XbQ7^xNUyk3HhAPjS;P!9Yq!7<Yc<(Hnke6Tb+QwaRpa2~|pH-PbHvF59!oWirBq
zDkZdTQdcfhs!T_iP^ILu!npMB#81WF^;C60+Ds{RxwGfjsLhsQqKV0rP?r>mJ70cP
zW}qt}Q%YU#C{{yPOs0goqKq&4l7#||s+1gVMW)u%azv?ytT@~{Obukk;T}Kyjvy8y
zg#|tMD6hV+9`Qc9EO^2L7EY947D_{xu<V4=ovv_&L>c*|R~n)ep-igFP-g$GV-{5z
zJ{@^ETS(t3<0}6Ip-e-UuquTzBzt8Q#;VFRL@7d<R9Bp;EZqr<_bmxc_?8ND_cCw&
z;W*a+bcu`n`HgCN5GVN6^dn_~yRTqPcx`Wf*0bcgd}i2t5f<|@CRLu8El#xgRdj03
zszjF7QJ5JWw^Fl@YelZiqgs(MVNB)P?XDkM(`6Ualw1j7nv$_9F~w(vU$U51<jOpz
z6&Vx8G<?p9#2R@$o02O*Oj9x@jA{7jz(-MEx;m}Il^~`Ws57h?zEa3GrWLBD3NcN|
z7_(0Gn+<do%C|3STh>}!)`nla^*(}Dpl@0AKXaEwxn@flqiVAyra*VJ72CW!R?C)-
zYkkM;^DZv`9#D#JdYjtNN~sy}6)I}Y6~mDMFay%=eF&}D<Fww>F?aXP@;L@&8tqy7
z!P1v52>X)DsT}TXq;t*DL>c?LATxC&V%klqSua8ord=rGgj;66gp@MG(}z2yBWX&$
zVh&PVGu^jNLS8ZJM8sa*C1#5;tIN%1KVi=KETY29BU|=0WfkIDkt_44R%DF18j)Pe
zy3$=gWnVETifKx&1Tjs?7&oRe4TsZ~eR&rzs2P#PiE2iaal>k_51i9ZMp4a%D^5_e
zVN4j)@Tol8n5N`P5Yv>5abp^Bc$9l3Tb1D-h0H`Y){TJ*Gh7tb$V;4*TnXwXC1c#W
zv0nqY=eJB_T47{V;z|(Hl#DTBDz8rPsS5YXCeqE8SR*o9$`}#OmY4!<-Ees8#bs}{
zC~o(AF8m&BbVPe$8V7cEc}LU0hUgbqsqT!uO#&O{?Z9_w2h26zAHzEDJB0wNGH?&K
z_+=37V(P{XtAjMSArX*52)}g1cQ?}N&<z{GTdA)&Nec^Zq$^o`Z#id`?j|~`Hq6~L
zxM9(i8mn+SE~&p=NpQpb9WX7#sfRFNu7~iihKyeiJl)V(i+`&(cGR<H3k#V{r7x*A
zng=q9WSF)zw`yajEpxIkWu*}m?=x&%`*B`@S)X+qZ~^CEX$<~)SiY&%{7j$u3BJ<1
zjPw(21TnE|NwIU`vNnAC68(^0+mhn+`7`F{@n_^F@ReV!z4U&?SR>n?5UhUG>WbqE
zlP2ZRHJPr_bb0DJ#+i*mv#~H;BXu3)@@C6C7bY4D>N>_XnytL)%yVIau`peu>GITd
zj58aB@!m!gb;WUwrpue1W}{Fr7^Z79UEXy3++;AQ1BThkn=P|ZXfzho!NP3idCS{Z
z$a`Ir=^CknTC-)I3k}}BChCA;y1eNo<;Kkzhk0t8cdRg}na*ya4wk0No6bBJnvI3&
z8mTKHwq9qR3loh6b-*xNdDEGFg$c%jI#`&kyxB4vh4J2@Cet;VE^j*XTqqa|(>0nd
zPhH12er_@rrfW1^o_BhO3XR5sI#hw#%JY`7$QujOHJUEZov~;z7N%=7UEXxf5?f<A
zX(GvOq7H1P%bT6%xzKDZOxH*q)vec=eT9j}!gP(M%bU(T7bX}B(>0ndZ#wf_7;h|0
z*GL^$OlS5L3dX{8ji$?+j-Q*nvzn+w2F+I9Y?+Nhqp_e47G^8YTi(7x-dIov3)AJf
z^9~gnyhBZ<YordInyrZvTVpwC0v&6j4p^qko1JE(&}=NIgN5nxrZdlliN?Zoji$>}
zR~%=a3loe5b-*xNdDEGFh4J2@Cet;VE^j*XTqqa}>VRRoyy?uLLX*KTU8Cvpywf{W
zXfzh4YcyS+w~R&JSeUMnI+_!_o#wgF;O%Ro4t|&}Z@LK*Tklw5(s(jyGF_wT@}@J-
zg=S+x9V**w<xOYy6($-B(>0ndPhH12^IVu<ET{v9*~**FJQv0r3)3}HM|JD%G#iD2
zu`peu>GG!I=O*v0ChDNtY~{_C*(fv`3+iBDw(`8??JMMs1$D46U7kB*(cpDWrfZ~*
z>ekyiUSc~w*V@|F**3qcb#don`mNsr!4)QXT@!UQNqAk}>@?4XW^Z2;b)Yv}dDEGF
zg^9+3I#`&kyxB6(g$c%jI#`&kyxB4vh4J2@Cet;VE^j*XTqqa|(>0ndZ#sT%G8U$5
zG+mx|dWQ;)#=>-srpr?Y?ZzT+EKJvEx;%HDU7^8Pn6A-ud31bTGe#!1O$6LD2_00M
zE>9g64&J^(v)475uF-UP)0yYOL}Ni6d^B5m)0yYO1Y<!R6|%RLH=TJdj5ijhYcyTn
zbmqBG@J?=`4xXAWZ#sE47EQ*2I+U2%G8=_PV?iA-%vPSaynThd*EN~0kvf_ryq)H`
z(BSQBq7E3Q%bTuA0_+_tOll;PCet-i2Q0H?o(s+1z9!Q(nl4XWah!QBOf(kMfz52?
zO=tEMCU}RMOxH*qSj?7rE{r!8)FJw2D{ngUTqqa|(=}2D470`0O~%4>ji$@<PVZ2m
z(O8(S(R6w0z-cV<#=>-srpt5JD50ZmELR$gt?3%6gGan2rk+V*Ql5@AnXZvKEWS)<
zo(s+1z9!Q(nl4XW$2hZ5m}o3a*J!%D>CAIsf@j`jx<=~2Vz$h4VZ6aGU8CvprZdll
zg2AAUD%fC{&KxQ<84K!QVYc#S%RCnvy+ci=Yorcw;Vth_A@A*Lq7E2lD{r>&%rk)5
zE;M*XO{Qx!U7kDN6fet`dUw^aB+idBB$FBly~%Wqrpr@@X~TOiG<#hWb#TLM<;|Aa
zC`>dKrfW1^o;s{8yywCMuWK@0BXv~T-cIve7;h|0*J!%D>F61SR4^8%YcyTnbo|_8
zET}`NnyozV^bQpoy+cjZL5u0~yk#u%Ue`n&Fw9n-y9Pg!-qG<5URN+(6LkPJUEXvJ
zxft!jM{~JB%6`Wi56KO_{t$nU{O|C-T#o*KC?6^K7Un;-ynV>Ex!f`8SnbMOt`6HL
z9&XMjJ9;d5J>%721C8(mgSL5hZa(aeP&<YWIwS`u4^OaYdziuNxrR?{#y;9Fn9>im
z@P;cq(nfZ4-tf+#e=XQI3=e7I-!Rx||3(6j>`1ThQ~#q556|~+Cic;OdQcPpz7IQ%
zH&*#Kgze}YJI-TP=5iyjpLja~MtJl%_KZVJ-q_(e*hjIECOW=3=8yny0lcGOM0iJ`
zCoJMUobhV-#I@Kr6c1@+NA0b^L%sNVH((!~PgvB%ZkEM6Tg8v!D7?1bmX*2O7#t`6
zC|+bokL%tT%v(S9jmAS7*-$$Jb~?@-iuX7iCp+@DkMTtBcI<QM-T8)Kes}Wughfqw
zcfd~b78UOaY)8B|ED7p(1p6o+(j;%!!%pL^Qg~DkqNCB^`T5v~W5h!?)WpAW7T!AG
zksZbPM7E=CJ0FWymg;XYzzB~XH=Pr#zh|*;93Ij{M?LJcjtxr3NiZfX;$6#ll8@0S
zGFLu+)Do<}v9P1_35y!xQTsmZH18(GI~vD@*VemoCFTemr?~XMi0tUG@~mLq3YLGO
zw-0ujcdLr?X^iFhYw-NM!Cg-W*-#@+YOk{Jwky2Tah&W3&(^VSrKu~@@g5kF9X+;x
zBdB8<cxCR#VSj%9zOnQDo5}u-AtN-xqV^rwX}vp?e`nx0*}44dUs;OtG8mB^J?{8a
z(7!q0rF=+}IN!>4QZL=GbJfdP#?IHVf_02#K;oo!2JEzsU8-KFuF1}&W6R2tj$Rm%
z9X;N1Q&7iB@XDCPVL#4O*-mt<FQeoB&v|&hj(*mWConYPq;@atw2r+>M-z^dolD1#
zm8E(q!ienXaX!R@Dt9OceiJra^)lJm`TlKY|0dvEYJ^3t8Ft#g1FBvo;yBs4{M)^<
z<lk}_ksUo=#K717ZN<j1*e^}$<vC;L`?r(*!?M9^ghlNyu+#n>RQ{cf<7DUZZ~w~D
zJb5LI$c`Q#KO^YhBj6o{{nEt0GhwHBYimpE4P2^x-fJ08>g9Rhx$6G@F~NGN1rhm8
zSk%ZjYWKoU^A1<M=ioTm(Rud#Qv0D&KCXfh+0o<CGlP1Ef|ss;(nRksjGdp4I`(f0
z8xj_^`(UU2tAl^!56x>+(UYCazv0Ti6)++@dd#d3`ZpH5u6jA&*!ljouz%BlL5;Ae
zoeMkd-&p0}bQ~u;mw$E2zpG(HcJyeo=V$P`#@pNM`I-Hj0Ssz{MeR~+el95gF2ZrL
zbNN?L{=FAQWJixPcLn1&2fQP(Um7;Oc8am{<5y(=X7X{uqIMGObo?eO|1QCCvUB-2
zMfvwW7?B-4hFkU5SH`~~R{gDK|7HV&8evg8)T+NJ%D>BSoa|iw%~t;P!HDeW@v{em
z@!JSqT7OByrq{L^J3oF~*}pk_oUo{Eg`JMy4CUY3ah&X2{&gt--VY<PqsMVug8pp>
zudDu!Fm}FwJJ`Ruz@SE0)CR*&`!`$p_bwbKJC}b&_%{N_Xq-2)9oY_gbI`wC;BCNu
zX~KK!`9a>f;2j1d!kdR)cwd0sA=sArw04ktKE24;`Fe-Jj{GJpYQj6+;_X(v?QG}L
zyGH4i>mXsicvf(oJp#PVM958ezW_TO=RU=|0Jfs{ImQ#cGlA#2ew<_Me7$pFM}89)
zHQ{}O#k)rFcCnpHZ@<#}A%GDcJ<dKesJ8>WvR1=kf8F%!`k>wo;3Xc)Z#R0vqU}86
ziQctk^u8Z>r~_Z`2G&bh)CiB-)fR8R(z_JLh1b4bZdH1(ff3o!W67wX-hS|&i~Z72
z-d;Nrb~?YCmEL8r5Z(^P6TSP&=-qTuQ11cOOIXwhkJ@dp)4W@i-sLzhytdw5O7FEW
zB0GAFJ}Rj9Ab4fYz+s=aduWh%2Y9LODZeY&j`Di~<B8rmAaT|6)+2*@J77oW6Bae{
zjoKF2X}z_BOY_G2aGdPuJX`O6=#}~9Iv9~1J)YPWoUgjElg^hW`F(hsXXn=+t-;Ce
z18hiG)E?XxoY#iKKeD5^d=Nd^(YEd1LFL~^U_^HG*z?L@KImF?DE3Pe{~j`SzJIG=
zM?BZCAz@K_0CqZlBb9&G;yBs4{2K}&iQj4%ksUow-WH7C8tkO=rHOyXZwtn69ot>U
zhJ;1!m~FxM)hYizg5zZ8@^7T_@1rmxJ9->%#cu<4y8JuRieEq5eGC}X2#eZbR{X{)
z|E|YzvUB-2R{8fa7?B-4t~xiE-%Z#lF~ed1|BH>CpWi!RM?9Y(BQ(OI)&)DA--7b*
z1{^0lmw%I$f7io^?C5dkH-q`zf}Jk^PBC`Ae_LTkJU8M&jj*Vl1Uv2DWaZzdaGdO1
z{>@PSQH_xuJ#JkW^lv+M9*zCd#MceR&i8K@?1<+xY)Dwt*27NwH%0mPSsW)jmw$7W
ze;<bt+0o;?&j<b6jh!z4CK)^5zx}Wy9^8KL8evfz4?FGO4CNmVmG!S%`S%Hc5gt8G
z$p`&Az{haNYZAX#8av;==V3?weSz%=i`sFp)Bep?{(TY0$<7tOKIPvH>;u`p<F!Hm
za)S*94tY)dn`!KP|7u}JJpavh;@=F|Y5(Rb|89Y8IsewczY#c2^Y~ij-@oq&`ZpB3
zbC{Dl@$Yl6)4Uyu_g2^m@81|tu9qFab6qbd89QHZ59=i?YNB_%#oG<uVK`1YzQT5{
zeDp)F*xjh~o^gCo?+Wm`u16;uJKw*R?B6DG4o&=fHSBa;`cz!L&UP;UHp9Q+I8Hh~
zrTlBh&O@+Y?uV@g@2S|9Ci!?f+ew@^!Oj)ugU5MzzK$)d17Y===y)D>TE{9CXH0p1
ze(mf2Ju1$0O(Z;eocrUTj&0y|#ktwo`TpI*{(al?t`z42?6iODRGhyP;@>0iPwM{D
z%D>yc8}x4{c=b9_;yfL8ns<ZZ{hs3OXFSQrScrAyV;`JFeto^ou%r4QENT=xYI|X)
zdHYp9w&FP1x$5d!m5<LTy-$5VsJ8{Yu6#UU?0o;Gv48(dPN9i^kHJp+w^_wy8{4`3
z%VCiw`S`5z?|R%|M_l~6p9$VE*p?>wI39MIcdO#P3&s+c4>6wPV+HVB`MBkZ;JSSk
z>m@8|qW6oi)4bbNK7PV>F1;g^-t|iF)$a-FT?5_|JVx^*dJpyld3Pzj_bT3{j3;{g
z%jmrpc)I@XV7-JzP4s@y;@z$E?qEBY-Ug-jCZ+e4hS$&U7Vzr)3h#d{4eH&mcz>aI
zk77L0yQhra*8xxK-OqXni<<DBY4ILZybrLQOYb!3mFo<x%?Xbly=Mo<+X3)OPI1`(
zf0wcI$J_Jl->=9BP5kSGovy#3hn8NKJ;Zh{|K_NC+^qaN=F*^lxx<VOj}%Yh>vv`a
zd50_BM-}g3j3@aR20YhzYXzRp$4J<b--Ja?^uE*L9SL5E^KQ0t>Ft4DxvqXe={?l&
z`t?@_Ue`Ld#^N2T^ggb5Z@DC>qrf`IhMMU3BJ6bD3JUKDwsYxNrSkSgrQ?Vzf_a+^
zUe~;F`{hC2$tr$(74M6%Lq7cble2;6%G=wFonNQ(STA8w6TO#OyfYN<AKA{OcZ15?
zMy2;ZT|vEzEdQiV{|P%C=ea7*e^$JoH+a5|BI_U<YNF$_7G8(K+s}3`9e1d_{g={l
znYkb4*Iyra>pVvDBsva^49<VuiuW1Cdm-b=c-v^j#n%BmJ>E94Uc#a#cAv6%iz;t_
zWjmMNdz9Y)R(hwO9=yJ72Ja}3(L9OXy>&sotCZg76z`iDPxS68qxV|iX}x<`FJVy=
zy&trA*C@Tuvz<%t9;NrgY)6>S{3ckZ`@l<eB29Qd3Oik=8^F5=M)W%1U+Bq>c%NiE
zUoUpL#^q~`onOy;U`OW@7B%5L4R)Hh_OQ}?`X9EV^X&Eg^Gffn03$qly#7>6FHSCE
zzck_f%_%|N;oxn65$Qbyi6T4VZD2gnI~UHn^sWS+&hH}Fd46LjHR0`poz^==>8*vW
z@Y;HZttwqVZi5lo(c_b^57u)J!0CD<jcllW9Cn&_w&KNqecrJK&(GUR)<HJZ1aFLm
z*8v04OYu8G;n_OsR+ZKzw*!pu=&|RbppMnxm9dD!{{J5`cD{dW*gxDh_ZneQdjNJ?
zZ@2Ofx6VCIFF&ZGW6UYub755}&i?~2!lTEJ@qr<tkk`NK08ZC)Y2xd5*-q-^HrTo9
z<$Po3>)6aXhFLn!g`L(>gbrD692=rzn$kh{G)2d|FAVC~T1Llgwi6vY%jo#?1s<NS
zV>jzK-qP_0*l8WBln&hbEt`+I&>^qOzM*t9FAVC~3-I-l4D_Uz+MNr6yz9W*g8fvd
zCo0}?j3;{ghPd-K6L>hy*Si{aUfo-IXIQ+ulwMpS%jzvcudEZlsr0_^Sa4oj3trJk
zI;H-egPo4^UhsPU;c2wuz1iUTI@YlcvY{r}pR@4xE4)(`o;}W2Lx<$;TS~`?m>h^g
z#?c1wuJahplkk4>@L=8!fVTxEls8;*{rC-IJjq+bk?y<=1s+cG^-hKz#f7k_3Gd++
zZvopf-o_|iTkl5bmArjh>HYf3VBV&HSGb5*^7a+j>AXz=ujK7a#e0dt^L0#P9b`jI
zurFE}#G9e;&Qf@`j?K^^dHasiG5=st$4u~UBSLP%dp9odTE}egw!nt+)}VOjFrMUX
z7$!;AJUJG4IL+5P5=Imk!lEX;V=Ufv;FY{JDPCLe4(OG<eOKu{^Zh}+b>I~);+4F;
z7Is>1zl!q&#ruoCppG%DgKVe?_I<F^c$*Ynv%<4=?12u+8@-oAc=Y)CKZ80N!0Q@s
zb+FUCn^oS<R=l?`p5$#i@bJ%X#7XUoF9h}OWW9t%P3%4oJI#AQ<?W4%*Vg;|s#4y*
z2Qb2;#|^muM-(!@JOW<YFHQ1xJ?u1ZE#?s!Z}>>IcMfeg89cxKcC!w$p(fa`v+#y0
zyz>;Etz#$_>yo$c1B~$K@jy**p4<!G4MfOIc*ny|>lhB+7TC~uJ74kM!+4Unl}EYr
zwgHP@oaXCY13QWXVNny_^{~^tv%xFlZMx#M_0~bJjJF>EjPU63z8ivhTL)g@B3{Yc
zRj|{%9V*T<6z|Cf&)2b@b&w4;!G5)c*RAj_R(Q6KW|cR3PnPiLagvFjUw<3H>l$zC
z5M`~S2;LT)PkFmU@gB!`lD7hG4xtqMCOTdLJe=n1ZGj!-jj*VR-H{gWX7EbhW-DG>
z?@X1q9|DZ<=yCH$f_a+;Ug08M$=l~(r}b`EaekZPJ;&hrI%cpAvY{r}Z?N!oD7?2T
zJX=SH%G-|sMtJmC`(jYXZ1B4Bb{Oomj$JBma~1D(j3;^92Rv8auEC33oaXC2z<LRb
zn&|xi>@@H2A*H;vDqdS}pUT_+D!uiqf_e{vSGb5*^7b0oY2G^UQe9D<&R4uY$LlDq
zBlikZe`G^Vuzv<SjW<@|btpVr$6A%QZ2%)YdJHo0^T*ra;C1Egz5fpK7Qowr^GU}-
z#rp#6$Ysgf2H?5!_MBP2_<6gH^%52}(fb$JX}v|2x62i;t@k#Sw;wCL^fxU;A=kG%
zz$;wDD|w^8S<<|#RGb$p-s26PuVXXoARB6eeT;>-M&aQt3eS$}!q%}><?T*j5FR~7
zoArUOV=H)FdHd}1K^^PB+k*2cZ_5<#35+Lsn~6!ymA7Mohtqt$b74n*6Bae{joQ%`
z?=JAlJh@!)+In}Xyxpbrz5?eEh2*URV8TUwlD8var1Q2{#d(F|{T9x_rmtfW>mVCy
zg8e`EzsB3I@ZPKNY#sYl-srPGgh!80{UfNO2fVJl4S}8JJ)rXTe#QGy#*@6&;%1C1
zZy)}9Q139<QQioPn&|xy>@;ry0hPS1RJ^v{+;ydO$=yotob5rqBfu+M#4CB54Li*{
z1-#@R)#<g0_uySY9V1x>*-#Vg=V7PuW+=Q5D?D4raOjZr<WB%bc=YJS%|)V+`l|!4
zD{p_s-~DLb+2C!#d8A{t;_YHQ$=ep-x$@QtJe=m&>2}sjSky#so5j0M<?VXKYwI1W
z^7d1uch-HuyzKz5a1pQM?PAzzz5OcApHRGi|5-3^J6Q+WP!sIG!cOCDQg~|>o~@%r
z<?SA&<KwvRK@^g=N5JdKTP^G~?`H6};5^FPrxfqCj3;^PKGvPL4;~uK+X~oGJrfo+
z(fdBwY2E|imGSl&#cS)Gqw;pI()-9ygLzvCUg08M$=fd2Y2I4g04D!P@8=Y6pTYC%
zZx!nx8)|~R!onM>@IJ5bY#rSyZ$DEyawdL$-qwKEmA9(~2je#!ye;sHbbLYa{vCGY
zvgB<vJ{RR0Z+|u8($_l{b`%%Fq9%HuhMkVzZ176n{!8)NdRM8u-KX?^4JQ+Y)M){{
z!bQB2w=cs^^LD5>_bc9u4W6%~nRSp2HNn2X!lTd6OC8**@N6CHRo-?e9e?><P)7@R
zU3pswJFTOr^7a+Q`$xu;yzK&>D{oIc5u9K4uwKH_dLM(G=H0CFwn_2Ydhbwr?^k;N
zdSX!TKJfM!$^h@DVW)YwgSP<|RHy%=c=s`$=$$j%t#`7q^YhyQJIWhjQIq^OTf7I9
z-ft>iTkkze@6VOqXLbhlc7xaTIfYNcPV243n?_Ps-&VX&GM?yNRYvbbW9RE#%X$e*
z>us`lhk|z)3@FZ96tAs!kJ9@KrFSnDfJ7nVay@t(JVx^*<MP9>(|SiL-XAF5Uo)QQ
zy{C-cdSmD7-Nkwdi<;#3H5Tt!#rq@0YwLYp>HVeBd)Lo{dUu0&o5yILgtr}bTJL1=
zHp7JC{A0!YJ;oEg8;*C^^I^u$*Lxf6s9p$*n(z*?c#BH!cExM!9rlsZx^Ab^d-uaZ
zy?20jrlAb*w!u#8T?JmM1Je6b#rp%s6TLJzT=Uf-#?IF}6n3PSu&9aNe?JuD-K_Nf
zO!3-!$0)rID80Yy46cWUgSXC5de2hNm%~o$-L81=SG<ofp6G2ZqxbI}!S&D-)=OB_
zMDJf=r+IfN-kplq*4v`=KB)8-e-+H{4Dj|F$^h@bb_L_S7rZU7p!`0lcrRx>(fe!}
zz1IN`r}_Ck$a)Ejn&`d8;;lQnG+#ZWcx}CNlwSIq5yGQK>*k=|+E=>gtApPP>MbbV
zM-}g7j3;^vz;o5}&A`)oTVO}^Ojy)J@8>MuDT;Tu;<femD80W@dLR2mQ13MGK4K^X
zyjR0c*VSzBw!nh&`?%tLknu$CXuKG7>3x;4^Yc3vcBGfEsEOX=E#7rX@9z|^t#`H3
z`;gN6;O#-Z1@Iz8eiPnhu+w_`!P^Wg()*<1y_fMs@4hm6k2iL{-UF<cu&4>|F&6J`
zrFWm=we@aPdLLGLPZ}N6dl0-m9;0~@-v2#0sCPejWqy82@gB!`qPP21?)-KF52yKh
zSHO<)OIXx|x6R@mi5peJaGc`&wBoh(Zc%z4QF?FuPEhYk@UA36Zo=CLJDuOL;2i@S
z;{A)_UCnr+m%cQ>RnHH7JE(Uk>_{(RQ4`(=V5fO!E4>F4udR2d()*~=+h=(F_0@3j
zZuA(<lkkqPcssx=`Td9DUB-B#cXJuNTg<%X=XV?HB`j*fyBT&`?>eRTpNiMkyHDx;
zwbDD}!C-#x0q=T48Q}fO13}(?@HWGO^80Van`1oDJMY!*{LTO#PV@D4!;bPxSky%C
zG>dn)(n~Kw$&Svm_2yQW)>rhmgk(pL-(tKHg{+^8;DxE*$cEYnVW;D~U+EpBcy}?L
z=sj3QZ=JF8^&URb_)S>UgqP-b&09CDG=9lvvUBMjq4YimBeJ8%T_{SecNlnkuwNS4
zQ0s)9<}HAC4E9rgk5IhdV?5Ej5_qohd!(`R^{!#Pghfqw53_jZD!ufbJ7nk5+o1IR
z7Di-8k2!Tgz3afc3j3vz4Ye0e3+nAwdS9V<FJ?T^JK`j_-Y)=8*K-~0$Zx`;CcHOU
zyz7+SV->Gm&(oCN#{ouo^tk)d;QDzicsF9dG~t~EJDuNt@FMhHevenYKVUr3yQ7TW
z-_HuJpC4hpghfqwABUah-KF%7P`tL@c}njdfDs-&W={<2-2>hYM958e_uzv#ns=|#
z`)b8|0pp3@zESS{_5e@kcQx!Nzl23ic)Km$;m4H5?<mD<>s_JrJ^?VoqsPQ6f_m42
zw~h$8F@5gGmk0IMftUQF@q3EmJ&W-~@8&Xk-vT_XcN^;^ENbK%wF@oYu}Uv}7Z%x(
zAGY4LO7HJrM0WJJYe`V=J>VUK{nE&W+C{L_`JJqIU#ob($9SUm*)n>6vpA^tAnPS8
zYQp<4>@@ET#apj<ZN0Za?=av{KK25P@aQq(?BIM=i}f2*;%MprM;kkTK0O?EfXba^
z`8Nc1+P}G~4#tJ}w*~&;(&PE}r1EdpB|-m&ftPeh6JP%^GsxSac=L*P8skYmMgz}v
z{n!XRU4LU)FJV!m*iqYH@ph|x6cn$WkDbsv9OqL${-E@}+3@=7g93Pu_L$6*=snNk
z?NfRuD&D<s3F?@_I>?5a=-2~0owrpAZ<4~Zb?jAn`=iovL02$uGr)_N{C*Q1&nyb^
zu2J!utaw`(Px96QJXhY<15f9zhxHN`HPO4y;@zNl-=uhLy$7LJ^0rUueUst!^R~kB
zPxPK`@orLaK3DPXUKrG|igl2U*6|4Jblx^AyeSIL)-mj(B^`fKI$H4eQHY<fV-0vo
zuQbsy8Frd?tKxmL;(h$p!Fg>X>mVCyl8@iOPUCG?c+(Z0t)mV)WZswt#|e)fou>wM
z+y>q;M958a<Y1?HcPQQ&iuaw2C-t`zc&_^U;weGByIC(`Q4_tNhn?o#1>RvePV>QA
z6tAs!veG+4={;*=aJ=mW@5LUYc@n+%O$gS@Ud200@t($bqPH;Gt#>i-^muE59VFxk
zi<;=|vUm?D-pdrPt#>x`N?e`-7~#?5wu^)Loi@63t-@jd8ukTa=U=yGz>fTzWBGRz
z>~ubAk1efV-X7v#2mF)yfW8Yx{QL6spntQ$>l#Nlvz^3w5$s%bHP+bqI*P1guBBrP
z?6i)d&>``AcZiM^O2_{x9Y<dj)X`T)M=jflj<scU+=Qal^|FC=v{^bn13Rr_q|(tI
zqGJto$b9g$(vjN}93TDQ?a!4O<&D~x9uJO>vEap})*F`#6z|_*2Oa+V=hIGc=j~!+
z=jUxU?5O?-i<<CWVDa`Ty<Lje9v}TGZ_g;b_q`#Qx4Gb@I*=y3KZTu+^BTq5t#}It
z&)3n-I>?5a;5Ary8-Pc8X<l2R@N6AhRNkIdI$l^2%v%w>xJBeQrq6u_c3MZj;(d?e
zeTMP;It89<yiGKAzTOS2m$0ab-X@E8lZqdGS1Z|(ep~NOrT4E&FMVImA+VSGL;c|0
zjBRPc`*zrAy<5R6b$XTJ{VL;$-Z`hb_0||WUvCHO$Zx`;CcOXoP>^@%ai#g?y|68(
zcc0SxH>J1ngF(IB;O#e*0p5o{5ab;RUeWu0#XE-aMDH-%?{MXJCGZeuU++lRkzT^0
zCVKlU-fpFLrQ)^ooBLR49+L0sBFy&x4eG4}uS@UYu+#bNQ+lseyl-bb(R)uBz2Epz
zQ133*OIXxI@7H0cd3Pwi*C}3G?+B&$Ie-x!J^t{?px)hO^j;4;&AVIa{ix#I&3K}B
zWt}^}1!L#ucMa?)zl24Ne52N2@s1r{s^>L|*Vfyh^!^=Sgh!8l)VUtN>+0P3oen##
zcQSaTo^MdRH!+^*Z9d(t_phsi`JDng(o0y>$Tw<F!%p+AQF?DwytdwHO7A}aMtJnd
z<8u>Q?+ozv6A?GEq4v;+gS;D*-cKvu*D{{yeYT9=4+2k*--ECty@W+gc;9F7?pJ!(
zD_&dgJf-(}fDs-&==+tl-rCo=^_~Pf9p{5e@8=co62=p~w*k*JU;SioQ152gkzT^0
zCVKCLo#vf!e5szlpm=S)E0o?Bl-?5t1@&$PZ@-}o@csbUns+XErJnyw@eXA?(L3+8
zZoM5iN9VU2cBGfEsEOWr7Vjpdw_owvde<tw|5SQge-hMN1n(V&GQe94JFR!C()(q_
zdl}=2-nudFb=cSM4(ctyj`R{1HPQPO*lFIOCzSI0RmE%Ty-n%;m(u(8`-6HXgV&|^
zKRbfFBf%^A{kr0P3*(92{blri8F)Is2U#y+X}z~tyxmIg9g5f1yG`jmsPsO5Z%}XT
z8E(C+V5j5Ur}TbH@&1bOMDJ$c4Koq~I?gh7{`F`(>?ps4MNRU12JDWY9lU>s()%67
zYwLYP>HW9T`_!>Py*t3$Px#z~_Y<(wyt|d&?<w9V7*F)})Vs&;cw^`5?SmcZB`j*f
zo40t!zOq!$TNSUZ_gSU)KT7YKMZwoStH8U-PzHEUfSuMm8N5=@|EqYfVLZ{>aHd;t
z|H9zw+R3mZy@W+g^lpTm=3S%o-l=$Py@y|4T2H>H^gi=QFuzm4>w10kVc2Qj4d5mJ
z=yloMiuXyz6TS1w=snrk`T6Z;y@W+g^uF5S?N@s5QM|U^(MoR)*EGVT#|ys<>Meq|
zn+UlH?*`auy_><?3>(sWpW=On@kH;QGJ4N5cD~;Ite3E;3GbUM-u+7N&lRt&w^`{u
zMCm>2dqKSiz}sgi1HAWb3F<uv-Ue8Z-d`%-(-=?m_KbDc^J3uX`MD2vR4;@@P4sqI
zykkd{#xMP*1liGfw%(c0EBDQ6l-|jBKUJ@<R)LrDCXMNHjcg}6wwBTHFy4RHI__Z|
z4_i7Ogq^OJ$x6qgAv!u#-UcZhue&5T5A6i+S`mR>;<t5Xa6Xs;Udh{T#d|vAiQai<
zx$|}r@U-4;*irlmi<<CGw|M)M-p3WMowq)vm%h81@aVCn5Y$@)?;0ZHCcIN%r{lav
z>HVGJy`AwyFa0RqPys_Pc)OZ{dWXV}^b!^|vD*nd&AV0UeNyq-de<qvgO%Rjbp`bf
z2QU8ljp=h&z)th-05ADR<8q(keT4Bu@02onpEuVde;%62dI^h~=sjRv-*zdzPbpqo
z?<O@a4^?`X;C*L3F6V%EvY`y{UJg60cQ1HH!-Diat$6>@9n9N0)<HJZM91G?r}1iE
zRf^xU3eVQD4LXJahj@o59a~=?oL@G8mnl77`TsYKoge3o?BCxk|89q!_HU^2??8xu
zJ5^mBsr<XqykG0z|GN#mq(hqcH^F+pcDUmGhvHq$cv4qefae-Vzr8p(Pi|+ughfsA
z@oU&=y(7UZasH>`wezu0)fIjBI^ogd-iw0y*a6-{iIAJ<y&HC#cdXL;Z^gUF;Q4vm
z#X87_n&{}T@Cpj=MTKYUIH+_SrF5)9T=e+Z4c?;-rS~j4R>Dr}n5=kf@Y<OCqxoU9
z!Si+O2OjMw8)~9sq=h#{;ngZUTgNa=&Le<B<Kt+h<6{ehIu3x>^}hW$*l8Uzz$<ld
znBrZ@cv62uU+1pBhZY3uZv^Z}FJVy=y$`@n^UhVgLlm#AcMSB(dgB#J?~gl!dPjrT
zRewK(o#yRUaXw1%&NFy^-o~&Fve7!`T6jf;_X>q)>zJ%`3>$3XLb2&H@$=`61}n}|
ze=Dr`^(o$C74Hax=j)ivI><)r7;fRMQh37^o~>i1(s7K^@e%WR0bj=y@JjB9S9Dx!
zeO_RV;(ev!J>B~J!8F!EHq-?B6bo;i!h4m%vvqVpM;&lz9Le8X5$0elTJ?M|vy6^I
zV5jS9gW?^jc>l+|AMfX5HtQf8YNF$7u+w<`3U8Fcn=&ux-(29it}`vL(|DVJC*ypy
z!h5<kIDWg?KeC}F{{0zt8gHxe?^K0n$9Xm4Ec4ZHRWG?Q!F5Ryya=h^q+T|@Hn@)1
z4&KqQqP(51c>fMN%A3qrn}9deM=R-=V(k2UY+=2GMNRa!SiE~x{KhC=Tkl5b9RnQl
zZwDMAJbL_aQZR4Zz&jfIr3vpm*y%VQP`qa<-fuCU=-pFB?_tKy*Snwf5*9V#9c1y=
zo>;1vaf<hfj-ZYMz;o5#LfB~?!xdhG!aLgF`To^5nCl1GX#a*-cy+)-h`l&BDm*(M
z_o(_Cq3Ul=OR)Zif)|%eze)Y=dsDFf#ws1-74OB2C;6BRJXiho0S{&2>z&4W35!~-
z>2fP9-pPu$S@GI>_du^)FJGnfZXX-W+f2(p(Yp<HI&U*noX=LgZ3fTRF_(3a4K>m6
zE(>qA!h3_lvvnL;Q+ge6qSDd*<)DrZ@E&R?y=T!e-`M&7b+dmhmVfVtoz^>7`FBo;
zf3+Vk#rf6Bzwh4|^sfkB%7--Z?+&(;dRYy-p<;wy;y2OQ`8w9IjwzOoCfI2m9jac=
z5799~=@_YWyz_HG9UH()^SCt8aS7Xrj?HCsJi6Y)^L1=v9n&oxzk;3CQB*oE4AC(b
zI)=eHns-l9I(~mvP{%#sb=AwG#?JR|C;NA??H}y4f2&lzyd}iH$;!V`%D>NB_st#w
zud7}@Y3zLe_OpMpEdM?ZJMG^Z<=>?t{>^}YlwXS9$;!XwV}kKJ0Nznj1n8v>j)R@%
zU8nN)R>gY-<4L^?&%5jX+pi7Q%V^lawH#qllkxEl*lFH=#rt-}YtJtoDj%bj-mA_G
z>Ky}K*XyXo#?H@23;Q?M@~;ba+P}>zAMXnBuc-VxMfvy48A1Q1f%jMw67N~^@uacy
z{hQ1F&9nS_0(RQJt;)Z)5dT&w|4vo@9bx8O|8+nIcwOV|#an~<?PmWvEdTxmJMG_g
z<zHurf9sTgrz!tFfk~FuiSjwEB6x8N*>4iRRmRSb-&*!>k>%e?*lGWEDF3=b{Oec#
z)hYkJf%m<%f9uQm_hn<}`?s0>>$d#61$NrMUCO`3A^vSv{++J;JIjjSR`9yU$7xpl
zcCmjwmVYN(@!PHZdryde+m(N>QU2YsDHy-q;C0pC=Zu{nzrE~V(em%pu+#C|tNdFY
z;@>X#C-doZNGQ!$^!Vr0pnv<piz(G_GOyhXJI%Wvyu)Bc^YaSD`z+(hd^)nxJ)cf7
zcD~**u%r2uu&4=di^Y3T@xD*-+VkmtrT3po@1Ms8*Vzr=Z8nqv-jBjg>m7>M^`iF!
zigyp=iQYwJ^o})lzTP71B`j*9cZ|h5Qt^IB@!EQ8KT*o>8G}pteNBB(Zy$Ka8cOe3
z=9jzA2<jaRUdjjMca`ED$#|mowlaDb0S{sK^=@XpghfsCc38XxrS~I>*Va2y>8)3K
zX};6*)mHGHYbd>E(c1+(o!==+@5dDHos1`Xb4~7g9%Af#y+dI~@gpp1qW4gXcZSmY
zam8!vEkLi--<eA9%5A~%I~=@2JVx^*dapEgzJH_HKl=T3YU1CrZNYIqSH<O%A^uHK
z{*6`sU5)pTbw0*`*ERnwHFmy#4eZ}K%fBmNr}NgK{QGo>f3uZ;XDR=F#GiYW>u+<J
z_-!_JzJF8Lzx9@Xcfd~j*RA~fT!?=i%D-{Szi;64Gdg}VnAb}ho+Q6tHg>*$v)OKg
z<=-u^)BY8ee>aEtS5*GJPWd<F+@ODR!7DzIkN*FSo$uc~_HU!*-@$W&{`D#U{wu`4
zRm#5x<==zW`fpJg|L!$*zJJ~9U%%zw-LTW~Tc!N_Qiy-+lz(~U-&yN|<F^Rjqb0d2
zey15b-@jGt-))wEC&Nzrw?_H*l@R~>m4A)Ozx!?q`nRTxe?K;MzJD9ozfG2ZKZKq3
zZ=Le*>mmMaR{k|9|Gtg;eR_QKgIDG<U4LIQcD{eNv43}1{(TvC+P@9Tzi)*2w_W*H
zQ2sslnxKDol=1H=W9R#~nf=>r`S(ZIY5)3_f8P%AZx{TN_1}2q-<NI;`nMIl?{?JR
zIk3~bn-uRB#rt{2lk4Tkg8O>;#Fso?U+);$(e;wBs7VeVgPrEx3|_eo{y_2C*USAX
z9}|_{?Zbn58^C+0q4b_*zWTng^ZjdP|9)io_Z`@2|F)~R{BMYV2jL%1_10I-%D*oi
z7xb?MysrBjpJzLX^E}uMRXQYoZ!~tkj&9gdobR-BydHL1#|{<e?IAjb-B4PWOj0^F
ze>SM22wqp5ziRA!|N7X!pIZLi3OnuJZWZTyLi`&I|D^6;ul#$XdA;So?p_7n`6_-=
z2akR&$h%kZ-lupAj3@cn2Rv6kRsaw4m9O^z>m@8|lDDG8yI<ww=Ze>^`(~Aovz6Y5
zv0u-V2f^#g$Nk36_pf%msh3|`{@n{ZosWYmE)RtGHx1`WJ|-*wYVgAn+P|UT9b-b`
zJxe~;yfe5ysKwupQ$5q`lwT>{=V3>9l8*xLT=_WB*!g-}STA8wlYE?D@eT#A%tMbT
zUOON2l-@Tey+h{(^-cq?>%PSetwFsbmEPYd-WtXez4OZGJpp*S{<>K&VQIa`TD)~i
z?{5{at#^ge`$nbrtM3l#ErM6)SK?fNovy2b;(bE#Ze%>syP=HUJKq)5dmHN|EUouP
zu+zL#6z^WeYwKMLy;27)O7C}YQ$g4B9pIH3CSLjfCS&K<-)8pjkCuP8!A|=(Th+n7
z5dSu+e4L~FTQei*-&XLF4r$_F9(I~{uHt=4@m|Atl8+t0bB(uOUl^SK9$~$NMNR79
zA=qi&4wa9m6|bF-Ezmn0I5Z!etMq=z@cQ%p9`GLRF`6gQ`+keJsPz6t@s6@|Jj*)B
zhMMR&(ZcIfcz;uPwvHVtZ|5l;KWq=??RoIJ=8gHV)A3uS;`evO`z^+kybYV+&fAg3
z&acyvu%mgGu&9aN!(gX**D2l?U`uv%o~?JU%G(sB_nY&Bdh0CzByYFFPV@GwI3HBJ
zZ!vhjjt162Hq=DNg%;i>h4&wYXX|)g<!!3c@hyCALeB@y;H@*1-m~bK1v{-{v*JAj
z&Pn{f!g!LmxmH|6$8-4Hte)=|v0lQWCU$>;o#x%D@>UBYvUBBa*xJ(d{CuT%OkGfK
z4|rYc*t<>(^6pT24^zCO7*F)BEu(in@U-3yte3E;ahH3y#k))C9in*c{Ekt2<$G}m
z^S)mP>$D%d`#eVTB)pxl({bJl-bFB>`RXXe`(wrvy=(A!EZ2NG$k_SyydHLxC&Hp8
zye~c)<ehO+Y5g)x@!EP@l-_A7zh|Bj)VmS9MMD|j-7z}II~TkSupqt1Dc(~UPxKDQ
z_0FaDJ;2lX9Su9uOIXxI@8Z!x-Ze_^35wU&I|q8@`Y~PU{YP`Kp2vW9n8#?Ig!gZ-
z)A`+?cweP>Z!~y*-kMnl*-#U_Pgr=HfJb^Mey>(|wvKM-ApgkjVx^;xzh6b}cea36
z<{sje|1UFkzJF8LzfqQdOJJw<ZdU%C9O7S}it}5Pf6tvCjPnfeQa+@Ke^0TU)XO~B
zx$5P;#?IH#%{orCbX*BLtz)aoTV05bwMxfKrQ^B_f;x(2bo8;E=vZAw$FauF*RhUu
zyw=ijH0-pF9ZJU;Av*e@V+4Xs^>T^Qap;_&jt$^lFUdg9^trWf3-ay;Zwup%RlEmb
zhw)o_U53y3x$-v3*!g-}U`KUNSk#2~M2mOisM5UlI>l>`kF6?ivy|Qo9}CWF)4(fS
z#4GjpX4vUCj|DIJNAYV^ywB_o&Q~*72iZ^)?5AL-@d^sBpzv%RJ5}B;RXPs+dr-%0
z@UAnI0p9mN7v!A`-WFJpj){u*AnbJB_5sh8x91N8^&VioghfsC9)O+J+o$sOdc|w&
z-KX+)nbP~>2ZMSKf>*eRSMv5R*lFH1D$Z|Eytf!Uzy5NsH}yw0)CBvB7T!9A_a=pB
z>o}<L_Ex3i;y(p-91h-X9;0~@-f!#+>e!(2cCO-`!gw;j+ygvU-bMgVUsrdrUc#a#
zyu&Tt-70TW6|b##_$N!()we0V@9zuh-3?yhB3{Yc)v(if+ppq0P4S*$@cg{(VI5>c
zO|Vb0@D3=v3lyHMV+?f2JUK_{_}m|ZI`)CrHQt87PU|?R@^+Epy@By0Z+-YaR9D`v
z|3ffut6_(sn<Ff0qW2@P)4Y>UF3poO6|b$gMdj`7O79cj3+i19Ug08M$=hSF)4Vgl
zOa9UPa;f6|u)*{5wvKg>4K>03kcBr};a#TiY#p;z-rk{f{OFmWjt$`5U?>B;r@&6@
zm<!$(Sdfl6igz>PN#2?#yYsgC>0sWbz>eZVSky%CD%fe>4JvQ%RJ^v{Zk4xpD!upP
zeFvJyW&Jk;yuwAilDB(dr+GK2IKNx*zQ^GCd7H^P$cCC=FShVDE4+CM&(^V0<!!Fg
zam3R>9dp3z8gDEAFQ{Xy%3HhQeGzv0`nDf<uJQJ-{lUCF&w2?<>-`7pbo>sgye&|?
zw%+wBZ|_oipSdomH}{58Y>8L$_7v<i@6geu@z$kyKV|Uzyww7a>W^%wahJQn!W*ve
zu26Wkj!i0W?^ZhcO#J-%8wy@m-v0JfP{&B{w!kkMZ%Y*KGRBkfwh?$kNdPy|u>^Sf
z`nHMn5*9VFyWHZP3*KQkPQ3IR$7Dxwvh{9Pd27{ruMOsHGkApyFn-=vz)t6_TgADk
zct;yNKW|%D2iZ^)?2#5;QQ=*w@N6BAsJzWnI-dD+P{%g#y7IOFc3MXtcw68X#qVmx
z`y}H@-e$kiowq0c6wKQ^*irlmi<;<t40f7#tIAuS;<fcYtMb;S^xicnsCN-~g^PG)
zywQ8Sns<ka^9L30LWAe$t($d_4K=}TxA1l;ybmcnTSx7UrFF@CrDNzHf;x)eb>;2a
zCxbe6tGumJyfus`c{}_~?!5hHZ!mAeVMlo*ENa~4{s}uBzmfPpV;OHBff3oc#@k5f
z9gbsESM5q~8}{kz+eq*V7Y_M(dl&w%dB=j6cnI%fiWks?=jUxS>mVCyf=!$nub}YO
zC_FoF4JvOPO2-HH26c=9uPbkV|9y~mGI(3y3+cE)@h)dP$=g=ox#r3D08i_^hxHN`
zHSThYE#5wrw;L6&t#_KrTc^_d)w_avcY;^Ah*!qjt+3N^UZdjtX~lc7!SnOBi*=9<
zHNn2X!ds{CKCAF-9dlLQ7API9e+lZ?4PIB?9(p#YV}r`uO^Ww2#*@7Dw7Bzj3Gj5@
z`d~-(Ojy)J??o2xZk4y26|b$gsPeW@>FxhnQ17ai5*P7G-ZsKc=WV}=^G3xx&EWZY
zTMazYK{nJx#}o_ifWrH4g=gznt@5@=>A3npP{-O9cix`;TTsVAmA5Y`-ldEud8<3e
zowqB1r}NeTJJL&7)I{$>i+3`<M_%U1+Z3;@ccaQ%m(pAR)1cmF@Cq04O5R=rJDs-~
z;3fZPe)*c>{rOLVIwrFYvY{r}KZBjdo2~G^uJCLfn^oQ}S336pHK=0>cwOVI9d?>`
zE_hqu7wNb|@&1nSByW!Z&oxi}){INPPWQ52!lEX6e+@g$yFumcTZ-4#y90WM1Bd*(
zLh1e2D}s9WgIBnSSMv4`*lFHPD$d_gyk9VQzK&;E2iZ^)?3*mS%?fXe!n1YkfeyJ}
z(yer~JrUILJa}Dsdw5S!$5xfMA1L0pF`ndY&AINpT>`vA)b)Hl?5Lgzi<;=YXit#$
zpvv2i6tAuKd8K!;()*`Z1@&$OZ;!`lo`iP|>~!9S;(f{nm{1-3Sn)p2c%paMd2YQ;
z#?H_0NZ65H!lEX;ud{e3gIDI4?TXjdJM2@X{4P;?zX1`5v;R7;4!kFLjOIz|^itSq
zy)(c|{*m6FD&8+Mp6H!iM(+zaPv>_U>m@8|qW3x2Y2MjN@6Qykt#^#lyHx32^QEBP
znc$_oNfW(i!A|pbDBk-O?=_4kdRLaw`#^tC?;6%iSk$=7{Tz0hx2Sk`!ielB?zY|*
zrT0Bb?}rZy>RkuktwhL8cu$9&=3NC|yoKcD_d&(`KE@NhGpD%g`QAf=dgsE9{3a}F
z+~w|uo#x%D^gaY5vUBO3qxAMDy<dJPsJCN^`}eHRgPrEx0bUuuk1F1q8Bg?X2A=CW
z^ZQ=~^=^Y5`At~VxXV2bJI#Ag>6PD&bm{F;dY37^cf2+DzTZ9ItuvI~v($4l>@@FC
zd`?5=jmO~}`A59BGM?z&4?LIN?U#AH{(SX3?C5;LqQ+fr8|*aiNX7d*7?GVz?`oyD
zSLuEDs9=6`Q{CTh`)=52-m&0q0T<0zPb%K~8Bg@~1J9-RPuQvFt2<yveiIfo?s8AU
zPV;svz55ieJ$^STy+x(>ncISTw}96*U#)?i=Iv9wPbuCf8Bg@?E2H-;W9R4h0P7_z
zt@jLzca7qe-(xu(C)j$oD80*--Y>#fUylxgcbB0I@SY7jt#^aU?_ZSOPcxqA-Fdz{
zzrQi_ny+^^?8tAzqQ+hBVQZe;t@O(8KG1o#-knPCl}hg~J{Huw7rdK2M)M@ROJJw<
z?gy{T&;L+*?`AyFyZ+5?y~h|kUvEF`$Zx`;CcH;kymhCS=8b<UUR&=zrS~eO_n4D|
zdN+Z$$4~}%zcnhTw*X$5pZ~3R4`V#hJ93&^@7sZ=$L|=}kzT^0CVDTkcsrEd9P6O-
zY`wH7mi6-rrT5gY1@$(7cO?;W6W%+&8q`|^?-<z7d^Je%j$k~|dk64b^VI_2X}w!v
z2PhAVsD*dF#k)c2Jyh}9dPgX|S1Y|k4X?kR+z#H2M958eZ~ID6?<SSsBNT59<B8sm
z>2AH#fT#8Lz>f417B%6WV)5=)dgXg6={#F+gVOt6rFX}X!ThcO?|P5XJPGd=usecw
z@dbH5cxC*`_Y)HDos1`Xhh5;-d$h6h$L~nk(fNc$O?Zb`ymhZBjo)KcoNc|+l-~C#
zy}x*6P;VW0R~yOzZx8IW-U4_<@9~QFZpIV6o66`t-q`tix3FHqq9%Hev3R?c-Vut|
z);mw>?NfT+_PU_nZQymyS1*hU>g@yX82ClwSH9<o@^ca6iQa|_-TD0@@N_*-h8>+x
zSky%C=PllTrB}W$h|aV1u26d4uk=noEvR=2cvpFh=1F+}d}>hdW~EoYcZPW1#CW3j
zo-%rG0G`&ni}ex~HQ~M9;@z$E*0Bzk-nB~a2bA9T&I+!dcY}AM$7r5}_b}M$dfpFS
zxgNb%@%AvD=<S=~&hL8j{oZ~(uZA7@O<2@~cOC3B??`;V;4mDgx{~ixaOu5G>HVP6
zd+3Cq-nHP};4zvf;k|KukasM2MX&r_KJgxe9rEUXPH^l+ZoQ`(J6~@z?C5;Lq9(kf
zEZ(_Ful&8ZOYb(Nccs#M`#XYqTmBz=Ujtu7ajw7TBi{i61dSN!NencE5R(uPl-dxI
zL%@hpqD90ekOWU4LJUD-r5Y41Dr!Ki!J?v~21N~u7F#gUQi~RQ6Qz|ZwrNWXD7})3
zy{V=3|GYahd)^)PghXh2@BhdA&g|#A&oj@wGqba^yJx|hA}GzNY>tibu;ck$4PN4*
zd{*x<)A~k<r~FI*E9`Xsee)`l*V0=f^%52ZrS}ckao#$ncbwGWq<1gVyPWC0@*2C|
zdhn(SN*izIY&-7?#;e{BCEg;5r}S<Jp?4whc>Uch^%52ZrFXu@yO!~)_Y9r%9)Vs}
z?r&pyuf|D*%Aa~pW-EA=Pl;D8UncA<e{7TK`=*w@OJK+Sv5}R7T*>Q{KI4I4|8E6L
z-#a*8@btBTmvpG0(pL*R&byiMs`rYB_a_oh`J)|pPUY`xVQ1;xC-o8*1?7)3HQuev
zAL>03C%p;K8xI_+AGb5TZ%no8-4EXWCZm`ry|2NJ>)pxpPG$LAD)1~FN2Lz3p`dhJ
zt>Nuvco#D~{XCe?{B{S^@y|JS9ml}yG%orC?6{6SEdSK={FHx3C7$wI{B&o(6$v{_
zFa0k#9Zy&kl-@#(cR%A*&xJerEuZ=Adra?VWp=%(TKbgVK7}3Edz9sK3Crh3foJK+
zkvhnRg3__7%#L@A;i>0sopj7(I#x0rk0jXJzlq?ba;k#T@eu5|4ln*!n0Tl>tLG<a
z{Tl+$(ormRkPQW;V}gbk%kb25eNH;6S^10b2t2~f$Nfqd=Bizr3Eos9ltJnEt<SC_
zp7E;Zxrp}yiKogR{V%;!yKyt{z-#GUCG`>(1*P{p8gC+aRr{=-&vDYbg6WN6dWVd&
zm%p{(#m@>#?@MFt<t3f*s^>C@H%8(qz57Gxy#jb#?-8k&uqY_Kmub8c8Sk~S{5k1e
z54|d1?v!?>f3@#fcY{}HBwn?Af%ZM?V={eoZ<T^d-#G1i)<vuwsQZ#m>D!F-sdoG>
zmc9?C*vp^yQs;WqA?;K?C&13BT$Kqst6ZhPj?zQ-q9`aGvth^UWeLk?HO}v(qmAjf
zo9P%=WY>`%LPxr^Q#x`(=y>B|d;KVqI%tfV>v#=zTt@}dp~gF%bnJnS1OQPxw2JBY
z$8YTQqXfJg1*MJmaoBO*I`9@tJT)#wyq`%trMEkT-iw8u<u@<D=y<}Sp!_yP<K4;h
zs__FSy@#3K?qPawyU^~pSnyIkQbF<F0z0mE593wWdBl780=wT5r4F*8pzsdDj^phI
z9vx5qP}dbsI*jiJ{dO<Y@tdV~zome8sL3cMs-E8jJI;HU@v8nV@$Qj$%5S;AbE<EN
z!p`zrk<?3A6qMcsjrS<aKh+;{(wo5aHZr|imfQ7~fOo5)wDDdEJFeG@{}+U*na`@7
zB;Kbbp3)n6nX}$68|>|PJnZOr!lIz`{=LD@TLRuV?C15(NpB|8yPD}e?`FH+MDT7T
zLKzhAp6}Xu>Hid!-uomT@eY@GN^e^Tz25~MKX2`pdI^hy;=NJh-OBW?VZ3_3xRB{p
zc7$2>nqBXn5PHL4$NjsL>3x9lUMcaE-ula({rmh5yWSPBqx>Q)3QF%Yu;aY(X+i%s
zF<xD78Pj{ev?I(vG}`s90`EqXQA`x?O4xDU6!0ql{($lRTH-0anKPXAW(hm1{!WA)
z=_M=*ig&ceTgUW1!gzJP^-S+truVUxcD?!Fb<*pH9oM^p>3xjxJ}B{&-h(0Ze)>JT
ze~(JNgvIrK0z1yThw0tOcy+yvOs^_`l!qC&+w~p`q4&KNcHaF=@6(JoMdB&F8%mu0
zy9{`|{%(dH`IoRLP}(TeYrHw5g5~)c#;faXW_rIb?Ff_l9^kdEE4G4nBN54<c!$D{
z=W{-IRe64n@lxNC@RZ(}S2*ka34poY3fPfe!lIyfTd}}-*D}2=j91s&#`HcY?Fe%)
zPOw~WHF!6gjAEjAx50?>Ze)62V!TljPw9=j(pm2u;Bmc)up_;MMM3dmc+JLpl<9qi
z@#=c_GQFx@Bh1-9wd+j*Z;Qz&CW_YuJFeG@|1(zpeU<TEF7cG!J-~}|z<Xw=UGILW
zm#`=(-lt&4c}u`ccy#{V&UkgbN0{Dq(vC2%+-=u;IE3E6|J=@7!SuE=-Xe*o^sfJw
zv)+xs<Nn<YJMu4KQBZm}XuMmQ-ZvPpt~c_*V1M!<rgz^iyWXwfb@K0W*ztVc$@Kn|
z@xCkZl-`P&&U({?opnB{gIy$a5*7uecZ9|pKRW2&U5r=P>tlM=`I0byKhUms8F)9E
zjAEjAZ-*V%n*v@{o`24G_ewma*LRh3{Y@8kmfm#OkzT^0pm<X?-a4lD7mQceJD%xX
zFYO3(mbh<Vwa+==-E1<7iQ?Tq(|(<@g6ZvGyu}hv>Fo@mw-$K3JRg>N35$Z_U8wQy
zVS4v4UR`f7)B7;fd&U5}e~*IK>H27Mf4hJ8gO~h4?Z*3zH&)^)y>YXg{p$xF*P94C
z!XqpSN^hRVdzk6{fbr^j15B^#hY{wFqwRWAz*}uHiizU=HtcwLJ_g?LFd@AkG2Sf_
zPw8z8p*Kv}S><`X)Js?t6t7F;&B+MX-%iG>>uq3qAC-25x#Kyz-i_d0W-^M2;=LMn
zTyH*jGhsq{|G;=(l6Xq5?`miN{sWbU`!^kS<X^&~pm_fVJI-6j^!|zQ>Ux`?Hy${Y
zz70(8t%-KMIp8I~si3a+>!qF2Q5{0ZIl|8JTfNkANYil^?6{5<OvfiZ=-ABsruyxa
zH~TNOkH0j4w^50}T;<>Ou;aXIncx1K@qQrjl-{`6&VF+XJ4<gO?8t9~MM3fYbGn^(
zC)3--cy+(+WO^T$c7!=!d{^3PcT>Q-%48H1#rxN6JMSK*_bB5nlXyyRO9;Jp0FRf`
z?NTpcQBb_MYP{a_g7xx$7_Y8(AJe;ljkm8HV)yS(@S<tAg5o_BcHF=5;8o|<FBtF5
z5>M$({I;`ypNY5YO@$r#m#`=(-lt&4c`KOSe=uHM?@^}rDQQQTe;RDpn+e_`2fa&R
z$9e0(n~USAp3@)k5*97)lXyz+vQlTgk;2X@&nsa^$E!c}ReHS|?^dSQ!+3SQu}#5#
zqPh+x%;)>t^)`ZcylQ-~U-4c5JFa&p(;LosH%dIEch?+ey>Iuk`*#oQ%&Y?z1;zU&
z>^QGCGgzLZ7_Y831$tGx+syp?%GvgIcOQ6j1f@Au(qDuf=Zyz1rH}j@%XkX}p5?c=
zxk3loP*6H1X?TeYuRp`nb&O|zQ`hl?nRkWVZwcVtW-^M2;(evWo_{GU{{}MN@e)t@
ztsQu=4tN>BLv^t9?vr{6i-O`!(|B_jZ#?7G^%gU~ZDxM!c*5?t{os|9Ca>F^8pb=Y
z<9^F$`Ftkhohk4v9fze3vZ0`KlxTQG4DT$4r|YPIjyT{@d3m1c*mQ<n$5HTRn2chg
zbUZ5Ttn{Uni*l8yrSAu@<9bV2`p)SgeRV9KUtsC`@C|$V(!pEgkiHISr^-t`?3~I=
zsj#zjtdKf<nvSbs$92qR<t4cX9V?+DLFTg>_aWa+7URIyd3qIi-*(XPi|uyaYVaz&
z;f!~J#8Y}_Rygau26()FRKSkf4Z@<J%GFgG?+T_jmGSE3Y6J7zi_CAwzHj$iHF!T3
zl;+eem;WN|EFG23I;w@8<+lphk&aQCjsWbq-_|l6qkGV?mHADLn^E38GRWSpRf9KC
zrk!R=M;h!n??%R($#~aFJf(MK2)#cVXm8inO1*?dLHX?!*m2&ijCTy<)%~`c>D?M8
z@Cfst1MGU&gO|#m3QF&tu;aWt8Sgm8dsN~ny<0=*O%QgLf7_&9!lIz`#%sKL81Dqe
ztLxp*^uEmWUMlk0s+YUK>*U`L;_Q0&Gv0}ew?N`4z57GxtpXmemq(;t!s2=>HQu9)
z_nVAY*L#fVRpYUye{pdDUQ2H`c<Fjo1?AuMu;c#qW(C`!JjP4kEhaprH+7zK{k=%o
zS^mv|9o1jLqM-bHfySE%UUl9oV7$8C_;tZ{_lIG@@*ID!UGGHj;?{u`l-`%_vFl9-
zuMbvqzAR+C(GpMTZ3JGdg%;FtCGfa^*TatV5*7ue_i~N5i0QqU@#=chnO-&iOqefi
zu<P9jUMK&KgdO+qZ06tTjCYg7Q+oFR&q?nSkJ|Ni!jAM376qmEQP^?bI;QtB#;fbi
zXL@%q|4w?`uJ<5#o!YBykJ))wfS1xo{w-m==Sw`L*SOYM?-<~5|Hi_O@Cb{7(tDo9
zyNc=k7UR|R&SrXFV|xE|w_R^Mc%A&a0(Lx~*E9dlV!Zn#p3<8iLhlG+XVu?gsh6<0
z-eiq;E7N-o<JI-nF}>=(2Ib+oqFh<+)yxoj*F9p_yOZfHW4vccJf(MK2)%=W$Njrj
z>Lo0$cYwybkLfLEyt>|1Oz%@3QC>)IWTD-^>%qHCP}+E(n_|~{7`!uKLFIWK<NYV>
zpu=jPO9Ia2`AT7D`L_&qfHJX&Se56?HQs!T@2K{<it*}tH$tzv{(YU5=h5Ts{fz*4
z2~P#ZI}&!hJeM%uYR3E8`S$Z_z0^TA6cpZ%V8`()fJb^M{}wVlUB@=2L)`}>%$*bL
zIvPUgXoDT+t!6r|XS|mSJj)-AQU}>kP&%e-c*~fM#SBl^v742@Ev)=Kh4+J~yr}1Q
zo4{*sAW{UyTL?R@V+GT31LIvU@l<_ls&X!W|Bd$wd41amJGjCiEDDPEW7u)twT$;h
z#;fby551|tA^*O@^xpkVdwtss-drM-LGfn7j`MB=ufki#c$Z5&rS~xKoX(fOzR2XY
z{M!vX(o0wr6z?x#$9Z=%y|*x4U2p6|!TylCe@U3v4!7$y=G*nE{!k?BIPX62Qu-+W
zZe_gJNIa!C7kEy3pG&dpErK245f%ldcN6S5?|!EDcE<aSMRpw}z~k+P(lG&c9PcQ@
z`yRvl{X%>CDrEY|hNtg0u;X~%F~NMfli}(9NMZh<d$FXK;_dj~R$kw#!TS(xkU{B4
zfgR_KWxT5x?@ba<`6II0*&jc{|3dTn77sh}2VqfA{`d*(IBz_7ReOIQ<JI*}gkII&
zZ)19I#B~YRn+RT~^V<^Gao!a0mLXkK{?;(w0RqpeM|-3WvZ0`K#AtXcSpKbLc)E^a
z=C|EUhyM(_j(y;*W`0w=e;8udu?oC}NEhjNknv8Gc*<{uC}**z0x?l|D}cxSRsuWn
z8(~pUb`2Wu9_F`)7_Y83!2I?O(|g|tyWZL0ohB&FsVb+pOFN~bIfRaLg`MTMty0Is
zNE-#E<7=?v<zPS4@hEJ`j`Zs~mN6aw#dPew!LDPw<RwlDO2;19ao(e>ygbf$?-F>H
zj-3*ZY$zxlcW8LW7~V#Pr|W2BI@I$Kgc<&ZUB_<l<`SU{O2@I+g`M(8EZRe-a`mvV
zvvefDj`H<sO~*Re@qF>-1lxm6J?PlT>e0K*A7NsA(&}&c!0ST+S3%|96F;`|#)CH(
zMpTbBGv2?$jt*CPb8DRS76>~_ZxQTBFJVzoypuHE5~lYB#;f~nJM^k{@;#>a&Ea;x
zm4J7=pfsn-Z`*~PmA+LneJ^V1+Xg%Cj|!xZbWpy$)I<7qGk^S&rLW*6d-~RbcdJAC
z{_vumw;H@Y$@>c9y-?yQe-vKt?2p@l2ftZ*OJGMj2#bR9$8wE#74yfdj92%^ex~<*
zruWMS?0RQ|cZHxdr^+8IVaM}%J$MsfLHWF$@qRAxl-|w|dWQ%*OYdQ+m#`=(y#qDg
ztxRt#<JI*ZV|vx|K7_e$y<P87@P6B56ceTQT-b5FJHe~U)f<fWK8dIFmee}?cgqj#
z{w;$Y;Sm-ErT015ao*ib?@t-8t~VaXDSv#({Ci%uU2g!qfV6_*?Z~q8?t>B4OY-k7
z#yec%DZT3#JL_EvJYJrgVMlrii-O`^tntQ=4YsF0XS}-Jbf%Y{g(5tPn<v}*lP%!g
zfbA+M|4xD(&*v2I`d~zQf5CVkmv~BVah<c?5Ay8&$=R?Yy@W+U>HQV#IB!1F+rfBs
zz4=V<Z<yZBe7k=uz?&*4ZM?Ox<Gdx{Rpn(5<NcMyQ+ij0&>Jc2toqv|^%52Zub3HL
zjklWVeV_5_dS^p#JTS-~>iIRo9HI4JHh`DTGb$+mCTsnTWsLU&#=C8ay_~j49b`j6
z>DUT8o`0)=NB*Vs?PGYljvA)pcg$~VAGZ5#8+gedDkvRyNjv3_cGx-fU&4f)<&S+*
z$8R+qF4%D$YgxYht_K|}So!-s({TqHPijuoc*%b7CMpq_tNa@RJI=ciysG@|XS~ZK
zp3-X|-<|X}Ut{-MEbPc1ghfH|ZiF4@-OltLV7$8D)-%8Tk?Flmlov~HJl37c-zC`2
zd3Q73j~Q<#@{6~VDN+a7a2@1Nj<*kZs{9>hc)E@jrb9g!NqJK;+wQk?@JdRPSCzkF
z*m2(djQ3N<`<tunI&!2AvZ0{-@d4~O-eHE<#qe|;JDH9H%pa@JzVq@oF@%nlu;aW(
z8ShcXdxpTX>QTPbK{i~+APtZHPe=LVuMAJuv6tyM$aG8)<=HA%Md0P-Uio9JR-V21
zUm(T%H^$p0{A=l$DRqzy*Fn!M@_dP9cz<Vjx{kw42R+kD{-t=mD9@ITvJg71)5>!^
z<NYV&?biHJEp?C$1y!z&YW_%Mct(V<qkPhJ(4Q!&cIacKBmXLUxvB$iqRA*Giuc`_
z_WVl$ufp>%-U}q2YS$XId{KDx9tUp^)=RyFMM2q>X}lA`OYIPykHQ(Rt~UXC<E7o7
znck0aox|(VM({edYkz_rFE2%mH;VDr3p}g*(fO0|pKK^79d#PsZ05HZhNtUDXFAmL
z%7l6JTXr4WwR~3f=m_k%jta)xpYeW2;8{9$NgZTELFu?b!>eX^aSTt_k;`;^%KQ;2
z^3SSA?ICn{wfw7Nyn`9<y%<;E<!YbQK{i~+U9jW%vW(#kVR*WZ66jFn{s_}?1KN9D
zuJ(gBQBc}=y|ClFE5NJp5*RN%Z%=rt9vSH8@pe-A<NLGhdShWn<&Ur^D7!VV<Gky^
z8;AW=kIrViy54H$x6hc~=W%_-^~Qsj@KjLc?-|%}-p!167~`EN@T~HeB6W}r1*K!W
zhPR#h&ByR`9Sux}dJdj2M~M8h%3r#c&q_zKmVY}L@41Y3vuOV;9pj}AvZ0`KG{cVP
z%Wj58|8-7w<VRh{TBhT3=8xUDzUThP4WVNf>^Scp#+%A`FBf>0jv}dpY$zxl(>1((
z3@?r0={lOBLzVl#G967<+I5tGH&Ia9cqhV+>(~!og*Te<-YfA`J*okoQ$5;$g~@B_
zT?RYKf5M`m^mf9I^Bx1Qsz;fOSJ&Id{Ps7dxAQu?-WA|=sz>`^$9ZFMUt95xVZ18@
zo~2{0)Il~}M}vl!2t3kD?ZH@vr|a0mbg1_$C~xi(`DfLm^;$lwdUS`De<_T2JmVdq
z`J-9tAR7wGAITbCI>Wnw;psXKG97<s{z%jO(Go((2rd6|81FY2@0->3a<yIRARDgZ
z4cKx2PGorBWO%xcW6+_>{V}FvPl>%;?F4V4ptSMU!;bUjgID3@G2XW&o~lQkTD~ZM
z_=KHR{tipMghfHwC2G90!K=!10pr#6#y=eF*L}(K)`@(!%HL7&I@O~ZEuX6yZz1DN
z(ER3ID%u0G;X3GkD$l=V%x}{eo~|R6>7WZz$`^`n&anF}7QC@0qnN0A^akuW?+V6y
z3FDnB@GO7O|LIUYCmRaNAK%vSRx!Lw8J@0VBGchwI$m2~*WnAH<43ULI@U7Y%Ng%1
zfoJJRmpaIX>$p<GThH)H7@n@97&=tBSO3#NdGqix`#5V3ct;3IbE^FD_nYkFof{eN
zw;1pJ5>M5m*;>9Re_R7RoX;)20jZa;C@8zDG~UhNRrP2V<JI*BnBGmS9>v7i_11uQ
zwxBepN^fzrUGH|rdkyE6cuMc?5PH`|+4b&~dI^hy()$4HczM~)c*{8NZH6&W9BNJ*
zm|pe1E@4iaY%iys;7w-7DZRhWvzOC-%)jM~H&@~*z216z{Z%@ufyezD2Ro{lghfHw
z1vK9MOz%9#tNXW!=~eI766W??yWRxw^7DeyI}LU`pN}%VRgCvViKq1DgwRXhFXVc2
zrC!3Kp!Dw5p1(TA^j0%oU2hB1tKP3AOs~ji>%341-eD%Am?*t#CfW7I;yFa}2la;*
zG2Sm=2OZXRSs;Yo6k%u8-#V$6uqY_KK8-gXysG}zGG1NpE~fW?SpB{E8+QLL3!yg|
zcHF-yOz#rLTPN|9f7gf5`}Rb;f19OV!s2@0gdOKiXL{=yudcU~=~eI7QXbX|Udz8N
z;B_j`i5l-jrkB1MMOftTg%VHc-5o;j&I|2&_e#BlMM3$u4R%~_KGS<M<JI+cLvK8A
zsQd*0MtBqlK4JH7r{u*hGpO?14|bflgy~(*c-tPg>o_R!$cBQ_u^o0CZ#Kibjp6A!
zVjl^fS2r;o=ioVJsz>U6$`SAmH5tW3>39b3!EoLRmVb9J-oX-2`7QQF=XUo(;DOhw
zmkF>VzY`V(rT2V|w~q1N$#`|WDNL_=FPbnPzRB)4A9zztMln%(Q((vSu3-7Rit*kr
z@s!^D5PDzuj@`e-QZHdqP<o$*9p_!e^xnsKb-fdzSC!Kz0Y-Qf@7-wEJ5%x!Ck3VV
zF4%G2^-S*?#+xhfEWedWJhGucoD?Q%cpDksT85|VC}ujg0*vq|etMC;oCd(luPexg
z!Y8ofIySTXdyw(Y6nK`7dZ~kKC@8!V4R1Tsv5w*CIx1NCo5s!y@1AGZ(Ewhj`c?`%
zu45<Dv7Yhnl6b28tp^^zPEk6J;QuFheQTC_35)AJ3_H%dhw(njcy+zYnBFjU{gErm
zz16<7fHy@@np0K&eunLwcR$PL#~JT9iKq1L38D9LZ0CAAu}<v^VNp=|GF{_6%=A9V
zcy+yNSvf6X{(X9)-M<Hc?^I5ofF0L+jPW)z-Z+70mD6sigKW5tSPd^0?<tU8I&VG0
z@N^x`&_U&e>=qzXC|@XUSt@jRl!K7(x!A6P%D?Ae$92Smw+2Rp_goLWTN&>U81EBH
z?7UQdQWYuYiuY02ao!c+^-12A9(darZv-o+Uue7m@IrzW6z^X(-i_c@{lu4g;N8u5
z|G@NqUT4=^6GCqn?6}^oOz$f_@a|>2kxXxqrnf1C-a<|99;Wxz9(eaN-Y8Z-3N*bN
zz>BV)6;wV?()8{JZzim$Ty5`x_Xy*SWV{b+y!*h*`=^R`oyHrF|9KuSd0TtnJ;r#?
zV7w14w)?jmyt$UzV0r#N?6`l6z^m%f8$IwwJ{qjQ-(<XpYwf(_(NA%zM+afYdAEbt
zC-wfc2i|zb8^g-gWKC}wc%ACeH#NQcz^m%ft{!-OjQ3Wi_aaSiAcWovG`;kH-%9V#
zd*DrHys=F00~&8*2)(N{-q;I+dVkRa?|8=hB-8uZckKRc0&gz-rh+QZpTds&Hxaz5
zTy^xoo6mTE!g!<W?Yw(K@P@;V^R8mNdwSq4X1o!M_cN_rB`kA3uYRhPt79ym-|vBU
zHse+QD@1wt<y^boRPZ|0qrbzB>!tIt564q`^+6B30md86%2nhXJ8y9aUN7u8Z#v`s
zs0ZFU#@mna9=_hrTOT5y55kV~7J*mQ-_9O*8yIhY#(S1lo>zi*qAJXotMWWVE6=mR
zn<?}84?Xa%V!ZoVxw=E+-5DaEZ`F8Lfwx%l{;3DvCdNB}>Aj`Qp3jFv=)DPcJfHV5
zy@z_>-N<<381KRgJ8$ZDoy+rl*m2(2Zv@Np;U0Kf81F#Fdy`(CL+~!u%QNHsv<Kep
zjCT;@oujo^^&xn#(b}sb#`~8Zcy}@0!>nBWm&UsRyi`9_Q04jO8gDh@{k#X>J&boS
z(|d!~UbTeKTdTEKs~B&054@d>H=gl+<3@YA+8cs*0_=FX+RS+W-UIJp#`_nR&(CVS
z#?8+8{ItfqoALg$2i|VRJA~=|W4T>#9C)413%`RM*L#@px^Qlwa)8-!&zE>N1p9So
zFkY8-T{b=h?>}y^^TuKv!v`KZA9;J=jbpssET6B^c*{cM^A+0lU^?TC=z%wp@t(=_
z)@u1&6GHDoEuV`RZ*&j5sf;&)@m_}fb0NRf^>0%M-b=K6u4cUbdf?4ry#HkRyh-D2
z3z5%HYP_o$Z(I+&xs3NLrq`pj8|@+VeyO$3n;Gw5#=GWDk$>69Lkiu%qw};1l(!Ub
zxdrp0FYy$h(ST^AVx0%Fp%9PrBP}ZovP0Fhg2MZsJB6Lv@v{(k_hGvS<ImiV_cs*p
zj9&-GNXfQngJHDI6&!O=d8z(VyI!?uab0cYoa-_co#&&FX->sNEQ{&5oE&pw_Jnac
z<ISbA=vxYk{4SSbB<xgED`3qKceyzW%Q0uE#$N0_^0McJ(TBPRcpIk|*5`W~jjl{@
zQQ;+*)aQRUzrEXNnV;zMU*-SufByO9)WRfxeg3WHa#)wo8`D+dntzUawa?s=hrM~z
z>+^4>qZ%^(ZBt^pnq98d7ZrweMY-$qmz!1-i>CUQ<@>PL7bxzIjrHX(uNn{DwkaQU
z8wPDD&cCC=+?SY?KP`}V)VO?F8Ep^i>gT@7@5A2FMT9^p8fB)a!Ca2&$_#g}3+o!_
z&NSDD7iJ-~-arb_m-{zN3F{i-_B`xbmul|yO&{sMIX@HIGtG2lA{~ja+%RRYOh;~h
zTX$ijxi>M(mXb_!kGCnTWye8dz>ytBYYws;e|K+S$kP~x=tlG+{ssB`G2%YN7Q|-6
zM#Os&artik54Zn8*YcKUk2GM_3gnYZy1hGYZSndO3WxanLx~YE0<K1(+weU(cSU!O
zap{pSGkxVr=Zu(poqqsQADQVZlllT9{kH~u{>CX{-PII1^~U_DKvZCPo~za8ceh;A
z?fvnQ9h8ek>nt!|fH(|svYDQS1}s`Zrsp0?&zXgd$E9b)+@x~`6)r?7DFq_`2|3I!
zmQw>e4@J#<y(-nea>|PCbi*+<cZ<|q3D$hXL`0F6xCSg*;dI`F&YSj^-7k3kQ78$N
z`;l@UA?M+8?(?^!%=(a{l*b8(biZd3`Mssz3M^Vd<#pU8UjKLVQ*UYg?CSg4B0TLr
zzbHLnU5Vks!$#`Sc2Uy83rG6Hr`6|w$4rCR`=<j&E47J(5Q)pFjMYpLv@I<y4Gk|Z
zGHdCMgAKV*(n@<GS3KAt^hKKcT!FH=cUG;O(mA(mzANw+mR59+H9F@<rEY6&-{F>8
z4f?!`qc$T+A){`B)1|E|?RT|=`9~JU`dwL~4n{RTfSNbDz2T+Q1^v1b`bTsp#s2b8
zl*=7>w>!2i;(6~g;a!oQcMcgNp6*I=zjMfa(Tv2-DU*h|N5;SBNp-cRF1V*V(Wprb
zZwzm0$?Ny)NyEZdkDMRZ?TRIzxiUZNFgjDWpl0Vpb-H}%<=)Qp1zWqm%uHx?`ECbu
zR8xelCP%ZH{0Ov?Kb`W|Z60N6rq_?nK)Oli=tIVUyHU3%7Os>nO?2a0a20RyE!fs&
z44B<+B%!^DL#ncp%CG4B<NSVIz8Kf&y{)d{#)y~mBHMlQDfN>Q3)*A4!wuKCqX*W)
z8{4)#-0d?Wx<|$mil_ZdEcwdEc0SwX3U`gZ=);<8lFZ{=nNN1P!ana9(fM@O$f&3;
zSM(m_Xv`;Jp8f&K*SNOuXYM)Z4G(+9vu2jRbBZf9wqwKm$kE|t{Ve84FozkgvA;Xu
zPIb3?QeSW1d4Sr-=yj3PzLP&FFeq?Wp1U<hw%L?gO3kMS4kIV19yqnbp~_(k>RFiI
z2*moAn{AqCm0f|rTq=jRqlIhPA?j1iarJ5Rp<@wV|2c*Ix?-dHbwx(k=SOu#MpEk@
z)<~)+``v*ns;2qh={7brPYL(Co6eo@O4{&AR9K-u%`ExNd7che#=&-XhP#6lhIfkG
zH&PQ?X+3ORI8z)>iX%kZ8i39-5DUyUzNP_-R*>cWo^XF7(%<Os=P%qcW`3&Qm6S)d
z{q7wHkBGXMl3x({L1tj&HF*m%aei@Sy4qbiM-P~70^0CUZMG<5Vg7W~Oi~-&SeQ7l
z{Q+>@=|>4k+`DDee0bk*CApH#nvm*khnfkl&P$INQPE9bW2L^(&;5w97>y&n-Y!>U
zbXR1|JKYHzs76vw{wfegB_}o<B`4Y6g8U3?+K~4y@~;28;Z3fjQS&!^674PaC!0CD
zA@8RhVe4HPziof>fG4B1W7K?~{}r@d&m))UeBGBa@}Fv}Qjcq^Mzz<-wkoXAxuv33
zD(soT=lr|csfUo4C(}+{7^0n;WoxHq^w3UCwzX5uqMd4_R?6KT(bRJr)vqfNZIt&E
zv{654|LF<ZsEDQ`D1Qf$U#HtB!@O2OzxcQ|%InZZMWKzlqB|vyw^E;3t&}=P9^bcA
z?bImNP7P4))arJ$QW4GGKDSX3o2ixZc6oc*LcJHVg?dxAP(MQp)n>L(uB0ELj6Bmr
z8|4zcp;k9+DA0M|TsVozl7)+x)YL4ht*fl?RWB-^Q(ftsx2V>)xNgqEiaE6vzN&>a
zOX^Mn|9{n?lNMIgE~={VrDkQ09h;q*JwDwxcg|ucU$oFyn=}6W^K;Ix80jmop0n^;
z-wl<ui>t6b>->z&jBH<OpsucF@df9dhkPN7jB6Jyy0*G<@uDTQ<&_!bi>^DbZqcIZ
z^1z&`h38dQ-*DaNn%YJ4E6eMA6%*!-pD-_{B5T~ZabqgRW@cqqjxEoekTYTIyfJgf
zWLB0}j;Y8VGcJ3iG3i2N)||>YbE^zj78WOGXJk$=!lNT5MY^Kg(VkdWe`A0v&Na|I
z$Q$n(Vw~woaGm8E>P~ja|9GTv#c0GBM0$p!A0jSajRA->CPB|#Q{R0sB5fanNd1U2
z5vd(N3z4>;jY#d(If!&E`87n^o`HBCVkRObkhYCM%t0KBI1cfAMA|+9k*-Ba6J0aV
zwu=zIiI|Hx36Zwpv261?u>f;FB3(Yv_Nj=|5HCh7LZofe5idn7M!XF1azxr*f{53R
z47%q079wrC3UL<V)rhkZuR)~krHEySa}Y6XW0WJ(_DaNgh}R-g|Eda+w&S%0^ZFjI
z6&VW=X<&-BUyoRexEPV@2W`6n5s#@G^@ukjQeT6%FGIxeHw{G_w;<BC<%qW;-iAn>
zOWJk^;`b0&BHoF37b0z6g?JC*y@>ZA(zexzYY^{8T#NVsB5i*Vu?cY<BAuUU+j_)@
z5$U?(QN#_1wEc0!ClEIxK8g4gB5iL*+=NJN(X)t~5o!DLh%X?vAZ|f?5s|jPf%p@-
z{3hl<lgn>m{<d7+jrlu>Jp~U&;C?ldTX>9{v7S#PX7Cte<$m&!%XrtgaG=;jWx{2&
z8w=$AGIPDd_%#(^gz<<jqm34=;4#9iWm@oHWPX&5Kgx*2dW~fjWi1JNs%gRCK~4K4
zHMmYS?-y9Fwl)p0mT19adlQ1zhZtLI#}6^qVm-)DH8vPLX3gd6XB$gx$DeJ?vhh>R
z4hD}|!}+?;c*dsRXOv+*-7@i6OSIszy^%rd!;Rs#<A)n=tQT2F4Y!uW@n6^0(~Ljb
z(x0a7&oFk`_Gf7O#~9Dr_Kz{{#X7Z5B8)L+%knY;8(hXtwZojFbZP4ojO%T9)T#x8
z2Q6BOZ9lbe!Qesbw$YX!lZ{ze-)fmmww7qYV-#rXQ;o0Lj-P5A17ECVHPu?81rJ)t
z-`dhM-FSo6t@<-vv!_}U3?8(kPuh+z3GT#_2d(N#+kR?ggTZ6AwtT(RSYWd+HKt>|
z!7`!NI2b%;tIXFcjYn+yD}y_+<S|?8;3f}R>k^y&0^=;Kw^=6Cng@f&pjJH?JZRPb
zYD@3+!JSz0poRanZT}6%cB}`>7o7ou!DF5Y`1&&AQQPr!W(Wok&I-5M_Ad|a#F7VR
zh)Uc3JB&iCw^&wpSWC3vG0!ByO&**{nr!*A%9xJzV0l^<G&YZ4Z49>AuQrZ=@0ew^
z+FGIok9jr<Zt~!4^qwufban~`56(=l*!I(zDi}QG8H=w!ZmhG}KW;3;dV^&`XS87O
z*uMBm>1#GhZO1nUjj`l0&v?O29-Q&=Z1&F^Ymgt?EfYE;27`xrg0^~$my8zJQ}v@f
zc4NKJmY**f{jeTM#%6d)Etqo;E4j46b6k7XuGx2J>+c$S0Z#l4m<)1zj6cMQbt-wu
z?kJ;^HNn_re1cOH*;5}T**(DcOMh-Z#7NZazv##9&o(}%PNNKjm;N=eG840b?jIUA
zYsaU`^E0(H1KqD0TWsq;HkQfb#r_?J*M_&v_z^YaG7#UFl3&>W$XIE^+iuLT;k{-=
zM607kANegU{m*Foo8<X}jv~J8?37CDcgytTVmZnEhVi*i<PYsjc26~?+4jF_ycUHW
zGLTKQZU0-w**<>!D&sAA3eAOWl6$v7@6M9HCL#`U`-~rYupk5BRcq__fsgFTAA{V(
zjUQ;~KOg>7fsX&4w*Ljb?neJp@?#NrX+}2+I^hew8AeR7aGTp`p9*m}s3S$#Q~xa4
zJ;wMY$H%rcu%TnZ&HWRM)$k9kM`Dufo^EtvIk^8K<H%64PIWZdJ=yq$hBuIPK`4#O
zwe@z*{zjXg665#h3Vb9R_*WTTB#ii1n(L)TgMPfW{&<40FEs5djknJd>$}YL1;!WX
zQWBoXzv~Tp)>j4E_LpR_U*y*fhS!!q%Zwi<iv4uoGTFV_yao#9&vIi*yx6}DSjp}?
zjA@$wn{50K8Xn0f^sYB92ouK(y^kAv&k*a=OuS~}TZ6><PILWvqgd8IO2a^RtMTHQ
zSdfAA<PTPBLURu5;?n*V<ailqeTG-93H!Mk-iOFv70BL=@}L5(pRLu0Ig~INXn(5a
zuY+28ehYmnkbOJyQw3Tducg<mrMF4L8>prKJ`MkE_*VtOkJr+Bi^l&h+AA_?z=YcS
zV!5u`hkwZRnXsYyf0JA%8mhk|FpsV`jBJ|UD6Y+;zk~1G(mLi;ZlZ6(_cmz0%rN%Q
z{JY{FInC)>%>&JanA0;s^sQ76%1klMZ^5-XZEq0YjP)$XwK;7^o|V!3R>P>E`E9rc
zr#Z?#{inNU1+IZGFS{Mr+O&QL&QCP|9<HrvPK6O64a=Z5(jvw9Mf9Cw%pv+NF?JAr
zx72}dP7UnJ?h)7So_odlj@Bupp^Y?gQ1?-t48qBzIdF1lj*D>0Pr?h(9C+23)A59h
zr!UMg0Sgaps)-jT@z8C$h>kl^y4Gmv!nw!9fzQo!0mqgu3<mU=uC-daP!>%*)R|~X
z&-YOV<eaKaG`ef3{^mR#bMhDQk$)&3$PeRbuJRvknTdzQndNAmOy5$e_aRxHeju(1
z&2mA<KOn|%JnON7kcKwi#POM{Mp}|skA772qlRse+tC)o)uul(X#TiNSE}5Pw#~#D
zDW2IGwoz_R)7BxbmX3c~^rgw4Td_|5qw;R~5hNyFmN*{`YZmD#+az&OX$lGF8N+Cx
zIq=?)>wl#=aH(<<9<|RF?pTS7%q0BdbWV_dLAj%lcA>QYhGFDkJ^Fbu))oDN7;7S)
z25cw%6>^T5k%mG?_-T{GJ9ooy9ECK1nA`KEzZ4#DHex^Fw_#3rJLMcRBdtIl2hntV
zG`g>`m|OmtD*c0UnL+z?|6DAOpDz9J3XBlaF4fjA6Ju|bpPR9t^tE74=}~?%kDDR!
zuGIYVD(waCw}SpzhIPVwjpp#zUuX{8W0;$M;r^K=ajyxX^V`xt&`BY!Oxn-wqkqcf
zaq~3)Tr0O%iLn^+2PB&5eT3#%-;Oz@yG_n9Gt%bE<E|6)VNJpxo>tn6{R_pqTh=Q#
zz|ce)?#IOQ9qu+UF6@3?v^VI^8a~?p6OleQ3IkO&_fJK-+)s$|<9<@qL-$jneQ>`i
z+9mhTG`?pgADkLbIBg;Lo(sXZOY*%X`QDa%C>#?BZ;RxU<<kA4<U^q``F<|>c1wNl
zNPWMMeE%i&wM%_3OTHgUJ~R%fvWB}u^1Z9^{Ydit_yl}#UJBvpeD6uVJ(BO2l5dCP
zqr!_YVi6{#vnr~KZ!j`yE2}dmU4BVMWqnmeeMVhneO*TBtm!lAva?Eyrshp9E-syv
zH??&7q)Q5B6i=F5kd;|ly11^QYT?`^^QJB>7`tR%^`fN(66fTO{;H`cKdDr(qkGgn
z7I%KC%AuW}(lo_SpHZ5Xg*!O4rFFG)s_GUaI|_nH=^I%2abV>f>?FN3VadXZ%G#6h
z)bR*k-CM_F^{w2L7uXQ`meEU(%V_f2NdP)~uJ?drM7ffW|4wyI-`IK8OBM%E&3Y88
zK{=<acTl}7?GqLU7A?JQ&cYkZPn5Rf0G(531MG9D&obMlMN8^L<CL@b#)XtH6X(Qb
zEY#7Wq}R=v+l$sQ6h>cLSsPAy!O19LM}K7{L5v;?;BiiNF3n0!->{qujKb<`S(%W(
zXzHairY@|i%g^q05z!CoLw@Rq_OU>W$NK@L^z1>7mE^wVp0g)R?R^7sc0(`|`*2<e
z=E>x*;sbHeSMouSuMf$!`ydE$!j{G9z&<3~;qbn>%-Q#*fW84a`~HMLK|kkbo!~rS
z*Lp(papDoA6WRq+Fu89jFwOhgwq)5_@1+I#nZ0gdLLb_Pf~xh=`$BK;-3O2C3%gBy
z`BzuZ5A6#-*T6AOSWj*FrjDee40>Sey2^!hMrmnz{hZP{*jR<FeQd;a=c3{ipN}q!
ze`--d@r3K<;vu@a%2J7Y;?&ymd1*mNv_3R7eM;e1^+^v&r3^i>aPHt9!1|)Qmyjpr
z@bb_u>YZ+z!+SvMi}2oJ_EkC0&>oW7JK?<q>x=GQLRMETTu@m%dQnXsp6y(0WXxT>
zI3uH|^peWjYbz_JR4<x4ry5&{curkiZPnZ*b(L5z%D^yzWAlJ2UR$@MhFy|aTdu8L
zgdKDRGpBq(X?b8l>AX2r)kem`MRk=KQ>I@r+T7uY+T&T==HaCU;}_vcRdXm{K1;<{
zM(9hP_mGkv`FnX;!Ihl~yz>`VRxVgHZ(cz?#tf{EiMh3+s<vQ$&llszCEB_3bV8Co
zpJaH+URp4rW-f{ol_VtC#OiDNYDegczk5i@sql|2VW$Gn^hM30#Rc$p&O9tk4W5(>
zPNlz38HaPveq8<HYb)y(78Eb7>SGxVfw#DlMpR6^J{L!=(j#qnK>%sH7>Vm;dF&CQ
zF9otEpi@zRY~uO`=-fJ3o-FUHCqv*VPXh1cJXu~46sy2a+_KmlphJ9RPijD?DC1=@
zRpLbIdUuaRlNmfQeYGNA&Q97uIEj4XDLEC{#PRxEp7`kjWBS1pRj+fYCxpJ_QV%$%
zBA0B^=9xqJ#=NDqRdto}dh*&Ocy+22ec{SEi|yOylwZH3s+P7@EM8O^z{^C{v=Zzi
znui)o7NWr~@3FDR{k+n;K<%QXrL{{I)>U0sSz1|JyQmfoak)X=Rg7<Ae&coK{A7Cj
z=yQ~oQgU!-tN@sO@8atSU)7a5&dI1k0X<1oI>J{~rQ!5cK;`fl2C*)`ct&O^6&$~~
zhUw|3u}jNw3#H)1hB>{o%R<(fmpPbLAkrPw#l65sLQqC~VVKiPyP|QWrAy1J7WM|R
zmv&=%2L~zDi>~brue9r9S)H(CaV4%7%PZ^h&c7k+{7i(Y=*6C2zNn(I{D!)zOUrpz
zwgBa!r1bKOVIhkMQr4?_dWv{N+3(fK^hAv1|0ZR<<mrPleXwn86`m`oglqclmfk`2
zrNyyzVep(s$h7rEFh9@sgn8nQWN(oABDXhqeXNpppWrc*kXd+Qxi)Wvg6fOjUIF%1
zFwewLiR@J?qYcD6=UiXp_9A6CBVHWxsVCV=2HT>7%ctXnnq5^<&|{~|x&7_^VYWuc
zJj`sSE9TVAF&AnV;bE<kD|>ic%jRf2>LS|tJ^=8n`zpuV5`c%APAUO(d{14MEbS2(
z=kW~mhl<h0W*s*~w{%8!X)hV7L^meH^E#)3K|K-Vd?g=}p}g-Jz8XVHT}I9XBc&o^
zj5*E5v@RpdTs9YT#?yu|<}}-!W|>n=Dl&4;H+P!TY)mUMvdpQuA!nSq)0}3T(=2mp
zPIAVYoaQteQ*fHg=3-8cd89ebHm6zU6ccccF?V8Gk&$gqv&^YE8JkTzb1;P<b2;0b
zW{G9zk^c;H=h!S09aG3Pm$S`jR#u3k#9mZ{MP@xjNy^GFw~fs-6JburnA2=?nw4pk
zPAR%HZ&Fcd>C{s6?Xog6MLnv*11zO;YHR1*m_gf+f=u%f&t6UXCE{6nW|@PBb3Ysz
z+<-@#&5+tpydx4W*K_1t&Af8q-N@tZ8Wad@l->QXi^6)YJZ_m!JU9P7)+s$?2NPqL
z#B*br!d76#ibZp(@Ma3Tnp@?*HrUbeN}IAP!A8!TlO&$EC0^2|cvlY;|9v6hj2t}V
zoPZUwtCx0U`w_O2JoW9XU07L$brlrv9k3%_ywGWeeDKn9z=TKJ74Lfz&#mk*chWmX
z*je9nDTW>CH8~_6X2y9M?=q&Ba22nvw+P26z2A{`Wc$YfcD*yfOZlOK(t8i=xZYLZ
z&4m%^#V(8YLy4#KwujI=LD*S(_es5kMM3e7#Rks1o9P`S?I@pgy%kLFP124q5BIn0
z-49+T|2_aa&byEKcL?MCy~I;`%TPd_{F^82EWPwjCZ(IOC@8%bX}s~t!SYQ0BReO(
z%b4EpN;|SWs_Hp(Qm6y3lYiI4j_XYUZ!YY~zh@&V-j5}o(t9|B-a=t#>Ft(!35$Z#
zo3HU!FulX19qFAOVQ+^BU?Ks@pzsF3j&$V8?R89t58ITEe2M3lb`!C~$!~kmh`8`d
z*R9g75O$OvpIleG?Xcs#TfqyLnE7`u=8E@D7y-|0n+T#9J7&^?3<}Q=JC3&#c;jJ1
z{=h3u7TzrqPw8j|fRm00VQ1-}@2HUu!lIyfJsR&ZrXy9_(Q)@^{@4xxl?K97%eM(T
zi?>bkrjZeX;=M)lTP!k-cu4OkX-DgNJztAVruR6=j^2YIJc@roCYbpw6S4~%$sa1H
z^!+#ND4$h=<H4)^mVwQLMZC`oJgYqK#SYp|HWbK?!ZR9P3e%B^{R&Ul(F{_m-=yO)
zX-Bp{PqFLh#6~IyDv%9@rLf~V(!s0n#$Z3$QF>p89p#IvzX@T^<>l+b&eEF#J35}Q
zC=ecnb79AM^I86l!+x@(<8-}k(5w9RgtQ~uRd5XVTRM1E9|gOWn~asP<Gdv-pYf`k
z#hWYeEFC#g2iZ_iIwop(vl-rn(#}c89;V|-X-AkJAaWfOL+JPw?6{5!#(R;(Bi=Ov
z&(e`Eb&w4OrQ=>KbG&MXmn-d@bR1;m?<r|Vm>&<d>nH;6c5GKc@je1O&RYjwAB?Cx
zPevp=;_Z}ps{GOS$53Ugpzy8~c9vfHt^^%VSQM1q<r?o=@Is2o>z8&;dg*VMRQbD4
z+7afbKD*vT@DiR1iuV(rUGGN5I~B%cN4(#K9m;{FBVFns8wv{VMxPyTEAZ%e%0Ij!
zY2oShC>}agJ>Mwp2=nf9>^gFYmkOi|iuaqa<9^!?-b~mK?{q}6qjW5nc*<`R(Ox_G
z?SB&OdJADk#}gI>#rqlTIPYPWf0s!+I!@P{&isZ~2TeS}TrApWtKVJ>UhX$kZ!;{?
z+UH}8w*(eSZ-&6L{6^m|r}U5w1*IcR!;4K3c9ehgex}0Hb>uR?ZI*UqyASE%?M48+
zfV6_r@jck_{EKJ2SHW8GzAN#R-{{-2NU{~kj>0%$XX$N{dI^hyvdh+Z6Tz$M+iYp)
z<hPkj?{m_QFzGuNT<-?(uEcf~6z?mr<9gG<n+hY!=TbznBi^GDPw7p?Mkl?s!p_p0
z13NmNuqY_rg&J=Oc$MC{(vFVP{aeHIwn#g|T#w4i^-jdWh1jlw^6#av<9aK=OFX2v
z5|OZIeT~FZdRJhhliqM)XX$N(9UV_t6bO%kTjQ+;uhJX9e#NWnUCH!rk#=Oe^DMjG
zCXnvJb`=zFJ?yyNW#CPP5$RoksCa)Q@s!>&9OR@oQ`lL0t6>Lf6ALp-Z@R|25xh$8
zLdL7>-2lDn{DD`BO*~5D(HOhlI`9&n3d+AnV8``tWxUtJSm|vMc$SV8QU}>kAUg`1
zHN2g`BfXS=ixCx`u45~7z~!dhR%u7Jhm-9(R)KdswyU6cn_$Ov>;|vGy8*_E_xBP{
z`E4f-a`IcDu(R~GOTC0eLGk8my!*kc{C1<XBmKJG-OO)zmD|K4%zvU%@_M-!yf|fA
z!7Z1*fDzYw6uc^*m%)axX#GWjXX)saI>?3s*-?02!#l?CZpMCvr|alsI({ha$d=Ae
zT*tu>I*MV(b$Evdbu5>7q=S3}JWIzBse^1NC>><W@nRX?ZPJcxbR9=o`P(M#2y+rD
z7uV4ZaN4he;{ANEoi`r5J{VECzXOr%i1&Pnr^;VTv~&4;4tQMecG%JJghfH|Zqj&j
zz^lsNozl)pZ!89_kQ6h0_e(p%9OAR<-3eaaZYbV?u;clh&v;i!JmP)gYjz!bqz<y7
zpzt1r9mgwSe!ExNIqC30hpOkVNISxO8T~r$w|(HH|2a`X@m9f(^UeluCXC2$s}aeL
zc%PMc%5R-$=bYM&Bw=Tj)5EYc(+vy?iuW9icNNROwbIT>?|A07A4xmHTq4?MtKUiO
zKlhtzH?GHau6I4-eUR~H3Oq}P7h)+rWJ5veNZ0T-Grz5qc1}8qnBRUZ?FjQ9Np`=*
zf;R=*RZu#bVaIiBWxVTQOjyMGnZ#3m%LJa2-@Ya6EWHz@Uc#cF^v=+Dx3m0vRN6V|
ztzde$OFP1(aR3+QYMehGyeqM;g5o`l1+I5DcvE3S<@9kxvLoI!iKq1L4xyLE=fG>}
z-7EDH76rw-QR6+z^gb!=ob)bZdUr@W!hH7(yWURlPQ!K;lz(rB9oOp}A@q^nW<<gw
z-dz$;=}pHtE+DO-bW9X>mfrEOqvHvSg0dU0@y3Fe>JjliEA8kw{rs_(>3vPw5$0vs
z&i$JU-ksR4g5nK>9oL%(-c%S7@AHUcN4!%cp3>{>@2qzR&S%`eaj>J~35$Z_eHC_`
zH=pU<BJJq7+XSA~7fA@gdyB-&#W5607~V@*S30g0c-DAqicBBbP*CYB*YGNUN9mz_
zQT--b|2obeH1{A<NC)0bv1m>e-j~CAXLqiHU5NwU7Z{Jwd7bPw_Y&{6UfL~n(CfrI
zy_a?uJMdDuRY5K9aj+Y&j4)UEtk;jtD7REE$#3^cJF>kQ{v>SmElcuSF4k30c;A5?
zFQ?U5uYnQay@5z}<cHfv3cPGAQ>X?WOszm%6!r9NW9e(ee!`>p4K00ZL!@tlmcD%~
zeQ!!EN}tZVlku*RcEtM+w6i>4_JrX58|-+#6n#CIFK_k0+s=4Ze}j1Ge8zd>ao;l+
z+f^VN3fnZ^?TmLf_LCjyeG~pb(ye+~0z8F*&DQc8up=G0v=JdaRUA+L{RN`J8;ACQ
za8*5@3A|#gtDvyw0Z+FpQ%0C8yG#eWfP>u#YOmP0K#7+J$}<WXXy0i$(_BLv1Uu>%
zs6hKDZW8UE+HCw!2)rWLK`Rw?GmzaxwSu|g9g-NlCqcXS!M_`1T9#s+^u{5cmz5<x
z?P-4B^Tgi*JwJ2oIAMC?Z-E}fwFrXsEzm5aPJRn6;x2p(F1fIu{1#jkzB(Bdpl@<j
z1rGXi%`asoPNnac<@s;SFErQBnuc%TMNjpAC%@QS_xUd~=kfUROn9IeU*0N2%thQ3
zh%>kOu-t#D4+t$&4&h6cEmNYJVytg`xm%;zcgt2Fq4N-DAr>K0p5`E?Av%4_Onjd$
z(jRN4!R=4=Cz(sBe&_G9sc&@+G_BhIj1QqC-5O{+WDMMi<>h6Mm$l39x!J#uNIWrq
zuRqRjBn|Z&!zqvG=;d_m6?E+FWsj9PbN=?_@E2U0U4HTHxQDyFhUcNSh{)EtiQ$Fe
zQ|t3@#8=XqGYL^x&=QJ?c^&BVtw#F3Uu2ofhwmubzVAnAjIHlD<T^M0h%3z7dU4|1
z$g})A4z|cID>{9r?gHZipY^A2GiDTAUgG<@@pT`)JX%?i;WLIW#swOM)8EDE)pv1H
zkX2}c&2t-?UbC-=S;#=&Gx<BN)q=re9Kd>$wZUUl$;QNuZ7yS^@f+-?WvbS+{!6UW
zb0P#o>pVDpzoeZEtw61NFnCN9zCOTs!)9-95S_kHvcqPto?sD}$A6DxsIkpvKh$^$
z>s04O7;5|s>prYdTY0=bG_Wjq@Fk+>ZFpZZHeo$@?SYOL3m#m>ZnW8x2ZO<5>!nbe
zKhk&tyU8V65$XSvzlDU+I;DjEFaH{Hjttbc9|#lsaq7hWA;wbN!ytQNqW{nTGfs%K
zjxHS5Q;eHwMFu+lUJdUfwG(sN|E0DcpHsI2?SE8T-=Nt~KoutwYHJ7K&#>>%_FteK
ze<dq2gg*`WM<%p9$o)0r2eQc^e+|U{Mbp@+3S>k16b-THiW$*x$2gk%#J8QIljQ#}
zCyQ?uMV~9`LK!k^J?!Xzqc_kTdAbqvGE}x^ngeVzZ4a0K`wDvs*8e>t&na2asFd+E
zCubng|3CxMNW)HZKP8IRp~>8ib2X(oT2`wxbehcV*l610I>Xd4O8oz4G}4nv_UWPw
zmyH(V;vOPJNJGEDJRa48%B1H!bF-0#>s#EaHipr`2x++QVA{zCqL7W~#5g~lANm<~
zdJC(%YHoQ=O=(5t+$GnRRxO;jC}(M4PM!YmL|+x-_$TteB2tf!cxPLG#96iQ+NqAu
zF5}_u33ICHzoF_D)lQ{<(iHzsMlV_zbLQgfb-{o1$<Y7egH$;DnTPm$4m_({UAfTq
z2Bzb`bewtxcy)~)_NDhVPw>wZUnzse&8exWTv%~p_z883=oLQXeL<BmuLcWs^KAJc
z-bnoyWI)xz#g(;n1@q~R)qeqeFatu>t&p#WWPPP9pPU_hS1*5Ifp`<QckjoXI=<uU
z?7u@L3ed^CZ(LIy%(-4R0Q8?8nwv^WOEODKvhc=7@x?R7m0mhyLaFfl3E#*17xMSP
zAOFHsIG<ZWmW)%K5^{y<lmC!E82^9JA1oDp^oLf^ds#)~DZr{)^wRj)-d2fIOWB89
zKc&Rt1^GVac6P91W%ey(_iEmfh2`|GVd8~e$KF?O-?~02hCbxwN%2swneQ|8bZ*Wb
zqjf^9T<Y^lHyeMQDEqVcR~tRki~Tp4FH$?_d#^M8q&V<4miaoI`P!TLdYkzMn|M>r
zd|OQZRa^#ML94^dWa5wGf(s#D6zj`NUORB%pvGb8TH+wCeb@!Cd96m<b8uZomu9$R
zGDGm1TddRd2Ze_bbvwHDRYBQZiVbvWm@9X*062hUx}>4>kR2|!%r5{Ep1RCDh~?n*
zxv;|~^UJHSv+hM5#Wp%#X;Zv}#d#B;7nf%yFKJV}^nD;)epw+GK=h0PrH`(?$&TV>
zm=LDA_j?S>bj_-QO85IX-n<l+8&VlBZCAWgB%ZoAm;i7my>ozvUDmzO6s(Y5lSATB
z8m`fJ$1`5SRlK_1nM`kzv?JT=aXhFjz3Es<!MX}c?*U{c*Q=i0rTn8&A;o*G#8Z0d
zyH1XJfrnj|Ui!`x=~W|4gh$~TjaNOpOT08rs(5w1HB7Hh+L7(=Fm?bcOK$~MQn9Xr
z()%sgalPspU*e@vEyer3#8Y}#0nbTq2M)k4OK%faNUs_pBRmT4V1e_}Grn=yPP|lJ
z74H}fKmfw3zZ<YJ5$h@_yq^J#@N(sjdf*WjMH+KZcq1jA(!URQPC7~fhFw;@Jct$2
zL0A+N@6{S_Gt+@#6N@)rjvrB7rEmmzq*n!nmkT?tV;k^@mvqpmp3?Cvp~FfaH8f<W
zM*b8YeFu%>wK2RThNqXSm8@JPOFP0m01_nKDp!%<rFKOHm9O(*N4%;5+{JiPuvzK&
zNaCq-l?nhSe{|t^@LJ_62X>^FuqY57g+IfN^R{E1@|p7Q>xhb%o{b_M*@zVA-4}&L
z>$H#J1G2mzJIqi9JH<sC)beUApF6=z=_B4WX-Df*0m|>?RRE6%;-rvEc9_%g6v*yT
zv1m?dAI1Bmo!aG536&ejhQd`?z^)pxhGneqdZg@r3PC(c8(<fQNc&ZJj>GbKSvlGA
zHl8`lWGiA>OvmNqn0vC$@BO{J?chVO?&ZaU9ruCE(9+V<(3|D|pYP>}oN%7fy_WAO
zXPPD=GnKUmE$OYc{i;P07WD1+@7ng8wMiWg^jPzogVqMDmtlntp>jj_3bL^hTn{(?
zWZNHQo(qEeMQx`sYzk>Ix%4cVxsH0&_bxR4oP$0MR9-!&wi5q8HwXXOHn+O6;H!KW
z>U?JybI8^D`}7kIww~ml9cO0+<t$uOTC)hFla;lL3yLvj8e+ga<e)~@1f}RWByISL
z{`Wz2;IV{0dtdtJ0r-=byi61h>NBXI7VpOfT2`enRR5grmFsrAol?ui!p=G`((^&o
z?y9t?_PPk$_<51O!Ao{@zmaSx(mM4MId3kuDK0Ep%gMsd;?2iCI$r5gyu)C}c@r2f
z6?MhiiDk}9>2>1$m9VpTNk8$bTB~^9mD_SLr{H6}ICWXP)Gy_{GqLW(OVty07Vm7V
z6R$dVD_+9ldg=U5c9hS!?PT#jj%C|<5$ik<4h4FymzFbW1)&1b>Ad&`wyR^v&cj#O
zz87g9KQF@0>AXn&Bc2brSZ|j&q>uE*A&L)oWGp&Qo)1rSUL1G+`PrG~De}b6xU8z7
z5)wQw-ag1>;5mv`+DPZchL;zaPkih+*dU*VKwhtSuz{X~xun~>V_RV7(AfOj^7^%}
z&Wmh6r@nvv^LgI)Ue1ep&o#!C^_K&e9{DoU+qq$ALaWPXbh>=kbbEh%WCz|iebBYM
z<=KV?&{%=E2KtAZd=0RnKwO3o*sV2F26nqH^n8LWIZ`uu^2dYAXXgIp0NGGFdy{5*
z&SP6Zr8P0oFYqMNx*2Kpj`7O0w(MAGrnO~<%h!T5I6eDuqI5>SWl!a2W-3KG<?}-W
z?ryo?@1OSmA@`<Xcp_*}U{D}>&CnY?tKW?n)PX$99^?0}aR-J}d7pXbkn#8|fAbWt
z-`nI$Eo(PYukJ8>*K~TH%feGT^vsKxHei42XIJ0nI_I*3#(6V_O*&|dHAZ)L(6&LZ
zx&n6wR!-562|xar93$O+OlBa<e`{5$zi|pJy-^j`6>Bt3aruz0yWEXoT?rmf^Hu&d
zGbOoad)Bvn(QqVoL~hib-MGVi7NsxtqBC$zcSl&K*Y`HIx_q=Rx+%hXmdVxX^T*KB
zOaqSWpd*adIMfBYF7lh@<VXV+t>D6O<Zo4X$p22;R9-*U623azzpyYiDbc@LKC$I%
zY#K^TVgAZg&-WwW6M1->-{m(NQ(raH;Op0w7-KYEdc=s{>!0p_3S~UgR5^O+t@%dk
zrMTQmXm$G{yInD{<32sm?*FJec7rkEokOly!#9a%yo}Vv9meSE+l&40bjMQ}{j$M7
zzAE+AZ2?!{?Z71DX@h@pA~AUHf2<(8{RfmgsUthqbsKTN?v6Cx!qZMsT`pt!HR33D
z;N3vu6z>mQ{*?uTq?Olr8&-vpO?lxRZlCKLcLO7=$(0#~l)Iumovv>fKH3)3<%)^I
z6KQWBDE;{Dnval5O7AeFI=<m4q>xhgQFmNh<R@W<J9VCa{d+V0Q~i(S#kITZ-D%Ms
zG4;~|zX8*%$hif>TJgX|O>>tk(v=yTb@;$M|Lq5q=D!8XwnPSUkGPG<vWQMn<W7xl
zSL}}!eBMEOz1VAX7Ws`P;`M1|A<0%2=v}T*Wr3bc+aB0nb}VqLY{$WNvyF0k_Dhw8
zpR^2GeU5(?p0C3YTOhA7!9Q>frNHa&*Zg$X1@5Q2{^%KL=7ljlI_aH5(O1Mi5dFOH
z`@`L-#`TG@kM!%xk8FzwUme-n-yik;!ObWq(fztoqTV?aQ9S6mRR1J#d}@9N9r00j
zddus`w@W`Rj)__q{z;6nJTI{$`uR&gzStGSZHtI*@}Wd+=yG9eWNUO1rHYP^eFR)h
zk*(o=IyS0tkeOp=cK<Q4?Zs^W#eUSo$NFt@uO7U~vpRB<cQsVF!d8o?`4V0g)>{ue
z+?`|W2)rKAe_dqjq{s<dBAW(pnl$v$k-uq;Sm$nwY>Zl$i8_3)nex8{M)@NjiY)8b
zJa`kOVo>uybDppz)%0s>*`W2&&9tYVInC3&H<@{l#)uM7bDiq(SM%M~r+wFh@4kTV
z-Z*5qA|E;x-ZNUM&waY?{oCta!>RDzsjqvd+s*&G?dECU{onQ7>2qFBzWd*N&U>rn
z%+-nhvcjjk4tbK~wMSv&(_J4MXRI+A2Q}wDL;Wbx*X(~q+ynhLtG6A-8*>ul*7xhm
ziD`?7LSHl1-*0UK`kJF6`*o$EuNhP9^4-%t$|%4z%{cS9GoDZNXUU#tA$p$U(es?R
zLH0bO`>peS5^eT8`)|JV<7uuSOIt*LtLN!sJ<st*+<Gvh=ZPy%9NVw)Oxg21gr4V_
z-5;l)>vyl2M*Yt%gV6U(K;JWVQ`qX5P2sC^H$|)#z2Jmb#ZfKjffgFCM+`RmpO<ZU
z7%3mWCAKL+_CjOO3ysBFG}{CH)+Nhc=(+w_^g;(UCz!p@Gn>zly-=Uo3-y(qxxT;I
z{~Tma3$<S8RMrbMT5mXo{g~4}{i;6wB5<zRJB@wlRCtwqdaAB1PW$wKzfbu!{8|1=
z>pIZz4P5iiq5ei(<6zl(iq_2)z_qX^cK+2EFLHGab#It5SRWxfZnTTWV$AFQXWr?~
z+z@TG#;ItHW6>HXqBW)~|5$(2TDtO2iNsa^hC$B{d@j>3#|={R)OCNOY<;7m(E3J+
z>wdJpQ?1rF)!^6ty!FL(KU!b9?x)r_%DV1HYx|@A+SPvBi(#wdl9K(C&302=^S^Q+
zs>yY>xK2065iC49<D5Co<^Mb0Df|wNq<!g19oFjgy&9m_R$S}*wqQ+;;;5^A(c0!U
zMcKyf_|?AA+K4(iAF%}2{K+A%`;BC9nj_47OtdXxr9W@#KdT<X`;PB-M>Y<@8<kN3
z*XpwZ5#8s+uFf0M{{A7)xmN|wuHT2zl&c~e^9FV--}3&UFjsV7@KD3|=%}Q9zwS0N
zBj1QF8`_z5^YXm@9ix14o#9<WT~BwN;}&Br%g;V@<XIolsC0Da^|0B~G1^y^h*8P7
z)EdM07DlUF>&~4fMr7~G^S16d7#ktRB)4@%4hU=C))i+?qX&39CKY_}fvfY3kpn*X
z0LSGKif<5(y==Ct1}QOInS^Kfet7`<eZ=`p-hZ{vINLpH_r5{huGq}fA7LbSMj~0^
z*i7%mH|1Y7dtl9u14b*|Xz=4;de`_aM5lK+X&l-JkpJ3V<m2TuuHuz@e17NmGMBf!
z_Hx(@KQ0UN4=Rk8{StR$L|3HYYK%0?k?Wx(8Vfa-z5akXcWdX^9S2{_b+yz?p)?q+
zc}ORX6`131M$8H<T7lBkuV`7m??xJrZi{fW`vUDdeCL=)rgpbSOr7-C)*2((9NGOc
z$?tkyq~a6g1wBs@kJ!_=-s$o5f8Tie6D^UeZ<XWeVjMLYqv>vQ9F@k?)oA*1jHbKT
zXnIPNtI_=kTG*Ifw$b$497faKO*E43-Q>;mG)7vZ=}R!0zF3Y`(@6R|-H9!7G`&iU
zrejRIMU1G2-~Viv*VvGk-Hy?8b5#B8Zg1j;c#D`u)o1#PyGO)Xqv}<SQ^Mt_y0Aix
zgjH}<o$gpfU{pPVjjGeOn66lis=K0g$x(IhrjL-OVg8NQh<ZX>j2uya=sowk!X8J|
zpT!ux8d1OPfYSX%AYn_K*%rr@xz|0G7hx)Lr$)9Db8Ob<2WYR?h{K3_tlwq!(v!8C
zdM@h?x17R$)B7!hF`hnCo{O)<c={kYp5DKC;xhxEJ@Ht2Asb7Nw~eI_W@G7-)H(H(
zj-?Ma^J?HaHI7ba)_6INJ`vY4Y7|}A{SenM<IPd@0oEvb{0T?V`!~m%*DZsa2Wg||
zgXJi?IImu*dF)%vV@4}I<9VvaVNd%k)SZvuNW!V`8u=^%=dDw5@8h)3LitSIt!g+G
z9y?vng7+Cuw~a>N^!e=gyTYgI*{Qvs|F5iP|9j78zca_huPIbx;$@9ztch<n8V6!T
ze8{urRiXL(#i<(;FZdUZiGOq`J}EdFKJbL2;V+>lnUB%%L46(#A9%vi@PX!Nc$wCl
zoWpvP3r}IcMELRBr~QbhYI<{5BRB$nDm-bl)}F%ag44e2Tb=xO`cjR3({;dE{&MSj
z8zYW#>^oi?`;J{OYwE;j)yQ}JDINKy>vS>lJ^1-SY~(vvU8SGWk#BK^R3qQ~`kaq?
z3#)BkY1CU?oAXg`{p#F4>dmjtSE3Hmvo@FGTF)2adQbR|#<(Xrj&U1}a)dkkvcRDF
zJs5ks3{Q0GBiue~g!`<{tcA<-`eB5707ke2uK9j3zTI&4>{M%f8y3Ip_4xMkIHwWr
zUt@%OX6lJXxc9IT?q8TA+&`Bi+^;&0aBn|w4EdCgNYD14czj!oZqu{iy&2n<c^%W>
zPbsYSufyo}85j*W0xsNNrk;hmJ2b}MZ+@bAZ^-9vo+7r=xcTe2FS2q9jqdpZt}0r_
zy^xwDzb}wim5XO~jT6=-7d!i!_Yh*#bImKEcOfE;<%lu;mIf?ZL8QHNKty*^Y^=Y0
z>idTx-opKmLt#(S-4OR`JTbmyW!~31eDy|Ze*1^GZ(;a+HPaG*jynt)$<Z|rVg5n4
zH|{;N1Q{c%+xJ1oq_gQsPu!D;bGPlrdRga$s$u>{|H`~GJ8(oCj*#P>^;>-PZCh{*
zaHpO9Xj&1KIG^`*92H0RDe^nNJOAmfBzIVs&n4~+Ogj5(Bi-g5m2sWp3m@w`!|hJ1
z&(EDb?7hdj65Ot|^Y>CJx8x0MZvxWeU2{A`M~!d2^@z`n=lLf-(KW|AG<|&QZAW~b
z`}02R5K1Cz26PrDuY^60#T^o;%Z#fTA~aa{Rov^&vE8ZZFP|RY&^5>H@efTCsKk1I
z-Ul6%E+pPO@Dgrvy^+@5ZX_pDj%7l>kM1hXiZs%G+Wtk=kE;d+-W&SpsNYha;f~VZ
ztA>`ndSC_WIK3NFgXlD-GpK%LURb-Q{{B2yyDPK%fXg50=kFB;%Vp9D%jH?}o+U4r
zqAXImJT+x;8Fb7=?71wq^`;&z2wjh;)UbL~c52ez+j`_`jP+OaSc@k2q82T5tVMHs
ztVP>cEt;;?B0p-8>zS~w2CEJ&lXYl9=LHu()-}_(E8?d7ypJ2*E8`MoyVK5j&wWAP
zYSP{wYf{O7xF#8`ccCu*24$}{R9y;~btyn~$$N5jX+h|^L}l~Tl*iuGCA=?n&mAq9
zMYy}&uq;0%kP--68-JsB_5O(14sT#1?q(Sc8>WP<OSM|Hy!L`l*XDupA8^GPDhzjc
zwD)|*85#C>b`pKtx{Lt{tqH!7f#{h&Jeklq#r*$Vyh{+-Ixo@toWQyR?bR9GuCql;
ze)NEMz016M3~P$C?(us&eE#qjytj3?I)`n8&mKXfcl5=3TyYIpv;v)@J@xH}T!RK5
zae2MCSD%+yoZx&PTAj~Rx6ql{mFaE8`K*lYT07tG-S@Kh1rP2cyVh<G7;EX6eLLt~
z!=CO9-`{dx;Y#!a{uZduUt{(J1~uZDk;dV^839*vTw~mGfkZ;0_;lA;uiL*Z&@ahA
zZ()?#Ul^X?^ItBX?&#MQ7ZZ+uZk}oG32P4D^iFqVOBy`|7Z>rYPd<Tn+?!a(J!kUK
zp|I>+I%-pdc~@xAx(Lhb?$*KVYTan1_X!gaoz6M*AIV|J5BJ(*fnc6^TabUPgHDhy
zKWND`^JPMn%9o+Ym$PKPBs3<ld~y4`(SJ%v+J^TF@Z6%j*0ASHEXx^hbJ(V*yRP$y
zoS}T7e4-ro=%v>oZ@k$!)+O?Xjv2ZxoaN5hEO%akM*Ib+W8R$VvSOSrD}JZ4VkH0H
zFDs%Rz5i!-4ArG~@W13#?nFJJXK+HdFAW1m|Ji-_Q!TR!`{V6G%AY2)jTw%*bS~;r
za^vNJ<Yt%oKjlw%T^a2~O-SGHAdVphH`Wpwc5k7#{jk?-G!9F;2m6xImeBrlQip#;
zbL`J_`S1C&ad%8}viZ#L;7+oqEy>RgOH$VTO>4U)&KQ|zw#TdwTkGx&^BcafM(-zK
zkv>13-R(|n6wm1{_m>nzv<D30y3HTv7w<qm-F06WJ+INP%NHH7uGmabRCDyEJhY6|
z;`#7~AnNr7Iw~?`y$)Zm-aq~5P*nCve?$|G^@{6NuWCunJMqJ{XUj&k>^SVc+totX
zP{DUYzm2{FJzF;QLHF_oqv5TVmS>M()e5J5`TvhE#Wj;L;DHv;{cHT*)#-BNE54D+
z9G$6+#sQmCFOEkIxXFB$ad^UQ=r5`Bb=c+xoUKLe5Yy%UFukN6*MGuQpFwX!hR-kb
z_v@M%H5K1p@O~2G@ie&_oAET}P?UOOLvukwYjT3ONjxPIZ##nzVdtplQ8JqlLp{Gi
z8tGm7J6gj1@r8+g^;L;5^LadPW1Ly<JdGpqwziRs=LpB3{^Y9q<B>f!``grJj}33y
zQ!Y&dH}xN!-nqX#;6Bpg_N94S=~^`|Ev~~|KRPX;byS+G!<AVxC2FX9WcY`fX|C2u
z^^=bHT=gT}*a|QNdhc5Jr+a|cKdR6efv3UJX{5#5_|10oa$8pWXAa%;i7Twh|6zBm
zFK*~Ayv6Do9sZ#&kmmO+@cEmjH0PytxH1wx?APUu{sQlpi#CS(s@Z<eI_j-P<BeEf
zKv;*#{V(SY=zt%>T%#j^H5G5JDl`wqn||JnQKe2J#mh!v=neBQ=98z8{!o1?=@0bP
z&pTmX{p(i0WKw(nzo4%^;+$Y#-P`W|h3Kh&-m9MaR%m<(F%dCTKi%c`)L+)^J&$_o
zH2%>Lh(t*+KDpKS&-K@zJg&c<BG0ANUr%mKX8qFtRDV6iR@;ZOlJ&3aukVog66}Lb
zM7~@o`|B4pUcmCj-e1pg?63c8u4E?K`s&|cIYZYmr?Ri!Q#rxN-sy5;UDpN6iIMz&
zyPTYC->$voDy^S>DeBNAs6$2Qrx$7c^i*3vJ>H?8UKFyQ9^G7|_0x+&^wX84=%+`o
z_sV{{m-W*VZ2k0uRzKZm{#QxNbE21?7#%Kq>5<J*j=l5<z3*dPeTT7LdL(-3;SRlY
zuh~n#RO_V|JM_|Lp^xrEeg9YW(NFtP8w30g`BC-HUubcof9_d5TK3N~SpR(F=8+-$
z=U#{Y`EjFXq5J0xsDHju_RsJ3xR2|fdp~J#dt?tiV_l@xTXVOb$IeXRoV_09mHJ9f
z<7~lx?r2*-ce2&b6@A<nKiM!~SL@@SYzRlc7jGRze3%@#9oO1}7o?fJ-BBm(?Rp)0
zyK&Up1zO~XNhVsFKW4#H6R)@ZUAhM8slPk=kTKxSmIi-S;YC&F;Ew72{yWW4jL1fH
zogwDo*qY_fs|stT5#@N}ef)>e>k;ARb4>We(~-soyvbCIdv0;A@B96uN4ncbjcoD9
zboc^q;7)4e6ub!)7moi8nr6N&6<PD_Cy|Et0e9*<hul@?eu(3Y%+#-SG<Ca-+#^1t
z{{OM}F7Q!Q_a6An?CkFBBV>VqAuO;93Ee=FZV+gEZ<fs@AdjGE@zHi^(N0j?v_87l
z*9Nc`wYCeQ{|%^(ec14_32Of!(hb^&dP}<jyp1Ba+uq)W5UW`Q@7n8?|Mxd%W?$JL
z)<?bnD|}A&%$b=p=bYc~{9fmGe#bKbZ+hLCclGyN3Z8Lf%B7@W)bDYL21LfXOx2qB
zD6d#r)-~41VHq^i!c}->{(&zxR2`t!_n6I5;}-1maQeQ`(cOlaN@yQP&(*7Y!osk~
z({p+cn<n4suZ!_>TnbsuGhe5D82Z=a{fMn3i4S$4XVhDds+Cf`*qaiuC0vO6bUExN
zrd4#JANAi8z?gAc1||L_Xp~AR?ZY#wTAdU%rS0%S%#ww%4}-prBumvRT<95SPW4jv
z-`j?Kmf`vuhxlVg`Ch;}3Rtg~?@?iG&4V>!VPVDF+$pY)G!mTA%5Y_f!L&xU=D_r8
zPQCwI22Gste%@nxpyr6_VQ<LmnbB){xHZJ!S)K<^)5H3EF6A4c%!mqeO%LdI7B`GL
zFegNsEU!g8Q@Z)NZ}u;4u;i6XYWYJcCm<$iIJqdkKV=WsBF<H5m|}DJRJ=eeH5D(~
z2rFz{MVE>ZPGE#3YEEOsnhZwR(ijoRu0Mkjr8yWu@vijt6Gj+$KtC*%5k~k_jGzcy
z<A4nfav!y=3wOM;<ao-};{xs`)S2=qB0fDUcgm8AA&VO(9H<S|RNAn2E;Ca6T>U$*
z^;55&N1QkMN~YX}8B4V<kd45(PW3K9NeUR-3G@E7VcQ_jm&PPeEW$mrihI@^+{=#6
zRwImzdpbWLTB3YFTJqh3v_!=_^dmz{_<iVwBb$=AHA*rmi;|qdFfaWkdrPAu=~AL2
z?9S;>kr~6NNEB3Lbef9zuxdsld<q(p{xZ=J_T>Y46vQ|fR^>gwP^BUE3=M$|h0zdt
zhQ6dz5#wN+3d{GRBb!b^M|4;ct@!Q-q7@dR73rRS&B^+ip%hgbrSN1?im7?<GCizA
z40Ix07tsk;{=ulk!qcP@1o2!d5$#@+fw&D2-^?JMp+R{xBHebP5gCYQQwT|eIMIml
z1!#m<qY*?OXs#2D;57_b+)$)ai6WvB>2L9K*_U4LCrV&RWKjw)?mde(dx=hfMgXTe
z8woa4Gu4_;B^YMuR3c+{6k^#_f{V=nohUt}JVkuS0)Iv^@-0nnv__;2=IzG&vMsiz
z2-8~rFd*)xweze9muab2Ut!=}&tVo=wo5zywSgPj8s<E{p`V6n1zeVYs8W6^*&H@S
z5t+~-C>O8drbZh938}*4?0pXJ+>3j2WRhU?yQ19SDUErnntE+Xfvb_58onLpL#C*H
z|HtwLiOp}LqaM?teLGFju;NI$9nYI5^;%SY$@EYqqCM{0Nij4<*`v^xpHb*)t>3IY
z^Q^o~mUeW>Uc|`6-{6ddv||~d5owqakG>6WtV++J=XVmuNN6jof2em#!UgUD4rUiO
zzpG487Onz^3zo`91|+v}Gj~5YUr$FPXqwFu>6HJFDv407eHfvy_unUTiD%_5*v9p^
z1#f6=;Z1)#WNPo(d6zOe<pM|iYn=6Cpr5tP(kZEH)}C&vi6T9!V;;5U*u-*i;bqX7
zk#Iq9F$sn2$zAXrSl2ZgE865AVcuw8Xhae>irdAcWQ3I1kiE`r&iW!O*j-(!y?fEw
z6&F`Don7GrNXX{S*6womqchqzWE+LEiJMc>lqlBj=0i?Q`z;uynBSRFxN1JKOA!#O
zhhh#imm1&|K(mC!S`bMhgKyudeEHrni|dWDvuT370kRfZ$Bhw#7Ew}{sSQ#1^^K^R
z>$nZ8{{vF8loz*p<cl>a#+Wq%Ld-<%G3$OBtI&5E^Fpx$sQ=`TvbJlT+W$%Nc*I*k
zgjlQ(3K22cY1pMyV)yn`tow7CT*yuQsmJ_^U5!j>R{sL-4pH+BDQshA<NRTdf#V|^
zgZY^;I1#zN&=_=`h}>a*nT-Pbn>`AJ?Cc-S7?gaNW3YEM_N)U3FSg5~8)tQ|uhk;@
zR)*%AZHIVyrDs=+f8*M3G~kyz@%I&vym4)-D<}}`M~vsp`b{)m+^|OOX`=JbpHfKU
zpjlvr-OUkfmW`nQB-^u<A0zBei1X1hl66C$3tN))T%Ct|V`cb{M;$`}?kw&)?s}wK
zknVs-@pbC|`?cTe5YM}l+o@eWh432ezW$fqe}P+q|5QSCCDhy?&QrgRdkcx@uT%5a
zaTUCmKbPO7n34`2Gty|>DsE=pKnD_3TAEk-8@1G)SNe2<yWhA)+_YTYqfqakNbF8l
z6q|c<OSdFg6c&n>`=i9yny#HM1<a9anz$22?^y|@$sAFd=BV{cdG&v{U}+mlYbWKl
z`df)bE@S(>kZLY!GDWOOBe#;CqV@f(zO76wz}FTu8QbX@iMuF45fr2;ceRXCzf_X<
z{e{|n(niFPUs<Ej+3Hekp3~UQRpShIDO&oJf^SS0?)$7-gEOy&nQCeN7`xQc{N9dB
zlsD~9P2oIfUnoH5%UhE+ZvWp*wx^VPj|N0>(>&P_(R{WdMsTXhS(cz|PE`nkf9;1C
zGB-~)wu_qrExV}IrsZ-+<KcdKI=|<?@7MXy#jc9h>#8eOR$NwH@n1YQ?l|NjT93O4
zX(SsHtpjJ~qL4cm760VPGsM2pL!!X<V)iBK5%s~7o`r?hcQrbHiaO8mh_8%PqfXOv
z<Fvnbo&L$T58O^eUf;V;{J(dIFOSsHf2{9(oz3%MkLNl6=y=|{x{KQomCKrn5C!jR
z8kI!+6wRkFw41H{`gU?2%b`b<o}ElOGsIc>vHli49(;~m#^>nqD#g}3Ill-zBpcF5
zJS$s1m@JpbcVRALjiQCSg;|$8p;gMWurv9kUCIl7v6okXk31iACf-)KsT3I=GsPin
zAc={^hljlA=tL}kd!;$<n`rl#du^4*S9nB+2f<Y(cU_t|MVn56%jf>1W1m$gpNDs*
z524QCJoU<0M-B%)HU4rNisT7REwVEUD~M}I-6q$#gh&2`%0qbBi*cW~$_vYIg-7aT
zc+sMAS5LR#;-Fi&6=|L;SO6z9Uy&<waANqpuO8?zbC73ep*5SZgM{&N!cuCFqnj%?
zxkjNybVZm-8qv$}ZG*<b`AlOE!7IZ>SRl<Koq><Kv+SELITLM*Y#rRxUnuidHKRA8
zJfPz?JkF?Y@44~a0{liYU+T;GQtykb2JQX9wLE`5H&`zoPR|m~6N?M3U5GE$gHNqS
z8c9yBhHaebsm924IeMxoS5Jj!8+6pCNOqwJW~bIu$@iS})PvADA5itw`&2!ZdPh3y
zU15SIIFDoAH3U&xQiP5=sW;wmOPub|C@xZM+U&lrrCtOrRpPeD%?)3T^LWmyu=|h5
zjR~*9yHTU-S%qqB?Y3->H@Hz7?_Qn~XR=bxbG)}RDcZ&-nAS&F^-POb)m^;`wTE4;
z^-oCauGNWy&|Y;-(zl1bDd0`s&1xO$W@WEJhoqjDsG6&B^E=R5dsF2-&|7^>Z#8X(
z)*9I&bN442EfFax*=Ur=BdbMwH=}=2De0f;Se{b<+<BV%r_S5H*ELqtL5ntyUMTLk
zHBck3e0#rDMq2sy@6}(Xi9#p6lzE~T<*YA_(qv;5p0Ot2mk%l9i&JQB4cA9`c@3=j
z<e}qG<tH1w*rAiI->s00F5E}d*8p!F(o6HT(vkO<ec1Zgr#h(wZQ!HQ%Rkjghx5-5
zs*~QQ>ZHHO(@AMx$cL|!-UR*eW^S#jQC`P=U;Did=T1G!b!k`oxL>EsnN~_VX>X2B
zdQ5%dgsO*f&_``)owSPo96zt1PWqCnFXii`zf()|b<$_^bkaQqb<(aZopdX7(oo<W
z^>1B4&8)p(>Gx2YuZONpe6eYfI}`|lx;D!`&{;lcO_sp=d>uWVr;lEjScWeL@zh1K
zAAjksT?*x(%O0&44I3_f9~x>7m4zRq4Z0pzrPEejPpwk>lCP(F)Y5!Cb&^_|ucwYl
zl+SOLtF$PW#&&D6ienn8AwsqQW>qvoLmiW~w>5V^(1)R+a<NyTi~bxu@d+f_e|-af
z7b1<cw^iqhpX#P$Bm2Lqn@)gk`U~aSEUBOQzAKt;nl16+v>;Vde>E*}=dKqN&_Oi4
z^m5?ir+O*d6Ofs2|LgTqRg3xP^wLBzkEpb>nkcRT(@KR1uSJe!dg(a{W@8qim-rAb
zThoFb_bP~VJeBq<Fii=25iD30Qn9x=t#7vO*^?BCXCBt=)Ktd|t&V877po=Ez12R7
z&^EVWrH<*Fxf-t!wdHBNdej2Ft(@mo=%xP&z4RH(0}s+jwnEZN@9HwIA1xd2GepkU
zG*c;J+AhN8LV5@LD>9q<J$W|uVW$K3H7vlIG1fy#=fuh}SrI1oV!hG&azm|pXH)u)
zQC@;I(T3_VxGz{<YM7?pZ%^O1B&Zg)M!ZihhDCs@=#>qd_9&y3-;o8?>yXXuM+U@c
z!u?&1<_NqWq+j$uBa2z@(brfF=BSjj&Xw&6#l?<ej7mosCt6Q@xXUh&p1((tyf+6Z
zipHe%;tpeSC2v@NRtvu#`qX;ER<;IeX!pqM^odDXUhHCQvbM6w#m>ifN{~icQzZNC
z+O8sb{QMI6Ddpxs#dP|jVLj)*H)V6Yt=yZkI_^zbaAt=ToY0Lc<SY(1)<d|+{D}fq
z_6TmCfGcRovD>M3G0jGE5x$?HkGXne3j3qS%2q^Pwrcobh_F4~Le!AcC$TH6u9kAK
za;;DJNuTZcQQ;O@E#|2^e;96wY21RnM!S=ZTT&XgpzCY*EeWdS{ot0U;a287`r3zq
zTSxP7>#OSxJB%lu`-YIlEkVOAA&pyK&4GjResJsF4(t(|*c3_c5t~A@J-Lz-BPmcZ
zTC3(F;#RMUMVzY^Yt860XV}QC$Jv})jN4W_7>3n59dYs*A}idKtlj=X%$2p*pV=<1
z23}<B7P))<KMZ_3nYI3(o#)&=1KjAgV7C9_>6TG!eBND6Ck>p;j*ZV{eT!>qZN$;y
zBH=yx9^_wVw<SA&x@{=*+=tOFI!PdVO!BV_efM<B{x7tT`*z0P#Fv$)zT0av7(?-<
zsI0U=S$TmnZ(do?HJR^l*Jkp*to$dbEny|o#-6M^je#StZ&c<iQ06I6Hao9uq_GHR
zjmsygEu{MrKm1Ks(R%EJw_Mf~#R}axNSQ^+C#)PvkBS_zZ&-#kXirBdV2d=V^q2jG
z$Gpo5Y2#k3PX`shY+7&G@{V#L{2r`Z_750V6eXwd!um?GZ;0$XRnD_GegP~~o!0%S
zpCKy1CgTN7)}&Qf3a@dty1oBzGi+W(#7a*`Blgt)d>g#=zJk35f*NI@4ZiOB{{43)
z@@9Vs-*$9Yt7jD(lUDJI@DcRLZh4m4PTxd+?vYe^R~dK#oo4)cKj%8TWgV`5ntYd|
z6&jioyk}M~>(M((QKwytWv`#bB}I!Kd@uRZ8s*&9^-{O3eO;p*wWsA^+MC;$<=akQ
z`&`{w9K}yxfJB@7!$?&~g=Ardwb}cTx#ArsEVqgBA5#mB?J_}%JWkfZMm}}@RJG-A
zD;}Iu%$2i~h{Jz=9^-wJP?W5*{$arM-B7?CDev4rFookzJl8rIR>A!PWt=mze_%XU
zioavH68xnThj2nLXOCDq$7~z_SQ+3cc3?f=D@Dm~(b}hb8sxe8@*MeUb)1Wm>uki0
z0TC4{-k{<%M|LH}Vs7X}8+m<G&uQ)FwYF)U4y>Aq@NoG<+aHf|Lk7vY@CI&I(opOh
zdcN(qf1(_R9Fy>ArHxA(SKr){@!InZJ=XT$f7*>WK!)C3&|Jbp_q08fTF#X|M7tiO
zm{Fz}LEMlX-|__<IFE+M*Nkm7@_5z%`#XMa$lCUR>eq<6+p_EChW;na&*A3|AdYR5
z<2mzK)YpWK4BSu*Ygp6^Du2OTvT4jV>?(GS2}S(Ap>FM7T?^;tTk!<E^x1iEeC3$V
zb+I-%_$Q2wH8T<yAodW|*07VSHXXXT<*4S9=rc_|^bj1=_L(QDUjCOo{uKJ+i9eLO
zi5uA2=AYJkWMHxb5u|!uol~|<R`=meiNZH`8`VE0QjC?bvsSIciP^ha%t@EP&du{G
z_0HO$u@yVc(FXeNZg^r(;oJPBF{<AdpWI%k&M6T~lrV?)eD!dq?Y^P&H0V5(`WD*a
z8=9kC<6I`sMLAD;a^UFB8f%})mz>bXT5HT{Eo)(|vcNejD7B)_I!oktfJdDxZY~Bq
znpJqLO~a$k)oXTOw9q@=f=G2YXk%N~!mH4z!)UT|E%?fHv0iyoqDJ;5cD2-E=Cq;p
z_k|B7xY&3Dd9!;s+a@~O$}bT{ncJ~8WiO4c#_54~%Rd>kB9fo8kDWXPZy^<%cv;20
zO$_%0Xr#>n-$WW?8oA(ZRu8AvLnTjRylE%8Ngj_=K<K&e_>1HE=r-@xdXIikd@8!n
z&pifzoUqaKqW=85Ep_p4C*EzDlOSx=N96_c*iBMwf%H^2=eY*a0!ncA`|y?LpwHrD
zdgBEru6?XCDe%}klbmmne0LmQ`54jAF^P5EXSLAj_CAZ$O8a=|tNV7c{^>1qbd!H>
z$zNHUXkNYryv@wY|LA?KpXTJ$_|zTzbkdh!LaYOJ*35VOXB^PiP=~Z0;t3aGzc>zH
zw4o#OcYR@<-;wU|zY~7C*ZV&k=Uh^xtW#1WXG_t#$D!4h)A?QGIW`8Gpi!}Qb~cVe
z8iO<*sSL>litGYKc7r0X%iGmi1PZ!09d(5-Kiuy(a_X5>Q%9h~Book>;C8kiY3|hc
zrVo5`uQFccn|0uuu$U;H0pC2QAm1cURN|ZFRJ&c#_~!p)_-6f2lkMP}Y+ZoyP3iIT
zu})1bI0Ntax?M`OwsQ<?*lKxZFPUYNwf*AB?SAoqJ+#)3SQoXae)dd;w|Ovr0{pAq
zFK_!ymOe$i&6DMo3-ZtX6^ZnzLjDGP=y|gc1APp)HnzbQV{P^4=s!#rIcaW_>#&bm
z=WOQ4O9Pxl*hFW@j~?O$oFk8Qj3vjGN|^EGPx=?cn>0V7u5NKV`QtDQeJJJNFnf90
z!MDO`#LVzZjLWn8HHn`Lnyf#@F16+c+X2qyCOIWMPZlB)&IA=EvS%3{OX|r=z*5c^
zc+4-Vk>xn-ic0kpy{G5tx#!JeV$TETecW9b40BG5jwV^k8mm5xQRxWd#Ks|2JYJr&
z;1Ae66~#$*u;6u!QN}3ZhSF|Hg}0DkziL!hShUtPde!)o!YUpf*pbH1ELx6Hxh>Gy
zSkbhFWUCa{<(2yyU6ARXX<^TVT57Q$f|at!up}Aj5iRdVo<$JkL8l^(DPZ+;jUKIz
z)h(>Ft|e1iueRgu7AYuZ%{U>J9i4=Wy?}miM2aA}kP68?Yz)H1MmdgC0UgR+GPj`v
zJ3;~+s1#@y=vn#Khq(H6eoqWK;_Q;eZu$1WQ;-!)asJgy*v&_CrLTKugAn%wxrfb(
zN`-sa1H05JMM7UZ3X6H%66_qb@lt@iEIf)U;0^9QDrvD+7k;4ji8<{XSFn9YPtiWB
zDnn+suTm)=GGJ$0b{m_~MzV2@G=}8oCc>iP4vm+63Zuo}m}so@9IktuyzinaE=>&`
z8sPacL%cx*Z(ZTEmU^eyLU;OY2c~tOoau~JDG&PXy%(49GoOp`wc?zi{&^@j#W^MF
z=lUGGMb*EJ#ZesD=Z^G@9VaH<HVT?Xx#fy1O`}iKG&V(wHe3pdSp`kQK3vm)?djgs
zG)>d6YMO>k(=?`~H4S#=6z6G<*F*As4w}aAInptFO-s`{#w^k?uJItg_e@pKu&R1S
z*NI==VL2kW`N4>~D=njKAX1X1ZA{D3HayTaM&)Q5;@q&~NXnDeH(pEY8^xU&ZR5<e
zwlS)+C{Nq4L`S`+wqXNrvw^qS!P_?FX&Xft;S6u1SwQ;6m!WGkBfSG$S&dY43Y=kZ
zDpGZffN@fK&EdPyF{ZDdUO>mV{m*~INCz#5<@{7AP!aJ!znG@#7gJUJ!pTjBHc`rz
z;cp2y9)BI&82q(!qawCW$F`EkoLgL5p<#H{xQK4j7=;Huv(>$AoQj`sw-hC#66~6!
zUs$D}B`K;qnJtmss)q45$e1kF8)+DSZ5x-e<meY=jbG<>tNO)W=oggB=obRwH^EyE
zzFf<(DnRf5xNYyBNG3M)?pAe+Hs}^Xt_->bofvJDNyg!Z7Pft+vnj1xG_-xqU#d!j
zcS5%~8D@3PQ1n`%1%<`)#W}A+ifx8gF)poDJe8JWo1s;V-&6vvqHNL_g|v$8d0Is?
z<k)elR=`)5K&x0SU-hT`DOU%Liar8~J&d~<)qb&c9O_xP``wnaR(TP7HeWMv^^jKJ
z4Nio#*orSqQopdTo5o;V+!ejkKL$F-R8{9F@0_+}s;YBLOY0odfER>kdm*t+%hD*O
zsv1T98`C1T=>N1FL92Psm!T<S;AQ|6sUApd==(cb-)+z+7Uw+ox^{;_&X<N9H}vPQ
zN7a3FZGx?Quv#k>exEH`8H8VSq!&=|L6;bv)+N@Yq2PlqF{a%CC`_1S!Dw9%iFA_M
zE?t}OVT?v=P*@k+DhHuSfV(K4*+II*L*a)pj$W>4Gied?phW~Zi>gJGMFl#8T%HxU
z$p84@4~r)qj5tQgQpB#}jamC8Z35T^Z9<C8!frRS_ea`}$p|zFs*5y<vZ$^_U{?ur
zmv2IMVf_^6=y+&_PQgakqe<MA=+9uBX%hNVpV=`Fk$69|!-rNkLz7@*@`8Dss!8nZ
z-nED65kJV$BW`+ZOO77#HPR!jlM_d?^oTPwJ%X265B1h8*IJW5^ZI*fpYXW9X3O{I
zC9pd`Oqe(=J{?-cCP-PCi0<F<m!`FflvXRAK$Li<RalcEzZ7R-X6qG42uq<?6vrWh
zN1UBjRj;r{>r~HjW;LOe11`arGws3-ZNh<6f>es+RN++)8e9$<Tmc&V-8`wd=tNN#
z4L%#XMF162OyQCEG-$5*co*Z0*}BBJnl5oYI3wv2!#Sg>OK6;t=@Qm0OqWnOV|`JQ
zI3v>~7-!7r5)Xl!YPtj@w@71-E}@oKH`&_9PEmCUg>(rqtxIG$m##~^U(R)X-l*M>
zB_9(2-b<I@NtbA?hYq1?6G2^@$i(h@x42C{tLX)Klx8I}MIfbfm#4(<lU_hNM6(20
zkt5B5X%&3=PEDU+oTsbXkfTx9RgJ=k+3%ht4$~;A6P**69P6-=PO*HLPGKvkQ#2zY
z-8$|uzkmpMLeJkxp9o5jbaj1#c3d-k!jz{^n6vDPuVB1NPl;coPt5%Q`h+K~PfULw
z`UK4+U7w(y<m(ee?>#DYCB5Vy*C~F7zDJQruW%uaJkL(0Q~dK~cAi<JV*>g>{|J{q
zNSUrjQ5@ely4srT^8fQU@t&3NMVy2^yJR{3Mr3(sd4yu^5-e7FN)FO5i?UnZc_a3c
z(KXIH_TB<L`$#IHYE~v#;jd4$$rn6Er+;%2Bs$-;?Ui!z{frB-zXqke-5!~=iXXHH
zXUd}<=xpR%yOVse>2P_wB~*PDvqNEjjC=pUWUeTAx9Ex#CGQckEz;vU$L}b6Z1Ofp
zht1H>%bQ6yoI7o6#rC50(^Skkl3LdFQp4CI*;Z4sxjkb(L!F^pFq>?HKF$%40=%~v
zd@f^M&3?`{C_uXsyjOYlr<%ehbsScw*BeLzB_3D&&_k(vxQ9}AJFZd69+Msz54qJc
z^Kp69!}}2l#V4E4SG4oX_D#ZuqD@!@DWCk9`GJxxV^yhX7b4{Fks||RXE~zW{WP+=
zH;z-aWRdl1xvG<QHcrdmHJ$cqIWjQ%Dt)&ov+S@r^o=YJ9J0=Qvq1DRE|!8GZ~*CA
z;MWYKk>Z%q`nOFk($+Ez>v4iQIEfV)f&RHyy4ADpPZsvP@S<MQOUajm{?U5l$9*ol
zZbvDSXU~TnrDL*;(`HhR2=)TsL!K+*dYnD2Vvvwvzhq09)4fl%Vt9itMObA_w56|L
zHQC|DUY$r|vldrCr(DBrC->yhx~9B0GPEuP`w8KJURSmaB|H8^t_|ha7}HXuk?CBj
z_?=bv$+xef+4+Z*w`Xq)*^s!1BN%k@kyfX0pJBbIt<WUH<Fpl-pJC52t;kF~r<pUf
zlNKWdf1J>BkbspJT3qf(Bkh%;TG^R4x37{~*C%$ZqJ9MT2vNszuGJIYwTcg|Rp><W
zfO-Z2-f8X_6fJJ~omC68Jx@l&{@UAuGjKRZg3*lNZg;2yZ}H%<66r7wE~KBFbNed#
z=9P(13(6y_19dI`t+XlFMdi01h`bHLKf`qB0QL?}bzNlQU*x@S^gj)1Q+k+l2TJXT
z)w`_0`qH9qyzAx9DoOEGSJLS_zOvTW`y0Ah-@NGC?SQ%{+Y_9NPe`r&dDI5h0>1jK
zms2fL>#_z@oXxxEx?z2)os`JDoq1YnrF@eLU9^0_ws3C?S<nOhwV^KbP*i)!hn|3U
z9p_rs&>z3sKdG1Axllb7=$uuy)(0_WucSop07mf|iT6hRqYiMDucRawy=|38UwN_;
zatzwQO*16M%6x*GHkwAQ8U3sN8r2h=(R#V__x)2tE0j2DSt{|B<6h!Ck0?B}A0D<+
z9&IAX;Voaspk%C1TTp`&2r@XYey9t<zF_ZZcX^~3wGh#wgE~fzjDuY9-maVAS35zT
z3<+$#%5Tn%xN}Z(qv%^qW>25&RPMMRE0Cs}yGf4cX0mmiq7dO;HQ?hZqm>HT0=_Z*
zr^)YOZ?!WpdE-x$_k!-0V%>V3RJIXzhQRoZV>?TBlx}x|cW`cDi!oBS&%Kpw#mpBS
zUqu`k(f6feJ+}f!r6Z|@U014nBnS;}0>-x<+FLXD2<bw8>BqzPNa5!)e5B|B%fYKu
z_-~iL1HUzUgsok3uA=03N7*AsQs+i4Mf@rWysz1MM(SQCX?0jN@t%?TURCK13FBaa
zCfe#0L352`&=2tjc~n%06d{78K`KhNN{DkG9<yci)>id9yHrmp@CWc0#PL=m6#|#l
zSS=+ghiL|PAuYy-U-yU{M&~Z)=E>;UF>ikd9<mrTi0u6%;{ZEDV8@9y*WC_G(4~*4
zCVe!fy!OFPcb5Dy>i*I!3B=v`%`6Gz=J=9hcX93q30pbOH{&L`Xd{iP2uXx<{mWxy
zQF3js*X;kg4B~FLMJ8RtWRQ#m;vOb}lmQ9>d+tj3nC*~0woUGwLe{B;c3L5DsS?N>
z*Vd`3=6EC((4>#$z?w5OtZ4$)&{~{d8ZLbleon`l2Kg$F`5=pml`VaISCu}lQE2sd
z{8nkh7**~t4c?_n8#YK9Lito`r3*61`ZCBIjxEJGGDq>OQF$`Q7*&&HYvPQax!w~a
z7%mm581;ETFXQt|5=Rl>T<Bbb*MKX(L?WNxk>rh!n_p+^CPe45b(4>uU%v}}y`J%F
z+j-YOP6-pg=E1LBlLYW<!+pl}rpO-E-gzv%tHqJBsW#3(X&igP*^98Bh_qQL_-_e4
z=W>%*#xtvYkXmrhao#ojKCE>(ex-41vUkS929;xTLr;Y>JX@SZvkdPvn<f&+o~3c@
z&Iz}#qScZgY5baMcsR^>wxDt}PN6Tc??k|>t%G4JwM&dFL&Tl6;MLS7c&WoW>VswS
zylbRxadxtwul~$odXt-~O!g-^0Vh4YG^=}AN~|`@qT1>t_%ywXsF~>=(e8S&mai5M
z*QZ1~a_6P`Q!SLIer7mztIDazkbiB?`>dUH3C5FYtx%Hr5H}5SlYJQ?RG~$#d;Dd+
zb*t=2_>ny0l~J$jMrCd&32u6$v>ht|T;&>t-n7YMQ+7w1BUcy_lVl;mRZPHIKl*W=
z^vpF*diy{>^;3+#qe@KYT|=?2Mi=1FLYhO1Du>2f!#Fg-!jR_Byvm`eb|W~nZXq}o
zeP;ed4n(T?X487jPO>gCb$fBn{%^9vMbYvG`I3}4MLU79eE&dE^EUty#-%IeA_Y8p
zRfb155Ra}P{tW(Rn+&d88p!Zw;>@lsZqO{^&TU6arApZtnYwk_HYPLSdt6^Ge~v6X
zC4aVXmK;5=Fn_kB^*sCiR!~}<L*x7g*%o0@r#V;oV>aT?9mJ8*L+;3c%MEG4Te<_D
za9F#LuGk_MJtW28{Xe)?B+g8H*&a1Srge(j&A;@@&h6%n#F=Rx(JnvI`!v4XL1iY{
zrczNByM^_c@vN!uNrl(t@MSOPZnj4Q7b99b5?_8lXPDKWBHk+1^M21*$oJ<ZzlygN
z8jZ|3sM$Vm@ArAs6a$M<?Iya<#@?f0pI%OSsGcX=%Kw&U7;ogvq8w}D&k6-3?=J^9
z9&zKi$!fH+r{;^vD95}RcP%EJuS2;#kO=-dRf71iPeSsOy!9zZF~hH4LuRa%yR_0$
zt#k(@t<|Y>!=vTxDkXSkpeVdmd&Zl7vm9?es+GFZrBx_>L@V`ZrIw`6$h$SYR?~lf
zotlj&qr+-F7p3=UrFH3A11SBzR_aTaE=1|wT4|G3`Y#LoZ`Js|9rz*aKBMJlQp>^{
z<YxxXSoch7Ww=dywpn}j_W4z=+b^uaPSsli`vwG;OP0>uH^9~H8xYs+LnK|o#$Tg`
zTKT5DH-DYF5~bhJN|&cwv=XHhJ%h$Lm@d5*rHWRnXr))F*K(>A*R}GmQ=<B{6-_G^
zhXS|b{a?e^h3>F6*iplkS`AXVUV`Z7wbEROUaXbs5dC$EptV>l&4tzityG5=gG_@~
zs>9pgw1{{@vW}O$&ku}in=jX=^l>~F&vLK{HKc-5>b#ZmuLk%q!>?xSPoN&Sa6S?J
zT9b|fm_RV6GmmK0beLDF*K&%Wof#jBp28va9~XNIhS5JG^&!QPeu1<TX)DsBNE?w>
zBVCEK0I3dXI?{L~0SShF?hT|vNY5a3AyK^P4M?{mg^{jBq8R^8NOO_Ok;Wj2NUwpm
zJcjf`q(VMUv?q&JWY(tEahRc8NARp}NX6<X=>BhrYrD759xHm+h;w!A>eB+`Ew`HU
zobq`SY`P)UM$6vVd$fyDyR0)3bK^s@?|k}RSJ$WG;>OJS6kllGeL5dLoexBDKb;T%
zD1XpoRGTQ@5C7ezlS2WDYs@57kIdv$NU2h->{Iy~Nd{PfgapB4M9y_+Kp1mTSr>d`
z><5;nT#mE4#oDDuxzF;m>W^~MxS1)O+xKe!?ThWM+XG#V^{|^8b2zKrRj9P2U}@oJ
zB|OW^Uu}Zkp-S113oT5hIo0z_M$0_QYGE>3ekqgD@=KYFmMJYQ*k)(J(x&%Oy0GB0
zg-e$lms$&r=Sby+N2qWq8zJ(qk-V8+v(loxQdRmxB<h8b-;P5D+lZ7eqmh5jth7vq
z{jOR62%qhXZVPyBrCnS-W<GvY>Dp^dIz$Fp>|=-%E*hat9SyRwzad6J4eBT)r^Qtn
zZ=HW~tapGL!=9&8z1g!xYqLJh{iAc~)AvRmdwb{}<u9<kUFc-dl?AL&OSOEE&ILE6
zVfHB;K8d`H&7Gnq{_LLDn>m{O(2@iZQBr+x-)m**`&KD*w?h7p3!E-_v_|3Md&yVf
z!<=LP8`|Rd1dYo-uPs*Ki)w{1NZz$ai#Wm;m12WaaLHw`O}Id}9{~lJ3LJ5KBzW@A
zZG&#7)M*{8r7EpMS5@Ddf0SQ*RQ3L&?I9VG;>;Au&iNuDz@9{08%U8RsTOp?aY;%l
zZc(JN$?nyT$uqF4*1=XS$@XbXMtH&ruYTsoX-bnWS&Q=@yBcFTQmo=?_~#bMKSZ0T
zH8%&SWvoqJNVass27P;TmK7G#1kYM`x^nH8j!CU&yl8h(P4f%LwuQ^@Sp219&$Zqj
zxGYX`ZlU)Il`=`|8zkpqW~nlmH6!N^uZ2B-wJw=y&$7}L1xvqBuylD|DcT;K`C?PS
zmKQE1S#@~(3YUKA*gA}8=?Ek09HIP6$C_HJUu075@Gp&2PIB(>rwf;&UBL-2O6vD{
zoQn=9%+a7=WKhuWjnc<UE7vWdw?h_Qsma4nYcla_{I()}5orN%c`i~R8>OzN-6el<
zM0{r6&!5l2XUji?&*m31R!`>VM%X$9I}`N18UNTX;mwp`b-&+Q8GgL~x0+gu-}Bo9
z<Key6b(yaLM$3>!iepSP&?sBdwp|l^TG*-pof9}qrCEEA4*5V6VzjSdB)au!J)e#b
z@r_UM2a`nmr^^_h&aY4D#;5Z_pA}de)nxBa=f(fMc|m8Ntd>6u4_(NjwV^<jjFYfT
zQFv^V*ESzv>+&za=VTdluock3c<hqzfQB=<G8$vHefNB8+6RSpXg43_rtr1Cqudy7
zMyl6~wH4hXnRC4eOaD?>`X4FAiJr<xw*J9>ic#xVbt^^v%jd+EXwEuSg`IQ$L!k5R
zNG_z2WM7hrR^!}PcT<Vx@5V=@NoXzB8PHmFoq;q>ZheblDSHBK6c4U&vNZ~i(wr*i
zLf!l%vL(~n#Kn`bHZklJcg~INXzMGLdOWSSJo~(B{d76v&0(~4q?o6qN7Jqp&g~8k
z`)YbWknXKbo&~y%EO%{No7;#5QQFiYbJI!NXi7;othn%&vY(@mB?p>Q(}(wL*f;pO
zf9WTEn_BMEY;zR(L6=6k*mCrz&>2UsU_X(Vj@`;f6q%hZk{vBugb(p6d9hmy+5B|7
zMZRwr+4K-GWZHveKXP;r{<v6t>G`s~N8_rTe2;%^Oc-qA>tQDvsm}O-AdD&N#tM`H
z<KgDGZY`25`lQE9q@Lq4eQj*wv7e4gMOdQifjN>)_8GE6+37+2%YK(vOwj7;SLCm4
zm3YH@OW5OSn~u6}afiNc(b+=l7S3Vo7A0Kg3Z^%{_qv7Jdc_qKy}9#~Rxotj$+ewZ
z6h4^W)@&a=9Y^0QM&3w%FFM~5Wl1TLhqX(|t9RI3L);cv|Ckl$6nYTO0}TWFVKKz6
zM?+-(<DD+%mvb$=b9Eh%s1)1R#>Ue-30~sC+>tWm_+I*C{ah~^SxR3749WMh&>Uc6
zrGL3n|5gEL6!sCKv8o;zLX4z|>7J}YPog;El=bEqo%#x0v0C-2q<&qb?RRNrvvm?Y
zhJB~%Q4@N^{H^pJaWMt`AwBaHG!?WZyB(FvEbY66aP7Tf#ehZ+t8bn>i}k6%Xq~D)
zq7@b;niZ*&%}1Rk0_Wt5x>?()$C;LM3Bs*>j6Bu1bX;DGSjKK}Qytr=UZUgPVYTU)
zcO5W~@tBhN9_&=4H?YfAh1u;mgMj&hJp`X<p`F%7TAU`;e#D;0#z`TT9Z{Q$g#kB;
zWt73mFcqc${qafD&+PDhrgc{~H&|3{HUkWZLBaDZa=4-02p>_3Lv^=b#8=`frKWY)
zF-V1ID$!#R5tpbpnbmzGt?pwp2t}m>)j=BR-S2dX@>s21#t5C?I~rH;w)VLgUGQ4s
z3eMOTI}H)T7TW?BVr9{{f(rKNr`syT_&Sr;S}sPmF(1-&B*N*DzOA>L_Q>fxq|mc8
zr|q&4(4}}G=D0LJ3ad4>qO_ZHb?xPmJc?V1dZV?vcL~9Q)m4yB?-fHf*{^)**e|g&
z?aR`n(0t`Jg1L0JzofTa;c9SVv$|KTxOblO%hJxjuSVp)Z+F{6lR`i7+Ys@MKa)TE
zO~f8DCc^5RVX^&2rjaA@Q(l>`NR4PL{*k{l(PENga=kLBRE@q6)A#$*votR20Kf5=
z2jmTcU5=o<<_N))d4<%!6>DYozmDMYZgX^$w%54Lk67J^m&VS#=CQAw;iA}Snm<*W
z8#KOL>>{*_;5i$KcxRz8rFPgb$8q+ry9}}V=}kIEwM{_`?n{1&+?~Nkf`#dA409u^
z2P)^twBHljqOMc6IH@O$Z%|JRS^Kc5C!*F9^Lzz+D;aLE_EY>WYX6K=v|pV=@K2*r
za|Jszx~^j+7t8cJmv4^*Q=RUugA6<wahn_x?apMd@u@SF-~JT#E3h%AD0)3+6Lz9t
z?<)4ai->Y(z+RUX&aG-ojM{VTP3(rKrdj=D^5g}5v@g|b&WZ>x;2d*CJ*oGt=yOKy
zb%b%5{-^Od8&T1t@?B`(Xc@3m$De(PC?Q%TGHU2X%s0skv0sgfPH{|F?#$4?4e+k9
z>iKf5PP~KG(=H`&d7RXHIii0^UVav}hSi#VGJzP|d$bsSCv^8#w2a2NkiGVkg6E&&
zYBsKlS-9$+^iks~$t#TKA63sUD2%OQ8e6w1!*R7%J`?-G={!W>tBLlZ<=`u5{^im(
zWh89Xxc)s1Ur7fZX>N@~7w(v`Hb!R%7(i*7Q&Ty~M>Dy#(W=c#H5Li(LH5syPeSww
zC!T=Yw)v&FUAd!bW9*_-xsNM%JS)~7?<c>UQq)n1chbA1viZVW0;~O&cnRJ$^j(a1
z?S8}>nsvP20j=cp-!<y*#!u&6yL?Bb)JL<MI6VE5MB+MkBwsFFwkrXIf8rk%uTk!(
zv1sqJmEIaP(yr@#->+Wl*EJGd56G3dsNW-efA$Cd{@nNez9cgZj$rDL0k>Fd<LDGW
zQ+yT?P4SP)?|@~;D#v$b>v{~<Pa$fuDeidwj;eJrr!1uS3*Q2i3&B^oo<GO9pe^|A
zfHVu-b{gM}b1A^(+Yq&h^keeZqJQ)~s#}!JX+Brl?Y_m*O>oJ`UnAkdNH|S(Htn>_
zoJTq|9MXxMBk8=kuy(|2Lf_cQRa&$<7_=)xD!!a$L>$;xPXpc~wqy2((vI5GX~#%#
zHvsnkr9z&;!XYo%$<0^}8kE744D8ME(Qoq?a#c+l^iR+nFF3!uF#aS1mZo(fGo*Oe
z_05yV%^$bm=D;Jsj7nLW1@8`5Muu{&I6Z05oFffh2|S{B1eE3?5&bJ94>CTPX^}x|
zQAxT*tUZOKJ8GFBE8^y<q&qt6jr1-`RY)VXXC&OEa-4S5;!tT*&(7?#Ub6Ai1Zrf8
z*S2^<gyFyf+goXDEMyP)sOr^W{m+*7KM8WsNHEplcCQIhRg2{3%zQ6bZccP#A3VVh
z76Q_V%R9~H7xgl=#3jyC3Y2*YlpQq<f48$hnNpz4Q=sgqu|RzV%2a*_=|ksth2;5g
zu_&L@#3IVxMdy24*U0-CzDj%SgLl+i@zNtWyZcuuu7kz`XDlkdAs#WxsWekUQOk2n
z#9<{k9w6@-$FLIDuoB;}l5l>>@o;OV<~nL2A{_}hjr9uH&OJeK4%R&^_xJl?FQ6#W
zT<kBH_anzf;cVnNHVV4wzJ`S~3e7`iWBd_?*>pHheQ%dpd{MuS?`h4tith1dT?O|H
znKDm$_H<=k4ef5ty4tndn{^f5J!H(h*R;DU>&mg4dehzi9QJF#9tcgSu>M0h4gWaw
zWgPm_CO0%(60cH*%qH|ma_Ev(6Z&F$F}vh~-d3|Qt7I2?lzkmSpR%v((5vk06#A8Y
zO+CxL4xw+^*LCQfIqQ3fIx(lSzcbytLb@HJm2C>6!I?ek`SjNq?^ZmjKFt5>ztYrK
zp9{IN-^W=eTXWGZdsydUa;_G!SCkd?nvWXOmY2*5j2E~&l3h=yW0T|(z&tEJ3cDA@
zffx_&Lvxk?)d@BVpa_NR;3P|wfV=4<TkkB5iSo#D&_~%1!ri?}RP9L{dSX@amj4~~
zquwdSd@}LWH_#t83r4~ddOm+Wii`5?0?s?+g9d0)7*PBpS$E`eJgq%R&yoJ6zmuKk
zqU~jE{<<9bEc-r<uP9?>Djh3;TGxSflK9?HsIZW%{z>8Ar{bN}1Me0i(vhQGUfOh@
z{0BrgpfflAFko0nwjonwaf2c5RUF;o+_(D|%exd<x2#yf@%7;JgCz-}efywjxC-k`
z#)u&rR$xbVJc_7ZyOq^xI<+)j?_3I8<{b7?dULy9i7#&O#1Uh~Eo@qYXmboNu27$8
zDO=~S>)Q^?;yUQBc*}LM6K{FTQoNV19ozb5|850mF(pOYKD6MA^5O;y+UHZ-w@cYB
zFP7<C1|hLn#=E|MZ77YcY}nSj2T}1z_cpbcX4$ayXfE`9-Zj)utuyYxsffy&hS6x>
z3^iKb8ii5ZdMC|D&SAs1Sx*LVh765^fcP`J6#DK9{dGM2MS%|^@hE235alt5)=wvL
zjM8jyDV5d<ky?!L44DHxVKLQ2S?Hwp8FFIPk_9wl_w(a>q{kJa3p!n0jr9`;*5~yV
z6h2a_Q7-cDW~&hy>XnI;NHM6g*VfO@`Bp9+W_&AEEUY)l7d4rac5twb=;P+2E~``R
zrx<a_z6LSQhb-N^_w9ZWy+x#`W{hHw3~c)Gpk3GrY%)Z;l*JSq%&}$A2y9w|lPLeB
z;Ynkh;^kc~^Mhd{z5As9N<`r9Cb;(m8Yabs%`4OhaQsv*;*l?9z4Tm0aR5=1=%vV1
zgh9L=7}T>;4j}fRE9B|sXTRMa!1F>PpvL?AC2(g^!xOzvBla-ij@Ujq3wMlJv4ZDo
zy`Zy?%HkA#?#pFd#IVhS(I(h=y4##%F$*eXp?7S8cU8)KfLddm^k;@QJ-@{-AMD1L
zo=46Y<Xyi}O9a=m*f)1RaOx(E`zH*i?p+N%baW0L)0v{wW5QoLH%7-{ohuf=E6u)k
zehyv@mvxzsNs(MS{}+lA7JrI2%HyQmS-~0d8imzg?-VNe1A=RGqE_MSR)CW5FYzvG
zqD8Ljo`sT&oo5DNlR0N>>swgK;dAWh**Knirg$!n6CYTkP(%vOEvmM02gSki#`kt8
zUe&h3*Ri#sIM%5O+i*V4IZ1q8KRu6M&tOA;Gjl!TMU#<K*j`Pt&llorWYfegmG81S
zA1<cYYMVjP)<IsyLSXr_hOq~}04hrB0ow+R*pbY<j!H2X2uflC)Hq-a@UsVSmJ*Zh
zPl4a?FZ$@|S6Gn<f~t*H@83wglgih1IpnbmCdmJ-ur*xs25zch!>9$Oi19vQgK;ar
z;p`S}gGr57wOcW5vIcK%G2*W|>wIbvD>(Yu$|p}c)HAb)meW7-abe@j6`y;XBbZWt
zY^HHG1joL(b<iLhs`!_A*AEj{I>q4Y<<3@vLb*NZTnstHz3ZarMdOtvLp}B-LxSad
z{_xPc@SJsDXyD#h9loR5*k@3vHoofmm;cbeYw*R-T6$TDQ1$!6RO7;9_m`|l3|h-(
zE_!L3b?(f@zI!H$Gxr^yn-YF+KYr`H$4^|j<VyCAL7e&I;U&lJtT7&My?)Byzjr)v
zY)#Ed`Ri}~p!|k_cp^Oe%7(_i@j+3!+Gz^%(@lf-jeS@enmfIfmHg_>HKwn;X&i4#
zh7HrS{uqZ0;&0zvGp^;$A2=J1i6!CLdQaDYep9c?5>K88E}3|cwc1d1@~s<wM(wV$
zCDPAsx8VH}XDj}WW8*Zbb*%ERbA0foe!;~d<{e~FXqbg?@Z*LxV#9Sgg5Xo$b8frB
zY<+R8^4l^)mFciE^m>&TyE3$=iW_<s(F`47>OC+bu{BW<Y5+Wc9=>KLH&Zw?C;S!X
zro=PVJwrRfwuyhNF6k3y_Pp`4@K-{Hp&l-b2!oG=jYCs7!_WnWdB?(I=i%LG_{{K+
zoOdK%uP*L0;OQuy{#*6Nln^ltC9GxfM76W`sboj-r1<K@@oMgka9G4scjBqz>Qft2
zh7NapsCsIzA=%3H?DTrv2d_&!m4uBV-jZP7y{gxuet$(TzRX$h^)T-{X7m~Y(Vf1A
zOZ(0Y|A+H@JUhhk+8YbCH^i7#eKXMe*q{k<8k-Iqq1vMcu~YoYo1?wHV{08&T)6_i
zhFN`xYU<#Qx3;<hvt{nYmA>+nP;5W82K_BI;Cn8Nt<Q(+=ilVVmIk;JcQpHsFZX%F
z4#hBOY>;@fpvnm)%6I+eQheUvO${fHFZvnh`Yv<?Uc(i^_4ob<LovX_aOT+H+<xBm
zMt>pv;i9=ZNH+b<&L_ZIu%<qB0?y`oN)aw3I{jVPJcusj(*t|i8re`a=J3<X8o6Xh
z6pP|wXpQ`Om8Ca;-#t~v-nICRRUw9A(qJRY(30Z`=iQ0T=*z=??u~oGH{zU3;Sfbi
zye;ueP0!Hk@FRmZ;~#6r^a<6s9NwJbn~g&~Vz}zYUenMN(KvL0vEkU-k_Y|Q_1Thw
z?JJ4bYew}Ms;{Oe!+)#UoWl8OLkXiZo~W7B+fh9wep%vp&FA~X>Prs)aL_6WRZ9=z
z$;fefGQ2ruNVwudHEx_x(klLCr?<*=us#v47USom7W(Shy`$9MxxI4?65zUHCw+Ys
zT2U2v&_5GxFxcD)%g~U><1fA8?qzR^G4|#JV9o_b`?2o?0>_NAQHL>b?9OxzR@5Nc
z=$sx(_cYYSHUPq{Kif9Qaf}iambb(#-uKVu4IdX>`Y`eLlQe!hZ*>IgZhJ=o9qkI6
zr-8R_8#HhR5AoKP#B!%A_`0jK)uqgHP7CgtX3%mm<UoNtd~ck*$pPNVfw%UI0)Lg(
z`4=59DuS!xn91<?iRDWg<Ciov^bwzRDZnlRKXdNOz5P$Ce3q36GoL?9wJ$z)|JZVz
z@$>ZHxFvYfBH_F&L-8K<USit3W8=;om7w#vcB&;qD7k;0-kzB@<;@?A)vvZ$*cJYc
zV=XtfI-vVFf<J@gdn)|?xNs_a?1|s`%*5}kFFF)knPH~sup#vNOffbuv}Y!VXt)^Z
z1ko?RD12vv&Kdp{PD>RJ-3Y#QZ<u#oukyNe;dS73qx%F;&l`7#TSJ^m7jEqZrxQ8w
z8}Nv6g6qbHD_{CLxE!dL=cdE0;BgOt$8q3srQmU8Dvz5OUjZKXr9RPf6`nXwPjozx
zGDJYLs@=U@nr1E5_}hX6`<6`H3be@ITV<dx{&;8LSlB^a$~fW1hR^jGT$Ax6(Jc0S
zO)t0_o)=^6z3IL5mi^eBpjj9VyhnUZfB%d=(d7*|RQ@z6$TZpU%J&$D^3DVO`X)Hk
z_wqQ@notZQX#ni6P&rg#y7pntaUHh*7>~LmvH5MT`89AS!=Z=$xApPU0o|IL4>Ilq
z=vH5!#htFp<4#xg3Dd98c+;2icoX1TGXcD5V*DcTre^S_#q>lLPnrUr<Vy3TDF@G2
zdD1x=Px_q3lg=#2lRSNf>63Ff(v&=objB$;lGG<oe>{-Qjc&=}Mup^xPZBNtxah`*
ziKp4)M|%Cbt`d1njy@M3Ft|(`jrYMq>N0ln5u8RIF>Ph`z+8<k+mBb$JY&f&H<G>o
z<Nn_1jvLtvCg6-%gSSL}N+CNANujS4^hM!r^_iCpnYraLeI&DO0$edp5xWIv!yNs?
zfVeDdmgV9Xe*z1a!6SgP%CbKZb4f{qX<bU-E_~~CZzrT~@KFnRDCE^1>n4Bofs%EC
z>k)s|LGgHK;nU!ypNV%)yrW9&<2~-fCV0t|C3X)Ug1#zvCLCUHY@_2E=y*4@dRv9L
zMG1qa7^fVf#L?B-VWD5>1Ga?M+iI9A%=$g}AWo!n-P-c#pv3<UcINtkJ2<iqsMEAK
z^l$DKpILe_T4wMV4?9AydvL~UXpd(_9M<y$R}R~GbU|Xn+nnP$c(@o2t!}vNAn!gu
z@r>t^gY9L1^f>y2%8L#!4e>)grf|)Lp!icbe&_<e9-N}NVP2o$_9R~ST+nBzyx{Pq
zp}%=Hq=X*RP{L-6Cp_lfJ<!0UxHqv!)vKx!rlB4_T<PhxtH0%-h8OU6p)SsAM@|Z~
z?OfV0q0iv<gslN#wq;N>ZUTR3Xn5=(=b{|%+O1fF=zlZodn6RYi6n+uQE0`8An$s;
z|AX-hZQN`aw?uoHp|V6CeYi&{ksUZ~+#Yv?O61o)Qg1VU_jttK2!7S?&jzRO;VR}Q
zHiFmx8ob_c=;sacLEeRNtnnW#o%qKZjHBng!$IQm7=b$C13csMZI0FkZ=c}8IM!5w
z%g;ExBJ{T!(q#FegoJUdG579L$8l0(mpYCU5`YHu;&H^k@jJQ~5aDVKckLvofd677
zTN_N^-(rBD^B~6Us)p`^9oPv)tGI>MuLwt$44E)D^wlReH%6NG!pBT!KC17%Upgb4
z4xLfQayXqCX)He~nyu4-w7$?o`ogFew?khLRDEHwsxQ2o))!7@w1kkVC4jPh&a%#b
z)&T=FglWel<CCCjXT~pXsD*a0XK?J2?Sq`r*eg``9d2+|1SeT1CdBFkYJSP_)Kz`c
zjmPe*FrK*M68YG;nsADPwjevF2cLcO&gpXkM(8H&Em*mX`jtVG{IQatN&baoiGSu;
zLjI5V%-BVx$^U{X|Gztvhx~tXrU1zm@_)}G(9=o&Uvm7`#omN7bYF_^8g)#Ze&I2(
z{O1@&Q~c+!L)OLx*UE;{mu4h>S0>g}9ey}u8hVF&#Z%GS7ZQ)R-f;Ds7T1zv_e}r!
zPWjl{au;kr;n^!2#zV3$g=7tn5v~f7HJt%5R=K$0+!*<gG&KAM)bgG@xte#8XJ?_Y
ze7|$xba<_XduDr?P=)iyVfP`c4|e#$?(;56MA&^!;#Z0ZvoTW8L^%l~wQxpadT3*c
z@30>;RV+AWsw8|f#h=7Tx#R5(Q~HG2XC#Uyiq&O@e-bhdy<>W%W?b)ILzd&MH(&Lp
zW%`n1cUO?*<*o`~*NO0)hy12KaW<W~bptFWk%ss|7tuhoP6J!R5P35HRQZ5tV6J@d
z&%`xV&mT5#o7H)HGCgnK9bw*{lQVDUVBVgYHE+%7d248$Xmu%*Fn8nWxr;ekqt9OB
z;3$&`vz6v<-*n97ip*@KH!*(=G?VqYyYGM5+&!tz-FHWryH{fFa;GtO|2;i-qyN91
zyEJEM?$R6{K6kIi+~rPV?*3<b?mqev&t07kF*#V1?jH=B1G4SKEs*X7Rl2X2CnuJ?
z^=@lGhUMLMm4B0e%z@F6<?n77eULvMl8Ij1;})##3m)^~rl;sB;XGm1F-<CO@jsH5
z%72U1{*h^n&XdueuJ$sa(hBL4WJ`F{hu-xVAX%P-JS)s1*?jqAlFhk_CC5VxY>A~;
zSe~*T8?EXU<Kq_lJq=?I)`o>S%O;>*rnR8<a>J{j`y}m=lx!y{S<?^%7gmrz5bdXS
z)0%dh@*pTW{4&x~v7}1H??M_TsaS2jDh+p(T|SwcW(Pet4W*2I)wcLmp$1U(dqI;0
zFMp;mdm~!<m4??2vR#R~KS=KSHIqw4&}2cgWasE?=J$f@B*67#Fay`o8eAP|xY{(h
z;!N6<Fp;1-cuJ`1K9IS*BMYt_`EWg{!u4GS*8%anKf)RYFmZsZumGySFJBk%Yh3*9
z9Ee^CjwNGsbch0)KHydsL_Y{Ge=m5R)ZnSMItQLtr{Re;ybleYBk|aeO78!-zxRG+
ztkc&sPG4U6bSzI{8%pcHpA6Y=WdDgD{R93JcZKID+jm~cJSeKNJt+PS9u#De(mg1C
zm*qk6AF2n%k2DVoX=cyiOH*P24~i%L2_6(rWIQNLhMJRaUH`Lk+ZW-Z@m?MjlP8T2
z-k9S-QJ61|L?1qCUHx=?DfZ>~Qgmv*6i?{B6v3}Jqw4z7wk%(Y9a+8<KN#jq@j&>@
z;E$ZQrF|(L$nm9^fOV#c>N=A%9>zM;?S14)vG$an6xV7iO^W6hu~M^C1yxUqnTE|f
z;m1LiDuW>~ui=uuGlT!(JTJ$S;zI2W-IHRT>PaDa8c*R#Q9I0&B9IbK;Ys1EQ~fA{
z89xfPN|ozJvE-C~6m_sVelS0Z55tB%625*)^WTf+pT3>$)3JR2V|gl{6RItLzr_1}
zo|}qu|K=Im__KNj3{(9p1o%9wJB{6~joEvPyRcqnUc{fpO|6=CTcD;~nuFcQOM3={
zc|8N-)YU7x;J1|VAI*))LUW7lOQy4GT(U1^pGa-b>`ESafBQ)N8D6L31J}uYJLBgX
zRx){CR(VfWIknAROFhZ#Yoanofil{&tv#6&cb=Xf=^l;w`#I0<RCS%|9ve%}MVRo*
z0RtCY(L8xt8?A7%eY|W<kaoVXm~4f7gsH8xPuZ2VPZ?(xX}wN#n>tyX8pJ_)oW_Ay
zaAMdd#DZ7j;I$}X(!!ZG(VZ>Gv(pJo>P`rAv?yzDl^)aPTI^zA?J^9DX+yC_Za|ua
zbZVT;?=wX_Vtp=rf(94M#2q@lSTSsDvvy{yJBSMVS$`D1+q#}gzWd`58Gv^AU>94c
zr+b{dAhe;I;_0Y(+08v%iKs7>uXmbyT`vC{pXI;jFO7B72)(XWUiFzB*@ym8jP-b=
zLi?pP{9@kLnDxM;f_~<DTdj-9-=07F_CVFNnu=czh+M}CL^GO;J?>xr<$!Q8wNZ}_
z;Tqwa9~>X;S@`HsvGk+FN4@Vwi}|yu_pI-kKC@9Mgq6(tL;K?kjXlkK8n1jlp?yz{
z={LTKD`%Kt0A_S`OX@yUVI#dK$lU#Wr?8F1PIn}QVpzw@9q?0oFvdr*g9>M7=kD^z
z-l@dJmZ4o`>9#q-$fp1KV7XhsiE7LgA6C^RSg0gVNzCeU<k+eRf1KEPY8YA|N>zrq
zuc|c0&6wQ#pfM1eR?fjMz#ejT(=T89c0ZoteU*qJR%!0NOk6UwoL?Rbxs8dhyA6pO
z-P{c95Oedb@x3$EH(!BWuMj<>Z;nO%GpC{6b1tSYsX5{J>gyjrvHA{Y4AipRl@fBk
z{rHLS9p<<=)7HBbUzYLZtKDN0ly5-(DtA$W-ZjRlq!A@wb&KlVdgNE2Rk+()3hU!3
z_mSLt?&8}64<IfoMGfmQW53=iwl~a_ESG#Lv^mf5_yeg{?TN+lGn>v_6bhU<|F(dr
z+#K-89gVf~ji9nO2Ra(P$d#(O8sy5=Ts3lDH8&HvbJg4o<eJo+2f1Zx?lZ^*)m#N~
z*Q&X4<U(q0DspSpoEy1_nwx^$gKEwv&-pT8*bn+m$yTFBYxkD8sflx&7K8#U4jn6h
zxc@a^4S7YAf6cG6(l3zTg|riCJJO>_9Y~vyHX?lwX&usPB;pG<A)R91oHn*q>9Orf
zk8M@X*xv97AKNF>V|&9VVr*%T@TCiH4Qx!!PLHkY8s<+SCTC}j?Z#9{dx9Hk3omS1
z1k7Co%r&W)+tqj>Fo-Z0r-dL#nA_FZgdAaRSEGy^VeVaWS7QKq!riXMdB_p&;xs<w
z2zR?0eaI2+b~T=l9N}(P<9Wyt?shevgB;;*SL4~p5$<+1)*(l@+tv6v<T};d9ORx*
zbH-#3Hy>Y}g_7T@B{Z}8)ZAy0`-_^RnKh*5s*rm}&0%JpSldeVRw8$|n)AsOU!mD?
zEn)?S(h$7h__uymXntJNe<}71>hq%tc|FnD%af5xk?0I&D-xZ<{4VAJh&T5J(yK^+
zMM@yOjC2U;cSt=*Pa!>l^cYen(hrdyL@MM1Lp+7x{CO45=ceJ@k%sfRS#VxL(nyHW
zFoJY*Q!^mloCWE{7$FAfMaVHo6Z9FR7a*rYn&8hMP4H)sZa|JfnxM}h?MIG5nxM}h
zeF1U|(gb}5>2r}|kS6FeNS}pVE~E+e4AQfaV~{53Ge{GKWsoN5Gf0ENYLEu>(~$m&
z3h8V5Z5R=PIp?|Hc<5&q&_PR@4pLMnx_1rshtk>FwC|W=9+Esd8Hsr8*(lS~EaV9X
zrX#tKbokqmHz9FIf5*>pB%-ZHk^YSI3KGHoIizQho<{mPQWw%zq><oG`<$n!d?}EI
zyZ2h1F9ovTeg=BN-%N0S-aIxwe&HGOZ^a2!E+g?J>R}1a%&Ee>pgefQO8R}N-#AI<
z5dRrBV`R+fkzwU8V_d$C_AN&uIkXgM8PY{aO-QGr`K;Xw)9vm`w|ilJyT6^^?z)_I
z2h#0+QfoIf-t_GKOTm`E)UUU@1ns1@pJu!FmS7|!sb&YYY0Tp1&9?`{xCz*=tp_HX
z({ZlfjN9hpPP(m@rb?ON7N_ptWtvn1W4IXK4<JoP(s8ShT&c^etPRWZ+ORC$hGlte
zSoV>%VR>E~g6TFa&uc^QBWuHzd2P5h-G(dk+HmcM*ap&d=p@)kDyV)R5jx`(V-+@;
zWH9~R6LISz8>p*3&kEzfpMe81U|*hx0}F7?<m6o2PA(p-%<I2B-T#&8b}(GDe~A6h
zZG)26hSGE!l)N^Seq?R9Hm?ok={8)O*M{;Bu?@P;JEn=7s>gjWN67X-G}NU=2-f$8
zj~pS`m=hDu54hJLjT!;|ELPaqwAIHD@r3Rg7Sor$ZHQXacAV^}Z>C`}eF^`F{*XLV
z2<J#QgO03GuEM$!URBRyfjm<DWY=o>kEsqryKF~visCoc)fOeMwQ&_>3z;1$-u6<5
zaYOL!-&;#%IzM#<a&(3V<@sQR%PpHz->EXE{>A>&<i7|@Q`>FU^()<6WI5thlwM*^
z-FYRAu5FMri6`D@MI`MLe{ID%AD8SOF!@}QUPwvJ`%`sYwn)+TBPmaK|A4gV@dj>a
zRU3A_aGb|<h$1@m>>QnPAxdy-@BY;6F0P^|>9y@2;Gd+Z3XjXvW!r=EWc&Se`iB;|
zW8zP%ieG7#E8O($74BwvS=Fvsy?Rv?oh^@wd{LhBC-dgZ<WW(-Tom!DCx@U`3u?Xp
ziz=V(7?ec2n^FEJPDJil^s?ol)u@s2(=X#Uf;#<boyKU$<LtE#F5pb<h{M4}Qrlhe
z)Dw;ah^fsbckt`gzSs^)?L9m1Qm8LJ#K^Klsdd*uuPus>qW+`r#}du5ORaNMJ9^IX
zwcY+v>x<&3!TU1yGE0XXsj04e<O60t$qS?9*L%O(e~)}sziIO#`My-&=!2<O_!sci
zCh5M^Z`}t|@zDoywN%>YhX*7-B|a)z6p^CB`dW%6Vl3)3KPYZyW5!K9!&CgqkyLp{
z1;&e7)-1PbBc`@4<%(=h(EEIdwY3R;=%WZet}!XMW4_68sKR6F)kmFv`NY1RtgcZ}
z-a9ICOG0$jBAUyn&KdHB>Nnb^m@3bB=?u@j_!Li5{Bxc~@pC*E#n1D6KHhcW=XYEY
z_q|obuk)8>)q0ux(!?K+@<XC+%$PBgE4a+}zU7{e(PJ=gmTz?X6ByU_b$%b>tFTrS
zp%q1u<2dz2e`>z_vsv$4hrI@wdrfY4*40XPS=QAe*ex<oUhKAKUEK_8O6J}wbqtRH
z$2a_ScC<Kaj?c-8nZm`m*f~J>&mo<GGzH0q^azp(=~~F6Q3K>x<O})bXu3u5BV81|
z$nL(j$*IQEp*ie|M9T=CYvdaFDvxw<IU9LI<VQr9-E@a@6(yY(E&?2}J}1vnqt7xt
zUmd{COB?4|f=GF#@R5=bsmea*wSKPR30Zt#e@cuPqCz`|xb&s5JxQ*(H6BTE;kuUn
zsnQP5ZbWfWUQp`gNMl$&g59BCb0T7V<cAGs#@nG>@tzsIo8Zkx5n`SPmSV3LSO0~&
z78l+Vlmkknk(bvsjMbhIIfmC=e)yHTw!z2gF4SQHL`@MMwTcNU<6Kl~N%9tJ(r$ge
z-x!@kU+y`AmiCyBpjD5?4efIfQ-}9TK`UZ237&@zHpwgGNBoYs5E5osdu^cw$`Q2Z
za%m^dVCSX^ty|%1&3o;&ulCQ8ztb-Or^Md35qHTqBydvj#|@I&AHidd)0gc@yZv}S
zyD#ECmslxt>Rfl_*#g};7_b#EE*k;9MAHqS_y9i!v71FPcA4aNHka~sr?M4;wwqUj
z4@Bg3{-XF@G9RKDYdo|`nIy9rTXcw<F1q*xH{Il-SWePBvRG355e`1gl?pfYY30II
z`*wQdXyePc-;wm1_}Ukco8K@#4nMua7PZd*JhW9|H6~u9xAb>RgWuu#bGgBK?vMTR
z8x8<&{|b8|(~(-k=xWYC9fx<Em~dMgI8v9vsm5n2eq&>8(TR6MV0ysjXk^s3BOT%?
zIMThTRlw&K;oejWx6<vwt}P#^-5FQko4O`Q*iPJyN>@&u@Bncs`#tt86SmQvdM7uu
zuFW<Wwi>~!3=t!El{w;>^!xyKwK2I}dOjrujrUt3)*ZITfZ^f&pos^;t%7YXg?A$^
zg6mmC$BH&ax|=jAUKABUahmbW>tO-UxD@sT=SlYdX9CnVvQ#dL&XaA35o?VskOksJ
z16%{O=2^K5Gqz*UV*F|K7*J+cq{7{#&fOLGT~@7gG#hYS1{dp-p9aNSDw{W7uGS~0
z{pN6wYU@BW1G~n(sIDi$(>yP)k()GH_+``?L7j}FiQs5~UfbY>oUs5$>*8ICRq?r5
zU&4>GR)LcRXC#c9-<uCjj2A`G<Bir%^FxNs;JG;GYpJ%<;sYPDy`s0ON#j8_@Ez-p
z1?Zp8ZHowsK90V}Mb}c$v7%1vj%ivA#8b|G33EMshUaSVm21FPTESPip&P^J;qT31
z;w{|JtzpJp&g{*6?K1aG_y#wX#~0>ZL$I{&Ag-2qqQWiU30`4+X7HtN9f4$$`YYvB
z?sSIDW&?N1yhq##y#VbPi0g0LfE_mQqs&t`y5}Y`SHzt%SHzt%SHzt%SHzt%SHzt%
zSHzt%SHzt%SByJ#^hcwkvp7=`W*}$);=d5)P&ys{^eFg~4>Nis{zNvAk26LV$+kZN
zKQwCmkgefN1veBnP@mRhal_T%hI|$`EVuFz;bGc;8Ars%QE|5N*H(xd&V8+4h;q~S
zgTIMhL&Ov{=I}$rVN>~`3$?5Kutn#G_Q;Lkhvvu@oMqSHKQj(qsPe=KDbe{-N>q7b
zlZ;c-9BH1|qVq)d45#tL&NNTF8+Axg@HX&7bDAeosU>L#Pvot?={HAfRBlXEpvU}Z
z+|*tJekg(;S~Pwrv^VGR!+%%#;Z}_wZUL8L{ICZ6(3r;$h4x1ft&@5qcr0=HroHw=
z4nM?cKq^0+n#T{P<?zGp@4*jw*$~oBGZ2YeBVHBaRdR!?Iq^OCVz^l6i?iY;aKlpN
zF4^avB|nSExY5Stk9%-B2{)A@V9dKFoA-$t@2iOK!AjrM!yd)1Qb7+Q21XmZ5U-a`
z_hRo5?^7ibaKC@=Ck{(|R?OqG6vcOb!`tADg?+qqp17?`Sif4nwyEd!X09k%YO&))
zIBRmb5rzox#2Jw$=w|z^zPI-wecw9zu`k2Eu|}r9VcA?Y8BzFfo;S2IuY5TqZ@ap7
z`4iZG*}7%su3wYOJ=$r|_Bs6QfA1f?qq)hN+-{;TV-}UKkr$~o+p}u+s5M*Fnkj}N
z%`m-Qigw22eG@Fm?4Ert)y#uams+IAN;f@wAt?Fi9iLn5k#7&oQfsh+1GDFgTr1sD
zWENr>vgeq5YCZ9)c7NugB4D`i;8OXvK$HBHsng`n#!h+qA}cuge3W%ImZQxk(Cw~9
zdUC1!O+3>i_cU5hr0_&%W9CjMedpc0JIm8|g!G*mIa2-1931{3aQHh&Ymw$6k=?lu
zG_nIJg7iJ4I;4?kCeg4RC&t~zuP;h^Y>&?;_+Kt_$>o-t14YT@62<-7xZdve1NweI
zpF{5Z*756&kuB)0A#%oJrtLpP4iP<EX3vFjV|&qwx4v!IbOp||azu(S?+GiIcEmxK
z9}lU>qs#*wNGC2;BW2e+`AXj#&NkCvSlE)r8DSI2R#)K3X8C0mR_y&-I!#%1RH%1Y
z4gV9S8k#iB5~D<s4$4(B@9l=1j{ZsLk&R1kx7@0>-L&NvwdJ>L=UjGb`$Koj27FbF
z%!39`5**XcIY<Dk-P9VdY*KNMee*Xt-!wk75;0ci$s@me3EpPCVekJ$ecuACWiy4f
zn%a8HcHUblAC%Gdhj^DA7|d#2vcS4cTbrdgIMV*q^6<*3mW>=>Vc9Z%8{;JP&RftQ
z8jo6;q)eJEgyD9rU*~7lvJ#Oy2^!18mW@;cJzMYmLe~4Qs_)NQjJYK74_0FK_|zHD
z)z~f9EGAjD9%WsPRZTl#;V~&bbq<tDmFgVu$<H+!F$e19cw^=c%>j1j-Ml+A2iP4U
zeP?5Ie2)AuE>C`-Hs_~b2$%;*n~+|`yf~`Ok>i*Tv~K+v60NC_y?^BSancr+KllH!
z_a5+3R9yr2?9TS31f<ucL^_0C1c3lC^dbt1XefbzGy^CIYCuE;)F7gOsHhJJq6l_G
zo`Ag@P;7_>8z2@?P{hLbKf9B;d#~W*`#o>_-p}*f|DHMLo;&5t?CiZ$GfTO>-C+K5
z_7K~H^k=NtVULHqKlyj?)Ll}w|5x{f<!!4~cXe^L!R?!U56W{n6Wfuz-6w?_0eOE@
zb^ppxLArB(BT?SCX!|2&i)8Fpt@n@n(w^l%v0G^UA)l8P`x)LPU7UC56;D5u65^ko
zX=iLq_ZIrz^zAsY->MzSqMWxxl`Y^YulfDI>S--tj6v<6unX@dOPu?aoV~*YE5V<f
zTiTX*k6rOmO~3QYh*j@@)OVSTV-kDh#Fi(=%*2zh{MvM583B2Y?$$)RPtFU;bWe4D
zL#~_g#Gm&mSLcPAd$RJj`G^&f=QJjcK^DJLEH+N2n0!5BIpR)rT}kn=>i=!aQ#@bu
zxK1qjXl`Q5_}6(p<yAoc>3Lr59P|Cx?{53wygd2Ge{EiPFt1kPNQd?PZ)GkFS#?q}
zR;K$4U%x1|v8T|}^7#Hr8Qm%kn=!Ldpm21fl){OPsuW((sLSESdDm83nO-SlK|xB!
z()8-PB))PyKG}a}++X_-{w8sM184mC>7xr}8lxMvWc(NJOddnqcw|dAvVS~sVx!(#
zRGWBI3pc8xGro3ORI_+gqd&||sklGl)~;R{>fU9>==zm++FSuuDI-6<T--CUe#%at
z<B7&S7qqhue_|CscUK~L4+s%bKe?=nb-Lq6^7}Q`!!hf!;`I<H9C*A=m&BU*i8aA7
zZ+loyVqKIWSJmR{VuiLYV!V@6>QrTUe%ha$%Z5%#>K{s4I3-QuC9)io3KP>B-KZVY
z8LQ>7lM~&}jUM7ePi!<ui|pt`wsj-Z-SKwPB3n6;&HgZNDNae$9Y;*YVRgwFUB9Zk
zhAKF|i9AE4cpa5+d>6Ef9gdx1EhWa1TzdNTw2Ad3*A@R?Kc^+j$@>Q4`?u@Ts};nY
zJssz8Pk9c^*}vVmklbXtXWzp4p>^_46k2Z8zoJlvx{l)->p*Cw-}!e8Z8;fBo5I!B
zf%W4;D--{b3Ex2?6W3k)j#LUX7?&tpcD#YL>BvbBS0!fb8@23sQ>)VE2IGBPgJTyp
z;z|v<7DuMD?07Ru#!-?+$(fYMwK-B!@<_Q*bJ|mhsHQ1a?PbRsrY$?($f8x@@g3=6
zb#=;`#mgE~*2F36?zBo1wG+!0)_Nn6r03#$-S?dO*XeJz;<|0xUTgVJmOhD`V^IJ5
zDS4Q#NM4&9%qzW+cgl?1ypop8ha9O$9GUmUpY+}TD~?MSNz0dekcW91)hV>tFX!cP
z93cD@X9&u~j|_0kKWjVfr+&Ok+Pd{<HCcKu?I+%=xk`q&@?6L4_dhuhJ#5!)*1ocp
zo!NzFJo!owi~G*9yV?CMU#w_~9rHGcP2qRm<lI85Ngw*rBa3YOzPP_1{_;Ef^A4Rc
zMP4`hLcGHYAK&VW^+}3luhFD^;qa|p;*p8^z3^R7SaNIsqg|%7De9IP%lc-sm*?eq
znpE7`IbPQrpUy>iatbGI>3=jYt2XDjil!v|HSxy^OK!1a6^q(XJMmm^Z)|W;m+w8X
zZal+r&Xh(xbIB_0=M0xs%Tqg6N0wgZ_#ekT)|dNb%AJU|QyNR1F69`z#gwH~>g{&x
zdE))fZ3hl_VGIStrb)TPJy)FZ6v=o`GA{E`9NGWq+$qJ88w<^{ysYA~)l4Z?E4ila
zwS2bE@_KE{ce?hu9P|6H`VAg*-rKb7czx|R*y^;u!PbB2H`pr0!*4K+-&ylN{03Xc
z%UV#@@_+O<D0%&seOr#ZZ=0AOjPKim?AxrvoAYElO6=W&?%pkBi#(g3cZ44)!Tv4i
z?B9yLvWH7t$#2C**AC^^A7|$?w*2r$dwt05w_1nu^L$6Dg%W+&;{BG|3)UJfd%;b-
znL0j>@uwQcltQWPJ5t}-fBB2rvPZ0+w683#pL5FkgPi)U-1_yY-^!`)+t}6Fn=>bW
z*q;{fGub2mVSk$G>}wPI_C!7>E-#zZvz?T*KlQo$)9|{8c2$Vvz8I@u75mnA*@Lcx
z43KMwPItZCe{A1cH@<J3!@kuQ-?x@6{-r1FTLVW*_+(!GZ0|bef5G0h``>$4ZSQIo
z{MG&IfAxOgK+dUt!>8U4s6Dal2U`7``+?SO{eO2q@W*|++7JA3pZ-6)A4s%yLz!!G
z5^rReU$3-zRquXN{6Ai<6*$%PU#GjL>2H7H*wpFrK%NUoY5YAdr;GWI`v1x}|4NMX
z$9)+k(qvmmI*xYAV`!(F$9V1d5+;^0B~9JK`&81f#W|HkNg~eT*syN@ZrEPK_G@-1
zO-*N0(y(>xfEH&R;}sR>$Qme~?g_)T4BOW1zjL%H&pP&3auoWvwxiQ+U#IgY*2{nI
zG*34#r}Gyd59L{snW>y338nQoULqQG`st-|Hk~7VdHJrycYV&EB<`>+?nTKpz^YxB
zmnYkBvHb6xW+`_$Q=%oD)^lPx`449~tHqZyvA>aX0>w*e6|`W%>ci>I3rL;Q+)umB
zm+{{_-P7g%|118)@fIt3?;%g9(vg(XwRg!o3j-NX9f_3o@idxDi|2kvQ;ISVmkx97
zp(VKwAMtu#JZM$gloiOZi^@|jF>BI)<`{6=6m?$dROge5^CH`B()+fefs6rFIL_6%
z)?S%@|F2eug7u51?~9gZ`gS-igE{b+bKoiRyy1CqP5Lh~b$PlRPl%S7Q=iY;d?c@b
z$ASg290lgQcxUVi1`D{;f_KSx&C26C!}P(){}+k<jP)<?qn9^ndfG2Y5A5>Jh|ZAv
zmp#Wl4Sw98Jgx=lJV}-q|E?(4qK3A2J??AplM^BDP2I%*@%&AG_7?J%*~FDa{(Nhx
zz0SM7PW*V?-h;O11&-kPwRhhJHf@S8z3eZ_!l~MC#m6q^Zp!0LidKHLjMAAEGA24x
z@#L@NJP7Z>t(v$3;-~%A@|O=<T|CRxo9ny<@%Q&R?-FdqbmYFNQ}sFjXP3iQ=zTM>
z6g)fFSqgQxyuK7xfh@=Aj!VjN_-1%BuFd&E&dPFK)uQy^`-5_<CZU3np(@=Mrq?g<
z#5Ot4?f>IFI$US*-}W1m?Ub#r@QfM08LQI0J3TEtX+Q4oQl<EO&8g0d%JSJWeAVa1
zuS~AZ6A%`rhu*InU%rb%-b3@e#Y=elZAzB$zw3AGE@O@_N0!mo!uOY!(Vt<>D3P%}
zSgl}P{0RT*oOM}N?456{=nD|bJKgbq$<LqH&B}^RIraLNy0YJi?($`%q{+QO@%_`G
z>pVPB!@4Ic@rylmUS&DE<ydv?Lvy@0SY<Y+Jm+iw%l`DN)16n7cbb*#Rii=T4T+vx
z0`KP^pAoCF#ZxQq_>2^9QBHi?o)zl-8KHv3iT!0k8r#3@Gel(H{Ac^h;^Xvw_S;Rl
z0-QZ|cwJ73jJ&E_4y`U-`h&!;u6{<(#Pl+X?OO3GwW<{5<UGsK_|=C3(X@;$hc=X6
zP~bZhjXc1$4m^XEy|?&EeXyJTTY5&Q%D{~EhgRG5GxTH7X_a%FBi^UJej|~)C0rYk
z@=D5cC-!$EYp2@wCC-yGVzVzp_WE6_%uP|pDP;|<K21IO|BxJ&+~v*5%gL(}=(YLK
z0G`j$HI&cZVDjNET|*hg@0$Ge<jHG_^E!vVc1V_zCvVK*Zu{i_1)dI*(|q&XoUU0Z
zX@jcVk|I&b<+3f!=eTTL_qeP-{~fMx4p(`cD^DtaP>cEZA6o56TsPp!c;}$SanKYy
zg{4ZYd+!Rad8y+$be(m}=FkpbhhMlhN*#fe_YXJVDvfOiHgyRV$kfXeP2{R^@ydEh
ztVe&+e}S){_&;Yc3)mgxzu-^)cW9$ou?qal^Q<Gg*5*o#*@|E3VR1#Hb?7=TIcNTP
z(oEUJwIZi#2PX31&nTBE_ms&sivIkp9JZI{-u#GM;htv4k5>DZXJs|Wsh>3>>z<sP
zoN-yJv-ahz%UPdQl$Dhe%R2RcXCLPObpM^Qt@z@ZsFl-T^E<q+##u}Bnoswelsa+_
zwG>yI$(#mxuZ=hVc#gcim-iOO=X38tzw8Y>K`pbzZ?>@t+AvS$+`Q_~J}T~8oHdR!
zViT&@e1!k+LC1Z4eP{JJ?(6x}{=5U}DbHn{K9^l(PngtipPR$JpRLZ<VQ$vX+)p7Q
zZIa`>t46M+Uy)wYSrVRCv(vM#Oh%P>MiT!oR*@C6llCvZ0-y87RdfF$>#)R(od-R2
z${qIjef*F1uEtZ%TKtQBFmE#%pCiv+cJ3?NylGob&g%FT2%EOaeMIdF<SfLg_r;O;
z8)u8(0-0E@ztR@-_gz)@s_ykG%Wt4W$8wyhJ-(CqEJ%^uupIxoy#LXK)BZSyQf~b}
zFZcCroIL%;KQr|bZe1&0);-?qmbt5B{Y1IUTk`Ml-x+39af$IQ)9nJ%R>}hDm*#=2
z-&N2N62FsRrl-C1b!E$z%&pF{*>XZ@vG`NCWIqvs)9sVxnRWkO{ZOW-gEM{hf{ACH
z`I6?qDv)EGvOK4shktJz@_R2lXw|wl$9rg$^&#yJZ_dD>q4-fK`Arq~LCpT_>HP8=
zJcAyACnMti20igTh-bN-^oDKqtFsDZ{m8yUr1;u7FRh?CIdcDK*J>lGB(AiRJ=m%8
z;GNMmCvlgjr+x9BqPUOZ&sf6MP}MSO@{e|JdKs=$uO$B(C+V5^PWL-5-e38+GFSRa
znbq>sOBd?LJI<>T%Q$mJ;@N0p&P(kcDN3QekaFBJ(XP6?N)@L)apsiz8K>W`CE6&5
zqrQw<nbN;4Rdq)9^4zaxalRp=M`-5_@n>t*%IM`>J02^N^LjVL_hnXt%#5FR`VNIX
z_oSCC<SpiJEUFx0KUZ~zJ!M^$v?@N{ESZw=RKe29i_(ACIrq4={j2@HL!q#K9bRSz
zNpO3lSCW7E&77)VT$~em4^#DwQW>G5+j!fIr+MQUo|f|FE&p-Pq1(6zGP}q3JK0B`
zkyz^DK385Iqjlv!e;e^smu=(*X^s5J|J;AwcH)a~C!y-6*-mnt?POr_b~50&Pv1_m
z{@QkunpxgyP1yMZs>o4@P}TV<r`lFhPqD4sz_wD6E7yE)cn;0C<6BFPowcsYTH3Bp
z&?-*J@Ey9=eyYGr>7w-Sc0S8i^95VYf<N7Atb&_Zv$CK1E89)5sBw<3`MYd8zLqI3
z^8fE_H9sV6HK%G%sbe2L=h#P=<F#UmmZ$vI6ThYH!9Yf%%>0a-(i1HiPkw6Q3R-fq
zUHCG%6KS;-i)D#rXN=>w)GJ<6J7@f6>y8cSrFYhDSbe9jHur$WtlC}Da}Rl}hI?uh
zSu3BX<^${ld@;E{ln3UlD9e)|%jT4&CE_dCcAx}zi^^ChAGW&j-`=8Xm4#jXdlJ!H
z3Do7w{hN+h>6aa`Jo_9kkzMxiERBCKIyonv$la7Y23;v$CSOJ!mT9rOOpV=T3OLJ@
z<}OprS*8{__r{m00?Sm{Sf=}Fe^_0u81v9oS|VYV@WuEN`dC7%ma~j21HET;ubNXe
zXQ{S~R>3^xQ2rZFKhH&_eHrzV=Gn`7kT;jex_J6XlhVEdPpb#hs}@Sm;>)l}j*W@s
zS#NVSdSbn_$Z5FQ!+Hs_3>9`(De}l%ZhC<Gl#ADccSR|8J$MW99@%!FlylGCrek?6
zB;WqGowe}e$tnBy%d|rUUD7|@e=GAZZPwFWx6|aHEJNyl>N1qyS>9a+wJmv9lyH|p
zwx!}FXt23>`#G8RwL9ng*=80q-%bBd&wB$c?@dmz?bP`f+m1IQEhj6!^_1FKyM9fs
zJ!MO8DO+}8i}x&-ZD}3<oow-S5?g%on(!1<&amTGlsQLh>kLR=)K#{hYFt?z%{ah%
zkhWywKV1*o`ERe5v@D+dDus!?QGBcCo+S1{v^8bRx4un@q~+A#Y^_)?TYUXsA-_wR
z%lviezQVh|2}cs!gJ*dt>3W<LYO((*KBgS+CFL+r^31PO?T_Pqnhbw@iuGx+NI#mX
z7bLg6sTvn&|HCrGv}LG#+GXhaby_qnCx>O&{#{DSdiJPU-)$;WyMDB=bP*oQ7n5a@
zvf}0P#YTL$*(3S)B;ASOEf~m{l9y`+b9B1@nE&g`<fS#K)>Ls{KtG0?$boD}e&=qU
zoGy9vHBZ;ZEsP&0uyO`SfAgd#%~u%9DL(!x|B;^9soUEBoztn%lOr+5ygcu)WX`&C
ze8+yDBHzd3-{14y|LE7#vl2btPLCfey5=}nx)!;f)lGihxjMDDyga?D<2&WbfyDMc
zfbHp2+q^8_|HO3Dnzv}#s&$*T?b?qRIcjwFn6ByFy7$PKF|<*WDFep!oYc=sonlR}
zCQPubK2~a<F;;5RG`_p>jK5KnCrlVIE&Gy@GbfFhnB8$y&WPNzJ9N;!u`wgYO~@V{
zn>IN%YVxG1({iVenid-~IX7n3zCx;BGVKo|s6TbwmD!g}i{)mIncCn_#x`x{lt0W#
zlJ76pOqz?oR(bO1>`|9bD^7t^y>Uzyrg3cI$f?sLL5ZbGjy(PBkfCgA%!mn7v#m+f
zCr+6@X_Py5C&7mM^rJEYJF0~<N=`qD)QQbfM>k8IX{Ba%NbTDp^;|1;L@ae=EOm6O
z*b_^=fY;+DN@Hv*)5cBAzGQ56@m&AOxVthkD>dCp9hs;!W%|FaG;#8z?3u|~IsN$S
zH?Yo~K56ubnO5J)aW!~)_Ea&4WRISd7#f^2JvZ*k$Q>so=Z=^*JvTlueUj9&s3PGO
zffg|mVD%a?Y5IuVnN~*j$lUlq-x0Z^a;&aXa>q@u`ZAVY(<f!~HDRXJb^6%pQ>R(y
zW>1-xJ#l1quGN3kw8^6TO};$g=$<_)F~C@5jEo>xMkOPWamXm7zSNXj78R_neXRj~
z<&QEc@A1`<if<w`lQI~cG(6MsU4U-l3`=bBu*6Cox%aSxGu$_6_*}==Gs$O`$DEic
zXpvKmPyAe#8<%3O_CX1M2qk55oQ_*mEg!_7GyGSGOsjZ0GHsb|47xxb#Ak+pEC!1p
zZj1g8iY&*!!q0U4#3l2u>ipGmu4|1yZ+b4{|9?X|iTW%2*|-}rj#I)sHT+NHbn_t3
z0XQX0TduG9&%&I(tfRl>?+pC^F$2?B=v<f%*-iq+pho}=OKU0=`%@W~|E1IYhf#FO
z|CQqZEcu@jk@3j*W6to%q~Xy?!+-XFS6o;AGeu;a|B?T{`ouSoiipgYEdL~s>C3#y
zf3k@Dk4}bDl?}#UoHxmnS$7CN$({J6z6_r#PR5f1GA>ycr;3r|fl@XO%<0Jd%RI}v
zEFQ<HVv3iMFm1WSPF@zVljps-ym%hPPM#mJljlKfu1Jf|lPtGPSLRRVzc{Z_U-BXA
zzIgjHV<h**zEKRz^hLUYv}20%A={})aeVPKWFCr_S*9gY?2|ghaWX!M8|!GvzvNOx
zmP_i&^u#B_@*9x(mSLF(k^Ug_C^53VnC1N(|K;e@jib9$CgV9>Ombcci?0WXmFbBT
z=b(7Ll5-{H#mg`2MWom+&S7#cq&#`~#ZF#Mv6Gie?Brz-TgE5zBr*VshvSaFzy8j^
z-x>Hj1Ak}W|9l3HpFDZ;KYJnnE5`X}^Z0*#dVjX;f0zB8fxk2GcLx4nXQ1n((Ycey
zjgHlCp4Pf`i?kN)8plSCn9BL5$&+Hat=hG1+p6v82C-2SMobzTyF5F0>Nxz(+cr&W
z+9FmzXWFzWQ#&+kHX<>Oreh~h9y=j>>g4IUqq3Whnmn=Dw8@hva1LhNq-GN)Tt2bM
zl-$YVvpJhJy8W1T?Z>nl-MmekHZ4cD=2&)i>rrX#TeWXJrsc?%X&m5hIl4v5HZ2-h
zUFAIkBeF+~9LL)w80^-fX<B<L5D9h-dBWa^UBXk!D(y+}l<}7JmGhLhD%zDil|5Cw
zwLNEg;wka*?S}vaAp~KFfV{InqDn$3C=GHPTYP2V3@8WXL45MAgGx{tM5=<kSE)M4
zIsBRsgIZ7<q)uH(g)^ZZh)<4hG=xUb7{u2Unn9Xlw?MaqR?r&c`WK072kk+Q-AHc4
z*9p!BIo96=#Fq};K>B?>K>GFK&xD>J{mb6a2gEP^Md?FIUvMA{0`U)q^Wc1tV-G_?
z{1?J7xCn;B#UTDH7y;7nmHzT*5dRpEe!LtjkYgp|LHyFcod}a)GE4#SOFwxkNWWc<
z0Z9K`{Bmu993Qw6X2EO_|J85}<iQ-63*w&#*TH<a9u|Q37s4V~3^&3}ApU$<0=K|Y
zxD~{I8{7`dVFj!N@ym53cfwt8H>?Kn-wXG_KVS{41@W(g_3!{}fCoYR8{uKt1e@Uz
z5dUNFI6MJQ!c!prr(r8R1KU7+1+X1<z_aiii2nt65nh6qL42>mYw$X}0dIo%3t=bh
zg16xv5dR+d2=>Cq@Ck^2AAAa*!RH{pFJV6%fP)~uL+~|x1K+}TApRrpJ^TPi;TVYj
zCpZp2!wL8W#Qz)o4ktkz9)UrdFL@WD9|8~rK3147c~4>#N<c~A!%l<WI+TI3a0c+P
z%JWqLDnccw41BDre93dis)M|Pu_o~0F<AW8p$^oARN!OP<EuV206BNl2>4h{_-YEx
zAPt%WAFCx_t)Ml?vzOZfAFDlI@*cpmpd)kwK2~SGx<FTu^Gn@;kJW>(3^)fep(pUM
zdh^u>`a(bG4}7eFd<}wgVKAHre5@gS4TTFp-cdLV_*ldFx)?5jEEoZNtWkW8hHMxE
zV}Xw~j<4}>DNF!9)+D|r!xXp-a)FOEjj!o&Ia~oVfRA-0U$bB~Tm@GHA1jZqIWX6;
z=b^8I`EWff06x}2z81k^xDjpwK2|<oOW+n*3bz6u>o&e_hvkmF5`71(f;-_Z;A5@k
z>mIll?t^~-A8RdN_rp3^4}7c*d_4#c!A5u(_*k3ydITPY$KY|`V?D{&Q?Lb|hONNI
z+Q!#Ep#ZkS4&Y-w$Jg`l0=x(>0UzrXzFvjb;B|Nd_*if8RR}v_7rYI8tlfOQ3-7`E
z@B#3#_VD!)?1hiv6X0X*<LguS3_gc1fRDAGuLE!pzJf!*$NGk^Z{a&Q3`c;E^#fl=
z;TZe~KLH=>XTDCrFYqh;27IiO^5tb1ykN^Pt`Is55r{$w5PvCjX-I)GP!_~r4qYB9
zKt;z_8C?acLN%xk5?d1;gIZ7<>VWuD(Pu(Es1FT5{Eg6!p$RmFW+49N=oZitT0v_N
ze_M1rXb&CWED(Pu^x4oEx<FSDe>Ze@=m8mU4v4=ex)=0@KF}A$-yb~y2ErgX7sP)a
z`g|AyL*W7t|1k7LFdQz1OF;Z1&?8|KjD~Cw|5$VmjDzuTDTsd}dJ;^ADR3Exe=2$!
zOoz+i3K0KH^p!Bnv9Cg34c9;(%mInJ7CjHHgZXehi2nxkLRbWg;YJYu&FFks0=K|Y
z5dSjtZE(9|uRyPaJ75*u2@-cVdNtew_riT3{x#^ea6hbr^&tKY=m+5;*a#1U_&1{;
zfk)vncpSw4B>E}X0#CzM5dSu`Jb%0Zw!;n(|8wZ);RSdRUIOvIf_@cVgV*5=5dT}~
zLf8qr;B659ZuGnG9=s19fcW>IKZ3pRF?<5z--rGbK7-HU3lRT)^Z_^sU%?>||2ODw
z;X61CM?m~PppU{a_z`{r@&AlI0l&bn@EeH#B-*kW2A<<+*)ojFj}AZ(LJ$V=N6{sq
zB$R^EApSDwvTz2JgYqE$is(vE8LB{45Px-a4X6n*s0HG$gRTpyj$IF39~wYIXao}1
z1l<&xK^im%@wY^`g4WOm+JgAoqdUM^&=ER;_&cM!KvzhIZXo_1=nOaqGNC7kzc;!M
z^o4%VAH+WpJqXT)!Ehdke+YUgTmTosFcAN6^u=%qWWfj!|0wim$c8a67Q{aeJsvKF
z2`~}FKN&p*E`wZ{3gVxRz8tQA888#XKMOq@u7a!K8W8^+^jx?W=D~F!{_D{T;09O-
zi$MH0qHltmAs?22_?Mz@g=KIX+z#SjfnEuBz$&;C#D6z>HQWRD!hInAHR!c)KdgiG
zApQ;L2jL;u2oHn!H=`ecN8vGe9K`<&dK>%`3LM`K^t13BJP$8`#J+@n8D4=`;WZHd
zF7(^*4(xV(@1fs^4;*_B`Xkuu*q@+_V4q`uhW;GBaP0l)18~r>523$?Z{S<UcNl#H
zzIW`S=wtAsV;@KV3@04>SM+c2yJO2mULNp@W;uLlKLi{*gbqW*u}h#!LMg{iL6?ED
zaE9Y6kFEd}9lJ8R3RHFM>gXC!)3IxzYeOB!PDP&y^&Gnax*;@j>?Y`@(9E%$qgy~r
z$8L>o18t$5<LiJv3pzUX+33#D#j(@T-JrW;XQ0o4Ovmnp?hSn$yC1qg3~=m0=yPGP
zW1o*60z)19Li8}W2!=bpOVC*`!m&r8M?<z_k45LeILE#eJpm><_GI)FxXiJqqNl-h
zxZLs0K+l9LVV2{&3Vk(P19^^bF8W%S2iG~i>(L9~2FG56UJN%n_RZ*gSmM}A(YL}f
z$G#oC99B5?9q3hXC*0-uR-^BMd*MFEw+6iy?uT`b?*a4%cn}_Pd=H~H!Dh#P6#W=H
z?$}SFpMoupy%qfoY;)`a^mf?c*w3M#hZo>Q$M-V&6?he1b9`^0--NfI(DCg;zYXue
zZpZf?`hEDovG<@qg1wIY3AzaOIreAh&*2Nl-j6;22Oawm`fK<GzIA+u(MRBW_`&fV
zL;nar!EwiT0{sj83coqNlW5D&?_OZgM*G0;*g<p%!j2t9mw=K`3QB|2D~B!*6`&$i
z0`b>C*Mu0<g4!Vdy699m)3NKL8$d&71dT!BnxdOQ8Z?I%ApTb9*3bspLOT$D2lQFc
z5jw%yApRcc3^)fep(lvHH@Xk>g?`W<#6J){2+oDUa2|+%2zn@7;Ml{^7r}727%l;c
z8-X4PqhK^-gZRgyb6^~dhf6{H6Va1kGE8xNx#+1d4W>K3E6_7wCS2+GW}~lytKk~Q
zHwQfzu7!DU9msSRp%=rAa1-1N;$MQk1(w3Cunfe1J9;^+fR%6ui2qLXU2r$7hI>H#
z_o4p*YhW$h58_{segHPWgYXcD|6%kd*bI-rqagmr(NDmW@DywT@oz;x1KZ%Aj&D19
z2R!T8&!b;}7vUwx_X_$|c+IijK)(rZL80T@g?<~}aqM@|@4@?y{ULe}d<1(P-zVrI
z*asq?p+AQ&;7iyK2jC!l1tMRgzkzSzJ2(tS;CuK1M2?|<grDFz{0t}H7x)!Ken+2_
z;Q+Y-FWBG%KZpd;AqYbRqEG@#LMaeQL6?EDa0Zlv@=yUPg5<phx+cV+7Ssmu*F~qo
znNSbvgZLYw8$n}e0!=~uY3SzA0$M^V5PutVTWAOEp#zA&Bf1lu4V|G2h(8_O4Z1@Q
z$N=$YqI*Iw=nZ{9{Qc1VVE_z-K_LFY==0!w7y?5<{1>8!!9_3}E(Y;up+~?-7zLw2
z{A18#AqU36co6>t^hB5hlVJ*oKNmd}ronW$9K=5ZJrk~kSuh*Ke>M6V$b&gB7sNjg
zeI3k)>tO+ie<6AiEQTB5CJ=u<dI{VDOW{@!|83~oVL7aTl_36A=sV#qxEof3`0qvE
z2mgRIuolF>4!s^8fDP~<h<_vcVb}zl;Smu3W9Y}>33w8o0`WhM-U`paHuxuqe>-{y
zJPXgk^C12g(J#Tv@Cv*N;(s0e2D}MxK_Q5L7y4~@2X@1|ApZB!AHavO2R;JvA3z_3
zuiy}T4dVY6{T&>JBk(<l|0wzx{0Kk6aS;Cr^e^x${06^+_~itd2fSc|Pi)))bPz%i
zh6sqi1iB=Yg3^!z;xCIn1Ij^pr~u-xgsu!#pej@Y@z+4tgc#I<+93YA=u|ip>Op-F
ze?xR5XberDDTqG}-5gp#OK1h+Z-Z_N?Vvq$0P%N3cY?E_Gjsv*r=z<;cjy5bApT5r
zPv`}`p$~|^AG$vbfPpXw#6K8)9-I$DU?_<HLi8}W2!_MOApR`$2p9>YU^Iw-40<f&
zz&IEW;-7$?2$NtkOabxdqNl<%m=2eN_-CMJ!j&)!W`p>zMqdMYFbC#>_~)UogZXeh
zECBH@L@$EHaHHe98J!PH;1*a461xn28{7`d9p6gy9k2@Sgu6guSEKKNd*MF#2Z;Z1
z^b_zTJOx`o{9Dn_z&7|N6oB}5pr3{3;CXlf#QzfdWq1W%h1Wp*Z=m0Vx1bPqg81J?
zzXQABU3d?~{{i|#*aIKIUJ(B$=pxt$pTcJ#{x8s9!hSda2SNOY&|kwh@GX1?;y;4^
z9)5tMa16x%6Z$y(3@6|h5dUxJ-{B<432u+TppEu{9|8~r@rTh7h(ZY{3F0q}PJuE|
z7R~_imq%BCickqEgZQhWt3h?B0X0GVwa~Sp4%CHI5Pv;%eP{p;p%I9`3A!mXgEVLk
z;%|v=1+AeCv<30EM|Xg;pd)kw@pnddfv%7a-9Y?3&>3(JWI|66e{Xaj=nMUzKZt)I
zdJvoogW)_7{}A+0xBxDMVIcnD=!@YJ$bu0d{!!@BkPTyCEQo(L`YN~@u7Nxd|9tfI
zumEm=g&_WX^b)uQmO8!<&>zAc_z3ob#QuOj3di6__zA=x4ztc73MHT<h(8cvyMPdc
zAp+vBfUXFYpfXee@%KgdgZ?l827>s{MGuDa;CvVY;=dSu31q<t7zyGZjn0NKFcxw^
z{L|3W;c~bFW`OvwM9+fRa1~q);$MKi0T#j{SPbHSrUd&1_$L&=b`bww^vCcC6u~|a
z|7YmW;S2Z@_JjDpMSll}fd{o&--GxsE6IKqrouFs4&uK8Jp*RKm5y&V`YN~@u5o<x
z(bvNQxB(V|)L)Fg5pIH;As@tl3wkNs3d<bd?davO0#-V{wdng{9ju23K<aNsKLU@!
zV~%e-dIvlU&pEzV(XYYl@P_020R18CfsY(trBZAcPz9=jOrtuw2GoR@<ExFX19c(Q
z@zq1uhX&Bl@ij&_fu_*R@ij-cfR@n8@wGv>g?7;1@tuY42%X?;$JYhj71E)b<LiOW
zfO8<z@%2LYhCa~O@%2X!fPpZ`@eM|w2j{~O$2S~(F<b&!j&CG-6pV&!$2S(81LI)4
z<C}n<2$Nv4<GT!<3sYg5<GUPv1<Zh%j&BxvHe3Z)JH9;h9GDB&!aR_5G9P_CEPxvv
z-y-y4xDjr0eEH}laEoK#ie3h{Ireh&3RvmbtI&7CU5>pPeGlC0*#AJUfwhjk4!s^8
zaO?-s55Y#q-h|!^k2v;Y=*Qs+$9@XE1)g^7XVBZ=pN_p9y#t<g?B~%hz>ALkGWr#G
z6<&kaLGtq^`YkAgosREq^gFN{-gSKMqd$NT9s48nUijFti_rVvQ^)=s{RMpK*ay%D
z;VZ}f8vPA?>)40UN8o$MK8ijDKRWht^v`g@v42JX2ERMDT)gH1uV|LbhxS9ju|w!E
zL>#*Wx+Iix>=bkvC<|vmIgs&GKv#rHP}%WSMOTCBP{Z-X(6yj8)Ny>N=rf@n)Q1Kj
z<7|X(3{9Y^<4Z#~hZfM%@wG;`fws`j@pV9-1s$Q2<Liv>0$m~9@pVV{fDAYXGC`)@
z3*8&~Kwrn#A3XpD!XP*oB=$V?`7i{AI=&0h!{8zq4i|&OW}!#GNEqe#ve9E;EabpA
zkl0Jn6JR1ta(q+Jmq9K}b$rv&m%|k>!|`2-o&~evD#v#XIuGW+T*o&LeI3k)>mA<>
z=!LKd7CXM1&^JRqEOC5G(YL}fxXtk`N3VdDa0jdcS(dxdcf)G9$MM~V{s*jqwQxU3
z?0WPAumK))d>hdZ!zRam1pO#H29LuNAa$QYZ-J*B`x*2$_@`rUNAG}V;W>C7q~43@
zm*8c11zrX5zm9$b-h{WH5X8R={WiP<yWw3B|NH0<;6vEs`1YbdhEJdf_JPEHhW;GB
zfG-{20rWxm3Jy8GZ_wYucW@YvfYkp1eH4ztkB;v+`e!%+zre2`vA?5Ff?T-j0k3FG
zAKDKA2to+NA3;Z<1eA1qrO_!+2Fg0Va_I6<0V+Da%IGRk6{<mXka5;T$DkI}c6@cw
zsc<ILgZdz`4bhFDF*I>}yxY!7gXYk}@wGy?hBnaF@wG>HfU}?@bOIS?XLJ|n3hB@d
z#NPv*0p~y_^aSzuM)!ff&=2~9_y?i~!MQLP&I9oeK@Wus;6lfD5qdaW43{{*5$KUH
z%CWQ2V_+=gIKJ`dOJM>`bbOQ1Q{Xblg{dIZosPa7u7DYi?@IJ6nC;ltqUXVNFdwc5
zse1!@AuNK$a3hHSW^_I*fm>iHh<_RSHn<&@!wL}pUFf@EHQeL)?nD0r*1%fFw+_7?
z9)Jyw?;-R?co;UpW{`0{ihc|phbJ80Q|K-5G;D=uKw|%iE`aT@1D*x(KaYL^UWAw6
zWf1?X=-1$Nc*F6%g)W4hu*>nigWe7A!h7&ONc|7dd*CD3>-auF7r{RG6g~rq{Q~_Z
z?1uwz5X657{WW|8-@<nw{v+t`;RiVC_<ltH1jilw1o{{F6@G)?LF!s%(BK6dd}8Ac
zpo0*CFhoH7CD0|I6qJS(5Pw<p8Bh+&Lj@3jC3Iz|0#%_Jh`$E9Cd8l?)CTd_MW@1<
zP!H;Z_#2`dL1SnFO+ox==;qJ@T0$!je;agLXb0_~1BkyPx)YoYouLbeKONl-x<e1h
z0P$y{dqOYh4ShiT{m}hk01SjdApXJV^Wc0K0z*Ok7ovy3MKByL2JvU1N5DuJ1*1Xy
zV;r61=<$x8<mf4m&UN%ON6&EdRgS*K(Q_Pqt)s7V^!1Lu!O@ExeWRmqcJvZQFLm^7
zj$ZEQm5yHJXkS_WCqR}Zhz>c!5p>iUE{QJX45y&WIKyY4%Q?dp&=sBG%IGT2a5Z#w
zXSgOh<_y<H*KvkZ(Puit_0bKS;YR4j&Tvz7GiSItx`i{`3f<ZnZi{Z`40k}E<qUU1
zpY05HL3eeAyP>-~!x`vvoZ+76Ue0hIbYEw<KYD;OJP3WRGkhNUd}nwl`T}Qo82Tb-
z_+s=W&hQBINN0F7I@=i@i_UR|$D=QGh9{yYIm4HuuW*KEqOSx~UR|8*;R2f^;q}K>
z`pIOUoP1Yea{#fsT%_X)2auA)=5CoWa$%1v91utn+oD5~BsO=_%$19ST+wIP=B^rB
zE+%rNqE$m~%y6ZOJ0t@(cimhk7bLk-)g6)no4at9f0|rg(<rZNZIBC}T&e30$$)L8
z8g>J#zg#%wN&|OD25hUTwOlT?a;2#|Bm*{2N9rIKIl0opdWQ?4>dOx<E-i`&;@Xbi
z@uOTecl?Zzi>X{`XL-n{S}X0`5*e_$8)&Iqpyf&@t33Hq@txcf8L+K%tA>`Zbn7hg
z^RhdC=|+5a!_Krmk&DY*$#jQgz>eQ(q+GVu&#Iy2tDp5M7lO&P{t4+<JP_BmHNdb3
zThGeHWUdT$hh)Hx->IZrHg_t0{X=s6h1T`o+3|Y`5>Xeb;CTIu3_HuJtmQMyC?9Fq
zW2_}#CQomSwUG<!)bfon;&Tjpg7u_aoaf2}cSr_oYm#B-TG?9ubFGbB0H~&yYs618
z>={;uT!`n&40lKd?D(Bl%4Kt>Ri>8ztF77OS4~gu#8P5gdCFkOw&qzj`BySe4aUpo
z8}>r$?yr*L7h1K*uiOigkcGtqac#%%=u$4*%C{QIg^jM{yF)Ty$M5t~E}J{O8f*E#
z%{s;flya{~LgY>`C3gIduw;9c)k-eFbVcqEQ)0*O6ic@6wYJK|kgnWoz5i44^zL;_
zWWcumVc6@eujHajSJt^hGGNE=G*d3y+Gt%V7j3$-(Tb5@wR{`h5*e_qO@{rLb(35e
z>dIr*h9c(5&Cg?2vuMJQD33LPmWC2LekWV9{j{}BE=YAn?rc+Hb64AZxq#J`0_#04
zaxLdhPwskCVp}_u!H{jeU=7yt`+`yasx_8;D|uB7GGxc^kW(((DzvWE@?B_EC!cCB
zRH%aE^>-QeZtG#Wkk*ymR&(;%G0FBt5(_sQpU0Y2wl4eU@(j!6?|;nadu~k`u(?yO
z1M5S{9xIFds{b3glTV2qzoReN-e=X+^1aWxl6<TGk9{hbA=~=W`sSD9>3wNM$ft_`
z(uhA~Rnzi!$a;bciPis&+$pHUj^8nuY#*`OYWX{&3K_EFcM>X>&7FkX<zi-6ezNv*
z!SfV%`;j{hmDuq+4wLQQtnWTdt}k~WDzOuHBDxOSvOQ0|n;dU@&LDqkdbT@dsbpJz
z!w!4qYxxWt<<5`GnWD{|j4R|KYgbBp3b+tkO|P_3zl>p*_w<kpxm_u5lvgzDs-8l*
z7~GYro>AmiO|PmEU)`{4c_zpO=dRQ;%Ig?*J<kFy|Mfh>$gi4SJtMw>VK?zC*_k}O
zCPsNP!*1!RspY?=rz81Q(`#wOw>Iqdo_=y6yesXE^0N%Pv*%;2{oC0ymHf_gqdL1o
zGD<ss$EQ1T>>i%)<$`@zdKmHN7<O-uU(0`QPb2cXz>Vtd4#_C(_#LC}$gu}{zLFaY
zTp4J@pKI7dJPoz{5Ai%p|3Xb~h!KB*VGsAbru8?5dydflm3uK0GTa>!+m7Fv>J-K8
zQJyQb{EqUJAipVYtx@h!qJFkvkMk_j@;lBbpX9mg<K%oyGRoDKlNkRr&(m6eVw&eh
z@~K)0(~SCZH>?ucW1i;<lc#s3rzQP4l@GaFR!MS8NxZbjJPpaek~|}Ro~MtN?|Gi7
z<Xg3x)RvhTpWJP$#O7|>gIareq33e?A8PsJZd@g_*9<$~bG6nV$@i?HKeF15%6Erk
zEVSPY`!-K&Ex&R%uM*o@>A70#f2{O0qJO5APww_rlAKxb%AC}u|E6TMX9)eX*IkF2
zQ*qhxyMx_A?6sb~TKiY-7FJ@%?;K9HH+W`h`P^W{%N@l^Z0;yNqV+#EdrFhfa&E|G
zPfymrEWxSU6OS6>d(u;p{406VQ%HZ~W!Lef5x>Q-w|RV8zPEWc)8DA(*5Bs2l<iF}
zA(pB9v3(<VIxDfc(|MiN|9H-`m;Q&!|8qwC3x@rQXOx!zS3D8&tMc=T5&xQDzva0?
z%kNvBW%MspKIG17C3gG{>tuVkXR+45*zGx=e5!oN9oS0j_?_6v_8!kdt$(q{)0TXy
z<(E6PmC(L3?0uf5TK@KVMv*@?{e7P6o#P8q@sI1{Gh=-FJs)cQiT$2@`V*=@D0hM@
zvEz4yC)?k6zSa5@-*~E$Pc=W^ctY&Ixm@Wq+pFA3u7viVr@EHkA3Pt?o>lWBcbY4)
z<9D1V+dq3!wfz3<d653Y^KOXTk*>s!-<h6lpY#-H{fU#FJ+ybT+>rR4>#k*69{Cx%
z!tpuprCL6HMtR5^)cV6A?=|F4o(qzYkP#m->{8xaijsfNrMw&IAE@oOlo6j|*yX%e
zX#In7MtOO|uIzo8_OFu4MtN1kuIcTe_19{8hmueA`>bii*D~x>?=-D{k?Qr4Pqloh
zMtnWPZsc99^)DKEE0JHdJvK7pn;3R;ZzC<g&AsPn`E72*w>0dw-V`mrZM`GNpIZL5
zMtpn2?&SSgYrl5#9-;lJmcNq`-`TLcc}r^f>*l?a{()NlZbp0$!|v&=ujQ|&cQgG1
zHT|AOd~d_<?|oitpZ50_(LPnv?{CBpH0<-d>**gTInR57_NQu9ooB=kG3;U9E42I#
z^DZQRYWl;B_~C{<!n;;$|BvvtA%AN6BaHY_hCSB1L+f9S_4d;8H`a(BXV??H!?pZP
z^v)!I+uejrG~y>4_Ec}WmcOaqx#aILcds|qh@WoQGrcKV{$?8GS9$A@PbF7*JCm>O
zZq!xoki^*Wr#`4?o2Nd!rM2g;^<GH6Ho5b6tx^9v!@j}$nbw}a!TTfa_bzVK4en54
z`il(vW^Y;YspMww9@_7R-Ra+K#4j=IW!|dfQ^_);e1&&C?K34SywA`+>h3yL81Z))
z_TAq1`TtgOw^4qNVXyJ#X!%^@{ekv+o;!jyM*RJTy}>(M%jX88{2{~M?7dm*FKza2
zpuMi9x7mn))UcoQP9xt+o;1q081^>rV_JV{o3}FkB{jWmMtp%`Kj*Egt&iu7@)r#I
z6>lfjmy%b!nXHfTuHzN&hqO08O0q8^-^bmtyy9Ks^naqnc&zEh@zdAbNEwCAQ#~eY
z{iU~z@|}jg+dEfl&+j(M-!tqz-ZQoS)E=XJuVL@=PS)D{`;79>412$~4E--9@)Qvz
zv=<Hg8}Auf|4W`OqQs6rWhB}D!P|-cnUWv8Z_@r(XF234BuZ!x8uriL@ml}uXQTWV
z!#?T#RO=s{G|D~6GsF7x+sCx?6MmySXxLFZq^-ZGQC`xp%h*rQzfe-fK1Ta?n(HW&
zT*&;KVb~Sz+v#5@sc5gD|M0%+sF++x{mO=2-F}Y#g_7#_VDhhy_f}6Xq<&4qu45n8
z+Pig(@_KfTmhXD@Eb=+jonSqC0_(pEb__h$Oyl>|z!+Z>`zo#f(8MTjX4oz5j#_?O
z+Ox=S9@9!lOC!FuVYjzSX!&h#l%HkTo$Z=h|E;s#ll<ltPcHtH7}p@5U5)xZ?ANsZ
zMGvF=9K-HykJa+u+x~?1u$o?PBfhU;54688N_GuQHkiM24SR@PO3VKc`wiN|YX3RJ
zu0Vd({&R?ZC;f$xJC-5#f*OfG;}~g>^?fJ%BN;BXGoAfS<9PX%Wx6~26KP{}zQx!+
zE^x<8G4ngz-b8;y$?#-@@=FYRl>NHao*reCXB+l7`yy@qj5EqFHSEduajm^Q*(krv
zu&3KoSbs{UCmYQF6^1>_zP2dYH7nU5{wl+sW8b|e*)_+`Vg0H7&79;y>R)Tv*V|j@
z?<l!G*&zM~!@kjOqxBbWG|F!_?4@>3ZT&4Z%9k1T3Oid{e=CggI}H17``9<huDk6e
ztRJ=fcPAIJJogy(8au45pEY*1qU8PU8YBLG!`@)G)AGN;_K^P)iJt^%-C)E&WZ0YS
zL0bMd+i(4nd=<uKBmPmte!~7#Yu`U%|9-@_a@-aAgc1LgVLxNvq~-4!yE6G}<<@`3
zh~Ht~tDWE5VL$#!^78I5;-53@m+YNdd;TSRCH<cP?(|+V;$JcB*X=_)lU=XdIpk}$
zTmSXsLe}@2hP}(4rR8gveLMM5%d4#n>c3~#)AGa0O%l%k+K*`cM{Q%E{wMZXTE0kD
zlGxT~c0bManNhyq9<SwVzfpe3Zb|->97;Br{$YEnmM^WdLithKL;jQ;wabwopX<;X
zbHpFF)5w>S<Mwv?Gb&#Dvn2jkySJ7fZRbI`<$Fh8WHl-#!kB&gwf>9GC=dB;Ek7Zn
zyoB%d-O2M?!YEJimC*8&Vw9Knt<?G><&E;nzK4z_kH50-6;iB%DyzZx@>KU-p!NT%
z`#xuts-Ws>FdkpaH&M$^Eu%cum#5_?)hKV^TlGQm{53GjoA|P|{4_DjoBP&i{ki5w
zd23(fWb*i18|58*CA9p>6S<Vw*4e(MTK>-Vwb$||PwY~{^>e=0v`swS*H_D*Jkd*u
zZDshfwEmhr;Y$hE%lW46O`d;w;+GPxpYv7J@+VIKQ({|#d|9-2l*kjolyH5V&#U#f
z<OyL)xL(fZ`#HJ3JTXiO?HgZH?I(DNQ9jC7K>J?FDBm#hqk=}ML4s^+tnY2D{XW+B
z<-X+ju}1u*zMnrz9{;6A`DEYyT6<icPNu}Rrux35{itNBQ9i@BKx>cBFv_p;E!1`?
zR~hAVeUJT+JbrninG)N&-q%CR&-F(6BHuo(y}igNzu9+zmM?kwnG)Mt>YG6Rlq@yM
zZ}&~o@+VJ6Q({|p_?l?>lc%LA;ryp>f|kG4M)?}wZ`v+(jZyx9FGb6rJW)-FZ9VMk
zpyf}VuBODc9`!w=wT~Y)%AfQN)$%7#UsGaRTYZIE`%0e1riAOwe4iC1=TDx_riAm4
zzLVNt>T^c<%f5eVf64OXHYK+8hA*h)PoCnY#I|<%Zqo86Pjpkl|G)1Zt^F!bcT>Xu
zzi*q?UX`c4DdGR$*H_D*JpD}x|Np*&w6~OeW|Z&ujnMKZPlr=tTZeqpwEW4_;*{|J
z@5|TnCr^%3!tod11zP^(DRN3|>xAzCtw|(LlvBd>SiX8%{^C!Ua|1Z@?eC!F&z4iq
zuGm)4f4-K#piv(6f2p;<qW-zkzIWT#QGcd9lp9GLzq_@}PyF6xSZ4H(=Tl1><4^IQ
z(AsAyMtM1ZNiDzS{0+#bIv!Kb|2^$5c}9Oi%K5vIuPk?!mh*3?eKk7Cew+5yMebC}
zxkFOljz3M$8CBe_?Eg+{Z&fzpYxu9x@>9bfAwT8Z{M0bwV}@PVzf@cPx<+|@|5~km
zTHpUH?X9ofS(K;vDY4^E^Gmjy`WI>K)29B9Xm1s{Ax(|?X@=d(e*yVZ(#k)9{LOP6
zt&DhiI-nAprvom~^4Gy%iF_?^Lpm7o9Sys)|30n#+Sw@YYS=yejkSFC@OLJE>iX#(
zM*KO3-P=D*YtQ!f*Cl`NxbxfFKbrh~m}GxX`|2q-MZNug^7BlRU5n)(>`tY(J0zpv
zdNacw=-;fhPY3!tvixd$lBXmp;dqi^5AnaCwO5B2<-`2%Ywgux{-d<74!ffqX2cIS
z>=FKLT6=Yb|2NvFpS$%(81bVFd#rzv)*c<}zl-*#+8)Ll@$%G0B{olOe46&Dl8OFa
z<SXPlCK~a%{@q%aE!TfB`BCw?M*J22%e4Gl;lGjmsQ4?4_}TvRwS3I>-$p)E{A?qB
zj{g^}JvztVmm}t~yT}BuHQ)am?NN1=!5n{-`IlRs1MtWF>9xlA=lg4F?fLoshUBXw
zbrUk*h+pJ?Mr+S6@}JH01{a6NpI+%2Y_B&O^_TbuYVG?a{?WAO)$vMs%B2$8YleNh
zKSX|&-0mMpdp_ND-0uH@_NnA1A-5a#<tdp;Y@U*NOlxo5>90xqUEbA@5P6EG5<C7h
z&1CyN|0b=ydY``!`6=O^)ws{7FHhZ6V)N9^=e73gdjEU0PgOqTshmpe_|rL)?T7te
zeUzM!hyBZGpLTac9`?USd#YEG?G7@)^>D`cANSAH+V_w9XOW+e+<eGWKb6?=r++5f
zTm5Ua_NhD#R0(@J!`|+1qvdbAQU1Jtm)2gDCx<HG{sqH+#otTIr#w|u3GGY&aIO9S
zhEcxDe~Fe)dE%%N+j`eugZwIyCy**(PwyYDwO{3lq)KRC`oGoMU!V9FEmq~+L2bl;
z=J#mZ=VwOwet#n^-~0WqFG?QYAtU~4|3g~)R-SaKggv{zr<U)-{-`#8M~(Pn{vBF-
zSDuQhg!={j?-V8H>t}y&ZG68O@xS{IYwcfof~peR@&+E(+P~gFFKu}PvfFco_G%#h
zz<1Y!og}n81J`ToBN|wwjjyy3pAuN9wU1Mb@^XPEwDxg1qr6feL(6}qz^AnTLT-vG
z1-^93<s7WXnqBsUliw+E`|7f{KkWP%X)t@NZDj(^_M8(hzozU>>k{R$xIMM(EN6Wt
z#&?x=gQ;y*G3KvE;6iPE)-cLrhFv!>QCq)tjq)=MyJ6r4ZT&V33}SuCye6cf5#QLb
z(*pNt{hPEvjP(~Qt{#7St!uD<Yhl!H6KJWezczvXtS?o+jS=6@usa4m(c14F1G89v
zs(wc!{%pfe5B#9DH`4<F@~7&j8}Z!@J2OyQ%U@>T5baG>KhucsW!U`!9ku-R3v8ji
zuIl$Q;s+S^;K1v&SCtG79H70b>JK*J&o}G~12eSzT^O*n{9S0oUu4)>fyG+>vI2M0
zURTr4GU7)X_L#s{t-U@bFi*?h7$ZK%uqOm|)1Fr{AuveG-vlFml40itvbFr>2Igq_
z%QfPs8TO1o87+S^0;_26tL2|z#9wLHR|itH{9PSrr{(WzBR<ct=LH69`I{H0uH|o@
z5kKFs7Y2rF`CAw`MEhRN|3V{vv0>*2e%IQo`GG20{_>6ZTMYZQzyn%;>9#;?Eq}Ke
z@yiW+Rp6gme`!@<C+&YV|ErAnyA1o@z&Bd^_1?e}^aoUZd1|u~?i@Ajb%7u0FDO|T
zn5X4$oe}?lVQ&oFuH|oI;8EK9F?WO;jrdK5{aB!zmcPdWZ_@r(^&d0hpD^sF14Fd@
zJslXY<?m@D{u#sG9+<D?Z+oD>mcQ*rygY?kiOo}}Z`ShnV&EwKD>eTw8u2e1_UnNk
z>2E1{Jy3~!s`{@R@oyUTu0S2~tz=i=arz6Y{w^c_9m9S<&{pf8z8~mCe@fMV--!Rv
zu=fUr)8A6EH{c<kS#E!2uMz)=VSgIvMSn}lr-85OFSK(VpBnL>8}@;~w_1DlfKmRH
zVSgK_M1M@lw}JKa7h<mCTO<CkVIK|j(E6)K1Ka2ysQO2Z_#X}XM4(XXFPsQ`M*l$7
zKViiGYS>nAiPm4Rf`#-CRDDaHO6&^lTf+_nbG80hAUKWu#oQVJBR*u<C4zTp{eu$0
zW?KGA81bbHyKL|^tv^sU*iFk{StGujVOI*CujQ{&aHy8QN=AGY!>$pmsO7Il@O&+Q
zHH`R}Vb=}r*V^}WgC}VJsr=P7;?FefhQYd8{u&0?(mq%98yfMA4LdEEuH`Q+_%!Wn
zRX@#$Z(-PNf^TT;>o&oIwEtB7Hb#6q!|oVdNBdey$KcPj|5W{sM*P`^ogU27@|PZ5
zO8(UGp>!j@yJ2SrAEte+Bs17q%U`Au-^;N31^3WCRMIbaF8Nc_?`OmhFzms>F<Slx
z2j^<}8*Id%Z`c<Gdu#c-Fu02Rsp(&6#9w6CS;5L${<4CNwe2s<h#zU#V}hAl{>B8~
zr~Rj<KgNj9G3*J!X<Gg!1iz;J7jqLj!HAz^*tx-z+WCasU{&&$=GM<O;-?w*jNs?A
z50%Uaw$`@48Akk-hJAJL5!%;Et`5FH`&mu@Y9l_+u;&H$(LPi%FL)XGi@A<@M*Muk
zUKsq9_Mwu6!RyFhIoBai`&VLHHwTw%`MNpy813bl8zOH4P-4g52#{<q3tpw=YgzD3
z+RJKs^2Puq+^-w#t>tHB@M7{4b3;}d@v97bb?{0pKdXZgEkCP`_<Id|O>mi(pEbc6
z<Y%@!{WV7X{f7NOu(_762ZDXc*R5`QgmT&|6&atn{&+n5L1TOm2P<g#dpLML`BQgg
zKWxNrHtffPpVOXJ@_6tk+IMPuleaA>;rORvZw;QI<#TKBKHAHwzPyz|i5-7CL$bXi
z*i_5sj^LBDmsNdvdxH|rw;T3L!B=TdD|spSCG9&^U*7Vd#E!r1A=!Q-_%Q8hC2s`3
zqrI%^%iAE7aDRniza6|v%ir6<d@X<S)(9nb{Ou9R_6NZSwf6A`!H!z~<n0nlIG=CW
zp9Ejh+Q**+2Wa_|w@@gt<8Px#w!a9D((?C3@ER?D^0o>kcKods$@ZaOrk1}$!3A3W
z<gFG;cz%mv9|?X#e?-ZV;CJ*lRQ~1d7fQIF*RX#ImLcCtehOA2pQ^sRB|{0vXAS$e
z;6|;z{97=Me5(5LHVq|QPhi+~sGD|v#}1v(?^o5g)u}E<!~GqG9S)t)+I!(pH~Jf@
zzPz173CC{@yL9Lat-V}2w4e5}sxNQxP-4g5=8<fd50%mS8|6dy(q2~e<!v8I*fSY+
z)zH~m{;GzapuMc>%UeN|*zvc6B-^z@uW0S%TA`0<FRS|U_7Ej@{4FBMcD>L-Er0bw
zuh3pr_2n%iO6>UCMw0C&p-Z*=H3?1B@+WU2QDVp6N|J214Bf7^ms^JFYx$G6mMF2~
zZ!bx<+lQXl+RN=j9ku+)+f9_%@wc2L+nq!GwfuDs4b<`{Z$VMQ{U3(iBb1`$uSclA
zmOpu0iV{2i)|6zscc@5f@AVG-KzmQ+U*4*sg!B1^Jup;V%iqAz-L#igeR=ze63*uv
z_K?t7TK<NF9;Lmk>dRYNl-TjNwItiaLoaIW<>8@Ewf3I8%|!{<I~w+=&^=mvc~t0o
z+IwpH^41q6cKq!x$#za?rk1~)&{fCef1hWXg4fCoEhe8YyH#?G@r^g^iJ^5``*~uh
z9r?V~tv}I-pKRE<p?9?QbFNW7)vzxQ_0i6sTpqfFd`@tucexQi!?0(EW|40tvqRm<
zr^=ta9Y+bz8#L@Wp=IP-$sD76eyFUL-}y$lyj@3$Z7m9=l5Zu8jPm?YS1rHtHXbEp
zI<!+eUVUq5BKfT5hTIxz<(#ithtFe8GtN&f4}GB>uU;NHPJ6MgTYtGRy;Y%dTK-mr
z_R=0y$EQ{q@pl>aJ)x#r{_Zi#?=$SRp$%I5d#zEvKJ-u8<4V>W<qsJ4L!l3~_TxiF
z`9{Ou92&3XcXQ|%?Z+wZ1UDP;j~ez9p{uq0K4FwUW!PIoOSJa-*3d(=*X7(|Lbe+5
z+YEbq=yI)nzTGH)*05g)y+r$6$qPpLONRYwsJpg4UNy?!3=PrN$D2lZp<%xrnyRgj
zw?j7hR{M{)jriS${Xys^tv&xis3Q69;x3T9sY(g$S;PJ~)KJU!$3}UPVSg6NV0|e0
zEL56&4|N@%g%;FK>`yD<^I9uY+#&{S>kDIi2SWX|{2wsNzcTD^LVLCL|2Lt-v`1UH
z6Zyu7|IV;~2$j(C{ew|1Z|+jU{VkzY+WCm%M)|LydRqQ}HOfzhHfiT0PKKVN{U38D
zangvl!=KO}P-2JI(cT~JI_z*=+N+hZ&xSwtSN-y+9#?pBPxt`+110h%G9|Qc4ZBqM
zaxK55!Z(oLEVoK2BR<8j&j_#4`d4R!Ta&+-TmK9rzPw>q3UAl?SCx$NYT=$*KC6W<
zBA*M~@mDkAYZ!K|@C+@#wZdJ=Z@yc<mJwgau+I$7(eim__)GdzYW<uU-cI{=2;-9{
zDgSZ()HlZ0D13namy$-|h?eh0Mtl>)P79aU@|_mGUpwEEX2iEJ?AGB1TE1Hw<?X{A
zwf<K7aDVz+D&Osm__GZA?C=j-d-v>cN48(Je>>ZV?_${9!XIn>g>FXqIpHGu4@%An
zN9bS4z9%8)81cQschFx@(mULie5oH{ZzH~c_+k17O8SSNrTwqk2mOusfrdReyqo@k
zlEL9?$%m>x*oZ&hurCNdOaDO01>w=;L)E{)h#zLy7l+4a`MKCA&ob;$;e4%sFv=*;
zHtd{mEiIopM)`Qdo*3Sy^&ci0<&zCNH{4pwf38tJJ)Eia$EF+QGs3;J{Le7TXNAMs
z_BqQapKaLJgfq4EaZUIG+PkW~d5sZ&ZTM@geS2-V0{K<z?^+}NI>TNNUQT~P$pWK%
zak!P1&&5XhO@_TB{Gir<SYnhfHSF8M1zLaYHluvGVc!wnqqUFkFv{;V?A76w^gooW
zHp=e{AJW>(_Zj7D!?{|2W35rXK75^)|Mf=s1BU%j_#Uml@ld!q`B(j`hr%!Ods@Q`
zcYr_c-yb%{_el5+t$+7OxCi;qaToXzBmObNelk2%%m0%``PT3>E#F&>@`7+DEx!du
z`3}Q=K75mw@8^y3m%~vl-!B{GuNw9n;Tl^0-w1agzoXsde<S=ozlTq-<;@6x%;#Ii
z_;!U~)%qj5!ehv9mOH*(M*KU5{a*NEtv~XfQNAa9L~9T4G0OKEc2T&bmj9ygyR?Uo
zyYo|I#D8koUxe#v`ToKv-*4Doh5w=TKfW@`zc%de!cS`bk?)N1AHr|z?O~(*m|-6e
zkJ9pg+$jGw{H@*|Hp+iDY)|A0ZGCtmZt57Yc|-0(ZG8kHYw3Te^ON!hT_yaJ8+J4@
znf0M0YLu5W?3BoMtv`}tl$SN^3Xx9Q`lt{YK)%)d$(wwY&@wUXs*wp={;L}0)eSoq
z`Bm$W#EkN~k?Xbm*EP!PMN+hU*E7l+M(Sw!ZfKM@iFDTbe@%??v`9$HcbZY&GLos~
zx1~|uCi1S<|7c^Bw~rj8eXOK?#83Xz|8ILE{w%{jJF-m6-`SBE`BM9%vm;m0o~gzG
z!9h&qkNcx8#`wBL)@%KdZbtbzk!R?iC^;wcKK+lua=<Yz=NR!l4ZCmT9{MLr`bPHA
z|4{vHc_XwEJN{<qWc%F6WG$cPM&^>g0d9!AIa-Mwe}i<gJv4Hc*1s4UX-fWvy7NEO
zsDGhhUmV$@^)D`tq?0c-|MG@vCG5!!dvxSHEq|jUmr4HID)J_4C3gIc*2(s`NCz!{
z<04m*KXv?SoKgQ$!=4oRg#Mk9Nk;h;!=4t|r}gKiMQknK@`i0CcKl7-$@Z0zQd+*R
zjI5@A(#{Q$H*qWBOt@iR6REA``x>KsZltx=pPOrx&ok@=kxcq~N)|-EroF7TA9(|~
z5}rS9*f&O6)8A8aqfx#j@}AbeTVj+ii+rH<UzSDg9L!UD8KFGc-D|Cg*!1_*_OQ&T
zzanz0)<0Qcl&>`GJ0oe@`L#PEcMM2O@A>%j?uo3UKcc30r&0f&$X2aCa*t7duVJr=
zys7n1))?jMBD1yr$vUHaLu9MgAK74(Z;TAr^1Cszpl@P%#>bcEk;o<Fx01VpHX8LG
ziQGW@Ovxig`J;yYM5KzA?<b7%Es-a*{>m1kd|RZc*5BI}=}JCTzPB0iJ0jh*{OyQ%
z$(M@XVZ^@>>8j=H1*81s$S%EoYm~nh`9f>YzGjra87Zyh>&?g#`VT6<ZyNEtB2Bb>
z>@v!CN7iWlwcSSf2a%_={=o;4cZMX^@9(TMueCSw4((Hwj}MIcdm~G={=r_O{A0u3
z7x`RkukMTNIyW&rdGmqS`XX{E`BT%|XVm{9a<!JfFO2dp4f|kZCH(~@2aWQtBMr6w
z@z+NAcaayh{?~U#`S+2twfue`+1)>}Jn|pywSJ5YB)@9?eQ(tNF)~qW|Nm%||76%F
zB5kyMpD@aQi(Iee_cx>56ZL7^rzcvGe5!nV<WUE%aQ#EHrItT`^f}t^D&B9zhohHh
z`3f85C8F<X?Z*;EdFkj^TKloIQC>D0(DGF_`WEd)mEW>Pe1&LC%SQ#HymItTt^Hj&
zx{3C;TE5Cgd{x7)5q({2f7gg!q~)iE5g#+`I??@Fd%KQNer9xvmaj97@&?gswR|-&
z${R=T*4o>Rjq;|3-8`D3wZEGi<*lMywDxx^qrA0Yw~MyX^4rcRZ*SNgqdm#Ll8#1s
z=V-Q;@6JYfdi0pqK2JBwdqnfJeD^TQGYq?DG_2*nr%~P~T20G;pJ+Sst+t;&MtncR
z9vJm#`5qYUN`6)SfkynfhJAkYEv<cizEOTb^i$f8N-i+UFN*%IwHGfk$}frDq~-Gx
zqkM#6kB(N>@;lln9~-?_>+g(>o^^g=fB7;q>9r<AAE&*pmVc~Kf1F`Yi0-64uVjKz
zKGCqJL|1C<`6*Gq^Z)Z=eEQR)AJV>8)1PA0&o%7n(Ht%R(~a`W4SQyEmbN}-8s)R2
zw`=QTwo!gfw4Sy;t})8zMjz4I?{lMNo&TfN@#VYTh@WTJ*GJFN){hy#z=&TI?Wgsx
z78&I?MaOIF=ceeT=Oxzn>+$(n8g0q?Q2D;esGo1xOQTa+KT4Jw<+mF4?a}wO{@3l%
z)`Jq$Ppt1%(GTfwsp;Qt)L&uPtD?WsUr@5jD8JLNS4V@|`dn?4-xpn>^%w3l%GXA#
zYU^{YQNBLfRO^qekM`-8SiaTFq}SSL#BVU{jnS@J|ICbk*oc25`i0h?c*H1wJla(2
zuRU&*KVjHgqJ>)jVvAA!v|(?H?xMf(|1kG1;5JoV-1s_cpR><Cd#|-`NlI~?2s<Jn
zB;=MTw-mW0grY){q)3val2l3;xkXYGrBYD{NkUR0xs*`kQYz~I8*_|(_MEf#y!yVk
z|MPt7N#p$H7;}s<$GnZX*4le#u6Hf|lE`r*e_mqoKa4zNoG(7K_$wk6js93+@jtTg
z>c|Vmd1JN3|0J@&IM01z@z+}Tv&curdE_&Tzuv;1M{YCv<8zC@IkI4b9<R+7e@o<Q
zBmP?~{<cU5Bi`FA{x=rh5gBR3e}~229XZ8_|L(}EIKO1(-)>9(dkgQ4lsDqNH&Vwq
z-|e;J_gnZtq^=R)0~Y^K<PRgiK4kHaM(P;xJZkZeMLst2>th!GcMG40Y%|U?CoI0>
zg^YMQ-dLPhGVyY}%v_-R-L8dmymO56VUG74&MTSvIhK5`g~Q%_<9ryl_`dgvk&pWp
zKkkh);u*L2r+8b9{QMM)f2xH`cs-5ymazCGz1xj=mh|%4^LjW?oyYRM$8es>w7;ZP
z|11mVduJQx!+eWh#=>R2_l@&US+92+w!cK#ujpN9#J{Xn{~QZf^qL#-uW0d87Ow2|
zGWw&k#jomBG5Vvb#lOHCVf4oZ7Qd!<!pP@qTKrlTzQ~Ik{c(}Sujf@le`KzD-eTkY
zRL_!cVBtny2P58%ymiReGyU7hl5b++X5LOCe{W{-TX=sN=cg7Hzooa*$lqI9{5Ia{
zMm*bC{3|VdwfBS(->WVDHQsFFd~}Vs9Ot1-d#|zNJ6X7^cNOBBxw?AWk*{a!ceUiZ
zS-6LHgK-|}Vexx;!;E<LviLW6lZ<%YVDbBT*BSBbXYp^g@Br^MoR>1!0E<7!t761+
zki{S3H8kQm#NrS0x+1=rYna6!;r(Rf<0CBoDDMvAJT%I45x>myrcsvs81Gageq+4z
z5wFbq9%C%|u@-*F``tL-Jml3ud@}VPvg9AJ@C0wAah{oA@t^Rv80VKKykC*uX7oQ{
z$xpKIWbb|>UXv~U^Ip=3*Yg&CsyEp<pG>v*GrU)f^T-T~Kg(NfoJVF^{5jrZM*QYj
z{8zmV#`)t_i~qWJoe{s+y+Mdqyl?=$?v+M<Nxw2nUmW%K=Ywy0<Bjven_fQRm8t)x
z_oU=M#Z>)u*6&>`_U0Jpg~gVC?^$@MSKWx`Qtwj4FJo`1Hy!!at?-w=IN<O8F86vE
z@m%gzLi{rImwWFb-y&b>9$l7W`@72PXT)=rSLd&QQwg$st+M?6*urbQx<<U$dM&fF
zU<c24@XvMjcwG_yaiYy})_Q%BFW&)y1}OV`d)8U{H+Vyh{@CFCf&QyisBeQM|G9-X
zdv_WAvDxBp^~M|Lx2+cc8w>CBrWxn8o!+I0f5xAkmi%rD@A1YP=d(RtrGOr<pkEE=
z<;?p<d#w6<E&P*L9p~rF^^?UvXyL<NSL6JA*gJspK=ncehb{S|7Cz=ZXq?ZEc>%<C
zTw(oV-gM;W^eeWFQ1<u!{oT@c!YgjX|Abc&@oiA3?}R1)mxW#b3*-Fd`h`{T2i`yN
ziyQF{`ipSh%EUKl$%iZ)@!vMiUlEHR^>-QPgQ&%iSvcw6W}Ls07XK6r7xxoJyo>t}
zVEs8>*vR63P5h)i&9{8~bDg{5?ZSi{XBPftIkzM`B42;UbsYL2CiTZn$Ok{r@B_&I
zRsn~Ee+u$#`qeXfa6$45k>Am;meGqpgv%p;-lf%Vfc$u$#=jc*?-Af^kuQgQmwulu
zjr$`XJFelwlpo-~G~a=L*%~f@e<2OOjQq*dFw7KQcoJd7ucZHsasDsqzl!xR6Tg!F
z#b{p{XvoJuir*PV{Q4(XAYZ_erg8>aKQ|yh$k*^u<Og+usXp=FL;lnmxPst3w3j|#
zPJ1-*$DzISktWJP2tSYfhn`KR`3sTn>;a}VocJx!-eVfxg#DR*r8dpK2L6@M@Id%i
zLBkKjzgik@1OJ+77-kADeBRWGU%ubPm|yw+Gnn5!;SXQ={*%aWE&<5LKZ@TfiC;cs
zvYY|Qa%gWH{gobH)zID&!0GYS4(%-ioZjDdVZSY};TzE2%E0OIaSZ$A`M~M@JA(Gs
z)NmQJ_afl*ct42!upw}IJXeLkmjkE$S%m$o9dO#8&#+&0(eU@!e|iC@?cW9eZq%>~
z|8CasqwsH_hNojcAFSae*e`}^_+I#Tw}w|?KOU*!3fPZFYxsQlJ66M2!rzBA%>Bau
z4>$!@f0py>Vg1Wo<@^R%-})5xXF0z;+It-Y^6`)Q^C6=@2PO|<J?en*Lwp*aeX;%z
z0ZxzK`>>ur1Dwt`9>sdTK*M#>{x!hq@p~WE=dXd&`BXmkzk?dCi2aS$gY<m49Q#*3
zaC(02!g|^aIPK2}_}2$G?awi+m*X^?4gcl=r|p-5e@isH9OE5bP{@zKKP+*DcqZb9
z5EbHA5kDFnX?^RlAJDJPr16dLFJHrd;eJq64c`s_8fbVd)~nVUMwkmP%nYkPQ~r&{
z{*&_m!1_I=utv&%4C~!Jz!X2~&lYIk1h|a<(0~0Bk77PQuHnL}_yd`sWv`0=q;Ws1
ziXVgj8GBXyl8Dc<sGE;}WUmI|(+%yRjhn_x2l(4h!zeDiFtaUt)%^lv{jTnpMSD6I
z)~N1Z4tvM5GV`~Pg+H(|So&)FJFy>SuG)Sjv_GS-w%-!|R)RoT{3CxevZU`KOJ6<z
zb?mR1tDe6C`&UL^J%1qDn}hM3USBe@q_2UcuaUn4`(5U0<PSuDX7n}k^Dv%TL*PIA
z*TmA-%#RxV)yyA_{hR9Z)y$s(KK*L>sVJcFkmeA@H$z+cuJE7QuKRa|zi^B0-xdC8
z7!QL`w;lfdJ$|h$eQo`_js9rse~SGw)84jzRrLSa@Q=rj?O!`fUwi*@qd(gF*BbrN
z-mix7vl6~l{g3`#W9jSc-)ZzmXFr1eptkYV+205MtH8gCDENE)x?1|K^ItUXmtE(V
zHtt7WXUX@la4)}_5&vEmzmJ9c`Yq8vnX9jV8vK0^{_@q=?}K=+(C}{T*W(MT^tJTe
zWZ?n+G3@7=Yk*%2@uGZ&uK||)trouBpKja_yWQdsvG6dziV?qI7XK~_kMI{EKgwJq
z{Ev|@(Eh{M2>*NJ3mY{&Z&SdTQdnh#rEjE#NBdcbU*;O^-;MZX#>Z$&evF03`Hvd$
z8|TkOK9q^yI7|Lv3s3MbHsUwI;y-5LC;gSkS2EX=7Jrh3C;M%T_)YeEB7RE>`**Ux
z6!VSp0n$q2e=X))Ck-FOc<8F(5tu*pEADCej4xF7tYv?SKLY)exu*D+p?|icK3`KT
z`KcD3=|6ycFLTZGPecFgDJ+<2$<MOz96x3B&m6xg`X{qK&9UU?T6n&{3Hf5?n(tqS
z_!lcIm~Y81^!FO~gBJQHkU!=Z$}hC!-?Z@C{^>@%-u8DOzs&giwk5yV!b|)DBVJ4V
zdB`_2{w}fPm-!ze|IA#={BMvPW$Z1p<X2dDwSS8dpVj{F$R{)QR$KCG{d<l0to5HT
z;<MJ0UuWSB{%goTGuH<HP9r`WEcwqZ{H6a6C5MIAmwrC-^Nhb=TJl@{0>m$KZMFE@
zEc~tC*of!17Jr9@cl)g<87;ha``;q}ZKvVl*x!3%zWnF?>3d7xUcU$8pSkw>gOM+1
z^zF6e_gnaY{{Zso%yq!x|7_tSer2OSj`(kW<zgMd`2jw=&Tsx;<lj{b*PA2$3)}Jg
zINJI#5&P#uz~`dQ-}m2NEPKECC2+pTT)+8e;CwN#u;4epG0qo5H2gX8t<f4DfcTEn
z@DIp$GQa2Xn`Q403;*dKH}cs({TSkvY2Tlgyb~=ng+K87ThVuszh^G|-1BCR*O@9_
zq3Chsv-1k$6^MR_{r?y$r1S4gUDB6h=?_JpLq46kLeVM6hX)lFgrcjF&kogaC&VX{
z|A(T#V!S=9@ozzV;_!{HkYz7yVLv+3h>sr~g?ug39^aCWSvVPOWW*;K9f^2UNSk+(
zmV7Y_mx!KXw7-PKKP!3;;*q(|viJqj)`(B$DzNzFqwBH%Wv=oTzf$yOBVVs%@z0Nb
zhw+}d&bRnAqrYK(WUiVP|Dx!rh-c=y$l^DMZbW{Vxf)pfCegDH&&<`t;x~^@M?R3b
znp^x<(KnGFWUf{gzg=_#@`cRR&f<57_Auht!Qyv`{$=EcT`Ye0=<P=Qx?B9-(XmGS
zdRzQ{(V3V}nX8}09}vC8h~EH<KRCL?$QK7&{5zu;8}Yl-;*W^7HsUwJ;*YfO=x9G9
zo}(@PgVEzg{`jE9A0M4$#B;pGpBRlB@tkP!Cq>UT;yKCUKNGEQ#Pb=8KP4J6;yK0Q
zPmf+>#B;jEpB3GNd@pm&viL7Ye=zd9mo5IhXpRxTc@}>`^l>A83oQPkXuc7@MHYW?
zbheRSFShtgqKlDlXRaj{e_3?1k?$?D_$#9?AYaa0D=q$N3$KkHGV;H*7JozZ79*Y;
zEdJ)`NF$z`E&kWh=a4^VuCFcr_UL&=Jhxl?UD3CU^UE%azbD$zi02-Qzdw4F5zqY=
z|6p{05zm7b|46is5ziwQ|5$XW5x-*=|9CWH#P7JpcVZ=t_^F?2D-0LzgvKs3;+IW7
z<yLs%$w2HQBcBdgd@t74h@WTi<FPG9ejT^?NedT`{e=8Ga}~GvC1YVDo+T}QeryBs
z@645N@yo?dG2&Uy;+MDZxv>|FeEVFBUp2PC$gitf{2H-!Mm}A`;@63FGvZsv;@6Mu
zGxF#97Qb<9kP+X;vHKCf2897=Y{@sZaP!zSBVTTA@mt0E8S!itdl~1IjQ&=Zd>ad2
z6-(eelew<4_#I=X81d~GtAThnF09belJ9KcZm|YNe7jlv>tpMYUuUlCW9<;njQ;B_
z`Q8@p8|#hpO6KZo@%zVy8t0S#7XP+bDI>nOS^S}~-Z+nBuAvrxcr4F2UktbSqhb-9
zH!{~Ki~m5Z2F@Ru>j8`ZaBKzg?acMC#eXc;-H6{~7JpLgE9B#uYm&u(+QQGpel+s&
z=PdrTm}A5fSiA5|D;Ay|d&S7lXIuPNVm})B<trBdwb&y@e*T)pUtr-yu}6)3eUZgq
z9DB#e*B4v-C9%tmcrS_VL4Mw#u#HPB`423-BG%1__lnr9h-c>h`wB~brG?kTZZq=r
zHL>c5U&j6#OMb0|*T-%(;<-MSjre8kueankT6lBpG$VeSE&i7l-Wt2ai04*||BZ!r
z#y&Li`JEPjmxcGlt~Jg_do2DB7XC5zg^{2BXz>qN_;75mk*^-M_(v>!EEY8S=a|L+
z-NJvymK*u(pB7&|HY^-n*ze;}qyMtwg-rZ`_ggF+jz4akAHo(tV&PbPmT{hl#g`%9
zty^d$X2}<ew=?>yn8iOme$dEwPq+9bEnGU@$LOEZ7C+y@W#e}m{ZrQBpJU-v{7K_{
zk&1Ui{OS1~UnxtzN_@U?o~UB+tH;kX;#=L~*N$Ie#Itt13*z}q+MH9{lE28p_2WMp
z`EPxTe~E>g#2+x?-6WoccxLXuHnHR{wQ!4gF(aNWEdCW1ZWFI+#IsHOH{`>a{ke@L
zf2D=n$D14RZEx{ASh#ciBO_n#Z1Jy)e`Vy$*IE4Q<G&dB^7Zl2h;M_!{<z+fzcHRL
z;(4RR?`z>(;!hjrjaw}K01Mw1pKF{yZnOA9<ExB(d8oy|D?Y(Ef7}({iTwD?!uH%{
z$q$crL;UhJ{;h~tW`5rle+2Pqpz%v1KAG`zSNtWM7rJTu3(($S8g7dAjL>j*_&-U*
z=fdA-G~5^dF4Az}pZFu-+#CPR$S?1Wd+@hxq0qfn`|h*w1Mvz*e?JgkgnT_y{{c(>
zK?^?;Z)BX09*M6(zMi>%_=qL{sD&Soe`B179*_Tld@@u2aZCP53qKuSX5{bo_wPOz
z&qn+**K=0=Y4Hh0{H9s_S@9Xh`Da#qDf02^g$id`@^j;DjPuT1i~p*HUypxnoPS=o
z_>1D#8|R-z7XNJvzZV~3#PdCizr@1J;uDSheObH<;yJ#seakHQ6&79{e-`JZ%(dF$
ze{A7T<F0XD`ZS)6_-EqzsU^QLevT3UjTV2Cg};iQZ=9FDviRS`KQ!|FZ!G?|7Tz6i
zV)V~$i~qfa_r*IH=c#@1zR35d6b5LYCI6#^e~!nD{`lGAAF}W-@eaoM>KBXud;E7J
z|NlLH9QkQxJ^9^|KW<?sagK4mauRPMzt5~!j`jYFYvEwxN+aIE#K*|*XBEaHXvv2x
z>?O7t=P57oGxEnwJUvT3YT;z!dF20@E1B4a{4i5LX~`F}aEZhSBYq_kBN4xOg$hep
z@@H7MRN`eLzb}=z81WlYSih7dpKsx^i7$=(y{yGQ$HJ*Z8{_<xO7ukhGSA;qmV6}(
zS55RX^7E<|znX<>CdwJ{t(oYF_-5?YwB&19xNhR8kssEz`1LH@FcCuhGgm{4-`K*<
z64i|OH?#Q7E!;A(z{uBITKv`)ZkK3n^iMmBf3<}>CRQ5xd&k5U<dfYB8`RN~?`+|2
ziC>L;vRmQ}<mZ|C-7NX;7Pj99d)MOI@9*7W{eDD$3lFgHKnve$Vf*(e?zH&BENuV2
z`rQ_Pc=DsC={YvPZ(QJJJ98c?45m699{7;?w6GPpA?Ij;#&;d(ia+>yFnzy#f$KZ7
ze`QQJnhV^d^WAvHl;ah+lVX1yljp|@pXS6S==MuGr5Eb<N;^;e#`4vad|Btiqq_cz
z&XR{2cU1gou~WtV84920WZ_{jwU3^87r51&VfO&YMQsW<;?L{S^XdY(mUC%C9bfGH
z8RYuwRQ-m|TlBK2TvY#*@}!+F!l`#m9P7yXN`RMi_k@ad;rSN=PPlI+hIiKS>O@OD
zzL43t)YR9>;z#jixFkUxTj1W|uK$z$<@RH~|HypqkL6C*E<L`holxdsx9aaZEAi($
ziYa}~9It@&jewB?x1|%T&+REiHr<GS&l;AeoV&msl{M*Z#`J!Df%~@e*a-X~7sY2r
z7S}JU^u6z#cTbwj?=bIqkn1l&ae@1LJf|(=!N5tke$E`+!JziCf9;$~r?G#dl)jG6
z$T2KGMb&o_gYy`(d^cz98G3tqIny6t{yZfgOw^yne3tL$yi!h=ALxW1VtLww3tTVJ
z;cQ+15NBX1UH)!o<yc)lnP`a@b2I*raweR@^6dXur~CaZPdP?`TOzSwj;?>a)4w9i
zPg3oD!YPH9*-0P!Gbrn}Zv`v<(5$Lga{W<CU#Y|s@9X-|Yv=3wraGysm_Jd;rxNAy
z;i`<kvz%I$b@^AE%J||l;<J3s#L{xyz6Hwu0_U8Oj2lBH>3*(0TS4-?9;|ad=+5K6
z49XI2-^6nt5SK3+FPBu~@lqUr7q}y`4!>&h57UQR<RbYEhu9v^hu2~^Tk_vnxTA&p
z;N@h}$m_)xXVfKZpVx<Pouv(Q{GBr^o8@_Z*ynV&)`uOK|8((uUzE7Qz#k_b-=_P!
zB<KDUtdHk!%S7G%%xC*IWPP@SF}1b8y*X<~O7EYaod)?_e+U{;;Qs1lox<`wKcCKO
zI)c36i*$@YV5z<NO1?+d_7TjZ{}Z3yU?D!whZ9b>Q+54;tgX4a{k*K>c#(?a*?uf*
z+Dyh=|J1Cn&(`@Rv)(VG*DsSb1uqt5>X*-=U%1TJubj0cq4O`uD*2LLzjoHR^2{HH
zN(FBHtc$*2%=2Sx)(kj8`d(K2@mVL{)$2FOIukEf6Mwwox5#?<O`YE+tKGRezkOD@
zvbw%5SqIM7$LkYW%kZ)m>D!Ed1@4rrHxIBp?FR+!%&arBn9uz^C+p~6B+VDazfJ|V
z&+_xLChlRp4!i>Q&8#vPGwuqUbff;eproOX;{TP^UDoTGil6OX+?@SetlD?0`^Haf
ze~FS0xxF#asD8e}?`Eyo#riiY{9)F)`MN)=vgUrL`}1j587%yn`k!ZgvqP`HCF=$l
z&hWp@8nK`82ox5$-)F73Krrkj-K4(+<s{GR#e+E$TCo3@yCi>?`^Ia!z8|yh->d68
zoRyX0`W&y{vL@5SmW$$hiM8I0aXB8`-l)4<_RoCC7P!USAIq>l?yu9`6~vH>^gVwL
z+vol&?FP3pX8Yybr!Hmx7r~7J_g;6)ezvy~bqm~^T>3^$@-ScFbKP2B>h;fezxH(f
z7rLdl==_V_G1+?kMsAxgbpB=T8*eja{jJ<X+Zhj2{#@nmYsUW3XZ8x*2i#4s=<=Q1
z-?r)U*SSxYXL}s4-tHzXBc^!d)nk1euSK!t7|-d8_**P|pf1aE{1(S@?&tU%Q~o{T
zZn>Q8p_%aSad*TS>`yy|pK?o_#<-=z&%3xot>QUG;Ti7E$*jMv!gJh4R=$>1N|&GS
z&UlvPS^t~vyi;`kyKddbnBP?C`_Qd4mHFEhJ}vOca>i$38z^vBxdjiid;`V*)EzaQ
z@d$+vyDO(M9;R?2@Yy4bIlung9rLJOe~Vl2w9fz0z4mz>|K%2YfpK-EFA_L0QLq24
z+i#MNzjqfs!I=H|%^f(7G271xEV`HbgZI0$0v%fD{c(0+O$lyqPi3!spy#QKIewJ`
zW1@_?KQ0J-KA81$f7A}tJ5%S^4?H=9`CPwA;CMpkw+NhfGxItAZ311UFn_zUKO<0X
z8RN1l{_O+BZeaNair*zLcsOH@_dS8P@6z$}fe&wF%<b<H7}`&-e?y?yZ94zXK%1dD
zekc$e#+c*(RN%lZdi`4hU2oO#ZGo2tFdm`&yFYN82D)4{UwZatKKt`n;H5F#AH~%C
zm=lPu;`VlcY=JvJkouT$f8eD1M&RuAEMHgg7YClKXwJvk_b|Vi;xCDHxlh->G;qsD
zy8e#>wO2D9rSz`}RKbV2Nh9lDA9(!)kB`nu-)Mi)ulPeQYR~$+b$e@K^DflK(-(oC
z(eb2@=lhnxs9PD+=W7exZvxl%((%r~7ic)iGynTQtFDas{If4`%_WRk-@(8;7cmYg
zeMbWKBd}DT@v%TXY@8YU#{<K!)UlI2Y5-%lmz{lOPaTJ{-@01IUiM?17_&d|>;v@~
zvp=V1UsZ=O+dn<K%*8rBEBjaR2iq*#UnaYj#D{UY>`?<*p8ctq-T8VQSI%CE9~;ZW
z=ltxS(J_SCpBmZI8!%>n>STwE_|(hZX!z4G`@R}1&-R;UufRkmeT<uDkHWyq*lU^H
zyoZk4X1{cmj<3$H(UCFx(=oe_5ua<br`BdZ$EQd3%@}B;pK<T(yjqOe|GwGHML*+P
zvMUZ^KIhZ7W-t2&8=YJ<9^<`r{*dg^*Xa1J>_25Zas83m^Dfct-JhKhf7srG*;{2i
zF@7ZbNn<=cmc7{+Pfuo7l>TG=le7QqsoS5D-ADS5`7^Q`O8+r_DZ6O{-Je&p=g4?s
z`>$u;F8#;&&Ft33e0wMRQDeTnpIuSr8|(itJGYna&&uo@toYq7^N-~}$)3_hmtUX#
zhvDBB*<EFPu|Hd~Q%1bL$=)X8i}^dVOB?a}KD(mKKeo3o`>2dB#s{;nk@?5?X!b4{
zUyOgxe$*IWe`Oz&@x}H6Im?Xx%*{Epkk`9$7<2`0B&XF-UcdU}5H6N;WEPD^zGytP
zI)~d&qb%vhbEZw^`Uimv-1BnUP2u|E6|R#r=LN>&6t14LBgpH0zQQ|WPgv)JeTP^d
zjsK*3dd`V?BCq@_mGkI!wqIP;FPn4qv#kG!!WD8#4rW|I;mxsGPcX)?f`40MH&i#<
z)3BO}XEkPf9M79_S~u14z?>?dFh&@l?^tY$bw6v^#mq0E_(S8ZapQn2OjQ0i$vI;P
z`_oOuw?)pDCz#LvUzc;@Ip%ZxdgmO=VSV{Z-{Dwq`a>@2kM(neuk^RcIek0FhwZn|
ziA`pG#~@qacFM`Sjd4ohJ+b>HGR80h|Hs(y^UZi{v+zda{^IR9!<w*tj@Pi9_8&9m
z`2QIzCig?AKg+oHB}N<gp2U{xkjUU-{zHi?4E_U&it{->WmW!uPtI4*GTwzc1@5Cc
zcT8a1U-6&J*<p>>DHxd4B96y9InAy6BZ=49--9ZC&*oe<m-XS;5B<|}+C8P)o1K#!
z&$zqdznZi5C)S^@{8^UswDx?E`scg3tRKft=v$cc)a8tWN`6(&B?}mH{65Lq^&IPm
zddRQO$us0P<rIHam;WkfvLXLX&I3=eKeE2$yzxF`@&)J7obZ!6e}B&4Cm2@(ALr9(
z&BeO>!JKal`J*}4y{q$o%UL){*Y{`6L+|N)H@IY?&d&{g{g%#;1fP0b=f{KIJ37Bu
z@P|7%9!T@yUy0x!IM`8t^7twhyz>a-GgbS_28Xub@myBnRIqz>9ajww!$F(sGrwlA
zXAK?K4VJi6#|?vh?qvP>sFQSShrg<?^P2@5Hq>#;;46)F+%EWg9UXTJ_Pbce-GVn>
zrsH10w$*gpFW9HIjt2(&chvEa;QnqpzB_p2N*#|1?i;A%vBAr3*75k@)0jA!csvn2
z)>p^R1lL`!<Eg>T9dtY^*zQ^#zY^@+R>up1&J8+#I~eM$<0Zk=XpS$9KiofvkHW;t
z__HFo8aI*&Gyj43xT|#jn&7R?b-X^<=>i>Z4*pP+*Oy|@k#J`u5)U%Y2QK4gCj-57
zoSUrwBID{x{+-16BN;bV_=`l~e#TW5{xY%QJ{@mK^c}6^ZxVT<bi6e&&A{I#+Ky#D
zjpu~BCeiqM9j{HyS<bit_+{L1@`4X^>?aR=$e8>s<HnP>FVXQS$vU4huBG_rB_CO(
z<MWeiv7gb!{OZZGSL*n}<i%p2=2scFX>$2e<}<!5d5_p<e0efY>@#kaJZ%Nbw^Q|t
zC!ZJp8K0hfMB1OP_-&K-Nc$OImCPH#{m=Vtc6@3F#%DmjzzxS2;rqMN7p-w&Yk$91
z@}EB7CEcB&PF1=7GYa1n+NnLSD&zJ_%-8N`mvQ?f8fpB5`$6KNPTU^auM+NuiB$$(
zkq8>{D-#KW|52iqfmbC;82jIii8Wm_`pdXCCk|b!<Nk@6U35G!v9OztA5Gj~)PF4T
zh*AHEL?fgAq{JPD{XvP!hWwDkm4^Pi61j%{;feWLd&{^_Cx#pGdnR$wwH)tJ*wB*h
z)?lA|d3~>|;=dy}ZUfI(-k<jb=k#Lv{)!*XTi;5b&p!pLch~vn=Dl4@=N}1{>%;tE
zs{U(v`&;Y$--EC8(Ce?y+gMxYJGrfJqcF4n1am*@$MU>iBy$s&=zK4CSR);m$lcRK
z$E9*FtgGX)xwGr(IF(!Jde+bJ*x*gLLg!b_UD%EJwEiUB6W-98I=^P_L-=w_^0xv0
z6}Sy^PaCB3>*k){U+1^Xz3mpA-z@i=0Xn~9?ur3Azg_OV__EK8{$9CdZ_@eQa;J1*
zKCK@G?!esHH|qR;xl4!W{JV4KchUJna$oGkeD43Txs`kB{871Y4c7UO=hkSi^B>85
zy`_$y&YgUrj;G|lgZZAm@aWuWuC3o?+^)%z+In5a?U{Vtz`c`gwe`A;dt-9Hfp1E_
zC;LS{jFfRZB<IO~!MIa$`bZw{G=7rq#L&|d*uRH?3*6J=+b`ty4O0Ai;ZgVTe5U=S
zjC)=3Dmf1|Ml+J`5&v#uJ+G6z;~>{({-6E^V|~9k+52baFH`jc(d1gz&+C1I<bwxv
zz8~#vtpAOY{odt#v#0X!ZGV)k=QKadxMwE6e_Q8o@IBcNm|r@1ZAaEm?I~~{iLYG7
z_Nl+ixD}GUZ`1jY$6L$(!u)fSx6AXV5s**1GjfN|VEM&rJ$Wg2)nkn5{F-!M&Ap~L
z`$PL7^6lKK!a9B@_tw*NyfpWgh>kzX{VA#APjdUkb-W?>m4uGJ%$?!s_?z6lzK(b2
zo*UEgzTAhZ>iFl}GUw^|*WC71bbKOrUnLy}LX|4$I4=||rQ=xW^s{w*YUpqY9hVH9
zUQEYjLZ^mwTt4)5MIBcTy-`}n7lc-o)p706v@>*EKQ!)K9XAQ}Dx>2Tp*zmeahuSU
zXX?0psLrW6?h>k*r{f->%PMn!pQ*;fgP}_2G2X0jpHP>p8T0vIbm;L%c>d9NOuB<Z
zn|@(T<G;Wi7TULqG2c(99<TB`<G7N)C-iE2);CMZ*N%Vu4fARLFL1|)=F9yxvX^ux
zg$DOwKCkD`gqqA@T%h<bgzl@(?IC+fcV=kMc;@r@Yj&uK@Gn>VxuHeBvi%_n&kqe;
z#PwPJjnH0se`AE=zZ2^6BFp188T2m+eTW+mv;s0-9;!Q>?a}?nq`NxQs|xdRn+kYs
zXxRm<e~Q8zLf+@RUNr+QaK8-wV4a_5{LK0|AG<N0wMm!1K3?-0*2nSL7V6Q1=Ree`
z=ke3f5#%4QkAH=7#Xj{<()}@1YzFJ2^{2o+99rLs{pI_?x5XE}#`U?sj)g)a7}NPW
z=^hXD?7;T2ffMeFiE*{LKCicdyb9A;KlxYS=H&%uv3$OgpOpx&C-3+o8_z*LeG$I#
z8QuR=@=jRsIj~&!uS8y(<7^Mz4*$-~8)-eSc;OiHCn<iJyp|TfPEFnabMlUA`%S`q
zDN*$?-Jhy?rQg);*T{SJcin#NydjqUcYa|$ng##r<u$hWk1f>oHOd=^AW(#OK3<yl
zu8c2F)o+p4w=Db1{og9D#u3)fxLsbSLpr`D@9EO4FJIN~ns?B8p1KeNjqKG_{2qBh
z%fA|>^!k1Bs#^SgCG`3?<&FE3{iE@bbO+{@IgR<$w@LT5ylP9BPvb4=4#}(f31e>W
zoq1jBGUo9+Jny#2T%X%_Z{Bg5_;OMH(PNpee@xz-6I`FyhjDouHZtb<`e<I$<2wI|
zyu1xMe{x<=+&`swu>Vu?;-4~3qAcl7%Ns7w%eX&g<}F>ze1r-7*?FDnFdm`s+`LO=
z{L}uKaNkSZx<dE&&Ah75GUoO!^e>Y5vAuWl>R9n!{5k9Ac)XvtN!r8m%ktuu{2^%{
z%dgDKGxDQP@@n79^Ruz?Z%JaBF}}aZ`^6alYyAdzeoyh)q1v}4Z>nYQ6>EHTu=r<K
z_)QD1v+D1*@LLuhXVq^}j^lG&`L{i<>`|T%Zz#Mw?~22WS1P<WFO{$N$AP?ZmcHjo
zGM~=NN%wHxa+wc2o{#1IVfnN1bY1><UU3;uET0uV#by5}-UV(jTmthUeUVI9<`eHn
zk+6sR;Uq!(0iF+p<5_zB;^E_XA0>TJ{n9cXX}l%flHr2)_4eh5N3G@d^L|w}ywAYp
z!<XR8v&mja)lY>Vyq)Xwe5f4$vZ{`&hAYed!SmsQ@Lhd%e$DX3TK=7ImnEiZ_al>T
zqwu5;*<NQDO}dwcfBKE<cZ2-`_loc<#~61|_{wlu>;8lrFx$WFRo2%{>FW@#`G>Br
zYj_X_2DPuV($_P5x}`6+gt&ZBJWt=t`i9`|q<cen)L^cUFaX~i&V@Fr!Tt>j_sC(~
z0A&U4(C}%NzAY3exk&$qRahU#cX+t>6<q&v@RIJx@DG17pY@Lkzi;{5|3>C>{2vN`
zyqGcRPP&hV>#vk}DExT%>o;`#Z1_%TANTi+@D^zw`!g$C8V#lPF`g4Xqb2)yrqcIH
zc$L^^{u|-O+WqLH`&M|yJl)>A;kvKscxm{los8N3@^H1=bbBkqxkh|G4*ytBx4$;r
z_Xb^lefU@HemdSK4VRSh-A(!XWq8oLy8Um%+l==A5Wc_|@B72UjP@T0uQl3#D15dt
z-hU4ddRveGiSU5=y1lH(^fz^!6Zz9<e_rH4qy1jwdZYcZ$c*}W`;(CsM*E9LroYGf
zX?){(U*wmUbX+RZV;5tN_t}wANZd00drqX)c{;8bS=@l_l~DRBMc(Sed|p5B`>@Mc
z-x9^I9*Mrr_;-bCMQZHU?bVI!FydQ3QsaExUc<<X4cXo<RliAOlf;+pT^1RH9|s_R
zxqX*MHZRg~n@HYwy1lC-6EJZz?Yky&z_8ajasUT?;&c11jg0N5x36cU&j-5x-jVsQ
z=(v9*e~)hOj!3Jay1ikM<rnC9c%*Z4-QLJZo11le4@S;es_TC^GH|YrpNwoZ+BYTA
z@D5%7w8-pgI-VJ+f2nS7cBI}-y1myTH-E(XhpBikjQFxXpcxoHZ$%z7+V^f`meIZ?
zk+ZSUWa9f_q<jmu*Im_L5qa5Y-|EQ2E7%_E|0GgnA!7_f*!wKf?0d#MK0l94Hrls2
zl550sOC;P(x3?|wl+nH&k>;PUJ{~W-BQtQLBQt*XMt(KgcOc^4ski4)WTer)qmee3
z>+w7m3EiT{^F+j5qw9CPZtv(g$6H{uFYFyP+UI+{jP}L7>X+&EPVtT!?JME!d|%gJ
z(yR8ej>~$hjQL*K+icADs@|;g^!8rhZNEgfSJR8h`oi<?B5&?;U4K2V^#UC?@}4o~
zdo%AsWB#@99x>)$OK)u>-Ci57vN8Xz_TE~p>%Yc3<82*x_4*t0p@;XqVXv2WnK2)3
z@QOFp?e+7%HS7)W-rdOY;Qe!uxASuy5Aj+Xc$hbMlg=OE?KPfnj`E%#%JwR#@jb?C
z{WQxne#jg0fnI-tH|bHG|AaT|b)7%iyPyVR-fy4xzBR_@RBupQoj=1XFz_tz!v4(X
zd|{6FqKse0uX>N)#r$H*-`Bky1Hb8Acoy@|1i!#t?9I3Gk)`_mVaP1HTi3VLJIBDw
zy+yS+KG<e4|5tf0{KWVfh1Ys_$o*i7SHk@)G1;>B$1f~j9DKZw;tdQkZlLf^@9e`g
z+xenC?J=JHN#gGU_a|@rGRDM9x|_X51uRSdr?Or(SYIvtjr`wx|3}@wV_sjmU%>ut
zNW|aJ^|}7!MvSpcp?-1yqhCogU!;Geet!e0>`M)G`I7!OIDe!sk{@>|^Kq<&zI=aD
zQ^va#F6Zy-#&|kplWxlY{aPJY@v|#2?yvaO{nF>^xVHcO7#-L1T?04r&%TfOeN_Es
ze!Wq;{1yHet#sVhKh#pk?fnYUUvLxtb@q$D$@jAuU+4FHnB}RhNw=53X$JFgn+~|I
zUo67&e+}AO;12L#+Qaf^K)%4e-7h|!`v=nuc$mL(1lM1w>W}bC<mvUt`Afd%`qb?O
z?gYQqv`qgNxKH{qYrO5A$@=!Fcu)4fxQ8)rTf@I8{%4a||3Rg1rk`)U?=$3g*54ES
zq&vqS`#mbkMQwimH|A45g7<U%HS#<c(;WBr2PgNu!}gfJ#E*+S>s#hucucRq+J8@;
z|29_j?@0D|ORxW>f4n)jf1qm5R==5GyaojSzV&Z9%KEyYe$w6T&s)g#8SnM)ekc?F
zq<g@xA^B`w$QQV?;ybPPxmG^F^?Ci68(;q&*Qd4@xUa`=-@)<Y`k%&!B*2i1WZv${
z^>GY`{KoiqyY>2C#mg_!afxWNB|1JU+H<Ln3!>q#bzDALuvy2IqLU5&`O()6e$8m*
zt-Ab0(I#K&xIy%F!=EP6Lx%n4(M^Vbt)iE$*Xy^7Zk73vjrJzp4$&Jv*7;qcU#``0
z_vmjQ>9}{a`838<zrgJm&EKH&2SnFBuk!~-8?4d!cSfI|&Y0KN5z&Q58242A@OkQu
zy8P(q7gsP2D*l7fp-mXG{qfOTF4OVE=<4pe{G{li(K>!6I<t+Ar$jeY*75Y{8)J1m
zD|)msW44FyQ*EZ>dC?|@y#>($hP_46a)!Od(YA)YCD9s&y=BpIFR*@&&&ues!;CpT
z-4gkqFy`^SHrnoT#vGpw(c27vH%I#z{(c=@ew{AAJ$h8uU#`C^I=i*b-xJ*=>pS!J
zN8frt=O2t7Y{Z!3b0oS$_7ld(q74jt$D@M`drqu^VJ|y&m0>Rwt7X{pVgskLJ&sR2
zHt$o$9FO9$bt`pTGIs1aUA|mw{5qYVADg#I$LGf0GUi{^*k{K4s}bAxl`dZ=7WhKP
z^<(2+VvMk3el(6X-KO)K$JWl$`K@AI4SiR|=FVn5x)t?1#)fRs>vxMCcv0tH9~*Dj
z?;9KNnJ(Wy_ULLI-xkX<=J(K88DoAAj~)C#mmd|&U!da$VttnD_~F<jEk7x6AB)|G
zd?X9Lhm`-%#Ws%M^}d+Gvt!-wWz7BeN^I&lUY|QC{)*Vdu{vHKd!PdA!>~p?V)5bk
z==zGqn+{`sS;a3K?>v(ERTWOfbL9RG+b<n|q&4$7U#k+ocpclTrR3|!SI_4Cpr^u3
z;>TyOe%>Ei#23zHdG4P!@%z4IKF^QN@xSh5K87*;Z69BQ_W>v#QH8II=Q@npzgyx{
zt$g5<8oYm#zX|vAL?`2Ud_i*O66Tixzl>Wh+5bbf&*T5O_!OhRrp15BW_tz7{-U^h
z0eQn0)oD?e`R(v`f%{(k_igO|B!!p7&;6NkO@&v-+Xr-g-^6EDGxcqk_>+GH?l1A1
z>gf7+$A@oaeV7K|?~5Nkz__}?KgVZV@wnN#f8N8wN9B16+bf&cKg;yz<IlLinO`+g
z_Z^eJeI4^T->aLLYw7R4Paj{+5;=Qy+%6HX#r;8A%eeO@CSIuH`xEO8{9xj013!{D
zT%YA>y-c{zCYIOJ@pFkK2LJiQZajaci{+;z{_L*f7ZT+f=y+<Pj=W#V^3xKd#b3tL
z6IG1ouP-M`%J^gc+(b)5{*}ZmL*J{3{sx|xxImsCbN%^=afZIv60RZtdg4lhzaa6Z
zVQ*ogl*Ehmy^%Oz@ZU^~HRAPl;x~E!h2~en-I;j!BaR2--HAp9{ywqUz&|AJl;>A0
zzc2CB{d)Z$6BWnk_&}nIysyLZKPO(Jg8?qahZ8dm{?WuA2LIQ@L4*HWqRA?~{vV0=
z4S!A~ZZ_=ymDpzZmzC@_kH;s)i@slF$jdq|>HPkxj(6rvd_~9mb0P-+XwJO`{xfIl
zTwOjlc&1T59=!T4o=+3e40<2@u|AAPxrDa{XIt+J{bao_^w(o7pMGDc?|F<jqdiHt
zPw40zw%=dj!J$iDV@&H?(tRN`-+F)JY-vBO$9SF^ivPj-hA2Eg^y+)OJ~97|&>0Ui
ze}v+{6Ix-tuW{IVU*jY3hvH57^vsL6{vd?|dGFrHnEj3B{Ve@cR`E~CTPe?XS^k{7
zn{UwN&&>-+yji|#-bE8K@h5xJwf-eM&U)TGLF{20g@5<vZ597UC_Fc>a$mNGZ4~_1
z^2*I;{cLZc|Ciz4Cwbcp|JLVSX!y6*KRU_u??Y|;kbm=KeB>*8wZqkoc-0Gck@3X+
zk&IsUq^WO%Hr_~Ig^4Er25o#2zqI8~3(KFZ$IbdXt@_u^H2Li%KI#76WbxNn{K*#o
zQHvj!d@ijoDC0Se_ZaaS<&6@|{W->~ZS?O$UJDry%zwhWS>jt&#e0=^xs1oU3UBb9
zpUmxJ`G>s4mcH@Q|Fx9-Vef>@=f(=3@UEBfn6|gpvj45zpXjFKJNuW)d}Dl_|Fq1X
zxZ?Nn2mQh0v8Tdw{QKVL`N{ZgzmCCQ<|hq4e*em_x7+_l-j8H^d;Ocl9_{yZe*wfP
zH8w)TNnwqmxQBr~&{E^1oC<NJkmS*ysSxM4;YWm@r`S%4VMbrH2z}I8T&bk!D<=9L
z7k#G+|1?K^mvwkj#JL(p;in?bD5AhPHag*_BMy!aPIz*}IY{)Gh*N+>B>Zf|sQ}vT
zxrkFqDA-Qwbg_3P(^AhzRGuD~B6e{vmfBZX{(_X}I}ZMH!c!y8c|@m0)cb1T=@IqY
zS>YKG=WZ&W8ByOw8GaFR<j1UtL-&EGd?wM^5$6M<@NXq3`A7HNh|-lhTl_nR@0FIC
zBjx3#yduBH6n<I!m>Y2#pkDZuh;uVh*uivH7}H46HAG*HIERSNi#Wd%ozL+JzZP+D
zyVwc84n0Iszb#S3v4hY-MB(ocQ1Ww_P^fWIDe<ea_`6X2MUd1usroPb`v&4p{=nac
zMB#5cqVTt)(7{CEZ`w~BzcTSXU;L^r{w@-K@eDxud*Q$A?_2+4e6i>#zb+Dg-w}VY
zc&YMw|FXY}|3`o8i(d`J-}l7dMpEA7U-tL?|Iy#3;@4&3?^5x%xs+f2FZ=t!|2TfH
z5WiZBzstnmHd1~i<|NJU<q`FL5VS4~A&hx4l_>CHp__<eUC5^SvI6TpQLGENUEqX2
zia0HaVxC=16!o#~sd;v@(6K}@&&Gq&x`4DWGtb(IKkdcORpMs{Dew3%`MEmc;C6=c
zQ>|C<6WhD;v%gTvql@&jllaqB{9Ge`;u(*cU)TLhetz;l`q^Flx!!TGHK_fs5>f1j
zgQY)J|DyeBy+=QPC*^eWh5A|Ti&+0tgwfA6i9)U!(NCqH*GWG^53QfHu8tJ?98vT)
z9tWv@o&_5CETX>GD{zCOe#5VDAL}Ll-blaki2ZcE#I-MfPgZz?j7R7zCi+T<zB7g9
zOF61LshdP!fBv2eYL6-(AbA7YqwuXFcN=V?AiNRnCHi^9sYY}Y#x+sc#Sm5Pz>v(0
zTLe?}JKiBEL2_S6{ml{eozLMfd0qwX;?FY$Xw%1)8Y=aMTlvZsD_{9q@|CTUuWUO>
zzA{4e-pjNwFZo8=JIX5GF6H+-PCopid_|2D<SVrZBVTDt^jq{V(H)XU?To1J-wW@G
zIBLH~IrT5)E6a!?UMr<PjC^IR`1g>^pYO!}!%{vzvwo_6_&&2PVQ47(6NzFRz9Mub
z(LE9M8@}NmBu;xHPAT#O`HIS`ur8_b3qRHP#W+>#6{wp3@R#O4jYn!v;kbNM{DRRq
z?3CIs{^AUz`W<I2q=pXVSO1E?$XBY8-|)8<QTW@ODEw6G7HB`hMfp2P{K6SU`TLXj
z`;3%7_b>a4eC2<NFP?p=IASqU{vH&6r%5^PCI74OUHm`#J5&6cE&d)7e_xXFm;Ysd
zk+1wu@trGv%@co*h`;lt{Plm?-w*!B@w-6$dQ<%UMf_bP<!{S=_N%N<SO*5t{KGuK
z&{pdLL=|066zhUIzZ{D=F3lUP3)P7tUujGf^Xzh>sNa<+=2uUlbPk|-HVTy1gE2y(
z7T+N({=6rC{w{vLFXc=BB|nj`;B_hGr&_PzXE(y|vzJh{-@?zdf0Vxzu3sOBKg-3>
z<KpKEDaYb@4#nwzjVJPz|H;o);t!G$<qyv5Y9GRWsQMTEJcay3`&SbM-X-);qUdMJ
z18Ds(OBDUA)=|hcB#eATt)IwOx)X*Tb?!qP(|OAzDn}fj0j2m&0i}FpI#J{+v!op6
zoYW`c?>c<n8`=L;#vkg(MUL_ms;}oMh5hoG)ZZxi3H(=jKbQOj{ww^2$l;l)S_cuA
z0x&3#Q~NXSXFNfe{03EigDSrTgE*<LL=T?Ts(lmrR0H@|RC^2k+$QzDB`wgiqi8?I
zf=~L!gHrv8pyUU(q|A6kr>XV+drJ@cS+(cuf7qTqqGuo8*CM-!zv^e$r+y>*s^4JW
z=(qh+?*J;{N*yfPkAKu2+$2%$Im-DR-DheFy>y>x0#V!*n?f|pV?Qz8F!fZNFw~Ww
z7($9-C}iUFi|G9gg}72!#FU-mq!a&KkIPR;`Ct6JG@R|J?*R@35CmK)CyVQ4XYqW>
z@ziq`nh%Y^4+lNIUzY1RT?xZ~bv_7r>ieq0d7gtMMEOg37R5E~H=vWkXDyUpp)B?N
z=HZB^#%aJ4`+36m|88H!3HDWf3H#lkkL(X63j1oD!oJGy(64E`>3BiRNkv6}B1=6l
z4*OR7lfpms@Am(d_7@lZr%U@|R{PHo{#k#w|F5(kNv?{28L^)b`}ho&icf*?&&lHZ
zkV(&J00#AcH=>AtAHgc_r+5xhaaFF?7068|jB?cv=qDPdbUzbIgE}8z3aEYy!(_M^
z^b<wDH6x1ifZDe})qPF$;}De7IHGlzC|#-Y;wKK9Nzzwb+Cj+=@y`{0mH)@vflWvC
z2i_StgW7@koktXLu1gg0Yep2~yd_br<1>jOUQ37~KFdHUE);Ltchch?&`BYAQTp*2
zLbVUzysFmC64I|YuXctU>FEYadU^^4aZ)%`sQP%up>W+So`0u%&Oj7UUa^2E>MsJN
z`iq5vIH`J4AMdC)04`kbux?KvT+-t_>`YldwsCt%AGL?{rQ2i7V=UgvuO{Lbk_m+|
zh}3#_mWSG~f0>lGkojKPn(s*FR6Tqqt`g+K|8%{}7k|r~WW7TYq4ZxV<MeE6zPA%T
zK4Wj&FKWIIAwOYX?PIXNjPQSm7mA%!2hrb2+F#CUe`n$2J8EqEjY%)YVQZrHdjC(`
z-%a%QkoK3i+TT<7z5j0iUul0I(T``aYMrQPt#|!|f6M=W>%>8dALcK%JSUv;`2HvQ
zP36B>=P(4-y4Rm5`f(5_jr;Vvhw4rWOf`;fm3CCJ);m;E{M-K@ZwDHs{JirYu6M}u
zW>NeQum6-+(0XUA3)m!-{^42b^PS=IJib4Tb%oX?itiFoitjR^AWmw8)Wf@T`M|W!
zRv?PJY%|d+$Tz5eK%XFrb#ER~=vx3v`W6X=xRV+s`tC;|;W2;L`!>pHy;tq3>N)EL
ze?|0skMEnq-e|G|dX5VUyA6oKZevig+e|2`IjON?_aU)|_^Ebay;b_52TOtzuI4!t
zh(h1XM4^w`L;BL~QTiSheUJWKpIZ0fzltmTUqgNatNkASt8*6Y-7WU=#eaMqpt48p
zAbaU{D0^^9_21*NUt!)T|Ir^R&%}M>J!I$A%<}}esGc88B8qa=FZ0pQQoffc+IJ9?
z>>UxR?4dK2y{Ax!EA@01-<P{U_D9sa9OYDx)<L3lrJj*`&u2Lefy0nj<x`}5Y8Kxg
zhW}-W5C2uZT+8Ep6?#XYob-(n3gV=uN&T5woOe%_`<YX5UI9N`TkPPS8RhrvBJ5mr
z5<4$R{ka)C^+-SLG}i6BB60|7DJr+ybMZ;+%$NEYRA*BCdgA{=DSuPq4ZT%~k2vio
z3jbZ|H^i$1(FUG+-X6Y0*3X8R*HqpJ`6toFo`aA(;U>sCi8l3|V?;0Y95vpWVIQM$
zcbVt(BHA3|pD6kbA9q&cV;RvFo`bLBaKdO8zV=A<PchKIyID>N!Enz>EfW9Vv)c8(
zlrOc)KalceR{3%%|HvvwBUJycw#q-2@=vVtwNk!L<_+daisFd(1R4^Z#p9TsvkfAQ
z@ke<CjlW?+L7Wuc<y3YzN}h-Dr^-K<@-HmAo2C3Kt9*-;Z?(#|N%?jePw=M_4CsC~
zBaHI?MByj-OMa&P1$0v1ik@A6*V9MpjUbA4k0A<u>U@HDtQJh`I_dpdD2S8VEqeD@
z>krn^f#B19AhoXH{!2cMuk?K*l-DARa<!kMd=g=lqw7^WXk3!LHA0oWAH?2%6yi$#
zn8o?|<#NtN`#YeV>U9PU9Lg%p)0O-Ised?&&k3lf%CX3)e*DFnw`hl2huWNE-u^1}
zf0y-PYZ2?vA0l_62s>Av#Lk~mKg;F$4?F*H9dcc6Pqu5WL+SQhbrL%{Qa|MKI&`(f
z37;)faf-M+U()Lk^s03T{;PEe@hU<6*g@8zYh)ej=<)NFP98tU>@4{~7v$w6-_>)1
zw4Pk+IW38H^PHYUuY<otyL-+UqCIfmhba0FUk9MZ%X*?c;V0IeFxnTA^@l#U7D%{i
zeF`L9N3Bn%xN3b06hr%nk8zSO@@hPI(#}(@_7|7(5?1-?QeM(3KU2y}S>>gryo^;|
zAmwGP@^VsM-sN*C=80Ob@SITfKb{k+bpYl6bseZ6dd_wET#E6d+FMD=&$H}Sk@EAc
z@@i6E-72pk<@ip;Qcz6uxe`(M*^uZz^|O}fx#;hDXnvEPZbZ}Vh5io+WB#l43g!QC
zy{apE@tw>CB#-f1fhhLTSwyouXS>k7LW49eq1OYYbtNtoY$t`JOwETzG9P+-{9L+^
z=QOAKsF%)z+5uC2x>Aj$-lZ<z&%6QS9OWe62bARc2?cRdNLrPh7OqnqIDDhW_dOtA
zUF2#B1#wcBTkXUARPDokgYDplK~?)e|7-hNiQTr+zMG_dH=m?^S4zFBWt~D?E+@OU
z$bAs_t@6|UUg3T^0{p`Gw3qrFrM&}A(%w#({J2tGg?1C#T_`Og#78m{0uAGSjKY1S
z{6?Yugx(@_pwK}=2MZk{6pNCfZ<v(dEp&v?dxee`N{bk-6h2#|=s2Mdi$0vgRQY%*
zpCELi&?kjHE%X_o&k3c)5m#!erEj{F&lEaK=p3Q=?hjQDNnQ|tgr5>WUbFB53%_CE
zMWW|zp^JsSCv=I>53G92EWE<PD=oZQ^sEuOR_HpR>xFK#>TMD{SK7DP!e3eVYtge!
z=ystygzgghon>c_rDv~&_gnZU(Q{DfA)!ZHURSVQ)lvPz>qGcm&v}_J?ias7bUNo}
z^gfT;hu`z~Ju=)k!L4+a*Y%V2tUpoAzag@o;Z}eXc;9nI5XEoK;z;fUes>F>dqTaF
z`bFmDAL7?>m(Od+7blVZCD@ON0v{rZ{IMzY&~qBnM;J#wm1nAR2jtdEd2y%=FZCQO
z{Z9A;tS>~7kKQQdqliMDri9WXd>XP;PD72#(FLkLLaQ+C_f(FrO;!53fl@oi5r$tA
zg}y@cL(kbHcn4AF-Afepe<2Egf>?;DUO%EZHxDAZ4C@$C$d4ro`DKFF2;M^!^_?70
zJQr_A6zgDTP+Irs_dUAd{z6Z|2%nSsQ{tTyQ0qVSmnskPZ{E}XWse87u6`uX8Q|Az
zs1RQ1IqLoi{G<Jg>=pwhyOgI<JkAuX^dotKyLf*bjV6jDO63`=WF23Pb0NyZA0rM#
z;r9fhYdpT+0R8)cN&i8iAb6f6dhwmO1;F7?JkDd*di>rv>TO3k)!PLc_>}cgT+;eb
zjQ7+<&#3{YA#ivd#w}5d|52dSo-v@^Fz)F}6&Lx_Gx8)y@+7Cm18AW<zN0pq>YWwf
z=jESC+)GJ$en5SnB*nij>B0VbGtmtaZ_LNVgrR>2(Ld#WCgx+3;t#(l-ju%#B8qm?
zJf!}m`A6+n^N-pAO!ILZQOw8j!iQQXh40E$e&RcJ%aR@FQ~j{fWBb5AQ91IXdZ<Uw
z4+awjo<MY0#KDnV)mtIuKN0<0?w_USBjh^Jd;%Us6nbfEBRvlj1)sJcDyJ=l%4rEE
zJy>cL#!{gu-4`JF!9?ND-9jf3-Q+ooK&e0Qu?!_gAD<(+^+cinE27Z9U&>n}0CcYG
zK=cdG=|&WCeTYKt4Z-gT{+cN4A0di)cn-}&jIY*2(GN5)DgGUZZp+M174LEq?@HGE
zL;tIJfc{tW?@O6~@JG$RuVntguYWZEDvKR__p`E#&!{z~e%vDG+^=QcZIyfqem+h7
zZJwGZ)Q<GLJA!g*4_zsIS1y|Eq-x6i`$p#9c2B+E5XO9)3O>bS8&T-l1xoezfCj#0
z{S=q9eiS<?d?r%q#b;|90@HjPMRa-*^Xnp!ugA3TJ<1(2&+r*j(pOl%Q_34!<-4T3
ziB-N^%9{n8O612C(qFjW+L-Vu9)C_`n%v*PJRVBrI0tMe`aPZ}(mViP?O$jI&A;#-
zJbxpa=M{c_WEWw~XLa8cG)m(faVrK&aVr5DXcchIB#gM`OF7IqsTS;as<re7o-<M&
zPxWbCq52I#sXqB#*pF=je7;J*Py2)S&)%nPC-&OQx`y>vJwL_z+ZFn$|9cXJpW_8T
zA^0W1^8{}q3O~OFCBL={1;KMPv4h{PP;tfQaVDZXyjPwB?vwd|@;($lP+HgMzI}DX
zhvb?Pg`Cod-;AK~km?q2@<D0cJ%=dzYYI{H7oE?jzwk<c8h2`4MSs!yN&Thtqkpy&
zrg05Qe(xcQ_U;!9bx!I!v4`(ssY?1We(Dg#_)+INjGvB#VQ&~w_%o6y)`1;Ff0Fwh
z;5Q?C7(XiiIUx5t%E&l^Khuf7E#lx7v!e5e!k^7V!QUn{Nb!K*9w_-82c>b59%nG?
zr0`uhDo%Z*e=)yR|6+ct{>A)N{R?~lv46o={R{qo?cW>3PQL&@FT(rFD*rnu&sl$#
z{zZ9r@*n+soG6~7oI~w^oXYbcr~JN2^bL@CfOu8_gW~xNQN%M$^$}0XS16up+#sIA
z2qT^<zKGXY!qh&Ycx0jCxrr!^S5P%xg(~|4#r|!w-ePl7aU3G}4xx8S`CWpsc^T)V
z5mGMSnUxwP{Pa0vwD89;E&QC{gRJ*&pYwZ2<c>?6#)}*<l@xv+aDt`p@gnp+X~{iZ
zgxoWh-19}qy<o{rFG6l6)<5dUT%Y?j<nuhr^PO%~9`<>^i1@sZc|MOr-{(9g>hp8^
zn9q4)+~?01CVaksk@PvAI>qPtR?O%7jHmj1pRu^l_m@xe9Xz7JcMwA#(bJ)i=o!#Q
zv?TP=_&gK(h@Ry;)rgjYUZSOarz_EXpYxzHKA%SleCH)9KihY3RCdB;eLjzr^PLrh
z&+(nLM9cdQ9TmeBd<UtV6Rzm1`;>u{?|2Ah;BLG}N^}n9HPLf@zE4>R{t$i{>mSj%
z$oGg=Mm&k0=Q~JAoIn-dp_Cy|)px2BJ>Pd~5v}Gsb%|c!I}M29u+x}mb+n7<s{!Y7
zqBVR6Tago}={wjeoWO;?gQeUF)bbrH!A_ty`ip2C-|0#8BHzJM;{@gfoPI>>`c8kM
z7b8AI>-i2%p+J4#8Ah~$@6Z$pT!Q{4+R%4sDg+w&>O2-`jCc}m;$u``J)6bjDK$U9
zpZ{p;JNYONUn>09gufub@3A!V)%$tj%Y?sB_-_W(d<i%A)q6vwTCkqL<s!F8<nY~N
zG_U?9cZJ9;7CC&z_dm*|KexI><UTAyF8z6tWg>^~eE5(0T8iD3BKL6-a;-#ejmUjk
zgj{QpTPJcGijZp~avMeNiz4LOiri+A+fszwl_K}G$bD0U+zXPYZWp<oMaZQ;SF=mx
zzAr+qo!H$Ya{G#qyGrEti`;=C<gOOEgCcjh2)XtmcSPiVEkZ7x*B%qOKZ=k`=f%fG
z?yn-`(s?g-FSUOKvj6kAO6SelB9~i)TnA}KNaP|#$Xz3Hp2)?Dkn1RNagjTv2)Rxo
zS4`wiD?+Zb$dwSel10dM5xFx(u5=M{T}3Wm<jyWa?pl#6D{|$Fkn1LL6-4gbBIK?U
zxk@5eC7ahd?3a~jJ;Hrhm527gI!?H!&*#kReg2$#FRY(b-rMIqyN}Q3xEru9QTdI&
zdfzbI*LRi>?kD@`O+MeRxmotpTVy}&FZ<~L?0>W`4wQZMR-ZqAItcq9mER`&>|m_-
zgm0Jqc8Je;*d4O(4)yuI-<`7m4)dKiNd7L_hwt{)bKdZ9U*%`v5!fe*e~+);KM9ZY
zIe)y@$Gh1mALZk_5<u_6I!<&n_Ccce`%XQgW3Yb_eE|CvDDAI3iH^m7Mf5@VO>`Xg
zE20naeja!j`xW6wuwM}!kNt}1qtZWBrGGBS=6nX9M=VS6oPd3o=$HJyD19E0u2glA
zzc5>U{wn;K=&2>;b&41d>3!)Uk*imPTzX%sFLDiwkW24NjYO_#5pwB$=~9tvUW8nF
zUuq$8EsKy#?@O&juC2sjqU^tqOFXU={?$e3N$*?jMXqBJa_N1mlgM=~LN2{;T`O|k
zi;zq2TRlXsR}pgQeXF;~-B^TNdf)0RayJ(tm);j{5xIfceE<Imp8tU-C2qG0e{d0c
z()-5kA~#g@OcFg$iJm)!e|Hgj()-GAksB#`o)$fmMbEv$A6<l=^uBYy$l+!=J--Y;
zBYK_{Jr4^1;Ue^;*ZoICZbCM{5B?m_L&_^jZ{T^+_n62%QG~wq{_v#8JuUjCh(6?}
zO5Y2jZ?eceSA@RwKJvWCO=TLM%K2$vn&_EUME&&sGE?f$mip7B{tT)AQW5pj`_5dc
zKd%V6^u9A+<Q8P}eI)EV^{8L4?=&Tf{f6#y&^k(2YN5z4%I5npkgtaFaESYn<ogrG
zdaLgLV4oUE82c36Z>Mr~pBnqs(}b~Ksr#hZuihqnqtBm*z<#xkF!n3;yc+w}F~Zod
z9NHhSUlk{c{i+gC>{ktmV!!G@6#G>_qS%kr{)GK#Bw_4F>OKMXqe+CZA59^O{Yae;
zu^*}Z3H#9pR1SaF5XHW?ktp^(b#6qt+NZGp(fuRZ|6J@Bw12663j5a?gt31W5XJsg
zl_>Tvb^inVS5v~+zgiN-{?(Bv^wPdW``BQ?V~Aoun+Qt%Fp22mY<1tA_O&U5v9C=h
zihXSsQS56k6UDwZk0|!F1w^s0Eh3uU*WQx;e7ETS97u7WE&chD^y3_y*Qoqu_(OCq
z{2=-Y>=S)e&hhgk|ClfN$7?tb6aRIe?=vm%`F`_4pT8&J4WFM|yy-i?klZ4l-y?fV
z@{_kQ4=CR6NS?CT=g%d+E92lj%va*SkMT%!3GO!#UF!4q>3o1V6aLWW`%}vhZ^Fy5
z{}Ww-^C>9BneHD_oasuvCvjRT`&e^6Pli9@JdMtklm`@^D?bqV<tLF(@8c^(e$`3j
z)BE{qk^kf*^67njt;m0N68ZH0zFy=%KZ$&Lf8HeWU!Fuhy-$B7@>@?LpWd&xiTt-G
zkx%d2J4Al>N#xUc%6B6F!%5`R`}1Cr|M4X9>3#Sok^lK5^6CBdkjNiBiF|rr{YB(|
zJBfS;S;v1D`4cCRzeeQ$6#1+i&S#4n{~bl%&Ea!s&Pn7uiF{Dx^G+h4&bPuM@1I0I
zop(h=K5-KHcH&P`<WD_`{8b`fT;xwbiTu?fe}>4PbrSjZB40}6%bY|$ogWp5e7Tdz
zr}G~?3|03HDxO3>o!_KHzVb=r)A`JKB7go#<kR^}HIc7z68Ur<Q&Z$?=QxeA4%7YS
z)<lt)+)NaC$yB0Pr`7&cH^=#aFrEvn1f}N!Yd~q;r@VvK{f$x%;-u<`{(3ol4qqkb
zaOhF{AoNTWdD;(2A6=>XQm-K%DidxbxJeGbhl%Gs9Z(+r*jMjW&~t%)z=io%Q<1+c
zhwpE$@%g<8*rWZ1>`;DMXs@}*U%@oI8uypMFMM9mGDqD{Ewxt06&`-8es9a=;ZLRf
zN~w?c66i`@mBaU0gV=Y0108dme4^>|ZhMjMf&Ex7@04Snm)G$=`M2|OSMlSz9Dc6y
znfTFN%IW18T&e4Y_LlM+1m7sQpV%9ldETJ%)9%Q-P@kT!^&yJ*QJm?$i~gV#zd=Gl
z@I6POufMb#`jRLQLyzJQ5dN(>{5%%?O2o%_Q+8gIJR0`Y_=7!_N5S3@$dNtDs|)*W
zkm$QThwVTg#W@T;bfty}f2hTuCHy;ue^(B_mzaKk?`|14&{vA|trYnYB0p049r3P7
z{Lk^6fan%^PO}Yp6JfNYvy`j$e1p7N${!|bjenJ&qP(zu_lmvI;?H);pPKo6j`&v2
z575&<>d`zdtbf1MA1m!^F70?w${)(%xbGByp@-%b)hE9LyZCui;L#kXr>^&5sXrm3
zw;1@Pkk`?bdQA9_=kWWthzHHPQs2qBFr6PhA#zXU@cRYdOZ}&%{28Wyd(QW)jNj*F
zKJAryFXZs^vd!||0@~9Oc4>U6=g<3bAC54_Q@TAgt^+^f+yhGOrg0s3QS?t2KW52#
z`jgn1E#-4^_<1qxsps6VcQxrhAogIVo9HEbWQXjL9kN$w=Vj6Ns@VBip1WXO%a?i}
zPHLXWz0Ndz&|0S!$h>+)-ggI8ejUk-N9tc1m!pWn-!Y)%&p4qVPU;P@^HxS*9h8TE
z@p+#(-Q)QQoF30qpY)9fC4Ccxf;g$SMc=#sm;H0h>Yt_3Kktd&5B?AP0s4%7NbCDh
z^sOkOA5c%V=Od9@%{2U*)ej#_-0*#{DO3o9s(v^w{jg2;FVO$m51)vgbv({VkLrg%
zr611YbvO(>nCw6w#ou06s6XgReJ1)gir*Mt9?A>%xzBlBqvxec{tKSph4`x+-lx+1
zt)g$cRsOA%@3P8wOZgtzAMk#N+8=^Zw)cbZ_sO~ezFL1n!rw3apRD>};U5tG&sP03
z|B&#H$oM%b^jD$33H?LlPVl}+&yDlpVPPEp6#dDlDyRITEb$>nS1K#W`9U_*a3X5P
zIVY$vy&psCW;orxT&b5A<mb2G=j;5i@I9-3x_!RzV^;k%KQ8<vy@dfkPZ4^m(9?vT
zE^;M<e4h&In_5RPzt#GI^_14LFxFF=N3@>OdPd_+t)Cblv@QhBiW>WNptR^eQ}pKt
zdH;d_cBBXTyAj3usq{myF;Aga>4#p@PxdG;DAZd<^p<5BE^WoVT#)mzGBRGu2YG)=
z<BC%MT#+j)a+O3bjn5Ogs=@!e{ib}>j8}Du%lV?WM)3b^Ux7X&PHBBLMPF^E;fhu~
z>IC^d@VQa8S1HQxBUX;`K6YNzxsmz<^Yd<^Rib<!vTBsSC*=Gn-+!zY<@-|?NWAKb
z-Fngv=x;#vp<m@i(69Oz`qjDx{bNM`(?p^FWunmk9#QCDM-=*xffmlg`eLVHkmm{P
zR3$mssYeucE++~*YX65FHD1vUWfyiv5g&FY5QUv7MAPkPB>J0V^j9N3^fx97{c7Ao
zziJQk)3~HKDZS7?kuda6Ckp)wh^F;775&X*yw#HUT_)o#ja!J^6(V<$$h8!?G;S?&
zZAGr0$Xyxabr$bGo<a8ONBMnnd_PMq!kBk;L1{iU5DJ3xi|FeR<h(kq?;0uZB<oN^
zvC~<~yIS@d{X=`#O8xF)FRizSlwZ&EZ~0&^nLmAm-YB%6(3^$!7dlYrAn_CHES(zy
zS4cYsi@iJkFXuP(80+C(VsEJEy<6I0zn3;V$m?HgnGbEE{JkFNpHvq53Ai07^%LE%
zC#w4C9??50$onPwS<QpCQSM*#vl^$eep5Zl?+feSC-uij+)=**_~9#MKB2yvN2uRg
z>XE*}`VUC`apM0~QT{yi)lugN=|Mep{~0*#cW2%Ihot^^%m4QO(EmrJ{=`iEN@TY~
zl%JQufAX9BNc&CuSfT%qOZ`bfwU1MrssBj6zsL>J<)0GyXM+4aU!9^H_s%kYo)!M{
zRy@1>!+1`S`qM-|`lA^6(>2QT5baUx5d5S0OYKO{UqB}{UFyFm<8D@v&)L_Be=iCD
zWy`<r|Ioj=Qhy%PQt5WjXZ*MM`MTJDGic-y<hL;n7mB}ciT-z_-g_shw^-^ek$N8p
z{!r+0p&teLKJ3SWR|)+@>U}DBT@meA{}0=-@gMsAh1mN_=+{EGS$=Mp@|{KawOj1{
zaFRHEFM9S#dw-OA2TxM(C#iQx>Kze$ROqile-pn?2>wIpUs5kCmxd>Prz2P8$A23q
z*||JUPu7m0$eqmZJhA5qjS9uDxW(Z|IPGUr%1_PZJP7vx>w0k-`=2^P<l)DEl`kps
zrNmBYp=E@goy+@k+MjYFUtahXgr=mtlHkgMs|c<tw3^WBLTid#Ey1<_VLLC9diDNc
zJL`*lL$T9HXcM8ATJ5|{<XZ^;a<S7o_rJ%prPOOH^{y0rmDKNWlKNMRd`GF@NpKgz
zU4?cN+FktaCAg=^_ZHko@Qs4|iXXR}#E+Y#-T<jLQ1BqBfBQ-5-zM^RNd2LLhY7w*
z=y0L;NIUKme6Prl7JR?p2Lz85I!?+T7W|0dM+Hw1I#K8oLMMsb(}E`peOAh!7d%Dq
zRKe4P&Jg;d(Agq4NAS!4aJ;-C_2&P>@$s6-FBCg(2wf!fZEHL%7Wwyt|NcMh|D{rI
z*+1;><s!dQ?5q;{vCvPf{{2+sKNJ3Xv9swU<7%VS+bs3I6ud?1Z#zl-uSI^l)c;oS
zPQkl`ekXK~_?_OD_lo>};r}Rhkw5&`b@qVNJ0$YR8~&^OVUhnu?EEV9H=%!6ew`5c
zzl4vc2ItW}a<X{3A-*4!Bl0JUUr^-pLbP2vsjyH_Xf(w8MLJ$_kxvT$6vltsUr#Nf
z{Inv<PcNdpWQfm8)#ZNISs}jvRYPz-*Grup;=C32o9RAY;eE1ny|N-#UhHhM?oU)G
zqJG*Ae#k4E;!|1bZ@227C-JB%w3^WBLTiQ`%1{cwx1pAW>xB5Z5bk%yAs47G_3BFb
z-YAzhlJW*2zQ43D%I)4S`F3ORv#F)8xzxMV($`YTTZH(WelV)?qQK9hua)R)8{+f)
zp(vkQ4zpbNNR;mrUlro_(LmKaI4bvbe#x9~)O`@NZzRP5_wz;*#eKJNpp>7Fr*`A!
z&qTqK2)7sit`t8y$hd}|bRH@6^BUoIW*WBpw@ZlcgZ_Wyy$hHmSydohR{5xIMhf4E
z{3DCVkFE5dk?&-2mzn9Dp{ARevbsSWA2C^3S>4%Fm6?;7Rn<KLf`Wnq@{%`-C<usv
zih_vBDyu9iDyuF&mi2)yy1reXfb2Q<oOnlM#JO=JvS$DOX7bd%5%;|BxzD&4=Kt{D
z8Jpklt<$*58Tb5i#&ORMmmiQnp1!h9<6xLaQ1de|Ub+HwP%a$bA;f=Y_PE?twjZp&
zsQi04|6rZQ!~aU-$+eHO9Y*~8-V{3kAGZQR<j1HT4%rS<=HqCc#=F4h<A9#a=P^IO
zkKpNWJ^5zV*W-C#B8<~_kl!SIJ(cl2o#{V=;kR-AvpD_joPPE?tyjYS?++nf*!TSr
zgpmFlg#Y$H+P4PzpMbPlABXvYwdX>4grA~$kh{TuZ@~2P*4206YtM)Hfa&jEr*j!z
z0C5S^FI-pWr>(sR<ihle!F~u|vaa?$u6+;q1*TsL`a<}!b#=bl+RN9~{<pPPtgCaQ
z*Iv1<?qyhe70dG+mgm))^1L=A&!=sWJm1gqypHAh0hZ?nS)SLkJa1rmeu(9HBg^w9
zmgmhZ&kwUaZ((_UgynfF%kwst=QS+P+dX;OpbxaqIfP&zoUcLqsP7jbe;4%y`xmYt
ze8;-lFN*fT{eWnnIp+Vwy4n}G_LJ-Cd(*XduG2Xw?^>sQf<LuR`vl*;PUkfI^t$@~
zbnQLs>K?AOpIKM?OxJ#PUEP1M_H*lMzv<e0*XbPn|Fo{o(O>)db-KUl7uMCeoNMn}
zSLcha{pWRcUh3K}uCKfY`T3=FbzbM%``6WXjBEd8U7h2&_JMV^Pj&5=*H?ZW-}@ET
z%a5{Ne$~^<W8it5Uhd|6r4P^x?w`f)5m6rql|Fuh^#OW%3g<r^;N4*VXJYz8tdIZ7
z`uI)O$8WJdew+32-&h|XW_|n)>*IG>AHT=?_<h#Le`kGsg!S=1SRa4D`uIcE#~-mi
z{+RXgQP#(wtgHRIYk#_~zOP>UpX=&-leLentM9_s{*3kYLDtuwd-_uAolbiL@SC{a
zU*URxAJ_Y*bN;gdqF-UVgL+f#&R>E2m<GM6b_c%0d^M*38sta#H%$M3G5x;{(FgrL
z3En#m(4nu^Gr+H(g8AUrs@(&>j-~$(3H1Mw>Hibc|2wAt&rlx`FW~<V2%%lQgXvsC
z2y}413+22U;oH|#yR`O+^_44-#_#H}T|#;B-<f}5yq^r=g?>jSyq|W8@O~tO_um-r
z>M1>bKa=r>`CU6j{jtvq;mykL0}}XMXS_F@T6q}g1@)`uKS94YV;b!Ec!Z!|Y+q5o
zsBirK_sIw!bc*H~f#16^4f@6Y06xcmXFi+pe~yrED6jB*K?2{O%Xq&qgg4DE9J~)n
z(DN5D-Y*H^P1Cc3_e&G_eJJC7*eU8)LcgpD`oVs{;}8Ph7Z5@}QT1b>pNM+KeiZ5%
zq4MuXoPreS_1`hRFF!^7Siq<11>jTh0oHkyAE)7YB;)ytQ!7~GPCNaxGo1fbB+uy~
zoS%cwKX+s0qX^#z=j}3l2*g>;e<Z@!@p-E7T%A_}P<`j{c^fOQ#OIJ!-y^{L>brJG
zKVp^g)%OOFzQSqz-tF|~Z_qivkpBVB|1iV9VhBf5DZDp;%OQR^GD*QlF@z&#RQepl
zZH9L<yu$F=2tj`kI+VWQQ*N&x`)JljmFo$}c^2h|b08jr5YB;6aR|<rcpb_K=Rf=`
zLcsSvfM~z>GlbXS{2RvCWP7$a-Qo0OIQ`gD)V~J(KMm=OZ=m&BIL`<BYp1`E^$uz5
zZ{fK^>U#pn-@`QUc^~ILn<2K_r@v@}z7K)-9)$XXat~&B4&j40R-VRb{GJ1!<98bf
zmHq)L{R33`2dMN9Q0X6_(mz0@e}GE=0G0j$D*Xc-q22+)Q5Oon1R?0{<p{xl-wP1+
z2cM{W_V{Yn&&{XYbve~OeDOxMb*Wpp{H>lnRe7){j<e97+X&&@kWBWxjq%;i_B+q%
zCvf@>PH&x}eI8)X9mJ3QI)so`?IxsujMMMt=fA>fRsZ1mCpi6?Xh%q6zZ}b}`UmNE
zV;c1LUVut(0M{;^qJG&EPf@?@NvEh^_O+*|A2M8_e#qx+P(S3?ZczOYY&Sp3c!2E6
znXh3vo_vbd@qq3#kst8OS0a4q2JJ6^{9ok!-{t&AAYYLG7=-Zt9SGrl)z5=`<)@JU
z0?t={3i%)A_tkez@V@%43G$V{!uwx^ehK;SLkM!eA0hb7uQ2>|hQG;B`7b>GeNO)Y
zK-AMm0ivEhh7k1h7YIR5e}fS8^uG~;p8lEPClG$Y2K>N(e+cLPqknz`&R6sM>DRHo
zzTp(bXE--Y#d$b4YY+AE|7?&Rq1;O_4d-U5_zH4-4ARKgUoZr)a^@Qu-`(7fJaB{N
zC%$xp;?cu4s9kx;2JH*~Qdk#;a;O(<KM>#D3<1FTLX2<s6wTK>l;&5~{vF7L&j+Vy
zJ;&KM`8l*N3-=$X=U2G=J<QKWh@XcG`PpZDW9A3G!~1+7<nl8~koyr#=Sx^_*pIVN
z?itfLVmgmxxxbv{J`Tz4>=%XoKuYfWxcpNS<bI@(pQkatXD~nau-pzm-^y|1S^VC2
zaQfMt{!ZpYw_ovm#`j%}@4Geo6%L*kFrF84zXJAwd@d-??O(ivpTCs(hWWKe;B%N?
zt0R2kI`umNDmy}4+r@l<&t>=qhALjd{_+oE`W2_>`%Hjp{sZFIKVm-2%RLC=2-Jgz
zAcX#wikHyeQu{w39#kM7>xY`Rc-1MIw*dH9&VL-hwO6yAUdH^thT}QRwkiI;YJ<Mx
zd-R4HPu~degHZ0qvm5GMwj2Myjg@tX8#h8f1^=D-UdHqK`>7t@!2G|-<NuMUZ?L24
z-(Fd#cn4686TyDh@Hxco=Ocu;{T@y$`$78mF%9EN)y~0t4+Q<;d#as-d}TK{$LeOx
zf6FPFKLNOlX^5j&5rVy+i4g4le1u@{S0V&^e=kC?w`$h`zJb$kX83l1=m+lrxc1gl
zG~WRb+at`!cGdNRH?#b2J4O58;Cx6G*DD*ukF}xj-w5#6q1=tt4fTEQjkOKc555ul
zJ^1g;+ZoS0|9`5-cd`6G&2bmv#Y4~!pxwc^fa@EN0_g4|dk??=a|BO^_j|pU^TYeF
ze?B4qeF=DeF(Lo`33xt`kpC+Q`5#Qk|8>p}%k`mz_kS}X|F;wJKTL59^@{(_{BFW~
zzn_r*k%as|2;u#sg!eugdhbsY-uoE0AGdF)_QU1(&*}X$f5GK8VZImSaQEB)<*5}2
zvnx0LzucbxHOKA0W%&0D|AFB@G5i;XA7}VUhM!{iX{S+LD`(aieg?zOVt9(-15VR;
z`Wr%gfA(pb$Jrow`s+h{Kj<{^{V3-9a~a>~GyFn^4`%ofh7V<UBg2O=d^p2LFnlD#
zM=?CZ@T(Y}Wxl^M#CL`Ht}@>TA--#zKMCbG65ekm(CILpf1iNwv78^S*Z(0Q|8WWV
zHz(wuJFWW7=x2`uJLCB#=K$h32>+eAmCBvj<nqTMd2bJue?_SL1ulOlm%kn=zjd0{
z)qoz(=O7<Qf9+Lp?h!y7U*Nwp+l=RljOUv}c%GDi=QSZbPi8z{&v>31!t)KBAJ+Fb
zCFI|okiV0VznhT1mymxYA^&PZ{yysgzBg3;NNDes{zmlvnF*J3^6x!O^PkV=`E4hE
z#_u1J-`)uL9t4O^e+SpoBd$N!PSZLytgk9M_i?$W@bjlK{Fc)+Z}FWxUV(nf<DdZc
zFO<IlROO$+<)3+)zIXaG9zVkSI8TW0Ut*}<e-^+0Y{vgxDfpkm??3mnYG3g_j@tnd
z_M2kyKabyk0n711PQN%o&oANUFXi`N#_3mZ`jwo1b%Nes!_U8u-+wKqUw4}H|6JD7
z4{-kLL-}vu{5PJa@yByFXuj03>znxb4>SI^aQdyM>AmOiI1cpjSl0977y?*1^R@(k
z_%Sa3{0*|(cW;ni-3sSdLb=m$-t5x>-uMFcpLa0bpJYDX$?2auP2bVHkl%YZ=fCGP
zt@}E1{LE=Jes|ly_mUoNbjtla`w#G;=80dlp}sS`@isb7=k$v=R=ySaddUWzp91o}
z8q(-ruVwgy3<0d1c^~ufOQ&hyH0V|3zn}9zaGJ(*-?OoJ9RADv{s)Qw(=Xi!%KK~l
z{5MXoJPZh&ei`!*{5kbR#YLySe2CxwE!N|2bNa*FuD+c4{2hM&d(8hUQtHWn=lB1B
z@%<6|lk;8eA9MbnFr8O2oj>JrAH$m(fPaYV4+V(p>|cfHkC0!jeg8Vm*TZx44_xOR
z@$;u(8rCtNi)ncNa!kW|-JALOyEqMC<;<TmAAd=HiD{&J2GSU>Fpcvmn0_#)ksnMy
zjMI<cH1@agedH6LtMNPZ%klZzt2U@V{%V%<pPBB*6W)6bzxN4#?^Ep8XBZFQLpo~?
zzLf`1KWPo_3xWL8;rASTpU&@n7RP~gN=Lp=JI(pw@3d}U{IBKtGw>^%e?Y%)GXwzl
zMeuh5-_LS<4%7WS{?79`od5Z7E;PJ<`gNTCLVoYT^u6JYKR|NgdE&R?d(OGyU(D})
z3ExxogBvst-J$(L7>{27?;~F?VF+O5%tN`{m$Lj1<MhK>uGgo?^=16t8<^ima`{KG
zTtCG5U%_&{k<(wv?>(C3dK1e9aZSnPoTq)3->dL<GjHa426CzSVvy^#EKeZ5SX{2o
zay2;J;&hw8U;SaG3x0|AI{g-oV}SQvjQ2eZ0l>K#jOVM9%fATTLw&!T%e|T*0Js;M
z%iqN7KS2MnkdNP+VjMdCBe3rPA(Ve3K(yCe7y?*1b2FFkCYM)n7|Oqv%LVjuE0^EY
zEPp$fe?oG3lpFbfJJWv$LjWsh?%?uYLvidh$bS~{Prr48&Xa(0PvQ5U&JY0fSGn91
zVSXIa&iA=DzK#9qN&NiDA-r$jpnY?I_qmMEsRs)0*KxUT2;u!v#`}%@+z#RWu@t;_
zbGg2U7vs>4KhAh}`S~8)!-Mj?V}th90aScl=I6r)P=D}k?6+4rf1k_!1eXJ-${q0Y
zF_-%omz!|@l)rn2c0l<Zz}umqa~{Tx4}$d+NW0^e8J9caav$Mx0984F-vIBs<sgm!
z&Kz^O`$+!P572k`tG`P9-qk;Y^TOf1RX!(S_3ylVY+qLY9?lC#_z!e$$m$Ci4}Z_U
z`mdq)KhE!elHY$RzYpsTHz1zRqy3;rSK<Hs2NM1-p#6)hUr6f`t6xO($g2;2plY91
zznJ!Iu0Djmzgqng*zbn;U|mGvy)lIMVT||TjQ7hJ@0Vx9%k9hRqe6JkFy1=jZ7|*@
z<83j&9p?8j%<p4qK7947Y5(Wy;~uE&zIqewLtH(_^6)&->K!4vcQV~eO!w=U?p;jR
zX1aGX-9F>{2<zv6gz)_l<NGM%`%}jEF~;|oT>cNZ{2zwO|1p>U6E6Qhx%{7T`M(O$
z|EExSDg94`%4em26ODscKj!(V@*5}rQ(nIE#}$@qmE~Gvxjvoc`V7|dXR)47v3(!F
z_Pv4a``K*Y2eN%PSRW4EZb+V6neJ^&_wh`3lj+{hbk8&03n6^FA$$YIx5xM{GrlW~
zZ^-zrGQN94`1V8i4jA8v@r@bZgz??W_@<0+7Q#0V;X7n}M~v^7@m*tl*BRe^jPIL6
z_?{BN_f*FBG{*NWjPL1;?-`8mTN&TCh46higfFlDekX)4ue`q-!k3r7-wWZ><<E&%
zb=ZG`@z{y$&t!W%i|z64Y>)3?dpw)%@f^0tcZTfI2;uuK#`j#t_dLe;e8%_PjPC`E
z?}Z_J%@Dp9F}@cwzLzk*?_qo|WqdDVd@pBwj=Zf9zE?25S2Dg=F}_zbzSl6m?`3@7
z7sA&L;d?FP`+mmvI>z?{jPC~--|HFQ8$$ASLim1&@x77py@~O?neqKF<9iF^`;id7
z$As{`mGQle@x7h#{V3!6F~;}fjPD&GeE&X#?<W}FPcpuDGQM{)zMo=z?`C{I9m4n6
z5We>?zMo-yKg;-jj`6*h@%<;p_w$U;vF}%h@cjbgdmrQb&y4RE8Q(84zV|b}{}STw
zKZNl82IKn><NL3S?>8CWZ!x~#W_<rGgzrCw@O^;s{W9bG6~_0gjPHYt@7EaLuQR^q
z(D-omyWsvOfBk(PjT2X&PyKDT-}gd(|3#tqU(D~ngx`1ieNKD#xDdZD<M-dp@4th_
zpR4brd5P6`(>mem&(Jt}^}RIiT>S+a*RQ^x#)+%HO#R^14{|@#p?7nL-tRKKKVf?R
zi|PF()B9_t_qR;%@0s2|Fui|adLL(cpA6BvB}DI2Om7YD!9=~DzCq2)tlj|oBr*L!
z*jI<}L9p)$;TO<-469!R_l#rOk>gwl??Yg}6h6O^@jjgKK7#Q+lJP!@@qQ)aeKh0k
za)0R75Z*fDZ7|*@<83kC$1vW<GT#44_sXq)lKVNU8*1Kr_0u=heBSEm4K<Ely<tP`
z8(96!4K)wFx(@p$kpJ75kH?4jcmnfr2lH_!^RdNzY%?F1n2)bzK2~V_zPiSId<OIJ
z0OsSfnUBw6K29+oyxzEaKE%g`4brnf9~G4A3AAr<^$wc%S-q3_+G4)GhWXlNzAkR4
zdH>Z*G{3s~#0@o$TYVCZ|5m>i_8%bLCvT{I>Z@Nz`^;AFV*bCL_4th;{=bR&7wA#(
zZ!`aQGygs2e~0<+Gyl8H|A6`5WBxBQ|5up*A@hHg`M-zx-)H_0nEz3T|2_8C2|pi)
zp6~N>r~JL4=i&0x&~vA}Q_p6h=Tr8>8T;X!{qT_e@QD5JnEmh?*R$(%pZV&2p?W+I
z;s0jF{}jgmRL1`_#{Vsh|LKhX8I1p18UMG1@E?ZoKa=r4i}8Ou<NprE|7^zp9LE2h
zjQ_hB|8qn5k3#sL$M~Pm_`jR+zku<-knz8W@xPeyzl8CB598-`*VStw{4ZtvFJt^K
zXZ){Z{I6pCuV(zOVf^3A_`i?w^SbQneIfj>W&GdI_+Q8Pe}M7-Ame{M<9`F={~^Zz
zM#lfm?4M5w;eQk3e>3C%VaER!#{X8v|2D?|cE<msjQ__N|5F+N(?a-vobkVd@&5$l
z|4GLGPR9Q(#{W}{|J{uLry0NF|KAeA{~pHwi=p?P9(wOX{N9H{?>!^*-k<V&e-V1`
zTSM>tCBOG~q4&Nm^xog|d;go||A)}~&kVi)kNo~W@%#TAdjDCW_tWryd+7Zn{QpAt
zDz5(P4Z;4^t=wO`jr(hl=l<Fz_t$Rc{@Qu&uU+8&+Q%8+Cqww|WPFzx-`6p|yBMF%
z`0i$Wea821jPFw+e7fVy6`o)Gw9veY?)Y+*@vVjM>CQ)dI^+9{5I)`cgD>UzvF{D}
z!^7Af4`+LP8QbH_*&YvOdwen5;~}AW&97j*-xtDrhVj-JZ-enR8E=d6b{Owtvd=%R
zoShE#&)&5CgtLQd!`*9V=YwnWv-VwgT%1=e`@-hUw`^_MH{HBx-*M9ux)--@x}|G%
zY<qvW)1OT2*=RByj^=yzes`;Xb<3*2lX1VdKd|Rp=lk~&YNH5=&v|dhJfC_h=*>J8
zZ1oMOAQhpW3R2O=dclRZW8$s;6Rp;yH=EhxovVZX+@1~Z8(3E(W)_r?D7@wQ+^pXl
zDUUlJRQE;8&g^lS(Mgn@8ELGl?>L`W<65J`1AB5f-#otKqHT4?v-xz;JJ>ngvxoD+
zv^O75>50|9(wo}zX>T~6Z60^=UvqbiCA$~v_BIr5563fmr#BmPkFN)7XZh5lsx6%d
z+wKi|J45?maL}KyLZV)ofvtX`Vbqg=Vfu>=)0Z2@Fm)}%80JB%id-HzRb(ivB2W^m
zNTil*U)`3OqbL@{HYth`ZNrd*#2IE$6)|d<B3RHeOc9J|8OC&@a&4)N3Q!lDqaY0s
zAO8My$*qXo66BO|or^^kG`4fm*R_OM9&Ecmzdjk*5Jc>Q9lL)xwGVo%7_os038*qF
z6~%(M(iFvrRt!UCj0aS?VTxcu%P>VSA~j4yRXiAjG+_KOoOKV5vo;J#B_;LMs#3k*
zxjyP040O0ygh67I1$Y)tu~cD<HtgHbiye+G#}Dpc#L?;P<8+G}|KV6~IGPQn^X}EF
z$14S3x9#C*2-w+_QG+CoUtz)sN3betbS)Sr&*r_$gDT*g+mq>F(hUwxw~n_%?qU{m
z)PQF3$5)n&G(cCZoxS~WZw~Wm<4N~;duO}9)!&Bk$?@^_c^qs8Jw(;{@F+9rA!^vU
zb#?n<*WSLmrKjNXnA5gVc`W8KbFdPSk%wsEDp)7CiO<=Z1}=jwZPS*)T)a_}`|fUY
z)rN-dc(^+lbzw^MV$C%`G)yKVi?kL=NS!J5oT#Ff$ca!}dsYS1Hy`hhj|bE4*74T)
zP<%?}%QZk83W<OV5lID$STc?~M5<xQI8+irGxH{K-LUo!CzHIE44{w*n97Spuq15-
zxXWkB04j-~S$Hd;BM6H?!^;@w<UPSqw?(aI1iCG-Y7y+V;4;Q7)tg&KR;vR4HqVW^
z9%ZNYB=)Tg(u*3V464$=6ZU<Is5zr46pu<T4atell8h+HzlB0&LL-R@VI@-q)>g7x
zJdcuHBvOw_(oO)OQ_<wMa?qHML!HUt><TPq_V4MYjCULEXquKy;|J8;#tbGi`+!Wo
zBO-3rG&Z<(dl%hU=1_8!n;cIBOTHoeQI{%!3hnvmk4Hx<&Wh@AcL<5QF3xedKff{^
zAA_ZKZ8c$WBv&vXfo&!G_IT7Ez?8xG+I3fpo6ue~=7*F0!RGCEs*$mM+l4!CzUhK(
z-(g#pW!rnbdj|H-aI~uyUb{zI$l2~bfgXSadnY@)T97Yf64c?w@rh;e5cQj7aUzXp
zu5FCZgKF5O5FWH_QwS&Vwn>gKRojMf-e^3(0@IpZN1r5*aIMVbR+z2x90M}eI@4>0
zioV#Yg>WIYXalAzXJd-%Y9e|ILU5BBgvMU45Bn-ET&-2Q-8Rov58S}rh0S9jy(fE)
z89G{?Ml~m{g;!4k!<V$ZJrRjhqAJ?hIDIWoGtNc4rzPv73Y$yk!vk8)#ifz)6c!O+
zai?b6*SaA`%7I3rolHDQoGt-j-;9tR8UsRl$YL#d>B^{WFWA#)HC$sl%XHXz>%?sk
zitkBx14@x-xp3NY;i-DX37-^X{BEC5_!4Q?p&viq9rTap_ThZ54Yk+89jd+k<KFcd
zbPR9|;nZb`P*`vLh!MNhG={##xHr$u&K-6Rc3_2W4tv}UG4Ej?7K#11Um)kRB9RXZ
zMBX=#+X{R6xtSqPNpN#x_@kT;3+CJuehWH?z5sxA|H6*dHN<@s`?*=M=!b=(2i-uI
z+)U_=*G-Y=K{v+Gw_#(-<Z#r7jpL*bXq<)zy?uK!hTSPTO_7JOZwRARIT()y*O^Vv
zF><qNwLHYO(+e|+-_Lm8B;pvxjpFw+?yD?CY20z={P_KhgGS6Dj@P&lf8zL_XAG*t
z-6n4{3k~SxC8OQP3^<?_foWZ*+B?%hqJl&>(-(@K)IqvY)|1DxalxSmUFykrX77!s
z2R&CB5!M)UbAxICdB{nznKpnmhGmWk29Wz%=73-TYYfZgko#HYP*4oZ=8*eY_PN_=
zaJe{N&WYU5vd`UeVvTVObIAQH``pbu%jS^#S@yY`d6vx~_p{8tT!*;4H|_Q9-Qi{U
zMAvC%3<YKr*!@hi!<j&v?9L{z`<Z5!Gl4dSX@l7POtaG!#I!l=3A5A3U09w!9t`er
zJ=*CwC3jmgp^A2;aw3eKsa`Nioxo+^oWMa;1_TZwj1^cuJ57tNakJA&Q}bbu5XCqH
zO9QF&<w}rGlczGV!1bbQ6y?%SaQ)+M+qPlWV1C6!We?yo;QTS%NgOXh=DtChL%0mc
z9KyJ?8XvG_EEghgmxr8m2Fj@O>0F4^Ag}cK7=Y65x~#Xvj&r=wciqKRukmyjcJ{;c
zjKp^>0ba51#Nmdy*Ftzsz$@js?I@X#^pP~JYOW+`3Mu($<07wa32dZy{R$*53HF`|
z<aI1Tb_w~Y7L2i>V*+EuB|1oGZ`GC_6=Kk@)1^s8BZ*Y0$fR{G0ioJHlV3;=jR7G&
zWU)fZn@@REfn6=GQY5Yvtxkq%%Y~O$DRaV?N84NO<OS6EmGR-MH`<-qGx)NfmvJPf
z^f2-QYHo~iYb3bsC_m!(IU;A@L4N$9St4_YV;JZ8J~N8(GtRSSW)R0PZWO<tah^FV
zjB%s*{fvV~99MyLz~Ov&G=TFu;hRm3>X@=gAQpdmo2`RY5<~)3-sjn|?1~V_IA9un
zJ$0mE6>%N%4rkrI5Ow(KV=R6>b);d{R)?<^#<D9y9Pb?q)vc!vqg;o)!-*ZRyw;1v
zjtuNd(B;*xFVyL>8)LIHtRk-c>hM)+U3MktM102R!2r7&SVdg>)!~Z~CbXM|PQ+)7
z9@6k<sA?KmMO^!}>kBz1w3~)b#Al2i((vnPHw~+V>x8KRwVv986Tc6f{#rV#nNSgL
z{;g?x>!|_W3<#{&ECWcj1rDMzAaD@j(&j~ADKVfRiPlZbjik~qV}2x+iGr6_a?$rk
zQtn>hh7UNDc52VAAMA|xo!Tz4ZA{=>j6J<-Ef|}b;MlJSh^E-tG=Vlo5sR_wDPl2B
zk?H)3;I2SHidc+YPZ5i8YAb@<*MbzW7`vV#7UPU6B5gN0tXmEbCYE)8$Cg~)AMf<s
z$lx%T1BIL)SYFlRB2bX%`uiSfLIjG(HoS|%efS$Zn4QMm&v5>?y+0UTo?p?4w%E(^
zeP!16J~Pda+xrSM^o^-W)S(Yd4WbTyT^f(rao^-#r>lf4=%TKi0r9!um#XoM>R}Fk
zrfLv#@Eg_qh@+o*!UwAP(I(Um{5my1@+i;n>1ckmNjw`t9{n_uyJq?Mj-qzHNG$|6
ze~wxNZth1Eff`kUQ?G^K=C4rm<M!4&p^dVjjk-J?A5QRqq|i5T$<Zwpg(RSP$YA|7
zFFy$=B>V)Ha<~G;u_eM8Gg?@HI=$gqFlNfltACup!;joJW8`0eT2KB32t~H?%g@oG
z2>BPF){}n$LT&kZuu+8k3sCFHzW|{~{+O;j%0C!ESKJpSB{&nBeGb5RFuOh2@KG^&
zS@sZzI`PI32m9P{Xw&_`<#I7HvXy@{nB2H!L@6C1x@bcqf;hP)uI1qkjt7k44UPu#
zqK)>ep}U?JX+rhFkw9M5QGTJTo)>8nzXni8JL<lEMxH<uMeK|K@@gXnGxz_^WA?R?
z=9PhcfAcJ#<DP#u%*nG{M{tWW+}s;IFcZ(ggGs>PxtegL2pyz};~CpN+8sCtYKDgi
z<xq@9@N(!%!@M_|;l_PFJsjY*U}3c-H$bT<B+Y||jE6>f_(?#a#}DYI3f-!`-u^6)
zf?{##aRlPUVoUFa1hgEBL&6cC(^8kYO<buc)x=uEmkfXoYW;n@a-(lUe`!DBx7r8<
zys#*Apsxi-^o&RLeS_)Pp23CVgI%af3y=5DeEvS1z0(&XQ+wSbr|>prTFBH_0|8`s
z0ZDVV1IL7!Vl9AeLD+HbYHxxhaH6skuq1Ya<qBU(r`{yG3|Q8ApQ!kI=vhj|N9W{{
zd{8v4cvaPk7dyKnZ932CI3yY)Y%NVL{N*GXjHepqJK0;X3+sGTXorqRc3sC&W)3t_
zsd6BTcNZ~2_1#i_Aw4t(g!GWb3Mt<%qxC(Ls}zYVnb<D`UDRaSa^bbUXG&&Z(ZX@$
z@QLzhFRH^&4hKYWEm5CUDl`V%+d~%X-U}3*Af&1<`Gxe*7!cA!7AvIOjkW5qtCS_w
z;bhu!;kD{fG6M@-EE>SHX)o&6!c5=(J{*YvN5`IPq;*^C&b|>oXEiiEtbrgn4J=0x
zn4y&y4^EqEln+dg%F73)K~synw(66u60Uqo?5SE#_X=+0I9CnFVnMNJSjt{_ku&1F
zD2>KohtlE5$7D2Yq*H_uhmMqPF&!!0!m+{jjzp#dgHr+53FQRpaxkdjiw0$1If23w
zs0#S5!aYp;!=3(QVjqr%_Z|-5mT|aVZ6FX~F$#e+ixKI$0?8p@f>r9tFHoj8)dbBz
z_Q((|Cg3+(Sg0sB9Ex}jms%8$+&eOrP8PjsHJmfp-80C2iWFGFf;Lt)$Z>d_p>JXs
zNh~d}OCk=Tc_Mdm3LGn;tVD`xe|~)eS0-M^2~X_Zpj$68AvgvcU4AqV-;d(4Ei|LT
z<}eWMDrK)^XpdA>*#ryqwp<=^36_L3ld}c|OF|{!&$VK(XXuKW%GDwS0{>ftMp}`=
z4xlSq#FL_kviVV9`?0C|;lIPi!<lNYh)|(EefDY}?900zBXGVbF9|p`q>5t7WUJr^
z!-!A`DCIIGAQC9t>qEeh$Q3S?lV~wP&5jlp)@KL}G~^cX99v4DDt9SPpr=q7fs%qH
z7kO&5=j2z5KtQZ~fu55ePpV5KmKF$|h(qWgq27;7j$psXDJzj87Q;dlR^7YFVJl<&
z#pJLbq{Ev%V7~~iM=C!QpjFdffmKbos5FQcZ!Y!RTi`o%j-uXWv>w4!C(BPpV8{H#
zgl_8{Mk${n7Ap}ZS~QLw^~eaEBRUgXsC?$g37o|oQ7xy@yCT@Lrl980EV|?-WFjL_
zrdRWHiD@YjtAu=wK&-^PWOCKKLgkBA0$p+fXE8@q=rn4weX>8C+dGGQdxN-5oZD%;
zI0epQj+{ifxS(J{#)bV9*l{%KO{e2ydp@QsfiGOOnpt`{a2Ut&aCb0*8+FD9vZ8TB
zYgKKcZc*`~Qp{Iav^!kl94Sa7CQm^nttBz&=$o*d;`x!}6wi;!fOxc>J*RknBss<N
zqcR{KebJRuJU^10;`vbt#p5NPTe8o51WE`P_m^833;j#XR?3XKyB>|JrfDxT2ef@R
z^V_sKnGts?R&VMD))Uf@x)U}T-t`um(y&ISOERF3OiW}c6PyOfP{N(^4zG2j$`qd9
zmLl*dhgJ~el!XXf%E760F<n`4muhIPTTE71-lH3wjh54um3Qd|XN<*UWyQVP4zp-!
zw17o-Qa9~gZ*ny4&1h}Uz)GaHXDJh`?O961bwE|GH&v+QUT<pAIHIcSnp!fJXr`i0
z+lM5iz2ji3RdFz+&Q~OqqZWI(d(FL3BylT%gMnH=Ipt6}0cEe=K%<eJaC|Wd-Gjkw
z*1J5I;cCBtZfr3DUHs0`{c2%8IGD)jFD@?N!wo?q@ncH~sCr$O>?)5bBcK=!iXwp*
z7Z>s2c#gBlL&(RX;u1c>3tuue7L}H85o|$ZJS3Nua1cFXLl6cc-{kux5O9H?1~?mb
z4(EH`@p=MYGT;z!<o2Gz-RkTWHXVh4AMBq5_x%J93lu0SJ1PNxp0J_8fR4VBPzd;m
z3Ymm7wOf%Lm4H82U%^3)hPDzA2zZGIn1E8QsRTp<-dsI}MqL_;O2Q!ECZee%oN`qq
zVG?lX=_)u<)X`M}1_3uwT_xbu&{YB^0e7yhg2P)4RV5%0@DkBf0!q1}5)g@a3%1O#
z(N{7~h;$GF#RYsMwC(|Psrt!+M8H#2xM4os_=^kpND|ABPFpvABm$nifhkOjWUp26
z#Uyl{@xi8yZfr3D-ROW+M1OH{0Ur?8+$pu}YL6`?pz2M|Wv3ZaMnEw-AQkF6{OO6m
zxQGwObDZ(4A5m(pvl@$vOZW(nNM&p+DlOq6I3|_xkX%;4LFZsR8eF$EcO_=`UPE*Q
zlC{8Ni<ip?6@gUVwlCTr7`MkvJqc`L#jUWgYa_e4%#abt#XFS151qJBsC;J03FPE@
zpt-X&y8#W+5lE(LLg8{5p(2nf*M8&d<}yP@AXjuppvHdV?DCl<Cy>+E?r7|j%`TuJ
zIs(bumZwm;j8G9s<uyEoie-k3K(1(mQ>c7q$qD52wL2u>a5kR~dIzxm*B;IX(;lAW
zs-6ToDELv0sDomNjzBWE<tbDyBUA)Zc@0mYVwoW$kSp5Y6e^!tauPY?Hmj%|GTGZM
zJf}2%Z@G&@!cpud7%58`kVtrnlThu;aV1QjdPv71;V4!>DN7lUNO%g}9|9Ln3Wkg^
zx6gQ`C0xX8hUdNh0%K)BBH;;k-#F{Zu-<MpH{~3qqR7P$A8GGtJl&ro3`KC{<A{#J
z&&N?1hlC@)H}lsE0tZ@DTEaz)Bg&b{fJDNRUpD^mK~po~(h@FWgbJfecj634Bs@jx
zgq)*P6uJ1}o7(c#D!T2>!;z08y5+&cmTt6&iuk4o4~K*!zc=%DE}GsPE-m3A#u3Bl
z(iM{dNtCDL^KC7yGZPxHyL5j2=GKwbs=z;IJ8=%evE#kysS241C+<hap6vVzek8fm
z+qL_>**qdfx)IWGL{*W@k)8?q`-9#z!n;1*tQN>m*TBcHjd(87Ems_EiRL?TQy%ea
zGLuQf#_3Y(<0mOHT~%P|QxSe&7*8qIVY}w^l?i`tePyB|)K^pgIwXi}y91by8(+5x
zNq=ANe+AQ*)HJQw+MbLj&^+|-k&CX^o+cC2mo?V0qAhAN>GUuYRBmp9`m)A`&Y-Ng
zzFm*lR8oC|(rS|w*5!~xWmK|BNwrDFOS+&hDrit}qu?9@mAyBf+Jo_4Vofc9T-1q5
zAZkXrv9|3Nrd$nj`IW0d)QoatLqvCXP_VDY5Qs)rsfWfZF@}`WY7|BwDvRNfRc$cZ
z4VWnEf<;pl`=3_ZltIu1Ry0F0Uec`kjrGc4yN}Dp83ZkwV!WK0)oV`B!bz4RY5xe!
zY_<Fce%eRF!SQDQV%6?;Q|hm2B}ll5*H5DVRW0{^3A$LqzI@o5?w+d#L`0-c<jsjn
z5bd(_CJEYY-)HPI*b4%m(yMdx<pNuoPzeOihEQnXSfsGeTf@THP~{akmN$uoD|}PR
zWIo-5YU~^lvDfPl=6IB@Rkd%saOcf8U9jytppt_=2ff(<&y)-JfJ6>MB!#Bcp9l$w
znyG#pqb5+SF`BWOg;0i7*qyG2(+zvq?a|=a-XDxE&#$=dz$c<`2$U4VA}hU}@pQg&
zwm&{N7>wpCu#$hRXTxn|*M^WA%USXjN>~T^LZIXRbUr@Vv3*l$Tm9p$&cV)X4%qGa
z79KsuVVx<ZM)4f@1$NCrMW`=dBXZoIjg-b_L6vQ7oj<;MHK*PT&=Kg*05yF*f`6eN
zL7f3T9)lkHCiSRGM^BHs)P#EUdH%tU(qc%7pu?Q5n2&@&d-(_n6^Gx<a^M3~CHh}Z
z-Q}htP+x9ZLJeB5S<ltr6q>kz=Na%jef$Eg<&=UbWjb3dKnderKwrlg?X+50znU_k
z)zwZW<WeVsB|NwPF&_tdAA0H#Ae1OVfL31xJ7E<MwLHS(H5H+r3R2MuRdAsOA5RSW
z_Y8JzSj~m&Q1DFf<NlT26n3eOjt0|tcN;5+jy5!L3lyVCL9C-nR7XJ-^|e)`gIc5^
z9RflH`8u&Mis>It?StO6K#bKGzete^lp;l~uMQfsVNEiqj!a1P)R75wygHKSO5G2U
z)IyhF@wVG-?v8Ev5V(7>Zo_|gze9UCp240AnC98Ox*Zw|FNuYys+Yuwwqew=L9Ah7
z7ZhNr#JFLKU_r|;MKH2I9NjaRK6*Tv567d~%GsUS?CjYK_7euv%Y)t9_QyNDea^M-
zx+{6g=z?VpM{ohk@$q1A&#ZgYZKyv8UrNaem6R8(Qb9P}V}1o`HtDZSM2X#KQ8Y|%
z4*iXtL)e_L;tm7xFP@QD@g{jz&R#eRof9?PcFn%5)Me8Y-!9Di$IiUL#MyLyIH6~1
zuFTB|d4-#Qc{+vyK&XE(SveRSAh7MhbUGR%Gce4;hX`Q2k04>jFQxM9osWX`4N77l
z3`W7@1D}j=)j|2xL;73_57NlzeMBm6ldL*5N;X!$-QM+t#%ZfM&up5~*pb+(G^X^8
zCy&*I8n0k>^o&<9Q~Ji!sCgFGyzB5u!?LSgW?uBnR<w4AEC2Laa?9aG0u5)%tS9s&
zXH{$2yy)4iXzl3PEQcrU!s_Emsb{IY=-I4j?daJohbN`#sl<Ag%8Q=Oiq?*v&2o4W
zUdM4#>RBo;dNwOsJ9;+D;Yq1_DzToW@}g(6qP3%EGYwDT*(zJjM2vdNuWT}g^sHBk
zp7czp;aD<_l~DI&4C$G$a6Q4!Nm!hi&Cf2JwekA@a-U)~Eoj~P{j;{c$8#kTf68&7
zAaWHuoz~AhXHyh)iKi6B16CigCG-w#UF;v*GIJEgg4iZSF`{i4c_cAzm?BuvGE5PS
zNDbp&Dc68VG@Nx|=jz3py_MPBlgmp~l8i+vj}<&Z{<y0tS2`YveCgPva=H<hT0+U0
z>4|O5@%~bmaDci*rv+)ihW$ryl7ij8a*w^&8?s7>v23%HE@M=`<4mKT#GDqJXqvv<
zG=`~bnZ_&+!`bl!wua5^{T2B0+V1c&tU=@7zCVw>T<@>r$>FHa#rDU?gDI4PeRj^D
z!<qBfeC+%M1P&(?=S}C&;mrAK4r{dZ7?xzO?M)8=C9KNwUr@R~f;C#ogm?GdKh<AQ
z1}|x$$NU$R+1c-n?xD;*97@BVkUN{ecSa7T{awoJ?N6@s;7`4^-$J?tG8Zk11+kwN
z#fVl!M`ozf#GSabC~QE<gt5)G+%QG3pk<gM7?B#r`P@(4?A$q=4WM1X5C1Z&H3dPm
zZAtthHh}4tYIpnmMa$m0<6^~b#PXC2QPg00(80hyV{t1{EV-ueWRM}uEA$}P_F<0>
zqORo8SSEyW&1FIx@3`5t+F~tqb9+k?Cb`gXX6Eo<l7P>)k7gs)-0xvuY~}1|JRh9B
z?T#ltTJ_IX?7K$CSK&9=t3oFcsg81>&jm*;!A8yw_{O-e4)Mn`mtf~SZZyMzP$B4h
zv)S<Ss5tb{D;ez;g}!6kusaQoqP*U{s{Tm~5ZihM4S<JV<f4($$PKu)0e0?Q6<IhV
z{~qpyzFA_0#UQ{pe5swqn1<t`4tj8E)c&{!K8f4=uf`3Na^n<Kq>Os-DiW|<0Q#Qe
z>8KH5XpCMRc-)2Nl(dVuoc$lkdToSn5A<OWgu+x#1Z^H(BCBqGbnhFJ3bg=%M5YC3
zq=pJl=LoHoSX?4bA`+o6?uEmFJF#UFrQi^Vm4ZnqThx#HQs;}*C?5uaT&bK8F8^Fk
zaxD*gvX7-~VPXLSiA)R7NDUSAX0bqt#U<h-Az9c=MEnCHu0=6>VY#sGG8PN+n5|Gk
zoyx*xL^`lcmU3a~G8PL;=M|E+r0x~IDvTZMa9f<(en!hJvZ41js>G!ts>z|gRn_fV
z!HgpHtdMz$7l*rR2`GgXRR4q;JUv0JqE8QDwi9}dFcR3@g5{hG!wPh)k1p94JGM;5
z;+cupPV&B6w~C#cojdeSrs;NI{R%#YfkSq>+c+t5{@mfk21@IX(}vMT{VxlFVKICQ
z&`S8mL5T03pf((B=2x|60q8tS6fVabt(wW&mSdOtA)dA2*Ne@UD4EfYE_R8IbZJO6
z6|u#+S(=h0VrZb3N|2zbbUCuc9&PjzHE9!(Dl2M_VVb$KsYwH|L_r$prK(A?fguHH
zqnD^jn}}3dR^&=0xVQ@L?=#c-=pmOVDhK~W#y>(`(9%UD;XChA^psDOY&7zl9B<Jo
z&gR*$=hReY3G!K;ZgopBdd5H-aj8tm^XVxQ2?GvA7saLMDW52Op<N0M1G3OHbs6Y5
z!*Nj<$%H+prZUlxYRVlV2Ig7)YElD4(QrkEQ=%0aW^G-ZoAtf1TA&flp^WTENh8^s
zG*=_%hDGq48L1Y}{j4lUu_sSM2bQh-T~N@$q&FSl<R?t;geEz1qLJ_g4aICWw!IZ}
z*j*4h9{a-88caS}mE8fq<-1M<=cY0<Z;qBkLRiIAXRhJ8_u&N2rGp(LAY*86LB=J~
z?$*_dZF@Vj$ORE6`Lo@bR}c&FVJz8m!T7i`4x8L)Dcn6sdvmYby#%v;SP!x*HZwYj
zsxl)rC;Y&y@F8?&gbyJ#C;YBi;X~-m2p>W!6kdP!y*VAshWEh^m*D(&Vg)loNuV+#
z^h(nvtgG;Dlj8LmpjC=S0~AZsY20EJx@##SClMD)Pv4{BL29Z4(2;!Vaf|P6kk~E-
zG-%PyahWUha##}>Z#fJK4Qw^kXBc2%XG_(IGxYLVB%}L>c8SdlGmG80o$Gl10aqN!
z#|{NooaM48s6fkQR9KOsA1>$*qB6I^bcir?%VC!}Y)^@evdBhgbRF6hj(d`&4U<{Q
zLS08Uz^SdNImJgNoN2@b^*eS~Y);amN>Ky@QUiqdWR<7?A}CALUj%)r_Jdp7%G14h
zx)RNsr!Lid+z!UvQCBnUsBNvw3_B(mkQyLd`AqSU9`=i%EOGuK=u5R9tbpa|-aK82
z=8aQdv<*1ei^T6l^YkJYQHt$D6-qGd!fL~LfdU2%S2VS_wxLvYLVYZhUQnF|s7W{C
z<HujSgZ_~_vJNbMrw*F4kAt$c$YpUOiB)CsByBlba2({|I-OC%(;~Fht#qrE!HL9T
zW$<IbT79)i?Ic*sI43!+Wt<-a)}ozeC&60AImu})<NO$~7I+ZsA2|uuGR{d(YZ>Q9
zXf1CAM}7uf276ZRO_+Lxeu?jZ4reYFIZYjvE|EWhWtYgM(B9FNrju#+6T&C?fabCo
zX*O<IEcS#GSfMDRMn#vLO6OBhvrYiF!WtHw->7C@?2joY&{IrlA>VCh(FHyZg@v}P
z3v|(90<NQlg-pA<j6(zE%<L~hAP{5`8lgy@PSo_H+z$R?BtoY6rN5g?;4OKH2uzZb
z)S`*SU}dww*%rO+8B|TsEq*z{k+RcJvsUah0_*GTh2|ZK?nd6s)y^zAft>nYVOemR
zU3B|<*7{il;ZkbDVz~vX_YDD#yKQ|<X2he%S@hcnL#&DrM|n^F=qsONO$YE9$^o1)
zl30h!ryP|&d9O+pZtouU;ka)&Q~L5|Y`;1<`o!ZQ@hfq4c%VHW<M}EP+4VWd_z{Uo
z4onR`vqmz5^hnQ{K4LLQRoWqQwvTS++czrLZ*F>8`pr#MsNZVK`!48kga@k*cH#Ke
z`QY-jx9?WX&FlUzMTQwaiO|F?(3>U&sg8W#B_(R;nwExiFiZ5KgI}thY#ub%(vKc)
ziH7tj6r-bq0(BI|ZC*!V3Q`?q@zs4T4e4N(=tl>?R6E)H^s1JA^l(cwq(?!hBc2&h
z8`bfQ`t$v)EmdqufqZf07tKmI@8gD=0H;JV)07bo4b`>>y#5ZR4dEj+I_kQ+b-aDC
zYU7vTco$W}R(qiM07&S8@6ev83KfPf{Gc`I&F6#ZsC#^zXTKDd?b<jFxD|eJ<>~PX
zcDon9#?ESr`=3|>Ke_)2C#-@&0sDTZ?0Zg$=Z5&55*8&FIAy<|$0;vfu;D*F?>kZa
zYrENrl0xWD94MiIb-qA?vsNIoWwqym@&bJ(W62QYnRgZH{k#i8z0+K%>uM@C1b3nQ
zPLoI_<&p==XOLO#6orP(<5VE67enwar{k_wgF7>N^DA(b*l@Hr=1{>p>2Bk`%eb~|
z`xs9O!KcA#s*ICFh`6H~vzxdvyTxhDZnrPqZf|Eb!Tm=ZfnVHzgc1fEPcZ6LMVyZs
zs-=3LhU=YdVYD3YWQ(Njb{O;e+A*)6FXlnVo&M8sv6I8NmOGss_O)FHYebCeWQ|xx
zd`H7^P72#vZgWzYk9V5n<-_*DU^eSr9?Wp&01p1|?~ma+FYeQjCj7GySrEZEBOOuV
zVj`Z340X^xoZ!0P$X0jH&b$=}`98VsaQhN;L1CzQ)j!z0WOp4oQ#Zht&6L0e%VsU!
z!L-du>s)c$Gh_Sbc!EUn<}}TeL35gB&9FI-w_v`H3{;J;Zw7UdPRy`${VkZGDoeU_
zVnXR+XD{+hsbwAc7C~6xMg@@1F!d3f?lGWdlGxuECk9=X*qN;{Ks>dDG)q!$T{E&~
zu&Xnrl~buZv)Nhuu7!8*+P7V}^X8i_*!CT^RX^z6GuVVltbj9jZ-;fh?)D}7+yr_!
z-P+FK-pW~B%>Es+afpw4GrB~01@?K($9pSBvsu440*di*D7mZH;sa=Dr&uSh@sHg@
z2C_DxX9>N-r2E;K8OK|f#6r}2m&Ay+VdT9G<Ay1M1uerA!HCo_9p3^k&Sb})kGZJM
z!0;67%nr_jw}<1Ix)r&5JP7XKN_Nu%8ITyIKsKZ%Q9%qx{WKtrJFql^L3Hg=6m^L)
z3gQ7y2p;ryhW5eW;9z_-Sb<~Xul4N9hrQ{p4MrODX2HB(|K7vl6!UiB0R1by(e6IF
z^?0{8?=5a(-McWYT7MsJlkeNG3wD3dJ%V}Hox|b&d^n<<mC@jsP9j{H4d(pU;cUQv
z?M(;%Kjkf=&#x)m#JQ7t5<X#(+r;?#-Pft#rWug9RKa>6R{UM)<cQ~bcP@Pd>vwj0
z6h&QPjG}muMp||XoS3IrtKVS^wSO=nD6JudaUrox85)t)6(2uTTjDIVD13QcdNUR(
zgbPgz6~c?O4yn3q!gqrKO;UjhWkF(_LK)FEOkOuJV3;CU&@xOBjA$9gbpL)g>v+p;
zdrgimfV$Wm<~0BpUCn#_d*Cvtd#G1W^GUnVfv1lDaCdlgFlJQ|!%OV4$xTMytJ#AO
zR^z^|$qe(LRe1_&Ze->tiUn~sDvA+p!x#^-a>EqCf|g+lVB}y2rpS-`D+fCYh^NTi
zuQc$k%~5YU9UpfAofwZ5JWcgjT~`^xmp)sbhDD<FG+eOW(I1aybC|lhBYAZ08*vmc
zCOivm)D(=Tjz?IT(tV2yj~CI~TihIuW`pUxd-ZC+2<)&~el!H^g&=pXMbmIf`ii`W
zkhoQyAM}}{bhj>^4@t!+o*QXn;c;X-Lh9P7C_eP;R1`OQb~4>l-#V{RnF?b<ZlS_h
z(Kin{jG2*vws{I+LeD&fup%{&1shJC!$siRS?F(p=csRIE%<a;R0lGllBg;ZLPG+>
zcbTRH4x%z3a1fzXV0WF**O_*D3B;U#ej#yJRmVLc1$WoOm+UZ)ad`mW;Em??WIC9r
zPtd%@^{xJPs3&3;b5yNn@oQ>1FvP&`&TBU8WR%T3#f^S^sHB`N8ghitrgs`MB8yrl
zc`%a^rBv)Vx2Nm9bq&(@4<CJ~v^m2M1&)WigHe~Tp`*kjOZ090P!F)EJ!#$<V(w+;
zTMkOcvbhjNt(ps+8Bqs()<<qp1BmjA8bD`8ROb@#+@b~$<rmeDZqXjnoYMqQNs{VE
za&&RSfK`EdG9T}cj|bE4R^LVD)C^4&QSE6Wig%G@WTCJLZL+q2nNUdt&4f@YaM+TE
zlSy7n22e-@Oyz};`8!r}O9r?@ZKb<vlHvoXB!Xr_D79pc<vr|p(ikQFcs|(W3I7F`
zk&Z9nAxI^xJ?3FfVw5H7PvX}_u?c4ko?J7hFn1EnoWkNssm*YZ-pMs{3UepH%qc9M
z6f?tFh9}p|Da@S&GpDdvqM563LJ_ykd;8-aY#+aDPsT7m<bA#lgQBGxJ3oshnLIzE
zC(H0KL_Fz+Phs)o7(RtjZNtmgBXl~veZAgzxy)%9yIdAeikTC7lPAN>Da@S&GpDe4
zQp}vtn>-n2PGRmOm^p>TlVawC-sH(Ja|&}O!OSTvmS|@E9%O08&d*{=CeP34$ufLG
z5Aq}#K83}TWB3$C;|-s@ZrX6Jz_fR+k9r3KIGC=<J6R)>*!oza>eI)STf)8(2}4+N
zNf^Q<m9VAGtC$>)`g7Nc7j~>}x2|?13+$K$lSI-i_zXx3H;NmQHi9Xqv=Mv;q@~;L
z4cQj%sP|#YDQzrggwww?nOyf{{Dp3d_wk4tbXF$wVah3OEN22~tFV`5eg(cYv8RV4
zwI^}_U!K5bf$-vCqLhm;6tFP@5AC?DHV-B3i%8^DZ!3oHZt%@>qpm<R2I)z>MC;7^
zL@5Qn<lnjqhqGmOp}2w)iGAC7{d9F$hfh@eDAMb=L)%wShjm|ZVRWumZF_&X)1OT2
z!_n~G!+}jl)QH4LLn06<4V6$l@07vp{uC-BU_Mk*$g2e>K&luD*0kq?g9&tGMP^7t
zAn|C}*zWQ&n~$fkaaqjHVjKd!T8lB|*0Z{MJ-dTM^&CWySI<Fg=|Ln;J06a_dUi1_
zY>u5k2A@K}ftRSuOs`|$N`Kv{SLtsid5UI9kex~<Y%)&Xp%&imMw=)zZ>dTw9<`<>
z4^bygMwGOrO(;|*G!nkTTB1FB+Ddkd=TWkYBt9z1l^j6m1cRJtG?YxI{nOrijZMWN
z+s9xNixz`JLoT{}z>#ZV(9-G}cP59kD{y*d|DJA2Ol-K9q7Qlpa567lTpc;TuQ7ud
z+XrL`F)4Wf6MG1#T7r!b>0NYppg5Eq`xJpcTH%VIBCU}*c4Ok{w)j;b?BEFPtlcSL
zSM5UTQC%kolY%sG+@FtkR*w5{<i!E&BU*ElJ)jO>(!oK}_C15^$K$E*8y<DiZQN0E
z2?wig!M&s5Ti)>dGsx|zqa1qB^M!6N{DUlRZB!CY&xTX9;nLEJ=kUMn^Or2Ry&z=U
z`=<m^|G0n35ntO)$`T(sq4OK{s(!?);9>~BSE*#_UR9n1#d=kFav1Zft>dkzo5aSc
z%+cr;`{K>`pRs6E3XeuSqZCff*}flR`&b_i+I~UIFmL-Zcr;`CGB}O5eTJTsGOM8H
zO;=XL_8t47{zduJqxLGF2mElm2b!2&KTuH1GBEFy`)uf7#~x0$m6@j~7Q{9xiV<zY
zP?d@6$H&G<=treoCL%XX5iDpKrU*u~4I@7}kGH#ni^1{|F1-$RH?KP%Hbe%;P=_wr
zqVchw?`m<SWxf(MM*R6VDWt?^)ScYDv~-6a=gc3S9Imu1TB63ZEUMvgu<i)cRai&4
zhPoT<msdmOJZV|8G;L|wQp4BedMmze%6ZbVWog>dvZaQn(ZLOYwsU?W+s;(3wCq`;
z#<VP|;cq2av?Q*yELsw8OYYyg-z_b#^^EbeRIaovYNn2+@}_N3Gai?Tzta1+sa$DU
zv_y?*MO_V#i}XL-PtKNCL*+baS+g{4Y1vZ4*W`LzLjN|^zqD*wnzpoTso`lctrT2O
z4Rw<Ki_EVsZEh%)D=mALs4*>zYWQ0T7A=V@EsK`Kn|5zV?s5DXFOETj2NdCXxl698
zIe62uZt2=9sn+JuW8rOU4&JnEEU&>iI6M*ccyNO2aVl?GHa1z0Q#sVOu}M$N#ATu5
z*W_A~%A1yrOV^%OtTyS1?x6}x8`CD+IF&ao8<(y<EgPHk#8f>lu{}=ZP0PlmYcFc!
z#2v%@RT|7l3=bwPxS4Mbd&W0m$6nhxkc765A8myPu7*%XHEIZPe50j-{9rJf!Iz^m
zgNlelX+#lmh)pS?)gSNg_vZKsE&Ma#5OEkys38uoDJ}RvpfI6>C_WP!h+;J*zZG**
zks)_jh}wi!77{S0Ag2<#hX9$XFIHm#YBLI2K){%S>KsVS>t_LGBkEaz-<Wp7cNd$g
zT#0y%XeJT6DZM~U-yQUi=9}kc=MFmuJJ3;?4{X@9VXP@yjNXKnGRZ)M{97R9eHIHG
zRf*$Nv0{{#nT!eLWhQ3c<A%k0TmpI%O7lD}fru$(MXj@dpfgKj!m$&`m{6WbCKJ`x
zwbpUJzz7$Q+=Rk1@NYs*5xc}ogsyGS)8dJkP@6y=6Y6uVbZ%Cpn<Zd3p|C6xn9x+j
zFbOgl_Ot{lCNw9J$b<$xOAQP4wRr3%G?qmI6Pk)zCSE4fz7|i#gytj?nb4qXseX~J
z7LVM7zB2G{LQN5~#7kt@&*F)gP@6y=6YBHk#np%GCZ+&mQJPRqEMhdQ5k)vtMQ|^?
zp+R^%4y6%A#344N2&lI-FK$c^aTragAr7x8E%1!9F&#wlnb1HKt10=TbIZn5u@JQh
ztt=#9PC-s3bS9+?Drf;}GYVQjz?g!<v&-i6vjDRZ^(??|Ogq6DW^=kp#A`$|iP%l)
zrK2vLz;pWeERZprEkb86+Qa!^N~gc!DNTX%5!D*5sdn284<__&h7(h^$#L?ap&pe9
z4ouj^1RtiX(pG1JFSWuLVZnr5j4)!#Fjm8{jMGD)-Em8ZXhvBvVJM>vnKBqhTRekB
zzK_vRgfqi~2@{#&#FTAR#9gXoOmJYrE++UeWfh9IOErrT7EIX12qUHp!|@fr5pyo!
z!#;B-?f^Fx>x%158)e0Wp^P$Q%3!{pKJBlL>m{fs0ZXZIV*%ry96XpXkvVM;H~F?7
zxxM`yT0uY2U%fZMfeE{q;KNjn@%s8pGm8-xOxVQ;Bc==!?b|QSKt@?HVJM>vnKGEK
zr%#rO>m{fsg||J}mCV6|2@{#q261Dc?a8SX18q-E4ouj^9rxt$4^uV9>+9!aM!!p7
zgas3JF~W!`!$kY`OEZvBR!kVmC_}~!R`G5b--L^v;lgc0GilZW%tq9?0KYNq#N1qM
zR!QjujOZ$zj4_q@%|iF27vWGL%tn-y!a32%*PXCp3=t9q4WZvGWguWgSJ~t+qB6f(
z=qmam94ds_h>}t`H=>;wLxe;z?@%EEMs$@;4kIe_n*}Og1zS8LAD{=Cybxw1N=o6}
zh<0KO5fa6`Lxl(!(N#7%qAE+ii@^$Bb{acxAH19jx5ePi*uCA|sXZLo)86Rvz`aFu
za~q!T+=(Y)L?vDd8}Xfh%&e%set3=|s1cknU!)Ouo?9a(*@)Lj;+KZL$qV@sHr!cG
zcTRM-=@`MCZM-&-&s6DN#p{$*j&~dbo(F1G4oAa#4+r*S4i|H7-Fmcj1WMlCI==XX
z(8V$LBetUz;(o-uzSGD@%TlL-3KnsizUMT3EvGplZ0kAA31MF7G*!!n>!XgRy@}l$
z?b^G;*`zn`U-23j6&Y-Md^DKuk9)g#2$Kb64j{wcACD(0qh;T+-<!>b{hRhLZ;khd
zeYl7U@Ab9dK4JCdd^$WD_TcblmD`*S0NrfhZ3W%JTN|BIpZ0qF0Un`n5pG_*#lA4a
zo)tW<PkO`YCS2rtscOT+t_>FhU%WN8)l018|2K$Rl7;)@$@Od&R&RP1h8ClR_dHv%
zS2M<Tce>pqE1y$V?q+R)bnSc6gcXFK|64>p@owE;<kqpB#rv^a7bEP6cI#q9j(6+i
zv5>b8Bk%dwV118|4iBI3zg3+dY@I)b_B87ykR>n@b%&+vg;?^>&Ze=Xw`IQ;dkyjN
z)_F}k6~~3#NX7A@Uzy~+^VG`J*Q!i~F(S8<-fjSaUi2yxX-KkhGQKkPxiZP^gbrK`
z7jh#N$BVQw;jk~gpWNT~#*Q!&sEbDe{;?i*{$Z$hlMSQ3i#KO(x=sS85=);1eoOF%
z{vvNs^({Q<3j=@O$iF;qFwSYg-e8>HcyCCYR?%D1Xu|Q{qv3oL`lZUuox!NLvk$XE
zdz(+5O{;L@(Qsz>Clk0Adv82F?oD^S38PC87aB*s{lh``s9T?3pA0Zez<<H+?frw}
zsCV2y_|E4gu{9p%jXH4F`?#;Z5XWU6&r2YMkC*2q%jH<#OP0&G&`X*}gZ_Lx-Hgr%
z<D4R_g3e}R+jEhNHT%NVnp%8s;uQ4d(dHKBsafNrOZLT1){syHVS&wxATLyX&M<B!
zigyGiJ4p-+Ons8r&gUZ1$YLgh=WvmwGOX_+OJzHsi^MMY1e<x>-{J=ETv25EV#9X2
zgE_op**xnz%Cb2x$yX+m!D!b%(U7NWShmv?&3p;oQ?v;A+$d|b?1jb1)jSz;qZ7lt
zz8jqw5u|R^!L4(LI0rGF+N1IO%5Zeqi!#tM9Yr=hU9!DhPZz6_zN;Z(5;GYhX;!Up
z1$cRC%}mUkS~HV0t5%3*<*79@F>`9oOj4-UiEjZTV<1zT+Jd{fFX57fTD{mhf3a!b
znSC0fK>7mZ7srKt*Byzoo0EN7cMGor1cwV?dDYzu4WmOU-#+i^oaFW|>L+qAxYvvK
zF;r>ebck@Qm*51o%RuUfSmwzJY;B%+e3eVyN#TAJF5mOg<h|~+)jhoJ<zhQD`?o9}
zqUKl@C)&1AZXSE|RBQ#nF}-oy6vBg+Z3^Ke-ZqKBs*ZcB1M$kry0y9q;R#zP8)^vb
zYs|Q6W|Cl3>!ry_r2Xwda%IFV?9R1yhx5HQ+%ww%w;qnV+um(hTj%>Q@q`0FwfT8F
zqR}GoM-^BEm3Ws-rc|v2^<{(7tfpzL<)tFgU0zyJ4dNP?&*M;e>OcjvZkLaUM1Kb4
z5mneY$zXl3c=cr`l3RV*NlCrWz3(S*vz(*6i<X@u*6HDvC`*rmwvIv<m|}ltd^m^i
zE>TVAW=@-M?hqOTNu%J3p+`VcT|833J1ax73=PPlML<uM;BCAC?*(IUQw;_(W0q|A
zC6YvX9p`3?1DH=1NqxyfM_OwV+EIaINYNQei+dmfIuZ?<kxJwnkp}MEEWLxE>mYfF
zNxdZ6TR`d3+B>7t35ZFh^P+9wmeW80afcE<p|W{?9_$hi^ymabdO!?coE>V%SsnZm
zNuu#@m=b5DvgDy4i9>nlNWC~I=9$)AemW8j=BFmrV@#|YW{Bis7mUVm85xNdjmRXb
z!m-k&#&9!A6p+cUL;*3WC;B3~|C-uBK=;}usqXS%7r8=ouFf6C_$TX*oe=<j@+%pa
zMS|?Hn&Vbuz7zr?^XHR8qOydbmtC%GJ(JvIB<jmeOj>)QF^^{K3_D*W(8;JsRA@pX
zi5te!gLqeh1_e}dYfwN->Vs~K4b0oQ`cpGf+Hp@4xkO)@B&2GJL~xiEaFyf_;V}5(
zX(F$YkjRsZkW{LKh$oQ^N#>bbDMX2e<jNO`cy^@_0i$tGN=@o2@f4E+Q|?+2X|s4X
zC$l!C^0{&3TwsR9r5Bo-_bPX`3XluE$PdGPz;nZdK;=%&OJ#|MC;^Flu~0xr>HtYG
zLr79T777SSlxRpUkq<^|FHIb{wJFeI>N{d?Iub?3L_iIx^6N1%<{H+cgid}vN~lSz
zwikSd{#gpw8!5JHt1lONi9fi6`pIIrvn|1>o}WzooK6~*#JySAh|DJYL%5;xaBpuA
z_uaPoW&)~s;)mO}RJ&KN!Y=8IyU@&%jJkY@vPR9BNW6|`?|7U2wrHzt+%ZY9-vHvC
zY1;7Dva_qY2%<S;rcIY|GAC_8H6XJIq5_%q&jILNblsy1yWca{C!-Vv)yXK`__idm
zHu?9w$NEmz&HtgV4l;(Y;>Zj1UmO#rjRB|mgFUR)P7ltQwr6nG@aVFAG#ngnD)qyc
z7MYzrRp{)r1eF>-yc-=J*m&aJao2*>Y~H&(sM>pQruN*POa~KnoO*jWp4lMepu2Uv
zjk9$b-ANz4z+Lo-2;Jd=1$&6`WGEZXA_sjr-?6DH#*}(m@L)ce!X9jNi}06Mm>2kh
z2oy=*hx?9=!7MO!zmFZQjA~v6V*&#$gS}j)^*-S{VWusIF>TY9!=BKzzVOh`7UKHb
zg1V=VUZ7@uB0^<ZRokA9=e_yBzTEd6WT9HQ=w%8jqS>~(reO$yZ*vQeOu@b_1TXq8
zV+bpPut32@kS|;H>hsfOs6K{pnW~SHU-T(&s8x;~lY(3O4*NrwhM52uxj=&~K%KGs
z?xH>`beP3K0q;QR_TfgQ{#GCFTk7}K-AW<xGxFHoy1ES)n`~bNL>Vje(zp}2-qLs!
zTDnOg*&RhYm)%6-u1#MXXSb3zX410%Q^mv~Z3Y@tg^S=m9&?oY<Zb)zq-f}y7pnqa
z)f|pySB881Wew~suEVx1r;6wi3GOU5N+hzb21CAp5WZCtJh@j-l!W!5LTE)Kf}I8B
ziBt@+s7%8$Wh#VNbZLvWh!tR~C@J2#P!26xu`7iZs1O#lN+HFYBg&x#DlA4WH<Aao
zq6LM*rMh73OJ8u8<Bj%FGPFM;uJsz9z}A#B#psa;tdJH$BCvQVr;yl>vEan-NpDx(
zM+iHs;Q|b=Ll!%Xpu>P-Z=3U`hv68ex;pHlZ3hpDar+UD1D+_xq8@yr*b{cJ7nwG8
zh;$N6TNGo4Oj{ItQq$I8QR5h{5mlE{&%7!tnbN{4s{T`U4_)}#R98W^>`OHm8%vZ|
zE@!3d4TfGPRBs~A;`Nr?Uc0wfTNVruXZ_v?PwecfTkg<95T6s$^|3_#Odpq2LaW-x
zi%smE>!aSm02dDPNSYO!MB=PCrILHL#c{K;?Qo`V+E^qKIWzD>==>8k$&M0LTP%m!
zJUAmViMSb2O05e0_x*iX@<30nf?em(RLtOJpMx&mOqspTX2T;g2<&rGtoiC%9uBR{
z_(W#Oj5UX4T40zfz1fw3O(eQ>tplroVIB5$th^A9gtLfM7Gh3sJF?@;W#xrjO62!h
z#%E>ECR(_7zOg?(nDnNwZ$;H)Ftf6>L~fV6g&3ut9kEd=b`85P#3|8%oLeoMfk$D3
z<Jk;-AeYS+V$5x`RO}iyTZl84%@$%7>mv5R)%a<U#^Bz=o_BgRuB2vfRIU7kL|V&F
z&WtMKhtCD5QbZ`fDn;bPs*Kr*8BY+RIyDRuSJcEVQko`>cughF$pu%w;YLf|_c<KR
zZQ407#BBprSn|)kZ{VB_c!J~Jlf+llIwy%cp<Ua~_ATvsuHXz8>|a)!m;u720U3>0
zG!p`g70pVC=AlWeC7UM;6D64^3oAnNgj(15Z8p$g;M6f}1y|h~dp^ef+HhcbgRj;Q
zO#+)DX<SlNZ^@EoBPo=$iFfwy58yMu;laeJ4oA?^?eE)r)A0e?w+){^Ob$nVwVxk%
z^q+?n;EZuj54E6r=n*iipo76|2H%9t@Ph}#3W`T<P(kqo%qqw?KVVot@tDo2Cmz39
z?YJ}4hIJE%*PLeJu$$Ej=ze$5Kbmibb`=^{QwB2Tw3dNbQA!N%nk-C-iDZgUVj{7E
zlo;4wRFn#nh!mi}BvJ*bFL<s`QTj`yQh)*zX%(fxz}~RJG?+xC2n{CDDoBHYt#3ss
zFo{S3`b#2ZR(;+W07f8&ySVP~B7oYQsuu80MEooNi4$9C0}Zzy9gqU8;H+>MMr}|*
z$-J9WklT|suAg|!=F}69-)#Nj-n4Pu#NjoknK<lb_0plQ%V8t&rdl|Q-6<Tuq=s?I
z=wyW{Ud-v=6h~%lrfvj15f(GUi8*_j;m54C+VkPTz&;V?GQ^5Gdl_QLtiia_tMh1Z
zmR+zKUsOoU&5JpcnbZz(WukYO<C0{<jhGou%-PEfKW1wfRr}mdjZEe4`>W`jn-z2R
zGN>DK)yvlpQd?PKdx`OzT#5>b*r4X(#hl4ZYR8<-+`dpQEt#leW;iitFEjiU5fXDd
zwFz^1ow8h>W6oZN7&2=xUq6V{G=!rU2fYJ0>DR_%sCx79lmb-XxIHxificnKD!(aS
z%$dv-M`ms2_Jx*iF*BT)vzHlu%v#Iq2`$}RhFCFYFGCEOHJDXVlZm{QNnO@xIM6Mo
zU{1Y@=@h87e&Je+P$)=i5jq8GjZUE{*w^4Z7$1d#v=%D~(K0bj67XxVP*5hcP~P$M
zVhROmEmjg;t<hPCdK)mkvbvJG7#1D!7+5O3#lnx79DW5-*Y}1a-|?zj$FR8)wh&kG
zzwPsIh$n49&4IBGz1>V0lRpP%Q3v;;kPb_ZlM0GO?I9?v7rL64_s2WE{W!+cR;oiq
zqs$8t=n2rf=<qIQz$>dqo9Y1=JVQO88laqGyxW`i&Sogn#;(e|H@)5kFHbLJRrt7x
z-fYmAz!Cd%dAa7b-Qne-M!|+#4g$0i5Oq2ogPfP1bVr&iH1>M^feuyGkIN<|*V4AL
z&mmi>fKvCz$AhUxxx>kX%4z9F?a0@l+S`XsHCf9=dc}3{pM8ze)Th!dO??a9($vO^
zO8crze>9(Fl$d>~246^IRgsU-&VFxnk4Cx6)86C?mIF5uw0IVrpTuXC!>1kI_r>b7
zotD;N<*?*fZNljvyW<19*YCrZ5AJ-D4HsiDk4_VqSo@d4nV_9m3V)?rS55c%&qF^k
z*45ywRO@Q+C$%oz&Ndw!4W_dJewUSAdGTU_BQ&P^CM`oHl>`zoGgnU%GhnUknn~|&
zx%=L%%DlI;Kd@)R`v%#fIyWEAo<fa~4wm5ih}3;L_?0EB57X5{!Q(OI%?0CzbsoYE
z-v$qN2c!9L?>e6AxeIqUb>Zw+3kG2LVW4~EQKn8Ri%!ZDX{$bh-mt6$uA9r1+c|{F
zraGj7kHftk#Oeb-7=4lgSR$sA+UDiLE~u;tbl7W)5FrEV{QP@XP{Fq_D=fmEUkW#N
zz-*mi5i+38&wpSB4f^bsns+oTiHL|{nP?Pa-Z}x9(uf$A$(^??*iJNIn?S^{Of=#v
z-cH73qIO&DwCz?cxDpDRR&`YN<>~lv0@vovv2j%soN$LAbmQP`Sk=%<+Zhv-$Xd|7
zNuP7)lXCJ)Ch?Gfj4;d%Yg1j%ScE>cX=!Uzo1$>U;j?2u)kAR>9(}cz*F|%X($i=T
zg1Ho$YDSYP)hDK{RDF{1YE51NaVK)&zzsYOb37TqeWExd(Y(7WCdx)*Q5JssCGwLv
zw|1dgIh^mc;n*D;AROGkKNww}<FT+;VCZ)BK<SAOSFjJ@kOdgP2&}GyKHkC$B&aIR
zVQ7s)^k;SBGUyP{lwzl7DP#nsQdk|=n+h<59J`qRn#(`d2CfF%P!+c3*nGkNxvPYw
zNyDHlS4)s(Aq}xCjZhu;TV^38NwBiCsc6dMRmLLa(V!xh2SX&aB2e#(5k`-MSQ4zA
z&<;|A*alJNIERT5;EK^&qd`L~OG7n>PTRhZ=XPH;FO4>pobv3HB9DNISe}Tl6<{4r
z8e&<hK3~IXQ-COXB&2&{W)s+D0^Qu5*(}TUo9b{E2g8GFb6EdKTt-M95b%Ue2X14a
z<%BM*%v5YZ8(J&SL=kNOH4(*oL^?8eokU--SQI*f#Ue^Gw6~aW+$FQ5mT-0t!Jso+
z31^Wna{+f5B{Tlm1M;M$gQutoO9ze+6P690o+T|DI5<jJIB;rGwz8hbzyy-2$k{z6
zYYEq5vKDZce6n%m`xI1uoJuwl?$?V&5%4~@D~f{e>o6h__wAf|68LsbEv#mA4flhl
zq6m0j;1or{=S%VrF@?TV6amkdilX52CHZG!0xjVY0Ywq;e5oi3fwfUuRL&-Qpdc-(
zY80g9QH_GM21y08bV);dci_bB*|d*c!t^~y+@-|8F_;cB77A=(?(I*m^tuaotXr@w
z2}gnN+v5>*m$#pEuywR`>k+I=B=&(5r*K0v@v-3&CZan)4Nf1&uaPl+HsH(T*}&a=
z)5WQ3Tq=d_uWFm=CR|e04fUay#6q;Ix+F%h51)P8z1NL#6)7m}>jSeDvKPi{=bhtB
z?D^nef)=MeYT1#vJtVg**}?z$S@Q73i)8Xv5qAXRM!Vy|;GW&y_3rj?o9=GizN(gw
z+|GN*J(tf-)KizwlXT#j$8s=~N5d`OXc-wP%U&7TDbrNWZq_T~!|AeX7;mgiWu+{0
ziF8wTRJ5vgs-n=5oK3RDMxZR*lx8+=H?r`wjH-5h&^swrEtQqhY{qpzm7!7%2D|aO
z9kY=!{0v~(F;dD>X$F)sR;nRkM1zLx9oUnlTQD;(rI{`>N6WAod@Kt)sg~ULXAPzE
zQnt;~IV#m=RjOwP!_na!rZbj1V9U--X;#b5QmJNxyH<Sz?NJZD<XW=rgdCM-Kp|hH
zS`lV@(26P~oCF(+_$keTBCblc9|woopg$h%F1rF|XQnjEWoM~WvvJ=52MG0LTP-s$
zr5P<VN2S_~X9(b=m_B@L-8~8O%IUn6W;2m?h^rD-1DvM!3Y?~E)Aq8Z+D*hyX|@w_
z6<_C)SJhyQ@2)4!U<DDb;Dse6nAPr$di&SmM27ytg&CuWqZ&1e-i&JCcqBOB%cxQk
zQ07-h0%BA|_SM4hnq2mhRs&|&)DdI$&UNg*>MT}T4QIVH50ZL+yuaUrD3gPcDxX26
zFA8j3a6TEs&jNJRQH5DmKMwjjO$QUK0>|!r6fY-Rpj?H?QEvFIVU6`^<}A3Y(g0^U
z5xP1H?AXlDS3YzuSHZoY`Ps^e&*Lkw&C~#2`S7`X1$MCJXDctdV9karyX9Lu62gNH
zDk~hV&JE4+<D!c8HIv)?>P~Mq?Ave&1Dv50fAK<aHx!;ilVLX$yhb6)Sy){X3z7!E
za9w0?=Dpoet|A46oz{I*qi}RLlm-%r2C8e|F%b31EGzBueVrM1L%A|J?zwz!qMo{Z
zp5nXr#qgEB>!&26Wn`o*du3#&OjBjq@l%qqGP6>axiT|Us=>1D^(o6{0&Yq(n}DZM
zEtg@(Pg!Qm%1UWA%gRux1{3V?Da&wDmP#|Al(A9`$!jtTcSDtB!OXmrX1dHAEyHFD
z_xqG=vvgj{wpltyrP?ghZlAJ@mYtc>td^anQqATpq0whYi+0kKWji59r5RAjSE*La
zy3eO98;bZT&4MDXO0{36-9BX*FFP}(SuQ(ErJ60vexI_emYJ8*jFy?BQf-!HzfV~<
z%gjq@Hp|RWsWx+(-n89NW!X){PieLjaTRaB<mJ7%-BA6+-B1xj7)2b_s8RH0R1@7{
zlv^nYDD$f$0Wm5f`+B8&Sd@IbKx8+RtE%keqr0JWkc4+b>EH<NhH^2Gnf!Z46TP;1
zH0a}*C0np)&nL6+MV5GC33Ov;v$5?RZ32gkUbtFQH%U~R@bDOpGa17rOa0-rf4C2y
za_$`N?ZG{fcz+Y_U6@Vwhj0ax%G^{Zls4?l3;j#tP2l89;xImJB(Jji&Tf()7t(}t
z>EZjAE}apw6TF!VjtoId2RA|-gP|cebRte@d&kM=HtGi_pJz?aP&b~SAv<H(*fZ!I
zK#g^8!`zHL@(6bIpl3iy^o)>O9ILIlg}B9XS=I1~<uWXF2>*=~PR$<<hq3lVhY24X
zn4{hoMmpLYW~#{Yy+n?}vWLokBve8p9&R8{KDQdx0-6+!bN&o#Si>{0I+JI_g-Z1#
zP$!f<7lcasv?CNM&A7#KS=I1~<ua@vD*MX5*hxwVm9cIS43(mK?}bXkq@xugapZve
zmef~EV6|JSxo$1Wy7AW}#i)ChC#jB>!MjS<vI&YhS~fv9zAh(Pm`A?lDA*J+fo@Ha
z6sk44HT<|+j*bhXEUCJ26PcwcpdjJ`r?U!TA-5Cum*#|qDCc!TLu@#oLL`ROSPw8j
zJg*bxXTiSfj%2C*-4rWd$0!pWY%mL?<1`)xl8AK_2$f}%1joop@+?ND>`Mv0y9a1y
zHf~UvH2)@E{m5~pg_xFiBS8s*Sq*0-;(Y#G0?}Nv>SBH7xM)L6E6*9#Vq$DN2x39o
zN$x5U6ZO?Q`DBimnp^Kmpyk!O5{O0XT?s^e^^T~;d5U@xGZCj}J8({o$x1OTuilj)
zShU`iK@=8^N4@EEeC*s|xq0C#TxIJ_d1r4qE!cx{Jlq|O?7ivu08ij(Yom%|s#Z0|
zlpd-I?7AOZS0}e@(oHgAf3jL04mY@7*s*jZgRKD02_xzbQf;0hh|bMSv2<>ziOH{P
zx_rlot^=qfgSOCmdbWi&{F41(d^E6ov)S<S$h&)H`(gvv<E_?kG#^}^_V&S&quIPS
zns4s-6_!4pE1xgPP_KOMq*D<=4rAM>=&C^Jb}fT1eY=*yooo;nxVww4;4%_EbWuej
ztT99ws&Vs|^e`!$jt#aR7^<}}g+jF!j+kbVE<j_!B%wOI$t}8(PVJBa1tjjI!>-Kk
z05;wn_Teo3xjh)|dck{(b_gT{ZzcXC=4U&d&I*7wg59$%N;N6fpj4ewHA-1kf(q=O
zwJgqNP$3AvXD^%u&VT^o@3a;EHh~s``Pn9=8kDM2szxcRN|1qNaW;brLHK1dnBG0x
zX%QI&^Rq1iP0DOgs!pIrnO2pO3@nSYDc7nHgkNyOYuD_{`{NyG1)(3>yKe8o_D9f|
z60fO1n?Q>|6T$A;2Bqqhsu8fNl*_=fIGb{<3P2W&9#DR#L1YND2s9A@8A{bDRil(u
zCCI?C=&1tpvsML?OokrN+nqX*A<!bwL;z$cRVPp*U{wh+uq@6-04`D?NSU1)At%s6
zuzR*iph1~+0yP3wl^_Gl;%o$noRak0sS<JmEd+p^K!Y;tl(K4+WMEY(n}G#hj&?=B
z3Q{>p&&%Q>>dlTtlnJyD0A&IV%B)k$s!@`GRi$hO7E~xj8Gu8Xb1DqI2Sm9-lo3D;
zCeWnJ2BqqhvT6hwSXD|YfHj%l0^m?~atLBRhGXag;uYe_yNkTxD9xtDjkA;HCW9Mw
z!kb37s`G<>|Ez8A9h_D2b~<eoyNv*9Jf)hHYEY_9sT!rgj_Oqgpl+2^0L=?YmY&|H
z$DOu%t4*MV0L)9N2Bqqhsu6(rMPxW>Aq4ykDwGYsOpMZ<7Lg&)LI7ka)u2?JK#ejX
zei0c?S_~1OGys_Z<<R3!lgJQg5oi)<AlN-yr&Nsqge#S+08|T$vndzCmBI(VOpMZ<
zhAPx1&?3-8Fo$rZp4BN;qZEWIm8$@fp{EL<G?av2CPV2?U14k!XdwWlQK~_yI;Coq
zf^bD-C>O$&Lg0W3CF!?QBjf~H1eydI1nLNYy&5GMK-eN8lnY^t-%|J>Y`Id<1A47f
zRd2NsfIAat5@-;p6Mz7w-cbOkS1HK=0+@>*|3v=i1qfiOocEm49ZO}m5kMHBRFgo1
zGV7Fr0H$7L00E2;@>6K49sA&)NSU8h7^>Gh74@u*03;>Qq|64T>I5KcsdpGa*iuOb
z5Vlkj0lS6D0kRc(0{MKqEc8dLv+C_mr-fwO2(a6uQcX%VC{?FajZzRc)H@6yY^ah7
zU`t9*;g@;fbXyf_BLFg#YEr5}sXC=<1i(l{h5%?zB^^+KBon{~5ckw?r^N~Natl+?
zyQ0hnrRoG~lnG%&y~6;yJqm#WC=ES@UnWNBPE!?XBLHa#Gzm25S)EcfN<r8lGMu#N
zsRBrbvf-D>P`c9~G6Y%#nh3C$qn_0%RihMy4I;xyi=HZgWFW}|=mEXfsS_CjEdosh
z*vla@1Zo5zY!DevS_r|-7*r@5ewi4hJ2mxI8v*z^rJ4j9lvyVL0YtsS00M|gGJpW0
zk_w=6^UE$dN_VR2tu}!c0tki#8kAWl00Bh3$^Zh0N-BVLmfr%9)b~}dAS+zbWrflm
zi&!DhLIA7~Xi#RIQV>yy6#@`Zh!uVc?uoiXz^YX_NZFUA(9@fpiYm}X0FFwaNtq2w
z)d@gsQLi$9*rJjQAhviUxd6QYu|>TIk2$u8yGHU!^Xy$CC3mOOq!_0_3sazf%4|@o
zPN^CJh;iyw1<(aJ8v!btlJLt`;B;F(ZX*B(r&N<t4NBE1RU-f~j>vG*LJ0U7R45yM
znGB^nEmf#Zphcibpn(ATECgzl3EoL$IB79NfYMMBewhrVJ53@(phcibpn(9pM(ULs
z0f=!bR{?ZV&Zb<5aV`PMp~syDks;7R0Jfo2gHm-$)d)b0BQl({7&533gkP41(w(|0
z)J6cdp;VJn4FYunH3AUh)T<1jYowA6s6dhl-~-eJBJR`_XcK4=XcA};s3QQi*C@#V
zVw@_;0Ad{A-<i$MLT!4&V0wA5dz%_@&!8ZeSMNjgQxIRLX$E@Ssj9cy2tZx}O#%%9
zbp*%=B^7{Vm9iB;D?*Yn<DXc7-iKi4KA{Jc-?0?QHUbDalxh-aP-dM{5bV@D3IM4p
zWix>BpNk*=M9TC61Up5-_gtkr6$RP^S_GO1pdF)Bod5(o^(q4hb}Fd=lHs=iIHEf_
z1R?(<20JB0r_(@_w-JE;Db=J@gHm-$)hGqQPL*H)!A>O|P@yFJvMxB?CNczC1eypy
z*_5gis8J>aJ0e2>I&?&aL4_dvG8s(cJeGQ^O`wGU!UKT@W!4GQC=-I6D!~BSM^!`t
z@UaRcnE*YYw>wQDL!d>Vi2$UbRGmPL08|1Z!$}JvxDF>P1mTy7(c?~o$Pj1|Xd(bI
zl&TY`Q6>aCB0~VifkcKu1t1fk9Qy6li3|d80ZKI~)u2?JK#c$dJ0inL3n56uphDU3
z%fu+ZQzJ42S_r^41R9iCCjh}ty~+TBoqAURj4{qzKp-LJsrMn+xhxO{D%hzi>}>)q
z1i%P^24&U>K(JG<GJs&Gk_uqO=eGc`q$&rVRQN^r0i`>ZqSZzKVU|)&0u9QnQwo9|
zQ6>Pvjwtg}uq<Lg;85l#6<-#-1H7m=I~4`m1X>6{W=b_ERi_jLJN1wO1Ur>f04YM!
zAxTd#2YIOwY(TfSH|XsQ?SsKVe}7u{r*XBkj&FB53bYBd2s8;a5I_@2sTu(YJ1SQJ
z<b#q9s6dk0q6hek)8|A60k}4$ngkk@Stn4VOb9!w1Oo^=s-y!dkYqCSfZp!3hzx-i
zfhK_l0_<a{S84<x?5HFI2s<k2fC?qymx*B-qFYnF)h5tF07j%#gHm+@HOhprqux;f
zmB!f&Dg@y-X{16gbQ(k#0cepxlQJ8WsuQSDCR78W%SnqNg9<_TW$`H8sS_CjEdosf
z4FsS?O4SHJ98x71K&MM39Z-QJ6Tk;pTKPmxfi{5_fhK_lfjR+*L+Vuq5QkKf0mLD|
zpAdlHMW}j=row1kb}$X*tSWSE0xbef0u2In0uYDPs|o<#DkT{}9C9(^pGcWrfH<Ve
zdCw``v4}DPFes&(1R9iCrxe5?^^OAIK~>6T0G%#{2mx!_$*J%Y^}JJ2NZJHi2w<Lt
zQVmMg2|)Bw4;eu8QAq_rELal3q6i#%m;+BL^u*1FKfKAS`dRf-r&GhyZ3G}TfhK_l
zJ*!iyMkxq7sssZFIx6Xa3MJu}nc;Ms$Pj1|Xd=MAj(S!nP@_x;I_jYUSWW4v11gk+
zUnWE8PK(G8Xd!@TK%haHbxPF;K+sVo7(mcbMHE1t(o^_lGL-H#)mv=@&}I>6Qf7lv
zbpkcYgrGxY2td#wGMuacWCHYneme~!g8;}7Xi{c_Qgs3~0uW<}3@0sw;0O#V0GSNs
z;4d@?bp_f8zy%022{h<goj{EM)Ff4c0l2qHDu8ZBN%&=An1-rdQ=p9iq@h%kK!Y;t
z1R%z!cNjp7QAq|6V^k7BQmBC!kP!!s!w982RaL%CpoIYYItnx>vrZ|9G3r$Y5M$I!
z3?Rm+rwCY5C#T|NaS`=q$5Nn8poIV^6KGIool+2E)T<02#;A80K#WmO5jd3T1sK?Q
zS*i%V*{P@kZ2~O>K$%hvO4TU^(MCN~0HYfv6~KB3$)uJMpON0t!VrEGO_v{)>U663
zuuY&vph=*C06RJAl^UfW-l$v!kO6wC0NNOmtO9zEf7?U`0r)hfngkk@Stn4VOo%tC
z1OtdSs-y!d^b~%X7^OQcB151>ph=*C06RJAl^OwvH!4>Fl!mh@7vhaefO6=!(<Cwk
zS_GN|8VG<4rD_Bq-Vhm1S_~-{2ImSN{IWEZ?lg!D0#F*Ingkk@S*KKuQV?%c2?o&h
zR!Ij`C<(tz2GbA->gugFffj)#fd+v(ff@oZa+Q({Al^_m<wCqs_~4hx;9uO(^=I>%
zdfFk-MgX!=s!5<hpiThdiYmbXs<bMi09p)^Ob7o&_UL`^e)kDIp!`l%p=%Rp5oi)<
z5U3LXL`0dBRe}s4+_?DhPo)_3K6Ggm^qy0?W2v{=1X>87i$S14nRQA*xKR%oK)4}<
z{1iyLGGi9V%ugx|@%af_&L^%q6~$|tKnnqOu~cS*Qgs3l^wdKI(BUY_0D_)+ioh{F
z=D>>;e$mNSxt)$hF%AIu8m1uF5@^t~I;Coqf*7YtFn}1RiYS1Al%B#bQ|EMB6>1Y`
zApkN28kAWlP@_zUaq1lf(3R<_11gYY0`wj|?zD&u0+5DMO-eN=Ri{*q0K_;|f&s)h
zRZ;<zhMvMN6QgvesorWMz&@1%P0DOgs!pjIr69(scNjpQN+D1H$v~0`&;xqA(@<}<
z5n!K6fhJ`(C{-s=BLFc@y~6-voI>D$3O$8iCPwK_T@`8*XdwXG5NJ?loj{EM#5f|u
zNsA!@^fQ1=fO6<@r$%H5v=9Ip0u9Qn6M(3uUS$ALO(hvXR8vU=Oh)A(WiIDFpme9I
zXtfc59x2r%&>&DJ08vf7!vI2;D#-u>iF%5_q0BiIg5Cp4cPv$)O`wGUWTsSuK%Fu{
z1obKdAfb{9fMoCwc}L(-=9~&<=}u1<xlIZAL(cKHQ&H@<3A7M^9w^nIRGk1sH}xt5
zh;Ay$0HT{pB5?HJ<S=yeU9G6y52{$FQ$a1Z3A6|_2{aI3hfcjxBLKlpB^f}lQ%MET
z-yq3s-~*Hs@psw^v<b8bGzl~i02u-`%7kF2N-%(6r;-XF8A`%06QgveMPvxH2s8;a
z5MYN+y;36p!A|8WfX>9(lncR5y$ruhhSHs;%5D>A5oi)<AixftdZk7Hf}P4$0LgGR
z<wCGiFT*dBp>(IAvfBh&1eydI2!ITwY6KwIsS*qz*r}ugDwKp@CPV2?U7>0tfLK7F
zNuWWXPM}5rf}JX%07^qi1t3|Wx8Rq_P`Xo7_}d7u3#U>|0u2In0ub!fLj}OtRZ22|
zU{^^V!{Dn>gi1j4BSbDMl<rhjb{he(La8Q!27x*Oh<=2DlU0HYAo{tO@lT}8pyEBD
z9Q=iPU@6ch&?3-8023*csuO_dr(R_M(N85AK-BXn;}f9Fph7R=^Ai~Zl^C6h0&N6f
z0ZKI~)u2?J0GLv}$^i8He;7L-xJt+L|DT!32pJ)S5JCtcBepdmgp6Us7@?)LgRBsS
z4GkeH3=_r(AvPlnT4sq2p{1p-jSVfcgt21BZkQ$O_qon<UC;U4_v?9j{qEOmnm>Kc
z=X1U9>%Q;jIp<W9e2D%A=+ry}pOJr&=_r)n>vu0q{C|()^`|DLk-F@>X^F#rO8v_e
z{oE7ZB@*)I>H7B~dW`%rP5<7y-ju|K^tr5?rX=$4_oj`4$BRyWy|7gMrUqj1GY|O}
z{pZAU(5*xNkn{4?L^}R1e&!{AUl{n+U8xT&#=ptGo2UJLndg^Be!?a?dEDnOx%HLe
z-!k#bhSm28bX;En{6r`9S-$-KP~aEVHwXVF|1Q5|SbYz8ekD}jx~h}M`14$hdCtPW
zOYRNprRL_aAEpL<(}L$ha{zwXFpi(AZmRyn5(qL(gx{^cFTPLug&ZCDoYb?vYEAbU
zbUZI*G%p*dUld0Laok88_kZVdbireWX3B5IaSwEyTS@bWsR{dgOyC!C^x$(+k7#5V
z$5EbN75T}0i!O?z8XUF`77@ocYg~>#JU$1%Y#7HEfiA3XB?OYQnF_7G&!A)88mccF
z+PM1aXkSY2L?^%2xy4=gtMuRTTXI-^YeC1kwUoOhl$QJFo0EPa#~3~*9HNmSIvFoR
z$A0zXw-r8bew+Wnt#2Hki`ti)K*xR!@UwnwLw@geyY;2vkdyjEBg5)@8#?xDq58H}
zojlIpm#ws(7t=ae{9kt+WFU7h3DjZpe4XlSUzS1_wJ-M#bm2T#C`X?98OPqxF-I%S
z%Z||6Jo_A-#L-F|&wb-^R3bNOU;Ys~&h4Q2+nI9D4*Wun8s!j;4CDB<=hsDkyQ(g#
zA3d}$ZzGNkyz`|NxmzR?gAdk^wY+nqS?k+fwN~F0@7(C7`u3Qlz5&!H`&Q2J+o`@E
zHgM;85poOh%ZBCt20EVS9^{s*pR6zI@7L;Q>#7%kQS0iH8OhwR9|O?IyxLl|+<!pF
zxoNMY_S-&`>#wU(T32@vZ`#4roa@$5OnnLHI5&%Oiz)Y>gOYwB$4cc8jSS<s6FT<G
zgP-t9KlWE$)Vf+j97~Dgz#um<9eFZV#c=%G%Pk;|pW|`Xw|5V8ImVSkG%}3iZRnVz
zgg9oYE{Y=q3(MBuoy4&Q0J7YSV*<H@5$mr20?sW%ZZ#e!^LG&Cex-i4{svHZ)cUJg
z%UyrN&`I6mCBt~Dq2t^R<l1?Ei0Yzv^N4pD@m^Rk#o=9vAi3V#0Df|;+I5PP+l^ew
z5#DnAF7?UZ&sIO<9mgl4cu$2NrZrrriM4{qi<b=JJ;}@MA>JcZC%OK9D<R&8iFf*T
zZhzB}+ZfT``P;hlJb>J0<OuI<%AJ5t9&WtNxVetveIwWHZ!2_Cw|L1g-q)bx{#L%4
z>hCeCi{h;$-frT305_ph-*jzc8*-!in++Z3)*x4MgtwA%?^HkIT^_@G6E2S2-yY=^
zFB!&rJ#?H~OS~tjE{eC7c>h4WJ8tIow-32Z5&do6)Sc%B<TfKuc;``Wj`|sIIf{wu
z?^m0+{jG#f>J~2<#`{m`m^ZCI)!&m<Cy(>ja})7CO}usMxcj#X502{Z$La3=%|fo^
z2yZpzo}qrmTL)1T?>zW%e;c3^Kk<@byvKXFImCOq>f~`gZyWKhAm08h-2OJ<!Hp69
z&4-TXxd6G%$PwN%DEE2wGu|{j`HbRi+1%}KCUjD_c*!u{X6QJ#n|RMuT@-IO@jgSm
z`*pg!*~pFR@58@$bNi4hIl@~@xqGOe@fO7JZVNx|Z?W=<mki_G%F7)f-g8wK#XCT}
z&k}Fv4lZvga-;g24js?)2y&Z|C%orV?%nEVyuHYZ>ThkH%R2y_)Gb~zjCVeCoLlqf
z)c(Ctby2*d#QPla9=pA}e~0k7sQ$jZox6YQkt;dEyMS`b)z5fW#qgHEkNZ2Wyy7Lp
zc#FN<2IBp#>Y{iji1&Hot=-z~?*u*<)!%`w+<9(6ZZq<P_j1ZTP5q3w0Z;Oy`dbJ;
z=52;f>J~2<##`X!X1$i`??Tl@@n+qex}TIaCVuj(9E%0H;q`YBa-;hDEKGS_<snyc
zgttk(<nITlpYe9Y@a_dM^Db9j@sc66$=Kb?Eg;@&@p;inu75rk5bq1b+p@9S-xbJ>
zy8e!B<o34&xy{HC-rrH~mFj1_CAj~H>hB!*F>g6^Qnz@?Fy0C;w~u&lP+b&n8S%bE
zypKNY?%z4cjq2~V&~bl<sK1LSw?qAmw<d;n$uf8U)+w)e$uQnl=s0(Tco(ZKinoe*
z`-u0fo!$N}K<*M*;5sa~FW>F&7;+n-k^bI>-$f_6)#_)wnRrn>s=wR8kNcYgojhK=
zWLWOjUT*E{sr`G0>Y{k-iMOA47yZfYZys`^`a2Cep63SSN{;ZhQSLSBXS~HRyq7-j
z_P0!V#Y=|qUIZQIHWBYVs*B=nA>Ka|@Arjne=Cq1)!$0!IJXtKjmQ(;`zUv{`Wf#i
zJ|ETJC-!jryBa#FTfAf#@1xLhZWdmsvFE=Js4j}PgLq#j-fjQr_IC|(qx##r!ky<l
z<XV3_DR(pVGv17iqj}eZAFt<Z=)_OFWEk(-UTy*LKCC)<oPR#|5U<?Jh@br0Yd5#Q
zxyX&`Z%ctY&n3uh#N(yEkE)mC=BuCauE69)_4l8<y8Z2gP985_GK}|A=(xW<#QV7F
zqIidh_YLBGb_e(RJAmBoi1TVU=s0%(x$Vdk-fqf$T>Xr<anoqt`}5rEZwqu%w|L1g
z-g}_q+}gjS*7MV<i{c#vFHnMh5brIQyX(0Xxp)d34tqW4M(8-V0lAVRywBiwsZajC
zdEghmPSd6wqLE=7n|OXr<R|YrnV-K-6St)9o0b#DJyYD*MLUq27tyyL@vbg&v>>+-
zdBX80%Dq+ntZ)5zgDGmAo(ezSmqXCWJcySJ<2}jC?V-NCsJf`WWrNrH_Iu);`lY*0
zN05t`M#5oz``?(mUIu8MU#8sKp<|9Q<q(Yw<5=wZ4Uylgs*B<%puTky#}6O79OKB9
z^Vx=R+zcJ}ZG>`PgV@%~*Xn0|OT&w{QGMGr(1q(X6FR9|ykr>fPG0UP_3baJi{dRK
z-a+EsX`0KMjohkaV(`Io-vBuCjw9FB=^*89rGCa+AH#bI{J6i3$}3(nEcZe$HxGqK
zKV*OWRdvFfd!=&V&oY|fR~Gy+`O*A7T^Mkb>gS5!mybV--`n_IbmF(E`XN3!24Xmt
z!!OC9x?$xIFBz8G<>gip$FS<6`c_4Kdyo2d+6?zPxDvUAD8z>4zP-MCJ*q`+IYh$y
zK7Kdex$0+q%iJP*omRjv$*U8S1D(_@UNS7V+{^7I-Van4#amD3%lpK8dGLNp_&hW(
zroKzP_fz^P_aBtIdEgiBw?gF*jSS=1#Pb`1pVTe$hpiaSpMPCwCXNx}c(&BNE)>Ub
zJPjT1w-Ms_lyZL&_=Oy0${`vV#&NXgH%1(*R2S8cHd=pwCyx8l-1S$1+`)+T_s%qT
z{f#5H8hJ8*Ur_E6^|SStlM}uEX26fvUp{nFw|L1g-gUj)$~RNz##gF~;_W8hPl$J9
z7x%uT5V>+4v|;DO(a>?<YLF{A!uvITm-^)IZ>gX0mc{VCva@@iJx6)PONQ~j2p#9v
z67RU`qId_0_fz8CKX|_<+;4M{yC9;!ZQHp0Z9r}_@`U$0$}Lns;~m5oi$q-qr^1i>
zI|7~5EnYH=_kVcZjCs=rQ~mv3by2*d#QO#DX5eN;@a%o2QRGJT_X@lo#JO3>l^o&y
zk#eW1pYg7V;r$kqz`SW&2fX4X!+8G<9p~l{uNc_6^3S0O;vFO2dBOWVA#Vn9qx##E
z<<4^fa;?A9D0hzf8E?}z(f!>He$2ZFI+;K5l3~1Cd%4}jJDqZU-mJx``|&S{_it;v
z`*#U)qxyRUbUe>})L*={6wdQs)X#XkVt8LbvCO+ddBux)pM#Eb2Z%R=a(&(c;{A$v
zzs+{f=U(JS_4jz_ICq5ly8-2nsh{x{ZyVj;XM*<|Q`aNtq`%_DyiY;Lxi$Zn+P@o7
zuFqRWy#FHJyB>6TE07!2-wmMS+<N5N{@sLf7ptG~R>Lpqyt?`UcRklaCw}6^ybGb@
z+y>&!rd*%5ig;HO?>pPOy!FV9>hDbGIJX74%_vOHt1T&aK>dt&Y`bXQrQ5l@YoHTe
z@seTt_crJ_H|wobf48PwpSPZPzb4*4ZtL#f#P-qsEr5=5^N?%(#izpk`<VI}Zx;Nb
z`g?z_yMJ?`6F>2iVZ8T1$GHW>E6@Am&gT~5{WtM0&2jsikKCyKe!rzV&n3vU{_aG%
zi`36}+w-D%Pk|pE7Vh6J=!93iWEk%}FSn0)acdLH+d;hlA>PN<cCWwP$c@^++d;?k
zJVgE7jdCAQKjZC>;k^SdE-~+r@`@Mp-U=P(ju5Xr?~-|udGgnD5An)-l%kVg&ur-S
zcLcdn{oMjO&K;xv?oGMN)z5e<cZ}}u<(Y1OtD%#+#Y=|NCgW1*IJf?<sr@^Xa(&(*
z;{AqrH(BQH-}%Um>TmNy?mlWluGA;z)qa$_p86SYLk#avo$mf^R$lRvVZ1*;$Gk1X
zTSB=$?-=oZOT5?Y<o0(Fa$7W$b64)@&T|`b8zB(hS(MwLe#V=VAKl*r;D?8W`!^pt
znLqK8VZ8f$xj93r{vJfRK5trU>i+7##QWWIZhs4r8`a;lpyPQiK(5p$yoXTkm+EJ{
zW$=qSpa0S0_ID0+;wN4*jQ8)*ac&XumQ$|Jn?t<c6Yr*bxc!}rTzttuI4rkrcelS~
z$Zdp5c#ovq4D~bKRXa!XzOkFz-*M=KSG;6c?rYF7Zy)i_rd*%5h<JY>-sY#>{!Sn_
zs=q%x<<9dE_4gRcy<Gi_H*=S0-t*yyhlT4o2Rh*uFB!)B8!vZ+cq=K_=dB=K`C1O~
zlV7ug_j|(UM|sGN>Tl;R?mUlCe@~#?GW9dw?p>pKr^AnVd!Z9v@seS@Q@z~Uw^RFf
z9_9MHHN^WP@otmnUVr<M+ohSDdo%7scwIFhw;cjm&nHvvChBLr^}9v$t_?ptEbMP1
zbiylMGK_bcmz(oWinp3_eclG*{hW9&#rrW5F<oD{X-00YW^(Sko4C9M$hFtKPp8~E
z^)uei-J^L+;D?8Wyxq_VuXu58v6ov#yk}6Z&)W)K*_YCfkBN8Yn9JMa)n~6??FAk8
zw-&ilpZJ|gxvziWa`Y>QXk=L5UWJbR>dEhH^7A=5sc)mi@%l$D#~^a${Qw)r@k{79
zw}EnhL%A=gpY?5}H!sHV!#`Z!G36C68K(OVI?ipPzMV(8K5sAazD&H?Bkpx(9J!rA
zq?7yD`|df^iriu-q;K_<J45}9w{4H;b$SH+@UU>5c0woXK)hra@1b7q0P$W-xjyeO
z@xDU5=l;XxU5;GbnuWu1UtQ_)jvzN5D&f79a(|_M#yfY<Xx{DNhlho{HP8vKc*(Hb
zZM@vHzopKh%P809T@BvweJkSq*<SAZ0kz1*Q4$VY&wB>Cu)Zd(uhFY-H|Ti%WuZRd
zka<}+Nqvc1Q}=a`P<_80aIgC<$ZZR&OU=t>&~a`Ka&7&|*U!oPNgd~@pY<buujqa}
z{knVI#}8f#I6U4bq2t_2>c_Q|>-Qs@c)ugweeigRu<Jqzayuh<Wu0?w4e|bta(7if
z;~kCR{WbjXu&}?Yl~=rE*!nx&%WWgx8z|T3EhOGG#Cs1e77}5+Ymggt-Cu*RvtiyY
z<mTgXvaaO5$ohM$`WbIWQFMQggC8Ci@-Bx?)`#6=8SgP(?hx_fsaKfm^Ol3x_S^r6
z_wzm7{k8(RQTy$~Ko{0GsP)|@lZ9dRy$>DF%P8s-4w;wRC#i2P_2V<D?*}|iBCH?7
z$c@@>w?oIdW5~7rwv=+eRzK@U{XWtC*f-FHyp7Nahj_^_-o3rtyy4XOcNgXQ{iq|}
zpNRMQ40pdZBX>B6baH1x$Gk<zEr&wpxt(&m)z5gVXGZfrv7Wo%YM~Qe@seS@k3z?}
z4a9pt<@&tM;LU=M)F)3|#ZP`c{x7$`^~lY}zuU0${`aagj+PjXeF9zBw<XH)pvSQ%
zbj;C09CCe?+JxWdXrsPOA&yO_xP5C!F5UtThjDZz-1%!muH?wPJWRP6>Sw$?F}#Pu
z4-X4@`;}L`WLV!0@^U+f_fg9AdAo^s8u1q8yVt=%<Z|CEw+k<n@;rA_?&FlZi~1Sw
zsu<pU_%ZLe@`@Mp=6Sh&l-o_YKJNhWrV;Ort6bg*<PHXrPVQ%)xx7QjodbpR_i4&)
zQa|Gz*f)A#mcfsChoO`8B3?3Vo=d&lymwRQ&@+_l^Ntely2SfS{8=LG++B&>TnW@+
zx$ola;{Fy<?sJrTg8CV+9M1TsaG2k5@WaEx^_&5n@QRlV(;egGmQijm<@&r6#Je8x
z_Kv#!%|h-_5b5M@4juDWBG>x+66HRne#W~hhWDb6-Tsa%uXxEY-t(d3+z#S>g>rq~
zEL@<o;UnuWgLrqyb$KU{D>@sNd)GE@Za3xrnR2&OKjY2XFS@^*!w(M&`<n}$^jExO
zSneiXZXf01mN}`D$N9Vk#JfK6{{B;!Hy^oC`!@j{&+`!V_f5*ZOZ|*@O$_hJpSZkf
z`v<(@CBt}6gpPCb-b?M@w<y==EhF9;#JlBmcmHM}H#eCWe6ZZbYkB*Za^I%h4b{(h
z3*d*iaG2i)@WaEx{uV2*c*!u`dR}fB<qlJ>&s#;j8xZfiAG!T4MQ+so-3vON=St+-
z{(YZv-&8;2&H7n1?@j-3`<n}$tV{8dVZ7Hv$GIKE`vK+py!FJJNxY{Auk(lJb3Sr&
zlZn9x%YFY@H@BN|QBt^%PE<eREsx<n0e*N`*xyR!6)zc<`wK6(k8*J|hPgg(3-NA9
zyqAu-{jEZ7qh@mMU%qg8hmgAj0y+P1i41e=)X#WFO5E4Yj3W<zcv#3g2A%X*ykwXz
z*UPQN>p+?KyyX6qa(&(o;@yOJmp|e1jw3f$0(Dq!K6JdU8YuTm%6(A%j5q7&(d)Sb
zH&S?5$eRnD@QRlV%Wa2_b6Y5PHRbxeJ;b{y@h-$9Nrc^R<RiCHGdXwYb2qmQxz^wR
zQ0~R*XS|&UME7@B_~Bt8?+WOISG+iPCoi`MuNzu_zolHCcZhg5Bi<i&cF*Tt<VIbO
z&V!EUxeU2>Uj3JHzg9ovT{J7YzhC6L=W`o$!Yf|P`x$hc+e*9>l<V`35$|;3eH!Kx
zVg2nu?)+q8@WIwq75>V(9mp-jzsWxOiE<yozlopmW|T(r;xgm(Hyb+P6)zc<D}UwO
zA>x$`(aGbgX6frC__K`M(nJDJ1;Sy^^NtO4byw<V=9UJJ$Cvdchvm+OPIB?-<QPS+
z<OuIt&|0oP&uMruMef%`w+_wo@~_<Iq1B~{L@#tUEO&kAn0E}h`4EX;I^{m7em2j!
z2S(5HZ@zS&hZaC59O5Oza?gT}bF==Q+DCY4A(l6Xc()+lD^ZyA&el~Ca-**M-{bi-
z=jI`|9FG&;8I-#~{fsyLplIHUg6HSqxse5(@QRlV<2~QYttDQ3iApSQ5qRzOk}Zk%
z!!O-^l!M&dWMc3^;}dVI&Nxb-gH1TBzS9F;$WacRaAc{G=}v`?=dXb{HicGn@;HB;
zmQ&wyh~u+uU5+`(-6E_m^>Yy~gN}1skSjUTx6LW{@9Jl~weXAL-7L_BybGWcKk<@b
zyc>JDt;Cx{xjt_-@or7LckJk1-x`q{^?YkX=$N;Ia`C0$;XL1@e#W~5eo?$P?BHJC
zI-nC?@seS@*Fnd*-ITi><@&q}h<6*}P5j;E?LuzU_3gwFH@6SDc75A{a=(Rc3hFi9
zhJ&MdpTdndbYXv+p%Y&5l3~10K*zjUAEeG9e9L(_&pz)W;@ysT|F*8Xo);lEH<=iG
zu-v1e<J>&T#g{~cxqneV<6R!Z`#Q{+w?}!!ONQmX3LWPbQSR=P>+^OJ@AkyI*Sl_i
z`;Z&e-|O*Yj&sY9YyI7ma`V;Ccw5V&`@8CIZhzaMlm3dA4C5Vzj&oayw}^6m-d^I(
zBi?s1T;5LPM(y9(&~a`D<?c(l1L|kIy)nG6t>^L%D6e=i?<>%8Za3xbPq{wtF!Am{
zyqgF6D7>x?AvdbO=fCIX_ECR-PPrSXpYe7a65Zc7gLM$@-{sIrf5nS=Ux$u)vp!7i
z-%`r;c~=wfj>LOqn!A5jAU8LNbaKC+=I*0B$~~BJ7pR}{4#)6b1V7%tqsl8@GGLP&
z=X<$DlzS-U`n>5&Qum2F5$}=MAIJ^+JBHk-{&u|M&T|=ZZT}ulxd*DB@%9`V-QOwj
zW8Qw~q`%@N!+3wh3r5`ER^qLoT%R|Wc=L&OIbH;3-a+K%CKH1XmYWY9=XOx;(Ukk3
z`Wf%)7~YOQy1Wz0D_$}zw;ejp?WWvgDc9#MCf=QicWkB0n|4?t(I69`!*XXq$GLsT
zwdd2vQSL|TXS|K&(a)!E`_ScG1fBF(ykuDJEzogp)ymZVolChs?;PUYm3Rm7CKmU1
z3379jiNOcUEr*VCYbp06%6&!sjCTe65El;f>wCoI?NeUyl3}`D=s355a!;XLpLag-
z77*`$@S-8}4j?zGzlTD{xh=@G{{E73KUY8FEk7c<zjp=qb>aCu7rJzCikA%Iy#qSV
z&HG2HzcrNW^EMLiZp3@@PVV_!johf`d22(*xkbpe^Xk`>d#(BzZ_$y_{av`Ddp?&!
zC%ob%!+0-)j&qxc_bkfwd6y9Hw#57PnESl89J&2Lq?5ZBbe!9Y+<YkH`O!I)`?~rW
zZ)Qa_@8U1q=kYnv39op`Fy5P><J=zNt)pC@cRBH<6Ysu9xL=2ohuofs^XkRJ-LEeh
zKyE4O65b0acQ^Gj-jzp1^Bw~~#Dwd43_9TzFB!&rl$V?FQEEM3M7ch1KX^0YBlSIi
z_bkOvex-ltuIF*&LJ|&*PyFu#cm1W$4(hwatM7a0xF0#FPdFs^(n;zYrha5mKU$7-
z`;m!Ux$fGqdD#Ry&doz^HAIqo8RcH7e%6mFY)Zt1!~E_G`WE(MK6Jt%UNTH~H*}oa
zMEz)_T)!Wyi8q&c7a!*G)**LA#QNI?I?ioHZYk;#-m570I`uQ&{9~heA3M}te?`y<
zuXxEY-iM*%+#%w<hH`!0^gB}bf4dOxC*>}033AIdlXK67j&nzmTMdEmUPrm_tDo^U
zRYvpv7|cu9-$l>~uXxEY-v4^@T=sElzqL@V&znoUdlT<Zm?XYlE<x^^i2l|>$Gnxu
ztwvqKdlTh;qkhJ_==f;fzhCX1r)|&)uXxEY-glwn+-~B%g>rq~V({AeQbfFOSGea(
z2XZY-ay35jdY}vY(W&*_>ecrubX;E_>Jtu`m)j<(ubld^57l?+7ViDaa^#{V;jmgq
zH+SzN29TQzmE_(*xpnGi{YX0@x*x~F4{Z;5Gocd>@seS=v%TCg>PH*p`u(UT-kHR^
z(Pl1hHga*KhC|~M4V${W6Ex5FP;R>V8SnfU-hXc5^42S_c*!u{Pod-frj4fd+kKSl
z^DZFXeTjEgrpw!a+~y$C$$b#t2+z4$$Ss6I`uhOo?xTLjn>IJPzZ=5O=`VEBU-6P*
zyz6_pWyIS_xjyeA;w>iLzu)Per`gCoHi%4q)cC}K&@pc%a<icj-iImouj*&KwK2R8
zEp@LS3zS#9WEk%Q&~a`p@jgnqK5r-S?oYfwY~}X15xG(Qt%i<s8>qjJQ|{O5XT0er
zM)&v6Ic|Tmpp*WJmki^589L7GBHnJw^?7@V_h-a=&s}bRbCApDmBuI5f{t^0sJ~BB
z?yc%)ymc|W=eD{1ZBSnEV&1c%<J=+QeTH&<-eKY`A>L&hyZvoKZd8A>pyS+8>hE)u
z+pd1bn=voCzgKSL_BR_k>92S(@8!^OZq_HM^QxC}ecsi?`*Y%*x!CP*E^_fwO*k|@
zaqlheJm(=->XZHZ66F@CpYhI*;mw2}pI7zDD_$~eJ!g2i1;qOb<@&toOH=oMvxxWA
zm)-t0AU6lEG1{=)eW2rcE<x^ch=ljgl>40e8Sj#lqx<{&KDWOe(8>IXmki6jA3Dw*
zBi;eZ^?7rNx0HBuZgl(Gh1}9)V(>xZ6W86~_IHB%`zGaXq<+Rb7Q_2}i`(Bd$}3(n
zjQ3mUm^bay)OyB`I7sSbo_yY7;ysvnU%$!aO`H<_|L4twj&rk+YwH=`${Oarpnk?%
z3O~e!!#ExY<|Vwps(?=X#7l<h?uCwXbBGsTG9BjnymN@RjCilS+2yT7ZfP<x_@MEL
ze=c%!3y2qAN)+ZUP(R~sjp02We!PF%l~=rE81J!OZV~a~Et4?U=bcZy<;444tIOLN
z!#fW;p64>+#Y-n)?w9IkysKh(UkJ{%u)pKVD_+d|9CVypLA<y`gt<O%Bk>+iyk{(N
zc_(6c2XA+CtBChA%B@mA<1INgdOaTiKkjcibh4hsi+T6=a%+h9pOowKE+O7Sh&Ly=
zuM6LwnS<N|g2?1YjZa*Chs#?}y!cX^aGp0(KjU2#!~5@GUc&yiDX)0Ru=V^Ebll$t
z;$2O-KJRkkJ&<@W?{NFuf!xMqV(`IoNAGuYTaa4}iCmBVL%H?pXS{jU(fyqbKkjcK
zbkbk(l3}?=c)5MV`z_`Ay#2&`1o1v`o6B2V?ec1TA_qF2=OOCve<`<9{fu`7{16uo
z<M`dJE^i-n!Yf`fOm_`*oI66i6O`-ot|Z<=iTA{NT;74|==J>K-EQs}@%}`)N2{Ol
zX8bamcMte+f3u+zUh$G)yt{h2<HS1^_eG+U$N9W#i1$e1tqrdG;r`7<Zq)uAy58kY
z!@(jsvYywX+|$(0c&lT0OX0`7waP1AGK{yx%gsQpy^fSlxjt{^ovHiD!-#jry>5T&
zky{i*CO_(QCl<83yg9_X9_6N~pYe9a@O~PsgYdlSR$lRvVZ0wf$Ll$dcxO<q&zn!Y
z2NCa!_qn`1$ZZHBo!kQGIJXG7c3y2rxhvGqc#BVqUe8N|c?o&Tpp*3?UNVgLHt0CF
zmUy!$*XJ!I-UEnt$NSvp3l+#+nM@2mSnjp=y7%o3$SsFN*7IhRo1=clTX1?b?^wJ0
ze4!XR;T10#mb(f%=ItZiEhyLLolCqG#QVfm?(4;+$Q_&#WOD8{&~fe%a;qT_UisPI
zQlHe@seZ<r`KxH&MOV777w14Hj~6c)#@hlN=N7F>?cZF=^?B>SYy12t;yo7cFACmt
z-KcrUwJgcie@@8zkkEzeFJJ51-m9++I<Bt_^$CZ}OWq{)HBvujQ+=;wyX&tIxiwOl
z4y&~gI?k;?Zay@UyA$R1sGs$t6@G{dhxy$dyv`c(wkxlA$uQkg=s35Y`mqb;`u$i!
zyhju7DZ%TuVLv*N8})iqf0mouMDx5G<yNYn@lM3>&V(QLH~oxY{fQUz?&amS5N{#n
z`n=1DcMkDhIm7L5CUTpDNGJF6^<CaJ<l5`SdsFTL^)ucj@QdniCH$DTLwUtZhV^%j
zmpeebGbz{S?I+%2i1*El-0Mdda*qunlOJur?F}8Ts}ba8Lm}&VKgxYs{fsy9>uBCP
zFLdt@GN6-vDPA&+_jc$wcbs@jDA(s*Nxa7rZ*lOtZMdGZkQ>$CyS8-uoA!CCzq2TJ
zcl9&gwiw>&@Z<h=DzA7k?^G|h2)TAn9z?l5?;7I$1@Ydz!0qpH<VNk^?=E)dxeU41
z-$N+(TJ<yDwE5Bf{U!XEHxoMPuXr)<$zE<1@#3xA<T{YY`MjBJsr$c5;{A3*cmHN1
zw>gM(a;u@^byZ9KJ(6<A)X#X^;fJ_z*gAb9cwZ<ypSz$-hf2I;nC>;`IJb>>XH%}v
zn@_yQ5pVu)-2QeW_s}3R`O)_8;&a^ob|F{lll^-P<!-Hh#ybJODBh{?<Nl_f8Ssji
z4CDP@t()6Typ@#e^Oh2?e9yl4$**mK*KNc7n~7Yxj@z)@8}N<mJkNc|9fnAFPoUgQ
z)X#W}YNL67dePm#rO?UziI)t^{Q)}8ZNrN$wtweQuFpG{c;^!Dj5FQ-mLs<`nHYSq
z{{D8pJI`Inwf>$=xoPTWyv;GZW50I$+p4_cCBt}ELC3t^#9K|dK5rfIo<zLQo#pbj
zAvfyzYCd$F+ef^oQ|^=MXS^dZytfDQ67Jts$}3*XyBIpo9U$H_DA(t0Cf+LIt;hbr
zJ_^_KYUGwC6N3-d-;uN3+!5kMNy&alzt2)X<1IWVdOerJkN0m0bn<xdl41QV^KwUt
z7g1rZ&)ZJC)x`Vxxh`)Ra!Zqm!3X25fR5*RoOto6F!w|CGv1~c-Y0`|E$r_i<rOa(
z#`_p_oI63h^0n`xlX>!aR}ioK%o5Sbuelevyh~zuUxYd5X5i}@ZU5pHD9oL$e#Sc-
z!&?YH?(eAbikA%IE%0))kZb1^F7;uq&pSxGCll|C;Jz+g&tu4q+P@dqyS#bC`&-IQ
zQ$OP^_)YYB9u4Lt>~Ar2GJoPF!+2Lh$Mal3yq8n1&%26vPbA*DE8PB;A~)*wmv>;!
zxh2T8*IyP=?iuQ5ygf0zrSRka_A9S=F>i^NTTi@Al<V^*?n>QXokqMJ=efLt$ZZTF
zlOJvW&VY`2o2b9nQtndqGu}DpM)$X&&gHFwPWmfeGOWJ~pyS*Y;{6@v`n=i1dkXO$
zd8x}=gWRa~+<l3g+eW-MQ0{^1XS^LTyxYQ$`@39u#fy2j@^U+f7jN~&?%zV<ts&l1
zg6n>`e^<otzJiM#&vQ5NE~eZ{^)uczF}!=hk9pJTg8qsZ^X~5D_7LxFl<W7moOn+q
z-b91j-wfnNy<U744ie@aAl^GD_gm<|5q^JYDf|!@4qK<g!8!=fs|w{6FBzsAf{t^C
zh!<aK6WiZv;+;pl-Iuw%mB@`cueOGcb4QVD=hZ!wyG;G8zk@NnEx|m8yd%mhUd-DJ
z9p~oY`vo!~ko$JLG#$&kfOwB5-V@s0=YyljU71V_KG;03xW~P3FF<a&<~~5VN2#Cj
z_MI2q->u-s>v<45Ij_V^hUISV<<=8#C*}I<c@gpcig-Jk-PenUk&Bne!eO~t(D6Js
zA-5DNndgTocd7ar@7Vd#yv^6TuNSX@PI$#jhUGRv$GLsP`zYo5yq&~*2Jxoj2X+ab
zy<VKS0QX$U#NdPFUefROcL=%pkO=SNl>0yEc>m6YAL7DceqX)n_O}K);T10#ru!#!
z%sWB6-ISa6x^e^$Pt?K>OEnzk_vUMXU#Wg318<1u;?KhI6!~qTes(<`iQ%{$e&7v%
zKFBKN5HA^)d#RUOfLz;`f23T$Z@uVS7JQ_>`P8?q@Wn*jx7ElkNhSs#EO&G0c>YR=
zw}*1?{y%s971Rg)5RDA;TM8ZfRl!gCCiOi}em=(#t-rI0<AkeSjw0kn?YCE(+}s-E
zmTK+`lzWu=*?ud(Fnay{41USJX@e`F6Atl`VZ8f#xgFHEKFalZ$B4I<c+U*heYoGM
zkQ=q%-h0Je_ua^~{q`#5o~nMv+a1GuH2j#iS9!&Yd5`pRM~L?|%H2Cy_u>Cx-4DN}
zz{>Ia0OyOWms0)Q82k$HXIU=;<hQf>*?z0ID7tSq1m{(_-{wLmeG@Mk*0<}t+?=mc
z`|VB2_4}4~cWS@=hWfU1us_1SRU<cQzwO}dj{@Z8qAuZmi*lC@y6dk^IYcAFI39$K
z_ge-0Y`+bWpU;sE4m)4YCyr(Ny6+EmAlI@a*XF-H(1rIKom$`Dy!zUp<N7M8zTrvg
z%cuG-p!&Y3bn9ClQ{O)VU07eY*7v?w-`}C*`l_hDkxA++ruyoszRPjW^10iCT>OZS
zaM=9S2fDDney#6Auf96yxV{>yZ{;NQl~a8eQhlf5{U@$(Fs8oa0$o_&h}QS9SKl$v
zaecK^-{>Uu&87M-qWb<1haJ~98dKk^fiA3Xwbu8USKmv}aeehv->OOKn~(ak&^6hY
z7gK$QpW@cH2DvlB?xyy~A<%Jd1Lb}}xvTMY!r%=#(k~9qE78cXy(eFH%zjPe_a*uH
z`@DhXc>!_!;y{-p6S<ZpxwcLZ4|HLDSz6y}uf9W|<N8{tzON^#uZ8NngzEbPe(odY
zB|J}aG*@bqVYNOS=)(H)R5$L`_j~BLzE-O5n@Q?xqxvqT`WE6v3a+mproM{<U07d{
z>ehJmT>u@|*GBdIcar+LsJ`D)eZ@1~`bv;%b0+g={oOs#h4qzceG^`NyFkbFbx?gj
zPEubF)z?7vUGfXJzVev*&JA>7eHB`t!5Guo&~bfTRNoYcL?_ope}4>6eV0*vm*aUI
z_qP(ck>_}z3+t=a`qH#8tFI0^uCJTwTWgZ~MyS5aslKCX-1_Fn)OT>83+t=b`qH&9
z{Vg#II<BvW>RSgQ(M8SQ7}a+L)%WD_ZhZ|g^*t2m!up!Ez6>o)e@i?79oN@K^{qci
zeG{n9&hbX7?}n4y`W7KK>KwlgI?f%S+)T<X3j9KjcI6O_4C5&D{D#PHBl7dtX(nFB
zu=}-z#PRtom!lK8mL<8i&p!-wVSQa%-zHvt??cDDBUIm}lhl_>^<7Ez9lgI>U$^E;
zZ8EIZLjqk`UytfG_v$+kI<9Y&>f2(H`U<JOtEj#$f9}@T7gOJcfiA3XKy_Pr^{o#b
z*EdG>Z9PeSrBq)N)%P{dT|S3~kUKq?y5vXe?`MH7tZzi?+t#b^W9YcPajI{-N$Q(J
z^<7Q%?G@Z-hu7)RnELVqU0C0k*0+OKUmkQ^-vrgS<0SP}Q+?M^eV3o_&fhq4BhT?b
z7uJ_p5S({Ad-c^p$MvQCEA@P9mr3fYqx!C;`i{rf=W&12ksDQCMW74o%hLLG^Xe;y
zj_b>y`gWhBzDBCAnd*D-1h>ANnEF-(y0E@{t#41SzHaEazAUP5uSx1#g!=3pzmDqr
zqROqW5V=w3_-D{@ZVu({L%FvEej!Jxa)?HT{+77W^UEW@eaX*1$2(}Ae@7g5m%1F~
z$h9oVwSC?i=)(Fcw7&hl`W8XQyaiO>&nBs_o9ers>YMsAx4ufvmD*%jt!un<yh?Qk
zc=e5Y=Xep-H*1pm`l!AZs_zZ&9IuI~ug^QjYgKoUS6{Dpj+an<2TxMp5Y=}B)px}{
z?)=pwH|iX}FwlklZP5A-_3AqhI__^7)pyt=^^H<}H&T7Q$GY`3#nksypbP73(fW??
z>U#n@uCIdXJ93ix#;LxWsJ_eV-1=IP8+A_B2fDDncCBx=S6>};Twf*Ccl0FnrM0K-
z!xm9}Wv9FKb;i`Uf1nHN>(=^?_3E1m9oJVy_5EU!`m(6Lo2kBz<J|gsV(MEO=)(H?
zwZ7xM`fh`c>#L#qPMD;=Jk)3B_$^f59`oG#29X<ej_(Q`=hjm0Jj#6sKgR&q)sSPQ
za)^e{tGA$Izk2ekB0v8eFQ$23OdLht{rD>6YGg9k&hcHm`|&ZY?^Lh89liVU2CA=m
zlKRT2zE-NQZ9jLO$2B*Yl~k>_1iEnkCRBI2SKp1$@%%MWeKnKRH<#+WmFk;c;?|dT
zNpK(L*LO;w3+u~J-LJj+=0V5xwNQQYC#i2f)pr}!H?7#MFAKRE>Gb!%`?~8dTkAX9
ztM41=xV~1ZuXd997Epb+Q+;LLKF^J*Z+~x}=V^WCdiBlp_IVrCS2sz0&8W}z`4Xyc
z`+9f&3XqFWhr{;AHqi0BbWrXEl-rNj$9bO@D~D)g=x>QW=-97|{4OLvf1kGz$5P^0
z7hmVk_wA)I9MhrW+-}O1pB*gq$?GceeId+Ip&X)-p}!?Mz1Q1&$nR3}^Es9i$DPE{
zc%sWu8N(qzkA^w=DEBhT%?<p*eOV1Z;S-Gv<B*@L!+rzgcLn+R9DT&mMjUJKdOP=H
zK60bhmHZq7&K;s$`PtA?pVYe~@C!NWl|wW#^tXikya@IiA-^W_^ErmWVXx=hMI6fx
zbU7N3Ygv+O`=dS3h4nRReb;*RwL!=AjZ%Hhlhh~QXKD4_P4%tkozKlN^-b~4=N7H+
zdau48@w|fT8>9MKCaG@?)prlo_qPMw`D=}-?=OKaoWCVn-%Vb9e}<0h8>jjfO;TSv
zzCYIHubt|<*?T>wJ*K{Ez1MR(w7$h&eOGy}=S)z2t&`N3P4(SN^}Q9m-X6Z5(-l)+
zf1nHJZ@JcYyH{TybUc4)_@NQ9zvO+jC6m;bkNWKTaUa#U{rPTxS0ERk4u|cJZJ^`a
z49dNea{Im4@B5TPG&1zJgnS(u`(=^eUF7HQ^Ah5?pE%akxEup99OKY&ZVu(PQ|{8h
zFYL##a)^dGZu9)|$nQS#^Eu`aM+b477QF5gu9uZD9H)4%`xH>_1C%>8@C!M{ltVPk
z@xSBUc_|{l-;<xuQ9~RL5JyRs+mG=Wj$-JzA0?E#jB-c3_X84_2G<qQFvqa>en1)d
zb&;RXu>c%)zC1`ArKK)MI&w8KnQQxFW}pk_IYaAv%&TuN=$N;H>RUcZea%$g@2S2A
z_IK;cimC6;Ko{1Rt@S<W)pt8|Twf*C*F8ynOQ^n1s_#7Sb)?*w`hM-bj+CeMJ?+(Z
zy7xL#71g(5lKMKSzK5v3Bk+8I?{f-b>MIR&;rtb9eb0LJl|aYyS3~vnOj6$ps&5(9
zcYUQ>UvW%*3j<wPUy0WDC$GNCpyT>#slMJx>gz{+Sy=IMoq3q*+aAvYc>c<ei%*Bc
z_Qy8Rac({3zC^kG!SyKQn4=t`k)gjO`n>B=1Nps7e*QimA&xHMm=Zi+2+!TQF&sa7
z?*}wdZa?MT@4dfJqa31Pj(a@67V>+I{Ctkp#PKL`oHy6)M{NwpInZ%GS}FH0l)GWz
z7xrU;a)^dG*7y9{$nQ<^^EuM)ORcNNh-2x=E=OYw$8FFtM+fD;MY;P2ej!JTa)^dG
zW_o^I<TpfqK1Vh<?E0~sIKC-$Ia-mck;z=!A72Ezu)ZZ)-`~9YK7)>VyQ#k6N$Sg|
z`W~nH=6df#w8zvpJJ5yob!dI>d-WXw9oN@G^^HtYUoqA91l5=4J^$#6sc#GK`Nwjt
z??bP?O}*zIeN^AdN$M-7`ktivhWBy%yCSB(Hv(Nae?3~?$6kG}LC5nqK=qAIQr}#v
zubb-IJa}Fao@;$E^=%O7!utBPzR$e+)`O1g8>0GFO;X={)MwX^KTv(!2hSJ6`Ua7U
zPlv<y$2Q*cg%QgAf^z%olKludMwCM|GW54ZA9TzyN`7CGpTEx=h~p{Z_?P#7#b^x2
z7vB32W0bp^a&PwD*I2C_qG663Jil@B`#1Ud9E*tKY2x?=o(J&td`%3;(cbfg3CjJ3
za{q(ZJK-1hBki}reY<Fw<6qEmKhnNVJ+J+a{CtiM;#ff(AIx((GLRd!uHJ)=b2BLS
zd&<2$@C!Mzl|wYlajEB*MSc_H=X0z8hh0DZNF3LD?|<YXS0j_Twm%kn?|<ZJeLs2i
zUFN<2kwf(*)(X7k^#s4ZeyZ;os_)<Xx$|5QQ{SpU7tUXy);A5AGK^^yI_^gv)t5F&
zeZy4WvsB;n-s@|{G4*wOudkJ8eQSI5Er*WlE1>$)C#i20>dOYF+&}kFePe$}exFEq
z{*@uOMK+)go0lr+IJXG7jnIhSdX)Q-`q}rV3^usy-uwo;leu9(Mxc|vi<b=34M4}a
z-N?0dI)ic#-%-~=@bJVa{A_K?KiQvW1-kJ2NmglYrkDFO=p?sP9*ogP^SmMD`s*}t
ze`=neqj^3Y|CtY;YpanvUo*wuc$+VAzyD(ZxpVPAnddCZouz&@&vUPgp6AyWxZihD
z1D(vXc*(HbSE1v1&chE<wRzr*azFXEu9x89iCXp3zlQVt59oOQir{Cj6K+m^cLaW6
zKkC&_G%~EdTRp!L^4pU9{C;FpKVG4Je7D^FzTO7p=0>dhS<vyklpz;SHIn_<nsUEX
zKkG-^Rnh&p{;_0kxb8cllX(#@8OD1pbe!8p{n(arecnRwTHjtJ-s@Mo=j3waZkkLC
zK1|g=FAQ{Hef?Tro>$*x&~bfT)Q=q|sjrm!(NFcwxy#)jgUB7%n&dZ|m+SDKxNvSa
za!c`f*&q3od#L(ZKl+-Y`|--1?*15rPWmBUGA#E+=s0(r`mrnJ`u&(oyuHMG7k>U2
zp9jOpT^&R^x$oiU)N*dxc<TGgcc<LN>Sw(DS4Z=12|wh9{T+f%c*RSG@owhjmLS*G
z)t;2=^VSjXi^TiDy>5R;klPYOI=Q<;$GjED&4ohxTSU2cs-N-Bzb2aZ*><<T_0S2g
zc*!u{r=jEATH@W8a(&)r;(dX5X9v0Ab+rMxi-Jfe_iy+QeK@y)c=xB=GW9dwjBBHL
zYv9NI&4x~R#Y=|qR(rW^#QSr~{plF@yw8Q-MS)fFqn#TIpc9T#{ahFPBv<-2i~PP(
zKYQGg7>;k|=sH!u4&@Lp8OHH7be!8w90yUZ-?w(^+gsGPBZB*quy0++ZIz9x!*ZW_
z(%qMR$Zdp1cn_i6QuVXGm0lO!x832#eXD>@=1;t2Sne)fZrL}feOXSqKJN<R{VVZi
z1@{LbZzXc8HIs9Hak0BjE0J4`f`#`;%3W9ejJNy7Xx`iKpD!|RFLc5yUYvUibkg61
zE|_lo&~`hAW>c=uJ4n34#5;f=upsTUpMTJg++6tw9X8Kd&~a`ba_zc*4CTJ4e#X1%
zrfA;kW$tx<96I3@FBz6w1s&(+e3#;_q+FkO6?ko4-X-3RSGw2z3FON202{Us*IAj=
zh1Z2F99B}_30{3`LC5tKpgz&bI+#02eQT&6?@@j01lQlNA34Zf13w!!F9$7k*Fh0-
zOCgfnlPLEm=%k(2kF1-c`*8*S<2YV_xzGuRc*(Hb-$KW{_0*43DA(^tW=HCIz!34i
zeVd-AI`R3)jk?d7xYa#hnvh$Lx`g+al>55+8E?)l(Y!msk9qT<6JGI>VZ7UWxdX&o
zL%BY0KJmUyyx-j&^uzXBA#%~;a9D05bUe=^$jyaHcz;c~U#g$+_Qvq8ALzpMJfOVd
zCBt&p@p31K_bkfwc}u}-uP6S6c<(E7&zGT?`tF8~c{A3e_W3!KyLaFha;#Ji(J;pz
zo?j09Y+s&Bem+MfalAnsM;z*Mtcu|{6guX}BaZVa_kH{zTV8+T${`x&_#1TWS4153
z<mYqDCyoz^<Bfw|j)@qK*P!Fv65_a+a!(EX!hWPL4)&2~nByeRuYx!(AwQp^fjCwY
z$3?;Xh38}@a`EYK*m^$So4-opXrSD+y?*2<hiGJ&-!#v!hBz)KKc8a}IOIAb`}b4g
z*#2?%{L4dbo?V0}cgb@1{HsOo67^e1xtpt>od@N&M*sik8^Vv*-(2Wqe~6b1<6Ym&
zO~Ze%V%OCs$~_D<!!P`vk81eI`E0}d4u($FRjGa=3x4_dv&_pi<hNenS9hiAI<-F0
z$S}XPJ--t8**<S3KffQH)Q^p+AI|_H$pK#(%aL0Z{4x2_a!-Yb_eU9W3!xB>>nRu0
zm-MrKWZV|LPSXQjxR0`-6Atl`VYz8uZawwmM#}Yhdx`fm;+3CE1j}$A<sx@9nHYSq
z+>N1Q-X`SEg+zF7rrg)m&v?^rkLEodKMxbRA#Wyh!Yf`fEcaOGICq42TPfG)9VXsY
z#CyRlE^jt+>$KOL`_Rp9?ig}QArRi%DfdkEGv4MqqIo}F<np#cC%ob%!+1Z0j(H2d
zPwls*l<V`ZCf+gPUGGWvyl+G9YH7F*%RT-H@4QEDH8jF|7v)Y-KjUq=Gn)4S{2(*#
z?-J;QSG;6c?!C}4ZyWKpQ?AdO{y^$H{gQYOe#Gr>J94ul`n#gbo#!s(cA_rfy`OUT
zQ$OQfaaZ(tx+naYw;wv;6)zdayPKC=`9rF|4^pnrn@hZ35$|mLKcLc1yPq6H?r1VG
z_+YsgFL8NmkZb$*A<8XNKjZDbJG#Fex4XQ(&<U@2$*|mZ=(xW<#M?!=K5sGc{)>1s
zf_)V7_9OSSi2m++lbbt$+)~sf{e6sbr>dXv7Tg=nJNrhLw-`F%6)zdadjxdMn}Ppi
z%&wPDP_EBAhj{-@yel7Z_irh3N2TF9EO%GvI5!8mb<ha!A1L=7^)ueQ`=fa;?Q-{T
zA#}nkUNS8ABIr1`g?Lv`uFpFky!L$IpTxU#wR`<7My}j9*|1hGQk`+kiQ(8P(1q8T
zD&=_A<JcTJ=4d01=O*E307oW@lX?EfdcnNN+}!km%Ta?|NWx(pR|mSVz6DxeuUFqf
z=(xTv)F=Ir+!rRPuZ8A$HO+JXS8jcc$juF_3twJJJg+*N=XU5|6AoJkM+Ul(qf0sZ
zJdVSlV~%c`=T|1-Xs3Dp4{<E6aQ8<ya;JyYr8uq&bYXoxTHl|&`mTnK>+7R=er=Na
zmeV|sQ++?{cI)f&=Fir_zR+>*0OkILa-RyWzaht<a)?HT_2UWX*l&pZ-XuSNU-r>F
ze?uG};OET9v18YnVdPrvl52k+3Upz8BU;~EUVVemaeX6H-(M%GZ;0yqmg<}4t%FhI
zMy-SY9_gNIV_M%kUVYy{$Mua;eSe#zzEN5S-%)*;!TX%y{EZ_QpALu3UxxQS=NRR_
zN4eMIhuxwd;XEfgg7aB4GHe}O3mtQelivvW`RiZ}&GQ=KxYb(+>BzO(CD;CZy|)fB
zw7w7h`n+{8LG`Viq`veArzG-_C+DC2Ty|l;3ir3XPP33J|8B$Ty8=3%m$V;K=jq3k
zTNwC-^PCMoId?@P!@LVTzYOyGg#4EO$*nIJescY=VfA%E$Mt2w&#p6{k>AOIUszwE
z)+ZVnR^N%9Umn%>Ir;hPpn&H2rfGqnc*^rSp66oZT9)J*M*=$LD4^Ui%6%NqJ9#~q
zz)$8`G&0Ql5$M>ji2S}Hzrr53zB2el&2s^C>{mkbyqf&}{;XSHrPe1JuJ2vw*sp@>
z`#1Ud^E`*<xs~SmU2mSNkZW@xxi-&ld-GgLx!+Lk)q!8QUaFNtG&0P4q32gce&3Pb
zNzb|SJRg2h^LzqyJTEmg&;KRAwFAGfz6DyJXt=&<o?kuH_XGL)^IT8!d<V_*V|X!*
z*K;FsZ7w9&=J{dhn4^Jm|3|qe1%4q%lX8eghIyah`8AQBT);#p`{3H=-TGSK7d6jU
zLC5vA&^%8izr6#$u)a2}Pc$;DzCAp@HmWa;{QP-dLi2n#&GR#@E=LD)ElYB3o}Yq_
zIXWnJZOZ*s;1_aqDu-xfnD;L|zb^7yhy338qg&r{_(je0ThMWR-89eZk>A3=FRZUu
z>k|#vcbVtcNA;~we*Qf7&^+Hy^Sl_ZTk?ADN3P9<<k~#n1RZk>P;MsW9uWA290STB
z8X4xjzvnkZejAbB^x!-V?}vuq7d6jQz4LU0<~fV}9)Bju8`d|f^@)b-djvY>9i#d-
zCBKg^(fi%t;fXQ$$+>L9c<+Ty{7Ur`<M1oQ<jQ?XHu=4)em3uoo$mdg`JEo<!q>f9
zpp*SCUNTH~s+XIWn3kMB$=#B2{q?dE>m?gLqFa0Yz)w8CX>jlFTalYDfjX@2YoO!#
zE27-3DfbKYv*(RH@Z<Yk<JdCLg?;OXE*+WTCBt-^dAVhjyDjDVylaRzop>)CcX<bq
zn-fGPKN{~3|8aRMDL0RD&sIO<9gE?;8h(7AvqpKvONQ|-^m1z`cPGmAc{6{X>hC(l
zTYseczH{Osyw4OwI=R`<aewQPYwKkf$~{Z{j5iN{QT^>b!u`5}Lg=Kw;w8g)d!Xao
z7UJEFa(&)>;$4?`tBPFSV&q2gCZOZoHsUR$++)?xc&p$S#oM{J%R3)B;T10##@hiM
z=XMkC-jwU}mJ;uJ#CuVN%Ug%sDBc|CIJb{@XHssh`WbI4{GxbY3D!Zlf7_uGUh$G)
zyf1p|YJ_<Aqg<bNF7aj%?<xDZyqz(;Y0xq681a@+Zl(Ge??4Riqro}|d54u(yqI^H
zx31Erq|WDAl<V`>5%2oMyAj@C<?H#%7~Y2ub$PRpYy0;g%1u{4<4s!@-QRNf@p+XA
zo%C0{n77Q!Eg;@QDA(t0Cf*H*cW9Q&n~mJ4^?VL=+}{%7EvMYq)X#WJVtCgLbYXwX
zl~=r&ce<BbNxVl=uFu;}yqUyXa*)eACx&<EK$o|McxO}YUg~GO^)bA4@Z<hADzA7k
zZ>^WxK)lCLuFt!IcsC^8&N7#`Ifl0sI__@^@m5mq-Rft&T`{~P_yPpxU7@_<#k|AN
zac&3ko<O-i?;!DRM7-nsyS%+Iyw^j=x!uG&k8=O1e#Sc*!@Fak3)k~%<rOdH-OkG$
zAl{QH*XLbDyc-km89#S<*TnGtSmN@I5N|c*R;i!y<~$sIUM+zi_ctFpIj_Wvd0V~Q
zapFCla(&)JXX^eci+F1ecX<nu8+Bf-4ITG4ZEEU#K7(@Ssh{yy#_&E`?($YEuXr)<
zGUzxr2f6ZmOP&XuNx436Ht}vkycK)7yz^st|Fx%^TR^<ElzWi+8E;Dr?``no{w`5o
z@nYUvyxcP4J(qHQ-a_Ktlz313waeQc!~4z|E^j6Ao=>@R)z5hQVt8l6k9h}`SG<__
z2rsvmcrT<}pSPTNHzVG&=DEDXF}xp~=<+rY?*huLRzKsNh~YgRe$1QR73^Q}V%}rD
z+*acKE#>;W)x?`kyq{LPyqU<2+Q0Ll<9*aYyq8n%i250C5&WX=pWiyw<t<fS@nYUL
zpyS*g;$29&KJNnJ-JE#8`i09|9>aSYbeuatyiJrls(!{>8^inFu`cfd<rOdHeFr+u
z9VOmtDc9#+M7&!N?<eQGyp1uu3!&rOapL_Q<-V_e#@i9YyKSHgufNNcSG<^aD=#-=
zTIzhhfpUG`PU78?cn|)K%ex|m_rr5s-W=rG^Myr}yPx_Q???>q74YNzyGnV*i+O+R
z<rWd|V#@V-dx<xPcw6yBe8>%7Ph1_tTL>NZw~Tmiquk%ApYdir61{&1&vkiop_BU!
z@seTBe+QuB+$!R|gK~Y|VdCA2c>jI2%bSnfsPpPZ=s35Qc-ts<mHHWPMGWumfi7In
zbCp-Tn0FU1w~2V~p<JJLHSumuys!Pr<*kn4ErE`CTZ#8R%I#G@<86xJeWJ$g?;_<D
zFXnv|I?nAP-Ulex=S_bobw9Zc@xC?J<y{iPTLvBH_7HC;<@T$e@%F^<K68T0+poOh
z#k@~J$GJnq`!MDDyt%}iOT4p#>tMKl2V;19PjPcciT6>;EmJ?^9gpFi2|qrs5|0M^
zSG<^aFE4k3cps-+pSPHJw<X@=k9GT-j@+pI+kcG9n~|0}pSvlyLj8=l0Dc((g2QnD
z{Ft{`dBsbHomcyNxp~O7=L=6$uFpG%c()_o@8`R`r7^tcK*#H<h<Kl&+|}x5yfrbr
zqrrW4cwW^huXr)<O6WMZf_R^!T%UJ7@orDNQ>$Fw1u?uAp5*3M5pOT$u7OUjZ^qje
z!#ft-XNSC<$}3*Xy9zqyttZ}>DA(t0B;Fl}_wv(R-sLg8U;on0Z6e-RD7RkyjCUx8
zcRu`hJ+D+=@nYT@FSm_&|4g|)?-JtOiFmI$&gESd!~5S#m$!>}2Pn5e{fsx`vFQC<
z2S4V`hEDD`#EW@rz1%+HeUoy1-sQxbPrT;@@8g8$b1rhD&Z|uCeVifUeT#BWS3lz|
zi{X7bcpW5M&vTSlyqNb%?{$?i;(eQPecpcJ-I;ig!}~L`-=^yufpcSc*X-r?cY=6_
zDfdYAGv0<6-h1H3{cToW@nYUPz1*y|Qs?vgl)DeUQ7Oq0JUp=oeogk~CjQON`=?KF
z-^b2_AHFm``TEe`$!}NnGmESzqSxuq;g{sl++65nor;$X%iYh*?Vg_ESV_63U8P^o
z5Ij7Q55E%qGyCO2C+AwJey$IGx%jiZ&h-)b%~e0+sEOhD=t}*%0`;p?4)Ky<93Mc(
zxueAK3FZ3hZzZk28d`tX{MB853y>?%%WPQP>q5up_&9Q9o`rW6<u<6Ft-nPvytlmN
zuD>?r6)zdadn0t5J3+i(P_ECrhIr2)-hrcC-VWsE1(8nfeCRkgW9`)a&{vfEqWT$c
ze++MWpbO8JA>|b>8OEFD<>n#R?uWjnT%R{{S?d0NKJj)JySyVYymO#q-Xh{1r`%=g
zXS|6gqxa?Neck?MKqu=(ykr>f7<8OlLA>8luFsoKyk`;br*mB1EaXP@w+TAVts>s<
zDR)HujJG(3cgH{%_P0!V#fy2j^K$En_eaY0c}t16mU!RT&*iO%;jM*^d7Fqgv3Af8
z=}({f8E;(-?~Fhf@-`^1crov~UTz!lPNQ6(cP{asL%fIM{e|RpMh~W@7~b~|b9uXn
zcRJ<HQa|JEjNv^Oe#z^M=5{NucrowUUTz=pu0y##ZyoWTOT6ph{ZQuZiQ#Q4b$N$~
zH-mDgsGsq!jN#oAe#|?jyyC^YyLq`|#Jd6I`n=7=`y1kYz1IDDsqq-zy`kgvJVCh|
zQSJ-sXS~_n(dX4YXS-i7l?R>d2k~OwJE7y;jP%s`yb0y{yzRtWN4ysW?-Pgje+9^m
zI<KaC?-S=B*Iqx(rrcWfGu}Bdyh{&q`&*^F;>EnTLC3sB#JeTs`n)TM_dMeL=n!{3
z*TnFi4;|;05%1QNJFI@j+Z@9?J<x^cRjcxf7xPZ_a;u1UTgvr$2Z{H5;@vZNpE&Gq
zTMTdS&s^SG;?1Mnoz%~Gdt-Qi0YBcq1IjC2%zLz#+eExOQLfLsig+&|-un-5`#TiF
zyBBoa-&W$?g>vsuKjU2!!~1gZzJ1u=v_Ay<SG<__1?V`pi+FdVT%R}baO(c*LgH;X
z%H_>KZq)wW2|CX0A>KmDy;A**w-A0&udlrleBE5gTcW(;#k?<iUxznDyn9ow&znuW
z7ZY#&OqaJThIa$#n0J(TXHxE2>Sw(3V|X78zHTn$tyf<0V%}xYaqa~1?nk*kZz1ts
zLcAN+ySxoCyboUB=4PyuI-g4@cWw1E-u4*YS@7fi+oinX#k@cBa`TXD&lhG<uFqRe
zybFl;+6&z4Z#QyFgGeX$Kj*vG!6M2%h;lDeKjR&b;XNIG%$s;B*uUZ>!=5jk>gASE
z?je-x^Hvk@Z;AKZbKU-?BR6XQra{N+s*?I!PPxBQKjSTcU)27+D|nwXT+hYID_+cd
z2XvfUOT0%?uFt!GcrPX1UF+QbmLj(_h;(vqKiBPV1Le-9+-=p*cpGDQ*M=YWw?%oy
zONRA#nwQ%`xyMkh&%20tFC*UG^W6TnA~&kP$3e&Q+(!Maq}->}&v;kF@P1Y2?%zJ;
z6))!fCv=?KO}r;iuFu;^ybZ+r?s;y12asDDL^`>LK*za#lsk`d-&8;2&3HO`J^vwC
z2jP0ohEDFE#Y=|u_i^YrcZhONrd*%5mw2xr-mUTeKGs!uf0c{esQx}#>(28i^|zXG
zv((Rc%VKyd;K%EEj`E6^4C5{LawmxQbjtO4hl%%c;=SxQZhz+@w=|g;e6ZZl&vEBD
zW8Kts;S9>XK>dt&Neu6a@MGQ%<rOa(mV2C+n?t#0Qm)Utns^ry@BL@F{p~_-RDWkc
z$Lp#9x%T|1mU8b<KjR&Y;l1okx4$FGD_+cd33QxWM!e@zuFso}pU-3UH4^XAlimJ~
zBDXk*baKC}a{F6JyysKyBK0%goE6dgw+w#V-+bs~|B9Ck>u;%-TT8qbQm)UNOT1SR
z@53j%{VhapRDU;xj_0|7co$Iaz3OMYl`*_m2k)DP=T)`xiWl=PgpPAtiTAgZ>+=>9
z@0G;+>;kvH^O0K|L^`?aK*zZq#CtjAKCXVo+aAMv(#39nyOdYFWLSSsfR1x}h<737
z`n+?9_iEzZDfqgU@O<t@Zd8A7Io+M-0pe|<+^y8lc!y(nr@)Wb^QiKQ7xVsjnwvXH
zyw_5$&pRKySum3KKbna5-jm$^jv+TYh;(xAf{y2ToN|9hx#RQPzNO*&cV%CSMuzom
zHFWHkwqEM}nHKW%IU1;M*AmAb!Pn=6eak>@RNs~!@6KNaa)nps<tEDALH(?6h472I
zFJ1?J+_w_t6)zdayOx)mhg^H!a|`AAysgx?Yl!#Bi`>4IAvdaTk3q-tTtvCIQtp(%
zFFaqWltVPk@#BTAUm5l7cJlK%I;n5X#PP^%_dKmZZdBjOp<|8;>f2Jvy<h#TZ_V(F
z>f2|*>lPtztMZB$^L`8+=ho2t-9@=RZ!hs)N4&QN?=yw#v@M3W(0iY$o_O0S_j>g+
z-rgAAH-pzLLf!%86))y}9XjT1A>R8b_q;vz=QjlpPYl7YQUA<-yFw>^rTV!x_~qiy
zvfmyczhA50RMl1D`_ZHN_IaWHd>_?SLnr5pc*(H+_6c;H+d~|klzRz&o)7kKLf`gE
z%!gl(6+wRA;^#=R-vIo2@j&5NMt<k2pIPML=W#@FTnxYDxgkYk6hbE);w8g4F7R?&
z)=!-qk5KMQi(QUl__YX_4)ePNI_7ADU$$~QMt*-(KjY}b&%21?*gMeGU8y;P&<Tfl
z$*|l#yxi^?DUK&7*WX9Ow2vO5ee{b>b^U39!^kZPBAwiSZQ}l%r#|H7LLq(o1LYpB
zezuP?@N<EpcyEGVvTvH34W00cmki^*-pd^&-W8PV^R6b|WyE_luD8-o`?{N4<VNv+
zf#++|--OmTPQ1@j?jh=Dyp=J$*Tau_tCd&0WEk(YUT)R~ss27sxjt_?evYVJe;+2^
zb2f8%=g07_2Oaa~AvYIwNq=9U+|$+1c-vxl9|_h$cusaIuXxEY-iM&$+%n?rqg<ai
zmw3B~_e`88++X>5SW*358#>OdB;Hpk_f+*W-q9G|hk|tw@~&21@nYTwpyS+n;(d*B
zecoc?eS~;dZRGN<iQ&BjI?in(-oH@p2kK|M1-;SxcSfKKd5fWw{VQHFtiS7exgEqi
zNVz`m9O8YHc+bdmc}shv`}-|&n75mF|4O-4>Sw(5@QXUHeuu~N{%wR#c*RSG@m}NQ
z4&m>1fBFvP`n>ar_c7w_+|cE1?v3UxhK_khiT7Q~y<7c^w+DVvyaU0!g#GP@PI$#j
zhVk}8$GK_vyYY@tuFu;@yvvFAo(z|Fus51_cj!1b3%R+dOU|ngDfd?OGv2fpqIq8k
z_Ib#g37znYmki^5&O0}Xi1#DP^?8>N@8iTfiu(qvtMGc1johg7>H_GPw~Tl{q1^Y>
z&v+|hc&7)tkaw=~ikA%Io$BS*5br9=^?8>Q?-RtkL$HrR-s%|Mr*OSx-g@Hwf^xT1
zKjUqU;XM+5Q|RYewkxlAG4EksZY%MAMY%q2Kk+_Eyw?`G{q2n5-4Z(H?I7N-Dfcq<
zGv1LH-Y55Pc~>c~crou|&~a`ba&7;PQ?Adul6bp`cgx*f-qkU@kL~8>4iWEnl)It&
z8E@W;(fju>_)Vey7D6ZcSG<__U@v!^c)zDypLY%M{(*Rp3FbLm&&9}%+P|NGgXcL7
z=Ws3xlk@6F$~{c|jJGz1_p)GK!u`8IdBsbH?cYnh+&tu3e`SJ1C-da<W<Hv_pL~jV
zKPhng+Ze-p33SX`M7+}|_kHy<-tHLQ4Fg@s+pE0dCBt~v_i`(VcRJ<zy!piYH1Y13
z@ACG?@GjcP<*gy!btpGS{fu`ahWCFvy6ZXprJzsZ#k}7`$Mf7oycv}1^Oh3t3gS&{
z?eb<KH)=hfwUwLOO1v9T?zhlkUxwdTR0hAO`;Flomv@fxiWl<^LC3t^#JdsY`n+?A
z_m9N8@%Aq7+!)@=wsUj)h<6jpT}S<_zb!GmUu^60E>T|bV&2c7W8P8X&8A$Rw~lz9
zA>J>uUEcN>-V>nX+;QUFl5#&*KjR&W;e9!H-WcxRmC7q#%=?1(JTwc>AMCu^nsR;K
zX5xL8csI^+c~`~oKDx2Xn}^(76ej2Mwv@Y$`WbIdU-WuD3VwV&%7;!+#Y={rSBHDK
zWyG6Dxjt_@@%9k!2Kc%s*>CpxMj>*e_U|%$-7NRFl6ZHb+_lutcxz&K4~HM~)+w)e
z$uQnSyxe-?-Gy>}-WA0A9Pz%hv&*|6hW8-on74^|cca_^^)ueC7~Us>b39znE0kBf
znD<fWIJbj%3n|y<9VFi8iFf%nE^luPZw_>v+fBTCQ|^Q6XT0Mvye+|XA>>WG9IR*Y
zV%}!xICqG6XHu@uyNY=KM7%HMxxDGfjatupK*zbG#JeBm{!#smw*-Ds*Q0xab3EiN
zS6=aA-aDb=+%)WGJFiM8*XK<<mb$;{CEmNXaCzs%@U8<L=Vl={7lp}rHH&f=tDo^U
z#qeITc``TTU8KC?B_l2PEpZ`qoLfY^2T`uin@zkg5brg+y1Ywbc)#Ao%`GF|LnyaF
z{fu`YhPN7id|nMJuXxEY-YPG*hIq><*XJ!H-WQ3tI=JqK=kv-K-q&+o-g@Fal5&q%
zKjY1MC3-#Y4?pJ3g-%e#ONQ~z^m1E?cQ)nvyye9E67gOT+{cEz`N)mhzaQ-2@^%pK
zF_e3z`WbIk4DV6!W8V47D_+cdxR={Uyp@#e^HvjYAMqX)+{cEzbuqjvwsd)ii1!4_
zJy`vWw<CskC-^b%a^)2-=H1@Q9Vgy-l<V^@Al{dWw<vfYC*)lb!}})goA}&F!{2jJ
zn4DK9Q|>P6XS`!EyuS(V!@~1wjq-|@3|r4<dAWJ`yPeO~l<V^@BHmYsw-E2oV4g$X
z#H-Qk`E}ekF>ev^o=&+ts-N)|!7u81bXIU57V?%tC#d2j!+6i|ax01V49?x%eV?-&
ze#3#4<M-Fy-1j+a;5P>f>Dzqr%Td3n>XF+Y&CvwE<T_Pd0d%lQddWW-N28b9O&n)a
z?s0`KM-lwm)SLaLKqvhu)z9_8FCTvvj&sQGNcA(0LHI@W<MBOQjuGf!lk}1Z<9Gx*
z&K)C;I?BEH8~6LqN8z`Z80oNj&QYEHJ^Rnm^?g6?eqVVWbW-2>@&Uu@`xZK`Z-VNp
zr}}QX$*r#deszJB<98Hv?3aQ4oC}4_^F`!$wfY%H8~mc?d4oU~zAxShogj#p4C7eO
z%Pl~z?ej}0*Wc%zw9j9seLncD@@j$0ky{)@I=OS96JC3txP*8cDEAfhvwglQhIcgR
zZ@ACLl~=rE81G8xIJb&;ub|wW@qLuZ^D20FVgi0LFE(uccYsd(O7#=9<hPLgK6}Dl
zR~fGb{Sb`|tM6mz*slS8B9V1)75Vx7=%s%Anfh_U@w(5o;4I|kCliAY#_{oS!G5!T
zG*Rv~lzWu=SwBkP7q$K_fM4>w(tvX16)zdad#;z;Li2YW<sKZIf8p23%z<Cj{|hk7
zJOA2<<9hO2Q{bLMwOXHOxV~}dxE~$lcLVwP{TN0+vS1{Adz1R{@`vvJsMp*eHQWw~
z7od||>qi&mE~4Cv1HW+HH>jUzWY|1k;Q4iv-!0^K_m%FtZ-QT5VCDENg^uT?2Y&W-
z6s_bpC-6(1Lt39`WLSL_p5GAFcN_UV{A;(q<?zc7tQ^1JL&x=vz|YRLCFFNX;1||6
zto4aThSfLE^Bbf3mXcrHe7C-p@QeC+D7!(&^^L<X7kRQ?+Q{z=^_wciVC1|Wz2Cm_
zIP#%`P0~vqXB_|ZII{3{BsMSiQ0^@J99Ta83gNe%80oNjra{LXdGM25;kcLl_EA53
zTqXRX&W+cXC3C}mR6{3z;w8g4UWJZx3y7nGa<3@T`_ACuiTUu`RR1i$Sv?m9x-hp<
zb073_&x4M0ONjUPl>5;lcmA5;R}hgqtU9Zs8@i}@X%BQ^eZ5-WLtcGt&~bfbG%pWR
zeY3oI>4#rMM1A|H&g#n=h_3Iyd+YNk^~i-zN_)hs?;Gg2zDla^F{<y0@ASH*e);fQ
zK=s)=sE3aIYT#E2ovgpd$*)uWjH5k<WB))G&U2S?h?fk@o$2Lv5JxxV)~;~ZUpM>;
z0;}XltLK}i-FfLIzo*FWH1)H`t&HKg5`M|+uV#%Yhj_^_j?2B=KFa+g<&NIq_G27=
zjY+5AgZZ^X$Nd<hemqNl@2Q`0)c+-VT~!CVupf=k34(aZu-qyyHw*8FWa9I(4xXpn
z6Yz8K`CMy;-~LIb;Dgok9{ztK=Ex(zUh+Fi{p@jlF&w{yANONWImAnbah&Ys7E$g?
zl>1z(%P}0oaS3$HQAU0*li!o-XB=5?ME7IAKo|BS7dk-@FB!(MkC$6Xx&4$o^9uKz
z%!l8Mz$*FC>e&lA=BR<6L`r{OBfoDicdsACTAyfSSbhJ7j{R!MZ-D%&@jR5*ODX&g
z2&|GHt-iIOW50UheS`dtS3i4PBm6SR&+2<LcwHcz=N9D<FBzs=1|8=%QSSdy?(@O<
z9Ns^-!mmB)6nrqhOT6>B6@Jx_$UOg*{JPc8IEvnk<|qzyAx9~6f*@WpEVszZ9Vd==
zDA&Kw9>aaM-FJSle&8pb)8BT#ucI8f<;le0gXLZ}<bJ<F8s3*JghY7XrQ8YVWF6S^
zo<%XdYl5HW7T%AyDX)0Ru-tLzq;GZuQiNPPuSO`h@I?3e(E-1Fd7KWL|BvUo*N-yz
zNu+RmKz=)_pFM6MhGQxG_`Dic4)Ky<9JhJ7705M?e^Bm;`?>pkCH&?GR*v7M(D8b%
zf}i!{WAZy%{fwi0Fnay{4KF@0M<sNEAYL+z<FC+hZVPdIO1bOIbNf*RKUse^tezgs
zGyAoX-zxI^$?Hdb495k5F5E|r${}7djN@D{w~KPWpxi0Cf2RizPc*|1QxFdG>)p%c
z=z*W`%DVcJ{Jw)Oxj)pQH-_V?Ko@chD2I5-u-q%W+#%vvO}YMgkhVN^9(+pY!Hfso
z^I!<MH9=(ZqxJ2E4tHOUB3DWi-v3Z;n)=y!Q2c+<>n{_2$@QlJWzdPAc*!u{3@>+#
zc)z9G$DVNaQ3d=m1FPgm<9HZ4UVjthw}$-A3H-u-RB3&pkzw_n>G@@Bo|>2M$!}_-
zTVD<QY>kPZ)wd?N?uWUxnmgg;j(gYrEXw_na__?8mGx&?_3+D+Kpn<$2Xs6yIpp^f
z`JEW}h4n4b`a~nc{EqYd^2l!rf<z||xn@82KB66d^<t#M{C)-<*H-|)a%g1zO(VYs
z^|SfRdMkSUjTgK3ow?9SJ>n(9a#usgx%J4EbtSpeDc9d`Ikex#XuoZDzq{Y^k(-}P
z3_e)hOYU>`TNBOSI+UBOezxD{#PDteKi+Ru$}3(njCY2Y+d{k<l>5LLZr^I)R~J}0
ze%nGP5vBUMHu%Y(W&UQ6-<|4b{6jGu_x{T5+e+mSFB!&h7j&FELL3`XZVlet;r+1+
zetChF<Cg;+`;Eab8w%mrnEd9cpK)aTHG2IG-<iw}_fa-<vi`(NhH(r*$GK_v`U_is
zn^NxQc;BBna^V+s{(S-+`(=?|Hu>Ef_=WWqYJH;N`tI`l^57>NGA~<@-;oo#?t_OX
zis83N|IB`0{t&GDQvF;3{N&H#mqUIBs-MksKm4MeFD!;%a^0)nkaCEZ44dbhyxdxv
zmu)Eb&NVK_2>g}=R*v6+&`Ct8ey)Kywk5xt)z3KUhoU*Y_|D~MgihvJykr>1XV7tO
z4{_vCZqZD4|2D%f>fHT&A9o)Oz^@#6(vKa<Zx{75j)@qK`{2j@NPj!v5HA_VakrP7
zg|9QPb-y#^?tYrfkqN)Lz{>Gk_Dh!|4}PUk2*<AEm#2Ql(Fnh&b+rrpn4?8G#7l;8
z?C9mz5XbJ6yUSvC|F*&}FR*g_KDx!-zxD95bEuH~a@Ef`R>W}J{r@<7ANabaEbKqk
zFhxp@Fhvjq855*j1VIo4K@kK|sR^p0$^<onB1{pKNhyLNB}RrKr3i|kLy!^_L6Mq{
ziBSYa@ILGAy-uFJ-gENvd-vzloBnz7eb%$r-us+;bCZI{IXZm~Vad=Ow;10>%CRH)
zZh)UN1738$(FI=IIkX;hVo`!$GMb6E6Y&;58rIkA>l2L(t?yOnnAZlLo<qA3@1`Ha
z{o4m#+&Q!>bj)i9uLORwUUntkHJ+#QT=#bTdim%FvwxwJ`h+DzbG#27`wq~&6qE1#
z@4_52z{8~{8p=B!I_72K{XZp8Nsc{<cfaRpj=Xo`bFAugL)Qi9B!{qMsP72lTMA#@
zzk8GKHS@#uQUqSydbtuh&QU?UeTjFN<3;tA`T9h|^&M<@HQ?!b*^hX&D2CVbc<^!@
zD&S3mj_a!>-T}nRcf6>+T3?@NWa#|m8D1Un4kX@V=5@k4@Z!#^N6hnudg2{Syjt`8
zW4f<TG+f^#!)qYkA;dd5FFc=TfS2!30dFJd#G=IiTO;ufBi`|zr|WcHLf*Hw2+!vZ
zpF>zObe<PO$G%PQ#nh+w#}VYa{Xn?iIumj%{U+RREtI2zcw2g&=IBqzF$+9CpI7=E
z!jhpmt~b7Il;arkJ?iT)hrCHEt{<yHCl)1Qg3&=ajwRl~o~JqT!HZjekAD^BNI@t2
zO;|EC$9(A6x07;Ik#Ezc;l3;eFE>qc4_eQ`&@oTG-$(m9fp}MWo_=0cLXOp(F5177
zd=6pB&>X86-#+r4NWKql80MG?-p&q{e$;wSf{t?x5bw{#o9lV{d94XKHgLKqN4w7<
zEE$?(J>#2+@4wRdJB56=-z3b@0bXvJ<Q}x1&o&NoWD{=^@wW6l{k-0U9Cw1p`(wG!
zAuJi1<2K`)N4}?%@3OIBjuqg=^<y@4Vo@R{7%AeNLA>`pPjlqI8^1pebGoP>Dd=Q>
z2up_MIN11>lJ8XVz2cYf+${!A8N$<g>YXm~E%Cl*8{cWr$zPSoCu3B=SL&1dh`*5U
zMt=zBuM9j{FFMqB9jA+YE4}YI#&<My>{~^?=aO&1!Z2?&cx$LBKC18LP8a#sdf#cr
zcN6H?w}yPrC*N&e4Snmt<NE{k&GkC{^GxXC&dImB!s}MEukQj=-(u*vzFJxb7gBwd
z#bJFd;N{W0=$fd2j(PROyO?<EJ6<$@i+p{ek)gcb8(t&L-zCI5)4dK7JzwYsFYbCY
z&b$uN1Rl0Rdi`BSypugo=XoV~ar6BBE#bM5`JUTv!jhpmzJX5uszm-0qmAa}3i3Un
zGhFvs;Ki-`W1(YS2k~YQZ&SyM<~hgLCmI=A-$sVlMe}?W@#g*<u7f=AHg~A>qs~_q
zbX;E#)z?V8TRl%duME7ndH#dbML8;b4q?gA9P1k2KJvYed|&Meb5w!1n?t1^wVvtF
zagG7vT~EB{Jx@Pxc0!I_oG!}I;&TW~hUVDO_-5k!*YtYXM7|}1VU9NNHg~A>qt^5N
zPhpO1;@wERojp%KuR9^f!{G7tve)MjmJH4Dfbq>E-<!#I<eOoRKJa#PsPv=O^XMC4
zjui23CEgFvp}y$6&V4_AU7g`{Q9lZxlk1VNWN41ljBhFV-cG&~ehqV^z*C0sG)INg
zMZQJecaHHL51sr~iF`6f1$^~-c_;a<@p|Z60v;}@(NNzEr;B_myzkw{cks2)w~BmQ
z$oKqLLf<Ozc>k*JnNAn^PV&C@7~j*OlfNqQmDiB(z2y5O>XZKJ*Q2I_hg-d9sP98w
zr+=Pl>eJqw;&f4c&Az_-OnoPrd8ws!a6i>|)NWyYE#OU$svBApS<rFbdho_WC-+1D
zB;LWEr#bR^!+F*mFS)N<ML7zgll3Aj8LE5Ud>yQda?B&&O(%spiomOPsDO9dsbP*@
z@XDZ&91jz3J<rn|?Fl(H1&_~{g+7O{WN40!jBg&kZ&=UC`Q&@Xi{W*35qNRe)zhF8
zixM%xND=Qb;%)7C(L68l^@&D?*0+V>m4c`H_i^IwWbU(<f)}@c$C>-*a^gKnygqZi
z9PssthU;5uu9p?Wdy06Ez7?*6LGbb&D*dSaoCuv*l=y$EBHlB^Yx6w)yu1(M*Yg;s
zi{`lyI+;IV$<TSuGQKtN)phV3`F5M@Wf6FB^V|g;=cuC`oy5D?@uK?5eSM<g`YtfM
zdg8rEynb^XtN<@=o^OJV>uVt1BI14Gc{<Pa;PLsa^S8g#MLA~p9Kzxp`xxIwn&(%@
zcjPYNdYK7c+}DMkz}I^?M>BY3FqCuSRpR|%zAlvcVSJ8roG!{S20B?U!jhqR&oaJ!
zl%tz`TmKy97z^H1hYEOGLB}};z$<}5a=byj+dWVFF(V;ItNZ#<l%vV#5S9$h(E=U&
zrtp2zy6)d1-`gGw&%b8y;?BRDp<`Yt@!lccF^(72*XHXJ4cB+1;Z=Yq{g8Qimw3Ca
z6V}%b-X{)~e$@H;AByJss=yoXdG8ai(DU^3W`7jFUhV;puQM&sNqxeSq4Ru~@ol4d
z`H+0~+cI1)ZQu<$RKWYjyiVN#UL_PVFH4EHyXR?+)}`?|=DOFjqkgnQCpm;ALv!3|
ze6#U=`iPeH{giw+`8Irgw_|CB{1-^k(0X1P2w!K-15f+0jCk3er=M5%aeR(C@VFn-
zp_3fKlA$@K8s9p~v7CGlaIbqu_lYyWTjWsbN3G{e^E!0{<@lU<dw8CH-uO@AbKL4)
z&yM<01)by&mJH2tlkx4L9AA)cUT(NQYQU4e>Ck#|bHn}72cG!Ky84oMZ{l@jp65DW
zpJ-%geXm0&e^nxXiP2BIuZTB$qp-eu@V0WFl77_s_Jxjl1H}7=c-MNKeqIZBao4S{
zHw<&kgHG}aONQq7A9U<HNb~$1`98Brm}3EWar68nbj-`b&*9Q}UP-(uju)+iMZP}K
zaD9^vFPnHj67RJQ!uq<wi<{^3q2u~;h&M>QPS0D#m6Nd&ytsMJce*G?=BI9+g~d7Y
zjBg%%^?do2e8-sQ$ywmV&2yG{{+ps4Bk;nk^jGHnIrI8+j;~KNGISk0ZSJ3oi8qpX
z_I-FMdLQ1NYdM}UN3Y_~dq07B@GVU{x(D@rc!ax7XLwyHd<!9weYqO>j`TczAKoPJ
z;`(tsc<KG?d38Rouw<z3F~+x!`ms9sX1cE%MCW8Zcm)oXe)KjO5B?!sR}D0OYZC8A
z=un@=&1g-?F~RAgb=B^32up_MIL`PsQjWFAceQ83>u(2m*!t1X9FHyx@0*$_#~9)b
zLdQ9lB;=UvbWx5zpF>zOG{-5%w}o=7OTKpfmDBp$ht}U3ZXHBF_oE-arOq<&eGn<q
zTh&iMJA8Hhtxvugo~P@turGf7Rf5OsuNXSnhr*Jfc`J->ALZSEd^a$!=ahn%a;Ws9
z_U$=*{X=q;_<tLqzHLOjwax23(-Lx=>As#4^{v6@5S9$hak}vxq#T=&Z_YE}`P>Lz
z+_@(IuK?%B+G6OO%q8C9r_;QszGh#aXt=&tp<`YSczQkBoOl<#7T(vjfQRK24V~vY
zr;B{sy>FiJoeCZM=8^A~<h#uHb|m<|Z+yGF@7Bim9phU-zWL<4`+vi{J)Wn5HSaj5
zi}Ln*-8RN|Tj)4%ihTb>zL%dDu7f`CGSw6x)%OCYi+q=R-))WWdC;+MG5KyszHeev
z%Xzh$_gazQ`!A=9d<VR5q49kII`%Ck-*M!-^<m+;I|v?Mw>0m@P8a!(TISA;9gXh>
z(6Mhh`KHMCywk(HW5COdnddW{F7nOxzB?P=)1YJD3i92Bd{4R{%$oyVF8OK=e}Im8
zRp7~aAlLm}iC5`)I#0#m@%$;T`>+1o^<HH@hp=R*t_wQ$ttH=L@_o;|PBR|7xYubK
zp<`Y>cxCXD9D5S4+w(L>XF`sBoG$7|x6dIg8Jc5H<J(C&_9oxvC&P8H1U#8%9a_(9
z=r~6Y@%AO&;f@#8x7^n!8W~#OA%@ono}Rn=5$}fQ!*gf_cvZ4d{ZQVYpyT@b!NV3z
z&+`Gqo8ftytNh>b>t)e%;q&QA=%hYj$xz=;=-4+0KaWz^=|SXc?@MavzGOVzmn{Fm
z_rn)h4d3dtqkB-_bD<MoJrE1vt9cJ0-w!=c?@JaY<Q?U7(f5aT`MkoCp}v{Mw~F$P
zCtsVlp7I_}d0SV8d3)e1ujlAc-#ww@ytS0~Nb<ei^E7Y4^7#HP`9AF%<t>6v`YS9M
z>e~Yy`!-YFqse#4gW)<Y0k1k{ot_OHua`E;QAxblJWto@od3k<7~^!&ertnHatKR?
z=EyR>y_Dm4^0j?yqP`tPeJlJa>{~m0tJ99|L4BY8F`U1C$~%F4xAHvgTlVMidB=l?
zX^r}p3!UT@mJIbRH@-RexsbXqCz7wt+eUehro2<|Vx+WFe-3j#e5=xq?m>M=Kqvi;
z_9c9EU)GRsjpu3J2JqspTeID~M0saICwYY>Lw%c|W8W&udn);^`+2xdXM;D*p#t7R
z{|VP=EqJ+5$aU*9;;rs^x=zRZH$KOa;HCTKy>g(F9Kw>JISw<vjg+I7d@nlJ_rra9
zMjm)F&pNc8t)Y{7De?c%OuQ+?tMfelyo!VzJ?HrK=XupWhp=R5j&A7Kw~c(yB44}y
zI%)kKPwP+aUU>aYf^Xb8Ip^1K9dy7~*Iym^eh;1Sbp0(%$h)u8MeDE2=M|O=&AXTJ
z?Werwk+03$OL?m(?+L4hd3)enl6G_t>ibKkyT8)?Hb{B@O1?*Wp61Q&k6)*EgO^^X
zej(&SC+k#LGSv4D<6D5AW2@)Oh2;Cx_Tf6s2TvKo)Aja<(?#caf%m=G_&x|7ud8DC
zN`0~~r<3o*L;U=S2}TOMa`)Txqxz17j(MfTyOemxc%FXVbnvo>r<v|6_w(oftr0q@
zPgpWkHy1kgEvNaroP6zi8KCttk=Dznzxa9f1vbGqZhxE)o%rg+SHV~J#|-j)*Yk9}
z^e5z9*Xg4DvC`)imJH3iw()JGyjPR&<jLWB$@n6iXPy63pyT;#roLT6ymcHeT31=%
zNk2p*L+cxDcrC=cj(9J0g!N^EC+l8^*7q!QTwfdIy`FgIJ6=>@p07_dGPJ&P46lRg
z`#bS=T@+s53c#yQliY*yc7l%U>jW<s64^(yh}Zp6c-?CB^@&D?^17g7ULVzW6Y*}U
z2!BpT6L?eQAofG&?;5YuKWBa!t^@V`qtiw6HwHTC@6D#ZEurK3`l%ncQhjef8qVKX
z@T#>qd{o~zpkv-3&EIXro8ov;eban>qLHDz$%dDM|9?l%wL6G6YkW9=)4}VEnZK*O
zPUo-mtN8ib+UcVD#zQB*cbfXPfR6L#p*}tD@22|BG51%Mo|g`b2d(FHr;B{6y>71Y
zJrz3kP0_sEL%wgB`=LqT>D-F9`o7|Hk#DW{Z8g3xnfs<<^1Y9IH^AX3)32|a)g}0@
z?R1gvH1B)A@m&)-&Ra^pZRDGMXn1{_4qlD~^+U6dfsT3Q#Cw2v^WF6=s;}ACCmI>b
zd&pcbD~LCbc$Xd$uG1FqCdaJPX<n!O8S_p2I^DqOqWW^6lXd#Asc${#IByl|({<WT
z^*uj1>{}jqno;s<J&!wG<eTq(A2q)7p<~}#nwQ6*6}Hs7=i{MoA$U@s4)xs)I_A|;
zj>n1j)q*rHs;|V?CmI===?mzX*Fg0>NxVDeh38)xc-3i=dr;o3&@rzOyj)1+`tcO;
zQjQnZ*XrvNjSS@#8eSXK_YCoNemJaeUP664K*#m9Q+>}8uj`@k`Zi|3^+_~b-y-Ok
z*F*I^PrSc>8rC<~^BiqxU0vyP(Y)k(-3!L|a_HE%mwaC&-val%EINns!PB`FZ(UcL
zo9Ax@-glAl-NZb9>m%QPk?)A@!}Xj>@cn+faGe%;-&c(9H_&n3e)8=i-+%8Jo_{6a
z#hrhjLdU!T;=M+^D;zKCN0qNnG%|E9FEzYD;&l`6<kP}=sY#fZ<DD+@o#cJrFuun?
z$2l_b|1jzO!JFj!)l;GGRPf@?moK1WUKV(IPQFFFxsDgrH{I7K8lIOs4Nv}GK&|f`
z;;m=Co;L%$YKIDV>zJ?8<$;$Ag`6+%60hymaQ`m%^@&D?_N^5<&Ra_Ly-&Q?jtQ?@
zE5O53muTod>hwDO^NMfduUiwHE}FkV=wx0#F!h}P9oJV*{rHILoAOk6zGQwEKYx><
zV_p@_-^avT&GDl8YQU5FL?c7zZxzF<r}_JocwI+^^H&QVzN8clov-J-PXD|duQO*w
zsv+MKoi3_x06M8}nW^u1=s0f!&ELPNz9r`VbkOtETI+eu+@EHybiV&FzAu~m(<Yji
z&&hY&^TK_Z1)k2Wc&qOgP8a1J<9+*$@21dk-e&Usf_%>{41LEY_|`gI<eTGtzcjv+
zpkv<_@?Al`i_HCL9(Zx*bEmmKZ6n^-#5>LLqWVgFeWH<}b9u7iwG(fEc&{H8uG2E`
zDq_~@3tp%FX~x%o;@0V@P8ZeJ3Z1Oe?@WDvhK}d21NG^-yOQeL`1G)E^T5-Ll2_|l
z*XbhPcJKS6@m(7__U)p1`H6g|JQ4bKfG73oP~XYWF|UVm{7k&f951S`%hx9w8JcNh
z!|S8^ekI=N?tU%0&*=fLI!$s9$~)EEul0kM3yEAmMy%<4r9T<w{x9{T>zim~C~wf*
zpJw6zRg}*c-bmuz{#bZE7lT(VAU~9M3v@hx+2G|uBfM3KmvX#l{+fM#qLHDzLc>c@
zeZM2#N^^hO;(3lXw66YV?oZpiZgu1Pxw$_rCf_y4_i}gN8TG9lJgr^4bzNQHbWz>~
z-Z#tmo(CPzUn%*HCf^gy{prF4-=mx^^6m7#Ya8Fgp<~~2@*P9IckC73pLT&4cmCZ9
z9rG%P_j}^)>3C6n%YA*Kk)d<Bo8eUvFPnG^PYd_?iiCN2)afGM0q?uM@qHLN&QU|Y
ze<0u6pAPrOAb3?SLXcxe=$KavUM>`}KQ<s<ljrIBsl?X-<Id+Ud!GZH>|bHY(D_?r
z?sFR9tLJkL`L6g!n4=cFxExnN$2poQ$0o%4%=0wIqJ$i|P8ao~$LA0h=g2X>9h74;
z@;#w1%+c$4jyAL}k94}ox6kXgFusRD$9cQptLJ1M`Ce2PuD^cpv<Kp?^HAq>k?#uc
zyOr^s3LX3Qknh&yd!TzB8l6Kc6MXkF&sPV%?;nlt?&kSwFZpgmzK@oK=RxLR{LiPZ
zfR1zY5wC!FZJwv|lmlMey8q6c8~M;lKZGSi=lpAPZuG-f*Zub7`^coQZ-wBk<xuHI
zt>-?ci~3gLea9K!xzKUmLCU)W`JU7nuG2E`7RLBidY#rW>gV`*`SSTRFRCvaI+>T0
zsqeqgaebNi|5J5dcBcA9JrdTJ10IgHXlOmZ_}8!W&tviAGOlkoI$cy>9&}P)k*V(n
z^Ey{H)wdhfxBarPz5>tF0=1qkoi6fCd0nyb-3&UOmpu4NeR4kULB74_c~3ETy5_`N
zecv$8drG|TUdHz|^Sq~kd`rl8`*GnqElcp-(&?hS<=%H6<GUGjoHs?j`;zaS`-J<v
z0=zz*WXgM!*J=JDyni5W9TYiTR9`7{GSB;&`clwweZ{m64xswFPY>s%9K5*w`=ZlD
zzE$4$K;!!ybnIJB^KuZh(rc-A%D=+(R|8%Z{$7W!i4o8-uL8VWh-6)r6R*bebp95C
z7dL;i-Pc2-99=$#uw<xjllgjR9nIfi<om{gFh@^9j#HrH91WD?aN;fUJk3#vuO`Li
z_{BUAD27hvRai1K$B*WDKnvxlAm5Rng*i$+&(VhV<qzgODEGRfjqkVSJZOino(IQ}
zZ{xIZ{mJ)vXzk*y^KhxtMSYX+8xh{I#`hxVc%D1R_c-$Xk2w#j6MR21=RuA4tunsv
zoAaQPd{1EC((pW}1#hfQGUdGjI?mBWyc3D{k>}|=HGmhlUbc3+X#QsU9Kw>JbH0V~
z?SZde-%cXmhT5=iv%!lyH~#8$k#DQ_tuemmLdSXgDDTPSd(v~^I-Lhz+_~}fv*CX0
z2QL>n<=i-xc$J=~^OuG1TZ)^%E5I8e@3WN2!WavktUqDN(D}R6_-5h%YuEXkOujoE
z9lqX_3*I7!N<V5nfATv0^YVoHUN|bvi|QNj_0^jCo`sI*Ifv?-LiOGMKse8X;Kj{z
zF?7r;052B_WS*xI?@rIt9F?oY&-3DchVxtloy@baWavD<3LX2FQ;xro@2^LM^IQww
ziw>23)Ox=4I{kBMWPE+sIbAf*CD2KI=a~AghK}p2qWaFG`Zio1&U2aPX^C3T7^jPT
z$9vuR#y1N(_N|4l)F=J;EBPMy*Kq$<f~RvU-s-!T(?z~j-nZWP?hYOM){*ap<onEy
zp>Ius?|i3=d?$I|i;eF?(6Mhl`A#R_qYnzt-KpTkox5Ki7@oTg#JiMu<({YWGy}Z2
zbE6SFJ~x_t4q?gAIiF#C8{w<x#^vOjWnQOl25(N9<Q}x1Rm|(u#hLN--FawuZj?bM
z>*a5zzT2SVd2XiquB7@7o)Y$VJa}=}g}t3F>Tk98z1sNh0Ui6cQ9l~VH`krd(ewC8
z;KiL+^A?8tqaD0l<dyw#E%Da(Je|)@@Z$Pg3Lf{j+vgCL4DD};@$I4cyPkYccISAM
zV+nX&4wZh?dXD!x{c{W6&l^|Yx90tD^PrRd{@v8~m3cp0AJsRD>Z^6<b5!2~@Z#qA
z=eBU32WXyeBHl@!r#Z4$i_dWbcs$R!&`Azq$<TSe*7#-@4DF*^$ai~lUC0M7?z*t0
zxh||osPCD>!+kX9>uWakJqaDJ=RB(KcB=0kb3dN>JD1m`9Xg+1b-HLDWqI8k<NGh@
z*f#}Vy)N8IzQyN<`!^drom=tNKJDOik?&aVd$;l34m$QNCf^qFy?ckyH#foeW~YmM
z^Stjp#&;HU>|08{_mc0f2ZYy!0`TIl3vcWnUKh%VcOUV#_dK1aQt;yT<(c5|dL9p*
z^g~!Obk0vVz7_D*>p~m(?(fd=XkS)>Hz!SU4_Z&L*Xf^ECe-)7d4FBzC|BPDroMN~
z`|E0`zIjw%(HUWXv%rhHE^Oy?QGav1@59D-8|b*db<~eX$aj)^zj8D$dEnK@%*zC?
z(|MT#U0mN*ycnKCZN9$wroMjYxW0Otm&d5S-<kIpw}XdUsc2|DKhJmfiTdZl)#K}%
z>2%Tj6+<WM>Ty$FBXnF}Bh~jL)pxnMKP~k<El}&Zz}%mfd)-sU_dIid+Dv_Wntbmv
z_oo%$>7Ed8^_^|*Pb<CeLgU+H?oV6D_gV7YI2Eqb>IC0)oi3W^8t?nO@m(7_p6535
z?IhpL4i3+uTJTQNNv6Di@H)-k4PD$ieZ<|LM)mdj`d&2kJqR7w*G}tT5!H8(yI+g;
zQ6G45`?uNYBHsb;`?B$!4ITS-(!9JvzBAl@i+l&ci`yR;d7aM7v^C=AWsKRs4baK{
zc-7RGW%h3u&CBal-yi+H)c1Qgf`>0XMMLY^)a>7kHRJ1hxIH{yvY?at7MuDWfR5*{
zm+E_y>f7hv?%dG&vOP}=)cT5?F6vv3*S%$YQ_!(*KlSZx@||VwBl5tD+rL+v`-pt+
zyTthZ&D=)}kng+XJHkA_EKKnI-rPr|yzl$Q_ZxE`F-X3><eOO*?%!hYPSQ!nN1f*%
z4{$pD^Bm~n_V0~O7xkmf*Y}~R?*{0&ADP<@-5)Ha`u=XNzwO|~?cXcS^|#aeeqwwt
zH`m{6_{ut!=TV=MZ|SSy`s)HO?)kzSUE#XQ0Wa6{mJx3^&(rzK&x)VF8u0l3Dg~X?
zCoCDd7ORbKG0op{^1Y)Y%ux(pT#oIa<9?J=j?alV%kwnH?1UW8J{jg{@i~OWIi7-!
zeQPPl7v%euxt_Oqo}&$|(|?=mdArwrX?#C5*YkS#>N;3KzJum^-T|KWK)iJxzBbqM
zh2HmT<NH5zJ#Qf2Z^*aaT+bIJ_?~U9=Uv|STjM*$T+bWH_dD`ExI8=$dccc&Uh(O{
z;r?wR-b&)_?Rh#+{ouu&8yADe>wYD4(hp(D&^f=r_%_2=pI7`uzN?%W-VbGrjz2e6
zn(O`;=*0JD<2zuk`)!o>7xEo^CERag!He5(S3$??z8$<=_{upX6C`=1j;}pW=dTXD
zxcSR*y6D`U?sKSE=Wnd>?V<S_NxsLq{TtoC%t*-bpC`f`eUxKW;*Iw_&C!>TqaHk7
z2P=FIVad=O(~NKCc0=o66!|`2?ju&}yf|F6e_PCbM8;Zf9jsw|=a~D5Z20QAu_pO`
zY3?INfv2^Lwa&vbb03lAeMcMLkIj8V4*9M{zSZVFB0ItNX!APtSnoT=_#R<ir_Lka
zb;x(S1H*G87reN0<3-$W@VYM`-nzug^E{oWBJg}^>CWj~p5*RdqIF;Da|la@>LwW9
z6nypESf6~qH1`|j;Kki<EHn2TRo-{3@%`A`Z<JEr4aoO{XTo!%2E4d)qZT@zzjE+$
zkyFl%jfnTA=jr?{1kaZy(-O_gukL+^(foD!9KvGVPxgI`G=H0r?@04~Cq3YujSa0s
z>-oWaeXwjye0{T=E~>8rI@xczroQW;<9Vs4`ZlNf3h+9sl%vlps=$kz=Z^csd2Xb6
z&LiIDo~OAMB;*(m9-nKSK8LVm=sGPozHO9aYx14wUbl^Mbb+@pW}c7nI<2qq_wn=m
zjrsoR+0e;6|IyU<rTPBp4yx}@RNwRNeU?#ub388{77tp_<4za#x7F*mHNNwq<NkKR
zSI^z;$oCCAiRJ#z15f8xyw!J+(?!1R-nY>Bc0$L#J>)x%eDB&W^zBISo$Yjy??Ugp
zqw#Hmj(vN{H$}eh?H!)Gi@=LJch827d40s&nRwlvr}MNFJYQP6bvl=8IbD>a-{%mP
z4Are+eEZ?6=kBiLyZUM2{0)E?ckcc=DXoiqGuL(Nba&(X6Lg$+kn$Fj@4YXC=Rp>D
zapyq_I_70=KXmTyNxa)UPv>tEc)qk?US4qT?~HQP`5eNMq4W1FbnKf4U!A|b$@if4
zFh_ktjwN`1C-YL2V_)Kxc%J51l8|Gvd%tLuqtE9M7Uwv{_*PJk{mJ)6y#I>#Z@=d`
z+R*-Obh^lQ!0XD4?+oZTZw-9)+&GYY$4v{@-ynF}1M${**xKnL-;8Xx{th<2TR_LY
zwd7k)zE_&}bBzKo&i7*Tey%L<d#Lffz`UQUj(iUz-$na|=SDVoap%T~&~c7>;vG)B
zr#(;SsQ^4*TDo<b=|{Z3ldpqCK8LVmsO~%H*tY?`y6!8;ck9})ZzbTxof{iFUDUVn
z-uGzZy8(3U+eCSffmZ61_4CNf;X17ZFYeqZfsT32;N{};<$mp0;@#(YI)Clp`O=^s
znwQ1y{i0Ehg+7O{Sof-V|7i!!UlsXgyXRZcb$U@kj=LTYb97OT3B+5&^E5}^dht0@
z;PE;rgihvFSe&EK`1VtdiR3%^v#=jUp66&o`?uQZqWLTFx<4D=D(JXxgYeaJqlSDx
zHs?kec)EtgTj${&b8eJ--&2h5o95ieEFAJZm3;TzAzb$r3BJ2JU6i-d`<`ZecY==d
zW|8k?@*U&8{u`~AYVhLDjeGYC_ir}wYKga+=jl961J9S1Zk^8MKH%|sY4ACOB|~+4
z8s8lF>bY?y`MzHp&R-*Vap%Tjr;FyV+54Vld|!o*=dXbBo(-*@8;|vbzAfNMeL8d=
z9)XT|Dauhtywe;ns;}MGCmI<#FDDybDb;r_@jiGftgj=XzIUPH`pT)kX~etE@uK>=
ze0`$f`mQ#-Dyr|V#5>5;*OO4+{)SgW_0<#aCo_M2zCO`#eczk;tE2iZBHq-u!};q^
zsIL|}p1*pkZ#wZdbG&H&27P^^;rcc<yhf_;QsVWQpWB_e{)qJT$kB$@%Tn`myPJsD
zK)kyhFRCvOy!1I~>bt}6nu&J>@osiM-#a>A3c$<P;_y+|bEWzD-YvwNLA>icPxn;?
zc)qkWRe2jZU6iBR=Ma_*)&0Tvw!v4=m#fM5pj*OqFexF&>d^5z=m1a7Q@KC5hIl2O
zr#WUO<mkFN?HlE2_Bn(lLvt*Gj(vM5$4v4)`?)Yj3wUwo)fDKM*GIe?h&RshqWao>
zeWKy|wl%x~@bvoIM7$fW59{jyFK)dY4jtDwNb`In@n(45Dz2Q2KJa{LL4Day7v)&t
za|la@&hr@Kn>}u5z1&Q`cRdp3SP5R-Jl_r-=g1@8t;Cz?cu{?${^0hdXt=%;3@-(q
z&hu@=+jgh0zA@lwM&apvZQ*p0Z?^Zn!}x9r9p@+}-#O&_ek%0MN$_3lbdhha_r1&b
zz6u@tmXhz?<U8ev&^JH9x5nur-vaMD*Z5XL$G+v{dk^{M7~fQa@9&Lok@syizH1rZ
z3i7>=e8)`<^Ok_;QR(%f{oNKi&QV3Y`-#`*zWx@?OS!L4G%|GUEQOAFHN^WT@$NKV
z&#OqN?>57$CEkO?t1$Id`}#z~^^G^YI^sP<yz4Fu=Wh~t*$x%(u7-~D)`KVeT+aJP
zh_{d9Me|qh>l2L(oxeQ|uaWATPrP62!}=N$>iY>guCIyedyIGwJ6=@ZY+s*fxV{Gr
zuZ8M+oOt%<17|(to>$1ce2yD)$t%CcZR~US1vv-4IcZ1tpzHK8{H5g3gQ<;jbdc}X
zo~J(_xC1;NAq~`d-W$C1^AB&Z$mbQ74At#nd^^bZ8S;JjqOc#`;Ki+%2cYAAbP?}a
z;?+1_)Q>)2pJ=$gYQyWLemqaSTvK0vLVY=g*GKieK)g51dd4@RrLQxh;rd=P>v@3c
zdx>}t7lp51jRLRGp#t71(DD2YQhom-UaRNn`Y8g>mlp6gak^-pOQDnNrLbh^I@l08
z_RZR1XrFhH@2&p}bCiSE>`(#kVCa~a10G%~NS_<85$}4>(;Umei_7ur7vb~i0iQ!y
zGBn3e(6Mh5<ycI<Tb&%{7zD4_p#t8WH6gEscyAIf$MZBt(FXB3a>3)*1xlfleh5p3
z=EyO=?d1D5`M%c~?#puU<b2kl^}G!o&r2uqmJsiH$BWiWm9I}UGPJ&H46g?~y$^ej
zc=nvkqjT~bIw!yV&iBI?Tm#?ron`t_bKC=+<j`}nmwZ1U-~W1^o|E<9`3PyA<~ZKz
zqMxHa!{-&24AmWDeEVqrmXfc{TTFQeC~xg*VcwbWElE4N2lX8d9p@c@ubdllo%xh}
zPx3s?+ntd2;Z^<m^Ap<Z^9oCb`aS?1`{wO9bRK+0zVdx+SkKY(-#+lBrb+HWd7q99
z_fZPGd`Kk6a^mgjdD`!a4deTEDR{h(s-cthCoCE2dy(<2q8$GvU)#3|>f3kJw-aWD
z*Yip6MTBT*-D9BR`KyJm?vMYG?~$ITeXCE%`_gsc^?ZiUD=ZnB_j%~pw~q3DMZVQL
zg?*a|UXeouylm)%SK|Mzfq35#?`Y4{{EHHDbfv<+_4pjZlA$>kLC3yL<og}@KJKmy
z(faEJFYbDDnz=5tfT!1^mBf3{^EAh_jpEne#!eTVlMT>Ge}yGOb8KLIb5cY5=qL8A
z4*SsvUa3O`yltT4c_|>?&%~SSd77g;A;*0uhW+UEIfNxcbIgT~eT&IAW3<yr{xu#A
zuSb30jY*T-gVwVebj&L!-YUd<cD`Tto-yF-6O9b5?<we*R|TH#w@l(~<<5<0y$pgk
z)u963LVW)^^J>7$heFP))rgnld77&>Cw{$50FTeBY0yc1!jhpmjx)ZEG%u@@Z^mBX
z_uEegZxe?~KWaVS?HPW*<Q(t2rt$q6I?mfn^Or@w8|@LU(^l{%#Q3h`by~-$jpOI#
z>Edu+vZ0fCS<BS-1aw?q3(d<Is&C<rVSPE^O^>PXQLoebniJ|f$?2kf-s<c7y{T^k
zbX;FM)t626&DuBIAM?P&Tm7P;>!1WW=5>O%5Gq-J>l5#4&(j<$H;JF;FZT)eQRb#@
zo`oeteg6v``!?(}bY5*hzAcUy?V~L4;&L2jcun9fgrDTth<LYn-YQZIMn!IXj$if;
zb5uho>qS^HG{=w7agK_ehjMH}zE>O&_G1!wJu&?#gpPSN;EjS#a^w=P-t#m^@#gV4
zKHNXdQ3jpl5S9$h@g8*STf56pjxEUd2FHu~F&@0Wm>k81R}UT{r*mvcycwRSIZ}D?
zIX>Sn%uxcJ<Peq&&G8v@oTIsDC`Uf|E~^gvQ3hU1n&cjoHxoMMwSgz+xb$Ni;=K=@
zOoQg=Psp*C(?$DyrOzQO8S1-xb?BS3>rjqu$#>wyFh|Cg@j32*j&l@%r#ZGK-shgD
zIa<K;m*}9rL!B<lF%LTFhp=R5j)RPEGv(NUe1G{<m}3EWao5X#LdQAUz$=5F^dm*Q
z0ngJM`CG;3sCK$2M+!R0AuJi1qssUWP>x;5cLVRcn)~#OV({W}EZQc_k-6JYj$Mhj
zw#m_!kmCaIu>PVP3w#b?$<Q3<8Q*gFj={gn{1ub$$1}oyEKJBT6FTlk73J8Ic<*?g
z_M>p?_<ro`bWx6C=tiMFVad=Odl}yr%CR^34*o67Q3_sMKkkQ)bF@>AeTnzA=V^}i
zgd7u`F3Pdc=MWa>IL`PEQjYz}cjL>$9E-r4<WK>xt0Byhwfo47@lZ&A%ZRtG=V^|@
z{P=!c3?8qmV(6qF!jhr=xWM>U!B^MS!Q@-yc+vHv6uh{8{QI&nM=f||@RJ;e5N|ur
z(;V#yIc@=ub1d{Zge60B+-Q8;DaUy7U3{47M?#M2(DAzJq#Q>O?<LRE97TVO@5hc#
z7p<#O=%gRQlA$@aH@;cLL;X04eESa#bCiP@*N<DF;~Y8QX+Mr3-Y1@?IXV(@9O`sY
zjzvC)usFv-#<zxY97n#J``6+0-0cRh+Mxp8N8g6`&voFHKq2d@ig;u7bv@50+$O#s
zbHL+uRScc<Ls&AjAI-+MopPK=zGEH>pKq0dSDhxg2jw+A8a|Ke1W#U9ksK3=x0>f^
zKUxxU<bcOH=J_1LlA*q1jqf1ks3G48*M{qA0eEsA=+JsLhK|=&)*eI8r%xeXh3Dz#
zElS9-^qO#=_xK#blA$?zp<~}{`09Ce8u@n54g0Yayagj2OCF`yGR}aGd3oT;gi1e7
zC*F&mr#WVC7r(C7a=K`Lv_L0b!jhpm*08>KeyusCkgt8+v6fzU{QcUFC(O0h^zRq-
z1-8Mr3psSCZ}l4PeV}^7n}Tl%M3VO`^3C)-ecf?dVSL_4SNHFG^}Y?zNnT;eP~V54
zlX+I(I?7u|zBX?I^2*l{rM`73Z_9GOPQ7m<d^Z%nAO5d1Zt*(J(VCEBYp07|=Wq8p
z&NDf-fR1xCP>%D5$uXO9WK)hYE&lZgUvLL}@z$tlXpYsqPIFX_i|@zHcl&eAe_{=E
zqd==SIc7n}IhrWPMU>;Y>ES+_3f`iaeRLvpypLLh=l9Wc;w|tz%~gcgh2x&5WH?>4
zk4mAF9Kw>J>uT`g(6=40d+9#9jC}37YC}K9f+Oon-$yIVfBqb<t8(~OiJ>3ry9abU
zf1U6xghqH*kni1|r+sTp$h&yZpMQR0+I?PO$xz={p<~|x%6ldG+Ps~VcYRuazjymL
z`v2oQ;2U>t)Qk%EZ)VBRxzR|zqdZUZ&e$cszfb%wJU5!4ll}@zhUR?~I?h`PU+wR8
z<ZJWxBCnnsf1tci{5$M#GkiC9mgz@bm-D<%b1Y2Av4_(|=SG*$af8XRD|DQrf^sws
zlVb(t7)v>JaQi&!TMvAjV{+tso#vQY6yJ|0?+VY2dg!DdH<=udLB~02D96o|<D+}R
zbE5&g<uTWzOQ929iLbp5yao8Z?4w(W_m<~re`<G&&+$j6i_VQ{&`Azq$<TGRrSUD;
zduUzVPQHsT33E&rUpoJkR|g&EC<ZUrpMP_R_mbynj>bLWb8O^vQI6TrNe*GjP~Sfo
z->Q9va@<Y6c7J3(Jaqo$(7JkMc6c8#2fizuW#Bs+I$j60@GXHt`gRZbKI?h9{$}F;
zX^cDXkGv^751OHqyuy;9c@Kk*ecLGSedK%gkN&#qK0Tuayc+*|=H)@hee0kc_Y-fD
z=V{+Y?G>Nny&wEO@?P1{Ne*Gj&>U|=$G(G<;{o!ueak`L^jyoOzTND6qw^pKzH)uj
zp}w=cuil4c?K`wy9wOgEHHQzJ@;O8!LwN@oUJiJYSJuHJ#M|aJf9|F~8?RY`m*;;k
zAC%XJLyYGo4?Mk2&nI54=V?Ex!HZj0cY%j(81184pF>#ed%N*1rg>RFzNb7Do(FZ{
z)i_kZ`=}#456ZzSfkNix3F1|Gp5|DRkfRDb&e7*{2up^}U#0PFq#RF?uU%J#w5~R%
zb@j=UKCdsZAHH$x>O<&wUpABPLh_y9c+vGTv&8KW(QuCA46hA5U02T$Zw+1d?$a}}
zz>Dig$I5WOwNpPjiI?Gd+K;K=#jUHe!Q+0^`y9gJ98-+%0L{xw<ZJs;O8v;AevEUz
z(LQg0Z(KjN^}f2#GfRi|`OD<{+4nw&58Ui?h=y}~0v-1^8$9ht7x7m7J>2Il;N>|~
z!21Vuyw7vM(|!IL@jmlB?Z+bU;`%Yk>7sq!<8ug0hVG9V<C~&+SxmkkKN0TpUhv}9
z)p5{qj#BVS;3xb1P2#=dd77gHKSv-g$2*UQ`@9@FnP*|i&>U|<$G#1e<8AV_>#CC0
z)mF5wPH?`_x~hP0+`2l}`|7%CBHwq(_g%c$lHMOaaIMcF8qV<+biA%wz|(d0KJmUg
zC|p-{;GGQv9XhZ5UZ;OvzEAu-H#uFjUIw5O-w#ZEGoj;oZlk;(QGNTE`Ub(fA*Q|}
zQ{T+e`1+O}7+$xUp_BSPHud#F$MtnkeV<Z&r+#bhhrp}W$-_roS9#DeuM4~q{JX5@
zWyCwd^K_mw_lwW5Y#=-*$3Q1Jge60LKZcHdv-TT0ua=YVKjw$~ax8e&X_9+T-geM2
zF9*CLNF>MS#GB)Jnqyi*jz`<Wec9l12up_gJ`5fER#1*F$amT`;d*WaFYfiLU7%xL
z4e`Dt-W1Q%9IXjCerycaRlCn2EY9&AbnIJ4zF(8?VPA*qsslVMt!U`H{Pb1W-v;pJ
zK_&edAl`nSr#UhXh+kLtgO@&Eyi*o*vaW<BLw)ZxzN!6(*46jq`_Oy-d5`<_jBN16
zMnw$q)`E`br4&3}S3eN%Ue8lR!GZBP&V1KD@A1Ax&`Azq$<Q39L&v`Llw**5|FR<N
zM+taw{n!*b<~4$+{rH7=r+J>{XgDZ7$Ln8){g?@z<Peq&&G8C!>|1=mP(Mbj<#h6S
z6J39!uQ$#HuQO&{jW+!)2Tz`_%DNg!ykk61b5xbb=XlEHjjjumpp$xpB|~#OZsxDJ
zY$(TS<oouLa9vFWFGq_Y-j2}myp)5d>uMD7x;#%2jfckPXnH4HSF@p$9Kw>JIc7q~
zz73RPP4d0m^*8Fr9Pr}$G0yb22|Vq`XyRSqd77hUe0+|N{}-;SsnAIdVad=OA3zu6
zIB=*RW5{>vjp4aF4ZH$}3V2&W$Gj%+a-ooQ^?Tx-;(3~*B_YR$v%+(Cp3fmH8Jgog
z=-9WNa;!(b_P(z6;i1<BQgmOp*#e)}7q|evW1MCBQS06qI`P%}x=!*POTO<u=5zQ@
zT;y|zMuz5i3p(cYfG2&E`P-0qHpg_zu@mLkXJMG5J0ZuO(6MhX<=B{fe|RR$vDD`f
zjSS84Ep*K5ryQFS&*o^N96M8v3D1T(mM7#m4m$Q7pd6c%?|P0GJ)d6bbBKm>tYdhY
z2MzTjk9ammE9KaQa%A>~IWi89UsoB>agHqb%KDRaur>KU_I}upG2qF15seJ($0N`&
zFNbpck$5&o2jwWD963wE9Agu5jD?PU^C(9F`M&;6m?Pik5Dn*e1v=)XD93ihvpKpc
z$F7uPmgz@fLXPWAKZ+^GIPyKf@uGEA;&X_GbL?w)<&<Mb;@KR1lw&u_@lVr_vV<J>
znSNAIj-AQ(M8}JARQepE;T*>sUJd0aBA(5$l5*@$Ikx^FTvyczIktd~*Fi1i*qwae
zHT{_CbBKm>yk+`PPdWA=p3RZ<$k6qpm~!m(ZkS_QLXO>`;~Wi?qlA3FGX0q0bBKm>
zd|~?0L^<{$p3RX<Irg9&|6CB}n3<5{KIk|{Gv(Nid{1<|XkE?mIYh%bjyJqE%5ebk
zY>pJ=*pqVfo9jnwLXPF;yl<x*2a)e>=K8U~=MW9&xY_VJDMvZ+Y>qO@u@~j&UKsXc
zVM2~B=(rzUl;be+y~OdNesudBqLHE3j|&%uyk5$2IPq+bD#}qpIre=c%&{aP$6nBJ
zjy}p!LB4M;PV=H1%Y6>f$j}_GL&v-U%5gOD-nrJ-=RQ4S1$fGkzta1^H=z?=iTowT
zAn_`RH_P#&=SKs+KGDcf_VtFBdGOHv#&N{6^E{R2c^{hRKfe;r^I*a}p9me#OBQ_f
ze&Yo4{pRIxp0kc{_Zy<&9A84myd27LBJpgF2FkH7<#_Y8Fh@3g<L<{_hmL*oD91_U
z`)9|C)=QqxAsWtcqT!_|M-B08j@gu>lyZFYQkbJ4A;*`{agJijaVq&<=6F$#VxL1a
zoa17{E2kW%5zppmqa6EDj?%ls9HsEpH7vfmKT4qE92MkSOTKU36|So?pF=b<l>It%
z%&Q{a6yn(&3n|C`lw-p;!yMxi`msKA>{~<qIE#GmbLU#rk7}PoG@N6uIoIka$6ttN
zbM#P-11QJKcZ4}6CG_J(=r~6``JPL@$2wk=qt@pT4d*z@@EV9Wjd(W4a>`LgId<y`
zbJQjDV`u0%M<ey)0`mQrJO82_4L*lxIL8a-{A;Eh7ZT6r7(|Y-0Lk;R11ZPNEn$vE
z_^$6P(~r78a-riKEtF$A`CjLF`hJiW@Un=f`{RDMFQdHkd|qM6P~E*|U$&F)W#nt~
zX15RB?;cEfe>D4O0es`m=kLru>LlMQ$oCS*i*hXTIYh%bE;PIz>e~$B*&O+lqnvUq
zJ|yg0H+=Oy_TsC3dlfqFTQB)uO}+;?UX){r&mkHa+K>GWua9`w5YOf)Mh?ABA3{0m
z-1iSgUzc18U-c4S%`w^OqWb!LeKSpcr$EPf`>DR`hpDfe>N}L`JMF-5p8FH(JJIQ)
z`d0Y*noNDiL&x<EP<^w8sjrIaJB;e<JSnViC4A%7!4pmw)t7OkyC0fu>U$JAu5Xa)
zyLp)UYN@{QRA2uUVSS_E8&}^aP8ZcT#@E+u>iZBnt}nBE=)Uu|Vd|@=`VOc1<{Tc@
zH#VWZ8=WqyFW1*M$JBQNbX;E+)pzGG^)*s`M^JsQZX4E@pHScPP8Zcz=<91S^*sX}
z*OyK8%^jw`W~%Q<s&C#^VSPmj_1)uiQGF%8zE)G;UC?oTIaJ?$!_?PC^;J-PUzUdT
zmBBaed|BpnQGMmUzBW_e$Ix+oc~sv&hpDfF>N|?+`?M^quOgwocbzV(uhQ2y&(!x8
zbX;En)%Vaa^>tBwM^k-!ne(L@zH$3^Cv(0`^7XZw`o@{_B}MhkAEv%us_z)8?{s%=
zMAwh03H41h=gTx--vU$L3Fdq$rurTqroMivuafH9)SNHV6Y5*foG&wceI2I0b<Fuv
zO7%T8Onrk?-?3C*xjA2ECe*i&IbUY``WBk{_B7{9Io0><F!g24AG$v{j_TXqoG)_{
z>f6$sFRi}5PE+4z=6tE3`d%2Oz8uu2_s_>ueVg7H?%#Rvjk|xoXHK{;tKh5mLyO3F
zJ<rqo=SASf-9L{5Z-l(>brrcw%E;*Pd4(lI&$w;pgub=p`wIEm`?VDE>idvSpu8Kt
z8s_bVZ`}R!`q1$?R8PLIk?)=Ec~q36-{%mG49#(yeI7-9>n5JfQARl?P>w^(!yE(f
zjXT#4f{t@Ek?))2`_jQ-KL&jc(QuCEp<`Y%@!ley%~3`B<3!4Frn_!M=U-+;{Ppc*
zr;Fx!6m+9d*b-CUMCiD_7OL;vVd|@;`l_kEliYPHs&7m}eU(lZ)tBw->oxUNK*#m9
zQGFi_Q(ryRH<9XlW@5Mwa^M@c4(2;uR9~L2Z>g#8A?UcicB=2=Vd`t7`c9(yzVts2
zU^Tzb3li#E=5$egDPLcosqbUxxV{dmZ`m;QHB)_mruyz4AI@KKLVY(oT~uGGuWz}j
zZx(c1UnkY~pJD22qxx#7zV3pszVd|nUUa&sz6xJozp3vz=(xTvs_%<o>g%BTPNw=E
zxiYM;DxtpnoGz-b#@DyP)HfG8uCIsc`)Zi_x~RTWsJ_ql4eP6gub#<ruK8t|vDE3J
z`lkB&226du&~bgeRNuG5)YnV(ol5of9uU?yEup?QoGz-b-q*L%)b|>6Twfp6_royt
z^;3P5sJ`9I`O*O2xbvmZoG*>OzClx8fjM9LslK0wsc(?#JB{j_V$PSQg!*dC`O@s`
z%K%G;u8C@Mz6?-(BfPI%ckJ~o>(Qb6zsXeJ=H`59NvLnEIbYg*eVL}dY;(R0Qhloq
zQ(q3%cRJN~m^okC6YAT~oG%@|zEP&Wz0LWOdC1V~8><gfUjfxuOZDx5^I!z#TdyCT
z3H9YWU9>;Ce0^D_zC7r7e`Ha8qlc-l81?D>^BGiM?OkDgJ@AdYfBxyt&^H^tV~|T;
z&mKd*CwZRUKlg)|1)UCEr`Ljqd5Q9_^m&CPLv>df-#qfwpH~pKo-2@7@1Lho-haFv
z=FK=N{{HzM=y;w}<g4G`Exx-tUX)`Dc=Gq6k)b(uGQ3jin||MMT#iYU<4iDxC%;}^
z6y_M4kmE(@I7d0<*vRw5_gKe^a^(9QqLHCFjxxL|%CRx=?D<kpInJUSS9OOu3KMc%
z0UhV4p&Ys7yN=^UIZAvE(QuB@hF3>9^!xK<UTlt;w2!7zj<0VIbCkh1ZXaC&9p|X0
z99vS3<({Yes2aSueU$BVQQlggS6G~PjPY$G-+c15d0VM(XH(vP{42~`2j4NyGX1Fc
zCHFwbd7H`iPvkq!@uD0JK8I*z==$5%@Y<+v+Y-;_=%5^bp&XBx_mMRw<ap4$kF1??
z6q4`hju+)<_BlkuIZidaPRg+Z@obK6%27u-UNP?@Ye~rQl6fCl7v<3R1IxO<%<-Ze
z?LLQSILF0?*GoC{{j72OsE=}-Lphec7p|+0gd873$Lp$(a_IXV#rHPHi*j`N9HQYI
zHyhpn<<R%*#pPH@InJdVKffL3=t;=&19Y5YkaFnzxx{zA<3&08d=AlYj)x2{>(HV5
zm%V*`aXGRc8@fL@k8)h`k1$6+e9N3=;JXWSoFf~)dcUFXYZ2di&(m`)b#(l>)_-5x
zH_BTAoqWEqWaxRY96I(bfUlfGa$lnFdx*=MhrD`!Fpct-d>G~}gKylqRtz2c7L)Hm
zG|yj|^Ptk_5RDAY@r5}L%BgSqb?3MoMbx+RDaWGLFh@0f%baE4dp>lWqk{UTU*{Cx
zr#(;m)(T$S^=Lb%i~82?^9oCb=H15l*3$gx*Wbj~o`2)1Z-1q{mG<0#Z(QFh%s#It
zU;Vm}_^xix4WC0aGBn4khSx}a)31}n<*1>)T|hbR#d^klarAtl2fpQLNB5w<mC$kD
zn&6uYiL85l{a$=;^E~Za?lJLw8|`#a-wL3U&li>q^<CZgw$uFS>(p_1>#1+`l=p1+
zeF;(C6nx|QHpP5jLMQoFd!G1i;doJwQlCRKGBn4ghSx)V)7Ssva?C^yJ=ZRz9RImD
z>{~f}<N9_BblkUI>YKhUCB7edp7w1vcyasfFsF<1w)nillA(DIHok*2fBJe!T;5jX
z)pPP9%6pajK8&buZSalj+ZE>fFtQFCI-m7<y!h^JzOSRh=Maqy&9RH&<$x!jFY8{P
z*T&`Opd1%dj?)*1ed|ofaVm7&w>-+B&jZBwhwd~l>PL^yAsQK)<6G#Mm!cecpB<N@
zn{rI299O>_=IBkx@i*w$x0rJ1eVF)e;CNAvexE}$GBn3}hF4BG^gbdkM<3<5gmV03
zzP>e(kmGyv^{ooZq1OfRz0&cb9GR8wToa89&2hQm)ld#Sui|p7q#T!0j*VUl`;i6T
zxc%`5=(r!Xltb64_}=$oxUO=14$;Wa9CM*#UOnZ|d5+7GwP0wUUq(4Te=f|CmyqK#
z=-9V`ax{2eI)~#${Yd#7q6u;sUK8cGf_V1+AeVBeuguMc?O~4MgdFQb$2poQ$Cc#!
z?jvD8%6$&eaE`a2V_qBOxSDu2M~ZS>?sbymq!+>*6$v>eK*zrAl;c|R-N5mpe$@CJ
zqTw9t8D1ylm`OaFql|KB-z3KkkA^vF6LMS&9p~tx9DgU@1065QQSWnzhI8y^c)gTk
z7V&J3D&)}X{&j1*{U$k<&h+1ZzKZi{fNz!iZTivwbw(a^oTHC&%qHKrJx{OuOTmk~
z?$=)DzyI7D^!vQRk|DLpm;@dB4v_Dy<ZJWRA+KKd|K@eVy!iXDZv);pZH5QUdjWLp
zn>l{yI(<9&?&)|@-v&KTG%_^DZibgdyg9_PIc6Y-_H7pR?TKr{zGWUeBI7t`nSRt9
zzg!c}Up9Q@9GClzyUBN+=V{-n!HetL{^0TJ-nG!lxhO0dns*=Ln@7I)kgv@<hx#_d
z>xB8*bpLZJe6TwBN`G}|-j|`{zNN_bKJu-1yr^$8d=Amb&>YhYuax?BKk;micI41`
z)^k^wRhNZ1X2N&<w4-~_97i}^R9~yF?*UWaq0n*Oa;opaVe0Fob@eu_t5?4c_s2Z=
zVyQ$!>zf80`&N+e!{qzC=jpoY1TSt~ZS8bX-fo{)STeL9TNvLe>hFB=wf*R&er%5d
zgeSj7;^z?a^VKEr-B1ku(7Zq3=YI3LAMo`pF!g;49nVWG&CBD%)Ynh-?LhVY2S10M
z>l=ixoCi9zzK@(Pn!oJh+`jBE^}P=r*H=gNJvB^ygS1{IQ+;<|5}rdj@GaBg@KO8L
zHa$Ft>fxJ<f0uJ;A^G0ydAeR|z>8Zik6#>~LsNZTVaZV6`OtCRW?C=LldoMb*^dvM
zyH|OgFq<30ywl)YnRav!>bv~v(6^29zDT||c%J6%PRLsX9<RS%pI2Bi)Hh{(yD0C!
z$k*mApuA^Mf4eRU^Y+0vuD@?x80PJzyj|q`oabrYg5%@+`$>J6w+K49&In6}=KT;l
z?(ZPweVu%5-crh|_p!pf_Np*%34G)F``(qIZ`R>M>-i1xZSXwJJ3AroHsEo8TYO$&
z$<Vx88Q%i<>UHKV^0j%ZkXP@A^#6et=6dIbdE4NdpLTQ)dcLgbb(*6mAxFbGVUDFf
z#}bocI&|E(V#@K}Fgd1D-(IG5de@C%j^*%;yN~_%tkAcdd_N%H*`B9)ORM77X(4#r
zxAD-)Iu(`-?OTEIts>v0<ZJsjgZifbU%4=QR|~HTmGI3KLqD`{Z+M;Nn3j;^M5l|c
z9}PaorzXeo&~e{tDaW#5ax_zp_o;6qu?{eQ(d%%H@ZCm3;G^dFq0Z?v$AW|$XFFY#
zqtoYDZgNb4j&sygj?ah5F^|??FXgznDa_FY-?;nn&cBDgjpX|U`JUr>nm7N1`1Lm$
zJYIh(=w$r~ONOq$)s1g6`K};eyZ#nY-}L_t7v|TihU>2wzPV!PhxTo`*J+NbgdFEM
zUDUTpKF2pE$63&E-`Xh0x5MP<rM|sRef#69VUDTr-AY5?qvrTqSLoXTUzumQe_2Vs
zn|hw+ot=>PKd+>Hqr5FXudrlj-<Cngc{?fZPvmR+Hb8klro4wc-)O(J!8h)_fAHnd
zw}<lnLcRxhp62aI$h!`ByiS+;yu#wVqm6Gb<sE?woy?2OyUm;R#L)fP{-d2vv?Hg7
z&$pJtH?F_aFAkqa^^<QV`ThW%oL8E6%!K%TIl}3p{^md@bqh;|_V?$DLf=91{T=z*
zym`p0*Yg7?Z*ygsHxIsX&u4D%I?Yj%kYhcki*l6v9BY^y>p;irH0y|=`;x3-auiXH
zM!&9PZZ5;3lzG<o9ag}%R3^?3oxh8rW8WP3=0YR;a&7Wm$MK>ZvwaTH$WY#B!z%`F
z6#iX!>k!ZOqnvVFLpjdBB<#l=_{P0%aSn8xqm<?^n|#-IyeLPz&mkHan&bC|S3x<}
zC!WnwP5bEYw62<N2(ND)@V(YqrXTg3Tn9SNQ3YR2X?p%PAm6JzPuE}hiShgBhU>%Y
zTP1YT4`IpByw^g<z6~^gIpk~ePNTl*>%hYNb&s%b)$on$+qYh)IqDK}Ome!YZ_|B_
zO-+s(=r~6c<=AYP9F5dBeSKVVl+=g&Xa;=qWa9kLzI9#@?xPl3FL~s<v*&5vwuHRp
z;PH9Cz~>c~4DDN)@ol5LTa&NtTMPB=I@)hXUmEspA$$v+W#D@RbUe=;ly@8QeZ%ax
z6+VY(WN41p%zo=6UIFoJjs=wCddhJneoiBwe=FgOBPbf$x67g999`tQJ^8Ndc+vXH
zs&@NGG%_^D+J@Idym7>{Il3r^{=9!-F6#@|Up9Q>Uhn)EI?mBczA5rO-tnRw1wMyp
zWQeDXV+^m4csmo%=2%MmNdKP!Vcv(Y<8nVz@NG>yxd-*#5jxJ%58pCK<odBI`QG7q
zx{rFn!);nLl=m#&Kg0WIIdpRV2}_3Ro`Q~jQ%4S6e~Zc2=3Pm7Z=m(JOLutQuYhln
zvrIqg`g`K_@Z2qhuhb`b_afhIJx}xIPmIsIH+Y;k1)cDOB}4P>VSLLe?>^*f^Nx9P
z=sr=u{wB=M`@-h|#qh03JGuw;-2^(G=PLN-LLzzhBi|=HPxH=6$XnkU-WRv|yuy;9
zzSE#%-+IbhM!q(0KILtq{(d(%+?Va}-Nad@AGN<1LdU+1<a;pr_IsY@?McWx%ITv0
zyVU0umJH3CX?&Z>_fYb+c}pm-emzu}58fB9=jHG%PdmB?^-V#?dE2PJhm-GI&(plA
zlj7I&Q?228E`d(gv#?~S@8i(1Zx`jQAYYre5_$D`z)jTOA1(;<mch5cS*9Pgzh8Qt
z=BP`^k>PYv-=_N<$Cw<0e+_f=QjTMX$x%x=ZloL+e;lsU8Sq^#CdUQP@%;6}SI?m;
z^8I0HcwaKp=Maqy?Z>xEL*4-KCJ@i|V>)sOO3s7Xl;g$M!}Db}eEqlPiEZ>cLx<Bv
z^W5s|n`r7=03GKYr20-8roNdp&+>nTNM8B%(_7(snFrr8Da;R@m+zrt-^_}k^Y3Kx
zz1;Dl94mbe(a2EVC5D#=p7!lj;@Np_p&Uyo#~ojV>m}pQ@y~x}d7ZBN9O&Y%zrS<3
zC`UeYQr~2gV<dDuF9paU5?Kee!{k_i9P;%%(cMhzWkg1}UJBt`2%Qeyzc>FH_M@2Q
z?@aRj9y(lCqt`8}6Y}olbWz?~pI2Biv~S~#Zz<(Hn|y8Gx~XsfroMF@7T#ag!FLU3
znSRu~i=g9quAsc<knaVK7v-4lbBIQU<~Yyrs)%<U@obJh<PenfZ7~*(@Z{II?(4+S
z>lQQMEB)1>Icm+<ljr#Q{%Y!*WWJtUL-k!i^<A;1pFeNZ3SNhr;-luB44uqhiT}4+
z@T&29$#Eg^>OD{Et*MDW4~}rUsh4_Q8+3*Ey|84c@1e%Gi+rb(ubt-s+8=qeUh=L8
z*Gn&a`TC~5|F}F{F9k;peP73A<h!Bg>3J~f<oNR-1s?WMw63zDlk-4WGSs)w_?E&~
zBr?xekgv^~)iHD)Y(;rH8^XLf@QurR5Ol%*puAU-?-QP<dCS0yJO6qv3-ea^yuy;9
zdAp%w-&)GsNWM029_77@@*aC!n70bPh0ZeYZ9g{jt*5-#k?&!ir+FI_@~#UW_jk6>
zD=ZnBcWvX_M0sx@Uz@j>^0rXkiRXlQ=OpBPtS-#kLV0JA?=haIdAk$xt^*$D?e%$u
z#d${?-ww(<n|v?b++Tm)r)Ttm7kB<mbGqo<81%lk7~eYR_`K?ZuihWrO1^fUD=^P`
zU##!flip2!KD<B3JjI>kzTD_O>=fvDJ@-)F+sSt`#~V5iz?1q!BSY8A#)j8NIpz@0
z=9ok|?x6dFTiU}MISDy#gpPCcQ;xgI_i)FHauoO+qTw8e7~UY|m`gmHqn>gUP>$_C
z4evWs@GW+hf$yK7;~beskIcx0LeA4x@_pr#G%w0A)#nh64DH8D&@nF$JY84+AfC-J
zllJd+l;gQ8!~3;q@Xc|S>Bm+4?{|WZeGAC<pX9s1^K}0<ffsi^x6KG&KbYh53QLCO
zZH10~Q}7ju%-=lnwRu~qZ`)JeuFt~t*9u>6nfBGZi=boQQp)=X`5x|gQQsE$9HNn-
zISw(ra^lS=p3Tugebe{b3Uftf*tdo7#gP*Y%`p)=&QU?W3&{5~&(ps3ffv`ew?~G3
zTjBExONQos13LDtqP{&zzBX?U<-Lpgwx4-F;Y#>cILq{-=Dl<G(6<)8`aI=n^4;C@
zG;jH-@p(sp$Jd!k=w!bMONQqCdAHEFf$}~}zBX?^<<<8!3v=MZ@O-I;@9eardr;rA
zpyPRNf^R+~vOhY>_jAwFyekv(e*Hms4rNYqd4(lIeg6j?`*u*?m&n)V&3tO;`qo1I
z-SVq2Zx(!ac9!W!?e9ijr#VWYi(99ctO#?A_c>lRIWB~bb97OTu3>VFr5uHn<E&4@
z9F_2myDppo9sBmeHy25zZ?BW@Xvd4rmnNS>G%~aws~g@RczRt}Og!6<0_4#Bu><93
zuL;kWX86Xv&bl>poFns?A>SVI{fFnR;v3lkUR>X9|8uzC7Wurw;=H#&$G%zc6^YE>
zJLGHgmQvq#q`XU)h1Z2{_<GB<udcsd=-4-h^1esDCp%u$x1~OZXk=*LCK_HI@p_48
zb5v5_=2DKs-T53nk6#Yo&7EcXQFA=EN;rQ7<ogl%9^iS}x2)6R`?d>sd`^yqPS&5W
zWN6+Ujc<zj_6hmgyi+M}E9E^E=PrDsyt(j=yDmJxYnZnbzPj$0k?#qfr+MoV@@@eh
z=bi5J3QLCO-PHJ2QQqa`YxB;ay!!ng!aU!d&r#kP@NG>yx(D_Bt~WeiYT>Kbh5wT8
znVzS43n$0-_dM`8Z!vVzUt!5m-@h2&Cd&Ii^0j&A(7yZ!_4kV}!}GKhzA0y!e$@5+
zsn=<aX$d(Fbh>C?HuxN0nH>8;$NRj6a(pvPj&|e_l$=BNQjYg74WB1B!dKRx4$aZ+
zbWwdRzP|5FeO=ITeeI}E`XRpG4^v+!t*eLW`)5A6I;^h^z6-TDeAND41ReW!z_-x*
z{z$${JWu;kdwTr3+QjLiywjkQ9Kw>Jz8gZvzWvmXpUKy*t6s|cDCMo65$2r^-#KYV
z_n^LGp<~}c%A2u{t551Z+w(MUZf$(t1%C@)w<v&4K3`Ze)VCcv_ARI!y1tDhUz>M;
z@;**^Z@)6kn}Y8=XBqewLC3zu@GXQw*41k4>v@{DFCp*SZeF7PuJCz<B}4PRVdlA(
z@~+OlYmU&VN`HRV(?j<!9h5ionlSH5__n4$!#$|)?TumHddizczCS`I*BQ+_=ZyIN
z7CT*(w+%Y!udrmOZ;|nBqr7XAukCLh<$Z?oK6h1^w;jH5d8?q~{&rB_-;?hG&(pkB
zQ{waf=+;4$cM^1xS6DJM?{{Wh^;6#U$k*mAro7Kl-YU0`qU+#P_%3jkq3;!8-a*Pc
zmVA%!Jk6VbW_;cz@c25If===ZONQp1X?zQg9ooMek+02LL3v-IyxZXCYRmf5_mvjI
zw;}E59@KX+{vQ<XZ!vuHA(8#N3Hj!Fp5|SckhdN@&fDel3QLCiPBXqWly@`owRvkP
zuY8ZF@Z{H*uZMYi;2U?nY=(~W){$=>`7ZN3&D#%N-1Cn^oGx0=E1{GA3QLCOJrFwf
zZ6M#R$=Bv>pu8_rfAjG3y|}*_Q%7VpIm^KJ75uzT_HCm6ZbQBsdY<NO0xvG_x!`es
z=RhZUg(XAto^5<PDDSr9Yx6c!-g(sD7Z!(kTj3km-?O3Pyj|p5NWM>cp5|Sckar8G
zi~8H;^9qaeZfbmc$#+NcwRzhq@2k|`t=&9F`?m+aas7P_`;znaQ-60R-;F&_^G-S|
zzQ5<YeIDhlgHHM@EY5q5@y$MN=)BsMd~Mz?%KI?&_r310zxD8qdq4l*pyRxG<XcR>
z-JYj;XD8$>a=IvQi_a@8&YLp6De~Qmd~M!7%6kv>x9gYic}iPC-eaNTyrty35BWal
zd75`oLf+4R4xg9x_`Jg6yq`hGz7^!VANkt6gOs<O`djti@b!{j_~tpw^rJqX`SkPf
z^^zL+%KDS*Q5pFj;dz=j<LvnLJOw;Hud<*Mp0H%-c{SPi)>7Vs$=Bx1erD)?@)PRs
zC2pRh{hJNnxb?i2ndf@)J(PUU^E}O4n2`65!LYx@KCiGi@2${re;dj7aPqZz3n;Jt
z90HlcU;h*Kw-ml{{k;M@_HCyAR*>(vo~L;yCFEVl>7xBx=kp4S^Nu#YEtK~d^0j$O
zDX;u2NXaU{9vles*2A|Z?dTpvBjY&eIBz?A^YQnxo{uBnxt^zamnP(0-RYvd{XVa-
zWT@||#<!R9o<P1fZx!XOqP$Ok6XqRA$a@-eoVTCyR+DeL=V{)`zr^p~u}&A|t$|MV
zudrlj-fZKWef-e%=+ES9^VT7+o-gI}K7|jf+_^K-A5690*SQY)T3$Wz4k2C}=0SY^
z|MD7$S3$gWC;m3x6DPUXJN0~(9Ghtfe3W}g8Atr+bUU~|W?Tc^?2-Nt_#is@W%D*t
zeMeD!FHH#R%RkS}vl6v$me)kQqlx#$iT`iBX5t+~ygN_$f8(_fuZnnerXNXpZ~G+d
zhv;zGh=!~Y8S_2}bvr`0s{5z(qxQ|tUmMkT0@asq=C3HBA3uKWd~rObhv=&P@8yHk
zmy2H|zl8P8hOPjAuS0Vb{}AdHL6@x}d{mvy(M~xgP>w^Z!@l(<<gmOB;+;smRm?j5
zt-Ma+eTpYavYzGFCD?D0N%#40<#iG7Q95@=75Vw|8(4VSd)P$3w|RSr_X*XvwyAIF
zZ=Ang;yp(7HSQADC%oTMUmx+7QGI2mzP{gBUqA5{P<=0(`h@pe>Kh<lAJzA^+2_lD
zV||0f)1Qwd>*Y{WpYVQ5eVGe~u3MF~p68kU(f=Fk%Oc*f#H%s;BZ*h>u3HCs{a68C
zd#*_?yH2yo_c-#s%A8k&zcEJ+@s20np60y&t-L(qRTHnx+#mc_UIFnY67R3({ve6>
z-@U@~RCIbRmGeM<|J0tLE@N7}Zh_%tCg?s$g}hM-y6>=mrO$f5k(Hp^xFpn#Nzm=E
zbEwNs&|ReGq)Y<F*aTg#=jp9Y4s?7y()n8go!rNk2n-_+_mlE^liat@rTfVf@%nK3
zyicn#G71xXzq{AvP+!sI`p=OM>iacx>{|?9{d!6(`7XaS<c&|@^+CtHTH^hKcv~X}
z_ibuIj&*kmb#)24{Y^inCFtgu{?;exCK=uI1l^z9`$3}h*N~uVFga!<=zcW1#suBL
zMmIA-_n?`VrUc#kdR_2qWOjn?--g$mp!-127tfmmo!)!#`deGi$^Q@CrRIDQo~~i$
z?O@h@3v?;ZX5DsX-8W;MRze{A?MYgv*FEU2k9xi=0gsKfhTYuvn`Y>KTT&nIyR-j(
z(-L3P0Qo*mz6F<s`z`Cj_@C2}4;}Bfa$F~-`5X(0x2Ik|yzhAM;`%WI_3-(Uq$|8U
ztWR`uZs^c?DS(da>qH&nA(DCSr20CI@AQQFvVNm(gvp!4JLos^{`wnvWoF$c`R;dB
zIDewc*U7_2oxi=I<N3?Rekt+u*G2QU%gG_HHG#Jybj+(D-fP5Lr{D4P{;C_iX<C%8
zPySeI_FEa=_Ys$4lG$%f<hz)BCz$KZ)CAsf<~q|uyf=xr(4UjKFK2@ncm3^vj^`yC
z_n~_IeT#T`roJ}tN-+;Qbc%9KeFfm@zI=yx-(3;*Z3TF7`{--vxV{$fbRWG-ycf;B
z%*FQ)#qpjq`*MJI?-Os(oI~Ricq`30REqm)t?vWkO)z<<C-9Cld7Fs$5%F$p2<LBJ
z0`CUsc>el`_c8JMUkrIm6L`y^V_pi+gEa4_#Jl9BkT(Y39~Re-3!!6P1M!v-Z)d|R
zN#N~Zcs<1XH}PIEyr~Jimkcit&r3D$e~355td}_nyvb(0$m?0k`!Det{}#?)cLHw)
zbUc5Z#QTDHIqv&9qU&_V<?;O(>%Xs~#Bc2ElZNX1l6d1^3+t2bPmJqtIdoiK4e`Dr
z-rPkYuR4KuCv?nfC*C*2yV=w?Gl4hD)R+0^p}gM`?|-Jgg$caRO??%_`<{58n)+5G
z@IEs2wGi(I;uZZXoWESW&n2!ODd>3q28j0)@gBY`<c&|@Jpdi^O7VVjUC%!gZ{m!Q
zH$8!O0(8u4BHpjWTWt2nyae8>W`Fb%Zv^he<hmvIefIT|6kb2T%Tek3wLj782bov<
z9R9|5DSUIG)1lYF4Co|>K0!+1{zLj9_kWqg_?D1w0r`H1&zI+o`g&&u-WQdNKkHE6
zuc2e#8uI<!FuvvFyEFOT{zB-R3*Qno#YgqM1v>U^g6~xPyX0MC7~e|r-GzL&dM@;>
zPVn6vI`+*xWyp8*Fupb9TSUH}JRkbbfp6UNs1KoI-#Yl}^QbYy_)aC?UCDRy!qB%T
z!S@vC*td&(*B!>Uo_zNq-!*VO=XEs-@As^T>F;XLv2Wg~BQs|B{;ofa?+o(Ymwaz9
z{jEyyz1H-%jeIv4#<z)l?;zjvOx}6$m368^*YjUY-qfU#>GxgBdd?ZfcMkd9Nxr|D
zyt#PaWt{I%Chq|GZaR!_8~HZV>+*+ohW(uhU%9{6p?MF2j{Dnw+Q{_zB6&9-#&-ev
z-bTJ}oAun9;QNMI&pqV3<uJaT<a;;G^OGj;!UW&POx^+V%^$|Mn|$Yz@4nB5^SmU%
zcQ5F8p0g(p&GVmz@$Dtw-N<)a|8s!!y08MiMcQ0^)c*d_{CuAje5>*A(%<cd@m)^7
zyOZywxR2m-BOmWej`O_;I?mffzT<}R9U$Lg@_p9-JY>yVo#6WvbnH7ozNuk+GoBr~
z?(adq>n{rP&Q9?CJ#_3_ar)3a?=p;U7Wv*pzGs>Kb|?6rVfx!nzPk<MJC=NJCf^rL
ze@Ef_JmUKMoat|N?NHu5hVjiK-&@IdRlP6v_g5tez9am7vEE<Rk#ET`zJ=s_8~Gk*
z`a3Pb_h{4K9`fCH7~f*@-III^&HdFp`11Gp>;5e;_gASihTh+_|1iE~<hvL7E->d+
zSAuW5Ij^e7_rPI%E6BHmeCu%E#OKEH1mCI9@jhxG-|}I6tI2n7@*R98^v%TgdBn~0
zO6b_PjeHLq#<!MyOUd`rt3uyg_~zo=)uH{p2s-xdfv-MaIAR#zY2>>f`PSk7o9DSC
z!FMWj?3+1d$oHsWd>hDjCiy;eZ|GZ{;QLSL*f&MKmBaYXB;V`F_wGwW-{}dycR<I!
zHROBzFuu*?do}s)@wd=-4t%9=I<&vLLdU*M@Es44Tz@AF<J(HUv&i?n%R}Gp1mC|v
z$G&~!J8>A_cJgf`-?gp?eKYX=Tyc5VfR24rXAb498OC=Z`Cdc5_ZZ*81mC-iZv*+B
zI*e}@`Cd!D`!$4ls}p?phK}?0kniMSe3y{#b>#bz@tv9A`@Zqbn>sYlXOQn<Yq+m_
z>DL1mg4e2x6d!e+uJ;>toiVyxIdJ??-i+U<yR!BFt}j<%_$aT@$k;wc$2nAIU(e~I
zdEShkr#xfMXPK9{=lf5Z^SKW5T#0&Q|DH?pY<*Xd@0R5IkU5_R;9Htb=pJ<b{%OwV
zF8EIKzUPzgud9diS9I-&jQSYf$Nvkz&M7+K>CpK*_w(PT`*zv?t(&Sad{o|ukN<Do
zq!`_o$T6b)*E8`?)8(I~J|6m~r~UuCsb`Pq?jWJ)<k$U$;rqPaN#Om8b&9<al`cB|
z`5@|BGI|xg<xIN`qQAK#oyV2_`x3_BU(PuBj5E(Zf4eic&vm2Ff0PgI_wI4$R4V;1
zMZ1jK*-5I`xOl(v{YQ*YN6C?&&XP97L#F$I=c~GPnxAn9{`J@Ie|bj!ecrrz)2Gir
zbASB#*Qb_GFVVjr)o|1F5oOa#ryh{;jK8%`Yw_pwkk9+&!}#BK&tK)iOC~+@&GFZr
z^-#uFqejT@4qu+J{gIpOy&RjRVCDbe?p@&HtjhfHGc#$MrUlY)D<za^XiJ*5A(NzS
zilAwmOj8JL=mpAkGEJtPDY-G3v?){xH!TQS6y2h@*6Y?4wME3D)YKoSMbS+a-RiO$
zSJsxxx&=|QF1!4`-*b8Ayl-ZbOu*mYzt3mRJnuQ@Ip61b&N=USZ|6PlQKtA03>@;s
zCnpY_7^ux(x$N(Jx9{J7%3TUk{S#+J+;<+OuP;9R$He&9@`<uEkXD@ggzp0XVE^wg
z`k=T#%s)L$xt9h84vFBvp-gxpsH~^$B5piYb>NK;LboqG6*VB@BJSHAmo?;jDF3os
z>Wbn;@q1y%#8u+t`C><%@8v#m-yznZ=wATSxxNZ^HA$?;p|9nArJy0NL}3MX`ycS_
z^M8TzfrlnIczOMK`}-uyY)|=<UkiNYilMwi#qs-==l|r)cyvbioZ98ScUIKapL_pu
z-_J$RKNvl?u=$+k8;0_}dGgQ-*5w!b`jiFgpLIE{;q-9c{K-GLawzZe<ty^uQMcl*
zm(FOdTd}G3_s4znClC1N=M4nrPd@to-aB3jEWe!pC6jxvto8l3c<qjt)`l8Z^u07t
zF>vT3FCM)vWBqQ5wnnzcqBljlQc0~m51jin?~SvcpMfwPf#=de1o~Qvz<T4p$v#?x
zz<sF}p$?$|p%I}8VLie|gzFKS5n2&AF0>(ZA*2vEKJ7$!TWDEFYqB%Z8Y~S}ELv1q
zQCYJfxGCBlYYldG1e4V@OO{kGX`L5rX^VDj32uueyAwzcEh(=kuMC#PQ>m`*i!Zt;
zsxZp8barlOi*<MQBwJ$TEuHNbr8+y?TH?_}$3<;z+u9d)B|EpqT2jH*rJHM(Zmw<(
zEnd91s&!FCs4}*wrDAFI(nXuAHdR%`T4GhLl~s!?=ZR(SfRoW!bW=k3LfBkUSzfVJ
zOe~nREZ;ZTUl5q;J5`+KEA&nC7v-JdJ5!t;nC?5rH^X1zo2$kk);SASB2*!86j_RJ
zF#@sK4kJ+jqu_(~Lb)6jEeeQ9;ucr_Br6xsComhe)0IC(v?9(vqiBk_W}@1{=??6B
zr%qQaAWjq4xXR<8X;A=s;%ZmE*)vV~GsOy5{+U*3+BaR)xboS1(-aWrq$Ai0pl2_1
z$rpR_&-28CqQoU1^yFV4KH$o~z>|NWNV)Pa^yJSM30MAnaU<f~#}v&M0bRd+Nbrew
z>2$?-b+^t{zCtu0&VHjPy~TI{d+?<$dG66^3W!DN2(|*~ZIv$hrQ$-wxxXu7Z%k7_
z_DnnO?GIl2mx+lOgxIgaM3EmBa6?le_&4za2lKgI<ewzBb+#zP!SAPtFn_AdpCWdl
zi!;vSVv+weaj7n^;zi>3TAzxaDgKNN%Cjbl{L{rXI?jEo$X_gOMg22h*%uUeC0)kZ
zEJgkc!~|=Xp^bPY+{(XDoYd`yEa}4raN^Y=6#3_ir?4|I&NeUcSBPgl@{Q@8O_u*4
z^ijS^$}bhObomOzi~QB%5AwoA$xQQKDz4P=Gmt;czg+yQ2Y-sr=bkXlUnf4~k`Igh
zy1tbE0dbp-tNJ@lywg+Pt33ID6*Cv|AMd-vaN-mo&i0yl5mS*447wT6zLx2icFMFZ
zWqMM483!3q8HN$!nD^()Fl@*;on$(O3EDSP??`25>o^BaP#J~=jx+^mWR9%`m#X@2
zMt5bqlh=X=X5tT2cCL`$r71x7U4S^{S>Kdnzab};ov(R`wr94E&(ZNx6-Tp6d&%iC
zIqQR*eTbZ{kaI*MXZw%`H77LVge0e3<g|;Nc9F9R$mth(t>$%_H)!6dd6VYrHQ%WD
z^_n+p-l}<A^ES=9G*4;XtNBjNrN20+Nq<rK(%%)j9!xq8b|zic0~RTi^<d=StSn!y
z<thLkxwf^fX`3id#@fo4t-Yc=)|+VUEl<UIQ{|CsSFcM|h9Zrtmak}PiY!~cDzbXn
z74_?ymaV7{RYoFPVyQ@XSERisRo`^Eh8TCj;kqv$LAiZaR=qtQP1Sq!kE`%-8?u^E
z6Va|O?&)ajY`Mv+Kj(tu(Oo@0&8}iO=nXA})A49Brq765I(s@&4wwQ;MK_J1^Na|T
zYfsDs7OIX!fD^-6tvq{Y^So69GhmLmhh(y=uF`arT<RUp=z5n`K0c62d!I=|jA4fz
zR#3XVG}hY^>q_C;K!W976(Ll`h^4%4k6OU(BE@qa)-pC)#dwgs){hIs?U4hKYop16
zEF^e|)*kD?26wa8Xex?fKBsZMz8V95w<vE*blen6F6@+D0C9HcXeyOVZ0bqH5N|B+
z#uan<mSks7SGIN-VU*6)5TPn{&}qe<or)#v*P{H=)Q+xLB+;?CQ(!MiMO$u)w8U?U
zY>p<{kkHZ_jdb-SW07r%WU43HCc0AbWDJ+|@FCV4QDe6!k%Ouz@90d$%2%%5uux)V
zb0F(5kHaQ(B=M_^bS5J$iPVmGv^&0PYvb0c%KG}2HXbs!<}@gc6*9;1b5XP{v8AJa
z>(;eR+t%i0k*BC#|66*Z$yUKGfFlC<j&{j2+m^i>RLe?3RiVa~FWDAaQUR)8R~b<a
zV)lb^1IQhKMkPD3AFRJ>gcF`j9kSlqjmC!J85ME|aE%BkzNx!=#1pl~8g%u@ChQl~
z)v5RR5&W!*wqXy5rqFAn$u0F_cB*`-nB7_)s^O;m3oYTM{0lASCjKC>h@0{+RLxEN
zA+?JC_)C?CD)}$}LLr&pScHBODpzS0%;A~onCV8G9OF{Rq4*Sh_sP2c=5-(GC4Eh6
zF6DTxZ&RL$V1s3BIVTV4yhb9u0j0dus%3<P2+z|S5oiy~Fn$OT;5pyr;I#$Qjm-x8
z2@hVrg~v-fgZDL$AGOHidA}iJ-vP+k_7x&RIoij|Z-bXqc#eHd$fJGc65ZI>;lT@9
z_EC?)`zLJM^~Y-=UUwKWct1dbZC|N{hbDCJc46DDzgEO)A7w}e?=EcHcoh~NFM%n?
za(Mjhvabzkrp~bGZ1;NFtqXZ9Z|=q!y(v$-)mVC2-$w5ePrJ!$JmecPHZ1hC2d@FC
zm)G7Tqj#RCJ!&nzr)xQu`wtYb+v6^z8C}?Pwtu7KoPMwic`T3H0+Nj0Utz<p=LSnJ
zAIngV<z9ypTkme9+54Qa;Uz6+;!i^^Q-ArWl5^}E(0X`{OEUK1GuSTsnqVK>f&HHA
zVj26^X}xAYKZZPB?;A4qtkQBOeg>S%WFITi?x#USSP#V-(Af6|((U?dw(R4r6JuWw
z41=gM4wWKeFbHYvxk<@6^|C<g4N?eX%4~t0t+xvi+Q)jCrR5lZ2IcW{^j0Hc>Ilh>
z-tQpY#_P54E`Xfz1JjFL^>PW~)I%APu@A5JxbXTcyg6Eq<<=-X$EG^OGud~!2XB{!
zccFzhRpB}H*N8avP=;je%lF{zw(#a@IcXoZA?nzK<q$JI*S;JwfDp9^q&<j~g0ns5
zBbfSQUju|=-yTG$hcYC`K5W}~hY_J1@pvoI;5DPNrXg;q1{u6xL^<|<$}t>5Vd;nN
zXnPT<LAoKzke+}X^_q@x1d$-3#H&D{9PLOdJZF8aW7-eOkPKdj2k(UC2k$!?ymJ+v
zQ_q9IGg!nk`^PjbXX3p7%{nz?^!^M7JU}@0TnsrBb;c|s_hZP>-&zfD5)m`L@Vg+!
zK5soYBE!@(@90yG;U1;eS-)>K^fn>g5M@ZWX*siwSt^Sk3ydGgC-s5T5A)Q);FW4W
zoQlFZlktPk$tcHi{{jC{FOJwQ;4yB<Y~P0R+-4h*?tz@X^(^DeWB4C^9K>N$(jLh5
z>1{G&-+y_IZ-qRk0|5J#sXy9h`nkcIj*UK~8!~ux+7DZf?P18s)j|$GQL8fwaiYOv
z4D~KYpd9u7FaGF{!CQb0Gu9*7@#D{sv++uSSBiY%)oD56-R-fj0eG40yWL}7lVxAn
z!dr^{+@42**VtV|+es&NdzgKPa-URL@}F`H({=wdS^u2{Zx!?+tIL+NkE=%SW;l(e
zcc>W^yBC4^3lLb(?2i|P7B5lrLe&3g^GGTe*DO{uN=BbYa*PcigfoxiIJDbyKsa9{
zucB+Ev6J&Gn3nHJ^UGNkoUPHd67EZ)Z2o1U^p?8({z5t9W9<oX{_+#3ocaHCG+)l`
z;9L~bXDF}dMcm&P7V)X!_<?~JMfA>i?F{kiRDUr3op><3Z{?98(OeNec^oq%-hc8C
z9+1nq5rutPtz^#p3e1j}5Z=?DH#<LmXMCVIcrqYL!a$pt9}b20ti1i4viP#0sSD>d
zfBQvWUiP^b#;!crwIcrE<#_|#5~V{&PZ_*(#=wy13%ojY!kzK__;=&^;c4Nr@cxxg
zBXuMjj}-f6`Ti_U+VgLY6kGFI68U9;W4;UStbJ&?_<7gL2bS;ZF9<iy{C2(wig|w=
z@KvnJ|MPL>HS3P^LC$Ox7aV@kU$wI?zxwctV)@Y*#RXq|wQtQi;nMy!C;OJ=&)d_V
zKTFKd?_cwJ-?YjDr<M7R6_(@;KKh5g^L;-@TG8@oeu?jbdzbrv?5kQU{(L+T#q67Y
z?yH&Rha7z|Zx&|kR0jU+e+~MIY+p>BEsN)c^D8(vW-xy6z;i=rskvfKef^|g4927J
ziaO@xFZM0^!|~?$b1w#p0`VV<e~sr|uy3UZ4s!krT6u&vW?u;&8Ojq=!^eg&bL6e|
znfuQQpAycKbAx6jb}cVBn)hnHh{nspRbkq4=)_4mqpB}F7~gn6ynICX!)u4~&OdM<
zKVI0JFJ(?1YK}i6{P7RR^Gf!toRttIf$(7SGeXS!?Z9tN_)GGa{?~C|{G0=q#qXIh
zH6#Y{IQG>*;ODje0pH6HOqe)`c8JdUbKnn!3-|OF&S5VJyvEi;+8?9w*2H7WYx?Jg
zzr4J(zdZanS`Kaddf!<S{~Y+eZDF=LTlk`w(ihH;7l+Rb=a;NGnLqi?_@LY~?EM0D
z8GK|p_YLfCh1feLPx<+=p}fMf@Pp|6>(05o>GtU}!b8VV^M!{_h$$xz)yw^Gf1m1+
z>i<d1lbVYCVMcg@tkHR>(TPVB@d>EY5}ESkp%>%6mk*0&@mbAv%}-)~R{d<sT{ces
zjQxM^J6Su~?qB=S-|OOS2Ljj==ghbt^Qf9<T)8~IHhS*u%l*gl4{U7Sk9lMJ^}I1R
z9?J&8weg2DmfWLDX12xj>xtpKiZjqx*nbNTsD4_Js5vk%tUME?uOF>Qpml?J3pfJ3
zSUl@wz~_6lFu(A?GK^^x2D{>~#`9+cDmW??R&<^$_Vv}5gncj9`Y5@lpR!#EU;O>?
zWf-f(%lW>_#Im8ng$3t@qNo3#{4h1yEuMKS<hYO*&Xc2dusJC04Tc8}O+^J~+NZP4
z9klDdHbZ;7U3#*$bzXQ<!<;aWJ-+X7pJct4YH!fe{k-<h)OWJ^V~!Db?VlJvy@4%h
zX7l-i_YdWZit~KCspG1l{L@&|cg8Ew3VC7QKBfltOj@<0ZgPBb{PyL({$Mz7KUxAa
z^_VC6c^<-R?M(CbsCVIuC#U2=>z?of(0VG5CGo&+r8lVcu7}=G__FYdusZG;y%Qb1
zdHsh@oQ6G5>ExlDb&zR4ghW5G<a|#apS<xIPKuVv(7ty2+vQFD5}$J;ZMjTsY3e->
z`(OTn!T8?hV4|6$_LWb`BYmO2IWaN*$N2u0bE2i;S9zRAy=JaU)#t>H!UI9h{(O`D
zI#ZvXJg=soHrsYjE>mgg+R*bx>B#>Ni06kqZ)OmG<8vB$?Pkwk<T>&R1oruQ1nzH4
zy8+=wga|@2LKK1NEeNd$F@((sOp7BV5Vq=g8+bcHhmP|E{$_+ELN`JRf#tR#Y)9xt
z*nz;bTM>35yj#a_1Mfq)9pMgyI}s>%H^O@n-iNRYfob<5ydU8{g!>UbfWY+K2oE59
z2;svB4<a!AqX>V8um|BG1g3o);bDYNApAW7)Ak~K3gOcTpFv>S=MX-R@DDov2>6!}
zzKrk{opu2HQG~A|Jf_ng2md<4K^^}F_%{)r)bVeDbAUOF@NER@dJ5rbgzq4H7vXyd
zOvibU_&&l95S~R~+K&);-+Tb!C<4=dg7BQ){u%f`BaB3xxB96IZHa&#LGDEH9#{TE
zaUJ4v|B;dt#RsOUB4j=>s3Q75APPi{t9*et(^Z}q=xGXwQ^jj@({X|LKOwGFAmda!
z6ZRE}M_uwo;v<O9cBG1&Ep7xb+V{HT&+_D-?TOD2A9vZ$BUG9K;@oruTLH{^?{&%Z
z?rfR@;{0?3Tez|k8(i`wp8PqY(v?5QlV2)MbLE$M^5=_JT>j1%&mexiBQ@XI;zmH;
z^-Cvl-s>Z-@)hY!DPJW%=*qA1<S+8Xmx`oI-rQkQV#DXPUMfD~^6yd)-n%^U6(Z@9
zU*XBG^Tbz*H7@y;p8Qpwc%xY0l5h0nuMv}7`D;A+O`iBV@mp7Ytn=ir_r$LjPr2l;
z_T*pViQgbT?~=bk+=KXZM~b6=nga4DV8>fTo2z_FIuly~91%X~@|Q=5GzIWRLYphU
zEuD!it~#^ImER@iBA&Ld%OlStOPT^WvIJb^x1}?&6~Iwu&}Bc5I%&czTXD#hf1B8g
zczXQcQ7KIUd33VlcZ)k+<?l{sVk>|n)n-@zz2Y9&o8JF;Bui639?|UhZn4?r-)^x2
z@r{niZfA=d0eR$0Ck1fi3%bgGG@U8sKQ8{qWgm}<X$pwF;uo&`z3EJB1#ooyx-0*4
zp8S2{W3K#tp8Q9|yIuK@c=8X3W>-Fsv}p>6$Hkp4{~k|gVk;oNA(~zJJPM~NAigCo
zb>;J@oTh+0Lfi4D#0-}_kJxDn$RoEMe@6VtWj~MPX$s&d{+uhHNA)xX#GpvvV9R4W
z?<aEJ{(2mu8Rs#v$UjjmLPk1XAiksHg);wC@hu!un9n0ak-td%>ns(ol<~7fGY(<Q
zzeL7oh?}OV_&a5MrsykHaUQ9Q{3YT=9nX{TIpXhdh-G=YQRFWbH{cM*c(aVp7eCa8
zEEL1M_ha(S2j=t0T!eY}A3=n1j-*BYDseQZ;yiaP@h=tc#9+Yu0hxcP2;&gU`1LY>
zg}4R}*BMv-tQ7gs$GEb$QS3Zj#g+eS#4Ts2xUzShn2SR`<v)f{<iA?n1;-ety(Rt|
z#OnZJe6fswOT63V&o9LP==NcKm-t)cH7qtI@ww3=oU*VyHjy6}XJc?-oc5LY+eGgK
zTVI#>`^hS<@V1E$xa4mY`q`~)&l3M_;*p5}(!?@B-Jeu_|5DUy`xV~ZV#7HKzZJ42
z{(Hq2O<{1#{Ar5HM>Qe;De*WvnkMG2IM2kC{7xj&pJs#-|88-rt`Afr;vW^KoTc)S
zjQGbz1q`D+VN3kai0_}G;;KIO3a$sje4go*_<tlGy1>r=oY<@TKkKu|zfZ&`seGmH
z5wQl74_IF5J0Q0al|=jVv_91ykBeC@{BPihkS5B%Wc!ao5l?)TC;mNMKdk>*{-20#
zuK3TyOnpkI+UI%kJ-a;0`~>Yu`;C7;@a#{>lJ9rWKl9F#^InJU3uUMi!aDh=Ty&#!
z9Cbh{gM+L$zSlu2!@eTpdICoo+D^vx0h#Y}NI8AlTL#~*M?zqiPKT{hzC_1Sw`|9P
z+tv6}@P3_+eMrjbv9zpI$IG<*dtnPiXWpT%cV^zN%i(lYmRqRf<vL!W{4GE^R&T+b
zIzOcI^=WBYwNA&*EOBad9H*f&{tnfr3wEpeDtJI$JI(|rm0hCcFgUVr6g;TTRRSN8
z*`n-SI)Az11s_&+&HOu^ze4kR%~xuido_-!N1S#_dm1$k1}C<sgL8#0kJC%;rv=Ez
zuqX=tUbpinb^etaXT8Sxga>DX_Vd%~UO~ZUgt&@0pH=PJ{5iE>latDDx+(3tc6hn9
z$Y(j8n^2zp!YOy1E_WjmL5?30l|J(eD!nYK=0MEUgHl<GPLFB6MRBKmLi@E}=ij7x
zyXKvm->mg_>wfZ8ou1O^+q4~zsc~cG*L41NosRayE+l3?uG4oYIscawp8p?IJ7PGJ
z?cx7N)t>%GJaS*wa$nJM2ejOyT28k!hDq7K{P$_O4`{iEwVdu(7+#g!hqT-tE%%T|
z?@lfE4J`-GUD^+xPp<ogf3KGNl$QIvmiwUc+kdO75C7M7xr0cLT)Qq6S`vw1o^<DS
z%o}Zu$oZh0sz1_;LfL2FR&})}D{Fc>x_5N60J9@;3*H~;!b`$<K|{SZyhP6-$1MAi
z-UnDD=WM6nw;5g5c{e5VwBxLkx5r>I5czV6c`?9DM1Gqfb9hxHcUyCK^F)GIbo8{f
zMbu&rPMhWC_=pfW+r#(HT4S4|J#DG++A|VFj`oC>cEq;B9=?(=K66Gy$km!fo`y=l
z>60T;<)ZdZyaa(Awk5KuXY=M*((x{hIktX38j`YXOs|f~9yuD`+rGQ!>hOreodV0%
z=P^Kz$L+=0hvi(I9u+EAmq!B}{Qyum+ACx1PN8AD%y`}$lO1z$B$8>cj3nB->c;-^
z*4UwP+@-7V(yldFc}9wHSeXl8j<ybO6{iAoL>g%zb1>iXK;|IjYTd{?wgWph1IGxK
ztBoV=i8)$0Ca7HP%YHyuqEFP)FOTK+Ch#c7n~d-|j>Dl)Pe<bBo>+u09<ExwE}~9!
z>+9<(T~-rz)Lt-FFjd22I^>QOlD4JaFIATdxRwaX_X{K2qHU2B&hI<6Z}lb)dzF-)
z$`{qj8zWc5l3QY}E899ZMcXpGWvX5;wck9<_U5PejZSHbdVeq1?l!_OAF68Y#L1w3
zhb~s%v~4Tism!rQu+xn`v}RW|YA<=K3UaNm?E7bSCvw#>;?S2}&6w(H<m=bW;5qDJ
za*!FP{kc}t2;*;NKgKldNDp#`&b5kiRxpnJZj`3R8C0}2-q|AWV1yP$BA(rS^}344
zuu~U33gqhU$UWk%SdwGCaN&=(#HN<6E^BB@ADhx++^9R#n30Be>$h@;iL2GfTTY3N
z)>tpzbsyJ|Ji>`&Wkm#Q5F}Cw9OYVL-7U#P7ha&QME^)7cc?pPQQRKboa}7J@&r8{
zH%S|E?GV|A(edfeu^Y&pJi85CA4U2W+1!c66aF81pR4Ba_&w4wKZHTRIpUknHR`^g
z#?0(jjG>IM!*`4k?>Ua)G$Ny#F<C!e@Em;@VZX~<M`JQRC)BrZPt9y`t~E09p<(<j
zI?B;+7;vujG7h_Qt(uWe5{B8&kzj1SB`4Tit0gD!@r+(0*E^1mn-jhIu}mcv*)f9|
zj%o6Skve2GWj?v#fS0Soe`$OEB6Vb)_@R#MG5`N%&5X;69P5J*0QCu<=?dx7y)hr)
z#)L9__kK$!dN5p`=xyT7lt?!oHr6Myo$S38MU~iR+B&yXX3%Eej2K}Vq_HnOG}?(m
z&Wi{UaP(vMxL}80`(&&A5l>r2J`Sy@#L{1KFshV|ZJr-z*$tHiV;km29GG&}`?d~?
zxoRKj@rdkFBl{W}M;#B}ncqSy^P(+%SmN4m7{%m@j#!GlK5JXQt#v+58*&_OM{f<<
z;U4(^zp0CH*f5^DsOZl0h(BwSQ^nYJ?{NSR@6)3kH%7ZsOms(LH)AbAvwwLXKk9Ke
zSG}VT=<?FzFQk36tEs<~+7ZXFzo^5bowJY8;~Y-|vfq9g*Wr5P<Lvk#N2nONnqW1S
z6HJv?$^T0EACmv_uUalJScU)A@=CSXpxl<5)mU;6YYEDQ2P@U`gYsYgRm+tKtK@&B
zT98ow%Y;R8S;A`hUnT!5)k1~xU;U{y3*~>6{I8V%T+6VPYZ+o~L%ED$wOY|oZda;>
z4duW5TZH8eAuSg<tdjqg@}FxT!Xt?y*Ey_~|5ft8QmuTb{-p>OK?I6i3b9K5SIYm8
z{KxdzG1CUj=?z%Y6^MWS!gK=XCX+74gj8<pDaX#5M=}$CoF__Z!30CEoL^<hf3tm!
zl5^HlszEO2CK_7|-UcLMioB>rAnnCOM#}vbfiet?uSP*zZ!OX|ht`n6y9{zR-aZSD
zz8O5cdO<wLzDDFxkMZB&{VyD{@%CGIls9-6LC&@hQ*<-hH{XMI(8A-KRD<_#0JH6D
zMjrK1hGgvfC4_AI4qJGvAA`pa9@+NAk;ggDh78^}J@y^3@HqF|;3XBFQ-8h4qkWVi
z8N3b;-hhQi{RZz~iQB$D<dq^AGI)<c&i411g~w^{25*DHbL`uPJlaPYlEJ&ugEwg5
zouTDe?w@D5?c)^XN(4iGz41dWXW}m)JySnjrQ{s@PC|})&eAx>zIw>n{+@t+tT*l-
z*mV58_FT7pL&(GQc882TO<K;xxwc;>`@TOz;yL!!LXP$!S(35uyGXF@8?x*xh9u=!
zE;h|=Ujy(k?cO0{&vjbP#CK(}?<gt(S&n@VYWrqtL}T9%A!pl{k9QtS{RJUw?7IcV
z0>at<A4bINYlJlRbSXJU?>?=!ghC*rw+(W(-s#ZGdSJU<pye3<jYsc(;28{LJ9>Za
z(fgRzJBLCbQ|6~0y+KRwTrEev4`4?CgyZj%h%n!f@%Md7&hhsJt+!MQ8ohTy&i1#|
z(mM~bl%w9O@lJ`Y_Z38%k#5M~{S*yp<5gIAcx}YNyF%j`dmFKlsXt#0Jg9Q~*a$h=
zLoAZfyUwGx26|0@Dc5o=cM*c^M>FtH1r8Z|*gm%2l-66JC5_%$h}-@)SpJ5PXX@{R
z0JHV(1YV=YA~Sj`A!Oq<S$<Smcz0_&Q|<^hGS%PDQ3j$;{XGXc)&sFf#*d$3+t%A`
z>0PYlSnexOf?eIAr?InfyygD!egxt%{2-|P)doHfelgMw>16Tkppr9dBXSMEOnzLd
z<eW7qXG4zmEJYw0Kb8iSAErXPEI;0%<yfu;<DK0eTmx_b>4uDbKRw%BFMYs6QR(lc
z;M7aJa*b!oagFIreryAt-5&V>V0mJZj2}sl-aVEdwOWqlyzOz!YLEN195HLvalu)u
zvJi>aBi)d(d$E=??a>CgOn!VG_DDZ;!CuJGo)sF9I!T{~9Q&1NkA0RO^+={1%dI=j
z-5!0&s6@IUW8W({QL+2!K?`psgbm&*jc3X|hKx*p+ygwjJq|;T_7ICiJks4By+<s)
zmm%Ni^<&_$`_&O-ph+Au_6*H->wOM#)Z3^fiAQ=Ja<;$6pqFyo-}w3&<rv>~x?At_
z$S6g+A)~iV%b9rIgv|Bwis$%I2s!FmqXCV5Cp^cGL91S_gsibIg+aoum+8REbllpi
z<&1r`S?oKh{BXv#Ms43ZkA1H|&aS_cmVJ2b&ap43_Dkoux*m8R(^zE2p2IlNv+;Oh
zWyXW6ExfZdo+-z*Iy3dZR^ZwF?+xt-u}G$#n>~7`L$5i$U908TKHl-*6?8sh--opv
zG2eqf*&f=!yos6DKrMqD{WTR(YU#Z}<56!)<C$?I2)s=G{sQBo^jGU$06CT?7Kyfz
zeg-*PZ;hq58TpjU<Zs@T^zrDUT8^@Rg0SsxHT1In44HQNJ>+b?4VK;(2phehQFzYr
zs80Jq8ItkilODW{z(bPUe`8vXac{d#haaYW_h>m{UZln=XB=;YUSm75o$WbhT+^9N
z+P*l2K*qjVdR#LFn=ShiS}v1)TnpFO_mGw&=Cs-Fdfo`Vna00KO3tajR&8G!Fi6I}
z0OaiUh+FpY^-{`ZvabgAnSTE<Ek{}X%><|Z+MpMw-VPbP=VCv!^>#t8@wW@oMsFN)
z>{q7W?*d+?e$V58-R~dN{t}C1^gfLZTW_DGw_D3)@|SA~oAa=bYdK<aZF0NcKMcL}
z!;tAa4?@n?yW7&c4Z_5t-en5UX*aHWz;w!xj31YJ@b&_aa=%6B)pD8qXtny)!&;7*
zyJoxncno?o^{e+NImf=k+P+(XK{EE;0y*2?eU^PYwOl6qQdYnEgq9;_40`N(K7x2D
z(hV8Cg-Eyc?uTB}Pj7=T<*4^Mjc585zpI(4U-hg0=lJ^u<XE0qB%_z#6}9yqvD)_z
zEtkpP`>cMoSIZIeVpP8EZ{DQL{c17fY`w=Uy?0xB{~bd1{&5EIXb)vb#*be^&c-`o
zwcGo&TqZyETJ82JEl12XI3KY6D2Covq#H7Ne}_i0^`3;@QV9JP;a&vFQE$D*Gws#~
zyiD!(0Pt*o@6-Mgi)8fP@6kIQ_kqkfWX|t1`Fqgv_wyQ$nA=d;_V+>PZAQ8wqjwtQ
zY=29k*Z8{|!p7e=jc5FQJ&V8l)%m#7Pgz;Cn^+{H_Yuh1dU@XqDr7yI^OsEi4p{y4
zA2gn{5yG~=`G^}`)N97SJfz!txgHPouzk&W1mj<Ve|Eb~MIzHFLo(Q3fSipNxA698
zIhOMt_g}F5*r(-)Iq597A7^O2$dY9I2tdx(+hytfI3#7AfbTui?MJc3qYTOT@i63U
zyj}~>jDMN@7_$8MM~z3!r%!SFF&l+3L^x#pI1D*kZ=a=iFQknh*C;%vUsY&7C_^%S
zZ1CXivhY5w<uds(6+5r#e~)N6Vt)7nw;wfG{J2NSIri0Q`#uK@lCke@$l3nxw(K+e
zFYWtSK<kyIalME{Q)f&v+q;#VbA8mL_3qQ<jNbboN4>Q=eUGL03rM3J^?LhhG3v#f
zZ+uzHQFfEsKb-TcjVNq%A=|O<M$i7S*V1e1nR-w0>~Gg2k?E8n8SKd(ynPm)v5)1v
zepFa~d`06CbCudZ96wsMUSvr!^<3}SKlWRC4?vPw)O$i**E;>6P2*99Wc+vma&|vB
zXyJWT%VqMT4t|(^YV;EGf01sFe<>6;wo|X!eqG5q_VsG}9;Xn<*mn|gwta^!`@XK_
zGTFD@vhPtXN6d54?``|~P&m_gFipuh_T8uL`vx#b#=cV^XWMtgvhSN(E|Yz&u+Q}8
z2elkAe+Of1`yNE$#Yi_~>hA?DXO4r<LJp7)8T;;5a*iLzv>)Hnl1A=!$k~1jzz@^D
zhapS3On&r2DNY&WaqBZ$j<T;}JhuH9L}B`C$oTOw$k}=at@?Wk!bb0Ljc5FQJ&V69
zm7L=*!D%<KNXFk49=#_lf4{5cGWomPYPT<FIbxRKqR#d=AA0TfF#gVkobB(BrS}<2
z?=O%JJjahSP>A+WhGhKs8RTrdeBe`#=Mg{9a+&=2tmVfSwHz@oRrleXai|#JxMX+8
z__0*qhci2LA@rL5@*_wSi+W$2=JsQO_JcAc<Hx^4&h{f{`7xm7GWl^3ez2bDuNe=B
z`Hk~bdjzz>)c^;iLq_l8khArcLZ}o{#QO<?@xwcgKW*tfsO2b|@aW|?<ud7wdGt0}
zdVgl=Jv>MIfizNE7Q81RM?Y#Q1nRZ$jv;RR=<?w4TW6W<YxCgkweWsn;Z0M|%bfWd
zpUr}IisyOR5ex5m3-9!~ZhsGF!8;9dw!bGWykA;)yU<SDF9Qgq=TV6L#gOR-cOlWn
zn~wG|<JusEP5q^a*Z5{9lKKz?zd2?Tb&+bd-U=0!a-Y=OWRzq0g_dI)>3tZ7Z8CVD
zgdBY6GI^A{#6-Z2+zqhX?4!&cKsjEkFn=ck{osBo*T^dGyvTenX|!)8g%&NXsFA{>
ze=8|f1_jo)lHLRD&bJSq=sV=YcNzE%0%Iq?g<yYgz{sjEne-hZm{&%9&wwcTPw-m?
zHfE;p8klb>+_66|e2)AElZg9v$K_WsCWMbY5fA%j5iNLNLRh6v8|(-N@$Dm~P6$^>
ze(4hv!@&dU%OH!wVo=QSxxQ{u8unXXx7Y-`*@rTH+ahg0tvBD}IOQ(-YRJ@s7(<<n
zrT)Y$UlQLQnr44@!nQ;Df1dmgA38B0zuq%aUEYPdJYCnN^G%Mh??EEWInVdy;4Q%e
zrMd=(j{Abar1>&O`img`e)so4E`#$U*V*Xbu;~BV#IH;U7dn=ehJ7EQP5f3#{(;h4
z@(+mFzCqvY1&%%GFNOH!7fSZaFNJXb;yFvEZ>6N`O~9|9r`AjvcY7ZG&n8j(Umq-Z
zo9h35*8lmAm-MhNtiOz+TLIsZdR3e@y<e10I@<J7zL<D)Z`@aL{*U)IpEB52KQu7+
zJl~i0#)Ahc@P!<fXDdDZqCelX(`4rhD!QHUg(=GAt(p>4`|vHOpCAH<txVrhVq4^e
zr@O42fc;AK61GU+fxYpD1HX=+cVOCq`<MF%@(1Uwn0RzqaUQ<g1zRTgW@A5_Z7j;%
zQlkHQ=*O*yjBWKRX+x1?gS(DUBQ<-QCmrQCw3HUrnnvRUrw;P_e<i)IgC35dnf49U
zFT{>g{hbx`j++M#`B(XLeR0goR8Egi_n*@^A-p?$YItXz8f8l3zS6v-!SiOx_W9HC
z(s<2*Y4F7UnvpM9s=roL5k9<9m0NT2%?f^H&g2BovrDM@S`J$>wHcD-;UUO(qk>!~
zCDtmEv6h}>cVb%%pR30l`d~|E2R_E#(}LI6vx#Ibo=UXi4MIynTcSOY3MOOGmN@iS
zYusFXaZd*^E)HUSIcW^?Nq^(taKRy4eh-u9-MBp|kKMTaD{!hW&(&~<m+Rf~m>xo?
zM5scjMqt_s1oqK-gfPNN1g39AxCx;Rp&g+EVI<;rLLT5w<xoJ}gn0ToE+Bq~>i`m&
zPk!x1M&(}sUj|?9DnBWmiLC(6#7bQG^gK=Y)|c?R^10WgDF91e#{G~qogsdKIFBES
z&JdeWp0-_pFx);DIP94ro^j#L5C;)YX|(jLMwJk7ojKE=^Tj{7%45=*MFBC(icx;H
zc)!bp+2VS{)Ac)BtVDbfN);mvx4%?e;wsN8mox?Nb<AQ{{(^KSwgTuqZ@BDbZ%R`D
zn*ZIEPfOAiz*l~sbLH2hGqIKFyB<%u<S!MEBF?c}(WPcX@__t$YdR@_p8Y9TdG_=)
z1!Rx6;|=0&m;VjoD#RNck@Oam0)l5BX$oM*%VJmgE7F<R3OKV<RB}M96=%8R*LvhP
zh(EgQ-{8qNvoH+awc=MU`D?|G5WmkUb*;D%`mRKL9>Vbck*--5;ded`x$q+55ya!n
zloT-=k_Y5hq0&hKJgNG)t9+}t4f>lL5j8xUXh42J%EYLDt7vl7&sI@^c+e5qDxW);
zbBf{qaO6r;Ky->i7hb103H!PnkxubLJwD|l%_pA(JDITO=5z#GfnnoUuXqCmId*bP
z;ddBnPEQx%X!M{be&a+XpC{!fi4RXxamtqXr;1ZN@?XUX0r8c5p}4@4&voXR&;7s1
ze};G#K#cE1DDlq_-{Ap56LrKr<<B;m;LLy2BTp<t%zs1I7t<KO!-MxHT<@|Bk4;7X
z^Tn^Uzp8#_i}xa(`O2SCF$){%_yTbQ@EIp|i9aO%Mf=C|$0GkCagV-M4a#_pID+RW
zhFIoPp7@=*eOi%M<i~d+to})PGcS*0YKeb^_}2+af0LAN5Q}yF<Msr~Um@mN*Yhm@
zL6?1N#rI$+?GH-%4dNgUX^iiY@oU9(p8A@o^>xYoh=@U$@*8EmRlFY;^^DI(DDiI<
zr@?;4du4v7c;3@qAM(V{(gzEcndVQ423NdCyrAt-`P;<*p#HdR`qN|`H|@Cv8_YND
z(XI1?NGtN!IP-y2{#x-4SN;as?gi^q`xdNM$FcxB1E`F^pqW=GUWU41R)HS&`27OX
z%xe@cLtCJGiGu4C4)NH}0yGv>hQ7k`WvCOT7ht$!Jr>-6`LX0T>h<k0tnplz@zvzb
zYK$m|s$+ZeCRN|$B<K4Gs5_~@Stg4z)UDKqF-O|%^^+%QpfbJFIezfO4K#C$;{1Ms
zEN}eQrwL`Vv_2d*(CtJ4>Vdms!B*8?GkNj`D#OW)v}2ACLBtCnUqRlk?g<ri==J>J
zAF4#quV&4`MA=+jeqLISOfS>v3v_*>ov<m0S4R%K25{mvY7QpK7V2^^Le>}T;l5LV
z;gwb5)I&(iRk0MxRj1`g^mnl?SEH`+3VPIBPWsKRM88|fVds0uVdpM#^q2d<Y42{$
z9|R9vf<I8%QjLq#4rwoNX>S2QFCzyYy9Dv#;KXUu988qGQ<q<+%fX%nNH4(7TS*T8
zVY0+&BnM6tIB{T_<Y1y~xyGqaw+Hu6+8+cDtim6tEUe{V+!=^-KPw@}0h4-I&w!Hs
zM(RU8+n@aiT}aHlRrUM8YSr(_NoAL7+%<@FVL|^GR`Zt^Xk4Q#mF(Q%PK~BgNhc@Q
zH7i4lJXezGh59AbsPAWw1~B}6=&WlCREE;FSeK=_S~NOL4r>jJ4wmDK@}baMa4lQm
z93099k)s>luR4savt%rlLl4Qirfsf$WGp~ARjPHL#9j;7V^=P&dUwnkE=kDyFJu0O
z!?0a*7(@>CWZ4mhL5@0Lj0Gr%sviqnj(yv;i{$QL_To9Xl^rBUXVfm2yBAr?<<Mh>
zbwAg4T}JIEBNxxXjx0SSH)}=%$)RaSgUYdiT|Ff?r!p7K!IjJaIXa+vT5guR%Z#*S
zQm6*E##^z(Yi9=*GfyU>o7!Tb3f#d?Y~B&+>~KB>ltYIa)-!YX<VKdVxzxG$z>wCS
zgAZ9cVH#`H{c}Ww9Q+v(C&#Yj>W?}2lA&A<9%Lw;tKHr<#iC*O-~mxaZHHk!N|nvU
z{_NV{dXGwbk^`2jMkT_CySUf>QNJIPt<R12-5Hl%qiRuu)Tm;aMySyXd3|0nn(bM9
z9<`jyXDOZYHRj*amom%+IgculP07w^YfH4-`hbSXR~PJDTs*_ox+_^CZI41Q*NUx7
zFYunea!xBwul?B+TI9A%>l$@%c}p5{7=qrCo*V~Txdy0O7GKpBF06Q6^>$Pjmlquu
zbPj_fSB%q2ysiHBdGc13v?V%jiX|87B|b&@rta?Y(LW2*SdRN!qCCsjVLV+}wVHeH
zil`|Ho<z2;@P0_fpmoREHoN8J4K*xfnA*`56T_E<9qCZS1^v}0IJ<Xrr(*4qSTfm}
ztWPvu-XiE5zT5-8qh0c3r(8vDB)m{Xv=w!zuKO`QjHLv=v51fU$vXvOD-q(Ig;b|g
z1ZN#NbjMH#-w(iY!#J64iPf*Ys=aAjQ+V6D%7|WuZqzYmB!C=-kP%=;tl<pT2h|*n
z>(}C&PFe30$tCeT%iyV{?^?@4>80;H%iTdju4@-cFLCEt&<^Y5c^0utVG+A>xnro+
z?5Z-XV5jqugYur`>rz<0PUp)Uu3ZN^<bNn+vQ*URFX*bFa+&tl*0Fo`bUw#T)ANXb
z^sIE;r#J7zGb3*Ec?GFjG3TGpS4e-<&lhdE=_*V98@bmYhsRZ-R_7Jtfdb{;jX--S
z2N7{l;W_U~@jgA%jm-w{F%Mof@F+(-JT`Oi_`bXC2cIh#3~V}cf!9OMw(k-PkB{Aq
zeP<~=$G(loqh9@J&cQD7;MG}p)MN1eP~={}=XwC~*#-UJvm44W+^?ULPxK=KYDNI0
zLpoX913BUw#~LlYQ;}@+mMT2w{fRE*(GSXyC`X#@!CP<Por-*e_azu$*K@DVBL>OX
z_XTX&^?bdBhfN2sUEw+Pyc2n}k1`}<U&4deYT==39lRBA%(m|?<nbAjA%pincxGzb
z$M<PXKV`cZf0t@J<JVr~nYtsU!TTogpx5!^5#-SiVv&s8*FAdgf?oQ{e!$12Mz6QO
zbfLc(`|uc8%2D>aC@lTe20n%~)}bMz_gcu={pCT#8z4lzeAZ|5KB@7{`$ZK1&*blG
zYTR)8)g_Rlzr-RLy}yH;t@nB0<0ti=r{!4gRR~ExuuZB%g#FHtssArRj(D{?;}w9h
zJpJI~W8=qhjc3ZO&*Dcy$vN%Tto_iBq8&eC9=)$yew0{xf9@HF;=p6O88Y?qQ_r}O
zhyBmA?`#MgKX!Y@p+0RNWk?3^J`Y|o@JzkT)pCsYAppV|@3~%}!9cRJ|FRF+^~~|X
z;FTheWf)(C00^i4?$h>BhGeiq*tYQ&Sa^8c?%<t^0=9izr_f*!&$Q>+NVM^)ExZL5
z-j8rVvF+QV?V}9IV1FNSHr^!`Ub&W|zux_Fmo<)W(Q?GR8iSJbLmRvo5%zmS#*cN7
zqh8}!ouxN~WMWb838YIubV06r$aKn(j2|yR&c<s*oO0Yhs<a&AKgCWh?ZY<dAR+~7
zQ~n$KexT%>_I+CGWxJD%-tR%quD|t`-o;vudhb-@q|^VN1zr&8hK$~2o^kSe-~}N>
zKWY$6z3k9<rX1HtgeeXg`vOYN@nZ;bw1-$EBljjM!S-V(^qTSN9a>J-C;kB8_`&vT
zC6FeAR|7d4?>^vFK!$!?ia<Hyb!$B1M=Lfm`SB<8H|TZz=z<)}6N_Z@{vL9+-X|?T
zYPB58dHeIjC}+l@4lPH_73Mrq8`ukOj%~;`-B*}(;!MJ`&`Uk^cLjp+cd5oR$C>-G
z`1=qJ0@7ctcMmx6h($8~egty#*XVuD@;9vISni*3(rCBaUf?ycoF;?!0m#|)$Nj1l
zGW4SX!T9k*ji=2MC$W*K-Bu|%r`_Jreh`af^wxXyPR00O`rqYRj($|2yzNIG#;=(K
z(q!y;5kj^f#lSP|dj({TA9FRHDaUmlGx_m(;Nj=^Q2{yHLoAZ<<I^6!)s`QuZ=?4f
zD1oT6AJqUa(>QdSl5_OdX}xQy6lC<?3OU=~I_RZ+Y&T2;a`b*1N^HH2zzZVZkg10r
z&v?)XydZ>#w*kTU@pX-7%C!M6Q~fPea*iLp+7Dupj34tndfTk}+o<K}*Q07YaO$rQ
zczXz>$>6nk#)F-}Yk&;>xE8_qu}|X}Kc*uilONNSoa4uA$k85Rk&IrhCuFzB)0Q7M
zXgQYS#hl$93jol?bWH~DOW3gSo&#P5WatN`H#&a&5pu*cemsnLCO>Xea*iMS5T`xF
zA|Wd2T5Q;Q^Kd<F_RCFLPL_jG+mHPy$M!O0@J@x0jdup{Y9K^ES`jEmybT)9_>qr#
z%H+qlAq!E*k24_0^28z;y@#-E>ut3B*rMfF&U;*V4DC1_>9ns`%MtT#^f%~Dzb6m9
zvk^CB^j1QSdQF2|54{F&E0QTky|-#Sb6m)_4&`r9A<|!6F=ib~Vv&sAUm@Sto3i}H
zbV*0=<TKsv#&sy^ry+y)Egbah`nwBw4G?0zbRrl(-h>?M#kAYAS=w#8l5^Vam~J;>
zk&NDMk6zy2G5s&8<ye2Gdh`wgk9HU`+qE9KUuTiyeIwhCf6F4*g?mestJI2q1G$eG
zrQpnCID-9^cA}Xj_2IgOaYM%6gOIb|FQ=SM#3Fq`pGR;EAW`m<YE%9jy_ai0OxF46
z&o&vnUqUZz>oR$iyTnAmjofp<Gi}T4XCcS6ewe=&fqt-kE(+BwmamKJzfs>WuUw+#
zM}NQkb!EVWYUttF$tlpDejhjc`_zBS?+wbT$nwYc_;^1fO{N#BlmHGwAI2s{a5{;3
z{sE`GDZ%#q27;Z>Zdri7PU5_NwtE?2%~KBd{NY?5H0meWW1o~@7s%lrzEy0bd-m3Y
zbvZvml(%%Yx5qm0RMY$1iOTsrC$R~y$#xHW2;_YxgRjMyU6@rlDg{y3cI$CH{zYsU
zO=k1gh;!QvA8KDQQt9#a{tR;L1BT4L&VAb+|33?Gj$b?`(;l`z<98xZuPIlD?M%mQ
zz7hdBXZ&wMoaK#g#3S+Epsn{26k>lQCVew{Ph#61H#Z_~6Kx_LN8q-pbjoEKHwz(T
z%0NW?iGLP3dDwu>T_%fina0gh$eB8!Y&GI6L>&6SP>9eG+itDO5e$wtZq`(XD%B7>
z`nbt^J0NG=Y=w4bjR|CMjg9?Z^W%MeQJUZHo2}j?$J_c(@SXqs1AQz1aJ)3U|4^p&
z5FpV{@csMuyVmmfOQf5%Jf?>8=1mCi>Cc-j?VS_Us~BL74#(oxk5`28=KD8K;sh|$
zIvj)Ww;=2b7wFXie7i+Z=ygHF9^XR~F1w|!C|(r5cX@vQee&&p(LWb{;&3U+yDmwt
z{!Zh2{j%mpt~;;X-||cF+$VVNYzaaQ0$$S@k$8Ojwd=gbj3TNS-$Ng8<+~y%Ezgu4
z9egjn-z8#?VBFse#g|?A+;h{!_tHP(%Ew8kMFCs^>~ZB!w{nSJEbe#Z7kl!9;tp4S
z(33w~Y<K0)_T-m}HdlVBCx3zX7gzoQPkx2?zAL}NlV9nHFBVU@<QEHGZ>Nt*Z0$7h
zz41@D<S$NVVk>|z0)5Dpj~B5l3W(+6eXjiFRxZnj#ZFg#*pq*mxY?C|nJ0g>*zC$*
z?a5y&e(K8S(KAf}Jo$Xum48(_6I%h?P57!S|5|xH%l(4KNS>eli&cWXZz>Lk%x6oN
z_$P@qR(a;*GQ}arYq5(^p2r=&ms|<?bi7c!*Oh;U_%!6w`O`&>2md@|rt^zMjkZVO
z2gQ$E<!3wZ!K(aHvDqcRK)e?j#ADAW@mGi+>U<tsOZ<z)r}eofqVl+Tz!SgJW8eF5
z@J-uyvDggxbo`y-Wmo=kp`V}V`Uwl3XQkyY69d{lm<4-Q3*IkE=dVSY9luHxYkf-o
zT4%&znQ8tTrJjNiy;0}WJO?YN((gO!9fjxDtS`PdOPZ;7voeC(adr~M^=?&$dulSS
z2huV<oXzCm3M$hld`_Gl1mwi^!EUBLvEh5LGT+3}xi~@<)av(djlCGwq`foLJ&%HA
z`n}xcYTs{Op~iP|QW;MQK{MZ_c$vPj>%@a9eP+GRFVS)1*K8eMsq^QmbFP^tu7^1%
zUZ&;s?p=mq4$UTJns_-P=_yd_QcEz4Kc4K|E+W^iONAC~!N+HDz7~l`J6hXfNj-mh
z*i0sf;%nn-lGY}?St-Ai?w)KtlE^T;*0v^h>2$(y*{D}mCUA<Bh;Hgk;sVCGlF2x$
zk=SeTA={<e^@w{SXSVE&hKz&*vod85$ALYltx&Wrv4!tfv_(>x%IP^^G;a*j!?nPi
zF_be}#wI;XOUL%DV^=aZ;o&->x#$>^@Nga5w~o*TFg#Q4aFl39IbFvcnRADsWN2~h
z!s*u<vgQv*8s4gIq-^=akcKy%3n){z!oZ|W^EyT*p{zTsx5-`VSOb{_h8f-p7c+}m
zJwLO+Ff25nr?b1P%9K6YtrazEx2v-|(Hm)xwaX#FHGP&#mkqxIld;-RzixXN&(sP^
zYM6VnR$T~I%5Z5`tXn#rGE91P_7~XGGqa`lSXfOSUD7klx4PB59Z<vUL)*E0VSIBk
zmT4+88VU1+hs{jJU9eF4+s>TMnktunq4al~IfXS<u4c2QzsAh3E_1>vW|)T3Usq0l
zOPP~VAu#OA$>aS_@>Mvm#A%pA>v8G$TkBkt=X0c=B5+%unpxL6%vI+_<ToOC<@D(r
zvz>cJ*J9hg5B4N<QmzGo_V7H5ah^f~&$+M0Q#7U<n<+<Hh+yOKdc@%I^wQu>gafvH
zb;z5IV2I~Sq*qYL#^ZAVo<`C>R*%8s_r{24%Ehs5UtLp<^fM*r_>n>y?IRY+$o<%(
z_jyY%PkW8ti%|i#A3H4!;u(7uL(cZ&72uhAp`8Y=NZ~p5^&yXP#usDXsUAFjuf*W-
zwA<h<K)P+;E}aJ^$=Fv4IorNBEIih?!7EaDj(ztbk9zf~y_6&HsUEyM2pRi$+Hdgs
zJoWdW&LalN*tgT;?^FwqmkkDQqo@A%Adh+}L!umMy$A0M3y;^d2Jc~P+x53s=YdHw
z_EC>rf95+REl9`Zii3AMwt?r=-)9l0eUu>?`}q9R#+z-~hsz!Z?`(kC_B~=@VAH9;
z(;;NzEwJ!-jb;4(9ky-z_9IUFC_^&#y@YKWuiC=n<(0v!^z7#cEevcr_LW1<#=FGA
z3+gho!#j`sNu)77h(I#-4Vy=9;gx7PmOFxA*Wc3?1~wi0m~PwGXyMJ)Wr+7B1iSu-
z&veR=@)Q$a0JrhhTX=J|9Lq%jX4^NQ^S~sT{&yXOY&`RQ5%#}Q1nMQ;Vuk1Qzvpy1
zWk|+8@ArFKQJCe4SEl6{Z}znB^EwYqlCkf4Py4o6cnctD?Bn+bVWMN-Ao8e(G9+VP
ztp_h<;qmg?;Pqj{uD=t=)3+}O=d|zDkhAM=C-69?(ccOLgSSoN8NY%6pNf1#lp|Ft
zImeF$kfR^OA{n`IY}k75v-ILNjidMDI3B6TEV8)Zcak}#(Y{&);xT;Bw1+m3&x0;O
zx*?<YDP4c20v?9mAcTm=`k@@{O`7)5cwO2LQ-=nx!-MxE3bQ=%Y7h+G?Z5$qbN<qc
zh`~UzF-N=`a(2BuZQ=2*t--rY;W_oZQ`<)wlEDsp@Se5sSU(1@S)WJ19Z7d(vG01%
z`N4A*9`70(yd?_Hv5)h^Sud0!8T+a{c+XpSwOWql{@qi5yR+E$YmdJ#Sa{1Vye}&}
z$3D&vryk0XjD7#;!F$ERtJ88UcO>9$--ol<_cY|}_I=&L3tM=9ukalE_G<emLo)X9
zdr~&u8x~%JmZN=-qdb02|J#?vzDJR6<K-d3@+}CwjYqwVzenLY_VGC~(<wtT_TA#a
zn`+@TYB`qsJ_<n8vF|ZNOkYH@vwwUSa<+ZuJ1(?uHG;A4lM2tVkN2CYhcYC}kv{Ih
z<M&x8N4zEkgIA>R9Gf_Q-C#h>vF}t5-fRnxPc01I3A7s^9Q%%F`zS*)*e^iN_Sbyx
zh4!u2a<sQt^=HSvfh_h-_w;9e$Hn-2m4){L%G>rmr|qK*$=ElDblbj5EWC|cj`(MJ
z#+T<&E>rs!dB%e}3y;@qrv6^WhHW41r5?(VjD5$kVcXYe;a#ugSPsQyK=nxC{C}ny
zGTXP(59@m+|6ww;po#t(ac-OA9_2F4i}*jfUW^{jU$@ENy&rPu3SB0Ta`y4f$nm>u
zHpKIY463?vj^~8{QSWs}+sx#M(dI=|RaT98KG{y#0CMI<%tB3=r}CW7VCG01I?*S;
zi9umL_xEAWK-WsqZ|wKZeaKdh4*`rnk!VXxth<|#W23*}weLr&06ydY06J8fToL3>
z61TXLRHGXCfS4kBT=`Q(7vkKP6ipF$tSX7;Yd$&iNX7Xdz)Ji#xyoY#rbPj9y4dW>
zKi$e@`Lo5-NMXO{zRqX3NwX6m&OUw`Iuet(U4&=2R<<Za-YTRsjpwmN{wbmy5ylnX
zX@b`lhKRAlg?GC6uI{MxZ<>F);5`wNiqDX1o2nFL!+Tx$0r5FkT=_p!SA&@YSb#X~
zo2gHN`OK1a9MBc*JiDY)5ZCyn{RN1-%Hh2w7V)2|(*1CVKKXG|LZ+j7DeuSpWtq+k
z^T@Tl>6+yZ?P@&53N6jB?^SP)M^oO_k46*5Y(a{I+B&x+TGXNoE}UUENpa^jqxMXT
zMvWqv5xX+h+Z9XV+Zr9IXxk_N`tChV8e=gzInw2=v|A=GjrF#~y13q1IxVvS&Wb@}
zQA^>h(?&DnSC}G}gPB^q&Ji4MRXPBcrZH5dEXE?9$F6c&4nCJic9uu3U4K=UzB2l3
zQ@x%E9@fUnSFYZ$usapyN+iP;0)Z;8&aw3dxeSH8{VwmhtEC}$haC$$=*2?JQVu!I
zY&{3#ggt!neDlLrf*IOAug5fVE>?}*-X@MEq;Daxj4fyKn6HOIIj`A1-{O5qjxRw3
zs%II--;V%1=lqw~%1k#V8tnHW&BklC@Ni1x;7#`UQHwl|V}^`<6R=_9#eqk;AOeqY
z#=f7yINQD^<k3EJ6g2kz7(zClc@HZHS*9Dj71)NTQ-3@+=6Gw!;Bl&kjn`-Siy_>>
zV_Dn2R>Wx^Wk?2(X*S+23-1&yN10N9+4i+r7}#{$cQ%A<JbtH`<%0-3bQyn-V;iDQ
z`*tBtIemC@?E4MUY`i@d9uIj2uiMkUy~xYdzMY=--3vU^zC434c$Eszv2PdhXrDRD
zF!fjN!P{@yheM@<cN@}Kf0YQN-3a=SEaS{$ctZODaY>)Wzb$9<e$AuzAPVr197G^D
zek{~_4c<ZIWx|^W0lS_DEW8;O-oMd4>-y$d<k>_YNRMbgDpXWZF4OhRWNn`o6E_(E
zonWG`0S}^Gwp^y`n^_Qos6)Juu^)jrIJJ@W!uGzXvLdJVWfoUgtIsh8N1yk-OPz~3
z*Eb<(m-D=@$P2%_u2g=z&L_Viw*L_K(@gWb{rC!6LEKka(A>4sjH$fdQSaSMz?G0M
z?px|>&g;*sz_rtxd<%zuW%||`uZvFMeCu9*q3rOa2?M7hX0ERCu}uU~`ul;2dYkx6
zd+9j)YcT@*4DqWGNW31SEz4fJ`N}-`t+ed#0dfBL!WYGqfuX~RyzrXWi*N2KCi<@M
z`k`4(>xbqRp4m`Z>pLlyiI;toC%$%nA!R6meDTtxQ&;u9bd8wa-%wjOG*>(~ba?WV
zRqKa>;_0Eo_w>Cq5cIutcv?g4q*dUdhT6WDcGn&{A*P%>^uKSudE2k{=ReeU)q+o8
z1(W}*|2yC9`@guqPdcFg%r&F>>ZS54|8if6uldnG6yG*!;P#guxY_sLfmyXfC567q
z*N=-?hldWI)3q{o&m<0ka{m3_@_SC)Z_YyCdm$WG&OzXKz;yPD^APx4>wJVD0@LRr
zT!>JLFcR?^bA5p=5fG~oryfNCQKt{69D99YzR8fB?@`$lzzF?L7hb-oLY(`UBBG>;
z^Uh0M@>9hHh|@1c>5_~GTr0&eK26MYm7gZgK|DP!O%tEhDmfne@PufKjz5jT)+fIr
zr8Fu0v&0!LJl1@gIFH>X&RajtC0{I7Bi`!>r9EL%!1d-n<FmvHSNT~^NhLp5)VT8J
z3cgo9+mT{RrztSZpZQ_~95;Q1*WkCC6C@Plc+xBDL2VcL^9Ao$Q$C1Lgn82Tym`t$
ziNO3OnLkZz(Z`uxh?n?_1=j^LMENcZo|MOBEb`A1zx3pr?+KO4{JCNx4}zLlekB6S
zvl@#0v&2_D{&1Zj=2MpT-=*_|GCo!OQsW^R_W<V0zF06z_3;1`LFQVX*XrzXPC9Jo
zxLYt=^+_ikm@LY9#oQNXq8Umkhn=pR9L_8zpQrj_0LIlKPF_cj<5Po<H|jW;D8mUK
z{VXVB3~^MN)B_`=9oYROuHFsHaDpTA(Jjdff-Hq{93;p&zc}k9Wo0PRxN7-|rl!cU
z<*OpAmt9f6u4&nd`kF{2*&V@D-{IGmV=a;CA~Q?b5GHg%9adC~_Ozv1+QzIjTfrQ3
zS5~#hlHIY6j#wnMJ%Pm}laW}*mPAKv)z-$XRh9LPTNhVW<G*U@68?wqSGj2MlIohO
z#i2!rgqTuYxwLxe;w6<!nL@eB#Z`-!R@N-8uAm50t1BuimsC|OSwzTCjr<E$R##P3
zE~=`p&%x)vCWBQyTN5@%m}&P{R?j(f5qB@kbn9wN{aO{wp~|x99k=P}MZ(iJaK>bM
z?rWX9_UO@<7I%q{zACp%d|ZoV|8?v|D=O1-R^4wm{I%~$9?Ns+)qj;W@3}kaor68L
zWtH{JY}cp6#=cN;u7~Kqj(V)_j>TH*F%z0q6uI`=?ETg~n(=^FzgV4Rn8GWs8eefN
zjNBWIZ0U(6TO+ug9E)~y5_UQ*+H!MGBFVI9EV?NX=}ELEwzYS*X1+uGRz_F6@=*~{
zCtJCXu&VG#3o^K?5aV91MXFIPSTGtluI0RQxqz~qYc3Z`PT%0>q;f2AEbnlundEX)
zuU^bq=M_w-kSCa9{5u=x%ebs?h;x6h;fby$p1+fVNar?AyCqd?ZWzyTNo%m-m9ww3
zjNDXg@btfyg+P}8nAZt3p7v0Vmm~EW50^5Mn(%L5c^bSQs%s<Xp5*nAV|nA7k$VOS
zw%$fdFMTt5lMu4~Xhk0FGi2~OAZO!o&LZ{F4|0PyU*S3SrF1@JNCxjh4_>Q<$7V5j
z4=R71_SlKMAc7%-ccsVQHp^euqrtmZ<C%JX7<rlM**n*KALQtRku`d~bIo^JdhL7N
zkE5(z&-)Q)8yhlsk0QaYXRfu{fHc;#>s~kFz;o)E5!$D2JErTo6KOWyb5=du_qt=~
z_ogh0h*wZSywgCvr3kc-VJpf@KXe7=Bf{%yL#AFokLy_KH8*0PxAgLk2C-;wv&Qr5
zg2liyb&PB&NB&zBK$f!xFrP)RJh4c`BmEmTY`rf4zYyv4gO{X6uh-u^^b6zfTrEf0
zDC~kNXU(w+M0O!=$mr!-g|^<;ExjBUjNYp?p7ED!p=R>;KT!r*j=!8sMt_M#GJ0Re
zwyif0?P&bv{Wzm{8MXo8>_^WcVhw+$ndI7@#H&RhaZNqyW&O=UFnGM{1_-DB9Ych2
zlpz`WkSy)1Wg@89!n*)*gXe9JVzh_xgSR3m$M7i16LX^OFN27bB5ug&)oTkn^_LHM
z+Q+sf8M)5_&#u4OmVFm$IhNamKXRBQiE~4E|IU!X`(y?=lSf&z{VuJ?#v{HVBX<$x
z>}M_1YZL2&G?#MVY$p=sGCgZ~P|GPPA-<9YZv*6DTbC_&iHU$4z2~D2Y={MHHw5Mf
z5$FfoF^TuJJKN1nveDPr!4f-Te%5k$3KUp#$%>)ftXFf_{t4l88m5Nv<RdQPf!({}
zlY5_;l;7W6EN1cP!v0s^d{=4nDgPSSGYwB$CdVhoZ(r`~FAeAIS1Z_1hG9ayBRqLk
zMYtrqLp~Mx#1Q;`=rE9OE-sbNK16>rjHpH6z3@!y-l*p`B2GL$DarJl#@Kzw{=D$?
zhP*i)+H&9Sj~ocbL*cUUnv-u<5n);Jgrnplo>zKuVA|l`0~6~O&UpDaSI{}dSwY9&
z@3%ae2p?G{u<FvF+TvVD3{~>p9{WxvySZLZ(W<TRob}^-K*Ud7MU=z;iIy#${2Uem
zEuHvWu(Y&47!<!NEExLT;VHg7lbrg@>%a1qiYa;}pS5{?b<o4Hmc(aBs&C*1+_pqZ
zEXWr~W39ndXRxy?))CY_$K-D5Oa<%LgfpZ@JAyqOoRHI!LUH*?mcQi%dsOvh{pWL)
zhg^?F0^)AOc|N8nAmVz*Wq<WKM^cmPDh#xI(cwz6M=OpM_R)m#Qv}}^NYg3eI>em;
z1^GJ>r*0m@slOX>o^NxE9&QiMrqUF^S;ti_{33BB;*E}oeO5wy&Jwp`Fygq>hrs6$
zF{?bsD85%=h;hynFvK{YQyXIZ+n#)TEM@-Bp^W;t&F2FAPK6<+ovZWvuwCRoMSQ@M
ze-+YMexuAU65Bob`kct|$INdr`evgX=lC^{<32s>rT~?FJvkocb&z96WS?lp$x*N7
zJHegj3@`xICf7e<ix=qiLb(2kOh+Qys{juH<#Pw%b4;PWP2|9D)4U6udZ;gelOE~|
z;CTb}F`Z=QCUSigm@W!%5@YOdLY#8zH3t)A>=s#WUSP6dw)=}!t}$l`Ch#RYyLNc*
z{Er(Tm#cWUDLLGV4`nKu!>zE4<ukshKf-Mlw+*@6oz7Hp{MM(ZL5{7-<z3!f*OgQ=
z{UV%t+R-Tzoh_-h;cFk@u2Kw>&0FHbzed*5)+uie$r*x_P`8aRhc<f+=kl?!k#M@&
zR<+1)UA4rc$w(@Rk6(4KYN@YB+ETedKs42vWP(fzRc?xQW0EcA6(%~itXdygUlCa!
ziqzLPUA}H{1UG(`>Kjet@9DTLzxHxk<W@CSBgcB5%iYc1veNPQ(6_33q{j8^%JSaa
zTc}#xVv}n=;Fesg{vH|nIZwwT`hJ}Atueik<;!BZ-K6_39N(-%tO(*5^Y_*<n#V%Y
zQpj-|*^;U?H;l(6QV%w~a(yyK{TaDGLaBYtTLYc75aFSY_E3(;zMC{2)Ju8{|2T{}
zWbpL5;?A}4VMwsN@y*C>_vr0~UU^;sS^8%5{sd0gejGs_<qR2nJ_sS(k6pl{Uiv|9
z@Sf3lrra^)W%6T<l5_lcLE{jMWc;|?qj$IE2QSTx-ZQmc({8UIuMfeH!8?is+mF4#
zYd{+Pu;-&r@%Yh(cqTs{KsjVNe(=3o`amp_(R)9(ZM`QfKUm+!51xkr!s&l~h-^gM
zkilz2f{ix>ydcu(2hUCo9+F-5nR_Yb4A$ULr;Rrq6-hsc$8#lvcP{`bTZup#M1<#L
zhM33DfDT~aTe#SC2rWn%(z_@JULj*bP%hKGg@?49785_ug0~Ur==xo@+$AOgZuI&f
zWJ63xJg9Y;dzWmNWNb^UH+^ei)b)FpE~%*=>-xQeyg;$;EnEcacpX1A>|0tmFYj1B
zuC&(<%_{T_PSDrZcQxl>D?j9G9ylcWX&)hQI-7A`Ca$CVktOF4nt6z3RwmPVeXQnA
z_MO%jKD*(baOa%fx;w*ngzrAkmcJ@o@bc3WuNumqBJTv0HuOIl?tE#3Xy{)seNOm4
zj*H-t7xCWlP`;S*ha0=@s4p1!#gHg$P;)h(_}EZhVXfRgbRz$>lZSX-9hUPWPxeu_
zA*28HaB;(~@M$^dpYm$2xTAi8r8WP62o?^01DX%~L9EFSPwj7btydg;Rh%|qVA{#)
zr%mr)b~5P84=amAe;h_+vgzoH{tG^~Ja6Fi-c#mJ?=P4?;b`aUy<PduBDiZ)*UG@<
zzRD@h_cqtY|8!jRpZCU_Z_*btcUG01JaBq^`D>+l#pn7L1b#9cW#Ewi@;nEH7@6+Z
zm^!lg9PEh8kZ>XRa`1WJE5PT2*MTntuLr*fJPaNJUkP3X&T(!L_$u%v;Fp0f1-~5p
z9pD^OE(N~={9WLy!Iy!P_zY<c_)735@KxYff?p247W@kEb>Mt<#kRf@d;|D8a9(S2
zp5E2qT<?M7*)`zTfL{mB@#6;YD0l=Mw+BTGd@gt=_=VuNfb(AMo#30m?*`|!<_Ez!
zPCW$P0?zlTIre@L{6_G{H9rD=G2%Z0UjY6bcr7^Z>9>Nv06rW1BzO$`HSiknA@EDV
z^Dyqs0zVUcGx*uyi@=M)d0dzaUJX7UoY$(0z_);N9fD@?I`DUb^S%Q6-A3?*;1SK+
zz!Qk`KFC(^F7TVcli+RODezmtZ`1rk;H8Lv2K+kkuY+@(`!09{{GY(v!H<G>fd2%X
zcTxTYd@1-K_yyox=cyC?ci<uL*T6Y=z79SI+=t@;{mBQP56<;nZU#RC{9WKB;3eQ8
z@FaK@INN0f_`AW^Xx;)o5Ah!G8^G@c?*`{HsCR&W6rAfrKMcMYd@uM#;Gft0%iux8
z9|KQ;KMp<_{2Sm^;D^EA1O8ob9-F=o-UI$DIP2q|!MB0)yM{Z#kAqJE=d+aU;C}?~
z1s?+60sd$3TfpA{uK@R<Q#ON70uO?p0?q@->EP%hvLDrgpMy9#zqc_6J_nrR^n7rL
zix7ApIQ{p5(=YNRNM}E$Jrt1Z-6CUsJQl=_$0Xh<#tV5teCj<F#T35QAZ|$}I<Q`5
zq7{j4ZP662rGl6uz!wIC9ntn!`Pj<hiY<z}n#o{GTeQ17hmx`GmS`6Y;WeK`SP<+?
z2BSe<{$Z90jFAFkGh-88YYQg%-RT%U0zE>R_C$AkG}RJ^;_FZct-%|{CR{3o=Z#JH
zRw?}M5rnPU$K9SSF|-9-zxCZ#TaB%>Q+q*)vmn^r(-IFxyMxzlS{S{7u<f1QsUT{l
zvlW%vEm4!P;C6^4I=Xu{Z%(u%*yLC+u`{`Yx3<wow#AaEV9MQf5*^5k1~(@<5~)}a
zw+Zmy9&L%EH<gPu9kF2N=3v>o=HDuz@xoycovtO;ii+N}1Lag#!|6~@TQoV$O)NUw
z)fVebq;?PnwS!M)#M--fx4fOr6^w2{w}m57w6YfhXf2p)1KB8*F2tA9gKe>Gc&CwF
zcw}c=W9Yl>@FBQ89)rh8>2?MkEuB4W#u(O2H*V%9HYcDo-2~mSn|oCMTbACt<QZUa
zOETKt4#(rD_f0W8J4jL%lWJSb@p?v(zV4uFvEE<;dl9OSH$Jul9!*GnO>5Sz+Gt=@
z-{^{BdTuh<id~om&~Dv5?J?DE9VyJ~$xv72VnfGG9i7{uk{^Z-%1_KM!>Pau9RBNZ
z$X|)W{3;yUFUR5h3LL^$Z)g;2aLB$Ahv{`VG;hG+_-Y)2ufbtADxz5D7%K<2<5lBs
z>`fwy)i-&&G9D9A&KOQ~--N?0_s(t%4{^2C6>W*(VA~Q+CKJ&uv4zQ4swdeYS`x{Y
zp7zb?2G-_6u7`l{s$h)jgb2Q}5|#h4WJ@C2wlJE)(YKZ3S8`!DRshDaH<s8EPYKj+
zw5?mG^<r#7H^Kn85N&W14#1le+hSsKXR>|aX7n6v^(4jSp0+l;Aluo61239uTg>R*
zf}3XWWnl^nJ1ayyuG;}0J2YE}4%E|)<L_1+bK68)Y;$ViCJbsZwb{~>Y}+9dZi=N;
z5}FQP#be!xZk5mtd(m}SN(ps$Tl&xw7Gg|{;gH<HPlCwp4kmQ;v~PlG()Ui$iIgsZ
z#$cVPM7{)$30+-nJ-Rk-7P8|xm2q=VC-!A0niNUwI_OvnyE}1kfLlpcsP;!~yB$(#
zwnr+(<5IWij<qLLJ9a}whrl|mLUjwHs#|uAl)$`c!O4O#kxI0+;(vQ5j>bJ5tuU;m
z6BE|92@X+-7IXnw7fy^Nx8q2>14rLmV#!YQP*f5AyW&x?sV&-ZlW4&W^)}I(*pf)G
zox9?KJ6ck7;dWw5boF$!q(n~_>P_@2AskWVxe<^5Pa*sXf$x!CiNJM)xHeA_4$gen
z<1+|vBJlpnXA!vW&N1-6<#({)T~^|=z7se%NmD@l2yvc6E5bSwh_jw}-R#5J`XQV<
zlIjqAt{D`(HrJU_g7JLulnb9{L22SURNr#t^K3g!{C0=?TNH(Y-}vJ>wxUAu6Sg0y
z7u+Y$dR3hNeAZ`EK%6PQ;?j4f*o!#N85Nx=X2Mqz&li32ELle7AJ+x3DS$U<KJLPs
zAwG(Dy8dR^;;`pD@oz5q^TZLvc`c#{55p`P{?63}RxbVHS$vuTXdiyV4_#hj@>%5$
z^mju%SKXrhI|JL(@J<rX_bJb0K5P6WxFO1O%|hmLo9|R{+Ysl9EJt7(uVae*g@X4I
z4YACF9{uKB=04;VVL=eSqsJl@GCo86QlB&PdZ);Lo;+{HrX=Fc(D|%0`gahV<&FKU
z@q(ag13rr+ZUA+{>$kux{DGWzrg%OMnyIU`47L!b0CD!jnYw!UY;iWzFI3mV<h=gm
zyHf0nfm87ZD#Jww%k$Zyk#9hp^6X;)?nIz6I3nfP2#n*Ir{vRhI&RG6Bf(#y?C=AO
zzWa5@^3T-y;4&Q?MFrD?n!_|1r~gc6eUaB{PP-Uy(tM-l&6>wG@6x<i^FGaYX}(+Y
zJ(};;e4pm~H9x5NVa<<dKA`zA%?C9<q4`P8hcstn({9cmBrnu_y5>R6InR&zoOefF
zqj|074VpJ;zESgL&EuMPY2K@OpXR$X->vx`&G%})PxJknAJqJ?=0`Li(EOO@gPNbv
z{G{eXn)5<a`mZ_nLB_fE8hKFjQq3zguhG0#bKb+He3Rz9x5{|4=A7ffc$enAn)hkG
zOY_~D@6mj(=KD0?ulYgE4{Lrz^8w9|X+Eg=3C&MxKBPGYJ!x0I=A1J|J9&?nJg9l8
z<`tUPXkM#%gXT?|Z`8b5^SI_+nxp$Ey_y$lK3(&m=B1ifXkMdvt>z7yH)+06^JdNC
zns;dqCiQZ>pnv(Ab9`dl*ukMh)`RB7ng=!Kc*J~TABPggjh!4H88`NF{AIjWbF*F(
zo+ffFrK)5Pu439_V_Z!s+q3nMysA<lxy%6=R!%<T^jJ0eqkR|5h-(;)$$<<D4UN6r
zDDU#{`LXq>N?gdbw0Dj1dkG^?65y9{^j)UTjtK8A;bA?N{pXC1QC|n)EQ4$SIXv<n
z0VY$+;*mH_9P!EaxMl}L*VSv!bD5v8NY?>xvYGnZG{y=HWhtCP<z<6FAK?{OdH0TX
z$=RUpg`~1~47{_mvT@DwWsQ-@>PRS5sX9oE-gVb2*TxA|v4YjKIxEont46TO-eI*F
zxipkr9DRs09Tuq(i1%kw(T-Gis6yU*iSXWw)-dW$5Xv1lm*&kK-P_XTjosT5xKme-
ze$W=f3vXkr;xX0H*wI2`t?}V)nteuHWmP1C`$sMDNVH=|1RwI{XTEsfVbylNsTb>w
zwbZXgOXIU%^1djN(XPYm|LxY0c|zQHw6tXQ15>Uz&BlHu&P=K?Utei0H!sJf)N65=
zg@d=?vQD}g$NO=Q;`|6dhfba)#DCyA$`DRlB{gG%+xn8rSqn&K%j+R-^VykKj^`wX
zcpgOhBR2SqsFo4Xo@qGu1LyNB+Cw>>E3MXeIDM4V_J7%X6Zk5MtbMq8NpiUf5FkJZ
zA>IVg5EhdVASh~bN!oyHDmb8yL<PK{0t#w$Py+&jfCfbb+#(7B;}R4dTri*xE~CBy
zoEdPLiH^#WQNd-*=!|~PspWQeaT7#z{_i`#uYP$__f(xaRduSmx~fifH~!PyNjW8N
z1%4o3_pApPD7~ti;#-Cv-h4MBUz&qazEn5jqjZ-7-g;DmRx<FDsq$Qc-(GpILLQ~(
zb~*S;UJv~CmTxX-;v<k#vT4ccl~?DHM>awwuNQ=Q%eNSDR1f7;`Le;}mABhdU(%zJ
zcL2Y=<+}$ol}+hdmG2XTdFAc%l#iCtO5Pw8z+1kD5O*1%oRW7)E8juL3xSFBNA*$i
z<U84-dQV0=RW`73KJqsp9DmV%K+ly?J(O-#zUsNHB1#08jIAcs4``XM^1T)v2qL2W
zp7tgyK`W=^<%7?wmk{Kof{E%u+XG78G$~KD&qI(Gs~(>V{YC3R>rkqP+-iu{m%gRx
z&9~4~56WNVdn&GJZ#`%|n~QkmR6Pm=Uo>A@$5Os(Crt6>g3p_88S*7QsxP)bqWSK|
zMdi(x*2A<mQBKKwOY$kb^umu=dZFh#AtGA7Lhw<(YUfSKi-6BtzEK{%90z{lqjcxu
z2bE8a6Gf0Gw{;LI_{cv8d|r9wp7za@d?atXY+ogBH006VrgEx$FCxq<uLAOjkM!3S
zP~~f*m5=rZE0i$FM`TN_d<W4{h>zsan4;wElKmhbVdUuBBD9C69O;5kBgb7;^aVJ$
zQKFdOlRR>dfX`cx2<{&X5Kj4K11jHX5b8a1_68jU@i@wp+$7?IulgqOdG|Caj<8(v
z;U{;Owo<=@Pdwyq#1GVAx}Y$wgU{Rl6yLL8LQ_TEI`Gln1;wlWLgT{>Sk&?5x67}>
ztdfqN9qHZZg#-Kj=x@eH#P)Rb-GM`q`_|7#v7&$87R0;Hxudg8>RGY5cvdV8Z|f6J
zxEY}(IPVp5jAe8tta}&ZvHA!-<z~N^?d0*(UjNuzbdVL*m)nN|amHgsEUr$))Z@IA
zv5wMNp69pBTJO_vtacJgKx0a*XT{_*Zr3K`X*H75)N^jNPsQV#_idUe^~aI+&y3_{
zJiIhU?Ni^*J6P1huBnmVhA%={Xk3c*4n<KOemX8xUmoJ`T@2xLS)F{Ve5^BFQm;!$
zuPIHGkn}q3AS<hn6qVY$l>VT--1>4=W_sFAJW(h$xac4+@d%U^mxt6}awUF7ozP3i
zCUX5Cf;_{S(9E2))LJ8pb=`=TeYMu;Y8^1+jNW!_Q~A>qjY?l*ksIaTyuRuq3~yr$
zAuprQ82mvw<z&B~Fl0eEen+T_S)ck0`VYOcA8j1fXDz*NF_una^<Si|rHbqC@ITt{
z|7N=%jXQMzqhXSUHkc%$a~S-L>Bt^<oNruJqqktUFpEj?#mBQ2pxyfkZU!Dl_CK#9
zd*Aooo3if?P2((;)OGZZ#4mmPZP-50!=fyh?0Fo$*Wc^t*}eCD>8ba+?(laac4j+$
z{GHh=pv$94XlCL%vgdi7#X{_PU-}U11pQ2iGKHeQ=!eBm*SSGt&uit=Z+HHjTTzsS
z?!>Mmd!N@?I7Qj$%Rk2(jr@AEPkr&dwfH>tp)Wp9i|@z&?2GTG#Sdg}_~Pj_qU$W2
zw%q26KgEs2FAJw%pZ3KUvr$;IP+z9C3)%Z>Fd-nilGE|*6HgbV`|E|C^hB?LO^*0!
zPL>7xWrh}innv#gpK_GGGvrhH(Lh_X4O<O@Xl#vx?!bTJCwIjE1ST^S9|78$o!N1?
z1c<(j(;;>PE)k+jINhD?M}3r|^a;ND=CH?P{>0YS?9B$qIfbC}@Cdb#C+L3cMVX(V
z2ePhmz9#5X7(LrT`3t(3J?G2MV)K1;4me?-M1m0fAi7Hd`F+IsVe;vo5X525E6L9l
zV?jB(%`DL5lcVoSP=566C#gFqCy&bBO7>N5w}pJlk>ok#L*6j>BxjWL;jtW)k;}ui
zLL&~9i*y%6cO*F(N<M}Y&WFg5<m*p9${i*j`J7Ka@+pT;`Am>LJeJc&rbp*d<>Tc-
zx(g6b=@dV;ceK8kJM(-~-SUBz1#vl?1V387PLeMjfp9r;ILYWGX_`2~W%Lz(PNwiP
zs1e|Dx(YvoDg~D#hlh*-l9t0mMxms8z;AZDt`Pg66DHGvBYdtM2f(mfn3s$5Ym+Bk
zOCKv%&$%AHKiBjVvxRcTOV%Pe@9i&MFQ%j&d4IK88O>FwAD?Gy`5jH^2V&RIGh-i*
zryD0~;*MPWBM3QsFS2QE9zj&>O~<Ci#ZYYF%qy=QkMBNTdQ8o8n3Q8x`e6cpn%aG0
zj#cqKVLyZF3yxXsO2Uz^3B}pOBk)aknOHs0C+w#+OjN|NHi{C|oC@-q8|QFNQ+55L
z>9jE}rM$jkpp!$0l6qtX{dieNQ^Hs+_mhkGBZVDnYc^57qp5Z*W%g5p+|SZ9O-VbN
zQpVJ0Q-Y7&gMPHQV{V|P%6K%DkJUu@TGz#w{w&QCOVZJlE~YMH3H^!9qKi7_Cea1{
z47Vm&f}8omS5v24Vrh;`YJPA&e8$LMmfUQjm|6X_BRyA5os3iXd=4}OhGQ{@EG;eh
z32!~l%lmP{j;6_fq)6(Fo-dcdB7P~JMG&8|oFNS0p7TU~#9M&5jU1O9y<&vkr*+r?
zBQFDgb?sqqqiwd8V%&ENuE85cxP`t+W${<P=5a$e|Ch(#0E>V4k{N#wEdQ6MtlkLa
zFQDMI?>v0^Y^Hb@1-%}Y+reQ1=Z0|pP71Py(-+amFn*M;hdmRESuAa%t_17SZdj8l
zhh;N&`{W)3tyRg%<(nYzpVo@xh9W(s@$w-k>ag_Zu1N4jZCFJJ#j-zI7A0>G_`J3i
z^*#3?;3XacrQ3iX-h9gtRtYFaeB|gkUa!1aNK8vhl1F7GK9X0BA0$te_f`C+b-!{-
zUW(w0*5hq3P<mB=#g~j9-h4NK2}^pOFNG5yrR#`Huw;+AUWmXFobzGH&iRP<e$^hb
zfbSs;OZ=!)<t_ss$yXJ58JSQ%R9~u(%J)tw&y)!d%6NF(5g)m)Rl7;Pe<6(IDcvZ(
zL$cjezVuynRo~X&SNXO_=kvCk4PrFnl~eLwMt)xX(Ra|Z!9?{SeJOc~Ql6^+Sjbal
zBbiDby-y5L(RP~vg6g4kulVS@YTkTp5UL)eZ<X&oNRPj0yVLtPXn##PRi5Dp_sXO1
zbF22Hon0mGb}3J#TMRl@JxswDt;Y(`R1dXFtm^SS!o2y?cd}JIu!R%N_Ys6cM6@2&
zAR?fZQ}TWVKCe9bu5~V$h5%mM_iBWbJXMbXe#EK=eRl?Y(R!qSkLsazt5v=x`0&Sy
z0CJasQ1u{vEB$psVsAa@``?%G6yl$fw-tMfUU{=XWP@c05CW9E)>0nCaJK+IV%6hP
zu~!+b$1?CyJwhTGmq$M@(ei!BQxDn_Q~6e4Ao14Y9>^<^vdB~Q$ONCa9-Ba@enneq
zO5Ri{Pt~KoiF&*x_E@9!pm!ouJ>>RWG~d_3=gs#GPd!MFDqlm48_|CC733i(>Qs5Y
zL3-3TnlIfDDBm2(sp|VB_`LbP2ZH#906hVf?>cRK34m5INTkY_o~853`^X~?TeDGl
z=L>n!@+E<$e2Isgl1*pvz4HF<k*CISN|%QMc-uDx>68qTr^?qGKfLn3^2p1R`I5X3
zAk3@3R9QaaA*W=&4<@g?e|hB5RxR<7yxRe9`9e*U?^f`6<=JRlN<Rc33yYFhg5Tcq
zb(7^&Rv1;jBJg?TC3)o0*07TIJTmc?kKVznWPmNIzs=zD%A@a$sq&G9N6Cu_dC~Tz
zXD^74c*rT)6Eu109(gBAK1$a`j0e$vU)V(X=)DZy@^$mbBMXx%-|xls8!g`;Sw3Zj
zQsvvGjR(Cv@=o)}n<K9CX!%N-DBlg*bzb0+SL~73OUR3suS}MYc*v>pWoz<io=5tk
z{xVqd5&aF#OFZA(q-R~cj@q8wXL9~R_aJh_cfa__{}UhKL=4(04Mlw3guDdsA!<7D
zkR!f9;wS&FWQ+r!x<)CY1QpB$C|-?2bbp#LbAtG6wR~68k<QHYFZ}WEfWAjeTB2uW
zPD1YD><4|@61VR|0W;*-TN5j8iM)%qHV;j2Bi@39_b`*$Cf1n+b-pIf!F!50cf8Y*
ze`#~;em3dKbap5yo@LH1&vbHmY@hOMN4zy!o$aWsgy^Uf<)QCty5$k)Cz}3l=a5JX
z{x0W0KJv`82h!I&&)mmOH1do0;ec4r#vK$g{q&H`MZM$5cI;d`Pf3qmKPpd)i0!aQ
zW_c{h#&IM&n&U|-$0u+SghJn|O)6A5#M0lf>i>V6zW&?Knb6paA&9?ohvs#(1g2}4
z%$YQ=Br|3R$OM{mbpB)_35z<5oeMhKLq~t&$KlVLw_qcE>3szFG0=G&oi{1*v9w|X
zLDO|D91O@FN6({s9i2Dn<4fO;bp`E~S3i%^k!AS!_2<cHHQ_osU((6PFAc<!1*dgf
zX8fY_B(x@ST^1YfD^Hdig<lqbO4$vf^CY8v=}%xoK)d=l!DZ&@duVhocB(IZFV+{d
ztB+n9e=c4F?+sFSAQ5KaZBIMo9Dq{N`HyVeFsN^l9X-oz!R_~gTdZZSQ3QNyEt*>?
zmn_ppY5bT0VI(gEv^87tcdHRC@@vO##=VQ^wmiNgJ5Jv7hk?$*^Xc9mLGsJx8bPGb
z;^!E^${q1G0&adMuy>_=!QYF&E8NX5m#xQ*+%1pAu9I~LK@OFd-lgWow_}5R{Ahn4
zKibpB-;0r)U^mf5<=sKRMW2rcFI@q_<Heeoo@1wS(sS?Ra-a*aFgnLU>v@txeI+Uf
zW#RF->?lbzJPEwSPr~5nd3nx<dvOV9I?qAQ`wh_$=x8}<5di1?hNv%p6_3k_%SEAh
z{wf@okuU#{<jaCk^|>v)bLryg*Q&=}kMfPr<If#^&S6i<LKY9j_WUJyMY8zPfZTY+
zvwD}|tt)+S)?#9x(?^WKyKeBZ8Kjtc4Zc#=)CRuxz$>=aV?4Rp1XHXn=O$R2%-&m*
zCNhu35;N;qj7??Sl)VApf4yw-MHf$>j#p_<f=cmHt=Pr-2?Amj`sl^*-Em#bdG6D!
zc|J9Wh(56%<P^o3JfXt#jIJgZ53}Nh+lPJFttqZp6>N&PsfO_tzp4DaRgCh)%snP&
zlX?4}Nk_x~h}!$OV(Qde1|PR;?eo=I@ifuWyi6j_Cz*d0?<c$)Jw}%oI{ooq^lMf`
ztadqyZtpKkOa;eiwq_nrJ?ydWTs)q9*sJMt4|_Mg{y4VQvw5riBH6}L;D0RhCa)D=
z-xDv?Z}OWLKby+`GnvLz_<tnpCNKG4qGL5NhWrv)!9J><GM?E7wpRI;f3mX9q$iAF
zIfa!~zVTnPvd-)iwX%Zkr&w7Ty90ArOp~K77xT&~o^=Dwf638mihg4X&Rv1@l}B?y
za(|F(3NN3Wit>2HHw=7~O%V@e{2QM%ho}8aDi86YC~TXQhhlP9j{lhAMxBzkL#z#=
z`+JvxgVL+IDZV$s=gpU%l~nmsnN_~i@mp+P;Rjqf1d-i>%GV7bK0+1>#`Pi#I1^#C
zeo{`A`_EwFYLx*+$XCguaFuVWl&9>SHHeE<-zvz%U-Vmg&x4QZ%kz-(;4!k#dGj6X
zsV~V@`CcyMMcemf#DxImh>u*6lvl(l*x)?!Xg#CkT`c9P`hSGDSoP>A_@eE05PVb*
zwL75lZKvg1;mMcUN##rL^#*IS9<(Ox1t_QFb;l3VOOcFN0C|)zwJ+@~D0$zZ-61bp
zK6=KO_|)!$lJ^bxyz;6%@^EB5DsQ%s7cE~e$fNbIa!OxkYw}ij<k7XL%17^8r249K
z)IPEF+(Yn1>oH8$L+z5NdUV(FrFZzL>x0het9<qAgPxC7{h9Ple1uMNO|QNUIU4y6
zL%4FP+;4!{+fQpe^`)H|m2Yb)PhB6?P1N@$BtTU3`glavSMBnUJaRW``EK^qH-vbV
z@3~@piMHD&$cxpl_Mm*;en9UaRQk*E$Qvc)sruJ9QIGRQeWUI6cUcdTMNZX&-tFMc
zcef|s?vjuC?H2$<MC<Vth!AMyl)RS^;FY(}Bku&nDZT8&Z<43#k%Aww`rit{7p+GK
zd{iEiMNZ|r48OhkHhS{Sk$jZykD@<E>p^>0vD#yY)}I4NOzG)5Cw^6rH9}sre4}Og
zluT8=2Q+!f9(jE{@+_@<=R;ns>wFi&z4cA?$jkM}`zQFkdY%qCmYyFLe9?N$0!{TL
zS>#kb=zXo;d_!PT{nTq`JsxSicCNWd=XF#ja&%qMZ<P=6#j<nVAo<{N*A;s5Iwg-D
zyFt`+6-Ru76aioH-Hm*_MXCZHf#SOYR9~u>*s*XwNOB}QS6=^tg?;<e7fH&4H<k`_
z3`6Beva_T4Lo`czhsQ<jT+idMkoZ1FBfbw(*J#(UitVs(jXW?aaZ%~kgYzqY+hDMz
zPF1+DcDA#-krgd={@fU-Uf+-y*X<y38p!$tYJ-_AOU9J8+}Q%Wi48%sZQ7gr%?FE|
z^PD&Lv)9PRbAJ5?3A-BuMS<GDA;aELYV6qIoLXNM9<-;rp+&sikQBG0G`J_*>ExWn
zZDDZ@K^E80!pL_{tiLzhX{X(g$X0~g??D*+cARslV=wRGOyc~T9Q(cvh#OP#MhTw$
zZZXHP>$^B+J%x2ig?vadAah8G;_vAol&Sny;JYToJGSJtg!tNGwgB|2^kIn1%+W<o
zT+Nn!3|}~*n#BH|h|pnWYulNISC15>RfW&l6{=W8x~gpDY)yE(F;J6T7O1rk8HuyQ
zEq7OSs%daquc)2QiVn6m60?m%MvKDQkp~l781>T*CbtmZSc!A!%O*CSuOH`xc|HHU
z-^v`g@!H984FPu2WGWAZn4q3*V8Ir36dou^YzP=_N`xi{P7e05>c;Za11B4ZXPKi)
z)|B@cJp}Fd@_v>qzLmo3R{IH_zmE026lKetQxjj2;sl+#{YHCsM~8!kW!ILbUlGW5
zy7C;<*J5Km+waP-omOQl!!JZ&$*d}@O>|yOs|hctUD;`3>K&azP7f~0=)5i*aL^ME
z{*X(3EZ`{F`RK>Z$Y0X#P;%?^ohi-&C(a4>w04)XxJDzfMg8D|t>dSsQ$07P|9(G9
zSyvwCWIM(9CNHmhD0>X7uksmtAwRj2t{LT|J+fkJLi~;ek?QgtpR&Z40lR+3ej_u)
zr8M=v0$KMZ?NO?DCzxaHj<9%?DyhCbO50{<>A}`^IWOA->D%|S_BG}4&Xn|Al#a^Q
ze7ThDIrvs_s*~<iIjuyEs_4A}VQ<Tzc1m|Yd)>DD41HrslCvmG*GysU`RPtZd#7Y$
zekW=p(t<IFW&dM`QI8%`5F$%CYSVN(F|<>9ZFTf560vRAZl651e%*UNOI#Fgy%S}x
z5-kwttPLmB<#Z}?hVas-ZZrzM-Yd$E(IoNUmQwz$q?$_AzsRTZ^xl6kVWDGG*iLEW
zRgA^M1H(%P@2YY>d@?JN;be(XH=9P?vd%@Nt#-0dPa0>d=-Lmbg`78`KhhV*oa)x~
zbu{)=^N}YwyfmRMh*5P-Lkp8e0^$PAik(gyS)*~OG4R{HnH3~QjDnfd%gb425Mv?E
zKF}DLpvFK^_USRoF2=xQJ_eRx3|ztQ7cDUcu8o8+0!~V&@oyByzfz2Uk!Hugo1AC)
z_%{~)Sd3=hMJ$ZsMfeicz{%?xn2Ea$#=H22pwWqcnL5}zy;hv2!05(a#;6-A|1sm6
zS+O(0-eGn%9kbCm*{nCR!sT-!tZSR;XHSpu&Xgr>y<-fnW;Mo?{2XIU#o)+?X!nZ)
zi^6exZi=v+K<(i4v8i?P{uAr0gy=Voxc`(!SjAH3MWincED4wG3Plz;8BR#_8b}Ie
z4(+@uoTz$D<+@J1&+Iq(-K1yzIZukamAF@x;!ZupX;Y6oN^ng>zzjCTvom>rPHc!{
zL!7eG1+{r4ujBs^2RtmF$7NQm>*Vc0iM$7S@1no-J!Vn3Jza}ipGW^mu44^GE30Hi
zX{)-4P6wyo#tx0f8OAA{Djo<o?ue^5`W~X|GB>V%hLf5$qg32;#7Uf{?lZmj*F)D1
zbUpsS)>(mCCva<c)UN4ickr3gP0k9ZYh<DG+lKg7UAg9|9HjeJ4MtpPY3rSdm?_0W
zpKWoy_NA-$ZtqpwwtkQ2s(q<6wYDl8*h5!tbweV*a>w!BzBxi+VJB^)fqRK@5?#IP
zFjLBvvl#F7yJcT1IfIF%dyE9NH2&!C1!5KLapi_0=s)J_Lq<I6aQtK8Ry!|_P!HSs
zrGuAUZ0NjXUk|)7$XY7i57fGzu64T7bMd`-8e>9q&&0JJnm(}{|Hja0(zJeSaIUBg
zuCJ~;%?c~BGXWZ;yv-EM27=udhuiLKchIm)k;6-0I&n+FD{5Oh!OURq1+}<~8mt$%
zvX+L~j+!l7_SNwB^iUbp_@6kJ>ZzQ#ZfMM+>*f|`8^3OzJrr!6use9j2&|1@#@1rw
zLAp~D&G1Wn^KQ1YHu4;A)k*17(#zz#ktjrsK+hgZY(0?Ix(s8{+<lp*7>Q!(U*3oC
z&Y%vMTe0r8Q-_kgi28M{z=&_Yn*a@1s9D!@J3kRl!qtlz_J!y-qt<nLF|Csma(Z%2
zx36Ej5#xO&!~Fpz4+L<P#=a&4a#U~nJ}S$!rB%hS$k!;%%)m0N0!Wv)Mp*Aa?TGY^
zsjJggA*`K~#!s$o*>{lZTg@>lE0vzfSMumiTN?QS60Zu}8*Z~}J|E$n^e<BPrBy?k
zjq`GC<gAR}=bsaIou;nE;f*%RXgg)Rl+y!M;pAOz2`kf9K&Ax^rHQ^M&)A7R(VWb<
zigseAo6`QE5pUO)q)!fr@-$!1_nxvJPiSn}%XX46%N6g{GOCjH)Th3d_VA&WCgp56
zIF{c-j5K^klWVMu<0tjnMs5iQYTpxMeJ$<J(ptQ!F&}kbLf1-YXM3D6#LTh>-HT{u
znOKi|Q2?tgewPm%G7ZctQ)pfpLSMyfq|rFfDEt=Rc+5S*yf@lzPO_8YwB%Z}aAvUw
z+K8@VrH$rv`E$$-X<kU{q1JUYOKft6Sm&Q1s=nx-@2Wb@#hjT{B;mS`+u;O)eLCz2
z9v{q%um9tI7LPHH6=&QU4(wndBMaABa-w5mPEGAMJv~zXXvD5(2ft@#F0C)tbz+&1
zj47V3MmCji%xi$Z8*Jl~Z|`Su9k3!u#ud&-)40qE%JsE`>O+QstDVpATB>{XC^I_8
zqcVglFdCUGry3(+d3tdtc^|lx?gLpgi!*j&)E&yQre9djvcjX~sN3WkK<VVC_WL0l
zsa3|M8-<x02cK^Yyd(Urn62jpoEUScE%bggR?!l7WO;`%UVP#KS?~3jOJ9t!U)*D+
zq+v~;gqiJr_7d)sTdDS06?F-s<}7nb*sOC#8+mm9qj|?<mPvP-%wo@-CU$$!y~cKm
zB3&!qM_ywC3&O!&qtdN9v6?gM)vB(>H}~@2Lul@p06k*{-Lts7GD5oc);Ij5)a(+B
z>iZ4cXWCPXW93XEv=f+-b_ev<#knIKzbAls!MUA_JBjwaqBGq$%W%s?3x)#t_ydjB
zbiI*$alOUv*FV>o{XE7p_xv(L?`N5qE9HyT{_|VJxa8M|s%;#``EcYj=ygiqmT=}S
zx_(m+8FA@#^CGmOFHMi6o|zVQ9zgAru=7(=T39RB;+Z9wQ5u=FBl1HY-OB=Uy+?X!
zrrt}Ac@6v%=H4h%bnZm`$<>#M{e?`t-A>Fxn$gwIv3B0FC~WS5zWTPTe<5<gM%$T~
znp$#4C$XDi(QXQ9vu~=r|Ec~HdwiN-6OXqmwmg&+Xz5gxbi%lgGv|@GDlzwIjP!7f
zsw`)7WU#}k#Cj`kWqkDhW!A>i{0<`xwHNJ$(zA5UwcGrfmX3k9P^KU^k<+gIY`%CC
zqPcQCdXKScNaxLw2f{fe*6q|^=7;TNsk^?71R9u;i~Y93TGO%kyC>sTiZkzYC-s+v
zN<(0^7oj|%Cdx!@m{fs1ovtYdjX1mZqQDvHI6a?VgT0ejZ5Z6hdqBv0&DTN3f^cG;
zS&@X%A+Y1agtj|wiOk`9Mq9CGRJR4PP0GWrJtO_1K&R+C5NR(d`aZ<w?)w-&+dDS)
zl7iSvI^LmsevW*SfachV^`VM2hk~ZHG?+OUFZ2|1bgI2O`&Mldvk!>zIntiij*QkH
zYa=<%#B$NvltZxoVvKdx(jI9`_Vr>z(~C3IXxaQd@TXrR=@qo5yCCv0#*|5cNu_Of
z{VTGzAt`<>TED=#53^FXEKqwvdVE8YMKx7BhP=(2+%u&878|=}Srs(bXOXw}8xz}N
zd=Au}6Uf1uW2o~$gBgStXt%p3-IX_nlXe&(mWlh(19_Me;BBc{efhj#O(YSkAMDvU
z=aj}{H#TUj#eR4h-`Tq&orU5WgO!odVm&kjcc}}@ABfQSHiYj^t34Kci<$2Y`S({y
zZ#Kp!sy*!u*gIcKQ)7$rWA#sUUr(tR6B&QtWvo^wV%{xg^3O+TWx5<Qh;uOiZb*9&
z;px~h{4w*o-uu6A9fvQ8vx+f|cCA<kE4#t1KDz<F8eV=Y-wTJ`z&_ryA~rIUN=l-Z
z16mJbU31eYVL8}O?RIhfp@erD1Lc9*KF&7mMr?CRVK*2|b^{h)72j|x+g6&iXXJqe
zW+z+?lp=nW-LQb!4GWFiSwa1Z@Nqli8x|QW!=3jqgsp`2VB~>?;7-R*S#mw4cpv^c
z$U{0iZrNMhf=~$y0)<%(l~&vx@vD%NVL-0I<<8_e#ofKup%RGPNzy8;swkDRBisTy
z8#587F_b*YNjM5SLT*`0r#NkCc-*c`v4>Xk8s8J>IfPbrc5sQdi)I;S)QVujionp9
zLvrsi-l27AT;0e6i_Ba{?B9^xpm^g+lc5`S?d03}DnZy164~Yk7D%e27}hYG1))8o
zVU9tyq&mWi(A%mT#WgT+^0*S(X)7)n{4%xx8Z()@+xFQHKb!`8!g0;4cj><8U^c*Q
z3g<N1$FV!a%&4DJeAG4tT5TO}Q?MIm$C(ZDE!VEFFu5tq0^{o~ai5AgCN7D?UGb)H
z7j9iJq;0`Y48pcx#b-NLXx4?*OzmB>P-$Z~K6?}Q#DmaHtotF|H?aQw8Eg!Ov@zI;
zE$dsB%?qc%#$egG&V`zl!49#8dFU0orGeEpRYo<xJLb98vDNeE>N`u6#bI1}+;J(+
zt!%``4X{E9eb}dx&7me)tkK1srs;M&YMa9`_x;|k-Jx<R>|Kl5eQXo#4jVd^$r^+<
z+WooRA(z$Hz}82W2X%j`sl*g0>Zo05Uz2PPu%9~THrnHr{UIE~{$L#0{!k<B4>f_>
zUC!{*KwTn6PhovnfajuVG(iaL4{bIUZ8Zjdr&%9frz26BXJG84cSJY0e<{jd+4}h5
zwiCf@(1GP)CEamqr1iBjvy6|Mf!X1p&-!W^!_&=d%pSX|5n_&Kv>YY1NOp%rb7*PH
zy28mc9<FaN&D(J=sAK^?I^JYZU5q~IwPJ=`iZKz^hib3&;qzw3L$Ce8_Shd@+|Sy1
z=auT(qj6}C8i%C)fySYdpJ^Q8bF>Q6Ijhkg*?{@RWr4+5onmc^`A@P#cLlK`Zfd^K
zdw*l=o6v_?MU``2qdkpwi)oL1IP4J%oh}}GgpqlRv`6rL@T%#`9x;|Qnp=Oput&gx
z^^P;5v?J_S3o)l6`_(-3AbTls1smq0pA?m1mw+v(#k<N^g|U9b(z>BC0DiUsJ&gD=
zE2c;75`W-*YbftqUdu$&_I=uC{JHK|i!dHPA6d2$nry`yZn8!mn42^My^HJ<y*DPm
zWuMXsYn^|>I$`(yf?Frzxpks4`N!KQ<~y^Y{|lgfF*hUqpS^39Gb61%_8Mr%VGne$
zz<H#znA-{)1<lAt!$J{Bg;fpnu`*$wn1_9rYBB5CgR80?X1U}CYQJ>Gz&>$DIB`#6
z!vf>n&PKy6xGv^l?j^X_VwFfSXE|**8rzJMzT3MJbD|B{msVDag`nSxUg>3?D?N5w
zpe3X0ZFN0}y(HaMVI0v`LG_?Lemj8v>1<$Pb>rGAUTwrHhcU0|j(>brgEeie@t>}j
zl%Y$*v1}Gb6E+JY)8IA>i`y)WST+lO4{rJzt8BdhV|6^PGt8Z8X{;W3;LOC$hm6*N
z-L&(|s>t?hbRX+%bkgfHBM1v-V)i{e<4lKThp@IWy3=(r+bJzIcRhnSVpd&d#hZ<+
zx(!yoSO*2|+OohCj-82-&McEN$Mze=+;8(Cv$eHz<bgA=7>uuHD=^+w716kddy<$1
z#%@0`Rv%2PL|-@Y{P<YhXJT7Bj2~z1sG=3rHm3zfgeUkt#cO{=3u0^-!mo3_zH0XV
zCu|8V9js_Zjz6#+YbDp}v5>Eo0=3xtz-&0S<)fLo<Cge}IP9Z9@`*z7m4Q{^cDpL2
zRP3xZ+!R+AwScT<V&}$d0cm!<z9b2Isg)$Z^(W{F<*<Xa*|m`GwDoW*)2PhC5>g~B
zAw@rKPi;$_GZ!;-vV}nQahRXO7Sapz^B-#qVYmA&AuadV4L7mZ(x&h+nJgid$v?&x
zLi<QZvW3Ju?aF3{g*C*Gwh$Y(JKProxeoe2zfbGd5PWT9n^E{3Y$1+smVU%J@Rs;v
zvxyw@{EzHE$}W;zC-&c)n8nulXR)d;#oj;m+eHl6MU3N(pI{fU6XW>3xwP^4qT=%A
z_l4BBU^_dWe834s#$jCO;IWM?aQxO0G5>7dI#SJTi)FaB=D|+hc4HC01Np5Zui^f~
zvWglrLo~)We>R84hhw=OE|fMByKo`P+c<cv4J(OVyC8Y`>EH0Xe2lqXGj<Xq^T*jq
zaDOw%RuXVn)}3LiuBb7q+{phYtVCoXB5O&@a?GC^yJMc+d>ipSsGrSVVoQ4o>0Z>F
z&L2$S_7Ymz%*LIq4pxH>n8#3W5PJi!I;DY2xy>X4^Oyi^CbQY9&a7cR<{Wf43stO-
z+D&-dhRXQ91l^U$a?;eft6yU5KQ{YGJnk2`v*Uj8d)$f0iqbV|MaigBcaB^>A3rlq
z*iphqVM%Fr3^*oR%CW2;yz@IQC;I-Jqq3*`9Aj(LrqTvBl^bAFq1`0hry1=isdK7}
zXg}%yux%wPYFja}6Qo;LDi5=+1e&n((6vV(+X}t!rKx#x&`GMmy7Dx#uFy{QLX1pp
z99US|)x@+X#<H(02)Bl9B@yFS(vEj<&XcSr)Ni~tmg%SCoRE1YuAe~dxq&l~OCqif
z)w}ewPGn0lauTI2#ZFXf0Wtdz!kRKA!&++mEVh&uu%&EZ6Qi~iT3;O5ni6Yn`O~kD
zjEZ#HAK5w@<0|H(H_&OEiKXp!eIHqa)A&zeeb~pjJMse71Z;VrwyR?`EIvw`3hg1$
z`XBp9(=c-5go6`U6A49nV%>4J^IF=-0}r&2Ru!B}G`v<7oFwyGRg$<>Wej!z5@1yk
zI{<+$V!S82N@-({%2JH-u4M&#N6Esrawg{M3)wGiTj@X}H8knBuiVaO_s^s6<vV7>
zO=fHhi@H`0-*fK0A145ujI!HtN<^I`3h;UJYzMXm_D-WcYKlCyM$b!#^=ocLv9l>M
z6z3|ien}TrIpQ8x0!vDA4iCp^Hbca)Q27{Rh5NNRyLQXIBze-89%@MeV%ekQ+ItI~
zKkB%%C0aY!BYrmvVg1Ld%jvXVpdKgkqG#?A-oCp0$m^NPr>5~5B3l-idsn4SyK8=K
zqjvT|Gr~S?!9LvzU(KUYC=X{3#VG}x@8I&R6@lm%^^96~Jx|=HBCi4<9cXIY((U?`
zF58JcX8pe?qnJN`-`ZGeJ6UB*Wq*mUGS`KqPOv`~ToZY-F{OH0BdekE*EO=rcxNkC
z{NoS&VLB{>>2d3`ouOP`wv!v#j`*zXj&*S>)`dIP87o_CEb1I6H@TfXenp~BpI+;h
z;1K`kLZ`EUY@jJy5ZMx`+}+BmJmt=6uH03Jms>m|Bg<Wtm7T`RomPik60PJ(zLFP9
z%UqyVSZBPYXSIt_ZmI)4Gxy(H{>IkvPS-Lu%GgyA$J1+CJcVA9RJ9!aMD`k--9oRa
z8h_w*^qQ;EE%X|S!Rf-t%jjEK*`4Yv^qEd|bYc&?;+<(9CL;QkuixbQo~{xc;y?Cu
z89js7e7~V`cQ0EgdkvM_(`y2}+?9uwyRzwWr}J{B*U@eml^ZJvlzV|Jxwqet%}neZ
ztA67xJ*&MHWv4nc-*5hJm!I|@=8CgI|B-R{|Mj@q)i<tYHa9-`#?|g!VvVb*e0)m9
zxC;9hcEOHzWM#Dr(7!4Hdfxb#8k<Df^|7@xFMDS`w(6z#UL|Bn6?X=8m3T*2HMaKp
zuP#4b<K28?tEcB2VQlT!<?yjJjgL`jd~D6Y7*&a9RgZRbWwp0J=W~wOcaCLzidFV5
zyzE{0_$tc&Q%6`ezBb=?{_mEb)^_u8pKVq4@S%=ziMYeX9ZEEN$dj1jUc*)?t99Ip
zxage5#`#NOpUp-4x_jpSbGrWt`M2=$i<L`@Dx8<=YCjrxD8)3_iQN-3TK*Qk@&{%4
z>Dl_G$}hfkoy4^xa<Js-d=t+&$aAkAse#&Bejb(P6ZD*YEW6q-A(QmH0D7R3X2yw<
zCLC7M1W!rr+JLM-jq6R-|3A@wzjXim|N95_p?;zMq2@}xKMkB$>13BB$vJXdmHB8k
zpU<+-l84@l9RcgU-+i|A7P23Y2pl(TR*AjhwS*;~vPFT~Nct7&@=SiV{kGxMgoArp
zIY#|-=A^5y){}&f_nME0-2{8ZtBnC1u73YhGZAMwnT^x2uj0frtq$TmD{!-R%ija%
zxu?Wg?JD&33V`+wOYbsgCs$U!27AD7K}H?z1+Yx)6}FjO9;6+=A1ZO0N$eAd^)E{l
z^*y0%C3ern)#lci$~xrlsb^UCiP~oTM{6r=OH}G*DD%|-?Khl`y4J*~>wjZ?XuWVO
z{V}`C|E~U6N9R5=S(Z3?OuLW#Sy@KUZ}IaLypPt&eeIUCjSzLm-oC%IHvZH7^?z4=
zsBIV2(A!Q7r=|GnLL{LoejSZ!n<JRZ<l5`x4&#ah&(kk-_pX!AZ|0-5Y5!ErHT>;g
zlveX?<-wvBy3Lo)U}9&!x;;*FoL!n-_vgl>nhZSMx!y7Fd?cJvmsb(0*nN878KdBv
zy>B+!Rd_nNMLhO?ZJawlvox`8T{yX}MFj&-3woX*`{0iE!L@g<xoo!c(O&ajtA0I3
z@b~u{cfPuxjT7f8W33(aeb>y5iB6je{uFI3Hh1v^nrlO$eQMk3Ty{tFdDr;5d(#4)
z>FLIG;g;`|IL3;U=={{g?yI}U{Ck{AdiYS67P%D(ja`z~HP~!j_>*^oc&;ZTcOqH#
zU+QQ-S6pQ*dv~2taA5Bw<Uaz4wKq-oR6N-kNpYq`=&5CS58GI?B@(F)8+f9#W()Mj
z_!DNivG;KQ*S0@wDAfLTwEgYF+aFJBQTyXtYd^XDHy)}SIS4xpxL?)A><f|R`a-&=
zF9hmVq;+uSB?me$aGq+YZr$?zBlU;e$bLLoMty<!_r6z|+<bqq3-;}u@(cF|F<v*e
zHgCs1dZJOa%IOlFQ`uG6AFa7HvK0H}bbrUbdQ}|lkk*Vp@G5plCt-&)SH8ofN96a2
z&Fayv&RV%K+^)`C72LS6bDMH|Wzb_;^`1#JR*+2bpVdx9J-Y$1uGzmn75}*LNa9e#
zxvoUa$L_^jtgKaJ3A!jfzAS!7Mai{z!fqY^4h>0VwZ}situdM!r+x{ULYG?;=5QUV
zJ%6JrP%%6r-ocQ}XQ(|=XFF3Iao&(DSUC<o3q-Yn{VG0G@j!%rUx+tNP+ewrD#nPR
ztXg(s3)Ylf>oQs2SYyYrwDa-Ut<l>#g|~AG+PN*-d0{fOwD$?crdpcXISYu@&MXV{
z<)>i97_8GYc0Gyj?8LpdG@Mb}yBnVNKjXYG>8Sa+$T?{%ai^(tTJ%YHugq!BwOSK4
z-ajK0SFfHX!nhj3onusU&k|7nI16gD7`E}-*@ue0*b&}#C}hkkIdd>QJ)D?0y0L4~
z-0*^0v!PAjvFUYN==soC_eg3BI+tTRC*gUh+2N$!;V)WGpBL`1`{Ld?yIb@=XLsD8
zTxR3h$6wXw<0+T+yZhpQ-`%wS$J!$LZh}4t%{?si1cdfJEOcLBR(8Sebx%yloNzq9
zLJs8`?7I%5GN)(Y4p#X@USl$Q2+v|$1zn&Me?CW|TVWoN+t{9UYcvy;B~(vyTDUd)
zq5kW*A6{E^@{P+^u>0p5Y$o(Wdm*vT04N>Bq2&UODmB?UQPL1fUevwO?n$NY-e@L8
zzcE$o+Bz#MAv)^(^1@#vUjbarHSt}C;#~f=10hAd`QgWu%PS{gC`wg)T}i$uQ=(rQ
zjYG}Vv&9HeQ}MPLk`%K{wMEclb8><{Ie})&M6yzUrgE_lzK;93%0;r8D;J%jTisv;
zQemUd!c%K4@s5zqc)N|gd*p#K{+^KJ`m%$qTVSTh&(5_F?+Hnz_k>vW?QvbvbH!`$
zBm&+OGTmJd#5zMqXWjn1-yBTiP5|Rhd>!jPAw03cvU+!?w~b)NJeYdX^G!TQEyi7z
z02wPrr?tY9rR{nJFbWmRaR~D^j6?DDxftUI^O1>0qSwVpg!2kbjpa0cU@S5*3JreZ
z+c{r^@>!46T8v9yym+X{3=Th+#-zU2m!#mV>dWzC8Vg2U9VzO3MMFGhhgL(|g7S14
zNe*st&omu=y^x+$pxcw5$>mS{i?fEPZEebsF3!k<W+2eHqQPPvceWY2knc{KT}c<F
zLz-Xx9ec_AF3@*VLy~QL$8y^^^NPhCEgnyFXW`vGq<M9<{qVQM(d?td(XrY<UAu`R
zI^k)s6r4_GUB&x<n(yB~rXS%nVj1<N%F;~Ulju1E)sO5%>PJ?KT&fR0W9{upChtkc
z_BD7T2>KD;$VN}0QT^!|!&vqBLAn_;r%lESQKwx-|E}WyFO$EyH;KY0aE=MA`y|$V
z*d%sRXzH}k#nYx<J@LvJlc!B(-Dd<5HtnjJp=pysS6(>vl8NFQth9b0NADaS1}K`s
zg1`h|AKuTJd;-q1U<{@)pc3OT>59F+>g3$q+`QcU+`hR5x&3nc=MKm%%pI7Qo0pfD
zpVv39Ag^Cu|GWWtg?R(>bMy1^^Yi=W7v%TL@1H*)zc7Db-`u`=ee?VF?OV{dU*G<H
z2lOrMJFp<PAg>_5pl?AzLBE3j1p^8S3kLSf?U&atzhB>e1^xQ<>)&rczrub4`{(x0
z>!07hZ~ub+{rdOsKcIhM|A7N?2jmUNAJBI|!GL}P`VSZ|pm4yz!ra0<d;+m=VL@TP
z!v2K=3JVJd4nz?LBKv_5JrKzTB8cj%9Mzi~)twyGpB(9c9O;1^>4F^B2mK(Okb_>h
zkN#=Wk9}8{@%MHouX%eP(bZRuNaZi{y)OC7b3s>bf9QrKl*zVfU(D|c|CV1@l+qj7
zCp`S*)Ajg-+`ff&*H>=&Z~u0ljhd4J<ADSKJE)8_P3?itX7TqY)A#gR0TfR53woD4
z&D-hy?sU(jaGFPvzUiLO3843&Q#jr0y8twX9S4K}ax}jrt#<?HI-s=x@so|D2ap5w
z1jxol;e7!5d=}Z2@&MZ3AXfm;_h)I2G5{z9h@akHMIB-ga0+lLK;cC|F%Sj@10?`C
z2RI!l1BL)Y0ph3Yb2u;p7zvC5DEutoY+y7n1~><x@Ug%+fV$Xu!1(}$UjU2;%7F`k
zivS9z{yq_)F@Wd@Fd3KvTnf;7fx>A{J`I=-Tmf7OQ20#XD&T718lVE8@aurz0JDJW
zfg1n{uLNcTbAX!w3Y!Pa2W|!y01E*MUj!@$mH@W`6jlW+1#SoK0G0t1z8ts<SOKgA
zRsj@#4{$GVA8<cV4N&-M;6dOaU=6Sqpzw9TdSC<aTi_9Z!XE=32Wo(gz!LzuO~6yY
z)4=b5%>eN~3p@ur4{QNm04RJbunl+-cnNqJpz!U$E5NJ3YryLOg}(v33A_dT4^RhC
z_)cIK@HX&A;7<UB?*{e&?*Q)t?*SD47vQfzJ@5hWAwc0D0UraO0DFOb0EHg_8i2n8
zp8}r&6n+pm1biXsui$?T`~&y~XatDwTi`q3U%<bC?*R&@fApGe`R#dz*Ko5qARb5n
z0s#J45dRW^B%meG3cw#r#=kZ|TY$bdkpke4b-+LRPDLuv2}lF*$I|hy3y=XE2ZR9p
zu`K-S3UmXy1IGjSW7+uE1E6mJ_5|?9dgEUo;6wl`B9;f>kM+gB0-ztz9~c1Oj}64X
zlYo<fLBJ^h{@7{wR|FITVPG(TKURu=4sbe91`Gl4$IigNVZd-;1b{y_3jfXo&H~N`
z@W;mB-#NgqfU&?h0DtT}{5v1`HE;ni9>5>F5dSU$_}vEnL;!#668wt*lYuF~r2zie
z<@h%hm<CJ-t^n}Iza2RfKdu6<2Cf0{$F9Y{>ww<?vw-UX{IMJHuM(II%mHo!@W<xi
z-+bU^U;(fYz#m(Le~W=7z^%Y-0RGrg{JR~v16T&!3E+?2g?}r6mB1?CZUBGmUi`Zc
zxF4tn9stNa2>&5q4X_q?7{DJ}kAEA0-vW;Sj{^8(kK<nrun~9ycoHD@6#S=w-vOI}
zX8`=M=kV`&U<>d9Pz&IXZNtA8ftP@nf!_n<UV;BA@EY(s@CN{Y>`nZ83-}+P4%h+U
zkL|+0w}C$be**pt;E(OWzjuIlf%ky-0sOJQ;$J=R0q`O4HvoU^WBmIB*emJ%@DBhD
zz~6yS0sOJg@$VpT2>1f{62Kq(8vp(Qd;>HB{{-;IzQezN0sjWR2YvwX$MEhxM&Aap
z02`n%`u0cy5CB>LL4d-O;I{-?0j*_N8~AO3c0dZy9w6S1@afw;oq#l;GeF^8;Aa5G
z0U;n0pzyBny8+#S<AD<Z3hx0w2j~g(0(t`!ej@x_AP>j~`U2$o!S4?Y01APD0P&v;
ze-LmAa4K*bK;gyk!@yvm1Skb4{B-zbzz|?4a0Wo(!{LtrMgpUNGXV-e8$L}o#{lO5
zzXB+H9Q<>E^MLb#Ujr0Q-$E@1E(9(DE(R!kBK%3fB|rq23{d!`@Gk={2c`nk01CeX
z{*}NCNnZv3YTz260=O0+zTd!~1zZo@0Ne;r_-y!dfSV*e5B_}MW?%uZ5Foxq@D~G1
zfLnpv0196U|90RGU>R^HK;d`6UjeKHRsnYd6n-!K`+)m_YTyBY!XJeH5U>VV3p@-^
z_<HyofZqa-$gs!YKMvFY8-XVP;@t%QDd1_~cfe+V!k>lz9Pm7_1$Y6V@U8H-0WShC
z0WSj-z8(H6z^lM(!0P~ozXAVE;4R>PWY`Y)JAqxm+cNA=@c#_#2KLCXcj3PWybt^Z
z_$xp%KY;%s@HgNi;A4Qo_rl)?><1124FH9I3jZ_UbKoFw2%zvU;eQ2u4g3T62B7eN
z!v7Zd4)_=FZ-ByofKML`F#vqZn5plt#Nl^5kN^aL769=l!cPKP0<D170EK73KMn{1
znLrjm;XC2)0^SDb+cSRxD10~kJ-|DXeh>cpz+ZsB%CHaMe+c{y_(+C*0)H<+Yr*|8
z3|krO@4%<PXTawG<#7o97r>XmSHRZ*h0`~u8i9WT-vaVmRqWsR{XOslKzxP`od6bK
z0~8hyKLH2;Eo4|C{3M_y&`O3S!*2t$1=;~A0HyB$zax+ebOO=<3hxQO7tkB%1Dps@
zcz^f<fI?uP3_BVAAm9|>R2fzTzZeJugMku&(mU`^2g-mUz)*m~hru5Xi~vRgqW}s&
z3;x-_XkZL*4nW~!;g18(1<nJ`2Ppgk_~U_c;6mUcfWjxhr|&>d0xkg}0EJJ1e<^So
za5*p)pz!JNuK=zDW&kq*3cniuH9!S$EpQz`;j`dh58MFIx2P%s3ZDc2CSWcw510>7
z_yYI~fm?t@z+!;HZ-svwPz5XnZU-oQ8T>ne<-lFQ3V^~_!M_{02e=ow51{aB_zwW9
zfd_$y0196V|6yPqupZa|Q1~O#e@yyMNPm;`pN8L@vzW~`wI@l+`4d=t^{(RR5)ZPS
zDPDejs{k~uZG;P|AKbTmUrD0$$*fm9Z~A17zpX}hV58f5`8%*{+ZcQ;Ef_m!{HYq9
z&K^qkrcc-6GuS#>WJO(O^cVf0@6PXT?M<Jh#dp)_Y}UcYpRL8`XmlSox|LUcA1ywY
z-9U@GsOua3ML#U;QY`niUx60iU!zZAn|$qek`_Nmql?%FzV<58;=^ojhBv6xOQ3uX
zOZBC9wD>ZO9>)6n+IyH5KSHC=VrQX0xb7_XCw^Ic7sU;-u!}O^*B{2Zk(~crjlO`r
z>}$^pm<jr!DAxtiU-ZLb<r+PK75UnCf)*cPbA0U=(c-6Q^i)>uYrm;l{B(_;$=>wo
zf2J0HwMJjZY#;x1TKp`Hu4Gxh_Nvt4XKVC4cB-$v=4tV?Q{*}eJ4ILe+KYCMTxVg|
zsK(bmRc<7HS$sFi4YIJC^qH?cmb;Ohe}zWh!+QDn@6qD#)9BS~s;@m)Yw>Q+p$H4R
zQj2}<xlZHXpwW-9XMFARm=<5dR?;R>)IAyfML#U;Y8~{o*Cs9gX^noCwes;ltHnRB
z(OX%LuYI?&3($V<RlHT>e^H~ivwM8)NxNsRvpjbi3bn9{_KvT8Xjjd37T;a-(mPqI
zkDqqiTxaoJH!r=Lo$G7Q-EJg)S$sFn4YIHsSK({VzqpZ{zh0w1VrzWu`H>b+yLYa$
zuzUBOuRRX9k@#itT|GC*!mi%8zV@J9KG#|7E7rjmPrH7uv-s|xm;ROw^<9tOx{>&0
z@m)bTh^D{`eC^4nEl~!{KaB0Z_Mlxu*J1vl(LuxZ@dvf|B#lls9AEqS3Xk&olnJ_n
zF~Qe<9W;5V8l7$|^|fER7N4QfS;nirEVHzD+O>3@g<Z=}eC?C1#rHN$Uwm&Z{zQ%L
zYxMW2psyC+PooDKGkxthP>VlVqfaxQ@U_or#=(|`=PrDj#$T+_rAEH5y-JNyXpf4h
zN=h~U(>3}G<9c6voT0@J)96vgCSQAu(&EP$JAL{cqs9M9qt7!w^Xd0IE&kUUeW8)%
z<G)agzgVL$G0J`Iafuc`S)(sE?(?<B<y!nSjh<n=hxT&a3@?G}<0_55*2wU+*R@*w
zZ#4QwW03Fqx>1Xtt<m$0$-efSr^Vl_(Tj{~UwbYxUO@Y~cZEe7{}PQ}YP{oXkEL4t
z9U6U?(aOhvmoW_OGb*aUyEOil8hx*Ei?4m|HC~1O-Sqcr{P!Efee0FgTKt1X(AOTc
z6Ye^T?}&Tp^+vX@J=Pmzpl>&S+A(*X#dprV^y9{2pS~a0_%|9EzV*u{E&eHEgYWu!
zN{j!UMn7k4_v!mNEq;qeZ!^C2T`$|T_?L_--}+^{7XOM-=u7{K7Ee3+uCuVCf3>eY
z-_+v&N27Ncn|#;XE-n6#8okH(hp)Z%Xz}lA^k0n>AOByCVzjS23nj~e>nv_T@X{X}
z6~6W*i-PMcw%=IpYrp-*GiV>T|B%JObr!cgc<IlLPks9RT;o5a(O(-qef(c*@norR
zodrw9WM6xHr^S;6!*v!c7!Ui}!=RnbsI$0rBT8aCj5i<kU2pLke?X&?%s=?rBT0*I
zV>Y6FT-Qd6Z>P~6&F((_j^=Q*m%FO%sPT8w=q~1DU;A~@;*ZnluI9bI>#wU8-(917
zm^*y!)kBN#snI8zt$q9_YVmpI0N?tiK#T8Z4)?WpKP`TMMxSin=4-!`wfIvsy4ZZw
z*M7z3JJ7$ozA4uD2W#}{W*c97oo=4!Yp>Ha{vjGY+&shAUc<Hcks5urd84nr&er0`
zX!JO9i%<XKwD|Khdc66aPv7IU_zN|9qB+pVKT(UnM58Y?f8%SPOSSmRHTnv3rLTRi
z(BiK$xBK*el@@=EM*qhAw{QIWjTV2sM$a}o`}k*T@$<|9zV@4^#ow&ai_A-X?YBsa
zU!u`V&Go+aTdKw1q0x7ldwuP3mlnTLqwh7l`}ptG;_uh!2hB@-?f0M-zec0ioAZ3_
zw_b~X%zVPveq_CKoyDzqUV4+c-`5^w)pMQ2t$SYjSu?@MPu4!yS={R9rMH@0eeJo`
z{1w`3bd-gxg08c;b<j(1H}CYd*LHIk^y{v7$a?5H?0;zV8)h3{dyrMpb(oK6^bYfE
zUwiD(;{Rk`;nP1^A6;j$cg_2J`hQo8e_x|NF#qV&=LcFmSt?y;!BY99PoI0Wc(P!+
z&VmKAwU7T(EuJi!uCrj-9PGQE$kORLi(5Rs^gqqnzV;ytsOvDl(C8n`T3>r`%V;zK
z<`>u!ah=8DtbhCF8*$cYXrH-J7P6qa&f=C-FP&)p+SguWS#_PoEv#NT*}BEoe#sht
zinYzxUMX69s`Xc&zEiCZI0QyBmMXwxo$c>@{Xf<Evn*d6;tlq=?Usi2i_$dt8P<uu
z_92U~>nv^=_R?Lg%YE(B)%q>;?_PghtshWd$~$)c-8K2y)_z}mWLtf)1x58M0!$XN
zr(%oBrMufb(OxSMCtS9bhx~#d;(^2Ko1^8|+Zy6)zuwl>NM9|4;eT&y9NHrpzhcWf
zQInT%J?d+}eCrQrFIQf^H63&Z$V&hYFJFNsZ-BMe*B%3`&Y<1;4zSjP?gCk{^*d0L
zH^>_2Yp+4pU1%@2e1oj_5ueqhyi+xK#nvBv?Nw}bM0>dMimlF&cLL<a*56=Fo@4d%
zwTEL3{K4D5bM1@JK5qYVwDe^feTKEt*B)nBzk~kW^k-=N!!>%8wacgfQC0$I*9tL8
z<3CHI$5^F4eUGtj^67hw#{VmgKG)jj)9<;K<<sxE8vpqkJ>JUn>2tg_0{U~yKVIX%
zP@^YU^L+Z7U_I#T&l5EMNg6%bs`cq_vh^kO;r5To8vmslJ=Mzd>2Inv4f-oVe-du0
z#y?%7XIPK=^f$x$9Qtt6&(Qd<(&!4SrB8nq)=AKxo4!KhzfPmCx32K%?|SPt=&w)}
zpIxu<->A`ZtS5Z>n`3<feYol8X#8_E`ev(}Pk%RC7eRl6qWRyf@h{Zq#a6XXe~YcP
z=znhg7i;{tYV=a;WuN|*T8Di4TdMKjq0!5&4Dh>dx#d8gZvM+P{uLU1w{;Qp?Yg_I
z<<O_Azq>X5do{Y+dflhLYAfK=f3?QHTBFxk4)pE1HP!;?&(;4LjsIbd-e9fu>2HHI
z3WGgKOaV;xxU~!VsflK=!5WABdV?lGhu>cw(d0jF1%3K`T#J9w%J%i&C#@3b^O0zN
zPip*6Y4m2R!q<N{TTerOZu-sEJ<vxk<k>OH`>ZB!i}jUHpIfYx(uF?gq=(5~wDJ+}
z>SK%btkho;mtRBKM4iQIHTf@EGf^Jby{N^%tkJJnxBJ@X6{{BdbnEwu#{Zf|zhV8u
zr{6cM6wq$^H>|yoM`fou2x_L4|1C}4PAk{f-*;LQpnvyzp_6>BgS}OwcU!A{{hdzu
zxz1wmS@k~s(}_RVS^V^$m;S)Y@bS}WK-XF96RX^(Z#o(1I_y_kH~941VEq>QsED%A
zsX^CaJ)+TvtPg$qrPGA2!+J!cajMYA|BaOneY*OiQ-`jz_~}D0{cmfOufNl2MAu>c
zVc+W0FP%<w9riahI^KT6r@weDKG6>P;uE#_WP6xTzsdF#=yO&y%VdqetwwjS@A8cg
z9klpVjqYr}<<nnh`|r@-f@pr7HU2Id9kK(y{u{CfL7xTD^dWmO=rYi)0UF=N%Jv~a
zhmUtzn*8qebw2%fw>Lw7uKe!yAe5hIalPs5r4uxHJ?($^?vFj~Lg>2^>4od5@zcpr
z*I9Vs&pE#Soon9&eY^U~)%f!@y1)IbPv8Bu_>=A3K7G=uQ`cFn$o|ULUyHQ(utqy}
zwvXS@;^~B{>nxm5o#fN^F#93so5p+L=me|lEPj&JOP^(b=+p06b~otvt0>D^T6#M1
z>N=b^v%^09j<u&jzwZ5?PQ<#-;wNLh^ab`>pML42tm|;zOrs~*FZ=X8!LEnC-2CW7
zt?Mj)vervau~U5donoH_{ki(0leez3_z7GuJ>9PIjR({1x1c|_e^1xaU#Zbo+sVH1
z;%d7O^ylV(wZ=~;dR=GXMDKaN@nV*JyS$zR7oGTZoyAZ7dg(cKjZc4bG=4e}>^ci4
zg5U7zi%tl;&f+J9y);e=`}pbPu<LN1O{16Dr~3NuGJ6*EJ1m-nP8hom=i4-TmHn)*
z|E{wC1$|DBCZUtauCw@wWG`K9r}_GCwSBs;|5j`1S8McI`vzbCU2ES1{hlAqf=)KO
z4(H)CS|9&v?D{Lke5((pNm-`NPQZ~hnlZfrWSK#BqUXq5GQyI(yYh*?o+fJ2C1dx_
zJKLi8A!#ZWX%Rnmq~OU#aF&_O#{Wam)CO5*2RyqZ_Jahy)B4LM5l?$SS>|qQG;S7@
zhlo#S$L|(26(h^cVjts(CB=gcbT<3zW<k?Q;4HHbo2ZpP?L%++0`~oIL5uR8#6HB}
zMDpmG&oYbHZ}6}t(NwoA^Al@$rl4sLD9d!%A{30`MfzcE#FyUmXR)z(IF{nqa{jUG
z*-}BT<MajW_!k9DX7ns`0$W}oXi?t?JLy(IXYu%{EO(}$YdAfVZ5kqIk^gn9-$6l-
z;_;QN6^=Mk{#!Xck6n4KpsAx|nTy!@m`qUoWt^^JskaOI98NE1vsVZj*@FKb_T=?~
zuH^J;w&y}YpTy~PEO5G@i#YulD}GPVr*e7|JEc<4Ih=l$t@uRHqdC2m*|gatT{8T;
z=wV~&h`z7J%fFrVdREY)KfJ*@pCRa6@Mf7i*%myMOZ5}^?`BVK6ZAzq{x9tEO@f}!
z>5tgAHwapk?*PmDSkR(<4zj=DA!m|zHRu0|wVNVn(civh*IpuMp+DPLxKhxfzc6F=
z1VIaZ1&!J*f(~(c$;P591YOSQ4#wiyf)>}qC}Rm8rl$Nwe(8p}M9`vtWElx~xSHZc
z`(_)LJTK^UF0Z%o&?rF*{q!~d2M;F`e}5i7(AbS5okUl1y21MWI6<G!>C=pqZh}tZ
z^cluvRMh1!HBS0g&_ezpYovDleet%4cX;|SM!#zWJ(SZI8tbm|(&rg1Y6UIIe~D3v
zf>3@U{pH4OF9~`%Pd~%R#*tl$M={a<*BZIw1zp7H8;v*6uoNH0zbtc}v8|<`Q7q7l
zj2k@nuVjQhdZ&m_;qmy;WwD?OIK9+(@l!#M=JZ|0n~+ZO#r6A*^%fd}XwiQEww^=7
z6D|1fHTM2V(4zl7Xza-M#;-T7MIne^wD;r21)4tJsQ0FS%9vOrXi>iBjMBdgT8wAg
zjJ>jbsBT$iqMa5J@f|q*itz<56v|Jef794_K+q^Q_;(ot69g^BuRTV2iJ%|h@qabS
zQw1%qmyeA(=m>6o_Zxq}5p<$OeLpwSdkOjlp8jj2^B_Ts{J%3+>=pDV9&ebR#|ip%
zPRE-U<Ov#TM){J=G9)DVGdbPH+*KuL(SJLd|3*il__aK~i+O)PLC@iIS94yupiwQz
z>tRkCDCnV_KGFR29dCR;vj-GQ@<jWbY(Djopht85V)Mp;phf<to7>w6TGW5IIp-8X
zi~62zhV}~@&4B#JnV)tP^dwG?H%BB1dNHRbnxFI+w8;NbbHv{SEyjZ@%$HjT`UcK_
zmAND0<^PTO^+Z9J^Z0pYf*h~VjL3hs+52J<FZ8j<9M@jZAs)Zfyrzesr*Qf%^Q%fh
z2RXgNJOK+mS3mcfcibXqQU3?c2igi+wBLHuND*{8Pyd*iI9Sj^Kby?_&jl^?^Q<{{
zhoI+j{$zXNSV0SYZ#BPyA}Ie5kAK7LcebD_IlbLX{->bPO;O(t_6Y6zdUBVD7y13k
zT-ICAqCdQAW}YbMVLbf@=7YG9C_hpDy=K?*1U-Vse`>zgNznIk`b)D#qM*BR`k&^W
zUkh4{Z$Fqz-x9QF?>Ou3zX&?a`4g>eX@W*K!?WMX)+rfYI>q`L9i7Tk&f`<93%3ed
zlrO_NxY`@v)w=ruK|jR#v#oP9eY|lzBBV=(U%f`~KZ4(F&ED3(wD>XzqWndCzSW?`
zKR(}^-vFy_ofHm_<kMo>O+U!;zWtlx&tB+_FSbgn1znD~wx(kh-Q%Utuo_kgnzCtY
zj<R0X%5xA6<K{QU`bvvmaj!T2T<b$E{+T&m`QxqEwE6_mQC;~Hto6S|L8PPl{Cb`@
zezG+m>4~5ES6g$cRo+6}Uqt&A+4XOT`128;WzMlnvc3E>EP9^OO<!T{N)YLDIR66s
z#oI)D5to0x^{eTEre#)^d6s=Q>PP8C{2Z&dDd-Z;f3x)he2T9CvdmTXyAKOmly|YU
z<#j=q^Z2#)$`ictOD)<lbj!Eg>gX%a-PS?$KR5qsYYqsaMgD87_zi-79${_G4c2B&
z-+x~w;^TS#{q1ki5h?v<&i|w}75aDS&DMGAz4EqLk8AR5pS+XpVLo}USTD))2>EYV
zb6*wmgnr($-tQ*p058u6R*`mneX`xlZ`h}4@$YK=t#h5=U%=({w6|&Hy%g&!<*0wX
zt);&Xk9-h^xW7C0fIEadG2RZdbLILs8$6lj6ZVeFyzx`)+olQ{(-yS<1$Mhjz42Gu
zCu4k4j`IIP#t*{pEOWYDbGhIb^aOj`@4fUad+IbVJ=UHq%kwJIXPTSrPw@x~mA{C~
zyVXvW{b>}Zm)YOQM_Q^uXPQsjztgU_S6&wKi#UI^y+`WH=KPP?6+Zeg`@P+QpY%cN
z&v!ob(gp0hOhJqJl*8iQ7xbx|e-oSSOaGv8oiF`U#zVgJuNV)$C(=`Y&ocX&<?w@e
z=|L6w|6{VP(myDDQU-<RkY9(36^?#WedzSWS@456wlsl!@Lf$lUYf96(yPhe1xpP1
zDm@bO^a)~K9sHw|8<62a$R>UqcPfK#{aMB*%J^2|Jz|tE^)t$s_@eS#OFqnvLKOav
zOy5q1W6nX{)|<Y>n;y#M<x3TIwIE*ZkVWzG_*M??xjeqJCcldeKTg)`uQK0|42KZ>
z#FtoQcvl&YYZ6uBdV<GtFs5<&m<x5IaCs~%2TI}Lz0h_PuH;}2!NX4!`xe2EP5vG+
z(#vY%Q+m&pe7LwqP&o8gPCoc5rGE?gXfNEh+;n|qy8Z}+%NcOE{(Sl$DEUto?}Llx
zkBgF*6P>pNa;V?oa_9N;d{GVze{Q~~N&aG~2YOKkTuxYqlMtdyC4IVh9~;$wKEkP9
z&y%m}k3#bNhf*q(jb63^mve@Ae;k#E>jmj}_;ATTQs^t=peg#hl7~To%fm%Lsv&(2
zBOmF<k`FzS%Q;)}jdAOJ0mZ9)&XMs*gs#WSOY$=0@wuFFG9Gh3G$Bt%<6E>|=gW8q
z?L*->rpK=fRnBr5f01an40?$OT+YQZe4^Vg9fSwJ5%nl<H2Jdw<a7Q>l7F&TZ&7`r
z0=FDfWIV?7WD3W1(+z%xJSLcfv6<@&V=#pW>7^xbIn!nMm9k%{emz5mUnScI?aKMD
zmf;m{f9K)X%JARFdUC5b<j<1fH}K>v=SHm8@ss)qPd8h}-z45=7_{h31BkaRF%Bs`
z&Xs)Bx!`hc7VFw*J7Vt0>$ga2$3rro#WMa@$VPh758cj!2^NWCIk(C9rDA_6h?lgW
zX<hx^F5@w0NTF~wE~)f)%J{pq>u!Y%Uq!hfj$ZZxmvc8{z$ZDW@T1oQ=A^tH_se!_
zCHbpm_-ff-=tVJbIS<P4HF8{PV~OjbttI*g`qOCeQ9nW#=RQxjR;I%oDTII^(((S(
z&f@Pyq<+Z92k0MNgX;lJ&eNkwT{#=1oJSD|m-CpUYv>FB>Lrg&=4=$#X+{T&w|_=Q
zS^g&_|5H+LxGo1F9gPR%a-Np)n`Jrm_-ADNb4Ww!ls;9vKQH57kmCgIBVpoG{i;^R
zZxi!!>X#9USL4HrGX7=p-p!2fO|GvD^iOg*znAf^h<K7q<&R!>ugdt>#rr3NIL5gG
z@xkLP{{BPqX<9-)nHR`Em3&pcKgjfN%KLo?mMWS4I_XzSpO4=d_mHKV{w<jvYwK(Z
z&ywZdDZ}5E<5pME{#G{`|3?|WTc$(4yj@T}KF+H0?U8)%$@V!xrvHl!uXocIQT|9j
zlzf%`1IhQ1ysmo4>%WVX^RbNItI6Ll!yBahUXuUsGW;{i-&=-%F2fIL_xmqp_}5ZS
zuH^rR3~!Xzm6G#M8UCH@FZq_ZK2WcRy!HB*<ojNZlhEJ!vi@_Vk0FWQr>e<U`uIVn
zlXKM^%Mk6>l>XxkF<t}=F|I2)SX=UOBvIJtso(MI8Rc9q^MBTxFXq;qA2v1KPYR_T
zU~}W)axXOpHY`q~v-0|&{<lbZ+r9E&yX1Tw(V5{gPL}fU*!UpgLwU|3ALSvJlP3A`
z*!T$08K=m2Ri7?0K4ggg1ASD0kJ49?ukQDmlCP`5_mwH13nU*rmV?L2dAW`^_`VM5
zy$InMC&_Z0Ame)&;yw=f4&tNjg9$iK-%HqXgE%Hk>7(&5#_{-EgWtb0<gwbEJQ?2C
z;P2@TqCauDP2KMcB>w;*Cy4rTeJOnu%J`GTndl&{n{HH({<0o}WIP5F-kzt+a6ER-
z%U5iOdARD=VHsW`+XwARE~iw6pDy*T!pmg%P+3oTd^ZP=nREHWMZ4#WFvNJP(v6bw
zXBp!DJ3?OXBenbe*^+OJlyi<Om+CKLW&F8XJDw`beV&Z}wK#)L`r-Hcvt;}QGQM11
zA7{&PRq6La8Go@M?)Pe3Qt2ni_(|GzcZm$2Ec?AYMw~OnEk`P~le!)*ll)U<JB^d&
zn<m4rknJRo7w23l!)J=K;XxcT?hkpvUmxLqf0ayEVXzSKBOUKg7vSUq(ddVm3i5tD
zQ~Gp$(Y#@n^x?4_Jl4+Jcb06I>m`lH*G<G{jF;uF6ne|RG3Jvf{301XNA`cTqZ$Xe
z+__TDd|5ukpNa^&etG=OGJc_^N7df9$oR#ENQe7}?>@6c#@{B!mmvBhuea(?RWkl|
zL(Ip9;0X(4oPmDH^S?vJ-|6<ZFvY9uZMlqJA^SDvA-r8C%W_~oF#-HEuc#y+`ko7)
z^t(X%@K_EWi|6{iM_%`s=W{)%etEBqzhC&#ai?0NSIho!xy9e_9b7BNs}JP50r`99
zh1NPTo=4Xk56OJiOMRn0DJUPUZ+JO3$oNN&GM^ePpGT#fjj~^$yt$MQj*kx`{|ebo
zC^zYe^mZ%xn+*P5?BG-484N1-JqWk(n0z(-Xg!{g@;5gje}=p-LOz!Z`OBpIRpdjy
zlJ^j3>v@B}KRYV_87Y5D6Y_D4o!@tVto&`7{1>GB7iGVLe)>?kpr11GuQ^KnY<KH}
z<SgeUDgTuw<X?M~<^O|L{#T{^H-0Ahb(;J)rTiUQKYaTr`}<BQ=TAo|NAJ&nmU7-{
zqCec=>XXl#(BG=49nqipybS$~`Z4vdYWUQjsozEW8(wR`$A`Z(A-~cR<2d>omkaq^
zF65KkBlc&!27$}}unGBdj#9qfpZ_N1f6_#Mn0u7^L4Wq?XRnlhpb7c&kFxxFe{PWS
zKl_>F>;3t2DgO(3A6zKsMYqU#Cfc(^_6NHDqy6GbneHD)neH2z?pv8|$&btruaDsU
z<a_Z9UGO$>zYL<B1=P<_&O%u}y3a?;`GZVnnqt50$ELIJwPDD~!D}UG{uI1j&Kr>*
z<wN<Ye2PFv^GlHFf~J`FD19zFf<6;vx>iS-uC+|pR;E+>JW_t`WV#NTUXZR?eRh=T
z(vC7+XPGWT(<kz4R-ebobXlfY$8<NvJPVKSOrUnSN3MtA^ZO~rp$)QqYGk`?f^VIG
z@2pB19?R(}<z|~=KOX6Mcn_&Z<iqcG$mb$NP(IV8&)3n&XC2Y#2amv~_NV+PAIdM<
zA9~7s`W&O&d`<3&Qf^<Vm;O>O)lx4HNWH-4dg)`u)=QzL7rfSk_xpjS*xxFV{T_12
z<(wqr2g&*%U#=(Q%k>04t|$0hPslf>o{+CkPp3$^MaL+&M3Y-A<(8Ua{rQlb=cC<9
zWIIv$qwVEL{vmSSIaK<?WcUc-N9VyKP5ynIjI~lfXUhFV$mjb2*x$Yk@@ap!Lgq8e
zo8Q?|?l~s^{toex%lVZIA1BNG@Da*=uH^r<Ebj%<FPGsL$#P<TpA7jy`S@AR#WH-I
z%y**6iYOlCzli+avOTe0RpqWkcvN4PNcmG_`N2mn=TaGdxheJoFn=U{2iIG|ZV34#
zkLDqB$j3Zn0eq56{U$1Zs+4nuyiPaB`^9hNycFvc8m}z8PK3shay;fn<Fa+NtpAlV
z{WV8OkJpRDOkW|>&l2_x+V9PU{2<m@d_9Zx6>n$wygsN`C6xp9m@9pFEa!SDr&80$
zqjFyf>23fY>4VZWsgK!G&RmmG4Kq4Reb1BhBuU>a$LGf+y-=oGB*)*!@rFan2lqpA
zIg4fdt)hNbjSRm{hTkr(myC^gQUd%LPl$ez@ub`j+hp-^FawVPK2Pya(;GtJ|Bl{-
z34gQ2ze8g^gEv!SDNjDRoI9la<+A@k4z)ux{w^86O4bMQv>qXO<Z|wo@%Os%)E_9`
zC+9xN_kf#E4)LL!<Z@Qa_%&`kwKK*0<gAr^>s>xBM?U_Tvq8o`>c(?9i1*2PO!94%
z{R!9QSmYNSSDujZcx_5I3YU*V<~$|Ce`kvQ#OLI7fcXizoXs-+Sz*_+o|oaz$?zA1
z9V!FuPUQ)1p*J&&en8_?#tV|aR`S0n^$I?&SJZ=FU#k6Hl6>1u{{1f6H}uux6&e3J
zdh7V{7f!tJqRHbgpLqGj)30THuAF#TpW?HI_nBBRc|t{>nG-8!_8EWfh_h$r=ZzmW
zBs_T3sPV<&A>&6B4=+9Y|6}i6;Nz&u|NlwSmb4TMr9io-P%uCVn@!TDP$6xT&_aPg
z3sgZin@gLNGzrP}CRHOBEmE=Eq#$UJezi!EaxYSBkg8QtgMw5=4O*q8RidIsMfiQ5
zIp>*u&dF@Dv)K*b|M&GjuXZLg^PJD;yq|OC%<R2-)||>|kw{alHCj|0iPT0r8X`rZ
z$nt3=v!|~pnvS2(3sqLvY0dN~sg}i}wP|cw0NSEZtTnQ-Bi7#3vZOLuFuPI!2D@s&
z&Y6MM25hWZB|uZniUAucMp3Li+7#<>2h+UOD=Mc)A}gEfV~z0<m2BDrY6d_Js2ngC
zMxU=zC*+VPk6kGMja@Zhb49-=+gP(ofTo%i12(j%sID>E9#P|K-pa~w!!?yFR|cN&
zio%%Zn(Fj<HE-pG3nI31CHBpTHaEA{MPse)u&S(_-rmsG9Ib1pT)K3r_8huT)8P~#
zyJ;g+o=IIkQuCbF)Y8$=9z!xSn@htd<C!$vf)4JK#tKbjEltQ{hSMl)GM`0ZHZn<!
zc62l?X~}pJg-zy@D9lDCiR}#?O&`PbnBkEqY%-rjVKy>JjJCBkwA5!jiNYrHNfc%y
zl0-bti7aVvT^Xre9f`KoN5q92*Y4``Gdn<&aL;(klW2o~Pn@6dQDSPB`RR47%i5yt
zbkj5-@0s=*nB`16`sXy=DUA>30V&O})xeBq*l<J=>fN+uI-RCb#*=B<jZ7-_O-IHv
zY5S;TX7KS!5uU|RrV%`!*3jM(ZLZ8TWkS!451oY0{-Y>k^Xh;MXVz(8UNh_GpUpJS
zsnhiB*MMAR(q~{MGwC)Wd7RO<yrU6MYSvv{nb{ji(<tMaH0?$tmC*&9LPeLsd7CeS
z?sI&2BDy`=hF3cp+UMbPsN_~;=y|*$y))joL$!ckIa=OS-?YMse5Ag)dPSnAQxi{x
z^k_pqqZ+|Y|FYJWdGl+FDl5aGNF>%skH(rCT9(8bBMt5Ct?iZChBKcL@qvRYu}x7p
za_;<#X3v@*iCl<hgG=a1wWeq@KSxZ%C#C1-Dl6-nlZVZ8D+Ug@_ctRM?V-8>&+FG!
zTF>ia2TDeJD1}x8$x4#vUhDE$q;+wmJ=(IQA^G8$n)qO^HK%qGRg|L50c4ZRxhos=
z)$$Yx!gkivd_Pp-8Vo$YGh#Emn}lS0C*_m{GDtmTL2LpH-Xvd+tSHLNIYF`s&WXXU
z74rI@>?^8uD`<wEE~`dXG&QW8w{k%^Qdt>)zW`b^u$$h`*7%<QNw+A;k&`e#b!p8{
z23q5rA52AMd@ooVt&c?8+oP)^Ee(8U==HaGZy2N+-A+2u+Sc}%Q%E<V4K4VixvAyq
zhW682+hR?vEgfnoMPqmaQ0?+qLx;1H-Zs_P?iAuBgXL{%b6FeSRD~N=eAUg$x(?j9
zI(QEbtrDCWiDy~)Zlh(YI^XjqU1{LhPr9maM<jkLn0R+avW+#X1Zb*J5m}D4E^nqZ
zyK8q_Z#GjO&|dGb-orbvj^IWekIW-=jaNq&N1K|5*HOB9u#Q5d0QAONc7iuoBrn;<
znpFZc)vVak8fz##_rgn0cN31gvX+%g6J<N;2{FlQp80B$w&h;RxY@vzW!y60>6_ZU
zsd!@(o)odNns}y3>EZAIuYpO;wBv~6l%IH^S3NVEQOhag`Lz5-B%9*ph?dq!w7DtT
zp`Ki-yktRXB;zSg#y;bDPo@#?V`qf$Jj(mn8K(XF)EQ<YMx-<N?SC0R2TY@kC)l(b
znN-GKQ_k>=J-|q%GlQ>!giF<1D)G#G+v-Ri-qLKmik(^Bq0KWsoQ7_~hzv0?hs!q+
zWH$YYO*5YM#MUE{Zt==@W>ah$Wjw8>oqsCR{m`VeeQ^`smulb4X3%C}8Z&4%GD$2M
zksQWdGM~b@*9c{hE?||_E0<a)bh?K|iSQYLEDAUOJf`_UvAn&qGMQPYfw|1ApMN&f
zJz9#2>BNpKZfftKms#nJftenl2`mTZcLZ6Lxx9@{yLs46baQm%^6cw40%`X39iibo
zT?}VD-#b!6I<f5t<U6tX2qk@5d}xng&J((hK*|$(k4(n(E$s+Q)}~YDGi&;dOg7b>
z;0PqsFv@%`4Lko-rui0ThWF_;`lvZdvM(E_^oop++rXrb459Ls_YcYXCixZyA6Dv7
zeg!e}ZmDN>c!UEpoAjMolE(T0Q=L6pGwCxho0)VQ-npM-8siVl24phLqtkL4n9I!i
z`DZiT{WtJY(txy%kmbPqj*#&PCE9+tlKDLQI*ve^eSJqL%f1g%GN0<iwj+@5#O5QE
zbiaowna_Db*AYm0Lhq5uxcBfS<5@PHGM`z~Z)CE`4`4E$Ov5PixisvCnaY6gKlI+I
zJa5o9u&YlSHMB%)n;Rlci{~whMmySz@imKe(UwSU173`8S%L4sYN(HRU-B1!|NBC`
z1HN=cw0Sw+!`#tMucS70L^`6&8Y0VE>Q=NjES|SuRs`>U;;71|%97aXHu|QGOU}ok
zlyAiUkLF?+1M>f9MuvILB>9Mj-?Ka9Iio(*kn%Z0)!(;s=Kp9ehH=jPAI-=x&zXQT
ziJHqxM{F*ae#7YdVNxn*`7~g<A1d>lBzdW4`H8@h@Eb;c1D;zp<-q(V`&3V|9UK3K
zD%^?;9KIu9H!!;+VCp|PBx{^(ucj%v!>~&|xx+9WUUHKhx!#8xMq=C!G)q0P!{SSQ
zLP)Yd2a?L!Hq9r<K(o}-IxN1_)0%8=>Nk>)$Y8a-Qcvn|=u*#VvR!F&W^$z3Ua9AF
zICQD!H0hpHUurut<J9s>J*UH=OFgGa_oT&{(Q#^drJmE_(50T!BzrQ9*F+oI=_gS5
z(;4{T3VdVLvep&!v|2{rhB2gf>N!s*ed>LXWX}(ohYXJMA-z-YgLKlT-UmsJgi`k;
z$n=O8E~)1=HKNorm}EZ+whWF};gWg=QzHtHL3*PJeqIXiy;5I9I>UP=7{4r)?4&xB
zNC5t!q^QG&fmfCeJX>TKc(&9q@usH(&lVX5o-H*@ylLscvqgr1XG;weuQVNaw#YE>
zY^h=589!Q=>eOP33<J-WN)6BWVZP$<FuHJXrQo20>-p1W@VWKs^X=<N#?1!iEaR5`
zX-)H!XvX*S*jdfA*TAG^+Hpj3>OC<zaGa)@&vMFmJ}tiy$)@;j0pITg%J85~#y;bD
zPo@#?V`s#_59fX94AcI7>I}0HBhnf40Ed1OF!R%lVU+O%59Cso@|^<do=EjG^qEiP
z0Hchv4gQ@t89rl&HqZEQ8oCK1a<+;&oS${h{F$5BG~;PcY&|0Bj(>MfhDW$*l<~Bh
zcK)eM_d^r?ZgxA78MGOg#tfQ`OcK@G*fX8OxJ%|!829qeVB%}E_4D4|+w}0M@&(0_
zWS`Knf6LonM&%*7dk3Rkb(KP}F6DM5k_phR5_~K6;>t_TPyNSfs*}xWdaMSHy@X>S
zJ%#}XAeq*WTtbI$6)>U0Hw>82QY5rFJ+A!T+=L@0O<n;~nkL79IZb?KB>7TaWg5=<
zAXWh~nm#sVn$+~3_^b~?NxeAa7)_5=z=Zmre?i#-By^DTBB<+-8BLQ{fRv`mG2mIB
z+E@FBqp`|lFY&{22#~*F`S@oo=?4KxzFov8Z5gr{n70fW`6n*n#nkGgBu`tPyk*8=
zVA?X{<Da#pyD0UvWyoS+-ZEt5pSZ-GB!4C;=?TlKG!QP3pQ@hJ9fSBqoManoRteBl
zvtrP^ru3Cyc=5NRp`G6In$fqsN}B))v8JXZr*vsHyd)-hQrm_@-pN>8DcGc*#1zZ|
zCQ-lZj@~g6YmYX?I_MXJ8|E!tQHgIhSlLt`YmC3ICD~yYP%}V!0xAd0h1JtZj^JrH
zE1N#n5IjxkwNqJ4YMQi+lN@B};vA-30L~fF=H}MAD1KFA-pa}{y^%skC8-mjWmXR)
zIns*oGmRaM?fBWmi2k9Fmimzzc0+mxIEyn#pL!o8IV^|F1I;-Zx~2^2oq8XnlRou6
zNcKD^;m-r%`*|9C&VkfhkZc~(*aCXqVtMm0pWSXs@{TZFW&uW8x-0`;%;_n;k;-bC
zyaFUOO^yL`I?WxbBbC*(xdq5;+B^eh)_wAFq!ODhvjBNbmu0}T(rMB(LQ`v+yaFUO
zO^yL`I>>yU<kb@|bfw{X704_=R@2F+Y?FFWmUu=F1WKJb<n3pgyaFUOO^yMF>R_{Z
z`m>rgw*Yxfn`gkx4l<voKe6dD3y{}zSq4mN;u$^tSxu8yfTX6$F<?%M<jWDsUU%$D
z0VwUN0h=pcS4g(8W|aU<H7a(jY{OGavBgeDi~eJ=UazdfZ4~y$+G$l75Xi`fu0G@y
z%B~au%B~u)xgsaYHrA{Xps7Yhd=9@MTH6#^*07Ae*kpKl*42aM8I=Mw-pF(C<_h*?
z8*5ex&{U%$o<ogA>#mN}HC`QAvOL;e@3`Z;UXAa1hx=i9bA8i_Wv%tY>j+&vSVy2z
z06L>1f;U$rC)viDRRT2CtQhdjw4OFj@`{Mp``VhLb@W9+OY4$+mMkq!0n(BdzY)o%
z_leRB=hE=WcqR?Ek;$X}h+d}CC~PvHMPW8FNz@<C%XAWjP3Ds*%tj`O>gDUoOeay;
zWIl<)Y-EzCzCtPENfb7jPogjjnnde^IpKzDD(m#cSG7B-r^HgbEQX7`-)W3Q@$1jx
z`j1-xd}27GHvvhwXT0Z<XoG);ru$8Y-UqUL@}6n0fmzP9qkm2lzt_=x4`A@y*-Q^*
zap&w>4b12Wuw{I@@b3LGolesz<H<DbMr3SGi+@={M(5Z8J{cb*2|gU3QObm#86P?c
zo&85q#^%)lXJlrb2Ie)he*W1^^PDQae;}iy)$kdZ$xKsad<K{k|9-!D6)lzYRUjG7
zr>|ee^Xlt5BI9&M+wzV^y!X8B>dMR})-=j^MoqgBNo8~ar!eDZ1>a=QHyz+%*UI*2
z8@^Pyp?w}sk4kRE(9eCRbSFHdcgFj6$QIBmX3<)wuw(TycO9_%`O^*|{)*<JkoR`)
zd8;u8so&O1avn-rEkNFq)=Ve)(zKFGwRDk7&4A=ZrIE<uCOmC{_cceFmbEp<d))m^
z)5x4=y34Mc)x4y-wYjNoHLgVTB`oS+MQc^<%9WKAi9yp;kKZV5imk46e~uJ8OWLAM
z?ei9fA`7PD_err>SQJ@^pJyzNT(YnP|4Z?IS_FaN(Bjtim3VE;J)7wh6p>hTN#%lh
zkzlV({jY}^f!?97qKWrTUETkuduL=}g7%Ji9ZB-j1T=@?YZ>QN<BEl$KSTU3a7TMs
z{l0HqTN@q}+2_Q(`0tuluF${oyI@8H|B{@NttU9&*9Hfe`~EjIdw4@6$tT_Z_Y9Hu
zwZW+mk@vOP0f$Ii^SmUR>(1onoU<^3t1GUm^Z;?ev<QA#E9uD~1HJ(|ECcR=^B%v|
zNk<2`xp#XZ$=O)mYo)sZfqEjdc~DJB?gcpdz-dFYy{<9RvAh<KW|~@-#2e>(xuSu;
zFoGLS?_ZMHcR$=Xe6IkBPLpH6VLrI4@3_lQPLuXZTTYX944PAO680UKbZaL+4_;Y`
z=SkdOK1_Cirokl0xo6t>rp{!-{p&E90-FRG8N=g=eB{DppF>Wv`{$JE?hhcHWP&{D
z!0(kdlawq;cmxLW9M2^6PEUy^<L6AAjHaCoJzE(!Nj-hZjy~?G00TSOo+--QIg^5P
zvaQx<`qHJC?@J<1fV?D|a?4?4&wJ)_U4xF_WOJwomFJcEFizERcsB*f_N2`@0&_wd
za+)GtfHNW4Uel*BGX-!+mceou=DC)vYy9<Jde|Sv7l15pq2~>oqRsgBr}_we2bB9H
zxt?TFIvF$8nAFeKOf@OMz({uJ=}9=#lf2R&=CDhaNl!<@Gs6?Sc1nG~q)w(hlY3^u
zyirbikgD64VPrEkr_{5Vl3xbSEj{U~%mvU-w*7{F;ByP_J;1Y5k#>6JR6Ieo6f?E`
zs}q&;mzIQQl+2hmJv^fnkC^d%t^14>UZg9b*Xh)=0YQc$UTG!sw0RGGf~V6l$k0ru
zZ_v9r|1Pc@*u{7nWMsN{7~Uy%af*(^?&1`EgLW}~ikwd*oK5W=u}JIU)X(N=`c?N}
z?^wuG8-nJ7o_W`kN(ArtNLMP7do+_F^C06eLrn<S4PksOuGbA}NVc?&XkTQs1pzuF
zqwNUVD`C+q?#VIIosz)@1nH9uHX~q{(7QkBL>cBCSbWY-ZlX%JYk=fugjo3}_XsF0
zH)BB)o@Ub^`A)NS&;dU9jX}^mq<G$gq##pm2%3vQFV3l_BDr%uL*_yHAwx|F*bPZs
zk~7>F8Erv;4#{Xcg7(Ug7v)TMN(LJcq)#%~jDTH|;8LC8en`7(faIs$J7~szFV>k(
zc$!Uv<U7sQ{^=g%<EYc|t1V4+bPJBR=tWjEHLRTH`#gO7H*&qFI{CS%^s5g{VER4M
zktyHjsMD6IWYmY7sboC-GnM#FRmOL?tgKYO9*qwhExlwxIOz{KBq5^MlY7i#$klmm
zs!P31{vtuz6poxb|DxHm=0_qI;>CvP(GGl^B-XH`p*_;r(A<X4LN?Q@5GlQ0Rasrt
zj89TlSJySsD;4y1^66O6OBPF;@GkSD-?{jHHgVwCPCVw`_grSW<9#P(^KG0f(bcNs
zS5{ZA<c_}(Cmnq*p%_d0oKmT~uEgt^BQhE?+wM#ck<7L}=){UgkKQLd>(r+?<F9hi
zr#ZtB{W(rL=jm0+68cmLy8My==lpP8g7nF7z0#aP`dBn&5TCWoU<QYDNn-|w^1_p^
zRk#?m)<<K}!T_(%CwXF&w6wK$RHkC!dt+kGchpIq0p5U{@)R7N5o>I3T^U*2-nxwM
zgqvDc;Qd+kk!br8OqHo$h*P@KX0|~=hL>?&&1|!Rp36qlibDgtuyr}T;1+3*wk&BF
z`992Wi&E~y47V$2FXDs#_${`&#%Mcke`BrD_yuj1`>E=pQtvRnn{#<{jK92sPRZ%+
z4Rd?6Ia1f!f-mQ8iOs8>Ut5HEA=%R|WA;J%Cu5CBUuWQMk`n%Yb;dC5)6*HlY()Ax
z1K;41T4#jPa%K$EK0Tc=%toZIGw_uy?`LNW(>^_&G0a9Jar-I0FQ~0`CBCC(T1j%Z
zl>;gkhl5pwKz-8^{(WnFJx--FC01B8V+O6%vZ&16P|NUiccX|_^@VB~o~HJxm0E^N
z)jnF)7pjeLiQ1=DY8ft8`_xJ;!(p{gt!P<a7%o!#^vc}`htxi`n&A}AFT@kQg>HP&
zj53!1%lg8iGIxWPP@1mx(JEG`mf>k?AFX1AY9m~#_R%U<s5ZhS?naSXsb#oW#nCEO
zsFvZdic>4SEK>VuMNM+s5>orrs*DNL&Kc85P%Vqf+zqu1Pj@$pXoWs-m*Ht@pIWJ9
zxK!;^E42)lsC{asmf>QxPp#B499H|(ik8#|YM)-Y8{v@Jr&iOMz>P1OG0i2wl7QU}
zwG2;J`)GweaF^j}Y9Fo82WnrbyDCyETA~#tYM)xEWw_WqRHRmF84jyBwbIKXwNJ06
zadT-K${}@Bt-OP3=ZsPcp(Rd_GIynx;pu9hTG0|p)6_n-Qp<3ud#H$37*FmpT%zLC
zik7HbtoEsuT86`FpIXrpaYbsMUX^+*?(T3%9mPtY7H*|d?`K@}&*_wqRM8BqFx1?Q
zaGBait5~60hNr82YDLQ!7}Y*np}*9=Qg>CPR<uMrOVmEKQp<3$+NV~uL|j<yQ!BkJ
zat{^J3TZE47PUJZQb%bOEA$TH4?X2#HYmY<syd^XR%#h8b2p0Aik5JnuJ);wT85{o
zeQKqa;Zn6vt<*AHqV}nkT84|&KDAQIa9HhAE4?gI`}E4)2#3@@wJK(4?4+&=(@HJF
zW$s3iTG0~SGF|PX6;3U8BRoy*qZPVJ?JIRRiquLi!zF5;TG0}TDOUT`ik8$>YM)xs
z68nnWRS~U_?=ZJo?GA_3ZmjfhRF&M=8AY^G%W#>yQKVM1q`p!6)JiSG)6_m%)fcLb
zaH-m-R<uOj617jQ)G}PG_NkRxhQn%~TJcitE7B`&y4nth)NZ}<4$9G2REQYrw2(`P
zC0bPGu8L@d^UGa^r>lLmLZ`VK;c03gt<Y&|U#Z$hE6gG8GF;-WiquLi!^LW!TB&6?
ztoErDEveJgKD`Qg5b9`19aXE46QE@6aGV?wUybc&4$JcP@L%Ijavb`5j6PE0MW{bU
z>Fsk7cZfLl#O01N3ER&i;78exLvi%~m+e{)`>2p!A)DcEz1yir+*k_GJ9-{)90DXg
z*2=|pkJii9arMv|PxW-6SSo+L#`SHxPRF$&j_UJqUjG?!(%0GOIC+R8-ve|!)w6kD
z6udu%2kFuO$xoTQtKj=0_H&^aDtA9=`sQtn^Nz!DiX-16v>x+Tz{`*KFzCU`<E=&<
z)h8_~?0bmiTMl35JxIs-@$MG9FALsFE;4x+;g}ql*mTQpE;M<o;Y&W0XY!}^(e_-e
z$GmGH;K$nnJ;{3q;;24pQ6W7lOD*3;@MYdZah!ea{(VRAz5;EEqyHcNhsk>{j?Kq@
zE)+xM7k@W-8#l&%565weqxN2;^_X{00^W~8Px8L4c}a^3`+nH+T_t>v)N$l%^G;k8
zKYw=#-V5iNyzf}N*mTP;&oz11!k6cRV-Uf-6<UvZ=VDUw>))l&le`NNN9`spD$Kjs
z^6e75$Llyh-l>9jf{r82{9PvRmGCXVelE=W=&L607Wk46jpq}vCN0`NT<bCK4GDOw
zpeK3PYhKc#LV8qYTfST2%i|eSvgd2}Z-wCfB_K$T{{Qx4ChrFL&c%K%%)1D2a-Q4?
z-$@7}Udj(?5$`Knk9m6&@V>Iz<lV1%Ns9{UQF#e*(zh4B%zGM+v#-s2rQrRQ;Qhr`
zllN`-7P?Mq!Myc|lfHezm*Uy?Ct8nrr{I9!c>dedCT|FFlrQ!sJt}V@PWn3k6Xz|$
zarU)&V}h5@H;SG3JCnBzJ2}VX$Glyyo4$GQrS?(((lwiX$7wz0t-%35-VpTUcy2}<
z>GAyp=~0<#`A!nN({Y@AZQgZ)_cwr`IQrjzfyo=g&Jgx<Vcu1UlX)%>yk{bqegCZW
zn0F%%`0>6o-{jqbIN~KODx^oHA92z*BzQlB<LqnmZWO$~6}+##ZSrn~K$+{L7R-Aw
z;-qi6;4K%vKh=87+Xp>A-XHwU<b4Nm#7kOKh=a;^5hs1;3f?(5PH|Mv=G`WEPu6i1
zd+ubDchqRivDnXrd0)#neHRJdDg?9dhqNB^9s@l;-sRAf<GBEF)NazE!o1hyo4z&h
z<@su!j`QPvS@8Z&^zV&oTsdPjSO~s;<9U=duG-*BK6L)#kjHzi)??lp=#9s5F3j<n
z^G)7n#E~9pQQ^4j5hwe16?~Z&w{o7Z-M{+<@9zcgTs5vd-WYuS#`Ctnn!an{%e<Ee
z-?OzI^KOQoA8!ftWdCkO9O;o373K|DzU$%3yqD@Ys%P_#`f&Vuxm)mF@`yQ}yW#s)
zGSo$PyVLs(leY`LlMqAwi&T1fo~!kkw{eU=Z#(oPZwztNZqlN{ye*dRR>6CPj`QO^
zM)3YY@IFy#@~(mJCf89d*mox4<ha@i-vWdX?^VM0>spU_r{F=GU;pl`FnL3Wqjr-P
z753eMIO*F5U+&+ij`QO!0WZh>QSjz}+vF{S?{Ti9T5$g!uHwAMZ;N#M>UAu)Zvx_E
z`)IIGdnhjrSW}!|`zl0#ya7{+qyOtyneD5AFQ4N$?A;$6i#X|<3*SjNPQHy;v+t+1
z9{0y)==t@>H&&Ycu~qYu78TN?@^!>X-+cITp0CDn_O;KqD+Mn-rlL6dUvi7d+YR3n
zu%8P;-SWN9nZ6;B=N3e;@2Ogkd3Pt^y$X8reCyM^q(z1FsC>loEfc(Ws>1WNd1Hci
zui!m3X7cvKcZ=(!7R>uphsiq^zWE5D{)L3+o3HhlcM}GiU;kD?Px3y2IQ(<9u=03k
zTfU8g7hUi9+Pv!o@0)`68}m%wZ7>ayp)Sl@gg7~_R*C+_Lm1C@qt;{I{Rw!t&NX@a
z5r=;cX;I<+eFAaPw^Q(bT*py8n|C94Ct^SK$3DS(MxV(`;?;=b!n`NxIOeEEoL|4)
z|CY&dCE}<(om!AN?n9j9ST8uPLoCJlacmX+wqJ1Me#7Lbhj_R4q!n}A@v!OJ1z(<r
zZbTgWzKb}FKZkjz;E6Cl-YF{1n|DKqqjr-P73R&ie76eTwK~p^w@38bp9F97YLmAN
zzU)Q5%-e`KndhDGB_A3GHw)i?sd?Aqn5j7^h6-!{9dS~xN9cV{$N6#W7X9{T!ExCd
zlcNH@&90+bFvqLcn!dY4{?-fM`C5<rZ431L`t3^S$@yiQ<|QpE%)7|)-6MQ&*KvNl
z?+D(v1n-2~Ox_*vz07q~3+BE5R+G11_<lk7=4w6WJ?21v-V*3Z-U7r?yGe@*^M)+n
z+^@y2mv`$pKi-KSiJwP(g7?}DCT|G7bUon0ynnyT<edaxJ}>V@Ftv|-uhDwUyD<T8
z2lOQG7R^gqRG7Eb@(l^zFY7oz-l>B3FM{`BOu{s8@Z+tm@a@Dl7v?<^aq>JW7rtLX
zF!Mg3^_aH|gV}F9|4@y4@BFPm5Vf1Ms4(yM5GQ@Bg)eSZJzx9!Q6YH$DtLbuHF@X5
z_e|GOEtvPCh?BlG!grJK{l3;?-n9vM_tlvFdxz#FEh^0WMvdv)CVU^#ag-;U_e#P0
zH^G~IuE~2Ze9KXv3-hk8GJQLRFD_MHp8F9;<Ar%&OTc@Aiu3w+kLD#UD$IMF<-1<^
zKC0vVcw>S$qT@*Otk+E5KKP!E{al#$JHIk{yM*r(2qrD^Ez)|-8#>5;JTHJA^5XH%
zL>$#8Eh@}=k>$HZ_&%-U{CL+1-oK0fo!)8kR>1dEGSr26zxPR#w;R6XL)X=BV$Hm#
zcbfg%mVoyP=t<r+nwPYwFz@A-?@qz{oR0J3-6(kfA$V{5qse;%d>6WoYQesTBTk;b
zyWpFT5aR8|nt9i1J?`IK33$Ks2a|WV<|QpE?0XO5q;J3AeL=_h@op2m{}Q|#wwS#8
zEne>54<b(b=5C5#2fr(PZ_#?pTYj+rc>bn(Ud0>F^AShwCM_z=`xN4&?<C>-eI4h=
z`?BEux8OY)1Bm7qz8)=vZvh$V!n}_^WBL{d-xm?f{d<hoW8O6hcq^bM$MagvOIlQz
zx7_kA6TUyuaeln}1@C_Z?_uYgyzAi`avjxzdG9{Y<edv&@}cqkQ{j7{)??o81iX`>
zCwX7gyre~id5^Vxs|D{XI?j)G)D`jjA$kp!^yvT7e=&JqhOgiJ973ENS2conm+*a9
z>oM=d5BQJghx<(4e8f?^Ns9{eK8QH!+bDQ3b-QtXyvGRM{|erRpEr36;9KiDss;D&
znTV6Vs|4?Fgzp1dk9pT6;Qe8@$-6=Gk`@)_{a&}}+bMWo*KvNlC4%=|!Mg+(ye!n?
z^S2AWpT;&9=KaUxrtf;eyBopOKJxvj)??m+JpcZ^33~AL=BpCKQGL>)!n`+Hz8m0+
zQ1?7~L&s4)`~GUa;C)Z<zWoW4cP7OAuD{nKPWJC6_>vEuzi$fPH?<z~HYVUbT*Z03
zG0jU_RG4>y<-0}j{z=FA@z#Tv^FnW=B0c(lnz{~p{ksN1$6-Gg?%&DQ_3~cbzCInu
z?K{@GUUrMT;M8_K{n{53{gEZw_v=T^{@4iL72G(ixqZ!ull`$%_`WTCf2Q@gKaM%X
zfBe0-#T<VHh@*Cs78U0G58|Y64}8%?cO3jv$NBND6TI1i_n@UFZwS7HWT*@C-q&RM
z_QIDRul^gc)IRdf(R$2VlYqAfdh&d0*1V)eg?Uf6eES9Oe|4N6??y5HMhV{Q@t|JL
zFERKY?mDUk^R8BL-ubakx6iFC+P55WvOjVkjGvcTFyg$}^T89MKXOF-I+mF2y92(L
z`Lyp(i%s7=;X6wBHfcTXkNwcYLmIDep09?U?2mrUOIlPoZi(eP3BEl34iLUJ?~8(W
zwBWtA-sE*A_&=T=jX0U-0^vJO_+F#+n0F@h{CID#GkNDCj>ZvbQDNTCBTo933EzW+
zug$w#@Qx9@&)`7|S@89(8ov2ts0)w3O2kRuxxzP3_&%cbn71tf?<?C(-Zh$+w5Txe
zONf)ci-hl?!q?_~NAMmXcyGMM<h=pDHLjytFz>;LlfI3@_i*8Rt=41S-3fTV*k<zf
zX<pKz!n}7OPWrAAzDEjQn|I=s@%eA8;Qb69gp&pLZ$Etf=F>wECw<on-(!UD$F&~w
z798q7p1=H*$y<Ur8qcIfg?Yb-IO)4V_#Q8OZQiMZcbwpTXPwDA6TT-XOLxiryB=}U
zcN2W6eRThFg7E#T)??n91iS?*&YPc`H7{vVVcsd0?-s#(lJK>8E5JJuI@G=c1#i}~
zCT|SB>_xuJ`(He6l)T-7w?O!Q9&y<8I96#6ilM^VH(Po;h2E(`&*oSp`fa@6h;B1E
zI^lbavUHcs@q6$}jvn~(e1E#|y<F>YzugPH@j{O|npFNg-c6d9w5V`ggXP;Rd_%(5
z=4}(a2MOLURhzt9;2Tnw?vi;=L!9L8gD;QMV&Qv-)??n@1iafWGW&PG<|QpE%)1qF
z(zjpmP7}U1?^?lou;BeZZU)JM=b^XZJI!@e3+6o!and*U>v7&0!gssYW8SGaIsE$f
zC;u>c%MeHTBP}Y-`$NP@-#qx{;W(XdGlj3s+a-AO1n>3_o4n=lMW|QUw-RyEHy^$Q
z+V>pc`=r)m-g^`AE;4yHX<pKz!oEL5ob;V5cxMY=n|G_=ogjGYE;D(zz_-(NR15aK
z0B^FAzKh^nh7ihgrSSc*)??n#VgCJl)<TnaCgP}nNs9{mPDh;dT`zd&3SXPI2fRRW
z+jofIJ$Q=ATLIsrTt~Iw@jOb$F-J`Tjuj`G9L<{Je2b$Uagw7;a9l75$8N!qD>y#=
zDU%}x-*G-1*C9^&Zh<e)L)F5!ROxy1X{Y9(7%JQ!MV8)Hp?8VUv-_i8jK9MK$Nra1
zj<xWuQkL$L`{Uz?lN{Y5f0qj1-)TMWw;t&E%`X#FoX7i`<|QpE%zLoq+ar7z316Ex
z@1ybix+4VdSC*T+yWxADvUHcsdnDo{Z?EvZLildbddwR-+@JT3m^n^oB96uZX;ER`
z^@x+ceZu!D;cN322;Rd5?-?si-U|5o@qTrM>FeM{MxMu`!uKSt$Gqzk@J@yvs(Jl;
zFXD)ow5Txev6gS1@TJeVQ5@B?dCLXwB*B}r-Q?W}-($#77w+F%zh&~~3*RNe_g{#k
zCNpn0^!&#2i7L+HeNpq078T|_-tr9z-=)IW=3OLsj}*Kg!+A{>e1GsVeErVfEX2ui
zRW5v&317PJB0c6k<_LdYdL9aK9&Z8SsGmrS3iGZ-ob;_0zHP$S=4}(aM+x4WUNCt>
z@cn|abeG(}If#?KHNv+;_<mCBG4IX<yr25E$@{YAB`qq<`*Flc-!|d9LipOeYX$Go
zg7<{SP2ShwJ4IQ#OXhv_G1IqG_^uYdle8Z5(vyFF<GBKQsOI(Wc*Ifvk`@)_Ew_Bv
z3*R-u*XHdKyvGRMQzIttMEI7wj%vZYk6&f-b_w543g3LK$Gi&@@RmbQ^44fx(xSq=
zGcDgO!uLAiYx8auyvGXO@1AP%Ho}+gBe^hdHR9yB>V|I!L3ICjqww9P^_X|_k^cSr
zn^R2Qt%#%kB`qq<`%A=0-#)>+R`}YyJ%aZ*!TT&;w<Zgoue#xjOT1Uuw-|BK*V!EB
zy;=A^s`Z%n4%|%ojps+O6V<%&+=V#eB`qrK`w-%!ZwS789lS;O+Pr%N?_|OI%q)|4
z6MRdQrMu+*twfykEr&0)kNWpk;roczW8T*i@V-)R^6t^Rq(y~!Un)0!=L+6Cgs;s@
zA0WU`b=!A>;N6B7lgNVmw-3GxvCV~jXChAWE)u?X3E#)G9`jZl?ccxM`%T_z#8Li8
ziwgU0L!9(&6u$QeUz>N5;5|w3K6$3ey9mC1yt5D|eOJMk^LL-{eMsvu@8$%&FU>G{
zw`yL}lDt1cob+8Uc)NtJ%^MQDzt;Jq9KQZ@leZhb1+Jr7@OW-Vob>I2FOTO3gzu|b
zk9qeb;5|UadFSujnwPYwaR265zMBN^SB0<5J6G_2Q1tH)!zS-L@b&B83dBj?t)hP)
z6u!@EJ?5>(&FOfBU~oKNWcKfsh@<?G78T}w4sp`ANAPYIzBX@-;4Kim9hmIMg3sT2
z`1(EX{Vrb5m%hEi_YvXSr1hBhjs(1)gC44R{oAE^Ns9{e-emdq3E#(rug$wk@b1xi
zr1{-mlXnw*{l@bph?Bg|!}0O_r10IQ^_aIO0q^gAYx2IPc}a^3^Zo{L(l-~rd_CGK
zd~M$Kg7-Ahzmam2cQ<_fu1CK;$Ml^fc%K!%mufxcoph}Kc&>vUs(Jl81##|tVDUyQ
zU;6w3^L|VC+Ps?t?^MBi&VG}3DtyZ*!MgB#^~64tHzatU7rv!hk9q48@SYAm$=jxR
zNs9{i?<tmVnc&?ad~M!t!TVRON17A!P2N@TJskVFFz<uMo4j)c@Ari7xO}C@yz3M2
z&W4`ky;t*+78T|_+w!dzygv}WHt#OMdxq%W{b!rJ8{z9Wp07rnJdbJw?~jD<@3bEC
z?n=P>=MR~@yEQLqN!~XRCw&_QZ;$Y`dHV!!Nbo-Nrpdb>zPM%Z3it2vh?Bmn1n<v;
z@BLbjc?*v7KY#DqYx0&Lj?Q1wqQd=qJL05or{Mj$@U?k!Bk}v8BEegHfXO=(zMGV#
zyJX(y$C$qB;mh||zYxBsXg%iLoq%@%^ia*4ulh7EX;ER`i!9$wg7-DyYxC0MQf^;Z
z@P4Gi<n4zqE^%IA-`~wKdAGusu3PkY;kUxKTI(_IMx1}+J+(MT3-l!K7Q|8ik`@*A
zU26IE3f|udUz@iKygZK=OI{>_Eckw7D|~_M74F|^73cNGF5SLASnZpSI640M&_3dz
zy!>&H_RU56xIaon`__ca_VvQo@BVKr;-qgsd|7X=@NL(6+#e<R{{3;!8D@W!BaS#o
ziwgJ07Z4|X^S%+!^M2uL_eYK3Efu`qx!L5Mo9}-=v<Pw1Hy^&7=eLCKvs#aN+o0z+
z{@(hm$-4$|q(@p*n0FuIq;G-X{j2b`c~=SEX@d9gsV46Y`Hu4~*HJBa{C(v#)3*%1
z2zAHR--YjZt;f6-ll^(a&_gwEJXa%*cu9*2^A=jZiv({!VkwU5*}Uro?{vX?*i4gm
z5q$lwmmAJ9c^gIl{zv#8sP&k49rXPA_ju@`n#a2Vanx?oqQbmKTfS|A_g%y$;@t$^
ziO`|*yiD-k_J+yZ1>b7dQ7yQC*XlUt=tG<z$0!x&alC^#;>glM%;6wTj?+%Tk%QPo
z9NR>{%@7=WN1Gg@PH>zb_;4&oob+7}U!I3(j%DB9YCY!dfu0}lXcg!2zJ@sB<@uU<
zvn=0Df_JR&wa4kpqTkLGyo=Q1U(aVZeA$bzA?cQd*5lu;@TK<AI2bQ{|Dfhwk7Ez?
zD2`&Nu=eZLJl-wz4i<Vg#~#sdX9<qkIJq!vJ&r#3##~3W(Du#?#b&?l6!|+u_~L7D
zT|Mr%`V;;8Z7%fS>+!ZBj(ACn3iDQ2zPp6)MB!`mIyLceHB<2ZXuZk13cgpmj%vZa
zS0YZ1(>=oX2;uvJ)??n6q31VF-}=1C+lx5jB`qrKyAN^Fw_o@kC46n(Ni}ia4+-9X
ze!=A31K+Q@j%uOpoof&$eRCg)>m4h6|D^Spcm0$Eymy+s_acsXNsEfdi#X|<58pf-
zr}HCU_}aXont1!p7QA<tn!Fp~dmS0-qV1iN5hr~^!uLes`+2R$yagxu^FFP{y*Hjq
z5J$YEMTL1EN1XI67rrM8Uz>MsO`P`}!TU+<m*?+H_*RgiF3dZ&#`LWgzNZM^<%lCa
z=Iu<tdl%*tdH$}`yre~id2dIY<gF3DQ-!b1TT>I~Ef>5^>Um{vzPbax=edq*!My)0
zGkx2H?-{~3qV<@!Hv#WW(38CTH7{vVVcr`p-%jBh7QQy`s+u_O=`bQa`v1l+&HjBG
zz7^Qdg?X<*oXqoj;ae(vf35YHx9nv9@%-K|Ox_B_(Rd~;D$M&I#7W;S;aetrZQk`Y
zao*XYe@|3-_WE}|d<$JiwP4=Ir<=Z8;7jeJdE+eMd!*K5-Zcq$&xM}s-?f^Tw5Txe
z9LsmB;5}RT+Ps@;;=FSN?<2d-{#_5>g|4Goux~NqWS)1zHy<IyJ4^WfkJe+}-3fS~
z{k_TCr+G<>3j02dIO)4b@X~i4Qyk^p=IySD^HvDn)d)tOz5eZouiy1I7je?JU-+IY
zd|S01^Dg|L|9Jl50VZz^;@oyyymui^`sQwlUysfczBcbJ!CNVKyALsW8{u03elFVH
zxd3s}careEK=?kT^_X`(^!)BOeuIms9MAV^Uecn%{rgMAN#6qDOW#$UsDJxv;{97C
zc-P?hMA^R^;fqV2SD4qao_8#RFZBnF=LN#IUF$LLt^~Ym)#E(x`ny~6k`@)_y#aBO
zw_NaECVcJw&5g!+&lS8!?KOG#!}n}u=`NY~_C2O=wc!1*@XgbD%sUl>#jk(!peOsc
z3~{+|BrPh;J05Y8cah+|Qux}u`GS|e3!3!k{~Je`yyfs+OoqBJZwztLw^8s$gzvAl
z9`kO3o*(aM73cNu6Nt-&Cuvb(-Ym<vP4LzVUz@i~@XiywbI};&*_*Gn!FQeOs20ro
z>VYP2r{HZ6zGrJa=AC<rKkriL$^Ko4IN~KOD$Kjs@?9%<8-=gUTP=9c6TH3COx`Qu
z>v#QaMV##44TAS-;rnx~$Gqzj@MfzxuYWgaUec1h?^^fmU4pko_}aXU;LU>&%`fK*
z-nqXwdAs0yg0gg%+TJ-^#d+=9q1$(j)xI+kH<oJZ{aZv{+Od!Njr!4U-zw1`^F{l<
z1u={RZ~VOo-%nth3%BnA#7W<+!gsmweM0MTf6PDCfBf~Lk?{3+7a@+?O<GiV{Jn;q
z(zjdm$134#^R5@X7YN=THk!OO@bw#iS0GOM_P}=%+C}|)t?+$b>oM>81iWu8F?sLR
zyre~idG{es`tA|DpAfz_?<Vl(L5JFRk>Jg`+vME{U*h1R?VW#aFxyA(qeJSQPg(8z
z8{%a9`q4g$Bj4)=Y2Q}S9~X-Dz13j0ZwGv9xN%r>`<f6ZeVs?+zBdZrKWIJfk1415
zkH0tSP2LdVh=a7KaDV(Band&zzMN<JjS7mRdUk*G2;OSJ`@uSsw+y}&WT*@CK3Z$~
zP7=O13*Te49`mkAz<Un#vc&neR`Ze;73Mw5@+}a)w+LUGcaPw`Snw`5%;a4U-+b3m
zEwsJ!+leM`nee?;_|DUM%)2E4Z!7d9?>5a#T2z?#YRh-7@TK1tNz}je<t02HTq1a{
zImP7N0pF#{(p_qM=idb;?;_!Qm+)Pp^_Vv_)qgyH26~crCgNyZk`@)_z25R|6u$Qe
zU%P)N)y8@0H#ta;{!jjZ$y)(mzxni`gH7I5!uLMmdxX|w-dF<O8PJowotl@ls4#D-
z<-1n+b_rjbHzas36}+GOtjW6;zDTK8w7oMKadO_+0AK14nkOF+zSnC#=G~Hj_nDha
z-ffzfw5TxelZcbPU4r+k!q?`VTN{7<=rY0k#R(?w4*0Sc`D%OTF2qUSErRz!;d_eG
z^RD|lH3!8|VeOMFy{$s;A)#k;Tv;0*r<V(k{~T&^^uYHRW$7-pz4LLzNsexjzi$ZN
zzi2(~xBbu?FZ7rrN5y%({hF7wsBqkS7H^O6eN_0`ys_Fi?;^oFdXCBKobLZP`L@|6
zZ?DMn6T<gDh{O5jJ#SkAJwM(PRh-9LjyM|kq(y~!k4K!$^B%$bG-4@^>e;;OYU8{g
z7Q9p6GI{61*Y9!i!+$n?`vvbeh3^SkkNbCR0^Tt6<UDkT<|QpE%v)&rI*-NgBc2n!
zHt$BkdxhYQEHZiTg|FZ9Tz|OS<jsRG%~v!Jbqn81wI1{KC*W;`p5z@>sQQVts4(x<
zmT#HheL?uzyxRotM+NU03rybe@a=RR)q;JGyu{?43*Rz?5bt+|?@3yZdDlVDZ#*Ax
zvB|qZ^O6=7_RT?@9M7GC_xr-v=6xBwxCL?BN545mdi4L#Cz!ll@Xg15F52GNt>c)Z
zI|0XKD$YAEU(_5gY9Z#h1aXpMz2NvUVkyq=yxdb8=U5;)I!%t3;X95Yu-5j@n~0OX
zUGOCz>bIAK?|q1q<F8k9Pz)93xVzKT+a&aUCiLw7c&9ebQ6o4W{+Y?K2flvu%Y%rM
z99u;GelC2^R(f846r7=WDTWGjoN4KG3l9FhHoyMJtBcQ*QNeKw&THh)d%Pcl?|H7H
zT4;M`G~y)3PQmdj!EuAu<MFo!dVc2--Ji*RTdR3Viwg6uL7ep6C4Bk!p8R+V1aGb2
zJsLiecRjY}D@%9Dytko0rSBf$`?}ygMC&o{YuNVVJqUV|cMsyI-K0f@dB<A5{lb@j
zFUF6zT=3Qj-un(WdHdk&cb{__;v{eG<MHbe|4s<`-mdkScYMg7_c`^r%p1>>5J&Y%
ziwg5TgE;9+pU33K)BJl5e!PnWZ@u6>_6n0XAHEkVOLxirOW&g_eG7yye?LF@9;)@2
zw=Dth8PJpcyGHYp78T|_&GIc1zWjabe!Ojhw?Xi}aHPq51AM=vEZrsZeh6`rcdqdL
z8-l2P<ok@)W8Nu6{{8zb9_&h9{MfErpR}kj@6(8rzKet}e}Azb?^?mTSn%c?X!7ER
zh<!i*dmAn)(zj9g^7jan@4pa7^8xc-nSl2s73YoTM$JoFRG4?N<-1Dw^7p;^@pcK`
zC4%>7A2oT~;9I3E-6i+$m57tPYlZK7qJO`y^_X{S0^Ys2d6fOTL-Udr73Tc|;-v2e
z;mhC0=*PQN@HPtGn}2Nbz6jrS%F^&1i#X}K3BG(^H(KkF@29jL^DYYekLR0zWb)P{
zj_Q*Z73Td6;-qh{;LR1j_I*T8UHtmnq~l2Q&fl24&G4P=I;sWt@4LS?efxy(fx`D@
zt;f7u67XIPJ=wq8G%smUVcsQ{FMV-)9*)y}7=JGl<>}d@GzV2i*`f8+R{Xy1X~a?f
z%JqRf=(+Ww$KQKI+Y6Om+jTnbMXg6MRJeWBmfj?x$KNYNdee_H+xK#U_7x*ewl81k
zO%!?VIacS-ZH?o+ru8U>3b*e?#7VsZp~v4#LhXC&t7iLlL$8K}bYZ>Kh?9CD=<&Gc
z@BJXXKWIH3KlHvvzx$E{RGgRRYQ#}}(xSq?IhJoDe0dxkE%IWI`#p8>alcH*k>(ZM
znpZb)5q$mbOJ3iuc=>_BD&fnYqo?*>to3-@#}e>f4Lv#TJ2fw9QDNRCmhW2O%b#Z_
z-#5Qv_S;(M)sT=btQSL^?6(b~-%iwdA-!I$r_<u>Nx+e<;=F!)TXT>W7507ie$%%{
zaGWfB??fE(;*4=?JI*`M+o=Dh73&>m>GeXd8pmlqC=hx#Ydz-ZD)AqG4|VDOAQP0$
zh@(7^78UmWT9?TYdNMx#P7}WO{Ex};1oSq$N@~G+Cn8SvM>+JE<8-07Uh6SOO{qTz
z{q8gJ=k-T3;)sK^sIc#5#7W=vf+Hk+XDdCgKVs1H<M_b?rd}8Hn1eq@MeQildd!iJ
z*T4PdgUg^NIi@0x>XQ}~=D5W2?GqgQ`5CJB;HS<0D1jcD;uY2_L7dEs^HiLJKd(W0
zU)Fleu`2<`3pbh^yEO-CQDNWhh?Bn6@a1`p-+xcO|Ne~0u^)PV{c$7Wq+Sj5xIg%P
z;iT86^_XMBbpQUCsN%eFwGnYtpR}kjN1o-oMR4%@cd6b5H<=upq36f(>ROYdTX4*R
zH~Es@9IeM3i*PaW8&?g`ljEu$aa5nQs4z#=^38iX-XHwFKB{+4m&wr#y&CN2!g}BT
zvdNJTJ-%M@`^ZSIv`gtR$BPL#E{C4v*rhp0iwgTLuzVK@4t~E6`JQ>N$<dpDW5*Xw
zjz+<8zUYsT)?<$H8UFoo3G^h#e8f?ENQ(+{Txj`r2@ZbUp6dPK9+P7s^ftLlYQcIf
zh?D2X7U=Q$!LN&x-mkPCbG(y)<3D$s9JyyI4$`8+zW+p=^mVqz$JGLnzc;^Ra^ykJ
z@BHXMoYc#M9&_;PgT&FR^_XKD^!&~bdeAQWW2fdIEh^0M&V8nDjo{$dd&u`T#6i!y
ze)J^ZILgv%6C58Ad0DIVm}AXZ{v2Ob<IkI~)*_DDLt0dr<12`h`Rf)O{5(I^d;B_+
zV?FdXxk_rmdS@d}>h%bYh~Rio>oG^!On;6aeah^Q3dB)+NQ(;lejjntH~*RVxZ>v>
zsotm?Opf``^BY&6zuwdfL6653KhH&a|3)13FLU%K;5bgjdHpf!LyCj6s4&M-mT#xv
z;O8UA_i}Yz^~TkB==pKH4qlm;^@4*R|B~JXT8}xlLeKB~XjS?1ICf|b(xSo~S6jZl
zf}<I+6i2?Do6P=r5qk4UNEg<dgE-022fYHs(EV<U&|9JPm}An}{v6{}oX0T*ak<bV
zEh_9g2657N(l_Jd>KfsDc7e$;6?%RgS%{N*1<=DTm!m`Im1sTYSe1Zd=LcP1kK+c-
zL0VLpV+Z1-Z?)i9A$)H}1vy`>OTcj<;-p@U;8-Q}KBe`TV^;!>!&IEdv0HPHmgG3Z
z@?9%9t`)x9K5uf+_i>afDMRm*h?5)}1jomP-eX#iIi{ZDKd!1&oX1gyxLi1r78Nw#
zEwe4(Zo$zheD6Hj<S2(;xz?Z+>n%c@<meF`*9pCwwH|YHCg3<;#d#d-GzV!(-=i(x
ze!+30@ckeR<+!>7dKF5_(0da>k|X!o`1$b}p?9p-V~$-3I39%_{&^g`H3w-?;ru;p
z`G(+|hvPKAd{+3r@->rVKlJ?0^DiJya+C{>bwcllT8}x(%KgXH6)Mi-s6ZTzE7GFE
z9G6?Zje_Iz!uR$MnjG`X{W<7!HIieM;J8)j-K6!HV*~X3t{+FLIFDl^;)sK^s4&N2
zmT#BfxI_5%;%{`FcOBeZ?$2>Q;v~lw!SMy5_j9es9R1Mq<Dl0<<hU9&OL34E73QFO
z59zy0aNLb!6i57r==o&~RYn;Py>j<2wP3xU-eT(Q5gcC>dIwnZ)qLpraohzx$+1Xt
zkQNp8z1{N7+ZI1Rz9f9#Jjv{jngkpVAx`EcA9@Awqw}px=+Wmg(LV3~stbC49BnGj
z8&{h(2We4Zj%LeuuHbk;_|kX8k}vni6VR)0mDGauK7=62u}E<IkI-w^dfvE#o*zfH
zit{)|%~s=sw5YJ}yZBrBb_$M7!q@q_$uS;!2=xl<z3`x^w;n-r5k>v+b)okU#G#2^
zf9!-F&68YM@3Sh-<JhG+NQ(-`ecJNfB{&`yzULila`ZxPqLOl#+4}D)#Er$@<$8M$
z^yvH|jz@&vH;-}ky!O4V+ea}}xP4C{PU`guy+?)KUpAZVdk1=W=;IaEdjfG%uOE7x
z=f{QK8(NRKo|xmG=WA7*$FT!(#7kOK*mtGnTmD@9{C!IJHa=u>ya+u%j?)k)IjW(@
z99xCnRa%cZZm96*_^TSH9>*PsBM#D{!W@4_ob=rwIGz>0mp*86+zUOV+AFMgIO3$<
zCc*KX&^ur2F~_1xe~w>mGRIXT;)sK^sIc#=h?Bm3f}>mbmSFtR`Ns258}tfXCAHx8
zY&_c3qc02M`<HJEy;HRw*V_QS@j{Q=Hwk+1_4;F@<{&L995>PO%@e-g5x!M=JTu2;
z==qJS1FUhH552kYqx1KBLT{$lV~+YN|NeMUjX#eghB)dE(xSo~JFW5DC^&u~e4n%C
z(>2iZ<M@O%PFD$z7lq#AT8}wO&h_V*qvAY{3d9iyX;ER0b1dI(!SNH}Yrj6|)W=^R
z<oCmo=2%>i-0`OyI3K?AT}QQG-@CK2-0{p8h93ClBZT_xr^5F=#E~AqKDYsT<CT=V
zWWCc>ocBJDjhdIVsBqjVmT#ZneMR`%yp!tV=f|sHBR%@R>j{0nY2MB79Y=<`a6kQ6
z#d+=9s@u2AYTpkKN9Q@`#o4a<jq>t~LE2Y<_R;l?;x_6yYTqYzn(ga`?<&&Qh1(a?
zah&I}x&C?n+V}K%t}9j`E*Dy_SsV`_PIBaegXfpu48k!}aPa*QalAUk<e0C0ZH}KI
zPWny~`FmaXenIJZ{jpH%Q4AIGq;i|3moM~wFZAs3Qe7YKk6z@8^yvTc|Ck(C!dKo8
zaerKcILT2UeE%qXPgZ&!N3-Uj7%JpR<pfJFB=q(OJ)5H*9FtI=#?=RO9BKaarzS@X
zzMa_5g<_~&i8#qo2HyhgC%t{bcc<3l@%J|L{Lb??Uoyv^Gf#~_(xSq?e?*-0t${C(
zzds9Kn|DopocB<{Tk>y{Hy6GkW$7-t-(LKe>Dwmq{1@SSs@7xPGU)m7HbT$6uJZY&
zc}a^3^VVCws|4@c!q?`#L-6wZ8A$Vca5d&}`1;M`mm_K{HAJ^>EqwE_N&Wjz;rpD{
zW8Mu3c=x?$@@~|;q(y~!-$0!7-6VMbEqra>&EVy6Fh$3a=1wdm?`HV=&Ewxvao+j1
zRk!cIR{Oq*IN83fXkRXTC@=30(!Oo=@p<EGqJ6#JHQUz>U%z?$=Q@t_Ty~!SxEibC
zJdO&)QTwvcJ}P?Uj7FT~=oWd-K@i1JJv+}m^>L1T!SS^_O^*5SrRx?KK93$iob>Gx
zzGH;%rAp7^sL>o0Lq)Hgi!Hrg(I2@&&*s=&ALrormyqV`)_l+iU%z?$*NBrGdxY<S
z!uK|%=W(pk927%Eubf*fy*{CLkkGR^`s?HK8oxeBnx9bfsrNa8PWay7I;sW5P|3CC
z(|-6CU_XuLJp89P8V510$K!9*`TpbY3q9^Q@ObkONA*dIie5RlAx`EmzdL^Z9x8lo
z-n@o5?^R;_jZ^cf$2$qWA=gnYc>H~(-}DW^m)b|XhYMdv>oM=#1iWWMPtM~DH7{vV
z(JSXn%eSmM&U>Wr&HJxDkKEe0&O&d!{+m{;SND$MDA&j4cE{gGakS7IqxG17e*%tg
z^8JR^>(?BlMTLEz()SzX?q0{~?2dCBCwxyIqpveMjxI7>hjy{vt)ta-hL5f9j{lBM
zzR){S>oG?;^!%=?|H2Q6yZu2XDDx3V{YzR@*!S;<qw!ZxJ5jp3;~Xan-$te9J?>tZ
zfa6Cwrd|*9X#CN*I!WkVrS+KOjszUjpeH%HGzV!>(JQ<U%=C4hk8>0VU;8{N5a$s;
zuSc4P;k<;ecOGqm?^-g{g?&H!6Z1UEgKrsPi1#$%d!W|i^C)zIf4}8G&*jyLnTa^+
zH`1cQzVH3m^qnhs3x#j-d**pm0X@I-=$d!U^JtOa2noGYv>x}{%LzChSLd7e_`Fwh
zke1|l1aWfwtrr}{!q@J%a`YQN9=un~e}BBg?6*De9iuGWCAa%`h?Dbf7kqjCn<jjh
zDLro<@6#L<Lq)HgCQEOV&?^&qHpfE2L9fY>9{qp!c9Ww&0mr`)CpoqV-?N18jY`ks
zpbsArFU3&NE9X;|-d3UaA)#k;G>Y@+Cc*KMvF3etE`0Hnn^(9$UdmPHFW+Z(3*U0#
zTdno@JemT%@t#_oV?Ok<#P^7VG%smUVcxlx?@svU;W(YYbA+$W+bMXzA$VisP2Mv2
zp6NQO1@rDZ(B$1Ee5-`-Qmx0lu>`z}p(lAeH7{vV(JQCc^4%kR=Luh%cZ1;N*9}Os
z$Qq|>;alQ5ss;Q0>^5_p_QRLYxB0^NgIbSyw<X|R4L!-bQ}dD*74}_j`8wZ@_wPl*
z*XG?Kct0=t_u@A5yzGH*9vZ@hegE5P^5(&}8bLI!E|I=kk9m79@*mF+Lr?PVM;zsk
zw5YJ}gO+cN;JsA(o`ly}RaJMnQ}FWZ6{Ojye7)=7+wh$!>ap*UmT#NzT_k+3(t6Ar
zLQ?$B-ygS_yfYC;yre~ieSd&BIsbJE-z$W#-M_tp_c77GHz{9_w*tOlW$7-n_1|Y&
zzUzhWRl@g^T90{GCE$H)naO*D<|QpE%)1Y9lDA9vMuo4<+b?+e^)1r;y7KjS*TL7X
zf3L87x4?H2>eG0x7rtFuk9l_{;LTHU-u38Z%}ZKT^vW4;`R)|FON6h@o3}XLK7L)2
zG=JD^p1-fb*KfXBgE*PzUBY*%@O@tEF>l_*{^Pkw#d*BPAdbc}X;IND=XA?=kMLb4
zd~MzW!TY2b&-<@7d8feFuYd1DoaF5n{o5vdf2Z}Bw<ZDaB`VJ2ZPvV`C3!EjeDhw2
z&(9sg*XAu3y!<*bNgt%!Hzr&8#Ng}Kzu#JF^5zTQ6~Z^i;@y;hw*z`|ettspk`@)c
za#}6lknmkCd~M!Eg7<0Bzt4Wh?B8wh_3Pg{#L50GhcBPMYlQEkT95m;KLPItRGinp
zqb^b7nY1MDftK$g!TU+!YxA}V-p>l&U%qJaj)(7+%F<oxZg-AHoaAj3zSjxg9<9f`
zjnEq}^fZps_(QXQW15$=sBm08;-v2?;d`U-wRzVH-p>i%A01%cPp*OQsmjt_GH(Uq
zr0-hz^8M9X;roKtW8O^(c(<$P8NB{|Li3Uq73O^wang6a;JsP++PqzY_nU(Ejd3RL
zHu#pij%vZYS0PUNb_w5GgzvAl9`nAFfcF>bafQd5yFlfSw5TxeD~OZ6TZHee!q?{A
zDtP&Q8KgM@>~#Cc^Hm;vaY^zD`#u41>Dvuo?%z9vZ?4v3-WurnjpvU*PtI4(nwPYw
zu<vD-?@qycm+-ZDdj#)oXcOtt|E>5hd1LThg?(Juw;nqr?=JY}V;|jb+=KrVNBrNw
zf6`;#{Rwy{syMHI`!z3VQPC^+v7hwq7rgfgUz>N2;Qf~1eSU|@OJ8bV?mDUk`!*p?
z`sQMr=jSd2Q5^9;js23h9D08Jdzgyzc;_RI>XQ}~y>bpgob=7db{>vXo*%$}{B!Hs
zyv~w%`}qB*6#MiKOx}g?t-*dS6hq~m@0-4%9dX~UB8cLsy$@?W?%yX8@K!<(dGUC=
zH7{vV(JN<`<y*cZ?)xBuD2{w>-bvu4{gjvOqJLk~?+4-b?SwCBaN)mgy?mj^?{A{m
zHcRit1bV#_)jS#2Mm>nToK3N&F+%@qCzx>smzvMNkSG1O+gBjkw?*(49HjJ^w*q<v
zsLv%4Z%F7pBlMz{UNiJ|vKZFHK*erfnb6xN^xm?bFDbhWW8PIz3+h8E$Dai4`S0P;
zsMAT?yAUS}`yNhlI1thYDelW6kdD#+Wk>?op~EX>XXqH(e+Kl>+&21~3dPC$HP#rr
z!+XiujVlN5dIZw(A7M_WJkxpF5o^c4hUl`w)-&=^LbT9D{jHYMN=n?l;nMK*Y3^S&
z<33qAzbY$>9Z9>uU}&yztw)!*s{-fSINI}M_9Nq~-uvgf?>Uo4ozT5EcS`r(aff8j
zTV0V`lvUI79JOoKU0I*nvgM!~+-iEU1@$IY9pu)$=<Uvn-MW)ecOlo^BI+J!)a`pR
z=aCEgM?H5;)xlMxt4@8iwa+QPZg$!BysGTpkgGW5(fo?<>>XW!Z};sjne?5#*^8$}
zKiWU)*}muIP+K1A?38WMdY{`+br=*!DVlt0)sDTnSw&Sl_KtH-tr|0TPSvW4+)#c^
zz8jHW1;v~3zQpYlAf|Nl{B)lq&M`tY`-Ja8@w<C-C!Ye<6RMmONjFrZ+8!cZv{dT;
z|Lq;g{L+{nRdwK8)!SW-)sIeIn$<TpE9;ceFTK8W?4xVX&FZBQpI`Odo}P02wcXiH
zbDrNg?|ib=?fK{SbgD?i<=${tCyoE{7`>!(!qS4Jr`A5W^ns-h)#lgUUmIQ8xU{Ku
z@6z8beY3Wv_VwB=&#|_79%L_FaKP;CC-miJNB{Ohc6M#sxe!O$vSmwW*3$D1sMtQM
zFE=ZzwzE+kq5VC3N9UCv72l?@fBN3e4~(vwd(60=@l~(v9h0?o_5nSk+BP+1g*HWd
zADi6k<R9OA3NkQ0Yt$)|UV5cJx63Jbr9W@WD|^RACvCsJ>Y;t(#y+)g-Ul{pzv#_*
zW1Pa=?KpQX3sucPraG(2p1G*+z0h-eazD`b9MN`G{j73S&x4KSRp+_%4>rBBH+%dm
zdq<sk|Gu2DclPJ!ZQkdM`^rA&!0#V0rf094@9f^(N2zY^zA?_8XzsoPo!ounvi8=T
zvh+K9M>%sVX7y!deWyRSb5rz`+WX(Aa?kO;PB$5PL4De@H#>a$>_dCbKjwg*_5Jyw
ztTVrOz?hf6U2{m=fxQ<W_k4{r`GDSutA6;{y|c4k`gToLFWOy{Th;TNU%&S3&6#lP
z>@hE0*L3UbDcgy#?cD5W?kd>_D!0yo|82zancEsi_vPh|?#msUJvF;0YwD<;if0b%
zoAiMLURv0D(VM>*{p7w$$7j9doaFRoo%GCKoDXF8{J7C6tm@f{zq4K{eP&kgElp10
zr0rQJm(D(`=SNL1_2>0Er{`{8UNz;>?5U$)TGu%B=<&VylChJ=^=AEL{3z1M-JbQA
zNuzFQoYJ`Q=szB@anfb`a<Y$o`Ig3qj{fx#M<2a>Uv>^!R($xcijSn|Q9T`%1>3(=
z_59wPv&nUI&jn34M<2q>dTiAN(T!DyR=GJTb}&z8zmQe)+#csZdS7;>o9`_~zM1{3
zCOCu-1?P;O$eTH<vtD_zapU8!_K)w4y!k?7&dc8-pI1)ny}9Z9$G`QL_s%)_*FS7p
z*LZM~b6W29;;L8sbGwg5TOZ#yK4<y9gWc91@vBk$#%H_jedV#)1=|m&_MYsv_m%UT
zJ{!FU?LD;W{Ag`ehivbOgSVH?$I(@}jRiI1tG?e@-9LW(Db=I@lIzf@n|y2m&h#zr
z`K!i)c^<m+#k^5ft1BqFEJVwEj2pTS_ZvG|jTiTiKPH!=@vahez9yO{{9^suT5zo0
zQuZFKttBJc*0D=fUTc<asu}&4@hRkX=8)~pE#s`}c`!h(lc`JnHJnoBQ+elm@4ZL=
z<slk7^gmz!SNB}l5amVGq5oo+TSwND_mUh(TK!hN9oVM-97Ahv1MBgc>gVG>uajj;
zmSH$;_N(j1mTX&`SuOSLtxfg$1x2CK(r_qTHZ{LC+R;#--`bMjUQ#xFddc+qQ}XMY
zqb*DFS2VPDG+}?y^ukbKIKQAV7HjJ`^Ncg1N~3T|YwMEchK|<d?R5=>b*;<Jh_$vh
z*EL3)TFz*0Ua{=-w)WPg4Rx{n`WcJMW-KnLFPb)OT5)}8s3_b}S{Is8GNW{Hacyy^
zp{}90K3qI4e2O#cEc8RPAzItyWEJ7hIpM<43}?)^17_uBjm;jHGd}BJTs`u#4#}P{
zYGT%5&Jj72vX0C;D*J@2ljHaKs5hYG;8DrcljZIl=L6Wz_jch?izqqHXt70)X>y&v
z;;~J<<T|fldy2P%A9<-AImWwBss2IER-^twUQPM~t+BQzIA1j4Cpe$LcDWZtcj@tx
zW4sHK^p0?%M*Sn43ZwoJ@yhrs$2rp4KF0Z=QU4g{WaO*di#o>pi~h)Qj<dEWJ7bM}
zPj=|HG|RoH$=+Y|M~-u%wSBVl6T|;x=P{$cA&&ZV#~Lp=&S}n_M*Y*ARYv{O;=%YU
zhrXC!lpH)FzQU*<a?Zwf{5<1F%&Jn3@hU3ml{%A+`lUjhj?ZxN4TKriaXJ&?B?sSf
zonyqG9Y2V_a-3Pt9}T}**6|AG`^NDK>-f3OX5+ZN`PNZ6^hSMAa_~mK&l~ac#ZhX{
z1=e=8({999TgMkTmm0_M1g0oC^u(elIe0dx%!oIikjQZsiD+ui70%H{{1w*mk6PO`
z&QV6bYn=b0K0RltN)7+vu5+APYrDar&oakLL;O$tmE$xyFBr$0tmDg^uNudfS;wz&
zZZeKvV;%3XwpTdxS?G9K;ar66IM0gsA^eqNJZnwc*E(UN{<T*8C!NEL<DaySU++vb
z@_D^={4>r!jryOlj^AW$uXBEB#IJLn!*-l!ofUtJwSBA8Wz@gbI)0~fy>a|b>-gQy
zV&nMT*75tCdB*YktmF4PQ;p;IJM)iH&wtT1WkPn2bNHBe6?!hLSx=ee`1_FT|8ed*
zLB-R|Hz7OMc?(l=7XGGth6&jRIq!%|1l9l6vFbRT`4h4yIHPb0pm?=?gtHA(czpX9
z=ikQh$<7-`%i||I#~voPPjfy!N^O_9`XO9_;w3K|&+CmA+xYWyXcYNT+a_d}x@(T0
z_-)6l<Av_=8BR9*xlo-S>wFRBgzU4OLm?K|o8{oCb$6St%oDOJoPG=rI{vb|eXeup
zq4+}=@}py1NdG2W5^0~x=X{4oG;PBcdezQa)Tiw~y4wq!SrgUvJ?{49&T+V<pyR54
zu5dnW@oz@M=r~<TCuG++Pa=O@$p4vqwMBm)lKr6b)&VM>?pr5hH#qklthVX+gzP5g
zSiP-|FLRnS6P<PwvafN@vHV-Lp7LMeoRg106y^7@^BBe-wNL3?>)eN17TQ*RpLCAZ
z+v@oB4t?H~j!(t^3E4QGEuP3YbzJ$abBZP-5QXw{NcN-72gj=8H0&p2-|B4A+e-gV
z=P($@{qJ@r;g*TERs4O<-FjQa-|yU`^%3H>`6Y~3F2ryrRn~>JE3EBLS@H4?hvFw6
z&b5{PntZjbc)sRbHbrhf?qnOsA9DV5qCEbj^ACNT#@iv;k2uHa<7)e9XS<>IjPq%u
z{<F^Y1g;CU@6*=#Ut%4fZXN&Afm~bh^c`Yuf5|$2zjgdF>-dMQ<IkY~xlsGI(Lxvc
zbBtAgtX2P7YkvIc39A3q`Gxy)Ykr$%%wI=1eb)RoRnG?%@Sc!8**O{mlZJrWKH0g*
zn%_RF$1l%sH15XXvYd}~P74+&r$S&9t+BxA?H-?kwRarnpnDt#X*`X)1`Cu^G1lGv
z$N}Yobi=f6Q}@hXee|Ilhp~>+J#idF+&IipgX&?<a^sMzLG_R;Hx6^~pnAxm8;7}j
zP`!K|hcP^bI999Qt2^#v>K@zU#X(o^gK9l)m70%^TZ2j{r=s)SJbyxOpQ_`h>h06@
z`V74;!gs#m&vDnQ-&Y-X1KuM@+wiAyYO$_gs<)@<ZR&KCQ)lS)S$hA6^!C|$yIkFa
zP&<k1xX<e2v-I&f@WQTfxSetHxK73Ad``zz=(uwg*Ks%N{d3j+aoDEQ*yBG>$9-PM
z&By1P@F)4>^l*;5P4B-@>sD+3TP^=Pblk-{ZlTt_UGKkC`(xYizg)+CLC1YqUC+oL
zUE>^gx88q+*8QmV-(dNFQO8}S<D%;I!Q<#+igIeL_TlY%-5zWk?OCkreM#4A)b)6K
zsoKs)`>0;_wW=N2_p8ra(D!>!qWzyy9NBBt`JMfM>d)+riVL@2?sYEv)9SU;?60bE
zn|-7Dd`$M&)O|ztb=n90M*W?Qe#)oyEn06qHfVd3;=yI!9nZ9O+lT$`8hLl?BhUF1
zf2Xd07uCl0*LD4ebbYMddf4x-kter4@{mvQ_v-pz*6qGex4R1mQL;B{y@$2lH?$7c
zuFfMmUs${OLL5$gCmZX0U7yB3>A3z|biGIQ@yE3P<NEj$`uLOj_*44$)B5;Uef$}H
z{G0mtv%3A;bo-whzMm6`xKBYvmNhJ^Yg_F^K2qOYy@FOzcXi={Shy%Mf8Ojl)zy(%
zv*$%FoOMCvg6dgwDvL_-Tv}6IM7?BPyL|Dyx(gRXii+@@SbHSa9&L(s%&V)ctSnu=
zxVd#@<qD^;y`i~q)+HAdHmqu@UsV`uSQRUbd}I)Vu=j#E)MqSjsc&c>T<ZM9jWx8U
zwbivQZ;1`NO~q&+L<WUOGD|Z$8e3N`i?*z;OOs$p$Lbc+3Y_&&tC#kQFbfRbSp%x6
zo{mLplj!LIm4gnIP*ZA+wyOndv|Tx1qi3YjWV=#;2HRBwHn+$)g@OzXpNavR?c+Px
z2{%K{N=>bpeSGI5x8;K=6qR@q?z?eP)+tsxbUxutJ;Rlu(KZ~JBqySw)03po9B=Ya
zoh|14g)2glmZETEkhx#Z2u0Q`lxp<>?MTr-NVOmX-IsYlqm!W*GgB(b^Q%6f9fM`T
zPaug)h+QpE^6bjK)7!$vma;*HotPpA<Sls30Vx~0>jrDUkSC2_<pFI-+--i<hwL=F
zQh+YAst!6Oo0kyko5)9o=*wiMaV<7vc7y39PIEAwp@&RSa+eu}IY_gD$Ryt?Ix7dc
zY9-sMBxL+=bdzYQoOVOQyVQ8q1Dtk6gZU5AU%u4__$I?IW=;=4pZKX(AJC4$KnC#-
zT5W*u5R-(Mg9e}{J>h#b2f7bAs|?nFlqwHsL*f(;;vK9~08i^~-b>w(7aE_6X}bha
zD<C#xzLTB0m0sc;2GdERUCGVeLpCdjO!BQ7V(w11RY}OW&onsn?yO}EEitFCxvAyq
zhW682+hTZUSBK+1`4o-C+M8;Z#~M25^A^nwEly!eYpkL0+zT%~y(1Q_yBZ^*CAu{D
z^CreE%JhzghO1i_FRomL$Dn0+FdD&Q!3KA4eN%fS<kdNo+|wfgrG4*w2N{h6<=a|2
zD$($g#rR|1jAgY*OspXis~mpA2U8wayYX<d`us+`%bHXI&L&>nlsknLlD~<aQ>5BE
zXpJNvYEN6$v7{l^QdwQsl$IwWr*$;M@RV!%^j3AWEvNRKj|TeRrzJZ)-9)oWD&0(V
zhu6(RCD}Ng+-~OfrhJ`rsiVUf+*EgX)KD07s1Bs&_NGi-)`~afy3hEhMsCzknch$t
z))Y0Ptrpjp#nGnb%Hec}DKo4VVO*t_T2(RSoVwKm4JR}cmup-uv0lB*T@Q<V+T!+x
zhL1H=)($?ZlbnD{I#x#8Dlb`397)6U*4VV5Nb969!Rgw=>6&V#5vYH3o#9RH(;|_k
zmZlh8cT!D(Es=5_Y@uO|Hk!XvXA-qj#))eL>sHZf<t?7Z4|2_prre{{a$S2^^hzTb
zy=ZmH^gK6&Qah(*^_2Og2o2==Xe{cUs_m_K34Y;agY=|$nyFGvZdT=m!>K%|bNqRs
z6r6{uJcx7rd6B@rLscEb)qH}ZGA-Ao(xzp#%Nr^$IUf(^rZu<LMVlKmQp&@bPRFY1
z6-%*Pfk|4+rEsA#MN%Hx1KJbp3^!Zhb8gH@JiJ9`hw!3OB*~|B{0CKXKJ?;MB)Mn&
z1KY?aqAL|pQcnn_U?fgX!)Wm5cmf*@=pfBAl+Bb_Vet$H%dopFa+mI+q>OeKyUQ?^
z^@T<5(%n%qopuysiJI=R$X&XNl4)*DcNxYKHQlAVqomY5=q|(VvdCS!i;@!ept}rX
ziJI=;?w=*a?m>4Mc9%t1q7}5eB<vn^mtibXQ~m88EOO(pL~Gq;k-NwJvn1r!beCZ)
zQPcf9gtxgRUA}%4eU>I(%8tW#%$^+I&eDJW2=C3NzsKn9l6Z*w*C@SR1wA{C-gn1^
z<8ly(w-`I+`alidv`6pbdmjI(JrtLV|1-5-HvXov2><E*dt6v=$C0kD_x;!P2%!4R
z#&O+<lfG@jm)O|%))P#QW*jTPe=e*y8*x&vQ|OUD>wQM+F$cZ9)sN$!lTD5;#E}mD
zr^3E}L!9(oFMJQwaa3n7-UKQ8V-xnx#D6Z_o_i4|^}3)(^{GD&!hh!Yt=8juyK&5q
zV}XkE`lAnVq(@p*nByYLcaz|t@xZ=Yk2N{^ajb%bbYZ<V#7T~=(8E8M14G!;`-awI
zj+sc3AIDS`=W)zM9C45q74|K#e0v1PVLFcLy^A+P%l@dwh9AdP#7T}`!GX8NdmL|T
zJ?6M00mljz=W%pt4$`8+9PO4beMX7TOPq?H?^Bp3B*&%%94&~G9Jx6ExIfVKp5A7y
z#~k|;aGa{*JdS?NL0VLp<7CS>AHK|ij{<nUZzBPc!$AZ5`r{jjlN=$zF<I!nsr8tn
z0)P08t7aAFaa1FY#s_IpVU9-2cdp==qT{IE>qna$ixP0$jX24%NN~`!Prju0s@7wU
zdlPV6s^UD3O`3x*A<S{H<=ZAWP7%IG;AD~gu_Xb=OA}3wPQh`S&^t)$F~{2pI6e<O
z_<9_4;h;Q_78T~W+49{WI0|(f)$2qB$wA)}Sw=#-upWKKzwD1qf+K`jiX%PxUR%;*
zj&kVvjjMODUvkXX9Hd2sed#x?q%U0;`TQu>ape0M?35e}QIF!daC@%DPN~-;^hy!T
z92H8>%X7VMAH`7N_LW<Dz0jlfJdgj=bsTL!g_BvfuNivO4_vr?%Md5qw@2vBKrpv&
zv)1E!^jjBxc`i_K9>*rlL0VLpV~XY52Vcq`am>_l#Ie)5Z=&x2<ZBELd;R_`73cZx
z(7tC=5DNQ#6LFH4J|xQdJ4eUSHogwf$RGWlC$*0Y=K(+WVvH;LeMYK3O9!&=d)St~
zxx#lgj&YuM;BQEJ_mjJ|9(K8feZPq<#Cg2?bzFsxW8bH+Eq(KZZzYbg?_Y88k-qd>
zb}wr!TCp$Phe*9i(BtbCJ__aO?a_K%ZzqiW#!Ib=^Eh5c9OaL+s4&M>mTw5YJYMk8
zD$n<Nj3deM8U$!OapCr?)^WT&37_}#YhPH!dF`8mIBMT~Ey(RFM4Ze^xoF>oh^08H
zw;KOt`=&w<p<dzkw5mAIcdquW){*RcHMXU1HN?p0dHlym#5~{Y4mEwNq4!4|=fb|L
zbR2J&;pX2jFUP7luYDDWBi{vDklS}8;$-_4iM(8jSkB8?>N?|%`}xqjhZ~1Ax2H(Q
z@%Eks?R(W~-`l!<ms{=onbp2V(Y_Ch_D#b1Ap7kd=oR?1kAAaO@~#qkR|vg>wH|X!
zIlw>9_aFeiUY<jUqdb!q70&Y)EZ?=l_bMGn^}dRQ<S2t4-y=%B2E<8@4bbEByhiBV
ztM!;;VFHc<73Xo(Xb#e%!W>g9-z|cpPRAj{*^By;qtWu^_WS|+B}X^(sQ&Z#-yrn5
zl%ChV7`7>nVyJNY?zQyj`owxmbR2Epb+FmKHK^xz{kR=*vVA>*w@K(-ru4k_t<&wJ
z7%JSpODw%!(LS0hD3029gw?(~peN6B&flSy-X5X1Oz8a>4`AgurF@bP#Zck){Qz;2
zw@>KNoX72}Ljz?0Zi3#)u98}C`%b_gQm<d+?;4@^VXepYdMsXU-ydKqIbPEoq(z0}
zUPqAh&Bc8@Uyousj`*8UUvlimw%_?yfc;XBe&?Ofw-rJ!qV<@Ak}Ug;+lMc#G&sg1
zj@m<7R5<Pp#7W<f;Gk<2#ZkS@O3$00CtAMTo=uisIrOOh^Z0)){<B`4)xLZLQ5?lk
z;r2x=y}3f~<2sJ&-KEB#*FKtWe9t#){8dBm|B?4K@O2es-gECw+cf<kEd@#`<+c<|
zLur#VZBwY4h9pf(fk?}TSiMPeZ+io25|XsESS3KwibaDKEQk^mw0x+k;tC43YF(?M
zTa{gL#kH>Zwq5Yu@`_p)T;BhGW}b8BoSd8FrbT!4`DJp>%slgdo@c(#+;e86+-`F4
zt~7XFd#kYek%uJuT^_(|aP+&`@=?Fj0{T@V&@DH~zmo%aX$S9C2k(bSjC$qix5Da2
z9+K$yJ@C2Z+wS1qX8EY!ckOtD?AEjjfwS#BFQOmMz;N+4Ir;Z~@Jab{Z*taqN!J~)
zSM<Bg@OgG@w{{SVBzzYK<Zg51-fsD5$J-11?QI7F!`j;v@VR#E1fI0F?GD~$7EkQx
z%VNhb0p^y+Q`Qb*k;IOlgU^-Q=h*RK%SSt=8$7Q*??a%J4e>;uGXr>gfyeaUfV&e;
z%HtOZboF}%e)5rrB>Mdffv$f09lVcPKBoIrK)+`Zh^pq1==aHheg_=9yTC2_y~E&n
z_23}zD2F^G(eJ7N-g6G#$1ESyorFfs`X_mI7=dB^!59PrQdPo{4gyd5gL~i?{SKVu
z&%a|<Kk|@7zh}Vb;vIGL`?%$!eiIFzrymoEuEdl48y~<s=HPw8!TVugevl75${`O)
z^!r|5JZIw|AM4BgmXH3A2J|ZgURe2lIG|s?gZF@gx5D6g<vZ2tM;?;sR~Nu5bnrfH
z`KVuFx+!0D3z}vEuhQQ0B6#lrAELat$-rxe{~K@*Sw7;m#r=3mBq~C<kl<Yx_v38?
z9)dL9XK^JT@g9r&@wNlct$%{I3w*AAyBxfSfg^aoKg*AI9}<P>_cHigy!{T|qYhqK
zK)-!R6sF&tfPRM^yw5p!M*?`y0&g+mg~Z<9#Qpl^<M)9QFtI$o04Mg&M7c%am+~z{
zKOAOn9DJ_56~L>vc)K0EWi$PF6<P3Vz~|y^176(XeaXQ)c(xy}Aq(E~;B)bIIe1@o
z@FoQCwgE3J|HcLI_B;9a6$kH&0ekml(eLvCdyhH#J?Y?W4(Rt%7Q77s{U+o0hB$D(
z0rxcr?|J@i>YRHqX$&GAirD*~kPr8)BP8;%pAupmT@26hl7?|#%7XV2@M5M5Ae-iM
z^I0&yi026DgUNRkc<tx_8Q%hz2gml(xw*3|wLX#R=xFQU(HDcBdr?|ZUJ)k^e(pty
zQOrB{;sHqi?|*|(5ckyIdqhol_kG{<<&iksqM$ZXdlJqNP-&Hp_2j3&m5%J%x%Am1
zD)NgXk+Wm>jlSeP)#s<rPd`)@*;8Nn_R9Q=`u?l?Xmn5I=)Ar@y;FV#@Z)e{dyfC;
zh$_9NvaYgFr>Y$7%9p*@Kll5a*LT-WtveOxR#1zj$EJ?uF5w4`sh-GVBWg=(r`KYq
z{xu9M*}Y_H{+^=rsYPf0sBp!W>iDMklj`osW9F=jN^pJ~smOU1P)6f?kJ0JT>6@#f
zd&WVE*$JMpbk{;>uJ=;+u)X0U$Q9_jN6M9X$o<d1`1|fe-p})ZO_XkPS^&<$knv8=
zO~5|wwdTx`Xl)TRBX?14pWUb5zu!4=3s?%9_WbT0AKp7EdVs#}r$^#H)2X6A9LTfx
zFCS8S&V|nSiBa#xg(j(qa*tQ%Q*f>b?HloPN*w`-c_p!fypQ32-w{>c_cZG<$E>jO
z4%!jZcI1_~mi*qc<me&Vfh9UUS8(lc>j^PYkEV}Ff4q6;((b3huFs~(7S4Lbb62+Z
zji^1NZj!B4tlLlQj^pGMS`&Zr)MatI6aK#dyA^xt-`ZSKyK`y0wp4SNQ%;`!ts0}^
z52Rtadbr`+@bxytcIG?vDzDF+gQ81mPa3*i4mTAp><pJBX|?H_qw@DG$>057Hy`ca
z9;o;2eLpxda$;WXX?5#sPq*5S?kUn*#Xdjs;bOE1ZG%r!6aNdGi?Q!WG%^~c#WP?=
zJGw^p#A^#2ZLfrmGX~IA^6`JFK9i9@rpI9JoNC+SP;*GmO&Ps2(@O+%NbOmT{8<IZ
zxdihntW2dJyS*>3_Vl`OFX!cthhBHqvM(FmQ(60iBY6`~*CjUcb9oO}p)W9{H%niQ
zuTtNm<eJ&;!%HsHdl|jhUNBsS_Fez;bsAsGoC@aCBwLEP<y5c)GdacbyA+Q7OdKw(
zpGRrzL6jaN*{85{g6H5!IQiJmy5p*w-n~Ee<-9M9UxtyZ$&5m=J4d~oABo;su>8jA
zAE3`cOrx4XX|bIny&ffh&xiGhqV|+Qmh|%?muG5>-Si`j%#)5rM&#|ec<P$`)4fwa
z!u#ZPsn%3SbCcT8+S#6JYF^unQvqyPq6r^6u50Vq9M>}vJ3aAn+8IlL@q)NgSF~Q&
z+IB;$Ng6*VNge+;5XUaMzvVL%IPb)xov!oKab@3yskUNx9o#aw<<`$N-W%XHS^tf=
zz8h`}+<R=;O}KW$-3)gN9C5b6eE{xuxDUc@hZ~4^R>ObBT@K8w9g1N^<EwEez_-G|
zdH86x!xukV-2gxBF~ldQ48<^XyA;E0sV?q@U~$8t7*3X-5qARMUkWd6T>%$Wx2h3w
zlMnEMCa5>X&H07oiKsgm=uu4JA;Tf;{H=b;Lh<NS^-cJ7UDRQxs;jJrm;QKD)I+}X
zQ`C{TyIwg(?SY?ZO<4!^IZHi`_zd~LkiXM2QMij?r_&F`-JqE&4Zl2Fai_+()i)1p
z5!Ivij57R2|9joUz$;Q!NS~o1H5Gmff#4!_5B%rhjxhc0pRNAjQ+c-f8T_1U8JewH
z<7R(d*7yGDOZ493mKm24bwAP<c>x*A7!-E)!>{8WGj8Uq&%>WdHDB@fLz2mlj~b8t
z&$A)6#oeGqt_SiKt2Ms(#ew*@s>Qzew+7;?)TzGsDs>e0u^k(#QkTTdd?to~{`pgF
z`OGDTmh}^)&rn_F7I!gqv3_qT6L_(@2mI|`z{TDjZ^F)w_(j}hsaLz;&!n$+Baxmn
z>kP%z73!9F#*Yz6t%je!ry06JZuFIBOSlwM*Qf<?H{=>s2!AI1HEty2uMYSV>OXw>
zlTbf^Ka)NY;BO50ld8{`KB+$HOP>tzuMPN{)lcJYP_yfSzU$SeeDUi8@z<*@zWD0{
z@f+2ZzIcul8H%YJRY^SKSMa+O!_N8zzWAHmXy|vVdckM^t?E1QS9)Bxs@LGZ8vY4z
z{p;&C^@uP1HZLV_VtQoC1jYLG&-bb~jU=vFyW!ak+{>JP1Y_^;k?P&289!^{#OP>s
zQ>L@h>p7nshX_lBxE8_B^jJ0m|9JIpSQMb2W8=i=1l1l$|E_@lR3s$-RJa+@v((+T
zKY>@v+ZHwPfCb*EDr)iL+CN2Y3gCS!;J*mq#IMx+Gu7<@{Wk{uzqR~EUXg0VkjnIN
zoqo1jY4fW@`%Bb5Tr>FdRXaKw`k^-TU8H_)^=Dp9j4oD1Hs1K(sy>Sc8uD+`@m1<P
z*iS$6b4IjIeVvS!czejM<MBCY1~zqGz>e1v<KK^rWcn>|6QdWa?F6#K_;a25L;vPe
zP2?n8CPa6r#R$x#uUB80Z2VghKQVfRYMNsF-P(VRdJR(w@*96bec}|CKdJt&wU=t@
zvmFBZK4j}7b(t7lui9`G;#n3WEk28tXFu?LCdy;}&WLVQ&y6sC!p?}^sA_!vo7ATR
z^<l<nFj}I_M`<`{Cfo#UX5HxX->JGN%o6!4Y<?O3yH!sB|CeY#Bon_=-2uf!U)G1n
znZ_^W^PWI{|2~l4F9h<t`XrOS8!{$F6YAds`Tcb(4;P)^xaht7^%Z4Njhlj2Gly(I
zX0L#sS5h(Zj_Hc6P29_$?XsZ5jQItf=Gn3UZH6O70XqIoyaJE*6l^f{fOuQsk3rXM
zxO(_#OBx?GQ$)<>bul_S6tl)-5YG~z+!*qLR16!@?DSsnI)1YbR>h}Vyfdtxn8X*6
z56YC_8be(#x7P}LUCe77|3JkMqV<?*{nNAPK~PZfIX1rAypvdf?w?V_n{BVSsNz{x
zF9fok7C^6JUPUh`r}e^B>xHXNuk(q5G^O@B&tB&%6~}GCZAM<f`;@Ap|NW*s3$~f}
zSEM|c@7;)xU0}+?D~E+vzY7rwDu(blt_8PSTofMl;~xD;s)$=@uPwZyyxValUKg&h
z?WP`h_;0cJODry!m_IzD;J9#MY#wlmYtYt-2i!RpcLA@^m-$G2b-v&VRkgm<llrl~
z#!xR&6k6|Y8;%RklD7EE%sK?~qYUBHTjvAtE9nO=SoJj&ANfIiFF%%B+)FGjlsO@|
zms;Gn*?JG$a_R+rbv{5}$%i_tFUyVPH>CWy+~Qw>M4)MQdS85{2`_+uEW_{8(W>}r
z8@|E%ud&zF=IZgiE8uUi`Esw#XXsZ67Uo|yuCY|6zk*kvp)dv4X&<K#{<T)mv}w=L
zn~h%4on{V!VM4FDM_bH0EEr~V{}M%J#F0LFLm=HfHr;z{x|_13d#_FR5i4(pP4~$F
z-gP#-cMv@gpHF>6|BnqZ9r{ZW&q84Ph<*b9!guRfQPJ7j-qGCJwYI+LiqeJcjh&r|
zwlzH5GSS(5W2*F8Y~ysJNozm*9$E@}v_QDf>|a@z&JV1%1-9rMM#@}1eqRt=6&$+w
zu%!4p9j6qO&g;PW1I_DG=10%+8`6yfoJNrSSc9^8iG=&>skd}l-rBf671Z>2ar$T5
z0Ep#@gyfuFMjf_lLj%f1x6=7mqqf#$Gq(m@xIWd{*|^Tju$;h31T2{v94Gq$73Kb1
z%IvS-UzzM6Wo~82Kn!Jf2In{U%ogy0dYXyIb|y%f+43G+H8r=c3*Ye`8yGBVY~f}U
zU2Prugpk2ugPAkvw!!|4AbYOePS&PX%?&Fx+MwAw1dJR?w=8Q*$VH_gfaIW4X|QCx
z%*h4BUs@i-p!tg}Q`~CnCCo{7B9Uyv={LFq$Yf-Hi0pk`>9A`3{M7pPuFX{oH<m6e
z0kKliVAZ&$tpj_PX5GZp+oNR8io_+Uj&-Tz(w4S0jV=B6H=VPlvlH9<EWL7|Lw5R)
zt~I5A8cNcT@lB^)!L8c3yQ=BZI@FwX9c>%hanuk3TH9pbRSaF+Z#B`BzAnK{@etp%
zsWH*Mp(B;p*xb>zp^-rwWimp(kiA+582*P<EZ)9f7dKry@E$zFgKunaPqikw6=v2w
zX0z9{tQ|_(yku%^<A#<lGoeT{$<P+u-|s|Yn|9)EV|$_{gm1i-T}rS^8Z>KiY3f-E
zz#IAl`zdDEbI4FR>6f*8ABKWM#>z!Q9Q)#QxVdYUJ$)`!F+0lfR=3iU)b$&hH)5wP
z95ALg-a-i9Y($$(rqCQsFSl+(V@EOpVX4N>lrOBY3F$i+mgycfckWY|l0>2_-O+Y~
z?-`+{8GX-CCoqE{^e_1#PEN6HSF_2Tzzl*t;}Es;5C4N8_OBf$MAJcb8*`>7*a>(r
zi;pKaxi6So(T*b<L!pi*|H1%s%DCJChVvY<ATu`S+}4IS2fV1voBu7VZmr3w?hnVp
zP<c6(><N<^*v)s~>M%U1=zdquAI^@v!x3jIk5`_q@F6_NoJf&xc!3UNYhZWK0XDqM
zIsppb=WigStTPo0bvzwwmQMQwk5Rd9&+ZN^S%=a=o?qOD=j@}CF?8s~8k~RUT$=u2
zJ!=VOpIHYr@J-2VaR!$Ftr%&kCmg(gn>^tnyoCYY48F0iZyugCmxn${3XajkZ6N(|
z`sdwoXf^Oa6KE3sbqRkw7`i@LdJ{7h9@dINpyvLSRXLurdL!~Cr{aDi6v%bm+28x&
zp(a=d{~A^0#OiQ7b>xI<l2he4p^}fUR>&G<|K$ZL`4{X(-WWxOT|eFsb#x^O{1Ap_
z$-M6x^3Px;iPF-hbYn-NtD~{G3rADepk0>)e+aA5J2GRV>7?Fy8k;U>-+8(#v-5Ov
zPH^XGqzv168nAl1Y3w{bM=#RP@ozzmZKJ&{r~zTOpth``dr?CRyBD?PGCs2fwcdl8
zn^FU7o=7xNdIRdf?$p4tyHi^%?JL)tQqR->Guu>yR{(L-(Wa-Tc%&>vI5)mN?(M6$
zOvF1Sd||@U;xm+bB`!YmejR;1_Fc@8Hj3}oxWsoYNYlX(!PVu9>KOA+?oTs(-X0Hp
z_lxg)h%SP6GWhtKVkI1@`V_<0i+l3WG2NF6{BkQ1COY6&iQI<`pC`8taZE3~BKINi
zxpG%Ha`{@W$lZW<99?_s5l1H^c;mt6;;jPSWH9x@F<kJjvv{H}<N02Zkl;OvcP}B=
zv*R%^&<<jegzvN9bLF-`ZXx1(;fO18XW%_X*N(>#hpOR`=rh^yd2;uIgL21PPLVqa
ze6HLrPX6JQGf(bwP{Nga0CC$b7B7PLA@I3)TY*=H_+GdPmXCVay^g%{UJY>CDI|Dx
zMy_W^8hlJoERyh52jo8E<liLA$8@(KgIqh>v&elf_*^@lck%^A<>kv<gXihD#p*{M
zlIV9{0Ph6{kM)au)bF)1e*LxrFOF~_!8-;%SHG8lC-s!?nF-!!44$XogH}KCkOc2j
z0lYjIKz(}QrdmGwoAFQb9$qyY?N8)(Sw3PGqEbSX8VS2ekHJG6Asejj1{m#-iZB*(
zrQY+kZ?R*f#f#d6`+*l$U*f<+R6EO=^ejBoTV5d-d#48EPIctY0Kdq6Gt%SF>vx`q
zrxJc4!CQoIw>)M8uLMlJa5Lcq?-=gE>XpY-=t=#^LlV4KaPQ)+cFN;i%g1zw0ERzL
zznQ=b%a>mV^h-K;MGoFw2G7&4#Og;LlIVA50I$WtE4F;p?;U~qTmif|!i5CyszCkg
z0-n^X*<dCg@kR#fGxz>xIC)5d7Y*QTcl4WM`Izn!GtPMV*8n`0n~>lgLSeY&u>*K<
zF!jQbU-Y}k;sHie4{pNB<2HaH3%z{ip5xR<WQ*LJ19BgS+(Pj6!toVrk^6Pr1JASL
zLEu%wFC=(hMSyF^KHyPiFWh`M!MhRnu6{3A{m4TSyp6bb@wi7n?dXMD2q$>g+HWdk
z{C){|`145a8w{V9FGsCh`3g_ut_Ghg_ccfE1&-W*MtV12j=|6T6B4=KH+-JleBjfL
z#g<Xzeg}N6+&s(!#NIc9SL~e;u(uHYFu8UQT2F4=%6)4<?j(e}a>qJyD;>EHO!M2z
zZ+Es?EMCNp@!)guCIPP!@x5?WaAL>DEFR3(#J#%1>hn$J8xhZrr>q^sB8l90gU^+_
z3UZ}B*H}L0XK<XUM!OQe+bkb3&yo4ARd65VhRui0Fnr#)@SN4J4j3fS?=<jHKdGEa
zC!d#DKI(Tf1~a!_9R%JMrn4k?zr#G;wU=ihP-ZXO#c<>!-VGK{@_98P!t%Kpcy7B)
zgOBNnMH0EGfZWHOe7@B3G2H@Ws%u9(0K)9}6()nO9s3+R>K(k<7EkPWDT^IFz;o?5
zX6+yrN$l7jkUJKG0z~NiTWR@d$8LnXcBm2N`w>KG61)WXTsx-1Pno@NSHO{vc%QX+
zV#ikCg_Xwy!{^oe9`G?eu}C6!TtIFM{9?z|mXGP)iHVtO$4=mNBV0)E_TxJu*N!c~
zs{>On+%<4w$4ZMQc1%VG9A?Kt;JM{76MWQ%SR|1<FCcfHW5+u!AJhE-4;ro=vw_!*
za3R6F7ksWA&pLJ_z$|vWWbwof?p+&ZN0s68%Hs)Z2eC*Z_bmarQ(>2s#~RB=J3e-b
z-;TY&+e#oy9v=8yJ7xn<>QxfF<Rji47EkP`Mt>7##}PcVxaCm~KBgxYN#y<pe6HLr
zjvebPAJZL1|Kyg()xZ-B;)y;lfX~I-4m_ssg=>ZrJ03E4UOun3`jLku*bfBob~t#~
zSw7<5k9>9YO9GGOAtd^J9DJ^R_c`|B6B$px)dtVgPxk&M4@va9I)L|>qhFilqkepF
zcJ<@l-#VOeAkpu&!1MIu4&L?Pll*%ed~W$}wRq$qiGF<nyr&$zPRmC<g5%{XXT1EF
z<s;_5OFmnLx#zg(j%e@xImtg8$#o^l;e3xI`aNs&PZIKMGV=Ap-C+5`^h-iNR9(%t
z)AAAX$0KY$Te&+SS7aet#Hb&FkM%$To^j;fh+w9n+*=KvH}2nO?H~_Hux|?BJ?r3c
zJQTcOK5ugDxX1F5_pJdt9?W9Lg#o$GJ92Mw<h~40U0-azaPM^5M;?;c@mt)u`SOB;
zceCYVx+QSH^PU&_fVTpEA;IIE)@^Su0j~&Qy>Pd}k&k#V!&jeQv-**TBzTnR;!VQ%
z#Pq#zx4{WsFrT+0pD{FOzV}-`^8V^%e|^aV7^bWqN!?C@&&`*qj@)hF7P<C}2_@?c
zGl3V@Kfh?!BfNT50zUkCb8WHr5cpiVGa*;TnGZU0_s5MLWe6j2Z}MhytN%0K=ss!2
z1#kWJLGaCV_(bl#fpMW6ax1{s3-=*7vG)wCH@ay}`{5T12FU%YfL!v;G)eS-;j0hG
zZE@t@Y4MO$9klgB<i3<eF4q-kx620+9*NvE_?XX?Hs(RdmHM&+VdSIS^8$EG6lTYp
z0(eh3cHHgY{TTCLSHGEA@O}tBSHD*rJn8?a-;>A}7q1S97%n9Cei?i&-fYbGrC!|&
zX0i7n;yHV=)-#bqltp5{$omrQ!`uaY_uG437)SRdC?jbY{-0U!4ge2j)=nN0`4*d7
z{a-M)qJ2mkWyFJM=e=-@m-zwh!h6H1#w2%RH8kj+tP3kj$~EiYd$LxWj?deZ^`9V}
zd&x!8ktfa0q0|iJfIa07U~jiP>>5~tT`IXN+~g-!Jl=5N=~LrTyDOgB!@M{9ZjRfk
z6Ux7|n(ppBcYIial-U!nF;0!*|8cNAv;XFSBWhw~QOC<FvTF}hxO;YTZ`m`Jopy=r
zd<Whor_`-E<N6n|x6{8)S{|=eXA@DqI$}xm;P_>2M^)tyjzl8d$<^$X8Y#*9k>*I}
z6}@sG=Iqj#zh{rxA#Xuy-|OGK_rlkcKR8o;@7@d3$cs2!*uJFPH*XC0i@nk8uNpbf
zknVdr@8$dvX8%R*uWE9=s5aR^x&QZ2aTYA*?TBT0cK6WyC*!pTo|Y0~eZsUQw2Wj=
z#+z%qYu|os>}5YYme=rj)u;pUH03qu|M}&=KlI!YmHbTADF;e)NJ*L+N6viPVKsN<
zv?YhJly?5HA2Dp=lacfX(%Y8iEjV<jPS==9>;$OBJbn0RB@p+7?REG(_9V<RJI!Ku
z%1BSTR_&nlh_eG>9`*@+-tIv-6SlBV46Ab|5{r8!7F;~G<lWV0q|ZplK8m_9G4e1q
zi|rf{vNt02Li5(7+YWX_ytk@I*F)|({7twhc3WK1U}`1z?mdWdQ+JNDXpuXcb)Ko6
zc_sCS)mf3!%EN#xKK7%CPvUl+6YRTKwxo=_d@XNuI{M8jM~-QGlXZ*P`=9mrL3BxD
zyrJ?>cN9b#SXaXGQrc_&ZrV&o&hUI!tQUKXF0?D?kEHX{g}dumi+yb}Te$4=`abMm
zI;C!$-BWc$5BGr1pAwlKdGTPxw2eqD!lGz3vDVtcDc>wK`_M-3{bz6@$0Mb+(Vh7v
z(H_HXVn;YNE4pW-v;S-oCSWKG-BXo)<nEVMV%(3T>F#v*l#$DKzu0q9#h#n<dr-=4
zM;n&p*V_Jb&#~8E*HcxNi`asGG=6IBxY~V3VzCLk4=d)Vdhs74>cwwIv6nCG!CtEq
z&Cb2q_H^Z5yvx(*xytXW8hK#VvHW+gO;_Rnl?{J5w7emfjy7D}@WFId`l5#08@`{u
zC4Fl{UHW?s`3(j&+%8kjx_r~7th1N%l0Z4%lD@qvA0?W9!7UAcI)sb^vHVTH^4gfZ
z+G%y$LQ1dKmLAIPu93AUJ(brpZFir^lY{6oUwmIAcIQJcj>ZOl`PI)IQ-zV9^|jHx
zvudRzO&>X8=P0iwvLrLRtg1a7(1mlNus+9>W%p%nS=OU0m)NqbbjtEIr!4!>Uf+j3
zoF~<d^{i@0qpp=kdkV0tt}2P`Vov7mY-pI3E^26Ocp#llH#hV){3^XG{cyv<hK6*!
zVT99~^Psiavz)^+`;V}(B9}5E?>4lX@z}MO`~8mUsc4S&97E6gL|XM2{eE#|1omWB
zkx@=d$lH_Ocfj_s3!q1~K33}Uh0Q-b5^Xv2tS?rLIB@x~yi4*ftT~pq?2m`K4_6g_
z%htHCdYr8e<pt_c(Qet{*4_Em^mS%_bioDJwl%lL`SoflY3EEAT#!uRyVkUX>Tj?x
zmr8V+jb@t??Oh#le4vTfRW>wn`vKwnTi<&XODp<)2rMz{af5SCOw)B6!DFsI!;xVe
z$IgK}7w%1PMQ{wC3&%016s`<z9vs6jfV&Wm^IbkazXgurm2gYos^BhytA=Cva=44(
zSl=&!W7tZ#Rd8HKz7mdM*TQj5+yb{Aj$vG*YKP;x5!*Mzy5KgzZG__*%qBR7-w5|^
zIId^B2aaLvl)K?>hPwssRyc<9S^Rx)?}yt4$FSSsJ_xrR?hZIUM>4zzj?Z=<f%_;N
z!|sB+8}4J)e-EyFF8MgzeQ=+EBOjkJdf^^``xG3*9)x=c?lW+oh1&(k@JHYtg?kL{
zb8w%BV|X9jZn!VPeF^SyIEMcN+*jb9fO`^-VPAuL3J$}z`Z^rL_QHJw?wfG*?}Pg`
z+&{v72W}wZe!0_F2|SV~RTB`yE~&p}Me%5q+6(_o$A1z#77#BHwO`-MKkldNQVgfc
z@9^P`bEBcn1a-YHeu7%%lQ%&fhM%%dh3hZx<N)4jYM~F0EhIxRb%vVai$5b1iMtry
zy!i7RH|Q+agZP>1pf7%=nvDERdR&>DVo*%CLN5~jS?U))`Lonl;V<`CW~u*cO&W`^
zi2AM<!<(3Q>a_`up;dp#hc{PU2me$r)m(KC{KfFo_0K={1{sP$lS_Sg8O_KQQwuW8
z+JAv6_3>YzCc&SnV(eWq#QkVpim6KVM_+zcs(*z)lfKerhy1F5zeY{WFe9!;{nRJF
zCcwX3J?_(Yc_98$wapiQsY=10(fZN=|4LQo<6jwwze=6wi@z!m|Mq}?wHoi^Umb{l
zSHRz>UiRf*V<0}Ip7q720`b?XvA+DfHW1&Ye&o}qEfC+OKJSa~Qn$d*KHN~3+~{k}
zTah=x-0wBvOMj!Pf`7J`ilab=xc}=pK7Kt-_ZVV&WbnMGFSn_DAOCHcNZiHrsF4Zc
z{;n_j^6U0Yq~_;nlA#zzlOOu{doq!@i(zCL>C0b^G#QGid(`)R`rV^;!N1jG;YgIB
zm>!W_|NUx<Fa7=M?eJ&vk0VxwVi>I!`}iMJXThJTWe;YUaTn90S|%ulQ7!6A|41fM
z^FJ2w_o?6b@~2Pjhrin6>htb+6Vsz&CMd>H(U*T5B{LM$Bc|*Bn)<d+KaQXoiedEp
zlrMg7CK7isjHVlX@%sYt!SU|9>a8Q$ubR0T_xt6&P$6#Wqb9xx_Y<R|)FT+o$deB@
zBRWo9!iOA7<e!UpA^KY}M3dj7pP=eaF@A_e`qR|UoFR_<Jzyq3?<YpjP=^EYmFJoG
zi8}r)^<7jJ@^68g5uK^t9MI>?fIe>u_!kHK=LOQ2<{A77EpL`OEf7C`jESGA<<C{J
zCn>zzhNA)f??yQFrT#Ob`_#8a7=Js%qUGw{$ZsL$!B+$RKS(65jQ{0?jD9ns7pT=3
ze~C|hXGAMi;Yr3nUi+_Ai;#%%#^0u5=VbUNMr+iO>Bc`*^DkFNPB;E;?e9{*I@kEw
z1|~)?RU^(eerDs0=t}h&Oi75(o@Pe$9>sI#=#Rrqj9#VgLHP?6!nQx!{5@62ulBv~
z%J>n;Sf*!vnHX(Uf3*4<e@fLMA>&KnxW8{5rabhQYyVAZ3MwA`RoZ`>x@(m2Q{If|
z?dp5Z6pZ=F^Ik>XjA)O#;(X&b`E{2{p*%D4?pM=`jX$aJ9#p4b3dwkb|A=}vZu~2B
ze4ly|Q^*Yd*VOrE8b7Kr^!W!h6a5S0jl8|;+qQnu&-VFY>u=Zoa`jv5k8A%`>Ydgv
z`HAe;`{LrF_xXi+iu=;?cRTJoi|kb~W+tc@Z573#ijhaWPGh42alc=k?!AF@b~;=P
zAvztDM3Jd!c33M$-6M3t%|rnX>MC)j-KxE+7<o_m+>i7vykdB(<@J3^HSqd=yASC$
zGbT6SO5%RMS{~XW>nZnPJ(t%H+WlU)oAQq_66EazjJ($Qaff;Cr2S-xeMqS|uha1l
zRE*5g_%rN2zC9+s;7+?QD;~by1wQU?+Jft}9ZZFEXbU<W>L}Yo!CeUB6?U+GQh(M<
z&kiW9`Da=Fy9eP1nC3^FWce2C9E5+4>8GdJVVL^`v)?KBxal9L*J7(rrM=>!is#vM
z_t6Lc0^=|Er1hh7(RyHdtn>53roI;R+V~4?{F`lk_?QhxA?x~auk}}2Ilb18MvAJY
zris7Wmg}dDo&^t@=k$Vy?Ecc9G4+FXY(hHb>lS;(rT>1tpJgb*m)r6edoHp1US{L#
zt^aace|H7!TWRC3u=YG`(_Lw=SKE61h|Oonc^9Gz9yQNe1&=B9UizW;R$Qq!{xbFA
z8jJr<Yrp6XkeN*PIdcX8)33Ja8r<}aHht3S|M`IaDI34e*6T0W_6NLbi&N*~r7iz;
z2m}?Q(&zEoYVGgS!K%2;Uaz-uF?}14Ag??-;YnPxvTIRSs$+d~D~?*)2!FDrei&Oc
zmWHmaE#pU!^D|L;nXRU#6ki86c5y=_F2<!cHFwpBO!?|R>j!=K&QB7$t9Us{8t`M&
zh0v|Dv#lx7xnT|Wed<bahpP3B*QKyWRAX|pY&mH@jciVC(t8DBbHD5#AuceMmX+YM
z!{iN(*i;W|j!hdnI#R7o9^Rmq4+$lAt;)G>Dn<=e2`^C&ABbB0CFwvJR$AfhnwQwv
z*wNg$rX^Kc(%RP5ymoT}JC;J-fs)T(zX66U*wBitO|KKva?hCsX7yMAhMG4{vfOjW
zNu2Bc28+Cg!5v*&68sQz$hwziOPzxWSut|8B-mr*vVCrN+FYy%N66KNOn#al7ZT0u
z+jFrad-_~#$&QkvJ+|@YU_rkWM(-hYn5Ec7sI$GLxht_|!`ii}4)*Tl?TyVH%j!9z
zg!B$Ij4<uKrl#g{&6P-`o0G{@D|-yP$MMPq2}I{$#a~2|TuSsWl{3dvTDp+>kD~(=
zOWE-j%W;W3p8P*9!8ta<ep4xIelXMxu(PDi#q?mun30}CWyx*+mJu=N=sO(X9IPJ(
z{6JHbe#KEe=tk<HefeOiq!%8Hub)2Hg)H~SfH%0eoZo~!T01iP`VG16zp<TW7PWF{
z6#epTn7v9CO$Kc{Z?OCva$><o9BzWc2yz_o2OjVFyqQd49@e%wVep$;a<4^yJ=KPh
zf7vQf){N34@QKZ+H&BOR<j4uFQPr8<Vx^lLw2{3b^(UZ+$rpDI_^b;le+hMRoZpB_
z!>c%ftf1^6m&pl{IE>6cA#!Qupl4O^6p6u)sW9h7*h3;(8(Z5tTT-daaS`oy$&O1#
zzFpDvp%J<6q*jJ4&0Ct+G_|+OiXL$@9dmul5I3$IDo_r+Mj6)p{JNRNpy6mYBq%Iy
zrRFTX^osNKR`XciYQ13?r&34@I-#9iDVAJ2QsxwtWF`ZwdeX+SZ=(8FP^y1P53b(u
z+Tw}IoD(cvTB@nF3Y)27MRl!`;OkPG6HQpo?(!dafIc&aLlCe~o@!jvoM=flZ(QG&
z9B@gNO%$C+_yGu*nPJFMb2>M#*VkbV8z;2V^Lej*LuWd%h6m$xwm|dt#;)`-y@Isy
zvQ>67bE*A**<p4F$_-;M`fKE0|AsnfP7bf7WXm#aOwXzBFiP|d)MFTh_XcW{V{>Fq
zZ)m-tqp>~F*qTfvn>*2Pn$q6Dp?|7FchI&m)zQ+{nACoxS&x83OIusJ4p^ADs0F{n
zH8(A3Sy$iI(u^O<xKU?<kE)sz=h|&-Zfvok3p!GO>r5q@@nfbw&aOUNj?~nwtV-Z-
zMRSQsY*v<6l_XZNCakPZtSU{ctU&|Mp&0&ljLxyN`z;;h*ozFZRF4I~Yp-3oXsEsI
zUrd`Es>WYTryNVJoXyDJDsyW^^U+$^Y7#3KCNL}xak75m#pX~JCti4tnf`{%g%^1f
z6|XpJE*pA@{1tREMK+}00!6!Q-8sjEim;#h^omwk*61OBh_&?%m7YT`^jn`Vo1b|d
zqTkCjI#2q)LgD^MIz;>5Ai23%9`?J(U&{J7PIfLi5d7h-48N^rUPuZp{g7W@hh5^w
zAuSgxL-YDLWDoji=De?xc}L@T@-_!+rC-T$wv@HA)9*Eu;dhSC8!+!~+t8J0YVK&-
z(1LyL%_|h<$M@h5VHhMXUs-{1Jg3R-|2*Y~ISLPNOc_Qtmm!<Wbv9GeL2IUD@Lxec
zQ-^c<1>vutWsc=tTH2Lv?zF4Si}adyVr^T8ITUn36V|0#+bWV9@ZgAVz?W@8E1R$H
zm#x@TS_8*Zp*7)wk!@v2h4@AY&7p@W!>Hk3!S?LV%o6pnC2v#)yrCN8P*2}bJ#wvy
z!5%or0br2F<x-57`j>8OXTW&@&bQ7Kc0GD~4j>DgTf0*0I`E1pril2tp|xw-niXrf
z7-DL64wbCmvu(D%AiLh?hv$LyE*ng5oNH394``XE|Ci~5TLwL{rE5-wKB7b)&@xZ|
zFT;Q5$QHorV_N3v|K5=;IM+l6l;b28_oNn_g`z|BzjA#5%RKzYVK4f>9MFQ~^Yw`=
z<>m+$eb3WbkY4|Hk7xlePG5l{fiqg5r4HA@^UYZ+`hSiGw9MBBv>g92E$X(({N^!3
z@u^Ck%@1uXMeKFo$(e7i7{qUIT;jJ3q(vk9^YQxyA%43;nh!pF=A|m>0rlXUuzXy9
z2uFR0NB^HkXgqIURDN5*aM4-h{t0|8-cAP(Q6AoMC_tMaUegNvFS7T%2;La*xp=+6
zLsn`1Mp-`UQEBmT(bR?iW9>aJf_DHy@#opmjX0(!7D@P?0h25D3CJx(JoAO$36YQK
zPQ}Mj_!P{eNr*&{=EJ9Hnvc8>B2e3F72Jj}rWX>ud%;J!`r{&8_B;7E4t|mQHiPHw
zBiVyE;*p0Wc3cv`JK*4*Wcipbje^wrF)?T-T#>#r{{-(%;B)ikIj20B52D|@ES}i4
z7ja?b@gHDt%i|gFQ6I@uk^6tZ=gQ@`s8Sv<(UTi2k0Pf$_?;5*=&JDDom(EyB24Nc
zZYBHGTfpa*2P+@-V?BThp4{IC%Hw&&k&iqiv4i_FyLkBy9zIX?@NS24Zh5?bINB>D
z`T9OEx%pD);GF?x%B3C`7(B1uzhcA5LlXTK1n?$1c=+TngLj@^zt<4Q@9~60zXjlP
z^@}@r_`KD_`&zNT9uz_k>P;S!==T-yxp+km-gL{ybisPC81(?Gy4-HHe8l|LY=1qN
z47pnnE+ldng3m3t5`dL}iS=M69Qi2sNsAY?8L$I*V-YSScwaF2=e6HnYcH`#!uP1n
zKdF!nkSq26O_q;x&qD%0cy)LeJQeT@3Er;*?YA9xaWK)2S#abd-gJv6<#-TyVRqba
z+PPP+UIHJ}6N@BrKOT_V<Jf^L^W+B0jr&o9RqOXb%cpf5<1e>YAa^F>g+#8L^CkJ$
z>)1ON%o+>V|Arhuc>DKGhT&oM)*3#q+<0yd?IjjT<W_;ttuK2Wd&?{z(>-m*Rj=G;
z1FxMxmL&f>1LNue;1z*~<yH<Sc6`a=Njjbn6K2QxhR-XvUErfW#3G3uvjTFDId&|x
zd`uTCw-%?|K5F@h`7?Cv%x5{@sSk21;1?3PwcvB}FCU#_989zqpXz${{*%R%_I5an
zy<b72fn2ZLUa|HPizITt1U^@85#&mH!zaL=+@QT%9ea0JK4M-e^EJpLy_Ut^e?{l%
z%B^thtwcIvF`rjhJh8VN?JBH%*8tD8w-S6zUkOJNd*2n1d$nWlMV620{yfu`8xw=-
zfEQM7e*z!vs3a38?buNRzu0ku!Sm{0x7Ck4B=V6u19;njM}1fimcj{MusrTVc}%i=
zJ1rl1e?8q_|F%IcrrI9aVp6{ZpIaV1j@;$o7P&PB&#PAtT06)?A|Gi<0B@&*w*v8k
z_w#f8`TQ90sx^Z7CwM;vpPSFUPCj4i;3W*6m(NG7e&itu-a7(#dma7iEg$nen9qGq
zK7ZWu5%cvK{(L?LxhxMM$>&$W=jQW%NA5~66N_?hFnC@*k3|H-$wLx5Is<qI96WsD
z?%@?c?+E-OnHV$)0C9b1{)vA3pq!h}&pCKkfmQV5Ljmz5T{$Ac+T|?(1D{tOmEfZt
z#3B)o^xlBngODrz5I(8*<l6oHJv-_E!2J}2M4v|y?%HwG!CMVx%B3EMaO2w10DqVr
z&4$mjqXmAZCl(1_O)1>Ca=AI8*paY&O!xZP{_^NTIw>0hi5;(k&&4YQ9@DcwXoRC&
z`rl*lJpHyHg5l&Lk&m=FfH&E}YeKx>y?l;ezpaP})9<(7bM=cmcqs>Ov%&N9+ivwE
z4@vaf5Wp*P@YY#A+7)b<`<!-pm*pd70Ur8TzB2yqK;U@zg(ROxf{%7c#+Nv9uSGDi
zC^v<~!1LPWgNR@_c}V0VHG<E@t8nmI5HEN^JDzjwxZCoPcOEK{YsX^<46|b{_*}V_
zj@&j!?n5SDJUgBO9_=6xi84tK1oEZM!Mh&u<O?g0mtY5`PP(4nWBJJYYqUexj(rI1
zMz|1pNQ=Se+EEX=9DjcZ*9AvD%Ke$ellejQi17A%50r7stsZ<#Pb`wiy$gJ<+-;C6
z?e_-D7iMoB=I1j0e%kU8vkIM)Ywy*NTY_*Qk^2_#xpH?p`Ftao#okYw=XkH&wplyK
zLlV6E1JCij4j!NP1TR?sCc_RXw+AgBd8_bX>e|8cyUGzRB<<*tX?{C)IdX3Tv&gNm
zcv5crfEU*9o(ep-+zwcKiA5qFX<|TbALL58-GX?L8??8?DYu6#A9*Jg`R#oUa;p$7
zB=#0qKCxpeI>|6QF2TdAYey0ISdVVAfMUlo@VWJ1uVcsi!JEyFYNy;jWBJJY;Zc4&
zN+36EynGemuG|BT+}j<ww^=-~w+`vT?7a@*uDz?^r@h1?iM{Irat}Ik@34GK7c95c
zPPy%}e8k)bW!!qo^R4jbk(AqB@VWLLg<Q&E|Iz~|`Fys)^V(a|+Cd(Y*l|_>@0f%4
z5z7~5M?370dit>CBj#o2`|W6f+_3(>#_)OiZL#`s3?zwuOTg#ai|uGVdu5yn)34j9
zSNB;wV)i1vo6lPzcRK}I61n5S=gQ58U;1$w7by2`izoG}5cLdM>XG1eBVXNmH5GhJ
zPb`w~Z2_Mvw-Wf0&tgZIy*r(H^@znIX5uuzy)z-VgaR#z+;@P_m0J(Fl*4*;KOFh!
z|EU=lymDJ*?H~_H@O}~)7p`{j9<Y32c0A^k+oP6`m}eCG?N|-DNrVfD-0Nrg?P!49
zIGAY1gK*@d+zA#>%55+3!piOYMgDSo#@b6PlF0oI_}u*KcFOIumM_fSeU814Sw3Q(
z1TeRrJ`1^F{oh9b>dNhL<VroD+z}Q}?0qSVy{CiOt*6JVy~HAky{81^vRz3%{hZ~a
z++hFrykoEM5%Y&}zr8G^6$lp+xtGNK_VzjD+XrUyQSLtQG5^Hg6$lI~-veem_v-W2
z;A47Xkwoq@;B)i&fMf5MEFaSa?R^FI%KYjJmXDZk!Xmv}z70q`8{tCI-=Asu#E$LY
z3$vqWs=wTJf{*(Ag9Q{jW`fVP<Dg^56X2En3)+znp<>79EgyM*GtO^EFNC5?^+@da
z75H4aM<JK`v0Z)*PUODB;Cbb-%i2L6lGt%o0PmQC_q63Be$bAoutVyp)E8n-o8z~m
z4~fSkTuAJgWcWP&_FDb+T1L^Y5PYt^T)d(_KZN@RoY))GZ?==qAF_Pp?SXUa3(sf6
zlAuST-*$w!a`Pcq?A?brk&9qoJAdBVK^_wMNSsr<c#|DF{t<D4_wrn$Ul|jDUI5-I
zbF2STce*237iB)gbSTDDfWu^uMDEYP=bmduK9`6^IzT>LOSI46$ymf7k^2Gj{9(B;
zj%C4n9eB{KT^Px?SUeVw-aC*nlIQeS!iajbb;^_HE#`aI=Jr%`>)JLs*=(?L%@$Nt
zm;=z_gP&{GZZg3;*DRmXm$W83+M1K`qSBK2^UF%gDrU#mG<K$vah&_nQC_idVfn)3
ztawvPW9zy&KPKXNAf*fEl*}oM7p1$p+B+|pI~QLx5o6A}wzhRGsm`_y9Zjh@_%wEI
zS6f?4Q@XLab#6<`#`Wj7ceGuLoh;(XMQbY-tu0TME?BT&UUGg(X<2H1Q^}(8Mf2Cr
zTQjdD)s&i-EStBWY?fMbA@W3jP>F+zaC=eNoRURqWWlH<`H|7lg4o!|cy&^wFft)J
zF>g}z6m?o`a^&>Ll<17exyD$e$&h}>P*Jn>sn#wvr=_{|x>U#cZS8!+t<${i+1Q0|
zsMcVsJop2jAI}MVl9>S>_^uMsQh&)Ahidh_u_T)EN+<oH``k%Zsq3sKZe0)Z2_A-G
zjaS0NAo7LPb;e5?^8JMW9Fn*=!rZz}zOcGphj6#9^EY3uGs1~QJLuog)r{TDHcM5H
z4_4RZ1V0?GS8!9!idvjJ2NXjQ{A!l*;Y<(X@#^|$9sBoF*{}BU1#?&I$*fLr-JjFZ
z#;p_w+~KoyQF}Am@(s=S0#UzI$Mb}0q{IflR)WQCHzg?34?4-Dym_S?tliXGKB=2*
z4}yVP?_Sqc=ZwtxjC4rS1lt$+hSI*Cb+C9VcyZjj?TdUvZC^}F96D)V8yoSadq<<!
zzy@ny^Gg@l!DR6E^_&@mz4kR1lI7g1TX6o@#Jcgdlk5p#ksh8kmp|p^LUShBrMuI$
zrTQGdqJ~p<7w(O`<<&#!2KO|>=$@!^=3EtQ;<HTHSy|@XFO{y}-I%_)DtaJqQDeh@
z9nvSq#c_U@%61;#?w7kSTfAo*&r{nYr)WWhJ}1ze&35plyxN7{$$C+Hvfj;wX{|ZW
z)SED6@}9`_iBmpOIAwSK{>TMyzv#aX<-LsBGvl(ODxW$$dn9l7+iNa3@C%%}`Tb+6
z{_-ggrDvvR9F4_Byciq((93ya^InV<j5#ZB@n!$<sqr{e>fGyVS00-lkCa`6|ErEo
zSGQD+{K@iZryqd7JMxwZwf}kO9mmd5k@>5SO)rd8UwrJGLN({t2d+7GZv5@X&Q*~M
zA`7Cg7EWOJ|2t$fjrvY7d;0MBlaAUm%>KpZYwgD(H}^eyw43$|Wy&(Iwy;i}Yfegw
z^dL{yE<^c^)433DIAwR`-pHF@J=B2m%bYY9!D*Ck393D;$5^TuunZg1tRv<e!fa<Q
z2FvPiY5o!k%wMD}V@X!`ZR~G27iM??9Hx(YE{sPT{p`VT_FZ^&LeKRvHPyV#cRcRs
z-^1~EsQ1+;Zyatq+zhz0;by`y{9L#<!4<*Hf*Xip=xugTL67p(hvAp;Co^j?3^A{l
z7Jq@d-It!0WhmyG?X!O@RJZx~X>o>Pc<Su-#ZOZ2hX1g~GReE+P0Y7SLjM%C(U*RT
zx*q;|FBNk$Lowf5223AUExz>e3^VRxI=3@HJilt4kN;f7cZFCE4RAA}d8!Q^I{hrC
z8PNhY3jFlbk{QuLbv-?nm>V??9{o<V;&~MxaRTViho3>LTQj2PszX-(QTQiDC#m}|
zC^4R8IwLy8d$z<Q4g7I+p^Jww)}sPM;*nMroNo8SN47D211jQbd&Nbc_rUS082{ME
z7ffX+{IEfXqta8aX{flgr2xNwka*rh9M=N;tK}8zk>BHWx>EnnE99}vDeonF#YK7N
zK%mjgfS>v;=N0_*xRQUBz2c&Z$6GznsI+_<&2T(SYyD6NycQ4)#B(2pyI*{T4A{%A
z&1E;<{>gIq45WYJ&~G=e{|G)OHha~q!S?ieUXf@`-H>QWwXW;R>|^2IeKMD1{Qhgu
z4ZCQW`-HZxqiq9s;?ny=C7ROLCCsK<fhV^CH;&4>w~CuL*aV=n`NkCXT^QnrPT3L<
zvuuL$bNC!(!MaZD6q3Sckj<?)RA8tE^iP(9>irXkR;%o%1Gw48?JkCq>n2$aN{7qL
zA*Wpce7h6am~}WdgrW@7q)@CJi)B$}*YIm=Dy%27U&fHjX>c63O|RR4BO<U9mVZYq
zd>Ev^Yr^MB$vOHvC47FAoP*Ddy5^X#jCiL%2hyJamFNz7i2ts__=923qs179?s3Ld
z8S>`ihWCR#dtM7B&dY?h0-Qq$$4CradJN$>a;_bF<vpHqgf+kkk%#n4;OQkv@RJrp
zfg)UqM;<zkn^P^G{2s6aVPWg1_Zd69b?RQ5UgXJjXFx80C+4_FxtyPh+@QUjLx{b+
zl8?^5Z|1$Xv<qQ&D8*f79qDv1yY_ZLF72aS&KN~*0yj|6`yJ;Q+=tow1Ly-j&)(<2
zM?9H*5|8v<@VRpNyR+EKdAG<7+WR=tVQQfD!xY1_H-b7u{iJ*k;+}j$wm8+F0qn}%
z?#QKlk^2SQxOTjPINCuT68T8-o}etu-RI;Ve-{wEU)lPCXicx-|51C-i{SNwkNQ<I
z5cD7tl;Fzppgn^3Q;Ua-CVoc{Rvt};&wFp~82D(1<c-KpfX|ittdlR&j+ic39{Zj8
z7e_qt=<YW4z$*{t&(#PQ61i6d>cI<;8wV5Z<r4w<D0jQXllFEs@WSk!Z1}wTmjoZv
z6N@BrCk5o@p^>p{DVNW3A~$I7L8O!RHr?`(_jWjBt!Hlw<dRPaUQNsJ->rX>>^z)u
z<8UIk8~4N$d$(q>mw5m_&)yzuZyezyv6p$^%H?|xV(;0OFRXm!J!I;~M+D;0MIn^>
zNqgIA<swLv*!$n`xpHSa_MVG4vG*IeckN(1pg!awi5>h+(Zwrw@QN%S(=Dfd&RQeC
z*Kmotla`PVSGF+{`NGy3Z?Sxa3-8jS9=IfU*Wd<G?Gi^muF(hyUjqG=s}kSOE<pg}
zrM<Cy^npaJT|-{WFRhqYW`4LDe62CxWU9B;I0@1tb(^Z&m#RIYTVG#ax2z34eYm@l
z>w2^$f9uD(`M_fJOEfk$r8+wq6GDGOKM#bhC9%G-PI8Rn+R;G7bIfm)N}w5IYAyW4
zFceesY`j@#a(g+}t$fw!OP@)}^jz1e!<8&d$#WyWYW=KFGotz4yT<V9KEQ?Jy2UX@
zfH+1>z&Wp!5VH-i7|guo_W;D7W)0@L0{O6vqQj%e5XytN!JgZ(S#D`X|GHFuL%Ojm
zxZn98y!sG~MX60qDgD!9=IEWUhmA0y)g?iR;mR34{b-%}*^_gA{o@U9I@<6X&Z;ZJ
zlMntAsc&!W!G18!OvmNtBTVT_=j1v&e;dly?bf!TF5Ki)4!L~}Map{&)tbufRW7!w
zs44^m`P|wpd~X3C+fOANsSa{kZCL-Q5Bcb4THtwenMxZjItw0oUA%e+kB=IH$8UVy
zXNM&Gtn-x1^yH&^98TK-98w(|>$Z>$*6%7YopkJ+qmYky)Jf#tf_rU;O?b79Cl85y
zr1!$PcxmvHhj{F31n)Y4Q9pU-qXGBi5n>$Oi}ot{)dfH86%x6J5a8xtJLGaMLriyW
zelq1cW9&8ovRBF^{Tm$bOXvZSFKmpJu~;+V-<t%$28j1;+`xu*moIFLeLMJU7Hif`
z@E^b(ahQ*^m*rzl>F|cwL4PkVoi8tk3_iy4c?IN+v4xN><0&IJjt2dI%fG$Q=4`~V
zk<Z^5lA3BlVt5k%S6}=nbv>e_JUP~V(1~Z+axBfnkJ4pcU^^~vEE7M)WjR+M`;PA1
zY~0i!?B1<^kzc<a`#P;yQ(9A#*@)aM=O$7e9oPxVznFXJ8-d+_z&l<k+~%!qZK4A&
zETvAg1wrg#tyu@wrbCvsavTu9hl=CYzyt8Vz{+GvZg0a4?*|(XuLDnzkNuF4^i}H+
z;P$_LNJKt-O6405IhG;H8xPqBl23G&{+u#hyeAwycRV~F;p7!Nsx2Nannb@@U~=*H
zI(T>-^Tws`;2u$)ek<Uoe&ivEe&52qi?`pwV>tPk?p}nu<IO6BxrAs<cajfxCDu>A
zu<_=rmd~=O-^q==3f?2QL7uitH2K2Dn;(Nu@`${AucjMU;z&N5@up)<8+wYyHEkVy
zvK#FEk<x|p7Yy~8j^FiBT)Dm!;rHu^y0!1?Umo#=yxLJO=d1C1@qfhh+UQ-ywI|_O
zPo;O2=(jrVitL(RTddzci0ov@=sGoB&Dd1U`^de~_{e3O^*#MM#hwcwV=5fy5KH*3
zLv+kmE!O_yhH&Sdr_Sm8n|d2E_yp)$-2a|qS}!YrM=`Y>e$M#}#neO_&vp?(O}`a>
z-m@Lk?@~<Hq)Z5(2S2U(%y$?wFa}=i$YXuuyh@1vRRKTisSxAYzJ=(o2>5?3k+?Gc
zy@B{R!V1uEXY-1QD(9sIcuwRzzW|f?<-B4dc`2{smAaf)bZ*R(1^}+cmCu_Eyt3hd
zWUMY`=aglP&iaF+bG{B<wav7>n)-{IZXDt-V1r=f@Y~TKNW&WY?Bil!2*g1wEp6*m
zTYCzJQ?FA^E$DT4v$3(Wy#xF5tyLS>+8g_-aiTMYt^C+8CDvm-r*U1X-_Jw%0jXBa
z(E|B|iJjq)gXX2hVLf#!)r$JVx-OIl&qGd~lG|T^f%h^#nLbWZWyX_FgzzOZY~HwY
z8N%Fg=RtJd^$6oL4)tMI%GUQ$ILej2eJAeuEGk4kQgA$e5MfL&wh14xT)D3RnC*yi
zX`9HEaZH};9zz_T`-F%?_y2fxp2Or@6PJ(oN5}_PLJx?1VdLWIU?QK;6|M(?;^i7J
zY-@M<!p6mo;FG)~FZXyVgu|cCAKFX%ef4fg<Klwyp^l4>o6HZ4i}E(!t$i{&j+q{r
zahe_%)yum^oQk{i^q7cIb7WC1#?8CSw7(!eOJCL995+pv88-_8<0jwUlQGkbo7ccr
z&Pn2Me6HsEm(fSNyK(E089Q;{(FJkk-TxgAr5s1gSYbShscG<Ua{LSIJ=-S7%~KH1
zd$t++$HLEdq1YaWGOqqw^O^MuK3isFnfls>cp=u`m&JoC{i%TerhuPyK#2U8hzD2t
zISvZZFY{)GX}^;n^cTT#ysh9B<839c$bc2RqI1#XEXLb+(U0-=T3(T`l~*i;b?`dT
z<Y~jnW?wgs!`%qyIJ}it+xdFqF_kj!!0YCl!&e~3J!Y-Fp#ul-r~!tqkhd^=os2W~
z2f_p6xj%Mo`-ZNj0S88JPgVPx#Bq&~e`LPH32lLAp;Pv9%PZYr<73!3x=p}wMUiXz
z8veWE6vyQ>!h+-DPY_1A(#JoAd$v0v!L#GC_dK{C4Eb<koABL(FjsC17+Al9<0IDr
zDYp!cbO4U;1PC#Xj&0r@A2|-XL>?0Hd0#>gh<st=<C_sKX~?(D^*C|o;vTBElZQmU
zu<`MA#7W+fZy)$7;RwroV7}1)xn*T`yfdTTpwEp977qEjk$DXA#z+1Z7+jYe%>Vbi
zZduF1@<?j53E;Y=`wZsq$yrCnsKvhYWAq+o3}XA32o5)zb>R#IWa3Au?;|YZAEWC`
z0TY9yulD><k9ErPbK;t~W@XnR9A~z^xfKUBVujNDxE0ca;sv}-jachUCYl;M@wFdW
z$UG+)G3@UFvkJ}rqHI4k24f8_ka|YxFGcZIT!>i`)&GS#y)Sl-%Zq9@3e2r3adZOi
zvpdU^#NViRKUlxc=j$M!tpbS2^f6qwar@V!NJKsi`C1>=4f^rQHu1dvntd0;MQ7=+
z`M!dSC+`>$k5x<XI3IKMt43UyeiOjt;<0lS{W#qayrZ~x_2WE;d@@fG{a!+ti<j@<
zF<kJzjeA!=&d<X1`$hndznP1En09%1JqFLqKhEdKM;?;sw;lJce%wn{@Hi%keoXI<
zV@dd3qVA-XaJ(;}2SmQGacm31B@OvvuE&XMVVpCLk&ksjNRpM~2C92h34b4ajF)mN
z#Qof|@_A+i8`?NFue8h#b%X!jcF;5uZycKe=^VHCUJIYTM8B}#-9|4{MVqVf?OE-f
z-@W6*qmUw+zWlH{sp>GA#(97G5kvWIOdK}wxsAm4V}_fKcwAL2pp>&9B}OUvS~}%$
z-a?`beS?3}LpQgs`@3CL<+ETF@`Ck>^(hMfekoY^Sz8~6f2_VY{sJ<C7#8XGZP6(8
zSsiZLT@<zT3qCyQQHVhFG3pUt{228R{6!`j|D}bSfEa$c>GkoSq(1KB$HSOIF;us^
zef%e@JK>LeJnUIB#BZhEW9?%o`y<W=gqTM+AdD;}a1*0ryft9<EfX+nmiMDg{7K%k
zwuwJYJ&VLlKU1eaS)FR-nfNnwe^mgrn7_d_+k#051aa+_c@#r-&c?ODR`6nUemWdF
z>Tuh*iUAfU-xT}<729l*cOs)KmhiRU6=fC4)O!3>iLD6MC8W`$5@|dvwxl}zKfn%+
zIXGdsW<}W|N5+QM)TVZ9!jMX46EYZgmKoTPXHoWfdQE4ior&=?B5Sb8Ci7*vp6T?<
zl71Zh4eGaXga4^G_=9VB$>4>k`CMdnl&i1ZxY2*k(ZEdoN&@Wji0K&>ikOup46mGc
znJfqe4CTRsxIX7aAMK*gZ87Jw@S6#9^vVfYGv|8_G7n?hC`3d20osp{ZJz4q2;lu-
zb4QNnK|b~yLTu+Gt}VH9m7P$6eAD5m5BWHE;k*xc-rT3!hKtUEN0~0(E-)}X@!YxN
z1Mrhq>{x+&@(GFQTw`$Y`W!rV7ouM??t$m&Cv!dN=|#U(0PhJ0k8%X>dfUH>ew?eZ
zFBKBJ_26^$+Y3C&KX>kUk-_uy+YTVwD<g~Gy)}S$z|qg0JH`Y0?EqGoe*CV*)$ch+
zKX$)j@9&U#ZvO4F`pHNp`u!)ET)e}MetfPGydN4ouY8|D+)Owj!TVkSPxj}Y4n~fO
zf_J~c^YZT~;+TIjathwZ19*JjUFsh{ITbuUtKrXUbH{8PE}8_dD1b)*!ISs8>Ay69
z_Zq?kgMf0sJb=e{wgpeVf1#hxOuRyUL+}d*1LXcmTMuN-j7DLY^$1>V=YR0({HDaU
zbC<;XEAqifT_RuDv&MRalTYYT*MmUu{ul0HL%Yit_N?(yB!DR%9frRTjyO^e3UNQT
zY{9}@o;C1p-;jS(;$HY5?^$C4r1M!LYM(W_pH_RMKal5*Y;i0DDI<;gH~h}LwlB*+
z&h6bb5Y`5+t+6Z(#ngB09m67Ck0`PI*V?$YmPtQK?bhkcdn;U9V_z*qKGrwZBTic<
z;#q+0itjTp&V3I)G@OIhU~6aVFt=FO(zd3tr4!#(hpeIXXOLN7B9U6Zp$qBA(wI!*
z^J#3T72I$u>jIhs+;4@;7iXu6R@g?o%YMzJrFhe^Y11bBD7mq;v@Ef7#bs4XRwNRa
zCU~~3wWnrdO=(FgE#92>{=)Rhoh4z?RDuj08U@$WD$qgHvmh<WEw6OaHp_*<UZovA
z8p6jqAtZdCMSwfTaeaw(Mb{Tx$;Y~K8yw_%V^W<Bmp)tYZbrC^C+k7PbLT`044!94
zJ^W$%v9EXWI2RE8+&K~F7Os9t_^EerPDH<pR{}ip5tHF!@3(Nzd=~p!a8Di~vG;le
zxMR&0VX#+XkXFL+zJwkS`NGDUsbG>c<l|boOXB5N1>M>uj(lwULc$kZ*SZ=JePCid
z?WP^Hi_7BrlWO}a`Cz}#ELc!6<aMnIGjZ|8n%R)fJ({-lMQYEhTRzq7BQ&Z<#qYq8
zLw6i2RI#4Oozahs-o#a=?|$v<W$9Y;9>OOOw|94Rr`ps#YSKT)cIKrcy9)I?fFpKp
zts3*Asdn_LKAIPaw4aLgsr)nb%Gu7mO%IIv-LsL|V-EnMaM5l__lqOZ$cTFj8lux9
z?PhPJhG|$ui;ub|fBB8o6VnsZw^!xu$?rR0_ea`=yxInLCEQdv)(idqVBff{xb;Zh
z&bS3{XH2S#oFjWBrS%HgIqik^&5E^~Qti~ReN^<Hd2M(yva<kjqtm0gca?9?s}Xf0
zmu;#xIk5tgxMqGX9Lo<seTVL&^wgL0@b=_H<O_cOOh<aswIW$fPi<<{veQ;}9b}L8
zWasaBO4~frk*fAoLk{cN3@eju*4XcVf0E@JX~?S`VM`?cN$%b>JuPzx>dQVXEbr|8
zU7L%ZJQ!!5M5f0ZreDwW1M!axNQzm%+Cv>#*TZCS&XWhuJo6@L5zC%)AG~UyiE|(G
z+mLP@_*U@x4b2@XY%k)q7zv9fQ(bxyCEk&0+JId#H>Tp;U8A|NrTIpEU^3o;iE}R!
z?4;S%7PnAwjESjD{wR!rDZGzwqg+`w#?QW{qpdNif6#JS^$LeJ;_rAq_GNbJ9>vr(
zs0i%)ir}JXHI4Al&t<wOzFxf+ooXh2s`@z6KY=(ySgqtB24bCxU~{%t?Lff#6+vtK
z2>2Oi#<z2Dm!YutUwQUVhVu1$q?FITC5n}VPQ*8O4ETN${%-h1{-yBmfS=E2)W@Zm
z?~OZ-7vt1wpS*GED){TYMB`Kq{G2<mefGzbCuEZVZ~v-FAKpZDA^dR@jsFwXt?)0$
zo%ua3s2{D!Pz+Wq@Zr&_48?qJNYI|Cs?^6nReixHf2z6`{uCg><xk6i<1U8$-tNPj
zt~SAMmvq4~J-{Ed=UjCyIyIKxGjN=rzgH$|@N;eZSzBKS#D4p{5xg@*KlgMHqW?FD
zCteraMD$`$B0c>{?H{M!7D#_~z`r=)pC6FV`BeexJjas)#9hN{v3<YlJoDZZ!|!G|
zu)fIaY||zh&c~jr@N-RkFRy3>`*3CWe)?@*%5V7GXKN<HDGv}Dubfvb_OK2TcQvn&
z-+(J|lDNiD?b6oYLO(L5-G<|$iZS_vimDikGN<B7{5Y@Bw}@BZbF3sj>mu<fkNB%_
zjbX9mYU`(b;y2iETr&H50emd{1tq3^5+@En?WSEZS?fo&)%u{)Y5r0~f{M|obvUYB
z0sIBXd?x9K!@(6)e3s=u+w#vdb&>LPJcWj@R1fgHQ#x-2zHMl4zo@M>d1YhAB5&{r
zei)Vgk!etfeyh?0=(A`=<BglIY;4((T6XQ#jmZ`K4!R^!x}d(Lv1@Hx$NE+2j#OiE
zSv8){YHH@;L2u}K4h!1o-qpCqz8Es#v*U1e&n1IO7cIjqqH1$jYN>wizJ&9IWjd2e
zO;PHQ8Xe*<+#1QvGLv*=7v>>N%U0qj`HJRNo@n2csxeIEiDfJ2`GN;6j72Njnyy>Q
zeV8&ItDBc;2FkPlHRj|}5&qX0#qv?@c)<v5iW@K|6JGld?MgPZwlrUtYT0amma~&!
zeq`aS!3@L{$i;zJWu3^U-VKe-A-l5khr&545|^Yp)}@lBZinpEZhlq7mn2Qtm8}1c
zfFegv!104w3#zl1HzrUA_1nTAWQi)&E}5)n-p3l4Z76x=!whsIq3H6&GKdl$+fbAc
zX8(_<A=|Ts<P`e%0Y;Yp`F$O>5X7ffPVN6&F(^>*e=BD7f8nv;4uSTIum$pInEut<
z?ipy~$|Vjfyn2}z-;U`QC(9(lyhe!+$_D(r49QCPb2_GwL#FANM`KFs(H8i>YUkDr
z<nsV&E+&_}mq!TBtzF{Wlk^TS1o@sZQTo5|@tqfnskCuVVV>WBdps6seaOeD=-VtF
z9&Zc*obz5G!TU4j<B0OskhzA*^kSRv{Rw=o+^Jx~lw8ZDZ6fzy44!B2B;fHmNl5S>
z3gFEKUOkv-2jvUiGZs(m;5+YOc5E_yo*g@^9mFDu+^&G!Esh;{Wbx!af&_r@?BKqO
zNdj3Cym#Zq%@>~IBzE8t$HVKjcwz?@5<=~$H+-HQW5Guoh(!{)D*|$P&X1G_ujFI8
zRru%HF$s7@2p1B(&8SDN9WNnW984?^t~&_ca*HQ+EY4!br%e6x?5MML5Q`*oKN+ac
zW1)oD;r?F!4jAFuQ4c)(Xs7W+pFhCo+A$R#sI2X9e=mQV#gla0UoWg)-G#JZ_3YRL
zKH|wLh}dywK<-S(4(ciSmqf#I?dS$x5#oge?}G?;?I?#Q4knfd9$7uSYb+kvHSNMp
zm>vIM?Dgz;9DKBcSR|4AMew<DS2=dz(btoEIqqFMo&ug=xp<et<KiV9yy*@enx!wF
zpR@Xrha~z@ri<4FkCgA(mXH2kgp(JK^O_C<4@=b^F^=vJ04BfmcfGiwUr6NsAKbXV
zDUr`5Vv)X2K3q$*4|;&_etXZ0$W7XQO`_f^f^2}`jRhYd+FicI;=xt;X2D*V=n>D`
zu0%q{&w?X7+Z9*H?K^y({8?$R-<0OfFB|e%BR1o_-;{9vh2n}o7K+mHt~1wINU{%L
z_fq-wLG6(&karv0wEWFM(lXwS<Galg_eSDoUf+`}jAw#cHsdFTt_>ZnsigN(wfBB#
z7QVmJ51jZ;#-H8F3jeR+XZ<wfZ(RJ|>7RW3qtreh|0wk#+YngSBZ@s$hWLIp-&4xa
z82vu?Brkv?e}?#ewf}wXll1%98U2E5?kDT_wKE7O>-V!W{3ok_g?#E(1lM1`)6^e*
z`r-X(_%r&+Xk#SAuyX!gAO9KZ>+omfab-P2G33W6<PWomnEdv5kIgS~G2J$#&%}>X
zeE&&^Yvh-}&mgY5^L_7bTr>P9sn5Fnh`Z2-ce47H<u~c^n}RR>8S1V;dg|o8r;Rwh
zHj4p<;auA$@hl4Z3t%qo^7zq#>-4r7a4p)G9&6Gho*ALj$8CDy$0S9kKU=ezvm(OR
zbopX2-*a)^KK8#0o}D4EPQbUdOSzPqdF!|zQfPDtj_<oWKJMEUz`z%Ip$h@fqMTY}
zdbWOQgvW>IQCczpia$=Tfn~P748DLwaQ8e3vx;PXS#|Q>{sip3w=Mm&4bN!fMFiK8
z{HrHJeg(Z0hi=HXj-l^%XJH7-w6cVg`JrGT9C!fk_Xv$J*<>G&xbl$P<vk=LzI3o>
zV{qsEZ2SkbSGNa$4eb<Njz`ke6S(0$pC3u(=HmUA`9LIuFVi<>=7xVpN=$=PrA24~
z0OxWu;V7PX^#2qNkltLl&W4MMBKIc<ck#L$JkD1I?-twFi5>Nb3)Ant;B)afM`J%T
z6OLV);9Y6(JpGc0qu#dL(|qu%%L91Z0U-8Lj^Hf~<X;QoGQXc1KH^;jK3BgT01*8+
zLJHn=gXihD6>*d+qbT`EX9n;dM1<()J{#W%Ua)%gU_0)^@^2%;UH!N>nc#6mrd;~p
z1_wM(zg`<IqqgXG3Bp}G?&%_U93lj7exQ7JAude6(m;7U1pvuEzHTLW1%dK?3UQQc
zUdb|i@anzLUHzVM^mCt$`CQ}X-#+-m%J)fxyLkNFTl90Ejk#Zfn}5&4PyJ*TLOV!&
zHg@q|aP)KEB`*P=tKSRohvnbw0NzUu9%nR^OFe?mipOlY%zDU2qD)u6R~)=E5hr+u
zZTZTxA``L>2@!{m`%1abfLudxNxUiYA%b?3$QSku_?+c4TsXghi5wCy_d`S9)Gkrv
z3ws9qZ-m1Xk7mPDX>F78V0q6iTT~WzXwYZCc|-qRHs5qo-ZLQ1I#lY(_NBqS9zw(7
zc#;F@?^DClxbePwHQl5%Y2AC}^8FpZb5$XOo30%`59-z^HP06$BaLQ8{1`RI7cV`%
z#E)0AeDU(8p2Sa7Gkx)xU^^63r>L`h@$B6)6hm(|#TW1PZfqN8s8f9L(i0dA?Chip
zeeu)u`&6izdaaD_1g*-5(|zJeh|I)~Qm<M+`;3XmkMH>6$E&%votgNFO6E4ke~Mad
z<2gr|7@Z7@4L*Y5KSMunQl93IPSgFI_nj*u*zb9MYm4lW?}gi9<M*#5KKJOWT|AcW
zUHMK<=nu=mpO^3&K0aHlk?rp<YH953tf?<6O<d7>Lo<G+#_K9w9c?X%D*hz9Ip-}u
znp>MXQas^1;q9=W=t!+?YTLj=zcbG*`nAr%nS*m_oh+HkLB_z$@>BTGzmC|@+SIsV
zUD~lP<OlJvr!cKLmXp#QZ8s#aqvHC;j?I}&>X$czaE4|K-iGa9)@MNvP1E0=p;jZl
zA{3}b7iXzQLxDunM04k58#;y#8raG*_+*El|Ku~<t~v6VZQy(|JPYOeGoc>1-L7Xp
zJa2Xa*yc$|INr-ML^%T;V!uFo2rkIyuJ^M)Aw2-+&VAC5$v)&9IEp78{jG4o^XAHx
zHe6H`xz{4x#cOx)+-ITD0CV-LL%J~iMu5r1+vMP}8x#G0jC)r<_S4i`MkvwmhX`}=
zx*a@*3*PSo`mMHcxM-66d(rTD`O<(`%9W8%<Q@vx!EgA;$9$&UBKI2sxoI1Zizbo#
zbO5i%!Q-eZcy|Q!>p~pm%E&AFeIS6h)4}6hQ1E6!0kC@YZ;Oq?MU&`vmf`dAr5mx7
zD<itdJp+7hdGtDR-De@5so=`p1}wqAtv8>&%<y?~w<C^nWu_o$_^qEScb6j<uZnv1
z+GlLf-W`aOwuf6!?uvlD_aTmQWd<U0`TM3Tx6hF)b8n{OGpK9tgYYA%M{>_L1wPN-
zUGOu#%xpw1v0S-NIC7^Vj(kk_u(89lvCqcgqDkc5Z}>d9k0X}p<*jUy%l$@NxqBVC
zTt*eS7eYbzndvDlE%T51leiZr?@P4Lyu%#!%yiV+Vc8Ua7j{X!n{fk`+9i&Bi^YSh
z@a2O^Y-jXNL>z!)ywp>+lezOsOPxoi!GAYfF!X1p`<Ri=cfV&sx;fikjTuoptL_7}
z{0%L>yQp@V-Xr#$gXdiO-s+Og{7r4|sF?@Ov0v5X)v8UKc8}HH=WN@(_lSCXUhP>n
zE|PwrA+JHjM;*NKSpG?+8YjN{vZJq;JbhS=Ir?-Y9&i8Ep^-1=<yV@0Xp4SwVC=Gy
z*x}uL+f@H#L0xHW!SYSjH|l+l4A(af<y-tu!hjyQVz@Zm47iWLaczfnr$(P$-`9;>
zkIXkk{ADlucSL>oW@(IP-#O`;-MiB9hJQYy3b!pS(we?<h~EkkMd5p~K71!c9oP?s
zeFN3mmAv4BM1ou3wzntv;Vb5c*r2XxmV5=&+!{CQ%Jzj!L~d&CDw<{L1nY$m>$tQB
z3Hv+!Ne^u;roMx=l%bgV68wE$0G`5ZL*uv@LF>9rUroD=;tiL#*mlRVi=x+AZ}Hgv
zB3Ln!&9;pH6ve$NNEgCIyb(wTK^yj<8REY7pZDp<UM)jm-{m~);~%FUgumQNB5&lF
z0RCp^62HT7iF+`)#P4c;V(mSE2tI?>Ivr6QVXruqjW&PJiKqWZ0l&M)6XV+g@tms&
zF`nzzLiB&d_2b^%lZw9qe%p-)KgYlV45}r(VsViDE6<Z(Vf_ufV({C-D_(-(n9bkn
z?&Ec;QlH`#3vrL}icX>rSMK4&F(-zG^#rdd#;172;JlYt3@-b4#RPCauPDZ6cr|^f
zw>KrfYvFj#?@dVF_b4bfmOS-kzf=%6zsb_ivL#*xuXcjzo-02V;n7L>7yet|0I$$4
z>e$elNOrY#;PKi2bK1}onJ2O#egn~8Uhsi#z&C!&s;TQGjjh<Qzays)2|`llqIhXY
z`oK?vS)Z4E{dK=*<UnjtDgDIl=P{#z>HhHp;!yTU$mJFIkU=KVyuQ7q->z8lO8j-H
z&33S|KWCa3|B)a3F4Y$%?}8^1$<8+WTc>|Je6_YCl~U{V$>84m^;qob#GYf#Yn%J;
zMy>07|6LpgsK4_~g-1!4(;U1k#Llh*)jls>PSQ$CwYUU6?A@5E;S0h2&K4I%hI6dM
zZ_xL-!@&XcE6+Fq(zWW}2+&2yvqWaRKp;rw3qP=Zzsq;Pu=x0RZiPF~ehvUV;6V4O
z^&uYnvu{~E>7w)CXMZIma&I<#-u%80ex?^wgpd3GxpLF6w-9`kOPxh-g~9XeoeaM`
zgM!VQTfc&P7mx4jQZDg$6}&kXPwe3SM`3n6jx>n!?BJdX#GxaJ9UN0!x!sN(e3lov
zH{l)-o*mrdWik9hf>((E7q16+MF^uEoDm4#2HX=*?AQcPm>o#&vtujxXoJiyL@u#h
zxlcHDuv|ngpZ~~P21nWs59dchjH5dpicyY~`+fw5>9@|}xqOr-B>Mdcc*GUH=imwB
z`#tzvJNCm4>cRZuv%J_b*UFXr<NHV=3vAx~Xv%f=m3oOvI3(UK-0;4{#*r`V`7&Yc
z5D319>yqGcy&o#JOC0&!`XYS4MYs#GA0E!77%%oRpZH#;dv4@lzsW6JR5Ij!rR>zx
z`%P{Ir2q2EBfpThVoP;o$5UywgHKO+*iXaku@JT=gLxj^J7#C?DYYM{9jTwZ{*>Of
zG`%~o_KEZ<yJuHdAIob|J@MMo+U2zunP<p@YG%Cl>BD33d>Quq$KM2dUyVd2JlQ?D
zVo$f(%>#MC_dD%g9d~T&8&S(sQ}_<)sGjfd9$))pTE(Z<MtXW`e{dvkdgS3B9ErZI
zuWICvi)wq9Mt0UzM@k|+e>i0JEs5@;WutcT%oN$ZBfsyR$MQaS)b1T}CFF4)%QI8@
z9xd#~tw(Q!%?9)JQ6p=o)cy2We$S@rCtt>+gSKw!fn#YkGqU4e<ncCIR}$F;>l##i
zS5^LxOHR*!F)y+oHm=e(zA~VVc&Z;IHa5T_+Gxt4y&Jb4*?m2>#CPvFe3BZSmZ$M-
zb>Na?c~5WaJGJ(7yA#W(kG#4&a%W`Gh>u1dnOYnBNVI3<tC10TcN1r0Rb=OqX^}f8
zW96cE>HO+H9#S*YwRap-JoWo^>?>25wS2xNy03wzneyrG_7ukr>rZ4;<jG9U@z<SO
z`o`5xuq7Y4^VZ$X(^ggOtc|`J8F|j`lG?pX&#jKU`A<3*@h!Wqv5}qJKUr!@)Tt>|
zkjM4IuzK=5_H&7%Etz)o{L>sC!}4#}Zd<FL9*0`Ib;<?1=b=8=AIqC+&dDpSjn|@X
ze(mYQM=SG}wl6iZ{5IEl7+a@|tDUl&sUrvRi}&=%t0T@ujoMqh`|RDtwJB}SV?ZqR
zFdLSN{(elIk9G|OU6ZEF9xLdT_<Ex(k8qQe7X03ad2xJwYJFSBW*FO=>}YFF#*0cz
z=FcxHDXW+r=h3Cfcw1|{qr76_!t#a5S@EV8?4KLQfoYx12rpeYr({l9yeQq()!uo*
z+_{YgW6rv^wskG3&bAF5O)0()IJc{<t)(g5*xWj|rDfy#^V>VxuEmZn@#Lbl6^quE
zCrcMBSTHX+zofJ*HNUB3QTd|zYv-+*SCVQ<%}bWeTTnJjE#dgrn8G$=DpHEui^}Gd
zEK(y2MlH#YjE)w>#zw}glOlzY3DJrFzr5>#^0F$^m-(UMNGKx^Av=!afWw3^GawB9
z9R?Uckw`g)Mhz2#fFX=HD6V#*;%sh9MaC9wv};E<-J%v-&xtyEz>}V=aH9^Mw58Tl
zZdqBYo9?>(-RHUYzW00Y{oQYvY3-cdde8jk`|f?;``qXL`M&Rd_un^i+;G0e$3Bl6
z{d=OzwTihCZq`?E%NdWkK8da<{3ydYS9~^%!;gI;T5^39+ob_%4PRrvh9krCnNnkS
zwYCcTuY#SKKgR|~kg>MEllJ6XV;amo&~H%saEg=aK8y)wZ-mDyq!5nVYvDNk`y>0a
z%)8+p2uA1}P*O3RrBg@+{BDiHHxx>oRcx<g;Z?yX%=##Qrx@;i#`L;ArWUgp`Xc@*
zMPQ3}UgB;s7e{#PX)L5-W|*x}dCV~PgYU{<G9#Svq!L;q&bwk}nNLLNn`Q2Tn`P-_
zmYmpQ#axiMJIs5d@EwW%!o+=vxg)Z_B+*}%xVy|vk$soxMSc|R#xA=rI0H4~H^Ou$
z;k(Th*59@F*yr_C<QL1M6F=^y@*UKF5w?@w<J*C3Xw{+qp04%qdxPS`eEJ>S1>OX6
zo)3SA4S$w-*1K0*_YB*oMti59V*V3)5#n7d4jk!j_4vF#>rh@TNI%23T6c%ph@%Mk
zukq=-6rOeF5;I@(g`V}Wc8<ILDsx@Pur~|R$~bEg2k~otadO@Vv!MkIXRG&vlAQOk
zgmwUZ8;|qcwY&z!z6ov~DclF$hDYEmKIVs5J-RGecZs)|N8s^VA<lMx#KE*6Gps%O
z&@7&>MlHDft^Xvyw+yP&<*;X;-;i)|JFwx;Mi_?c#6L(&gWJoAI4j^LFXEBcDu2Ym
zv^4tgQ+)U?$FH)0TIi>G{WMn}YgtJ2$7OBfosM(3ga7&7f2Mn9sa@pie#KvwEv+!l
z_6^$JCI29;>X{1u**+=Jrn|ZKT-VnteTl>A+iRbLUM|ck;rDiWw{Gpd&8}T=pA#SY
zE-phs84jzq**6c^Oj?W1tj*i{ht=np4Vz}>U_DOdu@5T^?MOpd1u(1>WI`sro<my@
zF?i);2U)iEIYpXdq0$!N((DK(YuA=xdrc|03R#X`3T_qU*dbgww5xB~Z1Hu`?Kz7*
zTEg~2MY4Tp*O!}_9;LV6;4Xtzox9l*8?3I*nvIQ9)^5W_O!(lpYlx#c-E;HCKVR3g
zWowVUxEI}U!wot`uL@qzb(?!VYH4ovp)VR=P_&6+1@=4C@E#_r(!%lv@d6y3f3~~3
z>MMzuxYcG?zSw_ln8f8jn9znVCJfB5pG|196T0lbHrYo4YhP>!F*cDX9Z~T2UVMC!
zCP{+uP6S11a-4clXqVzVdeD_dAQsF3yT!2wDlHr^!p0c+lt57$Q4y{b+HuLF2VH3d
zV!@R7{X5*!B>o5E_+!w0GurKnq~Whi>P5RrHSf$Ww41i7_B`8h6wc-0Iht-(X8WTY
z*fyZx@n2;(*=pQBu{#$|-RJob9Be1CElfVNLsQO=V;B8}Y}*uVYi9?qs`U?S%QC#A
zP2y!5bi7AYyiA+K`(@uomGt&O*NLA9vct;VFwl6%6&~Xkyf1n@33o4axpchC*@Zs*
z1F$0we-z?T-jT%nyo#4iUy1hvIML;H5IQtXg9xAZ!A_^+*KjaSmWS@cpY8Ahza!Ao
zPTtBHFQqlX8;QoM;Bi&}?dX073P|%i2ETs%L<Em}I%s~Qf!6>d^5fKP!MoYxNxBvS
zJeSWGIlGXK6|f^8Vo@aCxk<d!5wFx!=A*>Ry<l`YR>9FpATPp)d%@^*T&(ceQy_T%
z?(rnt-jZ~D!P$j$-0RaJy$+I&e@fzArs92_iuW9!f2dwo_5+Xafg*y(wdy(@t5tch
z$3oKa+N3<15iVCA--SP-3h9^)H_JnMKP29#lX&k?>EPT2iT5sm;V;~;xF-u<y@J4L
zWf_cgI(7k1>S+Tk1n*9dC*fA&B$tj_XBX1326n_F7Ddu=auV+zm5y`09m8==KTJb9
zHo%=Lk59s1r{iAWwIUp^k16;`I=<xbaIo?$PIBq+>o-F>UVt6>5Q`$|NY`&3Q|V~-
zb_`eN<CS{#3fz3p7lG5t7@X*IJgds11s0Nye@^n5a~2s7Z79O;Ye_youkfaOJBIsS
zQt!DohR+ZY!Q)t>=Jyit8eqhHo`Ik6JLd5uUHtZME}uW*>_R?ohnsweMUi;#g1?S;
z+-b#qh#j~RFZ)4sec6F<`hG8XCnfiTCWXgWcfo7$c#@7iz{{nB>l_hpNXOki9nw1|
z@jinSosQWmUUd0{c$<75lGGQ@S!R6}5k9|7o`Va4$NakjzYhE)9g{qsgnOza9mj#E
z)4{$m;t`7?>3AxMcbQ7ZMc$6#u5)<d`h6aFzDtF0M)=H5@K&pIu<J<DvBKj?xam;j
z%A?NNh4Sct9r^ffsF02^NxXe39i1xPM{%y}RVVQH929}m%3=K1<vXD8x}c*Sc?{sE
z^O<{m(VsRH!RyDl#@ng#WudoYxT}2m${7DD05rp2gxvXi6EaSZjqi|%ydiBU%V~$B
z)H&Ma#>N}qFJTz&Y+Nr|M7JJzD0(Kx3hgcy2aaO55&kd@vKsC+J`VP5lP>e!j*V~J
zI<T#Gll>CLiN?m;=ClrZ&mvyCkT5nb-&`vDzH82Z#kQ^M8g6j}8?Hw$zyJrhxWDPT
zzH`h%`%c_fZt$l%e1<wwF_WY+*kY&{wiSwNyci*2dnfm8rdMn@`FD!>1x}0br<mWs
z&9LX-R~`N|JJv-CtY;jLcoIhu_TT>_9EIM0y9w7N<KP@s3j6DMUDk>}9S}aB<l9Z9
ziwF5uT)neNd7nf-DqD}QY*lab)ynKEyL;j8D}|}jCyVFeKANhfbm5argKxVztPMAR
zfUI<vDs$GD9VnZ#SukGYlt=z>tG6=SALZbS%#M$wcB}&;V)s^f=zH=C#7jH=$cJ_;
zZaxQr7oI^2y}xi4JPz?_JZUo%kJUx+{sHHj-!iy!{Qe&P8jo#e;m58G!F#8}3;fvL
zBX8PJgx~Er*Ld53M>}HDU+_)?Ir5WdP#?}Qyc2{v{uoX_gYF3y?u0fJ^5A(Z9T3{(
zo<WbnU&7F?OFNXV0q4m3ejKdOF82)jDYQspkR7l)3KwC~+_mXt8fMO#HLN`oE|?>G
zES&fo<Hy|%D?EcPM(lbI1I(5=1PXRv1U`SDJ0zUBSHg+(HJH;fs%^v?hLh{!4;jv`
zu?b7MjdgOkDdXklALquRnBZ4i{)FeLe2F)gAaYl79(d}Sk4Ac_C8Do2?}_xaM&|E2
zi&}G=zk#s7YeaaXlkj5<_q!}azYX&`tuxm~`Z}{5ZvPlXusX93ZepK_Up4*&vmgpT
z!CVS=(GHLvBF6x&4l^&Z#{jhw?icZ3q^~z0g1g{TZ|;P<5n=M_Z8YzQ!Z#YWbqhWW
zSx5!nD0*vTKebTetb#ZFt0R4jSps*#r^Rf6oA1V)Q(B!rGt38ZL*qS-_YLm<$9HVH
zS!{JRC);zJT4B5ABRHd;oa<_8&Em*@j9C!r>kQlcwCBCDu4aOn==t(}d~D53GY1hB
z@l7(9!%^VZoAFWjM)MP2pIrF1FmJ>0ooZf);%_krBl}tALy`Lev&ZA(VAKCLAHTS7
zPxQa`Zb^@xU(ft|Jh49>**BVd68!rUd(g1$Mjq>%_#bZMG0U{#3)Z$D;SPE{fUVwN
zK3vnp@~KS2KZxw_5$x-{J?3RtJu=hUV;+Nb`%c1Oj}AzS-{AF_UqN?GqYGDq4kzYE
z&Fd3?bl_P3nTh|o-hWEskLqph&jT3dF>ETI$8ZHVMU0*uvv1wdTlKk_6PTrq;Omwn
zz`XD{DuXPs$fC8k<{n~Y$V0Hs#xl=F!cpHc<Z277wW-R)Vsb)tG&*Ojodw7<F7!pb
zgJb7$@co8lS=`kFC$h{k5BZZrEI3+iHe=dA#43uyUl{!IlnQ+jLE)DVvmjs=VXR;F
z#V=Qat<^b}Tqz5KNj9rO^)Kw)2sdL>sUH+2pSm34i7c}mLviL1i=1=X-+#u8U1-LE
z@vU31G;QTIRo9Dq(XKWtvME2YqdG)B8%ps*2IS^FV8(-=>kwu+^trujILl$cZT=~<
z95|Ma83OJ@7}a}$dIg5x?WUj{iWlSRA$TZ<yD8{2v<L8b3o;ome207+fu3v&P%g)F
zo9EI3Eqj0Gz9y+19<f2>{GHA&y!Wzi+dkvGrEeyf+hM2Qd&hwQ?WBL3c69GTB6Pf+
z@DmK2hIh$3VW;sXD?Fx6@cJBH;I|Mu#v|z$>@^8qlft9D;O)k_=C=%PKJ!HcZx=i?
zzv&83-g}ALhad0)zg2M4pEeZ1TZ40r$3A}AG5;99@SC6H-x{yO!HSd{_ej!s7b`qA
ze*|w_l7HmOc;yX4_;HL&<1JKpY>NmU#|(7-ZGt<Of0%L_;Vn~mXm$lWhSmAE9d7cY
z4Mq6TPxD);@Yn_xe!a*b&2I;E<S!z4Z-Jf0TdnZ;HY9lS99}42)*o__HzvX39;h0x
zPvNl{DR`U<q519gIvlJ3#tO%BG~OnK$G0)T8|Cl<zkSe=pS-crjxsXA8&G(YsmG7u
zI7dSByBB`B^6i9?=68p}V}G*XO>}sH-vJ*FZ78&(j7#u#D!c~h1@ClM9^v{w2wkpx
zPfN;!-za7Jc)c|$ynjjfJq{i1XhRWx-%j}LQFu+>j^Wa=<D&`#r{Vtho#cAkr|_ow
zFvR<Ga{V5IAN^@V5q_Ua@a|Q3&EAgTeu5v867ugj&U5AaL-_0R-LLTQniI<7^Ed}y
zDBtJcW<0c^2*1zaT;n~c@TPk^hU0gS$gdqg$_w~)+cWo%I{r@cc1X6B4tVlDAR_Ue
z0y`b=Lx`8xBkKWP$3i;3ivYwGJkABl;XMsIjdx7p>9P0EBzS8|@a{|So>zE!?0si~
z$Mw27emfGpk!VLqdS%Rz`Ft($)Vg5KY0)B1|GlNq?@YT~zw=i;KfyQ;*Pj-_+Xy@4
zalhzjm+N<KL%C^)J~+5%7;zf$1B|`yXW|1a!`XLg?!1m6kA1FoH<r-v+=JM;-xBtb
zY94iH1lI0yo#sj14PWGO)B`&fzx<=-?gJ0!_Epk-(0}N2Sw%Uzd*rl}y7wL$*<|@n
zY3QD28K0~ezx1P4yZ-Tohx2P6pFw(SyGL}_`ZdNQcAEyX+pPx0;<%5U<kz{ruWQty
zU4G5*RFsW8zqwBGf0N#^WNdr)UH`tg(*F6>?vHuUnAZUBkGwz3#*f$aV8U_aehwf7
zk-MDp$gR8ViR^jDD5QcX#_~w7pCG)x&oB!jy}OVEp@KVCN2J$xGKQaM&X4rGgB8MW
zs5eG>wqOe3I>^^X`i4S@vkJZ_FgnsVCHiJFBGNY}`swC|NY5u&AzbIErGnDBHnMLw
zOW<bNIgzKGb5-#5mrEl1Ibvv!6?36!kMvmBrKEycMdwBOOO=-C?=pP9ETpSA#Tj<m
zGGilsccQ=CoE+&dPxQ;pukaizWO;Flvx>RO^hM#XO7z#5t0Vn2=9B(;&ys3H|MIg6
zpS6qEgb3YF;(0+oJ|`M$Mwzd`zHpB=XZdG|)1P7ILKXUP=7|LV^S~+e6U`Hzj|)H9
zu4^px4d$1TeUtfBWZ!JgLO|NHWE*Ryo40v>d=@s=w41rG7h!t36Zf|gev_m0&N098
z_>SL&c0NGC?^3fiN`IH#gTK&sn{_@sqiL+U+<Z2&Uv9nt<HG(b^FU;Oja#>g1{U9w
z`0aTL=Yfz9`|&CD{xacriXyj9TfM(5xQ^56{f&-$msz*JfVf^Wa*s*e%s@zehdZ{^
zxnpqS_QN|!Ei%7}N8t<dmM?BUyaUzZ<(HJX-jPwSxy;Q4<dM?C$<vT}HZCD8{<aj{
z{-vjWzSlRnW4)w{4I4=P0(Wcy85C>bp6dLA-rtt$yS+Uc-PT^*ye--9CY5}Hsj5%0
z7;5lcorOoWZCG9@w$>x*Wy~$`u_GE+afku)X6$0iXgl*#b(X?lI3Sc$SL0xW1$~-r
z*c)s8=AK)6H}wqU!bv)ZW?dZ%=nNy4p;=eOvia5<h91e#jH~159ZnoWGOmu})*A*X
z0}#(?t5JHhcD^LBU~fn$yb6*`)l<uCh0W@#_;5{f)>7(LnZ63Cy67TGIkm$mmT6v>
zGb+7c(;|<eV-DpFs)#cS@}?>e@&;8{D8RvTGp9b$LgDpWw`}V-{abF{xV;Dax7b?(
z_71#xpm*)td)97vd(SYIsUm-)T(a(5DLAXD<k?(}5R^}~H8VE0E_|x2F^Gk)1T0(H
zwP3}Hp7~u%dzR0?a?#Z*<}X;(j?bt0{eNxh*I^+%hg7@f-qJR=6@ulnQ8cdxR29Fl
zn6|i9-JXoPEZmY;ze{7)JWCA2#4BI@Hw?ncR~W=AU(+!m82F{59QKj5mjg4}?S~HV
zaX32;gnz&9l1uYbv~_%Q$UelMMO$Z^YWuQ{Md`<n=P<WYygN9zZ$g=m`*x<bW1B{V
z?E}iYV5j@BRwGU}lirFS`4ErIF3#&=yb^8|&h^`##QSz<7y1GFe0WKl*sV|E-K63r
zXNmV4h)}0@lh@&3MfiLjCpsN>0FS(x4ju*XK8F|hF+Zv2k0Si;N$_?mJT^N8?-7vI
z{I)9$;t4-)cBT34Qh3Zq!Mo4l1%7uxM{bhWfnS2RN8z#AD|r0gkLI`2>u|6l{Kmpg
z^V_HJSRVwB`}6@X@VgT_@}mt!`29G^zk3xPo85xPdA^$8ZiRu<kbmss(ERo*JT%(_
z9-G>l-yXQhk2VzH$9BBNdr;x=T}Alq$GPUWPhsFR@Vg)98t);6$G8OVJvi6=?uMKE
zXhRWx@5H&rdsN}+ai6dF>k`$$3V8?yJ*0fUoLp~56dv<T_<bh1ewlvqqYXu{?@REG
zDLlU32;N$p>->9AVc<0I>%qBB?{S6K0G;41!MV=AgK(2y1AY|Yw-DzV?^%V{=<OKp
zCHyqM!(NAj70JIB;L>={E4(J?gx}Y3uK7I*H{+oVg?5y$;HU9kQg~CL6TFv`@;%~p
zI9L&WFDB*jYlYVgOTl|ODc_^eksoa+!tcohZzPOp$NMQ>F9Y6q1km~S6m;y%5D|V{
z<EGO)8eqI<5N|qu!tXSXC*ip7?q~t?c64$NeVxyf;UGU^Q6wE-PU4-c;??6m+^<U3
zc{BV$5a2z7{4U0ic>Jw)_h<XfNjR|$Wjt;n@vidsXQ|-R5pM(RiO22?+L7-m4zHhU
zYbk4dI((N$NC)?IXZ{J^G6ZIL;?2fS@FoBU5TSjr0S@5=ZwZdMopE`rRCp{u!TVQ)
z$6vVLZ-RsIN*N0_$4_<nu2y&*3h!kEfN9{z@hicAci{ITJT+dQ!ecKd!;lBR^$Cc;
zZ#x|Hm!43;emue3r0}GC8Sc-M{M%8&@0KM01{B_<z!8269A4nJ)AOSZMfmX>4LZGd
zD7;Q@M}BW{^*-d^t`dINCiQ-&!s}9a{GK5o0>9m!A8jbYkNXU3e!CRjLT^WY{H_rG
z0zd9iAQ<ot<+~XE8gGxn>xLb}5bsQf7x?XioBp(+2sXb%sPXnGyd~a_;d&4Nrhy;#
zM!=;N1jS(G&9KvW_bR;0VIlm|y)X8Aezc(ozjW`5{R(fHw<Ev%lJb2Jc!EJZ;df6`
z9uF$K<qFU5r4jP)pyx*$ieTTC;60@9R(Lz|djR3_7xL_I3BS+6U+3SW3hyd~$L|l}
zFYtR54#q<pityW(;2lwTE4>}V$#}bz=@EpJbK*(<rQ_|#6y7xoZwClye#bmN+E9ca
zzfrBzdtBkI@^<8R2A{uby!|-vw21Q-c=Ei}D{1$4%8)w#-sGO=LBsj^T4+Pzntc>;
zzjGNwJKpz1#O@c!EDdo4j@>Q~Y@avN%jfpYS#xI%XS}_my={)OKk+)RSL!UQFy6ir
zDRuiVpUlzc7e|d~=&m`85ny}|>EY*&a+l;od{*c7688HxZ{RneMx6b|=giCz7tVjq
zoNHeH$~Qm%;_oh_|M5ekI~>|kKW6`$otA<BC*S0K__-Z6E_!o3yK{qEea129-<RJ|
zu*+=zulegd`+sx(N4(aJ*EH`*?61HQ7~77PJ(=Ll3g-yy<&7#x#k?Qx2IUT?IH{g9
zaH@HC6rKzU;Wv`CR4_t#Yh=&fi$b{Ojcv6;+|5DU{3dd5q#tjtfxAHr>`JfT0AIhz
z$9r*&+Z&_se7i1$YuuJa`uakNvkF$sFOKx*B>E}lu1G&6(N8n)jr7wJ{rQG%!9x6^
zB=1qdYPOpqJ!hX4!o82LkM!{@k&2mT-W=)YnI}<k@MqsyxrS>mo&j|8S=3l_s(GFc
zFMJmK5bv54-h;>1Tw-ml2mW!5+zdQZ7=*TUHDk<`IMU5$NnK5ySqcZ;P1Zf${7r;+
znc3r?aW4EM+ZR!UuQ&e%AiACY9P>NhhH~yHW>FM=nz=pVbH4e0q;E4<M|c;QPetx|
zVa|(7?|k!V-@tJ01!f@PzsNND{B`=p=8;Ih)cht2e}$P6>8~_?KcG+^*ZcHIeti*X
zFY*twMk0MB?A_q(D~8|b(e~d=!Y@z4KatqW900+SHG;zDol*GlW@m&y-i%1}f1BuK
zPKMy|imyG_^+9nBUIW|}e;I|j1S4G^M(tE6Az|-l<Rw(5w$a`H>P7F%gmVb8_$?Nu
z*aP}>kAusT{Sg6&l?=kU1lf2{=vn^>CH@mj{Bc{dIBERon9KU(HkI{naP8}`R`EP{
z-PAODe~-_#i%c4(q}cX&u*dDk`is5K*P0n6{^(@M+P5bD5-)CFQM}^cUgD3AVX+^|
z8cBTcZD8Y#>w4C0-MVFKv^cP8<cW(P+uAm5S-){@Z0;7s&DppaGXyqrcj)!o_;vPT
zkzd>FE%<!H^_#GLw2en;F4(rYuSC_}x8+8BzM(2eyW4bH`46)AElOXp#Ly3(*%gi%
z6PI>1B3xqVQr@-|AE@wISVU2se@XTgrizWuUuTfzQe~E|Jq!yYb2Lf@INLhH0O!_q
z*W+tv8#k}dksNmLToQ&0;<CDZ%eH}@E!X$h9Jk!cDqmPASylN8O;zP9RB`1~{!!&C
z{Ab0rs8B?eLwT#~s95yb7N?Kq<#oIIf(uJ7RfQVFDpxhCaw~_KUe3WLi&&M*!CcWS
zH_Bqh#ghXpvB;xEg_=dnTV&Cas*r;#Gs)sbH7JLcH^^h@YL~^z8f3BJx|##aSg^=l
zovvQv+E!Ip4Zq~WXNj3{qWLMDpOb-1s%mM}Y5glTjOtanm98(PR&g~bHPhu=Zlns%
z%y6@HW+eM>*?UPQlcI7eSuyPAh}adwVMp{q=7nI2NHH&jGeWp0H>ZURcLlI9bI~?M
z6FJB#v{66d+pF|s+nw@Zyf^UNzdopW<W_Cle?0pJj8eNMXJY@eok(F{_^CK{(gA5j
zoM?`ktMMZr+L6X%9uKbtR@lGEHnE7{@!OdA3w^tNFkpB|o7k}rSjW2rMr_kDUZzdr
z{UzG+dW>!ZfP~+<-j23+ffyje7~LkEqq!MGcrV2X<CPB2Rfw1T7%%-L-a9>BjSsjF
zx?FlkI=e8IcR%ciXXEgAIN11fylY@2=_Rhj+nki|0qAHa;^~+s*b%SOEBX~4ds77O
zH|{+*l*eJ{$WMA)Xh-3`)f#UHjA+MvVf=!(80R*hailzspJ31}{QO$s5bqJ_h{yLX
ziiAnm3g4;XJ=5DU+yX?Z<2?qyCj3MMZvu>TI(8$l)R*xvrXBI-c|76!3jA{A`!o2%
zG^ArB91Kq^ip2Y4oa=b+hmn*o<Cl0p;QJlq`W+3tT=~8)DUX8+kG)lb*PE2DjEPH+
zmhgK^g7-M^m=2aNUMB+{UQwfbZUR5SfGU(P^GfGSv(FdlDU&daL+8s;74O;5Njf<8
z3y5%EYlS11FF%8w#(N5QlF#QTyvH0~D7Q|}k2Vy>OL-*0drt9_`wP?X-?;ApBJf)R
zM~>giu+#irQ2eGKJmV$aR~=s9x61RQ4Mq4pmf#Vb;aP5YjSqO2xq1-zttsJmQBn^^
z0Z;O8n!-EN;RSyEo*!)}!teA1Z=&Ld?u5W^TXJ9Hn0+q)Zc6TJ4T>LoK_&l|I=sM-
zYg3sow4n&UMG0Q3;-}|=98dC(W8yh}PbKN?Q2f{nEBqcv^6zfXk2VzH_t^w*iQ+fQ
z+c8~NA^;#l`QBf`Zz=2m5uOVx6hHO?3%|1+UdTTgBbJ_G+EKVxN#m_i{5X$K@a}ea
zf#2a0e)|%<4T>M11%h{z!wdY5`uw8}g?5x16TIz;AD7|?-qUDDF#m8lS$PT$_RWe2
z-jlG?>D>W`JU{qM6TJ5)c<dj~;r(TTw^!j^rtsz`c)Zc(@VGWm^E;sM<}18U`0Gv5
zJFW!pW6AaLxWZeY@c6Aroqx?Gcxw}W&nUb_3U53rwZ`Lj8FJ|z3p<_OR}|i2g~z#^
z8jpL?=I{<A{LVl-TgrE-!h0dfKdwQ~;c?Br=GUz7u26Ur6Moz~HitJZ;n%6~u2gtO
z$WP5F*abW-%nOQqzoykW4efGs3P$+y@Mh-qQgOV8;2lT2Q1xrO+?;~TfTt<#K%fJ-
zc!<-8AFm_cUuVvmH>^1Yvpa@9r(g~84ie@R%t7pK^uBsM`B3(OEgO5!?K}Hw<JpuX
z|H9_6YkO}VD7KOvxUGNP#=gY1)cHp|7G9cWC^+VQ6)RzoxWaSa*O`$X6<-OzH{2BI
zYt8H6F5V$r<&z*B^Bxn~%Nv-p;F$NRkzU@EL_fjq<0E)nUCS{~TxMP-81Ab@A@YbY
zE7p1;wUf**qa;o;Y^xT0<&8n?F$Ny-k(Rya8_l#x&#Sr+?%P@)>8F}A;V$@2HJnFB
zuDlOa^PO&fYyI7Qgk#d*!3~A?55ng5W&I?S)Dw^UvcAEmm-pGR*r4;<I2Pf@m^wPV
zFw9?jd>5Wyq;>YpBktS!T!cT#d@I5~-(2VQj$gfLgq~42yhgJt!kcRD_Tj1LKCokb
z{5T-Kin%D_Q)_-3;g1R5rf~R^%oJ}g@dKvVN7WY}*IzR|l?H0vm?@9-jr<Qc3W(vu
z*r|j=b!ORBFeXajx@(Iw)w@Xo5^(VHp2fk7v&He%tp!sv=&m`(;nke$@~fuF`=96i
zo4x-u?~j*O#$WSi_;<p6QaiX;An%gV=$~}WW6UpaP~9cW;X%8bsk_OR!Ij!nBdWM_
z<4}QEq0C{-BcGm)o3Gze3>Xy~Fb*D8lPxSIbK(RS`W%ZuHn+oQMw!FVY;rJFdOJ84
zz>9Gvl_kZHlq$QzG6XJm9*trdbciYh&TYe)QRdRDsAh&3a@rh<=A0u_tsiWlB2XX3
z_=Md+v#j^NNXAh21J#79d+hsW*ae>Uqo($Arnbl4ZtjVXm)adY@!u}tOnT|jLI0}m
z-}!I2r}|qtZbrC2p{ejD-u%4q89?cP5znP1G28kU|0D?eB2zou+JngX&z)U(NA7^z
z-dnw;;Qa({{f@$U!L*b90NT-g48S_xPWTB1PD6YCDC{&|v%+KA1aH5?3;Y&B$9N?D
zg3bNEH6GXH2tOVL@8ck+`7MLaKX!0daQ!HZG+u|oW2;Q?xDEw>f!}KA7@xG<gdh99
zG+w8|<1<L`zKL^~hV=D$9S&BIOe;^|zs8gO>RBFa4+-9<ajyAofSdeiLlJ(T!nwv<
zq4+U>1n+~cJOaOd=yd)GzrRY#V-@gdM}BOT3f=~X7xHfhbmS*3SK-HZXU%Ve;>Wg`
z;IThR=ii-hGk-+{kNsjAuV3M@|61@ER_EUyxXF(;6v3mP#@nv&*f$_}-v^lHw+}j<
ze}eZt7-_s63Qzalv(F8GA^-LRk6ffBE_hrIqVeujcxVO%ek&bbDBlOY4hJhzzAF;E
z-3pJ*JxMR;+2JqnI|v>5`6gk=zo`k{UWM17@Fpkszr)b!{1bi?VW-o3H}ItXH7dOS
zKmg6}D0JjU8;a!L&ta$W4k&(2-j3n^0zcq|{Cf)Lx%&5R_-nj_3U4ZOl7FjkuK7I+
zH{+oVMfk16xyC!J@S43H!*%)m!@<h)_|NM{MDQ+6^6zoru^#jKZNX3YU4j#)w;ew#
za7fwGO&xz6gWyr(ZGa;e?;}aP&!~8H-~ERZyxG9h^+3|`!36IW;7L8uefJy_)_q|M
zNmhwCdwjgDUPrrJU)TfQP9T0D0Nz8K{6;7K`nBD~;=obteg-2{!5|HE_&DVHWxD<c
Dd_+i@

literal 0
HcmV?d00001

diff --git a/app/src/main/cpp/libcxx/include/CMakeLists.txt b/app/src/main/cpp/libcxx/include/CMakeLists.txt
new file mode 100644
index 0000000..a12aa1d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/CMakeLists.txt
@@ -0,0 +1,934 @@
+set(files
+  __algorithm/adjacent_find.h
+  __algorithm/all_of.h
+  __algorithm/any_of.h
+  __algorithm/binary_search.h
+  __algorithm/clamp.h
+  __algorithm/comp.h
+  __algorithm/comp_ref_type.h
+  __algorithm/copy.h
+  __algorithm/copy_backward.h
+  __algorithm/copy_if.h
+  __algorithm/copy_move_common.h
+  __algorithm/copy_n.h
+  __algorithm/count.h
+  __algorithm/count_if.h
+  __algorithm/equal.h
+  __algorithm/equal_range.h
+  __algorithm/fill.h
+  __algorithm/fill_n.h
+  __algorithm/find.h
+  __algorithm/find_end.h
+  __algorithm/find_first_of.h
+  __algorithm/find_if.h
+  __algorithm/find_if_not.h
+  __algorithm/for_each.h
+  __algorithm/for_each_n.h
+  __algorithm/generate.h
+  __algorithm/generate_n.h
+  __algorithm/half_positive.h
+  __algorithm/in_found_result.h
+  __algorithm/in_fun_result.h
+  __algorithm/in_in_out_result.h
+  __algorithm/in_in_result.h
+  __algorithm/in_out_out_result.h
+  __algorithm/in_out_result.h
+  __algorithm/includes.h
+  __algorithm/inplace_merge.h
+  __algorithm/is_heap.h
+  __algorithm/is_heap_until.h
+  __algorithm/is_partitioned.h
+  __algorithm/is_permutation.h
+  __algorithm/is_sorted.h
+  __algorithm/is_sorted_until.h
+  __algorithm/iter_swap.h
+  __algorithm/iterator_operations.h
+  __algorithm/lexicographical_compare.h
+  __algorithm/lower_bound.h
+  __algorithm/make_heap.h
+  __algorithm/make_projected.h
+  __algorithm/max.h
+  __algorithm/max_element.h
+  __algorithm/merge.h
+  __algorithm/min.h
+  __algorithm/min_element.h
+  __algorithm/min_max_result.h
+  __algorithm/minmax.h
+  __algorithm/minmax_element.h
+  __algorithm/mismatch.h
+  __algorithm/move.h
+  __algorithm/move_backward.h
+  __algorithm/next_permutation.h
+  __algorithm/none_of.h
+  __algorithm/nth_element.h
+  __algorithm/partial_sort.h
+  __algorithm/partial_sort_copy.h
+  __algorithm/partition.h
+  __algorithm/partition_copy.h
+  __algorithm/partition_point.h
+  __algorithm/pop_heap.h
+  __algorithm/prev_permutation.h
+  __algorithm/push_heap.h
+  __algorithm/ranges_adjacent_find.h
+  __algorithm/ranges_all_of.h
+  __algorithm/ranges_any_of.h
+  __algorithm/ranges_binary_search.h
+  __algorithm/ranges_clamp.h
+  __algorithm/ranges_copy.h
+  __algorithm/ranges_copy_backward.h
+  __algorithm/ranges_copy_if.h
+  __algorithm/ranges_copy_n.h
+  __algorithm/ranges_count.h
+  __algorithm/ranges_count_if.h
+  __algorithm/ranges_equal.h
+  __algorithm/ranges_equal_range.h
+  __algorithm/ranges_fill.h
+  __algorithm/ranges_fill_n.h
+  __algorithm/ranges_find.h
+  __algorithm/ranges_find_end.h
+  __algorithm/ranges_find_first_of.h
+  __algorithm/ranges_find_if.h
+  __algorithm/ranges_find_if_not.h
+  __algorithm/ranges_for_each.h
+  __algorithm/ranges_for_each_n.h
+  __algorithm/ranges_generate.h
+  __algorithm/ranges_generate_n.h
+  __algorithm/ranges_includes.h
+  __algorithm/ranges_inplace_merge.h
+  __algorithm/ranges_is_heap.h
+  __algorithm/ranges_is_heap_until.h
+  __algorithm/ranges_is_partitioned.h
+  __algorithm/ranges_is_permutation.h
+  __algorithm/ranges_is_sorted.h
+  __algorithm/ranges_is_sorted_until.h
+  __algorithm/ranges_iterator_concept.h
+  __algorithm/ranges_lexicographical_compare.h
+  __algorithm/ranges_lower_bound.h
+  __algorithm/ranges_make_heap.h
+  __algorithm/ranges_max.h
+  __algorithm/ranges_max_element.h
+  __algorithm/ranges_merge.h
+  __algorithm/ranges_min.h
+  __algorithm/ranges_min_element.h
+  __algorithm/ranges_minmax.h
+  __algorithm/ranges_minmax_element.h
+  __algorithm/ranges_mismatch.h
+  __algorithm/ranges_move.h
+  __algorithm/ranges_move_backward.h
+  __algorithm/ranges_next_permutation.h
+  __algorithm/ranges_none_of.h
+  __algorithm/ranges_nth_element.h
+  __algorithm/ranges_partial_sort.h
+  __algorithm/ranges_partial_sort_copy.h
+  __algorithm/ranges_partition.h
+  __algorithm/ranges_partition_copy.h
+  __algorithm/ranges_partition_point.h
+  __algorithm/ranges_pop_heap.h
+  __algorithm/ranges_prev_permutation.h
+  __algorithm/ranges_push_heap.h
+  __algorithm/ranges_remove.h
+  __algorithm/ranges_remove_copy.h
+  __algorithm/ranges_remove_copy_if.h
+  __algorithm/ranges_remove_if.h
+  __algorithm/ranges_replace.h
+  __algorithm/ranges_replace_copy.h
+  __algorithm/ranges_replace_copy_if.h
+  __algorithm/ranges_replace_if.h
+  __algorithm/ranges_reverse.h
+  __algorithm/ranges_reverse_copy.h
+  __algorithm/ranges_rotate.h
+  __algorithm/ranges_rotate_copy.h
+  __algorithm/ranges_sample.h
+  __algorithm/ranges_search.h
+  __algorithm/ranges_search_n.h
+  __algorithm/ranges_set_difference.h
+  __algorithm/ranges_set_intersection.h
+  __algorithm/ranges_set_symmetric_difference.h
+  __algorithm/ranges_set_union.h
+  __algorithm/ranges_shuffle.h
+  __algorithm/ranges_sort.h
+  __algorithm/ranges_sort_heap.h
+  __algorithm/ranges_stable_partition.h
+  __algorithm/ranges_stable_sort.h
+  __algorithm/ranges_swap_ranges.h
+  __algorithm/ranges_transform.h
+  __algorithm/ranges_unique.h
+  __algorithm/ranges_unique_copy.h
+  __algorithm/ranges_upper_bound.h
+  __algorithm/remove.h
+  __algorithm/remove_copy.h
+  __algorithm/remove_copy_if.h
+  __algorithm/remove_if.h
+  __algorithm/replace.h
+  __algorithm/replace_copy.h
+  __algorithm/replace_copy_if.h
+  __algorithm/replace_if.h
+  __algorithm/reverse.h
+  __algorithm/reverse_copy.h
+  __algorithm/rotate.h
+  __algorithm/rotate_copy.h
+  __algorithm/sample.h
+  __algorithm/search.h
+  __algorithm/search_n.h
+  __algorithm/set_difference.h
+  __algorithm/set_intersection.h
+  __algorithm/set_symmetric_difference.h
+  __algorithm/set_union.h
+  __algorithm/shift_left.h
+  __algorithm/shift_right.h
+  __algorithm/shuffle.h
+  __algorithm/sift_down.h
+  __algorithm/sort.h
+  __algorithm/sort_heap.h
+  __algorithm/stable_partition.h
+  __algorithm/stable_sort.h
+  __algorithm/swap_ranges.h
+  __algorithm/transform.h
+  __algorithm/uniform_random_bit_generator_adaptor.h
+  __algorithm/unique.h
+  __algorithm/unique_copy.h
+  __algorithm/unwrap_iter.h
+  __algorithm/unwrap_range.h
+  __algorithm/upper_bound.h
+  __assert
+  __availability
+  __bit/bit_cast.h
+  __bit/bit_ceil.h
+  __bit/bit_floor.h
+  __bit/bit_log2.h
+  __bit/bit_width.h
+  __bit/blsr.h
+  __bit/byteswap.h
+  __bit/countl.h
+  __bit/countr.h
+  __bit/endian.h
+  __bit/has_single_bit.h
+  __bit/popcount.h
+  __bit/rotate.h
+  __bit_reference
+  __bsd_locale_defaults.h
+  __bsd_locale_fallbacks.h
+  __charconv/chars_format.h
+  __charconv/from_chars_result.h
+  __charconv/tables.h
+  __charconv/to_chars_base_10.h
+  __charconv/to_chars_result.h
+  __chrono/calendar.h
+  __chrono/convert_to_timespec.h
+  __chrono/convert_to_tm.h
+  __chrono/day.h
+  __chrono/duration.h
+  __chrono/file_clock.h
+  __chrono/formatter.h
+  __chrono/hh_mm_ss.h
+  __chrono/high_resolution_clock.h
+  __chrono/literals.h
+  __chrono/month.h
+  __chrono/month_weekday.h
+  __chrono/monthday.h
+  __chrono/ostream.h
+  __chrono/parser_std_format_spec.h
+  __chrono/statically_widen.h
+  __chrono/steady_clock.h
+  __chrono/system_clock.h
+  __chrono/time_point.h
+  __chrono/weekday.h
+  __chrono/year.h
+  __chrono/year_month.h
+  __chrono/year_month_day.h
+  __chrono/year_month_weekday.h
+  __compare/common_comparison_category.h
+  __compare/compare_partial_order_fallback.h
+  __compare/compare_strong_order_fallback.h
+  __compare/compare_three_way.h
+  __compare/compare_three_way_result.h
+  __compare/compare_weak_order_fallback.h
+  __compare/is_eq.h
+  __compare/ordering.h
+  __compare/partial_order.h
+  __compare/strong_order.h
+  __compare/synth_three_way.h
+  __compare/three_way_comparable.h
+  __compare/weak_order.h
+  __concepts/arithmetic.h
+  __concepts/assignable.h
+  __concepts/boolean_testable.h
+  __concepts/class_or_enum.h
+  __concepts/common_reference_with.h
+  __concepts/common_with.h
+  __concepts/constructible.h
+  __concepts/convertible_to.h
+  __concepts/copyable.h
+  __concepts/derived_from.h
+  __concepts/destructible.h
+  __concepts/different_from.h
+  __concepts/equality_comparable.h
+  __concepts/invocable.h
+  __concepts/movable.h
+  __concepts/predicate.h
+  __concepts/regular.h
+  __concepts/relation.h
+  __concepts/same_as.h
+  __concepts/semiregular.h
+  __concepts/swappable.h
+  __concepts/totally_ordered.h
+  __config
+  __coroutine/coroutine_handle.h
+  __coroutine/coroutine_traits.h
+  __coroutine/noop_coroutine_handle.h
+  __coroutine/trivial_awaitables.h
+  __debug
+  __debug_utils/randomize_range.h
+  __errc
+  __expected/bad_expected_access.h
+  __expected/expected.h
+  __expected/unexpect.h
+  __expected/unexpected.h
+  __filesystem/copy_options.h
+  __filesystem/directory_entry.h
+  __filesystem/directory_iterator.h
+  __filesystem/directory_options.h
+  __filesystem/file_status.h
+  __filesystem/file_time_type.h
+  __filesystem/file_type.h
+  __filesystem/filesystem_error.h
+  __filesystem/operations.h
+  __filesystem/path.h
+  __filesystem/path_iterator.h
+  __filesystem/perm_options.h
+  __filesystem/perms.h
+  __filesystem/recursive_directory_iterator.h
+  __filesystem/space_info.h
+  __filesystem/u8path.h
+  __format/buffer.h
+  __format/concepts.h
+  __format/container_adaptor.h
+  __format/enable_insertable.h
+  __format/escaped_output_table.h
+  __format/extended_grapheme_cluster_table.h
+  __format/format_arg.h
+  __format/format_arg_store.h
+  __format/format_args.h
+  __format/format_context.h
+  __format/format_error.h
+  __format/format_functions.h
+  __format/format_fwd.h
+  __format/format_parse_context.h
+  __format/format_string.h
+  __format/format_to_n_result.h
+  __format/formatter.h
+  __format/formatter_bool.h
+  __format/formatter_char.h
+  __format/formatter_floating_point.h
+  __format/formatter_integer.h
+  __format/formatter_integral.h
+  __format/formatter_output.h
+  __format/formatter_pointer.h
+  __format/formatter_string.h
+  __format/formatter_tuple.h
+  __format/parser_std_format_spec.h
+  __format/range_default_formatter.h
+  __format/range_formatter.h
+  __format/unicode.h
+  __functional/binary_function.h
+  __functional/binary_negate.h
+  __functional/bind.h
+  __functional/bind_back.h
+  __functional/bind_front.h
+  __functional/binder1st.h
+  __functional/binder2nd.h
+  __functional/boyer_moore_searcher.h
+  __functional/compose.h
+  __functional/default_searcher.h
+  __functional/function.h
+  __functional/hash.h
+  __functional/identity.h
+  __functional/invoke.h
+  __functional/is_transparent.h
+  __functional/mem_fn.h
+  __functional/mem_fun_ref.h
+  __functional/not_fn.h
+  __functional/operations.h
+  __functional/perfect_forward.h
+  __functional/pointer_to_binary_function.h
+  __functional/pointer_to_unary_function.h
+  __functional/ranges_operations.h
+  __functional/reference_wrapper.h
+  __functional/unary_function.h
+  __functional/unary_negate.h
+  __functional/unwrap_ref.h
+  __functional/weak_result_type.h
+  __fwd/array.h
+  __fwd/get.h
+  __fwd/hash.h
+  __fwd/memory_resource.h
+  __fwd/pair.h
+  __fwd/span.h
+  __fwd/string.h
+  __fwd/string_view.h
+  __fwd/subrange.h
+  __fwd/tuple.h
+  __hash_table
+  __ios/fpos.h
+  __iterator/access.h
+  __iterator/advance.h
+  __iterator/back_insert_iterator.h
+  __iterator/bounded_iter.h
+  __iterator/common_iterator.h
+  __iterator/concepts.h
+  __iterator/counted_iterator.h
+  __iterator/data.h
+  __iterator/default_sentinel.h
+  __iterator/distance.h
+  __iterator/empty.h
+  __iterator/erase_if_container.h
+  __iterator/front_insert_iterator.h
+  __iterator/incrementable_traits.h
+  __iterator/indirectly_comparable.h
+  __iterator/insert_iterator.h
+  __iterator/istream_iterator.h
+  __iterator/istreambuf_iterator.h
+  __iterator/iter_move.h
+  __iterator/iter_swap.h
+  __iterator/iterator.h
+  __iterator/iterator_traits.h
+  __iterator/iterator_with_data.h
+  __iterator/mergeable.h
+  __iterator/move_iterator.h
+  __iterator/move_sentinel.h
+  __iterator/next.h
+  __iterator/ostream_iterator.h
+  __iterator/ostreambuf_iterator.h
+  __iterator/permutable.h
+  __iterator/prev.h
+  __iterator/projected.h
+  __iterator/readable_traits.h
+  __iterator/reverse_access.h
+  __iterator/reverse_iterator.h
+  __iterator/segmented_iterator.h
+  __iterator/size.h
+  __iterator/sortable.h
+  __iterator/unreachable_sentinel.h
+  __iterator/wrap_iter.h
+  __locale
+  __mbstate_t.h
+  __memory/addressof.h
+  __memory/align.h
+  __memory/allocate_at_least.h
+  __memory/allocation_guard.h
+  __memory/allocator.h
+  __memory/allocator_arg_t.h
+  __memory/allocator_destructor.h
+  __memory/allocator_traits.h
+  __memory/assume_aligned.h
+  __memory/auto_ptr.h
+  __memory/builtin_new_allocator.h
+  __memory/compressed_pair.h
+  __memory/concepts.h
+  __memory/construct_at.h
+  __memory/destruct_n.h
+  __memory/pointer_traits.h
+  __memory/ranges_construct_at.h
+  __memory/ranges_uninitialized_algorithms.h
+  __memory/raw_storage_iterator.h
+  __memory/shared_ptr.h
+  __memory/swap_allocator.h
+  __memory/temp_value.h
+  __memory/temporary_buffer.h
+  __memory/uninitialized_algorithms.h
+  __memory/unique_ptr.h
+  __memory/uses_allocator.h
+  __memory/uses_allocator_construction.h
+  __memory/voidify.h
+  __memory_resource/memory_resource.h
+  __memory_resource/monotonic_buffer_resource.h
+  __memory_resource/polymorphic_allocator.h
+  __memory_resource/pool_options.h
+  __memory_resource/synchronized_pool_resource.h
+  __memory_resource/unsynchronized_pool_resource.h
+  __mutex_base
+  __node_handle
+  __numeric/accumulate.h
+  __numeric/adjacent_difference.h
+  __numeric/exclusive_scan.h
+  __numeric/gcd_lcm.h
+  __numeric/inclusive_scan.h
+  __numeric/inner_product.h
+  __numeric/iota.h
+  __numeric/midpoint.h
+  __numeric/partial_sum.h
+  __numeric/reduce.h
+  __numeric/transform_exclusive_scan.h
+  __numeric/transform_inclusive_scan.h
+  __numeric/transform_reduce.h
+  __random/bernoulli_distribution.h
+  __random/binomial_distribution.h
+  __random/cauchy_distribution.h
+  __random/chi_squared_distribution.h
+  __random/clamp_to_integral.h
+  __random/default_random_engine.h
+  __random/discard_block_engine.h
+  __random/discrete_distribution.h
+  __random/exponential_distribution.h
+  __random/extreme_value_distribution.h
+  __random/fisher_f_distribution.h
+  __random/gamma_distribution.h
+  __random/generate_canonical.h
+  __random/geometric_distribution.h
+  __random/independent_bits_engine.h
+  __random/is_seed_sequence.h
+  __random/is_valid.h
+  __random/knuth_b.h
+  __random/linear_congruential_engine.h
+  __random/log2.h
+  __random/lognormal_distribution.h
+  __random/mersenne_twister_engine.h
+  __random/negative_binomial_distribution.h
+  __random/normal_distribution.h
+  __random/piecewise_constant_distribution.h
+  __random/piecewise_linear_distribution.h
+  __random/poisson_distribution.h
+  __random/random_device.h
+  __random/ranlux.h
+  __random/seed_seq.h
+  __random/shuffle_order_engine.h
+  __random/student_t_distribution.h
+  __random/subtract_with_carry_engine.h
+  __random/uniform_int_distribution.h
+  __random/uniform_random_bit_generator.h
+  __random/uniform_real_distribution.h
+  __random/weibull_distribution.h
+  __ranges/access.h
+  __ranges/all.h
+  __ranges/as_rvalue_view.h
+  __ranges/common_view.h
+  __ranges/concepts.h
+  __ranges/copyable_box.h
+  __ranges/counted.h
+  __ranges/dangling.h
+  __ranges/data.h
+  __ranges/drop_view.h
+  __ranges/drop_while_view.h
+  __ranges/elements_view.h
+  __ranges/empty.h
+  __ranges/empty_view.h
+  __ranges/enable_borrowed_range.h
+  __ranges/enable_view.h
+  __ranges/filter_view.h
+  __ranges/iota_view.h
+  __ranges/istream_view.h
+  __ranges/join_view.h
+  __ranges/lazy_split_view.h
+  __ranges/non_propagating_cache.h
+  __ranges/owning_view.h
+  __ranges/range_adaptor.h
+  __ranges/rbegin.h
+  __ranges/ref_view.h
+  __ranges/rend.h
+  __ranges/reverse_view.h
+  __ranges/single_view.h
+  __ranges/size.h
+  __ranges/split_view.h
+  __ranges/subrange.h
+  __ranges/take_view.h
+  __ranges/take_while_view.h
+  __ranges/transform_view.h
+  __ranges/view_interface.h
+  __ranges/views.h
+  __ranges/zip_view.h
+  __split_buffer
+  __std_stream
+  __string/char_traits.h
+  __string/extern_template_lists.h
+  __support/android/locale_bionic.h
+  __support/fuchsia/xlocale.h
+  __support/ibm/gettod_zos.h
+  __support/ibm/locale_mgmt_zos.h
+  __support/ibm/nanosleep.h
+  __support/ibm/xlocale.h
+  __support/musl/xlocale.h
+  __support/newlib/xlocale.h
+  __support/openbsd/xlocale.h
+  __support/solaris/floatingpoint.h
+  __support/solaris/wchar.h
+  __support/solaris/xlocale.h
+  __support/win32/locale_win32.h
+  __support/xlocale/__nop_locale_mgmt.h
+  __support/xlocale/__posix_l_fallback.h
+  __support/xlocale/__strtonum_fallback.h
+  __thread/poll_with_backoff.h
+  __thread/timed_backoff_policy.h
+  __threading_support
+  __tree
+  __tuple_dir/apply_cv.h
+  __tuple_dir/make_tuple_types.h
+  __tuple_dir/pair_like.h
+  __tuple_dir/sfinae_helpers.h
+  __tuple_dir/tuple_element.h
+  __tuple_dir/tuple_indices.h
+  __tuple_dir/tuple_like.h
+  __tuple_dir/tuple_like_ext.h
+  __tuple_dir/tuple_size.h
+  __tuple_dir/tuple_types.h
+  __type_traits/add_const.h
+  __type_traits/add_cv.h
+  __type_traits/add_lvalue_reference.h
+  __type_traits/add_pointer.h
+  __type_traits/add_rvalue_reference.h
+  __type_traits/add_volatile.h
+  __type_traits/aligned_storage.h
+  __type_traits/aligned_union.h
+  __type_traits/alignment_of.h
+  __type_traits/apply_cv.h
+  __type_traits/can_extract_key.h
+  __type_traits/common_reference.h
+  __type_traits/common_type.h
+  __type_traits/conditional.h
+  __type_traits/conjunction.h
+  __type_traits/copy_cv.h
+  __type_traits/copy_cvref.h
+  __type_traits/decay.h
+  __type_traits/dependent_type.h
+  __type_traits/disjunction.h
+  __type_traits/enable_if.h
+  __type_traits/extent.h
+  __type_traits/has_unique_object_representation.h
+  __type_traits/has_virtual_destructor.h
+  __type_traits/integral_constant.h
+  __type_traits/is_abstract.h
+  __type_traits/is_aggregate.h
+  __type_traits/is_allocator.h
+  __type_traits/is_always_bitcastable.h
+  __type_traits/is_arithmetic.h
+  __type_traits/is_array.h
+  __type_traits/is_assignable.h
+  __type_traits/is_base_of.h
+  __type_traits/is_bounded_array.h
+  __type_traits/is_callable.h
+  __type_traits/is_char_like_type.h
+  __type_traits/is_class.h
+  __type_traits/is_compound.h
+  __type_traits/is_const.h
+  __type_traits/is_constant_evaluated.h
+  __type_traits/is_constructible.h
+  __type_traits/is_convertible.h
+  __type_traits/is_copy_assignable.h
+  __type_traits/is_copy_constructible.h
+  __type_traits/is_core_convertible.h
+  __type_traits/is_default_constructible.h
+  __type_traits/is_destructible.h
+  __type_traits/is_empty.h
+  __type_traits/is_enum.h
+  __type_traits/is_final.h
+  __type_traits/is_floating_point.h
+  __type_traits/is_function.h
+  __type_traits/is_fundamental.h
+  __type_traits/is_implicitly_default_constructible.h
+  __type_traits/is_integral.h
+  __type_traits/is_literal_type.h
+  __type_traits/is_member_function_pointer.h
+  __type_traits/is_member_object_pointer.h
+  __type_traits/is_member_pointer.h
+  __type_traits/is_move_assignable.h
+  __type_traits/is_move_constructible.h
+  __type_traits/is_nothrow_assignable.h
+  __type_traits/is_nothrow_constructible.h
+  __type_traits/is_nothrow_convertible.h
+  __type_traits/is_nothrow_copy_assignable.h
+  __type_traits/is_nothrow_copy_constructible.h
+  __type_traits/is_nothrow_default_constructible.h
+  __type_traits/is_nothrow_destructible.h
+  __type_traits/is_nothrow_move_assignable.h
+  __type_traits/is_nothrow_move_constructible.h
+  __type_traits/is_null_pointer.h
+  __type_traits/is_object.h
+  __type_traits/is_pod.h
+  __type_traits/is_pointer.h
+  __type_traits/is_polymorphic.h
+  __type_traits/is_primary_template.h
+  __type_traits/is_reference.h
+  __type_traits/is_reference_wrapper.h
+  __type_traits/is_referenceable.h
+  __type_traits/is_same.h
+  __type_traits/is_scalar.h
+  __type_traits/is_scoped_enum.h
+  __type_traits/is_signed.h
+  __type_traits/is_signed_integer.h
+  __type_traits/is_specialization.h
+  __type_traits/is_standard_layout.h
+  __type_traits/is_swappable.h
+  __type_traits/is_trivial.h
+  __type_traits/is_trivially_assignable.h
+  __type_traits/is_trivially_constructible.h
+  __type_traits/is_trivially_copy_assignable.h
+  __type_traits/is_trivially_copy_constructible.h
+  __type_traits/is_trivially_copyable.h
+  __type_traits/is_trivially_default_constructible.h
+  __type_traits/is_trivially_destructible.h
+  __type_traits/is_trivially_move_assignable.h
+  __type_traits/is_trivially_move_constructible.h
+  __type_traits/is_unbounded_array.h
+  __type_traits/is_union.h
+  __type_traits/is_unsigned.h
+  __type_traits/is_unsigned_integer.h
+  __type_traits/is_valid_expansion.h
+  __type_traits/is_void.h
+  __type_traits/is_volatile.h
+  __type_traits/lazy.h
+  __type_traits/make_32_64_or_128_bit.h
+  __type_traits/make_const_lvalue_ref.h
+  __type_traits/make_signed.h
+  __type_traits/make_unsigned.h
+  __type_traits/maybe_const.h
+  __type_traits/nat.h
+  __type_traits/negation.h
+  __type_traits/noexcept_move_assign_container.h
+  __type_traits/promote.h
+  __type_traits/rank.h
+  __type_traits/remove_all_extents.h
+  __type_traits/remove_const.h
+  __type_traits/remove_const_ref.h
+  __type_traits/remove_cv.h
+  __type_traits/remove_cvref.h
+  __type_traits/remove_extent.h
+  __type_traits/remove_pointer.h
+  __type_traits/remove_reference.h
+  __type_traits/remove_volatile.h
+  __type_traits/result_of.h
+  __type_traits/strip_signature.h
+  __type_traits/type_identity.h
+  __type_traits/type_list.h
+  __type_traits/underlying_type.h
+  __type_traits/void_t.h
+  __undef_macros
+  __utility/as_const.h
+  __utility/auto_cast.h
+  __utility/cmp.h
+  __utility/convert_to_integral.h
+  __utility/declval.h
+  __utility/exception_guard.h
+  __utility/exchange.h
+  __utility/forward.h
+  __utility/forward_like.h
+  __utility/in_place.h
+  __utility/integer_sequence.h
+  __utility/move.h
+  __utility/pair.h
+  __utility/piecewise_construct.h
+  __utility/priority_tag.h
+  __utility/rel_ops.h
+  __utility/swap.h
+  __utility/to_underlying.h
+  __utility/unreachable.h
+  __variant/monostate.h
+  __verbose_abort
+  algorithm
+  any
+  array
+  atomic
+  barrier
+  bit
+  bitset
+  cassert
+  ccomplex
+  cctype
+  cerrno
+  cfenv
+  cfloat
+  charconv
+  chrono
+  cinttypes
+  ciso646
+  climits
+  clocale
+  cmath
+  codecvt
+  compare
+  complex
+  complex.h
+  concepts
+  condition_variable
+  coroutine
+  csetjmp
+  csignal
+  cstdarg
+  cstdbool
+  cstddef
+  cstdint
+  cstdio
+  cstdlib
+  cstring
+  ctgmath
+  ctime
+  ctype.h
+  cuchar
+  cwchar
+  cwctype
+  deque
+  errno.h
+  exception
+  execution
+  expected
+  experimental/__config
+  experimental/__memory
+  experimental/algorithm
+  experimental/coroutine
+  experimental/deque
+  experimental/forward_list
+  experimental/functional
+  experimental/iterator
+  experimental/list
+  experimental/map
+  experimental/memory_resource
+  experimental/propagate_const
+  experimental/regex
+  experimental/set
+  experimental/simd
+  experimental/string
+  experimental/type_traits
+  experimental/unordered_map
+  experimental/unordered_set
+  experimental/utility
+  experimental/vector
+  ext/__hash
+  ext/hash_map
+  ext/hash_set
+  fenv.h
+  filesystem
+  float.h
+  format
+  forward_list
+  fstream
+  functional
+  future
+  initializer_list
+  inttypes.h
+  iomanip
+  ios
+  iosfwd
+  iostream
+  istream
+  iterator
+  latch
+  libcxx.imp
+  limits
+  limits.h
+  list
+  locale
+  locale.h
+  map
+  math.h
+  memory
+  memory_resource
+  mutex
+  new
+  numbers
+  numeric
+  optional
+  ostream
+  queue
+  random
+  ranges
+  ratio
+  regex
+  scoped_allocator
+  semaphore
+  set
+  setjmp.h
+  shared_mutex
+  source_location
+  span
+  sstream
+  stack
+  stdatomic.h
+  stdbool.h
+  stddef.h
+  stdexcept
+  stdint.h
+  stdio.h
+  stdlib.h
+  streambuf
+  string
+  string.h
+  string_view
+  strstream
+  system_error
+  tgmath.h
+  thread
+  tuple
+  type_traits
+  typeindex
+  typeinfo
+  uchar.h
+  unordered_map
+  unordered_set
+  utility
+  valarray
+  variant
+  vector
+  version
+  wchar.h
+  wctype.h
+  )
+
+foreach(feature LIBCXX_ENABLE_FILESYSTEM LIBCXX_ENABLE_LOCALIZATION LIBCXX_ENABLE_FSTREAM LIBCXX_ENABLE_THREADS LIBCXX_ENABLE_WIDE_CHARACTERS)
+  if (NOT ${${feature}})
+    set(requires_${feature} "requires LIBCXX_CONFIGURED_WITHOUT_SUPPORT_FOR_THIS_HEADER")
+  endif()
+endforeach()
+
+configure_file("__config_site.in" "${LIBCXX_GENERATED_INCLUDE_TARGET_DIR}/__config_site" @ONLY)
+configure_file("module.modulemap.in" "${LIBCXX_GENERATED_INCLUDE_DIR}/module.modulemap" @ONLY)
+
+set(_all_includes "${LIBCXX_GENERATED_INCLUDE_TARGET_DIR}/__config_site"
+                  "${LIBCXX_GENERATED_INCLUDE_DIR}/module.modulemap")
+foreach(f ${files})
+  set(src "${CMAKE_CURRENT_SOURCE_DIR}/${f}")
+  set(dst "${LIBCXX_GENERATED_INCLUDE_DIR}/${f}")
+  add_custom_command(OUTPUT ${dst}
+    DEPENDS ${src}
+    COMMAND ${CMAKE_COMMAND} -E copy_if_different ${src} ${dst}
+    COMMENT "Copying CXX header ${f}")
+  list(APPEND _all_includes "${dst}")
+endforeach()
+
+add_custom_target(generate-cxx-headers ALL DEPENDS ${_all_includes})
+
+add_library(cxx-headers INTERFACE)
+target_link_libraries(cxx-headers INTERFACE libcxx-abi-headers)
+add_dependencies(cxx-headers generate-cxx-headers)
+target_include_directories(cxx-headers INTERFACE ${LIBCXX_GENERATED_INCLUDE_DIR}
+                                                 ${LIBCXX_GENERATED_INCLUDE_TARGET_DIR})
+
+if (LIBCXX_INSTALL_HEADERS)
+  foreach(file ${files})
+    get_filename_component(dir ${file} DIRECTORY)
+    install(FILES ${file}
+      DESTINATION "${LIBCXX_INSTALL_INCLUDE_DIR}/${dir}"
+      COMPONENT cxx-headers
+      PERMISSIONS OWNER_READ OWNER_WRITE GROUP_READ WORLD_READ
+    )
+  endforeach()
+
+  # Install the generated __config_site file to the per-target include dir.
+  install(FILES "${LIBCXX_GENERATED_INCLUDE_TARGET_DIR}/__config_site"
+    DESTINATION "${LIBCXX_INSTALL_INCLUDE_TARGET_DIR}"
+    PERMISSIONS OWNER_READ OWNER_WRITE GROUP_READ WORLD_READ
+    COMPONENT cxx-headers)
+
+  # Install the generated modulemap file to the generic include dir.
+  install(FILES "${LIBCXX_GENERATED_INCLUDE_DIR}/module.modulemap"
+    DESTINATION "${LIBCXX_INSTALL_INCLUDE_DIR}"
+    PERMISSIONS OWNER_READ OWNER_WRITE GROUP_READ WORLD_READ
+    COMPONENT cxx-headers)
+
+  if (NOT CMAKE_CONFIGURATION_TYPES)
+    add_custom_target(install-cxx-headers
+                      DEPENDS cxx-headers
+                      COMMAND "${CMAKE_COMMAND}"
+                              -DCMAKE_INSTALL_COMPONENT=cxx-headers
+                              -P "${CMAKE_BINARY_DIR}/cmake_install.cmake")
+    # Stripping is a no-op for headers
+    add_custom_target(install-cxx-headers-stripped DEPENDS install-cxx-headers)
+  endif()
+endif()
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/adjacent_find.h b/app/src/main/cpp/libcxx/include/__algorithm/adjacent_find.h
new file mode 100644
index 0000000..30df4a9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/adjacent_find.h
@@ -0,0 +1,53 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_ADJACENT_FIND_H
+#define _LIBCPP___ALGORITHM_ADJACENT_FIND_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Iter, class _Sent, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Iter
+__adjacent_find(_Iter __first, _Sent __last, _BinaryPredicate&& __pred) {
+  if (__first == __last)
+    return __first;
+  _Iter __i = __first;
+  while (++__i != __last) {
+    if (__pred(*__first, *__i))
+      return __first;
+    __first = __i;
+  }
+  return __i;
+}
+
+template <class _ForwardIterator, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) {
+  return std::__adjacent_find(std::move(__first), std::move(__last), __pred);
+}
+
+template <class _ForwardIterator>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+adjacent_find(_ForwardIterator __first, _ForwardIterator __last) {
+  return std::adjacent_find(std::move(__first), std::move(__last), __equal_to());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_ADJACENT_FIND_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/all_of.h b/app/src/main/cpp/libcxx/include/__algorithm/all_of.h
new file mode 100644
index 0000000..284c34f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/all_of.h
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_ALL_OF_H
+#define _LIBCPP___ALGORITHM_ALL_OF_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _Predicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) {
+  for (; __first != __last; ++__first)
+    if (!__pred(*__first))
+      return false;
+  return true;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_ALL_OF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/any_of.h b/app/src/main/cpp/libcxx/include/__algorithm/any_of.h
new file mode 100644
index 0000000..fe08828
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/any_of.h
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_ANY_OF_H
+#define _LIBCPP___ALGORITHM_ANY_OF_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _Predicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) {
+  for (; __first != __last; ++__first)
+    if (__pred(*__first))
+      return true;
+  return false;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_ANY_OF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/binary_search.h b/app/src/main/cpp/libcxx/include/__algorithm/binary_search.h
new file mode 100644
index 0000000..8f958c2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/binary_search.h
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_BINARY_SEARCH_H
+#define _LIBCPP___ALGORITHM_BINARY_SEARCH_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/lower_bound.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _ForwardIterator, class _Tp, class _Compare>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp)
+{
+    __first = std::lower_bound<_ForwardIterator, _Tp, __comp_ref_type<_Compare> >(__first, __last, __value, __comp);
+    return __first != __last && !__comp(__value, *__first);
+}
+
+template <class _ForwardIterator, class _Tp>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)
+{
+    return std::binary_search(__first, __last, __value,
+                              __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_BINARY_SEARCH_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/clamp.h b/app/src/main/cpp/libcxx/include/__algorithm/clamp.h
new file mode 100644
index 0000000..30ddbdc
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/clamp.h
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_CLAMP_H
+#define _LIBCPP___ALGORITHM_CLAMP_H
+
+#include <__algorithm/comp.h>
+#include <__assert>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+template<class _Tp, class _Compare>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY constexpr
+const _Tp&
+clamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp)
+{
+    _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp");
+    return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v;
+
+}
+
+template<class _Tp>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY constexpr
+const _Tp&
+clamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi)
+{
+    return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>());
+}
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_CLAMP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/comp.h b/app/src/main/cpp/libcxx/include/__algorithm/comp.h
new file mode 100644
index 0000000..af8eb7b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/comp.h
@@ -0,0 +1,66 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_COMP_H
+#define _LIBCPP___ALGORITHM_COMP_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+struct __equal_to {
+  template <class _T1, class _T2>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 bool operator()(const _T1& __x, const _T2& __y) const {
+    return __x == __y;
+  }
+};
+
+template <class _T1, class _T2 = _T1>
+struct __less
+{
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;}
+};
+
+template <class _T1>
+struct __less<_T1, _T1>
+{
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;}
+};
+
+template <class _T1>
+struct __less<const _T1, _T1>
+{
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;}
+};
+
+template <class _T1>
+struct __less<_T1, const _T1>
+{
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;}
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_COMP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/comp_ref_type.h b/app/src/main/cpp/libcxx/include/__algorithm/comp_ref_type.h
new file mode 100644
index 0000000..f2338e1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/comp_ref_type.h
@@ -0,0 +1,79 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_COMP_REF_TYPE_H
+#define _LIBCPP___ALGORITHM_COMP_REF_TYPE_H
+
+#include <__config>
+#include <__debug>
+#include <__utility/declval.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Compare>
+struct __debug_less
+{
+    _Compare &__comp_;
+    _LIBCPP_CONSTEXPR_SINCE_CXX14
+    __debug_less(_Compare& __c) : __comp_(__c) {}
+
+    template <class _Tp, class _Up>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(const _Tp& __x,  const _Up& __y)
+    {
+        bool __r = __comp_(__x, __y);
+        if (__r)
+            __do_compare_assert(0, __y, __x);
+        return __r;
+    }
+
+    template <class _Tp, class _Up>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(_Tp& __x,  _Up& __y)
+    {
+        bool __r = __comp_(__x, __y);
+        if (__r)
+            __do_compare_assert(0, __y, __x);
+        return __r;
+    }
+
+    template <class _LHS, class _RHS>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14
+    inline _LIBCPP_INLINE_VISIBILITY
+    decltype((void)std::declval<_Compare&>()(
+        std::declval<_LHS &>(), std::declval<_RHS &>()))
+    __do_compare_assert(int, _LHS & __l, _RHS & __r) {
+        _LIBCPP_DEBUG_ASSERT(!__comp_(__l, __r),
+            "Comparator does not induce a strict weak ordering");
+        (void)__l;
+        (void)__r;
+    }
+
+    template <class _LHS, class _RHS>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14
+    inline _LIBCPP_INLINE_VISIBILITY
+    void __do_compare_assert(long, _LHS &, _RHS &) {}
+};
+
+// Pass the comparator by lvalue reference. Or in debug mode, using a
+// debugging wrapper that stores a reference.
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+template <class _Comp>
+using __comp_ref_type = __debug_less<_Comp>;
+#else
+template <class _Comp>
+using __comp_ref_type = _Comp&;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_COMP_REF_TYPE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/copy.h b/app/src/main/cpp/libcxx/include/__algorithm/copy.h
new file mode 100644
index 0000000..193a6df
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/copy.h
@@ -0,0 +1,126 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_COPY_H
+#define _LIBCPP___ALGORITHM_COPY_H
+
+#include <__algorithm/copy_move_common.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/min.h>
+#include <__config>
+#include <__iterator/segmented_iterator.h>
+#include <__type_traits/common_type.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class, class _InIter, class _Sent, class _OutIter>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter> __copy(_InIter, _Sent, _OutIter);
+
+template <class _AlgPolicy>
+struct __copy_loop {
+  template <class _InIter, class _Sent, class _OutIter>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+  operator()(_InIter __first, _Sent __last, _OutIter __result) const {
+    while (__first != __last) {
+      *__result = *__first;
+      ++__first;
+      ++__result;
+    }
+
+    return std::make_pair(std::move(__first), std::move(__result));
+  }
+
+  template <class _InIter, class _OutIter, __enable_if_t<__is_segmented_iterator<_InIter>::value, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+  operator()(_InIter __first, _InIter __last, _OutIter __result) const {
+    using _Traits = __segmented_iterator_traits<_InIter>;
+    auto __sfirst = _Traits::__segment(__first);
+    auto __slast  = _Traits::__segment(__last);
+    if (__sfirst == __slast) {
+      auto __iters = std::__copy<_AlgPolicy>(_Traits::__local(__first), _Traits::__local(__last), std::move(__result));
+      return std::make_pair(__last, std::move(__iters.second));
+    }
+
+    __result = std::__copy<_AlgPolicy>(_Traits::__local(__first), _Traits::__end(__sfirst), std::move(__result)).second;
+    ++__sfirst;
+    while (__sfirst != __slast) {
+      __result =
+          std::__copy<_AlgPolicy>(_Traits::__begin(__sfirst), _Traits::__end(__sfirst), std::move(__result)).second;
+      ++__sfirst;
+    }
+    __result =
+        std::__copy<_AlgPolicy>(_Traits::__begin(__sfirst), _Traits::__local(__last), std::move(__result)).second;
+    return std::make_pair(__last, std::move(__result));
+  }
+
+  template <class _InIter,
+            class _OutIter,
+            __enable_if_t<__is_cpp17_random_access_iterator<_InIter>::value &&
+                              !__is_segmented_iterator<_InIter>::value && __is_segmented_iterator<_OutIter>::value,
+                          int> = 0>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+  operator()(_InIter __first, _InIter __last, _OutIter __result) {
+    using _Traits = __segmented_iterator_traits<_OutIter>;
+    using _DiffT  = typename common_type<__iter_diff_t<_InIter>, __iter_diff_t<_OutIter> >::type;
+
+    if (__first == __last)
+      return std::make_pair(std::move(__first), std::move(__result));
+
+    auto __local_first      = _Traits::__local(__result);
+    auto __segment_iterator = _Traits::__segment(__result);
+    while (true) {
+      auto __local_last = _Traits::__end(__segment_iterator);
+      auto __size       = std::min<_DiffT>(__local_last - __local_first, __last - __first);
+      auto __iters      = std::__copy<_AlgPolicy>(__first, __first + __size, __local_first);
+      __first           = std::move(__iters.first);
+
+      if (__first == __last)
+        return std::make_pair(std::move(__first), _Traits::__compose(__segment_iterator, std::move(__iters.second)));
+
+      __local_first = _Traits::__begin(++__segment_iterator);
+    }
+  }
+};
+
+struct __copy_trivial {
+  // At this point, the iterators have been unwrapped so any `contiguous_iterator` has been unwrapped to a pointer.
+  template <class _In, class _Out,
+            __enable_if_t<__can_lower_copy_assignment_to_memmove<_In, _Out>::value, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_In*, _Out*>
+  operator()(_In* __first, _In* __last, _Out* __result) const {
+    return std::__copy_trivial_impl(__first, __last, __result);
+  }
+};
+
+template <class _AlgPolicy, class _InIter, class _Sent, class _OutIter>
+pair<_InIter, _OutIter> inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+__copy(_InIter __first, _Sent __last, _OutIter __result) {
+  return std::__dispatch_copy_or_move<_AlgPolicy, __copy_loop<_AlgPolicy>, __copy_trivial>(
+      std::move(__first), std::move(__last), std::move(__result));
+}
+
+template <class _InputIterator, class _OutputIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator
+copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) {
+  return std::__copy<_ClassicAlgPolicy>(__first, __last, __result).second;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___ALGORITHM_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/copy_backward.h b/app/src/main/cpp/libcxx/include/__algorithm/copy_backward.h
new file mode 100644
index 0000000..bb2a432
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/copy_backward.h
@@ -0,0 +1,143 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_COPY_BACKWARD_H
+#define _LIBCPP___ALGORITHM_COPY_BACKWARD_H
+
+#include <__algorithm/copy_move_common.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/min.h>
+#include <__config>
+#include <__iterator/segmented_iterator.h>
+#include <__type_traits/common_type.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _InIter, class _Sent, class _OutIter>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_InIter, _OutIter>
+__copy_backward(_InIter __first, _Sent __last, _OutIter __result);
+
+template <class _AlgPolicy>
+struct __copy_backward_loop {
+  template <class _InIter, class _Sent, class _OutIter>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+  operator()(_InIter __first, _Sent __last, _OutIter __result) const {
+    auto __last_iter          = _IterOps<_AlgPolicy>::next(__first, __last);
+    auto __original_last_iter = __last_iter;
+
+    while (__first != __last_iter) {
+      *--__result = *--__last_iter;
+    }
+
+    return std::make_pair(std::move(__original_last_iter), std::move(__result));
+  }
+
+  template <class _InIter, class _OutIter, __enable_if_t<__is_segmented_iterator<_InIter>::value, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+  operator()(_InIter __first, _InIter __last, _OutIter __result) const {
+    using _Traits = __segmented_iterator_traits<_InIter>;
+    auto __sfirst = _Traits::__segment(__first);
+    auto __slast  = _Traits::__segment(__last);
+    if (__sfirst == __slast) {
+      auto __iters =
+          std::__copy_backward<_AlgPolicy>(_Traits::__local(__first), _Traits::__local(__last), std::move(__result));
+      return std::make_pair(__last, __iters.second);
+    }
+
+    __result =
+        std::__copy_backward<_AlgPolicy>(_Traits::__begin(__slast), _Traits::__local(__last), std::move(__result))
+            .second;
+    --__slast;
+    while (__sfirst != __slast) {
+      __result =
+          std::__copy_backward<_AlgPolicy>(_Traits::__begin(__slast), _Traits::__end(__slast), std::move(__result))
+              .second;
+      --__slast;
+    }
+    __result = std::__copy_backward<_AlgPolicy>(_Traits::__local(__first), _Traits::__end(__slast), std::move(__result))
+                   .second;
+    return std::make_pair(__last, std::move(__result));
+  }
+
+  template <class _InIter,
+            class _OutIter,
+            __enable_if_t<__is_cpp17_random_access_iterator<_InIter>::value &&
+                              !__is_segmented_iterator<_InIter>::value && __is_segmented_iterator<_OutIter>::value,
+                          int> = 0>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+  operator()(_InIter __first, _InIter __last, _OutIter __result) {
+    using _Traits           = __segmented_iterator_traits<_OutIter>;
+    auto __orig_last        = __last;
+    auto __segment_iterator = _Traits::__segment(__result);
+
+    // When the range contains no elements, __result might not be a valid iterator
+    if (__first == __last)
+      return std::make_pair(__first, __result);
+
+    auto __local_last = _Traits::__local(__result);
+    while (true) {
+      using _DiffT = typename common_type<__iter_diff_t<_InIter>, __iter_diff_t<_OutIter> >::type;
+
+      auto __local_first = _Traits::__begin(__segment_iterator);
+      auto __size        = std::min<_DiffT>(__local_last - __local_first, __last - __first);
+      auto __iter        = std::__copy_backward<_AlgPolicy>(__last - __size, __last, __local_last).second;
+      __last -= __size;
+
+      if (__first == __last)
+        return std::make_pair(std::move(__orig_last), _Traits::__compose(__segment_iterator, std::move(__iter)));
+      --__segment_iterator;
+      __local_last = _Traits::__end(__segment_iterator);
+    }
+  }
+};
+
+struct __copy_backward_trivial {
+  // At this point, the iterators have been unwrapped so any `contiguous_iterator` has been unwrapped to a pointer.
+  template <class _In, class _Out,
+            __enable_if_t<__can_lower_copy_assignment_to_memmove<_In, _Out>::value, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_In*, _Out*>
+  operator()(_In* __first, _In* __last, _Out* __result) const {
+    return std::__copy_backward_trivial_impl(__first, __last, __result);
+  }
+};
+
+template <class _AlgPolicy, class _BidirectionalIterator1, class _Sentinel, class _BidirectionalIterator2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_BidirectionalIterator1, _BidirectionalIterator2>
+__copy_backward(_BidirectionalIterator1 __first, _Sentinel __last, _BidirectionalIterator2 __result) {
+  return std::__dispatch_copy_or_move<_AlgPolicy, __copy_backward_loop<_AlgPolicy>, __copy_backward_trivial>(
+      std::move(__first), std::move(__last), std::move(__result));
+}
+
+template <class _BidirectionalIterator1, class _BidirectionalIterator2>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_BidirectionalIterator2
+copy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last,
+              _BidirectionalIterator2 __result)
+{
+  static_assert(std::is_copy_constructible<_BidirectionalIterator1>::value &&
+                std::is_copy_constructible<_BidirectionalIterator1>::value, "Iterators must be copy constructible.");
+
+  return std::__copy_backward<_ClassicAlgPolicy>(
+      std::move(__first), std::move(__last), std::move(__result)).second;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___ALGORITHM_COPY_BACKWARD_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/copy_if.h b/app/src/main/cpp/libcxx/include/__algorithm/copy_if.h
new file mode 100644
index 0000000..a5938b8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/copy_if.h
@@ -0,0 +1,39 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_COPY_IF_H
+#define _LIBCPP___ALGORITHM_COPY_IF_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _InputIterator, class _OutputIterator, class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+copy_if(_InputIterator __first, _InputIterator __last,
+        _OutputIterator __result, _Predicate __pred)
+{
+    for (; __first != __last; ++__first)
+    {
+        if (__pred(*__first))
+        {
+            *__result = *__first;
+            ++__result;
+        }
+    }
+    return __result;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_COPY_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/copy_move_common.h b/app/src/main/cpp/libcxx/include/__algorithm/copy_move_common.h
new file mode 100644
index 0000000..b88c149
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/copy_move_common.h
@@ -0,0 +1,163 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_COPY_MOVE_COMMON_H
+#define _LIBCPP___ALGORITHM_COPY_MOVE_COMMON_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/unwrap_iter.h>
+#include <__algorithm/unwrap_range.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__memory/pointer_traits.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_always_bitcastable.h>
+#include <__type_traits/is_constant_evaluated.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__type_traits/is_trivially_assignable.h>
+#include <__type_traits/is_trivially_copyable.h>
+#include <__type_traits/is_volatile.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Type traits.
+
+template <class _From, class _To>
+struct __can_lower_copy_assignment_to_memmove {
+  static const bool value =
+    // If the types are always bitcastable, it's valid to do a bitwise copy between them.
+    __is_always_bitcastable<_From, _To>::value &&
+    // Reject conversions that wouldn't be performed by the regular built-in assignment (e.g. between arrays).
+    is_trivially_assignable<_To&, const _From&>::value &&
+    // `memmove` doesn't accept `volatile` pointers, make sure the optimization SFINAEs away in that case.
+    !is_volatile<_From>::value &&
+    !is_volatile<_To>::value;
+};
+
+template <class _From, class _To>
+struct __can_lower_move_assignment_to_memmove {
+  static const bool value =
+    __is_always_bitcastable<_From, _To>::value &&
+    is_trivially_assignable<_To&, _From&&>::value &&
+    !is_volatile<_From>::value &&
+    !is_volatile<_To>::value;
+};
+
+// `memmove` algorithms implementation.
+
+template <class _In, class _Out>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_In*, _Out*>
+__copy_trivial_impl(_In* __first, _In* __last, _Out* __result) {
+  const size_t __n = static_cast<size_t>(__last - __first);
+  ::__builtin_memmove(__result, __first, __n * sizeof(_Out));
+
+  return std::make_pair(__last, __result + __n);
+}
+
+template <class _In, class _Out>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_In*, _Out*>
+__copy_backward_trivial_impl(_In* __first, _In* __last, _Out* __result) {
+  const size_t __n = static_cast<size_t>(__last - __first);
+  __result -= __n;
+
+  ::__builtin_memmove(__result, __first, __n * sizeof(_Out));
+
+  return std::make_pair(__last, __result);
+}
+
+// Iterator unwrapping and dispatching to the correct overload.
+
+template <class _F1, class _F2>
+struct __overload : _F1, _F2 {
+  using _F1::operator();
+  using _F2::operator();
+};
+
+template <class _InIter, class _Sent, class _OutIter, class = void>
+struct __can_rewrap : false_type {};
+
+template <class _InIter, class _Sent, class _OutIter>
+struct __can_rewrap<_InIter,
+                    _Sent,
+                    _OutIter,
+                    // Note that sentinels are always copy-constructible.
+                    __enable_if_t< is_copy_constructible<_InIter>::value &&
+                                   is_copy_constructible<_OutIter>::value > > : true_type {};
+
+template <class _Algorithm,
+          class _InIter,
+          class _Sent,
+          class _OutIter,
+          __enable_if_t<__can_rewrap<_InIter, _Sent, _OutIter>::value, int> = 0>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 pair<_InIter, _OutIter>
+__unwrap_and_dispatch(_InIter __first, _Sent __last, _OutIter __out_first) {
+  auto __range  = std::__unwrap_range(__first, std::move(__last));
+  auto __result = _Algorithm()(std::move(__range.first), std::move(__range.second), std::__unwrap_iter(__out_first));
+  return std::make_pair(std::__rewrap_range<_Sent>(std::move(__first), std::move(__result.first)),
+                                 std::__rewrap_iter(std::move(__out_first), std::move(__result.second)));
+}
+
+template <class _Algorithm,
+          class _InIter,
+          class _Sent,
+          class _OutIter,
+          __enable_if_t<!__can_rewrap<_InIter, _Sent, _OutIter>::value, int> = 0>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 pair<_InIter, _OutIter>
+__unwrap_and_dispatch(_InIter __first, _Sent __last, _OutIter __out_first) {
+  return _Algorithm()(std::move(__first), std::move(__last), std::move(__out_first));
+}
+
+template <class _IterOps, class _InValue, class _OutIter, class = void>
+struct __can_copy_without_conversion : false_type {};
+
+template <class _IterOps, class _InValue, class _OutIter>
+struct __can_copy_without_conversion<
+    _IterOps,
+    _InValue,
+    _OutIter,
+    __enable_if_t<is_same<_InValue, typename _IterOps::template __value_type<_OutIter> >::value> > : true_type {};
+
+template <class _AlgPolicy,
+          class _NaiveAlgorithm,
+          class _OptimizedAlgorithm,
+          class _InIter,
+          class _Sent,
+          class _OutIter>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 pair<_InIter, _OutIter>
+__dispatch_copy_or_move(_InIter __first, _Sent __last, _OutIter __out_first) {
+#ifdef _LIBCPP_COMPILER_GCC
+  // GCC doesn't support `__builtin_memmove` during constant evaluation.
+  if (__libcpp_is_constant_evaluated()) {
+    return std::__unwrap_and_dispatch<_NaiveAlgorithm>(std::move(__first), std::move(__last), std::move(__out_first));
+  }
+#else
+  // In Clang, `__builtin_memmove` only supports fully trivially copyable types (just having trivial copy assignment is
+  // insufficient). Also, conversions are not supported.
+  if (__libcpp_is_constant_evaluated()) {
+    using _InValue = typename _IterOps<_AlgPolicy>::template __value_type<_InIter>;
+    if (!is_trivially_copyable<_InValue>::value ||
+        !__can_copy_without_conversion<_IterOps<_AlgPolicy>, _InValue, _OutIter>::value) {
+      return std::__unwrap_and_dispatch<_NaiveAlgorithm>(std::move(__first), std::move(__last), std::move(__out_first));
+    }
+  }
+#endif // _LIBCPP_COMPILER_GCC
+
+  using _Algorithm = __overload<_NaiveAlgorithm, _OptimizedAlgorithm>;
+  return std::__unwrap_and_dispatch<_Algorithm>(std::move(__first), std::move(__last), std::move(__out_first));
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_COPY_MOVE_COMMON_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/copy_n.h b/app/src/main/cpp/libcxx/include/__algorithm/copy_n.h
new file mode 100644
index 0000000..b08bbdf
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/copy_n.h
@@ -0,0 +1,67 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_COPY_N_H
+#define _LIBCPP___ALGORITHM_COPY_N_H
+
+#include <__algorithm/copy.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/convert_to_integral.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _InputIterator, class _Size, class _OutputIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename enable_if
+<
+    __is_cpp17_input_iterator<_InputIterator>::value &&
+   !__is_cpp17_random_access_iterator<_InputIterator>::value,
+    _OutputIterator
+>::type
+copy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result)
+{
+    typedef decltype(_VSTD::__convert_to_integral(__orig_n)) _IntegralSize;
+    _IntegralSize __n = __orig_n;
+    if (__n > 0)
+    {
+        *__result = *__first;
+        ++__result;
+        for (--__n; __n > 0; --__n)
+        {
+            ++__first;
+            *__result = *__first;
+            ++__result;
+        }
+    }
+    return __result;
+}
+
+template<class _InputIterator, class _Size, class _OutputIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename enable_if
+<
+    __is_cpp17_random_access_iterator<_InputIterator>::value,
+    _OutputIterator
+>::type
+copy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result)
+{
+    typedef typename iterator_traits<_InputIterator>::difference_type difference_type;
+    typedef decltype(_VSTD::__convert_to_integral(__orig_n)) _IntegralSize;
+    _IntegralSize __n = __orig_n;
+    return _VSTD::copy(__first, __first + difference_type(__n), __result);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_COPY_N_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/count.h b/app/src/main/cpp/libcxx/include/__algorithm/count.h
new file mode 100644
index 0000000..6c8c7fd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/count.h
@@ -0,0 +1,35 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_COUNT_H
+#define _LIBCPP___ALGORITHM_COUNT_H
+
+#include <__config>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _Tp>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    typename iterator_traits<_InputIterator>::difference_type
+    count(_InputIterator __first, _InputIterator __last, const _Tp& __value) {
+  typename iterator_traits<_InputIterator>::difference_type __r(0);
+  for (; __first != __last; ++__first)
+    if (*__first == __value)
+      ++__r;
+  return __r;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_COUNT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/count_if.h b/app/src/main/cpp/libcxx/include/__algorithm/count_if.h
new file mode 100644
index 0000000..b96521f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/count_if.h
@@ -0,0 +1,35 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_COUNT_IF_H
+#define _LIBCPP___ALGORITHM_COUNT_IF_H
+
+#include <__config>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _Predicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    typename iterator_traits<_InputIterator>::difference_type
+    count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) {
+  typename iterator_traits<_InputIterator>::difference_type __r(0);
+  for (; __first != __last; ++__first)
+    if (__pred(*__first))
+      ++__r;
+  return __r;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_COUNT_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/equal.h b/app/src/main/cpp/libcxx/include/__algorithm/equal.h
new file mode 100644
index 0000000..cf37f46
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/equal.h
@@ -0,0 +1,86 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_EQUAL_H
+#define _LIBCPP___ALGORITHM_EQUAL_H
+
+#include <__algorithm/comp.h>
+#include <__config>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) {
+  for (; __first1 != __last1; ++__first1, (void)++__first2)
+    if (!__pred(*__first1, *__first2))
+      return false;
+  return true;
+}
+
+template <class _InputIterator1, class _InputIterator2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) {
+  return std::equal(__first1, __last1, __first2, __equal_to());
+}
+
+#if _LIBCPP_STD_VER > 11
+template <class _BinaryPredicate, class _InputIterator1, class _InputIterator2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+__equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2,
+        _BinaryPredicate __pred, input_iterator_tag, input_iterator_tag) {
+  for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2)
+    if (!__pred(*__first1, *__first2))
+      return false;
+  return __first1 == __last1 && __first2 == __last2;
+}
+
+template <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
+        _RandomAccessIterator2 __last2, _BinaryPredicate __pred, random_access_iterator_tag,
+        random_access_iterator_tag) {
+  if (_VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2))
+    return false;
+  return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2,
+                      _BinaryPredicate&>(__first1, __last1, __first2, __pred);
+}
+
+template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2,
+      _BinaryPredicate __pred) {
+  return _VSTD::__equal<_BinaryPredicate&>(
+      __first1, __last1, __first2, __last2, __pred, typename iterator_traits<_InputIterator1>::iterator_category(),
+      typename iterator_traits<_InputIterator2>::iterator_category());
+}
+
+template <class _InputIterator1, class _InputIterator2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) {
+  return std::__equal(
+      __first1,
+      __last1,
+      __first2,
+      __last2,
+      __equal_to(),
+      typename iterator_traits<_InputIterator1>::iterator_category(),
+      typename iterator_traits<_InputIterator2>::iterator_category());
+}
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_EQUAL_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/equal_range.h b/app/src/main/cpp/libcxx/include/__algorithm/equal_range.h
new file mode 100644
index 0000000..2075b03
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/equal_range.h
@@ -0,0 +1,87 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_EQUAL_RANGE_H
+#define _LIBCPP___ALGORITHM_EQUAL_RANGE_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/half_positive.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/lower_bound.h>
+#include <__algorithm/upper_bound.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/advance.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__type_traits/is_callable.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Compare, class _Iter, class _Sent, class _Tp, class _Proj>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_Iter, _Iter>
+__equal_range(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) {
+  auto __len  = _IterOps<_AlgPolicy>::distance(__first, __last);
+  _Iter __end = _IterOps<_AlgPolicy>::next(__first, __last);
+  while (__len != 0) {
+    auto __half_len = std::__half_positive(__len);
+    _Iter __mid     = _IterOps<_AlgPolicy>::next(__first, __half_len);
+    if (std::__invoke(__comp, std::__invoke(__proj, *__mid), __value)) {
+      __first = ++__mid;
+      __len -= __half_len + 1;
+    } else if (std::__invoke(__comp, __value, std::__invoke(__proj, *__mid))) {
+      __end = __mid;
+      __len = __half_len;
+    } else {
+      _Iter __mp1 = __mid;
+      return pair<_Iter, _Iter>(
+          std::__lower_bound_impl<_AlgPolicy>(__first, __mid, __value, __comp, __proj),
+          std::__upper_bound<_AlgPolicy>(++__mp1, __end, __value, __comp, __proj));
+    }
+  }
+  return pair<_Iter, _Iter>(__first, __first);
+}
+
+template <class _ForwardIterator, class _Tp, class _Compare>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_ForwardIterator, _ForwardIterator>
+equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) {
+  static_assert(__is_callable<_Compare, decltype(*__first), const _Tp&>::value,
+                "The comparator has to be callable");
+  static_assert(is_copy_constructible<_ForwardIterator>::value,
+                "Iterator has to be copy constructible");
+  return std::__equal_range<_ClassicAlgPolicy>(
+      std::move(__first),
+      std::move(__last),
+      __value,
+      static_cast<__comp_ref_type<_Compare> >(__comp),
+      std::__identity());
+}
+
+template <class _ForwardIterator, class _Tp>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_ForwardIterator, _ForwardIterator>
+equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) {
+  return std::equal_range(
+      std::move(__first),
+      std::move(__last),
+      __value,
+      __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_EQUAL_RANGE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/fill.h b/app/src/main/cpp/libcxx/include/__algorithm/fill.h
new file mode 100644
index 0000000..76cf4a1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/fill.h
@@ -0,0 +1,52 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_FILL_H
+#define _LIBCPP___ALGORITHM_FILL_H
+
+#include <__algorithm/fill_n.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// fill isn't specialized for std::memset, because the compiler already optimizes the loop to a call to std::memset.
+
+template <class _ForwardIterator, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, forward_iterator_tag)
+{
+    for (; __first != __last; ++__first)
+        *__first = __value;
+}
+
+template <class _RandomAccessIterator, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value, random_access_iterator_tag)
+{
+    _VSTD::fill_n(__first, __last - __first, __value);
+}
+
+template <class _ForwardIterator, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)
+{
+    _VSTD::__fill(__first, __last, __value, typename iterator_traits<_ForwardIterator>::iterator_category());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_FILL_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/fill_n.h b/app/src/main/cpp/libcxx/include/__algorithm/fill_n.h
new file mode 100644
index 0000000..fe58c8d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/fill_n.h
@@ -0,0 +1,45 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_FILL_N_H
+#define _LIBCPP___ALGORITHM_FILL_N_H
+
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/convert_to_integral.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// fill_n isn't specialized for std::memset, because the compiler already optimizes the loop to a call to std::memset.
+
+template <class _OutputIterator, class _Size, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)
+{
+    for (; __n > 0; ++__first, (void) --__n)
+        *__first = __value;
+    return __first;
+}
+
+template <class _OutputIterator, class _Size, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)
+{
+   return _VSTD::__fill_n(__first, _VSTD::__convert_to_integral(__n), __value);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_FILL_N_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/find.h b/app/src/main/cpp/libcxx/include/__algorithm/find.h
new file mode 100644
index 0000000..e51dc9b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/find.h
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_FIND_H
+#define _LIBCPP___ALGORITHM_FIND_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _Tp>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _InputIterator
+find(_InputIterator __first, _InputIterator __last, const _Tp& __value) {
+  for (; __first != __last; ++__first)
+    if (*__first == __value)
+      break;
+  return __first;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_FIND_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/find_end.h b/app/src/main/cpp/libcxx/include/__algorithm/find_end.h
new file mode 100644
index 0000000..e2fee6b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/find_end.h
@@ -0,0 +1,227 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_FIND_END_OF_H
+#define _LIBCPP___ALGORITHM_FIND_END_OF_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/search.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__iterator/advance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/reverse_iterator.h>
+#include <__utility/pair.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <
+    class _AlgPolicy,
+    class _Iter1,
+    class _Sent1,
+    class _Iter2,
+    class _Sent2,
+    class _Pred,
+    class _Proj1,
+    class _Proj2>
+_LIBCPP_HIDE_FROM_ABI inline _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_Iter1, _Iter1> __find_end_impl(
+    _Iter1 __first1,
+    _Sent1 __last1,
+    _Iter2 __first2,
+    _Sent2 __last2,
+    _Pred& __pred,
+    _Proj1& __proj1,
+    _Proj2& __proj2,
+    forward_iterator_tag,
+    forward_iterator_tag) {
+  // modeled after search algorithm
+  _Iter1 __match_first = _IterOps<_AlgPolicy>::next(__first1, __last1); // __last1 is the "default" answer
+  _Iter1 __match_last = __match_first;
+  if (__first2 == __last2)
+    return pair<_Iter1, _Iter1>(__match_last, __match_last);
+  while (true) {
+    while (true) {
+      if (__first1 == __last1) // if source exhausted return last correct answer (or __last1 if never found)
+        return pair<_Iter1, _Iter1>(__match_first, __match_last);
+      if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2)))
+        break;
+      ++__first1;
+    }
+    // *__first1 matches *__first2, now match elements after here
+    _Iter1 __m1 = __first1;
+    _Iter2 __m2 = __first2;
+    while (true) {
+      if (++__m2 == __last2) { // Pattern exhaused, record answer and search for another one
+        __match_first = __first1;
+        __match_last = ++__m1;
+        ++__first1;
+        break;
+      }
+      if (++__m1 == __last1) // Source exhausted, return last answer
+        return pair<_Iter1, _Iter1>(__match_first, __match_last);
+       // mismatch, restart with a new __first
+      if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2)))
+      {
+        ++__first1;
+        break;
+      } // else there is a match, check next elements
+    }
+  }
+}
+
+template <
+    class _IterOps,
+    class _Pred,
+    class _Iter1,
+    class _Sent1,
+    class _Iter2,
+    class _Sent2,
+    class _Proj1,
+    class _Proj2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Iter1 __find_end(
+    _Iter1 __first1,
+    _Sent1 __sent1,
+    _Iter2 __first2,
+    _Sent2 __sent2,
+    _Pred& __pred,
+    _Proj1& __proj1,
+    _Proj2& __proj2,
+    bidirectional_iterator_tag,
+    bidirectional_iterator_tag) {
+  auto __last1 = _IterOps::next(__first1, __sent1);
+  auto __last2 = _IterOps::next(__first2, __sent2);
+  // modeled after search algorithm (in reverse)
+  if (__first2 == __last2)
+    return __last1; // Everything matches an empty sequence
+  _Iter1 __l1 = __last1;
+  _Iter2 __l2 = __last2;
+  --__l2;
+  while (true) {
+    // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks
+    while (true) {
+      if (__first1 == __l1) // return __last1 if no element matches *__first2
+        return __last1;
+      if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2)))
+        break;
+    }
+    // *__l1 matches *__l2, now match elements before here
+    _Iter1 __m1 = __l1;
+    _Iter2 __m2 = __l2;
+    while (true) {
+      if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
+        return __m1;
+      if (__m1 == __first1) // Otherwise if source exhaused, pattern not found
+        return __last1;
+
+      // if there is a mismatch, restart with a new __l1
+      if (!std::__invoke(__pred, std::__invoke(__proj1, *--__m1), std::__invoke(__proj2, *--__m2)))
+      {
+        break;
+      } // else there is a match, check next elements
+    }
+  }
+}
+
+template <
+    class _AlgPolicy,
+    class _Pred,
+    class _Iter1,
+    class _Sent1,
+    class _Iter2,
+    class _Sent2,
+    class _Proj1,
+    class _Proj2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Iter1 __find_end(
+    _Iter1 __first1,
+    _Sent1 __sent1,
+    _Iter2 __first2,
+    _Sent2 __sent2,
+    _Pred& __pred,
+    _Proj1& __proj1,
+    _Proj2& __proj2,
+    random_access_iterator_tag,
+    random_access_iterator_tag) {
+  typedef typename iterator_traits<_Iter1>::difference_type _D1;
+  auto __last1 = _IterOps<_AlgPolicy>::next(__first1, __sent1);
+  auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __sent2);
+  // Take advantage of knowing source and pattern lengths.  Stop short when source is smaller than pattern
+  auto __len2 = __last2 - __first2;
+  if (__len2 == 0)
+    return __last1;
+  auto __len1 = __last1 - __first1;
+  if (__len1 < __len2)
+    return __last1;
+  const _Iter1 __s = __first1 + _D1(__len2 - 1); // End of pattern match can't go before here
+  _Iter1 __l1 = __last1;
+  _Iter2 __l2 = __last2;
+  --__l2;
+  while (true) {
+    while (true) {
+      if (__s == __l1)
+        return __last1;
+      if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2)))
+        break;
+    }
+    _Iter1 __m1 = __l1;
+    _Iter2 __m2 = __l2;
+    while (true) {
+      if (__m2 == __first2)
+        return __m1;
+      // no need to check range on __m1 because __s guarantees we have enough source
+      if (!std::__invoke(__pred, std::__invoke(__proj1, *--__m1), std::__invoke(*--__m2))) {
+        break;
+      }
+    }
+  }
+}
+
+template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
+_LIBCPP_NODISCARD inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+_ForwardIterator1 __find_end_classic(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
+                                     _ForwardIterator2 __first2, _ForwardIterator2 __last2,
+                                     _BinaryPredicate& __pred) {
+  auto __proj = __identity();
+  return std::__find_end_impl<_ClassicAlgPolicy>(
+             __first1,
+             __last1,
+             __first2,
+             __last2,
+             __pred,
+             __proj,
+             __proj,
+             typename iterator_traits<_ForwardIterator1>::iterator_category(),
+             typename iterator_traits<_ForwardIterator2>::iterator_category())
+      .first;
+}
+
+template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_ForwardIterator1 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
+                           _ForwardIterator2 __first2, _ForwardIterator2 __last2,
+                           _BinaryPredicate __pred) {
+  return std::__find_end_classic(__first1, __last1, __first2, __last2, __pred);
+}
+
+template <class _ForwardIterator1, class _ForwardIterator2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_ForwardIterator1 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
+                           _ForwardIterator2 __first2, _ForwardIterator2 __last2) {
+  return std::find_end(__first1, __last1, __first2, __last2, __equal_to());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_FIND_END_OF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/find_first_of.h b/app/src/main/cpp/libcxx/include/__algorithm/find_first_of.h
new file mode 100644
index 0000000..12f0109
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/find_first_of.h
@@ -0,0 +1,52 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_FIND_FIRST_OF_H
+#define _LIBCPP___ALGORITHM_FIND_FIRST_OF_H
+
+#include <__algorithm/comp.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _ForwardIterator1 __find_first_of_ce(_ForwardIterator1 __first1,
+                                                                   _ForwardIterator1 __last1,
+                                                                   _ForwardIterator2 __first2,
+                                                                   _ForwardIterator2 __last2,
+                                                                   _BinaryPredicate&& __pred) {
+  for (; __first1 != __last1; ++__first1)
+    for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
+      if (__pred(*__first1, *__j))
+        return __first1;
+  return __last1;
+}
+
+template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator1
+find_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
+              _ForwardIterator2 __last2, _BinaryPredicate __pred) {
+  return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred);
+}
+
+template <class _ForwardIterator1, class _ForwardIterator2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator1 find_first_of(
+    _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) {
+  return std::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_FIND_FIRST_OF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/find_if.h b/app/src/main/cpp/libcxx/include/__algorithm/find_if.h
new file mode 100644
index 0000000..f4ef3ac
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/find_if.h
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_FIND_IF_H
+#define _LIBCPP___ALGORITHM_FIND_IF_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _Predicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _InputIterator
+find_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) {
+  for (; __first != __last; ++__first)
+    if (__pred(*__first))
+      break;
+  return __first;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_FIND_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/find_if_not.h b/app/src/main/cpp/libcxx/include/__algorithm/find_if_not.h
new file mode 100644
index 0000000..96c159c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/find_if_not.h
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_FIND_IF_NOT_H
+#define _LIBCPP___ALGORITHM_FIND_IF_NOT_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _Predicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _InputIterator
+find_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) {
+  for (; __first != __last; ++__first)
+    if (!__pred(*__first))
+      break;
+  return __first;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_FIND_IF_NOT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/for_each.h b/app/src/main/cpp/libcxx/include/__algorithm/for_each.h
new file mode 100644
index 0000000..6564f31
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/for_each.h
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_FOR_EACH_H
+#define _LIBCPP___ALGORITHM_FOR_EACH_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _Function>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _Function for_each(_InputIterator __first,
+                                                                                  _InputIterator __last,
+                                                                                  _Function __f) {
+  for (; __first != __last; ++__first)
+    __f(*__first);
+  return __f;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_FOR_EACH_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/for_each_n.h b/app/src/main/cpp/libcxx/include/__algorithm/for_each_n.h
new file mode 100644
index 0000000..38d204a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/for_each_n.h
@@ -0,0 +1,43 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_FOR_EACH_N_H
+#define _LIBCPP___ALGORITHM_FOR_EACH_N_H
+
+#include <__config>
+#include <__utility/convert_to_integral.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _InputIterator, class _Size, class _Function>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _InputIterator for_each_n(_InputIterator __first,
+                                                                                         _Size __orig_n,
+                                                                                         _Function __f) {
+  typedef decltype(_VSTD::__convert_to_integral(__orig_n)) _IntegralSize;
+  _IntegralSize __n = __orig_n;
+  while (__n > 0) {
+    __f(*__first);
+    ++__first;
+    --__n;
+  }
+  return __first;
+}
+
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_FOR_EACH_N_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/generate.h b/app/src/main/cpp/libcxx/include/__algorithm/generate.h
new file mode 100644
index 0000000..48e21b5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/generate.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_GENERATE_H
+#define _LIBCPP___ALGORITHM_GENERATE_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _ForwardIterator, class _Generator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+generate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen)
+{
+    for (; __first != __last; ++__first)
+        *__first = __gen();
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_GENERATE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/generate_n.h b/app/src/main/cpp/libcxx/include/__algorithm/generate_n.h
new file mode 100644
index 0000000..4525998
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/generate_n.h
@@ -0,0 +1,36 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_GENERATE_N_H
+#define _LIBCPP___ALGORITHM_GENERATE_N_H
+
+#include <__config>
+#include <__utility/convert_to_integral.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _OutputIterator, class _Size, class _Generator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+generate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen)
+{
+    typedef decltype(_VSTD::__convert_to_integral(__orig_n)) _IntegralSize;
+    _IntegralSize __n = __orig_n;
+    for (; __n > 0; ++__first, (void) --__n)
+        *__first = __gen();
+    return __first;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_GENERATE_N_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/half_positive.h b/app/src/main/cpp/libcxx/include/__algorithm/half_positive.h
new file mode 100644
index 0000000..74aede2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/half_positive.h
@@ -0,0 +1,49 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_HALF_POSITIVE_H
+#define _LIBCPP___ALGORITHM_HALF_POSITIVE_H
+
+#include <__config>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Perform division by two quickly for positive integers (llvm.org/PR39129)
+
+template <typename _Integral>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+typename enable_if
+<
+    is_integral<_Integral>::value,
+    _Integral
+>::type
+__half_positive(_Integral __value)
+{
+    return static_cast<_Integral>(static_cast<__make_unsigned_t<_Integral> >(__value) / 2);
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+typename enable_if
+<
+    !is_integral<_Tp>::value,
+    _Tp
+>::type
+__half_positive(_Tp __value)
+{
+    return __value / 2;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_HALF_POSITIVE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/in_found_result.h b/app/src/main/cpp/libcxx/include/__algorithm/in_found_result.h
new file mode 100644
index 0000000..3134d6e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/in_found_result.h
@@ -0,0 +1,49 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_IN_FOUND_RESULT_H
+#define _LIBCPP___ALGORITHM_IN_FOUND_RESULT_H
+
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+template <class _InIter1>
+struct in_found_result {
+  _LIBCPP_NO_UNIQUE_ADDRESS _InIter1 in;
+  bool found;
+
+  template <class _InIter2>
+    requires convertible_to<const _InIter1&, _InIter2>
+  _LIBCPP_HIDE_FROM_ABI constexpr operator in_found_result<_InIter2>() const & {
+    return {in, found};
+  }
+
+  template <class _InIter2>
+    requires convertible_to<_InIter1, _InIter2>
+  _LIBCPP_HIDE_FROM_ABI constexpr operator in_found_result<_InIter2>() && {
+    return {std::move(in), found};
+  }
+};
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_IN_FOUND_RESULT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/in_fun_result.h b/app/src/main/cpp/libcxx/include/__algorithm/in_fun_result.h
new file mode 100644
index 0000000..3cbb9e1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/in_fun_result.h
@@ -0,0 +1,49 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_IN_FUN_RESULT_H
+#define _LIBCPP___ALGORITHM_IN_FUN_RESULT_H
+
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+template <class _InIter1, class _Func1>
+struct in_fun_result {
+  _LIBCPP_NO_UNIQUE_ADDRESS _InIter1 in;
+  _LIBCPP_NO_UNIQUE_ADDRESS _Func1 fun;
+
+  template <class _InIter2, class _Func2>
+    requires convertible_to<const _InIter1&, _InIter2> && convertible_to<const _Func1&, _Func2>
+  _LIBCPP_HIDE_FROM_ABI constexpr operator in_fun_result<_InIter2, _Func2>() const & {
+    return {in, fun};
+  }
+
+  template <class _InIter2, class _Func2>
+    requires convertible_to<_InIter1, _InIter2> && convertible_to<_Func1, _Func2>
+  _LIBCPP_HIDE_FROM_ABI constexpr operator in_fun_result<_InIter2, _Func2>() && {
+    return {std::move(in), std::move(fun)};
+  }
+};
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_IN_FUN_RESULT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/in_in_out_result.h b/app/src/main/cpp/libcxx/include/__algorithm/in_in_out_result.h
new file mode 100644
index 0000000..3e747be
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/in_in_out_result.h
@@ -0,0 +1,56 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_IN_IN_OUT_RESULT_H
+#define _LIBCPP___ALGORITHM_IN_IN_OUT_RESULT_H
+
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+template <class _InIter1, class _InIter2, class _OutIter1>
+struct in_in_out_result {
+  _LIBCPP_NO_UNIQUE_ADDRESS _InIter1 in1;
+  _LIBCPP_NO_UNIQUE_ADDRESS _InIter2 in2;
+  _LIBCPP_NO_UNIQUE_ADDRESS _OutIter1 out;
+
+  template <class _InIter3, class _InIter4, class _OutIter2>
+    requires convertible_to<const _InIter1&, _InIter3>
+          && convertible_to<const _InIter2&, _InIter4> && convertible_to<const _OutIter1&, _OutIter2>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  operator in_in_out_result<_InIter3, _InIter4, _OutIter2>() const& {
+    return {in1, in2, out};
+  }
+
+  template <class _InIter3, class _InIter4, class _OutIter2>
+    requires convertible_to<_InIter1, _InIter3>
+          && convertible_to<_InIter2, _InIter4> && convertible_to<_OutIter1, _OutIter2>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  operator in_in_out_result<_InIter3, _InIter4, _OutIter2>() && {
+    return {std::move(in1), std::move(in2), std::move(out)};
+  }
+};
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_IN_IN_OUT_RESULT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/in_in_result.h b/app/src/main/cpp/libcxx/include/__algorithm/in_in_result.h
new file mode 100644
index 0000000..2098c18
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/in_in_result.h
@@ -0,0 +1,53 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_IN_IN_RESULT_H
+#define _LIBCPP___ALGORITHM_IN_IN_RESULT_H
+
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+template <class _InIter1, class _InIter2>
+struct in_in_result {
+  _LIBCPP_NO_UNIQUE_ADDRESS _InIter1 in1;
+  _LIBCPP_NO_UNIQUE_ADDRESS _InIter2 in2;
+
+  template <class _InIter3, class _InIter4>
+    requires convertible_to<const _InIter1&, _InIter3> && convertible_to<const _InIter2&, _InIter4>
+   _LIBCPP_HIDE_FROM_ABI constexpr
+   operator in_in_result<_InIter3, _InIter4>() const & {
+    return {in1, in2};
+  }
+
+  template <class _InIter3, class _InIter4>
+    requires convertible_to<_InIter1, _InIter3> && convertible_to<_InIter2, _InIter4>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  operator in_in_result<_InIter3, _InIter4>() && {
+    return {std::move(in1), std::move(in2)};
+  }
+};
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_IN_IN_RESULT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/in_out_out_result.h b/app/src/main/cpp/libcxx/include/__algorithm/in_out_out_result.h
new file mode 100644
index 0000000..4046eee
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/in_out_out_result.h
@@ -0,0 +1,54 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_IN_OUT_OUT_RESULT_H
+#define _LIBCPP___ALGORITHM_IN_OUT_OUT_RESULT_H
+
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+template <class _InIter1, class _OutIter1, class _OutIter2>
+struct in_out_out_result {
+  _LIBCPP_NO_UNIQUE_ADDRESS _InIter1 in;
+  _LIBCPP_NO_UNIQUE_ADDRESS _OutIter1 out1;
+  _LIBCPP_NO_UNIQUE_ADDRESS _OutIter2 out2;
+
+  template <class _InIter2, class _OutIter3, class _OutIter4>
+    requires convertible_to<const _InIter1&, _InIter2>
+          && convertible_to<const _OutIter1&, _OutIter3> && convertible_to<const _OutIter2&, _OutIter4>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  operator in_out_out_result<_InIter2, _OutIter3, _OutIter4>() const& {
+    return {in, out1, out2};
+  }
+
+  template <class _InIter2, class _OutIter3, class _OutIter4>
+    requires convertible_to<_InIter1, _InIter2>
+          && convertible_to<_OutIter1, _OutIter3> && convertible_to<_OutIter2, _OutIter4>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  operator in_out_out_result<_InIter2, _OutIter3, _OutIter4>() && {
+    return {std::move(in), std::move(out1), std::move(out2)};
+  }
+};
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_IN_OUT_OUT_RESULT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/in_out_result.h b/app/src/main/cpp/libcxx/include/__algorithm/in_out_result.h
new file mode 100644
index 0000000..7f5a027
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/in_out_result.h
@@ -0,0 +1,53 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_IN_OUT_RESULT_H
+#define _LIBCPP___ALGORITHM_IN_OUT_RESULT_H
+
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+template<class _InIter1, class _OutIter1>
+struct in_out_result {
+  _LIBCPP_NO_UNIQUE_ADDRESS _InIter1 in;
+  _LIBCPP_NO_UNIQUE_ADDRESS _OutIter1 out;
+
+  template <class _InIter2, class _OutIter2>
+    requires convertible_to<const _InIter1&, _InIter2> && convertible_to<const _OutIter1&, _OutIter2>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr operator in_out_result<_InIter2, _OutIter2>() const & {
+    return {in, out};
+  }
+
+  template <class _InIter2, class _OutIter2>
+    requires convertible_to<_InIter1, _InIter2> && convertible_to<_OutIter1, _OutIter2>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr operator in_out_result<_InIter2, _OutIter2>() && {
+    return {std::move(in), std::move(out)};
+  }
+};
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_IN_OUT_RESULT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/includes.h b/app/src/main/cpp/libcxx/include/__algorithm/includes.h
new file mode 100644
index 0000000..cc39f27
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/includes.h
@@ -0,0 +1,75 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_INCLUDES_H
+#define _LIBCPP___ALGORITHM_INCLUDES_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/is_callable.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Comp, class _Proj1, class _Proj2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+__includes(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2,
+           _Comp&& __comp, _Proj1&& __proj1, _Proj2&& __proj2) {
+  for (; __first2 != __last2; ++__first1) {
+    if (__first1 == __last1 || std::__invoke(
+          __comp, std::__invoke(__proj2, *__first2), std::__invoke(__proj1, *__first1)))
+      return false;
+    if (!std::__invoke(__comp, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2)))
+      ++__first2;
+  }
+  return true;
+}
+
+template <class _InputIterator1, class _InputIterator2, class _Compare>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool includes(
+    _InputIterator1 __first1,
+    _InputIterator1 __last1,
+    _InputIterator2 __first2,
+    _InputIterator2 __last2,
+    _Compare __comp) {
+  static_assert(__is_callable<_Compare, decltype(*__first1), decltype(*__first2)>::value,
+      "Comparator has to be callable");
+
+  return std::__includes(
+      std::move(__first1),
+      std::move(__last1),
+      std::move(__first2),
+      std::move(__last2),
+      static_cast<__comp_ref_type<_Compare> >(__comp),
+      __identity(),
+      __identity());
+}
+
+template <class _InputIterator1, class _InputIterator2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) {
+  return std::includes(
+      std::move(__first1),
+      std::move(__last1),
+      std::move(__first2),
+      std::move(__last2),
+      __less<typename iterator_traits<_InputIterator1>::value_type,
+             typename iterator_traits<_InputIterator2>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_INCLUDES_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/inplace_merge.h b/app/src/main/cpp/libcxx/include/__algorithm/inplace_merge.h
new file mode 100644
index 0000000..5bbefc9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/inplace_merge.h
@@ -0,0 +1,257 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_INPLACE_MERGE_H
+#define _LIBCPP___ALGORITHM_INPLACE_MERGE_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/lower_bound.h>
+#include <__algorithm/min.h>
+#include <__algorithm/move.h>
+#include <__algorithm/rotate.h>
+#include <__algorithm/upper_bound.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__iterator/advance.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/reverse_iterator.h>
+#include <__memory/destruct_n.h>
+#include <__memory/temporary_buffer.h>
+#include <__memory/unique_ptr.h>
+#include <__utility/pair.h>
+#include <new>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Predicate>
+class __invert // invert the sense of a comparison
+{
+private:
+    _Predicate __p_;
+public:
+    _LIBCPP_INLINE_VISIBILITY __invert() {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __invert(_Predicate __p) : __p_(__p) {}
+
+    template <class _T1>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _T1& __x) {return !__p_(__x);}
+
+    template <class _T1, class _T2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _T1& __x, const _T2& __y) {return __p_(__y, __x);}
+};
+
+template <class _AlgPolicy, class _Compare, class _InputIterator1, class _Sent1,
+          class _InputIterator2, class _Sent2, class _OutputIterator>
+_LIBCPP_HIDE_FROM_ABI
+void __half_inplace_merge(_InputIterator1 __first1, _Sent1 __last1,
+                          _InputIterator2 __first2, _Sent2 __last2,
+                          _OutputIterator __result, _Compare&& __comp)
+{
+    for (; __first1 != __last1; ++__result)
+    {
+        if (__first2 == __last2)
+        {
+            std::__move<_AlgPolicy>(__first1, __last1, __result);
+            return;
+        }
+
+        if (__comp(*__first2, *__first1))
+        {
+            *__result = _IterOps<_AlgPolicy>::__iter_move(__first2);
+            ++__first2;
+        }
+        else
+        {
+            *__result = _IterOps<_AlgPolicy>::__iter_move(__first1);
+            ++__first1;
+        }
+    }
+    // __first2 through __last2 are already in the right spot.
+}
+
+template <class _AlgPolicy, class _Compare, class _BidirectionalIterator>
+_LIBCPP_HIDE_FROM_ABI
+void __buffered_inplace_merge(
+    _BidirectionalIterator __first,
+    _BidirectionalIterator __middle,
+    _BidirectionalIterator __last,
+    _Compare&& __comp,
+    typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
+    typename iterator_traits<_BidirectionalIterator>::difference_type __len2,
+    typename iterator_traits<_BidirectionalIterator>::value_type* __buff) {
+  typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
+    __destruct_n __d(0);
+    unique_ptr<value_type, __destruct_n&> __h2(__buff, __d);
+    if (__len1 <= __len2)
+    {
+        value_type* __p = __buff;
+        for (_BidirectionalIterator __i = __first; __i != __middle; __d.template __incr<value_type>(), (void) ++__i, (void) ++__p)
+            ::new ((void*)__p) value_type(_IterOps<_AlgPolicy>::__iter_move(__i));
+        std::__half_inplace_merge<_AlgPolicy>(__buff, __p, __middle, __last, __first, __comp);
+    }
+    else
+    {
+        value_type* __p = __buff;
+        for (_BidirectionalIterator __i = __middle; __i != __last; __d.template __incr<value_type>(), (void) ++__i, (void) ++__p)
+            ::new ((void*)__p) value_type(_IterOps<_AlgPolicy>::__iter_move(__i));
+        typedef __unconstrained_reverse_iterator<_BidirectionalIterator> _RBi;
+        typedef __unconstrained_reverse_iterator<value_type*> _Rv;
+        typedef __invert<_Compare> _Inverted;
+        std::__half_inplace_merge<_AlgPolicy>(_Rv(__p), _Rv(__buff),
+                                    _RBi(__middle), _RBi(__first),
+                                    _RBi(__last), _Inverted(__comp));
+    }
+}
+
+template <class _AlgPolicy, class _Compare, class _BidirectionalIterator>
+void __inplace_merge(
+    _BidirectionalIterator __first,
+    _BidirectionalIterator __middle,
+    _BidirectionalIterator __last,
+    _Compare&& __comp,
+    typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
+    typename iterator_traits<_BidirectionalIterator>::difference_type __len2,
+    typename iterator_traits<_BidirectionalIterator>::value_type* __buff,
+    ptrdiff_t __buff_size) {
+    using _Ops = _IterOps<_AlgPolicy>;
+
+    typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type;
+    while (true)
+    {
+        // if __middle == __last, we're done
+        if (__len2 == 0)
+            return;
+        if (__len1 <= __buff_size || __len2 <= __buff_size)
+            return std::__buffered_inplace_merge<_AlgPolicy>
+                   (__first, __middle, __last, __comp, __len1, __len2, __buff);
+        // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0
+        for (; true; ++__first, (void) --__len1)
+        {
+            if (__len1 == 0)
+                return;
+            if (__comp(*__middle, *__first))
+                break;
+        }
+        // __first < __middle < __last
+        // *__first > *__middle
+        // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that
+        //     all elements in:
+        //         [__first, __m1)  <= [__middle, __m2)
+        //         [__middle, __m2) <  [__m1, __middle)
+        //         [__m1, __middle) <= [__m2, __last)
+        //     and __m1 or __m2 is in the middle of its range
+        _BidirectionalIterator __m1;  // "median" of [__first, __middle)
+        _BidirectionalIterator __m2;  // "median" of [__middle, __last)
+        difference_type __len11;      // distance(__first, __m1)
+        difference_type __len21;      // distance(__middle, __m2)
+        // binary search smaller range
+        if (__len1 < __len2)
+        {   // __len >= 1, __len2 >= 2
+            __len21 = __len2 / 2;
+            __m2 = __middle;
+            _Ops::advance(__m2, __len21);
+            __m1 = std::__upper_bound<_AlgPolicy>(__first, __middle, *__m2, __comp, std::__identity());
+            __len11 = _Ops::distance(__first, __m1);
+        }
+        else
+        {
+            if (__len1 == 1)
+            {   // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1
+                // It is known *__first > *__middle
+              _Ops::iter_swap(__first, __middle);
+                return;
+            }
+            // __len1 >= 2, __len2 >= 1
+            __len11 = __len1 / 2;
+            __m1 = __first;
+            _Ops::advance(__m1, __len11);
+            __m2 = std::lower_bound(__middle, __last, *__m1, __comp);
+            __len21 = _Ops::distance(__middle, __m2);
+        }
+        difference_type __len12 = __len1 - __len11;  // distance(__m1, __middle)
+        difference_type __len22 = __len2 - __len21;  // distance(__m2, __last)
+        // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last)
+        // swap middle two partitions
+        __middle = std::__rotate<_AlgPolicy>(__m1, __middle, __m2).first;
+        // __len12 and __len21 now have swapped meanings
+        // merge smaller range with recursive call and larger with tail recursion elimination
+        if (__len11 + __len21 < __len12 + __len22)
+        {
+            std::__inplace_merge<_AlgPolicy>(
+                __first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size);
+            __first = __middle;
+            __middle = __m2;
+            __len1 = __len12;
+            __len2 = __len22;
+        }
+        else
+        {
+            std::__inplace_merge<_AlgPolicy>(
+                __middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size);
+            __last = __middle;
+            __middle = __m1;
+            __len1 = __len11;
+            __len2 = __len21;
+        }
+    }
+}
+
+template <class _AlgPolicy, class _BidirectionalIterator, class _Compare>
+_LIBCPP_HIDE_FROM_ABI
+void
+__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last,
+              _Compare&& __comp)
+{
+    typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
+    typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type;
+    difference_type __len1 = _IterOps<_AlgPolicy>::distance(__first, __middle);
+    difference_type __len2 = _IterOps<_AlgPolicy>::distance(__middle, __last);
+    difference_type __buf_size = _VSTD::min(__len1, __len2);
+// TODO: Remove the use of std::get_temporary_buffer
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size);
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+    unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first);
+    return std::__inplace_merge<_AlgPolicy>(
+        std::move(__first), std::move(__middle), std::move(__last), __comp, __len1, __len2, __buf.first, __buf.second);
+}
+
+template <class _BidirectionalIterator, class _Compare>
+inline _LIBCPP_HIDE_FROM_ABI void inplace_merge(
+    _BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) {
+  std::__inplace_merge<_ClassicAlgPolicy>(
+      std::move(__first), std::move(__middle), std::move(__last), static_cast<__comp_ref_type<_Compare> >(__comp));
+}
+
+template <class _BidirectionalIterator>
+inline _LIBCPP_HIDE_FROM_ABI
+void
+inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last)
+{
+    std::inplace_merge(std::move(__first), std::move(__middle), std::move(__last),
+                        __less<typename iterator_traits<_BidirectionalIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___ALGORITHM_INPLACE_MERGE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/is_heap.h b/app/src/main/cpp/libcxx/include/__algorithm/is_heap.h
new file mode 100644
index 0000000..2dcb4a2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/is_heap.h
@@ -0,0 +1,44 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_IS_HEAP_H
+#define _LIBCPP___ALGORITHM_IS_HEAP_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/is_heap_until.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _RandomAccessIterator, class _Compare>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
+{
+    return std::__is_heap_until(__first, __last, static_cast<__comp_ref_type<_Compare> >(__comp)) == __last;
+}
+
+template<class _RandomAccessIterator>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
+{
+    return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_IS_HEAP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/is_heap_until.h b/app/src/main/cpp/libcxx/include/__algorithm/is_heap_until.h
new file mode 100644
index 0000000..6ed4cb2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/is_heap_until.h
@@ -0,0 +1,66 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_IS_HEAP_UNTIL_H
+#define _LIBCPP___ALGORITHM_IS_HEAP_UNTIL_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Compare, class _RandomAccessIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _RandomAccessIterator
+__is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp)
+{
+    typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+    difference_type __len = __last - __first;
+    difference_type __p = 0;
+    difference_type __c = 1;
+    _RandomAccessIterator __pp = __first;
+    while (__c < __len)
+    {
+        _RandomAccessIterator __cp = __first + __c;
+        if (__comp(*__pp, *__cp))
+            return __cp;
+        ++__c;
+        ++__cp;
+        if (__c == __len)
+            return __last;
+        if (__comp(*__pp, *__cp))
+            return __cp;
+        ++__p;
+        ++__pp;
+        __c = 2 * __p + 1;
+    }
+    return __last;
+}
+
+template <class _RandomAccessIterator, class _Compare>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _RandomAccessIterator
+is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
+{
+    return std::__is_heap_until(__first, __last, static_cast<__comp_ref_type<_Compare> >(__comp));
+}
+
+template<class _RandomAccessIterator>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _RandomAccessIterator
+is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last)
+{
+    return _VSTD::__is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_IS_HEAP_UNTIL_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/is_partitioned.h b/app/src/main/cpp/libcxx/include/__algorithm/is_partitioned.h
new file mode 100644
index 0000000..ab59d3c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/is_partitioned.h
@@ -0,0 +1,38 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_IS_PARTITIONED_H
+#define _LIBCPP___ALGORITHM_IS_PARTITIONED_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _Predicate>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+is_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred)
+{
+    for (; __first != __last; ++__first)
+        if (!__pred(*__first))
+            break;
+    if ( __first == __last )
+        return true;
+    ++__first;
+    for (; __first != __last; ++__first)
+        if (__pred(*__first))
+            return false;
+    return true;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_IS_PARTITIONED_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/is_permutation.h b/app/src/main/cpp/libcxx/include/__algorithm/is_permutation.h
new file mode 100644
index 0000000..0054456
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/is_permutation.h
@@ -0,0 +1,238 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_IS_PERMUTATION_H
+#define _LIBCPP___ALGORITHM_IS_PERMUTATION_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class = void>
+struct _ConstTimeDistance : false_type {};
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _Iter1, class _Sent1, class _Iter2, class _Sent2>
+struct _ConstTimeDistance<_Iter1, _Sent1, _Iter2, _Sent2, __enable_if_t<
+  sized_sentinel_for<_Sent1, _Iter1> &&
+  sized_sentinel_for<_Sent2, _Iter2>
+>> : true_type {};
+
+#else
+
+template <class _Iter1, class _Iter2>
+struct _ConstTimeDistance<_Iter1, _Iter1, _Iter2, _Iter2, __enable_if_t<
+    is_same<typename iterator_traits<_Iter1>::iterator_category, random_access_iterator_tag>::value &&
+    is_same<typename iterator_traits<_Iter2>::iterator_category, random_access_iterator_tag>::value
+> > : true_type {};
+
+#endif // _LIBCPP_STD_VER > 17
+
+// Internal functions
+
+// For each element in [f1, l1) see if there are the same number of equal elements in [f2, l2)
+template <class _AlgPolicy,
+          class _Iter1, class _Sent1, class _Iter2, class _Sent2,
+          class _Proj1, class _Proj2, class _Pred>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+__is_permutation_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2,
+                      _Pred&& __pred, _Proj1&& __proj1, _Proj2&& __proj2) {
+  using _D1 = __iter_diff_t<_Iter1>;
+
+  for (auto __i = __first1; __i != __last1; ++__i) {
+    //  Have we already counted the number of *__i in [f1, l1)?
+    auto __match = __first1;
+    for (; __match != __i; ++__match) {
+      if (std::__invoke(__pred, std::__invoke(__proj1, *__match), std::__invoke(__proj1, *__i)))
+        break;
+    }
+
+    if (__match == __i) {
+      // Count number of *__i in [f2, l2)
+      _D1 __c2 = 0;
+      for (auto __j = __first2; __j != __last2; ++__j) {
+        if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj2, *__j)))
+          ++__c2;
+      }
+      if (__c2 == 0)
+        return false;
+
+      // Count number of *__i in [__i, l1) (we can start with 1)
+      _D1 __c1 = 1;
+      for (auto __j = _IterOps<_AlgPolicy>::next(__i); __j != __last1; ++__j) {
+        if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj1, *__j)))
+          ++__c1;
+      }
+      if (__c1 != __c2)
+        return false;
+    }
+  }
+
+  return true;
+}
+
+// 2+1 iterators, predicate. Not used by range algorithms.
+template <class _AlgPolicy, class _ForwardIterator1, class _Sentinel1, class _ForwardIterator2, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+__is_permutation(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2,
+                 _BinaryPredicate&& __pred) {
+  // Shorten sequences as much as possible by lopping of any equal prefix.
+  for (; __first1 != __last1; ++__first1, (void)++__first2) {
+    if (!__pred(*__first1, *__first2))
+      break;
+  }
+
+  if (__first1 == __last1)
+    return true;
+
+  //  __first1 != __last1 && *__first1 != *__first2
+  using _D1 = __iter_diff_t<_ForwardIterator1>;
+  _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
+  if (__l1 == _D1(1))
+    return false;
+  auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __l1);
+
+  return std::__is_permutation_impl<_AlgPolicy>(
+      std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2),
+      __pred, __identity(), __identity());
+}
+
+// 2+2 iterators, predicate, non-constant time `distance`.
+template <class _AlgPolicy,
+          class _Iter1, class _Sent1, class _Iter2, class _Sent2,
+          class _Proj1, class _Proj2, class _Pred>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+__is_permutation(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2,
+                 _Pred&& __pred, _Proj1&& __proj1, _Proj2&& __proj2,
+                 /*_ConstTimeDistance=*/false_type) {
+  // Shorten sequences as much as possible by lopping of any equal prefix.
+  while (__first1 != __last1 && __first2 != __last2) {
+    if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2)))
+      break;
+    ++__first1;
+    ++__first2;
+  }
+
+  if (__first1 == __last1)
+    return __first2 == __last2;
+  if (__first2 == __last2) // Second range is shorter
+    return false;
+
+  using _D1 = __iter_diff_t<_Iter1>;
+  _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
+
+  using _D2 = __iter_diff_t<_Iter2>;
+  _D2 __l2 = _IterOps<_AlgPolicy>::distance(__first2, __last2);
+  if (__l1 != __l2)
+    return false;
+
+  return std::__is_permutation_impl<_AlgPolicy>(
+      std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2),
+      __pred, __proj1, __proj2);
+}
+
+// 2+2 iterators, predicate, specialization for constant-time `distance` call.
+template <class _AlgPolicy,
+          class _Iter1, class _Sent1, class _Iter2, class _Sent2,
+          class _Proj1, class _Proj2, class _Pred>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+__is_permutation(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2,
+                 _Pred&& __pred, _Proj1&& __proj1, _Proj2&& __proj2,
+                 /*_ConstTimeDistance=*/true_type) {
+  if (std::distance(__first1, __last1) != std::distance(__first2, __last2))
+    return false;
+  return std::__is_permutation<_AlgPolicy>(
+      std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2),
+      __pred, __proj1, __proj2,
+      /*_ConstTimeDistance=*/false_type());
+}
+
+// 2+2 iterators, predicate
+template <class _AlgPolicy,
+          class _Iter1, class _Sent1, class _Iter2, class _Sent2,
+          class _Proj1, class _Proj2, class _Pred>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+__is_permutation(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2,
+                 _Pred&& __pred, _Proj1&& __proj1, _Proj2&& __proj2) {
+  return std::__is_permutation<_AlgPolicy>(
+      std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2),
+      __pred, __proj1, __proj2,
+      _ConstTimeDistance<_Iter1, _Sent1, _Iter2, _Sent2>());
+}
+
+// Public interface
+
+// 2+1 iterators, predicate
+template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
+               _BinaryPredicate __pred) {
+  static_assert(__is_callable<_BinaryPredicate, decltype(*__first1), decltype(*__first2)>::value,
+      "The predicate has to be callable");
+
+  return std::__is_permutation<_ClassicAlgPolicy>(
+      std::move(__first1), std::move(__last1), std::move(__first2), __pred);
+}
+
+// 2+1 iterators
+template <class _ForwardIterator1, class _ForwardIterator2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) {
+  return std::is_permutation(__first1, __last1, __first2, __equal_to());
+}
+
+#if _LIBCPP_STD_VER > 11
+
+// 2+2 iterators
+template <class _ForwardIterator1, class _ForwardIterator2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool is_permutation(
+    _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) {
+  return std::__is_permutation<_ClassicAlgPolicy>(
+      std::move(__first1),
+      std::move(__last1),
+      std::move(__first2),
+      std::move(__last2),
+      __equal_to(),
+      __identity(),
+      __identity());
+}
+
+// 2+2 iterators, predicate
+template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
+               _ForwardIterator2 __last2, _BinaryPredicate __pred) {
+  static_assert(__is_callable<_BinaryPredicate, decltype(*__first1), decltype(*__first2)>::value,
+      "The predicate has to be callable");
+
+  return std::__is_permutation<_ClassicAlgPolicy>(
+      std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2),
+      __pred, __identity(), __identity());
+}
+
+#endif // _LIBCPP_STD_VER > 11
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_IS_PERMUTATION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/is_sorted.h b/app/src/main/cpp/libcxx/include/__algorithm/is_sorted.h
new file mode 100644
index 0000000..bf44f45
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/is_sorted.h
@@ -0,0 +1,44 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_IS_SORTED_H
+#define _LIBCPP___ALGORITHM_IS_SORTED_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/is_sorted_until.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _ForwardIterator, class _Compare>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+is_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
+{
+    return _VSTD::__is_sorted_until<__comp_ref_type<_Compare> >(__first, __last, __comp) == __last;
+}
+
+template<class _ForwardIterator>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+is_sorted(_ForwardIterator __first, _ForwardIterator __last)
+{
+    return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_IS_SORTED_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/is_sorted_until.h b/app/src/main/cpp/libcxx/include/__algorithm/is_sorted_until.h
new file mode 100644
index 0000000..b668300
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/is_sorted_until.h
@@ -0,0 +1,56 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_IS_SORTED_UNTIL_H
+#define _LIBCPP___ALGORITHM_IS_SORTED_UNTIL_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Compare, class _ForwardIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+__is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
+{
+    if (__first != __last)
+    {
+        _ForwardIterator __i = __first;
+        while (++__i != __last)
+        {
+            if (__comp(*__i, *__first))
+                return __i;
+            __first = __i;
+        }
+    }
+    return __last;
+}
+
+template <class _ForwardIterator, class _Compare>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
+{
+    return _VSTD::__is_sorted_until<__comp_ref_type<_Compare> >(__first, __last, __comp);
+}
+
+template<class _ForwardIterator>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+is_sorted_until(_ForwardIterator __first, _ForwardIterator __last)
+{
+    return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_IS_SORTED_UNTIL_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/iter_swap.h b/app/src/main/cpp/libcxx/include/__algorithm/iter_swap.h
new file mode 100644
index 0000000..44422b5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/iter_swap.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_ITER_SWAP_H
+#define _LIBCPP___ALGORITHM_ITER_SWAP_H
+
+#include <__config>
+#include <__utility/declval.h>
+#include <__utility/swap.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _ForwardIterator1, class _ForwardIterator2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 void iter_swap(_ForwardIterator1 __a,
+                                                                              _ForwardIterator2 __b)
+    //                                  _NOEXCEPT_(_NOEXCEPT_(swap(*__a, *__b)))
+    _NOEXCEPT_(_NOEXCEPT_(swap(*std::declval<_ForwardIterator1>(), *std::declval<_ForwardIterator2>()))) {
+  swap(*__a, *__b);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_ITER_SWAP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/iterator_operations.h b/app/src/main/cpp/libcxx/include/__algorithm/iterator_operations.h
new file mode 100644
index 0000000..bd3e6f1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/iterator_operations.h
@@ -0,0 +1,175 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_ITERATOR_OPERATIONS_H
+#define _LIBCPP___ALGORITHM_ITERATOR_OPERATIONS_H
+
+#include <__algorithm/iter_swap.h>
+#include <__algorithm/ranges_iterator_concept.h>
+#include <__config>
+#include <__iterator/advance.h>
+#include <__iterator/distance.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iter_swap.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/prev.h>
+#include <__iterator/readable_traits.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy> struct _IterOps;
+
+#if _LIBCPP_STD_VER > 17
+struct _RangeAlgPolicy {};
+
+template <>
+struct _IterOps<_RangeAlgPolicy> {
+
+  template <class _Iter>
+  using __value_type = iter_value_t<_Iter>;
+
+  template <class _Iter>
+  using __iterator_category = ranges::__iterator_concept<_Iter>;
+
+  template <class _Iter>
+  using __difference_type = iter_difference_t<_Iter>;
+
+  static constexpr auto advance = ranges::advance;
+  static constexpr auto distance = ranges::distance;
+  static constexpr auto __iter_move = ranges::iter_move;
+  static constexpr auto iter_swap = ranges::iter_swap;
+  static constexpr auto next = ranges::next;
+  static constexpr auto prev = ranges::prev;
+  static constexpr auto __advance_to = ranges::advance;
+};
+
+#endif
+
+struct _ClassicAlgPolicy {};
+
+template <>
+struct _IterOps<_ClassicAlgPolicy> {
+
+  template <class _Iter>
+  using __value_type = typename iterator_traits<_Iter>::value_type;
+
+  template <class _Iter>
+  using __iterator_category = typename iterator_traits<_Iter>::iterator_category;
+
+  template <class _Iter>
+  using __difference_type = typename iterator_traits<_Iter>::difference_type;
+
+  // advance
+  template <class _Iter, class _Distance>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+  static void advance(_Iter& __iter, _Distance __count) {
+    std::advance(__iter, __count);
+  }
+
+  // distance
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+  static typename iterator_traits<_Iter>::difference_type distance(_Iter __first, _Iter __last) {
+    return std::distance(__first, __last);
+  }
+
+  template <class _Iter>
+  using __deref_t = decltype(*std::declval<_Iter&>());
+
+  template <class _Iter>
+  using __move_t = decltype(std::move(*std::declval<_Iter&>()));
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+  static void __validate_iter_reference() {
+    static_assert(is_same<__deref_t<_Iter>, typename iterator_traits<__remove_cvref_t<_Iter> >::reference>::value,
+        "It looks like your iterator's `iterator_traits<It>::reference` does not match the return type of "
+        "dereferencing the iterator, i.e., calling `*it`. This is undefined behavior according to [input.iterators] "
+        "and can lead to dangling reference issues at runtime, so we are flagging this.");
+  }
+
+  // iter_move
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 static
+  // If the result of dereferencing `_Iter` is a reference type, deduce the result of calling `std::move` on it. Note
+  // that the C++03 mode doesn't support `decltype(auto)` as the return type.
+  __enable_if_t<
+      is_reference<__deref_t<_Iter> >::value,
+      __move_t<_Iter> >
+  __iter_move(_Iter&& __i) {
+    __validate_iter_reference<_Iter>();
+
+    return std::move(*std::forward<_Iter>(__i));
+  }
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 static
+  // If the result of dereferencing `_Iter` is a value type, deduce the return value of this function to also be a
+  // value -- otherwise, after `operator*` returns a temporary, this function would return a dangling reference to that
+  // temporary. Note that the C++03 mode doesn't support `auto` as the return type.
+  __enable_if_t<
+      !is_reference<__deref_t<_Iter> >::value,
+      __deref_t<_Iter> >
+  __iter_move(_Iter&& __i) {
+    __validate_iter_reference<_Iter>();
+
+    return *std::forward<_Iter>(__i);
+  }
+
+  // iter_swap
+  template <class _Iter1, class _Iter2>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+  static void iter_swap(_Iter1&& __a, _Iter2&& __b) {
+    std::iter_swap(std::forward<_Iter1>(__a), std::forward<_Iter2>(__b));
+  }
+
+  // next
+  template <class _Iterator>
+  _LIBCPP_HIDE_FROM_ABI static _LIBCPP_CONSTEXPR_SINCE_CXX14
+  _Iterator next(_Iterator, _Iterator __last) {
+    return __last;
+  }
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI static _LIBCPP_CONSTEXPR_SINCE_CXX14
+  __remove_cvref_t<_Iter> next(_Iter&& __it,
+                          typename iterator_traits<__remove_cvref_t<_Iter> >::difference_type __n = 1) {
+    return std::next(std::forward<_Iter>(__it), __n);
+  }
+
+  // prev
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI static _LIBCPP_CONSTEXPR_SINCE_CXX14
+  __remove_cvref_t<_Iter> prev(_Iter&& __iter,
+                 typename iterator_traits<__remove_cvref_t<_Iter> >::difference_type __n = 1) {
+    return std::prev(std::forward<_Iter>(__iter), __n);
+  }
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI static _LIBCPP_CONSTEXPR_SINCE_CXX14
+  void __advance_to(_Iter& __first, _Iter __last) {
+    __first = __last;
+  }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_ITERATOR_OPERATIONS_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/lexicographical_compare.h b/app/src/main/cpp/libcxx/include/__algorithm/lexicographical_compare.h
new file mode 100644
index 0000000..0a13c5d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/lexicographical_compare.h
@@ -0,0 +1,62 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_LEXICOGRAPHICAL_COMPARE_H
+#define _LIBCPP___ALGORITHM_LEXICOGRAPHICAL_COMPARE_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Compare, class _InputIterator1, class _InputIterator2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
+                          _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
+{
+    for (; __first2 != __last2; ++__first1, (void) ++__first2)
+    {
+        if (__first1 == __last1 || __comp(*__first1, *__first2))
+            return true;
+        if (__comp(*__first2, *__first1))
+            return false;
+    }
+    return false;
+}
+
+template <class _InputIterator1, class _InputIterator2, class _Compare>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
+                        _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
+{
+    return _VSTD::__lexicographical_compare<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __comp);
+}
+
+template <class _InputIterator1, class _InputIterator2>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
+                        _InputIterator2 __first2, _InputIterator2 __last2)
+{
+    return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2,
+                                         __less<typename iterator_traits<_InputIterator1>::value_type,
+                                                typename iterator_traits<_InputIterator2>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_LEXICOGRAPHICAL_COMPARE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/lower_bound.h b/app/src/main/cpp/libcxx/include/__algorithm/lower_bound.h
new file mode 100644
index 0000000..2648982
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/lower_bound.h
@@ -0,0 +1,68 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_LOWER_BOUND_H
+#define _LIBCPP___ALGORITHM_LOWER_BOUND_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/half_positive.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/advance.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/is_callable.h>
+#include <__type_traits/remove_reference.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Iter, class _Sent, class _Type, class _Proj, class _Comp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_Iter __lower_bound_impl(_Iter __first, _Sent __last, const _Type& __value, _Comp& __comp, _Proj& __proj) {
+  auto __len = _IterOps<_AlgPolicy>::distance(__first, __last);
+
+  while (__len != 0) {
+    auto __l2 = std::__half_positive(__len);
+    _Iter __m = __first;
+    _IterOps<_AlgPolicy>::advance(__m, __l2);
+    if (std::__invoke(__comp, std::__invoke(__proj, *__m), __value)) {
+      __first = ++__m;
+      __len -= __l2 + 1;
+    } else {
+      __len = __l2;
+    }
+  }
+  return __first;
+}
+
+template <class _ForwardIterator, class _Tp, class _Compare>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_ForwardIterator lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) {
+  static_assert(__is_callable<_Compare, decltype(*__first), const _Tp&>::value,
+                "The comparator has to be callable");
+  auto __proj = std::__identity();
+  return std::__lower_bound_impl<_ClassicAlgPolicy>(__first, __last, __value, __comp, __proj);
+}
+
+template <class _ForwardIterator, class _Tp>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_ForwardIterator lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) {
+  return std::lower_bound(__first, __last, __value,
+                          __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_LOWER_BOUND_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/make_heap.h b/app/src/main/cpp/libcxx/include/__algorithm/make_heap.h
new file mode 100644
index 0000000..d66cfe2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/make_heap.h
@@ -0,0 +1,56 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MAKE_HEAP_H
+#define _LIBCPP___ALGORITHM_MAKE_HEAP_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/sift_down.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+void __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp) {
+  __comp_ref_type<_Compare> __comp_ref = __comp;
+
+  using difference_type = typename iterator_traits<_RandomAccessIterator>::difference_type;
+  difference_type __n = __last - __first;
+  if (__n > 1) {
+    // start from the first parent, there is no need to consider children
+    for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) {
+        std::__sift_down<_AlgPolicy>(__first, __comp_ref, __n, __first + __start);
+    }
+  }
+}
+
+template <class _RandomAccessIterator, class _Compare>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
+  std::__make_heap<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __comp);
+}
+
+template <class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) {
+  std::make_heap(std::move(__first), std::move(__last),
+      __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_MAKE_HEAP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/make_projected.h b/app/src/main/cpp/libcxx/include/__algorithm/make_projected.h
new file mode 100644
index 0000000..87d4d59
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/make_projected.h
@@ -0,0 +1,126 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MAKE_PROJECTED_H
+#define _LIBCPP___ALGORITHM_MAKE_PROJECTED_H
+
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_member_pointer.h>
+#include <__type_traits/is_same.h>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Pred, class _Proj>
+struct _ProjectedPred {
+  _Pred& __pred; // Can be a unary or a binary predicate.
+  _Proj& __proj;
+
+  _LIBCPP_CONSTEXPR _ProjectedPred(_Pred& __pred_arg, _Proj& __proj_arg) : __pred(__pred_arg), __proj(__proj_arg) {}
+
+  template <class _Tp>
+  typename __invoke_of<_Pred&,
+                       decltype(std::__invoke(std::declval<_Proj&>(), std::declval<_Tp>()))
+  >::type
+  _LIBCPP_CONSTEXPR operator()(_Tp&& __v) const {
+    return std::__invoke(__pred, std::__invoke(__proj, std::forward<_Tp>(__v)));
+  }
+
+  template <class _T1, class _T2>
+  typename __invoke_of<_Pred&,
+                       decltype(std::__invoke(std::declval<_Proj&>(), std::declval<_T1>())),
+                       decltype(std::__invoke(std::declval<_Proj&>(), std::declval<_T2>()))
+  >::type
+  _LIBCPP_CONSTEXPR operator()(_T1&& __lhs, _T2&& __rhs) const {
+    return std::__invoke(__pred,
+                      std::__invoke(__proj, std::forward<_T1>(__lhs)),
+                      std::__invoke(__proj, std::forward<_T2>(__rhs)));
+  }
+
+};
+
+template <class _Pred, class _Proj, class = void>
+struct __can_use_pristine_comp : false_type {};
+
+template <class _Pred, class _Proj>
+struct __can_use_pristine_comp<_Pred, _Proj, __enable_if_t<
+    !is_member_pointer<typename decay<_Pred>::type>::value && (
+#if _LIBCPP_STD_VER > 17
+      is_same<typename decay<_Proj>::type, identity>::value ||
+#endif
+      is_same<typename decay<_Proj>::type, __identity>::value
+    )
+> > : true_type {};
+
+template <class _Pred, class _Proj>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR static
+__enable_if_t<
+    !__can_use_pristine_comp<_Pred, _Proj>::value,
+    _ProjectedPred<_Pred, _Proj>
+>
+__make_projected(_Pred& __pred, _Proj& __proj) {
+  return _ProjectedPred<_Pred, _Proj>(__pred, __proj);
+}
+
+// Avoid creating the functor and just use the pristine comparator -- for certain algorithms, this would enable
+// optimizations that rely on the type of the comparator. Additionally, this results in less layers of indirection in
+// the call stack when the comparator is invoked, even in an unoptimized build.
+template <class _Pred, class _Proj>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR static
+__enable_if_t<
+    __can_use_pristine_comp<_Pred, _Proj>::value,
+    _Pred&
+>
+__make_projected(_Pred& __pred, _Proj&) {
+  return __pred;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _Comp, class _Proj1, class _Proj2>
+_LIBCPP_HIDE_FROM_ABI constexpr static
+decltype(auto) __make_projected_comp(_Comp& __comp, _Proj1& __proj1, _Proj2& __proj2) {
+  if constexpr (same_as<decay_t<_Proj1>, identity> && same_as<decay_t<_Proj2>, identity> &&
+                !is_member_pointer_v<decay_t<_Comp>>) {
+    // Avoid creating the lambda and just use the pristine comparator -- for certain algorithms, this would enable
+    // optimizations that rely on the type of the comparator.
+    return __comp;
+
+  } else {
+    return [&](auto&& __lhs, auto&& __rhs) {
+      return std::invoke(__comp,
+                        std::invoke(__proj1, std::forward<decltype(__lhs)>(__lhs)),
+                        std::invoke(__proj2, std::forward<decltype(__rhs)>(__rhs)));
+    };
+  }
+}
+
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_MAKE_PROJECTED_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/max.h b/app/src/main/cpp/libcxx/include/__algorithm/max.h
new file mode 100644
index 0000000..a08a3fc
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/max.h
@@ -0,0 +1,71 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MAX_H
+#define _LIBCPP___ALGORITHM_MAX_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/max_element.h>
+#include <__config>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _Compare>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const _Tp&
+max(const _Tp& __a, const _Tp& __b, _Compare __comp)
+{
+    return __comp(__a, __b) ? __b : __a;
+}
+
+template <class _Tp>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const _Tp&
+max(const _Tp& __a, const _Tp& __b)
+{
+    return _VSTD::max(__a, __b, __less<_Tp>());
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template<class _Tp, class _Compare>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp
+max(initializer_list<_Tp> __t, _Compare __comp)
+{
+    return *_VSTD::__max_element<__comp_ref_type<_Compare> >(__t.begin(), __t.end(), __comp);
+}
+
+template<class _Tp>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp
+max(initializer_list<_Tp> __t)
+{
+    return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>());
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___ALGORITHM_MAX_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/max_element.h b/app/src/main/cpp/libcxx/include/__algorithm/max_element.h
new file mode 100644
index 0000000..6ac3106
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/max_element.h
@@ -0,0 +1,57 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MAX_ELEMENT_H
+#define _LIBCPP___ALGORITHM_MAX_ELEMENT_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Compare, class _ForwardIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _ForwardIterator
+__max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
+{
+    static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value,
+        "std::max_element requires a ForwardIterator");
+    if (__first != __last)
+    {
+        _ForwardIterator __i = __first;
+        while (++__i != __last)
+            if (__comp(*__first, *__i))
+                __first = __i;
+    }
+    return __first;
+}
+
+template <class _ForwardIterator, class _Compare>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _ForwardIterator
+max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
+{
+    return _VSTD::__max_element<__comp_ref_type<_Compare> >(__first, __last, __comp);
+}
+
+
+template <class _ForwardIterator>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _ForwardIterator
+max_element(_ForwardIterator __first, _ForwardIterator __last)
+{
+    return _VSTD::max_element(__first, __last,
+              __less<typename iterator_traits<_ForwardIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_MAX_ELEMENT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/merge.h b/app/src/main/cpp/libcxx/include/__algorithm/merge.h
new file mode 100644
index 0000000..e54e430
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/merge.h
@@ -0,0 +1,70 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MERGE_H
+#define _LIBCPP___ALGORITHM_MERGE_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/copy.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+__merge(_InputIterator1 __first1, _InputIterator1 __last1,
+        _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
+{
+    for (; __first1 != __last1; ++__result)
+    {
+        if (__first2 == __last2)
+            return _VSTD::copy(__first1, __last1, __result);
+        if (__comp(*__first2, *__first1))
+        {
+            *__result = *__first2;
+            ++__first2;
+        }
+        else
+        {
+            *__result = *__first1;
+            ++__first1;
+        }
+    }
+    return _VSTD::copy(__first2, __last2, __result);
+}
+
+template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+merge(_InputIterator1 __first1, _InputIterator1 __last1,
+      _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
+{
+    return _VSTD::__merge<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __result, __comp);
+}
+
+template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+merge(_InputIterator1 __first1, _InputIterator1 __last1,
+      _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result)
+{
+    typedef typename iterator_traits<_InputIterator1>::value_type __v1;
+    typedef typename iterator_traits<_InputIterator2>::value_type __v2;
+    return _VSTD::merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_MERGE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/min.h b/app/src/main/cpp/libcxx/include/__algorithm/min.h
new file mode 100644
index 0000000..2882485
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/min.h
@@ -0,0 +1,71 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MIN_H
+#define _LIBCPP___ALGORITHM_MIN_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/min_element.h>
+#include <__config>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _Compare>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const _Tp&
+min(const _Tp& __a, const _Tp& __b, _Compare __comp)
+{
+    return __comp(__b, __a) ? __b : __a;
+}
+
+template <class _Tp>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const _Tp&
+min(const _Tp& __a, const _Tp& __b)
+{
+    return _VSTD::min(__a, __b, __less<_Tp>());
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template<class _Tp, class _Compare>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp
+min(initializer_list<_Tp> __t, _Compare __comp)
+{
+    return *_VSTD::__min_element<__comp_ref_type<_Compare> >(__t.begin(), __t.end(), __comp);
+}
+
+template<class _Tp>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp
+min(initializer_list<_Tp> __t)
+{
+    return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>());
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___ALGORITHM_MIN_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/min_element.h b/app/src/main/cpp/libcxx/include/__algorithm/min_element.h
new file mode 100644
index 0000000..c0706fe
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/min_element.h
@@ -0,0 +1,70 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MIN_ELEMENT_H
+#define _LIBCPP___ALGORITHM_MIN_ELEMENT_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/is_callable.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Comp, class _Iter, class _Sent, class _Proj>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Iter __min_element(_Iter __first, _Sent __last, _Comp __comp, _Proj& __proj) {
+  if (__first == __last)
+    return __first;
+
+  _Iter __i = __first;
+  while (++__i != __last)
+    if (std::__invoke(__comp, std::__invoke(__proj, *__i), std::__invoke(__proj, *__first)))
+      __first = __i;
+
+  return __first;
+}
+
+template <class _Comp, class _Iter, class _Sent>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Iter __min_element(_Iter __first, _Sent __last, _Comp __comp) {
+  auto __proj = __identity();
+  return std::__min_element<_Comp>(std::move(__first), std::move(__last), __comp, __proj);
+}
+
+template <class _ForwardIterator, class _Compare>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _ForwardIterator
+min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
+{
+  static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value,
+      "std::min_element requires a ForwardIterator");
+  static_assert(__is_callable<_Compare, decltype(*__first), decltype(*__first)>::value,
+              "The comparator has to be callable");
+
+  return std::__min_element<__comp_ref_type<_Compare> >(std::move(__first), std::move(__last), __comp);
+}
+
+template <class _ForwardIterator>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _ForwardIterator
+min_element(_ForwardIterator __first, _ForwardIterator __last)
+{
+    return _VSTD::min_element(__first, __last,
+              __less<typename iterator_traits<_ForwardIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_MIN_ELEMENT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/min_max_result.h b/app/src/main/cpp/libcxx/include/__algorithm/min_max_result.h
new file mode 100644
index 0000000..4be3999
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/min_max_result.h
@@ -0,0 +1,56 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MIN_MAX_RESULT_H
+#define _LIBCPP___ALGORITHM_MIN_MAX_RESULT_H
+
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+template <class _T1>
+struct min_max_result {
+  _LIBCPP_NO_UNIQUE_ADDRESS _T1 min;
+  _LIBCPP_NO_UNIQUE_ADDRESS _T1 max;
+
+  template <class _T2>
+    requires convertible_to<const _T1&, _T2>
+  _LIBCPP_HIDE_FROM_ABI constexpr operator min_max_result<_T2>() const & {
+    return {min, max};
+  }
+
+  template <class _T2>
+    requires convertible_to<_T1, _T2>
+  _LIBCPP_HIDE_FROM_ABI constexpr operator min_max_result<_T2>() && {
+    return {std::move(min), std::move(max)};
+  }
+};
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___ALGORITHM_MIN_MAX_RESULT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/minmax.h b/app/src/main/cpp/libcxx/include/__algorithm/minmax.h
new file mode 100644
index 0000000..6ef0a77
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/minmax.h
@@ -0,0 +1,69 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MINMAX_H
+#define _LIBCPP___ALGORITHM_MINMAX_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/minmax_element.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__type_traits/is_callable.h>
+#include <__utility/pair.h>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Tp, class _Compare>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<const _Tp&, const _Tp&>
+minmax(const _Tp& __a, const _Tp& __b, _Compare __comp)
+{
+    return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) :
+                              pair<const _Tp&, const _Tp&>(__a, __b);
+}
+
+template<class _Tp>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<const _Tp&, const _Tp&>
+minmax(const _Tp& __a, const _Tp& __b)
+{
+    return std::minmax(__a, __b, __less<_Tp>());
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template<class _Tp, class _Compare>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_Tp, _Tp> minmax(initializer_list<_Tp> __t, _Compare __comp) {
+    static_assert(__is_callable<_Compare, _Tp, _Tp>::value, "The comparator has to be callable");
+    __identity __proj;
+    auto __ret = std::__minmax_element_impl(__t.begin(), __t.end(), __comp, __proj);
+    return pair<_Tp, _Tp>(*__ret.first, *__ret.second);
+}
+
+template<class _Tp>
+_LIBCPP_NODISCARD_EXT inline
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_Tp, _Tp>
+minmax(initializer_list<_Tp> __t)
+{
+    return std::minmax(__t, __less<_Tp>());
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_MINMAX_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/minmax_element.h b/app/src/main/cpp/libcxx/include/__algorithm/minmax_element.h
new file mode 100644
index 0000000..caa963e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/minmax_element.h
@@ -0,0 +1,101 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MINMAX_ELEMENT_H
+#define _LIBCPP___ALGORITHM_MINMAX_ELEMENT_H
+
+#include <__algorithm/comp.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__iterator/iterator_traits.h>
+#include <__utility/pair.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Comp, class _Proj>
+class _MinmaxElementLessFunc {
+  _Comp& __comp_;
+  _Proj& __proj_;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+  _MinmaxElementLessFunc(_Comp& __comp, _Proj& __proj) : __comp_(__comp), __proj_(__proj) {}
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+  bool operator()(_Iter& __it1, _Iter& __it2) {
+    return std::__invoke(__comp_, std::__invoke(__proj_, *__it1), std::__invoke(__proj_, *__it2));
+  }
+};
+
+template <class _Iter, class _Sent, class _Proj, class _Comp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_Iter, _Iter> __minmax_element_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
+  auto __less = _MinmaxElementLessFunc<_Comp, _Proj>(__comp, __proj);
+
+  pair<_Iter, _Iter> __result(__first, __first);
+  if (__first == __last || ++__first == __last)
+    return __result;
+
+  if (__less(__first, __result.first))
+    __result.first = __first;
+  else
+    __result.second = __first;
+
+  while (++__first != __last) {
+    _Iter __i = __first;
+    if (++__first == __last) {
+      if (__less(__i, __result.first))
+        __result.first = __i;
+      else if (!__less(__i, __result.second))
+        __result.second = __i;
+      return __result;
+    }
+
+    if (__less(__first, __i)) {
+      if (__less(__first, __result.first))
+        __result.first = __first;
+    if (!__less(__i, __result.second))
+      __result.second = __i;
+    } else {
+      if (__less(__i, __result.first))
+        __result.first = __i;
+      if (!__less(__first, __result.second))
+        __result.second = __first;
+    }
+  }
+
+  return __result;
+}
+
+template <class _ForwardIterator, class _Compare>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_ForwardIterator, _ForwardIterator>
+minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) {
+  static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value,
+                "std::minmax_element requires a ForwardIterator");
+  static_assert(__is_callable<_Compare, decltype(*__first), decltype(*__first)>::value,
+                "The comparator has to be callable");
+  auto __proj = __identity();
+  return std::__minmax_element_impl(__first, __last, __comp, __proj);
+}
+
+template <class _ForwardIterator>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_ForwardIterator, _ForwardIterator> minmax_element(_ForwardIterator __first, _ForwardIterator __last) {
+    return std::minmax_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_MINMAX_ELEMENT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/mismatch.h b/app/src/main/cpp/libcxx/include/__algorithm/mismatch.h
new file mode 100644
index 0000000..600e2cd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/mismatch.h
@@ -0,0 +1,63 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MISMATCH_H
+#define _LIBCPP___ALGORITHM_MISMATCH_H
+
+#include <__algorithm/comp.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_InputIterator1, _InputIterator2>
+    mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) {
+  for (; __first1 != __last1; ++__first1, (void)++__first2)
+    if (!__pred(*__first1, *__first2))
+      break;
+  return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
+}
+
+template <class _InputIterator1, class _InputIterator2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_InputIterator1, _InputIterator2>
+    mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) {
+  return std::mismatch(__first1, __last1, __first2, __equal_to());
+}
+
+#if _LIBCPP_STD_VER > 11
+template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_InputIterator1, _InputIterator2>
+    mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2,
+             _BinaryPredicate __pred) {
+  for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2)
+    if (!__pred(*__first1, *__first2))
+      break;
+  return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
+}
+
+template <class _InputIterator1, class _InputIterator2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_InputIterator1, _InputIterator2>
+    mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) {
+  return std::mismatch(__first1, __last1, __first2, __last2, __equal_to());
+}
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_MISMATCH_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/move.h b/app/src/main/cpp/libcxx/include/__algorithm/move.h
new file mode 100644
index 0000000..ac95bda
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/move.h
@@ -0,0 +1,130 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MOVE_H
+#define _LIBCPP___ALGORITHM_MOVE_H
+
+#include <__algorithm/copy_move_common.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/min.h>
+#include <__config>
+#include <__iterator/segmented_iterator.h>
+#include <__type_traits/common_type.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _InIter, class _Sent, class _OutIter>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+__move(_InIter __first, _Sent __last, _OutIter __result);
+
+template <class _AlgPolicy>
+struct __move_loop {
+  template <class _InIter, class _Sent, class _OutIter>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+  operator()(_InIter __first, _Sent __last, _OutIter __result) const {
+    while (__first != __last) {
+      *__result = _IterOps<_AlgPolicy>::__iter_move(__first);
+      ++__first;
+      ++__result;
+    }
+    return std::make_pair(std::move(__first), std::move(__result));
+  }
+
+  template <class _InIter, class _OutIter, __enable_if_t<__is_segmented_iterator<_InIter>::value, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+  operator()(_InIter __first, _InIter __last, _OutIter __result) const {
+    using _Traits = __segmented_iterator_traits<_InIter>;
+    auto __sfirst = _Traits::__segment(__first);
+    auto __slast  = _Traits::__segment(__last);
+    if (__sfirst == __slast) {
+      auto __iters = std::__move<_AlgPolicy>(_Traits::__local(__first), _Traits::__local(__last), std::move(__result));
+      return std::make_pair(__last, std::move(__iters.second));
+    }
+
+    __result = std::__move<_AlgPolicy>(_Traits::__local(__first), _Traits::__end(__sfirst), std::move(__result)).second;
+    ++__sfirst;
+    while (__sfirst != __slast) {
+      __result =
+          std::__move<_AlgPolicy>(_Traits::__begin(__sfirst), _Traits::__end(__sfirst), std::move(__result)).second;
+      ++__sfirst;
+    }
+    __result =
+        std::__move<_AlgPolicy>(_Traits::__begin(__sfirst), _Traits::__local(__last), std::move(__result)).second;
+    return std::make_pair(__last, std::move(__result));
+  }
+
+  template <class _InIter,
+            class _OutIter,
+            __enable_if_t<__is_cpp17_random_access_iterator<_InIter>::value &&
+                              !__is_segmented_iterator<_InIter>::value && __is_segmented_iterator<_OutIter>::value,
+                          int> = 0>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+  operator()(_InIter __first, _InIter __last, _OutIter __result) {
+    using _Traits = __segmented_iterator_traits<_OutIter>;
+    using _DiffT  = typename common_type<__iter_diff_t<_InIter>, __iter_diff_t<_OutIter> >::type;
+
+    if (__first == __last)
+      return std::make_pair(std::move(__first), std::move(__result));
+
+    auto __local_first      = _Traits::__local(__result);
+    auto __segment_iterator = _Traits::__segment(__result);
+    while (true) {
+      auto __local_last = _Traits::__end(__segment_iterator);
+      auto __size       = std::min<_DiffT>(__local_last - __local_first, __last - __first);
+      auto __iters      = std::__move<_AlgPolicy>(__first, __first + __size, __local_first);
+      __first           = std::move(__iters.first);
+
+      if (__first == __last)
+        return std::make_pair(std::move(__first), _Traits::__compose(__segment_iterator, std::move(__iters.second)));
+
+      __local_first = _Traits::__begin(++__segment_iterator);
+    }
+  }
+};
+
+struct __move_trivial {
+  // At this point, the iterators have been unwrapped so any `contiguous_iterator` has been unwrapped to a pointer.
+  template <class _In, class _Out,
+            __enable_if_t<__can_lower_move_assignment_to_memmove<_In, _Out>::value, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_In*, _Out*>
+  operator()(_In* __first, _In* __last, _Out* __result) const {
+    return std::__copy_trivial_impl(__first, __last, __result);
+  }
+};
+
+template <class _AlgPolicy, class _InIter, class _Sent, class _OutIter>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+__move(_InIter __first, _Sent __last, _OutIter __result) {
+  return std::__dispatch_copy_or_move<_AlgPolicy, __move_loop<_AlgPolicy>, __move_trivial>(
+      std::move(__first), std::move(__last), std::move(__result));
+}
+
+template <class _InputIterator, class _OutputIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator
+move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) {
+  static_assert(is_copy_constructible<_InputIterator>::value, "Iterators has to be copy constructible.");
+  static_assert(is_copy_constructible<_OutputIterator>::value, "The output iterator has to be copy constructible.");
+
+  return std::__move<_ClassicAlgPolicy>(std::move(__first), std::move(__last), std::move(__result)).second;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___ALGORITHM_MOVE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/move_backward.h b/app/src/main/cpp/libcxx/include/__algorithm/move_backward.h
new file mode 100644
index 0000000..d4f013b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/move_backward.h
@@ -0,0 +1,139 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_MOVE_BACKWARD_H
+#define _LIBCPP___ALGORITHM_MOVE_BACKWARD_H
+
+#include <__algorithm/copy_move_common.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/min.h>
+#include <__config>
+#include <__iterator/segmented_iterator.h>
+#include <__type_traits/common_type.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _BidirectionalIterator1, class _Sentinel, class _BidirectionalIterator2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_BidirectionalIterator1, _BidirectionalIterator2>
+__move_backward(_BidirectionalIterator1 __first, _Sentinel __last, _BidirectionalIterator2 __result);
+
+template <class _AlgPolicy>
+struct __move_backward_loop {
+  template <class _InIter, class _Sent, class _OutIter>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+  operator()(_InIter __first, _Sent __last, _OutIter __result) const {
+    auto __last_iter          = _IterOps<_AlgPolicy>::next(__first, __last);
+    auto __original_last_iter = __last_iter;
+
+    while (__first != __last_iter) {
+      *--__result = _IterOps<_AlgPolicy>::__iter_move(--__last_iter);
+    }
+
+    return std::make_pair(std::move(__original_last_iter), std::move(__result));
+  }
+
+  template <class _InIter, class _OutIter, __enable_if_t<__is_segmented_iterator<_InIter>::value, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+  operator()(_InIter __first, _InIter __last, _OutIter __result) const {
+    using _Traits = __segmented_iterator_traits<_InIter>;
+    auto __sfirst = _Traits::__segment(__first);
+    auto __slast  = _Traits::__segment(__last);
+    if (__sfirst == __slast) {
+      auto __iters =
+          std::__move_backward<_AlgPolicy>(_Traits::__local(__first), _Traits::__local(__last), std::move(__result));
+      return std::make_pair(__last, __iters.second);
+    }
+
+    __result =
+        std::__move_backward<_AlgPolicy>(_Traits::__begin(__slast), _Traits::__local(__last), std::move(__result))
+            .second;
+    --__slast;
+    while (__sfirst != __slast) {
+      __result =
+          std::__move_backward<_AlgPolicy>(_Traits::__begin(__slast), _Traits::__end(__slast), std::move(__result))
+              .second;
+      --__slast;
+    }
+    __result = std::__move_backward<_AlgPolicy>(_Traits::__local(__first), _Traits::__end(__slast), std::move(__result))
+                   .second;
+    return std::make_pair(__last, std::move(__result));
+  }
+
+  template <class _InIter,
+            class _OutIter,
+            __enable_if_t<__is_cpp17_random_access_iterator<_InIter>::value &&
+                              !__is_segmented_iterator<_InIter>::value && __is_segmented_iterator<_OutIter>::value,
+                          int> = 0>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
+  operator()(_InIter __first, _InIter __last, _OutIter __result) {
+    using _Traits = __segmented_iterator_traits<_OutIter>;
+    using _DiffT  = typename common_type<__iter_diff_t<_InIter>, __iter_diff_t<_OutIter> >::type;
+
+    // When the range contains no elements, __result might not be a valid iterator
+    if (__first == __last)
+      return std::make_pair(__first, __result);
+
+    auto __orig_last = __last;
+
+    auto __local_last       = _Traits::__local(__result);
+    auto __segment_iterator = _Traits::__segment(__result);
+    while (true) {
+      auto __local_first = _Traits::__begin(__segment_iterator);
+      auto __size        = std::min<_DiffT>(__local_last - __local_first, __last - __first);
+      auto __iter        = std::__move_backward<_AlgPolicy>(__last - __size, __last, __local_last).second;
+      __last -= __size;
+
+      if (__first == __last)
+        return std::make_pair(std::move(__orig_last), _Traits::__compose(__segment_iterator, std::move(__iter)));
+
+      __local_last = _Traits::__end(--__segment_iterator);
+    }
+  }
+};
+
+struct __move_backward_trivial {
+  // At this point, the iterators have been unwrapped so any `contiguous_iterator` has been unwrapped to a pointer.
+  template <class _In, class _Out,
+            __enable_if_t<__can_lower_move_assignment_to_memmove<_In, _Out>::value, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_In*, _Out*>
+  operator()(_In* __first, _In* __last, _Out* __result) const {
+    return std::__copy_backward_trivial_impl(__first, __last, __result);
+  }
+};
+
+template <class _AlgPolicy, class _BidirectionalIterator1, class _Sentinel, class _BidirectionalIterator2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_BidirectionalIterator1, _BidirectionalIterator2>
+__move_backward(_BidirectionalIterator1 __first, _Sentinel __last, _BidirectionalIterator2 __result) {
+  static_assert(std::is_copy_constructible<_BidirectionalIterator1>::value &&
+                std::is_copy_constructible<_BidirectionalIterator1>::value, "Iterators must be copy constructible.");
+
+  return std::__dispatch_copy_or_move<_AlgPolicy, __move_backward_loop<_AlgPolicy>, __move_backward_trivial>(
+      std::move(__first), std::move(__last), std::move(__result));
+}
+
+template <class _BidirectionalIterator1, class _BidirectionalIterator2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _BidirectionalIterator2
+move_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, _BidirectionalIterator2 __result) {
+  return std::__move_backward<_ClassicAlgPolicy>(std::move(__first), std::move(__last), std::move(__result)).second;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___ALGORITHM_MOVE_BACKWARD_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/next_permutation.h b/app/src/main/cpp/libcxx/include/__algorithm/next_permutation.h
new file mode 100644
index 0000000..73e8b99
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/next_permutation.h
@@ -0,0 +1,78 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_NEXT_PERMUTATION_H
+#define _LIBCPP___ALGORITHM_NEXT_PERMUTATION_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/reverse.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Compare, class _BidirectionalIterator, class _Sentinel>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_BidirectionalIterator, bool>
+__next_permutation(_BidirectionalIterator __first, _Sentinel __last, _Compare&& __comp)
+{
+    using _Result = pair<_BidirectionalIterator, bool>;
+
+    _BidirectionalIterator __last_iter = _IterOps<_AlgPolicy>::next(__first, __last);
+    _BidirectionalIterator __i = __last_iter;
+    if (__first == __last || __first == --__i)
+        return _Result(std::move(__last_iter), false);
+
+    while (true)
+    {
+        _BidirectionalIterator __ip1 = __i;
+        if (__comp(*--__i, *__ip1))
+        {
+            _BidirectionalIterator __j = __last_iter;
+            while (!__comp(*__i, *--__j))
+                ;
+            _IterOps<_AlgPolicy>::iter_swap(__i, __j);
+            std::__reverse<_AlgPolicy>(__ip1, __last_iter);
+            return _Result(std::move(__last_iter), true);
+        }
+        if (__i == __first)
+        {
+            std::__reverse<_AlgPolicy>(__first, __last_iter);
+            return _Result(std::move(__last_iter), false);
+        }
+    }
+}
+
+template <class _BidirectionalIterator, class _Compare>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
+{
+  return std::__next_permutation<_ClassicAlgPolicy>(
+      std::move(__first), std::move(__last), static_cast<__comp_ref_type<_Compare> >(__comp)).second;
+}
+
+template <class _BidirectionalIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last)
+{
+    return _VSTD::next_permutation(__first, __last,
+                                  __less<typename iterator_traits<_BidirectionalIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_NEXT_PERMUTATION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/none_of.h b/app/src/main/cpp/libcxx/include/__algorithm/none_of.h
new file mode 100644
index 0000000..19357eb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/none_of.h
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_NONE_OF_H
+#define _LIBCPP___ALGORITHM_NONE_OF_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _Predicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) {
+  for (; __first != __last; ++__first)
+    if (__pred(*__first))
+      return false;
+  return true;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_NONE_OF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/nth_element.h b/app/src/main/cpp/libcxx/include/__algorithm/nth_element.h
new file mode 100644
index 0000000..9fdfb2c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/nth_element.h
@@ -0,0 +1,258 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_NTH_ELEMENT_H
+#define _LIBCPP___ALGORITHM_NTH_ELEMENT_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/sort.h>
+#include <__config>
+#include <__debug>
+#include <__debug_utils/randomize_range.h>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Compare, class _RandomAccessIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 bool
+__nth_element_find_guard(_RandomAccessIterator& __i, _RandomAccessIterator& __j,
+                         _RandomAccessIterator __m, _Compare __comp)
+{
+    // manually guard downward moving __j against __i
+    while (true) {
+        if (__i == --__j) {
+            return false;
+        }
+        if (__comp(*__j, *__m)) {
+            return true;  // found guard for downward moving __j, now use unguarded partition
+        }
+    }
+}
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 void
+__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp)
+{
+    using _Ops = _IterOps<_AlgPolicy>;
+
+    // _Compare is known to be a reference type
+    typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+    const difference_type __limit = 7;
+    while (true)
+    {
+        if (__nth == __last)
+            return;
+        difference_type __len = __last - __first;
+        switch (__len)
+        {
+        case 0:
+        case 1:
+            return;
+        case 2:
+            if (__comp(*--__last, *__first))
+                _Ops::iter_swap(__first, __last);
+            return;
+        case 3:
+            {
+            _RandomAccessIterator __m = __first;
+            std::__sort3<_AlgPolicy, _Compare>(__first, ++__m, --__last, __comp);
+            return;
+            }
+        }
+        if (__len <= __limit)
+        {
+            std::__selection_sort<_AlgPolicy, _Compare>(__first, __last, __comp);
+            return;
+        }
+        // __len > __limit >= 3
+        _RandomAccessIterator __m = __first + __len/2;
+        _RandomAccessIterator __lm1 = __last;
+        unsigned __n_swaps = std::__sort3<_AlgPolicy, _Compare>(__first, __m, --__lm1, __comp);
+        // *__m is median
+        // partition [__first, __m) < *__m and *__m <= [__m, __last)
+        // (this inhibits tossing elements equivalent to __m around unnecessarily)
+        _RandomAccessIterator __i = __first;
+        _RandomAccessIterator __j = __lm1;
+        // j points beyond range to be tested, *__lm1 is known to be <= *__m
+        // The search going up is known to be guarded but the search coming down isn't.
+        // Prime the downward search with a guard.
+        if (!__comp(*__i, *__m))  // if *__first == *__m
+        {
+            // *__first == *__m, *__first doesn't go in first part
+            if (_VSTD::__nth_element_find_guard<_Compare>(__i, __j, __m, __comp)) {
+                _Ops::iter_swap(__i, __j);
+                ++__n_swaps;
+            } else {
+                // *__first == *__m, *__m <= all other elements
+                // Partition instead into [__first, __i) == *__first and *__first < [__i, __last)
+                ++__i;  // __first + 1
+                __j = __last;
+                if (!__comp(*__first, *--__j)) {  // we need a guard if *__first == *(__last-1)
+                    while (true) {
+                        if (__i == __j) {
+                            return;  // [__first, __last) all equivalent elements
+                        } else if (__comp(*__first, *__i)) {
+                            _Ops::iter_swap(__i, __j);
+                            ++__n_swaps;
+                            ++__i;
+                            break;
+                        }
+                        ++__i;
+                    }
+                }
+                // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1
+                if (__i == __j) {
+                    return;
+                }
+                while (true) {
+                    while (!__comp(*__first, *__i))
+                        ++__i;
+                    while (__comp(*__first, *--__j))
+                        ;
+                    if (__i >= __j)
+                        break;
+                    _Ops::iter_swap(__i, __j);
+                    ++__n_swaps;
+                    ++__i;
+                }
+                // [__first, __i) == *__first and *__first < [__i, __last)
+                // The first part is sorted,
+                if (__nth < __i) {
+                    return;
+                }
+                // __nth_element the second part
+                // _VSTD::__nth_element<_Compare>(__i, __nth, __last, __comp);
+                __first = __i;
+                continue;
+            }
+        }
+        ++__i;
+        // j points beyond range to be tested, *__lm1 is known to be <= *__m
+        // if not yet partitioned...
+        if (__i < __j)
+        {
+            // known that *(__i - 1) < *__m
+            while (true)
+            {
+                // __m still guards upward moving __i
+                while (__comp(*__i, *__m))
+                    ++__i;
+                // It is now known that a guard exists for downward moving __j
+                while (!__comp(*--__j, *__m))
+                    ;
+                if (__i >= __j)
+                    break;
+                _Ops::iter_swap(__i, __j);
+                ++__n_swaps;
+                // It is known that __m != __j
+                // If __m just moved, follow it
+                if (__m == __i)
+                    __m = __j;
+                ++__i;
+            }
+        }
+        // [__first, __i) < *__m and *__m <= [__i, __last)
+        if (__i != __m && __comp(*__m, *__i))
+        {
+            _Ops::iter_swap(__i, __m);
+            ++__n_swaps;
+        }
+        // [__first, __i) < *__i and *__i <= [__i+1, __last)
+        if (__nth == __i)
+            return;
+        if (__n_swaps == 0)
+        {
+            // We were given a perfectly partitioned sequence.  Coincidence?
+            if (__nth < __i)
+            {
+                // Check for [__first, __i) already sorted
+                __j = __m = __first;
+                while (true) {
+                    if (++__j == __i) {
+                        // [__first, __i) sorted
+                        return;
+                    }
+                    if (__comp(*__j, *__m)) {
+                        // not yet sorted, so sort
+                        break;
+                    }
+                    __m = __j;
+                }
+            }
+            else
+            {
+                // Check for [__i, __last) already sorted
+                __j = __m = __i;
+                while (true) {
+                    if (++__j == __last) {
+                        // [__i, __last) sorted
+                        return;
+                    }
+                    if (__comp(*__j, *__m)) {
+                        // not yet sorted, so sort
+                        break;
+                    }
+                    __m = __j;
+                }
+            }
+        }
+        // __nth_element on range containing __nth
+        if (__nth < __i)
+        {
+            // _VSTD::__nth_element<_Compare>(__first, __nth, __i, __comp);
+            __last = __i;
+        }
+        else
+        {
+            // _VSTD::__nth_element<_Compare>(__i+1, __nth, __last, __comp);
+            __first = ++__i;
+        }
+    }
+}
+
+template <class _AlgPolicy, class _RandomAccessIterator, class _Compare>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void __nth_element_impl(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last,
+                        _Compare& __comp) {
+  if (__nth == __last)
+    return;
+
+  std::__debug_randomize_range<_AlgPolicy>(__first, __last);
+
+  std::__nth_element<_AlgPolicy, __comp_ref_type<_Compare> >(__first, __nth, __last, __comp);
+
+  std::__debug_randomize_range<_AlgPolicy>(__first, __nth);
+  if (__nth != __last) {
+    std::__debug_randomize_range<_AlgPolicy>(++__nth, __last);
+  }
+}
+
+template <class _RandomAccessIterator, class _Compare>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last,
+                 _Compare __comp) {
+  std::__nth_element_impl<_ClassicAlgPolicy>(std::move(__first), std::move(__nth), std::move(__last), __comp);
+}
+
+template <class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) {
+  std::nth_element(std::move(__first), std::move(__nth), std::move(__last), __less<typename
+      iterator_traits<_RandomAccessIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_NTH_ELEMENT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/partial_sort.h b/app/src/main/cpp/libcxx/include/__algorithm/partial_sort.h
new file mode 100644
index 0000000..e0812af
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/partial_sort.h
@@ -0,0 +1,96 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_PARTIAL_SORT_H
+#define _LIBCPP___ALGORITHM_PARTIAL_SORT_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_heap.h>
+#include <__algorithm/sift_down.h>
+#include <__algorithm/sort_heap.h>
+#include <__config>
+#include <__debug>
+#include <__debug_utils/randomize_range.h>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator, class _Sentinel>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_RandomAccessIterator __partial_sort_impl(
+    _RandomAccessIterator __first, _RandomAccessIterator __middle, _Sentinel __last, _Compare&& __comp) {
+  if (__first == __middle) {
+    return _IterOps<_AlgPolicy>::next(__middle, __last);
+  }
+
+  std::__make_heap<_AlgPolicy>(__first, __middle, __comp);
+
+  typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first;
+  _RandomAccessIterator __i = __middle;
+  for (; __i != __last; ++__i)
+  {
+      if (__comp(*__i, *__first))
+      {
+          _IterOps<_AlgPolicy>::iter_swap(__i, __first);
+          std::__sift_down<_AlgPolicy>(__first, __comp, __len, __first);
+      }
+  }
+  std::__sort_heap<_AlgPolicy>(std::move(__first), std::move(__middle), __comp);
+
+  return __i;
+}
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator, class _Sentinel>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_RandomAccessIterator __partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _Sentinel __last,
+                                     _Compare& __comp) {
+  if (__first == __middle)
+      return _IterOps<_AlgPolicy>::next(__middle, __last);
+
+  std::__debug_randomize_range<_AlgPolicy>(__first, __last);
+
+  auto __last_iter =
+      std::__partial_sort_impl<_AlgPolicy>(__first, __middle, __last, static_cast<__comp_ref_type<_Compare> >(__comp));
+
+  std::__debug_randomize_range<_AlgPolicy>(__middle, __last);
+
+  return __last_iter;
+}
+
+template <class _RandomAccessIterator, class _Compare>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last,
+             _Compare __comp)
+{
+  static_assert(std::is_copy_constructible<_RandomAccessIterator>::value, "Iterators must be copy constructible.");
+  static_assert(std::is_copy_assignable<_RandomAccessIterator>::value, "Iterators must be copy assignable.");
+
+  (void)std::__partial_sort<_ClassicAlgPolicy>(std::move(__first), std::move(__middle), std::move(__last), __comp);
+}
+
+template <class _RandomAccessIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last)
+{
+    _VSTD::partial_sort(__first, __middle, __last,
+                        __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_PARTIAL_SORT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/partial_sort_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/partial_sort_copy.h
new file mode 100644
index 0000000..1aba071
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/partial_sort_copy.h
@@ -0,0 +1,88 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_PARTIAL_SORT_COPY_H
+#define _LIBCPP___ALGORITHM_PARTIAL_SORT_COPY_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_heap.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/sift_down.h>
+#include <__algorithm/sort_heap.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/is_callable.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Compare,
+          class _InputIterator, class _Sentinel1, class _RandomAccessIterator, class _Sentinel2,
+          class _Proj1, class _Proj2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_InputIterator, _RandomAccessIterator>
+__partial_sort_copy(_InputIterator __first, _Sentinel1 __last,
+                    _RandomAccessIterator __result_first, _Sentinel2 __result_last,
+                    _Compare&& __comp, _Proj1&& __proj1, _Proj2&& __proj2)
+{
+    _RandomAccessIterator __r = __result_first;
+    auto&& __projected_comp = std::__make_projected(__comp, __proj2);
+
+    if (__r != __result_last)
+    {
+        for (; __first != __last && __r != __result_last; ++__first, (void) ++__r)
+            *__r = *__first;
+        std::__make_heap<_AlgPolicy>(__result_first, __r, __projected_comp);
+        typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first;
+        for (; __first != __last; ++__first)
+            if (std::__invoke(__comp, std::__invoke(__proj1, *__first), std::__invoke(__proj2, *__result_first))) {
+                *__result_first = *__first;
+                std::__sift_down<_AlgPolicy>(__result_first, __projected_comp, __len, __result_first);
+            }
+        std::__sort_heap<_AlgPolicy>(__result_first, __r, __projected_comp);
+    }
+
+    return pair<_InputIterator, _RandomAccessIterator>(
+        _IterOps<_AlgPolicy>::next(std::move(__first), std::move(__last)), std::move(__r));
+}
+
+template <class _InputIterator, class _RandomAccessIterator, class _Compare>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_RandomAccessIterator
+partial_sort_copy(_InputIterator __first, _InputIterator __last,
+                  _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
+{
+  static_assert(__is_callable<_Compare, decltype(*__first), decltype(*__result_first)>::value,
+                "Comparator has to be callable");
+
+  auto __result = std::__partial_sort_copy<_ClassicAlgPolicy>(__first, __last, __result_first, __result_last,
+      static_cast<__comp_ref_type<_Compare> >(__comp), __identity(), __identity());
+  return __result.second;
+}
+
+template <class _InputIterator, class _RandomAccessIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_RandomAccessIterator
+partial_sort_copy(_InputIterator __first, _InputIterator __last,
+                  _RandomAccessIterator __result_first, _RandomAccessIterator __result_last)
+{
+    return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last,
+                                   __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_PARTIAL_SORT_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/partition.h b/app/src/main/cpp/libcxx/include/__algorithm/partition.h
new file mode 100644
index 0000000..0e094bf
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/partition.h
@@ -0,0 +1,98 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_PARTITION_H
+#define _LIBCPP___ALGORITHM_PARTITION_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Predicate, class _AlgPolicy, class _ForwardIterator, class _Sentinel>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_ForwardIterator, _ForwardIterator>
+__partition_impl(_ForwardIterator __first, _Sentinel __last, _Predicate __pred, forward_iterator_tag)
+{
+    while (true)
+    {
+        if (__first == __last)
+            return std::make_pair(std::move(__first), std::move(__first));
+        if (!__pred(*__first))
+            break;
+        ++__first;
+    }
+
+    _ForwardIterator __p = __first;
+    while (++__p != __last)
+    {
+        if (__pred(*__p))
+        {
+            _IterOps<_AlgPolicy>::iter_swap(__first, __p);
+            ++__first;
+        }
+    }
+    return std::make_pair(std::move(__first), std::move(__p));
+}
+
+template <class _Predicate, class _AlgPolicy, class _BidirectionalIterator, class _Sentinel>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_BidirectionalIterator, _BidirectionalIterator>
+__partition_impl(_BidirectionalIterator __first, _Sentinel __sentinel, _Predicate __pred,
+            bidirectional_iterator_tag)
+{
+    _BidirectionalIterator __original_last = _IterOps<_AlgPolicy>::next(__first, __sentinel);
+    _BidirectionalIterator __last = __original_last;
+
+    while (true)
+    {
+        while (true)
+        {
+            if (__first == __last)
+                return std::make_pair(std::move(__first), std::move(__original_last));
+            if (!__pred(*__first))
+                break;
+            ++__first;
+        }
+        do
+        {
+            if (__first == --__last)
+                return std::make_pair(std::move(__first), std::move(__original_last));
+        } while (!__pred(*__last));
+        _IterOps<_AlgPolicy>::iter_swap(__first, __last);
+        ++__first;
+    }
+}
+
+template <class _AlgPolicy, class _ForwardIterator, class _Sentinel, class _Predicate, class _IterCategory>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+pair<_ForwardIterator, _ForwardIterator> __partition(
+    _ForwardIterator __first, _Sentinel __last, _Predicate&& __pred, _IterCategory __iter_category) {
+  return std::__partition_impl<__remove_cvref_t<_Predicate>&, _AlgPolicy>(
+      std::move(__first), std::move(__last), __pred, __iter_category);
+}
+
+template <class _ForwardIterator, class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_ForwardIterator
+partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
+{
+  using _IterCategory = typename iterator_traits<_ForwardIterator>::iterator_category;
+  auto __result = std::__partition<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __pred, _IterCategory());
+  return __result.first;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_PARTITION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/partition_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/partition_copy.h
new file mode 100644
index 0000000..ff8826a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/partition_copy.h
@@ -0,0 +1,47 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_PARTITION_COPY_H
+#define _LIBCPP___ALGORITHM_PARTITION_COPY_H
+
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _OutputIterator1,
+          class _OutputIterator2, class _Predicate>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_OutputIterator1, _OutputIterator2>
+partition_copy(_InputIterator __first, _InputIterator __last,
+               _OutputIterator1 __out_true, _OutputIterator2 __out_false,
+               _Predicate __pred)
+{
+    for (; __first != __last; ++__first)
+    {
+        if (__pred(*__first))
+        {
+            *__out_true = *__first;
+            ++__out_true;
+        }
+        else
+        {
+            *__out_false = *__first;
+            ++__out_false;
+        }
+    }
+    return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_PARTITION_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/partition_point.h b/app/src/main/cpp/libcxx/include/__algorithm/partition_point.h
new file mode 100644
index 0000000..6ede71a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/partition_point.h
@@ -0,0 +1,48 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_PARTITION_POINT_H
+#define _LIBCPP___ALGORITHM_PARTITION_POINT_H
+
+#include <__algorithm/half_positive.h>
+#include <__config>
+#include <__iterator/advance.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _ForwardIterator, class _Predicate>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+partition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
+{
+    typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type;
+    difference_type __len = _VSTD::distance(__first, __last);
+    while (__len != 0)
+    {
+        difference_type __l2 = _VSTD::__half_positive(__len);
+        _ForwardIterator __m = __first;
+        _VSTD::advance(__m, __l2);
+        if (__pred(*__m))
+        {
+            __first = ++__m;
+            __len -= __l2 + 1;
+        }
+        else
+            __len = __l2;
+    }
+    return __first;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_PARTITION_POINT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/pop_heap.h b/app/src/main/cpp/libcxx/include/__algorithm/pop_heap.h
new file mode 100644
index 0000000..94d32a4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/pop_heap.h
@@ -0,0 +1,73 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_POP_HEAP_H
+#define _LIBCPP___ALGORITHM_POP_HEAP_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/push_heap.h>
+#include <__algorithm/sift_down.h>
+#include <__assert>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+void __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp,
+    typename iterator_traits<_RandomAccessIterator>::difference_type __len) {
+  _LIBCPP_ASSERT(__len > 0, "The heap given to pop_heap must be non-empty");
+
+  __comp_ref_type<_Compare> __comp_ref = __comp;
+
+  using value_type = typename iterator_traits<_RandomAccessIterator>::value_type;
+  if (__len > 1) {
+    value_type __top = _IterOps<_AlgPolicy>::__iter_move(__first);  // create a hole at __first
+    _RandomAccessIterator __hole = std::__floyd_sift_down<_AlgPolicy>(__first, __comp_ref, __len);
+    --__last;
+
+    if (__hole == __last) {
+      *__hole = std::move(__top);
+    } else {
+      *__hole = _IterOps<_AlgPolicy>::__iter_move(__last);
+      ++__hole;
+      *__last = std::move(__top);
+      std::__sift_up<_AlgPolicy>(__first, __hole, __comp_ref, __hole - __first);
+    }
+  }
+}
+
+template <class _RandomAccessIterator, class _Compare>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
+  static_assert(std::is_copy_constructible<_RandomAccessIterator>::value, "Iterators must be copy constructible.");
+  static_assert(std::is_copy_assignable<_RandomAccessIterator>::value, "Iterators must be copy assignable.");
+
+  typename iterator_traits<_RandomAccessIterator>::difference_type __len = __last - __first;
+  std::__pop_heap<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __comp, __len);
+}
+
+template <class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) {
+  std::pop_heap(std::move(__first), std::move(__last),
+      __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_POP_HEAP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/prev_permutation.h b/app/src/main/cpp/libcxx/include/__algorithm/prev_permutation.h
new file mode 100644
index 0000000..0b86ab7
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/prev_permutation.h
@@ -0,0 +1,79 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_PREV_PERMUTATION_H
+#define _LIBCPP___ALGORITHM_PREV_PERMUTATION_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/reverse.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Compare, class _BidirectionalIterator, class _Sentinel>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+pair<_BidirectionalIterator, bool>
+__prev_permutation(_BidirectionalIterator __first, _Sentinel __last, _Compare&& __comp)
+{
+    using _Result = pair<_BidirectionalIterator, bool>;
+
+    _BidirectionalIterator __last_iter = _IterOps<_AlgPolicy>::next(__first, __last);
+    _BidirectionalIterator __i = __last_iter;
+    if (__first == __last || __first == --__i)
+        return _Result(std::move(__last_iter), false);
+
+    while (true)
+    {
+        _BidirectionalIterator __ip1 = __i;
+        if (__comp(*__ip1, *--__i))
+        {
+            _BidirectionalIterator __j = __last_iter;
+            while (!__comp(*--__j, *__i))
+                ;
+            _IterOps<_AlgPolicy>::iter_swap(__i, __j);
+            std::__reverse<_AlgPolicy>(__ip1, __last_iter);
+            return _Result(std::move(__last_iter), true);
+        }
+        if (__i == __first)
+        {
+            std::__reverse<_AlgPolicy>(__first, __last_iter);
+            return _Result(std::move(__last_iter), false);
+        }
+    }
+}
+
+template <class _BidirectionalIterator, class _Compare>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
+{
+  return std::__prev_permutation<_ClassicAlgPolicy>(
+      std::move(__first), std::move(__last), static_cast<__comp_ref_type<_Compare> >(__comp)).second;
+}
+
+template <class _BidirectionalIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last)
+{
+    return _VSTD::prev_permutation(__first, __last,
+                                  __less<typename iterator_traits<_BidirectionalIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_PREV_PERMUTATION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/push_heap.h b/app/src/main/cpp/libcxx/include/__algorithm/push_heap.h
new file mode 100644
index 0000000..9068495
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/push_heap.h
@@ -0,0 +1,77 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_PUSH_HEAP_H
+#define _LIBCPP___ALGORITHM_PUSH_HEAP_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+void __sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp,
+        typename iterator_traits<_RandomAccessIterator>::difference_type __len) {
+  using value_type = typename iterator_traits<_RandomAccessIterator>::value_type;
+
+  if (__len > 1) {
+    __len = (__len - 2) / 2;
+    _RandomAccessIterator __ptr = __first + __len;
+
+    if (__comp(*__ptr, *--__last)) {
+      value_type __t(_IterOps<_AlgPolicy>::__iter_move(__last));
+      do {
+        *__last = _IterOps<_AlgPolicy>::__iter_move(__ptr);
+        __last = __ptr;
+        if (__len == 0)
+          break;
+        __len = (__len - 1) / 2;
+        __ptr = __first + __len;
+      } while (__comp(*__ptr, __t));
+
+      *__last = std::move(__t);
+    }
+  }
+}
+
+template <class _AlgPolicy, class _RandomAccessIterator, class _Compare>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+void __push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) {
+  typename iterator_traits<_RandomAccessIterator>::difference_type __len = __last - __first;
+  std::__sift_up<_AlgPolicy, __comp_ref_type<_Compare> >(std::move(__first), std::move(__last), __comp, __len);
+}
+
+template <class _RandomAccessIterator, class _Compare>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
+  static_assert(std::is_copy_constructible<_RandomAccessIterator>::value, "Iterators must be copy constructible.");
+  static_assert(std::is_copy_assignable<_RandomAccessIterator>::value, "Iterators must be copy assignable.");
+
+  std::__push_heap<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __comp);
+}
+
+template <class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) {
+  std::push_heap(std::move(__first), std::move(__last),
+      __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_PUSH_HEAP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_adjacent_find.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_adjacent_find.h
new file mode 100644
index 0000000..d338d13
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_adjacent_find.h
@@ -0,0 +1,78 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_ADJACENT_FIND_H
+#define _LIBCPP___ALGORITHM_RANGES_ADJACENT_FIND_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __adjacent_find {
+struct __fn {
+
+  template <class _Iter, class _Sent, class _Proj, class _Pred>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  _Iter __adjacent_find_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) {
+    if (__first == __last)
+      return __first;
+
+    auto __i = __first;
+    while (++__i != __last) {
+      if (std::invoke(__pred, std::invoke(__proj, *__first), std::invoke(__proj, *__i)))
+        return __first;
+      __first = __i;
+    }
+    return __i;
+  }
+
+  template <forward_iterator _Iter, sentinel_for<_Iter> _Sent,
+            class _Proj = identity,
+            indirect_binary_predicate<projected<_Iter, _Proj>, projected<_Iter, _Proj>> _Pred = ranges::equal_to>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const {
+    return __adjacent_find_impl(std::move(__first), std::move(__last), __pred, __proj);
+  }
+
+  template <forward_range _Range,
+            class _Proj = identity,
+            indirect_binary_predicate<projected<iterator_t<_Range>, _Proj>,
+                                      projected<iterator_t<_Range>, _Proj>> _Pred = ranges::equal_to>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __range, _Pred __pred = {}, _Proj __proj = {}) const {
+    return __adjacent_find_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
+  }
+};
+} // namespace __adjacent_find
+
+inline namespace __cpo {
+  inline constexpr auto adjacent_find = __adjacent_find::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_ADJACENT_FIND_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_all_of.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_all_of.h
new file mode 100644
index 0000000..e45c4e5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_all_of.h
@@ -0,0 +1,68 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_ALL_OF_H
+#define _LIBCPP___ALGORITHM_RANGES_ALL_OF_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __all_of {
+struct __fn {
+
+  template <class _Iter, class _Sent, class _Proj, class _Pred>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  bool __all_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) {
+    for (; __first != __last; ++__first) {
+      if (!std::invoke(__pred, std::invoke(__proj, *__first)))
+        return false;
+    }
+    return true;
+  }
+
+  template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity,
+            indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const {
+    return __all_of_impl(std::move(__first), std::move(__last), __pred, __proj);
+  }
+
+  template <input_range _Range, class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
+    return __all_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
+  }
+};
+} // namespace __all_of
+
+inline namespace __cpo {
+  inline constexpr auto all_of = __all_of::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_ALL_OF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_any_of.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_any_of.h
new file mode 100644
index 0000000..e7d1e72
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_any_of.h
@@ -0,0 +1,68 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_ANY_OF_H
+#define _LIBCPP___ALGORITHM_RANGES_ANY_OF_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __any_of {
+struct __fn {
+
+  template <class _Iter, class _Sent, class _Proj, class _Pred>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  bool __any_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) {
+    for (; __first != __last; ++__first) {
+      if (std::invoke(__pred, std::invoke(__proj, *__first)))
+        return true;
+    }
+    return false;
+  }
+
+  template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity,
+            indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const {
+    return __any_of_impl(std::move(__first), std::move(__last), __pred, __proj);
+  }
+
+  template <input_range _Range, class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
+    return __any_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
+  }
+};
+} // namespace __any_of
+
+inline namespace __cpo {
+  inline constexpr auto any_of = __any_of::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_ANY_OF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_binary_search.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_binary_search.h
new file mode 100644
index 0000000..b2a8977
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_binary_search.h
@@ -0,0 +1,63 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_BINARY_SEARCH_H
+#define _LIBCPP___ALGORITHM_RANGES_BINARY_SEARCH_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/lower_bound.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __binary_search {
+struct __fn {
+  template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity,
+            indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __ret = std::__lower_bound_impl<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj);
+    return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__first));
+  }
+
+  template <forward_range _Range, class _Type, class _Proj = identity,
+            indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Range&& __r, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __first = ranges::begin(__r);
+    auto __last = ranges::end(__r);
+    auto __ret = std::__lower_bound_impl<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj);
+    return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__first));
+  }
+};
+} // namespace __binary_search
+
+inline namespace __cpo {
+  inline constexpr auto binary_search = __binary_search::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_BINARY_SEARCH_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_clamp.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_clamp.h
new file mode 100644
index 0000000..09a97fc
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_clamp.h
@@ -0,0 +1,65 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_CLAMP_H
+#define _LIBCPP___ALGORITHM_RANGES_CLAMP_H
+
+#include <__assert>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __clamp {
+struct __fn {
+
+  template <class _Type,
+            class _Proj = identity,
+            indirect_strict_weak_order<projected<const _Type*, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  const _Type& operator()(const _Type& __value,
+                          const _Type& __low,
+                          const _Type& __high,
+                          _Comp __comp = {},
+                          _Proj __proj = {}) const {
+    _LIBCPP_ASSERT(!bool(std::invoke(__comp, std::invoke(__proj, __high), std::invoke(__proj, __low))),
+                   "Bad bounds passed to std::ranges::clamp");
+
+    if (std::invoke(__comp, std::invoke(__proj, __value), std::invoke(__proj, __low)))
+      return __low;
+    else if (std::invoke(__comp, std::invoke(__proj, __high), std::invoke(__proj, __value)))
+      return __high;
+    else
+      return __value;
+  }
+
+};
+} // namespace __clamp
+
+inline namespace __cpo {
+  inline constexpr auto clamp = __clamp::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_CLAMP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_copy.h
new file mode 100644
index 0000000..bb02c84
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_copy.h
@@ -0,0 +1,67 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_COPY_H
+#define _LIBCPP___ALGORITHM_RANGES_COPY_H
+
+#include <__algorithm/copy.h>
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__iterator/concepts.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter>
+using copy_result = in_out_result<_InIter, _OutIter>;
+
+namespace __copy {
+struct __fn {
+
+  template <input_iterator _InIter, sentinel_for<_InIter> _Sent, weakly_incrementable _OutIter>
+    requires indirectly_copyable<_InIter, _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  copy_result<_InIter, _OutIter> operator()(_InIter __first, _Sent __last, _OutIter __result) const {
+    auto __ret = std::__copy<_RangeAlgPolicy>(std::move(__first), std::move(__last), std::move(__result));
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+
+  template <input_range _Range, weakly_incrementable _OutIter>
+    requires indirectly_copyable<iterator_t<_Range>, _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  copy_result<borrowed_iterator_t<_Range>, _OutIter> operator()(_Range&& __r, _OutIter __result) const {
+    auto __ret = std::__copy<_RangeAlgPolicy>(ranges::begin(__r), ranges::end(__r), std::move(__result));
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+};
+} // namespace __copy
+
+inline namespace __cpo {
+  inline constexpr auto copy = __copy::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_copy_backward.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_copy_backward.h
new file mode 100644
index 0000000..f41af66
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_copy_backward.h
@@ -0,0 +1,65 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_COPY_BACKWARD_H
+#define _LIBCPP___ALGORITHM_RANGES_COPY_BACKWARD_H
+
+#include <__algorithm/copy_backward.h>
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template<class _Ip, class _Op>
+using copy_backward_result = in_out_result<_Ip, _Op>;
+
+namespace __copy_backward {
+struct __fn {
+
+  template <bidirectional_iterator _InIter1, sentinel_for<_InIter1> _Sent1, bidirectional_iterator _InIter2>
+    requires indirectly_copyable<_InIter1, _InIter2>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  copy_backward_result<_InIter1, _InIter2> operator()(_InIter1 __first, _Sent1 __last, _InIter2 __result) const {
+    auto __ret = std::__copy_backward<_RangeAlgPolicy>(std::move(__first), std::move(__last), std::move(__result));
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+
+  template <bidirectional_range _Range, bidirectional_iterator _Iter>
+    requires indirectly_copyable<iterator_t<_Range>, _Iter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  copy_backward_result<borrowed_iterator_t<_Range>, _Iter> operator()(_Range&& __r, _Iter __result) const {
+    auto __ret = std::__copy_backward<_RangeAlgPolicy>(ranges::begin(__r), ranges::end(__r), std::move(__result));
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+};
+} // namespace __copy_backward
+
+inline namespace __cpo {
+  inline constexpr auto copy_backward = __copy_backward::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_COPY_BACKWARD_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_copy_if.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_copy_if.h
new file mode 100644
index 0000000..dba41c3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_copy_if.h
@@ -0,0 +1,81 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_COPY_IF_H
+#define _LIBCPP___ALGORITHM_RANGES_COPY_IF_H
+
+#include <__algorithm/in_out_result.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template<class _Ip, class _Op>
+using copy_if_result = in_out_result<_Ip, _Op>;
+
+namespace __copy_if {
+struct __fn {
+
+  template <class _InIter, class _Sent, class _OutIter, class _Proj, class _Pred>
+  _LIBCPP_HIDE_FROM_ABI static constexpr
+  copy_if_result <_InIter, _OutIter>
+  __copy_if_impl(_InIter __first, _Sent __last, _OutIter __result, _Pred& __pred, _Proj& __proj) {
+    for (; __first != __last; ++__first) {
+      if (std::invoke(__pred, std::invoke(__proj, *__first))) {
+        *__result = *__first;
+        ++__result;
+      }
+    }
+    return {std::move(__first), std::move(__result)};
+  }
+
+  template <input_iterator _Iter, sentinel_for<_Iter> _Sent, weakly_incrementable _OutIter, class _Proj = identity,
+            indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
+    requires indirectly_copyable<_Iter, _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  copy_if_result<_Iter, _OutIter>
+  operator()(_Iter __first, _Sent __last, _OutIter __result, _Pred __pred, _Proj __proj = {}) const {
+    return __copy_if_impl(std::move(__first), std::move(__last), std::move(__result), __pred, __proj);
+  }
+
+  template <input_range _Range, weakly_incrementable _OutIter, class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+    requires indirectly_copyable<iterator_t<_Range>, _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  copy_if_result<borrowed_iterator_t<_Range>, _OutIter>
+  operator()(_Range&& __r, _OutIter __result, _Pred __pred, _Proj __proj = {}) const {
+    return __copy_if_impl(ranges::begin(__r), ranges::end(__r), std::move(__result), __pred, __proj);
+  }
+};
+} // namespace __copy_if
+
+inline namespace __cpo {
+  inline constexpr auto copy_if = __copy_if::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_COPY_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_copy_n.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_copy_n.h
new file mode 100644
index 0000000..04bb80b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_copy_n.h
@@ -0,0 +1,77 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_COPY_N_H
+#define _LIBCPP___ALGORITHM_RANGES_COPY_N_H
+
+#include <__algorithm/copy.h>
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/ranges_copy.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/unreachable_sentinel.h>
+#include <__iterator/wrap_iter.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+template <class _Ip, class _Op>
+using copy_n_result = in_out_result<_Ip, _Op>;
+
+namespace __copy_n {
+struct __fn {
+
+  template <class _InIter, class _DiffType, class _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  copy_n_result<_InIter, _OutIter> __go(_InIter __first, _DiffType __n, _OutIter __result) {
+    while (__n != 0) {
+      *__result = *__first;
+      ++__first;
+      ++__result;
+      --__n;
+    }
+    return {std::move(__first), std::move(__result)};
+  }
+
+  template <random_access_iterator _InIter, class _DiffType, random_access_iterator _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  copy_n_result<_InIter, _OutIter> __go(_InIter __first, _DiffType __n, _OutIter __result) {
+    auto __ret = std::__copy<_RangeAlgPolicy>(__first, __first + __n, __result);
+    return {__ret.first, __ret.second};
+  }
+
+  template <input_iterator _Ip, weakly_incrementable _Op>
+    requires indirectly_copyable<_Ip, _Op>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  copy_n_result<_Ip, _Op> operator()(_Ip __first, iter_difference_t<_Ip> __n, _Op __result) const {
+    return __go(std::move(__first), __n, std::move(__result));
+  }
+};
+} // namespace __copy_n
+
+inline namespace __cpo {
+  inline constexpr auto copy_n = __copy_n::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_RANGES_COPY_N_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_count.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_count.h
new file mode 100644
index 0000000..527dd06
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_count.h
@@ -0,0 +1,62 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_COUNT_H
+#define _LIBCPP___ALGORITHM_RANGES_COUNT_H
+
+#include <__algorithm/ranges_count_if.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __count {
+struct __fn {
+  template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity>
+    requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  iter_difference_t<_Iter> operator()(_Iter __first, _Sent __last, const _Type& __value, _Proj __proj = {}) const {
+    auto __pred = [&](auto&& __e) { return __e == __value; };
+    return ranges::__count_if_impl(std::move(__first), std::move(__last), __pred, __proj);
+  }
+
+  template <input_range _Range, class _Type, class _Proj = identity>
+    requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  range_difference_t<_Range> operator()(_Range&& __r, const _Type& __value, _Proj __proj = {}) const {
+    auto __pred = [&](auto&& __e) { return __e == __value; };
+    return ranges::__count_if_impl(ranges::begin(__r), ranges::end(__r), __pred, __proj);
+  }
+};
+} // namespace __count
+
+inline namespace __cpo {
+  inline constexpr auto count = __count::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_COUNT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_count_if.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_count_if.h
new file mode 100644
index 0000000..931618b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_count_if.h
@@ -0,0 +1,72 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_COUNT_IF_H
+#define _LIBCPP___ALGORITHM_RANGES_COUNT_IF_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+template <class _Iter, class _Sent, class _Proj, class _Pred>
+_LIBCPP_HIDE_FROM_ABI constexpr
+iter_difference_t<_Iter> __count_if_impl(_Iter __first, _Sent __last,
+                                             _Pred& __pred, _Proj& __proj) {
+  iter_difference_t<_Iter> __counter(0);
+  for (; __first != __last; ++__first) {
+    if (std::invoke(__pred, std::invoke(__proj, *__first)))
+      ++__counter;
+  }
+  return __counter;
+}
+
+namespace __count_if {
+struct __fn {
+  template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity,
+            indirect_unary_predicate<projected<_Iter, _Proj>> _Predicate>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  iter_difference_t<_Iter> operator()(_Iter __first, _Sent __last, _Predicate __pred, _Proj __proj = {}) const {
+    return ranges::__count_if_impl(std::move(__first), std::move(__last), __pred, __proj);
+  }
+
+  template <input_range _Range, class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Predicate>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  range_difference_t<_Range> operator()(_Range&& __r, _Predicate __pred, _Proj __proj = {}) const {
+    return ranges::__count_if_impl(ranges::begin(__r), ranges::end(__r), __pred, __proj);
+  }
+};
+} // namespace __count_if
+
+inline namespace __cpo {
+  inline constexpr auto count_if = __count_if::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_COUNT_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_equal.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_equal.h
new file mode 100644
index 0000000..3c417f0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_equal.h
@@ -0,0 +1,115 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_EQUAL_H
+#define _LIBCPP___ALGORITHM_RANGES_EQUAL_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/distance.h>
+#include <__iterator/indirectly_comparable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __equal {
+struct __fn {
+private:
+  template <class _Iter1, class _Sent1,
+            class _Iter2, class _Sent2,
+            class _Pred,
+            class _Proj1,
+            class _Proj2>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  bool __equal_impl(_Iter1 __first1, _Sent1 __last1,
+                    _Iter2 __first2, _Sent2 __last2,
+                    _Pred& __pred,
+                    _Proj1& __proj1,
+                    _Proj2& __proj2) {
+    while (__first1 != __last1 && __first2 != __last2) {
+      if (!std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2)))
+        return false;
+      ++__first1;
+      ++__first2;
+    }
+    return __first1 == __last1 && __first2 == __last2;
+  }
+
+public:
+
+  template <input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
+            input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
+            class _Pred = ranges::equal_to,
+            class _Proj1 = identity,
+            class _Proj2 = identity>
+    requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Iter1 __first1, _Sent1 __last1,
+                  _Iter2 __first2, _Sent2 __last2,
+                  _Pred __pred = {},
+                  _Proj1 __proj1 = {},
+                  _Proj2 __proj2 = {}) const {
+    if constexpr (sized_sentinel_for<_Sent1, _Iter1> && sized_sentinel_for<_Sent2, _Iter2>) {
+      if (__last1 - __first1 != __last2 - __first2)
+        return false;
+    }
+    return __equal_impl(std::move(__first1), std::move(__last1),
+                        std::move(__first2), std::move(__last2),
+                        __pred,
+                        __proj1,
+                        __proj2);
+  }
+
+  template <input_range _Range1,
+            input_range _Range2,
+            class _Pred = ranges::equal_to,
+            class _Proj1 = identity,
+            class _Proj2 = identity>
+    requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Range1&& __range1,
+                  _Range2&& __range2,
+                  _Pred __pred = {},
+                  _Proj1 __proj1 = {},
+                  _Proj2 __proj2 = {}) const {
+    if constexpr (sized_range<_Range1> && sized_range<_Range2>) {
+      if (ranges::distance(__range1) != ranges::distance(__range2))
+        return false;
+    }
+    return __equal_impl(ranges::begin(__range1), ranges::end(__range1),
+                        ranges::begin(__range2), ranges::end(__range2),
+                        __pred,
+                        __proj1,
+                        __proj2);
+    return false;
+  }
+};
+} // namespace __equal
+
+inline namespace __cpo {
+  inline constexpr auto equal = __equal::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_EQUAL_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_equal_range.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_equal_range.h
new file mode 100644
index 0000000..94dc058
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_equal_range.h
@@ -0,0 +1,78 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM __project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_EQUAL_RANGE_H
+#define _LIBCPP___ALGORITHM_RANGES_EQUAL_RANGE_H
+
+#include <__algorithm/equal_range.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__ranges/subrange.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __equal_range {
+
+struct __fn {
+  template <
+      forward_iterator _Iter,
+      sentinel_for<_Iter> _Sent,
+      class _Tp,
+      class _Proj                                                           = identity,
+      indirect_strict_weak_order<const _Tp*, projected<_Iter, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr subrange<_Iter>
+  operator()(_Iter __first, _Sent __last, const _Tp& __value, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __ret = std::__equal_range<_RangeAlgPolicy>(
+        std::move(__first), std::move(__last), __value, __comp, __proj);
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+
+  template <
+      forward_range _Range,
+      class _Tp,
+      class _Proj                                                                        = identity,
+      indirect_strict_weak_order<const _Tp*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr borrowed_subrange_t<_Range>
+  operator()(_Range&& __range, const _Tp& __value, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __ret = std::__equal_range<_RangeAlgPolicy>(
+        ranges::begin(__range), ranges::end(__range), __value, __comp, __proj);
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+};
+
+} // namespace __equal_range
+
+inline namespace __cpo {
+  inline constexpr auto equal_range = __equal_range::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_EQUAL_RANGE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_fill.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_fill.h
new file mode 100644
index 0000000..6ebc2bd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_fill.h
@@ -0,0 +1,59 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_FILL_H
+#define _LIBCPP___ALGORITHM_RANGES_FILL_H
+
+#include <__algorithm/ranges_fill_n.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __fill {
+struct __fn {
+  template <class _Type, output_iterator<const _Type&> _Iter, sentinel_for<_Iter> _Sent>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, const _Type& __value) const {
+    if constexpr(random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter>) {
+      return ranges::fill_n(__first, __last - __first, __value);
+    } else {
+      for (; __first != __last; ++__first)
+        *__first = __value;
+      return __first;
+    }
+  }
+
+  template <class _Type, output_range<const _Type&> _Range>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __range, const _Type& __value) const {
+    return (*this)(ranges::begin(__range), ranges::end(__range), __value);
+  }
+};
+} // namespace __fill
+
+inline namespace __cpo {
+  inline constexpr auto fill = __fill::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_FILL_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_fill_n.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_fill_n.h
new file mode 100644
index 0000000..a2660e8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_fill_n.h
@@ -0,0 +1,48 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_FILL_N_H
+#define _LIBCPP___ALGORITHM_RANGES_FILL_N_H
+
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __fill_n {
+struct __fn {
+  template <class _Type, output_iterator<const _Type&> _Iter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, iter_difference_t<_Iter> __n, const _Type& __value) const {
+    for (; __n != 0; --__n) {
+      *__first = __value;
+      ++__first;
+    }
+    return __first;
+  }
+};
+} // namespace __fill_n
+
+inline namespace __cpo {
+  inline constexpr auto fill_n = __fill_n::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_FILL_N_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_find.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_find.h
new file mode 100644
index 0000000..580c2a1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_find.h
@@ -0,0 +1,63 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_FIND_H
+#define _LIBCPP___ALGORITHM_RANGES_FIND_H
+
+#include <__algorithm/ranges_find_if.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __find {
+struct __fn {
+  template <input_iterator _Ip, sentinel_for<_Ip> _Sp, class _Tp, class _Proj = identity>
+    requires indirect_binary_predicate<ranges::equal_to, projected<_Ip, _Proj>, const _Tp*>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Ip operator()(_Ip __first, _Sp __last, const _Tp& __value, _Proj __proj = {}) const {
+    auto __pred = [&](auto&& __e) { return std::forward<decltype(__e)>(__e) == __value; };
+    return ranges::__find_if_impl(std::move(__first), std::move(__last), __pred, __proj);
+  }
+
+  template <input_range _Rp, class _Tp, class _Proj = identity>
+    requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Rp>, _Proj>, const _Tp*>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Rp> operator()(_Rp&& __r, const _Tp& __value, _Proj __proj = {}) const {
+    auto __pred = [&](auto&& __e) { return std::forward<decltype(__e)>(__e) == __value; };
+    return ranges::__find_if_impl(ranges::begin(__r), ranges::end(__r), __pred, __proj);
+  }
+};
+} // namespace __find
+
+inline namespace __cpo {
+  inline constexpr auto find = __find::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_FIND_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_find_end.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_find_end.h
new file mode 100644
index 0000000..ea36f4d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_find_end.h
@@ -0,0 +1,98 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_FIND_END_H
+#define _LIBCPP___ALGORITHM_RANGES_FIND_END_H
+
+#include <__algorithm/find_end.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/ranges_iterator_concept.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/indirectly_comparable.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/subrange.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __find_end {
+struct __fn {
+  template <forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
+            forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
+            class _Pred = ranges::equal_to,
+            class _Proj1 = identity,
+            class _Proj2 = identity>
+    requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  subrange<_Iter1> operator()(_Iter1 __first1, _Sent1 __last1,
+                              _Iter2 __first2, _Sent2 __last2,
+                              _Pred __pred = {},
+                              _Proj1 __proj1 = {},
+                              _Proj2 __proj2 = {}) const {
+    auto __ret = std::__find_end_impl<_RangeAlgPolicy>(
+        __first1,
+        __last1,
+        __first2,
+        __last2,
+        __pred,
+        __proj1,
+        __proj2,
+        __iterator_concept<_Iter1>(),
+        __iterator_concept<_Iter2>());
+    return {__ret.first, __ret.second};
+  }
+
+  template <forward_range _Range1,
+            forward_range _Range2,
+            class _Pred = ranges::equal_to,
+            class _Proj1 = identity,
+            class _Proj2 = identity>
+    requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_subrange_t<_Range1> operator()(_Range1&& __range1,
+                                          _Range2&& __range2,
+                                          _Pred __pred = {},
+                                          _Proj1 __proj1 = {},
+                                          _Proj2 __proj2 = {}) const {
+    auto __ret = std::__find_end_impl<_RangeAlgPolicy>(
+        ranges::begin(__range1),
+        ranges::end(__range1),
+        ranges::begin(__range2),
+        ranges::end(__range2),
+        __pred,
+        __proj1,
+        __proj2,
+        __iterator_concept<iterator_t<_Range1>>(),
+        __iterator_concept<iterator_t<_Range2>>());
+    return {__ret.first, __ret.second};
+  }
+};
+} // namespace __find_end
+
+inline namespace __cpo {
+  inline constexpr auto find_end = __find_end::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_FIND_END_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_find_first_of.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_find_first_of.h
new file mode 100644
index 0000000..9d66e75
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_find_first_of.h
@@ -0,0 +1,101 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_FIND_FIRST_OF_H
+#define _LIBCPP___ALGORITHM_RANGES_FIND_FIRST_OF_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/indirectly_comparable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __find_first_of {
+struct __fn {
+
+  template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class _Proj2>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  _Iter1 __find_first_of_impl(_Iter1 __first1, _Sent1 __last1,
+                              _Iter2 __first2, _Sent2 __last2,
+                              _Pred& __pred,
+                              _Proj1& __proj1,
+                              _Proj2& __proj2) {
+    for (; __first1 != __last1; ++__first1) {
+      for (auto __j = __first2; __j != __last2; ++__j) {
+        if (std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__j)))
+          return __first1;
+      }
+    }
+    return __first1;
+  }
+
+  template <input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
+            forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
+            class _Pred = ranges::equal_to,
+            class _Proj1 = identity,
+            class _Proj2 = identity>
+    requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter1 operator()(_Iter1 __first1, _Sent1 __last1,
+                    _Iter2 __first2, _Sent2 __last2,
+                    _Pred __pred = {},
+                    _Proj1 __proj1 = {},
+                    _Proj2 __proj2 = {}) const {
+    return __find_first_of_impl(std::move(__first1), std::move(__last1),
+                                std::move(__first2), std::move(__last2),
+                                __pred,
+                                __proj1,
+                                __proj2);
+  }
+
+  template <input_range _Range1,
+            forward_range _Range2,
+            class _Pred = ranges::equal_to,
+            class _Proj1 = identity,
+            class _Proj2 = identity>
+    requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range1> operator()(_Range1&& __range1,
+                                          _Range2&& __range2,
+                                          _Pred __pred = {},
+                                          _Proj1 __proj1 = {},
+                                          _Proj2 __proj2 = {}) const {
+    return __find_first_of_impl(ranges::begin(__range1), ranges::end(__range1),
+                                ranges::begin(__range2), ranges::end(__range2),
+                                __pred,
+                                __proj1,
+                                __proj2);
+  }
+
+};
+} // namespace __find_first_of
+
+inline namespace __cpo {
+  inline constexpr auto find_first_of = __find_first_of::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_FIND_FIRST_OF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_find_if.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_find_if.h
new file mode 100644
index 0000000..45ce6e4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_find_if.h
@@ -0,0 +1,71 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_FIND_IF_H
+#define _LIBCPP___ALGORITHM_RANGES_FIND_IF_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _Ip, class _Sp, class _Pred, class _Proj>
+_LIBCPP_HIDE_FROM_ABI static constexpr
+_Ip __find_if_impl(_Ip __first, _Sp __last, _Pred& __pred, _Proj& __proj) {
+  for (; __first != __last; ++__first) {
+    if (std::invoke(__pred, std::invoke(__proj, *__first)))
+      break;
+  }
+  return __first;
+}
+
+namespace __find_if {
+struct __fn {
+
+  template <input_iterator _Ip, sentinel_for<_Ip> _Sp, class _Proj = identity,
+            indirect_unary_predicate<projected<_Ip, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Ip operator()(_Ip __first, _Sp __last, _Pred __pred, _Proj __proj = {}) const {
+    return ranges::__find_if_impl(std::move(__first), std::move(__last), __pred, __proj);
+  }
+
+  template <input_range _Rp, class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Rp>, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Rp> operator()(_Rp&& __r, _Pred __pred, _Proj __proj = {}) const {
+    return ranges::__find_if_impl(ranges::begin(__r), ranges::end(__r), __pred, __proj);
+  }
+};
+} // namespace __find_if
+
+inline namespace __cpo {
+  inline constexpr auto find_if = __find_if::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_FIND_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_find_if_not.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_find_if_not.h
new file mode 100644
index 0000000..3dd1213
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_find_if_not.h
@@ -0,0 +1,63 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_FIND_IF_NOT_H
+#define _LIBCPP___ALGORITHM_RANGES_FIND_IF_NOT_H
+
+#include <__algorithm/ranges_find_if.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __find_if_not {
+struct __fn {
+  template <input_iterator _Ip, sentinel_for<_Ip> _Sp, class _Proj = identity,
+            indirect_unary_predicate<projected<_Ip, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Ip operator()(_Ip __first, _Sp __last, _Pred __pred, _Proj __proj = {}) const {
+    auto __pred2 = [&](auto&& __e) { return !std::invoke(__pred, std::forward<decltype(__e)>(__e)); };
+    return ranges::__find_if_impl(std::move(__first), std::move(__last), __pred2, __proj);
+  }
+
+  template <input_range _Rp, class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Rp>, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Rp> operator()(_Rp&& __r, _Pred __pred, _Proj __proj = {}) const {
+    auto __pred2 = [&](auto&& __e) { return !std::invoke(__pred, std::forward<decltype(__e)>(__e)); };
+    return ranges::__find_if_impl(ranges::begin(__r), ranges::end(__r), __pred2, __proj);
+  }
+};
+} // namespace __find_if_not
+
+inline namespace __cpo {
+  inline constexpr auto find_if_not = __find_if_not::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_FIND_IF_NOT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_for_each.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_for_each.h
new file mode 100644
index 0000000..0c70c05
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_for_each.h
@@ -0,0 +1,78 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_FOR_EACH_H
+#define _LIBCPP___ALGORITHM_RANGES_FOR_EACH_H
+
+#include <__algorithm/in_fun_result.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _Iter, class _Func>
+using for_each_result = in_fun_result<_Iter, _Func>;
+
+namespace __for_each {
+struct __fn {
+private:
+  template <class _Iter, class _Sent, class _Proj, class _Func>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  for_each_result<_Iter, _Func> __for_each_impl(_Iter __first, _Sent __last, _Func& __func, _Proj& __proj) {
+    for (; __first != __last; ++__first)
+      std::invoke(__func, std::invoke(__proj, *__first));
+    return {std::move(__first), std::move(__func)};
+  }
+
+public:
+  template <input_iterator _Iter, sentinel_for<_Iter> _Sent,
+            class _Proj = identity,
+            indirectly_unary_invocable<projected<_Iter, _Proj>> _Func>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  for_each_result<_Iter, _Func> operator()(_Iter __first, _Sent __last, _Func __func, _Proj __proj = {}) const {
+    return __for_each_impl(std::move(__first), std::move(__last), __func, __proj);
+  }
+
+  template <input_range _Range,
+            class _Proj = identity,
+            indirectly_unary_invocable<projected<iterator_t<_Range>, _Proj>> _Func>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  for_each_result<borrowed_iterator_t<_Range>, _Func> operator()(_Range&& __range,
+                                                                 _Func __func,
+                                                                 _Proj __proj = {}) const {
+    return __for_each_impl(ranges::begin(__range), ranges::end(__range), __func, __proj);
+  }
+
+};
+} // namespace __for_each
+
+inline namespace __cpo {
+  inline constexpr auto for_each = __for_each::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_FOR_EACH_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_for_each_n.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_for_each_n.h
new file mode 100644
index 0000000..261816a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_for_each_n.h
@@ -0,0 +1,66 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_FOR_EACH_N_H
+#define _LIBCPP___ALGORITHM_RANGES_FOR_EACH_N_H
+
+#include <__algorithm/in_fun_result.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/projected.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _Iter, class _Func>
+using for_each_n_result = in_fun_result<_Iter, _Func>;
+
+namespace __for_each_n {
+struct __fn {
+
+  template <input_iterator _Iter,
+            class _Proj = identity,
+            indirectly_unary_invocable<projected<_Iter, _Proj>> _Func>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  for_each_n_result<_Iter, _Func> operator()(_Iter __first,
+                                             iter_difference_t<_Iter> __count,
+                                             _Func __func,
+                                             _Proj __proj = {}) const {
+    while (__count-- > 0) {
+      std::invoke(__func, std::invoke(__proj, *__first));
+      ++__first;
+    }
+    return {std::move(__first), std::move(__func)};
+  }
+
+};
+} // namespace __for_each_n
+
+inline namespace __cpo {
+  inline constexpr auto for_each_n = __for_each_n::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_FOR_EACH_N_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_generate.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_generate.h
new file mode 100644
index 0000000..ae486ae
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_generate.h
@@ -0,0 +1,73 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_GENERATE_H
+#define _LIBCPP___ALGORITHM_RANGES_GENERATE_H
+
+#include <__concepts/constructible.h>
+#include <__concepts/invocable.h>
+#include <__config>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __generate {
+
+struct __fn {
+
+  template <class _OutIter, class _Sent, class _Func>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  static _OutIter __generate_fn_impl(_OutIter __first, _Sent __last, _Func& __gen) {
+    for (; __first != __last; ++__first) {
+      *__first = __gen();
+    }
+
+    return __first;
+  }
+
+  template <input_or_output_iterator _OutIter, sentinel_for<_OutIter> _Sent, copy_constructible _Func>
+  requires invocable<_Func&> && indirectly_writable<_OutIter, invoke_result_t<_Func&>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _OutIter operator()(_OutIter __first, _Sent __last, _Func __gen) const {
+    return __generate_fn_impl(std::move(__first), std::move(__last), __gen);
+  }
+
+  template <class _Range, copy_constructible _Func>
+  requires invocable<_Func&> && output_range<_Range, invoke_result_t<_Func&>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __range, _Func __gen) const {
+    return __generate_fn_impl(ranges::begin(__range), ranges::end(__range), __gen);
+  }
+
+};
+
+} // namespace __generate
+
+inline namespace __cpo {
+  inline constexpr auto generate = __generate::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_GENERATE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_generate_n.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_generate_n.h
new file mode 100644
index 0000000..e625e3a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_generate_n.h
@@ -0,0 +1,62 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_GENERATE_N_H
+#define _LIBCPP___ALGORITHM_RANGES_GENERATE_N_H
+
+#include <__concepts/constructible.h>
+#include <__concepts/invocable.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __generate_n {
+
+struct __fn {
+
+  template <input_or_output_iterator _OutIter, copy_constructible _Func>
+  requires invocable<_Func&> && indirectly_writable<_OutIter, invoke_result_t<_Func&>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _OutIter operator()(_OutIter __first, iter_difference_t<_OutIter> __n, _Func __gen) const {
+    for (; __n > 0; --__n) {
+      *__first = __gen();
+      ++__first;
+    }
+
+    return __first;
+  }
+
+};
+
+} // namespace __generate_n
+
+inline namespace __cpo {
+  inline constexpr auto generate_n = __generate_n::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_GENERATE_N_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_includes.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_includes.h
new file mode 100644
index 0000000..8438117
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_includes.h
@@ -0,0 +1,95 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_INCLUDES_H
+#define _LIBCPP___ALGORITHM_RANGES_INCLUDES_H
+
+#include <__algorithm/includes.h>
+#include <__algorithm/make_projected.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __includes {
+
+struct __fn {
+  template <
+      input_iterator _Iter1,
+      sentinel_for<_Iter1> _Sent1,
+      input_iterator _Iter2,
+      sentinel_for<_Iter2> _Sent2,
+      class _Proj1                                                                           = identity,
+      class _Proj2                                                                           = identity,
+      indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(
+      _Iter1 __first1,
+      _Sent1 __last1,
+      _Iter2 __first2,
+      _Sent2 __last2,
+      _Comp __comp   = {},
+      _Proj1 __proj1 = {},
+      _Proj2 __proj2 = {}) const {
+    return std::__includes(
+        std::move(__first1),
+        std::move(__last1),
+        std::move(__first2),
+        std::move(__last2),
+        std::move(__comp),
+        std::move(__proj1),
+        std::move(__proj2));
+  }
+
+  template <
+      input_range _Range1,
+      input_range _Range2,
+      class _Proj1 = identity,
+      class _Proj2 = identity,
+      indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, _Proj2>>
+          _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(
+      _Range1&& __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
+    return std::__includes(
+        ranges::begin(__range1),
+        ranges::end(__range1),
+        ranges::begin(__range2),
+        ranges::end(__range2),
+        std::move(__comp),
+        std::move(__proj1),
+        std::move(__proj2));
+  }
+};
+
+} // namespace __includes
+
+inline namespace __cpo {
+  inline constexpr auto includes = __includes::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_INCLUDES_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_inplace_merge.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_inplace_merge.h
new file mode 100644
index 0000000..88171a6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_inplace_merge.h
@@ -0,0 +1,85 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_INPLACE_MERGE_H
+#define _LIBCPP___ALGORITHM_RANGES_INPLACE_MERGE_H
+
+#include <__algorithm/inplace_merge.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/projected.h>
+#include <__iterator/sortable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __inplace_merge {
+
+  struct __fn {
+    template <class _Iter, class _Sent, class _Comp, class _Proj>
+    _LIBCPP_HIDE_FROM_ABI static constexpr auto
+    __inplace_merge_impl(_Iter __first, _Iter __middle, _Sent __last, _Comp&& __comp, _Proj&& __proj) {
+      auto __last_iter = ranges::next(__middle, __last);
+      std::__inplace_merge<_RangeAlgPolicy>(
+          std::move(__first), std::move(__middle), __last_iter, std::__make_projected(__comp, __proj));
+      return __last_iter;
+    }
+
+    template <
+        bidirectional_iterator _Iter,
+        sentinel_for<_Iter> _Sent,
+        class _Comp = ranges::less,
+        class _Proj = identity>
+      requires sortable<_Iter, _Comp, _Proj>
+    _LIBCPP_HIDE_FROM_ABI _Iter
+    operator()(_Iter __first, _Iter __middle, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+      return __inplace_merge_impl(
+          std::move(__first), std::move(__middle), std::move(__last), std::move(__comp), std::move(__proj));
+    }
+
+    template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
+      requires sortable<
+          iterator_t<_Range>,
+          _Comp,
+          _Proj> _LIBCPP_HIDE_FROM_ABI borrowed_iterator_t<_Range>
+      operator()(_Range&& __range, iterator_t<_Range> __middle, _Comp __comp = {}, _Proj __proj = {}) const {
+      return __inplace_merge_impl(
+          ranges::begin(__range), std::move(__middle), ranges::end(__range), std::move(__comp), std::move(__proj));
+    }
+  };
+
+} // namespace __inplace_merge
+
+inline namespace __cpo {
+  inline constexpr auto inplace_merge = __inplace_merge::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_INPLACE_MERGE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_heap.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_heap.h
new file mode 100644
index 0000000..a16c075
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_heap.h
@@ -0,0 +1,74 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_IS_HEAP_H
+#define _LIBCPP___ALGORITHM_RANGES_IS_HEAP_H
+
+#include <__algorithm/is_heap_until.h>
+#include <__algorithm/make_projected.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __is_heap {
+
+struct __fn {
+
+  template <class _Iter, class _Sent, class _Proj, class _Comp>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  static bool __is_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
+    auto __last_iter = ranges::next(__first, __last);
+    auto&& __projected_comp = std::__make_projected(__comp, __proj);
+
+    auto __result = std::__is_heap_until(std::move(__first), std::move(__last_iter), __projected_comp);
+    return __result == __last;
+  }
+
+  template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity,
+            indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __is_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
+  }
+
+  template <random_access_range _Range, class _Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __is_heap_fn_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
+  }
+};
+
+} // namespace __is_heap
+
+inline namespace __cpo {
+  inline constexpr auto is_heap = __is_heap::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_IS_HEAP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_heap_until.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_heap_until.h
new file mode 100644
index 0000000..8c8dac5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_heap_until.h
@@ -0,0 +1,75 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_IS_HEAP_UNTIL_H
+#define _LIBCPP___ALGORITHM_RANGES_IS_HEAP_UNTIL_H
+
+#include <__algorithm/is_heap_until.h>
+#include <__algorithm/make_projected.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __is_heap_until {
+
+struct __fn {
+
+  template <class _Iter, class _Sent, class _Proj, class _Comp>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  static _Iter __is_heap_until_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
+    auto __last_iter = ranges::next(__first, __last);
+    auto&& __projected_comp = std::__make_projected(__comp, __proj);
+
+    return std::__is_heap_until(std::move(__first), std::move(__last_iter), __projected_comp);
+  }
+
+  template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity,
+            indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __is_heap_until_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
+  }
+
+  template <random_access_range _Range, class _Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __is_heap_until_fn_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
+  }
+
+};
+
+} // namespace __is_heap_until
+
+inline namespace __cpo {
+  inline constexpr auto is_heap_until = __is_heap_until::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_IS_HEAP_UNTIL_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_partitioned.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_partitioned.h
new file mode 100644
index 0000000..b903953
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_partitioned.h
@@ -0,0 +1,81 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_IS_PARTITIONED_H
+#define _LIBCPP___ALGORITHM_RANGES_IS_PARTITIONED_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/indirectly_comparable.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __is_partitioned {
+struct __fn {
+
+  template <class _Iter, class _Sent, class _Proj, class _Pred>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  bool __is_parititioned_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) {
+    for (; __first != __last; ++__first) {
+      if (!std::invoke(__pred, std::invoke(__proj, *__first)))
+        break;
+    }
+
+    if (__first == __last)
+      return true;
+    ++__first;
+
+    for (; __first != __last; ++__first) {
+      if (std::invoke(__pred, std::invoke(__proj, *__first)))
+        return false;
+    }
+
+    return true;
+  }
+
+  template <input_iterator _Iter, sentinel_for<_Iter> _Sent,
+            class _Proj = identity,
+            indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const {
+    return __is_parititioned_impl(std::move(__first), std::move(__last), __pred, __proj);
+  }
+
+  template <input_range _Range,
+            class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
+    return __is_parititioned_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
+  }
+};
+} // namespace __is_partitioned
+
+inline namespace __cpo {
+  inline constexpr auto is_partitioned = __is_partitioned::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_IS_PARTITIONED_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_permutation.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_permutation.h
new file mode 100644
index 0000000..b617500
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_permutation.h
@@ -0,0 +1,89 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_IS_PERMUTATION_H
+#define _LIBCPP___ALGORITHM_RANGES_IS_PERMUTATION_H
+
+#include <__algorithm/is_permutation.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/distance.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __is_permutation {
+struct __fn {
+
+  template <class _Iter1, class _Sent1, class _Iter2, class _Sent2,
+            class _Proj1, class _Proj2, class _Pred>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  bool __is_permutation_func_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2,
+                                  _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) {
+    return std::__is_permutation<_RangeAlgPolicy>(
+        std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2),
+        __pred, __proj1, __proj2);
+  }
+
+  template <forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
+            forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
+            class _Proj1 = identity,
+            class _Proj2 = identity,
+            indirect_equivalence_relation<projected<_Iter1, _Proj1>,
+                                          projected<_Iter2, _Proj2>> _Pred = ranges::equal_to>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2,
+                  _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
+    return __is_permutation_func_impl(
+        std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2),
+        __pred, __proj1, __proj2);
+  }
+
+  template <forward_range _Range1,
+            forward_range _Range2,
+            class _Proj1 = identity,
+            class _Proj2 = identity,
+            indirect_equivalence_relation<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, _Proj2>> _Pred = ranges::equal_to>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Range1&& __range1, _Range2&& __range2,
+                  _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
+    if constexpr (sized_range<_Range1> && sized_range<_Range2>) {
+      if (ranges::distance(__range1) != ranges::distance(__range2))
+        return false;
+    }
+
+    return __is_permutation_func_impl(
+        ranges::begin(__range1), ranges::end(__range1), ranges::begin(__range2), ranges::end(__range2),
+        __pred, __proj1, __proj2);
+  }
+};
+} // namespace __is_permutation
+
+inline namespace __cpo {
+  inline constexpr auto is_permutation = __is_permutation::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_IS_PERMUTATION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_sorted.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_sorted.h
new file mode 100644
index 0000000..ce3032f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_sorted.h
@@ -0,0 +1,61 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP__ALGORITHM_RANGES_IS_SORTED_H
+#define _LIBCPP__ALGORITHM_RANGES_IS_SORTED_H
+
+#include <__algorithm/ranges_is_sorted_until.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __is_sorted {
+struct __fn {
+  template <forward_iterator _Iter, sentinel_for<_Iter> _Sent,
+            class _Proj = identity,
+            indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return ranges::__is_sorted_until_impl(std::move(__first), __last, __comp, __proj) == __last;
+  }
+
+  template <forward_range _Range,
+            class _Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __last = ranges::end(__range);
+    return ranges::__is_sorted_until_impl(ranges::begin(__range), __last, __comp, __proj) == __last;
+  }
+};
+} // namespace __is_sorted
+
+inline namespace __cpo {
+  inline constexpr auto is_sorted = __is_sorted::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP__ALGORITHM_RANGES_IS_SORTED_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_sorted_until.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_sorted_until.h
new file mode 100644
index 0000000..17fc42e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_is_sorted_until.h
@@ -0,0 +1,76 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP__ALGORITHM_RANGES_IS_SORTED_UNTIL_H
+#define _LIBCPP__ALGORITHM_RANGES_IS_SORTED_UNTIL_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _Iter, class _Sent, class _Proj, class _Comp>
+_LIBCPP_HIDE_FROM_ABI constexpr
+_Iter __is_sorted_until_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
+  if (__first == __last)
+    return __first;
+  auto __i = __first;
+  while (++__i != __last) {
+    if (std::invoke(__comp, std::invoke(__proj, *__i), std::invoke(__proj, *__first)))
+      return __i;
+    __first = __i;
+  }
+  return __i;
+}
+
+namespace __is_sorted_until {
+struct __fn {
+  template <forward_iterator _Iter, sentinel_for<_Iter> _Sent,
+            class _Proj = identity,
+            indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return ranges::__is_sorted_until_impl(std::move(__first), std::move(__last), __comp, __proj);
+  }
+
+  template <forward_range _Range,
+            class _Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
+    return ranges::__is_sorted_until_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
+  }
+};
+} // namespace __is_sorted_until
+
+inline namespace __cpo {
+  inline constexpr auto is_sorted_until = __is_sorted_until::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP__ALGORITHM_RANGES_IS_SORTED_UNTIL_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_iterator_concept.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_iterator_concept.h
new file mode 100644
index 0000000..3ac6b31
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_iterator_concept.h
@@ -0,0 +1,51 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_ITERATOR_CONCEPT_H
+#define _LIBCPP___ALGORITHM_RANGES_ITERATOR_CONCEPT_H
+
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/remove_cvref.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _IterMaybeQualified>
+consteval auto __get_iterator_concept() {
+  using _Iter = __remove_cvref_t<_IterMaybeQualified>;
+
+  if constexpr (contiguous_iterator<_Iter>)
+    return contiguous_iterator_tag();
+  else if constexpr (random_access_iterator<_Iter>)
+    return random_access_iterator_tag();
+  else if constexpr (bidirectional_iterator<_Iter>)
+    return bidirectional_iterator_tag();
+  else if constexpr (forward_iterator<_Iter>)
+    return forward_iterator_tag();
+  else if constexpr (input_iterator<_Iter>)
+    return input_iterator_tag();
+}
+
+template <class _Iter>
+using __iterator_concept = decltype(__get_iterator_concept<_Iter>());
+
+} // namespace ranges
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_ITERATOR_CONCEPT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_lexicographical_compare.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_lexicographical_compare.h
new file mode 100644
index 0000000..2972e32
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_lexicographical_compare.h
@@ -0,0 +1,98 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_LEXICOGRAPHICAL_COMPARE_H
+#define _LIBCPP___ALGORITHM_RANGES_LEXICOGRAPHICAL_COMPARE_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __lexicographical_compare {
+struct __fn {
+
+  template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Proj1, class _Proj2, class _Comp>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  bool __lexicographical_compare_impl(_Iter1 __first1, _Sent1 __last1,
+                                      _Iter2 __first2, _Sent2 __last2,
+                                      _Comp& __comp,
+                                      _Proj1& __proj1,
+                                      _Proj2& __proj2) {
+    while (__first2 != __last2) {
+      if (__first1 == __last1
+       || std::invoke(__comp, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2)))
+        return true;
+      if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1)))
+        return false;
+      ++__first1;
+      ++__first2;
+    }
+    return false;
+  }
+
+  template <input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
+            input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
+            class _Proj1 = identity,
+            class _Proj2 = identity,
+            indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Iter1 __first1, _Sent1 __last1,
+                  _Iter2 __first2, _Sent2 __last2,
+                  _Comp __comp = {},
+                  _Proj1 __proj1 = {},
+                  _Proj2 __proj2 = {}) const {
+    return __lexicographical_compare_impl(std::move(__first1), std::move(__last1),
+                                          std::move(__first2), std::move(__last2),
+                                          __comp,
+                                          __proj1,
+                                          __proj2);
+  }
+
+  template <input_range _Range1,
+            input_range _Range2,
+            class _Proj1 = identity,
+            class _Proj2 = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>,
+                                       projected<iterator_t<_Range2>, _Proj2>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Range1&& __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
+    return __lexicographical_compare_impl(ranges::begin(__range1), ranges::end(__range1),
+                                          ranges::begin(__range2), ranges::end(__range2),
+                                          __comp,
+                                          __proj1,
+                                          __proj2);
+  }
+
+};
+} // namespace __lexicographical_compare
+
+inline namespace __cpo {
+  inline constexpr auto lexicographical_compare = __lexicographical_compare::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_LEXICOGRAPHICAL_COMPARE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_lower_bound.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_lower_bound.h
new file mode 100644
index 0000000..78cbb6d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_lower_bound.h
@@ -0,0 +1,66 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_LOWER_BOUND_H
+#define _LIBCPP___ALGORITHM_RANGES_LOWER_BOUND_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/lower_bound.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/advance.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+namespace __lower_bound {
+struct __fn {
+  template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity,
+            indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
+    return std::__lower_bound_impl<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj);
+  }
+
+  template <forward_range _Range, class _Type, class _Proj = identity,
+            indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __r,
+                                         const _Type& __value,
+                                         _Comp __comp = {},
+                                         _Proj __proj = {}) const {
+    return std::__lower_bound_impl<_RangeAlgPolicy>(ranges::begin(__r), ranges::end(__r), __value, __comp, __proj);
+  }
+};
+} // namespace __lower_bound
+
+inline namespace __cpo {
+  inline constexpr auto lower_bound = __lower_bound::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_LOWER_BOUND_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_make_heap.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_make_heap.h
new file mode 100644
index 0000000..f25c7ab
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_make_heap.h
@@ -0,0 +1,80 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MAKE_HEAP_H
+#define _LIBCPP___ALGORITHM_RANGES_MAKE_HEAP_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_heap.h>
+#include <__algorithm/make_projected.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/projected.h>
+#include <__iterator/sortable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __make_heap {
+
+struct __fn {
+  template <class _Iter, class _Sent, class _Comp, class _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  _Iter __make_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
+    auto __last_iter = ranges::next(__first, __last);
+
+    auto&& __projected_comp = std::__make_projected(__comp, __proj);
+    std::__make_heap<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp);
+
+    return __last_iter;
+  }
+
+  template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<_Iter, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __make_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
+  }
+
+  template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<iterator_t<_Range>, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __make_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
+  }
+};
+
+} // namespace __make_heap
+
+inline namespace __cpo {
+  inline constexpr auto make_heap = __make_heap::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MAKE_HEAP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_max.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_max.h
new file mode 100644
index 0000000..55aef99
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_max.h
@@ -0,0 +1,93 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MAX_H
+#define _LIBCPP___ALGORITHM_RANGES_MAX_H
+
+#include <__algorithm/ranges_min_element.h>
+#include <__assert>
+#include <__concepts/copyable.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __max {
+struct __fn {
+  template <class _Tp, class _Proj = identity,
+            indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  const _Tp& operator()(const _Tp& __a, const _Tp& __b, _Comp __comp = {}, _Proj __proj = {}) const {
+    return std::invoke(__comp, std::invoke(__proj, __a), std::invoke(__proj, __b)) ? __b : __a;
+  }
+
+  template <copyable _Tp, class _Proj = identity,
+            indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Tp operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const {
+    _LIBCPP_ASSERT(__il.begin() != __il.end(), "initializer_list must contain at least one element");
+
+    auto __comp_lhs_rhs_swapped = [&](auto&& __lhs, auto&& __rhs) { return std::invoke(__comp, __rhs, __lhs); };
+    return *ranges::__min_element_impl(__il.begin(), __il.end(), __comp_lhs_rhs_swapped, __proj);
+  }
+
+  template <input_range _Rp, class _Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
+    requires indirectly_copyable_storable<iterator_t<_Rp>, range_value_t<_Rp>*>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  range_value_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __first = ranges::begin(__r);
+    auto __last = ranges::end(__r);
+
+    _LIBCPP_ASSERT(__first != __last, "range must contain at least one element");
+
+    if constexpr (forward_range<_Rp>) {
+      auto __comp_lhs_rhs_swapped = [&](auto&& __lhs, auto&& __rhs) { return std::invoke(__comp, __rhs, __lhs); };
+      return *ranges::__min_element_impl(std::move(__first), std::move(__last), __comp_lhs_rhs_swapped, __proj);
+    } else {
+      range_value_t<_Rp> __result = *__first;
+      while (++__first != __last) {
+        if (std::invoke(__comp, std::invoke(__proj, __result), std::invoke(__proj, *__first)))
+          __result = *__first;
+      }
+      return __result;
+    }
+  }
+};
+} // namespace __max
+
+inline namespace __cpo {
+  inline constexpr auto max = __max::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP_STD_VER > 17 &&
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MAX_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_max_element.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_max_element.h
new file mode 100644
index 0000000..490f320
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_max_element.h
@@ -0,0 +1,61 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MAX_ELEMENT_H
+#define _LIBCPP___ALGORITHM_RANGES_MAX_ELEMENT_H
+
+#include <__algorithm/ranges_min_element.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __max_element {
+struct __fn {
+  template <forward_iterator _Ip, sentinel_for<_Ip> _Sp, class _Proj = identity,
+            indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Ip operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __comp_lhs_rhs_swapped = [&](auto&& __lhs, auto&& __rhs) { return std::invoke(__comp, __rhs, __lhs); };
+    return ranges::__min_element_impl(__first, __last, __comp_lhs_rhs_swapped, __proj);
+  }
+
+  template <forward_range _Rp, class _Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __comp_lhs_rhs_swapped = [&](auto&& __lhs, auto&& __rhs) { return std::invoke(__comp, __rhs, __lhs); };
+    return ranges::__min_element_impl(ranges::begin(__r), ranges::end(__r), __comp_lhs_rhs_swapped, __proj);
+  }
+};
+} // namespace __max_element
+
+inline namespace __cpo {
+  inline constexpr auto max_element = __max_element::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MAX_ELEMENT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_merge.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_merge.h
new file mode 100644
index 0000000..b36a05a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_merge.h
@@ -0,0 +1,142 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MERGE_H
+#define _LIBCPP___ALGORITHM_RANGES_MERGE_H
+
+#include <__algorithm/in_in_out_result.h>
+#include <__algorithm/ranges_copy.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/mergeable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter1, class _InIter2, class _OutIter>
+using merge_result = in_in_out_result<_InIter1, _InIter2, _OutIter>;
+
+namespace __merge {
+
+template <
+    class _InIter1,
+    class _Sent1,
+    class _InIter2,
+    class _Sent2,
+    class _OutIter,
+    class _Comp,
+    class _Proj1,
+    class _Proj2>
+_LIBCPP_HIDE_FROM_ABI constexpr merge_result<__remove_cvref_t<_InIter1>, __remove_cvref_t<_InIter2>, __remove_cvref_t<_OutIter>>
+__merge_impl(
+    _InIter1&& __first1,
+    _Sent1&& __last1,
+    _InIter2&& __first2,
+    _Sent2&& __last2,
+    _OutIter&& __result,
+    _Comp&& __comp,
+    _Proj1&& __proj1,
+    _Proj2&& __proj2) {
+  for (; __first1 != __last1 && __first2 != __last2; ++__result) {
+    if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) {
+      *__result = *__first2;
+      ++__first2;
+    } else {
+      *__result = *__first1;
+      ++__first1;
+    }
+  }
+  auto __ret1 = ranges::copy(std::move(__first1), std::move(__last1), std::move(__result));
+  auto __ret2 = ranges::copy(std::move(__first2), std::move(__last2), std::move(__ret1.out));
+  return {std::move(__ret1.in), std::move(__ret2.in), std::move(__ret2.out)};
+}
+
+struct __fn {
+  template <
+      input_iterator _InIter1,
+      sentinel_for<_InIter1> _Sent1,
+      input_iterator _InIter2,
+      sentinel_for<_InIter2> _Sent2,
+      weakly_incrementable _OutIter,
+      class _Comp  = less,
+      class _Proj1 = identity,
+      class _Proj2 = identity>
+    requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
+  _LIBCPP_HIDE_FROM_ABI constexpr merge_result<_InIter1, _InIter2, _OutIter> operator()(
+      _InIter1 __first1,
+      _Sent1 __last1,
+      _InIter2 __first2,
+      _Sent2 __last2,
+      _OutIter __result,
+      _Comp __comp   = {},
+      _Proj1 __proj1 = {},
+      _Proj2 __proj2 = {}) const {
+    return __merge::__merge_impl(__first1, __last1, __first2, __last2, __result, __comp, __proj1, __proj2);
+  }
+
+  template <
+      input_range _Range1,
+      input_range _Range2,
+      weakly_incrementable _OutIter,
+      class _Comp  = less,
+      class _Proj1 = identity,
+      class _Proj2 = identity>
+    requires mergeable<
+        iterator_t<_Range1>,
+        iterator_t<_Range2>,
+        _OutIter,
+        _Comp,
+        _Proj1,
+        _Proj2>
+  _LIBCPP_HIDE_FROM_ABI constexpr merge_result<borrowed_iterator_t<_Range1>, borrowed_iterator_t<_Range2>, _OutIter>
+        operator()(
+            _Range1&& __range1,
+            _Range2&& __range2,
+            _OutIter __result,
+            _Comp __comp   = {},
+            _Proj1 __proj1 = {},
+            _Proj2 __proj2 = {}) const {
+    return __merge::__merge_impl(
+        ranges::begin(__range1),
+        ranges::end(__range1),
+        ranges::begin(__range2),
+        ranges::end(__range2),
+        __result,
+        __comp,
+        __proj1,
+        __proj2);
+  }
+};
+
+} // namespace __merge
+
+inline namespace __cpo {
+  inline constexpr auto merge = __merge::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MERGE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_min.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_min.h
new file mode 100644
index 0000000..0e31f57
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_min.h
@@ -0,0 +1,89 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MIN_H
+#define _LIBCPP___ALGORITHM_RANGES_MIN_H
+
+#include <__algorithm/ranges_min_element.h>
+#include <__assert>
+#include <__concepts/copyable.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __min {
+struct __fn {
+  template <class _Tp, class _Proj = identity,
+            indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  const _Tp& operator()(const _Tp& __a, const _Tp& __b, _Comp __comp = {}, _Proj __proj = {}) const {
+    return std::invoke(__comp, std::invoke(__proj, __b), std::invoke(__proj, __a)) ? __b : __a;
+  }
+
+  template <copyable _Tp, class _Proj = identity,
+            indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Tp operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const {
+    _LIBCPP_ASSERT(__il.begin() != __il.end(), "initializer_list must contain at least one element");
+    return *ranges::__min_element_impl(__il.begin(), __il.end(), __comp, __proj);
+  }
+
+  template <input_range _Rp, class _Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
+    requires indirectly_copyable_storable<iterator_t<_Rp>, range_value_t<_Rp>*>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  range_value_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __first = ranges::begin(__r);
+    auto __last = ranges::end(__r);
+
+    _LIBCPP_ASSERT(__first != __last, "range must contain at least one element");
+
+    if constexpr (forward_range<_Rp>) {
+      return *ranges::__min_element_impl(__first, __last, __comp, __proj);
+    } else {
+      range_value_t<_Rp> __result = *__first;
+      while (++__first != __last) {
+        if (std::invoke(__comp, std::invoke(__proj, *__first), std::invoke(__proj, __result)))
+          __result = *__first;
+      }
+      return __result;
+    }
+  }
+};
+} // namespace __min
+
+inline namespace __cpo {
+  inline constexpr auto min = __min::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP_STD_VER > 17 &&
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MIN_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_min_element.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_min_element.h
new file mode 100644
index 0000000..1751874
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_min_element.h
@@ -0,0 +1,74 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MIN_ELEMENT_H
+#define _LIBCPP___ALGORITHM_RANGES_MIN_ELEMENT_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+// TODO(ranges): `ranges::min_element` can now simply delegate to `std::__min_element`.
+template <class _Ip, class _Sp, class _Proj, class _Comp>
+_LIBCPP_HIDE_FROM_ABI static constexpr
+_Ip __min_element_impl(_Ip __first, _Sp __last, _Comp& __comp, _Proj& __proj) {
+  if (__first == __last)
+    return __first;
+
+  _Ip __i = __first;
+  while (++__i != __last)
+    if (std::invoke(__comp, std::invoke(__proj, *__i), std::invoke(__proj, *__first)))
+      __first = __i;
+  return __first;
+}
+
+namespace __min_element {
+struct __fn {
+  template <forward_iterator _Ip, sentinel_for<_Ip> _Sp, class _Proj = identity,
+            indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Ip operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return ranges::__min_element_impl(__first, __last, __comp, __proj);
+  }
+
+  template <forward_range _Rp, class _Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    return ranges::__min_element_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
+  }
+};
+} // namespace __min_element
+
+inline namespace __cpo {
+  inline constexpr auto min_element = __min_element::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MIN_ELEMENT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_minmax.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_minmax.h
new file mode 100644
index 0000000..f82e005
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_minmax.h
@@ -0,0 +1,134 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MINMAX_H
+#define _LIBCPP___ALGORITHM_RANGES_MINMAX_H
+
+#include <__algorithm/min_max_result.h>
+#include <__algorithm/minmax_element.h>
+#include <__assert>
+#include <__concepts/copyable.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+template <class _T1>
+using minmax_result = min_max_result<_T1>;
+
+namespace __minmax {
+struct __fn {
+  template <class _Type, class _Proj = identity,
+            indirect_strict_weak_order<projected<const _Type*, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_result<const _Type&>
+  operator()(const _Type& __a, const _Type& __b, _Comp __comp = {}, _Proj __proj = {}) const {
+    if (std::invoke(__comp, std::invoke(__proj, __b), std::invoke(__proj, __a)))
+      return {__b, __a};
+    return {__a, __b};
+  }
+
+  template <copyable _Type, class _Proj = identity,
+            indirect_strict_weak_order<projected<const _Type*, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  ranges::minmax_result<_Type> operator()(initializer_list<_Type> __il, _Comp __comp = {}, _Proj __proj = {}) const {
+    _LIBCPP_ASSERT(__il.begin() != __il.end(), "initializer_list has to contain at least one element");
+    auto __iters = std::__minmax_element_impl(__il.begin(), __il.end(), __comp, __proj);
+    return ranges::minmax_result<_Type> { *__iters.first, *__iters.second };
+  }
+
+  template <input_range _Range, class _Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
+    requires indirectly_copyable_storable<iterator_t<_Range>, range_value_t<_Range>*>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  ranges::minmax_result<range_value_t<_Range>> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __first = ranges::begin(__r);
+    auto __last = ranges::end(__r);
+    using _ValueT = range_value_t<_Range>;
+
+    _LIBCPP_ASSERT(__first != __last, "range has to contain at least one element");
+
+    if constexpr (forward_range<_Range>) {
+      auto __result = std::__minmax_element_impl(__first, __last, __comp, __proj);
+      return {*__result.first, *__result.second};
+    } else {
+      // input_iterators can't be copied, so the implementation for input_iterators has to store
+      // the values instead of a pointer to the correct values
+      auto __less = [&](auto&& __a, auto&& __b) -> bool {
+        return std::invoke(__comp, std::invoke(__proj, std::forward<decltype(__a)>(__a)),
+                                   std::invoke(__proj, std::forward<decltype(__b)>(__b)));
+      };
+
+      ranges::minmax_result<_ValueT> __result = {*__first, __result.min};
+      if (__first == __last || ++__first == __last)
+        return __result;
+
+      if (__less(*__first, __result.min))
+        __result.min = *__first;
+      else
+        __result.max = *__first;
+
+      while (++__first != __last) {
+        _ValueT __i = *__first;
+        if (++__first == __last) {
+          if (__less(__i, __result.min))
+            __result.min = __i;
+          else if (!__less(__i, __result.max))
+            __result.max = __i;
+          return __result;
+        }
+
+        if (__less(*__first, __i)) {
+          if (__less(*__first, __result.min))
+            __result.min = *__first;
+          if (!__less(__i, __result.max))
+            __result.max = std::move(__i);
+        } else {
+          if (__less(__i, __result.min))
+            __result.min = std::move(__i);
+          if (!__less(*__first, __result.max))
+            __result.max = *__first;
+        }
+      }
+      return __result;
+    }
+  }
+};
+} // namespace __minmax
+
+inline namespace __cpo {
+  inline constexpr auto minmax = __minmax::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MINMAX_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_minmax_element.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_minmax_element.h
new file mode 100644
index 0000000..6699f96
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_minmax_element.h
@@ -0,0 +1,72 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MINMAX_ELEMENT_H
+#define _LIBCPP___ALGORITHM_RANGES_MINMAX_ELEMENT_H
+
+#include <__algorithm/min_max_result.h>
+#include <__algorithm/minmax_element.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _T1>
+using minmax_element_result = min_max_result<_T1>;
+
+namespace __minmax_element {
+struct __fn {
+  template <forward_iterator _Ip, sentinel_for<_Ip> _Sp, class _Proj = identity,
+            indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  ranges::minmax_element_result<_Ip> operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __ret = std::__minmax_element_impl(std::move(__first), std::move(__last), __comp, __proj);
+    return {__ret.first, __ret.second};
+  }
+
+  template <forward_range _Rp, class _Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  ranges::minmax_element_result<borrowed_iterator_t<_Rp>>
+  operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __ret = std::__minmax_element_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
+    return {__ret.first, __ret.second};
+  }
+};
+} // namespace __minmax_element
+
+inline namespace __cpo {
+  inline constexpr auto minmax_element = __minmax_element::__fn{};
+} // namespace __cpo
+
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MINMAX_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_mismatch.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_mismatch.h
new file mode 100644
index 0000000..4fd0517
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_mismatch.h
@@ -0,0 +1,85 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MISMATCH_H
+#define _LIBCPP___ALGORITHM_RANGES_MISMATCH_H
+
+#include <__algorithm/in_in_result.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/indirectly_comparable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+template <class _I1, class _I2>
+using mismatch_result = in_in_result<_I1, _I2>;
+
+namespace __mismatch {
+struct __fn {
+  template <class _I1, class _S1, class _I2, class _S2,
+            class _Pred, class _Proj1, class _Proj2>
+  static _LIBCPP_HIDE_FROM_ABI constexpr
+  mismatch_result<_I1, _I2>
+  __go(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2,
+       _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) {
+    while (__first1 != __last1 && __first2 != __last2) {
+      if (!std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2)))
+        break;
+      ++__first1;
+      ++__first2;
+    }
+    return {std::move(__first1), std::move(__first2)};
+  }
+
+  template <input_iterator _I1, sentinel_for<_I1> _S1,
+            input_iterator _I2, sentinel_for<_I2> _S2,
+            class _Pred = ranges::equal_to, class _Proj1 = identity, class _Proj2 = identity>
+    requires indirectly_comparable<_I1, _I2, _Pred, _Proj1, _Proj2>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  mismatch_result<_I1, _I2> operator()(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2,
+                                       _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
+    return __go(std::move(__first1), __last1, std::move(__first2), __last2, __pred, __proj1, __proj2);
+  }
+
+  template <input_range _R1, input_range _R2,
+            class _Pred = ranges::equal_to, class _Proj1 = identity, class _Proj2 = identity>
+    requires indirectly_comparable<iterator_t<_R1>, iterator_t<_R2>, _Pred, _Proj1, _Proj2>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  mismatch_result<borrowed_iterator_t<_R1>, borrowed_iterator_t<_R2>>
+  operator()(_R1&& __r1, _R2&& __r2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
+    return __go(ranges::begin(__r1), ranges::end(__r1), ranges::begin(__r2), ranges::end(__r2),
+                __pred, __proj1, __proj2);
+  }
+};
+} // namespace __mismatch
+
+inline namespace __cpo {
+  constexpr inline auto mismatch = __mismatch::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MISMATCH_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_move.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_move.h
new file mode 100644
index 0000000..46a0970
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_move.h
@@ -0,0 +1,71 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MOVE_H
+#define _LIBCPP___ALGORITHM_RANGES_MOVE_H
+
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/move.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter>
+using move_result = in_out_result<_InIter, _OutIter>;
+
+namespace __move {
+struct __fn {
+
+  template <class _InIter, class _Sent, class _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  move_result<_InIter, _OutIter> __move_impl(_InIter __first, _Sent __last, _OutIter __result) {
+    auto __ret = std::__move<_RangeAlgPolicy>(std::move(__first), std::move(__last), std::move(__result));
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+
+  template <input_iterator _InIter, sentinel_for<_InIter> _Sent, weakly_incrementable _OutIter>
+    requires indirectly_movable<_InIter, _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  move_result<_InIter, _OutIter> operator()(_InIter __first, _Sent __last, _OutIter __result) const {
+    return __move_impl(std::move(__first), std::move(__last), std::move(__result));
+  }
+
+  template <input_range _Range, weakly_incrementable _OutIter>
+    requires indirectly_movable<iterator_t<_Range>, _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  move_result<borrowed_iterator_t<_Range>, _OutIter> operator()(_Range&& __range, _OutIter __result) const {
+    return __move_impl(ranges::begin(__range), ranges::end(__range), std::move(__result));
+  }
+
+};
+} // namespace __move
+
+inline namespace __cpo {
+  inline constexpr auto move = __move::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MOVE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_move_backward.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_move_backward.h
new file mode 100644
index 0000000..d4e8eb1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_move_backward.h
@@ -0,0 +1,73 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_MOVE_BACKWARD_H
+#define _LIBCPP___ALGORITHM_RANGES_MOVE_BACKWARD_H
+
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/move_backward.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/next.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter>
+using move_backward_result = in_out_result<_InIter, _OutIter>;
+
+namespace __move_backward {
+struct __fn {
+
+  template <class _InIter, class _Sent, class _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  move_backward_result<_InIter, _OutIter> __move_backward_impl(_InIter __first, _Sent __last, _OutIter __result) {
+    auto __ret = std::__move_backward<_RangeAlgPolicy>(std::move(__first), std::move(__last), std::move(__result));
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+
+  template <bidirectional_iterator _InIter, sentinel_for<_InIter> _Sent, bidirectional_iterator _OutIter>
+    requires indirectly_movable<_InIter, _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  move_backward_result<_InIter, _OutIter> operator()(_InIter __first, _Sent __last, _OutIter __result) const {
+    return __move_backward_impl(std::move(__first), std::move(__last), std::move(__result));
+  }
+
+  template <bidirectional_range _Range, bidirectional_iterator _Iter>
+    requires indirectly_movable<iterator_t<_Range>, _Iter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  move_backward_result<borrowed_iterator_t<_Range>, _Iter> operator()(_Range&& __range, _Iter __result) const {
+    return __move_backward_impl(ranges::begin(__range), ranges::end(__range), std::move(__result));
+  }
+
+};
+} // namespace __move_backward
+
+inline namespace __cpo {
+  inline constexpr auto move_backward = __move_backward::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_MOVE_BACKWARD_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_next_permutation.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_next_permutation.h
new file mode 100644
index 0000000..6c8e8e1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_next_permutation.h
@@ -0,0 +1,73 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_NEXT_PERMUTATION_H
+#define _LIBCPP___ALGORITHM_RANGES_NEXT_PERMUTATION_H
+
+#include <__algorithm/in_found_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/next_permutation.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/sortable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter>
+using next_permutation_result = in_found_result<_InIter>;
+
+namespace __next_permutation {
+
+struct __fn {
+  template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<_Iter, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr next_permutation_result<_Iter>
+  operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __result = std::__next_permutation<_RangeAlgPolicy>(
+        std::move(__first), std::move(__last), std::__make_projected(__comp, __proj));
+    return {std::move(__result.first), std::move(__result.second)};
+  }
+
+  template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<iterator_t<_Range>, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr next_permutation_result<borrowed_iterator_t<_Range>>
+  operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __result = std::__next_permutation<_RangeAlgPolicy>(
+        ranges::begin(__range), ranges::end(__range), std::__make_projected(__comp, __proj));
+    return {std::move(__result.first), std::move(__result.second)};
+  }
+};
+
+} // namespace __next_permutation
+
+inline namespace __cpo {
+constexpr inline auto next_permutation = __next_permutation::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_NEXT_PERMUTATION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_none_of.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_none_of.h
new file mode 100644
index 0000000..b39e570
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_none_of.h
@@ -0,0 +1,68 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_NONE_OF_H
+#define _LIBCPP___ALGORITHM_RANGES_NONE_OF_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __none_of {
+struct __fn {
+
+  template <class _Iter, class _Sent, class _Proj, class _Pred>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  bool __none_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) {
+    for (; __first != __last; ++__first) {
+      if (std::invoke(__pred, std::invoke(__proj, *__first)))
+        return false;
+    }
+    return true;
+  }
+
+  template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity,
+            indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const {
+    return __none_of_impl(std::move(__first), std::move(__last), __pred, __proj);
+  }
+
+  template <input_range _Range, class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  bool operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
+    return __none_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
+  }
+};
+} // namespace __none_of
+
+inline namespace __cpo {
+  inline constexpr auto none_of = __none_of::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_NONE_OF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_nth_element.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_nth_element.h
new file mode 100644
index 0000000..d9ec4f1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_nth_element.h
@@ -0,0 +1,80 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_NTH_ELEMENT_H
+#define _LIBCPP___ALGORITHM_RANGES_NTH_ELEMENT_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/nth_element.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/projected.h>
+#include <__iterator/sortable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __nth_element {
+
+struct __fn {
+  template <class _Iter, class _Sent, class _Comp, class _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  _Iter __nth_element_fn_impl(_Iter __first, _Iter __nth, _Sent __last, _Comp& __comp, _Proj& __proj) {
+    auto __last_iter = ranges::next(__first, __last);
+
+    auto&& __projected_comp = std::__make_projected(__comp, __proj);
+    std::__nth_element_impl<_RangeAlgPolicy>(std::move(__first), std::move(__nth), __last_iter, __projected_comp);
+
+    return __last_iter;
+  }
+
+  template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<_Iter, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Iter __nth, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __nth_element_fn_impl(std::move(__first), std::move(__nth), std::move(__last), __comp, __proj);
+  }
+
+  template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<iterator_t<_Range>, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __r, iterator_t<_Range> __nth, _Comp __comp = {},
+                                         _Proj __proj = {}) const {
+    return __nth_element_fn_impl(ranges::begin(__r), std::move(__nth), ranges::end(__r), __comp, __proj);
+  }
+};
+
+} // namespace __nth_element
+
+inline namespace __cpo {
+  inline constexpr auto nth_element = __nth_element::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_NTH_ELEMENT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_partial_sort.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_partial_sort.h
new file mode 100644
index 0000000..3ea0a7f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_partial_sort.h
@@ -0,0 +1,78 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_PARTIAL_SORT_H
+#define _LIBCPP___ALGORITHM_RANGES_PARTIAL_SORT_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/partial_sort.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/projected.h>
+#include <__iterator/sortable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __partial_sort {
+
+struct __fn {
+  template <class _Iter, class _Sent, class _Comp, class _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  _Iter __partial_sort_fn_impl(_Iter __first, _Iter __middle, _Sent __last, _Comp& __comp, _Proj& __proj) {
+    auto&& __projected_comp = std::__make_projected(__comp, __proj);
+    return std::__partial_sort<_RangeAlgPolicy>(std::move(__first), std::move(__middle), __last, __projected_comp);
+  }
+
+  template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<_Iter, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Iter __middle, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __partial_sort_fn_impl(std::move(__first), std::move(__middle), std::move(__last), __comp, __proj);
+  }
+
+  template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<iterator_t<_Range>, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __r, iterator_t<_Range> __middle, _Comp __comp = {},
+                                         _Proj __proj = {}) const {
+    return __partial_sort_fn_impl(ranges::begin(__r), std::move(__middle), ranges::end(__r), __comp, __proj);
+  }
+};
+
+} // namespace __partial_sort
+
+inline namespace __cpo {
+  inline constexpr auto partial_sort = __partial_sort::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_PARTIAL_SORT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_partial_sort_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_partial_sort_copy.h
new file mode 100644
index 0000000..212db55
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_partial_sort_copy.h
@@ -0,0 +1,92 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_PARTIAL_SORT_COPY_H
+#define _LIBCPP___ALGORITHM_RANGES_PARTIAL_SORT_COPY_H
+
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/partial_sort_copy.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/projected.h>
+#include <__iterator/sortable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter>
+using partial_sort_copy_result = in_out_result<_InIter, _OutIter>;
+
+namespace __partial_sort_copy {
+
+struct __fn {
+
+  template <input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
+            random_access_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
+            class _Comp = ranges::less, class _Proj1 = identity, class _Proj2 = identity>
+  requires indirectly_copyable<_Iter1, _Iter2> && sortable<_Iter2, _Comp, _Proj2> &&
+           indirect_strict_weak_order<_Comp, projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  partial_sort_copy_result<_Iter1, _Iter2>
+  operator()(_Iter1 __first, _Sent1 __last, _Iter2 __result_first, _Sent2 __result_last,
+             _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
+    auto __result = std::__partial_sort_copy<_RangeAlgPolicy>(
+        std::move(__first), std::move(__last), std::move(__result_first), std::move(__result_last),
+        __comp, __proj1, __proj2
+    );
+    return {std::move(__result.first), std::move(__result.second)};
+  }
+
+  template <input_range _Range1, random_access_range _Range2, class _Comp = ranges::less,
+            class _Proj1 = identity, class _Proj2 = identity>
+  requires indirectly_copyable<iterator_t<_Range1>, iterator_t<_Range2>> &&
+           sortable<iterator_t<_Range2>, _Comp, _Proj2> &&
+           indirect_strict_weak_order<_Comp, projected<iterator_t<_Range1>, _Proj1>,
+                                      projected<iterator_t<_Range2>, _Proj2>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  partial_sort_copy_result<borrowed_iterator_t<_Range1>, borrowed_iterator_t<_Range2>>
+  operator()(_Range1&& __range, _Range2&& __result_range, _Comp __comp = {},
+             _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
+    auto __result = std::__partial_sort_copy<_RangeAlgPolicy>(
+        ranges::begin(__range), ranges::end(__range), ranges::begin(__result_range), ranges::end(__result_range),
+        __comp, __proj1, __proj2
+    );
+    return {std::move(__result.first), std::move(__result.second)};
+  }
+
+};
+
+} // namespace __partial_sort_copy
+
+inline namespace __cpo {
+  inline constexpr auto partial_sort_copy = __partial_sort_copy::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_PARTIAL_SORT_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_partition.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_partition.h
new file mode 100644
index 0000000..8b3aae5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_partition.h
@@ -0,0 +1,83 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_PARTITION_H
+#define _LIBCPP___ALGORITHM_RANGES_PARTITION_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/partition.h>
+#include <__algorithm/ranges_iterator_concept.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/permutable.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/subrange.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __partition {
+
+struct __fn {
+
+  template <class _Iter, class _Sent, class _Proj, class _Pred>
+  _LIBCPP_HIDE_FROM_ABI static constexpr
+  subrange<__remove_cvref_t<_Iter>> __partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) {
+    auto&& __projected_pred = std::__make_projected(__pred, __proj);
+    auto __result = std::__partition<_RangeAlgPolicy>(
+        std::move(__first), std::move(__last), __projected_pred, __iterator_concept<_Iter>());
+
+    return {std::move(__result.first), std::move(__result.second)};
+  }
+
+  template <permutable _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity,
+            indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const {
+    return __partition_fn_impl(__first, __last, __pred, __proj);
+  }
+
+  template <forward_range _Range, class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+  requires permutable<iterator_t<_Range>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_subrange_t<_Range> operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
+    return __partition_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
+  }
+
+};
+
+} // namespace __partition
+
+inline namespace __cpo {
+  inline constexpr auto partition = __partition::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_PARTITION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_partition_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_partition_copy.h
new file mode 100644
index 0000000..e7a9a34
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_partition_copy.h
@@ -0,0 +1,98 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_PARTITION_COPY_H
+#define _LIBCPP___ALGORITHM_RANGES_PARTITION_COPY_H
+
+#include <__algorithm/in_out_out_result.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter1, class _OutIter2>
+using partition_copy_result = in_out_out_result<_InIter, _OutIter1, _OutIter2>;
+
+namespace __partition_copy {
+
+struct __fn {
+
+  // TODO(ranges): delegate to the classic algorithm.
+  template <class _InIter, class _Sent, class _OutIter1, class _OutIter2, class _Proj, class _Pred>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  static partition_copy_result<
+      __remove_cvref_t<_InIter>, __remove_cvref_t<_OutIter1>, __remove_cvref_t<_OutIter2>
+  > __partition_copy_fn_impl( _InIter&& __first, _Sent&& __last, _OutIter1&& __out_true, _OutIter2&& __out_false,
+      _Pred& __pred, _Proj& __proj) {
+    for (; __first != __last; ++__first) {
+      if (std::invoke(__pred, std::invoke(__proj, *__first))) {
+        *__out_true = *__first;
+        ++__out_true;
+
+      } else {
+        *__out_false = *__first;
+        ++__out_false;
+      }
+    }
+
+    return {std::move(__first), std::move(__out_true), std::move(__out_false)};
+  }
+
+  template <input_iterator _InIter, sentinel_for<_InIter> _Sent,
+            weakly_incrementable _OutIter1, weakly_incrementable _OutIter2,
+            class _Proj = identity, indirect_unary_predicate<projected<_InIter, _Proj>> _Pred>
+  requires indirectly_copyable<_InIter, _OutIter1> && indirectly_copyable<_InIter, _OutIter2>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  partition_copy_result<_InIter, _OutIter1, _OutIter2>
+  operator()(_InIter __first, _Sent __last, _OutIter1 __out_true, _OutIter2 __out_false,
+             _Pred __pred, _Proj __proj = {}) const {
+    return __partition_copy_fn_impl(
+        std::move(__first), std::move(__last), std::move(__out_true), std::move(__out_false), __pred, __proj);
+  }
+
+  template <input_range _Range, weakly_incrementable _OutIter1, weakly_incrementable _OutIter2,
+            class _Proj = identity, indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+  requires indirectly_copyable<iterator_t<_Range>, _OutIter1> && indirectly_copyable<iterator_t<_Range>, _OutIter2>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  partition_copy_result<borrowed_iterator_t<_Range>, _OutIter1, _OutIter2>
+  operator()(_Range&& __range, _OutIter1 __out_true, _OutIter2 __out_false, _Pred __pred, _Proj __proj = {}) const {
+    return __partition_copy_fn_impl(
+        ranges::begin(__range), ranges::end(__range), std::move(__out_true), std::move(__out_false), __pred, __proj);
+  }
+
+};
+
+} // namespace __partition_copy
+
+inline namespace __cpo {
+  inline constexpr auto partition_copy = __partition_copy::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_PARTITION_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_partition_point.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_partition_point.h
new file mode 100644
index 0000000..2bd118d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_partition_point.h
@@ -0,0 +1,88 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_PARTITION_POINT_H
+#define _LIBCPP___ALGORITHM_RANGES_PARTITION_POINT_H
+
+#include <__algorithm/half_positive.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __partition_point {
+
+struct __fn {
+
+  // TODO(ranges): delegate to the classic algorithm.
+  template <class _Iter, class _Sent, class _Proj, class _Pred>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  static _Iter __partition_point_fn_impl(_Iter&& __first, _Sent&& __last, _Pred& __pred, _Proj& __proj) {
+    auto __len = ranges::distance(__first, __last);
+
+    while (__len != 0) {
+      auto __half_len = std::__half_positive(__len);
+      auto __mid = ranges::next(__first, __half_len);
+
+      if (std::invoke(__pred, std::invoke(__proj, *__mid))) {
+        __first = ++__mid;
+        __len -= __half_len + 1;
+
+      } else {
+        __len = __half_len;
+      }
+    }
+
+    return __first;
+  }
+
+  template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity,
+            indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const {
+    return __partition_point_fn_impl(std::move(__first), std::move(__last), __pred, __proj);
+  }
+
+  template <forward_range _Range, class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
+    return __partition_point_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
+  }
+
+};
+
+} // namespace __partition_point
+
+inline namespace __cpo {
+  inline constexpr auto partition_point = __partition_point::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_PARTITION_POINT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_pop_heap.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_pop_heap.h
new file mode 100644
index 0000000..65beec8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_pop_heap.h
@@ -0,0 +1,81 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_POP_HEAP_H
+#define _LIBCPP___ALGORITHM_RANGES_POP_HEAP_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/pop_heap.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/projected.h>
+#include <__iterator/sortable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __pop_heap {
+
+struct __fn {
+  template <class _Iter, class _Sent, class _Comp, class _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  _Iter __pop_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
+    auto __last_iter = ranges::next(__first, __last);
+    auto __len = __last_iter - __first;
+
+    auto&& __projected_comp = std::__make_projected(__comp, __proj);
+    std::__pop_heap<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp, __len);
+
+    return __last_iter;
+  }
+
+  template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<_Iter, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __pop_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
+  }
+
+  template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<iterator_t<_Range>, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __pop_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
+  }
+};
+
+} // namespace __pop_heap
+
+inline namespace __cpo {
+  inline constexpr auto pop_heap = __pop_heap::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_POP_HEAP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_prev_permutation.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_prev_permutation.h
new file mode 100644
index 0000000..6866d90
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_prev_permutation.h
@@ -0,0 +1,77 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_PREV_PERMUTATION_H
+#define _LIBCPP___ALGORITHM_RANGES_PREV_PERMUTATION_H
+
+#include <__algorithm/in_found_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/prev_permutation.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/sortable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter>
+using prev_permutation_result = in_found_result<_InIter>;
+
+namespace __prev_permutation {
+
+struct __fn {
+
+  template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent,
+            class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<_Iter, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr prev_permutation_result<_Iter>
+  operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __result = std::__prev_permutation<_RangeAlgPolicy>(
+        std::move(__first), std::move(__last), std::__make_projected(__comp, __proj));
+    return {std::move(__result.first), std::move(__result.second)};
+  }
+
+  template <bidirectional_range _Range,
+            class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<iterator_t<_Range>, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr prev_permutation_result<borrowed_iterator_t<_Range>>
+  operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __result = std::__prev_permutation<_RangeAlgPolicy>(
+        ranges::begin(__range), ranges::end(__range), std::__make_projected(__comp, __proj));
+    return {std::move(__result.first), std::move(__result.second)};
+  }
+
+};
+
+} // namespace __prev_permutation
+
+inline namespace __cpo {
+constexpr inline auto prev_permutation = __prev_permutation::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_PREV_PERMUTATION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_push_heap.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_push_heap.h
new file mode 100644
index 0000000..a1f4347
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_push_heap.h
@@ -0,0 +1,80 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_PUSH_HEAP_H
+#define _LIBCPP___ALGORITHM_RANGES_PUSH_HEAP_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/push_heap.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/projected.h>
+#include <__iterator/sortable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __push_heap {
+
+struct __fn {
+  template <class _Iter, class _Sent, class _Comp, class _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  _Iter __push_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
+    auto __last_iter = ranges::next(__first, __last);
+
+    auto&& __projected_comp = std::__make_projected(__comp, __proj);
+    std::__push_heap<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp);
+
+    return __last_iter;
+  }
+
+  template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<_Iter, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __push_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
+  }
+
+  template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<iterator_t<_Range>, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __push_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
+  }
+};
+
+} // namespace __push_heap
+
+inline namespace __cpo {
+  inline constexpr auto push_heap = __push_heap::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_PUSH_HEAP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_remove.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_remove.h
new file mode 100644
index 0000000..dd5c5fb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_remove.h
@@ -0,0 +1,64 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_REMOVE_H
+#define _LIBCPP___ALGORITHM_RANGES_REMOVE_H
+#include <__config>
+
+#include <__algorithm/ranges_remove_if.h>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/permutable.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/subrange.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __remove {
+struct __fn {
+
+  template <permutable _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity>
+    requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  subrange<_Iter> operator()(_Iter __first, _Sent __last, const _Type& __value, _Proj __proj = {}) const {
+    auto __pred = [&](auto&& __other) { return __value == __other; };
+    return ranges::__remove_if_impl(std::move(__first), std::move(__last), __pred, __proj);
+  }
+
+  template <forward_range _Range, class _Type, class _Proj = identity>
+    requires permutable<iterator_t<_Range>>
+          && indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_subrange_t<_Range> operator()(_Range&& __range, const _Type& __value, _Proj __proj = {}) const {
+    auto __pred = [&](auto&& __other) { return __value == __other; };
+    return ranges::__remove_if_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
+  }
+};
+} // namespace __remove
+
+inline namespace __cpo {
+  inline constexpr auto remove = __remove::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_REMOVE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_remove_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_remove_copy.h
new file mode 100644
index 0000000..2102228
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_remove_copy.h
@@ -0,0 +1,76 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_REMOVE_COPY_H
+#define _LIBCPP___ALGORITHM_RANGES_REMOVE_COPY_H
+
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/ranges_remove_copy_if.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter>
+using remove_copy_result = in_out_result<_InIter, _OutIter>;
+
+namespace __remove_copy {
+
+  struct __fn {
+    template <input_iterator _InIter,
+              sentinel_for<_InIter> _Sent,
+              weakly_incrementable _OutIter,
+              class _Type,
+              class _Proj = identity>
+      requires indirectly_copyable<_InIter, _OutIter> &&
+               indirect_binary_predicate<ranges::equal_to, projected<_InIter, _Proj>, const _Type*>
+    _LIBCPP_HIDE_FROM_ABI constexpr remove_copy_result<_InIter, _OutIter>
+    operator()(_InIter __first, _Sent __last, _OutIter __result, const _Type& __value, _Proj __proj = {}) const {
+      auto __pred = [&](auto&& __val) { return __value == __val; };
+      return ranges::__remove_copy_if_impl(std::move(__first), std::move(__last), std::move(__result), __pred, __proj);
+    }
+
+    template <input_range _Range, weakly_incrementable _OutIter, class _Type, class _Proj = identity>
+      requires indirectly_copyable<iterator_t<_Range>, _OutIter> &&
+               indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
+    _LIBCPP_HIDE_FROM_ABI constexpr remove_copy_result<borrowed_iterator_t<_Range>, _OutIter>
+    operator()(_Range&& __range, _OutIter __result, const _Type& __value, _Proj __proj = {}) const {
+      auto __pred = [&](auto&& __val) { return __value == __val; };
+      return ranges::__remove_copy_if_impl(
+          ranges::begin(__range), ranges::end(__range), std::move(__result), __pred, __proj);
+    }
+  };
+
+} // namespace __remove_copy
+
+inline namespace __cpo {
+  inline constexpr auto remove_copy = __remove_copy::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_REMOVE_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_remove_copy_if.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_remove_copy_if.h
new file mode 100644
index 0000000..4fc6745
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_remove_copy_if.h
@@ -0,0 +1,90 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_REMOVE_COPY_IF_H
+#define _LIBCPP___ALGORITHM_RANGES_REMOVE_COPY_IF_H
+
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/remove_copy_if.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter>
+using remove_copy_if_result = in_out_result<_InIter, _OutIter>;
+
+template <class _InIter, class _Sent, class _OutIter, class _Proj, class _Pred>
+_LIBCPP_HIDE_FROM_ABI constexpr in_out_result<_InIter, _OutIter>
+__remove_copy_if_impl(_InIter __first, _Sent __last, _OutIter __result, _Pred& __pred, _Proj& __proj) {
+  for (; __first != __last; ++__first) {
+    if (!std::invoke(__pred, std::invoke(__proj, *__first))) {
+      *__result = *__first;
+      ++__result;
+    }
+  }
+  return {std::move(__first), std::move(__result)};
+}
+
+namespace __remove_copy_if {
+
+  struct __fn {
+    template <input_iterator _InIter,
+              sentinel_for<_InIter> _Sent,
+              weakly_incrementable _OutIter,
+              class _Proj = identity,
+              indirect_unary_predicate<projected<_InIter, _Proj>> _Pred>
+      requires indirectly_copyable<_InIter, _OutIter>
+    _LIBCPP_HIDE_FROM_ABI constexpr remove_copy_if_result<_InIter, _OutIter>
+    operator()(_InIter __first, _Sent __last, _OutIter __result, _Pred __pred, _Proj __proj = {}) const {
+      return ranges::__remove_copy_if_impl(std::move(__first), std::move(__last), std::move(__result), __pred, __proj);
+    }
+
+    template <input_range _Range,
+              weakly_incrementable _OutIter,
+              class _Proj = identity,
+              indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+      requires indirectly_copyable<iterator_t<_Range>, _OutIter>
+    _LIBCPP_HIDE_FROM_ABI constexpr remove_copy_if_result<borrowed_iterator_t<_Range>, _OutIter>
+    operator()(_Range&& __range, _OutIter __result, _Pred __pred, _Proj __proj = {}) const {
+      return ranges::__remove_copy_if_impl(
+          ranges::begin(__range), ranges::end(__range), std::move(__result), __pred, __proj);
+    }
+  };
+
+} // namespace __remove_copy_if
+
+inline namespace __cpo {
+  inline constexpr auto remove_copy_if = __remove_copy_if::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_REMOVE_COPY_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_remove_if.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_remove_if.h
new file mode 100644
index 0000000..1f17467
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_remove_if.h
@@ -0,0 +1,85 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_REMOVE_IF_H
+#define _LIBCPP___ALGORITHM_RANGES_REMOVE_IF_H
+#include <__config>
+
+#include <__algorithm/ranges_find_if.h>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/permutable.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/subrange.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _Iter, class _Sent, class _Proj, class _Pred>
+_LIBCPP_HIDE_FROM_ABI constexpr
+subrange<_Iter> __remove_if_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) {
+  auto __new_end = ranges::__find_if_impl(__first, __last, __pred, __proj);
+  if (__new_end == __last)
+    return {__new_end, __new_end};
+
+  _Iter __i = __new_end;
+  while (++__i != __last) {
+    if (!std::invoke(__pred, std::invoke(__proj, *__i))) {
+      *__new_end = ranges::iter_move(__i);
+      ++__new_end;
+    }
+  }
+  return {__new_end, __i};
+}
+
+namespace __remove_if {
+struct __fn {
+
+  template <permutable _Iter, sentinel_for<_Iter> _Sent,
+            class _Proj = identity,
+            indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const {
+    return ranges::__remove_if_impl(std::move(__first), std::move(__last), __pred, __proj);
+  }
+
+  template <forward_range _Range,
+            class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+    requires permutable<iterator_t<_Range>>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_subrange_t<_Range> operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
+    return ranges::__remove_if_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
+  }
+
+};
+} // namespace __remove_if
+
+inline namespace __cpo {
+  inline constexpr auto remove_if = __remove_if::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_REMOVE_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_replace.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_replace.h
new file mode 100644
index 0000000..8b12bea
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_replace.h
@@ -0,0 +1,74 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_REPLACE_H
+#define _LIBCPP___ALGORITHM_RANGES_REPLACE_H
+
+#include <__algorithm/ranges_replace_if.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __replace {
+struct __fn {
+
+  template <input_iterator _Iter, sentinel_for<_Iter> _Sent,
+            class _Type1,
+            class _Type2,
+            class _Proj = identity>
+    requires indirectly_writable<_Iter, const _Type2&>
+          && indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type1*>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last,
+                   const _Type1& __old_value,
+                   const _Type2& __new_value,
+                   _Proj __proj = {}) const {
+    auto __pred = [&](const auto& __val) { return __val == __old_value; };
+    return ranges::__replace_if_impl(std::move(__first), std::move(__last), __pred, __new_value, __proj);
+  }
+
+  template <input_range _Range,
+            class _Type1,
+            class _Type2,
+            class _Proj = identity>
+    requires indirectly_writable<iterator_t<_Range>, const _Type2&>
+          && indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type1*>
+  _LIBCPP_HIDE_FROM_ABI constexpr borrowed_iterator_t<_Range>
+  operator()(_Range&& __range, const _Type1& __old_value, const _Type2& __new_value, _Proj __proj = {}) const {
+    auto __pred = [&](auto&& __val) { return __val == __old_value; };
+    return ranges::__replace_if_impl(ranges::begin(__range), ranges::end(__range), __pred, __new_value, __proj);
+  }
+
+};
+} // namespace __replace
+
+inline namespace __cpo {
+  inline constexpr auto replace = __replace::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_REPLACE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_replace_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_replace_copy.h
new file mode 100644
index 0000000..f87a236
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_replace_copy.h
@@ -0,0 +1,91 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_REPLACE_COPY_H
+#define _LIBCPP___ALGORITHM_RANGES_REPLACE_COPY_H
+
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/ranges_replace_copy_if.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter>
+using replace_copy_result = in_out_result<_InIter, _OutIter>;
+
+namespace __replace_copy {
+
+  struct __fn {
+    template <input_iterator _InIter,
+              sentinel_for<_InIter> _Sent,
+              class _OldType,
+              class _NewType,
+              output_iterator<const _NewType&> _OutIter,
+              class _Proj = identity>
+      requires indirectly_copyable<_InIter, _OutIter> &&
+               indirect_binary_predicate<ranges::equal_to, projected<_InIter, _Proj>, const _OldType*>
+    _LIBCPP_HIDE_FROM_ABI constexpr replace_copy_result<_InIter, _OutIter>
+    operator()(_InIter __first,
+               _Sent __last,
+               _OutIter __result,
+               const _OldType& __old_value,
+               const _NewType& __new_value,
+               _Proj __proj = {}) const {
+      auto __pred = [&](const auto& __value) { return __value == __old_value; };
+      return ranges::__replace_copy_if_impl(
+          std::move(__first), std::move(__last), std::move(__result), __pred, __new_value, __proj);
+    }
+
+    template <input_range _Range,
+              class _OldType,
+              class _NewType,
+              output_iterator<const _NewType&> _OutIter,
+              class _Proj = identity>
+      requires indirectly_copyable<iterator_t<_Range>, _OutIter> &&
+               indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _OldType*>
+    _LIBCPP_HIDE_FROM_ABI constexpr replace_copy_result<borrowed_iterator_t<_Range>, _OutIter>
+    operator()(_Range&& __range,
+               _OutIter __result,
+               const _OldType& __old_value,
+               const _NewType& __new_value,
+               _Proj __proj = {}) const {
+      auto __pred = [&](const auto& __value) { return __value == __old_value; };
+      return ranges::__replace_copy_if_impl(
+          ranges::begin(__range), ranges::end(__range), std::move(__result), __pred, __new_value, __proj);
+    }
+  };
+
+} // namespace __replace_copy
+
+inline namespace __cpo {
+  inline constexpr auto replace_copy = __replace_copy::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_REPLACE_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_replace_copy_if.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_replace_copy_if.h
new file mode 100644
index 0000000..b8741ec
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_replace_copy_if.h
@@ -0,0 +1,93 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_REPLACE_COPY_IF_H
+#define _LIBCPP___ALGORITHM_RANGES_REPLACE_COPY_IF_H
+
+#include <__algorithm/in_out_result.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter>
+using replace_copy_if_result = in_out_result<_InIter, _OutIter>;
+
+template <class _InIter, class _Sent, class _OutIter, class _Pred, class _Type, class _Proj>
+_LIBCPP_HIDE_FROM_ABI constexpr replace_copy_if_result<_InIter, _OutIter> __replace_copy_if_impl(
+    _InIter __first, _Sent __last, _OutIter __result, _Pred& __pred, const _Type& __new_value, _Proj& __proj) {
+  while (__first != __last) {
+    if (std::invoke(__pred, std::invoke(__proj, *__first)))
+      *__result = __new_value;
+    else
+      *__result = *__first;
+
+    ++__first;
+    ++__result;
+  }
+
+  return {std::move(__first), std::move(__result)};
+}
+
+namespace __replace_copy_if {
+
+  struct __fn {
+    template <input_iterator _InIter,
+              sentinel_for<_InIter> _Sent,
+              class _Type,
+              output_iterator<const _Type&> _OutIter,
+              class _Proj = identity,
+              indirect_unary_predicate<projected<_InIter, _Proj>> _Pred>
+      requires indirectly_copyable<_InIter, _OutIter>
+    _LIBCPP_HIDE_FROM_ABI constexpr replace_copy_if_result<_InIter, _OutIter> operator()(
+        _InIter __first, _Sent __last, _OutIter __result, _Pred __pred, const _Type& __new_value, _Proj __proj = {})
+        const {
+      return ranges::__replace_copy_if_impl(
+          std::move(__first), std::move(__last), std::move(__result), __pred, __new_value, __proj);
+    }
+
+    template <input_range _Range,
+              class _Type,
+              output_iterator<const _Type&> _OutIter,
+              class _Proj = identity,
+              indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+      requires indirectly_copyable<iterator_t<_Range>, _OutIter>
+    _LIBCPP_HIDE_FROM_ABI constexpr replace_copy_if_result<borrowed_iterator_t<_Range>, _OutIter>
+    operator()(_Range&& __range, _OutIter __result, _Pred __pred, const _Type& __new_value, _Proj __proj = {}) const {
+      return ranges::__replace_copy_if_impl(
+          ranges::begin(__range), ranges::end(__range), std::move(__result), __pred, __new_value, __proj);
+    }
+  };
+
+} // namespace __replace_copy_if
+
+inline namespace __cpo {
+  inline constexpr auto replace_copy_if = __replace_copy_if::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_REPLACE_COPY_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_replace_if.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_replace_if.h
new file mode 100644
index 0000000..65be3c7
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_replace_if.h
@@ -0,0 +1,77 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_REPLACE_IF_H
+#define _LIBCPP___ALGORITHM_RANGES_REPLACE_IF_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _Iter, class _Sent, class _Type, class _Proj, class _Pred>
+_LIBCPP_HIDE_FROM_ABI constexpr
+_Iter __replace_if_impl(_Iter __first, _Sent __last, _Pred& __pred, const _Type& __new_value, _Proj& __proj) {
+  for (; __first != __last; ++__first) {
+    if (std::invoke(__pred, std::invoke(__proj, *__first)))
+      *__first = __new_value;
+  }
+  return __first;
+}
+
+namespace __replace_if {
+struct __fn {
+
+  template <input_iterator _Iter, sentinel_for<_Iter> _Sent,
+            class _Type,
+            class _Proj = identity,
+            indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
+    requires indirectly_writable<_Iter, const _Type&>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, _Pred __pred, const _Type& __new_value, _Proj __proj = {}) const {
+    return ranges::__replace_if_impl(std::move(__first), std::move(__last), __pred, __new_value, __proj);
+  }
+
+  template <input_range _Range,
+            class _Type,
+            class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+    requires indirectly_writable<iterator_t<_Range>, const _Type&>
+  _LIBCPP_HIDE_FROM_ABI constexpr borrowed_iterator_t<_Range>
+  operator()(_Range&& __range, _Pred __pred, const _Type& __new_value, _Proj __proj = {}) const {
+    return ranges::__replace_if_impl(ranges::begin(__range), ranges::end(__range), __pred, __new_value, __proj);
+  }
+
+};
+} // namespace __replace_if
+
+inline namespace __cpo {
+  inline constexpr auto replace_if = __replace_if::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_REPLACE_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_reverse.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_reverse.h
new file mode 100644
index 0000000..e2a5d9a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_reverse.h
@@ -0,0 +1,83 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_REVERSE_H
+#define _LIBCPP___ALGORITHM_RANGES_REVERSE_H
+
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iter_swap.h>
+#include <__iterator/next.h>
+#include <__iterator/permutable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __reverse {
+struct __fn {
+
+  template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent>
+    requires permutable<_Iter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last) const {
+    if constexpr (random_access_iterator<_Iter>) {
+      if (__first == __last)
+        return __first;
+
+      auto __end = ranges::next(__first, __last);
+      auto __ret = __end;
+
+      while (__first < --__end) {
+        ranges::iter_swap(__first, __end);
+        ++__first;
+      }
+      return __ret;
+    } else {
+      auto __end = ranges::next(__first, __last);
+      auto __ret = __end;
+
+      while (__first != __end) {
+        if (__first == --__end)
+          break;
+
+        ranges::iter_swap(__first, __end);
+        ++__first;
+      }
+      return __ret;
+    }
+  }
+
+  template <bidirectional_range _Range>
+    requires permutable<iterator_t<_Range>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __range) const {
+    return (*this)(ranges::begin(__range), ranges::end(__range));
+  }
+
+};
+} // namespace __reverse
+
+inline namespace __cpo {
+  inline constexpr auto reverse = __reverse::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_REVERSE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_reverse_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_reverse_copy.h
new file mode 100644
index 0000000..a84b1ad
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_reverse_copy.h
@@ -0,0 +1,67 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_REVERSE_COPY_H
+#define _LIBCPP___ALGORITHM_RANGES_REVERSE_COPY_H
+
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/ranges_copy.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/next.h>
+#include <__iterator/reverse_iterator.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__ranges/subrange.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter>
+using reverse_copy_result = in_out_result<_InIter, _OutIter>;
+
+namespace __reverse_copy {
+struct __fn {
+
+  template <bidirectional_iterator _InIter, sentinel_for<_InIter> _Sent, weakly_incrementable _OutIter>
+    requires indirectly_copyable<_InIter, _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  reverse_copy_result<_InIter, _OutIter> operator()(_InIter __first, _Sent __last, _OutIter __result) const {
+    return (*this)(subrange(std::move(__first), std::move(__last)), std::move(__result));
+  }
+
+  template <bidirectional_range _Range, weakly_incrementable _OutIter>
+    requires indirectly_copyable<iterator_t<_Range>, _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  reverse_copy_result<borrowed_iterator_t<_Range>, _OutIter> operator()(_Range&& __range, _OutIter __result) const {
+    auto __ret = ranges::copy(std::__reverse_range(__range), std::move(__result));
+    return {ranges::next(ranges::begin(__range), ranges::end(__range)), std::move(__ret.out)};
+  }
+
+};
+} // namespace __reverse_copy
+
+inline namespace __cpo {
+  inline constexpr auto reverse_copy = __reverse_copy::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_REVERSE_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_rotate.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_rotate.h
new file mode 100644
index 0000000..91ed402
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_rotate.h
@@ -0,0 +1,71 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_ROTATE_H
+#define _LIBCPP___ALGORITHM_RANGES_ROTATE_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/ranges_iterator_concept.h>
+#include <__algorithm/rotate.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/permutable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/subrange.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __rotate {
+
+struct __fn {
+
+  template <class _Iter, class _Sent>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  static subrange<_Iter> __rotate_fn_impl(_Iter __first, _Iter __middle, _Sent __last) {
+    auto __ret = std::__rotate<_RangeAlgPolicy>(
+      std::move(__first), std::move(__middle), std::move(__last));
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+
+  template <permutable _Iter, sentinel_for<_Iter> _Sent>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  subrange<_Iter> operator()(_Iter __first, _Iter __middle, _Sent __last) const {
+    return __rotate_fn_impl(std::move(__first), std::move(__middle), std::move(__last));
+  }
+
+  template <forward_range _Range>
+  requires permutable<iterator_t<_Range>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_subrange_t<_Range> operator()(_Range&& __range, iterator_t<_Range> __middle) const {
+    return __rotate_fn_impl(ranges::begin(__range), std::move(__middle), ranges::end(__range));
+  }
+
+};
+
+} // namespace __rotate
+
+inline namespace __cpo {
+  inline constexpr auto rotate = __rotate::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_ROTATE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_rotate_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_rotate_copy.h
new file mode 100644
index 0000000..52f403c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_rotate_copy.h
@@ -0,0 +1,68 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_ROTATE_COPY_H
+#define _LIBCPP___ALGORITHM_RANGES_ROTATE_COPY_H
+
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/ranges_copy.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/reverse_iterator.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter>
+using rotate_copy_result = in_out_result<_InIter, _OutIter>;
+
+namespace __rotate_copy {
+struct __fn {
+
+  template <bidirectional_iterator _InIter, sentinel_for<_InIter> _Sent, weakly_incrementable _OutIter>
+    requires indirectly_copyable<_InIter, _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  rotate_copy_result<_InIter, _OutIter>
+  operator()(_InIter __first, _InIter __middle, _Sent __last, _OutIter __result) const {
+    auto __res1 = ranges::copy(__middle, __last, std::move(__result));
+    auto __res2 = ranges::copy(__first, __middle, std::move(__res1.out));
+    return {std::move(__res1.in), std::move(__res2.out)};
+  }
+
+  template <bidirectional_range _Range, weakly_incrementable _OutIter>
+    requires indirectly_copyable<iterator_t<_Range>, _OutIter>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  rotate_copy_result<borrowed_iterator_t<_Range>, _OutIter>
+  operator()(_Range&& __range, iterator_t<_Range> __middle, _OutIter __result) const {
+    return (*this)(ranges::begin(__range), std::move(__middle), ranges::end(__range), std::move(__result));
+  }
+
+};
+} // namespace __rotate_copy
+
+inline namespace __cpo {
+  inline constexpr auto rotate_copy = __rotate_copy::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_ROTATE_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_sample.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_sample.h
new file mode 100644
index 0000000..a37cb64
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_sample.h
@@ -0,0 +1,74 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_SAMPLE_H
+#define _LIBCPP___ALGORITHM_RANGES_SAMPLE_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/sample.h>
+#include <__algorithm/uniform_random_bit_generator_adaptor.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__random/uniform_random_bit_generator.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __sample {
+
+struct __fn {
+
+  template <input_iterator _Iter, sentinel_for<_Iter> _Sent, weakly_incrementable _OutIter, class _Gen>
+  requires (forward_iterator<_Iter> || random_access_iterator<_OutIter>) &&
+           indirectly_copyable<_Iter, _OutIter> &&
+           uniform_random_bit_generator<remove_reference_t<_Gen>>
+  _LIBCPP_HIDE_FROM_ABI
+  _OutIter operator()(_Iter __first, _Sent __last,
+                      _OutIter __out_first, iter_difference_t<_Iter> __n, _Gen&& __gen) const {
+    _ClassicGenAdaptor<_Gen> __adapted_gen(__gen);
+    return std::__sample<_RangeAlgPolicy>(
+        std::move(__first), std::move(__last), std::move(__out_first), __n, __adapted_gen);
+  }
+
+  template <input_range _Range, weakly_incrementable _OutIter, class _Gen>
+  requires (forward_range<_Range> || random_access_iterator<_OutIter>) &&
+           indirectly_copyable<iterator_t<_Range>, _OutIter> &&
+           uniform_random_bit_generator<remove_reference_t<_Gen>>
+  _LIBCPP_HIDE_FROM_ABI
+  _OutIter operator()(_Range&& __range, _OutIter __out_first, range_difference_t<_Range> __n, _Gen&& __gen) const {
+    return (*this)(ranges::begin(__range), ranges::end(__range),
+                   std::move(__out_first), __n, std::forward<_Gen>(__gen));
+  }
+
+};
+
+} // namespace __sample
+
+inline namespace __cpo {
+  inline constexpr auto sample = __sample::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_SAMPLE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_search.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_search.h
new file mode 100644
index 0000000..388d5af
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_search.h
@@ -0,0 +1,135 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_SEARCH_H
+#define _LIBCPP___ALGORITHM_RANGES_SEARCH_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/search.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/advance.h>
+#include <__iterator/concepts.h>
+#include <__iterator/distance.h>
+#include <__iterator/indirectly_comparable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/size.h>
+#include <__ranges/subrange.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __search {
+struct __fn {
+  template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class _Proj2>
+  _LIBCPP_HIDE_FROM_ABI static constexpr subrange<_Iter1> __ranges_search_impl(
+      _Iter1 __first1,
+      _Sent1 __last1,
+      _Iter2 __first2,
+      _Sent2 __last2,
+      _Pred& __pred,
+      _Proj1& __proj1,
+      _Proj2& __proj2) {
+    if constexpr (sized_sentinel_for<_Sent2, _Iter2>) {
+      auto __size2 = ranges::distance(__first2, __last2);
+      if (__size2 == 0)
+        return {__first1, __first1};
+
+      if constexpr (sized_sentinel_for<_Sent1, _Iter1>) {
+        auto __size1 = ranges::distance(__first1, __last1);
+        if (__size1 < __size2) {
+          ranges::advance(__first1, __last1);
+          return {__first1, __first1};
+        }
+
+        if constexpr (random_access_iterator<_Iter1> && random_access_iterator<_Iter2>) {
+          auto __ret = std::__search_random_access_impl<_RangeAlgPolicy>(
+              __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2);
+          return {__ret.first, __ret.second};
+        }
+      }
+    }
+
+    auto __ret =
+        std::__search_forward_impl<_RangeAlgPolicy>(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2);
+    return {__ret.first, __ret.second};
+  }
+
+  template <forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
+            forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
+            class _Pred = ranges::equal_to,
+            class _Proj1 = identity,
+            class _Proj2 = identity>
+    requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  subrange<_Iter1> operator()(_Iter1 __first1, _Sent1 __last1,
+                              _Iter2 __first2, _Sent2 __last2,
+                              _Pred __pred = {},
+                              _Proj1 __proj1 = {},
+                              _Proj2 __proj2 = {}) const {
+    return __ranges_search_impl(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2);
+  }
+
+  template <forward_range _Range1,
+            forward_range _Range2,
+            class _Pred = ranges::equal_to,
+            class _Proj1 = identity,
+            class _Proj2 = identity>
+    requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_subrange_t<_Range1> operator()(_Range1&& __range1,
+                                          _Range2&& __range2,
+                                          _Pred __pred = {},
+                                          _Proj1 __proj1 = {},
+                                          _Proj2 __proj2 = {}) const {
+    auto __first1 = ranges::begin(__range1);
+    if constexpr (sized_range<_Range2>) {
+      auto __size2 = ranges::size(__range2);
+      if (__size2 == 0)
+        return {__first1, __first1};
+      if constexpr (sized_range<_Range1>) {
+        auto __size1 = ranges::size(__range1);
+        if (__size1 < __size2) {
+          ranges::advance(__first1, ranges::end(__range1));
+          return {__first1, __first1};
+        }
+      }
+    }
+
+    return __ranges_search_impl(
+        ranges::begin(__range1),
+        ranges::end(__range1),
+        ranges::begin(__range2),
+        ranges::end(__range2),
+        __pred,
+        __proj1,
+        __proj2);
+  }
+
+};
+} // namespace __search
+
+inline namespace __cpo {
+  inline constexpr auto search = __search::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_SEARCH_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_search_n.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_search_n.h
new file mode 100644
index 0000000..56ec8f3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_search_n.h
@@ -0,0 +1,117 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_SEARCH_N_H
+#define _LIBCPP___ALGORITHM_RANGES_SEARCH_N_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/search_n.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/advance.h>
+#include <__iterator/concepts.h>
+#include <__iterator/distance.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/indirectly_comparable.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/size.h>
+#include <__ranges/subrange.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __search_n {
+struct __fn {
+
+  template <class _Iter1, class _Sent1, class _SizeT, class _Type, class _Pred, class _Proj>
+  _LIBCPP_HIDE_FROM_ABI static constexpr subrange<_Iter1> __ranges_search_n_impl(
+      _Iter1 __first, _Sent1 __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) {
+    if (__count == 0)
+      return {__first, __first};
+
+    if constexpr (sized_sentinel_for<_Sent1, _Iter1>) {
+      auto __size = ranges::distance(__first, __last);
+      if (__size < __count) {
+        ranges::advance(__first, __last);
+        return {__first, __first};
+      }
+
+      if constexpr (random_access_iterator<_Iter1>) {
+        auto __ret = std::__search_n_random_access_impl<_RangeAlgPolicy>(
+            __first, __last, __count, __value, __pred, __proj, __size);
+        return {std::move(__ret.first), std::move(__ret.second)};
+      }
+    }
+
+    auto __ret = std::__search_n_forward_impl<_RangeAlgPolicy>(__first, __last,
+                                                               __count,
+                                                               __value,
+                                                               __pred,
+                                                               __proj);
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+
+  template <forward_iterator _Iter, sentinel_for<_Iter> _Sent,
+            class _Type,
+            class _Pred = ranges::equal_to,
+            class _Proj = identity>
+    requires indirectly_comparable<_Iter, const _Type*, _Pred, _Proj>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  subrange<_Iter> operator()(_Iter __first, _Sent __last,
+                             iter_difference_t<_Iter> __count,
+                             const _Type& __value,
+                             _Pred __pred = {},
+                             _Proj __proj = _Proj{}) const {
+    return __ranges_search_n_impl(__first, __last, __count, __value, __pred, __proj);
+  }
+
+  template <forward_range _Range, class _Type, class _Pred = ranges::equal_to, class _Proj = identity>
+    requires indirectly_comparable<iterator_t<_Range>, const _Type*, _Pred, _Proj>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_subrange_t<_Range> operator()(_Range&& __range,
+                                         range_difference_t<_Range> __count,
+                                         const _Type& __value,
+                                         _Pred __pred = {},
+                                         _Proj __proj = {}) const {
+    auto __first = ranges::begin(__range);
+    if (__count <= 0)
+      return {__first, __first};
+    if constexpr (sized_range<_Range>) {
+      auto __size1 = ranges::size(__range);
+      if (__size1 < static_cast<range_size_t<_Range>>(__count)) {
+        ranges::advance(__first, ranges::end(__range));
+        return {__first, __first};
+      }
+    }
+
+    return __ranges_search_n_impl(ranges::begin(__range), ranges::end(__range), __count, __value, __pred, __proj);
+  }
+};
+} // namespace __search_n
+
+inline namespace __cpo {
+  inline constexpr auto search_n = __search_n::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_SEARCH_N_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_set_difference.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_set_difference.h
new file mode 100644
index 0000000..607dd68
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_set_difference.h
@@ -0,0 +1,106 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_SET_DIFFERENCE_H
+#define _LIBCPP___ALGORITHM_RANGES_SET_DIFFERENCE_H
+
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/set_difference.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/mergeable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__type_traits/decay.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter>
+using set_difference_result = in_out_result<_InIter, _OutIter>;
+
+namespace __set_difference {
+
+struct __fn {
+  template <
+      input_iterator _InIter1,
+      sentinel_for<_InIter1> _Sent1,
+      input_iterator _InIter2,
+      sentinel_for<_InIter2> _Sent2,
+      weakly_incrementable _OutIter,
+      class _Comp  = less,
+      class _Proj1 = identity,
+      class _Proj2 = identity>
+    requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
+  _LIBCPP_HIDE_FROM_ABI constexpr set_difference_result<_InIter1, _OutIter> operator()(
+      _InIter1 __first1,
+      _Sent1 __last1,
+      _InIter2 __first2,
+      _Sent2 __last2,
+      _OutIter __result,
+      _Comp __comp   = {},
+      _Proj1 __proj1 = {},
+      _Proj2 __proj2 = {}) const {
+    auto __ret = std::__set_difference<_RangeAlgPolicy>(
+        __first1, __last1, __first2, __last2, __result, ranges::__make_projected_comp(__comp, __proj1, __proj2));
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+
+  template <
+      input_range _Range1,
+      input_range _Range2,
+      weakly_incrementable _OutIter,
+      class _Comp  = less,
+      class _Proj1 = identity,
+      class _Proj2 = identity>
+    requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
+  _LIBCPP_HIDE_FROM_ABI constexpr set_difference_result<borrowed_iterator_t<_Range1>, _OutIter>
+    operator()(
+        _Range1&& __range1,
+        _Range2&& __range2,
+        _OutIter __result,
+        _Comp __comp   = {},
+        _Proj1 __proj1 = {},
+        _Proj2 __proj2 = {}) const {
+    auto __ret = std::__set_difference<_RangeAlgPolicy>(
+        ranges::begin(__range1),
+        ranges::end(__range1),
+        ranges::begin(__range2),
+        ranges::end(__range2),
+        __result,
+        ranges::__make_projected_comp(__comp, __proj1, __proj2));
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+};
+
+} // namespace __set_difference
+
+inline namespace __cpo {
+  inline constexpr auto set_difference = __set_difference::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+#endif // _LIBCPP___ALGORITHM_RANGES_SET_DIFFERENCE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_set_intersection.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_set_intersection.h
new file mode 100644
index 0000000..aa9fd24
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_set_intersection.h
@@ -0,0 +1,117 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_SET_INTERSECTION_H
+#define _LIBCPP___ALGORITHM_RANGES_SET_INTERSECTION_H
+
+#include <__algorithm/in_in_out_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/set_intersection.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/mergeable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter1, class _InIter2, class _OutIter>
+using set_intersection_result = in_in_out_result<_InIter1, _InIter2, _OutIter>;
+
+namespace __set_intersection {
+
+struct __fn {
+  template <
+      input_iterator _InIter1,
+      sentinel_for<_InIter1> _Sent1,
+      input_iterator _InIter2,
+      sentinel_for<_InIter2> _Sent2,
+      weakly_incrementable _OutIter,
+      class _Comp  = less,
+      class _Proj1 = identity,
+      class _Proj2 = identity>
+    requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
+  _LIBCPP_HIDE_FROM_ABI constexpr set_intersection_result<_InIter1, _InIter2, _OutIter> operator()(
+      _InIter1 __first1,
+      _Sent1 __last1,
+      _InIter2 __first2,
+      _Sent2 __last2,
+      _OutIter __result,
+      _Comp __comp   = {},
+      _Proj1 __proj1 = {},
+      _Proj2 __proj2 = {}) const {
+    auto __ret = std::__set_intersection<_RangeAlgPolicy>(
+        std::move(__first1),
+        std::move(__last1),
+        std::move(__first2),
+        std::move(__last2),
+        std::move(__result),
+        ranges::__make_projected_comp(__comp, __proj1, __proj2));
+    return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)};
+  }
+
+  template <
+      input_range _Range1,
+      input_range _Range2,
+      weakly_incrementable _OutIter,
+      class _Comp  = less,
+      class _Proj1 = identity,
+      class _Proj2 = identity>
+    requires mergeable<
+        iterator_t<_Range1>,
+        iterator_t<_Range2>,
+        _OutIter,
+        _Comp,
+        _Proj1,
+        _Proj2>
+    _LIBCPP_HIDE_FROM_ABI constexpr set_intersection_result<borrowed_iterator_t<_Range1>,
+                                                            borrowed_iterator_t<_Range2>,
+                                                            _OutIter>
+    operator()(
+        _Range1&& __range1,
+        _Range2&& __range2,
+        _OutIter __result,
+        _Comp __comp   = {},
+        _Proj1 __proj1 = {},
+        _Proj2 __proj2 = {}) const {
+    auto __ret = std::__set_intersection<_RangeAlgPolicy>(
+        ranges::begin(__range1),
+        ranges::end(__range1),
+        ranges::begin(__range2),
+        ranges::end(__range2),
+        std::move(__result),
+        ranges::__make_projected_comp(__comp, __proj1, __proj2));
+    return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)};
+  }
+};
+
+} // namespace __set_intersection
+
+inline namespace __cpo {
+  inline constexpr auto set_intersection = __set_intersection::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+#endif // _LIBCPP___ALGORITHM_RANGES_SET_INTERSECTION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_set_symmetric_difference.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_set_symmetric_difference.h
new file mode 100644
index 0000000..bc4a906
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_set_symmetric_difference.h
@@ -0,0 +1,117 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_SET_SYMMETRIC_DIFFERENCE_H
+#define _LIBCPP___ALGORITHM_RANGES_SET_SYMMETRIC_DIFFERENCE_H
+
+#include <__algorithm/in_in_out_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/set_symmetric_difference.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/mergeable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter1, class _InIter2, class _OutIter>
+using set_symmetric_difference_result = in_in_out_result<_InIter1, _InIter2, _OutIter>;
+
+namespace __set_symmetric_difference {
+
+struct __fn {
+  template <
+      input_iterator _InIter1,
+      sentinel_for<_InIter1> _Sent1,
+      input_iterator _InIter2,
+      sentinel_for<_InIter2> _Sent2,
+      weakly_incrementable _OutIter,
+      class _Comp  = ranges::less,
+      class _Proj1 = identity,
+      class _Proj2 = identity>
+    requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
+  _LIBCPP_HIDE_FROM_ABI constexpr set_symmetric_difference_result<_InIter1, _InIter2, _OutIter> operator()(
+      _InIter1 __first1,
+      _Sent1 __last1,
+      _InIter2 __first2,
+      _Sent2 __last2,
+      _OutIter __result,
+      _Comp __comp   = {},
+      _Proj1 __proj1 = {},
+      _Proj2 __proj2 = {}) const {
+    auto __ret = std::__set_symmetric_difference<_RangeAlgPolicy>(
+        std::move(__first1),
+        std::move(__last1),
+        std::move(__first2),
+        std::move(__last2),
+        std::move(__result),
+        ranges::__make_projected_comp(__comp, __proj1, __proj2));
+    return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)};
+  }
+
+  template <
+      input_range _Range1,
+      input_range _Range2,
+      weakly_incrementable _OutIter,
+      class _Comp  = ranges::less,
+      class _Proj1 = identity,
+      class _Proj2 = identity>
+    requires mergeable<
+        iterator_t<_Range1>,
+        iterator_t<_Range2>,
+        _OutIter,
+        _Comp,
+        _Proj1,
+        _Proj2>
+  _LIBCPP_HIDE_FROM_ABI constexpr set_symmetric_difference_result<borrowed_iterator_t<_Range1>,
+                                                                  borrowed_iterator_t<_Range2>,
+                                                                  _OutIter>
+    operator()(
+        _Range1&& __range1,
+        _Range2&& __range2,
+        _OutIter __result,
+        _Comp __comp   = {},
+        _Proj1 __proj1 = {},
+        _Proj2 __proj2 = {}) const {
+    auto __ret = std::__set_symmetric_difference<_RangeAlgPolicy>(
+        ranges::begin(__range1),
+        ranges::end(__range1),
+        ranges::begin(__range2),
+        ranges::end(__range2),
+        std::move(__result),
+        ranges::__make_projected_comp(__comp, __proj1, __proj2));
+    return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)};
+  }
+};
+
+} // namespace __set_symmetric_difference
+
+inline namespace __cpo {
+  inline constexpr auto set_symmetric_difference = __set_symmetric_difference::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+#endif // _LIBCPP___ALGORITHM_RANGES_SET_SYMMETRIC_DIFFERENCE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_set_union.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_set_union.h
new file mode 100644
index 0000000..f8cd45c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_set_union.h
@@ -0,0 +1,121 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_SET_UNION_H
+#define _LIBCPP___ALGORITHM_RANGES_SET_UNION_H
+
+#include <__algorithm/in_in_out_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/set_union.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/mergeable.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter1, class _InIter2, class _OutIter>
+using set_union_result = in_in_out_result<_InIter1, _InIter2, _OutIter>;
+
+namespace __set_union {
+
+struct __fn {
+  template <
+      input_iterator _InIter1,
+      sentinel_for<_InIter1> _Sent1,
+      input_iterator _InIter2,
+      sentinel_for<_InIter2> _Sent2,
+      weakly_incrementable _OutIter,
+      class _Comp  = ranges::less,
+      class _Proj1 = identity,
+      class _Proj2 = identity>
+    requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
+  _LIBCPP_HIDE_FROM_ABI constexpr set_union_result<_InIter1, _InIter2, _OutIter> operator()(
+      _InIter1 __first1,
+      _Sent1 __last1,
+      _InIter2 __first2,
+      _Sent2 __last2,
+      _OutIter __result,
+      _Comp __comp   = {},
+      _Proj1 __proj1 = {},
+      _Proj2 __proj2 = {}) const {
+    auto __ret = std::__set_union<_RangeAlgPolicy>(
+        std::move(__first1),
+        std::move(__last1),
+        std::move(__first2),
+        std::move(__last2),
+        std::move(__result),
+        ranges::__make_projected_comp(__comp, __proj1, __proj2));
+    return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)};
+  }
+
+  template <
+      input_range _Range1,
+      input_range _Range2,
+      weakly_incrementable _OutIter,
+      class _Comp  = ranges::less,
+      class _Proj1 = identity,
+      class _Proj2 = identity>
+    requires mergeable<
+        iterator_t<_Range1>,
+        iterator_t<_Range2>,
+        _OutIter,
+        _Comp,
+        _Proj1,
+        _Proj2>
+  _LIBCPP_HIDE_FROM_ABI constexpr set_union_result<borrowed_iterator_t<_Range1>,
+                                                   borrowed_iterator_t<_Range2>,
+                                                   _OutIter>
+    operator()(
+        _Range1&& __range1,
+        _Range2&& __range2,
+        _OutIter __result,
+        _Comp __comp   = {},
+        _Proj1 __proj1 = {},
+        _Proj2 __proj2 = {}) const {
+    auto __ret = std::__set_union<_RangeAlgPolicy>(
+        ranges::begin(__range1),
+        ranges::end(__range1),
+        ranges::begin(__range2),
+        ranges::end(__range2),
+        std::move(__result),
+        ranges::__make_projected_comp(__comp, __proj1, __proj2));
+    return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)};
+  }
+};
+
+} // namespace __set_union
+
+inline namespace __cpo {
+  inline constexpr auto set_union = __set_union::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_SET_UNION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_shuffle.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_shuffle.h
new file mode 100644
index 0000000..a2f2c0e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_shuffle.h
@@ -0,0 +1,71 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_SHUFFLE_H
+#define _LIBCPP___ALGORITHM_RANGES_SHUFFLE_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/shuffle.h>
+#include <__algorithm/uniform_random_bit_generator_adaptor.h>
+#include <__config>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/permutable.h>
+#include <__random/uniform_random_bit_generator.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __shuffle {
+
+struct __fn {
+
+  template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Gen>
+  requires permutable<_Iter> && uniform_random_bit_generator<remove_reference_t<_Gen>>
+  _LIBCPP_HIDE_FROM_ABI
+  _Iter operator()(_Iter __first, _Sent __last, _Gen&& __gen) const {
+    _ClassicGenAdaptor<_Gen> __adapted_gen(__gen);
+    return std::__shuffle<_RangeAlgPolicy>(std::move(__first), std::move(__last), __adapted_gen);
+  }
+
+  template<random_access_range _Range, class _Gen>
+  requires permutable<iterator_t<_Range>> && uniform_random_bit_generator<remove_reference_t<_Gen>>
+  _LIBCPP_HIDE_FROM_ABI
+  borrowed_iterator_t<_Range> operator()(_Range&& __range, _Gen&& __gen) const {
+    return (*this)(ranges::begin(__range), ranges::end(__range), std::forward<_Gen>(__gen));
+  }
+
+};
+
+} // namespace __shuffle
+
+inline namespace __cpo {
+  inline constexpr auto shuffle = __shuffle::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_SHUFFLE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_sort.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_sort.h
new file mode 100644
index 0000000..32391df
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_sort.h
@@ -0,0 +1,79 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_SORT_H
+#define _LIBCPP___ALGORITHM_RANGES_SORT_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/sort.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/projected.h>
+#include <__iterator/sortable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __sort {
+
+struct __fn {
+  template <class _Iter, class _Sent, class _Comp, class _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  _Iter __sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
+    auto __last_iter = ranges::next(__first, __last);
+
+    auto&& __projected_comp = std::__make_projected(__comp, __proj);
+    std::__sort_impl<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp);
+
+    return __last_iter;
+  }
+
+  template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<_Iter, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __sort_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
+  }
+
+  template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<iterator_t<_Range>, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __sort_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
+  }
+};
+
+} // namespace __sort
+
+inline namespace __cpo {
+  inline constexpr auto sort = __sort::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_SORT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_sort_heap.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_sort_heap.h
new file mode 100644
index 0000000..9feb0f6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_sort_heap.h
@@ -0,0 +1,80 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_SORT_HEAP_H
+#define _LIBCPP___ALGORITHM_RANGES_SORT_HEAP_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/sort_heap.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/projected.h>
+#include <__iterator/sortable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __sort_heap {
+
+struct __fn {
+  template <class _Iter, class _Sent, class _Comp, class _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr static
+  _Iter __sort_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
+    auto __last_iter = ranges::next(__first, __last);
+
+    auto&& __projected_comp = std::__make_projected(__comp, __proj);
+    std::__sort_heap<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp);
+
+    return __last_iter;
+  }
+
+  template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<_Iter, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __sort_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
+  }
+
+  template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<iterator_t<_Range>, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __sort_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
+  }
+};
+
+} // namespace __sort_heap
+
+inline namespace __cpo {
+  inline constexpr auto sort_heap = __sort_heap::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_SORT_HEAP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_stable_partition.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_stable_partition.h
new file mode 100644
index 0000000..c3469f1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_stable_partition.h
@@ -0,0 +1,88 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_STABLE_PARTITION_H
+#define _LIBCPP___ALGORITHM_RANGES_STABLE_PARTITION_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/ranges_iterator_concept.h>
+#include <__algorithm/stable_partition.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/permutable.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__ranges/subrange.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __stable_partition {
+
+struct __fn {
+
+  template <class _Iter, class _Sent, class _Proj, class _Pred>
+  _LIBCPP_HIDE_FROM_ABI static
+  subrange<__remove_cvref_t<_Iter>> __stable_partition_fn_impl(
+      _Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) {
+    auto __last_iter = ranges::next(__first, __last);
+
+    auto&& __projected_pred = std::__make_projected(__pred, __proj);
+    auto __result = std::__stable_partition<_RangeAlgPolicy>(
+        std::move(__first), __last_iter, __projected_pred, __iterator_concept<_Iter>());
+
+    return {std::move(__result), std::move(__last_iter)};
+  }
+
+  template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity,
+            indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
+  requires permutable<_Iter>
+  _LIBCPP_HIDE_FROM_ABI
+  subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const {
+    return __stable_partition_fn_impl(__first, __last, __pred, __proj);
+  }
+
+  template <bidirectional_range _Range, class _Proj = identity,
+            indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
+  requires permutable<iterator_t<_Range>>
+  _LIBCPP_HIDE_FROM_ABI
+  borrowed_subrange_t<_Range> operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
+    return __stable_partition_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
+  }
+
+};
+
+} // namespace __stable_partition
+
+inline namespace __cpo {
+  inline constexpr auto stable_partition = __stable_partition::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_STABLE_PARTITION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_stable_sort.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_stable_sort.h
new file mode 100644
index 0000000..d3c48dd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_stable_sort.h
@@ -0,0 +1,79 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_STABLE_SORT_H
+#define _LIBCPP___ALGORITHM_RANGES_STABLE_SORT_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/stable_sort.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/projected.h>
+#include <__iterator/sortable.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __stable_sort {
+
+struct __fn {
+  template <class _Iter, class _Sent, class _Comp, class _Proj>
+  _LIBCPP_HIDE_FROM_ABI
+  static _Iter __stable_sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
+    auto __last_iter = ranges::next(__first, __last);
+
+    auto&& __projected_comp = std::__make_projected(__comp, __proj);
+    std::__stable_sort_impl<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp);
+
+    return __last_iter;
+  }
+
+  template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<_Iter, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI
+  _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __stable_sort_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
+  }
+
+  template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
+    requires sortable<iterator_t<_Range>, _Comp, _Proj>
+  _LIBCPP_HIDE_FROM_ABI
+  borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
+    return __stable_sort_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
+  }
+};
+
+} // namespace __stable_sort
+
+inline namespace __cpo {
+  inline constexpr auto stable_sort = __stable_sort::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_STABLE_SORT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_swap_ranges.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_swap_ranges.h
new file mode 100644
index 0000000..552fd55
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_swap_ranges.h
@@ -0,0 +1,68 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_SWAP_RANGES_H
+#define _LIBCPP___ALGORITHM_RANGES_SWAP_RANGES_H
+
+#include <__algorithm/in_in_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/swap_ranges.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iter_swap.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _I1, class _I2>
+using swap_ranges_result = in_in_result<_I1, _I2>;
+
+namespace __swap_ranges {
+struct __fn {
+  template <input_iterator _I1, sentinel_for<_I1> _S1,
+            input_iterator _I2, sentinel_for<_I2> _S2>
+    requires indirectly_swappable<_I1, _I2>
+  _LIBCPP_HIDE_FROM_ABI constexpr swap_ranges_result<_I1, _I2>
+  operator()(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2) const {
+    auto __ret = std::__swap_ranges<_RangeAlgPolicy>(
+        std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2));
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+
+  template <input_range _R1, input_range _R2>
+    requires indirectly_swappable<iterator_t<_R1>, iterator_t<_R2>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  swap_ranges_result<borrowed_iterator_t<_R1>, borrowed_iterator_t<_R2>>
+  operator()(_R1&& __r1, _R2&& __r2) const {
+    return operator()(ranges::begin(__r1), ranges::end(__r1),
+                      ranges::begin(__r2), ranges::end(__r2));
+  }
+};
+} // namespace __swap_ranges
+
+inline namespace __cpo {
+  inline constexpr auto swap_ranges = __swap_ranges::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_SWAP_RANGES_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_transform.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_transform.h
new file mode 100644
index 0000000..c0981a0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_transform.h
@@ -0,0 +1,170 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_TRANSFORM_H
+#define _LIBCPP___ALGORITHM_RANGES_TRANSFORM_H
+
+#include <__algorithm/in_in_out_result.h>
+#include <__algorithm/in_out_result.h>
+#include <__concepts/constructible.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _Ip, class _Op>
+using unary_transform_result = in_out_result<_Ip, _Op>;
+
+template <class _I1, class _I2, class _O1>
+using binary_transform_result = in_in_out_result<_I1, _I2, _O1>;
+
+namespace __transform {
+struct __fn {
+private:
+  template <class _InIter, class _Sent,
+            class _OutIter,
+            class _Func,
+            class _Proj>
+  _LIBCPP_HIDE_FROM_ABI static constexpr
+  unary_transform_result<_InIter, _OutIter> __unary(_InIter __first, _Sent __last,
+                                                    _OutIter __result,
+                                                    _Func& __operation,
+                                                    _Proj& __projection) {
+    while (__first != __last) {
+      *__result = std::invoke(__operation, std::invoke(__projection, *__first));
+      ++__first;
+      ++__result;
+    }
+
+    return {std::move(__first), std::move(__result)};
+  }
+
+  template <class _InIter1, class _Sent1,
+            class _InIter2, class _Sent2,
+            class _OutIter,
+            class _Func,
+            class _Proj1,
+            class _Proj2>
+  _LIBCPP_HIDE_FROM_ABI static constexpr binary_transform_result<_InIter1, _InIter2, _OutIter>
+  __binary(_InIter1 __first1, _Sent1 __last1,
+           _InIter2 __first2, _Sent2 __last2,
+           _OutIter __result,
+           _Func& __binary_operation,
+           _Proj1& __projection1,
+           _Proj2& __projection2) {
+    while (__first1 != __last1 && __first2 != __last2) {
+      *__result = std::invoke(__binary_operation, std::invoke(__projection1, *__first1),
+                                                  std::invoke(__projection2, *__first2));
+      ++__first1;
+      ++__first2;
+      ++__result;
+    }
+    return {std::move(__first1), std::move(__first2), std::move(__result)};
+  }
+public:
+  template <input_iterator _InIter, sentinel_for<_InIter> _Sent,
+            weakly_incrementable _OutIter,
+            copy_constructible _Func,
+            class _Proj = identity>
+    requires indirectly_writable<_OutIter, indirect_result_t<_Func&, projected<_InIter, _Proj>>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  unary_transform_result<_InIter, _OutIter> operator()(_InIter __first, _Sent __last,
+                                                       _OutIter __result,
+                                                       _Func __operation,
+                                                       _Proj __proj = {}) const {
+    return __unary(std::move(__first), std::move(__last), std::move(__result), __operation, __proj);
+  }
+
+  template <input_range _Range,
+            weakly_incrementable _OutIter,
+            copy_constructible _Func,
+            class _Proj = identity>
+    requires indirectly_writable<_OutIter, indirect_result_t<_Func, projected<iterator_t<_Range>, _Proj>>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  unary_transform_result<borrowed_iterator_t<_Range>, _OutIter> operator()(_Range&& __range,
+                                                                           _OutIter __result,
+                                                                           _Func __operation,
+                                                                           _Proj __projection = {}) const {
+    return __unary(ranges::begin(__range), ranges::end(__range), std::move(__result), __operation, __projection);
+  }
+
+  template <input_iterator _InIter1, sentinel_for<_InIter1> _Sent1,
+            input_iterator _InIter2, sentinel_for<_InIter2> _Sent2,
+            weakly_incrementable _OutIter,
+            copy_constructible _Func,
+            class _Proj1 = identity,
+            class _Proj2 = identity>
+    requires indirectly_writable<_OutIter, indirect_result_t<_Func&, projected<_InIter1, _Proj1>,
+                                                                     projected<_InIter2, _Proj2>>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  binary_transform_result<_InIter1, _InIter2, _OutIter> operator()(_InIter1 __first1, _Sent1 __last1,
+                                                                   _InIter2 __first2, _Sent2 __last2,
+                                                                   _OutIter __result,
+                                                                   _Func __binary_operation,
+                                                                   _Proj1 __projection1 = {},
+                                                                   _Proj2 __projection2 = {}) const {
+    return __binary(std::move(__first1), std::move(__last1),
+                    std::move(__first2), std::move(__last2),
+                    std::move(__result),
+                    __binary_operation,
+                    __projection1,
+                    __projection2);
+  }
+
+  template <input_range _Range1,
+            input_range _Range2,
+            weakly_incrementable _OutIter,
+            copy_constructible _Func,
+            class _Proj1 = identity,
+            class _Proj2 = identity>
+    requires indirectly_writable<_OutIter, indirect_result_t<_Func&, projected<iterator_t<_Range1>, _Proj1>,
+                                                                     projected<iterator_t<_Range2>, _Proj2>>>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  binary_transform_result<borrowed_iterator_t<_Range1>, borrowed_iterator_t<_Range2>, _OutIter>
+  operator()(_Range1&& __range1,
+             _Range2&& __range2,
+             _OutIter __result,
+             _Func __binary_operation,
+             _Proj1 __projection1 = {},
+             _Proj2 __projection2 = {}) const {
+    return __binary(ranges::begin(__range1), ranges::end(__range1),
+                    ranges::begin(__range2), ranges::end(__range2),
+                    std::move(__result),
+                    __binary_operation,
+                    __projection1,
+                    __projection2);
+  }
+
+};
+} // namespace __transform
+
+inline namespace __cpo {
+  inline constexpr auto transform = __transform::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_TRANSFORM_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_unique.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_unique.h
new file mode 100644
index 0000000..be427cc
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_unique.h
@@ -0,0 +1,79 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_UNIQUE_H
+#define _LIBCPP___ALGORITHM_RANGES_UNIQUE_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/unique.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/permutable.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__ranges/subrange.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __unique {
+
+  struct __fn {
+    template <
+        permutable _Iter,
+        sentinel_for<_Iter> _Sent,
+        class _Proj                                                  = identity,
+        indirect_equivalence_relation<projected<_Iter, _Proj>> _Comp = ranges::equal_to>
+    _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr subrange<_Iter>
+    operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
+      auto __ret = std::__unique<_RangeAlgPolicy>(
+          std::move(__first), std::move(__last), std::__make_projected(__comp, __proj));
+      return {std::move(__ret.first), std::move(__ret.second)};
+    }
+
+    template <
+        forward_range _Range,
+        class _Proj                                                               = identity,
+        indirect_equivalence_relation<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::equal_to>
+      requires permutable<iterator_t<_Range>>
+    _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr borrowed_subrange_t<_Range>
+    operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
+      auto __ret = std::__unique<_RangeAlgPolicy>(
+          ranges::begin(__range), ranges::end(__range), std::__make_projected(__comp, __proj));
+      return {std::move(__ret.first), std::move(__ret.second)};
+    }
+  };
+
+} // namespace __unique
+
+inline namespace __cpo {
+  inline constexpr auto unique = __unique::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_UNIQUE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_unique_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_unique_copy.h
new file mode 100644
index 0000000..3ad47b0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_unique_copy.h
@@ -0,0 +1,116 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_UNIQUE_COPY_H
+#define _LIBCPP___ALGORITHM_RANGES_UNIQUE_COPY_H
+
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/make_projected.h>
+#include <__algorithm/unique_copy.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/projected.h>
+#include <__iterator/readable_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _InIter, class _OutIter>
+using unique_copy_result = in_out_result<_InIter, _OutIter>;
+
+namespace __unique_copy {
+
+template <class _InIter, class _OutIter>
+concept __can_reread_from_output = (input_iterator<_OutIter> && same_as<iter_value_t<_InIter>, iter_value_t<_OutIter>>);
+
+struct __fn {
+  template <class _InIter, class _OutIter>
+  static consteval auto __get_algo_tag() {
+    if constexpr (forward_iterator<_InIter>) {
+      return __unique_copy_tags::__reread_from_input_tag{};
+    } else if constexpr (__can_reread_from_output<_InIter, _OutIter>) {
+      return __unique_copy_tags::__reread_from_output_tag{};
+    } else if constexpr (indirectly_copyable_storable<_InIter, _OutIter>) {
+      return __unique_copy_tags::__read_from_tmp_value_tag{};
+    }
+  }
+
+  template <class _InIter, class _OutIter>
+  using __algo_tag_t = decltype(__get_algo_tag<_InIter, _OutIter>());
+
+  template <input_iterator _InIter,
+            sentinel_for<_InIter> _Sent,
+            weakly_incrementable _OutIter,
+            class _Proj                                                    = identity,
+            indirect_equivalence_relation<projected<_InIter, _Proj>> _Comp = ranges::equal_to>
+    requires indirectly_copyable<_InIter, _OutIter> &&
+             (forward_iterator<_InIter> ||
+              (input_iterator<_OutIter> && same_as<iter_value_t<_InIter>, iter_value_t<_OutIter>>) ||
+              indirectly_copyable_storable<_InIter, _OutIter>)
+  _LIBCPP_HIDE_FROM_ABI constexpr unique_copy_result<_InIter, _OutIter>
+  operator()(_InIter __first, _Sent __last, _OutIter __result, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __ret = std::__unique_copy<_RangeAlgPolicy>(
+        std::move(__first),
+        std::move(__last),
+        std::move(__result),
+        std::__make_projected(__comp, __proj),
+        __algo_tag_t<_InIter, _OutIter>());
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+
+  template <input_range _Range,
+            weakly_incrementable _OutIter,
+            class _Proj                                                               = identity,
+            indirect_equivalence_relation<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::equal_to>
+    requires indirectly_copyable<iterator_t<_Range>, _OutIter> &&
+      (forward_iterator<iterator_t<_Range>> ||
+       (input_iterator<_OutIter> && same_as<range_value_t<_Range>, iter_value_t<_OutIter>>) ||
+       indirectly_copyable_storable<iterator_t<_Range>, _OutIter>)
+  _LIBCPP_HIDE_FROM_ABI constexpr unique_copy_result<borrowed_iterator_t<_Range>, _OutIter>
+  operator()(_Range&& __range, _OutIter __result, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __ret = std::__unique_copy<_RangeAlgPolicy>(
+        ranges::begin(__range),
+        ranges::end(__range),
+        std::move(__result),
+        std::__make_projected(__comp, __proj),
+        __algo_tag_t<iterator_t<_Range>, _OutIter>());
+    return {std::move(__ret.first), std::move(__ret.second)};
+  }
+};
+
+} // namespace __unique_copy
+
+inline namespace __cpo {
+inline constexpr auto unique_copy = __unique_copy::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_UNIQUE_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/ranges_upper_bound.h b/app/src/main/cpp/libcxx/include/__algorithm/ranges_upper_bound.h
new file mode 100644
index 0000000..a134080
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/ranges_upper_bound.h
@@ -0,0 +1,75 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_UPPER_BOUND_H
+#define _LIBCPP___ALGORITHM_RANGES_UPPER_BOUND_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/lower_bound.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+namespace __upper_bound {
+struct __fn {
+  template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity,
+            indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  _Iter operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
+    auto __comp_lhs_rhs_swapped = [&](const auto& __lhs, const auto& __rhs) {
+      return !std::invoke(__comp, __rhs, __lhs);
+    };
+
+    return std::__lower_bound_impl<_RangeAlgPolicy>(__first, __last, __value, __comp_lhs_rhs_swapped, __proj);
+  }
+
+  template <forward_range _Range, class _Type, class _Proj = identity,
+            indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr
+  borrowed_iterator_t<_Range> operator()(_Range&& __r,
+                                         const _Type& __value,
+                                         _Comp __comp = {},
+                                         _Proj __proj = {}) const {
+    auto __comp_lhs_rhs_swapped = [&](const auto& __lhs, const auto& __rhs) {
+      return !std::invoke(__comp, __rhs, __lhs);
+    };
+
+    return std::__lower_bound_impl<_RangeAlgPolicy>(ranges::begin(__r),
+                                                   ranges::end(__r),
+                                                   __value,
+                                                   __comp_lhs_rhs_swapped,
+                                                   __proj);
+  }
+};
+} // namespace __upper_bound
+
+inline namespace __cpo {
+  inline constexpr auto upper_bound = __upper_bound::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_UPPER_BOUND_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/remove.h b/app/src/main/cpp/libcxx/include/__algorithm/remove.h
new file mode 100644
index 0000000..533e41b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/remove.h
@@ -0,0 +1,45 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_REMOVE_H
+#define _LIBCPP___ALGORITHM_REMOVE_H
+
+#include <__algorithm/find.h>
+#include <__algorithm/find_if.h>
+#include <__config>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _ForwardIterator, class _Tp>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+remove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)
+{
+    __first = _VSTD::find(__first, __last, __value);
+    if (__first != __last)
+    {
+        _ForwardIterator __i = __first;
+        while (++__i != __last)
+        {
+            if (!(*__i == __value))
+            {
+                *__first = _VSTD::move(*__i);
+                ++__first;
+            }
+        }
+    }
+    return __first;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_REMOVE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/remove_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/remove_copy.h
new file mode 100644
index 0000000..ecba08a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/remove_copy.h
@@ -0,0 +1,38 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_REMOVE_COPY_H
+#define _LIBCPP___ALGORITHM_REMOVE_COPY_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _OutputIterator, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+remove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value)
+{
+    for (; __first != __last; ++__first)
+    {
+        if (!(*__first == __value))
+        {
+            *__result = *__first;
+            ++__result;
+        }
+    }
+    return __result;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_REMOVE_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/remove_copy_if.h b/app/src/main/cpp/libcxx/include/__algorithm/remove_copy_if.h
new file mode 100644
index 0000000..2f235fd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/remove_copy_if.h
@@ -0,0 +1,38 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_REMOVE_COPY_IF_H
+#define _LIBCPP___ALGORITHM_REMOVE_COPY_IF_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _OutputIterator, class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+remove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred)
+{
+    for (; __first != __last; ++__first)
+    {
+        if (!__pred(*__first))
+        {
+            *__result = *__first;
+            ++__result;
+        }
+    }
+    return __result;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_REMOVE_COPY_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/remove_if.h b/app/src/main/cpp/libcxx/include/__algorithm/remove_if.h
new file mode 100644
index 0000000..2735072
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/remove_if.h
@@ -0,0 +1,44 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_REMOVE_IF_H
+#define _LIBCPP___ALGORITHM_REMOVE_IF_H
+
+#include <__algorithm/find_if.h>
+#include <__config>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _ForwardIterator, class _Predicate>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+remove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
+{
+    __first = _VSTD::find_if<_ForwardIterator, _Predicate&>(__first, __last, __pred);
+    if (__first != __last)
+    {
+        _ForwardIterator __i = __first;
+        while (++__i != __last)
+        {
+            if (!__pred(*__i))
+            {
+                *__first = _VSTD::move(*__i);
+                ++__first;
+            }
+        }
+    }
+    return __first;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_REMOVE_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/replace.h b/app/src/main/cpp/libcxx/include/__algorithm/replace.h
new file mode 100644
index 0000000..ce62150
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/replace.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_REPLACE_H
+#define _LIBCPP___ALGORITHM_REPLACE_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _ForwardIterator, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+replace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value)
+{
+    for (; __first != __last; ++__first)
+        if (*__first == __old_value)
+            *__first = __new_value;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_REPLACE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/replace_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/replace_copy.h
new file mode 100644
index 0000000..bebb14c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/replace_copy.h
@@ -0,0 +1,36 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_REPLACE_COPY_H
+#define _LIBCPP___ALGORITHM_REPLACE_COPY_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _OutputIterator, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+replace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result,
+             const _Tp& __old_value, const _Tp& __new_value)
+{
+    for (; __first != __last; ++__first, (void) ++__result)
+        if (*__first == __old_value)
+            *__result = __new_value;
+        else
+            *__result = *__first;
+    return __result;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_REPLACE_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/replace_copy_if.h b/app/src/main/cpp/libcxx/include/__algorithm/replace_copy_if.h
new file mode 100644
index 0000000..e1ddb52
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/replace_copy_if.h
@@ -0,0 +1,36 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_REPLACE_COPY_IF_H
+#define _LIBCPP___ALGORITHM_REPLACE_COPY_IF_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+replace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result,
+                _Predicate __pred, const _Tp& __new_value)
+{
+    for (; __first != __last; ++__first, (void) ++__result)
+        if (__pred(*__first))
+            *__result = __new_value;
+        else
+            *__result = *__first;
+    return __result;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_REPLACE_COPY_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/replace_if.h b/app/src/main/cpp/libcxx/include/__algorithm/replace_if.h
new file mode 100644
index 0000000..b3a3367
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/replace_if.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_REPLACE_IF_H
+#define _LIBCPP___ALGORITHM_REPLACE_IF_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _ForwardIterator, class _Predicate, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+replace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value)
+{
+    for (; __first != __last; ++__first)
+        if (__pred(*__first))
+            *__first = __new_value;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_REPLACE_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/reverse.h b/app/src/main/cpp/libcxx/include/__algorithm/reverse.h
new file mode 100644
index 0000000..aa76951
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/reverse.h
@@ -0,0 +1,65 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_REVERSE_H
+#define _LIBCPP___ALGORITHM_REVERSE_H
+
+#include <__algorithm/iter_swap.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _BidirectionalIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__reverse_impl(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag)
+{
+    while (__first != __last)
+    {
+        if (__first == --__last)
+            break;
+        _IterOps<_AlgPolicy>::iter_swap(__first, __last);
+        ++__first;
+    }
+}
+
+template <class _AlgPolicy, class _RandomAccessIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__reverse_impl(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag)
+{
+    if (__first != __last)
+        for (; __first < --__last; ++__first)
+            _IterOps<_AlgPolicy>::iter_swap(__first, __last);
+}
+
+template <class _AlgPolicy, class _BidirectionalIterator, class _Sentinel>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void __reverse(_BidirectionalIterator __first, _Sentinel __last) {
+  using _IterCategory = typename _IterOps<_AlgPolicy>::template __iterator_category<_BidirectionalIterator>;
+  std::__reverse_impl<_AlgPolicy>(std::move(__first), std::move(__last), _IterCategory());
+}
+
+template <class _BidirectionalIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)
+{
+  std::__reverse<_ClassicAlgPolicy>(std::move(__first), std::move(__last));
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_REVERSE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/reverse_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/reverse_copy.h
new file mode 100644
index 0000000..f4a0e97
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/reverse_copy.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_REVERSE_COPY_H
+#define _LIBCPP___ALGORITHM_REVERSE_COPY_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _BidirectionalIterator, class _OutputIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result)
+{
+    for (; __first != __last; ++__result)
+        *__result = *--__last;
+    return __result;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_REVERSE_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/rotate.h b/app/src/main/cpp/libcxx/include/__algorithm/rotate.h
new file mode 100644
index 0000000..8934ce0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/rotate.h
@@ -0,0 +1,221 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_ROTATE_H
+#define _LIBCPP___ALGORITHM_ROTATE_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/move.h>
+#include <__algorithm/move_backward.h>
+#include <__algorithm/swap_ranges.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _ForwardIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _ForwardIterator
+__rotate_left(_ForwardIterator __first, _ForwardIterator __last)
+{
+    typedef typename iterator_traits<_ForwardIterator>::value_type value_type;
+    using _Ops = _IterOps<_AlgPolicy>;
+
+    value_type __tmp = _Ops::__iter_move(__first);
+    _ForwardIterator __lm1 = std::__move<_AlgPolicy>(
+        _Ops::next(__first), __last, __first).second;
+    *__lm1 = _VSTD::move(__tmp);
+    return __lm1;
+}
+
+template <class _AlgPolicy, class _BidirectionalIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _BidirectionalIterator
+__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last)
+{
+    typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
+    using _Ops = _IterOps<_AlgPolicy>;
+
+    _BidirectionalIterator __lm1 = _Ops::prev(__last);
+    value_type __tmp = _Ops::__iter_move(__lm1);
+    _BidirectionalIterator __fp1 = std::__move_backward<_AlgPolicy>(__first, __lm1, std::move(__last)).second;
+    *__first = _VSTD::move(__tmp);
+    return __fp1;
+}
+
+template <class _AlgPolicy, class _ForwardIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 _ForwardIterator
+__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last)
+{
+    _ForwardIterator __i = __middle;
+    while (true)
+    {
+        _IterOps<_AlgPolicy>::iter_swap(__first, __i);
+        ++__first;
+        if (++__i == __last)
+            break;
+        if (__first == __middle)
+            __middle = __i;
+    }
+    _ForwardIterator __r = __first;
+    if (__first != __middle)
+    {
+        __i = __middle;
+        while (true)
+        {
+            _IterOps<_AlgPolicy>::iter_swap(__first, __i);
+            ++__first;
+            if (++__i == __last)
+            {
+                if (__first == __middle)
+                    break;
+                __i = __middle;
+            }
+            else if (__first == __middle)
+                __middle = __i;
+        }
+    }
+    return __r;
+}
+
+template<typename _Integral>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX17 _Integral
+__algo_gcd(_Integral __x, _Integral __y)
+{
+    do
+    {
+        _Integral __t = __x % __y;
+        __x = __y;
+        __y = __t;
+    } while (__y);
+    return __x;
+}
+
+template <class _AlgPolicy, typename _RandomAccessIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 _RandomAccessIterator
+__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last)
+{
+    typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+    typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
+    using _Ops = _IterOps<_AlgPolicy>;
+
+    const difference_type __m1 = __middle - __first;
+    const difference_type __m2 = _Ops::distance(__middle, __last);
+    if (__m1 == __m2)
+    {
+        std::__swap_ranges<_AlgPolicy>(__first, __middle, __middle, __last);
+        return __middle;
+    }
+    const difference_type __g = _VSTD::__algo_gcd(__m1, __m2);
+    for (_RandomAccessIterator __p = __first + __g; __p != __first;)
+    {
+        value_type __t(_Ops::__iter_move(--__p));
+        _RandomAccessIterator __p1 = __p;
+        _RandomAccessIterator __p2 = __p1 + __m1;
+        do
+        {
+            *__p1 = _Ops::__iter_move(__p2);
+            __p1 = __p2;
+            const difference_type __d = _Ops::distance(__p2, __last);
+            if (__m1 < __d)
+                __p2 += __m1;
+            else
+                __p2 = __first + (__m1 - __d);
+        } while (__p2 != __p);
+        *__p1 = _VSTD::move(__t);
+    }
+    return __first + __m2;
+}
+
+template <class _AlgPolicy, class _ForwardIterator>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _ForwardIterator
+__rotate_impl(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last,
+         _VSTD::forward_iterator_tag)
+{
+    typedef typename iterator_traits<_ForwardIterator>::value_type value_type;
+    if (is_trivially_move_assignable<value_type>::value)
+    {
+        if (_IterOps<_AlgPolicy>::next(__first) == __middle)
+            return std::__rotate_left<_AlgPolicy>(__first, __last);
+    }
+    return std::__rotate_forward<_AlgPolicy>(__first, __middle, __last);
+}
+
+template <class _AlgPolicy, class _BidirectionalIterator>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _BidirectionalIterator
+__rotate_impl(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last,
+         bidirectional_iterator_tag)
+{
+    typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
+    if (is_trivially_move_assignable<value_type>::value)
+    {
+        if (_IterOps<_AlgPolicy>::next(__first) == __middle)
+            return std::__rotate_left<_AlgPolicy>(__first, __last);
+        if (_IterOps<_AlgPolicy>::next(__middle) == __last)
+            return std::__rotate_right<_AlgPolicy>(__first, __last);
+    }
+    return std::__rotate_forward<_AlgPolicy>(__first, __middle, __last);
+}
+
+template <class _AlgPolicy, class _RandomAccessIterator>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _RandomAccessIterator
+__rotate_impl(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last,
+         random_access_iterator_tag)
+{
+    typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
+    if (is_trivially_move_assignable<value_type>::value)
+    {
+        if (_IterOps<_AlgPolicy>::next(__first) == __middle)
+            return std::__rotate_left<_AlgPolicy>(__first, __last);
+        if (_IterOps<_AlgPolicy>::next(__middle) == __last)
+            return std::__rotate_right<_AlgPolicy>(__first, __last);
+        return std::__rotate_gcd<_AlgPolicy>(__first, __middle, __last);
+    }
+    return std::__rotate_forward<_AlgPolicy>(__first, __middle, __last);
+}
+
+template <class _AlgPolicy, class _Iterator, class _Sentinel>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_Iterator, _Iterator>
+__rotate(_Iterator __first, _Iterator __middle, _Sentinel __last) {
+  using _Ret = pair<_Iterator, _Iterator>;
+  _Iterator __last_iter = _IterOps<_AlgPolicy>::next(__middle, __last);
+
+  if (__first == __middle)
+      return _Ret(__last_iter, __last_iter);
+  if (__middle == __last)
+      return _Ret(std::move(__first), std::move(__last_iter));
+
+  using _IterCategory = typename _IterOps<_AlgPolicy>::template __iterator_category<_Iterator>;
+  auto __result = std::__rotate_impl<_AlgPolicy>(
+      std::move(__first), std::move(__middle), __last_iter, _IterCategory());
+
+  return _Ret(std::move(__result), std::move(__last_iter));
+}
+
+template <class _ForwardIterator>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last)
+{
+  return std::__rotate<_ClassicAlgPolicy>(
+      std::move(__first), std::move(__middle), std::move(__last)).first;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_ROTATE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/rotate_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/rotate_copy.h
new file mode 100644
index 0000000..c154649
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/rotate_copy.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_ROTATE_COPY_H
+#define _LIBCPP___ALGORITHM_ROTATE_COPY_H
+
+#include <__algorithm/copy.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _ForwardIterator, class _OutputIterator>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result)
+{
+    return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result));
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_ROTATE_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/sample.h b/app/src/main/cpp/libcxx/include/__algorithm/sample.h
new file mode 100644
index 0000000..f403ba6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/sample.h
@@ -0,0 +1,112 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SAMPLE_H
+#define _LIBCPP___ALGORITHM_SAMPLE_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/min.h>
+#include <__assert>
+#include <__config>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__random/uniform_int_distribution.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy,
+          class _PopulationIterator, class _PopulationSentinel, class _SampleIterator, class _Distance,
+          class _UniformRandomNumberGenerator>
+_LIBCPP_INLINE_VISIBILITY
+_SampleIterator __sample(_PopulationIterator __first,
+                         _PopulationSentinel __last, _SampleIterator __output_iter,
+                         _Distance __n,
+                         _UniformRandomNumberGenerator& __g,
+                         input_iterator_tag) {
+
+  _Distance __k = 0;
+  for (; __first != __last && __k < __n; ++__first, (void) ++__k)
+    __output_iter[__k] = *__first;
+  _Distance __sz = __k;
+  for (; __first != __last; ++__first, (void) ++__k) {
+    _Distance __r = uniform_int_distribution<_Distance>(0, __k)(__g);
+    if (__r < __sz)
+      __output_iter[__r] = *__first;
+  }
+  return __output_iter + _VSTD::min(__n, __k);
+}
+
+template <class _AlgPolicy,
+          class _PopulationIterator, class _PopulationSentinel, class _SampleIterator, class _Distance,
+          class _UniformRandomNumberGenerator>
+_LIBCPP_INLINE_VISIBILITY
+_SampleIterator __sample(_PopulationIterator __first,
+                         _PopulationSentinel __last, _SampleIterator __output_iter,
+                         _Distance __n,
+                         _UniformRandomNumberGenerator& __g,
+                         forward_iterator_tag) {
+  _Distance __unsampled_sz = _IterOps<_AlgPolicy>::distance(__first, __last);
+  for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) {
+    _Distance __r = uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g);
+    if (__r < __n) {
+      *__output_iter++ = *__first;
+      --__n;
+    }
+  }
+  return __output_iter;
+}
+
+template <class _AlgPolicy,
+          class _PopulationIterator, class _PopulationSentinel, class _SampleIterator, class _Distance,
+          class _UniformRandomNumberGenerator>
+_LIBCPP_INLINE_VISIBILITY
+_SampleIterator __sample(_PopulationIterator __first,
+                         _PopulationSentinel __last, _SampleIterator __output_iter,
+                         _Distance __n, _UniformRandomNumberGenerator& __g) {
+  _LIBCPP_ASSERT(__n >= 0, "N must be a positive number.");
+
+  using _PopIterCategory = typename _IterOps<_AlgPolicy>::template __iterator_category<_PopulationIterator>;
+  using _Difference = typename _IterOps<_AlgPolicy>::template __difference_type<_PopulationIterator>;
+  using _CommonType = typename common_type<_Distance, _Difference>::type;
+
+  return std::__sample<_AlgPolicy>(
+      std::move(__first), std::move(__last), std::move(__output_iter), _CommonType(__n),
+      __g, _PopIterCategory());
+}
+
+#if _LIBCPP_STD_VER > 14
+template <class _PopulationIterator, class _SampleIterator, class _Distance,
+          class _UniformRandomNumberGenerator>
+inline _LIBCPP_INLINE_VISIBILITY
+_SampleIterator sample(_PopulationIterator __first,
+                       _PopulationIterator __last, _SampleIterator __output_iter,
+                       _Distance __n, _UniformRandomNumberGenerator&& __g) {
+  static_assert(__is_cpp17_forward_iterator<_PopulationIterator>::value ||
+                __is_cpp17_random_access_iterator<_SampleIterator>::value,
+                "SampleIterator must meet the requirements of RandomAccessIterator");
+
+  return std::__sample<_ClassicAlgPolicy>(
+      std::move(__first), std::move(__last), std::move(__output_iter), __n, __g);
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___ALGORITHM_SAMPLE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/search.h b/app/src/main/cpp/libcxx/include/__algorithm/search.h
new file mode 100644
index 0000000..93771be
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/search.h
@@ -0,0 +1,201 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SEARCH_H
+#define _LIBCPP___ALGORITHM_SEARCH_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__iterator/advance.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/is_callable.h>
+#include <__utility/pair.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy,
+          class _Iter1, class _Sent1,
+          class _Iter2, class _Sent2,
+          class _Pred,
+          class _Proj1,
+          class _Proj2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_Iter1, _Iter1> __search_forward_impl(_Iter1 __first1, _Sent1 __last1,
+                                           _Iter2 __first2, _Sent2 __last2,
+                                           _Pred& __pred,
+                                           _Proj1& __proj1,
+                                           _Proj2& __proj2) {
+  if (__first2 == __last2)
+    return std::make_pair(__first1, __first1); // Everything matches an empty sequence
+  while (true) {
+    // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks
+    while (true) {
+      if (__first1 == __last1) { // return __last1 if no element matches *__first2
+        _IterOps<_AlgPolicy>::__advance_to(__first1, __last1);
+        return std::make_pair(__first1, __first1);
+      }
+      if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2)))
+        break;
+      ++__first1;
+    }
+    // *__first1 matches *__first2, now match elements after here
+    _Iter1 __m1 = __first1;
+    _Iter2 __m2 = __first2;
+    while (true) {
+      if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern)
+        return std::make_pair(__first1, ++__m1);
+      if (++__m1 == __last1) { // Otherwise if source exhaused, pattern not found
+        return std::make_pair(__m1, __m1);
+      }
+
+      // if there is a mismatch, restart with a new __first1
+      if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2)))
+      {
+        ++__first1;
+        break;
+      } // else there is a match, check next elements
+    }
+  }
+}
+
+template <class _AlgPolicy,
+          class _Iter1, class _Sent1,
+          class _Iter2, class _Sent2,
+          class _Pred,
+          class _Proj1,
+          class _Proj2,
+          class _DiffT1,
+          class _DiffT2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_Iter1, _Iter1> __search_random_access_impl(_Iter1 __first1, _Sent1 __last1,
+                                                 _Iter2 __first2, _Sent2 __last2,
+                                                 _Pred& __pred,
+                                                 _Proj1& __proj1,
+                                                 _Proj2& __proj2,
+                                                 _DiffT1 __size1,
+                                                 _DiffT2 __size2) {
+  const _Iter1 __s = __first1 + __size1 - _DiffT1(__size2 - 1); // Start of pattern match can't go beyond here
+
+  while (true) {
+    while (true) {
+      if (__first1 == __s) {
+        _IterOps<_AlgPolicy>::__advance_to(__first1, __last1);
+        return std::make_pair(__first1, __first1);
+      }
+      if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2)))
+        break;
+      ++__first1;
+    }
+
+    _Iter1 __m1 = __first1;
+    _Iter2 __m2 = __first2;
+    while (true) {
+      if (++__m2 == __last2)
+        return std::make_pair(__first1, __first1 + _DiffT1(__size2));
+      ++__m1; // no need to check range on __m1 because __s guarantees we have enough source
+      if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) {
+        ++__first1;
+        break;
+      }
+    }
+  }
+}
+
+template <class _Iter1, class _Sent1,
+          class _Iter2, class _Sent2,
+          class _Pred,
+          class _Proj1,
+          class _Proj2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_Iter1, _Iter1> __search_impl(_Iter1 __first1, _Sent1 __last1,
+                                   _Iter2 __first2, _Sent2 __last2,
+                                   _Pred& __pred,
+                                   _Proj1& __proj1,
+                                   _Proj2& __proj2,
+                                   __enable_if_t<__is_cpp17_random_access_iterator<_Iter1>::value
+                                              && __is_cpp17_random_access_iterator<_Iter2>::value>* = nullptr) {
+
+  auto __size2 = __last2 - __first2;
+  if (__size2 == 0)
+    return std::make_pair(__first1, __first1);
+
+  auto __size1 = __last1 - __first1;
+  if (__size1 < __size2) {
+    return std::make_pair(__last1, __last1);
+  }
+
+  return std::__search_random_access_impl<_ClassicAlgPolicy>(__first1, __last1,
+                                                             __first2, __last2,
+                                                             __pred,
+                                                             __proj1,
+                                                             __proj2,
+                                                             __size1,
+                                                             __size2);
+}
+
+template <class _Iter1, class _Sent1,
+          class _Iter2, class _Sent2,
+          class _Pred,
+          class _Proj1,
+          class _Proj2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_Iter1, _Iter1> __search_impl(_Iter1 __first1, _Sent1 __last1,
+                                   _Iter2 __first2, _Sent2 __last2,
+                                   _Pred& __pred,
+                                   _Proj1& __proj1,
+                                   _Proj2& __proj2,
+                                   __enable_if_t<__is_cpp17_forward_iterator<_Iter1>::value
+                                              && __is_cpp17_forward_iterator<_Iter2>::value
+                                              && !(__is_cpp17_random_access_iterator<_Iter1>::value
+                                                && __is_cpp17_random_access_iterator<_Iter2>::value)>* = nullptr) {
+  return std::__search_forward_impl<_ClassicAlgPolicy>(__first1, __last1,
+                                                       __first2, __last2,
+                                                       __pred,
+                                                       __proj1,
+                                                       __proj2);
+}
+
+template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_ForwardIterator1 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
+                         _ForwardIterator2 __first2, _ForwardIterator2 __last2,
+                         _BinaryPredicate __pred) {
+  static_assert(__is_callable<_BinaryPredicate, decltype(*__first1), decltype(*__first2)>::value,
+                "BinaryPredicate has to be callable");
+  auto __proj = __identity();
+  return std::__search_impl(__first1, __last1, __first2, __last2, __pred, __proj, __proj).first;
+}
+
+template <class _ForwardIterator1, class _ForwardIterator2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_ForwardIterator1 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
+                         _ForwardIterator2 __first2, _ForwardIterator2 __last2) {
+  return std::search(__first1, __last1, __first2, __last2, __equal_to());
+}
+
+#if _LIBCPP_STD_VER > 14
+template <class _ForwardIterator, class _Searcher>
+_LIBCPP_NODISCARD_EXT _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher& __s) {
+  return __s(__f, __l).first;
+}
+
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_SEARCH_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/search_n.h b/app/src/main/cpp/libcxx/include/__algorithm/search_n.h
new file mode 100644
index 0000000..60a0735
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/search_n.h
@@ -0,0 +1,181 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SEARCH_N_H
+#define _LIBCPP___ALGORITHM_SEARCH_N_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__iterator/advance.h>
+#include <__iterator/concepts.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/concepts.h>
+#include <__utility/convert_to_integral.h>
+#include <__utility/pair.h>
+#include <type_traits>  // __convert_to_integral
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class _Proj>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_Iter, _Iter> __search_n_forward_impl(_Iter __first, _Sent __last,
+                                           _SizeT __count,
+                                           const _Type& __value,
+                                           _Pred& __pred,
+                                           _Proj& __proj) {
+  if (__count <= 0)
+    return std::make_pair(__first, __first);
+  while (true) {
+    // Find first element in sequence that matchs __value, with a mininum of loop checks
+    while (true) {
+      if (__first == __last) { // return __last if no element matches __value
+        _IterOps<_AlgPolicy>::__advance_to(__first, __last);
+        return std::make_pair(__first, __first);
+      }
+      if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value))
+        break;
+      ++__first;
+    }
+    // *__first matches __value, now match elements after here
+    _Iter __m = __first;
+    _SizeT __c(0);
+    while (true) {
+      if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern)
+        return std::make_pair(__first, ++__m);
+      if (++__m == __last) { // Otherwise if source exhaused, pattern not found
+        _IterOps<_AlgPolicy>::__advance_to(__first, __last);
+        return std::make_pair(__first, __first);
+      }
+
+      // if there is a mismatch, restart with a new __first
+      if (!std::__invoke(__pred, std::__invoke(__proj, *__m), __value))
+      {
+        __first = __m;
+        ++__first;
+        break;
+      } // else there is a match, check next elements
+    }
+  }
+}
+
+template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class _Proj, class _DiffT>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+std::pair<_Iter, _Iter> __search_n_random_access_impl(_Iter __first, _Sent __last,
+                                                      _SizeT __count,
+                                                      const _Type& __value,
+                                                      _Pred& __pred,
+                                                      _Proj& __proj,
+                                                      _DiffT __size1) {
+  using difference_type = typename iterator_traits<_Iter>::difference_type;
+  if (__count == 0)
+    return std::make_pair(__first, __first);
+  if (__size1 < static_cast<_DiffT>(__count)) {
+    _IterOps<_AlgPolicy>::__advance_to(__first, __last);
+    return std::make_pair(__first, __first);
+  }
+
+  const auto __s = __first + __size1 - difference_type(__count - 1); // Start of pattern match can't go beyond here
+  while (true) {
+    // Find first element in sequence that matchs __value, with a mininum of loop checks
+    while (true) {
+      if (__first >= __s) { // return __last if no element matches __value
+        _IterOps<_AlgPolicy>::__advance_to(__first, __last);
+        return std::make_pair(__first, __first);
+      }
+      if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value))
+        break;
+      ++__first;
+    }
+    // *__first matches __value_, now match elements after here
+    auto __m = __first;
+    _SizeT __c(0);
+    while (true) {
+      if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern)
+        return std::make_pair(__first, __first + _DiffT(__count));
+      ++__m; // no need to check range on __m because __s guarantees we have enough source
+
+      // if there is a mismatch, restart with a new __first
+      if (!std::__invoke(__pred, std::__invoke(__proj, *__m), __value))
+      {
+        __first = __m;
+        ++__first;
+        break;
+      } // else there is a match, check next elements
+    }
+  }
+}
+
+template <class _Iter, class _Sent,
+          class _DiffT,
+          class _Type,
+          class _Pred,
+          class _Proj>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_Iter, _Iter> __search_n_impl(_Iter __first, _Sent __last,
+                                   _DiffT __count,
+                                   const _Type& __value,
+                                   _Pred& __pred,
+                                   _Proj& __proj,
+                                   __enable_if_t<__is_cpp17_random_access_iterator<_Iter>::value>* = nullptr) {
+  return std::__search_n_random_access_impl<_ClassicAlgPolicy>(__first, __last,
+                                                               __count,
+                                                               __value,
+                                                               __pred,
+                                                               __proj,
+                                                               __last - __first);
+}
+
+template <class _Iter1, class _Sent1,
+          class _DiffT,
+          class _Type,
+          class _Pred,
+          class _Proj>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<_Iter1, _Iter1> __search_n_impl(_Iter1 __first, _Sent1 __last,
+                                     _DiffT __count,
+                                     const _Type& __value,
+                                     _Pred& __pred,
+                                     _Proj& __proj,
+                                     __enable_if_t<__is_cpp17_forward_iterator<_Iter1>::value
+                                               && !__is_cpp17_random_access_iterator<_Iter1>::value>* = nullptr) {
+  return std::__search_n_forward_impl<_ClassicAlgPolicy>(__first, __last,
+                                                         __count,
+                                                         __value,
+                                                         __pred,
+                                                         __proj);
+}
+
+template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_ForwardIterator search_n(_ForwardIterator __first, _ForwardIterator __last,
+                          _Size __count,
+                          const _Tp& __value,
+                          _BinaryPredicate __pred) {
+  static_assert(__is_callable<_BinaryPredicate, decltype(*__first), const _Tp&>::value,
+                "BinaryPredicate has to be callable");
+  auto __proj = __identity();
+  return std::__search_n_impl(__first, __last, std::__convert_to_integral(__count), __value, __pred, __proj).first;
+}
+
+template <class _ForwardIterator, class _Size, class _Tp>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_ForwardIterator search_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value) {
+  return std::search_n(__first, __last, std::__convert_to_integral(__count), __value, __equal_to());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_SEARCH_N_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/set_difference.h b/app/src/main/cpp/libcxx/include/__algorithm/set_difference.h
new file mode 100644
index 0000000..cffdc8f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/set_difference.h
@@ -0,0 +1,81 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SET_DIFFERENCE_H
+#define _LIBCPP___ALGORITHM_SET_DIFFERENCE_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/copy.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Comp, class _InIter1, class _Sent1, class _InIter2, class _Sent2, class _OutIter>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<__remove_cvref_t<_InIter1>, __remove_cvref_t<_OutIter> >
+__set_difference(
+    _InIter1&& __first1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result, _Comp&& __comp) {
+  while (__first1 != __last1 && __first2 != __last2) {
+    if (__comp(*__first1, *__first2)) {
+      *__result = *__first1;
+      ++__first1;
+      ++__result;
+    } else if (__comp(*__first2, *__first1)) {
+      ++__first2;
+    } else {
+      ++__first1;
+      ++__first2;
+    }
+  }
+  return std::__copy<_AlgPolicy>(std::move(__first1), std::move(__last1), std::move(__result));
+}
+
+template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator set_difference(
+    _InputIterator1 __first1,
+    _InputIterator1 __last1,
+    _InputIterator2 __first2,
+    _InputIterator2 __last2,
+    _OutputIterator __result,
+    _Compare __comp) {
+  return std::__set_difference<_ClassicAlgPolicy, __comp_ref_type<_Compare> >(
+      __first1, __last1, __first2, __last2, __result, __comp)
+      .second;
+}
+
+template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator set_difference(
+    _InputIterator1 __first1,
+    _InputIterator1 __last1,
+    _InputIterator2 __first2,
+    _InputIterator2 __last2,
+    _OutputIterator __result) {
+  return std::__set_difference<_ClassicAlgPolicy>(
+      __first1,
+      __last1,
+      __first2,
+      __last2,
+      __result,
+      __less<typename iterator_traits<_InputIterator1>::value_type,
+             typename iterator_traits<_InputIterator2>::value_type>()).second;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_SET_DIFFERENCE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/set_intersection.h b/app/src/main/cpp/libcxx/include/__algorithm/set_intersection.h
new file mode 100644
index 0000000..9fa7799
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/set_intersection.h
@@ -0,0 +1,99 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SET_INTERSECTION_H
+#define _LIBCPP___ALGORITHM_SET_INTERSECTION_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InIter1, class _InIter2, class _OutIter>
+struct __set_intersection_result {
+  _InIter1 __in1_;
+  _InIter2 __in2_;
+  _OutIter __out_;
+
+  // need a constructor as C++03 aggregate init is hard
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+  __set_intersection_result(_InIter1&& __in_iter1, _InIter2&& __in_iter2, _OutIter&& __out_iter)
+      : __in1_(std::move(__in_iter1)), __in2_(std::move(__in_iter2)), __out_(std::move(__out_iter)) {}
+};
+
+template <class _AlgPolicy, class _Compare, class _InIter1, class _Sent1, class _InIter2, class _Sent2, class _OutIter>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 __set_intersection_result<_InIter1, _InIter2, _OutIter>
+__set_intersection(
+    _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) {
+  while (__first1 != __last1 && __first2 != __last2) {
+    if (__comp(*__first1, *__first2))
+      ++__first1;
+    else {
+      if (!__comp(*__first2, *__first1)) {
+        *__result = *__first1;
+        ++__result;
+        ++__first1;
+      }
+      ++__first2;
+    }
+  }
+
+  return __set_intersection_result<_InIter1, _InIter2, _OutIter>(
+      _IterOps<_AlgPolicy>::next(std::move(__first1), std::move(__last1)),
+      _IterOps<_AlgPolicy>::next(std::move(__first2), std::move(__last2)),
+      std::move(__result));
+}
+
+template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator set_intersection(
+    _InputIterator1 __first1,
+    _InputIterator1 __last1,
+    _InputIterator2 __first2,
+    _InputIterator2 __last2,
+    _OutputIterator __result,
+    _Compare __comp) {
+  return std::__set_intersection<_ClassicAlgPolicy, __comp_ref_type<_Compare> >(
+             std::move(__first1),
+             std::move(__last1),
+             std::move(__first2),
+             std::move(__last2),
+             std::move(__result),
+             __comp)
+      .__out_;
+}
+
+template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator set_intersection(
+    _InputIterator1 __first1,
+    _InputIterator1 __last1,
+    _InputIterator2 __first2,
+    _InputIterator2 __last2,
+    _OutputIterator __result) {
+  return std::__set_intersection<_ClassicAlgPolicy>(
+             std::move(__first1),
+             std::move(__last1),
+             std::move(__first2),
+             std::move(__last2),
+             std::move(__result),
+             __less<typename iterator_traits<_InputIterator1>::value_type,
+                    typename iterator_traits<_InputIterator2>::value_type>())
+      .__out_;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_SET_INTERSECTION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/set_symmetric_difference.h b/app/src/main/cpp/libcxx/include/__algorithm/set_symmetric_difference.h
new file mode 100644
index 0000000..bcb0958
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/set_symmetric_difference.h
@@ -0,0 +1,105 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SET_SYMMETRIC_DIFFERENCE_H
+#define _LIBCPP___ALGORITHM_SET_SYMMETRIC_DIFFERENCE_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/copy.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InIter1, class _InIter2, class _OutIter>
+struct __set_symmetric_difference_result {
+  _InIter1 __in1_;
+  _InIter2 __in2_;
+  _OutIter __out_;
+
+  // need a constructor as C++03 aggregate init is hard
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+  __set_symmetric_difference_result(_InIter1&& __in_iter1, _InIter2&& __in_iter2, _OutIter&& __out_iter)
+      : __in1_(std::move(__in_iter1)), __in2_(std::move(__in_iter2)), __out_(std::move(__out_iter)) {}
+};
+
+template <class _AlgPolicy, class _Compare, class _InIter1, class _Sent1, class _InIter2, class _Sent2, class _OutIter>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 __set_symmetric_difference_result<_InIter1, _InIter2, _OutIter>
+__set_symmetric_difference(
+    _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) {
+  while (__first1 != __last1) {
+    if (__first2 == __last2) {
+      auto __ret1 = std::__copy<_AlgPolicy>(std::move(__first1), std::move(__last1), std::move(__result));
+      return __set_symmetric_difference_result<_InIter1, _InIter2, _OutIter>(
+          std::move(__ret1.first), std::move(__first2), std::move((__ret1.second)));
+    }
+    if (__comp(*__first1, *__first2)) {
+      *__result = *__first1;
+      ++__result;
+      ++__first1;
+    } else {
+      if (__comp(*__first2, *__first1)) {
+        *__result = *__first2;
+        ++__result;
+      } else {
+        ++__first1;
+      }
+      ++__first2;
+    }
+  }
+  auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result));
+  return __set_symmetric_difference_result<_InIter1, _InIter2, _OutIter>(
+      std::move(__first1), std::move(__ret2.first), std::move((__ret2.second)));
+}
+
+template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator set_symmetric_difference(
+    _InputIterator1 __first1,
+    _InputIterator1 __last1,
+    _InputIterator2 __first2,
+    _InputIterator2 __last2,
+    _OutputIterator __result,
+    _Compare __comp) {
+  return std::__set_symmetric_difference<_ClassicAlgPolicy, __comp_ref_type<_Compare> >(
+             std::move(__first1),
+             std::move(__last1),
+             std::move(__first2),
+             std::move(__last2),
+             std::move(__result),
+             __comp)
+      .__out_;
+}
+
+template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator set_symmetric_difference(
+    _InputIterator1 __first1,
+    _InputIterator1 __last1,
+    _InputIterator2 __first2,
+    _InputIterator2 __last2,
+    _OutputIterator __result) {
+  return std::set_symmetric_difference(
+      std::move(__first1),
+      std::move(__last1),
+      std::move(__first2),
+      std::move(__last2),
+      std::move(__result),
+      __less<typename iterator_traits<_InputIterator1>::value_type,
+             typename iterator_traits<_InputIterator2>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_SET_SYMMETRIC_DIFFERENCE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/set_union.h b/app/src/main/cpp/libcxx/include/__algorithm/set_union.h
new file mode 100644
index 0000000..4d154b8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/set_union.h
@@ -0,0 +1,101 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SET_UNION_H
+#define _LIBCPP___ALGORITHM_SET_UNION_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/copy.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InIter1, class _InIter2, class _OutIter>
+struct __set_union_result {
+  _InIter1 __in1_;
+  _InIter2 __in2_;
+  _OutIter __out_;
+
+  // need a constructor as C++03 aggregate init is hard
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+  __set_union_result(_InIter1&& __in_iter1, _InIter2&& __in_iter2, _OutIter&& __out_iter)
+      : __in1_(std::move(__in_iter1)), __in2_(std::move(__in_iter2)), __out_(std::move(__out_iter)) {}
+};
+
+template <class _AlgPolicy, class _Compare, class _InIter1, class _Sent1, class _InIter2, class _Sent2, class _OutIter>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 __set_union_result<_InIter1, _InIter2, _OutIter> __set_union(
+    _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) {
+  for (; __first1 != __last1; ++__result) {
+    if (__first2 == __last2) {
+      auto __ret1 = std::__copy<_AlgPolicy>(std::move(__first1), std::move(__last1), std::move(__result));
+      return __set_union_result<_InIter1, _InIter2, _OutIter>(
+          std::move(__ret1.first), std::move(__first2), std::move((__ret1.second)));
+    }
+    if (__comp(*__first2, *__first1)) {
+      *__result = *__first2;
+      ++__first2;
+    } else {
+      if (!__comp(*__first1, *__first2)) {
+        ++__first2;
+      }
+      *__result = *__first1;
+      ++__first1;
+    }
+  }
+  auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result));
+  return __set_union_result<_InIter1, _InIter2, _OutIter>(
+      std::move(__first1), std::move(__ret2.first), std::move((__ret2.second)));
+}
+
+template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator set_union(
+    _InputIterator1 __first1,
+    _InputIterator1 __last1,
+    _InputIterator2 __first2,
+    _InputIterator2 __last2,
+    _OutputIterator __result,
+    _Compare __comp) {
+  return std::__set_union<_ClassicAlgPolicy, __comp_ref_type<_Compare> >(
+             std::move(__first1),
+             std::move(__last1),
+             std::move(__first2),
+             std::move(__last2),
+             std::move(__result),
+             __comp)
+      .__out_;
+}
+
+template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator set_union(
+    _InputIterator1 __first1,
+    _InputIterator1 __last1,
+    _InputIterator2 __first2,
+    _InputIterator2 __last2,
+    _OutputIterator __result) {
+  return std::set_union(
+      std::move(__first1),
+      std::move(__last1),
+      std::move(__first2),
+      std::move(__last2),
+      std::move(__result),
+      __less<typename iterator_traits<_InputIterator1>::value_type,
+             typename iterator_traits<_InputIterator2>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_SET_UNION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/shift_left.h b/app/src/main/cpp/libcxx/include/__algorithm/shift_left.h
new file mode 100644
index 0000000..33f06d5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/shift_left.h
@@ -0,0 +1,56 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SHIFT_LEFT_H
+#define _LIBCPP___ALGORITHM_SHIFT_LEFT_H
+
+#include <__algorithm/move.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _ForwardIterator>
+inline _LIBCPP_INLINE_VISIBILITY constexpr
+_ForwardIterator
+shift_left(_ForwardIterator __first, _ForwardIterator __last,
+           typename iterator_traits<_ForwardIterator>::difference_type __n)
+{
+    if (__n == 0) {
+        return __last;
+    }
+
+    _ForwardIterator __m = __first;
+    if constexpr (__is_cpp17_random_access_iterator<_ForwardIterator>::value) {
+        if (__n >= __last - __first) {
+            return __first;
+        }
+        __m += __n;
+    } else {
+        for (; __n > 0; --__n) {
+            if (__m == __last) {
+                return __first;
+            }
+            ++__m;
+        }
+    }
+    return _VSTD::move(__m, __last, __first);
+}
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_SHIFT_LEFT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/shift_right.h b/app/src/main/cpp/libcxx/include/__algorithm/shift_right.h
new file mode 100644
index 0000000..14bc761
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/shift_right.h
@@ -0,0 +1,102 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SHIFT_RIGHT_H
+#define _LIBCPP___ALGORITHM_SHIFT_RIGHT_H
+
+#include <__algorithm/move.h>
+#include <__algorithm/move_backward.h>
+#include <__algorithm/swap_ranges.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/swap.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _ForwardIterator>
+inline _LIBCPP_INLINE_VISIBILITY constexpr
+_ForwardIterator
+shift_right(_ForwardIterator __first, _ForwardIterator __last,
+            typename iterator_traits<_ForwardIterator>::difference_type __n)
+{
+    if (__n == 0) {
+        return __first;
+    }
+
+    if constexpr (__is_cpp17_random_access_iterator<_ForwardIterator>::value) {
+        decltype(__n) __d = __last - __first;
+        if (__n >= __d) {
+            return __last;
+        }
+        _ForwardIterator __m = __first + (__d - __n);
+        return _VSTD::move_backward(__first, __m, __last);
+    } else if constexpr (__is_cpp17_bidirectional_iterator<_ForwardIterator>::value) {
+        _ForwardIterator __m = __last;
+        for (; __n > 0; --__n) {
+            if (__m == __first) {
+                return __last;
+            }
+            --__m;
+        }
+        return _VSTD::move_backward(__first, __m, __last);
+    } else {
+        _ForwardIterator __ret = __first;
+        for (; __n > 0; --__n) {
+            if (__ret == __last) {
+                return __last;
+            }
+            ++__ret;
+        }
+
+        // We have an __n-element scratch space from __first to __ret.
+        // Slide an __n-element window [__trail, __lead) from left to right.
+        // We're essentially doing swap_ranges(__first, __ret, __trail, __lead)
+        // over and over; but once __lead reaches __last we needn't bother
+        // to save the values of elements [__trail, __last).
+
+        auto __trail = __first;
+        auto __lead = __ret;
+        while (__trail != __ret) {
+            if (__lead == __last) {
+                _VSTD::move(__first, __trail, __ret);
+                return __ret;
+            }
+            ++__trail;
+            ++__lead;
+        }
+
+        _ForwardIterator __mid = __first;
+        while (true) {
+            if (__lead == __last) {
+                __trail = _VSTD::move(__mid, __ret, __trail);
+                _VSTD::move(__first, __mid, __trail);
+                return __ret;
+            }
+            swap(*__mid, *__trail);
+            ++__mid;
+            ++__trail;
+            ++__lead;
+            if (__mid == __ret) {
+                __mid = __first;
+            }
+        }
+    }
+}
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_SHIFT_RIGHT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/shuffle.h b/app/src/main/cpp/libcxx/include/__algorithm/shuffle.h
new file mode 100644
index 0000000..f7bce68
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/shuffle.h
@@ -0,0 +1,175 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SHUFFLE_H
+#define _LIBCPP___ALGORITHM_SHUFFLE_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__debug>
+#include <__iterator/iterator_traits.h>
+#include <__random/uniform_int_distribution.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <cstddef>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+class _LIBCPP_TYPE_VIS __libcpp_debug_randomizer {
+public:
+  __libcpp_debug_randomizer() {
+    __state_ = __seed();
+    __inc_ = __state_ + 0xda3e39cb94b95bdbULL;
+    __inc_ = (__inc_ << 1) | 1;
+  }
+  typedef uint_fast32_t result_type;
+
+  static const result_type _Min = 0;
+  static const result_type _Max = 0xFFFFFFFF;
+
+  _LIBCPP_HIDE_FROM_ABI result_type operator()() {
+    uint_fast64_t __oldstate = __state_;
+    __state_ = __oldstate * 6364136223846793005ULL + __inc_;
+    return __oldstate >> 32;
+  }
+
+  static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR result_type min() { return _Min; }
+  static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR result_type max() { return _Max; }
+
+private:
+  uint_fast64_t __state_;
+  uint_fast64_t __inc_;
+  _LIBCPP_HIDE_FROM_ABI static uint_fast64_t __seed() {
+#ifdef _LIBCPP_DEBUG_RANDOMIZE_UNSPECIFIED_STABILITY_SEED
+    return _LIBCPP_DEBUG_RANDOMIZE_UNSPECIFIED_STABILITY_SEED;
+#else
+    static char __x;
+    return reinterpret_cast<uintptr_t>(&__x);
+#endif
+  }
+};
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \
+  || defined(_LIBCPP_BUILDING_LIBRARY)
+class _LIBCPP_TYPE_VIS __rs_default;
+
+_LIBCPP_FUNC_VIS __rs_default __rs_get();
+
+class _LIBCPP_TYPE_VIS __rs_default
+{
+    static unsigned __c_;
+
+    __rs_default();
+public:
+    typedef uint_fast32_t result_type;
+
+    static const result_type _Min = 0;
+    static const result_type _Max = 0xFFFFFFFF;
+
+    __rs_default(const __rs_default&);
+    ~__rs_default();
+
+    result_type operator()();
+
+    static _LIBCPP_CONSTEXPR result_type min() {return _Min;}
+    static _LIBCPP_CONSTEXPR result_type max() {return _Max;}
+
+    friend _LIBCPP_FUNC_VIS __rs_default __rs_get();
+};
+
+_LIBCPP_FUNC_VIS __rs_default __rs_get();
+
+template <class _RandomAccessIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_DEPRECATED_IN_CXX14 void
+random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
+{
+    typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+    typedef uniform_int_distribution<ptrdiff_t> _Dp;
+    typedef typename _Dp::param_type _Pp;
+    difference_type __d = __last - __first;
+    if (__d > 1)
+    {
+        _Dp __uid;
+        __rs_default __g = __rs_get();
+        for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d)
+        {
+            difference_type __i = __uid(__g, _Pp(0, __d));
+            if (__i != difference_type(0))
+                swap(*__first, *(__first + __i));
+        }
+    }
+}
+
+template <class _RandomAccessIterator, class _RandomNumberGenerator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_DEPRECATED_IN_CXX14 void
+random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
+#ifndef _LIBCPP_CXX03_LANG
+               _RandomNumberGenerator&& __rand)
+#else
+               _RandomNumberGenerator& __rand)
+#endif
+{
+    typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+    difference_type __d = __last - __first;
+    if (__d > 1)
+    {
+        for (--__last; __first < __last; ++__first, (void) --__d)
+        {
+            difference_type __i = __rand(__d);
+            if (__i != difference_type(0))
+              swap(*__first, *(__first + __i));
+        }
+    }
+}
+#endif
+
+template <class _AlgPolicy, class _RandomAccessIterator, class _Sentinel, class _UniformRandomNumberGenerator>
+_LIBCPP_HIDE_FROM_ABI _RandomAccessIterator __shuffle(
+    _RandomAccessIterator __first, _Sentinel __last_sentinel, _UniformRandomNumberGenerator&& __g) {
+    typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+    typedef uniform_int_distribution<ptrdiff_t> _Dp;
+    typedef typename _Dp::param_type _Pp;
+
+    auto __original_last = _IterOps<_AlgPolicy>::next(__first, __last_sentinel);
+    auto __last = __original_last;
+    difference_type __d = __last - __first;
+    if (__d > 1)
+    {
+        _Dp __uid;
+        for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d)
+        {
+            difference_type __i = __uid(__g, _Pp(0, __d));
+            if (__i != difference_type(0))
+                _IterOps<_AlgPolicy>::iter_swap(__first, __first + __i);
+        }
+    }
+
+    return __original_last;
+}
+
+template <class _RandomAccessIterator, class _UniformRandomNumberGenerator>
+_LIBCPP_HIDE_FROM_ABI void
+shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, _UniformRandomNumberGenerator&& __g) {
+  (void)std::__shuffle<_ClassicAlgPolicy>(
+      std::move(__first), std::move(__last), std::forward<_UniformRandomNumberGenerator>(__g));
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___ALGORITHM_SHUFFLE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/sift_down.h b/app/src/main/cpp/libcxx/include/__algorithm/sift_down.h
new file mode 100644
index 0000000..e3972fb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/sift_down.h
@@ -0,0 +1,114 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SIFT_DOWN_H
+#define _LIBCPP___ALGORITHM_SIFT_DOWN_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__assert>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 void
+__sift_down(_RandomAccessIterator __first, _Compare&& __comp,
+            typename iterator_traits<_RandomAccessIterator>::difference_type __len,
+            _RandomAccessIterator __start)
+{
+    using _Ops = _IterOps<_AlgPolicy>;
+
+    typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+    typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
+    // left-child of __start is at 2 * __start + 1
+    // right-child of __start is at 2 * __start + 2
+    difference_type __child = __start - __first;
+
+    if (__len < 2 || (__len - 2) / 2 < __child)
+        return;
+
+    __child = 2 * __child + 1;
+    _RandomAccessIterator __child_i = __first + __child;
+
+    if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) {
+        // right-child exists and is greater than left-child
+        ++__child_i;
+        ++__child;
+    }
+
+    // check if we are in heap-order
+    if (__comp(*__child_i, *__start))
+        // we are, __start is larger than its largest child
+        return;
+
+    value_type __top(_Ops::__iter_move(__start));
+    do
+    {
+        // we are not in heap-order, swap the parent with its largest child
+        *__start = _Ops::__iter_move(__child_i);
+        __start = __child_i;
+
+        if ((__len - 2) / 2 < __child)
+            break;
+
+        // recompute the child based off of the updated parent
+        __child = 2 * __child + 1;
+        __child_i = __first + __child;
+
+        if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) {
+            // right-child exists and is greater than left-child
+            ++__child_i;
+            ++__child;
+        }
+
+        // check if we are in heap-order
+    } while (!__comp(*__child_i, __top));
+    *__start = _VSTD::move(__top);
+}
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _RandomAccessIterator
+__floyd_sift_down(_RandomAccessIterator __first, _Compare&& __comp,
+                  typename iterator_traits<_RandomAccessIterator>::difference_type __len)
+{
+    using difference_type = typename iterator_traits<_RandomAccessIterator>::difference_type;
+    _LIBCPP_ASSERT(__len >= 2, "shouldn't be called unless __len >= 2");
+
+    _RandomAccessIterator __hole = __first;
+    _RandomAccessIterator __child_i = __first;
+    difference_type __child = 0;
+
+    while (true) {
+        __child_i += difference_type(__child + 1);
+        __child = 2 * __child + 1;
+
+        if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) {
+            // right-child exists and is greater than left-child
+            ++__child_i;
+            ++__child;
+        }
+
+        // swap __hole with its largest child
+        *__hole = _IterOps<_AlgPolicy>::__iter_move(__child_i);
+        __hole = __child_i;
+
+        // if __hole is now a leaf, we're done
+        if (__child > (__len - 2) / 2)
+            return __hole;
+    }
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_SIFT_DOWN_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/sort.h b/app/src/main/cpp/libcxx/include/__algorithm/sort.h
new file mode 100644
index 0000000..a7d2d55
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/sort.h
@@ -0,0 +1,1001 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SORT_H
+#define _LIBCPP___ALGORITHM_SORT_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/iter_swap.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/min_element.h>
+#include <__algorithm/partial_sort.h>
+#include <__algorithm/unwrap_iter.h>
+#include <__assert>
+#include <__bit/blsr.h>
+#include <__bit/countl.h>
+#include <__bit/countr.h>
+#include <__config>
+#include <__debug>
+#include <__debug_utils/randomize_range.h>
+#include <__functional/operations.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/destruct_n.h>
+#include <__memory/unique_ptr.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/is_arithmetic.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <climits>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Wraps an algorithm policy tag and a comparator in a single struct, used to pass the policy tag around without
+// changing the number of template arguments (to keep the ABI stable). This is only used for the "range" policy tag.
+//
+// To create an object of this type, use `_WrapAlgPolicy<T, C>::type` -- see the specialization below for the rationale.
+template <class _PolicyT, class _CompT, class = void>
+struct _WrapAlgPolicy {
+  using type = _WrapAlgPolicy;
+
+  using _AlgPolicy = _PolicyT;
+  using _Comp = _CompT;
+  _Comp& __comp;
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+  _WrapAlgPolicy(_Comp& __c) : __comp(__c) {}
+};
+
+// Specialization for the "classic" policy tag that avoids creating a struct and simply defines an alias for the
+// comparator. When unwrapping, a pristine comparator is always considered to have the "classic" tag attached. Passing
+// the pristine comparator where possible allows using template instantiations from the dylib.
+template <class _PolicyT, class _CompT>
+struct _WrapAlgPolicy<_PolicyT, _CompT, __enable_if_t<std::is_same<_PolicyT, _ClassicAlgPolicy>::value> > {
+  using type = _CompT;
+};
+
+// Unwraps a pristine functor (e.g. `std::less`) as if it were wrapped using `_WrapAlgPolicy`. The policy tag is always
+// set to "classic".
+template <class _CompT>
+struct _UnwrapAlgPolicy {
+  using _AlgPolicy = _ClassicAlgPolicy;
+  using _Comp = _CompT;
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 static
+  _Comp __get_comp(_Comp __comp) { return __comp; }
+};
+
+// Unwraps a `_WrapAlgPolicy` struct.
+template <class... _Ts>
+struct _UnwrapAlgPolicy<_WrapAlgPolicy<_Ts...> > {
+  using _Wrapped = _WrapAlgPolicy<_Ts...>;
+  using _AlgPolicy = typename _Wrapped::_AlgPolicy;
+  using _Comp = typename _Wrapped::_Comp;
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 static
+  _Comp __get_comp(_Wrapped& __w) { return __w.__comp; }
+};
+
+// stable, 2-3 compares, 0-2 swaps
+
+template <class _AlgPolicy, class _Compare, class _ForwardIterator>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_CONSTEXPR_SINCE_CXX14 unsigned __sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z,
+                                               _Compare __c) {
+  using _Ops = _IterOps<_AlgPolicy>;
+
+  unsigned __r = 0;
+  if (!__c(*__y, *__x))   // if x <= y
+  {
+    if (!__c(*__z, *__y)) // if y <= z
+      return __r;         // x <= y && y <= z
+                          // x <= y && y > z
+    _Ops::iter_swap(__y, __z);     // x <= z && y < z
+    __r = 1;
+    if (__c(*__y, *__x))  // if x > y
+    {
+      _Ops::iter_swap(__x, __y);   // x < y && y <= z
+      __r = 2;
+    }
+    return __r;           // x <= y && y < z
+  }
+  if (__c(*__z, *__y))    // x > y, if y > z
+  {
+    _Ops::iter_swap(__x, __z);     // x < y && y < z
+    __r = 1;
+    return __r;
+  }
+  _Ops::iter_swap(__x, __y);       // x > y && y <= z
+  __r = 1;                // x < y && x <= z
+  if (__c(*__z, *__y))    // if y > z
+  {
+    _Ops::iter_swap(__y, __z);     // x <= y && y < z
+    __r = 2;
+  }
+  return __r;
+}                         // x <= y && y <= z
+
+// stable, 3-6 compares, 0-5 swaps
+
+template <class _AlgPolicy, class _Compare, class _ForwardIterator>
+_LIBCPP_HIDE_FROM_ABI
+unsigned __sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, _ForwardIterator __x4,
+                 _Compare __c) {
+  using _Ops   = _IterOps<_AlgPolicy>;
+  unsigned __r = std::__sort3<_AlgPolicy, _Compare>(__x1, __x2, __x3, __c);
+  if (__c(*__x4, *__x3)) {
+    _Ops::iter_swap(__x3, __x4);
+    ++__r;
+    if (__c(*__x3, *__x2)) {
+      _Ops::iter_swap(__x2, __x3);
+      ++__r;
+      if (__c(*__x2, *__x1)) {
+        _Ops::iter_swap(__x1, __x2);
+        ++__r;
+      }
+    }
+  }
+  return __r;
+}
+
+// stable, 4-10 compares, 0-9 swaps
+
+template <class _WrappedComp, class _ForwardIterator>
+_LIBCPP_HIDDEN unsigned __sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3,
+                                _ForwardIterator __x4, _ForwardIterator __x5, _WrappedComp __wrapped_comp) {
+  using _Unwrap = _UnwrapAlgPolicy<_WrappedComp>;
+  using _AlgPolicy = typename _Unwrap::_AlgPolicy;
+  using _Ops = _IterOps<_AlgPolicy>;
+
+  using _Compare = typename _Unwrap::_Comp;
+  _Compare __c = _Unwrap::__get_comp(__wrapped_comp);
+
+  unsigned __r = std::__sort4<_AlgPolicy, _Compare>(__x1, __x2, __x3, __x4, __c);
+  if (__c(*__x5, *__x4)) {
+    _Ops::iter_swap(__x4, __x5);
+    ++__r;
+    if (__c(*__x4, *__x3)) {
+      _Ops::iter_swap(__x3, __x4);
+      ++__r;
+      if (__c(*__x3, *__x2)) {
+        _Ops::iter_swap(__x2, __x3);
+        ++__r;
+        if (__c(*__x2, *__x1)) {
+          _Ops::iter_swap(__x1, __x2);
+          ++__r;
+        }
+      }
+    }
+  }
+  return __r;
+}
+
+template <class _AlgPolicy, class _Compare, class _ForwardIterator>
+_LIBCPP_HIDE_FROM_ABI unsigned __sort5_wrap_policy(
+    _ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, _ForwardIterator __x4, _ForwardIterator __x5,
+    _Compare __c) {
+  using _WrappedComp = typename _WrapAlgPolicy<_AlgPolicy, _Compare>::type;
+  _WrappedComp __wrapped_comp(__c);
+  return std::__sort5<_WrappedComp, _ForwardIterator>(
+      std::move(__x1), std::move(__x2), std::move(__x3), std::move(__x4), std::move(__x5), __wrapped_comp);
+}
+
+// The comparator being simple is a prerequisite for using the branchless optimization.
+template <class _Tp>
+struct __is_simple_comparator : false_type {};
+template <class _Tp>
+struct __is_simple_comparator<__less<_Tp>&> : true_type {};
+template <class _Tp>
+struct __is_simple_comparator<less<_Tp>&> : true_type {};
+template <class _Tp>
+struct __is_simple_comparator<greater<_Tp>&> : true_type {};
+#if _LIBCPP_STD_VER > 17
+template <>
+struct __is_simple_comparator<ranges::less&> : true_type {};
+template <>
+struct __is_simple_comparator<ranges::greater&> : true_type {};
+#endif
+
+template <class _Compare, class _Iter, class _Tp = typename iterator_traits<_Iter>::value_type>
+using __use_branchless_sort =
+    integral_constant<bool, __is_cpp17_contiguous_iterator<_Iter>::value && sizeof(_Tp) <= sizeof(void*) &&
+                                is_arithmetic<_Tp>::value && __is_simple_comparator<_Compare>::value>;
+
+namespace __detail {
+
+// Size in bits for the bitset in use.
+enum { __block_size = sizeof(uint64_t) * 8 };
+
+} // namespace __detail
+
+// Ensures that __c(*__x, *__y) is true by swapping *__x and *__y if necessary.
+template <class _Compare, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI void __cond_swap(_RandomAccessIterator __x, _RandomAccessIterator __y, _Compare __c) {
+  // Note: this function behaves correctly even with proxy iterators (because it relies on `value_type`).
+  using value_type = typename iterator_traits<_RandomAccessIterator>::value_type;
+  bool __r = __c(*__x, *__y);
+  value_type __tmp = __r ? *__x : *__y;
+  *__y = __r ? *__y : *__x;
+  *__x = __tmp;
+}
+
+// Ensures that *__x, *__y and *__z are ordered according to the comparator __c,
+// under the assumption that *__y and *__z are already ordered.
+template <class _Compare, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI void __partially_sorted_swap(_RandomAccessIterator __x, _RandomAccessIterator __y,
+                                                          _RandomAccessIterator __z, _Compare __c) {
+  // Note: this function behaves correctly even with proxy iterators (because it relies on `value_type`).
+  using value_type = typename iterator_traits<_RandomAccessIterator>::value_type;
+  bool __r = __c(*__z, *__x);
+  value_type __tmp = __r ? *__z : *__x;
+  *__z = __r ? *__x : *__z;
+  __r = __c(__tmp, *__y);
+  *__x = __r ? *__x : *__y;
+  *__y = __r ? *__y : __tmp;
+}
+
+template <class, class _Compare, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI __enable_if_t<__use_branchless_sort<_Compare, _RandomAccessIterator>::value, void>
+__sort3_maybe_branchless(_RandomAccessIterator __x1, _RandomAccessIterator __x2, _RandomAccessIterator __x3,
+                         _Compare __c) {
+  std::__cond_swap<_Compare>(__x2, __x3, __c);
+  std::__partially_sorted_swap<_Compare>(__x1, __x2, __x3, __c);
+}
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI __enable_if_t<!__use_branchless_sort<_Compare, _RandomAccessIterator>::value, void>
+__sort3_maybe_branchless(_RandomAccessIterator __x1, _RandomAccessIterator __x2, _RandomAccessIterator __x3,
+                         _Compare __c) {
+  std::__sort3<_AlgPolicy, _Compare>(__x1, __x2, __x3, __c);
+}
+
+template <class, class _Compare, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI __enable_if_t<__use_branchless_sort<_Compare, _RandomAccessIterator>::value, void>
+__sort4_maybe_branchless(_RandomAccessIterator __x1, _RandomAccessIterator __x2, _RandomAccessIterator __x3,
+                         _RandomAccessIterator __x4, _Compare __c) {
+  std::__cond_swap<_Compare>(__x1, __x3, __c);
+  std::__cond_swap<_Compare>(__x2, __x4, __c);
+  std::__cond_swap<_Compare>(__x1, __x2, __c);
+  std::__cond_swap<_Compare>(__x3, __x4, __c);
+  std::__cond_swap<_Compare>(__x2, __x3, __c);
+}
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI __enable_if_t<!__use_branchless_sort<_Compare, _RandomAccessIterator>::value, void>
+__sort4_maybe_branchless(_RandomAccessIterator __x1, _RandomAccessIterator __x2, _RandomAccessIterator __x3,
+                         _RandomAccessIterator __x4, _Compare __c) {
+  std::__sort4<_AlgPolicy, _Compare>(__x1, __x2, __x3, __x4, __c);
+}
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI __enable_if_t<__use_branchless_sort<_Compare, _RandomAccessIterator>::value, void>
+__sort5_maybe_branchless(
+    _RandomAccessIterator __x1,
+    _RandomAccessIterator __x2,
+    _RandomAccessIterator __x3,
+    _RandomAccessIterator __x4,
+    _RandomAccessIterator __x5,
+    _Compare __c) {
+  std::__cond_swap<_Compare>(__x1, __x2, __c);
+  std::__cond_swap<_Compare>(__x4, __x5, __c);
+  std::__partially_sorted_swap<_Compare>(__x3, __x4, __x5, __c);
+  std::__cond_swap<_Compare>(__x2, __x5, __c);
+  std::__partially_sorted_swap<_Compare>(__x1, __x3, __x4, __c);
+  std::__partially_sorted_swap<_Compare>(__x2, __x3, __x4, __c);
+}
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI __enable_if_t<!__use_branchless_sort<_Compare, _RandomAccessIterator>::value, void>
+__sort5_maybe_branchless(_RandomAccessIterator __x1, _RandomAccessIterator __x2, _RandomAccessIterator __x3,
+                         _RandomAccessIterator __x4, _RandomAccessIterator __x5, _Compare __c) {
+  std::__sort5_wrap_policy<_AlgPolicy, _Compare>(__x1, __x2, __x3, __x4, __x5, __c);
+}
+
+// Assumes size > 0
+template <class _AlgPolicy, class _Compare, class _BidirectionalIterator>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_CONSTEXPR_SINCE_CXX14 void __selection_sort(_BidirectionalIterator __first, _BidirectionalIterator __last,
+                                                    _Compare __comp) {
+  _BidirectionalIterator __lm1 = __last;
+  for (--__lm1; __first != __lm1; ++__first) {
+    _BidirectionalIterator __i = std::__min_element<_Compare>(__first, __last, __comp);
+    if (__i != __first)
+      _IterOps<_AlgPolicy>::iter_swap(__first, __i);
+  }
+}
+
+// Sort the iterator range [__first, __last) using the comparator __comp using
+// the insertion sort algorithm.
+template <class _AlgPolicy, class _Compare, class _BidirectionalIterator>
+_LIBCPP_HIDE_FROM_ABI
+void __insertion_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) {
+  using _Ops = _IterOps<_AlgPolicy>;
+
+  typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
+  if (__first == __last)
+    return;
+  _BidirectionalIterator __i = __first;
+  for (++__i; __i != __last; ++__i) {
+    _BidirectionalIterator __j = __i;
+    --__j;
+    if (__comp(*__i, *__j)) {
+      value_type __t(_Ops::__iter_move(__i));
+      _BidirectionalIterator __k = __j;
+      __j                        = __i;
+      do {
+        *__j = _Ops::__iter_move(__k);
+        __j  = __k;
+      } while (__j != __first && __comp(__t, *--__k));
+      *__j = std::move(__t);
+    }
+  }
+}
+
+// Sort the iterator range [__first, __last) using the comparator __comp using
+// the insertion sort algorithm.  Insertion sort has two loops, outer and inner.
+// The implementation below has not bounds check (unguarded) for the inner loop.
+// Assumes that there is an element in the position (__first - 1) and that each
+// element in the input range is greater or equal to the element at __first - 1.
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+_LIBCPP_HIDE_FROM_ABI void
+__insertion_sort_unguarded(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
+  using _Ops = _IterOps<_AlgPolicy>;
+  typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+  typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
+  if (__first == __last)
+    return;
+  for (_RandomAccessIterator __i = __first + difference_type(1); __i != __last; ++__i) {
+    _RandomAccessIterator __j = __i - difference_type(1);
+    if (__comp(*__i, *__j)) {
+      value_type __t(_Ops::__iter_move(__i));
+      _RandomAccessIterator __k = __j;
+      __j = __i;
+      do {
+        *__j = _Ops::__iter_move(__k);
+        __j = __k;
+      } while (__comp(__t, *--__k)); // No need for bounds check due to the assumption stated above.
+      *__j = std::move(__t);
+    }
+  }
+}
+
+template <class _WrappedComp, class _RandomAccessIterator>
+_LIBCPP_HIDDEN bool __insertion_sort_incomplete(
+    _RandomAccessIterator __first, _RandomAccessIterator __last, _WrappedComp __wrapped_comp) {
+  using _Unwrap = _UnwrapAlgPolicy<_WrappedComp>;
+  using _AlgPolicy = typename _Unwrap::_AlgPolicy;
+  using _Ops = _IterOps<_AlgPolicy>;
+
+  using _Compare = typename _Unwrap::_Comp;
+  _Compare __comp = _Unwrap::__get_comp(__wrapped_comp);
+
+  typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+  switch (__last - __first) {
+  case 0:
+  case 1:
+    return true;
+  case 2:
+    if (__comp(*--__last, *__first))
+      _Ops::iter_swap(__first, __last);
+    return true;
+  case 3:
+    std::__sort3_maybe_branchless<_AlgPolicy, _Compare>(__first, __first + difference_type(1), --__last, __comp);
+    return true;
+  case 4:
+    std::__sort4_maybe_branchless<_AlgPolicy, _Compare>(
+        __first, __first + difference_type(1), __first + difference_type(2), --__last, __comp);
+    return true;
+  case 5:
+    std::__sort5_maybe_branchless<_AlgPolicy, _Compare>(
+        __first, __first + difference_type(1), __first + difference_type(2), __first + difference_type(3),
+        --__last, __comp);
+    return true;
+  }
+  typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
+  _RandomAccessIterator __j = __first + difference_type(2);
+  std::__sort3_maybe_branchless<_AlgPolicy, _Compare>(__first, __first + difference_type(1), __j, __comp);
+  const unsigned __limit = 8;
+  unsigned __count = 0;
+  for (_RandomAccessIterator __i = __j + difference_type(1); __i != __last; ++__i) {
+    if (__comp(*__i, *__j)) {
+      value_type __t(_Ops::__iter_move(__i));
+      _RandomAccessIterator __k = __j;
+      __j = __i;
+      do {
+        *__j = _Ops::__iter_move(__k);
+        __j = __k;
+      } while (__j != __first && __comp(__t, *--__k));
+      *__j = std::move(__t);
+      if (++__count == __limit)
+        return ++__i == __last;
+    }
+    __j = __i;
+  }
+  return true;
+}
+
+template <class _AlgPolicy, class _Compare, class _BidirectionalIterator>
+_LIBCPP_HIDE_FROM_ABI
+void __insertion_sort_move(_BidirectionalIterator __first1, _BidirectionalIterator __last1,
+                           typename iterator_traits<_BidirectionalIterator>::value_type* __first2, _Compare __comp) {
+  using _Ops = _IterOps<_AlgPolicy>;
+
+  typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
+  if (__first1 != __last1) {
+    __destruct_n __d(0);
+    unique_ptr<value_type, __destruct_n&> __h(__first2, __d);
+    value_type* __last2 = __first2;
+    ::new ((void*)__last2) value_type(_Ops::__iter_move(__first1));
+    __d.template __incr<value_type>();
+    for (++__last2; ++__first1 != __last1; ++__last2) {
+      value_type* __j2 = __last2;
+      value_type* __i2 = __j2;
+      if (__comp(*__first1, *--__i2)) {
+        ::new ((void*)__j2) value_type(std::move(*__i2));
+        __d.template __incr<value_type>();
+        for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2)
+          *__j2 = std::move(*__i2);
+        *__j2 = _Ops::__iter_move(__first1);
+      } else {
+        ::new ((void*)__j2) value_type(_Ops::__iter_move(__first1));
+        __d.template __incr<value_type>();
+      }
+    }
+    __h.release();
+  }
+}
+
+template <class _AlgPolicy, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI void __swap_bitmap_pos(
+    _RandomAccessIterator __first, _RandomAccessIterator __last, uint64_t& __left_bitset, uint64_t& __right_bitset) {
+  using _Ops = _IterOps<_AlgPolicy>;
+  typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+  // Swap one pair on each iteration as long as both bitsets have at least one
+  // element for swapping.
+  while (__left_bitset != 0 && __right_bitset != 0) {
+    difference_type tz_left  = __libcpp_ctz(__left_bitset);
+    __left_bitset            = __libcpp_blsr(__left_bitset);
+    difference_type tz_right = __libcpp_ctz(__right_bitset);
+    __right_bitset           = __libcpp_blsr(__right_bitset);
+    _Ops::iter_swap(__first + tz_left, __last - tz_right);
+  }
+}
+
+template <class _Compare,
+          class _RandomAccessIterator,
+          class _ValueType = typename iterator_traits<_RandomAccessIterator>::value_type>
+inline _LIBCPP_HIDE_FROM_ABI void
+__populate_left_bitset(_RandomAccessIterator __first, _Compare __comp, _ValueType& __pivot, uint64_t& __left_bitset) {
+  // Possible vectorization. With a proper "-march" flag, the following loop
+  // will be compiled into a set of SIMD instructions.
+  _RandomAccessIterator __iter = __first;
+  for (int __j = 0; __j < __detail::__block_size;) {
+    bool __comp_result = !__comp(*__iter, __pivot);
+    __left_bitset |= (static_cast<uint64_t>(__comp_result) << __j);
+    __j++;
+    ++__iter;
+  }
+}
+
+template <class _Compare,
+          class _RandomAccessIterator,
+          class _ValueType = typename iterator_traits<_RandomAccessIterator>::value_type>
+inline _LIBCPP_HIDE_FROM_ABI void
+__populate_right_bitset(_RandomAccessIterator __lm1, _Compare __comp, _ValueType& __pivot, uint64_t& __right_bitset) {
+  // Possible vectorization. With a proper "-march" flag, the following loop
+  // will be compiled into a set of SIMD instructions.
+  _RandomAccessIterator __iter = __lm1;
+  for (int __j = 0; __j < __detail::__block_size;) {
+    bool __comp_result = __comp(*__iter, __pivot);
+    __right_bitset |= (static_cast<uint64_t>(__comp_result) << __j);
+    __j++;
+    --__iter;
+  }
+}
+
+template <class _AlgPolicy,
+          class _Compare,
+          class _RandomAccessIterator,
+          class _ValueType = typename iterator_traits<_RandomAccessIterator>::value_type>
+inline _LIBCPP_HIDE_FROM_ABI void __bitset_partition_partial_blocks(
+    _RandomAccessIterator& __first,
+    _RandomAccessIterator& __lm1,
+    _Compare __comp,
+    _ValueType& __pivot,
+    uint64_t& __left_bitset,
+    uint64_t& __right_bitset) {
+  typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+  difference_type __remaining_len = __lm1 - __first + 1;
+  difference_type __l_size;
+  difference_type __r_size;
+  if (__left_bitset == 0 && __right_bitset == 0) {
+    __l_size = __remaining_len / 2;
+    __r_size = __remaining_len - __l_size;
+  } else if (__left_bitset == 0) {
+    // We know at least one side is a full block.
+    __l_size = __remaining_len - __detail::__block_size;
+    __r_size = __detail::__block_size;
+  } else { // if (__right_bitset == 0)
+    __l_size = __detail::__block_size;
+    __r_size = __remaining_len - __detail::__block_size;
+  }
+  // Record the comparison outcomes for the elements currently on the left side.
+  if (__left_bitset == 0) {
+    _RandomAccessIterator __iter = __first;
+    for (int j = 0; j < __l_size; j++) {
+      bool __comp_result = !__comp(*__iter, __pivot);
+      __left_bitset |= (static_cast<uint64_t>(__comp_result) << j);
+      ++__iter;
+    }
+  }
+  // Record the comparison outcomes for the elements currently on the right
+  // side.
+  if (__right_bitset == 0) {
+    _RandomAccessIterator __iter = __lm1;
+    for (int j = 0; j < __r_size; j++) {
+      bool __comp_result = __comp(*__iter, __pivot);
+      __right_bitset |= (static_cast<uint64_t>(__comp_result) << j);
+      --__iter;
+    }
+  }
+  std::__swap_bitmap_pos<_AlgPolicy, _RandomAccessIterator>(__first, __lm1, __left_bitset, __right_bitset);
+  __first += (__left_bitset == 0) ? __l_size : 0;
+  __lm1 -= (__right_bitset == 0) ? __r_size : 0;
+}
+
+template <class _AlgPolicy, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI void __swap_bitmap_pos_within(
+    _RandomAccessIterator& __first, _RandomAccessIterator& __lm1, uint64_t& __left_bitset, uint64_t& __right_bitset) {
+  using _Ops = _IterOps<_AlgPolicy>;
+  typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+  if (__left_bitset) {
+    // Swap within the left side.  Need to find set positions in the reverse
+    // order.
+    while (__left_bitset != 0) {
+      difference_type __tz_left = __detail::__block_size - 1 - __libcpp_clz(__left_bitset);
+      __left_bitset &= (static_cast<uint64_t>(1) << __tz_left) - 1;
+      _RandomAccessIterator it = __first + __tz_left;
+      if (it != __lm1) {
+        _Ops::iter_swap(it, __lm1);
+      }
+      --__lm1;
+    }
+    __first = __lm1 + difference_type(1);
+  } else if (__right_bitset) {
+    // Swap within the right side.  Need to find set positions in the reverse
+    // order.
+    while (__right_bitset != 0) {
+      difference_type __tz_right = __detail::__block_size - 1 - __libcpp_clz(__right_bitset);
+      __right_bitset &= (static_cast<uint64_t>(1) << __tz_right) - 1;
+      _RandomAccessIterator it = __lm1 - __tz_right;
+      if (it != __first) {
+        _Ops::iter_swap(it, __first);
+      }
+      ++__first;
+    }
+  }
+}
+
+// Partition [__first, __last) using the comparator __comp.  *__first has the
+// chosen pivot.  Elements that are equivalent are kept to the left of the
+// pivot.  Returns the iterator for the pivot and a bool value which is true if
+// the provided range is already sorted, false otherwise.  We assume that the
+// length of the range is at least three elements.
+//
+// __bitset_partition uses bitsets for storing outcomes of the comparisons
+// between the pivot and other elements.
+template <class _AlgPolicy, class _RandomAccessIterator, class _Compare>
+_LIBCPP_HIDE_FROM_ABI std::pair<_RandomAccessIterator, bool>
+__bitset_partition(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
+  using _Ops = _IterOps<_AlgPolicy>;
+  typedef typename std::iterator_traits<_RandomAccessIterator>::value_type value_type;
+  typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+  _LIBCPP_ASSERT(__last - __first >= difference_type(3), "");
+
+  _RandomAccessIterator __begin = __first;
+  value_type __pivot(_Ops::__iter_move(__first));
+  // Find the first element greater than the pivot.
+  if (__comp(__pivot, *(__last - difference_type(1)))) {
+    // Not guarded since we know the last element is greater than the pivot.
+    while (!__comp(__pivot, *++__first)) {
+    }
+  } else {
+    while (++__first < __last && !__comp(__pivot, *__first)) {
+    }
+  }
+  // Find the last element less than or equal to the pivot.
+  if (__first < __last) {
+    // It will be always guarded because __introsort will do the median-of-three
+    // before calling this.
+    while (__comp(__pivot, *--__last)) {
+    }
+  }
+  // If the first element greater than the pivot is at or after the
+  // last element less than or equal to the pivot, then we have covered the
+  // entire range without swapping elements.  This implies the range is already
+  // partitioned.
+  bool __already_partitioned = __first >= __last;
+  if (!__already_partitioned) {
+    _Ops::iter_swap(__first, __last);
+    ++__first;
+  }
+
+  // In [__first, __last) __last is not inclusive. From now on, it uses last
+  // minus one to be inclusive on both sides.
+  _RandomAccessIterator __lm1 = __last - difference_type(1);
+  uint64_t __left_bitset      = 0;
+  uint64_t __right_bitset     = 0;
+
+  // Reminder: length = __lm1 - __first + 1.
+  while (__lm1 - __first >= 2 * __detail::__block_size - 1) {
+    // Record the comparison outcomes for the elements currently on the left
+    // side.
+    if (__left_bitset == 0)
+      std::__populate_left_bitset<_Compare>(__first, __comp, __pivot, __left_bitset);
+    // Record the comparison outcomes for the elements currently on the right
+    // side.
+    if (__right_bitset == 0)
+      std::__populate_right_bitset<_Compare>(__lm1, __comp, __pivot, __right_bitset);
+    // Swap the elements recorded to be the candidates for swapping in the
+    // bitsets.
+    std::__swap_bitmap_pos<_AlgPolicy, _RandomAccessIterator>(__first, __lm1, __left_bitset, __right_bitset);
+    // Only advance the iterator if all the elements that need to be moved to
+    // other side were moved.
+    __first += (__left_bitset == 0) ? difference_type(__detail::__block_size) : difference_type(0);
+    __lm1 -= (__right_bitset == 0) ? difference_type(__detail::__block_size) : difference_type(0);
+  }
+  // Now, we have a less-than a block worth of elements on at least one of the
+  // sides.
+  std::__bitset_partition_partial_blocks<_AlgPolicy, _Compare>(
+      __first, __lm1, __comp, __pivot, __left_bitset, __right_bitset);
+  // At least one the bitsets would be empty.  For the non-empty one, we need to
+  // properly partition the elements that appear within that bitset.
+  std::__swap_bitmap_pos_within<_AlgPolicy>(__first, __lm1, __left_bitset, __right_bitset);
+
+  // Move the pivot to its correct position.
+  _RandomAccessIterator __pivot_pos = __first - difference_type(1);
+  if (__begin != __pivot_pos) {
+    *__begin = _Ops::__iter_move(__pivot_pos);
+  }
+  *__pivot_pos = std::move(__pivot);
+  return std::make_pair(__pivot_pos, __already_partitioned);
+}
+
+// Partition [__first, __last) using the comparator __comp.  *__first has the
+// chosen pivot.  Elements that are equivalent are kept to the right of the
+// pivot.  Returns the iterator for the pivot and a bool value which is true if
+// the provided range is already sorted, false otherwise.  We assume that the
+// length of the range is at least three elements.
+template <class _AlgPolicy, class _RandomAccessIterator, class _Compare>
+_LIBCPP_HIDE_FROM_ABI std::pair<_RandomAccessIterator, bool>
+__partition_with_equals_on_right(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
+  using _Ops = _IterOps<_AlgPolicy>;
+  typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+  typedef typename std::iterator_traits<_RandomAccessIterator>::value_type value_type;
+  _LIBCPP_ASSERT(__last - __first >= difference_type(3), "");
+  _RandomAccessIterator __begin = __first;
+  value_type __pivot(_Ops::__iter_move(__first));
+  // Find the first element greater or equal to the pivot.  It will be always
+  // guarded because __introsort will do the median-of-three before calling
+  // this.
+  while (__comp(*++__first, __pivot))
+    ;
+
+  // Find the last element less than the pivot.
+  if (__begin == __first - difference_type(1)) {
+    while (__first < __last && !__comp(*--__last, __pivot))
+      ;
+  } else {
+    // Guarded.
+    while (!__comp(*--__last, __pivot))
+      ;
+  }
+
+  // If the first element greater than or equal to the pivot is at or after the
+  // last element less than the pivot, then we have covered the entire range
+  // without swapping elements.  This implies the range is already partitioned.
+  bool __already_partitioned = __first >= __last;
+  // Go through the remaining elements.  Swap pairs of elements (one to the
+  // right of the pivot and the other to left of the pivot) that are not on the
+  // correct side of the pivot.
+  while (__first < __last) {
+    _Ops::iter_swap(__first, __last);
+    while (__comp(*++__first, __pivot))
+      ;
+    while (!__comp(*--__last, __pivot))
+      ;
+  }
+  // Move the pivot to its correct position.
+  _RandomAccessIterator __pivot_pos = __first - difference_type(1);
+  if (__begin != __pivot_pos) {
+    *__begin = _Ops::__iter_move(__pivot_pos);
+  }
+  *__pivot_pos = std::move(__pivot);
+  return std::make_pair(__pivot_pos, __already_partitioned);
+}
+
+// Similar to the above function.  Elements equivalent to the pivot are put to
+// the left of the pivot.  Returns the iterator to the pivot element.
+template <class _AlgPolicy, class _RandomAccessIterator, class _Compare>
+_LIBCPP_HIDE_FROM_ABI _RandomAccessIterator
+__partition_with_equals_on_left(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
+  using _Ops = _IterOps<_AlgPolicy>;
+  typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+  typedef typename std::iterator_traits<_RandomAccessIterator>::value_type value_type;
+  _RandomAccessIterator __begin = __first;
+  value_type __pivot(_Ops::__iter_move(__first));
+  if (__comp(__pivot, *(__last - difference_type(1)))) {
+    // Guarded.
+    while (!__comp(__pivot, *++__first)) {
+    }
+  } else {
+    while (++__first < __last && !__comp(__pivot, *__first)) {
+    }
+  }
+
+  if (__first < __last) {
+    // It will be always guarded because __introsort will do the
+    // median-of-three before calling this.
+    while (__comp(__pivot, *--__last)) {
+    }
+  }
+  while (__first < __last) {
+    _Ops::iter_swap(__first, __last);
+    while (!__comp(__pivot, *++__first))
+      ;
+    while (__comp(__pivot, *--__last))
+      ;
+  }
+  _RandomAccessIterator __pivot_pos = __first - difference_type(1);
+  if (__begin != __pivot_pos) {
+    *__begin = _Ops::__iter_move(__pivot_pos);
+  }
+  *__pivot_pos = std::move(__pivot);
+  return __first;
+}
+
+// The main sorting function.  Implements introsort combined with other ideas:
+//  - option of using block quick sort for partitioning,
+//  - guarded and unguarded insertion sort for small lengths,
+//  - Tuckey's ninther technique for computing the pivot,
+//  - check on whether partition was not required.
+// The implementation is partly based on Orson Peters' pattern-defeating
+// quicksort, published at: <https://github.com/orlp/pdqsort>.
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator, bool _UseBitSetPartition>
+void __introsort(_RandomAccessIterator __first,
+                 _RandomAccessIterator __last,
+                 _Compare __comp,
+                 typename iterator_traits<_RandomAccessIterator>::difference_type __depth,
+                 bool __leftmost = true) {
+  using _Ops = _IterOps<_AlgPolicy>;
+  typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+  using _Comp_ref = __comp_ref_type<_Compare>;
+  // Upper bound for using insertion sort for sorting.
+  _LIBCPP_CONSTEXPR difference_type __limit = 24;
+  // Lower bound for using Tuckey's ninther technique for median computation.
+  _LIBCPP_CONSTEXPR difference_type __ninther_threshold = 128;
+  while (true) {
+    difference_type __len = __last - __first;
+    switch (__len) {
+    case 0:
+    case 1:
+      return;
+    case 2:
+      if (__comp(*--__last, *__first))
+        _Ops::iter_swap(__first, __last);
+      return;
+    case 3:
+      std::__sort3_maybe_branchless<_AlgPolicy, _Compare>(__first, __first + difference_type(1), --__last, __comp);
+      return;
+    case 4:
+      std::__sort4_maybe_branchless<_AlgPolicy, _Compare>(
+          __first, __first + difference_type(1), __first + difference_type(2), --__last, __comp);
+      return;
+    case 5:
+      std::__sort5_maybe_branchless<_AlgPolicy, _Compare>(
+          __first, __first + difference_type(1), __first + difference_type(2), __first + difference_type(3),
+          --__last, __comp);
+      return;
+    }
+    // Use insertion sort if the length of the range is below the specified limit.
+    if (__len < __limit) {
+      if (__leftmost) {
+        std::__insertion_sort<_AlgPolicy, _Compare>(__first, __last, __comp);
+      } else {
+        std::__insertion_sort_unguarded<_AlgPolicy, _Compare>(__first, __last, __comp);
+      }
+      return;
+    }
+    if (__depth == 0) {
+      // Fallback to heap sort as Introsort suggests.
+      std::__partial_sort<_AlgPolicy, _Compare>(__first, __last, __last, __comp);
+      return;
+    }
+    --__depth;
+    {
+      difference_type __half_len = __len / 2;
+      // Use Tuckey's ninther technique or median of 3 for pivot selection
+      // depending on the length of the range being sorted.
+      if (__len > __ninther_threshold) {
+        std::__sort3<_AlgPolicy, _Compare>(__first, __first + __half_len, __last - difference_type(1), __comp);
+        std::__sort3<_AlgPolicy, _Compare>(
+            __first + difference_type(1), __first + (__half_len - 1), __last - difference_type(2), __comp);
+        std::__sort3<_AlgPolicy, _Compare>(
+            __first + difference_type(2), __first + (__half_len + 1), __last - difference_type(3), __comp);
+        std::__sort3<_AlgPolicy, _Compare>(
+            __first + (__half_len - 1), __first + __half_len, __first + (__half_len + 1), __comp);
+        _Ops::iter_swap(__first, __first + __half_len);
+      } else {
+        std::__sort3<_AlgPolicy, _Compare>(__first + __half_len, __first, __last - difference_type(1), __comp);
+      }
+    }
+    // The elements to the left of the current iterator range are already
+    // sorted.  If the current iterator range to be sorted is not the
+    // leftmost part of the entire iterator range and the pivot is same as
+    // the highest element in the range to the left, then we know that all
+    // the elements in the range [first, pivot] would be equal to the pivot,
+    // assuming the equal elements are put on the left side when
+    // partitioned.  This also means that we do not need to sort the left
+    // side of the partition.
+    if (!__leftmost && !__comp(*(__first - difference_type(1)), *__first)) {
+      __first = std::__partition_with_equals_on_left<_AlgPolicy, _RandomAccessIterator, _Comp_ref>(
+          __first, __last, _Comp_ref(__comp));
+      continue;
+    }
+    // Use bitset partition only if asked for.
+    auto __ret =
+        _UseBitSetPartition
+            ? std::__bitset_partition<_AlgPolicy, _RandomAccessIterator, _Compare>(__first, __last, __comp)
+            : std::__partition_with_equals_on_right<_AlgPolicy, _RandomAccessIterator, _Compare>(__first, __last, __comp);
+    _RandomAccessIterator __i = __ret.first;
+    // [__first, __i) < *__i and *__i <= [__i+1, __last)
+    // If we were given a perfect partition, see if insertion sort is quick...
+    if (__ret.second) {
+      using _WrappedComp = typename _WrapAlgPolicy<_AlgPolicy, _Compare>::type;
+      _WrappedComp __wrapped_comp(__comp);
+      bool __fs = std::__insertion_sort_incomplete<_WrappedComp>(__first, __i, __wrapped_comp);
+      if (std::__insertion_sort_incomplete<_WrappedComp>(__i + difference_type(1), __last, __wrapped_comp)) {
+        if (__fs)
+          return;
+        __last = __i;
+        continue;
+      } else {
+        if (__fs) {
+          __first = ++__i;
+          continue;
+        }
+      }
+    }
+    // Sort the left partiton recursively and the right partition with tail recursion elimination.
+    std::__introsort<_AlgPolicy, _Compare, _RandomAccessIterator, _UseBitSetPartition>(
+        __first, __i, __comp, __depth, __leftmost);
+    __leftmost = false;
+    __first    = ++__i;
+  }
+}
+
+template <typename _Number>
+inline _LIBCPP_HIDE_FROM_ABI _Number __log2i(_Number __n) {
+  if (__n == 0)
+    return 0;
+  if (sizeof(__n) <= sizeof(unsigned))
+    return sizeof(unsigned) * CHAR_BIT - 1 - __libcpp_clz(static_cast<unsigned>(__n));
+  if (sizeof(__n) <= sizeof(unsigned long))
+    return sizeof(unsigned long) * CHAR_BIT - 1 - __libcpp_clz(static_cast<unsigned long>(__n));
+  if (sizeof(__n) <= sizeof(unsigned long long))
+    return sizeof(unsigned long long) * CHAR_BIT - 1 - __libcpp_clz(static_cast<unsigned long long>(__n));
+
+  _Number __log2 = 0;
+  while (__n > 1) {
+    __log2++;
+    __n >>= 1;
+  }
+  return __log2;
+}
+
+template <class _WrappedComp, class _RandomAccessIterator>
+_LIBCPP_HIDDEN void __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _WrappedComp __wrapped_comp) {
+  typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+  difference_type __depth_limit = 2 * std::__log2i(__last - __first);
+
+  using _Unwrap = _UnwrapAlgPolicy<_WrappedComp>;
+  using _AlgPolicy = typename _Unwrap::_AlgPolicy;
+  using _Compare = typename _Unwrap::_Comp;
+  _Compare __comp = _Unwrap::__get_comp(__wrapped_comp);
+  // Only use bitset partitioning for arithmetic types.  We should also check
+  // that the default comparator is in use so that we are sure that there are no
+  // branches in the comparator.
+  std::__introsort<_AlgPolicy,
+                   _Compare,
+                   _RandomAccessIterator,
+                   __use_branchless_sort<_Compare, _RandomAccessIterator>::value>(
+      __first, __last, __comp, __depth_limit);
+}
+
+template <class _Compare, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY void __sort(_Tp** __first, _Tp** __last, __less<_Tp*>&) {
+  __less<uintptr_t> __comp;
+  std::__sort<__less<uintptr_t>&, uintptr_t*>((uintptr_t*)__first, (uintptr_t*)__last, __comp);
+}
+
+extern template _LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&);
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template _LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&);
+#endif
+extern template _LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&);
+extern template _LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&);
+extern template _LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&);
+extern template _LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&);
+extern template _LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&);
+extern template _LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&);
+extern template _LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&);
+extern template _LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&);
+extern template _LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&);
+extern template _LIBCPP_FUNC_VIS void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&);
+extern template _LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&);
+extern template _LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&);
+extern template _LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&);
+
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&);
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&);
+#endif
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&);
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&);
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&);
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&);
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&);
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&);
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&);
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&);
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&);
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&);
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&);
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&);
+extern template _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&);
+
+extern template _LIBCPP_FUNC_VIS unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&);
+
+template <class _AlgPolicy, class _RandomAccessIterator, class _Comp>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void __sort_impl(_RandomAccessIterator __first, _RandomAccessIterator __last, _Comp& __comp) {
+  std::__debug_randomize_range<_AlgPolicy>(__first, __last);
+
+  using _Comp_ref = __comp_ref_type<_Comp>;
+  if (__libcpp_is_constant_evaluated()) {
+    std::__partial_sort<_AlgPolicy>(__first, __last, __last, __comp);
+
+  } else {
+    using _WrappedComp = typename _WrapAlgPolicy<_AlgPolicy, _Comp_ref>::type;
+    _Comp_ref __comp_ref(__comp);
+    _WrappedComp __wrapped_comp(__comp_ref);
+    std::__sort<_WrappedComp>(std::__unwrap_iter(__first), std::__unwrap_iter(__last), __wrapped_comp);
+  }
+}
+
+template <class _RandomAccessIterator, class _Comp>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Comp __comp) {
+  std::__sort_impl<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __comp);
+}
+
+template <class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void sort(_RandomAccessIterator __first, _RandomAccessIterator __last) {
+  std::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_SORT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/sort_heap.h b/app/src/main/cpp/libcxx/include/__algorithm/sort_heap.h
new file mode 100644
index 0000000..8249407
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/sort_heap.h
@@ -0,0 +1,55 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SORT_HEAP_H
+#define _LIBCPP___ALGORITHM_SORT_HEAP_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/pop_heap.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+void __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp) {
+  __comp_ref_type<_Compare> __comp_ref = __comp;
+
+  using difference_type = typename iterator_traits<_RandomAccessIterator>::difference_type;
+  for (difference_type __n = __last - __first; __n > 1; --__last, (void) --__n)
+    std::__pop_heap<_AlgPolicy>(__first, __last, __comp_ref, __n);
+}
+
+template <class _RandomAccessIterator, class _Compare>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
+  static_assert(std::is_copy_constructible<_RandomAccessIterator>::value, "Iterators must be copy constructible.");
+  static_assert(std::is_copy_assignable<_RandomAccessIterator>::value, "Iterators must be copy assignable.");
+
+  std::__sort_heap<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __comp);
+}
+
+template <class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) {
+  std::sort_heap(std::move(__first), std::move(__last),
+      __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_SORT_HEAP_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/stable_partition.h b/app/src/main/cpp/libcxx/include/__algorithm/stable_partition.h
new file mode 100644
index 0000000..a49de6d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/stable_partition.h
@@ -0,0 +1,329 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_STABLE_PARTITION_H
+#define _LIBCPP___ALGORITHM_STABLE_PARTITION_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/rotate.h>
+#include <__config>
+#include <__iterator/advance.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/destruct_n.h>
+#include <__memory/temporary_buffer.h>
+#include <__memory/unique_ptr.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <new>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Predicate, class _ForwardIterator, class _Distance, class _Pair>
+_LIBCPP_HIDE_FROM_ABI _ForwardIterator
+__stable_partition_impl(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred,
+                   _Distance __len, _Pair __p, forward_iterator_tag __fit)
+{
+    using _Ops = _IterOps<_AlgPolicy>;
+
+    // *__first is known to be false
+    // __len >= 1
+    if (__len == 1)
+        return __first;
+    if (__len == 2)
+    {
+        _ForwardIterator __m = __first;
+        if (__pred(*++__m))
+        {
+            _Ops::iter_swap(__first, __m);
+            return __m;
+        }
+        return __first;
+    }
+    if (__len <= __p.second)
+    {   // The buffer is big enough to use
+        typedef typename iterator_traits<_ForwardIterator>::value_type value_type;
+        __destruct_n __d(0);
+        unique_ptr<value_type, __destruct_n&> __h(__p.first, __d);
+        // Move the falses into the temporary buffer, and the trues to the front of the line
+        // Update __first to always point to the end of the trues
+        value_type* __t = __p.first;
+        ::new ((void*)__t) value_type(_Ops::__iter_move(__first));
+        __d.template __incr<value_type>();
+        ++__t;
+        _ForwardIterator __i = __first;
+        while (++__i != __last)
+        {
+            if (__pred(*__i))
+            {
+                *__first = _Ops::__iter_move(__i);
+                ++__first;
+            }
+            else
+            {
+                ::new ((void*)__t) value_type(_Ops::__iter_move(__i));
+                __d.template __incr<value_type>();
+                ++__t;
+            }
+        }
+        // All trues now at start of range, all falses in buffer
+        // Move falses back into range, but don't mess up __first which points to first false
+        __i = __first;
+        for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, (void) ++__i)
+            *__i = _Ops::__iter_move(__t2);
+        // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer
+        return __first;
+    }
+    // Else not enough buffer, do in place
+    // __len >= 3
+    _ForwardIterator __m = __first;
+    _Distance __len2 = __len / 2;  // __len2 >= 2
+    _Ops::advance(__m, __len2);
+    // recurse on [__first, __m), *__first know to be false
+    // F?????????????????
+    // f       m         l
+    _ForwardIterator __first_false = std::__stable_partition_impl<_AlgPolicy, _Predicate&>(
+        __first, __m, __pred, __len2, __p, __fit);
+    // TTTFFFFF??????????
+    // f  ff   m         l
+    // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true
+    _ForwardIterator __m1 = __m;
+    _ForwardIterator __second_false = __last;
+    _Distance __len_half = __len - __len2;
+    while (__pred(*__m1))
+    {
+        if (++__m1 == __last)
+            goto __second_half_done;
+        --__len_half;
+    }
+    // TTTFFFFFTTTF??????
+    // f  ff   m  m1     l
+    __second_false = std::__stable_partition_impl<_AlgPolicy, _Predicate&>(
+        __m1, __last, __pred, __len_half, __p, __fit);
+__second_half_done:
+    // TTTFFFFFTTTTTFFFFF
+    // f  ff   m    sf   l
+    return std::__rotate<_AlgPolicy>(__first_false, __m, __second_false).first;
+    // TTTTTTTTFFFFFFFFFF
+    //         |
+}
+
+template <class _AlgPolicy, class _Predicate, class _ForwardIterator>
+_LIBCPP_HIDE_FROM_ABI _ForwardIterator
+__stable_partition_impl(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred,
+                   forward_iterator_tag)
+{
+    const unsigned __alloc_limit = 3;  // might want to make this a function of trivial assignment
+    // Either prove all true and return __first or point to first false
+    while (true)
+    {
+        if (__first == __last)
+            return __first;
+        if (!__pred(*__first))
+            break;
+        ++__first;
+    }
+    // We now have a reduced range [__first, __last)
+    // *__first is known to be false
+    typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type;
+    typedef typename iterator_traits<_ForwardIterator>::value_type value_type;
+    difference_type __len = _IterOps<_AlgPolicy>::distance(__first, __last);
+    pair<value_type*, ptrdiff_t> __p(0, 0);
+    unique_ptr<value_type, __return_temporary_buffer> __h;
+    if (__len >= __alloc_limit)
+    {
+// TODO: Remove the use of std::get_temporary_buffer
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+        __p = _VSTD::get_temporary_buffer<value_type>(__len);
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+        __h.reset(__p.first);
+    }
+    return std::__stable_partition_impl<_AlgPolicy, _Predicate&>(
+        std::move(__first), std::move(__last), __pred, __len, __p, forward_iterator_tag());
+}
+
+template <class _AlgPolicy, class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair>
+_BidirectionalIterator
+__stable_partition_impl(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred,
+                   _Distance __len, _Pair __p, bidirectional_iterator_tag __bit)
+{
+    using _Ops = _IterOps<_AlgPolicy>;
+
+    // *__first is known to be false
+    // *__last is known to be true
+    // __len >= 2
+    if (__len == 2)
+    {
+        _Ops::iter_swap(__first, __last);
+        return __last;
+    }
+    if (__len == 3)
+    {
+        _BidirectionalIterator __m = __first;
+        if (__pred(*++__m))
+        {
+            _Ops::iter_swap(__first, __m);
+            _Ops::iter_swap(__m, __last);
+            return __last;
+        }
+        _Ops::iter_swap(__m, __last);
+        _Ops::iter_swap(__first, __m);
+        return __m;
+    }
+    if (__len <= __p.second)
+    {   // The buffer is big enough to use
+        typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
+        __destruct_n __d(0);
+        unique_ptr<value_type, __destruct_n&> __h(__p.first, __d);
+        // Move the falses into the temporary buffer, and the trues to the front of the line
+        // Update __first to always point to the end of the trues
+        value_type* __t = __p.first;
+        ::new ((void*)__t) value_type(_Ops::__iter_move(__first));
+        __d.template __incr<value_type>();
+        ++__t;
+        _BidirectionalIterator __i = __first;
+        while (++__i != __last)
+        {
+            if (__pred(*__i))
+            {
+                *__first = _Ops::__iter_move(__i);
+                ++__first;
+            }
+            else
+            {
+                ::new ((void*)__t) value_type(_Ops::__iter_move(__i));
+                __d.template __incr<value_type>();
+                ++__t;
+            }
+        }
+        // move *__last, known to be true
+        *__first = _Ops::__iter_move(__i);
+        __i = ++__first;
+        // All trues now at start of range, all falses in buffer
+        // Move falses back into range, but don't mess up __first which points to first false
+        for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, (void) ++__i)
+            *__i = _Ops::__iter_move(__t2);
+        // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer
+        return __first;
+    }
+    // Else not enough buffer, do in place
+    // __len >= 4
+    _BidirectionalIterator __m = __first;
+    _Distance __len2 = __len / 2;  // __len2 >= 2
+    _Ops::advance(__m, __len2);
+    // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false
+    // F????????????????T
+    // f       m        l
+    _BidirectionalIterator __m1 = __m;
+    _BidirectionalIterator __first_false = __first;
+    _Distance __len_half = __len2;
+    while (!__pred(*--__m1))
+    {
+        if (__m1 == __first)
+            goto __first_half_done;
+        --__len_half;
+    }
+    // F???TFFF?????????T
+    // f   m1  m        l
+    __first_false = std::__stable_partition_impl<_AlgPolicy, _Predicate&>(
+        __first, __m1, __pred, __len_half, __p, __bit);
+__first_half_done:
+    // TTTFFFFF?????????T
+    // f  ff   m        l
+    // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true
+    __m1 = __m;
+    _BidirectionalIterator __second_false = __last;
+    ++__second_false;
+    __len_half = __len - __len2;
+    while (__pred(*__m1))
+    {
+        if (++__m1 == __last)
+            goto __second_half_done;
+        --__len_half;
+    }
+    // TTTFFFFFTTTF?????T
+    // f  ff   m  m1    l
+    __second_false = std::__stable_partition_impl<_AlgPolicy, _Predicate&>(
+        __m1, __last, __pred, __len_half, __p, __bit);
+__second_half_done:
+    // TTTFFFFFTTTTTFFFFF
+    // f  ff   m    sf  l
+    return std::__rotate<_AlgPolicy>(__first_false, __m, __second_false).first;
+    // TTTTTTTTFFFFFFFFFF
+    //         |
+}
+
+template <class _AlgPolicy, class _Predicate, class _BidirectionalIterator>
+_LIBCPP_HIDE_FROM_ABI _BidirectionalIterator
+__stable_partition_impl(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred,
+                   bidirectional_iterator_tag)
+{
+    typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type;
+    typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
+    const difference_type __alloc_limit = 4;  // might want to make this a function of trivial assignment
+    // Either prove all true and return __first or point to first false
+    while (true)
+    {
+        if (__first == __last)
+            return __first;
+        if (!__pred(*__first))
+            break;
+        ++__first;
+    }
+    // __first points to first false, everything prior to __first is already set.
+    // Either prove [__first, __last) is all false and return __first, or point __last to last true
+    do
+    {
+        if (__first == --__last)
+            return __first;
+    } while (!__pred(*__last));
+    // We now have a reduced range [__first, __last]
+    // *__first is known to be false
+    // *__last is known to be true
+    // __len >= 2
+    difference_type __len = _IterOps<_AlgPolicy>::distance(__first, __last) + 1;
+    pair<value_type*, ptrdiff_t> __p(0, 0);
+    unique_ptr<value_type, __return_temporary_buffer> __h;
+    if (__len >= __alloc_limit)
+    {
+// TODO: Remove the use of std::get_temporary_buffer
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+        __p = _VSTD::get_temporary_buffer<value_type>(__len);
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+        __h.reset(__p.first);
+    }
+    return std::__stable_partition_impl<_AlgPolicy, _Predicate&>(
+        std::move(__first), std::move(__last), __pred, __len, __p, bidirectional_iterator_tag());
+}
+
+template <class _AlgPolicy, class _Predicate, class _ForwardIterator, class _IterCategory>
+_LIBCPP_HIDE_FROM_ABI
+_ForwardIterator __stable_partition(
+    _ForwardIterator __first, _ForwardIterator __last, _Predicate&& __pred, _IterCategory __iter_category) {
+  return std::__stable_partition_impl<_AlgPolicy, __remove_cvref_t<_Predicate>&>(
+      std::move(__first), std::move(__last), __pred, __iter_category);
+}
+
+template <class _ForwardIterator, class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY
+_ForwardIterator
+stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
+{
+  using _IterCategory = typename iterator_traits<_ForwardIterator>::iterator_category;
+  return std::__stable_partition<_ClassicAlgPolicy, _Predicate&>(
+      std::move(__first), std::move(__last), __pred, _IterCategory());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_STABLE_PARTITION_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/stable_sort.h b/app/src/main/cpp/libcxx/include/__algorithm/stable_sort.h
new file mode 100644
index 0000000..8e70978
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/stable_sort.h
@@ -0,0 +1,247 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_STABLE_SORT_H
+#define _LIBCPP___ALGORITHM_STABLE_SORT_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/inplace_merge.h>
+#include <__algorithm/iterator_operations.h>
+#include <__algorithm/sort.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__memory/destruct_n.h>
+#include <__memory/temporary_buffer.h>
+#include <__memory/unique_ptr.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <new>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Compare, class _InputIterator1, class _InputIterator2>
+_LIBCPP_HIDE_FROM_ABI void
+__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1,
+        _InputIterator2 __first2, _InputIterator2 __last2,
+        typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp)
+{
+    using _Ops = _IterOps<_AlgPolicy>;
+
+    typedef typename iterator_traits<_InputIterator1>::value_type value_type;
+    __destruct_n __d(0);
+    unique_ptr<value_type, __destruct_n&> __h(__result, __d);
+    for (; true; ++__result)
+    {
+        if (__first1 == __last1)
+        {
+            for (; __first2 != __last2; ++__first2, (void) ++__result, __d.template __incr<value_type>())
+                ::new ((void*)__result) value_type(_Ops::__iter_move(__first2));
+            __h.release();
+            return;
+        }
+        if (__first2 == __last2)
+        {
+            for (; __first1 != __last1; ++__first1, (void) ++__result, __d.template __incr<value_type>())
+                ::new ((void*)__result) value_type(_Ops::__iter_move(__first1));
+            __h.release();
+            return;
+        }
+        if (__comp(*__first2, *__first1))
+        {
+            ::new ((void*)__result) value_type(_Ops::__iter_move(__first2));
+            __d.template __incr<value_type>();
+            ++__first2;
+        }
+        else
+        {
+            ::new ((void*)__result) value_type(_Ops::__iter_move(__first1));
+            __d.template __incr<value_type>();
+            ++__first1;
+        }
+    }
+}
+
+template <class _AlgPolicy, class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator>
+_LIBCPP_HIDE_FROM_ABI void
+__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1,
+        _InputIterator2 __first2, _InputIterator2 __last2,
+        _OutputIterator __result, _Compare __comp)
+{
+    using _Ops = _IterOps<_AlgPolicy>;
+
+    for (; __first1 != __last1; ++__result)
+    {
+        if (__first2 == __last2)
+        {
+            for (; __first1 != __last1; ++__first1, (void) ++__result)
+                *__result = _Ops::__iter_move(__first1);
+            return;
+        }
+        if (__comp(*__first2, *__first1))
+        {
+            *__result = _Ops::__iter_move(__first2);
+            ++__first2;
+        }
+        else
+        {
+            *__result = _Ops::__iter_move(__first1);
+            ++__first1;
+        }
+    }
+    for (; __first2 != __last2; ++__first2, (void) ++__result)
+        *__result = _Ops::__iter_move(__first2);
+}
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+void
+__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
+              typename iterator_traits<_RandomAccessIterator>::difference_type __len,
+              typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size);
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+void
+__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp,
+                   typename iterator_traits<_RandomAccessIterator>::difference_type __len,
+                   typename iterator_traits<_RandomAccessIterator>::value_type* __first2)
+{
+    using _Ops = _IterOps<_AlgPolicy>;
+
+    typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
+    switch (__len)
+    {
+    case 0:
+        return;
+    case 1:
+        ::new ((void*)__first2) value_type(_Ops::__iter_move(__first1));
+        return;
+    case 2:
+        __destruct_n __d(0);
+        unique_ptr<value_type, __destruct_n&> __h2(__first2, __d);
+        if (__comp(*--__last1, *__first1))
+        {
+            ::new ((void*)__first2) value_type(_Ops::__iter_move(__last1));
+            __d.template __incr<value_type>();
+            ++__first2;
+            ::new ((void*)__first2) value_type(_Ops::__iter_move(__first1));
+        }
+        else
+        {
+            ::new ((void*)__first2) value_type(_Ops::__iter_move(__first1));
+            __d.template __incr<value_type>();
+            ++__first2;
+            ::new ((void*)__first2) value_type(_Ops::__iter_move(__last1));
+        }
+        __h2.release();
+        return;
+    }
+    if (__len <= 8)
+    {
+        std::__insertion_sort_move<_AlgPolicy, _Compare>(__first1, __last1, __first2, __comp);
+        return;
+    }
+    typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2;
+    _RandomAccessIterator __m = __first1 + __l2;
+    std::__stable_sort<_AlgPolicy, _Compare>(__first1, __m, __comp, __l2, __first2, __l2);
+    std::__stable_sort<_AlgPolicy, _Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2);
+    std::__merge_move_construct<_AlgPolicy, _Compare>(__first1, __m, __m, __last1, __first2, __comp);
+}
+
+template <class _Tp>
+struct __stable_sort_switch
+{
+    static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value;
+};
+
+template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
+void
+__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
+              typename iterator_traits<_RandomAccessIterator>::difference_type __len,
+              typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size)
+{
+    typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
+    typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
+    switch (__len)
+    {
+    case 0:
+    case 1:
+        return;
+    case 2:
+        if (__comp(*--__last, *__first))
+            _IterOps<_AlgPolicy>::iter_swap(__first, __last);
+        return;
+    }
+    if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value))
+    {
+        std::__insertion_sort<_AlgPolicy, _Compare>(__first, __last, __comp);
+        return;
+    }
+    typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2;
+    _RandomAccessIterator __m = __first + __l2;
+    if (__len <= __buff_size)
+    {
+        __destruct_n __d(0);
+        unique_ptr<value_type, __destruct_n&> __h2(__buff, __d);
+        std::__stable_sort_move<_AlgPolicy, _Compare>(__first, __m, __comp, __l2, __buff);
+        __d.__set(__l2, (value_type*)nullptr);
+        std::__stable_sort_move<_AlgPolicy, _Compare>(__m, __last, __comp, __len - __l2, __buff + __l2);
+        __d.__set(__len, (value_type*)nullptr);
+        std::__merge_move_assign<_AlgPolicy, _Compare>(
+            __buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp);
+//         _VSTD::__merge<_Compare>(move_iterator<value_type*>(__buff),
+//                                  move_iterator<value_type*>(__buff + __l2),
+//                                  move_iterator<_RandomAccessIterator>(__buff + __l2),
+//                                  move_iterator<_RandomAccessIterator>(__buff + __len),
+//                                  __first, __comp);
+        return;
+    }
+    std::__stable_sort<_AlgPolicy, _Compare>(__first, __m, __comp, __l2, __buff, __buff_size);
+    std::__stable_sort<_AlgPolicy, _Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size);
+    std::__inplace_merge<_AlgPolicy>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size);
+}
+
+template <class _AlgPolicy, class _RandomAccessIterator, class _Compare>
+inline _LIBCPP_HIDE_FROM_ABI
+void __stable_sort_impl(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) {
+  using value_type = typename iterator_traits<_RandomAccessIterator>::value_type;
+  using difference_type = typename iterator_traits<_RandomAccessIterator>::difference_type;
+
+  difference_type __len = __last - __first;
+  pair<value_type*, ptrdiff_t> __buf(0, 0);
+  unique_ptr<value_type, __return_temporary_buffer> __h;
+  if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) {
+// TODO: Remove the use of std::get_temporary_buffer
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+      __buf = std::get_temporary_buffer<value_type>(__len);
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+      __h.reset(__buf.first);
+  }
+
+  std::__stable_sort<_AlgPolicy, __comp_ref_type<_Compare> >(__first, __last, __comp, __len, __buf.first, __buf.second);
+}
+
+template <class _RandomAccessIterator, class _Compare>
+inline _LIBCPP_HIDE_FROM_ABI
+void stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
+  std::__stable_sort_impl<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __comp);
+}
+
+template <class _RandomAccessIterator>
+inline _LIBCPP_HIDE_FROM_ABI
+void stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) {
+  std::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_STABLE_SORT_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/swap_ranges.h b/app/src/main/cpp/libcxx/include/__algorithm/swap_ranges.h
new file mode 100644
index 0000000..5ce5ed8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/swap_ranges.h
@@ -0,0 +1,60 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_SWAP_RANGES_H
+#define _LIBCPP___ALGORITHM_SWAP_RANGES_H
+
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// 2+2 iterators: the shorter size will be used.
+template <class _AlgPolicy, class _ForwardIterator1, class _Sentinel1, class _ForwardIterator2, class _Sentinel2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+pair<_ForwardIterator1, _ForwardIterator2>
+__swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _Sentinel2 __last2) {
+  while (__first1 != __last1 && __first2 != __last2) {
+    _IterOps<_AlgPolicy>::iter_swap(__first1, __first2);
+    ++__first1;
+    ++__first2;
+  }
+
+  return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), std::move(__first2));
+}
+
+// 2+1 iterators: size2 >= size1.
+template <class _AlgPolicy, class _ForwardIterator1, class _Sentinel1, class _ForwardIterator2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+pair<_ForwardIterator1, _ForwardIterator2>
+__swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2) {
+  while (__first1 != __last1) {
+    _IterOps<_AlgPolicy>::iter_swap(__first1, __first2);
+    ++__first1;
+    ++__first2;
+  }
+
+  return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), std::move(__first2));
+}
+
+template <class _ForwardIterator1, class _ForwardIterator2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator2
+swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) {
+  return std::__swap_ranges<_ClassicAlgPolicy>(
+      std::move(__first1), std::move(__last1), std::move(__first2)).second;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_SWAP_RANGES_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/transform.h b/app/src/main/cpp/libcxx/include/__algorithm/transform.h
new file mode 100644
index 0000000..4722c15
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/transform.h
@@ -0,0 +1,43 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_TRANSFORM_H
+#define _LIBCPP___ALGORITHM_TRANSFORM_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _OutputIterator, class _UnaryOperation>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+transform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op)
+{
+    for (; __first != __last; ++__first, (void) ++__result)
+        *__result = __op(*__first);
+    return __result;
+}
+
+template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+transform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2,
+          _OutputIterator __result, _BinaryOperation __binary_op)
+{
+    for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result)
+        *__result = __binary_op(*__first1, *__first2);
+    return __result;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_TRANSFORM_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/uniform_random_bit_generator_adaptor.h b/app/src/main/cpp/libcxx/include/__algorithm/uniform_random_bit_generator_adaptor.h
new file mode 100644
index 0000000..1e86074
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/uniform_random_bit_generator_adaptor.h
@@ -0,0 +1,62 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_RANGES_UNIFORM_RANDOM_BIT_GENERATOR_ADAPTOR_H
+#define _LIBCPP___ALGORITHM_RANGES_UNIFORM_RANDOM_BIT_GENERATOR_ADAPTOR_H
+
+#include <__config>
+#include <__functional/invoke.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Range versions of random algorithms (e.g. `std::shuffle`) are less constrained than their classic counterparts.
+// Range algorithms only require the given generator to satisfy the `std::uniform_random_bit_generator` concept.
+// Classic algorithms require the given generator to meet the uniform random bit generator requirements; these
+// requirements include satisfying `std::uniform_random_bit_generator` and add a requirement for the generator to
+// provide a nested `result_type` typedef (see `[rand.req.urng]`).
+//
+// To be able to reuse classic implementations, make the given generator meet the classic requirements by wrapping
+// it into an adaptor type that forwards all of its interface and adds the required typedef.
+template <class _Gen>
+class _ClassicGenAdaptor {
+private:
+  // The generator is not required to be copyable or movable, so it has to be stored as a reference.
+  _Gen& __gen_;
+
+public:
+  using result_type = invoke_result_t<_Gen&>;
+
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto min() { return __remove_cvref_t<_Gen>::min(); }
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto max() { return __remove_cvref_t<_Gen>::max(); }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr explicit _ClassicGenAdaptor(_Gen& __g) : __gen_(__g) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()() const { return __gen_(); }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___ALGORITHM_RANGES_UNIFORM_RANDOM_BIT_GENERATOR_ADAPTOR_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/unique.h b/app/src/main/cpp/libcxx/include/__algorithm/unique.h
new file mode 100644
index 0000000..1717a00
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/unique.h
@@ -0,0 +1,59 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_UNIQUE_H
+#define _LIBCPP___ALGORITHM_UNIQUE_H
+
+#include <__algorithm/adjacent_find.h>
+#include <__algorithm/comp.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// unique
+
+template <class _AlgPolicy, class _Iter, class _Sent, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 std::pair<_Iter, _Iter>
+__unique(_Iter __first, _Sent __last, _BinaryPredicate&& __pred) {
+  __first = std::__adjacent_find(__first, __last, __pred);
+  if (__first != __last) {
+    // ...  a  a  ?  ...
+    //      f     i
+    _Iter __i = __first;
+    for (++__i; ++__i != __last;)
+      if (!__pred(*__first, *__i))
+        *++__first = _IterOps<_AlgPolicy>::__iter_move(__i);
+    ++__first;
+    return std::pair<_Iter, _Iter>(std::move(__first), std::move(__i));
+  }
+  return std::pair<_Iter, _Iter>(__first, __first);
+}
+
+template <class _ForwardIterator, class _BinaryPredicate>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+unique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) {
+  return std::__unique<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __pred).first;
+}
+
+template <class _ForwardIterator>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+unique(_ForwardIterator __first, _ForwardIterator __last) {
+  return std::unique(__first, __last, __equal_to());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_UNIQUE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/unique_copy.h b/app/src/main/cpp/libcxx/include/__algorithm/unique_copy.h
new file mode 100644
index 0000000..81fcd50
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/unique_copy.h
@@ -0,0 +1,122 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_UNIQUE_COPY_H
+#define _LIBCPP___ALGORITHM_UNIQUE_COPY_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/is_base_of.h>
+#include <__type_traits/is_same.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace __unique_copy_tags {
+
+struct __reread_from_input_tag {};
+struct __reread_from_output_tag {};
+struct __read_from_tmp_value_tag {};
+
+} // namespace __unique_copy_tags
+
+template <class _AlgPolicy, class _BinaryPredicate, class _InputIterator, class _Sent, class _OutputIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI pair<_InputIterator, _OutputIterator>
+__unique_copy(_InputIterator __first,
+              _Sent __last,
+              _OutputIterator __result,
+              _BinaryPredicate&& __pred,
+              __unique_copy_tags::__read_from_tmp_value_tag) {
+  if (__first != __last) {
+    typename _IterOps<_AlgPolicy>::template __value_type<_InputIterator> __t(*__first);
+    *__result = __t;
+    ++__result;
+    while (++__first != __last) {
+      if (!__pred(__t, *__first)) {
+        __t       = *__first;
+        *__result = __t;
+        ++__result;
+      }
+    }
+  }
+  return pair<_InputIterator, _OutputIterator>(std::move(__first), std::move(__result));
+}
+
+template <class _AlgPolicy, class _BinaryPredicate, class _ForwardIterator, class _Sent, class _OutputIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI pair<_ForwardIterator, _OutputIterator>
+__unique_copy(_ForwardIterator __first,
+              _Sent __last,
+              _OutputIterator __result,
+              _BinaryPredicate&& __pred,
+              __unique_copy_tags::__reread_from_input_tag) {
+  if (__first != __last) {
+    _ForwardIterator __i = __first;
+    *__result            = *__i;
+    ++__result;
+    while (++__first != __last) {
+      if (!__pred(*__i, *__first)) {
+        *__result = *__first;
+        ++__result;
+        __i = __first;
+      }
+    }
+  }
+  return pair<_ForwardIterator, _OutputIterator>(std::move(__first), std::move(__result));
+}
+
+template <class _AlgPolicy, class _BinaryPredicate, class _InputIterator, class _Sent, class _InputAndOutputIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI pair<_InputIterator, _InputAndOutputIterator>
+__unique_copy(_InputIterator __first,
+              _Sent __last,
+              _InputAndOutputIterator __result,
+              _BinaryPredicate&& __pred,
+              __unique_copy_tags::__reread_from_output_tag) {
+  if (__first != __last) {
+    *__result = *__first;
+    while (++__first != __last)
+      if (!__pred(*__result, *__first))
+        *++__result = *__first;
+    ++__result;
+  }
+  return pair<_InputIterator, _InputAndOutputIterator>(std::move(__first), std::move(__result));
+}
+
+template <class _InputIterator, class _OutputIterator, class _BinaryPredicate>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator
+unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) {
+  using __algo_tag = __conditional_t<
+      is_base_of<forward_iterator_tag, typename iterator_traits<_InputIterator>::iterator_category>::value,
+      __unique_copy_tags::__reread_from_input_tag,
+      __conditional_t<
+          is_base_of<forward_iterator_tag, typename iterator_traits<_OutputIterator>::iterator_category>::value &&
+              is_same< typename iterator_traits<_InputIterator>::value_type,
+                       typename iterator_traits<_OutputIterator>::value_type>::value,
+          __unique_copy_tags::__reread_from_output_tag,
+          __unique_copy_tags::__read_from_tmp_value_tag> >;
+  return std::__unique_copy<_ClassicAlgPolicy>(
+             std::move(__first), std::move(__last), std::move(__result), __pred, __algo_tag())
+      .second;
+}
+
+template <class _InputIterator, class _OutputIterator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator
+unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) {
+  return std::unique_copy(std::move(__first), std::move(__last), std::move(__result), __equal_to());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_UNIQUE_COPY_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/unwrap_iter.h b/app/src/main/cpp/libcxx/include/__algorithm/unwrap_iter.h
new file mode 100644
index 0000000..0f661e1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/unwrap_iter.h
@@ -0,0 +1,74 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_UNWRAP_ITER_H
+#define _LIBCPP___ALGORITHM_UNWRAP_ITER_H
+
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__memory/pointer_traits.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__utility/declval.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// TODO: Change the name of __unwrap_iter_impl to something more appropriate
+// The job of __unwrap_iter is to remove iterator wrappers (like reverse_iterator or __wrap_iter),
+// to reduce the number of template instantiations and to enable pointer-based optimizations e.g. in std::copy.
+// In debug mode, we don't do this.
+//
+// Some algorithms (e.g. std::copy, but not std::sort) need to convert an
+// "unwrapped" result back into the original iterator type. Doing that is the job of __rewrap_iter.
+
+// Default case - we can't unwrap anything
+template <class _Iter, bool = __is_cpp17_contiguous_iterator<_Iter>::value>
+struct __unwrap_iter_impl {
+  static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __rewrap(_Iter, _Iter __iter) { return __iter; }
+  static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __unwrap(_Iter __i) _NOEXCEPT { return __i; }
+};
+
+#ifndef _LIBCPP_ENABLE_DEBUG_MODE
+
+// It's a contiguous iterator, so we can use a raw pointer instead
+template <class _Iter>
+struct __unwrap_iter_impl<_Iter, true> {
+  using _ToAddressT = decltype(std::__to_address(std::declval<_Iter>()));
+
+  static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __rewrap(_Iter __orig_iter, _ToAddressT __unwrapped_iter) {
+    return __orig_iter + (__unwrapped_iter - std::__to_address(__orig_iter));
+  }
+
+  static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _ToAddressT __unwrap(_Iter __i) _NOEXCEPT {
+    return std::__to_address(__i);
+  }
+};
+
+#endif // !_LIBCPP_ENABLE_DEBUG_MODE
+
+template<class _Iter,
+         class _Impl = __unwrap_iter_impl<_Iter>,
+         __enable_if_t<is_copy_constructible<_Iter>::value, int> = 0>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+decltype(_Impl::__unwrap(std::declval<_Iter>())) __unwrap_iter(_Iter __i) _NOEXCEPT {
+  return _Impl::__unwrap(__i);
+}
+
+template <class _OrigIter, class _Iter, class _Impl = __unwrap_iter_impl<_OrigIter> >
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _OrigIter __rewrap_iter(_OrigIter __orig_iter, _Iter __iter) _NOEXCEPT {
+  return _Impl::__rewrap(std::move(__orig_iter), std::move(__iter));
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_UNWRAP_ITER_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/unwrap_range.h b/app/src/main/cpp/libcxx/include/__algorithm/unwrap_range.h
new file mode 100644
index 0000000..2c5d23e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/unwrap_range.h
@@ -0,0 +1,97 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_UNWRAP_RANGE_H
+#define _LIBCPP___ALGORITHM_UNWRAP_RANGE_H
+
+#include <__algorithm/unwrap_iter.h>
+#include <__concepts/constructible.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/next.h>
+#include <__utility/declval.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// __unwrap_range and __rewrap_range are used to unwrap ranges which may have different iterator and sentinel types.
+// __unwrap_iter and __rewrap_iter don't work for this, because they assume that the iterator and sentinel have
+// the same type. __unwrap_range tries to get two iterators and then forward to __unwrap_iter.
+
+#if _LIBCPP_STD_VER > 17
+template <class _Iter, class _Sent>
+struct __unwrap_range_impl {
+  _LIBCPP_HIDE_FROM_ABI static constexpr auto __unwrap(_Iter __first, _Sent __sent)
+    requires random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter>
+  {
+    auto __last = ranges::next(__first, __sent);
+    return pair{std::__unwrap_iter(std::move(__first)), std::__unwrap_iter(std::move(__last))};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI static constexpr auto __unwrap(_Iter __first, _Sent __last) {
+    return pair{std::move(__first), std::move(__last)};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI static constexpr auto
+  __rewrap(_Iter __orig_iter, decltype(std::__unwrap_iter(__orig_iter)) __iter)
+    requires random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter>
+  {
+    return std::__rewrap_iter(std::move(__orig_iter), std::move(__iter));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI static constexpr auto __rewrap(const _Iter&, _Iter __iter)
+    requires (!(random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter>))
+  {
+    return __iter;
+  }
+};
+
+template <class _Iter>
+struct __unwrap_range_impl<_Iter, _Iter> {
+  _LIBCPP_HIDE_FROM_ABI static constexpr auto __unwrap(_Iter __first, _Iter __last) {
+    return pair{std::__unwrap_iter(std::move(__first)), std::__unwrap_iter(std::move(__last))};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI static constexpr auto
+  __rewrap(_Iter __orig_iter, decltype(std::__unwrap_iter(__orig_iter)) __iter) {
+    return std::__rewrap_iter(std::move(__orig_iter), std::move(__iter));
+  }
+};
+
+template <class _Iter, class _Sent>
+_LIBCPP_HIDE_FROM_ABI constexpr auto __unwrap_range(_Iter __first, _Sent __last) {
+  return __unwrap_range_impl<_Iter, _Sent>::__unwrap(std::move(__first), std::move(__last));
+}
+
+template <
+    class _Sent,
+    class _Iter,
+    class _Unwrapped = decltype(std::__unwrap_range(std::declval<_Iter>(), std::declval<_Sent>()))>
+_LIBCPP_HIDE_FROM_ABI constexpr _Iter __rewrap_range(_Iter __orig_iter, _Unwrapped __iter) {
+  return __unwrap_range_impl<_Iter, _Sent>::__rewrap(std::move(__orig_iter), std::move(__iter));
+}
+#else  // _LIBCPP_STD_VER > 17
+template <class _Iter, class _Unwrapped = decltype(std::__unwrap_iter(std::declval<_Iter>()))>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR pair<_Unwrapped, _Unwrapped> __unwrap_range(_Iter __first, _Iter __last) {
+  return std::make_pair(std::__unwrap_iter(std::move(__first)), std::__unwrap_iter(std::move(__last)));
+}
+
+template <class _Iter, class _Unwrapped = decltype(std::__unwrap_iter(std::declval<_Iter>()))>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __rewrap_range(_Iter __orig_iter, _Unwrapped __iter) {
+  return std::__rewrap_iter(std::move(__orig_iter), std::move(__iter));
+}
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_UNWRAP_RANGE_H
diff --git a/app/src/main/cpp/libcxx/include/__algorithm/upper_bound.h b/app/src/main/cpp/libcxx/include/__algorithm/upper_bound.h
new file mode 100644
index 0000000..96552ce
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__algorithm/upper_bound.h
@@ -0,0 +1,68 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ALGORITHM_UPPER_BOUND_H
+#define _LIBCPP___ALGORITHM_UPPER_BOUND_H
+
+#include <__algorithm/comp.h>
+#include <__algorithm/half_positive.h>
+#include <__algorithm/iterator_operations.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__iterator/advance.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Compare, class _Iter, class _Sent, class _Tp, class _Proj>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Iter
+__upper_bound(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) {
+  auto __len = _IterOps<_AlgPolicy>::distance(__first, __last);
+  while (__len != 0) {
+    auto __half_len = std::__half_positive(__len);
+    auto __mid      = _IterOps<_AlgPolicy>::next(__first, __half_len);
+    if (std::__invoke(__comp, __value, std::__invoke(__proj, *__mid)))
+      __len = __half_len;
+    else {
+      __first = ++__mid;
+      __len -= __half_len + 1;
+    }
+  }
+  return __first;
+}
+
+template <class _ForwardIterator, class _Tp, class _Compare>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) {
+  static_assert(is_copy_constructible<_ForwardIterator>::value,
+                "Iterator has to be copy constructible");
+  return std::__upper_bound<_ClassicAlgPolicy>(
+      std::move(__first), std::move(__last), __value, std::move(__comp), std::__identity());
+}
+
+template <class _ForwardIterator, class _Tp>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
+upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) {
+  return std::upper_bound(
+      std::move(__first),
+      std::move(__last),
+      __value,
+      __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ALGORITHM_UPPER_BOUND_H
diff --git a/app/src/main/cpp/libcxx/include/__assert b/app/src/main/cpp/libcxx/include/__assert
new file mode 100644
index 0000000..9c0cd1b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__assert
@@ -0,0 +1,55 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ASSERT
+#define _LIBCPP___ASSERT
+
+#include <__config>
+#include <__verbose_abort>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+// TODO: Remove in LLVM 17.
+#if defined(_LIBCPP_DEBUG)
+#   error "Defining _LIBCPP_DEBUG is not supported anymore. Please use _LIBCPP_ENABLE_DEBUG_MODE instead."
+#endif
+
+// Automatically enable assertions when the debug mode is enabled.
+#if defined(_LIBCPP_ENABLE_DEBUG_MODE)
+# ifndef _LIBCPP_ENABLE_ASSERTIONS
+#   define _LIBCPP_ENABLE_ASSERTIONS 1
+# endif
+#endif
+
+#ifndef _LIBCPP_ENABLE_ASSERTIONS
+# define _LIBCPP_ENABLE_ASSERTIONS _LIBCPP_ENABLE_ASSERTIONS_DEFAULT
+#endif
+
+#if _LIBCPP_ENABLE_ASSERTIONS != 0 && _LIBCPP_ENABLE_ASSERTIONS != 1
+# error "_LIBCPP_ENABLE_ASSERTIONS must be set to 0 or 1"
+#endif
+
+#if _LIBCPP_ENABLE_ASSERTIONS
+# define _LIBCPP_ASSERT(expression, message)                                        \
+    (__builtin_expect(static_cast<bool>(expression), 1) ?                           \
+      (void)0 :                                                                     \
+      _LIBCPP_VERBOSE_ABORT("%s:%d: assertion %s failed: %s", __FILE__, __LINE__, #expression, message))
+#elif !defined(_LIBCPP_ASSERTIONS_DISABLE_ASSUME) && __has_builtin(__builtin_assume)
+# define _LIBCPP_ASSERT(expression, message)                                        \
+    (_LIBCPP_DIAGNOSTIC_PUSH                                                        \
+    _LIBCPP_CLANG_DIAGNOSTIC_IGNORED("-Wassume")                                    \
+    __builtin_assume(static_cast<bool>(expression))                                 \
+    _LIBCPP_DIAGNOSTIC_POP)
+#else
+# define _LIBCPP_ASSERT(expression, message) ((void)0)
+#endif
+
+#endif // _LIBCPP___ASSERT
diff --git a/app/src/main/cpp/libcxx/include/__availability b/app/src/main/cpp/libcxx/include/__availability
new file mode 100644
index 0000000..6dfca3f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__availability
@@ -0,0 +1,288 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___AVAILABILITY
+#define _LIBCPP___AVAILABILITY
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+// Libc++ is shipped by various vendors. In particular, it is used as a system
+// library on macOS, iOS and other Apple platforms. In order for users to be
+// able to compile a binary that is intended to be deployed to an older version
+// of a platform, Clang provides availability attributes [1]. These attributes
+// can be placed on declarations and are used to describe the life cycle of a
+// symbol in the library.
+//
+// The main goal is to ensure a compile-time error if a symbol that hasn't been
+// introduced in a previously released library is used in a program that targets
+// that previously released library. Normally, this would be a load-time error
+// when one tries to launch the program against the older library.
+//
+// For example, the filesystem library was introduced in the dylib in macOS 10.15.
+// If a user compiles on a macOS 10.15 host but targets macOS 10.13 with their
+// program, the compiler would normally not complain (because the required
+// declarations are in the headers), but the dynamic loader would fail to find
+// the symbols when actually trying to launch the program on macOS 10.13. To
+// turn this into a compile-time issue instead, declarations are annotated with
+// when they were introduced, and the compiler can produce a diagnostic if the
+// program references something that isn't available on the deployment target.
+//
+// This mechanism is general in nature, and any vendor can add their markup to
+// the library (see below). Whenever a new feature is added that requires support
+// in the shared library, a macro should be added below to mark this feature
+// as unavailable. When vendors decide to ship the feature as part of their
+// shared library, they can update the markup appropriately.
+//
+// Furthermore, many features in the standard library have corresponding
+// feature-test macros. When a feature is made unavailable on some deployment
+// target, a macro should be defined to signal that it is unavailable. That
+// macro can then be picked up when feature-test macros are generated (see
+// generate_feature_test_macro_components.py) to make sure that feature-test
+// macros don't announce a feature as being implemented if it has been marked
+// as unavailable.
+//
+// Note that this mechanism is disabled by default in the "upstream" libc++.
+// Availability annotations are only meaningful when shipping libc++ inside
+// a platform (i.e. as a system library), and so vendors that want them should
+// turn those annotations on at CMake configuration time.
+//
+// [1]: https://clang.llvm.org/docs/AttributeReference.html#availability
+
+
+// For backwards compatibility, allow users to define _LIBCPP_DISABLE_AVAILABILITY
+// for a while.
+#if defined(_LIBCPP_DISABLE_AVAILABILITY)
+#   if !defined(_LIBCPP_HAS_NO_VENDOR_AVAILABILITY_ANNOTATIONS)
+#       define _LIBCPP_HAS_NO_VENDOR_AVAILABILITY_ANNOTATIONS
+#   endif
+#endif
+
+// Availability markup is disabled when building the library, or when the compiler
+// doesn't support the proper attributes.
+#if defined(_LIBCPP_BUILDING_LIBRARY) ||                                        \
+    defined(_LIBCXXABI_BUILDING_LIBRARY) ||                                     \
+    !__has_feature(attribute_availability_with_strict) ||                       \
+    !__has_feature(attribute_availability_in_templates) ||                      \
+    !__has_extension(pragma_clang_attribute_external_declaration)
+#   if !defined(_LIBCPP_HAS_NO_VENDOR_AVAILABILITY_ANNOTATIONS)
+#       define _LIBCPP_HAS_NO_VENDOR_AVAILABILITY_ANNOTATIONS
+#   endif
+#endif
+
+#if defined(_LIBCPP_HAS_NO_VENDOR_AVAILABILITY_ANNOTATIONS)
+
+    // This controls the availability of std::shared_mutex and std::shared_timed_mutex,
+    // which were added to the dylib later.
+#   define _LIBCPP_AVAILABILITY_SHARED_MUTEX
+// #   define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_shared_mutex
+// #   define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_shared_timed_mutex
+
+    // These macros control the availability of std::bad_optional_access and
+    // other exception types. These were put in the shared library to prevent
+    // code bloat from every user program defining the vtable for these exception
+    // types.
+    //
+    // Note that when exceptions are disabled, the methods that normally throw
+    // these exceptions can be used even on older deployment targets, but those
+    // methods will abort instead of throwing.
+#   define _LIBCPP_AVAILABILITY_BAD_OPTIONAL_ACCESS
+#   define _LIBCPP_AVAILABILITY_BAD_VARIANT_ACCESS
+#   define _LIBCPP_AVAILABILITY_BAD_ANY_CAST
+
+    // This controls the availability of std::uncaught_exceptions().
+#   define _LIBCPP_AVAILABILITY_UNCAUGHT_EXCEPTIONS
+
+    // This controls the availability of the sized version of ::operator delete,
+    // ::operator delete[], and their align_val_t variants, which were all added
+    // in C++17, and hence not present in early dylibs.
+#   define _LIBCPP_AVAILABILITY_SIZED_NEW_DELETE
+
+    // This controls the availability of the std::future_error exception.
+    //
+    // Note that when exceptions are disabled, the methods that normally throw
+    // std::future_error can be used even on older deployment targets, but those
+    // methods will abort instead of throwing.
+#   define _LIBCPP_AVAILABILITY_FUTURE_ERROR
+
+    // This controls the availability of std::type_info's vtable.
+    // I can't imagine how using std::type_info can work at all if
+    // this isn't supported.
+#   define _LIBCPP_AVAILABILITY_TYPEINFO_VTABLE
+
+    // This controls the availability of std::locale::category members
+    // (e.g. std::locale::collate), which are defined in the dylib.
+#   define _LIBCPP_AVAILABILITY_LOCALE_CATEGORY
+
+    // This controls the availability of atomic operations on std::shared_ptr
+    // (e.g. `std::atomic_store(std::shared_ptr)`), which require a shared
+    // lock table located in the dylib.
+#   define _LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR
+
+    // These macros control the availability of all parts of <filesystem> that
+    // depend on something in the dylib.
+#   define _LIBCPP_AVAILABILITY_FILESYSTEM
+#   define _LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+#   define _LIBCPP_AVAILABILITY_FILESYSTEM_POP
+// #   define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_filesystem
+
+    // This controls the availability of floating-point std::to_chars functions.
+    // These overloads were added later than the integer overloads.
+#   define _LIBCPP_AVAILABILITY_TO_CHARS_FLOATING_POINT
+
+    // This controls the availability of the C++20 synchronization library,
+    // which requires shared library support for various operations
+    // (see libcxx/src/atomic.cpp). This includes <barier>, <latch>,
+    // <semaphore>, and notification functions on std::atomic.
+#   define _LIBCPP_AVAILABILITY_SYNC
+// #   define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_atomic_wait
+// #   define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_barrier
+// #   define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_latch
+// #   define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_semaphore
+
+    // This controls the availability of the C++20 format library.
+    // The library is in development and not ABI stable yet. P2216 is
+    // retroactively accepted in C++20. This paper contains ABI breaking
+    // changes.
+#   define _LIBCPP_AVAILABILITY_FORMAT
+// #   define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_format
+
+    // This controls whether the library claims to provide a default verbose
+    // termination function, and consequently whether the headers will try
+    // to use it when the mechanism isn't overriden at compile-time.
+// #   define _LIBCPP_HAS_NO_VERBOSE_ABORT_IN_LIBRARY
+
+#elif defined(__APPLE__)
+
+#   define _LIBCPP_AVAILABILITY_SHARED_MUTEX                                    \
+        __attribute__((availability(macos,strict,introduced=10.12)))            \
+        __attribute__((availability(ios,strict,introduced=10.0)))               \
+        __attribute__((availability(tvos,strict,introduced=10.0)))              \
+        __attribute__((availability(watchos,strict,introduced=3.0)))
+#   if (defined(__ENVIRONMENT_MAC_OS_X_VERSION_MIN_REQUIRED__) && __ENVIRONMENT_MAC_OS_X_VERSION_MIN_REQUIRED__ < 101200) ||    \
+        (defined(__ENVIRONMENT_IPHONE_OS_VERSION_MIN_REQUIRED__) && __ENVIRONMENT_IPHONE_OS_VERSION_MIN_REQUIRED__ < 100000) || \
+        (defined(__ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__) && __ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__ < 100000) ||         \
+        (defined(__ENVIRONMENT_WATCH_OS_VERSION_MIN_REQUIRED__) && __ENVIRONMENT_WATCH_OS_VERSION_MIN_REQUIRED__ < 30000)
+#       define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_shared_mutex
+#       define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_shared_timed_mutex
+#   endif
+
+        // Note: bad_optional_access & friends were not introduced in the matching
+        // macOS and iOS versions, so the version mismatch between macOS and others
+        // is intended.
+#   define _LIBCPP_AVAILABILITY_BAD_OPTIONAL_ACCESS                             \
+        __attribute__((availability(macos,strict,introduced=10.13)))            \
+        __attribute__((availability(ios,strict,introduced=12.0)))               \
+        __attribute__((availability(tvos,strict,introduced=12.0)))              \
+        __attribute__((availability(watchos,strict,introduced=5.0)))
+#   define _LIBCPP_AVAILABILITY_BAD_VARIANT_ACCESS                              \
+        _LIBCPP_AVAILABILITY_BAD_OPTIONAL_ACCESS
+#   define _LIBCPP_AVAILABILITY_BAD_ANY_CAST                                    \
+        _LIBCPP_AVAILABILITY_BAD_OPTIONAL_ACCESS
+
+#   define _LIBCPP_AVAILABILITY_UNCAUGHT_EXCEPTIONS                             \
+        __attribute__((availability(macos,strict,introduced=10.12)))            \
+        __attribute__((availability(ios,strict,introduced=10.0)))               \
+        __attribute__((availability(tvos,strict,introduced=10.0)))              \
+        __attribute__((availability(watchos,strict,introduced=3.0)))
+
+#   define _LIBCPP_AVAILABILITY_SIZED_NEW_DELETE                                \
+        __attribute__((availability(macos,strict,introduced=10.12)))            \
+        __attribute__((availability(ios,strict,introduced=10.0)))               \
+        __attribute__((availability(tvos,strict,introduced=10.0)))              \
+        __attribute__((availability(watchos,strict,introduced=3.0)))
+
+#   define _LIBCPP_AVAILABILITY_FUTURE_ERROR                                    \
+        __attribute__((availability(ios,strict,introduced=6.0)))
+
+#   define _LIBCPP_AVAILABILITY_TYPEINFO_VTABLE                                 \
+        __attribute__((availability(macos,strict,introduced=10.9)))             \
+        __attribute__((availability(ios,strict,introduced=7.0)))
+
+#   define _LIBCPP_AVAILABILITY_LOCALE_CATEGORY                                 \
+        __attribute__((availability(macos,strict,introduced=10.9)))             \
+        __attribute__((availability(ios,strict,introduced=7.0)))
+
+#   define _LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR                               \
+        __attribute__((availability(macos,strict,introduced=10.9)))             \
+        __attribute__((availability(ios,strict,introduced=7.0)))
+
+#   define _LIBCPP_AVAILABILITY_FILESYSTEM                                      \
+        __attribute__((availability(macos,strict,introduced=10.15)))            \
+        __attribute__((availability(ios,strict,introduced=13.0)))               \
+        __attribute__((availability(tvos,strict,introduced=13.0)))              \
+        __attribute__((availability(watchos,strict,introduced=6.0)))
+#   define _LIBCPP_AVAILABILITY_FILESYSTEM_PUSH                                 \
+        _Pragma("clang attribute push(__attribute__((availability(macos,strict,introduced=10.15))), apply_to=any(function,record))") \
+        _Pragma("clang attribute push(__attribute__((availability(ios,strict,introduced=13.0))), apply_to=any(function,record))")    \
+        _Pragma("clang attribute push(__attribute__((availability(tvos,strict,introduced=13.0))), apply_to=any(function,record))")   \
+        _Pragma("clang attribute push(__attribute__((availability(watchos,strict,introduced=6.0))), apply_to=any(function,record))")
+#   define _LIBCPP_AVAILABILITY_FILESYSTEM_POP                                  \
+        _Pragma("clang attribute pop")                                          \
+        _Pragma("clang attribute pop")                                          \
+        _Pragma("clang attribute pop")                                          \
+        _Pragma("clang attribute pop")
+#   if (defined(__ENVIRONMENT_MAC_OS_X_VERSION_MIN_REQUIRED__) && __ENVIRONMENT_MAC_OS_X_VERSION_MIN_REQUIRED__ < 101500) ||    \
+        (defined(__ENVIRONMENT_IPHONE_OS_VERSION_MIN_REQUIRED__) && __ENVIRONMENT_IPHONE_OS_VERSION_MIN_REQUIRED__ < 130000) || \
+        (defined(__ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__) && __ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__ < 130000) ||         \
+        (defined(__ENVIRONMENT_WATCH_OS_VERSION_MIN_REQUIRED__) && __ENVIRONMENT_WATCH_OS_VERSION_MIN_REQUIRED__ < 60000)
+#       define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_filesystem
+#   endif
+
+#   define _LIBCPP_AVAILABILITY_TO_CHARS_FLOATING_POINT                         \
+        __attribute__((unavailable))
+
+#   define _LIBCPP_AVAILABILITY_SYNC                                            \
+        __attribute__((availability(macos,strict,introduced=11.0)))             \
+        __attribute__((availability(ios,strict,introduced=14.0)))               \
+        __attribute__((availability(tvos,strict,introduced=14.0)))              \
+        __attribute__((availability(watchos,strict,introduced=7.0)))
+#   if (defined(__ENVIRONMENT_MAC_OS_X_VERSION_MIN_REQUIRED__) && __ENVIRONMENT_MAC_OS_X_VERSION_MIN_REQUIRED__ < 110000) ||    \
+        (defined(__ENVIRONMENT_IPHONE_OS_VERSION_MIN_REQUIRED__) && __ENVIRONMENT_IPHONE_OS_VERSION_MIN_REQUIRED__ < 140000) || \
+        (defined(__ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__) && __ENVIRONMENT_TV_OS_VERSION_MIN_REQUIRED__ < 140000) ||         \
+        (defined(__ENVIRONMENT_WATCH_OS_VERSION_MIN_REQUIRED__) && __ENVIRONMENT_WATCH_OS_VERSION_MIN_REQUIRED__ < 70000)
+#       define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_atomic_wait
+#       define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_barrier
+#       define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_latch
+#       define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_semaphore
+#   endif
+
+#   define _LIBCPP_AVAILABILITY_FORMAT                                          \
+        __attribute__((unavailable))
+#   define _LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_format
+
+#   define _LIBCPP_HAS_NO_VERBOSE_ABORT_IN_LIBRARY
+
+#else
+
+// ...New vendors can add availability markup here...
+
+#   error "It looks like you're trying to enable vendor availability markup, but you haven't defined the corresponding macros yet!"
+
+#endif
+
+// Define availability attributes that depend on _LIBCPP_NO_EXCEPTIONS.
+// Those are defined in terms of the availability attributes above, and
+// should not be vendor-specific.
+#if defined(_LIBCPP_NO_EXCEPTIONS)
+#   define _LIBCPP_AVAILABILITY_FUTURE
+#   define _LIBCPP_AVAILABILITY_THROW_BAD_ANY_CAST
+#   define _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+#   define _LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+#else
+#   define _LIBCPP_AVAILABILITY_FUTURE                    _LIBCPP_AVAILABILITY_FUTURE_ERROR
+#   define _LIBCPP_AVAILABILITY_THROW_BAD_ANY_CAST        _LIBCPP_AVAILABILITY_BAD_ANY_CAST
+#   define _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS _LIBCPP_AVAILABILITY_BAD_OPTIONAL_ACCESS
+#   define _LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS  _LIBCPP_AVAILABILITY_BAD_VARIANT_ACCESS
+#endif
+
+#endif // _LIBCPP___AVAILABILITY
diff --git a/app/src/main/cpp/libcxx/include/__bit/bit_cast.h b/app/src/main/cpp/libcxx/include/__bit/bit_cast.h
new file mode 100644
index 0000000..2ca4120
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/bit_cast.h
@@ -0,0 +1,36 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_BIT_CAST_H
+#define _LIBCPP___BIT_BIT_CAST_H
+
+#include <__config>
+#include <__type_traits/is_trivially_copyable.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _ToType, class _FromType>
+  requires(sizeof(_ToType) == sizeof(_FromType) &&
+           is_trivially_copyable_v<_ToType> &&
+           is_trivially_copyable_v<_FromType>)
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr _ToType bit_cast(const _FromType& __from) noexcept {
+  return __builtin_bit_cast(_ToType, __from);
+}
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___BIT_BIT_CAST_H
diff --git a/app/src/main/cpp/libcxx/include/__bit/bit_ceil.h b/app/src/main/cpp/libcxx/include/__bit/bit_ceil.h
new file mode 100644
index 0000000..a558d61
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/bit_ceil.h
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_BIT_CEIL_H
+#define _LIBCPP___BIT_BIT_CEIL_H
+
+#include <__assert>
+#include <__bit/countl.h>
+#include <__concepts/arithmetic.h>
+#include <__config>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER >= 20
+
+template <__libcpp_unsigned_integer _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr _Tp bit_ceil(_Tp __t) noexcept {
+  if (__t < 2)
+    return 1;
+  const unsigned __n = numeric_limits<_Tp>::digits - std::countl_zero((_Tp)(__t - 1u));
+  _LIBCPP_ASSERT(__n != numeric_limits<_Tp>::digits, "Bad input to bit_ceil");
+
+  if constexpr (sizeof(_Tp) >= sizeof(unsigned))
+    return _Tp{1} << __n;
+  else {
+    const unsigned __extra = numeric_limits<unsigned>::digits - numeric_limits<_Tp>::digits;
+    const unsigned __retVal = 1u << (__n + __extra);
+    return (_Tp)(__retVal >> __extra);
+  }
+}
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___BIT_BIT_CEIL_H
diff --git a/app/src/main/cpp/libcxx/include/__bit/bit_floor.h b/app/src/main/cpp/libcxx/include/__bit/bit_floor.h
new file mode 100644
index 0000000..b2e3809
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/bit_floor.h
@@ -0,0 +1,34 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_BIT_FLOOR_H
+#define _LIBCPP___BIT_BIT_FLOOR_H
+
+#include <__bit/bit_log2.h>
+#include <__concepts/arithmetic.h>
+#include <__config>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER >= 20
+
+template <__libcpp_unsigned_integer _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr _Tp bit_floor(_Tp __t) noexcept {
+  return __t == 0 ? 0 : _Tp{1} << std::__bit_log2(__t);
+}
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___BIT_BIT_FLOOR_H
diff --git a/app/src/main/cpp/libcxx/include/__bit/bit_log2.h b/app/src/main/cpp/libcxx/include/__bit/bit_log2.h
new file mode 100644
index 0000000..62936f6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/bit_log2.h
@@ -0,0 +1,34 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_BIT_LOG2_H
+#define _LIBCPP___BIT_BIT_LOG2_H
+
+#include <__bit/countl.h>
+#include <__concepts/arithmetic.h>
+#include <__config>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER >= 20
+
+template <__libcpp_unsigned_integer _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr _Tp __bit_log2(_Tp __t) noexcept {
+  return numeric_limits<_Tp>::digits - 1 - std::countl_zero(__t);
+}
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___BIT_BIT_LOG2_H
diff --git a/app/src/main/cpp/libcxx/include/__bit/bit_width.h b/app/src/main/cpp/libcxx/include/__bit/bit_width.h
new file mode 100644
index 0000000..4381f22
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/bit_width.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_BIT_WIDTH_H
+#define _LIBCPP___BIT_BIT_WIDTH_H
+
+#include <__bit/bit_log2.h>
+#include <__concepts/arithmetic.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER >= 20
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <__libcpp_unsigned_integer _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr int bit_width(_Tp __t) noexcept {
+  return __t == 0 ? 0 : std::__bit_log2(__t) + 1;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 20
+
+#endif // _LIBCPP___BIT_BIT_WIDTH_H
diff --git a/app/src/main/cpp/libcxx/include/__bit/blsr.h b/app/src/main/cpp/libcxx/include/__bit/blsr.h
new file mode 100644
index 0000000..de991e9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/blsr.h
@@ -0,0 +1,34 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_BLSR_H
+#define _LIBCPP___BIT_BLSR_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR unsigned __libcpp_blsr(unsigned __x) _NOEXCEPT {
+  return __x ^ (__x & -__x);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR unsigned long __libcpp_blsr(unsigned long __x) _NOEXCEPT {
+  return __x ^ (__x & -__x);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR unsigned long long __libcpp_blsr(unsigned long long __x) _NOEXCEPT {
+  return __x ^ (__x & -__x);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___BIT_BLSR_H
diff --git a/app/src/main/cpp/libcxx/include/__bit/byteswap.h b/app/src/main/cpp/libcxx/include/__bit/byteswap.h
new file mode 100644
index 0000000..6fa8d48
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/byteswap.h
@@ -0,0 +1,55 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_BYTESWAP_H
+#define _LIBCPP___BIT_BYTESWAP_H
+
+#include <__concepts/arithmetic.h>
+#include <__config>
+#include <cstdint>
+#include <cstdlib>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 20
+
+template <integral _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr _Tp byteswap(_Tp __val) noexcept {
+
+  if constexpr (sizeof(_Tp) == 1) {
+    return __val;
+  } else if constexpr (sizeof(_Tp) == 2) {
+    return __builtin_bswap16(__val);
+  } else if constexpr (sizeof(_Tp) == 4) {
+    return __builtin_bswap32(__val);
+  } else if constexpr (sizeof(_Tp) == 8) {
+    return __builtin_bswap64(__val);
+#ifndef _LIBCPP_HAS_NO_INT128
+  } else if constexpr (sizeof(_Tp) == 16) {
+#if __has_builtin(__builtin_bswap128)
+    return __builtin_bswap128(__val);
+#else
+    return static_cast<_Tp>(byteswap(static_cast<uint64_t>(__val))) << 64 |
+           static_cast<_Tp>(byteswap(static_cast<uint64_t>(__val >> 64)));
+#endif // __has_builtin(__builtin_bswap128)
+#endif // _LIBCPP_HAS_NO_INT128
+  } else {
+    static_assert(sizeof(_Tp) == 0, "byteswap is unimplemented for integral types of this size");
+  }
+}
+
+#endif // _LIBCPP_STD_VER > 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___BIT_BYTESWAP_H
diff --git a/app/src/main/cpp/libcxx/include/__bit/countl.h b/app/src/main/cpp/libcxx/include/__bit/countl.h
new file mode 100644
index 0000000..86eaee0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/countl.h
@@ -0,0 +1,104 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_COUNTL_H
+#define _LIBCPP___BIT_COUNTL_H
+
+#include <__bit/rotate.h>
+#include <__concepts/arithmetic.h>
+#include <__config>
+#include <__type_traits/is_unsigned_integer.h>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+int __libcpp_clz(unsigned __x)           _NOEXCEPT { return __builtin_clz(__x); }
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+int __libcpp_clz(unsigned long __x)      _NOEXCEPT { return __builtin_clzl(__x); }
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+int __libcpp_clz(unsigned long long __x) _NOEXCEPT { return __builtin_clzll(__x); }
+
+#  ifndef _LIBCPP_HAS_NO_INT128
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+int __libcpp_clz(__uint128_t __x) _NOEXCEPT {
+  // The function is written in this form due to C++ constexpr limitations.
+  // The algorithm:
+  // - Test whether any bit in the high 64-bits is set
+  // - No bits set:
+  //   - The high 64-bits contain 64 leading zeros,
+  //   - Add the result of the low 64-bits.
+  // - Any bits set:
+  //   - The number of leading zeros of the input is the number of leading
+  //     zeros in the high 64-bits.
+  return ((__x >> 64) == 0)
+           ? (64 + __builtin_clzll(static_cast<unsigned long long>(__x)))
+           : __builtin_clzll(static_cast<unsigned long long>(__x >> 64));
+}
+#  endif // _LIBCPP_HAS_NO_INT128
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+int __countl_zero(_Tp __t) _NOEXCEPT
+{
+    static_assert(__libcpp_is_unsigned_integer<_Tp>::value, "__countl_zero requires an unsigned integer type");
+    if (__t == 0)
+        return numeric_limits<_Tp>::digits;
+
+    if      (sizeof(_Tp) <= sizeof(unsigned int))
+        return std::__libcpp_clz(static_cast<unsigned int>(__t))
+              - (numeric_limits<unsigned int>::digits - numeric_limits<_Tp>::digits);
+    else if (sizeof(_Tp) <= sizeof(unsigned long))
+        return std::__libcpp_clz(static_cast<unsigned long>(__t))
+              - (numeric_limits<unsigned long>::digits - numeric_limits<_Tp>::digits);
+    else if (sizeof(_Tp) <= sizeof(unsigned long long))
+        return std::__libcpp_clz(static_cast<unsigned long long>(__t))
+              - (numeric_limits<unsigned long long>::digits - numeric_limits<_Tp>::digits);
+    else
+    {
+        int __ret = 0;
+        int __iter = 0;
+        const unsigned int __ulldigits = numeric_limits<unsigned long long>::digits;
+        while (true) {
+            __t = std::__rotr(__t, __ulldigits);
+            if ((__iter = std::__countl_zero(static_cast<unsigned long long>(__t))) != __ulldigits)
+                break;
+            __ret += __iter;
+            }
+        return __ret + __iter;
+    }
+}
+
+#if _LIBCPP_STD_VER >= 20
+
+template <__libcpp_unsigned_integer _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr int countl_zero(_Tp __t) noexcept {
+  return std::__countl_zero(__t);
+}
+
+template <__libcpp_unsigned_integer _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr int countl_one(_Tp __t) noexcept {
+  return __t != numeric_limits<_Tp>::max() ? std::countl_zero(static_cast<_Tp>(~__t)) : numeric_limits<_Tp>::digits;
+}
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___BIT_COUNTL_H
diff --git a/app/src/main/cpp/libcxx/include/__bit/countr.h b/app/src/main/cpp/libcxx/include/__bit/countr.h
new file mode 100644
index 0000000..d3ca5b6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/countr.h
@@ -0,0 +1,70 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_COUNTR_H
+#define _LIBCPP___BIT_COUNTR_H
+
+#include <__bit/rotate.h>
+#include <__concepts/arithmetic.h>
+#include <__config>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+int __libcpp_ctz(unsigned __x)           _NOEXCEPT { return __builtin_ctz(__x); }
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+int __libcpp_ctz(unsigned long __x)      _NOEXCEPT { return __builtin_ctzl(__x); }
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+int __libcpp_ctz(unsigned long long __x) _NOEXCEPT { return __builtin_ctzll(__x); }
+
+#if _LIBCPP_STD_VER >= 20
+
+template <__libcpp_unsigned_integer _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr int countr_zero(_Tp __t) noexcept {
+  if (__t == 0)
+    return numeric_limits<_Tp>::digits;
+
+  if (sizeof(_Tp) <= sizeof(unsigned int))
+    return std::__libcpp_ctz(static_cast<unsigned int>(__t));
+  else if (sizeof(_Tp) <= sizeof(unsigned long))
+    return std::__libcpp_ctz(static_cast<unsigned long>(__t));
+  else if (sizeof(_Tp) <= sizeof(unsigned long long))
+    return std::__libcpp_ctz(static_cast<unsigned long long>(__t));
+  else {
+    int __ret = 0;
+    const unsigned int __ulldigits = numeric_limits<unsigned long long>::digits;
+    while (static_cast<unsigned long long>(__t) == 0uLL) {
+      __ret += __ulldigits;
+      __t >>= __ulldigits;
+    }
+    return __ret + std::__libcpp_ctz(static_cast<unsigned long long>(__t));
+  }
+}
+
+template <__libcpp_unsigned_integer _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr int countr_one(_Tp __t) noexcept {
+  return __t != numeric_limits<_Tp>::max() ? std::countr_zero(static_cast<_Tp>(~__t)) : numeric_limits<_Tp>::digits;
+}
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___BIT_COUNTR_H
diff --git a/app/src/main/cpp/libcxx/include/__bit/endian.h b/app/src/main/cpp/libcxx/include/__bit/endian.h
new file mode 100644
index 0000000..52635f2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/endian.h
@@ -0,0 +1,38 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_ENDIAN_H
+#define _LIBCPP___BIT_ENDIAN_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER >= 20
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+enum class endian {
+  little = 0xDEAD,
+  big = 0xFACE,
+#  if defined(_LIBCPP_LITTLE_ENDIAN)
+  native = little
+#  elif defined(_LIBCPP_BIG_ENDIAN)
+  native = big
+#  else
+  native = 0xCAFE
+#  endif
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 20
+
+#endif // _LIBCPP___BIT_ENDIAN_H
diff --git a/app/src/main/cpp/libcxx/include/__bit/has_single_bit.h b/app/src/main/cpp/libcxx/include/__bit/has_single_bit.h
new file mode 100644
index 0000000..b89f599
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/has_single_bit.h
@@ -0,0 +1,37 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_HAS_SINGLE_BIT_H
+#define _LIBCPP___BIT_HAS_SINGLE_BIT_H
+
+#include <__concepts/arithmetic.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+#if _LIBCPP_STD_VER >= 20
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <__libcpp_unsigned_integer _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr bool has_single_bit(_Tp __t) noexcept {
+  return __t != 0 && (((__t & (__t - 1)) == 0));
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___BIT_HAS_SINGLE_BIT_H
diff --git a/app/src/main/cpp/libcxx/include/__bit/popcount.h b/app/src/main/cpp/libcxx/include/__bit/popcount.h
new file mode 100644
index 0000000..33b94cf
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/popcount.h
@@ -0,0 +1,61 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_POPCOUNT_H
+#define _LIBCPP___BIT_POPCOUNT_H
+
+#include <__bit/rotate.h>
+#include <__concepts/arithmetic.h>
+#include <__config>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+int __libcpp_popcount(unsigned __x)           _NOEXCEPT { return __builtin_popcount(__x); }
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+int __libcpp_popcount(unsigned long __x)      _NOEXCEPT { return __builtin_popcountl(__x); }
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+int __libcpp_popcount(unsigned long long __x) _NOEXCEPT { return __builtin_popcountll(__x); }
+
+#if _LIBCPP_STD_VER >= 20
+
+template <__libcpp_unsigned_integer _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr int popcount(_Tp __t) noexcept {
+  if (sizeof(_Tp) <= sizeof(unsigned int))
+    return std::__libcpp_popcount(static_cast<unsigned int>(__t));
+  else if (sizeof(_Tp) <= sizeof(unsigned long))
+    return std::__libcpp_popcount(static_cast<unsigned long>(__t));
+  else if (sizeof(_Tp) <= sizeof(unsigned long long))
+    return std::__libcpp_popcount(static_cast<unsigned long long>(__t));
+  else {
+    int __ret = 0;
+    while (__t != 0) {
+      __ret += std::__libcpp_popcount(static_cast<unsigned long long>(__t));
+      __t >>= numeric_limits<unsigned long long>::digits;
+    }
+    return __ret;
+  }
+}
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___BIT_POPCOUNT_H
diff --git a/app/src/main/cpp/libcxx/include/__bit/rotate.h b/app/src/main/cpp/libcxx/include/__bit/rotate.h
new file mode 100644
index 0000000..5aa7518
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit/rotate.h
@@ -0,0 +1,53 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_ROTATE_H
+#define _LIBCPP___BIT_ROTATE_H
+
+#include <__concepts/arithmetic.h>
+#include <__config>
+#include <__type_traits/is_unsigned_integer.h>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp __rotr(_Tp __t, unsigned int __cnt) _NOEXCEPT
+{
+    static_assert(__libcpp_is_unsigned_integer<_Tp>::value, "__rotr requires an unsigned integer type");
+    const unsigned int __dig = numeric_limits<_Tp>::digits;
+    if ((__cnt % __dig) == 0)
+        return __t;
+    return (__t >> (__cnt % __dig)) | (__t << (__dig - (__cnt % __dig)));
+}
+
+#if _LIBCPP_STD_VER >= 20
+
+template <__libcpp_unsigned_integer _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr _Tp rotl(_Tp __t, unsigned int __cnt) noexcept {
+  const unsigned int __dig = numeric_limits<_Tp>::digits;
+  if ((__cnt % __dig) == 0)
+    return __t;
+  return (__t << (__cnt % __dig)) | (__t >> (__dig - (__cnt % __dig)));
+}
+
+template <__libcpp_unsigned_integer _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr _Tp rotr(_Tp __t, unsigned int __cnt) noexcept {
+  return std::__rotr(__t, __cnt);
+}
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___BIT_ROTATE_H
diff --git a/app/src/main/cpp/libcxx/include/__bit_reference b/app/src/main/cpp/libcxx/include/__bit_reference
new file mode 100644
index 0000000..2665749
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bit_reference
@@ -0,0 +1,1360 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BIT_REFERENCE
+#define _LIBCPP___BIT_REFERENCE
+
+#include <__algorithm/copy_n.h>
+#include <__algorithm/fill_n.h>
+#include <__algorithm/min.h>
+#include <__bit/countr.h>
+#include <__bit/popcount.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__memory/construct_at.h>
+#include <__memory/pointer_traits.h>
+#include <cstring>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Cp, bool _IsConst, typename _Cp::__storage_type = 0> class __bit_iterator;
+template <class _Cp> class __bit_const_reference;
+
+template <class _Tp>
+struct __has_storage_type
+{
+    static const bool value = false;
+};
+
+template <class _Cp, bool = __has_storage_type<_Cp>::value>
+class __bit_reference
+{
+    typedef typename _Cp::__storage_type    __storage_type;
+    typedef typename _Cp::__storage_pointer __storage_pointer;
+
+    __storage_pointer __seg_;
+    __storage_type    __mask_;
+
+    friend typename _Cp::__self;
+
+    friend class __bit_const_reference<_Cp>;
+    friend class __bit_iterator<_Cp, false>;
+public:
+    using __container = typename _Cp::__self;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __bit_reference(const __bit_reference&) = default;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 operator bool() const _NOEXCEPT
+        {return static_cast<bool>(*__seg_ & __mask_);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 bool operator ~() const _NOEXCEPT
+        {return !static_cast<bool>(*this);}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __bit_reference& operator=(bool __x) _NOEXCEPT
+    {
+        if (__x)
+            *__seg_ |= __mask_;
+        else
+            *__seg_ &= ~__mask_;
+        return *this;
+    }
+
+#if _LIBCPP_STD_VER > 20
+    _LIBCPP_HIDE_FROM_ABI constexpr const __bit_reference& operator=(bool __x) const noexcept {
+        if (__x)
+            *__seg_ |= __mask_;
+        else
+            *__seg_ &= ~__mask_;
+        return *this;
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __bit_reference& operator=(const __bit_reference& __x) _NOEXCEPT
+        {return operator=(static_cast<bool>(__x));}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 void flip() _NOEXCEPT {*__seg_ ^= __mask_;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator<_Cp, false> operator&() const _NOEXCEPT
+        {return __bit_iterator<_Cp, false>(__seg_, static_cast<unsigned>(std::__libcpp_ctz(__mask_)));}
+private:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    explicit __bit_reference(__storage_pointer __s, __storage_type __m) _NOEXCEPT
+        : __seg_(__s), __mask_(__m) {}
+};
+
+template <class _Cp>
+class __bit_reference<_Cp, false>
+{
+};
+
+template <class _Cp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+swap(__bit_reference<_Cp> __x, __bit_reference<_Cp> __y) _NOEXCEPT
+{
+    bool __t = __x;
+    __x = __y;
+    __y = __t;
+}
+
+template <class _Cp, class _Dp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+swap(__bit_reference<_Cp> __x, __bit_reference<_Dp> __y) _NOEXCEPT
+{
+    bool __t = __x;
+    __x = __y;
+    __y = __t;
+}
+
+template <class _Cp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+swap(__bit_reference<_Cp> __x, bool& __y) _NOEXCEPT
+{
+    bool __t = __x;
+    __x = __y;
+    __y = __t;
+}
+
+template <class _Cp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+swap(bool& __x, __bit_reference<_Cp> __y) _NOEXCEPT
+{
+    bool __t = __x;
+    __x = __y;
+    __y = __t;
+}
+
+template <class _Cp>
+class __bit_const_reference
+{
+    typedef typename _Cp::__storage_type          __storage_type;
+    typedef typename _Cp::__const_storage_pointer __storage_pointer;
+
+    __storage_pointer        __seg_;
+    __storage_type __mask_;
+
+    friend typename _Cp::__self;
+    friend class __bit_iterator<_Cp, true>;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __bit_const_reference(const __bit_const_reference&) = default;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __bit_const_reference(const __bit_reference<_Cp>& __x) _NOEXCEPT
+        : __seg_(__x.__seg_), __mask_(__x.__mask_) {}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR operator bool() const _NOEXCEPT
+        {return static_cast<bool>(*__seg_ & __mask_);}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator<_Cp, true> operator&() const _NOEXCEPT
+        {return __bit_iterator<_Cp, true>(__seg_, static_cast<unsigned>(std::__libcpp_ctz(__mask_)));}
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR
+    explicit __bit_const_reference(__storage_pointer __s, __storage_type __m) _NOEXCEPT
+        : __seg_(__s), __mask_(__m) {}
+
+    __bit_const_reference& operator=(const __bit_const_reference&) = delete;
+};
+
+// find
+
+template <class _Cp, bool _IsConst>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __bit_iterator<_Cp, _IsConst>
+__find_bool_true(__bit_iterator<_Cp, _IsConst> __first, typename _Cp::size_type __n)
+{
+    typedef __bit_iterator<_Cp, _IsConst> _It;
+    typedef typename _It::__storage_type __storage_type;
+    const int __bits_per_word = _It::__bits_per_word;
+    // do first partial word
+    if (__first.__ctz_ != 0)
+    {
+        __storage_type __clz_f = static_cast<__storage_type>(__bits_per_word - __first.__ctz_);
+        __storage_type __dn = _VSTD::min(__clz_f, __n);
+        __storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz_f - __dn));
+        __storage_type __b = *__first.__seg_ & __m;
+        if (__b)
+            return _It(__first.__seg_, static_cast<unsigned>(_VSTD::__libcpp_ctz(__b)));
+        if (__n == __dn)
+            return __first + __n;
+        __n -= __dn;
+        ++__first.__seg_;
+    }
+    // do middle whole words
+    for (; __n >= __bits_per_word; ++__first.__seg_, __n -= __bits_per_word)
+        if (*__first.__seg_)
+            return _It(__first.__seg_, static_cast<unsigned>(_VSTD::__libcpp_ctz(*__first.__seg_)));
+    // do last partial word
+    if (__n > 0)
+    {
+        __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+        __storage_type __b = *__first.__seg_ & __m;
+        if (__b)
+            return _It(__first.__seg_, static_cast<unsigned>(_VSTD::__libcpp_ctz(__b)));
+    }
+    return _It(__first.__seg_, static_cast<unsigned>(__n));
+}
+
+template <class _Cp, bool _IsConst>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __bit_iterator<_Cp, _IsConst>
+__find_bool_false(__bit_iterator<_Cp, _IsConst> __first, typename _Cp::size_type __n)
+{
+    typedef __bit_iterator<_Cp, _IsConst> _It;
+    typedef typename _It::__storage_type __storage_type;
+    const int __bits_per_word = _It::__bits_per_word;
+    // do first partial word
+    if (__first.__ctz_ != 0)
+    {
+        __storage_type __clz_f = static_cast<__storage_type>(__bits_per_word - __first.__ctz_);
+        __storage_type __dn = _VSTD::min(__clz_f, __n);
+        __storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz_f - __dn));
+        __storage_type __b = ~*__first.__seg_ & __m;
+        if (__b)
+            return _It(__first.__seg_, static_cast<unsigned>(_VSTD::__libcpp_ctz(__b)));
+        if (__n == __dn)
+            return __first + __n;
+        __n -= __dn;
+        ++__first.__seg_;
+    }
+    // do middle whole words
+    for (; __n >= __bits_per_word; ++__first.__seg_, __n -= __bits_per_word)
+    {
+        __storage_type __b = ~*__first.__seg_;
+        if (__b)
+            return _It(__first.__seg_, static_cast<unsigned>(_VSTD::__libcpp_ctz(__b)));
+    }
+    // do last partial word
+    if (__n > 0)
+    {
+        __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+        __storage_type __b = ~*__first.__seg_ & __m;
+        if (__b)
+            return _It(__first.__seg_, static_cast<unsigned>(_VSTD::__libcpp_ctz(__b)));
+    }
+    return _It(__first.__seg_, static_cast<unsigned>(__n));
+}
+
+template <class _Cp, bool _IsConst, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+__bit_iterator<_Cp, _IsConst>
+find(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, const _Tp& __value)
+{
+    if (static_cast<bool>(__value))
+        return _VSTD::__find_bool_true(__first, static_cast<typename _Cp::size_type>(__last - __first));
+    return _VSTD::__find_bool_false(__first, static_cast<typename _Cp::size_type>(__last - __first));
+}
+
+// count
+
+template <class _Cp, bool _IsConst>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 typename __bit_iterator<_Cp, _IsConst>::difference_type
+__count_bool_true(__bit_iterator<_Cp, _IsConst> __first, typename _Cp::size_type __n)
+{
+    typedef __bit_iterator<_Cp, _IsConst> _It;
+    typedef typename _It::__storage_type __storage_type;
+    typedef typename _It::difference_type difference_type;
+    const int __bits_per_word = _It::__bits_per_word;
+    difference_type __r = 0;
+    // do first partial word
+    if (__first.__ctz_ != 0)
+    {
+        __storage_type __clz_f = static_cast<__storage_type>(__bits_per_word - __first.__ctz_);
+        __storage_type __dn = _VSTD::min(__clz_f, __n);
+        __storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz_f - __dn));
+        __r = _VSTD::__libcpp_popcount(*__first.__seg_ & __m);
+        __n -= __dn;
+        ++__first.__seg_;
+    }
+    // do middle whole words
+    for (; __n >= __bits_per_word; ++__first.__seg_, __n -= __bits_per_word)
+        __r += _VSTD::__libcpp_popcount(*__first.__seg_);
+    // do last partial word
+    if (__n > 0)
+    {
+        __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+        __r += _VSTD::__libcpp_popcount(*__first.__seg_ & __m);
+    }
+    return __r;
+}
+
+template <class _Cp, bool _IsConst>
+_LIBCPP_HIDE_FROM_ABI typename __bit_iterator<_Cp, _IsConst>::difference_type
+__count_bool_false(__bit_iterator<_Cp, _IsConst> __first, typename _Cp::size_type __n)
+{
+    typedef __bit_iterator<_Cp, _IsConst> _It;
+    typedef typename _It::__storage_type __storage_type;
+    typedef typename _It::difference_type difference_type;
+    const int __bits_per_word = _It::__bits_per_word;
+    difference_type __r = 0;
+    // do first partial word
+    if (__first.__ctz_ != 0)
+    {
+        __storage_type __clz_f = static_cast<__storage_type>(__bits_per_word - __first.__ctz_);
+        __storage_type __dn = _VSTD::min(__clz_f, __n);
+        __storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz_f - __dn));
+        __r = _VSTD::__libcpp_popcount(~*__first.__seg_ & __m);
+        __n -= __dn;
+        ++__first.__seg_;
+    }
+    // do middle whole words
+    for (; __n >= __bits_per_word; ++__first.__seg_, __n -= __bits_per_word)
+        __r += _VSTD::__libcpp_popcount(~*__first.__seg_);
+    // do last partial word
+    if (__n > 0)
+    {
+        __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+        __r += _VSTD::__libcpp_popcount(~*__first.__seg_ & __m);
+    }
+    return __r;
+}
+
+template <class _Cp, bool _IsConst, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+typename __bit_iterator<_Cp, _IsConst>::difference_type
+count(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, const _Tp& __value)
+{
+    if (static_cast<bool>(__value))
+        return _VSTD::__count_bool_true(__first, static_cast<typename _Cp::size_type>(__last - __first));
+    return _VSTD::__count_bool_false(__first, static_cast<typename _Cp::size_type>(__last - __first));
+}
+
+// fill_n
+
+template <class _Cp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void
+__fill_n_false(__bit_iterator<_Cp, false> __first, typename _Cp::size_type __n)
+{
+    typedef __bit_iterator<_Cp, false> _It;
+    typedef typename _It::__storage_type __storage_type;
+    const int __bits_per_word = _It::__bits_per_word;
+    // do first partial word
+    if (__first.__ctz_ != 0)
+    {
+        __storage_type __clz_f = static_cast<__storage_type>(__bits_per_word - __first.__ctz_);
+        __storage_type __dn = _VSTD::min(__clz_f, __n);
+        __storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz_f - __dn));
+        *__first.__seg_ &= ~__m;
+        __n -= __dn;
+        ++__first.__seg_;
+    }
+    // do middle whole words
+    __storage_type __nw = __n / __bits_per_word;
+    std::fill_n(std::__to_address(__first.__seg_), __nw, 0);
+    __n -= __nw * __bits_per_word;
+    // do last partial word
+    if (__n > 0)
+    {
+        __first.__seg_ += __nw;
+        __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+        *__first.__seg_ &= ~__m;
+    }
+}
+
+template <class _Cp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void
+__fill_n_true(__bit_iterator<_Cp, false> __first, typename _Cp::size_type __n)
+{
+    typedef __bit_iterator<_Cp, false> _It;
+    typedef typename _It::__storage_type __storage_type;
+    const int __bits_per_word = _It::__bits_per_word;
+    // do first partial word
+    if (__first.__ctz_ != 0)
+    {
+        __storage_type __clz_f = static_cast<__storage_type>(__bits_per_word - __first.__ctz_);
+        __storage_type __dn = _VSTD::min(__clz_f, __n);
+        __storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz_f - __dn));
+        *__first.__seg_ |= __m;
+        __n -= __dn;
+        ++__first.__seg_;
+    }
+    // do middle whole words
+    __storage_type __nw = __n / __bits_per_word;
+    // __storage_type is always an unsigned type, so -1 sets all bits
+    std::fill_n(std::__to_address(__first.__seg_), __nw, static_cast<__storage_type>(-1));
+    __n -= __nw * __bits_per_word;
+    // do last partial word
+    if (__n > 0)
+    {
+        __first.__seg_ += __nw;
+        __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+        *__first.__seg_ |= __m;
+    }
+}
+
+template <class _Cp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+fill_n(__bit_iterator<_Cp, false> __first, typename _Cp::size_type __n, bool __value)
+{
+    if (__n > 0)
+    {
+        if (__value)
+            _VSTD::__fill_n_true(__first, __n);
+        else
+            _VSTD::__fill_n_false(__first, __n);
+    }
+}
+
+// fill
+
+template <class _Cp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+fill(__bit_iterator<_Cp, false> __first, __bit_iterator<_Cp, false> __last, bool __value)
+{
+    _VSTD::fill_n(__first, static_cast<typename _Cp::size_type>(__last - __first), __value);
+}
+
+// copy
+
+template <class _Cp, bool _IsConst>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __bit_iterator<_Cp, false>
+__copy_aligned(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last,
+                                                     __bit_iterator<_Cp, false> __result)
+{
+    typedef __bit_iterator<_Cp, _IsConst> _In;
+    typedef  typename _In::difference_type difference_type;
+    typedef typename _In::__storage_type __storage_type;
+    const int __bits_per_word = _In::__bits_per_word;
+    difference_type __n = __last - __first;
+    if (__n > 0)
+    {
+        // do first word
+        if (__first.__ctz_ != 0)
+        {
+            unsigned __clz = __bits_per_word - __first.__ctz_;
+            difference_type __dn = _VSTD::min(static_cast<difference_type>(__clz), __n);
+            __n -= __dn;
+            __storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz - __dn));
+            __storage_type __b = *__first.__seg_ & __m;
+            *__result.__seg_ &= ~__m;
+            *__result.__seg_ |= __b;
+            __result.__seg_ += (__dn + __result.__ctz_) / __bits_per_word;
+            __result.__ctz_ = static_cast<unsigned>((__dn + __result.__ctz_)  % __bits_per_word);
+            ++__first.__seg_;
+            // __first.__ctz_ = 0;
+        }
+        // __first.__ctz_ == 0;
+        // do middle words
+        __storage_type __nw = __n / __bits_per_word;
+        std::copy_n(std::__to_address(__first.__seg_), __nw, std::__to_address(__result.__seg_));
+        __n -= __nw * __bits_per_word;
+        __result.__seg_ += __nw;
+        // do last word
+        if (__n > 0)
+        {
+            __first.__seg_ += __nw;
+            __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+            __storage_type __b = *__first.__seg_ & __m;
+            *__result.__seg_ &= ~__m;
+            *__result.__seg_ |= __b;
+            __result.__ctz_ = static_cast<unsigned>(__n);
+        }
+    }
+    return __result;
+}
+
+template <class _Cp, bool _IsConst>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __bit_iterator<_Cp, false>
+__copy_unaligned(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last,
+                                                       __bit_iterator<_Cp, false> __result)
+{
+    typedef __bit_iterator<_Cp, _IsConst> _In;
+    typedef  typename _In::difference_type difference_type;
+    typedef typename _In::__storage_type __storage_type;
+    const int __bits_per_word = _In::__bits_per_word;
+    difference_type __n = __last - __first;
+    if (__n > 0)
+    {
+        // do first word
+        if (__first.__ctz_ != 0)
+        {
+            unsigned __clz_f = __bits_per_word - __first.__ctz_;
+            difference_type __dn = _VSTD::min(static_cast<difference_type>(__clz_f), __n);
+            __n -= __dn;
+            __storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz_f - __dn));
+            __storage_type __b = *__first.__seg_ & __m;
+            unsigned __clz_r = __bits_per_word - __result.__ctz_;
+            __storage_type __ddn = _VSTD::min<__storage_type>(__dn, __clz_r);
+            __m = (~__storage_type(0) << __result.__ctz_) & (~__storage_type(0) >> (__clz_r - __ddn));
+            *__result.__seg_ &= ~__m;
+            if (__result.__ctz_ > __first.__ctz_)
+                *__result.__seg_ |= __b << (__result.__ctz_ - __first.__ctz_);
+            else
+                *__result.__seg_ |= __b >> (__first.__ctz_ - __result.__ctz_);
+            __result.__seg_ += (__ddn + __result.__ctz_) / __bits_per_word;
+            __result.__ctz_ = static_cast<unsigned>((__ddn + __result.__ctz_)  % __bits_per_word);
+            __dn -= __ddn;
+            if (__dn > 0)
+            {
+                __m = ~__storage_type(0) >> (__bits_per_word - __dn);
+                *__result.__seg_ &= ~__m;
+                *__result.__seg_ |= __b >> (__first.__ctz_ + __ddn);
+                __result.__ctz_ = static_cast<unsigned>(__dn);
+            }
+            ++__first.__seg_;
+            // __first.__ctz_ = 0;
+        }
+        // __first.__ctz_ == 0;
+        // do middle words
+        unsigned __clz_r = __bits_per_word - __result.__ctz_;
+        __storage_type __m = ~__storage_type(0) << __result.__ctz_;
+        for (; __n >= __bits_per_word; __n -= __bits_per_word, ++__first.__seg_)
+        {
+            __storage_type __b = *__first.__seg_;
+            *__result.__seg_ &= ~__m;
+            *__result.__seg_ |= __b << __result.__ctz_;
+            ++__result.__seg_;
+            *__result.__seg_ &= __m;
+            *__result.__seg_ |= __b >> __clz_r;
+        }
+        // do last word
+        if (__n > 0)
+        {
+            __m = ~__storage_type(0) >> (__bits_per_word - __n);
+            __storage_type __b = *__first.__seg_ & __m;
+            __storage_type __dn = _VSTD::min(__n, static_cast<difference_type>(__clz_r));
+            __m = (~__storage_type(0) << __result.__ctz_) & (~__storage_type(0) >> (__clz_r - __dn));
+            *__result.__seg_ &= ~__m;
+            *__result.__seg_ |= __b << __result.__ctz_;
+            __result.__seg_ += (__dn + __result.__ctz_) / __bits_per_word;
+            __result.__ctz_ = static_cast<unsigned>((__dn + __result.__ctz_)  % __bits_per_word);
+            __n -= __dn;
+            if (__n > 0)
+            {
+                __m = ~__storage_type(0) >> (__bits_per_word - __n);
+                *__result.__seg_ &= ~__m;
+                *__result.__seg_ |= __b >> __dn;
+                __result.__ctz_ = static_cast<unsigned>(__n);
+            }
+        }
+    }
+    return __result;
+}
+
+template <class _Cp, bool _IsConst>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+__bit_iterator<_Cp, false>
+copy(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, __bit_iterator<_Cp, false> __result)
+{
+    if (__first.__ctz_ == __result.__ctz_)
+        return _VSTD::__copy_aligned(__first, __last, __result);
+    return _VSTD::__copy_unaligned(__first, __last, __result);
+}
+
+// copy_backward
+
+template <class _Cp, bool _IsConst>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __bit_iterator<_Cp, false>
+__copy_backward_aligned(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last,
+                                                     __bit_iterator<_Cp, false> __result)
+{
+    typedef __bit_iterator<_Cp, _IsConst> _In;
+    typedef  typename _In::difference_type difference_type;
+    typedef typename _In::__storage_type __storage_type;
+    const int __bits_per_word = _In::__bits_per_word;
+    difference_type __n = __last - __first;
+    if (__n > 0)
+    {
+        // do first word
+        if (__last.__ctz_ != 0)
+        {
+            difference_type __dn = _VSTD::min(static_cast<difference_type>(__last.__ctz_), __n);
+            __n -= __dn;
+            unsigned __clz = __bits_per_word - __last.__ctz_;
+            __storage_type __m = (~__storage_type(0) << (__last.__ctz_ - __dn)) & (~__storage_type(0) >> __clz);
+            __storage_type __b = *__last.__seg_ & __m;
+            *__result.__seg_ &= ~__m;
+            *__result.__seg_ |= __b;
+            __result.__ctz_ = static_cast<unsigned>(((-__dn & (__bits_per_word - 1)) +
+                                                       __result.__ctz_)  % __bits_per_word);
+            // __last.__ctz_ = 0
+         }
+        // __last.__ctz_ == 0 || __n == 0
+        // __result.__ctz_ == 0 || __n == 0
+        // do middle words
+        __storage_type __nw = __n / __bits_per_word;
+        __result.__seg_ -= __nw;
+        __last.__seg_ -= __nw;
+        std::copy_n(std::__to_address(__last.__seg_), __nw, std::__to_address(__result.__seg_));
+        __n -= __nw * __bits_per_word;
+        // do last word
+        if (__n > 0)
+        {
+            __storage_type __m = ~__storage_type(0) << (__bits_per_word - __n);
+            __storage_type __b = *--__last.__seg_ & __m;
+            *--__result.__seg_ &= ~__m;
+            *__result.__seg_ |= __b;
+            __result.__ctz_ = static_cast<unsigned>(-__n & (__bits_per_word - 1));
+        }
+    }
+    return __result;
+}
+
+template <class _Cp, bool _IsConst>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __bit_iterator<_Cp, false>
+__copy_backward_unaligned(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last,
+                                                       __bit_iterator<_Cp, false> __result)
+{
+    typedef __bit_iterator<_Cp, _IsConst> _In;
+    typedef  typename _In::difference_type difference_type;
+    typedef typename _In::__storage_type __storage_type;
+    const int __bits_per_word = _In::__bits_per_word;
+    difference_type __n = __last - __first;
+    if (__n > 0)
+    {
+        // do first word
+        if (__last.__ctz_ != 0)
+        {
+            difference_type __dn = _VSTD::min(static_cast<difference_type>(__last.__ctz_), __n);
+            __n -= __dn;
+            unsigned __clz_l = __bits_per_word - __last.__ctz_;
+            __storage_type __m = (~__storage_type(0) << (__last.__ctz_ - __dn)) & (~__storage_type(0) >> __clz_l);
+            __storage_type __b = *__last.__seg_ & __m;
+            unsigned __clz_r = __bits_per_word - __result.__ctz_;
+            __storage_type __ddn = _VSTD::min(__dn, static_cast<difference_type>(__result.__ctz_));
+            if (__ddn > 0)
+            {
+                __m = (~__storage_type(0) << (__result.__ctz_ - __ddn)) & (~__storage_type(0) >> __clz_r);
+                *__result.__seg_ &= ~__m;
+                if (__result.__ctz_ > __last.__ctz_)
+                    *__result.__seg_ |= __b << (__result.__ctz_ - __last.__ctz_);
+                else
+                    *__result.__seg_ |= __b >> (__last.__ctz_ - __result.__ctz_);
+                __result.__ctz_ = static_cast<unsigned>(((-__ddn & (__bits_per_word - 1)) +
+                                                         __result.__ctz_)  % __bits_per_word);
+                __dn -= __ddn;
+            }
+            if (__dn > 0)
+            {
+                // __result.__ctz_ == 0
+                --__result.__seg_;
+                __result.__ctz_ = static_cast<unsigned>(-__dn & (__bits_per_word - 1));
+                __m = ~__storage_type(0) << __result.__ctz_;
+                *__result.__seg_ &= ~__m;
+                __last.__ctz_ -= __dn + __ddn;
+                *__result.__seg_ |= __b << (__result.__ctz_ - __last.__ctz_);
+            }
+            // __last.__ctz_ = 0
+         }
+        // __last.__ctz_ == 0 || __n == 0
+        // __result.__ctz_ != 0 || __n == 0
+        // do middle words
+        unsigned __clz_r = __bits_per_word - __result.__ctz_;
+        __storage_type __m = ~__storage_type(0) >> __clz_r;
+        for (; __n >= __bits_per_word; __n -= __bits_per_word)
+        {
+            __storage_type __b = *--__last.__seg_;
+            *__result.__seg_ &= ~__m;
+            *__result.__seg_ |= __b >> __clz_r;
+            *--__result.__seg_ &= __m;
+            *__result.__seg_ |= __b << __result.__ctz_;
+        }
+        // do last word
+        if (__n > 0)
+        {
+            __m = ~__storage_type(0) << (__bits_per_word - __n);
+            __storage_type __b = *--__last.__seg_ & __m;
+            __clz_r = __bits_per_word - __result.__ctz_;
+            __storage_type __dn = _VSTD::min(__n, static_cast<difference_type>(__result.__ctz_));
+            __m = (~__storage_type(0) << (__result.__ctz_ - __dn)) & (~__storage_type(0) >> __clz_r);
+            *__result.__seg_ &= ~__m;
+            *__result.__seg_ |= __b >> (__bits_per_word - __result.__ctz_);
+            __result.__ctz_ = static_cast<unsigned>(((-__dn & (__bits_per_word - 1)) +
+                                                     __result.__ctz_)  % __bits_per_word);
+            __n -= __dn;
+            if (__n > 0)
+            {
+                // __result.__ctz_ == 0
+                --__result.__seg_;
+                __result.__ctz_ = static_cast<unsigned>(-__n & (__bits_per_word - 1));
+                __m = ~__storage_type(0) << __result.__ctz_;
+                *__result.__seg_ &= ~__m;
+                *__result.__seg_ |= __b << (__result.__ctz_ - (__bits_per_word - __n - __dn));
+            }
+        }
+    }
+    return __result;
+}
+
+template <class _Cp, bool _IsConst>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+__bit_iterator<_Cp, false>
+copy_backward(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, __bit_iterator<_Cp, false> __result)
+{
+    if (__last.__ctz_ == __result.__ctz_)
+        return _VSTD::__copy_backward_aligned(__first, __last, __result);
+    return _VSTD::__copy_backward_unaligned(__first, __last, __result);
+}
+
+// move
+
+template <class _Cp, bool _IsConst>
+inline _LIBCPP_INLINE_VISIBILITY
+__bit_iterator<_Cp, false>
+move(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, __bit_iterator<_Cp, false> __result)
+{
+    return _VSTD::copy(__first, __last, __result);
+}
+
+// move_backward
+
+template <class _Cp, bool _IsConst>
+inline _LIBCPP_INLINE_VISIBILITY
+__bit_iterator<_Cp, false>
+move_backward(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, __bit_iterator<_Cp, false> __result)
+{
+    return _VSTD::copy_backward(__first, __last, __result);
+}
+
+// swap_ranges
+
+template <class __C1, class __C2>
+_LIBCPP_HIDE_FROM_ABI __bit_iterator<__C2, false>
+__swap_ranges_aligned(__bit_iterator<__C1, false> __first, __bit_iterator<__C1, false> __last,
+                      __bit_iterator<__C2, false> __result)
+{
+    typedef __bit_iterator<__C1, false> _I1;
+    typedef  typename _I1::difference_type difference_type;
+    typedef typename _I1::__storage_type __storage_type;
+    const int __bits_per_word = _I1::__bits_per_word;
+    difference_type __n = __last - __first;
+    if (__n > 0)
+    {
+        // do first word
+        if (__first.__ctz_ != 0)
+        {
+            unsigned __clz = __bits_per_word - __first.__ctz_;
+            difference_type __dn = _VSTD::min(static_cast<difference_type>(__clz), __n);
+            __n -= __dn;
+            __storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz - __dn));
+            __storage_type __b1 = *__first.__seg_ & __m;
+            *__first.__seg_ &= ~__m;
+            __storage_type __b2 = *__result.__seg_ & __m;
+            *__result.__seg_ &= ~__m;
+            *__result.__seg_ |= __b1;
+            *__first.__seg_  |= __b2;
+            __result.__seg_ += (__dn + __result.__ctz_) / __bits_per_word;
+            __result.__ctz_ = static_cast<unsigned>((__dn + __result.__ctz_)  % __bits_per_word);
+            ++__first.__seg_;
+            // __first.__ctz_ = 0;
+        }
+        // __first.__ctz_ == 0;
+        // do middle words
+        for (; __n >= __bits_per_word; __n -= __bits_per_word, ++__first.__seg_, ++__result.__seg_)
+            swap(*__first.__seg_, *__result.__seg_);
+        // do last word
+        if (__n > 0)
+        {
+            __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+            __storage_type __b1 = *__first.__seg_ & __m;
+            *__first.__seg_ &= ~__m;
+            __storage_type __b2 = *__result.__seg_ & __m;
+            *__result.__seg_ &= ~__m;
+            *__result.__seg_ |= __b1;
+            *__first.__seg_  |= __b2;
+            __result.__ctz_ = static_cast<unsigned>(__n);
+        }
+    }
+    return __result;
+}
+
+template <class __C1, class __C2>
+_LIBCPP_HIDE_FROM_ABI __bit_iterator<__C2, false>
+__swap_ranges_unaligned(__bit_iterator<__C1, false> __first, __bit_iterator<__C1, false> __last,
+                        __bit_iterator<__C2, false> __result)
+{
+    typedef __bit_iterator<__C1, false> _I1;
+    typedef  typename _I1::difference_type difference_type;
+    typedef typename _I1::__storage_type __storage_type;
+    const int __bits_per_word = _I1::__bits_per_word;
+    difference_type __n = __last - __first;
+    if (__n > 0)
+    {
+        // do first word
+        if (__first.__ctz_ != 0)
+        {
+            unsigned __clz_f = __bits_per_word - __first.__ctz_;
+            difference_type __dn = _VSTD::min(static_cast<difference_type>(__clz_f), __n);
+            __n -= __dn;
+            __storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz_f - __dn));
+            __storage_type __b1 = *__first.__seg_ & __m;
+            *__first.__seg_ &= ~__m;
+            unsigned __clz_r = __bits_per_word - __result.__ctz_;
+            __storage_type __ddn = _VSTD::min<__storage_type>(__dn, __clz_r);
+            __m = (~__storage_type(0) << __result.__ctz_) & (~__storage_type(0) >> (__clz_r - __ddn));
+            __storage_type __b2 = *__result.__seg_ & __m;
+            *__result.__seg_ &= ~__m;
+            if (__result.__ctz_ > __first.__ctz_)
+            {
+                unsigned __s = __result.__ctz_ - __first.__ctz_;
+                *__result.__seg_ |= __b1 << __s;
+                *__first.__seg_  |= __b2 >> __s;
+            }
+            else
+            {
+                unsigned __s = __first.__ctz_ - __result.__ctz_;
+                *__result.__seg_ |= __b1 >> __s;
+                *__first.__seg_  |= __b2 << __s;
+            }
+            __result.__seg_ += (__ddn + __result.__ctz_) / __bits_per_word;
+            __result.__ctz_ = static_cast<unsigned>((__ddn + __result.__ctz_)  % __bits_per_word);
+            __dn -= __ddn;
+            if (__dn > 0)
+            {
+                __m = ~__storage_type(0) >> (__bits_per_word - __dn);
+                __b2 = *__result.__seg_ & __m;
+                *__result.__seg_ &= ~__m;
+                unsigned __s = __first.__ctz_ + __ddn;
+                *__result.__seg_ |= __b1 >> __s;
+                *__first.__seg_  |= __b2 << __s;
+                __result.__ctz_ = static_cast<unsigned>(__dn);
+            }
+            ++__first.__seg_;
+            // __first.__ctz_ = 0;
+        }
+        // __first.__ctz_ == 0;
+        // do middle words
+        __storage_type __m = ~__storage_type(0) << __result.__ctz_;
+        unsigned __clz_r = __bits_per_word - __result.__ctz_;
+        for (; __n >= __bits_per_word; __n -= __bits_per_word, ++__first.__seg_)
+        {
+            __storage_type __b1 = *__first.__seg_;
+            __storage_type __b2 = *__result.__seg_ & __m;
+            *__result.__seg_ &= ~__m;
+            *__result.__seg_ |= __b1 << __result.__ctz_;
+            *__first.__seg_  = __b2 >> __result.__ctz_;
+            ++__result.__seg_;
+            __b2 = *__result.__seg_ & ~__m;
+            *__result.__seg_ &= __m;
+            *__result.__seg_ |= __b1 >> __clz_r;
+            *__first.__seg_  |= __b2 << __clz_r;
+        }
+        // do last word
+        if (__n > 0)
+        {
+            __m = ~__storage_type(0) >> (__bits_per_word - __n);
+            __storage_type __b1 = *__first.__seg_ & __m;
+            *__first.__seg_ &= ~__m;
+            __storage_type __dn = _VSTD::min<__storage_type>(__n, __clz_r);
+            __m = (~__storage_type(0) << __result.__ctz_) & (~__storage_type(0) >> (__clz_r - __dn));
+            __storage_type __b2 = *__result.__seg_ & __m;
+            *__result.__seg_ &= ~__m;
+            *__result.__seg_ |= __b1 << __result.__ctz_;
+            *__first.__seg_  |= __b2 >> __result.__ctz_;
+            __result.__seg_ += (__dn + __result.__ctz_) / __bits_per_word;
+            __result.__ctz_ = static_cast<unsigned>((__dn + __result.__ctz_)  % __bits_per_word);
+            __n -= __dn;
+            if (__n > 0)
+            {
+                __m = ~__storage_type(0) >> (__bits_per_word - __n);
+                __b2 = *__result.__seg_ & __m;
+                *__result.__seg_ &= ~__m;
+                *__result.__seg_ |= __b1 >> __dn;
+                *__first.__seg_  |= __b2 << __dn;
+                __result.__ctz_ = static_cast<unsigned>(__n);
+            }
+        }
+    }
+    return __result;
+}
+
+template <class __C1, class __C2>
+inline _LIBCPP_INLINE_VISIBILITY
+__bit_iterator<__C2, false>
+swap_ranges(__bit_iterator<__C1, false> __first1, __bit_iterator<__C1, false> __last1,
+            __bit_iterator<__C2, false> __first2)
+{
+    if (__first1.__ctz_ == __first2.__ctz_)
+        return _VSTD::__swap_ranges_aligned(__first1, __last1, __first2);
+    return _VSTD::__swap_ranges_unaligned(__first1, __last1, __first2);
+}
+
+// rotate
+
+template <class _Cp>
+struct __bit_array
+{
+    typedef typename _Cp::difference_type difference_type;
+    typedef typename _Cp::__storage_type  __storage_type;
+    typedef typename _Cp::__storage_pointer __storage_pointer;
+    typedef typename _Cp::iterator        iterator;
+    static const unsigned __bits_per_word = _Cp::__bits_per_word;
+    static const unsigned _Np = 4;
+
+    difference_type __size_;
+    __storage_type __word_[_Np];
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 static difference_type capacity()
+        {return static_cast<difference_type>(_Np * __bits_per_word);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit __bit_array(difference_type __s) : __size_(__s) {
+        if (__libcpp_is_constant_evaluated()) {
+            for (size_t __i = 0; __i != __bit_array<_Cp>::_Np; ++__i)
+                std::__construct_at(__word_ + __i, 0);
+        }
+    }
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator begin()
+    {
+        return iterator(pointer_traits<__storage_pointer>::pointer_to(__word_[0]), 0);
+    }
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator end()
+    {
+        return iterator(pointer_traits<__storage_pointer>::pointer_to(__word_[0]) + __size_ / __bits_per_word,
+                                                  static_cast<unsigned>(__size_ % __bits_per_word));
+    }
+};
+
+template <class _Cp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __bit_iterator<_Cp, false>
+rotate(__bit_iterator<_Cp, false> __first, __bit_iterator<_Cp, false> __middle, __bit_iterator<_Cp, false> __last)
+{
+    typedef __bit_iterator<_Cp, false> _I1;
+    typedef  typename _I1::difference_type difference_type;
+    difference_type __d1 = __middle - __first;
+    difference_type __d2 = __last - __middle;
+    _I1 __r = __first + __d2;
+    while (__d1 != 0 && __d2 != 0)
+    {
+        if (__d1 <= __d2)
+        {
+            if (__d1 <= __bit_array<_Cp>::capacity())
+            {
+                __bit_array<_Cp> __b(__d1);
+                _VSTD::copy(__first, __middle, __b.begin());
+                _VSTD::copy(__b.begin(), __b.end(), _VSTD::copy(__middle, __last, __first));
+                break;
+            }
+            else
+            {
+                __bit_iterator<_Cp, false> __mp = _VSTD::swap_ranges(__first, __middle, __middle);
+                __first = __middle;
+                __middle = __mp;
+                __d2 -= __d1;
+            }
+        }
+        else
+        {
+            if (__d2 <= __bit_array<_Cp>::capacity())
+            {
+                __bit_array<_Cp> __b(__d2);
+                _VSTD::copy(__middle, __last, __b.begin());
+                _VSTD::copy_backward(__b.begin(), __b.end(), _VSTD::copy_backward(__first, __middle, __last));
+                break;
+            }
+            else
+            {
+                __bit_iterator<_Cp, false> __mp = __first + __d2;
+                _VSTD::swap_ranges(__first, __mp, __middle);
+                __first = __mp;
+                __d1 -= __d2;
+            }
+        }
+    }
+    return __r;
+}
+
+// equal
+
+template <class _Cp, bool _IC1, bool _IC2>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI bool
+__equal_unaligned(__bit_iterator<_Cp, _IC1> __first1, __bit_iterator<_Cp, _IC1> __last1,
+                  __bit_iterator<_Cp, _IC2> __first2)
+{
+    typedef __bit_iterator<_Cp, _IC1> _It;
+    typedef  typename _It::difference_type difference_type;
+    typedef typename _It::__storage_type __storage_type;
+    const int __bits_per_word = _It::__bits_per_word;
+    difference_type __n = __last1 - __first1;
+    if (__n > 0)
+    {
+        // do first word
+        if (__first1.__ctz_ != 0)
+        {
+            unsigned __clz_f = __bits_per_word - __first1.__ctz_;
+            difference_type __dn = _VSTD::min(static_cast<difference_type>(__clz_f), __n);
+            __n -= __dn;
+            __storage_type __m = (~__storage_type(0) << __first1.__ctz_) & (~__storage_type(0) >> (__clz_f - __dn));
+            __storage_type __b = *__first1.__seg_ & __m;
+            unsigned __clz_r = __bits_per_word - __first2.__ctz_;
+            __storage_type __ddn = _VSTD::min<__storage_type>(__dn, __clz_r);
+            __m = (~__storage_type(0) << __first2.__ctz_) & (~__storage_type(0) >> (__clz_r - __ddn));
+            if (__first2.__ctz_ > __first1.__ctz_)
+            {
+                if ((*__first2.__seg_ & __m) != (__b << (__first2.__ctz_ - __first1.__ctz_)))
+                    return false;
+            }
+            else
+            {
+                if ((*__first2.__seg_ & __m) != (__b >> (__first1.__ctz_ - __first2.__ctz_)))
+                    return false;
+            }
+            __first2.__seg_ += (__ddn + __first2.__ctz_) / __bits_per_word;
+            __first2.__ctz_ = static_cast<unsigned>((__ddn + __first2.__ctz_)  % __bits_per_word);
+            __dn -= __ddn;
+            if (__dn > 0)
+            {
+                __m = ~__storage_type(0) >> (__bits_per_word - __dn);
+                if ((*__first2.__seg_ & __m) != (__b >> (__first1.__ctz_ + __ddn)))
+                    return false;
+                __first2.__ctz_ = static_cast<unsigned>(__dn);
+            }
+            ++__first1.__seg_;
+            // __first1.__ctz_ = 0;
+        }
+        // __first1.__ctz_ == 0;
+        // do middle words
+        unsigned __clz_r = __bits_per_word - __first2.__ctz_;
+        __storage_type __m = ~__storage_type(0) << __first2.__ctz_;
+        for (; __n >= __bits_per_word; __n -= __bits_per_word, ++__first1.__seg_)
+        {
+            __storage_type __b = *__first1.__seg_;
+            if ((*__first2.__seg_ & __m) != (__b << __first2.__ctz_))
+                return false;
+            ++__first2.__seg_;
+            if ((*__first2.__seg_ & ~__m) != (__b >> __clz_r))
+                return false;
+        }
+        // do last word
+        if (__n > 0)
+        {
+            __m = ~__storage_type(0) >> (__bits_per_word - __n);
+            __storage_type __b = *__first1.__seg_ & __m;
+            __storage_type __dn = _VSTD::min(__n, static_cast<difference_type>(__clz_r));
+            __m = (~__storage_type(0) << __first2.__ctz_) & (~__storage_type(0) >> (__clz_r - __dn));
+            if ((*__first2.__seg_ & __m) != (__b << __first2.__ctz_))
+                return false;
+            __first2.__seg_ += (__dn + __first2.__ctz_) / __bits_per_word;
+            __first2.__ctz_ = static_cast<unsigned>((__dn + __first2.__ctz_)  % __bits_per_word);
+            __n -= __dn;
+            if (__n > 0)
+            {
+                __m = ~__storage_type(0) >> (__bits_per_word - __n);
+                if ((*__first2.__seg_ & __m) != (__b >> __dn))
+                    return false;
+            }
+        }
+    }
+    return true;
+}
+
+template <class _Cp, bool _IC1, bool _IC2>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI bool
+__equal_aligned(__bit_iterator<_Cp, _IC1> __first1, __bit_iterator<_Cp, _IC1> __last1,
+                __bit_iterator<_Cp, _IC2> __first2)
+{
+    typedef __bit_iterator<_Cp, _IC1> _It;
+    typedef  typename _It::difference_type difference_type;
+    typedef typename _It::__storage_type __storage_type;
+    const int __bits_per_word = _It::__bits_per_word;
+    difference_type __n = __last1 - __first1;
+    if (__n > 0)
+    {
+        // do first word
+        if (__first1.__ctz_ != 0)
+        {
+            unsigned __clz = __bits_per_word - __first1.__ctz_;
+            difference_type __dn = _VSTD::min(static_cast<difference_type>(__clz), __n);
+            __n -= __dn;
+            __storage_type __m = (~__storage_type(0) << __first1.__ctz_) & (~__storage_type(0) >> (__clz - __dn));
+            if ((*__first2.__seg_ & __m) != (*__first1.__seg_ & __m))
+                return false;
+            ++__first2.__seg_;
+            ++__first1.__seg_;
+            // __first1.__ctz_ = 0;
+            // __first2.__ctz_ = 0;
+        }
+        // __first1.__ctz_ == 0;
+        // __first2.__ctz_ == 0;
+        // do middle words
+        for (; __n >= __bits_per_word; __n -= __bits_per_word, ++__first1.__seg_, ++__first2.__seg_)
+            if (*__first2.__seg_ != *__first1.__seg_)
+                return false;
+        // do last word
+        if (__n > 0)
+        {
+            __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+            if ((*__first2.__seg_ & __m) != (*__first1.__seg_ & __m))
+                return false;
+        }
+    }
+    return true;
+}
+
+template <class _Cp, bool _IC1, bool _IC2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+equal(__bit_iterator<_Cp, _IC1> __first1, __bit_iterator<_Cp, _IC1> __last1, __bit_iterator<_Cp, _IC2> __first2)
+{
+    if (__first1.__ctz_ == __first2.__ctz_)
+        return _VSTD::__equal_aligned(__first1, __last1, __first2);
+    return _VSTD::__equal_unaligned(__first1, __last1, __first2);
+}
+
+template <class _Cp, bool _IsConst,
+          typename _Cp::__storage_type>
+class __bit_iterator
+{
+public:
+    typedef typename _Cp::difference_type                                                          difference_type;
+    typedef bool                                                                                  value_type;
+    typedef __bit_iterator                                                                        pointer;
+#ifndef _LIBCPP_ABI_BITSET_VECTOR_BOOL_CONST_SUBSCRIPT_RETURN_BOOL
+    typedef __conditional_t<_IsConst, __bit_const_reference<_Cp>, __bit_reference<_Cp> > reference;
+#else
+    using reference = __conditional_t<_IsConst, bool, __bit_reference<_Cp> >;
+#endif
+    typedef random_access_iterator_tag                                                            iterator_category;
+
+private:
+    typedef typename _Cp::__storage_type                                           __storage_type;
+    typedef __conditional_t<_IsConst, typename _Cp::__const_storage_pointer, typename _Cp::__storage_pointer>
+        __storage_pointer;
+    static const unsigned __bits_per_word = _Cp::__bits_per_word;
+
+    __storage_pointer __seg_;
+    unsigned          __ctz_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator() _NOEXCEPT
+#if _LIBCPP_STD_VER > 11
+    : __seg_(nullptr), __ctz_(0)
+#endif
+    {}
+
+    // When _IsConst=false, this is the copy constructor.
+    // It is non-trivial. Making it trivial would break ABI.
+    // When _IsConst=true, this is a converting constructor;
+    // the copy and move constructors are implicitly generated
+    // and trivial.
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __bit_iterator(const __bit_iterator<_Cp, false>& __it) _NOEXCEPT
+        : __seg_(__it.__seg_), __ctz_(__it.__ctz_) {}
+
+    // When _IsConst=false, we have a user-provided copy constructor,
+    // so we must also provide a copy assignment operator because
+    // the implicit generation of a defaulted one is deprecated.
+    // When _IsConst=true, the assignment operators are
+    // implicitly generated and trivial.
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __bit_iterator& operator=(const _If<_IsConst, struct __private_nat, __bit_iterator>& __it) {
+        __seg_ = __it.__seg_;
+        __ctz_ = __it.__ctz_;
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 reference operator*() const _NOEXCEPT {
+        return __conditional_t<_IsConst, __bit_const_reference<_Cp>, __bit_reference<_Cp> >(
+            __seg_, __storage_type(1) << __ctz_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator& operator++()
+    {
+        if (__ctz_ != __bits_per_word-1)
+            ++__ctz_;
+        else
+        {
+            __ctz_ = 0;
+            ++__seg_;
+        }
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator operator++(int)
+    {
+        __bit_iterator __tmp = *this;
+        ++(*this);
+        return __tmp;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator& operator--()
+    {
+        if (__ctz_ != 0)
+            --__ctz_;
+        else
+        {
+            __ctz_ = __bits_per_word - 1;
+            --__seg_;
+        }
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator operator--(int)
+    {
+        __bit_iterator __tmp = *this;
+        --(*this);
+        return __tmp;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator& operator+=(difference_type __n)
+    {
+        if (__n >= 0)
+            __seg_ += (__n + __ctz_) / __bits_per_word;
+        else
+            __seg_ += static_cast<difference_type>(__n - __bits_per_word + __ctz_ + 1)
+                    / static_cast<difference_type>(__bits_per_word);
+        __n &= (__bits_per_word - 1);
+        __ctz_ = static_cast<unsigned>((__n + __ctz_)  % __bits_per_word);
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator& operator-=(difference_type __n)
+    {
+        return *this += -__n;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator operator+(difference_type __n) const
+    {
+        __bit_iterator __t(*this);
+        __t += __n;
+        return __t;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator operator-(difference_type __n) const
+    {
+        __bit_iterator __t(*this);
+        __t -= __n;
+        return __t;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend __bit_iterator operator+(difference_type __n, const __bit_iterator& __it) {return __it + __n;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend difference_type operator-(const __bit_iterator& __x, const __bit_iterator& __y)
+        {return (__x.__seg_ - __y.__seg_) * __bits_per_word + __x.__ctz_ - __y.__ctz_;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 reference operator[](difference_type __n) const {return *(*this + __n);}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 friend bool operator==(const __bit_iterator& __x, const __bit_iterator& __y)
+        {return __x.__seg_ == __y.__seg_ && __x.__ctz_ == __y.__ctz_;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 friend bool operator!=(const __bit_iterator& __x, const __bit_iterator& __y)
+        {return !(__x == __y);}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 friend bool operator<(const __bit_iterator& __x, const __bit_iterator& __y)
+        {return __x.__seg_ < __y.__seg_ || (__x.__seg_ == __y.__seg_ && __x.__ctz_ < __y.__ctz_);}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 friend bool operator>(const __bit_iterator& __x, const __bit_iterator& __y)
+        {return __y < __x;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 friend bool operator<=(const __bit_iterator& __x, const __bit_iterator& __y)
+        {return !(__y < __x);}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 friend bool operator>=(const __bit_iterator& __x, const __bit_iterator& __y)
+        {return !(__x < __y);}
+
+private:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    explicit __bit_iterator(__storage_pointer __s, unsigned __ctz) _NOEXCEPT
+        : __seg_(__s), __ctz_(__ctz) {}
+
+    friend typename _Cp::__self;
+
+    friend class __bit_reference<_Cp>;
+    friend class __bit_const_reference<_Cp>;
+    friend class __bit_iterator<_Cp, true>;
+    template <class _Dp> friend struct __bit_array;
+    template <class _Dp>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend void __fill_n_false(__bit_iterator<_Dp, false> __first, typename _Dp::size_type __n);
+
+    template <class _Dp>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend void __fill_n_true(__bit_iterator<_Dp, false> __first, typename _Dp::size_type __n);
+
+    template <class _Dp, bool _IC>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend __bit_iterator<_Dp, false> __copy_aligned(__bit_iterator<_Dp, _IC> __first,
+                                                     __bit_iterator<_Dp, _IC> __last,
+                                                     __bit_iterator<_Dp, false> __result);
+    template <class _Dp, bool _IC>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend __bit_iterator<_Dp, false> __copy_unaligned(__bit_iterator<_Dp, _IC> __first,
+                                                       __bit_iterator<_Dp, _IC> __last,
+                                                       __bit_iterator<_Dp, false> __result);
+    template <class _Dp, bool _IC>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend __bit_iterator<_Dp, false> copy(__bit_iterator<_Dp, _IC> __first,
+                                           __bit_iterator<_Dp, _IC> __last,
+                                           __bit_iterator<_Dp, false> __result);
+    template <class _Dp, bool _IC>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend __bit_iterator<_Dp, false> __copy_backward_aligned(__bit_iterator<_Dp, _IC> __first,
+                                                              __bit_iterator<_Dp, _IC> __last,
+                                                              __bit_iterator<_Dp, false> __result);
+    template <class _Dp, bool _IC>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend __bit_iterator<_Dp, false> __copy_backward_unaligned(__bit_iterator<_Dp, _IC> __first,
+                                                                __bit_iterator<_Dp, _IC> __last,
+                                                                __bit_iterator<_Dp, false> __result);
+    template <class _Dp, bool _IC>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend __bit_iterator<_Dp, false> copy_backward(__bit_iterator<_Dp, _IC> __first,
+                                                    __bit_iterator<_Dp, _IC> __last,
+                                                    __bit_iterator<_Dp, false> __result);
+    template <class __C1, class __C2>friend __bit_iterator<__C2, false> __swap_ranges_aligned(__bit_iterator<__C1, false>,
+                                                                                           __bit_iterator<__C1, false>,
+                                                                                           __bit_iterator<__C2, false>);
+    template <class __C1, class __C2>friend __bit_iterator<__C2, false> __swap_ranges_unaligned(__bit_iterator<__C1, false>,
+                                                                                             __bit_iterator<__C1, false>,
+                                                                                             __bit_iterator<__C2, false>);
+    template <class __C1, class __C2>friend __bit_iterator<__C2, false> swap_ranges(__bit_iterator<__C1, false>,
+                                                                                 __bit_iterator<__C1, false>,
+                                                                                 __bit_iterator<__C2, false>);
+    template <class _Dp>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend __bit_iterator<_Dp, false> rotate(__bit_iterator<_Dp, false>,
+                                             __bit_iterator<_Dp, false>,
+                                             __bit_iterator<_Dp, false>);
+    template <class _Dp, bool _IC1, bool _IC2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend bool __equal_aligned(__bit_iterator<_Dp, _IC1>,
+                                __bit_iterator<_Dp, _IC1>,
+                                __bit_iterator<_Dp, _IC2>);
+    template <class _Dp, bool _IC1, bool _IC2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend bool __equal_unaligned(__bit_iterator<_Dp, _IC1>,
+                                  __bit_iterator<_Dp, _IC1>,
+                                  __bit_iterator<_Dp, _IC2>);
+    template <class _Dp, bool _IC1, bool _IC2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend bool equal(__bit_iterator<_Dp, _IC1>,
+                      __bit_iterator<_Dp, _IC1>,
+                      __bit_iterator<_Dp, _IC2>);
+    template <class _Dp, bool _IC>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend __bit_iterator<_Dp, _IC> __find_bool_true(__bit_iterator<_Dp, _IC>, typename _Dp::size_type);
+    template <class _Dp, bool _IC>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    friend __bit_iterator<_Dp, _IC> __find_bool_false(__bit_iterator<_Dp, _IC>, typename _Dp::size_type);
+    template <class _Dp, bool _IC> friend typename __bit_iterator<_Dp, _IC>::difference_type
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+                   __count_bool_true(__bit_iterator<_Dp, _IC>, typename _Dp::size_type);
+    template <class _Dp, bool _IC> friend typename __bit_iterator<_Dp, _IC>::difference_type
+                   __count_bool_false(__bit_iterator<_Dp, _IC>, typename _Dp::size_type);
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___BIT_REFERENCE
diff --git a/app/src/main/cpp/libcxx/include/__bsd_locale_defaults.h b/app/src/main/cpp/libcxx/include/__bsd_locale_defaults.h
new file mode 100644
index 0000000..4d99048
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bsd_locale_defaults.h
@@ -0,0 +1,36 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+// The BSDs have lots of *_l functions.  We don't want to define those symbols
+// on other platforms though, for fear of conflicts with user code.  So here,
+// we will define the mapping from an internal macro to the real BSD symbol.
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BSD_LOCALE_DEFAULTS_H
+#define _LIBCPP___BSD_LOCALE_DEFAULTS_H
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#define __libcpp_mb_cur_max_l(loc)                          MB_CUR_MAX_L(loc)
+#define __libcpp_btowc_l(ch, loc)                           btowc_l(ch, loc)
+#define __libcpp_wctob_l(wch, loc)                          wctob_l(wch, loc)
+#define __libcpp_wcsnrtombs_l(dst, src, nwc, len, ps, loc)  wcsnrtombs_l(dst, src, nwc, len, ps, loc)
+#define __libcpp_wcrtomb_l(src, wc, ps, loc)                wcrtomb_l(src, wc, ps, loc)
+#define __libcpp_mbsnrtowcs_l(dst, src, nms, len, ps, loc)  mbsnrtowcs_l(dst, src, nms, len, ps, loc)
+#define __libcpp_mbrtowc_l(pwc, s, n, ps, l)                mbrtowc_l(pwc, s, n, ps, l)
+#define __libcpp_mbtowc_l(pwc, pmb, max, l)                 mbtowc_l(pwc, pmb, max, l)
+#define __libcpp_mbrlen_l(s, n, ps, l)                      mbrlen_l(s, n, ps, l)
+#define __libcpp_localeconv_l(l)                            localeconv_l(l)
+#define __libcpp_mbsrtowcs_l(dest, src, len, ps, l)         mbsrtowcs_l(dest, src, len, ps, l)
+#define __libcpp_snprintf_l(...)                            snprintf_l(__VA_ARGS__)
+#define __libcpp_asprintf_l(...)                            asprintf_l(__VA_ARGS__)
+#define __libcpp_sscanf_l(...)                              sscanf_l(__VA_ARGS__)
+
+#endif // _LIBCPP___BSD_LOCALE_DEFAULTS_H
diff --git a/app/src/main/cpp/libcxx/include/__bsd_locale_fallbacks.h b/app/src/main/cpp/libcxx/include/__bsd_locale_fallbacks.h
new file mode 100644
index 0000000..9abd7e7
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__bsd_locale_fallbacks.h
@@ -0,0 +1,142 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+// The BSDs have lots of *_l functions.  This file provides reimplementations
+// of those functions for non-BSD platforms.
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___BSD_LOCALE_FALLBACKS_H
+#define _LIBCPP___BSD_LOCALE_FALLBACKS_H
+
+#include <stdarg.h>
+#include <stdlib.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+inline _LIBCPP_INLINE_VISIBILITY
+decltype(MB_CUR_MAX) __libcpp_mb_cur_max_l(locale_t __l)
+{
+    __libcpp_locale_guard __current(__l);
+    return MB_CUR_MAX;
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+inline _LIBCPP_INLINE_VISIBILITY
+wint_t __libcpp_btowc_l(int __c, locale_t __l)
+{
+    __libcpp_locale_guard __current(__l);
+    return btowc(__c);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+int __libcpp_wctob_l(wint_t __c, locale_t __l)
+{
+    __libcpp_locale_guard __current(__l);
+    return wctob(__c);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+size_t __libcpp_wcsnrtombs_l(char *__dest, const wchar_t **__src, size_t __nwc,
+                         size_t __len, mbstate_t *__ps, locale_t __l)
+{
+    __libcpp_locale_guard __current(__l);
+    return wcsnrtombs(__dest, __src, __nwc, __len, __ps);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+size_t __libcpp_wcrtomb_l(char *__s, wchar_t __wc, mbstate_t *__ps, locale_t __l)
+{
+    __libcpp_locale_guard __current(__l);
+    return wcrtomb(__s, __wc, __ps);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+size_t __libcpp_mbsnrtowcs_l(wchar_t * __dest, const char **__src, size_t __nms,
+                      size_t __len, mbstate_t *__ps, locale_t __l)
+{
+    __libcpp_locale_guard __current(__l);
+    return mbsnrtowcs(__dest, __src, __nms, __len, __ps);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+size_t __libcpp_mbrtowc_l(wchar_t *__pwc, const char *__s, size_t __n,
+                   mbstate_t *__ps, locale_t __l)
+{
+    __libcpp_locale_guard __current(__l);
+    return mbrtowc(__pwc, __s, __n, __ps);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+int __libcpp_mbtowc_l(wchar_t *__pwc, const char *__pmb, size_t __max, locale_t __l)
+{
+    __libcpp_locale_guard __current(__l);
+    return mbtowc(__pwc, __pmb, __max);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+size_t __libcpp_mbrlen_l(const char *__s, size_t __n, mbstate_t *__ps, locale_t __l)
+{
+    __libcpp_locale_guard __current(__l);
+    return mbrlen(__s, __n, __ps);
+}
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+inline _LIBCPP_INLINE_VISIBILITY
+lconv *__libcpp_localeconv_l(locale_t __l)
+{
+    __libcpp_locale_guard __current(__l);
+    return localeconv();
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+inline _LIBCPP_INLINE_VISIBILITY
+size_t __libcpp_mbsrtowcs_l(wchar_t *__dest, const char **__src, size_t __len,
+                     mbstate_t *__ps, locale_t __l)
+{
+    __libcpp_locale_guard __current(__l);
+    return mbsrtowcs(__dest, __src, __len, __ps);
+}
+#endif
+
+inline _LIBCPP_ATTRIBUTE_FORMAT(__printf__, 4, 5)
+int __libcpp_snprintf_l(char *__s, size_t __n, locale_t __l, const char *__format, ...) {
+    va_list __va;
+    va_start(__va, __format);
+    __libcpp_locale_guard __current(__l);
+    int __res = vsnprintf(__s, __n, __format, __va);
+    va_end(__va);
+    return __res;
+}
+
+inline _LIBCPP_ATTRIBUTE_FORMAT(__printf__, 3, 4)
+int __libcpp_asprintf_l(char **__s, locale_t __l, const char *__format, ...) {
+    va_list __va;
+    va_start(__va, __format);
+    __libcpp_locale_guard __current(__l);
+    int __res = vasprintf(__s, __format, __va);
+    va_end(__va);
+    return __res;
+}
+
+inline _LIBCPP_ATTRIBUTE_FORMAT(__scanf__, 3, 4)
+int __libcpp_sscanf_l(const char *__s, locale_t __l, const char *__format, ...) {
+    va_list __va;
+    va_start(__va, __format);
+    __libcpp_locale_guard __current(__l);
+    int __res = vsscanf(__s, __format, __va);
+    va_end(__va);
+    return __res;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___BSD_LOCALE_FALLBACKS_H
diff --git a/app/src/main/cpp/libcxx/include/__charconv/chars_format.h b/app/src/main/cpp/libcxx/include/__charconv/chars_format.h
new file mode 100644
index 0000000..695bd87
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__charconv/chars_format.h
@@ -0,0 +1,77 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHARCONV_CHARS_FORMAT_H
+#define _LIBCPP___CHARCONV_CHARS_FORMAT_H
+
+#include <__config>
+#include <__utility/to_underlying.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+enum class _LIBCPP_ENUM_VIS chars_format
+{
+    scientific = 0x1,
+    fixed = 0x2,
+    hex = 0x4,
+    general = fixed | scientific
+};
+
+inline _LIBCPP_INLINE_VISIBILITY constexpr chars_format
+operator~(chars_format __x) {
+  return chars_format(~_VSTD::__to_underlying(__x));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY constexpr chars_format
+operator&(chars_format __x, chars_format __y) {
+  return chars_format(_VSTD::__to_underlying(__x) &
+                      _VSTD::__to_underlying(__y));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY constexpr chars_format
+operator|(chars_format __x, chars_format __y) {
+  return chars_format(_VSTD::__to_underlying(__x) |
+                      _VSTD::__to_underlying(__y));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY constexpr chars_format
+operator^(chars_format __x, chars_format __y) {
+  return chars_format(_VSTD::__to_underlying(__x) ^
+                      _VSTD::__to_underlying(__y));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14 chars_format&
+operator&=(chars_format& __x, chars_format __y) {
+  __x = __x & __y;
+  return __x;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14 chars_format&
+operator|=(chars_format& __x, chars_format __y) {
+  __x = __x | __y;
+  return __x;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14 chars_format&
+operator^=(chars_format& __x, chars_format __y) {
+  __x = __x ^ __y;
+  return __x;
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CHARCONV_CHARS_FORMAT_H
diff --git a/app/src/main/cpp/libcxx/include/__charconv/from_chars_result.h b/app/src/main/cpp/libcxx/include/__charconv/from_chars_result.h
new file mode 100644
index 0000000..05ffe14
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__charconv/from_chars_result.h
@@ -0,0 +1,37 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHARCONV_FROM_CHARS_RESULT_H
+#define _LIBCPP___CHARCONV_FROM_CHARS_RESULT_H
+
+#include <__config>
+#include <__errc>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+struct _LIBCPP_TYPE_VIS from_chars_result
+{
+    const char* ptr;
+    errc ec;
+#  if _LIBCPP_STD_VER > 17
+    _LIBCPP_HIDE_FROM_ABI friend bool operator==(const from_chars_result&, const from_chars_result&) = default;
+#  endif
+};
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CHARCONV_FROM_CHARS_RESULT_H
diff --git a/app/src/main/cpp/libcxx/include/__charconv/tables.h b/app/src/main/cpp/libcxx/include/__charconv/tables.h
new file mode 100644
index 0000000..9b82440
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__charconv/tables.h
@@ -0,0 +1,154 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHARCONV_TABLES
+#define _LIBCPP___CHARCONV_TABLES
+
+#include <__config>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+namespace __itoa {
+
+inline constexpr char __base_2_lut[64] = {
+    '0', '0', '0', '0', '0', '0', '0', '1', '0', '0', '1', '0', '0', '0', '1', '1', '0', '1', '0', '0', '0', '1',
+    '0', '1', '0', '1', '1', '0', '0', '1', '1', '1', '1', '0', '0', '0', '1', '0', '0', '1', '1', '0', '1', '0',
+    '1', '0', '1', '1', '1', '1', '0', '0', '1', '1', '0', '1', '1', '1', '1', '0', '1', '1', '1', '1'};
+
+inline constexpr char __base_8_lut[128] = {
+    '0', '0', '0', '1', '0', '2', '0', '3', '0', '4', '0', '5', '0', '6', '0', '7', '1', '0', '1', '1', '1', '2',
+    '1', '3', '1', '4', '1', '5', '1', '6', '1', '7', '2', '0', '2', '1', '2', '2', '2', '3', '2', '4', '2', '5',
+    '2', '6', '2', '7', '3', '0', '3', '1', '3', '2', '3', '3', '3', '4', '3', '5', '3', '6', '3', '7', '4', '0',
+    '4', '1', '4', '2', '4', '3', '4', '4', '4', '5', '4', '6', '4', '7', '5', '0', '5', '1', '5', '2', '5', '3',
+    '5', '4', '5', '5', '5', '6', '5', '7', '6', '0', '6', '1', '6', '2', '6', '3', '6', '4', '6', '5', '6', '6',
+    '6', '7', '7', '0', '7', '1', '7', '2', '7', '3', '7', '4', '7', '5', '7', '6', '7', '7'};
+
+inline constexpr char __base_16_lut[512] = {
+    '0', '0', '0', '1', '0', '2', '0', '3', '0', '4', '0', '5', '0', '6', '0', '7', '0', '8', '0', '9', '0', 'a', '0',
+    'b', '0', 'c', '0', 'd', '0', 'e', '0', 'f', '1', '0', '1', '1', '1', '2', '1', '3', '1', '4', '1', '5', '1', '6',
+    '1', '7', '1', '8', '1', '9', '1', 'a', '1', 'b', '1', 'c', '1', 'd', '1', 'e', '1', 'f', '2', '0', '2', '1', '2',
+    '2', '2', '3', '2', '4', '2', '5', '2', '6', '2', '7', '2', '8', '2', '9', '2', 'a', '2', 'b', '2', 'c', '2', 'd',
+    '2', 'e', '2', 'f', '3', '0', '3', '1', '3', '2', '3', '3', '3', '4', '3', '5', '3', '6', '3', '7', '3', '8', '3',
+    '9', '3', 'a', '3', 'b', '3', 'c', '3', 'd', '3', 'e', '3', 'f', '4', '0', '4', '1', '4', '2', '4', '3', '4', '4',
+    '4', '5', '4', '6', '4', '7', '4', '8', '4', '9', '4', 'a', '4', 'b', '4', 'c', '4', 'd', '4', 'e', '4', 'f', '5',
+    '0', '5', '1', '5', '2', '5', '3', '5', '4', '5', '5', '5', '6', '5', '7', '5', '8', '5', '9', '5', 'a', '5', 'b',
+    '5', 'c', '5', 'd', '5', 'e', '5', 'f', '6', '0', '6', '1', '6', '2', '6', '3', '6', '4', '6', '5', '6', '6', '6',
+    '7', '6', '8', '6', '9', '6', 'a', '6', 'b', '6', 'c', '6', 'd', '6', 'e', '6', 'f', '7', '0', '7', '1', '7', '2',
+    '7', '3', '7', '4', '7', '5', '7', '6', '7', '7', '7', '8', '7', '9', '7', 'a', '7', 'b', '7', 'c', '7', 'd', '7',
+    'e', '7', 'f', '8', '0', '8', '1', '8', '2', '8', '3', '8', '4', '8', '5', '8', '6', '8', '7', '8', '8', '8', '9',
+    '8', 'a', '8', 'b', '8', 'c', '8', 'd', '8', 'e', '8', 'f', '9', '0', '9', '1', '9', '2', '9', '3', '9', '4', '9',
+    '5', '9', '6', '9', '7', '9', '8', '9', '9', '9', 'a', '9', 'b', '9', 'c', '9', 'd', '9', 'e', '9', 'f', 'a', '0',
+    'a', '1', 'a', '2', 'a', '3', 'a', '4', 'a', '5', 'a', '6', 'a', '7', 'a', '8', 'a', '9', 'a', 'a', 'a', 'b', 'a',
+    'c', 'a', 'd', 'a', 'e', 'a', 'f', 'b', '0', 'b', '1', 'b', '2', 'b', '3', 'b', '4', 'b', '5', 'b', '6', 'b', '7',
+    'b', '8', 'b', '9', 'b', 'a', 'b', 'b', 'b', 'c', 'b', 'd', 'b', 'e', 'b', 'f', 'c', '0', 'c', '1', 'c', '2', 'c',
+    '3', 'c', '4', 'c', '5', 'c', '6', 'c', '7', 'c', '8', 'c', '9', 'c', 'a', 'c', 'b', 'c', 'c', 'c', 'd', 'c', 'e',
+    'c', 'f', 'd', '0', 'd', '1', 'd', '2', 'd', '3', 'd', '4', 'd', '5', 'd', '6', 'd', '7', 'd', '8', 'd', '9', 'd',
+    'a', 'd', 'b', 'd', 'c', 'd', 'd', 'd', 'e', 'd', 'f', 'e', '0', 'e', '1', 'e', '2', 'e', '3', 'e', '4', 'e', '5',
+    'e', '6', 'e', '7', 'e', '8', 'e', '9', 'e', 'a', 'e', 'b', 'e', 'c', 'e', 'd', 'e', 'e', 'e', 'f', 'f', '0', 'f',
+    '1', 'f', '2', 'f', '3', 'f', '4', 'f', '5', 'f', '6', 'f', '7', 'f', '8', 'f', '9', 'f', 'a', 'f', 'b', 'f', 'c',
+    'f', 'd', 'f', 'e', 'f', 'f'};
+
+inline constexpr uint32_t __pow10_32[10] = {
+    UINT32_C(0),      UINT32_C(10),      UINT32_C(100),      UINT32_C(1000),      UINT32_C(10000),
+    UINT32_C(100000), UINT32_C(1000000), UINT32_C(10000000), UINT32_C(100000000), UINT32_C(1000000000)};
+
+inline constexpr uint64_t __pow10_64[20] = {UINT64_C(0),
+                                               UINT64_C(10),
+                                               UINT64_C(100),
+                                               UINT64_C(1000),
+                                               UINT64_C(10000),
+                                               UINT64_C(100000),
+                                               UINT64_C(1000000),
+                                               UINT64_C(10000000),
+                                               UINT64_C(100000000),
+                                               UINT64_C(1000000000),
+                                               UINT64_C(10000000000),
+                                               UINT64_C(100000000000),
+                                               UINT64_C(1000000000000),
+                                               UINT64_C(10000000000000),
+                                               UINT64_C(100000000000000),
+                                               UINT64_C(1000000000000000),
+                                               UINT64_C(10000000000000000),
+                                               UINT64_C(100000000000000000),
+                                               UINT64_C(1000000000000000000),
+                                               UINT64_C(10000000000000000000)};
+
+#  ifndef _LIBCPP_HAS_NO_INT128
+inline constexpr int __pow10_128_offset = 0;
+inline constexpr __uint128_t __pow10_128[40] = {
+    UINT64_C(0),
+    UINT64_C(10),
+    UINT64_C(100),
+    UINT64_C(1000),
+    UINT64_C(10000),
+    UINT64_C(100000),
+    UINT64_C(1000000),
+    UINT64_C(10000000),
+    UINT64_C(100000000),
+    UINT64_C(1000000000),
+    UINT64_C(10000000000),
+    UINT64_C(100000000000),
+    UINT64_C(1000000000000),
+    UINT64_C(10000000000000),
+    UINT64_C(100000000000000),
+    UINT64_C(1000000000000000),
+    UINT64_C(10000000000000000),
+    UINT64_C(100000000000000000),
+    UINT64_C(1000000000000000000),
+    UINT64_C(10000000000000000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(10),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(100),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(1000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(10000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(100000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(1000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(10000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(100000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(1000000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(10000000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(100000000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(1000000000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(10000000000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(100000000000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(1000000000000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(10000000000000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(100000000000000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(1000000000000000000),
+    __uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(10000000000000000000),
+    (__uint128_t(UINT64_C(10000000000000000000)) * UINT64_C(10000000000000000000)) * 10};
+#  endif
+
+inline constexpr char __digits_base_10[200] = {
+    // clang-format off
+    '0', '0', '0', '1', '0', '2', '0', '3', '0', '4', '0', '5', '0', '6', '0', '7', '0', '8', '0', '9',
+    '1', '0', '1', '1', '1', '2', '1', '3', '1', '4', '1', '5', '1', '6', '1', '7', '1', '8', '1', '9',
+    '2', '0', '2', '1', '2', '2', '2', '3', '2', '4', '2', '5', '2', '6', '2', '7', '2', '8', '2', '9',
+    '3', '0', '3', '1', '3', '2', '3', '3', '3', '4', '3', '5', '3', '6', '3', '7', '3', '8', '3', '9',
+    '4', '0', '4', '1', '4', '2', '4', '3', '4', '4', '4', '5', '4', '6', '4', '7', '4', '8', '4', '9',
+    '5', '0', '5', '1', '5', '2', '5', '3', '5', '4', '5', '5', '5', '6', '5', '7', '5', '8', '5', '9',
+    '6', '0', '6', '1', '6', '2', '6', '3', '6', '4', '6', '5', '6', '6', '6', '7', '6', '8', '6', '9',
+    '7', '0', '7', '1', '7', '2', '7', '3', '7', '4', '7', '5', '7', '6', '7', '7', '7', '8', '7', '9',
+    '8', '0', '8', '1', '8', '2', '8', '3', '8', '4', '8', '5', '8', '6', '8', '7', '8', '8', '8', '9',
+    '9', '0', '9', '1', '9', '2', '9', '3', '9', '4', '9', '5', '9', '6', '9', '7', '9', '8', '9', '9'};
+// clang-format on
+
+} // namespace __itoa
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CHARCONV_TABLES
diff --git a/app/src/main/cpp/libcxx/include/__charconv/to_chars_base_10.h b/app/src/main/cpp/libcxx/include/__charconv/to_chars_base_10.h
new file mode 100644
index 0000000..fc7fb76
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__charconv/to_chars_base_10.h
@@ -0,0 +1,185 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHARCONV_TO_CHARS_BASE_10_H
+#define _LIBCPP___CHARCONV_TO_CHARS_BASE_10_H
+
+#include <__algorithm/copy_n.h>
+#include <__charconv/tables.h>
+#include <__config>
+#include <cstdint>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+namespace __itoa {
+
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append1(char* __first, uint32_t __value) noexcept {
+  *__first = '0' + static_cast<char>(__value);
+  return __first + 1;
+}
+
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append2(char* __first, uint32_t __value) noexcept {
+  return std::copy_n(&__digits_base_10[__value * 2], 2, __first);
+}
+
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append3(char* __first, uint32_t __value) noexcept {
+  return __itoa::__append2(__itoa::__append1(__first, __value / 100), __value % 100);
+}
+
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append4(char* __first, uint32_t __value) noexcept {
+  return __itoa::__append2(__itoa::__append2(__first, __value / 100), __value % 100);
+}
+
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append5(char* __first, uint32_t __value) noexcept {
+  return __itoa::__append4(__itoa::__append1(__first, __value / 10000), __value % 10000);
+}
+
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append6(char* __first, uint32_t __value) noexcept {
+  return __itoa::__append4(__itoa::__append2(__first, __value / 10000), __value % 10000);
+}
+
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append7(char* __first, uint32_t __value) noexcept {
+  return __itoa::__append6(__itoa::__append1(__first, __value / 1000000), __value % 1000000);
+}
+
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append8(char* __first, uint32_t __value) noexcept {
+  return __itoa::__append6(__itoa::__append2(__first, __value / 1000000), __value % 1000000);
+}
+
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append9(char* __first, uint32_t __value) noexcept {
+  return __itoa::__append8(__itoa::__append1(__first, __value / 100000000), __value % 100000000);
+}
+
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI char* __append10(char* __first, _Tp __value) noexcept {
+  return __itoa::__append8(__itoa::__append2(__first, static_cast<uint32_t>(__value / 100000000)),
+                           static_cast<uint32_t>(__value % 100000000));
+}
+
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __base_10_u32(char* __first, uint32_t __value) noexcept {
+  if (__value < 1000000) {
+    if (__value < 10000) {
+      if (__value < 100) {
+        // 0 <= __value < 100
+        if (__value < 10)
+          return __itoa::__append1(__first, __value);
+        return __itoa::__append2(__first, __value);
+      }
+      // 100 <= __value < 10'000
+      if (__value < 1000)
+        return __itoa::__append3(__first, __value);
+      return __itoa::__append4(__first, __value);
+    }
+
+    // 10'000 <= __value < 1'000'000
+    if (__value < 100000)
+      return __itoa::__append5(__first, __value);
+    return __itoa::__append6(__first, __value);
+  }
+
+  // __value => 1'000'000
+  if (__value < 100000000) {
+    // 1'000'000 <= __value < 100'000'000
+    if (__value < 10000000)
+      return __itoa::__append7(__first, __value);
+    return __itoa::__append8(__first, __value);
+  }
+
+  // 100'000'000 <= __value < max
+  if (__value < 1000000000)
+    return __itoa::__append9(__first, __value);
+  return __itoa::__append10(__first, __value);
+}
+
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __base_10_u64(char* __buffer, uint64_t __value) noexcept {
+  if (__value <= UINT32_MAX)
+    return __itoa::__base_10_u32(__buffer, static_cast<uint32_t>(__value));
+
+  // Numbers in the range UINT32_MAX <= val < 10'000'000'000 always contain 10
+  // digits and are outputted after this if statement.
+  if (__value >= 10000000000) {
+    // This function properly deterimines the first non-zero leading digit.
+    __buffer = __itoa::__base_10_u32(__buffer, static_cast<uint32_t>(__value / 10000000000));
+    __value %= 10000000000;
+  }
+  return __itoa::__append10(__buffer, __value);
+}
+
+#  ifndef _LIBCPP_HAS_NO_INT128
+/// \returns 10^\a exp
+///
+/// \pre \a exp [19, 39]
+///
+/// \note The lookup table contains a partial set of exponents limiting the
+/// range that can be used. However the range is sufficient for
+/// \ref __base_10_u128.
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline __uint128_t __pow_10(int __exp) noexcept {
+  _LIBCPP_ASSERT(__exp >= __pow10_128_offset, "Index out of bounds");
+  return __pow10_128[__exp - __pow10_128_offset];
+}
+
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __base_10_u128(char* __buffer, __uint128_t __value) noexcept {
+  _LIBCPP_ASSERT(
+      __value > numeric_limits<uint64_t>::max(), "The optimizations for this algorithm fail when this isn't true.");
+
+  // Unlike the 64 to 32 bit case the 128 bit case the "upper half" can't be
+  // stored in the "lower half". Instead we first need to handle the top most
+  // digits separately.
+  //
+  // Maximum unsigned values
+  // 64  bit                             18'446'744'073'709'551'615 (20 digits)
+  // 128 bit    340'282'366'920'938'463'463'374'607'431'768'211'455 (39 digits)
+  // step 1     ^                                                   ([0-1] digits)
+  // step 2      ^^^^^^^^^^^^^^^^^^^^^^^^^                          ([0-19] digits)
+  // step 3                               ^^^^^^^^^^^^^^^^^^^^^^^^^ (19 digits)
+  if (__value >= __itoa::__pow_10(38)) {
+    // step 1
+    __buffer = __itoa::__append1(__buffer, static_cast<uint32_t>(__value / __itoa::__pow_10(38)));
+    __value %= __itoa::__pow_10(38);
+
+    // step 2 always 19 digits.
+    // They are handled here since leading zeros need to be appended to the buffer,
+    __buffer = __itoa::__append9(__buffer, static_cast<uint32_t>(__value / __itoa::__pow_10(29)));
+    __value %= __itoa::__pow_10(29);
+    __buffer = __itoa::__append10(__buffer, static_cast<uint64_t>(__value / __itoa::__pow_10(19)));
+    __value %= __itoa::__pow_10(19);
+  }
+  else {
+    // step 2
+    // This version needs to determine the position of the leading non-zero digit.
+    __buffer = __base_10_u64(__buffer, static_cast<uint64_t>(__value / __itoa::__pow_10(19)));
+    __value %= __itoa::__pow_10(19);
+  }
+
+  // Step 3
+  __buffer = __itoa::__append9(__buffer, static_cast<uint32_t>(__value / 10000000000));
+  __buffer = __itoa::__append10(__buffer, static_cast<uint64_t>(__value % 10000000000));
+
+  return __buffer;
+}
+#  endif
+} // namespace __itoa
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___CHARCONV_TO_CHARS_BASE_10_H
diff --git a/app/src/main/cpp/libcxx/include/__charconv/to_chars_result.h b/app/src/main/cpp/libcxx/include/__charconv/to_chars_result.h
new file mode 100644
index 0000000..2eb4098
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__charconv/to_chars_result.h
@@ -0,0 +1,37 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHARCONV_TO_CHARS_RESULT_H
+#define _LIBCPP___CHARCONV_TO_CHARS_RESULT_H
+
+#include <__config>
+#include <__errc>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+struct _LIBCPP_TYPE_VIS to_chars_result
+{
+    char* ptr;
+    errc ec;
+#  if _LIBCPP_STD_VER > 17
+    _LIBCPP_HIDE_FROM_ABI friend bool operator==(const to_chars_result&, const to_chars_result&) = default;
+#  endif
+};
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CHARCONV_TO_CHARS_RESULT_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/calendar.h b/app/src/main/cpp/libcxx/include/__chrono/calendar.h
new file mode 100644
index 0000000..d3762a6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/calendar.h
@@ -0,0 +1,44 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_CALENDAR_H
+#define _LIBCPP___CHRONO_CALENDAR_H
+
+#include <__chrono/duration.h>
+#include <__chrono/time_point.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+struct local_t {};
+template<class Duration>
+using local_time  = time_point<local_t, Duration>;
+using local_seconds = local_time<seconds>;
+using local_days    = local_time<days>;
+
+struct last_spec { _LIBCPP_HIDE_FROM_ABI explicit last_spec() = default; };
+inline constexpr last_spec last{};
+
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___CHRONO_CALENDAR_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/convert_to_timespec.h b/app/src/main/cpp/libcxx/include/__chrono/convert_to_timespec.h
new file mode 100644
index 0000000..fab07f2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/convert_to_timespec.h
@@ -0,0 +1,56 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_CONVERT_TO_TIMESPEC_H
+#define _LIBCPP___CHRONO_CONVERT_TO_TIMESPEC_H
+
+#include <__chrono/duration.h>
+#include <__config>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Convert a nanoseconds duration to the given TimeSpec type, which must have
+// the same properties as std::timespec.
+template <class _TimeSpec>
+_LIBCPP_HIDE_FROM_ABI inline
+_TimeSpec __convert_to_timespec(const chrono::nanoseconds& __ns)
+{
+  using namespace chrono;
+  seconds __s = duration_cast<seconds>(__ns);
+  _TimeSpec __ts;
+  typedef decltype(__ts.tv_sec) __ts_sec;
+  const __ts_sec __ts_sec_max = numeric_limits<__ts_sec>::max();
+
+  if (__s.count() < __ts_sec_max)
+  {
+    __ts.tv_sec = static_cast<__ts_sec>(__s.count());
+    __ts.tv_nsec = static_cast<decltype(__ts.tv_nsec)>((__ns - __s).count());
+  }
+  else
+  {
+    __ts.tv_sec = __ts_sec_max;
+    __ts.tv_nsec = 999999999; // (10^9 - 1)
+  }
+
+  return __ts;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___CHRONO_CONVERT_TO_TIMESPEC_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/convert_to_tm.h b/app/src/main/cpp/libcxx/include/__chrono/convert_to_tm.h
new file mode 100644
index 0000000..36846b3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/convert_to_tm.h
@@ -0,0 +1,127 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_CONVERT_TO_TM_H
+#define _LIBCPP___CHRONO_CONVERT_TO_TM_H
+
+#include <__chrono/day.h>
+#include <__chrono/duration.h>
+#include <__chrono/hh_mm_ss.h>
+#include <__chrono/month.h>
+#include <__chrono/month_weekday.h>
+#include <__chrono/monthday.h>
+#include <__chrono/statically_widen.h>
+#include <__chrono/system_clock.h>
+#include <__chrono/time_point.h>
+#include <__chrono/weekday.h>
+#include <__chrono/year.h>
+#include <__chrono/year_month.h>
+#include <__chrono/year_month_day.h>
+#include <__chrono/year_month_weekday.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__memory/addressof.h>
+#include <cstdint>
+#include <ctime>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// Conerts a chrono date and weekday to a given _Tm type.
+//
+// This is an implementation detail for the function
+//   template <class _Tm, class _ChronoT>
+//   _Tm __convert_to_tm(const _ChronoT& __value)
+//
+// This manually converts the two values to the proper type. It is possible to
+// convert from sys_days to time_t and then to _Tm. But this leads to the Y2K
+// bug when time_t is a 32-bit signed integer. Chrono considers years beyond
+// the year 2038 valid, so instead do the transformation manually.
+template <class _Tm, class _Date>
+  requires(same_as<_Date, chrono::year_month_day> || same_as<_Date, chrono::year_month_day_last>)
+_LIBCPP_HIDE_FROM_ABI _Tm __convert_to_tm(const _Date& __date, chrono::weekday __weekday) {
+  _Tm __result = {};
+#  ifdef __GLIBC__
+  __result.tm_zone = "UTC";
+#  endif
+  __result.tm_year = static_cast<int>(__date.year()) - 1900;
+  __result.tm_mon  = static_cast<unsigned>(__date.month()) - 1;
+  __result.tm_mday = static_cast<unsigned>(__date.day());
+  __result.tm_wday = static_cast<unsigned>(__weekday.c_encoding());
+  __result.tm_yday =
+      (static_cast<chrono::sys_days>(__date) -
+       static_cast<chrono::sys_days>(chrono::year_month_day{__date.year(), chrono::January, chrono::day{1}}))
+          .count();
+
+  return __result;
+}
+
+// Convert a chrono (calendar) time point, or dururation to the given _Tm type,
+// which must have the same properties as std::tm.
+template <class _Tm, class _ChronoT>
+_LIBCPP_HIDE_FROM_ABI _Tm __convert_to_tm(const _ChronoT& __value) {
+  _Tm __result = {};
+#  ifdef __GLIBC__
+  __result.tm_zone = "UTC";
+#  endif
+
+  if constexpr (chrono::__is_duration<_ChronoT>::value) {
+    // [time.format]/6
+    //   ...  However, if a flag refers to a "time of day" (e.g. %H, %I, %p,
+    //   etc.), then a specialization of duration is interpreted as the time of
+    //   day elapsed since midnight.
+    uint64_t __sec = chrono::duration_cast<chrono::seconds>(__value).count();
+    __sec %= 24 * 3600;
+    __result.tm_hour = __sec / 3600;
+    __sec %= 3600;
+    __result.tm_min = __sec / 60;
+    __result.tm_sec = __sec % 60;
+  } else if constexpr (same_as<_ChronoT, chrono::day>)
+    __result.tm_mday = static_cast<unsigned>(__value);
+  else if constexpr (same_as<_ChronoT, chrono::month>)
+    __result.tm_mon = static_cast<unsigned>(__value) - 1;
+  else if constexpr (same_as<_ChronoT, chrono::year>)
+    __result.tm_year = static_cast<int>(__value) - 1900;
+  else if constexpr (same_as<_ChronoT, chrono::weekday>)
+    __result.tm_wday = __value.c_encoding();
+  else if constexpr (same_as<_ChronoT, chrono::weekday_indexed> || same_as<_ChronoT, chrono::weekday_last>)
+    __result.tm_wday = __value.weekday().c_encoding();
+  else if constexpr (same_as<_ChronoT, chrono::month_day>) {
+    __result.tm_mday = static_cast<unsigned>(__value.day());
+    __result.tm_mon  = static_cast<unsigned>(__value.month()) - 1;
+  } else if constexpr (same_as<_ChronoT, chrono::month_day_last>) {
+    __result.tm_mon = static_cast<unsigned>(__value.month()) - 1;
+  } else if constexpr (same_as<_ChronoT, chrono::month_weekday> || same_as<_ChronoT, chrono::month_weekday_last>) {
+    __result.tm_wday = __value.weekday_indexed().weekday().c_encoding();
+    __result.tm_mon  = static_cast<unsigned>(__value.month()) - 1;
+  } else if constexpr (same_as<_ChronoT, chrono::year_month>) {
+    __result.tm_year = static_cast<int>(__value.year()) - 1900;
+    __result.tm_mon  = static_cast<unsigned>(__value.month()) - 1;
+  } else if constexpr (same_as<_ChronoT, chrono::year_month_day> || same_as<_ChronoT, chrono::year_month_day_last>) {
+    return std::__convert_to_tm<_Tm>(
+        chrono::year_month_day{__value}, chrono::weekday{static_cast<chrono::sys_days>(__value)});
+  } else if constexpr (same_as<_ChronoT, chrono::year_month_weekday> ||
+                       same_as<_ChronoT, chrono::year_month_weekday_last>) {
+    return std::__convert_to_tm<_Tm>(chrono::year_month_day{static_cast<chrono::sys_days>(__value)}, __value.weekday());
+  } else
+    static_assert(sizeof(_ChronoT) == 0, "Add the missing type specialization");
+
+  return __result;
+}
+
+#endif //if _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CHRONO_CONVERT_TO_TM_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/day.h b/app/src/main/cpp/libcxx/include/__chrono/day.h
new file mode 100644
index 0000000..35ecfcf
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/day.h
@@ -0,0 +1,84 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_DAY_H
+#define _LIBCPP___CHRONO_DAY_H
+
+#include <__chrono/duration.h>
+#include <__config>
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+class day {
+private:
+    unsigned char __d_;
+public:
+    _LIBCPP_HIDE_FROM_ABI day() = default;
+    _LIBCPP_HIDE_FROM_ABI explicit inline constexpr day(unsigned __val) noexcept : __d_(static_cast<unsigned char>(__val)) {}
+    _LIBCPP_HIDE_FROM_ABI inline constexpr day& operator++()    noexcept { ++__d_; return *this; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr day  operator++(int) noexcept { day __tmp = *this; ++(*this); return __tmp; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr day& operator--()    noexcept { --__d_; return *this; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr day  operator--(int) noexcept { day __tmp = *this; --(*this); return __tmp; }
+    _LIBCPP_HIDE_FROM_ABI        constexpr day& operator+=(const days& __dd) noexcept;
+    _LIBCPP_HIDE_FROM_ABI        constexpr day& operator-=(const days& __dd) noexcept;
+    _LIBCPP_HIDE_FROM_ABI explicit inline constexpr operator unsigned() const noexcept { return __d_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr bool ok() const noexcept { return __d_ >= 1 && __d_ <= 31; }
+  };
+
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const day& __lhs, const day& __rhs) noexcept
+{ return static_cast<unsigned>(__lhs) == static_cast<unsigned>(__rhs); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr strong_ordering operator<=>(const day& __lhs, const day& __rhs) noexcept {
+  return static_cast<unsigned>(__lhs) <=> static_cast<unsigned>(__rhs);
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+day operator+ (const day& __lhs, const days& __rhs) noexcept
+{ return day(static_cast<unsigned>(__lhs) + __rhs.count()); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+day operator+ (const days& __lhs, const day& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+day operator- (const day& __lhs, const days& __rhs) noexcept
+{ return __lhs + -__rhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+days operator-(const day& __lhs, const day& __rhs) noexcept
+{ return days(static_cast<int>(static_cast<unsigned>(__lhs)) -
+              static_cast<int>(static_cast<unsigned>(__rhs))); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+day& day::operator+=(const days& __dd) noexcept
+{ *this = *this + __dd; return *this; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+day& day::operator-=(const days& __dd) noexcept
+{ *this = *this - __dd; return *this; }
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___CHRONO_DAY_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/duration.h b/app/src/main/cpp/libcxx/include/__chrono/duration.h
new file mode 100644
index 0000000..afcc38b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/duration.h
@@ -0,0 +1,622 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_DURATION_H
+#define _LIBCPP___CHRONO_DURATION_H
+
+#include <__config>
+#include <__type_traits/common_type.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_floating_point.h>
+#include <limits>
+#include <ratio>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+template <class _Rep, class _Period = ratio<1> > class _LIBCPP_TEMPLATE_VIS duration;
+
+template <class _Tp>
+struct __is_duration : false_type {};
+
+template <class _Rep, class _Period>
+struct __is_duration<duration<_Rep, _Period> > : true_type  {};
+
+template <class _Rep, class _Period>
+struct __is_duration<const duration<_Rep, _Period> > : true_type  {};
+
+template <class _Rep, class _Period>
+struct __is_duration<volatile duration<_Rep, _Period> > : true_type  {};
+
+template <class _Rep, class _Period>
+struct __is_duration<const volatile duration<_Rep, _Period> > : true_type  {};
+
+} // namespace chrono
+
+template <class _Rep1, class _Period1, class _Rep2, class _Period2>
+struct _LIBCPP_TEMPLATE_VIS common_type<chrono::duration<_Rep1, _Period1>,
+                                         chrono::duration<_Rep2, _Period2> >
+{
+    typedef chrono::duration<typename common_type<_Rep1, _Rep2>::type,
+                             typename __ratio_gcd<_Period1, _Period2>::type> type;
+};
+
+namespace chrono {
+
+// duration_cast
+
+template <class _FromDuration, class _ToDuration,
+          class _Period = typename ratio_divide<typename _FromDuration::period, typename _ToDuration::period>::type,
+          bool = _Period::num == 1,
+          bool = _Period::den == 1>
+struct __duration_cast;
+
+template <class _FromDuration, class _ToDuration, class _Period>
+struct __duration_cast<_FromDuration, _ToDuration, _Period, true, true>
+{
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    _ToDuration operator()(const _FromDuration& __fd) const
+    {
+        return _ToDuration(static_cast<typename _ToDuration::rep>(__fd.count()));
+    }
+};
+
+template <class _FromDuration, class _ToDuration, class _Period>
+struct __duration_cast<_FromDuration, _ToDuration, _Period, true, false>
+{
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    _ToDuration operator()(const _FromDuration& __fd) const
+    {
+        typedef typename common_type<typename _ToDuration::rep, typename _FromDuration::rep, intmax_t>::type _Ct;
+        return _ToDuration(static_cast<typename _ToDuration::rep>(
+                           static_cast<_Ct>(__fd.count()) / static_cast<_Ct>(_Period::den)));
+    }
+};
+
+template <class _FromDuration, class _ToDuration, class _Period>
+struct __duration_cast<_FromDuration, _ToDuration, _Period, false, true>
+{
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    _ToDuration operator()(const _FromDuration& __fd) const
+    {
+        typedef typename common_type<typename _ToDuration::rep, typename _FromDuration::rep, intmax_t>::type _Ct;
+        return _ToDuration(static_cast<typename _ToDuration::rep>(
+                           static_cast<_Ct>(__fd.count()) * static_cast<_Ct>(_Period::num)));
+    }
+};
+
+template <class _FromDuration, class _ToDuration, class _Period>
+struct __duration_cast<_FromDuration, _ToDuration, _Period, false, false>
+{
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    _ToDuration operator()(const _FromDuration& __fd) const
+    {
+        typedef typename common_type<typename _ToDuration::rep, typename _FromDuration::rep, intmax_t>::type _Ct;
+        return _ToDuration(static_cast<typename _ToDuration::rep>(
+                           static_cast<_Ct>(__fd.count()) * static_cast<_Ct>(_Period::num)
+                                                          / static_cast<_Ct>(_Period::den)));
+    }
+};
+
+template <class _ToDuration, class _Rep, class _Period>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+typename enable_if
+<
+    __is_duration<_ToDuration>::value,
+    _ToDuration
+>::type
+duration_cast(const duration<_Rep, _Period>& __fd)
+{
+    return __duration_cast<duration<_Rep, _Period>, _ToDuration>()(__fd);
+}
+
+template <class _Rep>
+struct _LIBCPP_TEMPLATE_VIS treat_as_floating_point : is_floating_point<_Rep> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Rep>
+inline constexpr bool treat_as_floating_point_v = treat_as_floating_point<_Rep>::value;
+#endif
+
+template <class _Rep>
+struct _LIBCPP_TEMPLATE_VIS duration_values
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR _Rep zero() _NOEXCEPT {return _Rep(0);}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR _Rep max()  _NOEXCEPT {return numeric_limits<_Rep>::max();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR _Rep min()  _NOEXCEPT {return numeric_limits<_Rep>::lowest();}
+};
+
+#if _LIBCPP_STD_VER > 14
+template <class _ToDuration, class _Rep, class _Period>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+typename enable_if
+<
+    __is_duration<_ToDuration>::value,
+    _ToDuration
+>::type
+floor(const duration<_Rep, _Period>& __d)
+{
+    _ToDuration __t = chrono::duration_cast<_ToDuration>(__d);
+    if (__t > __d)
+        __t = __t - _ToDuration{1};
+    return __t;
+}
+
+template <class _ToDuration, class _Rep, class _Period>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+typename enable_if
+<
+    __is_duration<_ToDuration>::value,
+    _ToDuration
+>::type
+ceil(const duration<_Rep, _Period>& __d)
+{
+    _ToDuration __t = chrono::duration_cast<_ToDuration>(__d);
+    if (__t < __d)
+        __t = __t + _ToDuration{1};
+    return __t;
+}
+
+template <class _ToDuration, class _Rep, class _Period>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+typename enable_if
+<
+    __is_duration<_ToDuration>::value,
+    _ToDuration
+>::type
+round(const duration<_Rep, _Period>& __d)
+{
+    _ToDuration __lower = chrono::floor<_ToDuration>(__d);
+    _ToDuration __upper = __lower + _ToDuration{1};
+    auto __lowerDiff = __d - __lower;
+    auto __upperDiff = __upper - __d;
+    if (__lowerDiff < __upperDiff)
+        return __lower;
+    if (__lowerDiff > __upperDiff)
+        return __upper;
+    return __lower.count() & 1 ? __upper : __lower;
+}
+#endif
+
+// duration
+
+template <class _Rep, class _Period>
+class _LIBCPP_TEMPLATE_VIS duration
+{
+    static_assert(!__is_duration<_Rep>::value, "A duration representation can not be a duration");
+    static_assert(__is_ratio<_Period>::value, "Second template parameter of duration must be a std::ratio");
+    static_assert(_Period::num > 0, "duration period must be positive");
+
+    template <class _R1, class _R2>
+    struct __no_overflow
+    {
+    private:
+        static const intmax_t __gcd_n1_n2 = __static_gcd<_R1::num, _R2::num>::value;
+        static const intmax_t __gcd_d1_d2 = __static_gcd<_R1::den, _R2::den>::value;
+        static const intmax_t __n1 = _R1::num / __gcd_n1_n2;
+        static const intmax_t __d1 = _R1::den / __gcd_d1_d2;
+        static const intmax_t __n2 = _R2::num / __gcd_n1_n2;
+        static const intmax_t __d2 = _R2::den / __gcd_d1_d2;
+        static const intmax_t max = -((intmax_t(1) << (sizeof(intmax_t) * CHAR_BIT - 1)) + 1);
+
+        template <intmax_t _Xp, intmax_t _Yp, bool __overflow>
+        struct __mul    // __overflow == false
+        {
+            static const intmax_t value = _Xp * _Yp;
+        };
+
+        template <intmax_t _Xp, intmax_t _Yp>
+        struct __mul<_Xp, _Yp, true>
+        {
+            static const intmax_t value = 1;
+        };
+
+    public:
+        static const bool value = (__n1 <= max / __d2) && (__n2 <= max / __d1);
+        typedef ratio<__mul<__n1, __d2, !value>::value,
+                      __mul<__n2, __d1, !value>::value> type;
+    };
+
+public:
+    typedef _Rep rep;
+    typedef typename _Period::type period;
+private:
+    rep __rep_;
+public:
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+#ifndef _LIBCPP_CXX03_LANG
+        duration() = default;
+#else
+        duration() {}
+#endif
+
+    template <class _Rep2>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+        explicit duration(const _Rep2& __r,
+            typename enable_if
+            <
+               is_convertible<const _Rep2&, rep>::value &&
+               (treat_as_floating_point<rep>::value ||
+               !treat_as_floating_point<_Rep2>::value)
+            >::type* = nullptr)
+                : __rep_(__r) {}
+
+    // conversions
+    template <class _Rep2, class _Period2>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+        duration(const duration<_Rep2, _Period2>& __d,
+            typename enable_if
+            <
+                __no_overflow<_Period2, period>::value && (
+                treat_as_floating_point<rep>::value ||
+                (__no_overflow<_Period2, period>::type::den == 1 &&
+                 !treat_as_floating_point<_Rep2>::value))
+            >::type* = nullptr)
+                : __rep_(chrono::duration_cast<duration>(__d).count()) {}
+
+    // observer
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR rep count() const {return __rep_;}
+
+    // arithmetic
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR typename common_type<duration>::type operator+() const {return typename common_type<duration>::type(*this);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR typename common_type<duration>::type operator-() const {return typename common_type<duration>::type(-__rep_);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 duration& operator++()      {++__rep_; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 duration  operator++(int)   {return duration(__rep_++);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 duration& operator--()      {--__rep_; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 duration  operator--(int)   {return duration(__rep_--);}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 duration& operator+=(const duration& __d) {__rep_ += __d.count(); return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 duration& operator-=(const duration& __d) {__rep_ -= __d.count(); return *this;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 duration& operator*=(const rep& __rhs) {__rep_ *= __rhs; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 duration& operator/=(const rep& __rhs) {__rep_ /= __rhs; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 duration& operator%=(const rep& __rhs) {__rep_ %= __rhs; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 duration& operator%=(const duration& __rhs) {__rep_ %= __rhs.count(); return *this;}
+
+    // special values
+
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR duration zero() _NOEXCEPT {return duration(duration_values<rep>::zero());}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR duration min()  _NOEXCEPT {return duration(duration_values<rep>::min());}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR duration max()  _NOEXCEPT {return duration(duration_values<rep>::max());}
+};
+
+typedef duration<long long,         nano> nanoseconds;
+typedef duration<long long,        micro> microseconds;
+typedef duration<long long,        milli> milliseconds;
+typedef duration<long long              > seconds;
+typedef duration<     long, ratio<  60> > minutes;
+typedef duration<     long, ratio<3600> > hours;
+#if _LIBCPP_STD_VER > 17
+typedef duration<     int, ratio_multiply<ratio<24>, hours::period>>         days;
+typedef duration<     int, ratio_multiply<ratio<7>,   days::period>>         weeks;
+typedef duration<     int, ratio_multiply<ratio<146097, 400>, days::period>> years;
+typedef duration<     int, ratio_divide<years::period, ratio<12>>>           months;
+#endif
+// Duration ==
+
+template <class _LhsDuration, class _RhsDuration>
+struct __duration_eq
+{
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    bool operator()(const _LhsDuration& __lhs, const _RhsDuration& __rhs) const
+        {
+            typedef typename common_type<_LhsDuration, _RhsDuration>::type _Ct;
+            return _Ct(__lhs).count() == _Ct(__rhs).count();
+        }
+};
+
+template <class _LhsDuration>
+struct __duration_eq<_LhsDuration, _LhsDuration>
+{
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    bool operator()(const _LhsDuration& __lhs, const _LhsDuration& __rhs) const
+        {return __lhs.count() == __rhs.count();}
+};
+
+template <class _Rep1, class _Period1, class _Rep2, class _Period2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+bool
+operator==(const duration<_Rep1, _Period1>& __lhs, const duration<_Rep2, _Period2>& __rhs)
+{
+    return __duration_eq<duration<_Rep1, _Period1>, duration<_Rep2, _Period2> >()(__lhs, __rhs);
+}
+
+// Duration !=
+
+template <class _Rep1, class _Period1, class _Rep2, class _Period2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+bool
+operator!=(const duration<_Rep1, _Period1>& __lhs, const duration<_Rep2, _Period2>& __rhs)
+{
+    return !(__lhs == __rhs);
+}
+
+// Duration <
+
+template <class _LhsDuration, class _RhsDuration>
+struct __duration_lt
+{
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    bool operator()(const _LhsDuration& __lhs, const _RhsDuration& __rhs) const
+        {
+            typedef typename common_type<_LhsDuration, _RhsDuration>::type _Ct;
+            return _Ct(__lhs).count() < _Ct(__rhs).count();
+        }
+};
+
+template <class _LhsDuration>
+struct __duration_lt<_LhsDuration, _LhsDuration>
+{
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    bool operator()(const _LhsDuration& __lhs, const _LhsDuration& __rhs) const
+        {return __lhs.count() < __rhs.count();}
+};
+
+template <class _Rep1, class _Period1, class _Rep2, class _Period2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+bool
+operator< (const duration<_Rep1, _Period1>& __lhs, const duration<_Rep2, _Period2>& __rhs)
+{
+    return __duration_lt<duration<_Rep1, _Period1>, duration<_Rep2, _Period2> >()(__lhs, __rhs);
+}
+
+// Duration >
+
+template <class _Rep1, class _Period1, class _Rep2, class _Period2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+bool
+operator> (const duration<_Rep1, _Period1>& __lhs, const duration<_Rep2, _Period2>& __rhs)
+{
+    return __rhs < __lhs;
+}
+
+// Duration <=
+
+template <class _Rep1, class _Period1, class _Rep2, class _Period2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+bool
+operator<=(const duration<_Rep1, _Period1>& __lhs, const duration<_Rep2, _Period2>& __rhs)
+{
+    return !(__rhs < __lhs);
+}
+
+// Duration >=
+
+template <class _Rep1, class _Period1, class _Rep2, class _Period2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+bool
+operator>=(const duration<_Rep1, _Period1>& __lhs, const duration<_Rep2, _Period2>& __rhs)
+{
+    return !(__lhs < __rhs);
+}
+
+// Duration +
+
+template <class _Rep1, class _Period1, class _Rep2, class _Period2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+typename common_type<duration<_Rep1, _Period1>, duration<_Rep2, _Period2> >::type
+operator+(const duration<_Rep1, _Period1>& __lhs, const duration<_Rep2, _Period2>& __rhs)
+{
+    typedef typename common_type<duration<_Rep1, _Period1>, duration<_Rep2, _Period2> >::type _Cd;
+    return _Cd(_Cd(__lhs).count() + _Cd(__rhs).count());
+}
+
+// Duration -
+
+template <class _Rep1, class _Period1, class _Rep2, class _Period2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+typename common_type<duration<_Rep1, _Period1>, duration<_Rep2, _Period2> >::type
+operator-(const duration<_Rep1, _Period1>& __lhs, const duration<_Rep2, _Period2>& __rhs)
+{
+    typedef typename common_type<duration<_Rep1, _Period1>, duration<_Rep2, _Period2> >::type _Cd;
+    return _Cd(_Cd(__lhs).count() - _Cd(__rhs).count());
+}
+
+// Duration *
+
+template <class _Rep1, class _Period, class _Rep2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+typename enable_if
+<
+    is_convertible<_Rep2, typename common_type<_Rep1, _Rep2>::type>::value,
+    duration<typename common_type<_Rep1, _Rep2>::type, _Period>
+>::type
+operator*(const duration<_Rep1, _Period>& __d, const _Rep2& __s)
+{
+    typedef typename common_type<_Rep1, _Rep2>::type _Cr;
+    typedef duration<_Cr, _Period> _Cd;
+    return _Cd(_Cd(__d).count() * static_cast<_Cr>(__s));
+}
+
+template <class _Rep1, class _Period, class _Rep2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+typename enable_if
+<
+    is_convertible<_Rep1, typename common_type<_Rep1, _Rep2>::type>::value,
+    duration<typename common_type<_Rep1, _Rep2>::type, _Period>
+>::type
+operator*(const _Rep1& __s, const duration<_Rep2, _Period>& __d)
+{
+    return __d * __s;
+}
+
+// Duration /
+
+template <class _Rep1, class _Period, class _Rep2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+typename enable_if
+<
+    !__is_duration<_Rep2>::value &&
+      is_convertible<_Rep2, typename common_type<_Rep1, _Rep2>::type>::value,
+    duration<typename common_type<_Rep1, _Rep2>::type, _Period>
+>::type
+operator/(const duration<_Rep1, _Period>& __d, const _Rep2& __s)
+{
+    typedef typename common_type<_Rep1, _Rep2>::type _Cr;
+    typedef duration<_Cr, _Period> _Cd;
+    return _Cd(_Cd(__d).count() / static_cast<_Cr>(__s));
+}
+
+template <class _Rep1, class _Period1, class _Rep2, class _Period2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+typename common_type<_Rep1, _Rep2>::type
+operator/(const duration<_Rep1, _Period1>& __lhs, const duration<_Rep2, _Period2>& __rhs)
+{
+    typedef typename common_type<duration<_Rep1, _Period1>, duration<_Rep2, _Period2> >::type _Ct;
+    return _Ct(__lhs).count() / _Ct(__rhs).count();
+}
+
+// Duration %
+
+template <class _Rep1, class _Period, class _Rep2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+typename enable_if
+<
+    !__is_duration<_Rep2>::value &&
+      is_convertible<_Rep2, typename common_type<_Rep1, _Rep2>::type>::value,
+    duration<typename common_type<_Rep1, _Rep2>::type, _Period>
+>::type
+operator%(const duration<_Rep1, _Period>& __d, const _Rep2& __s)
+{
+    typedef typename common_type<_Rep1, _Rep2>::type _Cr;
+    typedef duration<_Cr, _Period> _Cd;
+    return _Cd(_Cd(__d).count() % static_cast<_Cr>(__s));
+}
+
+template <class _Rep1, class _Period1, class _Rep2, class _Period2>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+typename common_type<duration<_Rep1, _Period1>, duration<_Rep2, _Period2> >::type
+operator%(const duration<_Rep1, _Period1>& __lhs, const duration<_Rep2, _Period2>& __rhs)
+{
+    typedef typename common_type<_Rep1, _Rep2>::type _Cr;
+    typedef typename common_type<duration<_Rep1, _Period1>, duration<_Rep2, _Period2> >::type _Cd;
+    return _Cd(static_cast<_Cr>(_Cd(__lhs).count()) % static_cast<_Cr>(_Cd(__rhs).count()));
+}
+
+} // namespace chrono
+
+#if _LIBCPP_STD_VER > 11
+// Suffixes for duration literals [time.duration.literals]
+inline namespace literals
+{
+  inline namespace chrono_literals
+  {
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::hours operator""h(unsigned long long __h)
+    {
+        return chrono::hours(static_cast<chrono::hours::rep>(__h));
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::duration<long double, ratio<3600,1>> operator""h(long double __h)
+    {
+        return chrono::duration<long double, ratio<3600,1>>(__h);
+    }
+
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::minutes operator""min(unsigned long long __m)
+    {
+        return chrono::minutes(static_cast<chrono::minutes::rep>(__m));
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::duration<long double, ratio<60,1>> operator""min(long double __m)
+    {
+        return chrono::duration<long double, ratio<60,1>> (__m);
+    }
+
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::seconds operator""s(unsigned long long __s)
+    {
+        return chrono::seconds(static_cast<chrono::seconds::rep>(__s));
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::duration<long double> operator""s(long double __s)
+    {
+        return chrono::duration<long double> (__s);
+    }
+
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::milliseconds operator""ms(unsigned long long __ms)
+    {
+        return chrono::milliseconds(static_cast<chrono::milliseconds::rep>(__ms));
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::duration<long double, milli> operator""ms(long double __ms)
+    {
+        return chrono::duration<long double, milli>(__ms);
+    }
+
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::microseconds operator""us(unsigned long long __us)
+    {
+        return chrono::microseconds(static_cast<chrono::microseconds::rep>(__us));
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::duration<long double, micro> operator""us(long double __us)
+    {
+        return chrono::duration<long double, micro> (__us);
+    }
+
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::nanoseconds operator""ns(unsigned long long __ns)
+    {
+        return chrono::nanoseconds(static_cast<chrono::nanoseconds::rep>(__ns));
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::duration<long double, nano> operator""ns(long double __ns)
+    {
+        return chrono::duration<long double, nano> (__ns);
+    }
+
+} // namespace chrono_literals
+} // namespace literals
+
+namespace chrono { // hoist the literals into namespace std::chrono
+   using namespace literals::chrono_literals;
+} // namespace chrono
+
+#endif // _LIBCPP_STD_VER > 11
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP___CHRONO_DURATION_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/file_clock.h b/app/src/main/cpp/libcxx/include/__chrono/file_clock.h
new file mode 100644
index 0000000..ef62b83
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/file_clock.h
@@ -0,0 +1,85 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_FILE_CLOCK_H
+#define _LIBCPP___CHRONO_FILE_CLOCK_H
+
+#include <__availability>
+#include <__chrono/duration.h>
+#include <__chrono/system_clock.h>
+#include <__chrono/time_point.h>
+#include <__config>
+#include <ratio>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+struct _FilesystemClock;
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+#endif // !_LIBCPP_CXX03_LANG
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+// [time.clock.file], type file_clock
+using file_clock = _VSTD_FS::_FilesystemClock;
+
+template<class _Duration>
+using file_time = time_point<file_clock, _Duration>;
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#ifndef _LIBCPP_CXX03_LANG
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+struct _FilesystemClock {
+#if !defined(_LIBCPP_HAS_NO_INT128)
+  typedef __int128_t rep;
+  typedef nano period;
+#else
+  typedef long long rep;
+  typedef nano period;
+#endif
+
+  typedef chrono::duration<rep, period> duration;
+  typedef chrono::time_point<_FilesystemClock> time_point;
+
+  _LIBCPP_EXPORTED_FROM_ABI
+  static _LIBCPP_CONSTEXPR_SINCE_CXX14 const bool is_steady = false;
+
+  _LIBCPP_AVAILABILITY_FILESYSTEM _LIBCPP_FUNC_VIS static time_point now() noexcept;
+
+#if _LIBCPP_STD_VER > 17
+  template <class _Duration>
+  _LIBCPP_HIDE_FROM_ABI
+  static chrono::sys_time<_Duration> to_sys(const chrono::file_time<_Duration>& __t) {
+    return chrono::sys_time<_Duration>(__t.time_since_epoch());
+  }
+
+  template <class _Duration>
+  _LIBCPP_HIDE_FROM_ABI
+  static chrono::file_time<_Duration> from_sys(const chrono::sys_time<_Duration>& __t) {
+    return chrono::file_time<_Duration>(__t.time_since_epoch());
+  }
+#endif // _LIBCPP_STD_VER > 17
+};
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+#endif // !_LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___CHRONO_FILE_CLOCK_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/formatter.h b/app/src/main/cpp/libcxx/include/__chrono/formatter.h
new file mode 100644
index 0000000..2015783
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/formatter.h
@@ -0,0 +1,716 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_FORMATTER_H
+#define _LIBCPP___CHRONO_FORMATTER_H
+
+#include <__chrono/calendar.h>
+#include <__chrono/convert_to_tm.h>
+#include <__chrono/day.h>
+#include <__chrono/duration.h>
+#include <__chrono/hh_mm_ss.h>
+#include <__chrono/month.h>
+#include <__chrono/month_weekday.h>
+#include <__chrono/monthday.h>
+#include <__chrono/ostream.h>
+#include <__chrono/parser_std_format_spec.h>
+#include <__chrono/statically_widen.h>
+#include <__chrono/time_point.h>
+#include <__chrono/weekday.h>
+#include <__chrono/year.h>
+#include <__chrono/year_month.h>
+#include <__chrono/year_month_day.h>
+#include <__chrono/year_month_weekday.h>
+#include <__concepts/arithmetic.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/format_error.h>
+#include <__format/format_functions.h>
+#include <__format/format_parse_context.h>
+#include <__format/formatter.h>
+#include <__format/formatter_output.h>
+#include <__format/parser_std_format_spec.h>
+#include <__memory/addressof.h>
+#include <cmath>
+#include <ctime>
+#include <sstream>
+#include <string>
+#include <string_view>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_FORMAT)
+
+namespace __formatter {
+
+/// Formats a time based on a tm struct.
+///
+/// This formatter passes the formatting to time_put which uses strftime. When
+/// the value is outside the valid range it's unspecified what strftime will
+/// output. For example weekday 8 can print 1 when the day is processed modulo
+/// 7 since that handles the Sunday for 0-based weekday. It can also print 8 if
+/// 7 is handled as a special case.
+///
+/// The Standard doesn't specify what to do in this case so the result depends
+/// on the result of the underlying code.
+///
+/// \pre When the (abbreviated) weekday or month name are used, the caller
+///      validates whether the value is valid. So the caller handles that
+///      requirement of Table 97: Meaning of conversion specifiers
+///      [tab:time.format.spec].
+///
+/// When no chrono-specs are provided it uses the stream formatter.
+
+// For tiny ratios it's not possible to convert a duration to a hh_mm_ss. This
+// fails compile-time due to the limited precision of the ratio (64-bit is too
+// small). Therefore a duration uses its own conversion.
+template <class _CharT, class _Tp>
+  requires(chrono::__is_duration<_Tp>::value)
+_LIBCPP_HIDE_FROM_ABI void __format_sub_seconds(const _Tp& __value, basic_stringstream<_CharT>& __sstr) {
+  __sstr << std::use_facet<numpunct<_CharT>>(__sstr.getloc()).decimal_point();
+
+  auto __fraction = __value - chrono::duration_cast<chrono::seconds>(__value);
+  if constexpr (chrono::treat_as_floating_point_v<typename _Tp::rep>)
+    // When the floating-point value has digits itself they are ignored based
+    // on the wording in [tab:time.format.spec]
+    //   If the precision of the input cannot be exactly represented with
+    //   seconds, then the format is a decimal floating-point number with a
+    //   fixed format and a precision matching that of the precision of the
+    //   input (or to a microseconds precision if the conversion to
+    //   floating-point decimal seconds cannot be made within 18 fractional
+    //   digits).
+    //
+    // This matches the behaviour of MSVC STL, fmtlib interprets this
+    // differently and uses 3 decimals.
+    // https://godbolt.org/z/6dsbnW8ba
+    std::format_to(std::ostreambuf_iterator<_CharT>{__sstr},
+                   _LIBCPP_STATICALLY_WIDEN(_CharT, "{:0{}.0f}"),
+                   __fraction.count(),
+                   chrono::hh_mm_ss<_Tp>::fractional_width);
+  else
+    std::format_to(std::ostreambuf_iterator<_CharT>{__sstr},
+                   _LIBCPP_STATICALLY_WIDEN(_CharT, "{:0{}}"),
+                   __fraction.count(),
+                   chrono::hh_mm_ss<_Tp>::fractional_width);
+}
+
+template <class _Tp>
+consteval bool __use_fraction() {
+  if constexpr (chrono::__is_duration<_Tp>::value)
+    return chrono::hh_mm_ss<_Tp>::fractional_width;
+  else
+    return false;
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI void __format_year(int __year, basic_stringstream<_CharT>& __sstr) {
+  if (__year < 0) {
+    __sstr << _CharT('-');
+    __year = -__year;
+  }
+
+  // TODO FMT Write an issue
+  //   If the result has less than four digits it is zero-padded with 0 to two digits.
+  // is less -> has less
+  // left-padded -> zero-padded, otherwise the proper value would be 000-0.
+
+  // Note according to the wording it should be left padded, which is odd.
+  __sstr << std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "{:04}"), __year);
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI void __format_century(int __year, basic_stringstream<_CharT>& __sstr) {
+  // TODO FMT Write an issue
+  // [tab:time.format.spec]
+  //   %C The year divided by 100 using floored division. If the result is a
+  //   single decimal digit, it is prefixed with 0.
+
+  bool __negative = __year < 0;
+  int __century   = (__year - (99 * __negative)) / 100; // floored division
+  __sstr << std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "{:02}"), __century);
+}
+
+template <class _CharT, class _Tp>
+_LIBCPP_HIDE_FROM_ABI void __format_chrono_using_chrono_specs(
+    const _Tp& __value, basic_stringstream<_CharT>& __sstr, basic_string_view<_CharT> __chrono_specs) {
+  tm __t              = std::__convert_to_tm<tm>(__value);
+  const auto& __facet = std::use_facet<time_put<_CharT>>(__sstr.getloc());
+  for (auto __it = __chrono_specs.begin(); __it != __chrono_specs.end(); ++__it) {
+    if (*__it == _CharT('%')) {
+      auto __s = __it;
+      ++__it;
+      // We only handle the types that can't be directly handled by time_put.
+      // (as an optimization n, t, and % are also handled directly.)
+      switch (*__it) {
+      case _CharT('n'):
+        __sstr << _CharT('\n');
+        break;
+      case _CharT('t'):
+        __sstr << _CharT('\t');
+        break;
+      case _CharT('%'):
+        __sstr << *__it;
+        break;
+
+      case _CharT('C'): {
+        // strftime's output is only defined in the range [00, 99].
+        int __year = __t.tm_year + 1900;
+        if (__year < 1000 || __year > 9999)
+          __formatter::__format_century(__year, __sstr);
+        else
+          __facet.put({__sstr}, __sstr, _CharT(' '), std::addressof(__t), __s, __it + 1);
+      } break;
+
+      case _CharT('j'):
+        if constexpr (chrono::__is_duration<_Tp>::value)
+          // Converting a duration where the period has a small ratio to days
+          // may fail to compile. This due to loss of precision in the
+          // conversion. In order to avoid that issue convert to seconds as
+          // an intemediate step.
+          __sstr << chrono::duration_cast<chrono::days>(chrono::duration_cast<chrono::seconds>(__value)).count();
+        else
+          __facet.put({__sstr}, __sstr, _CharT(' '), std::addressof(__t), __s, __it + 1);
+        break;
+
+      case _CharT('q'):
+        if constexpr (chrono::__is_duration<_Tp>::value) {
+          __sstr << chrono::__units_suffix<_CharT, typename _Tp::period>();
+          break;
+        }
+        __builtin_unreachable();
+
+      case _CharT('Q'):
+        // TODO FMT Determine the proper ideas
+        // - Should it honour the precision?
+        // - Shoult it honour the locale setting for the separators?
+        // The wording for Q doesn't use the word locale and the effect of
+        // precision is unspecified.
+        //
+        // MSVC STL ignores precision but uses separator
+        // FMT honours precision and has a bug for separator
+        // https://godbolt.org/z/78b7sMxns
+        if constexpr (chrono::__is_duration<_Tp>::value) {
+          __sstr << std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "{}"), __value.count());
+          break;
+        }
+        __builtin_unreachable();
+
+      case _CharT('S'):
+      case _CharT('T'):
+        __facet.put({__sstr}, __sstr, _CharT(' '), std::addressof(__t), __s, __it + 1);
+        if constexpr (__use_fraction<_Tp>())
+          __formatter::__format_sub_seconds(__value, __sstr);
+        break;
+
+        // Unlike time_put and strftime the formatting library requires %Y
+        //
+        // [tab:time.format.spec]
+        //   The year as a decimal number. If the result is less than four digits
+        //   it is left-padded with 0 to four digits.
+        //
+        // This means years in the range (-1000, 1000) need manual formatting.
+        // It's unclear whether %EY needs the same treatment. For example the
+        // Japanese EY contains the era name and year. This is zero-padded to 2
+        // digits in time_put (note that older glibc versions didn't do
+        // padding.) However most eras won't reach 100 years, let alone 1000.
+        // So padding to 4 digits seems unwanted for Japanese.
+        //
+        // The same applies to %Ex since that too depends on the era.
+        //
+        // %x the locale's date representation is currently doesn't handle the
+        // zero-padding too.
+        //
+        // The 4 digits can be implemented better at a later time. On POSIX
+        // systems the required information can be extracted by nl_langinfo
+        // https://man7.org/linux/man-pages/man3/nl_langinfo.3.html
+        //
+        // Note since year < -1000 is expected to be rare it uses the more
+        // expensive year routine.
+        //
+        // TODO FMT evaluate the comment above.
+
+#  if defined(__GLIBC__) || defined(_AIX)
+      case _CharT('y'):
+        // Glibc fails for negative values, AIX for positive values too.
+        __sstr << std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "{:02}"), (std::abs(__t.tm_year + 1900)) % 100);
+        break;
+#  endif // defined(__GLIBC__) || defined(_AIX)
+
+      case _CharT('Y'): {
+        int __year = __t.tm_year + 1900;
+        if (__year < 1000)
+          __formatter::__format_year(__year, __sstr);
+        else
+          __facet.put({__sstr}, __sstr, _CharT(' '), std::addressof(__t), __s, __it + 1);
+      } break;
+
+      case _CharT('F'): {
+        int __year = __t.tm_year + 1900;
+        if (__year < 1000) {
+          __formatter::__format_year(__year, __sstr);
+          __sstr << std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "-{:02}-{:02}"), __t.tm_mon + 1, __t.tm_mday);
+        } else
+          __facet.put({__sstr}, __sstr, _CharT(' '), std::addressof(__t), __s, __it + 1);
+      } break;
+
+      case _CharT('O'):
+        if constexpr (__use_fraction<_Tp>()) {
+          // Handle OS using the normal representation for the non-fractional
+          // part. There seems to be no locale information regarding how the
+          // fractional part should be formatted.
+          if (*(__it + 1) == 'S') {
+            ++__it;
+            __facet.put({__sstr}, __sstr, _CharT(' '), std::addressof(__t), __s, __it + 1);
+            __formatter::__format_sub_seconds(__value, __sstr);
+            break;
+          }
+        }
+        [[fallthrough]];
+      case _CharT('E'):
+        ++__it;
+        [[fallthrough]];
+      default:
+        __facet.put({__sstr}, __sstr, _CharT(' '), std::addressof(__t), __s, __it + 1);
+        break;
+      }
+    } else {
+      __sstr << *__it;
+    }
+  }
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr bool __weekday_ok(const _Tp& __value) {
+  if constexpr (same_as<_Tp, chrono::day>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month>)
+    return __value.ok();
+  else if constexpr (same_as<_Tp, chrono::year>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::weekday>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::weekday_indexed>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::weekday_last>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month_day>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month_day_last>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month_weekday>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month_weekday_last>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::year_month>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::year_month_day>)
+    return __value.ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_day_last>)
+    return __value.ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_weekday>)
+    return __value.weekday().ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_weekday_last>)
+    return __value.weekday().ok();
+  else
+    static_assert(sizeof(_Tp) == 0, "Add the missing type specialization");
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr bool __weekday_name_ok(const _Tp& __value) {
+  if constexpr (same_as<_Tp, chrono::day>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month>)
+    return __value.ok();
+  else if constexpr (same_as<_Tp, chrono::year>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::weekday>)
+    return __value.ok();
+  else if constexpr (same_as<_Tp, chrono::weekday_indexed>)
+    return __value.weekday().ok();
+  else if constexpr (same_as<_Tp, chrono::weekday_last>)
+    return __value.weekday().ok();
+  else if constexpr (same_as<_Tp, chrono::month_day>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month_day_last>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month_weekday>)
+    return __value.weekday_indexed().ok();
+  else if constexpr (same_as<_Tp, chrono::month_weekday_last>)
+    return __value.weekday_indexed().ok();
+  else if constexpr (same_as<_Tp, chrono::year_month>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::year_month_day>)
+    return __value.ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_day_last>)
+    return __value.ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_weekday>)
+    return __value.weekday().ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_weekday_last>)
+    return __value.weekday().ok();
+  else
+    static_assert(sizeof(_Tp) == 0, "Add the missing type specialization");
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr bool __date_ok(const _Tp& __value) {
+  if constexpr (same_as<_Tp, chrono::day>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month>)
+    return __value.ok();
+  else if constexpr (same_as<_Tp, chrono::year>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::weekday>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::weekday_indexed>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::weekday_last>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month_day>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month_day_last>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month_weekday>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month_weekday_last>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::year_month>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::year_month_day>)
+    return __value.ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_day_last>)
+    return __value.ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_weekday>)
+    return __value.ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_weekday_last>)
+    return __value.ok();
+  else
+    static_assert(sizeof(_Tp) == 0, "Add the missing type specialization");
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr bool __month_name_ok(const _Tp& __value) {
+  if constexpr (same_as<_Tp, chrono::day>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month>)
+    return __value.ok();
+  else if constexpr (same_as<_Tp, chrono::year>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::weekday>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::weekday_indexed>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::weekday_last>)
+    return true;
+  else if constexpr (same_as<_Tp, chrono::month_day>)
+    return __value.month().ok();
+  else if constexpr (same_as<_Tp, chrono::month_day_last>)
+    return __value.month().ok();
+  else if constexpr (same_as<_Tp, chrono::month_weekday>)
+    return __value.month().ok();
+  else if constexpr (same_as<_Tp, chrono::month_weekday_last>)
+    return __value.month().ok();
+  else if constexpr (same_as<_Tp, chrono::year_month>)
+    return __value.month().ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_day>)
+    return __value.month().ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_day_last>)
+    return __value.month().ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_weekday>)
+    return __value.month().ok();
+  else if constexpr (same_as<_Tp, chrono::year_month_weekday_last>)
+    return __value.month().ok();
+  else
+    static_assert(sizeof(_Tp) == 0, "Add the missing type specialization");
+}
+
+template <class _CharT, class _Tp>
+_LIBCPP_HIDE_FROM_ABI auto
+__format_chrono(const _Tp& __value,
+                auto& __ctx,
+                __format_spec::__parsed_specifications<_CharT> __specs,
+                basic_string_view<_CharT> __chrono_specs) -> decltype(__ctx.out()) {
+  basic_stringstream<_CharT> __sstr;
+  // [time.format]/2
+  // 2.1 - the "C" locale if the L option is not present in chrono-format-spec, otherwise
+  // 2.2 - the locale passed to the formatting function if any, otherwise
+  // 2.3 - the global locale.
+  // Note that the __ctx's locale() call does 2.2 and 2.3.
+  if (__specs.__chrono_.__locale_specific_form_)
+    __sstr.imbue(__ctx.locale());
+  else
+    __sstr.imbue(locale::classic());
+
+  if (__chrono_specs.empty())
+    __sstr << __value;
+  else {
+    if constexpr (chrono::__is_duration<_Tp>::value) {
+      if (__value < __value.zero())
+        __sstr << _CharT('-');
+      __formatter::__format_chrono_using_chrono_specs(chrono::abs(__value), __sstr, __chrono_specs);
+      // TODO FMT When keeping the precision it will truncate the string.
+      // Note that the behaviour what the precision does isn't specified.
+      __specs.__precision_ = -1;
+    } else {
+      // Test __weekday_name_ before __weekday_ to give a better error.
+      if (__specs.__chrono_.__weekday_name_ && !__formatter::__weekday_name_ok(__value))
+        std::__throw_format_error("formatting a weekday name needs a valid weekday");
+
+      if (__specs.__chrono_.__weekday_ && !__formatter::__weekday_ok(__value))
+        std::__throw_format_error("formatting a weekday needs a valid weekday");
+
+      if (__specs.__chrono_.__day_of_year_ && !__formatter::__date_ok(__value))
+        std::__throw_format_error("formatting a day of year needs a valid date");
+
+      if (__specs.__chrono_.__week_of_year_ && !__formatter::__date_ok(__value))
+        std::__throw_format_error("formatting a week of year needs a valid date");
+
+      if (__specs.__chrono_.__month_name_ && !__formatter::__month_name_ok(__value))
+        std::__throw_format_error("formatting a month name from an invalid month number");
+
+      __formatter::__format_chrono_using_chrono_specs(__value, __sstr, __chrono_specs);
+    }
+  }
+
+  // TODO FMT Use the stringstream's view after P0408R7 has been implemented.
+  basic_string<_CharT> __str = __sstr.str();
+  return __formatter::__write_string(basic_string_view<_CharT>{__str}, __ctx.out(), __specs);
+}
+
+} // namespace __formatter
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT __formatter_chrono {
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr auto __parse(
+      basic_format_parse_context<_CharT>& __parse_ctx, __format_spec::__fields __fields, __format_spec::__flags __flags)
+      -> decltype(__parse_ctx.begin()) {
+    return __parser_.__parse(__parse_ctx, __fields, __flags);
+  }
+
+  template <class _Tp>
+  _LIBCPP_HIDE_FROM_ABI auto format(const _Tp& __value, auto& __ctx) const -> decltype(__ctx.out()) const {
+    return __formatter::__format_chrono(
+        __value, __ctx, __parser_.__parser_.__get_parsed_chrono_specifications(__ctx), __parser_.__chrono_specs_);
+  }
+
+  __format_spec::__parser_chrono<_CharT> __parser_;
+};
+
+template <class _Rep, class _Period, __fmt_char_type _CharT>
+struct formatter<chrono::duration<_Rep, _Period>, _CharT> : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    // [time.format]/1
+    // Giving a precision specification in the chrono-format-spec is valid only
+    // for std::chrono::duration types where the representation type Rep is a
+    // floating-point type. For all other Rep types, an exception of type
+    // format_error is thrown if the chrono-format-spec contains a precision
+    // specification.
+    //
+    // Note this doesn't refer to chrono::treat_as_floating_point_v<_Rep>.
+    if constexpr (std::floating_point<_Rep>)
+      return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono_fractional, __format_spec::__flags::__duration);
+    else
+      return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__duration);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::day, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__day);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::month, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__month);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::year, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__year);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::weekday, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__weekday);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::weekday_indexed, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__weekday);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::weekday_last, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__weekday);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::month_day, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__month_day);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::month_day_last, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__month);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::month_weekday, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__month_weekday);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::month_weekday_last, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__month_weekday);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::year_month, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__year_month);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::year_month_day, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__date);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::year_month_day_last, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__date);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::year_month_weekday, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__date);
+  }
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<chrono::year_month_weekday_last, _CharT>
+    : public __formatter_chrono<_CharT> {
+public:
+  using _Base = __formatter_chrono<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    return _Base::__parse(__parse_ctx, __format_spec::__fields_chrono, __format_spec::__flags::__date);
+  }
+};
+
+#endif // if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_FORMAT)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif //  _LIBCPP___CHRONO_FORMATTER_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/hh_mm_ss.h b/app/src/main/cpp/libcxx/include/__chrono/hh_mm_ss.h
new file mode 100644
index 0000000..fd61cbe
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/hh_mm_ss.h
@@ -0,0 +1,112 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_HH_MM_SS_H
+#define _LIBCPP___CHRONO_HH_MM_SS_H
+
+#include <__chrono/duration.h>
+#include <__chrono/time_point.h>
+#include <__config>
+#include <ratio>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+template <class _Duration>
+class hh_mm_ss
+{
+private:
+    static_assert(__is_duration<_Duration>::value, "template parameter of hh_mm_ss must be a std::chrono::duration");
+    using __CommonType = common_type_t<_Duration, chrono::seconds>;
+
+    _LIBCPP_HIDE_FROM_ABI static constexpr uint64_t __pow10(unsigned __exp)
+    {
+        uint64_t __ret = 1;
+        for (unsigned __i = 0; __i < __exp; ++__i)
+            __ret *= 10U;
+        return __ret;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI static constexpr unsigned __width(uint64_t __n, uint64_t __d = 10, unsigned __w = 0)
+    {
+        if (__n >= 2 && __d != 0 && __w < 19)
+            return 1 + __width(__n, __d % __n * 10, __w+1);
+        return 0;
+    }
+
+public:
+    _LIBCPP_HIDE_FROM_ABI static unsigned constexpr fractional_width = __width(__CommonType::period::den) < 19 ?
+                                                 __width(__CommonType::period::den) : 6u;
+    using precision = duration<typename __CommonType::rep, ratio<1, __pow10(fractional_width)>>;
+
+    _LIBCPP_HIDE_FROM_ABI constexpr hh_mm_ss() noexcept : hh_mm_ss{_Duration::zero()} {}
+
+    _LIBCPP_HIDE_FROM_ABI constexpr explicit hh_mm_ss(_Duration __d) noexcept :
+        __is_neg_(__d < _Duration(0)),
+        __h_(chrono::duration_cast<chrono::hours>  (chrono::abs(__d))),
+        __m_(chrono::duration_cast<chrono::minutes>(chrono::abs(__d) - hours())),
+        __s_(chrono::duration_cast<chrono::seconds>(chrono::abs(__d) - hours() - minutes())),
+        __f_(chrono::duration_cast<precision>      (chrono::abs(__d) - hours() - minutes() - seconds()))
+        {}
+
+    _LIBCPP_HIDE_FROM_ABI constexpr bool is_negative()        const noexcept { return __is_neg_; }
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::hours hours()     const noexcept { return __h_; }
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::minutes minutes() const noexcept { return __m_; }
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::seconds seconds() const noexcept { return __s_; }
+    _LIBCPP_HIDE_FROM_ABI constexpr precision subseconds()    const noexcept { return __f_; }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr precision to_duration() const noexcept
+    {
+        auto __dur = __h_ + __m_ + __s_ + __f_;
+        return __is_neg_ ? -__dur : __dur;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr explicit operator precision() const noexcept { return to_duration(); }
+
+private:
+    bool            __is_neg_;
+    chrono::hours   __h_;
+    chrono::minutes __m_;
+    chrono::seconds __s_;
+    precision       __f_;
+};
+
+_LIBCPP_HIDE_FROM_ABI constexpr bool is_am(const hours& __h) noexcept { return __h >= hours( 0) && __h < hours(12); }
+_LIBCPP_HIDE_FROM_ABI constexpr bool is_pm(const hours& __h) noexcept { return __h >= hours(12) && __h < hours(24); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr hours make12(const hours& __h) noexcept
+{
+    if      (__h == hours( 0)) return hours(12);
+    else if (__h <= hours(12)) return __h;
+    else                       return __h - hours(12);
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr hours make24(const hours& __h, bool __is_pm) noexcept
+{
+    if (__is_pm)
+        return __h == hours(12) ? __h : __h + hours(12);
+    else
+        return __h == hours(12) ? hours(0) : __h;
+}
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___CHRONO_HH_MM_SS_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/high_resolution_clock.h b/app/src/main/cpp/libcxx/include/__chrono/high_resolution_clock.h
new file mode 100644
index 0000000..778ff44
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/high_resolution_clock.h
@@ -0,0 +1,36 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_HIGH_RESOLUTION_CLOCK_H
+#define _LIBCPP___CHRONO_HIGH_RESOLUTION_CLOCK_H
+
+#include <__chrono/steady_clock.h>
+#include <__chrono/system_clock.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+#ifndef _LIBCPP_HAS_NO_MONOTONIC_CLOCK
+typedef steady_clock high_resolution_clock;
+#else
+typedef system_clock high_resolution_clock;
+#endif
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CHRONO_HIGH_RESOLUTION_CLOCK_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/literals.h b/app/src/main/cpp/libcxx/include/__chrono/literals.h
new file mode 100644
index 0000000..50529bd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/literals.h
@@ -0,0 +1,49 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_LITERALS_H
+#define _LIBCPP___CHRONO_LITERALS_H
+
+#include <__chrono/day.h>
+#include <__chrono/year.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+inline namespace literals
+{
+  inline namespace chrono_literals
+  {
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::day operator ""d(unsigned long long __d) noexcept
+    {
+        return chrono::day(static_cast<unsigned>(__d));
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::year operator ""y(unsigned long long __y) noexcept
+    {
+        return chrono::year(static_cast<int>(__y));
+    }
+} // namespace chrono_literals
+} // namespace literals
+
+namespace chrono { // hoist the literals into namespace std::chrono
+   using namespace literals::chrono_literals;
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___CHRONO_LITERALS_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/month.h b/app/src/main/cpp/libcxx/include/__chrono/month.h
new file mode 100644
index 0000000..e929f24
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/month.h
@@ -0,0 +1,103 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_MONTH_H
+#define _LIBCPP___CHRONO_MONTH_H
+
+#include <__chrono/duration.h>
+#include <__config>
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+class month {
+private:
+    unsigned char __m_;
+public:
+    _LIBCPP_HIDE_FROM_ABI month() = default;
+    _LIBCPP_HIDE_FROM_ABI explicit inline constexpr month(unsigned __val) noexcept : __m_(static_cast<unsigned char>(__val)) {}
+    _LIBCPP_HIDE_FROM_ABI inline constexpr month& operator++()    noexcept { ++__m_; return *this; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr month  operator++(int) noexcept { month __tmp = *this; ++(*this); return __tmp; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr month& operator--()    noexcept { --__m_; return *this; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr month  operator--(int) noexcept { month __tmp = *this; --(*this); return __tmp; }
+    _LIBCPP_HIDE_FROM_ABI        constexpr month& operator+=(const months& __m1) noexcept;
+    _LIBCPP_HIDE_FROM_ABI        constexpr month& operator-=(const months& __m1) noexcept;
+    _LIBCPP_HIDE_FROM_ABI explicit inline constexpr operator unsigned() const noexcept { return __m_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr bool ok() const noexcept { return __m_ >= 1 && __m_ <= 12; }
+};
+
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const month& __lhs, const month& __rhs) noexcept
+{ return static_cast<unsigned>(__lhs) == static_cast<unsigned>(__rhs); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr strong_ordering operator<=>(const month& __lhs, const month& __rhs) noexcept {
+    return static_cast<unsigned>(__lhs) <=> static_cast<unsigned>(__rhs);
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month operator+ (const month& __lhs, const months& __rhs) noexcept
+{
+    auto const __mu = static_cast<long long>(static_cast<unsigned>(__lhs)) + (__rhs.count() - 1);
+    auto const __yr = (__mu >= 0 ? __mu : __mu - 11) / 12;
+    return month{static_cast<unsigned>(__mu - __yr * 12 + 1)};
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month operator+ (const months& __lhs, const month& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month operator- (const month& __lhs, const months& __rhs) noexcept
+{ return __lhs + -__rhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+months operator-(const month& __lhs, const month& __rhs) noexcept
+{
+    auto const __dm = static_cast<unsigned>(__lhs) - static_cast<unsigned>(__rhs);
+    return months(__dm <= 11 ? __dm : __dm + 12);
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month& month::operator+=(const months& __dm) noexcept
+{ *this = *this + __dm; return *this; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month& month::operator-=(const months& __dm) noexcept
+{ *this = *this - __dm; return *this; }
+
+inline constexpr month January{1};
+inline constexpr month February{2};
+inline constexpr month March{3};
+inline constexpr month April{4};
+inline constexpr month May{5};
+inline constexpr month June{6};
+inline constexpr month July{7};
+inline constexpr month August{8};
+inline constexpr month September{9};
+inline constexpr month October{10};
+inline constexpr month November{11};
+inline constexpr month December{12};
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___CHRONO_MONTH_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/month_weekday.h b/app/src/main/cpp/libcxx/include/__chrono/month_weekday.h
new file mode 100644
index 0000000..01cdf76
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/month_weekday.h
@@ -0,0 +1,106 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_MONTH_WEEKDAY_H
+#define _LIBCPP___CHRONO_MONTH_WEEKDAY_H
+
+#include <__chrono/month.h>
+#include <__chrono/weekday.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+class month_weekday {
+private:
+    chrono::month __m_;
+    chrono::weekday_indexed __wdi_;
+public:
+    _LIBCPP_HIDE_FROM_ABI constexpr month_weekday(const chrono::month& __mval, const chrono::weekday_indexed& __wdival) noexcept
+        : __m_{__mval}, __wdi_{__wdival} {}
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::month                     month() const noexcept { return __m_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::weekday_indexed weekday_indexed() const noexcept { return __wdi_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr bool                                 ok() const noexcept { return __m_.ok() && __wdi_.ok(); }
+};
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const month_weekday& __lhs, const month_weekday& __rhs) noexcept
+{ return __lhs.month() == __rhs.month() && __lhs.weekday_indexed() == __rhs.weekday_indexed(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator!=(const month_weekday& __lhs, const month_weekday& __rhs) noexcept
+{ return !(__lhs == __rhs); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_weekday operator/(const month& __lhs, const weekday_indexed& __rhs) noexcept
+{ return month_weekday{__lhs, __rhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_weekday operator/(int __lhs, const weekday_indexed& __rhs) noexcept
+{ return month_weekday{month(__lhs), __rhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_weekday operator/(const weekday_indexed& __lhs, const month& __rhs) noexcept
+{ return month_weekday{__rhs, __lhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_weekday operator/(const weekday_indexed& __lhs, int __rhs) noexcept
+{ return month_weekday{month(__rhs), __lhs}; }
+
+
+class month_weekday_last {
+    chrono::month        __m_;
+    chrono::weekday_last __wdl_;
+  public:
+    _LIBCPP_HIDE_FROM_ABI constexpr month_weekday_last(const chrono::month& __mval, const chrono::weekday_last& __wdlval) noexcept
+        : __m_{__mval}, __wdl_{__wdlval} {}
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::month               month() const noexcept { return __m_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::weekday_last weekday_last() const noexcept { return __wdl_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr bool                           ok() const noexcept { return __m_.ok() && __wdl_.ok(); }
+};
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const month_weekday_last& __lhs, const month_weekday_last& __rhs) noexcept
+{ return __lhs.month() == __rhs.month() && __lhs.weekday_last() == __rhs.weekday_last(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator!=(const month_weekday_last& __lhs, const month_weekday_last& __rhs) noexcept
+{ return !(__lhs == __rhs); }
+
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_weekday_last operator/(const month& __lhs, const weekday_last& __rhs) noexcept
+{ return month_weekday_last{__lhs, __rhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_weekday_last operator/(int __lhs, const weekday_last& __rhs) noexcept
+{ return month_weekday_last{month(__lhs), __rhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_weekday_last operator/(const weekday_last& __lhs, const month& __rhs) noexcept
+{ return month_weekday_last{__rhs, __lhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_weekday_last operator/(const weekday_last& __lhs, int __rhs) noexcept
+{ return month_weekday_last{month(__rhs), __lhs}; }
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___CHRONO_MONTH_WEEKDAY_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/monthday.h b/app/src/main/cpp/libcxx/include/__chrono/monthday.h
new file mode 100644
index 0000000..c0ee3e4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/monthday.h
@@ -0,0 +1,129 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_MONTHDAY_H
+#define _LIBCPP___CHRONO_MONTHDAY_H
+
+#include <__chrono/calendar.h>
+#include <__chrono/day.h>
+#include <__chrono/month.h>
+#include <__config>
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+class month_day {
+private:
+   chrono::month __m_;
+   chrono::day   __d_;
+public:
+    _LIBCPP_HIDE_FROM_ABI month_day() = default;
+    _LIBCPP_HIDE_FROM_ABI constexpr month_day(const chrono::month& __mval, const chrono::day& __dval) noexcept
+        : __m_{__mval}, __d_{__dval} {}
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::month month() const noexcept { return __m_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::day   day()   const noexcept { return __d_; }
+    _LIBCPP_HIDE_FROM_ABI constexpr bool ok() const noexcept;
+};
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool month_day::ok() const noexcept
+{
+    if (!__m_.ok()) return false;
+    const unsigned __dval = static_cast<unsigned>(__d_);
+    if (__dval < 1 || __dval > 31) return false;
+    if (__dval <= 29) return true;
+//  Now we've got either 30 or 31
+    const unsigned __mval = static_cast<unsigned>(__m_);
+    if (__mval == 2) return false;
+    if (__mval == 4 || __mval == 6 || __mval == 9 || __mval == 11)
+        return __dval == 30;
+    return true;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const month_day& __lhs, const month_day& __rhs) noexcept
+{ return __lhs.month() == __rhs.month() && __lhs.day() == __rhs.day(); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr strong_ordering operator<=>(const month_day& __lhs, const month_day& __rhs) noexcept {
+    if (auto __c = __lhs.month() <=> __rhs.month(); __c != 0)
+        return __c;
+    return __lhs.day() <=> __rhs.day();
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_day operator/(const month& __lhs, const day& __rhs) noexcept
+{ return month_day{__lhs, __rhs}; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+month_day operator/(const day& __lhs, const month& __rhs) noexcept
+{ return __rhs / __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_day operator/(const month& __lhs, int __rhs) noexcept
+{ return __lhs / day(__rhs); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+month_day operator/(int __lhs, const day& __rhs) noexcept
+{ return month(__lhs) / __rhs; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+month_day operator/(const day& __lhs, int __rhs) noexcept
+{ return month(__rhs) / __lhs; }
+
+class month_day_last {
+private:
+    chrono::month __m_;
+public:
+    _LIBCPP_HIDE_FROM_ABI explicit constexpr month_day_last(const chrono::month& __val) noexcept
+        : __m_{__val} {}
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::month month() const noexcept { return __m_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr bool ok() const noexcept { return __m_.ok(); }
+};
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const month_day_last& __lhs, const month_day_last& __rhs) noexcept
+{ return __lhs.month() == __rhs.month(); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr strong_ordering
+operator<=>(const month_day_last& __lhs, const month_day_last& __rhs) noexcept {
+    return __lhs.month() <=> __rhs.month();
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_day_last operator/(const month& __lhs, last_spec) noexcept
+{ return month_day_last{__lhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_day_last operator/(last_spec, const month& __rhs) noexcept
+{ return month_day_last{__rhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_day_last operator/(int __lhs, last_spec) noexcept
+{ return month_day_last{month(__lhs)}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+month_day_last operator/(last_spec, int __rhs) noexcept
+{ return month_day_last{month(__rhs)}; }
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___CHRONO_MONTHDAY_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/ostream.h b/app/src/main/cpp/libcxx/include/__chrono/ostream.h
new file mode 100644
index 0000000..30a04bd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/ostream.h
@@ -0,0 +1,238 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_OSTREAM_H
+#define _LIBCPP___CHRONO_OSTREAM_H
+
+#include <__chrono/day.h>
+#include <__chrono/duration.h>
+#include <__chrono/month.h>
+#include <__chrono/month_weekday.h>
+#include <__chrono/monthday.h>
+#include <__chrono/statically_widen.h>
+#include <__chrono/weekday.h>
+#include <__chrono/year.h>
+#include <__chrono/year_month.h>
+#include <__chrono/year_month_day.h>
+#include <__chrono/year_month_weekday.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__format/format_functions.h>
+#include <ostream>
+#include <ratio>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_FORMAT)
+
+namespace chrono {
+
+// Depending on the type the return is a const _CharT* or a basic_string<_CharT>
+template <class _CharT, class _Period>
+_LIBCPP_HIDE_FROM_ABI auto __units_suffix() {
+  // TODO FMT LWG issue the suffixes are always char and not STATICALLY-WIDEN'ed.
+  if constexpr (same_as<typename _Period::type, atto>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "as");
+  else if constexpr (same_as<typename _Period::type, femto>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "fs");
+  else if constexpr (same_as<typename _Period::type, pico>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "ps");
+  else if constexpr (same_as<typename _Period::type, nano>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "ns");
+  else if constexpr (same_as<typename _Period::type, micro>)
+#  ifndef _LIBCPP_HAS_NO_UNICODE
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "\u00b5s");
+#  else
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "us");
+#  endif
+  else if constexpr (same_as<typename _Period::type, milli>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "ms");
+  else if constexpr (same_as<typename _Period::type, centi>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "cs");
+  else if constexpr (same_as<typename _Period::type, deci>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "ds");
+  else if constexpr (same_as<typename _Period::type, ratio<1>>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "s");
+  else if constexpr (same_as<typename _Period::type, deca>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "das");
+  else if constexpr (same_as<typename _Period::type, hecto>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "hs");
+  else if constexpr (same_as<typename _Period::type, kilo>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "ks");
+  else if constexpr (same_as<typename _Period::type, mega>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "Ms");
+  else if constexpr (same_as<typename _Period::type, giga>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "Gs");
+  else if constexpr (same_as<typename _Period::type, tera>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "Ts");
+  else if constexpr (same_as<typename _Period::type, peta>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "Ps");
+  else if constexpr (same_as<typename _Period::type, exa>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "Es");
+  else if constexpr (same_as<typename _Period::type, ratio<60>>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "min");
+  else if constexpr (same_as<typename _Period::type, ratio<3600>>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "h");
+  else if constexpr (same_as<typename _Period::type, ratio<86400>>)
+    return _LIBCPP_STATICALLY_WIDEN(_CharT, "d");
+  else if constexpr (_Period::den == 1)
+    return std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "[{}]s"), _Period::num);
+  else
+    return std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "[{}/{}]s"), _Period::num, _Period::den);
+}
+
+template <class _CharT, class _Traits, class _Rep, class _Period>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const duration<_Rep, _Period>& __d) {
+  basic_ostringstream<_CharT, _Traits> __s;
+  __s.flags(__os.flags());
+  __s.imbue(__os.getloc());
+  __s.precision(__os.precision());
+  __s << __d.count() << chrono::__units_suffix<_CharT, _Period>();
+  return __os << __s.str();
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const day& __d) {
+  return __os
+      << (__d.ok()
+              ? std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "{:%d}"), __d)
+              // Note this error differs from the wording of the Standard. The
+              // Standard wording doesn't work well on AIX or Windows. There
+              // the formatted day seems to be either modulo 100 or completely
+              // omitted. Judging by the wording this is valid.
+              // TODO FMT Write a paper of file an LWG issue.
+              : std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "{:02} is not a valid day"), static_cast<unsigned>(__d)));
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const month& __m) {
+  return __os << (__m.ok() ? std::format(__os.getloc(), _LIBCPP_STATICALLY_WIDEN(_CharT, "{:L%b}"), __m)
+                           : std::format(__os.getloc(),
+                                         _LIBCPP_STATICALLY_WIDEN(_CharT, "{} is not a valid month"),
+                                         static_cast<unsigned>(__m))); // TODO FMT Standard mandated locale isn't used.
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const year& __y) {
+  return __os << (__y.ok() ? std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "{:%Y}"), __y)
+                           : std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "{:%Y} is not a valid year"), __y));
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const weekday& __wd) {
+  return __os << (__wd.ok() ? std::format(__os.getloc(), _LIBCPP_STATICALLY_WIDEN(_CharT, "{:L%a}"), __wd)
+                            : std::format(__os.getloc(), // TODO FMT Standard mandated locale isn't used.
+                                          _LIBCPP_STATICALLY_WIDEN(_CharT, "{} is not a valid weekday"),
+                                          static_cast<unsigned>(__wd.c_encoding())));
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const weekday_indexed& __wdi) {
+  auto __i = __wdi.index();
+  return __os << (__i >= 1 && __i <= 5
+                      ? std::format(__os.getloc(), _LIBCPP_STATICALLY_WIDEN(_CharT, "{:L}[{}]"), __wdi.weekday(), __i)
+                      : std::format(__os.getloc(),
+                                    _LIBCPP_STATICALLY_WIDEN(_CharT, "{:L}[{} is not a valid index]"),
+                                    __wdi.weekday(),
+                                    __i));
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const weekday_last& __wdl) {
+  return __os << std::format(__os.getloc(), _LIBCPP_STATICALLY_WIDEN(_CharT, "{:L}[last]"), __wdl.weekday());
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const month_day& __md) {
+  // TODO FMT The Standard allows 30th of February to be printed.
+  // It would be nice to show an error message instead.
+  return __os << std::format(__os.getloc(), _LIBCPP_STATICALLY_WIDEN(_CharT, "{:L}/{}"), __md.month(), __md.day());
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const month_day_last& __mdl) {
+  return __os << std::format(__os.getloc(), _LIBCPP_STATICALLY_WIDEN(_CharT, "{:L}/last"), __mdl.month());
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const month_weekday& __mwd) {
+  return __os << std::format(
+             __os.getloc(), _LIBCPP_STATICALLY_WIDEN(_CharT, "{:L}/{:L}"), __mwd.month(), __mwd.weekday_indexed());
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const month_weekday_last& __mwdl) {
+  return __os << std::format(
+             __os.getloc(), _LIBCPP_STATICALLY_WIDEN(_CharT, "{:L}/{:L}"), __mwdl.month(), __mwdl.weekday_last());
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const year_month& __ym) {
+  return __os << std::format(__os.getloc(), _LIBCPP_STATICALLY_WIDEN(_CharT, "{}/{:L}"), __ym.year(), __ym.month());
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const year_month_day& __ymd) {
+  return __os << (__ymd.ok() ? std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "{:%F}"), __ymd)
+                             : std::format(_LIBCPP_STATICALLY_WIDEN(_CharT, "{:%F} is not a valid date"), __ymd));
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const year_month_day_last& __ymdl) {
+  return __os << std::format(
+             __os.getloc(), _LIBCPP_STATICALLY_WIDEN(_CharT, "{}/{:L}"), __ymdl.year(), __ymdl.month_day_last());
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const year_month_weekday& __ymwd) {
+  return __os << std::format(
+             __os.getloc(),
+             _LIBCPP_STATICALLY_WIDEN(_CharT, "{}/{:L}/{:L}"),
+             __ymwd.year(),
+             __ymwd.month(),
+             __ymwd.weekday_indexed());
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const year_month_weekday_last& __ymwdl) {
+  return __os << std::format(
+             __os.getloc(),
+             _LIBCPP_STATICALLY_WIDEN(_CharT, "{}/{:L}/{:L}"),
+             __ymwdl.year(),
+             __ymwdl.month(),
+             __ymwdl.weekday_last());
+}
+
+} // namespace chrono
+
+#endif //if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_FORMAT)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CHRONO_OSTREAM_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/parser_std_format_spec.h b/app/src/main/cpp/libcxx/include/__chrono/parser_std_format_spec.h
new file mode 100644
index 0000000..dbcfe6d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/parser_std_format_spec.h
@@ -0,0 +1,410 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_PARSER_STD_FORMAT_SPEC_H
+#define _LIBCPP___CHRONO_PARSER_STD_FORMAT_SPEC_H
+
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/format_error.h>
+#include <__format/format_parse_context.h>
+#include <__format/formatter_string.h>
+#include <__format/parser_std_format_spec.h>
+#include <string_view>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_FORMAT)
+
+namespace __format_spec {
+
+// By not placing this constant in the formatter class it's not duplicated for char and wchar_t
+inline constexpr __fields __fields_chrono_fractional{
+    .__precision_ = true, .__locale_specific_form_ = true, .__type_ = false};
+inline constexpr __fields __fields_chrono{.__locale_specific_form_ = true, .__type_ = false};
+
+/// Flags available or required in a chrono type.
+///
+/// The caller of the chrono formatter lists the types it has available and the
+/// validation tests whether the requested type spec (e.g. %M) is available in
+/// the formatter.
+/// When the type in the chrono-format-spec isn't present in the data a
+/// \ref format_error is thrown.
+enum class __flags {
+  __second = 0x1,
+  __minute = 0x2,
+  __hour   = 0x4,
+  __time   = __hour | __minute | __second,
+
+  __day   = 0x8,
+  __month = 0x10,
+  __year  = 0x20,
+
+  __weekday = 0x40,
+
+  __month_day     = __day | __month,
+  __month_weekday = __weekday | __month,
+  __year_month    = __month | __year,
+  __date          = __day | __month | __year | __weekday,
+
+  __date_time = __date | __time,
+
+  __duration = 0x80 | __time,
+
+  __time_zone = 0x100,
+
+  __clock = __date_time | __time_zone
+};
+
+_LIBCPP_HIDE_FROM_ABI constexpr __flags operator&(__flags __lhs, __flags __rhs) {
+  return static_cast<__flags>(static_cast<unsigned>(__lhs) & static_cast<unsigned>(__rhs));
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_second(__flags __flags) {
+  if ((__flags & __flags::__second) != __flags::__second)
+    std::__throw_format_error("The supplied date time doesn't contain a second");
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_minute(__flags __flags) {
+  if ((__flags & __flags::__minute) != __flags::__minute)
+    std::__throw_format_error("The supplied date time doesn't contain a minute");
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_hour(__flags __flags) {
+  if ((__flags & __flags::__hour) != __flags::__hour)
+    std::__throw_format_error("The supplied date time doesn't contain an hour");
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_time(__flags __flags) {
+  if ((__flags & __flags::__time) != __flags::__time)
+    std::__throw_format_error("The supplied date time doesn't contain a time");
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_day(__flags __flags) {
+  if ((__flags & __flags::__day) != __flags::__day)
+    std::__throw_format_error("The supplied date time doesn't contain a day");
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_month(__flags __flags) {
+  if ((__flags & __flags::__month) != __flags::__month)
+    std::__throw_format_error("The supplied date time doesn't contain a month");
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_year(__flags __flags) {
+  if ((__flags & __flags::__year) != __flags::__year)
+    std::__throw_format_error("The supplied date time doesn't contain a year");
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_date(__flags __flags) {
+  if ((__flags & __flags::__date) != __flags::__date)
+    std::__throw_format_error("The supplied date time doesn't contain a date");
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_date_or_duration(__flags __flags) {
+  if (((__flags & __flags::__date) != __flags::__date) && ((__flags & __flags::__duration) != __flags::__duration))
+    std::__throw_format_error("The supplied date time doesn't contain a date or duration");
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_date_time(__flags __flags) {
+  if ((__flags & __flags::__date_time) != __flags::__date_time)
+    std::__throw_format_error("The supplied date time doesn't contain a date and time");
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_weekday(__flags __flags) {
+  if ((__flags & __flags::__weekday) != __flags::__weekday)
+    std::__throw_format_error("The supplied date time doesn't contain a weekday");
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_duration(__flags __flags) {
+  if ((__flags & __flags::__duration) != __flags::__duration)
+    std::__throw_format_error("The supplied date time doesn't contain a duration");
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __validate_time_zone(__flags __flags) {
+  if ((__flags & __flags::__time_zone) != __flags::__time_zone)
+    std::__throw_format_error("The supplied date time doesn't contain a time zone");
+}
+
+template <class _CharT>
+class _LIBCPP_TEMPLATE_VIS __parser_chrono {
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr auto
+  __parse(basic_format_parse_context<_CharT>& __parse_ctx, __fields __fields, __flags __flags)
+      -> decltype(__parse_ctx.begin()) {
+    const _CharT* __begin = __parser_.__parse(__parse_ctx, __fields);
+    const _CharT* __end   = __parse_ctx.end();
+    if (__begin == __end)
+      return __begin;
+
+    const _CharT* __last = __parse_chrono_specs(__begin, __end, __flags);
+    __chrono_specs_      = basic_string_view<_CharT>{__begin, __last};
+
+    return __last;
+  }
+
+  __parser<_CharT> __parser_;
+  basic_string_view<_CharT> __chrono_specs_;
+
+private:
+  _LIBCPP_HIDE_FROM_ABI constexpr const _CharT*
+  __parse_chrono_specs(const _CharT* __begin, const _CharT* __end, __flags __flags) {
+    _LIBCPP_ASSERT(__begin != __end,
+                   "When called with an empty input the function will cause "
+                   "undefined behavior by evaluating data not in the input");
+
+    if (*__begin != _CharT('%') && *__begin != _CharT('}'))
+      std::__throw_format_error("Expected '%' or '}' in the chrono format-string");
+
+    do {
+      switch (*__begin) {
+      case _CharT('{'):
+        std::__throw_format_error("The chrono-specs contains a '{'");
+
+      case _CharT('}'):
+        return __begin;
+
+      case _CharT('%'):
+        __parse_conversion_spec(__begin, __end, __flags);
+        [[fallthrough]];
+
+      default:
+        // All other literals
+        ++__begin;
+      }
+
+    } while (__begin != __end && *__begin != _CharT('}'));
+
+    return __begin;
+  }
+
+  /// \pre *__begin == '%'
+  /// \post __begin points at the end parsed conversion-spec
+  _LIBCPP_HIDE_FROM_ABI constexpr void
+  __parse_conversion_spec(const _CharT*& __begin, const _CharT* __end, __flags __flags) {
+    ++__begin;
+    if (__begin == __end)
+      std::__throw_format_error("End of input while parsing the modifier chrono conversion-spec");
+
+    switch (*__begin) {
+    case _CharT('n'):
+    case _CharT('t'):
+    case _CharT('%'):
+      break;
+
+    case _CharT('S'):
+      __format_spec::__validate_second(__flags);
+      break;
+
+    case _CharT('M'):
+      __format_spec::__validate_minute(__flags);
+      break;
+
+    case _CharT('p'): // TODO FMT does the formater require an hour or a time?
+    case _CharT('H'):
+    case _CharT('I'):
+      __validate_hour(__flags);
+      break;
+
+    case _CharT('r'):
+    case _CharT('R'):
+    case _CharT('T'):
+    case _CharT('X'):
+      __format_spec::__validate_time(__flags);
+      break;
+
+    case _CharT('d'):
+    case _CharT('e'):
+      __format_spec::__validate_day(__flags);
+      break;
+
+    case _CharT('b'):
+    case _CharT('h'):
+    case _CharT('B'):
+      __parser_.__month_name_ = true;
+      [[fallthrough]];
+    case _CharT('m'):
+      __format_spec::__validate_month(__flags);
+      break;
+
+    case _CharT('y'):
+    case _CharT('C'):
+    case _CharT('Y'):
+      __format_spec::__validate_year(__flags);
+      break;
+
+    case _CharT('j'):
+      __parser_.__day_of_year_ = true;
+      __format_spec::__validate_date_or_duration(__flags);
+      break;
+
+    case _CharT('g'):
+    case _CharT('G'):
+    case _CharT('U'):
+    case _CharT('V'):
+    case _CharT('W'):
+      __parser_.__week_of_year_ = true;
+      [[fallthrough]];
+    case _CharT('x'):
+    case _CharT('D'):
+    case _CharT('F'):
+      __format_spec::__validate_date(__flags);
+      break;
+
+    case _CharT('c'):
+      __format_spec::__validate_date_time(__flags);
+      break;
+
+    case _CharT('a'):
+    case _CharT('A'):
+      __parser_.__weekday_name_ = true;
+      [[fallthrough]];
+    case _CharT('u'):
+    case _CharT('w'):
+      __parser_.__weekday_ = true;
+      __validate_weekday(__flags);
+      __format_spec::__validate_weekday(__flags);
+      break;
+
+    case _CharT('q'):
+    case _CharT('Q'):
+      __format_spec::__validate_duration(__flags);
+      break;
+
+    case _CharT('E'):
+      __parse_modifier_E(__begin, __end, __flags);
+      break;
+
+    case _CharT('O'):
+      __parse_modifier_O(__begin, __end, __flags);
+      break;
+
+    case _CharT('z'):
+    case _CharT('Z'):
+      // Currently there's no time zone information. However some clocks have a
+      // hard-coded "time zone", for these clocks the information can be used.
+      // TODO FMT implement time zones.
+      __format_spec::__validate_time_zone(__flags);
+      break;
+
+    default: // unknown type;
+      std::__throw_format_error("The date time type specifier is invalid");
+    }
+  }
+
+  /// \pre *__begin == 'E'
+  /// \post __begin is incremented by one.
+  _LIBCPP_HIDE_FROM_ABI constexpr void
+  __parse_modifier_E(const _CharT*& __begin, const _CharT* __end, __flags __flags) {
+    ++__begin;
+    if (__begin == __end)
+      std::__throw_format_error("End of input while parsing the modifier E");
+
+    switch (*__begin) {
+    case _CharT('X'):
+      __format_spec::__validate_time(__flags);
+      break;
+
+    case _CharT('y'):
+    case _CharT('C'):
+    case _CharT('Y'):
+      __format_spec::__validate_year(__flags);
+      break;
+
+    case _CharT('x'):
+      __format_spec::__validate_date(__flags);
+      break;
+
+    case _CharT('c'):
+      __format_spec::__validate_date_time(__flags);
+      break;
+
+    case _CharT('z'):
+      // Currently there's no time zone information. However some clocks have a
+      // hard-coded "time zone", for these clocks the information can be used.
+      // TODO FMT implement time zones.
+      __format_spec::__validate_time_zone(__flags);
+      break;
+
+    default:
+      std::__throw_format_error("The date time type specifier for modifier E is invalid");
+    }
+  }
+
+  /// \pre *__begin == 'O'
+  /// \post __begin is incremented by one.
+  _LIBCPP_HIDE_FROM_ABI constexpr void
+  __parse_modifier_O(const _CharT*& __begin, const _CharT* __end, __flags __flags) {
+    ++__begin;
+    if (__begin == __end)
+      std::__throw_format_error("End of input while parsing the modifier O");
+
+    switch (*__begin) {
+    case _CharT('S'):
+      __format_spec::__validate_second(__flags);
+      break;
+
+    case _CharT('M'):
+      __format_spec::__validate_minute(__flags);
+      break;
+
+    case _CharT('I'):
+    case _CharT('H'):
+      __format_spec::__validate_hour(__flags);
+      break;
+
+    case _CharT('d'):
+    case _CharT('e'):
+      __format_spec::__validate_day(__flags);
+      break;
+
+    case _CharT('m'):
+      __format_spec::__validate_month(__flags);
+      break;
+
+    case _CharT('y'):
+      __format_spec::__validate_year(__flags);
+      break;
+
+    case _CharT('U'):
+    case _CharT('V'):
+    case _CharT('W'):
+      __parser_.__week_of_year_ = true;
+      __format_spec::__validate_date(__flags);
+      break;
+
+    case _CharT('u'):
+    case _CharT('w'):
+      __parser_.__weekday_ = true;
+      __format_spec::__validate_weekday(__flags);
+      break;
+
+    case _CharT('z'):
+      // Currently there's no time zone information. However some clocks have a
+      // hard-coded "time zone", for these clocks the information can be used.
+      // TODO FMT implement time zones.
+      __format_spec::__validate_time_zone(__flags);
+      break;
+
+    default:
+      std::__throw_format_error("The date time type specifier for modifier O is invalid");
+    }
+  }
+};
+
+} // namespace __format_spec
+
+#endif //_LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_FORMAT)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CHRONO_PARSER_STD_FORMAT_SPEC_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/statically_widen.h b/app/src/main/cpp/libcxx/include/__chrono/statically_widen.h
new file mode 100644
index 0000000..360b6c2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/statically_widen.h
@@ -0,0 +1,52 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_STATICALLY_WIDEN_H
+#define _LIBCPP___CHRONO_STATICALLY_WIDEN_H
+
+// Implements the STATICALLY-WIDEN exposition-only function. ([time.general]/2)
+
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__format/concepts.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+#  ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <__fmt_char_type _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr const _CharT* __statically_widen(const char* __str, const wchar_t* __wstr) {
+  if constexpr (same_as<_CharT, char>)
+    return __str;
+  else
+    return __wstr;
+}
+#    define _LIBCPP_STATICALLY_WIDEN(_CharT, __str) ::std::__statically_widen<_CharT>(__str, L##__str)
+#  else  // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+// Without this indirection the unit test test/libcxx/modules_include.sh.cpp
+// fails for the CI build "No wide characters". This seems like a bug.
+// TODO FMT investigate why this is needed.
+template <__fmt_char_type _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr const _CharT* __statically_widen(const char* __str) {
+  return __str;
+}
+#    define _LIBCPP_STATICALLY_WIDEN(_CharT, __str) ::std::__statically_widen<_CharT>(__str)
+#  endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+#endif   //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CHRONO_STATICALLY_WIDEN_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/steady_clock.h b/app/src/main/cpp/libcxx/include/__chrono/steady_clock.h
new file mode 100644
index 0000000..ba83351
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/steady_clock.h
@@ -0,0 +1,44 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_STEADY_CLOCK_H
+#define _LIBCPP___CHRONO_STEADY_CLOCK_H
+
+#include <__chrono/duration.h>
+#include <__chrono/time_point.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+#ifndef _LIBCPP_HAS_NO_MONOTONIC_CLOCK
+class _LIBCPP_TYPE_VIS steady_clock
+{
+public:
+    typedef nanoseconds                                   duration;
+    typedef duration::rep                                 rep;
+    typedef duration::period                              period;
+    typedef chrono::time_point<steady_clock, duration>    time_point;
+    static _LIBCPP_CONSTEXPR_SINCE_CXX14 const bool is_steady = true;
+
+    static time_point now() _NOEXCEPT;
+};
+#endif
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CHRONO_STEADY_CLOCK_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/system_clock.h b/app/src/main/cpp/libcxx/include/__chrono/system_clock.h
new file mode 100644
index 0000000..331db46
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/system_clock.h
@@ -0,0 +1,54 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_SYSTEM_CLOCK_H
+#define _LIBCPP___CHRONO_SYSTEM_CLOCK_H
+
+#include <__chrono/duration.h>
+#include <__chrono/time_point.h>
+#include <__config>
+#include <ctime>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+class _LIBCPP_TYPE_VIS system_clock
+{
+public:
+    typedef microseconds                     duration;
+    typedef duration::rep                    rep;
+    typedef duration::period                 period;
+    typedef chrono::time_point<system_clock> time_point;
+    static _LIBCPP_CONSTEXPR_SINCE_CXX14 const bool is_steady = false;
+
+    static time_point now() _NOEXCEPT;
+    static time_t     to_time_t  (const time_point& __t) _NOEXCEPT;
+    static time_point from_time_t(time_t __t) _NOEXCEPT;
+};
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _Duration>
+using sys_time    = time_point<system_clock, _Duration>;
+using sys_seconds = sys_time<seconds>;
+using sys_days    = sys_time<days>;
+
+#endif
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CHRONO_SYSTEM_CLOCK_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/time_point.h b/app/src/main/cpp/libcxx/include/__chrono/time_point.h
new file mode 100644
index 0000000..8a8fa21
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/time_point.h
@@ -0,0 +1,251 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_TIME_POINT_H
+#define _LIBCPP___CHRONO_TIME_POINT_H
+
+#include <__chrono/duration.h>
+#include <__config>
+#include <__type_traits/common_type.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_convertible.h>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+template <class _Clock, class _Duration = typename _Clock::duration>
+class _LIBCPP_TEMPLATE_VIS time_point
+{
+    static_assert(__is_duration<_Duration>::value,
+                  "Second template parameter of time_point must be a std::chrono::duration");
+public:
+    typedef _Clock                    clock;
+    typedef _Duration                 duration;
+    typedef typename duration::rep    rep;
+    typedef typename duration::period period;
+private:
+    duration __d_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14 time_point() : __d_(duration::zero()) {}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14 explicit time_point(const duration& __d) : __d_(__d) {}
+
+    // conversions
+    template <class _Duration2>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    time_point(const time_point<clock, _Duration2>& __t,
+        typename enable_if
+        <
+            is_convertible<_Duration2, duration>::value
+        >::type* = nullptr)
+            : __d_(__t.time_since_epoch()) {}
+
+    // observer
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14 duration time_since_epoch() const {return __d_;}
+
+    // arithmetic
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 time_point& operator+=(const duration& __d) {__d_ += __d; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 time_point& operator-=(const duration& __d) {__d_ -= __d; return *this;}
+
+    // special values
+
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR time_point min() _NOEXCEPT {return time_point(duration::min());}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR time_point max() _NOEXCEPT {return time_point(duration::max());}
+};
+
+} // namespace chrono
+
+template <class _Clock, class _Duration1, class _Duration2>
+struct _LIBCPP_TEMPLATE_VIS common_type<chrono::time_point<_Clock, _Duration1>,
+                                         chrono::time_point<_Clock, _Duration2> >
+{
+    typedef chrono::time_point<_Clock, typename common_type<_Duration1, _Duration2>::type> type;
+};
+
+namespace chrono {
+
+template <class _ToDuration, class _Clock, class _Duration>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+time_point<_Clock, _ToDuration>
+time_point_cast(const time_point<_Clock, _Duration>& __t)
+{
+    return time_point<_Clock, _ToDuration>(chrono::duration_cast<_ToDuration>(__t.time_since_epoch()));
+}
+
+#if _LIBCPP_STD_VER > 14
+template <class _ToDuration, class _Clock, class _Duration>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+typename enable_if
+<
+    __is_duration<_ToDuration>::value,
+    time_point<_Clock, _ToDuration>
+>::type
+floor(const time_point<_Clock, _Duration>& __t)
+{
+    return time_point<_Clock, _ToDuration>{chrono::floor<_ToDuration>(__t.time_since_epoch())};
+}
+
+template <class _ToDuration, class _Clock, class _Duration>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+typename enable_if
+<
+    __is_duration<_ToDuration>::value,
+    time_point<_Clock, _ToDuration>
+>::type
+ceil(const time_point<_Clock, _Duration>& __t)
+{
+    return time_point<_Clock, _ToDuration>{chrono::ceil<_ToDuration>(__t.time_since_epoch())};
+}
+
+template <class _ToDuration, class _Clock, class _Duration>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+typename enable_if
+<
+    __is_duration<_ToDuration>::value,
+    time_point<_Clock, _ToDuration>
+>::type
+round(const time_point<_Clock, _Duration>& __t)
+{
+    return time_point<_Clock, _ToDuration>{chrono::round<_ToDuration>(__t.time_since_epoch())};
+}
+
+template <class _Rep, class _Period>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+typename enable_if
+<
+    numeric_limits<_Rep>::is_signed,
+    duration<_Rep, _Period>
+>::type
+abs(duration<_Rep, _Period> __d)
+{
+    return __d >= __d.zero() ? +__d : -__d;
+}
+#endif // _LIBCPP_STD_VER > 14
+
+// time_point ==
+
+template <class _Clock, class _Duration1, class _Duration2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator==(const time_point<_Clock, _Duration1>& __lhs, const time_point<_Clock, _Duration2>& __rhs)
+{
+    return __lhs.time_since_epoch() == __rhs.time_since_epoch();
+}
+
+// time_point !=
+
+template <class _Clock, class _Duration1, class _Duration2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator!=(const time_point<_Clock, _Duration1>& __lhs, const time_point<_Clock, _Duration2>& __rhs)
+{
+    return !(__lhs == __rhs);
+}
+
+// time_point <
+
+template <class _Clock, class _Duration1, class _Duration2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator<(const time_point<_Clock, _Duration1>& __lhs, const time_point<_Clock, _Duration2>& __rhs)
+{
+    return __lhs.time_since_epoch() < __rhs.time_since_epoch();
+}
+
+// time_point >
+
+template <class _Clock, class _Duration1, class _Duration2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator>(const time_point<_Clock, _Duration1>& __lhs, const time_point<_Clock, _Duration2>& __rhs)
+{
+    return __rhs < __lhs;
+}
+
+// time_point <=
+
+template <class _Clock, class _Duration1, class _Duration2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator<=(const time_point<_Clock, _Duration1>& __lhs, const time_point<_Clock, _Duration2>& __rhs)
+{
+    return !(__rhs < __lhs);
+}
+
+// time_point >=
+
+template <class _Clock, class _Duration1, class _Duration2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator>=(const time_point<_Clock, _Duration1>& __lhs, const time_point<_Clock, _Duration2>& __rhs)
+{
+    return !(__lhs < __rhs);
+}
+
+// time_point operator+(time_point x, duration y);
+
+template <class _Clock, class _Duration1, class _Rep2, class _Period2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+time_point<_Clock, typename common_type<_Duration1, duration<_Rep2, _Period2> >::type>
+operator+(const time_point<_Clock, _Duration1>& __lhs, const duration<_Rep2, _Period2>& __rhs)
+{
+    typedef time_point<_Clock, typename common_type<_Duration1, duration<_Rep2, _Period2> >::type> _Tr;
+    return _Tr (__lhs.time_since_epoch() + __rhs);
+}
+
+// time_point operator+(duration x, time_point y);
+
+template <class _Rep1, class _Period1, class _Clock, class _Duration2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+time_point<_Clock, typename common_type<duration<_Rep1, _Period1>, _Duration2>::type>
+operator+(const duration<_Rep1, _Period1>& __lhs, const time_point<_Clock, _Duration2>& __rhs)
+{
+    return __rhs + __lhs;
+}
+
+// time_point operator-(time_point x, duration y);
+
+template <class _Clock, class _Duration1, class _Rep2, class _Period2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+time_point<_Clock, typename common_type<_Duration1, duration<_Rep2, _Period2> >::type>
+operator-(const time_point<_Clock, _Duration1>& __lhs, const duration<_Rep2, _Period2>& __rhs)
+{
+    typedef time_point<_Clock, typename common_type<_Duration1, duration<_Rep2, _Period2> >::type> _Ret;
+    return _Ret(__lhs.time_since_epoch() -__rhs);
+}
+
+// duration operator-(time_point x, time_point y);
+
+template <class _Clock, class _Duration1, class _Duration2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+typename common_type<_Duration1, _Duration2>::type
+operator-(const time_point<_Clock, _Duration1>& __lhs, const time_point<_Clock, _Duration2>& __rhs)
+{
+    return __lhs.time_since_epoch() - __rhs.time_since_epoch();
+}
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___CHRONO_TIME_POINT_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/weekday.h b/app/src/main/cpp/libcxx/include/__chrono/weekday.h
new file mode 100644
index 0000000..e0bc8a4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/weekday.h
@@ -0,0 +1,185 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_WEEKDAY_H
+#define _LIBCPP___CHRONO_WEEKDAY_H
+
+#include <__chrono/calendar.h>
+#include <__chrono/duration.h>
+#include <__chrono/system_clock.h>
+#include <__chrono/time_point.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+class weekday_indexed;
+class weekday_last;
+
+class weekday {
+private:
+    unsigned char __wd_;
+    _LIBCPP_HIDE_FROM_ABI static constexpr unsigned char __weekday_from_days(int __days) noexcept;
+public:
+  _LIBCPP_HIDE_FROM_ABI weekday() = default;
+  _LIBCPP_HIDE_FROM_ABI inline explicit constexpr weekday(unsigned __val) noexcept : __wd_(static_cast<unsigned char>(__val == 7 ? 0 : __val)) {}
+  _LIBCPP_HIDE_FROM_ABI inline constexpr          weekday(const sys_days& __sysd) noexcept
+          : __wd_(__weekday_from_days(__sysd.time_since_epoch().count())) {}
+  _LIBCPP_HIDE_FROM_ABI inline explicit constexpr weekday(const local_days& __locd) noexcept
+          : __wd_(__weekday_from_days(__locd.time_since_epoch().count())) {}
+
+  _LIBCPP_HIDE_FROM_ABI inline constexpr weekday& operator++()    noexcept { __wd_ = (__wd_ == 6 ? 0 : __wd_ + 1); return *this; }
+  _LIBCPP_HIDE_FROM_ABI inline constexpr weekday  operator++(int) noexcept { weekday __tmp = *this; ++(*this); return __tmp; }
+  _LIBCPP_HIDE_FROM_ABI inline constexpr weekday& operator--()    noexcept { __wd_ = (__wd_ == 0 ? 6 : __wd_ - 1); return *this; }
+  _LIBCPP_HIDE_FROM_ABI inline constexpr weekday  operator--(int) noexcept { weekday __tmp = *this; --(*this); return __tmp; }
+  _LIBCPP_HIDE_FROM_ABI        constexpr weekday& operator+=(const days& __dd) noexcept;
+  _LIBCPP_HIDE_FROM_ABI        constexpr weekday& operator-=(const days& __dd) noexcept;
+  _LIBCPP_HIDE_FROM_ABI inline constexpr unsigned c_encoding()   const noexcept { return __wd_; }
+  _LIBCPP_HIDE_FROM_ABI inline constexpr unsigned iso_encoding() const noexcept { return __wd_ == 0u ? 7 : __wd_; }
+  _LIBCPP_HIDE_FROM_ABI inline constexpr bool ok() const noexcept { return __wd_ <= 6; }
+  _LIBCPP_HIDE_FROM_ABI        constexpr weekday_indexed operator[](unsigned __index) const noexcept;
+  _LIBCPP_HIDE_FROM_ABI        constexpr weekday_last    operator[](last_spec) const noexcept;
+};
+
+
+// https://howardhinnant.github.io/date_algorithms.html#weekday_from_days
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+unsigned char weekday::__weekday_from_days(int __days) noexcept
+{
+    return static_cast<unsigned char>(
+              static_cast<unsigned>(__days >= -4 ? (__days+4) % 7 : (__days+5) % 7 + 6)
+           );
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const weekday& __lhs, const weekday& __rhs) noexcept
+{ return __lhs.c_encoding() == __rhs.c_encoding(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator!=(const weekday& __lhs, const weekday& __rhs) noexcept
+{ return !(__lhs == __rhs); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator< (const weekday& __lhs, const weekday& __rhs) noexcept
+{ return __lhs.c_encoding() < __rhs.c_encoding(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator> (const weekday& __lhs, const weekday& __rhs) noexcept
+{ return __rhs < __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator<=(const weekday& __lhs, const weekday& __rhs) noexcept
+{ return !(__rhs < __lhs);}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator>=(const weekday& __lhs, const weekday& __rhs) noexcept
+{ return !(__lhs < __rhs); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+weekday operator+(const weekday& __lhs, const days& __rhs) noexcept
+{
+    auto const __mu = static_cast<long long>(__lhs.c_encoding()) + __rhs.count();
+    auto const __yr = (__mu >= 0 ? __mu : __mu - 6) / 7;
+    return weekday{static_cast<unsigned>(__mu - __yr * 7)};
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+weekday operator+(const days& __lhs, const weekday& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+weekday operator-(const weekday& __lhs, const days& __rhs) noexcept
+{ return __lhs + -__rhs; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+days operator-(const weekday& __lhs, const weekday& __rhs) noexcept
+{
+    const int __wdu = __lhs.c_encoding() - __rhs.c_encoding();
+    const int __wk = (__wdu >= 0 ? __wdu : __wdu-6) / 7;
+    return days{__wdu - __wk * 7};
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+weekday& weekday::operator+=(const days& __dd) noexcept
+{ *this = *this + __dd; return *this; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+weekday& weekday::operator-=(const days& __dd) noexcept
+{ *this = *this - __dd; return *this; }
+
+class weekday_indexed {
+private:
+    chrono::weekday __wd_;
+    unsigned char   __idx_;
+public:
+    _LIBCPP_HIDE_FROM_ABI weekday_indexed() = default;
+    _LIBCPP_HIDE_FROM_ABI inline constexpr weekday_indexed(const chrono::weekday& __wdval, unsigned __idxval) noexcept
+        : __wd_{__wdval}, __idx_(__idxval) {}
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::weekday weekday() const noexcept { return __wd_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr unsigned                 index() const noexcept { return __idx_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr bool ok() const noexcept { return __wd_.ok() && __idx_ >= 1 && __idx_ <= 5; }
+};
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const weekday_indexed& __lhs, const weekday_indexed& __rhs) noexcept
+{ return __lhs.weekday() == __rhs.weekday() && __lhs.index() == __rhs.index(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator!=(const weekday_indexed& __lhs, const weekday_indexed& __rhs) noexcept
+{ return !(__lhs == __rhs); }
+
+
+class weekday_last {
+private:
+    chrono::weekday __wd_;
+public:
+    _LIBCPP_HIDE_FROM_ABI explicit constexpr weekday_last(const chrono::weekday& __val) noexcept
+        : __wd_{__val} {}
+    _LIBCPP_HIDE_FROM_ABI constexpr chrono::weekday weekday() const noexcept { return __wd_; }
+    _LIBCPP_HIDE_FROM_ABI constexpr bool ok() const noexcept { return __wd_.ok(); }
+};
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const weekday_last& __lhs, const weekday_last& __rhs) noexcept
+{ return __lhs.weekday() == __rhs.weekday(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator!=(const weekday_last& __lhs, const weekday_last& __rhs) noexcept
+{ return !(__lhs == __rhs); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+weekday_indexed weekday::operator[](unsigned __index) const noexcept { return weekday_indexed{*this, __index}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+weekday_last weekday::operator[](last_spec) const noexcept { return weekday_last{*this}; }
+
+
+inline constexpr weekday   Sunday{0};
+inline constexpr weekday   Monday{1};
+inline constexpr weekday   Tuesday{2};
+inline constexpr weekday   Wednesday{3};
+inline constexpr weekday   Thursday{4};
+inline constexpr weekday   Friday{5};
+inline constexpr weekday   Saturday{6};
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___CHRONO_WEEKDAY_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/year.h b/app/src/main/cpp/libcxx/include/__chrono/year.h
new file mode 100644
index 0000000..79ee8a0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/year.h
@@ -0,0 +1,102 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_YEAR_H
+#define _LIBCPP___CHRONO_YEAR_H
+
+#include <__chrono/duration.h>
+#include <__config>
+#include <compare>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+class year {
+private:
+    short __y_;
+public:
+    _LIBCPP_HIDE_FROM_ABI year() = default;
+    _LIBCPP_HIDE_FROM_ABI explicit inline constexpr year(int __val) noexcept : __y_(static_cast<short>(__val)) {}
+
+    _LIBCPP_HIDE_FROM_ABI inline constexpr year& operator++()    noexcept { ++__y_; return *this; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr year  operator++(int) noexcept { year __tmp = *this; ++(*this); return __tmp; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr year& operator--()    noexcept { --__y_; return *this; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr year  operator--(int) noexcept { year __tmp = *this; --(*this); return __tmp; }
+    _LIBCPP_HIDE_FROM_ABI        constexpr year& operator+=(const years& __dy) noexcept;
+    _LIBCPP_HIDE_FROM_ABI        constexpr year& operator-=(const years& __dy) noexcept;
+    _LIBCPP_HIDE_FROM_ABI inline constexpr year operator+() const noexcept { return *this; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr year operator-() const noexcept { return year{-__y_}; }
+
+    _LIBCPP_HIDE_FROM_ABI inline constexpr bool is_leap() const noexcept { return __y_ % 4 == 0 && (__y_ % 100 != 0 || __y_ % 400 == 0); }
+    _LIBCPP_HIDE_FROM_ABI explicit inline constexpr operator int() const noexcept { return __y_; }
+    _LIBCPP_HIDE_FROM_ABI        constexpr bool ok() const noexcept;
+    _LIBCPP_HIDE_FROM_ABI static inline constexpr year min() noexcept { return year{-32767}; }
+    _LIBCPP_HIDE_FROM_ABI static inline constexpr year max() noexcept { return year{ 32767}; }
+};
+
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const year& __lhs, const year& __rhs) noexcept
+{ return static_cast<int>(__lhs) == static_cast<int>(__rhs); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr strong_ordering operator<=>(const year& __lhs, const year& __rhs) noexcept {
+    return static_cast<int>(__lhs) <=> static_cast<int>(__rhs);
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year operator+ (const year& __lhs, const years& __rhs) noexcept
+{ return year(static_cast<int>(__lhs) + __rhs.count()); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year operator+ (const years& __lhs, const year& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year operator- (const year& __lhs, const years& __rhs) noexcept
+{ return __lhs + -__rhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+years operator-(const year& __lhs, const year& __rhs) noexcept
+{ return years{static_cast<int>(__lhs) - static_cast<int>(__rhs)}; }
+
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year& year::operator+=(const years& __dy) noexcept
+{ *this = *this + __dy; return *this; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year& year::operator-=(const years& __dy) noexcept
+{ *this = *this - __dy; return *this; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr bool year::ok() const noexcept {
+  static_assert(static_cast<int>(std::numeric_limits<decltype(__y_)>::max()) == static_cast<int>(max()));
+  return static_cast<int>(min()) <= __y_;
+}
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___CHRONO_YEAR_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/year_month.h b/app/src/main/cpp/libcxx/include/__chrono/year_month.h
new file mode 100644
index 0000000..9f1e65c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/year_month.h
@@ -0,0 +1,101 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_YEAR_MONTH_H
+#define _LIBCPP___CHRONO_YEAR_MONTH_H
+
+#include <__chrono/duration.h>
+#include <__chrono/month.h>
+#include <__chrono/year.h>
+#include <__config>
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+class year_month {
+    chrono::year  __y_;
+    chrono::month __m_;
+public:
+    _LIBCPP_HIDE_FROM_ABI year_month() = default;
+    _LIBCPP_HIDE_FROM_ABI constexpr year_month(const chrono::year& __yval, const chrono::month& __mval) noexcept
+        : __y_{__yval}, __m_{__mval} {}
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::year  year()  const noexcept { return __y_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::month month() const noexcept { return __m_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr year_month& operator+=(const months& __dm) noexcept { this->__m_ += __dm; return *this; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr year_month& operator-=(const months& __dm) noexcept { this->__m_ -= __dm; return *this; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr year_month& operator+=(const years& __dy)  noexcept { this->__y_ += __dy; return *this; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr year_month& operator-=(const years& __dy)  noexcept { this->__y_ -= __dy; return *this; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr bool ok() const noexcept { return __y_.ok() && __m_.ok(); }
+};
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month operator/(const year& __y, const month& __m) noexcept { return year_month{__y, __m}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month operator/(const year& __y, int __m) noexcept { return year_month{__y, month(__m)}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const year_month& __lhs, const year_month& __rhs) noexcept
+{ return __lhs.year() == __rhs.year() && __lhs.month() == __rhs.month(); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr strong_ordering operator<=>(const year_month& __lhs, const year_month& __rhs) noexcept {
+    if (auto __c = __lhs.year() <=> __rhs.year(); __c != 0)
+      return __c;
+    return __lhs.month() <=> __rhs.month();
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+year_month operator+(const year_month& __lhs, const months& __rhs) noexcept
+{
+    int __dmi = static_cast<int>(static_cast<unsigned>(__lhs.month())) - 1 + __rhs.count();
+    const int __dy = (__dmi >= 0 ? __dmi : __dmi-11) / 12;
+    __dmi = __dmi - __dy * 12 + 1;
+    return (__lhs.year() + years(__dy)) / month(static_cast<unsigned>(__dmi));
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+year_month operator+(const months& __lhs, const year_month& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+year_month operator+(const year_month& __lhs, const years& __rhs) noexcept
+{ return (__lhs.year() + __rhs) / __lhs.month(); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+year_month operator+(const years& __lhs, const year_month& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+months operator-(const year_month& __lhs, const year_month& __rhs) noexcept
+{ return (__lhs.year() - __rhs.year()) + months(static_cast<unsigned>(__lhs.month()) - static_cast<unsigned>(__rhs.month())); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+year_month operator-(const year_month& __lhs, const months& __rhs) noexcept
+{ return __lhs + -__rhs; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr
+year_month operator-(const year_month& __lhs, const years& __rhs) noexcept
+{ return __lhs + -__rhs; }
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___CHRONO_YEAR_MONTH_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/year_month_day.h b/app/src/main/cpp/libcxx/include/__chrono/year_month_day.h
new file mode 100644
index 0000000..b749014
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/year_month_day.h
@@ -0,0 +1,307 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_YEAR_MONTH_DAY_H
+#define _LIBCPP___CHRONO_YEAR_MONTH_DAY_H
+
+#include <__chrono/calendar.h>
+#include <__chrono/day.h>
+#include <__chrono/duration.h>
+#include <__chrono/month.h>
+#include <__chrono/monthday.h>
+#include <__chrono/system_clock.h>
+#include <__chrono/time_point.h>
+#include <__chrono/year.h>
+#include <__chrono/year_month.h>
+#include <__config>
+#include <compare>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+class year_month_day_last;
+
+class year_month_day {
+private:
+    chrono::year  __y_;
+    chrono::month __m_;
+    chrono::day   __d_;
+public:
+     _LIBCPP_HIDE_FROM_ABI year_month_day() = default;
+     _LIBCPP_HIDE_FROM_ABI inline constexpr year_month_day(
+            const chrono::year& __yval, const chrono::month& __mval, const chrono::day& __dval) noexcept
+            : __y_{__yval}, __m_{__mval}, __d_{__dval} {}
+     _LIBCPP_HIDE_FROM_ABI        constexpr year_month_day(const year_month_day_last& __ymdl) noexcept;
+     _LIBCPP_HIDE_FROM_ABI inline constexpr year_month_day(const sys_days& __sysd) noexcept
+            : year_month_day(__from_days(__sysd.time_since_epoch())) {}
+     _LIBCPP_HIDE_FROM_ABI inline explicit constexpr year_month_day(const local_days& __locd) noexcept
+            : year_month_day(__from_days(__locd.time_since_epoch())) {}
+
+     _LIBCPP_HIDE_FROM_ABI        constexpr year_month_day& operator+=(const months& __dm) noexcept;
+     _LIBCPP_HIDE_FROM_ABI        constexpr year_month_day& operator-=(const months& __dm) noexcept;
+     _LIBCPP_HIDE_FROM_ABI        constexpr year_month_day& operator+=(const years& __dy)  noexcept;
+     _LIBCPP_HIDE_FROM_ABI        constexpr year_month_day& operator-=(const years& __dy)  noexcept;
+
+     _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::year   year() const noexcept { return __y_; }
+     _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::month month() const noexcept { return __m_; }
+     _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::day     day() const noexcept { return __d_; }
+     _LIBCPP_HIDE_FROM_ABI inline constexpr operator   sys_days() const noexcept          { return   sys_days{__to_days()}; }
+     _LIBCPP_HIDE_FROM_ABI inline explicit constexpr operator local_days() const noexcept { return local_days{__to_days()}; }
+
+     _LIBCPP_HIDE_FROM_ABI        constexpr bool             ok() const noexcept;
+
+     _LIBCPP_HIDE_FROM_ABI static constexpr year_month_day __from_days(days __d) noexcept;
+     _LIBCPP_HIDE_FROM_ABI constexpr days __to_days() const noexcept;
+};
+
+
+// https://howardhinnant.github.io/date_algorithms.html#civil_from_days
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day year_month_day::__from_days(days __d) noexcept
+{
+    static_assert(numeric_limits<unsigned>::digits >= 18, "");
+    static_assert(numeric_limits<int>::digits >= 20     , "");
+    const int      __z = __d.count() + 719468;
+    const int      __era = (__z >= 0 ? __z : __z - 146096) / 146097;
+    const unsigned __doe = static_cast<unsigned>(__z - __era * 146097);              // [0, 146096]
+    const unsigned __yoe = (__doe - __doe/1460 + __doe/36524 - __doe/146096) / 365;  // [0, 399]
+    const int      __yr = static_cast<int>(__yoe) + __era * 400;
+    const unsigned __doy = __doe - (365 * __yoe + __yoe/4 - __yoe/100);              // [0, 365]
+    const unsigned __mp = (5 * __doy + 2)/153;                                       // [0, 11]
+    const unsigned __dy = __doy - (153 * __mp + 2)/5 + 1;                            // [1, 31]
+    const unsigned __mth = __mp + (__mp < 10 ? 3 : -9);                              // [1, 12]
+    return year_month_day{chrono::year{__yr + (__mth <= 2)}, chrono::month{__mth}, chrono::day{__dy}};
+}
+
+// https://howardhinnant.github.io/date_algorithms.html#days_from_civil
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+days year_month_day::__to_days() const noexcept
+{
+    static_assert(numeric_limits<unsigned>::digits >= 18, "");
+    static_assert(numeric_limits<int>::digits >= 20     , "");
+
+    const int      __yr  = static_cast<int>(__y_) - (__m_ <= February);
+    const unsigned __mth = static_cast<unsigned>(__m_);
+    const unsigned __dy  = static_cast<unsigned>(__d_);
+
+    const int      __era = (__yr >= 0 ? __yr : __yr - 399) / 400;
+    const unsigned __yoe = static_cast<unsigned>(__yr - __era * 400);                // [0, 399]
+    const unsigned __doy = (153 * (__mth + (__mth > 2 ? -3 : 9)) + 2) / 5 + __dy-1;  // [0, 365]
+    const unsigned __doe = __yoe * 365 + __yoe/4 - __yoe/100 + __doy;                // [0, 146096]
+    return days{__era * 146097 + static_cast<int>(__doe) - 719468};
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const year_month_day& __lhs, const year_month_day& __rhs) noexcept
+{ return __lhs.year() == __rhs.year() && __lhs.month() == __rhs.month() && __lhs.day() == __rhs.day(); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr strong_ordering
+operator<=>(const year_month_day& __lhs, const year_month_day& __rhs) noexcept {
+    if (auto __c = __lhs.year() <=> __rhs.year(); __c != 0)
+      return __c;
+    if (auto __c = __lhs.month() <=> __rhs.month(); __c != 0)
+      return __c;
+    return __lhs.day() <=> __rhs.day();
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day operator/(const year_month& __lhs, const day& __rhs) noexcept
+{ return year_month_day{__lhs.year(), __lhs.month(), __rhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day operator/(const year_month& __lhs, int __rhs) noexcept
+{ return __lhs / day(__rhs); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day operator/(const year& __lhs, const month_day& __rhs) noexcept
+{ return __lhs / __rhs.month() / __rhs.day(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day operator/(int __lhs, const month_day& __rhs) noexcept
+{ return year(__lhs) / __rhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day operator/(const month_day& __lhs, const year& __rhs) noexcept
+{ return __rhs / __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day operator/(const month_day& __lhs, int __rhs) noexcept
+{ return year(__rhs) / __lhs; }
+
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day operator+(const year_month_day& __lhs, const months& __rhs) noexcept
+{ return (__lhs.year()/__lhs.month() + __rhs)/__lhs.day(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day operator+(const months& __lhs, const year_month_day& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day operator-(const year_month_day& __lhs, const months& __rhs) noexcept
+{ return __lhs + -__rhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day operator+(const year_month_day& __lhs, const years& __rhs) noexcept
+{ return (__lhs.year() + __rhs) / __lhs.month() / __lhs.day(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day operator+(const years& __lhs, const year_month_day& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day operator-(const year_month_day& __lhs, const years& __rhs) noexcept
+{ return __lhs + -__rhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_day& year_month_day::operator+=(const months& __dm) noexcept { *this = *this + __dm; return *this; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_day& year_month_day::operator-=(const months& __dm) noexcept { *this = *this - __dm; return *this; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_day& year_month_day::operator+=(const years& __dy)  noexcept { *this = *this + __dy; return *this; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_day& year_month_day::operator-=(const years& __dy)  noexcept { *this = *this - __dy; return *this; }
+
+class year_month_day_last {
+private:
+    chrono::year           __y_;
+    chrono::month_day_last __mdl_;
+public:
+     _LIBCPP_HIDE_FROM_ABI constexpr year_month_day_last(const year& __yval, const month_day_last& __mdlval) noexcept
+        : __y_{__yval}, __mdl_{__mdlval} {}
+
+     _LIBCPP_HIDE_FROM_ABI constexpr year_month_day_last& operator+=(const months& __m) noexcept;
+     _LIBCPP_HIDE_FROM_ABI constexpr year_month_day_last& operator-=(const months& __m) noexcept;
+     _LIBCPP_HIDE_FROM_ABI constexpr year_month_day_last& operator+=(const years& __y)  noexcept;
+     _LIBCPP_HIDE_FROM_ABI constexpr year_month_day_last& operator-=(const years& __y)  noexcept;
+
+     _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::year                     year() const noexcept { return __y_; }
+     _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::month                   month() const noexcept { return __mdl_.month(); }
+     _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::month_day_last month_day_last() const noexcept { return __mdl_; }
+     _LIBCPP_HIDE_FROM_ABI        constexpr chrono::day                       day() const noexcept;
+     _LIBCPP_HIDE_FROM_ABI inline constexpr operator                     sys_days() const noexcept { return   sys_days{year()/month()/day()}; }
+     _LIBCPP_HIDE_FROM_ABI inline explicit constexpr operator          local_days() const noexcept { return local_days{year()/month()/day()}; }
+     _LIBCPP_HIDE_FROM_ABI inline constexpr bool                               ok() const noexcept { return __y_.ok() && __mdl_.ok(); }
+};
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+chrono::day year_month_day_last::day() const noexcept
+{
+    constexpr chrono::day __d[] =
+    {
+        chrono::day(31), chrono::day(28), chrono::day(31),
+        chrono::day(30), chrono::day(31), chrono::day(30),
+        chrono::day(31), chrono::day(31), chrono::day(30),
+        chrono::day(31), chrono::day(30), chrono::day(31)
+    };
+    return (month() != February || !__y_.is_leap()) && month().ok() ?
+        __d[static_cast<unsigned>(month()) - 1] : chrono::day{29};
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const year_month_day_last& __lhs, const year_month_day_last& __rhs) noexcept
+{ return __lhs.year() == __rhs.year() && __lhs.month_day_last() == __rhs.month_day_last(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator!=(const year_month_day_last& __lhs, const year_month_day_last& __rhs) noexcept
+{ return !(__lhs == __rhs); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator< (const year_month_day_last& __lhs, const year_month_day_last& __rhs) noexcept
+{
+    if (__lhs.year() < __rhs.year()) return true;
+    if (__lhs.year() > __rhs.year()) return false;
+    return __lhs.month_day_last() < __rhs.month_day_last();
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator> (const year_month_day_last& __lhs, const year_month_day_last& __rhs) noexcept
+{ return __rhs < __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator<=(const year_month_day_last& __lhs, const year_month_day_last& __rhs) noexcept
+{ return !(__rhs < __lhs);}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator>=(const year_month_day_last& __lhs, const year_month_day_last& __rhs) noexcept
+{ return !(__lhs < __rhs); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day_last operator/(const year_month& __lhs, last_spec) noexcept
+{ return year_month_day_last{__lhs.year(), month_day_last{__lhs.month()}}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day_last operator/(const year& __lhs, const month_day_last& __rhs) noexcept
+{ return year_month_day_last{__lhs, __rhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day_last operator/(int __lhs, const month_day_last& __rhs) noexcept
+{ return year_month_day_last{year{__lhs}, __rhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_day_last
+operator/(const month_day_last& __lhs, const year& __rhs) noexcept
+{ return __rhs / __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day_last operator/(const month_day_last& __lhs, int __rhs) noexcept
+{ return year{__rhs} / __lhs; }
+
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day_last operator+(const year_month_day_last& __lhs, const months& __rhs) noexcept
+{ return (__lhs.year() / __lhs.month() + __rhs) / last; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day_last operator+(const months& __lhs, const year_month_day_last& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day_last operator-(const year_month_day_last& __lhs, const months& __rhs) noexcept
+{ return __lhs + (-__rhs); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day_last operator+(const year_month_day_last& __lhs, const years& __rhs) noexcept
+{ return year_month_day_last{__lhs.year() + __rhs, __lhs.month_day_last()}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day_last operator+(const years& __lhs, const year_month_day_last& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day_last operator-(const year_month_day_last& __lhs, const years& __rhs) noexcept
+{ return __lhs + (-__rhs); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_day_last& year_month_day_last::operator+=(const months& __dm) noexcept { *this = *this + __dm; return *this; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_day_last& year_month_day_last::operator-=(const months& __dm) noexcept { *this = *this - __dm; return *this; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_day_last& year_month_day_last::operator+=(const years& __dy)  noexcept { *this = *this + __dy; return *this; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_day_last& year_month_day_last::operator-=(const years& __dy)  noexcept { *this = *this - __dy; return *this; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_day::year_month_day(const year_month_day_last& __ymdl) noexcept
+    : __y_{__ymdl.year()}, __m_{__ymdl.month()}, __d_{__ymdl.day()} {}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool year_month_day::ok() const noexcept
+{
+    if (!__y_.ok() || !__m_.ok()) return false;
+    return chrono::day{1} <= __d_ && __d_ <= (__y_ / __m_ / last).day();
+}
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___CHRONO_YEAR_MONTH_DAY_H
diff --git a/app/src/main/cpp/libcxx/include/__chrono/year_month_weekday.h b/app/src/main/cpp/libcxx/include/__chrono/year_month_weekday.h
new file mode 100644
index 0000000..6604dea
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__chrono/year_month_weekday.h
@@ -0,0 +1,255 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CHRONO_YEAR_MONTH_WEEKDAY_H
+#define _LIBCPP___CHRONO_YEAR_MONTH_WEEKDAY_H
+
+#include <__chrono/calendar.h>
+#include <__chrono/day.h>
+#include <__chrono/duration.h>
+#include <__chrono/month.h>
+#include <__chrono/month_weekday.h>
+#include <__chrono/system_clock.h>
+#include <__chrono/time_point.h>
+#include <__chrono/weekday.h>
+#include <__chrono/year.h>
+#include <__chrono/year_month.h>
+#include <__chrono/year_month_day.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace chrono
+{
+
+class year_month_weekday {
+    chrono::year            __y_;
+    chrono::month           __m_;
+    chrono::weekday_indexed __wdi_;
+public:
+    _LIBCPP_HIDE_FROM_ABI year_month_weekday() = default;
+    _LIBCPP_HIDE_FROM_ABI constexpr year_month_weekday(const chrono::year& __yval, const chrono::month& __mval,
+                               const chrono::weekday_indexed& __wdival) noexcept
+        : __y_{__yval}, __m_{__mval}, __wdi_{__wdival} {}
+    _LIBCPP_HIDE_FROM_ABI constexpr year_month_weekday(const sys_days& __sysd) noexcept
+            : year_month_weekday(__from_days(__sysd.time_since_epoch())) {}
+    _LIBCPP_HIDE_FROM_ABI inline explicit constexpr year_month_weekday(const local_days& __locd) noexcept
+            : year_month_weekday(__from_days(__locd.time_since_epoch())) {}
+    _LIBCPP_HIDE_FROM_ABI constexpr year_month_weekday& operator+=(const months&) noexcept;
+    _LIBCPP_HIDE_FROM_ABI constexpr year_month_weekday& operator-=(const months&) noexcept;
+    _LIBCPP_HIDE_FROM_ABI constexpr year_month_weekday& operator+=(const years&)  noexcept;
+    _LIBCPP_HIDE_FROM_ABI constexpr year_month_weekday& operator-=(const years&)  noexcept;
+
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::year                       year() const noexcept { return __y_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::month                     month() const noexcept { return __m_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::weekday                 weekday() const noexcept { return __wdi_.weekday(); }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr unsigned                          index() const noexcept { return __wdi_.index(); }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::weekday_indexed weekday_indexed() const noexcept { return __wdi_; }
+
+    _LIBCPP_HIDE_FROM_ABI inline constexpr                       operator sys_days() const noexcept { return   sys_days{__to_days()}; }
+    _LIBCPP_HIDE_FROM_ABI inline explicit constexpr operator            local_days() const noexcept { return local_days{__to_days()}; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr bool ok() const noexcept
+    {
+        if (!__y_.ok() || !__m_.ok() || !__wdi_.ok()) return false;
+        if (__wdi_.index() <= 4) return true;
+        auto __nth_weekday_day =
+            __wdi_.weekday() -
+            chrono::weekday{static_cast<sys_days>(__y_ / __m_ / 1)} +
+            days{(__wdi_.index() - 1) * 7 + 1};
+        return static_cast<unsigned>(__nth_weekday_day.count()) <=
+               static_cast<unsigned>((__y_ / __m_ / last).day());
+    }
+
+    _LIBCPP_HIDE_FROM_ABI static constexpr year_month_weekday __from_days(days __d) noexcept;
+    _LIBCPP_HIDE_FROM_ABI constexpr days __to_days() const noexcept;
+};
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday year_month_weekday::__from_days(days __d) noexcept
+{
+    const sys_days      __sysd{__d};
+    const chrono::weekday __wd = chrono::weekday(__sysd);
+    const year_month_day __ymd = year_month_day(__sysd);
+    return year_month_weekday{__ymd.year(), __ymd.month(),
+                              __wd[(static_cast<unsigned>(__ymd.day())-1)/7+1]};
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+days year_month_weekday::__to_days() const noexcept
+{
+    const sys_days __sysd = sys_days(__y_/__m_/1);
+    return (__sysd + (__wdi_.weekday() - chrono::weekday(__sysd) + days{(__wdi_.index()-1)*7}))
+                .time_since_epoch();
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const year_month_weekday& __lhs, const year_month_weekday& __rhs) noexcept
+{ return __lhs.year() == __rhs.year() && __lhs.month() == __rhs.month() && __lhs.weekday_indexed() == __rhs.weekday_indexed(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator!=(const year_month_weekday& __lhs, const year_month_weekday& __rhs) noexcept
+{ return !(__lhs == __rhs); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday operator/(const year_month& __lhs, const weekday_indexed& __rhs) noexcept
+{ return year_month_weekday{__lhs.year(), __lhs.month(), __rhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday operator/(const year& __lhs, const month_weekday& __rhs) noexcept
+{ return year_month_weekday{__lhs, __rhs.month(), __rhs.weekday_indexed()}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday operator/(int __lhs, const month_weekday& __rhs) noexcept
+{ return year(__lhs) / __rhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday operator/(const month_weekday& __lhs, const year& __rhs) noexcept
+{ return __rhs / __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday operator/(const month_weekday& __lhs, int __rhs) noexcept
+{ return year(__rhs) / __lhs; }
+
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday operator+(const year_month_weekday& __lhs, const months& __rhs) noexcept
+{ return (__lhs.year() / __lhs.month() + __rhs) / __lhs.weekday_indexed(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday operator+(const months& __lhs, const year_month_weekday& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday operator-(const year_month_weekday& __lhs, const months& __rhs) noexcept
+{ return __lhs + (-__rhs); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday operator+(const year_month_weekday& __lhs, const years& __rhs) noexcept
+{ return year_month_weekday{__lhs.year() + __rhs, __lhs.month(), __lhs.weekday_indexed()}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday operator+(const years& __lhs, const year_month_weekday& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday operator-(const year_month_weekday& __lhs, const years& __rhs) noexcept
+{ return __lhs + (-__rhs); }
+
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_weekday& year_month_weekday::operator+=(const months& __dm) noexcept { *this = *this + __dm; return *this; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_weekday& year_month_weekday::operator-=(const months& __dm) noexcept { *this = *this - __dm; return *this; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_weekday& year_month_weekday::operator+=(const years& __dy)  noexcept { *this = *this + __dy; return *this; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_weekday& year_month_weekday::operator-=(const years& __dy)  noexcept { *this = *this - __dy; return *this; }
+
+class year_month_weekday_last {
+private:
+    chrono::year         __y_;
+    chrono::month        __m_;
+    chrono::weekday_last __wdl_;
+public:
+    _LIBCPP_HIDE_FROM_ABI constexpr year_month_weekday_last(const chrono::year& __yval, const chrono::month& __mval,
+                                      const chrono::weekday_last& __wdlval) noexcept
+                : __y_{__yval}, __m_{__mval}, __wdl_{__wdlval} {}
+    _LIBCPP_HIDE_FROM_ABI constexpr year_month_weekday_last& operator+=(const months& __dm) noexcept;
+    _LIBCPP_HIDE_FROM_ABI constexpr year_month_weekday_last& operator-=(const months& __dm) noexcept;
+    _LIBCPP_HIDE_FROM_ABI constexpr year_month_weekday_last& operator+=(const years& __dy)  noexcept;
+    _LIBCPP_HIDE_FROM_ABI constexpr year_month_weekday_last& operator-=(const years& __dy)  noexcept;
+
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::year                 year() const noexcept { return __y_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::month               month() const noexcept { return __m_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::weekday           weekday() const noexcept { return __wdl_.weekday(); }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr chrono::weekday_last weekday_last() const noexcept { return __wdl_; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr operator                 sys_days() const noexcept { return   sys_days{__to_days()}; }
+    _LIBCPP_HIDE_FROM_ABI inline explicit constexpr operator      local_days() const noexcept { return local_days{__to_days()}; }
+    _LIBCPP_HIDE_FROM_ABI inline constexpr bool ok() const noexcept { return __y_.ok() && __m_.ok() && __wdl_.ok(); }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr days __to_days() const noexcept;
+
+};
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+days year_month_weekday_last::__to_days() const noexcept
+{
+    const sys_days __last = sys_days{__y_/__m_/last};
+    return (__last - (chrono::weekday{__last} - __wdl_.weekday())).time_since_epoch();
+
+}
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator==(const year_month_weekday_last& __lhs, const year_month_weekday_last& __rhs) noexcept
+{ return __lhs.year() == __rhs.year() && __lhs.month() == __rhs.month() && __lhs.weekday_last() == __rhs.weekday_last(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+bool operator!=(const year_month_weekday_last& __lhs, const year_month_weekday_last& __rhs) noexcept
+{ return !(__lhs == __rhs); }
+
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday_last operator/(const year_month& __lhs, const weekday_last& __rhs) noexcept
+{ return year_month_weekday_last{__lhs.year(), __lhs.month(), __rhs}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday_last operator/(const year& __lhs, const month_weekday_last& __rhs) noexcept
+{ return year_month_weekday_last{__lhs, __rhs.month(), __rhs.weekday_last()}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday_last operator/(int __lhs, const month_weekday_last& __rhs) noexcept
+{ return year(__lhs) / __rhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday_last operator/(const month_weekday_last& __lhs, const year& __rhs) noexcept
+{ return __rhs / __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday_last operator/(const month_weekday_last& __lhs, int __rhs) noexcept
+{ return year(__rhs) / __lhs; }
+
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday_last operator+(const year_month_weekday_last& __lhs, const months& __rhs) noexcept
+{ return (__lhs.year() / __lhs.month() + __rhs) / __lhs.weekday_last(); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday_last operator+(const months& __lhs, const year_month_weekday_last& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday_last operator-(const year_month_weekday_last& __lhs, const months& __rhs) noexcept
+{ return __lhs + (-__rhs); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday_last operator+(const year_month_weekday_last& __lhs, const years& __rhs) noexcept
+{ return year_month_weekday_last{__lhs.year() + __rhs, __lhs.month(), __lhs.weekday_last()}; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday_last operator+(const years& __lhs, const year_month_weekday_last& __rhs) noexcept
+{ return __rhs + __lhs; }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr
+year_month_weekday_last operator-(const year_month_weekday_last& __lhs, const years& __rhs) noexcept
+{ return __lhs + (-__rhs); }
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_weekday_last& year_month_weekday_last::operator+=(const months& __dm) noexcept { *this = *this + __dm; return *this; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_weekday_last& year_month_weekday_last::operator-=(const months& __dm) noexcept { *this = *this - __dm; return *this; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_weekday_last& year_month_weekday_last::operator+=(const years& __dy)  noexcept { *this = *this + __dy; return *this; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr year_month_weekday_last& year_month_weekday_last::operator-=(const years& __dy)  noexcept { *this = *this - __dy; return *this; }
+
+} // namespace chrono
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___CHRONO_YEAR_MONTH_WEEKDAY_H
diff --git a/app/src/main/cpp/libcxx/include/__compare/common_comparison_category.h b/app/src/main/cpp/libcxx/include/__compare/common_comparison_category.h
new file mode 100644
index 0000000..06c4b28
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/common_comparison_category.h
@@ -0,0 +1,95 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_COMMON_COMPARISON_CATEGORY_H
+#define _LIBCPP___COMPARE_COMMON_COMPARISON_CATEGORY_H
+
+#include <__compare/ordering.h>
+#include <__config>
+#include <__type_traits/is_same.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace __comp_detail {
+
+enum _ClassifyCompCategory : unsigned {
+  _None,
+  _PartialOrd,
+  _WeakOrd,
+  _StrongOrd,
+  _CCC_Size
+};
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI
+constexpr _ClassifyCompCategory __type_to_enum() noexcept {
+  if (is_same_v<_Tp, partial_ordering>)
+    return _PartialOrd;
+  if (is_same_v<_Tp, weak_ordering>)
+    return _WeakOrd;
+  if (is_same_v<_Tp, strong_ordering>)
+    return _StrongOrd;
+  return _None;
+}
+
+template <size_t _Size>
+_LIBCPP_HIDE_FROM_ABI
+constexpr _ClassifyCompCategory
+__compute_comp_type(const _ClassifyCompCategory (&__types)[_Size]) {
+  int __seen[_CCC_Size] = {};
+  for (auto __type : __types)
+    ++__seen[__type];
+  if (__seen[_None])
+    return _None;
+  if (__seen[_PartialOrd])
+    return _PartialOrd;
+  if (__seen[_WeakOrd])
+    return _WeakOrd;
+  return _StrongOrd;
+}
+
+template <class ..._Ts, bool _False = false>
+_LIBCPP_HIDE_FROM_ABI
+constexpr auto __get_comp_type() {
+  using _CCC = _ClassifyCompCategory;
+  constexpr _CCC __type_kinds[] = {_StrongOrd, __type_to_enum<_Ts>()...};
+  constexpr _CCC _Cat = __comp_detail::__compute_comp_type(__type_kinds);
+  if constexpr (_Cat == _None)
+    return void();
+  else if constexpr (_Cat == _PartialOrd)
+    return partial_ordering::equivalent;
+  else if constexpr (_Cat == _WeakOrd)
+    return weak_ordering::equivalent;
+  else if constexpr (_Cat == _StrongOrd)
+    return strong_ordering::equivalent;
+  else
+    static_assert(_False, "unhandled case");
+}
+} // namespace __comp_detail
+
+// [cmp.common], common comparison category type
+template<class... _Ts>
+struct _LIBCPP_TEMPLATE_VIS common_comparison_category {
+  using type = decltype(__comp_detail::__get_comp_type<_Ts...>());
+};
+
+template<class... _Ts>
+using common_comparison_category_t = typename common_comparison_category<_Ts...>::type;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___COMPARE_COMMON_COMPARISON_CATEGORY_H
diff --git a/app/src/main/cpp/libcxx/include/__compare/compare_partial_order_fallback.h b/app/src/main/cpp/libcxx/include/__compare/compare_partial_order_fallback.h
new file mode 100644
index 0000000..06f03fe
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/compare_partial_order_fallback.h
@@ -0,0 +1,74 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_COMPARE_PARTIAL_ORDER_FALLBACK
+#define _LIBCPP___COMPARE_COMPARE_PARTIAL_ORDER_FALLBACK
+
+#include <__compare/ordering.h>
+#include <__compare/partial_order.h>
+#include <__config>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_same.h>
+#include <__utility/forward.h>
+#include <__utility/priority_tag.h>
+
+#ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [cmp.alg]
+namespace __compare_partial_order_fallback {
+    struct __fn {
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<1>)
+            noexcept(noexcept(_VSTD::partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
+            -> decltype(      _VSTD::partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))
+            { return          _VSTD::partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)); }
+
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)
+            noexcept(noexcept(_VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? partial_ordering::equivalent :
+                              _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? partial_ordering::less :
+                              _VSTD::forward<_Up>(__u) < _VSTD::forward<_Tp>(__t) ? partial_ordering::greater :
+                              partial_ordering::unordered))
+            -> decltype(      _VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? partial_ordering::equivalent :
+                              _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? partial_ordering::less :
+                              _VSTD::forward<_Up>(__u) < _VSTD::forward<_Tp>(__t) ? partial_ordering::greater :
+                              partial_ordering::unordered)
+        {
+            return            _VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? partial_ordering::equivalent :
+                              _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? partial_ordering::less :
+                              _VSTD::forward<_Up>(__u) < _VSTD::forward<_Tp>(__t) ? partial_ordering::greater :
+                              partial_ordering::unordered;
+        }
+
+        template<class _Tp, class _Up>
+        _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
+            noexcept(noexcept(__go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>())))
+            -> decltype(      __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>()))
+            { return          __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>()); }
+    };
+} // namespace __compare_partial_order_fallback
+
+inline namespace __cpo {
+    inline constexpr auto compare_partial_order_fallback = __compare_partial_order_fallback::__fn{};
+} // namespace __cpo
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___COMPARE_COMPARE_PARTIAL_ORDER_FALLBACK
diff --git a/app/src/main/cpp/libcxx/include/__compare/compare_strong_order_fallback.h b/app/src/main/cpp/libcxx/include/__compare/compare_strong_order_fallback.h
new file mode 100644
index 0000000..8693868
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/compare_strong_order_fallback.h
@@ -0,0 +1,71 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_COMPARE_STRONG_ORDER_FALLBACK
+#define _LIBCPP___COMPARE_COMPARE_STRONG_ORDER_FALLBACK
+
+#include <__compare/ordering.h>
+#include <__compare/strong_order.h>
+#include <__config>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_same.h>
+#include <__utility/forward.h>
+#include <__utility/priority_tag.h>
+
+#ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [cmp.alg]
+namespace __compare_strong_order_fallback {
+    struct __fn {
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<1>)
+            noexcept(noexcept(_VSTD::strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
+            -> decltype(      _VSTD::strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))
+            { return          _VSTD::strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)); }
+
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)
+            noexcept(noexcept(_VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? strong_ordering::equal :
+                              _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? strong_ordering::less :
+                              strong_ordering::greater))
+            -> decltype(      _VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? strong_ordering::equal :
+                              _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? strong_ordering::less :
+                              strong_ordering::greater)
+        {
+            return            _VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? strong_ordering::equal :
+                              _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? strong_ordering::less :
+                              strong_ordering::greater;
+        }
+
+        template<class _Tp, class _Up>
+        _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
+            noexcept(noexcept(__go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>())))
+            -> decltype(      __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>()))
+            { return          __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>()); }
+    };
+} // namespace __compare_strong_order_fallback
+
+inline namespace __cpo {
+    inline constexpr auto compare_strong_order_fallback = __compare_strong_order_fallback::__fn{};
+} // namespace __cpo
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___COMPARE_COMPARE_STRONG_ORDER_FALLBACK
diff --git a/app/src/main/cpp/libcxx/include/__compare/compare_three_way.h b/app/src/main/cpp/libcxx/include/__compare/compare_three_way.h
new file mode 100644
index 0000000..fdbba04
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/compare_three_way.h
@@ -0,0 +1,41 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_COMPARE_THREE_WAY_H
+#define _LIBCPP___COMPARE_COMPARE_THREE_WAY_H
+
+#include <__compare/three_way_comparable.h>
+#include <__config>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+struct _LIBCPP_TEMPLATE_VIS compare_three_way
+{
+    template<class _T1, class _T2>
+        requires three_way_comparable_with<_T1, _T2>
+    constexpr _LIBCPP_HIDE_FROM_ABI
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) <=> _VSTD::forward<_T2>(__u)))
+        { return          _VSTD::forward<_T1>(__t) <=> _VSTD::forward<_T2>(__u); }
+
+    using is_transparent = void;
+};
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___COMPARE_COMPARE_THREE_WAY_H
diff --git a/app/src/main/cpp/libcxx/include/__compare/compare_three_way_result.h b/app/src/main/cpp/libcxx/include/__compare/compare_three_way_result.h
new file mode 100644
index 0000000..8885d7e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/compare_three_way_result.h
@@ -0,0 +1,44 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_COMPARE_THREE_WAY_RESULT_H
+#define _LIBCPP___COMPARE_COMPARE_THREE_WAY_RESULT_H
+
+#include <__config>
+#include <__type_traits/make_const_lvalue_ref.h>
+#include <__utility/declval.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template<class, class, class>
+struct _LIBCPP_HIDE_FROM_ABI __compare_three_way_result { };
+
+template<class _Tp, class _Up>
+struct _LIBCPP_HIDE_FROM_ABI __compare_three_way_result<_Tp, _Up, decltype(
+  std::declval<__make_const_lvalue_ref<_Tp>>() <=> std::declval<__make_const_lvalue_ref<_Up>>(), void()
+)> {
+    using type = decltype(std::declval<__make_const_lvalue_ref<_Tp>>() <=> std::declval<__make_const_lvalue_ref<_Up>>());
+};
+
+template<class _Tp, class _Up = _Tp>
+struct _LIBCPP_TEMPLATE_VIS compare_three_way_result : __compare_three_way_result<_Tp, _Up, void> { };
+
+template<class _Tp, class _Up = _Tp>
+using compare_three_way_result_t = typename compare_three_way_result<_Tp, _Up>::type;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___COMPARE_COMPARE_THREE_WAY_RESULT_H
diff --git a/app/src/main/cpp/libcxx/include/__compare/compare_weak_order_fallback.h b/app/src/main/cpp/libcxx/include/__compare/compare_weak_order_fallback.h
new file mode 100644
index 0000000..f434dcb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/compare_weak_order_fallback.h
@@ -0,0 +1,71 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_COMPARE_WEAK_ORDER_FALLBACK
+#define _LIBCPP___COMPARE_COMPARE_WEAK_ORDER_FALLBACK
+
+#include <__compare/ordering.h>
+#include <__compare/weak_order.h>
+#include <__config>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_same.h>
+#include <__utility/forward.h>
+#include <__utility/priority_tag.h>
+
+#ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [cmp.alg]
+namespace __compare_weak_order_fallback {
+    struct __fn {
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<1>)
+            noexcept(noexcept(_VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
+            -> decltype(      _VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))
+            { return          _VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)); }
+
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)
+            noexcept(noexcept(_VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? weak_ordering::equivalent :
+                              _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? weak_ordering::less :
+                              weak_ordering::greater))
+            -> decltype(      _VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? weak_ordering::equivalent :
+                              _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? weak_ordering::less :
+                              weak_ordering::greater)
+        {
+            return            _VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? weak_ordering::equivalent :
+                              _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? weak_ordering::less :
+                              weak_ordering::greater;
+        }
+
+        template<class _Tp, class _Up>
+        _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
+            noexcept(noexcept(__go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>())))
+            -> decltype(      __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>()))
+            { return          __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>()); }
+    };
+} // namespace __compare_weak_order_fallback
+
+inline namespace __cpo {
+    inline constexpr auto compare_weak_order_fallback = __compare_weak_order_fallback::__fn{};
+} // namespace __cpo
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___COMPARE_COMPARE_WEAK_ORDER_FALLBACK
diff --git a/app/src/main/cpp/libcxx/include/__compare/is_eq.h b/app/src/main/cpp/libcxx/include/__compare/is_eq.h
new file mode 100644
index 0000000..4964892
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/is_eq.h
@@ -0,0 +1,34 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_IS_EQ_H
+#define _LIBCPP___COMPARE_IS_EQ_H
+
+#include <__compare/ordering.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr bool is_eq(partial_ordering __c) noexcept { return __c == 0; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr bool is_neq(partial_ordering __c) noexcept { return __c != 0; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr bool is_lt(partial_ordering __c) noexcept { return __c < 0; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr bool is_lteq(partial_ordering __c) noexcept { return __c <= 0; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr bool is_gt(partial_ordering __c) noexcept { return __c > 0; }
+_LIBCPP_HIDE_FROM_ABI inline constexpr bool is_gteq(partial_ordering __c) noexcept { return __c >= 0; }
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___COMPARE_IS_EQ_H
diff --git a/app/src/main/cpp/libcxx/include/__compare/ordering.h b/app/src/main/cpp/libcxx/include/__compare/ordering.h
new file mode 100644
index 0000000..ff148ab
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/ordering.h
@@ -0,0 +1,326 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_ORDERING_H
+#define _LIBCPP___COMPARE_ORDERING_H
+
+#include <__config>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_same.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// exposition only
+enum class _LIBCPP_ENUM_VIS _OrdResult : signed char {
+  __less = -1,
+  __equiv = 0,
+  __greater = 1
+};
+
+enum class _LIBCPP_ENUM_VIS _NCmpResult : signed char {
+  __unordered = -127
+};
+
+class partial_ordering;
+class weak_ordering;
+class strong_ordering;
+
+template<class _Tp, class... _Args>
+inline constexpr bool __one_of_v = (is_same_v<_Tp, _Args> || ...);
+
+struct _CmpUnspecifiedParam {
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEVAL
+  _CmpUnspecifiedParam(int _CmpUnspecifiedParam::*) noexcept {}
+
+  template<class _Tp, class = enable_if_t<!__one_of_v<_Tp, int, partial_ordering, weak_ordering, strong_ordering>>>
+  _CmpUnspecifiedParam(_Tp) = delete;
+};
+
+class partial_ordering {
+  using _ValueT = signed char;
+
+  _LIBCPP_HIDE_FROM_ABI
+  explicit constexpr partial_ordering(_OrdResult __v) noexcept
+      : __value_(_ValueT(__v)) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  explicit constexpr partial_ordering(_NCmpResult __v) noexcept
+      : __value_(_ValueT(__v)) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr bool __is_ordered() const noexcept {
+    return __value_ != _ValueT(_NCmpResult::__unordered);
+  }
+public:
+  // valid values
+  static const partial_ordering less;
+  static const partial_ordering equivalent;
+  static const partial_ordering greater;
+  static const partial_ordering unordered;
+
+  // comparisons
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(partial_ordering, partial_ordering) noexcept = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(partial_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v.__is_ordered() && __v.__value_ == 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator< (partial_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v.__is_ordered() && __v.__value_ < 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator<=(partial_ordering __v, _CmpUnspecifiedParam) noexcept  {
+    return __v.__is_ordered() && __v.__value_ <= 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator> (partial_ordering __v, _CmpUnspecifiedParam) noexcept  {
+    return __v.__is_ordered() && __v.__value_ > 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator>=(partial_ordering __v, _CmpUnspecifiedParam) noexcept  {
+    return __v.__is_ordered() && __v.__value_ >= 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator< (_CmpUnspecifiedParam, partial_ordering __v) noexcept  {
+    return __v.__is_ordered() && 0 < __v.__value_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator<=(_CmpUnspecifiedParam, partial_ordering __v) noexcept  {
+    return __v.__is_ordered() && 0 <= __v.__value_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator> (_CmpUnspecifiedParam, partial_ordering __v) noexcept  {
+    return __v.__is_ordered() && 0 > __v.__value_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator>=(_CmpUnspecifiedParam, partial_ordering __v) noexcept  {
+    return __v.__is_ordered() && 0 >= __v.__value_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr partial_ordering operator<=>(partial_ordering __v, _CmpUnspecifiedParam) noexcept  {
+    return __v;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr partial_ordering operator<=>(_CmpUnspecifiedParam, partial_ordering __v) noexcept  {
+    return __v < 0 ? partial_ordering::greater : (__v > 0 ? partial_ordering::less : __v);
+  }
+private:
+  _ValueT __value_;
+};
+
+inline constexpr partial_ordering partial_ordering::less(_OrdResult::__less);
+inline constexpr partial_ordering partial_ordering::equivalent(_OrdResult::__equiv);
+inline constexpr partial_ordering partial_ordering::greater(_OrdResult::__greater);
+inline constexpr partial_ordering partial_ordering::unordered(_NCmpResult ::__unordered);
+
+class weak_ordering {
+  using _ValueT = signed char;
+
+  _LIBCPP_HIDE_FROM_ABI
+  explicit constexpr weak_ordering(_OrdResult __v) noexcept : __value_(_ValueT(__v)) {}
+
+public:
+  static const weak_ordering less;
+  static const weak_ordering equivalent;
+  static const weak_ordering greater;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr operator partial_ordering() const noexcept {
+    return __value_ == 0 ? partial_ordering::equivalent
+        : (__value_ < 0 ? partial_ordering::less : partial_ordering::greater);
+  }
+
+  // comparisons
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(weak_ordering, weak_ordering) noexcept = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(weak_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v.__value_ == 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator< (weak_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v.__value_ < 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator<=(weak_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v.__value_ <= 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator> (weak_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v.__value_ > 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator>=(weak_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v.__value_ >= 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator< (_CmpUnspecifiedParam, weak_ordering __v) noexcept {
+    return 0 < __v.__value_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator<=(_CmpUnspecifiedParam, weak_ordering __v) noexcept {
+    return 0 <= __v.__value_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator> (_CmpUnspecifiedParam, weak_ordering __v) noexcept {
+    return 0 > __v.__value_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator>=(_CmpUnspecifiedParam, weak_ordering __v) noexcept {
+    return 0 >= __v.__value_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr weak_ordering operator<=>(weak_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr weak_ordering operator<=>(_CmpUnspecifiedParam, weak_ordering __v) noexcept {
+    return __v < 0 ? weak_ordering::greater : (__v > 0 ? weak_ordering::less : __v);
+  }
+
+private:
+  _ValueT __value_;
+};
+
+inline constexpr weak_ordering weak_ordering::less(_OrdResult::__less);
+inline constexpr weak_ordering weak_ordering::equivalent(_OrdResult::__equiv);
+inline constexpr weak_ordering weak_ordering::greater(_OrdResult::__greater);
+
+class strong_ordering {
+  using _ValueT = signed char;
+
+  _LIBCPP_HIDE_FROM_ABI
+  explicit constexpr strong_ordering(_OrdResult __v) noexcept : __value_(_ValueT(__v)) {}
+
+public:
+  static const strong_ordering less;
+  static const strong_ordering equal;
+  static const strong_ordering equivalent;
+  static const strong_ordering greater;
+
+  // conversions
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr operator partial_ordering() const noexcept {
+    return __value_ == 0 ? partial_ordering::equivalent
+        : (__value_ < 0 ? partial_ordering::less : partial_ordering::greater);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr operator weak_ordering() const noexcept {
+    return __value_ == 0 ? weak_ordering::equivalent
+        : (__value_ < 0 ? weak_ordering::less : weak_ordering::greater);
+  }
+
+  // comparisons
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(strong_ordering, strong_ordering) noexcept = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(strong_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v.__value_ == 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator< (strong_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v.__value_ < 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator<=(strong_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v.__value_ <= 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator> (strong_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v.__value_ > 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator>=(strong_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v.__value_ >= 0;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator< (_CmpUnspecifiedParam, strong_ordering __v) noexcept {
+    return 0 < __v.__value_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator<=(_CmpUnspecifiedParam, strong_ordering __v) noexcept {
+    return 0 <= __v.__value_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator> (_CmpUnspecifiedParam, strong_ordering __v) noexcept {
+    return 0 > __v.__value_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator>=(_CmpUnspecifiedParam, strong_ordering __v) noexcept {
+    return 0 >= __v.__value_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr strong_ordering operator<=>(strong_ordering __v, _CmpUnspecifiedParam) noexcept {
+    return __v;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr strong_ordering operator<=>(_CmpUnspecifiedParam, strong_ordering __v) noexcept {
+    return __v < 0 ? strong_ordering::greater : (__v > 0 ? strong_ordering::less : __v);
+  }
+
+private:
+  _ValueT __value_;
+};
+
+inline constexpr strong_ordering strong_ordering::less(_OrdResult::__less);
+inline constexpr strong_ordering strong_ordering::equal(_OrdResult::__equiv);
+inline constexpr strong_ordering strong_ordering::equivalent(_OrdResult::__equiv);
+inline constexpr strong_ordering strong_ordering::greater(_OrdResult::__greater);
+
+/// [cmp.categories.pre]/1
+/// The types partial_ordering, weak_ordering, and strong_ordering are
+/// collectively termed the comparison category types.
+template <class _Tp>
+concept __comparison_category = __one_of_v<_Tp, partial_ordering, weak_ordering, strong_ordering>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___COMPARE_ORDERING_H
diff --git a/app/src/main/cpp/libcxx/include/__compare/partial_order.h b/app/src/main/cpp/libcxx/include/__compare/partial_order.h
new file mode 100644
index 0000000..aee07eb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/partial_order.h
@@ -0,0 +1,74 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_PARTIAL_ORDER
+#define _LIBCPP___COMPARE_PARTIAL_ORDER
+
+#include <__compare/compare_three_way.h>
+#include <__compare/ordering.h>
+#include <__compare/weak_order.h>
+#include <__config>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_same.h>
+#include <__utility/forward.h>
+#include <__utility/priority_tag.h>
+
+#ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [cmp.alg]
+namespace __partial_order {
+    struct __fn {
+    // NOLINTBEGIN(libcpp-robust-against-adl) partial_order should use ADL, but only here
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<2>)
+            noexcept(noexcept(partial_ordering(partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))))
+            -> decltype(      partial_ordering(partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
+            { return          partial_ordering(partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))); }
+    // NOLINTEND(libcpp-robust-against-adl)
+
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<1>)
+            noexcept(noexcept(partial_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))))
+            -> decltype(      partial_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
+            { return          partial_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))); }
+
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)
+            noexcept(noexcept(partial_ordering(_VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))))
+            -> decltype(      partial_ordering(_VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
+            { return          partial_ordering(_VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))); }
+
+        template<class _Tp, class _Up>
+        _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
+            noexcept(noexcept(__go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>())))
+            -> decltype(      __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>()))
+            { return          __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>()); }
+    };
+} // namespace __partial_order
+
+inline namespace __cpo {
+    inline constexpr auto partial_order = __partial_order::__fn{};
+} // namespace __cpo
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___COMPARE_PARTIAL_ORDER
diff --git a/app/src/main/cpp/libcxx/include/__compare/strong_order.h b/app/src/main/cpp/libcxx/include/__compare/strong_order.h
new file mode 100644
index 0000000..05856c2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/strong_order.h
@@ -0,0 +1,139 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_STRONG_ORDER
+#define _LIBCPP___COMPARE_STRONG_ORDER
+
+#include <__bit/bit_cast.h>
+#include <__compare/compare_three_way.h>
+#include <__compare/ordering.h>
+#include <__config>
+#include <__type_traits/conditional.h>
+#include <__type_traits/decay.h>
+#include <__utility/forward.h>
+#include <__utility/priority_tag.h>
+#include <cmath>
+#include <cstdint>
+#include <limits>
+
+#ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [cmp.alg]
+namespace __strong_order {
+    struct __fn {
+    // NOLINTBEGIN(libcpp-robust-against-adl) strong_order should use ADL, but only here
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<2>)
+            noexcept(noexcept(strong_ordering(strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))))
+            -> decltype(      strong_ordering(strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
+            { return          strong_ordering(strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))); }
+    // NOLINTEND(libcpp-robust-against-adl)
+
+        template<class _Tp, class _Up, class _Dp = decay_t<_Tp>>
+            requires is_same_v<_Dp, decay_t<_Up>> && is_floating_point_v<_Dp>
+        _LIBCPP_HIDE_FROM_ABI static constexpr strong_ordering
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept
+        {
+            if constexpr (numeric_limits<_Dp>::is_iec559 && sizeof(_Dp) == sizeof(int32_t)) {
+                int32_t __rx = _VSTD::bit_cast<int32_t>(__t);
+                int32_t __ry = _VSTD::bit_cast<int32_t>(__u);
+                __rx = (__rx < 0) ? (numeric_limits<int32_t>::min() - __rx - 1) : __rx;
+                __ry = (__ry < 0) ? (numeric_limits<int32_t>::min() - __ry - 1) : __ry;
+                return (__rx <=> __ry);
+            } else if constexpr (numeric_limits<_Dp>::is_iec559 && sizeof(_Dp) == sizeof(int64_t)) {
+                int64_t __rx = _VSTD::bit_cast<int64_t>(__t);
+                int64_t __ry = _VSTD::bit_cast<int64_t>(__u);
+                __rx = (__rx < 0) ? (numeric_limits<int64_t>::min() - __rx - 1) : __rx;
+                __ry = (__ry < 0) ? (numeric_limits<int64_t>::min() - __ry - 1) : __ry;
+                return (__rx <=> __ry);
+            } else if (__t < __u) {
+                return strong_ordering::less;
+            } else if (__t > __u) {
+                return strong_ordering::greater;
+            } else if (__t == __u) {
+                if constexpr (numeric_limits<_Dp>::radix == 2) {
+                    return _VSTD::signbit(__u) <=> _VSTD::signbit(__t);
+                } else {
+                    // This is bullet 3 of the IEEE754 algorithm, relevant
+                    // only for decimal floating-point;
+                    // see https://stackoverflow.com/questions/69068075/
+                    if (__t == 0 || _VSTD::isinf(__t)) {
+                        return _VSTD::signbit(__u) <=> _VSTD::signbit(__t);
+                    } else {
+                        int __texp, __uexp;
+                        (void)_VSTD::frexp(__t, &__texp);
+                        (void)_VSTD::frexp(__u, &__uexp);
+                        return (__t < 0) ? (__texp <=> __uexp) : (__uexp <=> __texp);
+                    }
+                }
+            } else {
+                // They're unordered, so one of them must be a NAN.
+                // The order is -QNAN, -SNAN, numbers, +SNAN, +QNAN.
+                bool __t_is_nan = _VSTD::isnan(__t);
+                bool __u_is_nan = _VSTD::isnan(__u);
+                bool __t_is_negative = _VSTD::signbit(__t);
+                bool __u_is_negative = _VSTD::signbit(__u);
+                using _IntType = conditional_t<
+                    sizeof(__t) == sizeof(int32_t), int32_t, conditional_t<
+                    sizeof(__t) == sizeof(int64_t), int64_t, void>
+                >;
+                if constexpr (is_same_v<_IntType, void>) {
+                    static_assert(sizeof(_Dp) == 0, "std::strong_order is unimplemented for this floating-point type");
+                } else if (__t_is_nan && __u_is_nan) {
+                    // Order by sign bit, then by "payload bits" (we'll just use bit_cast).
+                    if (__t_is_negative != __u_is_negative) {
+                        return (__u_is_negative <=> __t_is_negative);
+                    } else {
+                        return _VSTD::bit_cast<_IntType>(__t) <=> _VSTD::bit_cast<_IntType>(__u);
+                    }
+                } else if (__t_is_nan) {
+                    return __t_is_negative ? strong_ordering::less : strong_ordering::greater;
+                } else {
+                    return __u_is_negative ? strong_ordering::greater : strong_ordering::less;
+                }
+            }
+        }
+
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)
+            noexcept(noexcept(strong_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))))
+            -> decltype(      strong_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
+            { return          strong_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))); }
+
+        template<class _Tp, class _Up>
+        _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
+            noexcept(noexcept(__go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>())))
+            -> decltype(      __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>()))
+            { return          __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>()); }
+    };
+} // namespace __strong_order
+
+inline namespace __cpo {
+    inline constexpr auto strong_order = __strong_order::__fn{};
+} // namespace __cpo
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___COMPARE_STRONG_ORDER
diff --git a/app/src/main/cpp/libcxx/include/__compare/synth_three_way.h b/app/src/main/cpp/libcxx/include/__compare/synth_three_way.h
new file mode 100644
index 0000000..7d33898
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/synth_three_way.h
@@ -0,0 +1,51 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_SYNTH_THREE_WAY_H
+#define _LIBCPP___COMPARE_SYNTH_THREE_WAY_H
+
+#include <__compare/ordering.h>
+#include <__compare/three_way_comparable.h>
+#include <__concepts/boolean_testable.h>
+#include <__config>
+#include <__utility/declval.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [expos.only.func]
+
+_LIBCPP_HIDE_FROM_ABI inline constexpr auto __synth_three_way =
+  []<class _Tp, class _Up>(const _Tp& __t, const _Up& __u)
+    requires requires {
+      { __t < __u } -> __boolean_testable;
+      { __u < __t } -> __boolean_testable;
+    }
+  {
+    if constexpr (three_way_comparable_with<_Tp, _Up>) {
+      return __t <=> __u;
+    } else {
+      if (__t < __u) return weak_ordering::less;
+      if (__u < __t) return weak_ordering::greater;
+      return weak_ordering::equivalent;
+    }
+  };
+
+template <class _Tp, class _Up = _Tp>
+using __synth_three_way_result = decltype(std::__synth_three_way(std::declval<_Tp&>(), std::declval<_Up&>()));
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___COMPARE_SYNTH_THREE_WAY_H
diff --git a/app/src/main/cpp/libcxx/include/__compare/three_way_comparable.h b/app/src/main/cpp/libcxx/include/__compare/three_way_comparable.h
new file mode 100644
index 0000000..6c98916
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/three_way_comparable.h
@@ -0,0 +1,59 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_THREE_WAY_COMPARABLE_H
+#define _LIBCPP___COMPARE_THREE_WAY_COMPARABLE_H
+
+#include <__compare/common_comparison_category.h>
+#include <__compare/ordering.h>
+#include <__concepts/common_reference_with.h>
+#include <__concepts/equality_comparable.h>
+#include <__concepts/same_as.h>
+#include <__concepts/totally_ordered.h>
+#include <__config>
+#include <__type_traits/common_reference.h>
+#include <__type_traits/make_const_lvalue_ref.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template<class _Tp, class _Cat>
+concept __compares_as =
+  same_as<common_comparison_category_t<_Tp, _Cat>, _Cat>;
+
+template<class _Tp, class _Cat = partial_ordering>
+concept three_way_comparable =
+  __weakly_equality_comparable_with<_Tp, _Tp> &&
+  __partially_ordered_with<_Tp, _Tp> &&
+  requires(__make_const_lvalue_ref<_Tp> __a, __make_const_lvalue_ref<_Tp> __b) {
+    { __a <=> __b } -> __compares_as<_Cat>;
+  };
+
+template<class _Tp, class _Up, class _Cat = partial_ordering>
+concept three_way_comparable_with =
+  three_way_comparable<_Tp, _Cat> &&
+  three_way_comparable<_Up, _Cat> &&
+  common_reference_with<__make_const_lvalue_ref<_Tp>, __make_const_lvalue_ref<_Up>> &&
+  three_way_comparable<common_reference_t<__make_const_lvalue_ref<_Tp>, __make_const_lvalue_ref<_Up>>, _Cat> &&
+  __weakly_equality_comparable_with<_Tp, _Up> &&
+  __partially_ordered_with<_Tp, _Up> &&
+  requires(__make_const_lvalue_ref<_Tp> __t, __make_const_lvalue_ref<_Up> __u) {
+    { __t <=> __u } -> __compares_as<_Cat>;
+    { __u <=> __t } -> __compares_as<_Cat>;
+  };
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___COMPARE_THREE_WAY_COMPARABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__compare/weak_order.h b/app/src/main/cpp/libcxx/include/__compare/weak_order.h
new file mode 100644
index 0000000..abb24e3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__compare/weak_order.h
@@ -0,0 +1,102 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COMPARE_WEAK_ORDER
+#define _LIBCPP___COMPARE_WEAK_ORDER
+
+#include <__compare/compare_three_way.h>
+#include <__compare/ordering.h>
+#include <__compare/strong_order.h>
+#include <__config>
+#include <__type_traits/decay.h>
+#include <__utility/forward.h>
+#include <__utility/priority_tag.h>
+#include <cmath>
+
+#ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [cmp.alg]
+namespace __weak_order {
+    struct __fn {
+    // NOLINTBEGIN(libcpp-robust-against-adl) weak_order should use ADL, but only here
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<3>)
+            noexcept(noexcept(weak_ordering(weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))))
+            -> decltype(      weak_ordering(weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
+            { return          weak_ordering(weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))); }
+    // NOLINTEND(libcpp-robust-against-adl)
+
+        template<class _Tp, class _Up, class _Dp = decay_t<_Tp>>
+            requires is_same_v<_Dp, decay_t<_Up>> && is_floating_point_v<_Dp>
+        _LIBCPP_HIDE_FROM_ABI static constexpr weak_ordering
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<2>) noexcept
+        {
+            partial_ordering __po = (__t <=> __u);
+            if (__po == partial_ordering::less) {
+                return weak_ordering::less;
+            } else if (__po == partial_ordering::equivalent) {
+                return weak_ordering::equivalent;
+            } else if (__po == partial_ordering::greater) {
+                return weak_ordering::greater;
+            } else {
+                // Otherwise, at least one of them is a NaN.
+                bool __t_is_nan = _VSTD::isnan(__t);
+                bool __u_is_nan = _VSTD::isnan(__u);
+                bool __t_is_negative = _VSTD::signbit(__t);
+                bool __u_is_negative = _VSTD::signbit(__u);
+                if (__t_is_nan && __u_is_nan) {
+                    return (__u_is_negative <=> __t_is_negative);
+                } else if (__t_is_nan) {
+                    return __t_is_negative ? weak_ordering::less : weak_ordering::greater;
+                } else {
+                    return __u_is_negative ? weak_ordering::greater : weak_ordering::less;
+                }
+            }
+        }
+
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<1>)
+            noexcept(noexcept(weak_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))))
+            -> decltype(      weak_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
+            { return          weak_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))); }
+
+        template<class _Tp, class _Up>
+            requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
+        _LIBCPP_HIDE_FROM_ABI static constexpr auto
+        __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)
+            noexcept(noexcept(weak_ordering(_VSTD::strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))))
+            -> decltype(      weak_ordering(_VSTD::strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
+            { return          weak_ordering(_VSTD::strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))); }
+
+        template<class _Tp, class _Up>
+        _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
+            noexcept(noexcept(__go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<3>())))
+            -> decltype(      __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<3>()))
+            { return          __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<3>()); }
+    };
+} // namespace __weak_order
+
+inline namespace __cpo {
+    inline constexpr auto weak_order = __weak_order::__fn{};
+} // namespace __cpo
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___COMPARE_WEAK_ORDER
diff --git a/app/src/main/cpp/libcxx/include/__concepts/arithmetic.h b/app/src/main/cpp/libcxx/include/__concepts/arithmetic.h
new file mode 100644
index 0000000..215b52a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/arithmetic.h
@@ -0,0 +1,52 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_ARITHMETIC_H
+#define _LIBCPP___CONCEPTS_ARITHMETIC_H
+
+#include <__config>
+#include <__type_traits/is_floating_point.h>
+#include <__type_traits/is_integral.h>
+#include <__type_traits/is_signed.h>
+#include <__type_traits/is_signed_integer.h>
+#include <__type_traits/is_unsigned_integer.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concepts.arithmetic], arithmetic concepts
+
+template<class _Tp>
+concept integral = is_integral_v<_Tp>;
+
+template<class _Tp>
+concept signed_integral = integral<_Tp> && is_signed_v<_Tp>;
+
+template<class _Tp>
+concept unsigned_integral = integral<_Tp> && !signed_integral<_Tp>;
+
+template<class _Tp>
+concept floating_point = is_floating_point_v<_Tp>;
+
+// Concept helpers for the internal type traits for the fundamental types.
+
+template <class _Tp>
+concept __libcpp_unsigned_integer = __libcpp_is_unsigned_integer<_Tp>::value;
+template <class _Tp>
+concept __libcpp_signed_integer = __libcpp_is_signed_integer<_Tp>::value;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_ARITHMETIC_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/assignable.h b/app/src/main/cpp/libcxx/include/__concepts/assignable.h
new file mode 100644
index 0000000..91edd40
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/assignable.h
@@ -0,0 +1,41 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_ASSIGNABLE_H
+#define _LIBCPP___CONCEPTS_ASSIGNABLE_H
+
+#include <__concepts/common_reference_with.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/make_const_lvalue_ref.h>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.assignable]
+
+template<class _Lhs, class _Rhs>
+concept assignable_from =
+  is_lvalue_reference_v<_Lhs> &&
+  common_reference_with<__make_const_lvalue_ref<_Lhs>, __make_const_lvalue_ref<_Rhs>> &&
+  requires (_Lhs __lhs, _Rhs&& __rhs) {
+    { __lhs = _VSTD::forward<_Rhs>(__rhs) } -> same_as<_Lhs>;
+  };
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_ASSIGNABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/boolean_testable.h b/app/src/main/cpp/libcxx/include/__concepts/boolean_testable.h
new file mode 100644
index 0000000..a96bde7
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/boolean_testable.h
@@ -0,0 +1,38 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_BOOLEAN_TESTABLE_H
+#define _LIBCPP___CONCEPTS_BOOLEAN_TESTABLE_H
+
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concepts.booleantestable]
+
+template<class _Tp>
+concept __boolean_testable_impl = convertible_to<_Tp, bool>;
+
+template<class _Tp>
+concept __boolean_testable = __boolean_testable_impl<_Tp> && requires(_Tp&& __t) {
+  { !_VSTD::forward<_Tp>(__t) } -> __boolean_testable_impl;
+};
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_BOOLEAN_TESTABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/class_or_enum.h b/app/src/main/cpp/libcxx/include/__concepts/class_or_enum.h
new file mode 100644
index 0000000..c4d2f98
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/class_or_enum.h
@@ -0,0 +1,40 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_CLASS_OR_ENUM_H
+#define _LIBCPP___CONCEPTS_CLASS_OR_ENUM_H
+
+#include <__config>
+#include <__type_traits/is_class.h>
+#include <__type_traits/is_enum.h>
+#include <__type_traits/is_union.h>
+#include <__type_traits/remove_cvref.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// Whether a type is a class type or enumeration type according to the Core wording.
+
+template<class _Tp>
+concept __class_or_enum = is_class_v<_Tp> || is_union_v<_Tp> || is_enum_v<_Tp>;
+
+// Work around Clang bug https://llvm.org/PR52970
+// TODO: remove this workaround once libc++ no longer has to support Clang 13 (it was fixed in Clang 14).
+template<class _Tp>
+concept __workaround_52970 = is_class_v<__remove_cvref_t<_Tp>> || is_union_v<__remove_cvref_t<_Tp>>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_CLASS_OR_ENUM_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/common_reference_with.h b/app/src/main/cpp/libcxx/include/__concepts/common_reference_with.h
new file mode 100644
index 0000000..cc92762
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/common_reference_with.h
@@ -0,0 +1,37 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_COMMON_REFERENCE_WITH_H
+#define _LIBCPP___CONCEPTS_COMMON_REFERENCE_WITH_H
+
+#include <__concepts/convertible_to.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__type_traits/common_reference.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.commonref]
+
+template<class _Tp, class _Up>
+concept common_reference_with =
+  same_as<common_reference_t<_Tp, _Up>, common_reference_t<_Up, _Tp>> &&
+  convertible_to<_Tp, common_reference_t<_Tp, _Up>> &&
+  convertible_to<_Up, common_reference_t<_Tp, _Up>>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_COMMON_REFERENCE_WITH_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/common_with.h b/app/src/main/cpp/libcxx/include/__concepts/common_with.h
new file mode 100644
index 0000000..569a0ee
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/common_with.h
@@ -0,0 +1,50 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_COMMON_WITH_H
+#define _LIBCPP___CONCEPTS_COMMON_WITH_H
+
+#include <__concepts/common_reference_with.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/common_reference.h>
+#include <__type_traits/common_type.h>
+#include <__utility/declval.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.common]
+
+template<class _Tp, class _Up>
+concept common_with =
+  same_as<common_type_t<_Tp, _Up>, common_type_t<_Up, _Tp>> &&
+  requires {
+    static_cast<common_type_t<_Tp, _Up>>(std::declval<_Tp>());
+    static_cast<common_type_t<_Tp, _Up>>(std::declval<_Up>());
+  } &&
+  common_reference_with<
+    add_lvalue_reference_t<const _Tp>,
+    add_lvalue_reference_t<const _Up>> &&
+  common_reference_with<
+    add_lvalue_reference_t<common_type_t<_Tp, _Up>>,
+    common_reference_t<
+      add_lvalue_reference_t<const _Tp>,
+      add_lvalue_reference_t<const _Up>>>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_COMMON_WITH_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/constructible.h b/app/src/main/cpp/libcxx/include/__concepts/constructible.h
new file mode 100644
index 0000000..1d78eb5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/constructible.h
@@ -0,0 +1,56 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_CONSTRUCTIBLE_H
+#define _LIBCPP___CONCEPTS_CONSTRUCTIBLE_H
+
+#include <__concepts/convertible_to.h>
+#include <__concepts/destructible.h>
+#include <__config>
+#include <__type_traits/is_constructible.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.constructible]
+template<class _Tp, class... _Args>
+concept constructible_from =
+    destructible<_Tp> && is_constructible_v<_Tp, _Args...>;
+
+// [concept.default.init]
+
+template<class _Tp>
+concept __default_initializable = requires { ::new _Tp; };
+
+template<class _Tp>
+concept default_initializable = constructible_from<_Tp> &&
+    requires { _Tp{}; } && __default_initializable<_Tp>;
+
+// [concept.moveconstructible]
+template<class _Tp>
+concept move_constructible =
+  constructible_from<_Tp, _Tp> && convertible_to<_Tp, _Tp>;
+
+// [concept.copyconstructible]
+template<class _Tp>
+concept copy_constructible =
+  move_constructible<_Tp> &&
+  constructible_from<_Tp, _Tp&> && convertible_to<_Tp&, _Tp> &&
+  constructible_from<_Tp, const _Tp&> && convertible_to<const _Tp&, _Tp> &&
+  constructible_from<_Tp, const _Tp> && convertible_to<const _Tp, _Tp>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/convertible_to.h b/app/src/main/cpp/libcxx/include/__concepts/convertible_to.h
new file mode 100644
index 0000000..2c1d267
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/convertible_to.h
@@ -0,0 +1,37 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_CONVERTIBLE_TO_H
+#define _LIBCPP___CONCEPTS_CONVERTIBLE_TO_H
+
+#include <__config>
+#include <__type_traits/is_convertible.h>
+#include <__utility/declval.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.convertible]
+
+template<class _From, class _To>
+concept convertible_to =
+  is_convertible_v<_From, _To> &&
+  requires {
+    static_cast<_To>(std::declval<_From>());
+  };
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_CONVERTIBLE_TO_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/copyable.h b/app/src/main/cpp/libcxx/include/__concepts/copyable.h
new file mode 100644
index 0000000..c5d8a80
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/copyable.h
@@ -0,0 +1,39 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_COPYABLE_H
+#define _LIBCPP___CONCEPTS_COPYABLE_H
+
+#include <__concepts/assignable.h>
+#include <__concepts/constructible.h>
+#include <__concepts/movable.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concepts.object]
+
+template<class _Tp>
+concept copyable =
+  copy_constructible<_Tp> &&
+  movable<_Tp> &&
+  assignable_from<_Tp&, _Tp&> &&
+  assignable_from<_Tp&, const _Tp&> &&
+  assignable_from<_Tp&, const _Tp>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_COPYABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/derived_from.h b/app/src/main/cpp/libcxx/include/__concepts/derived_from.h
new file mode 100644
index 0000000..0d3462d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/derived_from.h
@@ -0,0 +1,35 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_DERIVED_FROM_H
+#define _LIBCPP___CONCEPTS_DERIVED_FROM_H
+
+#include <__config>
+#include <__type_traits/is_base_of.h>
+#include <__type_traits/is_convertible.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.derived]
+
+template<class _Dp, class _Bp>
+concept derived_from =
+  is_base_of_v<_Bp, _Dp> &&
+  is_convertible_v<const volatile _Dp*, const volatile _Bp*>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_DERIVED_FROM_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/destructible.h b/app/src/main/cpp/libcxx/include/__concepts/destructible.h
new file mode 100644
index 0000000..ad3819d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/destructible.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_DESTRUCTIBLE_H
+#define _LIBCPP___CONCEPTS_DESTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/is_nothrow_destructible.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.destructible]
+
+template<class _Tp>
+concept destructible = is_nothrow_destructible_v<_Tp>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_DESTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/different_from.h b/app/src/main/cpp/libcxx/include/__concepts/different_from.h
new file mode 100644
index 0000000..15fd8f0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/different_from.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_DIFFERENT_FROM_H
+#define _LIBCPP___CONCEPTS_DIFFERENT_FROM_H
+
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__type_traits/remove_cvref.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template<class _Tp, class _Up>
+concept __different_from = !same_as<remove_cvref_t<_Tp>, remove_cvref_t<_Up>>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_DIFFERENT_FROM_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/equality_comparable.h b/app/src/main/cpp/libcxx/include/__concepts/equality_comparable.h
new file mode 100644
index 0000000..b865141
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/equality_comparable.h
@@ -0,0 +1,54 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_EQUALITY_COMPARABLE_H
+#define _LIBCPP___CONCEPTS_EQUALITY_COMPARABLE_H
+
+#include <__concepts/boolean_testable.h>
+#include <__concepts/common_reference_with.h>
+#include <__config>
+#include <__type_traits/common_reference.h>
+#include <__type_traits/make_const_lvalue_ref.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.equalitycomparable]
+
+template<class _Tp, class _Up>
+concept __weakly_equality_comparable_with =
+  requires(__make_const_lvalue_ref<_Tp> __t, __make_const_lvalue_ref<_Up> __u) {
+    { __t == __u } -> __boolean_testable;
+    { __t != __u } -> __boolean_testable;
+    { __u == __t } -> __boolean_testable;
+    { __u != __t } -> __boolean_testable;
+  };
+
+template<class _Tp>
+concept equality_comparable = __weakly_equality_comparable_with<_Tp, _Tp>;
+
+template<class _Tp, class _Up>
+concept equality_comparable_with =
+  equality_comparable<_Tp> && equality_comparable<_Up> &&
+  common_reference_with<__make_const_lvalue_ref<_Tp>, __make_const_lvalue_ref<_Up>> &&
+  equality_comparable<
+    common_reference_t<
+      __make_const_lvalue_ref<_Tp>,
+      __make_const_lvalue_ref<_Up>>> &&
+  __weakly_equality_comparable_with<_Tp, _Up>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_EQUALITY_COMPARABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/invocable.h b/app/src/main/cpp/libcxx/include/__concepts/invocable.h
new file mode 100644
index 0000000..ec39b7b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/invocable.h
@@ -0,0 +1,40 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_INVOCABLE_H
+#define _LIBCPP___CONCEPTS_INVOCABLE_H
+
+#include <__config>
+#include <__functional/invoke.h>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.invocable]
+
+template<class _Fn, class... _Args>
+concept invocable = requires(_Fn&& __fn, _Args&&... __args) {
+  _VSTD::invoke(_VSTD::forward<_Fn>(__fn), _VSTD::forward<_Args>(__args)...); // not required to be equality preserving
+};
+
+// [concept.regular.invocable]
+
+template<class _Fn, class... _Args>
+concept regular_invocable = invocable<_Fn, _Args...>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_INVOCABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/movable.h b/app/src/main/cpp/libcxx/include/__concepts/movable.h
new file mode 100644
index 0000000..749b78a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/movable.h
@@ -0,0 +1,39 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_MOVABLE_H
+#define _LIBCPP___CONCEPTS_MOVABLE_H
+
+#include <__concepts/assignable.h>
+#include <__concepts/constructible.h>
+#include <__concepts/swappable.h>
+#include <__config>
+#include <__type_traits/is_object.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concepts.object]
+
+template<class _Tp>
+concept movable =
+  is_object_v<_Tp> &&
+  move_constructible<_Tp> &&
+  assignable_from<_Tp&, _Tp> &&
+  swappable<_Tp>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_MOVABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/predicate.h b/app/src/main/cpp/libcxx/include/__concepts/predicate.h
new file mode 100644
index 0000000..7ae9783
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/predicate.h
@@ -0,0 +1,35 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_PREDICATE_H
+#define _LIBCPP___CONCEPTS_PREDICATE_H
+
+#include <__concepts/boolean_testable.h>
+#include <__concepts/invocable.h>
+#include <__config>
+#include <__functional/invoke.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.predicate]
+
+template<class _Fn, class... _Args>
+concept predicate =
+  regular_invocable<_Fn, _Args...> && __boolean_testable<invoke_result_t<_Fn, _Args...>>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_PREDICATE_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/regular.h b/app/src/main/cpp/libcxx/include/__concepts/regular.h
new file mode 100644
index 0000000..d15728d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/regular.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_REGULAR_H
+#define _LIBCPP___CONCEPTS_REGULAR_H
+
+#include <__concepts/equality_comparable.h>
+#include <__concepts/semiregular.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.object]
+
+template<class _Tp>
+concept regular = semiregular<_Tp> && equality_comparable<_Tp>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_REGULAR_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/relation.h b/app/src/main/cpp/libcxx/include/__concepts/relation.h
new file mode 100644
index 0000000..7d5141c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/relation.h
@@ -0,0 +1,44 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_RELATION_H
+#define _LIBCPP___CONCEPTS_RELATION_H
+
+#include <__concepts/predicate.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.relation]
+
+template<class _Rp, class _Tp, class _Up>
+concept relation =
+  predicate<_Rp, _Tp, _Tp> && predicate<_Rp, _Up, _Up> &&
+  predicate<_Rp, _Tp, _Up> && predicate<_Rp, _Up, _Tp>;
+
+// [concept.equiv]
+
+template<class _Rp, class _Tp, class _Up>
+concept equivalence_relation = relation<_Rp, _Tp, _Up>;
+
+// [concept.strictweakorder]
+
+template<class _Rp, class _Tp, class _Up>
+concept strict_weak_order = relation<_Rp, _Tp, _Up>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_RELATION_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/same_as.h b/app/src/main/cpp/libcxx/include/__concepts/same_as.h
new file mode 100644
index 0000000..554ebc3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/same_as.h
@@ -0,0 +1,35 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_SAME_AS_H
+#define _LIBCPP___CONCEPTS_SAME_AS_H
+
+#include <__config>
+#include <__type_traits/is_same.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.same]
+
+template<class _Tp, class _Up>
+concept __same_as_impl = _IsSame<_Tp, _Up>::value;
+
+template<class _Tp, class _Up>
+concept same_as = __same_as_impl<_Tp, _Up> && __same_as_impl<_Up, _Tp>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_SAME_AS_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/semiregular.h b/app/src/main/cpp/libcxx/include/__concepts/semiregular.h
new file mode 100644
index 0000000..d15bb3b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/semiregular.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_SEMIREGULAR_H
+#define _LIBCPP___CONCEPTS_SEMIREGULAR_H
+
+#include <__concepts/constructible.h>
+#include <__concepts/copyable.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.object]
+
+template<class _Tp>
+concept semiregular = copyable<_Tp> && default_initializable<_Tp>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_SEMIREGULAR_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/swappable.h b/app/src/main/cpp/libcxx/include/__concepts/swappable.h
new file mode 100644
index 0000000..d91a7a1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/swappable.h
@@ -0,0 +1,121 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_SWAPPABLE_H
+#define _LIBCPP___CONCEPTS_SWAPPABLE_H
+
+#include <__concepts/assignable.h>
+#include <__concepts/class_or_enum.h>
+#include <__concepts/common_reference_with.h>
+#include <__concepts/constructible.h>
+#include <__config>
+#include <__type_traits/extent.h>
+#include <__type_traits/is_nothrow_move_assignable.h>
+#include <__type_traits/is_nothrow_move_constructible.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/exchange.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.swappable]
+
+namespace ranges {
+namespace __swap {
+
+  template<class _Tp>
+  void swap(_Tp&, _Tp&) = delete;
+
+  template<class _Tp, class _Up>
+  concept __unqualified_swappable_with =
+    (__class_or_enum<remove_cvref_t<_Tp>> || __class_or_enum<remove_cvref_t<_Up>>) &&
+    requires(_Tp&& __t, _Up&& __u) {
+      swap(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u));
+    };
+
+  struct __fn;
+
+  template<class _Tp, class _Up, size_t _Size>
+  concept __swappable_arrays =
+    !__unqualified_swappable_with<_Tp(&)[_Size], _Up(&)[_Size]> &&
+    extent_v<_Tp> == extent_v<_Up> &&
+    requires(_Tp(& __t)[_Size], _Up(& __u)[_Size], const __fn& __swap) {
+      __swap(__t[0], __u[0]);
+    };
+
+  template<class _Tp>
+  concept __exchangeable =
+    !__unqualified_swappable_with<_Tp&, _Tp&> &&
+    move_constructible<_Tp> &&
+    assignable_from<_Tp&, _Tp>;
+
+  struct __fn {
+    // 2.1   `S` is `(void)swap(E1, E2)`* if `E1` or `E2` has class or enumeration type and...
+    // *The name `swap` is used here unqualified.
+    template<class _Tp, class _Up>
+      requires __unqualified_swappable_with<_Tp, _Up>
+    constexpr void operator()(_Tp&& __t, _Up&& __u) const
+      noexcept(noexcept(swap(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
+    {
+      swap(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u));
+    }
+
+    // 2.2   Otherwise, if `E1` and `E2` are lvalues of array types with equal extent and...
+    template<class _Tp, class _Up, size_t _Size>
+      requires __swappable_arrays<_Tp, _Up, _Size>
+    constexpr void operator()(_Tp(& __t)[_Size], _Up(& __u)[_Size]) const
+      noexcept(noexcept((*this)(*__t, *__u)))
+    {
+      // TODO(cjdb): replace with `ranges::swap_ranges`.
+      for (size_t __i = 0; __i < _Size; ++__i) {
+        (*this)(__t[__i], __u[__i]);
+      }
+    }
+
+    // 2.3   Otherwise, if `E1` and `E2` are lvalues of the same type `T` that models...
+    template<__exchangeable _Tp>
+    constexpr void operator()(_Tp& __x, _Tp& __y) const
+      noexcept(is_nothrow_move_constructible_v<_Tp> && is_nothrow_move_assignable_v<_Tp>)
+    {
+      __y = _VSTD::exchange(__x, _VSTD::move(__y));
+    }
+  };
+} // namespace __swap
+
+inline namespace __cpo {
+  inline constexpr auto swap = __swap::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+template<class _Tp>
+concept swappable = requires(_Tp& __a, _Tp& __b) { ranges::swap(__a, __b); };
+
+template<class _Tp, class _Up>
+concept swappable_with =
+  common_reference_with<_Tp, _Up> &&
+  requires(_Tp&& __t, _Up&& __u) {
+    ranges::swap(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Tp>(__t));
+    ranges::swap(_VSTD::forward<_Up>(__u), _VSTD::forward<_Up>(__u));
+    ranges::swap(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u));
+    ranges::swap(_VSTD::forward<_Up>(__u), _VSTD::forward<_Tp>(__t));
+  };
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_SWAPPABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__concepts/totally_ordered.h b/app/src/main/cpp/libcxx/include/__concepts/totally_ordered.h
new file mode 100644
index 0000000..f12d26b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__concepts/totally_ordered.h
@@ -0,0 +1,58 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONCEPTS_TOTALLY_ORDERED_H
+#define _LIBCPP___CONCEPTS_TOTALLY_ORDERED_H
+
+#include <__concepts/boolean_testable.h>
+#include <__concepts/equality_comparable.h>
+#include <__config>
+#include <__type_traits/common_reference.h>
+#include <__type_traits/make_const_lvalue_ref.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [concept.totallyordered]
+
+template<class _Tp, class _Up>
+concept __partially_ordered_with =
+  requires(__make_const_lvalue_ref<_Tp> __t, __make_const_lvalue_ref<_Up> __u) {
+    { __t <  __u } -> __boolean_testable;
+    { __t >  __u } -> __boolean_testable;
+    { __t <= __u } -> __boolean_testable;
+    { __t >= __u } -> __boolean_testable;
+    { __u <  __t } -> __boolean_testable;
+    { __u >  __t } -> __boolean_testable;
+    { __u <= __t } -> __boolean_testable;
+    { __u >= __t } -> __boolean_testable;
+  };
+
+template<class _Tp>
+concept totally_ordered = equality_comparable<_Tp> && __partially_ordered_with<_Tp, _Tp>;
+
+template<class _Tp, class _Up>
+concept totally_ordered_with =
+  totally_ordered<_Tp> && totally_ordered<_Up> &&
+  equality_comparable_with<_Tp, _Up> &&
+  totally_ordered<
+    common_reference_t<
+      __make_const_lvalue_ref<_Tp>,
+      __make_const_lvalue_ref<_Up>>> &&
+  __partially_ordered_with<_Tp, _Up>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___CONCEPTS_TOTALLY_ORDERED_H
diff --git a/app/src/main/cpp/libcxx/include/__config b/app/src/main/cpp/libcxx/include/__config
new file mode 100644
index 0000000..40c9deb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__config
@@ -0,0 +1,1255 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONFIG
+#define _LIBCPP___CONFIG
+
+#include <__config_site>
+
+#if defined(_MSC_VER) && !defined(__clang__)
+#  if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#    define _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
+#  endif
+#endif
+
+#ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
+#  pragma GCC system_header
+#endif
+
+#if defined(__apple_build_version__)
+#  define _LIBCPP_COMPILER_CLANG_BASED
+#  define _LIBCPP_APPLE_CLANG_VER (__apple_build_version__ / 10000)
+#elif defined(__clang__)
+#  define _LIBCPP_COMPILER_CLANG_BASED
+#  define _LIBCPP_CLANG_VER (__clang_major__ * 100 + __clang_minor__)
+#elif defined(__GNUC__)
+#  define _LIBCPP_COMPILER_GCC
+#endif
+
+#ifdef __cplusplus
+
+// _LIBCPP_VERSION represents the version of libc++, which matches the version of LLVM.
+// Given a LLVM release LLVM XX.YY.ZZ (e.g. LLVM 17.0.1 == 17.00.01), _LIBCPP_VERSION is
+// defined to XXYYZZ.
+#  define _LIBCPP_VERSION 170000
+
+#  define _LIBCPP_CONCAT_IMPL(_X, _Y) _X##_Y
+#  define _LIBCPP_CONCAT(_X, _Y) _LIBCPP_CONCAT_IMPL(_X, _Y)
+
+// Valid C++ identifier that revs with every libc++ version. This can be used to
+// generate identifiers that must be unique for every released libc++ version.
+#  define _LIBCPP_VERSIONED_IDENTIFIER _LIBCPP_CONCAT(v, _LIBCPP_VERSION)
+
+#  if __STDC_HOSTED__ == 0
+#    define _LIBCPP_FREESTANDING
+#  endif
+
+#  ifndef _LIBCPP_STD_VER
+#    if __cplusplus <= 201103L
+#      define _LIBCPP_STD_VER 11
+#    elif __cplusplus <= 201402L
+#      define _LIBCPP_STD_VER 14
+#    elif __cplusplus <= 201703L
+#      define _LIBCPP_STD_VER 17
+#    elif __cplusplus <= 202002L
+#      define _LIBCPP_STD_VER 20
+#    else
+// Expected release year of the next C++ standard
+#      define _LIBCPP_STD_VER 23
+#    endif
+#  endif // _LIBCPP_STD_VER
+
+#  if defined(__ELF__)
+#    define _LIBCPP_OBJECT_FORMAT_ELF 1
+#  elif defined(__MACH__)
+#    define _LIBCPP_OBJECT_FORMAT_MACHO 1
+#  elif defined(_WIN32)
+#    define _LIBCPP_OBJECT_FORMAT_COFF 1
+#  elif defined(__wasm__)
+#    define _LIBCPP_OBJECT_FORMAT_WASM 1
+#  elif defined(_AIX)
+#    define _LIBCPP_OBJECT_FORMAT_XCOFF 1
+#  else
+// ... add new file formats here ...
+#  endif
+
+#  if _LIBCPP_ABI_VERSION >= 2
+// Change short string representation so that string data starts at offset 0,
+// improving its alignment in some cases.
+#    define _LIBCPP_ABI_ALTERNATE_STRING_LAYOUT
+// Fix deque iterator type in order to support incomplete types.
+#    define _LIBCPP_ABI_INCOMPLETE_TYPES_IN_DEQUE
+// Fix undefined behavior in how std::list stores its linked nodes.
+#    define _LIBCPP_ABI_LIST_REMOVE_NODE_POINTER_UB
+// Fix undefined behavior in  how __tree stores its end and parent nodes.
+#    define _LIBCPP_ABI_TREE_REMOVE_NODE_POINTER_UB
+// Fix undefined behavior in how __hash_table stores its pointer types.
+#    define _LIBCPP_ABI_FIX_UNORDERED_NODE_POINTER_UB
+#    define _LIBCPP_ABI_FORWARD_LIST_REMOVE_NODE_POINTER_UB
+#    define _LIBCPP_ABI_FIX_UNORDERED_CONTAINER_SIZE_TYPE
+// Define a key function for `bad_function_call` in the library, to centralize
+// its vtable and typeinfo to libc++ rather than having all other libraries
+// using that class define their own copies.
+#    define _LIBCPP_ABI_BAD_FUNCTION_CALL_KEY_FUNCTION
+// Override the default return value of exception::what() for
+// bad_function_call::what() with a string that is specific to
+// bad_function_call (see http://wg21.link/LWG2233). This is an ABI break
+// because it changes the vtable layout of bad_function_call.
+#    define _LIBCPP_ABI_BAD_FUNCTION_CALL_GOOD_WHAT_MESSAGE
+// Enable optimized version of __do_get_(un)signed which avoids redundant copies.
+#    define _LIBCPP_ABI_OPTIMIZED_LOCALE_NUM_GET
+// Give reverse_iterator<T> one data member of type T, not two.
+// Also, in C++17 and later, don't derive iterator types from std::iterator.
+#    define _LIBCPP_ABI_NO_ITERATOR_BASES
+// Use the smallest possible integer type to represent the index of the variant.
+// Previously libc++ used "unsigned int" exclusively.
+#    define _LIBCPP_ABI_VARIANT_INDEX_TYPE_OPTIMIZATION
+// Unstable attempt to provide a more optimized std::function
+#    define _LIBCPP_ABI_OPTIMIZED_FUNCTION
+// All the regex constants must be distinct and nonzero.
+#    define _LIBCPP_ABI_REGEX_CONSTANTS_NONZERO
+// Re-worked external template instantiations for std::string with a focus on
+// performance and fast-path inlining.
+#    define _LIBCPP_ABI_STRING_OPTIMIZED_EXTERNAL_INSTANTIATION
+// Enable clang::trivial_abi on std::unique_ptr.
+#    define _LIBCPP_ABI_ENABLE_UNIQUE_PTR_TRIVIAL_ABI
+// Enable clang::trivial_abi on std::shared_ptr and std::weak_ptr
+#    define _LIBCPP_ABI_ENABLE_SHARED_PTR_TRIVIAL_ABI
+// std::random_device holds some state when it uses an implementation that gets
+// entropy from a file (see _LIBCPP_USING_DEV_RANDOM). When switching from this
+// implementation to another one on a platform that has already shipped
+// std::random_device, one needs to retain the same object layout to remain ABI
+// compatible. This switch removes these workarounds for platforms that don't care
+// about ABI compatibility.
+#    define _LIBCPP_ABI_NO_RANDOM_DEVICE_COMPATIBILITY_LAYOUT
+// Don't export the legacy __basic_string_common class and its methods from the built library.
+#    define _LIBCPP_ABI_DO_NOT_EXPORT_BASIC_STRING_COMMON
+// Don't export the legacy __vector_base_common class and its methods from the built library.
+#    define _LIBCPP_ABI_DO_NOT_EXPORT_VECTOR_BASE_COMMON
+// According to the Standard, `bitset::operator[] const` returns bool
+#    define _LIBCPP_ABI_BITSET_VECTOR_BOOL_CONST_SUBSCRIPT_RETURN_BOOL
+// Remove the base 10 implementation of std::to_chars from the dylib.
+// The implementation moved to the header, but we still export the symbols from
+// the dylib for backwards compatibility.
+#    define _LIBCPP_ABI_DO_NOT_EXPORT_TO_CHARS_BASE_10
+#  elif _LIBCPP_ABI_VERSION == 1
+#    if !(defined(_LIBCPP_OBJECT_FORMAT_COFF) || defined(_LIBCPP_OBJECT_FORMAT_XCOFF))
+// Enable compiling copies of now inline methods into the dylib to support
+// applications compiled against older libraries. This is unnecessary with
+// COFF dllexport semantics, since dllexport forces a non-inline definition
+// of inline functions to be emitted anyway. Our own non-inline copy would
+// conflict with the dllexport-emitted copy, so we disable it. For XCOFF,
+// the linker will take issue with the symbols in the shared object if the
+// weak inline methods get visibility (such as from -fvisibility-inlines-hidden),
+// so disable it.
+#      define _LIBCPP_DEPRECATED_ABI_LEGACY_LIBRARY_DEFINITIONS_FOR_INLINE_FUNCTIONS
+#    endif
+// Feature macros for disabling pre ABI v1 features. All of these options
+// are deprecated.
+#    if defined(__FreeBSD__)
+#      define _LIBCPP_DEPRECATED_ABI_DISABLE_PAIR_TRIVIAL_COPY_CTOR
+#    endif
+#  endif
+
+#  if defined(_LIBCPP_BUILDING_LIBRARY) || _LIBCPP_ABI_VERSION >= 2
+// Enable additional explicit instantiations of iostreams components. This
+// reduces the number of weak definitions generated in programs that use
+// iostreams by providing a single strong definition in the shared library.
+#    define _LIBCPP_ABI_ENABLE_ADDITIONAL_IOSTREAM_EXPLICIT_INSTANTIATIONS_1
+
+// Define a key function for `bad_function_call` in the library, to centralize
+// its vtable and typeinfo to libc++ rather than having all other libraries
+// using that class define their own copies.
+#    define _LIBCPP_ABI_BAD_FUNCTION_CALL_KEY_FUNCTION
+#  endif
+
+#  define _LIBCPP_TOSTRING2(x) #x
+#  define _LIBCPP_TOSTRING(x) _LIBCPP_TOSTRING2(x)
+
+#  if __cplusplus < 201103L
+#    define _LIBCPP_CXX03_LANG
+#  endif
+
+#  ifndef __has_attribute
+#    define __has_attribute(__x) 0
+#  endif
+
+#  ifndef __has_builtin
+#    define __has_builtin(__x) 0
+#  endif
+
+#  ifndef __has_extension
+#    define __has_extension(__x) 0
+#  endif
+
+#  ifndef __has_feature
+#    define __has_feature(__x) 0
+#  endif
+
+#  ifndef __has_cpp_attribute
+#    define __has_cpp_attribute(__x) 0
+#  endif
+
+#  ifndef __has_constexpr_builtin
+#    define __has_constexpr_builtin(x) 0
+#  endif
+
+// '__is_identifier' returns '0' if '__x' is a reserved identifier provided by
+// the compiler and '1' otherwise.
+#  ifndef __is_identifier
+#    define __is_identifier(__x) 1
+#  endif
+
+#  ifndef __has_declspec_attribute
+#    define __has_declspec_attribute(__x) 0
+#  endif
+
+#  define __has_keyword(__x) !(__is_identifier(__x))
+
+#  ifndef __has_include
+#    define __has_include(...) 0
+#  endif
+
+#  if !defined(_LIBCPP_COMPILER_CLANG_BASED) && __cplusplus < 201103L
+#    error "libc++ only supports C++03 with Clang-based compilers. Please enable C++11"
+#  endif
+
+// FIXME: ABI detection should be done via compiler builtin macros. This
+// is just a placeholder until Clang implements such macros. For now assume
+// that Windows compilers pretending to be MSVC++ target the Microsoft ABI,
+// and allow the user to explicitly specify the ABI to handle cases where this
+// heuristic falls short.
+#  if defined(_LIBCPP_ABI_FORCE_ITANIUM) && defined(_LIBCPP_ABI_FORCE_MICROSOFT)
+#    error "Only one of _LIBCPP_ABI_FORCE_ITANIUM and _LIBCPP_ABI_FORCE_MICROSOFT can be defined"
+#  elif defined(_LIBCPP_ABI_FORCE_ITANIUM)
+#    define _LIBCPP_ABI_ITANIUM
+#  elif defined(_LIBCPP_ABI_FORCE_MICROSOFT)
+#    define _LIBCPP_ABI_MICROSOFT
+#  else
+#    if defined(_WIN32) && defined(_MSC_VER)
+#      define _LIBCPP_ABI_MICROSOFT
+#    else
+#      define _LIBCPP_ABI_ITANIUM
+#    endif
+#  endif
+
+#  if defined(_LIBCPP_ABI_MICROSOFT) && !defined(_LIBCPP_NO_VCRUNTIME)
+#    define _LIBCPP_ABI_VCRUNTIME
+#  endif
+
+#  if __has_feature(experimental_library)
+#    ifndef _LIBCPP_ENABLE_EXPERIMENTAL
+#      define _LIBCPP_ENABLE_EXPERIMENTAL
+#    endif
+#  endif
+
+// Incomplete features get their own specific disabling flags. This makes it
+// easier to grep for target specific flags once the feature is complete.
+#  if !defined(_LIBCPP_ENABLE_EXPERIMENTAL) && !defined(_LIBCPP_BUILDING_LIBRARY)
+#    define _LIBCPP_HAS_NO_INCOMPLETE_FORMAT
+#  endif
+
+// Need to detect which libc we're using if we're on Linux.
+#  if defined(__linux__)
+#    include <features.h>
+#    if defined(__GLIBC_PREREQ)
+#      define _LIBCPP_GLIBC_PREREQ(a, b) __GLIBC_PREREQ(a, b)
+#    else
+#      define _LIBCPP_GLIBC_PREREQ(a, b) 0
+#    endif // defined(__GLIBC_PREREQ)
+#  endif   // defined(__linux__)
+
+#  if defined(__MVS__)
+#    include <features.h> // for __NATIVE_ASCII_F
+#  endif
+
+#  ifdef __LITTLE_ENDIAN__
+#    if __LITTLE_ENDIAN__
+#      define _LIBCPP_LITTLE_ENDIAN
+#    endif // __LITTLE_ENDIAN__
+#  endif   // __LITTLE_ENDIAN__
+
+#  ifdef __BIG_ENDIAN__
+#    if __BIG_ENDIAN__
+#      define _LIBCPP_BIG_ENDIAN
+#    endif // __BIG_ENDIAN__
+#  endif   // __BIG_ENDIAN__
+
+#  ifdef __BYTE_ORDER__
+#    if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
+#      define _LIBCPP_LITTLE_ENDIAN
+#    elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
+#      define _LIBCPP_BIG_ENDIAN
+#    endif // __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
+#  endif   // __BYTE_ORDER__
+
+#  ifdef __FreeBSD__
+#    include <sys/endian.h>
+#    include <osreldate.h>
+#    if _BYTE_ORDER == _LITTLE_ENDIAN
+#      define _LIBCPP_LITTLE_ENDIAN
+#    else // _BYTE_ORDER == _LITTLE_ENDIAN
+#      define _LIBCPP_BIG_ENDIAN
+#    endif // _BYTE_ORDER == _LITTLE_ENDIAN
+#  endif   // __FreeBSD__
+
+#  if defined(__NetBSD__) || defined(__OpenBSD__)
+#    include <sys/endian.h>
+#    if _BYTE_ORDER == _LITTLE_ENDIAN
+#      define _LIBCPP_LITTLE_ENDIAN
+#    else // _BYTE_ORDER == _LITTLE_ENDIAN
+#      define _LIBCPP_BIG_ENDIAN
+#    endif // _BYTE_ORDER == _LITTLE_ENDIAN
+#  endif   // defined(__NetBSD__) || defined(__OpenBSD__)
+
+#  if defined(_WIN32)
+#    define _LIBCPP_WIN32API
+#    define _LIBCPP_LITTLE_ENDIAN
+#    define _LIBCPP_SHORT_WCHAR 1
+// Both MinGW and native MSVC provide a "MSVC"-like environment
+#    define _LIBCPP_MSVCRT_LIKE
+// If mingw not explicitly detected, assume using MS C runtime only if
+// a MS compatibility version is specified.
+#    if defined(_MSC_VER) && !defined(__MINGW32__)
+#      define _LIBCPP_MSVCRT // Using Microsoft's C Runtime library
+#    endif
+#    if (defined(_M_AMD64) || defined(__x86_64__)) || (defined(_M_ARM) || defined(__arm__))
+#      define _LIBCPP_HAS_BITSCAN64
+#    endif
+#    define _LIBCPP_HAS_OPEN_WITH_WCHAR
+#  endif // defined(_WIN32)
+
+#  ifdef __sun__
+#    include <sys/isa_defs.h>
+#    ifdef _LITTLE_ENDIAN
+#      define _LIBCPP_LITTLE_ENDIAN
+#    else
+#      define _LIBCPP_BIG_ENDIAN
+#    endif
+#  endif // __sun__
+
+#  if defined(_AIX) && !defined(__64BIT__)
+// The size of wchar is 2 byte on 32-bit mode on AIX.
+#    define _LIBCPP_SHORT_WCHAR 1
+#  endif
+
+// Libc++ supports various implementations of std::random_device.
+//
+// _LIBCPP_USING_DEV_RANDOM
+//      Read entropy from the given file, by default `/dev/urandom`.
+//      If a token is provided, it is assumed to be the path to a file
+//      to read entropy from. This is the default behavior if nothing
+//      else is specified. This implementation requires storing state
+//      inside `std::random_device`.
+//
+// _LIBCPP_USING_ARC4_RANDOM
+//      Use arc4random(). This allows obtaining random data even when
+//      using sandboxing mechanisms. On some platforms like Apple, this
+//      is the recommended source of entropy for user-space programs.
+//      When this option is used, the token passed to `std::random_device`'s
+//      constructor *must* be "/dev/urandom" -- anything else is an error.
+//
+// _LIBCPP_USING_GETENTROPY
+//      Use getentropy().
+//      When this option is used, the token passed to `std::random_device`'s
+//      constructor *must* be "/dev/urandom" -- anything else is an error.
+//
+// _LIBCPP_USING_FUCHSIA_CPRNG
+//      Use Fuchsia's zx_cprng_draw() system call, which is specified to
+//      deliver high-quality entropy and cannot fail.
+//      When this option is used, the token passed to `std::random_device`'s
+//      constructor *must* be "/dev/urandom" -- anything else is an error.
+//
+// _LIBCPP_USING_NACL_RANDOM
+//      NaCl's sandbox (which PNaCl also runs in) doesn't allow filesystem access,
+//      including accesses to the special files under `/dev`. This implementation
+//      uses the NaCL syscall `nacl_secure_random_init()` to get entropy.
+//      When this option is used, the token passed to `std::random_device`'s
+//      constructor *must* be "/dev/urandom" -- anything else is an error.
+//
+// _LIBCPP_USING_WIN32_RANDOM
+//      Use rand_s(), for use on Windows.
+//      When this option is used, the token passed to `std::random_device`'s
+//      constructor *must* be "/dev/urandom" -- anything else is an error.
+#  if defined(__APPLE__) || defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) ||                     \
+      defined(__DragonFly__) || defined(__sun__)
+#    define _LIBCPP_USING_ARC4_RANDOM
+#  elif defined(__wasi__) || defined(__EMSCRIPTEN__)
+#    define _LIBCPP_USING_GETENTROPY
+#  elif defined(__Fuchsia__)
+#    define _LIBCPP_USING_FUCHSIA_CPRNG
+#  elif defined(__native_client__)
+#    define _LIBCPP_USING_NACL_RANDOM
+#  elif defined(_LIBCPP_WIN32API)
+#    define _LIBCPP_USING_WIN32_RANDOM
+#  else
+#    define _LIBCPP_USING_DEV_RANDOM
+#  endif
+
+#  if !defined(_LIBCPP_LITTLE_ENDIAN) && !defined(_LIBCPP_BIG_ENDIAN)
+#    include <endian.h>
+#    if __BYTE_ORDER == __LITTLE_ENDIAN
+#      define _LIBCPP_LITTLE_ENDIAN
+#    elif __BYTE_ORDER == __BIG_ENDIAN
+#      define _LIBCPP_BIG_ENDIAN
+#    else // __BYTE_ORDER == __BIG_ENDIAN
+#      error unable to determine endian
+#    endif
+#  endif // !defined(_LIBCPP_LITTLE_ENDIAN) && !defined(_LIBCPP_BIG_ENDIAN)
+
+#  if __has_attribute(__no_sanitize__) && !defined(_LIBCPP_COMPILER_GCC)
+#    define _LIBCPP_NO_CFI __attribute__((__no_sanitize__("cfi")))
+#  else
+#    define _LIBCPP_NO_CFI
+#  endif
+
+#  ifndef _LIBCPP_CXX03_LANG
+
+#    define _LIBCPP_ALIGNOF(_Tp) alignof(_Tp)
+#    define _ALIGNAS_TYPE(x) alignas(x)
+#    define _ALIGNAS(x) alignas(x)
+#    define _LIBCPP_NORETURN [[noreturn]]
+#    define _NOEXCEPT noexcept
+#    define _NOEXCEPT_(x) noexcept(x)
+#    define _LIBCPP_CONSTEXPR constexpr
+
+#  else
+
+#    define _LIBCPP_ALIGNOF(_Tp) _Alignof(_Tp)
+#    define _ALIGNAS_TYPE(x) __attribute__((__aligned__(_LIBCPP_ALIGNOF(x))))
+#    define _ALIGNAS(x) __attribute__((__aligned__(x)))
+#    define _LIBCPP_NORETURN __attribute__((__noreturn__))
+#    define _LIBCPP_HAS_NO_NOEXCEPT
+#    define nullptr __nullptr
+#    define _NOEXCEPT throw()
+#    define _NOEXCEPT_(x)
+#    define static_assert(...) _Static_assert(__VA_ARGS__)
+#    define decltype(...) __decltype(__VA_ARGS__)
+#    define _LIBCPP_CONSTEXPR
+
+typedef __char16_t char16_t;
+typedef __char32_t char32_t;
+
+#  endif
+
+#  if !defined(__cpp_exceptions) || __cpp_exceptions < 199711L
+#    define _LIBCPP_NO_EXCEPTIONS
+#  endif
+
+#  define _LIBCPP_PREFERRED_ALIGNOF(_Tp) __alignof(_Tp)
+
+#  if defined(_LIBCPP_COMPILER_CLANG_BASED)
+
+#    if defined(__APPLE__) && !defined(__i386__) && !defined(__x86_64__) && (!defined(__arm__) || __ARM_ARCH_7K__ >= 2)
+#      define _LIBCPP_ABI_ALTERNATE_STRING_LAYOUT
+#    endif
+
+// Objective-C++ features (opt-in)
+#    if __has_feature(objc_arc)
+#      define _LIBCPP_HAS_OBJC_ARC
+#    endif
+
+#    if __has_feature(objc_arc_weak)
+#      define _LIBCPP_HAS_OBJC_ARC_WEAK
+#    endif
+
+#    if __has_extension(blocks)
+#      define _LIBCPP_HAS_EXTENSION_BLOCKS
+#    endif
+
+#    if defined(_LIBCPP_HAS_EXTENSION_BLOCKS) && defined(__APPLE__)
+#      define _LIBCPP_HAS_BLOCKS_RUNTIME
+#    endif
+
+#    if !__has_feature(address_sanitizer)
+#      define _LIBCPP_HAS_NO_ASAN
+#    endif
+
+// Allow for build-time disabling of unsigned integer sanitization
+#    if __has_attribute(no_sanitize)
+#      define _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK __attribute__((__no_sanitize__("unsigned-integer-overflow")))
+#    endif
+
+#    define _LIBCPP_ALWAYS_INLINE __attribute__((__always_inline__))
+
+#    define _LIBCPP_DISABLE_EXTENSION_WARNING __extension__
+
+#  elif defined(_LIBCPP_COMPILER_GCC)
+
+#    if !defined(__SANITIZE_ADDRESS__)
+#      define _LIBCPP_HAS_NO_ASAN
+#    endif
+
+#    define _LIBCPP_ALWAYS_INLINE __attribute__((__always_inline__))
+
+#    define _LIBCPP_DISABLE_EXTENSION_WARNING __extension__
+
+#  endif // _LIBCPP_COMPILER_[CLANG|GCC]
+
+#  if defined(_LIBCPP_OBJECT_FORMAT_COFF)
+
+#    ifdef _DLL
+#      define _LIBCPP_CRT_FUNC __declspec(dllimport)
+#    else
+#      define _LIBCPP_CRT_FUNC
+#    endif
+
+#    if defined(_LIBCPP_DISABLE_VISIBILITY_ANNOTATIONS) || (defined(__MINGW32__) && !defined(_LIBCPP_BUILDING_LIBRARY))
+#      define _LIBCPP_DLL_VIS
+#      define _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS
+#      define _LIBCPP_CLASS_TEMPLATE_INSTANTIATION_VIS
+#      define _LIBCPP_OVERRIDABLE_FUNC_VIS
+#      define _LIBCPP_EXPORTED_FROM_ABI
+#    elif defined(_LIBCPP_BUILDING_LIBRARY)
+#      define _LIBCPP_DLL_VIS __declspec(dllexport)
+#      if defined(__MINGW32__)
+#        define _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS _LIBCPP_DLL_VIS
+#        define _LIBCPP_CLASS_TEMPLATE_INSTANTIATION_VIS
+#      else
+#        define _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS
+#        define _LIBCPP_CLASS_TEMPLATE_INSTANTIATION_VIS _LIBCPP_DLL_VIS
+#      endif
+#      define _LIBCPP_OVERRIDABLE_FUNC_VIS _LIBCPP_DLL_VIS
+#      define _LIBCPP_EXPORTED_FROM_ABI __declspec(dllexport)
+#    else
+#      define _LIBCPP_DLL_VIS __declspec(dllimport)
+#      define _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS _LIBCPP_DLL_VIS
+#      define _LIBCPP_CLASS_TEMPLATE_INSTANTIATION_VIS
+#      define _LIBCPP_OVERRIDABLE_FUNC_VIS
+#      define _LIBCPP_EXPORTED_FROM_ABI __declspec(dllimport)
+#    endif
+
+#    define _LIBCPP_TYPE_VIS _LIBCPP_DLL_VIS
+#    define _LIBCPP_FUNC_VIS _LIBCPP_DLL_VIS
+#    define _LIBCPP_EXCEPTION_ABI _LIBCPP_DLL_VIS
+#    define _LIBCPP_HIDDEN
+#    define _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+#    define _LIBCPP_TEMPLATE_VIS
+#    define _LIBCPP_TEMPLATE_DATA_VIS
+#    define _LIBCPP_ENUM_VIS
+
+#  else
+
+#    if !defined(_LIBCPP_DISABLE_VISIBILITY_ANNOTATIONS)
+#      define _LIBCPP_VISIBILITY(vis) __attribute__((__visibility__(vis)))
+#    else
+#      define _LIBCPP_VISIBILITY(vis)
+#    endif
+
+#    define _LIBCPP_HIDDEN _LIBCPP_VISIBILITY("hidden")
+#    define _LIBCPP_FUNC_VIS _LIBCPP_VISIBILITY("default")
+#    define _LIBCPP_TYPE_VIS _LIBCPP_VISIBILITY("default")
+#    define _LIBCPP_TEMPLATE_DATA_VIS _LIBCPP_VISIBILITY("default")
+#    define _LIBCPP_EXPORTED_FROM_ABI _LIBCPP_VISIBILITY("default")
+#    define _LIBCPP_EXCEPTION_ABI _LIBCPP_VISIBILITY("default")
+#    define _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS _LIBCPP_VISIBILITY("default")
+#    define _LIBCPP_CLASS_TEMPLATE_INSTANTIATION_VIS
+
+// TODO: Make this a proper customization point or remove the option to override it.
+#    ifndef _LIBCPP_OVERRIDABLE_FUNC_VIS
+#      define _LIBCPP_OVERRIDABLE_FUNC_VIS _LIBCPP_VISIBILITY("default")
+#    endif
+
+#    if !defined(_LIBCPP_DISABLE_VISIBILITY_ANNOTATIONS)
+// The inline should be removed once PR32114 is resolved
+#      define _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS inline _LIBCPP_HIDDEN
+#    else
+#      define _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+#    endif
+
+#    if !defined(_LIBCPP_DISABLE_VISIBILITY_ANNOTATIONS)
+#      if __has_attribute(__type_visibility__)
+#        define _LIBCPP_TEMPLATE_VIS __attribute__((__type_visibility__("default")))
+#      else
+#        define _LIBCPP_TEMPLATE_VIS __attribute__((__visibility__("default")))
+#      endif
+#    else
+#      define _LIBCPP_TEMPLATE_VIS
+#    endif
+
+#    if !defined(_LIBCPP_DISABLE_VISIBILITY_ANNOTATIONS) && __has_attribute(__type_visibility__)
+#      define _LIBCPP_ENUM_VIS __attribute__((__type_visibility__("default")))
+#    else
+#      define _LIBCPP_ENUM_VIS
+#    endif
+
+#  endif // defined(_LIBCPP_OBJECT_FORMAT_COFF)
+
+#  if __has_attribute(exclude_from_explicit_instantiation)
+#    define _LIBCPP_EXCLUDE_FROM_EXPLICIT_INSTANTIATION __attribute__((__exclude_from_explicit_instantiation__))
+#  else
+// Try to approximate the effect of exclude_from_explicit_instantiation
+// (which is that entities are not assumed to be provided by explicit
+// template instantiations in the dylib) by always inlining those entities.
+#    define _LIBCPP_EXCLUDE_FROM_EXPLICIT_INSTANTIATION _LIBCPP_ALWAYS_INLINE
+#  endif
+
+// This macro marks a symbol as being hidden from libc++'s ABI. This is achieved
+// on two levels:
+// 1. The symbol is given hidden visibility, which ensures that users won't start exporting
+//    symbols from their dynamic library by means of using the libc++ headers. This ensures
+//    that those symbols stay private to the dynamic library in which it is defined.
+//
+// 2. The symbol is given an ABI tag that changes with each version of libc++. This ensures
+//    that no ODR violation can arise from mixing two TUs compiled with different versions
+//    of libc++ where we would have changed the definition of a symbol. If the symbols shared
+//    the same name, the ODR would require that their definitions be token-by-token equivalent,
+//    which basically prevents us from being able to make any change to any function in our
+//    headers. Using this ABI tag ensures that the symbol name is "bumped" artificially at
+//    each release, which lets us change the definition of these symbols at our leisure.
+//    Note that historically, this has been achieved in various ways, including force-inlining
+//    all functions or giving internal linkage to all functions. Both these (previous) solutions
+//    suffer from drawbacks that lead notably to code bloat.
+//
+// Note that we use _LIBCPP_EXCLUDE_FROM_EXPLICIT_INSTANTIATION to ensure that we don't depend
+// on _LIBCPP_HIDE_FROM_ABI methods of classes explicitly instantiated in the dynamic library.
+//
+// Also note that the _LIBCPP_HIDE_FROM_ABI_VIRTUAL macro should be used on virtual functions
+// instead of _LIBCPP_HIDE_FROM_ABI. That macro does not use an ABI tag. Indeed, the mangled
+// name of a virtual function is part of its ABI, since some architectures like arm64e can sign
+// the virtual function pointer in the vtable based on the mangled name of the function. Since
+// we use an ABI tag that changes with each released version, the mangled name of the virtual
+// function would change, which is incorrect. Note that it doesn't make much sense to change
+// the implementation of a virtual function in an ABI-incompatible way in the first place,
+// since that would be an ABI break anyway. Hence, the lack of ABI tag should not be noticeable.
+//
+// TODO: We provide a escape hatch with _LIBCPP_NO_ABI_TAG for folks who want to avoid increasing
+//       the length of symbols with an ABI tag. In practice, we should remove the escape hatch and
+//       use compression mangling instead, see https://github.com/itanium-cxx-abi/cxx-abi/issues/70.
+#  ifndef _LIBCPP_NO_ABI_TAG
+#    define _LIBCPP_HIDE_FROM_ABI                                                                                      \
+      _LIBCPP_HIDDEN _LIBCPP_EXCLUDE_FROM_EXPLICIT_INSTANTIATION                                                       \
+          __attribute__((__abi_tag__(_LIBCPP_TOSTRING(_LIBCPP_VERSIONED_IDENTIFIER))))
+#  else
+#    define _LIBCPP_HIDE_FROM_ABI _LIBCPP_HIDDEN _LIBCPP_EXCLUDE_FROM_EXPLICIT_INSTANTIATION
+#  endif
+#  define _LIBCPP_HIDE_FROM_ABI_VIRTUAL _LIBCPP_HIDDEN _LIBCPP_EXCLUDE_FROM_EXPLICIT_INSTANTIATION
+
+// This macro provides a HIDE_FROM_ABI equivalent that can be applied to extern
+// "C" function, as those lack mangling.
+#  define _LIBCPP_HIDE_FROM_ABI_C _LIBCPP_HIDDEN _LIBCPP_EXCLUDE_FROM_EXPLICIT_INSTANTIATION
+
+#  ifdef _LIBCPP_BUILDING_LIBRARY
+#    if _LIBCPP_ABI_VERSION > 1
+#      define _LIBCPP_HIDE_FROM_ABI_AFTER_V1 _LIBCPP_HIDE_FROM_ABI
+#    else
+#      define _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+#    endif
+#  else
+#    define _LIBCPP_HIDE_FROM_ABI_AFTER_V1 _LIBCPP_HIDE_FROM_ABI
+#  endif
+
+// Just so we can migrate to the new macros gradually.
+#  define _LIBCPP_INLINE_VISIBILITY _LIBCPP_HIDE_FROM_ABI
+
+// Inline namespaces are available in Clang/GCC/MSVC regardless of C++ dialect.
+// clang-format off
+#  define _LIBCPP_BEGIN_NAMESPACE_STD namespace std { inline namespace _LIBCPP_ABI_NAMESPACE {
+#  define _LIBCPP_END_NAMESPACE_STD }}
+#  define _VSTD std
+
+_LIBCPP_BEGIN_NAMESPACE_STD _LIBCPP_END_NAMESPACE_STD
+
+#  if _LIBCPP_STD_VER > 14
+#    define _LIBCPP_BEGIN_NAMESPACE_FILESYSTEM                                                                         \
+       _LIBCPP_BEGIN_NAMESPACE_STD inline namespace __fs { namespace filesystem {
+#  else
+#    define _LIBCPP_BEGIN_NAMESPACE_FILESYSTEM                                                                         \
+      _LIBCPP_BEGIN_NAMESPACE_STD namespace __fs { namespace filesystem {
+#  endif
+
+#  define _LIBCPP_END_NAMESPACE_FILESYSTEM _LIBCPP_END_NAMESPACE_STD }}
+// clang-format on
+
+#  define _VSTD_FS std::__fs::filesystem
+
+#  if __has_attribute(__enable_if__)
+#    define _LIBCPP_PREFERRED_OVERLOAD __attribute__((__enable_if__(true, "")))
+#  endif
+
+#  ifndef __SIZEOF_INT128__
+#    define _LIBCPP_HAS_NO_INT128
+#  endif
+
+#  ifndef __cpp_consteval
+#    define _LIBCPP_CONSTEVAL _LIBCPP_CONSTEXPR
+#  else
+#    define _LIBCPP_CONSTEVAL consteval
+#  endif
+
+#  if __has_attribute(__malloc__)
+#    define _LIBCPP_NOALIAS __attribute__((__malloc__))
+#  else
+#    define _LIBCPP_NOALIAS
+#  endif
+
+#  if __has_attribute(__using_if_exists__)
+#    define _LIBCPP_USING_IF_EXISTS __attribute__((__using_if_exists__))
+#  else
+#    define _LIBCPP_USING_IF_EXISTS
+#  endif
+
+#  ifdef _LIBCPP_CXX03_LANG
+#    define _LIBCPP_DECLARE_STRONG_ENUM(x)                                                                             \
+      struct _LIBCPP_TYPE_VIS x {                                                                                      \
+        enum __lx
+// clang-format off
+#    define _LIBCPP_DECLARE_STRONG_ENUM_EPILOG(x)                                                                      \
+      __lx __v_;                                                                                                       \
+      _LIBCPP_INLINE_VISIBILITY x(__lx __v) : __v_(__v) {}                                                             \
+      _LIBCPP_INLINE_VISIBILITY explicit x(int __v) : __v_(static_cast<__lx>(__v)) {}                                  \
+      _LIBCPP_INLINE_VISIBILITY operator int() const { return __v_; }                                                  \
+      };
+// clang-format on
+
+#  else // _LIBCPP_CXX03_LANG
+#    define _LIBCPP_DECLARE_STRONG_ENUM(x) enum class _LIBCPP_ENUM_VIS x
+#    define _LIBCPP_DECLARE_STRONG_ENUM_EPILOG(x)
+#  endif // _LIBCPP_CXX03_LANG
+
+#  if defined(__APPLE__) || defined(__FreeBSD__) || defined(_LIBCPP_MSVCRT_LIKE) || defined(__sun__) ||                \
+      defined(__NetBSD__)
+#    define _LIBCPP_LOCALE__L_EXTENSIONS 1
+#  endif
+
+#  ifdef __FreeBSD__
+#    define _DECLARE_C99_LDBL_MATH 1
+#  endif
+
+// If we are getting operator new from the MSVC CRT, then allocation overloads
+// for align_val_t were added in 19.12, aka VS 2017 version 15.3.
+#  if defined(_LIBCPP_MSVCRT) && defined(_MSC_VER) && _MSC_VER < 1912
+#    define _LIBCPP_HAS_NO_LIBRARY_ALIGNED_ALLOCATION
+#  elif defined(_LIBCPP_ABI_VCRUNTIME) && !defined(__cpp_aligned_new)
+// We're deferring to Microsoft's STL to provide aligned new et al. We don't
+// have it unless the language feature test macro is defined.
+#    define _LIBCPP_HAS_NO_LIBRARY_ALIGNED_ALLOCATION
+#  elif defined(__MVS__)
+#    define _LIBCPP_HAS_NO_LIBRARY_ALIGNED_ALLOCATION
+#  endif
+
+#  if defined(_LIBCPP_HAS_NO_LIBRARY_ALIGNED_ALLOCATION) || (!defined(__cpp_aligned_new) || __cpp_aligned_new < 201606)
+#    define _LIBCPP_HAS_NO_ALIGNED_ALLOCATION
+#  endif
+
+// It is not yet possible to use aligned_alloc() on all Apple platforms since
+// 10.15 was the first version to ship an implementation of aligned_alloc().
+#  if defined(__APPLE__)
+#    if (defined(__ENVIRONMENT_MAC_OS_X_VERSION_MIN_REQUIRED__) &&                                                     \
+         __ENVIRONMENT_MAC_OS_X_VERSION_MIN_REQUIRED__ < 101500)
+#      define _LIBCPP_HAS_NO_C11_ALIGNED_ALLOC
+#    endif
+#  elif defined(__ANDROID__) && __ANDROID_API__ < 28
+// Android only provides aligned_alloc when targeting API 28 or higher.
+#    define _LIBCPP_HAS_NO_C11_ALIGNED_ALLOC
+#  endif
+
+#  if defined(__APPLE__) || defined(__FreeBSD__)
+#    define _LIBCPP_HAS_DEFAULTRUNELOCALE
+#  endif
+
+#  if defined(__APPLE__) || defined(__FreeBSD__) || defined(__sun__)
+#    define _LIBCPP_WCTYPE_IS_MASK
+#  endif
+
+#  if _LIBCPP_STD_VER <= 17 || !defined(__cpp_char8_t)
+#    define _LIBCPP_HAS_NO_CHAR8_T
+#  endif
+
+// Deprecation macros.
+//
+// Deprecations warnings are always enabled, except when users explicitly opt-out
+// by defining _LIBCPP_DISABLE_DEPRECATION_WARNINGS.
+#  if !defined(_LIBCPP_DISABLE_DEPRECATION_WARNINGS)
+#    if __has_attribute(deprecated)
+#      define _LIBCPP_DEPRECATED __attribute__((deprecated))
+#      define _LIBCPP_DEPRECATED_(m) __attribute__((deprecated(m)))
+#    elif _LIBCPP_STD_VER > 11
+#      define _LIBCPP_DEPRECATED [[deprecated]]
+#      define _LIBCPP_DEPRECATED_(m) [[deprecated(m)]]
+#    else
+#      define _LIBCPP_DEPRECATED
+#      define _LIBCPP_DEPRECATED_(m)
+#    endif
+#  else
+#    define _LIBCPP_DEPRECATED
+#    define _LIBCPP_DEPRECATED_(m)
+#  endif
+
+#  if !defined(_LIBCPP_CXX03_LANG)
+#    define _LIBCPP_DEPRECATED_IN_CXX11 _LIBCPP_DEPRECATED
+#  else
+#    define _LIBCPP_DEPRECATED_IN_CXX11
+#  endif
+
+#  if _LIBCPP_STD_VER > 11
+#    define _LIBCPP_DEPRECATED_IN_CXX14 _LIBCPP_DEPRECATED
+#  else
+#    define _LIBCPP_DEPRECATED_IN_CXX14
+#  endif
+
+#  if _LIBCPP_STD_VER > 14
+#    define _LIBCPP_DEPRECATED_IN_CXX17 _LIBCPP_DEPRECATED
+#  else
+#    define _LIBCPP_DEPRECATED_IN_CXX17
+#  endif
+
+#  if _LIBCPP_STD_VER > 17
+#    define _LIBCPP_DEPRECATED_IN_CXX20 _LIBCPP_DEPRECATED
+#  else
+#    define _LIBCPP_DEPRECATED_IN_CXX20
+#  endif
+
+#if _LIBCPP_STD_VER >= 23
+#  define _LIBCPP_DEPRECATED_IN_CXX23 _LIBCPP_DEPRECATED
+#else
+#  define _LIBCPP_DEPRECATED_IN_CXX23
+#endif
+
+#  if !defined(_LIBCPP_HAS_NO_CHAR8_T)
+#    define _LIBCPP_DEPRECATED_WITH_CHAR8_T _LIBCPP_DEPRECATED
+#  else
+#    define _LIBCPP_DEPRECATED_WITH_CHAR8_T
+#  endif
+
+// Macros to enter and leave a state where deprecation warnings are suppressed.
+#  if defined(_LIBCPP_COMPILER_CLANG_BASED) || defined(_LIBCPP_COMPILER_GCC)
+#    define _LIBCPP_SUPPRESS_DEPRECATED_PUSH                                                                           \
+      _Pragma("GCC diagnostic push") _Pragma("GCC diagnostic ignored \"-Wdeprecated\"")                                \
+          _Pragma("GCC diagnostic ignored \"-Wdeprecated-declarations\"")
+#    define _LIBCPP_SUPPRESS_DEPRECATED_POP _Pragma("GCC diagnostic pop")
+#  else
+#    define _LIBCPP_SUPPRESS_DEPRECATED_PUSH
+#    define _LIBCPP_SUPPRESS_DEPRECATED_POP
+#  endif
+
+#  if _LIBCPP_STD_VER <= 11
+#    define _LIBCPP_EXPLICIT_AFTER_CXX11
+#  else
+#    define _LIBCPP_EXPLICIT_AFTER_CXX11 explicit
+#  endif
+
+#  if _LIBCPP_STD_VER > 11
+#    define _LIBCPP_CONSTEXPR_SINCE_CXX14 constexpr
+#  else
+#    define _LIBCPP_CONSTEXPR_SINCE_CXX14
+#  endif
+
+#  if _LIBCPP_STD_VER > 14
+#    define _LIBCPP_CONSTEXPR_SINCE_CXX17 constexpr
+#  else
+#    define _LIBCPP_CONSTEXPR_SINCE_CXX17
+#  endif
+
+#  if _LIBCPP_STD_VER > 17
+#    define _LIBCPP_CONSTEXPR_SINCE_CXX20 constexpr
+#  else
+#    define _LIBCPP_CONSTEXPR_SINCE_CXX20
+#  endif
+
+#  if _LIBCPP_STD_VER > 20
+#    define _LIBCPP_CONSTEXPR_SINCE_CXX23 constexpr
+#  else
+#    define _LIBCPP_CONSTEXPR_SINCE_CXX23
+#  endif
+
+#  if __has_cpp_attribute(nodiscard)
+#    define _LIBCPP_NODISCARD [[nodiscard]]
+#  else
+// We can't use GCC's [[gnu::warn_unused_result]] and
+// __attribute__((warn_unused_result)), because GCC does not silence them via
+// (void) cast.
+#    define _LIBCPP_NODISCARD
+#  endif
+
+// _LIBCPP_NODISCARD_EXT may be used to apply [[nodiscard]] to entities not
+// specified as such as an extension.
+#  if !defined(_LIBCPP_DISABLE_NODISCARD_EXT)
+#    define _LIBCPP_NODISCARD_EXT _LIBCPP_NODISCARD
+#  else
+#    define _LIBCPP_NODISCARD_EXT
+#  endif
+
+#  if _LIBCPP_STD_VER > 17 || !defined(_LIBCPP_DISABLE_NODISCARD_EXT)
+#    define _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_NODISCARD
+#  else
+#    define _LIBCPP_NODISCARD_AFTER_CXX17
+#  endif
+
+#  if __has_attribute(__no_destroy__)
+#    define _LIBCPP_NO_DESTROY __attribute__((__no_destroy__))
+#  else
+#    define _LIBCPP_NO_DESTROY
+#  endif
+
+#  ifndef _LIBCPP_HAS_NO_ASAN
+    extern "C" _LIBCPP_FUNC_VIS void
+    __sanitizer_annotate_contiguous_container(const void*, const void*, const void*, const void*);
+#  endif
+
+// Try to find out if RTTI is disabled.
+#  if !defined(__cpp_rtti) || __cpp_rtti < 199711L
+#    define _LIBCPP_NO_RTTI
+#  endif
+
+#  ifndef _LIBCPP_WEAK
+#    define _LIBCPP_WEAK __attribute__((__weak__))
+#  endif
+
+// Thread API
+// clang-format off
+#  if !defined(_LIBCPP_HAS_NO_THREADS) &&                                                                              \
+      !defined(_LIBCPP_HAS_THREAD_API_PTHREAD) &&                                                                      \
+      !defined(_LIBCPP_HAS_THREAD_API_WIN32) &&                                                                        \
+      !defined(_LIBCPP_HAS_THREAD_API_EXTERNAL)
+
+#    if defined(__FreeBSD__) ||                                                                                        \
+        defined(__wasi__) ||                                                                                           \
+        defined(__NetBSD__) ||                                                                                         \
+        defined(__OpenBSD__) ||                                                                                        \
+        defined(__NuttX__) ||                                                                                          \
+        defined(__linux__) ||                                                                                          \
+        defined(__GNU__) ||                                                                                            \
+        defined(__APPLE__) ||                                                                                          \
+        defined(__sun__) ||                                                                                            \
+        defined(__MVS__) ||                                                                                            \
+        defined(_AIX) ||                                                                                               \
+        defined(__EMSCRIPTEN__)
+// clang-format on
+#      define _LIBCPP_HAS_THREAD_API_PTHREAD
+#    elif defined(__Fuchsia__)
+// TODO(44575): Switch to C11 thread API when possible.
+#      define _LIBCPP_HAS_THREAD_API_PTHREAD
+#    elif defined(_LIBCPP_WIN32API)
+#      define _LIBCPP_HAS_THREAD_API_WIN32
+#    else
+#      error "No thread API"
+#    endif // _LIBCPP_HAS_THREAD_API
+#  endif   // _LIBCPP_HAS_NO_THREADS
+
+#  if defined(_LIBCPP_HAS_THREAD_API_PTHREAD)
+#    if defined(__ANDROID__) && __ANDROID_API__ >= 30
+#      define _LIBCPP_HAS_COND_CLOCKWAIT
+#    elif defined(_LIBCPP_GLIBC_PREREQ)
+#      if _LIBCPP_GLIBC_PREREQ(2, 30)
+#        define _LIBCPP_HAS_COND_CLOCKWAIT
+#      endif
+#    endif
+#  endif
+
+#  if defined(_LIBCPP_HAS_NO_THREADS) && defined(_LIBCPP_HAS_THREAD_API_PTHREAD)
+#    error _LIBCPP_HAS_THREAD_API_PTHREAD may only be defined when \
+       _LIBCPP_HAS_NO_THREADS is not defined.
+#  endif
+
+#  if defined(_LIBCPP_HAS_NO_THREADS) && defined(_LIBCPP_HAS_THREAD_API_EXTERNAL)
+#    error _LIBCPP_HAS_THREAD_API_EXTERNAL may not be defined when \
+       _LIBCPP_HAS_NO_THREADS is defined.
+#  endif
+
+#  if defined(_LIBCPP_HAS_NO_MONOTONIC_CLOCK) && !defined(_LIBCPP_HAS_NO_THREADS)
+#    error _LIBCPP_HAS_NO_MONOTONIC_CLOCK may only be defined when \
+       _LIBCPP_HAS_NO_THREADS is defined.
+#  endif
+
+#  if !defined(_LIBCPP_HAS_NO_THREADS) && !defined(__STDCPP_THREADS__)
+#    define __STDCPP_THREADS__ 1
+#  endif
+
+// The glibc and Bionic implementation of pthreads implements
+// pthread_mutex_destroy as nop for regular mutexes. Additionally, Win32
+// mutexes have no destroy mechanism.
+//
+// This optimization can't be performed on Apple platforms, where
+// pthread_mutex_destroy can allow the kernel to release resources.
+// See https://llvm.org/D64298 for details.
+//
+// TODO(EricWF): Enable this optimization on Bionic after speaking to their
+//               respective stakeholders.
+// clang-format off
+#  if (defined(_LIBCPP_HAS_THREAD_API_PTHREAD) && defined(__GLIBC__)) ||                                               \
+      (defined(_LIBCPP_HAS_THREAD_API_C11) && defined(__Fuchsia__)) ||                                                 \
+       defined(_LIBCPP_HAS_THREAD_API_WIN32)
+// clang-format on
+#    define _LIBCPP_HAS_TRIVIAL_MUTEX_DESTRUCTION
+#  endif
+
+// Destroying a condvar is a nop on Windows.
+//
+// This optimization can't be performed on Apple platforms, where
+// pthread_cond_destroy can allow the kernel to release resources.
+// See https://llvm.org/D64298 for details.
+//
+// TODO(EricWF): This is potentially true for some pthread implementations
+// as well.
+#  if (defined(_LIBCPP_HAS_THREAD_API_C11) && defined(__Fuchsia__)) || defined(_LIBCPP_HAS_THREAD_API_WIN32)
+#    define _LIBCPP_HAS_TRIVIAL_CONDVAR_DESTRUCTION
+#  endif
+
+// Some systems do not provide gets() in their C library, for security reasons.
+#  if defined(_LIBCPP_MSVCRT) || (defined(__FreeBSD_version) && __FreeBSD_version >= 1300043) || defined(__OpenBSD__)
+#    define _LIBCPP_C_HAS_NO_GETS
+#  endif
+
+#  if defined(__BIONIC__) || defined(__NuttX__) || defined(__Fuchsia__) || defined(__wasi__) ||                        \
+      defined(_LIBCPP_HAS_MUSL_LIBC) || defined(__OpenBSD__)
+#    define _LIBCPP_PROVIDES_DEFAULT_RUNE_TABLE
+#  endif
+
+#  if __has_feature(cxx_atomic) || __has_extension(c_atomic) || __has_keyword(_Atomic)
+#    define _LIBCPP_HAS_C_ATOMIC_IMP
+#  elif defined(_LIBCPP_COMPILER_GCC)
+#    define _LIBCPP_HAS_GCC_ATOMIC_IMP
+#  endif
+
+#  if !defined(_LIBCPP_HAS_C_ATOMIC_IMP) && !defined(_LIBCPP_HAS_GCC_ATOMIC_IMP) &&                                    \
+      !defined(_LIBCPP_HAS_EXTERNAL_ATOMIC_IMP)
+#    define _LIBCPP_HAS_NO_ATOMIC_HEADER
+#  else
+#    ifndef _LIBCPP_ATOMIC_FLAG_TYPE
+#      define _LIBCPP_ATOMIC_FLAG_TYPE bool
+#    endif
+#    ifdef _LIBCPP_FREESTANDING
+#      define _LIBCPP_ATOMIC_ONLY_USE_BUILTINS
+#    endif
+#  endif
+
+#  ifndef _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+#    define _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+#  endif
+
+#  if defined(_LIBCPP_ENABLE_THREAD_SAFETY_ANNOTATIONS)
+#    if defined(__clang__) && __has_attribute(acquire_capability)
+// Work around the attribute handling in clang.  When both __declspec and
+// __attribute__ are present, the processing goes awry preventing the definition
+// of the types. In MinGW mode, __declspec evaluates to __attribute__, and thus
+// combining the two does work.
+#      if !defined(_MSC_VER)
+#        define _LIBCPP_HAS_THREAD_SAFETY_ANNOTATIONS
+#      endif
+#    endif
+#  endif
+
+#  ifdef _LIBCPP_HAS_THREAD_SAFETY_ANNOTATIONS
+#    define _LIBCPP_THREAD_SAFETY_ANNOTATION(x) __attribute__((x))
+#  else
+#    define _LIBCPP_THREAD_SAFETY_ANNOTATION(x)
+#  endif
+
+#  if _LIBCPP_STD_VER > 17
+#    define _LIBCPP_CONSTINIT constinit
+#  elif __has_attribute(__require_constant_initialization__)
+#    define _LIBCPP_CONSTINIT __attribute__((__require_constant_initialization__))
+#  else
+#    define _LIBCPP_CONSTINIT
+#  endif
+
+#  if __has_attribute(__diagnose_if__) && !defined(_LIBCPP_DISABLE_ADDITIONAL_DIAGNOSTICS)
+#    define _LIBCPP_DIAGNOSE_WARNING(...) __attribute__((__diagnose_if__(__VA_ARGS__, "warning")))
+#  else
+#    define _LIBCPP_DIAGNOSE_WARNING(...)
+#  endif
+
+// Use a function like macro to imply that it must be followed by a semicolon
+#  if __has_cpp_attribute(fallthrough)
+#    define _LIBCPP_FALLTHROUGH() [[fallthrough]]
+#  elif __has_attribute(__fallthrough__)
+#    define _LIBCPP_FALLTHROUGH() __attribute__((__fallthrough__))
+#  else
+#    define _LIBCPP_FALLTHROUGH() ((void)0)
+#  endif
+
+#  if __has_cpp_attribute(_Clang::__lifetimebound__)
+#    define _LIBCPP_LIFETIMEBOUND [[_Clang::__lifetimebound__]]
+#  else
+#    define _LIBCPP_LIFETIMEBOUND
+#  endif
+
+#  if __has_attribute(__nodebug__)
+#    define _LIBCPP_NODEBUG __attribute__((__nodebug__))
+#  else
+#    define _LIBCPP_NODEBUG
+#  endif
+
+#  if __has_attribute(__standalone_debug__)
+#    define _LIBCPP_STANDALONE_DEBUG __attribute__((__standalone_debug__))
+#  else
+#    define _LIBCPP_STANDALONE_DEBUG
+#  endif
+
+#  if __has_attribute(__preferred_name__)
+#    define _LIBCPP_PREFERRED_NAME(x) __attribute__((__preferred_name__(x)))
+#  else
+#    define _LIBCPP_PREFERRED_NAME(x)
+#  endif
+
+// We often repeat things just for handling wide characters in the library.
+// When wide characters are disabled, it can be useful to have a quick way of
+// disabling it without having to resort to #if-#endif, which has a larger
+// impact on readability.
+#  if defined(_LIBCPP_HAS_NO_WIDE_CHARACTERS)
+#    define _LIBCPP_IF_WIDE_CHARACTERS(...)
+#  else
+#    define _LIBCPP_IF_WIDE_CHARACTERS(...) __VA_ARGS__
+#  endif
+
+#  if defined(_LIBCPP_ABI_MICROSOFT) && __has_declspec_attribute(empty_bases)
+#    define _LIBCPP_DECLSPEC_EMPTY_BASES __declspec(empty_bases)
+#  else
+#    define _LIBCPP_DECLSPEC_EMPTY_BASES
+#  endif
+
+#  if defined(_LIBCPP_ENABLE_CXX17_REMOVED_FEATURES)
+#    define _LIBCPP_ENABLE_CXX17_REMOVED_AUTO_PTR
+#    define _LIBCPP_ENABLE_CXX17_REMOVED_BINDERS
+#    define _LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE
+#    define _LIBCPP_ENABLE_CXX17_REMOVED_UNEXPECTED_FUNCTIONS
+#    define _LIBCPP_ENABLE_CXX17_REMOVED_UNARY_BINARY_FUNCTION
+#  endif // _LIBCPP_ENABLE_CXX17_REMOVED_FEATURES
+
+#  if defined(_LIBCPP_ENABLE_CXX20_REMOVED_FEATURES)
+#    define _LIBCPP_ENABLE_CXX20_REMOVED_ALLOCATOR_MEMBERS
+#    define _LIBCPP_ENABLE_CXX20_REMOVED_ALLOCATOR_VOID_SPECIALIZATION
+#    define _LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS
+#    define _LIBCPP_ENABLE_CXX20_REMOVED_NEGATORS
+#    define _LIBCPP_ENABLE_CXX20_REMOVED_RAW_STORAGE_ITERATOR
+#    define _LIBCPP_ENABLE_CXX20_REMOVED_TYPE_TRAITS
+#  endif // _LIBCPP_ENABLE_CXX20_REMOVED_FEATURES
+
+#  define _LIBCPP_PUSH_MACROS _Pragma("push_macro(\"min\")") _Pragma("push_macro(\"max\")")
+#  define _LIBCPP_POP_MACROS _Pragma("pop_macro(\"min\")") _Pragma("pop_macro(\"max\")")
+
+#  ifndef _LIBCPP_NO_AUTO_LINK
+#    if defined(_LIBCPP_ABI_MICROSOFT) && !defined(_LIBCPP_BUILDING_LIBRARY)
+#      if !defined(_LIBCPP_DISABLE_VISIBILITY_ANNOTATIONS)
+#        pragma comment(lib, "c++.lib")
+#      else
+#        pragma comment(lib, "libc++.lib")
+#      endif
+#    endif // defined(_LIBCPP_ABI_MICROSOFT) && !defined(_LIBCPP_BUILDING_LIBRARY)
+#  endif   // _LIBCPP_NO_AUTO_LINK
+
+// Configures the fopen close-on-exec mode character, if any. This string will
+// be appended to any mode string used by fstream for fopen/fdopen.
+//
+// Not all platforms support this, but it helps avoid fd-leaks on platforms that
+// do.
+#  if defined(__BIONIC__)
+#    define _LIBCPP_FOPEN_CLOEXEC_MODE "e"
+#  else
+#    define _LIBCPP_FOPEN_CLOEXEC_MODE
+#  endif
+
+// Support for _FILE_OFFSET_BITS=64 landed gradually in Android, so the full set
+// of functions used in cstdio may not be available for low API levels when
+// using 64-bit file offsets on LP32.
+#  if defined(__BIONIC__) && defined(__USE_FILE_OFFSET64) && __ANDROID_API__ < 24
+#    define _LIBCPP_HAS_NO_FGETPOS_FSETPOS
+#  endif
+
+#  if __has_attribute(__init_priority__)
+#    define _LIBCPP_INIT_PRIORITY_MAX __attribute__((__init_priority__(100)))
+#  else
+#    define _LIBCPP_INIT_PRIORITY_MAX
+#  endif
+
+#  if __has_attribute(__format__)
+// The attribute uses 1-based indices for ordinary and static member functions.
+// The attribute uses 2-based indices for non-static member functions.
+#    define _LIBCPP_ATTRIBUTE_FORMAT(archetype, format_string_index, first_format_arg_index)                           \
+      __attribute__((__format__(archetype, format_string_index, first_format_arg_index)))
+#  else
+#    define _LIBCPP_ATTRIBUTE_FORMAT(archetype, format_string_index, first_format_arg_index) /* nothing */
+#  endif
+
+#  if __has_cpp_attribute(msvc::no_unique_address)
+// MSVC implements [[no_unique_address]] as a silent no-op currently.
+// (If/when MSVC breaks its C++ ABI, it will be changed to work as intended.)
+// However, MSVC implements [[msvc::no_unique_address]] which does what
+// [[no_unique_address]] is supposed to do, in general.
+
+// Clang-cl does not yet (14.0) implement either [[no_unique_address]] or
+// [[msvc::no_unique_address]] though. If/when it does implement
+// [[msvc::no_unique_address]], this should be preferred though.
+#    define _LIBCPP_NO_UNIQUE_ADDRESS [[msvc::no_unique_address]]
+#  elif __has_cpp_attribute(no_unique_address)
+#    define _LIBCPP_NO_UNIQUE_ADDRESS [[no_unique_address]]
+#  else
+#    define _LIBCPP_NO_UNIQUE_ADDRESS /* nothing */
+// Note that this can be replaced by #error as soon as clang-cl
+// implements msvc::no_unique_address, since there should be no C++20
+// compiler that doesn't support one of the two attributes at that point.
+// We generally don't want to use this macro outside of C++20-only code,
+// because using it conditionally in one language version only would make
+// the ABI inconsistent.
+#  endif
+
+#  ifdef _LIBCPP_COMPILER_CLANG_BASED
+#    define _LIBCPP_DIAGNOSTIC_PUSH _Pragma("clang diagnostic push")
+#    define _LIBCPP_DIAGNOSTIC_POP _Pragma("clang diagnostic pop")
+#    define _LIBCPP_CLANG_DIAGNOSTIC_IGNORED(str) _Pragma(_LIBCPP_TOSTRING(clang diagnostic ignored str))
+#    define _LIBCPP_GCC_DIAGNOSTIC_IGNORED(str)
+#  elif defined(_LIBCPP_COMPILER_GCC)
+#    define _LIBCPP_DIAGNOSTIC_PUSH _Pragma("GCC diagnostic push")
+#    define _LIBCPP_DIAGNOSTIC_POP _Pragma("GCC diagnostic pop")
+#    define _LIBCPP_CLANG_DIAGNOSTIC_IGNORED(str)
+#    define _LIBCPP_GCC_DIAGNOSTIC_IGNORED(str) _Pragma(_LIBCPP_TOSTRING(GCC diagnostic ignored str))
+#  else
+#    define _LIBCPP_DIAGNOSTIC_PUSH
+#    define _LIBCPP_DIAGNOSTIC_POP
+#    define _LIBCPP_CLANG_DIAGNOSTIC_IGNORED(str)
+#    define _LIBCPP_GCC_DIAGNOSTIC_IGNORED(str)
+#  endif
+
+#  if defined(_AIX) && !defined(_LIBCPP_COMPILER_GCC)
+#    define _LIBCPP_PACKED_BYTE_FOR_AIX _Pragma("pack(1)")
+#    define _LIBCPP_PACKED_BYTE_FOR_AIX_END _Pragma("pack(pop)")
+#  else
+#    define _LIBCPP_PACKED_BYTE_FOR_AIX     /* empty */
+#    define _LIBCPP_PACKED_BYTE_FOR_AIX_END /* empty */
+#  endif
+
+#  if __has_attribute(__packed__)
+#    define _LIBCPP_PACKED __attribute__((__packed__))
+#  else
+#    define _LIBCPP_PACKED
+#  endif
+
+// c8rtomb() and mbrtoc8() were added in C++20 and C23. Support for these
+// functions is gradually being added to existing C libraries. The conditions
+// below check for known C library versions and conditions under which these
+// functions are declared by the C library.
+#  define _LIBCPP_HAS_NO_C8RTOMB_MBRTOC8
+// GNU libc 2.36 and newer declare c8rtomb() and mbrtoc8() in C++ modes if
+// __cpp_char8_t is defined or if C2X extensions are enabled. Unfortunately,
+// determining the latter depends on internal GNU libc details. If the
+// __cpp_char8_t feature test macro is not defined, then a char8_t typedef
+// will be declared as well.
+#  if defined(_LIBCPP_GLIBC_PREREQ) && defined(__GLIBC_USE)
+#    if _LIBCPP_GLIBC_PREREQ(2, 36) && (defined(__cpp_char8_t) || __GLIBC_USE(ISOC2X))
+#      undef _LIBCPP_HAS_NO_C8RTOMB_MBRTOC8
+#    endif
+#  endif
+
+// There are a handful of public standard library types that are intended to
+// support CTAD but don't need any explicit deduction guides to do so. This
+// macro is used to mark them as such, which suppresses the
+// '-Wctad-maybe-unsupported' compiler warning when CTAD is used in user code
+// with these classes.
+#if _LIBCPP_STD_VER >= 17
+#    define _LIBCPP_CTAD_SUPPORTED_FOR_TYPE(_ClassName)                                                                \
+      template <class ..._Tag>                                                                                         \
+      _ClassName(typename _Tag::__allow_ctad...) -> _ClassName<_Tag...>
+#else
+#  define _LIBCPP_CTAD_SUPPORTED_FOR_TYPE(_ClassName) static_assert(true, "")
+#endif
+
+#endif // __cplusplus
+
+#endif // _LIBCPP___CONFIG
diff --git a/app/src/main/cpp/libcxx/include/__config_site b/app/src/main/cpp/libcxx/include/__config_site
new file mode 100644
index 0000000..76d809b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__config_site
@@ -0,0 +1,39 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONFIG_SITE
+#define _LIBCPP___CONFIG_SITE
+
+/* #undef _LIBCPP_ABI_VERSION */
+/* #undef _LIBCPP_ABI_NAMESPACE */
+/* #undef _LIBCPP_ABI_FORCE_ITANIUM */
+/* #undef _LIBCPP_ABI_FORCE_MICROSOFT */
+/* #undef _LIBCPP_HAS_NO_THREADS */
+/* #undef _LIBCPP_HAS_NO_MONOTONIC_CLOCK */
+/* #undef _LIBCPP_HAS_MUSL_LIBC */
+/* #undef _LIBCPP_HAS_THREAD_API_PTHREAD */
+/* #undef _LIBCPP_HAS_THREAD_API_EXTERNAL */
+/* #undef _LIBCPP_HAS_THREAD_API_WIN32 */
+/* #undef _LIBCPP_HAS_THREAD_LIBRARY_EXTERNAL */
+/* #undef _LIBCPP_DISABLE_VISIBILITY_ANNOTATIONS */
+#define _LIBCPP_HAS_NO_VENDOR_AVAILABILITY_ANNOTATIONS
+/* #undef _LIBCPP_NO_VCRUNTIME */
+/* #undef _LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION */
+/* #undef _LIBCPP_HAS_NO_FILESYSTEM_LIBRARY */
+/* #undef _LIBCPP_HAS_PARALLEL_ALGORITHMS */
+/* #undef _LIBCPP_HAS_NO_RANDOM_DEVICE */
+/* #undef _LIBCPP_HAS_NO_LOCALIZATION */
+/* #undef  _LIBCPP_HAS_NO_FSTREAM */
+/* #undef _LIBCPP_HAS_NO_WIDE_CHARACTERS */
+/* #undef  _LIBCPP_ENABLE_ASSERTIONS_DEFAULT */
+/* #undef  _LIBCPP_ENABLE_DEBUG_MODE */
+
+
+
+
+#endif // _LIBCPP___CONFIG_SITE
diff --git a/app/src/main/cpp/libcxx/include/__config_site.in b/app/src/main/cpp/libcxx/include/__config_site.in
new file mode 100644
index 0000000..2ff6725
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__config_site.in
@@ -0,0 +1,49 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___CONFIG_SITE
+#define _LIBCPP___CONFIG_SITE
+
+#cmakedefine _LIBCPP_ABI_VERSION @_LIBCPP_ABI_VERSION@
+#cmakedefine _LIBCPP_ABI_NAMESPACE @_LIBCPP_ABI_NAMESPACE@
+#cmakedefine _LIBCPP_ABI_FORCE_ITANIUM
+#cmakedefine _LIBCPP_ABI_FORCE_MICROSOFT
+#cmakedefine _LIBCPP_HAS_NO_THREADS
+#cmakedefine _LIBCPP_HAS_NO_MONOTONIC_CLOCK
+#cmakedefine _LIBCPP_HAS_MUSL_LIBC
+#cmakedefine _LIBCPP_HAS_THREAD_API_PTHREAD
+#cmakedefine _LIBCPP_HAS_THREAD_API_EXTERNAL
+#cmakedefine _LIBCPP_HAS_THREAD_API_WIN32
+#cmakedefine _LIBCPP_HAS_THREAD_LIBRARY_EXTERNAL
+#cmakedefine _LIBCPP_DISABLE_VISIBILITY_ANNOTATIONS
+#cmakedefine _LIBCPP_HAS_NO_VENDOR_AVAILABILITY_ANNOTATIONS
+#cmakedefine _LIBCPP_NO_VCRUNTIME
+#cmakedefine _LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION @_LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION@
+#cmakedefine _LIBCPP_HAS_NO_FILESYSTEM_LIBRARY
+#cmakedefine _LIBCPP_HAS_PARALLEL_ALGORITHMS
+#cmakedefine _LIBCPP_HAS_NO_RANDOM_DEVICE
+#cmakedefine _LIBCPP_HAS_NO_LOCALIZATION
+#cmakedefine _LIBCPP_HAS_NO_FSTREAM
+#cmakedefine _LIBCPP_HAS_NO_WIDE_CHARACTERS
+#cmakedefine01 _LIBCPP_ENABLE_ASSERTIONS_DEFAULT
+#cmakedefine _LIBCPP_ENABLE_DEBUG_MODE
+
+// __USE_MINGW_ANSI_STDIO gets redefined on MinGW
+#ifdef __clang__
+#  pragma clang diagnostic push
+#  pragma clang diagnostic ignored "-Wmacro-redefined"
+#endif
+
+@_LIBCPP_ABI_DEFINES@
+@_LIBCPP_EXTRA_SITE_DEFINES@
+
+#ifdef __clang__
+#  pragma clang diagnostic pop
+#endif
+
+#endif // _LIBCPP___CONFIG_SITE
diff --git a/app/src/main/cpp/libcxx/include/__coroutine/coroutine_handle.h b/app/src/main/cpp/libcxx/include/__coroutine/coroutine_handle.h
new file mode 100644
index 0000000..0a6cc1c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__coroutine/coroutine_handle.h
@@ -0,0 +1,203 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COROUTINE_COROUTINE_HANDLE_H
+#define _LIBCPP___COROUTINE_COROUTINE_HANDLE_H
+
+#include <__assert>
+#include <__config>
+#include <__functional/hash.h>
+#include <__memory/addressof.h>
+#include <__type_traits/remove_cv.h>
+#include <compare>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// [coroutine.handle]
+template <class _Promise = void>
+struct _LIBCPP_TEMPLATE_VIS coroutine_handle;
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS coroutine_handle<void> {
+public:
+    // [coroutine.handle.con], construct/reset
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr coroutine_handle() noexcept = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr coroutine_handle(nullptr_t) noexcept {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    coroutine_handle& operator=(nullptr_t) noexcept {
+        __handle_ = nullptr;
+        return *this;
+    }
+
+    // [coroutine.handle.export.import], export/import
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void* address() const noexcept { return __handle_; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    static constexpr coroutine_handle from_address(void* __addr) noexcept {
+        coroutine_handle __tmp;
+        __tmp.__handle_ = __addr;
+        return __tmp;
+    }
+
+    // [coroutine.handle.observers], observers
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit operator bool() const noexcept {
+        return __handle_ != nullptr;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    bool done() const {
+        _LIBCPP_ASSERT(__is_suspended(), "done() can be called only on suspended coroutines");
+        return __builtin_coro_done(__handle_);
+    }
+
+    // [coroutine.handle.resumption], resumption
+    _LIBCPP_HIDE_FROM_ABI
+    void operator()() const { resume(); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    void resume() const {
+        _LIBCPP_ASSERT(__is_suspended(), "resume() can be called only on suspended coroutines");
+        _LIBCPP_ASSERT(!done(), "resume() has undefined behavior when the coroutine is done");
+        __builtin_coro_resume(__handle_);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    void destroy() const {
+        _LIBCPP_ASSERT(__is_suspended(), "destroy() can be called only on suspended coroutines");
+        __builtin_coro_destroy(__handle_);
+    }
+
+private:
+    bool __is_suspended() const {
+        // FIXME actually implement a check for if the coro is suspended.
+        return __handle_ != nullptr;
+    }
+
+    void* __handle_ = nullptr;
+};
+
+// [coroutine.handle.compare]
+inline _LIBCPP_HIDE_FROM_ABI
+constexpr bool operator==(coroutine_handle<> __x, coroutine_handle<> __y) noexcept {
+    return __x.address() == __y.address();
+}
+inline _LIBCPP_HIDE_FROM_ABI
+constexpr strong_ordering operator<=>(coroutine_handle<> __x, coroutine_handle<> __y) noexcept {
+    return compare_three_way()(__x.address(), __y.address());
+}
+
+template <class _Promise>
+struct _LIBCPP_TEMPLATE_VIS coroutine_handle {
+public:
+    // [coroutine.handle.con], construct/reset
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr coroutine_handle() noexcept = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr coroutine_handle(nullptr_t) noexcept {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    static coroutine_handle from_promise(_Promise& __promise) {
+        using _RawPromise = __remove_cv_t<_Promise>;
+        coroutine_handle __tmp;
+        __tmp.__handle_ =
+            __builtin_coro_promise(_VSTD::addressof(const_cast<_RawPromise&>(__promise)), alignof(_Promise), true);
+        return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    coroutine_handle& operator=(nullptr_t) noexcept {
+        __handle_ = nullptr;
+        return *this;
+    }
+
+    // [coroutine.handle.export.import], export/import
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void* address() const noexcept { return __handle_; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    static constexpr coroutine_handle from_address(void* __addr) noexcept {
+        coroutine_handle __tmp;
+        __tmp.__handle_ = __addr;
+        return __tmp;
+    }
+
+    // [coroutine.handle.conv], conversion
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr operator coroutine_handle<>() const noexcept {
+        return coroutine_handle<>::from_address(address());
+    }
+
+    // [coroutine.handle.observers], observers
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit operator bool() const noexcept {
+        return __handle_ != nullptr;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    bool done() const {
+        _LIBCPP_ASSERT(__is_suspended(), "done() can be called only on suspended coroutines");
+        return __builtin_coro_done(__handle_);
+    }
+
+    // [coroutine.handle.resumption], resumption
+    _LIBCPP_HIDE_FROM_ABI
+    void operator()() const { resume(); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    void resume() const {
+        _LIBCPP_ASSERT(__is_suspended(), "resume() can be called only on suspended coroutines");
+        _LIBCPP_ASSERT(!done(), "resume() has undefined behavior when the coroutine is done");
+        __builtin_coro_resume(__handle_);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    void destroy() const {
+        _LIBCPP_ASSERT(__is_suspended(), "destroy() can be called only on suspended coroutines");
+        __builtin_coro_destroy(__handle_);
+    }
+
+    // [coroutine.handle.promise], promise access
+    _LIBCPP_HIDE_FROM_ABI
+    _Promise& promise() const {
+        return *static_cast<_Promise*>(__builtin_coro_promise(this->__handle_, alignof(_Promise), false));
+    }
+
+private:
+    bool __is_suspended() const {
+        // FIXME actually implement a check for if the coro is suspended.
+        return __handle_ != nullptr;
+    }
+    void* __handle_ = nullptr;
+};
+
+// [coroutine.handle.hash]
+template <class _Tp>
+struct hash<coroutine_handle<_Tp>> {
+    _LIBCPP_HIDE_FROM_ABI
+    size_t operator()(const coroutine_handle<_Tp>& __v) const noexcept { return hash<void*>()(__v.address()); }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // __LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___COROUTINE_COROUTINE_HANDLE_H
diff --git a/app/src/main/cpp/libcxx/include/__coroutine/coroutine_traits.h b/app/src/main/cpp/libcxx/include/__coroutine/coroutine_traits.h
new file mode 100644
index 0000000..d513075
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__coroutine/coroutine_traits.h
@@ -0,0 +1,53 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COROUTINE_COROUTINE_TRAITS_H
+#define _LIBCPP___COROUTINE_COROUTINE_TRAITS_H
+
+#include <__config>
+#include <__type_traits/void_t.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// [coroutine.traits]
+// [coroutine.traits.primary]
+//   The header <coroutine> defined the primary template coroutine_traits such that
+// if ArgTypes is a parameter pack of types and if the qualified-id R::promise_type
+// is valid and denotes a type ([temp.deduct]), then coroutine_traits<R, ArgTypes...>
+// has the following publicly accessible memebr:
+//
+//    using promise_type = typename R::promise_type;
+//
+// Otherwise, coroutine_traits<R, ArgTypes...> has no members.
+template <class _Tp, class = void>
+struct __coroutine_traits_sfinae {};
+
+template <class _Tp>
+struct __coroutine_traits_sfinae<
+    _Tp, __void_t<typename _Tp::promise_type> >
+{
+  using promise_type = typename _Tp::promise_type;
+};
+
+template <class _Ret, class... _Args>
+struct coroutine_traits
+    : public __coroutine_traits_sfinae<_Ret>
+{
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // __LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___COROUTINE_COROUTINE_TRAITS_H
diff --git a/app/src/main/cpp/libcxx/include/__coroutine/noop_coroutine_handle.h b/app/src/main/cpp/libcxx/include/__coroutine/noop_coroutine_handle.h
new file mode 100644
index 0000000..2993047
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__coroutine/noop_coroutine_handle.h
@@ -0,0 +1,112 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___COROUTINE_NOOP_COROUTINE_HANDLE_H
+#define _LIBCPP___COROUTINE_NOOP_COROUTINE_HANDLE_H
+
+#include <__config>
+#include <__coroutine/coroutine_handle.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__builtin_coro_noop) || defined(_LIBCPP_COMPILER_GCC)
+
+// [coroutine.noop]
+// [coroutine.promise.noop]
+struct noop_coroutine_promise {};
+
+// [coroutine.handle.noop]
+template <>
+struct _LIBCPP_TEMPLATE_VIS coroutine_handle<noop_coroutine_promise> {
+public:
+    // [coroutine.handle.noop.conv], conversion
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr operator coroutine_handle<>() const noexcept {
+        return coroutine_handle<>::from_address(address());
+    }
+
+    // [coroutine.handle.noop.observers], observers
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit operator bool() const noexcept { return true; }
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr bool done() const noexcept { return false; }
+
+    // [coroutine.handle.noop.resumption], resumption
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void operator()() const noexcept {}
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void resume() const noexcept {}
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void destroy() const noexcept {}
+
+    // [coroutine.handle.noop.promise], promise access
+    _LIBCPP_HIDE_FROM_ABI
+    noop_coroutine_promise& promise() const noexcept {
+        return *static_cast<noop_coroutine_promise*>(
+            __builtin_coro_promise(this->__handle_, alignof(noop_coroutine_promise), false));
+    }
+
+    // [coroutine.handle.noop.address], address
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void* address() const noexcept { return __handle_; }
+
+private:
+    _LIBCPP_HIDE_FROM_ABI
+    friend coroutine_handle<noop_coroutine_promise> noop_coroutine() noexcept;
+
+#if __has_builtin(__builtin_coro_noop)
+    _LIBCPP_HIDE_FROM_ABI coroutine_handle() noexcept {
+        this->__handle_ = __builtin_coro_noop();
+    }
+
+    void* __handle_ = nullptr;
+
+#elif defined(_LIBCPP_COMPILER_GCC)
+    // GCC doesn't implement __builtin_coro_noop().
+    // Construct the coroutine frame manually instead.
+    struct __noop_coroutine_frame_ty_ {
+        static void __dummy_resume_destroy_func() { }
+
+        void (*__resume_)() = __dummy_resume_destroy_func;
+        void (*__destroy_)() = __dummy_resume_destroy_func;
+        struct noop_coroutine_promise __promise_;
+    };
+
+    static __noop_coroutine_frame_ty_ __noop_coroutine_frame_;
+
+    void* __handle_ = &__noop_coroutine_frame_;
+
+    _LIBCPP_HIDE_FROM_ABI coroutine_handle() noexcept = default;
+
+#endif // __has_builtin(__builtin_coro_noop)
+};
+
+using noop_coroutine_handle = coroutine_handle<noop_coroutine_promise>;
+
+#if defined(_LIBCPP_COMPILER_GCC)
+inline noop_coroutine_handle::__noop_coroutine_frame_ty_
+    noop_coroutine_handle::__noop_coroutine_frame_{};
+#endif
+
+// [coroutine.noop.coroutine]
+inline _LIBCPP_HIDE_FROM_ABI
+noop_coroutine_handle noop_coroutine() noexcept { return noop_coroutine_handle(); }
+
+#endif // __has_builtin(__builtin_coro_noop) || defined(_LIBCPP_COMPILER_GCC)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // __LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP___COROUTINE_NOOP_COROUTINE_HANDLE_H
diff --git a/app/src/main/cpp/libcxx/include/__coroutine/trivial_awaitables.h b/app/src/main/cpp/libcxx/include/__coroutine/trivial_awaitables.h
new file mode 100644
index 0000000..bbbae7a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__coroutine/trivial_awaitables.h
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef __LIBCPP___COROUTINE_TRIVIAL_AWAITABLES_H
+#define __LIBCPP___COROUTINE_TRIVIAL_AWAITABLES_H
+
+#include <__config>
+#include <__coroutine/coroutine_handle.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// [coroutine.trivial.awaitables]
+struct suspend_never {
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr bool await_ready() const noexcept { return true; }
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void await_suspend(coroutine_handle<>) const noexcept {}
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void await_resume() const noexcept {}
+};
+
+struct suspend_always {
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr bool await_ready() const noexcept { return false; }
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void await_suspend(coroutine_handle<>) const noexcept {}
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void await_resume() const noexcept {}
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // __LIBCPP_STD_VER > 17
+
+#endif // __LIBCPP___COROUTINE_TRIVIAL_AWAITABLES_H
diff --git a/app/src/main/cpp/libcxx/include/__debug b/app/src/main/cpp/libcxx/include/__debug
new file mode 100644
index 0000000..140cc91
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__debug
@@ -0,0 +1,266 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___DEBUG
+#define _LIBCPP___DEBUG
+
+#include <__assert>
+#include <__config>
+#include <__type_traits/is_constant_evaluated.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if defined(_LIBCPP_ENABLE_DEBUG_MODE) && !defined(_LIBCPP_CXX03_LANG) && !defined(_LIBCPP_DEBUG_RANDOMIZE_UNSPECIFIED_STABILITY)
+# define _LIBCPP_DEBUG_RANDOMIZE_UNSPECIFIED_STABILITY
+#endif
+
+#if defined(_LIBCPP_ENABLE_DEBUG_MODE) && !defined(_LIBCPP_DEBUG_ITERATOR_BOUNDS_CHECKING)
+# define _LIBCPP_DEBUG_ITERATOR_BOUNDS_CHECKING
+#endif
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+#   define _LIBCPP_DEBUG_ASSERT(x, m) _LIBCPP_ASSERT(::std::__libcpp_is_constant_evaluated() || (x), m)
+#else
+#   define _LIBCPP_DEBUG_ASSERT(x, m) ((void)0)
+#endif
+
+#if defined(_LIBCPP_ENABLE_DEBUG_MODE) || defined(_LIBCPP_BUILDING_LIBRARY)
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+struct _LIBCPP_TYPE_VIS __c_node;
+
+struct _LIBCPP_TYPE_VIS __i_node
+{
+    void* __i_;
+    __i_node* __next_;
+    __c_node* __c_;
+
+    __i_node(const __i_node&) = delete;
+    __i_node& operator=(const __i_node&) = delete;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __i_node(void* __i, __i_node* __next, __c_node* __c)
+        : __i_(__i), __next_(__next), __c_(__c) {}
+    ~__i_node();
+};
+
+struct _LIBCPP_TYPE_VIS __c_node
+{
+    void* __c_;
+    __c_node* __next_;
+    __i_node** beg_;
+    __i_node** end_;
+    __i_node** cap_;
+
+    __c_node(const __c_node&) = delete;
+    __c_node& operator=(const __c_node&) = delete;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __c_node(void* __c, __c_node* __next)
+        : __c_(__c), __next_(__next), beg_(nullptr), end_(nullptr), cap_(nullptr) {}
+    virtual ~__c_node();
+
+    virtual bool __dereferenceable(const void*) const = 0;
+    virtual bool __decrementable(const void*) const = 0;
+    virtual bool __addable(const void*, ptrdiff_t) const = 0;
+    virtual bool __subscriptable(const void*, ptrdiff_t) const = 0;
+
+    void __add(__i_node* __i);
+    _LIBCPP_HIDDEN void __remove(__i_node* __i);
+};
+
+template <class _Cont>
+struct _C_node
+    : public __c_node
+{
+    explicit _C_node(void* __c, __c_node* __n)
+        : __c_node(__c, __n) {}
+
+    bool __dereferenceable(const void*) const override;
+    bool __decrementable(const void*) const override;
+    bool __addable(const void*, ptrdiff_t) const override;
+    bool __subscriptable(const void*, ptrdiff_t) const override;
+};
+
+template <class _Cont>
+inline bool
+_C_node<_Cont>::__dereferenceable(const void* __i) const
+{
+    typedef typename _Cont::const_iterator iterator;
+    const iterator* __j = static_cast<const iterator*>(__i);
+    _Cont* _Cp = static_cast<_Cont*>(__c_);
+    return _Cp->__dereferenceable(__j);
+}
+
+template <class _Cont>
+inline bool
+_C_node<_Cont>::__decrementable(const void* __i) const
+{
+    typedef typename _Cont::const_iterator iterator;
+    const iterator* __j = static_cast<const iterator*>(__i);
+    _Cont* _Cp = static_cast<_Cont*>(__c_);
+    return _Cp->__decrementable(__j);
+}
+
+template <class _Cont>
+inline bool
+_C_node<_Cont>::__addable(const void* __i, ptrdiff_t __n) const
+{
+    typedef typename _Cont::const_iterator iterator;
+    const iterator* __j = static_cast<const iterator*>(__i);
+    _Cont* _Cp = static_cast<_Cont*>(__c_);
+    return _Cp->__addable(__j, __n);
+}
+
+template <class _Cont>
+inline bool
+_C_node<_Cont>::__subscriptable(const void* __i, ptrdiff_t __n) const
+{
+    typedef typename _Cont::const_iterator iterator;
+    const iterator* __j = static_cast<const iterator*>(__i);
+    _Cont* _Cp = static_cast<_Cont*>(__c_);
+    return _Cp->__subscriptable(__j, __n);
+}
+
+class _LIBCPP_TYPE_VIS __libcpp_db
+{
+    __c_node** __cbeg_;
+    __c_node** __cend_;
+    size_t   __csz_;
+    __i_node** __ibeg_;
+    __i_node** __iend_;
+    size_t   __isz_;
+
+    explicit __libcpp_db();
+public:
+    __libcpp_db(const __libcpp_db&) = delete;
+    __libcpp_db& operator=(const __libcpp_db&) = delete;
+
+    ~__libcpp_db();
+
+    class __db_c_iterator;
+    class __db_c_const_iterator;
+    class __db_i_iterator;
+    class __db_i_const_iterator;
+
+    __db_c_const_iterator __c_end() const;
+    __db_i_const_iterator __i_end() const;
+
+    typedef __c_node*(_InsertConstruct)(void*, void*, __c_node*);
+
+    template <class _Cont>
+    _LIBCPP_INLINE_VISIBILITY static __c_node* __create_C_node(void *__mem, void *__c, __c_node *__next) {
+        return ::new (__mem) _C_node<_Cont>(__c, __next);
+    }
+
+    template <class _Cont>
+    _LIBCPP_INLINE_VISIBILITY
+    void __insert_c(_Cont* __c)
+    {
+        __insert_c(static_cast<void*>(__c), &__create_C_node<_Cont>);
+    }
+
+    void __insert_i(void* __i);
+    void __insert_c(void* __c, _InsertConstruct* __fn);
+    void __erase_c(void* __c);
+
+    void __insert_ic(void* __i, const void* __c);
+    void __iterator_copy(void* __i, const void* __i0);
+    void __erase_i(void* __i);
+
+    void* __find_c_from_i(void* __i) const;
+    void __invalidate_all(void* __c);
+    __c_node* __find_c_and_lock(void* __c) const;
+    __c_node* __find_c(void* __c) const;
+    void unlock() const;
+
+    void swap(void* __c1, void* __c2);
+
+
+    bool __dereferenceable(const void* __i) const;
+    bool __decrementable(const void* __i) const;
+    bool __addable(const void* __i, ptrdiff_t __n) const;
+    bool __subscriptable(const void* __i, ptrdiff_t __n) const;
+    bool __less_than_comparable(const void* __i, const void* __j) const;
+private:
+    _LIBCPP_HIDDEN
+    __i_node* __insert_iterator(void* __i);
+    _LIBCPP_HIDDEN
+    __i_node* __find_iterator(const void* __i) const;
+
+    friend _LIBCPP_FUNC_VIS __libcpp_db* __get_db();
+};
+
+_LIBCPP_FUNC_VIS __libcpp_db* __get_db();
+_LIBCPP_FUNC_VIS const __libcpp_db* __get_const_db();
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // defined(_LIBCPP_ENABLE_DEBUG_MODE) || defined(_LIBCPP_BUILDING_LIBRARY)
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 inline void __debug_db_insert_c(_Tp* __c) {
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    if (!__libcpp_is_constant_evaluated())
+        __get_db()->__insert_c(__c);
+#else
+    (void)(__c);
+#endif
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 inline void __debug_db_insert_i(_Tp* __i) {
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    if (!__libcpp_is_constant_evaluated())
+        __get_db()->__insert_i(__i);
+#else
+    (void)(__i);
+#endif
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 inline void __debug_db_erase_c(_Tp* __c) {
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    if (!__libcpp_is_constant_evaluated())
+        __get_db()->__erase_c(__c);
+#else
+    (void)(__c);
+#endif
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 inline void __debug_db_swap(_Tp* __lhs, _Tp* __rhs) {
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    if (!__libcpp_is_constant_evaluated())
+        __get_db()->swap(__lhs, __rhs);
+#else
+    (void)(__lhs);
+    (void)(__rhs);
+#endif
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 inline void __debug_db_invalidate_all(_Tp* __c) {
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    if (!__libcpp_is_constant_evaluated())
+        __get_db()->__invalidate_all(__c);
+#else
+    (void)(__c);
+#endif
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___DEBUG
diff --git a/app/src/main/cpp/libcxx/include/__debug_utils/randomize_range.h b/app/src/main/cpp/libcxx/include/__debug_utils/randomize_range.h
new file mode 100644
index 0000000..dce6192
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__debug_utils/randomize_range.h
@@ -0,0 +1,43 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___LIBCXX_DEBUG_RANDOMIZE_RANGE_H
+#define _LIBCPP___LIBCXX_DEBUG_RANDOMIZE_RANGE_H
+
+#include <__config>
+
+#ifdef _LIBCPP_DEBUG_RANDOMIZE_UNSPECIFIED_STABILITY
+#  include <__algorithm/shuffle.h>
+#  include <__type_traits/is_constant_evaluated.h>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _AlgPolicy, class _Iterator, class _Sentinel>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+void __debug_randomize_range(_Iterator __first, _Sentinel __last) {
+#ifdef _LIBCPP_DEBUG_RANDOMIZE_UNSPECIFIED_STABILITY
+#  ifdef _LIBCPP_CXX03_LANG
+#    error Support for unspecified stability is only for C++11 and higher
+#  endif
+
+  if (!__libcpp_is_constant_evaluated())
+    std::__shuffle<_AlgPolicy>(__first, __last, __libcpp_debug_randomizer());
+#else
+  (void)__first;
+  (void)__last;
+#endif
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___LIBCXX_DEBUG_RANDOMIZE_RANGE_H
diff --git a/app/src/main/cpp/libcxx/include/__errc b/app/src/main/cpp/libcxx/include/__errc
new file mode 100644
index 0000000..17bbe0e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__errc
@@ -0,0 +1,217 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ERRC
+#define _LIBCPP___ERRC
+
+/*
+    system_error synopsis
+
+namespace std
+{
+
+enum class errc
+{
+    address_family_not_supported,       // EAFNOSUPPORT
+    address_in_use,                     // EADDRINUSE
+    address_not_available,              // EADDRNOTAVAIL
+    already_connected,                  // EISCONN
+    argument_list_too_long,             // E2BIG
+    argument_out_of_domain,             // EDOM
+    bad_address,                        // EFAULT
+    bad_file_descriptor,                // EBADF
+    bad_message,                        // EBADMSG
+    broken_pipe,                        // EPIPE
+    connection_aborted,                 // ECONNABORTED
+    connection_already_in_progress,     // EALREADY
+    connection_refused,                 // ECONNREFUSED
+    connection_reset,                   // ECONNRESET
+    cross_device_link,                  // EXDEV
+    destination_address_required,       // EDESTADDRREQ
+    device_or_resource_busy,            // EBUSY
+    directory_not_empty,                // ENOTEMPTY
+    executable_format_error,            // ENOEXEC
+    file_exists,                        // EEXIST
+    file_too_large,                     // EFBIG
+    filename_too_long,                  // ENAMETOOLONG
+    function_not_supported,             // ENOSYS
+    host_unreachable,                   // EHOSTUNREACH
+    identifier_removed,                 // EIDRM
+    illegal_byte_sequence,              // EILSEQ
+    inappropriate_io_control_operation, // ENOTTY
+    interrupted,                        // EINTR
+    invalid_argument,                   // EINVAL
+    invalid_seek,                       // ESPIPE
+    io_error,                           // EIO
+    is_a_directory,                     // EISDIR
+    message_size,                       // EMSGSIZE
+    network_down,                       // ENETDOWN
+    network_reset,                      // ENETRESET
+    network_unreachable,                // ENETUNREACH
+    no_buffer_space,                    // ENOBUFS
+    no_child_process,                   // ECHILD
+    no_link,                            // ENOLINK
+    no_lock_available,                  // ENOLCK
+    no_message_available,               // ENODATA
+    no_message,                         // ENOMSG
+    no_protocol_option,                 // ENOPROTOOPT
+    no_space_on_device,                 // ENOSPC
+    no_stream_resources,                // ENOSR
+    no_such_device_or_address,          // ENXIO
+    no_such_device,                     // ENODEV
+    no_such_file_or_directory,          // ENOENT
+    no_such_process,                    // ESRCH
+    not_a_directory,                    // ENOTDIR
+    not_a_socket,                       // ENOTSOCK
+    not_a_stream,                       // ENOSTR
+    not_connected,                      // ENOTCONN
+    not_enough_memory,                  // ENOMEM
+    not_supported,                      // ENOTSUP
+    operation_canceled,                 // ECANCELED
+    operation_in_progress,              // EINPROGRESS
+    operation_not_permitted,            // EPERM
+    operation_not_supported,            // EOPNOTSUPP
+    operation_would_block,              // EWOULDBLOCK
+    owner_dead,                         // EOWNERDEAD
+    permission_denied,                  // EACCES
+    protocol_error,                     // EPROTO
+    protocol_not_supported,             // EPROTONOSUPPORT
+    read_only_file_system,              // EROFS
+    resource_deadlock_would_occur,      // EDEADLK
+    resource_unavailable_try_again,     // EAGAIN
+    result_out_of_range,                // ERANGE
+    state_not_recoverable,              // ENOTRECOVERABLE
+    stream_timeout,                     // ETIME
+    text_file_busy,                     // ETXTBSY
+    timed_out,                          // ETIMEDOUT
+    too_many_files_open_in_system,      // ENFILE
+    too_many_files_open,                // EMFILE
+    too_many_links,                     // EMLINK
+    too_many_symbolic_link_levels,      // ELOOP
+    value_too_large,                    // EOVERFLOW
+    wrong_protocol_type                 // EPROTOTYPE
+};
+
+*/
+
+#include <__config>
+#include <cerrno>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Some error codes are not present on all platforms, so we provide equivalents
+// for them:
+
+//enum class errc
+_LIBCPP_DECLARE_STRONG_ENUM(errc)
+{
+    address_family_not_supported        = EAFNOSUPPORT,
+    address_in_use                      = EADDRINUSE,
+    address_not_available               = EADDRNOTAVAIL,
+    already_connected                   = EISCONN,
+    argument_list_too_long              = E2BIG,
+    argument_out_of_domain              = EDOM,
+    bad_address                         = EFAULT,
+    bad_file_descriptor                 = EBADF,
+    bad_message                         = EBADMSG,
+    broken_pipe                         = EPIPE,
+    connection_aborted                  = ECONNABORTED,
+    connection_already_in_progress      = EALREADY,
+    connection_refused                  = ECONNREFUSED,
+    connection_reset                    = ECONNRESET,
+    cross_device_link                   = EXDEV,
+    destination_address_required        = EDESTADDRREQ,
+    device_or_resource_busy             = EBUSY,
+    directory_not_empty                 = ENOTEMPTY,
+    executable_format_error             = ENOEXEC,
+    file_exists                         = EEXIST,
+    file_too_large                      = EFBIG,
+    filename_too_long                   = ENAMETOOLONG,
+    function_not_supported              = ENOSYS,
+    host_unreachable                    = EHOSTUNREACH,
+    identifier_removed                  = EIDRM,
+    illegal_byte_sequence               = EILSEQ,
+    inappropriate_io_control_operation  = ENOTTY,
+    interrupted                         = EINTR,
+    invalid_argument                    = EINVAL,
+    invalid_seek                        = ESPIPE,
+    io_error                            = EIO,
+    is_a_directory                      = EISDIR,
+    message_size                        = EMSGSIZE,
+    network_down                        = ENETDOWN,
+    network_reset                       = ENETRESET,
+    network_unreachable                 = ENETUNREACH,
+    no_buffer_space                     = ENOBUFS,
+    no_child_process                    = ECHILD,
+    no_link                             = ENOLINK,
+    no_lock_available                   = ENOLCK,
+#ifdef ENODATA
+    no_message_available                = ENODATA,
+#else
+    no_message_available                = ENOMSG,
+#endif
+    no_message                          = ENOMSG,
+    no_protocol_option                  = ENOPROTOOPT,
+    no_space_on_device                  = ENOSPC,
+#ifdef ENOSR
+    no_stream_resources                 = ENOSR,
+#else
+    no_stream_resources                 = ENOMEM,
+#endif
+    no_such_device_or_address           = ENXIO,
+    no_such_device                      = ENODEV,
+    no_such_file_or_directory           = ENOENT,
+    no_such_process                     = ESRCH,
+    not_a_directory                     = ENOTDIR,
+    not_a_socket                        = ENOTSOCK,
+#ifdef ENOSTR
+    not_a_stream                        = ENOSTR,
+#else
+    not_a_stream                        = EINVAL,
+#endif
+    not_connected                       = ENOTCONN,
+    not_enough_memory                   = ENOMEM,
+    not_supported                       = ENOTSUP,
+    operation_canceled                  = ECANCELED,
+    operation_in_progress               = EINPROGRESS,
+    operation_not_permitted             = EPERM,
+    operation_not_supported             = EOPNOTSUPP,
+    operation_would_block               = EWOULDBLOCK,
+    owner_dead                          = EOWNERDEAD,
+    permission_denied                   = EACCES,
+    protocol_error                      = EPROTO,
+    protocol_not_supported              = EPROTONOSUPPORT,
+    read_only_file_system               = EROFS,
+    resource_deadlock_would_occur       = EDEADLK,
+    resource_unavailable_try_again      = EAGAIN,
+    result_out_of_range                 = ERANGE,
+    state_not_recoverable               = ENOTRECOVERABLE,
+#ifdef ETIME
+    stream_timeout                      = ETIME,
+#else
+    stream_timeout                      = ETIMEDOUT,
+#endif
+    text_file_busy                      = ETXTBSY,
+    timed_out                           = ETIMEDOUT,
+    too_many_files_open_in_system       = ENFILE,
+    too_many_files_open                 = EMFILE,
+    too_many_links                      = EMLINK,
+    too_many_symbolic_link_levels       = ELOOP,
+    value_too_large                     = EOVERFLOW,
+    wrong_protocol_type                 = EPROTOTYPE
+};
+_LIBCPP_DECLARE_STRONG_ENUM_EPILOG(errc)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ERRC
diff --git a/app/src/main/cpp/libcxx/include/__expected/bad_expected_access.h b/app/src/main/cpp/libcxx/include/__expected/bad_expected_access.h
new file mode 100644
index 0000000..361eab4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__expected/bad_expected_access.h
@@ -0,0 +1,64 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+#ifndef _LIBCPP___EXPECTED_BAD_EXPECTED_ACCESS_H
+#define _LIBCPP___EXPECTED_BAD_EXPECTED_ACCESS_H
+
+#include <__config>
+#include <__utility/move.h>
+
+#include <exception>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER >= 23
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Err>
+class bad_expected_access;
+
+template <>
+class bad_expected_access<void> : public exception {
+protected:
+  _LIBCPP_HIDE_FROM_ABI bad_expected_access() noexcept                             = default;
+  _LIBCPP_HIDE_FROM_ABI bad_expected_access(const bad_expected_access&)            = default;
+  _LIBCPP_HIDE_FROM_ABI bad_expected_access(bad_expected_access&&)                 = default;
+  _LIBCPP_HIDE_FROM_ABI bad_expected_access& operator=(const bad_expected_access&) = default;
+  _LIBCPP_HIDE_FROM_ABI bad_expected_access& operator=(bad_expected_access&&)      = default;
+  ~bad_expected_access() override                                                  = default;
+
+public:
+  // The way this has been designed (by using a class template below) means that we'll already
+  // have a profusion of these vtables in TUs, and the dynamic linker will already have a bunch
+  // of work to do. So it is not worth hiding the <void> specialization in the dylib, given that
+  // it adds deployment target restrictions.
+  const char* what() const noexcept override { return "bad access to std::expected"; }
+};
+
+template <class _Err>
+class bad_expected_access : public bad_expected_access<void> {
+public:
+  _LIBCPP_HIDE_FROM_ABI explicit bad_expected_access(_Err __e) : __unex_(std::move(__e)) {}
+
+  _LIBCPP_HIDE_FROM_ABI _Err& error() & noexcept { return __unex_; }
+  _LIBCPP_HIDE_FROM_ABI const _Err& error() const& noexcept { return __unex_; }
+  _LIBCPP_HIDE_FROM_ABI _Err&& error() && noexcept { return std::move(__unex_); }
+  _LIBCPP_HIDE_FROM_ABI const _Err&& error() const&& noexcept { return std::move(__unex_); }
+
+private:
+  _Err __unex_;
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 23
+
+#endif // _LIBCPP___EXPECTED_BAD_EXPECTED_ACCESS_H
diff --git a/app/src/main/cpp/libcxx/include/__expected/expected.h b/app/src/main/cpp/libcxx/include/__expected/expected.h
new file mode 100644
index 0000000..e1f590c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__expected/expected.h
@@ -0,0 +1,973 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+#ifndef _LIBCPP___EXPECTED_EXPECTED_H
+#define _LIBCPP___EXPECTED_EXPECTED_H
+
+#include <__assert>
+#include <__config>
+#include <__expected/bad_expected_access.h>
+#include <__expected/unexpect.h>
+#include <__expected/unexpected.h>
+#include <__memory/addressof.h>
+#include <__memory/construct_at.h>
+#include <__type_traits/conjunction.h>
+#include <__type_traits/disjunction.h>
+#include <__type_traits/is_assignable.h>
+#include <__type_traits/is_constructible.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_copy_assignable.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__type_traits/is_default_constructible.h>
+#include <__type_traits/is_function.h>
+#include <__type_traits/is_move_assignable.h>
+#include <__type_traits/is_move_constructible.h>
+#include <__type_traits/is_nothrow_constructible.h>
+#include <__type_traits/is_nothrow_copy_assignable.h>
+#include <__type_traits/is_nothrow_copy_constructible.h>
+#include <__type_traits/is_nothrow_default_constructible.h>
+#include <__type_traits/is_nothrow_move_assignable.h>
+#include <__type_traits/is_nothrow_move_constructible.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_swappable.h>
+#include <__type_traits/is_trivially_copy_constructible.h>
+#include <__type_traits/is_trivially_destructible.h>
+#include <__type_traits/is_trivially_move_constructible.h>
+#include <__type_traits/is_void.h>
+#include <__type_traits/lazy.h>
+#include <__type_traits/negation.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/exception_guard.h>
+#include <__utility/forward.h>
+#include <__utility/in_place.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <cstdlib> // for std::abort
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER >= 23
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace __expected {
+
+template <class _Err, class _Arg>
+_LIBCPP_HIDE_FROM_ABI void __throw_bad_expected_access(_Arg&& __arg) {
+#  ifndef _LIBCPP_NO_EXCEPTIONS
+  throw bad_expected_access<_Err>(std::forward<_Arg>(__arg));
+#  else
+  (void)__arg;
+  std::abort();
+#  endif
+}
+
+} // namespace __expected
+
+template <class _Tp, class _Err>
+class expected {
+  static_assert(
+      !is_reference_v<_Tp> &&
+          !is_function_v<_Tp> &&
+          !is_same_v<remove_cv_t<_Tp>, in_place_t> &&
+          !is_same_v<remove_cv_t<_Tp>, unexpect_t> &&
+          !__is_std_unexpected<remove_cv_t<_Tp>>::value &&
+          __valid_std_unexpected<_Err>::value
+      ,
+      "[expected.object.general] A program that instantiates the definition of template expected<T, E> for a "
+      "reference type, a function type, or for possibly cv-qualified types in_place_t, unexpect_t, or a "
+      "specialization of unexpected for the T parameter is ill-formed. A program that instantiates the "
+      "definition of the template expected<T, E> with a type for the E parameter that is not a valid "
+      "template argument for unexpected is ill-formed.");
+
+  template <class _Up, class _OtherErr>
+  friend class expected;
+
+public:
+  using value_type      = _Tp;
+  using error_type      = _Err;
+  using unexpected_type = unexpected<_Err>;
+
+  template <class _Up>
+  using rebind = expected<_Up, error_type>;
+
+  // [expected.object.ctor], constructors
+  _LIBCPP_HIDE_FROM_ABI constexpr expected()
+    noexcept(is_nothrow_default_constructible_v<_Tp>) // strengthened
+    requires is_default_constructible_v<_Tp>
+      : __has_val_(true) {
+    std::construct_at(std::addressof(__union_.__val_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected(const expected&) = delete;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected(const expected&)
+    requires(is_copy_constructible_v<_Tp> &&
+             is_copy_constructible_v<_Err> &&
+             is_trivially_copy_constructible_v<_Tp> &&
+             is_trivially_copy_constructible_v<_Err>)
+  = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected(const expected& __other)
+    noexcept(is_nothrow_copy_constructible_v<_Tp> && is_nothrow_copy_constructible_v<_Err>) // strengthened
+    requires(is_copy_constructible_v<_Tp> && is_copy_constructible_v<_Err> &&
+             !(is_trivially_copy_constructible_v<_Tp> && is_trivially_copy_constructible_v<_Err>))
+      : __has_val_(__other.__has_val_) {
+    if (__has_val_) {
+      std::construct_at(std::addressof(__union_.__val_), __other.__union_.__val_);
+    } else {
+      std::construct_at(std::addressof(__union_.__unex_), __other.__union_.__unex_);
+    }
+  }
+
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected(expected&&)
+    requires(is_move_constructible_v<_Tp> && is_move_constructible_v<_Err>
+              && is_trivially_move_constructible_v<_Tp> && is_trivially_move_constructible_v<_Err>)
+  = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected(expected&& __other)
+    noexcept(is_nothrow_move_constructible_v<_Tp> && is_nothrow_move_constructible_v<_Err>)
+    requires(is_move_constructible_v<_Tp> && is_move_constructible_v<_Err> &&
+             !(is_trivially_move_constructible_v<_Tp> && is_trivially_move_constructible_v<_Err>))
+      : __has_val_(__other.__has_val_) {
+    if (__has_val_) {
+      std::construct_at(std::addressof(__union_.__val_), std::move(__other.__union_.__val_));
+    } else {
+      std::construct_at(std::addressof(__union_.__unex_), std::move(__other.__union_.__unex_));
+    }
+  }
+
+private:
+  template <class _Up, class _OtherErr, class _UfQual, class _OtherErrQual>
+  using __can_convert =
+      _And< is_constructible<_Tp, _UfQual>,
+            is_constructible<_Err, _OtherErrQual>,
+            _Not<is_constructible<_Tp, expected<_Up, _OtherErr>&>>,
+            _Not<is_constructible<_Tp, expected<_Up, _OtherErr>>>,
+            _Not<is_constructible<_Tp, const expected<_Up, _OtherErr>&>>,
+            _Not<is_constructible<_Tp, const expected<_Up, _OtherErr>>>,
+            _Not<is_convertible<expected<_Up, _OtherErr>&, _Tp>>,
+            _Not<is_convertible<expected<_Up, _OtherErr>&&, _Tp>>,
+            _Not<is_convertible<const expected<_Up, _OtherErr>&, _Tp>>,
+            _Not<is_convertible<const expected<_Up, _OtherErr>&&, _Tp>>,
+            _Not<is_constructible<unexpected<_Err>, expected<_Up, _OtherErr>&>>,
+            _Not<is_constructible<unexpected<_Err>, expected<_Up, _OtherErr>>>,
+            _Not<is_constructible<unexpected<_Err>, const expected<_Up, _OtherErr>&>>,
+            _Not<is_constructible<unexpected<_Err>, const expected<_Up, _OtherErr>>> >;
+
+
+public:
+  template <class _Up, class _OtherErr>
+    requires __can_convert<_Up, _OtherErr, const _Up&, const _OtherErr&>::value
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit(!is_convertible_v<const _Up&, _Tp> ||
+                                           !is_convertible_v<const _OtherErr&, _Err>)
+  expected(const expected<_Up, _OtherErr>& __other)
+    noexcept(is_nothrow_constructible_v<_Tp, const _Up&> &&
+             is_nothrow_constructible_v<_Err, const _OtherErr&>) // strengthened
+      : __has_val_(__other.__has_val_) {
+    if (__has_val_) {
+      std::construct_at(std::addressof(__union_.__val_), __other.__union_.__val_);
+    } else {
+      std::construct_at(std::addressof(__union_.__unex_), __other.__union_.__unex_);
+    }
+  }
+
+  template <class _Up, class _OtherErr>
+    requires __can_convert<_Up, _OtherErr, _Up, _OtherErr>::value
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit(!is_convertible_v<_Up, _Tp> || !is_convertible_v<_OtherErr, _Err>)
+  expected(expected<_Up, _OtherErr>&& __other)
+    noexcept(is_nothrow_constructible_v<_Tp, _Up> && is_nothrow_constructible_v<_Err, _OtherErr>) // strengthened
+      : __has_val_(__other.__has_val_) {
+    if (__has_val_) {
+      std::construct_at(std::addressof(__union_.__val_), std::move(__other.__union_.__val_));
+    } else {
+      std::construct_at(std::addressof(__union_.__unex_), std::move(__other.__union_.__unex_));
+    }
+  }
+
+  template <class _Up = _Tp>
+    requires(!is_same_v<remove_cvref_t<_Up>, in_place_t> && !is_same_v<expected, remove_cvref_t<_Up>> &&
+             !__is_std_unexpected<remove_cvref_t<_Up>>::value && is_constructible_v<_Tp, _Up>)
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit(!is_convertible_v<_Up, _Tp>)
+  expected(_Up&& __u)
+    noexcept(is_nothrow_constructible_v<_Tp, _Up>) // strengthened
+      : __has_val_(true) {
+    std::construct_at(std::addressof(__union_.__val_), std::forward<_Up>(__u));
+  }
+
+
+  template <class _OtherErr>
+    requires is_constructible_v<_Err, const _OtherErr&>
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit(!is_convertible_v<const _OtherErr&, _Err>)
+  expected(const unexpected<_OtherErr>& __unex)
+    noexcept(is_nothrow_constructible_v<_Err, const _OtherErr&>) // strengthened
+      : __has_val_(false) {
+    std::construct_at(std::addressof(__union_.__unex_), __unex.error());
+  }
+
+  template <class _OtherErr>
+    requires is_constructible_v<_Err, _OtherErr>
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit(!is_convertible_v<_OtherErr, _Err>)
+  expected(unexpected<_OtherErr>&& __unex)
+    noexcept(is_nothrow_constructible_v<_Err, _OtherErr>) // strengthened
+      : __has_val_(false) {
+    std::construct_at(std::addressof(__union_.__unex_), std::move(__unex.error()));
+  }
+
+  template <class... _Args>
+    requires is_constructible_v<_Tp, _Args...>
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit expected(in_place_t, _Args&&... __args)
+    noexcept(is_nothrow_constructible_v<_Tp, _Args...>) // strengthened
+      : __has_val_(true) {
+    std::construct_at(std::addressof(__union_.__val_), std::forward<_Args>(__args)...);
+  }
+
+  template <class _Up, class... _Args>
+    requires is_constructible_v< _Tp, initializer_list<_Up>&, _Args... >
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit
+  expected(in_place_t, initializer_list<_Up> __il, _Args&&... __args)
+    noexcept(is_nothrow_constructible_v<_Tp, initializer_list<_Up>&, _Args...>) // strengthened
+      : __has_val_(true) {
+    std::construct_at(std::addressof(__union_.__val_), __il, std::forward<_Args>(__args)...);
+  }
+
+  template <class... _Args>
+    requires is_constructible_v<_Err, _Args...>
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit expected(unexpect_t, _Args&&... __args)
+    noexcept(is_nothrow_constructible_v<_Err, _Args...>)  // strengthened
+      : __has_val_(false) {
+    std::construct_at(std::addressof(__union_.__unex_), std::forward<_Args>(__args)...);
+  }
+
+  template <class _Up, class... _Args>
+    requires is_constructible_v< _Err, initializer_list<_Up>&, _Args... >
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit
+  expected(unexpect_t, initializer_list<_Up> __il, _Args&&... __args)
+    noexcept(is_nothrow_constructible_v<_Err, initializer_list<_Up>&, _Args...>) // strengthened
+      : __has_val_(false) {
+    std::construct_at(std::addressof(__union_.__unex_), __il, std::forward<_Args>(__args)...);
+  }
+
+  // [expected.object.dtor], destructor
+
+  _LIBCPP_HIDE_FROM_ABI constexpr ~expected()
+    requires(is_trivially_destructible_v<_Tp> && is_trivially_destructible_v<_Err>)
+  = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr ~expected()
+    requires(!is_trivially_destructible_v<_Tp> || !is_trivially_destructible_v<_Err>)
+  {
+    if (__has_val_) {
+      std::destroy_at(std::addressof(__union_.__val_));
+    } else {
+      std::destroy_at(std::addressof(__union_.__unex_));
+    }
+  }
+
+private:
+  template <class _T1, class _T2, class... _Args>
+  _LIBCPP_HIDE_FROM_ABI static constexpr void __reinit_expected(_T1& __newval, _T2& __oldval, _Args&&... __args) {
+    if constexpr (is_nothrow_constructible_v<_T1, _Args...>) {
+      std::destroy_at(std::addressof(__oldval));
+      std::construct_at(std::addressof(__newval), std::forward<_Args>(__args)...);
+    } else if constexpr (is_nothrow_move_constructible_v<_T1>) {
+      _T1 __tmp(std::forward<_Args>(__args)...);
+      std::destroy_at(std::addressof(__oldval));
+      std::construct_at(std::addressof(__newval), std::move(__tmp));
+    } else {
+      static_assert(
+          is_nothrow_move_constructible_v<_T2>,
+          "To provide strong exception guarantee, T2 has to satisfy `is_nothrow_move_constructible_v` so that it can "
+          "be reverted to the previous state in case an exception is thrown during the assignment.");
+      _T2 __tmp(std::move(__oldval));
+      std::destroy_at(std::addressof(__oldval));
+      __exception_guard __trans([&] { std::construct_at(std::addressof(__oldval), std::move(__tmp)); });
+      std::construct_at(std::addressof(__newval), std::forward<_Args>(__args)...);
+      __trans.__complete();
+    }
+  }
+
+public:
+  // [expected.object.assign], assignment
+  _LIBCPP_HIDE_FROM_ABI constexpr expected& operator=(const expected&) = delete;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected& operator=(const expected& __rhs)
+    noexcept(is_nothrow_copy_assignable_v<_Tp> &&
+             is_nothrow_copy_constructible_v<_Tp> &&
+             is_nothrow_copy_assignable_v<_Err> &&
+             is_nothrow_copy_constructible_v<_Err>) // strengthened
+    requires(is_copy_assignable_v<_Tp> &&
+             is_copy_constructible_v<_Tp> &&
+             is_copy_assignable_v<_Err> &&
+             is_copy_constructible_v<_Err> &&
+             (is_nothrow_move_constructible_v<_Tp> ||
+              is_nothrow_move_constructible_v<_Err>))
+  {
+    if (__has_val_ && __rhs.__has_val_) {
+      __union_.__val_ = __rhs.__union_.__val_;
+    } else if (__has_val_) {
+      __reinit_expected(__union_.__unex_, __union_.__val_, __rhs.__union_.__unex_);
+    } else if (__rhs.__has_val_) {
+      __reinit_expected(__union_.__val_, __union_.__unex_, __rhs.__union_.__val_);
+    } else {
+      __union_.__unex_ = __rhs.__union_.__unex_;
+    }
+    // note: only reached if no exception+rollback was done inside __reinit_expected
+    __has_val_ = __rhs.__has_val_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected& operator=(expected&& __rhs)
+    noexcept(is_nothrow_move_assignable_v<_Tp> &&
+             is_nothrow_move_constructible_v<_Tp> &&
+             is_nothrow_move_assignable_v<_Err> &&
+             is_nothrow_move_constructible_v<_Err>)
+    requires(is_move_constructible_v<_Tp> &&
+             is_move_assignable_v<_Tp> &&
+             is_move_constructible_v<_Err> &&
+             is_move_assignable_v<_Err> &&
+             (is_nothrow_move_constructible_v<_Tp> ||
+              is_nothrow_move_constructible_v<_Err>))
+  {
+    if (__has_val_ && __rhs.__has_val_) {
+      __union_.__val_ = std::move(__rhs.__union_.__val_);
+    } else if (__has_val_) {
+      __reinit_expected(__union_.__unex_, __union_.__val_, std::move(__rhs.__union_.__unex_));
+    } else if (__rhs.__has_val_) {
+      __reinit_expected(__union_.__val_, __union_.__unex_, std::move(__rhs.__union_.__val_));
+    } else {
+      __union_.__unex_ = std::move(__rhs.__union_.__unex_);
+    }
+    // note: only reached if no exception+rollback was done inside __reinit_expected
+    __has_val_ = __rhs.__has_val_;
+    return *this;
+  }
+
+  template <class _Up = _Tp>
+  _LIBCPP_HIDE_FROM_ABI constexpr expected& operator=(_Up&& __v)
+    requires(!is_same_v<expected, remove_cvref_t<_Up>> &&
+             !__is_std_unexpected<remove_cvref_t<_Up>>::value &&
+             is_constructible_v<_Tp, _Up> &&
+             is_assignable_v<_Tp&, _Up> &&
+             (is_nothrow_constructible_v<_Tp, _Up> ||
+              is_nothrow_move_constructible_v<_Tp> ||
+              is_nothrow_move_constructible_v<_Err>))
+  {
+    if (__has_val_) {
+      __union_.__val_ = std::forward<_Up>(__v);
+    } else {
+      __reinit_expected(__union_.__val_, __union_.__unex_, std::forward<_Up>(__v));
+      __has_val_ = true;
+    }
+    return *this;
+  }
+
+private:
+  template <class _OtherErrQual>
+  static constexpr bool __can_assign_from_unexpected =
+      _And< is_constructible<_Err, _OtherErrQual>,
+            is_assignable<_Err&, _OtherErrQual>,
+            _Lazy<_Or,
+                  is_nothrow_constructible<_Err, _OtherErrQual>,
+                  is_nothrow_move_constructible<_Tp>,
+                  is_nothrow_move_constructible<_Err>> >::value;
+
+public:
+  template <class _OtherErr>
+    requires(__can_assign_from_unexpected<const _OtherErr&>)
+  _LIBCPP_HIDE_FROM_ABI constexpr expected& operator=(const unexpected<_OtherErr>& __un) {
+    if (__has_val_) {
+      __reinit_expected(__union_.__unex_, __union_.__val_, __un.error());
+      __has_val_ = false;
+    } else {
+      __union_.__unex_ = __un.error();
+    }
+    return *this;
+  }
+
+  template <class _OtherErr>
+    requires(__can_assign_from_unexpected<_OtherErr>)
+  _LIBCPP_HIDE_FROM_ABI constexpr expected& operator=(unexpected<_OtherErr>&& __un) {
+    if (__has_val_) {
+      __reinit_expected(__union_.__unex_, __union_.__val_, std::move(__un.error()));
+      __has_val_ = false;
+    } else {
+      __union_.__unex_ = std::move(__un.error());
+    }
+    return *this;
+  }
+
+  template <class... _Args>
+    requires is_nothrow_constructible_v<_Tp, _Args...>
+  _LIBCPP_HIDE_FROM_ABI constexpr _Tp& emplace(_Args&&... __args) noexcept {
+    if (__has_val_) {
+      std::destroy_at(std::addressof(__union_.__val_));
+    } else {
+      std::destroy_at(std::addressof(__union_.__unex_));
+      __has_val_ = true;
+    }
+    return *std::construct_at(std::addressof(__union_.__val_), std::forward<_Args>(__args)...);
+  }
+
+  template <class _Up, class... _Args>
+    requires is_nothrow_constructible_v< _Tp, initializer_list<_Up>&, _Args... >
+  _LIBCPP_HIDE_FROM_ABI constexpr _Tp& emplace(initializer_list<_Up> __il, _Args&&... __args) noexcept {
+    if (__has_val_) {
+      std::destroy_at(std::addressof(__union_.__val_));
+    } else {
+      std::destroy_at(std::addressof(__union_.__unex_));
+      __has_val_ = true;
+    }
+    return *std::construct_at(std::addressof(__union_.__val_), __il, std::forward<_Args>(__args)...);
+  }
+
+
+public:
+  // [expected.object.swap], swap
+  _LIBCPP_HIDE_FROM_ABI constexpr void swap(expected& __rhs)
+    noexcept(is_nothrow_move_constructible_v<_Tp> &&
+             is_nothrow_swappable_v<_Tp> &&
+             is_nothrow_move_constructible_v<_Err> &&
+             is_nothrow_swappable_v<_Err>)
+    requires(is_swappable_v<_Tp> &&
+             is_swappable_v<_Err> &&
+             is_move_constructible_v<_Tp> &&
+             is_move_constructible_v<_Err> &&
+             (is_nothrow_move_constructible_v<_Tp> ||
+              is_nothrow_move_constructible_v<_Err>))
+  {
+    auto __swap_val_unex_impl = [&](expected& __with_val, expected& __with_err) {
+      if constexpr (is_nothrow_move_constructible_v<_Err>) {
+        _Err __tmp(std::move(__with_err.__union_.__unex_));
+        std::destroy_at(std::addressof(__with_err.__union_.__unex_));
+        __exception_guard __trans([&] {
+          std::construct_at(std::addressof(__with_err.__union_.__unex_), std::move(__tmp));
+        });
+        std::construct_at(std::addressof(__with_err.__union_.__val_), std::move(__with_val.__union_.__val_));
+        __trans.__complete();
+        std::destroy_at(std::addressof(__with_val.__union_.__val_));
+        std::construct_at(std::addressof(__with_val.__union_.__unex_), std::move(__tmp));
+      } else {
+        static_assert(is_nothrow_move_constructible_v<_Tp>,
+                      "To provide strong exception guarantee, Tp has to satisfy `is_nothrow_move_constructible_v` so "
+                      "that it can be reverted to the previous state in case an exception is thrown during swap.");
+        _Tp __tmp(std::move(__with_val.__union_.__val_));
+        std::destroy_at(std::addressof(__with_val.__union_.__val_));
+        __exception_guard __trans([&] {
+          std::construct_at(std::addressof(__with_val.__union_.__val_), std::move(__tmp));
+        });
+        std::construct_at(std::addressof(__with_val.__union_.__unex_), std::move(__with_err.__union_.__unex_));
+        __trans.__complete();
+        std::destroy_at(std::addressof(__with_err.__union_.__unex_));
+        std::construct_at(std::addressof(__with_err.__union_.__val_), std::move(__tmp));
+      }
+      __with_val.__has_val_ = false;
+      __with_err.__has_val_ = true;
+    };
+
+    if (__has_val_) {
+      if (__rhs.__has_val_) {
+        using std::swap;
+        swap(__union_.__val_, __rhs.__union_.__val_);
+      } else {
+        __swap_val_unex_impl(*this, __rhs);
+      }
+    } else {
+      if (__rhs.__has_val_) {
+        __swap_val_unex_impl(__rhs, *this);
+      } else {
+        using std::swap;
+        swap(__union_.__unex_, __rhs.__union_.__unex_);
+      }
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr void swap(expected& __x, expected& __y)
+    noexcept(noexcept(__x.swap(__y)))
+    requires requires { __x.swap(__y); }
+  {
+    __x.swap(__y);
+  }
+
+  // [expected.object.obs], observers
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Tp* operator->() const noexcept {
+    _LIBCPP_ASSERT(__has_val_, "expected::operator-> requires the expected to contain a value");
+    return std::addressof(__union_.__val_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _Tp* operator->() noexcept {
+    _LIBCPP_ASSERT(__has_val_, "expected::operator-> requires the expected to contain a value");
+    return std::addressof(__union_.__val_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Tp& operator*() const& noexcept {
+    _LIBCPP_ASSERT(__has_val_, "expected::operator* requires the expected to contain a value");
+    return __union_.__val_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _Tp& operator*() & noexcept {
+    _LIBCPP_ASSERT(__has_val_, "expected::operator* requires the expected to contain a value");
+    return __union_.__val_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Tp&& operator*() const&& noexcept {
+    _LIBCPP_ASSERT(__has_val_, "expected::operator* requires the expected to contain a value");
+    return std::move(__union_.__val_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _Tp&& operator*() && noexcept {
+    _LIBCPP_ASSERT(__has_val_, "expected::operator* requires the expected to contain a value");
+    return std::move(__union_.__val_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit operator bool() const noexcept { return __has_val_; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr bool has_value() const noexcept { return __has_val_; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Tp& value() const& {
+    if (!__has_val_) {
+      __expected::__throw_bad_expected_access<_Err>(__union_.__unex_);
+    }
+    return __union_.__val_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _Tp& value() & {
+    if (!__has_val_) {
+      __expected::__throw_bad_expected_access<_Err>(__union_.__unex_);
+    }
+    return __union_.__val_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Tp&& value() const&& {
+    if (!__has_val_) {
+      __expected::__throw_bad_expected_access<_Err>(std::move(__union_.__unex_));
+    }
+    return std::move(__union_.__val_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _Tp&& value() && {
+    if (!__has_val_) {
+      __expected::__throw_bad_expected_access<_Err>(std::move(__union_.__unex_));
+    }
+    return std::move(__union_.__val_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Err& error() const& noexcept {
+    _LIBCPP_ASSERT(!__has_val_, "expected::error requires the expected to contain an error");
+    return __union_.__unex_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _Err& error() & noexcept {
+    _LIBCPP_ASSERT(!__has_val_, "expected::error requires the expected to contain an error");
+    return __union_.__unex_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Err&& error() const&& noexcept {
+    _LIBCPP_ASSERT(!__has_val_, "expected::error requires the expected to contain an error");
+    return std::move(__union_.__unex_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _Err&& error() && noexcept {
+    _LIBCPP_ASSERT(!__has_val_, "expected::error requires the expected to contain an error");
+    return std::move(__union_.__unex_);
+  }
+
+  template <class _Up>
+  _LIBCPP_HIDE_FROM_ABI constexpr _Tp value_or(_Up&& __v) const& {
+    static_assert(is_copy_constructible_v<_Tp>, "value_type has to be copy constructible");
+    static_assert(is_convertible_v<_Up, _Tp>, "argument has to be convertible to value_type");
+    return __has_val_ ? __union_.__val_ : static_cast<_Tp>(std::forward<_Up>(__v));
+  }
+
+  template <class _Up>
+  _LIBCPP_HIDE_FROM_ABI constexpr _Tp value_or(_Up&& __v) && {
+    static_assert(is_move_constructible_v<_Tp>, "value_type has to be move constructible");
+    static_assert(is_convertible_v<_Up, _Tp>, "argument has to be convertible to value_type");
+    return __has_val_ ? std::move(__union_.__val_) : static_cast<_Tp>(std::forward<_Up>(__v));
+  }
+
+  // [expected.object.eq], equality operators
+  template <class _T2, class _E2>
+    requires(!is_void_v<_T2>)
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool operator==(const expected& __x, const expected<_T2, _E2>& __y) {
+    if (__x.__has_val_ != __y.__has_val_) {
+      return false;
+    } else {
+      if (__x.__has_val_) {
+        return __x.__union_.__val_ == __y.__union_.__val_;
+      } else {
+        return __x.__union_.__unex_ == __y.__union_.__unex_;
+      }
+    }
+  }
+
+  template <class _T2>
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool operator==(const expected& __x, const _T2& __v) {
+    return __x.__has_val_ && static_cast<bool>(__x.__union_.__val_ == __v);
+  }
+
+  template <class _E2>
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool operator==(const expected& __x, const unexpected<_E2>& __e) {
+    return !__x.__has_val_ && static_cast<bool>(__x.__union_.__unex_ == __e.error());
+  }
+
+private:
+  struct __empty_t {};
+  // use named union because [[no_unique_address]] cannot be applied to an unnamed union
+  _LIBCPP_NO_UNIQUE_ADDRESS union __union_t {
+    _LIBCPP_HIDE_FROM_ABI constexpr __union_t() : __empty_() {}
+
+    _LIBCPP_HIDE_FROM_ABI constexpr ~__union_t()
+      requires(is_trivially_destructible_v<_Tp> && is_trivially_destructible_v<_Err>)
+    = default;
+
+    // the expected's destructor handles this
+    _LIBCPP_HIDE_FROM_ABI constexpr ~__union_t()
+      requires(!is_trivially_destructible_v<_Tp> || !is_trivially_destructible_v<_Err>)
+    {}
+
+    _LIBCPP_NO_UNIQUE_ADDRESS __empty_t __empty_;
+    _LIBCPP_NO_UNIQUE_ADDRESS _Tp __val_;
+    _LIBCPP_NO_UNIQUE_ADDRESS _Err __unex_;
+  } __union_;
+
+  bool __has_val_;
+};
+
+template <class _Tp, class _Err>
+  requires is_void_v<_Tp>
+class expected<_Tp, _Err> {
+  static_assert(__valid_std_unexpected<_Err>::value,
+                "[expected.void.general] A program that instantiates expected<T, E> with a E that is not a "
+                "valid argument for unexpected<E> is ill-formed");
+
+  template <class, class>
+  friend class expected;
+
+  template <class _Up, class _OtherErr, class _OtherErrQual>
+  using __can_convert =
+      _And< is_void<_Up>,
+            is_constructible<_Err, _OtherErrQual>,
+            _Not<is_constructible<unexpected<_Err>, expected<_Up, _OtherErr>&>>,
+            _Not<is_constructible<unexpected<_Err>, expected<_Up, _OtherErr>>>,
+            _Not<is_constructible<unexpected<_Err>, const expected<_Up, _OtherErr>&>>,
+            _Not<is_constructible<unexpected<_Err>, const expected<_Up, _OtherErr>>>>;
+
+public:
+  using value_type      = _Tp;
+  using error_type      = _Err;
+  using unexpected_type = unexpected<_Err>;
+
+  template <class _Up>
+  using rebind = expected<_Up, error_type>;
+
+  // [expected.void.ctor], constructors
+  _LIBCPP_HIDE_FROM_ABI constexpr expected() noexcept : __has_val_(true) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected(const expected&) = delete;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected(const expected&)
+    requires(is_copy_constructible_v<_Err> && is_trivially_copy_constructible_v<_Err>)
+  = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected(const expected& __rhs)
+    noexcept(is_nothrow_copy_constructible_v<_Err>) // strengthened
+    requires(is_copy_constructible_v<_Err> && !is_trivially_copy_constructible_v<_Err>)
+      : __has_val_(__rhs.__has_val_) {
+    if (!__rhs.__has_val_) {
+      std::construct_at(std::addressof(__union_.__unex_), __rhs.__union_.__unex_);
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected(expected&&)
+    requires(is_move_constructible_v<_Err> && is_trivially_move_constructible_v<_Err>)
+  = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected(expected&& __rhs)
+    noexcept(is_nothrow_move_constructible_v<_Err>)
+    requires(is_move_constructible_v<_Err> && !is_trivially_move_constructible_v<_Err>)
+      : __has_val_(__rhs.__has_val_) {
+    if (!__rhs.__has_val_) {
+      std::construct_at(std::addressof(__union_.__unex_), std::move(__rhs.__union_.__unex_));
+    }
+  }
+
+  template <class _Up, class _OtherErr>
+    requires __can_convert<_Up, _OtherErr, const _OtherErr&>::value
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit(!is_convertible_v<const _OtherErr&, _Err>)
+  expected(const expected<_Up, _OtherErr>& __rhs)
+    noexcept(is_nothrow_constructible_v<_Err, const _OtherErr&>) // strengthened
+      : __has_val_(__rhs.__has_val_) {
+    if (!__rhs.__has_val_) {
+      std::construct_at(std::addressof(__union_.__unex_), __rhs.__union_.__unex_);
+    }
+  }
+
+  template <class _Up, class _OtherErr>
+    requires __can_convert<_Up, _OtherErr, _OtherErr>::value
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit(!is_convertible_v<_OtherErr, _Err>)
+  expected(expected<_Up, _OtherErr>&& __rhs)
+    noexcept(is_nothrow_constructible_v<_Err, _OtherErr>) // strengthened
+      : __has_val_(__rhs.__has_val_) {
+    if (!__rhs.__has_val_) {
+      std::construct_at(std::addressof(__union_.__unex_), std::move(__rhs.__union_.__unex_));
+    }
+  }
+
+  template <class _OtherErr>
+    requires is_constructible_v<_Err, const _OtherErr&>
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit(!is_convertible_v<const _OtherErr&, _Err>)
+  expected(const unexpected<_OtherErr>& __unex)
+    noexcept(is_nothrow_constructible_v<_Err, const _OtherErr&>) // strengthened
+      : __has_val_(false) {
+    std::construct_at(std::addressof(__union_.__unex_), __unex.error());
+  }
+
+  template <class _OtherErr>
+    requires is_constructible_v<_Err, _OtherErr>
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit(!is_convertible_v<_OtherErr, _Err>)
+  expected(unexpected<_OtherErr>&& __unex)
+    noexcept(is_nothrow_constructible_v<_Err, _OtherErr>) // strengthened
+      : __has_val_(false) {
+    std::construct_at(std::addressof(__union_.__unex_), std::move(__unex.error()));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit expected(in_place_t) noexcept : __has_val_(true) {}
+
+  template <class... _Args>
+    requires is_constructible_v<_Err, _Args...>
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit expected(unexpect_t, _Args&&... __args)
+    noexcept(is_nothrow_constructible_v<_Err, _Args...>) // strengthened
+      : __has_val_(false) {
+    std::construct_at(std::addressof(__union_.__unex_), std::forward<_Args>(__args)...);
+  }
+
+  template <class _Up, class... _Args>
+    requires is_constructible_v< _Err, initializer_list<_Up>&, _Args... >
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit expected(unexpect_t, initializer_list<_Up> __il, _Args&&... __args)
+    noexcept(is_nothrow_constructible_v<_Err, initializer_list<_Up>&, _Args...>) // strengthened
+      : __has_val_(false) {
+    std::construct_at(std::addressof(__union_.__unex_), __il, std::forward<_Args>(__args)...);
+  }
+
+  // [expected.void.dtor], destructor
+
+  _LIBCPP_HIDE_FROM_ABI constexpr ~expected()
+    requires is_trivially_destructible_v<_Err>
+  = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr ~expected()
+    requires(!is_trivially_destructible_v<_Err>)
+  {
+    if (!__has_val_) {
+      std::destroy_at(std::addressof(__union_.__unex_));
+    }
+  }
+
+  // [expected.void.assign], assignment
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected& operator=(const expected&) = delete;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected& operator=(const expected& __rhs)
+    noexcept(is_nothrow_copy_assignable_v<_Err> && is_nothrow_copy_constructible_v<_Err>) // strengthened
+    requires(is_copy_assignable_v<_Err> && is_copy_constructible_v<_Err>)
+  {
+    if (__has_val_) {
+      if (!__rhs.__has_val_) {
+        std::construct_at(std::addressof(__union_.__unex_), __rhs.__union_.__unex_);
+        __has_val_ = false;
+      }
+    } else {
+      if (__rhs.__has_val_) {
+        std::destroy_at(std::addressof(__union_.__unex_));
+        __has_val_ = true;
+      } else {
+        __union_.__unex_ = __rhs.__union_.__unex_;
+      }
+    }
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected& operator=(expected&&) = delete;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr expected& operator=(expected&& __rhs)
+    noexcept(is_nothrow_move_assignable_v<_Err> &&
+             is_nothrow_move_constructible_v<_Err>)
+    requires(is_move_assignable_v<_Err> &&
+             is_move_constructible_v<_Err>)
+  {
+    if (__has_val_) {
+      if (!__rhs.__has_val_) {
+        std::construct_at(std::addressof(__union_.__unex_), std::move(__rhs.__union_.__unex_));
+        __has_val_ = false;
+      }
+    } else {
+      if (__rhs.__has_val_) {
+        std::destroy_at(std::addressof(__union_.__unex_));
+        __has_val_ = true;
+      } else {
+        __union_.__unex_ = std::move(__rhs.__union_.__unex_);
+      }
+    }
+    return *this;
+  }
+
+  template <class _OtherErr>
+    requires(is_constructible_v<_Err, const _OtherErr&> && is_assignable_v<_Err&, const _OtherErr&>)
+  _LIBCPP_HIDE_FROM_ABI constexpr expected& operator=(const unexpected<_OtherErr>& __un) {
+    if (__has_val_) {
+      std::construct_at(std::addressof(__union_.__unex_), __un.error());
+      __has_val_ = false;
+    } else {
+      __union_.__unex_ = __un.error();
+    }
+    return *this;
+  }
+
+  template <class _OtherErr>
+    requires(is_constructible_v<_Err, _OtherErr> && is_assignable_v<_Err&, _OtherErr>)
+  _LIBCPP_HIDE_FROM_ABI constexpr expected& operator=(unexpected<_OtherErr>&& __un) {
+    if (__has_val_) {
+      std::construct_at(std::addressof(__union_.__unex_), std::move(__un.error()));
+      __has_val_ = false;
+    } else {
+      __union_.__unex_ = std::move(__un.error());
+    }
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr void emplace() noexcept {
+    if (!__has_val_) {
+      std::destroy_at(std::addressof(__union_.__unex_));
+      __has_val_ = true;
+    }
+  }
+
+  // [expected.void.swap], swap
+  _LIBCPP_HIDE_FROM_ABI constexpr void swap(expected& __rhs)
+    noexcept(is_nothrow_move_constructible_v<_Err> && is_nothrow_swappable_v<_Err>)
+    requires(is_swappable_v<_Err> && is_move_constructible_v<_Err>)
+  {
+    auto __swap_val_unex_impl = [&](expected& __with_val, expected& __with_err) {
+      std::construct_at(std::addressof(__with_val.__union_.__unex_), std::move(__with_err.__union_.__unex_));
+      std::destroy_at(std::addressof(__with_err.__union_.__unex_));
+      __with_val.__has_val_ = false;
+      __with_err.__has_val_ = true;
+    };
+
+    if (__has_val_) {
+      if (!__rhs.__has_val_) {
+        __swap_val_unex_impl(*this, __rhs);
+      }
+    } else {
+      if (__rhs.__has_val_) {
+        __swap_val_unex_impl(__rhs, *this);
+      } else {
+        using std::swap;
+        swap(__union_.__unex_, __rhs.__union_.__unex_);
+      }
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr void swap(expected& __x, expected& __y)
+    noexcept(noexcept(__x.swap(__y)))
+    requires requires { __x.swap(__y); }
+  {
+    __x.swap(__y);
+  }
+
+  // [expected.void.obs], observers
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit operator bool() const noexcept { return __has_val_; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr bool has_value() const noexcept { return __has_val_; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr void operator*() const noexcept {
+    _LIBCPP_ASSERT(__has_val_, "expected::operator* requires the expected to contain a value");
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr void value() const& {
+    if (!__has_val_) {
+      __expected::__throw_bad_expected_access<_Err>(__union_.__unex_);
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr void value() && {
+    if (!__has_val_) {
+      __expected::__throw_bad_expected_access<_Err>(std::move(__union_.__unex_));
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Err& error() const& noexcept {
+    _LIBCPP_ASSERT(!__has_val_, "expected::error requires the expected to contain an error");
+    return __union_.__unex_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _Err& error() & noexcept {
+    _LIBCPP_ASSERT(!__has_val_, "expected::error requires the expected to contain an error");
+    return __union_.__unex_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Err&& error() const&& noexcept {
+    _LIBCPP_ASSERT(!__has_val_, "expected::error requires the expected to contain an error");
+    return std::move(__union_.__unex_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _Err&& error() && noexcept {
+    _LIBCPP_ASSERT(!__has_val_, "expected::error requires the expected to contain an error");
+    return std::move(__union_.__unex_);
+  }
+
+  // [expected.void.eq], equality operators
+  template <class _T2, class _E2>
+    requires is_void_v<_T2>
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool operator==(const expected& __x, const expected<_T2, _E2>& __y) {
+    if (__x.__has_val_ != __y.__has_val_) {
+      return false;
+    } else {
+      return __x.__has_val_ || static_cast<bool>(__x.__union_.__unex_ == __y.__union_.__unex_);
+    }
+  }
+
+  template <class _E2>
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool operator==(const expected& __x, const unexpected<_E2>& __y) {
+    return !__x.__has_val_ && static_cast<bool>(__x.__union_.__unex_ == __y.error());
+  }
+
+private:
+  struct __empty_t {};
+  // use named union because [[no_unique_address]] cannot be applied to an unnamed union
+  _LIBCPP_NO_UNIQUE_ADDRESS union __union_t {
+    _LIBCPP_HIDE_FROM_ABI constexpr __union_t() : __empty_() {}
+
+    _LIBCPP_HIDE_FROM_ABI constexpr ~__union_t()
+      requires(is_trivially_destructible_v<_Err>)
+    = default;
+
+    // the expected's destructor handles this
+    _LIBCPP_HIDE_FROM_ABI constexpr ~__union_t()
+      requires(!is_trivially_destructible_v<_Err>)
+    {}
+
+    _LIBCPP_NO_UNIQUE_ADDRESS __empty_t __empty_;
+    _LIBCPP_NO_UNIQUE_ADDRESS _Err __unex_;
+  } __union_;
+
+  bool __has_val_;
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 23
+
+#endif // _LIBCPP___EXPECTED_EXPECTED_H
diff --git a/app/src/main/cpp/libcxx/include/__expected/unexpect.h b/app/src/main/cpp/libcxx/include/__expected/unexpect.h
new file mode 100644
index 0000000..20bafc1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__expected/unexpect.h
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+#ifndef _LIBCPP___EXPECTED_UNEXPECT_H
+#define _LIBCPP___EXPECTED_UNEXPECT_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER >= 23
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+struct unexpect_t {
+  _LIBCPP_HIDE_FROM_ABI explicit unexpect_t() = default;
+};
+
+inline constexpr unexpect_t unexpect{};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 23
+
+#endif // _LIBCPP___EXPECTED_UNEXPECT_H
diff --git a/app/src/main/cpp/libcxx/include/__expected/unexpected.h b/app/src/main/cpp/libcxx/include/__expected/unexpected.h
new file mode 100644
index 0000000..075963a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__expected/unexpected.h
@@ -0,0 +1,122 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+#ifndef _LIBCPP___EXPECTED_UNEXPECTED_H
+#define _LIBCPP___EXPECTED_UNEXPECTED_H
+
+#include <__config>
+#include <__type_traits/conjunction.h>
+#include <__type_traits/is_array.h>
+#include <__type_traits/is_const.h>
+#include <__type_traits/is_constructible.h>
+#include <__type_traits/is_nothrow_constructible.h>
+#include <__type_traits/is_object.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_swappable.h>
+#include <__type_traits/is_volatile.h>
+#include <__type_traits/negation.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/forward.h>
+#include <__utility/in_place.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER >= 23
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Err>
+class unexpected;
+
+template <class _Tp>
+struct __is_std_unexpected : false_type {};
+
+template <class _Err>
+struct __is_std_unexpected<unexpected<_Err>> : true_type {};
+
+template <class _Tp>
+using __valid_std_unexpected = _BoolConstant< //
+    is_object_v<_Tp> &&                       //
+    !is_array_v<_Tp> &&                       //
+    !__is_std_unexpected<_Tp>::value &&       //
+    !is_const_v<_Tp> &&                       //
+    !is_volatile_v<_Tp>                       //
+    >;
+
+template <class _Err>
+class unexpected {
+  static_assert(__valid_std_unexpected<_Err>::value,
+                "[expected.un.general] states a program that instantiates std::unexpected for a non-object type, an "
+                "array type, a specialization of unexpected, or a cv-qualified type is ill-formed.");
+
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr unexpected(const unexpected&) = default;
+  _LIBCPP_HIDE_FROM_ABI constexpr unexpected(unexpected&&)      = default;
+
+  template <class _Error = _Err>
+    requires(!is_same_v<remove_cvref_t<_Error>, unexpected> && //
+             !is_same_v<remove_cvref_t<_Error>, in_place_t> && //
+             is_constructible_v<_Err, _Error>)
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit unexpected(_Error&& __error) //
+      noexcept(is_nothrow_constructible_v<_Err, _Error>)                // strengthened
+      : __unex_(std::forward<_Error>(__error)) {}
+
+  template <class... _Args>
+    requires is_constructible_v<_Err, _Args...>
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit unexpected(in_place_t, _Args&&... __args) //
+      noexcept(is_nothrow_constructible_v<_Err, _Args...>)                           // strengthened
+      : __unex_(std::forward<_Args>(__args)...) {}
+
+  template <class _Up, class... _Args>
+    requires is_constructible_v<_Err, initializer_list<_Up>&, _Args...>
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit unexpected(in_place_t, initializer_list<_Up> __il, _Args&&... __args) //
+      noexcept(is_nothrow_constructible_v<_Err, initializer_list<_Up>&, _Args...>) // strengthened
+      : __unex_(__il, std::forward<_Args>(__args)...) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr unexpected& operator=(const unexpected&) = default;
+  _LIBCPP_HIDE_FROM_ABI constexpr unexpected& operator=(unexpected&&)      = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Err& error() const& noexcept { return __unex_; }
+  _LIBCPP_HIDE_FROM_ABI constexpr _Err& error() & noexcept { return __unex_; }
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Err&& error() const&& noexcept { return std::move(__unex_); }
+  _LIBCPP_HIDE_FROM_ABI constexpr _Err&& error() && noexcept { return std::move(__unex_); }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr void swap(unexpected& __other) noexcept(is_nothrow_swappable_v<_Err>) {
+    static_assert(is_swappable_v<_Err>, "unexpected::swap requires is_swappable_v<E> to be true");
+    using std::swap;
+    swap(__unex_, __other.__unex_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr void swap(unexpected& __x, unexpected& __y) noexcept(noexcept(__x.swap(__y)))
+    requires is_swappable_v<_Err>
+  {
+    __x.swap(__y);
+  }
+
+  template <class _Err2>
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool operator==(const unexpected& __x, const unexpected<_Err2>& __y) {
+    return __x.__unex_ == __y.__unex_;
+  }
+
+private:
+  _Err __unex_;
+};
+
+template <class _Err>
+unexpected(_Err) -> unexpected<_Err>;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 23
+
+#endif // _LIBCPP___EXPECTED_UNEXPECTED_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/copy_options.h b/app/src/main/cpp/libcxx/include/__filesystem/copy_options.h
new file mode 100644
index 0000000..96c7535
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/copy_options.h
@@ -0,0 +1,84 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_COPY_OPTIONS_H
+#define _LIBCPP___FILESYSTEM_COPY_OPTIONS_H
+
+#include <__availability>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+enum class _LIBCPP_ENUM_VIS copy_options : unsigned short {
+  none = 0,
+  skip_existing = 1,
+  overwrite_existing = 2,
+  update_existing = 4,
+  recursive = 8,
+  copy_symlinks = 16,
+  skip_symlinks = 32,
+  directories_only = 64,
+  create_symlinks = 128,
+  create_hard_links = 256,
+  __in_recursive_copy = 512,
+};
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr copy_options operator&(copy_options __lhs, copy_options __rhs) {
+  return static_cast<copy_options>(static_cast<unsigned short>(__lhs) &
+                                   static_cast<unsigned short>(__rhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr copy_options operator|(copy_options __lhs, copy_options __rhs) {
+  return static_cast<copy_options>(static_cast<unsigned short>(__lhs) |
+                                   static_cast<unsigned short>(__rhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr copy_options operator^(copy_options __lhs, copy_options __rhs) {
+  return static_cast<copy_options>(static_cast<unsigned short>(__lhs) ^
+                                   static_cast<unsigned short>(__rhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr copy_options operator~(copy_options __lhs) {
+  return static_cast<copy_options>(~static_cast<unsigned short>(__lhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline copy_options& operator&=(copy_options& __lhs, copy_options __rhs) {
+  return __lhs = __lhs & __rhs;
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline copy_options& operator|=(copy_options& __lhs, copy_options __rhs) {
+  return __lhs = __lhs | __rhs;
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline copy_options& operator^=(copy_options& __lhs, copy_options __rhs) {
+  return __lhs = __lhs ^ __rhs;
+}
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_COPY_OPTIONS_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/directory_entry.h b/app/src/main/cpp/libcxx/include/__filesystem/directory_entry.h
new file mode 100644
index 0000000..b17eaaa
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/directory_entry.h
@@ -0,0 +1,527 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_DIRECTORY_ENTRY_H
+#define _LIBCPP___FILESYSTEM_DIRECTORY_ENTRY_H
+
+#include <__availability>
+#include <__chrono/time_point.h>
+#include <__config>
+#include <__errc>
+#include <__filesystem/file_status.h>
+#include <__filesystem/file_time_type.h>
+#include <__filesystem/file_type.h>
+#include <__filesystem/filesystem_error.h>
+#include <__filesystem/operations.h>
+#include <__filesystem/path.h>
+#include <__filesystem/perms.h>
+#include <__utility/unreachable.h>
+#include <cstdint>
+#include <cstdlib>
+#include <iosfwd>
+#include <system_error>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+
+class directory_entry {
+  typedef _VSTD_FS::path _Path;
+
+public:
+  // constructors and destructors
+  directory_entry() noexcept = default;
+  directory_entry(directory_entry const&) = default;
+  directory_entry(directory_entry&&) noexcept = default;
+
+  _LIBCPP_INLINE_VISIBILITY
+  explicit directory_entry(_Path const& __p) : __p_(__p) {
+    error_code __ec;
+    __refresh(&__ec);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  directory_entry(_Path const& __p, error_code& __ec) : __p_(__p) {
+    __refresh(&__ec);
+  }
+
+  ~directory_entry() {}
+
+  directory_entry& operator=(directory_entry const&) = default;
+  directory_entry& operator=(directory_entry&&) noexcept = default;
+
+  _LIBCPP_INLINE_VISIBILITY
+  void assign(_Path const& __p) {
+    __p_ = __p;
+    error_code __ec;
+    __refresh(&__ec);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void assign(_Path const& __p, error_code& __ec) {
+    __p_ = __p;
+    __refresh(&__ec);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void replace_filename(_Path const& __p) {
+    __p_.replace_filename(__p);
+    error_code __ec;
+    __refresh(&__ec);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void replace_filename(_Path const& __p, error_code& __ec) {
+    __p_ = __p_.parent_path() / __p;
+    __refresh(&__ec);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void refresh() { __refresh(); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void refresh(error_code& __ec) noexcept { __refresh(&__ec); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  _Path const& path() const noexcept { return __p_; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  operator const _Path&() const noexcept { return __p_; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool exists() const { return _VSTD_FS::exists(file_status{__get_ft()}); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool exists(error_code& __ec) const noexcept {
+    return _VSTD_FS::exists(file_status{__get_ft(&__ec)});
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_block_file() const { return __get_ft() == file_type::block; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_block_file(error_code& __ec) const noexcept {
+    return __get_ft(&__ec) == file_type::block;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_character_file() const { return __get_ft() == file_type::character; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_character_file(error_code& __ec) const noexcept {
+    return __get_ft(&__ec) == file_type::character;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_directory() const { return __get_ft() == file_type::directory; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_directory(error_code& __ec) const noexcept {
+    return __get_ft(&__ec) == file_type::directory;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_fifo() const { return __get_ft() == file_type::fifo; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_fifo(error_code& __ec) const noexcept {
+    return __get_ft(&__ec) == file_type::fifo;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_other() const { return _VSTD_FS::is_other(file_status{__get_ft()}); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_other(error_code& __ec) const noexcept {
+    return _VSTD_FS::is_other(file_status{__get_ft(&__ec)});
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_regular_file() const { return __get_ft() == file_type::regular; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_regular_file(error_code& __ec) const noexcept {
+    return __get_ft(&__ec) == file_type::regular;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_socket() const { return __get_ft() == file_type::socket; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_socket(error_code& __ec) const noexcept {
+    return __get_ft(&__ec) == file_type::socket;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_symlink() const { return __get_sym_ft() == file_type::symlink; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool is_symlink(error_code& __ec) const noexcept {
+    return __get_sym_ft(&__ec) == file_type::symlink;
+  }
+  _LIBCPP_INLINE_VISIBILITY
+  uintmax_t file_size() const { return __get_size(); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  uintmax_t file_size(error_code& __ec) const noexcept {
+    return __get_size(&__ec);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  uintmax_t hard_link_count() const { return __get_nlink(); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  uintmax_t hard_link_count(error_code& __ec) const noexcept {
+    return __get_nlink(&__ec);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  file_time_type last_write_time() const { return __get_write_time(); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  file_time_type last_write_time(error_code& __ec) const noexcept {
+    return __get_write_time(&__ec);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  file_status status() const { return __get_status(); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  file_status status(error_code& __ec) const noexcept {
+    return __get_status(&__ec);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  file_status symlink_status() const { return __get_symlink_status(); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  file_status symlink_status(error_code& __ec) const noexcept {
+    return __get_symlink_status(&__ec);
+  }
+
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool operator==(directory_entry const& __rhs) const noexcept {
+    return __p_ == __rhs.__p_;
+  }
+
+#if _LIBCPP_STD_VER <= 17
+  _LIBCPP_INLINE_VISIBILITY
+  bool operator!=(directory_entry const& __rhs) const noexcept {
+    return __p_ != __rhs.__p_;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool operator<(directory_entry const& __rhs) const noexcept {
+    return __p_ < __rhs.__p_;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool operator<=(directory_entry const& __rhs) const noexcept {
+    return __p_ <= __rhs.__p_;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool operator>(directory_entry const& __rhs) const noexcept {
+    return __p_ > __rhs.__p_;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool operator>=(directory_entry const& __rhs) const noexcept {
+    return __p_ >= __rhs.__p_;
+  }
+
+#else // _LIBCPP_STD_VER <= 17
+
+  _LIBCPP_HIDE_FROM_ABI
+  strong_ordering operator<=>(const directory_entry& __rhs) const noexcept {
+    return __p_ <=> __rhs.__p_;
+  }
+
+#endif // _LIBCPP_STD_VER <= 17
+
+  template <class _CharT, class _Traits>
+  _LIBCPP_INLINE_VISIBILITY
+  friend basic_ostream<_CharT, _Traits>& operator<<(basic_ostream<_CharT, _Traits>& __os, const directory_entry& __d) {
+    return __os << __d.path();
+  }
+
+private:
+  friend class directory_iterator;
+  friend class recursive_directory_iterator;
+  friend class _LIBCPP_HIDDEN __dir_stream;
+
+  enum _CacheType : unsigned char {
+    _Empty,
+    _IterSymlink,
+    _IterNonSymlink,
+    _RefreshSymlink,
+    _RefreshSymlinkUnresolved,
+    _RefreshNonSymlink
+  };
+
+  struct __cached_data {
+    uintmax_t __size_;
+    uintmax_t __nlink_;
+    file_time_type __write_time_;
+    perms __sym_perms_;
+    perms __non_sym_perms_;
+    file_type __type_;
+    _CacheType __cache_type_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __cached_data() noexcept { __reset(); }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __reset() {
+      __cache_type_ = _Empty;
+      __type_ = file_type::none;
+      __sym_perms_ = __non_sym_perms_ = perms::unknown;
+      __size_ = __nlink_ = uintmax_t(-1);
+      __write_time_ = file_time_type::min();
+    }
+  };
+
+  _LIBCPP_INLINE_VISIBILITY
+  static __cached_data __create_iter_result(file_type __ft) {
+    __cached_data __data;
+    __data.__type_ = __ft;
+    __data.__cache_type_ = [&]() {
+      switch (__ft) {
+      case file_type::none:
+        return _Empty;
+      case file_type::symlink:
+        return _IterSymlink;
+      default:
+        return _IterNonSymlink;
+      }
+    }();
+    return __data;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void __assign_iter_entry(_Path&& __p, __cached_data __dt) {
+    __p_ = _VSTD::move(__p);
+    __data_ = __dt;
+  }
+
+  _LIBCPP_FUNC_VIS
+  error_code __do_refresh() noexcept;
+
+  _LIBCPP_INLINE_VISIBILITY
+  static bool __is_dne_error(error_code const& __ec) {
+    if (!__ec)
+      return true;
+    switch (static_cast<errc>(__ec.value())) {
+    case errc::no_such_file_or_directory:
+    case errc::not_a_directory:
+      return true;
+    default:
+      return false;
+    }
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void __handle_error(const char* __msg, error_code* __dest_ec,
+                      error_code const& __ec, bool __allow_dne = false) const {
+    if (__dest_ec) {
+      *__dest_ec = __ec;
+      return;
+    }
+    if (__ec && (!__allow_dne || !__is_dne_error(__ec)))
+      __throw_filesystem_error(__msg, __p_, __ec);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void __refresh(error_code* __ec = nullptr) {
+    __handle_error("in directory_entry::refresh", __ec, __do_refresh(),
+                   /*allow_dne*/ true);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  file_type __get_sym_ft(error_code* __ec = nullptr) const {
+    switch (__data_.__cache_type_) {
+    case _Empty:
+      return __symlink_status(__p_, __ec).type();
+    case _IterSymlink:
+    case _RefreshSymlink:
+    case _RefreshSymlinkUnresolved:
+      if (__ec)
+        __ec->clear();
+      return file_type::symlink;
+    case _IterNonSymlink:
+    case _RefreshNonSymlink:
+      file_status __st(__data_.__type_);
+      if (__ec && !_VSTD_FS::exists(__st))
+        *__ec = make_error_code(errc::no_such_file_or_directory);
+      else if (__ec)
+        __ec->clear();
+      return __data_.__type_;
+    }
+    __libcpp_unreachable();
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  file_type __get_ft(error_code* __ec = nullptr) const {
+    switch (__data_.__cache_type_) {
+    case _Empty:
+    case _IterSymlink:
+    case _RefreshSymlinkUnresolved:
+      return __status(__p_, __ec).type();
+    case _IterNonSymlink:
+    case _RefreshNonSymlink:
+    case _RefreshSymlink: {
+      file_status __st(__data_.__type_);
+      if (__ec && !_VSTD_FS::exists(__st))
+        *__ec = make_error_code(errc::no_such_file_or_directory);
+      else if (__ec)
+        __ec->clear();
+      return __data_.__type_;
+    }
+    }
+    __libcpp_unreachable();
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  file_status __get_status(error_code* __ec = nullptr) const {
+    switch (__data_.__cache_type_) {
+    case _Empty:
+    case _IterNonSymlink:
+    case _IterSymlink:
+    case _RefreshSymlinkUnresolved:
+      return __status(__p_, __ec);
+    case _RefreshNonSymlink:
+    case _RefreshSymlink:
+      return file_status(__get_ft(__ec), __data_.__non_sym_perms_);
+    }
+    __libcpp_unreachable();
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  file_status __get_symlink_status(error_code* __ec = nullptr) const {
+    switch (__data_.__cache_type_) {
+    case _Empty:
+    case _IterNonSymlink:
+    case _IterSymlink:
+      return __symlink_status(__p_, __ec);
+    case _RefreshNonSymlink:
+      return file_status(__get_sym_ft(__ec), __data_.__non_sym_perms_);
+    case _RefreshSymlink:
+    case _RefreshSymlinkUnresolved:
+      return file_status(__get_sym_ft(__ec), __data_.__sym_perms_);
+    }
+    __libcpp_unreachable();
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  uintmax_t __get_size(error_code* __ec = nullptr) const {
+    switch (__data_.__cache_type_) {
+    case _Empty:
+    case _IterNonSymlink:
+    case _IterSymlink:
+    case _RefreshSymlinkUnresolved:
+      return _VSTD_FS::__file_size(__p_, __ec);
+    case _RefreshSymlink:
+    case _RefreshNonSymlink: {
+      error_code __m_ec;
+      file_status __st(__get_ft(&__m_ec));
+      __handle_error("in directory_entry::file_size", __ec, __m_ec);
+      if (_VSTD_FS::exists(__st) && !_VSTD_FS::is_regular_file(__st)) {
+        errc __err_kind = _VSTD_FS::is_directory(__st) ? errc::is_a_directory
+                                                       : errc::not_supported;
+        __handle_error("in directory_entry::file_size", __ec,
+                       make_error_code(__err_kind));
+      }
+      return __data_.__size_;
+    }
+    }
+    __libcpp_unreachable();
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  uintmax_t __get_nlink(error_code* __ec = nullptr) const {
+    switch (__data_.__cache_type_) {
+    case _Empty:
+    case _IterNonSymlink:
+    case _IterSymlink:
+    case _RefreshSymlinkUnresolved:
+      return _VSTD_FS::__hard_link_count(__p_, __ec);
+    case _RefreshSymlink:
+    case _RefreshNonSymlink: {
+      error_code __m_ec;
+      (void)__get_ft(&__m_ec);
+      __handle_error("in directory_entry::hard_link_count", __ec, __m_ec);
+      return __data_.__nlink_;
+    }
+    }
+    __libcpp_unreachable();
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  file_time_type __get_write_time(error_code* __ec = nullptr) const {
+    switch (__data_.__cache_type_) {
+    case _Empty:
+    case _IterNonSymlink:
+    case _IterSymlink:
+    case _RefreshSymlinkUnresolved:
+      return _VSTD_FS::__last_write_time(__p_, __ec);
+    case _RefreshSymlink:
+    case _RefreshNonSymlink: {
+      error_code __m_ec;
+      file_status __st(__get_ft(&__m_ec));
+      __handle_error("in directory_entry::last_write_time", __ec, __m_ec);
+      if (_VSTD_FS::exists(__st) &&
+          __data_.__write_time_ == file_time_type::min())
+        __handle_error("in directory_entry::last_write_time", __ec,
+                       make_error_code(errc::value_too_large));
+      return __data_.__write_time_;
+    }
+    }
+    __libcpp_unreachable();
+  }
+
+private:
+  _Path __p_;
+  __cached_data __data_;
+};
+
+class __dir_element_proxy {
+public:
+  inline _LIBCPP_INLINE_VISIBILITY directory_entry operator*() {
+    return _VSTD::move(__elem_);
+  }
+
+private:
+  friend class directory_iterator;
+  friend class recursive_directory_iterator;
+  explicit __dir_element_proxy(directory_entry const& __e) : __elem_(__e) {}
+  __dir_element_proxy(__dir_element_proxy&& __o)
+      : __elem_(_VSTD::move(__o.__elem_)) {}
+  directory_entry __elem_;
+};
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___FILESYSTEM_DIRECTORY_ENTRY_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/directory_iterator.h b/app/src/main/cpp/libcxx/include/__filesystem/directory_iterator.h
new file mode 100644
index 0000000..5ff2f01
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/directory_iterator.h
@@ -0,0 +1,165 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_DIRECTORY_ITERATOR_H
+#define _LIBCPP___FILESYSTEM_DIRECTORY_ITERATOR_H
+
+#include <__assert>
+#include <__availability>
+#include <__config>
+#include <__filesystem/directory_entry.h>
+#include <__filesystem/directory_options.h>
+#include <__filesystem/path.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/shared_ptr.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/enable_view.h>
+#include <cstddef>
+#include <system_error>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+class _LIBCPP_HIDDEN __dir_stream;
+class directory_iterator {
+public:
+  typedef directory_entry value_type;
+  typedef ptrdiff_t difference_type;
+  typedef value_type const* pointer;
+  typedef value_type const& reference;
+  typedef input_iterator_tag iterator_category;
+
+public:
+  //ctor & dtor
+  _LIBCPP_HIDE_FROM_ABI
+  directory_iterator() noexcept {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  explicit directory_iterator(const path& __p)
+      : directory_iterator(__p, nullptr) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  directory_iterator(const path& __p, directory_options __opts)
+      : directory_iterator(__p, nullptr, __opts) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  directory_iterator(const path& __p, error_code& __ec)
+      : directory_iterator(__p, &__ec) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  directory_iterator(const path& __p, directory_options __opts,
+                     error_code& __ec)
+      : directory_iterator(__p, &__ec, __opts) {}
+
+  _LIBCPP_HIDE_FROM_ABI directory_iterator(const directory_iterator&) = default;
+  _LIBCPP_HIDE_FROM_ABI directory_iterator(directory_iterator&&) = default;
+  _LIBCPP_HIDE_FROM_ABI directory_iterator& operator=(const directory_iterator&) = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  directory_iterator& operator=(directory_iterator&& __o) noexcept {
+    // non-default implementation provided to support self-move assign.
+    if (this != &__o) {
+      __imp_ = _VSTD::move(__o.__imp_);
+    }
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI ~directory_iterator() = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  const directory_entry& operator*() const {
+    _LIBCPP_ASSERT(__imp_, "The end iterator cannot be dereferenced");
+    return __dereference();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  const directory_entry* operator->() const { return &**this; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  directory_iterator& operator++() { return __increment(); }
+
+  _LIBCPP_HIDE_FROM_ABI
+  __dir_element_proxy operator++(int) {
+    __dir_element_proxy __p(**this);
+    __increment();
+    return __p;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  directory_iterator& increment(error_code& __ec) { return __increment(&__ec); }
+
+private:
+  inline _LIBCPP_HIDE_FROM_ABI friend bool
+  operator==(const directory_iterator& __lhs,
+             const directory_iterator& __rhs) noexcept;
+
+  // construct the dir_stream
+  _LIBCPP_FUNC_VIS
+  directory_iterator(const path&, error_code*,
+                     directory_options = directory_options::none);
+
+  _LIBCPP_FUNC_VIS
+  directory_iterator& __increment(error_code* __ec = nullptr);
+
+  _LIBCPP_FUNC_VIS
+  const directory_entry& __dereference() const;
+
+private:
+  shared_ptr<__dir_stream> __imp_;
+};
+
+inline _LIBCPP_HIDE_FROM_ABI bool
+operator==(const directory_iterator& __lhs,
+           const directory_iterator& __rhs) noexcept {
+  return __lhs.__imp_ == __rhs.__imp_;
+}
+
+inline _LIBCPP_HIDE_FROM_ABI bool
+operator!=(const directory_iterator& __lhs,
+           const directory_iterator& __rhs) noexcept {
+  return !(__lhs == __rhs);
+}
+
+// enable directory_iterator range-based for statements
+inline _LIBCPP_HIDE_FROM_ABI directory_iterator
+begin(directory_iterator __iter) noexcept {
+  return __iter;
+}
+
+inline _LIBCPP_HIDE_FROM_ABI directory_iterator
+end(directory_iterator) noexcept {
+  return directory_iterator();
+}
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#if _LIBCPP_STD_VER > 17
+
+template <>
+_LIBCPP_AVAILABILITY_FILESYSTEM
+inline constexpr bool _VSTD::ranges::enable_borrowed_range<_VSTD_FS::directory_iterator> = true;
+
+template <>
+_LIBCPP_AVAILABILITY_FILESYSTEM
+inline constexpr bool _VSTD::ranges::enable_view<_VSTD_FS::directory_iterator> = true;
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_DIRECTORY_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/directory_options.h b/app/src/main/cpp/libcxx/include/__filesystem/directory_options.h
new file mode 100644
index 0000000..c5c031a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/directory_options.h
@@ -0,0 +1,82 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_DIRECTORY_OPTIONS_H
+#define _LIBCPP___FILESYSTEM_DIRECTORY_OPTIONS_H
+
+#include <__availability>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+enum class _LIBCPP_ENUM_VIS directory_options : unsigned char {
+  none = 0,
+  follow_directory_symlink = 1,
+  skip_permission_denied = 2
+};
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr directory_options operator&(directory_options __lhs,
+                                             directory_options __rhs) {
+  return static_cast<directory_options>(static_cast<unsigned char>(__lhs) &
+                                        static_cast<unsigned char>(__rhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr directory_options operator|(directory_options __lhs,
+                                             directory_options __rhs) {
+  return static_cast<directory_options>(static_cast<unsigned char>(__lhs) |
+                                        static_cast<unsigned char>(__rhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr directory_options operator^(directory_options __lhs,
+                                             directory_options __rhs) {
+  return static_cast<directory_options>(static_cast<unsigned char>(__lhs) ^
+                                        static_cast<unsigned char>(__rhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr directory_options operator~(directory_options __lhs) {
+  return static_cast<directory_options>(~static_cast<unsigned char>(__lhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline directory_options& operator&=(directory_options& __lhs,
+                                     directory_options __rhs) {
+  return __lhs = __lhs & __rhs;
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline directory_options& operator|=(directory_options& __lhs,
+                                     directory_options __rhs) {
+  return __lhs = __lhs | __rhs;
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline directory_options& operator^=(directory_options& __lhs,
+                                     directory_options __rhs) {
+  return __lhs = __lhs ^ __rhs;
+}
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_DIRECTORY_OPTIONS_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/file_status.h b/app/src/main/cpp/libcxx/include/__filesystem/file_status.h
new file mode 100644
index 0000000..ac3f6cb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/file_status.h
@@ -0,0 +1,72 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_FILE_STATUS_H
+#define _LIBCPP___FILESYSTEM_FILE_STATUS_H
+
+#include <__availability>
+#include <__config>
+#include <__filesystem/file_type.h>
+#include <__filesystem/perms.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+class _LIBCPP_TYPE_VIS file_status {
+public:
+  // constructors
+  _LIBCPP_INLINE_VISIBILITY
+  file_status() noexcept : file_status(file_type::none) {}
+  _LIBCPP_INLINE_VISIBILITY
+  explicit file_status(file_type __ft, perms __prms = perms::unknown) noexcept
+      : __ft_(__ft),
+        __prms_(__prms) {}
+
+  file_status(const file_status&) noexcept = default;
+  file_status(file_status&&) noexcept = default;
+
+  _LIBCPP_INLINE_VISIBILITY
+  ~file_status() {}
+
+  file_status& operator=(const file_status&) noexcept = default;
+  file_status& operator=(file_status&&) noexcept = default;
+
+  // observers
+  _LIBCPP_INLINE_VISIBILITY
+  file_type type() const noexcept { return __ft_; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  perms permissions() const noexcept { return __prms_; }
+
+  // modifiers
+  _LIBCPP_INLINE_VISIBILITY
+  void type(file_type __ft) noexcept { __ft_ = __ft; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void permissions(perms __p) noexcept { __prms_ = __p; }
+
+private:
+  file_type __ft_;
+  perms __prms_;
+};
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_FILE_STATUS_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/file_time_type.h b/app/src/main/cpp/libcxx/include/__filesystem/file_time_type.h
new file mode 100644
index 0000000..7c4932e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/file_time_type.h
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_FILE_TIME_TYPE_H
+#define _LIBCPP___FILESYSTEM_FILE_TIME_TYPE_H
+
+#include <__availability>
+#include <__chrono/file_clock.h>
+#include <__chrono/time_point.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+typedef chrono::time_point<_FilesystemClock> file_time_type;
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_FILE_TIME_TYPE_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/file_type.h b/app/src/main/cpp/libcxx/include/__filesystem/file_type.h
new file mode 100644
index 0000000..c756a05
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/file_type.h
@@ -0,0 +1,43 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_FILE_TYPE_H
+#define _LIBCPP___FILESYSTEM_FILE_TYPE_H
+
+#include <__availability>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+// On Windows, the library never identifies files as block, character, fifo
+// or socket.
+enum class _LIBCPP_ENUM_VIS file_type : signed char {
+  none = 0,
+  not_found = -1,
+  regular = 1,
+  directory = 2,
+  symlink = 3,
+  block = 4,
+  character = 5,
+  fifo = 6,
+  socket = 7,
+  unknown = 8
+};
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_FILE_TYPE_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/filesystem_error.h b/app/src/main/cpp/libcxx/include/__filesystem/filesystem_error.h
new file mode 100644
index 0000000..effe699
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/filesystem_error.h
@@ -0,0 +1,104 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_FILESYSTEM_ERROR_H
+#define _LIBCPP___FILESYSTEM_FILESYSTEM_ERROR_H
+
+#include <__availability>
+#include <__config>
+#include <__filesystem/path.h>
+#include <__memory/shared_ptr.h>
+#include <__utility/forward.h>
+#include <iosfwd>
+#include <new>
+#include <system_error>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+class _LIBCPP_AVAILABILITY_FILESYSTEM _LIBCPP_EXCEPTION_ABI filesystem_error : public system_error {
+public:
+  _LIBCPP_INLINE_VISIBILITY
+  filesystem_error(const string& __what, error_code __ec)
+      : system_error(__ec, __what),
+        __storage_(make_shared<_Storage>(path(), path())) {
+    __create_what(0);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  filesystem_error(const string& __what, const path& __p1, error_code __ec)
+      : system_error(__ec, __what),
+        __storage_(make_shared<_Storage>(__p1, path())) {
+    __create_what(1);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  filesystem_error(const string& __what, const path& __p1, const path& __p2,
+                   error_code __ec)
+      : system_error(__ec, __what),
+        __storage_(make_shared<_Storage>(__p1, __p2)) {
+    __create_what(2);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  const path& path1() const noexcept { return __storage_->__p1_; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  const path& path2() const noexcept { return __storage_->__p2_; }
+
+  filesystem_error(const filesystem_error&) = default;
+  ~filesystem_error() override; // key function
+
+  _LIBCPP_HIDE_FROM_ABI_VIRTUAL
+  const char* what() const noexcept override {
+    return __storage_->__what_.c_str();
+  }
+
+  void __create_what(int __num_paths);
+
+private:
+  struct _LIBCPP_HIDDEN _Storage {
+    _LIBCPP_INLINE_VISIBILITY
+    _Storage(const path& __p1, const path& __p2) : __p1_(__p1), __p2_(__p2) {}
+
+    path __p1_;
+    path __p2_;
+    string __what_;
+  };
+  shared_ptr<_Storage> __storage_;
+};
+
+// TODO(ldionne): We need to pop the pragma and push it again after
+//                filesystem_error to work around PR41078.
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+template <class... _Args>
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+#ifndef _LIBCPP_NO_EXCEPTIONS
+void __throw_filesystem_error(_Args&&... __args) {
+  throw filesystem_error(_VSTD::forward<_Args>(__args)...);
+}
+#else
+void __throw_filesystem_error(_Args&&...) {
+  _VSTD::abort();
+}
+#endif
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_FILESYSTEM_ERROR_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/operations.h b/app/src/main/cpp/libcxx/include/__filesystem/operations.h
new file mode 100644
index 0000000..f48d301
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/operations.h
@@ -0,0 +1,201 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_OPERATIONS_H
+#define _LIBCPP___FILESYSTEM_OPERATIONS_H
+
+#include <__availability>
+#include <__chrono/time_point.h>
+#include <__config>
+#include <__filesystem/copy_options.h>
+#include <__filesystem/file_status.h>
+#include <__filesystem/file_time_type.h>
+#include <__filesystem/file_type.h>
+#include <__filesystem/path.h>
+#include <__filesystem/perm_options.h>
+#include <__filesystem/perms.h>
+#include <__filesystem/space_info.h>
+#include <cstdint>
+#include <system_error>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+_LIBCPP_FUNC_VIS path __absolute(const path&, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS path __canonical(const path&, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS bool __copy_file(const path& __from, const path& __to, copy_options __opt, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS void __copy_symlink(const path& __existing_symlink, const path& __new_symlink, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS void __copy(const path& __from, const path& __to, copy_options __opt, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS bool __create_directories(const path&, error_code* = nullptr);
+_LIBCPP_FUNC_VIS void __create_directory_symlink(const path& __to, const path& __new_symlink, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS bool __create_directory(const path&, error_code* = nullptr);
+_LIBCPP_FUNC_VIS bool __create_directory(const path&, const path& __attributes, error_code* = nullptr);
+_LIBCPP_FUNC_VIS void __create_hard_link(const path& __to, const path& __new_hard_link, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS void __create_symlink(const path& __to, const path& __new_symlink, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS path __current_path(error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS void __current_path(const path&, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS bool __equivalent(const path&, const path&, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS file_status __status(const path&, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS uintmax_t __file_size(const path&, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS uintmax_t __hard_link_count(const path&, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS file_status __symlink_status(const path&, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS file_time_type __last_write_time(const path&, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS void __last_write_time(const path&, file_time_type __new_time, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS path __weakly_canonical(path const& __p, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS path __read_symlink(const path&, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS uintmax_t __remove_all(const path&, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS bool __remove(const path&, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS void __rename(const path& __from, const path& __to, error_code* __ec = nullptr);
+_LIBCPP_FUNC_VIS void __resize_file(const path&, uintmax_t __size, error_code* = nullptr);
+_LIBCPP_FUNC_VIS path __temp_directory_path(error_code* __ec = nullptr);
+
+inline _LIBCPP_HIDE_FROM_ABI path absolute(const path& __p) { return __absolute(__p); }
+inline _LIBCPP_HIDE_FROM_ABI path absolute(const path& __p, error_code& __ec) { return __absolute(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI path canonical(const path& __p)                   { return __canonical(__p); }
+inline _LIBCPP_HIDE_FROM_ABI path canonical(const path& __p, error_code& __ec) { return __canonical(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI bool copy_file(const path& __from, const path& __to) { return __copy_file(__from, __to, copy_options::none); }
+inline _LIBCPP_HIDE_FROM_ABI bool copy_file(const path& __from, const path& __to, error_code& __ec) { return __copy_file(__from, __to, copy_options::none, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI bool copy_file(const path& __from, const path& __to, copy_options __opt) { return __copy_file(__from, __to, __opt); }
+inline _LIBCPP_HIDE_FROM_ABI bool copy_file(const path& __from, const path& __to, copy_options __opt, error_code& __ec) { return __copy_file(__from, __to, __opt, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI void copy_symlink(const path& __from, const path& __to) { __copy_symlink(__from, __to); }
+inline _LIBCPP_HIDE_FROM_ABI void copy_symlink(const path& __from, const path& __to, error_code& __ec) noexcept { __copy_symlink(__from, __to, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI void copy(const path& __from, const path& __to) { __copy(__from, __to, copy_options::none); }
+inline _LIBCPP_HIDE_FROM_ABI void copy(const path& __from, const path& __to, error_code& __ec) { __copy(__from, __to, copy_options::none, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI void copy(const path& __from, const path& __to, copy_options __opt) { __copy(__from, __to, __opt); }
+inline _LIBCPP_HIDE_FROM_ABI void copy(const path& __from, const path& __to, copy_options __opt, error_code& __ec) { __copy(__from, __to, __opt, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI bool create_directories(const path& __p) { return __create_directories(__p); }
+inline _LIBCPP_HIDE_FROM_ABI bool create_directories(const path& __p, error_code& __ec) { return __create_directories(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI void create_directory_symlink(const path& __target, const path& __link) { __create_directory_symlink(__target, __link); }
+inline _LIBCPP_HIDE_FROM_ABI void create_directory_symlink(const path& __target, const path& __link, error_code& __ec) noexcept { __create_directory_symlink(__target, __link, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI bool create_directory(const path& __p) { return __create_directory(__p); }
+inline _LIBCPP_HIDE_FROM_ABI bool create_directory(const path& __p, error_code& __ec) noexcept { return __create_directory(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI bool create_directory(const path& __p, const path& __attrs) { return __create_directory(__p, __attrs); }
+inline _LIBCPP_HIDE_FROM_ABI bool create_directory(const path& __p, const path& __attrs, error_code& __ec) noexcept { return __create_directory(__p, __attrs, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI void create_hard_link(const path& __target, const path& __link) { __create_hard_link(__target, __link); }
+inline _LIBCPP_HIDE_FROM_ABI void create_hard_link(const path& __target, const path& __link, error_code& __ec) noexcept { __create_hard_link(__target, __link, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI void create_symlink(const path& __target, const path& __link) { __create_symlink(__target, __link); }
+inline _LIBCPP_HIDE_FROM_ABI void create_symlink(const path& __target, const path& __link, error_code& __ec) noexcept { return __create_symlink(__target, __link, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI path current_path() { return __current_path(); }
+inline _LIBCPP_HIDE_FROM_ABI path current_path(error_code& __ec) { return __current_path(&__ec); }
+inline _LIBCPP_HIDE_FROM_ABI void current_path(const path& __p) { __current_path(__p); }
+inline _LIBCPP_HIDE_FROM_ABI void current_path(const path& __p, error_code& __ec) noexcept { __current_path(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI bool equivalent(const path& __p1, const path& __p2) { return __equivalent(__p1, __p2); }
+inline _LIBCPP_HIDE_FROM_ABI bool equivalent(const path& __p1, const path& __p2, error_code& __ec) noexcept { return __equivalent(__p1, __p2, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI bool status_known(file_status __s) noexcept { return __s.type() != file_type::none; }
+inline _LIBCPP_HIDE_FROM_ABI bool exists(file_status __s) noexcept { return status_known(__s) && __s.type() != file_type::not_found; }
+inline _LIBCPP_HIDE_FROM_ABI bool exists(const path& __p) { return exists(__status(__p)); }
+
+inline _LIBCPP_INLINE_VISIBILITY bool exists(const path& __p, error_code& __ec) noexcept {
+  auto __s = __status(__p, &__ec);
+  if (status_known(__s))
+    __ec.clear();
+  return exists(__s);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI uintmax_t file_size(const path& __p) { return __file_size(__p); }
+inline _LIBCPP_HIDE_FROM_ABI uintmax_t file_size(const path& __p, error_code& __ec) noexcept { return __file_size(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI uintmax_t hard_link_count(const path& __p) { return __hard_link_count(__p); }
+inline _LIBCPP_HIDE_FROM_ABI uintmax_t hard_link_count(const path& __p, error_code& __ec) noexcept { return __hard_link_count(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_block_file(file_status __s) noexcept { return __s.type() == file_type::block; }
+inline _LIBCPP_HIDE_FROM_ABI bool is_block_file(const path& __p) { return is_block_file(__status(__p)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_block_file(const path& __p, error_code& __ec) noexcept { return is_block_file(__status(__p, &__ec)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_character_file(file_status __s) noexcept { return __s.type() == file_type::character; }
+inline _LIBCPP_HIDE_FROM_ABI bool is_character_file(const path& __p) { return is_character_file(__status(__p)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_character_file(const path& __p, error_code& __ec) noexcept { return is_character_file(__status(__p, &__ec)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_directory(file_status __s) noexcept { return __s.type() == file_type::directory; }
+inline _LIBCPP_HIDE_FROM_ABI bool is_directory(const path& __p) { return is_directory(__status(__p)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_directory(const path& __p, error_code& __ec) noexcept { return is_directory(__status(__p, &__ec)); }
+_LIBCPP_FUNC_VIS bool __fs_is_empty(const path& __p, error_code* __ec = nullptr);
+inline _LIBCPP_HIDE_FROM_ABI bool is_empty(const path& __p) { return __fs_is_empty(__p); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_empty(const path& __p, error_code& __ec) { return __fs_is_empty(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_fifo(file_status __s) noexcept { return __s.type() == file_type::fifo; }
+inline _LIBCPP_HIDE_FROM_ABI bool is_fifo(const path& __p) { return is_fifo(__status(__p)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_fifo(const path& __p, error_code& __ec) noexcept { return is_fifo(__status(__p, &__ec)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_regular_file(file_status __s) noexcept { return __s.type() == file_type::regular; }
+inline _LIBCPP_HIDE_FROM_ABI bool is_regular_file(const path& __p) { return is_regular_file(__status(__p)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_regular_file(const path& __p, error_code& __ec) noexcept { return is_regular_file(__status(__p, &__ec)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_symlink(file_status __s) noexcept { return __s.type() == file_type::symlink; }
+inline _LIBCPP_HIDE_FROM_ABI bool is_symlink(const path& __p) { return is_symlink(__symlink_status(__p)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_symlink(const path& __p, error_code& __ec) noexcept { return is_symlink(__symlink_status(__p, &__ec)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_other(file_status __s) noexcept { return exists(__s) && !is_regular_file(__s) && !is_directory(__s) && !is_symlink(__s); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_other(const path& __p) { return is_other(__status(__p)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_other(const path& __p, error_code& __ec) noexcept { return is_other(__status(__p, &__ec)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_socket(file_status __s) noexcept { return __s.type() == file_type::socket; }
+inline _LIBCPP_HIDE_FROM_ABI bool is_socket(const path& __p) { return is_socket(__status(__p)); }
+inline _LIBCPP_HIDE_FROM_ABI bool is_socket(const path& __p, error_code& __ec) noexcept { return is_socket(__status(__p, &__ec)); }
+inline _LIBCPP_HIDE_FROM_ABI file_time_type last_write_time(const path& __p) { return __last_write_time(__p); }
+inline _LIBCPP_HIDE_FROM_ABI file_time_type last_write_time(const path& __p, error_code& __ec) noexcept { return __last_write_time(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI void last_write_time(const path& __p, file_time_type __t) { __last_write_time(__p, __t); }
+inline _LIBCPP_HIDE_FROM_ABI void last_write_time(const path& __p, file_time_type __t, error_code& __ec) noexcept { __last_write_time(__p, __t, &__ec); }
+_LIBCPP_FUNC_VIS void __permissions(const path&, perms, perm_options, error_code* = nullptr);
+inline _LIBCPP_HIDE_FROM_ABI void permissions(const path& __p, perms __prms, perm_options __opts = perm_options::replace) { __permissions(__p, __prms, __opts); }
+inline _LIBCPP_HIDE_FROM_ABI void permissions(const path& __p, perms __prms, error_code& __ec) noexcept { __permissions(__p, __prms, perm_options::replace, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI void permissions(const path& __p, perms __prms, perm_options __opts, error_code& __ec) { __permissions(__p, __prms, __opts, &__ec); }
+
+inline _LIBCPP_INLINE_VISIBILITY path proximate(const path& __p, const path& __base, error_code& __ec) {
+  path __tmp = __weakly_canonical(__p, &__ec);
+  if (__ec)
+    return {};
+  path __tmp_base = __weakly_canonical(__base, &__ec);
+  if (__ec)
+    return {};
+  return __tmp.lexically_proximate(__tmp_base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI path proximate(const path& __p, error_code& __ec) { return proximate(__p, current_path(), __ec); }
+inline _LIBCPP_HIDE_FROM_ABI path proximate(const path& __p, const path& __base = current_path()) { return __weakly_canonical(__p).lexically_proximate(__weakly_canonical(__base)); }
+inline _LIBCPP_HIDE_FROM_ABI path read_symlink(const path& __p) { return __read_symlink(__p); }
+inline _LIBCPP_HIDE_FROM_ABI path read_symlink(const path& __p, error_code& __ec) { return __read_symlink(__p, &__ec); }
+
+inline _LIBCPP_INLINE_VISIBILITY path relative(const path& __p, const path& __base, error_code& __ec) {
+  path __tmp = __weakly_canonical(__p, &__ec);
+  if (__ec)
+    return path();
+  path __tmpbase = __weakly_canonical(__base, &__ec);
+  if (__ec)
+    return path();
+  return __tmp.lexically_relative(__tmpbase);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI path relative(const path& __p, error_code& __ec) { return relative(__p, current_path(), __ec); }
+inline _LIBCPP_HIDE_FROM_ABI path relative(const path& __p, const path& __base = current_path()) { return __weakly_canonical(__p).lexically_relative(__weakly_canonical(__base)); }
+inline _LIBCPP_HIDE_FROM_ABI uintmax_t remove_all(const path& __p) { return __remove_all(__p); }
+inline _LIBCPP_HIDE_FROM_ABI uintmax_t remove_all(const path& __p, error_code& __ec) { return __remove_all(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI bool remove(const path& __p) { return __remove(__p); }
+inline _LIBCPP_HIDE_FROM_ABI bool remove(const path& __p, error_code& __ec) noexcept { return __remove(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI void rename(const path& __from, const path& __to) { return __rename(__from, __to); }
+inline _LIBCPP_HIDE_FROM_ABI void rename(const path& __from, const path& __to, error_code& __ec) noexcept { return __rename(__from, __to, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI void resize_file(const path& __p, uintmax_t __ns) { return __resize_file(__p, __ns); }
+inline _LIBCPP_HIDE_FROM_ABI void resize_file(const path& __p, uintmax_t __ns, error_code& __ec) noexcept { return __resize_file(__p, __ns, &__ec); }
+_LIBCPP_FUNC_VIS space_info __space(const path&, error_code* __ec = nullptr);
+inline _LIBCPP_HIDE_FROM_ABI space_info space(const path& __p) { return __space(__p); }
+inline _LIBCPP_HIDE_FROM_ABI space_info space(const path& __p, error_code& __ec) noexcept { return __space(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI file_status status(const path& __p) { return __status(__p); }
+inline _LIBCPP_HIDE_FROM_ABI file_status status(const path& __p, error_code& __ec) noexcept { return __status(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI file_status symlink_status(const path& __p) { return __symlink_status(__p); }
+inline _LIBCPP_HIDE_FROM_ABI file_status symlink_status(const path& __p, error_code& __ec) noexcept { return __symlink_status(__p, &__ec); }
+inline _LIBCPP_HIDE_FROM_ABI path temp_directory_path() { return __temp_directory_path(); }
+inline _LIBCPP_HIDE_FROM_ABI path temp_directory_path(error_code& __ec) { return __temp_directory_path(&__ec); }
+inline _LIBCPP_HIDE_FROM_ABI path weakly_canonical(path const& __p) { return __weakly_canonical(__p); }
+inline _LIBCPP_HIDE_FROM_ABI path weakly_canonical(path const& __p, error_code& __ec) { return __weakly_canonical(__p, &__ec); }
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_OPERATIONS_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/path.h b/app/src/main/cpp/libcxx/include/__filesystem/path.h
new file mode 100644
index 0000000..4e6912f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/path.h
@@ -0,0 +1,1091 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_PATH_H
+#define _LIBCPP___FILESYSTEM_PATH_H
+
+#include <__algorithm/replace.h>
+#include <__algorithm/replace_copy.h>
+#include <__availability>
+#include <__config>
+#include <__iterator/back_insert_iterator.h>
+#include <__iterator/iterator_traits.h>
+#include <cstddef>
+#include <string>
+#include <string_view>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_LOCALIZATION)
+# include <iomanip> // for quoted
+# include <locale>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+template <class _Tp>
+struct __can_convert_char {
+  static const bool value = false;
+};
+template <class _Tp>
+struct __can_convert_char<const _Tp> : public __can_convert_char<_Tp> {};
+template <>
+struct __can_convert_char<char> {
+  static const bool value = true;
+  using __char_type = char;
+};
+template <>
+struct __can_convert_char<wchar_t> {
+  static const bool value = true;
+  using __char_type = wchar_t;
+};
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+template <>
+struct __can_convert_char<char8_t> {
+  static const bool value = true;
+  using __char_type = char8_t;
+};
+#endif
+template <>
+struct __can_convert_char<char16_t> {
+  static const bool value = true;
+  using __char_type = char16_t;
+};
+template <>
+struct __can_convert_char<char32_t> {
+  static const bool value = true;
+  using __char_type = char32_t;
+};
+
+template <class _ECharT>
+_LIBCPP_HIDE_FROM_ABI
+typename enable_if<__can_convert_char<_ECharT>::value, bool>::type
+__is_separator(_ECharT __e) {
+#if defined(_LIBCPP_WIN32API)
+  return __e == _ECharT('/') || __e == _ECharT('\\');
+#else
+  return __e == _ECharT('/');
+#endif
+}
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+typedef u8string __u8_string;
+#else
+typedef string __u8_string;
+#endif
+
+struct _NullSentinel {};
+
+template <class _Tp>
+using _Void = void;
+
+template <class _Tp, class = void>
+struct __is_pathable_string : public false_type {};
+
+template <class _ECharT, class _Traits, class _Alloc>
+struct __is_pathable_string<
+    basic_string<_ECharT, _Traits, _Alloc>,
+    _Void<typename __can_convert_char<_ECharT>::__char_type> >
+    : public __can_convert_char<_ECharT> {
+  using _Str = basic_string<_ECharT, _Traits, _Alloc>;
+  using _Base = __can_convert_char<_ECharT>;
+
+  _LIBCPP_HIDE_FROM_ABI
+  static _ECharT const* __range_begin(_Str const& __s) { return __s.data(); }
+
+  _LIBCPP_HIDE_FROM_ABI
+  static _ECharT const* __range_end(_Str const& __s) {
+    return __s.data() + __s.length();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  static _ECharT __first_or_null(_Str const& __s) {
+    return __s.empty() ? _ECharT{} : __s[0];
+  }
+};
+
+template <class _ECharT, class _Traits>
+struct __is_pathable_string<
+    basic_string_view<_ECharT, _Traits>,
+    _Void<typename __can_convert_char<_ECharT>::__char_type> >
+    : public __can_convert_char<_ECharT> {
+  using _Str = basic_string_view<_ECharT, _Traits>;
+  using _Base = __can_convert_char<_ECharT>;
+
+  _LIBCPP_HIDE_FROM_ABI
+  static _ECharT const* __range_begin(_Str const& __s) { return __s.data(); }
+
+  _LIBCPP_HIDE_FROM_ABI
+  static _ECharT const* __range_end(_Str const& __s) {
+    return __s.data() + __s.length();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  static _ECharT __first_or_null(_Str const& __s) {
+    return __s.empty() ? _ECharT{} : __s[0];
+  }
+};
+
+template <class _Source, class _DS = typename decay<_Source>::type,
+          class _UnqualPtrType =
+              __remove_const_t<__remove_pointer_t<_DS> >,
+          bool _IsCharPtr = is_pointer<_DS>::value&&
+              __can_convert_char<_UnqualPtrType>::value>
+struct __is_pathable_char_array : false_type {};
+
+template <class _Source, class _ECharT, class _UPtr>
+struct __is_pathable_char_array<_Source, _ECharT*, _UPtr, true>
+    : __can_convert_char<__remove_const_t<_ECharT> > {
+  using _Base = __can_convert_char<__remove_const_t<_ECharT> >;
+
+  _LIBCPP_HIDE_FROM_ABI
+  static _ECharT const* __range_begin(const _ECharT* __b) { return __b; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  static _ECharT const* __range_end(const _ECharT* __b) {
+    using _Iter = const _ECharT*;
+    const _ECharT __sentinel = _ECharT{};
+    _Iter __e = __b;
+    for (; *__e != __sentinel; ++__e)
+      ;
+    return __e;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  static _ECharT __first_or_null(const _ECharT* __b) { return *__b; }
+};
+
+template <class _Iter, bool _IsIt = __is_cpp17_input_iterator<_Iter>::value,
+          class = void>
+struct __is_pathable_iter : false_type {};
+
+template <class _Iter>
+struct __is_pathable_iter<
+    _Iter, true,
+    _Void<typename __can_convert_char<
+        typename iterator_traits<_Iter>::value_type>::__char_type> >
+    : __can_convert_char<typename iterator_traits<_Iter>::value_type> {
+  using _ECharT = typename iterator_traits<_Iter>::value_type;
+  using _Base = __can_convert_char<_ECharT>;
+
+  _LIBCPP_HIDE_FROM_ABI
+  static _Iter __range_begin(_Iter __b) { return __b; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  static _NullSentinel __range_end(_Iter) { return _NullSentinel{}; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  static _ECharT __first_or_null(_Iter __b) { return *__b; }
+};
+
+template <class _Tp, bool _IsStringT = __is_pathable_string<_Tp>::value,
+          bool _IsCharIterT = __is_pathable_char_array<_Tp>::value,
+          bool _IsIterT = !_IsCharIterT && __is_pathable_iter<_Tp>::value>
+struct __is_pathable : false_type {
+  static_assert(!_IsStringT && !_IsCharIterT && !_IsIterT, "Must all be false");
+};
+
+template <class _Tp>
+struct __is_pathable<_Tp, true, false, false> : __is_pathable_string<_Tp> {};
+
+template <class _Tp>
+struct __is_pathable<_Tp, false, true, false> : __is_pathable_char_array<_Tp> {
+};
+
+template <class _Tp>
+struct __is_pathable<_Tp, false, false, true> : __is_pathable_iter<_Tp> {};
+
+#if defined(_LIBCPP_WIN32API)
+typedef wstring __path_string;
+typedef wchar_t __path_value;
+#else
+typedef string __path_string;
+typedef char __path_value;
+#endif
+
+#if defined(_LIBCPP_WIN32API)
+_LIBCPP_FUNC_VIS
+size_t __wide_to_char(const wstring&, char*, size_t);
+_LIBCPP_FUNC_VIS
+size_t __char_to_wide(const string&, wchar_t*, size_t);
+#endif
+
+template <class _ECharT>
+struct _PathCVT;
+
+#if !defined(_LIBCPP_HAS_NO_LOCALIZATION)
+template <class _ECharT>
+struct _PathCVT {
+  static_assert(__can_convert_char<_ECharT>::value,
+                "Char type not convertible");
+
+  typedef __narrow_to_utf8<sizeof(_ECharT) * __CHAR_BIT__> _Narrower;
+#if defined(_LIBCPP_WIN32API)
+  typedef __widen_from_utf8<sizeof(wchar_t) * __CHAR_BIT__> _Widener;
+#endif
+
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append_range(__path_string& __dest, _ECharT const* __b,
+                             _ECharT const* __e) {
+#if defined(_LIBCPP_WIN32API)
+    string __utf8;
+    _Narrower()(back_inserter(__utf8), __b, __e);
+    _Widener()(back_inserter(__dest), __utf8.data(), __utf8.data() + __utf8.size());
+#else
+    _Narrower()(back_inserter(__dest), __b, __e);
+#endif
+  }
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append_range(__path_string& __dest, _Iter __b, _Iter __e) {
+    static_assert(!is_same<_Iter, _ECharT*>::value, "Call const overload");
+    if (__b == __e)
+      return;
+    basic_string<_ECharT> __tmp(__b, __e);
+#if defined(_LIBCPP_WIN32API)
+    string __utf8;
+    _Narrower()(back_inserter(__utf8), __tmp.data(),
+                __tmp.data() + __tmp.length());
+    _Widener()(back_inserter(__dest), __utf8.data(), __utf8.data() + __utf8.size());
+#else
+    _Narrower()(back_inserter(__dest), __tmp.data(),
+                __tmp.data() + __tmp.length());
+#endif
+  }
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append_range(__path_string& __dest, _Iter __b, _NullSentinel) {
+    static_assert(!is_same<_Iter, _ECharT*>::value, "Call const overload");
+    const _ECharT __sentinel = _ECharT{};
+    if (*__b == __sentinel)
+      return;
+    basic_string<_ECharT> __tmp;
+    for (; *__b != __sentinel; ++__b)
+      __tmp.push_back(*__b);
+#if defined(_LIBCPP_WIN32API)
+    string __utf8;
+    _Narrower()(back_inserter(__utf8), __tmp.data(),
+                __tmp.data() + __tmp.length());
+    _Widener()(back_inserter(__dest), __utf8.data(), __utf8.data() + __utf8.size());
+#else
+    _Narrower()(back_inserter(__dest), __tmp.data(),
+                __tmp.data() + __tmp.length());
+#endif
+  }
+
+  template <class _Source>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append_source(__path_string& __dest, _Source const& __s) {
+    using _Traits = __is_pathable<_Source>;
+    __append_range(__dest, _Traits::__range_begin(__s),
+                   _Traits::__range_end(__s));
+  }
+};
+#endif // !_LIBCPP_HAS_NO_LOCALIZATION
+
+template <>
+struct _PathCVT<__path_value> {
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI
+  static typename enable_if<__is_exactly_cpp17_input_iterator<_Iter>::value>::type
+  __append_range(__path_string& __dest, _Iter __b, _Iter __e) {
+    for (; __b != __e; ++__b)
+      __dest.push_back(*__b);
+  }
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI
+  static typename enable_if<__is_cpp17_forward_iterator<_Iter>::value>::type
+  __append_range(__path_string& __dest, _Iter __b, _Iter __e) {
+    __dest.append(__b, __e);
+  }
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append_range(__path_string& __dest, _Iter __b, _NullSentinel) {
+    const char __sentinel = char{};
+    for (; *__b != __sentinel; ++__b)
+      __dest.push_back(*__b);
+  }
+
+  template <class _Source>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append_source(__path_string& __dest, _Source const& __s) {
+    using _Traits = __is_pathable<_Source>;
+    __append_range(__dest, _Traits::__range_begin(__s),
+                   _Traits::__range_end(__s));
+  }
+};
+
+#if defined(_LIBCPP_WIN32API)
+template <>
+struct _PathCVT<char> {
+
+  _LIBCPP_HIDE_FROM_ABI
+  static void
+  __append_string(__path_string& __dest, const basic_string<char> &__str) {
+      size_t __size = __char_to_wide(__str, nullptr, 0);
+      size_t __pos = __dest.size();
+      __dest.resize(__pos + __size);
+      __char_to_wide(__str, const_cast<__path_value*>(__dest.data()) + __pos, __size);
+  }
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI
+  static typename enable_if<__is_exactly_cpp17_input_iterator<_Iter>::value>::type
+  __append_range(__path_string& __dest, _Iter __b, _Iter __e) {
+    basic_string<char> __tmp(__b, __e);
+    __append_string(__dest, __tmp);
+  }
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI
+  static typename enable_if<__is_cpp17_forward_iterator<_Iter>::value>::type
+  __append_range(__path_string& __dest, _Iter __b, _Iter __e) {
+    basic_string<char> __tmp(__b, __e);
+    __append_string(__dest, __tmp);
+  }
+
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append_range(__path_string& __dest, _Iter __b, _NullSentinel) {
+    const char __sentinel = char{};
+    basic_string<char> __tmp;
+    for (; *__b != __sentinel; ++__b)
+      __tmp.push_back(*__b);
+    __append_string(__dest, __tmp);
+  }
+
+  template <class _Source>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append_source(__path_string& __dest, _Source const& __s) {
+    using _Traits = __is_pathable<_Source>;
+    __append_range(__dest, _Traits::__range_begin(__s),
+                   _Traits::__range_end(__s));
+  }
+};
+
+template <class _ECharT>
+struct _PathExport {
+  typedef __narrow_to_utf8<sizeof(wchar_t) * __CHAR_BIT__> _Narrower;
+  typedef __widen_from_utf8<sizeof(_ECharT) * __CHAR_BIT__> _Widener;
+
+  template <class _Str>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append(_Str& __dest, const __path_string& __src) {
+    string __utf8;
+    _Narrower()(back_inserter(__utf8), __src.data(), __src.data() + __src.size());
+    _Widener()(back_inserter(__dest), __utf8.data(), __utf8.data() + __utf8.size());
+  }
+};
+
+template <>
+struct _PathExport<char> {
+  template <class _Str>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append(_Str& __dest, const __path_string& __src) {
+    size_t __size = __wide_to_char(__src, nullptr, 0);
+    size_t __pos = __dest.size();
+    __dest.resize(__size);
+    __wide_to_char(__src, const_cast<char*>(__dest.data()) + __pos, __size);
+  }
+};
+
+template <>
+struct _PathExport<wchar_t> {
+  template <class _Str>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append(_Str& __dest, const __path_string& __src) {
+    __dest.append(__src.begin(), __src.end());
+  }
+};
+
+template <>
+struct _PathExport<char16_t> {
+  template <class _Str>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append(_Str& __dest, const __path_string& __src) {
+    __dest.append(__src.begin(), __src.end());
+  }
+};
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+template <>
+struct _PathExport<char8_t> {
+  typedef __narrow_to_utf8<sizeof(wchar_t) * __CHAR_BIT__> _Narrower;
+
+  template <class _Str>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __append(_Str& __dest, const __path_string& __src) {
+    _Narrower()(back_inserter(__dest), __src.data(), __src.data() + __src.size());
+  }
+};
+#endif /* !_LIBCPP_HAS_NO_CHAR8_T */
+#endif /* _LIBCPP_WIN32API */
+
+class _LIBCPP_TYPE_VIS path {
+  template <class _SourceOrIter, class _Tp = path&>
+  using _EnableIfPathable =
+      typename enable_if<__is_pathable<_SourceOrIter>::value, _Tp>::type;
+
+  template <class _Tp>
+  using _SourceChar = typename __is_pathable<_Tp>::__char_type;
+
+  template <class _Tp>
+  using _SourceCVT = _PathCVT<_SourceChar<_Tp> >;
+
+public:
+#if defined(_LIBCPP_WIN32API)
+  typedef wchar_t value_type;
+  static constexpr value_type preferred_separator = L'\\';
+#else
+  typedef char value_type;
+  static constexpr value_type preferred_separator = '/';
+#endif
+  typedef basic_string<value_type> string_type;
+  typedef basic_string_view<value_type> __string_view;
+
+  enum _LIBCPP_ENUM_VIS format : unsigned char {
+    auto_format,
+    native_format,
+    generic_format
+  };
+
+  // constructors and destructor
+  _LIBCPP_HIDE_FROM_ABI path() noexcept {}
+  _LIBCPP_HIDE_FROM_ABI path(const path& __p) : __pn_(__p.__pn_) {}
+  _LIBCPP_HIDE_FROM_ABI path(path&& __p) noexcept
+      : __pn_(_VSTD::move(__p.__pn_)) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  path(string_type&& __s, format = format::auto_format) noexcept
+      : __pn_(_VSTD::move(__s)) {}
+
+  template <class _Source, class = _EnableIfPathable<_Source, void> >
+  _LIBCPP_HIDE_FROM_ABI
+  path(const _Source& __src, format = format::auto_format) {
+    _SourceCVT<_Source>::__append_source(__pn_, __src);
+  }
+
+  template <class _InputIt>
+  _LIBCPP_HIDE_FROM_ABI
+  path(_InputIt __first, _InputIt __last, format = format::auto_format) {
+    typedef typename iterator_traits<_InputIt>::value_type _ItVal;
+    _PathCVT<_ItVal>::__append_range(__pn_, __first, __last);
+  }
+
+/*
+#if !defined(_LIBCPP_HAS_NO_LOCALIZATION)
+  // TODO Implement locale conversions.
+  template <class _Source, class = _EnableIfPathable<_Source, void> >
+  path(const _Source& __src, const locale& __loc, format = format::auto_format);
+  template <class _InputIt>
+  path(_InputIt __first, _InputIt _last, const locale& __loc,
+       format = format::auto_format);
+#endif
+*/
+
+  _LIBCPP_HIDE_FROM_ABI
+  ~path() = default;
+
+  // assignments
+  _LIBCPP_HIDE_FROM_ABI
+  path& operator=(const path& __p) {
+    __pn_ = __p.__pn_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  path& operator=(path&& __p) noexcept {
+    __pn_ = _VSTD::move(__p.__pn_);
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  path& operator=(string_type&& __s) noexcept {
+    __pn_ = _VSTD::move(__s);
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  path& assign(string_type&& __s) noexcept {
+    __pn_ = _VSTD::move(__s);
+    return *this;
+  }
+
+  template <class _Source>
+  _LIBCPP_HIDE_FROM_ABI _EnableIfPathable<_Source>
+  operator=(const _Source& __src) {
+    return this->assign(__src);
+  }
+
+  template <class _Source>
+  _LIBCPP_HIDE_FROM_ABI
+  _EnableIfPathable<_Source> assign(const _Source& __src) {
+    __pn_.clear();
+    _SourceCVT<_Source>::__append_source(__pn_, __src);
+    return *this;
+  }
+
+  template <class _InputIt>
+  _LIBCPP_HIDE_FROM_ABI
+  path& assign(_InputIt __first, _InputIt __last) {
+    typedef typename iterator_traits<_InputIt>::value_type _ItVal;
+    __pn_.clear();
+    _PathCVT<_ItVal>::__append_range(__pn_, __first, __last);
+    return *this;
+  }
+
+public:
+  // appends
+#if defined(_LIBCPP_WIN32API)
+  _LIBCPP_HIDE_FROM_ABI
+  path& operator/=(const path& __p) {
+    auto __p_root_name = __p.__root_name();
+    auto __p_root_name_size = __p_root_name.size();
+    if (__p.is_absolute() ||
+        (!__p_root_name.empty() && __p_root_name != __string_view(root_name().__pn_))) {
+      __pn_ = __p.__pn_;
+      return *this;
+    }
+    if (__p.has_root_directory()) {
+      path __root_name_str = root_name();
+      __pn_ = __root_name_str.native();
+      __pn_ += __string_view(__p.__pn_).substr(__p_root_name_size);
+      return *this;
+    }
+    if (has_filename() || (!has_root_directory() && is_absolute()))
+      __pn_ += preferred_separator;
+    __pn_ += __string_view(__p.__pn_).substr(__p_root_name_size);
+    return *this;
+  }
+  template <class _Source>
+  _LIBCPP_INLINE_VISIBILITY _EnableIfPathable<_Source>
+  operator/=(const _Source& __src) {
+    return operator/=(path(__src));
+  }
+
+  template <class _Source>
+  _LIBCPP_HIDE_FROM_ABI
+  _EnableIfPathable<_Source> append(const _Source& __src) {
+    return operator/=(path(__src));
+  }
+
+  template <class _InputIt>
+  _LIBCPP_HIDE_FROM_ABI
+  path& append(_InputIt __first, _InputIt __last) {
+    return operator/=(path(__first, __last));
+  }
+#else
+  _LIBCPP_HIDE_FROM_ABI
+  path& operator/=(const path& __p) {
+    if (__p.is_absolute()) {
+      __pn_ = __p.__pn_;
+      return *this;
+    }
+    if (has_filename())
+      __pn_ += preferred_separator;
+    __pn_ += __p.native();
+    return *this;
+  }
+
+  // FIXME: Use _LIBCPP_DIAGNOSE_WARNING to produce a diagnostic when __src
+  // is known at compile time to be "/' since the user almost certainly intended
+  // to append a separator instead of overwriting the path with "/"
+  template <class _Source>
+  _LIBCPP_HIDE_FROM_ABI _EnableIfPathable<_Source>
+  operator/=(const _Source& __src) {
+    return this->append(__src);
+  }
+
+  template <class _Source>
+  _LIBCPP_HIDE_FROM_ABI
+  _EnableIfPathable<_Source> append(const _Source& __src) {
+    using _Traits = __is_pathable<_Source>;
+    using _CVT = _PathCVT<_SourceChar<_Source> >;
+    bool __source_is_absolute = _VSTD_FS::__is_separator(_Traits::__first_or_null(__src));
+    if (__source_is_absolute)
+      __pn_.clear();
+    else if (has_filename())
+      __pn_ += preferred_separator;
+    _CVT::__append_source(__pn_, __src);
+    return *this;
+  }
+
+  template <class _InputIt>
+  _LIBCPP_HIDE_FROM_ABI
+  path& append(_InputIt __first, _InputIt __last) {
+    typedef typename iterator_traits<_InputIt>::value_type _ItVal;
+    static_assert(__can_convert_char<_ItVal>::value, "Must convertible");
+    using _CVT = _PathCVT<_ItVal>;
+    if (__first != __last && _VSTD_FS::__is_separator(*__first))
+      __pn_.clear();
+    else if (has_filename())
+      __pn_ += preferred_separator;
+    _CVT::__append_range(__pn_, __first, __last);
+    return *this;
+  }
+#endif
+
+  // concatenation
+  _LIBCPP_HIDE_FROM_ABI
+  path& operator+=(const path& __x) {
+    __pn_ += __x.__pn_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  path& operator+=(const string_type& __x) {
+    __pn_ += __x;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  path& operator+=(__string_view __x) {
+    __pn_ += __x;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  path& operator+=(const value_type* __x) {
+    __pn_ += __x;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  path& operator+=(value_type __x) {
+    __pn_ += __x;
+    return *this;
+  }
+
+  template <class _ECharT>
+  _LIBCPP_HIDE_FROM_ABI
+  typename enable_if<__can_convert_char<_ECharT>::value, path&>::type
+  operator+=(_ECharT __x) {
+    _PathCVT<_ECharT>::__append_source(__pn_,
+                                       basic_string_view<_ECharT>(&__x, 1));
+    return *this;
+  }
+
+  template <class _Source>
+  _LIBCPP_HIDE_FROM_ABI
+  _EnableIfPathable<_Source> operator+=(const _Source& __x) {
+    return this->concat(__x);
+  }
+
+  template <class _Source>
+  _LIBCPP_HIDE_FROM_ABI
+  _EnableIfPathable<_Source> concat(const _Source& __x) {
+    _SourceCVT<_Source>::__append_source(__pn_, __x);
+    return *this;
+  }
+
+  template <class _InputIt>
+  _LIBCPP_HIDE_FROM_ABI
+  path& concat(_InputIt __first, _InputIt __last) {
+    typedef typename iterator_traits<_InputIt>::value_type _ItVal;
+    _PathCVT<_ItVal>::__append_range(__pn_, __first, __last);
+    return *this;
+  }
+
+  // modifiers
+  _LIBCPP_HIDE_FROM_ABI
+  void clear() noexcept { __pn_.clear(); }
+
+  _LIBCPP_HIDE_FROM_ABI
+  path& make_preferred() {
+#if defined(_LIBCPP_WIN32API)
+    _VSTD::replace(__pn_.begin(), __pn_.end(), L'/', L'\\');
+#endif
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  path& remove_filename() {
+    auto __fname = __filename();
+    if (!__fname.empty())
+      __pn_.erase(__fname.data() - __pn_.data());
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  path& replace_filename(const path& __replacement) {
+    remove_filename();
+    return (*this /= __replacement);
+  }
+
+  path& replace_extension(const path& __replacement = path());
+
+  friend _LIBCPP_HIDE_FROM_ABI bool operator==(const path& __lhs, const path& __rhs) noexcept {
+    return __lhs.__compare(__rhs.__pn_) == 0;
+  }
+#  if _LIBCPP_STD_VER <= 17
+  friend _LIBCPP_HIDE_FROM_ABI bool operator!=(const path& __lhs, const path& __rhs) noexcept {
+    return __lhs.__compare(__rhs.__pn_) != 0;
+  }
+  friend _LIBCPP_HIDE_FROM_ABI bool operator<(const path& __lhs, const path& __rhs) noexcept {
+    return __lhs.__compare(__rhs.__pn_) < 0;
+  }
+  friend _LIBCPP_HIDE_FROM_ABI bool operator<=(const path& __lhs, const path& __rhs) noexcept {
+    return __lhs.__compare(__rhs.__pn_) <= 0;
+  }
+  friend _LIBCPP_HIDE_FROM_ABI bool operator>(const path& __lhs, const path& __rhs) noexcept {
+    return __lhs.__compare(__rhs.__pn_) > 0;
+  }
+  friend _LIBCPP_HIDE_FROM_ABI bool operator>=(const path& __lhs, const path& __rhs) noexcept {
+    return __lhs.__compare(__rhs.__pn_) >= 0;
+  }
+#  else // _LIBCPP_STD_VER <= 17
+  friend _LIBCPP_HIDE_FROM_ABI strong_ordering operator<=>(const path& __lhs, const path& __rhs) noexcept {
+    return __lhs.__compare(__rhs.__pn_) <=> 0;
+  }
+#  endif // _LIBCPP_STD_VER <= 17
+
+  friend _LIBCPP_HIDE_FROM_ABI path operator/(const path& __lhs, const path& __rhs) {
+    path __result(__lhs);
+    __result /= __rhs;
+    return __result;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  void swap(path& __rhs) noexcept { __pn_.swap(__rhs.__pn_); }
+
+  // private helper to allow reserving memory in the path
+  _LIBCPP_HIDE_FROM_ABI
+  void __reserve(size_t __s) { __pn_.reserve(__s); }
+
+  // native format observers
+  _LIBCPP_HIDE_FROM_ABI
+  const string_type& native() const noexcept { return __pn_; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  const value_type* c_str() const noexcept { return __pn_.c_str(); }
+
+  _LIBCPP_HIDE_FROM_ABI operator string_type() const { return __pn_; }
+
+#if defined(_LIBCPP_WIN32API)
+  _LIBCPP_HIDE_FROM_ABI _VSTD::wstring wstring() const { return __pn_; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  _VSTD::wstring generic_wstring() const {
+    _VSTD::wstring __s;
+    __s.resize(__pn_.size());
+    _VSTD::replace_copy(__pn_.begin(), __pn_.end(), __s.begin(), '\\', '/');
+    return __s;
+  }
+
+#if !defined(_LIBCPP_HAS_NO_LOCALIZATION)
+  template <class _ECharT, class _Traits = char_traits<_ECharT>,
+            class _Allocator = allocator<_ECharT> >
+  _LIBCPP_HIDE_FROM_ABI
+  basic_string<_ECharT, _Traits, _Allocator>
+  string(const _Allocator& __a = _Allocator()) const {
+    using _Str = basic_string<_ECharT, _Traits, _Allocator>;
+    _Str __s(__a);
+    __s.reserve(__pn_.size());
+    _PathExport<_ECharT>::__append(__s, __pn_);
+    return __s;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _VSTD::string string() const {
+    return string<char>();
+  }
+  _LIBCPP_HIDE_FROM_ABI __u8_string u8string() const {
+    using _CVT = __narrow_to_utf8<sizeof(wchar_t) * __CHAR_BIT__>;
+    __u8_string __s;
+    __s.reserve(__pn_.size());
+    _CVT()(back_inserter(__s), __pn_.data(), __pn_.data() + __pn_.size());
+    return __s;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _VSTD::u16string u16string() const {
+    return string<char16_t>();
+  }
+  _LIBCPP_HIDE_FROM_ABI _VSTD::u32string u32string() const {
+    return string<char32_t>();
+  }
+
+  // generic format observers
+  template <class _ECharT, class _Traits = char_traits<_ECharT>,
+            class _Allocator = allocator<_ECharT> >
+  _LIBCPP_HIDE_FROM_ABI
+  basic_string<_ECharT, _Traits, _Allocator>
+  generic_string(const _Allocator& __a = _Allocator()) const {
+    using _Str = basic_string<_ECharT, _Traits, _Allocator>;
+    _Str __s = string<_ECharT, _Traits, _Allocator>(__a);
+    // Note: This (and generic_u8string below) is slightly suboptimal as
+    // it iterates twice over the string; once to convert it to the right
+    // character type, and once to replace path delimiters.
+    _VSTD::replace(__s.begin(), __s.end(),
+                   static_cast<_ECharT>('\\'), static_cast<_ECharT>('/'));
+    return __s;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _VSTD::string generic_string() const { return generic_string<char>(); }
+  _LIBCPP_HIDE_FROM_ABI _VSTD::u16string generic_u16string() const { return generic_string<char16_t>(); }
+  _LIBCPP_HIDE_FROM_ABI _VSTD::u32string generic_u32string() const { return generic_string<char32_t>(); }
+  _LIBCPP_HIDE_FROM_ABI
+  __u8_string generic_u8string() const {
+    __u8_string __s = u8string();
+    _VSTD::replace(__s.begin(), __s.end(), '\\', '/');
+    return __s;
+  }
+#endif /* !_LIBCPP_HAS_NO_LOCALIZATION */
+#else /* _LIBCPP_WIN32API */
+
+  _LIBCPP_HIDE_FROM_ABI _VSTD::string string() const { return __pn_; }
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+  _LIBCPP_HIDE_FROM_ABI _VSTD::u8string u8string() const { return _VSTD::u8string(__pn_.begin(), __pn_.end()); }
+#else
+  _LIBCPP_HIDE_FROM_ABI _VSTD::string u8string() const { return __pn_; }
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_LOCALIZATION)
+  template <class _ECharT, class _Traits = char_traits<_ECharT>,
+            class _Allocator = allocator<_ECharT> >
+  _LIBCPP_HIDE_FROM_ABI
+  basic_string<_ECharT, _Traits, _Allocator>
+  string(const _Allocator& __a = _Allocator()) const {
+    using _CVT = __widen_from_utf8<sizeof(_ECharT) * __CHAR_BIT__>;
+    using _Str = basic_string<_ECharT, _Traits, _Allocator>;
+    _Str __s(__a);
+    __s.reserve(__pn_.size());
+    _CVT()(std::back_inserter(__s), __pn_.data(), __pn_.data() + __pn_.size());
+    return __s;
+  }
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+  _LIBCPP_HIDE_FROM_ABI _VSTD::wstring wstring() const {
+    return string<wchar_t>();
+  }
+#endif
+  _LIBCPP_HIDE_FROM_ABI _VSTD::u16string u16string() const {
+    return string<char16_t>();
+  }
+  _LIBCPP_HIDE_FROM_ABI _VSTD::u32string u32string() const {
+    return string<char32_t>();
+  }
+#endif /* !_LIBCPP_HAS_NO_LOCALIZATION */
+
+  // generic format observers
+  _LIBCPP_HIDE_FROM_ABI _VSTD::string generic_string() const { return __pn_; }
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+  _LIBCPP_HIDE_FROM_ABI _VSTD::u8string generic_u8string() const { return _VSTD::u8string(__pn_.begin(), __pn_.end()); }
+#else
+  _LIBCPP_HIDE_FROM_ABI _VSTD::string generic_u8string() const { return __pn_; }
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_LOCALIZATION)
+  template <class _ECharT, class _Traits = char_traits<_ECharT>,
+            class _Allocator = allocator<_ECharT> >
+  _LIBCPP_HIDE_FROM_ABI
+  basic_string<_ECharT, _Traits, _Allocator>
+  generic_string(const _Allocator& __a = _Allocator()) const {
+    return string<_ECharT, _Traits, _Allocator>(__a);
+  }
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+  _LIBCPP_HIDE_FROM_ABI _VSTD::wstring generic_wstring() const { return string<wchar_t>(); }
+#endif
+  _LIBCPP_HIDE_FROM_ABI _VSTD::u16string generic_u16string() const { return string<char16_t>(); }
+  _LIBCPP_HIDE_FROM_ABI _VSTD::u32string generic_u32string() const { return string<char32_t>(); }
+#endif /* !_LIBCPP_HAS_NO_LOCALIZATION */
+#endif /* !_LIBCPP_WIN32API */
+
+private:
+  int __compare(__string_view) const;
+  __string_view __root_name() const;
+  __string_view __root_directory() const;
+  __string_view __root_path_raw() const;
+  __string_view __relative_path() const;
+  __string_view __parent_path() const;
+  __string_view __filename() const;
+  __string_view __stem() const;
+  __string_view __extension() const;
+
+public:
+  // compare
+  _LIBCPP_HIDE_FROM_ABI int compare(const path& __p) const noexcept {
+    return __compare(__p.__pn_);
+  }
+  _LIBCPP_HIDE_FROM_ABI int compare(const string_type& __s) const {
+    return __compare(__s);
+  }
+  _LIBCPP_HIDE_FROM_ABI int compare(__string_view __s) const {
+    return __compare(__s);
+  }
+  _LIBCPP_HIDE_FROM_ABI int compare(const value_type* __s) const {
+    return __compare(__s);
+  }
+
+  // decomposition
+  _LIBCPP_HIDE_FROM_ABI path root_name() const {
+    return string_type(__root_name());
+  }
+  _LIBCPP_HIDE_FROM_ABI path root_directory() const {
+    return string_type(__root_directory());
+  }
+  _LIBCPP_HIDE_FROM_ABI path root_path() const {
+#if defined(_LIBCPP_WIN32API)
+    return string_type(__root_path_raw());
+#else
+    return root_name().append(string_type(__root_directory()));
+#endif
+  }
+  _LIBCPP_HIDE_FROM_ABI path relative_path() const {
+    return string_type(__relative_path());
+  }
+  _LIBCPP_HIDE_FROM_ABI path parent_path() const {
+    return string_type(__parent_path());
+  }
+  _LIBCPP_HIDE_FROM_ABI path filename() const {
+    return string_type(__filename());
+  }
+  _LIBCPP_HIDE_FROM_ABI path stem() const { return string_type(__stem()); }
+  _LIBCPP_HIDE_FROM_ABI path extension() const {
+    return string_type(__extension());
+  }
+
+  // query
+  _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI bool
+  empty() const noexcept {
+    return __pn_.empty();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI bool has_root_name() const {
+    return !__root_name().empty();
+  }
+  _LIBCPP_HIDE_FROM_ABI bool has_root_directory() const {
+    return !__root_directory().empty();
+  }
+  _LIBCPP_HIDE_FROM_ABI bool has_root_path() const {
+    return !__root_path_raw().empty();
+  }
+  _LIBCPP_HIDE_FROM_ABI bool has_relative_path() const {
+    return !__relative_path().empty();
+  }
+  _LIBCPP_HIDE_FROM_ABI bool has_parent_path() const {
+    return !__parent_path().empty();
+  }
+  _LIBCPP_HIDE_FROM_ABI bool has_filename() const {
+    return !__filename().empty();
+  }
+  _LIBCPP_HIDE_FROM_ABI bool has_stem() const { return !__stem().empty(); }
+  _LIBCPP_HIDE_FROM_ABI bool has_extension() const {
+    return !__extension().empty();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI bool is_absolute() const {
+#if defined(_LIBCPP_WIN32API)
+    __string_view __root_name_str = __root_name();
+    __string_view __root_dir = __root_directory();
+    if (__root_name_str.size() == 2 && __root_name_str[1] == ':') {
+      // A drive letter with no root directory is relative, e.g. x:example.
+      return !__root_dir.empty();
+    }
+    // If no root name, it's relative, e.g. \example is relative to the current drive
+    if (__root_name_str.empty())
+      return false;
+    if (__root_name_str.size() < 3)
+      return false;
+    // A server root name, like \\server, is always absolute
+    if (__root_name_str[0] != '/' && __root_name_str[0] != '\\')
+      return false;
+    if (__root_name_str[1] != '/' && __root_name_str[1] != '\\')
+      return false;
+    // Seems to be a server root name
+    return true;
+#else
+    return has_root_directory();
+#endif
+  }
+  _LIBCPP_HIDE_FROM_ABI bool is_relative() const { return !is_absolute(); }
+
+  // relative paths
+  path lexically_normal() const;
+  path lexically_relative(const path& __base) const;
+
+  _LIBCPP_HIDE_FROM_ABI path lexically_proximate(const path& __base) const {
+    path __result = this->lexically_relative(__base);
+    if (__result.native().empty())
+      return *this;
+    return __result;
+  }
+
+  // iterators
+  class _LIBCPP_TYPE_VIS iterator;
+  typedef iterator const_iterator;
+
+  iterator begin() const;
+  iterator end() const;
+
+#if !defined(_LIBCPP_HAS_NO_LOCALIZATION)
+  template <class _CharT, class _Traits>
+  _LIBCPP_HIDE_FROM_ABI friend
+      typename enable_if<is_same<_CharT, value_type>::value &&
+                             is_same<_Traits, char_traits<value_type> >::value,
+                         basic_ostream<_CharT, _Traits>&>::type
+      operator<<(basic_ostream<_CharT, _Traits>& __os, const path& __p) {
+    __os << _VSTD::__quoted(__p.native());
+    return __os;
+  }
+
+  template <class _CharT, class _Traits>
+  _LIBCPP_HIDE_FROM_ABI friend
+      typename enable_if<!is_same<_CharT, value_type>::value ||
+                             !is_same<_Traits, char_traits<value_type> >::value,
+                         basic_ostream<_CharT, _Traits>&>::type
+      operator<<(basic_ostream<_CharT, _Traits>& __os, const path& __p) {
+    __os << _VSTD::__quoted(__p.string<_CharT, _Traits>());
+    return __os;
+  }
+
+  template <class _CharT, class _Traits>
+  _LIBCPP_HIDE_FROM_ABI friend basic_istream<_CharT, _Traits>&
+  operator>>(basic_istream<_CharT, _Traits>& __is, path& __p) {
+    basic_string<_CharT, _Traits> __tmp;
+    __is >> _VSTD::__quoted(__tmp);
+    __p = __tmp;
+    return __is;
+  }
+#endif // !_LIBCPP_HAS_NO_LOCALIZATION
+
+private:
+  inline _LIBCPP_HIDE_FROM_ABI path&
+  __assign_view(__string_view const& __s) noexcept {
+    __pn_ = string_type(__s);
+    return *this;
+  }
+  string_type __pn_;
+};
+
+inline _LIBCPP_HIDE_FROM_ABI void swap(path& __lhs, path& __rhs) noexcept {
+  __lhs.swap(__rhs);
+}
+
+_LIBCPP_FUNC_VIS
+size_t hash_value(const path& __p) noexcept;
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_PATH_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/path_iterator.h b/app/src/main/cpp/libcxx/include/__filesystem/path_iterator.h
new file mode 100644
index 0000000..6f2baf8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/path_iterator.h
@@ -0,0 +1,134 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_PATH_ITERATOR_H
+#define _LIBCPP___FILESYSTEM_PATH_ITERATOR_H
+
+#include <__assert>
+#include <__availability>
+#include <__config>
+#include <__filesystem/path.h>
+#include <__iterator/iterator_traits.h>
+#include <cstddef>
+#include <string>
+#include <string_view>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+class _LIBCPP_TYPE_VIS path::iterator {
+public:
+  enum _ParserState : unsigned char {
+    _Singular,
+    _BeforeBegin,
+    _InRootName,
+    _InRootDir,
+    _InFilenames,
+    _InTrailingSep,
+    _AtEnd
+  };
+
+public:
+  typedef input_iterator_tag iterator_category;
+  typedef bidirectional_iterator_tag iterator_concept;
+
+  typedef path value_type;
+  typedef ptrdiff_t difference_type;
+  typedef const path* pointer;
+  typedef path reference;
+
+public:
+  _LIBCPP_INLINE_VISIBILITY
+  iterator()
+      : __stashed_elem_(), __path_ptr_(nullptr), __entry_(),
+        __state_(_Singular) {}
+
+  iterator(const iterator&) = default;
+  ~iterator() = default;
+
+  iterator& operator=(const iterator&) = default;
+
+  _LIBCPP_INLINE_VISIBILITY
+  reference operator*() const { return __stashed_elem_; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  pointer operator->() const { return &__stashed_elem_; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  iterator& operator++() {
+    _LIBCPP_ASSERT(__state_ != _Singular,
+                   "attempting to increment a singular iterator");
+    _LIBCPP_ASSERT(__state_ != _AtEnd,
+                   "attempting to increment the end iterator");
+    return __increment();
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  iterator operator++(int) {
+    iterator __it(*this);
+    this->operator++();
+    return __it;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  iterator& operator--() {
+    _LIBCPP_ASSERT(__state_ != _Singular,
+                   "attempting to decrement a singular iterator");
+    _LIBCPP_ASSERT(__entry_.data() != __path_ptr_->native().data(),
+                   "attempting to decrement the begin iterator");
+    return __decrement();
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  iterator operator--(int) {
+    iterator __it(*this);
+    this->operator--();
+    return __it;
+  }
+
+private:
+  friend class path;
+
+  inline _LIBCPP_INLINE_VISIBILITY friend bool operator==(const iterator&,
+                                                          const iterator&);
+
+  iterator& __increment();
+  iterator& __decrement();
+
+  path __stashed_elem_;
+  const path* __path_ptr_;
+  path::__string_view __entry_;
+  _ParserState __state_;
+};
+
+inline _LIBCPP_INLINE_VISIBILITY bool operator==(const path::iterator& __lhs,
+                                                 const path::iterator& __rhs) {
+  return __lhs.__path_ptr_ == __rhs.__path_ptr_ &&
+         __lhs.__entry_.data() == __rhs.__entry_.data();
+}
+
+inline _LIBCPP_INLINE_VISIBILITY bool operator!=(const path::iterator& __lhs,
+                                                 const path::iterator& __rhs) {
+  return !(__lhs == __rhs);
+}
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_PATH_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/perm_options.h b/app/src/main/cpp/libcxx/include/__filesystem/perm_options.h
new file mode 100644
index 0000000..4aba302
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/perm_options.h
@@ -0,0 +1,77 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_PERM_OPTIONS_H
+#define _LIBCPP___FILESYSTEM_PERM_OPTIONS_H
+
+#include <__availability>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+enum class _LIBCPP_ENUM_VIS perm_options : unsigned char {
+  replace = 1,
+  add = 2,
+  remove = 4,
+  nofollow = 8
+};
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr perm_options operator&(perm_options __lhs, perm_options __rhs) {
+  return static_cast<perm_options>(static_cast<unsigned>(__lhs) &
+                                   static_cast<unsigned>(__rhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr perm_options operator|(perm_options __lhs, perm_options __rhs) {
+  return static_cast<perm_options>(static_cast<unsigned>(__lhs) |
+                                   static_cast<unsigned>(__rhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr perm_options operator^(perm_options __lhs, perm_options __rhs) {
+  return static_cast<perm_options>(static_cast<unsigned>(__lhs) ^
+                                   static_cast<unsigned>(__rhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr perm_options operator~(perm_options __lhs) {
+  return static_cast<perm_options>(~static_cast<unsigned>(__lhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline perm_options& operator&=(perm_options& __lhs, perm_options __rhs) {
+  return __lhs = __lhs & __rhs;
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline perm_options& operator|=(perm_options& __lhs, perm_options __rhs) {
+  return __lhs = __lhs | __rhs;
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline perm_options& operator^=(perm_options& __lhs, perm_options __rhs) {
+  return __lhs = __lhs ^ __rhs;
+}
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_PERM_OPTIONS_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/perms.h b/app/src/main/cpp/libcxx/include/__filesystem/perms.h
new file mode 100644
index 0000000..df45900
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/perms.h
@@ -0,0 +1,95 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_PERMS_H
+#define _LIBCPP___FILESYSTEM_PERMS_H
+
+#include <__availability>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+// On Windows, these permission bits map to one single readonly flag per
+// file, and the executable bit is always returned as set. When setting
+// permissions, as long as the write bit is set for either owner, group or
+// others, the readonly flag is cleared.
+enum class _LIBCPP_ENUM_VIS perms : unsigned {
+  none = 0,
+
+  owner_read = 0400,
+  owner_write = 0200,
+  owner_exec = 0100,
+  owner_all = 0700,
+
+  group_read = 040,
+  group_write = 020,
+  group_exec = 010,
+  group_all = 070,
+
+  others_read = 04,
+  others_write = 02,
+  others_exec = 01,
+  others_all = 07,
+
+  all = 0777,
+
+  set_uid = 04000,
+  set_gid = 02000,
+  sticky_bit = 01000,
+  mask = 07777,
+  unknown = 0xFFFF,
+};
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr perms operator&(perms __lhs, perms __rhs) {
+  return static_cast<perms>(static_cast<unsigned>(__lhs) &
+                            static_cast<unsigned>(__rhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr perms operator|(perms __lhs, perms __rhs) {
+  return static_cast<perms>(static_cast<unsigned>(__lhs) |
+                            static_cast<unsigned>(__rhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr perms operator^(perms __lhs, perms __rhs) {
+  return static_cast<perms>(static_cast<unsigned>(__lhs) ^
+                            static_cast<unsigned>(__rhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr perms operator~(perms __lhs) {
+  return static_cast<perms>(~static_cast<unsigned>(__lhs));
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline perms& operator&=(perms& __lhs, perms __rhs) { return __lhs = __lhs & __rhs; }
+
+_LIBCPP_INLINE_VISIBILITY
+inline perms& operator|=(perms& __lhs, perms __rhs) { return __lhs = __lhs | __rhs; }
+
+_LIBCPP_INLINE_VISIBILITY
+inline perms& operator^=(perms& __lhs, perms __rhs) { return __lhs = __lhs ^ __rhs; }
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_PERMS_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/recursive_directory_iterator.h b/app/src/main/cpp/libcxx/include/__filesystem/recursive_directory_iterator.h
new file mode 100644
index 0000000..b20d201
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/recursive_directory_iterator.h
@@ -0,0 +1,185 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_RECURSIVE_DIRECTORY_ITERATOR_H
+#define _LIBCPP___FILESYSTEM_RECURSIVE_DIRECTORY_ITERATOR_H
+
+#include <__availability>
+#include <__config>
+#include <__filesystem/directory_entry.h>
+#include <__filesystem/directory_options.h>
+#include <__filesystem/path.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/shared_ptr.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/enable_view.h>
+#include <cstddef>
+#include <system_error>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+class recursive_directory_iterator {
+public:
+  using value_type = directory_entry;
+  using difference_type = ptrdiff_t;
+  using pointer = directory_entry const*;
+  using reference = directory_entry const&;
+  using iterator_category = input_iterator_tag;
+
+public:
+  // constructors and destructor
+  _LIBCPP_INLINE_VISIBILITY
+  recursive_directory_iterator() noexcept : __rec_(false) {}
+
+  _LIBCPP_INLINE_VISIBILITY
+  explicit recursive_directory_iterator(
+      const path& __p, directory_options __xoptions = directory_options::none)
+      : recursive_directory_iterator(__p, __xoptions, nullptr) {}
+
+  _LIBCPP_INLINE_VISIBILITY
+  recursive_directory_iterator(const path& __p, directory_options __xoptions,
+                               error_code& __ec)
+      : recursive_directory_iterator(__p, __xoptions, &__ec) {}
+
+  _LIBCPP_INLINE_VISIBILITY
+  recursive_directory_iterator(const path& __p, error_code& __ec)
+      : recursive_directory_iterator(__p, directory_options::none, &__ec) {}
+
+  recursive_directory_iterator(const recursive_directory_iterator&) = default;
+  recursive_directory_iterator(recursive_directory_iterator&&) = default;
+
+  recursive_directory_iterator&
+  operator=(const recursive_directory_iterator&) = default;
+
+  _LIBCPP_INLINE_VISIBILITY
+  recursive_directory_iterator&
+  operator=(recursive_directory_iterator&& __o) noexcept {
+    // non-default implementation provided to support self-move assign.
+    if (this != &__o) {
+      __imp_ = _VSTD::move(__o.__imp_);
+      __rec_ = __o.__rec_;
+    }
+    return *this;
+  }
+
+  ~recursive_directory_iterator() = default;
+
+  _LIBCPP_INLINE_VISIBILITY
+  const directory_entry& operator*() const { return __dereference(); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  const directory_entry* operator->() const { return &__dereference(); }
+
+  recursive_directory_iterator& operator++() { return __increment(); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  __dir_element_proxy operator++(int) {
+    __dir_element_proxy __p(**this);
+    __increment();
+    return __p;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  recursive_directory_iterator& increment(error_code& __ec) {
+    return __increment(&__ec);
+  }
+
+  _LIBCPP_FUNC_VIS directory_options options() const;
+  _LIBCPP_FUNC_VIS int depth() const;
+
+  _LIBCPP_INLINE_VISIBILITY
+  void pop() { __pop(); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void pop(error_code& __ec) { __pop(&__ec); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  bool recursion_pending() const { return __rec_; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void disable_recursion_pending() { __rec_ = false; }
+
+private:
+  _LIBCPP_FUNC_VIS
+  recursive_directory_iterator(const path& __p, directory_options __opt,
+                               error_code* __ec);
+
+  _LIBCPP_FUNC_VIS
+  const directory_entry& __dereference() const;
+
+  _LIBCPP_FUNC_VIS
+  bool __try_recursion(error_code* __ec);
+
+  _LIBCPP_FUNC_VIS
+  void __advance(error_code* __ec = nullptr);
+
+  _LIBCPP_FUNC_VIS
+  recursive_directory_iterator& __increment(error_code* __ec = nullptr);
+
+  _LIBCPP_FUNC_VIS
+  void __pop(error_code* __ec = nullptr);
+
+  inline _LIBCPP_INLINE_VISIBILITY friend bool
+  operator==(const recursive_directory_iterator&,
+             const recursive_directory_iterator&) noexcept;
+
+  struct _LIBCPP_HIDDEN __shared_imp;
+  shared_ptr<__shared_imp> __imp_;
+  bool __rec_;
+}; // class recursive_directory_iterator
+
+inline _LIBCPP_INLINE_VISIBILITY bool
+operator==(const recursive_directory_iterator& __lhs,
+           const recursive_directory_iterator& __rhs) noexcept {
+  return __lhs.__imp_ == __rhs.__imp_;
+}
+
+_LIBCPP_INLINE_VISIBILITY
+inline bool operator!=(const recursive_directory_iterator& __lhs,
+                       const recursive_directory_iterator& __rhs) noexcept {
+  return !(__lhs == __rhs);
+}
+// enable recursive_directory_iterator range-based for statements
+inline _LIBCPP_INLINE_VISIBILITY recursive_directory_iterator
+begin(recursive_directory_iterator __iter) noexcept {
+  return __iter;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY recursive_directory_iterator
+end(recursive_directory_iterator) noexcept {
+  return recursive_directory_iterator();
+}
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#if _LIBCPP_STD_VER > 17
+
+template <>
+_LIBCPP_AVAILABILITY_FILESYSTEM
+inline constexpr bool _VSTD::ranges::enable_borrowed_range<_VSTD_FS::recursive_directory_iterator> = true;
+
+template <>
+_LIBCPP_AVAILABILITY_FILESYSTEM
+inline constexpr bool _VSTD::ranges::enable_view<_VSTD_FS::recursive_directory_iterator> = true;
+
+#endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_RECURSIVE_DIRECTORY_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/space_info.h b/app/src/main/cpp/libcxx/include/__filesystem/space_info.h
new file mode 100644
index 0000000..d0747e3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/space_info.h
@@ -0,0 +1,43 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_SPACE_INFO_H
+#define _LIBCPP___FILESYSTEM_SPACE_INFO_H
+
+#include <__availability>
+#include <__config>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+struct _LIBCPP_TYPE_VIS space_info {
+  uintmax_t capacity;
+  uintmax_t free;
+  uintmax_t available;
+
+#  if _LIBCPP_STD_VER > 17
+  friend _LIBCPP_HIDE_FROM_ABI bool operator==(const space_info&, const space_info&) = default;
+#  endif
+};
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_SPACE_INFO_H
diff --git a/app/src/main/cpp/libcxx/include/__filesystem/u8path.h b/app/src/main/cpp/libcxx/include/__filesystem/u8path.h
new file mode 100644
index 0000000..d35faa1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__filesystem/u8path.h
@@ -0,0 +1,108 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FILESYSTEM_U8PATH_H
+#define _LIBCPP___FILESYSTEM_U8PATH_H
+
+#include <__algorithm/unwrap_iter.h>
+#include <__availability>
+#include <__config>
+#include <__filesystem/path.h>
+#include <string>
+#include <type_traits>
+
+// Only required on Windows for __widen_from_utf8, and included conservatively
+// because it requires support for localization.
+#if defined(_LIBCPP_WIN32API)
+# include <locale>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_FILESYSTEM
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_PUSH
+
+template <class _InputIt>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_DEPRECATED_WITH_CHAR8_T
+    typename enable_if<__is_pathable<_InputIt>::value, path>::type
+    u8path(_InputIt __f, _InputIt __l) {
+  static_assert(
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+      is_same<typename __is_pathable<_InputIt>::__char_type, char8_t>::value ||
+#endif
+      is_same<typename __is_pathable<_InputIt>::__char_type, char>::value,
+      "u8path(Iter, Iter) requires Iter have a value_type of type 'char'"
+      " or 'char8_t'");
+#if defined(_LIBCPP_WIN32API)
+  string __tmp(__f, __l);
+  using _CVT = __widen_from_utf8<sizeof(wchar_t) * __CHAR_BIT__>;
+  _VSTD::wstring __w;
+  __w.reserve(__tmp.size());
+  _CVT()(back_inserter(__w), __tmp.data(), __tmp.data() + __tmp.size());
+  return path(__w);
+#else
+  return path(__f, __l);
+#endif /* !_LIBCPP_WIN32API */
+}
+
+#if defined(_LIBCPP_WIN32API)
+template <class _InputIt>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_DEPRECATED_WITH_CHAR8_T
+    typename enable_if<__is_pathable<_InputIt>::value, path>::type
+    u8path(_InputIt __f, _NullSentinel) {
+  static_assert(
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+      is_same<typename __is_pathable<_InputIt>::__char_type, char8_t>::value ||
+#endif
+      is_same<typename __is_pathable<_InputIt>::__char_type, char>::value,
+      "u8path(Iter, Iter) requires Iter have a value_type of type 'char'"
+      " or 'char8_t'");
+  string __tmp;
+  const char __sentinel = char{};
+  for (; *__f != __sentinel; ++__f)
+    __tmp.push_back(*__f);
+  using _CVT = __widen_from_utf8<sizeof(wchar_t) * __CHAR_BIT__>;
+  _VSTD::wstring __w;
+  __w.reserve(__tmp.size());
+  _CVT()(back_inserter(__w), __tmp.data(), __tmp.data() + __tmp.size());
+  return path(__w);
+}
+#endif /* _LIBCPP_WIN32API */
+
+template <class _Source>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_DEPRECATED_WITH_CHAR8_T
+    typename enable_if<__is_pathable<_Source>::value, path>::type
+    u8path(const _Source& __s) {
+  static_assert(
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+      is_same<typename __is_pathable<_Source>::__char_type, char8_t>::value ||
+#endif
+      is_same<typename __is_pathable<_Source>::__char_type, char>::value,
+      "u8path(Source const&) requires Source have a character type of type "
+      "'char' or 'char8_t'");
+#if defined(_LIBCPP_WIN32API)
+  using _Traits = __is_pathable<_Source>;
+  return u8path(_VSTD::__unwrap_iter(_Traits::__range_begin(__s)), _VSTD::__unwrap_iter(_Traits::__range_end(__s)));
+#else
+  return path(__s);
+#endif
+}
+
+_LIBCPP_AVAILABILITY_FILESYSTEM_POP
+
+_LIBCPP_END_NAMESPACE_FILESYSTEM
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FILESYSTEM_U8PATH_H
diff --git a/app/src/main/cpp/libcxx/include/__format/buffer.h b/app/src/main/cpp/libcxx/include/__format/buffer.h
new file mode 100644
index 0000000..ddfe767
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/buffer.h
@@ -0,0 +1,573 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_BUFFER_H
+#define _LIBCPP___FORMAT_BUFFER_H
+
+#include <__algorithm/copy_n.h>
+#include <__algorithm/fill_n.h>
+#include <__algorithm/max.h>
+#include <__algorithm/min.h>
+#include <__algorithm/ranges_copy_n.h>
+#include <__algorithm/transform.h>
+#include <__algorithm/unwrap_iter.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/enable_insertable.h>
+#include <__format/format_to_n_result.h>
+#include <__iterator/back_insert_iterator.h>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/wrap_iter.h>
+#include <__utility/move.h>
+#include <cstddef>
+#include <string_view>
+#include <type_traits>
+#include <vector>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace __format {
+
+/// A "buffer" that handles writing to the proper iterator.
+///
+/// This helper is used together with the @ref back_insert_iterator to offer
+/// type-erasure for the formatting functions. This reduces the number to
+/// template instantiations.
+template <__fmt_char_type _CharT>
+class _LIBCPP_TEMPLATE_VIS __output_buffer {
+public:
+  using value_type = _CharT;
+
+  template <class _Tp>
+  _LIBCPP_HIDE_FROM_ABI explicit __output_buffer(_CharT* __ptr, size_t __capacity, _Tp* __obj)
+      : __ptr_(__ptr),
+        __capacity_(__capacity),
+        __flush_([](_CharT* __p, size_t __n, void* __o) { static_cast<_Tp*>(__o)->__flush(__p, __n); }),
+        __obj_(__obj) {}
+
+  _LIBCPP_HIDE_FROM_ABI void __reset(_CharT* __ptr, size_t __capacity) {
+    __ptr_ = __ptr;
+    __capacity_ = __capacity;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI auto __make_output_iterator() { return std::back_insert_iterator{*this}; }
+
+  // Used in std::back_insert_iterator.
+  _LIBCPP_HIDE_FROM_ABI void push_back(_CharT __c) {
+    __ptr_[__size_++] = __c;
+
+    // Profiling showed flushing after adding is more efficient than flushing
+    // when entering the function.
+    if (__size_ == __capacity_)
+      __flush();
+  }
+
+  /// Copies the input __str to the buffer.
+  ///
+  /// Since some of the input is generated by std::to_chars, there needs to be a
+  /// conversion when _CharT is wchar_t.
+  template <__fmt_char_type _InCharT>
+  _LIBCPP_HIDE_FROM_ABI void __copy(basic_string_view<_InCharT> __str) {
+    // When the underlying iterator is a simple iterator the __capacity_ is
+    // infinite. For a string or container back_inserter it isn't. This means
+    // adding a large string the the buffer can cause some overhead. In that
+    // case a better approach could be:
+    // - flush the buffer
+    // - container.append(__str.begin(), __str.end());
+    // The same holds true for the fill.
+    // For transform it might be slightly harder, however the use case for
+    // transform is slightly less common; it converts hexadecimal values to
+    // upper case. For integral these strings are short.
+    // TODO FMT Look at the improvements above.
+    size_t __n = __str.size();
+
+    __flush_on_overflow(__n);
+    if (__n <= __capacity_) {
+      _VSTD::copy_n(__str.data(), __n, _VSTD::addressof(__ptr_[__size_]));
+      __size_ += __n;
+      return;
+    }
+
+    // The output doesn't fit in the internal buffer.
+    // Copy the data in "__capacity_" sized chunks.
+    _LIBCPP_ASSERT(__size_ == 0, "the buffer should be flushed by __flush_on_overflow");
+    const _InCharT* __first = __str.data();
+    do {
+      size_t __chunk = _VSTD::min(__n, __capacity_);
+      _VSTD::copy_n(__first, __chunk, _VSTD::addressof(__ptr_[__size_]));
+      __size_ = __chunk;
+      __first += __chunk;
+      __n -= __chunk;
+      __flush();
+    } while (__n);
+  }
+
+  /// A std::transform wrapper.
+  ///
+  /// Like @ref __copy it may need to do type conversion.
+  template <__fmt_char_type _InCharT, class _UnaryOperation>
+  _LIBCPP_HIDE_FROM_ABI void __transform(const _InCharT* __first, const _InCharT* __last, _UnaryOperation __operation) {
+    _LIBCPP_ASSERT(__first <= __last, "not a valid range");
+
+    size_t __n = static_cast<size_t>(__last - __first);
+    __flush_on_overflow(__n);
+    if (__n <= __capacity_) {
+      _VSTD::transform(__first, __last, _VSTD::addressof(__ptr_[__size_]), _VSTD::move(__operation));
+      __size_ += __n;
+      return;
+    }
+
+    // The output doesn't fit in the internal buffer.
+    // Transform the data in "__capacity_" sized chunks.
+    _LIBCPP_ASSERT(__size_ == 0, "the buffer should be flushed by __flush_on_overflow");
+    do {
+      size_t __chunk = _VSTD::min(__n, __capacity_);
+      _VSTD::transform(__first, __first + __chunk, _VSTD::addressof(__ptr_[__size_]), __operation);
+      __size_ = __chunk;
+      __first += __chunk;
+      __n -= __chunk;
+      __flush();
+    } while (__n);
+  }
+
+  /// A \c fill_n wrapper.
+  _LIBCPP_HIDE_FROM_ABI void __fill(size_t __n, _CharT __value) {
+    __flush_on_overflow(__n);
+    if (__n <= __capacity_) {
+      _VSTD::fill_n(_VSTD::addressof(__ptr_[__size_]), __n, __value);
+      __size_ += __n;
+      return;
+    }
+
+    // The output doesn't fit in the internal buffer.
+    // Fill the buffer in "__capacity_" sized chunks.
+    _LIBCPP_ASSERT(__size_ == 0, "the buffer should be flushed by __flush_on_overflow");
+    do {
+      size_t __chunk = _VSTD::min(__n, __capacity_);
+      _VSTD::fill_n(_VSTD::addressof(__ptr_[__size_]), __chunk, __value);
+      __size_ = __chunk;
+      __n -= __chunk;
+      __flush();
+    } while (__n);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI void __flush() {
+    __flush_(__ptr_, __size_, __obj_);
+    __size_ = 0;
+  }
+
+private:
+  _CharT* __ptr_;
+  size_t __capacity_;
+  size_t __size_{0};
+  void (*__flush_)(_CharT*, size_t, void*);
+  void* __obj_;
+
+  /// Flushes the buffer when the output operation would overflow the buffer.
+  ///
+  /// A simple approach for the overflow detection would be something along the
+  /// lines:
+  /// \code
+  /// // The internal buffer is large enough.
+  /// if (__n <= __capacity_) {
+  ///   // Flush when we really would overflow.
+  ///   if (__size_ + __n >= __capacity_)
+  ///     __flush();
+  ///   ...
+  /// }
+  /// \endcode
+  ///
+  /// This approach works for all cases but one:
+  /// A __format_to_n_buffer_base where \ref __enable_direct_output is true.
+  /// In that case the \ref __capacity_ of the buffer changes during the first
+  /// \ref __flush. During that operation the output buffer switches from its
+  /// __writer_ to its __storage_. The \ref __capacity_ of the former depends
+  /// on the value of n, of the latter is a fixed size. For example:
+  /// - a format_to_n call with a 10'000 char buffer,
+  /// - the buffer is filled with 9'500 chars,
+  /// - adding 1'000 elements would overflow the buffer so the buffer gets
+  ///   changed and the \ref __capacity_ decreases from 10'000 to
+  ///   __buffer_size (256 at the time of writing).
+  ///
+  /// This means that the \ref __flush for this class may need to copy a part of
+  /// the internal buffer to the proper output. In this example there will be
+  /// 500 characters that need this copy operation.
+  ///
+  /// Note it would be more efficient to write 500 chars directly and then swap
+  /// the buffers. This would make the code more complex and \ref format_to_n is
+  /// not the most common use case. Therefore the optimization isn't done.
+  _LIBCPP_HIDE_FROM_ABI void __flush_on_overflow(size_t __n) {
+    if (__size_ + __n >= __capacity_)
+      __flush();
+  }
+};
+
+/// A storage using an internal buffer.
+///
+/// This storage is used when writing a single element to the output iterator
+/// is expensive.
+template <__fmt_char_type _CharT>
+class _LIBCPP_TEMPLATE_VIS __internal_storage {
+public:
+  _LIBCPP_HIDE_FROM_ABI _CharT* __begin() { return __buffer_; }
+
+  static constexpr size_t __buffer_size = 256 / sizeof(_CharT);
+
+private:
+  _CharT __buffer_[__buffer_size];
+};
+
+/// A storage writing directly to the storage.
+///
+/// This requires the storage to be a contiguous buffer of \a _CharT.
+/// Since the output is directly written to the underlying storage this class
+/// is just an empty class.
+template <__fmt_char_type _CharT>
+class _LIBCPP_TEMPLATE_VIS __direct_storage {};
+
+template <class _OutIt, class _CharT>
+concept __enable_direct_output = __fmt_char_type<_CharT> &&
+    (same_as<_OutIt, _CharT*>
+#ifndef _LIBCPP_ENABLE_DEBUG_MODE
+     || same_as<_OutIt, __wrap_iter<_CharT*>>
+#endif
+    );
+
+/// Write policy for directly writing to the underlying output.
+template <class _OutIt, __fmt_char_type _CharT>
+class _LIBCPP_TEMPLATE_VIS __writer_direct {
+public:
+  _LIBCPP_HIDE_FROM_ABI explicit __writer_direct(_OutIt __out_it)
+      : __out_it_(__out_it) {}
+
+  _LIBCPP_HIDE_FROM_ABI _OutIt __out_it() { return __out_it_; }
+
+  _LIBCPP_HIDE_FROM_ABI void __flush(_CharT*, size_t __n) {
+    // _OutIt can be a __wrap_iter<CharT*>. Therefore the original iterator
+    // is adjusted.
+    __out_it_ += __n;
+  }
+
+private:
+  _OutIt __out_it_;
+};
+
+/// Write policy for copying the buffer to the output.
+template <class _OutIt, __fmt_char_type _CharT>
+class _LIBCPP_TEMPLATE_VIS __writer_iterator {
+public:
+  _LIBCPP_HIDE_FROM_ABI explicit __writer_iterator(_OutIt __out_it)
+      : __out_it_{_VSTD::move(__out_it)} {}
+
+  _LIBCPP_HIDE_FROM_ABI _OutIt __out_it() && { return std::move(__out_it_); }
+
+  _LIBCPP_HIDE_FROM_ABI void __flush(_CharT* __ptr, size_t __n) {
+    __out_it_ = std::ranges::copy_n(__ptr, __n, std::move(__out_it_)).out;
+  }
+
+private:
+  _OutIt __out_it_;
+};
+
+/// Concept to see whether a \a _Container is insertable.
+///
+/// The concept is used to validate whether multiple calls to a
+/// \ref back_insert_iterator can be replace by a call to \c _Container::insert.
+///
+/// \note a \a _Container needs to opt-in to the concept by specializing
+/// \ref __enable_insertable.
+template <class _Container>
+concept __insertable =
+    __enable_insertable<_Container> && __fmt_char_type<typename _Container::value_type> &&
+    requires(_Container& __t, add_pointer_t<typename _Container::value_type> __first,
+             add_pointer_t<typename _Container::value_type> __last) { __t.insert(__t.end(), __first, __last); };
+
+/// Extract the container type of a \ref back_insert_iterator.
+template <class _It>
+struct _LIBCPP_TEMPLATE_VIS __back_insert_iterator_container {
+  using type = void;
+};
+
+template <__insertable _Container>
+struct _LIBCPP_TEMPLATE_VIS __back_insert_iterator_container<back_insert_iterator<_Container>> {
+  using type = _Container;
+};
+
+/// Write policy for inserting the buffer in a container.
+template <class _Container>
+class _LIBCPP_TEMPLATE_VIS __writer_container {
+public:
+  using _CharT = typename _Container::value_type;
+
+  _LIBCPP_HIDE_FROM_ABI explicit __writer_container(back_insert_iterator<_Container> __out_it)
+      : __container_{__out_it.__get_container()} {}
+
+  _LIBCPP_HIDE_FROM_ABI auto __out_it() { return std::back_inserter(*__container_); }
+
+  _LIBCPP_HIDE_FROM_ABI void __flush(_CharT* __ptr, size_t __n) {
+    __container_->insert(__container_->end(), __ptr, __ptr + __n);
+  }
+
+private:
+  _Container* __container_;
+};
+
+/// Selects the type of the writer used for the output iterator.
+template <class _OutIt, class _CharT>
+class _LIBCPP_TEMPLATE_VIS __writer_selector {
+  using _Container = typename __back_insert_iterator_container<_OutIt>::type;
+
+public:
+  using type = conditional_t<!same_as<_Container, void>, __writer_container<_Container>,
+                             conditional_t<__enable_direct_output<_OutIt, _CharT>, __writer_direct<_OutIt, _CharT>,
+                                           __writer_iterator<_OutIt, _CharT>>>;
+};
+
+/// The generic formatting buffer.
+template <class _OutIt, __fmt_char_type _CharT>
+requires(output_iterator<_OutIt, const _CharT&>) class _LIBCPP_TEMPLATE_VIS
+    __format_buffer {
+  using _Storage =
+      conditional_t<__enable_direct_output<_OutIt, _CharT>,
+                    __direct_storage<_CharT>, __internal_storage<_CharT>>;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI explicit __format_buffer(_OutIt __out_it)
+    requires(same_as<_Storage, __internal_storage<_CharT>>)
+      : __output_(__storage_.__begin(), __storage_.__buffer_size, this), __writer_(_VSTD::move(__out_it)) {}
+
+  _LIBCPP_HIDE_FROM_ABI explicit __format_buffer(_OutIt __out_it) requires(
+      same_as<_Storage, __direct_storage<_CharT>>)
+      : __output_(_VSTD::__unwrap_iter(__out_it), size_t(-1), this),
+        __writer_(_VSTD::move(__out_it)) {}
+
+  _LIBCPP_HIDE_FROM_ABI auto __make_output_iterator() { return __output_.__make_output_iterator(); }
+
+  _LIBCPP_HIDE_FROM_ABI void __flush(_CharT* __ptr, size_t __n) { __writer_.__flush(__ptr, __n); }
+
+  _LIBCPP_HIDE_FROM_ABI _OutIt __out_it() && {
+    __output_.__flush();
+    return _VSTD::move(__writer_).__out_it();
+  }
+
+private:
+  _LIBCPP_NO_UNIQUE_ADDRESS _Storage __storage_;
+  __output_buffer<_CharT> __output_;
+  typename __writer_selector<_OutIt, _CharT>::type __writer_;
+};
+
+/// A buffer that counts the number of insertions.
+///
+/// Since \ref formatted_size only needs to know the size, the output itself is
+/// discarded.
+template <__fmt_char_type _CharT>
+class _LIBCPP_TEMPLATE_VIS __formatted_size_buffer {
+public:
+  _LIBCPP_HIDE_FROM_ABI auto __make_output_iterator() { return __output_.__make_output_iterator(); }
+
+  _LIBCPP_HIDE_FROM_ABI void __flush(const _CharT*, size_t __n) { __size_ += __n; }
+
+  _LIBCPP_HIDE_FROM_ABI size_t __result() && {
+    __output_.__flush();
+    return __size_;
+  }
+
+private:
+  __internal_storage<_CharT> __storage_;
+  __output_buffer<_CharT> __output_{__storage_.__begin(), __storage_.__buffer_size, this};
+  size_t __size_{0};
+};
+
+/// The base of a buffer that counts and limits the number of insertions.
+template <class _OutIt, __fmt_char_type _CharT, bool>
+  requires(output_iterator<_OutIt, const _CharT&>)
+struct _LIBCPP_TEMPLATE_VIS __format_to_n_buffer_base {
+  using _Size = iter_difference_t<_OutIt>;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI explicit __format_to_n_buffer_base(_OutIt __out_it, _Size __max_size)
+      : __writer_(_VSTD::move(__out_it)), __max_size_(_VSTD::max(_Size(0), __max_size)) {}
+
+  _LIBCPP_HIDE_FROM_ABI void __flush(_CharT* __ptr, size_t __n) {
+    if (_Size(__size_) <= __max_size_)
+      __writer_.__flush(__ptr, _VSTD::min(_Size(__n), __max_size_ - __size_));
+    __size_ += __n;
+  }
+
+protected:
+  __internal_storage<_CharT> __storage_;
+  __output_buffer<_CharT> __output_{__storage_.__begin(), __storage_.__buffer_size, this};
+  typename __writer_selector<_OutIt, _CharT>::type __writer_;
+
+  _Size __max_size_;
+  _Size __size_{0};
+};
+
+/// The base of a buffer that counts and limits the number of insertions.
+///
+/// This version is used when \c __enable_direct_output<_OutIt, _CharT> == true.
+///
+/// This class limits the size available to the direct writer so it will not
+/// exceed the maximum number of code units.
+template <class _OutIt, __fmt_char_type _CharT>
+  requires(output_iterator<_OutIt, const _CharT&>)
+class _LIBCPP_TEMPLATE_VIS __format_to_n_buffer_base<_OutIt, _CharT, true> {
+  using _Size = iter_difference_t<_OutIt>;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI explicit __format_to_n_buffer_base(_OutIt __out_it, _Size __max_size)
+      : __output_(_VSTD::__unwrap_iter(__out_it), __max_size, this),
+        __writer_(_VSTD::move(__out_it)),
+        __max_size_(__max_size) {
+    if (__max_size <= 0) [[unlikely]]
+      __output_.__reset(__storage_.__begin(), __storage_.__buffer_size);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI void __flush(_CharT* __ptr, size_t __n) {
+    // A __flush to the direct writer happens in the following occasions:
+    // - The format function has written the maximum number of allowed code
+    //   units. At this point it's no longer valid to write to this writer. So
+    //   switch to the internal storage. This internal storage doesn't need to
+    //   be written anywhere so the __flush for that storage writes no output.
+    // - Like above, but the next "mass write" operation would overflow the
+    //   buffer. In that case the buffer is pre-emptively switched. The still
+    //   valid code units will be written separately.
+    // - The format_to_n function is finished. In this case there's no need to
+    //   switch the buffer, but for simplicity the buffers are still switched.
+    // When the __max_size <= 0 the constructor already switched the buffers.
+    if (__size_ == 0 && __ptr != __storage_.__begin()) {
+      __writer_.__flush(__ptr, __n);
+      __output_.__reset(__storage_.__begin(), __storage_.__buffer_size);
+    } else if (__size_ < __max_size_) {
+      // Copies a part of the internal buffer to the output up to n characters.
+      // See __output_buffer<_CharT>::__flush_on_overflow for more information.
+      _Size __s = _VSTD::min(_Size(__n), __max_size_ - __size_);
+      std::copy_n(__ptr, __s, __writer_.__out_it());
+      __writer_.__flush(__ptr, __s);
+    }
+
+    __size_ += __n;
+  }
+
+protected:
+  __internal_storage<_CharT> __storage_;
+  __output_buffer<_CharT> __output_;
+  __writer_direct<_OutIt, _CharT> __writer_;
+
+  _Size __max_size_;
+  _Size __size_{0};
+};
+
+/// The buffer that counts and limits the number of insertions.
+template <class _OutIt, __fmt_char_type _CharT>
+  requires(output_iterator<_OutIt, const _CharT&>)
+struct _LIBCPP_TEMPLATE_VIS __format_to_n_buffer final
+    : public __format_to_n_buffer_base< _OutIt, _CharT, __enable_direct_output<_OutIt, _CharT>> {
+  using _Base = __format_to_n_buffer_base<_OutIt, _CharT, __enable_direct_output<_OutIt, _CharT>>;
+  using _Size = iter_difference_t<_OutIt>;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI explicit __format_to_n_buffer(_OutIt __out_it, _Size __max_size)
+      : _Base(_VSTD::move(__out_it), __max_size) {}
+  _LIBCPP_HIDE_FROM_ABI auto __make_output_iterator() { return this->__output_.__make_output_iterator(); }
+
+  _LIBCPP_HIDE_FROM_ABI format_to_n_result<_OutIt> __result() && {
+    this->__output_.__flush();
+    return {_VSTD::move(this->__writer_).__out_it(), this->__size_};
+  }
+};
+
+// A dynamically growing buffer intended to be used for retargeting a context.
+//
+// P2286 Formatting ranges adds range formatting support. It allows the user to
+// specify the minimum width for the entire formatted range.  The width of the
+// range is not known until the range is formatted. Formatting is done to an
+// output_iterator so there's no guarantee it would be possible to add the fill
+// to the front of the output. Instead the range is formatted to a temporary
+// buffer and that buffer is formatted as a string.
+//
+// There is an issue with that approach, the format context used in
+// std::formatter<T>::format contains the output iterator used as part of its
+// type. So using this output iterator means there needs to be a new format
+// context and the format arguments need to be retargeted to the new context.
+// This retargeting is done by a basic_format_context specialized for the
+// __iterator of this container.
+template <__fmt_char_type _CharT>
+class _LIBCPP_TEMPLATE_VIS __retarget_buffer {
+public:
+  using value_type = _CharT;
+
+  struct __iterator {
+    using difference_type = ptrdiff_t;
+
+    _LIBCPP_HIDE_FROM_ABI constexpr explicit __iterator(__retarget_buffer& __buffer)
+        : __buffer_(std::addressof(__buffer)) {}
+    _LIBCPP_HIDE_FROM_ABI constexpr __iterator& operator=(const _CharT& __c) {
+      __buffer_->push_back(__c);
+      return *this;
+    }
+    _LIBCPP_HIDE_FROM_ABI constexpr __iterator& operator=(_CharT&& __c) {
+      __buffer_->push_back(__c);
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr __iterator& operator*() { return *this; }
+    _LIBCPP_HIDE_FROM_ABI constexpr __iterator& operator++() { return *this; }
+    _LIBCPP_HIDE_FROM_ABI constexpr __iterator operator++(int) { return *this; }
+    __retarget_buffer* __buffer_;
+  };
+
+  _LIBCPP_HIDE_FROM_ABI explicit __retarget_buffer(size_t __size_hint) { __buffer_.reserve(__size_hint); }
+
+  _LIBCPP_HIDE_FROM_ABI __iterator __make_output_iterator() { return __iterator{*this}; }
+
+  _LIBCPP_HIDE_FROM_ABI void push_back(_CharT __c) { __buffer_.push_back(__c); }
+
+  template <__fmt_char_type _InCharT>
+  _LIBCPP_HIDE_FROM_ABI void __copy(basic_string_view<_InCharT> __str) {
+    __buffer_.insert(__buffer_.end(), __str.begin(), __str.end());
+  }
+
+  template <__fmt_char_type _InCharT, class _UnaryOperation>
+  _LIBCPP_HIDE_FROM_ABI void __transform(const _InCharT* __first, const _InCharT* __last, _UnaryOperation __operation) {
+    _LIBCPP_ASSERT(__first <= __last, "not a valid range");
+    std::transform(__first, __last, std::back_inserter(__buffer_), std::move(__operation));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI void __fill(size_t __n, _CharT __value) { __buffer_.insert(__buffer_.end(), __n, __value); }
+
+  _LIBCPP_HIDE_FROM_ABI basic_string_view<_CharT> __view() { return {__buffer_.data(), __buffer_.size()}; }
+
+private:
+  // Use vector instead of string to avoid adding zeros after every append
+  // operation. The buffer is exposed as a string_view and not as a c-string.
+  vector<_CharT> __buffer_;
+};
+
+} // namespace __format
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___FORMAT_BUFFER_H
diff --git a/app/src/main/cpp/libcxx/include/__format/concepts.h b/app/src/main/cpp/libcxx/include/__format/concepts.h
new file mode 100644
index 0000000..fe4a7b9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/concepts.h
@@ -0,0 +1,78 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_CONCEPTS_H
+#define _LIBCPP___FORMAT_CONCEPTS_H
+
+#include <__concepts/same_as.h>
+#include <__concepts/semiregular.h>
+#include <__config>
+#include <__format/format_fwd.h>
+#include <__format/format_parse_context.h>
+#include <__type_traits/is_specialization.h>
+#include <__utility/pair.h>
+#include <tuple>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+/// The character type specializations of \ref formatter.
+template <class _CharT>
+concept __fmt_char_type =
+    same_as<_CharT, char>
+#  ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+    || same_as<_CharT, wchar_t>
+#  endif
+    ;
+
+// The output iterator isn't specified. A formatter should accept any
+// output_iterator. This iterator is a minimal iterator to test the concept.
+// (Note testing for (w)format_context would be a valid choice, but requires
+// selecting the proper one depending on the type of _CharT.)
+template <class _CharT>
+using __fmt_iter_for = _CharT*;
+
+template <class _Tp, class _CharT>
+concept __formattable =
+    (semiregular<formatter<remove_cvref_t<_Tp>, _CharT>>) &&
+    requires(formatter<remove_cvref_t<_Tp>, _CharT> __f,
+             const formatter<remove_cvref_t<_Tp>, _CharT> __cf,
+             _Tp __t,
+             basic_format_context<__fmt_iter_for<_CharT>, _CharT> __fc,
+             basic_format_parse_context<_CharT> __pc) {
+      { __f.parse(__pc) } -> same_as<typename basic_format_parse_context<_CharT>::iterator>;
+      { __cf.format(__t, __fc) } -> same_as<__fmt_iter_for<_CharT>>;
+    };
+
+#  if _LIBCPP_STD_VER > 20
+template <class _Tp, class _CharT>
+concept formattable = __formattable<_Tp, _CharT>;
+
+// [tuple.like] defines a tuple-like exposition only concept. This concept is
+// not related to that. Therefore it uses a different name for the concept.
+//
+// TODO FMT Add a test to validate we fail when using that concept after P2165
+// has been implemented.
+template <class _Tp>
+concept __fmt_pair_like = __is_specialization_v<_Tp, pair> ||
+                          // Use a requires since tuple_size_v may fail to instantiate,
+                          (__is_specialization_v<_Tp, tuple> && requires { tuple_size_v<_Tp> == 2; });
+
+#  endif //_LIBCPP_STD_VER > 20
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_CONCEPTS_H
diff --git a/app/src/main/cpp/libcxx/include/__format/container_adaptor.h b/app/src/main/cpp/libcxx/include/__format/container_adaptor.h
new file mode 100644
index 0000000..62b6981
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/container_adaptor.h
@@ -0,0 +1,70 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_CONTAINER_ADAPTOR_H
+#define _LIBCPP___FORMAT_CONTAINER_ADAPTOR_H
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#include <__availability>
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/formatter.h>
+#include <__format/range_default_formatter.h>
+#include <queue>
+#include <stack>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 20
+
+// [container.adaptors.format] only specifies the library should provide the
+// formatter specializations, not which header should provide them.
+// Since <format> includes a lot of headers, add these headers here instead of
+// adding more dependencies like, locale, optinal, string, tuple, etc. to the
+// adaptor headers. To use the format functions users already include <format>.
+
+template <class _Adaptor, class _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT __formatter_container_adaptor {
+private:
+  using __maybe_const_adaptor = __fmt_maybe_const<_Adaptor, _CharT>;
+  formatter<typename _Adaptor::container_type, _CharT> __underlying_;
+
+public:
+  template <class _ParseContext>
+  _LIBCPP_HIDE_FROM_ABI constexpr typename _ParseContext::iterator parse(_ParseContext& __ctx) {
+    return __underlying_.parse(__ctx);
+  }
+
+  template <class _FormatContext>
+  _LIBCPP_HIDE_FROM_ABI typename _FormatContext::iterator
+  format(__maybe_const_adaptor& __adaptor, _FormatContext& __ctx) const {
+    return __underlying_.format(__adaptor.__get_container(), __ctx);
+  }
+};
+
+template <class _CharT, class _Tp, formattable<_CharT> _Container>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<queue<_Tp, _Container>, _CharT>
+    : public __formatter_container_adaptor<queue<_Tp, _Container>, _CharT> {};
+
+template <class _CharT, class _Tp, class _Container, class _Compare>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<priority_queue<_Tp, _Container, _Compare>, _CharT>
+    : public __formatter_container_adaptor<priority_queue<_Tp, _Container, _Compare>, _CharT> {};
+
+template <class _CharT, class _Tp, formattable<_CharT> _Container>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<stack<_Tp, _Container>, _CharT>
+    : public __formatter_container_adaptor<stack<_Tp, _Container>, _CharT> {};
+
+#endif //_LIBCPP_STD_VER > 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_CONTAINER_ADAPTOR_H
diff --git a/app/src/main/cpp/libcxx/include/__format/enable_insertable.h b/app/src/main/cpp/libcxx/include/__format/enable_insertable.h
new file mode 100644
index 0000000..71b4252
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/enable_insertable.h
@@ -0,0 +1,35 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_ENABLE_INSERTABLE_H
+#define _LIBCPP___FORMAT_ENABLE_INSERTABLE_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace __format {
+
+/// Opt-in to enable \ref __insertable for a \a _Container.
+template <class _Container>
+inline constexpr bool __enable_insertable = false;
+
+} // namespace __format
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_ENABLE_INSERTABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__format/escaped_output_table.h b/app/src/main/cpp/libcxx/include/__format/escaped_output_table.h
new file mode 100644
index 0000000..bd2994b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/escaped_output_table.h
@@ -0,0 +1,1038 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// WARNING, this entire header is generated by
+// utils/generate_escaped_output_table.py
+// DO NOT MODIFY!
+
+// UNICODE, INC. LICENSE AGREEMENT - DATA FILES AND SOFTWARE
+//
+// See Terms of Use <https://www.unicode.org/copyright.html>
+// for definitions of Unicode Inc.'s Data Files and Software.
+//
+// NOTICE TO USER: Carefully read the following legal agreement.
+// BY DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING UNICODE INC.'S
+// DATA FILES ("DATA FILES"), AND/OR SOFTWARE ("SOFTWARE"),
+// YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE
+// TERMS AND CONDITIONS OF THIS AGREEMENT.
+// IF YOU DO NOT AGREE, DO NOT DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE
+// THE DATA FILES OR SOFTWARE.
+//
+// COPYRIGHT AND PERMISSION NOTICE
+//
+// Copyright (c) 1991-2022 Unicode, Inc. All rights reserved.
+// Distributed under the Terms of Use in https://www.unicode.org/copyright.html.
+//
+// Permission is hereby granted, free of charge, to any person obtaining
+// a copy of the Unicode data files and any associated documentation
+// (the "Data Files") or Unicode software and any associated documentation
+// (the "Software") to deal in the Data Files or Software
+// without restriction, including without limitation the rights to use,
+// copy, modify, merge, publish, distribute, and/or sell copies of
+// the Data Files or Software, and to permit persons to whom the Data Files
+// or Software are furnished to do so, provided that either
+// (a) this copyright and permission notice appear with all copies
+// of the Data Files or Software, or
+// (b) this copyright and permission notice appear in associated
+// Documentation.
+//
+// THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF
+// ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
+// WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+// NONINFRINGEMENT OF THIRD PARTY RIGHTS.
+// IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS
+// NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL
+// DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
+// DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
+// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+// PERFORMANCE OF THE DATA FILES OR SOFTWARE.
+//
+// Except as contained in this notice, the name of a copyright holder
+// shall not be used in advertising or otherwise to promote the sale,
+// use or other dealings in these Data Files or Software without prior
+// written authorization of the copyright holder.
+
+#ifndef _LIBCPP___FORMAT_ESCAPED_OUTPUT_TABLE_H
+#define _LIBCPP___FORMAT_ESCAPED_OUTPUT_TABLE_H
+
+#include <__algorithm/ranges_upper_bound.h>
+#include <__config>
+#include <cstddef>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 20
+
+namespace __escaped_output_table {
+
+/// The entries of the characters to escape in format's debug string.
+///
+/// Contains the entries for [format.string.escaped]/2.2.1.2.1
+///   CE is a Unicode encoding and C corresponds to either a UCS scalar value
+///   whose Unicode property General_Category has a value in the groups
+///   Separator (Z) or Other (C) or to a UCS scalar value which has the Unicode
+///   property Grapheme_Extend=Yes, as described by table 12 of UAX #44
+///
+/// Separator (Z) consists of General_Category
+/// - Space_Separator,
+/// - Line_Separator,
+/// - Paragraph_Separator.
+///
+/// Other (C) consists of General_Category
+/// - Control,
+/// - Format,
+/// - Surrogate,
+/// - Private_Use,
+/// - Unassigned.
+///
+/// The data is generated from
+/// - https://www.unicode.org/Public/UCD/latest/ucd/DerivedCoreProperties.txt
+/// - https://www.unicode.org/Public/UCD/latest/ucd/extracted/DerivedGeneralCategory.txt
+///
+/// The table is similar to the table
+///  __extended_grapheme_custer_property_boundary::__entries
+/// which explains the details of these classes. The only difference is this
+/// table lacks a property, thus having more bits available for the size.
+///
+/// The data has 2 values:
+/// - bits [0, 10] The size of the range, allowing 2048 elements.
+/// - bits [11, 31] The lower bound code point of the range. The upper bound of
+///   the range is lower bound + size.
+inline constexpr uint32_t __entries[893] = {
+    0x00000020,
+    0x0003f821,
+    0x00056800,
+    0x0018006f,
+    0x001bc001,
+    0x001c0003,
+    0x001c5800,
+    0x001c6800,
+    0x001d1000,
+    0x00241806,
+    0x00298000,
+    0x002ab801,
+    0x002c5801,
+    0x002c802d,
+    0x002df800,
+    0x002e0801,
+    0x002e2001,
+    0x002e3808,
+    0x002f5803,
+    0x002fa810,
+    0x0030800a,
+    0x0030e000,
+    0x00325814,
+    0x00338000,
+    0x0036b007,
+    0x0036f805,
+    0x00373801,
+    0x00375003,
+    0x00387001,
+    0x00388800,
+    0x0039801c,
+    0x003d300a,
+    0x003d900d,
+    0x003f5808,
+    0x003fd802,
+    0x0040b003,
+    0x0040d808,
+    0x00412802,
+    0x00414806,
+    0x0041f800,
+    0x0042c804,
+    0x0042f800,
+    0x00435804,
+    0x00447810,
+    0x00465038,
+    0x0049d000,
+    0x0049e000,
+    0x004a0807,
+    0x004a6800,
+    0x004a8806,
+    0x004b1001,
+    0x004c0800,
+    0x004c2000,
+    0x004c6801,
+    0x004c8801,
+    0x004d4800,
+    0x004d8800,
+    0x004d9802,
+    0x004dd002,
+    0x004df000,
+    0x004e0805,
+    0x004e4801,
+    0x004e6800,
+    0x004e780c,
+    0x004ef000,
+    0x004f1003,
+    0x004ff004,
+    0x00502000,
+    0x00505803,
+    0x00508801,
+    0x00514800,
+    0x00518800,
+    0x0051a000,
+    0x0051b800,
+    0x0051d003,
+    0x00520817,
+    0x0052e800,
+    0x0052f806,
+    0x00538001,
+    0x0053a800,
+    0x0053b80b,
+    0x00542000,
+    0x00547000,
+    0x00549000,
+    0x00554800,
+    0x00558800,
+    0x0055a000,
+    0x0055d002,
+    0x00560807,
+    0x00565000,
+    0x00566802,
+    0x0056880e,
+    0x00571003,
+    0x00579006,
+    0x0057d007,
+    0x00582000,
+    0x00586801,
+    0x00588801,
+    0x00594800,
+    0x00598800,
+    0x0059a000,
+    0x0059d002,
+    0x0059f001,
+    0x005a0805,
+    0x005a4801,
+    0x005a680e,
+    0x005af000,
+    0x005b1003,
+    0x005bc00a,
+    0x005c2000,
+    0x005c5802,
+    0x005c8800,
+    0x005cb002,
+    0x005cd800,
+    0x005ce800,
+    0x005d0002,
+    0x005d2802,
+    0x005d5802,
+    0x005dd004,
+    0x005e0000,
+    0x005e1802,
+    0x005e4800,
+    0x005e6802,
+    0x005e8814,
+    0x005fd805,
+    0x00602000,
+    0x00606800,
+    0x00608800,
+    0x00614800,
+    0x0061d002,
+    0x0061f002,
+    0x00622812,
+    0x0062d801,
+    0x0062f001,
+    0x00631003,
+    0x00638006,
+    0x00640800,
+    0x00646800,
+    0x00648800,
+    0x00654800,
+    0x0065a000,
+    0x0065d002,
+    0x0065f800,
+    0x00661000,
+    0x00662801,
+    0x00664800,
+    0x00666010,
+    0x0066f800,
+    0x00671003,
+    0x00678000,
+    0x0067a00d,
+    0x00686800,
+    0x00688800,
+    0x0069d801,
+    0x0069f000,
+    0x006a0804,
+    0x006a4800,
+    0x006a6800,
+    0x006a8003,
+    0x006ab800,
+    0x006b1003,
+    0x006c0001,
+    0x006c2000,
+    0x006cb802,
+    0x006d9000,
+    0x006de000,
+    0x006df001,
+    0x006e3808,
+    0x006e9005,
+    0x006ef806,
+    0x006f8001,
+    0x006fa80b,
+    0x00718800,
+    0x0071a00a,
+    0x00723807,
+    0x0072e024,
+    0x00741800,
+    0x00742800,
+    0x00745800,
+    0x00752000,
+    0x00753000,
+    0x00758800,
+    0x0075a008,
+    0x0075f001,
+    0x00762800,
+    0x00763808,
+    0x0076d001,
+    0x0077001f,
+    0x0078c001,
+    0x0079a800,
+    0x0079b800,
+    0x0079c800,
+    0x007a4000,
+    0x007b6811,
+    0x007c0004,
+    0x007c3001,
+    0x007c6830,
+    0x007e3000,
+    0x007e6800,
+    0x007ed824,
+    0x00816803,
+    0x00819005,
+    0x0081c801,
+    0x0081e801,
+    0x0082c001,
+    0x0082f002,
+    0x00838803,
+    0x00841000,
+    0x00842801,
+    0x00846800,
+    0x0084e800,
+    0x00863000,
+    0x00864004,
+    0x00867001,
+    0x00924800,
+    0x00927001,
+    0x0092b800,
+    0x0092c800,
+    0x0092f001,
+    0x00944800,
+    0x00947001,
+    0x00958800,
+    0x0095b001,
+    0x0095f800,
+    0x00960800,
+    0x00963001,
+    0x0096b800,
+    0x00988800,
+    0x0098b001,
+    0x009ad804,
+    0x009be802,
+    0x009cd005,
+    0x009fb001,
+    0x009ff001,
+    0x00b40000,
+    0x00b4e802,
+    0x00b7c806,
+    0x00b89002,
+    0x00b8b008,
+    0x00b99001,
+    0x00b9b808,
+    0x00ba900d,
+    0x00bb6800,
+    0x00bb880e,
+    0x00bda001,
+    0x00bdb806,
+    0x00be3000,
+    0x00be480a,
+    0x00bee802,
+    0x00bf5005,
+    0x00bfd005,
+    0x00c05804,
+    0x00c0d005,
+    0x00c3c806,
+    0x00c42801,
+    0x00c54800,
+    0x00c55804,
+    0x00c7b009,
+    0x00c8f803,
+    0x00c93801,
+    0x00c96003,
+    0x00c99000,
+    0x00c9c806,
+    0x00ca0802,
+    0x00cb7001,
+    0x00cba80a,
+    0x00cd6003,
+    0x00ce5005,
+    0x00ced802,
+    0x00d0b801,
+    0x00d0d802,
+    0x00d2b000,
+    0x00d2c008,
+    0x00d31000,
+    0x00d32807,
+    0x00d3980c,
+    0x00d45005,
+    0x00d4d005,
+    0x00d57055,
+    0x00d9a006,
+    0x00d9e000,
+    0x00da1000,
+    0x00da6802,
+    0x00db5808,
+    0x00dbf802,
+    0x00dd1003,
+    0x00dd4001,
+    0x00dd5802,
+    0x00df3000,
+    0x00df4001,
+    0x00df6800,
+    0x00df7802,
+    0x00dfa007,
+    0x00e16007,
+    0x00e1b004,
+    0x00e25002,
+    0x00e44806,
+    0x00e5d801,
+    0x00e6400a,
+    0x00e6a00c,
+    0x00e71006,
+    0x00e76800,
+    0x00e7a000,
+    0x00e7c001,
+    0x00e7d804,
+    0x00ee003f,
+    0x00f8b001,
+    0x00f8f001,
+    0x00fa3001,
+    0x00fa7001,
+    0x00fac000,
+    0x00fad000,
+    0x00fae000,
+    0x00faf000,
+    0x00fbf001,
+    0x00fda800,
+    0x00fe2800,
+    0x00fea001,
+    0x00fee000,
+    0x00ff8001,
+    0x00ffa800,
+    0x00fff810,
+    0x01014007,
+    0x0102f810,
+    0x01039001,
+    0x01047800,
+    0x0104e802,
+    0x0106083e,
+    0x010c6003,
+    0x01213818,
+    0x01225814,
+    0x015ba001,
+    0x015cb000,
+    0x01677802,
+    0x0167a004,
+    0x01693000,
+    0x01694004,
+    0x01697001,
+    0x016b4006,
+    0x016b880e,
+    0x016cb808,
+    0x016d3800,
+    0x016d7800,
+    0x016db800,
+    0x016df800,
+    0x016e3800,
+    0x016e7800,
+    0x016eb800,
+    0x016ef820,
+    0x0172f021,
+    0x0174d000,
+    0x0177a00b,
+    0x017eb019,
+    0x017fe004,
+    0x01815005,
+    0x01820000,
+    0x0184b803,
+    0x01880004,
+    0x01898000,
+    0x018c7800,
+    0x018f200b,
+    0x0190f800,
+    0x05246802,
+    0x05263808,
+    0x05316013,
+    0x05337803,
+    0x0533a009,
+    0x0534f001,
+    0x05378001,
+    0x0537c007,
+    0x053e5804,
+    0x053e9000,
+    0x053ea000,
+    0x053ed017,
+    0x05401000,
+    0x05403000,
+    0x05405800,
+    0x05412801,
+    0x05416003,
+    0x0541d005,
+    0x0543c007,
+    0x05462009,
+    0x0546d017,
+    0x0547f800,
+    0x05493007,
+    0x054a380a,
+    0x054aa00a,
+    0x054be805,
+    0x054d9800,
+    0x054db003,
+    0x054de001,
+    0x054e7000,
+    0x054ed003,
+    0x054f2800,
+    0x054ff800,
+    0x05514805,
+    0x05518801,
+    0x0551a80a,
+    0x05521800,
+    0x05526000,
+    0x05527001,
+    0x0552d001,
+    0x0553e000,
+    0x05558000,
+    0x05559002,
+    0x0555b801,
+    0x0555f001,
+    0x05560800,
+    0x05561817,
+    0x05576001,
+    0x0557b00a,
+    0x05583801,
+    0x05587801,
+    0x0558b808,
+    0x05593800,
+    0x05597800,
+    0x055b6003,
+    0x055f2800,
+    0x055f4000,
+    0x055f6802,
+    0x055fd005,
+    0x06bd200b,
+    0x06be3803,
+    0x06bfe7ff,
+    0x06ffe7ff,
+    0x073fe7ff,
+    0x077fe7ff,
+    0x07bfe103,
+    0x07d37001,
+    0x07d6d025,
+    0x07d8380b,
+    0x07d8c004,
+    0x07d8f000,
+    0x07d9b800,
+    0x07d9e800,
+    0x07d9f800,
+    0x07da1000,
+    0x07da2800,
+    0x07de180f,
+    0x07ec8001,
+    0x07ee4006,
+    0x07ee801f,
+    0x07f0000f,
+    0x07f0d015,
+    0x07f29800,
+    0x07f33800,
+    0x07f36003,
+    0x07f3a800,
+    0x07f7e803,
+    0x07fcf001,
+    0x07fdf802,
+    0x07fe4001,
+    0x07fe8001,
+    0x07fec001,
+    0x07fee802,
+    0x07ff3800,
+    0x07ff780c,
+    0x07fff001,
+    0x08006000,
+    0x08013800,
+    0x0801d800,
+    0x0801f000,
+    0x08027001,
+    0x0802f021,
+    0x0807d804,
+    0x08081803,
+    0x0809a002,
+    0x080c7800,
+    0x080ce802,
+    0x080d082e,
+    0x080fe882,
+    0x0814e802,
+    0x0816880f,
+    0x0817e003,
+    0x08192008,
+    0x081a5804,
+    0x081bb009,
+    0x081cf000,
+    0x081e2003,
+    0x081eb029,
+    0x0824f001,
+    0x08255005,
+    0x0826a003,
+    0x0827e003,
+    0x08294007,
+    0x082b200a,
+    0x082bd800,
+    0x082c5800,
+    0x082c9800,
+    0x082cb000,
+    0x082d1000,
+    0x082d9000,
+    0x082dd000,
+    0x082de842,
+    0x0839b808,
+    0x083ab009,
+    0x083b4017,
+    0x083c3000,
+    0x083d8800,
+    0x083dd844,
+    0x08403001,
+    0x08404800,
+    0x0841b000,
+    0x0841c802,
+    0x0841e801,
+    0x0842b000,
+    0x0844f807,
+    0x0845802f,
+    0x08479800,
+    0x0847b004,
+    0x0848e002,
+    0x0849d004,
+    0x084a003f,
+    0x084dc003,
+    0x084e8001,
+    0x0850080e,
+    0x0850a000,
+    0x0850c000,
+    0x0851b009,
+    0x08524806,
+    0x0852c806,
+    0x0855001f,
+    0x08572805,
+    0x0857b808,
+    0x0859b002,
+    0x085ab001,
+    0x085b9804,
+    0x085c9006,
+    0x085ce80b,
+    0x085d804f,
+    0x08624836,
+    0x0865980c,
+    0x08679806,
+    0x0869200b,
+    0x0869d125,
+    0x0873f800,
+    0x08755002,
+    0x08757001,
+    0x0875904d,
+    0x08794007,
+    0x087a300a,
+    0x087ad015,
+    0x087c1003,
+    0x087c5025,
+    0x087e6013,
+    0x087fb808,
+    0x08800800,
+    0x0881c00e,
+    0x08827003,
+    0x08838000,
+    0x08839801,
+    0x0883b00b,
+    0x08859803,
+    0x0885c801,
+    0x0885e800,
+    0x0886100d,
+    0x08874806,
+    0x0887d008,
+    0x08893804,
+    0x08896808,
+    0x088a4007,
+    0x088b9800,
+    0x088bb80a,
+    0x088db008,
+    0x088e4803,
+    0x088e7800,
+    0x088f0000,
+    0x088fa80a,
+    0x08909000,
+    0x08917802,
+    0x0891a000,
+    0x0891b001,
+    0x0891f000,
+    0x0892083e,
+    0x08943800,
+    0x08944800,
+    0x08947000,
+    0x0894f000,
+    0x08955005,
+    0x0896f800,
+    0x0897180c,
+    0x0897d007,
+    0x08982000,
+    0x08986801,
+    0x08988801,
+    0x08994800,
+    0x08998800,
+    0x0899a000,
+    0x0899d002,
+    0x0899f000,
+    0x089a0000,
+    0x089a2801,
+    0x089a4801,
+    0x089a7001,
+    0x089a880b,
+    0x089b209b,
+    0x08a1c007,
+    0x08a21002,
+    0x08a23000,
+    0x08a2e000,
+    0x08a2f000,
+    0x08a3101d,
+    0x08a58000,
+    0x08a59805,
+    0x08a5d000,
+    0x08a5e800,
+    0x08a5f801,
+    0x08a61001,
+    0x08a64007,
+    0x08a6d0a5,
+    0x08ad7800,
+    0x08ad9005,
+    0x08ade001,
+    0x08adf801,
+    0x08aee023,
+    0x08b19807,
+    0x08b1e800,
+    0x08b1f801,
+    0x08b2280a,
+    0x08b2d005,
+    0x08b36812,
+    0x08b55800,
+    0x08b56800,
+    0x08b58005,
+    0x08b5b800,
+    0x08b5d005,
+    0x08b65035,
+    0x08b8d804,
+    0x08b91003,
+    0x08b93808,
+    0x08ba38b8,
+    0x08c17808,
+    0x08c1c801,
+    0x08c1e063,
+    0x08c7980b,
+    0x08c83801,
+    0x08c85001,
+    0x08c8a000,
+    0x08c8b800,
+    0x08c98000,
+    0x08c9b000,
+    0x08c9c803,
+    0x08c9f000,
+    0x08ca1800,
+    0x08ca3808,
+    0x08cad045,
+    0x08cd4001,
+    0x08cea007,
+    0x08cf0000,
+    0x08cf281a,
+    0x08d00809,
+    0x08d19805,
+    0x08d1d803,
+    0x08d23808,
+    0x08d28805,
+    0x08d2c802,
+    0x08d4500c,
+    0x08d4c001,
+    0x08d5180c,
+    0x08d7c806,
+    0x08d850f5,
+    0x08e04800,
+    0x08e1800d,
+    0x08e1f800,
+    0x08e23009,
+    0x08e36802,
+    0x08e48018,
+    0x08e55006,
+    0x08e59001,
+    0x08e5a84a,
+    0x08e83800,
+    0x08e85000,
+    0x08e98814,
+    0x08ea3808,
+    0x08ead005,
+    0x08eb3000,
+    0x08eb4800,
+    0x08ec7803,
+    0x08eca800,
+    0x08ecb800,
+    0x08ecc806,
+    0x08ed5135,
+    0x08f79801,
+    0x08f7c808,
+    0x08f88800,
+    0x08f9b007,
+    0x08fa0000,
+    0x08fa1000,
+    0x08fad055,
+    0x08fd880e,
+    0x08ff900c,
+    0x091cd065,
+    0x09237800,
+    0x0923a80a,
+    0x092a27ff,
+    0x096a224b,
+    0x097f980c,
+    0x09a18010,
+    0x09a23fff,
+    0x09e23fb8,
+    0x0a323fff,
+    0x0a723fff,
+    0x0ab23fff,
+    0x0af23fff,
+    0x0b3239b8,
+    0x0b51c806,
+    0x0b52f800,
+    0x0b535003,
+    0x0b55f800,
+    0x0b565005,
+    0x0b577006,
+    0x0b57b009,
+    0x0b598006,
+    0x0b5a3009,
+    0x0b5ad000,
+    0x0b5b1000,
+    0x0b5bc004,
+    0x0b5c82af,
+    0x0b74d864,
+    0x0b7a5804,
+    0x0b7c400a,
+    0x0b7d003f,
+    0x0b7f200b,
+    0x0b7f900d,
+    0x0c3fc007,
+    0x0c66b029,
+    0x0c684fff,
+    0x0ca84fff,
+    0x0ce84fff,
+    0x0d284fff,
+    0x0d684ae6,
+    0x0d7fa000,
+    0x0d7fe000,
+    0x0d7ff800,
+    0x0d89180e,
+    0x0d89981c,
+    0x0d8a9801,
+    0x0d8ab00d,
+    0x0d8b4007,
+    0x0d97e7ff,
+    0x0dd7e103,
+    0x0de35804,
+    0x0de3e802,
+    0x0de44806,
+    0x0de4d001,
+    0x0de4e801,
+    0x0de507ff,
+    0x0e2507ff,
+    0x0e6502af,
+    0x0e7e203b,
+    0x0e87b009,
+    0x0e893801,
+    0x0e8b2800,
+    0x0e8b3802,
+    0x0e8b7014,
+    0x0e8c2806,
+    0x0e8d5003,
+    0x0e8f5814,
+    0x0e921002,
+    0x0e923079,
+    0x0e96a00b,
+    0x0e97a00b,
+    0x0e9ab808,
+    0x0e9bc886,
+    0x0ea2a800,
+    0x0ea4e800,
+    0x0ea50001,
+    0x0ea51801,
+    0x0ea53801,
+    0x0ea56800,
+    0x0ea5d000,
+    0x0ea5e000,
+    0x0ea62000,
+    0x0ea83000,
+    0x0ea85801,
+    0x0ea8a800,
+    0x0ea8e800,
+    0x0ea9d000,
+    0x0ea9f800,
+    0x0eaa2800,
+    0x0eaa3802,
+    0x0eaa8800,
+    0x0eb53001,
+    0x0ebe6001,
+    0x0ed00036,
+    0x0ed1d831,
+    0x0ed3a800,
+    0x0ed42000,
+    0x0ed46473,
+    0x0ef8f805,
+    0x0ef95904,
+    0x0f037091,
+    0x0f096809,
+    0x0f09f001,
+    0x0f0a5003,
+    0x0f0a813f,
+    0x0f157011,
+    0x0f176003,
+    0x0f17d004,
+    0x0f1801cf,
+    0x0f276003,
+    0x0f27d2e5,
+    0x0f3f3800,
+    0x0f3f6000,
+    0x0f3f7800,
+    0x0f3ff800,
+    0x0f462801,
+    0x0f46802f,
+    0x0f4a2006,
+    0x0f4a6003,
+    0x0f4ad003,
+    0x0f4b0310,
+    0x0f65a84b,
+    0x0f69f0c1,
+    0x0f702000,
+    0x0f710000,
+    0x0f711800,
+    0x0f712801,
+    0x0f714000,
+    0x0f719800,
+    0x0f71c000,
+    0x0f71d000,
+    0x0f71e005,
+    0x0f721803,
+    0x0f724000,
+    0x0f725000,
+    0x0f726000,
+    0x0f728000,
+    0x0f729800,
+    0x0f72a801,
+    0x0f72c000,
+    0x0f72d000,
+    0x0f72e000,
+    0x0f72f000,
+    0x0f730000,
+    0x0f731800,
+    0x0f732801,
+    0x0f735800,
+    0x0f739800,
+    0x0f73c000,
+    0x0f73e800,
+    0x0f73f800,
+    0x0f745000,
+    0x0f74e004,
+    0x0f752000,
+    0x0f755000,
+    0x0f75e033,
+    0x0f77910d,
+    0x0f816003,
+    0x0f84a00b,
+    0x0f857801,
+    0x0f860000,
+    0x0f868000,
+    0x0f87b009,
+    0x0f8d7037,
+    0x0f90180c,
+    0x0f91e003,
+    0x0f924806,
+    0x0f92900d,
+    0x0f933099,
+    0x0fb6c003,
+    0x0fb76802,
+    0x0fb7e802,
+    0x0fbbb803,
+    0x0fbed005,
+    0x0fbf6003,
+    0x0fbf880e,
+    0x0fc06003,
+    0x0fc24007,
+    0x0fc2d005,
+    0x0fc44007,
+    0x0fc57001,
+    0x0fc5904d,
+    0x0fd2a00b,
+    0x0fd37001,
+    0x0fd3e802,
+    0x0fd44806,
+    0x0fd5f000,
+    0x0fd63007,
+    0x0fd6e003,
+    0x0fd74806,
+    0x0fd7c806,
+    0x0fdc9800,
+    0x0fde5824,
+    0x0fdfd405,
+    0x1537001f,
+    0x15b9d005,
+    0x15c0f001,
+    0x1675100d,
+    0x175f0fff,
+    0x179f0c1e,
+    0x17d0f5e1,
+    0x189a5804};
+
+/// At the end of the valid Unicode code points space a lot of code points are
+/// either reserved or a noncharacter. Adding all these entries to the
+/// lookup table would add 446 entries to the table (in Unicode 14).
+/// Instead the only the start of the region is stored, every code point in
+/// this region needs to be escaped.
+inline constexpr uint32_t __unallocated_region_lower_bound = 0x000323b0;
+
+/// Returns whether the code unit needs to be escaped.
+///
+/// \pre The code point is a valid Unicode code point.
+[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool __needs_escape(const char32_t __code_point) noexcept {
+  // Since __unallocated_region_lower_bound contains the unshifted range do the
+  // comparison without shifting.
+  if (__code_point >= __unallocated_region_lower_bound)
+    return true;
+
+  ptrdiff_t __i = std::ranges::upper_bound(__entries, (__code_point << 11) | 0x7ffu) - __entries;
+  if (__i == 0)
+    return false;
+
+  --__i;
+  uint32_t __upper_bound = (__entries[__i] >> 11) + (__entries[__i] & 0x7ffu);
+  return __code_point <= __upper_bound;
+}
+
+} // namespace __escaped_output_table
+
+#endif //_LIBCPP_STD_VER > 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_ESCAPED_OUTPUT_TABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__format/extended_grapheme_cluster_table.h b/app/src/main/cpp/libcxx/include/__format/extended_grapheme_cluster_table.h
new file mode 100644
index 0000000..1ffcfeb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/extended_grapheme_cluster_table.h
@@ -0,0 +1,1661 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// WARNING, this entire header is generated by
+// utils/generate_extended_grapheme_cluster_table.py
+// DO NOT MODIFY!
+
+// UNICODE, INC. LICENSE AGREEMENT - DATA FILES AND SOFTWARE
+//
+// See Terms of Use <https://www.unicode.org/copyright.html>
+// for definitions of Unicode Inc.'s Data Files and Software.
+//
+// NOTICE TO USER: Carefully read the following legal agreement.
+// BY DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING UNICODE INC.'S
+// DATA FILES ("DATA FILES"), AND/OR SOFTWARE ("SOFTWARE"),
+// YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE
+// TERMS AND CONDITIONS OF THIS AGREEMENT.
+// IF YOU DO NOT AGREE, DO NOT DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE
+// THE DATA FILES OR SOFTWARE.
+//
+// COPYRIGHT AND PERMISSION NOTICE
+//
+// Copyright (c) 1991-2022 Unicode, Inc. All rights reserved.
+// Distributed under the Terms of Use in https://www.unicode.org/copyright.html.
+//
+// Permission is hereby granted, free of charge, to any person obtaining
+// a copy of the Unicode data files and any associated documentation
+// (the "Data Files") or Unicode software and any associated documentation
+// (the "Software") to deal in the Data Files or Software
+// without restriction, including without limitation the rights to use,
+// copy, modify, merge, publish, distribute, and/or sell copies of
+// the Data Files or Software, and to permit persons to whom the Data Files
+// or Software are furnished to do so, provided that either
+// (a) this copyright and permission notice appear with all copies
+// of the Data Files or Software, or
+// (b) this copyright and permission notice appear in associated
+// Documentation.
+//
+// THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF
+// ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
+// WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+// NONINFRINGEMENT OF THIRD PARTY RIGHTS.
+// IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS
+// NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL
+// DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
+// DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
+// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+// PERFORMANCE OF THE DATA FILES OR SOFTWARE.
+//
+// Except as contained in this notice, the name of a copyright holder
+// shall not be used in advertising or otherwise to promote the sale,
+// use or other dealings in these Data Files or Software without prior
+// written authorization of the copyright holder.
+
+#ifndef _LIBCPP___FORMAT_EXTENDED_GRAPHEME_CLUSTER_TABLE_H
+#define _LIBCPP___FORMAT_EXTENDED_GRAPHEME_CLUSTER_TABLE_H
+
+#include <__algorithm/ranges_upper_bound.h>
+#include <__config>
+#include <__iterator/access.h>
+#include <cstddef>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace __extended_grapheme_custer_property_boundary {
+
+enum class __property : uint8_t {
+  // Values generated from the data files.
+  __CR,
+  __Control,
+  __Extend,
+  __Extended_Pictographic,
+  __L,
+  __LF,
+  __LV,
+  __LVT,
+  __Prepend,
+  __Regional_Indicator,
+  __SpacingMark,
+  __T,
+  __V,
+  __ZWJ,
+
+  // The properies below aren't stored in the "database".
+
+  // Text position properties.
+  __sot,
+  __eot,
+
+  // The code unit has none of above properties.
+  __none
+};
+
+/// The entries of the extended grapheme cluster bondary property table.
+///
+/// The data is generated from
+/// - https://www.unicode.org/Public/UCD/latest/ucd/auxiliary/GraphemeBreakProperty.txt
+/// - https://www.unicode.org/Public/UCD/latest/ucd/emoji/emoji-data.txt
+///
+/// The data has 3 values
+/// - bits [0, 3] The property. One of the values generated from the datafiles
+///   of \ref __property
+/// - bits [4, 10] The size of the range.
+/// - bits [11, 31] The lower bound code point of the range. The upper bound of
+///   the range is lower bound + size.
+///
+/// The 7 bits for the size allow a maximum range of 128 elements. Some ranges
+/// in the Unicode tables are larger. They are stored in multiple consecutive
+/// ranges in the data table. An alternative would be to store the sizes in a
+/// separate 16-bit value. The original MSVC STL code had such an approach, but
+/// this approach uses less space for the data and is about 4% faster in the
+/// following benchmark.
+/// libcxx/benchmarks/std_format_spec_string_unicode.bench.cpp
+inline constexpr uint32_t __entries[1496] = {
+    0x00000091,
+    0x00005005,
+    0x00005811,
+    0x00006800,
+    0x00007111,
+    0x0003fa01,
+    0x00054803,
+    0x00056801,
+    0x00057003,
+    0x001806f2,
+    0x00241862,
+    0x002c8ac2,
+    0x002df802,
+    0x002e0812,
+    0x002e2012,
+    0x002e3802,
+    0x00300058,
+    0x003080a2,
+    0x0030e001,
+    0x00325942,
+    0x00338002,
+    0x0036b062,
+    0x0036e808,
+    0x0036f852,
+    0x00373812,
+    0x00375032,
+    0x00387808,
+    0x00388802,
+    0x003981a2,
+    0x003d30a2,
+    0x003f5882,
+    0x003fe802,
+    0x0040b032,
+    0x0040d882,
+    0x00412822,
+    0x00414842,
+    0x0042c822,
+    0x00448018,
+    0x0044c072,
+    0x00465172,
+    0x00471008,
+    0x004719f2,
+    0x0048180a,
+    0x0049d002,
+    0x0049d80a,
+    0x0049e002,
+    0x0049f02a,
+    0x004a0872,
+    0x004a483a,
+    0x004a6802,
+    0x004a701a,
+    0x004a8862,
+    0x004b1012,
+    0x004c0802,
+    0x004c101a,
+    0x004de002,
+    0x004df002,
+    0x004df81a,
+    0x004e0832,
+    0x004e381a,
+    0x004e581a,
+    0x004e6802,
+    0x004eb802,
+    0x004f1012,
+    0x004ff002,
+    0x00500812,
+    0x0050180a,
+    0x0051e002,
+    0x0051f02a,
+    0x00520812,
+    0x00523812,
+    0x00525822,
+    0x00528802,
+    0x00538012,
+    0x0053a802,
+    0x00540812,
+    0x0054180a,
+    0x0055e002,
+    0x0055f02a,
+    0x00560842,
+    0x00563812,
+    0x0056480a,
+    0x0056581a,
+    0x00566802,
+    0x00571012,
+    0x0057d052,
+    0x00580802,
+    0x0058101a,
+    0x0059e002,
+    0x0059f012,
+    0x005a000a,
+    0x005a0832,
+    0x005a381a,
+    0x005a581a,
+    0x005a6802,
+    0x005aa822,
+    0x005b1012,
+    0x005c1002,
+    0x005df002,
+    0x005df80a,
+    0x005e0002,
+    0x005e081a,
+    0x005e302a,
+    0x005e502a,
+    0x005e6802,
+    0x005eb802,
+    0x00600002,
+    0x0060082a,
+    0x00602002,
+    0x0061e002,
+    0x0061f022,
+    0x0062083a,
+    0x00623022,
+    0x00625032,
+    0x0062a812,
+    0x00631012,
+    0x00640802,
+    0x0064101a,
+    0x0065e002,
+    0x0065f00a,
+    0x0065f802,
+    0x0066001a,
+    0x00661002,
+    0x0066181a,
+    0x00663002,
+    0x0066381a,
+    0x0066501a,
+    0x00666012,
+    0x0066a812,
+    0x00671012,
+    0x0067980a,
+    0x00680012,
+    0x0068101a,
+    0x0069d812,
+    0x0069f002,
+    0x0069f81a,
+    0x006a0832,
+    0x006a302a,
+    0x006a502a,
+    0x006a6802,
+    0x006a7008,
+    0x006ab802,
+    0x006b1012,
+    0x006c0802,
+    0x006c101a,
+    0x006e5002,
+    0x006e7802,
+    0x006e801a,
+    0x006e9022,
+    0x006eb002,
+    0x006ec06a,
+    0x006ef802,
+    0x006f901a,
+    0x00718802,
+    0x0071980a,
+    0x0071a062,
+    0x00723872,
+    0x00758802,
+    0x0075980a,
+    0x0075a082,
+    0x00764062,
+    0x0078c012,
+    0x0079a802,
+    0x0079b802,
+    0x0079c802,
+    0x0079f01a,
+    0x007b88d2,
+    0x007bf80a,
+    0x007c0042,
+    0x007c3012,
+    0x007c68a2,
+    0x007cca32,
+    0x007e3002,
+    0x00816832,
+    0x0081880a,
+    0x00819052,
+    0x0081c812,
+    0x0081d81a,
+    0x0081e812,
+    0x0082b01a,
+    0x0082c012,
+    0x0082f022,
+    0x00838832,
+    0x00841002,
+    0x0084200a,
+    0x00842812,
+    0x00846802,
+    0x0084e802,
+    0x008805f4,
+    0x008b047c,
+    0x008d457b,
+    0x009ae822,
+    0x00b89022,
+    0x00b8a80a,
+    0x00b99012,
+    0x00b9a00a,
+    0x00ba9012,
+    0x00bb9012,
+    0x00bda012,
+    0x00bdb00a,
+    0x00bdb862,
+    0x00bdf07a,
+    0x00be3002,
+    0x00be381a,
+    0x00be48a2,
+    0x00bee802,
+    0x00c05822,
+    0x00c07001,
+    0x00c07802,
+    0x00c42812,
+    0x00c54802,
+    0x00c90022,
+    0x00c9183a,
+    0x00c93812,
+    0x00c9482a,
+    0x00c9801a,
+    0x00c99002,
+    0x00c9985a,
+    0x00c9c822,
+    0x00d0b812,
+    0x00d0c81a,
+    0x00d0d802,
+    0x00d2a80a,
+    0x00d2b002,
+    0x00d2b80a,
+    0x00d2c062,
+    0x00d30002,
+    0x00d31002,
+    0x00d32872,
+    0x00d3685a,
+    0x00d39892,
+    0x00d3f802,
+    0x00d581e2,
+    0x00d80032,
+    0x00d8200a,
+    0x00d9a062,
+    0x00d9d80a,
+    0x00d9e002,
+    0x00d9e84a,
+    0x00da1002,
+    0x00da181a,
+    0x00db5882,
+    0x00dc0012,
+    0x00dc100a,
+    0x00dd080a,
+    0x00dd1032,
+    0x00dd301a,
+    0x00dd4012,
+    0x00dd500a,
+    0x00dd5822,
+    0x00df3002,
+    0x00df380a,
+    0x00df4012,
+    0x00df502a,
+    0x00df6802,
+    0x00df700a,
+    0x00df7822,
+    0x00df901a,
+    0x00e1207a,
+    0x00e16072,
+    0x00e1a01a,
+    0x00e1b012,
+    0x00e68022,
+    0x00e6a0c2,
+    0x00e7080a,
+    0x00e71062,
+    0x00e76802,
+    0x00e7a002,
+    0x00e7b80a,
+    0x00e7c012,
+    0x00ee03f2,
+    0x01005801,
+    0x01006002,
+    0x0100680d,
+    0x01007011,
+    0x01014061,
+    0x0101e003,
+    0x01024803,
+    0x010300f1,
+    0x01068202,
+    0x01091003,
+    0x0109c803,
+    0x010ca053,
+    0x010d4813,
+    0x0118d013,
+    0x01194003,
+    0x011c4003,
+    0x011e7803,
+    0x011f48a3,
+    0x011fc023,
+    0x01261003,
+    0x012d5013,
+    0x012db003,
+    0x012e0003,
+    0x012fd833,
+    0x01300053,
+    0x013038b3,
+    0x0130a713,
+    0x01348753,
+    0x013840a3,
+    0x0138a003,
+    0x0138b003,
+    0x0138e803,
+    0x01390803,
+    0x01394003,
+    0x01399813,
+    0x013a2003,
+    0x013a3803,
+    0x013a6003,
+    0x013a7003,
+    0x013a9823,
+    0x013ab803,
+    0x013b1843,
+    0x013ca823,
+    0x013d0803,
+    0x013d8003,
+    0x013df803,
+    0x0149a013,
+    0x01582823,
+    0x0158d813,
+    0x015a8003,
+    0x015aa803,
+    0x01677822,
+    0x016bf802,
+    0x016f01f2,
+    0x01815052,
+    0x01818003,
+    0x0181e803,
+    0x0184c812,
+    0x0194b803,
+    0x0194c803,
+    0x05337832,
+    0x0533a092,
+    0x0534f012,
+    0x05378012,
+    0x05401002,
+    0x05403002,
+    0x05405802,
+    0x0541181a,
+    0x05412812,
+    0x0541380a,
+    0x05416002,
+    0x0544001a,
+    0x0545a0fa,
+    0x05462012,
+    0x05470112,
+    0x0547f802,
+    0x05493072,
+    0x054a38a2,
+    0x054a901a,
+    0x054b01c4,
+    0x054c0022,
+    0x054c180a,
+    0x054d9802,
+    0x054da01a,
+    0x054db032,
+    0x054dd01a,
+    0x054de012,
+    0x054df02a,
+    0x054f2802,
+    0x05514852,
+    0x0551781a,
+    0x05518812,
+    0x0551981a,
+    0x0551a812,
+    0x05521802,
+    0x05526002,
+    0x0552680a,
+    0x0553e002,
+    0x05558002,
+    0x05559022,
+    0x0555b812,
+    0x0555f012,
+    0x05560802,
+    0x0557580a,
+    0x05576012,
+    0x0557701a,
+    0x0557a80a,
+    0x0557b002,
+    0x055f181a,
+    0x055f2802,
+    0x055f301a,
+    0x055f4002,
+    0x055f481a,
+    0x055f600a,
+    0x055f6802,
+    0x05600006,
+    0x056009a7,
+    0x0560e006,
+    0x0560e9a7,
+    0x0561c006,
+    0x0561c9a7,
+    0x0562a006,
+    0x0562a9a7,
+    0x05638006,
+    0x056389a7,
+    0x05646006,
+    0x056469a7,
+    0x05654006,
+    0x056549a7,
+    0x05662006,
+    0x056629a7,
+    0x05670006,
+    0x056709a7,
+    0x0567e006,
+    0x0567e9a7,
+    0x0568c006,
+    0x0568c9a7,
+    0x0569a006,
+    0x0569a9a7,
+    0x056a8006,
+    0x056a89a7,
+    0x056b6006,
+    0x056b69a7,
+    0x056c4006,
+    0x056c49a7,
+    0x056d2006,
+    0x056d29a7,
+    0x056e0006,
+    0x056e09a7,
+    0x056ee006,
+    0x056ee9a7,
+    0x056fc006,
+    0x056fc9a7,
+    0x0570a006,
+    0x0570a9a7,
+    0x05718006,
+    0x057189a7,
+    0x05726006,
+    0x057269a7,
+    0x05734006,
+    0x057349a7,
+    0x05742006,
+    0x057429a7,
+    0x05750006,
+    0x057509a7,
+    0x0575e006,
+    0x0575e9a7,
+    0x0576c006,
+    0x0576c9a7,
+    0x0577a006,
+    0x0577a9a7,
+    0x05788006,
+    0x057889a7,
+    0x05796006,
+    0x057969a7,
+    0x057a4006,
+    0x057a49a7,
+    0x057b2006,
+    0x057b29a7,
+    0x057c0006,
+    0x057c09a7,
+    0x057ce006,
+    0x057ce9a7,
+    0x057dc006,
+    0x057dc9a7,
+    0x057ea006,
+    0x057ea9a7,
+    0x057f8006,
+    0x057f89a7,
+    0x05806006,
+    0x058069a7,
+    0x05814006,
+    0x058149a7,
+    0x05822006,
+    0x058229a7,
+    0x05830006,
+    0x058309a7,
+    0x0583e006,
+    0x0583e9a7,
+    0x0584c006,
+    0x0584c9a7,
+    0x0585a006,
+    0x0585a9a7,
+    0x05868006,
+    0x058689a7,
+    0x05876006,
+    0x058769a7,
+    0x05884006,
+    0x058849a7,
+    0x05892006,
+    0x058929a7,
+    0x058a0006,
+    0x058a09a7,
+    0x058ae006,
+    0x058ae9a7,
+    0x058bc006,
+    0x058bc9a7,
+    0x058ca006,
+    0x058ca9a7,
+    0x058d8006,
+    0x058d89a7,
+    0x058e6006,
+    0x058e69a7,
+    0x058f4006,
+    0x058f49a7,
+    0x05902006,
+    0x059029a7,
+    0x05910006,
+    0x059109a7,
+    0x0591e006,
+    0x0591e9a7,
+    0x0592c006,
+    0x0592c9a7,
+    0x0593a006,
+    0x0593a9a7,
+    0x05948006,
+    0x059489a7,
+    0x05956006,
+    0x059569a7,
+    0x05964006,
+    0x059649a7,
+    0x05972006,
+    0x059729a7,
+    0x05980006,
+    0x059809a7,
+    0x0598e006,
+    0x0598e9a7,
+    0x0599c006,
+    0x0599c9a7,
+    0x059aa006,
+    0x059aa9a7,
+    0x059b8006,
+    0x059b89a7,
+    0x059c6006,
+    0x059c69a7,
+    0x059d4006,
+    0x059d49a7,
+    0x059e2006,
+    0x059e29a7,
+    0x059f0006,
+    0x059f09a7,
+    0x059fe006,
+    0x059fe9a7,
+    0x05a0c006,
+    0x05a0c9a7,
+    0x05a1a006,
+    0x05a1a9a7,
+    0x05a28006,
+    0x05a289a7,
+    0x05a36006,
+    0x05a369a7,
+    0x05a44006,
+    0x05a449a7,
+    0x05a52006,
+    0x05a529a7,
+    0x05a60006,
+    0x05a609a7,
+    0x05a6e006,
+    0x05a6e9a7,
+    0x05a7c006,
+    0x05a7c9a7,
+    0x05a8a006,
+    0x05a8a9a7,
+    0x05a98006,
+    0x05a989a7,
+    0x05aa6006,
+    0x05aa69a7,
+    0x05ab4006,
+    0x05ab49a7,
+    0x05ac2006,
+    0x05ac29a7,
+    0x05ad0006,
+    0x05ad09a7,
+    0x05ade006,
+    0x05ade9a7,
+    0x05aec006,
+    0x05aec9a7,
+    0x05afa006,
+    0x05afa9a7,
+    0x05b08006,
+    0x05b089a7,
+    0x05b16006,
+    0x05b169a7,
+    0x05b24006,
+    0x05b249a7,
+    0x05b32006,
+    0x05b329a7,
+    0x05b40006,
+    0x05b409a7,
+    0x05b4e006,
+    0x05b4e9a7,
+    0x05b5c006,
+    0x05b5c9a7,
+    0x05b6a006,
+    0x05b6a9a7,
+    0x05b78006,
+    0x05b789a7,
+    0x05b86006,
+    0x05b869a7,
+    0x05b94006,
+    0x05b949a7,
+    0x05ba2006,
+    0x05ba29a7,
+    0x05bb0006,
+    0x05bb09a7,
+    0x05bbe006,
+    0x05bbe9a7,
+    0x05bcc006,
+    0x05bcc9a7,
+    0x05bda006,
+    0x05bda9a7,
+    0x05be8006,
+    0x05be89a7,
+    0x05bf6006,
+    0x05bf69a7,
+    0x05c04006,
+    0x05c049a7,
+    0x05c12006,
+    0x05c129a7,
+    0x05c20006,
+    0x05c209a7,
+    0x05c2e006,
+    0x05c2e9a7,
+    0x05c3c006,
+    0x05c3c9a7,
+    0x05c4a006,
+    0x05c4a9a7,
+    0x05c58006,
+    0x05c589a7,
+    0x05c66006,
+    0x05c669a7,
+    0x05c74006,
+    0x05c749a7,
+    0x05c82006,
+    0x05c829a7,
+    0x05c90006,
+    0x05c909a7,
+    0x05c9e006,
+    0x05c9e9a7,
+    0x05cac006,
+    0x05cac9a7,
+    0x05cba006,
+    0x05cba9a7,
+    0x05cc8006,
+    0x05cc89a7,
+    0x05cd6006,
+    0x05cd69a7,
+    0x05ce4006,
+    0x05ce49a7,
+    0x05cf2006,
+    0x05cf29a7,
+    0x05d00006,
+    0x05d009a7,
+    0x05d0e006,
+    0x05d0e9a7,
+    0x05d1c006,
+    0x05d1c9a7,
+    0x05d2a006,
+    0x05d2a9a7,
+    0x05d38006,
+    0x05d389a7,
+    0x05d46006,
+    0x05d469a7,
+    0x05d54006,
+    0x05d549a7,
+    0x05d62006,
+    0x05d629a7,
+    0x05d70006,
+    0x05d709a7,
+    0x05d7e006,
+    0x05d7e9a7,
+    0x05d8c006,
+    0x05d8c9a7,
+    0x05d9a006,
+    0x05d9a9a7,
+    0x05da8006,
+    0x05da89a7,
+    0x05db6006,
+    0x05db69a7,
+    0x05dc4006,
+    0x05dc49a7,
+    0x05dd2006,
+    0x05dd29a7,
+    0x05de0006,
+    0x05de09a7,
+    0x05dee006,
+    0x05dee9a7,
+    0x05dfc006,
+    0x05dfc9a7,
+    0x05e0a006,
+    0x05e0a9a7,
+    0x05e18006,
+    0x05e189a7,
+    0x05e26006,
+    0x05e269a7,
+    0x05e34006,
+    0x05e349a7,
+    0x05e42006,
+    0x05e429a7,
+    0x05e50006,
+    0x05e509a7,
+    0x05e5e006,
+    0x05e5e9a7,
+    0x05e6c006,
+    0x05e6c9a7,
+    0x05e7a006,
+    0x05e7a9a7,
+    0x05e88006,
+    0x05e889a7,
+    0x05e96006,
+    0x05e969a7,
+    0x05ea4006,
+    0x05ea49a7,
+    0x05eb2006,
+    0x05eb29a7,
+    0x05ec0006,
+    0x05ec09a7,
+    0x05ece006,
+    0x05ece9a7,
+    0x05edc006,
+    0x05edc9a7,
+    0x05eea006,
+    0x05eea9a7,
+    0x05ef8006,
+    0x05ef89a7,
+    0x05f06006,
+    0x05f069a7,
+    0x05f14006,
+    0x05f149a7,
+    0x05f22006,
+    0x05f229a7,
+    0x05f30006,
+    0x05f309a7,
+    0x05f3e006,
+    0x05f3e9a7,
+    0x05f4c006,
+    0x05f4c9a7,
+    0x05f5a006,
+    0x05f5a9a7,
+    0x05f68006,
+    0x05f689a7,
+    0x05f76006,
+    0x05f769a7,
+    0x05f84006,
+    0x05f849a7,
+    0x05f92006,
+    0x05f929a7,
+    0x05fa0006,
+    0x05fa09a7,
+    0x05fae006,
+    0x05fae9a7,
+    0x05fbc006,
+    0x05fbc9a7,
+    0x05fca006,
+    0x05fca9a7,
+    0x05fd8006,
+    0x05fd89a7,
+    0x05fe6006,
+    0x05fe69a7,
+    0x05ff4006,
+    0x05ff49a7,
+    0x06002006,
+    0x060029a7,
+    0x06010006,
+    0x060109a7,
+    0x0601e006,
+    0x0601e9a7,
+    0x0602c006,
+    0x0602c9a7,
+    0x0603a006,
+    0x0603a9a7,
+    0x06048006,
+    0x060489a7,
+    0x06056006,
+    0x060569a7,
+    0x06064006,
+    0x060649a7,
+    0x06072006,
+    0x060729a7,
+    0x06080006,
+    0x060809a7,
+    0x0608e006,
+    0x0608e9a7,
+    0x0609c006,
+    0x0609c9a7,
+    0x060aa006,
+    0x060aa9a7,
+    0x060b8006,
+    0x060b89a7,
+    0x060c6006,
+    0x060c69a7,
+    0x060d4006,
+    0x060d49a7,
+    0x060e2006,
+    0x060e29a7,
+    0x060f0006,
+    0x060f09a7,
+    0x060fe006,
+    0x060fe9a7,
+    0x0610c006,
+    0x0610c9a7,
+    0x0611a006,
+    0x0611a9a7,
+    0x06128006,
+    0x061289a7,
+    0x06136006,
+    0x061369a7,
+    0x06144006,
+    0x061449a7,
+    0x06152006,
+    0x061529a7,
+    0x06160006,
+    0x061609a7,
+    0x0616e006,
+    0x0616e9a7,
+    0x0617c006,
+    0x0617c9a7,
+    0x0618a006,
+    0x0618a9a7,
+    0x06198006,
+    0x061989a7,
+    0x061a6006,
+    0x061a69a7,
+    0x061b4006,
+    0x061b49a7,
+    0x061c2006,
+    0x061c29a7,
+    0x061d0006,
+    0x061d09a7,
+    0x061de006,
+    0x061de9a7,
+    0x061ec006,
+    0x061ec9a7,
+    0x061fa006,
+    0x061fa9a7,
+    0x06208006,
+    0x062089a7,
+    0x06216006,
+    0x062169a7,
+    0x06224006,
+    0x062249a7,
+    0x06232006,
+    0x062329a7,
+    0x06240006,
+    0x062409a7,
+    0x0624e006,
+    0x0624e9a7,
+    0x0625c006,
+    0x0625c9a7,
+    0x0626a006,
+    0x0626a9a7,
+    0x06278006,
+    0x062789a7,
+    0x06286006,
+    0x062869a7,
+    0x06294006,
+    0x062949a7,
+    0x062a2006,
+    0x062a29a7,
+    0x062b0006,
+    0x062b09a7,
+    0x062be006,
+    0x062be9a7,
+    0x062cc006,
+    0x062cc9a7,
+    0x062da006,
+    0x062da9a7,
+    0x062e8006,
+    0x062e89a7,
+    0x062f6006,
+    0x062f69a7,
+    0x06304006,
+    0x063049a7,
+    0x06312006,
+    0x063129a7,
+    0x06320006,
+    0x063209a7,
+    0x0632e006,
+    0x0632e9a7,
+    0x0633c006,
+    0x0633c9a7,
+    0x0634a006,
+    0x0634a9a7,
+    0x06358006,
+    0x063589a7,
+    0x06366006,
+    0x063669a7,
+    0x06374006,
+    0x063749a7,
+    0x06382006,
+    0x063829a7,
+    0x06390006,
+    0x063909a7,
+    0x0639e006,
+    0x0639e9a7,
+    0x063ac006,
+    0x063ac9a7,
+    0x063ba006,
+    0x063ba9a7,
+    0x063c8006,
+    0x063c89a7,
+    0x063d6006,
+    0x063d69a7,
+    0x063e4006,
+    0x063e49a7,
+    0x063f2006,
+    0x063f29a7,
+    0x06400006,
+    0x064009a7,
+    0x0640e006,
+    0x0640e9a7,
+    0x0641c006,
+    0x0641c9a7,
+    0x0642a006,
+    0x0642a9a7,
+    0x06438006,
+    0x064389a7,
+    0x06446006,
+    0x064469a7,
+    0x06454006,
+    0x064549a7,
+    0x06462006,
+    0x064629a7,
+    0x06470006,
+    0x064709a7,
+    0x0647e006,
+    0x0647e9a7,
+    0x0648c006,
+    0x0648c9a7,
+    0x0649a006,
+    0x0649a9a7,
+    0x064a8006,
+    0x064a89a7,
+    0x064b6006,
+    0x064b69a7,
+    0x064c4006,
+    0x064c49a7,
+    0x064d2006,
+    0x064d29a7,
+    0x064e0006,
+    0x064e09a7,
+    0x064ee006,
+    0x064ee9a7,
+    0x064fc006,
+    0x064fc9a7,
+    0x0650a006,
+    0x0650a9a7,
+    0x06518006,
+    0x065189a7,
+    0x06526006,
+    0x065269a7,
+    0x06534006,
+    0x065349a7,
+    0x06542006,
+    0x065429a7,
+    0x06550006,
+    0x065509a7,
+    0x0655e006,
+    0x0655e9a7,
+    0x0656c006,
+    0x0656c9a7,
+    0x0657a006,
+    0x0657a9a7,
+    0x06588006,
+    0x065889a7,
+    0x06596006,
+    0x065969a7,
+    0x065a4006,
+    0x065a49a7,
+    0x065b2006,
+    0x065b29a7,
+    0x065c0006,
+    0x065c09a7,
+    0x065ce006,
+    0x065ce9a7,
+    0x065dc006,
+    0x065dc9a7,
+    0x065ea006,
+    0x065ea9a7,
+    0x065f8006,
+    0x065f89a7,
+    0x06606006,
+    0x066069a7,
+    0x06614006,
+    0x066149a7,
+    0x06622006,
+    0x066229a7,
+    0x06630006,
+    0x066309a7,
+    0x0663e006,
+    0x0663e9a7,
+    0x0664c006,
+    0x0664c9a7,
+    0x0665a006,
+    0x0665a9a7,
+    0x06668006,
+    0x066689a7,
+    0x06676006,
+    0x066769a7,
+    0x06684006,
+    0x066849a7,
+    0x06692006,
+    0x066929a7,
+    0x066a0006,
+    0x066a09a7,
+    0x066ae006,
+    0x066ae9a7,
+    0x066bc006,
+    0x066bc9a7,
+    0x066ca006,
+    0x066ca9a7,
+    0x066d8006,
+    0x066d89a7,
+    0x066e6006,
+    0x066e69a7,
+    0x066f4006,
+    0x066f49a7,
+    0x06702006,
+    0x067029a7,
+    0x06710006,
+    0x067109a7,
+    0x0671e006,
+    0x0671e9a7,
+    0x0672c006,
+    0x0672c9a7,
+    0x0673a006,
+    0x0673a9a7,
+    0x06748006,
+    0x067489a7,
+    0x06756006,
+    0x067569a7,
+    0x06764006,
+    0x067649a7,
+    0x06772006,
+    0x067729a7,
+    0x06780006,
+    0x067809a7,
+    0x0678e006,
+    0x0678e9a7,
+    0x0679c006,
+    0x0679c9a7,
+    0x067aa006,
+    0x067aa9a7,
+    0x067b8006,
+    0x067b89a7,
+    0x067c6006,
+    0x067c69a7,
+    0x067d4006,
+    0x067d49a7,
+    0x067e2006,
+    0x067e29a7,
+    0x067f0006,
+    0x067f09a7,
+    0x067fe006,
+    0x067fe9a7,
+    0x0680c006,
+    0x0680c9a7,
+    0x0681a006,
+    0x0681a9a7,
+    0x06828006,
+    0x068289a7,
+    0x06836006,
+    0x068369a7,
+    0x06844006,
+    0x068449a7,
+    0x06852006,
+    0x068529a7,
+    0x06860006,
+    0x068609a7,
+    0x0686e006,
+    0x0686e9a7,
+    0x0687c006,
+    0x0687c9a7,
+    0x0688a006,
+    0x0688a9a7,
+    0x06898006,
+    0x068989a7,
+    0x068a6006,
+    0x068a69a7,
+    0x068b4006,
+    0x068b49a7,
+    0x068c2006,
+    0x068c29a7,
+    0x068d0006,
+    0x068d09a7,
+    0x068de006,
+    0x068de9a7,
+    0x068ec006,
+    0x068ec9a7,
+    0x068fa006,
+    0x068fa9a7,
+    0x06908006,
+    0x069089a7,
+    0x06916006,
+    0x069169a7,
+    0x06924006,
+    0x069249a7,
+    0x06932006,
+    0x069329a7,
+    0x06940006,
+    0x069409a7,
+    0x0694e006,
+    0x0694e9a7,
+    0x0695c006,
+    0x0695c9a7,
+    0x0696a006,
+    0x0696a9a7,
+    0x06978006,
+    0x069789a7,
+    0x06986006,
+    0x069869a7,
+    0x06994006,
+    0x069949a7,
+    0x069a2006,
+    0x069a29a7,
+    0x069b0006,
+    0x069b09a7,
+    0x069be006,
+    0x069be9a7,
+    0x069cc006,
+    0x069cc9a7,
+    0x069da006,
+    0x069da9a7,
+    0x069e8006,
+    0x069e89a7,
+    0x069f6006,
+    0x069f69a7,
+    0x06a04006,
+    0x06a049a7,
+    0x06a12006,
+    0x06a129a7,
+    0x06a20006,
+    0x06a209a7,
+    0x06a2e006,
+    0x06a2e9a7,
+    0x06a3c006,
+    0x06a3c9a7,
+    0x06a4a006,
+    0x06a4a9a7,
+    0x06a58006,
+    0x06a589a7,
+    0x06a66006,
+    0x06a669a7,
+    0x06a74006,
+    0x06a749a7,
+    0x06a82006,
+    0x06a829a7,
+    0x06a90006,
+    0x06a909a7,
+    0x06a9e006,
+    0x06a9e9a7,
+    0x06aac006,
+    0x06aac9a7,
+    0x06aba006,
+    0x06aba9a7,
+    0x06ac8006,
+    0x06ac89a7,
+    0x06ad6006,
+    0x06ad69a7,
+    0x06ae4006,
+    0x06ae49a7,
+    0x06af2006,
+    0x06af29a7,
+    0x06b00006,
+    0x06b009a7,
+    0x06b0e006,
+    0x06b0e9a7,
+    0x06b1c006,
+    0x06b1c9a7,
+    0x06b2a006,
+    0x06b2a9a7,
+    0x06b38006,
+    0x06b389a7,
+    0x06b46006,
+    0x06b469a7,
+    0x06b54006,
+    0x06b549a7,
+    0x06b62006,
+    0x06b629a7,
+    0x06b70006,
+    0x06b709a7,
+    0x06b7e006,
+    0x06b7e9a7,
+    0x06b8c006,
+    0x06b8c9a7,
+    0x06b9a006,
+    0x06b9a9a7,
+    0x06ba8006,
+    0x06ba89a7,
+    0x06bb6006,
+    0x06bb69a7,
+    0x06bc4006,
+    0x06bc49a7,
+    0x06bd816c,
+    0x06be5b0b,
+    0x07d8f002,
+    0x07f000f2,
+    0x07f100f2,
+    0x07f7f801,
+    0x07fcf012,
+    0x07ff80b1,
+    0x080fe802,
+    0x08170002,
+    0x081bb042,
+    0x08500822,
+    0x08502812,
+    0x08506032,
+    0x0851c022,
+    0x0851f802,
+    0x08572812,
+    0x08692032,
+    0x08755812,
+    0x0877e822,
+    0x087a30a2,
+    0x087c1032,
+    0x0880000a,
+    0x08800802,
+    0x0880100a,
+    0x0881c0e2,
+    0x08838002,
+    0x08839812,
+    0x0883f822,
+    0x0884100a,
+    0x0885802a,
+    0x08859832,
+    0x0885b81a,
+    0x0885c812,
+    0x0885e808,
+    0x08861002,
+    0x08866808,
+    0x08880022,
+    0x08893842,
+    0x0889600a,
+    0x08896872,
+    0x088a281a,
+    0x088b9802,
+    0x088c0012,
+    0x088c100a,
+    0x088d982a,
+    0x088db082,
+    0x088df81a,
+    0x088e1018,
+    0x088e4832,
+    0x088e700a,
+    0x088e7802,
+    0x0891602a,
+    0x08917822,
+    0x0891901a,
+    0x0891a002,
+    0x0891a80a,
+    0x0891b012,
+    0x0891f002,
+    0x08920802,
+    0x0896f802,
+    0x0897002a,
+    0x08971872,
+    0x08980012,
+    0x0898101a,
+    0x0899d812,
+    0x0899f002,
+    0x0899f80a,
+    0x089a0002,
+    0x089a083a,
+    0x089a381a,
+    0x089a582a,
+    0x089ab802,
+    0x089b101a,
+    0x089b3062,
+    0x089b8042,
+    0x08a1a82a,
+    0x08a1c072,
+    0x08a2001a,
+    0x08a21022,
+    0x08a2280a,
+    0x08a23002,
+    0x08a2f002,
+    0x08a58002,
+    0x08a5881a,
+    0x08a59852,
+    0x08a5c80a,
+    0x08a5d002,
+    0x08a5d81a,
+    0x08a5e802,
+    0x08a5f00a,
+    0x08a5f812,
+    0x08a6080a,
+    0x08a61012,
+    0x08ad7802,
+    0x08ad801a,
+    0x08ad9032,
+    0x08adc03a,
+    0x08ade012,
+    0x08adf00a,
+    0x08adf812,
+    0x08aee012,
+    0x08b1802a,
+    0x08b19872,
+    0x08b1d81a,
+    0x08b1e802,
+    0x08b1f00a,
+    0x08b1f812,
+    0x08b55802,
+    0x08b5600a,
+    0x08b56802,
+    0x08b5701a,
+    0x08b58052,
+    0x08b5b00a,
+    0x08b5b802,
+    0x08b8e822,
+    0x08b91032,
+    0x08b9300a,
+    0x08b93842,
+    0x08c1602a,
+    0x08c17882,
+    0x08c1c00a,
+    0x08c1c812,
+    0x08c98002,
+    0x08c9884a,
+    0x08c9b81a,
+    0x08c9d812,
+    0x08c9e80a,
+    0x08c9f002,
+    0x08c9f808,
+    0x08ca000a,
+    0x08ca0808,
+    0x08ca100a,
+    0x08ca1802,
+    0x08ce882a,
+    0x08cea032,
+    0x08ced012,
+    0x08cee03a,
+    0x08cf0002,
+    0x08cf200a,
+    0x08d00892,
+    0x08d19852,
+    0x08d1c80a,
+    0x08d1d008,
+    0x08d1d832,
+    0x08d23802,
+    0x08d28852,
+    0x08d2b81a,
+    0x08d2c822,
+    0x08d42058,
+    0x08d450c2,
+    0x08d4b80a,
+    0x08d4c012,
+    0x08e1780a,
+    0x08e18062,
+    0x08e1c052,
+    0x08e1f00a,
+    0x08e1f802,
+    0x08e49152,
+    0x08e5480a,
+    0x08e55062,
+    0x08e5880a,
+    0x08e59012,
+    0x08e5a00a,
+    0x08e5a812,
+    0x08e98852,
+    0x08e9d002,
+    0x08e9e012,
+    0x08e9f862,
+    0x08ea3008,
+    0x08ea3802,
+    0x08ec504a,
+    0x08ec8012,
+    0x08ec981a,
+    0x08eca802,
+    0x08ecb00a,
+    0x08ecb802,
+    0x08f79812,
+    0x08f7a81a,
+    0x08f80012,
+    0x08f81008,
+    0x08f8180a,
+    0x08f9a01a,
+    0x08f9b042,
+    0x08f9f01a,
+    0x08fa0002,
+    0x08fa080a,
+    0x08fa1002,
+    0x09a180f1,
+    0x09a20002,
+    0x09a238e2,
+    0x0b578042,
+    0x0b598062,
+    0x0b7a7802,
+    0x0b7a8b6a,
+    0x0b7c7832,
+    0x0b7f2002,
+    0x0b7f801a,
+    0x0de4e812,
+    0x0de50031,
+    0x0e7802d2,
+    0x0e798162,
+    0x0e8b2802,
+    0x0e8b300a,
+    0x0e8b3822,
+    0x0e8b680a,
+    0x0e8b7042,
+    0x0e8b9871,
+    0x0e8bd872,
+    0x0e8c2862,
+    0x0e8d5032,
+    0x0e921022,
+    0x0ed00362,
+    0x0ed1db12,
+    0x0ed3a802,
+    0x0ed42002,
+    0x0ed4d842,
+    0x0ed508e2,
+    0x0f000062,
+    0x0f004102,
+    0x0f00d862,
+    0x0f011812,
+    0x0f013042,
+    0x0f047802,
+    0x0f098062,
+    0x0f157002,
+    0x0f176032,
+    0x0f276032,
+    0x0f468062,
+    0x0f4a2062,
+    0x0f8007f3,
+    0x0f8407f3,
+    0x0f886823,
+    0x0f897803,
+    0x0f8b6053,
+    0x0f8bf013,
+    0x0f8c7003,
+    0x0f8c8893,
+    0x0f8d6b83,
+    0x0f8f3199,
+    0x0f9008e3,
+    0x0f90d003,
+    0x0f917803,
+    0x0f919083,
+    0x0f91e033,
+    0x0f924ff3,
+    0x0f964ff3,
+    0x0f9a4ff3,
+    0x0f9e4b13,
+    0x0f9fd842,
+    0x0fa007f3,
+    0x0fa407f3,
+    0x0fa803d3,
+    0x0faa37f3,
+    0x0fae37f3,
+    0x0fb23093,
+    0x0fb407f3,
+    0x0fbba0b3,
+    0x0fbeaaa3,
+    0x0fc06033,
+    0x0fc24073,
+    0x0fc2d053,
+    0x0fc44073,
+    0x0fc57513,
+    0x0fc862e3,
+    0x0fc9e093,
+    0x0fca3ff3,
+    0x0fce3ff3,
+    0x0fd23ff3,
+    0x0fd63b83,
+    0x0fe007f3,
+    0x0fe407f3,
+    0x0fe807f3,
+    0x0fec07f3,
+    0x0ff007f3,
+    0x0ff407f3,
+    0x0ff807f3,
+    0x0ffc07d3,
+    0x700001f1,
+    0x700105f2,
+    0x700407f1,
+    0x700807f2,
+    0x700c06f2,
+    0x700f87f1,
+    0x701387f1,
+    0x701787f1,
+    0x701b87f1,
+    0x701f87f1,
+    0x702387f1,
+    0x702787f1,
+    0x702b87f1,
+    0x702f87f1,
+    0x703387f1,
+    0x703787f1,
+    0x703b87f1,
+    0x703f87f1,
+    0x704387f1,
+    0x704787f1,
+    0x704b87f1,
+    0x704f87f1,
+    0x705387f1,
+    0x705787f1,
+    0x705b87f1,
+    0x705f87f1,
+    0x706387f1,
+    0x706787f1,
+    0x706b87f1,
+    0x706f87f1,
+    0x707387f1,
+    0x707787f1,
+    0x707b87f1,
+    0x707f80f1};
+
+/// Returns the extended grapheme cluster bondary property of a code point.
+[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr __property __get_property(const char32_t __code_point) noexcept {
+  // The algorithm searches for the upper bound of the range and, when found,
+  // steps back one entry. This algorithm is used since the code point can be
+  // anywhere in the range. After a lower bound is found the next step is to
+  // compare whether the code unit is indeed in the range.
+  //
+  // Since the entry contains a code unit, size, and property the code point
+  // being sought needs to be adjusted. Just shifting the code point to the
+  // proper position doesn't work; suppose an entry has property 0, size 1,
+  // and lower bound 3. This results in the entry 0x1810.
+  // When searching for code point 3 it will search for 0x1800, find 0x1810
+  // and moves to the previous entry. Thus the lower bound value will never
+  // be found.
+  // The simple solution is to set the bits belonging to the property and
+  // size. Then the upper bound for code point 3 will return the entry after
+  // 0x1810. After moving to the previous entry the algorithm arrives at the
+  // correct entry.
+  ptrdiff_t __i = std::ranges::upper_bound(__entries, (__code_point << 11) | 0x7ffu) - __entries;
+  if (__i == 0)
+    return __property::__none;
+
+  --__i;
+  uint32_t __upper_bound = (__entries[__i] >> 11) + ((__entries[__i] >> 4) & 0x7f);
+  if (__code_point <= __upper_bound)
+    return static_cast<__property>(__entries[__i] & 0xf);
+
+  return __property::__none;
+}
+
+} // namespace __extended_grapheme_custer_property_boundary
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_EXTENDED_GRAPHEME_CLUSTER_TABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__format/format_arg.h b/app/src/main/cpp/libcxx/include/__format/format_arg.h
new file mode 100644
index 0000000..771a03f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/format_arg.h
@@ -0,0 +1,302 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMAT_ARG_H
+#define _LIBCPP___FORMAT_FORMAT_ARG_H
+
+#include <__assert>
+#include <__concepts/arithmetic.h>
+#include <__config>
+#include <__format/format_error.h>
+#include <__format/format_fwd.h>
+#include <__format/format_parse_context.h>
+#include <__functional/invoke.h>
+#include <__memory/addressof.h>
+#include <__utility/forward.h>
+#include <__utility/unreachable.h>
+#include <__variant/monostate.h>
+#include <string>
+#include <string_view>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace __format {
+/// The type stored in @ref basic_format_arg.
+///
+/// @note The 128-bit types are unconditionally in the list to avoid the values
+/// of the enums to depend on the availability of 128-bit integers.
+///
+/// @note The value is stored as a 5-bit value in the __packed_arg_t_bits. This
+/// limits the maximum number of elements to 32.
+/// When modifying update the test
+/// test/libcxx/utilities/format/format.arguments/format.arg/arg_t.compile.pass.cpp
+/// It could be packed in 4-bits but that means a new type directly becomes an
+/// ABI break. The packed type is 64-bit so this reduces the maximum number of
+/// packed elements from 16 to 12.
+///
+/// @note Some members of this enum are an extension. These extensions need
+/// special behaviour in visit_format_arg. There they need to be wrapped in a
+/// handle to satisfy the user observable behaviour. The internal function
+/// __visit_format_arg doesn't do this wrapping. So in the format functions
+/// this function is used to avoid unneeded overhead.
+enum class _LIBCPP_ENUM_VIS __arg_t : uint8_t {
+  __none,
+  __boolean,
+  __char_type,
+  __int,
+  __long_long,
+  __i128, // extension
+  __unsigned,
+  __unsigned_long_long,
+  __u128, // extension
+  __float,
+  __double,
+  __long_double,
+  __const_char_type_ptr,
+  __string_view,
+  __ptr,
+  __handle
+};
+
+inline constexpr unsigned __packed_arg_t_bits = 5;
+inline constexpr uint8_t __packed_arg_t_mask = 0x1f;
+
+inline constexpr unsigned __packed_types_storage_bits = 64;
+inline constexpr unsigned __packed_types_max = __packed_types_storage_bits / __packed_arg_t_bits;
+
+_LIBCPP_HIDE_FROM_ABI
+constexpr bool __use_packed_format_arg_store(size_t __size) { return __size <= __packed_types_max; }
+
+_LIBCPP_HIDE_FROM_ABI
+constexpr __arg_t __get_packed_type(uint64_t __types, size_t __id) {
+  _LIBCPP_ASSERT(__id <= __packed_types_max, "");
+
+  if (__id > 0)
+    __types >>= __id * __packed_arg_t_bits;
+
+  return static_cast<__format::__arg_t>(__types & __packed_arg_t_mask);
+}
+
+} // namespace __format
+
+// This function is not user obervable, so it can directly use the non-standard
+// types of the "variant". See __arg_t for more details.
+template <class _Visitor, class _Context>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT decltype(auto)
+__visit_format_arg(_Visitor&& __vis, basic_format_arg<_Context> __arg) {
+  switch (__arg.__type_) {
+  case __format::__arg_t::__none:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__monostate_);
+  case __format::__arg_t::__boolean:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__boolean_);
+  case __format::__arg_t::__char_type:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__char_type_);
+  case __format::__arg_t::__int:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__int_);
+  case __format::__arg_t::__long_long:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__long_long_);
+  case __format::__arg_t::__i128:
+#  ifndef _LIBCPP_HAS_NO_INT128
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__i128_);
+#  else
+    __libcpp_unreachable();
+#  endif
+  case __format::__arg_t::__unsigned:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__unsigned_);
+  case __format::__arg_t::__unsigned_long_long:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__unsigned_long_long_);
+  case __format::__arg_t::__u128:
+#  ifndef _LIBCPP_HAS_NO_INT128
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__u128_);
+#  else
+    __libcpp_unreachable();
+#  endif
+  case __format::__arg_t::__float:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__float_);
+  case __format::__arg_t::__double:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__double_);
+  case __format::__arg_t::__long_double:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__long_double_);
+  case __format::__arg_t::__const_char_type_ptr:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__const_char_type_ptr_);
+  case __format::__arg_t::__string_view:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__string_view_);
+  case __format::__arg_t::__ptr:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), __arg.__value_.__ptr_);
+  case __format::__arg_t::__handle:
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis),
+                         typename basic_format_arg<_Context>::handle{__arg.__value_.__handle_});
+  }
+
+  __libcpp_unreachable();
+}
+
+/// Contains the values used in basic_format_arg.
+///
+/// This is a separate type so it's possible to store the values and types in
+/// separate arrays.
+template <class _Context>
+class __basic_format_arg_value {
+  using _CharT = typename _Context::char_type;
+
+public:
+  /// Contains the implementation for basic_format_arg::handle.
+  struct __handle {
+    template <class _Tp>
+    _LIBCPP_HIDE_FROM_ABI explicit __handle(_Tp&& __v) noexcept
+        : __ptr_(_VSTD::addressof(__v)),
+          __format_([](basic_format_parse_context<_CharT>& __parse_ctx, _Context& __ctx, const void* __ptr) {
+            using _Dp = remove_cvref_t<_Tp>;
+            using _Formatter = typename _Context::template formatter_type<_Dp>;
+            constexpr bool __const_formattable =
+                requires { _Formatter().format(std::declval<const _Dp&>(), std::declval<_Context&>()); };
+            using _Qp = conditional_t<__const_formattable, const _Dp, _Dp>;
+
+            static_assert(__const_formattable || !is_const_v<remove_reference_t<_Tp>>, "Mandated by [format.arg]/18");
+
+            _Formatter __f;
+            __parse_ctx.advance_to(__f.parse(__parse_ctx));
+            __ctx.advance_to(__f.format(*const_cast<_Qp*>(static_cast<const _Dp*>(__ptr)), __ctx));
+          }) {}
+
+    const void* __ptr_;
+    void (*__format_)(basic_format_parse_context<_CharT>&, _Context&, const void*);
+  };
+
+  union {
+    monostate __monostate_;
+    bool __boolean_;
+    _CharT __char_type_;
+    int __int_;
+    unsigned __unsigned_;
+    long long __long_long_;
+    unsigned long long __unsigned_long_long_;
+#  ifndef _LIBCPP_HAS_NO_INT128
+    __int128_t __i128_;
+    __uint128_t __u128_;
+#  endif
+    float __float_;
+    double __double_;
+    long double __long_double_;
+    const _CharT* __const_char_type_ptr_;
+    basic_string_view<_CharT> __string_view_;
+    const void* __ptr_;
+    __handle __handle_;
+  };
+
+  // These constructors contain the exact storage type used. If adjustments are
+  // required, these will be done in __create_format_arg.
+
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value() noexcept : __monostate_() {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(bool __value) noexcept : __boolean_(__value) {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(_CharT __value) noexcept : __char_type_(__value) {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(int __value) noexcept : __int_(__value) {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(unsigned __value) noexcept : __unsigned_(__value) {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(long long __value) noexcept : __long_long_(__value) {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(unsigned long long __value) noexcept
+      : __unsigned_long_long_(__value) {}
+#  ifndef _LIBCPP_HAS_NO_INT128
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(__int128_t __value) noexcept : __i128_(__value) {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(__uint128_t __value) noexcept : __u128_(__value) {}
+#  endif
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(float __value) noexcept : __float_(__value) {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(double __value) noexcept : __double_(__value) {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(long double __value) noexcept : __long_double_(__value) {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(const _CharT* __value) noexcept : __const_char_type_ptr_(__value) {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(basic_string_view<_CharT> __value) noexcept
+      : __string_view_(__value) {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(const void* __value) noexcept : __ptr_(__value) {}
+  _LIBCPP_HIDE_FROM_ABI __basic_format_arg_value(__handle __value) noexcept
+      // TODO FMT Investigate why it doesn't work without the forward.
+      : __handle_(std::forward<__handle>(__value)) {}
+};
+
+template <class _Context>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT basic_format_arg {
+public:
+  class _LIBCPP_TEMPLATE_VIS handle;
+
+  _LIBCPP_HIDE_FROM_ABI basic_format_arg() noexcept
+      : __type_{__format::__arg_t::__none} {}
+
+  _LIBCPP_HIDE_FROM_ABI explicit operator bool() const noexcept {
+    return __type_ != __format::__arg_t::__none;
+  }
+
+private:
+  using char_type = typename _Context::char_type;
+
+  // TODO FMT Implement constrain [format.arg]/4
+  // Constraints: The template specialization
+  //   typename Context::template formatter_type<T>
+  // meets the Formatter requirements ([formatter.requirements]).  The extent
+  // to which an implementation determines that the specialization meets the
+  // Formatter requirements is unspecified, except that as a minimum the
+  // expression
+  //   typename Context::template formatter_type<T>()
+  //    .format(declval<const T&>(), declval<Context&>())
+  // shall be well-formed when treated as an unevaluated operand.
+
+public:
+  __basic_format_arg_value<_Context> __value_;
+  __format::__arg_t __type_;
+
+  _LIBCPP_HIDE_FROM_ABI explicit basic_format_arg(__format::__arg_t __type,
+                                                  __basic_format_arg_value<_Context> __value) noexcept
+      : __value_(__value), __type_(__type) {}
+};
+
+template <class _Context>
+class _LIBCPP_TEMPLATE_VIS basic_format_arg<_Context>::handle {
+public:
+  _LIBCPP_HIDE_FROM_ABI
+  void format(basic_format_parse_context<char_type>& __parse_ctx, _Context& __ctx) const {
+    __handle_.__format_(__parse_ctx, __ctx, __handle_.__ptr_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI explicit handle(typename __basic_format_arg_value<_Context>::__handle& __handle) noexcept
+      : __handle_(__handle) {}
+
+private:
+  typename __basic_format_arg_value<_Context>::__handle& __handle_;
+};
+
+// This function is user facing, so it must wrap the non-standard types of
+// the "variant" in a handle to stay conforming. See __arg_t for more details.
+template <class _Visitor, class _Context>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT decltype(auto)
+visit_format_arg(_Visitor&& __vis, basic_format_arg<_Context> __arg) {
+  switch (__arg.__type_) {
+#  ifndef _LIBCPP_HAS_NO_INT128
+  case __format::__arg_t::__i128: {
+    typename __basic_format_arg_value<_Context>::__handle __h{__arg.__value_.__i128_};
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), typename basic_format_arg<_Context>::handle{__h});
+  }
+
+  case __format::__arg_t::__u128: {
+    typename __basic_format_arg_value<_Context>::__handle __h{__arg.__value_.__u128_};
+    return _VSTD::invoke(_VSTD::forward<_Visitor>(__vis), typename basic_format_arg<_Context>::handle{__h});
+  }
+#  endif
+  default:
+    return _VSTD::__visit_format_arg(_VSTD::forward<_Visitor>(__vis), __arg);
+  }
+}
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMAT_ARG_H
diff --git a/app/src/main/cpp/libcxx/include/__format/format_arg_store.h b/app/src/main/cpp/libcxx/include/__format/format_arg_store.h
new file mode 100644
index 0000000..6f4f4c3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/format_arg_store.h
@@ -0,0 +1,254 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMAT_ARG_STORE_H
+#define _LIBCPP___FORMAT_FORMAT_ARG_STORE_H
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#include <__concepts/arithmetic.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/format_arg.h>
+#include <__utility/forward.h>
+#include <cstring>
+#include <string>
+#include <string_view>
+#include <type_traits>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace __format {
+
+/// \returns The @c __arg_t based on the type of the formatting argument.
+///
+/// \pre \c __formattable<_Tp, typename _Context::char_type>
+template <class _Context, class _Tp>
+consteval __arg_t __determine_arg_t();
+
+// Boolean
+template <class, same_as<bool> _Tp>
+consteval __arg_t __determine_arg_t() {
+  return __arg_t::__boolean;
+}
+
+// Char
+template <class _Context, same_as<typename _Context::char_type> _Tp>
+consteval __arg_t __determine_arg_t() {
+  return __arg_t::__char_type;
+}
+#  ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class _Context, class _CharT>
+  requires(same_as<typename _Context::char_type, wchar_t> && same_as<_CharT, char>)
+consteval __arg_t __determine_arg_t() {
+  return __arg_t::__char_type;
+}
+#  endif
+
+// Signed integers
+template <class, __libcpp_signed_integer _Tp>
+consteval __arg_t __determine_arg_t() {
+  if constexpr (sizeof(_Tp) <= sizeof(int))
+    return __arg_t::__int;
+  else if constexpr (sizeof(_Tp) <= sizeof(long long))
+    return __arg_t::__long_long;
+#  ifndef _LIBCPP_HAS_NO_INT128
+  else if constexpr (sizeof(_Tp) == sizeof(__int128_t))
+    return __arg_t::__i128;
+#  endif
+  else
+    static_assert(sizeof(_Tp) == 0, "an unsupported signed integer was used");
+}
+
+// Unsigned integers
+template <class, __libcpp_unsigned_integer _Tp>
+consteval __arg_t __determine_arg_t() {
+  if constexpr (sizeof(_Tp) <= sizeof(unsigned))
+    return __arg_t::__unsigned;
+  else if constexpr (sizeof(_Tp) <= sizeof(unsigned long long))
+    return __arg_t::__unsigned_long_long;
+#  ifndef _LIBCPP_HAS_NO_INT128
+  else if constexpr (sizeof(_Tp) == sizeof(__uint128_t))
+    return __arg_t::__u128;
+#  endif
+  else
+    static_assert(sizeof(_Tp) == 0, "an unsupported unsigned integer was used");
+}
+
+// Floating-point
+template <class, same_as<float> _Tp>
+consteval __arg_t __determine_arg_t() {
+  return __arg_t::__float;
+}
+template <class, same_as<double> _Tp>
+consteval __arg_t __determine_arg_t() {
+  return __arg_t::__double;
+}
+template <class, same_as<long double> _Tp>
+consteval __arg_t __determine_arg_t() {
+  return __arg_t::__long_double;
+}
+
+// Char pointer
+template <class _Context, class _Tp>
+  requires(same_as<typename _Context::char_type*, _Tp> || same_as<const typename _Context::char_type*, _Tp>)
+consteval __arg_t __determine_arg_t() {
+  return __arg_t::__const_char_type_ptr;
+}
+
+// Char array
+template <class _Context, class _Tp>
+  requires(is_array_v<_Tp> && same_as<_Tp, typename _Context::char_type[extent_v<_Tp>]>)
+consteval __arg_t __determine_arg_t() {
+  return __arg_t::__string_view;
+}
+
+// String view
+template <class _Context, class _Tp>
+  requires(same_as<typename _Context::char_type, typename _Tp::value_type> &&
+           same_as<_Tp, basic_string_view<typename _Tp::value_type, typename _Tp::traits_type>>)
+consteval __arg_t __determine_arg_t() {
+  return __arg_t::__string_view;
+}
+
+// String
+template <class _Context, class _Tp>
+  requires(
+      same_as<typename _Context::char_type, typename _Tp::value_type> &&
+      same_as<_Tp, basic_string<typename _Tp::value_type, typename _Tp::traits_type, typename _Tp::allocator_type>>)
+consteval __arg_t __determine_arg_t() {
+  return __arg_t::__string_view;
+}
+
+// Pointers
+template <class, class _Ptr>
+  requires(same_as<_Ptr, void*> || same_as<_Ptr, const void*> || same_as<_Ptr, nullptr_t>)
+consteval __arg_t __determine_arg_t() {
+  return __arg_t::__ptr;
+}
+
+// Handle
+//
+// Note this version can't be constrained avoiding ambiguous overloads.
+// That means it can be instantiated by disabled formatters. To solve this, a
+// constrained version for not formattable formatters is added. That overload
+// is marked as deleted to fail creating a storage type for disabled formatters.
+template <class _Context, class _Tp>
+consteval __arg_t __determine_arg_t() {
+  return __arg_t::__handle;
+}
+
+template <class _Context, class _Tp>
+  requires(!__formattable<_Tp, typename _Context::char_type>)
+consteval __arg_t __determine_arg_t() = delete;
+
+template <class _Context, class _Tp>
+_LIBCPP_HIDE_FROM_ABI basic_format_arg<_Context> __create_format_arg(_Tp&& __value) noexcept {
+  constexpr __arg_t __arg = __determine_arg_t<_Context, remove_cvref_t<_Tp>>();
+  static_assert(__arg != __arg_t::__none);
+
+  // Not all types can be used to directly initialize the
+  // __basic_format_arg_value.  First handle all types needing adjustment, the
+  // final else requires no adjustment.
+  if constexpr (__arg == __arg_t::__char_type)
+    // On some platforms initializing a wchar_t from a char is a narrowing
+    // conversion.
+    return basic_format_arg<_Context>{__arg, static_cast<typename _Context::char_type>(__value)};
+  else if constexpr (__arg == __arg_t::__int)
+    return basic_format_arg<_Context>{__arg, static_cast<int>(__value)};
+  else if constexpr (__arg == __arg_t::__long_long)
+    return basic_format_arg<_Context>{__arg, static_cast<long long>(__value)};
+  else if constexpr (__arg == __arg_t::__unsigned)
+    return basic_format_arg<_Context>{__arg, static_cast<unsigned>(__value)};
+  else if constexpr (__arg == __arg_t::__unsigned_long_long)
+    return basic_format_arg<_Context>{__arg, static_cast<unsigned long long>(__value)};
+  else if constexpr (__arg == __arg_t::__string_view)
+    // Using std::size on a character array will add the NUL-terminator to the size.
+    if constexpr (is_array_v<remove_cvref_t<_Tp>>)
+      return basic_format_arg<_Context>{
+          __arg, basic_string_view<typename _Context::char_type>{__value, extent_v<remove_cvref_t<_Tp>> - 1}};
+    else
+      // When the _Traits or _Allocator are different an implicit conversion will
+      // fail.
+      return basic_format_arg<_Context>{
+          __arg, basic_string_view<typename _Context::char_type>{__value.data(), __value.size()}};
+  else if constexpr (__arg == __arg_t::__ptr)
+    return basic_format_arg<_Context>{__arg, static_cast<const void*>(__value)};
+  else if constexpr (__arg == __arg_t::__handle)
+    return basic_format_arg<_Context>{
+        __arg, typename __basic_format_arg_value<_Context>::__handle{_VSTD::forward<_Tp>(__value)}};
+  else
+    return basic_format_arg<_Context>{__arg, __value};
+}
+
+template <class _Context, class... _Args>
+_LIBCPP_HIDE_FROM_ABI void __create_packed_storage(uint64_t& __types, __basic_format_arg_value<_Context>* __values,
+                                                   _Args&&... __args) noexcept {
+  int __shift = 0;
+  (
+      [&] {
+        basic_format_arg<_Context> __arg = __format::__create_format_arg<_Context>(__args);
+        if (__shift != 0)
+          __types |= static_cast<uint64_t>(__arg.__type_) << __shift;
+        else
+          // Assigns the initial value.
+          __types = static_cast<uint64_t>(__arg.__type_);
+        __shift += __packed_arg_t_bits;
+        *__values++ = __arg.__value_;
+      }(),
+      ...);
+}
+
+template <class _Context, class... _Args>
+_LIBCPP_HIDE_FROM_ABI void __store_basic_format_arg(basic_format_arg<_Context>* __data, _Args&&... __args) noexcept {
+  ([&] { *__data++ = __format::__create_format_arg<_Context>(__args); }(), ...);
+}
+
+template <class _Context, size_t N>
+struct __packed_format_arg_store {
+  __basic_format_arg_value<_Context> __values_[N];
+  uint64_t __types_;
+};
+
+template <class _Context, size_t N>
+struct __unpacked_format_arg_store {
+  basic_format_arg<_Context> __args_[N];
+};
+
+} // namespace __format
+
+template <class _Context, class... _Args>
+struct _LIBCPP_TEMPLATE_VIS __format_arg_store {
+  _LIBCPP_HIDE_FROM_ABI
+  __format_arg_store(_Args&... __args) noexcept {
+    if constexpr (sizeof...(_Args) != 0) {
+      if constexpr (__format::__use_packed_format_arg_store(sizeof...(_Args)))
+        __format::__create_packed_storage(__storage.__types_, __storage.__values_, __args...);
+      else
+        __format::__store_basic_format_arg<_Context>(__storage.__args_, __args...);
+    }
+  }
+
+  using _Storage = conditional_t<__format::__use_packed_format_arg_store(sizeof...(_Args)),
+                                 __format::__packed_format_arg_store<_Context, sizeof...(_Args)>,
+                                 __format::__unpacked_format_arg_store<_Context, sizeof...(_Args)>>;
+
+  _Storage __storage;
+};
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMAT_ARG_STORE_H
diff --git a/app/src/main/cpp/libcxx/include/__format/format_args.h b/app/src/main/cpp/libcxx/include/__format/format_args.h
new file mode 100644
index 0000000..8b8fbde
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/format_args.h
@@ -0,0 +1,80 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMAT_ARGS_H
+#define _LIBCPP___FORMAT_FORMAT_ARGS_H
+
+#include <__availability>
+#include <__config>
+#include <__format/format_arg.h>
+#include <__format/format_arg_store.h>
+#include <__format/format_fwd.h>
+#include <cstddef>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _Context>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT basic_format_args {
+public:
+  _LIBCPP_HIDE_FROM_ABI basic_format_args() noexcept = default;
+
+  template <class... _Args>
+  _LIBCPP_HIDE_FROM_ABI basic_format_args(const __format_arg_store<_Context, _Args...>& __store) noexcept
+      : __size_(sizeof...(_Args)) {
+    if constexpr (sizeof...(_Args) != 0) {
+      if constexpr (__format::__use_packed_format_arg_store(sizeof...(_Args))) {
+        __values_ = __store.__storage.__values_;
+        __types_ = __store.__storage.__types_;
+      } else
+        __args_ = __store.__storage.__args_;
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  basic_format_arg<_Context> get(size_t __id) const noexcept {
+    if (__id >= __size_)
+      return basic_format_arg<_Context>{};
+
+    if (__format::__use_packed_format_arg_store(__size_))
+      return basic_format_arg<_Context>{__format::__get_packed_type(__types_, __id), __values_[__id]};
+
+    return __args_[__id];
+  }
+
+  _LIBCPP_HIDE_FROM_ABI size_t __size() const noexcept { return __size_; }
+
+private:
+  size_t __size_{0};
+  // [format.args]/5
+  // [Note 1: Implementations are encouraged to optimize the representation of
+  // basic_format_args for small number of formatting arguments by storing
+  // indices of type alternatives separately from values and packing the
+  // former. - end note]
+  union {
+    struct {
+      const __basic_format_arg_value<_Context>* __values_;
+      uint64_t __types_;
+    };
+    const basic_format_arg<_Context>* __args_;
+  };
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(basic_format_args);
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMAT_ARGS_H
diff --git a/app/src/main/cpp/libcxx/include/__format/format_context.h b/app/src/main/cpp/libcxx/include/__format/format_context.h
new file mode 100644
index 0000000..85e00eb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/format_context.h
@@ -0,0 +1,223 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMAT_CONTEXT_H
+#define _LIBCPP___FORMAT_FORMAT_CONTEXT_H
+
+#include <__availability>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__format/buffer.h>
+#include <__format/format_arg.h>
+#include <__format/format_arg_store.h>
+#include <__format/format_args.h>
+#include <__format/format_error.h>
+#include <__format/format_fwd.h>
+#include <__iterator/back_insert_iterator.h>
+#include <__iterator/concepts.h>
+#include <__memory/addressof.h>
+#include <__utility/move.h>
+#include <__variant/monostate.h>
+#include <cstddef>
+
+#ifndef _LIBCPP_HAS_NO_LOCALIZATION
+#include <locale>
+#include <optional>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _OutIt, class _CharT>
+requires output_iterator<_OutIt, const _CharT&>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT basic_format_context;
+
+#ifndef _LIBCPP_HAS_NO_LOCALIZATION
+/**
+ * Helper to create a basic_format_context.
+ *
+ * This is needed since the constructor is private.
+ */
+template <class _OutIt, class _CharT>
+_LIBCPP_HIDE_FROM_ABI basic_format_context<_OutIt, _CharT>
+__format_context_create(
+    _OutIt __out_it,
+    basic_format_args<basic_format_context<_OutIt, _CharT>> __args,
+    optional<_VSTD::locale>&& __loc = nullopt) {
+  return _VSTD::basic_format_context(_VSTD::move(__out_it), __args, _VSTD::move(__loc));
+}
+#else
+template <class _OutIt, class _CharT>
+_LIBCPP_HIDE_FROM_ABI basic_format_context<_OutIt, _CharT>
+__format_context_create(
+    _OutIt __out_it,
+    basic_format_args<basic_format_context<_OutIt, _CharT>> __args) {
+  return _VSTD::basic_format_context(_VSTD::move(__out_it), __args);
+}
+#endif
+
+using format_context =
+    basic_format_context<back_insert_iterator<__format::__output_buffer<char>>,
+                         char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+using wformat_context = basic_format_context<
+    back_insert_iterator<__format::__output_buffer<wchar_t>>, wchar_t>;
+#endif
+
+template <class _OutIt, class _CharT>
+requires output_iterator<_OutIt, const _CharT&>
+class
+    // clang-format off
+    _LIBCPP_TEMPLATE_VIS
+    _LIBCPP_AVAILABILITY_FORMAT
+    _LIBCPP_PREFERRED_NAME(format_context)
+    _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wformat_context))
+    // clang-format on
+    basic_format_context {
+public:
+  using iterator = _OutIt;
+  using char_type = _CharT;
+  template <class _Tp>
+  using formatter_type = formatter<_Tp, _CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI basic_format_arg<basic_format_context>
+  arg(size_t __id) const noexcept {
+    return __args_.get(__id);
+  }
+#ifndef _LIBCPP_HAS_NO_LOCALIZATION
+  _LIBCPP_HIDE_FROM_ABI _VSTD::locale locale() {
+    if (!__loc_)
+      __loc_ = _VSTD::locale{};
+    return *__loc_;
+  }
+#endif
+  _LIBCPP_HIDE_FROM_ABI iterator out() { return std::move(__out_it_); }
+  _LIBCPP_HIDE_FROM_ABI void advance_to(iterator __it) { __out_it_ = std::move(__it); }
+
+private:
+  iterator __out_it_;
+  basic_format_args<basic_format_context> __args_;
+#ifndef _LIBCPP_HAS_NO_LOCALIZATION
+
+  // The Standard doesn't specify how the locale is stored.
+  // [format.context]/6
+  // std::locale locale();
+  //   Returns: The locale passed to the formatting function if the latter
+  //   takes one, and std::locale() otherwise.
+  // This is done by storing the locale of the constructor in this optional. If
+  // locale() is called and the optional has no value the value will be created.
+  // This allows the implementation to lazily create the locale.
+  // TODO FMT Validate whether lazy creation is the best solution.
+  optional<_VSTD::locale> __loc_;
+
+  template <class __OutIt, class __CharT>
+  friend _LIBCPP_HIDE_FROM_ABI basic_format_context<__OutIt, __CharT>
+  __format_context_create(__OutIt, basic_format_args<basic_format_context<__OutIt, __CharT>>,
+                          optional<_VSTD::locale>&&);
+
+  // Note: the Standard doesn't specify the required constructors.
+  _LIBCPP_HIDE_FROM_ABI
+  explicit basic_format_context(_OutIt __out_it,
+                                basic_format_args<basic_format_context> __args,
+                                optional<_VSTD::locale>&& __loc)
+      : __out_it_(_VSTD::move(__out_it)), __args_(__args),
+        __loc_(_VSTD::move(__loc)) {}
+#else
+  template <class __OutIt, class __CharT>
+  friend _LIBCPP_HIDE_FROM_ABI basic_format_context<__OutIt, __CharT>
+      __format_context_create(__OutIt, basic_format_args<basic_format_context<__OutIt, __CharT>>);
+
+  _LIBCPP_HIDE_FROM_ABI
+  explicit basic_format_context(_OutIt __out_it,
+                                basic_format_args<basic_format_context> __args)
+      : __out_it_(_VSTD::move(__out_it)), __args_(__args) {}
+#endif
+};
+
+// A specialization for __retarget_buffer
+//
+// See __retarget_buffer for the motivation for this specialization.
+//
+// This context holds a reference to the instance of the basic_format_context
+// that is retargeted. It converts a formatting argument when it is requested
+// during formatting. It is expected that the usage of the arguments is rare so
+// the lookups are not expected to be used often. An alternative would be to
+// convert all elements during construction.
+//
+// The elements of the retargets context are only used when an underlying
+// formatter uses a locale specific formatting or an formatting argument is
+// part for the format spec. For example
+//   format("{:256:{}}", input, 8);
+// Here the width of an element in input is determined dynamically.
+// Note when the top-level element has no width the retargeting is not needed.
+template <class _CharT>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT
+    basic_format_context<typename __format::__retarget_buffer<_CharT>::__iterator, _CharT> {
+public:
+  using iterator  = typename __format::__retarget_buffer<_CharT>::__iterator;
+  using char_type = _CharT;
+  template <class _Tp>
+  using formatter_type = formatter<_Tp, _CharT>;
+
+  template <class _Context>
+  _LIBCPP_HIDE_FROM_ABI explicit basic_format_context(iterator __out_it, _Context& __ctx)
+      : __out_it_(std::move(__out_it)),
+#  ifndef _LIBCPP_HAS_NO_LOCALIZATION
+        __loc_([](void* __c) { return static_cast<_Context*>(__c)->locale(); }),
+#  endif
+        __ctx_(std::addressof(__ctx)),
+        __arg_([](void* __c, size_t __id) {
+          return std::visit_format_arg(
+              [&](auto __arg) -> basic_format_arg<basic_format_context> {
+                if constexpr (same_as<decltype(__arg), monostate>)
+                  return {};
+                else if constexpr (same_as<decltype(__arg), typename basic_format_arg<_Context>::handle>)
+                  // At the moment it's not possible for formatting to use a re-targeted handle.
+                  // TODO FMT add this when support is needed.
+                  std::__throw_format_error("Re-targeting handle not supported");
+                else
+                  return basic_format_arg<basic_format_context>{
+                      __format::__determine_arg_t<basic_format_context, decltype(__arg)>(),
+                      __basic_format_arg_value<basic_format_context>(__arg)};
+              },
+              static_cast<_Context*>(__c)->arg(__id));
+        }) {
+  }
+
+  _LIBCPP_HIDE_FROM_ABI basic_format_arg<basic_format_context> arg(size_t __id) const noexcept {
+    return __arg_(__ctx_, __id);
+  }
+#  ifndef _LIBCPP_HAS_NO_LOCALIZATION
+  _LIBCPP_HIDE_FROM_ABI _VSTD::locale locale() { return __loc_(__ctx_); }
+#  endif
+  _LIBCPP_HIDE_FROM_ABI iterator out() { return std::move(__out_it_); }
+  _LIBCPP_HIDE_FROM_ABI void advance_to(iterator __it) { __out_it_ = std::move(__it); }
+
+private:
+  iterator __out_it_;
+
+#  ifndef _LIBCPP_HAS_NO_LOCALIZATION
+  std::locale (*__loc_)(void* __ctx);
+#  endif
+
+  void* __ctx_;
+  basic_format_arg<basic_format_context> (*__arg_)(void* __ctx, size_t __id);
+};
+
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(basic_format_context);
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMAT_CONTEXT_H
diff --git a/app/src/main/cpp/libcxx/include/__format/format_error.h b/app/src/main/cpp/libcxx/include/__format/format_error.h
new file mode 100644
index 0000000..002d1a4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/format_error.h
@@ -0,0 +1,55 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMAT_ERROR_H
+#define _LIBCPP___FORMAT_FORMAT_ERROR_H
+
+#include <__config>
+#include <cstdlib>
+#include <stdexcept>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+class _LIBCPP_EXCEPTION_ABI format_error : public runtime_error {
+public:
+  _LIBCPP_HIDE_FROM_ABI explicit format_error(const string& __s)
+      : runtime_error(__s) {}
+  _LIBCPP_HIDE_FROM_ABI explicit format_error(const char* __s)
+      : runtime_error(__s) {}
+  // TODO FMT Remove when format is no longer experimental.
+  // Avoids linker errors when building the Clang-cl Windows DLL which doesn't
+  // support the experimental library.
+#  ifndef _LIBCPP_INLINE_FORMAT_ERROR_DTOR
+  ~format_error() noexcept override;
+#  else
+  ~format_error() noexcept  override {}
+#  endif
+};
+
+_LIBCPP_NORETURN inline _LIBCPP_HIDE_FROM_ABI void
+__throw_format_error(const char* __s) {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+  throw format_error(__s);
+#else
+  (void)__s;
+  _VSTD::abort();
+#endif
+}
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMAT_ERROR_H
diff --git a/app/src/main/cpp/libcxx/include/__format/format_functions.h b/app/src/main/cpp/libcxx/include/__format/format_functions.h
new file mode 100644
index 0000000..185148c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/format_functions.h
@@ -0,0 +1,661 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMAT_FUNCTIONS
+#define _LIBCPP___FORMAT_FORMAT_FUNCTIONS
+
+// TODO FMT This is added to fix Apple back-deployment.
+#include <version>
+#if !defined(_LIBCPP_HAS_NO_INCOMPLETE_FORMAT)
+
+#include <__algorithm/clamp.h>
+#include <__availability>
+#include <__concepts/convertible_to.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__debug>
+#include <__format/buffer.h>
+#include <__format/format_arg.h>
+#include <__format/format_arg_store.h>
+#include <__format/format_args.h>
+#include <__format/format_context.h>
+#include <__format/format_error.h>
+#include <__format/format_parse_context.h>
+#include <__format/format_string.h>
+#include <__format/format_to_n_result.h>
+#include <__format/formatter.h>
+#include <__format/formatter_bool.h>
+#include <__format/formatter_char.h>
+#include <__format/formatter_floating_point.h>
+#include <__format/formatter_integer.h>
+#include <__format/formatter_pointer.h>
+#include <__format/formatter_string.h>
+#include <__format/parser_std_format_spec.h>
+#include <__iterator/back_insert_iterator.h>
+#include <__iterator/incrementable_traits.h>
+#include <__variant/monostate.h>
+#include <array>
+#include <string>
+#include <string_view>
+
+#ifndef _LIBCPP_HAS_NO_LOCALIZATION
+#include <locale>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// TODO FMT Evaluate which templates should be external templates. This
+// improves the efficiency of the header. However since the header is still
+// under heavy development and not all classes are stable it makes no sense
+// to do this optimization now.
+
+using format_args = basic_format_args<format_context>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+using wformat_args = basic_format_args<wformat_context>;
+#endif
+
+template <class _Context = format_context, class... _Args>
+_LIBCPP_HIDE_FROM_ABI __format_arg_store<_Context, _Args...> make_format_args(_Args&&... __args) {
+  return _VSTD::__format_arg_store<_Context, _Args...>(__args...);
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class... _Args>
+_LIBCPP_HIDE_FROM_ABI __format_arg_store<wformat_context, _Args...> make_wformat_args(_Args&&... __args) {
+  return _VSTD::__format_arg_store<wformat_context, _Args...>(__args...);
+}
+#endif
+
+namespace __format {
+
+/// Helper class parse and handle argument.
+///
+/// When parsing a handle which is not enabled the code is ill-formed.
+/// This helper uses the parser of the appropriate formatter for the stored type.
+template <class _CharT>
+class _LIBCPP_TEMPLATE_VIS __compile_time_handle {
+public:
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr void __parse(basic_format_parse_context<_CharT>& __parse_ctx) const { __parse_(__parse_ctx); }
+
+  template <class _Tp>
+  _LIBCPP_HIDE_FROM_ABI constexpr void __enable() {
+    __parse_ = [](basic_format_parse_context<_CharT>& __parse_ctx) {
+      formatter<_Tp, _CharT> __f;
+      __parse_ctx.advance_to(__f.parse(__parse_ctx));
+    };
+  }
+
+  // Before calling __parse the proper handler needs to be set with __enable.
+  // The default handler isn't a core constant expression.
+  _LIBCPP_HIDE_FROM_ABI constexpr __compile_time_handle()
+      : __parse_([](basic_format_parse_context<_CharT>&) { std::__throw_format_error("Not a handle"); }) {}
+
+private:
+  void (*__parse_)(basic_format_parse_context<_CharT>&);
+};
+
+// Dummy format_context only providing the parts used during constant
+// validation of the basic_format_string.
+template <class _CharT>
+struct _LIBCPP_TEMPLATE_VIS __compile_time_basic_format_context {
+public:
+  using char_type = _CharT;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit __compile_time_basic_format_context(
+      const __arg_t* __args, const __compile_time_handle<_CharT>* __handles, size_t __size)
+      : __args_(__args), __handles_(__handles), __size_(__size) {}
+
+  // During the compile-time validation nothing needs to be written.
+  // Therefore all operations of this iterator are a NOP.
+  struct iterator {
+    _LIBCPP_HIDE_FROM_ABI constexpr iterator& operator=(_CharT) { return *this; }
+    _LIBCPP_HIDE_FROM_ABI constexpr iterator& operator*() { return *this; }
+    _LIBCPP_HIDE_FROM_ABI constexpr iterator operator++(int) { return *this; }
+  };
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __arg_t arg(size_t __id) const {
+    if (__id >= __size_)
+      std::__throw_format_error("Argument index out of bounds");
+    return __args_[__id];
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const __compile_time_handle<_CharT>& __handle(size_t __id) const {
+    if (__id >= __size_)
+      std::__throw_format_error("Argument index out of bounds");
+    return __handles_[__id];
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr iterator out() { return {}; }
+  _LIBCPP_HIDE_FROM_ABI constexpr void advance_to(iterator) {}
+
+private:
+  const __arg_t* __args_;
+  const __compile_time_handle<_CharT>* __handles_;
+  size_t __size_;
+};
+
+_LIBCPP_HIDE_FROM_ABI
+constexpr void __compile_time_validate_integral(__arg_t __type) {
+  switch (__type) {
+  case __arg_t::__int:
+  case __arg_t::__long_long:
+  case __arg_t::__i128:
+  case __arg_t::__unsigned:
+  case __arg_t::__unsigned_long_long:
+  case __arg_t::__u128:
+    return;
+
+  default:
+    std::__throw_format_error("Argument isn't an integral type");
+  }
+}
+
+// _HasPrecision does the formatter have a precision?
+template <class _CharT, class _Tp, bool _HasPrecision = false>
+_LIBCPP_HIDE_FROM_ABI constexpr void
+__compile_time_validate_argument(basic_format_parse_context<_CharT>& __parse_ctx,
+                                 __compile_time_basic_format_context<_CharT>& __ctx) {
+  formatter<_Tp, _CharT> __formatter;
+  __parse_ctx.advance_to(__formatter.parse(__parse_ctx));
+  // [format.string.std]/7
+  // ... If the corresponding formatting argument is not of integral type, or
+  // its value is negative for precision or non-positive for width, an
+  // exception of type format_error is thrown.
+  //
+  // Validate whether the arguments are integrals.
+  if (__formatter.__parser_.__width_as_arg_)
+    __format::__compile_time_validate_integral(__ctx.arg(__formatter.__parser_.__width_));
+
+  if constexpr (_HasPrecision)
+    if (__formatter.__parser_.__precision_as_arg_)
+      __format::__compile_time_validate_integral(__ctx.arg(__formatter.__parser_.__precision_));
+}
+
+// This function is not user facing, so it can directly use the non-standard types of the "variant".
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr void __compile_time_visit_format_arg(basic_format_parse_context<_CharT>& __parse_ctx,
+                                                                     __compile_time_basic_format_context<_CharT>& __ctx,
+                                                                     __arg_t __type) {
+  switch (__type) {
+  case __arg_t::__none:
+    std::__throw_format_error("Invalid argument");
+  case __arg_t::__boolean:
+    return __format::__compile_time_validate_argument<_CharT, bool>(__parse_ctx, __ctx);
+  case __arg_t::__char_type:
+    return __format::__compile_time_validate_argument<_CharT, _CharT>(__parse_ctx, __ctx);
+  case __arg_t::__int:
+    return __format::__compile_time_validate_argument<_CharT, int>(__parse_ctx, __ctx);
+  case __arg_t::__long_long:
+    return __format::__compile_time_validate_argument<_CharT, long long>(__parse_ctx, __ctx);
+  case __arg_t::__i128:
+#      ifndef _LIBCPP_HAS_NO_INT128
+    return __format::__compile_time_validate_argument<_CharT, __int128_t>(__parse_ctx, __ctx);
+#      else
+    std::__throw_format_error("Invalid argument");
+#      endif
+    return;
+  case __arg_t::__unsigned:
+    return __format::__compile_time_validate_argument<_CharT, unsigned>(__parse_ctx, __ctx);
+  case __arg_t::__unsigned_long_long:
+    return __format::__compile_time_validate_argument<_CharT, unsigned long long>(__parse_ctx, __ctx);
+  case __arg_t::__u128:
+#      ifndef _LIBCPP_HAS_NO_INT128
+    return __format::__compile_time_validate_argument<_CharT, __uint128_t>(__parse_ctx, __ctx);
+#      else
+    std::__throw_format_error("Invalid argument");
+#      endif
+    return;
+  case __arg_t::__float:
+    return __format::__compile_time_validate_argument<_CharT, float, true>(__parse_ctx, __ctx);
+  case __arg_t::__double:
+    return __format::__compile_time_validate_argument<_CharT, double, true>(__parse_ctx, __ctx);
+  case __arg_t::__long_double:
+    return __format::__compile_time_validate_argument<_CharT, long double, true>(__parse_ctx, __ctx);
+  case __arg_t::__const_char_type_ptr:
+    return __format::__compile_time_validate_argument<_CharT, const _CharT*, true>(__parse_ctx, __ctx);
+  case __arg_t::__string_view:
+    return __format::__compile_time_validate_argument<_CharT, basic_string_view<_CharT>, true>(__parse_ctx, __ctx);
+  case __arg_t::__ptr:
+    return __format::__compile_time_validate_argument<_CharT, const void*>(__parse_ctx, __ctx);
+  case __arg_t::__handle:
+    std::__throw_format_error("Handle should use __compile_time_validate_handle_argument");
+  }
+  std::__throw_format_error("Invalid argument");
+}
+
+template <class _CharT, class _ParseCtx, class _Ctx>
+_LIBCPP_HIDE_FROM_ABI constexpr const _CharT*
+__handle_replacement_field(const _CharT* __begin, const _CharT* __end,
+                           _ParseCtx& __parse_ctx, _Ctx& __ctx) {
+  __format::__parse_number_result __r = __format::__parse_arg_id(__begin, __end, __parse_ctx);
+
+  bool __parse = *__r.__ptr == _CharT(':');
+  switch (*__r.__ptr) {
+  case _CharT(':'):
+    // The arg-id has a format-specifier, advance the input to the format-spec.
+    __parse_ctx.advance_to(__r.__ptr + 1);
+    break;
+  case _CharT('}'):
+    // The arg-id has no format-specifier.
+    __parse_ctx.advance_to(__r.__ptr);
+    break;
+  default:
+    std::__throw_format_error("The replacement field arg-id should terminate at a ':' or '}'");
+  }
+
+  if constexpr (same_as<_Ctx, __compile_time_basic_format_context<_CharT>>) {
+    __arg_t __type = __ctx.arg(__r.__value);
+    if (__type == __arg_t::__handle)
+      __ctx.__handle(__r.__value).__parse(__parse_ctx);
+    else
+        __format::__compile_time_visit_format_arg(__parse_ctx, __ctx, __type);
+  } else
+    _VSTD::__visit_format_arg(
+        [&](auto __arg) {
+          if constexpr (same_as<decltype(__arg), monostate>)
+            std::__throw_format_error("Argument index out of bounds");
+          else if constexpr (same_as<decltype(__arg), typename basic_format_arg<_Ctx>::handle>)
+            __arg.format(__parse_ctx, __ctx);
+          else {
+            formatter<decltype(__arg), _CharT> __formatter;
+            if (__parse)
+              __parse_ctx.advance_to(__formatter.parse(__parse_ctx));
+            __ctx.advance_to(__formatter.format(__arg, __ctx));
+          }
+        },
+        __ctx.arg(__r.__value));
+
+  __begin = __parse_ctx.begin();
+  if (__begin == __end || *__begin != _CharT('}'))
+    std::__throw_format_error("The replacement field misses a terminating '}'");
+
+  return ++__begin;
+}
+
+template <class _ParseCtx, class _Ctx>
+_LIBCPP_HIDE_FROM_ABI constexpr typename _Ctx::iterator
+__vformat_to(_ParseCtx&& __parse_ctx, _Ctx&& __ctx) {
+  using _CharT = typename _ParseCtx::char_type;
+  static_assert(same_as<typename _Ctx::char_type, _CharT>);
+
+  const _CharT* __begin = __parse_ctx.begin();
+  const _CharT* __end = __parse_ctx.end();
+  typename _Ctx::iterator __out_it = __ctx.out();
+  while (__begin != __end) {
+    switch (*__begin) {
+    case _CharT('{'):
+      ++__begin;
+      if (__begin == __end)
+        std::__throw_format_error("The format string terminates at a '{'");
+
+      if (*__begin != _CharT('{')) [[likely]] {
+        __ctx.advance_to(_VSTD::move(__out_it));
+        __begin =
+            __format::__handle_replacement_field(__begin, __end, __parse_ctx, __ctx);
+        __out_it = __ctx.out();
+
+        // The output is written and __begin points to the next character. So
+        // start the next iteration.
+        continue;
+      }
+      // The string is an escape character.
+      break;
+
+    case _CharT('}'):
+      ++__begin;
+      if (__begin == __end || *__begin != _CharT('}'))
+        std::__throw_format_error("The format string contains an invalid escape sequence");
+
+      break;
+    }
+
+    // Copy the character to the output verbatim.
+    *__out_it++ = *__begin++;
+  }
+  return __out_it;
+}
+
+} // namespace __format
+
+template <class _CharT, class... _Args>
+struct _LIBCPP_TEMPLATE_VIS basic_format_string {
+  template <class _Tp>
+    requires convertible_to<const _Tp&, basic_string_view<_CharT>>
+  consteval basic_format_string(const _Tp& __str) : __str_{__str} {
+    __format::__vformat_to(basic_format_parse_context<_CharT>{__str_, sizeof...(_Args)},
+                           _Context{__types_.data(), __handles_.data(), sizeof...(_Args)});
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT constexpr basic_string_view<_CharT> get() const noexcept {
+    return __str_;
+  }
+
+private:
+  basic_string_view<_CharT> __str_;
+
+  using _Context = __format::__compile_time_basic_format_context<_CharT>;
+
+  static constexpr array<__format::__arg_t, sizeof...(_Args)> __types_{
+      __format::__determine_arg_t<_Context, remove_cvref_t<_Args>>()...};
+
+  // TODO FMT remove this work-around when the AIX ICE has been resolved.
+#    if defined(_AIX) && defined(_LIBCPP_CLANG_VER) && _LIBCPP_CLANG_VER < 1400
+  template <class _Tp>
+  static constexpr __format::__compile_time_handle<_CharT> __get_handle() {
+    __format::__compile_time_handle<_CharT> __handle;
+    if (__format::__determine_arg_t<_Context, _Tp>() == __format::__arg_t::__handle)
+      __handle.template __enable<_Tp>();
+
+    return __handle;
+  }
+
+  static constexpr array<__format::__compile_time_handle<_CharT>, sizeof...(_Args)> __handles_{
+      __get_handle<_Args>()...};
+#    else
+  static constexpr array<__format::__compile_time_handle<_CharT>, sizeof...(_Args)> __handles_{[] {
+    using _Tp = remove_cvref_t<_Args>;
+    __format::__compile_time_handle<_CharT> __handle;
+    if (__format::__determine_arg_t<_Context, _Tp>() == __format::__arg_t::__handle)
+      __handle.template __enable<_Tp>();
+
+    return __handle;
+  }()...};
+#    endif
+};
+
+template <class... _Args>
+using format_string = basic_format_string<char, type_identity_t<_Args>...>;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class... _Args>
+using wformat_string = basic_format_string<wchar_t, type_identity_t<_Args>...>;
+#endif
+
+template <class _OutIt, class _CharT, class _FormatOutIt>
+requires(output_iterator<_OutIt, const _CharT&>) _LIBCPP_HIDE_FROM_ABI _OutIt
+    __vformat_to(
+        _OutIt __out_it, basic_string_view<_CharT> __fmt,
+        basic_format_args<basic_format_context<_FormatOutIt, _CharT>> __args) {
+  if constexpr (same_as<_OutIt, _FormatOutIt>)
+    return _VSTD::__format::__vformat_to(basic_format_parse_context{__fmt, __args.__size()},
+                                         _VSTD::__format_context_create(_VSTD::move(__out_it), __args));
+  else {
+    __format::__format_buffer<_OutIt, _CharT> __buffer{_VSTD::move(__out_it)};
+    _VSTD::__format::__vformat_to(basic_format_parse_context{__fmt, __args.__size()},
+                                  _VSTD::__format_context_create(__buffer.__make_output_iterator(), __args));
+    return _VSTD::move(__buffer).__out_it();
+  }
+}
+
+// The function is _LIBCPP_ALWAYS_INLINE since the compiler is bad at inlining
+// https://reviews.llvm.org/D110499#inline-1180704
+// TODO FMT Evaluate whether we want to file a Clang bug report regarding this.
+template <output_iterator<const char&> _OutIt>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT _OutIt
+vformat_to(_OutIt __out_it, string_view __fmt, format_args __args) {
+  return _VSTD::__vformat_to(_VSTD::move(__out_it), __fmt, __args);
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <output_iterator<const wchar_t&> _OutIt>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT _OutIt
+vformat_to(_OutIt __out_it, wstring_view __fmt, wformat_args __args) {
+  return _VSTD::__vformat_to(_VSTD::move(__out_it), __fmt, __args);
+}
+#endif
+
+template <output_iterator<const char&> _OutIt, class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT _OutIt
+format_to(_OutIt __out_it, format_string<_Args...> __fmt, _Args&&... __args) {
+  return _VSTD::vformat_to(_VSTD::move(__out_it), __fmt.get(),
+                           _VSTD::make_format_args(__args...));
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <output_iterator<const wchar_t&> _OutIt, class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT _OutIt
+format_to(_OutIt __out_it, wformat_string<_Args...> __fmt, _Args&&... __args) {
+  return _VSTD::vformat_to(_VSTD::move(__out_it), __fmt.get(),
+                           _VSTD::make_wformat_args(__args...));
+}
+#endif
+
+_LIBCPP_ALWAYS_INLINE inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT string
+vformat(string_view __fmt, format_args __args) {
+  string __res;
+  _VSTD::vformat_to(_VSTD::back_inserter(__res), __fmt, __args);
+  return __res;
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+_LIBCPP_ALWAYS_INLINE inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT wstring
+vformat(wstring_view __fmt, wformat_args __args) {
+  wstring __res;
+  _VSTD::vformat_to(_VSTD::back_inserter(__res), __fmt, __args);
+  return __res;
+}
+#endif
+
+template <class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT string format(format_string<_Args...> __fmt,
+                                                                                      _Args&&... __args) {
+  return _VSTD::vformat(__fmt.get(), _VSTD::make_format_args(__args...));
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT wstring
+format(wformat_string<_Args...> __fmt, _Args&&... __args) {
+  return _VSTD::vformat(__fmt.get(), _VSTD::make_wformat_args(__args...));
+}
+#endif
+
+template <class _Context, class _OutIt, class _CharT>
+_LIBCPP_HIDE_FROM_ABI format_to_n_result<_OutIt> __vformat_to_n(_OutIt __out_it, iter_difference_t<_OutIt> __n,
+                                                                basic_string_view<_CharT> __fmt,
+                                                                basic_format_args<_Context> __args) {
+  __format::__format_to_n_buffer<_OutIt, _CharT> __buffer{_VSTD::move(__out_it), __n};
+  _VSTD::__format::__vformat_to(basic_format_parse_context{__fmt, __args.__size()},
+                                _VSTD::__format_context_create(__buffer.__make_output_iterator(), __args));
+  return _VSTD::move(__buffer).__result();
+}
+
+template <output_iterator<const char&> _OutIt, class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT format_to_n_result<_OutIt>
+format_to_n(_OutIt __out_it, iter_difference_t<_OutIt> __n, format_string<_Args...> __fmt, _Args&&... __args) {
+  return _VSTD::__vformat_to_n<format_context>(_VSTD::move(__out_it), __n, __fmt.get(), _VSTD::make_format_args(__args...));
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <output_iterator<const wchar_t&> _OutIt, class... _Args>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT format_to_n_result<_OutIt>
+format_to_n(_OutIt __out_it, iter_difference_t<_OutIt> __n, wformat_string<_Args...> __fmt,
+            _Args&&... __args) {
+  return _VSTD::__vformat_to_n<wformat_context>(_VSTD::move(__out_it), __n, __fmt.get(), _VSTD::make_wformat_args(__args...));
+}
+#endif
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI size_t __vformatted_size(basic_string_view<_CharT> __fmt, auto __args) {
+  __format::__formatted_size_buffer<_CharT> __buffer;
+  _VSTD::__format::__vformat_to(basic_format_parse_context{__fmt, __args.__size()},
+                                _VSTD::__format_context_create(__buffer.__make_output_iterator(), __args));
+  return _VSTD::move(__buffer).__result();
+}
+
+template <class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT size_t
+formatted_size(format_string<_Args...> __fmt, _Args&&... __args) {
+  return _VSTD::__vformatted_size(__fmt.get(), basic_format_args{_VSTD::make_format_args(__args...)});
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT size_t
+formatted_size(wformat_string<_Args...> __fmt, _Args&&... __args) {
+  return _VSTD::__vformatted_size(__fmt.get(), basic_format_args{_VSTD::make_wformat_args(__args...)});
+}
+#endif
+
+#ifndef _LIBCPP_HAS_NO_LOCALIZATION
+
+template <class _OutIt, class _CharT, class _FormatOutIt>
+requires(output_iterator<_OutIt, const _CharT&>) _LIBCPP_HIDE_FROM_ABI _OutIt
+    __vformat_to(
+        _OutIt __out_it, locale __loc, basic_string_view<_CharT> __fmt,
+        basic_format_args<basic_format_context<_FormatOutIt, _CharT>> __args) {
+  if constexpr (same_as<_OutIt, _FormatOutIt>)
+    return _VSTD::__format::__vformat_to(
+        basic_format_parse_context{__fmt, __args.__size()},
+        _VSTD::__format_context_create(_VSTD::move(__out_it), __args, _VSTD::move(__loc)));
+  else {
+    __format::__format_buffer<_OutIt, _CharT> __buffer{_VSTD::move(__out_it)};
+    _VSTD::__format::__vformat_to(
+        basic_format_parse_context{__fmt, __args.__size()},
+        _VSTD::__format_context_create(__buffer.__make_output_iterator(), __args, _VSTD::move(__loc)));
+    return _VSTD::move(__buffer).__out_it();
+  }
+}
+
+template <output_iterator<const char&> _OutIt>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT _OutIt vformat_to(
+    _OutIt __out_it, locale __loc, string_view __fmt, format_args __args) {
+  return _VSTD::__vformat_to(_VSTD::move(__out_it), _VSTD::move(__loc), __fmt,
+                             __args);
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <output_iterator<const wchar_t&> _OutIt>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT _OutIt vformat_to(
+    _OutIt __out_it, locale __loc, wstring_view __fmt, wformat_args __args) {
+  return _VSTD::__vformat_to(_VSTD::move(__out_it), _VSTD::move(__loc), __fmt,
+                             __args);
+}
+#endif
+
+template <output_iterator<const char&> _OutIt, class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT _OutIt
+format_to(_OutIt __out_it, locale __loc, format_string<_Args...> __fmt, _Args&&... __args) {
+  return _VSTD::vformat_to(_VSTD::move(__out_it), _VSTD::move(__loc), __fmt.get(),
+                           _VSTD::make_format_args(__args...));
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <output_iterator<const wchar_t&> _OutIt, class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT _OutIt
+format_to(_OutIt __out_it, locale __loc, wformat_string<_Args...> __fmt, _Args&&... __args) {
+  return _VSTD::vformat_to(_VSTD::move(__out_it), _VSTD::move(__loc), __fmt.get(),
+                           _VSTD::make_wformat_args(__args...));
+}
+#endif
+
+_LIBCPP_ALWAYS_INLINE inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT string
+vformat(locale __loc, string_view __fmt, format_args __args) {
+  string __res;
+  _VSTD::vformat_to(_VSTD::back_inserter(__res), _VSTD::move(__loc), __fmt,
+                    __args);
+  return __res;
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+_LIBCPP_ALWAYS_INLINE inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT wstring
+vformat(locale __loc, wstring_view __fmt, wformat_args __args) {
+  wstring __res;
+  _VSTD::vformat_to(_VSTD::back_inserter(__res), _VSTD::move(__loc), __fmt,
+                    __args);
+  return __res;
+}
+#endif
+
+template <class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT string format(locale __loc,
+                                                                                      format_string<_Args...> __fmt,
+                                                                                      _Args&&... __args) {
+  return _VSTD::vformat(_VSTD::move(__loc), __fmt.get(),
+                        _VSTD::make_format_args(__args...));
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT wstring
+format(locale __loc, wformat_string<_Args...> __fmt, _Args&&... __args) {
+  return _VSTD::vformat(_VSTD::move(__loc), __fmt.get(),
+                        _VSTD::make_wformat_args(__args...));
+}
+#endif
+
+template <class _Context, class _OutIt, class _CharT>
+_LIBCPP_HIDE_FROM_ABI format_to_n_result<_OutIt> __vformat_to_n(_OutIt __out_it, iter_difference_t<_OutIt> __n,
+                                                                locale __loc, basic_string_view<_CharT> __fmt,
+                                                                basic_format_args<_Context> __args) {
+  __format::__format_to_n_buffer<_OutIt, _CharT> __buffer{_VSTD::move(__out_it), __n};
+  _VSTD::__format::__vformat_to(
+      basic_format_parse_context{__fmt, __args.__size()},
+      _VSTD::__format_context_create(__buffer.__make_output_iterator(), __args, _VSTD::move(__loc)));
+  return _VSTD::move(__buffer).__result();
+}
+
+template <output_iterator<const char&> _OutIt, class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT format_to_n_result<_OutIt>
+format_to_n(_OutIt __out_it, iter_difference_t<_OutIt> __n, locale __loc, format_string<_Args...> __fmt,
+            _Args&&... __args) {
+  return _VSTD::__vformat_to_n<format_context>(_VSTD::move(__out_it), __n, _VSTD::move(__loc), __fmt.get(),
+                                               _VSTD::make_format_args(__args...));
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <output_iterator<const wchar_t&> _OutIt, class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT format_to_n_result<_OutIt>
+format_to_n(_OutIt __out_it, iter_difference_t<_OutIt> __n, locale __loc, wformat_string<_Args...> __fmt,
+            _Args&&... __args) {
+  return _VSTD::__vformat_to_n<wformat_context>(_VSTD::move(__out_it), __n, _VSTD::move(__loc), __fmt.get(),
+                                                _VSTD::make_wformat_args(__args...));
+}
+#endif
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI size_t __vformatted_size(locale __loc, basic_string_view<_CharT> __fmt, auto __args) {
+  __format::__formatted_size_buffer<_CharT> __buffer;
+  _VSTD::__format::__vformat_to(
+      basic_format_parse_context{__fmt, __args.__size()},
+      _VSTD::__format_context_create(__buffer.__make_output_iterator(), __args, _VSTD::move(__loc)));
+  return _VSTD::move(__buffer).__result();
+}
+
+template <class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT size_t
+formatted_size(locale __loc, format_string<_Args...> __fmt, _Args&&... __args) {
+  return _VSTD::__vformatted_size(_VSTD::move(__loc), __fmt.get(), basic_format_args{_VSTD::make_format_args(__args...)});
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class... _Args>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_FORMAT size_t
+formatted_size(locale __loc, wformat_string<_Args...> __fmt, _Args&&... __args) {
+  return _VSTD::__vformatted_size(_VSTD::move(__loc), __fmt.get(), basic_format_args{_VSTD::make_wformat_args(__args...)});
+}
+#endif
+
+#endif // _LIBCPP_HAS_NO_LOCALIZATION
+
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // !defined(_LIBCPP_HAS_NO_INCOMPLETE_FORMAT)
+
+#endif // _LIBCPP___FORMAT_FORMAT_FUNCTIONS
diff --git a/app/src/main/cpp/libcxx/include/__format/format_fwd.h b/app/src/main/cpp/libcxx/include/__format/format_fwd.h
new file mode 100644
index 0000000..f7c72e2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/format_fwd.h
@@ -0,0 +1,39 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMAT_FWD_H
+#define _LIBCPP___FORMAT_FORMAT_FWD_H
+
+#include <__availability>
+#include <__config>
+#include <__iterator/concepts.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _Context>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT basic_format_arg;
+
+template <class _OutIt, class _CharT>
+  requires output_iterator<_OutIt, const _CharT&>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT basic_format_context;
+
+template <class _Tp, class _CharT = char>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter;
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMAT_FWD_H
diff --git a/app/src/main/cpp/libcxx/include/__format/format_parse_context.h b/app/src/main/cpp/libcxx/include/__format/format_parse_context.h
new file mode 100644
index 0000000..30e3a7d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/format_parse_context.h
@@ -0,0 +1,100 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMAT_PARSE_CONTEXT_H
+#define _LIBCPP___FORMAT_FORMAT_PARSE_CONTEXT_H
+
+#include <__config>
+#include <__format/format_error.h>
+#include <string_view>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _CharT>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT basic_format_parse_context {
+public:
+  using char_type = _CharT;
+  using const_iterator = typename basic_string_view<_CharT>::const_iterator;
+  using iterator = const_iterator;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr explicit basic_format_parse_context(basic_string_view<_CharT> __fmt,
+                                                size_t __num_args = 0) noexcept
+      : __begin_(__fmt.begin()),
+        __end_(__fmt.end()),
+        __indexing_(__unknown),
+        __next_arg_id_(0),
+        __num_args_(__num_args) {}
+
+  basic_format_parse_context(const basic_format_parse_context&) = delete;
+  basic_format_parse_context&
+  operator=(const basic_format_parse_context&) = delete;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const_iterator begin() const noexcept {
+    return __begin_;
+  }
+  _LIBCPP_HIDE_FROM_ABI constexpr const_iterator end() const noexcept {
+    return __end_;
+  }
+  _LIBCPP_HIDE_FROM_ABI constexpr void advance_to(const_iterator __it) {
+    __begin_ = __it;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr size_t next_arg_id() {
+    if (__indexing_ == __manual)
+      std::__throw_format_error("Using automatic argument numbering in manual argument numbering mode");
+
+    if (__indexing_ == __unknown)
+      __indexing_ = __automatic;
+    return __next_arg_id_++;
+  }
+  _LIBCPP_HIDE_FROM_ABI constexpr void check_arg_id(size_t __id) {
+    if (__indexing_ == __automatic)
+      std::__throw_format_error("Using manual argument numbering in automatic argument numbering mode");
+
+    if (__indexing_ == __unknown)
+      __indexing_ = __manual;
+
+    // Throws an exception to make the expression a non core constant
+    // expression as required by:
+    // [format.parse.ctx]/11
+    //   Remarks: Call expressions where id >= num_args_ are not core constant
+    //   expressions ([expr.const]).
+    // Note: the Throws clause [format.parse.ctx]/10 doesn't specify the
+    // behavior when id >= num_args_.
+    if (is_constant_evaluated() && __id >= __num_args_)
+      std::__throw_format_error("Argument index outside the valid range");
+  }
+
+private:
+  iterator __begin_;
+  iterator __end_;
+  enum _Indexing { __unknown, __manual, __automatic };
+  _Indexing __indexing_;
+  size_t __next_arg_id_;
+  size_t __num_args_;
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(basic_format_parse_context);
+
+using format_parse_context = basic_format_parse_context<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+using wformat_parse_context = basic_format_parse_context<wchar_t>;
+#endif
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMAT_PARSE_CONTEXT_H
diff --git a/app/src/main/cpp/libcxx/include/__format/format_string.h b/app/src/main/cpp/libcxx/include/__format/format_string.h
new file mode 100644
index 0000000..d9caf86
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/format_string.h
@@ -0,0 +1,163 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMAT_STRING_H
+#define _LIBCPP___FORMAT_FORMAT_STRING_H
+
+#include <__assert>
+#include <__config>
+#include <__format/format_error.h>
+#include <cstddef>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace __format {
+
+template <class _CharT>
+struct _LIBCPP_TEMPLATE_VIS __parse_number_result {
+  const _CharT* __ptr;
+  uint32_t __value;
+};
+
+template <class _CharT>
+__parse_number_result(const _CharT*, uint32_t) -> __parse_number_result<_CharT>;
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr __parse_number_result<_CharT>
+__parse_number(const _CharT* __begin, const _CharT* __end);
+
+/**
+ * The maximum value of a numeric argument.
+ *
+ * This is used for:
+ * * arg-id
+ * * width as value or arg-id.
+ * * precision as value or arg-id.
+ *
+ * The value is compatible with the maximum formatting width and precision
+ * using the `%*` syntax on a 32-bit system.
+ */
+inline constexpr uint32_t __number_max = INT32_MAX;
+
+namespace __detail {
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr __parse_number_result<_CharT>
+__parse_zero(const _CharT* __begin, const _CharT*, auto& __parse_ctx) {
+  __parse_ctx.check_arg_id(0);
+  return {++__begin, 0}; // can never be larger than the maximum.
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr __parse_number_result<_CharT>
+__parse_automatic(const _CharT* __begin, const _CharT*, auto& __parse_ctx) {
+  size_t __value = __parse_ctx.next_arg_id();
+  _LIBCPP_ASSERT(__value <= __number_max,
+                 "Compilers don't support this number of arguments");
+
+  return {__begin, uint32_t(__value)};
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr __parse_number_result<_CharT>
+__parse_manual(const _CharT* __begin, const _CharT* __end, auto& __parse_ctx) {
+  __parse_number_result<_CharT> __r = __format::__parse_number(__begin, __end);
+  __parse_ctx.check_arg_id(__r.__value);
+  return __r;
+}
+
+} // namespace __detail
+
+/**
+ * Parses a number.
+ *
+ * The number is used for the 31-bit values @em width and @em precision. This
+ * allows a maximum value of 2147483647.
+ */
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr __parse_number_result<_CharT>
+__parse_number(const _CharT* __begin, const _CharT* __end_input) {
+  static_assert(__format::__number_max == INT32_MAX,
+                "The algorithm is implemented based on this value.");
+  /*
+   * Limit the input to 9 digits, otherwise we need two checks during every
+   * iteration:
+   * - Are we at the end of the input?
+   * - Does the value exceed width of an uint32_t? (Switching to uint64_t would
+   *   have the same issue, but with a higher maximum.)
+   */
+  const _CharT* __end = __end_input - __begin > 9 ? __begin + 9 : __end_input;
+  uint32_t __value = *__begin - _CharT('0');
+  while (++__begin != __end) {
+    if (*__begin < _CharT('0') || *__begin > _CharT('9'))
+      return {__begin, __value};
+
+    __value = __value * 10 + *__begin - _CharT('0');
+  }
+
+  if (__begin != __end_input && *__begin >= _CharT('0') &&
+      *__begin <= _CharT('9')) {
+
+    /*
+     * There are more than 9 digits, do additional validations:
+     * - Does the 10th digit exceed the maximum allowed value?
+     * - Are there more than 10 digits?
+     * (More than 10 digits always overflows the maximum.)
+     */
+    uint64_t __v = uint64_t(__value) * 10 + *__begin++ - _CharT('0');
+    if (__v > __number_max ||
+        (__begin != __end_input && *__begin >= _CharT('0') &&
+         *__begin <= _CharT('9')))
+      std::__throw_format_error("The numeric value of the format-spec is too large");
+
+    __value = __v;
+  }
+
+  return {__begin, __value};
+}
+
+/**
+ * Multiplexer for all parse functions.
+ *
+ * The parser will return a pointer beyond the last consumed character. This
+ * should be the closing '}' of the arg-id.
+ */
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr __parse_number_result<_CharT>
+__parse_arg_id(const _CharT* __begin, const _CharT* __end, auto& __parse_ctx) {
+  switch (*__begin) {
+  case _CharT('0'):
+    return __detail::__parse_zero(__begin, __end, __parse_ctx);
+
+  case _CharT(':'):
+    // This case is conditionally valid. It's allowed in an arg-id in the
+    // replacement-field, but not in the std-format-spec. The caller can
+    // provide a better diagnostic, so accept it here unconditionally.
+  case _CharT('}'):
+    return __detail::__parse_automatic(__begin, __end, __parse_ctx);
+  }
+  if (*__begin < _CharT('0') || *__begin > _CharT('9'))
+    std::__throw_format_error("The arg-id of the format-spec starts with an invalid character");
+
+  return __detail::__parse_manual(__begin, __end, __parse_ctx);
+}
+
+} // namespace __format
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMAT_STRING_H
diff --git a/app/src/main/cpp/libcxx/include/__format/format_to_n_result.h b/app/src/main/cpp/libcxx/include/__format/format_to_n_result.h
new file mode 100644
index 0000000..f1ed9a0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/format_to_n_result.h
@@ -0,0 +1,35 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMAT_TO_N_RESULT_H
+#define _LIBCPP___FORMAT_FORMAT_TO_N_RESULT_H
+
+#include <__config>
+#include <__iterator/incrementable_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _OutIt>
+struct _LIBCPP_TEMPLATE_VIS format_to_n_result {
+  _OutIt out;
+  iter_difference_t<_OutIt> size;
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(format_to_n_result);
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMAT_TO_N_RESULT_H
diff --git a/app/src/main/cpp/libcxx/include/__format/formatter.h b/app/src/main/cpp/libcxx/include/__format/formatter.h
new file mode 100644
index 0000000..900a09a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/formatter.h
@@ -0,0 +1,54 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMATTER_H
+#define _LIBCPP___FORMAT_FORMATTER_H
+
+#include <__availability>
+#include <__config>
+#include <__format/format_fwd.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+/// The default formatter template.
+///
+/// [format.formatter.spec]/5
+/// If F is a disabled specialization of formatter, these values are false:
+/// - is_default_constructible_v<F>,
+/// - is_copy_constructible_v<F>,
+/// - is_move_constructible_v<F>,
+/// - is_copy_assignable<F>, and
+/// - is_move_assignable<F>.
+template <class _Tp, class _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter {
+  formatter() = delete;
+  formatter(const formatter&) = delete;
+  formatter& operator=(const formatter&) = delete;
+};
+
+#  if _LIBCPP_STD_VER > 20
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr void __set_debug_format(_Tp& __formatter) {
+  if constexpr (requires { __formatter.set_debug_format(); })
+    __formatter.set_debug_format();
+}
+
+#  endif // _LIBCPP_STD_VER > 20
+#endif   // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMATTER_H
diff --git a/app/src/main/cpp/libcxx/include/__format/formatter_bool.h b/app/src/main/cpp/libcxx/include/__format/formatter_bool.h
new file mode 100644
index 0000000..0d005a1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/formatter_bool.h
@@ -0,0 +1,78 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMATTER_BOOL_H
+#define _LIBCPP___FORMAT_FORMATTER_BOOL_H
+
+#include <__algorithm/copy.h>
+#include <__availability>
+#include <__config>
+#include <__debug>
+#include <__format/concepts.h>
+#include <__format/format_error.h>
+#include <__format/format_parse_context.h>
+#include <__format/formatter.h>
+#include <__format/formatter_integral.h>
+#include <__format/parser_std_format_spec.h>
+#include <__utility/unreachable.h>
+#include <string_view>
+
+#ifndef _LIBCPP_HAS_NO_LOCALIZATION
+#  include <locale>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<bool, _CharT> {
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr auto
+  parse(basic_format_parse_context<_CharT>& __parse_ctx) -> decltype(__parse_ctx.begin()) {
+    auto __result = __parser_.__parse(__parse_ctx, __format_spec::__fields_integral);
+    __format_spec::__process_parsed_bool(__parser_);
+    return __result;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI auto format(bool __value, auto& __ctx) const -> decltype(__ctx.out()) {
+    switch (__parser_.__type_) {
+    case __format_spec::__type::__default:
+    case __format_spec::__type::__string:
+      return __formatter::__format_bool(__value, __ctx, __parser_.__get_parsed_std_specifications(__ctx));
+
+    case __format_spec::__type::__binary_lower_case:
+    case __format_spec::__type::__binary_upper_case:
+    case __format_spec::__type::__octal:
+    case __format_spec::__type::__decimal:
+    case __format_spec::__type::__hexadecimal_lower_case:
+    case __format_spec::__type::__hexadecimal_upper_case:
+      // Promotes bool to an integral type. This reduces the number of
+      // instantiations of __format_integer reducing code size.
+      return __formatter::__format_integer(
+          static_cast<unsigned>(__value), __ctx, __parser_.__get_parsed_std_specifications(__ctx));
+
+    default:
+      _LIBCPP_ASSERT(false, "The parse function should have validated the type");
+      __libcpp_unreachable();
+    }
+  }
+
+  __format_spec::__parser<_CharT> __parser_;
+};
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMATTER_BOOL_H
diff --git a/app/src/main/cpp/libcxx/include/__format/formatter_char.h b/app/src/main/cpp/libcxx/include/__format/formatter_char.h
new file mode 100644
index 0000000..8a92e74
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/formatter_char.h
@@ -0,0 +1,93 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMATTER_CHAR_H
+#define _LIBCPP___FORMAT_FORMATTER_CHAR_H
+
+#include <__availability>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/format_parse_context.h>
+#include <__format/formatter.h>
+#include <__format/formatter_integral.h>
+#include <__format/formatter_output.h>
+#include <__format/parser_std_format_spec.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/is_signed.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT __formatter_char {
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr auto
+  parse(basic_format_parse_context<_CharT>& __parse_ctx) -> decltype(__parse_ctx.begin()) {
+    auto __result = __parser_.__parse(__parse_ctx, __format_spec::__fields_integral);
+    __format_spec::__process_parsed_char(__parser_);
+    return __result;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI auto format(_CharT __value, auto& __ctx) const -> decltype(__ctx.out()) {
+    if (__parser_.__type_ == __format_spec::__type::__default || __parser_.__type_ == __format_spec::__type::__char)
+      return __formatter::__format_char(__value, __ctx.out(), __parser_.__get_parsed_std_specifications(__ctx));
+
+#  if _LIBCPP_STD_VER > 20
+    if (__parser_.__type_ == __format_spec::__type::__debug)
+      return __formatter::__format_escaped_char(__value, __ctx.out(), __parser_.__get_parsed_std_specifications(__ctx));
+#  endif
+
+    if constexpr (sizeof(_CharT) <= sizeof(int))
+      // Promotes _CharT to an integral type. This reduces the number of
+      // instantiations of __format_integer reducing code size.
+      return __formatter::__format_integer(
+          static_cast<conditional_t<is_signed_v<_CharT>, int, unsigned>>(__value),
+          __ctx,
+          __parser_.__get_parsed_std_specifications(__ctx));
+    else
+      return __formatter::__format_integer(__value, __ctx, __parser_.__get_parsed_std_specifications(__ctx));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI auto format(char __value, auto& __ctx) const -> decltype(__ctx.out())
+    requires(same_as<_CharT, wchar_t>)
+  {
+    return format(static_cast<wchar_t>(__value), __ctx);
+  }
+
+#  if _LIBCPP_STD_VER > 20
+  _LIBCPP_HIDE_FROM_ABI constexpr void set_debug_format() { __parser_.__type_ = __format_spec::__type::__debug; }
+#  endif
+
+  __format_spec::__parser<_CharT> __parser_;
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<char, char> : public __formatter_char<char> {};
+
+#  ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<char, wchar_t> : public __formatter_char<wchar_t> {};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<wchar_t, wchar_t> : public __formatter_char<wchar_t> {
+};
+
+#  endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMATTER_CHAR_H
diff --git a/app/src/main/cpp/libcxx/include/__format/formatter_floating_point.h b/app/src/main/cpp/libcxx/include/__format/formatter_floating_point.h
new file mode 100644
index 0000000..a544b53
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/formatter_floating_point.h
@@ -0,0 +1,757 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMATTER_FLOATING_POINT_H
+#define _LIBCPP___FORMAT_FORMATTER_FLOATING_POINT_H
+
+#include <__algorithm/copy_n.h>
+#include <__algorithm/find.h>
+#include <__algorithm/max.h>
+#include <__algorithm/min.h>
+#include <__algorithm/rotate.h>
+#include <__algorithm/transform.h>
+#include <__concepts/arithmetic.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/format_parse_context.h>
+#include <__format/formatter.h>
+#include <__format/formatter_integral.h>
+#include <__format/formatter_output.h>
+#include <__format/parser_std_format_spec.h>
+#include <__memory/allocator.h>
+#include <__utility/move.h>
+#include <__utility/unreachable.h>
+#include <charconv>
+
+#ifndef _LIBCPP_HAS_NO_LOCALIZATION
+#  include <locale>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace __formatter {
+
+template <floating_point _Tp>
+_LIBCPP_HIDE_FROM_ABI char* __to_buffer(char* __first, char* __last, _Tp __value) {
+  to_chars_result __r = _VSTD::to_chars(__first, __last, __value);
+  _LIBCPP_ASSERT(__r.ec == errc(0), "Internal buffer too small");
+  return __r.ptr;
+}
+
+template <floating_point _Tp>
+_LIBCPP_HIDE_FROM_ABI char* __to_buffer(char* __first, char* __last, _Tp __value, chars_format __fmt) {
+  to_chars_result __r = _VSTD::to_chars(__first, __last, __value, __fmt);
+  _LIBCPP_ASSERT(__r.ec == errc(0), "Internal buffer too small");
+  return __r.ptr;
+}
+
+template <floating_point _Tp>
+_LIBCPP_HIDE_FROM_ABI char* __to_buffer(char* __first, char* __last, _Tp __value, chars_format __fmt, int __precision) {
+  to_chars_result __r = _VSTD::to_chars(__first, __last, __value, __fmt, __precision);
+  _LIBCPP_ASSERT(__r.ec == errc(0), "Internal buffer too small");
+  return __r.ptr;
+}
+
+// https://en.cppreference.com/w/cpp/language/types#cite_note-1
+// float             min subnormal: +/-0x1p-149   max: +/- 3.402,823,4 10^38
+// double            min subnormal: +/-0x1p-1074  max  +/- 1.797,693,134,862,315,7 10^308
+// long double (x86) min subnormal: +/-0x1p-16446 max: +/- 1.189,731,495,357,231,765,021 10^4932
+//
+// The maximum number of digits required for the integral part is based on the
+// maximum's value power of 10. Every power of 10 requires one additional
+// decimal digit.
+// The maximum number of digits required for the fractional part is based on
+// the minimal subnormal hexadecimal output's power of 10. Every division of a
+// fraction's binary 1 by 2, requires one additional decimal digit.
+//
+// The maximum size of a formatted value depends on the selected output format.
+// Ignoring the fact the format string can request a precision larger than the
+// values maximum required, these values are:
+//
+// sign                    1 code unit
+// __max_integral
+// radix point             1 code unit
+// __max_fractional
+// exponent character      1 code unit
+// sign                    1 code unit
+// __max_fractional_value
+// -----------------------------------
+// total                   4 code units extra required.
+//
+// TODO FMT Optimize the storage to avoid storing digits that are known to be zero.
+// https://www.exploringbinary.com/maximum-number-of-decimal-digits-in-binary-floating-point-numbers/
+
+// TODO FMT Add long double specialization when to_chars has proper long double support.
+template <class _Tp>
+struct __traits;
+
+template <floating_point _Fp>
+_LIBCPP_HIDE_FROM_ABI constexpr size_t __float_buffer_size(int __precision) {
+  using _Traits = __traits<_Fp>;
+  return 4 + _Traits::__max_integral + __precision + _Traits::__max_fractional_value;
+}
+
+template <>
+struct __traits<float> {
+  static constexpr int __max_integral = 38;
+  static constexpr int __max_fractional = 149;
+  static constexpr int __max_fractional_value = 3;
+  static constexpr size_t __stack_buffer_size = 256;
+
+  static constexpr int __hex_precision_digits = 3;
+};
+
+template <>
+struct __traits<double> {
+  static constexpr int __max_integral = 308;
+  static constexpr int __max_fractional = 1074;
+  static constexpr int __max_fractional_value = 4;
+  static constexpr size_t __stack_buffer_size = 1024;
+
+  static constexpr int __hex_precision_digits = 4;
+};
+
+/// Helper class to store the conversion buffer.
+///
+/// Depending on the maxium size required for a value, the buffer is allocated
+/// on the stack or the heap.
+template <floating_point _Fp>
+class _LIBCPP_TEMPLATE_VIS __float_buffer {
+  using _Traits = __traits<_Fp>;
+
+public:
+  // TODO FMT Improve this constructor to do a better estimate.
+  // When using a scientific formatting with a precision of 6 a stack buffer
+  // will always suffice. At the moment that isn't important since floats and
+  // doubles use a stack buffer, unless the precision used in the format string
+  // is large.
+  // When supporting long doubles the __max_integral part becomes 4932 which
+  // may be too much for some platforms. For these cases a better estimate is
+  // required.
+  explicit _LIBCPP_HIDE_FROM_ABI __float_buffer(int __precision)
+      : __precision_(__precision != -1 ? __precision : _Traits::__max_fractional) {
+
+    // When the precision is larger than _Traits::__max_fractional the digits in
+    // the range (_Traits::__max_fractional, precision] will contain the value
+    // zero. There's no need to request to_chars to write these zeros:
+    // - When the value is large a temporary heap buffer needs to be allocated.
+    // - When to_chars writes the values they need to be "copied" to the output:
+    //   - char: std::fill on the output iterator is faster than std::copy.
+    //   - wchar_t: same argument as char, but additional std::copy won't work.
+    //     The input is always a char buffer, so every char in the buffer needs
+    //     to be converted from a char to a wchar_t.
+    if (__precision_ > _Traits::__max_fractional) {
+      __num_trailing_zeros_ = __precision_ - _Traits::__max_fractional;
+      __precision_ = _Traits::__max_fractional;
+    }
+
+    __size_ = __formatter::__float_buffer_size<_Fp>(__precision_);
+    if (__size_ > _Traits::__stack_buffer_size)
+      // The allocated buffer's contents don't need initialization.
+      __begin_ = allocator<char>{}.allocate(__size_);
+    else
+      __begin_ = __buffer_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI ~__float_buffer() {
+    if (__size_ > _Traits::__stack_buffer_size)
+      allocator<char>{}.deallocate(__begin_, __size_);
+  }
+  _LIBCPP_HIDE_FROM_ABI __float_buffer(const __float_buffer&) = delete;
+  _LIBCPP_HIDE_FROM_ABI __float_buffer& operator=(const __float_buffer&) = delete;
+
+  _LIBCPP_HIDE_FROM_ABI char* begin() const { return __begin_; }
+  _LIBCPP_HIDE_FROM_ABI char* end() const { return __begin_ + __size_; }
+
+  _LIBCPP_HIDE_FROM_ABI int __precision() const { return __precision_; }
+  _LIBCPP_HIDE_FROM_ABI int __num_trailing_zeros() const { return __num_trailing_zeros_; }
+  _LIBCPP_HIDE_FROM_ABI void __remove_trailing_zeros() { __num_trailing_zeros_ = 0; }
+  _LIBCPP_HIDE_FROM_ABI void __add_trailing_zeros(int __zeros) { __num_trailing_zeros_ += __zeros; }
+
+private:
+  int __precision_;
+  int __num_trailing_zeros_{0};
+  size_t __size_;
+  char* __begin_;
+  char __buffer_[_Traits::__stack_buffer_size];
+};
+
+struct __float_result {
+  /// Points at the beginning of the integral part in the buffer.
+  ///
+  /// When there's no sign character this points at the start of the buffer.
+  char* __integral;
+
+  /// Points at the radix point, when not present it's the same as \ref __last.
+  char* __radix_point;
+
+  /// Points at the exponent character, when not present it's the same as \ref __last.
+  char* __exponent;
+
+  /// Points beyond the last written element in the buffer.
+  char* __last;
+};
+
+/// Finds the position of the exponent character 'e' at the end of the buffer.
+///
+/// Assuming there is an exponent the input will terminate with
+/// eSdd and eSdddd (S = sign, d = digit)
+///
+/// \returns a pointer to the exponent or __last when not found.
+constexpr inline _LIBCPP_HIDE_FROM_ABI char* __find_exponent(char* __first, char* __last) {
+  ptrdiff_t __size = __last - __first;
+  if (__size >= 4) {
+    __first = __last - _VSTD::min(__size, ptrdiff_t(6));
+    for (; __first != __last - 3; ++__first) {
+      if (*__first == 'e')
+        return __first;
+    }
+  }
+  return __last;
+}
+
+template <class _Fp, class _Tp>
+_LIBCPP_HIDE_FROM_ABI __float_result __format_buffer_default(const __float_buffer<_Fp>& __buffer, _Tp __value,
+                                                             char* __integral) {
+  __float_result __result;
+  __result.__integral = __integral;
+  __result.__last     = __formatter::__to_buffer(__integral, __buffer.end(), __value);
+
+  __result.__exponent = __formatter::__find_exponent(__result.__integral, __result.__last);
+
+  // Constrains:
+  // - There's at least one decimal digit before the radix point.
+  // - The radix point, when present, is placed before the exponent.
+  __result.__radix_point = _VSTD::find(__result.__integral + 1, __result.__exponent, '.');
+
+  // When the radix point isn't found its position is the exponent instead of
+  // __result.__last.
+  if (__result.__radix_point == __result.__exponent)
+    __result.__radix_point = __result.__last;
+
+  // clang-format off
+  _LIBCPP_ASSERT((__result.__integral != __result.__last) &&
+                 (__result.__radix_point == __result.__last || *__result.__radix_point == '.') &&
+                 (__result.__exponent == __result.__last || *__result.__exponent == 'e'),
+                 "Post-condition failure.");
+  // clang-format on
+
+  return __result;
+}
+
+template <class _Fp, class _Tp>
+_LIBCPP_HIDE_FROM_ABI __float_result __format_buffer_hexadecimal_lower_case(const __float_buffer<_Fp>& __buffer,
+                                                                            _Tp __value, int __precision,
+                                                                            char* __integral) {
+  __float_result __result;
+  __result.__integral = __integral;
+  if (__precision == -1)
+    __result.__last = __formatter::__to_buffer(__integral, __buffer.end(), __value, chars_format::hex);
+  else
+    __result.__last = __formatter::__to_buffer(__integral, __buffer.end(), __value, chars_format::hex, __precision);
+
+  // H = one or more hex-digits
+  // S = sign
+  // D = one or more decimal-digits
+  // When the fractional part is zero and no precision the output is 0p+0
+  // else the output is                                              0.HpSD
+  // So testing the second position can differentiate between these two cases.
+  char* __first = __integral + 1;
+  if (*__first == '.') {
+    __result.__radix_point = __first;
+    // One digit is the minimum
+    // 0.hpSd
+    //       ^-- last
+    //     ^---- integral = end of search
+    // ^-------- start of search
+    // 0123456
+    //
+    // Four digits is the maximum
+    // 0.hpSdddd
+    //          ^-- last
+    //        ^---- integral = end of search
+    //    ^-------- start of search
+    // 0123456789
+    static_assert(__traits<_Fp>::__hex_precision_digits <= 4, "Guard against possible underflow.");
+
+    char* __last = __result.__last - 2;
+    __first = __last - __traits<_Fp>::__hex_precision_digits;
+    __result.__exponent = _VSTD::find(__first, __last, 'p');
+  } else {
+    __result.__radix_point = __result.__last;
+    __result.__exponent = __first;
+  }
+
+  // clang-format off
+  _LIBCPP_ASSERT((__result.__integral != __result.__last) &&
+                 (__result.__radix_point == __result.__last || *__result.__radix_point == '.') &&
+                 (__result.__exponent != __result.__last && *__result.__exponent == 'p'),
+                 "Post-condition failure.");
+  // clang-format on
+
+  return __result;
+}
+
+template <class _Fp, class _Tp>
+_LIBCPP_HIDE_FROM_ABI __float_result __format_buffer_hexadecimal_upper_case(const __float_buffer<_Fp>& __buffer,
+                                                                            _Tp __value, int __precision,
+                                                                            char* __integral) {
+  __float_result __result =
+      __formatter::__format_buffer_hexadecimal_lower_case(__buffer, __value, __precision, __integral);
+  _VSTD::transform(__result.__integral, __result.__exponent, __result.__integral, __hex_to_upper);
+  *__result.__exponent = 'P';
+  return __result;
+}
+
+template <class _Fp, class _Tp>
+_LIBCPP_HIDE_FROM_ABI __float_result __format_buffer_scientific_lower_case(const __float_buffer<_Fp>& __buffer,
+                                                                           _Tp __value, int __precision,
+                                                                           char* __integral) {
+  __float_result __result;
+  __result.__integral = __integral;
+  __result.__last =
+      __formatter::__to_buffer(__integral, __buffer.end(), __value, chars_format::scientific, __precision);
+
+  char* __first = __integral + 1;
+  _LIBCPP_ASSERT(__first != __result.__last, "No exponent present");
+  if (*__first == '.') {
+    __result.__radix_point = __first;
+    __result.__exponent    = __formatter::__find_exponent(__first + 1, __result.__last);
+  } else {
+    __result.__radix_point = __result.__last;
+    __result.__exponent = __first;
+  }
+
+  // clang-format off
+  _LIBCPP_ASSERT((__result.__integral != __result.__last) &&
+                 (__result.__radix_point == __result.__last || *__result.__radix_point == '.') &&
+                 (__result.__exponent != __result.__last && *__result.__exponent == 'e'),
+                 "Post-condition failure.");
+  // clang-format on
+  return __result;
+}
+
+template <class _Fp, class _Tp>
+_LIBCPP_HIDE_FROM_ABI __float_result __format_buffer_scientific_upper_case(const __float_buffer<_Fp>& __buffer,
+                                                                           _Tp __value, int __precision,
+                                                                           char* __integral) {
+  __float_result __result =
+      __formatter::__format_buffer_scientific_lower_case(__buffer, __value, __precision, __integral);
+  *__result.__exponent = 'E';
+  return __result;
+}
+
+template <class _Fp, class _Tp>
+_LIBCPP_HIDE_FROM_ABI __float_result __format_buffer_fixed(const __float_buffer<_Fp>& __buffer, _Tp __value,
+                                                           int __precision, char* __integral) {
+  __float_result __result;
+  __result.__integral = __integral;
+  __result.__last     = __formatter::__to_buffer(__integral, __buffer.end(), __value, chars_format::fixed, __precision);
+
+  // When there's no precision there's no radix point.
+  // Else the radix point is placed at __precision + 1 from the end.
+  // By converting __precision to a bool the subtraction can be done
+  // unconditionally.
+  __result.__radix_point = __result.__last - (__precision + bool(__precision));
+  __result.__exponent = __result.__last;
+
+  // clang-format off
+  _LIBCPP_ASSERT((__result.__integral != __result.__last) &&
+                 (__result.__radix_point == __result.__last || *__result.__radix_point == '.') &&
+                 (__result.__exponent == __result.__last),
+                 "Post-condition failure.");
+  // clang-format on
+  return __result;
+}
+
+template <class _Fp, class _Tp>
+_LIBCPP_HIDE_FROM_ABI __float_result __format_buffer_general_lower_case(__float_buffer<_Fp>& __buffer, _Tp __value,
+                                                                        int __precision, char* __integral) {
+
+  __buffer.__remove_trailing_zeros();
+
+  __float_result __result;
+  __result.__integral = __integral;
+  __result.__last = __formatter::__to_buffer(__integral, __buffer.end(), __value, chars_format::general, __precision);
+
+  char* __first = __integral + 1;
+  if (__first == __result.__last) {
+    __result.__radix_point = __result.__last;
+    __result.__exponent = __result.__last;
+  } else {
+    __result.__exponent = __formatter::__find_exponent(__first, __result.__last);
+    if (__result.__exponent != __result.__last)
+      // In scientific mode if there's a radix point it will always be after
+      // the first digit. (This is the position __first points at).
+      __result.__radix_point = *__first == '.' ? __first : __result.__last;
+    else {
+      // In fixed mode the algorithm truncates trailing spaces and possibly the
+      // radix point. There's no good guess for the position of the radix point
+      // therefore scan the output after the first digit.
+
+      __result.__radix_point = _VSTD::find(__first, __result.__last, '.');
+    }
+  }
+
+  // clang-format off
+  _LIBCPP_ASSERT((__result.__integral != __result.__last) &&
+                 (__result.__radix_point == __result.__last || *__result.__radix_point == '.') &&
+                 (__result.__exponent == __result.__last || *__result.__exponent == 'e'),
+                 "Post-condition failure.");
+  // clang-format on
+
+  return __result;
+}
+
+template <class _Fp, class _Tp>
+_LIBCPP_HIDE_FROM_ABI __float_result __format_buffer_general_upper_case(__float_buffer<_Fp>& __buffer, _Tp __value,
+                                                                        int __precision, char* __integral) {
+  __float_result __result = __formatter::__format_buffer_general_lower_case(__buffer, __value, __precision, __integral);
+  if (__result.__exponent != __result.__last)
+    *__result.__exponent = 'E';
+  return __result;
+}
+
+/// Fills the buffer with the data based on the requested formatting.
+///
+/// This function, when needed, turns the characters to upper case and
+/// determines the "interesting" locations which are returned to the caller.
+///
+/// This means the caller never has to convert the contents of the buffer to
+/// upper case or search for radix points and the location of the exponent.
+/// This gives a bit of overhead. The original code didn't do that, but due
+/// to the number of possible additional work needed to turn this number to
+/// the proper output the code was littered with tests for upper cases and
+/// searches for radix points and exponents.
+/// - When a precision larger than the type's precision is selected
+///   additional zero characters need to be written before the exponent.
+/// - alternate form needs to add a radix point when not present.
+/// - localization needs to do grouping in the integral part.
+template <class _Fp, class _Tp>
+// TODO FMT _Fp should just be _Tp when to_chars has proper long double support.
+_LIBCPP_HIDE_FROM_ABI __float_result __format_buffer(
+    __float_buffer<_Fp>& __buffer,
+    _Tp __value,
+    bool __negative,
+    bool __has_precision,
+    __format_spec::__sign __sign,
+    __format_spec::__type __type) {
+  char* __first = __formatter::__insert_sign(__buffer.begin(), __negative, __sign);
+  switch (__type) {
+  case __format_spec::__type::__default:
+    if (__has_precision)
+      return __formatter::__format_buffer_general_lower_case(__buffer, __value, __buffer.__precision(), __first);
+    else
+      return __formatter::__format_buffer_default(__buffer, __value, __first);
+
+  case __format_spec::__type::__hexfloat_lower_case:
+    return __formatter::__format_buffer_hexadecimal_lower_case(
+        __buffer, __value, __has_precision ? __buffer.__precision() : -1, __first);
+
+  case __format_spec::__type::__hexfloat_upper_case:
+    return __formatter::__format_buffer_hexadecimal_upper_case(
+        __buffer, __value, __has_precision ? __buffer.__precision() : -1, __first);
+
+  case __format_spec::__type::__scientific_lower_case:
+    return __formatter::__format_buffer_scientific_lower_case(__buffer, __value, __buffer.__precision(), __first);
+
+  case __format_spec::__type::__scientific_upper_case:
+    return __formatter::__format_buffer_scientific_upper_case(__buffer, __value, __buffer.__precision(), __first);
+
+  case __format_spec::__type::__fixed_lower_case:
+  case __format_spec::__type::__fixed_upper_case:
+    return __formatter::__format_buffer_fixed(__buffer, __value, __buffer.__precision(), __first);
+
+  case __format_spec::__type::__general_lower_case:
+    return __formatter::__format_buffer_general_lower_case(__buffer, __value, __buffer.__precision(), __first);
+
+  case __format_spec::__type::__general_upper_case:
+    return __formatter::__format_buffer_general_upper_case(__buffer, __value, __buffer.__precision(), __first);
+
+  default:
+    _LIBCPP_ASSERT(false, "The parser should have validated the type");
+    __libcpp_unreachable();
+  }
+}
+
+#  ifndef _LIBCPP_HAS_NO_LOCALIZATION
+template <class _OutIt, class _Fp, class _CharT>
+_LIBCPP_HIDE_FROM_ABI _OutIt __format_locale_specific_form(
+    _OutIt __out_it,
+    const __float_buffer<_Fp>& __buffer,
+    const __float_result& __result,
+    _VSTD::locale __loc,
+    __format_spec::__parsed_specifications<_CharT> __specs) {
+  const auto& __np = std::use_facet<numpunct<_CharT>>(__loc);
+  string __grouping = __np.grouping();
+  char* __first = __result.__integral;
+  // When no radix point or exponent are present __last will be __result.__last.
+  char* __last = _VSTD::min(__result.__radix_point, __result.__exponent);
+
+  ptrdiff_t __digits = __last - __first;
+  if (!__grouping.empty()) {
+    if (__digits <= __grouping[0])
+      __grouping.clear();
+    else
+      __grouping = __formatter::__determine_grouping(__digits, __grouping);
+  }
+
+  ptrdiff_t __size =
+      __result.__last - __buffer.begin() + // Formatted string
+      __buffer.__num_trailing_zeros() +    // Not yet rendered zeros
+      __grouping.size() -                  // Grouping contains one
+      !__grouping.empty();                 // additional character
+
+  __formatter::__padding_size_result __padding    = {0, 0};
+  bool __zero_padding                             = __specs.__alignment_ == __format_spec::__alignment::__zero_padding;
+  if (__size < __specs.__width_) {
+    if (__zero_padding) {
+      __specs.__alignment_ = __format_spec::__alignment::__right;
+      __specs.__fill_      = _CharT('0');
+    }
+
+    __padding = __formatter::__padding_size(__size, __specs.__width_, __specs.__alignment_);
+  }
+
+  // sign and (zero padding or alignment)
+  if (__zero_padding && __first != __buffer.begin())
+    *__out_it++ = *__buffer.begin();
+  __out_it = __formatter::__fill(_VSTD::move(__out_it), __padding.__before_, __specs.__fill_);
+  if (!__zero_padding && __first != __buffer.begin())
+    *__out_it++ = *__buffer.begin();
+
+  // integral part
+  if (__grouping.empty()) {
+    __out_it = __formatter::__copy(__first, __digits, _VSTD::move(__out_it));
+  } else {
+    auto __r = __grouping.rbegin();
+    auto __e = __grouping.rend() - 1;
+    _CharT __sep = __np.thousands_sep();
+    // The output is divided in small groups of numbers to write:
+    // - A group before the first separator.
+    // - A separator and a group, repeated for the number of separators.
+    // - A group after the last separator.
+    // This loop achieves that process by testing the termination condition
+    // midway in the loop.
+    while (true) {
+      __out_it = __formatter::__copy(__first, *__r, _VSTD::move(__out_it));
+      __first += *__r;
+
+      if (__r == __e)
+        break;
+
+      ++__r;
+      *__out_it++ = __sep;
+    }
+  }
+
+  // fractional part
+  if (__result.__radix_point != __result.__last) {
+    *__out_it++ = __np.decimal_point();
+    __out_it    = __formatter::__copy(__result.__radix_point + 1, __result.__exponent, _VSTD::move(__out_it));
+    __out_it    = __formatter::__fill(_VSTD::move(__out_it), __buffer.__num_trailing_zeros(), _CharT('0'));
+  }
+
+  // exponent
+  if (__result.__exponent != __result.__last)
+    __out_it = __formatter::__copy(__result.__exponent, __result.__last, _VSTD::move(__out_it));
+
+  // alignment
+  return __formatter::__fill(_VSTD::move(__out_it), __padding.__after_, __specs.__fill_);
+}
+#  endif // _LIBCPP_HAS_NO_LOCALIZATION
+
+template <class _OutIt, class _CharT>
+_LIBCPP_HIDE_FROM_ABI _OutIt __format_floating_point_non_finite(
+    _OutIt __out_it, __format_spec::__parsed_specifications<_CharT> __specs, bool __negative, bool __isnan) {
+  char __buffer[4];
+  char* __last = __formatter::__insert_sign(__buffer, __negative, __specs.__std_.__sign_);
+
+  // to_chars can return inf, infinity, nan, and nan(n-char-sequence).
+  // The format library requires inf and nan.
+  // All in one expression to avoid dangling references.
+  bool __upper_case =
+      __specs.__std_.__type_ == __format_spec::__type::__hexfloat_upper_case ||
+      __specs.__std_.__type_ == __format_spec::__type::__scientific_upper_case ||
+      __specs.__std_.__type_ == __format_spec::__type::__fixed_upper_case ||
+      __specs.__std_.__type_ == __format_spec::__type::__general_upper_case;
+  __last = _VSTD::copy_n(&("infnanINFNAN"[6 * __upper_case + 3 * __isnan]), 3, __last);
+
+  // [format.string.std]/13
+  // A zero (0) character preceding the width field pads the field with
+  // leading zeros (following any indication of sign or base) to the field
+  // width, except when applied to an infinity or NaN.
+  if (__specs.__alignment_ == __format_spec::__alignment::__zero_padding)
+    __specs.__alignment_ = __format_spec::__alignment::__right;
+
+  return __formatter::__write(__buffer, __last, _VSTD::move(__out_it), __specs);
+}
+
+template <floating_point _Tp, class _CharT>
+_LIBCPP_HIDE_FROM_ABI auto
+__format_floating_point(_Tp __value, auto& __ctx, __format_spec::__parsed_specifications<_CharT> __specs)
+    -> decltype(__ctx.out()) {
+  bool __negative = _VSTD::signbit(__value);
+
+  if (!_VSTD::isfinite(__value)) [[unlikely]]
+    return __formatter::__format_floating_point_non_finite(__ctx.out(), __specs, __negative, _VSTD::isnan(__value));
+
+  // Depending on the std-format-spec string the sign and the value
+  // might not be outputted together:
+  // - zero-padding may insert additional '0' characters.
+  // Therefore the value is processed as a non negative value.
+  // The function @ref __insert_sign will insert a '-' when the value was
+  // negative.
+
+  if (__negative)
+    __value = -__value;
+
+  // TODO FMT _Fp should just be _Tp when to_chars has proper long double support.
+  using _Fp = conditional_t<same_as<_Tp, long double>, double, _Tp>;
+  // Force the type of the precision to avoid -1 to become an unsigned value.
+  __float_buffer<_Fp> __buffer(__specs.__precision_);
+  __float_result __result = __formatter::__format_buffer(
+      __buffer, __value, __negative, (__specs.__has_precision()), __specs.__std_.__sign_, __specs.__std_.__type_);
+
+  if (__specs.__std_.__alternate_form_) {
+    if (__result.__radix_point == __result.__last) {
+      *__result.__last++ = '.';
+
+      // When there is an exponent the point needs to be moved before the
+      // exponent. When there's no exponent the rotate does nothing. Since
+      // rotate tests whether the operation is a nop, call it unconditionally.
+      _VSTD::rotate(__result.__exponent, __result.__last - 1, __result.__last);
+      __result.__radix_point = __result.__exponent;
+
+      // The radix point is always placed before the exponent.
+      // - No exponent needs to point to the new last.
+      // - An exponent needs to move one position to the right.
+      // So it's safe to increment the value unconditionally.
+      ++__result.__exponent;
+    }
+
+    // [format.string.std]/6
+    //   In addition, for g and G conversions, trailing zeros are not removed
+    //   from the result.
+    //
+    // If the type option for a floating-point type is none it may use the
+    // general formatting, but it's not a g or G conversion. So in that case
+    // the formatting should not append trailing zeros.
+    bool __is_general = __specs.__std_.__type_ == __format_spec::__type::__general_lower_case ||
+                        __specs.__std_.__type_ == __format_spec::__type::__general_upper_case;
+
+    if (__is_general) {
+      // https://en.cppreference.com/w/c/io/fprintf
+      // Let P equal the precision if nonzero, 6 if the precision is not
+      // specified, or 1 if the precision is 0. Then, if a conversion with
+      // style E would have an exponent of X:
+      int __p = _VSTD::max(1, (__specs.__has_precision() ? __specs.__precision_ : 6));
+      if (__result.__exponent == __result.__last)
+        // if P > X >= -4, the conversion is with style f or F and precision P - 1 - X.
+        // By including the radix point it calculates P - (1 + X)
+        __p -= __result.__radix_point - __buffer.begin();
+      else
+        // otherwise, the conversion is with style e or E and precision P - 1.
+        --__p;
+
+      ptrdiff_t __precision = (__result.__exponent - __result.__radix_point) - 1;
+      if (__precision < __p)
+        __buffer.__add_trailing_zeros(__p - __precision);
+    }
+  }
+
+#  ifndef _LIBCPP_HAS_NO_LOCALIZATION
+  if (__specs.__std_.__locale_specific_form_)
+    return __formatter::__format_locale_specific_form(__ctx.out(), __buffer, __result, __ctx.locale(), __specs);
+#  endif
+
+  ptrdiff_t __size         = __result.__last - __buffer.begin();
+  int __num_trailing_zeros = __buffer.__num_trailing_zeros();
+  if (__size + __num_trailing_zeros >= __specs.__width_) {
+    if (__num_trailing_zeros && __result.__exponent != __result.__last)
+      // Insert trailing zeros before exponent character.
+      return __formatter::__copy(
+          __result.__exponent,
+          __result.__last,
+          __formatter::__fill(__formatter::__copy(__buffer.begin(), __result.__exponent, __ctx.out()),
+                              __num_trailing_zeros,
+                              _CharT('0')));
+
+    return __formatter::__fill(
+        __formatter::__copy(__buffer.begin(), __result.__last, __ctx.out()), __num_trailing_zeros, _CharT('0'));
+  }
+
+  auto __out_it = __ctx.out();
+  char* __first = __buffer.begin();
+  if (__specs.__alignment_ == __format_spec::__alignment ::__zero_padding) {
+    // When there is a sign output it before the padding. Note the __size
+    // doesn't need any adjustment, regardless whether the sign is written
+    // here or in __formatter::__write.
+    if (__first != __result.__integral)
+      *__out_it++ = *__first++;
+    // After the sign is written, zero padding is the same a right alignment
+    // with '0'.
+    __specs.__alignment_ = __format_spec::__alignment::__right;
+    __specs.__fill_      = _CharT('0');
+  }
+
+  if (__num_trailing_zeros)
+    return __formatter::__write_using_trailing_zeros(
+        __first, __result.__last, _VSTD::move(__out_it), __specs, __size, __result.__exponent, __num_trailing_zeros);
+
+  return __formatter::__write(__first, __result.__last, _VSTD::move(__out_it), __specs, __size);
+}
+
+} // namespace __formatter
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS __formatter_floating_point {
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr auto
+  parse(basic_format_parse_context<_CharT>& __parse_ctx) -> decltype(__parse_ctx.begin()) {
+    auto __result = __parser_.__parse(__parse_ctx, __format_spec::__fields_floating_point);
+    __format_spec::__process_parsed_floating_point(__parser_);
+    return __result;
+  }
+
+  template <floating_point _Tp>
+  _LIBCPP_HIDE_FROM_ABI auto format(_Tp __value, auto& __ctx) const -> decltype(__ctx.out()) {
+    return __formatter::__format_floating_point(__value, __ctx, __parser_.__get_parsed_std_specifications(__ctx));
+  }
+
+  __format_spec::__parser<_CharT> __parser_;
+};
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<float, _CharT>
+    : public __formatter_floating_point<_CharT> {};
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<double, _CharT>
+    : public __formatter_floating_point<_CharT> {};
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<long double, _CharT>
+    : public __formatter_floating_point<_CharT> {};
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___FORMAT_FORMATTER_FLOATING_POINT_H
diff --git a/app/src/main/cpp/libcxx/include/__format/formatter_integer.h b/app/src/main/cpp/libcxx/include/__format/formatter_integer.h
new file mode 100644
index 0000000..b4be9f9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/formatter_integer.h
@@ -0,0 +1,107 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMATTER_INTEGER_H
+#define _LIBCPP___FORMAT_FORMATTER_INTEGER_H
+
+#include <__availability>
+#include <__concepts/arithmetic.h>
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/format_parse_context.h>
+#include <__format/formatter.h>
+#include <__format/formatter_integral.h>
+#include <__format/formatter_output.h>
+#include <__format/parser_std_format_spec.h>
+#include <__type_traits/make_32_64_or_128_bit.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+    _LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+    template <__fmt_char_type _CharT>
+    struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT __formatter_integer {
+
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr auto
+  parse(basic_format_parse_context<_CharT>& __parse_ctx) -> decltype(__parse_ctx.begin()) {
+    auto __result = __parser_.__parse(__parse_ctx, __format_spec::__fields_integral);
+    __format_spec::__process_parsed_integer(__parser_);
+    return __result;
+  }
+
+  template <integral _Tp>
+  _LIBCPP_HIDE_FROM_ABI auto format(_Tp __value, auto& __ctx) const -> decltype(__ctx.out()) {
+    __format_spec::__parsed_specifications<_CharT> __specs = __parser_.__get_parsed_std_specifications(__ctx);
+
+    if (__specs.__std_.__type_ == __format_spec::__type::__char)
+      return __formatter::__format_char(__value, __ctx.out(), __specs);
+
+    using _Type = __make_32_64_or_128_bit_t<_Tp>;
+    static_assert(!is_same<_Type, void>::value, "unsupported integral type used in __formatter_integer::__format");
+
+    // Reduce the number of instantiation of the integer formatter
+    return __formatter::__format_integer(static_cast<_Type>(__value), __ctx, __specs);
+  }
+
+  __format_spec::__parser<_CharT> __parser_;
+};
+
+// Signed integral types.
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<signed char, _CharT>
+    : public __formatter_integer<_CharT> {};
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<short, _CharT> : public __formatter_integer<_CharT> {
+};
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<int, _CharT> : public __formatter_integer<_CharT> {};
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<long, _CharT> : public __formatter_integer<_CharT> {};
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<long long, _CharT>
+    : public __formatter_integer<_CharT> {};
+#  ifndef _LIBCPP_HAS_NO_INT128
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<__int128_t, _CharT>
+    : public __formatter_integer<_CharT> {};
+#  endif
+
+// Unsigned integral types.
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<unsigned char, _CharT>
+    : public __formatter_integer<_CharT> {};
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<unsigned short, _CharT>
+    : public __formatter_integer<_CharT> {};
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<unsigned, _CharT>
+    : public __formatter_integer<_CharT> {};
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<unsigned long, _CharT>
+    : public __formatter_integer<_CharT> {};
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<unsigned long long, _CharT>
+    : public __formatter_integer<_CharT> {};
+#  ifndef _LIBCPP_HAS_NO_INT128
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<__uint128_t, _CharT>
+    : public __formatter_integer<_CharT> {};
+#  endif
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMATTER_INTEGER_H
diff --git a/app/src/main/cpp/libcxx/include/__format/formatter_integral.h b/app/src/main/cpp/libcxx/include/__format/formatter_integral.h
new file mode 100644
index 0000000..fe3a063
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/formatter_integral.h
@@ -0,0 +1,363 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMATTER_INTEGRAL_H
+#define _LIBCPP___FORMAT_FORMATTER_INTEGRAL_H
+
+#include <__concepts/arithmetic.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/format_error.h>
+#include <__format/formatter_output.h>
+#include <__format/parser_std_format_spec.h>
+#include <__utility/unreachable.h>
+#include <array>
+#include <charconv>
+#include <limits>
+#include <string>
+
+#ifndef _LIBCPP_HAS_NO_LOCALIZATION
+#  include <locale>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace __formatter {
+
+//
+// Generic
+//
+
+_LIBCPP_HIDE_FROM_ABI inline char* __insert_sign(char* __buf, bool __negative, __format_spec::__sign __sign) {
+  if (__negative)
+    *__buf++ = '-';
+  else
+    switch (__sign) {
+    case __format_spec::__sign::__default:
+    case __format_spec::__sign::__minus:
+      // No sign added.
+      break;
+    case __format_spec::__sign::__plus:
+      *__buf++ = '+';
+      break;
+    case __format_spec::__sign::__space:
+      *__buf++ = ' ';
+      break;
+    }
+
+  return __buf;
+}
+
+/**
+ * Determines the required grouping based on the size of the input.
+ *
+ * The grouping's last element will be repeated. For simplicity this repeating
+ * is unwrapped based on the length of the input. (When the input is short some
+ * groups are not processed.)
+ *
+ * @returns The size of the groups to write. This means the number of
+ * separator characters written is size() - 1.
+ *
+ * @note Since zero-sized groups cause issues they are silently ignored.
+ *
+ * @note The grouping field of the locale is always a @c std::string,
+ * regardless whether the @c std::numpunct's type is @c char or @c wchar_t.
+ */
+_LIBCPP_HIDE_FROM_ABI inline string __determine_grouping(ptrdiff_t __size, const string& __grouping) {
+  _LIBCPP_ASSERT(!__grouping.empty() && __size > __grouping[0],
+                 "The slow grouping formatting is used while there will be no "
+                 "separators written");
+  string __r;
+  auto __end = __grouping.end() - 1;
+  auto __ptr = __grouping.begin();
+
+  while (true) {
+    __size -= *__ptr;
+    if (__size > 0)
+      __r.push_back(*__ptr);
+    else {
+      // __size <= 0 so the value pushed will be <= *__ptr.
+      __r.push_back(*__ptr + __size);
+      return __r;
+    }
+
+    // Proceed to the next group.
+    if (__ptr != __end) {
+      do {
+        ++__ptr;
+        // Skip grouping with a width of 0.
+      } while (*__ptr == 0 && __ptr != __end);
+    }
+  }
+
+  __libcpp_unreachable();
+}
+
+//
+// Char
+//
+
+template <__fmt_char_type _CharT>
+_LIBCPP_HIDE_FROM_ABI auto __format_char(
+    integral auto __value,
+    output_iterator<const _CharT&> auto __out_it,
+    __format_spec::__parsed_specifications<_CharT> __specs) -> decltype(__out_it) {
+  using _Tp = decltype(__value);
+  if constexpr (!same_as<_CharT, _Tp>) {
+    // cmp_less and cmp_greater can't be used for character types.
+    if constexpr (signed_integral<_CharT> == signed_integral<_Tp>) {
+      if (__value < numeric_limits<_CharT>::min() || __value > numeric_limits<_CharT>::max())
+        std::__throw_format_error("Integral value outside the range of the char type");
+    } else if constexpr (signed_integral<_CharT>) {
+      // _CharT is signed _Tp is unsigned
+      if (__value > static_cast<make_unsigned_t<_CharT>>(numeric_limits<_CharT>::max()))
+        std::__throw_format_error("Integral value outside the range of the char type");
+    } else {
+      // _CharT is unsigned _Tp is signed
+      if (__value < 0 || static_cast<make_unsigned_t<_Tp>>(__value) > numeric_limits<_CharT>::max())
+        std::__throw_format_error("Integral value outside the range of the char type");
+    }
+  }
+
+  const auto __c = static_cast<_CharT>(__value);
+  return __formatter::__write(_VSTD::addressof(__c), _VSTD::addressof(__c) + 1, _VSTD::move(__out_it), __specs);
+}
+
+//
+// Integer
+//
+
+/** Wrapper around @ref to_chars, returning the output pointer. */
+template <integral _Tp>
+_LIBCPP_HIDE_FROM_ABI char* __to_buffer(char* __first, char* __last, _Tp __value, int __base) {
+  // TODO FMT Evaluate code overhead due to not calling the internal function
+  // directly. (Should be zero overhead.)
+  to_chars_result __r = _VSTD::to_chars(__first, __last, __value, __base);
+  _LIBCPP_ASSERT(__r.ec == errc(0), "Internal buffer too small");
+  return __r.ptr;
+}
+
+/**
+ * Helper to determine the buffer size to output a integer in Base @em x.
+ *
+ * There are several overloads for the supported bases. The function uses the
+ * base as template argument so it can be used in a constant expression.
+ */
+template <unsigned_integral _Tp, size_t _Base>
+consteval size_t __buffer_size() noexcept
+  requires(_Base == 2)
+{
+  return numeric_limits<_Tp>::digits // The number of binary digits.
+       + 2                           // Reserve space for the '0[Bb]' prefix.
+       + 1;                          // Reserve space for the sign.
+}
+
+template <unsigned_integral _Tp, size_t _Base>
+consteval size_t __buffer_size() noexcept
+  requires(_Base == 8)
+{
+  return numeric_limits<_Tp>::digits // The number of binary digits.
+           / 3                       // Adjust to octal.
+       + 1                           // Turn floor to ceil.
+       + 1                           // Reserve space for the '0' prefix.
+       + 1;                          // Reserve space for the sign.
+}
+
+template <unsigned_integral _Tp, size_t _Base>
+consteval size_t __buffer_size() noexcept
+  requires(_Base == 10)
+{
+  return numeric_limits<_Tp>::digits10 // The floored value.
+       + 1                             // Turn floor to ceil.
+       + 1;                            // Reserve space for the sign.
+}
+
+template <unsigned_integral _Tp, size_t _Base>
+consteval size_t __buffer_size() noexcept
+  requires(_Base == 16)
+{
+  return numeric_limits<_Tp>::digits // The number of binary digits.
+           / 4                       // Adjust to hexadecimal.
+       + 2                           // Reserve space for the '0[Xx]' prefix.
+       + 1;                          // Reserve space for the sign.
+}
+
+template <unsigned_integral _Tp, class _CharT>
+_LIBCPP_HIDE_FROM_ABI auto __format_integer(
+    _Tp __value,
+    auto& __ctx,
+    __format_spec::__parsed_specifications<_CharT> __specs,
+    bool __negative,
+    char* __begin,
+    char* __end,
+    const char* __prefix,
+    int __base) -> decltype(__ctx.out()) {
+  char* __first = __formatter::__insert_sign(__begin, __negative, __specs.__std_.__sign_);
+  if (__specs.__std_.__alternate_form_ && __prefix)
+    while (*__prefix)
+      *__first++ = *__prefix++;
+
+  char* __last = __formatter::__to_buffer(__first, __end, __value, __base);
+
+#  ifndef _LIBCPP_HAS_NO_LOCALIZATION
+  if (__specs.__std_.__locale_specific_form_) {
+    const auto& __np  = std::use_facet<numpunct<_CharT>>(__ctx.locale());
+    string __grouping = __np.grouping();
+    ptrdiff_t __size  = __last - __first;
+    // Writing the grouped form has more overhead than the normal output
+    // routines. If there will be no separators written the locale-specific
+    // form is identical to the normal routine. Test whether to grouped form
+    // is required.
+    if (!__grouping.empty() && __size > __grouping[0])
+      return __formatter::__write_using_decimal_separators(
+          __ctx.out(),
+          __begin,
+          __first,
+          __last,
+          __formatter::__determine_grouping(__size, __grouping),
+          __np.thousands_sep(),
+          __specs);
+  }
+#  endif
+  auto __out_it = __ctx.out();
+  if (__specs.__alignment_ != __format_spec::__alignment::__zero_padding)
+    __first = __begin;
+  else {
+    // __buf contains [sign][prefix]data
+    //                              ^ location of __first
+    // The zero padding is done like:
+    // - Write [sign][prefix]
+    // - Write data right aligned with '0' as fill character.
+    __out_it             = __formatter::__copy(__begin, __first, _VSTD::move(__out_it));
+    __specs.__alignment_ = __format_spec::__alignment::__right;
+    __specs.__fill_      = _CharT('0');
+    int32_t __size       = __first - __begin;
+
+    __specs.__width_ -= _VSTD::min(__size, __specs.__width_);
+  }
+
+  if (__specs.__std_.__type_ != __format_spec::__type::__hexadecimal_upper_case) [[likely]]
+    return __formatter::__write(__first, __last, __ctx.out(), __specs);
+
+  return __formatter::__write_transformed(__first, __last, __ctx.out(), __specs, __formatter::__hex_to_upper);
+}
+
+template <unsigned_integral _Tp, class _CharT>
+_LIBCPP_HIDE_FROM_ABI auto __format_integer(
+    _Tp __value, auto& __ctx, __format_spec::__parsed_specifications<_CharT> __specs, bool __negative = false)
+    -> decltype(__ctx.out()) {
+  switch (__specs.__std_.__type_) {
+  case __format_spec::__type::__binary_lower_case: {
+    array<char, __formatter::__buffer_size<decltype(__value), 2>()> __array;
+    return __formatter::__format_integer(__value, __ctx, __specs, __negative, __array.begin(), __array.end(), "0b", 2);
+  }
+  case __format_spec::__type::__binary_upper_case: {
+    array<char, __formatter::__buffer_size<decltype(__value), 2>()> __array;
+    return __formatter::__format_integer(__value, __ctx, __specs, __negative, __array.begin(), __array.end(), "0B", 2);
+  }
+  case __format_spec::__type::__octal: {
+    // Octal is special; if __value == 0 there's no prefix.
+    array<char, __formatter::__buffer_size<decltype(__value), 8>()> __array;
+    return __formatter::__format_integer(
+        __value, __ctx, __specs, __negative, __array.begin(), __array.end(), __value != 0 ? "0" : nullptr, 8);
+  }
+  case __format_spec::__type::__default:
+  case __format_spec::__type::__decimal: {
+    array<char, __formatter::__buffer_size<decltype(__value), 10>()> __array;
+    return __formatter::__format_integer(
+        __value, __ctx, __specs, __negative, __array.begin(), __array.end(), nullptr, 10);
+  }
+  case __format_spec::__type::__hexadecimal_lower_case: {
+    array<char, __formatter::__buffer_size<decltype(__value), 16>()> __array;
+    return __formatter::__format_integer(__value, __ctx, __specs, __negative, __array.begin(), __array.end(), "0x", 16);
+  }
+  case __format_spec::__type::__hexadecimal_upper_case: {
+    array<char, __formatter::__buffer_size<decltype(__value), 16>()> __array;
+    return __formatter::__format_integer(__value, __ctx, __specs, __negative, __array.begin(), __array.end(), "0X", 16);
+  }
+  default:
+    _LIBCPP_ASSERT(false, "The parse function should have validated the type");
+    __libcpp_unreachable();
+  }
+}
+
+template <signed_integral _Tp, class _CharT>
+_LIBCPP_HIDE_FROM_ABI auto
+__format_integer(_Tp __value, auto& __ctx, __format_spec::__parsed_specifications<_CharT> __specs)
+    -> decltype(__ctx.out()) {
+  // Depending on the std-format-spec string the sign and the value
+  // might not be outputted together:
+  // - alternate form may insert a prefix string.
+  // - zero-padding may insert additional '0' characters.
+  // Therefore the value is processed as a positive unsigned value.
+  // The function @ref __insert_sign will a '-' when the value was negative.
+  auto __r        = std::__to_unsigned_like(__value);
+  bool __negative = __value < 0;
+  if (__negative)
+    __r = std::__complement(__r);
+
+  return __formatter::__format_integer(__r, __ctx, __specs, __negative);
+}
+
+//
+// Formatter arithmetic (bool)
+//
+
+template <class _CharT>
+struct _LIBCPP_TEMPLATE_VIS __bool_strings;
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS __bool_strings<char> {
+  static constexpr string_view __true{"true"};
+  static constexpr string_view __false{"false"};
+};
+
+#  ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+struct _LIBCPP_TEMPLATE_VIS __bool_strings<wchar_t> {
+  static constexpr wstring_view __true{L"true"};
+  static constexpr wstring_view __false{L"false"};
+};
+#  endif
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI auto
+__format_bool(bool __value, auto& __ctx, __format_spec::__parsed_specifications<_CharT> __specs)
+    -> decltype(__ctx.out()) {
+#  ifndef _LIBCPP_HAS_NO_LOCALIZATION
+  if (__specs.__std_.__locale_specific_form_) {
+    const auto& __np           = std::use_facet<numpunct<_CharT>>(__ctx.locale());
+    basic_string<_CharT> __str = __value ? __np.truename() : __np.falsename();
+    return __formatter::__write_string_no_precision(basic_string_view<_CharT>{__str}, __ctx.out(), __specs);
+  }
+#  endif
+  basic_string_view<_CharT> __str =
+      __value ? __formatter::__bool_strings<_CharT>::__true : __formatter::__bool_strings<_CharT>::__false;
+  return __formatter::__write(__str.begin(), __str.end(), __ctx.out(), __specs);
+}
+
+} // namespace __formatter
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___FORMAT_FORMATTER_INTEGRAL_H
diff --git a/app/src/main/cpp/libcxx/include/__format/formatter_output.h b/app/src/main/cpp/libcxx/include/__format/formatter_output.h
new file mode 100644
index 0000000..4676925
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/formatter_output.h
@@ -0,0 +1,570 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMATTER_OUTPUT_H
+#define _LIBCPP___FORMAT_FORMATTER_OUTPUT_H
+
+#include <__algorithm/ranges_copy.h>
+#include <__algorithm/ranges_fill_n.h>
+#include <__algorithm/ranges_transform.h>
+#include <__chrono/statically_widen.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__format/buffer.h>
+#include <__format/concepts.h>
+#include <__format/escaped_output_table.h>
+#include <__format/formatter.h>
+#include <__format/parser_std_format_spec.h>
+#include <__format/unicode.h>
+#include <__iterator/back_insert_iterator.h>
+#include <__type_traits/make_unsigned.h>
+#include <__utility/move.h>
+#include <__utility/unreachable.h>
+#include <charconv>
+#include <cstddef>
+#include <string>
+#include <string_view>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace __formatter {
+
+_LIBCPP_HIDE_FROM_ABI constexpr char __hex_to_upper(char __c) {
+  switch (__c) {
+  case 'a':
+    return 'A';
+  case 'b':
+    return 'B';
+  case 'c':
+    return 'C';
+  case 'd':
+    return 'D';
+  case 'e':
+    return 'E';
+  case 'f':
+    return 'F';
+  }
+  return __c;
+}
+
+struct _LIBCPP_TYPE_VIS __padding_size_result {
+  size_t __before_;
+  size_t __after_;
+};
+
+_LIBCPP_HIDE_FROM_ABI constexpr __padding_size_result
+__padding_size(size_t __size, size_t __width, __format_spec::__alignment __align) {
+  _LIBCPP_ASSERT(__width > __size, "don't call this function when no padding is required");
+  _LIBCPP_ASSERT(
+      __align != __format_spec::__alignment::__zero_padding, "the caller should have handled the zero-padding");
+
+  size_t __fill = __width - __size;
+  switch (__align) {
+  case __format_spec::__alignment::__zero_padding:
+    __libcpp_unreachable();
+
+  case __format_spec::__alignment::__left:
+    return {0, __fill};
+
+  case __format_spec::__alignment::__center: {
+    // The extra padding is divided per [format.string.std]/3
+    // __before = floor(__fill, 2);
+    // __after = ceil(__fill, 2);
+    size_t __before = __fill / 2;
+    size_t __after  = __fill - __before;
+    return {__before, __after};
+  }
+  case __format_spec::__alignment::__default:
+  case __format_spec::__alignment::__right:
+    return {__fill, 0};
+  }
+  __libcpp_unreachable();
+}
+
+/// Copy wrapper.
+///
+/// This uses a "mass output function" of __format::__output_buffer when possible.
+template <__fmt_char_type _CharT, __fmt_char_type _OutCharT = _CharT>
+_LIBCPP_HIDE_FROM_ABI auto __copy(basic_string_view<_CharT> __str, output_iterator<const _OutCharT&> auto __out_it)
+    -> decltype(__out_it) {
+  if constexpr (_VSTD::same_as<decltype(__out_it), _VSTD::back_insert_iterator<__format::__output_buffer<_OutCharT>>>) {
+    __out_it.__get_container()->__copy(__str);
+    return __out_it;
+  } else if constexpr (_VSTD::same_as<decltype(__out_it),
+                                      typename __format::__retarget_buffer<_OutCharT>::__iterator>) {
+    __out_it.__buffer_->__copy(__str);
+    return __out_it;
+  } else {
+    return std::ranges::copy(__str, _VSTD::move(__out_it)).out;
+  }
+}
+
+template <__fmt_char_type _CharT, __fmt_char_type _OutCharT = _CharT>
+_LIBCPP_HIDE_FROM_ABI auto
+__copy(const _CharT* __first, const _CharT* __last, output_iterator<const _OutCharT&> auto __out_it)
+    -> decltype(__out_it) {
+  return __formatter::__copy(basic_string_view{__first, __last}, _VSTD::move(__out_it));
+}
+
+template <__fmt_char_type _CharT, __fmt_char_type _OutCharT = _CharT>
+_LIBCPP_HIDE_FROM_ABI auto __copy(const _CharT* __first, size_t __n, output_iterator<const _OutCharT&> auto __out_it)
+    -> decltype(__out_it) {
+  return __formatter::__copy(basic_string_view{__first, __n}, _VSTD::move(__out_it));
+}
+
+/// Transform wrapper.
+///
+/// This uses a "mass output function" of __format::__output_buffer when possible.
+template <__fmt_char_type _CharT, __fmt_char_type _OutCharT = _CharT, class _UnaryOperation>
+_LIBCPP_HIDE_FROM_ABI auto
+__transform(const _CharT* __first,
+            const _CharT* __last,
+            output_iterator<const _OutCharT&> auto __out_it,
+            _UnaryOperation __operation) -> decltype(__out_it) {
+  if constexpr (_VSTD::same_as<decltype(__out_it), _VSTD::back_insert_iterator<__format::__output_buffer<_OutCharT>>>) {
+    __out_it.__get_container()->__transform(__first, __last, _VSTD::move(__operation));
+    return __out_it;
+  } else if constexpr (_VSTD::same_as<decltype(__out_it),
+                                      typename __format::__retarget_buffer<_OutCharT>::__iterator>) {
+    __out_it.__buffer_->__transform(__first, __last, _VSTD::move(__operation));
+    return __out_it;
+  } else {
+    return std::ranges::transform(__first, __last, _VSTD::move(__out_it), __operation).out;
+  }
+}
+
+/// Fill wrapper.
+///
+/// This uses a "mass output function" of __format::__output_buffer when possible.
+template <__fmt_char_type _CharT, output_iterator<const _CharT&> _OutIt>
+_LIBCPP_HIDE_FROM_ABI _OutIt __fill(_OutIt __out_it, size_t __n, _CharT __value) {
+  if constexpr (_VSTD::same_as<decltype(__out_it), _VSTD::back_insert_iterator<__format::__output_buffer<_CharT>>>) {
+    __out_it.__get_container()->__fill(__n, __value);
+    return __out_it;
+  } else if constexpr (_VSTD::same_as<decltype(__out_it), typename __format::__retarget_buffer<_CharT>::__iterator>) {
+    __out_it.__buffer_->__fill(__n, __value);
+    return __out_it;
+  } else {
+    return std::ranges::fill_n(_VSTD::move(__out_it), __n, __value);
+  }
+}
+
+template <class _OutIt, class _CharT>
+_LIBCPP_HIDE_FROM_ABI _OutIt __write_using_decimal_separators(_OutIt __out_it, const char* __begin, const char* __first,
+                                                              const char* __last, string&& __grouping, _CharT __sep,
+                                                              __format_spec::__parsed_specifications<_CharT> __specs) {
+  int __size = (__first - __begin) +    // [sign][prefix]
+               (__last - __first) +     // data
+               (__grouping.size() - 1); // number of separator characters
+
+  __padding_size_result __padding = {0, 0};
+  if (__specs.__alignment_ == __format_spec::__alignment::__zero_padding) {
+    // Write [sign][prefix].
+    __out_it = __formatter::__copy(__begin, __first, _VSTD::move(__out_it));
+
+    if (__specs.__width_ > __size) {
+      // Write zero padding.
+      __padding.__before_ = __specs.__width_ - __size;
+      __out_it            = __formatter::__fill(_VSTD::move(__out_it), __specs.__width_ - __size, _CharT('0'));
+    }
+  } else {
+    if (__specs.__width_ > __size) {
+      // Determine padding and write padding.
+      __padding = __formatter::__padding_size(__size, __specs.__width_, __specs.__alignment_);
+
+      __out_it = __formatter::__fill(_VSTD::move(__out_it), __padding.__before_, __specs.__fill_);
+    }
+    // Write [sign][prefix].
+    __out_it = __formatter::__copy(__begin, __first, _VSTD::move(__out_it));
+  }
+
+  auto __r = __grouping.rbegin();
+  auto __e = __grouping.rend() - 1;
+  _LIBCPP_ASSERT(__r != __e, "The slow grouping formatting is used while "
+                             "there will be no separators written.");
+  // The output is divided in small groups of numbers to write:
+  // - A group before the first separator.
+  // - A separator and a group, repeated for the number of separators.
+  // - A group after the last separator.
+  // This loop achieves that process by testing the termination condition
+  // midway in the loop.
+  //
+  // TODO FMT This loop evaluates the loop invariant `__parser.__type !=
+  // _Flags::_Type::__hexadecimal_upper_case` for every iteration. (This test
+  // happens in the __write call.) Benchmark whether making two loops and
+  // hoisting the invariant is worth the effort.
+  while (true) {
+    if (__specs.__std_.__type_ == __format_spec::__type::__hexadecimal_upper_case) {
+      __last = __first + *__r;
+      __out_it = __formatter::__transform(__first, __last, _VSTD::move(__out_it), __hex_to_upper);
+      __first = __last;
+    } else {
+      __out_it = __formatter::__copy(__first, *__r, _VSTD::move(__out_it));
+      __first += *__r;
+    }
+
+    if (__r == __e)
+      break;
+
+    ++__r;
+    *__out_it++ = __sep;
+  }
+
+  return __formatter::__fill(_VSTD::move(__out_it), __padding.__after_, __specs.__fill_);
+}
+
+/// Writes the input to the output with the required padding.
+///
+/// Since the output column width is specified the function can be used for
+/// ASCII and Unicode output.
+///
+/// \pre \a __size <= \a __width. Using this function when this pre-condition
+///      doesn't hold incurs an unwanted overhead.
+///
+/// \param __str       The string to write.
+/// \param __out_it    The output iterator to write to.
+/// \param __specs     The parsed formatting specifications.
+/// \param __size      The (estimated) output column width. When the elements
+///                    to be written are ASCII the following condition holds
+///                    \a __size == \a __last - \a __first.
+///
+/// \returns           An iterator pointing beyond the last element written.
+///
+/// \note The type of the elements in range [\a __first, \a __last) can differ
+/// from the type of \a __specs. Integer output uses \c std::to_chars for its
+/// conversion, which means the [\a __first, \a __last) always contains elements
+/// of the type \c char.
+template <class _CharT, class _ParserCharT>
+_LIBCPP_HIDE_FROM_ABI auto
+__write(basic_string_view<_CharT> __str,
+        output_iterator<const _CharT&> auto __out_it,
+        __format_spec::__parsed_specifications<_ParserCharT> __specs,
+        ptrdiff_t __size) -> decltype(__out_it) {
+  if (__size >= __specs.__width_)
+    return __formatter::__copy(__str, _VSTD::move(__out_it));
+
+  __padding_size_result __padding = __formatter::__padding_size(__size, __specs.__width_, __specs.__std_.__alignment_);
+  __out_it                        = __formatter::__fill(_VSTD::move(__out_it), __padding.__before_, __specs.__fill_);
+  __out_it                        = __formatter::__copy(__str, _VSTD::move(__out_it));
+  return __formatter::__fill(_VSTD::move(__out_it), __padding.__after_, __specs.__fill_);
+}
+
+template <class _CharT, class _ParserCharT>
+_LIBCPP_HIDE_FROM_ABI auto
+__write(const _CharT* __first,
+        const _CharT* __last,
+        output_iterator<const _CharT&> auto __out_it,
+        __format_spec::__parsed_specifications<_ParserCharT> __specs,
+        ptrdiff_t __size) -> decltype(__out_it) {
+  _LIBCPP_ASSERT(__first <= __last, "Not a valid range");
+  return __formatter::__write(basic_string_view{__first, __last}, _VSTD::move(__out_it), __specs, __size);
+}
+
+/// \overload
+///
+/// Calls the function above where \a __size = \a __last - \a __first.
+template <class _CharT, class _ParserCharT>
+_LIBCPP_HIDE_FROM_ABI auto
+__write(const _CharT* __first,
+        const _CharT* __last,
+        output_iterator<const _CharT&> auto __out_it,
+        __format_spec::__parsed_specifications<_ParserCharT> __specs) -> decltype(__out_it) {
+  _LIBCPP_ASSERT(__first <= __last, "Not a valid range");
+  return __formatter::__write(__first, __last, _VSTD::move(__out_it), __specs, __last - __first);
+}
+
+template <class _CharT, class _ParserCharT, class _UnaryOperation>
+_LIBCPP_HIDE_FROM_ABI auto __write_transformed(const _CharT* __first, const _CharT* __last,
+                                               output_iterator<const _CharT&> auto __out_it,
+                                               __format_spec::__parsed_specifications<_ParserCharT> __specs,
+                                               _UnaryOperation __op) -> decltype(__out_it) {
+  _LIBCPP_ASSERT(__first <= __last, "Not a valid range");
+
+  ptrdiff_t __size = __last - __first;
+  if (__size >= __specs.__width_)
+    return __formatter::__transform(__first, __last, _VSTD::move(__out_it), __op);
+
+  __padding_size_result __padding = __formatter::__padding_size(__size, __specs.__width_, __specs.__alignment_);
+  __out_it                        = __formatter::__fill(_VSTD::move(__out_it), __padding.__before_, __specs.__fill_);
+  __out_it                        = __formatter::__transform(__first, __last, _VSTD::move(__out_it), __op);
+  return __formatter::__fill(_VSTD::move(__out_it), __padding.__after_, __specs.__fill_);
+}
+
+/// Writes additional zero's for the precision before the exponent.
+/// This is used when the precision requested in the format string is larger
+/// than the maximum precision of the floating-point type. These precision
+/// digits are always 0.
+///
+/// \param __exponent           The location of the exponent character.
+/// \param __num_trailing_zeros The number of 0's to write before the exponent
+///                             character.
+template <class _CharT, class _ParserCharT>
+_LIBCPP_HIDE_FROM_ABI auto __write_using_trailing_zeros(
+    const _CharT* __first,
+    const _CharT* __last,
+    output_iterator<const _CharT&> auto __out_it,
+    __format_spec::__parsed_specifications<_ParserCharT> __specs,
+    size_t __size,
+    const _CharT* __exponent,
+    size_t __num_trailing_zeros) -> decltype(__out_it) {
+  _LIBCPP_ASSERT(__first <= __last, "Not a valid range");
+  _LIBCPP_ASSERT(__num_trailing_zeros > 0, "The overload not writing trailing zeros should have been used");
+
+  __padding_size_result __padding =
+      __formatter::__padding_size(__size + __num_trailing_zeros, __specs.__width_, __specs.__alignment_);
+  __out_it = __formatter::__fill(_VSTD::move(__out_it), __padding.__before_, __specs.__fill_);
+  __out_it = __formatter::__copy(__first, __exponent, _VSTD::move(__out_it));
+  __out_it = __formatter::__fill(_VSTD::move(__out_it), __num_trailing_zeros, _CharT('0'));
+  __out_it = __formatter::__copy(__exponent, __last, _VSTD::move(__out_it));
+  return __formatter::__fill(_VSTD::move(__out_it), __padding.__after_, __specs.__fill_);
+}
+
+/// Writes a string using format's width estimation algorithm.
+///
+/// \pre !__specs.__has_precision()
+///
+/// \note When \c _LIBCPP_HAS_NO_UNICODE is defined the function assumes the
+/// input is ASCII.
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI auto __write_string_no_precision(
+    basic_string_view<_CharT> __str,
+    output_iterator<const _CharT&> auto __out_it,
+    __format_spec::__parsed_specifications<_CharT> __specs) -> decltype(__out_it) {
+  _LIBCPP_ASSERT(!__specs.__has_precision(), "use __write_string");
+
+  // No padding -> copy the string
+  if (!__specs.__has_width())
+    return __formatter::__copy(__str, _VSTD::move(__out_it));
+
+  // Note when the estimated width is larger than size there's no padding. So
+  // there's no reason to get the real size when the estimate is larger than or
+  // equal to the minimum field width.
+  size_t __size =
+      __format_spec::__estimate_column_width(__str, __specs.__width_, __format_spec::__column_width_rounding::__up)
+          .__width_;
+  return __formatter::__write(__str, _VSTD::move(__out_it), __specs, __size);
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI int __truncate(basic_string_view<_CharT>& __str, int __precision) {
+  __format_spec::__column_width_result<_CharT> __result =
+      __format_spec::__estimate_column_width(__str, __precision, __format_spec::__column_width_rounding::__down);
+  __str = basic_string_view<_CharT>{__str.begin(), __result.__last_};
+  return __result.__width_;
+}
+
+/// Writes a string using format's width estimation algorithm.
+///
+/// \note When \c _LIBCPP_HAS_NO_UNICODE is defined the function assumes the
+/// input is ASCII.
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI auto __write_string(
+    basic_string_view<_CharT> __str,
+    output_iterator<const _CharT&> auto __out_it,
+    __format_spec::__parsed_specifications<_CharT> __specs) -> decltype(__out_it) {
+  if (!__specs.__has_precision())
+    return __formatter::__write_string_no_precision(__str, _VSTD::move(__out_it), __specs);
+
+  int __size = __formatter::__truncate(__str, __specs.__precision_);
+
+  return __formatter::__write(__str.begin(), __str.end(), _VSTD::move(__out_it), __specs, __size);
+}
+
+#  if _LIBCPP_STD_VER > 20
+
+struct __nul_terminator {};
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI bool operator==(const _CharT* __cstr, __nul_terminator) {
+  return *__cstr == _CharT('\0');
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI void
+__write_escaped_code_unit(basic_string<_CharT>& __str, char32_t __value, const _CharT* __prefix) {
+  back_insert_iterator __out_it{__str};
+  std::ranges::copy(__prefix, __nul_terminator{}, __out_it);
+
+  char __buffer[8];
+  to_chars_result __r = std::to_chars(std::begin(__buffer), std::end(__buffer), __value, 16);
+  _LIBCPP_ASSERT(__r.ec == errc(0), "Internal buffer too small");
+  std::ranges::copy(std::begin(__buffer), __r.ptr, __out_it);
+
+  __str += _CharT('}');
+}
+
+// [format.string.escaped]/2.2.1.2
+// ...
+// then the sequence \u{hex-digit-sequence} is appended to E, where
+// hex-digit-sequence is the shortest hexadecimal representation of C using
+// lower-case hexadecimal digits.
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI void __write_well_formed_escaped_code_unit(basic_string<_CharT>& __str, char32_t __value) {
+  __formatter::__write_escaped_code_unit(__str, __value, _LIBCPP_STATICALLY_WIDEN(_CharT, "\\u{"));
+}
+
+// [format.string.escaped]/2.2.3
+// Otherwise (X is a sequence of ill-formed code units), each code unit U is
+// appended to E in order as the sequence \x{hex-digit-sequence}, where
+// hex-digit-sequence is the shortest hexadecimal representation of U using
+// lower-case hexadecimal digits.
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI void __write_escape_ill_formed_code_unit(basic_string<_CharT>& __str, char32_t __value) {
+  __formatter::__write_escaped_code_unit(__str, __value, _LIBCPP_STATICALLY_WIDEN(_CharT, "\\x{"));
+}
+
+template <class _CharT>
+[[nodiscard]] _LIBCPP_HIDE_FROM_ABI bool __is_escaped_sequence_written(basic_string<_CharT>& __str, char32_t __value) {
+#    ifdef _LIBCPP_HAS_NO_UNICODE
+  // For ASCII assume everything above 127 is printable.
+  if (__value > 127)
+    return false;
+#    endif
+
+  if (!__escaped_output_table::__needs_escape(__value))
+    return false;
+
+  __formatter::__write_well_formed_escaped_code_unit(__str, __value);
+  return true;
+}
+
+template <class _CharT>
+[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr char32_t __to_char32(_CharT __value) {
+  return static_cast<make_unsigned_t<_CharT>>(__value);
+}
+
+enum class _LIBCPP_ENUM_VIS __escape_quotation_mark { __apostrophe, __double_quote };
+
+// [format.string.escaped]/2
+template <class _CharT>
+[[nodiscard]] _LIBCPP_HIDE_FROM_ABI bool
+__is_escaped_sequence_written(basic_string<_CharT>& __str, char32_t __value, __escape_quotation_mark __mark) {
+  // 2.2.1.1 - Mapped character in [tab:format.escape.sequences]
+  switch (__value) {
+  case _CharT('\t'):
+    __str += _LIBCPP_STATICALLY_WIDEN(_CharT, "\\t");
+    return true;
+  case _CharT('\n'):
+    __str += _LIBCPP_STATICALLY_WIDEN(_CharT, "\\n");
+    return true;
+  case _CharT('\r'):
+    __str += _LIBCPP_STATICALLY_WIDEN(_CharT, "\\r");
+    return true;
+  case _CharT('\''):
+    if (__mark == __escape_quotation_mark::__apostrophe)
+      __str += _LIBCPP_STATICALLY_WIDEN(_CharT, R"(\')");
+    else
+      __str += __value;
+    return true;
+  case _CharT('"'):
+    if (__mark == __escape_quotation_mark::__double_quote)
+      __str += _LIBCPP_STATICALLY_WIDEN(_CharT, R"(\")");
+    else
+      __str += __value;
+    return true;
+  case _CharT('\\'):
+    __str += _LIBCPP_STATICALLY_WIDEN(_CharT, R"(\\)");
+    return true;
+
+  // 2.2.1.2 - Space
+  case _CharT(' '):
+    __str += __value;
+    return true;
+  }
+
+  // 2.2.2
+  //   Otherwise, if X is a shift sequence, the effect on E and further
+  //   decoding of S is unspecified.
+  // For now shift sequences are ignored and treated as Unicode. Other parts
+  // of the format library do the same. It's unknown how ostream treats them.
+  // TODO FMT determine what to do with shift sequences.
+
+  // 2.2.1.2.1 and 2.2.1.2.2 - Escape
+  return __formatter::__is_escaped_sequence_written(__str, __formatter::__to_char32(__value));
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI void
+__escape(basic_string<_CharT>& __str, basic_string_view<_CharT> __values, __escape_quotation_mark __mark) {
+  __unicode::__code_point_view<_CharT> __view{__values.begin(), __values.end()};
+
+  while (!__view.__at_end()) {
+    const _CharT* __first                               = __view.__position();
+    typename __unicode::__consume_p2286_result __result = __view.__consume_p2286();
+    if (__result.__ill_formed_size == 0) {
+      if (!__formatter::__is_escaped_sequence_written(__str, __result.__value, __mark))
+        // 2.2.1.3 - Add the character
+        ranges::copy(__first, __view.__position(), std::back_insert_iterator(__str));
+
+    } else {
+      // 2.2.3 sequence of ill-formed code units
+      // The number of code-units in __result.__value depends on the character type being used.
+      if constexpr (sizeof(_CharT) == 1) {
+        _LIBCPP_ASSERT(__result.__ill_formed_size == 1 || __result.__ill_formed_size == 4,
+                       "illegal number of invalid code units.");
+        if (__result.__ill_formed_size == 1) // ill-formed, one code unit
+          __formatter::__write_escape_ill_formed_code_unit(__str, __result.__value & 0xff);
+        else { // out of valid range, four code units
+               // The code point was properly encoded, decode the value.
+          __formatter::__write_escape_ill_formed_code_unit(__str, __result.__value >> 18 | 0xf0);
+          __formatter::__write_escape_ill_formed_code_unit(__str, (__result.__value >> 12 & 0x3f) | 0x80);
+          __formatter::__write_escape_ill_formed_code_unit(__str, (__result.__value >> 6 & 0x3f) | 0x80);
+          __formatter::__write_escape_ill_formed_code_unit(__str, (__result.__value & 0x3f) | 0x80);
+        }
+      } else if constexpr (sizeof(_CharT) == 2) {
+        _LIBCPP_ASSERT(__result.__ill_formed_size == 1, "for UTF-16 at most one invalid code unit");
+        __formatter::__write_escape_ill_formed_code_unit(__str, __result.__value & 0xffff);
+      } else {
+        static_assert(sizeof(_CharT) == 4, "unsupported character width");
+        _LIBCPP_ASSERT(__result.__ill_formed_size == 1, "for UTF-32 one code unit is one code point");
+        __formatter::__write_escape_ill_formed_code_unit(__str, __result.__value);
+      }
+    }
+  }
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI auto
+__format_escaped_char(_CharT __value,
+                      output_iterator<const _CharT&> auto __out_it,
+                      __format_spec::__parsed_specifications<_CharT> __specs) -> decltype(__out_it) {
+  basic_string<_CharT> __str;
+  __str += _CharT('\'');
+  __formatter::__escape(__str, basic_string_view{std::addressof(__value), 1}, __escape_quotation_mark::__apostrophe);
+  __str += _CharT('\'');
+  return __formatter::__write(__str.data(), __str.data() + __str.size(), _VSTD::move(__out_it), __specs, __str.size());
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI auto
+__format_escaped_string(basic_string_view<_CharT> __values,
+                        output_iterator<const _CharT&> auto __out_it,
+                        __format_spec::__parsed_specifications<_CharT> __specs) -> decltype(__out_it) {
+  basic_string<_CharT> __str;
+  __str += _CharT('"');
+  __formatter::__escape(__str, __values, __escape_quotation_mark::__double_quote);
+  __str += _CharT('"');
+  return __formatter::__write_string(basic_string_view{__str}, _VSTD::move(__out_it), __specs);
+}
+
+#  endif // _LIBCPP_STD_VER > 20
+
+} // namespace __formatter
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMATTER_OUTPUT_H
diff --git a/app/src/main/cpp/libcxx/include/__format/formatter_pointer.h b/app/src/main/cpp/libcxx/include/__format/formatter_pointer.h
new file mode 100644
index 0000000..31b49e1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/formatter_pointer.h
@@ -0,0 +1,73 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMATTER_POINTER_H
+#define _LIBCPP___FORMAT_FORMATTER_POINTER_H
+
+#include <__availability>
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/format_parse_context.h>
+#include <__format/formatter.h>
+#include <__format/formatter_integral.h>
+#include <__format/formatter_output.h>
+#include <__format/parser_std_format_spec.h>
+#include <cstddef>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS __formatter_pointer {
+public:
+  constexpr __formatter_pointer() { __parser_.__alignment_ = __format_spec::__alignment::__right; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto
+  parse(basic_format_parse_context<_CharT>& __parse_ctx) -> decltype(__parse_ctx.begin()) {
+    auto __result = __parser_.__parse(__parse_ctx, __format_spec::__fields_pointer);
+    __format_spec::__process_display_type_pointer(__parser_.__type_);
+    return __result;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI auto format(const void* __ptr, auto& __ctx) const -> decltype(__ctx.out()) {
+    __format_spec::__parsed_specifications<_CharT> __specs = __parser_.__get_parsed_std_specifications(__ctx);
+    __specs.__std_.__alternate_form_                       = true;
+    __specs.__std_.__type_                                 = __format_spec::__type::__hexadecimal_lower_case;
+    return __formatter::__format_integer(reinterpret_cast<uintptr_t>(__ptr), __ctx, __specs);
+  }
+
+  __format_spec::__parser<_CharT> __parser_;
+};
+
+// [format.formatter.spec]/2.4
+// For each charT, the pointer type specializations template<>
+// - struct formatter<nullptr_t, charT>;
+// - template<> struct formatter<void*, charT>;
+// - template<> struct formatter<const void*, charT>;
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<nullptr_t, _CharT>
+    : public __formatter_pointer<_CharT> {};
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<void*, _CharT> : public __formatter_pointer<_CharT> {
+};
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<const void*, _CharT>
+    : public __formatter_pointer<_CharT> {};
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMATTER_POINTER_H
diff --git a/app/src/main/cpp/libcxx/include/__format/formatter_string.h b/app/src/main/cpp/libcxx/include/__format/formatter_string.h
new file mode 100644
index 0000000..606fb79
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/formatter_string.h
@@ -0,0 +1,159 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMATTER_STRING_H
+#define _LIBCPP___FORMAT_FORMATTER_STRING_H
+
+#include <__availability>
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/format_parse_context.h>
+#include <__format/formatter.h>
+#include <__format/formatter_output.h>
+#include <__format/parser_std_format_spec.h>
+#include <__utility/move.h>
+#include <string>
+#include <string_view>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS __formatter_string {
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr auto parse(basic_format_parse_context<_CharT>& __parse_ctx)
+      -> decltype(__parse_ctx.begin()) {
+    auto __result = __parser_.__parse(__parse_ctx, __format_spec::__fields_string);
+    __format_spec::__process_display_type_string(__parser_.__type_);
+    return __result;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI auto format(basic_string_view<_CharT> __str, auto& __ctx) const -> decltype(__ctx.out()) {
+#  if _LIBCPP_STD_VER > 20
+    if (__parser_.__type_ == __format_spec::__type::__debug)
+      return __formatter::__format_escaped_string(__str, __ctx.out(), __parser_.__get_parsed_std_specifications(__ctx));
+#  endif
+
+    return __formatter::__write_string(__str, __ctx.out(), __parser_.__get_parsed_std_specifications(__ctx));
+  }
+
+#  if _LIBCPP_STD_VER > 20
+  _LIBCPP_HIDE_FROM_ABI constexpr void set_debug_format() { __parser_.__type_ = __format_spec::__type::__debug; }
+#  endif
+
+  __format_spec::__parser<_CharT> __parser_{.__alignment_ = __format_spec::__alignment::__left};
+};
+
+// Formatter const char*.
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<const _CharT*, _CharT>
+    : public __formatter_string<_CharT> {
+  using _Base = __formatter_string<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI auto format(const _CharT* __str, auto& __ctx) const -> decltype(__ctx.out()) {
+    _LIBCPP_ASSERT(__str, "The basic_format_arg constructor should have "
+                          "prevented an invalid pointer.");
+
+    __format_spec::__parsed_specifications<_CharT> __specs = _Base::__parser_.__get_parsed_std_specifications(__ctx);
+#  if _LIBCPP_STD_VER > 20
+    if (_Base::__parser_.__type_ == __format_spec::__type::__debug)
+      return __formatter::__format_escaped_string(basic_string_view<_CharT>{__str}, __ctx.out(), __specs);
+#  endif
+
+    // When using a center or right alignment and the width option the length
+    // of __str must be known to add the padding upfront. This case is handled
+    // by the base class by converting the argument to a basic_string_view.
+    //
+    // When using left alignment and the width option the padding is added
+    // after outputting __str so the length can be determined while outputting
+    // __str. The same holds true for the precision, during outputting __str it
+    // can be validated whether the precision threshold has been reached. For
+    // now these optimizations aren't implemented. Instead the base class
+    // handles these options.
+    // TODO FMT Implement these improvements.
+    if (__specs.__has_width() || __specs.__has_precision())
+      return __formatter::__write_string(basic_string_view<_CharT>{__str}, __ctx.out(), __specs);
+
+    // No formatting required, copy the string to the output.
+    auto __out_it = __ctx.out();
+    while (*__str)
+      *__out_it++ = *__str++;
+    return __out_it;
+  }
+};
+
+// Formatter char*.
+template <__fmt_char_type _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<_CharT*, _CharT>
+    : public formatter<const _CharT*, _CharT> {
+  using _Base = formatter<const _CharT*, _CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI auto format(_CharT* __str, auto& __ctx) const -> decltype(__ctx.out()) {
+    return _Base::format(__str, __ctx);
+  }
+};
+
+// Formatter char[].
+template <__fmt_char_type _CharT, size_t _Size>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<_CharT[_Size], _CharT>
+    : public __formatter_string<_CharT> {
+  using _Base = __formatter_string<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI auto format(_CharT __str[_Size], auto& __ctx) const -> decltype(__ctx.out()) {
+    return _Base::format(basic_string_view<_CharT>(__str, _Size), __ctx);
+  }
+};
+
+// Formatter const char[].
+template <__fmt_char_type _CharT, size_t _Size>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<const _CharT[_Size], _CharT>
+    : public __formatter_string<_CharT> {
+  using _Base = __formatter_string<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI auto format(const _CharT __str[_Size], auto& __ctx) const -> decltype(__ctx.out()) {
+    return _Base::format(basic_string_view<_CharT>(__str, _Size), __ctx);
+  }
+};
+
+// Formatter std::string.
+template <__fmt_char_type _CharT, class _Traits, class _Allocator>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<basic_string<_CharT, _Traits, _Allocator>, _CharT>
+    : public __formatter_string<_CharT> {
+  using _Base = __formatter_string<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI auto format(const basic_string<_CharT, _Traits, _Allocator>& __str, auto& __ctx) const
+      -> decltype(__ctx.out()) {
+    // Drop _Traits and _Allocator to have one std::basic_string formatter.
+    return _Base::format(basic_string_view<_CharT>(__str.data(), __str.size()), __ctx);
+  }
+};
+
+// Formatter std::string_view.
+template <__fmt_char_type _CharT, class _Traits>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<basic_string_view<_CharT, _Traits>, _CharT>
+    : public __formatter_string<_CharT> {
+  using _Base = __formatter_string<_CharT>;
+
+  _LIBCPP_HIDE_FROM_ABI auto format(basic_string_view<_CharT, _Traits> __str, auto& __ctx) const
+      -> decltype(__ctx.out()) {
+    // Drop _Traits to have one std::basic_string_view formatter.
+    return _Base::format(basic_string_view<_CharT>(__str.data(), __str.size()), __ctx);
+  }
+};
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMATTER_STRING_H
diff --git a/app/src/main/cpp/libcxx/include/__format/formatter_tuple.h b/app/src/main/cpp/libcxx/include/__format/formatter_tuple.h
new file mode 100644
index 0000000..82f5ada
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/formatter_tuple.h
@@ -0,0 +1,178 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_FORMATTER_TUPLE_H
+#define _LIBCPP___FORMAT_FORMATTER_TUPLE_H
+
+#include <__algorithm/ranges_copy.h>
+#include <__availability>
+#include <__chrono/statically_widen.h>
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/format_args.h>
+#include <__format/format_context.h>
+#include <__format/format_error.h>
+#include <__format/format_parse_context.h>
+#include <__format/formatter.h>
+#include <__format/formatter_output.h>
+#include <__format/parser_std_format_spec.h>
+#include <__iterator/back_insert_iterator.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/integer_sequence.h>
+#include <__utility/pair.h>
+#include <string_view>
+#include <tuple>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 20
+
+template <__fmt_char_type _CharT, class _Tuple, formattable<_CharT>... _Args>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT __formatter_tuple {
+  _LIBCPP_HIDE_FROM_ABI constexpr void set_separator(basic_string_view<_CharT> __separator) {
+    __separator_ = __separator;
+  }
+  _LIBCPP_HIDE_FROM_ABI constexpr void
+  set_brackets(basic_string_view<_CharT> __opening_bracket, basic_string_view<_CharT> __closing_bracket) {
+    __opening_bracket_ = __opening_bracket;
+    __closing_bracket_ = __closing_bracket;
+  }
+
+  template <class _ParseContext>
+  _LIBCPP_HIDE_FROM_ABI constexpr typename _ParseContext::iterator parse(_ParseContext& __parse_ctx) {
+    const _CharT* __begin = __parser_.__parse(__parse_ctx, __format_spec::__fields_tuple);
+
+    // [format.tuple]/7
+    //   ... For each element e in underlying_, if e.set_debug_format()
+    //   is a valid expression, calls e.set_debug_format().
+    // TODO FMT this can be removed when P2733 is accepted.
+    std::__for_each_index_sequence(make_index_sequence<sizeof...(_Args)>(), [&]<size_t _Index> {
+      std::__set_debug_format(std::get<_Index>(__underlying_));
+    });
+
+    const _CharT* __end = __parse_ctx.end();
+    if (__begin == __end)
+      return __begin;
+
+    if (*__begin == _CharT('m')) {
+      if constexpr (sizeof...(_Args) == 2) {
+        set_separator(_LIBCPP_STATICALLY_WIDEN(_CharT, ": "));
+        set_brackets({}, {});
+        ++__begin;
+      } else
+        std::__throw_format_error("The format specifier m requires a pair or a two-element tuple");
+    } else if (*__begin == _CharT('n')) {
+      set_brackets({}, {});
+      ++__begin;
+    }
+
+    if (__begin != __end && *__begin != _CharT('}'))
+      std::__throw_format_error("The format-spec should consume the input or end with a '}'");
+
+    return __begin;
+  }
+
+  template <class _FormatContext>
+  typename _FormatContext::iterator _LIBCPP_HIDE_FROM_ABI
+  format(conditional_t<(formattable<const _Args, _CharT> && ...), const _Tuple&, _Tuple&> __tuple,
+         _FormatContext& __ctx) const {
+    __format_spec::__parsed_specifications<_CharT> __specs = __parser_.__get_parsed_std_specifications(__ctx);
+
+    if (!__specs.__has_width())
+      return __format_tuple(__tuple, __ctx);
+
+    basic_string<_CharT> __str;
+
+    // Since the output is written to a different iterator a new context is
+    // created. Since the underlying formatter uses the default formatting it
+    // doesn't need a locale or the formatting arguments. So creating a new
+    // context works.
+    //
+    // This solution works for this formatter, but it will not work for the
+    // range_formatter. In that patch a generic solution is work in progress.
+    // Once that is finished it can be used here. (The range_formatter will use
+    // these features so it's easier to add it there and then port it.)
+    //
+    // TODO FMT Use formatting wrapping used in the range_formatter.
+    basic_format_context __c = std::__format_context_create(
+        back_insert_iterator{__str},
+        basic_format_args<basic_format_context<back_insert_iterator<basic_string<_CharT>>, _CharT>>{});
+
+    __format_tuple(__tuple, __c);
+
+    return __formatter::__write_string_no_precision(basic_string_view{__str}, __ctx.out(), __specs);
+  }
+
+  template <class _FormatContext>
+  _LIBCPP_HIDE_FROM_ABI typename _FormatContext::iterator __format_tuple(auto&& __tuple, _FormatContext& __ctx) const {
+    __ctx.advance_to(std::ranges::copy(__opening_bracket_, __ctx.out()).out);
+
+    std::__for_each_index_sequence(make_index_sequence<sizeof...(_Args)>(), [&]<size_t _Index> {
+      if constexpr (_Index)
+        __ctx.advance_to(std::ranges::copy(__separator_, __ctx.out()).out);
+
+        // During review Victor suggested to make the exposition only
+        // __underlying_ member a local variable. Currently the Standard
+        // requires nested debug-enabled formatter specializations not to
+        // output escaped output. P2733 fixes that bug, once accepted the
+        // code below can be used.
+        // (Note when a paper allows parsing a tuple-underlying-spec the
+        // exposition only member needs to be a class member. Earlier
+        // revisions of P2286 proposed that, but this was not pursued,
+        // due to time constrains and complexity of the matter.)
+        // TODO FMT This can be updated after P2733 is accepted.
+#  if 0
+      // P2286 uses an exposition only member in the formatter
+      //   tuple<formatter<remove_cvref_t<_Args>, _CharT>...> __underlying_;
+      // This was used in earlier versions of the paper since
+      // __underlying_.parse(...) was called. This is no longer the case
+      // so we can reduce the scope of the formatter.
+      //
+      // It does require the underlying's parse effect to be moved here too.
+      using _Arg = tuple_element<_Index, decltype(__tuple)>;
+      formatter<remove_cvref_t<_Args>, _CharT> __underlying;
+
+      // [format.tuple]/7
+      //   ... For each element e in underlying_, if e.set_debug_format()
+      //   is a valid expression, calls e.set_debug_format().
+      std::__set_debug_format(__underlying);
+#  else
+      __ctx.advance_to(std::get<_Index>(__underlying_).format(std::get<_Index>(__tuple), __ctx));
+#  endif
+    });
+
+    return std::ranges::copy(__closing_bracket_, __ctx.out()).out;
+  }
+
+  __format_spec::__parser<_CharT> __parser_{.__alignment_ = __format_spec::__alignment::__left};
+
+private:
+  tuple<formatter<remove_cvref_t<_Args>, _CharT>...> __underlying_;
+  basic_string_view<_CharT> __separator_       = _LIBCPP_STATICALLY_WIDEN(_CharT, ", ");
+  basic_string_view<_CharT> __opening_bracket_ = _LIBCPP_STATICALLY_WIDEN(_CharT, "(");
+  basic_string_view<_CharT> __closing_bracket_ = _LIBCPP_STATICALLY_WIDEN(_CharT, ")");
+};
+
+template <__fmt_char_type _CharT, formattable<_CharT>... _Args>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<pair<_Args...>, _CharT>
+    : public __formatter_tuple<_CharT, pair<_Args...>, _Args...> {};
+
+template <__fmt_char_type _CharT, formattable<_CharT>... _Args>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<tuple<_Args...>, _CharT>
+    : public __formatter_tuple<_CharT, tuple<_Args...>, _Args...> {};
+
+#endif //_LIBCPP_STD_VER > 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_FORMATTER_TUPLE_H
diff --git a/app/src/main/cpp/libcxx/include/__format/parser_std_format_spec.h b/app/src/main/cpp/libcxx/include/__format/parser_std_format_spec.h
new file mode 100644
index 0000000..c03cec9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/parser_std_format_spec.h
@@ -0,0 +1,954 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_PARSER_STD_FORMAT_SPEC_H
+#define _LIBCPP___FORMAT_PARSER_STD_FORMAT_SPEC_H
+
+/// \file Contains the std-format-spec parser.
+///
+/// Most of the code can be reused in the chrono-format-spec.
+/// This header has some support for the chrono-format-spec since it doesn't
+/// affect the std-format-spec.
+
+#include <__algorithm/find_if.h>
+#include <__algorithm/min.h>
+#include <__assert>
+#include <__concepts/arithmetic.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__debug>
+#include <__format/format_arg.h>
+#include <__format/format_error.h>
+#include <__format/format_parse_context.h>
+#include <__format/format_string.h>
+#include <__format/unicode.h>
+#include <__variant/monostate.h>
+#include <bit>
+#include <cstdint>
+#include <string_view>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace __format_spec {
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr __format::__parse_number_result< _CharT>
+__parse_arg_id(const _CharT* __begin, const _CharT* __end, auto& __parse_ctx) {
+  // This function is a wrapper to call the real parser. But it does the
+  // validation for the pre-conditions and post-conditions.
+  if (__begin == __end)
+    std::__throw_format_error("End of input while parsing format-spec arg-id");
+
+  __format::__parse_number_result __r = __format::__parse_arg_id(__begin, __end, __parse_ctx);
+
+  if (__r.__ptr == __end || *__r.__ptr != _CharT('}'))
+    std::__throw_format_error("Invalid arg-id");
+
+  ++__r.__ptr;
+  return __r;
+}
+
+template <class _Context>
+_LIBCPP_HIDE_FROM_ABI constexpr uint32_t
+__substitute_arg_id(basic_format_arg<_Context> __format_arg) {
+  // [format.string.std]/8
+  //   If the corresponding formatting argument is not of integral type...
+  // This wording allows char and bool too. LWG-3720 changes the wording to
+  //    If the corresponding formatting argument is not of standard signed or
+  //    unsigned integer type,
+  // This means the 128-bit will not be valid anymore.
+  // TODO FMT Verify this resolution is accepted and add a test to verify
+  //          128-bit integrals fail and switch to visit_format_arg.
+  return _VSTD::__visit_format_arg(
+      [](auto __arg) -> uint32_t {
+        using _Type = decltype(__arg);
+        if constexpr (integral<_Type>) {
+          if constexpr (signed_integral<_Type>) {
+            if (__arg < 0)
+              std::__throw_format_error("A format-spec arg-id replacement shouldn't have a negative value");
+          }
+
+          using _CT = common_type_t<_Type, decltype(__format::__number_max)>;
+          if (static_cast<_CT>(__arg) >
+              static_cast<_CT>(__format::__number_max))
+            std::__throw_format_error("A format-spec arg-id replacement exceeds the maximum supported value");
+
+          return __arg;
+        } else if constexpr (same_as<_Type, monostate>)
+          std::__throw_format_error("Argument index out of bounds");
+        else
+          std::__throw_format_error("A format-spec arg-id replacement argument isn't an integral type");
+      },
+      __format_arg);
+}
+
+/// These fields are a filter for which elements to parse.
+///
+/// They default to false so when a new field is added it needs to be opted in
+/// explicitly.
+// TODO FMT Use an ABI tag for this struct.
+struct __fields {
+  uint8_t __sign_ : 1 {false};
+  uint8_t __alternate_form_ : 1 {false};
+  uint8_t __zero_padding_ : 1 {false};
+  uint8_t __precision_ : 1 {false};
+  uint8_t __locale_specific_form_ : 1 {false};
+  uint8_t __type_ : 1 {false};
+  // Determines the valid values for fill.
+  //
+  // Originally the fill could be any character except { and }. Range-based
+  // formatters use the colon to mark the beginning of the
+  // underlying-format-spec. To avoid parsing ambiguities these formatter
+  // specializations prohibit the use of the colon as a fill character.
+  uint8_t __allow_colon_in_fill_ : 1 {false};
+};
+
+// By not placing this constant in the formatter class it's not duplicated for
+// char and wchar_t.
+inline constexpr __fields __fields_integral{
+    .__sign_                 = true,
+    .__alternate_form_       = true,
+    .__zero_padding_         = true,
+    .__locale_specific_form_ = true,
+    .__type_                 = true};
+inline constexpr __fields __fields_floating_point{
+    .__sign_                 = true,
+    .__alternate_form_       = true,
+    .__zero_padding_         = true,
+    .__precision_            = true,
+    .__locale_specific_form_ = true,
+    .__type_                 = true};
+inline constexpr __fields __fields_string{.__precision_ = true, .__type_ = true};
+inline constexpr __fields __fields_pointer{.__type_ = true};
+
+#  if _LIBCPP_STD_VER > 20
+inline constexpr __fields __fields_tuple{.__type_ = false, .__allow_colon_in_fill_ = true};
+inline constexpr __fields __fields_range{.__type_ = false, .__allow_colon_in_fill_ = true};
+#  endif
+
+enum class _LIBCPP_ENUM_VIS __alignment : uint8_t {
+  /// No alignment is set in the format string.
+  __default,
+  __left,
+  __center,
+  __right,
+  __zero_padding
+};
+
+enum class _LIBCPP_ENUM_VIS __sign : uint8_t {
+  /// No sign is set in the format string.
+  ///
+  /// The sign isn't allowed for certain format-types. By using this value
+  /// it's possible to detect whether or not the user explicitly set the sign
+  /// flag. For formatting purposes it behaves the same as \ref __minus.
+  __default,
+  __minus,
+  __plus,
+  __space
+};
+
+enum class _LIBCPP_ENUM_VIS __type : uint8_t {
+  __default,
+  __string,
+  __binary_lower_case,
+  __binary_upper_case,
+  __octal,
+  __decimal,
+  __hexadecimal_lower_case,
+  __hexadecimal_upper_case,
+  __pointer,
+  __char,
+  __hexfloat_lower_case,
+  __hexfloat_upper_case,
+  __scientific_lower_case,
+  __scientific_upper_case,
+  __fixed_lower_case,
+  __fixed_upper_case,
+  __general_lower_case,
+  __general_upper_case,
+  __debug
+};
+
+struct __std {
+  __alignment __alignment_ : 3;
+  __sign __sign_ : 2;
+  bool __alternate_form_ : 1;
+  bool __locale_specific_form_ : 1;
+  __type __type_;
+};
+
+struct __chrono {
+  __alignment __alignment_ : 3;
+  bool __locale_specific_form_ : 1;
+  bool __weekday_name_ : 1;
+  bool __weekday_              : 1;
+  bool __day_of_year_          : 1;
+  bool __week_of_year_         : 1;
+  bool __month_name_ : 1;
+};
+
+/// Contains the parsed formatting specifications.
+///
+/// This contains information for both the std-format-spec and the
+/// chrono-format-spec. This results in some unused members for both
+/// specifications. However these unused members don't increase the size
+/// of the structure.
+///
+/// This struct doesn't cross ABI boundaries so its layout doesn't need to be
+/// kept stable.
+template <class _CharT>
+struct __parsed_specifications {
+  union {
+    // The field __alignment_ is the first element in __std_ and __chrono_.
+    // This allows the code to always inspect this value regards which member
+    // of the union is the active member [class.union.general]/2.
+    //
+    // This is needed since the generic output routines handle the alignment of
+    // the output.
+    __alignment __alignment_ : 3;
+    __std __std_;
+    __chrono __chrono_;
+  };
+
+  /// The requested width.
+  ///
+  /// When the format-spec used an arg-id for this field it has already been
+  /// replaced with the value of that arg-id.
+  int32_t __width_;
+
+  /// The requested precision.
+  ///
+  /// When the format-spec used an arg-id for this field it has already been
+  /// replaced with the value of that arg-id.
+  int32_t __precision_;
+
+  _CharT __fill_;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr bool __has_width() const { return __width_ > 0; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr bool __has_precision() const { return __precision_ >= 0; }
+};
+
+// Validate the struct is small and cheap to copy since the struct is passed by
+// value in formatting functions.
+static_assert(sizeof(__parsed_specifications<char>) == 16);
+static_assert(is_trivially_copyable_v<__parsed_specifications<char>>);
+#  ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+static_assert(sizeof(__parsed_specifications<wchar_t>) == 16);
+static_assert(is_trivially_copyable_v<__parsed_specifications<wchar_t>>);
+#  endif
+
+/// The parser for the std-format-spec.
+///
+/// Note this class is a member of std::formatter specializations. It's
+/// expected developers will create their own formatter specializations that
+/// inherit from the std::formatter specializations. This means this class
+/// must be ABI stable. To aid the stability the unused bits in the class are
+/// set to zero. That way they can be repurposed if a future revision of the
+/// Standards adds new fields to std-format-spec.
+template <class _CharT>
+class _LIBCPP_TEMPLATE_VIS __parser {
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr auto __parse(basic_format_parse_context<_CharT>& __parse_ctx, __fields __fields)
+      -> decltype(__parse_ctx.begin()) {
+
+    const _CharT* __begin = __parse_ctx.begin();
+    const _CharT* __end = __parse_ctx.end();
+    if (__begin == __end)
+      return __begin;
+
+    if (__parse_fill_align(__begin, __end, __fields.__allow_colon_in_fill_) && __begin == __end)
+      return __begin;
+
+    if (__fields.__sign_ && __parse_sign(__begin) && __begin == __end)
+      return __begin;
+
+    if (__fields.__alternate_form_ && __parse_alternate_form(__begin) && __begin == __end)
+      return __begin;
+
+    if (__fields.__zero_padding_ && __parse_zero_padding(__begin) && __begin == __end)
+      return __begin;
+
+    if (__parse_width(__begin, __end, __parse_ctx) && __begin == __end)
+      return __begin;
+
+    if (__fields.__precision_ && __parse_precision(__begin, __end, __parse_ctx) && __begin == __end)
+      return __begin;
+
+    if (__fields.__locale_specific_form_ && __parse_locale_specific_form(__begin) && __begin == __end)
+      return __begin;
+
+    if (__fields.__type_) {
+      __parse_type(__begin);
+
+      // When __type_ is false the calling parser is expected to do additional
+      // parsing. In that case that parser should do the end of format string
+      // validation.
+      if (__begin != __end && *__begin != _CharT('}'))
+        std::__throw_format_error("The format-spec should consume the input or end with a '}'");
+    }
+
+    return __begin;
+  }
+
+  /// \returns the `__parsed_specifications` with the resolved dynamic sizes..
+  _LIBCPP_HIDE_FROM_ABI
+  __parsed_specifications<_CharT> __get_parsed_std_specifications(auto& __ctx) const {
+    return __parsed_specifications<_CharT>{
+        .__std_ = __std{.__alignment_            = __alignment_,
+                        .__sign_                 = __sign_,
+                        .__alternate_form_       = __alternate_form_,
+                        .__locale_specific_form_ = __locale_specific_form_,
+                        .__type_                 = __type_},
+        .__width_{__get_width(__ctx)},
+        .__precision_{__get_precision(__ctx)},
+        .__fill_{__fill_}};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI __parsed_specifications<_CharT> __get_parsed_chrono_specifications(auto& __ctx) const {
+    return __parsed_specifications<_CharT>{
+        .__chrono_ =
+            __chrono{.__alignment_            = __alignment_,
+                     .__locale_specific_form_ = __locale_specific_form_,
+                     .__weekday_name_         = __weekday_name_,
+                     .__weekday_              = __weekday_,
+                     .__day_of_year_          = __day_of_year_,
+                     .__week_of_year_         = __week_of_year_,
+                     .__month_name_           = __month_name_},
+        .__width_{__get_width(__ctx)},
+        .__precision_{__get_precision(__ctx)},
+        .__fill_{__fill_}};
+  }
+
+  __alignment __alignment_ : 3 {__alignment::__default};
+  __sign __sign_ : 2 {__sign::__default};
+  bool __alternate_form_ : 1 {false};
+  bool __locale_specific_form_ : 1 {false};
+  bool __reserved_0_ : 1 {false};
+  __type __type_{__type::__default};
+
+  // These flags are only used for formatting chrono. Since the struct has
+  // padding space left it's added to this structure.
+  bool __weekday_name_ : 1 {false};
+  bool __weekday_      : 1 {false};
+
+  bool __day_of_year_  : 1 {false};
+  bool __week_of_year_ : 1 {false};
+
+  bool __month_name_ : 1 {false};
+
+  uint8_t __reserved_1_ : 3 {0};
+  uint8_t __reserved_2_ : 6 {0};
+  // These two flags are only used internally and not part of the
+  // __parsed_specifications. Therefore put them at the end.
+  bool __width_as_arg_ : 1 {false};
+  bool __precision_as_arg_ : 1 {false};
+
+  /// The requested width, either the value or the arg-id.
+  int32_t __width_{0};
+
+  /// The requested precision, either the value or the arg-id.
+  int32_t __precision_{-1};
+
+  // LWG 3576 will probably change this to always accept a Unicode code point
+  // To avoid changing the size with that change align the field so when it
+  // becomes 32-bit its alignment will remain the same. That also means the
+  // size will remain the same. (D2572 addresses the solution for LWG 3576.)
+  _CharT __fill_{_CharT(' ')};
+
+private:
+  _LIBCPP_HIDE_FROM_ABI constexpr bool __parse_alignment(_CharT __c) {
+    switch (__c) {
+    case _CharT('<'):
+      __alignment_ = __alignment::__left;
+      return true;
+
+    case _CharT('^'):
+      __alignment_ = __alignment::__center;
+      return true;
+
+    case _CharT('>'):
+      __alignment_ = __alignment::__right;
+      return true;
+    }
+    return false;
+  }
+
+  // range-fill and tuple-fill are identical
+  _LIBCPP_HIDE_FROM_ABI constexpr bool
+  __parse_fill_align(const _CharT*& __begin, const _CharT* __end, bool __use_range_fill) {
+    _LIBCPP_ASSERT(__begin != __end, "when called with an empty input the function will cause "
+                                     "undefined behavior by evaluating data not in the input");
+    if (__begin + 1 != __end) {
+      if (__parse_alignment(*(__begin + 1))) {
+        if (__use_range_fill && (*__begin == _CharT('{') || *__begin == _CharT('}') || *__begin == _CharT(':')))
+          std::__throw_format_error("The format-spec range-fill field contains an invalid character");
+        else if (*__begin == _CharT('{') || *__begin == _CharT('}'))
+          std::__throw_format_error("The format-spec fill field contains an invalid character");
+
+        __fill_ = *__begin;
+        __begin += 2;
+        return true;
+      }
+    }
+
+    if (!__parse_alignment(*__begin))
+      return false;
+
+    ++__begin;
+    return true;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr bool __parse_sign(const _CharT*& __begin) {
+    switch (*__begin) {
+    case _CharT('-'):
+      __sign_ = __sign::__minus;
+      break;
+    case _CharT('+'):
+      __sign_ = __sign::__plus;
+      break;
+    case _CharT(' '):
+      __sign_ = __sign::__space;
+      break;
+    default:
+      return false;
+    }
+    ++__begin;
+    return true;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr bool __parse_alternate_form(const _CharT*& __begin) {
+    if (*__begin != _CharT('#'))
+      return false;
+
+    __alternate_form_ = true;
+    ++__begin;
+    return true;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr bool __parse_zero_padding(const _CharT*& __begin) {
+    if (*__begin != _CharT('0'))
+      return false;
+
+    if (__alignment_ == __alignment::__default)
+      __alignment_ = __alignment::__zero_padding;
+    ++__begin;
+    return true;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr bool __parse_width(const _CharT*& __begin, const _CharT* __end, auto& __parse_ctx) {
+    if (*__begin == _CharT('0'))
+      std::__throw_format_error("A format-spec width field shouldn't have a leading zero");
+
+    if (*__begin == _CharT('{')) {
+      __format::__parse_number_result __r = __format_spec::__parse_arg_id(++__begin, __end, __parse_ctx);
+      __width_as_arg_ = true;
+      __width_ = __r.__value;
+      __begin = __r.__ptr;
+      return true;
+    }
+
+    if (*__begin < _CharT('0') || *__begin > _CharT('9'))
+      return false;
+
+    __format::__parse_number_result __r = __format::__parse_number(__begin, __end);
+    __width_ = __r.__value;
+    _LIBCPP_ASSERT(__width_ != 0, "A zero value isn't allowed and should be impossible, "
+                                  "due to validations in this function");
+    __begin = __r.__ptr;
+    return true;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr bool __parse_precision(const _CharT*& __begin, const _CharT* __end,
+                                                         auto& __parse_ctx) {
+    if (*__begin != _CharT('.'))
+      return false;
+
+    ++__begin;
+    if (__begin == __end)
+      std::__throw_format_error("End of input while parsing format-spec precision");
+
+    if (*__begin == _CharT('{')) {
+      __format::__parse_number_result __arg_id = __format_spec::__parse_arg_id(++__begin, __end, __parse_ctx);
+      __precision_as_arg_ = true;
+      __precision_ = __arg_id.__value;
+      __begin = __arg_id.__ptr;
+      return true;
+    }
+
+    if (*__begin < _CharT('0') || *__begin > _CharT('9'))
+      std::__throw_format_error("The format-spec precision field doesn't contain a value or arg-id");
+
+    __format::__parse_number_result __r = __format::__parse_number(__begin, __end);
+    __precision_ = __r.__value;
+    __precision_as_arg_ = false;
+    __begin = __r.__ptr;
+    return true;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr bool __parse_locale_specific_form(const _CharT*& __begin) {
+    if (*__begin != _CharT('L'))
+      return false;
+
+    __locale_specific_form_ = true;
+    ++__begin;
+    return true;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr void __parse_type(const _CharT*& __begin) {
+    // Determines the type. It does not validate whether the selected type is
+    // valid. Most formatters have optional fields that are only allowed for
+    // certain types. These parsers need to do validation after the type has
+    // been parsed. So its easier to implement the validation for all types in
+    // the specific parse function.
+    switch (*__begin) {
+    case 'A':
+      __type_ = __type::__hexfloat_upper_case;
+      break;
+    case 'B':
+      __type_ = __type::__binary_upper_case;
+      break;
+    case 'E':
+      __type_ = __type::__scientific_upper_case;
+      break;
+    case 'F':
+      __type_ = __type::__fixed_upper_case;
+      break;
+    case 'G':
+      __type_ = __type::__general_upper_case;
+      break;
+    case 'X':
+      __type_ = __type::__hexadecimal_upper_case;
+      break;
+    case 'a':
+      __type_ = __type::__hexfloat_lower_case;
+      break;
+    case 'b':
+      __type_ = __type::__binary_lower_case;
+      break;
+    case 'c':
+      __type_ = __type::__char;
+      break;
+    case 'd':
+      __type_ = __type::__decimal;
+      break;
+    case 'e':
+      __type_ = __type::__scientific_lower_case;
+      break;
+    case 'f':
+      __type_ = __type::__fixed_lower_case;
+      break;
+    case 'g':
+      __type_ = __type::__general_lower_case;
+      break;
+    case 'o':
+      __type_ = __type::__octal;
+      break;
+    case 'p':
+      __type_ = __type::__pointer;
+      break;
+    case 's':
+      __type_ = __type::__string;
+      break;
+    case 'x':
+      __type_ = __type::__hexadecimal_lower_case;
+      break;
+#  if _LIBCPP_STD_VER > 20
+    case '?':
+      __type_ = __type::__debug;
+      break;
+#  endif
+    default:
+      return;
+    }
+    ++__begin;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  int32_t __get_width(auto& __ctx) const {
+    if (!__width_as_arg_)
+      return __width_;
+
+    return __format_spec::__substitute_arg_id(__ctx.arg(__width_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  int32_t __get_precision(auto& __ctx) const {
+    if (!__precision_as_arg_)
+      return __precision_;
+
+    return __format_spec::__substitute_arg_id(__ctx.arg(__precision_));
+  }
+};
+
+// Validates whether the reserved bitfields don't change the size.
+static_assert(sizeof(__parser<char>) == 16);
+#  ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+static_assert(sizeof(__parser<wchar_t>) == 16);
+#  endif
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __process_display_type_string(__format_spec::__type __type) {
+  switch (__type) {
+  case __format_spec::__type::__default:
+  case __format_spec::__type::__string:
+  case __format_spec::__type::__debug:
+    break;
+
+  default:
+    std::__throw_format_error("The format-spec type has a type not supported for a string argument");
+  }
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr void __process_display_type_bool_string(__parser<_CharT>& __parser) {
+  if (__parser.__sign_ != __sign::__default)
+    std::__throw_format_error("A sign field isn't allowed in this format-spec");
+
+  if (__parser.__alternate_form_)
+    std::__throw_format_error("An alternate form field isn't allowed in this format-spec");
+
+  if (__parser.__alignment_ == __alignment::__zero_padding)
+    std::__throw_format_error("A zero-padding field isn't allowed in this format-spec");
+
+  if (__parser.__alignment_ == __alignment::__default)
+    __parser.__alignment_ = __alignment::__left;
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr void __process_display_type_char(__parser<_CharT>& __parser) {
+  __format_spec::__process_display_type_bool_string(__parser);
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr void __process_parsed_bool(__parser<_CharT>& __parser) {
+  switch (__parser.__type_) {
+  case __format_spec::__type::__default:
+  case __format_spec::__type::__string:
+    __format_spec::__process_display_type_bool_string(__parser);
+    break;
+
+  case __format_spec::__type::__binary_lower_case:
+  case __format_spec::__type::__binary_upper_case:
+  case __format_spec::__type::__octal:
+  case __format_spec::__type::__decimal:
+  case __format_spec::__type::__hexadecimal_lower_case:
+  case __format_spec::__type::__hexadecimal_upper_case:
+    break;
+
+  default:
+    std::__throw_format_error("The format-spec type has a type not supported for a bool argument");
+  }
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr void __process_parsed_char(__parser<_CharT>& __parser) {
+  switch (__parser.__type_) {
+  case __format_spec::__type::__default:
+  case __format_spec::__type::__char:
+  case __format_spec::__type::__debug:
+    __format_spec::__process_display_type_char(__parser);
+    break;
+
+  case __format_spec::__type::__binary_lower_case:
+  case __format_spec::__type::__binary_upper_case:
+  case __format_spec::__type::__octal:
+  case __format_spec::__type::__decimal:
+  case __format_spec::__type::__hexadecimal_lower_case:
+  case __format_spec::__type::__hexadecimal_upper_case:
+    break;
+
+  default:
+    std::__throw_format_error("The format-spec type has a type not supported for a char argument");
+  }
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr void __process_parsed_integer(__parser<_CharT>& __parser) {
+  switch (__parser.__type_) {
+  case __format_spec::__type::__default:
+  case __format_spec::__type::__binary_lower_case:
+  case __format_spec::__type::__binary_upper_case:
+  case __format_spec::__type::__octal:
+  case __format_spec::__type::__decimal:
+  case __format_spec::__type::__hexadecimal_lower_case:
+  case __format_spec::__type::__hexadecimal_upper_case:
+    break;
+
+  case __format_spec::__type::__char:
+    __format_spec::__process_display_type_char(__parser);
+    break;
+
+  default:
+    std::__throw_format_error("The format-spec type has a type not supported for an integer argument");
+  }
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr void __process_parsed_floating_point(__parser<_CharT>& __parser) {
+  switch (__parser.__type_) {
+  case __format_spec::__type::__default:
+  case __format_spec::__type::__hexfloat_lower_case:
+  case __format_spec::__type::__hexfloat_upper_case:
+    // Precision specific behavior will be handled later.
+    break;
+  case __format_spec::__type::__scientific_lower_case:
+  case __format_spec::__type::__scientific_upper_case:
+  case __format_spec::__type::__fixed_lower_case:
+  case __format_spec::__type::__fixed_upper_case:
+  case __format_spec::__type::__general_lower_case:
+  case __format_spec::__type::__general_upper_case:
+    if (!__parser.__precision_as_arg_ && __parser.__precision_ == -1)
+      // Set the default precision for the call to to_chars.
+      __parser.__precision_ = 6;
+    break;
+
+  default:
+    std::__throw_format_error("The format-spec type has a type not supported for a floating-point argument");
+  }
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr void __process_display_type_pointer(__format_spec::__type __type) {
+  switch (__type) {
+  case __format_spec::__type::__default:
+  case __format_spec::__type::__pointer:
+    break;
+
+  default:
+    std::__throw_format_error("The format-spec type has a type not supported for a pointer argument");
+  }
+}
+
+template <class _CharT>
+struct __column_width_result {
+  /// The number of output columns.
+  size_t __width_;
+  /// One beyond the last code unit used in the estimation.
+  ///
+  /// This limits the original output to fit in the wanted number of columns.
+  const _CharT* __last_;
+};
+
+template <class _CharT>
+__column_width_result(size_t, const _CharT*) -> __column_width_result<_CharT>;
+
+/// Since a column width can be two it's possible that the requested column
+/// width can't be achieved. Depending on the intended usage the policy can be
+/// selected.
+/// - When used as precision the maximum width may not be exceeded and the
+///   result should be "rounded down" to the previous boundary.
+/// - When used as a width we're done once the minimum is reached, but
+///   exceeding is not an issue. Rounding down is an issue since that will
+///   result in writing fill characters. Therefore the result needs to be
+///   "rounded up".
+enum class __column_width_rounding { __down, __up };
+
+#  ifndef _LIBCPP_HAS_NO_UNICODE
+
+namespace __detail {
+
+/// Converts a code point to the column width.
+///
+/// The estimations are conforming to [format.string.general]/11
+///
+/// This version expects a value less than 0x1'0000, which is a 3-byte UTF-8
+/// character.
+_LIBCPP_HIDE_FROM_ABI constexpr int __column_width_3(uint32_t __c) noexcept {
+  _LIBCPP_ASSERT(__c < 0x10000, "Use __column_width_4 or __column_width for larger values");
+
+  // clang-format off
+  return 1 + (__c >= 0x1100 && (__c <= 0x115f ||
+             (__c >= 0x2329 && (__c <= 0x232a ||
+             (__c >= 0x2e80 && (__c <= 0x303e ||
+             (__c >= 0x3040 && (__c <= 0xa4cf ||
+             (__c >= 0xac00 && (__c <= 0xd7a3 ||
+             (__c >= 0xf900 && (__c <= 0xfaff ||
+             (__c >= 0xfe10 && (__c <= 0xfe19 ||
+             (__c >= 0xfe30 && (__c <= 0xfe6f ||
+             (__c >= 0xff00 && (__c <= 0xff60 ||
+             (__c >= 0xffe0 && (__c <= 0xffe6
+             ))))))))))))))))))));
+  // clang-format on
+}
+
+/// @overload
+///
+/// This version expects a value greater than or equal to 0x1'0000, which is a
+/// 4-byte UTF-8 character.
+_LIBCPP_HIDE_FROM_ABI constexpr int __column_width_4(uint32_t __c) noexcept {
+  _LIBCPP_ASSERT(__c >= 0x10000, "Use __column_width_3 or __column_width for smaller values");
+
+  // clang-format off
+  return 1 + (__c >= 0x1'f300 && (__c <= 0x1'f64f ||
+             (__c >= 0x1'f900 && (__c <= 0x1'f9ff ||
+             (__c >= 0x2'0000 && (__c <= 0x2'fffd ||
+             (__c >= 0x3'0000 && (__c <= 0x3'fffd
+             ))))))));
+  // clang-format on
+}
+
+/// @overload
+///
+/// The general case, accepting all values.
+_LIBCPP_HIDE_FROM_ABI constexpr int __column_width(uint32_t __c) noexcept {
+  if (__c < 0x10000)
+    return __detail::__column_width_3(__c);
+
+  return __detail::__column_width_4(__c);
+}
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr __column_width_result<_CharT> __estimate_column_width_grapheme_clustering(
+    const _CharT* __first, const _CharT* __last, size_t __maximum, __column_width_rounding __rounding) noexcept {
+  __unicode::__extended_grapheme_cluster_view<_CharT> __view{__first, __last};
+
+  __column_width_result<_CharT> __result{0, __first};
+  while (__result.__last_ != __last && __result.__width_ <= __maximum) {
+    typename __unicode::__extended_grapheme_cluster_view<_CharT>::__cluster __cluster = __view.__consume();
+    int __width = __detail::__column_width(__cluster.__code_point_);
+
+    // When the next entry would exceed the maximum width the previous width
+    // might be returned. For example when a width of 100 is requested the
+    // returned width might be 99, since the next code point has an estimated
+    // column width of 2. This depends on the rounding flag.
+    // When the maximum is exceeded the loop will abort the next iteration.
+    if (__rounding == __column_width_rounding::__down && __result.__width_ + __width > __maximum)
+      return __result;
+
+    __result.__width_ += __width;
+    __result.__last_ = __cluster.__last_;
+  }
+
+  return __result;
+}
+
+} // namespace __detail
+
+// Unicode can be stored in several formats: UTF-8, UTF-16, and UTF-32.
+// Depending on format the relation between the number of code units stored and
+// the number of output columns differs. The first relation is the number of
+// code units forming a code point. (The text assumes the code units are
+// unsigned.)
+// - UTF-8 The number of code units is between one and four. The first 127
+//   Unicode code points match the ASCII character set. When the highest bit is
+//   set it means the code point has more than one code unit.
+// - UTF-16: The number of code units is between 1 and 2. When the first
+//   code unit is in the range [0xd800,0xdfff) it means the code point uses two
+//   code units.
+// - UTF-32: The number of code units is always one.
+//
+// The code point to the number of columns is specified in
+// [format.string.std]/11. This list might change in the future.
+//
+// Another thing to be taken into account is Grapheme clustering. This means
+// that in some cases multiple code points are combined one element in the
+// output. For example:
+// - an ASCII character with a combined diacritical mark
+// - an emoji with a skin tone modifier
+// - a group of combined people emoji to create a family
+// - a combination of flag emoji
+//
+// See also:
+// - [format.string.general]/11
+// - https://en.wikipedia.org/wiki/UTF-8#Encoding
+// - https://en.wikipedia.org/wiki/UTF-16#U+D800_to_U+DFFF
+
+_LIBCPP_HIDE_FROM_ABI constexpr bool __is_ascii(char32_t __c) { return __c < 0x80; }
+
+/// Determines the number of output columns needed to render the input.
+///
+/// \note When the scanner encounters malformed Unicode it acts as-if every
+/// code unit is a one column code point. Typically a terminal uses the same
+/// strategy and replaces every malformed code unit with a one column
+/// replacement character.
+///
+/// \param __first    Points to the first element of the input range.
+/// \param __last     Points beyond the last element of the input range.
+/// \param __maximum  The maximum number of output columns. The returned number
+///                   of estimated output columns will not exceed this value.
+/// \param __rounding Selects the rounding method.
+///                   \c __down result.__width_ <= __maximum
+///                   \c __up result.__width_ <= __maximum + 1
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr __column_width_result<_CharT> __estimate_column_width(
+    basic_string_view<_CharT> __str, size_t __maximum, __column_width_rounding __rounding) noexcept {
+  // The width estimation is done in two steps:
+  // - Quickly process for the ASCII part. ASCII has the following properties
+  //   - One code unit is one code point
+  //   - Every code point has an estimated width of one
+  // - When needed it will a Unicode Grapheme clustering algorithm to find
+  //   the proper place for truncation.
+
+  if (__str.empty() || __maximum == 0)
+    return {0, __str.begin()};
+
+  // ASCII has one caveat; when an ASCII character is followed by a non-ASCII
+  // character they might be part of an extended grapheme cluster. For example:
+  //   an ASCII letter and a COMBINING ACUTE ACCENT
+  // The truncate should happen after the COMBINING ACUTE ACCENT. Therefore we
+  // need to scan one code unit beyond the requested precision. When this code
+  // unit is non-ASCII we omit the current code unit and let the Grapheme
+  // clustering algorithm do its work.
+  const _CharT* __it = __str.begin();
+  if (__format_spec::__is_ascii(*__it)) {
+    do {
+      --__maximum;
+      ++__it;
+      if (__it == __str.end())
+        return {__str.size(), __str.end()};
+
+      if (__maximum == 0) {
+        if (__format_spec::__is_ascii(*__it))
+          return {static_cast<size_t>(__it - __str.begin()), __it};
+
+        break;
+      }
+    } while (__format_spec::__is_ascii(*__it));
+    --__it;
+    ++__maximum;
+  }
+
+  ptrdiff_t __ascii_size = __it - __str.begin();
+  __column_width_result __result =
+      __detail::__estimate_column_width_grapheme_clustering(__it, __str.end(), __maximum, __rounding);
+
+  __result.__width_ += __ascii_size;
+  return __result;
+}
+#  else // !defined(_LIBCPP_HAS_NO_UNICODE)
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI constexpr __column_width_result<_CharT>
+__estimate_column_width(basic_string_view<_CharT> __str, size_t __maximum, __column_width_rounding) noexcept {
+  // When Unicode isn't supported assume ASCII and every code unit is one code
+  // point. In ASCII the estimated column width is always one. Thus there's no
+  // need for rounding.
+  size_t __width_ = _VSTD::min(__str.size(), __maximum);
+  return {__width_, __str.begin() + __width_};
+}
+
+#  endif // !defined(_LIBCPP_HAS_NO_UNICODE)
+
+} // namespace __format_spec
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___FORMAT_PARSER_STD_FORMAT_SPEC_H
diff --git a/app/src/main/cpp/libcxx/include/__format/range_default_formatter.h b/app/src/main/cpp/libcxx/include/__format/range_default_formatter.h
new file mode 100644
index 0000000..774887b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/range_default_formatter.h
@@ -0,0 +1,201 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_RANGE_DEFAULT_FORMATTER_H
+#define _LIBCPP___FORMAT_RANGE_DEFAULT_FORMATTER_H
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#include <__availability>
+#include <__chrono/statically_widen.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__format/concepts.h>
+#include <__format/formatter.h>
+#include <__format/range_formatter.h>
+#include <__ranges/concepts.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/pair.h>
+#include <string_view>
+#include <tuple>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 20
+
+template <class _Rp, class _CharT>
+concept __const_formattable_range =
+    ranges::input_range<const _Rp> && formattable<ranges::range_reference_t<const _Rp>, _CharT>;
+
+template <class _Rp, class _CharT>
+using __fmt_maybe_const = conditional_t<__const_formattable_range<_Rp, _CharT>, const _Rp, _Rp>;
+
+_LIBCPP_DIAGNOSTIC_PUSH
+_LIBCPP_CLANG_DIAGNOSTIC_IGNORED("-Wshadow")
+_LIBCPP_GCC_DIAGNOSTIC_IGNORED("-Wshadow")
+// This shadows map, set, and string.
+enum class range_format { disabled, map, set, sequence, string, debug_string };
+_LIBCPP_DIAGNOSTIC_POP
+
+// There is no definition of this struct, it's purely intended to be used to
+// generate diagnostics.
+template <class _Rp>
+struct _LIBCPP_TEMPLATE_VIS __instantiated_the_primary_template_of_format_kind;
+
+template <class _Rp>
+constexpr range_format format_kind = [] {
+  // [format.range.fmtkind]/1
+  // A program that instantiates the primary template of format_kind is ill-formed.
+  static_assert(sizeof(_Rp) != sizeof(_Rp), "create a template specialization of format_kind for your type");
+  return range_format::disabled;
+}();
+
+template <ranges::input_range _Rp>
+  requires same_as<_Rp, remove_cvref_t<_Rp>>
+inline constexpr range_format format_kind<_Rp> = [] {
+  // [format.range.fmtkind]/2
+
+  // 2.1 If same_as<remove_cvref_t<ranges::range_reference_t<R>>, R> is true,
+  // Otherwise format_kind<R> is range_format::disabled.
+  if constexpr (same_as<remove_cvref_t<ranges::range_reference_t<_Rp>>, _Rp>)
+    return range_format::disabled;
+  // 2.2 Otherwise, if the qualified-id R::key_type is valid and denotes a type:
+  else if constexpr (requires { typename _Rp::key_type; }) {
+    // 2.2.1 If the qualified-id R::mapped_type is valid and denotes a type ...
+    if constexpr (requires { typename _Rp::mapped_type; } &&
+                  // 2.2.1 ... If either U is a specialization of pair or U is a specialization
+                  // of tuple and tuple_size_v<U> == 2
+                  __fmt_pair_like<remove_cvref_t<ranges::range_reference_t<_Rp>>>)
+      return range_format::map;
+    else
+      // 2.2.2 Otherwise format_kind<R> is range_format::set.
+      return range_format::set;
+  } else
+    // 2.3 Otherwise, format_kind<R> is range_format::sequence.
+    return range_format::sequence;
+}();
+
+// This is a non-standard work-around to fix instantiation of
+//   formatter<const _CharT[N], _CharT>
+// const _CharT[N] satisfies the ranges::input_range concept.
+// remove_cvref_t<const _CharT[N]> is _CharT[N] so it does not satisfy the
+// requirement of the above specialization. Instead it will instantiate the
+// primary template, which is ill-formed.
+//
+// An alternative solution is to remove the offending formatter.
+//
+// https://godbolt.org/z/bqjhhaexx
+//
+// The removal is proposed in LWG3833, but use the work-around until the issue
+// has been adopted.
+// TODO FMT Implement LWG3833.
+template <class _CharT, size_t N>
+inline constexpr range_format format_kind<const _CharT[N]> = range_format::disabled;
+
+template <range_format _Kp, ranges::input_range _Rp, class _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT __range_default_formatter;
+
+// Required specializations
+
+template <ranges::input_range _Rp, class _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT __range_default_formatter<range_format::sequence, _Rp, _CharT> {
+private:
+  using __maybe_const_r = __fmt_maybe_const<_Rp, _CharT>;
+  range_formatter<remove_cvref_t<ranges::range_reference_t<__maybe_const_r>>, _CharT> __underlying_;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr void set_separator(basic_string_view<_CharT> __separator) {
+    __underlying_.set_separator(__separator);
+  }
+  _LIBCPP_HIDE_FROM_ABI constexpr void
+  set_brackets(basic_string_view<_CharT> __opening_bracket, basic_string_view<_CharT> __closing_bracket) {
+    __underlying_.set_brackets(__opening_bracket, __closing_bracket);
+  }
+
+  template <class _ParseContext>
+  _LIBCPP_HIDE_FROM_ABI constexpr typename _ParseContext::iterator parse(_ParseContext& __ctx) {
+    return __underlying_.parse(__ctx);
+  }
+
+  template <class FormatContext>
+  _LIBCPP_HIDE_FROM_ABI typename FormatContext::iterator format(__maybe_const_r& __range, FormatContext& __ctx) const {
+    return __underlying_.format(__range, __ctx);
+  }
+};
+
+template <ranges::input_range _Rp, class _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT __range_default_formatter<range_format::map, _Rp, _CharT> {
+private:
+  using __maybe_const_map = __fmt_maybe_const<_Rp, _CharT>;
+  using __element_type    = remove_cvref_t<ranges::range_reference_t<__maybe_const_map>>;
+  range_formatter<__element_type, _CharT> __underlying_;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr __range_default_formatter()
+    requires(__fmt_pair_like<__element_type>)
+  {
+    __underlying_.set_brackets(_LIBCPP_STATICALLY_WIDEN(_CharT, "{"), _LIBCPP_STATICALLY_WIDEN(_CharT, "}"));
+    __underlying_.underlying().set_brackets({}, {});
+    __underlying_.underlying().set_separator(_LIBCPP_STATICALLY_WIDEN(_CharT, ": "));
+  }
+
+  template <class _ParseContext>
+  _LIBCPP_HIDE_FROM_ABI constexpr typename _ParseContext::iterator parse(_ParseContext& __ctx) {
+    return __underlying_.parse(__ctx);
+  }
+
+  template <class _FormatContext>
+  _LIBCPP_HIDE_FROM_ABI typename _FormatContext::iterator
+  format(__maybe_const_map& __range, _FormatContext& __ctx) const {
+    return __underlying_.format(__range, __ctx);
+  }
+};
+
+template <ranges::input_range _Rp, class _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT __range_default_formatter<range_format::set, _Rp, _CharT> {
+private:
+  using __maybe_const_set = __fmt_maybe_const<_Rp, _CharT>;
+  using __element_type    = remove_cvref_t<ranges::range_reference_t<__maybe_const_set>>;
+  range_formatter<__element_type, _CharT> __underlying_;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr __range_default_formatter() {
+    __underlying_.set_brackets(_LIBCPP_STATICALLY_WIDEN(_CharT, "{"), _LIBCPP_STATICALLY_WIDEN(_CharT, "}"));
+  }
+
+  template <class _ParseContext>
+  _LIBCPP_HIDE_FROM_ABI constexpr typename _ParseContext::iterator parse(_ParseContext& __ctx) {
+    return __underlying_.parse(__ctx);
+  }
+
+  template <class _FormatContext>
+  _LIBCPP_HIDE_FROM_ABI typename _FormatContext::iterator
+  format(__maybe_const_set& __range, _FormatContext& __ctx) const {
+    return __underlying_.format(__range, __ctx);
+  }
+};
+
+template <range_format _Kp, ranges::input_range _Rp, class _CharT>
+  requires(_Kp == range_format::string || _Kp == range_format::debug_string)
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT __range_default_formatter<_Kp, _Rp, _CharT> {
+  __range_default_formatter() = delete; // TODO FMT Implement
+};
+
+template <ranges::input_range _Rp, class _CharT>
+  requires(format_kind<_Rp> != range_format::disabled && formattable<ranges::range_reference_t<_Rp>, _CharT>)
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<_Rp, _CharT>
+    : __range_default_formatter<format_kind<_Rp>, _Rp, _CharT> {};
+
+#endif //_LIBCPP_STD_VER > 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_RANGE_DEFAULT_FORMATTER_H
diff --git a/app/src/main/cpp/libcxx/include/__format/range_formatter.h b/app/src/main/cpp/libcxx/include/__format/range_formatter.h
new file mode 100644
index 0000000..9ea61a7
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/range_formatter.h
@@ -0,0 +1,255 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_RANGE_FORMATTER_H
+#define _LIBCPP___FORMAT_RANGE_FORMATTER_H
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#include <__algorithm/ranges_copy.h>
+#include <__availability>
+#include <__chrono/statically_widen.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__format/buffer.h>
+#include <__format/concepts.h>
+#include <__format/format_args.h>
+#include <__format/format_context.h>
+#include <__format/format_error.h>
+#include <__format/formatter.h>
+#include <__format/formatter_output.h>
+#include <__format/parser_std_format_spec.h>
+#include <__iterator/back_insert_iterator.h>
+#include <__ranges/concepts.h>
+#include <__ranges/data.h>
+#include <__ranges/size.h>
+#include <__type_traits/remove_cvref.h>
+#include <string_view>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 20
+
+template <class _Tp, class _CharT = char>
+  requires same_as<remove_cvref_t<_Tp>, _Tp> && formattable<_Tp, _CharT>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT range_formatter {
+  _LIBCPP_HIDE_FROM_ABI constexpr void set_separator(basic_string_view<_CharT> __separator) {
+    __separator_ = __separator;
+  }
+  _LIBCPP_HIDE_FROM_ABI constexpr void
+  set_brackets(basic_string_view<_CharT> __opening_bracket, basic_string_view<_CharT> __closing_bracket) {
+    __opening_bracket_ = __opening_bracket;
+    __closing_bracket_ = __closing_bracket;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr formatter<_Tp, _CharT>& underlying() { return __underlying_; }
+  _LIBCPP_HIDE_FROM_ABI constexpr const formatter<_Tp, _CharT>& underlying() const { return __underlying_; }
+
+  template <class _ParseContext>
+  _LIBCPP_HIDE_FROM_ABI constexpr typename _ParseContext::iterator parse(_ParseContext& __parse_ctx) {
+    const _CharT* __begin = __parser_.__parse(__parse_ctx, __format_spec::__fields_range);
+    const _CharT* __end   = __parse_ctx.end();
+    if (__begin == __end)
+      return __begin;
+
+    // The n field overrides a possible m type, therefore delay applying the
+    // effect of n until the type has been procesed.
+    bool __clear_brackets = (*__begin == _CharT('n'));
+    if (__clear_brackets) {
+      ++__begin;
+      if (__begin == __end) {
+        // Since there is no more data, clear the brackets before returning.
+        set_brackets({}, {});
+        return __begin;
+      }
+    }
+
+    __parse_type(__begin, __end);
+    if (__clear_brackets)
+      set_brackets({}, {});
+    if (__begin == __end)
+      return __begin;
+
+    bool __has_range_underlying_spec = *__begin == _CharT(':');
+    if (__parser_.__type_ != __format_spec::__type::__default) {
+      // [format.range.formatter]/6
+      //   If the range-type is s or ?s, then there shall be no n option and no
+      //   range-underlying-spec.
+      if (__clear_brackets) {
+        if (__parser_.__type_ == __format_spec::__type::__string)
+          std::__throw_format_error("The n option and type s can't be used together");
+        std::__throw_format_error("The n option and type ?s can't be used together");
+      }
+      if (__has_range_underlying_spec) {
+        if (__parser_.__type_ == __format_spec::__type::__string)
+          std::__throw_format_error("Type s and an underlying format specification can't be used together");
+        std::__throw_format_error("Type ?s and an underlying format specification can't be used together");
+      }
+    } else if (!__has_range_underlying_spec)
+      std::__set_debug_format(__underlying_);
+
+    if (__has_range_underlying_spec) {
+      // range-underlying-spec:
+      //   :  format-spec
+      ++__begin;
+      if (__begin == __end)
+        return __begin;
+
+      __parse_ctx.advance_to(__begin);
+      __begin = __underlying_.parse(__parse_ctx);
+    }
+
+    if (__begin != __end && *__begin != _CharT('}'))
+      std::__throw_format_error("The format-spec should consume the input or end with a '}'");
+
+    return __begin;
+  }
+
+  template <ranges::input_range _Rp, class _FormatContext>
+    requires formattable<ranges::range_reference_t<_Rp>, _CharT> &&
+             same_as<remove_cvref_t<ranges::range_reference_t<_Rp>>, _Tp>
+  _LIBCPP_HIDE_FROM_ABI typename _FormatContext::iterator format(_Rp&& __range, _FormatContext& __ctx) const {
+    __format_spec::__parsed_specifications<_CharT> __specs = __parser_.__get_parsed_std_specifications(__ctx);
+
+    if (!__specs.__has_width())
+      return __format_range(__range, __ctx, __specs);
+
+    // The size of the buffer needed is:
+    // - open bracket characters
+    // - close bracket character
+    // - n elements where every element may have a different size
+    // - (n -1) separators
+    // The size of the element is hard to predict, knowing the type helps but
+    // it depends on the format-spec. As an initial estimate we guess 6
+    // characters.
+    // Typically both brackets are 1 character and the separator is 2
+    // characters. Which means there will be
+    //   (n - 1) * 2 + 1 + 1 = n * 2 character
+    // So estimate 8 times the range size as buffer.
+    std::size_t __capacity_hint = 0;
+    if constexpr (std::ranges::sized_range<_Rp>)
+      __capacity_hint = 8 * ranges::size(__range);
+    __format::__retarget_buffer<_CharT> __buffer{__capacity_hint};
+    basic_format_context<typename __format::__retarget_buffer<_CharT>::__iterator, _CharT> __c{
+        __buffer.__make_output_iterator(), __ctx};
+
+    __format_range(__range, __c, __specs);
+
+    return __formatter::__write_string_no_precision(__buffer.__view(), __ctx.out(), __specs);
+  }
+
+  template <ranges::input_range _Rp, class _FormatContext>
+  typename _FormatContext::iterator _LIBCPP_HIDE_FROM_ABI
+  __format_range(_Rp&& __range, _FormatContext& __ctx, __format_spec::__parsed_specifications<_CharT> __specs) const {
+    if constexpr (same_as<_Tp, _CharT>) {
+      switch (__specs.__std_.__type_) {
+      case __format_spec::__type::__string:
+      case __format_spec::__type::__debug:
+        return __format_as_string(__range, __ctx, __specs.__std_.__type_ == __format_spec::__type::__debug);
+      default:
+        return __format_as_sequence(__range, __ctx);
+      }
+    } else
+      return __format_as_sequence(__range, __ctx);
+  }
+
+  template <ranges::input_range _Rp, class _FormatContext>
+  _LIBCPP_HIDE_FROM_ABI typename _FormatContext::iterator
+  __format_as_string(_Rp&& __range, _FormatContext& __ctx, bool __debug_format) const {
+    // When the range is contiguous use a basic_string_view instead to avoid a
+    // copy of the underlying data. The basic_string_view formatter
+    // specialization is the "basic" string formatter in libc++.
+    if constexpr (ranges::contiguous_range<_Rp> && std::ranges::sized_range<_Rp>) {
+      std::formatter<basic_string_view<_CharT>, _CharT> __formatter;
+      if (__debug_format)
+        __formatter.set_debug_format();
+      return __formatter.format(
+          basic_string_view<_CharT>{
+              ranges::data(__range),
+              ranges::size(__range),
+          },
+          __ctx);
+    } else {
+      std::formatter<basic_string<_CharT>, _CharT> __formatter;
+      if (__debug_format)
+        __formatter.set_debug_format();
+      // P2106's from_range has not been implemented yet. Instead use a simple
+      // copy operation.
+      // TODO FMT use basic_string's "from_range" constructor.
+      // return std::formatter<basic_string<_CharT>, _CharT>{}.format(basic_string<_CharT>{from_range, __range}, __ctx);
+      basic_string<_CharT> __str;
+      ranges::copy(__range, back_insert_iterator{__str});
+      return __formatter.format(__str, __ctx);
+    }
+  }
+
+  template <ranges::input_range _Rp, class _FormatContext>
+  _LIBCPP_HIDE_FROM_ABI typename _FormatContext::iterator
+  __format_as_sequence(_Rp&& __range, _FormatContext& __ctx) const {
+    __ctx.advance_to(ranges::copy(__opening_bracket_, __ctx.out()).out);
+    bool __use_separator = false;
+    for (auto&& __e : __range) {
+      if (__use_separator)
+        __ctx.advance_to(ranges::copy(__separator_, __ctx.out()).out);
+      else
+        __use_separator = true;
+
+      __ctx.advance_to(__underlying_.format(__e, __ctx));
+    }
+
+    return ranges::copy(__closing_bracket_, __ctx.out()).out;
+  }
+
+  __format_spec::__parser<_CharT> __parser_{.__alignment_ = __format_spec::__alignment::__left};
+
+private:
+  _LIBCPP_HIDE_FROM_ABI constexpr void __parse_type(const _CharT*& __begin, const _CharT* __end) {
+    switch (*__begin) {
+    case _CharT('m'):
+      if constexpr (__fmt_pair_like<_Tp>) {
+        set_brackets(_LIBCPP_STATICALLY_WIDEN(_CharT, "{"), _LIBCPP_STATICALLY_WIDEN(_CharT, "}"));
+        set_separator(_LIBCPP_STATICALLY_WIDEN(_CharT, ", "));
+        ++__begin;
+      } else
+        std::__throw_format_error("The range-format-spec type m requires two elements for a pair or tuple");
+      break;
+
+    case _CharT('s'):
+      if constexpr (same_as<_Tp, _CharT>) {
+        __parser_.__type_ = __format_spec::__type::__string;
+        ++__begin;
+      } else
+        std::__throw_format_error("The range-format-spec type s requires formatting a character type");
+      break;
+
+    case _CharT('?'):
+      ++__begin;
+      if (__begin == __end || *__begin != _CharT('s'))
+        std::__throw_format_error("The format-spec should consume the input or end with a '}'");
+      if constexpr (same_as<_Tp, _CharT>) {
+        __parser_.__type_ = __format_spec::__type::__debug;
+        ++__begin;
+      } else
+        std::__throw_format_error("The range-format-spec type ?s requires formatting a character type");
+    }
+  }
+
+  formatter<_Tp, _CharT> __underlying_;
+  basic_string_view<_CharT> __separator_       = _LIBCPP_STATICALLY_WIDEN(_CharT, ", ");
+  basic_string_view<_CharT> __opening_bracket_ = _LIBCPP_STATICALLY_WIDEN(_CharT, "[");
+  basic_string_view<_CharT> __closing_bracket_ = _LIBCPP_STATICALLY_WIDEN(_CharT, "]");
+};
+
+#endif //_LIBCPP_STD_VER > 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_RANGE_FORMATTER_H
diff --git a/app/src/main/cpp/libcxx/include/__format/unicode.h b/app/src/main/cpp/libcxx/include/__format/unicode.h
new file mode 100644
index 0000000..4327258
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__format/unicode.h
@@ -0,0 +1,489 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FORMAT_UNICODE_H
+#define _LIBCPP___FORMAT_UNICODE_H
+
+#include <__assert>
+#include <__config>
+#include <__format/extended_grapheme_cluster_table.h>
+#include <__type_traits/make_unsigned.h>
+#include <__utility/unreachable.h>
+#include <bit>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace __unicode {
+
+#  if _LIBCPP_STD_VER > 20
+
+/// The result of consuming a code point using P2286' semantics
+///
+/// TODO FMT Combine __consume and  __consume_p2286 in one function.
+struct __consume_p2286_result {
+  // A size of 0 means well formed. This to differenciate between
+  // a valid code point and a code unit that's invalid like 0b11111xxx.
+  int __ill_formed_size;
+
+  // If well formed the consumed code point.
+  // Otherwise the ill-formed code units as unsigned 8-bit values. They are
+  // stored in reverse order, to make it easier to extract the values.
+  char32_t __value;
+};
+
+#  endif // _LIBCPP_STD_VER > 20
+
+#  ifndef _LIBCPP_HAS_NO_UNICODE
+
+/// Implements the grapheme cluster boundary rules
+///
+/// These rules are used to implement format's width estimation as stated in
+/// [format.string.std]/11
+///
+/// The Standard refers to UAX \#29 for Unicode 12.0.0
+/// https://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundary_Rules
+///
+/// The data tables used are
+/// https://www.unicode.org/Public/UCD/latest/ucd/auxiliary/GraphemeBreakProperty.txt
+/// https://www.unicode.org/Public/UCD/latest/ucd/emoji/emoji-data.txt
+/// https://www.unicode.org/Public/UCD/latest/ucd/auxiliary/GraphemeBreakTest.txt (for testing only)
+
+inline constexpr char32_t __replacement_character = U'\ufffd';
+
+_LIBCPP_HIDE_FROM_ABI constexpr bool __is_continuation(const char* __char, int __count) {
+  do {
+    if ((*__char & 0b1000'0000) != 0b1000'0000)
+      return false;
+    --__count;
+    ++__char;
+  } while (__count);
+  return true;
+}
+
+/// Helper class to extract a code unit from a Unicode character range.
+///
+/// The stored range is a view. There are multiple specialization for different
+/// character types.
+template <class _CharT>
+class __code_point_view;
+
+/// UTF-8 specialization.
+template <>
+class __code_point_view<char> {
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit __code_point_view(const char* __first, const char* __last)
+      : __first_(__first), __last_(__last) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr bool __at_end() const noexcept { return __first_ == __last_; }
+  _LIBCPP_HIDE_FROM_ABI constexpr const char* __position() const noexcept { return __first_; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr char32_t __consume() noexcept {
+    _LIBCPP_ASSERT(__first_ != __last_, "can't move beyond the end of input");
+
+    // Based on the number of leading 1 bits the number of code units in the
+    // code point can be determined. See
+    // https://en.wikipedia.org/wiki/UTF-8#Encoding
+    switch (_VSTD::countl_one(static_cast<unsigned char>(*__first_))) {
+    case 0:
+      return *__first_++;
+
+    case 2:
+      if (__last_ - __first_ < 2 || !__unicode::__is_continuation(__first_ + 1, 1)) [[unlikely]]
+        break;
+      else {
+        char32_t __value = static_cast<unsigned char>(*__first_++) & 0x1f;
+        __value <<= 6;
+        __value |= static_cast<unsigned char>(*__first_++) & 0x3f;
+        return __value;
+      }
+
+    case 3:
+      if (__last_ - __first_ < 3 || !__unicode::__is_continuation(__first_ + 1, 2)) [[unlikely]]
+        break;
+      else {
+        char32_t __value = static_cast<unsigned char>(*__first_++) & 0x0f;
+        __value <<= 6;
+        __value |= static_cast<unsigned char>(*__first_++) & 0x3f;
+        __value <<= 6;
+        __value |= static_cast<unsigned char>(*__first_++) & 0x3f;
+        return __value;
+      }
+
+    case 4:
+      if (__last_ - __first_ < 4 || !__unicode::__is_continuation(__first_ + 1, 3)) [[unlikely]]
+        break;
+      else {
+        char32_t __value = static_cast<unsigned char>(*__first_++) & 0x07;
+        __value <<= 6;
+        __value |= static_cast<unsigned char>(*__first_++) & 0x3f;
+        __value <<= 6;
+        __value |= static_cast<unsigned char>(*__first_++) & 0x3f;
+        __value <<= 6;
+        __value |= static_cast<unsigned char>(*__first_++) & 0x3f;
+        return __value;
+      }
+    }
+    // An invalid number of leading ones can be garbage or a code unit in the
+    // middle of a code point. By consuming one code unit the parser may get
+    // "in sync" after a few code units.
+    ++__first_;
+    return __replacement_character;
+  }
+
+#    if _LIBCPP_STD_VER > 20
+  _LIBCPP_HIDE_FROM_ABI constexpr __consume_p2286_result __consume_p2286() noexcept {
+    _LIBCPP_ASSERT(__first_ != __last_, "can't move beyond the end of input");
+
+    // Based on the number of leading 1 bits the number of code units in the
+    // code point can be determined. See
+    // https://en.wikipedia.org/wiki/UTF-8#Encoding
+    switch (std::countl_one(static_cast<unsigned char>(*__first_))) {
+    case 0:
+      return {0, static_cast<unsigned char>(*__first_++)};
+
+    case 2:
+      if (__last_ - __first_ < 2) [[unlikely]]
+        break;
+
+      if (__unicode::__is_continuation(__first_ + 1, 1)) {
+        char32_t __value = static_cast<unsigned char>(*__first_++) & 0x1f;
+        __value <<= 6;
+        __value |= static_cast<unsigned char>(*__first_++) & 0x3f;
+        return {0, __value};
+      }
+      break;
+
+    case 3:
+      if (__last_ - __first_ < 3) [[unlikely]]
+        break;
+
+      if (__unicode::__is_continuation(__first_ + 1, 2)) {
+        char32_t __value = static_cast<unsigned char>(*__first_++) & 0x0f;
+        __value <<= 6;
+        __value |= static_cast<unsigned char>(*__first_++) & 0x3f;
+        __value <<= 6;
+        __value |= static_cast<unsigned char>(*__first_++) & 0x3f;
+        return {0, __value};
+      }
+      break;
+
+    case 4:
+      if (__last_ - __first_ < 4) [[unlikely]]
+        break;
+
+      if (__unicode::__is_continuation(__first_ + 1, 3)) {
+        char32_t __value = static_cast<unsigned char>(*__first_++) & 0x07;
+        __value <<= 6;
+        __value |= static_cast<unsigned char>(*__first_++) & 0x3f;
+        __value <<= 6;
+        __value |= static_cast<unsigned char>(*__first_++) & 0x3f;
+        __value <<= 6;
+        __value |= static_cast<unsigned char>(*__first_++) & 0x3f;
+
+        if (__value > 0x10FFFF) // Outside the valid Unicode range?
+          return {4, __value};
+
+        return {0, __value};
+      }
+      break;
+    }
+    // An invalid number of leading ones can be garbage or a code unit in the
+    // middle of a code point. By consuming one code unit the parser may get
+    // "in sync" after a few code units.
+    return {1, static_cast<unsigned char>(*__first_++)};
+  }
+#    endif // _LIBCPP_STD_VER > 20
+
+private:
+  const char* __first_;
+  const char* __last_;
+};
+
+#    ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+_LIBCPP_HIDE_FROM_ABI constexpr bool __is_surrogate_pair_high(wchar_t __value) {
+  return __value >= 0xd800 && __value <= 0xdbff;
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr bool __is_surrogate_pair_low(wchar_t __value) {
+  return __value >= 0xdc00 && __value <= 0xdfff;
+}
+
+/// This specialization depends on the size of wchar_t
+/// - 2 UTF-16 (for example Windows and AIX)
+/// - 4 UTF-32 (for example Linux)
+template <>
+class __code_point_view<wchar_t> {
+public:
+  static_assert(sizeof(wchar_t) == 2 || sizeof(wchar_t) == 4, "sizeof(wchar_t) has a not implemented value");
+
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit __code_point_view(const wchar_t* __first, const wchar_t* __last)
+      : __first_(__first), __last_(__last) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const wchar_t* __position() const noexcept { return __first_; }
+  _LIBCPP_HIDE_FROM_ABI constexpr bool __at_end() const noexcept { return __first_ == __last_; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr char32_t __consume() noexcept {
+    _LIBCPP_ASSERT(__first_ != __last_, "can't move beyond the end of input");
+
+    if constexpr (sizeof(wchar_t) == 2) {
+      char32_t __result = *__first_++;
+      // Is the code unit part of a surrogate pair? See
+      // https://en.wikipedia.org/wiki/UTF-16#U+D800_to_U+DFFF
+      if (__result >= 0xd800 && __result <= 0xDfff) {
+        // Malformed Unicode.
+        if (__first_ == __last_) [[unlikely]]
+          return __replacement_character;
+
+        __result -= 0xd800;
+        __result <<= 10;
+        __result += *__first_++ - 0xdc00;
+        __result += 0x10000;
+      }
+      return __result;
+
+    } else if constexpr (sizeof(wchar_t) == 4) {
+      char32_t __result = *__first_++;
+      if (__result > 0x10FFFF) [[unlikely]]
+        return __replacement_character;
+      return __result;
+    } else {
+      __libcpp_unreachable();
+    }
+  }
+
+#      if _LIBCPP_STD_VER > 20
+  _LIBCPP_HIDE_FROM_ABI constexpr __consume_p2286_result __consume_p2286() noexcept {
+    _LIBCPP_ASSERT(__first_ != __last_, "can't move beyond the end of input");
+
+    char32_t __result = *__first_++;
+    if constexpr (sizeof(wchar_t) == 2) {
+      // https://en.wikipedia.org/wiki/UTF-16#U+D800_to_U+DFFF
+      if (__is_surrogate_pair_high(__result)) {
+        // Malformed Unicode.
+        if (__first_ == __last_ || !__is_surrogate_pair_low(*(__first_ + 1))) [[unlikely]]
+          return {1, __result};
+
+        __result -= 0xd800;
+        __result <<= 10;
+        __result += *__first_++ - 0xdc00;
+        __result += 0x10000;
+      } else if (__is_surrogate_pair_low(__result))
+        // A code point shouldn't start with the low surrogate pair
+        return {1, __result};
+    } else {
+      if (__result > 0x10FFFF) [[unlikely]]
+        return {1, __result};
+    }
+
+    return {0, __result};
+  }
+#      endif // _LIBCPP_STD_VER > 20
+
+private:
+  const wchar_t* __first_;
+  const wchar_t* __last_;
+};
+#    endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+_LIBCPP_HIDE_FROM_ABI constexpr bool __at_extended_grapheme_cluster_break(
+    bool& __ri_break_allowed,
+    bool __has_extened_pictographic,
+    __extended_grapheme_custer_property_boundary::__property __prev,
+    __extended_grapheme_custer_property_boundary::__property __next) {
+  using __extended_grapheme_custer_property_boundary::__property;
+
+  __has_extened_pictographic |= __prev == __property::__Extended_Pictographic;
+
+  // https://www.unicode.org/reports/tr29/tr29-39.html#Grapheme_Cluster_Boundary_Rules
+
+  // *** Break at the start and end of text, unless the text is empty. ***
+
+  _LIBCPP_ASSERT(__prev != __property::__sot, "should be handled in the constructor"); // GB1
+  _LIBCPP_ASSERT(__prev != __property::__eot, "should be handled by our caller");      // GB2
+
+  // *** Do not break between a CR and LF. Otherwise, break before and after controls. ***
+  if (__prev == __property::__CR && __next == __property::__LF) // GB3
+    return false;
+
+  if (__prev == __property::__Control || __prev == __property::__CR || __prev == __property::__LF) // GB4
+    return true;
+
+  if (__next == __property::__Control || __next == __property::__CR || __next == __property::__LF) // GB5
+    return true;
+
+  // *** Do not break Hangul syllable sequences. ***
+  if (__prev == __property::__L &&
+      (__next == __property::__L || __next == __property::__V || __next == __property::__LV ||
+       __next == __property::__LVT)) // GB6
+    return false;
+
+  if ((__prev == __property::__LV || __prev == __property::__V) &&
+      (__next == __property::__V || __next == __property::__T)) // GB7
+    return false;
+
+  if ((__prev == __property::__LVT || __prev == __property::__T) && __next == __property::__T) // GB8
+    return false;
+
+  // *** Do not break before extending characters or ZWJ. ***
+  if (__next == __property::__Extend || __next == __property::__ZWJ)
+    return false; // GB9
+
+  // *** Do not break before SpacingMarks, or after Prepend characters. ***
+  if (__next == __property::__SpacingMark) // GB9a
+    return false;
+
+  if (__prev == __property::__Prepend) // GB9b
+    return false;
+
+  // *** Do not break within emoji modifier sequences or emoji zwj sequences. ***
+
+  // GB11 \p{Extended_Pictographic} Extend* ZWJ x \p{Extended_Pictographic}
+  //
+  // Note that several parts of this rule are matched by GB9: Any x (Extend | ZWJ)
+  // - \p{Extended_Pictographic} x Extend
+  // - Extend x Extend
+  // - \p{Extended_Pictographic} x ZWJ
+  // - Extend x ZWJ
+  //
+  // So the only case left to test is
+  // - \p{Extended_Pictographic}' x ZWJ x \p{Extended_Pictographic}
+  //   where  \p{Extended_Pictographic}' is stored in __has_extened_pictographic
+  if (__has_extened_pictographic && __prev == __property::__ZWJ && __next == __property::__Extended_Pictographic)
+    return false;
+
+  // *** Do not break within emoji flag sequences ***
+
+  // That is, do not break between regional indicator (RI) symbols if there
+  // is an odd number of RI characters before the break point.
+
+  if (__prev == __property::__Regional_Indicator && __next == __property::__Regional_Indicator) { // GB12 + GB13
+    __ri_break_allowed = !__ri_break_allowed;
+    return __ri_break_allowed;
+  }
+
+  // *** Otherwise, break everywhere. ***
+  return true; // GB999
+}
+
+/// Helper class to extract an extended grapheme cluster from a Unicode character range.
+///
+/// This function is used to determine the column width of an extended grapheme
+/// cluster. In order to do that only the first code point is evaluated.
+/// Therefore only this code point is extracted.
+template <class _CharT>
+class __extended_grapheme_cluster_view {
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit __extended_grapheme_cluster_view(const _CharT* __first, const _CharT* __last)
+      : __code_point_view_(__first, __last),
+        __next_code_point_(__code_point_view_.__consume()),
+        __next_prop_(__extended_grapheme_custer_property_boundary::__get_property(__next_code_point_)) {}
+
+  struct __cluster {
+    /// The first code point of the extended grapheme cluster.
+    ///
+    /// The first code point is used to estimate the width of the extended
+    /// grapheme cluster.
+    char32_t __code_point_;
+
+    /// Points one beyond the last code unit in the extended grapheme cluster.
+    ///
+    /// It's expected the caller has the start position and thus can determine
+    /// the code unit range of the extended grapheme cluster.
+    const _CharT* __last_;
+  };
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __cluster __consume() {
+    _LIBCPP_ASSERT(
+        __next_prop_ != __extended_grapheme_custer_property_boundary::__property::__eot,
+        "can't move beyond the end of input");
+    char32_t __code_point = __next_code_point_;
+    if (!__code_point_view_.__at_end())
+      return {__code_point, __get_break()};
+
+    __next_prop_ = __extended_grapheme_custer_property_boundary::__property::__eot;
+    return {__code_point, __code_point_view_.__position()};
+  }
+
+private:
+  __code_point_view<_CharT> __code_point_view_;
+
+  char32_t __next_code_point_;
+  __extended_grapheme_custer_property_boundary::__property __next_prop_;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const _CharT* __get_break() {
+    bool __ri_break_allowed         = true;
+    bool __has_extened_pictographic = false;
+    while (true) {
+      const _CharT* __result                                          = __code_point_view_.__position();
+      __extended_grapheme_custer_property_boundary::__property __prev = __next_prop_;
+      if (__code_point_view_.__at_end()) {
+        __next_prop_ = __extended_grapheme_custer_property_boundary::__property::__eot;
+        return __result;
+      }
+      __next_code_point_ = __code_point_view_.__consume();
+      __next_prop_       = __extended_grapheme_custer_property_boundary::__get_property(__next_code_point_);
+
+      __has_extened_pictographic |=
+          __prev == __extended_grapheme_custer_property_boundary::__property::__Extended_Pictographic;
+
+      if (__at_extended_grapheme_cluster_break(__ri_break_allowed, __has_extened_pictographic, __prev, __next_prop_))
+        return __result;
+    }
+  }
+};
+
+template <class _CharT>
+__extended_grapheme_cluster_view(const _CharT*, const _CharT*) -> __extended_grapheme_cluster_view<_CharT>;
+
+#  else //  _LIBCPP_HAS_NO_UNICODE
+
+// For ASCII every character is a "code point".
+// This makes it easier to write code agnostic of the _LIBCPP_HAS_NO_UNICODE define.
+template <class _CharT>
+class __code_point_view {
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit __code_point_view(const _CharT* __first, const _CharT* __last)
+      : __first_(__first), __last_(__last) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr bool __at_end() const noexcept { return __first_ == __last_; }
+  _LIBCPP_HIDE_FROM_ABI constexpr const _CharT* __position() const noexcept { return __first_; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr char32_t __consume() noexcept {
+    _LIBCPP_ASSERT(__first_ != __last_, "can't move beyond the end of input");
+    return *__first_++;
+  }
+
+#    if _LIBCPP_STD_VER > 20
+  _LIBCPP_HIDE_FROM_ABI constexpr __consume_p2286_result __consume_p2286() noexcept {
+    _LIBCPP_ASSERT(__first_ != __last_, "can't move beyond the end of input");
+
+    return {0, std::make_unsigned_t<_CharT>(*__first_++)};
+  }
+#    endif // _LIBCPP_STD_VER > 20
+
+private:
+  const _CharT* __first_;
+  const _CharT* __last_;
+};
+
+#  endif //  _LIBCPP_HAS_NO_UNICODE
+
+} // namespace __unicode
+
+#endif //_LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FORMAT_UNICODE_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/binary_function.h b/app/src/main/cpp/libcxx/include/__functional/binary_function.h
new file mode 100644
index 0000000..fdedb8b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/binary_function.h
@@ -0,0 +1,54 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_BINARY_FUNCTION_H
+#define _LIBCPP___FUNCTIONAL_BINARY_FUNCTION_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_UNARY_BINARY_FUNCTION)
+
+template <class _Arg1, class _Arg2, class _Result>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 binary_function
+{
+    typedef _Arg1   first_argument_type;
+    typedef _Arg2   second_argument_type;
+    typedef _Result result_type;
+};
+
+#endif // _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_UNARY_BINARY_FUNCTION)
+
+template <class _Arg1, class _Arg2, class _Result> struct __binary_function_keep_layout_base {
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+  using first_argument_type _LIBCPP_DEPRECATED_IN_CXX17 = _Arg1;
+  using second_argument_type _LIBCPP_DEPRECATED_IN_CXX17 = _Arg2;
+  using result_type _LIBCPP_DEPRECATED_IN_CXX17 = _Result;
+#endif
+};
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_UNARY_BINARY_FUNCTION)
+_LIBCPP_DIAGNOSTIC_PUSH
+_LIBCPP_CLANG_DIAGNOSTIC_IGNORED("-Wdeprecated-declarations")
+template <class _Arg1, class _Arg2, class _Result>
+using __binary_function = binary_function<_Arg1, _Arg2, _Result>;
+_LIBCPP_DIAGNOSTIC_POP
+#else
+template <class _Arg1, class _Arg2, class _Result>
+using __binary_function = __binary_function_keep_layout_base<_Arg1, _Arg2, _Result>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_BINARY_FUNCTION_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/binary_negate.h b/app/src/main/cpp/libcxx/include/__functional/binary_negate.h
new file mode 100644
index 0000000..73ecea9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/binary_negate.h
@@ -0,0 +1,50 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_BINARY_NEGATE_H
+#define _LIBCPP___FUNCTIONAL_BINARY_NEGATE_H
+
+#include <__config>
+#include <__functional/binary_function.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_NEGATORS)
+
+template <class _Predicate>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX17 binary_negate
+    : public __binary_function<typename _Predicate::first_argument_type,
+                               typename _Predicate::second_argument_type,
+                               bool>
+{
+    _Predicate __pred_;
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit _LIBCPP_CONSTEXPR_SINCE_CXX14
+    binary_negate(const _Predicate& __pred) : __pred_(__pred) {}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const typename _Predicate::first_argument_type& __x,
+                    const typename _Predicate::second_argument_type& __y) const
+        {return !__pred_(__x, __y);}
+};
+
+template <class _Predicate>
+_LIBCPP_DEPRECATED_IN_CXX17 inline _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+binary_negate<_Predicate>
+not2(const _Predicate& __pred) {return binary_negate<_Predicate>(__pred);}
+
+#endif // _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_NEGATORS)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_BINARY_NEGATE_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/bind.h b/app/src/main/cpp/libcxx/include/__functional/bind.h
new file mode 100644
index 0000000..297e4e5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/bind.h
@@ -0,0 +1,389 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_BIND_H
+#define _LIBCPP___FUNCTIONAL_BIND_H
+
+#include <__config>
+#include <__functional/invoke.h>
+#include <__functional/weak_result_type.h>
+#include <cstddef>
+#include <tuple>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Tp>
+struct is_bind_expression : _If<
+    _IsSame<_Tp, __remove_cvref_t<_Tp> >::value,
+    false_type,
+    is_bind_expression<__remove_cvref_t<_Tp> >
+> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr size_t is_bind_expression_v = is_bind_expression<_Tp>::value;
+#endif
+
+template<class _Tp>
+struct is_placeholder : _If<
+    _IsSame<_Tp, __remove_cvref_t<_Tp> >::value,
+    integral_constant<int, 0>,
+    is_placeholder<__remove_cvref_t<_Tp> >
+> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr size_t is_placeholder_v = is_placeholder<_Tp>::value;
+#endif
+
+namespace placeholders
+{
+
+template <int _Np> struct __ph {};
+
+#if defined(_LIBCPP_CXX03_LANG) || defined(_LIBCPP_BUILDING_LIBRARY)
+_LIBCPP_FUNC_VIS extern const __ph<1>   _1;
+_LIBCPP_FUNC_VIS extern const __ph<2>   _2;
+_LIBCPP_FUNC_VIS extern const __ph<3>   _3;
+_LIBCPP_FUNC_VIS extern const __ph<4>   _4;
+_LIBCPP_FUNC_VIS extern const __ph<5>   _5;
+_LIBCPP_FUNC_VIS extern const __ph<6>   _6;
+_LIBCPP_FUNC_VIS extern const __ph<7>   _7;
+_LIBCPP_FUNC_VIS extern const __ph<8>   _8;
+_LIBCPP_FUNC_VIS extern const __ph<9>   _9;
+_LIBCPP_FUNC_VIS extern const __ph<10> _10;
+#else
+/* inline */ constexpr __ph<1>   _1{};
+/* inline */ constexpr __ph<2>   _2{};
+/* inline */ constexpr __ph<3>   _3{};
+/* inline */ constexpr __ph<4>   _4{};
+/* inline */ constexpr __ph<5>   _5{};
+/* inline */ constexpr __ph<6>   _6{};
+/* inline */ constexpr __ph<7>   _7{};
+/* inline */ constexpr __ph<8>   _8{};
+/* inline */ constexpr __ph<9>   _9{};
+/* inline */ constexpr __ph<10> _10{};
+#endif // defined(_LIBCPP_CXX03_LANG) || defined(_LIBCPP_BUILDING_LIBRARY)
+
+} // namespace placeholders
+
+template<int _Np>
+struct is_placeholder<placeholders::__ph<_Np> >
+    : public integral_constant<int, _Np> {};
+
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Uj>
+inline _LIBCPP_INLINE_VISIBILITY
+_Tp&
+__mu(reference_wrapper<_Tp> __t, _Uj&)
+{
+    return __t.get();
+}
+
+template <class _Ti, class ..._Uj, size_t ..._Indx>
+inline _LIBCPP_INLINE_VISIBILITY
+typename __invoke_of<_Ti&, _Uj...>::type
+__mu_expand(_Ti& __ti, tuple<_Uj...>& __uj, __tuple_indices<_Indx...>)
+{
+    return __ti(_VSTD::forward<_Uj>(_VSTD::get<_Indx>(__uj))...);
+}
+
+template <class _Ti, class ..._Uj>
+inline _LIBCPP_INLINE_VISIBILITY
+typename __enable_if_t
+<
+    is_bind_expression<_Ti>::value,
+    __invoke_of<_Ti&, _Uj...>
+>::type
+__mu(_Ti& __ti, tuple<_Uj...>& __uj)
+{
+    typedef typename __make_tuple_indices<sizeof...(_Uj)>::type __indices;
+    return _VSTD::__mu_expand(__ti, __uj, __indices());
+}
+
+template <bool IsPh, class _Ti, class _Uj>
+struct __mu_return2 {};
+
+template <class _Ti, class _Uj>
+struct __mu_return2<true, _Ti, _Uj>
+{
+    typedef typename tuple_element<is_placeholder<_Ti>::value - 1, _Uj>::type type;
+};
+
+template <class _Ti, class _Uj>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    0 < is_placeholder<_Ti>::value,
+    typename __mu_return2<0 < is_placeholder<_Ti>::value, _Ti, _Uj>::type
+>::type
+__mu(_Ti&, _Uj& __uj)
+{
+    const size_t _Indx = is_placeholder<_Ti>::value - 1;
+    return _VSTD::forward<typename tuple_element<_Indx, _Uj>::type>(_VSTD::get<_Indx>(__uj));
+}
+
+template <class _Ti, class _Uj>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    !is_bind_expression<_Ti>::value &&
+    is_placeholder<_Ti>::value == 0 &&
+    !__is_reference_wrapper<_Ti>::value,
+    _Ti&
+>::type
+__mu(_Ti& __ti, _Uj&)
+{
+    return __ti;
+}
+
+template <class _Ti, bool IsReferenceWrapper, bool IsBindEx, bool IsPh,
+          class _TupleUj>
+struct __mu_return_impl;
+
+template <bool _Invokable, class _Ti, class ..._Uj>
+struct __mu_return_invokable  // false
+{
+    typedef __nat type;
+};
+
+template <class _Ti, class ..._Uj>
+struct __mu_return_invokable<true, _Ti, _Uj...>
+{
+    typedef typename __invoke_of<_Ti&, _Uj...>::type type;
+};
+
+template <class _Ti, class ..._Uj>
+struct __mu_return_impl<_Ti, false, true, false, tuple<_Uj...> >
+    : public __mu_return_invokable<__invokable<_Ti&, _Uj...>::value, _Ti, _Uj...>
+{
+};
+
+template <class _Ti, class _TupleUj>
+struct __mu_return_impl<_Ti, false, false, true, _TupleUj>
+{
+    typedef typename tuple_element<is_placeholder<_Ti>::value - 1,
+                                   _TupleUj>::type&& type;
+};
+
+template <class _Ti, class _TupleUj>
+struct __mu_return_impl<_Ti, true, false, false, _TupleUj>
+{
+    typedef typename _Ti::type& type;
+};
+
+template <class _Ti, class _TupleUj>
+struct __mu_return_impl<_Ti, false, false, false, _TupleUj>
+{
+    typedef _Ti& type;
+};
+
+template <class _Ti, class _TupleUj>
+struct __mu_return
+    : public __mu_return_impl<_Ti,
+                              __is_reference_wrapper<_Ti>::value,
+                              is_bind_expression<_Ti>::value,
+                              0 < is_placeholder<_Ti>::value &&
+                              is_placeholder<_Ti>::value <= tuple_size<_TupleUj>::value,
+                              _TupleUj>
+{
+};
+
+template <class _Fp, class _BoundArgs, class _TupleUj>
+struct __is_valid_bind_return
+{
+    static const bool value = false;
+};
+
+template <class _Fp, class ..._BoundArgs, class _TupleUj>
+struct __is_valid_bind_return<_Fp, tuple<_BoundArgs...>, _TupleUj>
+{
+    static const bool value = __invokable<_Fp,
+                    typename __mu_return<_BoundArgs, _TupleUj>::type...>::value;
+};
+
+template <class _Fp, class ..._BoundArgs, class _TupleUj>
+struct __is_valid_bind_return<_Fp, const tuple<_BoundArgs...>, _TupleUj>
+{
+    static const bool value = __invokable<_Fp,
+                    typename __mu_return<const _BoundArgs, _TupleUj>::type...>::value;
+};
+
+template <class _Fp, class _BoundArgs, class _TupleUj,
+          bool = __is_valid_bind_return<_Fp, _BoundArgs, _TupleUj>::value>
+struct __bind_return;
+
+template <class _Fp, class ..._BoundArgs, class _TupleUj>
+struct __bind_return<_Fp, tuple<_BoundArgs...>, _TupleUj, true>
+{
+    typedef typename __invoke_of
+    <
+        _Fp&,
+        typename __mu_return
+        <
+            _BoundArgs,
+            _TupleUj
+        >::type...
+    >::type type;
+};
+
+template <class _Fp, class ..._BoundArgs, class _TupleUj>
+struct __bind_return<_Fp, const tuple<_BoundArgs...>, _TupleUj, true>
+{
+    typedef typename __invoke_of
+    <
+        _Fp&,
+        typename __mu_return
+        <
+            const _BoundArgs,
+            _TupleUj
+        >::type...
+    >::type type;
+};
+
+template <class _Fp, class _BoundArgs, size_t ..._Indx, class _Args>
+inline _LIBCPP_INLINE_VISIBILITY
+typename __bind_return<_Fp, _BoundArgs, _Args>::type
+__apply_functor(_Fp& __f, _BoundArgs& __bound_args, __tuple_indices<_Indx...>,
+                _Args&& __args)
+{
+    return _VSTD::__invoke(__f, _VSTD::__mu(_VSTD::get<_Indx>(__bound_args), __args)...);
+}
+
+template<class _Fp, class ..._BoundArgs>
+class __bind : public __weak_result_type<typename decay<_Fp>::type>
+{
+protected:
+    typedef typename decay<_Fp>::type _Fd;
+    typedef tuple<typename decay<_BoundArgs>::type...> _Td;
+private:
+    _Fd __f_;
+    _Td __bound_args_;
+
+    typedef typename __make_tuple_indices<sizeof...(_BoundArgs)>::type __indices;
+public:
+    template <class _Gp, class ..._BA,
+              class = typename enable_if
+                               <
+                                  is_constructible<_Fd, _Gp>::value &&
+                                  !is_same<__libcpp_remove_reference_t<_Gp>,
+                                           __bind>::value
+                               >::type>
+      _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+      explicit __bind(_Gp&& __f, _BA&& ...__bound_args)
+        : __f_(_VSTD::forward<_Gp>(__f)),
+          __bound_args_(_VSTD::forward<_BA>(__bound_args)...) {}
+
+    template <class ..._Args>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+        typename __bind_return<_Fd, _Td, tuple<_Args&&...> >::type
+        operator()(_Args&& ...__args)
+        {
+            return _VSTD::__apply_functor(__f_, __bound_args_, __indices(),
+                                  tuple<_Args&&...>(_VSTD::forward<_Args>(__args)...));
+        }
+
+    template <class ..._Args>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+        typename __bind_return<const _Fd, const _Td, tuple<_Args&&...> >::type
+        operator()(_Args&& ...__args) const
+        {
+            return _VSTD::__apply_functor(__f_, __bound_args_, __indices(),
+                                   tuple<_Args&&...>(_VSTD::forward<_Args>(__args)...));
+        }
+};
+
+template<class _Fp, class ..._BoundArgs>
+struct is_bind_expression<__bind<_Fp, _BoundArgs...> > : public true_type {};
+
+template<class _Rp, class _Fp, class ..._BoundArgs>
+class __bind_r
+    : public __bind<_Fp, _BoundArgs...>
+{
+    typedef __bind<_Fp, _BoundArgs...> base;
+    typedef typename base::_Fd _Fd;
+    typedef typename base::_Td _Td;
+public:
+    typedef _Rp result_type;
+
+
+    template <class _Gp, class ..._BA,
+              class = typename enable_if
+                               <
+                                  is_constructible<_Fd, _Gp>::value &&
+                                  !is_same<__libcpp_remove_reference_t<_Gp>,
+                                           __bind_r>::value
+                               >::type>
+      _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+      explicit __bind_r(_Gp&& __f, _BA&& ...__bound_args)
+        : base(_VSTD::forward<_Gp>(__f),
+               _VSTD::forward<_BA>(__bound_args)...) {}
+
+    template <class ..._Args>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+        typename enable_if
+        <
+            is_convertible<typename __bind_return<_Fd, _Td, tuple<_Args&&...> >::type,
+                           result_type>::value || is_void<_Rp>::value,
+            result_type
+        >::type
+        operator()(_Args&& ...__args)
+        {
+            typedef __invoke_void_return_wrapper<_Rp> _Invoker;
+            return _Invoker::__call(static_cast<base&>(*this), _VSTD::forward<_Args>(__args)...);
+        }
+
+    template <class ..._Args>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+        typename enable_if
+        <
+            is_convertible<typename __bind_return<const _Fd, const _Td, tuple<_Args&&...> >::type,
+                           result_type>::value || is_void<_Rp>::value,
+            result_type
+        >::type
+        operator()(_Args&& ...__args) const
+        {
+            typedef __invoke_void_return_wrapper<_Rp> _Invoker;
+            return _Invoker::__call(static_cast<base const&>(*this), _VSTD::forward<_Args>(__args)...);
+        }
+};
+
+template<class _Rp, class _Fp, class ..._BoundArgs>
+struct is_bind_expression<__bind_r<_Rp, _Fp, _BoundArgs...> > : public true_type {};
+
+template<class _Fp, class ..._BoundArgs>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+__bind<_Fp, _BoundArgs...>
+bind(_Fp&& __f, _BoundArgs&&... __bound_args)
+{
+    typedef __bind<_Fp, _BoundArgs...> type;
+    return type(_VSTD::forward<_Fp>(__f), _VSTD::forward<_BoundArgs>(__bound_args)...);
+}
+
+template<class _Rp, class _Fp, class ..._BoundArgs>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+__bind_r<_Rp, _Fp, _BoundArgs...>
+bind(_Fp&& __f, _BoundArgs&&... __bound_args)
+{
+    typedef __bind_r<_Rp, _Fp, _BoundArgs...> type;
+    return type(_VSTD::forward<_Fp>(__f), _VSTD::forward<_BoundArgs>(__bound_args)...);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_BIND_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/bind_back.h b/app/src/main/cpp/libcxx/include/__functional/bind_back.h
new file mode 100644
index 0000000..f0a6e49
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/bind_back.h
@@ -0,0 +1,64 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_BIND_BACK_H
+#define _LIBCPP___FUNCTIONAL_BIND_BACK_H
+
+#include <__config>
+#include <__functional/invoke.h>
+#include <__functional/perfect_forward.h>
+#include <__utility/forward.h>
+#include <__utility/integer_sequence.h>
+#include <tuple>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <size_t _NBound, class = make_index_sequence<_NBound>>
+struct __bind_back_op;
+
+template <size_t _NBound, size_t ..._Ip>
+struct __bind_back_op<_NBound, index_sequence<_Ip...>> {
+    template <class _Fn, class _BoundArgs, class... _Args>
+    _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Fn&& __f, _BoundArgs&& __bound_args, _Args&&... __args) const
+        noexcept(noexcept(_VSTD::invoke(_VSTD::forward<_Fn>(__f), _VSTD::forward<_Args>(__args)..., _VSTD::get<_Ip>(_VSTD::forward<_BoundArgs>(__bound_args))...)))
+        -> decltype(      _VSTD::invoke(_VSTD::forward<_Fn>(__f), _VSTD::forward<_Args>(__args)..., _VSTD::get<_Ip>(_VSTD::forward<_BoundArgs>(__bound_args))...))
+        { return          _VSTD::invoke(_VSTD::forward<_Fn>(__f), _VSTD::forward<_Args>(__args)..., _VSTD::get<_Ip>(_VSTD::forward<_BoundArgs>(__bound_args))...); }
+};
+
+template <class _Fn, class _BoundArgs>
+struct __bind_back_t : __perfect_forward<__bind_back_op<tuple_size_v<_BoundArgs>>, _Fn, _BoundArgs> {
+    using __perfect_forward<__bind_back_op<tuple_size_v<_BoundArgs>>, _Fn, _BoundArgs>::__perfect_forward;
+};
+
+template <class _Fn, class ..._Args, class = enable_if_t<
+    _And<
+        is_constructible<decay_t<_Fn>, _Fn>,
+        is_move_constructible<decay_t<_Fn>>,
+        is_constructible<decay_t<_Args>, _Args>...,
+        is_move_constructible<decay_t<_Args>>...
+    >::value
+>>
+_LIBCPP_HIDE_FROM_ABI
+constexpr auto __bind_back(_Fn&& __f, _Args&&... __args)
+    noexcept(noexcept(__bind_back_t<decay_t<_Fn>, tuple<decay_t<_Args>...>>(_VSTD::forward<_Fn>(__f), _VSTD::forward_as_tuple(_VSTD::forward<_Args>(__args)...))))
+    -> decltype(      __bind_back_t<decay_t<_Fn>, tuple<decay_t<_Args>...>>(_VSTD::forward<_Fn>(__f), _VSTD::forward_as_tuple(_VSTD::forward<_Args>(__args)...)))
+    { return          __bind_back_t<decay_t<_Fn>, tuple<decay_t<_Args>...>>(_VSTD::forward<_Fn>(__f), _VSTD::forward_as_tuple(_VSTD::forward<_Args>(__args)...)); }
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_BIND_BACK_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/bind_front.h b/app/src/main/cpp/libcxx/include/__functional/bind_front.h
new file mode 100644
index 0000000..22fb3a6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/bind_front.h
@@ -0,0 +1,58 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_BIND_FRONT_H
+#define _LIBCPP___FUNCTIONAL_BIND_FRONT_H
+
+#include <__config>
+#include <__functional/invoke.h>
+#include <__functional/perfect_forward.h>
+#include <__utility/forward.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+struct __bind_front_op {
+    template <class ..._Args>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Args&& ...__args) const
+        noexcept(noexcept(_VSTD::invoke(_VSTD::forward<_Args>(__args)...)))
+        -> decltype(      _VSTD::invoke(_VSTD::forward<_Args>(__args)...))
+        { return          _VSTD::invoke(_VSTD::forward<_Args>(__args)...); }
+};
+
+template <class _Fn, class ..._BoundArgs>
+struct __bind_front_t : __perfect_forward<__bind_front_op, _Fn, _BoundArgs...> {
+    using __perfect_forward<__bind_front_op, _Fn, _BoundArgs...>::__perfect_forward;
+};
+
+template <class _Fn, class... _Args, class = enable_if_t<
+    _And<
+        is_constructible<decay_t<_Fn>, _Fn>,
+        is_move_constructible<decay_t<_Fn>>,
+        is_constructible<decay_t<_Args>, _Args>...,
+        is_move_constructible<decay_t<_Args>>...
+    >::value
+>>
+_LIBCPP_HIDE_FROM_ABI
+constexpr auto bind_front(_Fn&& __f, _Args&&... __args) {
+    return __bind_front_t<decay_t<_Fn>, decay_t<_Args>...>(_VSTD::forward<_Fn>(__f), _VSTD::forward<_Args>(__args)...);
+}
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_BIND_FRONT_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/binder1st.h b/app/src/main/cpp/libcxx/include/__functional/binder1st.h
new file mode 100644
index 0000000..dea22c7
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/binder1st.h
@@ -0,0 +1,53 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_BINDER1ST_H
+#define _LIBCPP___FUNCTIONAL_BINDER1ST_H
+
+#include <__config>
+#include <__functional/unary_function.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_BINDERS)
+
+template <class __Operation>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 binder1st
+    : public __unary_function<typename __Operation::second_argument_type, typename __Operation::result_type>
+{
+protected:
+    __Operation                               op;
+    typename __Operation::first_argument_type value;
+public:
+    _LIBCPP_INLINE_VISIBILITY binder1st(const __Operation& __x,
+                               const typename __Operation::first_argument_type __y)
+        : op(__x), value(__y) {}
+    _LIBCPP_INLINE_VISIBILITY typename __Operation::result_type operator()
+        (typename __Operation::second_argument_type& __x) const
+            {return op(value, __x);}
+    _LIBCPP_INLINE_VISIBILITY typename __Operation::result_type operator()
+        (const typename __Operation::second_argument_type& __x) const
+            {return op(value, __x);}
+};
+
+template <class __Operation, class _Tp>
+_LIBCPP_DEPRECATED_IN_CXX11 inline _LIBCPP_INLINE_VISIBILITY
+binder1st<__Operation>
+bind1st(const __Operation& __op, const _Tp& __x)
+    {return binder1st<__Operation>(__op, __x);}
+
+#endif // _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_BINDERS)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_BINDER1ST_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/binder2nd.h b/app/src/main/cpp/libcxx/include/__functional/binder2nd.h
new file mode 100644
index 0000000..c98a146
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/binder2nd.h
@@ -0,0 +1,53 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_BINDER2ND_H
+#define _LIBCPP___FUNCTIONAL_BINDER2ND_H
+
+#include <__config>
+#include <__functional/unary_function.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_BINDERS)
+
+template <class __Operation>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 binder2nd
+    : public __unary_function<typename __Operation::first_argument_type, typename __Operation::result_type>
+{
+protected:
+    __Operation                                op;
+    typename __Operation::second_argument_type value;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    binder2nd(const __Operation& __x, const typename __Operation::second_argument_type __y)
+        : op(__x), value(__y) {}
+    _LIBCPP_INLINE_VISIBILITY typename __Operation::result_type operator()
+        (      typename __Operation::first_argument_type& __x) const
+            {return op(__x, value);}
+    _LIBCPP_INLINE_VISIBILITY typename __Operation::result_type operator()
+        (const typename __Operation::first_argument_type& __x) const
+            {return op(__x, value);}
+};
+
+template <class __Operation, class _Tp>
+_LIBCPP_DEPRECATED_IN_CXX11 inline _LIBCPP_INLINE_VISIBILITY
+binder2nd<__Operation>
+bind2nd(const __Operation& __op, const _Tp& __x)
+    {return binder2nd<__Operation>(__op, __x);}
+
+#endif // _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_BINDERS)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_BINDER2ND_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/boyer_moore_searcher.h b/app/src/main/cpp/libcxx/include/__functional/boyer_moore_searcher.h
new file mode 100644
index 0000000..a675089
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/boyer_moore_searcher.h
@@ -0,0 +1,315 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_BOYER_MOORE_SEARCHER_H
+#define _LIBCPP___FUNCTIONAL_BOYER_MOORE_SEARCHER_H
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#include <__algorithm/fill_n.h>
+#include <__config>
+#include <__functional/hash.h>
+#include <__functional/operations.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/shared_ptr.h>
+#include <__utility/pair.h>
+#include <array>
+#include <unordered_map>
+#include <vector>
+
+#if _LIBCPP_STD_VER > 14
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Key,
+          class _Value,
+          class _Hash,
+          class _BinaryPredicate,
+          bool /*useArray*/>
+class _BMSkipTable;
+
+// General case for BM data searching; use a map
+template <class _Key,
+          class _Value,
+          class _Hash,
+          class _BinaryPredicate>
+class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, false> {
+private:
+  using value_type = _Value;
+  using key_type = _Key;
+
+  const value_type __default_value_;
+  unordered_map<_Key, _Value, _Hash, _BinaryPredicate> __table_;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI
+  explicit _BMSkipTable(size_t __sz, value_type __default_value, _Hash __hash, _BinaryPredicate __pred)
+      : __default_value_(__default_value),
+        __table_(__sz, __hash, __pred) {}
+
+  _LIBCPP_HIDE_FROM_ABI void insert(const key_type& __key, value_type __val) {
+    __table_[__key] = __val;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI value_type operator[](const key_type& __key) const {
+    auto __it = __table_.find(__key);
+    return __it == __table_.end() ? __default_value_ : __it->second;
+  }
+};
+
+// Special case small numeric values; use an array
+template <class _Key,
+          class _Value,
+          class _Hash,
+          class _BinaryPredicate>
+class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, true> {
+private:
+  using value_type = _Value;
+  using key_type = _Key;
+
+  using unsigned_key_type = make_unsigned_t<key_type>;
+  std::array<value_type, 256> __table_;
+  static_assert(numeric_limits<unsigned_key_type>::max() < 256);
+
+public:
+  _LIBCPP_HIDE_FROM_ABI explicit _BMSkipTable(size_t, value_type __default_value, _Hash, _BinaryPredicate) {
+    std::fill_n(__table_.data(), __table_.size(), __default_value);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI void insert(key_type __key, value_type __val) {
+    __table_[static_cast<unsigned_key_type>(__key)] = __val;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI value_type operator[](key_type __key) const {
+    return __table_[static_cast<unsigned_key_type>(__key)];
+  }
+};
+
+template <class _RandomAccessIterator1,
+          class _Hash = hash<typename iterator_traits<_RandomAccessIterator1>::value_type>,
+          class _BinaryPredicate = equal_to<>>
+class _LIBCPP_TEMPLATE_VIS boyer_moore_searcher {
+private:
+  using difference_type = typename std::iterator_traits<_RandomAccessIterator1>::difference_type;
+  using value_type = typename std::iterator_traits<_RandomAccessIterator1>::value_type;
+  using __skip_table_type = _BMSkipTable<value_type,
+                                         difference_type,
+                                         _Hash,
+                                         _BinaryPredicate,
+                                         is_integral_v<value_type>
+                                      && sizeof(value_type) == 1
+                                      && is_same_v<_Hash, hash<value_type>>
+                                      && is_same_v<_BinaryPredicate, equal_to<>>>;
+
+public:
+  boyer_moore_searcher(_RandomAccessIterator1 __first,
+                       _RandomAccessIterator1 __last,
+                       _Hash __hash = _Hash(),
+                       _BinaryPredicate __pred = _BinaryPredicate())
+    : __first_(__first),
+      __last_(__last),
+      __pred_(__pred),
+      __pattern_length_(__last - __first),
+      __skip_table_(std::make_shared<__skip_table_type>(__pattern_length_, -1, __hash, __pred_)),
+      __suffix_(std::__allocate_shared_unbounded_array<difference_type[]>(
+          allocator<difference_type>(), __pattern_length_ + 1)) {
+    difference_type __i = 0;
+    while (__first != __last) {
+      __skip_table_->insert(*__first, __i);
+      ++__first;
+      ++__i;
+    }
+    __build_suffix_table(__first_, __last_, __pred_);
+  }
+
+  template <class _RandomAccessIterator2>
+  pair<_RandomAccessIterator2, _RandomAccessIterator2>
+  operator()(_RandomAccessIterator2 __first, _RandomAccessIterator2 __last) const {
+    static_assert(__is_same_uncvref<typename iterator_traits<_RandomAccessIterator1>::value_type,
+                                    typename iterator_traits<_RandomAccessIterator2>::value_type>::value,
+                  "Corpus and Pattern iterators must point to the same type");
+    if (__first == __last)
+      return std::make_pair(__last, __last);
+    if (__first_ == __last_)
+      return std::make_pair(__first, __first);
+
+    if (__pattern_length_ > (__last - __first))
+      return std::make_pair(__last, __last);
+    return __search(__first, __last);
+  }
+
+private:
+  _RandomAccessIterator1 __first_;
+  _RandomAccessIterator1 __last_;
+  _BinaryPredicate __pred_;
+  difference_type __pattern_length_;
+  shared_ptr<__skip_table_type> __skip_table_;
+  shared_ptr<difference_type[]> __suffix_;
+
+  template <class _RandomAccessIterator2>
+  pair<_RandomAccessIterator2, _RandomAccessIterator2>
+  __search(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const {
+    _RandomAccessIterator2 __current = __f;
+    const _RandomAccessIterator2 __last = __l - __pattern_length_;
+    const __skip_table_type& __skip_table = *__skip_table_;
+
+    while (__current <= __last) {
+      difference_type __j = __pattern_length_;
+      while (__pred_(__first_[__j - 1], __current[__j - 1])) {
+        --__j;
+        if (__j == 0)
+          return std::make_pair(__current, __current + __pattern_length_);
+      }
+
+      difference_type __k = __skip_table[__current[__j - 1]];
+      difference_type __m = __j - __k - 1;
+      if (__k < __j && __m > __suffix_[__j])
+        __current += __m;
+      else
+        __current += __suffix_[__j];
+    }
+    return std::make_pair(__l, __l);
+  }
+
+  template <class _Iterator, class _Container>
+  void __compute_bm_prefix(_Iterator __first, _Iterator __last, _BinaryPredicate __pred, _Container& __prefix) {
+    const size_t __count = __last - __first;
+
+    __prefix[0] = 0;
+    size_t __k = 0;
+
+    for (size_t __i = 1; __i != __count; ++__i) {
+      while (__k > 0 && !__pred(__first[__k], __first[__i]))
+        __k = __prefix[__k - 1];
+
+      if (__pred(__first[__k], __first[__i]))
+        ++__k;
+      __prefix[__i] = __k;
+    }
+  }
+
+  void __build_suffix_table(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _BinaryPredicate __pred) {
+    const size_t __count = __last - __first;
+
+    if (__count == 0)
+      return;
+
+    vector<difference_type> __scratch(__count);
+
+    __compute_bm_prefix(__first, __last, __pred, __scratch);
+    for (size_t __i = 0; __i <= __count; ++__i)
+      __suffix_[__i] = __count - __scratch[__count - 1];
+
+    using _ReverseIter = reverse_iterator<_RandomAccessIterator1>;
+    __compute_bm_prefix(_ReverseIter(__last), _ReverseIter(__first), __pred, __scratch);
+
+    for (size_t __i = 0; __i != __count; ++__i) {
+      const size_t __j = __count - __scratch[__i];
+      const difference_type __k = __i - __scratch[__i] + 1;
+
+      if (__suffix_[__j] > __k)
+        __suffix_[__j] = __k;
+    }
+  }
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(boyer_moore_searcher);
+
+template <class _RandomAccessIterator1,
+          class _Hash = hash<typename iterator_traits<_RandomAccessIterator1>::value_type>,
+          class _BinaryPredicate = equal_to<>>
+class _LIBCPP_TEMPLATE_VIS boyer_moore_horspool_searcher {
+private:
+  using difference_type = typename iterator_traits<_RandomAccessIterator1>::difference_type;
+  using value_type = typename iterator_traits<_RandomAccessIterator1>::value_type;
+  using __skip_table_type = _BMSkipTable<value_type,
+                                         difference_type,
+                                         _Hash,
+                                         _BinaryPredicate,
+                                         is_integral_v<value_type>
+                                      && sizeof(value_type) == 1
+                                      && is_same_v<_Hash, hash<value_type>>
+                                      && is_same_v<_BinaryPredicate, equal_to<>>>;
+public:
+  boyer_moore_horspool_searcher(_RandomAccessIterator1 __first,
+                                _RandomAccessIterator1 __last,
+                                _Hash __hash = _Hash(),
+                                _BinaryPredicate __pred = _BinaryPredicate())
+    : __first_(__first),
+      __last_(__last),
+      __pred_(__pred),
+      __pattern_length_(__last - __first),
+      __skip_table_(std::make_shared<__skip_table_type>(__pattern_length_, __pattern_length_, __hash, __pred_)) {
+    if (__first == __last)
+      return;
+    --__last;
+    difference_type __i = 0;
+    while (__first != __last) {
+      __skip_table_->insert(*__first, __pattern_length_ - 1 - __i);
+      ++__first;
+      ++__i;
+    }
+  }
+
+  template <class _RandomAccessIterator2>
+  pair<_RandomAccessIterator2, _RandomAccessIterator2>
+  operator()(_RandomAccessIterator2 __first, _RandomAccessIterator2 __last) const {
+    static_assert(__is_same_uncvref<typename std::iterator_traits<_RandomAccessIterator1>::value_type,
+                                    typename std::iterator_traits<_RandomAccessIterator2>::value_type>::value,
+                  "Corpus and Pattern iterators must point to the same type");
+    if (__first == __last)
+      return std::make_pair(__last, __last);
+    if (__first_ == __last_)
+      return std::make_pair(__first, __first);
+
+    if (__pattern_length_ > __last - __first)
+      return std::make_pair(__last, __last);
+
+    return __search(__first, __last);
+  }
+
+private:
+  _RandomAccessIterator1 __first_;
+  _RandomAccessIterator1 __last_;
+  _BinaryPredicate __pred_;
+  difference_type __pattern_length_;
+  shared_ptr<__skip_table_type> __skip_table_;
+
+  template <class _RandomAccessIterator2>
+  pair<_RandomAccessIterator2, _RandomAccessIterator2>
+  __search(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const {
+    _RandomAccessIterator2 __current = __f;
+    const _RandomAccessIterator2 __last = __l - __pattern_length_;
+    const __skip_table_type& __skip_table = *__skip_table_;
+
+    while (__current <= __last) {
+      difference_type __j = __pattern_length_;
+      while (__pred_(__first_[__j - 1], __current[__j - 1])) {
+        --__j;
+        if (__j == 0)
+          return std::make_pair(__current, __current + __pattern_length_);
+      }
+      __current += __skip_table[__current[__pattern_length_ - 1]];
+    }
+    return std::make_pair(__l, __l);
+  }
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(boyer_moore_horspool_searcher);
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP_STD_VER > 14
+
+#endif // _LIBCPP___FUNCTIONAL_BOYER_MOORE_SEARCHER_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/compose.h b/app/src/main/cpp/libcxx/include/__functional/compose.h
new file mode 100644
index 0000000..25213f2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/compose.h
@@ -0,0 +1,52 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_COMPOSE_H
+#define _LIBCPP___FUNCTIONAL_COMPOSE_H
+
+#include <__config>
+#include <__functional/invoke.h>
+#include <__functional/perfect_forward.h>
+#include <__utility/forward.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+struct __compose_op {
+    template<class _Fn1, class _Fn2, class ..._Args>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Fn1&& __f1, _Fn2&& __f2, _Args&&... __args) const
+        noexcept(noexcept(_VSTD::invoke(_VSTD::forward<_Fn1>(__f1), _VSTD::invoke(_VSTD::forward<_Fn2>(__f2), _VSTD::forward<_Args>(__args)...))))
+        -> decltype(      _VSTD::invoke(_VSTD::forward<_Fn1>(__f1), _VSTD::invoke(_VSTD::forward<_Fn2>(__f2), _VSTD::forward<_Args>(__args)...)))
+        { return          _VSTD::invoke(_VSTD::forward<_Fn1>(__f1), _VSTD::invoke(_VSTD::forward<_Fn2>(__f2), _VSTD::forward<_Args>(__args)...)); }
+};
+
+template <class _Fn1, class _Fn2>
+struct __compose_t : __perfect_forward<__compose_op, _Fn1, _Fn2> {
+    using __perfect_forward<__compose_op, _Fn1, _Fn2>::__perfect_forward;
+};
+
+template <class _Fn1, class _Fn2>
+_LIBCPP_HIDE_FROM_ABI
+constexpr auto __compose(_Fn1&& __f1, _Fn2&& __f2)
+    noexcept(noexcept(__compose_t<decay_t<_Fn1>, decay_t<_Fn2>>(_VSTD::forward<_Fn1>(__f1), _VSTD::forward<_Fn2>(__f2))))
+    -> decltype(      __compose_t<decay_t<_Fn1>, decay_t<_Fn2>>(_VSTD::forward<_Fn1>(__f1), _VSTD::forward<_Fn2>(__f2)))
+    { return          __compose_t<decay_t<_Fn1>, decay_t<_Fn2>>(_VSTD::forward<_Fn1>(__f1), _VSTD::forward<_Fn2>(__f2)); }
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_COMPOSE_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/default_searcher.h b/app/src/main/cpp/libcxx/include/__functional/default_searcher.h
new file mode 100644
index 0000000..e4151e5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/default_searcher.h
@@ -0,0 +1,57 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_DEFAULT_SEARCHER_H
+#define _LIBCPP___FUNCTIONAL_DEFAULT_SEARCHER_H
+
+#include <__algorithm/search.h>
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/operations.h>
+#include <__iterator/iterator_traits.h>
+#include <__utility/pair.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+// default searcher
+template<class _ForwardIterator, class _BinaryPredicate = equal_to<>>
+class _LIBCPP_TEMPLATE_VIS default_searcher {
+public:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    default_searcher(_ForwardIterator __f, _ForwardIterator __l,
+                       _BinaryPredicate __p = _BinaryPredicate())
+        : __first_(__f), __last_(__l), __pred_(__p) {}
+
+    template <typename _ForwardIterator2>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    pair<_ForwardIterator2, _ForwardIterator2>
+    operator () (_ForwardIterator2 __f, _ForwardIterator2 __l) const
+    {
+        auto __proj = __identity();
+        return std::__search_impl(__f, __l, __first_, __last_, __pred_, __proj, __proj);
+    }
+
+private:
+    _ForwardIterator __first_;
+    _ForwardIterator __last_;
+    _BinaryPredicate __pred_;
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(default_searcher);
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_DEFAULT_SEARCHER_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/function.h b/app/src/main/cpp/libcxx/include/__functional/function.h
new file mode 100644
index 0000000..ca79d33
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/function.h
@@ -0,0 +1,1216 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_FUNCTION_H
+#define _LIBCPP___FUNCTIONAL_FUNCTION_H
+
+#include <__assert>
+#include <__config>
+#include <__functional/binary_function.h>
+#include <__functional/invoke.h>
+#include <__functional/unary_function.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__memory/allocator.h>
+#include <__memory/allocator_destructor.h>
+#include <__memory/allocator_traits.h>
+#include <__memory/builtin_new_allocator.h>
+#include <__memory/compressed_pair.h>
+#include <__memory/unique_ptr.h>
+#include <__type_traits/strip_signature.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/piecewise_construct.h>
+#include <__utility/swap.h>
+#include <exception>
+#include <new>
+#include <tuple>
+#include <type_traits>
+#include <typeinfo>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// bad_function_call
+
+_LIBCPP_DIAGNOSTIC_PUSH
+_LIBCPP_CLANG_DIAGNOSTIC_IGNORED("-Wweak-vtables")
+class _LIBCPP_EXCEPTION_ABI bad_function_call
+    : public exception
+{
+public:
+// Note that when a key function is not used, every translation unit that uses
+// bad_function_call will end up containing a weak definition of the vtable and
+// typeinfo.
+#ifdef _LIBCPP_ABI_BAD_FUNCTION_CALL_KEY_FUNCTION
+    ~bad_function_call() _NOEXCEPT override;
+#else
+    ~bad_function_call() _NOEXCEPT override {}
+#endif
+
+#ifdef _LIBCPP_ABI_BAD_FUNCTION_CALL_GOOD_WHAT_MESSAGE
+    const char* what() const _NOEXCEPT override;
+#endif
+};
+_LIBCPP_DIAGNOSTIC_POP
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_bad_function_call()
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw bad_function_call();
+#else
+    _VSTD::abort();
+#endif
+}
+
+template<class _Fp> class _LIBCPP_TEMPLATE_VIS function; // undefined
+
+namespace __function
+{
+
+template<class _Rp>
+struct __maybe_derive_from_unary_function
+{
+};
+
+template<class _Rp, class _A1>
+struct __maybe_derive_from_unary_function<_Rp(_A1)>
+    : public __unary_function<_A1, _Rp>
+{
+};
+
+template<class _Rp>
+struct __maybe_derive_from_binary_function
+{
+};
+
+template<class _Rp, class _A1, class _A2>
+struct __maybe_derive_from_binary_function<_Rp(_A1, _A2)>
+    : public __binary_function<_A1, _A2, _Rp>
+{
+};
+
+template <class _Fp>
+_LIBCPP_INLINE_VISIBILITY
+bool __not_null(_Fp const&) { return true; }
+
+template <class _Fp>
+_LIBCPP_INLINE_VISIBILITY
+bool __not_null(_Fp* __ptr) { return __ptr; }
+
+template <class _Ret, class _Class>
+_LIBCPP_INLINE_VISIBILITY
+bool __not_null(_Ret _Class::*__ptr) { return __ptr; }
+
+template <class _Fp>
+_LIBCPP_INLINE_VISIBILITY
+bool __not_null(function<_Fp> const& __f) { return !!__f; }
+
+#ifdef _LIBCPP_HAS_EXTENSION_BLOCKS
+template <class _Rp, class ..._Args>
+_LIBCPP_INLINE_VISIBILITY
+bool __not_null(_Rp (^__p)(_Args...)) { return __p; }
+#endif
+
+} // namespace __function
+
+namespace __function {
+
+// __alloc_func holds a functor and an allocator.
+
+template <class _Fp, class _Ap, class _FB> class __alloc_func;
+template <class _Fp, class _FB>
+class __default_alloc_func;
+
+template <class _Fp, class _Ap, class _Rp, class... _ArgTypes>
+class __alloc_func<_Fp, _Ap, _Rp(_ArgTypes...)>
+{
+    __compressed_pair<_Fp, _Ap> __f_;
+
+  public:
+    typedef _LIBCPP_NODEBUG _Fp _Target;
+    typedef _LIBCPP_NODEBUG _Ap _Alloc;
+
+    _LIBCPP_INLINE_VISIBILITY
+    const _Target& __target() const { return __f_.first(); }
+
+    // WIN32 APIs may define __allocator, so use __get_allocator instead.
+    _LIBCPP_INLINE_VISIBILITY
+    const _Alloc& __get_allocator() const { return __f_.second(); }
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __alloc_func(_Target&& __f)
+        : __f_(piecewise_construct, _VSTD::forward_as_tuple(_VSTD::move(__f)),
+               _VSTD::forward_as_tuple())
+    {
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __alloc_func(const _Target& __f, const _Alloc& __a)
+        : __f_(piecewise_construct, _VSTD::forward_as_tuple(__f),
+               _VSTD::forward_as_tuple(__a))
+    {
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __alloc_func(const _Target& __f, _Alloc&& __a)
+        : __f_(piecewise_construct, _VSTD::forward_as_tuple(__f),
+               _VSTD::forward_as_tuple(_VSTD::move(__a)))
+    {
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __alloc_func(_Target&& __f, _Alloc&& __a)
+        : __f_(piecewise_construct, _VSTD::forward_as_tuple(_VSTD::move(__f)),
+               _VSTD::forward_as_tuple(_VSTD::move(__a)))
+    {
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Rp operator()(_ArgTypes&&... __arg)
+    {
+        typedef __invoke_void_return_wrapper<_Rp> _Invoker;
+        return _Invoker::__call(__f_.first(),
+                                _VSTD::forward<_ArgTypes>(__arg)...);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __alloc_func* __clone() const
+    {
+        typedef allocator_traits<_Alloc> __alloc_traits;
+        typedef __rebind_alloc<__alloc_traits, __alloc_func> _AA;
+        _AA __a(__f_.second());
+        typedef __allocator_destructor<_AA> _Dp;
+        unique_ptr<__alloc_func, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
+        ::new ((void*)__hold.get()) __alloc_func(__f_.first(), _Alloc(__a));
+        return __hold.release();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void destroy() _NOEXCEPT { __f_.~__compressed_pair<_Target, _Alloc>(); }
+
+    static void __destroy_and_delete(__alloc_func* __f) {
+      typedef allocator_traits<_Alloc> __alloc_traits;
+      typedef __rebind_alloc<__alloc_traits, __alloc_func> _FunAlloc;
+      _FunAlloc __a(__f->__get_allocator());
+      __f->destroy();
+      __a.deallocate(__f, 1);
+    }
+};
+
+template <class _Fp, class _Rp, class... _ArgTypes>
+class __default_alloc_func<_Fp, _Rp(_ArgTypes...)> {
+  _Fp __f_;
+
+public:
+  typedef _LIBCPP_NODEBUG _Fp _Target;
+
+  _LIBCPP_INLINE_VISIBILITY
+  const _Target& __target() const { return __f_; }
+
+  _LIBCPP_INLINE_VISIBILITY
+  explicit __default_alloc_func(_Target&& __f) : __f_(_VSTD::move(__f)) {}
+
+  _LIBCPP_INLINE_VISIBILITY
+  explicit __default_alloc_func(const _Target& __f) : __f_(__f) {}
+
+  _LIBCPP_INLINE_VISIBILITY
+  _Rp operator()(_ArgTypes&&... __arg) {
+    typedef __invoke_void_return_wrapper<_Rp> _Invoker;
+    return _Invoker::__call(__f_, _VSTD::forward<_ArgTypes>(__arg)...);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  __default_alloc_func* __clone() const {
+      __builtin_new_allocator::__holder_t __hold =
+        __builtin_new_allocator::__allocate_type<__default_alloc_func>(1);
+    __default_alloc_func* __res =
+        ::new ((void*)__hold.get()) __default_alloc_func(__f_);
+    (void)__hold.release();
+    return __res;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void destroy() _NOEXCEPT { __f_.~_Target(); }
+
+  static void __destroy_and_delete(__default_alloc_func* __f) {
+    __f->destroy();
+      __builtin_new_allocator::__deallocate_type<__default_alloc_func>(__f, 1);
+  }
+};
+
+// __base provides an abstract interface for copyable functors.
+
+template<class _Fp> class _LIBCPP_TEMPLATE_VIS __base;
+
+template<class _Rp, class ..._ArgTypes>
+class __base<_Rp(_ArgTypes...)>
+{
+    __base(const __base&);
+    __base& operator=(const __base&);
+public:
+    _LIBCPP_INLINE_VISIBILITY __base() {}
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL virtual ~__base() {}
+    virtual __base* __clone() const = 0;
+    virtual void __clone(__base*) const = 0;
+    virtual void destroy() _NOEXCEPT = 0;
+    virtual void destroy_deallocate() _NOEXCEPT = 0;
+    virtual _Rp operator()(_ArgTypes&& ...) = 0;
+#ifndef _LIBCPP_NO_RTTI
+    virtual const void* target(const type_info&) const _NOEXCEPT = 0;
+    virtual const std::type_info& target_type() const _NOEXCEPT = 0;
+#endif // _LIBCPP_NO_RTTI
+};
+
+// __func implements __base for a given functor type.
+
+template<class _FD, class _Alloc, class _FB> class __func;
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+class __func<_Fp, _Alloc, _Rp(_ArgTypes...)>
+    : public  __base<_Rp(_ArgTypes...)>
+{
+    __alloc_func<_Fp, _Alloc, _Rp(_ArgTypes...)> __f_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __func(_Fp&& __f)
+        : __f_(_VSTD::move(__f)) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __func(const _Fp& __f, const _Alloc& __a)
+        : __f_(__f, __a) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __func(const _Fp& __f, _Alloc&& __a)
+        : __f_(__f, _VSTD::move(__a)) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __func(_Fp&& __f, _Alloc&& __a)
+        : __f_(_VSTD::move(__f), _VSTD::move(__a)) {}
+
+    virtual __base<_Rp(_ArgTypes...)>* __clone() const;
+    virtual void __clone(__base<_Rp(_ArgTypes...)>*) const;
+    virtual void destroy() _NOEXCEPT;
+    virtual void destroy_deallocate() _NOEXCEPT;
+    virtual _Rp operator()(_ArgTypes&&... __arg);
+#ifndef _LIBCPP_NO_RTTI
+    virtual const void* target(const type_info&) const _NOEXCEPT;
+    virtual const std::type_info& target_type() const _NOEXCEPT;
+#endif // _LIBCPP_NO_RTTI
+};
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+__base<_Rp(_ArgTypes...)>*
+__func<_Fp, _Alloc, _Rp(_ArgTypes...)>::__clone() const
+{
+    typedef allocator_traits<_Alloc> __alloc_traits;
+    typedef __rebind_alloc<__alloc_traits, __func> _Ap;
+    _Ap __a(__f_.__get_allocator());
+    typedef __allocator_destructor<_Ap> _Dp;
+    unique_ptr<__func, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
+    ::new ((void*)__hold.get()) __func(__f_.__target(), _Alloc(__a));
+    return __hold.release();
+}
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+void
+__func<_Fp, _Alloc, _Rp(_ArgTypes...)>::__clone(__base<_Rp(_ArgTypes...)>* __p) const
+{
+    ::new ((void*)__p) __func(__f_.__target(), __f_.__get_allocator());
+}
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+void
+__func<_Fp, _Alloc, _Rp(_ArgTypes...)>::destroy() _NOEXCEPT
+{
+    __f_.destroy();
+}
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+void
+__func<_Fp, _Alloc, _Rp(_ArgTypes...)>::destroy_deallocate() _NOEXCEPT
+{
+    typedef allocator_traits<_Alloc> __alloc_traits;
+    typedef __rebind_alloc<__alloc_traits, __func> _Ap;
+    _Ap __a(__f_.__get_allocator());
+    __f_.destroy();
+    __a.deallocate(this, 1);
+}
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+_Rp
+__func<_Fp, _Alloc, _Rp(_ArgTypes...)>::operator()(_ArgTypes&& ... __arg)
+{
+    return __f_(_VSTD::forward<_ArgTypes>(__arg)...);
+}
+
+#ifndef _LIBCPP_NO_RTTI
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+const void*
+__func<_Fp, _Alloc, _Rp(_ArgTypes...)>::target(const type_info& __ti) const _NOEXCEPT
+{
+    if (__ti == typeid(_Fp))
+        return _VSTD::addressof(__f_.__target());
+    return nullptr;
+}
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+const std::type_info&
+__func<_Fp, _Alloc, _Rp(_ArgTypes...)>::target_type() const _NOEXCEPT
+{
+    return typeid(_Fp);
+}
+
+#endif // _LIBCPP_NO_RTTI
+
+// __value_func creates a value-type from a __func.
+
+template <class _Fp> class __value_func;
+
+template <class _Rp, class... _ArgTypes> class __value_func<_Rp(_ArgTypes...)>
+{
+    _LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    typename aligned_storage<3 * sizeof(void*)>::type __buf_;
+    _LIBCPP_SUPPRESS_DEPRECATED_POP
+
+    typedef __base<_Rp(_ArgTypes...)> __func;
+    __func* __f_;
+
+    _LIBCPP_NO_CFI static __func* __as_base(void* __p)
+    {
+        return reinterpret_cast<__func*>(__p);
+    }
+
+  public:
+    _LIBCPP_INLINE_VISIBILITY
+    __value_func() _NOEXCEPT : __f_(nullptr) {}
+
+    template <class _Fp, class _Alloc>
+    _LIBCPP_INLINE_VISIBILITY __value_func(_Fp&& __f, const _Alloc& __a)
+        : __f_(nullptr)
+    {
+        typedef allocator_traits<_Alloc> __alloc_traits;
+        typedef __function::__func<_Fp, _Alloc, _Rp(_ArgTypes...)> _Fun;
+        typedef __rebind_alloc<__alloc_traits, _Fun> _FunAlloc;
+
+        if (__function::__not_null(__f))
+        {
+            _FunAlloc __af(__a);
+            if (sizeof(_Fun) <= sizeof(__buf_) &&
+                is_nothrow_copy_constructible<_Fp>::value &&
+                is_nothrow_copy_constructible<_FunAlloc>::value)
+            {
+                __f_ =
+                    ::new ((void*)&__buf_) _Fun(_VSTD::move(__f), _Alloc(__af));
+            }
+            else
+            {
+                typedef __allocator_destructor<_FunAlloc> _Dp;
+                unique_ptr<__func, _Dp> __hold(__af.allocate(1), _Dp(__af, 1));
+                ::new ((void*)__hold.get()) _Fun(_VSTD::move(__f), _Alloc(__a));
+                __f_ = __hold.release();
+            }
+        }
+    }
+
+    template <class _Fp,
+        class = typename enable_if<!is_same<typename decay<_Fp>::type, __value_func>::value>::type>
+    _LIBCPP_INLINE_VISIBILITY explicit __value_func(_Fp&& __f)
+        : __value_func(_VSTD::forward<_Fp>(__f), allocator<_Fp>()) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __value_func(const __value_func& __f)
+    {
+        if (__f.__f_ == nullptr)
+            __f_ = nullptr;
+        else if ((void*)__f.__f_ == &__f.__buf_)
+        {
+            __f_ = __as_base(&__buf_);
+            __f.__f_->__clone(__f_);
+        }
+        else
+            __f_ = __f.__f_->__clone();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __value_func(__value_func&& __f) _NOEXCEPT
+    {
+        if (__f.__f_ == nullptr)
+            __f_ = nullptr;
+        else if ((void*)__f.__f_ == &__f.__buf_)
+        {
+            __f_ = __as_base(&__buf_);
+            __f.__f_->__clone(__f_);
+        }
+        else
+        {
+            __f_ = __f.__f_;
+            __f.__f_ = nullptr;
+        }
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~__value_func()
+    {
+        if ((void*)__f_ == &__buf_)
+            __f_->destroy();
+        else if (__f_)
+            __f_->destroy_deallocate();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __value_func& operator=(__value_func&& __f)
+    {
+        *this = nullptr;
+        if (__f.__f_ == nullptr)
+            __f_ = nullptr;
+        else if ((void*)__f.__f_ == &__f.__buf_)
+        {
+            __f_ = __as_base(&__buf_);
+            __f.__f_->__clone(__f_);
+        }
+        else
+        {
+            __f_ = __f.__f_;
+            __f.__f_ = nullptr;
+        }
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __value_func& operator=(nullptr_t)
+    {
+        __func* __f = __f_;
+        __f_ = nullptr;
+        if ((void*)__f == &__buf_)
+            __f->destroy();
+        else if (__f)
+            __f->destroy_deallocate();
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Rp operator()(_ArgTypes&&... __args) const
+    {
+        if (__f_ == nullptr)
+            __throw_bad_function_call();
+        return (*__f_)(_VSTD::forward<_ArgTypes>(__args)...);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(__value_func& __f) _NOEXCEPT
+    {
+        if (&__f == this)
+            return;
+        if ((void*)__f_ == &__buf_ && (void*)__f.__f_ == &__f.__buf_)
+        {
+            _LIBCPP_SUPPRESS_DEPRECATED_PUSH
+            typename aligned_storage<sizeof(__buf_)>::type __tempbuf;
+            _LIBCPP_SUPPRESS_DEPRECATED_POP
+            __func* __t = __as_base(&__tempbuf);
+            __f_->__clone(__t);
+            __f_->destroy();
+            __f_ = nullptr;
+            __f.__f_->__clone(__as_base(&__buf_));
+            __f.__f_->destroy();
+            __f.__f_ = nullptr;
+            __f_ = __as_base(&__buf_);
+            __t->__clone(__as_base(&__f.__buf_));
+            __t->destroy();
+            __f.__f_ = __as_base(&__f.__buf_);
+        }
+        else if ((void*)__f_ == &__buf_)
+        {
+            __f_->__clone(__as_base(&__f.__buf_));
+            __f_->destroy();
+            __f_ = __f.__f_;
+            __f.__f_ = __as_base(&__f.__buf_);
+        }
+        else if ((void*)__f.__f_ == &__f.__buf_)
+        {
+            __f.__f_->__clone(__as_base(&__buf_));
+            __f.__f_->destroy();
+            __f.__f_ = __f_;
+            __f_ = __as_base(&__buf_);
+        }
+        else
+            _VSTD::swap(__f_, __f.__f_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit operator bool() const _NOEXCEPT { return __f_ != nullptr; }
+
+#ifndef _LIBCPP_NO_RTTI
+    _LIBCPP_INLINE_VISIBILITY
+    const std::type_info& target_type() const _NOEXCEPT
+    {
+        if (__f_ == nullptr)
+            return typeid(void);
+        return __f_->target_type();
+    }
+
+    template <typename _Tp>
+    _LIBCPP_INLINE_VISIBILITY const _Tp* target() const _NOEXCEPT
+    {
+        if (__f_ == nullptr)
+            return nullptr;
+        return (const _Tp*)__f_->target(typeid(_Tp));
+    }
+#endif // _LIBCPP_NO_RTTI
+};
+
+// Storage for a functor object, to be used with __policy to manage copy and
+// destruction.
+union __policy_storage
+{
+    mutable char __small[sizeof(void*) * 2];
+    void* __large;
+};
+
+// True if _Fun can safely be held in __policy_storage.__small.
+template <typename _Fun>
+struct __use_small_storage
+    : public integral_constant<
+          bool, sizeof(_Fun) <= sizeof(__policy_storage) &&
+                    _LIBCPP_ALIGNOF(_Fun) <= _LIBCPP_ALIGNOF(__policy_storage) &&
+                    is_trivially_copy_constructible<_Fun>::value &&
+                    is_trivially_destructible<_Fun>::value> {};
+
+// Policy contains information about how to copy, destroy, and move the
+// underlying functor. You can think of it as a vtable of sorts.
+struct __policy
+{
+    // Used to copy or destroy __large values. null for trivial objects.
+    void* (*const __clone)(const void*);
+    void (*const __destroy)(void*);
+
+    // True if this is the null policy (no value).
+    const bool __is_null;
+
+    // The target type. May be null if RTTI is disabled.
+    const std::type_info* const __type_info;
+
+    // Returns a pointer to a static policy object suitable for the functor
+    // type.
+    template <typename _Fun>
+    _LIBCPP_INLINE_VISIBILITY static const __policy* __create()
+    {
+        return __choose_policy<_Fun>(__use_small_storage<_Fun>());
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    static const __policy* __create_empty()
+    {
+        static const _LIBCPP_CONSTEXPR __policy __policy_ = {nullptr, nullptr,
+                                                             true,
+#ifndef _LIBCPP_NO_RTTI
+                                                             &typeid(void)
+#else
+                                                             nullptr
+#endif
+        };
+        return &__policy_;
+    }
+
+  private:
+    template <typename _Fun> static void* __large_clone(const void* __s)
+    {
+        const _Fun* __f = static_cast<const _Fun*>(__s);
+        return __f->__clone();
+    }
+
+    template <typename _Fun>
+    static void __large_destroy(void* __s) {
+      _Fun::__destroy_and_delete(static_cast<_Fun*>(__s));
+    }
+
+    template <typename _Fun>
+    _LIBCPP_INLINE_VISIBILITY static const __policy*
+    __choose_policy(/* is_small = */ false_type) {
+      static const _LIBCPP_CONSTEXPR __policy __policy_ = {
+          &__large_clone<_Fun>, &__large_destroy<_Fun>, false,
+#ifndef _LIBCPP_NO_RTTI
+          &typeid(typename _Fun::_Target)
+#else
+          nullptr
+#endif
+      };
+        return &__policy_;
+    }
+
+    template <typename _Fun>
+    _LIBCPP_INLINE_VISIBILITY static const __policy*
+        __choose_policy(/* is_small = */ true_type)
+    {
+        static const _LIBCPP_CONSTEXPR __policy __policy_ = {
+            nullptr, nullptr, false,
+#ifndef _LIBCPP_NO_RTTI
+            &typeid(typename _Fun::_Target)
+#else
+            nullptr
+#endif
+        };
+        return &__policy_;
+    }
+};
+
+// Used to choose between perfect forwarding or pass-by-value. Pass-by-value is
+// faster for types that can be passed in registers.
+template <typename _Tp>
+using __fast_forward = __conditional_t<is_scalar<_Tp>::value, _Tp, _Tp&&>;
+
+// __policy_invoker calls an instance of __alloc_func held in __policy_storage.
+
+template <class _Fp> struct __policy_invoker;
+
+template <class _Rp, class... _ArgTypes>
+struct __policy_invoker<_Rp(_ArgTypes...)>
+{
+    typedef _Rp (*__Call)(const __policy_storage*,
+                          __fast_forward<_ArgTypes>...);
+
+    __Call __call_;
+
+    // Creates an invoker that throws bad_function_call.
+    _LIBCPP_INLINE_VISIBILITY
+    __policy_invoker() : __call_(&__call_empty) {}
+
+    // Creates an invoker that calls the given instance of __func.
+    template <typename _Fun>
+    _LIBCPP_INLINE_VISIBILITY static __policy_invoker __create()
+    {
+        return __policy_invoker(&__call_impl<_Fun>);
+    }
+
+  private:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __policy_invoker(__Call __c) : __call_(__c) {}
+
+    static _Rp __call_empty(const __policy_storage*,
+                            __fast_forward<_ArgTypes>...)
+    {
+        __throw_bad_function_call();
+    }
+
+    template <typename _Fun>
+    static _Rp __call_impl(const __policy_storage* __buf,
+                           __fast_forward<_ArgTypes>... __args)
+    {
+        _Fun* __f = reinterpret_cast<_Fun*>(__use_small_storage<_Fun>::value
+                                                ? &__buf->__small
+                                                : __buf->__large);
+        return (*__f)(_VSTD::forward<_ArgTypes>(__args)...);
+    }
+};
+
+// __policy_func uses a __policy and __policy_invoker to create a type-erased,
+// copyable functor.
+
+template <class _Fp> class __policy_func;
+
+template <class _Rp, class... _ArgTypes> class __policy_func<_Rp(_ArgTypes...)>
+{
+    // Inline storage for small objects.
+    __policy_storage __buf_;
+
+    // Calls the value stored in __buf_. This could technically be part of
+    // policy, but storing it here eliminates a level of indirection inside
+    // operator().
+    typedef __function::__policy_invoker<_Rp(_ArgTypes...)> __invoker;
+    __invoker __invoker_;
+
+    // The policy that describes how to move / copy / destroy __buf_. Never
+    // null, even if the function is empty.
+    const __policy* __policy_;
+
+  public:
+    _LIBCPP_INLINE_VISIBILITY
+    __policy_func() : __policy_(__policy::__create_empty()) {}
+
+    template <class _Fp, class _Alloc>
+    _LIBCPP_INLINE_VISIBILITY __policy_func(_Fp&& __f, const _Alloc& __a)
+        : __policy_(__policy::__create_empty())
+    {
+        typedef __alloc_func<_Fp, _Alloc, _Rp(_ArgTypes...)> _Fun;
+        typedef allocator_traits<_Alloc> __alloc_traits;
+        typedef __rebind_alloc<__alloc_traits, _Fun> _FunAlloc;
+
+        if (__function::__not_null(__f))
+        {
+            __invoker_ = __invoker::template __create<_Fun>();
+            __policy_ = __policy::__create<_Fun>();
+
+            _FunAlloc __af(__a);
+            if (__use_small_storage<_Fun>())
+            {
+                ::new ((void*)&__buf_.__small)
+                    _Fun(_VSTD::move(__f), _Alloc(__af));
+            }
+            else
+            {
+                typedef __allocator_destructor<_FunAlloc> _Dp;
+                unique_ptr<_Fun, _Dp> __hold(__af.allocate(1), _Dp(__af, 1));
+                ::new ((void*)__hold.get())
+                    _Fun(_VSTD::move(__f), _Alloc(__af));
+                __buf_.__large = __hold.release();
+            }
+        }
+    }
+
+    template <class _Fp, class = typename enable_if<!is_same<typename decay<_Fp>::type, __policy_func>::value>::type>
+    _LIBCPP_INLINE_VISIBILITY explicit __policy_func(_Fp&& __f)
+        : __policy_(__policy::__create_empty()) {
+      typedef __default_alloc_func<_Fp, _Rp(_ArgTypes...)> _Fun;
+
+      if (__function::__not_null(__f)) {
+        __invoker_ = __invoker::template __create<_Fun>();
+        __policy_ = __policy::__create<_Fun>();
+        if (__use_small_storage<_Fun>()) {
+          ::new ((void*)&__buf_.__small) _Fun(_VSTD::move(__f));
+        } else {
+          __builtin_new_allocator::__holder_t __hold =
+              __builtin_new_allocator::__allocate_type<_Fun>(1);
+          __buf_.__large = ::new ((void*)__hold.get()) _Fun(_VSTD::move(__f));
+          (void)__hold.release();
+        }
+      }
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __policy_func(const __policy_func& __f)
+        : __buf_(__f.__buf_), __invoker_(__f.__invoker_),
+          __policy_(__f.__policy_)
+    {
+        if (__policy_->__clone)
+            __buf_.__large = __policy_->__clone(__f.__buf_.__large);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __policy_func(__policy_func&& __f)
+        : __buf_(__f.__buf_), __invoker_(__f.__invoker_),
+          __policy_(__f.__policy_)
+    {
+        if (__policy_->__destroy)
+        {
+            __f.__policy_ = __policy::__create_empty();
+            __f.__invoker_ = __invoker();
+        }
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~__policy_func()
+    {
+        if (__policy_->__destroy)
+            __policy_->__destroy(__buf_.__large);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __policy_func& operator=(__policy_func&& __f)
+    {
+        *this = nullptr;
+        __buf_ = __f.__buf_;
+        __invoker_ = __f.__invoker_;
+        __policy_ = __f.__policy_;
+        __f.__policy_ = __policy::__create_empty();
+        __f.__invoker_ = __invoker();
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __policy_func& operator=(nullptr_t)
+    {
+        const __policy* __p = __policy_;
+        __policy_ = __policy::__create_empty();
+        __invoker_ = __invoker();
+        if (__p->__destroy)
+            __p->__destroy(__buf_.__large);
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Rp operator()(_ArgTypes&&... __args) const
+    {
+        return __invoker_.__call_(_VSTD::addressof(__buf_),
+                                  _VSTD::forward<_ArgTypes>(__args)...);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(__policy_func& __f)
+    {
+        _VSTD::swap(__invoker_, __f.__invoker_);
+        _VSTD::swap(__policy_, __f.__policy_);
+        _VSTD::swap(__buf_, __f.__buf_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit operator bool() const _NOEXCEPT
+    {
+        return !__policy_->__is_null;
+    }
+
+#ifndef _LIBCPP_NO_RTTI
+    _LIBCPP_INLINE_VISIBILITY
+    const std::type_info& target_type() const _NOEXCEPT
+    {
+        return *__policy_->__type_info;
+    }
+
+    template <typename _Tp>
+    _LIBCPP_INLINE_VISIBILITY const _Tp* target() const _NOEXCEPT
+    {
+        if (__policy_->__is_null || typeid(_Tp) != *__policy_->__type_info)
+            return nullptr;
+        if (__policy_->__clone) // Out of line storage.
+            return reinterpret_cast<const _Tp*>(__buf_.__large);
+        else
+            return reinterpret_cast<const _Tp*>(&__buf_.__small);
+    }
+#endif // _LIBCPP_NO_RTTI
+};
+
+#if defined(_LIBCPP_HAS_BLOCKS_RUNTIME)
+
+extern "C" void *_Block_copy(const void *);
+extern "C" void _Block_release(const void *);
+
+template<class _Rp1, class ..._ArgTypes1, class _Alloc, class _Rp, class ..._ArgTypes>
+class __func<_Rp1(^)(_ArgTypes1...), _Alloc, _Rp(_ArgTypes...)>
+    : public  __base<_Rp(_ArgTypes...)>
+{
+    typedef _Rp1(^__block_type)(_ArgTypes1...);
+    __block_type __f_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __func(__block_type const& __f)
+#ifdef _LIBCPP_HAS_OBJC_ARC
+        : __f_(__f)
+#else
+        : __f_(reinterpret_cast<__block_type>(__f ? _Block_copy(__f) : nullptr))
+#endif
+    { }
+
+    // [TODO] add && to save on a retain
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __func(__block_type __f, const _Alloc& /* unused */)
+#ifdef _LIBCPP_HAS_OBJC_ARC
+        : __f_(__f)
+#else
+        : __f_(reinterpret_cast<__block_type>(__f ? _Block_copy(__f) : nullptr))
+#endif
+    { }
+
+    virtual __base<_Rp(_ArgTypes...)>* __clone() const {
+        _LIBCPP_ASSERT(false,
+            "Block pointers are just pointers, so they should always fit into "
+            "std::function's small buffer optimization. This function should "
+            "never be invoked.");
+        return nullptr;
+    }
+
+    virtual void __clone(__base<_Rp(_ArgTypes...)>* __p) const {
+        ::new ((void*)__p) __func(__f_);
+    }
+
+    virtual void destroy() _NOEXCEPT {
+#ifndef _LIBCPP_HAS_OBJC_ARC
+        if (__f_)
+            _Block_release(__f_);
+#endif
+        __f_ = 0;
+    }
+
+    virtual void destroy_deallocate() _NOEXCEPT {
+        _LIBCPP_ASSERT(false,
+            "Block pointers are just pointers, so they should always fit into "
+            "std::function's small buffer optimization. This function should "
+            "never be invoked.");
+    }
+
+    virtual _Rp operator()(_ArgTypes&& ... __arg) {
+        return _VSTD::__invoke(__f_, _VSTD::forward<_ArgTypes>(__arg)...);
+    }
+
+#ifndef _LIBCPP_NO_RTTI
+    virtual const void* target(type_info const& __ti) const _NOEXCEPT {
+        if (__ti == typeid(__func::__block_type))
+            return &__f_;
+        return (const void*)nullptr;
+    }
+
+    virtual const std::type_info& target_type() const _NOEXCEPT {
+        return typeid(__func::__block_type);
+    }
+#endif // _LIBCPP_NO_RTTI
+};
+
+#endif // _LIBCPP_HAS_EXTENSION_BLOCKS
+
+} // namespace __function
+
+template<class _Rp, class ..._ArgTypes>
+class _LIBCPP_TEMPLATE_VIS function<_Rp(_ArgTypes...)>
+    : public __function::__maybe_derive_from_unary_function<_Rp(_ArgTypes...)>,
+      public __function::__maybe_derive_from_binary_function<_Rp(_ArgTypes...)>
+{
+#ifndef _LIBCPP_ABI_OPTIMIZED_FUNCTION
+    typedef __function::__value_func<_Rp(_ArgTypes...)> __func;
+#else
+    typedef __function::__policy_func<_Rp(_ArgTypes...)> __func;
+#endif
+
+    __func __f_;
+
+    template <class _Fp, bool = _And<
+        _IsNotSame<__remove_cvref_t<_Fp>, function>,
+        __invokable<_Fp, _ArgTypes...>
+    >::value>
+    struct __callable;
+    template <class _Fp>
+        struct __callable<_Fp, true>
+        {
+            static const bool value = is_void<_Rp>::value ||
+                __is_core_convertible<typename __invoke_of<_Fp, _ArgTypes...>::type,
+                                      _Rp>::value;
+        };
+    template <class _Fp>
+        struct __callable<_Fp, false>
+        {
+            static const bool value = false;
+        };
+
+  template <class _Fp>
+  using _EnableIfLValueCallable = typename enable_if<__callable<_Fp&>::value>::type;
+public:
+    typedef _Rp result_type;
+
+    // construct/copy/destroy:
+    _LIBCPP_INLINE_VISIBILITY
+    function() _NOEXCEPT { }
+    _LIBCPP_INLINE_VISIBILITY
+    function(nullptr_t) _NOEXCEPT {}
+    function(const function&);
+    function(function&&) _NOEXCEPT;
+    template<class _Fp, class = _EnableIfLValueCallable<_Fp>>
+    function(_Fp);
+
+#if _LIBCPP_STD_VER <= 14
+    template<class _Alloc>
+      _LIBCPP_INLINE_VISIBILITY
+      function(allocator_arg_t, const _Alloc&) _NOEXCEPT {}
+    template<class _Alloc>
+      _LIBCPP_INLINE_VISIBILITY
+      function(allocator_arg_t, const _Alloc&, nullptr_t) _NOEXCEPT {}
+    template<class _Alloc>
+      function(allocator_arg_t, const _Alloc&, const function&);
+    template<class _Alloc>
+      function(allocator_arg_t, const _Alloc&, function&&);
+    template<class _Fp, class _Alloc, class = _EnableIfLValueCallable<_Fp>>
+      function(allocator_arg_t, const _Alloc& __a, _Fp __f);
+#endif
+
+    function& operator=(const function&);
+    function& operator=(function&&) _NOEXCEPT;
+    function& operator=(nullptr_t) _NOEXCEPT;
+    template<class _Fp, class = _EnableIfLValueCallable<typename decay<_Fp>::type>>
+    function& operator=(_Fp&&);
+
+    ~function();
+
+    // function modifiers:
+    void swap(function&) _NOEXCEPT;
+
+#if _LIBCPP_STD_VER <= 14
+    template<class _Fp, class _Alloc>
+      _LIBCPP_INLINE_VISIBILITY
+      void assign(_Fp&& __f, const _Alloc& __a)
+        {function(allocator_arg, __a, _VSTD::forward<_Fp>(__f)).swap(*this);}
+#endif
+
+    // function capacity:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit operator bool() const _NOEXCEPT {
+      return static_cast<bool>(__f_);
+    }
+
+    // deleted overloads close possible hole in the type system
+    template<class _R2, class... _ArgTypes2>
+      bool operator==(const function<_R2(_ArgTypes2...)>&) const = delete;
+    template<class _R2, class... _ArgTypes2>
+      bool operator!=(const function<_R2(_ArgTypes2...)>&) const = delete;
+public:
+    // function invocation:
+    _Rp operator()(_ArgTypes...) const;
+
+#ifndef _LIBCPP_NO_RTTI
+    // function target access:
+    const std::type_info& target_type() const _NOEXCEPT;
+    template <typename _Tp> _Tp* target() _NOEXCEPT;
+    template <typename _Tp> const _Tp* target() const _NOEXCEPT;
+#endif // _LIBCPP_NO_RTTI
+};
+
+#if _LIBCPP_STD_VER >= 17
+template<class _Rp, class ..._Ap>
+function(_Rp(*)(_Ap...)) -> function<_Rp(_Ap...)>;
+
+template<class _Fp, class _Stripped = typename __strip_signature<decltype(&_Fp::operator())>::type>
+function(_Fp) -> function<_Stripped>;
+#endif // _LIBCPP_STD_VER >= 17
+
+template<class _Rp, class ..._ArgTypes>
+function<_Rp(_ArgTypes...)>::function(const function& __f) : __f_(__f.__f_) {}
+
+#if _LIBCPP_STD_VER <= 14
+template<class _Rp, class ..._ArgTypes>
+template <class _Alloc>
+function<_Rp(_ArgTypes...)>::function(allocator_arg_t, const _Alloc&,
+                                     const function& __f) : __f_(__f.__f_) {}
+#endif
+
+template <class _Rp, class... _ArgTypes>
+function<_Rp(_ArgTypes...)>::function(function&& __f) _NOEXCEPT
+    : __f_(_VSTD::move(__f.__f_)) {}
+
+#if _LIBCPP_STD_VER <= 14
+template<class _Rp, class ..._ArgTypes>
+template <class _Alloc>
+function<_Rp(_ArgTypes...)>::function(allocator_arg_t, const _Alloc&,
+                                      function&& __f)
+    : __f_(_VSTD::move(__f.__f_)) {}
+#endif
+
+template <class _Rp, class... _ArgTypes>
+template <class _Fp, class>
+function<_Rp(_ArgTypes...)>::function(_Fp __f) : __f_(_VSTD::move(__f)) {}
+
+#if _LIBCPP_STD_VER <= 14
+template <class _Rp, class... _ArgTypes>
+template <class _Fp, class _Alloc, class>
+function<_Rp(_ArgTypes...)>::function(allocator_arg_t, const _Alloc& __a,
+                                      _Fp __f)
+    : __f_(_VSTD::move(__f), __a) {}
+#endif
+
+template<class _Rp, class ..._ArgTypes>
+function<_Rp(_ArgTypes...)>&
+function<_Rp(_ArgTypes...)>::operator=(const function& __f)
+{
+    function(__f).swap(*this);
+    return *this;
+}
+
+template<class _Rp, class ..._ArgTypes>
+function<_Rp(_ArgTypes...)>&
+function<_Rp(_ArgTypes...)>::operator=(function&& __f) _NOEXCEPT
+{
+    __f_ = _VSTD::move(__f.__f_);
+    return *this;
+}
+
+template<class _Rp, class ..._ArgTypes>
+function<_Rp(_ArgTypes...)>&
+function<_Rp(_ArgTypes...)>::operator=(nullptr_t) _NOEXCEPT
+{
+    __f_ = nullptr;
+    return *this;
+}
+
+template<class _Rp, class ..._ArgTypes>
+template <class _Fp, class>
+function<_Rp(_ArgTypes...)>&
+function<_Rp(_ArgTypes...)>::operator=(_Fp&& __f)
+{
+    function(_VSTD::forward<_Fp>(__f)).swap(*this);
+    return *this;
+}
+
+template<class _Rp, class ..._ArgTypes>
+function<_Rp(_ArgTypes...)>::~function() {}
+
+template<class _Rp, class ..._ArgTypes>
+void
+function<_Rp(_ArgTypes...)>::swap(function& __f) _NOEXCEPT
+{
+    __f_.swap(__f.__f_);
+}
+
+template<class _Rp, class ..._ArgTypes>
+_Rp
+function<_Rp(_ArgTypes...)>::operator()(_ArgTypes... __arg) const
+{
+    return __f_(_VSTD::forward<_ArgTypes>(__arg)...);
+}
+
+#ifndef _LIBCPP_NO_RTTI
+
+template<class _Rp, class ..._ArgTypes>
+const std::type_info&
+function<_Rp(_ArgTypes...)>::target_type() const _NOEXCEPT
+{
+    return __f_.target_type();
+}
+
+template<class _Rp, class ..._ArgTypes>
+template <typename _Tp>
+_Tp*
+function<_Rp(_ArgTypes...)>::target() _NOEXCEPT
+{
+    return (_Tp*)(__f_.template target<_Tp>());
+}
+
+template<class _Rp, class ..._ArgTypes>
+template <typename _Tp>
+const _Tp*
+function<_Rp(_ArgTypes...)>::target() const _NOEXCEPT
+{
+    return __f_.template target<_Tp>();
+}
+
+#endif // _LIBCPP_NO_RTTI
+
+template <class _Rp, class... _ArgTypes>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const function<_Rp(_ArgTypes...)>& __f, nullptr_t) _NOEXCEPT {return !__f;}
+
+template <class _Rp, class... _ArgTypes>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(nullptr_t, const function<_Rp(_ArgTypes...)>& __f) _NOEXCEPT {return !__f;}
+
+template <class _Rp, class... _ArgTypes>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const function<_Rp(_ArgTypes...)>& __f, nullptr_t) _NOEXCEPT {return (bool)__f;}
+
+template <class _Rp, class... _ArgTypes>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(nullptr_t, const function<_Rp(_ArgTypes...)>& __f) _NOEXCEPT {return (bool)__f;}
+
+template <class _Rp, class... _ArgTypes>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(function<_Rp(_ArgTypes...)>& __x, function<_Rp(_ArgTypes...)>& __y) _NOEXCEPT
+{return __x.swap(__y);}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___FUNCTIONAL_FUNCTION_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/hash.h b/app/src/main/cpp/libcxx/include/__functional/hash.h
new file mode 100644
index 0000000..dfd8ea2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/hash.h
@@ -0,0 +1,693 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_HASH_H
+#define _LIBCPP___FUNCTIONAL_HASH_H
+
+#include <__config>
+#include <__functional/invoke.h>
+#include <__functional/unary_function.h>
+#include <__fwd/hash.h>
+#include <__tuple_dir/sfinae_helpers.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__type_traits/is_default_constructible.h>
+#include <__type_traits/is_enum.h>
+#include <__type_traits/is_move_constructible.h>
+#include <__type_traits/underlying_type.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <__utility/swap.h>
+#include <cstddef>
+#include <cstdint>
+#include <cstring>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Size>
+inline _LIBCPP_INLINE_VISIBILITY
+_Size
+__loadword(const void* __p)
+{
+    _Size __r;
+    _VSTD::memcpy(&__r, __p, sizeof(__r));
+    return __r;
+}
+
+// We use murmur2 when size_t is 32 bits, and cityhash64 when size_t
+// is 64 bits.  This is because cityhash64 uses 64bit x 64bit
+// multiplication, which can be very slow on 32-bit systems.
+template <class _Size, size_t = sizeof(_Size)*__CHAR_BIT__>
+struct __murmur2_or_cityhash;
+
+template <class _Size>
+struct __murmur2_or_cityhash<_Size, 32>
+{
+    inline _Size operator()(const void* __key, _Size __len)
+         _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK;
+};
+
+// murmur2
+template <class _Size>
+_Size
+__murmur2_or_cityhash<_Size, 32>::operator()(const void* __key, _Size __len)
+{
+    const _Size __m = 0x5bd1e995;
+    const _Size __r = 24;
+    _Size __h = __len;
+    const unsigned char* __data = static_cast<const unsigned char*>(__key);
+    for (; __len >= 4; __data += 4, __len -= 4)
+    {
+        _Size __k = std::__loadword<_Size>(__data);
+        __k *= __m;
+        __k ^= __k >> __r;
+        __k *= __m;
+        __h *= __m;
+        __h ^= __k;
+    }
+    switch (__len)
+    {
+    case 3:
+        __h ^= static_cast<_Size>(__data[2] << 16);
+        _LIBCPP_FALLTHROUGH();
+    case 2:
+        __h ^= static_cast<_Size>(__data[1] << 8);
+        _LIBCPP_FALLTHROUGH();
+    case 1:
+        __h ^= __data[0];
+        __h *= __m;
+    }
+    __h ^= __h >> 13;
+    __h *= __m;
+    __h ^= __h >> 15;
+    return __h;
+}
+
+template <class _Size>
+struct __murmur2_or_cityhash<_Size, 64>
+{
+    inline _Size operator()(const void* __key, _Size __len)  _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK;
+
+ private:
+  // Some primes between 2^63 and 2^64.
+  static const _Size __k0 = 0xc3a5c85c97cb3127ULL;
+  static const _Size __k1 = 0xb492b66fbe98f273ULL;
+  static const _Size __k2 = 0x9ae16a3b2f90404fULL;
+  static const _Size __k3 = 0xc949d7c7509e6557ULL;
+
+  static _Size __rotate(_Size __val, int __shift) {
+    return __shift == 0 ? __val : ((__val >> __shift) | (__val << (64 - __shift)));
+  }
+
+  static _Size __rotate_by_at_least_1(_Size __val, int __shift) {
+    return (__val >> __shift) | (__val << (64 - __shift));
+  }
+
+  static _Size __shift_mix(_Size __val) {
+    return __val ^ (__val >> 47);
+  }
+
+  static _Size __hash_len_16(_Size __u, _Size __v)
+     _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+  {
+    const _Size __mul = 0x9ddfea08eb382d69ULL;
+    _Size __a = (__u ^ __v) * __mul;
+    __a ^= (__a >> 47);
+    _Size __b = (__v ^ __a) * __mul;
+    __b ^= (__b >> 47);
+    __b *= __mul;
+    return __b;
+  }
+
+  static _Size __hash_len_0_to_16(const char* __s, _Size __len)
+     _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+  {
+    if (__len > 8) {
+      const _Size __a = std::__loadword<_Size>(__s);
+      const _Size __b = std::__loadword<_Size>(__s + __len - 8);
+      return __hash_len_16(__a, __rotate_by_at_least_1(__b + __len, __len)) ^ __b;
+    }
+    if (__len >= 4) {
+      const uint32_t __a = std::__loadword<uint32_t>(__s);
+      const uint32_t __b = std::__loadword<uint32_t>(__s + __len - 4);
+      return __hash_len_16(__len + (static_cast<_Size>(__a) << 3), __b);
+    }
+    if (__len > 0) {
+      const unsigned char __a = static_cast<unsigned char>(__s[0]);
+      const unsigned char __b = static_cast<unsigned char>(__s[__len >> 1]);
+      const unsigned char __c = static_cast<unsigned char>(__s[__len - 1]);
+      const uint32_t __y = static_cast<uint32_t>(__a) +
+                           (static_cast<uint32_t>(__b) << 8);
+      const uint32_t __z = __len + (static_cast<uint32_t>(__c) << 2);
+      return __shift_mix(__y * __k2 ^ __z * __k3) * __k2;
+    }
+    return __k2;
+  }
+
+  static _Size __hash_len_17_to_32(const char *__s, _Size __len)
+     _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+  {
+    const _Size __a = std::__loadword<_Size>(__s) * __k1;
+    const _Size __b = std::__loadword<_Size>(__s + 8);
+    const _Size __c = std::__loadword<_Size>(__s + __len - 8) * __k2;
+    const _Size __d = std::__loadword<_Size>(__s + __len - 16) * __k0;
+    return __hash_len_16(__rotate(__a - __b, 43) + __rotate(__c, 30) + __d,
+                         __a + __rotate(__b ^ __k3, 20) - __c + __len);
+  }
+
+  // Return a 16-byte hash for 48 bytes.  Quick and dirty.
+  // Callers do best to use "random-looking" values for a and b.
+  static pair<_Size, _Size> __weak_hash_len_32_with_seeds(
+      _Size __w, _Size __x, _Size __y, _Size __z, _Size __a, _Size __b)
+        _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+  {
+    __a += __w;
+    __b = __rotate(__b + __a + __z, 21);
+    const _Size __c = __a;
+    __a += __x;
+    __a += __y;
+    __b += __rotate(__a, 44);
+    return pair<_Size, _Size>(__a + __z, __b + __c);
+  }
+
+  // Return a 16-byte hash for s[0] ... s[31], a, and b.  Quick and dirty.
+  static pair<_Size, _Size> __weak_hash_len_32_with_seeds(
+      const char* __s, _Size __a, _Size __b)
+    _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+  {
+    return __weak_hash_len_32_with_seeds(std::__loadword<_Size>(__s),
+                                         std::__loadword<_Size>(__s + 8),
+                                         std::__loadword<_Size>(__s + 16),
+                                         std::__loadword<_Size>(__s + 24),
+                                         __a,
+                                         __b);
+  }
+
+  // Return an 8-byte hash for 33 to 64 bytes.
+  static _Size __hash_len_33_to_64(const char *__s, size_t __len)
+    _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+  {
+    _Size __z = std::__loadword<_Size>(__s + 24);
+    _Size __a = std::__loadword<_Size>(__s) +
+                (__len + std::__loadword<_Size>(__s + __len - 16)) * __k0;
+    _Size __b = __rotate(__a + __z, 52);
+    _Size __c = __rotate(__a, 37);
+    __a += std::__loadword<_Size>(__s + 8);
+    __c += __rotate(__a, 7);
+    __a += std::__loadword<_Size>(__s + 16);
+    _Size __vf = __a + __z;
+    _Size __vs = __b + __rotate(__a, 31) + __c;
+    __a = std::__loadword<_Size>(__s + 16) + std::__loadword<_Size>(__s + __len - 32);
+    __z += std::__loadword<_Size>(__s + __len - 8);
+    __b = __rotate(__a + __z, 52);
+    __c = __rotate(__a, 37);
+    __a += std::__loadword<_Size>(__s + __len - 24);
+    __c += __rotate(__a, 7);
+    __a += std::__loadword<_Size>(__s + __len - 16);
+    _Size __wf = __a + __z;
+    _Size __ws = __b + __rotate(__a, 31) + __c;
+    _Size __r = __shift_mix((__vf + __ws) * __k2 + (__wf + __vs) * __k0);
+    return __shift_mix(__r * __k0 + __vs) * __k2;
+  }
+};
+
+// cityhash64
+template <class _Size>
+_Size
+__murmur2_or_cityhash<_Size, 64>::operator()(const void* __key, _Size __len)
+{
+  const char* __s = static_cast<const char*>(__key);
+  if (__len <= 32) {
+    if (__len <= 16) {
+      return __hash_len_0_to_16(__s, __len);
+    } else {
+      return __hash_len_17_to_32(__s, __len);
+    }
+  } else if (__len <= 64) {
+    return __hash_len_33_to_64(__s, __len);
+  }
+
+  // For strings over 64 bytes we hash the end first, and then as we
+  // loop we keep 56 bytes of state: v, w, x, y, and z.
+  _Size __x = std::__loadword<_Size>(__s + __len - 40);
+  _Size __y = std::__loadword<_Size>(__s + __len - 16) +
+              std::__loadword<_Size>(__s + __len - 56);
+  _Size __z = __hash_len_16(std::__loadword<_Size>(__s + __len - 48) + __len,
+                          std::__loadword<_Size>(__s + __len - 24));
+  pair<_Size, _Size> __v = __weak_hash_len_32_with_seeds(__s + __len - 64, __len, __z);
+  pair<_Size, _Size> __w = __weak_hash_len_32_with_seeds(__s + __len - 32, __y + __k1, __x);
+  __x = __x * __k1 + std::__loadword<_Size>(__s);
+
+  // Decrease len to the nearest multiple of 64, and operate on 64-byte chunks.
+  __len = (__len - 1) & ~static_cast<_Size>(63);
+  do {
+    __x = __rotate(__x + __y + __v.first + std::__loadword<_Size>(__s + 8), 37) * __k1;
+    __y = __rotate(__y + __v.second + std::__loadword<_Size>(__s + 48), 42) * __k1;
+    __x ^= __w.second;
+    __y += __v.first + std::__loadword<_Size>(__s + 40);
+    __z = __rotate(__z + __w.first, 33) * __k1;
+    __v = __weak_hash_len_32_with_seeds(__s, __v.second * __k1, __x + __w.first);
+    __w = __weak_hash_len_32_with_seeds(__s + 32, __z + __w.second,
+                                        __y + std::__loadword<_Size>(__s + 16));
+    _VSTD::swap(__z, __x);
+    __s += 64;
+    __len -= 64;
+  } while (__len != 0);
+  return __hash_len_16(
+      __hash_len_16(__v.first, __w.first) + __shift_mix(__y) * __k1 + __z,
+      __hash_len_16(__v.second, __w.second) + __x);
+}
+
+template <class _Tp, size_t = sizeof(_Tp) / sizeof(size_t)>
+struct __scalar_hash;
+
+template <class _Tp>
+struct __scalar_hash<_Tp, 0>
+    : public __unary_function<_Tp, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(_Tp __v) const _NOEXCEPT
+    {
+        union
+        {
+            _Tp    __t;
+            size_t __a;
+        } __u;
+        __u.__a = 0;
+        __u.__t = __v;
+        return __u.__a;
+    }
+};
+
+template <class _Tp>
+struct __scalar_hash<_Tp, 1>
+    : public __unary_function<_Tp, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(_Tp __v) const _NOEXCEPT
+    {
+        union
+        {
+            _Tp    __t;
+            size_t __a;
+        } __u;
+        __u.__t = __v;
+        return __u.__a;
+    }
+};
+
+template <class _Tp>
+struct __scalar_hash<_Tp, 2>
+    : public __unary_function<_Tp, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(_Tp __v) const _NOEXCEPT
+    {
+        union
+        {
+            _Tp __t;
+            struct
+            {
+                size_t __a;
+                size_t __b;
+            } __s;
+        } __u;
+        __u.__t = __v;
+        return __murmur2_or_cityhash<size_t>()(&__u, sizeof(__u));
+    }
+};
+
+template <class _Tp>
+struct __scalar_hash<_Tp, 3>
+    : public __unary_function<_Tp, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(_Tp __v) const _NOEXCEPT
+    {
+        union
+        {
+            _Tp __t;
+            struct
+            {
+                size_t __a;
+                size_t __b;
+                size_t __c;
+            } __s;
+        } __u;
+        __u.__t = __v;
+        return __murmur2_or_cityhash<size_t>()(&__u, sizeof(__u));
+    }
+};
+
+template <class _Tp>
+struct __scalar_hash<_Tp, 4>
+    : public __unary_function<_Tp, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(_Tp __v) const _NOEXCEPT
+    {
+        union
+        {
+            _Tp __t;
+            struct
+            {
+                size_t __a;
+                size_t __b;
+                size_t __c;
+                size_t __d;
+            } __s;
+        } __u;
+        __u.__t = __v;
+        return __murmur2_or_cityhash<size_t>()(&__u, sizeof(__u));
+    }
+};
+
+struct _PairT {
+  size_t first;
+  size_t second;
+};
+
+_LIBCPP_INLINE_VISIBILITY
+inline size_t __hash_combine(size_t __lhs, size_t __rhs) _NOEXCEPT {
+    typedef __scalar_hash<_PairT> _HashT;
+    const _PairT __p = {__lhs, __rhs};
+    return _HashT()(__p);
+}
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS hash<_Tp*>
+    : public __unary_function<_Tp*, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(_Tp* __v) const _NOEXCEPT
+    {
+        union
+        {
+            _Tp* __t;
+            size_t __a;
+        } __u;
+        __u.__t = __v;
+        return __murmur2_or_cityhash<size_t>()(&__u, sizeof(__u));
+    }
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<bool>
+    : public __unary_function<bool, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(bool __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<char>
+    : public __unary_function<char, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(char __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<signed char>
+    : public __unary_function<signed char, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(signed char __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<unsigned char>
+    : public __unary_function<unsigned char, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(unsigned char __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<char8_t>
+    : public __unary_function<char8_t, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(char8_t __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+#endif // !_LIBCPP_HAS_NO_CHAR8_T
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<char16_t>
+    : public __unary_function<char16_t, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(char16_t __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<char32_t>
+    : public __unary_function<char32_t, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(char32_t __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<wchar_t>
+    : public __unary_function<wchar_t, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(wchar_t __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<short>
+    : public __unary_function<short, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(short __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<unsigned short>
+    : public __unary_function<unsigned short, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(unsigned short __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<int>
+    : public __unary_function<int, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(int __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<unsigned int>
+    : public __unary_function<unsigned int, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(unsigned int __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<long>
+    : public __unary_function<long, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(long __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<unsigned long>
+    : public __unary_function<unsigned long, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(unsigned long __v) const _NOEXCEPT {return static_cast<size_t>(__v);}
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<long long>
+    : public __scalar_hash<long long>
+{
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<unsigned long long>
+    : public __scalar_hash<unsigned long long>
+{
+};
+
+#ifndef _LIBCPP_HAS_NO_INT128
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<__int128_t>
+    : public __scalar_hash<__int128_t>
+{
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<__uint128_t>
+    : public __scalar_hash<__uint128_t>
+{
+};
+
+#endif
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<float>
+    : public __scalar_hash<float>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(float __v) const _NOEXCEPT
+    {
+        // -0.0 and 0.0 should return same hash
+       if (__v == 0.0f)
+           return 0;
+        return __scalar_hash<float>::operator()(__v);
+    }
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<double>
+    : public __scalar_hash<double>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(double __v) const _NOEXCEPT
+    {
+        // -0.0 and 0.0 should return same hash
+       if (__v == 0.0)
+           return 0;
+        return __scalar_hash<double>::operator()(__v);
+    }
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<long double>
+    : public __scalar_hash<long double>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(long double __v) const _NOEXCEPT
+    {
+        // -0.0 and 0.0 should return same hash
+        if (__v == 0.0L)
+            return 0;
+#if defined(__i386__) || (defined(__x86_64__) && defined(__ILP32__))
+        // Zero out padding bits
+        union
+        {
+            long double __t;
+            struct
+            {
+                size_t __a;
+                size_t __b;
+                size_t __c;
+                size_t __d;
+            } __s;
+        } __u;
+        __u.__s.__a = 0;
+        __u.__s.__b = 0;
+        __u.__s.__c = 0;
+        __u.__s.__d = 0;
+        __u.__t = __v;
+        return __u.__s.__a ^ __u.__s.__b ^ __u.__s.__c ^ __u.__s.__d;
+#elif defined(__x86_64__)
+        // Zero out padding bits
+        union
+        {
+            long double __t;
+            struct
+            {
+                size_t __a;
+                size_t __b;
+            } __s;
+        } __u;
+        __u.__s.__a = 0;
+        __u.__s.__b = 0;
+        __u.__t = __v;
+        return __u.__s.__a ^ __u.__s.__b;
+#else
+        return __scalar_hash<long double>::operator()(__v);
+#endif
+    }
+};
+
+template <class _Tp, bool = is_enum<_Tp>::value>
+struct _LIBCPP_TEMPLATE_VIS __enum_hash
+    : public __unary_function<_Tp, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(_Tp __v) const _NOEXCEPT
+    {
+        typedef typename underlying_type<_Tp>::type type;
+        return hash<type>()(static_cast<type>(__v));
+    }
+};
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS __enum_hash<_Tp, false> {
+    __enum_hash() = delete;
+    __enum_hash(__enum_hash const&) = delete;
+    __enum_hash& operator=(__enum_hash const&) = delete;
+};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS hash : public __enum_hash<_Tp>
+{
+};
+
+#if _LIBCPP_STD_VER > 14
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<nullptr_t>
+  : public __unary_function<nullptr_t, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(nullptr_t) const _NOEXCEPT {
+        return 662607004ull;
+    }
+};
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Key, class _Hash>
+using __check_hash_requirements _LIBCPP_NODEBUG = integral_constant<bool,
+    is_copy_constructible<_Hash>::value &&
+    is_move_constructible<_Hash>::value &&
+    __invokable_r<size_t, _Hash, _Key const&>::value
+>;
+
+template <class _Key, class _Hash = hash<_Key> >
+using __has_enabled_hash _LIBCPP_NODEBUG = integral_constant<bool,
+    __check_hash_requirements<_Key, _Hash>::value &&
+    is_default_constructible<_Hash>::value
+>;
+
+#if _LIBCPP_STD_VER > 14
+template <class _Type, class>
+using __enable_hash_helper_imp _LIBCPP_NODEBUG = _Type;
+
+template <class _Type, class ..._Keys>
+using __enable_hash_helper _LIBCPP_NODEBUG = __enable_hash_helper_imp<_Type,
+  typename enable_if<__all<__has_enabled_hash<_Keys>::value...>::value>::type
+>;
+#else
+template <class _Type, class ...>
+using __enable_hash_helper _LIBCPP_NODEBUG = _Type;
+#endif
+
+#endif // !_LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_HASH_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/identity.h b/app/src/main/cpp/libcxx/include/__functional/identity.h
new file mode 100644
index 0000000..2fe3acc
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/identity.h
@@ -0,0 +1,46 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_IDENTITY_H
+#define _LIBCPP___FUNCTIONAL_IDENTITY_H
+
+#include <__config>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+struct __identity {
+  template <class _Tp>
+  _LIBCPP_NODISCARD _LIBCPP_CONSTEXPR _Tp&& operator()(_Tp&& __t) const _NOEXCEPT {
+    return std::forward<_Tp>(__t);
+  }
+
+  using is_transparent = void;
+};
+
+#if _LIBCPP_STD_VER > 17
+
+struct identity {
+    template<class _Tp>
+    _LIBCPP_NODISCARD_EXT constexpr _Tp&& operator()(_Tp&& __t) const noexcept
+    {
+        return _VSTD::forward<_Tp>(__t);
+    }
+
+    using is_transparent = void;
+};
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_IDENTITY_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/invoke.h b/app/src/main/cpp/libcxx/include/__functional/invoke.h
new file mode 100644
index 0000000..48e6eac
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/invoke.h
@@ -0,0 +1,546 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_INVOKE_H
+#define _LIBCPP___FUNCTIONAL_INVOKE_H
+
+#include <__config>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/apply_cv.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_base_of.h>
+#include <__type_traits/is_core_convertible.h>
+#include <__type_traits/is_member_function_pointer.h>
+#include <__type_traits/is_member_object_pointer.h>
+#include <__type_traits/is_reference_wrapper.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_void.h>
+#include <__type_traits/nat.h>
+#include <__type_traits/remove_cv.h>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+// TODO: Disentangle the type traits and std::invoke properly
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+struct __any
+{
+    __any(...);
+};
+
+template <class _MP, bool _IsMemberFunctionPtr, bool _IsMemberObjectPtr>
+struct __member_pointer_traits_imp
+{
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param...), true, false>
+{
+    typedef _Class _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param..., ...), true, false>
+{
+    typedef _Class _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param..., ...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param...) const, true, false>
+{
+    typedef _Class const _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param..., ...) const, true, false>
+{
+    typedef _Class const _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param..., ...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param...) volatile, true, false>
+{
+    typedef _Class volatile _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param..., ...) volatile, true, false>
+{
+    typedef _Class volatile _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param..., ...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param...) const volatile, true, false>
+{
+    typedef _Class const volatile _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param..., ...) const volatile, true, false>
+{
+    typedef _Class const volatile _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param..., ...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param...) &, true, false>
+{
+    typedef _Class& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param..., ...) &, true, false>
+{
+    typedef _Class& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param..., ...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param...) const&, true, false>
+{
+    typedef _Class const& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param..., ...) const&, true, false>
+{
+    typedef _Class const& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param..., ...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param...) volatile&, true, false>
+{
+    typedef _Class volatile& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param..., ...) volatile&, true, false>
+{
+    typedef _Class volatile& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param..., ...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param...) const volatile&, true, false>
+{
+    typedef _Class const volatile& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param..., ...) const volatile&, true, false>
+{
+    typedef _Class const volatile& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param..., ...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param...) &&, true, false>
+{
+    typedef _Class&& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param..., ...) &&, true, false>
+{
+    typedef _Class&& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param..., ...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param...) const&&, true, false>
+{
+    typedef _Class const&& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param..., ...) const&&, true, false>
+{
+    typedef _Class const&& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param..., ...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param...) volatile&&, true, false>
+{
+    typedef _Class volatile&& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param..., ...) volatile&&, true, false>
+{
+    typedef _Class volatile&& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param..., ...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param...) const volatile&&, true, false>
+{
+    typedef _Class const volatile&& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param...);
+};
+
+template <class _Rp, class _Class, class ..._Param>
+struct __member_pointer_traits_imp<_Rp (_Class::*)(_Param..., ...) const volatile&&, true, false>
+{
+    typedef _Class const volatile&& _ClassType;
+    typedef _Rp _ReturnType;
+    typedef _Rp (_FnType) (_Param..., ...);
+};
+
+template <class _Rp, class _Class>
+struct __member_pointer_traits_imp<_Rp _Class::*, false, true>
+{
+    typedef _Class _ClassType;
+    typedef _Rp _ReturnType;
+};
+
+template <class _MP>
+struct __member_pointer_traits
+    : public __member_pointer_traits_imp<__remove_cv_t<_MP>,
+                    is_member_function_pointer<_MP>::value,
+                    is_member_object_pointer<_MP>::value>
+{
+//     typedef ... _ClassType;
+//     typedef ... _ReturnType;
+//     typedef ... _FnType;
+};
+
+template <class _DecayedFp>
+struct __member_pointer_class_type {};
+
+template <class _Ret, class _ClassType>
+struct __member_pointer_class_type<_Ret _ClassType::*> {
+  typedef _ClassType type;
+};
+
+template <class _Fp, class _A0,
+         class _DecayFp = typename decay<_Fp>::type,
+         class _DecayA0 = typename decay<_A0>::type,
+         class _ClassT = typename __member_pointer_class_type<_DecayFp>::type>
+using __enable_if_bullet1 = typename enable_if
+    <
+        is_member_function_pointer<_DecayFp>::value
+        && is_base_of<_ClassT, _DecayA0>::value
+    >::type;
+
+template <class _Fp, class _A0,
+         class _DecayFp = typename decay<_Fp>::type,
+         class _DecayA0 = typename decay<_A0>::type>
+using __enable_if_bullet2 = typename enable_if
+    <
+        is_member_function_pointer<_DecayFp>::value
+        && __is_reference_wrapper<_DecayA0>::value
+    >::type;
+
+template <class _Fp, class _A0,
+         class _DecayFp = typename decay<_Fp>::type,
+         class _DecayA0 = typename decay<_A0>::type,
+         class _ClassT = typename __member_pointer_class_type<_DecayFp>::type>
+using __enable_if_bullet3 = typename enable_if
+    <
+        is_member_function_pointer<_DecayFp>::value
+        && !is_base_of<_ClassT, _DecayA0>::value
+        && !__is_reference_wrapper<_DecayA0>::value
+    >::type;
+
+template <class _Fp, class _A0,
+         class _DecayFp = typename decay<_Fp>::type,
+         class _DecayA0 = typename decay<_A0>::type,
+         class _ClassT = typename __member_pointer_class_type<_DecayFp>::type>
+using __enable_if_bullet4 = typename enable_if
+    <
+        is_member_object_pointer<_DecayFp>::value
+        && is_base_of<_ClassT, _DecayA0>::value
+    >::type;
+
+template <class _Fp, class _A0,
+         class _DecayFp = typename decay<_Fp>::type,
+         class _DecayA0 = typename decay<_A0>::type>
+using __enable_if_bullet5 = typename enable_if
+    <
+        is_member_object_pointer<_DecayFp>::value
+        && __is_reference_wrapper<_DecayA0>::value
+    >::type;
+
+template <class _Fp, class _A0,
+         class _DecayFp = typename decay<_Fp>::type,
+         class _DecayA0 = typename decay<_A0>::type,
+         class _ClassT = typename __member_pointer_class_type<_DecayFp>::type>
+using __enable_if_bullet6 = typename enable_if
+    <
+        is_member_object_pointer<_DecayFp>::value
+        && !is_base_of<_ClassT, _DecayA0>::value
+        && !__is_reference_wrapper<_DecayA0>::value
+    >::type;
+
+// __invoke forward declarations
+
+// fall back - none of the bullets
+
+template <class ..._Args>
+__nat __invoke(__any, _Args&& ...__args);
+
+// bullets 1, 2 and 3
+
+template <class _Fp, class _A0, class ..._Args,
+          class = __enable_if_bullet1<_Fp, _A0> >
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR decltype((std::declval<_A0>().*std::declval<_Fp>())(std::declval<_Args>()...))
+__invoke(_Fp&& __f, _A0&& __a0, _Args&& ...__args)
+    _NOEXCEPT_(noexcept((static_cast<_A0&&>(__a0).*__f)(static_cast<_Args&&>(__args)...)))
+    { return           (static_cast<_A0&&>(__a0).*__f)(static_cast<_Args&&>(__args)...); }
+
+template <class _Fp, class _A0, class ..._Args,
+          class = __enable_if_bullet2<_Fp, _A0> >
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR decltype((std::declval<_A0>().get().*std::declval<_Fp>())(std::declval<_Args>()...))
+__invoke(_Fp&& __f, _A0&& __a0, _Args&& ...__args)
+    _NOEXCEPT_(noexcept((__a0.get().*__f)(static_cast<_Args&&>(__args)...)))
+    { return          (__a0.get().*__f)(static_cast<_Args&&>(__args)...); }
+
+template <class _Fp, class _A0, class ..._Args,
+          class = __enable_if_bullet3<_Fp, _A0> >
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR decltype(((*std::declval<_A0>()).*std::declval<_Fp>())(std::declval<_Args>()...))
+__invoke(_Fp&& __f, _A0&& __a0, _Args&& ...__args)
+    _NOEXCEPT_(noexcept(((*static_cast<_A0&&>(__a0)).*__f)(static_cast<_Args&&>(__args)...)))
+    { return          ((*static_cast<_A0&&>(__a0)).*__f)(static_cast<_Args&&>(__args)...); }
+
+// bullets 4, 5 and 6
+
+template <class _Fp, class _A0,
+          class = __enable_if_bullet4<_Fp, _A0> >
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR decltype(std::declval<_A0>().*std::declval<_Fp>())
+__invoke(_Fp&& __f, _A0&& __a0)
+    _NOEXCEPT_(noexcept(static_cast<_A0&&>(__a0).*__f))
+    { return          static_cast<_A0&&>(__a0).*__f; }
+
+template <class _Fp, class _A0,
+          class = __enable_if_bullet5<_Fp, _A0> >
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR decltype(std::declval<_A0>().get().*std::declval<_Fp>())
+__invoke(_Fp&& __f, _A0&& __a0)
+    _NOEXCEPT_(noexcept(__a0.get().*__f))
+    { return          __a0.get().*__f; }
+
+template <class _Fp, class _A0,
+          class = __enable_if_bullet6<_Fp, _A0> >
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR decltype((*std::declval<_A0>()).*std::declval<_Fp>())
+__invoke(_Fp&& __f, _A0&& __a0)
+    _NOEXCEPT_(noexcept((*static_cast<_A0&&>(__a0)).*__f))
+    { return          (*static_cast<_A0&&>(__a0)).*__f; }
+
+// bullet 7
+
+template <class _Fp, class ..._Args>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR decltype(std::declval<_Fp>()(std::declval<_Args>()...))
+__invoke(_Fp&& __f, _Args&& ...__args)
+    _NOEXCEPT_(noexcept(static_cast<_Fp&&>(__f)(static_cast<_Args&&>(__args)...)))
+    { return          static_cast<_Fp&&>(__f)(static_cast<_Args&&>(__args)...); }
+
+// __invokable
+template <class _Ret, class _Fp, class ..._Args>
+struct __invokable_r
+{
+  template <class _XFp, class ..._XArgs>
+  static decltype(std::__invoke(std::declval<_XFp>(), std::declval<_XArgs>()...)) __try_call(int);
+  template <class _XFp, class ..._XArgs>
+  static __nat __try_call(...);
+
+  // FIXME: Check that _Ret, _Fp, and _Args... are all complete types, cv void,
+  // or incomplete array types as required by the standard.
+  using _Result = decltype(__try_call<_Fp, _Args...>(0));
+
+  using type = __conditional_t<
+      _IsNotSame<_Result, __nat>::value,
+      __conditional_t<is_void<_Ret>::value, true_type, __is_core_convertible<_Result, _Ret> >,
+      false_type>;
+  static const bool value = type::value;
+};
+template <class _Fp, class ..._Args>
+using __invokable = __invokable_r<void, _Fp, _Args...>;
+
+template <bool _IsInvokable, bool _IsCVVoid, class _Ret, class _Fp, class ..._Args>
+struct __nothrow_invokable_r_imp {
+  static const bool value = false;
+};
+
+template <class _Ret, class _Fp, class ..._Args>
+struct __nothrow_invokable_r_imp<true, false, _Ret, _Fp, _Args...>
+{
+    typedef __nothrow_invokable_r_imp _ThisT;
+
+    template <class _Tp>
+    static void __test_noexcept(_Tp) _NOEXCEPT;
+
+#ifdef _LIBCPP_CXX03_LANG
+    static const bool value = false;
+#else
+    static const bool value = noexcept(_ThisT::__test_noexcept<_Ret>(
+        _VSTD::__invoke(std::declval<_Fp>(), std::declval<_Args>()...)));
+#endif
+};
+
+template <class _Ret, class _Fp, class ..._Args>
+struct __nothrow_invokable_r_imp<true, true, _Ret, _Fp, _Args...>
+{
+#ifdef _LIBCPP_CXX03_LANG
+    static const bool value = false;
+#else
+    static const bool value = noexcept(
+        _VSTD::__invoke(std::declval<_Fp>(), std::declval<_Args>()...));
+#endif
+};
+
+template <class _Ret, class _Fp, class ..._Args>
+using __nothrow_invokable_r =
+    __nothrow_invokable_r_imp<
+            __invokable_r<_Ret, _Fp, _Args...>::value,
+            is_void<_Ret>::value,
+            _Ret, _Fp, _Args...
+    >;
+
+template <class _Fp, class ..._Args>
+using __nothrow_invokable =
+    __nothrow_invokable_r_imp<
+            __invokable<_Fp, _Args...>::value,
+            true, void, _Fp, _Args...
+    >;
+
+template <class _Fp, class ..._Args>
+struct __invoke_of
+    : public enable_if<
+        __invokable<_Fp, _Args...>::value,
+        typename __invokable_r<void, _Fp, _Args...>::_Result>
+{
+};
+
+template <class _Ret, bool = is_void<_Ret>::value>
+struct __invoke_void_return_wrapper
+{
+    template <class ..._Args>
+    static _Ret __call(_Args&&... __args) {
+        return std::__invoke(std::forward<_Args>(__args)...);
+    }
+};
+
+template <class _Ret>
+struct __invoke_void_return_wrapper<_Ret, true>
+{
+    template <class ..._Args>
+    static void __call(_Args&&... __args) {
+        std::__invoke(std::forward<_Args>(__args)...);
+    }
+};
+
+#if _LIBCPP_STD_VER > 14
+
+// is_invocable
+
+template <class _Fn, class ..._Args>
+struct _LIBCPP_TEMPLATE_VIS is_invocable
+    : integral_constant<bool, __invokable<_Fn, _Args...>::value> {};
+
+template <class _Ret, class _Fn, class ..._Args>
+struct _LIBCPP_TEMPLATE_VIS is_invocable_r
+    : integral_constant<bool, __invokable_r<_Ret, _Fn, _Args...>::value> {};
+
+template <class _Fn, class ..._Args>
+inline constexpr bool is_invocable_v = is_invocable<_Fn, _Args...>::value;
+
+template <class _Ret, class _Fn, class ..._Args>
+inline constexpr bool is_invocable_r_v = is_invocable_r<_Ret, _Fn, _Args...>::value;
+
+// is_nothrow_invocable
+
+template <class _Fn, class ..._Args>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_invocable
+    : integral_constant<bool, __nothrow_invokable<_Fn, _Args...>::value> {};
+
+template <class _Ret, class _Fn, class ..._Args>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_invocable_r
+    : integral_constant<bool, __nothrow_invokable_r<_Ret, _Fn, _Args...>::value> {};
+
+template <class _Fn, class ..._Args>
+inline constexpr bool is_nothrow_invocable_v = is_nothrow_invocable<_Fn, _Args...>::value;
+
+template <class _Ret, class _Fn, class ..._Args>
+inline constexpr bool is_nothrow_invocable_r_v = is_nothrow_invocable_r<_Ret, _Fn, _Args...>::value;
+
+template <class _Fn, class... _Args>
+struct _LIBCPP_TEMPLATE_VIS invoke_result
+    : __invoke_of<_Fn, _Args...>
+{
+};
+
+template <class _Fn, class... _Args>
+using invoke_result_t = typename invoke_result<_Fn, _Args...>::type;
+
+template <class _Fn, class ..._Args>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 invoke_result_t<_Fn, _Args...>
+invoke(_Fn&& __f, _Args&&... __args)
+    noexcept(is_nothrow_invocable_v<_Fn, _Args...>)
+{
+    return _VSTD::__invoke(_VSTD::forward<_Fn>(__f), _VSTD::forward<_Args>(__args)...);
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_INVOKE_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/is_transparent.h b/app/src/main/cpp/libcxx/include/__functional/is_transparent.h
new file mode 100644
index 0000000..c7a0ee9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/is_transparent.h
@@ -0,0 +1,35 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_IS_TRANSPARENT
+#define _LIBCPP___FUNCTIONAL_IS_TRANSPARENT
+
+#include <__config>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 11
+
+template <class _Tp, class, class = void>
+struct __is_transparent : false_type {};
+
+template <class _Tp, class _Up>
+struct __is_transparent<_Tp, _Up, __void_t<typename _Tp::is_transparent> >
+   : true_type {};
+
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_IS_TRANSPARENT
diff --git a/app/src/main/cpp/libcxx/include/__functional/mem_fn.h b/app/src/main/cpp/libcxx/include/__functional/mem_fn.h
new file mode 100644
index 0000000..8b51627
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/mem_fn.h
@@ -0,0 +1,59 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_MEM_FN_H
+#define _LIBCPP___FUNCTIONAL_MEM_FN_H
+
+#include <__config>
+#include <__functional/binary_function.h>
+#include <__functional/invoke.h>
+#include <__functional/weak_result_type.h>
+#include <__utility/forward.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+class __mem_fn : public __weak_result_type<_Tp>
+{
+public:
+    // types
+    typedef _Tp type;
+private:
+    type __f_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __mem_fn(type __f) _NOEXCEPT : __f_(__f) {}
+
+    // invoke
+    template <class... _ArgTypes>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+
+    typename __invoke_return<type, _ArgTypes...>::type
+    operator() (_ArgTypes&&... __args) const {
+        return std::__invoke(__f_, std::forward<_ArgTypes>(__args)...);
+    }
+};
+
+template<class _Rp, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+__mem_fn<_Rp _Tp::*>
+mem_fn(_Rp _Tp::* __pm) _NOEXCEPT
+{
+    return __mem_fn<_Rp _Tp::*>(__pm);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_MEM_FN_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/mem_fun_ref.h b/app/src/main/cpp/libcxx/include/__functional/mem_fun_ref.h
new file mode 100644
index 0000000..65aab06
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/mem_fun_ref.h
@@ -0,0 +1,173 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_MEM_FUN_REF_H
+#define _LIBCPP___FUNCTIONAL_MEM_FUN_REF_H
+
+#include <__config>
+#include <__functional/binary_function.h>
+#include <__functional/unary_function.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_BINDERS)
+
+template<class _Sp, class _Tp>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 mem_fun_t
+    : public __unary_function<_Tp*, _Sp>
+{
+    _Sp (_Tp::*__p_)();
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit mem_fun_t(_Sp (_Tp::*__p)())
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY _Sp operator()(_Tp* __p) const
+        {return (__p->*__p_)();}
+};
+
+template<class _Sp, class _Tp, class _Ap>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 mem_fun1_t
+    : public __binary_function<_Tp*, _Ap, _Sp>
+{
+    _Sp (_Tp::*__p_)(_Ap);
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit mem_fun1_t(_Sp (_Tp::*__p)(_Ap))
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY _Sp operator()(_Tp* __p, _Ap __x) const
+        {return (__p->*__p_)(__x);}
+};
+
+template<class _Sp, class _Tp>
+_LIBCPP_DEPRECATED_IN_CXX11 inline _LIBCPP_INLINE_VISIBILITY
+mem_fun_t<_Sp,_Tp>
+mem_fun(_Sp (_Tp::*__f)())
+    {return mem_fun_t<_Sp,_Tp>(__f);}
+
+template<class _Sp, class _Tp, class _Ap>
+_LIBCPP_DEPRECATED_IN_CXX11 inline _LIBCPP_INLINE_VISIBILITY
+mem_fun1_t<_Sp,_Tp,_Ap>
+mem_fun(_Sp (_Tp::*__f)(_Ap))
+    {return mem_fun1_t<_Sp,_Tp,_Ap>(__f);}
+
+template<class _Sp, class _Tp>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 mem_fun_ref_t
+    : public __unary_function<_Tp, _Sp>
+{
+    _Sp (_Tp::*__p_)();
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit mem_fun_ref_t(_Sp (_Tp::*__p)())
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY _Sp operator()(_Tp& __p) const
+        {return (__p.*__p_)();}
+};
+
+template<class _Sp, class _Tp, class _Ap>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 mem_fun1_ref_t
+    : public __binary_function<_Tp, _Ap, _Sp>
+{
+    _Sp (_Tp::*__p_)(_Ap);
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit mem_fun1_ref_t(_Sp (_Tp::*__p)(_Ap))
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY _Sp operator()(_Tp& __p, _Ap __x) const
+        {return (__p.*__p_)(__x);}
+};
+
+template<class _Sp, class _Tp>
+_LIBCPP_DEPRECATED_IN_CXX11 inline _LIBCPP_INLINE_VISIBILITY
+mem_fun_ref_t<_Sp,_Tp>
+mem_fun_ref(_Sp (_Tp::*__f)())
+    {return mem_fun_ref_t<_Sp,_Tp>(__f);}
+
+template<class _Sp, class _Tp, class _Ap>
+_LIBCPP_DEPRECATED_IN_CXX11 inline _LIBCPP_INLINE_VISIBILITY
+mem_fun1_ref_t<_Sp,_Tp,_Ap>
+mem_fun_ref(_Sp (_Tp::*__f)(_Ap))
+    {return mem_fun1_ref_t<_Sp,_Tp,_Ap>(__f);}
+
+template <class _Sp, class _Tp>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 const_mem_fun_t
+    : public __unary_function<const _Tp*, _Sp>
+{
+    _Sp (_Tp::*__p_)() const;
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit const_mem_fun_t(_Sp (_Tp::*__p)() const)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY _Sp operator()(const _Tp* __p) const
+        {return (__p->*__p_)();}
+};
+
+template <class _Sp, class _Tp, class _Ap>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 const_mem_fun1_t
+    : public __binary_function<const _Tp*, _Ap, _Sp>
+{
+    _Sp (_Tp::*__p_)(_Ap) const;
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit const_mem_fun1_t(_Sp (_Tp::*__p)(_Ap) const)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY _Sp operator()(const _Tp* __p, _Ap __x) const
+        {return (__p->*__p_)(__x);}
+};
+
+template <class _Sp, class _Tp>
+_LIBCPP_DEPRECATED_IN_CXX11 inline _LIBCPP_INLINE_VISIBILITY
+const_mem_fun_t<_Sp,_Tp>
+mem_fun(_Sp (_Tp::*__f)() const)
+    {return const_mem_fun_t<_Sp,_Tp>(__f);}
+
+template <class _Sp, class _Tp, class _Ap>
+_LIBCPP_DEPRECATED_IN_CXX11 inline _LIBCPP_INLINE_VISIBILITY
+const_mem_fun1_t<_Sp,_Tp,_Ap>
+mem_fun(_Sp (_Tp::*__f)(_Ap) const)
+    {return const_mem_fun1_t<_Sp,_Tp,_Ap>(__f);}
+
+template <class _Sp, class _Tp>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 const_mem_fun_ref_t
+    : public __unary_function<_Tp, _Sp>
+{
+    _Sp (_Tp::*__p_)() const;
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit const_mem_fun_ref_t(_Sp (_Tp::*__p)() const)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY _Sp operator()(const _Tp& __p) const
+        {return (__p.*__p_)();}
+};
+
+template <class _Sp, class _Tp, class _Ap>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 const_mem_fun1_ref_t
+    : public __binary_function<_Tp, _Ap, _Sp>
+{
+    _Sp (_Tp::*__p_)(_Ap) const;
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit const_mem_fun1_ref_t(_Sp (_Tp::*__p)(_Ap) const)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY _Sp operator()(const _Tp& __p, _Ap __x) const
+        {return (__p.*__p_)(__x);}
+};
+
+template <class _Sp, class _Tp>
+_LIBCPP_DEPRECATED_IN_CXX11 inline _LIBCPP_INLINE_VISIBILITY
+const_mem_fun_ref_t<_Sp,_Tp>
+mem_fun_ref(_Sp (_Tp::*__f)() const)
+    {return const_mem_fun_ref_t<_Sp,_Tp>(__f);}
+
+template <class _Sp, class _Tp, class _Ap>
+_LIBCPP_DEPRECATED_IN_CXX11 inline _LIBCPP_INLINE_VISIBILITY
+const_mem_fun1_ref_t<_Sp,_Tp,_Ap>
+mem_fun_ref(_Sp (_Tp::*__f)(_Ap) const)
+    {return const_mem_fun1_ref_t<_Sp,_Tp,_Ap>(__f);}
+
+#endif // _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_BINDERS)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_MEM_FUN_REF_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/not_fn.h b/app/src/main/cpp/libcxx/include/__functional/not_fn.h
new file mode 100644
index 0000000..79d9a87
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/not_fn.h
@@ -0,0 +1,54 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_NOT_FN_H
+#define _LIBCPP___FUNCTIONAL_NOT_FN_H
+
+#include <__config>
+#include <__functional/invoke.h>
+#include <__functional/perfect_forward.h>
+#include <__utility/forward.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+struct __not_fn_op {
+    template <class... _Args>
+    _LIBCPP_HIDE_FROM_ABI
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 auto operator()(_Args&&... __args) const
+        noexcept(noexcept(!_VSTD::invoke(_VSTD::forward<_Args>(__args)...)))
+        -> decltype(      !_VSTD::invoke(_VSTD::forward<_Args>(__args)...))
+        { return          !_VSTD::invoke(_VSTD::forward<_Args>(__args)...); }
+};
+
+template <class _Fn>
+struct __not_fn_t : __perfect_forward<__not_fn_op, _Fn> {
+    using __perfect_forward<__not_fn_op, _Fn>::__perfect_forward;
+};
+
+template <class _Fn, class = enable_if_t<
+    is_constructible_v<decay_t<_Fn>, _Fn> &&
+    is_move_constructible_v<decay_t<_Fn>>
+>>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_CONSTEXPR_SINCE_CXX20 auto not_fn(_Fn&& __f) {
+    return __not_fn_t<decay_t<_Fn>>(_VSTD::forward<_Fn>(__f));
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_NOT_FN_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/operations.h b/app/src/main/cpp/libcxx/include/__functional/operations.h
new file mode 100644
index 0000000..8a781ef
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/operations.h
@@ -0,0 +1,580 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_OPERATIONS_H
+#define _LIBCPP___FUNCTIONAL_OPERATIONS_H
+
+#include <__config>
+#include <__functional/binary_function.h>
+#include <__functional/unary_function.h>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Arithmetic operations
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS plus
+    : __binary_function<_Tp, _Tp, _Tp>
+{
+    typedef _Tp __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x + __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(plus);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS plus<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) + _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) + _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) + _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS minus
+    : __binary_function<_Tp, _Tp, _Tp>
+{
+    typedef _Tp __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x - __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(minus);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS minus<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) - _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) - _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) - _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS multiplies
+    : __binary_function<_Tp, _Tp, _Tp>
+{
+    typedef _Tp __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x * __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(multiplies);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS multiplies<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) * _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) * _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) * _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS divides
+    : __binary_function<_Tp, _Tp, _Tp>
+{
+    typedef _Tp __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x / __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(divides);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS divides<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) / _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) / _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) / _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS modulus
+    : __binary_function<_Tp, _Tp, _Tp>
+{
+    typedef _Tp __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x % __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(modulus);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS modulus<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) % _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) % _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) % _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS negate
+    : __unary_function<_Tp, _Tp>
+{
+    typedef _Tp __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return -__x;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(negate);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS negate<void>
+{
+    template <class _Tp>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_Tp&& __x) const
+        noexcept(noexcept(- _VSTD::forward<_Tp>(__x)))
+        -> decltype(      - _VSTD::forward<_Tp>(__x))
+        { return          - _VSTD::forward<_Tp>(__x); }
+    typedef void is_transparent;
+};
+#endif
+
+// Bitwise operations
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS bit_and
+    : __binary_function<_Tp, _Tp, _Tp>
+{
+    typedef _Tp __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x & __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(bit_and);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS bit_and<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) & _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) & _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) & _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+struct _LIBCPP_TEMPLATE_VIS bit_not
+    : __unary_function<_Tp, _Tp>
+{
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return ~__x;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(bit_not);
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS bit_not<void>
+{
+    template <class _Tp>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_Tp&& __x) const
+        noexcept(noexcept(~_VSTD::forward<_Tp>(__x)))
+        -> decltype(      ~_VSTD::forward<_Tp>(__x))
+        { return          ~_VSTD::forward<_Tp>(__x); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS bit_or
+    : __binary_function<_Tp, _Tp, _Tp>
+{
+    typedef _Tp __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x | __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(bit_or);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS bit_or<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) | _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) | _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) | _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS bit_xor
+    : __binary_function<_Tp, _Tp, _Tp>
+{
+    typedef _Tp __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x ^ __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(bit_xor);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS bit_xor<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) ^ _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) ^ _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) ^ _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+// Comparison operations
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS equal_to
+    : __binary_function<_Tp, _Tp, bool>
+{
+    typedef bool __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x == __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(equal_to);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS equal_to<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) == _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) == _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) == _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS not_equal_to
+    : __binary_function<_Tp, _Tp, bool>
+{
+    typedef bool __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x != __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(not_equal_to);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS not_equal_to<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) != _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) != _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) != _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS less
+    : __binary_function<_Tp, _Tp, bool>
+{
+    typedef bool __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x < __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(less);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS less<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) < _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) < _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) < _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS less_equal
+    : __binary_function<_Tp, _Tp, bool>
+{
+    typedef bool __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x <= __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(less_equal);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS less_equal<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) <= _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) <= _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) <= _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS greater_equal
+    : __binary_function<_Tp, _Tp, bool>
+{
+    typedef bool __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x >= __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(greater_equal);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS greater_equal<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) >= _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) >= _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) >= _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS greater
+    : __binary_function<_Tp, _Tp, bool>
+{
+    typedef bool __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x > __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(greater);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS greater<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) > _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) > _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) > _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+// Logical operations
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS logical_and
+    : __binary_function<_Tp, _Tp, bool>
+{
+    typedef bool __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x && __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(logical_and);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS logical_and<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) && _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) && _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) && _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS logical_not
+    : __unary_function<_Tp, bool>
+{
+    typedef bool __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x) const
+        {return !__x;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(logical_not);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS logical_not<void>
+{
+    template <class _Tp>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_Tp&& __x) const
+        noexcept(noexcept(!_VSTD::forward<_Tp>(__x)))
+        -> decltype(      !_VSTD::forward<_Tp>(__x))
+        { return          !_VSTD::forward<_Tp>(__x); }
+    typedef void is_transparent;
+};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp = void>
+#else
+template <class _Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS logical_or
+    : __binary_function<_Tp, _Tp, bool>
+{
+    typedef bool __result_type;  // used by valarray
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x || __y;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(logical_or);
+
+#if _LIBCPP_STD_VER > 11
+template <>
+struct _LIBCPP_TEMPLATE_VIS logical_or<void>
+{
+    template <class _T1, class _T2>
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    auto operator()(_T1&& __t, _T2&& __u) const
+        noexcept(noexcept(_VSTD::forward<_T1>(__t) || _VSTD::forward<_T2>(__u)))
+        -> decltype(      _VSTD::forward<_T1>(__t) || _VSTD::forward<_T2>(__u))
+        { return          _VSTD::forward<_T1>(__t) || _VSTD::forward<_T2>(__u); }
+    typedef void is_transparent;
+};
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_OPERATIONS_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/perfect_forward.h b/app/src/main/cpp/libcxx/include/__functional/perfect_forward.h
new file mode 100644
index 0000000..9ffea1a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/perfect_forward.h
@@ -0,0 +1,94 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_PERFECT_FORWARD_H
+#define _LIBCPP___FUNCTIONAL_PERFECT_FORWARD_H
+
+#include <__config>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <tuple>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _Op, class _Indices, class... _BoundArgs>
+struct __perfect_forward_impl;
+
+template <class _Op, size_t... _Idx, class... _BoundArgs>
+struct __perfect_forward_impl<_Op, index_sequence<_Idx...>, _BoundArgs...> {
+private:
+  tuple<_BoundArgs...> __bound_args_;
+
+public:
+  template <class... _Args, class = enable_if_t<
+    is_constructible_v<tuple<_BoundArgs...>, _Args&&...>
+  >>
+  explicit constexpr __perfect_forward_impl(_Args&&... __bound_args)
+    : __bound_args_(_VSTD::forward<_Args>(__bound_args)...) {}
+
+  __perfect_forward_impl(__perfect_forward_impl const&) = default;
+  __perfect_forward_impl(__perfect_forward_impl&&) = default;
+
+  __perfect_forward_impl& operator=(__perfect_forward_impl const&) = default;
+  __perfect_forward_impl& operator=(__perfect_forward_impl&&) = default;
+
+  template <class... _Args, class = enable_if_t<is_invocable_v<_Op, _BoundArgs&..., _Args...>>>
+  _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Args&&... __args) &
+    noexcept(noexcept(_Op()(_VSTD::get<_Idx>(__bound_args_)..., _VSTD::forward<_Args>(__args)...)))
+    -> decltype(      _Op()(_VSTD::get<_Idx>(__bound_args_)..., _VSTD::forward<_Args>(__args)...))
+    { return          _Op()(_VSTD::get<_Idx>(__bound_args_)..., _VSTD::forward<_Args>(__args)...); }
+
+  template <class... _Args, class = enable_if_t<!is_invocable_v<_Op, _BoundArgs&..., _Args...>>>
+  auto operator()(_Args&&...) & = delete;
+
+  template <class... _Args, class = enable_if_t<is_invocable_v<_Op, _BoundArgs const&..., _Args...>>>
+  _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Args&&... __args) const&
+    noexcept(noexcept(_Op()(_VSTD::get<_Idx>(__bound_args_)..., _VSTD::forward<_Args>(__args)...)))
+    -> decltype(      _Op()(_VSTD::get<_Idx>(__bound_args_)..., _VSTD::forward<_Args>(__args)...))
+    { return          _Op()(_VSTD::get<_Idx>(__bound_args_)..., _VSTD::forward<_Args>(__args)...); }
+
+  template <class... _Args, class = enable_if_t<!is_invocable_v<_Op, _BoundArgs const&..., _Args...>>>
+  auto operator()(_Args&&...) const& = delete;
+
+  template <class... _Args, class = enable_if_t<is_invocable_v<_Op, _BoundArgs..., _Args...>>>
+  _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Args&&... __args) &&
+    noexcept(noexcept(_Op()(_VSTD::get<_Idx>(_VSTD::move(__bound_args_))..., _VSTD::forward<_Args>(__args)...)))
+    -> decltype(      _Op()(_VSTD::get<_Idx>(_VSTD::move(__bound_args_))..., _VSTD::forward<_Args>(__args)...))
+    { return          _Op()(_VSTD::get<_Idx>(_VSTD::move(__bound_args_))..., _VSTD::forward<_Args>(__args)...); }
+
+  template <class... _Args, class = enable_if_t<!is_invocable_v<_Op, _BoundArgs..., _Args...>>>
+  auto operator()(_Args&&...) && = delete;
+
+  template <class... _Args, class = enable_if_t<is_invocable_v<_Op, _BoundArgs const..., _Args...>>>
+  _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Args&&... __args) const&&
+    noexcept(noexcept(_Op()(_VSTD::get<_Idx>(_VSTD::move(__bound_args_))..., _VSTD::forward<_Args>(__args)...)))
+    -> decltype(      _Op()(_VSTD::get<_Idx>(_VSTD::move(__bound_args_))..., _VSTD::forward<_Args>(__args)...))
+    { return          _Op()(_VSTD::get<_Idx>(_VSTD::move(__bound_args_))..., _VSTD::forward<_Args>(__args)...); }
+
+  template <class... _Args, class = enable_if_t<!is_invocable_v<_Op, _BoundArgs const..., _Args...>>>
+  auto operator()(_Args&&...) const&& = delete;
+};
+
+// __perfect_forward implements a perfect-forwarding call wrapper as explained in [func.require].
+template <class _Op, class ..._Args>
+using __perfect_forward = __perfect_forward_impl<_Op, index_sequence_for<_Args...>, _Args...>;
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_PERFECT_FORWARD_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/pointer_to_binary_function.h b/app/src/main/cpp/libcxx/include/__functional/pointer_to_binary_function.h
new file mode 100644
index 0000000..b2676c5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/pointer_to_binary_function.h
@@ -0,0 +1,46 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_POINTER_TO_BINARY_FUNCTION_H
+#define _LIBCPP___FUNCTIONAL_POINTER_TO_BINARY_FUNCTION_H
+
+#include <__config>
+#include <__functional/binary_function.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_BINDERS)
+
+template <class _Arg1, class _Arg2, class _Result>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 pointer_to_binary_function
+    : public __binary_function<_Arg1, _Arg2, _Result>
+{
+    _Result (*__f_)(_Arg1, _Arg2);
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit pointer_to_binary_function(_Result (*__f)(_Arg1, _Arg2))
+        : __f_(__f) {}
+    _LIBCPP_INLINE_VISIBILITY _Result operator()(_Arg1 __x, _Arg2 __y) const
+        {return __f_(__x, __y);}
+};
+
+template <class _Arg1, class _Arg2, class _Result>
+_LIBCPP_DEPRECATED_IN_CXX11 inline _LIBCPP_INLINE_VISIBILITY
+pointer_to_binary_function<_Arg1,_Arg2,_Result>
+ptr_fun(_Result (*__f)(_Arg1,_Arg2))
+    {return pointer_to_binary_function<_Arg1,_Arg2,_Result>(__f);}
+
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_POINTER_TO_BINARY_FUNCTION_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/pointer_to_unary_function.h b/app/src/main/cpp/libcxx/include/__functional/pointer_to_unary_function.h
new file mode 100644
index 0000000..77d07ad
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/pointer_to_unary_function.h
@@ -0,0 +1,46 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_POINTER_TO_UNARY_FUNCTION_H
+#define _LIBCPP___FUNCTIONAL_POINTER_TO_UNARY_FUNCTION_H
+
+#include <__config>
+#include <__functional/unary_function.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_BINDERS)
+
+template <class _Arg, class _Result>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 pointer_to_unary_function
+    : public __unary_function<_Arg, _Result>
+{
+    _Result (*__f_)(_Arg);
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit pointer_to_unary_function(_Result (*__f)(_Arg))
+        : __f_(__f) {}
+    _LIBCPP_INLINE_VISIBILITY _Result operator()(_Arg __x) const
+        {return __f_(__x);}
+};
+
+template <class _Arg, class _Result>
+_LIBCPP_DEPRECATED_IN_CXX11 inline _LIBCPP_INLINE_VISIBILITY
+pointer_to_unary_function<_Arg,_Result>
+ptr_fun(_Result (*__f)(_Arg))
+    {return pointer_to_unary_function<_Arg,_Result>(__f);}
+
+#endif // _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_BINDERS)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_POINTER_TO_UNARY_FUNCTION_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/ranges_operations.h b/app/src/main/cpp/libcxx/include/__functional/ranges_operations.h
new file mode 100644
index 0000000..87081dd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/ranges_operations.h
@@ -0,0 +1,100 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_RANGES_OPERATIONS_H
+#define _LIBCPP___FUNCTIONAL_RANGES_OPERATIONS_H
+
+#include <__concepts/equality_comparable.h>
+#include <__concepts/totally_ordered.h>
+#include <__config>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+struct equal_to {
+  template <class _Tp, class _Up>
+  requires equality_comparable_with<_Tp, _Up>
+  [[nodiscard]] constexpr bool operator()(_Tp &&__t, _Up &&__u) const
+      noexcept(noexcept(bool(_VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u)))) {
+    return _VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u);
+  }
+
+  using is_transparent = void;
+};
+
+struct not_equal_to {
+  template <class _Tp, class _Up>
+  requires equality_comparable_with<_Tp, _Up>
+  [[nodiscard]] constexpr bool operator()(_Tp &&__t, _Up &&__u) const
+      noexcept(noexcept(bool(!(_VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u))))) {
+    return !(_VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u));
+  }
+
+  using is_transparent = void;
+};
+
+struct less {
+  template <class _Tp, class _Up>
+  requires totally_ordered_with<_Tp, _Up>
+  [[nodiscard]] constexpr bool operator()(_Tp &&__t, _Up &&__u) const
+      noexcept(noexcept(bool(_VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u)))) {
+    return _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u);
+  }
+
+  using is_transparent = void;
+};
+
+struct less_equal {
+  template <class _Tp, class _Up>
+  requires totally_ordered_with<_Tp, _Up>
+  [[nodiscard]] constexpr bool operator()(_Tp &&__t, _Up &&__u) const
+      noexcept(noexcept(bool(!(_VSTD::forward<_Up>(__u) < _VSTD::forward<_Tp>(__t))))) {
+    return !(_VSTD::forward<_Up>(__u) < _VSTD::forward<_Tp>(__t));
+  }
+
+  using is_transparent = void;
+};
+
+struct greater {
+  template <class _Tp, class _Up>
+  requires totally_ordered_with<_Tp, _Up>
+  [[nodiscard]] constexpr bool operator()(_Tp &&__t, _Up &&__u) const
+      noexcept(noexcept(bool(_VSTD::forward<_Up>(__u) < _VSTD::forward<_Tp>(__t)))) {
+    return _VSTD::forward<_Up>(__u) < _VSTD::forward<_Tp>(__t);
+  }
+
+  using is_transparent = void;
+};
+
+struct greater_equal {
+  template <class _Tp, class _Up>
+  requires totally_ordered_with<_Tp, _Up>
+  [[nodiscard]] constexpr bool operator()(_Tp &&__t, _Up &&__u) const
+      noexcept(noexcept(bool(!(_VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u))))) {
+    return !(_VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u));
+  }
+
+  using is_transparent = void;
+};
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_RANGES_OPERATIONS_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/reference_wrapper.h b/app/src/main/cpp/libcxx/include/__functional/reference_wrapper.h
new file mode 100644
index 0000000..c377b64
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/reference_wrapper.h
@@ -0,0 +1,105 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_REFERENCE_WRAPPER_H
+#define _LIBCPP___FUNCTIONAL_REFERENCE_WRAPPER_H
+
+#include <__config>
+#include <__functional/invoke.h>
+#include <__functional/weak_result_type.h>
+#include <__memory/addressof.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+class _LIBCPP_TEMPLATE_VIS reference_wrapper : public __weak_result_type<_Tp>
+{
+public:
+    // types
+    typedef _Tp type;
+private:
+    type* __f_;
+
+    static void __fun(_Tp&) _NOEXCEPT;
+    static void __fun(_Tp&&) = delete;
+
+public:
+    template <class _Up, class = __enable_if_t<!__is_same_uncvref<_Up, reference_wrapper>::value, decltype(__fun(std::declval<_Up>())) > >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    reference_wrapper(_Up&& __u) _NOEXCEPT_(noexcept(__fun(std::declval<_Up>()))) {
+        type& __f = static_cast<_Up&&>(__u);
+        __f_ = _VSTD::addressof(__f);
+    }
+
+    // access
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    operator type&() const _NOEXCEPT {return *__f_;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    type& get() const _NOEXCEPT {return *__f_;}
+
+    // invoke
+    template <class... _ArgTypes>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    typename __invoke_of<type&, _ArgTypes...>::type
+    operator() (_ArgTypes&&... __args) const {
+        return std::__invoke(get(), std::forward<_ArgTypes>(__args)...);
+    }
+};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+reference_wrapper(_Tp&) -> reference_wrapper<_Tp>;
+#endif
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+reference_wrapper<_Tp>
+ref(_Tp& __t) _NOEXCEPT
+{
+    return reference_wrapper<_Tp>(__t);
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+reference_wrapper<_Tp>
+ref(reference_wrapper<_Tp> __t) _NOEXCEPT
+{
+    return __t;
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+reference_wrapper<const _Tp>
+cref(const _Tp& __t) _NOEXCEPT
+{
+    return reference_wrapper<const _Tp>(__t);
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+reference_wrapper<const _Tp>
+cref(reference_wrapper<_Tp> __t) _NOEXCEPT
+{
+    return __t;
+}
+
+template <class _Tp> void ref(const _Tp&&) = delete;
+template <class _Tp> void cref(const _Tp&&) = delete;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_REFERENCE_WRAPPER_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/unary_function.h b/app/src/main/cpp/libcxx/include/__functional/unary_function.h
new file mode 100644
index 0000000..f07cac1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/unary_function.h
@@ -0,0 +1,51 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_UNARY_FUNCTION_H
+#define _LIBCPP___FUNCTIONAL_UNARY_FUNCTION_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_UNARY_BINARY_FUNCTION)
+
+template <class _Arg, class _Result>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 unary_function
+{
+    typedef _Arg    argument_type;
+    typedef _Result result_type;
+};
+
+#endif // _LIBCPP_STD_VER <= 14
+
+template <class _Arg, class _Result> struct __unary_function_keep_layout_base {
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+  using argument_type _LIBCPP_DEPRECATED_IN_CXX17 = _Arg;
+  using result_type _LIBCPP_DEPRECATED_IN_CXX17 = _Result;
+#endif
+};
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_UNARY_BINARY_FUNCTION)
+_LIBCPP_DIAGNOSTIC_PUSH
+_LIBCPP_CLANG_DIAGNOSTIC_IGNORED("-Wdeprecated-declarations")
+template <class _Arg, class _Result>
+using __unary_function = unary_function<_Arg, _Result>;
+_LIBCPP_DIAGNOSTIC_POP
+#else
+template <class _Arg, class _Result>
+using __unary_function = __unary_function_keep_layout_base<_Arg, _Result>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_UNARY_FUNCTION_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/unary_negate.h b/app/src/main/cpp/libcxx/include/__functional/unary_negate.h
new file mode 100644
index 0000000..ab87e86
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/unary_negate.h
@@ -0,0 +1,47 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_UNARY_NEGATE_H
+#define _LIBCPP___FUNCTIONAL_UNARY_NEGATE_H
+
+#include <__config>
+#include <__functional/unary_function.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_NEGATORS)
+
+template <class _Predicate>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX17 unary_negate
+    : public __unary_function<typename _Predicate::argument_type, bool>
+{
+    _Predicate __pred_;
+public:
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    explicit unary_negate(const _Predicate& __pred)
+        : __pred_(__pred) {}
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const typename _Predicate::argument_type& __x) const
+        {return !__pred_(__x);}
+};
+
+template <class _Predicate>
+_LIBCPP_DEPRECATED_IN_CXX17 inline _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+unary_negate<_Predicate>
+not1(const _Predicate& __pred) {return unary_negate<_Predicate>(__pred);}
+
+#endif // _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_NEGATORS)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_UNARY_NEGATE_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/unwrap_ref.h b/app/src/main/cpp/libcxx/include/__functional/unwrap_ref.h
new file mode 100644
index 0000000..da000d8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/unwrap_ref.h
@@ -0,0 +1,58 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_UNWRAP_REF_H
+#define _LIBCPP___FUNCTIONAL_UNWRAP_REF_H
+
+#include <__config>
+#include <__type_traits/decay.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct __unwrap_reference { typedef _LIBCPP_NODEBUG _Tp type; };
+
+template <class _Tp>
+class reference_wrapper;
+
+template <class _Tp>
+struct __unwrap_reference<reference_wrapper<_Tp> > { typedef _LIBCPP_NODEBUG _Tp& type; };
+
+template <class _Tp>
+struct decay;
+
+#if _LIBCPP_STD_VER > 17
+template <class _Tp>
+struct unwrap_reference : __unwrap_reference<_Tp> { };
+
+template <class _Tp>
+using unwrap_reference_t = typename unwrap_reference<_Tp>::type;
+
+template <class _Tp>
+struct unwrap_ref_decay : unwrap_reference<typename decay<_Tp>::type> { };
+
+template <class _Tp>
+using unwrap_ref_decay_t = typename unwrap_ref_decay<_Tp>::type;
+#endif // > C++17
+
+template <class _Tp>
+struct __unwrap_ref_decay
+#if _LIBCPP_STD_VER > 17
+    : unwrap_ref_decay<_Tp>
+#else
+    : __unwrap_reference<typename decay<_Tp>::type>
+#endif
+{ };
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_UNWRAP_REF_H
diff --git a/app/src/main/cpp/libcxx/include/__functional/weak_result_type.h b/app/src/main/cpp/libcxx/include/__functional/weak_result_type.h
new file mode 100644
index 0000000..18d1bf7
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__functional/weak_result_type.h
@@ -0,0 +1,294 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_WEAK_RESULT_TYPE_H
+#define _LIBCPP___FUNCTIONAL_WEAK_RESULT_TYPE_H
+
+#include <__config>
+#include <__functional/binary_function.h>
+#include <__functional/invoke.h>
+#include <__functional/unary_function.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_same.h>
+#include <__utility/declval.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct __has_result_type
+{
+private:
+    template <class _Up> static false_type __test(...);
+    template <class _Up> static true_type __test(typename _Up::result_type* = 0);
+public:
+    static const bool value = decltype(__test<_Tp>(0))::value;
+};
+
+// __weak_result_type
+
+template <class _Tp>
+struct __derives_from_unary_function
+{
+private:
+    struct __two {char __lx; char __lxx;};
+    static __two __test(...);
+    template <class _Ap, class _Rp>
+        static __unary_function<_Ap, _Rp>
+        __test(const volatile __unary_function<_Ap, _Rp>*);
+
+public:
+    static const bool value = !is_same<decltype(__test((_Tp*)0)), __two>::value;
+    typedef decltype(__test((_Tp*)0)) type;
+};
+
+template <class _Tp>
+struct __derives_from_binary_function
+{
+private:
+    struct __two {char __lx; char __lxx;};
+    static __two __test(...);
+    template <class _A1, class _A2, class _Rp>
+        static __binary_function<_A1, _A2, _Rp>
+        __test(const volatile __binary_function<_A1, _A2, _Rp>*);
+
+public:
+    static const bool value = !is_same<decltype(__test((_Tp*)0)), __two>::value;
+    typedef decltype(__test((_Tp*)0)) type;
+};
+
+template <class _Tp, bool = __derives_from_unary_function<_Tp>::value>
+struct __maybe_derive_from_unary_function  // bool is true
+    : public __derives_from_unary_function<_Tp>::type
+{
+};
+
+template <class _Tp>
+struct __maybe_derive_from_unary_function<_Tp, false>
+{
+};
+
+template <class _Tp, bool = __derives_from_binary_function<_Tp>::value>
+struct __maybe_derive_from_binary_function  // bool is true
+    : public __derives_from_binary_function<_Tp>::type
+{
+};
+
+template <class _Tp>
+struct __maybe_derive_from_binary_function<_Tp, false>
+{
+};
+
+template <class _Tp, bool = __has_result_type<_Tp>::value>
+struct __weak_result_type_imp // bool is true
+    : public __maybe_derive_from_unary_function<_Tp>,
+      public __maybe_derive_from_binary_function<_Tp>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    using result_type _LIBCPP_NODEBUG _LIBCPP_DEPRECATED_IN_CXX17 = typename _Tp::result_type;
+#endif
+};
+
+template <class _Tp>
+struct __weak_result_type_imp<_Tp, false>
+    : public __maybe_derive_from_unary_function<_Tp>,
+      public __maybe_derive_from_binary_function<_Tp>
+{
+};
+
+template <class _Tp>
+struct __weak_result_type
+    : public __weak_result_type_imp<_Tp>
+{
+};
+
+// 0 argument case
+
+template <class _Rp>
+struct __weak_result_type<_Rp ()>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    using result_type _LIBCPP_NODEBUG _LIBCPP_DEPRECATED_IN_CXX17 = _Rp;
+#endif
+};
+
+template <class _Rp>
+struct __weak_result_type<_Rp (&)()>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    using result_type _LIBCPP_NODEBUG _LIBCPP_DEPRECATED_IN_CXX17 = _Rp;
+#endif
+};
+
+template <class _Rp>
+struct __weak_result_type<_Rp (*)()>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    using result_type _LIBCPP_NODEBUG _LIBCPP_DEPRECATED_IN_CXX17 = _Rp;
+#endif
+};
+
+// 1 argument case
+
+template <class _Rp, class _A1>
+struct __weak_result_type<_Rp (_A1)>
+    : public __unary_function<_A1, _Rp>
+{
+};
+
+template <class _Rp, class _A1>
+struct __weak_result_type<_Rp (&)(_A1)>
+    : public __unary_function<_A1, _Rp>
+{
+};
+
+template <class _Rp, class _A1>
+struct __weak_result_type<_Rp (*)(_A1)>
+    : public __unary_function<_A1, _Rp>
+{
+};
+
+template <class _Rp, class _Cp>
+struct __weak_result_type<_Rp (_Cp::*)()>
+    : public __unary_function<_Cp*, _Rp>
+{
+};
+
+template <class _Rp, class _Cp>
+struct __weak_result_type<_Rp (_Cp::*)() const>
+    : public __unary_function<const _Cp*, _Rp>
+{
+};
+
+template <class _Rp, class _Cp>
+struct __weak_result_type<_Rp (_Cp::*)() volatile>
+    : public __unary_function<volatile _Cp*, _Rp>
+{
+};
+
+template <class _Rp, class _Cp>
+struct __weak_result_type<_Rp (_Cp::*)() const volatile>
+    : public __unary_function<const volatile _Cp*, _Rp>
+{
+};
+
+// 2 argument case
+
+template <class _Rp, class _A1, class _A2>
+struct __weak_result_type<_Rp (_A1, _A2)>
+    : public __binary_function<_A1, _A2, _Rp>
+{
+};
+
+template <class _Rp, class _A1, class _A2>
+struct __weak_result_type<_Rp (*)(_A1, _A2)>
+    : public __binary_function<_A1, _A2, _Rp>
+{
+};
+
+template <class _Rp, class _A1, class _A2>
+struct __weak_result_type<_Rp (&)(_A1, _A2)>
+    : public __binary_function<_A1, _A2, _Rp>
+{
+};
+
+template <class _Rp, class _Cp, class _A1>
+struct __weak_result_type<_Rp (_Cp::*)(_A1)>
+    : public __binary_function<_Cp*, _A1, _Rp>
+{
+};
+
+template <class _Rp, class _Cp, class _A1>
+struct __weak_result_type<_Rp (_Cp::*)(_A1) const>
+    : public __binary_function<const _Cp*, _A1, _Rp>
+{
+};
+
+template <class _Rp, class _Cp, class _A1>
+struct __weak_result_type<_Rp (_Cp::*)(_A1) volatile>
+    : public __binary_function<volatile _Cp*, _A1, _Rp>
+{
+};
+
+template <class _Rp, class _Cp, class _A1>
+struct __weak_result_type<_Rp (_Cp::*)(_A1) const volatile>
+    : public __binary_function<const volatile _Cp*, _A1, _Rp>
+{
+};
+
+// 3 or more arguments
+
+template <class _Rp, class _A1, class _A2, class _A3, class ..._A4>
+struct __weak_result_type<_Rp (_A1, _A2, _A3, _A4...)>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    using result_type _LIBCPP_NODEBUG _LIBCPP_DEPRECATED_IN_CXX17 = _Rp;
+#endif
+};
+
+template <class _Rp, class _A1, class _A2, class _A3, class ..._A4>
+struct __weak_result_type<_Rp (&)(_A1, _A2, _A3, _A4...)>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    using result_type _LIBCPP_NODEBUG _LIBCPP_DEPRECATED_IN_CXX17 = _Rp;
+#endif
+};
+
+template <class _Rp, class _A1, class _A2, class _A3, class ..._A4>
+struct __weak_result_type<_Rp (*)(_A1, _A2, _A3, _A4...)>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    using result_type _LIBCPP_NODEBUG _LIBCPP_DEPRECATED_IN_CXX17 = _Rp;
+#endif
+};
+
+template <class _Rp, class _Cp, class _A1, class _A2, class ..._A3>
+struct __weak_result_type<_Rp (_Cp::*)(_A1, _A2, _A3...)>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    using result_type _LIBCPP_NODEBUG _LIBCPP_DEPRECATED_IN_CXX17 = _Rp;
+#endif
+};
+
+template <class _Rp, class _Cp, class _A1, class _A2, class ..._A3>
+struct __weak_result_type<_Rp (_Cp::*)(_A1, _A2, _A3...) const>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    using result_type _LIBCPP_NODEBUG _LIBCPP_DEPRECATED_IN_CXX17 = _Rp;
+#endif
+};
+
+template <class _Rp, class _Cp, class _A1, class _A2, class ..._A3>
+struct __weak_result_type<_Rp (_Cp::*)(_A1, _A2, _A3...) volatile>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    using result_type _LIBCPP_NODEBUG _LIBCPP_DEPRECATED_IN_CXX17 = _Rp;
+#endif
+};
+
+template <class _Rp, class _Cp, class _A1, class _A2, class ..._A3>
+struct __weak_result_type<_Rp (_Cp::*)(_A1, _A2, _A3...) const volatile>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    using result_type _LIBCPP_NODEBUG _LIBCPP_DEPRECATED_IN_CXX17 = _Rp;
+#endif
+};
+
+template <class _Tp, class ..._Args>
+struct __invoke_return
+{
+    typedef decltype(_VSTD::__invoke(std::declval<_Tp>(), std::declval<_Args>()...)) type;
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_WEAK_RESULT_TYPE_H
diff --git a/app/src/main/cpp/libcxx/include/__fwd/array.h b/app/src/main/cpp/libcxx/include/__fwd/array.h
new file mode 100644
index 0000000..9a79eff
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__fwd/array.h
@@ -0,0 +1,26 @@
+//===---------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===---------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FWD_ARRAY_H
+#define _LIBCPP___FWD_ARRAY_H
+
+#include <__config>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, size_t _Size>
+struct _LIBCPP_TEMPLATE_VIS array;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FWD_ARRAY_H
diff --git a/app/src/main/cpp/libcxx/include/__fwd/get.h b/app/src/main/cpp/libcxx/include/__fwd/get.h
new file mode 100644
index 0000000..ec1fab4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__fwd/get.h
@@ -0,0 +1,115 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FWD_GET_H
+#define _LIBCPP___FWD_GET_H
+
+#include <__concepts/copyable.h>
+#include <__config>
+#include <__fwd/array.h>
+#include <__fwd/pair.h>
+#include <__fwd/subrange.h>
+#include <__fwd/tuple.h>
+#include <__tuple_dir/tuple_element.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <size_t _Ip, class ..._Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+typename tuple_element<_Ip, tuple<_Tp...> >::type&
+get(tuple<_Tp...>&) _NOEXCEPT;
+
+template <size_t _Ip, class ..._Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const typename tuple_element<_Ip, tuple<_Tp...> >::type&
+get(const tuple<_Tp...>&) _NOEXCEPT;
+
+template <size_t _Ip, class ..._Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+typename tuple_element<_Ip, tuple<_Tp...> >::type&&
+get(tuple<_Tp...>&&) _NOEXCEPT;
+
+template <size_t _Ip, class ..._Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const typename tuple_element<_Ip, tuple<_Tp...> >::type&&
+get(const tuple<_Tp...>&&) _NOEXCEPT;
+
+#endif //_LIBCPP_CXX03_LANG
+
+template <size_t _Ip, class _T1, class _T2>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+typename tuple_element<_Ip, pair<_T1, _T2> >::type&
+get(pair<_T1, _T2>&) _NOEXCEPT;
+
+template <size_t _Ip, class _T1, class _T2>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const typename tuple_element<_Ip, pair<_T1, _T2> >::type&
+get(const pair<_T1, _T2>&) _NOEXCEPT;
+
+#ifndef _LIBCPP_CXX03_LANG
+template <size_t _Ip, class _T1, class _T2>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+typename tuple_element<_Ip, pair<_T1, _T2> >::type&&
+get(pair<_T1, _T2>&&) _NOEXCEPT;
+
+template <size_t _Ip, class _T1, class _T2>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const typename tuple_element<_Ip, pair<_T1, _T2> >::type&&
+get(const pair<_T1, _T2>&&) _NOEXCEPT;
+#endif
+
+template <size_t _Ip, class _Tp, size_t _Size>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp&
+get(array<_Tp, _Size>&) _NOEXCEPT;
+
+template <size_t _Ip, class _Tp, size_t _Size>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const _Tp&
+get(const array<_Tp, _Size>&) _NOEXCEPT;
+
+#ifndef _LIBCPP_CXX03_LANG
+template <size_t _Ip, class _Tp, size_t _Size>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp&&
+get(array<_Tp, _Size>&&) _NOEXCEPT;
+
+template <size_t _Ip, class _Tp, size_t _Size>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const _Tp&&
+get(const array<_Tp, _Size>&&) _NOEXCEPT;
+#endif
+
+#if _LIBCPP_STD_VER >= 20
+
+namespace ranges {
+
+template <size_t _Index, class _Iter, class _Sent, subrange_kind _Kind>
+  requires((_Index == 0 && copyable<_Iter>) || _Index == 1)
+_LIBCPP_HIDE_FROM_ABI constexpr auto get(const subrange<_Iter, _Sent, _Kind>& __subrange);
+
+template <size_t _Index, class _Iter, class _Sent, subrange_kind _Kind>
+  requires(_Index < 2)
+_LIBCPP_HIDE_FROM_ABI constexpr auto get(subrange<_Iter, _Sent, _Kind>&& __subrange);
+
+} // namespace ranges
+
+using ranges::get;
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FWD_GET_H
diff --git a/app/src/main/cpp/libcxx/include/__fwd/hash.h b/app/src/main/cpp/libcxx/include/__fwd/hash.h
new file mode 100644
index 0000000..af9eca8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__fwd/hash.h
@@ -0,0 +1,25 @@
+//===---------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===---------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FWD_HASH_H
+#define _LIBCPP___FWD_HASH_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class>
+struct _LIBCPP_TEMPLATE_VIS hash;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FWD_HASH_H
diff --git a/app/src/main/cpp/libcxx/include/__fwd/memory_resource.h b/app/src/main/cpp/libcxx/include/__fwd/memory_resource.h
new file mode 100644
index 0000000..718a907
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__fwd/memory_resource.h
@@ -0,0 +1,27 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FWD_MEMORY_RESOURCE_H
+#define _LIBCPP___FWD_MEMORY_RESOURCE_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace pmr {
+template <class _ValueType>
+class _LIBCPP_TEMPLATE_VIS polymorphic_allocator;
+} // namespace pmr
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FWD_MEMORY_RESOURCE_H
diff --git a/app/src/main/cpp/libcxx/include/__fwd/pair.h b/app/src/main/cpp/libcxx/include/__fwd/pair.h
new file mode 100644
index 0000000..3844014
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__fwd/pair.h
@@ -0,0 +1,25 @@
+//===---------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===---------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FWD_PAIR_H
+#define _LIBCPP___FWD_PAIR_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class, class>
+struct _LIBCPP_TEMPLATE_VIS pair;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FWD_PAIR_H
diff --git a/app/src/main/cpp/libcxx/include/__fwd/span.h b/app/src/main/cpp/libcxx/include/__fwd/span.h
new file mode 100644
index 0000000..943cb13
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__fwd/span.h
@@ -0,0 +1,37 @@
+// -*- C++ -*-
+//===---------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===---------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FWD_SPAN_H
+#define _LIBCPP___FWD_SPAN_H
+
+#include <__config>
+#include <cstddef>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+inline constexpr size_t dynamic_extent = numeric_limits<size_t>::max();
+template <typename _Tp, size_t _Extent = dynamic_extent> class span;
+
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___FWD_SPAN_H
diff --git a/app/src/main/cpp/libcxx/include/__fwd/string.h b/app/src/main/cpp/libcxx/include/__fwd/string.h
new file mode 100644
index 0000000..7ab5561
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__fwd/string.h
@@ -0,0 +1,110 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FWD_STRING_H
+#define _LIBCPP___FWD_STRING_H
+
+#include <__config>
+#include <__fwd/memory_resource.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _CharT>
+struct _LIBCPP_TEMPLATE_VIS char_traits;
+template <>
+struct char_traits<char>;
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+template <>
+struct char_traits<char8_t>;
+#endif
+
+template <>
+struct char_traits<char16_t>;
+template <>
+struct char_traits<char32_t>;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+struct char_traits<wchar_t>;
+#endif
+
+template <class _Tp>
+class _LIBCPP_TEMPLATE_VIS allocator;
+
+template <class _CharT, class _Traits = char_traits<_CharT>, class _Allocator = allocator<_CharT> >
+class _LIBCPP_TEMPLATE_VIS basic_string;
+
+using string = basic_string<char>;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+using wstring = basic_string<wchar_t>;
+#endif
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+using u8string = basic_string<char8_t>;
+#endif
+
+using u16string = basic_string<char16_t>;
+using u32string = basic_string<char32_t>;
+
+#if _LIBCPP_STD_VER >= 17
+
+namespace pmr {
+template <class _CharT, class _Traits = char_traits<_CharT>>
+using basic_string = std::basic_string<_CharT, _Traits, polymorphic_allocator<_CharT>>;
+
+using string = basic_string<char>;
+
+#  ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+using wstring = basic_string<wchar_t>;
+#  endif
+
+#  ifndef _LIBCPP_HAS_NO_CHAR8_T
+using u8string = basic_string<char8_t>;
+#  endif
+
+using u16string = basic_string<char16_t>;
+using u32string = basic_string<char32_t>;
+
+} // namespace pmr
+
+#endif // _LIBCPP_STD_VER >= 17
+
+// clang-format off
+template <class _CharT, class _Traits, class _Allocator>
+class _LIBCPP_PREFERRED_NAME(string)
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+      _LIBCPP_PREFERRED_NAME(wstring)
+#endif
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+      _LIBCPP_PREFERRED_NAME(u8string)
+#endif
+      _LIBCPP_PREFERRED_NAME(u16string)
+      _LIBCPP_PREFERRED_NAME(u32string)
+#if _LIBCPP_STD_VER >= 17
+      _LIBCPP_PREFERRED_NAME(pmr::string)
+#  ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+      _LIBCPP_PREFERRED_NAME(pmr::wstring)
+#  endif
+#  ifndef _LIBCPP_HAS_NO_CHAR8_T
+      _LIBCPP_PREFERRED_NAME(pmr::u8string)
+#  endif
+      _LIBCPP_PREFERRED_NAME(pmr::u16string)
+      _LIBCPP_PREFERRED_NAME(pmr::u32string)
+#endif
+      basic_string;
+// clang-format on
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FWD_STRING_H
diff --git a/app/src/main/cpp/libcxx/include/__fwd/string_view.h b/app/src/main/cpp/libcxx/include/__fwd/string_view.h
new file mode 100644
index 0000000..4818990
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__fwd/string_view.h
@@ -0,0 +1,50 @@
+// -*- C++ -*-
+//===---------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===---------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FWD_STRING_VIEW_H
+#define _LIBCPP___FWD_STRING_VIEW_H
+
+#include <__config>
+#include <iosfwd> // char_traits
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _CharT, class _Traits = char_traits<_CharT> >
+class _LIBCPP_TEMPLATE_VIS basic_string_view;
+
+typedef basic_string_view<char>     string_view;
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+typedef basic_string_view<char8_t>  u8string_view;
+#endif
+typedef basic_string_view<char16_t> u16string_view;
+typedef basic_string_view<char32_t> u32string_view;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+typedef basic_string_view<wchar_t>  wstring_view;
+#endif
+
+// clang-format off
+template <class _CharT, class _Traits>
+class _LIBCPP_PREFERRED_NAME(string_view)
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+      _LIBCPP_PREFERRED_NAME(wstring_view)
+#endif
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+      _LIBCPP_PREFERRED_NAME(u8string_view)
+#endif
+      _LIBCPP_PREFERRED_NAME(u16string_view)
+      _LIBCPP_PREFERRED_NAME(u32string_view)
+      basic_string_view;
+// clang-format on
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FWD_STRING_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__fwd/subrange.h b/app/src/main/cpp/libcxx/include/__fwd/subrange.h
new file mode 100644
index 0000000..8f72392
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__fwd/subrange.h
@@ -0,0 +1,38 @@
+//===---------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===---------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FWD_SUBRANGE_H
+#define _LIBCPP___FWD_SUBRANGE_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER >= 20
+
+#include <__iterator/concepts.h>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+enum class _LIBCPP_ENUM_VIS subrange_kind : bool { unsized, sized };
+
+template <input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent, subrange_kind _Kind>
+  requires(_Kind == subrange_kind::sized || !sized_sentinel_for<_Sent, _Iter>)
+class _LIBCPP_TEMPLATE_VIS subrange;
+
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 20
+
+#endif // _LIBCPP___FWD_SUBRANGE_H
diff --git a/app/src/main/cpp/libcxx/include/__fwd/tuple.h b/app/src/main/cpp/libcxx/include/__fwd/tuple.h
new file mode 100644
index 0000000..16b3fab
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__fwd/tuple.h
@@ -0,0 +1,29 @@
+//===---------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===---------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FWD_TUPLE_H
+#define _LIBCPP___FWD_TUPLE_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class...>
+class _LIBCPP_TEMPLATE_VIS tuple;
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FWD_TUPLE_H
diff --git a/app/src/main/cpp/libcxx/include/__hash_table b/app/src/main/cpp/libcxx/include/__hash_table
new file mode 100644
index 0000000..f8896c8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__hash_table
@@ -0,0 +1,2715 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___HASH_TABLE
+#define _LIBCPP___HASH_TABLE
+
+#include <__algorithm/max.h>
+#include <__algorithm/min.h>
+#include <__assert>
+#include <__bit/countl.h>
+#include <__config>
+#include <__debug>
+#include <__functional/hash.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__memory/allocator_traits.h>
+#include <__memory/compressed_pair.h>
+#include <__memory/pointer_traits.h>
+#include <__memory/swap_allocator.h>
+#include <__memory/unique_ptr.h>
+#include <__type_traits/can_extract_key.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <__utility/swap.h>
+#include <cmath>
+#include <cstring>
+#include <initializer_list>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Key, class _Tp>
+struct __hash_value_type;
+
+template <class _Tp>
+struct __is_hash_value_type_imp : false_type {};
+
+template <class _Key, class _Value>
+struct __is_hash_value_type_imp<__hash_value_type<_Key, _Value> > : true_type {};
+
+template <class ..._Args>
+struct __is_hash_value_type : false_type {};
+
+template <class _One>
+struct __is_hash_value_type<_One> : __is_hash_value_type_imp<__remove_cvref_t<_One> > {};
+
+_LIBCPP_FUNC_VIS
+size_t __next_prime(size_t __n);
+
+template <class _NodePtr>
+struct __hash_node_base
+{
+    typedef typename pointer_traits<_NodePtr>::element_type __node_type;
+    typedef __hash_node_base __first_node;
+    typedef __rebind_pointer_t<_NodePtr, __first_node> __node_base_pointer;
+    typedef _NodePtr __node_pointer;
+
+#if defined(_LIBCPP_ABI_FIX_UNORDERED_NODE_POINTER_UB)
+  typedef __node_base_pointer __next_pointer;
+#else
+    typedef __conditional_t<is_pointer<__node_pointer>::value, __node_base_pointer, __node_pointer> __next_pointer;
+#endif
+
+    __next_pointer    __next_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __next_pointer __ptr() _NOEXCEPT {
+        return static_cast<__next_pointer>(
+            pointer_traits<__node_base_pointer>::pointer_to(*this));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __node_pointer __upcast() _NOEXCEPT {
+        return static_cast<__node_pointer>(
+            pointer_traits<__node_base_pointer>::pointer_to(*this));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t __hash() const _NOEXCEPT {
+        return static_cast<__node_type const&>(*this).__hash_;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY __hash_node_base() _NOEXCEPT : __next_(nullptr) {}
+};
+
+template <class _Tp, class _VoidPtr>
+struct _LIBCPP_STANDALONE_DEBUG __hash_node
+    : public __hash_node_base
+             <
+                 __rebind_pointer_t<_VoidPtr, __hash_node<_Tp, _VoidPtr> >
+             >
+{
+    typedef _Tp __node_value_type;
+
+    size_t            __hash_;
+    __node_value_type __value_;
+};
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+__is_hash_power2(size_t __bc)
+{
+    return __bc > 2 && !(__bc & (__bc - 1));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+size_t
+__constrain_hash(size_t __h, size_t __bc)
+{
+    return !(__bc & (__bc - 1)) ? __h & (__bc - 1) :
+        (__h < __bc ? __h : __h % __bc);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+size_t
+__next_hash_pow2(size_t __n)
+{
+    return __n < 2 ? __n : (size_t(1) << (numeric_limits<size_t>::digits - __libcpp_clz(__n-1)));
+}
+
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc> class __hash_table;
+
+template <class _NodePtr>      class _LIBCPP_TEMPLATE_VIS __hash_iterator;
+template <class _ConstNodePtr> class _LIBCPP_TEMPLATE_VIS __hash_const_iterator;
+template <class _NodePtr>      class _LIBCPP_TEMPLATE_VIS __hash_local_iterator;
+template <class _ConstNodePtr> class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator;
+template <class _HashIterator> class _LIBCPP_TEMPLATE_VIS __hash_map_iterator;
+template <class _HashIterator> class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator;
+
+template <class _Tp>
+struct __hash_key_value_types {
+  static_assert(!is_reference<_Tp>::value && !is_const<_Tp>::value, "");
+  typedef _Tp key_type;
+  typedef _Tp __node_value_type;
+  typedef _Tp __container_value_type;
+  static const bool __is_map = false;
+
+  _LIBCPP_INLINE_VISIBILITY
+  static key_type const& __get_key(_Tp const& __v) {
+    return __v;
+  }
+  _LIBCPP_INLINE_VISIBILITY
+  static __container_value_type const& __get_value(__node_value_type const& __v) {
+    return __v;
+  }
+  _LIBCPP_INLINE_VISIBILITY
+  static __container_value_type* __get_ptr(__node_value_type& __n) {
+    return _VSTD::addressof(__n);
+  }
+  _LIBCPP_INLINE_VISIBILITY
+  static __container_value_type&& __move(__node_value_type& __v) {
+    return _VSTD::move(__v);
+  }
+};
+
+template <class _Key, class _Tp>
+struct __hash_key_value_types<__hash_value_type<_Key, _Tp> > {
+  typedef _Key                                         key_type;
+  typedef _Tp                                          mapped_type;
+  typedef __hash_value_type<_Key, _Tp>                 __node_value_type;
+  typedef pair<const _Key, _Tp>                        __container_value_type;
+  typedef __container_value_type                       __map_value_type;
+  static const bool __is_map = true;
+
+  _LIBCPP_INLINE_VISIBILITY
+  static key_type const& __get_key(__container_value_type const& __v) {
+    return __v.first;
+  }
+
+  template <class _Up>
+  _LIBCPP_INLINE_VISIBILITY
+  static __enable_if_t<__is_same_uncvref<_Up, __node_value_type>::value, __container_value_type const&>
+  __get_value(_Up& __t) {
+    return __t.__get_value();
+  }
+
+  template <class _Up>
+  _LIBCPP_INLINE_VISIBILITY
+  static __enable_if_t<__is_same_uncvref<_Up, __container_value_type>::value, __container_value_type const&>
+  __get_value(_Up& __t) {
+    return __t;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  static __container_value_type* __get_ptr(__node_value_type& __n) {
+    return _VSTD::addressof(__n.__get_value());
+  }
+  _LIBCPP_INLINE_VISIBILITY
+  static pair<key_type&&, mapped_type&&> __move(__node_value_type& __v) {
+    return __v.__move();
+  }
+};
+
+template <class _Tp, class _AllocPtr, class _KVTypes = __hash_key_value_types<_Tp>,
+          bool = _KVTypes::__is_map>
+struct __hash_map_pointer_types {};
+
+template <class _Tp, class _AllocPtr, class _KVTypes>
+struct __hash_map_pointer_types<_Tp, _AllocPtr, _KVTypes, true> {
+  typedef typename _KVTypes::__map_value_type   _Mv;
+  typedef __rebind_pointer_t<_AllocPtr, _Mv>
+                                                       __map_value_type_pointer;
+  typedef __rebind_pointer_t<_AllocPtr, const _Mv>
+                                                 __const_map_value_type_pointer;
+};
+
+template <class _NodePtr, class _NodeT = typename pointer_traits<_NodePtr>::element_type>
+struct __hash_node_types;
+
+template <class _NodePtr, class _Tp, class _VoidPtr>
+struct __hash_node_types<_NodePtr, __hash_node<_Tp, _VoidPtr> >
+    : public __hash_key_value_types<_Tp>, __hash_map_pointer_types<_Tp, _VoidPtr>
+
+{
+  typedef __hash_key_value_types<_Tp>           __base;
+
+public:
+  typedef ptrdiff_t difference_type;
+  typedef size_t size_type;
+
+  typedef __rebind_pointer_t<_NodePtr, void>       __void_pointer;
+
+  typedef typename pointer_traits<_NodePtr>::element_type       __node_type;
+  typedef _NodePtr                                              __node_pointer;
+
+  typedef __hash_node_base<__node_pointer>                      __node_base_type;
+  typedef __rebind_pointer_t<_NodePtr, __node_base_type>
+                                                             __node_base_pointer;
+
+  typedef typename __node_base_type::__next_pointer          __next_pointer;
+
+  typedef _Tp                                                 __node_value_type;
+  typedef __rebind_pointer_t<_VoidPtr, __node_value_type>
+                                                      __node_value_type_pointer;
+  typedef __rebind_pointer_t<_VoidPtr, const __node_value_type>
+                                                __const_node_value_type_pointer;
+
+private:
+    static_assert(!is_const<__node_type>::value,
+                "_NodePtr should never be a pointer to const");
+    static_assert((is_same<typename pointer_traits<_VoidPtr>::element_type, void>::value),
+                  "_VoidPtr does not point to unqualified void type");
+    static_assert((is_same<__rebind_pointer_t<_VoidPtr, __node_type>,
+                          _NodePtr>::value), "_VoidPtr does not rebind to _NodePtr.");
+};
+
+template <class _HashIterator>
+struct __hash_node_types_from_iterator;
+template <class _NodePtr>
+struct __hash_node_types_from_iterator<__hash_iterator<_NodePtr> > : __hash_node_types<_NodePtr> {};
+template <class _NodePtr>
+struct __hash_node_types_from_iterator<__hash_const_iterator<_NodePtr> > : __hash_node_types<_NodePtr> {};
+template <class _NodePtr>
+struct __hash_node_types_from_iterator<__hash_local_iterator<_NodePtr> > : __hash_node_types<_NodePtr> {};
+template <class _NodePtr>
+struct __hash_node_types_from_iterator<__hash_const_local_iterator<_NodePtr> > : __hash_node_types<_NodePtr> {};
+
+
+template <class _NodeValueTp, class _VoidPtr>
+struct __make_hash_node_types {
+  typedef __hash_node<_NodeValueTp, _VoidPtr> _NodeTp;
+  typedef __rebind_pointer_t<_VoidPtr, _NodeTp> _NodePtr;
+  typedef __hash_node_types<_NodePtr> type;
+};
+
+template <class _NodePtr>
+class _LIBCPP_TEMPLATE_VIS __hash_iterator
+{
+    typedef __hash_node_types<_NodePtr> _NodeTypes;
+    typedef _NodePtr                            __node_pointer;
+    typedef typename _NodeTypes::__next_pointer __next_pointer;
+
+    __next_pointer            __node_;
+
+public:
+    typedef forward_iterator_tag                           iterator_category;
+    typedef typename _NodeTypes::__node_value_type         value_type;
+    typedef typename _NodeTypes::difference_type           difference_type;
+    typedef value_type&                                    reference;
+    typedef typename _NodeTypes::__node_value_type_pointer pointer;
+
+    _LIBCPP_INLINE_VISIBILITY __hash_iterator() _NOEXCEPT : __node_(nullptr) {
+        _VSTD::__debug_db_insert_i(this);
+    }
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_iterator(const __hash_iterator& __i)
+        : __node_(__i.__node_)
+    {
+        __get_db()->__iterator_copy(this, _VSTD::addressof(__i));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~__hash_iterator()
+    {
+        __get_db()->__erase_i(this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_iterator& operator=(const __hash_iterator& __i)
+    {
+        if (this != _VSTD::addressof(__i))
+        {
+            __get_db()->__iterator_copy(this, _VSTD::addressof(__i));
+            __node_ = __i.__node_;
+        }
+        return *this;
+    }
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                             "Attempted to dereference a non-dereferenceable unordered container iterator");
+        return __node_->__upcast()->__value_;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                           "Attempted to dereference a non-dereferenceable unordered container iterator");
+        return pointer_traits<pointer>::pointer_to(__node_->__upcast()->__value_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_iterator& operator++() {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                       "Attempted to increment a non-incrementable unordered container iterator");
+        __node_ = __node_->__next_;
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_iterator operator++(int)
+    {
+        __hash_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const __hash_iterator& __x, const __hash_iterator& __y)
+    {
+        return __x.__node_ == __y.__node_;
+    }
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const __hash_iterator& __x, const __hash_iterator& __y)
+        {return !(__x == __y);}
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __hash_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
+        : __node_(__node)
+        {
+            (void)__c;
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+            __get_db()->__insert_ic(this, __c);
+#endif
+        }
+    template <class, class, class, class> friend class __hash_table;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_const_iterator;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_map_iterator;
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_map;
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_multimap;
+};
+
+template <class _NodePtr>
+class _LIBCPP_TEMPLATE_VIS __hash_const_iterator
+{
+    static_assert(!is_const<typename pointer_traits<_NodePtr>::element_type>::value, "");
+    typedef __hash_node_types<_NodePtr> _NodeTypes;
+    typedef _NodePtr                            __node_pointer;
+    typedef typename _NodeTypes::__next_pointer __next_pointer;
+
+    __next_pointer __node_;
+
+public:
+    typedef __hash_iterator<_NodePtr> __non_const_iterator;
+
+    typedef forward_iterator_tag                                 iterator_category;
+    typedef typename _NodeTypes::__node_value_type               value_type;
+    typedef typename _NodeTypes::difference_type                 difference_type;
+    typedef const value_type&                                    reference;
+    typedef typename _NodeTypes::__const_node_value_type_pointer pointer;
+
+
+    _LIBCPP_INLINE_VISIBILITY __hash_const_iterator() _NOEXCEPT : __node_(nullptr) {
+        _VSTD::__debug_db_insert_i(this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_const_iterator(const __non_const_iterator& __x) _NOEXCEPT
+        : __node_(__x.__node_)
+    {
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+        __get_db()->__iterator_copy(this, _VSTD::addressof(__x));
+#endif
+    }
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_const_iterator(const __hash_const_iterator& __i)
+        : __node_(__i.__node_)
+    {
+        __get_db()->__iterator_copy(this, _VSTD::addressof(__i));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~__hash_const_iterator()
+    {
+        __get_db()->__erase_i(this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_const_iterator& operator=(const __hash_const_iterator& __i)
+    {
+        if (this != _VSTD::addressof(__i))
+        {
+            __get_db()->__iterator_copy(this, _VSTD::addressof(__i));
+            __node_ = __i.__node_;
+        }
+        return *this;
+    }
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                           "Attempted to dereference a non-dereferenceable unordered container const_iterator");
+        return __node_->__upcast()->__value_;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                           "Attempted to dereference a non-dereferenceable unordered container const_iterator");
+        return pointer_traits<pointer>::pointer_to(__node_->__upcast()->__value_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_const_iterator& operator++() {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                             "Attempted to increment a non-incrementable unordered container const_iterator");
+        __node_ = __node_->__next_;
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_const_iterator operator++(int)
+    {
+        __hash_const_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const __hash_const_iterator& __x, const __hash_const_iterator& __y)
+    {
+        return __x.__node_ == __y.__node_;
+    }
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const __hash_const_iterator& __x, const __hash_const_iterator& __y)
+        {return !(__x == __y);}
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __hash_const_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
+        : __node_(__node)
+        {
+            (void)__c;
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+            __get_db()->__insert_ic(this, __c);
+#endif
+        }
+    template <class, class, class, class> friend class __hash_table;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator;
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_map;
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_multimap;
+};
+
+template <class _NodePtr>
+class _LIBCPP_TEMPLATE_VIS __hash_local_iterator
+{
+    typedef __hash_node_types<_NodePtr> _NodeTypes;
+    typedef _NodePtr                            __node_pointer;
+    typedef typename _NodeTypes::__next_pointer __next_pointer;
+
+    __next_pointer         __node_;
+    size_t                 __bucket_;
+    size_t                 __bucket_count_;
+
+public:
+    typedef forward_iterator_tag                                iterator_category;
+    typedef typename _NodeTypes::__node_value_type              value_type;
+    typedef typename _NodeTypes::difference_type                difference_type;
+    typedef value_type&                                         reference;
+    typedef typename _NodeTypes::__node_value_type_pointer      pointer;
+
+    _LIBCPP_INLINE_VISIBILITY __hash_local_iterator() _NOEXCEPT : __node_(nullptr) {
+        _VSTD::__debug_db_insert_i(this);
+    }
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_local_iterator(const __hash_local_iterator& __i)
+        : __node_(__i.__node_),
+          __bucket_(__i.__bucket_),
+          __bucket_count_(__i.__bucket_count_)
+    {
+        __get_db()->__iterator_copy(this, _VSTD::addressof(__i));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~__hash_local_iterator()
+    {
+        __get_db()->__erase_i(this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_local_iterator& operator=(const __hash_local_iterator& __i)
+    {
+        if (this != _VSTD::addressof(__i))
+        {
+            __get_db()->__iterator_copy(this, _VSTD::addressof(__i));
+            __node_ = __i.__node_;
+            __bucket_ = __i.__bucket_;
+            __bucket_count_ = __i.__bucket_count_;
+        }
+        return *this;
+    }
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                           "Attempted to dereference a non-dereferenceable unordered container local_iterator");
+        return __node_->__upcast()->__value_;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                             "Attempted to dereference a non-dereferenceable unordered container local_iterator");
+        return pointer_traits<pointer>::pointer_to(__node_->__upcast()->__value_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_local_iterator& operator++() {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                       "Attempted to increment a non-incrementable unordered container local_iterator");
+        __node_ = __node_->__next_;
+        if (__node_ != nullptr && std::__constrain_hash(__node_->__hash(), __bucket_count_) != __bucket_)
+            __node_ = nullptr;
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_local_iterator operator++(int)
+    {
+        __hash_local_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const __hash_local_iterator& __x, const __hash_local_iterator& __y)
+    {
+        return __x.__node_ == __y.__node_;
+    }
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const __hash_local_iterator& __x, const __hash_local_iterator& __y)
+        {return !(__x == __y);}
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __hash_local_iterator(__next_pointer __node, size_t __bucket,
+                                   size_t __bucket_count, const void* __c) _NOEXCEPT
+        : __node_(__node),
+          __bucket_(__bucket),
+          __bucket_count_(__bucket_count)
+        {
+            (void)__c;
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+            __get_db()->__insert_ic(this, __c);
+#endif
+            if (__node_ != nullptr)
+                __node_ = __node_->__next_;
+        }
+    template <class, class, class, class> friend class __hash_table;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_map_iterator;
+};
+
+template <class _ConstNodePtr>
+class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator
+{
+    typedef __hash_node_types<_ConstNodePtr> _NodeTypes;
+    typedef _ConstNodePtr                       __node_pointer;
+    typedef typename _NodeTypes::__next_pointer __next_pointer;
+
+    __next_pointer         __node_;
+    size_t                 __bucket_;
+    size_t                 __bucket_count_;
+
+    typedef pointer_traits<__node_pointer>          __pointer_traits;
+    typedef typename __pointer_traits::element_type __node;
+    typedef __remove_const_t<__node>                  __non_const_node;
+    typedef __rebind_pointer_t<__node_pointer, __non_const_node>
+        __non_const_node_pointer;
+public:
+    typedef __hash_local_iterator<__non_const_node_pointer>
+                                                    __non_const_iterator;
+
+    typedef forward_iterator_tag                                 iterator_category;
+    typedef typename _NodeTypes::__node_value_type               value_type;
+    typedef typename _NodeTypes::difference_type                 difference_type;
+    typedef const value_type&                                    reference;
+    typedef typename _NodeTypes::__const_node_value_type_pointer pointer;
+
+
+    _LIBCPP_INLINE_VISIBILITY __hash_const_local_iterator() _NOEXCEPT : __node_(nullptr) {
+        _VSTD::__debug_db_insert_i(this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_const_local_iterator(const __non_const_iterator& __x) _NOEXCEPT
+        : __node_(__x.__node_),
+          __bucket_(__x.__bucket_),
+          __bucket_count_(__x.__bucket_count_)
+    {
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+        __get_db()->__iterator_copy(this, _VSTD::addressof(__x));
+#endif
+    }
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_const_local_iterator(const __hash_const_local_iterator& __i)
+        : __node_(__i.__node_),
+          __bucket_(__i.__bucket_),
+          __bucket_count_(__i.__bucket_count_)
+    {
+        __get_db()->__iterator_copy(this, _VSTD::addressof(__i));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~__hash_const_local_iterator()
+    {
+        __get_db()->__erase_i(this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_const_local_iterator& operator=(const __hash_const_local_iterator& __i)
+    {
+        if (this != _VSTD::addressof(__i))
+        {
+            __get_db()->__iterator_copy(this, _VSTD::addressof(__i));
+            __node_ = __i.__node_;
+            __bucket_ = __i.__bucket_;
+            __bucket_count_ = __i.__bucket_count_;
+        }
+        return *this;
+    }
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                           "Attempted to dereference a non-dereferenceable unordered container const_local_iterator");
+        return __node_->__upcast()->__value_;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                           "Attempted to dereference a non-dereferenceable unordered container const_local_iterator");
+        return pointer_traits<pointer>::pointer_to(__node_->__upcast()->__value_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_const_local_iterator& operator++() {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                       "Attempted to increment a non-incrementable unordered container const_local_iterator");
+        __node_ = __node_->__next_;
+        if (__node_ != nullptr && std::__constrain_hash(__node_->__hash(), __bucket_count_) != __bucket_)
+            __node_ = nullptr;
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_const_local_iterator operator++(int)
+    {
+        __hash_const_local_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const __hash_const_local_iterator& __x, const __hash_const_local_iterator& __y)
+    {
+        return __x.__node_ == __y.__node_;
+    }
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const __hash_const_local_iterator& __x, const __hash_const_local_iterator& __y)
+        {return !(__x == __y);}
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __hash_const_local_iterator(__next_pointer __node_ptr, size_t __bucket,
+                                         size_t __bucket_count, const void* __c) _NOEXCEPT
+        : __node_(__node_ptr),
+          __bucket_(__bucket),
+          __bucket_count_(__bucket_count)
+        {
+            (void)__c;
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+            __get_db()->__insert_ic(this, __c);
+#endif
+            if (__node_ != nullptr)
+                __node_ = __node_->__next_;
+        }
+    template <class, class, class, class> friend class __hash_table;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator;
+};
+
+template <class _Alloc>
+class __bucket_list_deallocator
+{
+    typedef _Alloc                                          allocator_type;
+    typedef allocator_traits<allocator_type>                __alloc_traits;
+    typedef typename __alloc_traits::size_type              size_type;
+
+    __compressed_pair<size_type, allocator_type> __data_;
+public:
+    typedef typename __alloc_traits::pointer pointer;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __bucket_list_deallocator()
+        _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
+        : __data_(0, __default_init_tag()) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __bucket_list_deallocator(const allocator_type& __a, size_type __size)
+        _NOEXCEPT_(is_nothrow_copy_constructible<allocator_type>::value)
+        : __data_(__size, __a) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __bucket_list_deallocator(__bucket_list_deallocator&& __x)
+        _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value)
+        : __data_(_VSTD::move(__x.__data_))
+    {
+        __x.size() = 0;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type& size() _NOEXCEPT {return __data_.first();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type  size() const _NOEXCEPT {return __data_.first();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type& __alloc() _NOEXCEPT {return __data_.second();}
+    _LIBCPP_INLINE_VISIBILITY
+    const allocator_type& __alloc() const _NOEXCEPT {return __data_.second();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator()(pointer __p) _NOEXCEPT
+    {
+        __alloc_traits::deallocate(__alloc(), __p, size());
+    }
+};
+
+template <class _Alloc> class __hash_map_node_destructor;
+
+template <class _Alloc>
+class __hash_node_destructor
+{
+    typedef _Alloc                                          allocator_type;
+    typedef allocator_traits<allocator_type>                __alloc_traits;
+
+public:
+    typedef typename __alloc_traits::pointer                pointer;
+private:
+    typedef __hash_node_types<pointer> _NodeTypes;
+
+    allocator_type& __na_;
+
+public:
+    bool __value_constructed;
+
+    __hash_node_destructor(__hash_node_destructor const&) = default;
+    __hash_node_destructor& operator=(const __hash_node_destructor&) = delete;
+
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __hash_node_destructor(allocator_type& __na,
+                                    bool __constructed = false) _NOEXCEPT
+        : __na_(__na),
+          __value_constructed(__constructed)
+        {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator()(pointer __p) _NOEXCEPT
+    {
+        if (__value_constructed)
+            __alloc_traits::destroy(__na_, _NodeTypes::__get_ptr(__p->__value_));
+        if (__p)
+            __alloc_traits::deallocate(__na_, __p, 1);
+    }
+
+    template <class> friend class __hash_map_node_destructor;
+};
+
+#if _LIBCPP_STD_VER > 14
+template <class _NodeType, class _Alloc>
+struct __generic_container_node_destructor;
+
+template <class _Tp, class _VoidPtr, class _Alloc>
+struct __generic_container_node_destructor<__hash_node<_Tp, _VoidPtr>, _Alloc>
+    : __hash_node_destructor<_Alloc>
+{
+    using __hash_node_destructor<_Alloc>::__hash_node_destructor;
+};
+#endif
+
+template <class _Key, class _Hash, class _Equal>
+struct __enforce_unordered_container_requirements {
+#ifndef _LIBCPP_CXX03_LANG
+    static_assert(__check_hash_requirements<_Key, _Hash>::value,
+    "the specified hash does not meet the Hash requirements");
+    static_assert(is_copy_constructible<_Equal>::value,
+    "the specified comparator is required to be copy constructible");
+#endif
+    typedef int type;
+};
+
+template <class _Key, class _Hash, class _Equal>
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_DIAGNOSE_WARNING(!__invokable<_Equal const&, _Key const&, _Key const&>::value,
+    "the specified comparator type does not provide a viable const call operator")
+    _LIBCPP_DIAGNOSE_WARNING(!__invokable<_Hash const&, _Key const&>::value,
+    "the specified hash functor does not provide a viable const call operator")
+#endif
+typename __enforce_unordered_container_requirements<_Key, _Hash, _Equal>::type
+__diagnose_unordered_container_requirements(int);
+
+// This dummy overload is used so that the compiler won't emit a spurious
+// "no matching function for call to __diagnose_unordered_xxx" diagnostic
+// when the overload above causes a hard error.
+template <class _Key, class _Hash, class _Equal>
+int __diagnose_unordered_container_requirements(void*);
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+class __hash_table
+{
+public:
+    typedef _Tp    value_type;
+    typedef _Hash  hasher;
+    typedef _Equal key_equal;
+    typedef _Alloc allocator_type;
+
+private:
+    typedef allocator_traits<allocator_type> __alloc_traits;
+    typedef typename
+      __make_hash_node_types<value_type, typename __alloc_traits::void_pointer>::type
+                                                                     _NodeTypes;
+public:
+
+    typedef typename _NodeTypes::__node_value_type           __node_value_type;
+    typedef typename _NodeTypes::__container_value_type      __container_value_type;
+    typedef typename _NodeTypes::key_type                    key_type;
+    typedef value_type&                              reference;
+    typedef const value_type&                        const_reference;
+    typedef typename __alloc_traits::pointer         pointer;
+    typedef typename __alloc_traits::const_pointer   const_pointer;
+#ifndef _LIBCPP_ABI_FIX_UNORDERED_CONTAINER_SIZE_TYPE
+    typedef typename __alloc_traits::size_type       size_type;
+#else
+    typedef typename _NodeTypes::size_type           size_type;
+#endif
+    typedef typename _NodeTypes::difference_type     difference_type;
+public:
+    // Create __node
+
+    typedef typename _NodeTypes::__node_type __node;
+    typedef __rebind_alloc<__alloc_traits, __node>   __node_allocator;
+    typedef allocator_traits<__node_allocator>       __node_traits;
+    typedef typename _NodeTypes::__void_pointer      __void_pointer;
+    typedef typename _NodeTypes::__node_pointer      __node_pointer;
+    typedef typename _NodeTypes::__node_pointer      __node_const_pointer;
+    typedef typename _NodeTypes::__node_base_type    __first_node;
+    typedef typename _NodeTypes::__node_base_pointer __node_base_pointer;
+    typedef typename _NodeTypes::__next_pointer      __next_pointer;
+
+private:
+    // check for sane allocator pointer rebinding semantics. Rebinding the
+    // allocator for a new pointer type should be exactly the same as rebinding
+    // the pointer using 'pointer_traits'.
+    static_assert((is_same<__node_pointer, typename __node_traits::pointer>::value),
+                  "Allocator does not rebind pointers in a sane manner.");
+    typedef __rebind_alloc<__node_traits, __first_node> __node_base_allocator;
+    typedef allocator_traits<__node_base_allocator> __node_base_traits;
+    static_assert((is_same<__node_base_pointer, typename __node_base_traits::pointer>::value),
+                 "Allocator does not rebind pointers in a sane manner.");
+
+private:
+
+    typedef __rebind_alloc<__node_traits, __next_pointer>  __pointer_allocator;
+    typedef __bucket_list_deallocator<__pointer_allocator> __bucket_list_deleter;
+    typedef unique_ptr<__next_pointer[], __bucket_list_deleter> __bucket_list;
+    typedef allocator_traits<__pointer_allocator>          __pointer_alloc_traits;
+    typedef typename __bucket_list_deleter::pointer       __node_pointer_pointer;
+
+    // --- Member data begin ---
+    __bucket_list                                         __bucket_list_;
+    __compressed_pair<__first_node, __node_allocator>     __p1_;
+    __compressed_pair<size_type, hasher>                  __p2_;
+    __compressed_pair<float, key_equal>                   __p3_;
+    // --- Member data end ---
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type& size() _NOEXCEPT {return __p2_.first();}
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    size_type  size() const _NOEXCEPT {return __p2_.first();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    hasher& hash_function() _NOEXCEPT {return __p2_.second();}
+    _LIBCPP_INLINE_VISIBILITY
+    const hasher& hash_function() const _NOEXCEPT {return __p2_.second();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    float& max_load_factor() _NOEXCEPT {return __p3_.first();}
+    _LIBCPP_INLINE_VISIBILITY
+    float  max_load_factor() const _NOEXCEPT {return __p3_.first();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    key_equal& key_eq() _NOEXCEPT {return __p3_.second();}
+    _LIBCPP_INLINE_VISIBILITY
+    const key_equal& key_eq() const _NOEXCEPT {return __p3_.second();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __node_allocator& __node_alloc() _NOEXCEPT {return __p1_.second();}
+    _LIBCPP_INLINE_VISIBILITY
+    const __node_allocator& __node_alloc() const _NOEXCEPT
+        {return __p1_.second();}
+
+public:
+    typedef __hash_iterator<__node_pointer>                   iterator;
+    typedef __hash_const_iterator<__node_pointer>             const_iterator;
+    typedef __hash_local_iterator<__node_pointer>             local_iterator;
+    typedef __hash_const_local_iterator<__node_pointer>       const_local_iterator;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_table()
+        _NOEXCEPT_(
+            is_nothrow_default_constructible<__bucket_list>::value &&
+            is_nothrow_default_constructible<__first_node>::value &&
+            is_nothrow_default_constructible<__node_allocator>::value &&
+            is_nothrow_default_constructible<hasher>::value &&
+            is_nothrow_default_constructible<key_equal>::value);
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_table(const hasher& __hf, const key_equal& __eql);
+    __hash_table(const hasher& __hf, const key_equal& __eql,
+                 const allocator_type& __a);
+    explicit __hash_table(const allocator_type& __a);
+    __hash_table(const __hash_table& __u);
+    __hash_table(const __hash_table& __u, const allocator_type& __a);
+    __hash_table(__hash_table&& __u)
+        _NOEXCEPT_(
+            is_nothrow_move_constructible<__bucket_list>::value &&
+            is_nothrow_move_constructible<__first_node>::value &&
+            is_nothrow_move_constructible<__node_allocator>::value &&
+            is_nothrow_move_constructible<hasher>::value &&
+            is_nothrow_move_constructible<key_equal>::value);
+    __hash_table(__hash_table&& __u, const allocator_type& __a);
+    ~__hash_table();
+
+    __hash_table& operator=(const __hash_table& __u);
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_table& operator=(__hash_table&& __u)
+        _NOEXCEPT_(
+            __node_traits::propagate_on_container_move_assignment::value &&
+            is_nothrow_move_assignable<__node_allocator>::value &&
+            is_nothrow_move_assignable<hasher>::value &&
+            is_nothrow_move_assignable<key_equal>::value);
+    template <class _InputIterator>
+        void __assign_unique(_InputIterator __first, _InputIterator __last);
+    template <class _InputIterator>
+        void __assign_multi(_InputIterator __first, _InputIterator __last);
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT
+    {
+        return _VSTD::min<size_type>(
+            __node_traits::max_size(__node_alloc()),
+            numeric_limits<difference_type >::max()
+        );
+    }
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    __next_pointer __node_insert_multi_prepare(size_t __cp_hash,
+                                               value_type& __cp_val);
+    _LIBCPP_INLINE_VISIBILITY
+    void __node_insert_multi_perform(__node_pointer __cp,
+                                     __next_pointer __pn) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __next_pointer __node_insert_unique_prepare(size_t __nd_hash,
+                                                value_type& __nd_val);
+    _LIBCPP_INLINE_VISIBILITY
+    void __node_insert_unique_perform(__node_pointer __ptr) _NOEXCEPT;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __node_insert_unique(__node_pointer __nd);
+    _LIBCPP_INLINE_VISIBILITY
+    iterator             __node_insert_multi(__node_pointer __nd);
+    _LIBCPP_INLINE_VISIBILITY
+    iterator             __node_insert_multi(const_iterator __p,
+                                             __node_pointer __nd);
+
+    template <class _Key, class ..._Args>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __emplace_unique_key_args(_Key const& __k, _Args&&... __args);
+
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __emplace_unique_impl(_Args&&... __args);
+
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __emplace_unique(_Pp&& __x) {
+      return __emplace_unique_extract_key(_VSTD::forward<_Pp>(__x),
+                                          __can_extract_key<_Pp, key_type>());
+    }
+
+    template <class _First, class _Second>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__can_extract_map_key<_First, key_type, __container_value_type>::value, pair<iterator, bool> >
+    __emplace_unique(_First&& __f, _Second&& __s) {
+        return __emplace_unique_key_args(__f, _VSTD::forward<_First>(__f),
+                                              _VSTD::forward<_Second>(__s));
+    }
+
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __emplace_unique(_Args&&... __args) {
+      return __emplace_unique_impl(_VSTD::forward<_Args>(__args)...);
+    }
+
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool>
+    __emplace_unique_extract_key(_Pp&& __x, __extract_key_fail_tag) {
+      return __emplace_unique_impl(_VSTD::forward<_Pp>(__x));
+    }
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool>
+    __emplace_unique_extract_key(_Pp&& __x, __extract_key_self_tag) {
+      return __emplace_unique_key_args(__x, _VSTD::forward<_Pp>(__x));
+    }
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool>
+    __emplace_unique_extract_key(_Pp&& __x, __extract_key_first_tag) {
+      return __emplace_unique_key_args(__x.first, _VSTD::forward<_Pp>(__x));
+    }
+
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __emplace_multi(_Args&&... __args);
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __emplace_hint_multi(const_iterator __p, _Args&&... __args);
+
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool>
+    __insert_unique(__container_value_type&& __x) {
+      return __emplace_unique_key_args(_NodeTypes::__get_key(__x), _VSTD::move(__x));
+    }
+
+    template <class _Pp, class = __enable_if_t<!__is_same_uncvref<_Pp, __container_value_type>::value> >
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __insert_unique(_Pp&& __x) {
+      return __emplace_unique(_VSTD::forward<_Pp>(__x));
+    }
+
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __insert_multi(_Pp&& __x) {
+      return __emplace_multi(_VSTD::forward<_Pp>(__x));
+    }
+
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __insert_multi(const_iterator __p, _Pp&& __x) {
+        return __emplace_hint_multi(__p, _VSTD::forward<_Pp>(__x));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __insert_unique(const __container_value_type& __x) {
+        return __emplace_unique_key_args(_NodeTypes::__get_key(__x), __x);
+    }
+
+#if _LIBCPP_STD_VER > 14
+    template <class _NodeHandle, class _InsertReturnType>
+    _LIBCPP_INLINE_VISIBILITY
+    _InsertReturnType __node_handle_insert_unique(_NodeHandle&& __nh);
+    template <class _NodeHandle>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __node_handle_insert_unique(const_iterator __hint,
+                                         _NodeHandle&& __nh);
+    template <class _Table>
+    _LIBCPP_INLINE_VISIBILITY
+    void __node_handle_merge_unique(_Table& __source);
+
+    template <class _NodeHandle>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __node_handle_insert_multi(_NodeHandle&& __nh);
+    template <class _NodeHandle>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __node_handle_insert_multi(const_iterator __hint, _NodeHandle&& __nh);
+    template <class _Table>
+    _LIBCPP_INLINE_VISIBILITY
+    void __node_handle_merge_multi(_Table& __source);
+
+    template <class _NodeHandle>
+    _LIBCPP_INLINE_VISIBILITY
+    _NodeHandle __node_handle_extract(key_type const& __key);
+    template <class _NodeHandle>
+    _LIBCPP_INLINE_VISIBILITY
+    _NodeHandle __node_handle_extract(const_iterator __it);
+#endif
+
+    void clear() _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY void __rehash_unique(size_type __n) { __rehash<true>(__n); }
+    _LIBCPP_INLINE_VISIBILITY void __rehash_multi(size_type __n) { __rehash<false>(__n); }
+    _LIBCPP_INLINE_VISIBILITY void __reserve_unique(size_type __n)
+    {
+        __rehash_unique(static_cast<size_type>(std::ceil(__n / max_load_factor())));
+    }
+    _LIBCPP_INLINE_VISIBILITY void __reserve_multi(size_type __n)
+    {
+        __rehash_multi(static_cast<size_type>(std::ceil(__n / max_load_factor())));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_count() const _NOEXCEPT
+    {
+        return __bucket_list_.get_deleter().size();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       begin() _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       end() _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin() const _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end() const _NOEXCEPT;
+
+    template <class _Key>
+        _LIBCPP_INLINE_VISIBILITY
+        size_type bucket(const _Key& __k) const
+        {
+            _LIBCPP_ASSERT(bucket_count() > 0,
+                "unordered container::bucket(key) called when bucket_count() == 0");
+            return std::__constrain_hash(hash_function()(__k), bucket_count());
+        }
+
+    template <class _Key>
+        iterator       find(const _Key& __x);
+    template <class _Key>
+        const_iterator find(const _Key& __x) const;
+
+    typedef __hash_node_destructor<__node_allocator> _Dp;
+    typedef unique_ptr<__node, _Dp> __node_holder;
+
+    iterator erase(const_iterator __p);
+    iterator erase(const_iterator __first, const_iterator __last);
+    template <class _Key>
+        size_type __erase_unique(const _Key& __k);
+    template <class _Key>
+        size_type __erase_multi(const _Key& __k);
+    __node_holder remove(const_iterator __p) _NOEXCEPT;
+
+    template <class _Key>
+        _LIBCPP_INLINE_VISIBILITY
+        size_type __count_unique(const _Key& __k) const;
+    template <class _Key>
+        size_type __count_multi(const _Key& __k) const;
+
+    template <class _Key>
+        pair<iterator, iterator>
+        __equal_range_unique(const _Key& __k);
+    template <class _Key>
+        pair<const_iterator, const_iterator>
+        __equal_range_unique(const _Key& __k) const;
+
+    template <class _Key>
+        pair<iterator, iterator>
+        __equal_range_multi(const _Key& __k);
+    template <class _Key>
+        pair<const_iterator, const_iterator>
+        __equal_range_multi(const _Key& __k) const;
+
+    void swap(__hash_table& __u)
+#if _LIBCPP_STD_VER <= 11
+        _NOEXCEPT_(
+            __is_nothrow_swappable<hasher>::value && __is_nothrow_swappable<key_equal>::value
+            && (!allocator_traits<__pointer_allocator>::propagate_on_container_swap::value
+                  || __is_nothrow_swappable<__pointer_allocator>::value)
+            && (!__node_traits::propagate_on_container_swap::value
+                  || __is_nothrow_swappable<__node_allocator>::value)
+            );
+#else
+     _NOEXCEPT_(__is_nothrow_swappable<hasher>::value && __is_nothrow_swappable<key_equal>::value);
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_bucket_count() const _NOEXCEPT
+        {return max_size(); }
+    size_type bucket_size(size_type __n) const;
+    _LIBCPP_INLINE_VISIBILITY float load_factor() const _NOEXCEPT
+    {
+        size_type __bc = bucket_count();
+        return __bc != 0 ? (float)size() / __bc : 0.f;
+    }
+    _LIBCPP_INLINE_VISIBILITY void max_load_factor(float __mlf) _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__mlf > 0,
+            "unordered container::max_load_factor(lf) called with lf <= 0");
+        max_load_factor() = _VSTD::max(__mlf, load_factor());
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    local_iterator
+    begin(size_type __n)
+    {
+        _LIBCPP_ASSERT(__n < bucket_count(),
+            "unordered container::begin(n) called with n >= bucket_count()");
+        return local_iterator(__bucket_list_[__n], __n, bucket_count(), this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    local_iterator
+    end(size_type __n)
+    {
+        _LIBCPP_ASSERT(__n < bucket_count(),
+            "unordered container::end(n) called with n >= bucket_count()");
+        return local_iterator(nullptr, __n, bucket_count(), this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator
+    cbegin(size_type __n) const
+    {
+        _LIBCPP_ASSERT(__n < bucket_count(),
+            "unordered container::cbegin(n) called with n >= bucket_count()");
+        return const_local_iterator(__bucket_list_[__n], __n, bucket_count(), this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator
+    cend(size_type __n) const
+    {
+        _LIBCPP_ASSERT(__n < bucket_count(),
+            "unordered container::cend(n) called with n >= bucket_count()");
+        return const_local_iterator(nullptr, __n, bucket_count(), this);
+    }
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+    bool __dereferenceable(const const_iterator* __i) const;
+    bool __decrementable(const const_iterator* __i) const;
+    bool __addable(const const_iterator* __i, ptrdiff_t __n) const;
+    bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const;
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+private:
+    template <bool _UniqueKeys> void __rehash(size_type __n);
+    template <bool _UniqueKeys> void __do_rehash(size_type __n);
+
+    template <class ..._Args>
+    __node_holder __construct_node(_Args&& ...__args);
+
+    template <class _First, class ..._Rest>
+    __node_holder __construct_node_hash(size_t __hash, _First&& __f, _Rest&&... __rest);
+
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __copy_assign_alloc(const __hash_table& __u)
+        {__copy_assign_alloc(__u, integral_constant<bool,
+             __node_traits::propagate_on_container_copy_assignment::value>());}
+    void __copy_assign_alloc(const __hash_table& __u, true_type);
+    _LIBCPP_INLINE_VISIBILITY
+        void __copy_assign_alloc(const __hash_table&, false_type) {}
+
+    void __move_assign(__hash_table& __u, false_type);
+    void __move_assign(__hash_table& __u, true_type)
+        _NOEXCEPT_(
+            is_nothrow_move_assignable<__node_allocator>::value &&
+            is_nothrow_move_assignable<hasher>::value &&
+            is_nothrow_move_assignable<key_equal>::value);
+    _LIBCPP_INLINE_VISIBILITY
+    void __move_assign_alloc(__hash_table& __u)
+        _NOEXCEPT_(
+            !__node_traits::propagate_on_container_move_assignment::value ||
+            (is_nothrow_move_assignable<__pointer_allocator>::value &&
+             is_nothrow_move_assignable<__node_allocator>::value))
+        {__move_assign_alloc(__u, integral_constant<bool,
+             __node_traits::propagate_on_container_move_assignment::value>());}
+    _LIBCPP_INLINE_VISIBILITY
+    void __move_assign_alloc(__hash_table& __u, true_type)
+        _NOEXCEPT_(
+            is_nothrow_move_assignable<__pointer_allocator>::value &&
+            is_nothrow_move_assignable<__node_allocator>::value)
+    {
+        __bucket_list_.get_deleter().__alloc() =
+                _VSTD::move(__u.__bucket_list_.get_deleter().__alloc());
+        __node_alloc() = _VSTD::move(__u.__node_alloc());
+    }
+    _LIBCPP_INLINE_VISIBILITY
+        void __move_assign_alloc(__hash_table&, false_type) _NOEXCEPT {}
+
+    void __deallocate_node(__next_pointer __np) _NOEXCEPT;
+    __next_pointer __detach() _NOEXCEPT;
+
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_map;
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_multimap;
+};
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+inline
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table()
+    _NOEXCEPT_(
+        is_nothrow_default_constructible<__bucket_list>::value &&
+        is_nothrow_default_constructible<__first_node>::value &&
+        is_nothrow_default_constructible<__node_allocator>::value &&
+        is_nothrow_default_constructible<hasher>::value &&
+        is_nothrow_default_constructible<key_equal>::value)
+    : __p2_(0, __default_init_tag()),
+      __p3_(1.0f, __default_init_tag())
+{
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+inline
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const hasher& __hf,
+                                                       const key_equal& __eql)
+    : __bucket_list_(nullptr, __bucket_list_deleter()),
+      __p1_(),
+      __p2_(0, __hf),
+      __p3_(1.0f, __eql)
+{
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const hasher& __hf,
+                                                       const key_equal& __eql,
+                                                       const allocator_type& __a)
+    : __bucket_list_(nullptr, __bucket_list_deleter(__pointer_allocator(__a), 0)),
+      __p1_(__default_init_tag(), __node_allocator(__a)),
+      __p2_(0, __hf),
+      __p3_(1.0f, __eql)
+{
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const allocator_type& __a)
+    : __bucket_list_(nullptr, __bucket_list_deleter(__pointer_allocator(__a), 0)),
+      __p1_(__default_init_tag(), __node_allocator(__a)),
+      __p2_(0, __default_init_tag()),
+      __p3_(1.0f, __default_init_tag())
+{
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const __hash_table& __u)
+    : __bucket_list_(nullptr,
+          __bucket_list_deleter(allocator_traits<__pointer_allocator>::
+              select_on_container_copy_construction(
+                  __u.__bucket_list_.get_deleter().__alloc()), 0)),
+      __p1_(__default_init_tag(), allocator_traits<__node_allocator>::
+          select_on_container_copy_construction(__u.__node_alloc())),
+      __p2_(0, __u.hash_function()),
+      __p3_(__u.__p3_)
+{
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(const __hash_table& __u,
+                                                       const allocator_type& __a)
+    : __bucket_list_(nullptr, __bucket_list_deleter(__pointer_allocator(__a), 0)),
+      __p1_(__default_init_tag(), __node_allocator(__a)),
+      __p2_(0, __u.hash_function()),
+      __p3_(__u.__p3_)
+{
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(__hash_table&& __u)
+        _NOEXCEPT_(
+            is_nothrow_move_constructible<__bucket_list>::value &&
+            is_nothrow_move_constructible<__first_node>::value &&
+            is_nothrow_move_constructible<__node_allocator>::value &&
+            is_nothrow_move_constructible<hasher>::value &&
+            is_nothrow_move_constructible<key_equal>::value)
+    : __bucket_list_(_VSTD::move(__u.__bucket_list_)),
+      __p1_(_VSTD::move(__u.__p1_)),
+      __p2_(_VSTD::move(__u.__p2_)),
+      __p3_(_VSTD::move(__u.__p3_))
+{
+    if (size() > 0)
+    {
+        __bucket_list_[std::__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] =
+            __p1_.first().__ptr();
+        __u.__p1_.first().__next_ = nullptr;
+        __u.size() = 0;
+    }
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table(__hash_table&& __u,
+                                                       const allocator_type& __a)
+    : __bucket_list_(nullptr, __bucket_list_deleter(__pointer_allocator(__a), 0)),
+      __p1_(__default_init_tag(), __node_allocator(__a)),
+      __p2_(0, _VSTD::move(__u.hash_function())),
+      __p3_(_VSTD::move(__u.__p3_))
+{
+    if (__a == allocator_type(__u.__node_alloc()))
+    {
+        __bucket_list_.reset(__u.__bucket_list_.release());
+        __bucket_list_.get_deleter().size() = __u.__bucket_list_.get_deleter().size();
+        __u.__bucket_list_.get_deleter().size() = 0;
+        if (__u.size() > 0)
+        {
+            __p1_.first().__next_ = __u.__p1_.first().__next_;
+            __u.__p1_.first().__next_ = nullptr;
+            __bucket_list_[std::__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] =
+                __p1_.first().__ptr();
+            size() = __u.size();
+            __u.size() = 0;
+        }
+    }
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::~__hash_table()
+{
+#if defined(_LIBCPP_CXX03_LANG)
+    static_assert((is_copy_constructible<key_equal>::value),
+                 "Predicate must be copy-constructible.");
+    static_assert((is_copy_constructible<hasher>::value),
+                 "Hasher must be copy-constructible.");
+#endif
+
+    __deallocate_node(__p1_.first().__next_);
+    std::__debug_db_erase_c(this);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__copy_assign_alloc(
+        const __hash_table& __u, true_type)
+{
+    if (__node_alloc() != __u.__node_alloc())
+    {
+        clear();
+        __bucket_list_.reset();
+        __bucket_list_.get_deleter().size() = 0;
+    }
+    __bucket_list_.get_deleter().__alloc() = __u.__bucket_list_.get_deleter().__alloc();
+    __node_alloc() = __u.__node_alloc();
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>&
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::operator=(const __hash_table& __u)
+{
+    if (this != _VSTD::addressof(__u))
+    {
+        __copy_assign_alloc(__u);
+        hash_function() = __u.hash_function();
+        key_eq() = __u.key_eq();
+        max_load_factor() = __u.max_load_factor();
+        __assign_multi(__u.begin(), __u.end());
+    }
+    return *this;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__deallocate_node(__next_pointer __np)
+    _NOEXCEPT
+{
+    __node_allocator& __na = __node_alloc();
+    while (__np != nullptr)
+    {
+        __next_pointer __next = __np->__next_;
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+        __c_node* __c = __get_db()->__find_c_and_lock(this);
+        for (__i_node** __p = __c->end_; __p != __c->beg_; )
+        {
+            --__p;
+            iterator* __i = static_cast<iterator*>((*__p)->__i_);
+            if (__i->__node_ == __np)
+            {
+                (*__p)->__c_ = nullptr;
+                if (--__c->end_ != __p)
+                    _VSTD::memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
+            }
+        }
+        __get_db()->unlock();
+#endif
+        __node_pointer __real_np = __np->__upcast();
+        __node_traits::destroy(__na, _NodeTypes::__get_ptr(__real_np->__value_));
+        __node_traits::deallocate(__na, __real_np, 1);
+        __np = __next;
+    }
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__next_pointer
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__detach() _NOEXCEPT
+{
+    size_type __bc = bucket_count();
+    for (size_type __i = 0; __i < __bc; ++__i)
+        __bucket_list_[__i] = nullptr;
+    size() = 0;
+    __next_pointer __cache = __p1_.first().__next_;
+    __p1_.first().__next_ = nullptr;
+    return __cache;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__move_assign(
+        __hash_table& __u, true_type)
+    _NOEXCEPT_(
+        is_nothrow_move_assignable<__node_allocator>::value &&
+        is_nothrow_move_assignable<hasher>::value &&
+        is_nothrow_move_assignable<key_equal>::value)
+{
+    clear();
+    __bucket_list_.reset(__u.__bucket_list_.release());
+    __bucket_list_.get_deleter().size() = __u.__bucket_list_.get_deleter().size();
+    __u.__bucket_list_.get_deleter().size() = 0;
+    __move_assign_alloc(__u);
+    size() = __u.size();
+    hash_function() = _VSTD::move(__u.hash_function());
+    max_load_factor() = __u.max_load_factor();
+    key_eq() = _VSTD::move(__u.key_eq());
+    __p1_.first().__next_ = __u.__p1_.first().__next_;
+    if (size() > 0)
+    {
+        __bucket_list_[std::__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] =
+            __p1_.first().__ptr();
+        __u.__p1_.first().__next_ = nullptr;
+        __u.size() = 0;
+    }
+    std::__debug_db_swap(this, std::addressof(__u));
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__move_assign(
+        __hash_table& __u, false_type)
+{
+    if (__node_alloc() == __u.__node_alloc())
+        __move_assign(__u, true_type());
+    else
+    {
+        hash_function() = _VSTD::move(__u.hash_function());
+        key_eq() = _VSTD::move(__u.key_eq());
+        max_load_factor() = __u.max_load_factor();
+        if (bucket_count() != 0)
+        {
+            __next_pointer __cache = __detach();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+            try
+            {
+#endif // _LIBCPP_NO_EXCEPTIONS
+                const_iterator __i = __u.begin();
+                while (__cache != nullptr && __u.size() != 0)
+                {
+                    __cache->__upcast()->__value_ =
+                        _VSTD::move(__u.remove(__i++)->__value_);
+                    __next_pointer __next = __cache->__next_;
+                    __node_insert_multi(__cache->__upcast());
+                    __cache = __next;
+                }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+            }
+            catch (...)
+            {
+                __deallocate_node(__cache);
+                throw;
+            }
+#endif // _LIBCPP_NO_EXCEPTIONS
+            __deallocate_node(__cache);
+        }
+        const_iterator __i = __u.begin();
+        while (__u.size() != 0)
+        {
+            __node_holder __h = __construct_node(_NodeTypes::__move(__u.remove(__i++)->__value_));
+            __node_insert_multi(__h.get());
+            __h.release();
+        }
+    }
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+inline
+__hash_table<_Tp, _Hash, _Equal, _Alloc>&
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::operator=(__hash_table&& __u)
+    _NOEXCEPT_(
+        __node_traits::propagate_on_container_move_assignment::value &&
+        is_nothrow_move_assignable<__node_allocator>::value &&
+        is_nothrow_move_assignable<hasher>::value &&
+        is_nothrow_move_assignable<key_equal>::value)
+{
+    __move_assign(__u, integral_constant<bool,
+                  __node_traits::propagate_on_container_move_assignment::value>());
+    return *this;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _InputIterator>
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__assign_unique(_InputIterator __first,
+                                                          _InputIterator __last)
+{
+    typedef iterator_traits<_InputIterator> _ITraits;
+    typedef typename _ITraits::value_type _ItValueType;
+    static_assert((is_same<_ItValueType, __container_value_type>::value),
+                  "__assign_unique may only be called with the containers value type");
+
+    if (bucket_count() != 0)
+    {
+        __next_pointer __cache = __detach();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (; __cache != nullptr && __first != __last; ++__first)
+            {
+                __cache->__upcast()->__value_ = *__first;
+                __next_pointer __next = __cache->__next_;
+                __node_insert_unique(__cache->__upcast());
+                __cache = __next;
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __deallocate_node(__cache);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __deallocate_node(__cache);
+    }
+    for (; __first != __last; ++__first)
+        __insert_unique(*__first);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _InputIterator>
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__assign_multi(_InputIterator __first,
+                                                         _InputIterator __last)
+{
+    typedef iterator_traits<_InputIterator> _ITraits;
+    typedef typename _ITraits::value_type _ItValueType;
+    static_assert((is_same<_ItValueType, __container_value_type>::value ||
+                  is_same<_ItValueType, __node_value_type>::value),
+                  "__assign_multi may only be called with the containers value type"
+                  " or the nodes value type");
+    if (bucket_count() != 0)
+    {
+        __next_pointer __cache = __detach();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (; __cache != nullptr && __first != __last; ++__first)
+            {
+                __cache->__upcast()->__value_ = *__first;
+                __next_pointer __next = __cache->__next_;
+                __node_insert_multi(__cache->__upcast());
+                __cache = __next;
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __deallocate_node(__cache);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __deallocate_node(__cache);
+    }
+    for (; __first != __last; ++__first)
+        __insert_multi(_NodeTypes::__get_value(*__first));
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+inline
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::begin() _NOEXCEPT
+{
+    return iterator(__p1_.first().__next_, this);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+inline
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::end() _NOEXCEPT
+{
+    return iterator(nullptr, this);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+inline
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::begin() const _NOEXCEPT
+{
+    return const_iterator(__p1_.first().__next_, this);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+inline
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::end() const _NOEXCEPT
+{
+    return const_iterator(nullptr, this);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::clear() _NOEXCEPT
+{
+    if (size() > 0)
+    {
+        __deallocate_node(__p1_.first().__next_);
+        __p1_.first().__next_ = nullptr;
+        size_type __bc = bucket_count();
+        for (size_type __i = 0; __i < __bc; ++__i)
+            __bucket_list_[__i] = nullptr;
+        size() = 0;
+    }
+}
+
+
+// Prepare the container for an insertion of the value __value with the hash
+// __hash. This does a lookup into the container to see if __value is already
+// present, and performs a rehash if necessary. Returns a pointer to the
+// existing element if it exists, otherwise nullptr.
+//
+// Note that this function does forward exceptions if key_eq() throws, and never
+// mutates __value or actually inserts into the map.
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+_LIBCPP_INLINE_VISIBILITY
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__next_pointer
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_unique_prepare(
+    size_t __hash, value_type& __value)
+{
+    size_type __bc = bucket_count();
+
+    if (__bc != 0)
+    {
+        size_t __chash = std::__constrain_hash(__hash, __bc);
+        __next_pointer __ndptr = __bucket_list_[__chash];
+        if (__ndptr != nullptr)
+        {
+            for (__ndptr = __ndptr->__next_; __ndptr != nullptr &&
+                                             std::__constrain_hash(__ndptr->__hash(), __bc) == __chash;
+                                                     __ndptr = __ndptr->__next_)
+            {
+                if (key_eq()(__ndptr->__upcast()->__value_, __value))
+                    return __ndptr;
+            }
+        }
+    }
+    if (size()+1 > __bc * max_load_factor() || __bc == 0)
+    {
+        __rehash_unique(_VSTD::max<size_type>(2 * __bc + !std::__is_hash_power2(__bc),
+                                     size_type(std::ceil(float(size() + 1) / max_load_factor()))));
+    }
+    return nullptr;
+}
+
+// Insert the node __nd into the container by pushing it into the right bucket,
+// and updating size(). Assumes that __nd->__hash is up-to-date, and that
+// rehashing has already occurred and that no element with the same key exists
+// in the map.
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+_LIBCPP_INLINE_VISIBILITY
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_unique_perform(
+    __node_pointer __nd) _NOEXCEPT
+{
+    size_type __bc = bucket_count();
+    size_t __chash = std::__constrain_hash(__nd->__hash(), __bc);
+    // insert_after __bucket_list_[__chash], or __first_node if bucket is null
+    __next_pointer __pn = __bucket_list_[__chash];
+    if (__pn == nullptr)
+    {
+        __pn =__p1_.first().__ptr();
+        __nd->__next_ = __pn->__next_;
+        __pn->__next_ = __nd->__ptr();
+        // fix up __bucket_list_
+        __bucket_list_[__chash] = __pn;
+        if (__nd->__next_ != nullptr)
+            __bucket_list_[std::__constrain_hash(__nd->__next_->__hash(), __bc)] = __nd->__ptr();
+    }
+    else
+    {
+        __nd->__next_ = __pn->__next_;
+        __pn->__next_ = __nd->__ptr();
+    }
+    ++size();
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator, bool>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_unique(__node_pointer __nd)
+{
+    __nd->__hash_ = hash_function()(__nd->__value_);
+    __next_pointer __existing_node =
+        __node_insert_unique_prepare(__nd->__hash(), __nd->__value_);
+
+    // Insert the node, unless it already exists in the container.
+    bool __inserted = false;
+    if (__existing_node == nullptr)
+    {
+        __node_insert_unique_perform(__nd);
+        __existing_node = __nd->__ptr();
+        __inserted = true;
+    }
+    return pair<iterator, bool>(iterator(__existing_node, this), __inserted);
+}
+
+// Prepare the container for an insertion of the value __cp_val with the hash
+// __cp_hash. This does a lookup into the container to see if __cp_value is
+// already present, and performs a rehash if necessary. Returns a pointer to the
+// last occurrence of __cp_val in the map.
+//
+// Note that this function does forward exceptions if key_eq() throws, and never
+// mutates __value or actually inserts into the map.
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__next_pointer
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_multi_prepare(
+    size_t __cp_hash, value_type& __cp_val)
+{
+    size_type __bc = bucket_count();
+    if (size()+1 > __bc * max_load_factor() || __bc == 0)
+    {
+        __rehash_multi(_VSTD::max<size_type>(2 * __bc + !std::__is_hash_power2(__bc),
+                       size_type(std::ceil(float(size() + 1) / max_load_factor()))));
+        __bc = bucket_count();
+    }
+    size_t __chash = std::__constrain_hash(__cp_hash, __bc);
+    __next_pointer __pn = __bucket_list_[__chash];
+    if (__pn != nullptr)
+    {
+        for (bool __found = false; __pn->__next_ != nullptr &&
+                                   std::__constrain_hash(__pn->__next_->__hash(), __bc) == __chash;
+                                                           __pn = __pn->__next_)
+        {
+            //      __found    key_eq()     action
+            //      false       false       loop
+            //      true        true        loop
+            //      false       true        set __found to true
+            //      true        false       break
+            if (__found != (__pn->__next_->__hash() == __cp_hash &&
+                            key_eq()(__pn->__next_->__upcast()->__value_, __cp_val)))
+            {
+                if (!__found)
+                    __found = true;
+                else
+                    break;
+            }
+        }
+    }
+    return __pn;
+}
+
+// Insert the node __cp into the container after __pn (which is the last node in
+// the bucket that compares equal to __cp). Rehashing, and checking for
+// uniqueness has already been performed (in __node_insert_multi_prepare), so
+// all we need to do is update the bucket and size(). Assumes that __cp->__hash
+// is up-to-date.
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_multi_perform(
+    __node_pointer __cp, __next_pointer __pn) _NOEXCEPT
+{
+    size_type __bc = bucket_count();
+    size_t __chash = std::__constrain_hash(__cp->__hash_, __bc);
+    if (__pn == nullptr)
+    {
+        __pn =__p1_.first().__ptr();
+        __cp->__next_ = __pn->__next_;
+        __pn->__next_ = __cp->__ptr();
+        // fix up __bucket_list_
+        __bucket_list_[__chash] = __pn;
+        if (__cp->__next_ != nullptr)
+            __bucket_list_[std::__constrain_hash(__cp->__next_->__hash(), __bc)]
+                = __cp->__ptr();
+    }
+    else
+    {
+        __cp->__next_ = __pn->__next_;
+        __pn->__next_ = __cp->__ptr();
+        if (__cp->__next_ != nullptr)
+        {
+            size_t __nhash = std::__constrain_hash(__cp->__next_->__hash(), __bc);
+            if (__nhash != __chash)
+                __bucket_list_[__nhash] = __cp->__ptr();
+        }
+    }
+    ++size();
+}
+
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_multi(__node_pointer __cp)
+{
+    __cp->__hash_ = hash_function()(__cp->__value_);
+    __next_pointer __pn = __node_insert_multi_prepare(__cp->__hash(), __cp->__value_);
+    __node_insert_multi_perform(__cp, __pn);
+
+    return iterator(__cp->__ptr(), this);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_multi(
+        const_iterator __p, __node_pointer __cp)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                         "unordered container::emplace_hint(const_iterator, args...) called with an iterator not"
+                         " referring to this unordered container");
+    if (__p != end() && key_eq()(*__p, __cp->__value_))
+    {
+        __next_pointer __np = __p.__node_;
+        __cp->__hash_ = __np->__hash();
+        size_type __bc = bucket_count();
+        if (size()+1 > __bc * max_load_factor() || __bc == 0)
+        {
+            __rehash_multi(_VSTD::max<size_type>(2 * __bc + !std::__is_hash_power2(__bc),
+                           size_type(std::ceil(float(size() + 1) / max_load_factor()))));
+            __bc = bucket_count();
+        }
+        size_t __chash = std::__constrain_hash(__cp->__hash_, __bc);
+        __next_pointer __pp = __bucket_list_[__chash];
+        while (__pp->__next_ != __np)
+            __pp = __pp->__next_;
+        __cp->__next_ = __np;
+        __pp->__next_ = static_cast<__next_pointer>(__cp);
+        ++size();
+        return iterator(static_cast<__next_pointer>(__cp), this);
+    }
+    return __node_insert_multi(__cp);
+}
+
+
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Key, class ..._Args>
+pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator, bool>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_unique_key_args(_Key const& __k, _Args&&... __args)
+{
+
+    size_t __hash = hash_function()(__k);
+    size_type __bc = bucket_count();
+    bool __inserted = false;
+    __next_pointer __nd;
+    size_t __chash;
+    if (__bc != 0)
+    {
+        __chash = std::__constrain_hash(__hash, __bc);
+        __nd = __bucket_list_[__chash];
+        if (__nd != nullptr)
+        {
+            for (__nd = __nd->__next_; __nd != nullptr &&
+                (__nd->__hash() == __hash || std::__constrain_hash(__nd->__hash(), __bc) == __chash);
+                                                           __nd = __nd->__next_)
+            {
+                if (key_eq()(__nd->__upcast()->__value_, __k))
+                    goto __done;
+            }
+        }
+    }
+    {
+        __node_holder __h = __construct_node_hash(__hash, _VSTD::forward<_Args>(__args)...);
+        if (size()+1 > __bc * max_load_factor() || __bc == 0)
+        {
+            __rehash_unique(_VSTD::max<size_type>(2 * __bc + !std::__is_hash_power2(__bc),
+                           size_type(std::ceil(float(size() + 1) / max_load_factor()))));
+            __bc = bucket_count();
+            __chash = std::__constrain_hash(__hash, __bc);
+        }
+        // insert_after __bucket_list_[__chash], or __first_node if bucket is null
+        __next_pointer __pn = __bucket_list_[__chash];
+        if (__pn == nullptr)
+        {
+            __pn = __p1_.first().__ptr();
+            __h->__next_ = __pn->__next_;
+            __pn->__next_ = __h.get()->__ptr();
+            // fix up __bucket_list_
+            __bucket_list_[__chash] = __pn;
+            if (__h->__next_ != nullptr)
+                __bucket_list_[std::__constrain_hash(__h->__next_->__hash(), __bc)]
+                    = __h.get()->__ptr();
+        }
+        else
+        {
+            __h->__next_ = __pn->__next_;
+            __pn->__next_ = static_cast<__next_pointer>(__h.get());
+        }
+        __nd = static_cast<__next_pointer>(__h.release());
+        // increment size
+        ++size();
+        __inserted = true;
+    }
+__done:
+    return pair<iterator, bool>(iterator(__nd, this), __inserted);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class... _Args>
+pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator, bool>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_unique_impl(_Args&&... __args)
+{
+    __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
+    pair<iterator, bool> __r = __node_insert_unique(__h.get());
+    if (__r.second)
+        __h.release();
+    return __r;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class... _Args>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_multi(_Args&&... __args)
+{
+    __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
+    iterator __r = __node_insert_multi(__h.get());
+    __h.release();
+    return __r;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class... _Args>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_hint_multi(
+        const_iterator __p, _Args&&... __args)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                         "unordered container::emplace_hint(const_iterator, args...) called with an iterator not"
+                         " referring to this unordered container");
+    __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
+    iterator __r = __node_insert_multi(__p, __h.get());
+    __h.release();
+    return __r;
+}
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _NodeHandle, class _InsertReturnType>
+_LIBCPP_INLINE_VISIBILITY
+_InsertReturnType
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_insert_unique(
+    _NodeHandle&& __nh)
+{
+    if (__nh.empty())
+        return _InsertReturnType{end(), false, _NodeHandle()};
+    pair<iterator, bool> __result = __node_insert_unique(__nh.__ptr_);
+    if (__result.second)
+        __nh.__release_ptr();
+    return _InsertReturnType{__result.first, __result.second, _VSTD::move(__nh)};
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _NodeHandle>
+_LIBCPP_INLINE_VISIBILITY
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_insert_unique(
+    const_iterator, _NodeHandle&& __nh)
+{
+    if (__nh.empty())
+        return end();
+    pair<iterator, bool> __result = __node_insert_unique(__nh.__ptr_);
+    if (__result.second)
+        __nh.__release_ptr();
+    return __result.first;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _NodeHandle>
+_LIBCPP_INLINE_VISIBILITY
+_NodeHandle
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_extract(
+    key_type const& __key)
+{
+    iterator __i = find(__key);
+    if (__i == end())
+        return _NodeHandle();
+    return __node_handle_extract<_NodeHandle>(__i);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _NodeHandle>
+_LIBCPP_INLINE_VISIBILITY
+_NodeHandle
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_extract(
+    const_iterator __p)
+{
+    allocator_type __alloc(__node_alloc());
+    return _NodeHandle(remove(__p).release(), __alloc);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Table>
+_LIBCPP_INLINE_VISIBILITY
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_merge_unique(
+    _Table& __source)
+{
+    static_assert(is_same<__node, typename _Table::__node>::value, "");
+
+    for (typename _Table::iterator __it = __source.begin();
+         __it != __source.end();)
+    {
+        __node_pointer __src_ptr = __it.__node_->__upcast();
+        size_t __hash = hash_function()(__src_ptr->__value_);
+        __next_pointer __existing_node =
+            __node_insert_unique_prepare(__hash, __src_ptr->__value_);
+        auto __prev_iter = __it++;
+        if (__existing_node == nullptr)
+        {
+            (void)__source.remove(__prev_iter).release();
+            __src_ptr->__hash_ = __hash;
+            __node_insert_unique_perform(__src_ptr);
+        }
+    }
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _NodeHandle>
+_LIBCPP_INLINE_VISIBILITY
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_insert_multi(
+    _NodeHandle&& __nh)
+{
+    if (__nh.empty())
+        return end();
+    iterator __result = __node_insert_multi(__nh.__ptr_);
+    __nh.__release_ptr();
+    return __result;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _NodeHandle>
+_LIBCPP_INLINE_VISIBILITY
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_insert_multi(
+    const_iterator __hint, _NodeHandle&& __nh)
+{
+    if (__nh.empty())
+        return end();
+    iterator __result = __node_insert_multi(__hint, __nh.__ptr_);
+    __nh.__release_ptr();
+    return __result;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Table>
+_LIBCPP_INLINE_VISIBILITY
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_handle_merge_multi(
+    _Table& __source)
+{
+    static_assert(is_same<typename _Table::__node, __node>::value, "");
+
+    for (typename _Table::iterator __it = __source.begin();
+         __it != __source.end();)
+    {
+        __node_pointer __src_ptr = __it.__node_->__upcast();
+        size_t __src_hash = hash_function()(__src_ptr->__value_);
+        __next_pointer __pn =
+            __node_insert_multi_prepare(__src_hash, __src_ptr->__value_);
+        (void)__source.remove(__it++).release();
+        __src_ptr->__hash_ = __src_hash;
+        __node_insert_multi_perform(__src_ptr, __pn);
+    }
+}
+#endif // _LIBCPP_STD_VER > 14
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <bool _UniqueKeys>
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__rehash(size_type __n)
+_LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+{
+    if (__n == 1)
+        __n = 2;
+    else if (__n & (__n - 1))
+        __n = std::__next_prime(__n);
+    size_type __bc = bucket_count();
+    if (__n > __bc)
+        __do_rehash<_UniqueKeys>(__n);
+    else if (__n < __bc)
+    {
+        __n = _VSTD::max<size_type>
+              (
+                  __n,
+                  std::__is_hash_power2(__bc) ? std::__next_hash_pow2(size_t(std::ceil(float(size()) / max_load_factor()))) :
+                                           std::__next_prime(size_t(std::ceil(float(size()) / max_load_factor())))
+              );
+        if (__n < __bc)
+            __do_rehash<_UniqueKeys>(__n);
+    }
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <bool _UniqueKeys>
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__do_rehash(size_type __nbc)
+{
+    std::__debug_db_invalidate_all(this);
+    __pointer_allocator& __npa = __bucket_list_.get_deleter().__alloc();
+    __bucket_list_.reset(__nbc > 0 ?
+                      __pointer_alloc_traits::allocate(__npa, __nbc) : nullptr);
+    __bucket_list_.get_deleter().size() = __nbc;
+    if (__nbc > 0)
+    {
+        for (size_type __i = 0; __i < __nbc; ++__i)
+            __bucket_list_[__i] = nullptr;
+        __next_pointer __pp = __p1_.first().__ptr();
+        __next_pointer __cp = __pp->__next_;
+        if (__cp != nullptr)
+        {
+            size_type __chash = std::__constrain_hash(__cp->__hash(), __nbc);
+            __bucket_list_[__chash] = __pp;
+            size_type __phash = __chash;
+            for (__pp = __cp, void(), __cp = __cp->__next_; __cp != nullptr;
+                                                           __cp = __pp->__next_)
+            {
+                __chash = std::__constrain_hash(__cp->__hash(), __nbc);
+                if (__chash == __phash)
+                    __pp = __cp;
+                else
+                {
+                    if (__bucket_list_[__chash] == nullptr)
+                    {
+                        __bucket_list_[__chash] = __pp;
+                        __pp = __cp;
+                        __phash = __chash;
+                    }
+                    else
+                    {
+                        __next_pointer __np = __cp;
+                        if _LIBCPP_CONSTEXPR_SINCE_CXX17 (!_UniqueKeys)
+                        {
+                            for (; __np->__next_ != nullptr &&
+                                   key_eq()(__cp->__upcast()->__value_,
+                                            __np->__next_->__upcast()->__value_);
+                                                               __np = __np->__next_)
+                                ;
+                        }
+                        __pp->__next_ = __np->__next_;
+                        __np->__next_ = __bucket_list_[__chash]->__next_;
+                        __bucket_list_[__chash]->__next_ = __cp;
+
+                    }
+                }
+            }
+        }
+    }
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Key>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::find(const _Key& __k)
+{
+    size_t __hash = hash_function()(__k);
+    size_type __bc = bucket_count();
+    if (__bc != 0)
+    {
+        size_t __chash = std::__constrain_hash(__hash, __bc);
+        __next_pointer __nd = __bucket_list_[__chash];
+        if (__nd != nullptr)
+        {
+            for (__nd = __nd->__next_; __nd != nullptr &&
+                (__nd->__hash() == __hash
+                  || std::__constrain_hash(__nd->__hash(), __bc) == __chash);
+                                                           __nd = __nd->__next_)
+            {
+                if ((__nd->__hash() == __hash)
+                    && key_eq()(__nd->__upcast()->__value_, __k))
+                    return iterator(__nd, this);
+            }
+        }
+    }
+    return end();
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Key>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::find(const _Key& __k) const
+{
+    size_t __hash = hash_function()(__k);
+    size_type __bc = bucket_count();
+    if (__bc != 0)
+    {
+        size_t __chash = std::__constrain_hash(__hash, __bc);
+        __next_pointer __nd = __bucket_list_[__chash];
+        if (__nd != nullptr)
+        {
+            for (__nd = __nd->__next_; __nd != nullptr &&
+                (__hash == __nd->__hash()
+                    || std::__constrain_hash(__nd->__hash(), __bc) == __chash);
+                                                           __nd = __nd->__next_)
+            {
+                if ((__nd->__hash() == __hash)
+                    && key_eq()(__nd->__upcast()->__value_, __k))
+                    return const_iterator(__nd, this);
+            }
+        }
+
+    }
+    return end();
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class ..._Args>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_holder
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__construct_node(_Args&& ...__args)
+{
+    static_assert(!__is_hash_value_type<_Args...>::value,
+                  "Construct cannot be called with a hash value type");
+    __node_allocator& __na = __node_alloc();
+    __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
+    __node_traits::construct(__na, _NodeTypes::__get_ptr(__h->__value_), _VSTD::forward<_Args>(__args)...);
+    __h.get_deleter().__value_constructed = true;
+    __h->__hash_ = hash_function()(__h->__value_);
+    __h->__next_ = nullptr;
+    return __h;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _First, class ..._Rest>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_holder
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__construct_node_hash(
+    size_t __hash, _First&& __f, _Rest&& ...__rest)
+{
+    static_assert(!__is_hash_value_type<_First, _Rest...>::value,
+                  "Construct cannot be called with a hash value type");
+    __node_allocator& __na = __node_alloc();
+    __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
+    __node_traits::construct(__na, _NodeTypes::__get_ptr(__h->__value_),
+                             _VSTD::forward<_First>(__f),
+                             _VSTD::forward<_Rest>(__rest)...);
+    __h.get_deleter().__value_constructed = true;
+    __h->__hash_ = __hash;
+    __h->__next_ = nullptr;
+    return __h;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::erase(const_iterator __p)
+{
+    __next_pointer __np = __p.__node_;
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                         "unordered container erase(iterator) called with an iterator not"
+                         " referring to this container");
+    _LIBCPP_ASSERT(__p != end(),
+                   "unordered container erase(iterator) called with a non-dereferenceable iterator");
+    iterator __r(__np, this);
+    ++__r;
+    remove(__p);
+    return __r;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::erase(const_iterator __first,
+                                                const_iterator __last)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__first)) == this,
+                         "unordered container::erase(iterator, iterator) called with an iterator not"
+                         " referring to this container");
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__last)) == this,
+                         "unordered container::erase(iterator, iterator) called with an iterator not"
+                         " referring to this container");
+    for (const_iterator __p = __first; __first != __last; __p = __first)
+    {
+        ++__first;
+        erase(__p);
+    }
+    __next_pointer __np = __last.__node_;
+    return iterator (__np, this);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Key>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__erase_unique(const _Key& __k)
+{
+    iterator __i = find(__k);
+    if (__i == end())
+        return 0;
+    erase(__i);
+    return 1;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Key>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__erase_multi(const _Key& __k)
+{
+    size_type __r = 0;
+    iterator __i = find(__k);
+    if (__i != end())
+    {
+        iterator __e = end();
+        do
+        {
+            erase(__i++);
+            ++__r;
+        } while (__i != __e && key_eq()(*__i, __k));
+    }
+    return __r;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_holder
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::remove(const_iterator __p) _NOEXCEPT
+{
+    // current node
+    __next_pointer __cn = __p.__node_;
+    size_type __bc = bucket_count();
+    size_t __chash = std::__constrain_hash(__cn->__hash(), __bc);
+    // find previous node
+    __next_pointer __pn = __bucket_list_[__chash];
+    for (; __pn->__next_ != __cn; __pn = __pn->__next_)
+        ;
+    // Fix up __bucket_list_
+        // if __pn is not in same bucket (before begin is not in same bucket) &&
+        //    if __cn->__next_ is not in same bucket (nullptr is not in same bucket)
+    if (__pn == __p1_.first().__ptr()
+            || std::__constrain_hash(__pn->__hash(), __bc) != __chash)
+    {
+        if (__cn->__next_ == nullptr
+            || std::__constrain_hash(__cn->__next_->__hash(), __bc) != __chash)
+            __bucket_list_[__chash] = nullptr;
+    }
+        // if __cn->__next_ is not in same bucket (nullptr is in same bucket)
+    if (__cn->__next_ != nullptr)
+    {
+        size_t __nhash = std::__constrain_hash(__cn->__next_->__hash(), __bc);
+        if (__nhash != __chash)
+            __bucket_list_[__nhash] = __pn;
+    }
+    // remove __cn
+    __pn->__next_ = __cn->__next_;
+    __cn->__next_ = nullptr;
+    --size();
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    __c_node* __c = __get_db()->__find_c_and_lock(this);
+    for (__i_node** __dp = __c->end_; __dp != __c->beg_; )
+    {
+        --__dp;
+        iterator* __i = static_cast<iterator*>((*__dp)->__i_);
+        if (__i->__node_ == __cn)
+        {
+            (*__dp)->__c_ = nullptr;
+            if (--__c->end_ != __dp)
+                _VSTD::memmove(__dp, __dp+1, (__c->end_ - __dp)*sizeof(__i_node*));
+        }
+    }
+    __get_db()->unlock();
+#endif
+    return __node_holder(__cn->__upcast(), _Dp(__node_alloc(), true));
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Key>
+inline
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__count_unique(const _Key& __k) const
+{
+    return static_cast<size_type>(find(__k) != end());
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Key>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__count_multi(const _Key& __k) const
+{
+    size_type __r = 0;
+    const_iterator __i = find(__k);
+    if (__i != end())
+    {
+        const_iterator __e = end();
+        do
+        {
+            ++__i;
+            ++__r;
+        } while (__i != __e && key_eq()(*__i, __k));
+    }
+    return __r;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Key>
+pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator,
+     typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__equal_range_unique(
+        const _Key& __k)
+{
+    iterator __i = find(__k);
+    iterator __j = __i;
+    if (__i != end())
+        ++__j;
+    return pair<iterator, iterator>(__i, __j);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Key>
+pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator,
+     typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__equal_range_unique(
+        const _Key& __k) const
+{
+    const_iterator __i = find(__k);
+    const_iterator __j = __i;
+    if (__i != end())
+        ++__j;
+    return pair<const_iterator, const_iterator>(__i, __j);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Key>
+pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator,
+     typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::iterator>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__equal_range_multi(
+        const _Key& __k)
+{
+    iterator __i = find(__k);
+    iterator __j = __i;
+    if (__i != end())
+    {
+        iterator __e = end();
+        do
+        {
+            ++__j;
+        } while (__j != __e && key_eq()(*__j, __k));
+    }
+    return pair<iterator, iterator>(__i, __j);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+template <class _Key>
+pair<typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator,
+     typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::const_iterator>
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__equal_range_multi(
+        const _Key& __k) const
+{
+    const_iterator __i = find(__k);
+    const_iterator __j = __i;
+    if (__i != end())
+    {
+        const_iterator __e = end();
+        do
+        {
+            ++__j;
+        } while (__j != __e && key_eq()(*__j, __k));
+    }
+    return pair<const_iterator, const_iterator>(__i, __j);
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+void
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::swap(__hash_table& __u)
+#if _LIBCPP_STD_VER <= 11
+    _NOEXCEPT_(
+        __is_nothrow_swappable<hasher>::value && __is_nothrow_swappable<key_equal>::value
+        && (!allocator_traits<__pointer_allocator>::propagate_on_container_swap::value
+              || __is_nothrow_swappable<__pointer_allocator>::value)
+        && (!__node_traits::propagate_on_container_swap::value
+              || __is_nothrow_swappable<__node_allocator>::value)
+            )
+#else
+  _NOEXCEPT_(__is_nothrow_swappable<hasher>::value && __is_nothrow_swappable<key_equal>::value)
+#endif
+{
+    _LIBCPP_ASSERT(__node_traits::propagate_on_container_swap::value ||
+                   this->__node_alloc() == __u.__node_alloc(),
+                   "list::swap: Either propagate_on_container_swap must be true"
+                   " or the allocators must compare equal");
+    {
+    __node_pointer_pointer __npp = __bucket_list_.release();
+    __bucket_list_.reset(__u.__bucket_list_.release());
+    __u.__bucket_list_.reset(__npp);
+    }
+    _VSTD::swap(__bucket_list_.get_deleter().size(), __u.__bucket_list_.get_deleter().size());
+    _VSTD::__swap_allocator(__bucket_list_.get_deleter().__alloc(),
+             __u.__bucket_list_.get_deleter().__alloc());
+    _VSTD::__swap_allocator(__node_alloc(), __u.__node_alloc());
+    _VSTD::swap(__p1_.first().__next_, __u.__p1_.first().__next_);
+    __p2_.swap(__u.__p2_);
+    __p3_.swap(__u.__p3_);
+    if (size() > 0)
+        __bucket_list_[std::__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] =
+            __p1_.first().__ptr();
+    if (__u.size() > 0)
+        __u.__bucket_list_[std::__constrain_hash(__u.__p1_.first().__next_->__hash(), __u.bucket_count())] =
+            __u.__p1_.first().__ptr();
+    std::__debug_db_swap(this, std::addressof(__u));
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+typename __hash_table<_Tp, _Hash, _Equal, _Alloc>::size_type
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::bucket_size(size_type __n) const
+{
+    _LIBCPP_ASSERT(__n < bucket_count(),
+        "unordered container::bucket_size(n) called with n >= bucket_count()");
+    __next_pointer __np = __bucket_list_[__n];
+    size_type __bc = bucket_count();
+    size_type __r = 0;
+    if (__np != nullptr)
+    {
+        for (__np = __np->__next_; __np != nullptr &&
+                                   std::__constrain_hash(__np->__hash(), __bc) == __n;
+                                                         __np = __np->__next_, (void) ++__r)
+            ;
+    }
+    return __r;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(__hash_table<_Tp, _Hash, _Equal, _Alloc>& __x,
+     __hash_table<_Tp, _Hash, _Equal, _Alloc>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+bool
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__dereferenceable(const const_iterator* __i) const
+{
+    return __i->__node_ != nullptr;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+bool
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__decrementable(const const_iterator*) const
+{
+    return false;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+bool
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__addable(const const_iterator*, ptrdiff_t) const
+{
+    return false;
+}
+
+template <class _Tp, class _Hash, class _Equal, class _Alloc>
+bool
+__hash_table<_Tp, _Hash, _Equal, _Alloc>::__subscriptable(const const_iterator*, ptrdiff_t) const
+{
+    return false;
+}
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___HASH_TABLE
diff --git a/app/src/main/cpp/libcxx/include/__ios/fpos.h b/app/src/main/cpp/libcxx/include/__ios/fpos.h
new file mode 100644
index 0000000..87f0135
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ios/fpos.h
@@ -0,0 +1,79 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___IOS_FPOS_H
+#define _LIBCPP___IOS_FPOS_H
+
+#include <__config>
+#include <iosfwd>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _StateT>
+class _LIBCPP_TEMPLATE_VIS fpos {
+private:
+  _StateT __st_;
+  streamoff __off_;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI fpos(streamoff __off = streamoff()) : __st_(), __off_(__off) {}
+
+  _LIBCPP_HIDE_FROM_ABI operator streamoff() const { return __off_; }
+
+  _LIBCPP_HIDE_FROM_ABI _StateT state() const { return __st_; }
+  _LIBCPP_HIDE_FROM_ABI void state(_StateT __st) { __st_ = __st; }
+
+  _LIBCPP_HIDE_FROM_ABI fpos& operator+=(streamoff __off) {
+    __off_ += __off;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI fpos operator+(streamoff __off) const {
+    fpos __t(*this);
+    __t += __off;
+    return __t;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI fpos& operator-=(streamoff __off) {
+    __off_ -= __off;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI fpos operator-(streamoff __off) const {
+    fpos __t(*this);
+    __t -= __off;
+    return __t;
+  }
+};
+
+template <class _StateT>
+inline _LIBCPP_HIDE_FROM_ABI
+streamoff operator-(const fpos<_StateT>& __x, const fpos<_StateT>& __y) {
+  return streamoff(__x) - streamoff(__y);
+}
+
+template <class _StateT>
+inline _LIBCPP_HIDE_FROM_ABI
+bool operator==(const fpos<_StateT>& __x, const fpos<_StateT>& __y) {
+  return streamoff(__x) == streamoff(__y);
+}
+
+template <class _StateT>
+inline _LIBCPP_HIDE_FROM_ABI
+bool operator!=(const fpos<_StateT>& __x, const fpos<_StateT>& __y) {
+  return streamoff(__x) != streamoff(__y);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___IOS_FPOS_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/access.h b/app/src/main/cpp/libcxx/include/__iterator/access.h
new file mode 100644
index 0000000..0b8d523
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/access.h
@@ -0,0 +1,129 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_ACCESS_H
+#define _LIBCPP___ITERATOR_ACCESS_H
+
+#include <__config>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, size_t _Np>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp*
+begin(_Tp (&__array)[_Np])
+{
+    return __array;
+}
+
+template <class _Tp, size_t _Np>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp*
+end(_Tp (&__array)[_Np])
+{
+    return __array + _Np;
+}
+
+#if !defined(_LIBCPP_CXX03_LANG)
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+auto
+begin(_Cp& __c) -> decltype(__c.begin())
+{
+    return __c.begin();
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+auto
+begin(const _Cp& __c) -> decltype(__c.begin())
+{
+    return __c.begin();
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+auto
+end(_Cp& __c) -> decltype(__c.end())
+{
+    return __c.end();
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+auto
+end(const _Cp& __c) -> decltype(__c.end())
+{
+    return __c.end();
+}
+
+#if _LIBCPP_STD_VER > 11
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+auto cbegin(const _Cp& __c) -> decltype(_VSTD::begin(__c))
+{
+    return _VSTD::begin(__c);
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+auto cend(const _Cp& __c) -> decltype(_VSTD::end(__c))
+{
+    return _VSTD::end(__c);
+}
+
+#endif
+
+
+#else  // defined(_LIBCPP_CXX03_LANG)
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY
+typename _Cp::iterator
+begin(_Cp& __c)
+{
+    return __c.begin();
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY
+typename _Cp::const_iterator
+begin(const _Cp& __c)
+{
+    return __c.begin();
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY
+typename _Cp::iterator
+end(_Cp& __c)
+{
+    return __c.end();
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY
+typename _Cp::const_iterator
+end(const _Cp& __c)
+{
+    return __c.end();
+}
+
+#endif // !defined(_LIBCPP_CXX03_LANG)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_ACCESS_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/advance.h b/app/src/main/cpp/libcxx/include/__iterator/advance.h
new file mode 100644
index 0000000..154c273
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/advance.h
@@ -0,0 +1,203 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_ADVANCE_H
+#define _LIBCPP___ITERATOR_ADVANCE_H
+
+#include <__assert>
+#include <__concepts/assignable.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_integral.h>
+#include <__utility/convert_to_integral.h>
+#include <__utility/declval.h>
+#include <__utility/move.h>
+#include <__utility/unreachable.h>
+#include <cstdlib>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIter>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+void __advance(_InputIter& __i, typename iterator_traits<_InputIter>::difference_type __n, input_iterator_tag) {
+  for (; __n > 0; --__n)
+    ++__i;
+}
+
+template <class _BiDirIter>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+void __advance(_BiDirIter& __i, typename iterator_traits<_BiDirIter>::difference_type __n, bidirectional_iterator_tag) {
+  if (__n >= 0)
+    for (; __n > 0; --__n)
+      ++__i;
+  else
+    for (; __n < 0; ++__n)
+      --__i;
+}
+
+template <class _RandIter>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+void __advance(_RandIter& __i, typename iterator_traits<_RandIter>::difference_type __n, random_access_iterator_tag) {
+  __i += __n;
+}
+
+template <
+    class _InputIter, class _Distance,
+    class _IntegralDistance = decltype(_VSTD::__convert_to_integral(std::declval<_Distance>())),
+    class = __enable_if_t<is_integral<_IntegralDistance>::value> >
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+void advance(_InputIter& __i, _Distance __orig_n) {
+  typedef typename iterator_traits<_InputIter>::difference_type _Difference;
+  _Difference __n = static_cast<_Difference>(_VSTD::__convert_to_integral(__orig_n));
+  _LIBCPP_ASSERT(__n >= 0 || __is_cpp17_bidirectional_iterator<_InputIter>::value,
+                 "Attempt to advance(it, n) with negative n on a non-bidirectional iterator");
+  _VSTD::__advance(__i, __n, typename iterator_traits<_InputIter>::iterator_category());
+}
+
+#if _LIBCPP_STD_VER > 17
+
+// [range.iter.op.advance]
+
+namespace ranges {
+namespace __advance {
+
+struct __fn {
+private:
+  template <class _Ip>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr void __advance_forward(_Ip& __i, iter_difference_t<_Ip> __n) {
+    while (__n > 0) {
+      --__n;
+      ++__i;
+    }
+  }
+
+  template <class _Ip>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr void __advance_backward(_Ip& __i, iter_difference_t<_Ip> __n) {
+    while (__n < 0) {
+      ++__n;
+      --__i;
+    }
+  }
+
+public:
+  // Preconditions: If `I` does not model `bidirectional_iterator`, `n` is not negative.
+  template <input_or_output_iterator _Ip>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr void operator()(_Ip& __i, iter_difference_t<_Ip> __n) const {
+    _LIBCPP_ASSERT(__n >= 0 || bidirectional_iterator<_Ip>,
+                   "If `n < 0`, then `bidirectional_iterator<I>` must be true.");
+
+    // If `I` models `random_access_iterator`, equivalent to `i += n`.
+    if constexpr (random_access_iterator<_Ip>) {
+      __i += __n;
+      return;
+    } else if constexpr (bidirectional_iterator<_Ip>) {
+      // Otherwise, if `n` is non-negative, increments `i` by `n`.
+      __advance_forward(__i, __n);
+      // Otherwise, decrements `i` by `-n`.
+      __advance_backward(__i, __n);
+      return;
+    } else {
+      // Otherwise, if `n` is non-negative, increments `i` by `n`.
+      __advance_forward(__i, __n);
+      return;
+    }
+  }
+
+  // Preconditions: Either `assignable_from<I&, S> || sized_sentinel_for<S, I>` is modeled, or [i, bound_sentinel) denotes a range.
+  template <input_or_output_iterator _Ip, sentinel_for<_Ip> _Sp>
+  _LIBCPP_HIDE_FROM_ABI constexpr void operator()(_Ip& __i, _Sp __bound_sentinel) const {
+    // If `I` and `S` model `assignable_from<I&, S>`, equivalent to `i = std::move(bound_sentinel)`.
+    if constexpr (assignable_from<_Ip&, _Sp>) {
+      __i = _VSTD::move(__bound_sentinel);
+    }
+    // Otherwise, if `S` and `I` model `sized_sentinel_for<S, I>`, equivalent to `ranges::advance(i, bound_sentinel - i)`.
+    else if constexpr (sized_sentinel_for<_Sp, _Ip>) {
+      (*this)(__i, __bound_sentinel - __i);
+    }
+    // Otherwise, while `bool(i != bound_sentinel)` is true, increments `i`.
+    else {
+      while (__i != __bound_sentinel) {
+        ++__i;
+      }
+    }
+  }
+
+  // Preconditions:
+  //   * If `n > 0`, [i, bound_sentinel) denotes a range.
+  //   * If `n == 0`, [i, bound_sentinel) or [bound_sentinel, i) denotes a range.
+  //   * If `n < 0`, [bound_sentinel, i) denotes a range, `I` models `bidirectional_iterator`, and `I` and `S` model `same_as<I, S>`.
+  // Returns: `n - M`, where `M` is the difference between the ending and starting position.
+  template <input_or_output_iterator _Ip, sentinel_for<_Ip> _Sp>
+  _LIBCPP_HIDE_FROM_ABI constexpr iter_difference_t<_Ip> operator()(_Ip& __i, iter_difference_t<_Ip> __n,
+                                                                    _Sp __bound_sentinel) const {
+    _LIBCPP_ASSERT((__n >= 0) || (bidirectional_iterator<_Ip> && same_as<_Ip, _Sp>),
+                   "If `n < 0`, then `bidirectional_iterator<I> && same_as<I, S>` must be true.");
+    // If `S` and `I` model `sized_sentinel_for<S, I>`:
+    if constexpr (sized_sentinel_for<_Sp, _Ip>) {
+      // If |n| >= |bound_sentinel - i|, equivalent to `ranges::advance(i, bound_sentinel)`.
+      // __magnitude_geq(a, b) returns |a| >= |b|, assuming they have the same sign.
+      auto __magnitude_geq = [](auto __a, auto __b) {
+        return __a == 0 ? __b == 0 :
+               __a > 0  ? __a >= __b :
+                          __a <= __b;
+      };
+      if (const auto __M = __bound_sentinel - __i; __magnitude_geq(__n, __M)) {
+        (*this)(__i, __bound_sentinel);
+        return __n - __M;
+      }
+
+      // Otherwise, equivalent to `ranges::advance(i, n)`.
+      (*this)(__i, __n);
+      return 0;
+    } else {
+      // Otherwise, if `n` is non-negative, while `bool(i != bound_sentinel)` is true, increments `i` but at
+      // most `n` times.
+      while (__i != __bound_sentinel && __n > 0) {
+        ++__i;
+        --__n;
+      }
+
+      // Otherwise, while `bool(i != bound_sentinel)` is true, decrements `i` but at most `-n` times.
+      if constexpr (bidirectional_iterator<_Ip> && same_as<_Ip, _Sp>) {
+        while (__i != __bound_sentinel && __n < 0) {
+          --__i;
+          ++__n;
+        }
+      }
+      return __n;
+    }
+
+    __libcpp_unreachable();
+  }
+};
+
+} // namespace __advance
+
+inline namespace __cpo {
+  inline constexpr auto advance = __advance::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_ADVANCE_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/back_insert_iterator.h b/app/src/main/cpp/libcxx/include/__iterator/back_insert_iterator.h
new file mode 100644
index 0000000..4c00a7e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/back_insert_iterator.h
@@ -0,0 +1,73 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_BACK_INSERT_ITERATOR_H
+#define _LIBCPP___ITERATOR_BACK_INSERT_ITERATOR_H
+
+#include <__config>
+#include <__iterator/iterator.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__utility/move.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Container>
+class _LIBCPP_TEMPLATE_VIS back_insert_iterator
+#if _LIBCPP_STD_VER <= 14 || !defined(_LIBCPP_ABI_NO_ITERATOR_BASES)
+    : public iterator<output_iterator_tag, void, void, void, void>
+#endif
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+protected:
+    _Container* container;
+public:
+    typedef output_iterator_tag iterator_category;
+    typedef void value_type;
+#if _LIBCPP_STD_VER > 17
+    typedef ptrdiff_t difference_type;
+#else
+    typedef void difference_type;
+#endif
+    typedef void pointer;
+    typedef void reference;
+    typedef _Container container_type;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit back_insert_iterator(_Container& __x) : container(_VSTD::addressof(__x)) {}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 back_insert_iterator& operator=(const typename _Container::value_type& __value)
+        {container->push_back(__value); return *this;}
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 back_insert_iterator& operator=(typename _Container::value_type&& __value)
+        {container->push_back(_VSTD::move(__value)); return *this;}
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 back_insert_iterator& operator*()     {return *this;}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 back_insert_iterator& operator++()    {return *this;}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 back_insert_iterator  operator++(int) {return *this;}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Container* __get_container() const { return container; }
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(back_insert_iterator);
+
+template <class _Container>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+back_insert_iterator<_Container>
+back_inserter(_Container& __x)
+{
+    return back_insert_iterator<_Container>(__x);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_BACK_INSERT_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/bounded_iter.h b/app/src/main/cpp/libcxx/include/__iterator/bounded_iter.h
new file mode 100644
index 0000000..2682f2a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/bounded_iter.h
@@ -0,0 +1,231 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_BOUNDED_ITER_H
+#define _LIBCPP___ITERATOR_BOUNDED_ITER_H
+
+#include <__assert>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__memory/pointer_traits.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_convertible.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Iterator wrapper that carries the valid range it is allowed to access.
+//
+// This is a simple iterator wrapper for contiguous iterators that points
+// within a [begin, end) range and carries these bounds with it. The iterator
+// ensures that it is pointing within that [begin, end) range when it is
+// dereferenced.
+//
+// Arithmetic operations are allowed and the bounds of the resulting iterator
+// are not checked. Hence, it is possible to create an iterator pointing outside
+// its range, but it is not possible to dereference it.
+template <class _Iterator, class = __enable_if_t< __is_cpp17_contiguous_iterator<_Iterator>::value > >
+struct __bounded_iter {
+  using value_type        = typename iterator_traits<_Iterator>::value_type;
+  using difference_type   = typename iterator_traits<_Iterator>::difference_type;
+  using pointer           = typename iterator_traits<_Iterator>::pointer;
+  using reference         = typename iterator_traits<_Iterator>::reference;
+  using iterator_category = typename iterator_traits<_Iterator>::iterator_category;
+#if _LIBCPP_STD_VER > 17
+  using iterator_concept = contiguous_iterator_tag;
+#endif
+
+  // Create a singular iterator.
+  //
+  // Such an iterator does not point to any object and is conceptually out of bounds, so it is
+  // not dereferenceable. Observing operations like comparison and assignment are valid.
+  _LIBCPP_HIDE_FROM_ABI __bounded_iter() = default;
+
+  _LIBCPP_HIDE_FROM_ABI __bounded_iter(__bounded_iter const&) = default;
+  _LIBCPP_HIDE_FROM_ABI __bounded_iter(__bounded_iter&&)      = default;
+
+  template <class _OtherIterator, class = __enable_if_t< is_convertible<_OtherIterator, _Iterator>::value > >
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR __bounded_iter(__bounded_iter<_OtherIterator> const& __other) _NOEXCEPT
+      : __current_(__other.__current_),
+        __begin_(__other.__begin_),
+        __end_(__other.__end_) {}
+
+  // Assign a bounded iterator to another one, rebinding the bounds of the iterator as well.
+  _LIBCPP_HIDE_FROM_ABI __bounded_iter& operator=(__bounded_iter const&) = default;
+  _LIBCPP_HIDE_FROM_ABI __bounded_iter& operator=(__bounded_iter&&)      = default;
+
+private:
+  // Create an iterator wrapping the given iterator, and whose bounds are described
+  // by the provided [begin, end) range.
+  //
+  // This constructor does not check whether the resulting iterator is within its bounds.
+  // However, it does check that the provided [begin, end) range is a valid range (that
+  // is, begin <= end).
+  //
+  // Since it is non-standard for iterators to have this constructor, __bounded_iter must
+  // be created via `std::__make_bounded_iter`.
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 explicit __bounded_iter(
+      _Iterator __current, _Iterator __begin, _Iterator __end)
+      : __current_(__current), __begin_(__begin), __end_(__end) {
+    _LIBCPP_ASSERT(__begin <= __end, "__bounded_iter(current, begin, end): [begin, end) is not a valid range");
+  }
+
+  template <class _It>
+  friend _LIBCPP_CONSTEXPR __bounded_iter<_It> __make_bounded_iter(_It, _It, _It);
+
+public:
+  // Dereference and indexing operations.
+  //
+  // These operations check that the iterator is dereferenceable, that is within [begin, end).
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 reference operator*() const _NOEXCEPT {
+    _LIBCPP_ASSERT(
+        __in_bounds(__current_), "__bounded_iter::operator*: Attempt to dereference an out-of-range iterator");
+    return *__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pointer operator->() const _NOEXCEPT {
+    _LIBCPP_ASSERT(
+        __in_bounds(__current_), "__bounded_iter::operator->: Attempt to dereference an out-of-range iterator");
+    return std::__to_address(__current_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 reference operator[](difference_type __n) const _NOEXCEPT {
+    _LIBCPP_ASSERT(
+        __in_bounds(__current_ + __n), "__bounded_iter::operator[]: Attempt to index an iterator out-of-range");
+    return __current_[__n];
+  }
+
+  // Arithmetic operations.
+  //
+  // These operations do not check that the resulting iterator is within the bounds, since that
+  // would make it impossible to create a past-the-end iterator.
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __bounded_iter& operator++() _NOEXCEPT {
+    ++__current_;
+    return *this;
+  }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __bounded_iter operator++(int) _NOEXCEPT {
+    __bounded_iter __tmp(*this);
+    ++*this;
+    return __tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __bounded_iter& operator--() _NOEXCEPT {
+    --__current_;
+    return *this;
+  }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __bounded_iter operator--(int) _NOEXCEPT {
+    __bounded_iter __tmp(*this);
+    --*this;
+    return __tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __bounded_iter& operator+=(difference_type __n) _NOEXCEPT {
+    __current_ += __n;
+    return *this;
+  }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 friend __bounded_iter
+  operator+(__bounded_iter const& __self, difference_type __n) _NOEXCEPT {
+    __bounded_iter __tmp(__self);
+    __tmp += __n;
+    return __tmp;
+  }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 friend __bounded_iter
+  operator+(difference_type __n, __bounded_iter const& __self) _NOEXCEPT {
+    __bounded_iter __tmp(__self);
+    __tmp += __n;
+    return __tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __bounded_iter& operator-=(difference_type __n) _NOEXCEPT {
+    __current_ -= __n;
+    return *this;
+  }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 friend __bounded_iter
+  operator-(__bounded_iter const& __self, difference_type __n) _NOEXCEPT {
+    __bounded_iter __tmp(__self);
+    __tmp -= __n;
+    return __tmp;
+  }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 friend difference_type
+  operator-(__bounded_iter const& __x, __bounded_iter const& __y) _NOEXCEPT {
+    return __x.__current_ - __y.__current_;
+  }
+
+  // Comparison operations.
+  //
+  // These operations do not check whether the iterators are within their bounds.
+  // The valid range for each iterator is also not considered as part of the comparison,
+  // i.e. two iterators pointing to the same location will be considered equal even
+  // if they have different validity ranges.
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR friend bool
+  operator==(__bounded_iter const& __x, __bounded_iter const& __y) _NOEXCEPT {
+    return __x.__current_ == __y.__current_;
+  }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR friend bool
+  operator!=(__bounded_iter const& __x, __bounded_iter const& __y) _NOEXCEPT {
+    return __x.__current_ != __y.__current_;
+  }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR friend bool
+  operator<(__bounded_iter const& __x, __bounded_iter const& __y) _NOEXCEPT {
+    return __x.__current_ < __y.__current_;
+  }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR friend bool
+  operator>(__bounded_iter const& __x, __bounded_iter const& __y) _NOEXCEPT {
+    return __x.__current_ > __y.__current_;
+  }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR friend bool
+  operator<=(__bounded_iter const& __x, __bounded_iter const& __y) _NOEXCEPT {
+    return __x.__current_ <= __y.__current_;
+  }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR friend bool
+  operator>=(__bounded_iter const& __x, __bounded_iter const& __y) _NOEXCEPT {
+    return __x.__current_ >= __y.__current_;
+  }
+
+private:
+  // Return whether the given iterator is in the bounds of this __bounded_iter.
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR bool __in_bounds(_Iterator const& __iter) const {
+    return __iter >= __begin_ && __iter < __end_;
+  }
+
+  template <class>
+  friend struct pointer_traits;
+  _Iterator __current_;       // current iterator
+  _Iterator __begin_, __end_; // valid range represented as [begin, end)
+};
+
+template <class _It>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR __bounded_iter<_It> __make_bounded_iter(_It __it, _It __begin, _It __end) {
+  return __bounded_iter<_It>(std::move(__it), std::move(__begin), std::move(__end));
+}
+
+#if _LIBCPP_STD_VER <= 17
+template <class _Iterator>
+struct __is_cpp17_contiguous_iterator<__bounded_iter<_Iterator> > : true_type {};
+#endif
+
+template <class _Iterator>
+struct pointer_traits<__bounded_iter<_Iterator> > {
+  using pointer         = __bounded_iter<_Iterator>;
+  using element_type    = typename pointer_traits<_Iterator>::element_type;
+  using difference_type = typename pointer_traits<_Iterator>::difference_type;
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR static element_type* to_address(pointer __it) _NOEXCEPT {
+    return std::__to_address(__it.__current_);
+  }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_BOUNDED_ITER_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/common_iterator.h b/app/src/main/cpp/libcxx/include/__iterator/common_iterator.h
new file mode 100644
index 0000000..f7883e2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/common_iterator.h
@@ -0,0 +1,281 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_COMMON_ITERATOR_H
+#define _LIBCPP___ITERATOR_COMMON_ITERATOR_H
+
+#include <__assert>
+#include <__concepts/assignable.h>
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/copyable.h>
+#include <__concepts/derived_from.h>
+#include <__concepts/equality_comparable.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iter_swap.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/readable_traits.h>
+#include <__type_traits/is_pointer.h>
+#include <__utility/declval.h>
+#include <variant>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template<class _Iter>
+concept __can_use_postfix_proxy =
+  constructible_from<iter_value_t<_Iter>, iter_reference_t<_Iter>> &&
+  move_constructible<iter_value_t<_Iter>>;
+
+template<input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent>
+  requires (!same_as<_Iter, _Sent> && copyable<_Iter>)
+class common_iterator {
+  struct __proxy {
+    constexpr const iter_value_t<_Iter>* operator->() const noexcept {
+      return _VSTD::addressof(__value_);
+    }
+    iter_value_t<_Iter> __value_;
+  };
+
+  struct __postfix_proxy {
+    constexpr const iter_value_t<_Iter>& operator*() const noexcept {
+      return __value_;
+    }
+    iter_value_t<_Iter> __value_;
+  };
+
+public:
+  variant<_Iter, _Sent> __hold_;
+
+  common_iterator() requires default_initializable<_Iter> = default;
+
+  constexpr common_iterator(_Iter __i) : __hold_(in_place_type<_Iter>, _VSTD::move(__i)) {}
+  constexpr common_iterator(_Sent __s) : __hold_(in_place_type<_Sent>, _VSTD::move(__s)) {}
+
+  template<class _I2, class _S2>
+    requires convertible_to<const _I2&, _Iter> && convertible_to<const _S2&, _Sent>
+  constexpr common_iterator(const common_iterator<_I2, _S2>& __other)
+    : __hold_([&]() -> variant<_Iter, _Sent> {
+      _LIBCPP_ASSERT(!__other.__hold_.valueless_by_exception(), "Attempted to construct from a valueless common_iterator");
+      if (__other.__hold_.index() == 0)
+        return variant<_Iter, _Sent>{in_place_index<0>, _VSTD::__unchecked_get<0>(__other.__hold_)};
+      return variant<_Iter, _Sent>{in_place_index<1>, _VSTD::__unchecked_get<1>(__other.__hold_)};
+    }()) {}
+
+  template<class _I2, class _S2>
+    requires convertible_to<const _I2&, _Iter> && convertible_to<const _S2&, _Sent> &&
+             assignable_from<_Iter&, const _I2&> && assignable_from<_Sent&, const _S2&>
+  common_iterator& operator=(const common_iterator<_I2, _S2>& __other) {
+    _LIBCPP_ASSERT(!__other.__hold_.valueless_by_exception(), "Attempted to assign from a valueless common_iterator");
+
+    auto __idx = __hold_.index();
+    auto __other_idx = __other.__hold_.index();
+
+    // If they're the same index, just assign.
+    if (__idx == 0 && __other_idx == 0)
+      _VSTD::__unchecked_get<0>(__hold_) = _VSTD::__unchecked_get<0>(__other.__hold_);
+    else if (__idx == 1 && __other_idx == 1)
+      _VSTD::__unchecked_get<1>(__hold_) = _VSTD::__unchecked_get<1>(__other.__hold_);
+
+    // Otherwise replace with the oposite element.
+    else if (__other_idx == 1)
+      __hold_.template emplace<1>(_VSTD::__unchecked_get<1>(__other.__hold_));
+    else if (__other_idx == 0)
+      __hold_.template emplace<0>(_VSTD::__unchecked_get<0>(__other.__hold_));
+
+    return *this;
+  }
+
+  constexpr decltype(auto) operator*()
+  {
+    _LIBCPP_ASSERT(std::holds_alternative<_Iter>(__hold_), "Attempted to dereference a non-dereferenceable common_iterator");
+    return *_VSTD::__unchecked_get<_Iter>(__hold_);
+  }
+
+  constexpr decltype(auto) operator*() const
+    requires __dereferenceable<const _Iter>
+  {
+    _LIBCPP_ASSERT(std::holds_alternative<_Iter>(__hold_), "Attempted to dereference a non-dereferenceable common_iterator");
+    return *_VSTD::__unchecked_get<_Iter>(__hold_);
+  }
+
+  template<class _I2 = _Iter>
+  decltype(auto) operator->() const
+    requires indirectly_readable<const _I2> &&
+    (requires(const _I2& __i) { __i.operator->(); } ||
+     is_reference_v<iter_reference_t<_I2>> ||
+     constructible_from<iter_value_t<_I2>, iter_reference_t<_I2>>)
+  {
+    _LIBCPP_ASSERT(std::holds_alternative<_Iter>(__hold_), "Attempted to dereference a non-dereferenceable common_iterator");
+    if constexpr (is_pointer_v<_Iter> || requires(const _Iter& __i) { __i.operator->(); })    {
+      return _VSTD::__unchecked_get<_Iter>(__hold_);
+    } else if constexpr (is_reference_v<iter_reference_t<_Iter>>) {
+      auto&& __tmp = *_VSTD::__unchecked_get<_Iter>(__hold_);
+      return _VSTD::addressof(__tmp);
+    } else {
+      return __proxy{*_VSTD::__unchecked_get<_Iter>(__hold_)};
+    }
+  }
+
+  common_iterator& operator++() {
+    _LIBCPP_ASSERT(std::holds_alternative<_Iter>(__hold_), "Attempted to increment a non-dereferenceable common_iterator");
+    ++_VSTD::__unchecked_get<_Iter>(__hold_); return *this;
+  }
+
+  decltype(auto) operator++(int) {
+    _LIBCPP_ASSERT(std::holds_alternative<_Iter>(__hold_), "Attempted to increment a non-dereferenceable common_iterator");
+    if constexpr (forward_iterator<_Iter>) {
+      auto __tmp = *this;
+      ++*this;
+      return __tmp;
+    } else if constexpr (requires (_Iter& __i) { { *__i++ } -> __can_reference; } ||
+                         !__can_use_postfix_proxy<_Iter>) {
+      return _VSTD::__unchecked_get<_Iter>(__hold_)++;
+    } else {
+      auto __p = __postfix_proxy{**this};
+      ++*this;
+      return __p;
+    }
+  }
+
+  template<class _I2, sentinel_for<_Iter> _S2>
+    requires sentinel_for<_Sent, _I2>
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(const common_iterator& __x, const common_iterator<_I2, _S2>& __y) {
+    _LIBCPP_ASSERT(!__x.__hold_.valueless_by_exception(), "Attempted to compare a valueless common_iterator");
+    _LIBCPP_ASSERT(!__y.__hold_.valueless_by_exception(), "Attempted to compare a valueless common_iterator");
+
+    auto __x_index = __x.__hold_.index();
+    auto __y_index = __y.__hold_.index();
+
+    if (__x_index == __y_index)
+      return true;
+
+    if (__x_index == 0)
+      return _VSTD::__unchecked_get<_Iter>(__x.__hold_) == _VSTD::__unchecked_get<_S2>(__y.__hold_);
+
+    return _VSTD::__unchecked_get<_Sent>(__x.__hold_) == _VSTD::__unchecked_get<_I2>(__y.__hold_);
+  }
+
+  template<class _I2, sentinel_for<_Iter> _S2>
+    requires sentinel_for<_Sent, _I2> && equality_comparable_with<_Iter, _I2>
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(const common_iterator& __x, const common_iterator<_I2, _S2>& __y) {
+    _LIBCPP_ASSERT(!__x.__hold_.valueless_by_exception(), "Attempted to compare a valueless common_iterator");
+    _LIBCPP_ASSERT(!__y.__hold_.valueless_by_exception(), "Attempted to compare a valueless common_iterator");
+
+    auto __x_index = __x.__hold_.index();
+    auto __y_index = __y.__hold_.index();
+
+    if (__x_index == 1 && __y_index == 1)
+      return true;
+
+    if (__x_index == 0 && __y_index == 0)
+      return  _VSTD::__unchecked_get<_Iter>(__x.__hold_) ==  _VSTD::__unchecked_get<_I2>(__y.__hold_);
+
+    if (__x_index == 0)
+      return  _VSTD::__unchecked_get<_Iter>(__x.__hold_) == _VSTD::__unchecked_get<_S2>(__y.__hold_);
+
+    return _VSTD::__unchecked_get<_Sent>(__x.__hold_) ==  _VSTD::__unchecked_get<_I2>(__y.__hold_);
+  }
+
+  template<sized_sentinel_for<_Iter> _I2, sized_sentinel_for<_Iter> _S2>
+    requires sized_sentinel_for<_Sent, _I2>
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr iter_difference_t<_I2> operator-(const common_iterator& __x, const common_iterator<_I2, _S2>& __y) {
+    _LIBCPP_ASSERT(!__x.__hold_.valueless_by_exception(), "Attempted to subtract from a valueless common_iterator");
+    _LIBCPP_ASSERT(!__y.__hold_.valueless_by_exception(), "Attempted to subtract a valueless common_iterator");
+
+    auto __x_index = __x.__hold_.index();
+    auto __y_index = __y.__hold_.index();
+
+    if (__x_index == 1 && __y_index == 1)
+      return 0;
+
+    if (__x_index == 0 && __y_index == 0)
+      return  _VSTD::__unchecked_get<_Iter>(__x.__hold_) - _VSTD::__unchecked_get<_I2>(__y.__hold_);
+
+    if (__x_index == 0)
+      return  _VSTD::__unchecked_get<_Iter>(__x.__hold_) - _VSTD::__unchecked_get<_S2>(__y.__hold_);
+
+    return _VSTD::__unchecked_get<_Sent>(__x.__hold_) - _VSTD::__unchecked_get<_I2>(__y.__hold_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr iter_rvalue_reference_t<_Iter> iter_move(const common_iterator& __i)
+    noexcept(noexcept(ranges::iter_move(std::declval<const _Iter&>())))
+      requires input_iterator<_Iter>
+  {
+    _LIBCPP_ASSERT(std::holds_alternative<_Iter>(__i.__hold_), "Attempted to iter_move a non-dereferenceable common_iterator");
+    return ranges::iter_move( _VSTD::__unchecked_get<_Iter>(__i.__hold_));
+  }
+
+  template<indirectly_swappable<_Iter> _I2, class _S2>
+  _LIBCPP_HIDE_FROM_ABI friend constexpr void iter_swap(const common_iterator& __x, const common_iterator<_I2, _S2>& __y)
+      noexcept(noexcept(ranges::iter_swap(std::declval<const _Iter&>(), std::declval<const _I2&>())))
+  {
+    _LIBCPP_ASSERT(std::holds_alternative<_Iter>(__x.__hold_), "Attempted to iter_swap a non-dereferenceable common_iterator");
+    _LIBCPP_ASSERT(std::holds_alternative<_I2>(__y.__hold_), "Attempted to iter_swap a non-dereferenceable common_iterator");
+    return ranges::iter_swap(_VSTD::__unchecked_get<_Iter>(__x.__hold_), _VSTD::__unchecked_get<_I2>(__y.__hold_));
+  }
+};
+
+template<class _Iter, class _Sent>
+struct incrementable_traits<common_iterator<_Iter, _Sent>> {
+  using difference_type = iter_difference_t<_Iter>;
+};
+
+template<class _Iter>
+concept __denotes_forward_iter =
+  requires { typename iterator_traits<_Iter>::iterator_category; } &&
+  derived_from<typename iterator_traits<_Iter>::iterator_category, forward_iterator_tag>;
+
+template<class _Iter, class _Sent>
+concept __common_iter_has_ptr_op = requires(const common_iterator<_Iter, _Sent>& __a) {
+  __a.operator->();
+};
+
+template<class, class>
+struct __arrow_type_or_void {
+    using type = void;
+};
+
+template<class _Iter, class _Sent>
+  requires __common_iter_has_ptr_op<_Iter, _Sent>
+struct __arrow_type_or_void<_Iter, _Sent> {
+    using type = decltype(std::declval<const common_iterator<_Iter, _Sent>&>().operator->());
+};
+
+template<input_iterator _Iter, class _Sent>
+struct iterator_traits<common_iterator<_Iter, _Sent>> {
+  using iterator_concept = _If<forward_iterator<_Iter>,
+                               forward_iterator_tag,
+                               input_iterator_tag>;
+  using iterator_category = _If<__denotes_forward_iter<_Iter>,
+                                forward_iterator_tag,
+                                input_iterator_tag>;
+  using pointer = typename __arrow_type_or_void<_Iter, _Sent>::type;
+  using value_type = iter_value_t<_Iter>;
+  using difference_type = iter_difference_t<_Iter>;
+  using reference = iter_reference_t<_Iter>;
+};
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_COMMON_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/concepts.h b/app/src/main/cpp/libcxx/include/__iterator/concepts.h
new file mode 100644
index 0000000..d9d40a4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/concepts.h
@@ -0,0 +1,300 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_CONCEPTS_H
+#define _LIBCPP___ITERATOR_CONCEPTS_H
+
+#include <__concepts/arithmetic.h>
+#include <__concepts/assignable.h>
+#include <__concepts/common_reference_with.h>
+#include <__concepts/constructible.h>
+#include <__concepts/copyable.h>
+#include <__concepts/derived_from.h>
+#include <__concepts/equality_comparable.h>
+#include <__concepts/invocable.h>
+#include <__concepts/movable.h>
+#include <__concepts/predicate.h>
+#include <__concepts/regular.h>
+#include <__concepts/relation.h>
+#include <__concepts/same_as.h>
+#include <__concepts/semiregular.h>
+#include <__concepts/totally_ordered.h>
+#include <__config>
+#include <__functional/invoke.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/readable_traits.h>
+#include <__memory/pointer_traits.h>
+#include <__type_traits/add_pointer.h>
+#include <__type_traits/common_reference.h>
+#include <__type_traits/is_pointer.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [iterator.concept.readable]
+template<class _In>
+concept __indirectly_readable_impl =
+  requires(const _In __i) {
+    typename iter_value_t<_In>;
+    typename iter_reference_t<_In>;
+    typename iter_rvalue_reference_t<_In>;
+    { *__i } -> same_as<iter_reference_t<_In>>;
+    { ranges::iter_move(__i) } -> same_as<iter_rvalue_reference_t<_In>>;
+  } &&
+  common_reference_with<iter_reference_t<_In>&&, iter_value_t<_In>&> &&
+  common_reference_with<iter_reference_t<_In>&&, iter_rvalue_reference_t<_In>&&> &&
+  common_reference_with<iter_rvalue_reference_t<_In>&&, const iter_value_t<_In>&>;
+
+template<class _In>
+concept indirectly_readable = __indirectly_readable_impl<remove_cvref_t<_In>>;
+
+template<indirectly_readable _Tp>
+using iter_common_reference_t = common_reference_t<iter_reference_t<_Tp>, iter_value_t<_Tp>&>;
+
+// [iterator.concept.writable]
+template<class _Out, class _Tp>
+concept indirectly_writable =
+  requires(_Out&& __o, _Tp&& __t) {
+    *__o = _VSTD::forward<_Tp>(__t);                        // not required to be equality-preserving
+    *_VSTD::forward<_Out>(__o) = _VSTD::forward<_Tp>(__t);  // not required to be equality-preserving
+    const_cast<const iter_reference_t<_Out>&&>(*__o) = _VSTD::forward<_Tp>(__t);                       // not required to be equality-preserving
+    const_cast<const iter_reference_t<_Out>&&>(*_VSTD::forward<_Out>(__o)) = _VSTD::forward<_Tp>(__t); // not required to be equality-preserving
+  };
+
+// [iterator.concept.winc]
+template<class _Tp>
+concept __integer_like = integral<_Tp> && !same_as<_Tp, bool>;
+
+template<class _Tp>
+concept __signed_integer_like = signed_integral<_Tp>;
+
+template<class _Ip>
+concept weakly_incrementable =
+  // TODO: remove this once the clang bug is fixed (bugs.llvm.org/PR48173).
+  !same_as<_Ip, bool> && // Currently, clang does not handle bool correctly.
+  movable<_Ip> &&
+  requires(_Ip __i) {
+    typename iter_difference_t<_Ip>;
+    requires __signed_integer_like<iter_difference_t<_Ip>>;
+    { ++__i } -> same_as<_Ip&>;   // not required to be equality-preserving
+    __i++;                        // not required to be equality-preserving
+  };
+
+// [iterator.concept.inc]
+template<class _Ip>
+concept incrementable =
+  regular<_Ip> &&
+  weakly_incrementable<_Ip> &&
+  requires(_Ip __i) {
+    { __i++ } -> same_as<_Ip>;
+  };
+
+// [iterator.concept.iterator]
+template<class _Ip>
+concept input_or_output_iterator =
+  requires(_Ip __i) {
+    { *__i } -> __can_reference;
+  } &&
+  weakly_incrementable<_Ip>;
+
+// [iterator.concept.sentinel]
+template<class _Sp, class _Ip>
+concept sentinel_for =
+  semiregular<_Sp> &&
+  input_or_output_iterator<_Ip> &&
+  __weakly_equality_comparable_with<_Sp, _Ip>;
+
+template<class, class>
+inline constexpr bool disable_sized_sentinel_for = false;
+
+template<class _Sp, class _Ip>
+concept sized_sentinel_for =
+  sentinel_for<_Sp, _Ip> &&
+  !disable_sized_sentinel_for<remove_cv_t<_Sp>, remove_cv_t<_Ip>> &&
+  requires(const _Ip& __i, const _Sp& __s) {
+    { __s - __i } -> same_as<iter_difference_t<_Ip>>;
+    { __i - __s } -> same_as<iter_difference_t<_Ip>>;
+  };
+
+// [iterator.concept.input]
+template<class _Ip>
+concept input_iterator =
+  input_or_output_iterator<_Ip> &&
+  indirectly_readable<_Ip> &&
+  requires { typename _ITER_CONCEPT<_Ip>; } &&
+  derived_from<_ITER_CONCEPT<_Ip>, input_iterator_tag>;
+
+// [iterator.concept.output]
+template<class _Ip, class _Tp>
+concept output_iterator =
+  input_or_output_iterator<_Ip> &&
+  indirectly_writable<_Ip, _Tp> &&
+  requires (_Ip __it, _Tp&& __t) {
+    *__it++ = _VSTD::forward<_Tp>(__t); // not required to be equality-preserving
+  };
+
+// [iterator.concept.forward]
+template<class _Ip>
+concept forward_iterator =
+  input_iterator<_Ip> &&
+  derived_from<_ITER_CONCEPT<_Ip>, forward_iterator_tag> &&
+  incrementable<_Ip> &&
+  sentinel_for<_Ip, _Ip>;
+
+// [iterator.concept.bidir]
+template<class _Ip>
+concept bidirectional_iterator =
+  forward_iterator<_Ip> &&
+  derived_from<_ITER_CONCEPT<_Ip>, bidirectional_iterator_tag> &&
+  requires(_Ip __i) {
+    { --__i } -> same_as<_Ip&>;
+    { __i-- } -> same_as<_Ip>;
+  };
+
+template<class _Ip>
+concept random_access_iterator =
+  bidirectional_iterator<_Ip> &&
+  derived_from<_ITER_CONCEPT<_Ip>, random_access_iterator_tag> &&
+  totally_ordered<_Ip> &&
+  sized_sentinel_for<_Ip, _Ip> &&
+  requires(_Ip __i, const _Ip __j, const iter_difference_t<_Ip> __n) {
+    { __i += __n } -> same_as<_Ip&>;
+    { __j +  __n } -> same_as<_Ip>;
+    { __n +  __j } -> same_as<_Ip>;
+    { __i -= __n } -> same_as<_Ip&>;
+    { __j -  __n } -> same_as<_Ip>;
+    {  __j[__n]  } -> same_as<iter_reference_t<_Ip>>;
+  };
+
+template<class _Ip>
+concept contiguous_iterator =
+  random_access_iterator<_Ip> &&
+  derived_from<_ITER_CONCEPT<_Ip>, contiguous_iterator_tag> &&
+  is_lvalue_reference_v<iter_reference_t<_Ip>> &&
+  same_as<iter_value_t<_Ip>, remove_cvref_t<iter_reference_t<_Ip>>> &&
+  requires(const _Ip& __i) {
+    { _VSTD::to_address(__i) } -> same_as<add_pointer_t<iter_reference_t<_Ip>>>;
+  };
+
+template<class _Ip>
+concept __has_arrow = input_iterator<_Ip> && (is_pointer_v<_Ip> || requires(_Ip __i) { __i.operator->(); });
+
+// [indirectcallable.indirectinvocable]
+template<class _Fp, class _It>
+concept indirectly_unary_invocable =
+  indirectly_readable<_It> &&
+  copy_constructible<_Fp> &&
+  invocable<_Fp&, iter_value_t<_It>&> &&
+  invocable<_Fp&, iter_reference_t<_It>> &&
+  invocable<_Fp&, iter_common_reference_t<_It>> &&
+  common_reference_with<
+    invoke_result_t<_Fp&, iter_value_t<_It>&>,
+    invoke_result_t<_Fp&, iter_reference_t<_It>>>;
+
+template<class _Fp, class _It>
+concept indirectly_regular_unary_invocable =
+  indirectly_readable<_It> &&
+  copy_constructible<_Fp> &&
+  regular_invocable<_Fp&, iter_value_t<_It>&> &&
+  regular_invocable<_Fp&, iter_reference_t<_It>> &&
+  regular_invocable<_Fp&, iter_common_reference_t<_It>> &&
+  common_reference_with<
+    invoke_result_t<_Fp&, iter_value_t<_It>&>,
+    invoke_result_t<_Fp&, iter_reference_t<_It>>>;
+
+template<class _Fp, class _It>
+concept indirect_unary_predicate =
+  indirectly_readable<_It> &&
+  copy_constructible<_Fp> &&
+  predicate<_Fp&, iter_value_t<_It>&> &&
+  predicate<_Fp&, iter_reference_t<_It>> &&
+  predicate<_Fp&, iter_common_reference_t<_It>>;
+
+template<class _Fp, class _It1, class _It2>
+concept indirect_binary_predicate =
+  indirectly_readable<_It1> && indirectly_readable<_It2> &&
+  copy_constructible<_Fp> &&
+  predicate<_Fp&, iter_value_t<_It1>&, iter_value_t<_It2>&> &&
+  predicate<_Fp&, iter_value_t<_It1>&, iter_reference_t<_It2>> &&
+  predicate<_Fp&, iter_reference_t<_It1>, iter_value_t<_It2>&> &&
+  predicate<_Fp&, iter_reference_t<_It1>, iter_reference_t<_It2>> &&
+  predicate<_Fp&, iter_common_reference_t<_It1>, iter_common_reference_t<_It2>>;
+
+template<class _Fp, class _It1, class _It2 = _It1>
+concept indirect_equivalence_relation =
+  indirectly_readable<_It1> && indirectly_readable<_It2> &&
+  copy_constructible<_Fp> &&
+  equivalence_relation<_Fp&, iter_value_t<_It1>&, iter_value_t<_It2>&> &&
+  equivalence_relation<_Fp&, iter_value_t<_It1>&, iter_reference_t<_It2>> &&
+  equivalence_relation<_Fp&, iter_reference_t<_It1>, iter_value_t<_It2>&> &&
+  equivalence_relation<_Fp&, iter_reference_t<_It1>, iter_reference_t<_It2>> &&
+  equivalence_relation<_Fp&, iter_common_reference_t<_It1>, iter_common_reference_t<_It2>>;
+
+template<class _Fp, class _It1, class _It2 = _It1>
+concept indirect_strict_weak_order =
+  indirectly_readable<_It1> && indirectly_readable<_It2> &&
+  copy_constructible<_Fp> &&
+  strict_weak_order<_Fp&, iter_value_t<_It1>&, iter_value_t<_It2>&> &&
+  strict_weak_order<_Fp&, iter_value_t<_It1>&, iter_reference_t<_It2>> &&
+  strict_weak_order<_Fp&, iter_reference_t<_It1>, iter_value_t<_It2>&> &&
+  strict_weak_order<_Fp&, iter_reference_t<_It1>, iter_reference_t<_It2>> &&
+  strict_weak_order<_Fp&, iter_common_reference_t<_It1>, iter_common_reference_t<_It2>>;
+
+template<class _Fp, class... _Its>
+  requires (indirectly_readable<_Its> && ...) && invocable<_Fp, iter_reference_t<_Its>...>
+using indirect_result_t = invoke_result_t<_Fp, iter_reference_t<_Its>...>;
+
+template<class _In, class _Out>
+concept indirectly_movable =
+  indirectly_readable<_In> &&
+  indirectly_writable<_Out, iter_rvalue_reference_t<_In>>;
+
+template<class _In, class _Out>
+concept indirectly_movable_storable =
+  indirectly_movable<_In, _Out> &&
+  indirectly_writable<_Out, iter_value_t<_In>> &&
+  movable<iter_value_t<_In>> &&
+  constructible_from<iter_value_t<_In>, iter_rvalue_reference_t<_In>> &&
+  assignable_from<iter_value_t<_In>&, iter_rvalue_reference_t<_In>>;
+
+template<class _In, class _Out>
+concept indirectly_copyable =
+  indirectly_readable<_In> &&
+  indirectly_writable<_Out, iter_reference_t<_In>>;
+
+template<class _In, class _Out>
+concept indirectly_copyable_storable =
+  indirectly_copyable<_In, _Out> &&
+  indirectly_writable<_Out, iter_value_t<_In>&> &&
+  indirectly_writable<_Out, const iter_value_t<_In>&> &&
+  indirectly_writable<_Out, iter_value_t<_In>&&> &&
+  indirectly_writable<_Out, const iter_value_t<_In>&&> &&
+  copyable<iter_value_t<_In>> &&
+  constructible_from<iter_value_t<_In>, iter_reference_t<_In>> &&
+  assignable_from<iter_value_t<_In>&, iter_reference_t<_In>>;
+
+// Note: indirectly_swappable is located in iter_swap.h to prevent a dependency cycle
+// (both iter_swap and indirectly_swappable require indirectly_readable).
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_CONCEPTS_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/counted_iterator.h b/app/src/main/cpp/libcxx/include/__iterator/counted_iterator.h
new file mode 100644
index 0000000..5fdbff4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/counted_iterator.h
@@ -0,0 +1,310 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_COUNTED_ITERATOR_H
+#define _LIBCPP___ITERATOR_COUNTED_ITERATOR_H
+
+#include <__assert>
+#include <__concepts/assignable.h>
+#include <__concepts/common_with.h>
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/default_sentinel.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iter_swap.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/readable_traits.h>
+#include <__memory/pointer_traits.h>
+#include <__type_traits/add_pointer.h>
+#include <__type_traits/conditional.h>
+#include <__utility/move.h>
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template<class>
+struct __counted_iterator_concept {};
+
+template<class _Iter>
+  requires requires { typename _Iter::iterator_concept; }
+struct __counted_iterator_concept<_Iter> {
+  using iterator_concept = typename _Iter::iterator_concept;
+};
+
+template<class>
+struct __counted_iterator_category {};
+
+template<class _Iter>
+  requires requires { typename _Iter::iterator_category; }
+struct __counted_iterator_category<_Iter> {
+  using iterator_category = typename _Iter::iterator_category;
+};
+
+template<class>
+struct __counted_iterator_value_type {};
+
+template<indirectly_readable _Iter>
+struct __counted_iterator_value_type<_Iter> {
+  using value_type = iter_value_t<_Iter>;
+};
+
+template<input_or_output_iterator _Iter>
+class counted_iterator
+  : public __counted_iterator_concept<_Iter>
+  , public __counted_iterator_category<_Iter>
+  , public __counted_iterator_value_type<_Iter>
+{
+public:
+  _LIBCPP_NO_UNIQUE_ADDRESS _Iter __current_ = _Iter();
+  iter_difference_t<_Iter> __count_ = 0;
+
+  using iterator_type = _Iter;
+  using difference_type = iter_difference_t<_Iter>;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr counted_iterator() requires default_initializable<_Iter> = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr counted_iterator(_Iter __iter, iter_difference_t<_Iter> __n)
+   : __current_(_VSTD::move(__iter)), __count_(__n) {
+    _LIBCPP_ASSERT(__n >= 0, "__n must not be negative.");
+  }
+
+  template<class _I2>
+    requires convertible_to<const _I2&, _Iter>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr counted_iterator(const counted_iterator<_I2>& __other)
+   : __current_(__other.__current_), __count_(__other.__count_) {}
+
+  template<class _I2>
+    requires assignable_from<_Iter&, const _I2&>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr counted_iterator& operator=(const counted_iterator<_I2>& __other) {
+    __current_ = __other.__current_;
+    __count_ = __other.__count_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr const _Iter& base() const& noexcept { return __current_; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _Iter base() && { return _VSTD::move(__current_); }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr iter_difference_t<_Iter> count() const noexcept { return __count_; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr decltype(auto) operator*() {
+    _LIBCPP_ASSERT(__count_ > 0, "Iterator is equal to or past end.");
+    return *__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr decltype(auto) operator*() const
+    requires __dereferenceable<const _Iter>
+  {
+    _LIBCPP_ASSERT(__count_ > 0, "Iterator is equal to or past end.");
+    return *__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator->() const noexcept
+    requires contiguous_iterator<_Iter>
+  {
+    return _VSTD::to_address(__current_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr counted_iterator& operator++() {
+    _LIBCPP_ASSERT(__count_ > 0, "Iterator already at or past end.");
+    ++__current_;
+    --__count_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  decltype(auto) operator++(int) {
+    _LIBCPP_ASSERT(__count_ > 0, "Iterator already at or past end.");
+    --__count_;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try { return __current_++; }
+    catch(...) { ++__count_; throw; }
+#else
+    return __current_++;
+#endif // _LIBCPP_NO_EXCEPTIONS
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr counted_iterator operator++(int)
+    requires forward_iterator<_Iter>
+  {
+    _LIBCPP_ASSERT(__count_ > 0, "Iterator already at or past end.");
+    counted_iterator __tmp = *this;
+    ++*this;
+    return __tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr counted_iterator& operator--()
+    requires bidirectional_iterator<_Iter>
+  {
+    --__current_;
+    ++__count_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr counted_iterator operator--(int)
+    requires bidirectional_iterator<_Iter>
+  {
+    counted_iterator __tmp = *this;
+    --*this;
+    return __tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr counted_iterator operator+(iter_difference_t<_Iter> __n) const
+    requires random_access_iterator<_Iter>
+  {
+    return counted_iterator(__current_ + __n, __count_ - __n);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr counted_iterator operator+(
+    iter_difference_t<_Iter> __n, const counted_iterator& __x)
+    requires random_access_iterator<_Iter>
+  {
+    return __x + __n;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr counted_iterator& operator+=(iter_difference_t<_Iter> __n)
+    requires random_access_iterator<_Iter>
+  {
+    _LIBCPP_ASSERT(__n <= __count_, "Cannot advance iterator past end.");
+    __current_ += __n;
+    __count_ -= __n;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr counted_iterator operator-(iter_difference_t<_Iter> __n) const
+    requires random_access_iterator<_Iter>
+  {
+    return counted_iterator(__current_ - __n, __count_ + __n);
+  }
+
+  template<common_with<_Iter> _I2>
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr iter_difference_t<_I2> operator-(
+    const counted_iterator& __lhs, const counted_iterator<_I2>& __rhs)
+  {
+    return __rhs.__count_ - __lhs.__count_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr iter_difference_t<_Iter> operator-(
+    const counted_iterator& __lhs, default_sentinel_t)
+  {
+    return -__lhs.__count_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr iter_difference_t<_Iter> operator-(
+    default_sentinel_t, const counted_iterator& __rhs)
+  {
+    return __rhs.__count_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr counted_iterator& operator-=(iter_difference_t<_Iter> __n)
+    requires random_access_iterator<_Iter>
+  {
+    _LIBCPP_ASSERT(-__n <= __count_, "Attempt to subtract too large of a size: "
+                                     "counted_iterator would be decremented before the "
+                                     "first element of its range.");
+    __current_ -= __n;
+    __count_ += __n;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr decltype(auto) operator[](iter_difference_t<_Iter> __n) const
+    requires random_access_iterator<_Iter>
+  {
+    _LIBCPP_ASSERT(__n < __count_, "Subscript argument must be less than size.");
+    return __current_[__n];
+  }
+
+  template<common_with<_Iter> _I2>
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(
+    const counted_iterator& __lhs, const counted_iterator<_I2>& __rhs)
+  {
+    return __lhs.__count_ == __rhs.__count_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(
+    const counted_iterator& __lhs, default_sentinel_t)
+  {
+    return __lhs.__count_ == 0;
+  }
+
+  template<common_with<_Iter> _I2>
+  _LIBCPP_HIDE_FROM_ABI friend constexpr strong_ordering operator<=>(
+    const counted_iterator& __lhs, const counted_iterator<_I2>& __rhs)
+  {
+    return __rhs.__count_ <=> __lhs.__count_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr iter_rvalue_reference_t<_Iter> iter_move(const counted_iterator& __i)
+    noexcept(noexcept(ranges::iter_move(__i.__current_)))
+      requires input_iterator<_Iter>
+  {
+    _LIBCPP_ASSERT(__i.__count_ > 0, "Iterator must not be past end of range.");
+    return ranges::iter_move(__i.__current_);
+  }
+
+  template<indirectly_swappable<_Iter> _I2>
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr void iter_swap(const counted_iterator& __x, const counted_iterator<_I2>& __y)
+    noexcept(noexcept(ranges::iter_swap(__x.__current_, __y.__current_)))
+  {
+    _LIBCPP_ASSERT(__x.__count_ > 0 && __y.__count_ > 0,
+                   "Iterators must not be past end of range.");
+    return ranges::iter_swap(__x.__current_, __y.__current_);
+  }
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(counted_iterator);
+
+template<input_iterator _Iter>
+  requires same_as<_ITER_TRAITS<_Iter>, iterator_traits<_Iter>>
+struct iterator_traits<counted_iterator<_Iter>> : iterator_traits<_Iter> {
+  using pointer = conditional_t<contiguous_iterator<_Iter>,
+                                add_pointer_t<iter_reference_t<_Iter>>, void>;
+};
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_COUNTED_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/data.h b/app/src/main/cpp/libcxx/include/__iterator/data.h
new file mode 100644
index 0000000..88eb752
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/data.h
@@ -0,0 +1,51 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_DATA_H
+#define _LIBCPP___ITERATOR_DATA_H
+
+#include <__config>
+#include <cstddef>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _Cont> constexpr
+_LIBCPP_INLINE_VISIBILITY
+auto data(_Cont& __c)
+_NOEXCEPT_(noexcept(__c.data()))
+-> decltype        (__c.data())
+{ return            __c.data(); }
+
+template <class _Cont> constexpr
+_LIBCPP_INLINE_VISIBILITY
+auto data(const _Cont& __c)
+_NOEXCEPT_(noexcept(__c.data()))
+-> decltype        (__c.data())
+{ return            __c.data(); }
+
+template <class _Tp, size_t _Sz>
+_LIBCPP_INLINE_VISIBILITY
+constexpr _Tp* data(_Tp (&__array)[_Sz]) noexcept { return __array; }
+
+template <class _Ep>
+_LIBCPP_INLINE_VISIBILITY
+constexpr const _Ep* data(initializer_list<_Ep> __il) noexcept { return __il.begin(); }
+
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_DATA_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/default_sentinel.h b/app/src/main/cpp/libcxx/include/__iterator/default_sentinel.h
new file mode 100644
index 0000000..669032a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/default_sentinel.h
@@ -0,0 +1,30 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_DEFAULT_SENTINEL_H
+#define _LIBCPP___ITERATOR_DEFAULT_SENTINEL_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+struct default_sentinel_t { };
+inline constexpr default_sentinel_t default_sentinel{};
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_DEFAULT_SENTINEL_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/distance.h b/app/src/main/cpp/libcxx/include/__iterator/distance.h
new file mode 100644
index 0000000..681e20d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/distance.h
@@ -0,0 +1,108 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_DISTANCE_H
+#define _LIBCPP___ITERATOR_DISTANCE_H
+
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/size.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/remove_cvref.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIter>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+typename iterator_traits<_InputIter>::difference_type
+__distance(_InputIter __first, _InputIter __last, input_iterator_tag)
+{
+    typename iterator_traits<_InputIter>::difference_type __r(0);
+    for (; __first != __last; ++__first)
+        ++__r;
+    return __r;
+}
+
+template <class _RandIter>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+typename iterator_traits<_RandIter>::difference_type
+__distance(_RandIter __first, _RandIter __last, random_access_iterator_tag)
+{
+    return __last - __first;
+}
+
+template <class _InputIter>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+typename iterator_traits<_InputIter>::difference_type
+distance(_InputIter __first, _InputIter __last)
+{
+    return _VSTD::__distance(__first, __last, typename iterator_traits<_InputIter>::iterator_category());
+}
+
+#if _LIBCPP_STD_VER > 17
+
+// [range.iter.op.distance]
+
+namespace ranges {
+namespace __distance {
+
+struct __fn {
+  template<class _Ip, sentinel_for<_Ip> _Sp>
+    requires (!sized_sentinel_for<_Sp, _Ip>)
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr iter_difference_t<_Ip> operator()(_Ip __first, _Sp __last) const {
+    iter_difference_t<_Ip> __n = 0;
+    while (__first != __last) {
+      ++__first;
+      ++__n;
+    }
+    return __n;
+  }
+
+  template<class _Ip, sized_sentinel_for<decay_t<_Ip>> _Sp>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr iter_difference_t<_Ip> operator()(_Ip&& __first, _Sp __last) const {
+    if constexpr (sized_sentinel_for<_Sp, __remove_cvref_t<_Ip>>) {
+      return __last - __first;
+    } else {
+      return __last - decay_t<_Ip>(__first);
+    }
+  }
+
+  template<range _Rp>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr range_difference_t<_Rp> operator()(_Rp&& __r) const {
+    if constexpr (sized_range<_Rp>) {
+      return static_cast<range_difference_t<_Rp>>(ranges::size(__r));
+    } else {
+      return operator()(ranges::begin(__r), ranges::end(__r));
+    }
+  }
+};
+
+} // namespace __distance
+
+inline namespace __cpo {
+  inline constexpr auto distance = __distance::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_DISTANCE_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/empty.h b/app/src/main/cpp/libcxx/include/__iterator/empty.h
new file mode 100644
index 0000000..748ca9e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/empty.h
@@ -0,0 +1,44 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_EMPTY_H
+#define _LIBCPP___ITERATOR_EMPTY_H
+
+#include <__config>
+#include <cstddef>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _Cont>
+_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+constexpr auto empty(const _Cont& __c)
+_NOEXCEPT_(noexcept(__c.empty()))
+-> decltype        (__c.empty())
+{ return            __c.empty(); }
+
+template <class _Tp, size_t _Sz>
+_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+constexpr bool empty(const _Tp (&)[_Sz]) noexcept { return false; }
+
+template <class _Ep>
+_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+constexpr bool empty(initializer_list<_Ep> __il) noexcept { return __il.size() == 0; }
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_EMPTY_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/erase_if_container.h b/app/src/main/cpp/libcxx/include/__iterator/erase_if_container.h
new file mode 100644
index 0000000..d7c71a9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/erase_if_container.h
@@ -0,0 +1,40 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_ERASE_IF_CONTAINER_H
+#define _LIBCPP___ITERATOR_ERASE_IF_CONTAINER_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Container, class _Predicate>
+_LIBCPP_HIDE_FROM_ABI
+typename _Container::size_type
+__libcpp_erase_if_container(_Container& __c, _Predicate& __pred) {
+  typename _Container::size_type __old_size = __c.size();
+
+  const typename _Container::iterator __last = __c.end();
+  for (typename _Container::iterator __iter = __c.begin(); __iter != __last;) {
+    if (__pred(*__iter))
+      __iter = __c.erase(__iter);
+    else
+      ++__iter;
+  }
+
+  return __old_size - __c.size();
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_ERASE_IF_CONTAINER_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/front_insert_iterator.h b/app/src/main/cpp/libcxx/include/__iterator/front_insert_iterator.h
new file mode 100644
index 0000000..e278359
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/front_insert_iterator.h
@@ -0,0 +1,71 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_FRONT_INSERT_ITERATOR_H
+#define _LIBCPP___ITERATOR_FRONT_INSERT_ITERATOR_H
+
+#include <__config>
+#include <__iterator/iterator.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__utility/move.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Container>
+class _LIBCPP_TEMPLATE_VIS front_insert_iterator
+#if _LIBCPP_STD_VER <= 14 || !defined(_LIBCPP_ABI_NO_ITERATOR_BASES)
+    : public iterator<output_iterator_tag, void, void, void, void>
+#endif
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+protected:
+    _Container* container;
+public:
+    typedef output_iterator_tag iterator_category;
+    typedef void value_type;
+#if _LIBCPP_STD_VER > 17
+    typedef ptrdiff_t difference_type;
+#else
+    typedef void difference_type;
+#endif
+    typedef void pointer;
+    typedef void reference;
+    typedef _Container container_type;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit front_insert_iterator(_Container& __x) : container(_VSTD::addressof(__x)) {}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 front_insert_iterator& operator=(const typename _Container::value_type& __value)
+        {container->push_front(__value); return *this;}
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 front_insert_iterator& operator=(typename _Container::value_type&& __value)
+        {container->push_front(_VSTD::move(__value)); return *this;}
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 front_insert_iterator& operator*()     {return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 front_insert_iterator& operator++()    {return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 front_insert_iterator  operator++(int) {return *this;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(front_insert_iterator);
+
+template <class _Container>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+front_insert_iterator<_Container>
+front_inserter(_Container& __x)
+{
+    return front_insert_iterator<_Container>(__x);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_FRONT_INSERT_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/incrementable_traits.h b/app/src/main/cpp/libcxx/include/__iterator/incrementable_traits.h
new file mode 100644
index 0000000..3d06dc0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/incrementable_traits.h
@@ -0,0 +1,78 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_INCREMENTABLE_TRAITS_H
+#define _LIBCPP___ITERATOR_INCREMENTABLE_TRAITS_H
+
+#include <__concepts/arithmetic.h>
+#include <__config>
+#include <__type_traits/conditional.h>
+#include <__type_traits/is_object.h>
+#include <__type_traits/is_primary_template.h>
+#include <__type_traits/make_signed.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/declval.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [incrementable.traits]
+template<class> struct incrementable_traits {};
+
+template<class _Tp>
+requires is_object_v<_Tp>
+struct incrementable_traits<_Tp*> {
+  using difference_type = ptrdiff_t;
+};
+
+template<class _Ip>
+struct incrementable_traits<const _Ip> : incrementable_traits<_Ip> {};
+
+template<class _Tp>
+concept __has_member_difference_type = requires { typename _Tp::difference_type; };
+
+template<__has_member_difference_type _Tp>
+struct incrementable_traits<_Tp> {
+  using difference_type = typename _Tp::difference_type;
+};
+
+template<class _Tp>
+concept __has_integral_minus =
+  requires(const _Tp& __x, const _Tp& __y) {
+    { __x - __y } -> integral;
+  };
+
+template<__has_integral_minus _Tp>
+requires (!__has_member_difference_type<_Tp>)
+struct incrementable_traits<_Tp> {
+  using difference_type = make_signed_t<decltype(std::declval<_Tp>() - std::declval<_Tp>())>;
+};
+
+template <class>
+struct iterator_traits;
+
+// Let `RI` be `remove_cvref_t<I>`. The type `iter_difference_t<I>` denotes
+// `incrementable_traits<RI>::difference_type` if `iterator_traits<RI>` names a specialization
+// generated from the primary template, and `iterator_traits<RI>::difference_type` otherwise.
+template <class _Ip>
+using iter_difference_t = typename conditional_t<__is_primary_template<iterator_traits<remove_cvref_t<_Ip> > >::value,
+                                                 incrementable_traits<remove_cvref_t<_Ip> >,
+                                                 iterator_traits<remove_cvref_t<_Ip> > >::difference_type;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_INCREMENTABLE_TRAITS_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/indirectly_comparable.h b/app/src/main/cpp/libcxx/include/__iterator/indirectly_comparable.h
new file mode 100644
index 0000000..868190f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/indirectly_comparable.h
@@ -0,0 +1,34 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_INDIRECTLY_COMPARABLE_H
+#define _LIBCPP___ITERATOR_INDIRECTLY_COMPARABLE_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _I1, class _I2, class _Rp, class _P1 = identity, class _P2 = identity>
+concept indirectly_comparable =
+  indirect_binary_predicate<_Rp, projected<_I1, _P1>, projected<_I2, _P2>>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_INDIRECTLY_COMPARABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/insert_iterator.h b/app/src/main/cpp/libcxx/include/__iterator/insert_iterator.h
new file mode 100644
index 0000000..ecaea61
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/insert_iterator.h
@@ -0,0 +1,81 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_INSERT_ITERATOR_H
+#define _LIBCPP___ITERATOR_INSERT_ITERATOR_H
+
+#include <__config>
+#include <__iterator/iterator.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__ranges/access.h>
+#include <__utility/move.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+template <class _Container>
+using __insert_iterator_iter_t = ranges::iterator_t<_Container>;
+#else
+template <class _Container>
+using __insert_iterator_iter_t = typename _Container::iterator;
+#endif
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Container>
+class _LIBCPP_TEMPLATE_VIS insert_iterator
+#if _LIBCPP_STD_VER <= 14 || !defined(_LIBCPP_ABI_NO_ITERATOR_BASES)
+    : public iterator<output_iterator_tag, void, void, void, void>
+#endif
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+protected:
+    _Container* container;
+    __insert_iterator_iter_t<_Container> iter;
+public:
+    typedef output_iterator_tag iterator_category;
+    typedef void value_type;
+#if _LIBCPP_STD_VER > 17
+    typedef ptrdiff_t difference_type;
+#else
+    typedef void difference_type;
+#endif
+    typedef void pointer;
+    typedef void reference;
+    typedef _Container container_type;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 insert_iterator(_Container& __x, __insert_iterator_iter_t<_Container> __i)
+        : container(_VSTD::addressof(__x)), iter(__i) {}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 insert_iterator& operator=(const typename _Container::value_type& __value)
+        {iter = container->insert(iter, __value); ++iter; return *this;}
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 insert_iterator& operator=(typename _Container::value_type&& __value)
+        {iter = container->insert(iter, _VSTD::move(__value)); ++iter; return *this;}
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 insert_iterator& operator*()        {return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 insert_iterator& operator++()       {return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 insert_iterator& operator++(int)    {return *this;}
+};
+
+template <class _Container>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+insert_iterator<_Container>
+inserter(_Container& __x, __insert_iterator_iter_t<_Container> __i)
+{
+    return insert_iterator<_Container>(__x, __i);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_INSERT_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/istream_iterator.h b/app/src/main/cpp/libcxx/include/__iterator/istream_iterator.h
new file mode 100644
index 0000000..a056961
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/istream_iterator.h
@@ -0,0 +1,105 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_ISTREAM_ITERATOR_H
+#define _LIBCPP___ITERATOR_ISTREAM_ITERATOR_H
+
+#include <__config>
+#include <__iterator/default_sentinel.h>
+#include <__iterator/iterator.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <cstddef>
+#include <iosfwd> // for forward declarations of char_traits and basic_istream
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Tp, class _CharT = char,
+          class _Traits = char_traits<_CharT>, class _Distance = ptrdiff_t>
+class _LIBCPP_TEMPLATE_VIS istream_iterator
+#if _LIBCPP_STD_VER <= 14 || !defined(_LIBCPP_ABI_NO_ITERATOR_BASES)
+    : public iterator<input_iterator_tag, _Tp, _Distance, const _Tp*, const _Tp&>
+#endif
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+public:
+    typedef input_iterator_tag iterator_category;
+    typedef _Tp value_type;
+    typedef _Distance difference_type;
+    typedef const _Tp* pointer;
+    typedef const _Tp& reference;
+    typedef _CharT char_type;
+    typedef _Traits traits_type;
+    typedef basic_istream<_CharT,_Traits> istream_type;
+private:
+    istream_type* __in_stream_;
+    _Tp __value_;
+public:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR istream_iterator() : __in_stream_(nullptr), __value_() {}
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_HIDE_FROM_ABI constexpr istream_iterator(default_sentinel_t) : istream_iterator() {}
+#endif // _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY istream_iterator(istream_type& __s) : __in_stream_(_VSTD::addressof(__s))
+        {
+            if (!(*__in_stream_ >> __value_))
+                __in_stream_ = nullptr;
+        }
+
+    _LIBCPP_INLINE_VISIBILITY const _Tp& operator*() const {return __value_;}
+    _LIBCPP_INLINE_VISIBILITY const _Tp* operator->() const {return _VSTD::addressof((operator*()));}
+    _LIBCPP_INLINE_VISIBILITY istream_iterator& operator++()
+        {
+            if (!(*__in_stream_ >> __value_))
+                __in_stream_ = nullptr;
+            return *this;
+        }
+    _LIBCPP_INLINE_VISIBILITY istream_iterator  operator++(int)
+        {istream_iterator __t(*this); ++(*this); return __t;}
+
+    template <class _Up, class _CharU, class _TraitsU, class _DistanceU>
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool
+    operator==(const istream_iterator<_Up, _CharU, _TraitsU, _DistanceU>& __x,
+               const istream_iterator<_Up, _CharU, _TraitsU, _DistanceU>& __y);
+
+#if _LIBCPP_STD_VER > 17
+    friend _LIBCPP_HIDE_FROM_ABI bool operator==(const istream_iterator& __i, default_sentinel_t) {
+      return __i.__in_stream_ == nullptr;
+    }
+#endif // _LIBCPP_STD_VER > 17
+};
+
+template <class _Tp, class _CharT, class _Traits, class _Distance>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const istream_iterator<_Tp, _CharT, _Traits, _Distance>& __x,
+           const istream_iterator<_Tp, _CharT, _Traits, _Distance>& __y)
+{
+    return __x.__in_stream_ == __y.__in_stream_;
+}
+
+#if _LIBCPP_STD_VER <= 17
+template <class _Tp, class _CharT, class _Traits, class _Distance>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Distance>& __x,
+           const istream_iterator<_Tp, _CharT, _Traits, _Distance>& __y)
+{
+    return !(__x == __y);
+}
+#endif // _LIBCPP_STD_VER <= 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_ISTREAM_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/istreambuf_iterator.h b/app/src/main/cpp/libcxx/include/__iterator/istreambuf_iterator.h
new file mode 100644
index 0000000..bc53a6a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/istreambuf_iterator.h
@@ -0,0 +1,119 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_ISTREAMBUF_ITERATOR_H
+#define _LIBCPP___ITERATOR_ISTREAMBUF_ITERATOR_H
+
+#include <__config>
+#include <__iterator/default_sentinel.h>
+#include <__iterator/iterator.h>
+#include <__iterator/iterator_traits.h>
+#include <iosfwd> // for forward declaration of basic_streambuf
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template<class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS istreambuf_iterator
+#if _LIBCPP_STD_VER <= 14 || !defined(_LIBCPP_ABI_NO_ITERATOR_BASES)
+    : public iterator<input_iterator_tag, _CharT,
+                      typename _Traits::off_type, _CharT*,
+                      _CharT>
+#endif
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+public:
+    typedef input_iterator_tag              iterator_category;
+    typedef _CharT                          value_type;
+    typedef typename _Traits::off_type      difference_type;
+    typedef _CharT*                         pointer;
+    typedef _CharT                          reference;
+    typedef _CharT                          char_type;
+    typedef _Traits                         traits_type;
+    typedef typename _Traits::int_type      int_type;
+    typedef basic_streambuf<_CharT,_Traits> streambuf_type;
+    typedef basic_istream<_CharT,_Traits>   istream_type;
+private:
+    mutable streambuf_type* __sbuf_;
+
+    class __proxy
+    {
+        char_type __keep_;
+        streambuf_type* __sbuf_;
+        _LIBCPP_INLINE_VISIBILITY
+        explicit __proxy(char_type __c, streambuf_type* __s)
+            : __keep_(__c), __sbuf_(__s) {}
+        friend class istreambuf_iterator;
+    public:
+        _LIBCPP_INLINE_VISIBILITY char_type operator*() const {return __keep_;}
+    };
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool __test_for_eof() const
+    {
+        if (__sbuf_ && traits_type::eq_int_type(__sbuf_->sgetc(), traits_type::eof()))
+            __sbuf_ = nullptr;
+        return __sbuf_ == nullptr;
+    }
+public:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR istreambuf_iterator() _NOEXCEPT : __sbuf_(nullptr) {}
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY constexpr istreambuf_iterator(default_sentinel_t) noexcept
+        : istreambuf_iterator() {}
+#endif // _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY istreambuf_iterator(istream_type& __s) _NOEXCEPT
+        : __sbuf_(__s.rdbuf()) {}
+    _LIBCPP_INLINE_VISIBILITY istreambuf_iterator(streambuf_type* __s) _NOEXCEPT
+        : __sbuf_(__s) {}
+    _LIBCPP_INLINE_VISIBILITY istreambuf_iterator(const __proxy& __p) _NOEXCEPT
+        : __sbuf_(__p.__sbuf_) {}
+
+    _LIBCPP_INLINE_VISIBILITY char_type  operator*() const
+        {return static_cast<char_type>(__sbuf_->sgetc());}
+    _LIBCPP_INLINE_VISIBILITY istreambuf_iterator& operator++()
+        {
+            __sbuf_->sbumpc();
+            return *this;
+        }
+    _LIBCPP_INLINE_VISIBILITY __proxy              operator++(int)
+        {
+            return __proxy(__sbuf_->sbumpc(), __sbuf_);
+        }
+
+    _LIBCPP_INLINE_VISIBILITY bool equal(const istreambuf_iterator& __b) const
+        {return __test_for_eof() == __b.__test_for_eof();}
+
+#if _LIBCPP_STD_VER > 17
+    friend _LIBCPP_HIDE_FROM_ABI bool operator==(const istreambuf_iterator& __i, default_sentinel_t) {
+      return __i.__test_for_eof();
+    }
+#endif // _LIBCPP_STD_VER > 17
+};
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator==(const istreambuf_iterator<_CharT,_Traits>& __a,
+                const istreambuf_iterator<_CharT,_Traits>& __b)
+                {return __a.equal(__b);}
+
+#if _LIBCPP_STD_VER <= 17
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator!=(const istreambuf_iterator<_CharT,_Traits>& __a,
+                const istreambuf_iterator<_CharT,_Traits>& __b)
+                {return !__a.equal(__b);}
+#endif // _LIBCPP_STD_VER <= 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_ISTREAMBUF_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/iter_move.h b/app/src/main/cpp/libcxx/include/__iterator/iter_move.h
new file mode 100644
index 0000000..a7d9413
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/iter_move.h
@@ -0,0 +1,104 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_ITER_MOVE_H
+#define _LIBCPP___ITERATOR_ITER_MOVE_H
+
+#include <__concepts/class_or_enum.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [iterator.cust.move]
+
+namespace ranges {
+namespace __iter_move {
+
+void iter_move();
+
+template <class _Tp>
+concept __unqualified_iter_move =
+  __class_or_enum<remove_cvref_t<_Tp>> &&
+  requires (_Tp&& __t) {
+    // NOLINTNEXTLINE(libcpp-robust-against-adl) iter_swap ADL calls should only be made through ranges::iter_swap
+    iter_move(std::forward<_Tp>(__t));
+  };
+
+template<class _Tp>
+concept __move_deref =
+  !__unqualified_iter_move<_Tp> &&
+  requires (_Tp&& __t) {
+    *__t;
+    requires is_lvalue_reference_v<decltype(*__t)>;
+  };
+
+template<class _Tp>
+concept __just_deref =
+  !__unqualified_iter_move<_Tp> &&
+  !__move_deref<_Tp> &&
+  requires (_Tp&& __t) {
+    *__t;
+    requires (!is_lvalue_reference_v<decltype(*__t)>);
+  };
+
+// [iterator.cust.move]
+
+struct __fn {
+  // NOLINTBEGIN(libcpp-robust-against-adl) iter_move ADL calls should only be made through ranges::iter_move
+  template<class _Ip>
+    requires __unqualified_iter_move<_Ip>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr decltype(auto) operator()(_Ip&& __i) const
+    noexcept(noexcept(iter_move(std::forward<_Ip>(__i))))
+  {
+    return iter_move(std::forward<_Ip>(__i));
+  }
+  // NOLINTEND(libcpp-robust-against-adl)
+
+  template<class _Ip>
+    requires __move_deref<_Ip>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Ip&& __i) const
+    noexcept(noexcept(std::move(*std::forward<_Ip>(__i))))
+    -> decltype(      std::move(*std::forward<_Ip>(__i)))
+    { return          std::move(*std::forward<_Ip>(__i)); }
+
+  template<class _Ip>
+    requires __just_deref<_Ip>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Ip&& __i) const
+    noexcept(noexcept(*std::forward<_Ip>(__i)))
+    -> decltype(      *std::forward<_Ip>(__i))
+    { return          *std::forward<_Ip>(__i); }
+};
+} // namespace __iter_move
+
+inline namespace __cpo {
+  inline constexpr auto iter_move = __iter_move::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+template<__dereferenceable _Tp>
+  requires requires(_Tp& __t) { { ranges::iter_move(__t) } -> __can_reference; }
+using iter_rvalue_reference_t = decltype(ranges::iter_move(std::declval<_Tp&>()));
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_ITER_MOVE_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/iter_swap.h b/app/src/main/cpp/libcxx/include/__iterator/iter_swap.h
new file mode 100644
index 0000000..d4c0dca
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/iter_swap.h
@@ -0,0 +1,113 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_ITER_SWAP_H
+#define _LIBCPP___ITERATOR_ITER_SWAP_H
+
+#include <__concepts/class_or_enum.h>
+#include <__concepts/swappable.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/readable_traits.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [iter.cust.swap]
+
+namespace ranges {
+namespace __iter_swap {
+  template<class _I1, class _I2>
+  void iter_swap(_I1, _I2) = delete;
+
+  template<class _T1, class _T2>
+  concept __unqualified_iter_swap =
+    (__class_or_enum<remove_cvref_t<_T1>> || __class_or_enum<remove_cvref_t<_T2>>) &&
+    requires (_T1&& __x, _T2&& __y) {
+      // NOLINTNEXTLINE(libcpp-robust-against-adl) iter_swap ADL calls should only be made through ranges::iter_swap
+      iter_swap(_VSTD::forward<_T1>(__x), _VSTD::forward<_T2>(__y));
+    };
+
+  template<class _T1, class _T2>
+  concept __readable_swappable =
+    indirectly_readable<_T1> && indirectly_readable<_T2> &&
+    swappable_with<iter_reference_t<_T1>, iter_reference_t<_T2>>;
+
+
+  struct __fn {
+    // NOLINTBEGIN(libcpp-robust-against-adl) iter_swap ADL calls should only be made through ranges::iter_swap
+    template <class _T1, class _T2>
+      requires __unqualified_iter_swap<_T1, _T2>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void operator()(_T1&& __x, _T2&& __y) const
+      noexcept(noexcept(iter_swap(_VSTD::forward<_T1>(__x), _VSTD::forward<_T2>(__y))))
+    {
+      (void)iter_swap(_VSTD::forward<_T1>(__x), _VSTD::forward<_T2>(__y));
+    }
+    // NOLINTEND(libcpp-robust-against-adl)
+
+    template <class _T1, class _T2>
+      requires (!__unqualified_iter_swap<_T1, _T2>) &&
+               __readable_swappable<_T1, _T2>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void operator()(_T1&& __x, _T2&& __y) const
+      noexcept(noexcept(ranges::swap(*_VSTD::forward<_T1>(__x), *_VSTD::forward<_T2>(__y))))
+    {
+      ranges::swap(*_VSTD::forward<_T1>(__x), *_VSTD::forward<_T2>(__y));
+    }
+
+    template <class _T1, class _T2>
+      requires (!__unqualified_iter_swap<_T1, _T2> &&
+                !__readable_swappable<_T1, _T2>) &&
+               indirectly_movable_storable<_T1, _T2> &&
+               indirectly_movable_storable<_T2, _T1>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void operator()(_T1&& __x, _T2&& __y) const
+      noexcept(noexcept(iter_value_t<_T2>(ranges::iter_move(__y))) &&
+               noexcept(*__y = ranges::iter_move(__x)) &&
+               noexcept(*_VSTD::forward<_T1>(__x) = std::declval<iter_value_t<_T2>>()))
+    {
+      iter_value_t<_T2> __old(ranges::iter_move(__y));
+      *__y = ranges::iter_move(__x);
+      *_VSTD::forward<_T1>(__x) = _VSTD::move(__old);
+    }
+  };
+} // namespace __iter_swap
+
+inline namespace __cpo {
+  inline constexpr auto iter_swap = __iter_swap::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+template<class _I1, class _I2 = _I1>
+concept indirectly_swappable =
+  indirectly_readable<_I1> && indirectly_readable<_I2> &&
+  requires(const _I1 __i1, const _I2 __i2) {
+    ranges::iter_swap(__i1, __i1);
+    ranges::iter_swap(__i2, __i2);
+    ranges::iter_swap(__i1, __i2);
+    ranges::iter_swap(__i2, __i1);
+  };
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_ITER_SWAP_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/iterator.h b/app/src/main/cpp/libcxx/include/__iterator/iterator.h
new file mode 100644
index 0000000..b417eea
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/iterator.h
@@ -0,0 +1,35 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_ITERATOR_H
+#define _LIBCPP___ITERATOR_ITERATOR_H
+
+#include <__config>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Category, class _Tp, class _Distance = ptrdiff_t,
+         class _Pointer = _Tp*, class _Reference = _Tp&>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX17 iterator
+{
+    typedef _Tp        value_type;
+    typedef _Distance  difference_type;
+    typedef _Pointer   pointer;
+    typedef _Reference reference;
+    typedef _Category  iterator_category;
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/iterator_traits.h b/app/src/main/cpp/libcxx/include/__iterator/iterator_traits.h
new file mode 100644
index 0000000..c9d8944
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/iterator_traits.h
@@ -0,0 +1,539 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_ITERATOR_TRAITS_H
+#define _LIBCPP___ITERATOR_ITERATOR_TRAITS_H
+
+#include <__concepts/arithmetic.h>
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/copyable.h>
+#include <__concepts/equality_comparable.h>
+#include <__concepts/same_as.h>
+#include <__concepts/totally_ordered.h>
+#include <__config>
+#include <__fwd/pair.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/readable_traits.h>
+#include <__type_traits/add_const.h>
+#include <__type_traits/common_reference.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/disjunction.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_object.h>
+#include <__type_traits/is_primary_template.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/is_valid_expansion.h>
+#include <__type_traits/remove_const.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/remove_cvref.h>
+#include <__type_traits/void_t.h>
+#include <__utility/declval.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _Tp>
+using __with_reference = _Tp&;
+
+template <class _Tp>
+concept __can_reference = requires {
+  typename __with_reference<_Tp>;
+};
+
+template <class _Tp>
+concept __dereferenceable = requires(_Tp& __t) {
+  { *__t } -> __can_reference; // not required to be equality-preserving
+};
+
+// [iterator.traits]
+template<__dereferenceable _Tp>
+using iter_reference_t = decltype(*std::declval<_Tp&>());
+
+#endif // _LIBCPP_STD_VER > 17
+
+template <class _Iter>
+struct _LIBCPP_TEMPLATE_VIS iterator_traits;
+
+struct _LIBCPP_TEMPLATE_VIS input_iterator_tag {};
+struct _LIBCPP_TEMPLATE_VIS output_iterator_tag {};
+struct _LIBCPP_TEMPLATE_VIS forward_iterator_tag       : public input_iterator_tag {};
+struct _LIBCPP_TEMPLATE_VIS bidirectional_iterator_tag : public forward_iterator_tag {};
+struct _LIBCPP_TEMPLATE_VIS random_access_iterator_tag : public bidirectional_iterator_tag {};
+#if _LIBCPP_STD_VER > 17
+struct _LIBCPP_TEMPLATE_VIS contiguous_iterator_tag    : public random_access_iterator_tag {};
+#endif
+
+template <class _Iter>
+struct __iter_traits_cache {
+  using type = _If<
+    __is_primary_template<iterator_traits<_Iter> >::value,
+    _Iter,
+    iterator_traits<_Iter>
+  >;
+};
+template <class _Iter>
+using _ITER_TRAITS = typename __iter_traits_cache<_Iter>::type;
+
+struct __iter_concept_concept_test {
+  template <class _Iter>
+  using _Apply = typename _ITER_TRAITS<_Iter>::iterator_concept;
+};
+struct __iter_concept_category_test {
+  template <class _Iter>
+  using _Apply = typename _ITER_TRAITS<_Iter>::iterator_category;
+};
+struct __iter_concept_random_fallback {
+  template <class _Iter>
+  using _Apply = __enable_if_t<
+                          __is_primary_template<iterator_traits<_Iter> >::value,
+                          random_access_iterator_tag
+                        >;
+};
+
+template <class _Iter, class _Tester> struct __test_iter_concept
+    : _IsValidExpansion<_Tester::template _Apply, _Iter>,
+      _Tester
+{
+};
+
+template <class _Iter>
+struct __iter_concept_cache {
+  using type = _Or<
+    __test_iter_concept<_Iter, __iter_concept_concept_test>,
+    __test_iter_concept<_Iter, __iter_concept_category_test>,
+    __test_iter_concept<_Iter, __iter_concept_random_fallback>
+  >;
+};
+
+template <class _Iter>
+using _ITER_CONCEPT = typename __iter_concept_cache<_Iter>::type::template _Apply<_Iter>;
+
+
+template <class _Tp>
+struct __has_iterator_typedefs
+{
+private:
+    template <class _Up> static false_type __test(...);
+    template <class _Up> static true_type __test(__void_t<typename _Up::iterator_category>* = nullptr,
+                                                 __void_t<typename _Up::difference_type>* = nullptr,
+                                                 __void_t<typename _Up::value_type>* = nullptr,
+                                                 __void_t<typename _Up::reference>* = nullptr,
+                                                 __void_t<typename _Up::pointer>* = nullptr);
+public:
+    static const bool value = decltype(__test<_Tp>(0,0,0,0,0))::value;
+};
+
+
+template <class _Tp>
+struct __has_iterator_category
+{
+private:
+    template <class _Up> static false_type __test(...);
+    template <class _Up> static true_type __test(typename _Up::iterator_category* = nullptr);
+public:
+    static const bool value = decltype(__test<_Tp>(nullptr))::value;
+};
+
+template <class _Tp>
+struct __has_iterator_concept
+{
+private:
+    template <class _Up> static false_type __test(...);
+    template <class _Up> static true_type __test(typename _Up::iterator_concept* = nullptr);
+public:
+    static const bool value = decltype(__test<_Tp>(nullptr))::value;
+};
+
+#if _LIBCPP_STD_VER > 17
+
+// The `cpp17-*-iterator` exposition-only concepts have very similar names to the `Cpp17*Iterator` named requirements
+// from `[iterator.cpp17]`. To avoid confusion between the two, the exposition-only concepts have been banished to
+// a "detail" namespace indicating they have a niche use-case.
+namespace __iterator_traits_detail {
+template<class _Ip>
+concept __cpp17_iterator =
+  requires(_Ip __i) {
+    {   *__i } -> __can_reference;
+    {  ++__i } -> same_as<_Ip&>;
+    { *__i++ } -> __can_reference;
+  } &&
+  copyable<_Ip>;
+
+template<class _Ip>
+concept __cpp17_input_iterator =
+  __cpp17_iterator<_Ip> &&
+  equality_comparable<_Ip> &&
+  requires(_Ip __i) {
+    typename incrementable_traits<_Ip>::difference_type;
+    typename indirectly_readable_traits<_Ip>::value_type;
+    typename common_reference_t<iter_reference_t<_Ip>&&,
+                                typename indirectly_readable_traits<_Ip>::value_type&>;
+    typename common_reference_t<decltype(*__i++)&&,
+                                typename indirectly_readable_traits<_Ip>::value_type&>;
+    requires signed_integral<typename incrementable_traits<_Ip>::difference_type>;
+  };
+
+template<class _Ip>
+concept __cpp17_forward_iterator =
+  __cpp17_input_iterator<_Ip> &&
+  constructible_from<_Ip> &&
+  is_lvalue_reference_v<iter_reference_t<_Ip>> &&
+  same_as<remove_cvref_t<iter_reference_t<_Ip>>,
+          typename indirectly_readable_traits<_Ip>::value_type> &&
+  requires(_Ip __i) {
+    {  __i++ } -> convertible_to<_Ip const&>;
+    { *__i++ } -> same_as<iter_reference_t<_Ip>>;
+  };
+
+template<class _Ip>
+concept __cpp17_bidirectional_iterator =
+  __cpp17_forward_iterator<_Ip> &&
+  requires(_Ip __i) {
+    {  --__i } -> same_as<_Ip&>;
+    {  __i-- } -> convertible_to<_Ip const&>;
+    { *__i-- } -> same_as<iter_reference_t<_Ip>>;
+  };
+
+template<class _Ip>
+concept __cpp17_random_access_iterator =
+  __cpp17_bidirectional_iterator<_Ip> &&
+  totally_ordered<_Ip> &&
+  requires(_Ip __i, typename incrementable_traits<_Ip>::difference_type __n) {
+    { __i += __n } -> same_as<_Ip&>;
+    { __i -= __n } -> same_as<_Ip&>;
+    { __i +  __n } -> same_as<_Ip>;
+    { __n +  __i } -> same_as<_Ip>;
+    { __i -  __n } -> same_as<_Ip>;
+    { __i -  __i } -> same_as<decltype(__n)>; // NOLINT(misc-redundant-expression) ; This is llvm.org/PR54114
+    {  __i[__n]  } -> convertible_to<iter_reference_t<_Ip>>;
+  };
+} // namespace __iterator_traits_detail
+
+template<class _Ip>
+concept __has_member_reference = requires { typename _Ip::reference; };
+
+template<class _Ip>
+concept __has_member_pointer = requires { typename _Ip::pointer; };
+
+template<class _Ip>
+concept __has_member_iterator_category = requires { typename _Ip::iterator_category; };
+
+template<class _Ip>
+concept __specifies_members = requires {
+    typename _Ip::value_type;
+    typename _Ip::difference_type;
+    requires __has_member_reference<_Ip>;
+    requires __has_member_iterator_category<_Ip>;
+  };
+
+template<class>
+struct __iterator_traits_member_pointer_or_void {
+  using type = void;
+};
+
+template<__has_member_pointer _Tp>
+struct __iterator_traits_member_pointer_or_void<_Tp> {
+  using type = typename _Tp::pointer;
+};
+
+template<class _Tp>
+concept __cpp17_iterator_missing_members =
+  !__specifies_members<_Tp> &&
+  __iterator_traits_detail::__cpp17_iterator<_Tp>;
+
+template<class _Tp>
+concept __cpp17_input_iterator_missing_members =
+  __cpp17_iterator_missing_members<_Tp> &&
+  __iterator_traits_detail::__cpp17_input_iterator<_Tp>;
+
+// Otherwise, `pointer` names `void`.
+template<class>
+struct __iterator_traits_member_pointer_or_arrow_or_void { using type = void; };
+
+// [iterator.traits]/3.2.1
+// If the qualified-id `I::pointer` is valid and denotes a type, `pointer` names that type.
+template<__has_member_pointer _Ip>
+struct __iterator_traits_member_pointer_or_arrow_or_void<_Ip> { using type = typename _Ip::pointer; };
+
+// Otherwise, if `decltype(declval<I&>().operator->())` is well-formed, then `pointer` names that
+// type.
+template<class _Ip>
+  requires requires(_Ip& __i) { __i.operator->(); } && (!__has_member_pointer<_Ip>)
+struct __iterator_traits_member_pointer_or_arrow_or_void<_Ip> {
+  using type = decltype(std::declval<_Ip&>().operator->());
+};
+
+// Otherwise, `reference` names `iter-reference-t<I>`.
+template<class _Ip>
+struct __iterator_traits_member_reference { using type = iter_reference_t<_Ip>; };
+
+// [iterator.traits]/3.2.2
+// If the qualified-id `I::reference` is valid and denotes a type, `reference` names that type.
+template<__has_member_reference _Ip>
+struct __iterator_traits_member_reference<_Ip> { using type = typename _Ip::reference; };
+
+// [iterator.traits]/3.2.3.4
+// input_iterator_tag
+template<class _Ip>
+struct __deduce_iterator_category {
+  using type = input_iterator_tag;
+};
+
+// [iterator.traits]/3.2.3.1
+// `random_access_iterator_tag` if `I` satisfies `cpp17-random-access-iterator`, or otherwise
+template<__iterator_traits_detail::__cpp17_random_access_iterator _Ip>
+struct __deduce_iterator_category<_Ip> {
+  using type = random_access_iterator_tag;
+};
+
+// [iterator.traits]/3.2.3.2
+// `bidirectional_iterator_tag` if `I` satisfies `cpp17-bidirectional-iterator`, or otherwise
+template<__iterator_traits_detail::__cpp17_bidirectional_iterator _Ip>
+struct __deduce_iterator_category<_Ip> {
+  using type = bidirectional_iterator_tag;
+};
+
+// [iterator.traits]/3.2.3.3
+// `forward_iterator_tag` if `I` satisfies `cpp17-forward-iterator`, or otherwise
+template<__iterator_traits_detail::__cpp17_forward_iterator _Ip>
+struct __deduce_iterator_category<_Ip> {
+  using type = forward_iterator_tag;
+};
+
+template<class _Ip>
+struct __iterator_traits_iterator_category : __deduce_iterator_category<_Ip> {};
+
+// [iterator.traits]/3.2.3
+// If the qualified-id `I::iterator-category` is valid and denotes a type, `iterator-category` names
+// that type.
+template<__has_member_iterator_category _Ip>
+struct __iterator_traits_iterator_category<_Ip> {
+  using type = typename _Ip::iterator_category;
+};
+
+// otherwise, it names void.
+template<class>
+struct __iterator_traits_difference_type { using type = void; };
+
+// If the qualified-id `incrementable_traits<I>::difference_type` is valid and denotes a type, then
+// `difference_type` names that type;
+template<class _Ip>
+requires requires { typename incrementable_traits<_Ip>::difference_type; }
+struct __iterator_traits_difference_type<_Ip> {
+  using type = typename incrementable_traits<_Ip>::difference_type;
+};
+
+// [iterator.traits]/3.4
+// Otherwise, `iterator_traits<I>` has no members by any of the above names.
+template<class>
+struct __iterator_traits {};
+
+// [iterator.traits]/3.1
+// If `I` has valid ([temp.deduct]) member types `difference-type`, `value-type`, `reference`, and
+// `iterator-category`, then `iterator-traits<I>` has the following publicly accessible members:
+template<__specifies_members _Ip>
+struct __iterator_traits<_Ip> {
+  using iterator_category  = typename _Ip::iterator_category;
+  using value_type         = typename _Ip::value_type;
+  using difference_type    = typename _Ip::difference_type;
+  using pointer            = typename __iterator_traits_member_pointer_or_void<_Ip>::type;
+  using reference          = typename _Ip::reference;
+};
+
+// [iterator.traits]/3.2
+// Otherwise, if `I` satisfies the exposition-only concept `cpp17-input-iterator`,
+// `iterator-traits<I>` has the following publicly accessible members:
+template<__cpp17_input_iterator_missing_members _Ip>
+struct __iterator_traits<_Ip> {
+  using iterator_category = typename __iterator_traits_iterator_category<_Ip>::type;
+  using value_type        = typename indirectly_readable_traits<_Ip>::value_type;
+  using difference_type   = typename incrementable_traits<_Ip>::difference_type;
+  using pointer           = typename __iterator_traits_member_pointer_or_arrow_or_void<_Ip>::type;
+  using reference         = typename __iterator_traits_member_reference<_Ip>::type;
+};
+
+// Otherwise, if `I` satisfies the exposition-only concept `cpp17-iterator`, then
+// `iterator_traits<I>` has the following publicly accessible members:
+template<__cpp17_iterator_missing_members _Ip>
+struct __iterator_traits<_Ip> {
+  using iterator_category = output_iterator_tag;
+  using value_type        = void;
+  using difference_type   = typename __iterator_traits_difference_type<_Ip>::type;
+  using pointer           = void;
+  using reference         = void;
+};
+
+template<class _Ip>
+struct iterator_traits : __iterator_traits<_Ip> {
+  using __primary_template = iterator_traits;
+};
+
+#else // _LIBCPP_STD_VER > 17
+
+template <class _Iter, bool> struct __iterator_traits {};
+
+template <class _Iter, bool> struct __iterator_traits_impl {};
+
+template <class _Iter>
+struct __iterator_traits_impl<_Iter, true>
+{
+    typedef typename _Iter::difference_type   difference_type;
+    typedef typename _Iter::value_type        value_type;
+    typedef typename _Iter::pointer           pointer;
+    typedef typename _Iter::reference         reference;
+    typedef typename _Iter::iterator_category iterator_category;
+};
+
+template <class _Iter>
+struct __iterator_traits<_Iter, true>
+    :  __iterator_traits_impl
+      <
+        _Iter,
+        is_convertible<typename _Iter::iterator_category, input_iterator_tag>::value ||
+        is_convertible<typename _Iter::iterator_category, output_iterator_tag>::value
+      >
+{};
+
+// iterator_traits<Iterator> will only have the nested types if Iterator::iterator_category
+//    exists.  Else iterator_traits<Iterator> will be an empty class.  This is a
+//    conforming extension which allows some programs to compile and behave as
+//    the client expects instead of failing at compile time.
+
+template <class _Iter>
+struct _LIBCPP_TEMPLATE_VIS iterator_traits
+    : __iterator_traits<_Iter, __has_iterator_typedefs<_Iter>::value> {
+
+  using __primary_template = iterator_traits;
+};
+#endif // _LIBCPP_STD_VER > 17
+
+template<class _Tp>
+#if _LIBCPP_STD_VER > 17
+requires is_object_v<_Tp>
+#endif
+struct _LIBCPP_TEMPLATE_VIS iterator_traits<_Tp*>
+{
+    typedef ptrdiff_t difference_type;
+    typedef __remove_cv_t<_Tp> value_type;
+    typedef _Tp* pointer;
+    typedef _Tp& reference;
+    typedef random_access_iterator_tag iterator_category;
+#if _LIBCPP_STD_VER > 17
+    typedef contiguous_iterator_tag    iterator_concept;
+#endif
+};
+
+template <class _Tp, class _Up, bool = __has_iterator_category<iterator_traits<_Tp> >::value>
+struct __has_iterator_category_convertible_to
+    : is_convertible<typename iterator_traits<_Tp>::iterator_category, _Up>
+{};
+
+template <class _Tp, class _Up>
+struct __has_iterator_category_convertible_to<_Tp, _Up, false> : false_type {};
+
+template <class _Tp, class _Up, bool = __has_iterator_concept<_Tp>::value>
+struct __has_iterator_concept_convertible_to
+    : is_convertible<typename _Tp::iterator_concept, _Up>
+{};
+
+template <class _Tp, class _Up>
+struct __has_iterator_concept_convertible_to<_Tp, _Up, false> : false_type {};
+
+template <class _Tp>
+struct __is_cpp17_input_iterator : public __has_iterator_category_convertible_to<_Tp, input_iterator_tag> {};
+
+template <class _Tp>
+struct __is_cpp17_forward_iterator : public __has_iterator_category_convertible_to<_Tp, forward_iterator_tag> {};
+
+template <class _Tp>
+struct __is_cpp17_bidirectional_iterator : public __has_iterator_category_convertible_to<_Tp, bidirectional_iterator_tag> {};
+
+template <class _Tp>
+struct __is_cpp17_random_access_iterator : public __has_iterator_category_convertible_to<_Tp, random_access_iterator_tag> {};
+
+// __is_cpp17_contiguous_iterator determines if an iterator is known by
+// libc++ to be contiguous, either because it advertises itself as such
+// (in C++20) or because it is a pointer type or a known trivial wrapper
+// around a (possibly fancy) pointer type, such as __wrap_iter<T*>.
+// Such iterators receive special "contiguous" optimizations in
+// std::copy and std::sort.
+//
+#if _LIBCPP_STD_VER > 17
+template <class _Tp>
+struct __is_cpp17_contiguous_iterator : _Or<
+    __has_iterator_category_convertible_to<_Tp, contiguous_iterator_tag>,
+    __has_iterator_concept_convertible_to<_Tp, contiguous_iterator_tag>
+> {};
+#else
+template <class _Tp>
+struct __is_cpp17_contiguous_iterator : false_type {};
+#endif
+
+// Any native pointer which is an iterator is also a contiguous iterator.
+template <class _Up>
+struct __is_cpp17_contiguous_iterator<_Up*> : true_type {};
+
+
+template <class _Iter>
+class __wrap_iter;
+
+template <class _Tp>
+struct __is_exactly_cpp17_input_iterator
+    : public integral_constant<bool,
+         __has_iterator_category_convertible_to<_Tp, input_iterator_tag>::value &&
+        !__has_iterator_category_convertible_to<_Tp, forward_iterator_tag>::value> {};
+
+template <class _Tp>
+struct __is_exactly_cpp17_forward_iterator
+    : public integral_constant<bool,
+         __has_iterator_category_convertible_to<_Tp, forward_iterator_tag>::value &&
+        !__has_iterator_category_convertible_to<_Tp, bidirectional_iterator_tag>::value> {};
+
+template <class _Tp>
+struct __is_exactly_cpp17_bidirectional_iterator
+    : public integral_constant<bool,
+         __has_iterator_category_convertible_to<_Tp, bidirectional_iterator_tag>::value &&
+        !__has_iterator_category_convertible_to<_Tp, random_access_iterator_tag>::value> {};
+
+template<class _InputIterator>
+using __iter_value_type = typename iterator_traits<_InputIterator>::value_type;
+
+template<class _InputIterator>
+using __iter_key_type = __remove_const_t<typename iterator_traits<_InputIterator>::value_type::first_type>;
+
+template<class _InputIterator>
+using __iter_mapped_type = typename iterator_traits<_InputIterator>::value_type::second_type;
+
+template<class _InputIterator>
+using __iter_to_alloc_type = pair<
+    typename add_const<typename iterator_traits<_InputIterator>::value_type::first_type>::type,
+    typename iterator_traits<_InputIterator>::value_type::second_type>;
+
+template <class _Iter>
+using __iterator_category_type = typename iterator_traits<_Iter>::iterator_category;
+
+template <class _Iter>
+using __iterator_pointer_type = typename iterator_traits<_Iter>::pointer;
+
+template <class _Iter>
+using __iter_diff_t = typename iterator_traits<_Iter>::difference_type;
+
+template<class _InputIterator>
+using __iter_value_type = typename iterator_traits<_InputIterator>::value_type;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_ITERATOR_TRAITS_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/iterator_with_data.h b/app/src/main/cpp/libcxx/include/__iterator/iterator_with_data.h
new file mode 100644
index 0000000..06c2fa6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/iterator_with_data.h
@@ -0,0 +1,100 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_ITERATOR_WITH_DATA_H
+#define _LIBCPP___ITERATOR_ITERATOR_WITH_DATA_H
+
+#include <__compare/compare_three_way_result.h>
+#include <__compare/three_way_comparable.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iter_swap.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/readable_traits.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER >= 20
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <forward_iterator _Iterator, class _Data>
+class __iterator_with_data {
+  _Iterator __iter_{};
+  _Data __data_{};
+
+public:
+  using value_type      = iter_value_t<_Iterator>;
+  using difference_type = iter_difference_t<_Iterator>;
+
+  _LIBCPP_HIDE_FROM_ABI __iterator_with_data() = default;
+
+  constexpr _LIBCPP_HIDE_FROM_ABI __iterator_with_data(_Iterator __iter, _Data __data)
+      : __iter_(std::move(__iter)), __data_(std::move(__data)) {}
+
+  constexpr _LIBCPP_HIDE_FROM_ABI _Iterator __get_iter() const { return __iter_; }
+
+  constexpr _LIBCPP_HIDE_FROM_ABI _Data __get_data() && { return std::move(__data_); }
+
+  friend constexpr _LIBCPP_HIDE_FROM_ABI bool
+  operator==(const __iterator_with_data& __lhs, const __iterator_with_data& __rhs) {
+    return __lhs.__iter_ == __rhs.__iter_;
+  }
+
+  constexpr _LIBCPP_HIDE_FROM_ABI __iterator_with_data& operator++() {
+    ++__iter_;
+    return *this;
+  }
+
+  constexpr _LIBCPP_HIDE_FROM_ABI __iterator_with_data operator++(int) {
+    auto __tmp = *this;
+    __iter_++;
+    return __tmp;
+  }
+
+  constexpr _LIBCPP_HIDE_FROM_ABI __iterator_with_data& operator--()
+    requires bidirectional_iterator<_Iterator>
+  {
+    --__iter_;
+    return *this;
+  }
+
+  constexpr _LIBCPP_HIDE_FROM_ABI __iterator_with_data operator--(int)
+    requires bidirectional_iterator<_Iterator>
+  {
+    auto __tmp = *this;
+    --__iter_;
+    return __tmp;
+  }
+
+  constexpr _LIBCPP_HIDE_FROM_ABI iter_reference_t<_Iterator> operator*() const { return *__iter_; }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr iter_rvalue_reference_t<_Iterator>
+  iter_move(const __iterator_with_data& __iter) noexcept(noexcept(ranges::iter_move(__iter.__iter_))) {
+    return ranges::iter_move(__iter.__iter_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr void
+  iter_swap(const __iterator_with_data& __lhs,
+            const __iterator_with_data& __rhs) noexcept(noexcept(ranges::iter_swap(__lhs.__iter_, __rhs.__iter_)))
+    requires indirectly_swappable<_Iterator>
+  {
+    return ranges::iter_swap(__lhs.__data_, __rhs.__iter_);
+  }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 20
+
+#endif // _LIBCPP___ITERATOR_ITERATOR_WITH_DATA_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/mergeable.h b/app/src/main/cpp/libcxx/include/__iterator/mergeable.h
new file mode 100644
index 0000000..b9f2d08
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/mergeable.h
@@ -0,0 +1,41 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_MERGEABLE_H
+#define _LIBCPP___ITERATOR_MERGEABLE_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/projected.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _Input1, class _Input2, class _Output,
+          class _Comp = ranges::less, class _Proj1 = identity, class _Proj2 = identity>
+concept mergeable =
+    input_iterator<_Input1> &&
+    input_iterator<_Input2> &&
+    weakly_incrementable<_Output> &&
+    indirectly_copyable<_Input1, _Output> &&
+    indirectly_copyable<_Input2, _Output> &&
+    indirect_strict_weak_order<_Comp, projected<_Input1, _Proj1>, projected<_Input2, _Proj2>>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_MERGEABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/move_iterator.h b/app/src/main/cpp/libcxx/include/__iterator/move_iterator.h
new file mode 100644
index 0000000..fa806db
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/move_iterator.h
@@ -0,0 +1,335 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_MOVE_ITERATOR_H
+#define _LIBCPP___ITERATOR_MOVE_ITERATOR_H
+
+#include <__compare/compare_three_way_result.h>
+#include <__compare/three_way_comparable.h>
+#include <__concepts/assignable.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/derived_from.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iter_swap.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/move_sentinel.h>
+#include <__iterator/readable_traits.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_assignable.h>
+#include <__type_traits/is_constructible.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/remove_reference.h>
+#include <__utility/declval.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+template<class _Iter, class = void>
+struct __move_iter_category_base {};
+
+template<class _Iter>
+  requires requires { typename iterator_traits<_Iter>::iterator_category; }
+struct __move_iter_category_base<_Iter> {
+    using iterator_category = _If<
+        derived_from<typename iterator_traits<_Iter>::iterator_category, random_access_iterator_tag>,
+        random_access_iterator_tag,
+        typename iterator_traits<_Iter>::iterator_category
+    >;
+};
+
+template<class _Iter, class _Sent>
+concept __move_iter_comparable = requires {
+    { std::declval<const _Iter&>() == std::declval<_Sent>() } -> convertible_to<bool>;
+};
+#endif // _LIBCPP_STD_VER > 17
+
+template <class _Iter>
+class _LIBCPP_TEMPLATE_VIS move_iterator
+#if _LIBCPP_STD_VER > 17
+    : public __move_iter_category_base<_Iter>
+#endif
+{
+public:
+#if _LIBCPP_STD_VER > 17
+    using iterator_type = _Iter;
+    using iterator_concept = input_iterator_tag;
+    // iterator_category is inherited and not always present
+    using value_type = iter_value_t<_Iter>;
+    using difference_type = iter_difference_t<_Iter>;
+    using pointer = _Iter;
+    using reference = iter_rvalue_reference_t<_Iter>;
+#else
+    typedef _Iter iterator_type;
+    typedef _If<
+        __is_cpp17_random_access_iterator<_Iter>::value,
+        random_access_iterator_tag,
+        typename iterator_traits<_Iter>::iterator_category
+    > iterator_category;
+    typedef typename iterator_traits<iterator_type>::value_type value_type;
+    typedef typename iterator_traits<iterator_type>::difference_type difference_type;
+    typedef iterator_type pointer;
+
+    typedef typename iterator_traits<iterator_type>::reference __reference;
+    typedef typename conditional<
+            is_reference<__reference>::value,
+            __libcpp_remove_reference_t<__reference>&&,
+            __reference
+        >::type reference;
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    explicit move_iterator(_Iter __i) : __current_(std::move(__i)) {}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    move_iterator& operator++() { ++__current_; return *this; }
+
+    _LIBCPP_DEPRECATED_IN_CXX20 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    pointer operator->() const { return __current_; }
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    move_iterator() requires is_constructible_v<_Iter> : __current_() {}
+
+    template <class _Up>
+        requires (!_IsSame<_Up, _Iter>::value) && convertible_to<const _Up&, _Iter>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    move_iterator(const move_iterator<_Up>& __u) : __current_(__u.base()) {}
+
+    template <class _Up>
+        requires (!_IsSame<_Up, _Iter>::value) &&
+                 convertible_to<const _Up&, _Iter> &&
+                 assignable_from<_Iter&, const _Up&>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    move_iterator& operator=(const move_iterator<_Up>& __u) {
+        __current_ = __u.base();
+        return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr const _Iter& base() const & noexcept { return __current_; }
+    _LIBCPP_HIDE_FROM_ABI constexpr _Iter base() && { return std::move(__current_); }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    reference operator*() const { return ranges::iter_move(__current_); }
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    reference operator[](difference_type __n) const { return ranges::iter_move(__current_ + __n); }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    auto operator++(int)
+        requires forward_iterator<_Iter>
+    {
+        move_iterator __tmp(*this); ++__current_; return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    void operator++(int) { ++__current_; }
+#else
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    move_iterator() : __current_() {}
+
+    template <class _Up, class = __enable_if_t<
+        !is_same<_Up, _Iter>::value && is_convertible<const _Up&, _Iter>::value
+    > >
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    move_iterator(const move_iterator<_Up>& __u) : __current_(__u.base()) {}
+
+    template <class _Up, class = __enable_if_t<
+        !is_same<_Up, _Iter>::value &&
+        is_convertible<const _Up&, _Iter>::value &&
+        is_assignable<_Iter&, const _Up&>::value
+    > >
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    move_iterator& operator=(const move_iterator<_Up>& __u) {
+        __current_ = __u.base();
+        return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    _Iter base() const { return __current_; }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reference operator*() const { return static_cast<reference>(*__current_); }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reference operator[](difference_type __n) const { return static_cast<reference>(__current_[__n]); }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    move_iterator operator++(int) { move_iterator __tmp(*this); ++__current_; return __tmp; }
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    move_iterator& operator--() { --__current_; return *this; }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    move_iterator operator--(int) { move_iterator __tmp(*this); --__current_; return __tmp; }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    move_iterator operator+(difference_type __n) const { return move_iterator(__current_ + __n); }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    move_iterator& operator+=(difference_type __n) { __current_ += __n; return *this; }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    move_iterator operator-(difference_type __n) const { return move_iterator(__current_ - __n); }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+    move_iterator& operator-=(difference_type __n) { __current_ -= __n; return *this; }
+
+#if _LIBCPP_STD_VER > 17
+    template<sentinel_for<_Iter> _Sent>
+    friend _LIBCPP_HIDE_FROM_ABI constexpr
+    bool operator==(const move_iterator& __x, const move_sentinel<_Sent>& __y)
+        requires __move_iter_comparable<_Iter, _Sent>
+    {
+        return __x.base() == __y.base();
+    }
+
+    template<sized_sentinel_for<_Iter> _Sent>
+    friend _LIBCPP_HIDE_FROM_ABI constexpr
+    iter_difference_t<_Iter> operator-(const move_sentinel<_Sent>& __x, const move_iterator& __y)
+    {
+        return __x.base() - __y.base();
+    }
+
+    template<sized_sentinel_for<_Iter> _Sent>
+    friend _LIBCPP_HIDE_FROM_ABI constexpr
+    iter_difference_t<_Iter> operator-(const move_iterator& __x, const move_sentinel<_Sent>& __y)
+    {
+        return __x.base() - __y.base();
+    }
+
+    friend _LIBCPP_HIDE_FROM_ABI constexpr
+    iter_rvalue_reference_t<_Iter> iter_move(const move_iterator& __i)
+        noexcept(noexcept(ranges::iter_move(__i.__current_)))
+    {
+        return ranges::iter_move(__i.__current_);
+    }
+
+    template<indirectly_swappable<_Iter> _It2>
+    friend _LIBCPP_HIDE_FROM_ABI constexpr
+    void iter_swap(const move_iterator& __x, const move_iterator<_It2>& __y)
+        noexcept(noexcept(ranges::iter_swap(__x.__current_, __y.__current_)))
+    {
+        return ranges::iter_swap(__x.__current_, __y.__current_);
+    }
+#endif // _LIBCPP_STD_VER > 17
+
+private:
+    template<class _It2> friend class move_iterator;
+
+    _Iter __current_;
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(move_iterator);
+
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+bool operator==(const move_iterator<_Iter1>& __x, const move_iterator<_Iter2>& __y)
+{
+    return __x.base() == __y.base();
+}
+
+#if _LIBCPP_STD_VER <= 17
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+bool operator!=(const move_iterator<_Iter1>& __x, const move_iterator<_Iter2>& __y)
+{
+    return __x.base() != __y.base();
+}
+#endif // _LIBCPP_STD_VER <= 17
+
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+bool operator<(const move_iterator<_Iter1>& __x, const move_iterator<_Iter2>& __y)
+{
+    return __x.base() < __y.base();
+}
+
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+bool operator>(const move_iterator<_Iter1>& __x, const move_iterator<_Iter2>& __y)
+{
+    return __x.base() > __y.base();
+}
+
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+bool operator<=(const move_iterator<_Iter1>& __x, const move_iterator<_Iter2>& __y)
+{
+    return __x.base() <= __y.base();
+}
+
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+bool operator>=(const move_iterator<_Iter1>& __x, const move_iterator<_Iter2>& __y)
+{
+    return __x.base() >= __y.base();
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Iter1, three_way_comparable_with<_Iter1> _Iter2>
+inline _LIBCPP_HIDE_FROM_ABI constexpr
+auto operator<=>(const move_iterator<_Iter1>& __x, const move_iterator<_Iter2>& __y)
+    -> compare_three_way_result_t<_Iter1, _Iter2>
+{
+    return __x.base() <=> __y.base();
+}
+#endif // _LIBCPP_STD_VER > 17
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+auto operator-(const move_iterator<_Iter1>& __x, const move_iterator<_Iter2>& __y)
+    -> decltype(__x.base() - __y.base())
+{
+    return __x.base() - __y.base();
+}
+#else
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_HIDE_FROM_ABI
+typename move_iterator<_Iter1>::difference_type
+operator-(const move_iterator<_Iter1>& __x, const move_iterator<_Iter2>& __y)
+{
+    return __x.base() - __y.base();
+}
+#endif // !_LIBCPP_CXX03_LANG
+
+#if _LIBCPP_STD_VER > 17
+template <class _Iter>
+inline _LIBCPP_HIDE_FROM_ABI constexpr
+move_iterator<_Iter> operator+(iter_difference_t<_Iter> __n, const move_iterator<_Iter>& __x)
+    requires requires { { __x.base() + __n } -> same_as<_Iter>; }
+{
+    return __x + __n;
+}
+#else
+template <class _Iter>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+move_iterator<_Iter>
+operator+(typename move_iterator<_Iter>::difference_type __n, const move_iterator<_Iter>& __x)
+{
+    return move_iterator<_Iter>(__x.base() + __n);
+}
+#endif // _LIBCPP_STD_VER > 17
+
+template <class _Iter>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+move_iterator<_Iter>
+make_move_iterator(_Iter __i)
+{
+    return move_iterator<_Iter>(std::move(__i));
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_MOVE_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/move_sentinel.h b/app/src/main/cpp/libcxx/include/__iterator/move_sentinel.h
new file mode 100644
index 0000000..0d7336a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/move_sentinel.h
@@ -0,0 +1,59 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_MOVE_SENTINEL_H
+#define _LIBCPP___ITERATOR_MOVE_SENTINEL_H
+
+#include <__concepts/assignable.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/semiregular.h>
+#include <__config>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <semiregular _Sent>
+class _LIBCPP_TEMPLATE_VIS move_sentinel
+{
+public:
+  _LIBCPP_HIDE_FROM_ABI
+  move_sentinel() = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  explicit move_sentinel(_Sent __s) : __last_(std::move(__s)) {}
+
+  template <class _S2>
+    requires convertible_to<const _S2&, _Sent>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  move_sentinel(const move_sentinel<_S2>& __s) : __last_(__s.base()) {}
+
+  template <class _S2>
+    requires assignable_from<_Sent&, const _S2&>
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  move_sentinel& operator=(const move_sentinel<_S2>& __s)
+    { __last_ = __s.base(); return *this; }
+
+  constexpr _Sent base() const { return __last_; }
+
+private:
+    _Sent __last_ = _Sent();
+};
+
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(move_sentinel);
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_MOVE_SENTINEL_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/next.h b/app/src/main/cpp/libcxx/include/__iterator/next.h
new file mode 100644
index 0000000..49970ae
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/next.h
@@ -0,0 +1,84 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_NEXT_H
+#define _LIBCPP___ITERATOR_NEXT_H
+
+#include <__assert>
+#include <__config>
+#include <__iterator/advance.h>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/enable_if.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIter>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    typename enable_if<__is_cpp17_input_iterator<_InputIter>::value, _InputIter>::type
+    next(_InputIter __x, typename iterator_traits<_InputIter>::difference_type __n = 1) {
+  _LIBCPP_ASSERT(__n >= 0 || __is_cpp17_bidirectional_iterator<_InputIter>::value,
+                 "Attempt to next(it, n) with negative n on a non-bidirectional iterator");
+
+  _VSTD::advance(__x, __n);
+  return __x;
+}
+
+#if _LIBCPP_STD_VER > 17
+
+// [range.iter.op.next]
+
+namespace ranges {
+namespace __next {
+
+struct __fn {
+  template <input_or_output_iterator _Ip>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _Ip operator()(_Ip __x) const {
+    ++__x;
+    return __x;
+  }
+
+  template <input_or_output_iterator _Ip>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _Ip operator()(_Ip __x, iter_difference_t<_Ip> __n) const {
+    ranges::advance(__x, __n);
+    return __x;
+  }
+
+  template <input_or_output_iterator _Ip, sentinel_for<_Ip> _Sp>
+  _LIBCPP_HIDE_FROM_ABI constexpr _Ip operator()(_Ip __x, _Sp __bound_sentinel) const {
+    ranges::advance(__x, __bound_sentinel);
+    return __x;
+  }
+
+  template <input_or_output_iterator _Ip, sentinel_for<_Ip> _Sp>
+  _LIBCPP_HIDE_FROM_ABI constexpr _Ip operator()(_Ip __x, iter_difference_t<_Ip> __n, _Sp __bound_sentinel) const {
+    ranges::advance(__x, __n, __bound_sentinel);
+    return __x;
+  }
+};
+
+} // namespace __next
+
+inline namespace __cpo {
+  inline constexpr auto next = __next::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_NEXT_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/ostream_iterator.h b/app/src/main/cpp/libcxx/include/__iterator/ostream_iterator.h
new file mode 100644
index 0000000..d16f5a2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/ostream_iterator.h
@@ -0,0 +1,71 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_OSTREAM_ITERATOR_H
+#define _LIBCPP___ITERATOR_OSTREAM_ITERATOR_H
+
+#include <__config>
+#include <__iterator/iterator.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <cstddef>
+#include <iosfwd> // for forward declarations of char_traits and basic_ostream
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Tp, class _CharT = char, class _Traits = char_traits<_CharT> >
+class _LIBCPP_TEMPLATE_VIS ostream_iterator
+#if _LIBCPP_STD_VER <= 14 || !defined(_LIBCPP_ABI_NO_ITERATOR_BASES)
+    : public iterator<output_iterator_tag, void, void, void, void>
+#endif
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+public:
+    typedef output_iterator_tag             iterator_category;
+    typedef void                            value_type;
+#if _LIBCPP_STD_VER > 17
+    typedef ptrdiff_t                       difference_type;
+#else
+    typedef void                            difference_type;
+#endif
+    typedef void                            pointer;
+    typedef void                            reference;
+    typedef _CharT                          char_type;
+    typedef _Traits                         traits_type;
+    typedef basic_ostream<_CharT, _Traits>  ostream_type;
+
+private:
+    ostream_type* __out_stream_;
+    const char_type* __delim_;
+public:
+    _LIBCPP_INLINE_VISIBILITY ostream_iterator(ostream_type& __s) _NOEXCEPT
+        : __out_stream_(_VSTD::addressof(__s)), __delim_(nullptr) {}
+    _LIBCPP_INLINE_VISIBILITY ostream_iterator(ostream_type& __s, const _CharT* __delimiter) _NOEXCEPT
+        : __out_stream_(_VSTD::addressof(__s)), __delim_(__delimiter) {}
+    _LIBCPP_INLINE_VISIBILITY ostream_iterator& operator=(const _Tp& __value)
+        {
+            *__out_stream_ << __value;
+            if (__delim_)
+                *__out_stream_ << __delim_;
+            return *this;
+        }
+
+    _LIBCPP_INLINE_VISIBILITY ostream_iterator& operator*()     {return *this;}
+    _LIBCPP_INLINE_VISIBILITY ostream_iterator& operator++()    {return *this;}
+    _LIBCPP_INLINE_VISIBILITY ostream_iterator& operator++(int) {return *this;}
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_OSTREAM_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/ostreambuf_iterator.h b/app/src/main/cpp/libcxx/include/__iterator/ostreambuf_iterator.h
new file mode 100644
index 0000000..b75f7b6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/ostreambuf_iterator.h
@@ -0,0 +1,77 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_OSTREAMBUF_ITERATOR_H
+#define _LIBCPP___ITERATOR_OSTREAMBUF_ITERATOR_H
+
+#include <__config>
+#include <__iterator/iterator.h>
+#include <__iterator/iterator_traits.h>
+#include <cstddef>
+#include <iosfwd> // for forward declaration of basic_streambuf
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS ostreambuf_iterator
+#if _LIBCPP_STD_VER <= 14 || !defined(_LIBCPP_ABI_NO_ITERATOR_BASES)
+    : public iterator<output_iterator_tag, void, void, void, void>
+#endif
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+public:
+    typedef output_iterator_tag                 iterator_category;
+    typedef void                                value_type;
+#if _LIBCPP_STD_VER > 17
+    typedef ptrdiff_t                           difference_type;
+#else
+    typedef void                                difference_type;
+#endif
+    typedef void                                pointer;
+    typedef void                                reference;
+    typedef _CharT                              char_type;
+    typedef _Traits                             traits_type;
+    typedef basic_streambuf<_CharT, _Traits>    streambuf_type;
+    typedef basic_ostream<_CharT, _Traits>      ostream_type;
+
+private:
+    streambuf_type* __sbuf_;
+public:
+    _LIBCPP_INLINE_VISIBILITY ostreambuf_iterator(ostream_type& __s) _NOEXCEPT
+        : __sbuf_(__s.rdbuf()) {}
+    _LIBCPP_INLINE_VISIBILITY ostreambuf_iterator(streambuf_type* __s) _NOEXCEPT
+        : __sbuf_(__s) {}
+    _LIBCPP_INLINE_VISIBILITY ostreambuf_iterator& operator=(_CharT __c)
+        {
+            if (__sbuf_ && traits_type::eq_int_type(__sbuf_->sputc(__c), traits_type::eof()))
+                __sbuf_ = nullptr;
+            return *this;
+        }
+    _LIBCPP_INLINE_VISIBILITY ostreambuf_iterator& operator*()     {return *this;}
+    _LIBCPP_INLINE_VISIBILITY ostreambuf_iterator& operator++()    {return *this;}
+    _LIBCPP_INLINE_VISIBILITY ostreambuf_iterator& operator++(int) {return *this;}
+    _LIBCPP_INLINE_VISIBILITY bool failed() const _NOEXCEPT {return __sbuf_ == nullptr;}
+
+    template <class _Ch, class _Tr>
+    friend
+    _LIBCPP_HIDE_FROM_ABI
+    ostreambuf_iterator<_Ch, _Tr>
+    __pad_and_output(ostreambuf_iterator<_Ch, _Tr> __s,
+                     const _Ch* __ob, const _Ch* __op, const _Ch* __oe,
+                     ios_base& __iob, _Ch __fl);
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_OSTREAMBUF_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/permutable.h b/app/src/main/cpp/libcxx/include/__iterator/permutable.h
new file mode 100644
index 0000000..28d193e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/permutable.h
@@ -0,0 +1,35 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_PERMUTABLE_H
+#define _LIBCPP___ITERATOR_PERMUTABLE_H
+
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iter_swap.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _Iterator>
+concept permutable =
+    forward_iterator<_Iterator> &&
+    indirectly_movable_storable<_Iterator, _Iterator> &&
+    indirectly_swappable<_Iterator, _Iterator>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_PERMUTABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/prev.h b/app/src/main/cpp/libcxx/include/__iterator/prev.h
new file mode 100644
index 0000000..af1e1ba
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/prev.h
@@ -0,0 +1,77 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_PREV_H
+#define _LIBCPP___ITERATOR_PREV_H
+
+#include <__assert>
+#include <__config>
+#include <__iterator/advance.h>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/enable_if.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIter>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    typename enable_if<__is_cpp17_input_iterator<_InputIter>::value, _InputIter>::type
+    prev(_InputIter __x, typename iterator_traits<_InputIter>::difference_type __n = 1) {
+  _LIBCPP_ASSERT(__n <= 0 || __is_cpp17_bidirectional_iterator<_InputIter>::value,
+                 "Attempt to prev(it, n) with a positive n on a non-bidirectional iterator");
+  _VSTD::advance(__x, -__n);
+  return __x;
+}
+
+#if _LIBCPP_STD_VER > 17
+
+// [range.iter.op.prev]
+
+namespace ranges {
+namespace __prev {
+
+struct __fn {
+  template <bidirectional_iterator _Ip>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _Ip operator()(_Ip __x) const {
+    --__x;
+    return __x;
+  }
+
+  template <bidirectional_iterator _Ip>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _Ip operator()(_Ip __x, iter_difference_t<_Ip> __n) const {
+    ranges::advance(__x, -__n);
+    return __x;
+  }
+
+  template <bidirectional_iterator _Ip>
+  _LIBCPP_HIDE_FROM_ABI constexpr _Ip operator()(_Ip __x, iter_difference_t<_Ip> __n, _Ip __bound_iter) const {
+    ranges::advance(__x, -__n, __bound_iter);
+    return __x;
+  }
+};
+
+} // namespace __prev
+
+inline namespace __cpo {
+  inline constexpr auto prev = __prev::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_PREV_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/projected.h b/app/src/main/cpp/libcxx/include/__iterator/projected.h
new file mode 100644
index 0000000..19c076b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/projected.h
@@ -0,0 +1,41 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_PROJECTED_H
+#define _LIBCPP___ITERATOR_PROJECTED_H
+
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__type_traits/remove_cvref.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template<indirectly_readable _It, indirectly_regular_unary_invocable<_It> _Proj>
+struct projected {
+  using value_type = remove_cvref_t<indirect_result_t<_Proj&, _It>>;
+  indirect_result_t<_Proj&, _It> operator*() const; // not defined
+};
+
+template<weakly_incrementable _It, class _Proj>
+struct incrementable_traits<projected<_It, _Proj>> {
+  using difference_type = iter_difference_t<_It>;
+};
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_PROJECTED_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/readable_traits.h b/app/src/main/cpp/libcxx/include/__iterator/readable_traits.h
new file mode 100644
index 0000000..8f17757
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/readable_traits.h
@@ -0,0 +1,92 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_READABLE_TRAITS_H
+#define _LIBCPP___ITERATOR_READABLE_TRAITS_H
+
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__type_traits/conditional.h>
+#include <__type_traits/is_array.h>
+#include <__type_traits/is_object.h>
+#include <__type_traits/is_primary_template.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/remove_cvref.h>
+#include <__type_traits/remove_extent.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [readable.traits]
+template<class> struct __cond_value_type {};
+
+template<class _Tp>
+requires is_object_v<_Tp>
+struct __cond_value_type<_Tp> { using value_type = remove_cv_t<_Tp>; };
+
+template<class _Tp>
+concept __has_member_value_type = requires { typename _Tp::value_type; };
+
+template<class _Tp>
+concept __has_member_element_type = requires { typename _Tp::element_type; };
+
+template<class> struct indirectly_readable_traits {};
+
+template<class _Ip>
+requires is_array_v<_Ip>
+struct indirectly_readable_traits<_Ip> {
+  using value_type = remove_cv_t<remove_extent_t<_Ip>>;
+};
+
+template<class _Ip>
+struct indirectly_readable_traits<const _Ip> : indirectly_readable_traits<_Ip> {};
+
+template<class _Tp>
+struct indirectly_readable_traits<_Tp*> : __cond_value_type<_Tp> {};
+
+template<__has_member_value_type _Tp>
+struct indirectly_readable_traits<_Tp>
+  : __cond_value_type<typename _Tp::value_type> {};
+
+template<__has_member_element_type _Tp>
+struct indirectly_readable_traits<_Tp>
+  : __cond_value_type<typename _Tp::element_type> {};
+
+template<__has_member_value_type _Tp>
+  requires __has_member_element_type<_Tp>
+struct indirectly_readable_traits<_Tp> {};
+
+template<__has_member_value_type _Tp>
+  requires __has_member_element_type<_Tp> &&
+           same_as<remove_cv_t<typename _Tp::element_type>,
+                   remove_cv_t<typename _Tp::value_type>>
+struct indirectly_readable_traits<_Tp>
+  : __cond_value_type<typename _Tp::value_type> {};
+
+template <class>
+struct iterator_traits;
+
+// Let `RI` be `remove_cvref_t<I>`. The type `iter_value_t<I>` denotes
+// `indirectly_readable_traits<RI>::value_type` if `iterator_traits<RI>` names a specialization
+// generated from the primary template, and `iterator_traits<RI>::value_type` otherwise.
+template <class _Ip>
+using iter_value_t = typename conditional_t<__is_primary_template<iterator_traits<remove_cvref_t<_Ip> > >::value,
+                                            indirectly_readable_traits<remove_cvref_t<_Ip> >,
+                                            iterator_traits<remove_cvref_t<_Ip> > >::value_type;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_READABLE_TRAITS_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/reverse_access.h b/app/src/main/cpp/libcxx/include/__iterator/reverse_access.h
new file mode 100644
index 0000000..79b599c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/reverse_access.h
@@ -0,0 +1,100 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_REVERSE_ACCESS_H
+#define _LIBCPP___ITERATOR_REVERSE_ACCESS_H
+
+#include <__config>
+#include <__iterator/reverse_iterator.h>
+#include <cstddef>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 11
+
+template <class _Tp, size_t _Np>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+reverse_iterator<_Tp*> rbegin(_Tp (&__array)[_Np])
+{
+    return reverse_iterator<_Tp*>(__array + _Np);
+}
+
+template <class _Tp, size_t _Np>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+reverse_iterator<_Tp*> rend(_Tp (&__array)[_Np])
+{
+    return reverse_iterator<_Tp*>(__array);
+}
+
+template <class _Ep>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+reverse_iterator<const _Ep*> rbegin(initializer_list<_Ep> __il)
+{
+    return reverse_iterator<const _Ep*>(__il.end());
+}
+
+template <class _Ep>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+reverse_iterator<const _Ep*> rend(initializer_list<_Ep> __il)
+{
+    return reverse_iterator<const _Ep*>(__il.begin());
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+auto rbegin(_Cp& __c) -> decltype(__c.rbegin())
+{
+    return __c.rbegin();
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+auto rbegin(const _Cp& __c) -> decltype(__c.rbegin())
+{
+    return __c.rbegin();
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+auto rend(_Cp& __c) -> decltype(__c.rend())
+{
+    return __c.rend();
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+auto rend(const _Cp& __c) -> decltype(__c.rend())
+{
+    return __c.rend();
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+auto crbegin(const _Cp& __c) -> decltype(_VSTD::rbegin(__c))
+{
+    return _VSTD::rbegin(__c);
+}
+
+template <class _Cp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+auto crend(const _Cp& __c) -> decltype(_VSTD::rend(__c))
+{
+    return _VSTD::rend(__c);
+}
+
+#endif // _LIBCPP_STD_VER > 11
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_REVERSE_ACCESS_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/reverse_iterator.h b/app/src/main/cpp/libcxx/include/__iterator/reverse_iterator.h
new file mode 100644
index 0000000..f272e03
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/reverse_iterator.h
@@ -0,0 +1,533 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_REVERSE_ITERATOR_H
+#define _LIBCPP___ITERATOR_REVERSE_ITERATOR_H
+
+#include <__algorithm/unwrap_iter.h>
+#include <__compare/compare_three_way_result.h>
+#include <__compare/three_way_comparable.h>
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__iterator/advance.h>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iter_swap.h>
+#include <__iterator/iterator.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/prev.h>
+#include <__iterator/readable_traits.h>
+#include <__iterator/segmented_iterator.h>
+#include <__memory/addressof.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/subrange.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_assignable.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_nothrow_copy_constructible.h>
+#include <__type_traits/is_pointer.h>
+#include <__type_traits/is_same.h>
+#include <__utility/declval.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Iter>
+class _LIBCPP_TEMPLATE_VIS reverse_iterator
+#if _LIBCPP_STD_VER <= 14 || !defined(_LIBCPP_ABI_NO_ITERATOR_BASES)
+    : public iterator<typename iterator_traits<_Iter>::iterator_category,
+                      typename iterator_traits<_Iter>::value_type,
+                      typename iterator_traits<_Iter>::difference_type,
+                      typename iterator_traits<_Iter>::pointer,
+                      typename iterator_traits<_Iter>::reference>
+#endif
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+private:
+#ifndef _LIBCPP_ABI_NO_ITERATOR_BASES
+    _Iter __t_; // no longer used as of LWG #2360, not removed due to ABI break
+#endif
+
+#if _LIBCPP_STD_VER > 17
+    static_assert(__is_cpp17_bidirectional_iterator<_Iter>::value || bidirectional_iterator<_Iter>,
+        "reverse_iterator<It> requires It to be a bidirectional iterator.");
+#endif // _LIBCPP_STD_VER > 17
+
+protected:
+    _Iter current;
+public:
+    using iterator_type = _Iter;
+
+    using iterator_category = _If<__is_cpp17_random_access_iterator<_Iter>::value,
+                                  random_access_iterator_tag,
+                                  typename iterator_traits<_Iter>::iterator_category>;
+    using pointer = typename iterator_traits<_Iter>::pointer;
+#if _LIBCPP_STD_VER > 17
+    using iterator_concept = _If<random_access_iterator<_Iter>, random_access_iterator_tag, bidirectional_iterator_tag>;
+    using value_type = iter_value_t<_Iter>;
+    using difference_type = iter_difference_t<_Iter>;
+    using reference = iter_reference_t<_Iter>;
+#else
+    using value_type = typename iterator_traits<_Iter>::value_type;
+    using difference_type = typename iterator_traits<_Iter>::difference_type;
+    using reference = typename iterator_traits<_Iter>::reference;
+#endif
+
+#ifndef _LIBCPP_ABI_NO_ITERATOR_BASES
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator() : __t_(), current() {}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    explicit reverse_iterator(_Iter __x) : __t_(__x), current(__x) {}
+
+    template <class _Up, class = __enable_if_t<
+        !is_same<_Up, _Iter>::value && is_convertible<_Up const&, _Iter>::value
+    > >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator(const reverse_iterator<_Up>& __u)
+        : __t_(__u.base()), current(__u.base())
+    { }
+
+    template <class _Up, class = __enable_if_t<
+        !is_same<_Up, _Iter>::value &&
+        is_convertible<_Up const&, _Iter>::value &&
+        is_assignable<_Iter&, _Up const&>::value
+    > >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator& operator=(const reverse_iterator<_Up>& __u) {
+        __t_ = current = __u.base();
+        return *this;
+    }
+#else
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator() : current() {}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    explicit reverse_iterator(_Iter __x) : current(__x) {}
+
+    template <class _Up, class = __enable_if_t<
+        !is_same<_Up, _Iter>::value && is_convertible<_Up const&, _Iter>::value
+    > >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator(const reverse_iterator<_Up>& __u)
+        : current(__u.base())
+    { }
+
+    template <class _Up, class = __enable_if_t<
+        !is_same<_Up, _Iter>::value &&
+        is_convertible<_Up const&, _Iter>::value &&
+        is_assignable<_Iter&, _Up const&>::value
+    > >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator& operator=(const reverse_iterator<_Up>& __u) {
+        current = __u.base();
+        return *this;
+    }
+#endif
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    _Iter base() const {return current;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reference operator*() const {_Iter __tmp = current; return *--__tmp;}
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr pointer operator->() const
+      requires is_pointer_v<_Iter> || requires(const _Iter __i) { __i.operator->(); }
+    {
+      if constexpr (is_pointer_v<_Iter>) {
+        return std::prev(current);
+      } else {
+        return std::prev(current).operator->();
+      }
+    }
+#else
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    pointer operator->() const {
+      return std::addressof(operator*());
+    }
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator& operator++() {--current; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator operator++(int) {reverse_iterator __tmp(*this); --current; return __tmp;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator& operator--() {++current; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator operator--(int) {reverse_iterator __tmp(*this); ++current; return __tmp;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator operator+(difference_type __n) const {return reverse_iterator(current - __n);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator& operator+=(difference_type __n) {current -= __n; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator operator-(difference_type __n) const {return reverse_iterator(current + __n);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator& operator-=(difference_type __n) {current += __n; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reference operator[](difference_type __n) const {return *(*this + __n);}
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_HIDE_FROM_ABI friend constexpr
+    iter_rvalue_reference_t<_Iter> iter_move(const reverse_iterator& __i)
+      noexcept(is_nothrow_copy_constructible_v<_Iter> &&
+          noexcept(ranges::iter_move(--std::declval<_Iter&>()))) {
+      auto __tmp = __i.base();
+      return ranges::iter_move(--__tmp);
+    }
+
+    template <indirectly_swappable<_Iter> _Iter2>
+    _LIBCPP_HIDE_FROM_ABI friend constexpr
+    void iter_swap(const reverse_iterator& __x, const reverse_iterator<_Iter2>& __y)
+      noexcept(is_nothrow_copy_constructible_v<_Iter> &&
+          is_nothrow_copy_constructible_v<_Iter2> &&
+          noexcept(ranges::iter_swap(--std::declval<_Iter&>(), --std::declval<_Iter2&>()))) {
+      auto __xtmp = __x.base();
+      auto __ytmp = __y.base();
+      ranges::iter_swap(--__xtmp, --__ytmp);
+    }
+#endif // _LIBCPP_STD_VER > 17
+};
+
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+bool
+operator==(const reverse_iterator<_Iter1>& __x, const reverse_iterator<_Iter2>& __y)
+#if _LIBCPP_STD_VER > 17
+    requires requires {
+      { __x.base() == __y.base() } -> convertible_to<bool>;
+    }
+#endif // _LIBCPP_STD_VER > 17
+{
+    return __x.base() == __y.base();
+}
+
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+bool
+operator<(const reverse_iterator<_Iter1>& __x, const reverse_iterator<_Iter2>& __y)
+#if _LIBCPP_STD_VER > 17
+    requires requires {
+        { __x.base() > __y.base() } -> convertible_to<bool>;
+      }
+#endif // _LIBCPP_STD_VER > 17
+{
+    return __x.base() > __y.base();
+}
+
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+bool
+operator!=(const reverse_iterator<_Iter1>& __x, const reverse_iterator<_Iter2>& __y)
+#if _LIBCPP_STD_VER > 17
+    requires requires {
+      { __x.base() != __y.base() } -> convertible_to<bool>;
+    }
+#endif // _LIBCPP_STD_VER > 17
+{
+    return __x.base() != __y.base();
+}
+
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+bool
+operator>(const reverse_iterator<_Iter1>& __x, const reverse_iterator<_Iter2>& __y)
+#if _LIBCPP_STD_VER > 17
+    requires requires {
+        { __x.base() < __y.base() } -> convertible_to<bool>;
+      }
+#endif // _LIBCPP_STD_VER > 17
+{
+    return __x.base() < __y.base();
+}
+
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+bool
+operator>=(const reverse_iterator<_Iter1>& __x, const reverse_iterator<_Iter2>& __y)
+#if _LIBCPP_STD_VER > 17
+    requires requires {
+        { __x.base() <= __y.base() } -> convertible_to<bool>;
+      }
+#endif // _LIBCPP_STD_VER > 17
+{
+    return __x.base() <= __y.base();
+}
+
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+bool
+operator<=(const reverse_iterator<_Iter1>& __x, const reverse_iterator<_Iter2>& __y)
+#if _LIBCPP_STD_VER > 17
+    requires requires {
+        { __x.base() >= __y.base() } -> convertible_to<bool>;
+      }
+#endif // _LIBCPP_STD_VER > 17
+{
+    return __x.base() >= __y.base();
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Iter1, three_way_comparable_with<_Iter1> _Iter2>
+_LIBCPP_HIDE_FROM_ABI constexpr
+compare_three_way_result_t<_Iter1, _Iter2>
+operator<=>(const reverse_iterator<_Iter1>& __x, const reverse_iterator<_Iter2>& __y)
+{
+    return __y.base() <=> __x.base();
+}
+#endif // _LIBCPP_STD_VER > 17
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+auto
+operator-(const reverse_iterator<_Iter1>& __x, const reverse_iterator<_Iter2>& __y)
+-> decltype(__y.base() - __x.base())
+{
+    return __y.base() - __x.base();
+}
+#else
+template <class _Iter1, class _Iter2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename reverse_iterator<_Iter1>::difference_type
+operator-(const reverse_iterator<_Iter1>& __x, const reverse_iterator<_Iter2>& __y)
+{
+    return __y.base() - __x.base();
+}
+#endif
+
+template <class _Iter>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+reverse_iterator<_Iter>
+operator+(typename reverse_iterator<_Iter>::difference_type __n, const reverse_iterator<_Iter>& __x)
+{
+    return reverse_iterator<_Iter>(__x.base() - __n);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Iter1, class _Iter2>
+  requires (!sized_sentinel_for<_Iter1, _Iter2>)
+inline constexpr bool disable_sized_sentinel_for<reverse_iterator<_Iter1>, reverse_iterator<_Iter2>> = true;
+#endif // _LIBCPP_STD_VER > 17
+
+#if _LIBCPP_STD_VER > 11
+template <class _Iter>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+reverse_iterator<_Iter> make_reverse_iterator(_Iter __i)
+{
+    return reverse_iterator<_Iter>(__i);
+}
+#endif
+
+#if _LIBCPP_STD_VER <= 17
+template <class _Iter>
+using __unconstrained_reverse_iterator = reverse_iterator<_Iter>;
+#else
+
+// __unconstrained_reverse_iterator allows us to use reverse iterators in the implementation of algorithms by working
+// around a language issue in C++20.
+// In C++20, when a reverse iterator wraps certain C++20-hostile iterators, calling comparison operators on it will
+// result in a compilation error. However, calling comparison operators on the pristine hostile iterator is not
+// an error. Thus, we cannot use reverse_iterators in the implementation of an algorithm that accepts a
+// C++20-hostile iterator. This class is an internal workaround -- it is a copy of reverse_iterator with
+// tweaks to make it support hostile iterators.
+//
+// A C++20-hostile iterator is one that defines a comparison operator where one of the arguments is an exact match
+// and the other requires an implicit conversion, for example:
+//   friend bool operator==(const BaseIter&, const DerivedIter&);
+//
+// C++20 rules for rewriting equality operators create another overload of this function with parameters reversed:
+//   friend bool operator==(const DerivedIter&, const BaseIter&);
+//
+// This creates an ambiguity in overload resolution.
+//
+// Clang treats this ambiguity differently in different contexts. When operator== is actually called in the function
+// body, the code is accepted with a warning. When a concept requires operator== to be a valid expression, however,
+// it evaluates to false. Thus, the implementation of reverse_iterator::operator== can actually call operator== on its
+// base iterators, but the constraints on reverse_iterator::operator== prevent it from being considered during overload
+// resolution. This class simply removes the problematic constraints from comparison functions.
+template <class _Iter>
+class __unconstrained_reverse_iterator {
+  _Iter __iter_;
+
+public:
+  static_assert(__is_cpp17_bidirectional_iterator<_Iter>::value || bidirectional_iterator<_Iter>);
+
+  using iterator_type = _Iter;
+  using iterator_category =
+      _If<__is_cpp17_random_access_iterator<_Iter>::value, random_access_iterator_tag, __iterator_category_type<_Iter>>;
+  using pointer = __iterator_pointer_type<_Iter>;
+  using value_type = iter_value_t<_Iter>;
+  using difference_type = iter_difference_t<_Iter>;
+  using reference = iter_reference_t<_Iter>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __unconstrained_reverse_iterator() = default;
+  _LIBCPP_HIDE_FROM_ABI constexpr __unconstrained_reverse_iterator(const __unconstrained_reverse_iterator&) = default;
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit __unconstrained_reverse_iterator(_Iter __iter) : __iter_(__iter) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _Iter base() const { return __iter_; }
+  _LIBCPP_HIDE_FROM_ABI constexpr reference operator*() const {
+    auto __tmp = __iter_;
+    return *--__tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr pointer operator->() const {
+    if constexpr (is_pointer_v<_Iter>) {
+      return std::prev(__iter_);
+    } else {
+      return std::prev(__iter_).operator->();
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr
+  iter_rvalue_reference_t<_Iter> iter_move(const __unconstrained_reverse_iterator& __i)
+    noexcept(is_nothrow_copy_constructible_v<_Iter> &&
+        noexcept(ranges::iter_move(--std::declval<_Iter&>()))) {
+    auto __tmp = __i.base();
+    return ranges::iter_move(--__tmp);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __unconstrained_reverse_iterator& operator++() {
+    --__iter_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __unconstrained_reverse_iterator operator++(int) {
+    auto __tmp = *this;
+    --__iter_;
+    return __tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __unconstrained_reverse_iterator& operator--() {
+    ++__iter_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __unconstrained_reverse_iterator operator--(int) {
+    auto __tmp = *this;
+    ++__iter_;
+    return __tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __unconstrained_reverse_iterator& operator+=(difference_type __n) {
+    __iter_ -= __n;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __unconstrained_reverse_iterator& operator-=(difference_type __n) {
+    __iter_ += __n;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __unconstrained_reverse_iterator operator+(difference_type __n) const {
+    return __unconstrained_reverse_iterator(__iter_ - __n);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __unconstrained_reverse_iterator operator-(difference_type __n) const {
+    return __unconstrained_reverse_iterator(__iter_ + __n);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr difference_type operator-(const __unconstrained_reverse_iterator& __other) const {
+    return __other.__iter_ - __iter_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto operator[](difference_type __n) const { return *(*this + __n); }
+
+  // Deliberately unconstrained unlike the comparison functions in `reverse_iterator` -- see the class comment for the
+  // rationale.
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator==(const __unconstrained_reverse_iterator& __lhs, const __unconstrained_reverse_iterator& __rhs) {
+    return __lhs.base() == __rhs.base();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator!=(const __unconstrained_reverse_iterator& __lhs, const __unconstrained_reverse_iterator& __rhs) {
+    return __lhs.base() != __rhs.base();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator<(const __unconstrained_reverse_iterator& __lhs, const __unconstrained_reverse_iterator& __rhs) {
+    return __lhs.base() > __rhs.base();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator>(const __unconstrained_reverse_iterator& __lhs, const __unconstrained_reverse_iterator& __rhs) {
+    return __lhs.base() < __rhs.base();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator<=(const __unconstrained_reverse_iterator& __lhs, const __unconstrained_reverse_iterator& __rhs) {
+    return __lhs.base() >= __rhs.base();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator>=(const __unconstrained_reverse_iterator& __lhs, const __unconstrained_reverse_iterator& __rhs) {
+    return __lhs.base() <= __rhs.base();
+  }
+};
+
+#endif // _LIBCPP_STD_VER <= 17
+
+template <template <class> class _RevIter1, template <class> class _RevIter2, class _Iter>
+struct __unwrap_reverse_iter_impl {
+  using _UnwrappedIter = decltype(__unwrap_iter_impl<_Iter>::__unwrap(std::declval<_Iter>()));
+  using _ReverseWrapper = _RevIter1<_RevIter2<_Iter> >;
+
+  static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _ReverseWrapper
+  __rewrap(_ReverseWrapper __orig_iter, _UnwrappedIter __unwrapped_iter) {
+    return _ReverseWrapper(
+        _RevIter2<_Iter>(__unwrap_iter_impl<_Iter>::__rewrap(__orig_iter.base().base(), __unwrapped_iter)));
+  }
+
+  static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _UnwrappedIter __unwrap(_ReverseWrapper __i) _NOEXCEPT {
+    return __unwrap_iter_impl<_Iter>::__unwrap(__i.base().base());
+  }
+};
+
+#if _LIBCPP_STD_VER > 17
+template <ranges::bidirectional_range _Range>
+_LIBCPP_HIDE_FROM_ABI constexpr ranges::
+    subrange<reverse_iterator<ranges::iterator_t<_Range>>, reverse_iterator<ranges::iterator_t<_Range>>>
+    __reverse_range(_Range&& __range) {
+  auto __first = ranges::begin(__range);
+  return {std::make_reverse_iterator(ranges::next(__first, ranges::end(__range))), std::make_reverse_iterator(__first)};
+}
+#endif
+
+template <class _Iter, bool __b>
+struct __unwrap_iter_impl<reverse_iterator<reverse_iterator<_Iter> >, __b>
+    : __unwrap_reverse_iter_impl<reverse_iterator, reverse_iterator, _Iter> {};
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _Iter, bool __b>
+struct __unwrap_iter_impl<reverse_iterator<__unconstrained_reverse_iterator<_Iter>>, __b>
+    : __unwrap_reverse_iter_impl<reverse_iterator, __unconstrained_reverse_iterator, _Iter> {};
+
+template <class _Iter, bool __b>
+struct __unwrap_iter_impl<__unconstrained_reverse_iterator<reverse_iterator<_Iter>>, __b>
+    : __unwrap_reverse_iter_impl<__unconstrained_reverse_iterator, reverse_iterator, _Iter> {};
+
+template <class _Iter, bool __b>
+struct __unwrap_iter_impl<__unconstrained_reverse_iterator<__unconstrained_reverse_iterator<_Iter>>, __b>
+    : __unwrap_reverse_iter_impl<__unconstrained_reverse_iterator, __unconstrained_reverse_iterator, _Iter> {};
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_REVERSE_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/segmented_iterator.h b/app/src/main/cpp/libcxx/include/__iterator/segmented_iterator.h
new file mode 100644
index 0000000..f3cd1e5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/segmented_iterator.h
@@ -0,0 +1,79 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SEGMENTED_ITERATOR_H
+#define _LIBCPP___SEGMENTED_ITERATOR_H
+
+// Segmented iterators are iterators over (not necessarily contiguous) sub-ranges.
+//
+// For example, std::deque stores its data into multiple blocks of contiguous memory,
+// which are not stored contiguously themselves. The concept of segmented iterators
+// allows algorithms to operate over these multi-level iterators natively, opening the
+// door to various optimizations. See http://lafstern.org/matt/segmented.pdf for details.
+//
+// If __segmented_iterator_traits can be instantiated, the following functions and associated types must be provided:
+// - Traits::__local_iterator
+//   The type of iterators used to iterate inside a segment.
+//
+// - Traits::__segment_iterator
+//   The type of iterators used to iterate over segments.
+//   Segment iterators can be forward iterators or bidirectional iterators, depending on the
+//   underlying data structure.
+//
+// - static __segment_iterator Traits::__segment(It __it)
+//   Returns an iterator to the segment that the provided iterator is in.
+//
+// - static __local_iterator Traits::__local(It __it)
+//   Returns the local iterator pointing to the element that the provided iterator points to.
+//
+// - static __local_iterator Traits::__begin(__segment_iterator __it)
+//   Returns the local iterator to the beginning of the segment that the provided iterator is pointing into.
+//
+// - static __local_iterator Traits::__end(__segment_iterator __it)
+//   Returns the one-past-the-end local iterator to the segment that the provided iterator is pointing into.
+//
+// - static It Traits::__compose(__segment_iterator, __local_iterator)
+//   Returns the iterator composed of the segment iterator and local iterator.
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Iterator>
+struct __segmented_iterator_traits;
+/* exposition-only:
+{
+  using __segment_iterator = ...;
+  using __local_iterator   = ...;
+
+  static __segment_iterator __segment(_Iterator);
+  static __local_iterator __local(_Iterator);
+  static __local_iterator __begin(__segment_iterator);
+  static __local_iterator __end(__segment_iterator);
+  static _Iterator __compose(__segment_iterator, __local_iterator);
+};
+*/
+
+template <class _Tp, size_t = 0>
+struct __has_specialization : false_type {};
+
+template <class _Tp>
+struct __has_specialization<_Tp, sizeof(_Tp) * 0> : true_type {};
+
+template <class _Iterator>
+using __is_segmented_iterator = __has_specialization<__segmented_iterator_traits<_Iterator> >;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___SEGMENTED_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/size.h b/app/src/main/cpp/libcxx/include/__iterator/size.h
new file mode 100644
index 0000000..1452bd1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/size.h
@@ -0,0 +1,59 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_SIZE_H
+#define _LIBCPP___ITERATOR_SIZE_H
+
+#include <__config>
+#include <__type_traits/common_type.h>
+#include <__type_traits/make_signed.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _Cont>
+_LIBCPP_INLINE_VISIBILITY
+constexpr auto size(const _Cont& __c)
+_NOEXCEPT_(noexcept(__c.size()))
+-> decltype        (__c.size())
+{ return            __c.size(); }
+
+template <class _Tp, size_t _Sz>
+_LIBCPP_INLINE_VISIBILITY
+constexpr size_t size(const _Tp (&)[_Sz]) noexcept { return _Sz; }
+
+#if _LIBCPP_STD_VER > 17
+template <class _Cont>
+_LIBCPP_INLINE_VISIBILITY
+constexpr auto ssize(const _Cont& __c)
+_NOEXCEPT_(noexcept(static_cast<common_type_t<ptrdiff_t, make_signed_t<decltype(__c.size())>>>(__c.size())))
+->                              common_type_t<ptrdiff_t, make_signed_t<decltype(__c.size())>>
+{ return            static_cast<common_type_t<ptrdiff_t, make_signed_t<decltype(__c.size())>>>(__c.size()); }
+
+// GCC complains about the implicit conversion from ptrdiff_t to size_t in
+// the array bound.
+_LIBCPP_DIAGNOSTIC_PUSH
+_LIBCPP_GCC_DIAGNOSTIC_IGNORED("-Wsign-conversion")
+template <class _Tp, ptrdiff_t _Sz>
+_LIBCPP_INLINE_VISIBILITY
+constexpr ptrdiff_t ssize(const _Tp (&)[_Sz]) noexcept { return _Sz; }
+_LIBCPP_DIAGNOSTIC_POP
+#endif
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_SIZE_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/sortable.h b/app/src/main/cpp/libcxx/include/__iterator/sortable.h
new file mode 100644
index 0000000..bcf934f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/sortable.h
@@ -0,0 +1,37 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_SORTABLE_H
+#define _LIBCPP___ITERATOR_SORTABLE_H
+
+#include <__config>
+#include <__functional/identity.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/permutable.h>
+#include <__iterator/projected.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _Iter, class _Comp = ranges::less, class _Proj = identity>
+concept sortable =
+  permutable<_Iter> &&
+  indirect_strict_weak_order<_Comp, projected<_Iter, _Proj>>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_SORTABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/unreachable_sentinel.h b/app/src/main/cpp/libcxx/include/__iterator/unreachable_sentinel.h
new file mode 100644
index 0000000..d77cc99
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/unreachable_sentinel.h
@@ -0,0 +1,38 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_UNREACHABLE_SENTINEL_H
+#define _LIBCPP___ITERATOR_UNREACHABLE_SENTINEL_H
+
+#include <__config>
+#include <__iterator/concepts.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+struct unreachable_sentinel_t {
+  template<weakly_incrementable _Iter>
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(unreachable_sentinel_t, const _Iter&) noexcept {
+    return false;
+  }
+};
+
+inline constexpr unreachable_sentinel_t unreachable_sentinel{};
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_UNREACHABLE_SENTINEL_H
diff --git a/app/src/main/cpp/libcxx/include/__iterator/wrap_iter.h b/app/src/main/cpp/libcxx/include/__iterator/wrap_iter.h
new file mode 100644
index 0000000..16defc1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__iterator/wrap_iter.h
@@ -0,0 +1,286 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___ITERATOR_WRAP_ITER_H
+#define _LIBCPP___ITERATOR_WRAP_ITER_H
+
+#include <__config>
+#include <__debug>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__memory/pointer_traits.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_convertible.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Iter>
+class __wrap_iter
+{
+public:
+    typedef _Iter                                                      iterator_type;
+    typedef typename iterator_traits<iterator_type>::value_type        value_type;
+    typedef typename iterator_traits<iterator_type>::difference_type   difference_type;
+    typedef typename iterator_traits<iterator_type>::pointer           pointer;
+    typedef typename iterator_traits<iterator_type>::reference         reference;
+    typedef typename iterator_traits<iterator_type>::iterator_category iterator_category;
+#if _LIBCPP_STD_VER > 17
+    typedef contiguous_iterator_tag                                    iterator_concept;
+#endif
+
+private:
+    iterator_type __i_;
+public:
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter() _NOEXCEPT
+                : __i_()
+    {
+        _VSTD::__debug_db_insert_i(this);
+    }
+    template <class _Up> _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+        __wrap_iter(const __wrap_iter<_Up>& __u,
+            typename enable_if<is_convertible<_Up, iterator_type>::value>::type* = nullptr) _NOEXCEPT
+            : __i_(__u.base())
+    {
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+      if (!__libcpp_is_constant_evaluated())
+        __get_db()->__iterator_copy(this, _VSTD::addressof(__u));
+#endif
+    }
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+    __wrap_iter(const __wrap_iter& __x)
+        : __i_(__x.base())
+    {
+      if (!__libcpp_is_constant_evaluated())
+        __get_db()->__iterator_copy(this, _VSTD::addressof(__x));
+    }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+    __wrap_iter& operator=(const __wrap_iter& __x)
+    {
+        if (this != _VSTD::addressof(__x))
+        {
+            if (!__libcpp_is_constant_evaluated())
+                __get_db()->__iterator_copy(this, _VSTD::addressof(__x));
+            __i_ = __x.__i_;
+        }
+        return *this;
+    }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    ~__wrap_iter()
+    {
+      if (!__libcpp_is_constant_evaluated())
+        __get_db()->__erase_i(this);
+    }
+#endif
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 reference operator*() const _NOEXCEPT
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                             "Attempted to dereference a non-dereferenceable iterator");
+        return *__i_;
+    }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pointer operator->() const _NOEXCEPT
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                             "Attempted to dereference a non-dereferenceable iterator");
+        return _VSTD::__to_address(__i_);
+    }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter& operator++() _NOEXCEPT
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                             "Attempted to increment a non-incrementable iterator");
+        ++__i_;
+        return *this;
+    }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter  operator++(int) _NOEXCEPT
+        {__wrap_iter __tmp(*this); ++(*this); return __tmp;}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter& operator--() _NOEXCEPT
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__decrementable(this),
+                             "Attempted to decrement a non-decrementable iterator");
+        --__i_;
+        return *this;
+    }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter  operator--(int) _NOEXCEPT
+        {__wrap_iter __tmp(*this); --(*this); return __tmp;}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter  operator+ (difference_type __n) const _NOEXCEPT
+        {__wrap_iter __w(*this); __w += __n; return __w;}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter& operator+=(difference_type __n) _NOEXCEPT
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__addable(this, __n),
+                             "Attempted to add/subtract an iterator outside its valid range");
+        __i_ += __n;
+        return *this;
+    }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter  operator- (difference_type __n) const _NOEXCEPT
+        {return *this + (-__n);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter& operator-=(difference_type __n) _NOEXCEPT
+        {*this += -__n; return *this;}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 reference    operator[](difference_type __n) const _NOEXCEPT
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__subscriptable(this, __n),
+                             "Attempted to subscript an iterator outside its valid range");
+        return __i_[__n];
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 iterator_type base() const _NOEXCEPT {return __i_;}
+
+private:
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+    explicit __wrap_iter(const void* __p, iterator_type __x) _NOEXCEPT : __i_(__x)
+    {
+        (void)__p;
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+      if (!__libcpp_is_constant_evaluated())
+        __get_db()->__insert_ic(this, __p);
+#endif
+    }
+
+    template <class _Up> friend class __wrap_iter;
+    template <class _CharT, class _Traits, class _Alloc> friend class basic_string;
+    template <class _Tp, class _Alloc> friend class _LIBCPP_TEMPLATE_VIS vector;
+    template <class _Tp, size_t> friend class _LIBCPP_TEMPLATE_VIS span;
+};
+
+template <class _Iter1>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+bool operator==(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter1>& __y) _NOEXCEPT
+{
+    return __x.base() == __y.base();
+}
+
+template <class _Iter1, class _Iter2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+bool operator==(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPT
+{
+    return __x.base() == __y.base();
+}
+
+template <class _Iter1>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool operator<(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter1>& __y) _NOEXCEPT
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__less_than_comparable(_VSTD::addressof(__x), _VSTD::addressof(__y)),
+                         "Attempted to compare incomparable iterators");
+    return __x.base() < __y.base();
+}
+
+template <class _Iter1, class _Iter2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool operator<(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPT
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__less_than_comparable(&__x, &__y),
+                         "Attempted to compare incomparable iterators");
+    return __x.base() < __y.base();
+}
+
+template <class _Iter1>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+bool operator!=(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter1>& __y) _NOEXCEPT
+{
+    return !(__x == __y);
+}
+
+template <class _Iter1, class _Iter2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+bool operator!=(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPT
+{
+    return !(__x == __y);
+}
+
+template <class _Iter1>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+bool operator>(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter1>& __y) _NOEXCEPT
+{
+    return __y < __x;
+}
+
+template <class _Iter1, class _Iter2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+bool operator>(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPT
+{
+    return __y < __x;
+}
+
+template <class _Iter1>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+bool operator>=(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter1>& __y) _NOEXCEPT
+{
+    return !(__x < __y);
+}
+
+template <class _Iter1, class _Iter2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+bool operator>=(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPT
+{
+    return !(__x < __y);
+}
+
+template <class _Iter1>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+bool operator<=(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter1>& __y) _NOEXCEPT
+{
+    return !(__y < __x);
+}
+
+template <class _Iter1, class _Iter2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+bool operator<=(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPT
+{
+    return !(__y < __x);
+}
+
+template <class _Iter1, class _Iter2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+#ifndef _LIBCPP_CXX03_LANG
+auto operator-(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPT
+    -> decltype(__x.base() - __y.base())
+#else
+typename __wrap_iter<_Iter1>::difference_type
+operator-(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPT
+#endif // C++03
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__less_than_comparable(_VSTD::addressof(__x), _VSTD::addressof(__y)),
+                         "Attempted to subtract incompatible iterators");
+    return __x.base() - __y.base();
+}
+
+template <class _Iter1>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+__wrap_iter<_Iter1> operator+(typename __wrap_iter<_Iter1>::difference_type __n, __wrap_iter<_Iter1> __x) _NOEXCEPT
+{
+    __x += __n;
+    return __x;
+}
+
+#if _LIBCPP_STD_VER <= 17
+template <class _It>
+struct __is_cpp17_contiguous_iterator<__wrap_iter<_It> > : true_type {};
+#endif
+
+template <class _It>
+struct _LIBCPP_TEMPLATE_VIS pointer_traits<__wrap_iter<_It> >
+{
+    typedef __wrap_iter<_It> pointer;
+    typedef typename pointer_traits<_It>::element_type element_type;
+    typedef typename pointer_traits<_It>::difference_type difference_type;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+    static element_type *to_address(pointer __w) _NOEXCEPT {
+        return _VSTD::__to_address(__w.base());
+    }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___ITERATOR_WRAP_ITER_H
diff --git a/app/src/main/cpp/libcxx/include/__locale b/app/src/main/cpp/libcxx/include/__locale
new file mode 100644
index 0000000..e0ffa0c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__locale
@@ -0,0 +1,1816 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___LOCALE
+#define _LIBCPP___LOCALE
+
+#include <__availability>
+#include <__config>
+#include <cctype>
+#include <cstdint>
+#include <locale.h>
+#include <mutex>
+#include <string>
+
+// Some platforms require more includes than others. Keep the includes on all plaforms for now.
+#include <cstddef>
+#include <cstring>
+
+#if defined(_LIBCPP_MSVCRT_LIKE)
+# include <__support/win32/locale_win32.h>
+#elif defined(_AIX) || defined(__MVS__)
+# include <__support/ibm/xlocale.h>
+#elif defined(__ANDROID__)
+# include <__support/android/locale_bionic.h>
+#elif defined(__sun__)
+# include <__support/solaris/xlocale.h>
+# include <xlocale.h>
+#elif defined(_NEWLIB_VERSION)
+# include <__support/newlib/xlocale.h>
+#elif defined(__OpenBSD__)
+# include <__support/openbsd/xlocale.h>
+#elif (defined(__APPLE__) || defined(__FreeBSD__))
+# include <xlocale.h>
+#elif defined(__Fuchsia__)
+# include <__support/fuchsia/xlocale.h>
+#elif defined(__wasi__)
+// WASI libc uses musl's locales support.
+# include <__support/musl/xlocale.h>
+#elif defined(_LIBCPP_HAS_MUSL_LIBC)
+# include <__support/musl/xlocale.h>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if !defined(_LIBCPP_LOCALE__L_EXTENSIONS)
+struct __libcpp_locale_guard {
+  _LIBCPP_INLINE_VISIBILITY
+  __libcpp_locale_guard(locale_t& __loc) : __old_loc_(uselocale(__loc)) {}
+
+  _LIBCPP_INLINE_VISIBILITY
+  ~__libcpp_locale_guard() {
+    if (__old_loc_)
+      uselocale(__old_loc_);
+  }
+
+  locale_t __old_loc_;
+private:
+  __libcpp_locale_guard(__libcpp_locale_guard const&);
+  __libcpp_locale_guard& operator=(__libcpp_locale_guard const&);
+};
+#elif defined(_LIBCPP_MSVCRT_LIKE)
+struct __libcpp_locale_guard {
+    __libcpp_locale_guard(locale_t __l) :
+        __status(_configthreadlocale(_ENABLE_PER_THREAD_LOCALE)) {
+      // Setting the locale can be expensive even when the locale given is
+      // already the current locale, so do an explicit check to see if the
+      // current locale is already the one we want.
+      const char* __lc = __setlocale(nullptr);
+      // If every category is the same, the locale string will simply be the
+      // locale name, otherwise it will be a semicolon-separated string listing
+      // each category.  In the second case, we know at least one category won't
+      // be what we want, so we only have to check the first case.
+      if (_VSTD::strcmp(__l.__get_locale(), __lc) != 0) {
+        __locale_all = _strdup(__lc);
+        if (__locale_all == nullptr)
+          __throw_bad_alloc();
+        __setlocale(__l.__get_locale());
+      }
+    }
+    ~__libcpp_locale_guard() {
+      // The CRT documentation doesn't explicitly say, but setlocale() does the
+      // right thing when given a semicolon-separated list of locale settings
+      // for the different categories in the same format as returned by
+      // setlocale(LC_ALL, nullptr).
+      if (__locale_all != nullptr) {
+        __setlocale(__locale_all);
+        free(__locale_all);
+      }
+      _configthreadlocale(__status);
+    }
+    static const char* __setlocale(const char* __locale) {
+      const char* __new_locale = setlocale(LC_ALL, __locale);
+      if (__new_locale == nullptr)
+        __throw_bad_alloc();
+      return __new_locale;
+    }
+    int __status;
+    char* __locale_all = nullptr;
+};
+#endif
+
+class _LIBCPP_TYPE_VIS locale;
+
+template <class _Facet>
+_LIBCPP_INLINE_VISIBILITY
+bool
+has_facet(const locale&) _NOEXCEPT;
+
+template <class _Facet>
+_LIBCPP_INLINE_VISIBILITY
+const _Facet&
+use_facet(const locale&);
+
+class _LIBCPP_TYPE_VIS locale
+{
+public:
+    // types:
+    class _LIBCPP_TYPE_VIS facet;
+    class _LIBCPP_TYPE_VIS id;
+
+    typedef int category;
+    _LIBCPP_AVAILABILITY_LOCALE_CATEGORY
+    static const category // values assigned here are for exposition only
+        none     = 0,
+        collate  = LC_COLLATE_MASK,
+        ctype    = LC_CTYPE_MASK,
+        monetary = LC_MONETARY_MASK,
+        numeric  = LC_NUMERIC_MASK,
+        time     = LC_TIME_MASK,
+        messages = LC_MESSAGES_MASK,
+        all = collate | ctype | monetary | numeric | time | messages;
+
+    // construct/copy/destroy:
+    locale()  _NOEXCEPT;
+    locale(const locale&)  _NOEXCEPT;
+    explicit locale(const char*);
+    explicit locale(const string&);
+    locale(const locale&, const char*, category);
+    locale(const locale&, const string&, category);
+    template <class _Facet>
+        _LIBCPP_INLINE_VISIBILITY locale(const locale&, _Facet*);
+    locale(const locale&, const locale&, category);
+
+    ~locale();
+
+    const locale& operator=(const locale&)  _NOEXCEPT;
+
+    template <class _Facet>
+      _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+      locale combine(const locale&) const;
+
+    // locale operations:
+    string name() const;
+    bool operator==(const locale&) const;
+    bool operator!=(const locale& __y) const {return !(*this == __y);}
+    template <class _CharT, class _Traits, class _Allocator>
+      _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+      bool operator()(const basic_string<_CharT, _Traits, _Allocator>&,
+                      const basic_string<_CharT, _Traits, _Allocator>&) const;
+
+    // global locale objects:
+    static locale global(const locale&);
+    static const locale& classic();
+
+private:
+    class __imp;
+    __imp* __locale_;
+
+    void __install_ctor(const locale&, facet*, long);
+    static locale& __global();
+    bool has_facet(id&) const;
+    const facet* use_facet(id&) const;
+
+    template <class _Facet> friend bool has_facet(const locale&)  _NOEXCEPT;
+    template <class _Facet> friend const _Facet& use_facet(const locale&);
+};
+
+class _LIBCPP_TYPE_VIS locale::facet
+    : public __shared_count
+{
+protected:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit facet(size_t __refs = 0)
+        : __shared_count(static_cast<long>(__refs)-1) {}
+
+    ~facet() override;
+
+//    facet(const facet&) = delete;     // effectively done in __shared_count
+//    void operator=(const facet&) = delete;
+private:
+    void __on_zero_shared() _NOEXCEPT override;
+};
+
+class _LIBCPP_TYPE_VIS locale::id
+{
+    once_flag      __flag_;
+    int32_t        __id_;
+
+    static int32_t __next_id;
+public:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR id() :__id_(0) {}
+    void operator=(const id&) = delete;
+    id(const id&) = delete;
+
+private:
+    void __init();
+public:  // only needed for tests
+    long __get();
+
+    friend class locale;
+    friend class locale::__imp;
+};
+
+template <class _Facet>
+inline _LIBCPP_INLINE_VISIBILITY
+locale::locale(const locale& __other, _Facet* __f)
+{
+    __install_ctor(__other, __f, __f ? __f->id.__get() : 0);
+}
+
+template <class _Facet>
+locale
+locale::combine(const locale& __other) const
+{
+    if (!_VSTD::has_facet<_Facet>(__other))
+        __throw_runtime_error("locale::combine: locale missing facet");
+
+    return locale(*this, &const_cast<_Facet&>(_VSTD::use_facet<_Facet>(__other)));
+}
+
+template <class _Facet>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+has_facet(const locale& __l)  _NOEXCEPT
+{
+    return __l.has_facet(_Facet::id);
+}
+
+template <class _Facet>
+inline _LIBCPP_INLINE_VISIBILITY
+const _Facet&
+use_facet(const locale& __l)
+{
+    return static_cast<const _Facet&>(*__l.use_facet(_Facet::id));
+}
+
+// template <class _CharT> class collate;
+
+template <class _CharT>
+class _LIBCPP_TEMPLATE_VIS collate
+    : public locale::facet
+{
+public:
+    typedef _CharT char_type;
+    typedef basic_string<char_type> string_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit collate(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    int compare(const char_type* __lo1, const char_type* __hi1,
+                const char_type* __lo2, const char_type* __hi2) const
+    {
+        return do_compare(__lo1, __hi1, __lo2, __hi2);
+    }
+
+    // FIXME(EricWF): The _LIBCPP_ALWAYS_INLINE is needed on Windows to work
+    // around a dllimport bug that expects an external instantiation.
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_ALWAYS_INLINE
+    string_type transform(const char_type* __lo, const char_type* __hi) const
+    {
+        return do_transform(__lo, __hi);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    long hash(const char_type* __lo, const char_type* __hi) const
+    {
+        return do_hash(__lo, __hi);
+    }
+
+    static locale::id id;
+
+protected:
+    ~collate() override;
+    virtual int do_compare(const char_type* __lo1, const char_type* __hi1,
+                           const char_type* __lo2, const char_type* __hi2) const;
+    virtual string_type do_transform(const char_type* __lo, const char_type* __hi) const
+        {return string_type(__lo, __hi);}
+    virtual long do_hash(const char_type* __lo, const char_type* __hi) const;
+};
+
+template <class _CharT> locale::id collate<_CharT>::id;
+
+template <class _CharT>
+collate<_CharT>::~collate()
+{
+}
+
+template <class _CharT>
+int
+collate<_CharT>::do_compare(const char_type* __lo1, const char_type* __hi1,
+                            const char_type* __lo2, const char_type* __hi2) const
+{
+    for (; __lo2 != __hi2; ++__lo1, ++__lo2)
+    {
+        if (__lo1 == __hi1 || *__lo1 < *__lo2)
+            return -1;
+        if (*__lo2 < *__lo1)
+            return 1;
+    }
+    return __lo1 != __hi1;
+}
+
+template <class _CharT>
+long
+collate<_CharT>::do_hash(const char_type* __lo, const char_type* __hi) const
+{
+    size_t __h = 0;
+    const size_t __sr = __CHAR_BIT__ * sizeof(size_t) - 8;
+    const size_t __mask = size_t(0xF) << (__sr + 4);
+    for(const char_type* __p = __lo; __p != __hi; ++__p)
+    {
+        __h = (__h << 4) + static_cast<size_t>(*__p);
+        size_t __g = __h & __mask;
+        __h ^= __g | (__g >> __sr);
+    }
+    return static_cast<long>(__h);
+}
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS collate<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS collate<wchar_t>;
+#endif
+
+// template <class CharT> class collate_byname;
+
+template <class _CharT> class _LIBCPP_TEMPLATE_VIS collate_byname;
+
+template <>
+class _LIBCPP_TYPE_VIS collate_byname<char>
+    : public collate<char>
+{
+    locale_t __l_;
+public:
+    typedef char char_type;
+    typedef basic_string<char_type> string_type;
+
+    explicit collate_byname(const char* __n, size_t __refs = 0);
+    explicit collate_byname(const string& __n, size_t __refs = 0);
+
+protected:
+    ~collate_byname() override;
+    int do_compare(const char_type* __lo1, const char_type* __hi1,
+                   const char_type* __lo2, const char_type* __hi2) const override;
+    string_type do_transform(const char_type* __lo, const char_type* __hi) const override;
+};
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+class _LIBCPP_TYPE_VIS collate_byname<wchar_t>
+    : public collate<wchar_t>
+{
+    locale_t __l_;
+public:
+    typedef wchar_t char_type;
+    typedef basic_string<char_type> string_type;
+
+    explicit collate_byname(const char* __n, size_t __refs = 0);
+    explicit collate_byname(const string& __n, size_t __refs = 0);
+
+protected:
+    ~collate_byname() override;
+
+    int do_compare(const char_type* __lo1, const char_type* __hi1,
+                   const char_type* __lo2, const char_type* __hi2) const override;
+    string_type do_transform(const char_type* __lo, const char_type* __hi) const override;
+};
+#endif
+
+template <class _CharT, class _Traits, class _Allocator>
+bool
+locale::operator()(const basic_string<_CharT, _Traits, _Allocator>& __x,
+                   const basic_string<_CharT, _Traits, _Allocator>& __y) const
+{
+    return _VSTD::use_facet<_VSTD::collate<_CharT> >(*this).compare(
+                                       __x.data(), __x.data() + __x.size(),
+                                       __y.data(), __y.data() + __y.size()) < 0;
+}
+
+// template <class charT> class ctype
+
+class _LIBCPP_TYPE_VIS ctype_base
+{
+public:
+#if defined(_LIBCPP_PROVIDES_DEFAULT_RUNE_TABLE)
+    typedef unsigned long mask;
+    static const mask space  = 1<<0;
+    static const mask print  = 1<<1;
+    static const mask cntrl  = 1<<2;
+    static const mask upper  = 1<<3;
+    static const mask lower  = 1<<4;
+    static const mask alpha  = 1<<5;
+    static const mask digit  = 1<<6;
+    static const mask punct  = 1<<7;
+    static const mask xdigit = 1<<8;
+    static const mask blank  = 1<<9;
+#if defined(__BIONIC__)
+    // Historically this was a part of regex_traits rather than ctype_base. The
+    // historical value of the constant is preserved for ABI compatibility.
+    static const mask __regex_word = 0x8000;
+#else
+    static const mask __regex_word = 1<<10;
+#endif // defined(__BIONIC__)
+#elif defined(__GLIBC__)
+    typedef unsigned short mask;
+    static const mask space  = _ISspace;
+    static const mask print  = _ISprint;
+    static const mask cntrl  = _IScntrl;
+    static const mask upper  = _ISupper;
+    static const mask lower  = _ISlower;
+    static const mask alpha  = _ISalpha;
+    static const mask digit  = _ISdigit;
+    static const mask punct  = _ISpunct;
+    static const mask xdigit = _ISxdigit;
+    static const mask blank  = _ISblank;
+#if defined(__mips__)
+    static const mask __regex_word = static_cast<mask>(_ISbit(15));
+#else
+    static const mask __regex_word = 0x80;
+#endif
+#elif defined(_LIBCPP_MSVCRT_LIKE)
+    typedef unsigned short mask;
+    static const mask space  = _SPACE;
+    static const mask print  = _BLANK|_PUNCT|_ALPHA|_DIGIT;
+    static const mask cntrl  = _CONTROL;
+    static const mask upper  = _UPPER;
+    static const mask lower  = _LOWER;
+    static const mask alpha  = _ALPHA;
+    static const mask digit  = _DIGIT;
+    static const mask punct  = _PUNCT;
+    static const mask xdigit = _HEX;
+    static const mask blank  = _BLANK;
+    static const mask __regex_word = 0x4000; // 0x8000 and 0x0100 and 0x00ff are used
+# define _LIBCPP_CTYPE_MASK_IS_COMPOSITE_PRINT
+# define _LIBCPP_CTYPE_MASK_IS_COMPOSITE_ALPHA
+#elif defined(__APPLE__) || defined(__FreeBSD__) || defined(__EMSCRIPTEN__) || defined(__NetBSD__)
+# ifdef __APPLE__
+    typedef __uint32_t mask;
+# elif defined(__FreeBSD__)
+    typedef unsigned long mask;
+# elif defined(__EMSCRIPTEN__) || defined(__NetBSD__)
+    typedef unsigned short mask;
+# endif
+    static const mask space  = _CTYPE_S;
+    static const mask print  = _CTYPE_R;
+    static const mask cntrl  = _CTYPE_C;
+    static const mask upper  = _CTYPE_U;
+    static const mask lower  = _CTYPE_L;
+    static const mask alpha  = _CTYPE_A;
+    static const mask digit  = _CTYPE_D;
+    static const mask punct  = _CTYPE_P;
+    static const mask xdigit = _CTYPE_X;
+
+# if defined(__NetBSD__)
+    static const mask blank  = _CTYPE_BL;
+    // NetBSD defines classes up to 0x2000
+    // see sys/ctype_bits.h, _CTYPE_Q
+    static const mask __regex_word = 0x8000;
+# else
+    static const mask blank  = _CTYPE_B;
+    static const mask __regex_word = 0x80;
+# endif
+#elif defined(__sun__) || defined(_AIX)
+    typedef unsigned int mask;
+    static const mask space  = _ISSPACE;
+    static const mask print  = _ISPRINT;
+    static const mask cntrl  = _ISCNTRL;
+    static const mask upper  = _ISUPPER;
+    static const mask lower  = _ISLOWER;
+    static const mask alpha  = _ISALPHA;
+    static const mask digit  = _ISDIGIT;
+    static const mask punct  = _ISPUNCT;
+    static const mask xdigit = _ISXDIGIT;
+    static const mask blank  = _ISBLANK;
+# if defined(_AIX)
+    static const mask __regex_word = 0x8000;
+# else
+    static const mask __regex_word = 0x80;
+# endif
+#elif defined(_NEWLIB_VERSION)
+    // Same type as Newlib's _ctype_ array in newlib/libc/include/ctype.h.
+    typedef char mask;
+    static const mask space  = _S;
+    static const mask print  = _P | _U | _L | _N | _B;
+    static const mask cntrl  = _C;
+    static const mask upper  = _U;
+    static const mask lower  = _L;
+    static const mask alpha  = _U | _L;
+    static const mask digit  = _N;
+    static const mask punct  = _P;
+    static const mask xdigit = _X | _N;
+    static const mask blank  = _B;
+    // mask is already fully saturated, use a different type in regex_type_traits.
+    static const unsigned short __regex_word = 0x100;
+# define _LIBCPP_CTYPE_MASK_IS_COMPOSITE_PRINT
+# define _LIBCPP_CTYPE_MASK_IS_COMPOSITE_ALPHA
+# define _LIBCPP_CTYPE_MASK_IS_COMPOSITE_XDIGIT
+#elif defined(__MVS__)
+# if defined(__NATIVE_ASCII_F)
+    typedef unsigned int mask;
+    static const mask space  = _ISSPACE_A;
+    static const mask print  = _ISPRINT_A;
+    static const mask cntrl  = _ISCNTRL_A;
+    static const mask upper  = _ISUPPER_A;
+    static const mask lower  = _ISLOWER_A;
+    static const mask alpha  = _ISALPHA_A;
+    static const mask digit  = _ISDIGIT_A;
+    static const mask punct  = _ISPUNCT_A;
+    static const mask xdigit = _ISXDIGIT_A;
+    static const mask blank  = _ISBLANK_A;
+# else
+    typedef unsigned short mask;
+    static const mask space  = __ISSPACE;
+    static const mask print  = __ISPRINT;
+    static const mask cntrl  = __ISCNTRL;
+    static const mask upper  = __ISUPPER;
+    static const mask lower  = __ISLOWER;
+    static const mask alpha  = __ISALPHA;
+    static const mask digit  = __ISDIGIT;
+    static const mask punct  = __ISPUNCT;
+    static const mask xdigit = __ISXDIGIT;
+    static const mask blank  = __ISBLANK;
+# endif
+    static const mask __regex_word = 0x8000;
+#else
+# error unknown rune table for this platform -- do you mean to define _LIBCPP_PROVIDES_DEFAULT_RUNE_TABLE?
+#endif
+    static const mask alnum  = alpha | digit;
+    static const mask graph  = alnum | punct;
+
+    _LIBCPP_INLINE_VISIBILITY ctype_base() {}
+
+    static_assert((__regex_word & ~(std::make_unsigned<mask>::type)(space | print | cntrl | upper | lower | alpha |
+                                                                    digit | punct | xdigit | blank)) == __regex_word,
+                  "__regex_word can't overlap other bits");
+};
+
+template <class _CharT> class _LIBCPP_TEMPLATE_VIS ctype;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+class _LIBCPP_TYPE_VIS ctype<wchar_t>
+    : public locale::facet,
+      public ctype_base
+{
+public:
+    typedef wchar_t char_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit ctype(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool is(mask __m, char_type __c) const
+    {
+        return do_is(__m, __c);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char_type* is(const char_type* __low, const char_type* __high, mask* __vec) const
+    {
+        return do_is(__low, __high, __vec);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char_type* scan_is(mask __m, const char_type* __low, const char_type* __high) const
+    {
+        return do_scan_is(__m, __low, __high);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char_type* scan_not(mask __m, const char_type* __low, const char_type* __high) const
+    {
+        return do_scan_not(__m, __low, __high);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    char_type toupper(char_type __c) const
+    {
+        return do_toupper(__c);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char_type* toupper(char_type* __low, const char_type* __high) const
+    {
+        return do_toupper(__low, __high);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    char_type tolower(char_type __c) const
+    {
+        return do_tolower(__c);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char_type* tolower(char_type* __low, const char_type* __high) const
+    {
+        return do_tolower(__low, __high);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    char_type widen(char __c) const
+    {
+        return do_widen(__c);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char* widen(const char* __low, const char* __high, char_type* __to) const
+    {
+        return do_widen(__low, __high, __to);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    char narrow(char_type __c, char __dfault) const
+    {
+        return do_narrow(__c, __dfault);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char_type* narrow(const char_type* __low, const char_type* __high, char __dfault, char* __to) const
+    {
+        return do_narrow(__low, __high, __dfault, __to);
+    }
+
+    static locale::id id;
+
+protected:
+    ~ctype() override;
+    virtual bool do_is(mask __m, char_type __c) const;
+    virtual const char_type* do_is(const char_type* __low, const char_type* __high, mask* __vec) const;
+    virtual const char_type* do_scan_is(mask __m, const char_type* __low, const char_type* __high) const;
+    virtual const char_type* do_scan_not(mask __m, const char_type* __low, const char_type* __high) const;
+    virtual char_type do_toupper(char_type) const;
+    virtual const char_type* do_toupper(char_type* __low, const char_type* __high) const;
+    virtual char_type do_tolower(char_type) const;
+    virtual const char_type* do_tolower(char_type* __low, const char_type* __high) const;
+    virtual char_type do_widen(char) const;
+    virtual const char* do_widen(const char* __low, const char* __high, char_type* __dest) const;
+    virtual char do_narrow(char_type, char __dfault) const;
+    virtual const char_type* do_narrow(const char_type* __low, const char_type* __high, char __dfault, char* __dest) const;
+};
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+template <>
+class _LIBCPP_TYPE_VIS ctype<char>
+    : public locale::facet, public ctype_base
+{
+    const mask* __tab_;
+    bool        __del_;
+public:
+    typedef char char_type;
+
+    explicit ctype(const mask* __tab = nullptr, bool __del = false, size_t __refs = 0);
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool is(mask __m, char_type __c) const
+    {
+        return isascii(__c) ? (__tab_[static_cast<int>(__c)] & __m) !=0 : false;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char_type* is(const char_type* __low, const char_type* __high, mask* __vec) const
+    {
+        for (; __low != __high; ++__low, ++__vec)
+            *__vec = isascii(*__low) ? __tab_[static_cast<int>(*__low)] : 0;
+        return __low;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char_type* scan_is (mask __m, const char_type* __low, const char_type* __high) const
+    {
+        for (; __low != __high; ++__low)
+            if (isascii(*__low) && (__tab_[static_cast<int>(*__low)] & __m))
+                break;
+        return __low;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char_type* scan_not(mask __m, const char_type* __low, const char_type* __high) const
+    {
+        for (; __low != __high; ++__low)
+            if (!isascii(*__low) || !(__tab_[static_cast<int>(*__low)] & __m))
+                break;
+        return __low;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    char_type toupper(char_type __c) const
+    {
+        return do_toupper(__c);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char_type* toupper(char_type* __low, const char_type* __high) const
+    {
+        return do_toupper(__low, __high);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    char_type tolower(char_type __c) const
+    {
+        return do_tolower(__c);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char_type* tolower(char_type* __low, const char_type* __high) const
+    {
+        return do_tolower(__low, __high);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    char_type widen(char __c) const
+    {
+        return do_widen(__c);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char* widen(const char* __low, const char* __high, char_type* __to) const
+    {
+        return do_widen(__low, __high, __to);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    char narrow(char_type __c, char __dfault) const
+    {
+        return do_narrow(__c, __dfault);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char* narrow(const char_type* __low, const char_type* __high, char __dfault, char* __to) const
+    {
+        return do_narrow(__low, __high, __dfault, __to);
+    }
+
+    static locale::id id;
+
+#ifdef _CACHED_RUNES
+    static const size_t table_size = _CACHED_RUNES;
+#else
+    static const size_t table_size = 256;  // FIXME: Don't hardcode this.
+#endif
+    _LIBCPP_INLINE_VISIBILITY const mask* table() const  _NOEXCEPT {return __tab_;}
+    static const mask* classic_table()  _NOEXCEPT;
+#if defined(__GLIBC__) || defined(__EMSCRIPTEN__)
+    static const int* __classic_upper_table() _NOEXCEPT;
+    static const int* __classic_lower_table() _NOEXCEPT;
+#endif
+#if defined(__NetBSD__)
+    static const short* __classic_upper_table() _NOEXCEPT;
+    static const short* __classic_lower_table() _NOEXCEPT;
+#endif
+#if defined(__MVS__)
+    static const unsigned short* __classic_upper_table() _NOEXCEPT;
+    static const unsigned short* __classic_lower_table() _NOEXCEPT;
+#endif
+
+protected:
+    ~ctype() override;
+    virtual char_type do_toupper(char_type __c) const;
+    virtual const char_type* do_toupper(char_type* __low, const char_type* __high) const;
+    virtual char_type do_tolower(char_type __c) const;
+    virtual const char_type* do_tolower(char_type* __low, const char_type* __high) const;
+    virtual char_type do_widen(char __c) const;
+    virtual const char* do_widen(const char* __low, const char* __high, char_type* __to) const;
+    virtual char do_narrow(char_type __c, char __dfault) const;
+    virtual const char* do_narrow(const char_type* __low, const char_type* __high, char __dfault, char* __to) const;
+};
+
+// template <class CharT> class ctype_byname;
+
+template <class _CharT> class _LIBCPP_TEMPLATE_VIS ctype_byname;
+
+template <>
+class _LIBCPP_TYPE_VIS ctype_byname<char>
+    : public ctype<char>
+{
+    locale_t __l_;
+
+public:
+    explicit ctype_byname(const char*, size_t = 0);
+    explicit ctype_byname(const string&, size_t = 0);
+
+protected:
+    ~ctype_byname() override;
+    char_type do_toupper(char_type) const override;
+    const char_type* do_toupper(char_type* __low, const char_type* __high) const override;
+    char_type do_tolower(char_type) const override;
+    const char_type* do_tolower(char_type* __low, const char_type* __high) const override;
+};
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+class _LIBCPP_TYPE_VIS ctype_byname<wchar_t>
+    : public ctype<wchar_t>
+{
+    locale_t __l_;
+
+public:
+    explicit ctype_byname(const char*, size_t = 0);
+    explicit ctype_byname(const string&, size_t = 0);
+
+protected:
+    ~ctype_byname() override;
+    bool do_is(mask __m, char_type __c) const override;
+    const char_type* do_is(const char_type* __low, const char_type* __high, mask* __vec) const override;
+    const char_type* do_scan_is(mask __m, const char_type* __low, const char_type* __high) const override;
+    const char_type* do_scan_not(mask __m, const char_type* __low, const char_type* __high) const override;
+    char_type do_toupper(char_type) const override;
+    const char_type* do_toupper(char_type* __low, const char_type* __high) const override;
+    char_type do_tolower(char_type) const override;
+    const char_type* do_tolower(char_type* __low, const char_type* __high) const override;
+    char_type do_widen(char) const override;
+    const char* do_widen(const char* __low, const char* __high, char_type* __dest) const override;
+    char do_narrow(char_type, char __dfault) const override;
+    const char_type* do_narrow(const char_type* __low, const char_type* __high, char __dfault, char* __dest) const override;
+};
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+isspace(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).is(ctype_base::space, __c);
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+isprint(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).is(ctype_base::print, __c);
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+iscntrl(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).is(ctype_base::cntrl, __c);
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+isupper(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).is(ctype_base::upper, __c);
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+islower(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).is(ctype_base::lower, __c);
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+isalpha(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).is(ctype_base::alpha, __c);
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+isdigit(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).is(ctype_base::digit, __c);
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+ispunct(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).is(ctype_base::punct, __c);
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+isxdigit(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).is(ctype_base::xdigit, __c);
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+isalnum(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).is(ctype_base::alnum, __c);
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+isgraph(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).is(ctype_base::graph, __c);
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+_CharT
+toupper(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).toupper(__c);
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+_CharT
+tolower(_CharT __c, const locale& __loc)
+{
+    return std::use_facet<ctype<_CharT> >(__loc).tolower(__c);
+}
+
+// codecvt_base
+
+class _LIBCPP_TYPE_VIS codecvt_base
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY codecvt_base() {}
+    enum result {ok, partial, error, noconv};
+};
+
+// template <class internT, class externT, class stateT> class codecvt;
+
+template <class _InternT, class _ExternT, class _StateT> class _LIBCPP_TEMPLATE_VIS codecvt;
+
+// template <> class codecvt<char, char, mbstate_t>
+
+template <>
+class _LIBCPP_TYPE_VIS codecvt<char, char, mbstate_t>
+    : public locale::facet,
+      public codecvt_base
+{
+public:
+    typedef char      intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result out(state_type& __st,
+               const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+               extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const
+    {
+        return do_out(__st, __frm, __frm_end, __frm_nxt, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result unshift(state_type& __st,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const
+    {
+        return do_unshift(__st, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result in(state_type& __st,
+              const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+              intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const
+    {
+        return do_in(__st, __frm, __frm_end, __frm_nxt, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int encoding() const  _NOEXCEPT
+    {
+        return do_encoding();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool always_noconv() const  _NOEXCEPT
+    {
+        return do_always_noconv();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int length(state_type& __st, const extern_type* __frm, const extern_type* __end, size_t __mx) const
+    {
+        return do_length(__st, __frm, __end, __mx);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int max_length() const  _NOEXCEPT
+    {
+        return do_max_length();
+    }
+
+    static locale::id id;
+
+protected:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt(const char*, size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    ~codecvt() override;
+
+    virtual result do_out(state_type& __st,
+                          const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                          extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const;
+    virtual result do_in(state_type& __st,
+                         const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                         intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const;
+    virtual result do_unshift(state_type& __st,
+                              extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const;
+    virtual int do_encoding() const  _NOEXCEPT;
+    virtual bool do_always_noconv() const  _NOEXCEPT;
+    virtual int do_length(state_type& __st, const extern_type* __frm, const extern_type* __end, size_t __mx) const;
+    virtual int do_max_length() const  _NOEXCEPT;
+};
+
+// template <> class codecvt<wchar_t, char, mbstate_t>
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+class _LIBCPP_TYPE_VIS codecvt<wchar_t, char, mbstate_t>
+    : public locale::facet,
+      public codecvt_base
+{
+    locale_t __l_;
+public:
+    typedef wchar_t   intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+    explicit codecvt(size_t __refs = 0);
+
+    _LIBCPP_INLINE_VISIBILITY
+    result out(state_type& __st,
+               const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+               extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const
+    {
+        return do_out(__st, __frm, __frm_end, __frm_nxt, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result unshift(state_type& __st,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const
+    {
+        return do_unshift(__st, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result in(state_type& __st,
+              const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+              intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const
+    {
+        return do_in(__st, __frm, __frm_end, __frm_nxt, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int encoding() const  _NOEXCEPT
+    {
+        return do_encoding();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool always_noconv() const  _NOEXCEPT
+    {
+        return do_always_noconv();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int length(state_type& __st, const extern_type* __frm, const extern_type* __end, size_t __mx) const
+    {
+        return do_length(__st, __frm, __end, __mx);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int max_length() const  _NOEXCEPT
+    {
+        return do_max_length();
+    }
+
+    static locale::id id;
+
+protected:
+    explicit codecvt(const char*, size_t __refs = 0);
+
+    ~codecvt() override;
+
+    virtual result do_out(state_type& __st,
+                          const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                          extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const;
+    virtual result do_in(state_type& __st,
+                         const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                         intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const;
+    virtual result do_unshift(state_type& __st,
+                              extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const;
+    virtual int do_encoding() const  _NOEXCEPT;
+    virtual bool do_always_noconv() const  _NOEXCEPT;
+    virtual int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const;
+    virtual int do_max_length() const  _NOEXCEPT;
+};
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+// template <> class codecvt<char16_t, char, mbstate_t> // deprecated in C++20
+
+template <>
+class _LIBCPP_DEPRECATED_IN_CXX20 _LIBCPP_TYPE_VIS codecvt<char16_t, char, mbstate_t>
+    : public locale::facet,
+      public codecvt_base
+{
+public:
+    typedef char16_t  intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result out(state_type& __st,
+               const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+               extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const
+    {
+        return do_out(__st, __frm, __frm_end, __frm_nxt, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result unshift(state_type& __st,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const
+    {
+        return do_unshift(__st, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result in(state_type& __st,
+              const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+              intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const
+    {
+        return do_in(__st, __frm, __frm_end, __frm_nxt, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int encoding() const  _NOEXCEPT
+    {
+        return do_encoding();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool always_noconv() const  _NOEXCEPT
+    {
+        return do_always_noconv();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int length(state_type& __st, const extern_type* __frm, const extern_type* __end, size_t __mx) const
+    {
+        return do_length(__st, __frm, __end, __mx);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int max_length() const  _NOEXCEPT
+    {
+        return do_max_length();
+    }
+
+    static locale::id id;
+
+protected:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt(const char*, size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    ~codecvt() override;
+
+    virtual result do_out(state_type& __st,
+                          const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                          extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const;
+    virtual result do_in(state_type& __st,
+                         const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                         intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const;
+    virtual result do_unshift(state_type& __st,
+                              extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const;
+    virtual int do_encoding() const  _NOEXCEPT;
+    virtual bool do_always_noconv() const  _NOEXCEPT;
+    virtual int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const;
+    virtual int do_max_length() const  _NOEXCEPT;
+};
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+
+// template <> class codecvt<char16_t, char8_t, mbstate_t> // C++20
+
+template <>
+class _LIBCPP_TYPE_VIS codecvt<char16_t, char8_t, mbstate_t>
+    : public locale::facet,
+      public codecvt_base
+{
+public:
+    typedef char16_t  intern_type;
+    typedef char8_t   extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result out(state_type& __st,
+               const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+               extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const
+    {
+        return do_out(__st, __frm, __frm_end, __frm_nxt, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result unshift(state_type& __st,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const
+    {
+        return do_unshift(__st, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result in(state_type& __st,
+              const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+              intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const
+    {
+        return do_in(__st, __frm, __frm_end, __frm_nxt, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int encoding() const  _NOEXCEPT
+    {
+        return do_encoding();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool always_noconv() const  _NOEXCEPT
+    {
+        return do_always_noconv();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int length(state_type& __st, const extern_type* __frm, const extern_type* __end, size_t __mx) const
+    {
+        return do_length(__st, __frm, __end, __mx);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int max_length() const  _NOEXCEPT
+    {
+        return do_max_length();
+    }
+
+    static locale::id id;
+
+protected:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt(const char*, size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    ~codecvt() override;
+
+    virtual result do_out(state_type& __st,
+                          const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                          extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const;
+    virtual result do_in(state_type& __st,
+                         const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                         intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const;
+    virtual result do_unshift(state_type& __st,
+                              extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const;
+    virtual int do_encoding() const  _NOEXCEPT;
+    virtual bool do_always_noconv() const  _NOEXCEPT;
+    virtual int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const;
+    virtual int do_max_length() const  _NOEXCEPT;
+};
+
+#endif
+
+// template <> class codecvt<char32_t, char, mbstate_t> // deprecated in C++20
+
+template <>
+class _LIBCPP_DEPRECATED_IN_CXX20 _LIBCPP_TYPE_VIS codecvt<char32_t, char, mbstate_t>
+    : public locale::facet,
+      public codecvt_base
+{
+public:
+    typedef char32_t  intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result out(state_type& __st,
+               const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+               extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const
+    {
+        return do_out(__st, __frm, __frm_end, __frm_nxt, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result unshift(state_type& __st,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const
+    {
+        return do_unshift(__st, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result in(state_type& __st,
+              const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+              intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const
+    {
+        return do_in(__st, __frm, __frm_end, __frm_nxt, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int encoding() const  _NOEXCEPT
+    {
+        return do_encoding();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool always_noconv() const  _NOEXCEPT
+    {
+        return do_always_noconv();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int length(state_type& __st, const extern_type* __frm, const extern_type* __end, size_t __mx) const
+    {
+        return do_length(__st, __frm, __end, __mx);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int max_length() const  _NOEXCEPT
+    {
+        return do_max_length();
+    }
+
+    static locale::id id;
+
+protected:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt(const char*, size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    ~codecvt() override;
+
+    virtual result do_out(state_type& __st,
+                          const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                          extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const;
+    virtual result do_in(state_type& __st,
+                         const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                         intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const;
+    virtual result do_unshift(state_type& __st,
+                              extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const;
+    virtual int do_encoding() const  _NOEXCEPT;
+    virtual bool do_always_noconv() const  _NOEXCEPT;
+    virtual int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const;
+    virtual int do_max_length() const  _NOEXCEPT;
+};
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+
+// template <> class codecvt<char32_t, char8_t, mbstate_t> // C++20
+
+template <>
+class _LIBCPP_TYPE_VIS codecvt<char32_t, char8_t, mbstate_t>
+    : public locale::facet,
+      public codecvt_base
+{
+public:
+    typedef char32_t  intern_type;
+    typedef char8_t   extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result out(state_type& __st,
+               const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+               extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const
+    {
+        return do_out(__st, __frm, __frm_end, __frm_nxt, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result unshift(state_type& __st,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const
+    {
+        return do_unshift(__st, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result in(state_type& __st,
+              const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+              intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const
+    {
+        return do_in(__st, __frm, __frm_end, __frm_nxt, __to, __to_end, __to_nxt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int encoding() const  _NOEXCEPT
+    {
+        return do_encoding();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool always_noconv() const  _NOEXCEPT
+    {
+        return do_always_noconv();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int length(state_type& __st, const extern_type* __frm, const extern_type* __end, size_t __mx) const
+    {
+        return do_length(__st, __frm, __end, __mx);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int max_length() const  _NOEXCEPT
+    {
+        return do_max_length();
+    }
+
+    static locale::id id;
+
+protected:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt(const char*, size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    ~codecvt() override;
+
+    virtual result do_out(state_type& __st,
+                          const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                          extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const;
+    virtual result do_in(state_type& __st,
+                         const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                         intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const;
+    virtual result do_unshift(state_type& __st,
+                              extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const;
+    virtual int do_encoding() const  _NOEXCEPT;
+    virtual bool do_always_noconv() const  _NOEXCEPT;
+    virtual int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const;
+    virtual int do_max_length() const  _NOEXCEPT;
+};
+
+#endif
+
+// template <class _InternT, class _ExternT, class _StateT> class codecvt_byname
+
+template <class _InternT, class _ExternT, class _StateT>
+class _LIBCPP_TEMPLATE_VIS codecvt_byname
+    : public codecvt<_InternT, _ExternT, _StateT>
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt_byname(const char* __nm, size_t __refs = 0)
+        : codecvt<_InternT, _ExternT, _StateT>(__nm, __refs) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt_byname(const string& __nm, size_t __refs = 0)
+        : codecvt<_InternT, _ExternT, _StateT>(__nm.c_str(), __refs) {}
+protected:
+    ~codecvt_byname() override;
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _InternT, class _ExternT, class _StateT>
+codecvt_byname<_InternT, _ExternT, _StateT>::~codecvt_byname()
+{
+}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS codecvt_byname<char, char, mbstate_t>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS codecvt_byname<wchar_t, char, mbstate_t>;
+#endif
+extern template class _LIBCPP_DEPRECATED_IN_CXX20 _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS codecvt_byname<char16_t, char, mbstate_t>; // deprecated in C++20
+extern template class _LIBCPP_DEPRECATED_IN_CXX20 _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS codecvt_byname<char32_t, char, mbstate_t>; // deprecated in C++20
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS codecvt_byname<char16_t, char8_t, mbstate_t>; // C++20
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS codecvt_byname<char32_t, char8_t, mbstate_t>; // C++20
+#endif
+
+template <size_t _Np>
+struct __narrow_to_utf8
+{
+    template <class _OutputIterator, class _CharT>
+    _OutputIterator
+    operator()(_OutputIterator __s, const _CharT* __wb, const _CharT* __we) const;
+};
+
+template <>
+struct __narrow_to_utf8<8>
+{
+    template <class _OutputIterator, class _CharT>
+    _LIBCPP_INLINE_VISIBILITY
+    _OutputIterator
+    operator()(_OutputIterator __s, const _CharT* __wb, const _CharT* __we) const
+    {
+        for (; __wb < __we; ++__wb, ++__s)
+            *__s = *__wb;
+        return __s;
+    }
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <>
+struct _LIBCPP_TYPE_VIS __narrow_to_utf8<16>
+    : public codecvt<char16_t, char, mbstate_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    __narrow_to_utf8() : codecvt<char16_t, char, mbstate_t>(1) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+    ~__narrow_to_utf8() override;
+
+    template <class _OutputIterator, class _CharT>
+    _LIBCPP_INLINE_VISIBILITY
+    _OutputIterator
+    operator()(_OutputIterator __s, const _CharT* __wb, const _CharT* __we) const
+    {
+        result __r = ok;
+        mbstate_t __mb;
+        while (__wb < __we && __r != error)
+        {
+            const int __sz = 32;
+            char __buf[__sz];
+            char* __bn;
+            const char16_t* __wn = (const char16_t*)__wb;
+            __r = do_out(__mb, (const char16_t*)__wb, (const char16_t*)__we, __wn,
+                         __buf, __buf+__sz, __bn);
+            if (__r == codecvt_base::error || __wn == (const char16_t*)__wb)
+                __throw_runtime_error("locale not supported");
+            for (const char* __p = __buf; __p < __bn; ++__p, ++__s)
+                *__s = *__p;
+            __wb = (const _CharT*)__wn;
+        }
+        return __s;
+    }
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <>
+struct _LIBCPP_TYPE_VIS __narrow_to_utf8<32>
+    : public codecvt<char32_t, char, mbstate_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    __narrow_to_utf8() : codecvt<char32_t, char, mbstate_t>(1) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+    ~__narrow_to_utf8() override;
+
+    template <class _OutputIterator, class _CharT>
+    _LIBCPP_INLINE_VISIBILITY
+    _OutputIterator
+    operator()(_OutputIterator __s, const _CharT* __wb, const _CharT* __we) const
+    {
+        result __r = ok;
+        mbstate_t __mb;
+        while (__wb < __we && __r != error)
+        {
+            const int __sz = 32;
+            char __buf[__sz];
+            char* __bn;
+            const char32_t* __wn = (const char32_t*)__wb;
+            __r = do_out(__mb, (const char32_t*)__wb, (const char32_t*)__we, __wn,
+                         __buf, __buf+__sz, __bn);
+            if (__r == codecvt_base::error || __wn == (const char32_t*)__wb)
+                __throw_runtime_error("locale not supported");
+            for (const char* __p = __buf; __p < __bn; ++__p, ++__s)
+                *__s = *__p;
+            __wb = (const _CharT*)__wn;
+        }
+        return __s;
+    }
+};
+
+template <size_t _Np>
+struct __widen_from_utf8
+{
+    template <class _OutputIterator>
+    _OutputIterator
+    operator()(_OutputIterator __s, const char* __nb, const char* __ne) const;
+};
+
+template <>
+struct __widen_from_utf8<8>
+{
+    template <class _OutputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+    _OutputIterator
+    operator()(_OutputIterator __s, const char* __nb, const char* __ne) const
+    {
+        for (; __nb < __ne; ++__nb, ++__s)
+            *__s = *__nb;
+        return __s;
+    }
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <>
+struct _LIBCPP_TYPE_VIS __widen_from_utf8<16>
+    : public codecvt<char16_t, char, mbstate_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    __widen_from_utf8() : codecvt<char16_t, char, mbstate_t>(1) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+    ~__widen_from_utf8() override;
+
+    template <class _OutputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+    _OutputIterator
+    operator()(_OutputIterator __s, const char* __nb, const char* __ne) const
+    {
+        result __r = ok;
+        mbstate_t __mb;
+        while (__nb < __ne && __r != error)
+        {
+            const int __sz = 32;
+            char16_t __buf[__sz];
+            char16_t* __bn;
+            const char* __nn = __nb;
+            __r = do_in(__mb, __nb, __ne - __nb > __sz ? __nb+__sz : __ne, __nn,
+                        __buf, __buf+__sz, __bn);
+            if (__r == codecvt_base::error || __nn == __nb)
+                __throw_runtime_error("locale not supported");
+            for (const char16_t* __p = __buf; __p < __bn; ++__p, ++__s)
+                *__s = *__p;
+            __nb = __nn;
+        }
+        return __s;
+    }
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <>
+struct _LIBCPP_TYPE_VIS __widen_from_utf8<32>
+    : public codecvt<char32_t, char, mbstate_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    __widen_from_utf8() : codecvt<char32_t, char, mbstate_t>(1) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+    ~__widen_from_utf8() override;
+
+    template <class _OutputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+    _OutputIterator
+    operator()(_OutputIterator __s, const char* __nb, const char* __ne) const
+    {
+        result __r = ok;
+        mbstate_t __mb;
+        while (__nb < __ne && __r != error)
+        {
+            const int __sz = 32;
+            char32_t __buf[__sz];
+            char32_t* __bn;
+            const char* __nn = __nb;
+            __r = do_in(__mb, __nb, __ne - __nb > __sz ? __nb+__sz : __ne, __nn,
+                        __buf, __buf+__sz, __bn);
+            if (__r == codecvt_base::error || __nn == __nb)
+                __throw_runtime_error("locale not supported");
+            for (const char32_t* __p = __buf; __p < __bn; ++__p, ++__s)
+                *__s = *__p;
+            __nb = __nn;
+        }
+        return __s;
+    }
+};
+
+// template <class charT> class numpunct
+
+template <class _CharT> class _LIBCPP_TEMPLATE_VIS numpunct;
+
+template <>
+class _LIBCPP_TYPE_VIS numpunct<char>
+    : public locale::facet
+{
+public:
+    typedef char char_type;
+    typedef basic_string<char_type> string_type;
+
+    explicit numpunct(size_t __refs = 0);
+
+    _LIBCPP_INLINE_VISIBILITY char_type decimal_point() const {return do_decimal_point();}
+    _LIBCPP_INLINE_VISIBILITY char_type thousands_sep() const {return do_thousands_sep();}
+    _LIBCPP_INLINE_VISIBILITY string grouping() const         {return do_grouping();}
+    _LIBCPP_INLINE_VISIBILITY string_type truename() const    {return do_truename();}
+    _LIBCPP_INLINE_VISIBILITY string_type falsename() const   {return do_falsename();}
+
+    static locale::id id;
+
+protected:
+    ~numpunct() override;
+    virtual char_type do_decimal_point() const;
+    virtual char_type do_thousands_sep() const;
+    virtual string do_grouping() const;
+    virtual string_type do_truename() const;
+    virtual string_type do_falsename() const;
+
+    char_type __decimal_point_;
+    char_type __thousands_sep_;
+    string __grouping_;
+};
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+class _LIBCPP_TYPE_VIS numpunct<wchar_t>
+    : public locale::facet
+{
+public:
+    typedef wchar_t char_type;
+    typedef basic_string<char_type> string_type;
+
+    explicit numpunct(size_t __refs = 0);
+
+    _LIBCPP_INLINE_VISIBILITY char_type decimal_point() const {return do_decimal_point();}
+    _LIBCPP_INLINE_VISIBILITY char_type thousands_sep() const {return do_thousands_sep();}
+    _LIBCPP_INLINE_VISIBILITY string grouping() const         {return do_grouping();}
+    _LIBCPP_INLINE_VISIBILITY string_type truename() const    {return do_truename();}
+    _LIBCPP_INLINE_VISIBILITY string_type falsename() const   {return do_falsename();}
+
+    static locale::id id;
+
+protected:
+    ~numpunct() override;
+    virtual char_type do_decimal_point() const;
+    virtual char_type do_thousands_sep() const;
+    virtual string do_grouping() const;
+    virtual string_type do_truename() const;
+    virtual string_type do_falsename() const;
+
+    char_type __decimal_point_;
+    char_type __thousands_sep_;
+    string __grouping_;
+};
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+// template <class charT> class numpunct_byname
+
+template <class _CharT> class _LIBCPP_TEMPLATE_VIS numpunct_byname;
+
+template <>
+class _LIBCPP_TYPE_VIS numpunct_byname<char>
+: public numpunct<char>
+{
+public:
+    typedef char char_type;
+    typedef basic_string<char_type> string_type;
+
+    explicit numpunct_byname(const char* __nm, size_t __refs = 0);
+    explicit numpunct_byname(const string& __nm, size_t __refs = 0);
+
+protected:
+    ~numpunct_byname() override;
+
+private:
+    void __init(const char*);
+};
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+class _LIBCPP_TYPE_VIS numpunct_byname<wchar_t>
+: public numpunct<wchar_t>
+{
+public:
+    typedef wchar_t char_type;
+    typedef basic_string<char_type> string_type;
+
+    explicit numpunct_byname(const char* __nm, size_t __refs = 0);
+    explicit numpunct_byname(const string& __nm, size_t __refs = 0);
+
+protected:
+    ~numpunct_byname() override;
+
+private:
+    void __init(const char*);
+};
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___LOCALE
diff --git a/app/src/main/cpp/libcxx/include/__mbstate_t.h b/app/src/main/cpp/libcxx/include/__mbstate_t.h
new file mode 100644
index 0000000..487a6d0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__mbstate_t.h
@@ -0,0 +1,44 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MBSTATE_T_H
+#define _LIBCPP___MBSTATE_T_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+// TODO(ldionne):
+// The goal of this header is to provide mbstate_t without having to pull in
+// <wchar.h> or <uchar.h>. This is necessary because we need that type even
+// when we don't have (or try to provide) support for wchar_t, because several
+// types like std::fpos are defined in terms of mbstate_t.
+//
+// This is a gruesome hack, but I don't know how to make it cleaner for
+// the time being.
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+#   include <wchar.h> // for mbstate_t
+#elif __has_include(<bits/types/mbstate_t.h>)
+#   include <bits/types/mbstate_t.h> // works on most Unixes
+#elif __has_include(<sys/_types/_mbstate_t.h>)
+#   include <sys/_types/_mbstate_t.h> // works on Darwin
+#else
+#   error "The library was configured without support for wide-characters, but we don't know how to get the definition of mbstate_t without <wchar.h> on your platform."
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::mbstate_t _LIBCPP_USING_IF_EXISTS;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MBSTATE_T_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/addressof.h b/app/src/main/cpp/libcxx/include/__memory/addressof.h
new file mode 100644
index 0000000..d4c69b8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/addressof.h
@@ -0,0 +1,76 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_ADDRESSOF_H
+#define _LIBCPP___MEMORY_ADDRESSOF_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX17
+_LIBCPP_NO_CFI _LIBCPP_INLINE_VISIBILITY
+_Tp*
+addressof(_Tp& __x) _NOEXCEPT
+{
+    return __builtin_addressof(__x);
+}
+
+#if defined(_LIBCPP_HAS_OBJC_ARC) && !defined(_LIBCPP_PREDEFINED_OBJC_ARC_ADDRESSOF)
+// Objective-C++ Automatic Reference Counting uses qualified pointers
+// that require special addressof() signatures. When
+// _LIBCPP_PREDEFINED_OBJC_ARC_ADDRESSOF is defined, the compiler
+// itself is providing these definitions. Otherwise, we provide them.
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+__strong _Tp*
+addressof(__strong _Tp& __x) _NOEXCEPT
+{
+  return &__x;
+}
+
+#ifdef _LIBCPP_HAS_OBJC_ARC_WEAK
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+__weak _Tp*
+addressof(__weak _Tp& __x) _NOEXCEPT
+{
+  return &__x;
+}
+#endif
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+__autoreleasing _Tp*
+addressof(__autoreleasing _Tp& __x) _NOEXCEPT
+{
+  return &__x;
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+__unsafe_unretained _Tp*
+addressof(__unsafe_unretained _Tp& __x) _NOEXCEPT
+{
+  return &__x;
+}
+#endif
+
+#if !defined(_LIBCPP_CXX03_LANG)
+template <class _Tp> _Tp* addressof(const _Tp&&) noexcept = delete;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_ADDRESSOF_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/align.h b/app/src/main/cpp/libcxx/include/__memory/align.h
new file mode 100644
index 0000000..c679220
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/align.h
@@ -0,0 +1,25 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_ALIGN_H
+#define _LIBCPP___MEMORY_ALIGN_H
+
+#include <__config>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+_LIBCPP_FUNC_VIS void* align(size_t __align, size_t __sz, void*& __ptr, size_t& __space);
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_ALIGN_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/allocate_at_least.h b/app/src/main/cpp/libcxx/include/__memory/allocate_at_least.h
new file mode 100644
index 0000000..ef205f8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/allocate_at_least.h
@@ -0,0 +1,62 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_ALLOCATE_AT_LEAST_H
+#define _LIBCPP___MEMORY_ALLOCATE_AT_LEAST_H
+
+#include <__config>
+#include <__memory/allocator_traits.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 20
+template <class _Pointer>
+struct allocation_result {
+  _Pointer ptr;
+  size_t count;
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(allocation_result);
+
+template <class _Alloc>
+[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr
+allocation_result<typename allocator_traits<_Alloc>::pointer> allocate_at_least(_Alloc& __alloc, size_t __n) {
+  if constexpr (requires { __alloc.allocate_at_least(__n); }) {
+    return __alloc.allocate_at_least(__n);
+  } else {
+    return {__alloc.allocate(__n), __n};
+  }
+}
+
+template <class _Alloc>
+[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr
+auto __allocate_at_least(_Alloc& __alloc, size_t __n) {
+  return std::allocate_at_least(__alloc, __n);
+}
+#else
+template <class _Pointer>
+struct __allocation_result {
+  _Pointer ptr;
+  size_t count;
+};
+
+template <class _Alloc>
+_LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+__allocation_result<typename allocator_traits<_Alloc>::pointer> __allocate_at_least(_Alloc& __alloc, size_t __n) {
+  return {__alloc.allocate(__n), __n};
+}
+
+#endif // _LIBCPP_STD_VER > 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_ALLOCATE_AT_LEAST_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/allocation_guard.h b/app/src/main/cpp/libcxx/include/__memory/allocation_guard.h
new file mode 100644
index 0000000..424598c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/allocation_guard.h
@@ -0,0 +1,83 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_ALLOCATION_GUARD_H
+#define _LIBCPP___MEMORY_ALLOCATION_GUARD_H
+
+#include <__config>
+#include <__memory/allocator_traits.h>
+#include <__utility/move.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Helper class to allocate memory using an Allocator in an exception safe
+// manner.
+//
+// The intended usage of this class is as follows:
+//
+// 0
+// 1     __allocation_guard<SomeAllocator> guard(alloc, 10);
+// 2     do_some_initialization_that_may_throw(guard.__get());
+// 3     save_allocated_pointer_in_a_noexcept_operation(guard.__release_ptr());
+// 4
+//
+// If line (2) throws an exception during initialization of the memory, the
+// guard's destructor will be called, and the memory will be released using
+// Allocator deallocation. Otherwise, we release the memory from the guard on
+// line (3) in an operation that can't throw -- after that, the guard is not
+// responsible for the memory anymore.
+//
+// This is similar to a unique_ptr, except it's easier to use with a
+// custom allocator.
+template<class _Alloc>
+struct __allocation_guard {
+    using _Pointer = typename allocator_traits<_Alloc>::pointer;
+    using _Size = typename allocator_traits<_Alloc>::size_type;
+
+    template<class _AllocT> // we perform the allocator conversion inside the constructor
+    _LIBCPP_HIDE_FROM_ABI
+    explicit __allocation_guard(_AllocT __alloc, _Size __n)
+        : __alloc_(_VSTD::move(__alloc))
+        , __n_(__n)
+        , __ptr_(allocator_traits<_Alloc>::allocate(__alloc_, __n_)) // initialization order is important
+    { }
+
+    _LIBCPP_HIDE_FROM_ABI
+    ~__allocation_guard() _NOEXCEPT {
+        if (__ptr_ != nullptr) {
+            allocator_traits<_Alloc>::deallocate(__alloc_, __ptr_, __n_);
+        }
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    _Pointer __release_ptr() _NOEXCEPT { // not called __release() because it's a keyword in objective-c++
+        _Pointer __tmp = __ptr_;
+        __ptr_ = nullptr;
+        return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    _Pointer __get() const _NOEXCEPT {
+        return __ptr_;
+    }
+
+private:
+    _Alloc __alloc_;
+    _Size __n_;
+    _Pointer __ptr_;
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_ALLOCATION_GUARD_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/allocator.h b/app/src/main/cpp/libcxx/include/__memory/allocator.h
new file mode 100644
index 0000000..54c9b78
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/allocator.h
@@ -0,0 +1,273 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_ALLOCATOR_H
+#define _LIBCPP___MEMORY_ALLOCATOR_H
+
+#include <__config>
+#include <__memory/allocate_at_least.h>
+#include <__memory/allocator_traits.h>
+#include <__type_traits/is_constant_evaluated.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_void.h>
+#include <__type_traits/is_volatile.h>
+#include <__utility/forward.h>
+#include <cstddef>
+#include <new>
+#include <stdexcept>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> class allocator;
+
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_ALLOCATOR_VOID_SPECIALIZATION)
+// These specializations shouldn't be marked _LIBCPP_DEPRECATED_IN_CXX17.
+// Specializing allocator<void> is deprecated, but not using it.
+template <>
+class _LIBCPP_TEMPLATE_VIS allocator<void>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_ALLOCATOR_MEMBERS)
+public:
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef void*             pointer;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef const void*       const_pointer;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef void              value_type;
+
+    template <class _Up> struct _LIBCPP_DEPRECATED_IN_CXX17 rebind {typedef allocator<_Up> other;};
+#endif
+};
+
+template <>
+class _LIBCPP_TEMPLATE_VIS allocator<const void>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_ALLOCATOR_MEMBERS)
+public:
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef const void*       pointer;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef const void*       const_pointer;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef const void        value_type;
+
+    template <class _Up> struct _LIBCPP_DEPRECATED_IN_CXX17 rebind {typedef allocator<_Up> other;};
+#endif
+};
+#endif
+
+// This class provides a non-trivial default constructor to the class that derives from it
+// if the condition is satisfied.
+//
+// The second template parameter exists to allow giving a unique type to __non_trivial_if,
+// which makes it possible to avoid breaking the ABI when making this a base class of an
+// existing class. Without that, imagine we have classes D1 and D2, both of which used to
+// have no base classes, but which now derive from __non_trivial_if. The layout of a class
+// that inherits from both D1 and D2 will change because the two __non_trivial_if base
+// classes are not allowed to share the same address.
+//
+// By making those __non_trivial_if base classes unique, we work around this problem and
+// it is safe to start deriving from __non_trivial_if in existing classes.
+template <bool _Cond, class _Unique>
+struct __non_trivial_if { };
+
+template <class _Unique>
+struct __non_trivial_if<true, _Unique> {
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR __non_trivial_if() _NOEXCEPT { }
+};
+
+// allocator
+//
+// Note: For ABI compatibility between C++20 and previous standards, we make
+//       allocator<void> trivial in C++20.
+
+template <class _Tp>
+class _LIBCPP_TEMPLATE_VIS allocator
+    : private __non_trivial_if<!is_void<_Tp>::value, allocator<_Tp> >
+{
+    static_assert(!is_volatile<_Tp>::value, "std::allocator does not support volatile types");
+public:
+    typedef size_t      size_type;
+    typedef ptrdiff_t   difference_type;
+    typedef _Tp         value_type;
+    typedef true_type   propagate_on_container_move_assignment;
+    typedef true_type   is_always_equal;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    allocator() _NOEXCEPT = default;
+
+    template <class _Up>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    allocator(const allocator<_Up>&) _NOEXCEPT { }
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    _Tp* allocate(size_t __n) {
+        if (__n > allocator_traits<allocator>::max_size(*this))
+            __throw_bad_array_new_length();
+        if (__libcpp_is_constant_evaluated()) {
+            return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp)));
+        } else {
+            return static_cast<_Tp*>(_VSTD::__libcpp_allocate(__n * sizeof(_Tp), _LIBCPP_ALIGNOF(_Tp)));
+        }
+    }
+
+#if _LIBCPP_STD_VER > 20
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr
+    allocation_result<_Tp*> allocate_at_least(size_t __n) {
+        return {allocate(__n), __n};
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void deallocate(_Tp* __p, size_t __n) _NOEXCEPT {
+        if (__libcpp_is_constant_evaluated()) {
+            ::operator delete(__p);
+        } else {
+            _VSTD::__libcpp_deallocate((void*)__p, __n * sizeof(_Tp), _LIBCPP_ALIGNOF(_Tp));
+        }
+    }
+
+    // C++20 Removed members
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_ALLOCATOR_MEMBERS)
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef _Tp*       pointer;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef const _Tp* const_pointer;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef _Tp&       reference;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef const _Tp& const_reference;
+
+    template <class _Up>
+    struct _LIBCPP_DEPRECATED_IN_CXX17 rebind {
+        typedef allocator<_Up> other;
+    };
+
+    _LIBCPP_DEPRECATED_IN_CXX17 _LIBCPP_INLINE_VISIBILITY
+    pointer address(reference __x) const _NOEXCEPT {
+        return _VSTD::addressof(__x);
+    }
+    _LIBCPP_DEPRECATED_IN_CXX17 _LIBCPP_INLINE_VISIBILITY
+    const_pointer address(const_reference __x) const _NOEXCEPT {
+        return _VSTD::addressof(__x);
+    }
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY _LIBCPP_DEPRECATED_IN_CXX17
+    _Tp* allocate(size_t __n, const void*) {
+        return allocate(__n);
+    }
+
+    _LIBCPP_DEPRECATED_IN_CXX17 _LIBCPP_INLINE_VISIBILITY size_type max_size() const _NOEXCEPT {
+        return size_type(~0) / sizeof(_Tp);
+    }
+
+    template <class _Up, class... _Args>
+    _LIBCPP_DEPRECATED_IN_CXX17 _LIBCPP_INLINE_VISIBILITY
+    void construct(_Up* __p, _Args&&... __args) {
+        ::new ((void*)__p) _Up(_VSTD::forward<_Args>(__args)...);
+    }
+
+    _LIBCPP_DEPRECATED_IN_CXX17 _LIBCPP_INLINE_VISIBILITY
+    void destroy(pointer __p) {
+        __p->~_Tp();
+    }
+#endif
+};
+
+template <class _Tp>
+class _LIBCPP_TEMPLATE_VIS allocator<const _Tp>
+    : private __non_trivial_if<!is_void<_Tp>::value, allocator<const _Tp> >
+{
+    static_assert(!is_volatile<_Tp>::value, "std::allocator does not support volatile types");
+public:
+    typedef size_t      size_type;
+    typedef ptrdiff_t   difference_type;
+    typedef const _Tp   value_type;
+    typedef true_type   propagate_on_container_move_assignment;
+    typedef true_type   is_always_equal;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    allocator() _NOEXCEPT = default;
+
+    template <class _Up>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    allocator(const allocator<_Up>&) _NOEXCEPT { }
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const _Tp* allocate(size_t __n) {
+        if (__n > allocator_traits<allocator>::max_size(*this))
+            __throw_bad_array_new_length();
+        if (__libcpp_is_constant_evaluated()) {
+            return static_cast<const _Tp*>(::operator new(__n * sizeof(_Tp)));
+        } else {
+            return static_cast<const _Tp*>(_VSTD::__libcpp_allocate(__n * sizeof(_Tp), _LIBCPP_ALIGNOF(_Tp)));
+        }
+    }
+
+#if _LIBCPP_STD_VER > 20
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr
+    allocation_result<const _Tp*> allocate_at_least(size_t __n) {
+        return {allocate(__n), __n};
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void deallocate(const _Tp* __p, size_t __n) {
+        if (__libcpp_is_constant_evaluated()) {
+            ::operator delete(const_cast<_Tp*>(__p));
+        } else {
+            _VSTD::__libcpp_deallocate((void*) const_cast<_Tp *>(__p), __n * sizeof(_Tp), _LIBCPP_ALIGNOF(_Tp));
+        }
+    }
+
+    // C++20 Removed members
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_ALLOCATOR_MEMBERS)
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef const _Tp* pointer;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef const _Tp* const_pointer;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef const _Tp& reference;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef const _Tp& const_reference;
+
+    template <class _Up>
+    struct _LIBCPP_DEPRECATED_IN_CXX17 rebind {
+        typedef allocator<_Up> other;
+    };
+
+    _LIBCPP_DEPRECATED_IN_CXX17 _LIBCPP_INLINE_VISIBILITY
+    const_pointer address(const_reference __x) const _NOEXCEPT {
+        return _VSTD::addressof(__x);
+    }
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY _LIBCPP_DEPRECATED_IN_CXX17
+    const _Tp* allocate(size_t __n, const void*) {
+        return allocate(__n);
+    }
+
+    _LIBCPP_DEPRECATED_IN_CXX17 _LIBCPP_INLINE_VISIBILITY size_type max_size() const _NOEXCEPT {
+        return size_type(~0) / sizeof(_Tp);
+    }
+
+    template <class _Up, class... _Args>
+    _LIBCPP_DEPRECATED_IN_CXX17 _LIBCPP_INLINE_VISIBILITY
+    void construct(_Up* __p, _Args&&... __args) {
+        ::new ((void*)__p) _Up(_VSTD::forward<_Args>(__args)...);
+    }
+
+    _LIBCPP_DEPRECATED_IN_CXX17 _LIBCPP_INLINE_VISIBILITY
+    void destroy(pointer __p) {
+        __p->~_Tp();
+    }
+#endif
+};
+
+template <class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool operator==(const allocator<_Tp>&, const allocator<_Up>&) _NOEXCEPT {return true;}
+
+template <class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool operator!=(const allocator<_Tp>&, const allocator<_Up>&) _NOEXCEPT {return false;}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_ALLOCATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/allocator_arg_t.h b/app/src/main/cpp/libcxx/include/__memory/allocator_arg_t.h
new file mode 100644
index 0000000..15f8c98
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/allocator_arg_t.h
@@ -0,0 +1,80 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___FUNCTIONAL_ALLOCATOR_ARG_T_H
+#define _LIBCPP___FUNCTIONAL_ALLOCATOR_ARG_T_H
+
+#include <__config>
+#include <__memory/uses_allocator.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_constructible.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+struct _LIBCPP_TEMPLATE_VIS allocator_arg_t { explicit allocator_arg_t() = default; };
+
+#if defined(_LIBCPP_CXX03_LANG) || defined(_LIBCPP_BUILDING_LIBRARY)
+extern _LIBCPP_EXPORTED_FROM_ABI const allocator_arg_t allocator_arg;
+#else
+/* inline */ constexpr allocator_arg_t allocator_arg = allocator_arg_t();
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+// allocator construction
+
+template <class _Tp, class _Alloc, class ..._Args>
+struct __uses_alloc_ctor_imp
+{
+    typedef _LIBCPP_NODEBUG __remove_cvref_t<_Alloc> _RawAlloc;
+    static const bool __ua = uses_allocator<_Tp, _RawAlloc>::value;
+    static const bool __ic =
+        is_constructible<_Tp, allocator_arg_t, _Alloc, _Args...>::value;
+    static const int value = __ua ? 2 - __ic : 0;
+};
+
+template <class _Tp, class _Alloc, class ..._Args>
+struct __uses_alloc_ctor
+    : integral_constant<int, __uses_alloc_ctor_imp<_Tp, _Alloc, _Args...>::value>
+    {};
+
+template <class _Tp, class _Allocator, class... _Args>
+inline _LIBCPP_INLINE_VISIBILITY
+void __user_alloc_construct_impl (integral_constant<int, 0>, _Tp *__storage, const _Allocator &, _Args &&... __args )
+{
+    new (__storage) _Tp (_VSTD::forward<_Args>(__args)...);
+}
+
+// FIXME: This should have a version which takes a non-const alloc.
+template <class _Tp, class _Allocator, class... _Args>
+inline _LIBCPP_INLINE_VISIBILITY
+void __user_alloc_construct_impl (integral_constant<int, 1>, _Tp *__storage, const _Allocator &__a, _Args &&... __args )
+{
+    new (__storage) _Tp (allocator_arg, __a, _VSTD::forward<_Args>(__args)...);
+}
+
+// FIXME: This should have a version which takes a non-const alloc.
+template <class _Tp, class _Allocator, class... _Args>
+inline _LIBCPP_INLINE_VISIBILITY
+void __user_alloc_construct_impl (integral_constant<int, 2>, _Tp *__storage, const _Allocator &__a, _Args &&... __args )
+{
+    new (__storage) _Tp (_VSTD::forward<_Args>(__args)..., __a);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___FUNCTIONAL_ALLOCATOR_ARG_T_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/allocator_destructor.h b/app/src/main/cpp/libcxx/include/__memory/allocator_destructor.h
new file mode 100644
index 0000000..623ad8a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/allocator_destructor.h
@@ -0,0 +1,42 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_ALLOCATOR_DESTRUCTOR_H
+#define _LIBCPP___MEMORY_ALLOCATOR_DESTRUCTOR_H
+
+#include <__config>
+#include <__memory/allocator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Alloc>
+class __allocator_destructor
+{
+    typedef _LIBCPP_NODEBUG allocator_traits<_Alloc> __alloc_traits;
+public:
+    typedef _LIBCPP_NODEBUG typename __alloc_traits::pointer pointer;
+    typedef _LIBCPP_NODEBUG typename __alloc_traits::size_type size_type;
+private:
+    _Alloc& __alloc_;
+    size_type __s_;
+public:
+    _LIBCPP_INLINE_VISIBILITY __allocator_destructor(_Alloc& __a, size_type __s)
+             _NOEXCEPT
+        : __alloc_(__a), __s_(__s) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void operator()(pointer __p) _NOEXCEPT
+        {__alloc_traits::deallocate(__alloc_, __p, __s_);}
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_ALLOCATOR_DESTRUCTOR_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/allocator_traits.h b/app/src/main/cpp/libcxx/include/__memory/allocator_traits.h
new file mode 100644
index 0000000..3a23b47
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/allocator_traits.h
@@ -0,0 +1,410 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_ALLOCATOR_TRAITS_H
+#define _LIBCPP___MEMORY_ALLOCATOR_TRAITS_H
+
+#include <__config>
+#include <__memory/construct_at.h>
+#include <__memory/pointer_traits.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__type_traits/is_empty.h>
+#include <__type_traits/is_move_constructible.h>
+#include <__type_traits/make_unsigned.h>
+#include <__type_traits/remove_reference.h>
+#include <__type_traits/void_t.h>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#define _LIBCPP_ALLOCATOR_TRAITS_HAS_XXX(NAME, PROPERTY)                \
+    template <class _Tp, class = void> struct NAME : false_type { };    \
+    template <class _Tp>               struct NAME<_Tp, __void_t<typename _Tp:: PROPERTY > > : true_type { }
+
+// __pointer
+_LIBCPP_ALLOCATOR_TRAITS_HAS_XXX(__has_pointer, pointer);
+template <class _Tp, class _Alloc,
+          class _RawAlloc = __libcpp_remove_reference_t<_Alloc>,
+          bool = __has_pointer<_RawAlloc>::value>
+struct __pointer {
+    using type _LIBCPP_NODEBUG = typename _RawAlloc::pointer;
+};
+template <class _Tp, class _Alloc, class _RawAlloc>
+struct __pointer<_Tp, _Alloc, _RawAlloc, false> {
+    using type _LIBCPP_NODEBUG = _Tp*;
+};
+
+// __const_pointer
+_LIBCPP_ALLOCATOR_TRAITS_HAS_XXX(__has_const_pointer, const_pointer);
+template <class _Tp, class _Ptr, class _Alloc,
+          bool = __has_const_pointer<_Alloc>::value>
+struct __const_pointer {
+    using type _LIBCPP_NODEBUG = typename _Alloc::const_pointer;
+};
+template <class _Tp, class _Ptr, class _Alloc>
+struct __const_pointer<_Tp, _Ptr, _Alloc, false> {
+#ifdef _LIBCPP_CXX03_LANG
+    using type = typename pointer_traits<_Ptr>::template rebind<const _Tp>::other;
+#else
+    using type _LIBCPP_NODEBUG = typename pointer_traits<_Ptr>::template rebind<const _Tp>;
+#endif
+};
+
+// __void_pointer
+_LIBCPP_ALLOCATOR_TRAITS_HAS_XXX(__has_void_pointer, void_pointer);
+template <class _Ptr, class _Alloc,
+          bool = __has_void_pointer<_Alloc>::value>
+struct __void_pointer {
+    using type _LIBCPP_NODEBUG = typename _Alloc::void_pointer;
+};
+template <class _Ptr, class _Alloc>
+struct __void_pointer<_Ptr, _Alloc, false> {
+#ifdef _LIBCPP_CXX03_LANG
+    using type _LIBCPP_NODEBUG = typename pointer_traits<_Ptr>::template rebind<void>::other;
+#else
+    using type _LIBCPP_NODEBUG = typename pointer_traits<_Ptr>::template rebind<void>;
+#endif
+};
+
+// __const_void_pointer
+_LIBCPP_ALLOCATOR_TRAITS_HAS_XXX(__has_const_void_pointer, const_void_pointer);
+template <class _Ptr, class _Alloc,
+          bool = __has_const_void_pointer<_Alloc>::value>
+struct __const_void_pointer {
+    using type _LIBCPP_NODEBUG = typename _Alloc::const_void_pointer;
+};
+template <class _Ptr, class _Alloc>
+struct __const_void_pointer<_Ptr, _Alloc, false> {
+#ifdef _LIBCPP_CXX03_LANG
+    using type _LIBCPP_NODEBUG = typename pointer_traits<_Ptr>::template rebind<const void>::other;
+#else
+    using type _LIBCPP_NODEBUG = typename pointer_traits<_Ptr>::template rebind<const void>;
+#endif
+};
+
+// __size_type
+_LIBCPP_ALLOCATOR_TRAITS_HAS_XXX(__has_size_type, size_type);
+template <class _Alloc, class _DiffType, bool = __has_size_type<_Alloc>::value>
+struct __size_type : make_unsigned<_DiffType> { };
+template <class _Alloc, class _DiffType>
+struct __size_type<_Alloc, _DiffType, true> {
+    using type _LIBCPP_NODEBUG = typename _Alloc::size_type;
+};
+
+// __alloc_traits_difference_type
+_LIBCPP_ALLOCATOR_TRAITS_HAS_XXX(__has_alloc_traits_difference_type, difference_type);
+template <class _Alloc, class _Ptr, bool = __has_alloc_traits_difference_type<_Alloc>::value>
+struct __alloc_traits_difference_type {
+    using type _LIBCPP_NODEBUG = typename pointer_traits<_Ptr>::difference_type;
+};
+template <class _Alloc, class _Ptr>
+struct __alloc_traits_difference_type<_Alloc, _Ptr, true> {
+    using type _LIBCPP_NODEBUG = typename _Alloc::difference_type;
+};
+
+// __propagate_on_container_copy_assignment
+_LIBCPP_ALLOCATOR_TRAITS_HAS_XXX(__has_propagate_on_container_copy_assignment, propagate_on_container_copy_assignment);
+template <class _Alloc, bool = __has_propagate_on_container_copy_assignment<_Alloc>::value>
+struct __propagate_on_container_copy_assignment : false_type { };
+template <class _Alloc>
+struct __propagate_on_container_copy_assignment<_Alloc, true> {
+    using type _LIBCPP_NODEBUG = typename _Alloc::propagate_on_container_copy_assignment;
+};
+
+// __propagate_on_container_move_assignment
+_LIBCPP_ALLOCATOR_TRAITS_HAS_XXX(__has_propagate_on_container_move_assignment, propagate_on_container_move_assignment);
+template <class _Alloc, bool = __has_propagate_on_container_move_assignment<_Alloc>::value>
+struct __propagate_on_container_move_assignment : false_type { };
+template <class _Alloc>
+struct __propagate_on_container_move_assignment<_Alloc, true> {
+    using type _LIBCPP_NODEBUG = typename _Alloc::propagate_on_container_move_assignment;
+};
+
+// __propagate_on_container_swap
+_LIBCPP_ALLOCATOR_TRAITS_HAS_XXX(__has_propagate_on_container_swap, propagate_on_container_swap);
+template <class _Alloc, bool = __has_propagate_on_container_swap<_Alloc>::value>
+struct __propagate_on_container_swap : false_type { };
+template <class _Alloc>
+struct __propagate_on_container_swap<_Alloc, true> {
+    using type _LIBCPP_NODEBUG = typename _Alloc::propagate_on_container_swap;
+};
+
+// __is_always_equal
+_LIBCPP_ALLOCATOR_TRAITS_HAS_XXX(__has_is_always_equal, is_always_equal);
+template <class _Alloc, bool = __has_is_always_equal<_Alloc>::value>
+struct __is_always_equal : is_empty<_Alloc> { };
+template <class _Alloc>
+struct __is_always_equal<_Alloc, true> {
+    using type _LIBCPP_NODEBUG = typename _Alloc::is_always_equal;
+};
+
+// __allocator_traits_rebind
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Tp, class _Up, class = void>
+struct __has_rebind_other : false_type { };
+template <class _Tp, class _Up>
+struct __has_rebind_other<_Tp, _Up, __void_t<typename _Tp::template rebind<_Up>::other> > : true_type { };
+
+template <class _Tp, class _Up, bool = __has_rebind_other<_Tp, _Up>::value>
+struct __allocator_traits_rebind {
+  static_assert(__has_rebind_other<_Tp, _Up>::value, "This allocator has to implement rebind");
+  using type _LIBCPP_NODEBUG = typename _Tp::template rebind<_Up>::other;
+};
+template <template <class, class...> class _Alloc, class _Tp, class ..._Args, class _Up>
+struct __allocator_traits_rebind<_Alloc<_Tp, _Args...>, _Up, true> {
+    using type _LIBCPP_NODEBUG = typename _Alloc<_Tp, _Args...>::template rebind<_Up>::other;
+};
+template <template <class, class...> class _Alloc, class _Tp, class ..._Args, class _Up>
+struct __allocator_traits_rebind<_Alloc<_Tp, _Args...>, _Up, false> {
+    using type _LIBCPP_NODEBUG = _Alloc<_Up, _Args...>;
+};
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+template<class _Alloc, class _Tp>
+using __allocator_traits_rebind_t = typename __allocator_traits_rebind<_Alloc, _Tp>::type;
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+
+// __has_allocate_hint
+template <class _Alloc, class _SizeType, class _ConstVoidPtr, class = void>
+struct __has_allocate_hint : false_type { };
+
+template <class _Alloc, class _SizeType, class _ConstVoidPtr>
+struct __has_allocate_hint<_Alloc, _SizeType, _ConstVoidPtr, decltype(
+    (void)std::declval<_Alloc>().allocate(std::declval<_SizeType>(), std::declval<_ConstVoidPtr>())
+)> : true_type { };
+
+// __has_construct
+template <class, class _Alloc, class ..._Args>
+struct __has_construct_impl : false_type { };
+
+template <class _Alloc, class ..._Args>
+struct __has_construct_impl<decltype(
+    (void)std::declval<_Alloc>().construct(std::declval<_Args>()...)
+), _Alloc, _Args...> : true_type { };
+
+template <class _Alloc, class ..._Args>
+struct __has_construct : __has_construct_impl<void, _Alloc, _Args...> { };
+
+// __has_destroy
+template <class _Alloc, class _Pointer, class = void>
+struct __has_destroy : false_type { };
+
+template <class _Alloc, class _Pointer>
+struct __has_destroy<_Alloc, _Pointer, decltype(
+    (void)std::declval<_Alloc>().destroy(std::declval<_Pointer>())
+)> : true_type { };
+
+// __has_max_size
+template <class _Alloc, class = void>
+struct __has_max_size : false_type { };
+
+template <class _Alloc>
+struct __has_max_size<_Alloc, decltype(
+    (void)std::declval<_Alloc&>().max_size()
+)> : true_type { };
+
+// __has_select_on_container_copy_construction
+template <class _Alloc, class = void>
+struct __has_select_on_container_copy_construction : false_type { };
+
+template <class _Alloc>
+struct __has_select_on_container_copy_construction<_Alloc, decltype(
+    (void)std::declval<_Alloc>().select_on_container_copy_construction()
+)> : true_type { };
+
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+template <class _Alloc>
+struct _LIBCPP_TEMPLATE_VIS allocator_traits
+{
+    using allocator_type = _Alloc;
+    using value_type = typename allocator_type::value_type;
+    using pointer = typename __pointer<value_type, allocator_type>::type;
+    using const_pointer = typename __const_pointer<value_type, pointer, allocator_type>::type;
+    using void_pointer = typename __void_pointer<pointer, allocator_type>::type;
+    using const_void_pointer = typename __const_void_pointer<pointer, allocator_type>::type;
+    using difference_type = typename __alloc_traits_difference_type<allocator_type, pointer>::type;
+    using size_type = typename __size_type<allocator_type, difference_type>::type;
+    using propagate_on_container_copy_assignment = typename __propagate_on_container_copy_assignment<allocator_type>::type;
+    using propagate_on_container_move_assignment = typename __propagate_on_container_move_assignment<allocator_type>::type;
+    using propagate_on_container_swap = typename __propagate_on_container_swap<allocator_type>::type;
+    using is_always_equal = typename __is_always_equal<allocator_type>::type;
+
+#ifndef _LIBCPP_CXX03_LANG
+    template <class _Tp>
+    using rebind_alloc = __allocator_traits_rebind_t<allocator_type, _Tp>;
+    template <class _Tp>
+    using rebind_traits = allocator_traits<rebind_alloc<_Tp> >;
+#else  // _LIBCPP_CXX03_LANG
+    template <class _Tp>
+    struct rebind_alloc {
+        using other = __allocator_traits_rebind_t<allocator_type, _Tp>;
+    };
+    template <class _Tp>
+    struct rebind_traits {
+        using other = allocator_traits<typename rebind_alloc<_Tp>::other>;
+    };
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static pointer allocate(allocator_type& __a, size_type __n) {
+        return __a.allocate(__n);
+    }
+
+    template <class _Ap = _Alloc, class =
+        __enable_if_t<__has_allocate_hint<_Ap, size_type, const_void_pointer>::value> >
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static pointer allocate(allocator_type& __a, size_type __n, const_void_pointer __hint) {
+        _LIBCPP_SUPPRESS_DEPRECATED_PUSH
+        return __a.allocate(__n, __hint);
+        _LIBCPP_SUPPRESS_DEPRECATED_POP
+    }
+    template <class _Ap = _Alloc, class = void, class =
+        __enable_if_t<!__has_allocate_hint<_Ap, size_type, const_void_pointer>::value> >
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static pointer allocate(allocator_type& __a, size_type __n, const_void_pointer) {
+        return __a.allocate(__n);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static void deallocate(allocator_type& __a, pointer __p, size_type __n) _NOEXCEPT {
+        __a.deallocate(__p, __n);
+    }
+
+    template <class _Tp, class... _Args, class =
+        __enable_if_t<__has_construct<allocator_type, _Tp*, _Args...>::value> >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static void construct(allocator_type& __a, _Tp* __p, _Args&&... __args) {
+        _LIBCPP_SUPPRESS_DEPRECATED_PUSH
+        __a.construct(__p, _VSTD::forward<_Args>(__args)...);
+        _LIBCPP_SUPPRESS_DEPRECATED_POP
+    }
+    template <class _Tp, class... _Args, class = void, class =
+        __enable_if_t<!__has_construct<allocator_type, _Tp*, _Args...>::value> >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static void construct(allocator_type&, _Tp* __p, _Args&&... __args) {
+#if _LIBCPP_STD_VER > 17
+        _VSTD::construct_at(__p, _VSTD::forward<_Args>(__args)...);
+#else
+        ::new ((void*)__p) _Tp(_VSTD::forward<_Args>(__args)...);
+#endif
+    }
+
+    template <class _Tp, class =
+        __enable_if_t<__has_destroy<allocator_type, _Tp*>::value> >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static void destroy(allocator_type& __a, _Tp* __p) {
+        _LIBCPP_SUPPRESS_DEPRECATED_PUSH
+        __a.destroy(__p);
+        _LIBCPP_SUPPRESS_DEPRECATED_POP
+    }
+    template <class _Tp, class = void, class =
+        __enable_if_t<!__has_destroy<allocator_type, _Tp*>::value> >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static void destroy(allocator_type&, _Tp* __p) {
+#if _LIBCPP_STD_VER > 17
+        _VSTD::destroy_at(__p);
+#else
+        __p->~_Tp();
+#endif
+    }
+
+    template <class _Ap = _Alloc, class =
+        __enable_if_t<__has_max_size<const _Ap>::value> >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static size_type max_size(const allocator_type& __a) _NOEXCEPT {
+        _LIBCPP_SUPPRESS_DEPRECATED_PUSH
+        return __a.max_size();
+        _LIBCPP_SUPPRESS_DEPRECATED_POP
+    }
+    template <class _Ap = _Alloc, class = void, class =
+        __enable_if_t<!__has_max_size<const _Ap>::value> >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static size_type max_size(const allocator_type&) _NOEXCEPT {
+        return numeric_limits<size_type>::max() / sizeof(value_type);
+    }
+
+    template <class _Ap = _Alloc, class =
+        __enable_if_t<__has_select_on_container_copy_construction<const _Ap>::value> >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static allocator_type select_on_container_copy_construction(const allocator_type& __a) {
+        return __a.select_on_container_copy_construction();
+    }
+    template <class _Ap = _Alloc, class = void, class =
+        __enable_if_t<!__has_select_on_container_copy_construction<const _Ap>::value> >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static allocator_type select_on_container_copy_construction(const allocator_type& __a) {
+        return __a;
+    }
+};
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Traits, class _Tp>
+using __rebind_alloc _LIBCPP_NODEBUG = typename _Traits::template rebind_alloc<_Tp>;
+#else
+template <class _Traits, class _Tp>
+using __rebind_alloc = typename _Traits::template rebind_alloc<_Tp>::other;
+#endif
+
+// __is_default_allocator
+template <class _Tp>
+struct __is_default_allocator : false_type { };
+
+template <class> class allocator;
+
+template <class _Tp>
+struct __is_default_allocator<allocator<_Tp> > : true_type { };
+
+// __is_cpp17_move_insertable
+template <class _Alloc, class = void>
+struct __is_cpp17_move_insertable
+    : is_move_constructible<typename _Alloc::value_type>
+{ };
+
+template <class _Alloc>
+struct __is_cpp17_move_insertable<_Alloc, __enable_if_t<
+    !__is_default_allocator<_Alloc>::value &&
+    __has_construct<_Alloc, typename _Alloc::value_type*, typename _Alloc::value_type&&>::value
+> > : true_type { };
+
+// __is_cpp17_copy_insertable
+template <class _Alloc, class = void>
+struct __is_cpp17_copy_insertable
+    : integral_constant<bool,
+        is_copy_constructible<typename _Alloc::value_type>::value &&
+        __is_cpp17_move_insertable<_Alloc>::value
+    >
+{ };
+
+template <class _Alloc>
+struct __is_cpp17_copy_insertable<_Alloc, __enable_if_t<
+    !__is_default_allocator<_Alloc>::value &&
+    __has_construct<_Alloc, typename _Alloc::value_type*, const typename _Alloc::value_type&>::value
+> >
+    : __is_cpp17_move_insertable<_Alloc>
+{ };
+
+#undef _LIBCPP_ALLOCATOR_TRAITS_HAS_XXX
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___MEMORY_ALLOCATOR_TRAITS_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/assume_aligned.h b/app/src/main/cpp/libcxx/include/__memory/assume_aligned.h
new file mode 100644
index 0000000..a1fd244
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/assume_aligned.h
@@ -0,0 +1,46 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_ASSUME_ALIGNED_H
+#define _LIBCPP___MEMORY_ASSUME_ALIGNED_H
+
+#include <__assert>
+#include <__config>
+#include <__type_traits/is_constant_evaluated.h>
+#include <cstddef>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <size_t _Np, class _Tp>
+[[nodiscard]]
+_LIBCPP_HIDE_FROM_ABI
+constexpr _Tp* assume_aligned(_Tp* __ptr) {
+  static_assert(_Np != 0 && (_Np & (_Np - 1)) == 0,
+    "std::assume_aligned<N>(p) requires N to be a power of two");
+
+  if (is_constant_evaluated()) {
+    return __ptr;
+  } else {
+    _LIBCPP_ASSERT(reinterpret_cast<uintptr_t>(__ptr) % _Np == 0, "Alignment assumption is violated");
+    return static_cast<_Tp*>(__builtin_assume_aligned(__ptr, _Np));
+  }
+}
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_ASSUME_ALIGNED_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/auto_ptr.h b/app/src/main/cpp/libcxx/include/__memory/auto_ptr.h
new file mode 100644
index 0000000..c007b4d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/auto_ptr.h
@@ -0,0 +1,84 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_AUTO_PTR_H
+#define _LIBCPP___MEMORY_AUTO_PTR_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_AUTO_PTR)
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_DEPRECATED_IN_CXX11 auto_ptr_ref
+{
+    _Tp* __ptr_;
+};
+
+template<class _Tp>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 auto_ptr
+{
+private:
+    _Tp* __ptr_;
+public:
+    typedef _Tp element_type;
+
+    _LIBCPP_INLINE_VISIBILITY explicit auto_ptr(_Tp* __p = 0) _NOEXCEPT : __ptr_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY auto_ptr(auto_ptr& __p) _NOEXCEPT : __ptr_(__p.release()) {}
+    template<class _Up> _LIBCPP_INLINE_VISIBILITY auto_ptr(auto_ptr<_Up>& __p) _NOEXCEPT
+        : __ptr_(__p.release()) {}
+    _LIBCPP_INLINE_VISIBILITY auto_ptr& operator=(auto_ptr& __p) _NOEXCEPT
+        {reset(__p.release()); return *this;}
+    template<class _Up> _LIBCPP_INLINE_VISIBILITY auto_ptr& operator=(auto_ptr<_Up>& __p) _NOEXCEPT
+        {reset(__p.release()); return *this;}
+    _LIBCPP_INLINE_VISIBILITY auto_ptr& operator=(auto_ptr_ref<_Tp> __p) _NOEXCEPT
+        {reset(__p.__ptr_); return *this;}
+    _LIBCPP_INLINE_VISIBILITY ~auto_ptr() _NOEXCEPT {delete __ptr_;}
+
+    _LIBCPP_INLINE_VISIBILITY _Tp& operator*() const _NOEXCEPT
+        {return *__ptr_;}
+    _LIBCPP_INLINE_VISIBILITY _Tp* operator->() const _NOEXCEPT {return __ptr_;}
+    _LIBCPP_INLINE_VISIBILITY _Tp* get() const _NOEXCEPT {return __ptr_;}
+    _LIBCPP_INLINE_VISIBILITY _Tp* release() _NOEXCEPT
+    {
+        _Tp* __t = __ptr_;
+        __ptr_ = nullptr;
+        return __t;
+    }
+    _LIBCPP_INLINE_VISIBILITY void reset(_Tp* __p = 0) _NOEXCEPT
+    {
+        if (__ptr_ != __p)
+            delete __ptr_;
+        __ptr_ = __p;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY auto_ptr(auto_ptr_ref<_Tp> __p) _NOEXCEPT : __ptr_(__p.__ptr_) {}
+    template<class _Up> _LIBCPP_INLINE_VISIBILITY operator auto_ptr_ref<_Up>() _NOEXCEPT
+        {auto_ptr_ref<_Up> __t; __t.__ptr_ = release(); return __t;}
+    template<class _Up> _LIBCPP_INLINE_VISIBILITY operator auto_ptr<_Up>() _NOEXCEPT
+        {return auto_ptr<_Up>(release());}
+};
+
+template <>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX11 auto_ptr<void>
+{
+public:
+    typedef void element_type;
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_AUTO_PTR)
+
+#endif // _LIBCPP___MEMORY_AUTO_PTR_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/builtin_new_allocator.h b/app/src/main/cpp/libcxx/include/__memory/builtin_new_allocator.h
new file mode 100644
index 0000000..cd1a866
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/builtin_new_allocator.h
@@ -0,0 +1,70 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_BUILTIN_NEW_ALLOCATOR_H
+#define _LIBCPP___MEMORY_BUILTIN_NEW_ALLOCATOR_H
+
+#include <__config>
+#include <__memory/unique_ptr.h>
+#include <cstddef>
+#include <new>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// __builtin_new_allocator -- A non-templated helper for allocating and
+// deallocating memory using __builtin_operator_new and
+// __builtin_operator_delete. It should be used in preference to
+// `std::allocator<T>` to avoid additional instantiations.
+struct __builtin_new_allocator {
+  struct __builtin_new_deleter {
+    typedef void* pointer_type;
+
+    _LIBCPP_CONSTEXPR explicit __builtin_new_deleter(size_t __size, size_t __align)
+        : __size_(__size), __align_(__align) {}
+
+    void operator()(void* __p) const _NOEXCEPT {
+        _VSTD::__libcpp_deallocate(__p, __size_, __align_);
+    }
+
+   private:
+    size_t __size_;
+    size_t __align_;
+  };
+
+  typedef unique_ptr<void, __builtin_new_deleter> __holder_t;
+
+  static __holder_t __allocate_bytes(size_t __s, size_t __align) {
+      return __holder_t(_VSTD::__libcpp_allocate(__s, __align),
+                     __builtin_new_deleter(__s, __align));
+  }
+
+  static void __deallocate_bytes(void* __p, size_t __s,
+                                 size_t __align) _NOEXCEPT {
+      _VSTD::__libcpp_deallocate(__p, __s, __align);
+  }
+
+  template <class _Tp>
+  _LIBCPP_NODEBUG _LIBCPP_ALWAYS_INLINE
+  static __holder_t __allocate_type(size_t __n) {
+      return __allocate_bytes(__n * sizeof(_Tp), _LIBCPP_ALIGNOF(_Tp));
+  }
+
+  template <class _Tp>
+  _LIBCPP_NODEBUG _LIBCPP_ALWAYS_INLINE
+  static void __deallocate_type(void* __p, size_t __n) _NOEXCEPT {
+      __deallocate_bytes(__p, __n * sizeof(_Tp), _LIBCPP_ALIGNOF(_Tp));
+  }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_BUILTIN_NEW_ALLOCATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/compressed_pair.h b/app/src/main/cpp/libcxx/include/__memory/compressed_pair.h
new file mode 100644
index 0000000..8093d7c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/compressed_pair.h
@@ -0,0 +1,177 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_COMPRESSED_PAIR_H
+#define _LIBCPP___MEMORY_COMPRESSED_PAIR_H
+
+#include <__config>
+#include <__fwd/get.h>
+#include <__fwd/tuple.h>
+#include <__tuple_dir/tuple_indices.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/dependent_type.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_default_constructible.h>
+#include <__type_traits/is_empty.h>
+#include <__type_traits/is_final.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_swappable.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/piecewise_construct.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Tag used to default initialize one or both of the pair's elements.
+struct __default_init_tag {};
+struct __value_init_tag {};
+
+template <class _Tp, int _Idx, bool _CanBeEmptyBase = is_empty<_Tp>::value && !__libcpp_is_final<_Tp>::value>
+struct __compressed_pair_elem {
+  using _ParamT = _Tp;
+  using reference = _Tp&;
+  using const_reference = const _Tp&;
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR explicit __compressed_pair_elem(__default_init_tag) {}
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR explicit __compressed_pair_elem(__value_init_tag) : __value_() {}
+
+  template <class _Up, class = __enable_if_t<!is_same<__compressed_pair_elem, typename decay<_Up>::type>::value> >
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+  explicit __compressed_pair_elem(_Up&& __u) : __value_(std::forward<_Up>(__u)) {}
+
+#ifndef _LIBCPP_CXX03_LANG
+  template <class... _Args, size_t... _Indices>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+  explicit __compressed_pair_elem(piecewise_construct_t, tuple<_Args...> __args, __tuple_indices<_Indices...>)
+      : __value_(std::forward<_Args>(std::get<_Indices>(__args))...) {}
+#endif
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 reference __get() _NOEXCEPT { return __value_; }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR const_reference __get() const _NOEXCEPT { return __value_; }
+
+private:
+  _Tp __value_;
+};
+
+template <class _Tp, int _Idx>
+struct __compressed_pair_elem<_Tp, _Idx, true> : private _Tp {
+  using _ParamT = _Tp;
+  using reference = _Tp&;
+  using const_reference = const _Tp&;
+  using __value_type = _Tp;
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR explicit __compressed_pair_elem() = default;
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR explicit __compressed_pair_elem(__default_init_tag) {}
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR explicit __compressed_pair_elem(__value_init_tag) : __value_type() {}
+
+  template <class _Up, class = __enable_if_t<!is_same<__compressed_pair_elem, typename decay<_Up>::type>::value> >
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+  explicit __compressed_pair_elem(_Up&& __u) : __value_type(std::forward<_Up>(__u)) {}
+
+#ifndef _LIBCPP_CXX03_LANG
+  template <class... _Args, size_t... _Indices>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+  __compressed_pair_elem(piecewise_construct_t, tuple<_Args...> __args, __tuple_indices<_Indices...>)
+      : __value_type(std::forward<_Args>(std::get<_Indices>(__args))...) {}
+#endif
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 reference __get() _NOEXCEPT { return *this; }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR const_reference __get() const _NOEXCEPT { return *this; }
+};
+
+template <class _T1, class _T2>
+class __compressed_pair : private __compressed_pair_elem<_T1, 0>,
+                          private __compressed_pair_elem<_T2, 1> {
+public:
+  // NOTE: This static assert should never fire because __compressed_pair
+  // is *almost never* used in a scenario where it's possible for T1 == T2.
+  // (The exception is std::function where it is possible that the function
+  //  object and the allocator have the same type).
+  static_assert((!is_same<_T1, _T2>::value),
+    "__compressed_pair cannot be instantiated when T1 and T2 are the same type; "
+    "The current implementation is NOT ABI-compatible with the previous implementation for this configuration");
+
+  using _Base1 _LIBCPP_NODEBUG = __compressed_pair_elem<_T1, 0>;
+  using _Base2 _LIBCPP_NODEBUG = __compressed_pair_elem<_T2, 1>;
+
+  template <bool _Dummy = true,
+    class = __enable_if_t<
+        __dependent_type<is_default_constructible<_T1>, _Dummy>::value &&
+        __dependent_type<is_default_constructible<_T2>, _Dummy>::value
+    >
+  >
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+  explicit __compressed_pair() : _Base1(__value_init_tag()), _Base2(__value_init_tag()) {}
+
+  template <class _U1, class _U2>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+  explicit __compressed_pair(_U1&& __t1, _U2&& __t2) : _Base1(std::forward<_U1>(__t1)), _Base2(std::forward<_U2>(__t2)) {}
+
+#ifndef _LIBCPP_CXX03_LANG
+  template <class... _Args1, class... _Args2>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17
+  explicit __compressed_pair(piecewise_construct_t __pc, tuple<_Args1...> __first_args,
+                             tuple<_Args2...> __second_args)
+      : _Base1(__pc, std::move(__first_args), typename __make_tuple_indices<sizeof...(_Args1)>::type()),
+        _Base2(__pc, std::move(__second_args), typename __make_tuple_indices<sizeof...(_Args2)>::type()) {}
+#endif
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+  typename _Base1::reference first() _NOEXCEPT {
+    return static_cast<_Base1&>(*this).__get();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+  typename _Base1::const_reference first() const _NOEXCEPT {
+    return static_cast<_Base1 const&>(*this).__get();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+  typename _Base2::reference second() _NOEXCEPT {
+    return static_cast<_Base2&>(*this).__get();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+  typename _Base2::const_reference second() const _NOEXCEPT {
+    return static_cast<_Base2 const&>(*this).__get();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR static
+  _Base1* __get_first_base(__compressed_pair* __pair) _NOEXCEPT {
+    return static_cast<_Base1*>(__pair);
+  }
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR static
+  _Base2* __get_second_base(__compressed_pair* __pair) _NOEXCEPT {
+    return static_cast<_Base2*>(__pair);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+  void swap(__compressed_pair& __x)
+      _NOEXCEPT_(__is_nothrow_swappable<_T1>::value && __is_nothrow_swappable<_T2>::value) {
+    using std::swap;
+    swap(first(), __x.first());
+    swap(second(), __x.second());
+  }
+};
+
+template <class _T1, class _T2>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+void swap(__compressed_pair<_T1, _T2>& __x, __compressed_pair<_T1, _T2>& __y)
+    _NOEXCEPT_(__is_nothrow_swappable<_T1>::value && __is_nothrow_swappable<_T2>::value) {
+  __x.swap(__y);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_COMPRESSED_PAIR_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/concepts.h b/app/src/main/cpp/libcxx/include/__memory/concepts.h
new file mode 100644
index 0000000..12d7bf8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/concepts.h
@@ -0,0 +1,69 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_CONCEPTS_H
+#define _LIBCPP___MEMORY_CONCEPTS_H
+
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/readable_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/remove_cvref.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+// [special.mem.concepts]
+
+// This concept ensures that uninitialized algorithms can construct an object
+// at the address pointed-to by the iterator, which requires an lvalue.
+template <class _Ip>
+concept __nothrow_input_iterator =
+    input_iterator<_Ip> &&
+    is_lvalue_reference_v<iter_reference_t<_Ip>> &&
+    same_as<remove_cvref_t<iter_reference_t<_Ip>>, iter_value_t<_Ip>>;
+
+template <class _Sp, class _Ip>
+concept __nothrow_sentinel_for = sentinel_for<_Sp, _Ip>;
+
+template <class _Rp>
+concept __nothrow_input_range =
+    range<_Rp> &&
+    __nothrow_input_iterator<iterator_t<_Rp>> &&
+    __nothrow_sentinel_for<sentinel_t<_Rp>, iterator_t<_Rp>>;
+
+template <class _Ip>
+concept __nothrow_forward_iterator =
+    __nothrow_input_iterator<_Ip> &&
+    forward_iterator<_Ip> &&
+    __nothrow_sentinel_for<_Ip, _Ip>;
+
+template <class _Rp>
+concept __nothrow_forward_range =
+    __nothrow_input_range<_Rp> &&
+    __nothrow_forward_iterator<iterator_t<_Rp>>;
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_CONCEPTS_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/construct_at.h b/app/src/main/cpp/libcxx/include/__memory/construct_at.h
new file mode 100644
index 0000000..ffee002
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/construct_at.h
@@ -0,0 +1,120 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_CONSTRUCT_AT_H
+#define _LIBCPP___MEMORY_CONSTRUCT_AT_H
+
+#include <__assert>
+#include <__config>
+#include <__iterator/access.h>
+#include <__memory/addressof.h>
+#include <__memory/voidify.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_array.h>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <new>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// construct_at
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _Tp, class... _Args, class = decltype(::new(std::declval<void*>()) _Tp(std::declval<_Args>()...))>
+_LIBCPP_HIDE_FROM_ABI constexpr _Tp* construct_at(_Tp* __location, _Args&&... __args) {
+  _LIBCPP_ASSERT(__location != nullptr, "null pointer given to construct_at");
+  return ::new (_VSTD::__voidify(*__location)) _Tp(_VSTD::forward<_Args>(__args)...);
+}
+
+#endif
+
+template <class _Tp, class... _Args, class = decltype(::new(std::declval<void*>()) _Tp(std::declval<_Args>()...))>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Tp* __construct_at(_Tp* __location, _Args&&... __args) {
+#if _LIBCPP_STD_VER > 17
+  return std::construct_at(__location, std::forward<_Args>(__args)...);
+#else
+  return _LIBCPP_ASSERT(__location != nullptr, "null pointer given to construct_at"),
+         ::new (std::__voidify(*__location)) _Tp(std::forward<_Args>(__args)...);
+#endif
+}
+
+// destroy_at
+
+// The internal functions are available regardless of the language version (with the exception of the `__destroy_at`
+// taking an array).
+
+template <class _ForwardIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_ForwardIterator __destroy(_ForwardIterator, _ForwardIterator);
+
+template <class _Tp, typename enable_if<!is_array<_Tp>::value, int>::type = 0>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void __destroy_at(_Tp* __loc) {
+    _LIBCPP_ASSERT(__loc != nullptr, "null pointer given to destroy_at");
+    __loc->~_Tp();
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Tp, typename enable_if<is_array<_Tp>::value, int>::type = 0>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void __destroy_at(_Tp* __loc) {
+    _LIBCPP_ASSERT(__loc != nullptr, "null pointer given to destroy_at");
+    _VSTD::__destroy(_VSTD::begin(*__loc), _VSTD::end(*__loc));
+}
+#endif
+
+template <class _ForwardIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_ForwardIterator __destroy(_ForwardIterator __first, _ForwardIterator __last) {
+    for (; __first != __last; ++__first)
+        _VSTD::__destroy_at(_VSTD::addressof(*__first));
+    return __first;
+}
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _Tp, enable_if_t<!is_array_v<_Tp>, int> = 0>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void destroy_at(_Tp* __loc) {
+    _VSTD::__destroy_at(__loc);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Tp, enable_if_t<is_array_v<_Tp>, int> = 0>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void destroy_at(_Tp* __loc) {
+  _VSTD::__destroy_at(__loc);
+}
+#endif
+
+template <class _ForwardIterator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void destroy(_ForwardIterator __first, _ForwardIterator __last) {
+  (void)_VSTD::__destroy(_VSTD::move(__first), _VSTD::move(__last));
+}
+
+template <class _ForwardIterator, class _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+_ForwardIterator destroy_n(_ForwardIterator __first, _Size __n) {
+    for (; __n > 0; (void)++__first, --__n)
+        _VSTD::__destroy_at(_VSTD::addressof(*__first));
+    return __first;
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_CONSTRUCT_AT_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/destruct_n.h b/app/src/main/cpp/libcxx/include/__memory/destruct_n.h
new file mode 100644
index 0000000..2cfb2e4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/destruct_n.h
@@ -0,0 +1,64 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_DESTRUCT_N_H
+#define _LIBCPP___MEMORY_DESTRUCT_N_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_trivially_destructible.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+struct __destruct_n
+{
+private:
+    size_t __size_;
+
+    template <class _Tp>
+    _LIBCPP_INLINE_VISIBILITY void __process(_Tp* __p, false_type) _NOEXCEPT
+        {for (size_t __i = 0; __i < __size_; ++__i, ++__p) __p->~_Tp();}
+
+    template <class _Tp>
+    _LIBCPP_INLINE_VISIBILITY void __process(_Tp*, true_type) _NOEXCEPT
+        {}
+
+    _LIBCPP_INLINE_VISIBILITY void __incr(false_type) _NOEXCEPT
+        {++__size_;}
+    _LIBCPP_INLINE_VISIBILITY void __incr(true_type) _NOEXCEPT
+        {}
+
+    _LIBCPP_INLINE_VISIBILITY void __set(size_t __s, false_type) _NOEXCEPT
+        {__size_ = __s;}
+    _LIBCPP_INLINE_VISIBILITY void __set(size_t, true_type) _NOEXCEPT
+        {}
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit __destruct_n(size_t __s) _NOEXCEPT
+        : __size_(__s) {}
+
+    template <class _Tp>
+    _LIBCPP_INLINE_VISIBILITY void __incr() _NOEXCEPT
+        {__incr(integral_constant<bool, is_trivially_destructible<_Tp>::value>());}
+
+    template <class _Tp>
+    _LIBCPP_INLINE_VISIBILITY void __set(size_t __s, _Tp*) _NOEXCEPT
+        {__set(__s, integral_constant<bool, is_trivially_destructible<_Tp>::value>());}
+
+    template <class _Tp>
+    _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) _NOEXCEPT
+        {__process(__p, integral_constant<bool, is_trivially_destructible<_Tp>::value>());}
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_DESTRUCT_N_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/pointer_traits.h b/app/src/main/cpp/libcxx/include/__memory/pointer_traits.h
new file mode 100644
index 0000000..c4f20de
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/pointer_traits.h
@@ -0,0 +1,242 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_POINTER_TRAITS_H
+#define _LIBCPP___MEMORY_POINTER_TRAITS_H
+
+#include <__config>
+#include <__memory/addressof.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/conjunction.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_class.h>
+#include <__type_traits/is_function.h>
+#include <__type_traits/is_void.h>
+#include <__type_traits/void_t.h>
+#include <__utility/declval.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class = void>
+struct __has_element_type : false_type {};
+
+template <class _Tp>
+struct __has_element_type<_Tp, __void_t<typename _Tp::element_type> > : true_type {};
+
+template <class _Ptr, bool = __has_element_type<_Ptr>::value>
+struct __pointer_traits_element_type;
+
+template <class _Ptr>
+struct __pointer_traits_element_type<_Ptr, true>
+{
+    typedef _LIBCPP_NODEBUG typename _Ptr::element_type type;
+};
+
+template <template <class, class...> class _Sp, class _Tp, class ..._Args>
+struct __pointer_traits_element_type<_Sp<_Tp, _Args...>, true>
+{
+    typedef _LIBCPP_NODEBUG typename _Sp<_Tp, _Args...>::element_type type;
+};
+
+template <template <class, class...> class _Sp, class _Tp, class ..._Args>
+struct __pointer_traits_element_type<_Sp<_Tp, _Args...>, false>
+{
+    typedef _LIBCPP_NODEBUG _Tp type;
+};
+
+template <class _Tp, class = void>
+struct __has_difference_type : false_type {};
+
+template <class _Tp>
+struct __has_difference_type<_Tp, __void_t<typename _Tp::difference_type> > : true_type {};
+
+template <class _Ptr, bool = __has_difference_type<_Ptr>::value>
+struct __pointer_traits_difference_type
+{
+    typedef _LIBCPP_NODEBUG ptrdiff_t type;
+};
+
+template <class _Ptr>
+struct __pointer_traits_difference_type<_Ptr, true>
+{
+    typedef _LIBCPP_NODEBUG typename _Ptr::difference_type type;
+};
+
+template <class _Tp, class _Up>
+struct __has_rebind
+{
+private:
+    template <class _Xp> static false_type __test(...);
+    _LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    template <class _Xp> static true_type __test(typename _Xp::template rebind<_Up>* = 0);
+    _LIBCPP_SUPPRESS_DEPRECATED_POP
+public:
+    static const bool value = decltype(__test<_Tp>(0))::value;
+};
+
+template <class _Tp, class _Up, bool = __has_rebind<_Tp, _Up>::value>
+struct __pointer_traits_rebind
+{
+#ifndef _LIBCPP_CXX03_LANG
+    typedef _LIBCPP_NODEBUG typename _Tp::template rebind<_Up> type;
+#else
+    typedef _LIBCPP_NODEBUG typename _Tp::template rebind<_Up>::other type;
+#endif
+};
+
+template <template <class, class...> class _Sp, class _Tp, class ..._Args, class _Up>
+struct __pointer_traits_rebind<_Sp<_Tp, _Args...>, _Up, true>
+{
+#ifndef _LIBCPP_CXX03_LANG
+    typedef _LIBCPP_NODEBUG typename _Sp<_Tp, _Args...>::template rebind<_Up> type;
+#else
+    typedef _LIBCPP_NODEBUG typename _Sp<_Tp, _Args...>::template rebind<_Up>::other type;
+#endif
+};
+
+template <template <class, class...> class _Sp, class _Tp, class ..._Args, class _Up>
+struct __pointer_traits_rebind<_Sp<_Tp, _Args...>, _Up, false>
+{
+    typedef _Sp<_Up, _Args...> type;
+};
+
+template <class _Ptr>
+struct _LIBCPP_TEMPLATE_VIS pointer_traits
+{
+    typedef _Ptr                                                     pointer;
+    typedef typename __pointer_traits_element_type<pointer>::type    element_type;
+    typedef typename __pointer_traits_difference_type<pointer>::type difference_type;
+
+#ifndef _LIBCPP_CXX03_LANG
+    template <class _Up> using rebind = typename __pointer_traits_rebind<pointer, _Up>::type;
+#else
+    template <class _Up> struct rebind
+        {typedef typename __pointer_traits_rebind<pointer, _Up>::type other;};
+#endif // _LIBCPP_CXX03_LANG
+
+private:
+    struct __nat {};
+public:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static pointer pointer_to(__conditional_t<is_void<element_type>::value, __nat, element_type>& __r)
+        {return pointer::pointer_to(__r);}
+};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS pointer_traits<_Tp*>
+{
+    typedef _Tp*      pointer;
+    typedef _Tp       element_type;
+    typedef ptrdiff_t difference_type;
+
+#ifndef _LIBCPP_CXX03_LANG
+    template <class _Up> using rebind = _Up*;
+#else
+    template <class _Up> struct rebind {typedef _Up* other;};
+#endif
+
+private:
+    struct __nat {};
+public:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static pointer pointer_to(__conditional_t<is_void<element_type>::value, __nat, element_type>& __r) _NOEXCEPT
+        {return _VSTD::addressof(__r);}
+};
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _From, class _To>
+using __rebind_pointer_t = typename pointer_traits<_From>::template rebind<_To>;
+#else
+template <class _From, class _To>
+using __rebind_pointer_t = typename pointer_traits<_From>::template rebind<_To>::other;
+#endif
+
+// to_address
+
+template <class _Pointer, class = void>
+struct __to_address_helper;
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+_Tp* __to_address(_Tp* __p) _NOEXCEPT {
+    static_assert(!is_function<_Tp>::value, "_Tp is a function type");
+    return __p;
+}
+
+template <class _Pointer, class = void>
+struct _HasToAddress : false_type {};
+
+template <class _Pointer>
+struct _HasToAddress<_Pointer,
+    decltype((void)pointer_traits<_Pointer>::to_address(std::declval<const _Pointer&>()))
+> : true_type {};
+
+template <class _Pointer, class = void>
+struct _HasArrow : false_type {};
+
+template <class _Pointer>
+struct _HasArrow<_Pointer,
+    decltype((void)std::declval<const _Pointer&>().operator->())
+> : true_type {};
+
+template <class _Pointer>
+struct _IsFancyPointer {
+  static const bool value = _HasArrow<_Pointer>::value || _HasToAddress<_Pointer>::value;
+};
+
+// enable_if is needed here to avoid instantiating checks for fancy pointers on raw pointers
+template <class _Pointer, class = __enable_if_t<
+    _And<is_class<_Pointer>, _IsFancyPointer<_Pointer> >::value
+> >
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+typename decay<decltype(__to_address_helper<_Pointer>::__call(std::declval<const _Pointer&>()))>::type
+__to_address(const _Pointer& __p) _NOEXCEPT {
+    return __to_address_helper<_Pointer>::__call(__p);
+}
+
+template <class _Pointer, class>
+struct __to_address_helper {
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    static decltype(_VSTD::__to_address(std::declval<const _Pointer&>().operator->()))
+    __call(const _Pointer& __p) _NOEXCEPT {
+        return _VSTD::__to_address(__p.operator->());
+    }
+};
+
+template <class _Pointer>
+struct __to_address_helper<_Pointer, decltype((void)pointer_traits<_Pointer>::to_address(std::declval<const _Pointer&>()))> {
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    static decltype(pointer_traits<_Pointer>::to_address(std::declval<const _Pointer&>()))
+    __call(const _Pointer& __p) _NOEXCEPT {
+        return pointer_traits<_Pointer>::to_address(__p);
+    }
+};
+
+#if _LIBCPP_STD_VER > 17
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY constexpr
+auto to_address(_Tp *__p) noexcept {
+    return _VSTD::__to_address(__p);
+}
+
+template <class _Pointer>
+inline _LIBCPP_INLINE_VISIBILITY constexpr
+auto to_address(const _Pointer& __p) noexcept -> decltype(std::__to_address(__p)) {
+    return _VSTD::__to_address(__p);
+}
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_POINTER_TRAITS_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/ranges_construct_at.h b/app/src/main/cpp/libcxx/include/__memory/ranges_construct_at.h
new file mode 100644
index 0000000..e63585d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/ranges_construct_at.h
@@ -0,0 +1,125 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_RANGES_CONSTRUCT_AT_H
+#define _LIBCPP___MEMORY_RANGES_CONSTRUCT_AT_H
+
+#include <__concepts/destructible.h>
+#include <__config>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/readable_traits.h>
+#include <__memory/concepts.h>
+#include <__memory/construct_at.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <new>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+namespace ranges {
+
+// construct_at
+
+namespace __construct_at {
+
+struct __fn {
+  template<class _Tp, class... _Args, class = decltype(
+    ::new (std::declval<void*>()) _Tp(std::declval<_Args>()...)
+  )>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _Tp* operator()(_Tp* __location, _Args&& ...__args) const {
+    return _VSTD::construct_at(__location, _VSTD::forward<_Args>(__args)...);
+  }
+};
+
+} // namespace __construct_at
+
+inline namespace __cpo {
+  inline constexpr auto construct_at = __construct_at::__fn{};
+} // namespace __cpo
+
+// destroy_at
+
+namespace __destroy_at {
+
+struct __fn {
+  template <destructible _Tp>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr void operator()(_Tp* __location) const noexcept {
+    _VSTD::destroy_at(__location);
+  }
+};
+
+} // namespace __destroy_at
+
+inline namespace __cpo {
+  inline constexpr auto destroy_at = __destroy_at::__fn{};
+} // namespace __cpo
+
+// destroy
+
+namespace __destroy {
+
+struct __fn {
+  template <__nothrow_input_iterator _InputIterator, __nothrow_sentinel_for<_InputIterator> _Sentinel>
+    requires destructible<iter_value_t<_InputIterator>>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _InputIterator operator()(_InputIterator __first, _Sentinel __last) const noexcept {
+    return _VSTD::__destroy(_VSTD::move(__first), _VSTD::move(__last));
+  }
+
+  template <__nothrow_input_range _InputRange>
+    requires destructible<range_value_t<_InputRange>>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr borrowed_iterator_t<_InputRange> operator()(_InputRange&& __range) const noexcept {
+    return (*this)(ranges::begin(__range), ranges::end(__range));
+  }
+};
+
+} // namespace __destroy
+
+inline namespace __cpo {
+  inline constexpr auto destroy = __destroy::__fn{};
+} // namespace __cpo
+
+// destroy_n
+
+namespace __destroy_n {
+
+struct __fn {
+  template <__nothrow_input_iterator _InputIterator>
+    requires destructible<iter_value_t<_InputIterator>>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _InputIterator operator()(_InputIterator __first, iter_difference_t<_InputIterator> __n) const noexcept {
+    return _VSTD::destroy_n(_VSTD::move(__first), __n);
+  }
+};
+
+} // namespace __destroy_n
+
+inline namespace __cpo {
+  inline constexpr auto destroy_n = __destroy_n::__fn{};
+} // namespace __cpo
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_RANGES_CONSTRUCT_AT_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/ranges_uninitialized_algorithms.h b/app/src/main/cpp/libcxx/include/__memory/ranges_uninitialized_algorithms.h
new file mode 100644
index 0000000..15c78e2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/ranges_uninitialized_algorithms.h
@@ -0,0 +1,319 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_RANGES_UNINITIALIZED_ALGORITHMS_H
+#define _LIBCPP___MEMORY_RANGES_UNINITIALIZED_ALGORITHMS_H
+
+#include <__algorithm/in_out_result.h>
+#include <__concepts/constructible.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/readable_traits.h>
+#include <__memory/concepts.h>
+#include <__memory/uninitialized_algorithms.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__type_traits/remove_reference.h>
+#include <__utility/move.h>
+#include <new>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+// uninitialized_default_construct
+
+namespace __uninitialized_default_construct {
+
+struct __fn {
+  template <__nothrow_forward_iterator _ForwardIterator,
+            __nothrow_sentinel_for<_ForwardIterator> _Sentinel>
+    requires default_initializable<iter_value_t<_ForwardIterator>>
+  _ForwardIterator operator()(_ForwardIterator __first, _Sentinel __last) const {
+    using _ValueType = remove_reference_t<iter_reference_t<_ForwardIterator>>;
+    return _VSTD::__uninitialized_default_construct<_ValueType>(
+        _VSTD::move(__first), _VSTD::move(__last));
+  }
+
+  template <__nothrow_forward_range _ForwardRange>
+    requires default_initializable<range_value_t<_ForwardRange>>
+  borrowed_iterator_t<_ForwardRange> operator()(_ForwardRange&& __range) const {
+    return (*this)(ranges::begin(__range), ranges::end(__range));
+  }
+};
+
+} // namespace __uninitialized_default_construct
+
+inline namespace __cpo {
+  inline constexpr auto uninitialized_default_construct = __uninitialized_default_construct::__fn{};
+} // namespace __cpo
+
+// uninitialized_default_construct_n
+
+namespace __uninitialized_default_construct_n {
+
+struct __fn {
+  template <__nothrow_forward_iterator _ForwardIterator>
+    requires default_initializable<iter_value_t<_ForwardIterator>>
+  _ForwardIterator operator()(_ForwardIterator __first,
+                              iter_difference_t<_ForwardIterator> __n) const {
+    using _ValueType = remove_reference_t<iter_reference_t<_ForwardIterator>>;
+    return _VSTD::__uninitialized_default_construct_n<_ValueType>(_VSTD::move(__first), __n);
+  }
+};
+
+} // namespace __uninitialized_default_construct_n
+
+inline namespace __cpo {
+  inline constexpr auto uninitialized_default_construct_n = __uninitialized_default_construct_n::__fn{};
+} // namespace __cpo
+
+// uninitialized_value_construct
+
+namespace __uninitialized_value_construct {
+
+struct __fn {
+  template <__nothrow_forward_iterator _ForwardIterator,
+            __nothrow_sentinel_for<_ForwardIterator> _Sentinel>
+    requires default_initializable<iter_value_t<_ForwardIterator>>
+  _ForwardIterator operator()(_ForwardIterator __first, _Sentinel __last) const {
+    using _ValueType = remove_reference_t<iter_reference_t<_ForwardIterator>>;
+    return _VSTD::__uninitialized_value_construct<_ValueType>(
+        _VSTD::move(__first), _VSTD::move(__last));
+  }
+
+  template <__nothrow_forward_range _ForwardRange>
+    requires default_initializable<range_value_t<_ForwardRange>>
+  borrowed_iterator_t<_ForwardRange> operator()(_ForwardRange&& __range) const {
+    return (*this)(ranges::begin(__range), ranges::end(__range));
+  }
+};
+
+} // namespace __uninitialized_value_construct
+
+inline namespace __cpo {
+  inline constexpr auto uninitialized_value_construct = __uninitialized_value_construct::__fn{};
+} // namespace __cpo
+
+// uninitialized_value_construct_n
+
+namespace __uninitialized_value_construct_n {
+
+struct __fn {
+  template <__nothrow_forward_iterator _ForwardIterator>
+    requires default_initializable<iter_value_t<_ForwardIterator>>
+  _ForwardIterator operator()(_ForwardIterator __first,
+                              iter_difference_t<_ForwardIterator> __n) const {
+    using _ValueType = remove_reference_t<iter_reference_t<_ForwardIterator>>;
+    return _VSTD::__uninitialized_value_construct_n<_ValueType>(_VSTD::move(__first), __n);
+  }
+};
+
+} // namespace __uninitialized_value_construct_n
+
+inline namespace __cpo {
+  inline constexpr auto uninitialized_value_construct_n = __uninitialized_value_construct_n::__fn{};
+} // namespace __cpo
+
+// uninitialized_fill
+
+namespace __uninitialized_fill {
+
+struct __fn {
+  template <__nothrow_forward_iterator _ForwardIterator,
+            __nothrow_sentinel_for<_ForwardIterator> _Sentinel,
+            class _Tp>
+    requires constructible_from<iter_value_t<_ForwardIterator>, const _Tp&>
+  _ForwardIterator operator()(_ForwardIterator __first, _Sentinel __last, const _Tp& __x) const {
+    using _ValueType = remove_reference_t<iter_reference_t<_ForwardIterator>>;
+    return _VSTD::__uninitialized_fill<_ValueType>(_VSTD::move(__first), _VSTD::move(__last), __x);
+  }
+
+  template <__nothrow_forward_range _ForwardRange, class _Tp>
+    requires constructible_from<range_value_t<_ForwardRange>, const _Tp&>
+  borrowed_iterator_t<_ForwardRange> operator()(_ForwardRange&& __range, const _Tp& __x) const {
+    return (*this)(ranges::begin(__range), ranges::end(__range), __x);
+  }
+};
+
+} // namespace __uninitialized_fill
+
+inline namespace __cpo {
+  inline constexpr auto uninitialized_fill = __uninitialized_fill::__fn{};
+} // namespace __cpo
+
+// uninitialized_fill_n
+
+namespace __uninitialized_fill_n {
+
+struct __fn {
+  template <__nothrow_forward_iterator _ForwardIterator, class _Tp>
+    requires constructible_from<iter_value_t<_ForwardIterator>, const _Tp&>
+  _ForwardIterator operator()(_ForwardIterator __first,
+                              iter_difference_t<_ForwardIterator> __n,
+                              const _Tp& __x) const {
+    using _ValueType = remove_reference_t<iter_reference_t<_ForwardIterator>>;
+    return _VSTD::__uninitialized_fill_n<_ValueType>(_VSTD::move(__first), __n, __x);
+  }
+};
+
+} // namespace __uninitialized_fill_n
+
+inline namespace __cpo {
+  inline constexpr auto uninitialized_fill_n = __uninitialized_fill_n::__fn{};
+} // namespace __cpo
+
+// uninitialized_copy
+
+template <class _InputIterator, class _OutputIterator>
+using uninitialized_copy_result = in_out_result<_InputIterator, _OutputIterator>;
+
+namespace __uninitialized_copy {
+
+struct __fn {
+  template <input_iterator _InputIterator,
+            sentinel_for<_InputIterator> _Sentinel1,
+            __nothrow_forward_iterator _OutputIterator,
+            __nothrow_sentinel_for<_OutputIterator> _Sentinel2>
+    requires constructible_from<iter_value_t<_OutputIterator>, iter_reference_t<_InputIterator>>
+  uninitialized_copy_result<_InputIterator, _OutputIterator>
+  operator()(_InputIterator __ifirst, _Sentinel1 __ilast, _OutputIterator __ofirst, _Sentinel2 __olast) const {
+    using _ValueType = remove_reference_t<iter_reference_t<_OutputIterator>>;
+
+    auto __result = _VSTD::__uninitialized_copy<_ValueType>(_VSTD::move(__ifirst), _VSTD::move(__ilast),
+                                                            _VSTD::move(__ofirst), _VSTD::move(__olast));
+    return {_VSTD::move(__result.first), _VSTD::move(__result.second)};
+  }
+
+  template <input_range _InputRange, __nothrow_forward_range _OutputRange>
+    requires constructible_from<range_value_t<_OutputRange>, range_reference_t<_InputRange>>
+  uninitialized_copy_result<borrowed_iterator_t<_InputRange>, borrowed_iterator_t<_OutputRange>>
+  operator()( _InputRange&& __in_range, _OutputRange&& __out_range) const {
+    return (*this)(ranges::begin(__in_range), ranges::end(__in_range),
+                   ranges::begin(__out_range), ranges::end(__out_range));
+  }
+};
+
+} // namespace __uninitialized_copy
+
+inline namespace __cpo {
+  inline constexpr auto uninitialized_copy = __uninitialized_copy::__fn{};
+} // namespace __cpo
+
+// uninitialized_copy_n
+
+template <class _InputIterator, class _OutputIterator>
+using uninitialized_copy_n_result = in_out_result<_InputIterator, _OutputIterator>;
+
+namespace __uninitialized_copy_n {
+
+struct __fn {
+  template <input_iterator _InputIterator,
+           __nothrow_forward_iterator _OutputIterator,
+           __nothrow_sentinel_for<_OutputIterator> _Sentinel>
+    requires constructible_from<iter_value_t<_OutputIterator>, iter_reference_t<_InputIterator>>
+  uninitialized_copy_n_result<_InputIterator, _OutputIterator>
+  operator()(_InputIterator __ifirst, iter_difference_t<_InputIterator> __n,
+             _OutputIterator __ofirst, _Sentinel __olast) const {
+    using _ValueType = remove_reference_t<iter_reference_t<_OutputIterator>>;
+    auto __result = _VSTD::__uninitialized_copy_n<_ValueType>(_VSTD::move(__ifirst), __n,
+                                                              _VSTD::move(__ofirst), _VSTD::move(__olast));
+    return {_VSTD::move(__result.first), _VSTD::move(__result.second)};
+  }
+};
+
+} // namespace __uninitialized_copy_n
+
+inline namespace __cpo {
+  inline constexpr auto uninitialized_copy_n = __uninitialized_copy_n::__fn{};
+} // namespace __cpo
+
+// uninitialized_move
+
+template <class _InputIterator, class _OutputIterator>
+using uninitialized_move_result = in_out_result<_InputIterator, _OutputIterator>;
+
+namespace __uninitialized_move {
+
+struct __fn {
+  template <input_iterator _InputIterator,
+            sentinel_for<_InputIterator> _Sentinel1,
+            __nothrow_forward_iterator _OutputIterator,
+            __nothrow_sentinel_for<_OutputIterator> _Sentinel2>
+    requires constructible_from<iter_value_t<_OutputIterator>, iter_rvalue_reference_t<_InputIterator>>
+  uninitialized_move_result<_InputIterator, _OutputIterator>
+  operator()(_InputIterator __ifirst, _Sentinel1 __ilast, _OutputIterator __ofirst, _Sentinel2 __olast) const {
+    using _ValueType = remove_reference_t<iter_reference_t<_OutputIterator>>;
+    auto __iter_move = [](auto&& __iter) -> decltype(auto) { return ranges::iter_move(__iter); };
+    auto __result = _VSTD::__uninitialized_move<_ValueType>(_VSTD::move(__ifirst), _VSTD::move(__ilast),
+                                                            _VSTD::move(__ofirst), _VSTD::move(__olast), __iter_move);
+    return {_VSTD::move(__result.first), _VSTD::move(__result.second)};
+  }
+
+  template <input_range _InputRange, __nothrow_forward_range _OutputRange>
+    requires constructible_from<range_value_t<_OutputRange>, range_rvalue_reference_t<_InputRange>>
+  uninitialized_move_result<borrowed_iterator_t<_InputRange>, borrowed_iterator_t<_OutputRange>>
+  operator()(_InputRange&& __in_range, _OutputRange&& __out_range) const {
+    return (*this)(ranges::begin(__in_range), ranges::end(__in_range),
+                   ranges::begin(__out_range), ranges::end(__out_range));
+  }
+};
+
+} // namespace __uninitialized_move
+
+inline namespace __cpo {
+  inline constexpr auto uninitialized_move = __uninitialized_move::__fn{};
+} // namespace __cpo
+
+// uninitialized_move_n
+
+template <class _InputIterator, class _OutputIterator>
+using uninitialized_move_n_result = in_out_result<_InputIterator, _OutputIterator>;
+
+namespace __uninitialized_move_n {
+
+struct __fn {
+  template <input_iterator _InputIterator,
+           __nothrow_forward_iterator _OutputIterator,
+           __nothrow_sentinel_for<_OutputIterator> _Sentinel>
+    requires constructible_from<iter_value_t<_OutputIterator>, iter_rvalue_reference_t<_InputIterator>>
+  uninitialized_move_n_result<_InputIterator, _OutputIterator>
+  operator()(_InputIterator __ifirst, iter_difference_t<_InputIterator> __n,
+             _OutputIterator __ofirst, _Sentinel __olast) const {
+    using _ValueType = remove_reference_t<iter_reference_t<_OutputIterator>>;
+    auto __iter_move = [](auto&& __iter) -> decltype(auto) { return ranges::iter_move(__iter); };
+    auto __result = _VSTD::__uninitialized_move_n<_ValueType>(_VSTD::move(__ifirst), __n,
+                                                              _VSTD::move(__ofirst), _VSTD::move(__olast), __iter_move);
+    return {_VSTD::move(__result.first), _VSTD::move(__result.second)};
+  }
+};
+
+} // namespace __uninitialized_move_n
+
+inline namespace __cpo {
+  inline constexpr auto uninitialized_move_n = __uninitialized_move_n::__fn{};
+} // namespace __cpo
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_RANGES_UNINITIALIZED_ALGORITHMS_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/raw_storage_iterator.h b/app/src/main/cpp/libcxx/include/__memory/raw_storage_iterator.h
new file mode 100644
index 0000000..11971de
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/raw_storage_iterator.h
@@ -0,0 +1,70 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_RAW_STORAGE_ITERATOR_H
+#define _LIBCPP___MEMORY_RAW_STORAGE_ITERATOR_H
+
+#include <__config>
+#include <__iterator/iterator.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__utility/move.h>
+#include <cstddef>
+#include <new>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_RAW_STORAGE_ITERATOR)
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _OutputIterator, class _Tp>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX17 raw_storage_iterator
+#if _LIBCPP_STD_VER <= 14 || !defined(_LIBCPP_ABI_NO_ITERATOR_BASES)
+    : public iterator<output_iterator_tag, void, void, void, void>
+#endif
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+private:
+    _OutputIterator __x_;
+public:
+    typedef output_iterator_tag iterator_category;
+    typedef void                value_type;
+#if _LIBCPP_STD_VER > 17
+    typedef ptrdiff_t           difference_type;
+#else
+    typedef void                difference_type;
+#endif
+    typedef void                pointer;
+    typedef void                reference;
+
+    _LIBCPP_INLINE_VISIBILITY explicit raw_storage_iterator(_OutputIterator __x) : __x_(__x) {}
+    _LIBCPP_INLINE_VISIBILITY raw_storage_iterator& operator*() {return *this;}
+    _LIBCPP_INLINE_VISIBILITY raw_storage_iterator& operator=(const _Tp& __element)
+        {::new ((void*)_VSTD::addressof(*__x_)) _Tp(__element); return *this;}
+#if _LIBCPP_STD_VER >= 14
+    _LIBCPP_INLINE_VISIBILITY raw_storage_iterator& operator=(_Tp&& __element)
+        {::new ((void*)_VSTD::addressof(*__x_)) _Tp(_VSTD::move(__element)); return *this;}
+#endif
+    _LIBCPP_INLINE_VISIBILITY raw_storage_iterator& operator++() {++__x_; return *this;}
+    _LIBCPP_INLINE_VISIBILITY raw_storage_iterator  operator++(int)
+        {raw_storage_iterator __t(*this); ++__x_; return __t;}
+#if _LIBCPP_STD_VER >= 14
+    _LIBCPP_INLINE_VISIBILITY _OutputIterator base() const { return __x_; }
+#endif
+};
+
+#endif // _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_RAW_STORAGE_ITERATOR)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_RAW_STORAGE_ITERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/shared_ptr.h b/app/src/main/cpp/libcxx/include/__memory/shared_ptr.h
new file mode 100644
index 0000000..b77ce92
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/shared_ptr.h
@@ -0,0 +1,2008 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_SHARED_PTR_H
+#define _LIBCPP___MEMORY_SHARED_PTR_H
+
+#include <__availability>
+#include <__compare/compare_three_way.h>
+#include <__compare/ordering.h>
+#include <__config>
+#include <__functional/binary_function.h>
+#include <__functional/operations.h>
+#include <__functional/reference_wrapper.h>
+#include <__iterator/access.h>
+#include <__memory/addressof.h>
+#include <__memory/allocation_guard.h>
+#include <__memory/allocator.h>
+#include <__memory/allocator_destructor.h>
+#include <__memory/allocator_traits.h>
+#include <__memory/auto_ptr.h>
+#include <__memory/compressed_pair.h>
+#include <__memory/construct_at.h>
+#include <__memory/pointer_traits.h>
+#include <__memory/uninitialized_algorithms.h>
+#include <__memory/unique_ptr.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <cstddef>
+#include <cstdlib> // abort
+#include <iosfwd>
+#include <new>
+#include <stdexcept>
+#include <typeinfo>
+#if !defined(_LIBCPP_HAS_NO_ATOMIC_HEADER)
+#  include <atomic>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// NOTE: Relaxed and acq/rel atomics (for increment and decrement respectively)
+// should be sufficient for thread safety.
+// See https://llvm.org/PR22803
+#if defined(__clang__) && __has_builtin(__atomic_add_fetch)          \
+                       && defined(__ATOMIC_RELAXED)                  \
+                       && defined(__ATOMIC_ACQ_REL)
+#   define _LIBCPP_HAS_BUILTIN_ATOMIC_SUPPORT
+#elif defined(_LIBCPP_COMPILER_GCC)
+#   define _LIBCPP_HAS_BUILTIN_ATOMIC_SUPPORT
+#endif
+
+template <class _ValueType>
+inline _LIBCPP_INLINE_VISIBILITY
+_ValueType __libcpp_relaxed_load(_ValueType const* __value) {
+#if !defined(_LIBCPP_HAS_NO_THREADS) && \
+    defined(__ATOMIC_RELAXED) &&        \
+    (__has_builtin(__atomic_load_n) || defined(_LIBCPP_COMPILER_GCC))
+    return __atomic_load_n(__value, __ATOMIC_RELAXED);
+#else
+    return *__value;
+#endif
+}
+
+template <class _ValueType>
+inline _LIBCPP_INLINE_VISIBILITY
+_ValueType __libcpp_acquire_load(_ValueType const* __value) {
+#if !defined(_LIBCPP_HAS_NO_THREADS) && \
+    defined(__ATOMIC_ACQUIRE) &&        \
+    (__has_builtin(__atomic_load_n) || defined(_LIBCPP_COMPILER_GCC))
+    return __atomic_load_n(__value, __ATOMIC_ACQUIRE);
+#else
+    return *__value;
+#endif
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _Tp
+__libcpp_atomic_refcount_increment(_Tp& __t) _NOEXCEPT
+{
+#if defined(_LIBCPP_HAS_BUILTIN_ATOMIC_SUPPORT) && !defined(_LIBCPP_HAS_NO_THREADS)
+    return __atomic_add_fetch(&__t, 1, __ATOMIC_RELAXED);
+#else
+    return __t += 1;
+#endif
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _Tp
+__libcpp_atomic_refcount_decrement(_Tp& __t) _NOEXCEPT
+{
+#if defined(_LIBCPP_HAS_BUILTIN_ATOMIC_SUPPORT) && !defined(_LIBCPP_HAS_NO_THREADS)
+    return __atomic_add_fetch(&__t, -1, __ATOMIC_ACQ_REL);
+#else
+    return __t -= 1;
+#endif
+}
+
+class _LIBCPP_EXCEPTION_ABI bad_weak_ptr
+    : public std::exception
+{
+public:
+    bad_weak_ptr() _NOEXCEPT = default;
+    bad_weak_ptr(const bad_weak_ptr&) _NOEXCEPT = default;
+    ~bad_weak_ptr() _NOEXCEPT override;
+    const char* what() const  _NOEXCEPT override;
+};
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_bad_weak_ptr()
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw bad_weak_ptr();
+#else
+    _VSTD::abort();
+#endif
+}
+
+template<class _Tp> class _LIBCPP_TEMPLATE_VIS weak_ptr;
+
+class _LIBCPP_TYPE_VIS __shared_count
+{
+    __shared_count(const __shared_count&);
+    __shared_count& operator=(const __shared_count&);
+
+protected:
+    long __shared_owners_;
+    virtual ~__shared_count();
+private:
+    virtual void __on_zero_shared() _NOEXCEPT = 0;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __shared_count(long __refs = 0) _NOEXCEPT
+        : __shared_owners_(__refs) {}
+
+#if defined(_LIBCPP_SHARED_PTR_DEFINE_LEGACY_INLINE_FUNCTIONS)
+    void __add_shared() noexcept;
+    bool __release_shared() noexcept;
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    void __add_shared() _NOEXCEPT {
+      __libcpp_atomic_refcount_increment(__shared_owners_);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    bool __release_shared() _NOEXCEPT {
+      if (__libcpp_atomic_refcount_decrement(__shared_owners_) == -1) {
+        __on_zero_shared();
+        return true;
+      }
+      return false;
+    }
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    long use_count() const _NOEXCEPT {
+        return __libcpp_relaxed_load(&__shared_owners_) + 1;
+    }
+};
+
+class _LIBCPP_TYPE_VIS __shared_weak_count
+    : private __shared_count
+{
+    long __shared_weak_owners_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __shared_weak_count(long __refs = 0) _NOEXCEPT
+        : __shared_count(__refs),
+          __shared_weak_owners_(__refs) {}
+protected:
+    ~__shared_weak_count() override;
+
+public:
+#if defined(_LIBCPP_SHARED_PTR_DEFINE_LEGACY_INLINE_FUNCTIONS)
+    void __add_shared() noexcept;
+    void __add_weak() noexcept;
+    void __release_shared() noexcept;
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    void __add_shared() _NOEXCEPT {
+      __shared_count::__add_shared();
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    void __add_weak() _NOEXCEPT {
+      __libcpp_atomic_refcount_increment(__shared_weak_owners_);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    void __release_shared() _NOEXCEPT {
+      if (__shared_count::__release_shared())
+        __release_weak();
+    }
+#endif
+    void __release_weak() _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    long use_count() const _NOEXCEPT {return __shared_count::use_count();}
+    __shared_weak_count* lock() _NOEXCEPT;
+
+    virtual const void* __get_deleter(const type_info&) const _NOEXCEPT;
+private:
+    virtual void __on_zero_shared_weak() _NOEXCEPT = 0;
+};
+
+template <class _Tp, class _Dp, class _Alloc>
+class __shared_ptr_pointer
+    : public __shared_weak_count
+{
+    __compressed_pair<__compressed_pair<_Tp, _Dp>, _Alloc> __data_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __shared_ptr_pointer(_Tp __p, _Dp __d, _Alloc __a)
+        :  __data_(__compressed_pair<_Tp, _Dp>(__p, _VSTD::move(__d)), _VSTD::move(__a)) {}
+
+#ifndef _LIBCPP_NO_RTTI
+    const void* __get_deleter(const type_info&) const _NOEXCEPT override;
+#endif
+
+private:
+    void __on_zero_shared() _NOEXCEPT override;
+    void __on_zero_shared_weak() _NOEXCEPT override;
+};
+
+#ifndef _LIBCPP_NO_RTTI
+
+template <class _Tp, class _Dp, class _Alloc>
+const void*
+__shared_ptr_pointer<_Tp, _Dp, _Alloc>::__get_deleter(const type_info& __t) const _NOEXCEPT
+{
+    return __t == typeid(_Dp) ? _VSTD::addressof(__data_.first().second()) : nullptr;
+}
+
+#endif // _LIBCPP_NO_RTTI
+
+template <class _Tp, class _Dp, class _Alloc>
+void
+__shared_ptr_pointer<_Tp, _Dp, _Alloc>::__on_zero_shared() _NOEXCEPT
+{
+    __data_.first().second()(__data_.first().first());
+    __data_.first().second().~_Dp();
+}
+
+template <class _Tp, class _Dp, class _Alloc>
+void
+__shared_ptr_pointer<_Tp, _Dp, _Alloc>::__on_zero_shared_weak() _NOEXCEPT
+{
+    typedef typename __allocator_traits_rebind<_Alloc, __shared_ptr_pointer>::type _Al;
+    typedef allocator_traits<_Al> _ATraits;
+    typedef pointer_traits<typename _ATraits::pointer> _PTraits;
+
+    _Al __a(__data_.second());
+    __data_.second().~_Alloc();
+    __a.deallocate(_PTraits::pointer_to(*this), 1);
+}
+
+struct __default_initialize_tag {};
+
+template <class _Tp, class _Alloc>
+struct __shared_ptr_emplace
+    : __shared_weak_count
+{
+    template<class ..._Args>
+    _LIBCPP_HIDE_FROM_ABI
+    explicit __shared_ptr_emplace(_Alloc __a, _Args&& ...__args)
+        : __storage_(_VSTD::move(__a))
+    {
+#if _LIBCPP_STD_VER > 17
+        using _TpAlloc = typename __allocator_traits_rebind<_Alloc, _Tp>::type;
+        _TpAlloc __tmp(*__get_alloc());
+        allocator_traits<_TpAlloc>::construct(__tmp, __get_elem(), _VSTD::forward<_Args>(__args)...);
+#else
+        ::new ((void*)__get_elem()) _Tp(_VSTD::forward<_Args>(__args)...);
+#endif
+    }
+
+
+#if _LIBCPP_STD_VER >= 20
+    _LIBCPP_HIDE_FROM_ABI
+    explicit __shared_ptr_emplace(__default_initialize_tag, _Alloc __a)
+        : __storage_(std::move(__a))
+    {
+        ::new ((void*)__get_elem()) _Tp;
+    }
+#endif
+
+    _LIBCPP_HIDE_FROM_ABI
+    _Alloc* __get_alloc() _NOEXCEPT { return __storage_.__get_alloc(); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    _Tp* __get_elem() _NOEXCEPT { return __storage_.__get_elem(); }
+
+private:
+    void __on_zero_shared() _NOEXCEPT override {
+#if _LIBCPP_STD_VER > 17
+        using _TpAlloc = typename __allocator_traits_rebind<_Alloc, _Tp>::type;
+        _TpAlloc __tmp(*__get_alloc());
+        allocator_traits<_TpAlloc>::destroy(__tmp, __get_elem());
+#else
+        __get_elem()->~_Tp();
+#endif
+    }
+
+    void __on_zero_shared_weak() _NOEXCEPT override {
+        using _ControlBlockAlloc = typename __allocator_traits_rebind<_Alloc, __shared_ptr_emplace>::type;
+        using _ControlBlockPointer = typename allocator_traits<_ControlBlockAlloc>::pointer;
+        _ControlBlockAlloc __tmp(*__get_alloc());
+        __storage_.~_Storage();
+        allocator_traits<_ControlBlockAlloc>::deallocate(__tmp,
+            pointer_traits<_ControlBlockPointer>::pointer_to(*this), 1);
+    }
+
+    // This class implements the control block for non-array shared pointers created
+    // through `std::allocate_shared` and `std::make_shared`.
+    //
+    // In previous versions of the library, we used a compressed pair to store
+    // both the _Alloc and the _Tp. This implies using EBO, which is incompatible
+    // with Allocator construction for _Tp. To allow implementing P0674 in C++20,
+    // we now use a properly aligned char buffer while making sure that we maintain
+    // the same layout that we had when we used a compressed pair.
+    using _CompressedPair = __compressed_pair<_Alloc, _Tp>;
+    struct _ALIGNAS_TYPE(_CompressedPair) _Storage {
+        char __blob_[sizeof(_CompressedPair)];
+
+        _LIBCPP_HIDE_FROM_ABI explicit _Storage(_Alloc&& __a) {
+            ::new ((void*)__get_alloc()) _Alloc(_VSTD::move(__a));
+        }
+        _LIBCPP_HIDE_FROM_ABI ~_Storage() {
+            __get_alloc()->~_Alloc();
+        }
+        _Alloc* __get_alloc() _NOEXCEPT {
+            _CompressedPair *__as_pair = reinterpret_cast<_CompressedPair*>(__blob_);
+            typename _CompressedPair::_Base1* __first = _CompressedPair::__get_first_base(__as_pair);
+            _Alloc *__alloc = reinterpret_cast<_Alloc*>(__first);
+            return __alloc;
+        }
+        _LIBCPP_NO_CFI _Tp* __get_elem() _NOEXCEPT {
+            _CompressedPair *__as_pair = reinterpret_cast<_CompressedPair*>(__blob_);
+            typename _CompressedPair::_Base2* __second = _CompressedPair::__get_second_base(__as_pair);
+            _Tp *__elem = reinterpret_cast<_Tp*>(__second);
+            return __elem;
+        }
+    };
+
+    static_assert(_LIBCPP_ALIGNOF(_Storage) == _LIBCPP_ALIGNOF(_CompressedPair), "");
+    static_assert(sizeof(_Storage) == sizeof(_CompressedPair), "");
+    _Storage __storage_;
+};
+
+struct __shared_ptr_dummy_rebind_allocator_type;
+template <>
+class _LIBCPP_TEMPLATE_VIS allocator<__shared_ptr_dummy_rebind_allocator_type>
+{
+public:
+    template <class _Other>
+    struct rebind
+    {
+        typedef allocator<_Other> other;
+    };
+};
+
+template<class _Tp> class _LIBCPP_TEMPLATE_VIS enable_shared_from_this;
+
+template<class _Tp, class _Up>
+struct __compatible_with
+#if _LIBCPP_STD_VER > 14
+    : is_convertible<remove_extent_t<_Tp>*, remove_extent_t<_Up>*> {};
+#else
+    : is_convertible<_Tp*, _Up*> {};
+#endif // _LIBCPP_STD_VER > 14
+
+template <class _Ptr, class = void>
+struct __is_deletable : false_type { };
+template <class _Ptr>
+struct __is_deletable<_Ptr, decltype(delete std::declval<_Ptr>())> : true_type { };
+
+template <class _Ptr, class = void>
+struct __is_array_deletable : false_type { };
+template <class _Ptr>
+struct __is_array_deletable<_Ptr, decltype(delete[] std::declval<_Ptr>())> : true_type { };
+
+template <class _Dp, class _Pt,
+    class = decltype(std::declval<_Dp>()(std::declval<_Pt>()))>
+static true_type __well_formed_deleter_test(int);
+
+template <class, class>
+static false_type __well_formed_deleter_test(...);
+
+template <class _Dp, class _Pt>
+struct __well_formed_deleter : decltype(std::__well_formed_deleter_test<_Dp, _Pt>(0)) {};
+
+template<class _Dp, class _Tp, class _Yp>
+struct __shared_ptr_deleter_ctor_reqs
+{
+    static const bool value = __compatible_with<_Tp, _Yp>::value &&
+                              is_move_constructible<_Dp>::value &&
+                              __well_formed_deleter<_Dp, _Tp*>::value;
+};
+
+#if defined(_LIBCPP_ABI_ENABLE_SHARED_PTR_TRIVIAL_ABI)
+#  define _LIBCPP_SHARED_PTR_TRIVIAL_ABI __attribute__((trivial_abi))
+#else
+#  define _LIBCPP_SHARED_PTR_TRIVIAL_ABI
+#endif
+
+template<class _Tp>
+class _LIBCPP_SHARED_PTR_TRIVIAL_ABI _LIBCPP_TEMPLATE_VIS shared_ptr
+{
+public:
+#if _LIBCPP_STD_VER > 14
+    typedef weak_ptr<_Tp> weak_type;
+    typedef remove_extent_t<_Tp> element_type;
+#else
+    typedef _Tp element_type;
+#endif
+
+private:
+    element_type*      __ptr_;
+    __shared_weak_count* __cntrl_;
+
+public:
+    _LIBCPP_HIDE_FROM_ABI
+    _LIBCPP_CONSTEXPR shared_ptr() _NOEXCEPT
+        : __ptr_(nullptr),
+          __cntrl_(nullptr)
+    { }
+
+    _LIBCPP_HIDE_FROM_ABI
+    _LIBCPP_CONSTEXPR shared_ptr(nullptr_t) _NOEXCEPT
+        : __ptr_(nullptr),
+          __cntrl_(nullptr)
+    { }
+
+    template<class _Yp, class = __enable_if_t<
+        _And<
+            __compatible_with<_Yp, _Tp>
+            // In C++03 we get errors when trying to do SFINAE with the
+            // delete operator, so we always pretend that it's deletable.
+            // The same happens on GCC.
+#if !defined(_LIBCPP_CXX03_LANG) && !defined(_LIBCPP_COMPILER_GCC)
+            , _If<is_array<_Tp>::value, __is_array_deletable<_Yp*>, __is_deletable<_Yp*> >
+#endif
+        >::value
+    > >
+    explicit shared_ptr(_Yp* __p) : __ptr_(__p) {
+        unique_ptr<_Yp> __hold(__p);
+        typedef typename __shared_ptr_default_allocator<_Yp>::type _AllocT;
+        typedef __shared_ptr_pointer<_Yp*, __shared_ptr_default_delete<_Tp, _Yp>, _AllocT> _CntrlBlk;
+        __cntrl_ = new _CntrlBlk(__p, __shared_ptr_default_delete<_Tp, _Yp>(), _AllocT());
+        __hold.release();
+        __enable_weak_this(__p, __p);
+    }
+
+    template<class _Yp, class _Dp, class = __enable_if_t<__shared_ptr_deleter_ctor_reqs<_Dp, _Yp, element_type>::value> >
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr(_Yp* __p, _Dp __d)
+        : __ptr_(__p)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            typedef typename __shared_ptr_default_allocator<_Yp>::type _AllocT;
+            typedef __shared_ptr_pointer<_Yp*, _Dp, _AllocT> _CntrlBlk;
+#ifndef _LIBCPP_CXX03_LANG
+            __cntrl_ = new _CntrlBlk(__p, _VSTD::move(__d), _AllocT());
+#else
+            __cntrl_ = new _CntrlBlk(__p, __d, _AllocT());
+#endif // not _LIBCPP_CXX03_LANG
+            __enable_weak_this(__p, __p);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __d(__p);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+
+    template<class _Yp, class _Dp, class _Alloc, class = __enable_if_t<__shared_ptr_deleter_ctor_reqs<_Dp, _Yp, element_type>::value> >
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr(_Yp* __p, _Dp __d, _Alloc __a)
+        : __ptr_(__p)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            typedef __shared_ptr_pointer<_Yp*, _Dp, _Alloc> _CntrlBlk;
+            typedef typename __allocator_traits_rebind<_Alloc, _CntrlBlk>::type _A2;
+            typedef __allocator_destructor<_A2> _D2;
+            _A2 __a2(__a);
+            unique_ptr<_CntrlBlk, _D2> __hold2(__a2.allocate(1), _D2(__a2, 1));
+            ::new ((void*)_VSTD::addressof(*__hold2.get()))
+#ifndef _LIBCPP_CXX03_LANG
+                _CntrlBlk(__p, _VSTD::move(__d), __a);
+#else
+                _CntrlBlk(__p, __d, __a);
+#endif // not _LIBCPP_CXX03_LANG
+            __cntrl_ = _VSTD::addressof(*__hold2.release());
+            __enable_weak_this(__p, __p);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __d(__p);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+
+    template<class _Dp>
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr(nullptr_t __p, _Dp __d)
+        : __ptr_(nullptr)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            typedef typename __shared_ptr_default_allocator<_Tp>::type _AllocT;
+            typedef __shared_ptr_pointer<nullptr_t, _Dp, _AllocT> _CntrlBlk;
+#ifndef _LIBCPP_CXX03_LANG
+            __cntrl_ = new _CntrlBlk(__p, _VSTD::move(__d), _AllocT());
+#else
+            __cntrl_ = new _CntrlBlk(__p, __d, _AllocT());
+#endif // not _LIBCPP_CXX03_LANG
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __d(__p);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+
+    template<class _Dp, class _Alloc>
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr(nullptr_t __p, _Dp __d, _Alloc __a)
+        : __ptr_(nullptr)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            typedef __shared_ptr_pointer<nullptr_t, _Dp, _Alloc> _CntrlBlk;
+            typedef typename __allocator_traits_rebind<_Alloc, _CntrlBlk>::type _A2;
+            typedef __allocator_destructor<_A2> _D2;
+            _A2 __a2(__a);
+            unique_ptr<_CntrlBlk, _D2> __hold2(__a2.allocate(1), _D2(__a2, 1));
+            ::new ((void*)_VSTD::addressof(*__hold2.get()))
+#ifndef _LIBCPP_CXX03_LANG
+                _CntrlBlk(__p, _VSTD::move(__d), __a);
+#else
+                _CntrlBlk(__p, __d, __a);
+#endif // not _LIBCPP_CXX03_LANG
+            __cntrl_ = _VSTD::addressof(*__hold2.release());
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __d(__p);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+
+    template<class _Yp>
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr(const shared_ptr<_Yp>& __r, element_type *__p) _NOEXCEPT
+        : __ptr_(__p),
+          __cntrl_(__r.__cntrl_)
+    {
+        if (__cntrl_)
+            __cntrl_->__add_shared();
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr(const shared_ptr& __r) _NOEXCEPT
+        : __ptr_(__r.__ptr_),
+          __cntrl_(__r.__cntrl_)
+    {
+        if (__cntrl_)
+            __cntrl_->__add_shared();
+    }
+
+    template<class _Yp, class = __enable_if_t<__compatible_with<_Yp, _Tp>::value> >
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr(const shared_ptr<_Yp>& __r) _NOEXCEPT
+        : __ptr_(__r.__ptr_),
+          __cntrl_(__r.__cntrl_)
+    {
+        if (__cntrl_)
+            __cntrl_->__add_shared();
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr(shared_ptr&& __r) _NOEXCEPT
+        : __ptr_(__r.__ptr_),
+          __cntrl_(__r.__cntrl_)
+    {
+        __r.__ptr_ = nullptr;
+        __r.__cntrl_ = nullptr;
+    }
+
+    template<class _Yp, class = __enable_if_t<__compatible_with<_Yp, _Tp>::value> >
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr(shared_ptr<_Yp>&& __r) _NOEXCEPT
+        : __ptr_(__r.__ptr_),
+          __cntrl_(__r.__cntrl_)
+    {
+        __r.__ptr_ = nullptr;
+        __r.__cntrl_ = nullptr;
+    }
+
+    template<class _Yp, class = __enable_if_t<__compatible_with<_Yp, _Tp>::value> >
+    _LIBCPP_HIDE_FROM_ABI
+    explicit shared_ptr(const weak_ptr<_Yp>& __r)
+        : __ptr_(__r.__ptr_),
+          __cntrl_(__r.__cntrl_ ? __r.__cntrl_->lock() : __r.__cntrl_)
+    {
+        if (__cntrl_ == nullptr)
+            __throw_bad_weak_ptr();
+    }
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_AUTO_PTR)
+    template<class _Yp, class = __enable_if_t<is_convertible<_Yp*, element_type*>::value> >
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr(auto_ptr<_Yp>&& __r)
+        : __ptr_(__r.get())
+    {
+        typedef __shared_ptr_pointer<_Yp*, default_delete<_Yp>, allocator<_Yp> > _CntrlBlk;
+        __cntrl_ = new _CntrlBlk(__r.get(), default_delete<_Yp>(), allocator<_Yp>());
+        __enable_weak_this(__r.get(), __r.get());
+        __r.release();
+    }
+#endif
+
+    template <class _Yp, class _Dp, class = __enable_if_t<
+        !is_lvalue_reference<_Dp>::value &&
+         is_convertible<typename unique_ptr<_Yp, _Dp>::pointer, element_type*>::value
+    > >
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr(unique_ptr<_Yp, _Dp>&& __r)
+        : __ptr_(__r.get())
+    {
+#if _LIBCPP_STD_VER > 11
+        if (__ptr_ == nullptr)
+            __cntrl_ = nullptr;
+        else
+#endif
+        {
+            typedef typename __shared_ptr_default_allocator<_Yp>::type _AllocT;
+            typedef __shared_ptr_pointer<typename unique_ptr<_Yp, _Dp>::pointer, _Dp, _AllocT> _CntrlBlk;
+            __cntrl_ = new _CntrlBlk(__r.get(), std::move(__r.get_deleter()), _AllocT());
+            __enable_weak_this(__r.get(), __r.get());
+        }
+        __r.release();
+    }
+
+    template <class _Yp, class _Dp, class = void, class = __enable_if_t<
+        is_lvalue_reference<_Dp>::value &&
+        is_convertible<typename unique_ptr<_Yp, _Dp>::pointer, element_type*>::value
+    > >
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr(unique_ptr<_Yp, _Dp>&& __r)
+        : __ptr_(__r.get())
+    {
+#if _LIBCPP_STD_VER > 11
+        if (__ptr_ == nullptr)
+            __cntrl_ = nullptr;
+        else
+#endif
+        {
+            typedef typename __shared_ptr_default_allocator<_Yp>::type _AllocT;
+            typedef __shared_ptr_pointer<typename unique_ptr<_Yp, _Dp>::pointer,
+                                        reference_wrapper<__libcpp_remove_reference_t<_Dp> >,
+                                        _AllocT> _CntrlBlk;
+            __cntrl_ = new _CntrlBlk(__r.get(), _VSTD::ref(__r.get_deleter()), _AllocT());
+            __enable_weak_this(__r.get(), __r.get());
+        }
+        __r.release();
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    ~shared_ptr()
+    {
+        if (__cntrl_)
+            __cntrl_->__release_shared();
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr<_Tp>& operator=(const shared_ptr& __r) _NOEXCEPT
+    {
+        shared_ptr(__r).swap(*this);
+        return *this;
+    }
+
+    template<class _Yp, class = __enable_if_t<__compatible_with<_Yp, _Tp>::value> >
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr<_Tp>& operator=(const shared_ptr<_Yp>& __r) _NOEXCEPT
+    {
+        shared_ptr(__r).swap(*this);
+        return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr<_Tp>& operator=(shared_ptr&& __r) _NOEXCEPT
+    {
+        shared_ptr(_VSTD::move(__r)).swap(*this);
+        return *this;
+    }
+
+    template<class _Yp, class = __enable_if_t<__compatible_with<_Yp, _Tp>::value> >
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr<_Tp>& operator=(shared_ptr<_Yp>&& __r)
+    {
+        shared_ptr(_VSTD::move(__r)).swap(*this);
+        return *this;
+    }
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_AUTO_PTR)
+    template<class _Yp, class = __enable_if_t<
+        !is_array<_Yp>::value &&
+        is_convertible<_Yp*, typename shared_ptr<_Tp>::element_type*>::value
+    > >
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr<_Tp>& operator=(auto_ptr<_Yp>&& __r)
+    {
+        shared_ptr(_VSTD::move(__r)).swap(*this);
+        return *this;
+    }
+#endif
+
+    template <class _Yp, class _Dp, class = __enable_if_t<
+        is_convertible<typename unique_ptr<_Yp, _Dp>::pointer, element_type*>::value
+    > >
+    _LIBCPP_HIDE_FROM_ABI
+    shared_ptr<_Tp>& operator=(unique_ptr<_Yp, _Dp>&& __r)
+    {
+        shared_ptr(_VSTD::move(__r)).swap(*this);
+        return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    void swap(shared_ptr& __r) _NOEXCEPT
+    {
+        _VSTD::swap(__ptr_, __r.__ptr_);
+        _VSTD::swap(__cntrl_, __r.__cntrl_);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    void reset() _NOEXCEPT
+    {
+        shared_ptr().swap(*this);
+    }
+
+    template<class _Yp, class = __enable_if_t<
+        __compatible_with<_Yp, _Tp>::value
+    > >
+    _LIBCPP_HIDE_FROM_ABI
+    void reset(_Yp* __p)
+    {
+        shared_ptr(__p).swap(*this);
+    }
+
+    template<class _Yp, class _Dp, class = __enable_if_t<
+        __compatible_with<_Yp, _Tp>::value
+    > >
+    _LIBCPP_HIDE_FROM_ABI
+    void reset(_Yp* __p, _Dp __d)
+    {
+        shared_ptr(__p, __d).swap(*this);
+    }
+
+    template<class _Yp, class _Dp, class _Alloc, class = __enable_if_t<
+        __compatible_with<_Yp, _Tp>::value
+    > >
+    _LIBCPP_HIDE_FROM_ABI
+    void reset(_Yp* __p, _Dp __d, _Alloc __a)
+    {
+        shared_ptr(__p, __d, __a).swap(*this);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    element_type* get() const _NOEXCEPT
+    {
+        return __ptr_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    __add_lvalue_reference_t<element_type> operator*() const _NOEXCEPT
+    {
+        return *__ptr_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    element_type* operator->() const _NOEXCEPT
+    {
+        static_assert(!is_array<_Tp>::value,
+                      "std::shared_ptr<T>::operator-> is only valid when T is not an array type.");
+        return __ptr_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    long use_count() const _NOEXCEPT
+    {
+        return __cntrl_ ? __cntrl_->use_count() : 0;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    bool unique() const _NOEXCEPT
+    {
+        return use_count() == 1;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    explicit operator bool() const _NOEXCEPT
+    {
+        return get() != nullptr;
+    }
+
+    template <class _Up>
+    _LIBCPP_HIDE_FROM_ABI
+    bool owner_before(shared_ptr<_Up> const& __p) const _NOEXCEPT
+    {
+        return __cntrl_ < __p.__cntrl_;
+    }
+
+    template <class _Up>
+    _LIBCPP_HIDE_FROM_ABI
+    bool owner_before(weak_ptr<_Up> const& __p) const _NOEXCEPT
+    {
+        return __cntrl_ < __p.__cntrl_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    bool __owner_equivalent(const shared_ptr& __p) const
+    {
+        return __cntrl_ == __p.__cntrl_;
+    }
+
+#if _LIBCPP_STD_VER > 14
+    _LIBCPP_HIDE_FROM_ABI
+    __add_lvalue_reference_t<element_type> operator[](ptrdiff_t __i) const
+    {
+            static_assert(is_array<_Tp>::value,
+                          "std::shared_ptr<T>::operator[] is only valid when T is an array type.");
+            return __ptr_[__i];
+    }
+#endif
+
+#ifndef _LIBCPP_NO_RTTI
+    template <class _Dp>
+    _LIBCPP_HIDE_FROM_ABI
+    _Dp* __get_deleter() const _NOEXCEPT
+    {
+        return static_cast<_Dp*>(__cntrl_
+                    ? const_cast<void *>(__cntrl_->__get_deleter(typeid(_Dp)))
+                      : nullptr);
+    }
+#endif // _LIBCPP_NO_RTTI
+
+    template<class _Yp, class _CntrlBlk>
+    _LIBCPP_HIDE_FROM_ABI
+    static shared_ptr<_Tp> __create_with_control_block(_Yp* __p, _CntrlBlk* __cntrl) _NOEXCEPT
+    {
+        shared_ptr<_Tp> __r;
+        __r.__ptr_ = __p;
+        __r.__cntrl_ = __cntrl;
+        __r.__enable_weak_this(__r.__ptr_, __r.__ptr_);
+        return __r;
+    }
+
+private:
+    template <class _Yp, bool = is_function<_Yp>::value>
+    struct __shared_ptr_default_allocator
+    {
+        typedef allocator<_Yp> type;
+    };
+
+    template <class _Yp>
+    struct __shared_ptr_default_allocator<_Yp, true>
+    {
+        typedef allocator<__shared_ptr_dummy_rebind_allocator_type> type;
+    };
+
+    template <class _Yp, class _OrigPtr, class = __enable_if_t<
+        is_convertible<_OrigPtr*, const enable_shared_from_this<_Yp>*>::value
+    > >
+    _LIBCPP_HIDE_FROM_ABI
+    void __enable_weak_this(const enable_shared_from_this<_Yp>* __e, _OrigPtr* __ptr) _NOEXCEPT
+    {
+        typedef __remove_cv_t<_Yp> _RawYp;
+        if (__e && __e->__weak_this_.expired())
+        {
+            __e->__weak_this_ = shared_ptr<_RawYp>(*this,
+                const_cast<_RawYp*>(static_cast<const _Yp*>(__ptr)));
+        }
+    }
+
+    _LIBCPP_HIDE_FROM_ABI void __enable_weak_this(...) _NOEXCEPT { }
+
+    template <class, class _Yp>
+    struct __shared_ptr_default_delete
+        : default_delete<_Yp>
+    { };
+
+    template <class _Yp, class _Un, size_t _Sz>
+    struct __shared_ptr_default_delete<_Yp[_Sz], _Un>
+        : default_delete<_Yp[]>
+    { };
+
+    template <class _Yp, class _Un>
+    struct __shared_ptr_default_delete<_Yp[], _Un>
+        : default_delete<_Yp[]>
+    { };
+
+    template <class _Up> friend class _LIBCPP_TEMPLATE_VIS shared_ptr;
+    template <class _Up> friend class _LIBCPP_TEMPLATE_VIS weak_ptr;
+};
+
+#if _LIBCPP_STD_VER > 14
+template<class _Tp>
+shared_ptr(weak_ptr<_Tp>) -> shared_ptr<_Tp>;
+template<class _Tp, class _Dp>
+shared_ptr(unique_ptr<_Tp, _Dp>) -> shared_ptr<_Tp>;
+#endif
+
+//
+// std::allocate_shared and std::make_shared
+//
+template<class _Tp, class _Alloc, class ..._Args, class = __enable_if_t<!is_array<_Tp>::value> >
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> allocate_shared(const _Alloc& __a, _Args&& ...__args)
+{
+    using _ControlBlock = __shared_ptr_emplace<_Tp, _Alloc>;
+    using _ControlBlockAllocator = typename __allocator_traits_rebind<_Alloc, _ControlBlock>::type;
+    __allocation_guard<_ControlBlockAllocator> __guard(__a, 1);
+    ::new ((void*)_VSTD::addressof(*__guard.__get())) _ControlBlock(__a, _VSTD::forward<_Args>(__args)...);
+    auto __control_block = __guard.__release_ptr();
+    return shared_ptr<_Tp>::__create_with_control_block((*__control_block).__get_elem(), _VSTD::addressof(*__control_block));
+}
+
+template<class _Tp, class ..._Args, class = __enable_if_t<!is_array<_Tp>::value> >
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> make_shared(_Args&& ...__args)
+{
+    return _VSTD::allocate_shared<_Tp>(allocator<_Tp>(), _VSTD::forward<_Args>(__args)...);
+}
+
+#if _LIBCPP_STD_VER >= 20
+
+template<class _Tp, class _Alloc, __enable_if_t<!is_array<_Tp>::value, int> = 0>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> allocate_shared_for_overwrite(const _Alloc& __a)
+{
+    using _ControlBlock = __shared_ptr_emplace<_Tp, _Alloc>;
+    using _ControlBlockAllocator = typename __allocator_traits_rebind<_Alloc, _ControlBlock>::type;
+    __allocation_guard<_ControlBlockAllocator> __guard(__a, 1);
+    ::new ((void*)_VSTD::addressof(*__guard.__get())) _ControlBlock(__default_initialize_tag{}, __a);
+    auto __control_block = __guard.__release_ptr();
+    return shared_ptr<_Tp>::__create_with_control_block((*__control_block).__get_elem(), _VSTD::addressof(*__control_block));
+}
+
+template<class _Tp, __enable_if_t<!is_array<_Tp>::value, int> = 0>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> make_shared_for_overwrite()
+{
+    return std::allocate_shared_for_overwrite<_Tp>(allocator<_Tp>());
+}
+
+#endif // _LIBCPP_STD_VER >= 20
+
+#if _LIBCPP_STD_VER > 14
+
+template <size_t _Alignment>
+struct __sp_aligned_storage {
+    alignas(_Alignment) char __storage[_Alignment];
+};
+
+template <class _Tp, class _Alloc>
+struct __unbounded_array_control_block;
+
+template <class _Tp, class _Alloc>
+struct __unbounded_array_control_block<_Tp[], _Alloc> : __shared_weak_count
+{
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    _Tp* __get_data() noexcept { return __data_; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    explicit __unbounded_array_control_block(_Alloc const& __alloc, size_t __count, _Tp const& __arg)
+        : __alloc_(__alloc), __count_(__count)
+    {
+        std::__uninitialized_allocator_fill_n(__alloc_, std::begin(__data_), __count_, __arg);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    explicit __unbounded_array_control_block(_Alloc const& __alloc, size_t __count)
+        : __alloc_(__alloc), __count_(__count)
+    {
+        std::__uninitialized_allocator_value_construct_n(__alloc_, std::begin(__data_), __count_);
+    }
+
+#if _LIBCPP_STD_VER >= 20
+    _LIBCPP_HIDE_FROM_ABI
+    explicit __unbounded_array_control_block(_Alloc const& __alloc, size_t __count, __default_initialize_tag)
+        : __alloc_(__alloc), __count_(__count)
+    {
+        // We are purposefully not using an allocator-aware default construction because the spec says so.
+        // There's currently no way of expressing default initialization in an allocator-aware manner anyway.
+        std::uninitialized_default_construct_n(std::begin(__data_), __count_);
+    }
+#endif
+
+    // Returns the number of bytes required to store a control block followed by the given number
+    // of elements of _Tp, with the whole storage being aligned to a multiple of _Tp's alignment.
+    _LIBCPP_HIDE_FROM_ABI
+    static constexpr size_t __bytes_for(size_t __elements) {
+        // When there's 0 elements, the control block alone is enough since it holds one element.
+        // Otherwise, we allocate one fewer element than requested because the control block already
+        // holds one. Also, we use the bitwise formula below to ensure that we allocate enough bytes
+        // for the whole allocation to be a multiple of _Tp's alignment. That formula is taken from [1].
+        //
+        // [1]: https://en.wikipedia.org/wiki/Data_structure_alignment#Computing_padding
+        size_t __bytes = __elements == 0 ? sizeof(__unbounded_array_control_block)
+                                         : (__elements - 1) * sizeof(_Tp) + sizeof(__unbounded_array_control_block);
+        constexpr size_t __align = alignof(_Tp);
+        return (__bytes + __align - 1) & ~(__align - 1);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL
+    ~__unbounded_array_control_block() override { } // can't be `= default` because of the sometimes-non-trivial union member __data_
+
+private:
+    void __on_zero_shared() _NOEXCEPT override {
+        __allocator_traits_rebind_t<_Alloc, _Tp> __value_alloc(__alloc_);
+        std::__allocator_destroy_multidimensional(__value_alloc, __data_, __data_ + __count_);
+    }
+
+    void __on_zero_shared_weak() _NOEXCEPT override {
+        using _AlignedStorage = __sp_aligned_storage<alignof(__unbounded_array_control_block)>;
+        using _StorageAlloc = __allocator_traits_rebind_t<_Alloc, _AlignedStorage>;
+        using _PointerTraits = pointer_traits<typename allocator_traits<_StorageAlloc>::pointer>;
+
+        _StorageAlloc __tmp(__alloc_);
+        __alloc_.~_Alloc();
+        size_t __size = __unbounded_array_control_block::__bytes_for(__count_);
+        _AlignedStorage* __storage = reinterpret_cast<_AlignedStorage*>(this);
+        allocator_traits<_StorageAlloc>::deallocate(__tmp, _PointerTraits::pointer_to(*__storage), __size);
+    }
+
+    _LIBCPP_NO_UNIQUE_ADDRESS _Alloc __alloc_;
+    size_t __count_;
+    union {
+        _Tp __data_[1];
+    };
+};
+
+template<class _Array, class _Alloc, class... _Arg>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Array> __allocate_shared_unbounded_array(const _Alloc& __a, size_t __n, _Arg&& ...__arg)
+{
+    static_assert(__libcpp_is_unbounded_array<_Array>::value);
+    // We compute the number of bytes necessary to hold the control block and the
+    // array elements. Then, we allocate an array of properly-aligned dummy structs
+    // large enough to hold the control block and array. This allows shifting the
+    // burden of aligning memory properly from us to the allocator.
+    using _ControlBlock = __unbounded_array_control_block<_Array, _Alloc>;
+    using _AlignedStorage = __sp_aligned_storage<alignof(_ControlBlock)>;
+    using _StorageAlloc = __allocator_traits_rebind_t<_Alloc, _AlignedStorage>;
+    __allocation_guard<_StorageAlloc> __guard(__a, _ControlBlock::__bytes_for(__n) / sizeof(_AlignedStorage));
+    _ControlBlock* __control_block = reinterpret_cast<_ControlBlock*>(std::addressof(*__guard.__get()));
+    std::__construct_at(__control_block, __a, __n, std::forward<_Arg>(__arg)...);
+    __guard.__release_ptr();
+    return shared_ptr<_Array>::__create_with_control_block(__control_block->__get_data(), __control_block);
+}
+
+template <class _Tp, class _Alloc>
+struct __bounded_array_control_block;
+
+template <class _Tp, size_t _Count, class _Alloc>
+struct __bounded_array_control_block<_Tp[_Count], _Alloc>
+    : __shared_weak_count
+{
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    _Tp* __get_data() noexcept { return __data_; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    explicit __bounded_array_control_block(_Alloc const& __alloc, _Tp const& __arg) : __alloc_(__alloc) {
+        std::__uninitialized_allocator_fill_n(__alloc_, std::addressof(__data_[0]), _Count, __arg);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    explicit __bounded_array_control_block(_Alloc const& __alloc) : __alloc_(__alloc) {
+        std::__uninitialized_allocator_value_construct_n(__alloc_, std::addressof(__data_[0]), _Count);
+    }
+
+#if _LIBCPP_STD_VER >= 20
+    _LIBCPP_HIDE_FROM_ABI
+    explicit __bounded_array_control_block(_Alloc const& __alloc, __default_initialize_tag) : __alloc_(__alloc) {
+        // We are purposefully not using an allocator-aware default construction because the spec says so.
+        // There's currently no way of expressing default initialization in an allocator-aware manner anyway.
+        std::uninitialized_default_construct_n(std::addressof(__data_[0]), _Count);
+    }
+#endif
+
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL
+    ~__bounded_array_control_block() override { } // can't be `= default` because of the sometimes-non-trivial union member __data_
+
+private:
+    void __on_zero_shared() _NOEXCEPT override {
+        __allocator_traits_rebind_t<_Alloc, _Tp> __value_alloc(__alloc_);
+        std::__allocator_destroy_multidimensional(__value_alloc, __data_, __data_ + _Count);
+    }
+
+    void __on_zero_shared_weak() _NOEXCEPT override {
+        using _ControlBlockAlloc = __allocator_traits_rebind_t<_Alloc, __bounded_array_control_block>;
+        using _PointerTraits = pointer_traits<typename allocator_traits<_ControlBlockAlloc>::pointer>;
+
+        _ControlBlockAlloc __tmp(__alloc_);
+        __alloc_.~_Alloc();
+        allocator_traits<_ControlBlockAlloc>::deallocate(__tmp, _PointerTraits::pointer_to(*this), sizeof(*this));
+    }
+
+    _LIBCPP_NO_UNIQUE_ADDRESS _Alloc __alloc_;
+    union {
+        _Tp __data_[_Count];
+    };
+};
+
+template<class _Array, class _Alloc, class... _Arg>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Array> __allocate_shared_bounded_array(const _Alloc& __a, _Arg&& ...__arg)
+{
+    static_assert(__libcpp_is_bounded_array<_Array>::value);
+    using _ControlBlock = __bounded_array_control_block<_Array, _Alloc>;
+    using _ControlBlockAlloc = __allocator_traits_rebind_t<_Alloc, _ControlBlock>;
+
+    __allocation_guard<_ControlBlockAlloc> __guard(__a, 1);
+    _ControlBlock* __control_block = reinterpret_cast<_ControlBlock*>(std::addressof(*__guard.__get()));
+    std::__construct_at(__control_block, __a, std::forward<_Arg>(__arg)...);
+    __guard.__release_ptr();
+    return shared_ptr<_Array>::__create_with_control_block(__control_block->__get_data(), __control_block);
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+#if _LIBCPP_STD_VER > 17
+
+// bounded array variants
+template<class _Tp, class _Alloc, class = __enable_if_t<is_bounded_array<_Tp>::value>>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> allocate_shared(const _Alloc& __a)
+{
+    return std::__allocate_shared_bounded_array<_Tp>(__a);
+}
+
+template<class _Tp, class _Alloc, class = __enable_if_t<is_bounded_array<_Tp>::value>>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> allocate_shared(const _Alloc& __a, const remove_extent_t<_Tp>& __u)
+{
+    return std::__allocate_shared_bounded_array<_Tp>(__a, __u);
+}
+
+template<class _Tp, class _Alloc, __enable_if_t<is_bounded_array<_Tp>::value, int> = 0>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> allocate_shared_for_overwrite(const _Alloc& __a)
+{
+    return std::__allocate_shared_bounded_array<_Tp>(__a, __default_initialize_tag{});
+}
+
+template<class _Tp, class = __enable_if_t<is_bounded_array<_Tp>::value>>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> make_shared()
+{
+    return std::__allocate_shared_bounded_array<_Tp>(allocator<_Tp>());
+}
+
+template<class _Tp, class = __enable_if_t<is_bounded_array<_Tp>::value>>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> make_shared(const remove_extent_t<_Tp>& __u)
+{
+    return std::__allocate_shared_bounded_array<_Tp>(allocator<_Tp>(), __u);
+}
+
+template<class _Tp, __enable_if_t<is_bounded_array<_Tp>::value, int> = 0>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> make_shared_for_overwrite()
+{
+    return std::__allocate_shared_bounded_array<_Tp>(allocator<_Tp>(), __default_initialize_tag{});
+}
+
+// unbounded array variants
+template<class _Tp, class _Alloc, class = __enable_if_t<is_unbounded_array<_Tp>::value>>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> allocate_shared(const _Alloc& __a, size_t __n)
+{
+    return std::__allocate_shared_unbounded_array<_Tp>(__a, __n);
+}
+
+template<class _Tp, class _Alloc, class = __enable_if_t<is_unbounded_array<_Tp>::value>>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> allocate_shared(const _Alloc& __a, size_t __n, const remove_extent_t<_Tp>& __u)
+{
+    return std::__allocate_shared_unbounded_array<_Tp>(__a, __n, __u);
+}
+
+template<class _Tp, class _Alloc, __enable_if_t<is_unbounded_array<_Tp>::value, int> = 0>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> allocate_shared_for_overwrite(const _Alloc& __a, size_t __n)
+{
+    return std::__allocate_shared_unbounded_array<_Tp>(__a, __n, __default_initialize_tag{});
+}
+
+template<class _Tp, class = __enable_if_t<is_unbounded_array<_Tp>::value>>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> make_shared(size_t __n)
+{
+    return std::__allocate_shared_unbounded_array<_Tp>(allocator<_Tp>(), __n);
+}
+
+template<class _Tp, class = __enable_if_t<is_unbounded_array<_Tp>::value>>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> make_shared(size_t __n, const remove_extent_t<_Tp>& __u)
+{
+    return std::__allocate_shared_unbounded_array<_Tp>(allocator<_Tp>(), __n, __u);
+}
+
+template<class _Tp, __enable_if_t<is_unbounded_array<_Tp>::value, int> = 0>
+_LIBCPP_HIDE_FROM_ABI
+shared_ptr<_Tp> make_shared_for_overwrite(size_t __n)
+{
+    return std::__allocate_shared_unbounded_array<_Tp>(allocator<_Tp>(), __n, __default_initialize_tag{});
+}
+
+#endif // _LIBCPP_STD_VER > 17
+
+template<class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const shared_ptr<_Tp>& __x, const shared_ptr<_Up>& __y) _NOEXCEPT
+{
+    return __x.get() == __y.get();
+}
+
+#if _LIBCPP_STD_VER <= 17
+
+template<class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const shared_ptr<_Tp>& __x, const shared_ptr<_Up>& __y) _NOEXCEPT
+{
+    return !(__x == __y);
+}
+
+template<class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<(const shared_ptr<_Tp>& __x, const shared_ptr<_Up>& __y) _NOEXCEPT
+{
+#if _LIBCPP_STD_VER <= 11
+    typedef typename common_type<_Tp*, _Up*>::type _Vp;
+    return less<_Vp>()(__x.get(), __y.get());
+#else
+    return less<>()(__x.get(), __y.get());
+#endif
+
+}
+
+template<class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>(const shared_ptr<_Tp>& __x, const shared_ptr<_Up>& __y) _NOEXCEPT
+{
+    return __y < __x;
+}
+
+template<class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const shared_ptr<_Tp>& __x, const shared_ptr<_Up>& __y) _NOEXCEPT
+{
+    return !(__y < __x);
+}
+
+template<class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const shared_ptr<_Tp>& __x, const shared_ptr<_Up>& __y) _NOEXCEPT
+{
+    return !(__x < __y);
+}
+
+#endif // _LIBCPP_STD_VER <= 17
+
+#if _LIBCPP_STD_VER > 17
+template<class _Tp, class _Up>
+_LIBCPP_HIDE_FROM_ABI strong_ordering
+operator<=>(shared_ptr<_Tp> const& __x, shared_ptr<_Up> const& __y) noexcept
+{
+    return compare_three_way()(__x.get(), __y.get());
+}
+#endif
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const shared_ptr<_Tp>& __x, nullptr_t) _NOEXCEPT
+{
+    return !__x;
+}
+
+#if _LIBCPP_STD_VER <= 17
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(nullptr_t, const shared_ptr<_Tp>& __x) _NOEXCEPT
+{
+    return !__x;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const shared_ptr<_Tp>& __x, nullptr_t) _NOEXCEPT
+{
+    return static_cast<bool>(__x);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(nullptr_t, const shared_ptr<_Tp>& __x) _NOEXCEPT
+{
+    return static_cast<bool>(__x);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<(const shared_ptr<_Tp>& __x, nullptr_t) _NOEXCEPT
+{
+    return less<_Tp*>()(__x.get(), nullptr);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<(nullptr_t, const shared_ptr<_Tp>& __x) _NOEXCEPT
+{
+    return less<_Tp*>()(nullptr, __x.get());
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>(const shared_ptr<_Tp>& __x, nullptr_t) _NOEXCEPT
+{
+    return nullptr < __x;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>(nullptr_t, const shared_ptr<_Tp>& __x) _NOEXCEPT
+{
+    return __x < nullptr;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const shared_ptr<_Tp>& __x, nullptr_t) _NOEXCEPT
+{
+    return !(nullptr < __x);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(nullptr_t, const shared_ptr<_Tp>& __x) _NOEXCEPT
+{
+    return !(__x < nullptr);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const shared_ptr<_Tp>& __x, nullptr_t) _NOEXCEPT
+{
+    return !(__x < nullptr);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(nullptr_t, const shared_ptr<_Tp>& __x) _NOEXCEPT
+{
+    return !(nullptr < __x);
+}
+
+#endif // _LIBCPP_STD_VER <= 17
+
+#if _LIBCPP_STD_VER > 17
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI strong_ordering
+operator<=>(shared_ptr<_Tp> const& __x, nullptr_t) noexcept
+{
+    return compare_three_way()(__x.get(), static_cast<typename shared_ptr<_Tp>::element_type*>(nullptr));
+}
+#endif
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(shared_ptr<_Tp>& __x, shared_ptr<_Tp>& __y) _NOEXCEPT
+{
+    __x.swap(__y);
+}
+
+template<class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY
+shared_ptr<_Tp>
+static_pointer_cast(const shared_ptr<_Up>& __r) _NOEXCEPT
+{
+    return shared_ptr<_Tp>(__r,
+                           static_cast<
+                               typename shared_ptr<_Tp>::element_type*>(__r.get()));
+}
+
+template<class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY
+shared_ptr<_Tp>
+dynamic_pointer_cast(const shared_ptr<_Up>& __r) _NOEXCEPT
+{
+    typedef typename shared_ptr<_Tp>::element_type _ET;
+    _ET* __p = dynamic_cast<_ET*>(__r.get());
+    return __p ? shared_ptr<_Tp>(__r, __p) : shared_ptr<_Tp>();
+}
+
+template<class _Tp, class _Up>
+_LIBCPP_HIDE_FROM_ABI shared_ptr<_Tp>
+const_pointer_cast(const shared_ptr<_Up>& __r) _NOEXCEPT
+{
+    typedef typename shared_ptr<_Tp>::element_type _RTp;
+    return shared_ptr<_Tp>(__r, const_cast<_RTp*>(__r.get()));
+}
+
+template<class _Tp, class _Up>
+_LIBCPP_HIDE_FROM_ABI shared_ptr<_Tp>
+reinterpret_pointer_cast(const shared_ptr<_Up>& __r) _NOEXCEPT
+{
+    return shared_ptr<_Tp>(__r,
+                           reinterpret_cast<
+                               typename shared_ptr<_Tp>::element_type*>(__r.get()));
+}
+
+#ifndef _LIBCPP_NO_RTTI
+
+template<class _Dp, class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+_Dp*
+get_deleter(const shared_ptr<_Tp>& __p) _NOEXCEPT
+{
+    return __p.template __get_deleter<_Dp>();
+}
+
+#endif // _LIBCPP_NO_RTTI
+
+template<class _Tp>
+class _LIBCPP_SHARED_PTR_TRIVIAL_ABI _LIBCPP_TEMPLATE_VIS weak_ptr
+{
+public:
+#if _LIBCPP_STD_VER > 14
+    typedef remove_extent_t<_Tp> element_type;
+#else
+    typedef _Tp element_type;
+#endif
+
+private:
+    element_type*        __ptr_;
+    __shared_weak_count* __cntrl_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR weak_ptr() _NOEXCEPT;
+    template<class _Yp> _LIBCPP_INLINE_VISIBILITY weak_ptr(shared_ptr<_Yp> const& __r,
+                   typename enable_if<__compatible_with<_Yp, _Tp>::value, __nat*>::type = 0)
+                        _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    weak_ptr(weak_ptr const& __r) _NOEXCEPT;
+    template<class _Yp> _LIBCPP_INLINE_VISIBILITY weak_ptr(weak_ptr<_Yp> const& __r,
+                   typename enable_if<__compatible_with<_Yp, _Tp>::value, __nat*>::type = 0)
+                         _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    weak_ptr(weak_ptr&& __r) _NOEXCEPT;
+    template<class _Yp> _LIBCPP_INLINE_VISIBILITY weak_ptr(weak_ptr<_Yp>&& __r,
+                   typename enable_if<__compatible_with<_Yp, _Tp>::value, __nat*>::type = 0)
+                         _NOEXCEPT;
+    ~weak_ptr();
+
+    _LIBCPP_INLINE_VISIBILITY
+    weak_ptr& operator=(weak_ptr const& __r) _NOEXCEPT;
+    template<class _Yp>
+        typename enable_if
+        <
+            __compatible_with<_Yp, _Tp>::value,
+            weak_ptr&
+        >::type
+        _LIBCPP_INLINE_VISIBILITY
+        operator=(weak_ptr<_Yp> const& __r) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    weak_ptr& operator=(weak_ptr&& __r) _NOEXCEPT;
+    template<class _Yp>
+        typename enable_if
+        <
+            __compatible_with<_Yp, _Tp>::value,
+            weak_ptr&
+        >::type
+        _LIBCPP_INLINE_VISIBILITY
+        operator=(weak_ptr<_Yp>&& __r) _NOEXCEPT;
+
+    template<class _Yp>
+        typename enable_if
+        <
+            __compatible_with<_Yp, _Tp>::value,
+            weak_ptr&
+        >::type
+        _LIBCPP_INLINE_VISIBILITY
+        operator=(shared_ptr<_Yp> const& __r) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(weak_ptr& __r) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    long use_count() const _NOEXCEPT
+        {return __cntrl_ ? __cntrl_->use_count() : 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    bool expired() const _NOEXCEPT
+        {return __cntrl_ == nullptr || __cntrl_->use_count() == 0;}
+    shared_ptr<_Tp> lock() const _NOEXCEPT;
+    template<class _Up>
+        _LIBCPP_INLINE_VISIBILITY
+        bool owner_before(const shared_ptr<_Up>& __r) const _NOEXCEPT
+        {return __cntrl_ < __r.__cntrl_;}
+    template<class _Up>
+        _LIBCPP_INLINE_VISIBILITY
+        bool owner_before(const weak_ptr<_Up>& __r) const _NOEXCEPT
+        {return __cntrl_ < __r.__cntrl_;}
+
+    template <class _Up> friend class _LIBCPP_TEMPLATE_VIS weak_ptr;
+    template <class _Up> friend class _LIBCPP_TEMPLATE_VIS shared_ptr;
+};
+
+#if _LIBCPP_STD_VER > 14
+template<class _Tp>
+weak_ptr(shared_ptr<_Tp>) -> weak_ptr<_Tp>;
+#endif
+
+template<class _Tp>
+inline
+_LIBCPP_CONSTEXPR
+weak_ptr<_Tp>::weak_ptr() _NOEXCEPT
+    : __ptr_(nullptr),
+      __cntrl_(nullptr)
+{
+}
+
+template<class _Tp>
+inline
+weak_ptr<_Tp>::weak_ptr(weak_ptr const& __r) _NOEXCEPT
+    : __ptr_(__r.__ptr_),
+      __cntrl_(__r.__cntrl_)
+{
+    if (__cntrl_)
+        __cntrl_->__add_weak();
+}
+
+template<class _Tp>
+template<class _Yp>
+inline
+weak_ptr<_Tp>::weak_ptr(shared_ptr<_Yp> const& __r,
+                        typename enable_if<__compatible_with<_Yp, _Tp>::value, __nat*>::type)
+                         _NOEXCEPT
+    : __ptr_(__r.__ptr_),
+      __cntrl_(__r.__cntrl_)
+{
+    if (__cntrl_)
+        __cntrl_->__add_weak();
+}
+
+template<class _Tp>
+template<class _Yp>
+inline
+weak_ptr<_Tp>::weak_ptr(weak_ptr<_Yp> const& __r,
+                        typename enable_if<__compatible_with<_Yp, _Tp>::value, __nat*>::type)
+         _NOEXCEPT
+    : __ptr_(__r.__ptr_),
+      __cntrl_(__r.__cntrl_)
+{
+    if (__cntrl_)
+        __cntrl_->__add_weak();
+}
+
+template<class _Tp>
+inline
+weak_ptr<_Tp>::weak_ptr(weak_ptr&& __r) _NOEXCEPT
+    : __ptr_(__r.__ptr_),
+      __cntrl_(__r.__cntrl_)
+{
+    __r.__ptr_ = nullptr;
+    __r.__cntrl_ = nullptr;
+}
+
+template<class _Tp>
+template<class _Yp>
+inline
+weak_ptr<_Tp>::weak_ptr(weak_ptr<_Yp>&& __r,
+                        typename enable_if<__compatible_with<_Yp, _Tp>::value, __nat*>::type)
+         _NOEXCEPT
+    : __ptr_(__r.__ptr_),
+      __cntrl_(__r.__cntrl_)
+{
+    __r.__ptr_ = nullptr;
+    __r.__cntrl_ = nullptr;
+}
+
+template<class _Tp>
+weak_ptr<_Tp>::~weak_ptr()
+{
+    if (__cntrl_)
+        __cntrl_->__release_weak();
+}
+
+template<class _Tp>
+inline
+weak_ptr<_Tp>&
+weak_ptr<_Tp>::operator=(weak_ptr const& __r) _NOEXCEPT
+{
+    weak_ptr(__r).swap(*this);
+    return *this;
+}
+
+template<class _Tp>
+template<class _Yp>
+inline
+typename enable_if
+<
+    __compatible_with<_Yp, _Tp>::value,
+    weak_ptr<_Tp>&
+>::type
+weak_ptr<_Tp>::operator=(weak_ptr<_Yp> const& __r) _NOEXCEPT
+{
+    weak_ptr(__r).swap(*this);
+    return *this;
+}
+
+template<class _Tp>
+inline
+weak_ptr<_Tp>&
+weak_ptr<_Tp>::operator=(weak_ptr&& __r) _NOEXCEPT
+{
+    weak_ptr(_VSTD::move(__r)).swap(*this);
+    return *this;
+}
+
+template<class _Tp>
+template<class _Yp>
+inline
+typename enable_if
+<
+    __compatible_with<_Yp, _Tp>::value,
+    weak_ptr<_Tp>&
+>::type
+weak_ptr<_Tp>::operator=(weak_ptr<_Yp>&& __r) _NOEXCEPT
+{
+    weak_ptr(_VSTD::move(__r)).swap(*this);
+    return *this;
+}
+
+template<class _Tp>
+template<class _Yp>
+inline
+typename enable_if
+<
+    __compatible_with<_Yp, _Tp>::value,
+    weak_ptr<_Tp>&
+>::type
+weak_ptr<_Tp>::operator=(shared_ptr<_Yp> const& __r) _NOEXCEPT
+{
+    weak_ptr(__r).swap(*this);
+    return *this;
+}
+
+template<class _Tp>
+inline
+void
+weak_ptr<_Tp>::swap(weak_ptr& __r) _NOEXCEPT
+{
+    _VSTD::swap(__ptr_, __r.__ptr_);
+    _VSTD::swap(__cntrl_, __r.__cntrl_);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(weak_ptr<_Tp>& __x, weak_ptr<_Tp>& __y) _NOEXCEPT
+{
+    __x.swap(__y);
+}
+
+template<class _Tp>
+inline
+void
+weak_ptr<_Tp>::reset() _NOEXCEPT
+{
+    weak_ptr().swap(*this);
+}
+
+template<class _Tp>
+shared_ptr<_Tp>
+weak_ptr<_Tp>::lock() const _NOEXCEPT
+{
+    shared_ptr<_Tp> __r;
+    __r.__cntrl_ = __cntrl_ ? __cntrl_->lock() : __cntrl_;
+    if (__r.__cntrl_)
+        __r.__ptr_ = __ptr_;
+    return __r;
+}
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp = void> struct owner_less;
+#else
+template <class _Tp> struct owner_less;
+#endif
+
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS owner_less<shared_ptr<_Tp> >
+    : __binary_function<shared_ptr<_Tp>, shared_ptr<_Tp>, bool>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(shared_ptr<_Tp> const& __x, shared_ptr<_Tp> const& __y) const _NOEXCEPT
+        {return __x.owner_before(__y);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(shared_ptr<_Tp> const& __x,   weak_ptr<_Tp> const& __y) const _NOEXCEPT
+        {return __x.owner_before(__y);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(  weak_ptr<_Tp> const& __x, shared_ptr<_Tp> const& __y) const _NOEXCEPT
+        {return __x.owner_before(__y);}
+};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS owner_less<weak_ptr<_Tp> >
+    : __binary_function<weak_ptr<_Tp>, weak_ptr<_Tp>, bool>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(  weak_ptr<_Tp> const& __x,   weak_ptr<_Tp> const& __y) const _NOEXCEPT
+        {return __x.owner_before(__y);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(shared_ptr<_Tp> const& __x,   weak_ptr<_Tp> const& __y) const _NOEXCEPT
+        {return __x.owner_before(__y);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(  weak_ptr<_Tp> const& __x, shared_ptr<_Tp> const& __y) const _NOEXCEPT
+        {return __x.owner_before(__y);}
+};
+
+#if _LIBCPP_STD_VER > 14
+template <>
+struct _LIBCPP_TEMPLATE_VIS owner_less<void>
+{
+    template <class _Tp, class _Up>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()( shared_ptr<_Tp> const& __x, shared_ptr<_Up> const& __y) const _NOEXCEPT
+        {return __x.owner_before(__y);}
+    template <class _Tp, class _Up>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()( shared_ptr<_Tp> const& __x,   weak_ptr<_Up> const& __y) const _NOEXCEPT
+        {return __x.owner_before(__y);}
+    template <class _Tp, class _Up>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(   weak_ptr<_Tp> const& __x, shared_ptr<_Up> const& __y) const _NOEXCEPT
+        {return __x.owner_before(__y);}
+    template <class _Tp, class _Up>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(   weak_ptr<_Tp> const& __x,   weak_ptr<_Up> const& __y) const _NOEXCEPT
+        {return __x.owner_before(__y);}
+    typedef void is_transparent;
+};
+#endif
+
+template<class _Tp>
+class _LIBCPP_TEMPLATE_VIS enable_shared_from_this
+{
+    mutable weak_ptr<_Tp> __weak_this_;
+protected:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    enable_shared_from_this() _NOEXCEPT {}
+    _LIBCPP_INLINE_VISIBILITY
+    enable_shared_from_this(enable_shared_from_this const&) _NOEXCEPT {}
+    _LIBCPP_INLINE_VISIBILITY
+    enable_shared_from_this& operator=(enable_shared_from_this const&) _NOEXCEPT
+        {return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    ~enable_shared_from_this() {}
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    shared_ptr<_Tp> shared_from_this()
+        {return shared_ptr<_Tp>(__weak_this_);}
+    _LIBCPP_INLINE_VISIBILITY
+    shared_ptr<_Tp const> shared_from_this() const
+        {return shared_ptr<const _Tp>(__weak_this_);}
+
+#if _LIBCPP_STD_VER > 14
+    _LIBCPP_INLINE_VISIBILITY
+    weak_ptr<_Tp> weak_from_this() _NOEXCEPT
+       { return __weak_this_; }
+
+    _LIBCPP_INLINE_VISIBILITY
+    weak_ptr<const _Tp> weak_from_this() const _NOEXCEPT
+        { return __weak_this_; }
+#endif // _LIBCPP_STD_VER > 14
+
+    template <class _Up> friend class shared_ptr;
+};
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS hash;
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS hash<shared_ptr<_Tp> >
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef shared_ptr<_Tp> argument_type;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef size_t          result_type;
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const shared_ptr<_Tp>& __ptr) const _NOEXCEPT
+    {
+        return hash<typename shared_ptr<_Tp>::element_type*>()(__ptr.get());
+    }
+};
+
+template<class _CharT, class _Traits, class _Yp>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, shared_ptr<_Yp> const& __p);
+
+
+#if !defined(_LIBCPP_HAS_NO_THREADS)
+
+class _LIBCPP_TYPE_VIS __sp_mut
+{
+    void* __lx_;
+public:
+    void lock() _NOEXCEPT;
+    void unlock() _NOEXCEPT;
+
+private:
+    _LIBCPP_CONSTEXPR __sp_mut(void*) _NOEXCEPT;
+    __sp_mut(const __sp_mut&);
+    __sp_mut& operator=(const __sp_mut&);
+
+    friend _LIBCPP_FUNC_VIS __sp_mut& __get_sp_mut(const void*);
+};
+
+_LIBCPP_FUNC_VIS _LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR
+__sp_mut& __get_sp_mut(const void*);
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+atomic_is_lock_free(const shared_ptr<_Tp>*)
+{
+    return false;
+}
+
+template <class _Tp>
+_LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR
+_LIBCPP_HIDE_FROM_ABI shared_ptr<_Tp>
+atomic_load(const shared_ptr<_Tp>* __p)
+{
+    __sp_mut& __m = std::__get_sp_mut(__p);
+    __m.lock();
+    shared_ptr<_Tp> __q = *__p;
+    __m.unlock();
+    return __q;
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR
+shared_ptr<_Tp>
+atomic_load_explicit(const shared_ptr<_Tp>* __p, memory_order)
+{
+    return std::atomic_load(__p);
+}
+
+template <class _Tp>
+_LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR
+_LIBCPP_HIDE_FROM_ABI void
+atomic_store(shared_ptr<_Tp>* __p, shared_ptr<_Tp> __r)
+{
+    __sp_mut& __m = std::__get_sp_mut(__p);
+    __m.lock();
+    __p->swap(__r);
+    __m.unlock();
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR
+void
+atomic_store_explicit(shared_ptr<_Tp>* __p, shared_ptr<_Tp> __r, memory_order)
+{
+    std::atomic_store(__p, __r);
+}
+
+template <class _Tp>
+_LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR
+_LIBCPP_HIDE_FROM_ABI shared_ptr<_Tp>
+atomic_exchange(shared_ptr<_Tp>* __p, shared_ptr<_Tp> __r)
+{
+    __sp_mut& __m = std::__get_sp_mut(__p);
+    __m.lock();
+    __p->swap(__r);
+    __m.unlock();
+    return __r;
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR
+shared_ptr<_Tp>
+atomic_exchange_explicit(shared_ptr<_Tp>* __p, shared_ptr<_Tp> __r, memory_order)
+{
+    return std::atomic_exchange(__p, __r);
+}
+
+template <class _Tp>
+_LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR
+_LIBCPP_HIDE_FROM_ABI bool
+atomic_compare_exchange_strong(shared_ptr<_Tp>* __p, shared_ptr<_Tp>* __v, shared_ptr<_Tp> __w)
+{
+    shared_ptr<_Tp> __temp;
+    __sp_mut& __m = std::__get_sp_mut(__p);
+    __m.lock();
+    if (__p->__owner_equivalent(*__v))
+    {
+        _VSTD::swap(__temp, *__p);
+        *__p = __w;
+        __m.unlock();
+        return true;
+    }
+    _VSTD::swap(__temp, *__v);
+    *__v = *__p;
+    __m.unlock();
+    return false;
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR
+bool
+atomic_compare_exchange_weak(shared_ptr<_Tp>* __p, shared_ptr<_Tp>* __v, shared_ptr<_Tp> __w)
+{
+    return std::atomic_compare_exchange_strong(__p, __v, __w);
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR
+bool
+atomic_compare_exchange_strong_explicit(shared_ptr<_Tp>* __p, shared_ptr<_Tp>* __v,
+                                        shared_ptr<_Tp> __w, memory_order, memory_order)
+{
+    return std::atomic_compare_exchange_strong(__p, __v, __w);
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_AVAILABILITY_ATOMIC_SHARED_PTR
+bool
+atomic_compare_exchange_weak_explicit(shared_ptr<_Tp>* __p, shared_ptr<_Tp>* __v,
+                                      shared_ptr<_Tp> __w, memory_order, memory_order)
+{
+    return std::atomic_compare_exchange_weak(__p, __v, __w);
+}
+
+#endif // !defined(_LIBCPP_HAS_NO_THREADS)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_SHARED_PTR_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/swap_allocator.h b/app/src/main/cpp/libcxx/include/__memory/swap_allocator.h
new file mode 100644
index 0000000..c6e1751
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/swap_allocator.h
@@ -0,0 +1,54 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_SWAP_ALLOCATOR_H
+#define _LIBCPP___MEMORY_SWAP_ALLOCATOR_H
+
+#include <__config>
+#include <__memory/allocator_traits.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_swappable.h>
+#include <__utility/swap.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <typename _Alloc>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 void __swap_allocator(_Alloc& __a1, _Alloc& __a2, true_type)
+#if _LIBCPP_STD_VER > 11
+    _NOEXCEPT
+#else
+    _NOEXCEPT_(__is_nothrow_swappable<_Alloc>::value)
+#endif
+{
+  using _VSTD::swap;
+  swap(__a1, __a2);
+}
+
+template <typename _Alloc>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 void
+__swap_allocator(_Alloc&, _Alloc&, false_type) _NOEXCEPT {}
+
+template <typename _Alloc>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 void __swap_allocator(_Alloc& __a1, _Alloc& __a2)
+#if _LIBCPP_STD_VER > 11
+    _NOEXCEPT
+#else
+    _NOEXCEPT_(__is_nothrow_swappable<_Alloc>::value)
+#endif
+{
+  _VSTD::__swap_allocator(
+      __a1, __a2, integral_constant<bool, allocator_traits<_Alloc>::propagate_on_container_swap::value>());
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_SWAP_ALLOCATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/temp_value.h b/app/src/main/cpp/libcxx/include/__memory/temp_value.h
new file mode 100644
index 0000000..164688b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/temp_value.h
@@ -0,0 +1,56 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_TEMP_VALUE_H
+#define _LIBCPP___MEMORY_TEMP_VALUE_H
+
+#include <__config>
+#include <__memory/addressof.h>
+#include <__memory/allocator_traits.h>
+#include <__type_traits/aligned_storage.h>
+#include <__utility/forward.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _Alloc>
+struct __temp_value {
+    typedef allocator_traits<_Alloc> _Traits;
+
+#ifdef _LIBCPP_CXX03_LANG
+    typename aligned_storage<sizeof(_Tp), _LIBCPP_ALIGNOF(_Tp)>::type __v;
+#else
+    union { _Tp __v; };
+#endif
+    _Alloc &__a;
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp *__addr() {
+#ifdef _LIBCPP_CXX03_LANG
+        return reinterpret_cast<_Tp*>(std::addressof(__v));
+#else
+        return std::addressof(__v);
+#endif
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp &   get() { return *__addr(); }
+
+    template<class... _Args>
+    _LIBCPP_NO_CFI
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 __temp_value(_Alloc &__alloc, _Args&& ... __args) : __a(__alloc) {
+      _Traits::construct(__a, __addr(), std::forward<_Args>(__args)...);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 ~__temp_value() { _Traits::destroy(__a, __addr()); }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_TEMP_VALUE_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/temporary_buffer.h b/app/src/main/cpp/libcxx/include/__memory/temporary_buffer.h
new file mode 100644
index 0000000..c917f04
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/temporary_buffer.h
@@ -0,0 +1,87 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_TEMPORARY_BUFFER_H
+#define _LIBCPP___MEMORY_TEMPORARY_BUFFER_H
+
+#include <__config>
+#include <__type_traits/alignment_of.h>
+#include <__utility/pair.h>
+#include <cstddef>
+#include <new>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_NO_CFI _LIBCPP_DEPRECATED_IN_CXX17
+pair<_Tp*, ptrdiff_t>
+get_temporary_buffer(ptrdiff_t __n) _NOEXCEPT
+{
+    pair<_Tp*, ptrdiff_t> __r(0, 0);
+    const ptrdiff_t __m = (~ptrdiff_t(0) ^
+                           ptrdiff_t(ptrdiff_t(1) << (sizeof(ptrdiff_t) * __CHAR_BIT__ - 1)))
+                           / sizeof(_Tp);
+    if (__n > __m)
+        __n = __m;
+    while (__n > 0)
+    {
+#if !defined(_LIBCPP_HAS_NO_ALIGNED_ALLOCATION)
+    if (__is_overaligned_for_new(_LIBCPP_ALIGNOF(_Tp)))
+        {
+            align_val_t __al =
+                align_val_t(alignment_of<_Tp>::value);
+            __r.first = static_cast<_Tp*>(::operator new(
+                __n * sizeof(_Tp), __al, nothrow));
+        } else {
+            __r.first = static_cast<_Tp*>(::operator new(
+                __n * sizeof(_Tp), nothrow));
+        }
+#else
+    if (__is_overaligned_for_new(_LIBCPP_ALIGNOF(_Tp)))
+        {
+            // Since aligned operator new is unavailable, return an empty
+            // buffer rather than one with invalid alignment.
+            return __r;
+        }
+
+        __r.first = static_cast<_Tp*>(::operator new(__n * sizeof(_Tp), nothrow));
+#endif
+
+        if (__r.first)
+        {
+            __r.second = __n;
+            break;
+        }
+        __n /= 2;
+    }
+    return __r;
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_DEPRECATED_IN_CXX17
+void return_temporary_buffer(_Tp* __p) _NOEXCEPT
+{
+  _VSTD::__libcpp_deallocate_unsized((void*)__p, _LIBCPP_ALIGNOF(_Tp));
+}
+
+struct __return_temporary_buffer
+{
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    template <class _Tp>
+    _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_TEMPORARY_BUFFER_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/uninitialized_algorithms.h b/app/src/main/cpp/libcxx/include/__memory/uninitialized_algorithms.h
new file mode 100644
index 0000000..63a45b2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/uninitialized_algorithms.h
@@ -0,0 +1,646 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_UNINITIALIZED_ALGORITHMS_H
+#define _LIBCPP___MEMORY_UNINITIALIZED_ALGORITHMS_H
+
+#include <__algorithm/copy.h>
+#include <__algorithm/move.h>
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/reverse_iterator.h>
+#include <__memory/addressof.h>
+#include <__memory/allocator_traits.h>
+#include <__memory/construct_at.h>
+#include <__memory/pointer_traits.h>
+#include <__memory/voidify.h>
+#include <__type_traits/extent.h>
+#include <__type_traits/is_array.h>
+#include <__type_traits/is_constant_evaluated.h>
+#include <__type_traits/is_trivially_copy_assignable.h>
+#include <__type_traits/is_trivially_copy_constructible.h>
+#include <__type_traits/is_trivially_move_assignable.h>
+#include <__type_traits/is_trivially_move_constructible.h>
+#include <__type_traits/is_unbounded_array.h>
+#include <__type_traits/negation.h>
+#include <__type_traits/remove_const.h>
+#include <__type_traits/remove_extent.h>
+#include <__utility/exception_guard.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <new>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// This is a simplified version of C++20 `unreachable_sentinel` that doesn't use concepts and thus can be used in any
+// language mode.
+struct __unreachable_sentinel {
+  template <class _Iter>
+  _LIBCPP_HIDE_FROM_ABI friend _LIBCPP_CONSTEXPR bool operator!=(const _Iter&, __unreachable_sentinel) _NOEXCEPT {
+    return true;
+  }
+};
+
+// uninitialized_copy
+
+template <class _ValueType, class _InputIterator, class _Sentinel1, class _ForwardIterator, class _Sentinel2>
+inline _LIBCPP_HIDE_FROM_ABI pair<_InputIterator, _ForwardIterator>
+__uninitialized_copy(_InputIterator __ifirst, _Sentinel1 __ilast,
+                     _ForwardIterator __ofirst, _Sentinel2 __olast) {
+  _ForwardIterator __idx = __ofirst;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+  try {
+#endif
+    for (; __ifirst != __ilast && __idx != __olast; ++__ifirst, (void)++__idx)
+      ::new (_VSTD::__voidify(*__idx)) _ValueType(*__ifirst);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+  } catch (...) {
+    _VSTD::__destroy(__ofirst, __idx);
+    throw;
+  }
+#endif
+
+  return pair<_InputIterator, _ForwardIterator>(_VSTD::move(__ifirst), _VSTD::move(__idx));
+}
+
+template <class _InputIterator, class _ForwardIterator>
+_LIBCPP_HIDE_FROM_ABI
+_ForwardIterator uninitialized_copy(_InputIterator __ifirst, _InputIterator __ilast,
+                                    _ForwardIterator __ofirst) {
+  typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
+  auto __result = _VSTD::__uninitialized_copy<_ValueType>(_VSTD::move(__ifirst), _VSTD::move(__ilast),
+                                                          _VSTD::move(__ofirst), __unreachable_sentinel());
+  return _VSTD::move(__result.second);
+}
+
+// uninitialized_copy_n
+
+template <class _ValueType, class _InputIterator, class _Size, class _ForwardIterator, class _Sentinel>
+inline _LIBCPP_HIDE_FROM_ABI pair<_InputIterator, _ForwardIterator>
+__uninitialized_copy_n(_InputIterator __ifirst, _Size __n,
+                       _ForwardIterator __ofirst, _Sentinel __olast) {
+  _ForwardIterator __idx = __ofirst;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+  try {
+#endif
+    for (; __n > 0 && __idx != __olast; ++__ifirst, (void)++__idx, (void)--__n)
+      ::new (_VSTD::__voidify(*__idx)) _ValueType(*__ifirst);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+  } catch (...) {
+    _VSTD::__destroy(__ofirst, __idx);
+    throw;
+  }
+#endif
+
+  return pair<_InputIterator, _ForwardIterator>(_VSTD::move(__ifirst), _VSTD::move(__idx));
+}
+
+template <class _InputIterator, class _Size, class _ForwardIterator>
+inline _LIBCPP_HIDE_FROM_ABI _ForwardIterator uninitialized_copy_n(_InputIterator __ifirst, _Size __n,
+                                                                   _ForwardIterator __ofirst) {
+  typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
+  auto __result = _VSTD::__uninitialized_copy_n<_ValueType>(_VSTD::move(__ifirst), __n, _VSTD::move(__ofirst),
+                                                            __unreachable_sentinel());
+  return _VSTD::move(__result.second);
+}
+
+// uninitialized_fill
+
+template <class _ValueType, class _ForwardIterator, class _Sentinel, class _Tp>
+inline _LIBCPP_HIDE_FROM_ABI
+_ForwardIterator __uninitialized_fill(_ForwardIterator __first, _Sentinel __last, const _Tp& __x)
+{
+    _ForwardIterator __idx = __first;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif
+        for (; __idx != __last; ++__idx)
+            ::new (_VSTD::__voidify(*__idx)) _ValueType(__x);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        _VSTD::__destroy(__first, __idx);
+        throw;
+    }
+#endif
+
+    return __idx;
+}
+
+template <class _ForwardIterator, class _Tp>
+inline _LIBCPP_HIDE_FROM_ABI
+void uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x)
+{
+    typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
+    (void)_VSTD::__uninitialized_fill<_ValueType>(__first, __last, __x);
+}
+
+// uninitialized_fill_n
+
+template <class _ValueType, class _ForwardIterator, class _Size, class _Tp>
+inline _LIBCPP_HIDE_FROM_ABI
+_ForwardIterator __uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x)
+{
+    _ForwardIterator __idx = __first;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif
+        for (; __n > 0; ++__idx, (void) --__n)
+            ::new (_VSTD::__voidify(*__idx)) _ValueType(__x);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        _VSTD::__destroy(__first, __idx);
+        throw;
+    }
+#endif
+
+    return __idx;
+}
+
+template <class _ForwardIterator, class _Size, class _Tp>
+inline _LIBCPP_HIDE_FROM_ABI
+_ForwardIterator uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x)
+{
+    typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
+    return _VSTD::__uninitialized_fill_n<_ValueType>(__first, __n, __x);
+}
+
+#if _LIBCPP_STD_VER > 14
+
+// uninitialized_default_construct
+
+template <class _ValueType, class _ForwardIterator, class _Sentinel>
+inline _LIBCPP_HIDE_FROM_ABI
+_ForwardIterator __uninitialized_default_construct(_ForwardIterator __first, _Sentinel __last) {
+    auto __idx = __first;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try {
+#endif
+    for (; __idx != __last; ++__idx)
+        ::new (_VSTD::__voidify(*__idx)) _ValueType;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    } catch (...) {
+        _VSTD::__destroy(__first, __idx);
+        throw;
+    }
+#endif
+
+    return __idx;
+}
+
+template <class _ForwardIterator>
+inline _LIBCPP_HIDE_FROM_ABI
+void uninitialized_default_construct(_ForwardIterator __first, _ForwardIterator __last) {
+    using _ValueType = typename iterator_traits<_ForwardIterator>::value_type;
+    (void)_VSTD::__uninitialized_default_construct<_ValueType>(
+        _VSTD::move(__first), _VSTD::move(__last));
+}
+
+// uninitialized_default_construct_n
+
+template <class _ValueType, class _ForwardIterator, class _Size>
+inline _LIBCPP_HIDE_FROM_ABI
+_ForwardIterator __uninitialized_default_construct_n(_ForwardIterator __first, _Size __n) {
+    auto __idx = __first;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try {
+#endif
+    for (; __n > 0; ++__idx, (void) --__n)
+        ::new (_VSTD::__voidify(*__idx)) _ValueType;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    } catch (...) {
+        _VSTD::__destroy(__first, __idx);
+        throw;
+    }
+#endif
+
+    return __idx;
+}
+
+template <class _ForwardIterator, class _Size>
+inline _LIBCPP_HIDE_FROM_ABI
+_ForwardIterator uninitialized_default_construct_n(_ForwardIterator __first, _Size __n) {
+    using _ValueType = typename iterator_traits<_ForwardIterator>::value_type;
+    return _VSTD::__uninitialized_default_construct_n<_ValueType>(_VSTD::move(__first), __n);
+}
+
+// uninitialized_value_construct
+
+template <class _ValueType, class _ForwardIterator, class _Sentinel>
+inline _LIBCPP_HIDE_FROM_ABI
+_ForwardIterator __uninitialized_value_construct(_ForwardIterator __first, _Sentinel __last) {
+    auto __idx = __first;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try {
+#endif
+    for (; __idx != __last; ++__idx)
+        ::new (_VSTD::__voidify(*__idx)) _ValueType();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    } catch (...) {
+        _VSTD::__destroy(__first, __idx);
+        throw;
+    }
+#endif
+
+    return __idx;
+}
+
+template <class _ForwardIterator>
+inline _LIBCPP_HIDE_FROM_ABI
+void uninitialized_value_construct(_ForwardIterator __first, _ForwardIterator __last) {
+    using _ValueType = typename iterator_traits<_ForwardIterator>::value_type;
+    (void)_VSTD::__uninitialized_value_construct<_ValueType>(
+        _VSTD::move(__first), _VSTD::move(__last));
+}
+
+// uninitialized_value_construct_n
+
+template <class _ValueType, class _ForwardIterator, class _Size>
+inline _LIBCPP_HIDE_FROM_ABI
+_ForwardIterator __uninitialized_value_construct_n(_ForwardIterator __first, _Size __n) {
+    auto __idx = __first;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try {
+#endif
+    for (; __n > 0; ++__idx, (void) --__n)
+        ::new (_VSTD::__voidify(*__idx)) _ValueType();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    } catch (...) {
+        _VSTD::__destroy(__first, __idx);
+        throw;
+    }
+#endif
+
+    return __idx;
+}
+
+template <class _ForwardIterator, class _Size>
+inline _LIBCPP_HIDE_FROM_ABI
+_ForwardIterator uninitialized_value_construct_n(_ForwardIterator __first, _Size __n) {
+    using _ValueType = typename iterator_traits<_ForwardIterator>::value_type;
+    return std::__uninitialized_value_construct_n<_ValueType>(_VSTD::move(__first), __n);
+}
+
+// uninitialized_move
+
+template <class _ValueType, class _InputIterator, class _Sentinel1, class _ForwardIterator, class _Sentinel2,
+          class _IterMove>
+inline _LIBCPP_HIDE_FROM_ABI pair<_InputIterator, _ForwardIterator>
+__uninitialized_move(_InputIterator __ifirst, _Sentinel1 __ilast,
+                     _ForwardIterator __ofirst, _Sentinel2 __olast, _IterMove __iter_move) {
+  auto __idx = __ofirst;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+  try {
+#endif
+    for (; __ifirst != __ilast && __idx != __olast; ++__idx, (void)++__ifirst) {
+      ::new (_VSTD::__voidify(*__idx)) _ValueType(__iter_move(__ifirst));
+    }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+  } catch (...) {
+    _VSTD::__destroy(__ofirst, __idx);
+    throw;
+  }
+#endif
+
+  return {_VSTD::move(__ifirst), _VSTD::move(__idx)};
+}
+
+template <class _InputIterator, class _ForwardIterator>
+inline _LIBCPP_HIDE_FROM_ABI _ForwardIterator uninitialized_move(_InputIterator __ifirst, _InputIterator __ilast,
+                                                                 _ForwardIterator __ofirst) {
+  using _ValueType = typename iterator_traits<_ForwardIterator>::value_type;
+  auto __iter_move = [](auto&& __iter) -> decltype(auto) { return _VSTD::move(*__iter); };
+
+  auto __result = _VSTD::__uninitialized_move<_ValueType>(_VSTD::move(__ifirst), _VSTD::move(__ilast),
+                                                          _VSTD::move(__ofirst), __unreachable_sentinel(), __iter_move);
+  return _VSTD::move(__result.second);
+}
+
+// uninitialized_move_n
+
+template <class _ValueType, class _InputIterator, class _Size, class _ForwardIterator, class _Sentinel, class _IterMove>
+inline _LIBCPP_HIDE_FROM_ABI pair<_InputIterator, _ForwardIterator>
+__uninitialized_move_n(_InputIterator __ifirst, _Size __n,
+                       _ForwardIterator __ofirst, _Sentinel __olast, _IterMove __iter_move) {
+  auto __idx = __ofirst;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+  try {
+#endif
+    for (; __n > 0 && __idx != __olast; ++__idx, (void)++__ifirst, --__n)
+      ::new (_VSTD::__voidify(*__idx)) _ValueType(__iter_move(__ifirst));
+#ifndef _LIBCPP_NO_EXCEPTIONS
+  } catch (...) {
+    _VSTD::__destroy(__ofirst, __idx);
+    throw;
+  }
+#endif
+
+  return {_VSTD::move(__ifirst), _VSTD::move(__idx)};
+}
+
+template <class _InputIterator, class _Size, class _ForwardIterator>
+inline _LIBCPP_HIDE_FROM_ABI pair<_InputIterator, _ForwardIterator>
+uninitialized_move_n(_InputIterator __ifirst, _Size __n, _ForwardIterator __ofirst) {
+  using _ValueType = typename iterator_traits<_ForwardIterator>::value_type;
+  auto __iter_move = [](auto&& __iter) -> decltype(auto) { return _VSTD::move(*__iter); };
+
+  return _VSTD::__uninitialized_move_n<_ValueType>(_VSTD::move(__ifirst), __n, _VSTD::move(__ofirst),
+                                                   __unreachable_sentinel(), __iter_move);
+}
+
+// TODO: Rewrite this to iterate left to right and use reverse_iterators when calling
+// Destroys every element in the range [first, last) FROM RIGHT TO LEFT using allocator
+// destruction. If elements are themselves C-style arrays, they are recursively destroyed
+// in the same manner.
+//
+// This function assumes that destructors do not throw, and that the allocator is bound to
+// the correct type.
+template<class _Alloc, class _BidirIter, class = __enable_if_t<
+    __is_cpp17_bidirectional_iterator<_BidirIter>::value
+>>
+_LIBCPP_HIDE_FROM_ABI
+constexpr void __allocator_destroy_multidimensional(_Alloc& __alloc, _BidirIter __first, _BidirIter __last) noexcept {
+    using _ValueType = typename iterator_traits<_BidirIter>::value_type;
+    static_assert(is_same_v<typename allocator_traits<_Alloc>::value_type, _ValueType>,
+        "The allocator should already be rebound to the correct type");
+
+    if (__first == __last)
+        return;
+
+    if constexpr (is_array_v<_ValueType>) {
+        static_assert(!__libcpp_is_unbounded_array<_ValueType>::value,
+            "arrays of unbounded arrays don't exist, but if they did we would mess up here");
+
+        using _Element = remove_extent_t<_ValueType>;
+        __allocator_traits_rebind_t<_Alloc, _Element> __elem_alloc(__alloc);
+        do {
+            --__last;
+            decltype(auto) __array = *__last;
+            std::__allocator_destroy_multidimensional(__elem_alloc, __array, __array + extent_v<_ValueType>);
+        } while (__last != __first);
+    } else {
+        do {
+            --__last;
+            allocator_traits<_Alloc>::destroy(__alloc, std::addressof(*__last));
+        } while (__last != __first);
+    }
+}
+
+// Constructs the object at the given location using the allocator's construct method.
+//
+// If the object being constructed is an array, each element of the array is allocator-constructed,
+// recursively. If an exception is thrown during the construction of an array, the initialized
+// elements are destroyed in reverse order of initialization using allocator destruction.
+//
+// This function assumes that the allocator is bound to the correct type.
+template<class _Alloc, class _Tp>
+_LIBCPP_HIDE_FROM_ABI
+constexpr void __allocator_construct_at(_Alloc& __alloc, _Tp* __loc) {
+    static_assert(is_same_v<typename allocator_traits<_Alloc>::value_type, _Tp>,
+        "The allocator should already be rebound to the correct type");
+
+    if constexpr (is_array_v<_Tp>) {
+        using _Element = remove_extent_t<_Tp>;
+        __allocator_traits_rebind_t<_Alloc, _Element> __elem_alloc(__alloc);
+        size_t __i = 0;
+        _Tp& __array = *__loc;
+
+        // If an exception is thrown, destroy what we have constructed so far in reverse order.
+        __exception_guard __guard([&]() {
+          std::__allocator_destroy_multidimensional(__elem_alloc, __array, __array + __i);
+        });
+
+        for (; __i != extent_v<_Tp>; ++__i) {
+            std::__allocator_construct_at(__elem_alloc, std::addressof(__array[__i]));
+        }
+        __guard.__complete();
+    } else {
+        allocator_traits<_Alloc>::construct(__alloc, __loc);
+    }
+}
+
+// Constructs the object at the given location using the allocator's construct method, passing along
+// the provided argument.
+//
+// If the object being constructed is an array, the argument is also assumed to be an array. Each
+// each element of the array being constructed is allocator-constructed from the corresponding
+// element of the argument array. If an exception is thrown during the construction of an array,
+// the initialized elements are destroyed in reverse order of initialization using allocator
+// destruction.
+//
+// This function assumes that the allocator is bound to the correct type.
+template<class _Alloc, class _Tp, class _Arg>
+_LIBCPP_HIDE_FROM_ABI
+constexpr void __allocator_construct_at(_Alloc& __alloc, _Tp* __loc, _Arg const& __arg) {
+    static_assert(is_same_v<typename allocator_traits<_Alloc>::value_type, _Tp>,
+        "The allocator should already be rebound to the correct type");
+
+    if constexpr (is_array_v<_Tp>) {
+        static_assert(is_array_v<_Arg>,
+            "Provided non-array initialization argument to __allocator_construct_at when "
+            "trying to construct an array.");
+
+        using _Element = remove_extent_t<_Tp>;
+        __allocator_traits_rebind_t<_Alloc, _Element> __elem_alloc(__alloc);
+        size_t __i = 0;
+        _Tp& __array = *__loc;
+
+        // If an exception is thrown, destroy what we have constructed so far in reverse order.
+        __exception_guard __guard([&]() {
+          std::__allocator_destroy_multidimensional(__elem_alloc, __array, __array + __i);
+        });
+        for (; __i != extent_v<_Tp>; ++__i) {
+            std::__allocator_construct_at(__elem_alloc, std::addressof(__array[__i]), __arg[__i]);
+        }
+        __guard.__complete();
+    } else {
+        allocator_traits<_Alloc>::construct(__alloc, __loc, __arg);
+    }
+}
+
+// Given a range starting at it and containing n elements, initializes each element in the
+// range from left to right using the construct method of the allocator (rebound to the
+// correct type).
+//
+// If an exception is thrown, the initialized elements are destroyed in reverse order of
+// initialization using allocator_traits destruction. If the elements in the range are C-style
+// arrays, they are initialized element-wise using allocator construction, and recursively so.
+template<class _Alloc, class _BidirIter, class _Tp, class _Size = typename iterator_traits<_BidirIter>::difference_type>
+_LIBCPP_HIDE_FROM_ABI
+constexpr void __uninitialized_allocator_fill_n(_Alloc& __alloc, _BidirIter __it, _Size __n, _Tp const& __value) {
+    using _ValueType = typename iterator_traits<_BidirIter>::value_type;
+    __allocator_traits_rebind_t<_Alloc, _ValueType> __value_alloc(__alloc);
+    _BidirIter __begin = __it;
+
+    // If an exception is thrown, destroy what we have constructed so far in reverse order.
+    __exception_guard __guard([&]() { std::__allocator_destroy_multidimensional(__value_alloc, __begin, __it); });
+    for (; __n != 0; --__n, ++__it) {
+        std::__allocator_construct_at(__value_alloc, std::addressof(*__it), __value);
+    }
+    __guard.__complete();
+}
+
+// Same as __uninitialized_allocator_fill_n, but doesn't pass any initialization argument
+// to the allocator's construct method, which results in value initialization.
+template<class _Alloc, class _BidirIter, class _Size = typename iterator_traits<_BidirIter>::difference_type>
+_LIBCPP_HIDE_FROM_ABI
+constexpr void __uninitialized_allocator_value_construct_n(_Alloc& __alloc, _BidirIter __it, _Size __n) {
+    using _ValueType = typename iterator_traits<_BidirIter>::value_type;
+    __allocator_traits_rebind_t<_Alloc, _ValueType> __value_alloc(__alloc);
+    _BidirIter __begin = __it;
+
+    // If an exception is thrown, destroy what we have constructed so far in reverse order.
+    __exception_guard __guard([&]() { std::__allocator_destroy_multidimensional(__value_alloc, __begin, __it); });
+    for (; __n != 0; --__n, ++__it) {
+        std::__allocator_construct_at(__value_alloc, std::addressof(*__it));
+    }
+    __guard.__complete();
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+// Destroy all elements in [__first, __last) from left to right using allocator destruction.
+template <class _Alloc, class _Iter, class _Sent>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
+__allocator_destroy(_Alloc& __alloc, _Iter __first, _Sent __last) {
+  for (; __first != __last; ++__first)
+     allocator_traits<_Alloc>::destroy(__alloc, std::__to_address(__first));
+}
+
+template <class _Alloc, class _Iter>
+class _AllocatorDestroyRangeReverse {
+public:
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+  _AllocatorDestroyRangeReverse(_Alloc& __alloc, _Iter& __first, _Iter& __last)
+      : __alloc_(__alloc), __first_(__first), __last_(__last) {}
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 void operator()() const {
+    std::__allocator_destroy(__alloc_, std::reverse_iterator<_Iter>(__last_), std::reverse_iterator<_Iter>(__first_));
+  }
+
+private:
+  _Alloc& __alloc_;
+  _Iter& __first_;
+  _Iter& __last_;
+};
+
+// Copy-construct [__first1, __last1) in [__first2, __first2 + N), where N is distance(__first1, __last1).
+//
+// The caller has to ensure that __first2 can hold at least N uninitialized elements. If an exception is thrown the
+// already copied elements are destroyed in reverse order of their construction.
+template <class _Alloc, class _Iter1, class _Sent1, class _Iter2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Iter2
+__uninitialized_allocator_copy(_Alloc& __alloc, _Iter1 __first1, _Sent1 __last1, _Iter2 __first2) {
+  auto __destruct_first = __first2;
+  auto __guard =
+      std::__make_exception_guard(_AllocatorDestroyRangeReverse<_Alloc, _Iter2>(__alloc, __destruct_first, __first2));
+  while (__first1 != __last1) {
+    allocator_traits<_Alloc>::construct(__alloc, std::__to_address(__first2), *__first1);
+    ++__first1;
+    ++__first2;
+  }
+  __guard.__complete();
+  return __first2;
+}
+
+template <class _Alloc, class _Type>
+struct __allocator_has_trivial_copy_construct : _Not<__has_construct<_Alloc, _Type*, const _Type&> > {};
+
+template <class _Type>
+struct __allocator_has_trivial_copy_construct<allocator<_Type>, _Type> : true_type {};
+
+template <class _Alloc,
+          class _Type,
+          class _RawType = __remove_const_t<_Type>,
+          __enable_if_t<
+              // using _RawType because of the allocator<T const> extension
+              is_trivially_copy_constructible<_RawType>::value && is_trivially_copy_assignable<_RawType>::value &&
+              __allocator_has_trivial_copy_construct<_Alloc, _RawType>::value>* = nullptr>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Type*
+__uninitialized_allocator_copy(_Alloc&, const _Type* __first1, const _Type* __last1, _Type* __first2) {
+  // TODO: Remove the const_cast once we drop support for std::allocator<T const>
+  if (__libcpp_is_constant_evaluated()) {
+    while (__first1 != __last1) {
+      std::__construct_at(std::__to_address(__first2), *__first1);
+      ++__first1;
+      ++__first2;
+    }
+    return __first2;
+  } else {
+    return std::copy(__first1, __last1, const_cast<_RawType*>(__first2));
+  }
+}
+
+// Move-construct the elements [__first1, __last1) into [__first2, __first2 + N)
+// if the move constructor is noexcept, where N is distance(__first1, __last1).
+//
+// Otherwise try to copy all elements. If an exception is thrown the already copied
+// elements are destroyed in reverse order of their construction.
+template <class _Alloc, class _Iter1, class _Sent1, class _Iter2>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Iter2 __uninitialized_allocator_move_if_noexcept(
+    _Alloc& __alloc, _Iter1 __first1, _Sent1 __last1, _Iter2 __first2) {
+  static_assert(__is_cpp17_move_insertable<_Alloc>::value,
+                "The specified type does not meet the requirements of Cpp17MoveInsertable");
+  auto __destruct_first = __first2;
+  auto __guard =
+      std::__make_exception_guard(_AllocatorDestroyRangeReverse<_Alloc, _Iter2>(__alloc, __destruct_first, __first2));
+  while (__first1 != __last1) {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    allocator_traits<_Alloc>::construct(__alloc, std::__to_address(__first2), std::move_if_noexcept(*__first1));
+#else
+    allocator_traits<_Alloc>::construct(__alloc, std::__to_address(__first2), std::move(*__first1));
+#endif
+    ++__first1;
+    ++__first2;
+  }
+  __guard.__complete();
+  return __first2;
+}
+
+template <class _Alloc, class _Type>
+struct __allocator_has_trivial_move_construct : _Not<__has_construct<_Alloc, _Type*, _Type&&> > {};
+
+template <class _Type>
+struct __allocator_has_trivial_move_construct<allocator<_Type>, _Type> : true_type {};
+
+#ifndef _LIBCPP_COMPILER_GCC
+template <
+    class _Alloc,
+    class _Iter1,
+    class _Iter2,
+    class _Type = typename iterator_traits<_Iter1>::value_type,
+    class = __enable_if_t<is_trivially_move_constructible<_Type>::value && is_trivially_move_assignable<_Type>::value &&
+                          __allocator_has_trivial_move_construct<_Alloc, _Type>::value> >
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Iter2
+__uninitialized_allocator_move_if_noexcept(_Alloc&, _Iter1 __first1, _Iter1 __last1, _Iter2 __first2) {
+  if (__libcpp_is_constant_evaluated()) {
+    while (__first1 != __last1) {
+      std::__construct_at(std::__to_address(__first2), std::move(*__first1));
+      ++__first1;
+      ++__first2;
+    }
+    return __first2;
+  } else {
+    return std::move(__first1, __last1, __first2);
+  }
+}
+#endif // _LIBCPP_COMPILER_GCC
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_UNINITIALIZED_ALGORITHMS_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/unique_ptr.h b/app/src/main/cpp/libcxx/include/__memory/unique_ptr.h
new file mode 100644
index 0000000..9cdbda8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/unique_ptr.h
@@ -0,0 +1,746 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_UNIQUE_PTR_H
+#define _LIBCPP___MEMORY_UNIQUE_PTR_H
+
+#include <__compare/compare_three_way.h>
+#include <__compare/compare_three_way_result.h>
+#include <__compare/three_way_comparable.h>
+#include <__config>
+#include <__functional/hash.h>
+#include <__functional/operations.h>
+#include <__memory/allocator_traits.h> // __pointer
+#include <__memory/auto_ptr.h>
+#include <__memory/compressed_pair.h>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/common_type.h>
+#include <__type_traits/dependent_type.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_array.h>
+#include <__type_traits/is_assignable.h>
+#include <__type_traits/is_constructible.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_default_constructible.h>
+#include <__type_traits/is_function.h>
+#include <__type_traits/is_pointer.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_swappable.h>
+#include <__type_traits/is_void.h>
+#include <__type_traits/remove_extent.h>
+#include <__type_traits/type_identity.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS default_delete {
+    static_assert(!is_function<_Tp>::value,
+                  "default_delete cannot be instantiated for function types");
+#ifndef _LIBCPP_CXX03_LANG
+  _LIBCPP_INLINE_VISIBILITY constexpr default_delete() _NOEXCEPT = default;
+#else
+  _LIBCPP_INLINE_VISIBILITY default_delete() {}
+#endif
+  template <class _Up>
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 default_delete(
+      const default_delete<_Up>&, typename enable_if<is_convertible<_Up*, _Tp*>::value>::type* = 0) _NOEXCEPT {}
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 void operator()(_Tp* __ptr) const _NOEXCEPT {
+    static_assert(sizeof(_Tp) >= 0, "cannot delete an incomplete type");
+    static_assert(!is_void<_Tp>::value, "cannot delete an incomplete type");
+    delete __ptr;
+  }
+};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS default_delete<_Tp[]> {
+private:
+  template <class _Up>
+  struct _EnableIfConvertible
+      : enable_if<is_convertible<_Up(*)[], _Tp(*)[]>::value> {};
+
+public:
+#ifndef _LIBCPP_CXX03_LANG
+  _LIBCPP_INLINE_VISIBILITY constexpr default_delete() _NOEXCEPT = default;
+#else
+  _LIBCPP_INLINE_VISIBILITY default_delete() {}
+#endif
+
+  template <class _Up>
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+  default_delete(const default_delete<_Up[]>&, typename _EnableIfConvertible<_Up>::type* = 0) _NOEXCEPT {}
+
+  template <class _Up>
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 typename _EnableIfConvertible<_Up>::type
+  operator()(_Up* __ptr) const _NOEXCEPT {
+    static_assert(sizeof(_Up) >= 0, "cannot delete an incomplete type");
+    delete[] __ptr;
+  }
+};
+
+template <class _Deleter>
+struct __unique_ptr_deleter_sfinae {
+  static_assert(!is_reference<_Deleter>::value, "incorrect specialization");
+  typedef const _Deleter& __lval_ref_type;
+  typedef _Deleter&& __good_rval_ref_type;
+  typedef true_type __enable_rval_overload;
+};
+
+template <class _Deleter>
+struct __unique_ptr_deleter_sfinae<_Deleter const&> {
+  typedef const _Deleter& __lval_ref_type;
+  typedef const _Deleter&& __bad_rval_ref_type;
+  typedef false_type __enable_rval_overload;
+};
+
+template <class _Deleter>
+struct __unique_ptr_deleter_sfinae<_Deleter&> {
+  typedef _Deleter& __lval_ref_type;
+  typedef _Deleter&& __bad_rval_ref_type;
+  typedef false_type __enable_rval_overload;
+};
+
+#if defined(_LIBCPP_ABI_ENABLE_UNIQUE_PTR_TRIVIAL_ABI)
+#  define _LIBCPP_UNIQUE_PTR_TRIVIAL_ABI __attribute__((trivial_abi))
+#else
+#  define _LIBCPP_UNIQUE_PTR_TRIVIAL_ABI
+#endif
+
+template <class _Tp, class _Dp = default_delete<_Tp> >
+class _LIBCPP_UNIQUE_PTR_TRIVIAL_ABI _LIBCPP_TEMPLATE_VIS unique_ptr {
+public:
+  typedef _Tp element_type;
+  typedef _Dp deleter_type;
+  typedef _LIBCPP_NODEBUG typename __pointer<_Tp, deleter_type>::type pointer;
+
+  static_assert(!is_rvalue_reference<deleter_type>::value,
+                "the specified deleter type cannot be an rvalue reference");
+
+private:
+  __compressed_pair<pointer, deleter_type> __ptr_;
+
+  struct __nat { int __for_bool_; };
+
+  typedef _LIBCPP_NODEBUG __unique_ptr_deleter_sfinae<_Dp> _DeleterSFINAE;
+
+  template <bool _Dummy>
+  using _LValRefType _LIBCPP_NODEBUG =
+      typename __dependent_type<_DeleterSFINAE, _Dummy>::__lval_ref_type;
+
+  template <bool _Dummy>
+  using _GoodRValRefType _LIBCPP_NODEBUG =
+      typename __dependent_type<_DeleterSFINAE, _Dummy>::__good_rval_ref_type;
+
+  template <bool _Dummy>
+  using _BadRValRefType _LIBCPP_NODEBUG =
+      typename __dependent_type<_DeleterSFINAE, _Dummy>::__bad_rval_ref_type;
+
+  template <bool _Dummy, class _Deleter = typename __dependent_type<
+                             __type_identity<deleter_type>, _Dummy>::type>
+  using _EnableIfDeleterDefaultConstructible _LIBCPP_NODEBUG =
+      typename enable_if<is_default_constructible<_Deleter>::value &&
+                         !is_pointer<_Deleter>::value>::type;
+
+  template <class _ArgType>
+  using _EnableIfDeleterConstructible _LIBCPP_NODEBUG =
+      typename enable_if<is_constructible<deleter_type, _ArgType>::value>::type;
+
+  template <class _UPtr, class _Up>
+  using _EnableIfMoveConvertible _LIBCPP_NODEBUG = typename enable_if<
+      is_convertible<typename _UPtr::pointer, pointer>::value &&
+      !is_array<_Up>::value
+  >::type;
+
+  template <class _UDel>
+  using _EnableIfDeleterConvertible _LIBCPP_NODEBUG = typename enable_if<
+      (is_reference<_Dp>::value && is_same<_Dp, _UDel>::value) ||
+      (!is_reference<_Dp>::value && is_convertible<_UDel, _Dp>::value)
+    >::type;
+
+  template <class _UDel>
+  using _EnableIfDeleterAssignable = typename enable_if<
+      is_assignable<_Dp&, _UDel&&>::value
+    >::type;
+
+public:
+  template <bool _Dummy = true,
+            class = _EnableIfDeleterDefaultConstructible<_Dummy> >
+  _LIBCPP_INLINE_VISIBILITY
+  _LIBCPP_CONSTEXPR unique_ptr() _NOEXCEPT : __ptr_(__value_init_tag(), __value_init_tag()) {}
+
+  template <bool _Dummy = true,
+            class = _EnableIfDeleterDefaultConstructible<_Dummy> >
+  _LIBCPP_INLINE_VISIBILITY
+  _LIBCPP_CONSTEXPR unique_ptr(nullptr_t) _NOEXCEPT : __ptr_(__value_init_tag(), __value_init_tag()) {}
+
+  template <bool _Dummy = true, class = _EnableIfDeleterDefaultConstructible<_Dummy> >
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 explicit unique_ptr(pointer __p) _NOEXCEPT
+      : __ptr_(__p, __value_init_tag()) {}
+
+  template <bool _Dummy = true, class = _EnableIfDeleterConstructible<_LValRefType<_Dummy> > >
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr(pointer __p, _LValRefType<_Dummy> __d) _NOEXCEPT
+      : __ptr_(__p, __d) {}
+
+  template <bool _Dummy = true, class = _EnableIfDeleterConstructible<_GoodRValRefType<_Dummy> > >
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+  unique_ptr(pointer __p, _GoodRValRefType<_Dummy> __d) _NOEXCEPT : __ptr_(__p, _VSTD::move(__d)) {
+    static_assert(!is_reference<deleter_type>::value,
+                  "rvalue deleter bound to reference");
+  }
+
+  template <bool _Dummy = true,
+            class = _EnableIfDeleterConstructible<_BadRValRefType<_Dummy> > >
+  _LIBCPP_INLINE_VISIBILITY
+  unique_ptr(pointer __p, _BadRValRefType<_Dummy> __d) = delete;
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr(unique_ptr&& __u) _NOEXCEPT
+      : __ptr_(__u.release(), _VSTD::forward<deleter_type>(__u.get_deleter())) {}
+
+  template <class _Up,
+            class _Ep,
+            class = _EnableIfMoveConvertible<unique_ptr<_Up, _Ep>, _Up>,
+            class = _EnableIfDeleterConvertible<_Ep> >
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr(unique_ptr<_Up, _Ep>&& __u) _NOEXCEPT
+      : __ptr_(__u.release(), _VSTD::forward<_Ep>(__u.get_deleter())) {}
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_AUTO_PTR)
+  template <class _Up>
+  _LIBCPP_INLINE_VISIBILITY
+  unique_ptr(auto_ptr<_Up>&& __p,
+             typename enable_if<is_convertible<_Up*, _Tp*>::value &&
+                                    is_same<_Dp, default_delete<_Tp> >::value,
+                                __nat>::type = __nat()) _NOEXCEPT
+      : __ptr_(__p.release(), __value_init_tag()) {}
+#endif
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr& operator=(unique_ptr&& __u) _NOEXCEPT {
+    reset(__u.release());
+    __ptr_.second() = _VSTD::forward<deleter_type>(__u.get_deleter());
+    return *this;
+  }
+
+  template <class _Up,
+            class _Ep,
+            class = _EnableIfMoveConvertible<unique_ptr<_Up, _Ep>, _Up>,
+            class = _EnableIfDeleterAssignable<_Ep> >
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr& operator=(unique_ptr<_Up, _Ep>&& __u) _NOEXCEPT {
+    reset(__u.release());
+    __ptr_.second() = _VSTD::forward<_Ep>(__u.get_deleter());
+    return *this;
+  }
+
+#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_AUTO_PTR)
+  template <class _Up>
+  _LIBCPP_INLINE_VISIBILITY
+      typename enable_if<is_convertible<_Up*, _Tp*>::value &&
+                             is_same<_Dp, default_delete<_Tp> >::value,
+                         unique_ptr&>::type
+      operator=(auto_ptr<_Up> __p) {
+    reset(__p.release());
+    return *this;
+  }
+#endif
+
+#ifdef _LIBCPP_CXX03_LANG
+  unique_ptr(unique_ptr const&) = delete;
+  unique_ptr& operator=(unique_ptr const&) = delete;
+#endif
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 ~unique_ptr() { reset(); }
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr& operator=(nullptr_t) _NOEXCEPT {
+    reset();
+    return *this;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 __add_lvalue_reference_t<_Tp> operator*() const {
+    return *__ptr_.first();
+  }
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 pointer operator->() const _NOEXCEPT {
+    return __ptr_.first();
+  }
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 pointer get() const _NOEXCEPT { return __ptr_.first(); }
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 deleter_type& get_deleter() _NOEXCEPT {
+    return __ptr_.second();
+  }
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 const deleter_type& get_deleter() const _NOEXCEPT {
+    return __ptr_.second();
+  }
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 explicit operator bool() const _NOEXCEPT {
+    return __ptr_.first() != nullptr;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 pointer release() _NOEXCEPT {
+    pointer __t = __ptr_.first();
+    __ptr_.first() = pointer();
+    return __t;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 void reset(pointer __p = pointer()) _NOEXCEPT {
+    pointer __tmp = __ptr_.first();
+    __ptr_.first() = __p;
+    if (__tmp)
+      __ptr_.second()(__tmp);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 void swap(unique_ptr& __u) _NOEXCEPT {
+    __ptr_.swap(__u.__ptr_);
+  }
+};
+
+
+template <class _Tp, class _Dp>
+class _LIBCPP_UNIQUE_PTR_TRIVIAL_ABI _LIBCPP_TEMPLATE_VIS unique_ptr<_Tp[], _Dp> {
+public:
+  typedef _Tp element_type;
+  typedef _Dp deleter_type;
+  typedef typename __pointer<_Tp, deleter_type>::type pointer;
+
+private:
+  __compressed_pair<pointer, deleter_type> __ptr_;
+
+  template <class _From>
+  struct _CheckArrayPointerConversion : is_same<_From, pointer> {};
+
+  template <class _FromElem>
+  struct _CheckArrayPointerConversion<_FromElem*>
+      : integral_constant<bool,
+          is_same<_FromElem*, pointer>::value ||
+            (is_same<pointer, element_type*>::value &&
+             is_convertible<_FromElem(*)[], element_type(*)[]>::value)
+      >
+  {};
+
+  typedef __unique_ptr_deleter_sfinae<_Dp> _DeleterSFINAE;
+
+  template <bool _Dummy>
+  using _LValRefType _LIBCPP_NODEBUG =
+      typename __dependent_type<_DeleterSFINAE, _Dummy>::__lval_ref_type;
+
+  template <bool _Dummy>
+  using _GoodRValRefType _LIBCPP_NODEBUG =
+      typename __dependent_type<_DeleterSFINAE, _Dummy>::__good_rval_ref_type;
+
+  template <bool _Dummy>
+  using _BadRValRefType _LIBCPP_NODEBUG =
+      typename __dependent_type<_DeleterSFINAE, _Dummy>::__bad_rval_ref_type;
+
+  template <bool _Dummy, class _Deleter = typename __dependent_type<
+                             __type_identity<deleter_type>, _Dummy>::type>
+  using _EnableIfDeleterDefaultConstructible _LIBCPP_NODEBUG =
+      typename enable_if<is_default_constructible<_Deleter>::value &&
+                         !is_pointer<_Deleter>::value>::type;
+
+  template <class _ArgType>
+  using _EnableIfDeleterConstructible _LIBCPP_NODEBUG =
+      typename enable_if<is_constructible<deleter_type, _ArgType>::value>::type;
+
+  template <class _Pp>
+  using _EnableIfPointerConvertible _LIBCPP_NODEBUG = typename enable_if<
+      _CheckArrayPointerConversion<_Pp>::value
+  >::type;
+
+  template <class _UPtr, class _Up,
+        class _ElemT = typename _UPtr::element_type>
+  using _EnableIfMoveConvertible _LIBCPP_NODEBUG = typename enable_if<
+      is_array<_Up>::value &&
+      is_same<pointer, element_type*>::value &&
+      is_same<typename _UPtr::pointer, _ElemT*>::value &&
+      is_convertible<_ElemT(*)[], element_type(*)[]>::value
+    >::type;
+
+  template <class _UDel>
+  using _EnableIfDeleterConvertible _LIBCPP_NODEBUG = typename enable_if<
+      (is_reference<_Dp>::value && is_same<_Dp, _UDel>::value) ||
+      (!is_reference<_Dp>::value && is_convertible<_UDel, _Dp>::value)
+    >::type;
+
+  template <class _UDel>
+  using _EnableIfDeleterAssignable _LIBCPP_NODEBUG = typename enable_if<
+      is_assignable<_Dp&, _UDel&&>::value
+    >::type;
+
+public:
+  template <bool _Dummy = true,
+            class = _EnableIfDeleterDefaultConstructible<_Dummy> >
+  _LIBCPP_INLINE_VISIBILITY
+  _LIBCPP_CONSTEXPR unique_ptr() _NOEXCEPT : __ptr_(__value_init_tag(), __value_init_tag()) {}
+
+  template <bool _Dummy = true,
+            class = _EnableIfDeleterDefaultConstructible<_Dummy> >
+  _LIBCPP_INLINE_VISIBILITY
+  _LIBCPP_CONSTEXPR unique_ptr(nullptr_t) _NOEXCEPT : __ptr_(__value_init_tag(), __value_init_tag()) {}
+
+  template <class _Pp,
+            bool _Dummy = true,
+            class       = _EnableIfDeleterDefaultConstructible<_Dummy>,
+            class       = _EnableIfPointerConvertible<_Pp> >
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 explicit unique_ptr(_Pp __p) _NOEXCEPT
+      : __ptr_(__p, __value_init_tag()) {}
+
+  template <class _Pp,
+            bool _Dummy = true,
+            class       = _EnableIfDeleterConstructible<_LValRefType<_Dummy> >,
+            class       = _EnableIfPointerConvertible<_Pp> >
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr(_Pp __p, _LValRefType<_Dummy> __d) _NOEXCEPT
+      : __ptr_(__p, __d) {}
+
+  template <bool _Dummy = true, class = _EnableIfDeleterConstructible<_LValRefType<_Dummy> > >
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr(nullptr_t, _LValRefType<_Dummy> __d) _NOEXCEPT
+      : __ptr_(nullptr, __d) {}
+
+  template <class _Pp,
+            bool _Dummy = true,
+            class       = _EnableIfDeleterConstructible<_GoodRValRefType<_Dummy> >,
+            class       = _EnableIfPointerConvertible<_Pp> >
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr(_Pp __p, _GoodRValRefType<_Dummy> __d) _NOEXCEPT
+      : __ptr_(__p, _VSTD::move(__d)) {
+    static_assert(!is_reference<deleter_type>::value,
+                  "rvalue deleter bound to reference");
+  }
+
+  template <bool _Dummy = true, class = _EnableIfDeleterConstructible<_GoodRValRefType<_Dummy> > >
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr(nullptr_t, _GoodRValRefType<_Dummy> __d) _NOEXCEPT
+      : __ptr_(nullptr, _VSTD::move(__d)) {
+    static_assert(!is_reference<deleter_type>::value,
+                  "rvalue deleter bound to reference");
+  }
+
+  template <class _Pp, bool _Dummy = true,
+            class = _EnableIfDeleterConstructible<_BadRValRefType<_Dummy> >,
+            class = _EnableIfPointerConvertible<_Pp> >
+  _LIBCPP_INLINE_VISIBILITY
+  unique_ptr(_Pp __p, _BadRValRefType<_Dummy> __d) = delete;
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr(unique_ptr&& __u) _NOEXCEPT
+      : __ptr_(__u.release(), _VSTD::forward<deleter_type>(__u.get_deleter())) {}
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr& operator=(unique_ptr&& __u) _NOEXCEPT {
+    reset(__u.release());
+    __ptr_.second() = _VSTD::forward<deleter_type>(__u.get_deleter());
+    return *this;
+  }
+
+  template <class _Up,
+            class _Ep,
+            class = _EnableIfMoveConvertible<unique_ptr<_Up, _Ep>, _Up>,
+            class = _EnableIfDeleterConvertible<_Ep> >
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr(unique_ptr<_Up, _Ep>&& __u) _NOEXCEPT
+      : __ptr_(__u.release(), _VSTD::forward<_Ep>(__u.get_deleter())) {}
+
+  template <class _Up,
+            class _Ep,
+            class = _EnableIfMoveConvertible<unique_ptr<_Up, _Ep>, _Up>,
+            class = _EnableIfDeleterAssignable<_Ep> >
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr& operator=(unique_ptr<_Up, _Ep>&& __u) _NOEXCEPT {
+    reset(__u.release());
+    __ptr_.second() = _VSTD::forward<_Ep>(__u.get_deleter());
+    return *this;
+  }
+
+#ifdef _LIBCPP_CXX03_LANG
+  unique_ptr(unique_ptr const&) = delete;
+  unique_ptr& operator=(unique_ptr const&) = delete;
+#endif
+public:
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 ~unique_ptr() { reset(); }
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr& operator=(nullptr_t) _NOEXCEPT {
+    reset();
+    return *this;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 __add_lvalue_reference_t<_Tp>
+  operator[](size_t __i) const {
+    return __ptr_.first()[__i];
+  }
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 pointer get() const _NOEXCEPT { return __ptr_.first(); }
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 deleter_type& get_deleter() _NOEXCEPT {
+    return __ptr_.second();
+  }
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 const deleter_type& get_deleter() const _NOEXCEPT {
+    return __ptr_.second();
+  }
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 explicit operator bool() const _NOEXCEPT {
+    return __ptr_.first() != nullptr;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 pointer release() _NOEXCEPT {
+    pointer __t = __ptr_.first();
+    __ptr_.first() = pointer();
+    return __t;
+  }
+
+  template <class _Pp>
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+      typename enable_if< _CheckArrayPointerConversion<_Pp>::value >::type
+      reset(_Pp __p) _NOEXCEPT {
+    pointer __tmp = __ptr_.first();
+    __ptr_.first() = __p;
+    if (__tmp)
+      __ptr_.second()(__tmp);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 void reset(nullptr_t = nullptr) _NOEXCEPT {
+    pointer __tmp = __ptr_.first();
+    __ptr_.first() = nullptr;
+    if (__tmp)
+      __ptr_.second()(__tmp);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 void swap(unique_ptr& __u) _NOEXCEPT {
+    __ptr_.swap(__u.__ptr_);
+  }
+};
+
+template <class _Tp, class _Dp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    typename enable_if< __is_swappable<_Dp>::value, void >::type
+    swap(unique_ptr<_Tp, _Dp>& __x, unique_ptr<_Tp, _Dp>& __y) _NOEXCEPT {
+  __x.swap(__y);
+}
+
+template <class _T1, class _D1, class _T2, class _D2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+operator==(const unique_ptr<_T1, _D1>& __x, const unique_ptr<_T2, _D2>& __y) {
+  return __x.get() == __y.get();
+}
+
+#if _LIBCPP_STD_VER <= 17
+template <class _T1, class _D1, class _T2, class _D2>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const unique_ptr<_T1, _D1>& __x, const unique_ptr<_T2, _D2>& __y) {return !(__x == __y);}
+#endif
+
+template <class _T1, class _D1, class _T2, class _D2>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator< (const unique_ptr<_T1, _D1>& __x, const unique_ptr<_T2, _D2>& __y)
+{
+    typedef typename unique_ptr<_T1, _D1>::pointer _P1;
+    typedef typename unique_ptr<_T2, _D2>::pointer _P2;
+    typedef typename common_type<_P1, _P2>::type _Vp;
+    return less<_Vp>()(__x.get(), __y.get());
+}
+
+template <class _T1, class _D1, class _T2, class _D2>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator> (const unique_ptr<_T1, _D1>& __x, const unique_ptr<_T2, _D2>& __y) {return __y < __x;}
+
+template <class _T1, class _D1, class _T2, class _D2>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const unique_ptr<_T1, _D1>& __x, const unique_ptr<_T2, _D2>& __y) {return !(__y < __x);}
+
+template <class _T1, class _D1, class _T2, class _D2>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const unique_ptr<_T1, _D1>& __x, const unique_ptr<_T2, _D2>& __y) {return !(__x < __y);}
+
+
+#if _LIBCPP_STD_VER > 17
+template <class _T1, class _D1, class _T2, class _D2>
+requires three_way_comparable_with<typename unique_ptr<_T1, _D1>::pointer,
+                                   typename unique_ptr<_T2, _D2>::pointer>
+_LIBCPP_HIDE_FROM_ABI
+compare_three_way_result_t<typename unique_ptr<_T1, _D1>::pointer,
+                           typename unique_ptr<_T2, _D2>::pointer>
+operator<=>(const unique_ptr<_T1, _D1>& __x, const unique_ptr<_T2, _D2>& __y) {
+   return compare_three_way()(__x.get(), __y.get());
+}
+#endif
+
+template <class _T1, class _D1>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+operator==(const unique_ptr<_T1, _D1>& __x, nullptr_t) _NOEXCEPT {
+  return !__x;
+}
+
+#if _LIBCPP_STD_VER <= 17
+template <class _T1, class _D1>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(nullptr_t, const unique_ptr<_T1, _D1>& __x) _NOEXCEPT
+{
+    return !__x;
+}
+
+template <class _T1, class _D1>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const unique_ptr<_T1, _D1>& __x, nullptr_t) _NOEXCEPT
+{
+    return static_cast<bool>(__x);
+}
+
+template <class _T1, class _D1>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(nullptr_t, const unique_ptr<_T1, _D1>& __x) _NOEXCEPT
+{
+    return static_cast<bool>(__x);
+}
+#endif // _LIBCPP_STD_VER <= 17
+
+template <class _T1, class _D1>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+operator<(const unique_ptr<_T1, _D1>& __x, nullptr_t) {
+  typedef typename unique_ptr<_T1, _D1>::pointer _P1;
+  return less<_P1>()(__x.get(), nullptr);
+}
+
+template <class _T1, class _D1>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+operator<(nullptr_t, const unique_ptr<_T1, _D1>& __x) {
+  typedef typename unique_ptr<_T1, _D1>::pointer _P1;
+  return less<_P1>()(nullptr, __x.get());
+}
+
+template <class _T1, class _D1>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+operator>(const unique_ptr<_T1, _D1>& __x, nullptr_t) {
+  return nullptr < __x;
+}
+
+template <class _T1, class _D1>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+operator>(nullptr_t, const unique_ptr<_T1, _D1>& __x) {
+  return __x < nullptr;
+}
+
+template <class _T1, class _D1>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+operator<=(const unique_ptr<_T1, _D1>& __x, nullptr_t) {
+  return !(nullptr < __x);
+}
+
+template <class _T1, class _D1>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+operator<=(nullptr_t, const unique_ptr<_T1, _D1>& __x) {
+  return !(__x < nullptr);
+}
+
+template <class _T1, class _D1>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+operator>=(const unique_ptr<_T1, _D1>& __x, nullptr_t) {
+  return !(__x < nullptr);
+}
+
+template <class _T1, class _D1>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+operator>=(nullptr_t, const unique_ptr<_T1, _D1>& __x) {
+  return !(nullptr < __x);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _T1, class _D1>
+  requires three_way_comparable<
+      typename unique_ptr<_T1, _D1>::pointer> _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+      compare_three_way_result_t<typename unique_ptr<_T1, _D1>::pointer>
+operator<=>(const unique_ptr<_T1, _D1>& __x, nullptr_t) {
+   return compare_three_way()(__x.get(), static_cast<typename unique_ptr<_T1, _D1>::pointer>(nullptr));
+}
+#endif
+
+#if _LIBCPP_STD_VER > 11
+
+template<class _Tp>
+struct __unique_if
+{
+    typedef unique_ptr<_Tp> __unique_single;
+};
+
+template<class _Tp>
+struct __unique_if<_Tp[]>
+{
+    typedef unique_ptr<_Tp[]> __unique_array_unknown_bound;
+};
+
+template<class _Tp, size_t _Np>
+struct __unique_if<_Tp[_Np]>
+{
+    typedef void __unique_array_known_bound;
+};
+
+template <class _Tp, class... _Args>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 typename __unique_if<_Tp>::__unique_single
+make_unique(_Args&&... __args) {
+  return unique_ptr<_Tp>(new _Tp(_VSTD::forward<_Args>(__args)...));
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 typename __unique_if<_Tp>::__unique_array_unknown_bound
+make_unique(size_t __n) {
+  typedef __remove_extent_t<_Tp> _Up;
+  return unique_ptr<_Tp>(new _Up[__n]());
+}
+
+template<class _Tp, class... _Args>
+    typename __unique_if<_Tp>::__unique_array_known_bound
+    make_unique(_Args&&...) = delete;
+
+#endif // _LIBCPP_STD_VER > 11
+
+#if _LIBCPP_STD_VER >= 20
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 typename __unique_if<_Tp>::__unique_single
+make_unique_for_overwrite() {
+  return unique_ptr<_Tp>(new _Tp);
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 typename __unique_if<_Tp>::__unique_array_unknown_bound
+make_unique_for_overwrite(size_t __n) {
+  return unique_ptr<_Tp>(new __remove_extent_t<_Tp>[__n]);
+}
+
+template<class _Tp, class... _Args>
+typename __unique_if<_Tp>::__unique_array_known_bound make_unique_for_overwrite(_Args&&...) = delete;
+
+#endif // _LIBCPP_STD_VER >= 20
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS hash;
+
+template <class _Tp, class _Dp>
+#ifdef _LIBCPP_CXX03_LANG
+struct _LIBCPP_TEMPLATE_VIS hash<unique_ptr<_Tp, _Dp> >
+#else
+struct _LIBCPP_TEMPLATE_VIS hash<__enable_hash_helper<
+    unique_ptr<_Tp, _Dp>, typename unique_ptr<_Tp, _Dp>::pointer> >
+#endif
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef unique_ptr<_Tp, _Dp> argument_type;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef size_t               result_type;
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const unique_ptr<_Tp, _Dp>& __ptr) const
+    {
+        typedef typename unique_ptr<_Tp, _Dp>::pointer pointer;
+        return hash<pointer>()(__ptr.get());
+    }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_UNIQUE_PTR_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/uses_allocator.h b/app/src/main/cpp/libcxx/include/__memory/uses_allocator.h
new file mode 100644
index 0000000..fe89704
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/uses_allocator.h
@@ -0,0 +1,59 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_USES_ALLOCATOR_H
+#define _LIBCPP___MEMORY_USES_ALLOCATOR_H
+
+#include <__config>
+#include <__type_traits/is_convertible.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct __has_allocator_type
+{
+private:
+    template <class _Up> static false_type __test(...);
+    template <class _Up> static true_type __test(typename _Up::allocator_type* = 0);
+public:
+    static const bool value = decltype(__test<_Tp>(0))::value;
+};
+
+template <class _Tp, class _Alloc, bool = __has_allocator_type<_Tp>::value>
+struct __uses_allocator
+    : public integral_constant<bool,
+        is_convertible<_Alloc, typename _Tp::allocator_type>::value>
+{
+};
+
+template <class _Tp, class _Alloc>
+struct __uses_allocator<_Tp, _Alloc, false>
+    : public false_type
+{
+};
+
+template <class _Tp, class _Alloc>
+struct _LIBCPP_TEMPLATE_VIS uses_allocator
+    : public __uses_allocator<_Tp, _Alloc>
+{
+};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp, class _Alloc>
+inline constexpr size_t uses_allocator_v = uses_allocator<_Tp, _Alloc>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_USES_ALLOCATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/uses_allocator_construction.h b/app/src/main/cpp/libcxx/include/__memory/uses_allocator_construction.h
new file mode 100644
index 0000000..0f63b08
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/uses_allocator_construction.h
@@ -0,0 +1,221 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_USES_ALLOCATOR_CONSTRUCTION_H
+#define _LIBCPP___MEMORY_USES_ALLOCATOR_CONSTRUCTION_H
+
+#include <__config>
+#include <__memory/construct_at.h>
+#include <__memory/uses_allocator.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/remove_cv.h>
+#include <__utility/declval.h>
+#include <__utility/pair.h>
+#include <tuple>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER >= 17
+
+template <class _Type>
+inline constexpr bool __is_std_pair = false;
+
+template <class _Type1, class _Type2>
+inline constexpr bool __is_std_pair<pair<_Type1, _Type2>> = true;
+
+template <class _Type, class _Alloc, class... _Args, __enable_if_t<!__is_std_pair<_Type>, int> = 0>
+_LIBCPP_HIDE_FROM_ABI constexpr auto
+__uses_allocator_construction_args(const _Alloc& __alloc, _Args&&... __args) noexcept {
+  if constexpr (!uses_allocator_v<_Type, _Alloc> && is_constructible_v<_Type, _Args...>) {
+    return std::forward_as_tuple(std::forward<_Args>(__args)...);
+  } else if constexpr (uses_allocator_v<_Type, _Alloc> &&
+                       is_constructible_v<_Type, allocator_arg_t, const _Alloc&, _Args...>) {
+    return tuple<allocator_arg_t, const _Alloc&, _Args&&...>(allocator_arg, __alloc, std::forward<_Args>(__args)...);
+  } else if constexpr (uses_allocator_v<_Type, _Alloc> && is_constructible_v<_Type, _Args..., const _Alloc&>) {
+    return std::forward_as_tuple(std::forward<_Args>(__args)..., __alloc);
+  } else {
+    static_assert(
+        sizeof(_Type) + 1 == 0, "If uses_allocator_v<Type> is true, the type has to be allocator-constructible");
+  }
+}
+
+template <class _Pair, class _Alloc, class _Tuple1, class _Tuple2, __enable_if_t<__is_std_pair<_Pair>, int> = 0>
+_LIBCPP_HIDE_FROM_ABI constexpr auto __uses_allocator_construction_args(
+    const _Alloc& __alloc, piecewise_construct_t, _Tuple1&& __x, _Tuple2&& __y) noexcept {
+  return std::make_tuple(
+      piecewise_construct,
+      std::apply(
+          [&__alloc](auto&&... __args1) {
+            return std::__uses_allocator_construction_args<typename _Pair::first_type>(
+                __alloc, std::forward<decltype(__args1)>(__args1)...);
+          },
+          std::forward<_Tuple1>(__x)),
+      std::apply(
+          [&__alloc](auto&&... __args2) {
+            return std::__uses_allocator_construction_args<typename _Pair::second_type>(
+                __alloc, std::forward<decltype(__args2)>(__args2)...);
+          },
+          std::forward<_Tuple2>(__y)));
+}
+
+template <class _Pair, class _Alloc, __enable_if_t<__is_std_pair<_Pair>, int> = 0>
+_LIBCPP_HIDE_FROM_ABI constexpr auto __uses_allocator_construction_args(const _Alloc& __alloc) noexcept {
+  return std::__uses_allocator_construction_args<_Pair>(__alloc, piecewise_construct, tuple<>{}, tuple<>{});
+}
+
+template <class _Pair, class _Alloc, class _Up, class _Vp, __enable_if_t<__is_std_pair<_Pair>, int> = 0>
+_LIBCPP_HIDE_FROM_ABI constexpr auto
+__uses_allocator_construction_args(const _Alloc& __alloc, _Up&& __u, _Vp&& __v) noexcept {
+  return std::__uses_allocator_construction_args<_Pair>(
+      __alloc,
+      piecewise_construct,
+      std::forward_as_tuple(std::forward<_Up>(__u)),
+      std::forward_as_tuple(std::forward<_Vp>(__v)));
+}
+
+#  if _LIBCPP_STD_VER > 20
+template <class _Pair, class _Alloc, class _Up, class _Vp, __enable_if_t<__is_std_pair<_Pair>, int> = 0>
+_LIBCPP_HIDE_FROM_ABI constexpr auto
+__uses_allocator_construction_args(const _Alloc& __alloc, pair<_Up, _Vp>& __pair) noexcept {
+  return std::__uses_allocator_construction_args<_Pair>(
+      __alloc, piecewise_construct, std::forward_as_tuple(__pair.first), std::forward_as_tuple(__pair.second));
+}
+#  endif
+
+template <class _Pair, class _Alloc, class _Up, class _Vp, __enable_if_t<__is_std_pair<_Pair>, int> = 0>
+_LIBCPP_HIDE_FROM_ABI constexpr auto
+__uses_allocator_construction_args(const _Alloc& __alloc, const pair<_Up, _Vp>& __pair) noexcept {
+  return std::__uses_allocator_construction_args<_Pair>(
+      __alloc, piecewise_construct, std::forward_as_tuple(__pair.first), std::forward_as_tuple(__pair.second));
+}
+
+template <class _Pair, class _Alloc, class _Up, class _Vp, __enable_if_t<__is_std_pair<_Pair>, int> = 0>
+_LIBCPP_HIDE_FROM_ABI constexpr auto
+__uses_allocator_construction_args(const _Alloc& __alloc, pair<_Up, _Vp>&& __pair) noexcept {
+  return std::__uses_allocator_construction_args<_Pair>(
+      __alloc,
+      piecewise_construct,
+      std::forward_as_tuple(std::get<0>(std::move(__pair))),
+      std::forward_as_tuple(std::get<1>(std::move(__pair))));
+}
+
+#  if _LIBCPP_STD_VER > 20
+template <class _Pair, class _Alloc, class _Up, class _Vp, __enable_if_t<__is_std_pair<_Pair>, int> = 0>
+_LIBCPP_HIDE_FROM_ABI constexpr auto
+__uses_allocator_construction_args(const _Alloc& __alloc, const pair<_Up, _Vp>&& __pair) noexcept {
+  return std::__uses_allocator_construction_args<_Pair>(
+      __alloc,
+      piecewise_construct,
+      std::forward_as_tuple(std::get<0>(std::move(__pair))),
+      std::forward_as_tuple(std::get<1>(std::move(__pair))));
+}
+#  endif
+
+namespace __uses_allocator_detail {
+
+template <class _Ap, class _Bp>
+void __fun(const pair<_Ap, _Bp>&);
+
+template <class _Tp>
+decltype(__uses_allocator_detail::__fun(std::declval<_Tp>()), true_type()) __convertible_to_const_pair_ref_impl(int);
+
+template <class>
+false_type __convertible_to_const_pair_ref_impl(...);
+
+template <class _Tp>
+inline constexpr bool __convertible_to_const_pair_ref =
+    decltype(__uses_allocator_detail::__convertible_to_const_pair_ref_impl<_Tp>(0))::value;
+
+} // namespace __uses_allocator_detail
+
+template <
+    class _Pair,
+    class _Alloc,
+    class _Type,
+    __enable_if_t<__is_std_pair<_Pair> && !__uses_allocator_detail::__convertible_to_const_pair_ref<_Type>, int> = 0>
+_LIBCPP_HIDE_FROM_ABI constexpr auto
+__uses_allocator_construction_args(const _Alloc& __alloc, _Type&& __value) noexcept;
+
+template <class _Type, class _Alloc, class... _Args>
+_LIBCPP_HIDE_FROM_ABI constexpr _Type __make_obj_using_allocator(const _Alloc& __alloc, _Args&&... __args);
+
+template <class _Pair,
+          class _Alloc,
+          class _Type,
+          __enable_if_t<__is_std_pair<_Pair> && !__uses_allocator_detail::__convertible_to_const_pair_ref<_Type>, int>>
+_LIBCPP_HIDE_FROM_ABI constexpr auto
+__uses_allocator_construction_args(const _Alloc& __alloc, _Type&& __value) noexcept {
+  struct __pair_constructor {
+    using _PairMutable = remove_cv_t<_Pair>;
+
+    _LIBCPP_HIDE_FROM_ABI constexpr auto __do_construct(const _PairMutable& __pair) const {
+      return std::__make_obj_using_allocator<_PairMutable>(__alloc_, __pair);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr auto __do_construct(_PairMutable&& __pair) const {
+      return std::__make_obj_using_allocator<_PairMutable>(__alloc_, std::move(__pair));
+    }
+
+    const _Alloc& __alloc_;
+    _Type& __value_;
+
+    _LIBCPP_HIDE_FROM_ABI constexpr operator _PairMutable() const {
+      return __do_construct(std::forward<_Type>(this->__value_));
+    }
+  };
+
+  return std::make_tuple(__pair_constructor{__alloc, __value});
+}
+
+template <class _Type, class _Alloc, class... _Args>
+_LIBCPP_HIDE_FROM_ABI constexpr _Type __make_obj_using_allocator(const _Alloc& __alloc, _Args&&... __args) {
+  return std::make_from_tuple<_Type>(
+      std::__uses_allocator_construction_args<_Type>(__alloc, std::forward<_Args>(__args)...));
+}
+
+template <class _Type, class _Alloc, class... _Args>
+_LIBCPP_HIDE_FROM_ABI constexpr _Type*
+__uninitialized_construct_using_allocator(_Type* __ptr, const _Alloc& __alloc, _Args&&... __args) {
+  return std::apply(
+      [&__ptr](auto&&... __xs) { return std::__construct_at(__ptr, std::forward<decltype(__xs)>(__xs)...); },
+      std::__uses_allocator_construction_args<_Type>(__alloc, std::forward<_Args>(__args)...));
+}
+
+#endif // _LIBCPP_STD_VER >= 17
+
+#if _LIBCPP_STD_VER >= 20
+
+template <class _Type, class _Alloc, class... _Args>
+_LIBCPP_HIDE_FROM_ABI constexpr auto uses_allocator_construction_args(const _Alloc& __alloc, _Args&&... __args) noexcept
+    -> decltype(std::__uses_allocator_construction_args<_Type>(__alloc, std::forward<_Args>(__args)...)) {
+  return /*--*/ std::__uses_allocator_construction_args<_Type>(__alloc, std::forward<_Args>(__args)...);
+}
+
+template <class _Type, class _Alloc, class... _Args>
+_LIBCPP_HIDE_FROM_ABI constexpr auto make_obj_using_allocator(const _Alloc& __alloc, _Args&&... __args)
+    -> decltype(std::__make_obj_using_allocator<_Type>(__alloc, std::forward<_Args>(__args)...)) {
+  return /*--*/ std::__make_obj_using_allocator<_Type>(__alloc, std::forward<_Args>(__args)...);
+}
+
+template <class _Type, class _Alloc, class... _Args>
+_LIBCPP_HIDE_FROM_ABI constexpr auto
+uninitialized_construct_using_allocator(_Type* __ptr, const _Alloc& __alloc, _Args&&... __args)
+    -> decltype(std::__uninitialized_construct_using_allocator(__ptr, __alloc, std::forward<_Args>(__args)...)) {
+  return /*--*/ std::__uninitialized_construct_using_allocator(__ptr, __alloc, std::forward<_Args>(__args)...);
+}
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_USES_ALLOCATOR_CONSTRUCTION_H
diff --git a/app/src/main/cpp/libcxx/include/__memory/voidify.h b/app/src/main/cpp/libcxx/include/__memory/voidify.h
new file mode 100644
index 0000000..39e1034
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory/voidify.h
@@ -0,0 +1,30 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_VOIDIFY_H
+#define _LIBCPP___MEMORY_VOIDIFY_H
+
+#include <__config>
+#include <__memory/addressof.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <typename _Tp>
+_LIBCPP_ALWAYS_INLINE _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void* __voidify(_Tp& __from) {
+  // Cast away cv-qualifiers to allow modifying elements of a range through const iterators.
+  return const_cast<void*>(static_cast<const volatile void*>(_VSTD::addressof(__from)));
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___MEMORY_VOIDIFY_H
diff --git a/app/src/main/cpp/libcxx/include/__memory_resource/memory_resource.h b/app/src/main/cpp/libcxx/include/__memory_resource/memory_resource.h
new file mode 100644
index 0000000..02fdd08
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory_resource/memory_resource.h
@@ -0,0 +1,75 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_RESOURCE_MEMORY_RESOURCE_H
+#define _LIBCPP___MEMORY_RESOURCE_MEMORY_RESOURCE_H
+
+#include <__config>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 14
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace pmr {
+
+// [mem.res.class]
+
+class _LIBCPP_TYPE_VIS memory_resource {
+  static const size_t __max_align = alignof(max_align_t);
+
+public:
+  virtual ~memory_resource();
+
+  _LIBCPP_NODISCARD_AFTER_CXX17
+  [[using __gnu__: __returns_nonnull__, __alloc_size__(2), __alloc_align__(3)]] _LIBCPP_HIDE_FROM_ABI void*
+  allocate(size_t __bytes, size_t __align = __max_align) {
+    return do_allocate(__bytes, __align);
+  }
+
+  [[__gnu__::__nonnull__]] _LIBCPP_HIDE_FROM_ABI void
+  deallocate(void* __p, size_t __bytes, size_t __align = __max_align) {
+    do_deallocate(__p, __bytes, __align);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI bool is_equal(const memory_resource& __other) const noexcept { return do_is_equal(__other); }
+
+private:
+  virtual void* do_allocate(size_t, size_t)                       = 0;
+  virtual void do_deallocate(void*, size_t, size_t)               = 0;
+  virtual bool do_is_equal(memory_resource const&) const noexcept = 0;
+};
+
+// [mem.res.eq]
+
+inline _LIBCPP_HIDE_FROM_ABI bool operator==(const memory_resource& __lhs, const memory_resource& __rhs) noexcept {
+  return &__lhs == &__rhs || __lhs.is_equal(__rhs);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI bool operator!=(const memory_resource& __lhs, const memory_resource& __rhs) noexcept {
+  return !(__lhs == __rhs);
+}
+
+// [mem.res.global]
+
+[[__gnu__::__returns_nonnull__]] _LIBCPP_FUNC_VIS memory_resource* get_default_resource() noexcept;
+[[__gnu__::__returns_nonnull__]] _LIBCPP_FUNC_VIS memory_resource* set_default_resource(memory_resource*) noexcept;
+[[using __gnu__: __returns_nonnull__, __const__]] _LIBCPP_FUNC_VIS memory_resource* new_delete_resource() noexcept;
+[[using __gnu__: __returns_nonnull__, __const__]] _LIBCPP_FUNC_VIS memory_resource* null_memory_resource() noexcept;
+
+} // namespace pmr
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 14
+
+#endif // _LIBCPP___MEMORY_RESOURCE_MEMORY_RESOURCE_H
diff --git a/app/src/main/cpp/libcxx/include/__memory_resource/monotonic_buffer_resource.h b/app/src/main/cpp/libcxx/include/__memory_resource/monotonic_buffer_resource.h
new file mode 100644
index 0000000..5b0d246
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory_resource/monotonic_buffer_resource.h
@@ -0,0 +1,120 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_RESOURCE_MONOTONIC_BUFFER_RESOURCE_H
+#define _LIBCPP___MEMORY_RESOURCE_MONOTONIC_BUFFER_RESOURCE_H
+
+#include <__config>
+#include <__memory/addressof.h>
+#include <__memory_resource/memory_resource.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 14
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace pmr {
+
+// [mem.res.monotonic.buffer]
+
+class _LIBCPP_TYPE_VIS monotonic_buffer_resource : public memory_resource {
+  static const size_t __default_buffer_capacity  = 1024;
+  static const size_t __default_buffer_alignment = 16;
+
+  struct __chunk_footer {
+    __chunk_footer* __next_;
+    char* __start_;
+    char* __cur_;
+    size_t __align_;
+    size_t __allocation_size() { return (reinterpret_cast<char*>(this) - __start_) + sizeof(*this); }
+    void* __try_allocate_from_chunk(size_t, size_t);
+  };
+
+  struct __initial_descriptor {
+    char* __start_;
+    char* __cur_;
+    union {
+      char* __end_;
+      size_t __size_;
+    };
+    void* __try_allocate_from_chunk(size_t, size_t);
+  };
+
+public:
+  _LIBCPP_HIDE_FROM_ABI monotonic_buffer_resource()
+      : monotonic_buffer_resource(nullptr, __default_buffer_capacity, get_default_resource()) {}
+
+  _LIBCPP_HIDE_FROM_ABI explicit monotonic_buffer_resource(size_t __initial_size)
+      : monotonic_buffer_resource(nullptr, __initial_size, get_default_resource()) {}
+
+  _LIBCPP_HIDE_FROM_ABI monotonic_buffer_resource(void* __buffer, size_t __buffer_size)
+      : monotonic_buffer_resource(__buffer, __buffer_size, get_default_resource()) {}
+
+  _LIBCPP_HIDE_FROM_ABI explicit monotonic_buffer_resource(memory_resource* __upstream)
+      : monotonic_buffer_resource(nullptr, __default_buffer_capacity, __upstream) {}
+
+  _LIBCPP_HIDE_FROM_ABI monotonic_buffer_resource(size_t __initial_size, memory_resource* __upstream)
+      : monotonic_buffer_resource(nullptr, __initial_size, __upstream) {}
+
+  _LIBCPP_HIDE_FROM_ABI monotonic_buffer_resource(void* __buffer, size_t __buffer_size, memory_resource* __upstream)
+      : __res_(__upstream) {
+    __initial_.__start_ = static_cast<char*>(__buffer);
+    if (__buffer != nullptr) {
+      __initial_.__cur_ = static_cast<char*>(__buffer) + __buffer_size;
+      __initial_.__end_ = static_cast<char*>(__buffer) + __buffer_size;
+    } else {
+      __initial_.__cur_  = nullptr;
+      __initial_.__size_ = __buffer_size;
+    }
+    __chunks_ = nullptr;
+  }
+
+  monotonic_buffer_resource(const monotonic_buffer_resource&) = delete;
+
+  _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~monotonic_buffer_resource() override { release(); }
+
+  monotonic_buffer_resource& operator=(const monotonic_buffer_resource&) = delete;
+
+  _LIBCPP_HIDE_FROM_ABI void release() {
+    if (__initial_.__start_ != nullptr)
+      __initial_.__cur_ = __initial_.__end_;
+    while (__chunks_ != nullptr) {
+      __chunk_footer* __next = __chunks_->__next_;
+      __res_->deallocate(__chunks_->__start_, __chunks_->__allocation_size(), __chunks_->__align_);
+      __chunks_ = __next;
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI memory_resource* upstream_resource() const { return __res_; }
+
+protected:
+  void* do_allocate(size_t __bytes, size_t __alignment) override; // key function
+
+  _LIBCPP_HIDE_FROM_ABI_VIRTUAL void do_deallocate(void*, size_t, size_t) override {}
+
+  _LIBCPP_HIDE_FROM_ABI_VIRTUAL bool do_is_equal(const memory_resource& __other) const _NOEXCEPT override {
+    return this == std::addressof(__other);
+  }
+
+private:
+  __initial_descriptor __initial_;
+  __chunk_footer* __chunks_;
+  memory_resource* __res_;
+};
+
+} // namespace pmr
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 14
+
+#endif // _LIBCPP___MEMORY_RESOURCE_MONOTONIC_BUFFER_RESOURCE_H
diff --git a/app/src/main/cpp/libcxx/include/__memory_resource/polymorphic_allocator.h b/app/src/main/cpp/libcxx/include/__memory_resource/polymorphic_allocator.h
new file mode 100644
index 0000000..2489502
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory_resource/polymorphic_allocator.h
@@ -0,0 +1,224 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_RESOURCE_POLYMORPHIC_ALLOCATOR_H
+#define _LIBCPP___MEMORY_RESOURCE_POLYMORPHIC_ALLOCATOR_H
+
+#include <__assert>
+#include <__config>
+#include <__memory_resource/memory_resource.h>
+#include <__utility/exception_guard.h>
+#include <cstddef>
+#include <limits>
+#include <new>
+#include <stdexcept>
+#include <tuple>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+#if _LIBCPP_STD_VER > 14
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace pmr {
+
+// [mem.poly.allocator.class]
+
+template <class _ValueType
+#  if _LIBCPP_STD_VER >= 20
+          = byte
+#  endif
+          >
+class _LIBCPP_TEMPLATE_VIS polymorphic_allocator {
+
+public:
+  using value_type = _ValueType;
+
+  // [mem.poly.allocator.ctor]
+
+  _LIBCPP_HIDE_FROM_ABI polymorphic_allocator() noexcept : __res_(std::pmr::get_default_resource()) {}
+
+  _LIBCPP_HIDE_FROM_ABI polymorphic_allocator(memory_resource* __r) noexcept : __res_(__r) {}
+
+  polymorphic_allocator(const polymorphic_allocator&) = default;
+
+  template <class _Tp>
+  _LIBCPP_HIDE_FROM_ABI polymorphic_allocator(const polymorphic_allocator<_Tp>& __other) noexcept
+      : __res_(__other.resource()) {}
+
+  polymorphic_allocator& operator=(const polymorphic_allocator&) = delete;
+
+  // [mem.poly.allocator.mem]
+
+  _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI _ValueType* allocate(size_t __n) {
+    if (__n > __max_size()) {
+      __throw_bad_array_new_length();
+    }
+    return static_cast<_ValueType*>(__res_->allocate(__n * sizeof(_ValueType), alignof(_ValueType)));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI void deallocate(_ValueType* __p, size_t __n) {
+    _LIBCPP_ASSERT(__n <= __max_size(), "deallocate called for size which exceeds max_size()");
+    __res_->deallocate(__p, __n * sizeof(_ValueType), alignof(_ValueType));
+  }
+
+#  if _LIBCPP_STD_VER >= 20
+
+  [[nodiscard]] [[using __gnu__: __alloc_size__(2), __alloc_align__(3)]] void*
+  allocate_bytes(size_t __nbytes, size_t __alignment = alignof(max_align_t)) {
+    return __res_->allocate(__nbytes, __alignment);
+  }
+
+  void deallocate_bytes(void* __ptr, size_t __nbytes, size_t __alignment = alignof(max_align_t)) {
+    __res_->deallocate(__ptr, __nbytes, __alignment);
+  }
+
+  template <class _Type>
+  [[nodiscard]] _Type* allocate_object(size_t __n = 1) {
+    if (numeric_limits<size_t>::max() / sizeof(_Type) < __n)
+      std::__throw_bad_array_new_length();
+    return static_cast<_Type*>(allocate_bytes(__n * sizeof(_Type), alignof(_Type)));
+  }
+
+  template <class _Type>
+  void deallocate_object(_Type* __ptr, size_t __n = 1) {
+    deallocate_bytes(__ptr, __n * sizeof(_Type), alignof(_Type));
+  }
+
+  template <class _Type, class... _CtorArgs>
+  [[nodiscard]] _Type* new_object(_CtorArgs&&... __ctor_args) {
+    _Type* __ptr = allocate_object<_Type>();
+    __exception_guard __guard([&] { deallocate_object(__ptr); });
+    construct(__ptr, std::forward<_CtorArgs>(__ctor_args)...);
+    __guard.__complete();
+    return __ptr;
+  }
+
+  template <class _Type>
+  void delete_object(_Type* __ptr) {
+    destroy(__ptr);
+    deallocate_object(__ptr);
+  }
+
+#  endif // _LIBCPP_STD_VER >= 20
+
+  template <class _Tp, class... _Ts>
+  _LIBCPP_HIDE_FROM_ABI void construct(_Tp* __p, _Ts&&... __args) {
+    std::__user_alloc_construct_impl(
+        typename __uses_alloc_ctor<_Tp, polymorphic_allocator&, _Ts...>::type(),
+        __p,
+        *this,
+        std::forward<_Ts>(__args)...);
+  }
+
+  template <class _T1, class _T2, class... _Args1, class... _Args2>
+  _LIBCPP_HIDE_FROM_ABI void
+  construct(pair<_T1, _T2>* __p, piecewise_construct_t, tuple<_Args1...> __x, tuple<_Args2...> __y) {
+    ::new ((void*)__p) pair<_T1, _T2>(
+        piecewise_construct,
+        __transform_tuple(typename __uses_alloc_ctor< _T1, polymorphic_allocator&, _Args1... >::type(),
+                          std::move(__x),
+                          typename __make_tuple_indices<sizeof...(_Args1)>::type{}),
+        __transform_tuple(typename __uses_alloc_ctor< _T2, polymorphic_allocator&, _Args2... >::type(),
+                          std::move(__y),
+                          typename __make_tuple_indices<sizeof...(_Args2)>::type{}));
+  }
+
+  template <class _T1, class _T2>
+  _LIBCPP_HIDE_FROM_ABI void construct(pair<_T1, _T2>* __p) {
+    construct(__p, piecewise_construct, tuple<>(), tuple<>());
+  }
+
+  template <class _T1, class _T2, class _Up, class _Vp>
+  _LIBCPP_HIDE_FROM_ABI void construct(pair<_T1, _T2>* __p, _Up&& __u, _Vp&& __v) {
+    construct(__p,
+              piecewise_construct,
+              std::forward_as_tuple(std::forward<_Up>(__u)),
+              std::forward_as_tuple(std::forward<_Vp>(__v)));
+  }
+
+  template <class _T1, class _T2, class _U1, class _U2>
+  _LIBCPP_HIDE_FROM_ABI void construct(pair<_T1, _T2>* __p, const pair<_U1, _U2>& __pr) {
+    construct(__p, piecewise_construct, std::forward_as_tuple(__pr.first), std::forward_as_tuple(__pr.second));
+  }
+
+  template <class _T1, class _T2, class _U1, class _U2>
+  _LIBCPP_HIDE_FROM_ABI void construct(pair<_T1, _T2>* __p, pair<_U1, _U2>&& __pr) {
+    construct(__p,
+              piecewise_construct,
+              std::forward_as_tuple(std::forward<_U1>(__pr.first)),
+              std::forward_as_tuple(std::forward<_U2>(__pr.second)));
+  }
+
+  template <class _Tp>
+  _LIBCPP_HIDE_FROM_ABI void destroy(_Tp* __p) {
+    __p->~_Tp();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI polymorphic_allocator select_on_container_copy_construction() const noexcept {
+    return polymorphic_allocator();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI memory_resource* resource() const noexcept { return __res_; }
+
+private:
+  template <class... _Args, size_t... _Is>
+  _LIBCPP_HIDE_FROM_ABI tuple<_Args&&...>
+  __transform_tuple(integral_constant<int, 0>, tuple<_Args...>&& __t, __tuple_indices<_Is...>) {
+    return std::forward_as_tuple(std::get<_Is>(std::move(__t))...);
+  }
+
+  template <class... _Args, size_t... _Is>
+  _LIBCPP_HIDE_FROM_ABI tuple<allocator_arg_t const&, polymorphic_allocator&, _Args&&...>
+  __transform_tuple(integral_constant<int, 1>, tuple<_Args...>&& __t, __tuple_indices<_Is...>) {
+    using _Tup = tuple<allocator_arg_t const&, polymorphic_allocator&, _Args&&...>;
+    return _Tup(allocator_arg, *this, std::get<_Is>(std::move(__t))...);
+  }
+
+  template <class... _Args, size_t... _Is>
+  _LIBCPP_HIDE_FROM_ABI tuple<_Args&&..., polymorphic_allocator&>
+  __transform_tuple(integral_constant<int, 2>, tuple<_Args...>&& __t, __tuple_indices<_Is...>) {
+    using _Tup = tuple<_Args&&..., polymorphic_allocator&>;
+    return _Tup(std::get<_Is>(std::move(__t))..., *this);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI size_t __max_size() const noexcept {
+    return numeric_limits<size_t>::max() / sizeof(value_type);
+  }
+
+  memory_resource* __res_;
+};
+
+// [mem.poly.allocator.eq]
+
+template <class _Tp, class _Up>
+inline _LIBCPP_HIDE_FROM_ABI bool
+operator==(const polymorphic_allocator<_Tp>& __lhs, const polymorphic_allocator<_Up>& __rhs) noexcept {
+  return *__lhs.resource() == *__rhs.resource();
+}
+
+template <class _Tp, class _Up>
+inline _LIBCPP_HIDE_FROM_ABI bool
+operator!=(const polymorphic_allocator<_Tp>& __lhs, const polymorphic_allocator<_Up>& __rhs) noexcept {
+  return !(__lhs == __rhs);
+}
+
+} // namespace pmr
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___MEMORY_RESOURCE_POLYMORPHIC_ALLOCATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__memory_resource/pool_options.h b/app/src/main/cpp/libcxx/include/__memory_resource/pool_options.h
new file mode 100644
index 0000000..11585a0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory_resource/pool_options.h
@@ -0,0 +1,38 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_RESOURCE_POOL_OPTIONS_H
+#define _LIBCPP___MEMORY_RESOURCE_POOL_OPTIONS_H
+
+#include <__config>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 14
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace pmr {
+
+// [mem.res.pool.options]
+
+struct _LIBCPP_TYPE_VIS pool_options {
+  size_t max_blocks_per_chunk        = 0;
+  size_t largest_required_pool_block = 0;
+};
+
+} // namespace pmr
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 14
+
+#endif // _LIBCPP___MEMORY_RESOURCE_POOL_OPTIONS_H
diff --git a/app/src/main/cpp/libcxx/include/__memory_resource/synchronized_pool_resource.h b/app/src/main/cpp/libcxx/include/__memory_resource/synchronized_pool_resource.h
new file mode 100644
index 0000000..1877147
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory_resource/synchronized_pool_resource.h
@@ -0,0 +1,94 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_RESOURCE_SYNCHRONIZED_POOL_RESOURCE_H
+#define _LIBCPP___MEMORY_RESOURCE_SYNCHRONIZED_POOL_RESOURCE_H
+
+#include <__config>
+#include <__memory_resource/memory_resource.h>
+#include <__memory_resource/pool_options.h>
+#include <__memory_resource/unsynchronized_pool_resource.h>
+#include <cstddef>
+#if !defined(_LIBCPP_HAS_NO_THREADS)
+#  include <mutex>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 14
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace pmr {
+
+// [mem.res.pool.overview]
+
+class _LIBCPP_TYPE_VIS synchronized_pool_resource : public memory_resource {
+public:
+  _LIBCPP_HIDE_FROM_ABI synchronized_pool_resource(const pool_options& __opts, memory_resource* __upstream)
+      : __unsync_(__opts, __upstream) {}
+
+  _LIBCPP_HIDE_FROM_ABI synchronized_pool_resource()
+      : synchronized_pool_resource(pool_options(), get_default_resource()) {}
+
+  _LIBCPP_HIDE_FROM_ABI explicit synchronized_pool_resource(memory_resource* __upstream)
+      : synchronized_pool_resource(pool_options(), __upstream) {}
+
+  _LIBCPP_HIDE_FROM_ABI explicit synchronized_pool_resource(const pool_options& __opts)
+      : synchronized_pool_resource(__opts, get_default_resource()) {}
+
+  synchronized_pool_resource(const synchronized_pool_resource&) = delete;
+
+  ~synchronized_pool_resource() override = default;
+
+  synchronized_pool_resource& operator=(const synchronized_pool_resource&) = delete;
+
+  _LIBCPP_HIDE_FROM_ABI void release() {
+#  if !defined(_LIBCPP_HAS_NO_THREADS)
+    unique_lock<mutex> __lk(__mut_);
+#  endif
+    __unsync_.release();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI memory_resource* upstream_resource() const { return __unsync_.upstream_resource(); }
+
+  _LIBCPP_HIDE_FROM_ABI pool_options options() const { return __unsync_.options(); }
+
+protected:
+  _LIBCPP_HIDE_FROM_ABI_VIRTUAL void* do_allocate(size_t __bytes, size_t __align) override {
+#  if !defined(_LIBCPP_HAS_NO_THREADS)
+    unique_lock<mutex> __lk(__mut_);
+#  endif
+    return __unsync_.allocate(__bytes, __align);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI_VIRTUAL void do_deallocate(void* __p, size_t __bytes, size_t __align) override {
+#  if !defined(_LIBCPP_HAS_NO_THREADS)
+    unique_lock<mutex> __lk(__mut_);
+#  endif
+    return __unsync_.deallocate(__p, __bytes, __align);
+  }
+
+  bool do_is_equal(const memory_resource& __other) const noexcept override; // key function
+
+private:
+#  if !defined(_LIBCPP_HAS_NO_THREADS)
+  mutex __mut_;
+#  endif
+  unsynchronized_pool_resource __unsync_;
+};
+
+} // namespace pmr
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 14
+
+#endif // _LIBCPP___MEMORY_RESOURCE_SYNCHRONIZED_POOL_RESOURCE_H
diff --git a/app/src/main/cpp/libcxx/include/__memory_resource/unsynchronized_pool_resource.h b/app/src/main/cpp/libcxx/include/__memory_resource/unsynchronized_pool_resource.h
new file mode 100644
index 0000000..91d38aa
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__memory_resource/unsynchronized_pool_resource.h
@@ -0,0 +1,106 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MEMORY_RESOURCE_UNSYNCHRONIZED_POOL_RESOURCE_H
+#define _LIBCPP___MEMORY_RESOURCE_UNSYNCHRONIZED_POOL_RESOURCE_H
+
+#include <__config>
+#include <__memory_resource/memory_resource.h>
+#include <__memory_resource/pool_options.h>
+#include <cstddef>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 14
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace pmr {
+
+// [mem.res.pool.overview]
+
+class _LIBCPP_TYPE_VIS unsynchronized_pool_resource : public memory_resource {
+  class __fixed_pool;
+
+  class __adhoc_pool {
+    struct __chunk_footer;
+    __chunk_footer* __first_;
+
+  public:
+    _LIBCPP_HIDE_FROM_ABI explicit __adhoc_pool() : __first_(nullptr) {}
+
+    void __release_ptr(memory_resource* __upstream);
+    void* __do_allocate(memory_resource* __upstream, size_t __bytes, size_t __align);
+    void __do_deallocate(memory_resource* __upstream, void* __p, size_t __bytes, size_t __align);
+  };
+
+  static const size_t __min_blocks_per_chunk = 16;
+  static const size_t __min_bytes_per_chunk  = 1024;
+  static const size_t __max_blocks_per_chunk = (size_t(1) << 20);
+  static const size_t __max_bytes_per_chunk  = (size_t(1) << 30);
+
+  static const int __log2_smallest_block_size      = 3;
+  static const size_t __smallest_block_size        = 8;
+  static const size_t __default_largest_block_size = (size_t(1) << 20);
+  static const size_t __max_largest_block_size     = (size_t(1) << 30);
+
+  size_t __pool_block_size(int __i) const;
+  int __log2_pool_block_size(int __i) const;
+  int __pool_index(size_t __bytes, size_t __align) const;
+
+public:
+  unsynchronized_pool_resource(const pool_options& __opts, memory_resource* __upstream);
+
+  _LIBCPP_HIDE_FROM_ABI unsynchronized_pool_resource()
+      : unsynchronized_pool_resource(pool_options(), get_default_resource()) {}
+
+  _LIBCPP_HIDE_FROM_ABI explicit unsynchronized_pool_resource(memory_resource* __upstream)
+      : unsynchronized_pool_resource(pool_options(), __upstream) {}
+
+  _LIBCPP_HIDE_FROM_ABI explicit unsynchronized_pool_resource(const pool_options& __opts)
+      : unsynchronized_pool_resource(__opts, get_default_resource()) {}
+
+  unsynchronized_pool_resource(const unsynchronized_pool_resource&) = delete;
+
+  _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~unsynchronized_pool_resource() override { release(); }
+
+  unsynchronized_pool_resource& operator=(const unsynchronized_pool_resource&) = delete;
+
+  void release();
+
+  _LIBCPP_HIDE_FROM_ABI memory_resource* upstream_resource() const { return __res_; }
+
+  [[__gnu__::__pure__]] pool_options options() const;
+
+protected:
+  void* do_allocate(size_t __bytes, size_t __align) override; // key function
+
+  void do_deallocate(void* __p, size_t __bytes, size_t __align) override;
+
+  _LIBCPP_HIDE_FROM_ABI_VIRTUAL bool do_is_equal(const memory_resource& __other) const _NOEXCEPT override {
+    return &__other == this;
+  }
+
+private:
+  memory_resource* __res_;
+  __adhoc_pool __adhoc_pool_;
+  __fixed_pool* __fixed_pools_;
+  int __num_fixed_pools_;
+  uint32_t __options_max_blocks_per_chunk_;
+};
+
+} // namespace pmr
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 14
+
+#endif // _LIBCPP___MEMORY_RESOURCE_UNSYNCHRONIZED_POOL_RESOURCE_H
diff --git a/app/src/main/cpp/libcxx/include/__mutex_base b/app/src/main/cpp/libcxx/include/__mutex_base
new file mode 100644
index 0000000..82d9fa6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__mutex_base
@@ -0,0 +1,523 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___MUTEX_BASE
+#define _LIBCPP___MUTEX_BASE
+
+#include <__chrono/duration.h>
+#include <__chrono/steady_clock.h>
+#include <__chrono/system_clock.h>
+#include <__chrono/time_point.h>
+#include <__config>
+#include <__threading_support>
+#include <ratio>
+#include <system_error>
+#include <time.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#ifndef _LIBCPP_HAS_NO_THREADS
+
+class _LIBCPP_TYPE_VIS _LIBCPP_THREAD_SAFETY_ANNOTATION(capability("mutex")) mutex
+{
+    __libcpp_mutex_t __m_ = _LIBCPP_MUTEX_INITIALIZER;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR mutex() = default;
+
+    mutex(const mutex&) = delete;
+    mutex& operator=(const mutex&) = delete;
+
+#if defined(_LIBCPP_HAS_TRIVIAL_MUTEX_DESTRUCTION)
+    ~mutex() = default;
+#else
+    ~mutex() _NOEXCEPT;
+#endif
+
+    void lock() _LIBCPP_THREAD_SAFETY_ANNOTATION(acquire_capability());
+    bool try_lock() _NOEXCEPT _LIBCPP_THREAD_SAFETY_ANNOTATION(try_acquire_capability(true));
+    void unlock() _NOEXCEPT _LIBCPP_THREAD_SAFETY_ANNOTATION(release_capability());
+
+    typedef __libcpp_mutex_t* native_handle_type;
+    _LIBCPP_INLINE_VISIBILITY native_handle_type native_handle() {return &__m_;}
+};
+
+static_assert(is_nothrow_default_constructible<mutex>::value,
+              "the default constructor for std::mutex must be nothrow");
+
+struct _LIBCPP_TYPE_VIS defer_lock_t { explicit defer_lock_t() = default; };
+struct _LIBCPP_TYPE_VIS try_to_lock_t { explicit try_to_lock_t() = default; };
+struct _LIBCPP_TYPE_VIS adopt_lock_t { explicit adopt_lock_t() = default; };
+
+#if defined(_LIBCPP_CXX03_LANG) || defined(_LIBCPP_BUILDING_LIBRARY)
+
+extern _LIBCPP_EXPORTED_FROM_ABI const defer_lock_t  defer_lock;
+extern _LIBCPP_EXPORTED_FROM_ABI const try_to_lock_t try_to_lock;
+extern _LIBCPP_EXPORTED_FROM_ABI const adopt_lock_t  adopt_lock;
+
+#else
+
+/* inline */ constexpr defer_lock_t  defer_lock  = defer_lock_t();
+/* inline */ constexpr try_to_lock_t try_to_lock = try_to_lock_t();
+/* inline */ constexpr adopt_lock_t  adopt_lock  = adopt_lock_t();
+
+#endif
+
+template <class _Mutex>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_THREAD_SAFETY_ANNOTATION(scoped_lockable)
+lock_guard
+{
+public:
+    typedef _Mutex mutex_type;
+
+private:
+    mutex_type& __m_;
+public:
+
+    _LIBCPP_NODISCARD_EXT _LIBCPP_INLINE_VISIBILITY
+    explicit lock_guard(mutex_type& __m) _LIBCPP_THREAD_SAFETY_ANNOTATION(acquire_capability(__m))
+        : __m_(__m) {__m_.lock();}
+
+    _LIBCPP_NODISCARD_EXT _LIBCPP_INLINE_VISIBILITY
+    lock_guard(mutex_type& __m, adopt_lock_t) _LIBCPP_THREAD_SAFETY_ANNOTATION(requires_capability(__m))
+        : __m_(__m) {}
+    _LIBCPP_INLINE_VISIBILITY
+    ~lock_guard() _LIBCPP_THREAD_SAFETY_ANNOTATION(release_capability()) {__m_.unlock();}
+
+private:
+    lock_guard(lock_guard const&) = delete;
+    lock_guard& operator=(lock_guard const&) = delete;
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(lock_guard);
+
+template <class _Mutex>
+class _LIBCPP_TEMPLATE_VIS unique_lock
+{
+public:
+    typedef _Mutex mutex_type;
+
+private:
+    mutex_type* __m_;
+    bool __owns_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    unique_lock() _NOEXCEPT : __m_(nullptr), __owns_(false) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit unique_lock(mutex_type& __m)
+        : __m_(_VSTD::addressof(__m)), __owns_(true) {__m_->lock();}
+    _LIBCPP_INLINE_VISIBILITY
+    unique_lock(mutex_type& __m, defer_lock_t) _NOEXCEPT
+        : __m_(_VSTD::addressof(__m)), __owns_(false) {}
+    _LIBCPP_INLINE_VISIBILITY
+    unique_lock(mutex_type& __m, try_to_lock_t)
+        : __m_(_VSTD::addressof(__m)), __owns_(__m.try_lock()) {}
+    _LIBCPP_INLINE_VISIBILITY
+    unique_lock(mutex_type& __m, adopt_lock_t)
+        : __m_(_VSTD::addressof(__m)), __owns_(true) {}
+    template <class _Clock, class _Duration>
+    _LIBCPP_INLINE_VISIBILITY
+        unique_lock(mutex_type& __m, const chrono::time_point<_Clock, _Duration>& __t)
+            : __m_(_VSTD::addressof(__m)), __owns_(__m.try_lock_until(__t)) {}
+    template <class _Rep, class _Period>
+    _LIBCPP_INLINE_VISIBILITY
+        unique_lock(mutex_type& __m, const chrono::duration<_Rep, _Period>& __d)
+            : __m_(_VSTD::addressof(__m)), __owns_(__m.try_lock_for(__d)) {}
+    _LIBCPP_INLINE_VISIBILITY
+    ~unique_lock()
+    {
+        if (__owns_)
+            __m_->unlock();
+    }
+
+    unique_lock(unique_lock const&) = delete;
+    unique_lock& operator=(unique_lock const&) = delete;
+
+    _LIBCPP_INLINE_VISIBILITY
+    unique_lock(unique_lock&& __u) _NOEXCEPT
+        : __m_(__u.__m_), __owns_(__u.__owns_)
+        {__u.__m_ = nullptr; __u.__owns_ = false;}
+    _LIBCPP_INLINE_VISIBILITY
+    unique_lock& operator=(unique_lock&& __u) _NOEXCEPT
+        {
+            if (__owns_)
+                __m_->unlock();
+            __m_ = __u.__m_;
+            __owns_ = __u.__owns_;
+            __u.__m_ = nullptr;
+            __u.__owns_ = false;
+            return *this;
+        }
+
+    void lock();
+    bool try_lock();
+
+    template <class _Rep, class _Period>
+        bool try_lock_for(const chrono::duration<_Rep, _Period>& __d);
+    template <class _Clock, class _Duration>
+        bool try_lock_until(const chrono::time_point<_Clock, _Duration>& __t);
+
+    void unlock();
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(unique_lock& __u) _NOEXCEPT
+    {
+        _VSTD::swap(__m_, __u.__m_);
+        _VSTD::swap(__owns_, __u.__owns_);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    mutex_type* release() _NOEXCEPT
+    {
+        mutex_type* __m = __m_;
+        __m_ = nullptr;
+        __owns_ = false;
+        return __m;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool owns_lock() const _NOEXCEPT {return __owns_;}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit operator bool() const _NOEXCEPT {return __owns_;}
+    _LIBCPP_INLINE_VISIBILITY
+    mutex_type* mutex() const _NOEXCEPT {return __m_;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(unique_lock);
+
+template <class _Mutex>
+void
+unique_lock<_Mutex>::lock()
+{
+    if (__m_ == nullptr)
+        __throw_system_error(EPERM, "unique_lock::lock: references null mutex");
+    if (__owns_)
+        __throw_system_error(EDEADLK, "unique_lock::lock: already locked");
+    __m_->lock();
+    __owns_ = true;
+}
+
+template <class _Mutex>
+bool
+unique_lock<_Mutex>::try_lock()
+{
+    if (__m_ == nullptr)
+        __throw_system_error(EPERM, "unique_lock::try_lock: references null mutex");
+    if (__owns_)
+        __throw_system_error(EDEADLK, "unique_lock::try_lock: already locked");
+    __owns_ = __m_->try_lock();
+    return __owns_;
+}
+
+template <class _Mutex>
+template <class _Rep, class _Period>
+bool
+unique_lock<_Mutex>::try_lock_for(const chrono::duration<_Rep, _Period>& __d)
+{
+    if (__m_ == nullptr)
+        __throw_system_error(EPERM, "unique_lock::try_lock_for: references null mutex");
+    if (__owns_)
+        __throw_system_error(EDEADLK, "unique_lock::try_lock_for: already locked");
+    __owns_ = __m_->try_lock_for(__d);
+    return __owns_;
+}
+
+template <class _Mutex>
+template <class _Clock, class _Duration>
+bool
+unique_lock<_Mutex>::try_lock_until(const chrono::time_point<_Clock, _Duration>& __t)
+{
+    if (__m_ == nullptr)
+        __throw_system_error(EPERM, "unique_lock::try_lock_until: references null mutex");
+    if (__owns_)
+        __throw_system_error(EDEADLK, "unique_lock::try_lock_until: already locked");
+    __owns_ = __m_->try_lock_until(__t);
+    return __owns_;
+}
+
+template <class _Mutex>
+void
+unique_lock<_Mutex>::unlock()
+{
+    if (!__owns_)
+        __throw_system_error(EPERM, "unique_lock::unlock: not locked");
+    __m_->unlock();
+    __owns_ = false;
+}
+
+template <class _Mutex>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(unique_lock<_Mutex>& __x, unique_lock<_Mutex>& __y) _NOEXCEPT
+    {__x.swap(__y);}
+
+//enum class cv_status
+_LIBCPP_DECLARE_STRONG_ENUM(cv_status)
+{
+    no_timeout,
+    timeout
+};
+_LIBCPP_DECLARE_STRONG_ENUM_EPILOG(cv_status)
+
+class _LIBCPP_TYPE_VIS condition_variable
+{
+    __libcpp_condvar_t __cv_ = _LIBCPP_CONDVAR_INITIALIZER;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR condition_variable() _NOEXCEPT = default;
+
+#ifdef _LIBCPP_HAS_TRIVIAL_CONDVAR_DESTRUCTION
+    ~condition_variable() = default;
+#else
+    ~condition_variable();
+#endif
+
+    condition_variable(const condition_variable&) = delete;
+    condition_variable& operator=(const condition_variable&) = delete;
+
+    void notify_one() _NOEXCEPT;
+    void notify_all() _NOEXCEPT;
+
+    void wait(unique_lock<mutex>& __lk) _NOEXCEPT;
+    template <class _Predicate>
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        void wait(unique_lock<mutex>& __lk, _Predicate __pred);
+
+    template <class _Clock, class _Duration>
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        cv_status
+        wait_until(unique_lock<mutex>& __lk,
+                   const chrono::time_point<_Clock, _Duration>& __t);
+
+    template <class _Clock, class _Duration, class _Predicate>
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        bool
+        wait_until(unique_lock<mutex>& __lk,
+                   const chrono::time_point<_Clock, _Duration>& __t,
+                   _Predicate __pred);
+
+    template <class _Rep, class _Period>
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        cv_status
+        wait_for(unique_lock<mutex>& __lk,
+                 const chrono::duration<_Rep, _Period>& __d);
+
+    template <class _Rep, class _Period, class _Predicate>
+        bool
+        _LIBCPP_INLINE_VISIBILITY
+        wait_for(unique_lock<mutex>& __lk,
+                 const chrono::duration<_Rep, _Period>& __d,
+                 _Predicate __pred);
+
+    typedef __libcpp_condvar_t* native_handle_type;
+    _LIBCPP_INLINE_VISIBILITY native_handle_type native_handle() {return &__cv_;}
+
+private:
+    void __do_timed_wait(unique_lock<mutex>& __lk,
+       chrono::time_point<chrono::system_clock, chrono::nanoseconds>) _NOEXCEPT;
+#if defined(_LIBCPP_HAS_COND_CLOCKWAIT)
+    void __do_timed_wait(unique_lock<mutex>& __lk,
+       chrono::time_point<chrono::steady_clock, chrono::nanoseconds>) _NOEXCEPT;
+#endif
+    template <class _Clock>
+    void __do_timed_wait(unique_lock<mutex>& __lk,
+       chrono::time_point<_Clock, chrono::nanoseconds>) _NOEXCEPT;
+};
+#endif // !_LIBCPP_HAS_NO_THREADS
+
+template <class _Rep, class _Period>
+inline _LIBCPP_INLINE_VISIBILITY
+__enable_if_t<is_floating_point<_Rep>::value, chrono::nanoseconds>
+__safe_nanosecond_cast(chrono::duration<_Rep, _Period> __d)
+{
+    using namespace chrono;
+    using __ratio = ratio_divide<_Period, nano>;
+    using __ns_rep = nanoseconds::rep;
+    _Rep __result_float = __d.count() * __ratio::num / __ratio::den;
+
+    _Rep __result_max = numeric_limits<__ns_rep>::max();
+    if (__result_float >= __result_max) {
+        return nanoseconds::max();
+    }
+
+    _Rep __result_min = numeric_limits<__ns_rep>::min();
+    if (__result_float <= __result_min) {
+        return nanoseconds::min();
+    }
+
+    return nanoseconds(static_cast<__ns_rep>(__result_float));
+}
+
+template <class _Rep, class _Period>
+inline _LIBCPP_INLINE_VISIBILITY
+__enable_if_t<!is_floating_point<_Rep>::value, chrono::nanoseconds>
+__safe_nanosecond_cast(chrono::duration<_Rep, _Period> __d)
+{
+    using namespace chrono;
+    if (__d.count() == 0) {
+        return nanoseconds(0);
+    }
+
+    using __ratio = ratio_divide<_Period, nano>;
+    using __ns_rep = nanoseconds::rep;
+    __ns_rep __result_max = numeric_limits<__ns_rep>::max();
+    if (__d.count() > 0 && __d.count() > __result_max / __ratio::num) {
+        return nanoseconds::max();
+    }
+
+    __ns_rep __result_min = numeric_limits<__ns_rep>::min();
+    if (__d.count() < 0 && __d.count() < __result_min / __ratio::num) {
+        return nanoseconds::min();
+    }
+
+    __ns_rep __result = __d.count() * __ratio::num / __ratio::den;
+    if (__result == 0) {
+        return nanoseconds(1);
+    }
+
+    return nanoseconds(__result);
+}
+
+#ifndef _LIBCPP_HAS_NO_THREADS
+template <class _Predicate>
+void
+condition_variable::wait(unique_lock<mutex>& __lk, _Predicate __pred)
+{
+    while (!__pred())
+        wait(__lk);
+}
+
+template <class _Clock, class _Duration>
+cv_status
+condition_variable::wait_until(unique_lock<mutex>& __lk,
+                               const chrono::time_point<_Clock, _Duration>& __t)
+{
+    using namespace chrono;
+    using __clock_tp_ns = time_point<_Clock, nanoseconds>;
+
+    typename _Clock::time_point __now = _Clock::now();
+    if (__t <= __now)
+        return cv_status::timeout;
+
+    __clock_tp_ns __t_ns = __clock_tp_ns(_VSTD::__safe_nanosecond_cast(__t.time_since_epoch()));
+
+    __do_timed_wait(__lk, __t_ns);
+    return _Clock::now() < __t ? cv_status::no_timeout : cv_status::timeout;
+}
+
+template <class _Clock, class _Duration, class _Predicate>
+bool
+condition_variable::wait_until(unique_lock<mutex>& __lk,
+                   const chrono::time_point<_Clock, _Duration>& __t,
+                   _Predicate __pred)
+{
+    while (!__pred())
+    {
+        if (wait_until(__lk, __t) == cv_status::timeout)
+            return __pred();
+    }
+    return true;
+}
+
+template <class _Rep, class _Period>
+cv_status
+condition_variable::wait_for(unique_lock<mutex>& __lk,
+                             const chrono::duration<_Rep, _Period>& __d)
+{
+    using namespace chrono;
+    if (__d <= __d.zero())
+        return cv_status::timeout;
+    using __ns_rep = nanoseconds::rep;
+    steady_clock::time_point __c_now = steady_clock::now();
+
+#if defined(_LIBCPP_HAS_COND_CLOCKWAIT)
+    using __clock_tp_ns = time_point<steady_clock, nanoseconds>;
+    __ns_rep __now_count_ns = _VSTD::__safe_nanosecond_cast(__c_now.time_since_epoch()).count();
+#else
+    using __clock_tp_ns = time_point<system_clock, nanoseconds>;
+    __ns_rep __now_count_ns = _VSTD::__safe_nanosecond_cast(system_clock::now().time_since_epoch()).count();
+#endif
+
+    __ns_rep __d_ns_count = _VSTD::__safe_nanosecond_cast(__d).count();
+
+    if (__now_count_ns > numeric_limits<__ns_rep>::max() - __d_ns_count) {
+        __do_timed_wait(__lk, __clock_tp_ns::max());
+    } else {
+        __do_timed_wait(__lk, __clock_tp_ns(nanoseconds(__now_count_ns + __d_ns_count)));
+    }
+
+    return steady_clock::now() - __c_now < __d ? cv_status::no_timeout :
+                                                 cv_status::timeout;
+}
+
+template <class _Rep, class _Period, class _Predicate>
+inline
+bool
+condition_variable::wait_for(unique_lock<mutex>& __lk,
+                             const chrono::duration<_Rep, _Period>& __d,
+                             _Predicate __pred)
+{
+    return wait_until(__lk, chrono::steady_clock::now() + __d,
+                      _VSTD::move(__pred));
+}
+
+#if defined(_LIBCPP_HAS_COND_CLOCKWAIT)
+inline
+void
+condition_variable::__do_timed_wait(unique_lock<mutex>& __lk,
+     chrono::time_point<chrono::steady_clock, chrono::nanoseconds> __tp) _NOEXCEPT
+{
+    using namespace chrono;
+    if (!__lk.owns_lock())
+        __throw_system_error(EPERM,
+                            "condition_variable::timed wait: mutex not locked");
+    nanoseconds __d = __tp.time_since_epoch();
+    timespec __ts;
+    seconds __s = duration_cast<seconds>(__d);
+    using __ts_sec = decltype(__ts.tv_sec);
+    const __ts_sec __ts_sec_max = numeric_limits<__ts_sec>::max();
+    if (__s.count() < __ts_sec_max)
+    {
+        __ts.tv_sec = static_cast<__ts_sec>(__s.count());
+        __ts.tv_nsec = (__d - __s).count();
+    }
+    else
+    {
+        __ts.tv_sec = __ts_sec_max;
+        __ts.tv_nsec = giga::num - 1;
+    }
+    int __ec = pthread_cond_clockwait(&__cv_, __lk.mutex()->native_handle(), CLOCK_MONOTONIC, &__ts);
+    if (__ec != 0 && __ec != ETIMEDOUT)
+        __throw_system_error(__ec, "condition_variable timed_wait failed");
+}
+#endif // _LIBCPP_HAS_COND_CLOCKWAIT
+
+template <class _Clock>
+inline
+void
+condition_variable::__do_timed_wait(unique_lock<mutex>& __lk,
+     chrono::time_point<_Clock, chrono::nanoseconds> __tp) _NOEXCEPT
+{
+    wait_for(__lk, __tp - _Clock::now());
+}
+
+#endif // !_LIBCPP_HAS_NO_THREADS
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___MUTEX_BASE
diff --git a/app/src/main/cpp/libcxx/include/__node_handle b/app/src/main/cpp/libcxx/include/__node_handle
new file mode 100644
index 0000000..bc49272
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__node_handle
@@ -0,0 +1,254 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NODE_HANDLE
+#define _LIBCPP___NODE_HANDLE
+
+/*
+
+template<unspecified>
+class node-handle {
+public:
+  using value_type     = see below;     // not present for map containers
+  using key_type       = see below;     // not present for set containers
+  using mapped_type    = see below;     // not present for set containers
+  using allocator_type = see below;
+
+private:
+  using container_node_type = unspecified;                  // exposition only
+  using ator_traits = allocator_traits<allocator_type>;     // exposition only
+
+  typename ator_traits::template
+    rebind_traits<container_node_type>::pointer ptr_;       // exposition only
+  optional<allocator_type> alloc_;                          // exposition only
+
+public:
+  // [container.node.cons], constructors, copy, and assignment
+  constexpr node-handle() noexcept : ptr_(), alloc_() {}
+  node-handle(node-handle&&) noexcept;
+  node-handle& operator=(node-handle&&);
+
+  // [container.node.dtor], destructor
+  ~node-handle();
+
+  // [container.node.observers], observers
+  value_type& value() const;            // not present for map containers
+  key_type& key() const;                // not present for set containers
+  mapped_type& mapped() const;          // not present for set containers
+
+  allocator_type get_allocator() const;
+  explicit operator bool() const noexcept;
+  [[nodiscard]] bool empty() const noexcept; // nodiscard since C++20
+
+  // [container.node.modifiers], modifiers
+  void swap(node-handle&)
+    noexcept(ator_traits::propagate_on_container_swap::value ||
+             ator_traits::is_always_equal::value);
+
+  friend void swap(node-handle& x, node-handle& y) noexcept(noexcept(x.swap(y))) {
+    x.swap(y);
+  }
+};
+
+*/
+
+#include <__assert>
+#include <__config>
+#include <__memory/allocator_traits.h>
+#include <__memory/pointer_traits.h>
+#include <optional>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+// Specialized in __tree & __hash_table for their _NodeType.
+template <class _NodeType, class _Alloc>
+struct __generic_container_node_destructor;
+
+template <class _NodeType, class _Alloc,
+          template <class, class> class _MapOrSetSpecifics>
+class _LIBCPP_TEMPLATE_VIS __basic_node_handle
+    : public _MapOrSetSpecifics<
+          _NodeType,
+          __basic_node_handle<_NodeType, _Alloc, _MapOrSetSpecifics>>
+{
+    template <class _Tp, class _Compare, class _Allocator>
+        friend class __tree;
+    template <class _Tp, class _Hash, class _Equal, class _Allocator>
+        friend class __hash_table;
+    friend struct _MapOrSetSpecifics<
+        _NodeType, __basic_node_handle<_NodeType, _Alloc, _MapOrSetSpecifics>>;
+
+    typedef allocator_traits<_Alloc> __alloc_traits;
+    typedef __rebind_pointer_t<typename __alloc_traits::void_pointer,
+                                      _NodeType>
+        __node_pointer_type;
+
+public:
+    typedef _Alloc allocator_type;
+
+private:
+    __node_pointer_type __ptr_ = nullptr;
+    optional<allocator_type> __alloc_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __release_ptr()
+    {
+        __ptr_ = nullptr;
+        __alloc_ = _VSTD::nullopt;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __destroy_node_pointer()
+    {
+        if (__ptr_ != nullptr)
+        {
+            typedef typename __allocator_traits_rebind<
+                allocator_type, _NodeType>::type __node_alloc_type;
+            __node_alloc_type __alloc(*__alloc_);
+            __generic_container_node_destructor<_NodeType, __node_alloc_type>(
+                __alloc, true)(__ptr_);
+            __ptr_ = nullptr;
+        }
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __basic_node_handle(__node_pointer_type __ptr,
+                        allocator_type const& __alloc)
+            : __ptr_(__ptr), __alloc_(__alloc)
+    {
+    }
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __basic_node_handle() = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __basic_node_handle(__basic_node_handle&& __other) noexcept
+            : __ptr_(__other.__ptr_),
+              __alloc_(_VSTD::move(__other.__alloc_))
+    {
+        __other.__ptr_ = nullptr;
+        __other.__alloc_ = _VSTD::nullopt;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __basic_node_handle& operator=(__basic_node_handle&& __other)
+    {
+        _LIBCPP_ASSERT(
+            __alloc_ == _VSTD::nullopt ||
+            __alloc_traits::propagate_on_container_move_assignment::value ||
+            __alloc_ == __other.__alloc_,
+            "node_type with incompatible allocator passed to "
+            "node_type::operator=(node_type&&)");
+
+        __destroy_node_pointer();
+        __ptr_ = __other.__ptr_;
+
+        if (__alloc_traits::propagate_on_container_move_assignment::value ||
+            __alloc_ == _VSTD::nullopt)
+            __alloc_ = _VSTD::move(__other.__alloc_);
+
+        __other.__ptr_ = nullptr;
+        __other.__alloc_ = _VSTD::nullopt;
+
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const { return *__alloc_; }
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit operator bool() const { return __ptr_ != nullptr; }
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool empty() const { return __ptr_ == nullptr; }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(__basic_node_handle& __other) noexcept(
+        __alloc_traits::propagate_on_container_swap::value ||
+        __alloc_traits::is_always_equal::value)
+    {
+        using _VSTD::swap;
+        swap(__ptr_, __other.__ptr_);
+        if (__alloc_traits::propagate_on_container_swap::value ||
+            __alloc_ == _VSTD::nullopt || __other.__alloc_ == _VSTD::nullopt)
+            swap(__alloc_, __other.__alloc_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    friend void swap(__basic_node_handle& __a, __basic_node_handle& __b)
+        noexcept(noexcept(__a.swap(__b))) { __a.swap(__b); }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~__basic_node_handle()
+    {
+        __destroy_node_pointer();
+    }
+};
+
+template <class _NodeType, class _Derived>
+struct __set_node_handle_specifics
+{
+    typedef typename _NodeType::__node_value_type value_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    value_type& value() const
+    {
+        return static_cast<_Derived const*>(this)->__ptr_->__value_;
+    }
+};
+
+template <class _NodeType, class _Derived>
+struct __map_node_handle_specifics
+{
+    typedef typename _NodeType::__node_value_type::key_type key_type;
+    typedef typename _NodeType::__node_value_type::mapped_type mapped_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    key_type& key() const
+    {
+        return static_cast<_Derived const*>(this)->
+            __ptr_->__value_.__ref().first;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    mapped_type& mapped() const
+    {
+        return static_cast<_Derived const*>(this)->
+            __ptr_->__value_.__ref().second;
+    }
+};
+
+template <class _NodeType, class _Alloc>
+using __set_node_handle =
+    __basic_node_handle< _NodeType, _Alloc, __set_node_handle_specifics>;
+
+template <class _NodeType, class _Alloc>
+using __map_node_handle =
+    __basic_node_handle< _NodeType, _Alloc, __map_node_handle_specifics>;
+
+template <class _Iterator, class _NodeType>
+struct _LIBCPP_TEMPLATE_VIS __insert_return_type
+{
+    _Iterator position;
+    bool inserted;
+    _NodeType node;
+};
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif  // _LIBCPP___NODE_HANDLE
diff --git a/app/src/main/cpp/libcxx/include/__numeric/accumulate.h b/app/src/main/cpp/libcxx/include/__numeric/accumulate.h
new file mode 100644
index 0000000..81fc0c2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/accumulate.h
@@ -0,0 +1,52 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_ACCUMULATE_H
+#define _LIBCPP___NUMERIC_ACCUMULATE_H
+
+#include <__config>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_Tp
+accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
+{
+    for (; __first != __last; ++__first)
+#if _LIBCPP_STD_VER > 17
+        __init = _VSTD::move(__init) + *__first;
+#else
+        __init = __init + *__first;
+#endif
+    return __init;
+}
+
+template <class _InputIterator, class _Tp, class _BinaryOperation>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_Tp
+accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op)
+{
+    for (; __first != __last; ++__first)
+#if _LIBCPP_STD_VER > 17
+        __init = __binary_op(_VSTD::move(__init), *__first);
+#else
+        __init = __binary_op(__init, *__first);
+#endif
+    return __init;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___NUMERIC_ACCUMULATE_H
diff --git a/app/src/main/cpp/libcxx/include/__numeric/adjacent_difference.h b/app/src/main/cpp/libcxx/include/__numeric/adjacent_difference.h
new file mode 100644
index 0000000..57e2f5b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/adjacent_difference.h
@@ -0,0 +1,72 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_ADJACENT_DIFFERENCE_H
+#define _LIBCPP___NUMERIC_ADJACENT_DIFFERENCE_H
+
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _OutputIterator>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
+{
+    if (__first != __last)
+    {
+        typename iterator_traits<_InputIterator>::value_type __acc(*__first);
+        *__result = __acc;
+        for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
+        {
+            typename iterator_traits<_InputIterator>::value_type __val(*__first);
+#if _LIBCPP_STD_VER > 17
+            *__result = __val - _VSTD::move(__acc);
+#else
+            *__result = __val - __acc;
+#endif
+            __acc = _VSTD::move(__val);
+        }
+    }
+    return __result;
+}
+
+template <class _InputIterator, class _OutputIterator, class _BinaryOperation>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result,
+                      _BinaryOperation __binary_op)
+{
+    if (__first != __last)
+    {
+        typename iterator_traits<_InputIterator>::value_type __acc(*__first);
+        *__result = __acc;
+        for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
+        {
+            typename iterator_traits<_InputIterator>::value_type __val(*__first);
+#if _LIBCPP_STD_VER > 17
+            *__result = __binary_op(__val, _VSTD::move(__acc));
+#else
+            *__result = __binary_op(__val, __acc);
+#endif
+            __acc = _VSTD::move(__val);
+        }
+    }
+    return __result;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___NUMERIC_ADJACENT_DIFFERENCE_H
diff --git a/app/src/main/cpp/libcxx/include/__numeric/exclusive_scan.h b/app/src/main/cpp/libcxx/include/__numeric/exclusive_scan.h
new file mode 100644
index 0000000..d02e126
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/exclusive_scan.h
@@ -0,0 +1,53 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_EXCLUSIVE_SCAN_H
+#define _LIBCPP___NUMERIC_EXCLUSIVE_SCAN_H
+
+#include <__config>
+#include <__functional/operations.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _InputIterator, class _OutputIterator, class _Tp, class _BinaryOp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator
+exclusive_scan(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp __init, _BinaryOp __b) {
+  if (__first != __last) {
+    _Tp __tmp(__b(__init, *__first));
+    while (true) {
+      *__result = _VSTD::move(__init);
+      ++__result;
+      ++__first;
+      if (__first == __last)
+        break;
+      __init = _VSTD::move(__tmp);
+      __tmp = __b(__init, *__first);
+    }
+  }
+  return __result;
+}
+
+template <class _InputIterator, class _OutputIterator, class _Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator
+exclusive_scan(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp __init) {
+  return _VSTD::exclusive_scan(__first, __last, __result, __init, _VSTD::plus<>());
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___NUMERIC_EXCLUSIVE_SCAN_H
diff --git a/app/src/main/cpp/libcxx/include/__numeric/gcd_lcm.h b/app/src/main/cpp/libcxx/include/__numeric/gcd_lcm.h
new file mode 100644
index 0000000..5a3f81b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/gcd_lcm.h
@@ -0,0 +1,100 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_GCD_LCM_H
+#define _LIBCPP___NUMERIC_GCD_LCM_H
+
+#include <__assert>
+#include <__config>
+#include <__type_traits/common_type.h>
+#include <__type_traits/is_integral.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_signed.h>
+#include <__type_traits/make_unsigned.h>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <typename _Result, typename _Source, bool _IsSigned = is_signed<_Source>::value> struct __ct_abs;
+
+template <typename _Result, typename _Source>
+struct __ct_abs<_Result, _Source, true> {
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    _Result operator()(_Source __t) const noexcept
+    {
+        if (__t >= 0) return __t;
+        if (__t == numeric_limits<_Source>::min()) return -static_cast<_Result>(__t);
+        return -__t;
+    }
+};
+
+template <typename _Result, typename _Source>
+struct __ct_abs<_Result, _Source, false> {
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    _Result operator()(_Source __t) const noexcept { return __t; }
+};
+
+
+template<class _Tp>
+_LIBCPP_CONSTEXPR _LIBCPP_HIDDEN
+_Tp __gcd(_Tp __m, _Tp __n)
+{
+    static_assert((!is_signed<_Tp>::value), "");
+    return __n == 0 ? __m : _VSTD::__gcd<_Tp>(__n, __m % __n);
+}
+
+template<class _Tp, class _Up>
+_LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+common_type_t<_Tp,_Up>
+gcd(_Tp __m, _Up __n)
+{
+    static_assert((is_integral<_Tp>::value && is_integral<_Up>::value), "Arguments to gcd must be integer types");
+    static_assert((!is_same<__remove_cv_t<_Tp>, bool>::value), "First argument to gcd cannot be bool" );
+    static_assert((!is_same<__remove_cv_t<_Up>, bool>::value), "Second argument to gcd cannot be bool" );
+    using _Rp = common_type_t<_Tp,_Up>;
+    using _Wp = make_unsigned_t<_Rp>;
+    return static_cast<_Rp>(_VSTD::__gcd(
+        static_cast<_Wp>(__ct_abs<_Rp, _Tp>()(__m)),
+        static_cast<_Wp>(__ct_abs<_Rp, _Up>()(__n))));
+}
+
+template<class _Tp, class _Up>
+_LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+common_type_t<_Tp,_Up>
+lcm(_Tp __m, _Up __n)
+{
+    static_assert((is_integral<_Tp>::value && is_integral<_Up>::value), "Arguments to lcm must be integer types");
+    static_assert((!is_same<__remove_cv_t<_Tp>, bool>::value), "First argument to lcm cannot be bool" );
+    static_assert((!is_same<__remove_cv_t<_Up>, bool>::value), "Second argument to lcm cannot be bool" );
+    if (__m == 0 || __n == 0)
+        return 0;
+
+    using _Rp = common_type_t<_Tp,_Up>;
+    _Rp __val1 = __ct_abs<_Rp, _Tp>()(__m) / _VSTD::gcd(__m, __n);
+    _Rp __val2 = __ct_abs<_Rp, _Up>()(__n);
+    _LIBCPP_ASSERT((numeric_limits<_Rp>::max() / __val1 > __val2), "Overflow in lcm");
+    return __val1 * __val2;
+}
+
+#endif // _LIBCPP_STD_VER
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___NUMERIC_GCD_LCM_H
diff --git a/app/src/main/cpp/libcxx/include/__numeric/inclusive_scan.h b/app/src/main/cpp/libcxx/include/__numeric/inclusive_scan.h
new file mode 100644
index 0000000..e5bf5ac
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/inclusive_scan.h
@@ -0,0 +1,60 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_INCLUSIVE_SCAN_H
+#define _LIBCPP___NUMERIC_INCLUSIVE_SCAN_H
+
+#include <__config>
+#include <__functional/operations.h>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _InputIterator, class _OutputIterator, class _Tp, class _BinaryOp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator
+inclusive_scan(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOp __b, _Tp __init) {
+  for (; __first != __last; ++__first, (void)++__result) {
+    __init = __b(__init, *__first);
+    *__result = __init;
+  }
+  return __result;
+}
+
+template <class _InputIterator, class _OutputIterator, class _BinaryOp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator
+inclusive_scan(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOp __b) {
+  if (__first != __last) {
+    typename iterator_traits<_InputIterator>::value_type __init = *__first;
+    *__result++ = __init;
+    if (++__first != __last)
+      return _VSTD::inclusive_scan(__first, __last, __result, __b, __init);
+  }
+
+  return __result;
+}
+
+template <class _InputIterator, class _OutputIterator>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator inclusive_scan(_InputIterator __first,
+                                                                                       _InputIterator __last,
+                                                                                       _OutputIterator __result) {
+  return _VSTD::inclusive_scan(__first, __last, __result, _VSTD::plus<>());
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___NUMERIC_INCLUSIVE_SCAN_H
diff --git a/app/src/main/cpp/libcxx/include/__numeric/inner_product.h b/app/src/main/cpp/libcxx/include/__numeric/inner_product.h
new file mode 100644
index 0000000..e3d68c0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/inner_product.h
@@ -0,0 +1,53 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_INNER_PRODUCT_H
+#define _LIBCPP___NUMERIC_INNER_PRODUCT_H
+
+#include <__config>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator1, class _InputIterator2, class _Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_Tp
+inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init)
+{
+    for (; __first1 != __last1; ++__first1, (void) ++__first2)
+#if _LIBCPP_STD_VER > 17
+        __init = _VSTD::move(__init) + *__first1 * *__first2;
+#else
+        __init = __init + *__first1 * *__first2;
+#endif
+    return __init;
+}
+
+template <class _InputIterator1, class _InputIterator2, class _Tp, class _BinaryOperation1, class _BinaryOperation2>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_Tp
+inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2,
+              _Tp __init, _BinaryOperation1 __binary_op1, _BinaryOperation2 __binary_op2)
+{
+    for (; __first1 != __last1; ++__first1, (void) ++__first2)
+#if _LIBCPP_STD_VER > 17
+        __init = __binary_op1(_VSTD::move(__init), __binary_op2(*__first1, *__first2));
+#else
+        __init = __binary_op1(__init, __binary_op2(*__first1, *__first2));
+#endif
+    return __init;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___NUMERIC_INNER_PRODUCT_H
diff --git a/app/src/main/cpp/libcxx/include/__numeric/iota.h b/app/src/main/cpp/libcxx/include/__numeric/iota.h
new file mode 100644
index 0000000..eacdc5b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/iota.h
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_IOTA_H
+#define _LIBCPP___NUMERIC_IOTA_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _ForwardIterator, class _Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value)
+{
+    for (; __first != __last; ++__first, (void) ++__value)
+        *__first = __value;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___NUMERIC_IOTA_H
diff --git a/app/src/main/cpp/libcxx/include/__numeric/midpoint.h b/app/src/main/cpp/libcxx/include/__numeric/midpoint.h
new file mode 100644
index 0000000..bac3642
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/midpoint.h
@@ -0,0 +1,95 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_MIDPOINT_H
+#define _LIBCPP___NUMERIC_MIDPOINT_H
+
+#include <__config>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_floating_point.h>
+#include <__type_traits/is_integral.h>
+#include <__type_traits/is_null_pointer.h>
+#include <__type_traits/is_object.h>
+#include <__type_traits/is_pointer.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_void.h>
+#include <__type_traits/make_unsigned.h>
+#include <__type_traits/remove_pointer.h>
+#include <cstddef>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<is_integral_v<_Tp> && !is_same_v<bool, _Tp> && !is_null_pointer_v<_Tp>, _Tp>
+midpoint(_Tp __a, _Tp __b) noexcept
+_LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+{
+    using _Up = make_unsigned_t<_Tp>;
+    constexpr _Up __bitshift = numeric_limits<_Up>::digits - 1;
+
+    _Up __diff = _Up(__b) - _Up(__a);
+    _Up __sign_bit = __b < __a;
+
+    _Up __half_diff = (__diff / 2) + (__sign_bit << __bitshift) + (__sign_bit & __diff);
+
+    return __a + __half_diff;
+}
+
+
+template <class _TPtr>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<is_pointer_v<_TPtr>
+             && is_object_v<remove_pointer_t<_TPtr>>
+             && ! is_void_v<remove_pointer_t<_TPtr>>
+             && (sizeof(remove_pointer_t<_TPtr>) > 0), _TPtr>
+midpoint(_TPtr __a, _TPtr __b) noexcept
+{
+    return __a + _VSTD::midpoint(ptrdiff_t(0), __b - __a);
+}
+
+
+template <typename _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr int __sign(_Tp __val) {
+    return (_Tp(0) < __val) - (__val < _Tp(0));
+}
+
+template <typename _Fp>
+_LIBCPP_HIDE_FROM_ABI constexpr _Fp __fp_abs(_Fp __f) { return __f >= 0 ? __f : -__f; }
+
+template <class _Fp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<is_floating_point_v<_Fp>, _Fp>
+midpoint(_Fp __a, _Fp __b) noexcept
+{
+    constexpr _Fp __lo = numeric_limits<_Fp>::min()*2;
+    constexpr _Fp __hi = numeric_limits<_Fp>::max()/2;
+    return std::__fp_abs(__a) <= __hi && std::__fp_abs(__b) <= __hi ?  // typical case: overflow is impossible
+      (__a + __b)/2 :                                        // always correctly rounded
+      std::__fp_abs(__a) < __lo ? __a + __b/2 :                   // not safe to halve a
+      std::__fp_abs(__b) < __lo ? __a/2 + __b :                   // not safe to halve b
+      __a/2 + __b/2;                                         // otherwise correctly rounded
+}
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___NUMERIC_MIDPOINT_H
diff --git a/app/src/main/cpp/libcxx/include/__numeric/partial_sum.h b/app/src/main/cpp/libcxx/include/__numeric/partial_sum.h
new file mode 100644
index 0000000..97cca58
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/partial_sum.h
@@ -0,0 +1,70 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_PARTIAL_SUM_H
+#define _LIBCPP___NUMERIC_PARTIAL_SUM_H
+
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _InputIterator, class _OutputIterator>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
+{
+    if (__first != __last)
+    {
+        typename iterator_traits<_InputIterator>::value_type __t(*__first);
+        *__result = __t;
+        for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
+        {
+#if _LIBCPP_STD_VER > 17
+            __t = _VSTD::move(__t) + *__first;
+#else
+            __t = __t + *__first;
+#endif
+            *__result = __t;
+        }
+    }
+    return __result;
+}
+
+template <class _InputIterator, class _OutputIterator, class _BinaryOperation>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result,
+              _BinaryOperation __binary_op)
+{
+    if (__first != __last)
+    {
+        typename iterator_traits<_InputIterator>::value_type __t(*__first);
+        *__result = __t;
+        for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
+        {
+#if _LIBCPP_STD_VER > 17
+            __t = __binary_op(_VSTD::move(__t), *__first);
+#else
+            __t = __binary_op(__t, *__first);
+#endif
+            *__result = __t;
+        }
+    }
+    return __result;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___NUMERIC_PARTIAL_SUM_H
diff --git a/app/src/main/cpp/libcxx/include/__numeric/reduce.h b/app/src/main/cpp/libcxx/include/__numeric/reduce.h
new file mode 100644
index 0000000..b64df05
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/reduce.h
@@ -0,0 +1,47 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_REDUCE_H
+#define _LIBCPP___NUMERIC_REDUCE_H
+
+#include <__config>
+#include <__functional/operations.h>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+template <class _InputIterator, class _Tp, class _BinaryOp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp reduce(_InputIterator __first, _InputIterator __last,
+                                                                   _Tp __init, _BinaryOp __b) {
+  for (; __first != __last; ++__first)
+    __init = __b(__init, *__first);
+  return __init;
+}
+
+template <class _InputIterator, class _Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp reduce(_InputIterator __first, _InputIterator __last,
+                                                                   _Tp __init) {
+  return _VSTD::reduce(__first, __last, __init, _VSTD::plus<>());
+}
+
+template <class _InputIterator>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 typename iterator_traits<_InputIterator>::value_type
+reduce(_InputIterator __first, _InputIterator __last) {
+  return _VSTD::reduce(__first, __last, typename iterator_traits<_InputIterator>::value_type{});
+}
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___NUMERIC_REDUCE_H
diff --git a/app/src/main/cpp/libcxx/include/__numeric/transform_exclusive_scan.h b/app/src/main/cpp/libcxx/include/__numeric/transform_exclusive_scan.h
new file mode 100644
index 0000000..afbcdb8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/transform_exclusive_scan.h
@@ -0,0 +1,49 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_TRANSFORM_EXCLUSIVE_SCAN_H
+#define _LIBCPP___NUMERIC_TRANSFORM_EXCLUSIVE_SCAN_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _InputIterator, class _OutputIterator, class _Tp,
+          class _BinaryOp, class _UnaryOp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+transform_exclusive_scan(_InputIterator __first, _InputIterator __last,
+                           _OutputIterator __result, _Tp __init,
+                           _BinaryOp __b, _UnaryOp __u)
+{
+    if (__first != __last)
+    {
+        _Tp __saved = __init;
+        do
+        {
+            __init = __b(__init, __u(*__first));
+            *__result = __saved;
+            __saved = __init;
+            ++__result;
+        } while (++__first != __last);
+    }
+    return __result;
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___NUMERIC_TRANSFORM_EXCLUSIVE_SCAN_H
diff --git a/app/src/main/cpp/libcxx/include/__numeric/transform_inclusive_scan.h b/app/src/main/cpp/libcxx/include/__numeric/transform_inclusive_scan.h
new file mode 100644
index 0000000..c050041
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/transform_inclusive_scan.h
@@ -0,0 +1,58 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_TRANSFORM_INCLUSIVE_SCAN_H
+#define _LIBCPP___NUMERIC_TRANSFORM_INCLUSIVE_SCAN_H
+
+#include <__config>
+#include <__iterator/iterator_traits.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _InputIterator, class _OutputIterator, class _Tp, class _BinaryOp, class _UnaryOp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+transform_inclusive_scan(_InputIterator __first, _InputIterator __last,
+                           _OutputIterator __result, _BinaryOp __b, _UnaryOp __u, _Tp __init)
+{
+    for (; __first != __last; ++__first, (void) ++__result) {
+        __init = __b(__init, __u(*__first));
+        *__result = __init;
+        }
+
+    return __result;
+}
+
+template <class _InputIterator, class _OutputIterator, class _BinaryOp, class _UnaryOp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_OutputIterator
+transform_inclusive_scan(_InputIterator __first, _InputIterator __last,
+                               _OutputIterator __result, _BinaryOp __b, _UnaryOp __u)
+{
+    if (__first != __last) {
+        typename iterator_traits<_InputIterator>::value_type __init = __u(*__first);
+        *__result++ = __init;
+        if (++__first != __last)
+            return _VSTD::transform_inclusive_scan(__first, __last, __result, __b, __u, __init);
+    }
+
+    return __result;
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___NUMERIC_TRANSFORM_INCLUSIVE_SCAN_H
diff --git a/app/src/main/cpp/libcxx/include/__numeric/transform_reduce.h b/app/src/main/cpp/libcxx/include/__numeric/transform_reduce.h
new file mode 100644
index 0000000..d997521
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__numeric/transform_reduce.h
@@ -0,0 +1,54 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___NUMERIC_TRANSFORM_REDUCE_H
+#define _LIBCPP___NUMERIC_TRANSFORM_REDUCE_H
+
+#include <__config>
+#include <__functional/operations.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+template <class _InputIterator, class _Tp, class _BinaryOp, class _UnaryOp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp transform_reduce(_InputIterator __first,
+                                                                             _InputIterator __last, _Tp __init,
+                                                                             _BinaryOp __b, _UnaryOp __u) {
+  for (; __first != __last; ++__first)
+    __init = __b(__init, __u(*__first));
+  return __init;
+}
+
+template <class _InputIterator1, class _InputIterator2, class _Tp, class _BinaryOp1, class _BinaryOp2>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp transform_reduce(_InputIterator1 __first1,
+                                                                             _InputIterator1 __last1,
+                                                                             _InputIterator2 __first2, _Tp __init,
+                                                                             _BinaryOp1 __b1, _BinaryOp2 __b2) {
+  for (; __first1 != __last1; ++__first1, (void)++__first2)
+    __init = __b1(__init, __b2(*__first1, *__first2));
+  return __init;
+}
+
+template <class _InputIterator1, class _InputIterator2, class _Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp transform_reduce(_InputIterator1 __first1,
+                                                                             _InputIterator1 __last1,
+                                                                             _InputIterator2 __first2, _Tp __init) {
+  return _VSTD::transform_reduce(__first1, __last1, __first2, _VSTD::move(__init), _VSTD::plus<>(),
+                                 _VSTD::multiplies<>());
+}
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___NUMERIC_TRANSFORM_REDUCE_H
diff --git a/app/src/main/cpp/libcxx/include/__random/bernoulli_distribution.h b/app/src/main/cpp/libcxx/include/__random/bernoulli_distribution.h
new file mode 100644
index 0000000..e38d3df
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/bernoulli_distribution.h
@@ -0,0 +1,145 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_BERNOULLI_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_BERNOULLI_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/is_valid.h>
+#include <__random/uniform_real_distribution.h>
+#include <iosfwd>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+class _LIBCPP_TEMPLATE_VIS bernoulli_distribution
+{
+public:
+    // types
+    typedef bool result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        double __p_;
+    public:
+        typedef bernoulli_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(double __p = 0.5) : __p_(__p) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        double p() const {return __p_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__p_ == __y.__p_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructors and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    bernoulli_distribution() : bernoulli_distribution(0.5) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit bernoulli_distribution(double __p) : __p_(param_type(__p)) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit bernoulli_distribution(double __p = 0.5) : __p_(param_type(__p)) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit bernoulli_distribution(const param_type& __p) : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> _LIBCPP_INLINE_VISIBILITY result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    double p() const {return __p_.p();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return false;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return true;}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const bernoulli_distribution& __x,
+                        const bernoulli_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const bernoulli_distribution& __x,
+                        const bernoulli_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template<class _URNG>
+inline
+bernoulli_distribution::result_type
+bernoulli_distribution::operator()(_URNG& __g, const param_type& __p)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    uniform_real_distribution<double> __gen;
+    return __gen(__g) < __p.p();
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const bernoulli_distribution& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    return __os << __x.p();
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is, bernoulli_distribution& __x)
+{
+    typedef bernoulli_distribution _Eng;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    double __p;
+    __is >> __p;
+    if (!__is.fail())
+        __x.param(param_type(__p));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_BERNOULLI_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/binomial_distribution.h b/app/src/main/cpp/libcxx/include/__random/binomial_distribution.h
new file mode 100644
index 0000000..7b0f055
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/binomial_distribution.h
@@ -0,0 +1,228 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_BINOMIAL_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_BINOMIAL_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/is_valid.h>
+#include <__random/uniform_real_distribution.h>
+#include <cmath>
+#include <iosfwd>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _IntType = int>
+class _LIBCPP_TEMPLATE_VIS binomial_distribution
+{
+    static_assert(__libcpp_random_is_valid_inttype<_IntType>::value, "IntType must be a supported integer type");
+public:
+    // types
+    typedef _IntType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __t_;
+        double __p_;
+        double __pr_;
+        double __odds_ratio_;
+        result_type __r0_;
+    public:
+        typedef binomial_distribution distribution_type;
+
+        explicit param_type(result_type __t = 1, double __p = 0.5);
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type t() const {return __t_;}
+        _LIBCPP_INLINE_VISIBILITY
+        double p() const {return __p_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__t_ == __y.__t_ && __x.__p_ == __y.__p_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+
+        friend class binomial_distribution;
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructors and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    binomial_distribution() : binomial_distribution(1) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit binomial_distribution(result_type __t, double __p = 0.5)
+        : __p_(param_type(__t, __p)) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit binomial_distribution(result_type __t = 1, double __p = 0.5)
+        : __p_(param_type(__t, __p)) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit binomial_distribution(const param_type& __p) : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type t() const {return __p_.t();}
+    _LIBCPP_INLINE_VISIBILITY
+    double p() const {return __p_.p();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return t();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const binomial_distribution& __x,
+                        const binomial_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const binomial_distribution& __x,
+                        const binomial_distribution& __y)
+        {return !(__x == __y);}
+};
+
+#ifndef _LIBCPP_MSVCRT_LIKE
+extern "C" double lgamma_r(double, int *);
+#endif
+
+inline _LIBCPP_INLINE_VISIBILITY double __libcpp_lgamma(double __d) {
+#if defined(_LIBCPP_MSVCRT_LIKE)
+  return lgamma(__d);
+#else
+  int __sign;
+  return lgamma_r(__d, &__sign);
+#endif
+}
+
+template<class _IntType>
+binomial_distribution<_IntType>::param_type::param_type(result_type __t, double __p)
+    : __t_(__t), __p_(__p)
+{
+    if (0 < __p_ && __p_ < 1)
+    {
+        __r0_ = static_cast<result_type>((__t_ + 1) * __p_);
+        __pr_ = _VSTD::exp(std::__libcpp_lgamma(__t_ + 1.) -
+                           std::__libcpp_lgamma(__r0_ + 1.) -
+                           std::__libcpp_lgamma(__t_ - __r0_ + 1.) + __r0_ * _VSTD::log(__p_) +
+                           (__t_ - __r0_) * _VSTD::log(1 - __p_));
+        __odds_ratio_ = __p_ / (1 - __p_);
+    }
+}
+
+// Reference: Kemp, C.D. (1986). `A modal method for generating binomial
+//           variables', Commun. Statist. - Theor. Meth. 15(3), 805-813.
+template<class _IntType>
+template<class _URNG>
+_IntType
+binomial_distribution<_IntType>::operator()(_URNG& __g, const param_type& __pr)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    if (__pr.__t_ == 0 || __pr.__p_ == 0)
+        return 0;
+    if (__pr.__p_ == 1)
+        return __pr.__t_;
+    uniform_real_distribution<double> __gen;
+    double __u = __gen(__g) - __pr.__pr_;
+    if (__u < 0)
+        return __pr.__r0_;
+    double __pu = __pr.__pr_;
+    double __pd = __pu;
+    result_type __ru = __pr.__r0_;
+    result_type __rd = __ru;
+    while (true)
+    {
+        bool __break = true;
+        if (__rd >= 1)
+        {
+            __pd *= __rd / (__pr.__odds_ratio_ * (__pr.__t_ - __rd + 1));
+            __u -= __pd;
+            __break = false;
+            if (__u < 0)
+                return __rd - 1;
+        }
+        if ( __rd != 0 )
+            --__rd;
+        ++__ru;
+        if (__ru <= __pr.__t_)
+        {
+            __pu *= (__pr.__t_ - __ru + 1) * __pr.__odds_ratio_ / __ru;
+            __u -= __pu;
+            __break = false;
+            if (__u < 0)
+                return __ru;
+        }
+        if (__break)
+            return 0;
+    }
+}
+
+template <class _CharT, class _Traits, class _IntType>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const binomial_distribution<_IntType>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    return __os << __x.t() << __sp << __x.p();
+}
+
+template <class _CharT, class _Traits, class _IntType>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           binomial_distribution<_IntType>& __x)
+{
+    typedef binomial_distribution<_IntType> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __t;
+    double __p;
+    __is >> __t >> __p;
+    if (!__is.fail())
+        __x.param(param_type(__t, __p));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_BINOMIAL_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/cauchy_distribution.h b/app/src/main/cpp/libcxx/include/__random/cauchy_distribution.h
new file mode 100644
index 0000000..2fda6b5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/cauchy_distribution.h
@@ -0,0 +1,164 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_CAUCHY_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_CAUCHY_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/is_valid.h>
+#include <__random/uniform_real_distribution.h>
+#include <cmath>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS cauchy_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __a_;
+        result_type __b_;
+    public:
+        typedef cauchy_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __a = 0, result_type __b = 1)
+            : __a_(__a), __b_(__b) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type a() const {return __a_;}
+        _LIBCPP_INLINE_VISIBILITY
+        result_type b() const {return __b_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructor and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    cauchy_distribution() : cauchy_distribution(0) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit cauchy_distribution(result_type __a, result_type __b = 1)
+        : __p_(param_type(__a, __b)) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit cauchy_distribution(result_type __a = 0, result_type __b = 1)
+        : __p_(param_type(__a, __b)) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit cauchy_distribution(const param_type& __p)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> _LIBCPP_INLINE_VISIBILITY result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type a() const {return __p_.a();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type b() const {return __p_.b();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return -numeric_limits<result_type>::infinity();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::infinity();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const cauchy_distribution& __x,
+                        const cauchy_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const cauchy_distribution& __x,
+                        const cauchy_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template <class _RealType>
+template<class _URNG>
+inline
+_RealType
+cauchy_distribution<_RealType>::operator()(_URNG& __g, const param_type& __p)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    uniform_real_distribution<result_type> __gen;
+    // purposefully let tan arg get as close to pi/2 as it wants, tan will return a finite
+    return __p.a() + __p.b() * _VSTD::tan(3.1415926535897932384626433832795 * __gen(__g));
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const cauchy_distribution<_RT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    __os << __x.a() << __sp << __x.b();
+    return __os;
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           cauchy_distribution<_RT>& __x)
+{
+    typedef cauchy_distribution<_RT> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __a;
+    result_type __b;
+    __is >> __a >> __b;
+    if (!__is.fail())
+        __x.param(param_type(__a, __b));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_CAUCHY_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/chi_squared_distribution.h b/app/src/main/cpp/libcxx/include/__random/chi_squared_distribution.h
new file mode 100644
index 0000000..f2922b6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/chi_squared_distribution.h
@@ -0,0 +1,144 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_CHI_SQUARED_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_CHI_SQUARED_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/gamma_distribution.h>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS chi_squared_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __n_;
+    public:
+        typedef chi_squared_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __n = 1) : __n_(__n) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type n() const {return __n_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__n_ == __y.__n_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructor and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    chi_squared_distribution() : chi_squared_distribution(1) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit chi_squared_distribution(result_type __n)
+        : __p_(param_type(__n)) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit chi_squared_distribution(result_type __n = 1)
+        : __p_(param_type(__n)) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit chi_squared_distribution(const param_type& __p)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g, const param_type& __p)
+        {return gamma_distribution<result_type>(__p.n() / 2, 2)(__g);}
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type n() const {return __p_.n();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::infinity();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const chi_squared_distribution& __x,
+                        const chi_squared_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const chi_squared_distribution& __x,
+                        const chi_squared_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const chi_squared_distribution<_RT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    __os << __x.n();
+    return __os;
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           chi_squared_distribution<_RT>& __x)
+{
+    typedef chi_squared_distribution<_RT> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __n;
+    __is >> __n;
+    if (!__is.fail())
+        __x.param(param_type(__n));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_CHI_SQUARED_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/clamp_to_integral.h b/app/src/main/cpp/libcxx/include/__random/clamp_to_integral.h
new file mode 100644
index 0000000..7d44ff9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/clamp_to_integral.h
@@ -0,0 +1,60 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_CLAMP_TO_INTEGRAL_H
+#define _LIBCPP___RANDOM_CLAMP_TO_INTEGRAL_H
+
+#include <__config>
+#include <cmath>
+#include <limits>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _IntT, class _FloatT,
+    bool _FloatBigger = (numeric_limits<_FloatT>::digits > numeric_limits<_IntT>::digits),
+    int _Bits = (numeric_limits<_IntT>::digits - numeric_limits<_FloatT>::digits)>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR _IntT __max_representable_int_for_float() _NOEXCEPT {
+  static_assert(is_floating_point<_FloatT>::value, "must be a floating point type");
+  static_assert(is_integral<_IntT>::value, "must be an integral type");
+  static_assert(numeric_limits<_FloatT>::radix == 2, "FloatT has incorrect radix");
+  static_assert((_IsSame<_FloatT, float>::value || _IsSame<_FloatT, double>::value
+                 || _IsSame<_FloatT,long double>::value), "unsupported floating point type");
+  return _FloatBigger ? numeric_limits<_IntT>::max() :  (numeric_limits<_IntT>::max() >> _Bits << _Bits);
+}
+
+// Convert a floating point number to the specified integral type after
+// clamping to the integral type's representable range.
+//
+// The behavior is undefined if `__r` is NaN.
+template <class _IntT, class _RealT>
+_LIBCPP_INLINE_VISIBILITY
+_IntT __clamp_to_integral(_RealT __r) _NOEXCEPT {
+  using _Lim = numeric_limits<_IntT>;
+  const _IntT _MaxVal = __max_representable_int_for_float<_IntT, _RealT>();
+  if (__r >= ::nextafter(static_cast<_RealT>(_MaxVal), INFINITY)) {
+    return _Lim::max();
+  } else if (__r <= _Lim::lowest()) {
+    return _Lim::min();
+  }
+  return static_cast<_IntT>(__r);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_CLAMP_TO_INTEGRAL_H
diff --git a/app/src/main/cpp/libcxx/include/__random/default_random_engine.h b/app/src/main/cpp/libcxx/include/__random/default_random_engine.h
new file mode 100644
index 0000000..89792f4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/default_random_engine.h
@@ -0,0 +1,25 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_DEFAULT_RANDOM_ENGINE_H
+#define _LIBCPP___RANDOM_DEFAULT_RANDOM_ENGINE_H
+
+#include <__config>
+#include <__random/linear_congruential_engine.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+typedef minstd_rand default_random_engine;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANDOM_DEFAULT_RANDOM_ENGINE_H
diff --git a/app/src/main/cpp/libcxx/include/__random/discard_block_engine.h b/app/src/main/cpp/libcxx/include/__random/discard_block_engine.h
new file mode 100644
index 0000000..db33623
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/discard_block_engine.h
@@ -0,0 +1,205 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_DISCARD_BLOCK_ENGINE_H
+#define _LIBCPP___RANDOM_DISCARD_BLOCK_ENGINE_H
+
+#include <__config>
+#include <__random/is_seed_sequence.h>
+#include <__utility/move.h>
+#include <iosfwd>
+#include <limits>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Engine, size_t __p, size_t __r>
+class _LIBCPP_TEMPLATE_VIS discard_block_engine
+{
+    _Engine __e_;
+    int     __n_;
+
+    static_assert(  0 <  __r, "discard_block_engine invalid parameters");
+    static_assert(__r <= __p, "discard_block_engine invalid parameters");
+#ifndef _LIBCPP_CXX03_LANG // numeric_limits::max() is not constexpr in C++03
+    static_assert(__r <= numeric_limits<int>::max(), "discard_block_engine invalid parameters");
+#endif
+public:
+    // types
+    typedef typename _Engine::result_type result_type;
+
+    // engine characteristics
+    static _LIBCPP_CONSTEXPR const size_t block_size = __p;
+    static _LIBCPP_CONSTEXPR const size_t used_block = __r;
+
+#ifdef _LIBCPP_CXX03_LANG
+    static const result_type _Min = _Engine::_Min;
+    static const result_type _Max = _Engine::_Max;
+#else
+    static _LIBCPP_CONSTEXPR const result_type _Min = _Engine::min();
+    static _LIBCPP_CONSTEXPR const result_type _Max = _Engine::max();
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type min() { return _Engine::min(); }
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type max() { return _Engine::max(); }
+
+    // constructors and seeding functions
+    _LIBCPP_INLINE_VISIBILITY
+    discard_block_engine() : __n_(0) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit discard_block_engine(const _Engine& __e)
+        : __e_(__e), __n_(0) {}
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    explicit discard_block_engine(_Engine&& __e)
+        : __e_(_VSTD::move(__e)), __n_(0) {}
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    explicit discard_block_engine(result_type __sd) : __e_(__sd), __n_(0) {}
+    template<class _Sseq>
+        _LIBCPP_INLINE_VISIBILITY
+        explicit discard_block_engine(_Sseq& __q,
+        typename enable_if<__is_seed_sequence<_Sseq, discard_block_engine>::value &&
+                           !is_convertible<_Sseq, _Engine>::value>::type* = 0)
+        : __e_(__q), __n_(0) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void seed() {__e_.seed(); __n_ = 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    void seed(result_type __sd) {__e_.seed(__sd); __n_ = 0;}
+    template<class _Sseq>
+        _LIBCPP_INLINE_VISIBILITY
+        typename enable_if
+        <
+            __is_seed_sequence<_Sseq, discard_block_engine>::value,
+            void
+        >::type
+        seed(_Sseq& __q) {__e_.seed(__q); __n_ = 0;}
+
+    // generating functions
+    result_type operator()();
+    _LIBCPP_INLINE_VISIBILITY
+    void discard(unsigned long long __z) {for (; __z; --__z) operator()();}
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    const _Engine& base() const _NOEXCEPT {return __e_;}
+
+    template<class _Eng, size_t _Pp, size_t _Rp>
+    friend
+    bool
+    operator==(
+        const discard_block_engine<_Eng, _Pp, _Rp>& __x,
+        const discard_block_engine<_Eng, _Pp, _Rp>& __y);
+
+    template<class _Eng, size_t _Pp, size_t _Rp>
+    friend
+    bool
+    operator!=(
+        const discard_block_engine<_Eng, _Pp, _Rp>& __x,
+        const discard_block_engine<_Eng, _Pp, _Rp>& __y);
+
+    template <class _CharT, class _Traits,
+              class _Eng, size_t _Pp, size_t _Rp>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+               const discard_block_engine<_Eng, _Pp, _Rp>& __x);
+
+    template <class _CharT, class _Traits,
+              class _Eng, size_t _Pp, size_t _Rp>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+               discard_block_engine<_Eng, _Pp, _Rp>& __x);
+};
+
+template<class _Engine, size_t __p, size_t __r>
+    _LIBCPP_CONSTEXPR const size_t discard_block_engine<_Engine, __p, __r>::block_size;
+
+template<class _Engine, size_t __p, size_t __r>
+    _LIBCPP_CONSTEXPR const size_t discard_block_engine<_Engine, __p, __r>::used_block;
+
+template<class _Engine, size_t __p, size_t __r>
+typename discard_block_engine<_Engine, __p, __r>::result_type
+discard_block_engine<_Engine, __p, __r>::operator()()
+{
+    if (__n_ >= static_cast<int>(__r))
+    {
+        __e_.discard(__p - __r);
+        __n_ = 0;
+    }
+    ++__n_;
+    return __e_();
+}
+
+template<class _Eng, size_t _Pp, size_t _Rp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const discard_block_engine<_Eng, _Pp, _Rp>& __x,
+           const discard_block_engine<_Eng, _Pp, _Rp>& __y)
+{
+    return __x.__n_ == __y.__n_ && __x.__e_ == __y.__e_;
+}
+
+template<class _Eng, size_t _Pp, size_t _Rp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const discard_block_engine<_Eng, _Pp, _Rp>& __x,
+           const discard_block_engine<_Eng, _Pp, _Rp>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _CharT, class _Traits,
+          class _Eng, size_t _Pp, size_t _Rp>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const discard_block_engine<_Eng, _Pp, _Rp>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _Ostream;
+    __os.flags(_Ostream::dec | _Ostream::left);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    return __os << __x.__e_ << __sp << __x.__n_;
+}
+
+template <class _CharT, class _Traits,
+          class _Eng, size_t _Pp, size_t _Rp>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           discard_block_engine<_Eng, _Pp, _Rp>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    _Eng __e;
+    int __n;
+    __is >> __e >> __n;
+    if (!__is.fail())
+    {
+        __x.__e_ = __e;
+        __x.__n_ = __n;
+    }
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_DISCARD_BLOCK_ENGINE_H
diff --git a/app/src/main/cpp/libcxx/include/__random/discrete_distribution.h b/app/src/main/cpp/libcxx/include/__random/discrete_distribution.h
new file mode 100644
index 0000000..03f49ba
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/discrete_distribution.h
@@ -0,0 +1,263 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_DISCRETE_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_DISCRETE_DISTRIBUTION_H
+
+#include <__algorithm/upper_bound.h>
+#include <__config>
+#include <__random/is_valid.h>
+#include <__random/uniform_real_distribution.h>
+#include <cstddef>
+#include <iosfwd>
+#include <numeric>
+#include <vector>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _IntType = int>
+class _LIBCPP_TEMPLATE_VIS discrete_distribution
+{
+    static_assert(__libcpp_random_is_valid_inttype<_IntType>::value, "IntType must be a supported integer type");
+public:
+    // types
+    typedef _IntType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        vector<double> __p_;
+    public:
+        typedef discrete_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        param_type() {}
+        template<class _InputIterator>
+            _LIBCPP_INLINE_VISIBILITY
+            param_type(_InputIterator __f, _InputIterator __l)
+            : __p_(__f, __l) {__init();}
+#ifndef _LIBCPP_CXX03_LANG
+        _LIBCPP_INLINE_VISIBILITY
+        param_type(initializer_list<double> __wl)
+            : __p_(__wl.begin(), __wl.end()) {__init();}
+#endif // _LIBCPP_CXX03_LANG
+        template<class _UnaryOperation>
+            param_type(size_t __nw, double __xmin, double __xmax,
+                       _UnaryOperation __fw);
+
+        vector<double> probabilities() const;
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__p_ == __y.__p_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+
+    private:
+        void __init();
+
+        friend class discrete_distribution;
+
+        template <class _CharT, class _Traits, class _IT>
+        friend
+        basic_ostream<_CharT, _Traits>&
+        operator<<(basic_ostream<_CharT, _Traits>& __os,
+                   const discrete_distribution<_IT>& __x);
+
+        template <class _CharT, class _Traits, class _IT>
+        friend
+        basic_istream<_CharT, _Traits>&
+        operator>>(basic_istream<_CharT, _Traits>& __is,
+                   discrete_distribution<_IT>& __x);
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructor and reset functions
+    _LIBCPP_INLINE_VISIBILITY
+    discrete_distribution() {}
+    template<class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        discrete_distribution(_InputIterator __f, _InputIterator __l)
+            : __p_(__f, __l) {}
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    discrete_distribution(initializer_list<double> __wl)
+        : __p_(__wl) {}
+#endif // _LIBCPP_CXX03_LANG
+    template<class _UnaryOperation>
+        _LIBCPP_INLINE_VISIBILITY
+        discrete_distribution(size_t __nw, double __xmin, double __xmax,
+                              _UnaryOperation __fw)
+        : __p_(__nw, __xmin, __xmax, __fw) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit discrete_distribution(const param_type& __p)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    vector<double> probabilities() const {return __p_.probabilities();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return __p_.__p_.size();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const discrete_distribution& __x,
+                        const discrete_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const discrete_distribution& __x,
+                        const discrete_distribution& __y)
+        {return !(__x == __y);}
+
+    template <class _CharT, class _Traits, class _IT>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+               const discrete_distribution<_IT>& __x);
+
+    template <class _CharT, class _Traits, class _IT>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+               discrete_distribution<_IT>& __x);
+};
+
+template<class _IntType>
+template<class _UnaryOperation>
+discrete_distribution<_IntType>::param_type::param_type(size_t __nw,
+                                                        double __xmin,
+                                                        double __xmax,
+                                                        _UnaryOperation __fw)
+{
+    if (__nw > 1)
+    {
+        __p_.reserve(__nw - 1);
+        double __d = (__xmax - __xmin) / __nw;
+        double __d2 = __d / 2;
+        for (size_t __k = 0; __k < __nw; ++__k)
+            __p_.push_back(__fw(__xmin + __k * __d + __d2));
+        __init();
+    }
+}
+
+template<class _IntType>
+void
+discrete_distribution<_IntType>::param_type::__init()
+{
+    if (!__p_.empty())
+    {
+        if (__p_.size() > 1)
+        {
+            double __s = _VSTD::accumulate(__p_.begin(), __p_.end(), 0.0);
+            for (vector<double>::iterator __i = __p_.begin(), __e = __p_.end(); __i < __e; ++__i)
+                *__i /= __s;
+            vector<double> __t(__p_.size() - 1);
+            _VSTD::partial_sum(__p_.begin(), __p_.end() - 1, __t.begin());
+            swap(__p_, __t);
+        }
+        else
+        {
+            __p_.clear();
+            __p_.shrink_to_fit();
+        }
+    }
+}
+
+template<class _IntType>
+vector<double>
+discrete_distribution<_IntType>::param_type::probabilities() const
+{
+    size_t __n = __p_.size();
+    vector<double> __p(__n+1);
+    _VSTD::adjacent_difference(__p_.begin(), __p_.end(), __p.begin());
+    if (__n > 0)
+        __p[__n] = 1 - __p_[__n-1];
+    else
+        __p[0] = 1;
+    return __p;
+}
+
+template<class _IntType>
+template<class _URNG>
+_IntType
+discrete_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    uniform_real_distribution<double> __gen;
+    return static_cast<_IntType>(
+           _VSTD::upper_bound(__p.__p_.begin(), __p.__p_.end(), __gen(__g)) -
+                                                              __p.__p_.begin());
+}
+
+template <class _CharT, class _Traits, class _IT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const discrete_distribution<_IT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    size_t __n = __x.__p_.__p_.size();
+    __os << __n;
+    for (size_t __i = 0; __i < __n; ++__i)
+        __os << __sp << __x.__p_.__p_[__i];
+    return __os;
+}
+
+template <class _CharT, class _Traits, class _IT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           discrete_distribution<_IT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    size_t __n;
+    __is >> __n;
+    vector<double> __p(__n);
+    for (size_t __i = 0; __i < __n; ++__i)
+        __is >> __p[__i];
+    if (!__is.fail())
+        swap(__x.__p_.__p_, __p);
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_DISCRETE_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/exponential_distribution.h b/app/src/main/cpp/libcxx/include/__random/exponential_distribution.h
new file mode 100644
index 0000000..8edf1ac
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/exponential_distribution.h
@@ -0,0 +1,157 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_EXPONENTIAL_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_EXPONENTIAL_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/generate_canonical.h>
+#include <__random/is_valid.h>
+#include <__random/uniform_real_distribution.h>
+#include <cmath>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS exponential_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __lambda_;
+    public:
+        typedef exponential_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __lambda = 1) : __lambda_(__lambda) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type lambda() const {return __lambda_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__lambda_ == __y.__lambda_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructors and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    exponential_distribution() : exponential_distribution(1) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit exponential_distribution(result_type __lambda)
+        : __p_(param_type(__lambda)) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit exponential_distribution(result_type __lambda = 1)
+        : __p_(param_type(__lambda)) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit exponential_distribution(const param_type& __p) : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type lambda() const {return __p_.lambda();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::infinity();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const exponential_distribution& __x,
+                        const exponential_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const exponential_distribution& __x,
+                        const exponential_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template <class _RealType>
+template<class _URNG>
+_RealType
+exponential_distribution<_RealType>::operator()(_URNG& __g, const param_type& __p)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    return -_VSTD::log
+                  (
+                      result_type(1) -
+                      _VSTD::generate_canonical<result_type,
+                                       numeric_limits<result_type>::digits>(__g)
+                  )
+                  / __p.lambda();
+}
+
+template <class _CharT, class _Traits, class _RealType>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const exponential_distribution<_RealType>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    return __os << __x.lambda();
+}
+
+template <class _CharT, class _Traits, class _RealType>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           exponential_distribution<_RealType>& __x)
+{
+    typedef exponential_distribution<_RealType> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __lambda;
+    __is >> __lambda;
+    if (!__is.fail())
+        __x.param(param_type(__lambda));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_EXPONENTIAL_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/extreme_value_distribution.h b/app/src/main/cpp/libcxx/include/__random/extreme_value_distribution.h
new file mode 100644
index 0000000..b3cba39
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/extreme_value_distribution.h
@@ -0,0 +1,163 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_EXTREME_VALUE_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_EXTREME_VALUE_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/is_valid.h>
+#include <__random/uniform_real_distribution.h>
+#include <cmath>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS extreme_value_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __a_;
+        result_type __b_;
+    public:
+        typedef extreme_value_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __a = 0, result_type __b = 1)
+            : __a_(__a), __b_(__b) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type a() const {return __a_;}
+        _LIBCPP_INLINE_VISIBILITY
+        result_type b() const {return __b_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructor and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    extreme_value_distribution() : extreme_value_distribution(0) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit extreme_value_distribution(result_type __a, result_type __b = 1)
+        : __p_(param_type(__a, __b)) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit extreme_value_distribution(result_type __a = 0,
+                                        result_type __b = 1)
+        : __p_(param_type(__a, __b)) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit extreme_value_distribution(const param_type& __p)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type a() const {return __p_.a();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type b() const {return __p_.b();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return -numeric_limits<result_type>::infinity();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::infinity();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const extreme_value_distribution& __x,
+                        const extreme_value_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const extreme_value_distribution& __x,
+                        const extreme_value_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template<class _RealType>
+template<class _URNG>
+_RealType
+extreme_value_distribution<_RealType>::operator()(_URNG& __g, const param_type& __p)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    return __p.a() - __p.b() *
+         _VSTD::log(-_VSTD::log(1-uniform_real_distribution<result_type>()(__g)));
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const extreme_value_distribution<_RT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    __os << __x.a() << __sp << __x.b();
+    return __os;
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           extreme_value_distribution<_RT>& __x)
+{
+    typedef extreme_value_distribution<_RT> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __a;
+    result_type __b;
+    __is >> __a >> __b;
+    if (!__is.fail())
+        __x.param(param_type(__a, __b));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_EXTREME_VALUE_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/fisher_f_distribution.h b/app/src/main/cpp/libcxx/include/__random/fisher_f_distribution.h
new file mode 100644
index 0000000..b5479ac
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/fisher_f_distribution.h
@@ -0,0 +1,162 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_FISHER_F_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_FISHER_F_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/gamma_distribution.h>
+#include <__random/is_valid.h>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS fisher_f_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __m_;
+        result_type __n_;
+    public:
+        typedef fisher_f_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __m = 1, result_type __n = 1)
+            : __m_(__m), __n_(__n) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type m() const {return __m_;}
+        _LIBCPP_INLINE_VISIBILITY
+        result_type n() const {return __n_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__m_ == __y.__m_ && __x.__n_ == __y.__n_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructor and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    fisher_f_distribution() : fisher_f_distribution(1) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit fisher_f_distribution(result_type __m, result_type __n = 1)
+        : __p_(param_type(__m, __n)) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit fisher_f_distribution(result_type __m = 1, result_type __n = 1)
+        : __p_(param_type(__m, __n)) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit fisher_f_distribution(const param_type& __p)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type m() const {return __p_.m();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type n() const {return __p_.n();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::infinity();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const fisher_f_distribution& __x,
+                        const fisher_f_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const fisher_f_distribution& __x,
+                        const fisher_f_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template <class _RealType>
+template<class _URNG>
+_RealType
+fisher_f_distribution<_RealType>::operator()(_URNG& __g, const param_type& __p)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    gamma_distribution<result_type> __gdm(__p.m() * result_type(.5));
+    gamma_distribution<result_type> __gdn(__p.n() * result_type(.5));
+    return __p.n() * __gdm(__g) / (__p.m() * __gdn(__g));
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const fisher_f_distribution<_RT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    __os << __x.m() << __sp << __x.n();
+    return __os;
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           fisher_f_distribution<_RT>& __x)
+{
+    typedef fisher_f_distribution<_RT> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __m;
+    result_type __n;
+    __is >> __m >> __n;
+    if (!__is.fail())
+        __x.param(param_type(__m, __n));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_FISHER_F_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/gamma_distribution.h b/app/src/main/cpp/libcxx/include/__random/gamma_distribution.h
new file mode 100644
index 0000000..0d7fc3f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/gamma_distribution.h
@@ -0,0 +1,215 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_GAMMA_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_GAMMA_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/exponential_distribution.h>
+#include <__random/is_valid.h>
+#include <__random/uniform_real_distribution.h>
+#include <cmath>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS gamma_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __alpha_;
+        result_type __beta_;
+    public:
+        typedef gamma_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __alpha = 1, result_type __beta = 1)
+            : __alpha_(__alpha), __beta_(__beta) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type alpha() const {return __alpha_;}
+        _LIBCPP_INLINE_VISIBILITY
+        result_type beta() const {return __beta_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__alpha_ == __y.__alpha_ && __x.__beta_ == __y.__beta_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructors and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    gamma_distribution() : gamma_distribution(1) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit gamma_distribution(result_type __alpha, result_type __beta = 1)
+        : __p_(param_type(__alpha, __beta)) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit gamma_distribution(result_type __alpha = 1,
+                                result_type __beta = 1)
+        : __p_(param_type(__alpha, __beta)) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit gamma_distribution(const param_type& __p)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type alpha() const {return __p_.alpha();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type beta() const {return __p_.beta();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::infinity();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const gamma_distribution& __x,
+                        const gamma_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const gamma_distribution& __x,
+                        const gamma_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template <class _RealType>
+template<class _URNG>
+_RealType
+gamma_distribution<_RealType>::operator()(_URNG& __g, const param_type& __p)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    result_type __a = __p.alpha();
+    uniform_real_distribution<result_type> __gen(0, 1);
+    exponential_distribution<result_type> __egen;
+    result_type __x;
+    if (__a == 1)
+        __x = __egen(__g);
+    else if (__a > 1)
+    {
+        const result_type __b = __a - 1;
+        const result_type __c = 3 * __a - result_type(0.75);
+        while (true)
+        {
+            const result_type __u = __gen(__g);
+            const result_type __v = __gen(__g);
+            const result_type __w = __u * (1 - __u);
+            if (__w != 0)
+            {
+                const result_type __y = _VSTD::sqrt(__c / __w) *
+                                        (__u - result_type(0.5));
+                __x = __b + __y;
+                if (__x >= 0)
+                {
+                    const result_type __z = 64 * __w * __w * __w * __v * __v;
+                    if (__z <= 1 - 2 * __y * __y / __x)
+                        break;
+                    if (_VSTD::log(__z) <= 2 * (__b * _VSTD::log(__x / __b) - __y))
+                        break;
+                }
+            }
+        }
+    }
+    else  // __a < 1
+    {
+        while (true)
+        {
+            const result_type __u = __gen(__g);
+            const result_type __es = __egen(__g);
+            if (__u <= 1 - __a)
+            {
+                __x = _VSTD::pow(__u, 1 / __a);
+                if (__x <= __es)
+                    break;
+            }
+            else
+            {
+                const result_type __e = -_VSTD::log((1-__u)/__a);
+                __x = _VSTD::pow(1 - __a + __a * __e, 1 / __a);
+                if (__x <= __e + __es)
+                    break;
+            }
+        }
+    }
+    return __x * __p.beta();
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const gamma_distribution<_RT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    __os << __x.alpha() << __sp << __x.beta();
+    return __os;
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           gamma_distribution<_RT>& __x)
+{
+    typedef gamma_distribution<_RT> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __alpha;
+    result_type __beta;
+    __is >> __alpha >> __beta;
+    if (!__is.fail())
+        __x.param(param_type(__alpha, __beta));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_GAMMA_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/generate_canonical.h b/app/src/main/cpp/libcxx/include/__random/generate_canonical.h
new file mode 100644
index 0000000..5fada6d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/generate_canonical.h
@@ -0,0 +1,53 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_GENERATE_CANONICAL_H
+#define _LIBCPP___RANDOM_GENERATE_CANONICAL_H
+
+#include <__config>
+#include <__random/log2.h>
+#include <cstdint>
+#include <initializer_list>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// generate_canonical
+
+template<class _RealType, size_t __bits, class _URNG>
+_LIBCPP_HIDE_FROM_ABI _RealType
+generate_canonical(_URNG& __g)
+{
+    const size_t _Dt = numeric_limits<_RealType>::digits;
+    const size_t __b = _Dt < __bits ? _Dt : __bits;
+#ifdef _LIBCPP_CXX03_LANG
+    const size_t __logR = __log2<uint64_t, _URNG::_Max - _URNG::_Min + uint64_t(1)>::value;
+#else
+    const size_t __logR = __log2<uint64_t, _URNG::max() - _URNG::min() + uint64_t(1)>::value;
+#endif
+    const size_t __k = __b / __logR + (__b % __logR != 0) + (__b == 0);
+    const _RealType _Rp = static_cast<_RealType>(_URNG::max() - _URNG::min()) + _RealType(1);
+    _RealType __base = _Rp;
+    _RealType _Sp = __g() - _URNG::min();
+    for (size_t __i = 1; __i < __k; ++__i, __base *= _Rp)
+        _Sp += (__g() - _URNG::min()) * __base;
+    return _Sp / __base;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_GENERATE_CANONICAL_H
diff --git a/app/src/main/cpp/libcxx/include/__random/geometric_distribution.h b/app/src/main/cpp/libcxx/include/__random/geometric_distribution.h
new file mode 100644
index 0000000..8f9bdff
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/geometric_distribution.h
@@ -0,0 +1,143 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_GEOMETRIC_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_GEOMETRIC_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/is_valid.h>
+#include <__random/negative_binomial_distribution.h>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _IntType = int>
+class _LIBCPP_TEMPLATE_VIS geometric_distribution
+{
+    static_assert(__libcpp_random_is_valid_inttype<_IntType>::value, "IntType must be a supported integer type");
+public:
+    // types
+    typedef _IntType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        double __p_;
+    public:
+        typedef geometric_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(double __p = 0.5) : __p_(__p) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        double p() const {return __p_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__p_ == __y.__p_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructors and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    geometric_distribution() : geometric_distribution(0.5) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit geometric_distribution(double __p)
+        : __p_(__p) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit geometric_distribution(double __p = 0.5)
+        : __p_(__p) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit geometric_distribution(const param_type& __p) : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g, const param_type& __p)
+        {return negative_binomial_distribution<result_type>(1, __p.p())(__g);}
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    double p() const {return __p_.p();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::max();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const geometric_distribution& __x,
+                        const geometric_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const geometric_distribution& __x,
+                        const geometric_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template <class _CharT, class _Traits, class _IntType>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const geometric_distribution<_IntType>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    return __os << __x.p();
+}
+
+template <class _CharT, class _Traits, class _IntType>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           geometric_distribution<_IntType>& __x)
+{
+    typedef geometric_distribution<_IntType> _Eng;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    double __p;
+    __is >> __p;
+    if (!__is.fail())
+        __x.param(param_type(__p));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_GEOMETRIC_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/independent_bits_engine.h b/app/src/main/cpp/libcxx/include/__random/independent_bits_engine.h
new file mode 100644
index 0000000..151492a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/independent_bits_engine.h
@@ -0,0 +1,267 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_INDEPENDENT_BITS_ENGINE_H
+#define _LIBCPP___RANDOM_INDEPENDENT_BITS_ENGINE_H
+
+#include <__config>
+#include <__random/is_seed_sequence.h>
+#include <__random/log2.h>
+#include <__utility/move.h>
+#include <iosfwd>
+#include <limits>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Engine, size_t __w, class _UIntType>
+class _LIBCPP_TEMPLATE_VIS independent_bits_engine
+{
+    template <class _UInt, _UInt _R0, size_t _Wp, size_t _Mp>
+    class __get_n
+    {
+        static _LIBCPP_CONSTEXPR const size_t _Dt = numeric_limits<_UInt>::digits;
+        static _LIBCPP_CONSTEXPR const size_t _Np = _Wp / _Mp + (_Wp % _Mp != 0);
+        static _LIBCPP_CONSTEXPR const size_t _W0 = _Wp / _Np;
+        static _LIBCPP_CONSTEXPR const _UInt _Y0 = _W0 >= _Dt ? 0 : (_R0 >> _W0) << _W0;
+    public:
+        static _LIBCPP_CONSTEXPR const size_t value = _R0 - _Y0 > _Y0 / _Np ? _Np + 1 : _Np;
+    };
+public:
+    // types
+    typedef _UIntType result_type;
+
+private:
+    _Engine __e_;
+
+    static _LIBCPP_CONSTEXPR const result_type _Dt = numeric_limits<result_type>::digits;
+    static_assert(  0 <  __w, "independent_bits_engine invalid parameters");
+    static_assert(__w <= _Dt, "independent_bits_engine invalid parameters");
+
+    typedef typename _Engine::result_type _Engine_result_type;
+    typedef __conditional_t<sizeof(_Engine_result_type) <= sizeof(result_type), result_type, _Engine_result_type>
+        _Working_result_type;
+#ifdef _LIBCPP_CXX03_LANG
+    static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min
+                                          + _Working_result_type(1);
+#else
+    static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min()
+                                                            + _Working_result_type(1);
+#endif
+    static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value;
+    static _LIBCPP_CONSTEXPR const size_t __n = __get_n<_Working_result_type, _Rp, __w, __m>::value;
+    static _LIBCPP_CONSTEXPR const size_t __w0 = __w / __n;
+    static _LIBCPP_CONSTEXPR const size_t __n0 = __n - __w % __n;
+    static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits;
+    static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits;
+    static _LIBCPP_CONSTEXPR const _Working_result_type __y0 = __w0 >= _WDt ? 0 :
+                                                               (_Rp >> __w0) << __w0;
+    static _LIBCPP_CONSTEXPR const _Working_result_type __y1 = __w0 >= _WDt - 1 ? 0 :
+                                                               (_Rp >> (__w0+1)) << (__w0+1);
+    static _LIBCPP_CONSTEXPR const _Engine_result_type __mask0 = __w0 > 0 ?
+                                _Engine_result_type(~0) >> (_EDt - __w0) :
+                                _Engine_result_type(0);
+    static _LIBCPP_CONSTEXPR const _Engine_result_type __mask1 = __w0 < _EDt - 1 ?
+                                _Engine_result_type(~0) >> (_EDt - (__w0 + 1)) :
+                                _Engine_result_type(~0);
+public:
+    static _LIBCPP_CONSTEXPR const result_type _Min = 0;
+    static _LIBCPP_CONSTEXPR const result_type _Max = __w == _Dt ? result_type(~0) :
+                                                      (result_type(1) << __w) - result_type(1);
+    static_assert(_Min < _Max, "independent_bits_engine invalid parameters");
+
+    // engine characteristics
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type min() { return _Min; }
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type max() { return _Max; }
+
+    // constructors and seeding functions
+    _LIBCPP_INLINE_VISIBILITY
+    independent_bits_engine() {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit independent_bits_engine(const _Engine& __e)
+        : __e_(__e) {}
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    explicit independent_bits_engine(_Engine&& __e)
+        : __e_(_VSTD::move(__e)) {}
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    explicit independent_bits_engine(result_type __sd) : __e_(__sd) {}
+    template<class _Sseq>
+        _LIBCPP_INLINE_VISIBILITY
+        explicit independent_bits_engine(_Sseq& __q,
+        typename enable_if<__is_seed_sequence<_Sseq, independent_bits_engine>::value &&
+                           !is_convertible<_Sseq, _Engine>::value>::type* = 0)
+         : __e_(__q) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void seed() {__e_.seed();}
+    _LIBCPP_INLINE_VISIBILITY
+    void seed(result_type __sd) {__e_.seed(__sd);}
+    template<class _Sseq>
+        _LIBCPP_INLINE_VISIBILITY
+        typename enable_if
+        <
+            __is_seed_sequence<_Sseq, independent_bits_engine>::value,
+            void
+        >::type
+        seed(_Sseq& __q) {__e_.seed(__q);}
+
+    // generating functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());}
+    _LIBCPP_INLINE_VISIBILITY
+    void discard(unsigned long long __z) {for (; __z; --__z) operator()();}
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    const _Engine& base() const _NOEXCEPT {return __e_;}
+
+    template<class _Eng, size_t _Wp, class _UInt>
+    friend
+    bool
+    operator==(
+        const independent_bits_engine<_Eng, _Wp, _UInt>& __x,
+        const independent_bits_engine<_Eng, _Wp, _UInt>& __y);
+
+    template<class _Eng, size_t _Wp, class _UInt>
+    friend
+    bool
+    operator!=(
+        const independent_bits_engine<_Eng, _Wp, _UInt>& __x,
+        const independent_bits_engine<_Eng, _Wp, _UInt>& __y);
+
+    template <class _CharT, class _Traits,
+              class _Eng, size_t _Wp, class _UInt>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+               const independent_bits_engine<_Eng, _Wp, _UInt>& __x);
+
+    template <class _CharT, class _Traits,
+              class _Eng, size_t _Wp, class _UInt>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+               independent_bits_engine<_Eng, _Wp, _UInt>& __x);
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    result_type __eval(false_type);
+    result_type __eval(true_type);
+
+    template <size_t __count>
+        _LIBCPP_INLINE_VISIBILITY
+        static
+        typename enable_if
+        <
+            __count < _Dt,
+            result_type
+        >::type
+        __lshift(result_type __x) {return __x << __count;}
+
+    template <size_t __count>
+        _LIBCPP_INLINE_VISIBILITY
+        static
+        typename enable_if
+        <
+            (__count >= _Dt),
+            result_type
+        >::type
+        __lshift(result_type) {return result_type(0);}
+};
+
+template<class _Engine, size_t __w, class _UIntType>
+inline
+_UIntType
+independent_bits_engine<_Engine, __w, _UIntType>::__eval(false_type)
+{
+    return static_cast<result_type>(__e_() & __mask0);
+}
+
+template<class _Engine, size_t __w, class _UIntType>
+_UIntType
+independent_bits_engine<_Engine, __w, _UIntType>::__eval(true_type)
+{
+    result_type _Sp = 0;
+    for (size_t __k = 0; __k < __n0; ++__k)
+    {
+        _Engine_result_type __u;
+        do
+        {
+            __u = __e_() - _Engine::min();
+        } while (__u >= __y0);
+        _Sp = static_cast<result_type>(__lshift<__w0>(_Sp) + (__u & __mask0));
+    }
+    for (size_t __k = __n0; __k < __n; ++__k)
+    {
+        _Engine_result_type __u;
+        do
+        {
+            __u = __e_() - _Engine::min();
+        } while (__u >= __y1);
+        _Sp = static_cast<result_type>(__lshift<__w0+1>(_Sp) + (__u & __mask1));
+    }
+    return _Sp;
+}
+
+template<class _Eng, size_t _Wp, class _UInt>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(
+    const independent_bits_engine<_Eng, _Wp, _UInt>& __x,
+    const independent_bits_engine<_Eng, _Wp, _UInt>& __y)
+{
+    return __x.base() == __y.base();
+}
+
+template<class _Eng, size_t _Wp, class _UInt>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(
+    const independent_bits_engine<_Eng, _Wp, _UInt>& __x,
+    const independent_bits_engine<_Eng, _Wp, _UInt>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _CharT, class _Traits,
+          class _Eng, size_t _Wp, class _UInt>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const independent_bits_engine<_Eng, _Wp, _UInt>& __x)
+{
+    return __os << __x.base();
+}
+
+template <class _CharT, class _Traits,
+          class _Eng, size_t _Wp, class _UInt>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           independent_bits_engine<_Eng, _Wp, _UInt>& __x)
+{
+    _Eng __e;
+    __is >> __e;
+    if (!__is.fail())
+        __x.__e_ = __e;
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_INDEPENDENT_BITS_ENGINE_H
diff --git a/app/src/main/cpp/libcxx/include/__random/is_seed_sequence.h b/app/src/main/cpp/libcxx/include/__random/is_seed_sequence.h
new file mode 100644
index 0000000..3c82b27
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/is_seed_sequence.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_IS_SEED_SEQUENCE_H
+#define _LIBCPP___RANDOM_IS_SEED_SEQUENCE_H
+
+#include <__config>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Sseq, class _Engine>
+struct __is_seed_sequence
+{
+    static _LIBCPP_CONSTEXPR const bool value =
+              !is_convertible<_Sseq, typename _Engine::result_type>::value &&
+              !is_same<__remove_cv_t<_Sseq>, _Engine>::value;
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANDOM_IS_SEED_SEQUENCE_H
diff --git a/app/src/main/cpp/libcxx/include/__random/is_valid.h b/app/src/main/cpp/libcxx/include/__random/is_valid.h
new file mode 100644
index 0000000..1d65de0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/is_valid.h
@@ -0,0 +1,61 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_IS_VALID_H
+#define _LIBCPP___RANDOM_IS_VALID_H
+
+#include <__config>
+#include <cstdint>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// [rand.req.genl]/1.5:
+// The effect of instantiating a template that has a template type parameter
+// named IntType is undefined unless the corresponding template argument is
+// cv-unqualified and is one of short, int, long, long long, unsigned short,
+// unsigned int, unsigned long, or unsigned long long.
+
+template<class> struct __libcpp_random_is_valid_inttype : false_type {};
+template<> struct __libcpp_random_is_valid_inttype<int8_t> : true_type {}; // extension
+template<> struct __libcpp_random_is_valid_inttype<short> : true_type {};
+template<> struct __libcpp_random_is_valid_inttype<int> : true_type {};
+template<> struct __libcpp_random_is_valid_inttype<long> : true_type {};
+template<> struct __libcpp_random_is_valid_inttype<long long> : true_type {};
+template<> struct __libcpp_random_is_valid_inttype<uint8_t> : true_type {}; // extension
+template<> struct __libcpp_random_is_valid_inttype<unsigned short> : true_type {};
+template<> struct __libcpp_random_is_valid_inttype<unsigned int> : true_type {};
+template<> struct __libcpp_random_is_valid_inttype<unsigned long> : true_type {};
+template<> struct __libcpp_random_is_valid_inttype<unsigned long long> : true_type {};
+
+#ifndef _LIBCPP_HAS_NO_INT128
+template<> struct __libcpp_random_is_valid_inttype<__int128_t> : true_type {}; // extension
+template<> struct __libcpp_random_is_valid_inttype<__uint128_t> : true_type {}; // extension
+#endif // _LIBCPP_HAS_NO_INT128
+
+// [rand.req.urng]/3:
+// A class G meets the uniform random bit generator requirements if G models
+// uniform_random_bit_generator, invoke_result_t<G&> is an unsigned integer type,
+// and G provides a nested typedef-name result_type that denotes the same type
+// as invoke_result_t<G&>.
+// (In particular, reject URNGs with signed result_types; our distributions cannot
+// handle such generator types.)
+
+template<class, class = void> struct __libcpp_random_is_valid_urng : false_type {};
+template<class _Gp> struct __libcpp_random_is_valid_urng<_Gp, __enable_if_t<
+    is_unsigned<typename _Gp::result_type>::value &&
+    _IsSame<decltype(std::declval<_Gp&>()()), typename _Gp::result_type>::value
+> > : true_type {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANDOM_IS_VALID_H
diff --git a/app/src/main/cpp/libcxx/include/__random/knuth_b.h b/app/src/main/cpp/libcxx/include/__random/knuth_b.h
new file mode 100644
index 0000000..f5b31cb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/knuth_b.h
@@ -0,0 +1,26 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_KNUTH_B_H
+#define _LIBCPP___RANDOM_KNUTH_B_H
+
+#include <__config>
+#include <__random/linear_congruential_engine.h>
+#include <__random/shuffle_order_engine.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+typedef shuffle_order_engine<minstd_rand0, 256> knuth_b;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANDOM_KNUTH_B_H
diff --git a/app/src/main/cpp/libcxx/include/__random/linear_congruential_engine.h b/app/src/main/cpp/libcxx/include/__random/linear_congruential_engine.h
new file mode 100644
index 0000000..0d91f14
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/linear_congruential_engine.h
@@ -0,0 +1,398 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_LINEAR_CONGRUENTIAL_ENGINE_H
+#define _LIBCPP___RANDOM_LINEAR_CONGRUENTIAL_ENGINE_H
+
+#include <__config>
+#include <__random/is_seed_sequence.h>
+#include <cstdint>
+#include <iosfwd>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <unsigned long long __a, unsigned long long __c,
+          unsigned long long __m, unsigned long long _Mp,
+          bool _MightOverflow = (__a != 0 && __m != 0 && __m-1 > (_Mp-__c)/__a),
+          bool _OverflowOK = ((__m | (__m-1)) > __m), // m = 2^n
+          bool _SchrageOK = (__a != 0 && __m != 0 && __m % __a <= __m / __a)> // r <= q
+struct __lce_alg_picker
+{
+    static_assert(__a != 0 || __m != 0 || !_MightOverflow || _OverflowOK || _SchrageOK,
+                  "The current values of a, c, and m cannot generate a number "
+                  "within bounds of linear_congruential_engine.");
+
+    static _LIBCPP_CONSTEXPR const bool __use_schrage = _MightOverflow &&
+                                                        !_OverflowOK &&
+                                                        _SchrageOK;
+};
+
+template <unsigned long long __a, unsigned long long __c,
+          unsigned long long __m, unsigned long long _Mp,
+          bool _UseSchrage = __lce_alg_picker<__a, __c, __m, _Mp>::__use_schrage>
+struct __lce_ta;
+
+// 64
+
+template <unsigned long long __a, unsigned long long __c, unsigned long long __m>
+struct __lce_ta<__a, __c, __m, (unsigned long long)(~0), true>
+{
+    typedef unsigned long long result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    static result_type next(result_type __x)
+    {
+        // Schrage's algorithm
+        const result_type __q = __m / __a;
+        const result_type __r = __m % __a;
+        const result_type __t0 = __a * (__x % __q);
+        const result_type __t1 = __r * (__x / __q);
+        __x = __t0 + (__t0 < __t1) * __m - __t1;
+        __x += __c - (__x >= __m - __c) * __m;
+        return __x;
+    }
+};
+
+template <unsigned long long __a, unsigned long long __m>
+struct __lce_ta<__a, 0, __m, (unsigned long long)(~0), true>
+{
+    typedef unsigned long long result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    static result_type next(result_type __x)
+    {
+        // Schrage's algorithm
+        const result_type __q = __m / __a;
+        const result_type __r = __m % __a;
+        const result_type __t0 = __a * (__x % __q);
+        const result_type __t1 = __r * (__x / __q);
+        __x = __t0 + (__t0 < __t1) * __m - __t1;
+        return __x;
+    }
+};
+
+template <unsigned long long __a, unsigned long long __c, unsigned long long __m>
+struct __lce_ta<__a, __c, __m, (unsigned long long)(~0), false>
+{
+    typedef unsigned long long result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    static result_type next(result_type __x)
+    {
+        return (__a * __x + __c) % __m;
+    }
+};
+
+template <unsigned long long __a, unsigned long long __c>
+struct __lce_ta<__a, __c, 0, (unsigned long long)(~0), false>
+{
+    typedef unsigned long long result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    static result_type next(result_type __x)
+    {
+        return __a * __x + __c;
+    }
+};
+
+// 32
+
+template <unsigned long long _Ap, unsigned long long _Cp, unsigned long long _Mp>
+struct __lce_ta<_Ap, _Cp, _Mp, unsigned(~0), true>
+{
+    typedef unsigned result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    static result_type next(result_type __x)
+    {
+        const result_type __a = static_cast<result_type>(_Ap);
+        const result_type __c = static_cast<result_type>(_Cp);
+        const result_type __m = static_cast<result_type>(_Mp);
+        // Schrage's algorithm
+        const result_type __q = __m / __a;
+        const result_type __r = __m % __a;
+        const result_type __t0 = __a * (__x % __q);
+        const result_type __t1 = __r * (__x / __q);
+        __x = __t0 + (__t0 < __t1) * __m - __t1;
+        __x += __c - (__x >= __m - __c) * __m;
+        return __x;
+    }
+};
+
+template <unsigned long long _Ap, unsigned long long _Mp>
+struct __lce_ta<_Ap, 0, _Mp, unsigned(~0), true>
+{
+    typedef unsigned result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    static result_type next(result_type __x)
+    {
+        const result_type __a = static_cast<result_type>(_Ap);
+        const result_type __m = static_cast<result_type>(_Mp);
+        // Schrage's algorithm
+        const result_type __q = __m / __a;
+        const result_type __r = __m % __a;
+        const result_type __t0 = __a * (__x % __q);
+        const result_type __t1 = __r * (__x / __q);
+        __x = __t0 + (__t0 < __t1) * __m - __t1;
+        return __x;
+    }
+};
+
+template <unsigned long long _Ap, unsigned long long _Cp, unsigned long long _Mp>
+struct __lce_ta<_Ap, _Cp, _Mp, unsigned(~0), false>
+{
+    typedef unsigned result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    static result_type next(result_type __x)
+    {
+        const result_type __a = static_cast<result_type>(_Ap);
+        const result_type __c = static_cast<result_type>(_Cp);
+        const result_type __m = static_cast<result_type>(_Mp);
+        return (__a * __x + __c) % __m;
+    }
+};
+
+template <unsigned long long _Ap, unsigned long long _Cp>
+struct __lce_ta<_Ap, _Cp, 0, unsigned(~0), false>
+{
+    typedef unsigned result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    static result_type next(result_type __x)
+    {
+        const result_type __a = static_cast<result_type>(_Ap);
+        const result_type __c = static_cast<result_type>(_Cp);
+        return __a * __x + __c;
+    }
+};
+
+// 16
+
+template <unsigned long long __a, unsigned long long __c, unsigned long long __m, bool __b>
+struct __lce_ta<__a, __c, __m, (unsigned short)(~0), __b>
+{
+    typedef unsigned short result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    static result_type next(result_type __x)
+    {
+        return static_cast<result_type>(__lce_ta<__a, __c, __m, unsigned(~0)>::next(__x));
+    }
+};
+
+template <class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
+class _LIBCPP_TEMPLATE_VIS linear_congruential_engine;
+
+template <class _CharT, class _Traits,
+          class _Up, _Up _Ap, _Up _Cp, _Up _Np>
+_LIBCPP_INLINE_VISIBILITY
+basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const linear_congruential_engine<_Up, _Ap, _Cp, _Np>&);
+
+template <class _CharT, class _Traits,
+          class _Up, _Up _Ap, _Up _Cp, _Up _Np>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           linear_congruential_engine<_Up, _Ap, _Cp, _Np>& __x);
+
+template <class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
+class _LIBCPP_TEMPLATE_VIS linear_congruential_engine
+{
+public:
+    // types
+    typedef _UIntType result_type;
+
+private:
+    result_type __x_;
+
+    static _LIBCPP_CONSTEXPR const result_type _Mp = result_type(~0);
+
+    static_assert(__m == 0 || __a < __m, "linear_congruential_engine invalid parameters");
+    static_assert(__m == 0 || __c < __m, "linear_congruential_engine invalid parameters");
+    static_assert(is_unsigned<_UIntType>::value, "_UIntType must be unsigned type");
+public:
+    static _LIBCPP_CONSTEXPR const result_type _Min = __c == 0u ? 1u : 0u;
+    static _LIBCPP_CONSTEXPR const result_type _Max = __m - _UIntType(1u);
+    static_assert(_Min < _Max,           "linear_congruential_engine invalid parameters");
+
+    // engine characteristics
+    static _LIBCPP_CONSTEXPR const result_type multiplier = __a;
+    static _LIBCPP_CONSTEXPR const result_type increment = __c;
+    static _LIBCPP_CONSTEXPR const result_type modulus = __m;
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type min() {return _Min;}
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type max() {return _Max;}
+    static _LIBCPP_CONSTEXPR const result_type default_seed = 1u;
+
+    // constructors and seeding functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    linear_congruential_engine() : linear_congruential_engine(default_seed) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit linear_congruential_engine(result_type __s) { seed(__s); }
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit linear_congruential_engine(result_type __s = default_seed) {
+      seed(__s);
+    }
+#endif
+    template<class _Sseq>
+        _LIBCPP_INLINE_VISIBILITY
+        explicit linear_congruential_engine(_Sseq& __q,
+        typename enable_if<__is_seed_sequence<_Sseq, linear_congruential_engine>::value>::type* = 0)
+        {seed(__q);}
+    _LIBCPP_INLINE_VISIBILITY
+    void seed(result_type __s = default_seed)
+        {seed(integral_constant<bool, __m == 0>(),
+              integral_constant<bool, __c == 0>(), __s);}
+    template<class _Sseq>
+        _LIBCPP_INLINE_VISIBILITY
+        typename enable_if
+        <
+            __is_seed_sequence<_Sseq, linear_congruential_engine>::value,
+            void
+        >::type
+        seed(_Sseq& __q)
+            {__seed(__q, integral_constant<unsigned,
+                1 + (__m == 0 ? (sizeof(result_type) * __CHAR_BIT__ - 1)/32
+                             :  (__m > 0x100000000ull))>());}
+
+    // generating functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type operator()()
+        {return __x_ = static_cast<result_type>(__lce_ta<__a, __c, __m, _Mp>::next(__x_));}
+    _LIBCPP_INLINE_VISIBILITY
+    void discard(unsigned long long __z) {for (; __z; --__z) operator()();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const linear_congruential_engine& __x,
+                    const linear_congruential_engine& __y)
+        {return __x.__x_ == __y.__x_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const linear_congruential_engine& __x,
+                    const linear_congruential_engine& __y)
+        {return !(__x == __y);}
+
+private:
+
+    _LIBCPP_INLINE_VISIBILITY
+    void seed(true_type, true_type, result_type __s) {__x_ = __s == 0 ? 1 : __s;}
+    _LIBCPP_INLINE_VISIBILITY
+    void seed(true_type, false_type, result_type __s) {__x_ = __s;}
+    _LIBCPP_INLINE_VISIBILITY
+    void seed(false_type, true_type, result_type __s) {__x_ = __s % __m == 0 ?
+                                                                 1 : __s % __m;}
+    _LIBCPP_INLINE_VISIBILITY
+    void seed(false_type, false_type, result_type __s) {__x_ = __s % __m;}
+
+    template<class _Sseq>
+        void __seed(_Sseq& __q, integral_constant<unsigned, 1>);
+    template<class _Sseq>
+        void __seed(_Sseq& __q, integral_constant<unsigned, 2>);
+
+    template <class _CharT, class _Traits,
+              class _Up, _Up _Ap, _Up _Cp, _Up _Np>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+               const linear_congruential_engine<_Up, _Ap, _Cp, _Np>&);
+
+    template <class _CharT, class _Traits,
+              class _Up, _Up _Ap, _Up _Cp, _Up _Np>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+               linear_congruential_engine<_Up, _Ap, _Cp, _Np>& __x);
+};
+
+template <class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
+    _LIBCPP_CONSTEXPR const typename linear_congruential_engine<_UIntType, __a, __c, __m>::result_type
+    linear_congruential_engine<_UIntType, __a, __c, __m>::multiplier;
+
+template <class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
+    _LIBCPP_CONSTEXPR const typename linear_congruential_engine<_UIntType, __a, __c, __m>::result_type
+    linear_congruential_engine<_UIntType, __a, __c, __m>::increment;
+
+template <class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
+    _LIBCPP_CONSTEXPR const typename linear_congruential_engine<_UIntType, __a, __c, __m>::result_type
+    linear_congruential_engine<_UIntType, __a, __c, __m>::modulus;
+
+template <class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
+    _LIBCPP_CONSTEXPR const typename linear_congruential_engine<_UIntType, __a, __c, __m>::result_type
+    linear_congruential_engine<_UIntType, __a, __c, __m>::default_seed;
+
+template <class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
+template<class _Sseq>
+void
+linear_congruential_engine<_UIntType, __a, __c, __m>::__seed(_Sseq& __q,
+                                                 integral_constant<unsigned, 1>)
+{
+    const unsigned __k = 1;
+    uint32_t __ar[__k+3];
+    __q.generate(__ar, __ar + __k + 3);
+    result_type __s = static_cast<result_type>(__ar[3] % __m);
+    __x_ = __c == 0 && __s == 0 ? result_type(1) : __s;
+}
+
+template <class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
+template<class _Sseq>
+void
+linear_congruential_engine<_UIntType, __a, __c, __m>::__seed(_Sseq& __q,
+                                                 integral_constant<unsigned, 2>)
+{
+    const unsigned __k = 2;
+    uint32_t __ar[__k+3];
+    __q.generate(__ar, __ar + __k + 3);
+    result_type __s = static_cast<result_type>((__ar[3] +
+                                              ((uint64_t)__ar[4] << 32)) % __m);
+    __x_ = __c == 0 && __s == 0 ? result_type(1) : __s;
+}
+
+template <class _CharT, class _Traits,
+          class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const linear_congruential_engine<_UIntType, __a, __c, __m>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _Ostream;
+    __os.flags(_Ostream::dec | _Ostream::left);
+    __os.fill(__os.widen(' '));
+    return __os << __x.__x_;
+}
+
+template <class _CharT, class _Traits,
+          class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           linear_congruential_engine<_UIntType, __a, __c, __m>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    _UIntType __t;
+    __is >> __t;
+    if (!__is.fail())
+        __x.__x_ = __t;
+    return __is;
+}
+
+typedef linear_congruential_engine<uint_fast32_t, 16807, 0, 2147483647>
+                                                                   minstd_rand0;
+typedef linear_congruential_engine<uint_fast32_t, 48271, 0, 2147483647>
+                                                                    minstd_rand;
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_LINEAR_CONGRUENTIAL_ENGINE_H
diff --git a/app/src/main/cpp/libcxx/include/__random/log2.h b/app/src/main/cpp/libcxx/include/__random/log2.h
new file mode 100644
index 0000000..72bf075
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/log2.h
@@ -0,0 +1,71 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_LOG2_H
+#define _LIBCPP___RANDOM_LOG2_H
+
+#include <__config>
+#include <cstddef>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _UIntType, _UIntType _Xp, size_t _Rp>
+struct __log2_imp;
+
+template <unsigned long long _Xp, size_t _Rp>
+struct __log2_imp<unsigned long long, _Xp, _Rp>
+{
+    static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp
+                                           : __log2_imp<unsigned long long, _Xp, _Rp - 1>::value;
+};
+
+template <unsigned long long _Xp>
+struct __log2_imp<unsigned long long, _Xp, 0>
+{
+    static const size_t value = 0;
+};
+
+template <size_t _Rp>
+struct __log2_imp<unsigned long long, 0, _Rp>
+{
+    static const size_t value = _Rp + 1;
+};
+
+#ifndef _LIBCPP_HAS_NO_INT128
+
+template <__uint128_t _Xp, size_t _Rp>
+struct __log2_imp<__uint128_t, _Xp, _Rp>
+{
+    static const size_t value = (_Xp >> 64)
+        ? (64 + __log2_imp<unsigned long long, (_Xp >> 64), 63>::value)
+        : __log2_imp<unsigned long long, _Xp, 63>::value;
+};
+
+#endif // _LIBCPP_HAS_NO_INT128
+
+template <class _UIntType, _UIntType _Xp>
+struct __log2
+{
+    static const size_t value = __log2_imp<
+#ifndef _LIBCPP_HAS_NO_INT128
+        __conditional_t<sizeof(_UIntType) <= sizeof(unsigned long long), unsigned long long, __uint128_t>,
+#else
+        unsigned long long,
+#endif // _LIBCPP_HAS_NO_INT128
+        _Xp,
+        sizeof(_UIntType) * __CHAR_BIT__ - 1>::value;
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANDOM_LOG2_H
diff --git a/app/src/main/cpp/libcxx/include/__random/lognormal_distribution.h b/app/src/main/cpp/libcxx/include/__random/lognormal_distribution.h
new file mode 100644
index 0000000..048d7da
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/lognormal_distribution.h
@@ -0,0 +1,299 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_LOGNORMAL_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_LOGNORMAL_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/normal_distribution.h>
+#include <cmath>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#ifdef _LIBCPP_ABI_OLD_LOGNORMAL_DISTRIBUTION
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS lognormal_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        normal_distribution<result_type> __nd_;
+    public:
+        typedef lognormal_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __m = 0, result_type __s = 1)
+            : __nd_(__m, __s) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type m() const {return __nd_.mean();}
+        _LIBCPP_INLINE_VISIBILITY
+        result_type s() const {return __nd_.stddev();}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__nd_ == __y.__nd_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+        friend class lognormal_distribution;
+
+        template <class _CharT, class _Traits, class _RT>
+        friend
+        basic_ostream<_CharT, _Traits>&
+        operator<<(basic_ostream<_CharT, _Traits>& __os,
+                   const lognormal_distribution<_RT>& __x);
+
+        template <class _CharT, class _Traits, class _RT>
+        friend
+        basic_istream<_CharT, _Traits>&
+        operator>>(basic_istream<_CharT, _Traits>& __is,
+                   lognormal_distribution<_RT>& __x);
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructor and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    lognormal_distribution() : lognormal_distribution(0) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit lognormal_distribution(result_type __m, result_type __s = 1)
+        : __p_(param_type(__m, __s)) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit lognormal_distribution(result_type __m = 0,
+                                    result_type __s = 1)
+        : __p_(param_type(__m, __s)) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit lognormal_distribution(const param_type& __p)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {__p_.__nd_.reset();}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g, const param_type& __p)
+        {return _VSTD::exp(const_cast<normal_distribution<result_type>&>(__p.__nd_)(__g));}
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type m() const {return __p_.m();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type s() const {return __p_.s();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::infinity();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const lognormal_distribution& __x,
+                        const lognormal_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const lognormal_distribution& __x,
+                        const lognormal_distribution& __y)
+        {return !(__x == __y);}
+
+    template <class _CharT, class _Traits, class _RT>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+               const lognormal_distribution<_RT>& __x);
+
+    template <class _CharT, class _Traits, class _RT>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+               lognormal_distribution<_RT>& __x);
+};
+
+template <class _CharT, class _Traits, class _RT>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const lognormal_distribution<_RT>& __x)
+{
+    return __os << __x.__p_.__nd_;
+}
+
+template <class _CharT, class _Traits, class _RT>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           lognormal_distribution<_RT>& __x)
+{
+    return __is >> __x.__p_.__nd_;
+}
+
+#else // _LIBCPP_ABI_OLD_LOGNORMAL_DISTRIBUTION
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS lognormal_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __m_;
+        result_type __s_;
+    public:
+        typedef lognormal_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __m = 0, result_type __s = 1)
+            : __m_(__m), __s_(__s) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type m() const {return __m_;}
+        _LIBCPP_INLINE_VISIBILITY
+        result_type s() const {return __s_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__m_ == __y.__m_ && __x.__s_ == __y.__s_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    normal_distribution<result_type> __nd_;
+
+public:
+    // constructor and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    lognormal_distribution() : lognormal_distribution(0) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit lognormal_distribution(result_type __m, result_type __s = 1)
+        : __nd_(__m, __s) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit lognormal_distribution(result_type __m = 0,
+                                    result_type __s = 1)
+        : __nd_(__m, __s) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit lognormal_distribution(const param_type& __p)
+        : __nd_(__p.m(), __p.s()) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {__nd_.reset();}
+
+    // generating functions
+    template<class _URNG>
+    _LIBCPP_INLINE_VISIBILITY
+    result_type operator()(_URNG& __g)
+    {
+        return _VSTD::exp(__nd_(__g));
+    }
+
+    template<class _URNG>
+    _LIBCPP_INLINE_VISIBILITY
+    result_type operator()(_URNG& __g, const param_type& __p)
+    {
+        typename normal_distribution<result_type>::param_type __pn(__p.m(), __p.s());
+        return _VSTD::exp(__nd_(__g, __pn));
+    }
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type m() const {return __nd_.mean();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type s() const {return __nd_.stddev();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return param_type(__nd_.mean(), __nd_.stddev());}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p)
+    {
+        typename normal_distribution<result_type>::param_type __pn(__p.m(), __p.s());
+        __nd_.param(__pn);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::infinity();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const lognormal_distribution& __x,
+                        const lognormal_distribution& __y)
+        {return __x.__nd_ == __y.__nd_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const lognormal_distribution& __x,
+                        const lognormal_distribution& __y)
+        {return !(__x == __y);}
+
+    template <class _CharT, class _Traits, class _RT>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+               const lognormal_distribution<_RT>& __x);
+
+    template <class _CharT, class _Traits, class _RT>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+               lognormal_distribution<_RT>& __x);
+};
+
+template <class _CharT, class _Traits, class _RT>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const lognormal_distribution<_RT>& __x)
+{
+    return __os << __x.__nd_;
+}
+
+template <class _CharT, class _Traits, class _RT>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           lognormal_distribution<_RT>& __x)
+{
+    return __is >> __x.__nd_;
+}
+
+#endif // _LIBCPP_ABI_OLD_LOGNORMAL_DISTRIBUTION
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_LOGNORMAL_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/mersenne_twister_engine.h b/app/src/main/cpp/libcxx/include/__random/mersenne_twister_engine.h
new file mode 100644
index 0000000..3a58e31
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/mersenne_twister_engine.h
@@ -0,0 +1,534 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_MERSENNE_TWISTER_ENGINE_H
+#define _LIBCPP___RANDOM_MERSENNE_TWISTER_ENGINE_H
+
+#include <__algorithm/equal.h>
+#include <__algorithm/min.h>
+#include <__config>
+#include <__random/is_seed_sequence.h>
+#include <cstddef>
+#include <cstdint>
+#include <iosfwd>
+#include <limits>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+class _LIBCPP_TEMPLATE_VIS mersenne_twister_engine;
+
+template <class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp,
+          _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
+          _UInt _Bp, size_t _Tp, _UInt _Cp, size_t _Lp, _UInt _Fp>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                         _Bp, _Tp, _Cp, _Lp, _Fp>& __x,
+           const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                         _Bp, _Tp, _Cp, _Lp, _Fp>& __y);
+
+template <class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp,
+          _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
+          _UInt _Bp, size_t _Tp, _UInt _Cp, size_t _Lp, _UInt _Fp>
+_LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                         _Bp, _Tp, _Cp, _Lp, _Fp>& __x,
+           const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                         _Bp, _Tp, _Cp, _Lp, _Fp>& __y);
+
+template <class _CharT, class _Traits,
+          class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp,
+          _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
+          _UInt _Bp, size_t _Tp, _UInt _Cp, size_t _Lp, _UInt _Fp>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                         _Bp, _Tp, _Cp, _Lp, _Fp>& __x);
+
+template <class _CharT, class _Traits,
+          class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp,
+          _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
+          _UInt _Bp, size_t _Tp, _UInt _Cp, size_t _Lp, _UInt _Fp>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                   _Bp, _Tp, _Cp, _Lp, _Fp>& __x);
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+class _LIBCPP_TEMPLATE_VIS mersenne_twister_engine
+{
+public:
+    // types
+    typedef _UIntType result_type;
+
+private:
+    result_type __x_[__n];
+    size_t      __i_;
+
+    static_assert(  0 <  __m, "mersenne_twister_engine invalid parameters");
+    static_assert(__m <= __n, "mersenne_twister_engine invalid parameters");
+    static _LIBCPP_CONSTEXPR const result_type _Dt = numeric_limits<result_type>::digits;
+    static_assert(__w <= _Dt, "mersenne_twister_engine invalid parameters");
+    static_assert(  2 <= __w, "mersenne_twister_engine invalid parameters");
+    static_assert(__r <= __w, "mersenne_twister_engine invalid parameters");
+    static_assert(__u <= __w, "mersenne_twister_engine invalid parameters");
+    static_assert(__s <= __w, "mersenne_twister_engine invalid parameters");
+    static_assert(__t <= __w, "mersenne_twister_engine invalid parameters");
+    static_assert(__l <= __w, "mersenne_twister_engine invalid parameters");
+public:
+    static _LIBCPP_CONSTEXPR const result_type _Min = 0;
+    static _LIBCPP_CONSTEXPR const result_type _Max = __w == _Dt ? result_type(~0) :
+                                                      (result_type(1) << __w) - result_type(1);
+    static_assert(_Min < _Max, "mersenne_twister_engine invalid parameters");
+    static_assert(__a <= _Max, "mersenne_twister_engine invalid parameters");
+    static_assert(__b <= _Max, "mersenne_twister_engine invalid parameters");
+    static_assert(__c <= _Max, "mersenne_twister_engine invalid parameters");
+    static_assert(__d <= _Max, "mersenne_twister_engine invalid parameters");
+    static_assert(__f <= _Max, "mersenne_twister_engine invalid parameters");
+
+    // engine characteristics
+    static _LIBCPP_CONSTEXPR const size_t word_size = __w;
+    static _LIBCPP_CONSTEXPR const size_t state_size = __n;
+    static _LIBCPP_CONSTEXPR const size_t shift_size = __m;
+    static _LIBCPP_CONSTEXPR const size_t mask_bits = __r;
+    static _LIBCPP_CONSTEXPR const result_type xor_mask = __a;
+    static _LIBCPP_CONSTEXPR const size_t tempering_u = __u;
+    static _LIBCPP_CONSTEXPR const result_type tempering_d = __d;
+    static _LIBCPP_CONSTEXPR const size_t tempering_s = __s;
+    static _LIBCPP_CONSTEXPR const result_type tempering_b = __b;
+    static _LIBCPP_CONSTEXPR const size_t tempering_t = __t;
+    static _LIBCPP_CONSTEXPR const result_type tempering_c = __c;
+    static _LIBCPP_CONSTEXPR const size_t tempering_l = __l;
+    static _LIBCPP_CONSTEXPR const result_type initialization_multiplier = __f;
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type min() { return _Min; }
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type max() { return _Max; }
+    static _LIBCPP_CONSTEXPR const result_type default_seed = 5489u;
+
+    // constructors and seeding functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    mersenne_twister_engine() : mersenne_twister_engine(default_seed) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit mersenne_twister_engine(result_type __sd) { seed(__sd); }
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit mersenne_twister_engine(result_type __sd = default_seed) {
+      seed(__sd);
+    }
+#endif
+    template<class _Sseq>
+        _LIBCPP_INLINE_VISIBILITY
+        explicit mersenne_twister_engine(_Sseq& __q,
+        typename enable_if<__is_seed_sequence<_Sseq, mersenne_twister_engine>::value>::type* = 0)
+        {seed(__q);}
+    void seed(result_type __sd = default_seed);
+    template<class _Sseq>
+        _LIBCPP_INLINE_VISIBILITY
+        typename enable_if
+        <
+            __is_seed_sequence<_Sseq, mersenne_twister_engine>::value,
+            void
+        >::type
+        seed(_Sseq& __q)
+            {__seed(__q, integral_constant<unsigned, 1 + (__w - 1) / 32>());}
+
+    // generating functions
+    result_type operator()();
+    _LIBCPP_INLINE_VISIBILITY
+    void discard(unsigned long long __z) {for (; __z; --__z) operator()();}
+
+    template <class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp,
+              _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
+              _UInt _Bp, size_t _Tp, _UInt _Cp, size_t _Lp, _UInt _Fp>
+    friend
+    bool
+    operator==(const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                             _Bp, _Tp, _Cp, _Lp, _Fp>& __x,
+               const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                             _Bp, _Tp, _Cp, _Lp, _Fp>& __y);
+
+    template <class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp,
+              _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
+              _UInt _Bp, size_t _Tp, _UInt _Cp, size_t _Lp, _UInt _Fp>
+    friend
+    bool
+    operator!=(const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                             _Bp, _Tp, _Cp, _Lp, _Fp>& __x,
+               const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                             _Bp, _Tp, _Cp, _Lp, _Fp>& __y);
+
+    template <class _CharT, class _Traits,
+              class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp,
+              _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
+              _UInt _Bp, size_t _Tp, _UInt _Cp, size_t _Lp, _UInt _Fp>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+               const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                             _Bp, _Tp, _Cp, _Lp, _Fp>& __x);
+
+    template <class _CharT, class _Traits,
+              class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp,
+              _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
+              _UInt _Bp, size_t _Tp, _UInt _Cp, size_t _Lp, _UInt _Fp>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+               mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                       _Bp, _Tp, _Cp, _Lp, _Fp>& __x);
+private:
+
+    template<class _Sseq>
+        void __seed(_Sseq& __q, integral_constant<unsigned, 1>);
+    template<class _Sseq>
+        void __seed(_Sseq& __q, integral_constant<unsigned, 2>);
+
+    template <size_t __count>
+        _LIBCPP_INLINE_VISIBILITY
+        static
+        typename enable_if
+        <
+            __count < __w,
+            result_type
+        >::type
+        __lshift(result_type __x) {return (__x << __count) & _Max;}
+
+    template <size_t __count>
+        _LIBCPP_INLINE_VISIBILITY
+        static
+        typename enable_if
+        <
+            (__count >= __w),
+            result_type
+        >::type
+        __lshift(result_type) {return result_type(0);}
+
+    template <size_t __count>
+        _LIBCPP_INLINE_VISIBILITY
+        static
+        typename enable_if
+        <
+            __count < _Dt,
+            result_type
+        >::type
+        __rshift(result_type __x) {return __x >> __count;}
+
+    template <size_t __count>
+        _LIBCPP_INLINE_VISIBILITY
+        static
+        typename enable_if
+        <
+            (__count >= _Dt),
+            result_type
+        >::type
+        __rshift(result_type) {return result_type(0);}
+};
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const size_t
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::word_size;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const size_t
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::state_size;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const size_t
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::shift_size;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const size_t
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::mask_bits;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const typename mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::result_type
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::xor_mask;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const size_t
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::tempering_u;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const typename mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::result_type
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::tempering_d;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const size_t
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::tempering_s;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const typename mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::result_type
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::tempering_b;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const size_t
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::tempering_t;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const typename mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::result_type
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::tempering_c;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const size_t
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::tempering_l;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const typename mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::result_type
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::initialization_multiplier;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+    _LIBCPP_CONSTEXPR const typename mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::result_type
+    mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f>::default_seed;
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+void
+mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b,
+    __t, __c, __l, __f>::seed(result_type __sd)
+    _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+{   // __w >= 2
+    __x_[0] = __sd & _Max;
+    for (size_t __i = 1; __i < __n; ++__i)
+        __x_[__i] = (__f * (__x_[__i-1] ^ __rshift<__w - 2>(__x_[__i-1])) + __i) & _Max;
+    __i_ = 0;
+}
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+template<class _Sseq>
+void
+mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b,
+    __t, __c, __l, __f>::__seed(_Sseq& __q, integral_constant<unsigned, 1>)
+{
+    const unsigned __k = 1;
+    uint32_t __ar[__n * __k];
+    __q.generate(__ar, __ar + __n * __k);
+    for (size_t __i = 0; __i < __n; ++__i)
+        __x_[__i] = static_cast<result_type>(__ar[__i] & _Max);
+    const result_type __mask = __r == _Dt ? result_type(~0) :
+                                       (result_type(1) << __r) - result_type(1);
+    __i_ = 0;
+    if ((__x_[0] & ~__mask) == 0)
+    {
+        for (size_t __i = 1; __i < __n; ++__i)
+            if (__x_[__i] != 0)
+                return;
+        __x_[0] = result_type(1) << (__w - 1);
+    }
+}
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+template<class _Sseq>
+void
+mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b,
+    __t, __c, __l, __f>::__seed(_Sseq& __q, integral_constant<unsigned, 2>)
+{
+    const unsigned __k = 2;
+    uint32_t __ar[__n * __k];
+    __q.generate(__ar, __ar + __n * __k);
+    for (size_t __i = 0; __i < __n; ++__i)
+        __x_[__i] = static_cast<result_type>(
+            (__ar[2 * __i] + ((uint64_t)__ar[2 * __i + 1] << 32)) & _Max);
+    const result_type __mask = __r == _Dt ? result_type(~0) :
+                                       (result_type(1) << __r) - result_type(1);
+    __i_ = 0;
+    if ((__x_[0] & ~__mask) == 0)
+    {
+        for (size_t __i = 1; __i < __n; ++__i)
+            if (__x_[__i] != 0)
+                return;
+        __x_[0] = result_type(1) << (__w - 1);
+    }
+}
+
+template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
+          _UIntType __a, size_t __u, _UIntType __d, size_t __s,
+          _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
+_UIntType
+mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b,
+    __t, __c, __l, __f>::operator()()
+{
+    const size_t __j = (__i_ + 1) % __n;
+    const result_type __mask = __r == _Dt ? result_type(~0) :
+                                       (result_type(1) << __r) - result_type(1);
+    const result_type _Yp = (__x_[__i_] & ~__mask) | (__x_[__j] & __mask);
+    const size_t __k = (__i_ + __m) % __n;
+    __x_[__i_] = __x_[__k] ^ __rshift<1>(_Yp) ^ (__a * (_Yp & 1));
+    result_type __z = __x_[__i_] ^ (__rshift<__u>(__x_[__i_]) & __d);
+    __i_ = __j;
+    __z ^= __lshift<__s>(__z) & __b;
+    __z ^= __lshift<__t>(__z) & __c;
+    return __z ^ __rshift<__l>(__z);
+}
+
+template <class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp,
+          _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
+          _UInt _Bp, size_t _Tp, _UInt _Cp, size_t _Lp, _UInt _Fp>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                         _Bp, _Tp, _Cp, _Lp, _Fp>& __x,
+           const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                         _Bp, _Tp, _Cp, _Lp, _Fp>& __y)
+{
+    if (__x.__i_ == __y.__i_)
+        return _VSTD::equal(__x.__x_, __x.__x_ + _Np, __y.__x_);
+    if (__x.__i_ == 0 || __y.__i_ == 0)
+    {
+        size_t __j = _VSTD::min(_Np - __x.__i_, _Np - __y.__i_);
+        if (!_VSTD::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j,
+                         __y.__x_ + __y.__i_))
+            return false;
+        if (__x.__i_ == 0)
+            return _VSTD::equal(__x.__x_ + __j, __x.__x_ + _Np, __y.__x_);
+        return _VSTD::equal(__x.__x_, __x.__x_ + (_Np - __j), __y.__x_ + __j);
+    }
+    if (__x.__i_ < __y.__i_)
+    {
+        size_t __j = _Np - __y.__i_;
+        if (!_VSTD::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j),
+                         __y.__x_ + __y.__i_))
+            return false;
+        if (!_VSTD::equal(__x.__x_ + (__x.__i_ + __j), __x.__x_ + _Np,
+                         __y.__x_))
+            return false;
+        return _VSTD::equal(__x.__x_, __x.__x_ + __x.__i_,
+                           __y.__x_ + (_Np - (__x.__i_ + __j)));
+    }
+    size_t __j = _Np - __x.__i_;
+    if (!_VSTD::equal(__y.__x_ + __y.__i_, __y.__x_ + (__y.__i_ + __j),
+                     __x.__x_ + __x.__i_))
+        return false;
+    if (!_VSTD::equal(__y.__x_ + (__y.__i_ + __j), __y.__x_ + _Np,
+                     __x.__x_))
+        return false;
+    return _VSTD::equal(__y.__x_, __y.__x_ + __y.__i_,
+                       __x.__x_ + (_Np - (__y.__i_ + __j)));
+}
+
+template <class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp,
+          _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
+          _UInt _Bp, size_t _Tp, _UInt _Cp, size_t _Lp, _UInt _Fp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                         _Bp, _Tp, _Cp, _Lp, _Fp>& __x,
+           const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                         _Bp, _Tp, _Cp, _Lp, _Fp>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _CharT, class _Traits,
+          class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp,
+          _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
+          _UInt _Bp, size_t _Tp, _UInt _Cp, size_t _Lp, _UInt _Fp>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                         _Bp, _Tp, _Cp, _Lp, _Fp>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _Ostream;
+    __os.flags(_Ostream::dec | _Ostream::left);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    __os << __x.__x_[__x.__i_];
+    for (size_t __j = __x.__i_ + 1; __j < _Np; ++__j)
+        __os << __sp << __x.__x_[__j];
+    for (size_t __j = 0; __j < __x.__i_; ++__j)
+        __os << __sp << __x.__x_[__j];
+    return __os;
+}
+
+template <class _CharT, class _Traits,
+          class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp,
+          _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
+          _UInt _Bp, size_t _Tp, _UInt _Cp, size_t _Lp, _UInt _Fp>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           mersenne_twister_engine<_UInt, _Wp, _Np, _Mp, _Rp, _Ap, _Up, _Dp, _Sp,
+                                   _Bp, _Tp, _Cp, _Lp, _Fp>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    _UInt __t[_Np];
+    for (size_t __i = 0; __i < _Np; ++__i)
+        __is >> __t[__i];
+    if (!__is.fail())
+    {
+        for (size_t __i = 0; __i < _Np; ++__i)
+            __x.__x_[__i] = __t[__i];
+        __x.__i_ = 0;
+    }
+    return __is;
+}
+
+typedef mersenne_twister_engine<uint_fast32_t, 32, 624, 397, 31,
+                                0x9908b0df, 11, 0xffffffff,
+                                7,  0x9d2c5680,
+                                15, 0xefc60000,
+                                18, 1812433253>                         mt19937;
+typedef mersenne_twister_engine<uint_fast64_t, 64, 312, 156, 31,
+                                0xb5026f5aa96619e9ULL, 29, 0x5555555555555555ULL,
+                                17, 0x71d67fffeda60000ULL,
+                                37, 0xfff7eee000000000ULL,
+                                43, 6364136223846793005ULL>          mt19937_64;
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_MERSENNE_TWISTER_ENGINE_H
diff --git a/app/src/main/cpp/libcxx/include/__random/negative_binomial_distribution.h b/app/src/main/cpp/libcxx/include/__random/negative_binomial_distribution.h
new file mode 100644
index 0000000..333c935
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/negative_binomial_distribution.h
@@ -0,0 +1,183 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_NEGATIVE_BINOMIAL_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_NEGATIVE_BINOMIAL_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/bernoulli_distribution.h>
+#include <__random/gamma_distribution.h>
+#include <__random/is_valid.h>
+#include <__random/poisson_distribution.h>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _IntType = int>
+class _LIBCPP_TEMPLATE_VIS negative_binomial_distribution
+{
+    static_assert(__libcpp_random_is_valid_inttype<_IntType>::value, "IntType must be a supported integer type");
+public:
+    // types
+    typedef _IntType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __k_;
+        double __p_;
+    public:
+        typedef negative_binomial_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __k = 1, double __p = 0.5)
+            : __k_(__k), __p_(__p) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type k() const {return __k_;}
+        _LIBCPP_INLINE_VISIBILITY
+        double p() const {return __p_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__k_ == __y.__k_ && __x.__p_ == __y.__p_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructor and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    negative_binomial_distribution() : negative_binomial_distribution(1) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit negative_binomial_distribution(result_type __k, double __p = 0.5)
+        : __p_(__k, __p) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit negative_binomial_distribution(result_type __k = 1,
+                                            double __p = 0.5)
+        : __p_(__k, __p) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit negative_binomial_distribution(const param_type& __p) : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type k() const {return __p_.k();}
+    _LIBCPP_INLINE_VISIBILITY
+    double p() const {return __p_.p();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::max();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const negative_binomial_distribution& __x,
+                        const negative_binomial_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const negative_binomial_distribution& __x,
+                        const negative_binomial_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template <class _IntType>
+template<class _URNG>
+_IntType
+negative_binomial_distribution<_IntType>::operator()(_URNG& __urng, const param_type& __pr)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    result_type __k = __pr.k();
+    double __p = __pr.p();
+    // When the number of bits in _IntType is small, we are too likely to
+    // overflow __f below to use this technique.
+    if (__k <= 21 * __p && sizeof(_IntType) > 1)
+    {
+        bernoulli_distribution __gen(__p);
+        result_type __f = 0;
+        result_type __s = 0;
+        while (__s < __k)
+        {
+            if (__gen(__urng))
+                ++__s;
+            else
+                ++__f;
+        }
+        _LIBCPP_ASSERT(__f >= 0, "std::negative_binomial_distribution should never produce negative values. "
+                                 "This is almost certainly a signed integer overflow issue on __f.");
+        return __f;
+    }
+    return poisson_distribution<result_type>(gamma_distribution<double>
+                                            (__k, (1-__p)/__p)(__urng))(__urng);
+}
+
+template <class _CharT, class _Traits, class _IntType>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const negative_binomial_distribution<_IntType>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    return __os << __x.k() << __sp << __x.p();
+}
+
+template <class _CharT, class _Traits, class _IntType>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           negative_binomial_distribution<_IntType>& __x)
+{
+    typedef negative_binomial_distribution<_IntType> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __k;
+    double __p;
+    __is >> __k >> __p;
+    if (!__is.fail())
+        __x.param(param_type(__k, __p));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_NEGATIVE_BINOMIAL_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/normal_distribution.h b/app/src/main/cpp/libcxx/include/__random/normal_distribution.h
new file mode 100644
index 0000000..b2ed47e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/normal_distribution.h
@@ -0,0 +1,210 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_NORMAL_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_NORMAL_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/is_valid.h>
+#include <__random/uniform_real_distribution.h>
+#include <cmath>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS normal_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __mean_;
+        result_type __stddev_;
+    public:
+        typedef normal_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __mean = 0, result_type __stddev = 1)
+            : __mean_(__mean), __stddev_(__stddev) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type mean() const {return __mean_;}
+        _LIBCPP_INLINE_VISIBILITY
+        result_type stddev() const {return __stddev_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__mean_ == __y.__mean_ && __x.__stddev_ == __y.__stddev_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+    result_type __v_;
+    bool __v_hot_;
+
+public:
+    // constructors and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    normal_distribution() : normal_distribution(0) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit normal_distribution(result_type __mean, result_type __stddev = 1)
+        : __p_(param_type(__mean, __stddev)), __v_hot_(false) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit normal_distribution(result_type __mean = 0,
+                                 result_type __stddev = 1)
+        : __p_(param_type(__mean, __stddev)), __v_hot_(false) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit normal_distribution(const param_type& __p)
+        : __p_(__p), __v_hot_(false) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {__v_hot_ = false;}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type mean() const {return __p_.mean();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type stddev() const {return __p_.stddev();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return -numeric_limits<result_type>::infinity();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::infinity();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const normal_distribution& __x,
+                        const normal_distribution& __y)
+        {return __x.__p_ == __y.__p_ && __x.__v_hot_ == __y.__v_hot_ &&
+                (!__x.__v_hot_ || __x.__v_ == __y.__v_);}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const normal_distribution& __x,
+                        const normal_distribution& __y)
+        {return !(__x == __y);}
+
+    template <class _CharT, class _Traits, class _RT>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+               const normal_distribution<_RT>& __x);
+
+    template <class _CharT, class _Traits, class _RT>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+               normal_distribution<_RT>& __x);
+};
+
+template <class _RealType>
+template<class _URNG>
+_RealType
+normal_distribution<_RealType>::operator()(_URNG& __g, const param_type& __p)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    result_type _Up;
+    if (__v_hot_)
+    {
+        __v_hot_ = false;
+        _Up = __v_;
+    }
+    else
+    {
+        uniform_real_distribution<result_type> _Uni(-1, 1);
+        result_type __u;
+        result_type __v;
+        result_type __s;
+        do
+        {
+            __u = _Uni(__g);
+            __v = _Uni(__g);
+            __s = __u * __u + __v * __v;
+        } while (__s > 1 || __s == 0);
+        result_type _Fp = _VSTD::sqrt(-2 * _VSTD::log(__s) / __s);
+        __v_ = __v * _Fp;
+        __v_hot_ = true;
+        _Up = __u * _Fp;
+    }
+    return _Up * __p.stddev() + __p.mean();
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const normal_distribution<_RT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    __os << __x.mean() << __sp << __x.stddev() << __sp << __x.__v_hot_;
+    if (__x.__v_hot_)
+        __os << __sp << __x.__v_;
+    return __os;
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           normal_distribution<_RT>& __x)
+{
+    typedef normal_distribution<_RT> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __mean;
+    result_type __stddev;
+    result_type _Vp = 0;
+    bool _V_hot = false;
+    __is >> __mean >> __stddev >> _V_hot;
+    if (_V_hot)
+        __is >> _Vp;
+    if (!__is.fail())
+    {
+        __x.param(param_type(__mean, __stddev));
+        __x.__v_hot_ = _V_hot;
+        __x.__v_ = _Vp;
+    }
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_NORMAL_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/piecewise_constant_distribution.h b/app/src/main/cpp/libcxx/include/__random/piecewise_constant_distribution.h
new file mode 100644
index 0000000..a1f3ef9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/piecewise_constant_distribution.h
@@ -0,0 +1,358 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_PIECEWISE_CONSTANT_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_PIECEWISE_CONSTANT_DISTRIBUTION_H
+
+#include <__algorithm/upper_bound.h>
+#include <__config>
+#include <__random/is_valid.h>
+#include <__random/uniform_real_distribution.h>
+#include <iosfwd>
+#include <numeric>
+#include <vector>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS piecewise_constant_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        vector<result_type> __b_;
+        vector<result_type> __densities_;
+        vector<result_type> __areas_;
+    public:
+        typedef piecewise_constant_distribution distribution_type;
+
+        param_type();
+        template<class _InputIteratorB, class _InputIteratorW>
+            param_type(_InputIteratorB __f_b, _InputIteratorB __l_b,
+                       _InputIteratorW __f_w);
+#ifndef _LIBCPP_CXX03_LANG
+        template<class _UnaryOperation>
+            param_type(initializer_list<result_type> __bl, _UnaryOperation __fw);
+#endif // _LIBCPP_CXX03_LANG
+        template<class _UnaryOperation>
+            param_type(size_t __nw, result_type __xmin, result_type __xmax,
+                       _UnaryOperation __fw);
+        param_type(param_type const&) = default;
+        param_type & operator=(const param_type& __rhs);
+
+        _LIBCPP_INLINE_VISIBILITY
+        vector<result_type> intervals() const {return __b_;}
+        _LIBCPP_INLINE_VISIBILITY
+        vector<result_type> densities() const {return __densities_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__densities_ == __y.__densities_ && __x.__b_ == __y.__b_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+
+    private:
+        void __init();
+
+        friend class piecewise_constant_distribution;
+
+        template <class _CharT, class _Traits, class _RT>
+        friend
+        basic_ostream<_CharT, _Traits>&
+        operator<<(basic_ostream<_CharT, _Traits>& __os,
+                   const piecewise_constant_distribution<_RT>& __x);
+
+        template <class _CharT, class _Traits, class _RT>
+        friend
+        basic_istream<_CharT, _Traits>&
+        operator>>(basic_istream<_CharT, _Traits>& __is,
+                   piecewise_constant_distribution<_RT>& __x);
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructor and reset functions
+    _LIBCPP_INLINE_VISIBILITY
+    piecewise_constant_distribution() {}
+    template<class _InputIteratorB, class _InputIteratorW>
+        _LIBCPP_INLINE_VISIBILITY
+        piecewise_constant_distribution(_InputIteratorB __f_b,
+                                        _InputIteratorB __l_b,
+                                        _InputIteratorW __f_w)
+        : __p_(__f_b, __l_b, __f_w) {}
+
+#ifndef _LIBCPP_CXX03_LANG
+    template<class _UnaryOperation>
+        _LIBCPP_INLINE_VISIBILITY
+        piecewise_constant_distribution(initializer_list<result_type> __bl,
+                                        _UnaryOperation __fw)
+        : __p_(__bl, __fw) {}
+#endif // _LIBCPP_CXX03_LANG
+
+    template<class _UnaryOperation>
+        _LIBCPP_INLINE_VISIBILITY
+        piecewise_constant_distribution(size_t __nw, result_type __xmin,
+                                        result_type __xmax, _UnaryOperation __fw)
+        : __p_(__nw, __xmin, __xmax, __fw) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit piecewise_constant_distribution(const param_type& __p)
+        : __p_(__p) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    vector<result_type> intervals() const {return __p_.intervals();}
+    _LIBCPP_INLINE_VISIBILITY
+    vector<result_type> densities() const {return __p_.densities();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return __p_.__b_.front();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return __p_.__b_.back();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const piecewise_constant_distribution& __x,
+                        const piecewise_constant_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const piecewise_constant_distribution& __x,
+                           const piecewise_constant_distribution& __y)
+        {return !(__x == __y);}
+
+    template <class _CharT, class _Traits, class _RT>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+               const piecewise_constant_distribution<_RT>& __x);
+
+    template <class _CharT, class _Traits, class _RT>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+               piecewise_constant_distribution<_RT>& __x);
+};
+
+template<class _RealType>
+typename piecewise_constant_distribution<_RealType>::param_type &
+piecewise_constant_distribution<_RealType>::param_type::operator=
+                                                       (const param_type& __rhs)
+{
+//  These can throw
+    __b_.reserve        (__rhs.__b_.size ());
+    __densities_.reserve(__rhs.__densities_.size());
+    __areas_.reserve    (__rhs.__areas_.size());
+
+//  These can not throw
+    __b_         = __rhs.__b_;
+    __densities_ = __rhs.__densities_;
+    __areas_     =  __rhs.__areas_;
+    return *this;
+}
+
+template<class _RealType>
+void
+piecewise_constant_distribution<_RealType>::param_type::__init()
+{
+    // __densities_ contains non-normalized areas
+    result_type __total_area = _VSTD::accumulate(__densities_.begin(),
+                                                __densities_.end(),
+                                                result_type());
+    for (size_t __i = 0; __i < __densities_.size(); ++__i)
+        __densities_[__i] /= __total_area;
+    // __densities_ contains normalized areas
+    __areas_.assign(__densities_.size(), result_type());
+    _VSTD::partial_sum(__densities_.begin(), __densities_.end() - 1,
+                                                          __areas_.begin() + 1);
+    // __areas_ contains partial sums of normalized areas: [0, __densities_ - 1]
+    __densities_.back() = 1 - __areas_.back();  // correct round off error
+    for (size_t __i = 0; __i < __densities_.size(); ++__i)
+        __densities_[__i] /= (__b_[__i+1] - __b_[__i]);
+    // __densities_ now contains __densities_
+}
+
+template<class _RealType>
+piecewise_constant_distribution<_RealType>::param_type::param_type()
+    : __b_(2),
+      __densities_(1, 1.0),
+      __areas_(1, 0.0)
+{
+    __b_[1] = 1;
+}
+
+template<class _RealType>
+template<class _InputIteratorB, class _InputIteratorW>
+piecewise_constant_distribution<_RealType>::param_type::param_type(
+        _InputIteratorB __f_b, _InputIteratorB __l_b, _InputIteratorW __f_w)
+    : __b_(__f_b, __l_b)
+{
+    if (__b_.size() < 2)
+    {
+        __b_.resize(2);
+        __b_[0] = 0;
+        __b_[1] = 1;
+        __densities_.assign(1, 1.0);
+        __areas_.assign(1, 0.0);
+    }
+    else
+    {
+        __densities_.reserve(__b_.size() - 1);
+        for (size_t __i = 0; __i < __b_.size() - 1; ++__i, ++__f_w)
+            __densities_.push_back(*__f_w);
+        __init();
+    }
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template<class _RealType>
+template<class _UnaryOperation>
+piecewise_constant_distribution<_RealType>::param_type::param_type(
+        initializer_list<result_type> __bl, _UnaryOperation __fw)
+    : __b_(__bl.begin(), __bl.end())
+{
+    if (__b_.size() < 2)
+    {
+        __b_.resize(2);
+        __b_[0] = 0;
+        __b_[1] = 1;
+        __densities_.assign(1, 1.0);
+        __areas_.assign(1, 0.0);
+    }
+    else
+    {
+        __densities_.reserve(__b_.size() - 1);
+        for (size_t __i = 0; __i < __b_.size() - 1; ++__i)
+            __densities_.push_back(__fw((__b_[__i+1] + __b_[__i])*.5));
+        __init();
+    }
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template<class _RealType>
+template<class _UnaryOperation>
+piecewise_constant_distribution<_RealType>::param_type::param_type(
+        size_t __nw, result_type __xmin, result_type __xmax, _UnaryOperation __fw)
+    : __b_(__nw == 0 ? 2 : __nw + 1)
+{
+    size_t __n = __b_.size() - 1;
+    result_type __d = (__xmax - __xmin) / __n;
+    __densities_.reserve(__n);
+    for (size_t __i = 0; __i < __n; ++__i)
+    {
+        __b_[__i] = __xmin + __i * __d;
+        __densities_.push_back(__fw(__b_[__i] + __d*.5));
+    }
+    __b_[__n] = __xmax;
+    __init();
+}
+
+template<class _RealType>
+template<class _URNG>
+_RealType
+piecewise_constant_distribution<_RealType>::operator()(_URNG& __g, const param_type& __p)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    typedef uniform_real_distribution<result_type> _Gen;
+    result_type __u = _Gen()(__g);
+    ptrdiff_t __k = _VSTD::upper_bound(__p.__areas_.begin(), __p.__areas_.end(),
+                                      __u) - __p.__areas_.begin() - 1;
+    return (__u - __p.__areas_[__k]) / __p.__densities_[__k] + __p.__b_[__k];
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const piecewise_constant_distribution<_RT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    size_t __n = __x.__p_.__b_.size();
+    __os << __n;
+    for (size_t __i = 0; __i < __n; ++__i)
+        __os << __sp << __x.__p_.__b_[__i];
+    __n = __x.__p_.__densities_.size();
+    __os << __sp << __n;
+    for (size_t __i = 0; __i < __n; ++__i)
+        __os << __sp << __x.__p_.__densities_[__i];
+    __n = __x.__p_.__areas_.size();
+    __os << __sp << __n;
+    for (size_t __i = 0; __i < __n; ++__i)
+        __os << __sp << __x.__p_.__areas_[__i];
+    return __os;
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           piecewise_constant_distribution<_RT>& __x)
+{
+    typedef piecewise_constant_distribution<_RT> _Eng;
+    typedef typename _Eng::result_type result_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    size_t __n;
+    __is >> __n;
+    vector<result_type> __b(__n);
+    for (size_t __i = 0; __i < __n; ++__i)
+        __is >> __b[__i];
+    __is >> __n;
+    vector<result_type> __densities(__n);
+    for (size_t __i = 0; __i < __n; ++__i)
+        __is >> __densities[__i];
+    __is >> __n;
+    vector<result_type> __areas(__n);
+    for (size_t __i = 0; __i < __n; ++__i)
+        __is >> __areas[__i];
+    if (!__is.fail())
+    {
+        swap(__x.__p_.__b_, __b);
+        swap(__x.__p_.__densities_, __densities);
+        swap(__x.__p_.__areas_, __areas);
+    }
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_PIECEWISE_CONSTANT_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/piecewise_linear_distribution.h b/app/src/main/cpp/libcxx/include/__random/piecewise_linear_distribution.h
new file mode 100644
index 0000000..fc2eb47
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/piecewise_linear_distribution.h
@@ -0,0 +1,374 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_PIECEWISE_LINEAR_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_PIECEWISE_LINEAR_DISTRIBUTION_H
+
+#include <__algorithm/upper_bound.h>
+#include <__config>
+#include <__random/is_valid.h>
+#include <__random/uniform_real_distribution.h>
+#include <iosfwd>
+#include <numeric>
+#include <vector>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS piecewise_linear_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        vector<result_type> __b_;
+        vector<result_type> __densities_;
+        vector<result_type> __areas_;
+    public:
+        typedef piecewise_linear_distribution distribution_type;
+
+        param_type();
+        template<class _InputIteratorB, class _InputIteratorW>
+            param_type(_InputIteratorB __f_b, _InputIteratorB __l_b,
+                       _InputIteratorW __f_w);
+#ifndef _LIBCPP_CXX03_LANG
+        template<class _UnaryOperation>
+            param_type(initializer_list<result_type> __bl, _UnaryOperation __fw);
+#endif // _LIBCPP_CXX03_LANG
+        template<class _UnaryOperation>
+            param_type(size_t __nw, result_type __xmin, result_type __xmax,
+                       _UnaryOperation __fw);
+        param_type(param_type const&) = default;
+        param_type & operator=(const param_type& __rhs);
+
+        _LIBCPP_INLINE_VISIBILITY
+        vector<result_type> intervals() const {return __b_;}
+        _LIBCPP_INLINE_VISIBILITY
+        vector<result_type> densities() const {return __densities_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__densities_ == __y.__densities_ && __x.__b_ == __y.__b_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+
+    private:
+        void __init();
+
+        friend class piecewise_linear_distribution;
+
+        template <class _CharT, class _Traits, class _RT>
+        friend
+        basic_ostream<_CharT, _Traits>&
+        operator<<(basic_ostream<_CharT, _Traits>& __os,
+                   const piecewise_linear_distribution<_RT>& __x);
+
+        template <class _CharT, class _Traits, class _RT>
+        friend
+        basic_istream<_CharT, _Traits>&
+        operator>>(basic_istream<_CharT, _Traits>& __is,
+                   piecewise_linear_distribution<_RT>& __x);
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructor and reset functions
+    _LIBCPP_INLINE_VISIBILITY
+    piecewise_linear_distribution() {}
+    template<class _InputIteratorB, class _InputIteratorW>
+        _LIBCPP_INLINE_VISIBILITY
+        piecewise_linear_distribution(_InputIteratorB __f_b,
+                                      _InputIteratorB __l_b,
+                                      _InputIteratorW __f_w)
+        : __p_(__f_b, __l_b, __f_w) {}
+
+#ifndef _LIBCPP_CXX03_LANG
+    template<class _UnaryOperation>
+        _LIBCPP_INLINE_VISIBILITY
+        piecewise_linear_distribution(initializer_list<result_type> __bl,
+                                      _UnaryOperation __fw)
+        : __p_(__bl, __fw) {}
+#endif // _LIBCPP_CXX03_LANG
+
+    template<class _UnaryOperation>
+        _LIBCPP_INLINE_VISIBILITY
+        piecewise_linear_distribution(size_t __nw, result_type __xmin,
+                                      result_type __xmax, _UnaryOperation __fw)
+        : __p_(__nw, __xmin, __xmax, __fw) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit piecewise_linear_distribution(const param_type& __p)
+        : __p_(__p) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    vector<result_type> intervals() const {return __p_.intervals();}
+    _LIBCPP_INLINE_VISIBILITY
+    vector<result_type> densities() const {return __p_.densities();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return __p_.__b_.front();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return __p_.__b_.back();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const piecewise_linear_distribution& __x,
+                        const piecewise_linear_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const piecewise_linear_distribution& __x,
+                        const piecewise_linear_distribution& __y)
+        {return !(__x == __y);}
+
+    template <class _CharT, class _Traits, class _RT>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+               const piecewise_linear_distribution<_RT>& __x);
+
+    template <class _CharT, class _Traits, class _RT>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+               piecewise_linear_distribution<_RT>& __x);
+};
+
+template<class _RealType>
+typename piecewise_linear_distribution<_RealType>::param_type &
+piecewise_linear_distribution<_RealType>::param_type::operator=
+                                                       (const param_type& __rhs)
+{
+//  These can throw
+    __b_.reserve        (__rhs.__b_.size ());
+    __densities_.reserve(__rhs.__densities_.size());
+    __areas_.reserve    (__rhs.__areas_.size());
+
+//  These can not throw
+    __b_         = __rhs.__b_;
+    __densities_ = __rhs.__densities_;
+    __areas_     =  __rhs.__areas_;
+    return *this;
+}
+
+
+template<class _RealType>
+void
+piecewise_linear_distribution<_RealType>::param_type::__init()
+{
+    __areas_.assign(__densities_.size() - 1, result_type());
+    result_type _Sp = 0;
+    for (size_t __i = 0; __i < __areas_.size(); ++__i)
+    {
+        __areas_[__i] = (__densities_[__i+1] + __densities_[__i]) *
+                        (__b_[__i+1] - __b_[__i]) * .5;
+        _Sp += __areas_[__i];
+    }
+    for (size_t __i = __areas_.size(); __i > 1;)
+    {
+        --__i;
+        __areas_[__i] = __areas_[__i-1] / _Sp;
+    }
+    __areas_[0] = 0;
+    for (size_t __i = 1; __i < __areas_.size(); ++__i)
+        __areas_[__i] += __areas_[__i-1];
+    for (size_t __i = 0; __i < __densities_.size(); ++__i)
+        __densities_[__i] /= _Sp;
+}
+
+template<class _RealType>
+piecewise_linear_distribution<_RealType>::param_type::param_type()
+    : __b_(2),
+      __densities_(2, 1.0),
+      __areas_(1, 0.0)
+{
+    __b_[1] = 1;
+}
+
+template<class _RealType>
+template<class _InputIteratorB, class _InputIteratorW>
+piecewise_linear_distribution<_RealType>::param_type::param_type(
+        _InputIteratorB __f_b, _InputIteratorB __l_b, _InputIteratorW __f_w)
+    : __b_(__f_b, __l_b)
+{
+    if (__b_.size() < 2)
+    {
+        __b_.resize(2);
+        __b_[0] = 0;
+        __b_[1] = 1;
+        __densities_.assign(2, 1.0);
+        __areas_.assign(1, 0.0);
+    }
+    else
+    {
+        __densities_.reserve(__b_.size());
+        for (size_t __i = 0; __i < __b_.size(); ++__i, ++__f_w)
+            __densities_.push_back(*__f_w);
+        __init();
+    }
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template<class _RealType>
+template<class _UnaryOperation>
+piecewise_linear_distribution<_RealType>::param_type::param_type(
+        initializer_list<result_type> __bl, _UnaryOperation __fw)
+    : __b_(__bl.begin(), __bl.end())
+{
+    if (__b_.size() < 2)
+    {
+        __b_.resize(2);
+        __b_[0] = 0;
+        __b_[1] = 1;
+        __densities_.assign(2, 1.0);
+        __areas_.assign(1, 0.0);
+    }
+    else
+    {
+        __densities_.reserve(__b_.size());
+        for (size_t __i = 0; __i < __b_.size(); ++__i)
+            __densities_.push_back(__fw(__b_[__i]));
+        __init();
+    }
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template<class _RealType>
+template<class _UnaryOperation>
+piecewise_linear_distribution<_RealType>::param_type::param_type(
+        size_t __nw, result_type __xmin, result_type __xmax, _UnaryOperation __fw)
+    : __b_(__nw == 0 ? 2 : __nw + 1)
+{
+    size_t __n = __b_.size() - 1;
+    result_type __d = (__xmax - __xmin) / __n;
+    __densities_.reserve(__b_.size());
+    for (size_t __i = 0; __i < __n; ++__i)
+    {
+        __b_[__i] = __xmin + __i * __d;
+        __densities_.push_back(__fw(__b_[__i]));
+    }
+    __b_[__n] = __xmax;
+    __densities_.push_back(__fw(__b_[__n]));
+    __init();
+}
+
+template<class _RealType>
+template<class _URNG>
+_RealType
+piecewise_linear_distribution<_RealType>::operator()(_URNG& __g, const param_type& __p)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    typedef uniform_real_distribution<result_type> _Gen;
+    result_type __u = _Gen()(__g);
+    ptrdiff_t __k = _VSTD::upper_bound(__p.__areas_.begin(), __p.__areas_.end(),
+                                      __u) - __p.__areas_.begin() - 1;
+    __u -= __p.__areas_[__k];
+    const result_type __dk = __p.__densities_[__k];
+    const result_type __dk1 = __p.__densities_[__k+1];
+    const result_type __deltad = __dk1 - __dk;
+    const result_type __bk = __p.__b_[__k];
+    if (__deltad == 0)
+        return __u / __dk + __bk;
+    const result_type __bk1 = __p.__b_[__k+1];
+    const result_type __deltab = __bk1 - __bk;
+    return (__bk * __dk1 - __bk1 * __dk +
+        _VSTD::sqrt(__deltab * (__deltab * __dk * __dk + 2 * __deltad * __u))) /
+        __deltad;
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const piecewise_linear_distribution<_RT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    size_t __n = __x.__p_.__b_.size();
+    __os << __n;
+    for (size_t __i = 0; __i < __n; ++__i)
+        __os << __sp << __x.__p_.__b_[__i];
+    __n = __x.__p_.__densities_.size();
+    __os << __sp << __n;
+    for (size_t __i = 0; __i < __n; ++__i)
+        __os << __sp << __x.__p_.__densities_[__i];
+    __n = __x.__p_.__areas_.size();
+    __os << __sp << __n;
+    for (size_t __i = 0; __i < __n; ++__i)
+        __os << __sp << __x.__p_.__areas_[__i];
+    return __os;
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           piecewise_linear_distribution<_RT>& __x)
+{
+    typedef piecewise_linear_distribution<_RT> _Eng;
+    typedef typename _Eng::result_type result_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    size_t __n;
+    __is >> __n;
+    vector<result_type> __b(__n);
+    for (size_t __i = 0; __i < __n; ++__i)
+        __is >> __b[__i];
+    __is >> __n;
+    vector<result_type> __densities(__n);
+    for (size_t __i = 0; __i < __n; ++__i)
+        __is >> __densities[__i];
+    __is >> __n;
+    vector<result_type> __areas(__n);
+    for (size_t __i = 0; __i < __n; ++__i)
+        __is >> __areas[__i];
+    if (!__is.fail())
+    {
+        swap(__x.__p_.__b_, __b);
+        swap(__x.__p_.__densities_, __densities);
+        swap(__x.__p_.__areas_, __areas);
+    }
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_PIECEWISE_LINEAR_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/poisson_distribution.h b/app/src/main/cpp/libcxx/include/__random/poisson_distribution.h
new file mode 100644
index 0000000..334c610
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/poisson_distribution.h
@@ -0,0 +1,280 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_POISSON_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_POISSON_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/clamp_to_integral.h>
+#include <__random/exponential_distribution.h>
+#include <__random/is_valid.h>
+#include <__random/normal_distribution.h>
+#include <__random/uniform_real_distribution.h>
+#include <cmath>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _IntType = int>
+class _LIBCPP_TEMPLATE_VIS poisson_distribution
+{
+    static_assert(__libcpp_random_is_valid_inttype<_IntType>::value, "IntType must be a supported integer type");
+public:
+    // types
+    typedef _IntType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        double __mean_;
+        double __s_;
+        double __d_;
+        double __l_;
+        double __omega_;
+        double __c0_;
+        double __c1_;
+        double __c2_;
+        double __c3_;
+        double __c_;
+
+    public:
+        typedef poisson_distribution distribution_type;
+
+        explicit param_type(double __mean = 1.0);
+
+        _LIBCPP_INLINE_VISIBILITY
+        double mean() const {return __mean_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__mean_ == __y.__mean_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+
+        friend class poisson_distribution;
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructors and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    poisson_distribution() : poisson_distribution(1.0) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit poisson_distribution(double __mean)
+        : __p_(__mean) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit poisson_distribution(double __mean = 1.0)
+        : __p_(__mean) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit poisson_distribution(const param_type& __p) : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    double mean() const {return __p_.mean();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::max();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const poisson_distribution& __x,
+                        const poisson_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const poisson_distribution& __x,
+                        const poisson_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template<class _IntType>
+poisson_distribution<_IntType>::param_type::param_type(double __mean)
+    // According to the standard `inf` is a valid input, but it causes the
+    // distribution to hang, so we replace it with the maximum representable
+    // mean.
+    : __mean_(isinf(__mean) ? numeric_limits<double>::max() : __mean)
+{
+    if (__mean_ < 10)
+    {
+        __s_ = 0;
+        __d_ = 0;
+        __l_ = _VSTD::exp(-__mean_);
+        __omega_ = 0;
+        __c3_ = 0;
+        __c2_ = 0;
+        __c1_ = 0;
+        __c0_ = 0;
+        __c_ = 0;
+    }
+    else
+    {
+        __s_ = _VSTD::sqrt(__mean_);
+        __d_ = 6 * __mean_ * __mean_;
+        __l_ = _VSTD::trunc(__mean_ - 1.1484);
+        __omega_ = .3989423 / __s_;
+        double __b1_ = .4166667E-1 / __mean_;
+        double __b2_ = .3 * __b1_ * __b1_;
+        __c3_ = .1428571 * __b1_ * __b2_;
+        __c2_ = __b2_ - 15. * __c3_;
+        __c1_ = __b1_ - 6. * __b2_ + 45. * __c3_;
+        __c0_ = 1. - __b1_ + 3. * __b2_ - 15. * __c3_;
+        __c_ = .1069 / __mean_;
+    }
+}
+
+template <class _IntType>
+template<class _URNG>
+_IntType
+poisson_distribution<_IntType>::operator()(_URNG& __urng, const param_type& __pr)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    double __tx;
+    uniform_real_distribution<double> __urd;
+    if (__pr.__mean_ < 10)
+    {
+         __tx = 0;
+        for (double __p = __urd(__urng); __p > __pr.__l_; ++__tx)
+            __p *= __urd(__urng);
+    }
+    else
+    {
+        double __difmuk;
+        double __g = __pr.__mean_ + __pr.__s_ * normal_distribution<double>()(__urng);
+        double __u;
+        if (__g > 0)
+        {
+            __tx = _VSTD::trunc(__g);
+            if (__tx >= __pr.__l_)
+                return _VSTD::__clamp_to_integral<result_type>(__tx);
+            __difmuk = __pr.__mean_ - __tx;
+            __u = __urd(__urng);
+            if (__pr.__d_ * __u >= __difmuk * __difmuk * __difmuk)
+                return _VSTD::__clamp_to_integral<result_type>(__tx);
+        }
+        exponential_distribution<double> __edist;
+        for (bool __using_exp_dist = false; true; __using_exp_dist = true)
+        {
+            double __e;
+            if (__using_exp_dist || __g <= 0)
+            {
+                double __t;
+                do
+                {
+                    __e = __edist(__urng);
+                    __u = __urd(__urng);
+                    __u += __u - 1;
+                    __t = 1.8 + (__u < 0 ? -__e : __e);
+                } while (__t <= -.6744);
+                __tx = _VSTD::trunc(__pr.__mean_ + __pr.__s_ * __t);
+                __difmuk = __pr.__mean_ - __tx;
+                __using_exp_dist = true;
+            }
+            double __px;
+            double __py;
+            if (__tx < 10 && __tx >= 0)
+            {
+                const double __fac[] = {1, 1, 2, 6, 24, 120, 720, 5040,
+                                             40320, 362880};
+                __px = -__pr.__mean_;
+                __py = _VSTD::pow(__pr.__mean_, (double)__tx) / __fac[static_cast<int>(__tx)];
+            }
+            else
+            {
+                double __del = .8333333E-1 / __tx;
+                __del -= 4.8 * __del * __del * __del;
+                double __v = __difmuk / __tx;
+                if (_VSTD::abs(__v) > 0.25)
+                    __px = __tx * _VSTD::log(1 + __v) - __difmuk - __del;
+                else
+                    __px = __tx * __v * __v * (((((((.1250060 * __v + -.1384794) *
+                           __v + .1421878) * __v + -.1661269) * __v + .2000118) *
+                           __v + -.2500068) * __v + .3333333) * __v + -.5) - __del;
+                __py = .3989423 / _VSTD::sqrt(__tx);
+            }
+            double __r = (0.5 - __difmuk) / __pr.__s_;
+            double __r2 = __r * __r;
+            double __fx = -0.5 * __r2;
+            double __fy = __pr.__omega_ * (((__pr.__c3_ * __r2 + __pr.__c2_) *
+                                        __r2 + __pr.__c1_) * __r2 + __pr.__c0_);
+            if (__using_exp_dist)
+            {
+                if (__pr.__c_ * _VSTD::abs(__u) <= __py * _VSTD::exp(__px + __e) -
+                                                   __fy * _VSTD::exp(__fx + __e))
+                    break;
+            }
+            else
+            {
+                if (__fy - __u * __fy <= __py * _VSTD::exp(__px - __fx))
+                    break;
+            }
+        }
+    }
+    return _VSTD::__clamp_to_integral<result_type>(__tx);
+}
+
+template <class _CharT, class _Traits, class _IntType>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const poisson_distribution<_IntType>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    return __os << __x.mean();
+}
+
+template <class _CharT, class _Traits, class _IntType>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           poisson_distribution<_IntType>& __x)
+{
+    typedef poisson_distribution<_IntType> _Eng;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    double __mean;
+    __is >> __mean;
+    if (!__is.fail())
+        __x.param(param_type(__mean));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_POISSON_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/random_device.h b/app/src/main/cpp/libcxx/include/__random/random_device.h
new file mode 100644
index 0000000..e82b437
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/random_device.h
@@ -0,0 +1,84 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_RANDOM_DEVICE_H
+#define _LIBCPP___RANDOM_RANDOM_DEVICE_H
+
+#include <__config>
+#include <string>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if !defined(_LIBCPP_HAS_NO_RANDOM_DEVICE)
+
+class _LIBCPP_TYPE_VIS random_device
+{
+#ifdef _LIBCPP_USING_DEV_RANDOM
+    int __f_;
+#elif !defined(_LIBCPP_ABI_NO_RANDOM_DEVICE_COMPATIBILITY_LAYOUT)
+    _LIBCPP_DIAGNOSTIC_PUSH
+    _LIBCPP_CLANG_DIAGNOSTIC_IGNORED("-Wunused-private-field")
+
+    // Apple platforms used to use the `_LIBCPP_USING_DEV_RANDOM` code path, and now
+    // use `arc4random()` as of this comment. In order to avoid breaking the ABI, we
+    // retain the same layout as before.
+#   if defined(__APPLE__)
+    int __padding_; // padding to fake the `__f_` field above
+#   endif
+
+    // ... vendors can add workarounds here if they switch to a different representation ...
+
+    _LIBCPP_DIAGNOSTIC_POP
+#endif
+
+public:
+    // types
+    typedef unsigned result_type;
+
+    // generator characteristics
+    static _LIBCPP_CONSTEXPR const result_type _Min = 0;
+    static _LIBCPP_CONSTEXPR const result_type _Max = 0xFFFFFFFFu;
+
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type min() { return _Min;}
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type max() { return _Max;}
+
+    // constructors
+#ifndef _LIBCPP_CXX03_LANG
+    random_device() : random_device("/dev/urandom") {}
+    explicit random_device(const string& __token);
+#else
+    explicit random_device(const string& __token = "/dev/urandom");
+#endif
+    ~random_device();
+
+    // generating functions
+    result_type operator()();
+
+    // property functions
+    double entropy() const _NOEXCEPT;
+
+    random_device(const random_device&) = delete;
+    void operator=(const random_device&) = delete;
+};
+
+#endif // !_LIBCPP_HAS_NO_RANDOM_DEVICE
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_RANDOM_DEVICE_H
diff --git a/app/src/main/cpp/libcxx/include/__random/ranlux.h b/app/src/main/cpp/libcxx/include/__random/ranlux.h
new file mode 100644
index 0000000..e44cece
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/ranlux.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_RANLUX_H
+#define _LIBCPP___RANDOM_RANLUX_H
+
+#include <__config>
+#include <__random/discard_block_engine.h>
+#include <__random/subtract_with_carry_engine.h>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+typedef subtract_with_carry_engine<uint_fast32_t, 24, 10, 24> ranlux24_base;
+typedef subtract_with_carry_engine<uint_fast64_t, 48,  5, 12> ranlux48_base;
+
+typedef discard_block_engine<ranlux24_base, 223, 23> ranlux24;
+typedef discard_block_engine<ranlux48_base, 389, 11> ranlux48;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANDOM_RANLUX_H
diff --git a/app/src/main/cpp/libcxx/include/__random/seed_seq.h b/app/src/main/cpp/libcxx/include/__random/seed_seq.h
new file mode 100644
index 0000000..330537f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/seed_seq.h
@@ -0,0 +1,177 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_SEED_SEQ_H
+#define _LIBCPP___RANDOM_SEED_SEQ_H
+
+#include <__algorithm/copy.h>
+#include <__algorithm/fill.h>
+#include <__algorithm/max.h>
+#include <__config>
+#include <initializer_list>
+#include <vector>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+class _LIBCPP_TEMPLATE_VIS seed_seq
+{
+public:
+    // types
+    typedef uint32_t result_type;
+
+    // constructors
+    _LIBCPP_INLINE_VISIBILITY
+    seed_seq() _NOEXCEPT {}
+#ifndef _LIBCPP_CXX03_LANG
+    template<class _Tp, __enable_if_t<is_integral<_Tp>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    seed_seq(initializer_list<_Tp> __il) {
+        __init(__il.begin(), __il.end());
+    }
+#endif // _LIBCPP_CXX03_LANG
+
+    template<class _InputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+    seed_seq(_InputIterator __first, _InputIterator __last) {
+        static_assert(is_integral<typename iterator_traits<_InputIterator>::value_type>::value,
+            "Mandates: iterator_traits<InputIterator>::value_type is an integer type");
+        __init(__first, __last);
+    }
+
+    // generating functions
+    template<class _RandomAccessIterator>
+        void generate(_RandomAccessIterator __first, _RandomAccessIterator __last);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const _NOEXCEPT {return __v_.size();}
+    template<class _OutputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        void param(_OutputIterator __dest) const
+            {_VSTD::copy(__v_.begin(), __v_.end(), __dest);}
+
+    seed_seq(const seed_seq&) = delete;
+    void operator=(const seed_seq&) = delete;
+
+    _LIBCPP_INLINE_VISIBILITY
+    static result_type _Tp(result_type __x) {return __x ^ (__x >> 27);}
+
+private:
+    template<class _InputIterator>
+    void __init(_InputIterator __first, _InputIterator __last);
+
+    vector<result_type> __v_;
+};
+
+template<class _InputIterator>
+void
+seed_seq::__init(_InputIterator __first, _InputIterator __last)
+{
+    for (_InputIterator __s = __first; __s != __last; ++__s)
+        __v_.push_back(*__s & 0xFFFFFFFF);
+}
+
+template<class _RandomAccessIterator>
+void
+seed_seq::generate(_RandomAccessIterator __first, _RandomAccessIterator __last)
+{
+    if (__first != __last)
+    {
+        _VSTD::fill(__first, __last, 0x8b8b8b8b);
+        const size_t __n = static_cast<size_t>(__last - __first);
+        const size_t __s = __v_.size();
+        const size_t __t = (__n >= 623) ? 11
+                         : (__n >= 68) ? 7
+                         : (__n >= 39) ? 5
+                         : (__n >= 7)  ? 3
+                         : (__n - 1) / 2;
+        const size_t __p = (__n - __t) / 2;
+        const size_t __q = __p + __t;
+        const size_t __m = _VSTD::max(__s + 1, __n);
+        // __k = 0;
+        {
+            result_type __r = 1664525 * _Tp(__first[0] ^ __first[__p]
+                                                      ^  __first[__n - 1]);
+            __first[__p] += __r;
+            __r += __s;
+            __first[__q] += __r;
+            __first[0] = __r;
+        }
+        // Initialize indexing terms used with if statements as an optimization to
+        // avoid calculating modulo n on every loop iteration for each term.
+        size_t __kmodn = 0;          // __k % __n
+        size_t __k1modn = __n - 1;   // (__k - 1) % __n
+        size_t __kpmodn = __p % __n; // (__k + __p) % __n
+        size_t __kqmodn = __q % __n; // (__k + __q) % __n
+
+        for (size_t __k = 1; __k <= __s; ++__k)
+        {
+          if (++__kmodn == __n)
+            __kmodn = 0;
+          if (++__k1modn == __n)
+            __k1modn = 0;
+          if (++__kpmodn == __n)
+            __kpmodn = 0;
+          if (++__kqmodn == __n)
+            __kqmodn = 0;
+
+          result_type __r = 1664525 * _Tp(__first[__kmodn] ^ __first[__kpmodn] ^ __first[__k1modn]);
+          __first[__kpmodn] += __r;
+          __r += __kmodn + __v_[__k - 1];
+          __first[__kqmodn] += __r;
+          __first[__kmodn] = __r;
+        }
+        for (size_t __k = __s + 1; __k < __m; ++__k)
+        {
+          if (++__kmodn == __n)
+            __kmodn = 0;
+          if (++__k1modn == __n)
+            __k1modn = 0;
+          if (++__kpmodn == __n)
+            __kpmodn = 0;
+          if (++__kqmodn == __n)
+            __kqmodn = 0;
+
+          result_type __r = 1664525 * _Tp(__first[__kmodn] ^ __first[__kpmodn] ^ __first[__k1modn]);
+          __first[__kpmodn] += __r;
+          __r += __kmodn;
+          __first[__kqmodn] += __r;
+          __first[__kmodn] = __r;
+        }
+        for (size_t __k = __m; __k < __m + __n; ++__k)
+        {
+          if (++__kmodn == __n)
+            __kmodn = 0;
+          if (++__k1modn == __n)
+            __k1modn = 0;
+          if (++__kpmodn == __n)
+            __kpmodn = 0;
+          if (++__kqmodn == __n)
+            __kqmodn = 0;
+
+          result_type __r = 1566083941 * _Tp(__first[__kmodn] + __first[__kpmodn] + __first[__k1modn]);
+          __first[__kpmodn] ^= __r;
+          __r -= __kmodn;
+          __first[__kqmodn] ^= __r;
+          __first[__kmodn] = __r;
+        }
+    }
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_SEED_SEQ_H
diff --git a/app/src/main/cpp/libcxx/include/__random/shuffle_order_engine.h b/app/src/main/cpp/libcxx/include/__random/shuffle_order_engine.h
new file mode 100644
index 0000000..4a27289
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/shuffle_order_engine.h
@@ -0,0 +1,283 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_SHUFFLE_ORDER_ENGINE_H
+#define _LIBCPP___RANDOM_SHUFFLE_ORDER_ENGINE_H
+
+#include <__algorithm/equal.h>
+#include <__config>
+#include <__random/is_seed_sequence.h>
+#include <__utility/move.h>
+#include <cstdint>
+#include <iosfwd>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <uint64_t _Xp, uint64_t _Yp>
+struct __ugcd
+{
+    static _LIBCPP_CONSTEXPR const uint64_t value = __ugcd<_Yp, _Xp % _Yp>::value;
+};
+
+template <uint64_t _Xp>
+struct __ugcd<_Xp, 0>
+{
+    static _LIBCPP_CONSTEXPR const uint64_t value = _Xp;
+};
+
+template <uint64_t _Np, uint64_t _Dp>
+class __uratio
+{
+    static_assert(_Dp != 0, "__uratio divide by 0");
+    static _LIBCPP_CONSTEXPR const uint64_t __gcd = __ugcd<_Np, _Dp>::value;
+public:
+    static _LIBCPP_CONSTEXPR const uint64_t num = _Np / __gcd;
+    static _LIBCPP_CONSTEXPR const uint64_t den = _Dp / __gcd;
+
+    typedef __uratio<num, den> type;
+};
+
+template<class _Engine, size_t __k>
+class _LIBCPP_TEMPLATE_VIS shuffle_order_engine
+{
+    static_assert(0 < __k, "shuffle_order_engine invalid parameters");
+public:
+    // types
+    typedef typename _Engine::result_type result_type;
+
+private:
+    _Engine __e_;
+    result_type __v_[__k];
+    result_type __y_;
+
+public:
+    // engine characteristics
+    static _LIBCPP_CONSTEXPR const size_t table_size = __k;
+
+#ifdef _LIBCPP_CXX03_LANG
+    static const result_type _Min = _Engine::_Min;
+    static const result_type _Max = _Engine::_Max;
+#else
+    static _LIBCPP_CONSTEXPR const result_type _Min = _Engine::min();
+    static _LIBCPP_CONSTEXPR const result_type _Max = _Engine::max();
+#endif
+    static_assert(_Min < _Max, "shuffle_order_engine invalid parameters");
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type min() { return _Min; }
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type max() { return _Max; }
+
+    static _LIBCPP_CONSTEXPR const unsigned long long _Rp = _Max - _Min + 1ull;
+
+    // constructors and seeding functions
+    _LIBCPP_INLINE_VISIBILITY
+    shuffle_order_engine() {__init();}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit shuffle_order_engine(const _Engine& __e)
+        : __e_(__e) {__init();}
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    explicit shuffle_order_engine(_Engine&& __e)
+        : __e_(_VSTD::move(__e)) {__init();}
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    explicit shuffle_order_engine(result_type __sd) : __e_(__sd) {__init();}
+    template<class _Sseq>
+        _LIBCPP_INLINE_VISIBILITY
+        explicit shuffle_order_engine(_Sseq& __q,
+        typename enable_if<__is_seed_sequence<_Sseq, shuffle_order_engine>::value &&
+                           !is_convertible<_Sseq, _Engine>::value>::type* = 0)
+         : __e_(__q) {__init();}
+    _LIBCPP_INLINE_VISIBILITY
+    void seed() {__e_.seed(); __init();}
+    _LIBCPP_INLINE_VISIBILITY
+    void seed(result_type __sd) {__e_.seed(__sd); __init();}
+    template<class _Sseq>
+        _LIBCPP_INLINE_VISIBILITY
+        typename enable_if
+        <
+            __is_seed_sequence<_Sseq, shuffle_order_engine>::value,
+            void
+        >::type
+        seed(_Sseq& __q) {__e_.seed(__q); __init();}
+
+    // generating functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());}
+    _LIBCPP_INLINE_VISIBILITY
+    void discard(unsigned long long __z) {for (; __z; --__z) operator()();}
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    const _Engine& base() const _NOEXCEPT {return __e_;}
+
+private:
+    template<class _Eng, size_t _Kp>
+    friend
+    bool
+    operator==(
+        const shuffle_order_engine<_Eng, _Kp>& __x,
+        const shuffle_order_engine<_Eng, _Kp>& __y);
+
+    template<class _Eng, size_t _Kp>
+    friend
+    bool
+    operator!=(
+        const shuffle_order_engine<_Eng, _Kp>& __x,
+        const shuffle_order_engine<_Eng, _Kp>& __y);
+
+    template <class _CharT, class _Traits,
+              class _Eng, size_t _Kp>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+               const shuffle_order_engine<_Eng, _Kp>& __x);
+
+    template <class _CharT, class _Traits,
+              class _Eng, size_t _Kp>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+               shuffle_order_engine<_Eng, _Kp>& __x);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __init()
+    {
+        for (size_t __i = 0; __i < __k; ++__i)
+            __v_[__i] = __e_();
+        __y_ = __e_();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type __eval(false_type) {return __eval2(integral_constant<bool, __k & 1>());}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type __eval(true_type) {return __eval(__uratio<__k, _Rp>());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type __eval2(false_type) {return __eval(__uratio<__k/2, 0x8000000000000000ull>());}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type __eval2(true_type) {return __evalf<__k, 0>();}
+
+    template <uint64_t _Np, uint64_t _Dp>
+        _LIBCPP_INLINE_VISIBILITY
+        typename enable_if
+        <
+            (__uratio<_Np, _Dp>::num > 0xFFFFFFFFFFFFFFFFull / (_Max - _Min)),
+            result_type
+        >::type
+        __eval(__uratio<_Np, _Dp>)
+            {return __evalf<__uratio<_Np, _Dp>::num, __uratio<_Np, _Dp>::den>();}
+
+    template <uint64_t _Np, uint64_t _Dp>
+        _LIBCPP_INLINE_VISIBILITY
+        typename enable_if
+        <
+            __uratio<_Np, _Dp>::num <= 0xFFFFFFFFFFFFFFFFull / (_Max - _Min),
+            result_type
+        >::type
+        __eval(__uratio<_Np, _Dp>)
+        {
+            const size_t __j = static_cast<size_t>(__uratio<_Np, _Dp>::num * (__y_ - _Min)
+                                                   / __uratio<_Np, _Dp>::den);
+            __y_ = __v_[__j];
+            __v_[__j] = __e_();
+            return __y_;
+        }
+
+    template <uint64_t __n, uint64_t __d>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type __evalf()
+        {
+            const double _Fp = __d == 0 ?
+                __n / (2. * 0x8000000000000000ull) :
+                __n / (double)__d;
+            const size_t __j = static_cast<size_t>(_Fp * (__y_ - _Min));
+            __y_ = __v_[__j];
+            __v_[__j] = __e_();
+            return __y_;
+        }
+};
+
+template<class _Engine, size_t __k>
+    _LIBCPP_CONSTEXPR const size_t shuffle_order_engine<_Engine, __k>::table_size;
+
+template<class _Eng, size_t _Kp>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(
+    const shuffle_order_engine<_Eng, _Kp>& __x,
+    const shuffle_order_engine<_Eng, _Kp>& __y)
+{
+    return __x.__y_ == __y.__y_ && _VSTD::equal(__x.__v_, __x.__v_ + _Kp, __y.__v_) &&
+           __x.__e_ == __y.__e_;
+}
+
+template<class _Eng, size_t _Kp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(
+    const shuffle_order_engine<_Eng, _Kp>& __x,
+    const shuffle_order_engine<_Eng, _Kp>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _CharT, class _Traits,
+          class _Eng, size_t _Kp>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const shuffle_order_engine<_Eng, _Kp>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _Ostream;
+    __os.flags(_Ostream::dec | _Ostream::left);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    __os << __x.__e_ << __sp << __x.__v_[0];
+    for (size_t __i = 1; __i < _Kp; ++__i)
+        __os << __sp << __x.__v_[__i];
+    return __os << __sp << __x.__y_;
+}
+
+template <class _CharT, class _Traits,
+          class _Eng, size_t _Kp>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           shuffle_order_engine<_Eng, _Kp>& __x)
+{
+    typedef typename shuffle_order_engine<_Eng, _Kp>::result_type result_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    _Eng __e;
+    result_type _Vp[_Kp+1];
+    __is >> __e;
+    for (size_t __i = 0; __i < _Kp+1; ++__i)
+        __is >> _Vp[__i];
+    if (!__is.fail())
+    {
+        __x.__e_ = __e;
+        for (size_t __i = 0; __i < _Kp; ++__i)
+            __x.__v_[__i] = _Vp[__i];
+        __x.__y_ = _Vp[_Kp];
+    }
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_SHUFFLE_ORDER_ENGINE_H
diff --git a/app/src/main/cpp/libcxx/include/__random/student_t_distribution.h b/app/src/main/cpp/libcxx/include/__random/student_t_distribution.h
new file mode 100644
index 0000000..64847aa
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/student_t_distribution.h
@@ -0,0 +1,155 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_STUDENT_T_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_STUDENT_T_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/gamma_distribution.h>
+#include <__random/is_valid.h>
+#include <__random/normal_distribution.h>
+#include <cmath>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS student_t_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __n_;
+    public:
+        typedef student_t_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __n = 1) : __n_(__n) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type n() const {return __n_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__n_ == __y.__n_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+    normal_distribution<result_type> __nd_;
+
+public:
+    // constructor and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    student_t_distribution() : student_t_distribution(1) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit student_t_distribution(result_type __n)
+        : __p_(param_type(__n)) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit student_t_distribution(result_type __n = 1)
+        : __p_(param_type(__n)) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit student_t_distribution(const param_type& __p)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {__nd_.reset();}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type n() const {return __p_.n();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return -numeric_limits<result_type>::infinity();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::infinity();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const student_t_distribution& __x,
+                        const student_t_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const student_t_distribution& __x,
+                        const student_t_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template <class _RealType>
+template<class _URNG>
+_RealType
+student_t_distribution<_RealType>::operator()(_URNG& __g, const param_type& __p)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    gamma_distribution<result_type> __gd(__p.n() * .5, 2);
+    return __nd_(__g) * _VSTD::sqrt(__p.n()/__gd(__g));
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const student_t_distribution<_RT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    __os << __x.n();
+    return __os;
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           student_t_distribution<_RT>& __x)
+{
+    typedef student_t_distribution<_RT> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __n;
+    __is >> __n;
+    if (!__is.fail())
+        __x.param(param_type(__n));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_STUDENT_T_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/subtract_with_carry_engine.h b/app/src/main/cpp/libcxx/include/__random/subtract_with_carry_engine.h
new file mode 100644
index 0000000..b25ca84
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/subtract_with_carry_engine.h
@@ -0,0 +1,352 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_SUBTRACT_WITH_CARRY_ENGINE_H
+#define _LIBCPP___RANDOM_SUBTRACT_WITH_CARRY_ENGINE_H
+
+#include <__algorithm/equal.h>
+#include <__algorithm/min.h>
+#include <__config>
+#include <__random/is_seed_sequence.h>
+#include <__random/linear_congruential_engine.h>
+#include <cstddef>
+#include <cstdint>
+#include <iosfwd>
+#include <limits>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _UIntType, size_t __w, size_t __s, size_t __r>
+class _LIBCPP_TEMPLATE_VIS subtract_with_carry_engine;
+
+template<class _UInt, size_t _Wp, size_t _Sp, size_t _Rp>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(
+    const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __x,
+    const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __y);
+
+template<class _UInt, size_t _Wp, size_t _Sp, size_t _Rp>
+_LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(
+    const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __x,
+    const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __y);
+
+template <class _CharT, class _Traits,
+          class _UInt, size_t _Wp, size_t _Sp, size_t _Rp>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __x);
+
+template <class _CharT, class _Traits,
+          class _UInt, size_t _Wp, size_t _Sp, size_t _Rp>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __x);
+
+template<class _UIntType, size_t __w, size_t __s, size_t __r>
+class _LIBCPP_TEMPLATE_VIS subtract_with_carry_engine
+{
+public:
+    // types
+    typedef _UIntType result_type;
+
+private:
+    result_type __x_[__r];
+    result_type  __c_;
+    size_t      __i_;
+
+    static _LIBCPP_CONSTEXPR const result_type _Dt = numeric_limits<result_type>::digits;
+    static_assert(  0 <  __w, "subtract_with_carry_engine invalid parameters");
+    static_assert(__w <= _Dt, "subtract_with_carry_engine invalid parameters");
+    static_assert(  0 <  __s, "subtract_with_carry_engine invalid parameters");
+    static_assert(__s <  __r, "subtract_with_carry_engine invalid parameters");
+public:
+    static _LIBCPP_CONSTEXPR const result_type _Min = 0;
+    static _LIBCPP_CONSTEXPR const result_type _Max = __w == _Dt ? result_type(~0) :
+                                                      (result_type(1) << __w) - result_type(1);
+    static_assert(_Min < _Max, "subtract_with_carry_engine invalid parameters");
+
+    // engine characteristics
+    static _LIBCPP_CONSTEXPR const size_t word_size = __w;
+    static _LIBCPP_CONSTEXPR const size_t short_lag = __s;
+    static _LIBCPP_CONSTEXPR const size_t long_lag = __r;
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type min() { return _Min; }
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR result_type max() { return _Max; }
+    static _LIBCPP_CONSTEXPR const result_type default_seed = 19780503u;
+
+    // constructors and seeding functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    subtract_with_carry_engine() : subtract_with_carry_engine(default_seed) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit subtract_with_carry_engine(result_type __sd) { seed(__sd); }
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit subtract_with_carry_engine(result_type __sd = default_seed) {
+      seed(__sd);
+    }
+#endif
+    template<class _Sseq>
+        _LIBCPP_INLINE_VISIBILITY
+        explicit subtract_with_carry_engine(_Sseq& __q,
+        typename enable_if<__is_seed_sequence<_Sseq, subtract_with_carry_engine>::value>::type* = 0)
+        {seed(__q);}
+    _LIBCPP_INLINE_VISIBILITY
+    void seed(result_type __sd = default_seed)
+        {seed(__sd, integral_constant<unsigned, 1 + (__w - 1) / 32>());}
+    template<class _Sseq>
+        _LIBCPP_INLINE_VISIBILITY
+        typename enable_if
+        <
+            __is_seed_sequence<_Sseq, subtract_with_carry_engine>::value,
+            void
+        >::type
+        seed(_Sseq& __q)
+            {__seed(__q, integral_constant<unsigned, 1 + (__w - 1) / 32>());}
+
+    // generating functions
+    result_type operator()();
+    _LIBCPP_INLINE_VISIBILITY
+    void discard(unsigned long long __z) {for (; __z; --__z) operator()();}
+
+    template<class _UInt, size_t _Wp, size_t _Sp, size_t _Rp>
+    friend
+    bool
+    operator==(
+        const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __x,
+        const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __y);
+
+    template<class _UInt, size_t _Wp, size_t _Sp, size_t _Rp>
+    friend
+    bool
+    operator!=(
+        const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __x,
+        const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __y);
+
+    template <class _CharT, class _Traits,
+              class _UInt, size_t _Wp, size_t _Sp, size_t _Rp>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+               const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __x);
+
+    template <class _CharT, class _Traits,
+              class _UInt, size_t _Wp, size_t _Sp, size_t _Rp>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+               subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __x);
+
+private:
+
+    void seed(result_type __sd, integral_constant<unsigned, 1>);
+    void seed(result_type __sd, integral_constant<unsigned, 2>);
+    template<class _Sseq>
+        void __seed(_Sseq& __q, integral_constant<unsigned, 1>);
+    template<class _Sseq>
+        void __seed(_Sseq& __q, integral_constant<unsigned, 2>);
+};
+
+template<class _UIntType, size_t __w, size_t __s, size_t __r>
+    _LIBCPP_CONSTEXPR const size_t subtract_with_carry_engine<_UIntType, __w, __s, __r>::word_size;
+
+template<class _UIntType, size_t __w, size_t __s, size_t __r>
+    _LIBCPP_CONSTEXPR const size_t subtract_with_carry_engine<_UIntType, __w, __s, __r>::short_lag;
+
+template<class _UIntType, size_t __w, size_t __s, size_t __r>
+    _LIBCPP_CONSTEXPR const size_t subtract_with_carry_engine<_UIntType, __w, __s, __r>::long_lag;
+
+template<class _UIntType, size_t __w, size_t __s, size_t __r>
+    _LIBCPP_CONSTEXPR const typename subtract_with_carry_engine<_UIntType, __w, __s, __r>::result_type
+    subtract_with_carry_engine<_UIntType, __w, __s, __r>::default_seed;
+
+template<class _UIntType, size_t __w, size_t __s, size_t __r>
+void
+subtract_with_carry_engine<_UIntType, __w, __s, __r>::seed(result_type __sd,
+        integral_constant<unsigned, 1>)
+{
+    linear_congruential_engine<result_type, 40014u, 0u, 2147483563u>
+        __e(__sd == 0u ? default_seed : __sd);
+    for (size_t __i = 0; __i < __r; ++__i)
+        __x_[__i] = static_cast<result_type>(__e() & _Max);
+    __c_ = __x_[__r-1] == 0;
+    __i_ = 0;
+}
+
+template<class _UIntType, size_t __w, size_t __s, size_t __r>
+void
+subtract_with_carry_engine<_UIntType, __w, __s, __r>::seed(result_type __sd,
+        integral_constant<unsigned, 2>)
+{
+    linear_congruential_engine<result_type, 40014u, 0u, 2147483563u>
+        __e(__sd == 0u ? default_seed : __sd);
+    for (size_t __i = 0; __i < __r; ++__i)
+    {
+        result_type __e0 = __e();
+        __x_[__i] = static_cast<result_type>(
+                                    (__e0 + ((uint64_t)__e() << 32)) & _Max);
+    }
+    __c_ = __x_[__r-1] == 0;
+    __i_ = 0;
+}
+
+template<class _UIntType, size_t __w, size_t __s, size_t __r>
+template<class _Sseq>
+void
+subtract_with_carry_engine<_UIntType, __w, __s, __r>::__seed(_Sseq& __q,
+        integral_constant<unsigned, 1>)
+{
+    const unsigned __k = 1;
+    uint32_t __ar[__r * __k];
+    __q.generate(__ar, __ar + __r * __k);
+    for (size_t __i = 0; __i < __r; ++__i)
+        __x_[__i] = static_cast<result_type>(__ar[__i] & _Max);
+    __c_ = __x_[__r-1] == 0;
+    __i_ = 0;
+}
+
+template<class _UIntType, size_t __w, size_t __s, size_t __r>
+template<class _Sseq>
+void
+subtract_with_carry_engine<_UIntType, __w, __s, __r>::__seed(_Sseq& __q,
+        integral_constant<unsigned, 2>)
+{
+    const unsigned __k = 2;
+    uint32_t __ar[__r * __k];
+    __q.generate(__ar, __ar + __r * __k);
+    for (size_t __i = 0; __i < __r; ++__i)
+        __x_[__i] = static_cast<result_type>(
+                  (__ar[2 * __i] + ((uint64_t)__ar[2 * __i + 1] << 32)) & _Max);
+    __c_ = __x_[__r-1] == 0;
+    __i_ = 0;
+}
+
+template<class _UIntType, size_t __w, size_t __s, size_t __r>
+_UIntType
+subtract_with_carry_engine<_UIntType, __w, __s, __r>::operator()()
+{
+    const result_type& __xs = __x_[(__i_ + (__r - __s)) % __r];
+    result_type& __xr = __x_[__i_];
+    result_type __new_c = __c_ == 0 ? __xs < __xr : __xs != 0 ? __xs <= __xr : 1;
+    __xr = (__xs - __xr - __c_) & _Max;
+    __c_ = __new_c;
+    __i_ = (__i_ + 1) % __r;
+    return __xr;
+}
+
+template<class _UInt, size_t _Wp, size_t _Sp, size_t _Rp>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(
+    const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __x,
+    const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __y)
+{
+    if (__x.__c_ != __y.__c_)
+        return false;
+    if (__x.__i_ == __y.__i_)
+        return _VSTD::equal(__x.__x_, __x.__x_ + _Rp, __y.__x_);
+    if (__x.__i_ == 0 || __y.__i_ == 0)
+    {
+        size_t __j = _VSTD::min(_Rp - __x.__i_, _Rp - __y.__i_);
+        if (!_VSTD::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j,
+                         __y.__x_ + __y.__i_))
+            return false;
+        if (__x.__i_ == 0)
+            return _VSTD::equal(__x.__x_ + __j, __x.__x_ + _Rp, __y.__x_);
+        return _VSTD::equal(__x.__x_, __x.__x_ + (_Rp - __j), __y.__x_ + __j);
+    }
+    if (__x.__i_ < __y.__i_)
+    {
+        size_t __j = _Rp - __y.__i_;
+        if (!_VSTD::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j),
+                         __y.__x_ + __y.__i_))
+            return false;
+        if (!_VSTD::equal(__x.__x_ + (__x.__i_ + __j), __x.__x_ + _Rp,
+                         __y.__x_))
+            return false;
+        return _VSTD::equal(__x.__x_, __x.__x_ + __x.__i_,
+                           __y.__x_ + (_Rp - (__x.__i_ + __j)));
+    }
+    size_t __j = _Rp - __x.__i_;
+    if (!_VSTD::equal(__y.__x_ + __y.__i_, __y.__x_ + (__y.__i_ + __j),
+                     __x.__x_ + __x.__i_))
+        return false;
+    if (!_VSTD::equal(__y.__x_ + (__y.__i_ + __j), __y.__x_ + _Rp,
+                     __x.__x_))
+        return false;
+    return _VSTD::equal(__y.__x_, __y.__x_ + __y.__i_,
+                       __x.__x_ + (_Rp - (__y.__i_ + __j)));
+}
+
+template<class _UInt, size_t _Wp, size_t _Sp, size_t _Rp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(
+    const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __x,
+    const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _CharT, class _Traits,
+          class _UInt, size_t _Wp, size_t _Sp, size_t _Rp>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _Ostream;
+    __os.flags(_Ostream::dec | _Ostream::left);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    __os << __x.__x_[__x.__i_];
+    for (size_t __j = __x.__i_ + 1; __j < _Rp; ++__j)
+        __os << __sp << __x.__x_[__j];
+    for (size_t __j = 0; __j < __x.__i_; ++__j)
+        __os << __sp << __x.__x_[__j];
+    __os << __sp << __x.__c_;
+    return __os;
+}
+
+template <class _CharT, class _Traits,
+          class _UInt, size_t _Wp, size_t _Sp, size_t _Rp>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           subtract_with_carry_engine<_UInt, _Wp, _Sp, _Rp>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    _UInt __t[_Rp+1];
+    for (size_t __i = 0; __i < _Rp+1; ++__i)
+        __is >> __t[__i];
+    if (!__is.fail())
+    {
+        for (size_t __i = 0; __i < _Rp; ++__i)
+            __x.__x_[__i] = __t[__i];
+        __x.__c_ = __t[_Rp];
+        __x.__i_ = 0;
+    }
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_SUBTRACT_WITH_CARRY_ENGINE_H
diff --git a/app/src/main/cpp/libcxx/include/__random/uniform_int_distribution.h b/app/src/main/cpp/libcxx/include/__random/uniform_int_distribution.h
new file mode 100644
index 0000000..b7db8a3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/uniform_int_distribution.h
@@ -0,0 +1,292 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_UNIFORM_INT_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_UNIFORM_INT_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/is_valid.h>
+#include <__random/log2.h>
+#include <bit>
+#include <cstddef>
+#include <cstdint>
+#include <iosfwd>
+#include <limits>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Engine, class _UIntType>
+class __independent_bits_engine
+{
+public:
+    // types
+    typedef _UIntType result_type;
+
+private:
+    typedef typename _Engine::result_type _Engine_result_type;
+    typedef __conditional_t<sizeof(_Engine_result_type) <= sizeof(result_type), result_type, _Engine_result_type>
+        _Working_result_type;
+
+    _Engine& __e_;
+    size_t __w_;
+    size_t __w0_;
+    size_t __n_;
+    size_t __n0_;
+    _Working_result_type __y0_;
+    _Working_result_type __y1_;
+    _Engine_result_type __mask0_;
+    _Engine_result_type __mask1_;
+
+#ifdef _LIBCPP_CXX03_LANG
+    static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min
+                                          + _Working_result_type(1);
+#else
+    static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min()
+                                                      + _Working_result_type(1);
+#endif
+    static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value;
+    static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits;
+    static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits;
+
+public:
+    // constructors and seeding functions
+    __independent_bits_engine(_Engine& __e, size_t __w);
+
+    // generating functions
+    result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());}
+
+private:
+    result_type __eval(false_type);
+    result_type __eval(true_type);
+};
+
+template<class _Engine, class _UIntType>
+__independent_bits_engine<_Engine, _UIntType>
+    ::__independent_bits_engine(_Engine& __e, size_t __w)
+        : __e_(__e),
+          __w_(__w)
+{
+    __n_ = __w_ / __m + (__w_ % __m != 0);
+    __w0_ = __w_ / __n_;
+    if (_Rp == 0)
+        __y0_ = _Rp;
+    else if (__w0_ < _WDt)
+        __y0_ = (_Rp >> __w0_) << __w0_;
+    else
+        __y0_ = 0;
+    if (_Rp - __y0_ > __y0_ / __n_)
+    {
+        ++__n_;
+        __w0_ = __w_ / __n_;
+        if (__w0_ < _WDt)
+            __y0_ = (_Rp >> __w0_) << __w0_;
+        else
+            __y0_ = 0;
+    }
+    __n0_ = __n_ - __w_ % __n_;
+    if (__w0_ < _WDt - 1)
+        __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1);
+    else
+        __y1_ = 0;
+    __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) :
+                          _Engine_result_type(0);
+    __mask1_ = __w0_ < _EDt - 1 ?
+                               _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) :
+                               _Engine_result_type(~0);
+}
+
+template<class _Engine, class _UIntType>
+inline
+_UIntType
+__independent_bits_engine<_Engine, _UIntType>::__eval(false_type)
+{
+    return static_cast<result_type>(__e_() & __mask0_);
+}
+
+template<class _Engine, class _UIntType>
+_UIntType
+__independent_bits_engine<_Engine, _UIntType>::__eval(true_type)
+{
+    const size_t _WRt = numeric_limits<result_type>::digits;
+    result_type _Sp = 0;
+    for (size_t __k = 0; __k < __n0_; ++__k)
+    {
+        _Engine_result_type __u;
+        do
+        {
+            __u = __e_() - _Engine::min();
+        } while (__u >= __y0_);
+        if (__w0_ < _WRt)
+            _Sp <<= __w0_;
+        else
+            _Sp = 0;
+        _Sp += __u & __mask0_;
+    }
+    for (size_t __k = __n0_; __k < __n_; ++__k)
+    {
+        _Engine_result_type __u;
+        do
+        {
+            __u = __e_() - _Engine::min();
+        } while (__u >= __y1_);
+        if (__w0_ < _WRt - 1)
+            _Sp <<= __w0_ + 1;
+        else
+            _Sp = 0;
+        _Sp += __u & __mask1_;
+    }
+    return _Sp;
+}
+
+template<class _IntType = int>
+class uniform_int_distribution
+{
+    static_assert(__libcpp_random_is_valid_inttype<_IntType>::value, "IntType must be a supported integer type");
+public:
+    // types
+    typedef _IntType result_type;
+
+    class param_type
+    {
+        result_type __a_;
+        result_type __b_;
+    public:
+        typedef uniform_int_distribution distribution_type;
+
+        explicit param_type(result_type __a = 0,
+                            result_type __b = numeric_limits<result_type>::max())
+            : __a_(__a), __b_(__b) {}
+
+        result_type a() const {return __a_;}
+        result_type b() const {return __b_;}
+
+        _LIBCPP_HIDE_FROM_ABI
+        friend bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;}
+        _LIBCPP_HIDE_FROM_ABI
+        friend bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructors and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    uniform_int_distribution() : uniform_int_distribution(0) {}
+    explicit uniform_int_distribution(
+        result_type __a, result_type __b = numeric_limits<result_type>::max())
+        : __p_(param_type(__a, __b)) {}
+#else
+    explicit uniform_int_distribution(
+        result_type __a = 0,
+        result_type __b = numeric_limits<result_type>::max())
+        : __p_(param_type(__a, __b)) {}
+#endif
+    explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {}
+    void reset() {}
+
+    // generating functions
+    template<class _URNG> result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    result_type a() const {return __p_.a();}
+    result_type b() const {return __p_.b();}
+
+    param_type param() const {return __p_;}
+    void param(const param_type& __p) {__p_ = __p;}
+
+    result_type min() const {return a();}
+    result_type max() const {return b();}
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend bool operator==(const uniform_int_distribution& __x,
+                           const uniform_int_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    _LIBCPP_HIDE_FROM_ABI
+    friend bool operator!=(const uniform_int_distribution& __x,
+                           const uniform_int_distribution& __y)
+            {return !(__x == __y);}
+};
+
+template<class _IntType>
+template<class _URNG>
+typename uniform_int_distribution<_IntType>::result_type
+uniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p)
+_LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    typedef __conditional_t<sizeof(result_type) <= sizeof(uint32_t), uint32_t, __make_unsigned_t<result_type> >
+        _UIntType;
+    const _UIntType _Rp = _UIntType(__p.b()) - _UIntType(__p.a()) + _UIntType(1);
+    if (_Rp == 1)
+        return __p.a();
+    const size_t _Dt = numeric_limits<_UIntType>::digits;
+    typedef __independent_bits_engine<_URNG, _UIntType> _Eng;
+    if (_Rp == 0)
+        return static_cast<result_type>(_Eng(__g, _Dt)());
+    size_t __w = _Dt - std::__countl_zero(_Rp) - 1;
+    if ((_Rp & (numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0)
+        ++__w;
+    _Eng __e(__g, __w);
+    _UIntType __u;
+    do
+    {
+        __u = __e();
+    } while (__u >= _Rp);
+    return static_cast<result_type>(__u + __p.a());
+}
+
+template <class _CharT, class _Traits, class _IT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const uniform_int_distribution<_IT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _Ostream;
+    __os.flags(_Ostream::dec | _Ostream::left);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    return __os << __x.a() << __sp << __x.b();
+}
+
+template <class _CharT, class _Traits, class _IT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           uniform_int_distribution<_IT>& __x)
+{
+    typedef uniform_int_distribution<_IT> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __a;
+    result_type __b;
+    __is >> __a >> __b;
+    if (!__is.fail())
+        __x.param(param_type(__a, __b));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_UNIFORM_INT_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/uniform_random_bit_generator.h b/app/src/main/cpp/libcxx/include/__random/uniform_random_bit_generator.h
new file mode 100644
index 0000000..84a30b0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/uniform_random_bit_generator.h
@@ -0,0 +1,45 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_UNIFORM_RANDOM_BIT_GENERATOR_H
+#define _LIBCPP___RANDOM_UNIFORM_RANDOM_BIT_GENERATOR_H
+
+#include <__concepts/arithmetic.h>
+#include <__concepts/invocable.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [rand.req.urng]
+template<class _Gen>
+concept uniform_random_bit_generator =
+  invocable<_Gen&> && unsigned_integral<invoke_result_t<_Gen&>> &&
+  requires {
+    { _Gen::min() } -> same_as<invoke_result_t<_Gen&>>;
+    { _Gen::max() } -> same_as<invoke_result_t<_Gen&>>;
+    requires bool_constant<(_Gen::min() < _Gen::max())>::value;
+  };
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_UNIFORM_RANDOM_BIT_GENERATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__random/uniform_real_distribution.h b/app/src/main/cpp/libcxx/include/__random/uniform_real_distribution.h
new file mode 100644
index 0000000..b52b689
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/uniform_real_distribution.h
@@ -0,0 +1,162 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_UNIFORM_REAL_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_UNIFORM_REAL_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/generate_canonical.h>
+#include <__random/is_valid.h>
+#include <iosfwd>
+#include <limits>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS uniform_real_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __a_;
+        result_type __b_;
+    public:
+        typedef uniform_real_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __a = 0,
+                            result_type __b = 1)
+            : __a_(__a), __b_(__b) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type a() const {return __a_;}
+        _LIBCPP_INLINE_VISIBILITY
+        result_type b() const {return __b_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructors and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    uniform_real_distribution() : uniform_real_distribution(0) {}
+    explicit uniform_real_distribution(result_type __a, result_type __b = 1)
+        : __p_(param_type(__a, __b)) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit uniform_real_distribution(result_type __a = 0, result_type __b = 1)
+        : __p_(param_type(__a, __b)) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit uniform_real_distribution(const param_type& __p) : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG> _LIBCPP_INLINE_VISIBILITY result_type operator()(_URNG& __g, const param_type& __p);
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type a() const {return __p_.a();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type b() const {return __p_.b();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return a();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return b();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const uniform_real_distribution& __x,
+                        const uniform_real_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const uniform_real_distribution& __x,
+                        const uniform_real_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template<class _RealType>
+template<class _URNG>
+inline
+typename uniform_real_distribution<_RealType>::result_type
+uniform_real_distribution<_RealType>::operator()(_URNG& __g, const param_type& __p)
+{
+    static_assert(__libcpp_random_is_valid_urng<_URNG>::value, "");
+    return (__p.b() - __p.a())
+        * _VSTD::generate_canonical<_RealType, numeric_limits<_RealType>::digits>(__g)
+        + __p.a();
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const uniform_real_distribution<_RT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    return __os << __x.a() << __sp << __x.b();
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           uniform_real_distribution<_RT>& __x)
+{
+    typedef uniform_real_distribution<_RT> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __a;
+    result_type __b;
+    __is >> __a >> __b;
+    if (!__is.fail())
+        __x.param(param_type(__a, __b));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_UNIFORM_REAL_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__random/weibull_distribution.h b/app/src/main/cpp/libcxx/include/__random/weibull_distribution.h
new file mode 100644
index 0000000..df834e6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__random/weibull_distribution.h
@@ -0,0 +1,155 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANDOM_WEIBULL_DISTRIBUTION_H
+#define _LIBCPP___RANDOM_WEIBULL_DISTRIBUTION_H
+
+#include <__config>
+#include <__random/exponential_distribution.h>
+#include <cmath>
+#include <iosfwd>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _RealType = double>
+class _LIBCPP_TEMPLATE_VIS weibull_distribution
+{
+public:
+    // types
+    typedef _RealType result_type;
+
+    class _LIBCPP_TEMPLATE_VIS param_type
+    {
+        result_type __a_;
+        result_type __b_;
+    public:
+        typedef weibull_distribution distribution_type;
+
+        _LIBCPP_INLINE_VISIBILITY
+        explicit param_type(result_type __a = 1, result_type __b = 1)
+            : __a_(__a), __b_(__b) {}
+
+        _LIBCPP_INLINE_VISIBILITY
+        result_type a() const {return __a_;}
+        _LIBCPP_INLINE_VISIBILITY
+        result_type b() const {return __b_;}
+
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator==(const param_type& __x, const param_type& __y)
+            {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;}
+        friend _LIBCPP_INLINE_VISIBILITY
+            bool operator!=(const param_type& __x, const param_type& __y)
+            {return !(__x == __y);}
+    };
+
+private:
+    param_type __p_;
+
+public:
+    // constructor and reset functions
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    weibull_distribution() : weibull_distribution(1) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit weibull_distribution(result_type __a, result_type __b = 1)
+        : __p_(param_type(__a, __b)) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit weibull_distribution(result_type __a = 1, result_type __b = 1)
+        : __p_(param_type(__a, __b)) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit weibull_distribution(const param_type& __p)
+        : __p_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void reset() {}
+
+    // generating functions
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g)
+        {return (*this)(__g, __p_);}
+    template<class _URNG>
+        _LIBCPP_INLINE_VISIBILITY
+        result_type operator()(_URNG& __g, const param_type& __p)
+        {return __p.b() *
+            _VSTD::pow(exponential_distribution<result_type>()(__g), 1/__p.a());}
+
+    // property functions
+    _LIBCPP_INLINE_VISIBILITY
+    result_type a() const {return __p_.a();}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type b() const {return __p_.b();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    param_type param() const {return __p_;}
+    _LIBCPP_INLINE_VISIBILITY
+    void param(const param_type& __p) {__p_ = __p;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    result_type min() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    result_type max() const {return numeric_limits<result_type>::infinity();}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const weibull_distribution& __x,
+                        const weibull_distribution& __y)
+        {return __x.__p_ == __y.__p_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const weibull_distribution& __x,
+                        const weibull_distribution& __y)
+        {return !(__x == __y);}
+};
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const weibull_distribution<_RT>& __x)
+{
+    __save_flags<_CharT, _Traits> __lx(__os);
+    typedef basic_ostream<_CharT, _Traits> _OStream;
+    __os.flags(_OStream::dec | _OStream::left | _OStream::fixed |
+               _OStream::scientific);
+    _CharT __sp = __os.widen(' ');
+    __os.fill(__sp);
+    __os << __x.a() << __sp << __x.b();
+    return __os;
+}
+
+template <class _CharT, class _Traits, class _RT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           weibull_distribution<_RT>& __x)
+{
+    typedef weibull_distribution<_RT> _Eng;
+    typedef typename _Eng::result_type result_type;
+    typedef typename _Eng::param_type param_type;
+    __save_flags<_CharT, _Traits> __lx(__is);
+    typedef basic_istream<_CharT, _Traits> _Istream;
+    __is.flags(_Istream::dec | _Istream::skipws);
+    result_type __a;
+    result_type __b;
+    __is >> __a >> __b;
+    if (!__is.fail())
+        __x.param(param_type(__a, __b));
+    return __is;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANDOM_WEIBULL_DISTRIBUTION_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/access.h b/app/src/main/cpp/libcxx/include/__ranges/access.h
new file mode 100644
index 0000000..e48a71a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/access.h
@@ -0,0 +1,230 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_ACCESS_H
+#define _LIBCPP___RANGES_ACCESS_H
+
+#include <__concepts/class_or_enum.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/readable_traits.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/remove_cvref.h>
+#include <__type_traits/remove_reference.h>
+#include <__utility/auto_cast.h>
+#include <__utility/declval.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+  template <class _Tp>
+  concept __can_borrow =
+    is_lvalue_reference_v<_Tp> || enable_borrowed_range<remove_cvref_t<_Tp>>;
+} // namespace ranges
+
+// [range.access.begin]
+
+namespace ranges {
+namespace __begin {
+  template <class _Tp>
+  concept __member_begin =
+    __can_borrow<_Tp> &&
+    __workaround_52970<_Tp> &&
+    requires(_Tp&& __t) {
+      { _LIBCPP_AUTO_CAST(__t.begin()) } -> input_or_output_iterator;
+    };
+
+  void begin(auto&) = delete;
+  void begin(const auto&) = delete;
+
+  template <class _Tp>
+  concept __unqualified_begin =
+    !__member_begin<_Tp> &&
+    __can_borrow<_Tp> &&
+    __class_or_enum<remove_cvref_t<_Tp>> &&
+    requires(_Tp && __t) {
+      { _LIBCPP_AUTO_CAST(begin(__t)) } -> input_or_output_iterator;
+    };
+
+  struct __fn {
+    template <class _Tp>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp (&__t)[]) const noexcept
+      requires (sizeof(_Tp) >= 0)  // Disallow incomplete element types.
+    {
+      return __t + 0;
+    }
+
+    template <class _Tp, size_t _Np>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp (&__t)[_Np]) const noexcept
+      requires (sizeof(_Tp) >= 0)  // Disallow incomplete element types.
+    {
+      return __t + 0;
+    }
+
+    template <class _Tp>
+      requires __member_begin<_Tp>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.begin())))
+    {
+      return _LIBCPP_AUTO_CAST(__t.begin());
+    }
+
+    template <class _Tp>
+      requires __unqualified_begin<_Tp>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(_LIBCPP_AUTO_CAST(begin(__t))))
+    {
+      return _LIBCPP_AUTO_CAST(begin(__t));
+    }
+
+    void operator()(auto&&) const = delete;
+  };
+} // namespace __begin
+
+inline namespace __cpo {
+  inline constexpr auto begin = __begin::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+// [range.range]
+
+namespace ranges {
+  template <class _Tp>
+  using iterator_t = decltype(ranges::begin(std::declval<_Tp&>()));
+} // namespace ranges
+
+// [range.access.end]
+
+namespace ranges {
+namespace __end {
+  template <class _Tp>
+  concept __member_end =
+    __can_borrow<_Tp> &&
+    __workaround_52970<_Tp> &&
+    requires(_Tp&& __t) {
+      typename iterator_t<_Tp>;
+      { _LIBCPP_AUTO_CAST(__t.end()) } -> sentinel_for<iterator_t<_Tp>>;
+    };
+
+  void end(auto&) = delete;
+  void end(const auto&) = delete;
+
+  template <class _Tp>
+  concept __unqualified_end =
+    !__member_end<_Tp> &&
+    __can_borrow<_Tp> &&
+    __class_or_enum<remove_cvref_t<_Tp>> &&
+    requires(_Tp && __t) {
+      typename iterator_t<_Tp>;
+      { _LIBCPP_AUTO_CAST(end(__t)) } -> sentinel_for<iterator_t<_Tp>>;
+    };
+
+  struct __fn {
+    template <class _Tp, size_t _Np>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp (&__t)[_Np]) const noexcept
+      requires (sizeof(_Tp) >= 0)  // Disallow incomplete element types.
+    {
+      return __t + _Np;
+    }
+
+    template <class _Tp>
+      requires __member_end<_Tp>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.end())))
+    {
+      return _LIBCPP_AUTO_CAST(__t.end());
+    }
+
+    template <class _Tp>
+      requires __unqualified_end<_Tp>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(_LIBCPP_AUTO_CAST(end(__t))))
+    {
+      return _LIBCPP_AUTO_CAST(end(__t));
+    }
+
+    void operator()(auto&&) const = delete;
+  };
+} // namespace __end
+
+inline namespace __cpo {
+  inline constexpr auto end = __end::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+// [range.access.cbegin]
+
+namespace ranges {
+namespace __cbegin {
+  struct __fn {
+    template <class _Tp>
+      requires is_lvalue_reference_v<_Tp&&>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(ranges::begin(static_cast<const remove_reference_t<_Tp>&>(__t))))
+      -> decltype(      ranges::begin(static_cast<const remove_reference_t<_Tp>&>(__t)))
+      { return          ranges::begin(static_cast<const remove_reference_t<_Tp>&>(__t)); }
+
+    template <class _Tp>
+      requires is_rvalue_reference_v<_Tp&&>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(ranges::begin(static_cast<const _Tp&&>(__t))))
+      -> decltype(      ranges::begin(static_cast<const _Tp&&>(__t)))
+      { return          ranges::begin(static_cast<const _Tp&&>(__t)); }
+  };
+} // namespace __cbegin
+
+inline namespace __cpo {
+  inline constexpr auto cbegin = __cbegin::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+// [range.access.cend]
+
+namespace ranges {
+namespace __cend {
+  struct __fn {
+    template <class _Tp>
+      requires is_lvalue_reference_v<_Tp&&>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(ranges::end(static_cast<const remove_reference_t<_Tp>&>(__t))))
+      -> decltype(      ranges::end(static_cast<const remove_reference_t<_Tp>&>(__t)))
+      { return          ranges::end(static_cast<const remove_reference_t<_Tp>&>(__t)); }
+
+    template <class _Tp>
+      requires is_rvalue_reference_v<_Tp&&>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(ranges::end(static_cast<const _Tp&&>(__t))))
+      -> decltype(      ranges::end(static_cast<const _Tp&&>(__t)))
+      { return          ranges::end(static_cast<const _Tp&&>(__t)); }
+  };
+} // namespace __cend
+
+inline namespace __cpo {
+  inline constexpr auto cend = __cend::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_ACCESS_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/all.h b/app/src/main/cpp/libcxx/include/__ranges/all.h
new file mode 100644
index 0000000..511f7b3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/all.h
@@ -0,0 +1,84 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_ALL_H
+#define _LIBCPP___RANGES_ALL_H
+
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/owning_view.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/ref_view.h>
+#include <__utility/auto_cast.h>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges::views {
+
+namespace __all {
+  struct __fn : __range_adaptor_closure<__fn> {
+    template<class _Tp>
+      requires ranges::view<decay_t<_Tp>>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(_LIBCPP_AUTO_CAST(std::forward<_Tp>(__t))))
+      -> decltype(_LIBCPP_AUTO_CAST(std::forward<_Tp>(__t)))
+    {
+      return _LIBCPP_AUTO_CAST(std::forward<_Tp>(__t));
+    }
+
+    template<class _Tp>
+      requires (!ranges::view<decay_t<_Tp>>) &&
+               requires (_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__t)}; }
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(ranges::ref_view{std::forward<_Tp>(__t)}))
+    {
+      return ranges::ref_view{std::forward<_Tp>(__t)};
+    }
+
+    template<class _Tp>
+      requires (!ranges::view<decay_t<_Tp>> &&
+                !requires (_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__t)}; } &&
+                 requires (_Tp&& __t) { ranges::owning_view{std::forward<_Tp>(__t)}; })
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(ranges::owning_view{std::forward<_Tp>(__t)}))
+    {
+      return ranges::owning_view{std::forward<_Tp>(__t)};
+    }
+  };
+} // namespace __all
+
+inline namespace __cpo {
+  inline constexpr auto all = __all::__fn{};
+} // namespace __cpo
+
+template<ranges::viewable_range _Range>
+using all_t = decltype(views::all(std::declval<_Range>()));
+
+} // namespace ranges::views
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_ALL_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/as_rvalue_view.h b/app/src/main/cpp/libcxx/include/__ranges/as_rvalue_view.h
new file mode 100644
index 0000000..422d8a8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/as_rvalue_view.h
@@ -0,0 +1,137 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_AS_RVALUE_H
+#define _LIBCPP___RANGES_AS_RVALUE_H
+
+#include <__concepts/constructible.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__iterator/move_iterator.h>
+#include <__iterator/move_sentinel.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/size.h>
+#include <__ranges/view_interface.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER >= 23
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+template <view _View>
+  requires input_range<_View>
+class as_rvalue_view : public view_interface<as_rvalue_view<_View>> {
+  _LIBCPP_NO_UNIQUE_ADDRESS _View __base_ = _View();
+
+public:
+  _LIBCPP_HIDE_FROM_ABI as_rvalue_view()
+    requires default_initializable<_View>
+  = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit as_rvalue_view(_View __base) : __base_(std::move(__base)) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _View base() const&
+    requires copy_constructible<_View>
+  {
+    return __base_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _View base() && { return std::move(__base_); }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto begin()
+    requires(!__simple_view<_View>)
+  {
+    return move_iterator(ranges::begin(__base_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto begin() const
+    requires range<const _View>
+  {
+    return move_iterator(ranges::begin(__base_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto end()
+    requires(!__simple_view<_View>)
+  {
+    if constexpr (common_range<_View>) {
+      return move_iterator(ranges::end(__base_));
+    } else {
+      return move_sentinel(ranges::end(__base_));
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto end() const
+    requires range<const _View>
+  {
+    if constexpr (common_range<const _View>) {
+      return move_iterator(ranges::end(__base_));
+    } else {
+      return move_sentinel(ranges::end(__base_));
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto size()
+    requires sized_range<_View>
+  {
+    return ranges::size(__base_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto size() const
+    requires sized_range<const _View>
+  {
+    return ranges::size(__base_);
+  }
+};
+
+template <class _Range>
+as_rvalue_view(_Range&&) -> as_rvalue_view<views::all_t<_Range>>;
+
+template <class _View>
+inline constexpr bool enable_borrowed_range<as_rvalue_view<_View>> = enable_borrowed_range<_View>;
+
+namespace views {
+namespace __as_rvalue {
+struct __fn : __range_adaptor_closure<__fn> {
+  template <class _Range>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Range&& __range) const
+      noexcept(noexcept(/**/ as_rvalue_view(std::forward<_Range>(__range))))
+          -> decltype(/*--*/ as_rvalue_view(std::forward<_Range>(__range))) {
+    return /*-------------*/ as_rvalue_view(std::forward<_Range>(__range));
+  }
+
+  template <class _Range>
+    requires same_as<range_rvalue_reference_t<_Range>, range_reference_t<_Range>>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Range&& __range) const
+      noexcept(noexcept(/**/ views::all(std::forward<_Range>(__range))))
+          -> decltype(/*--*/ views::all(std::forward<_Range>(__range))) {
+    return /*-------------*/ views::all(std::forward<_Range>(__range));
+  }
+};
+} // namespace __as_rvalue
+
+inline namespace __cpo {
+constexpr auto as_rvalue = __as_rvalue::__fn{};
+} // namespace __cpo
+} // namespace views
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 23
+
+#endif // _LIBCPP___RANGES_AS_RVALUE_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/common_view.h b/app/src/main/cpp/libcxx/include/__ranges/common_view.h
new file mode 100644
index 0000000..8d7ae58
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/common_view.h
@@ -0,0 +1,137 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_COMMON_VIEW_H
+#define _LIBCPP___RANGES_COMMON_VIEW_H
+
+#include <__concepts/constructible.h>
+#include <__concepts/copyable.h>
+#include <__config>
+#include <__iterator/common_iterator.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/size.h>
+#include <__ranges/view_interface.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+template<view _View>
+  requires (!common_range<_View> && copyable<iterator_t<_View>>)
+class common_view : public view_interface<common_view<_View>> {
+  _View __base_ = _View();
+
+public:
+  _LIBCPP_HIDE_FROM_ABI
+  common_view() requires default_initializable<_View> = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr explicit common_view(_View __v) : __base_(std::move(__v)) { }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _View base() const& requires copy_constructible<_View> { return __base_; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _View base() && { return std::move(__base_); }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto begin() {
+    if constexpr (random_access_range<_View> && sized_range<_View>)
+      return ranges::begin(__base_);
+    else
+      return common_iterator<iterator_t<_View>, sentinel_t<_View>>(ranges::begin(__base_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto begin() const requires range<const _View> {
+    if constexpr (random_access_range<const _View> && sized_range<const _View>)
+      return ranges::begin(__base_);
+    else
+      return common_iterator<iterator_t<const _View>, sentinel_t<const _View>>(ranges::begin(__base_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto end() {
+    if constexpr (random_access_range<_View> && sized_range<_View>)
+      return ranges::begin(__base_) + ranges::size(__base_);
+    else
+      return common_iterator<iterator_t<_View>, sentinel_t<_View>>(ranges::end(__base_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto end() const requires range<const _View> {
+    if constexpr (random_access_range<const _View> && sized_range<const _View>)
+      return ranges::begin(__base_) + ranges::size(__base_);
+    else
+      return common_iterator<iterator_t<const _View>, sentinel_t<const _View>>(ranges::end(__base_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto size() requires sized_range<_View> {
+    return ranges::size(__base_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto size() const requires sized_range<const _View> {
+    return ranges::size(__base_);
+  }
+};
+
+template<class _Range>
+common_view(_Range&&)
+  -> common_view<views::all_t<_Range>>;
+
+template<class _View>
+inline constexpr bool enable_borrowed_range<common_view<_View>> = enable_borrowed_range<_View>;
+
+namespace views {
+namespace __common {
+  struct __fn : __range_adaptor_closure<__fn> {
+    template<class _Range>
+      requires common_range<_Range>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Range&& __range) const
+      noexcept(noexcept(views::all(std::forward<_Range>(__range))))
+      -> decltype(      views::all(std::forward<_Range>(__range)))
+      { return          views::all(std::forward<_Range>(__range)); }
+
+    template<class _Range>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Range&& __range) const
+      noexcept(noexcept(common_view{std::forward<_Range>(__range)}))
+      -> decltype(      common_view{std::forward<_Range>(__range)})
+      { return          common_view{std::forward<_Range>(__range)}; }
+  };
+} // namespace __common
+
+inline namespace __cpo {
+  inline constexpr auto common = __common::__fn{};
+} // namespace __cpo
+} // namespace views
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_COMMON_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/concepts.h b/app/src/main/cpp/libcxx/include/__ranges/concepts.h
new file mode 100644
index 0000000..e34c545
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/concepts.h
@@ -0,0 +1,147 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_CONCEPTS_H
+#define _LIBCPP___RANGES_CONCEPTS_H
+
+#include <__concepts/constructible.h>
+#include <__concepts/movable.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/readable_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/data.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/enable_view.h>
+#include <__ranges/size.h>
+#include <__type_traits/add_pointer.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/remove_cvref.h>
+#include <__type_traits/remove_reference.h>
+#include <__utility/declval.h>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+  // [range.range]
+
+  template <class _Tp>
+  concept range = requires(_Tp& __t) {
+    ranges::begin(__t); // sometimes equality-preserving
+    ranges::end(__t);
+  };
+
+  template <class _Tp>
+  concept input_range = range<_Tp> && input_iterator<iterator_t<_Tp>>;
+
+  template<class _Range>
+  concept borrowed_range = range<_Range> &&
+    (is_lvalue_reference_v<_Range> || enable_borrowed_range<remove_cvref_t<_Range>>);
+
+  // `iterator_t` defined in <__ranges/access.h>
+
+  template <range _Rp>
+  using sentinel_t = decltype(ranges::end(std::declval<_Rp&>()));
+
+  template <range _Rp>
+  using range_difference_t = iter_difference_t<iterator_t<_Rp>>;
+
+  template <range _Rp>
+  using range_value_t = iter_value_t<iterator_t<_Rp>>;
+
+  template <range _Rp>
+  using range_reference_t = iter_reference_t<iterator_t<_Rp>>;
+
+  template <range _Rp>
+  using range_rvalue_reference_t = iter_rvalue_reference_t<iterator_t<_Rp>>;
+
+  // [range.sized]
+  template <class _Tp>
+  concept sized_range = range<_Tp> && requires(_Tp& __t) { ranges::size(__t); };
+
+  template<sized_range _Rp>
+  using range_size_t = decltype(ranges::size(std::declval<_Rp&>()));
+
+  // `disable_sized_range` defined in `<__ranges/size.h>`
+
+  // [range.view], views
+
+  // `enable_view` defined in <__ranges/enable_view.h>
+  // `view_base` defined in <__ranges/enable_view.h>
+
+  template <class _Tp>
+  concept view =
+    range<_Tp> &&
+    movable<_Tp> &&
+    enable_view<_Tp>;
+
+  template <class _Range>
+  concept __simple_view =
+    view<_Range> && range<const _Range> &&
+    same_as<iterator_t<_Range>, iterator_t<const _Range>> &&
+    same_as<sentinel_t<_Range>, sentinel_t<const _Range>>;
+
+  // [range.refinements], other range refinements
+  template <class _Rp, class _Tp>
+  concept output_range = range<_Rp> && output_iterator<iterator_t<_Rp>, _Tp>;
+
+  template <class _Tp>
+  concept forward_range = input_range<_Tp> && forward_iterator<iterator_t<_Tp>>;
+
+  template <class _Tp>
+  concept bidirectional_range = forward_range<_Tp> && bidirectional_iterator<iterator_t<_Tp>>;
+
+  template <class _Tp>
+  concept random_access_range =
+      bidirectional_range<_Tp> && random_access_iterator<iterator_t<_Tp>>;
+
+  template<class _Tp>
+  concept contiguous_range =
+    random_access_range<_Tp> &&
+    contiguous_iterator<iterator_t<_Tp>> &&
+    requires(_Tp& __t) {
+      { ranges::data(__t) } -> same_as<add_pointer_t<range_reference_t<_Tp>>>;
+    };
+
+  template <class _Tp>
+  concept common_range = range<_Tp> && same_as<iterator_t<_Tp>, sentinel_t<_Tp>>;
+
+  template <class _Tp>
+  inline constexpr bool __is_std_initializer_list = false;
+
+  template <class _Ep>
+  inline constexpr bool __is_std_initializer_list<initializer_list<_Ep>> = true;
+
+  template <class _Tp>
+  concept viewable_range =
+    range<_Tp> &&
+    ((view<remove_cvref_t<_Tp>> && constructible_from<remove_cvref_t<_Tp>, _Tp>) ||
+     (!view<remove_cvref_t<_Tp>> &&
+      (is_lvalue_reference_v<_Tp> ||
+       (movable<remove_reference_t<_Tp>> && !__is_std_initializer_list<remove_cvref_t<_Tp>>))));
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_CONCEPTS_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/copyable_box.h b/app/src/main/cpp/libcxx/include/__ranges/copyable_box.h
new file mode 100644
index 0000000..fb3d6e4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/copyable_box.h
@@ -0,0 +1,180 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_COPYABLE_BOX_H
+#define _LIBCPP___RANGES_COPYABLE_BOX_H
+
+#include <__concepts/constructible.h>
+#include <__concepts/copyable.h>
+#include <__concepts/movable.h>
+#include <__config>
+#include <__memory/addressof.h>
+#include <__memory/construct_at.h>
+#include <__utility/move.h>
+#include <optional>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// __copyable_box allows turning a type that is copy-constructible (but maybe not copy-assignable) into
+// a type that is both copy-constructible and copy-assignable. It does that by introducing an empty state
+// and basically doing destroy-then-copy-construct in the assignment operator. The empty state is necessary
+// to handle the case where the copy construction fails after destroying the object.
+//
+// In some cases, we can completely avoid the use of an empty state; we provide a specialization of
+// __copyable_box that does this, see below for the details.
+
+template<class _Tp>
+concept __copy_constructible_object = copy_constructible<_Tp> && is_object_v<_Tp>;
+
+namespace ranges {
+  // Primary template - uses std::optional and introduces an empty state in case assignment fails.
+  template<__copy_constructible_object _Tp>
+  class __copyable_box {
+    _LIBCPP_NO_UNIQUE_ADDRESS optional<_Tp> __val_;
+
+  public:
+    template<class ..._Args>
+      requires is_constructible_v<_Tp, _Args...>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit __copyable_box(in_place_t, _Args&& ...__args)
+      noexcept(is_nothrow_constructible_v<_Tp, _Args...>)
+      : __val_(in_place, std::forward<_Args>(__args)...)
+    { }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __copyable_box() noexcept(is_nothrow_default_constructible_v<_Tp>)
+      requires default_initializable<_Tp>
+      : __val_(in_place)
+    { }
+
+    _LIBCPP_HIDE_FROM_ABI __copyable_box(__copyable_box const&) = default;
+    _LIBCPP_HIDE_FROM_ABI __copyable_box(__copyable_box&&) = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __copyable_box& operator=(__copyable_box const& __other)
+      noexcept(is_nothrow_copy_constructible_v<_Tp>)
+    {
+      if (this != std::addressof(__other)) {
+        if (__other.__has_value()) __val_.emplace(*__other);
+        else                       __val_.reset();
+      }
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    __copyable_box& operator=(__copyable_box&&) requires movable<_Tp> = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __copyable_box& operator=(__copyable_box&& __other)
+      noexcept(is_nothrow_move_constructible_v<_Tp>)
+    {
+      if (this != std::addressof(__other)) {
+        if (__other.__has_value()) __val_.emplace(std::move(*__other));
+        else                       __val_.reset();
+      }
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr _Tp const& operator*() const noexcept { return *__val_; }
+    _LIBCPP_HIDE_FROM_ABI constexpr _Tp& operator*() noexcept { return *__val_; }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr const _Tp *operator->() const noexcept { return __val_.operator->(); }
+    _LIBCPP_HIDE_FROM_ABI constexpr _Tp *operator->() noexcept { return __val_.operator->(); }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr bool __has_value() const noexcept { return __val_.has_value(); }
+  };
+
+  // This partial specialization implements an optimization for when we know we don't need to store
+  // an empty state to represent failure to perform an assignment. For copy-assignment, this happens:
+  //
+  // 1. If the type is copyable (which includes copy-assignment), we can use the type's own assignment operator
+  //    directly and avoid using std::optional.
+  // 2. If the type is not copyable, but it is nothrow-copy-constructible, then we can implement assignment as
+  //    destroy-and-then-construct and we know it will never fail, so we don't need an empty state.
+  //
+  // The exact same reasoning can be applied for move-assignment, with copyable replaced by movable and
+  // nothrow-copy-constructible replaced by nothrow-move-constructible. This specialization is enabled
+  // whenever we can apply any of these optimizations for both the copy assignment and the move assignment
+  // operator.
+  template<class _Tp>
+  concept __doesnt_need_empty_state_for_copy = copyable<_Tp> || is_nothrow_copy_constructible_v<_Tp>;
+
+  template<class _Tp>
+  concept __doesnt_need_empty_state_for_move = movable<_Tp> || is_nothrow_move_constructible_v<_Tp>;
+
+  template<__copy_constructible_object _Tp>
+    requires __doesnt_need_empty_state_for_copy<_Tp> && __doesnt_need_empty_state_for_move<_Tp>
+  class __copyable_box<_Tp> {
+    _LIBCPP_NO_UNIQUE_ADDRESS _Tp __val_;
+
+  public:
+    template<class ..._Args>
+      requires is_constructible_v<_Tp, _Args...>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit __copyable_box(in_place_t, _Args&& ...__args)
+      noexcept(is_nothrow_constructible_v<_Tp, _Args...>)
+      : __val_(std::forward<_Args>(__args)...)
+    { }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __copyable_box() noexcept(is_nothrow_default_constructible_v<_Tp>)
+      requires default_initializable<_Tp>
+      : __val_()
+    { }
+
+    _LIBCPP_HIDE_FROM_ABI __copyable_box(__copyable_box const&) = default;
+    _LIBCPP_HIDE_FROM_ABI __copyable_box(__copyable_box&&) = default;
+
+    // Implementation of assignment operators in case we perform optimization (1)
+    _LIBCPP_HIDE_FROM_ABI __copyable_box& operator=(__copyable_box const&) requires copyable<_Tp> = default;
+    _LIBCPP_HIDE_FROM_ABI __copyable_box& operator=(__copyable_box&&) requires movable<_Tp> = default;
+
+    // Implementation of assignment operators in case we perform optimization (2)
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __copyable_box& operator=(__copyable_box const& __other) noexcept {
+      static_assert(is_nothrow_copy_constructible_v<_Tp>);
+      if (this != std::addressof(__other)) {
+        std::destroy_at(std::addressof(__val_));
+        std::construct_at(std::addressof(__val_), __other.__val_);
+      }
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __copyable_box& operator=(__copyable_box&& __other) noexcept {
+      static_assert(is_nothrow_move_constructible_v<_Tp>);
+      if (this != std::addressof(__other)) {
+        std::destroy_at(std::addressof(__val_));
+        std::construct_at(std::addressof(__val_), std::move(__other.__val_));
+      }
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr _Tp const& operator*() const noexcept { return __val_; }
+    _LIBCPP_HIDE_FROM_ABI constexpr _Tp& operator*() noexcept { return __val_; }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr const _Tp *operator->() const noexcept { return std::addressof(__val_); }
+    _LIBCPP_HIDE_FROM_ABI constexpr _Tp *operator->() noexcept { return std::addressof(__val_); }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr bool __has_value() const noexcept { return true; }
+  };
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_COPYABLE_BOX_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/counted.h b/app/src/main/cpp/libcxx/include/__ranges/counted.h
new file mode 100644
index 0000000..138aa0e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/counted.h
@@ -0,0 +1,82 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_COUNTED_H
+#define _LIBCPP___RANGES_COUNTED_H
+
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/counted_iterator.h>
+#include <__iterator/default_sentinel.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/pointer_traits.h>
+#include <__ranges/subrange.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <span>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges::views {
+
+namespace __counted {
+
+  struct __fn {
+    template<contiguous_iterator _It>
+    _LIBCPP_HIDE_FROM_ABI
+    static constexpr auto __go(_It __it, iter_difference_t<_It> __count)
+      noexcept(noexcept(span(std::to_address(__it), static_cast<size_t>(__count))))
+      // Deliberately omit return-type SFINAE, because to_address is not SFINAE-friendly
+      { return          span(std::to_address(__it), static_cast<size_t>(__count)); }
+
+    template<random_access_iterator _It>
+    _LIBCPP_HIDE_FROM_ABI
+    static constexpr auto __go(_It __it, iter_difference_t<_It> __count)
+      noexcept(noexcept(subrange(__it, __it + __count)))
+      -> decltype(      subrange(__it, __it + __count))
+      { return          subrange(__it, __it + __count); }
+
+    template<class _It>
+    _LIBCPP_HIDE_FROM_ABI
+    static constexpr auto __go(_It __it, iter_difference_t<_It> __count)
+      noexcept(noexcept(subrange(counted_iterator(std::move(__it), __count), default_sentinel)))
+      -> decltype(      subrange(counted_iterator(std::move(__it), __count), default_sentinel))
+      { return          subrange(counted_iterator(std::move(__it), __count), default_sentinel); }
+
+    template<class _It, convertible_to<iter_difference_t<_It>> _Diff>
+      requires input_or_output_iterator<decay_t<_It>>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_It&& __it, _Diff&& __count) const
+      noexcept(noexcept(__go(std::forward<_It>(__it), std::forward<_Diff>(__count))))
+      -> decltype(      __go(std::forward<_It>(__it), std::forward<_Diff>(__count)))
+      { return          __go(std::forward<_It>(__it), std::forward<_Diff>(__count)); }
+  };
+
+} // namespace __counted
+
+inline namespace __cpo {
+  inline constexpr auto counted = __counted::__fn{};
+} // namespace __cpo
+
+} // namespace ranges::views
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_COUNTED_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/dangling.h b/app/src/main/cpp/libcxx/include/__ranges/dangling.h
new file mode 100644
index 0000000..c104534
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/dangling.h
@@ -0,0 +1,42 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_DANGLING_H
+#define _LIBCPP___RANGES_DANGLING_H
+
+#include <__config>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__type_traits/conditional.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+struct dangling {
+  dangling() = default;
+  _LIBCPP_HIDE_FROM_ABI constexpr dangling(auto&&...) noexcept {}
+};
+
+template <range _Rp>
+using borrowed_iterator_t = _If<borrowed_range<_Rp>, iterator_t<_Rp>, dangling>;
+
+// borrowed_subrange_t defined in <__ranges/subrange.h>
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_DANGLING_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/data.h b/app/src/main/cpp/libcxx/include/__ranges/data.h
new file mode 100644
index 0000000..0ac25b5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/data.h
@@ -0,0 +1,112 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_DATA_H
+#define _LIBCPP___RANGES_DATA_H
+
+#include <__concepts/class_or_enum.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/pointer_traits.h>
+#include <__ranges/access.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_object.h>
+#include <__type_traits/is_pointer.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/remove_pointer.h>
+#include <__type_traits/remove_reference.h>
+#include <__utility/auto_cast.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [range.prim.data]
+
+namespace ranges {
+namespace __data {
+  template <class _Tp>
+  concept __ptr_to_object = is_pointer_v<_Tp> && is_object_v<remove_pointer_t<_Tp>>;
+
+  template <class _Tp>
+  concept __member_data =
+    __can_borrow<_Tp> &&
+    __workaround_52970<_Tp> &&
+    requires(_Tp&& __t) {
+      { _LIBCPP_AUTO_CAST(__t.data()) } -> __ptr_to_object;
+    };
+
+  template <class _Tp>
+  concept __ranges_begin_invocable =
+    !__member_data<_Tp> &&
+    __can_borrow<_Tp> &&
+    requires(_Tp&& __t) {
+      { ranges::begin(__t) } -> contiguous_iterator;
+    };
+
+  struct __fn {
+    template <__member_data _Tp>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Tp&& __t) const
+        noexcept(noexcept(__t.data())) {
+      return __t.data();
+    }
+
+    template<__ranges_begin_invocable _Tp>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Tp&& __t) const
+        noexcept(noexcept(std::to_address(ranges::begin(__t)))) {
+      return std::to_address(ranges::begin(__t));
+    }
+  };
+} // namespace __data
+
+inline namespace __cpo {
+  inline constexpr auto data = __data::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+// [range.prim.cdata]
+
+namespace ranges {
+namespace __cdata {
+  struct __fn {
+    template <class _Tp>
+      requires is_lvalue_reference_v<_Tp&&>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(ranges::data(static_cast<const remove_reference_t<_Tp>&>(__t))))
+      -> decltype(      ranges::data(static_cast<const remove_reference_t<_Tp>&>(__t)))
+      { return          ranges::data(static_cast<const remove_reference_t<_Tp>&>(__t)); }
+
+    template <class _Tp>
+      requires is_rvalue_reference_v<_Tp&&>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Tp&& __t) const
+      noexcept(noexcept(ranges::data(static_cast<const _Tp&&>(__t))))
+      -> decltype(      ranges::data(static_cast<const _Tp&&>(__t)))
+      { return          ranges::data(static_cast<const _Tp&&>(__t)); }
+  };
+} // namespace __cdata
+
+inline namespace __cpo {
+  inline constexpr auto cdata = __cdata::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_DATA_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/drop_view.h b/app/src/main/cpp/libcxx/include/__ranges/drop_view.h
new file mode 100644
index 0000000..8f3564a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/drop_view.h
@@ -0,0 +1,308 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_DROP_VIEW_H
+#define _LIBCPP___RANGES_DROP_VIEW_H
+
+#include <__algorithm/min.h>
+#include <__assert>
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__functional/bind_back.h>
+#include <__fwd/span.h>
+#include <__fwd/string_view.h>
+#include <__iterator/concepts.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/empty_view.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/iota_view.h>
+#include <__ranges/non_propagating_cache.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/size.h>
+#include <__ranges/subrange.h>
+#include <__ranges/view_interface.h>
+#include <__utility/auto_cast.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+  template<view _View>
+  class drop_view
+    : public view_interface<drop_view<_View>>
+  {
+    // We cache begin() whenever ranges::next is not guaranteed O(1) to provide an
+    // amortized O(1) begin() method. If this is an input_range, then we cannot cache
+    // begin because begin is not equality preserving.
+    // Note: drop_view<input-range>::begin() is still trivially amortized O(1) because
+    // one can't call begin() on it more than once.
+    static constexpr bool _UseCache = forward_range<_View> && !(random_access_range<_View> && sized_range<_View>);
+    using _Cache = _If<_UseCache, __non_propagating_cache<iterator_t<_View>>, __empty_cache>;
+    _LIBCPP_NO_UNIQUE_ADDRESS _Cache __cached_begin_ = _Cache();
+    range_difference_t<_View> __count_ = 0;
+    _View __base_ = _View();
+
+public:
+    drop_view() requires default_initializable<_View> = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr drop_view(_View __base, range_difference_t<_View> __count)
+      : __count_(__count)
+      , __base_(std::move(__base))
+    {
+      _LIBCPP_ASSERT(__count_ >= 0, "count must be greater than or equal to zero.");
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr _View base() const& requires copy_constructible<_View> { return __base_; }
+    _LIBCPP_HIDE_FROM_ABI constexpr _View base() && { return std::move(__base_); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto begin()
+      requires (!(__simple_view<_View> &&
+                  random_access_range<const _View> && sized_range<const _View>))
+    {
+      if constexpr (_UseCache)
+        if (__cached_begin_.__has_value())
+          return *__cached_begin_;
+
+      auto __tmp = ranges::next(ranges::begin(__base_), __count_, ranges::end(__base_));
+      if constexpr (_UseCache)
+        __cached_begin_.__emplace(__tmp);
+      return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto begin() const
+      requires random_access_range<const _View> && sized_range<const _View>
+    {
+      return ranges::next(ranges::begin(__base_), __count_, ranges::end(__base_));
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto end()
+      requires (!__simple_view<_View>)
+    { return ranges::end(__base_); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto end() const
+      requires range<const _View>
+    { return ranges::end(__base_); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    static constexpr auto __size(auto& __self) {
+      const auto __s = ranges::size(__self.__base_);
+      const auto __c = static_cast<decltype(__s)>(__self.__count_);
+      return __s < __c ? 0 : __s - __c;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto size()
+      requires sized_range<_View>
+    { return __size(*this); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto size() const
+      requires sized_range<const _View>
+    { return __size(*this); }
+  };
+
+template<class _Range>
+drop_view(_Range&&, range_difference_t<_Range>) -> drop_view<views::all_t<_Range>>;
+
+template<class _Tp>
+inline constexpr bool enable_borrowed_range<drop_view<_Tp>> = enable_borrowed_range<_Tp>;
+
+namespace views {
+namespace __drop {
+
+template <class _Tp>
+inline constexpr bool __is_empty_view = false;
+
+template <class _Tp>
+inline constexpr bool __is_empty_view<empty_view<_Tp>> = true;
+
+template <class _Tp>
+inline constexpr bool __is_passthrough_specialization = false;
+
+template <class _Tp, size_t _Extent>
+inline constexpr bool __is_passthrough_specialization<span<_Tp, _Extent>> = true;
+
+template <class _CharT, class _Traits>
+inline constexpr bool __is_passthrough_specialization<basic_string_view<_CharT, _Traits>> = true;
+
+template <class _Np, class _Bound>
+inline constexpr bool __is_passthrough_specialization<iota_view<_Np, _Bound>> = true;
+
+template <class _Iter, class _Sent, subrange_kind _Kind>
+inline constexpr bool __is_passthrough_specialization<subrange<_Iter, _Sent, _Kind>> =
+    !subrange<_Iter, _Sent, _Kind>::_StoreSize;
+
+template <class _Tp>
+inline constexpr bool __is_subrange_specialization_with_store_size = false;
+
+template <class _Iter, class _Sent, subrange_kind _Kind>
+inline constexpr bool __is_subrange_specialization_with_store_size<subrange<_Iter, _Sent, _Kind>> =
+    subrange<_Iter, _Sent, _Kind>::_StoreSize;
+
+template <class _Tp>
+struct __passthrough_type;
+
+template <class _Tp, size_t _Extent>
+struct __passthrough_type<span<_Tp, _Extent>> {
+  using type = span<_Tp>;
+};
+
+template <class _CharT, class _Traits>
+struct __passthrough_type<basic_string_view<_CharT, _Traits>> {
+  using type = basic_string_view<_CharT, _Traits>;
+};
+
+template <class _Np, class _Bound>
+struct __passthrough_type<iota_view<_Np, _Bound>> {
+  using type = iota_view<_Np, _Bound>;
+};
+
+template <class _Iter, class _Sent, subrange_kind _Kind>
+struct __passthrough_type<subrange<_Iter, _Sent, _Kind>> {
+  using type = subrange<_Iter, _Sent, _Kind>;
+};
+
+template <class _Tp>
+using __passthrough_type_t = typename __passthrough_type<_Tp>::type;
+
+struct __fn {
+  // [range.drop.overview]: the `empty_view` case.
+  template <class _Range, convertible_to<range_difference_t<_Range>> _Np>
+    requires __is_empty_view<remove_cvref_t<_Range>>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Range&& __range, _Np&&) const
+    noexcept(noexcept(_LIBCPP_AUTO_CAST(std::forward<_Range>(__range))))
+    -> decltype(      _LIBCPP_AUTO_CAST(std::forward<_Range>(__range)))
+    { return          _LIBCPP_AUTO_CAST(std::forward<_Range>(__range)); }
+
+  // [range.drop.overview]: the `span | basic_string_view | iota_view | subrange (StoreSize == false)` case.
+  template <class _Range,
+            convertible_to<range_difference_t<_Range>> _Np,
+            class _RawRange = remove_cvref_t<_Range>,
+            class _Dist = range_difference_t<_Range>>
+    requires (!__is_empty_view<_RawRange> &&
+              random_access_range<_RawRange> &&
+              sized_range<_RawRange> &&
+              __is_passthrough_specialization<_RawRange>)
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Range&& __rng, _Np&& __n) const
+    noexcept(noexcept(__passthrough_type_t<_RawRange>(
+                              ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
+                              ranges::end(__rng)
+                              )))
+    -> decltype(      __passthrough_type_t<_RawRange>(
+                              // Note: deliberately not forwarding `__rng` to guard against double moves.
+                              ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
+                              ranges::end(__rng)
+                              ))
+    { return          __passthrough_type_t<_RawRange>(
+                              ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
+                              ranges::end(__rng)
+                              ); }
+
+  // [range.drop.overview]: the `subrange (StoreSize == true)` case.
+  template <class _Range,
+            convertible_to<range_difference_t<_Range>> _Np,
+            class _RawRange = remove_cvref_t<_Range>,
+            class _Dist = range_difference_t<_Range>>
+    requires (!__is_empty_view<_RawRange> &&
+              random_access_range<_RawRange> &&
+              sized_range<_RawRange> &&
+              __is_subrange_specialization_with_store_size<_RawRange>)
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Range&& __rng, _Np&& __n) const
+    noexcept(noexcept(_RawRange(
+                              ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
+                              ranges::end(__rng),
+                              std::__to_unsigned_like(ranges::distance(__rng) -
+                                  std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)))
+                              )))
+    -> decltype(      _RawRange(
+                              // Note: deliberately not forwarding `__rng` to guard against double moves.
+                              ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
+                              ranges::end(__rng),
+                              std::__to_unsigned_like(ranges::distance(__rng) -
+                                  std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)))
+                              ))
+    {
+      // Introducing local variables avoids calculating `min` and `distance` twice (at the cost of diverging from the
+      // expression used in the `noexcept` clause and the return statement).
+      auto dist = ranges::distance(__rng);
+      auto clamped = std::min<_Dist>(dist, std::forward<_Np>(__n));
+      return          _RawRange(
+                              ranges::begin(__rng) + clamped,
+                              ranges::end(__rng),
+                              std::__to_unsigned_like(dist - clamped)
+                              );}
+
+  // [range.drop.overview]: the "otherwise" case.
+  template <class _Range, convertible_to<range_difference_t<_Range>> _Np,
+            class _RawRange = remove_cvref_t<_Range>>
+    // Note: without specifically excluding the other cases, GCC sees this overload as ambiguous with the other
+    // overloads.
+    requires (!(__is_empty_view<_RawRange> ||
+               (__is_subrange_specialization_with_store_size<_RawRange> &&
+               sized_range<_RawRange> &&
+                random_access_range<_RawRange>) ||
+               (__is_passthrough_specialization<_RawRange> &&
+                sized_range<_RawRange> &&
+                random_access_range<_RawRange>)
+             ))
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Range&& __range, _Np&& __n) const
+    noexcept(noexcept(drop_view(std::forward<_Range>(__range), std::forward<_Np>(__n))))
+    -> decltype(      drop_view(std::forward<_Range>(__range), std::forward<_Np>(__n)))
+    { return          drop_view(std::forward<_Range>(__range), std::forward<_Np>(__n)); }
+
+  template <class _Np>
+    requires constructible_from<decay_t<_Np>, _Np>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Np&& __n) const
+    noexcept(is_nothrow_constructible_v<decay_t<_Np>, _Np>)
+  { return __range_adaptor_closure_t(std::__bind_back(*this, std::forward<_Np>(__n))); }
+};
+
+} // namespace __drop
+
+inline namespace __cpo {
+  inline constexpr auto drop = __drop::__fn{};
+} // namespace __cpo
+} // namespace views
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANGES_DROP_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/drop_while_view.h b/app/src/main/cpp/libcxx/include/__ranges/drop_while_view.h
new file mode 100644
index 0000000..7c28992
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/drop_while_view.h
@@ -0,0 +1,129 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_DROP_WHILE_VIEW_H
+#define _LIBCPP___RANGES_DROP_WHILE_VIEW_H
+
+#include <__algorithm/ranges_find_if_not.h>
+#include <__assert>
+#include <__concepts/constructible.h>
+#include <__config>
+#include <__functional/bind_back.h>
+#include <__functional/reference_wrapper.h>
+#include <__iterator/concepts.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/copyable_box.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/non_propagating_cache.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/view_interface.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_nothrow_constructible.h>
+#include <__type_traits/is_object.h>
+#include <__utility/forward.h>
+#include <__utility/in_place.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER >= 20
+
+namespace ranges {
+
+template <view _View, class _Pred>
+  requires input_range<_View> && is_object_v<_Pred> && indirect_unary_predicate<const _Pred, iterator_t<_View>>
+class drop_while_view : public view_interface<drop_while_view<_View, _Pred>> {
+public:
+  _LIBCPP_HIDE_FROM_ABI drop_while_view()
+    requires default_initializable<_View> && default_initializable<_Pred>
+  = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr drop_while_view(_View __base, _Pred __pred)
+      : __base_(std::move(__base)), __pred_(std::in_place, std::move(__pred)) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _View base() const&
+    requires copy_constructible<_View>
+  {
+    return __base_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _View base() && { return std::move(__base_); }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Pred& pred() const { return *__pred_; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto begin() {
+    _LIBCPP_ASSERT(__pred_.__has_value(),
+                   "drop_while_view needs to have a non-empty predicate before calling begin() -- did a previous "
+                   "assignment to this drop_while_view fail?");
+    if constexpr (_UseCache) {
+      if (!__cached_begin_.__has_value()) {
+        __cached_begin_.__emplace(ranges::find_if_not(__base_, std::cref(*__pred_)));
+      }
+      return *__cached_begin_;
+    } else {
+      return ranges::find_if_not(__base_, std::cref(*__pred_));
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto end() { return ranges::end(__base_); }
+
+private:
+  _LIBCPP_NO_UNIQUE_ADDRESS _View __base_ = _View();
+  _LIBCPP_NO_UNIQUE_ADDRESS __copyable_box<_Pred> __pred_;
+
+  static constexpr bool _UseCache = forward_range<_View>;
+  using _Cache                    = _If<_UseCache, __non_propagating_cache<iterator_t<_View>>, __empty_cache>;
+  _LIBCPP_NO_UNIQUE_ADDRESS _Cache __cached_begin_ = _Cache();
+};
+
+template <class _View, class _Pred>
+inline constexpr bool enable_borrowed_range<drop_while_view<_View, _Pred>> = enable_borrowed_range<_View>;
+
+template <class _Range, class _Pred>
+drop_while_view(_Range&&, _Pred) -> drop_while_view<views::all_t<_Range>, _Pred>;
+
+namespace views {
+namespace __drop_while {
+
+struct __fn {
+  template <class _Range, class _Pred>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Range&& __range, _Pred&& __pred) const
+      noexcept(noexcept(/**/ drop_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred))))
+          -> decltype(/*--*/ drop_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred))) {
+    return /*-------------*/ drop_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred));
+  }
+
+  template <class _Pred>
+    requires constructible_from<decay_t<_Pred>, _Pred>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Pred&& __pred) const
+      noexcept(is_nothrow_constructible_v<decay_t<_Pred>, _Pred>) {
+    return __range_adaptor_closure_t(std::__bind_back(*this, std::forward<_Pred>(__pred)));
+  }
+};
+
+} // namespace __drop_while
+
+inline namespace __cpo {
+inline constexpr auto drop_while = __drop_while::__fn{};
+} // namespace __cpo
+} // namespace views
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_DROP_WHILE_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/elements_view.h b/app/src/main/cpp/libcxx/include/__ranges/elements_view.h
new file mode 100644
index 0000000..3afd6dd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/elements_view.h
@@ -0,0 +1,423 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_ELEMENTS_VIEW_H
+#define _LIBCPP___RANGES_ELEMENTS_VIEW_H
+
+#include <__compare/three_way_comparable.h>
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/derived_from.h>
+#include <__concepts/equality_comparable.h>
+#include <__config>
+#include <__fwd/get.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/size.h>
+#include <__ranges/view_interface.h>
+#include <__tuple_dir/tuple_element.h>
+#include <__tuple_dir/tuple_like.h>
+#include <__tuple_dir/tuple_size.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/maybe_const.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/remove_cvref.h>
+#include <__type_traits/remove_reference.h>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER >= 20
+
+namespace ranges {
+
+template <class _View, size_t _Np, bool _Const>
+class __elements_view_iterator;
+
+template <class _View, size_t _Np, bool _Const>
+class __elements_view_sentinel;
+
+template <class _Tp, size_t _Np>
+concept __has_tuple_element = __tuple_like<_Tp> && _Np < tuple_size<_Tp>::value;
+
+template <class _Tp, size_t _Np>
+concept __returnable_element = is_reference_v<_Tp> || move_constructible<tuple_element_t<_Np, _Tp>>;
+
+template <input_range _View, size_t _Np>
+  requires view<_View> && __has_tuple_element<range_value_t<_View>, _Np> &&
+           __has_tuple_element<remove_reference_t<range_reference_t<_View>>, _Np> &&
+           __returnable_element<range_reference_t<_View>, _Np>
+class elements_view : public view_interface<elements_view<_View, _Np>> {
+public:
+  _LIBCPP_HIDE_FROM_ABI elements_view()
+    requires default_initializable<_View>
+  = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit elements_view(_View __base) : __base_(std::move(__base)) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _View base() const&
+    requires copy_constructible<_View>
+  {
+    return __base_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _View base() && { return std::move(__base_); }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto begin()
+    requires(!__simple_view<_View>)
+  {
+    return __iterator</*_Const=*/false>(ranges::begin(__base_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto begin() const
+    requires range<const _View>
+  {
+    return __iterator</*_Const=*/true>(ranges::begin(__base_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto end()
+    requires(!__simple_view<_View> && !common_range<_View>)
+  {
+    return __sentinel</*_Const=*/false>{ranges::end(__base_)};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto end()
+    requires(!__simple_view<_View> && common_range<_View>)
+  {
+    return __iterator</*_Const=*/false>{ranges::end(__base_)};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto end() const
+    requires range<const _View>
+  {
+    return __sentinel</*_Const=*/true>{ranges::end(__base_)};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto end() const
+    requires common_range<const _View>
+  {
+    return __iterator</*_Const=*/true>{ranges::end(__base_)};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto size()
+    requires sized_range<_View>
+  {
+    return ranges::size(__base_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto size() const
+    requires sized_range<const _View>
+  {
+    return ranges::size(__base_);
+  }
+
+private:
+  template <bool _Const>
+  using __iterator = __elements_view_iterator<_View, _Np, _Const>;
+
+  template <bool _Const>
+  using __sentinel = __elements_view_sentinel<_View, _Np, _Const>;
+
+  _LIBCPP_NO_UNIQUE_ADDRESS _View __base_ = _View();
+};
+
+template <class, size_t>
+struct __elements_view_iterator_category_base {};
+
+template <forward_range _Base, size_t _Np>
+struct __elements_view_iterator_category_base<_Base, _Np> {
+  static consteval auto __get_iterator_category() {
+    using _Result = decltype(std::get<_Np>(*std::declval<iterator_t<_Base>>()));
+    using _Cat    = typename iterator_traits<iterator_t<_Base>>::iterator_category;
+
+    if constexpr (!is_lvalue_reference_v<_Result>) {
+      return input_iterator_tag{};
+    } else if constexpr (derived_from<_Cat, random_access_iterator_tag>) {
+      return random_access_iterator_tag{};
+    } else {
+      return _Cat{};
+    }
+  }
+
+  using iterator_category = decltype(__get_iterator_category());
+};
+
+template <class _View, size_t _Np, bool _Const>
+class __elements_view_iterator : public __elements_view_iterator_category_base<__maybe_const<_Const, _View>, _Np> {
+  template <class, size_t, bool >
+  friend class __elements_view_iterator;
+
+  template <class, size_t, bool >
+  friend class __elements_view_sentinel;
+
+  using _Base = __maybe_const<_Const, _View>;
+
+  iterator_t<_Base> __current_ = iterator_t<_Base>();
+
+  _LIBCPP_HIDE_FROM_ABI static constexpr decltype(auto) __get_element(const iterator_t<_Base>& __i) {
+    if constexpr (is_reference_v<range_reference_t<_Base>>) {
+      return std::get<_Np>(*__i);
+    } else {
+      using _Element = remove_cv_t<tuple_element_t<_Np, range_reference_t<_Base>>>;
+      return static_cast<_Element>(std::get<_Np>(*__i));
+    }
+  }
+
+  static consteval auto __get_iterator_concept() {
+    if constexpr (random_access_range<_Base>) {
+      return random_access_iterator_tag{};
+    } else if constexpr (bidirectional_range<_Base>) {
+      return bidirectional_iterator_tag{};
+    } else if constexpr (forward_range<_Base>) {
+      return forward_iterator_tag{};
+    } else {
+      return input_iterator_tag{};
+    }
+  }
+
+public:
+  using iterator_concept = decltype(__get_iterator_concept());
+  using value_type       = remove_cvref_t<tuple_element_t<_Np, range_value_t<_Base>>>;
+  using difference_type  = range_difference_t<_Base>;
+
+  _LIBCPP_HIDE_FROM_ABI __elements_view_iterator()
+    requires default_initializable<iterator_t<_Base>>
+  = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit __elements_view_iterator(iterator_t<_Base> __current)
+      : __current_(std::move(__current)) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __elements_view_iterator(__elements_view_iterator<_View, _Np, !_Const> __i)
+    requires _Const && convertible_to<iterator_t<_View>, iterator_t<_Base>>
+      : __current_(std::move(__i.__current_)) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const iterator_t<_Base>& base() const& noexcept { return __current_; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_Base> base() && { return std::move(__current_); }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr decltype(auto) operator*() const { return __get_element(__current_); }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __elements_view_iterator& operator++() {
+    ++__current_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr void operator++(int) { ++__current_; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __elements_view_iterator operator++(int)
+    requires forward_range<_Base>
+  {
+    auto temp = *this;
+    ++__current_;
+    return temp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __elements_view_iterator& operator--()
+    requires bidirectional_range<_Base>
+  {
+    --__current_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __elements_view_iterator operator--(int)
+    requires bidirectional_range<_Base>
+  {
+    auto temp = *this;
+    --__current_;
+    return temp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __elements_view_iterator& operator+=(difference_type __n)
+    requires random_access_range<_Base>
+  {
+    __current_ += __n;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __elements_view_iterator& operator-=(difference_type __n)
+    requires random_access_range<_Base>
+  {
+    __current_ -= __n;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr decltype(auto) operator[](difference_type __n) const
+    requires random_access_range<_Base>
+  {
+    return __get_element(__current_ + __n);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator==(const __elements_view_iterator& __x, const __elements_view_iterator& __y)
+    requires equality_comparable<iterator_t<_Base>>
+  {
+    return __x.__current_ == __y.__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator<(const __elements_view_iterator& __x, const __elements_view_iterator& __y)
+    requires random_access_range<_Base>
+  {
+    return __x.__current_ < __y.__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator>(const __elements_view_iterator& __x, const __elements_view_iterator& __y)
+    requires random_access_range<_Base>
+  {
+    return __y < __x;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator<=(const __elements_view_iterator& __x, const __elements_view_iterator& __y)
+    requires random_access_range<_Base>
+  {
+    return !(__y < __x);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator>=(const __elements_view_iterator& __x, const __elements_view_iterator& __y)
+    requires random_access_range<_Base>
+  {
+    return !(__x < __y);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr auto
+  operator<=>(const __elements_view_iterator& __x, const __elements_view_iterator& __y)
+    requires random_access_range<_Base> && three_way_comparable<iterator_t<_Base>>
+  {
+    return __x.__current_ <=> __y.__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr __elements_view_iterator
+  operator+(const __elements_view_iterator& __x, difference_type __y)
+    requires random_access_range<_Base>
+  {
+    return __elements_view_iterator{__x} += __y;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr __elements_view_iterator
+  operator+(difference_type __x, const __elements_view_iterator& __y)
+    requires random_access_range<_Base>
+  {
+    return __y + __x;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr __elements_view_iterator
+  operator-(const __elements_view_iterator& __x, difference_type __y)
+    requires random_access_range<_Base>
+  {
+    return __elements_view_iterator{__x} -= __y;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr difference_type
+  operator-(const __elements_view_iterator& __x, const __elements_view_iterator& __y)
+    requires sized_sentinel_for<iterator_t<_Base>, iterator_t<_Base>>
+  {
+    return __x.__current_ - __y.__current_;
+  }
+};
+
+template <class _View, size_t _Np, bool _Const>
+class __elements_view_sentinel {
+private:
+  using _Base                                        = __maybe_const<_Const, _View>;
+  _LIBCPP_NO_UNIQUE_ADDRESS sentinel_t<_Base> __end_ = sentinel_t<_Base>();
+
+  template <class, size_t, bool >
+  friend class __elements_view_sentinel;
+
+  template <bool _AnyConst>
+  _LIBCPP_HIDE_FROM_ABI static constexpr decltype(auto)
+  __get_current(const __elements_view_iterator<_View, _Np, _AnyConst>& __iter) {
+    return (__iter.__current_);
+  }
+
+public:
+  _LIBCPP_HIDE_FROM_ABI __elements_view_sentinel() = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit __elements_view_sentinel(sentinel_t<_Base> __end)
+      : __end_(std::move(__end)) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __elements_view_sentinel(__elements_view_sentinel<_View, _Np, !_Const> __other)
+    requires _Const && convertible_to<sentinel_t<_View>, sentinel_t<_Base>>
+      : __end_(std::move(__other.__end_)) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr sentinel_t<_Base> base() const { return __end_; }
+
+  template <bool _OtherConst>
+    requires sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator==(const __elements_view_iterator<_View, _Np, _OtherConst>& __x, const __elements_view_sentinel& __y) {
+    return __get_current(__x) == __y.__end_;
+  }
+
+  template <bool _OtherConst>
+    requires sized_sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
+  _LIBCPP_HIDE_FROM_ABI friend constexpr range_difference_t<__maybe_const<_OtherConst, _View>>
+  operator-(const __elements_view_iterator<_View, _Np, _OtherConst>& __x, const __elements_view_sentinel& __y) {
+    return __get_current(__x) - __y.__end_;
+  }
+
+  template <bool _OtherConst>
+    requires sized_sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
+  _LIBCPP_HIDE_FROM_ABI friend constexpr range_difference_t<__maybe_const<_OtherConst, _View>>
+  operator-(const __elements_view_sentinel& __x, const __elements_view_iterator<_View, _Np, _OtherConst>& __y) {
+    return __x.__end_ - __get_current(__y);
+  }
+};
+
+template <class _Tp, size_t _Np>
+inline constexpr bool enable_borrowed_range<elements_view<_Tp, _Np>> = enable_borrowed_range<_Tp>;
+
+template <class _Tp>
+using keys_view = elements_view<_Tp, 0>;
+template <class _Tp>
+using values_view = elements_view<_Tp, 1>;
+
+namespace views {
+namespace __elements {
+
+template <size_t _Np>
+struct __fn : __range_adaptor_closure<__fn<_Np>> {
+  template <class _Range>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Range&& __range) const
+      /**/ noexcept(noexcept(elements_view<all_t<_Range&&>, _Np>(std::forward<_Range>(__range))))
+      /*------*/ -> decltype(elements_view<all_t<_Range&&>, _Np>(std::forward<_Range>(__range))) {
+    /*-------------*/ return elements_view<all_t<_Range&&>, _Np>(std::forward<_Range>(__range));
+  }
+};
+} // namespace __elements
+
+inline namespace __cpo {
+template <size_t _Np>
+inline constexpr auto elements = __elements::__fn<_Np>{};
+inline constexpr auto keys     = elements<0>;
+inline constexpr auto values   = elements<1>;
+} // namespace __cpo
+} // namespace views
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_ELEMENTS_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/empty.h b/app/src/main/cpp/libcxx/include/__ranges/empty.h
new file mode 100644
index 0000000..8a1c75c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/empty.h
@@ -0,0 +1,82 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_EMPTY_H
+#define _LIBCPP___RANGES_EMPTY_H
+
+#include <__concepts/class_or_enum.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__ranges/access.h>
+#include <__ranges/size.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [range.prim.empty]
+
+namespace ranges {
+namespace __empty {
+  template <class _Tp>
+  concept __member_empty =
+    __workaround_52970<_Tp> &&
+    requires(_Tp&& __t) {
+      bool(__t.empty());
+    };
+
+  template<class _Tp>
+  concept __can_invoke_size =
+    !__member_empty<_Tp> &&
+    requires(_Tp&& __t) { ranges::size(__t); };
+
+  template <class _Tp>
+  concept __can_compare_begin_end =
+    !__member_empty<_Tp> &&
+    !__can_invoke_size<_Tp> &&
+    requires(_Tp&& __t) {
+      bool(ranges::begin(__t) == ranges::end(__t));
+      { ranges::begin(__t) } -> forward_iterator;
+    };
+
+  struct __fn {
+    template <__member_empty _Tp>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t) const
+        noexcept(noexcept(bool(__t.empty()))) {
+      return bool(__t.empty());
+    }
+
+    template <__can_invoke_size _Tp>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t) const
+        noexcept(noexcept(ranges::size(__t))) {
+      return ranges::size(__t) == 0;
+    }
+
+    template<__can_compare_begin_end _Tp>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t) const
+        noexcept(noexcept(bool(ranges::begin(__t) == ranges::end(__t)))) {
+      return ranges::begin(__t) == ranges::end(__t);
+    }
+  };
+} // namespace __empty
+
+inline namespace __cpo {
+  inline constexpr auto empty = __empty::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_EMPTY_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/empty_view.h b/app/src/main/cpp/libcxx/include/__ranges/empty_view.h
new file mode 100644
index 0000000..58e69ac
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/empty_view.h
@@ -0,0 +1,53 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_EMPTY_VIEW_H
+#define _LIBCPP___RANGES_EMPTY_VIEW_H
+
+#include <__config>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/view_interface.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+  template<class _Tp>
+    requires is_object_v<_Tp>
+  class empty_view : public view_interface<empty_view<_Tp>> {
+  public:
+    _LIBCPP_HIDE_FROM_ABI static constexpr _Tp* begin() noexcept { return nullptr; }
+    _LIBCPP_HIDE_FROM_ABI static constexpr _Tp* end() noexcept { return nullptr; }
+    _LIBCPP_HIDE_FROM_ABI static constexpr _Tp* data() noexcept { return nullptr; }
+    _LIBCPP_HIDE_FROM_ABI static constexpr size_t size() noexcept { return 0; }
+    _LIBCPP_HIDE_FROM_ABI static constexpr bool empty() noexcept { return true; }
+  };
+
+  template<class _Tp>
+  inline constexpr bool enable_borrowed_range<empty_view<_Tp>> = true;
+
+  namespace views {
+
+  template <class _Tp>
+  inline constexpr empty_view<_Tp> empty{};
+
+  } // namespace views
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_EMPTY_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/enable_borrowed_range.h b/app/src/main/cpp/libcxx/include/__ranges/enable_borrowed_range.h
new file mode 100644
index 0000000..833d266
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/enable_borrowed_range.h
@@ -0,0 +1,40 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_ENABLE_BORROWED_RANGE_H
+#define _LIBCPP___RANGES_ENABLE_BORROWED_RANGE_H
+
+// These customization variables are used in <span> and <string_view>. The
+// separate header is used to avoid including the entire <ranges> header in
+// <span> and <string_view>.
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+// [range.range], ranges
+
+template <class>
+inline constexpr bool enable_borrowed_range = false;
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_ENABLE_BORROWED_RANGE_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/enable_view.h b/app/src/main/cpp/libcxx/include/__ranges/enable_view.h
new file mode 100644
index 0000000..c85064b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/enable_view.h
@@ -0,0 +1,50 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_ENABLE_VIEW_H
+#define _LIBCPP___RANGES_ENABLE_VIEW_H
+
+#include <__concepts/derived_from.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__type_traits/is_class.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/remove_cv.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+struct view_base { };
+
+template<class _Derived>
+  requires is_class_v<_Derived> && same_as<_Derived, remove_cv_t<_Derived>>
+class view_interface;
+
+template<class _Op, class _Yp>
+  requires is_convertible_v<_Op*, view_interface<_Yp>*>
+void __is_derived_from_view_interface(const _Op*, const view_interface<_Yp>*);
+
+template <class _Tp>
+inline constexpr bool enable_view = derived_from<_Tp, view_base> ||
+  requires { ranges::__is_derived_from_view_interface((_Tp*)nullptr, (_Tp*)nullptr); };
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_ENABLE_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/filter_view.h b/app/src/main/cpp/libcxx/include/__ranges/filter_view.h
new file mode 100644
index 0000000..f8633a3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/filter_view.h
@@ -0,0 +1,280 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_FILTER_VIEW_H
+#define _LIBCPP___RANGES_FILTER_VIEW_H
+
+#include <__algorithm/ranges_find_if.h>
+#include <__concepts/constructible.h>
+#include <__concepts/copyable.h>
+#include <__concepts/derived_from.h>
+#include <__concepts/equality_comparable.h>
+#include <__config>
+#include <__debug>
+#include <__functional/bind_back.h>
+#include <__functional/invoke.h>
+#include <__functional/reference_wrapper.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iter_swap.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/copyable_box.h>
+#include <__ranges/non_propagating_cache.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/view_interface.h>
+#include <__utility/forward.h>
+#include <__utility/in_place.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+  template <input_range _View, indirect_unary_predicate<iterator_t<_View>> _Pred>
+    requires view<_View> && is_object_v<_Pred>
+  class __filter_view_iterator;
+
+  template <input_range _View, indirect_unary_predicate<iterator_t<_View>> _Pred>
+    requires view<_View> && is_object_v<_Pred>
+  class __filter_view_sentinel;
+
+  template<input_range _View, indirect_unary_predicate<iterator_t<_View>> _Pred>
+    requires view<_View> && is_object_v<_Pred>
+  class filter_view : public view_interface<filter_view<_View, _Pred>> {
+    _LIBCPP_NO_UNIQUE_ADDRESS _View __base_ = _View();
+    _LIBCPP_NO_UNIQUE_ADDRESS __copyable_box<_Pred> __pred_;
+
+    // We cache the result of begin() to allow providing an amortized O(1) begin() whenever
+    // the underlying range is at least a forward_range.
+    static constexpr bool _UseCache = forward_range<_View>;
+    using _Cache = _If<_UseCache, __non_propagating_cache<iterator_t<_View>>, __empty_cache>;
+    _LIBCPP_NO_UNIQUE_ADDRESS _Cache __cached_begin_ = _Cache();
+
+    using __iterator = __filter_view_iterator<_View, _Pred>;
+    using __sentinel = __filter_view_sentinel<_View, _Pred>;
+
+    friend __iterator;
+    friend __sentinel;
+
+  public:
+    _LIBCPP_HIDE_FROM_ABI
+    filter_view() requires default_initializable<_View> && default_initializable<_Pred> = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr filter_view(_View __base, _Pred __pred)
+      : __base_(std::move(__base)), __pred_(in_place, std::move(__pred))
+    { }
+
+    template<class _Vp = _View>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _View base() const& requires copy_constructible<_Vp> { return __base_; }
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _View base() && { return std::move(__base_); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Pred const& pred() const { return *__pred_; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __iterator begin() {
+      _LIBCPP_ASSERT(__pred_.__has_value(), "Trying to call begin() on a filter_view that does not have a valid predicate.");
+      if constexpr (_UseCache) {
+        if (!__cached_begin_.__has_value()) {
+          __cached_begin_.__emplace(ranges::find_if(__base_, std::ref(*__pred_)));
+        }
+        return {*this, *__cached_begin_};
+      } else {
+        return {*this, ranges::find_if(__base_, std::ref(*__pred_))};
+      }
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto end() {
+      if constexpr (common_range<_View>)
+        return __iterator{*this, ranges::end(__base_)};
+      else
+        return __sentinel{*this};
+    }
+  };
+
+  template<class _Range, class _Pred>
+  filter_view(_Range&&, _Pred) -> filter_view<views::all_t<_Range>, _Pred>;
+
+  template<class _View>
+  struct __filter_iterator_category { };
+
+  template<forward_range _View>
+  struct __filter_iterator_category<_View> {
+    using _Cat = typename iterator_traits<iterator_t<_View>>::iterator_category;
+    using iterator_category =
+      _If<derived_from<_Cat, bidirectional_iterator_tag>, bidirectional_iterator_tag,
+      _If<derived_from<_Cat, forward_iterator_tag>,       forward_iterator_tag,
+      /* else */                                          _Cat
+    >>;
+  };
+
+  template<input_range _View, indirect_unary_predicate<iterator_t<_View>> _Pred>
+    requires view<_View> && is_object_v<_Pred>
+  class __filter_view_iterator : public __filter_iterator_category<_View> {
+
+    using __filter_view = filter_view<_View, _Pred>;
+
+  public:
+    _LIBCPP_NO_UNIQUE_ADDRESS iterator_t<_View> __current_ = iterator_t<_View>();
+    _LIBCPP_NO_UNIQUE_ADDRESS __filter_view* __parent_ = nullptr;
+
+    using iterator_concept =
+      _If<bidirectional_range<_View>, bidirectional_iterator_tag,
+      _If<forward_range<_View>,       forward_iterator_tag,
+      /* else */                      input_iterator_tag
+    >>;
+    // using iterator_category = inherited;
+    using value_type = range_value_t<_View>;
+    using difference_type = range_difference_t<_View>;
+
+    _LIBCPP_HIDE_FROM_ABI
+    __filter_view_iterator() requires default_initializable<iterator_t<_View>> = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __filter_view_iterator(__filter_view& __parent, iterator_t<_View> __current)
+      : __current_(std::move(__current)), __parent_(std::addressof(__parent))
+    { }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr iterator_t<_View> const& base() const& noexcept { return __current_; }
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr iterator_t<_View> base() && { return std::move(__current_); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr range_reference_t<_View> operator*() const { return *__current_; }
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr iterator_t<_View> operator->() const
+      requires __has_arrow<iterator_t<_View>> && copyable<iterator_t<_View>>
+    {
+      return __current_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __filter_view_iterator& operator++() {
+      __current_ = ranges::find_if(std::move(++__current_), ranges::end(__parent_->__base_),
+                                   std::ref(*__parent_->__pred_));
+      return *this;
+    }
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void operator++(int) { ++*this; }
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __filter_view_iterator operator++(int) requires forward_range<_View> {
+      auto __tmp = *this;
+      ++*this;
+      return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __filter_view_iterator& operator--() requires bidirectional_range<_View> {
+      do {
+        --__current_;
+      } while (!std::invoke(*__parent_->__pred_, *__current_));
+      return *this;
+    }
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __filter_view_iterator operator--(int) requires bidirectional_range<_View> {
+      auto tmp = *this;
+      --*this;
+      return tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator==(__filter_view_iterator const& __x, __filter_view_iterator const& __y)
+      requires equality_comparable<iterator_t<_View>>
+    {
+      return __x.__current_ == __y.__current_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr range_rvalue_reference_t<_View> iter_move(__filter_view_iterator const& __it)
+      noexcept(noexcept(ranges::iter_move(__it.__current_)))
+    {
+      return ranges::iter_move(__it.__current_);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr void iter_swap(__filter_view_iterator const& __x, __filter_view_iterator const& __y)
+      noexcept(noexcept(ranges::iter_swap(__x.__current_, __y.__current_)))
+      requires indirectly_swappable<iterator_t<_View>>
+    {
+      return ranges::iter_swap(__x.__current_, __y.__current_);
+    }
+  };
+
+  template<input_range _View, indirect_unary_predicate<iterator_t<_View>> _Pred>
+    requires view<_View> && is_object_v<_Pred>
+  class __filter_view_sentinel {
+    using __filter_view = filter_view<_View, _Pred>;
+
+  public:
+    sentinel_t<_View> __end_ = sentinel_t<_View>();
+
+    _LIBCPP_HIDE_FROM_ABI
+    __filter_view_sentinel() = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit __filter_view_sentinel(__filter_view& __parent)
+      : __end_(ranges::end(__parent.__base_))
+    { }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr sentinel_t<_View> base() const { return __end_; }
+
+    _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+    operator==(__filter_view_iterator<_View, _Pred> const& __x, __filter_view_sentinel const& __y) {
+      return __x.__current_ == __y.__end_;
+    }
+  };
+
+namespace views {
+namespace __filter {
+  struct __fn {
+    template<class _Range, class _Pred>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Range&& __range, _Pred&& __pred) const
+      noexcept(noexcept(filter_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred))))
+      -> decltype(      filter_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred)))
+      { return          filter_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred)); }
+
+    template<class _Pred>
+      requires constructible_from<decay_t<_Pred>, _Pred>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Pred&& __pred) const
+      noexcept(is_nothrow_constructible_v<decay_t<_Pred>, _Pred>)
+    { return __range_adaptor_closure_t(std::__bind_back(*this, std::forward<_Pred>(__pred))); }
+  };
+} // namespace __filter
+
+inline namespace __cpo {
+  inline constexpr auto filter = __filter::__fn{};
+} // namespace __cpo
+} // namespace views
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_FILTER_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/iota_view.h b/app/src/main/cpp/libcxx/include/__ranges/iota_view.h
new file mode 100644
index 0000000..3654096
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/iota_view.h
@@ -0,0 +1,434 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_IOTA_VIEW_H
+#define _LIBCPP___RANGES_IOTA_VIEW_H
+
+#include <__assert>
+#include <__compare/three_way_comparable.h>
+#include <__concepts/arithmetic.h>
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/copyable.h>
+#include <__concepts/equality_comparable.h>
+#include <__concepts/invocable.h>
+#include <__concepts/same_as.h>
+#include <__concepts/semiregular.h>
+#include <__concepts/totally_ordered.h>
+#include <__config>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/unreachable_sentinel.h>
+#include <__ranges/copyable_box.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/view_interface.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+  template<class _Int>
+  struct __get_wider_signed {
+    static auto __call() {
+           if constexpr (sizeof(_Int) < sizeof(short)) return type_identity<short>{};
+      else if constexpr (sizeof(_Int) < sizeof(int))   return type_identity<int>{};
+      else if constexpr (sizeof(_Int) < sizeof(long))  return type_identity<long>{};
+      else                                             return type_identity<long long>{};
+
+      static_assert(sizeof(_Int) <= sizeof(long long),
+        "Found integer-like type that is bigger than largest integer like type.");
+    }
+
+    using type = typename decltype(__call())::type;
+  };
+
+  template<class _Start>
+  using _IotaDiffT = typename _If<
+      (!integral<_Start> || sizeof(iter_difference_t<_Start>) > sizeof(_Start)),
+      type_identity<iter_difference_t<_Start>>,
+      __get_wider_signed<_Start>
+    >::type;
+
+  template<class _Iter>
+  concept __decrementable = incrementable<_Iter> && requires(_Iter __i) {
+    { --__i } -> same_as<_Iter&>;
+    { __i-- } -> same_as<_Iter>;
+  };
+
+  template<class _Iter>
+  concept __advanceable =
+    __decrementable<_Iter> && totally_ordered<_Iter> &&
+    requires(_Iter __i, const _Iter __j, const _IotaDiffT<_Iter> __n) {
+      { __i += __n } -> same_as<_Iter&>;
+      { __i -= __n } -> same_as<_Iter&>;
+      _Iter(__j + __n);
+      _Iter(__n + __j);
+      _Iter(__j - __n);
+      { __j - __j } -> convertible_to<_IotaDiffT<_Iter>>;
+    };
+
+  template <weakly_incrementable _Start>
+    requires copyable<_Start>
+  struct __iota_view_iterator;
+
+  template <weakly_incrementable _Start, semiregular _BoundSentinel>
+    requires __weakly_equality_comparable_with<_Start, _BoundSentinel> && copyable<_Start>
+  struct __iota_view_sentinel;
+
+  template<class>
+  struct __iota_iterator_category {};
+
+  template<incrementable _Tp>
+  struct __iota_iterator_category<_Tp> {
+    using iterator_category = input_iterator_tag;
+  };
+
+  template <weakly_incrementable _Start, semiregular _BoundSentinel = unreachable_sentinel_t>
+    requires __weakly_equality_comparable_with<_Start, _BoundSentinel> && copyable<_Start>
+  class iota_view : public view_interface<iota_view<_Start, _BoundSentinel>> {
+
+    using __iterator = __iota_view_iterator<_Start>;
+    using __sentinel = __iota_view_sentinel<_Start, _BoundSentinel>;
+
+    _Start __value_ = _Start();
+    _BoundSentinel __bound_sentinel_ = _BoundSentinel();
+
+  public:
+    _LIBCPP_HIDE_FROM_ABI
+    iota_view() requires default_initializable<_Start> = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit iota_view(_Start __value) : __value_(std::move(__value)) { }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr iota_view(type_identity_t<_Start> __value, type_identity_t<_BoundSentinel> __bound_sentinel)
+        : __value_(std::move(__value)), __bound_sentinel_(std::move(__bound_sentinel)) {
+      // Validate the precondition if possible.
+      if constexpr (totally_ordered_with<_Start, _BoundSentinel>) {
+        _LIBCPP_ASSERT(ranges::less_equal()(__value_, __bound_sentinel_),
+                       "Precondition violated: value is greater than bound.");
+      }
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr iota_view(__iterator __first, __iterator __last)
+      requires same_as<_Start, _BoundSentinel>
+    : iota_view(std::move(__first.__value_), std::move(__last.__value_)) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr iota_view(__iterator __first, _BoundSentinel __last)
+      requires same_as<_BoundSentinel, unreachable_sentinel_t>
+    : iota_view(std::move(__first.__value_), std::move(__last)) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr iota_view(__iterator __first, __sentinel __last)
+      requires(!same_as<_Start, _BoundSentinel> && !same_as<_Start, unreachable_sentinel_t>)
+    : iota_view(std::move(__first.__value_), std::move(__last.__bound_sentinel_)) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __iterator begin() const { return __iterator{__value_}; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto end() const {
+      if constexpr (same_as<_BoundSentinel, unreachable_sentinel_t>)
+        return unreachable_sentinel;
+      else
+        return __sentinel{__bound_sentinel_};
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __iterator end() const
+      requires same_as<_Start, _BoundSentinel>
+    {
+      return __iterator{__bound_sentinel_};
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto size() const
+      requires(same_as<_Start, _BoundSentinel> && __advanceable<_Start>) ||
+              (integral<_Start> && integral<_BoundSentinel>) || sized_sentinel_for<_BoundSentinel, _Start>
+    {
+      if constexpr (__integer_like<_Start> && __integer_like<_BoundSentinel>) {
+        if (__value_ < 0) {
+          if (__bound_sentinel_ < 0) {
+            return std::__to_unsigned_like(-__value_) - std::__to_unsigned_like(-__bound_sentinel_);
+          }
+          return std::__to_unsigned_like(__bound_sentinel_) + std::__to_unsigned_like(-__value_);
+        }
+        return std::__to_unsigned_like(__bound_sentinel_) - std::__to_unsigned_like(__value_);
+      }
+      return std::__to_unsigned_like(__bound_sentinel_ - __value_);
+    }
+  };
+
+  template <class _Start, class _BoundSentinel>
+    requires(!__integer_like<_Start> || !__integer_like<_BoundSentinel> ||
+             (__signed_integer_like<_Start> == __signed_integer_like<_BoundSentinel>))
+  iota_view(_Start, _BoundSentinel) -> iota_view<_Start, _BoundSentinel>;
+
+  template <class _Start, class _BoundSentinel>
+  inline constexpr bool enable_borrowed_range<iota_view<_Start, _BoundSentinel>> = true;
+
+  template <weakly_incrementable _Start>
+    requires copyable<_Start>
+  struct __iota_view_iterator : public __iota_iterator_category<_Start> {
+
+    template <weakly_incrementable _StartT, semiregular _BoundSentinelT>
+      requires __weakly_equality_comparable_with<_StartT, _BoundSentinelT> && copyable<_StartT>
+    friend class iota_view;
+
+    using iterator_concept =
+      _If<__advanceable<_Start>,   random_access_iterator_tag,
+      _If<__decrementable<_Start>, bidirectional_iterator_tag,
+      _If<incrementable<_Start>,   forward_iterator_tag,
+      /*Else*/                     input_iterator_tag>>>;
+
+    using value_type = _Start;
+    using difference_type = _IotaDiffT<_Start>;
+
+    _Start __value_ = _Start();
+
+    _LIBCPP_HIDE_FROM_ABI
+    __iota_view_iterator() requires default_initializable<_Start> = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit __iota_view_iterator(_Start __value) : __value_(std::move(__value)) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Start operator*() const noexcept(is_nothrow_copy_constructible_v<_Start>) {
+      return __value_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __iota_view_iterator& operator++() {
+      ++__value_;
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void operator++(int) { ++*this; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __iota_view_iterator operator++(int) requires incrementable<_Start> {
+      auto __tmp = *this;
+      ++*this;
+      return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __iota_view_iterator& operator--() requires __decrementable<_Start> {
+      --__value_;
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __iota_view_iterator  operator--(int) requires __decrementable<_Start> {
+      auto __tmp = *this;
+      --*this;
+      return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __iota_view_iterator& operator+=(difference_type __n)
+      requires __advanceable<_Start>
+    {
+      if constexpr (__integer_like<_Start> && !__signed_integer_like<_Start>) {
+        if (__n >= difference_type(0)) {
+          __value_ += static_cast<_Start>(__n);
+        } else {
+          __value_ -= static_cast<_Start>(-__n);
+        }
+      } else {
+        __value_ += __n;
+      }
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __iota_view_iterator& operator-=(difference_type __n)
+      requires __advanceable<_Start>
+    {
+      if constexpr (__integer_like<_Start> && !__signed_integer_like<_Start>) {
+        if (__n >= difference_type(0)) {
+          __value_ -= static_cast<_Start>(__n);
+        } else {
+          __value_ += static_cast<_Start>(-__n);
+        }
+      } else {
+        __value_ -= __n;
+      }
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Start operator[](difference_type __n) const
+      requires __advanceable<_Start>
+    {
+      return _Start(__value_ + __n);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator==(const __iota_view_iterator& __x, const __iota_view_iterator& __y)
+      requires equality_comparable<_Start>
+    {
+      return __x.__value_ == __y.__value_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator<(const __iota_view_iterator& __x, const __iota_view_iterator& __y)
+      requires totally_ordered<_Start>
+    {
+      return __x.__value_ < __y.__value_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator>(const __iota_view_iterator& __x, const __iota_view_iterator& __y)
+      requires totally_ordered<_Start>
+    {
+      return __y < __x;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator<=(const __iota_view_iterator& __x, const __iota_view_iterator& __y)
+      requires totally_ordered<_Start>
+    {
+      return !(__y < __x);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator>=(const __iota_view_iterator& __x, const __iota_view_iterator& __y)
+      requires totally_ordered<_Start>
+    {
+      return !(__x < __y);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr auto operator<=>(const __iota_view_iterator& __x, const __iota_view_iterator& __y)
+      requires totally_ordered<_Start> && three_way_comparable<_Start>
+    {
+      return __x.__value_ <=> __y.__value_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr __iota_view_iterator operator+(__iota_view_iterator __i, difference_type __n)
+      requires __advanceable<_Start>
+    {
+      __i += __n;
+      return __i;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr __iota_view_iterator operator+(difference_type __n, __iota_view_iterator __i)
+      requires __advanceable<_Start>
+    {
+      return __i + __n;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr __iota_view_iterator operator-(__iota_view_iterator __i, difference_type __n)
+      requires __advanceable<_Start>
+    {
+      __i -= __n;
+      return __i;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr difference_type operator-(const __iota_view_iterator& __x, const __iota_view_iterator& __y)
+      requires __advanceable<_Start>
+    {
+      if constexpr (__integer_like<_Start>) {
+        if constexpr (__signed_integer_like<_Start>) {
+          return difference_type(difference_type(__x.__value_) - difference_type(__y.__value_));
+        }
+        if (__y.__value_ > __x.__value_) {
+          return difference_type(-difference_type(__y.__value_ - __x.__value_));
+        }
+        return difference_type(__x.__value_ - __y.__value_);
+      }
+      return __x.__value_ - __y.__value_;
+    }
+  };
+
+  template <weakly_incrementable _Start, semiregular _BoundSentinel>
+    requires __weakly_equality_comparable_with<_Start, _BoundSentinel> && copyable<_Start>
+  struct __iota_view_sentinel {
+
+    template <weakly_incrementable _StartT, semiregular _BoundSentinelT>
+      requires __weakly_equality_comparable_with<_StartT, _BoundSentinelT> && copyable<_StartT>
+    friend class iota_view;
+
+    using __iterator = __iota_view_iterator<_Start>;
+
+  private:
+    _BoundSentinel __bound_sentinel_ = _BoundSentinel();
+
+  public:
+    _LIBCPP_HIDE_FROM_ABI
+    __iota_view_sentinel() = default;
+    constexpr explicit __iota_view_sentinel(_BoundSentinel __bound_sentinel) : __bound_sentinel_(std::move(__bound_sentinel)) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator==(const __iterator& __x, const __iota_view_sentinel& __y) {
+      return __x.__value_ == __y.__bound_sentinel_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr iter_difference_t<_Start> operator-(const __iterator& __x, const __iota_view_sentinel& __y)
+      requires sized_sentinel_for<_BoundSentinel, _Start>
+    {
+      return __x.__value_ - __y.__bound_sentinel_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr iter_difference_t<_Start> operator-(const __iota_view_sentinel& __x, const __iterator& __y)
+      requires sized_sentinel_for<_BoundSentinel, _Start>
+    {
+      return -(__y - __x);
+    }
+  };
+
+ namespace views {
+ namespace __iota {
+  struct __fn {
+    template<class _Start>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Start&& __start) const
+      noexcept(noexcept(ranges::iota_view(std::forward<_Start>(__start))))
+      -> decltype(      ranges::iota_view(std::forward<_Start>(__start)))
+      { return          ranges::iota_view(std::forward<_Start>(__start)); }
+
+    template <class _Start, class _BoundSentinel>
+    _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Start&& __start, _BoundSentinel&& __bound_sentinel) const
+      noexcept(noexcept(ranges::iota_view(std::forward<_Start>(__start), std::forward<_BoundSentinel>(__bound_sentinel))))
+      -> decltype(      ranges::iota_view(std::forward<_Start>(__start), std::forward<_BoundSentinel>(__bound_sentinel)))
+      { return          ranges::iota_view(std::forward<_Start>(__start), std::forward<_BoundSentinel>(__bound_sentinel)); }
+  };
+} // namespace __iota
+
+inline namespace __cpo {
+  inline constexpr auto iota = __iota::__fn{};
+} // namespace __cpo
+} // namespace views
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_IOTA_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/istream_view.h b/app/src/main/cpp/libcxx/include/__ranges/istream_view.h
new file mode 100644
index 0000000..69a9df3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/istream_view.h
@@ -0,0 +1,149 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_ISTREAM_VIEW_H
+#define _LIBCPP___RANGES_ISTREAM_VIEW_H
+
+#include <__concepts/constructible.h>
+#include <__concepts/derived_from.h>
+#include <__concepts/movable.h>
+#include <__config>
+#include <__iterator/default_sentinel.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__ranges/view_interface.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/forward.h>
+#include <cstddef>
+#include <iosfwd>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER >= 20
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace ranges {
+
+template <class _Val, class _CharT, class _Traits>
+concept __stream_extractable = requires(basic_istream<_CharT, _Traits>& __is, _Val& __t) { __is >> __t; };
+
+template <movable _Val, class _CharT, class _Traits>
+  requires default_initializable<_Val> && __stream_extractable<_Val, _CharT, _Traits>
+class __basic_istream_view_iterator;
+
+template <movable _Val, class _CharT, class _Traits = char_traits<_CharT>>
+  requires default_initializable<_Val> && __stream_extractable<_Val, _CharT, _Traits>
+class basic_istream_view : public view_interface<basic_istream_view<_Val, _CharT, _Traits>> {
+  using __iterator = __basic_istream_view_iterator<_Val, _CharT, _Traits>;
+
+  template <movable _ValueType, class _CharType, class _TraitsType>
+    requires default_initializable<_ValueType> && __stream_extractable<_ValueType, _CharType, _TraitsType>
+  friend class __basic_istream_view_iterator;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit basic_istream_view(basic_istream<_CharT, _Traits>& __stream)
+      : __stream_(std::addressof(__stream)) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto begin() {
+    *__stream_ >> __value_;
+    return __iterator{*this};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr default_sentinel_t end() const noexcept { return default_sentinel; }
+
+private:
+  basic_istream<_CharT, _Traits>* __stream_;
+  _LIBCPP_NO_UNIQUE_ADDRESS _Val __value_ = _Val();
+};
+
+template <movable _Val, class _CharT, class _Traits>
+  requires default_initializable<_Val> && __stream_extractable<_Val, _CharT, _Traits>
+class __basic_istream_view_iterator {
+public:
+  using iterator_concept = input_iterator_tag;
+  using difference_type  = ptrdiff_t;
+  using value_type       = _Val;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit __basic_istream_view_iterator(
+      basic_istream_view<_Val, _CharT, _Traits>& __parent) noexcept
+      : __parent_(std::addressof(__parent)) {}
+
+  __basic_istream_view_iterator(const __basic_istream_view_iterator&)                  = delete;
+  _LIBCPP_HIDE_FROM_ABI __basic_istream_view_iterator(__basic_istream_view_iterator&&) = default;
+
+  __basic_istream_view_iterator& operator=(const __basic_istream_view_iterator&)                  = delete;
+  _LIBCPP_HIDE_FROM_ABI __basic_istream_view_iterator& operator=(__basic_istream_view_iterator&&) = default;
+
+  _LIBCPP_HIDE_FROM_ABI __basic_istream_view_iterator& operator++() {
+    *__parent_->__stream_ >> __parent_->__value_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI void operator++(int) { ++*this; }
+
+  _LIBCPP_HIDE_FROM_ABI _Val& operator*() const { return __parent_->__value_; }
+
+  _LIBCPP_HIDE_FROM_ABI friend bool operator==(const __basic_istream_view_iterator& __x, default_sentinel_t) {
+    return !*__x.__get_parent_stream();
+  }
+
+private:
+  basic_istream_view<_Val, _CharT, _Traits>* __parent_;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr basic_istream<_CharT, _Traits>* __get_parent_stream() const {
+    return __parent_->__stream_;
+  }
+};
+
+template <class _Val>
+using istream_view = basic_istream_view<_Val, char>;
+
+#  ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class _Val>
+using wistream_view = basic_istream_view<_Val, wchar_t>;
+#  endif
+
+namespace views {
+namespace __istream {
+
+// clang-format off
+template <class _Tp>
+struct __fn {
+  template <class _Up, class _UnCVRef = remove_cvref_t<_Up>>
+    requires derived_from<_UnCVRef, basic_istream<typename _UnCVRef::char_type,
+                                                  typename _UnCVRef::traits_type>>
+  _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Up&& __u) const
+    noexcept(noexcept(basic_istream_view<_Tp, typename _UnCVRef::char_type,
+                                              typename _UnCVRef::traits_type>(std::forward<_Up>(__u))))
+    -> decltype(      basic_istream_view<_Tp, typename _UnCVRef::char_type,
+                                              typename _UnCVRef::traits_type>(std::forward<_Up>(__u)))
+    {   return        basic_istream_view<_Tp, typename _UnCVRef::char_type,
+                                              typename _UnCVRef::traits_type>(std::forward<_Up>(__u));
+    }
+};
+// clang-format on
+
+} // namespace __istream
+
+inline namespace __cpo {
+template <class _Tp>
+inline constexpr auto istream = __istream::__fn<_Tp>{};
+} // namespace __cpo
+} // namespace views
+
+} // namespace ranges
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 20
+
+#endif // _LIBCPP___RANGES_ISTREAM_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/join_view.h b/app/src/main/cpp/libcxx/include/__ranges/join_view.h
new file mode 100644
index 0000000..869540f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/join_view.h
@@ -0,0 +1,452 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_JOIN_VIEW_H
+#define _LIBCPP___RANGES_JOIN_VIEW_H
+
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/copyable.h>
+#include <__concepts/derived_from.h>
+#include <__concepts/equality_comparable.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iter_swap.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/iterator_with_data.h>
+#include <__iterator/segmented_iterator.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/empty.h>
+#include <__ranges/non_propagating_cache.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/view_interface.h>
+#include <__type_traits/maybe_const.h>
+#include <__utility/forward.h>
+#include <optional>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+  template<class>
+  struct __join_view_iterator_category {};
+
+  template<class _View>
+    requires is_reference_v<range_reference_t<_View>> &&
+             forward_range<_View> &&
+             forward_range<range_reference_t<_View>>
+  struct __join_view_iterator_category<_View> {
+    using _OuterC = typename iterator_traits<iterator_t<_View>>::iterator_category;
+    using _InnerC = typename iterator_traits<iterator_t<range_reference_t<_View>>>::iterator_category;
+
+    using iterator_category = _If<
+      derived_from<_OuterC, bidirectional_iterator_tag> && derived_from<_InnerC, bidirectional_iterator_tag> &&
+        common_range<range_reference_t<_View>>,
+      bidirectional_iterator_tag,
+      _If<
+        derived_from<_OuterC, forward_iterator_tag> && derived_from<_InnerC, forward_iterator_tag>,
+        forward_iterator_tag,
+        input_iterator_tag
+      >
+    >;
+  };
+
+  template <input_range _View, bool _Const>
+    requires view<_View> && input_range<range_reference_t<_View>>
+  struct __join_view_iterator;
+
+  template <input_range _View, bool _Const>
+    requires view<_View> && input_range<range_reference_t<_View>>
+  struct __join_view_sentinel;
+
+  template<input_range _View>
+    requires view<_View> && input_range<range_reference_t<_View>>
+  class join_view
+    : public view_interface<join_view<_View>> {
+  private:
+    using _InnerRange = range_reference_t<_View>;
+
+    template<bool _Const>
+    using __iterator = __join_view_iterator<_View, _Const>;
+
+    template<bool _Const>
+    using __sentinel = __join_view_sentinel<_View, _Const>;
+
+    template <input_range _View2, bool _Const2>
+      requires view<_View2> && input_range<range_reference_t<_View2>>
+    friend struct __join_view_iterator;
+
+    template <input_range _View2, bool _Const2>
+      requires view<_View2> && input_range<range_reference_t<_View2>>
+    friend struct __join_view_sentinel;
+
+    template <class>
+    friend struct std::__segmented_iterator_traits;
+
+    static constexpr bool _UseCache = !is_reference_v<_InnerRange>;
+    using _Cache = _If<_UseCache, __non_propagating_cache<remove_cvref_t<_InnerRange>>, __empty_cache>;
+    _LIBCPP_NO_UNIQUE_ADDRESS _Cache __cache_;
+    _LIBCPP_NO_UNIQUE_ADDRESS _View __base_ = _View();
+
+  public:
+    _LIBCPP_HIDE_FROM_ABI
+    join_view() requires default_initializable<_View> = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit join_view(_View __base)
+      : __base_(std::move(__base)) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _View base() const& requires copy_constructible<_View> { return __base_; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _View base() && { return std::move(__base_); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto begin() {
+      constexpr bool __use_const = __simple_view<_View> &&
+                                   is_reference_v<range_reference_t<_View>>;
+      return __iterator<__use_const>{*this, ranges::begin(__base_)};
+    }
+
+    template<class _V2 = _View>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto begin() const
+      requires input_range<const _V2> &&
+               is_reference_v<range_reference_t<const _V2>>
+    {
+      return __iterator<true>{*this, ranges::begin(__base_)};
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto end() {
+      if constexpr (forward_range<_View> &&
+                    is_reference_v<_InnerRange> &&
+                    forward_range<_InnerRange> &&
+                    common_range<_View> &&
+                    common_range<_InnerRange>)
+        return __iterator<__simple_view<_View>>{*this, ranges::end(__base_)};
+      else
+        return __sentinel<__simple_view<_View>>{*this};
+    }
+
+    template<class _V2 = _View>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto end() const
+      requires input_range<const _V2> &&
+               is_reference_v<range_reference_t<const _V2>>
+    {
+      using _ConstInnerRange = range_reference_t<const _View>;
+      if constexpr (forward_range<const _View> &&
+                    is_reference_v<_ConstInnerRange> &&
+                    forward_range<_ConstInnerRange> &&
+                    common_range<const _View> &&
+                    common_range<_ConstInnerRange>) {
+        return __iterator<true>{*this, ranges::end(__base_)};
+      } else {
+        return __sentinel<true>{*this};
+      }
+    }
+  };
+
+  template<input_range _View, bool _Const>
+    requires view<_View> && input_range<range_reference_t<_View>>
+  struct __join_view_sentinel {
+    template<input_range _View2, bool>
+      requires view<_View2> && input_range<range_reference_t<_View2>>
+    friend struct __join_view_sentinel;
+
+  private:
+    using _Parent = __maybe_const<_Const, join_view<_View>>;
+    using _Base = __maybe_const<_Const, _View>;
+    sentinel_t<_Base> __end_ = sentinel_t<_Base>();
+
+  public:
+    _LIBCPP_HIDE_FROM_ABI
+    __join_view_sentinel() = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit __join_view_sentinel(_Parent& __parent)
+      : __end_(ranges::end(__parent.__base_)) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __join_view_sentinel(__join_view_sentinel<_View, !_Const> __s)
+      requires _Const && convertible_to<sentinel_t<_View>, sentinel_t<_Base>>
+      : __end_(std::move(__s.__end_)) {}
+
+    template<bool _OtherConst>
+      requires sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator==(const __join_view_iterator<_View, _OtherConst>& __x, const __join_view_sentinel& __y) {
+      return __x.__outer_ == __y.__end_;
+    }
+  };
+
+  template<input_range _View, bool _Const>
+    requires view<_View> && input_range<range_reference_t<_View>>
+  struct __join_view_iterator
+    : public __join_view_iterator_category<__maybe_const<_Const, _View>> {
+
+    template<input_range _View2, bool>
+      requires view<_View2> && input_range<range_reference_t<_View2>>
+    friend struct __join_view_iterator;
+
+    template <class>
+    friend struct std::__segmented_iterator_traits;
+
+  private:
+    using _Parent = __maybe_const<_Const, join_view<_View>>;
+    using _Base = __maybe_const<_Const, _View>;
+    using _Outer = iterator_t<_Base>;
+    using _Inner = iterator_t<range_reference_t<_Base>>;
+    using _InnerRange = range_reference_t<_View>;
+
+    static constexpr bool __ref_is_glvalue = is_reference_v<range_reference_t<_Base>>;
+
+  public:
+    _Outer __outer_ = _Outer();
+
+  private:
+    optional<_Inner> __inner_;
+    _Parent *__parent_ = nullptr;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void __satisfy() {
+      for (; __outer_ != ranges::end(__parent_->__base_); ++__outer_) {
+        auto&& __inner = [&]() -> auto&& {
+          if constexpr (__ref_is_glvalue)
+            return *__outer_;
+          else
+            return __parent_->__cache_.__emplace_from([&]() -> decltype(auto) { return *__outer_; });
+        }();
+        __inner_ = ranges::begin(__inner);
+        if (*__inner_ != ranges::end(__inner))
+          return;
+      }
+
+      if constexpr (__ref_is_glvalue)
+        __inner_.reset();
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr __join_view_iterator(_Parent* __parent, _Outer __outer, _Inner __inner)
+      : __outer_(std::move(__outer)), __inner_(std::move(__inner)), __parent_(__parent) {}
+
+  public:
+    using iterator_concept = _If<
+      __ref_is_glvalue && bidirectional_range<_Base> && bidirectional_range<range_reference_t<_Base>> &&
+          common_range<range_reference_t<_Base>>,
+      bidirectional_iterator_tag,
+      _If<
+        __ref_is_glvalue && forward_range<_Base> && forward_range<range_reference_t<_Base>>,
+        forward_iterator_tag,
+        input_iterator_tag
+      >
+    >;
+
+    using value_type = range_value_t<range_reference_t<_Base>>;
+
+    using difference_type = common_type_t<
+      range_difference_t<_Base>, range_difference_t<range_reference_t<_Base>>>;
+
+    _LIBCPP_HIDE_FROM_ABI
+    __join_view_iterator() requires default_initializable<_Outer> = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __join_view_iterator(_Parent& __parent, _Outer __outer)
+      : __outer_(std::move(__outer))
+      , __parent_(std::addressof(__parent)) {
+      __satisfy();
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __join_view_iterator(__join_view_iterator<_View, !_Const> __i)
+      requires _Const &&
+               convertible_to<iterator_t<_View>, _Outer> &&
+               convertible_to<iterator_t<_InnerRange>, _Inner>
+      : __outer_(std::move(__i.__outer_))
+      , __inner_(std::move(__i.__inner_))
+      , __parent_(__i.__parent_) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr decltype(auto) operator*() const {
+      return **__inner_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Inner operator->() const
+      requires __has_arrow<_Inner> && copyable<_Inner>
+    {
+      return *__inner_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __join_view_iterator& operator++() {
+      auto&& __inner = [&]() -> auto&& {
+        if constexpr (__ref_is_glvalue)
+          return *__outer_;
+        else
+          return *__parent_->__cache_;
+      }();
+      if (++*__inner_ == ranges::end(__inner)) {
+        ++__outer_;
+        __satisfy();
+      }
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr void operator++(int) {
+      ++*this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __join_view_iterator operator++(int)
+      requires __ref_is_glvalue &&
+               forward_range<_Base> &&
+               forward_range<range_reference_t<_Base>>
+    {
+      auto __tmp = *this;
+      ++*this;
+      return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __join_view_iterator& operator--()
+      requires __ref_is_glvalue &&
+               bidirectional_range<_Base> &&
+               bidirectional_range<range_reference_t<_Base>> &&
+               common_range<range_reference_t<_Base>>
+    {
+      if (__outer_ == ranges::end(__parent_->__base_))
+        __inner_ = ranges::end(*--__outer_);
+
+      // Skip empty inner ranges when going backwards.
+      while (*__inner_ == ranges::begin(*__outer_)) {
+        __inner_ = ranges::end(*--__outer_);
+      }
+
+      --*__inner_;
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __join_view_iterator operator--(int)
+      requires __ref_is_glvalue &&
+               bidirectional_range<_Base> &&
+               bidirectional_range<range_reference_t<_Base>> &&
+               common_range<range_reference_t<_Base>>
+    {
+      auto __tmp = *this;
+      --*this;
+      return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator==(const __join_view_iterator& __x, const __join_view_iterator& __y)
+      requires __ref_is_glvalue &&
+               equality_comparable<iterator_t<_Base>> &&
+               equality_comparable<iterator_t<range_reference_t<_Base>>>
+    {
+      return __x.__outer_ == __y.__outer_ && __x.__inner_ == __y.__inner_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr decltype(auto) iter_move(const __join_view_iterator& __i)
+      noexcept(noexcept(ranges::iter_move(*__i.__inner_)))
+    {
+      return ranges::iter_move(*__i.__inner_);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr void iter_swap(const __join_view_iterator& __x, const __join_view_iterator& __y)
+      noexcept(noexcept(ranges::iter_swap(*__x.__inner_, *__y.__inner_)))
+      requires indirectly_swappable<_Inner>
+    {
+      return ranges::iter_swap(*__x.__inner_, *__y.__inner_);
+    }
+  };
+
+  template<class _Range>
+  explicit join_view(_Range&&) -> join_view<views::all_t<_Range>>;
+
+namespace views {
+namespace __join_view {
+struct __fn : __range_adaptor_closure<__fn> {
+  template<class _Range>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Range&& __range) const
+    noexcept(noexcept(join_view<all_t<_Range&&>>(std::forward<_Range>(__range))))
+    -> decltype(      join_view<all_t<_Range&&>>(std::forward<_Range>(__range)))
+    { return          join_view<all_t<_Range&&>>(std::forward<_Range>(__range)); }
+};
+} // namespace __join_view
+inline namespace __cpo {
+  inline constexpr auto join = __join_view::__fn{};
+} // namespace __cpo
+} // namespace views
+} // namespace ranges
+
+template <class _View, bool _Const>
+  requires(ranges::common_range<typename ranges::__join_view_iterator<_View, _Const>::_Parent> &&
+           __is_cpp17_random_access_iterator<typename ranges::__join_view_iterator<_View, _Const>::_Outer>::value &&
+           __is_cpp17_random_access_iterator<typename ranges::__join_view_iterator<_View, _Const>::_Inner>::value)
+struct __segmented_iterator_traits<ranges::__join_view_iterator<_View, _Const>> {
+  using _JoinViewIterator = ranges::__join_view_iterator<_View, _Const>;
+
+  using __segment_iterator =
+      _LIBCPP_NODEBUG __iterator_with_data<typename _JoinViewIterator::_Outer, typename _JoinViewIterator::_Parent*>;
+  using __local_iterator = typename _JoinViewIterator::_Inner;
+
+  // TODO: Would it make sense to enable the optimization for other iterator types?
+
+  static constexpr _LIBCPP_HIDE_FROM_ABI __segment_iterator __segment(_JoinViewIterator __iter) {
+      if (ranges::empty(__iter.__parent_->__base_))
+        return {};
+      if (!__iter.__inner_.has_value())
+        return __segment_iterator(--__iter.__outer_, __iter.__parent_);
+      return __segment_iterator(__iter.__outer_, __iter.__parent_);
+  }
+
+  static constexpr _LIBCPP_HIDE_FROM_ABI __local_iterator __local(_JoinViewIterator __iter) {
+      if (ranges::empty(__iter.__parent_->__base_))
+        return {};
+      if (!__iter.__inner_.has_value())
+        return ranges::end(*--__iter.__outer_);
+      return *__iter.__inner_;
+  }
+
+  static constexpr _LIBCPP_HIDE_FROM_ABI __local_iterator __begin(__segment_iterator __iter) {
+      return ranges::begin(*__iter.__get_iter());
+  }
+
+  static constexpr _LIBCPP_HIDE_FROM_ABI __local_iterator __end(__segment_iterator __iter) {
+      return ranges::end(*__iter.__get_iter());
+  }
+
+  static constexpr _LIBCPP_HIDE_FROM_ABI _JoinViewIterator
+  __compose(__segment_iterator __seg_iter, __local_iterator __local_iter) {
+      return _JoinViewIterator(
+          std::move(__seg_iter).__get_data(), std::move(__seg_iter).__get_iter(), std::move(__local_iter));
+  }
+};
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_JOIN_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/lazy_split_view.h b/app/src/main/cpp/libcxx/include/__ranges/lazy_split_view.h
new file mode 100644
index 0000000..3a95075
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/lazy_split_view.h
@@ -0,0 +1,465 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_LAZY_SPLIT_VIEW_H
+#define _LIBCPP___RANGES_LAZY_SPLIT_VIEW_H
+
+#include <__algorithm/ranges_find.h>
+#include <__algorithm/ranges_mismatch.h>
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/derived_from.h>
+#include <__config>
+#include <__functional/bind_back.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/default_sentinel.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/indirectly_comparable.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iter_swap.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/non_propagating_cache.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/single_view.h>
+#include <__ranges/subrange.h>
+#include <__ranges/view_interface.h>
+#include <__type_traits/maybe_const.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+template <auto> struct __require_constant;
+
+template <class _Range>
+concept __tiny_range =
+  sized_range<_Range> &&
+  requires { typename __require_constant<remove_reference_t<_Range>::size()>; } &&
+  (remove_reference_t<_Range>::size() <= 1);
+
+template <input_range _View, forward_range _Pattern>
+  requires view<_View> && view<_Pattern> &&
+           indirectly_comparable<iterator_t<_View>, iterator_t<_Pattern>, ranges::equal_to> &&
+           (forward_range<_View> || __tiny_range<_Pattern>)
+class lazy_split_view : public view_interface<lazy_split_view<_View, _Pattern>> {
+
+  _LIBCPP_NO_UNIQUE_ADDRESS _View __base_ = _View();
+  _LIBCPP_NO_UNIQUE_ADDRESS _Pattern __pattern_ = _Pattern();
+
+  using _MaybeCurrent = _If<!forward_range<_View>, __non_propagating_cache<iterator_t<_View>>, __empty_cache>;
+  _LIBCPP_NO_UNIQUE_ADDRESS _MaybeCurrent __current_ = _MaybeCurrent();
+
+  template <bool> struct __outer_iterator;
+  template <bool> struct __inner_iterator;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI
+  lazy_split_view()
+    requires default_initializable<_View> && default_initializable<_Pattern> = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr lazy_split_view(_View __base, _Pattern __pattern)
+    : __base_(std::move(__base)), __pattern_(std::move(__pattern)) {}
+
+  template <input_range _Range>
+    requires constructible_from<_View, views::all_t<_Range>> &&
+             constructible_from<_Pattern, single_view<range_value_t<_Range>>>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr lazy_split_view(_Range&& __r, range_value_t<_Range> __e)
+    : __base_(views::all(std::forward<_Range>(__r)))
+    , __pattern_(views::single(std::move(__e))) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _View base() const& requires copy_constructible<_View> { return __base_; }
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _View base() && { return std::move(__base_); }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto begin() {
+    if constexpr (forward_range<_View>) {
+      return __outer_iterator<__simple_view<_View> && __simple_view<_Pattern>>{*this, ranges::begin(__base_)};
+    } else {
+      __current_.__emplace(ranges::begin(__base_));
+      return __outer_iterator<false>{*this};
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto begin() const requires forward_range<_View> && forward_range<const _View> {
+    return __outer_iterator<true>{*this, ranges::begin(__base_)};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto end() requires forward_range<_View> && common_range<_View> {
+    return __outer_iterator<__simple_view<_View> && __simple_view<_Pattern>>{*this, ranges::end(__base_)};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto end() const {
+    if constexpr (forward_range<_View> && forward_range<const _View> && common_range<const _View>) {
+      return __outer_iterator<true>{*this, ranges::end(__base_)};
+    } else {
+      return default_sentinel;
+    }
+  }
+
+private:
+
+  template <class>
+  struct __outer_iterator_category {};
+
+  template <forward_range _Tp>
+  struct __outer_iterator_category<_Tp> {
+    using iterator_category = input_iterator_tag;
+  };
+
+  template <bool _Const>
+  struct __outer_iterator : __outer_iterator_category<__maybe_const<_Const, _View>> {
+  private:
+    template <bool>
+    friend struct __inner_iterator;
+    friend __outer_iterator<true>;
+
+    using _Parent = __maybe_const<_Const, lazy_split_view>;
+    using _Base = __maybe_const<_Const, _View>;
+
+    _Parent* __parent_ = nullptr;
+    using _MaybeCurrent = _If<forward_range<_View>, iterator_t<_Base>, __empty_cache>;
+    _LIBCPP_NO_UNIQUE_ADDRESS _MaybeCurrent __current_ = _MaybeCurrent();
+    bool __trailing_empty_ = false;
+
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto& __current() noexcept {
+      if constexpr (forward_range<_View>) {
+        return __current_;
+      } else {
+        return *__parent_->__current_;
+      }
+    }
+
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr const auto& __current() const noexcept {
+      if constexpr (forward_range<_View>) {
+        return __current_;
+      } else {
+        return *__parent_->__current_;
+      }
+    }
+
+    // Workaround for the GCC issue that doesn't allow calling `__parent_->__base_` from friend functions (because
+    // `__base_` is private).
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto& __parent_base() const noexcept {
+      return __parent_->__base_;
+    }
+
+  public:
+    // using iterator_category = inherited;
+    using iterator_concept = conditional_t<forward_range<_Base>, forward_iterator_tag, input_iterator_tag>;
+    using difference_type = range_difference_t<_Base>;
+
+    struct value_type : view_interface<value_type> {
+    private:
+      __outer_iterator __i_ = __outer_iterator();
+
+    public:
+      _LIBCPP_HIDE_FROM_ABI
+      value_type() = default;
+      _LIBCPP_HIDE_FROM_ABI
+      constexpr explicit value_type(__outer_iterator __i)
+        : __i_(std::move(__i)) {}
+
+      _LIBCPP_HIDE_FROM_ABI
+      constexpr __inner_iterator<_Const> begin() const { return __inner_iterator<_Const>{__i_}; }
+      _LIBCPP_HIDE_FROM_ABI
+      constexpr default_sentinel_t end() const noexcept { return default_sentinel; }
+    };
+
+    _LIBCPP_HIDE_FROM_ABI
+    __outer_iterator() = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit __outer_iterator(_Parent& __parent)
+      requires (!forward_range<_Base>)
+      : __parent_(std::addressof(__parent)) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __outer_iterator(_Parent& __parent, iterator_t<_Base> __current)
+      requires forward_range<_Base>
+      : __parent_(std::addressof(__parent)), __current_(std::move(__current)) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __outer_iterator(__outer_iterator<!_Const> __i)
+      requires _Const && convertible_to<iterator_t<_View>, iterator_t<_Base>>
+      : __parent_(__i.__parent_), __current_(std::move(__i.__current_)) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr value_type operator*() const { return value_type{*this}; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __outer_iterator& operator++() {
+      const auto __end = ranges::end(__parent_->__base_);
+      if (__current() == __end) {
+        __trailing_empty_ = false;
+        return *this;
+      }
+
+      const auto [__pbegin, __pend] = ranges::subrange{__parent_->__pattern_};
+      if (__pbegin == __pend) {
+        // Empty pattern: split on every element in the input range
+        ++__current();
+
+      } else if constexpr (__tiny_range<_Pattern>) {
+        // One-element pattern: we can use `ranges::find`.
+        __current() = ranges::find(std::move(__current()), __end, *__pbegin);
+        if (__current() != __end) {
+          // Make sure we point to after the separator we just found.
+          ++__current();
+          if (__current() == __end)
+            __trailing_empty_ = true;
+        }
+
+      } else {
+        // General case for n-element pattern.
+        do {
+          const auto [__b, __p] = ranges::mismatch(__current(), __end, __pbegin, __pend);
+          if (__p == __pend) {
+            __current() = __b;
+            if (__current() == __end) {
+              __trailing_empty_ = true;
+            }
+            break; // The pattern matched; skip it.
+          }
+        } while (++__current() != __end);
+      }
+
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr decltype(auto) operator++(int) {
+      if constexpr (forward_range<_Base>) {
+        auto __tmp = *this;
+        ++*this;
+        return __tmp;
+
+      } else {
+        ++*this;
+      }
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator==(const __outer_iterator& __x, const __outer_iterator& __y)
+      requires forward_range<_Base> {
+      return __x.__current_ == __y.__current_ && __x.__trailing_empty_ == __y.__trailing_empty_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator==(const __outer_iterator& __x, default_sentinel_t) {
+      _LIBCPP_ASSERT(__x.__parent_, "Cannot call comparison on a default-constructed iterator.");
+      return __x.__current() == ranges::end(__x.__parent_base()) && !__x.__trailing_empty_;
+    }
+  };
+
+  template <class>
+  struct __inner_iterator_category {};
+
+  template <forward_range _Tp>
+  struct __inner_iterator_category<_Tp> {
+    using iterator_category = _If<
+      derived_from<typename iterator_traits<iterator_t<_Tp>>::iterator_category, forward_iterator_tag>,
+      forward_iterator_tag,
+      typename iterator_traits<iterator_t<_Tp>>::iterator_category
+    >;
+  };
+
+  template <bool _Const>
+  struct __inner_iterator : __inner_iterator_category<__maybe_const<_Const, _View>> {
+  private:
+    using _Base = __maybe_const<_Const, _View>;
+    // Workaround for a GCC issue.
+    static constexpr bool _OuterConst = _Const;
+    __outer_iterator<_Const> __i_ = __outer_iterator<_OuterConst>();
+    bool __incremented_ = false;
+
+    // Note: these private functions are necessary because GCC doesn't allow calls to private members of `__i_` from
+    // free functions that are friends of `inner-iterator`.
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr bool __is_done() const {
+      _LIBCPP_ASSERT(__i_.__parent_, "Cannot call comparison on a default-constructed iterator.");
+
+      auto [__pcur, __pend] = ranges::subrange{__i_.__parent_->__pattern_};
+      auto __end = ranges::end(__i_.__parent_->__base_);
+
+      if constexpr (__tiny_range<_Pattern>) {
+        const auto& __cur = __i_.__current();
+        if (__cur == __end)
+          return true;
+        if (__pcur == __pend)
+          return __incremented_;
+
+        return *__cur == *__pcur;
+
+      } else {
+        auto __cur = __i_.__current();
+        if (__cur == __end)
+          return true;
+        if (__pcur == __pend)
+          return __incremented_;
+
+        do {
+          if (*__cur != *__pcur)
+            return false;
+          if (++__pcur == __pend)
+            return true;
+        } while (++__cur != __end);
+
+        return false;
+      }
+    }
+
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto& __outer_current() noexcept {
+      return __i_.__current();
+    }
+
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr const auto& __outer_current() const noexcept {
+      return __i_.__current();
+    }
+
+  public:
+    // using iterator_category = inherited;
+    using iterator_concept = typename __outer_iterator<_Const>::iterator_concept;
+    using value_type = range_value_t<_Base>;
+    using difference_type = range_difference_t<_Base>;
+
+    _LIBCPP_HIDE_FROM_ABI
+    __inner_iterator() = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit __inner_iterator(__outer_iterator<_Const> __i)
+      : __i_(std::move(__i)) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr const iterator_t<_Base>& base() const& noexcept { return __i_.__current(); }
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr iterator_t<_Base> base() &&
+      requires forward_range<_View> { return std::move(__i_.__current()); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr decltype(auto) operator*() const { return *__i_.__current(); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __inner_iterator& operator++() {
+      __incremented_ = true;
+
+      if constexpr (!forward_range<_Base>) {
+        if constexpr (_Pattern::size() == 0) {
+          return *this;
+        }
+      }
+
+      ++__i_.__current();
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr decltype(auto) operator++(int) {
+      if constexpr (forward_range<_Base>) {
+        auto __tmp = *this;
+        ++*this;
+        return __tmp;
+
+      } else {
+        ++*this;
+      }
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator==(const __inner_iterator& __x, const __inner_iterator& __y)
+      requires forward_range<_Base> {
+      return __x.__outer_current() == __y.__outer_current();
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr bool operator==(const __inner_iterator& __x, default_sentinel_t) {
+      return __x.__is_done();
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr decltype(auto) iter_move(const __inner_iterator& __i)
+        noexcept(noexcept(ranges::iter_move(__i.__outer_current()))) {
+      return ranges::iter_move(__i.__outer_current());
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend constexpr void iter_swap(const __inner_iterator& __x, const __inner_iterator& __y)
+        noexcept(noexcept(ranges::iter_swap(__x.__outer_current(), __y.__outer_current())))
+        requires indirectly_swappable<iterator_t<_Base>> {
+      ranges::iter_swap(__x.__outer_current(), __y.__outer_current());
+    }
+  };
+
+};
+
+template <class _Range, class _Pattern>
+lazy_split_view(_Range&&, _Pattern&&) -> lazy_split_view<views::all_t<_Range>, views::all_t<_Pattern>>;
+
+template <input_range _Range>
+lazy_split_view(_Range&&, range_value_t<_Range>)
+  -> lazy_split_view<views::all_t<_Range>, single_view<range_value_t<_Range>>>;
+
+namespace views {
+namespace __lazy_split_view {
+struct __fn : __range_adaptor_closure<__fn> {
+  template <class _Range, class _Pattern>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Range&& __range, _Pattern&& __pattern) const
+    noexcept(noexcept(lazy_split_view(std::forward<_Range>(__range), std::forward<_Pattern>(__pattern))))
+    -> decltype(      lazy_split_view(std::forward<_Range>(__range), std::forward<_Pattern>(__pattern)))
+    { return          lazy_split_view(std::forward<_Range>(__range), std::forward<_Pattern>(__pattern)); }
+
+  template <class _Pattern>
+    requires constructible_from<decay_t<_Pattern>, _Pattern>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Pattern&& __pattern) const
+      noexcept(is_nothrow_constructible_v<decay_t<_Pattern>, _Pattern>) {
+    return __range_adaptor_closure_t(std::__bind_back(*this, std::forward<_Pattern>(__pattern)));
+  }
+};
+} // namespace __lazy_split_view
+
+inline namespace __cpo {
+  inline constexpr auto lazy_split = __lazy_split_view::__fn{};
+} // namespace __cpo
+} // namespace views
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_LAZY_SPLIT_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/non_propagating_cache.h b/app/src/main/cpp/libcxx/include/__ranges/non_propagating_cache.h
new file mode 100644
index 0000000..d50c577
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/non_propagating_cache.h
@@ -0,0 +1,114 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_NON_PROPAGATING_CACHE_H
+#define _LIBCPP___RANGES_NON_PROPAGATING_CACHE_H
+
+#include <__config>
+#include <__iterator/concepts.h>        // indirectly_readable
+#include <__iterator/iterator_traits.h> // iter_reference_t
+#include <__memory/addressof.h>
+#include <__utility/forward.h>
+#include <optional>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+  // __non_propagating_cache is a helper type that allows storing an optional value in it,
+  // but which does not copy the source's value when it is copy constructed/assigned to,
+  // and which resets the source's value when it is moved-from.
+  //
+  // This type is used as an implementation detail of some views that need to cache the
+  // result of `begin()` in order to provide an amortized O(1) begin() method. Typically,
+  // we don't want to propagate the value of the cache upon copy because the cached iterator
+  // may refer to internal details of the source view.
+  template<class _Tp>
+    requires is_object_v<_Tp>
+  class _LIBCPP_TEMPLATE_VIS __non_propagating_cache {
+    struct __from_tag { };
+    struct __forward_tag { };
+
+    // This helper class is needed to perform copy and move elision when
+    // constructing the contained type from an iterator.
+    struct __wrapper {
+      template<class ..._Args>
+      constexpr explicit __wrapper(__forward_tag, _Args&& ...__args) : __t_(std::forward<_Args>(__args)...) { }
+      template<class _Fn>
+      constexpr explicit __wrapper(__from_tag, _Fn const& __f) : __t_(__f()) { }
+      _Tp __t_;
+    };
+
+    optional<__wrapper> __value_ = nullopt;
+
+  public:
+    _LIBCPP_HIDE_FROM_ABI __non_propagating_cache() = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __non_propagating_cache(__non_propagating_cache const&) noexcept
+      : __value_(nullopt)
+    { }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __non_propagating_cache(__non_propagating_cache&& __other) noexcept
+      : __value_(nullopt)
+    {
+      __other.__value_.reset();
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __non_propagating_cache& operator=(__non_propagating_cache const& __other) noexcept {
+      if (this != std::addressof(__other)) {
+        __value_.reset();
+      }
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr __non_propagating_cache& operator=(__non_propagating_cache&& __other) noexcept {
+      __value_.reset();
+      __other.__value_.reset();
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Tp& operator*() { return __value_->__t_; }
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Tp const& operator*() const { return __value_->__t_; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr bool __has_value() const { return __value_.has_value(); }
+
+    template<class _Fn>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Tp& __emplace_from(_Fn const& __f) {
+      return __value_.emplace(__from_tag{}, __f).__t_;
+    }
+
+    template<class ..._Args>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Tp& __emplace(_Args&& ...__args) {
+      return __value_.emplace(__forward_tag{}, std::forward<_Args>(__args)...).__t_;
+    }
+  };
+
+  struct __empty_cache { };
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_NON_PROPAGATING_CACHE_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/owning_view.h b/app/src/main/cpp/libcxx/include/__ranges/owning_view.h
new file mode 100644
index 0000000..e150f6d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/owning_view.h
@@ -0,0 +1,83 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_OWNING_VIEW_H
+#define _LIBCPP___RANGES_OWNING_VIEW_H
+
+#include <__concepts/constructible.h>
+#include <__concepts/movable.h>
+#include <__config>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/data.h>
+#include <__ranges/empty.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/size.h>
+#include <__ranges/view_interface.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+  template<range _Rp>
+    requires movable<_Rp> && (!__is_std_initializer_list<remove_cvref_t<_Rp>>)
+  class owning_view : public view_interface<owning_view<_Rp>> {
+    _Rp __r_ = _Rp();
+
+public:
+    owning_view() requires default_initializable<_Rp> = default;
+    _LIBCPP_HIDE_FROM_ABI constexpr owning_view(_Rp&& __r) : __r_(std::move(__r)) {}
+
+    owning_view(owning_view&&) = default;
+    owning_view& operator=(owning_view&&) = default;
+
+    _LIBCPP_HIDE_FROM_ABI constexpr _Rp& base() & noexcept { return __r_; }
+    _LIBCPP_HIDE_FROM_ABI constexpr const _Rp& base() const& noexcept { return __r_; }
+    _LIBCPP_HIDE_FROM_ABI constexpr _Rp&& base() && noexcept { return std::move(__r_); }
+    _LIBCPP_HIDE_FROM_ABI constexpr const _Rp&& base() const&& noexcept { return std::move(__r_); }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_Rp> begin() { return ranges::begin(__r_); }
+    _LIBCPP_HIDE_FROM_ABI constexpr sentinel_t<_Rp> end() { return ranges::end(__r_); }
+    _LIBCPP_HIDE_FROM_ABI constexpr auto begin() const requires range<const _Rp> { return ranges::begin(__r_); }
+    _LIBCPP_HIDE_FROM_ABI constexpr auto end() const requires range<const _Rp> { return ranges::end(__r_); }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr bool empty() requires requires { ranges::empty(__r_); }
+      { return ranges::empty(__r_); }
+    _LIBCPP_HIDE_FROM_ABI constexpr bool empty() const requires requires { ranges::empty(__r_); }
+      { return ranges::empty(__r_); }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr auto size() requires sized_range<_Rp>
+      { return ranges::size(__r_); }
+    _LIBCPP_HIDE_FROM_ABI constexpr auto size() const requires sized_range<const _Rp>
+      { return ranges::size(__r_); }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr auto data() requires contiguous_range<_Rp>
+      { return ranges::data(__r_); }
+    _LIBCPP_HIDE_FROM_ABI constexpr auto data() const requires contiguous_range<const _Rp>
+      { return ranges::data(__r_); }
+  };
+  _LIBCPP_CTAD_SUPPORTED_FOR_TYPE(owning_view);
+
+  template<class _Tp>
+  inline constexpr bool enable_borrowed_range<owning_view<_Tp>> = enable_borrowed_range<_Tp>;
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_OWNING_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/range_adaptor.h b/app/src/main/cpp/libcxx/include/__ranges/range_adaptor.h
new file mode 100644
index 0000000..37e4817
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/range_adaptor.h
@@ -0,0 +1,77 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_RANGE_ADAPTOR_H
+#define _LIBCPP___RANGES_RANGE_ADAPTOR_H
+
+#include <__concepts/constructible.h>
+#include <__concepts/derived_from.h>
+#include <__concepts/invocable.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__functional/compose.h>
+#include <__functional/invoke.h>
+#include <__ranges/concepts.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// CRTP base that one can derive from in order to be considered a range adaptor closure
+// by the library. When deriving from this class, a pipe operator will be provided to
+// make the following hold:
+// - `x | f` is equivalent to `f(x)`
+// - `f1 | f2` is an adaptor closure `g` such that `g(x)` is equivalent to `f2(f1(x))`
+template <class _Tp>
+struct __range_adaptor_closure;
+
+// Type that wraps an arbitrary function object and makes it into a range adaptor closure,
+// i.e. something that can be called via the `x | f` notation.
+template <class _Fn>
+struct __range_adaptor_closure_t : _Fn, __range_adaptor_closure<__range_adaptor_closure_t<_Fn>> {
+    constexpr explicit __range_adaptor_closure_t(_Fn&& __f) : _Fn(std::move(__f)) { }
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(__range_adaptor_closure_t);
+
+template <class _Tp>
+concept _RangeAdaptorClosure = derived_from<remove_cvref_t<_Tp>, __range_adaptor_closure<remove_cvref_t<_Tp>>>;
+
+template <class _Tp>
+struct __range_adaptor_closure {
+    template <ranges::viewable_range _View, _RangeAdaptorClosure _Closure>
+        requires same_as<_Tp, remove_cvref_t<_Closure>> &&
+                 invocable<_Closure, _View>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    friend constexpr decltype(auto) operator|(_View&& __view, _Closure&& __closure)
+        noexcept(is_nothrow_invocable_v<_Closure, _View>)
+    { return std::invoke(std::forward<_Closure>(__closure), std::forward<_View>(__view)); }
+
+    template <_RangeAdaptorClosure _Closure, _RangeAdaptorClosure _OtherClosure>
+        requires same_as<_Tp, remove_cvref_t<_Closure>> &&
+                 constructible_from<decay_t<_Closure>, _Closure> &&
+                 constructible_from<decay_t<_OtherClosure>, _OtherClosure>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    friend constexpr auto operator|(_Closure&& __c1, _OtherClosure&& __c2)
+        noexcept(is_nothrow_constructible_v<decay_t<_Closure>, _Closure> &&
+                 is_nothrow_constructible_v<decay_t<_OtherClosure>, _OtherClosure>)
+    { return __range_adaptor_closure_t(std::__compose(std::forward<_OtherClosure>(__c2), std::forward<_Closure>(__c1))); }
+};
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_RANGE_ADAPTOR_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/rbegin.h b/app/src/main/cpp/libcxx/include/__ranges/rbegin.h
new file mode 100644
index 0000000..26b4732
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/rbegin.h
@@ -0,0 +1,131 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_RBEGIN_H
+#define _LIBCPP___RANGES_RBEGIN_H
+
+#include <__concepts/class_or_enum.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/readable_traits.h>
+#include <__iterator/reverse_iterator.h>
+#include <__ranges/access.h>
+#include <__utility/auto_cast.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [ranges.access.rbegin]
+
+namespace ranges {
+namespace __rbegin {
+template <class _Tp>
+concept __member_rbegin =
+  __can_borrow<_Tp> &&
+  __workaround_52970<_Tp> &&
+  requires(_Tp&& __t) {
+    { _LIBCPP_AUTO_CAST(__t.rbegin()) } -> input_or_output_iterator;
+  };
+
+void rbegin(auto&) = delete;
+void rbegin(const auto&) = delete;
+
+template <class _Tp>
+concept __unqualified_rbegin =
+  !__member_rbegin<_Tp> &&
+  __can_borrow<_Tp> &&
+  __class_or_enum<remove_cvref_t<_Tp>> &&
+  requires(_Tp&& __t) {
+    { _LIBCPP_AUTO_CAST(rbegin(__t)) } -> input_or_output_iterator;
+  };
+
+template <class _Tp>
+concept __can_reverse =
+  __can_borrow<_Tp> &&
+  !__member_rbegin<_Tp> &&
+  !__unqualified_rbegin<_Tp> &&
+  requires(_Tp&& __t) {
+    { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>;
+    { ranges::begin(__t) } -> bidirectional_iterator;
+  };
+
+struct __fn {
+  template <class _Tp>
+    requires __member_rbegin<_Tp>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
+    noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.rbegin())))
+  {
+    return _LIBCPP_AUTO_CAST(__t.rbegin());
+  }
+
+  template <class _Tp>
+    requires __unqualified_rbegin<_Tp>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
+    noexcept(noexcept(_LIBCPP_AUTO_CAST(rbegin(__t))))
+  {
+    return _LIBCPP_AUTO_CAST(rbegin(__t));
+  }
+
+  template <class _Tp>
+    requires __can_reverse<_Tp>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
+    noexcept(noexcept(ranges::end(__t)))
+  {
+    return std::make_reverse_iterator(ranges::end(__t));
+  }
+
+  void operator()(auto&&) const = delete;
+};
+} // namespace __rbegin
+
+inline namespace __cpo {
+  inline constexpr auto rbegin = __rbegin::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+// [range.access.crbegin]
+
+namespace ranges {
+namespace __crbegin {
+struct __fn {
+  template <class _Tp>
+    requires is_lvalue_reference_v<_Tp&&>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Tp&& __t) const
+    noexcept(noexcept(ranges::rbegin(static_cast<const remove_reference_t<_Tp>&>(__t))))
+    -> decltype(      ranges::rbegin(static_cast<const remove_reference_t<_Tp>&>(__t)))
+    { return          ranges::rbegin(static_cast<const remove_reference_t<_Tp>&>(__t)); }
+
+  template <class _Tp>
+    requires is_rvalue_reference_v<_Tp&&>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Tp&& __t) const
+    noexcept(noexcept(ranges::rbegin(static_cast<const _Tp&&>(__t))))
+    -> decltype(      ranges::rbegin(static_cast<const _Tp&&>(__t)))
+    { return          ranges::rbegin(static_cast<const _Tp&&>(__t)); }
+};
+} // namespace __crbegin
+
+inline namespace __cpo {
+  inline constexpr auto crbegin = __crbegin::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_RBEGIN_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/ref_view.h b/app/src/main/cpp/libcxx/include/__ranges/ref_view.h
new file mode 100644
index 0000000..1e5f746
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/ref_view.h
@@ -0,0 +1,88 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_REF_VIEW_H
+#define _LIBCPP___RANGES_REF_VIEW_H
+
+#include <__concepts/convertible_to.h>
+#include <__concepts/different_from.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/data.h>
+#include <__ranges/empty.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/size.h>
+#include <__ranges/view_interface.h>
+#include <__utility/forward.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+  template<range _Range>
+    requires is_object_v<_Range>
+  class ref_view : public view_interface<ref_view<_Range>> {
+    _Range *__range_;
+
+    static void __fun(_Range&);
+    static void __fun(_Range&&) = delete;
+
+public:
+    template<class _Tp>
+      requires __different_from<_Tp, ref_view> &&
+        convertible_to<_Tp, _Range&> && requires { __fun(std::declval<_Tp>()); }
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr ref_view(_Tp&& __t)
+      : __range_(std::addressof(static_cast<_Range&>(std::forward<_Tp>(__t))))
+    {}
+
+    _LIBCPP_HIDE_FROM_ABI constexpr _Range& base() const { return *__range_; }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_Range> begin() const { return ranges::begin(*__range_); }
+    _LIBCPP_HIDE_FROM_ABI constexpr sentinel_t<_Range> end() const { return ranges::end(*__range_); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr bool empty() const
+      requires requires { ranges::empty(*__range_); }
+    { return ranges::empty(*__range_); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto size() const
+      requires sized_range<_Range>
+    { return ranges::size(*__range_); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto data() const
+      requires contiguous_range<_Range>
+    { return ranges::data(*__range_); }
+  };
+
+  template<class _Range>
+  ref_view(_Range&) -> ref_view<_Range>;
+
+  template<class _Tp>
+  inline constexpr bool enable_borrowed_range<ref_view<_Tp>> = true;
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_REF_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/rend.h b/app/src/main/cpp/libcxx/include/__ranges/rend.h
new file mode 100644
index 0000000..d2987e9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/rend.h
@@ -0,0 +1,135 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_REND_H
+#define _LIBCPP___RANGES_REND_H
+
+#include <__concepts/class_or_enum.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/readable_traits.h>
+#include <__iterator/reverse_iterator.h>
+#include <__ranges/access.h>
+#include <__ranges/rbegin.h>
+#include <__utility/auto_cast.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+// [range.access.rend]
+
+namespace ranges {
+namespace __rend {
+template <class _Tp>
+concept __member_rend =
+  __can_borrow<_Tp> &&
+  __workaround_52970<_Tp> &&
+  requires(_Tp&& __t) {
+    ranges::rbegin(__t);
+    { _LIBCPP_AUTO_CAST(__t.rend()) } -> sentinel_for<decltype(ranges::rbegin(__t))>;
+  };
+
+void rend(auto&) = delete;
+void rend(const auto&) = delete;
+
+template <class _Tp>
+concept __unqualified_rend =
+  !__member_rend<_Tp> &&
+  __can_borrow<_Tp> &&
+  __class_or_enum<remove_cvref_t<_Tp>> &&
+  requires(_Tp&& __t) {
+    ranges::rbegin(__t);
+    { _LIBCPP_AUTO_CAST(rend(__t)) } -> sentinel_for<decltype(ranges::rbegin(__t))>;
+  };
+
+template <class _Tp>
+concept __can_reverse =
+  __can_borrow<_Tp> &&
+  !__member_rend<_Tp> &&
+  !__unqualified_rend<_Tp> &&
+  requires(_Tp&& __t) {
+    { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>;
+    { ranges::begin(__t) } -> bidirectional_iterator;
+  };
+
+class __fn {
+public:
+  template <class _Tp>
+    requires __member_rend<_Tp>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
+    noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.rend())))
+  {
+    return _LIBCPP_AUTO_CAST(__t.rend());
+  }
+
+  template <class _Tp>
+    requires __unqualified_rend<_Tp>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
+    noexcept(noexcept(_LIBCPP_AUTO_CAST(rend(__t))))
+  {
+    return _LIBCPP_AUTO_CAST(rend(__t));
+  }
+
+  template <class _Tp>
+    requires __can_reverse<_Tp>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
+    noexcept(noexcept(ranges::begin(__t)))
+  {
+    return std::make_reverse_iterator(ranges::begin(__t));
+  }
+
+  void operator()(auto&&) const = delete;
+};
+} // namespace __rend
+
+inline namespace __cpo {
+  inline constexpr auto rend = __rend::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+// [range.access.crend]
+
+namespace ranges {
+namespace __crend {
+struct __fn {
+  template <class _Tp>
+    requires is_lvalue_reference_v<_Tp&&>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Tp&& __t) const
+    noexcept(noexcept(ranges::rend(static_cast<const remove_reference_t<_Tp>&>(__t))))
+    -> decltype(      ranges::rend(static_cast<const remove_reference_t<_Tp>&>(__t)))
+    { return          ranges::rend(static_cast<const remove_reference_t<_Tp>&>(__t)); }
+
+  template <class _Tp>
+    requires is_rvalue_reference_v<_Tp&&>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Tp&& __t) const
+    noexcept(noexcept(ranges::rend(static_cast<const _Tp&&>(__t))))
+    -> decltype(      ranges::rend(static_cast<const _Tp&&>(__t)))
+    { return          ranges::rend(static_cast<const _Tp&&>(__t)); }
+};
+} // namespace __crend
+
+inline namespace __cpo {
+  inline constexpr auto crend = __crend::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_REND_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/reverse_view.h b/app/src/main/cpp/libcxx/include/__ranges/reverse_view.h
new file mode 100644
index 0000000..d7b1378
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/reverse_view.h
@@ -0,0 +1,191 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_REVERSE_VIEW_H
+#define _LIBCPP___RANGES_REVERSE_VIEW_H
+
+#include <__concepts/constructible.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/next.h>
+#include <__iterator/reverse_iterator.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/non_propagating_cache.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/size.h>
+#include <__ranges/subrange.h>
+#include <__ranges/view_interface.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+  template<view _View>
+    requires bidirectional_range<_View>
+  class reverse_view : public view_interface<reverse_view<_View>> {
+    // We cache begin() whenever ranges::next is not guaranteed O(1) to provide an
+    // amortized O(1) begin() method.
+    static constexpr bool _UseCache = !random_access_range<_View> && !common_range<_View>;
+    using _Cache = _If<_UseCache, __non_propagating_cache<reverse_iterator<iterator_t<_View>>>, __empty_cache>;
+    _LIBCPP_NO_UNIQUE_ADDRESS _Cache __cached_begin_ = _Cache();
+    _LIBCPP_NO_UNIQUE_ADDRESS _View __base_ = _View();
+
+  public:
+    _LIBCPP_HIDE_FROM_ABI
+    reverse_view() requires default_initializable<_View> = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit reverse_view(_View __view) : __base_(std::move(__view)) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _View base() const& requires copy_constructible<_View> { return __base_; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _View base() && { return std::move(__base_); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr reverse_iterator<iterator_t<_View>> begin() {
+      if constexpr (_UseCache)
+        if (__cached_begin_.__has_value())
+          return *__cached_begin_;
+
+      auto __tmp = std::make_reverse_iterator(ranges::next(ranges::begin(__base_), ranges::end(__base_)));
+      if constexpr (_UseCache)
+        __cached_begin_.__emplace(__tmp);
+      return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr reverse_iterator<iterator_t<_View>> begin() requires common_range<_View> {
+      return std::make_reverse_iterator(ranges::end(__base_));
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto begin() const requires common_range<const _View> {
+      return std::make_reverse_iterator(ranges::end(__base_));
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr reverse_iterator<iterator_t<_View>> end() {
+      return std::make_reverse_iterator(ranges::begin(__base_));
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto end() const requires common_range<const _View> {
+      return std::make_reverse_iterator(ranges::begin(__base_));
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto size() requires sized_range<_View> {
+      return ranges::size(__base_);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr auto size() const requires sized_range<const _View> {
+      return ranges::size(__base_);
+    }
+  };
+
+  template<class _Range>
+  reverse_view(_Range&&) -> reverse_view<views::all_t<_Range>>;
+
+  template<class _Tp>
+  inline constexpr bool enable_borrowed_range<reverse_view<_Tp>> = enable_borrowed_range<_Tp>;
+
+  namespace views {
+  namespace __reverse {
+    template<class _Tp>
+    inline constexpr bool __is_reverse_view = false;
+
+    template<class _Tp>
+    inline constexpr bool __is_reverse_view<reverse_view<_Tp>> = true;
+
+    template<class _Tp>
+    inline constexpr bool __is_sized_reverse_subrange = false;
+
+    template<class _Iter>
+    inline constexpr bool __is_sized_reverse_subrange<subrange<reverse_iterator<_Iter>, reverse_iterator<_Iter>, subrange_kind::sized>> = true;
+
+    template<class _Tp>
+    inline constexpr bool __is_unsized_reverse_subrange = false;
+
+    template<class _Iter, subrange_kind _Kind>
+    inline constexpr bool __is_unsized_reverse_subrange<subrange<reverse_iterator<_Iter>, reverse_iterator<_Iter>, _Kind>> = _Kind == subrange_kind::unsized;
+
+    template<class _Tp>
+    struct __unwrapped_reverse_subrange {
+      using type = void; // avoid SFINAE-ing out the overload below -- let the concept requirements do it for better diagnostics
+    };
+
+    template<class _Iter, subrange_kind _Kind>
+    struct __unwrapped_reverse_subrange<subrange<reverse_iterator<_Iter>, reverse_iterator<_Iter>, _Kind>> {
+      using type = subrange<_Iter, _Iter, _Kind>;
+    };
+
+    struct __fn : __range_adaptor_closure<__fn> {
+      template<class _Range>
+        requires __is_reverse_view<remove_cvref_t<_Range>>
+      [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+      constexpr auto operator()(_Range&& __range) const
+        noexcept(noexcept(std::forward<_Range>(__range).base()))
+        -> decltype(      std::forward<_Range>(__range).base())
+        { return          std::forward<_Range>(__range).base(); }
+
+      template<class _Range,
+               class _UnwrappedSubrange = typename __unwrapped_reverse_subrange<remove_cvref_t<_Range>>::type>
+        requires __is_sized_reverse_subrange<remove_cvref_t<_Range>>
+      [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+      constexpr auto operator()(_Range&& __range) const
+        noexcept(noexcept(_UnwrappedSubrange(__range.end().base(), __range.begin().base(), __range.size())))
+        -> decltype(      _UnwrappedSubrange(__range.end().base(), __range.begin().base(), __range.size()))
+        { return          _UnwrappedSubrange(__range.end().base(), __range.begin().base(), __range.size()); }
+
+      template<class _Range,
+               class _UnwrappedSubrange = typename __unwrapped_reverse_subrange<remove_cvref_t<_Range>>::type>
+        requires __is_unsized_reverse_subrange<remove_cvref_t<_Range>>
+      [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+      constexpr auto operator()(_Range&& __range) const
+        noexcept(noexcept(_UnwrappedSubrange(__range.end().base(), __range.begin().base())))
+        -> decltype(      _UnwrappedSubrange(__range.end().base(), __range.begin().base()))
+        { return          _UnwrappedSubrange(__range.end().base(), __range.begin().base()); }
+
+      template<class _Range>
+        requires (!__is_reverse_view<remove_cvref_t<_Range>> &&
+                  !__is_sized_reverse_subrange<remove_cvref_t<_Range>> &&
+                  !__is_unsized_reverse_subrange<remove_cvref_t<_Range>>)
+      [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+      constexpr auto operator()(_Range&& __range) const
+        noexcept(noexcept(reverse_view{std::forward<_Range>(__range)}))
+        -> decltype(      reverse_view{std::forward<_Range>(__range)})
+        { return          reverse_view{std::forward<_Range>(__range)}; }
+    };
+  } // namespace __reverse
+
+  inline namespace __cpo {
+    inline constexpr auto reverse = __reverse::__fn{};
+  } // namespace __cpo
+  } // namespace views
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_REVERSE_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/single_view.h b/app/src/main/cpp/libcxx/include/__ranges/single_view.h
new file mode 100644
index 0000000..5c4b918
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/single_view.h
@@ -0,0 +1,102 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_SINGLE_VIEW_H
+#define _LIBCPP___RANGES_SINGLE_VIEW_H
+
+#include <__concepts/constructible.h>
+#include <__config>
+#include <__ranges/copyable_box.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/view_interface.h>
+#include <__utility/forward.h>
+#include <__utility/in_place.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+  template<copy_constructible _Tp>
+    requires is_object_v<_Tp>
+  class single_view : public view_interface<single_view<_Tp>> {
+    __copyable_box<_Tp> __value_;
+
+  public:
+    _LIBCPP_HIDE_FROM_ABI
+    single_view() requires default_initializable<_Tp> = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit single_view(const _Tp& __t) : __value_(in_place, __t) {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit single_view(_Tp&& __t) : __value_(in_place, std::move(__t)) {}
+
+    template<class... _Args>
+      requires constructible_from<_Tp, _Args...>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr explicit single_view(in_place_t, _Args&&... __args)
+      : __value_{in_place, std::forward<_Args>(__args)...} {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Tp* begin() noexcept { return data(); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr const _Tp* begin() const noexcept { return data(); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Tp* end() noexcept { return data() + 1; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr const _Tp* end() const noexcept { return data() + 1; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    static constexpr size_t size() noexcept { return 1; }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Tp* data() noexcept { return __value_.operator->(); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr const _Tp* data() const noexcept { return __value_.operator->(); }
+  };
+
+template<class _Tp>
+single_view(_Tp) -> single_view<_Tp>;
+
+namespace views {
+namespace __single_view {
+
+struct __fn : __range_adaptor_closure<__fn> {
+  template<class _Range>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Range&& __range) const
+    noexcept(noexcept(single_view<decay_t<_Range&&>>(std::forward<_Range>(__range))))
+    -> decltype(      single_view<decay_t<_Range&&>>(std::forward<_Range>(__range)))
+    { return          single_view<decay_t<_Range&&>>(std::forward<_Range>(__range)); }
+};
+} // namespace __single_view
+
+inline namespace __cpo {
+  inline constexpr auto single = __single_view::__fn{};
+} // namespace __cpo
+
+} // namespace views
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_SINGLE_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/size.h b/app/src/main/cpp/libcxx/include/__ranges/size.h
new file mode 100644
index 0000000..0ac8d63
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/size.h
@@ -0,0 +1,148 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_SIZE_H
+#define _LIBCPP___RANGES_SIZE_H
+
+#include <__concepts/arithmetic.h>
+#include <__concepts/class_or_enum.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/access.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/make_signed.h>
+#include <__type_traits/make_unsigned.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/auto_cast.h>
+#include <__utility/declval.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+  template<class>
+  inline constexpr bool disable_sized_range = false;
+} // namespace ranges
+
+// [range.prim.size]
+
+namespace ranges {
+namespace __size {
+void size(auto&) = delete;
+void size(const auto&) = delete;
+
+template <class _Tp>
+concept __size_enabled = !disable_sized_range<remove_cvref_t<_Tp>>;
+
+template <class _Tp>
+concept __member_size =
+  __size_enabled<_Tp> &&
+  __workaround_52970<_Tp> &&
+  requires(_Tp&& __t) {
+    { _LIBCPP_AUTO_CAST(__t.size()) } -> __integer_like;
+  };
+
+template <class _Tp>
+concept __unqualified_size =
+  __size_enabled<_Tp> &&
+  !__member_size<_Tp> &&
+  __class_or_enum<remove_cvref_t<_Tp>> &&
+  requires(_Tp&& __t) {
+    { _LIBCPP_AUTO_CAST(size(__t)) } -> __integer_like;
+  };
+
+template <class _Tp>
+concept __difference =
+  !__member_size<_Tp> &&
+  !__unqualified_size<_Tp> &&
+  __class_or_enum<remove_cvref_t<_Tp>> &&
+  requires(_Tp&& __t) {
+    { ranges::begin(__t) } -> forward_iterator;
+    { ranges::end(__t) } -> sized_sentinel_for<decltype(ranges::begin(std::declval<_Tp>()))>;
+  };
+
+struct __fn {
+
+  // `[range.prim.size]`: the array case (for rvalues).
+  template <class _Tp, size_t _Sz>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr size_t operator()(_Tp (&&)[_Sz]) const noexcept {
+    return _Sz;
+  }
+
+  // `[range.prim.size]`: the array case (for lvalues).
+  template <class _Tp, size_t _Sz>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr size_t operator()(_Tp (&)[_Sz]) const noexcept {
+    return _Sz;
+  }
+
+  // `[range.prim.size]`: `auto(t.size())` is a valid expression.
+  template <__member_size _Tp>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr __integer_like auto operator()(_Tp&& __t) const
+      noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.size()))) {
+    return _LIBCPP_AUTO_CAST(__t.size());
+  }
+
+  // `[range.prim.size]`: `auto(size(t))` is a valid expression.
+  template <__unqualified_size _Tp>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr __integer_like auto operator()(_Tp&& __t) const
+      noexcept(noexcept(_LIBCPP_AUTO_CAST(size(__t)))) {
+    return _LIBCPP_AUTO_CAST(size(__t));
+  }
+
+  // [range.prim.size]: the `to-unsigned-like` case.
+  template <__difference _Tp>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
+    noexcept(noexcept(std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t))))
+    -> decltype(      std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t)))
+    { return          std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t));
+  }
+};
+
+} // namespace __size
+
+inline namespace __cpo {
+  inline constexpr auto size = __size::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+// [range.prim.ssize]
+
+namespace ranges {
+namespace __ssize {
+struct __fn {
+  template<class _Tp>
+    requires requires (_Tp&& __t) { ranges::size(__t); }
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr integral auto operator()(_Tp&& __t) const
+    noexcept(noexcept(ranges::size(__t))) {
+    using _Signed = make_signed_t<decltype(ranges::size(__t))>;
+    if constexpr (sizeof(ptrdiff_t) > sizeof(_Signed))
+      return static_cast<ptrdiff_t>(ranges::size(__t));
+    else
+      return static_cast<_Signed>(ranges::size(__t));
+  }
+};
+} // namespace __ssize
+
+inline namespace __cpo {
+  inline constexpr auto ssize = __ssize::__fn{};
+} // namespace __cpo
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_SIZE_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/split_view.h b/app/src/main/cpp/libcxx/include/__ranges/split_view.h
new file mode 100644
index 0000000..9758ee9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/split_view.h
@@ -0,0 +1,232 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_SPLIT_VIEW_H
+#define _LIBCPP___RANGES_SPLIT_VIEW_H
+
+#include <__algorithm/ranges_search.h>
+#include <__concepts/constructible.h>
+#include <__config>
+#include <__functional/bind_back.h>
+#include <__functional/ranges_operations.h>
+#include <__iterator/indirectly_comparable.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/empty.h>
+#include <__ranges/non_propagating_cache.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/single_view.h>
+#include <__ranges/subrange.h>
+#include <__ranges/view_interface.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_nothrow_constructible.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER >= 20
+
+namespace ranges {
+
+template <class _View, class _Pattern>
+struct __split_view_iterator;
+
+template <class _View, class _Pattern>
+struct __split_view_sentinel;
+
+template <forward_range _View, forward_range _Pattern>
+  requires view<_View> && view<_Pattern> &&
+           indirectly_comparable<iterator_t<_View>, iterator_t<_Pattern>, ranges::equal_to>
+class split_view : public view_interface<split_view<_View, _Pattern>> {
+private:
+  _LIBCPP_NO_UNIQUE_ADDRESS _View __base_       = _View();
+  _LIBCPP_NO_UNIQUE_ADDRESS _Pattern __pattern_ = _Pattern();
+  using _Cache                                  = __non_propagating_cache<subrange<iterator_t<_View>>>;
+  _Cache __cached_begin_                        = _Cache();
+
+  template <class, class>
+  friend struct __split_view_iterator;
+
+  template <class, class>
+  friend struct __split_view_sentinel;
+
+  using __iterator = __split_view_iterator<_View, _Pattern>;
+  using __sentinel = __split_view_sentinel<_View, _Pattern>;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr subrange<iterator_t<_View>> __find_next(iterator_t<_View> __it) {
+    auto [__begin, __end] = ranges::search(subrange(__it, ranges::end(__base_)), __pattern_);
+    if (__begin != ranges::end(__base_) && ranges::empty(__pattern_)) {
+      ++__begin;
+      ++__end;
+    }
+    return {__begin, __end};
+  }
+
+public:
+  _LIBCPP_HIDE_FROM_ABI split_view()
+    requires default_initializable<_View> && default_initializable<_Pattern>
+  = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr split_view(_View __base, _Pattern __pattern)
+      : __base_(std::move(__base)), __pattern_(std::move((__pattern))) {}
+
+  template <forward_range _Range>
+    requires constructible_from<_View, views::all_t<_Range>> &&
+                 constructible_from<_Pattern, single_view<range_value_t<_Range>>>
+  _LIBCPP_HIDE_FROM_ABI constexpr split_view(_Range&& __range, range_value_t<_Range> __elem)
+      : __base_(views::all(std::forward<_Range>(__range))), __pattern_(views::single(std::move(__elem))) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _View base() const&
+    requires copy_constructible<_View>
+  {
+    return __base_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _View base() && { return std::move(__base_); }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __iterator begin() {
+    if (!__cached_begin_.__has_value()) {
+      __cached_begin_.__emplace(__find_next(ranges::begin(__base_)));
+    }
+    return {*this, ranges::begin(__base_), *__cached_begin_};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto end() {
+    if constexpr (common_range<_View>) {
+      return __iterator{*this, ranges::end(__base_), {}};
+    } else {
+      return __sentinel{*this};
+    }
+  }
+};
+
+template <class _Range, class _Pattern>
+split_view(_Range&&, _Pattern&&) -> split_view<views::all_t<_Range>, views::all_t<_Pattern>>;
+
+template <forward_range _Range>
+split_view(_Range&&, range_value_t<_Range>) -> split_view<views::all_t<_Range>, single_view<range_value_t<_Range>>>;
+
+template <class _View, class _Pattern>
+struct __split_view_iterator {
+private:
+  split_view<_View, _Pattern>* __parent_                        = nullptr;
+  _LIBCPP_NO_UNIQUE_ADDRESS iterator_t<_View> __cur_            = iterator_t<_View>();
+  _LIBCPP_NO_UNIQUE_ADDRESS subrange<iterator_t<_View>> __next_ = subrange<iterator_t<_View>>();
+  bool __trailing_empty_                                        = false;
+
+  template <class, class>
+  friend struct __split_view_sentinel;
+
+public:
+  using iterator_concept  = forward_iterator_tag;
+  using iterator_category = input_iterator_tag;
+  using value_type        = subrange<iterator_t<_View>>;
+  using difference_type   = range_difference_t<_View>;
+
+  _LIBCPP_HIDE_FROM_ABI __split_view_iterator() = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __split_view_iterator(
+      split_view<_View, _Pattern>& __parent, iterator_t<_View> __current, subrange<iterator_t<_View>> __next)
+      : __parent_(std::addressof(__parent)), __cur_(std::move(__current)), __next_(std::move(__next)) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_View> base() const { return __cur_; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr value_type operator*() const { return {__cur_, __next_.begin()}; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __split_view_iterator& operator++() {
+    __cur_ = __next_.begin();
+    if (__cur_ != ranges::end(__parent_->__base_)) {
+      __cur_ = __next_.end();
+      if (__cur_ == ranges::end(__parent_->__base_)) {
+        __trailing_empty_ = true;
+        __next_           = {__cur_, __cur_};
+      } else {
+        __next_ = __parent_->__find_next(__cur_);
+      }
+    } else {
+      __trailing_empty_ = false;
+    }
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __split_view_iterator operator++(int) {
+    auto __tmp = *this;
+    ++*this;
+    return __tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator==(const __split_view_iterator& __x, const __split_view_iterator& __y) {
+    return __x.__cur_ == __y.__cur_ && __x.__trailing_empty_ == __y.__trailing_empty_;
+  }
+};
+
+template <class _View, class _Pattern>
+struct __split_view_sentinel {
+private:
+  _LIBCPP_NO_UNIQUE_ADDRESS sentinel_t<_View> __end_ = sentinel_t<_View>();
+
+  _LIBCPP_HIDE_FROM_ABI static constexpr bool
+  __equals(const __split_view_iterator<_View, _Pattern>& __x, const __split_view_sentinel& __y) {
+    return __x.__cur_ == __y.__end_ && !__x.__trailing_empty_;
+  }
+
+public:
+  _LIBCPP_HIDE_FROM_ABI __split_view_sentinel() = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit __split_view_sentinel(split_view<_View, _Pattern>& __parent)
+      : __end_(ranges::end(__parent.__base_)) {}
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator==(const __split_view_iterator<_View, _Pattern>& __x, const __split_view_sentinel& __y) {
+    return __equals(__x, __y);
+  }
+};
+
+namespace views {
+namespace __split_view {
+struct __fn : __range_adaptor_closure<__fn> {
+  // clang-format off
+  template <class _Range, class _Pattern>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Range&& __range, _Pattern&& __pattern) const
+    noexcept(noexcept(split_view(std::forward<_Range>(__range), std::forward<_Pattern>(__pattern))))
+    -> decltype(      split_view(std::forward<_Range>(__range), std::forward<_Pattern>(__pattern)))
+    { return          split_view(std::forward<_Range>(__range), std::forward<_Pattern>(__pattern)); }
+  // clang-format on
+
+  template <class _Pattern>
+    requires constructible_from<decay_t<_Pattern>, _Pattern>
+  _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Pattern&& __pattern) const
+      noexcept(is_nothrow_constructible_v<decay_t<_Pattern>, _Pattern>) {
+    return __range_adaptor_closure_t(std::__bind_back(*this, std::forward<_Pattern>(__pattern)));
+  }
+};
+} // namespace __split_view
+
+inline namespace __cpo {
+inline constexpr auto split = __split_view::__fn{};
+} // namespace __cpo
+} // namespace views
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_SPLIT_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/subrange.h b/app/src/main/cpp/libcxx/include/__ranges/subrange.h
new file mode 100644
index 0000000..2d9e4cc
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/subrange.h
@@ -0,0 +1,291 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_SUBRANGE_H
+#define _LIBCPP___RANGES_SUBRANGE_H
+
+#include <__assert>
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/copyable.h>
+#include <__concepts/derived_from.h>
+#include <__concepts/different_from.h>
+#include <__config>
+#include <__fwd/get.h>
+#include <__fwd/subrange.h>
+#include <__iterator/advance.h>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/dangling.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/size.h>
+#include <__ranges/view_interface.h>
+#include <__tuple_dir/pair_like.h>
+#include <__tuple_dir/tuple_element.h>
+#include <__tuple_dir/tuple_size.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_pointer.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/make_unsigned.h>
+#include <__type_traits/remove_const.h>
+#include <__type_traits/remove_pointer.h>
+#include <__utility/move.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+  template<class _From, class _To>
+  concept __uses_nonqualification_pointer_conversion =
+    is_pointer_v<_From> && is_pointer_v<_To> &&
+    !convertible_to<remove_pointer_t<_From>(*)[], remove_pointer_t<_To>(*)[]>;
+
+  template<class _From, class _To>
+  concept __convertible_to_non_slicing =
+    convertible_to<_From, _To> &&
+    !__uses_nonqualification_pointer_conversion<decay_t<_From>, decay_t<_To>>;
+
+  template<class _Pair, class _Iter, class _Sent>
+  concept __pair_like_convertible_from =
+    !range<_Pair> && __pair_like<_Pair> &&
+    constructible_from<_Pair, _Iter, _Sent> &&
+    __convertible_to_non_slicing<_Iter, tuple_element_t<0, _Pair>> &&
+    convertible_to<_Sent, tuple_element_t<1, _Pair>>;
+
+  template<input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent = _Iter,
+           subrange_kind _Kind = sized_sentinel_for<_Sent, _Iter>
+             ? subrange_kind::sized
+             : subrange_kind::unsized>
+    requires (_Kind == subrange_kind::sized || !sized_sentinel_for<_Sent, _Iter>)
+  class _LIBCPP_TEMPLATE_VIS subrange
+    : public view_interface<subrange<_Iter, _Sent, _Kind>>
+  {
+  public:
+    // Note: this is an internal implementation detail that is public only for internal usage.
+    static constexpr bool _StoreSize = (_Kind == subrange_kind::sized && !sized_sentinel_for<_Sent, _Iter>);
+
+  private:
+    static constexpr bool _MustProvideSizeAtConstruction = !_StoreSize; // just to improve compiler diagnostics
+    struct _Empty { constexpr _Empty(auto) noexcept { } };
+    using _Size = conditional_t<_StoreSize, make_unsigned_t<iter_difference_t<_Iter>>, _Empty>;
+    _LIBCPP_NO_UNIQUE_ADDRESS _Iter __begin_ = _Iter();
+    _LIBCPP_NO_UNIQUE_ADDRESS _Sent __end_ = _Sent();
+    _LIBCPP_NO_UNIQUE_ADDRESS _Size __size_ = 0;
+
+  public:
+    _LIBCPP_HIDE_FROM_ABI
+    subrange() requires default_initializable<_Iter> = default;
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr subrange(__convertible_to_non_slicing<_Iter> auto __iter, _Sent __sent)
+      requires _MustProvideSizeAtConstruction
+      : __begin_(std::move(__iter)), __end_(std::move(__sent))
+    { }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr subrange(__convertible_to_non_slicing<_Iter> auto __iter, _Sent __sent,
+                       make_unsigned_t<iter_difference_t<_Iter>> __n)
+      requires (_Kind == subrange_kind::sized)
+      : __begin_(std::move(__iter)), __end_(std::move(__sent)), __size_(__n)
+    {
+      if constexpr (sized_sentinel_for<_Sent, _Iter>)
+        _LIBCPP_ASSERT((__end_ - __begin_) == static_cast<iter_difference_t<_Iter>>(__n),
+          "std::ranges::subrange was passed an invalid size hint");
+    }
+
+    template<__different_from<subrange> _Range>
+      requires borrowed_range<_Range> &&
+               __convertible_to_non_slicing<iterator_t<_Range>, _Iter> &&
+               convertible_to<sentinel_t<_Range>, _Sent>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr subrange(_Range&& __range)
+      requires (!_StoreSize)
+      : subrange(ranges::begin(__range), ranges::end(__range))
+    { }
+
+    template<__different_from<subrange> _Range>
+      requires borrowed_range<_Range> &&
+               __convertible_to_non_slicing<iterator_t<_Range>, _Iter> &&
+               convertible_to<sentinel_t<_Range>, _Sent>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr subrange(_Range&& __range)
+      requires _StoreSize && sized_range<_Range>
+      : subrange(__range, ranges::size(__range))
+    { }
+
+    template<borrowed_range _Range>
+      requires __convertible_to_non_slicing<iterator_t<_Range>, _Iter> &&
+               convertible_to<sentinel_t<_Range>, _Sent>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr subrange(_Range&& __range, make_unsigned_t<iter_difference_t<_Iter>> __n)
+      requires (_Kind == subrange_kind::sized)
+      : subrange(ranges::begin(__range), ranges::end(__range), __n)
+    { }
+
+    template<__different_from<subrange> _Pair>
+      requires __pair_like_convertible_from<_Pair, const _Iter&, const _Sent&>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr operator _Pair() const {
+      return _Pair(__begin_, __end_);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Iter begin() const requires copyable<_Iter> {
+      return __begin_;
+    }
+
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Iter begin() requires (!copyable<_Iter>) {
+      return std::move(__begin_);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Sent end() const {
+      return __end_;
+    }
+
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool empty() const {
+      return __begin_ == __end_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr make_unsigned_t<iter_difference_t<_Iter>> size() const
+      requires (_Kind == subrange_kind::sized)
+    {
+      if constexpr (_StoreSize)
+        return __size_;
+      else
+        return std::__to_unsigned_like(__end_ - __begin_);
+    }
+
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr subrange next(iter_difference_t<_Iter> __n = 1) const&
+      requires forward_iterator<_Iter>
+    {
+      auto __tmp = *this;
+      __tmp.advance(__n);
+      return __tmp;
+    }
+
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr subrange next(iter_difference_t<_Iter> __n = 1) && {
+      advance(__n);
+      return std::move(*this);
+    }
+
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr subrange prev(iter_difference_t<_Iter> __n = 1) const
+      requires bidirectional_iterator<_Iter>
+    {
+      auto __tmp = *this;
+      __tmp.advance(-__n);
+      return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr subrange& advance(iter_difference_t<_Iter> __n) {
+      if constexpr (bidirectional_iterator<_Iter>) {
+        if (__n < 0) {
+          ranges::advance(__begin_, __n);
+          if constexpr (_StoreSize)
+            __size_ += std::__to_unsigned_like(-__n);
+          return *this;
+        }
+      }
+
+      auto __d = __n - ranges::advance(__begin_, __n, __end_);
+      if constexpr (_StoreSize)
+        __size_ -= std::__to_unsigned_like(__d);
+      return *this;
+    }
+  };
+
+  template<input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent>
+  subrange(_Iter, _Sent) -> subrange<_Iter, _Sent>;
+
+  template<input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent>
+  subrange(_Iter, _Sent, make_unsigned_t<iter_difference_t<_Iter>>)
+    -> subrange<_Iter, _Sent, subrange_kind::sized>;
+
+  template<borrowed_range _Range>
+  subrange(_Range&&) -> subrange<iterator_t<_Range>, sentinel_t<_Range>,
+                                 (sized_range<_Range> || sized_sentinel_for<sentinel_t<_Range>, iterator_t<_Range>>)
+                                   ? subrange_kind::sized : subrange_kind::unsized>;
+
+  template<borrowed_range _Range>
+  subrange(_Range&&, make_unsigned_t<range_difference_t<_Range>>)
+    -> subrange<iterator_t<_Range>, sentinel_t<_Range>, subrange_kind::sized>;
+
+  template<size_t _Index, class _Iter, class _Sent, subrange_kind _Kind>
+    requires ((_Index == 0 && copyable<_Iter>) || _Index == 1)
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto get(const subrange<_Iter, _Sent, _Kind>& __subrange) {
+    if constexpr (_Index == 0)
+      return __subrange.begin();
+    else
+      return __subrange.end();
+  }
+
+  template<size_t _Index, class _Iter, class _Sent, subrange_kind _Kind>
+    requires (_Index < 2)
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto get(subrange<_Iter, _Sent, _Kind>&& __subrange) {
+    if constexpr (_Index == 0)
+      return __subrange.begin();
+    else
+      return __subrange.end();
+  }
+
+  template<class _Ip, class _Sp, subrange_kind _Kp>
+  inline constexpr bool enable_borrowed_range<subrange<_Ip, _Sp, _Kp>> = true;
+
+  template<range _Rp>
+  using borrowed_subrange_t = _If<borrowed_range<_Rp>, subrange<iterator_t<_Rp>>, dangling>;
+} // namespace ranges
+
+// [range.subrange.general]
+
+using ranges::get;
+
+// [ranges.syn]
+
+template<class _Ip, class _Sp, ranges::subrange_kind _Kp>
+struct tuple_size<ranges::subrange<_Ip, _Sp, _Kp>> : integral_constant<size_t, 2> {};
+
+template<class _Ip, class _Sp, ranges::subrange_kind _Kp>
+struct tuple_element<0, ranges::subrange<_Ip, _Sp, _Kp>> {
+  using type = _Ip;
+};
+
+template<class _Ip, class _Sp, ranges::subrange_kind _Kp>
+struct tuple_element<1, ranges::subrange<_Ip, _Sp, _Kp>> {
+  using type = _Sp;
+};
+
+template<class _Ip, class _Sp, ranges::subrange_kind _Kp>
+struct tuple_element<0, const ranges::subrange<_Ip, _Sp, _Kp>> {
+  using type = _Ip;
+};
+
+template<class _Ip, class _Sp, ranges::subrange_kind _Kp>
+struct tuple_element<1, const ranges::subrange<_Ip, _Sp, _Kp>> {
+  using type = _Sp;
+};
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_SUBRANGE_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/take_view.h b/app/src/main/cpp/libcxx/include/__ranges/take_view.h
new file mode 100644
index 0000000..bea3862
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/take_view.h
@@ -0,0 +1,343 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_TAKE_VIEW_H
+#define _LIBCPP___RANGES_TAKE_VIEW_H
+
+#include <__algorithm/min.h>
+#include <__algorithm/ranges_min.h>
+#include <__assert>
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__functional/bind_back.h>
+#include <__fwd/span.h>
+#include <__fwd/string_view.h>
+#include <__iterator/concepts.h>
+#include <__iterator/counted_iterator.h>
+#include <__iterator/default_sentinel.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/empty_view.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/iota_view.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/size.h>
+#include <__ranges/subrange.h>
+#include <__ranges/view_interface.h>
+#include <__type_traits/maybe_const.h>
+#include <__utility/auto_cast.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+template<view _View>
+class take_view : public view_interface<take_view<_View>> {
+  _LIBCPP_NO_UNIQUE_ADDRESS _View __base_ = _View();
+  range_difference_t<_View> __count_ = 0;
+
+  template<bool> class __sentinel;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI
+  take_view() requires default_initializable<_View> = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr take_view(_View __base, range_difference_t<_View> __count)
+      : __base_(std::move(__base)), __count_(__count) {
+    _LIBCPP_ASSERT(__count >= 0, "count has to be greater than or equal to zero");
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _View base() const& requires copy_constructible<_View> { return __base_; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _View base() && { return std::move(__base_); }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto begin() requires (!__simple_view<_View>) {
+    if constexpr (sized_range<_View>) {
+      if constexpr (random_access_range<_View>) {
+        return ranges::begin(__base_);
+      } else {
+        using _DifferenceT = range_difference_t<_View>;
+        auto __size = size();
+        return counted_iterator(ranges::begin(__base_), static_cast<_DifferenceT>(__size));
+      }
+    } else {
+      return counted_iterator(ranges::begin(__base_), __count_);
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto begin() const requires range<const _View> {
+    if constexpr (sized_range<const _View>) {
+      if constexpr (random_access_range<const _View>) {
+        return ranges::begin(__base_);
+      } else {
+        using _DifferenceT = range_difference_t<const _View>;
+        auto __size = size();
+        return counted_iterator(ranges::begin(__base_), static_cast<_DifferenceT>(__size));
+      }
+    } else {
+      return counted_iterator(ranges::begin(__base_), __count_);
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto end() requires (!__simple_view<_View>) {
+    if constexpr (sized_range<_View>) {
+      if constexpr (random_access_range<_View>) {
+        return ranges::begin(__base_) + size();
+      } else {
+        return default_sentinel;
+      }
+    } else {
+      return __sentinel<false>{ranges::end(__base_)};
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto end() const requires range<const _View> {
+    if constexpr (sized_range<const _View>) {
+      if constexpr (random_access_range<const _View>) {
+        return ranges::begin(__base_) + size();
+      } else {
+        return default_sentinel;
+      }
+    } else {
+      return __sentinel<true>{ranges::end(__base_)};
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto size() requires sized_range<_View> {
+    auto __n = ranges::size(__base_);
+    return ranges::min(__n, static_cast<decltype(__n)>(__count_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto size() const requires sized_range<const _View> {
+    auto __n = ranges::size(__base_);
+    return ranges::min(__n, static_cast<decltype(__n)>(__count_));
+  }
+};
+
+template<view _View>
+template<bool _Const>
+class take_view<_View>::__sentinel {
+  using _Base = __maybe_const<_Const, _View>;
+  template<bool _OtherConst>
+  using _Iter = counted_iterator<iterator_t<__maybe_const<_OtherConst, _View>>>;
+  _LIBCPP_NO_UNIQUE_ADDRESS sentinel_t<_Base> __end_ = sentinel_t<_Base>();
+
+  template<bool>
+  friend class take_view<_View>::__sentinel;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI
+  __sentinel() = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr explicit __sentinel(sentinel_t<_Base> __end) : __end_(std::move(__end)) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __sentinel(__sentinel<!_Const> __s)
+    requires _Const && convertible_to<sentinel_t<_View>, sentinel_t<_Base>>
+    : __end_(std::move(__s.__end_)) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr sentinel_t<_Base> base() const { return __end_; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(const _Iter<_Const>& __lhs, const __sentinel& __rhs) {
+    return __lhs.count() == 0 || __lhs.base() == __rhs.__end_;
+  }
+
+  template<bool _OtherConst = !_Const>
+    requires sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(const _Iter<_Const>& __lhs, const __sentinel& __rhs) {
+    return __lhs.count() == 0 || __lhs.base() == __rhs.__end_;
+  }
+};
+
+template<class _Range>
+take_view(_Range&&, range_difference_t<_Range>) -> take_view<views::all_t<_Range>>;
+
+template<class _Tp>
+inline constexpr bool enable_borrowed_range<take_view<_Tp>> = enable_borrowed_range<_Tp>;
+
+namespace views {
+namespace __take {
+
+template <class _Tp>
+inline constexpr bool __is_empty_view = false;
+
+template <class _Tp>
+inline constexpr bool __is_empty_view<empty_view<_Tp>> = true;
+
+template <class _Tp>
+inline constexpr bool __is_passthrough_specialization = false;
+
+template <class _Tp, size_t _Extent>
+inline constexpr bool __is_passthrough_specialization<span<_Tp, _Extent>> = true;
+
+template <class _CharT, class _Traits>
+inline constexpr bool __is_passthrough_specialization<basic_string_view<_CharT, _Traits>> = true;
+
+template <class _Iter, class _Sent, subrange_kind _Kind>
+inline constexpr bool __is_passthrough_specialization<subrange<_Iter, _Sent, _Kind>> = true;
+
+template <class _Tp>
+inline constexpr bool __is_iota_specialization = false;
+
+template <class _Np, class _Bound>
+inline constexpr bool __is_iota_specialization<iota_view<_Np, _Bound>> = true;
+
+template <class _Tp>
+struct __passthrough_type;
+
+template <class _Tp, size_t _Extent>
+struct __passthrough_type<span<_Tp, _Extent>> {
+  using type = span<_Tp>;
+};
+
+template <class _CharT, class _Traits>
+struct __passthrough_type<basic_string_view<_CharT, _Traits>> {
+  using type = basic_string_view<_CharT, _Traits>;
+};
+
+template <class _Iter, class _Sent, subrange_kind _Kind>
+  requires requires{typename subrange<_Iter>;}
+struct __passthrough_type<subrange<_Iter, _Sent, _Kind>> {
+  using type = subrange<_Iter>;
+};
+
+template <class _Tp>
+using __passthrough_type_t = typename __passthrough_type<_Tp>::type;
+
+struct __fn {
+  // [range.take.overview]: the `empty_view` case.
+  template <class _Range, convertible_to<range_difference_t<_Range>> _Np>
+    requires __is_empty_view<remove_cvref_t<_Range>>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Range&& __range, _Np&&) const
+    noexcept(noexcept(_LIBCPP_AUTO_CAST(std::forward<_Range>(__range))))
+    -> decltype(      _LIBCPP_AUTO_CAST(std::forward<_Range>(__range)))
+    { return          _LIBCPP_AUTO_CAST(std::forward<_Range>(__range)); }
+
+  // [range.take.overview]: the `span | basic_string_view | subrange` case.
+  template <class _Range,
+            convertible_to<range_difference_t<_Range>> _Np,
+            class _RawRange = remove_cvref_t<_Range>,
+            class _Dist = range_difference_t<_Range>>
+    requires (!__is_empty_view<_RawRange> &&
+              random_access_range<_RawRange> &&
+              sized_range<_RawRange> &&
+              __is_passthrough_specialization<_RawRange>)
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Range&& __rng, _Np&& __n) const
+    noexcept(noexcept(__passthrough_type_t<_RawRange>(
+                              ranges::begin(__rng),
+                              ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))
+                              )))
+    -> decltype(      __passthrough_type_t<_RawRange>(
+                              // Note: deliberately not forwarding `__rng` to guard against double moves.
+                              ranges::begin(__rng),
+                              ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))
+                              ))
+    { return          __passthrough_type_t<_RawRange>(
+                              ranges::begin(__rng),
+                              ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))
+                              ); }
+
+  // [range.take.overview]: the `iota_view` case.
+  template <class _Range,
+            convertible_to<range_difference_t<_Range>> _Np,
+            class _RawRange = remove_cvref_t<_Range>,
+            class _Dist = range_difference_t<_Range>>
+    requires (!__is_empty_view<_RawRange> &&
+              random_access_range<_RawRange> &&
+              sized_range<_RawRange> &&
+              __is_iota_specialization<_RawRange>)
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Range&& __rng, _Np&& __n) const
+    noexcept(noexcept(ranges::iota_view(
+                              *ranges::begin(__rng),
+                              *ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))
+                              )))
+    -> decltype(      ranges::iota_view(
+                              // Note: deliberately not forwarding `__rng` to guard against double moves.
+                              *ranges::begin(__rng),
+                              *ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))
+                              ))
+    { return          ranges::iota_view(
+                              *ranges::begin(__rng),
+                              *ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))
+                              ); }
+
+  // [range.take.overview]: the "otherwise" case.
+  template <class _Range, convertible_to<range_difference_t<_Range>> _Np,
+            class _RawRange = remove_cvref_t<_Range>>
+    // Note: without specifically excluding the other cases, GCC sees this overload as ambiguous with the other
+    // overloads.
+    requires (!(__is_empty_view<_RawRange> ||
+               (__is_iota_specialization<_RawRange> &&
+                sized_range<_RawRange> &&
+                random_access_range<_RawRange>) ||
+               (__is_passthrough_specialization<_RawRange> &&
+                sized_range<_RawRange> &&
+                random_access_range<_RawRange>)
+             ))
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Range&& __range, _Np&& __n) const
+    noexcept(noexcept(take_view(std::forward<_Range>(__range), std::forward<_Np>(__n))))
+    -> decltype(      take_view(std::forward<_Range>(__range), std::forward<_Np>(__n)))
+    { return          take_view(std::forward<_Range>(__range), std::forward<_Np>(__n)); }
+
+  template <class _Np>
+    requires constructible_from<decay_t<_Np>, _Np>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator()(_Np&& __n) const
+    noexcept(is_nothrow_constructible_v<decay_t<_Np>, _Np>)
+  { return __range_adaptor_closure_t(std::__bind_back(*this, std::forward<_Np>(__n))); }
+};
+
+} // namespace __take
+
+inline namespace __cpo {
+  inline constexpr auto take = __take::__fn{};
+} // namespace __cpo
+} // namespace views
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANGES_TAKE_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/take_while_view.h b/app/src/main/cpp/libcxx/include/__ranges/take_while_view.h
new file mode 100644
index 0000000..59c0a4f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/take_while_view.h
@@ -0,0 +1,183 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_TAKE_WHILE_VIEW_H
+#define _LIBCPP___RANGES_TAKE_WHILE_VIEW_H
+
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__config>
+#include <__functional/bind_back.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__memory/addressof.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/copyable_box.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/view_interface.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_nothrow_constructible.h>
+#include <__type_traits/is_object.h>
+#include <__type_traits/maybe_const.h>
+#include <__utility/forward.h>
+#include <__utility/in_place.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER >= 20
+
+namespace ranges {
+
+// The spec uses the unnamed requirement inside the `begin` and `end` member functions:
+//     constexpr auto begin() const
+//       requires range<const V> && indirect_unary_predicate<const Pred, iterator_t<const V>>
+// However, due to a clang-14 and clang-15 bug, the above produces a hard error when `const V` is not a range.
+// The workaround is to create a named concept and use the concept instead.
+// As of take_while_view is implemented, the clang-trunk has already fixed the bug.
+// It is OK to remove the workaround once our CI no longer uses clang-14, clang-15 based compilers,
+// because we don't actually expect a lot of vendors to ship a new libc++ with an old clang.
+template <class _View, class _Pred>
+concept __take_while_const_is_range =
+    range<const _View> && indirect_unary_predicate<const _Pred, iterator_t<const _View>>;
+
+template <class, class, bool>
+class __take_while_view_sentinel;
+
+template <view _View, class _Pred>
+  requires input_range<_View> && is_object_v<_Pred> && indirect_unary_predicate<const _Pred, iterator_t<_View>>
+class take_while_view : public view_interface<take_while_view<_View, _Pred>> {
+  template <class, class, bool>
+  friend class __take_while_view_sentinel;
+
+  template <bool _Const>
+  using __sentinel = __take_while_view_sentinel<_View, _Pred, _Const>;
+
+  _LIBCPP_NO_UNIQUE_ADDRESS _View __base_ = _View();
+  _LIBCPP_NO_UNIQUE_ADDRESS __copyable_box<_Pred> __pred_;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI take_while_view()
+    requires default_initializable<_View> && default_initializable<_Pred>
+  = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr take_while_view(_View __base, _Pred __pred)
+      : __base_(std::move(__base)), __pred_(std::in_place, std::move(__pred)) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _View base() const&
+    requires copy_constructible<_View>
+  {
+    return __base_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr _View base() && { return std::move(__base_); }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr const _Pred& pred() const { return *__pred_; }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto begin()
+    requires(!__simple_view<_View>)
+  {
+    return ranges::begin(__base_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto begin() const
+    requires __take_while_const_is_range<_View, _Pred>
+  {
+    return ranges::begin(__base_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto end()
+    requires(!__simple_view<_View>)
+  {
+    return __sentinel</*_Const=*/false>(ranges::end(__base_), std::addressof(*__pred_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI constexpr auto end() const
+    requires __take_while_const_is_range<_View, _Pred>
+  {
+    return __sentinel</*_Const=*/true>(ranges::end(__base_), std::addressof(*__pred_));
+  }
+};
+
+template <class _Range, class _Pred>
+take_while_view(_Range&&, _Pred) -> take_while_view<views::all_t<_Range>, _Pred>;
+
+template <class _View, class _Pred, bool _Const>
+class __take_while_view_sentinel {
+  using _Base = __maybe_const<_Const, _View>;
+
+  sentinel_t<_Base> __end_ = sentinel_t<_Base>();
+  const _Pred* __pred_     = nullptr;
+
+  template <class, class, bool>
+  friend class __take_while_view_sentinel;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI __take_while_view_sentinel() = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr explicit __take_while_view_sentinel(sentinel_t<_Base> __end, const _Pred* __pred)
+      : __end_(std::move(__end)), __pred_(__pred) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr __take_while_view_sentinel(__take_while_view_sentinel<_View, _Pred, !_Const> __s)
+    requires _Const && convertible_to<sentinel_t<_View>, sentinel_t<_Base>>
+      : __end_(std::move(__s.__end_)), __pred_(__s.__pred_) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr sentinel_t<_Base> base() const { return __end_; }
+
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator==(const iterator_t<_Base>& __x, const __take_while_view_sentinel& __y) {
+    return __x == __y.__end_ || !std::invoke(*__y.__pred_, *__x);
+  }
+
+  template <bool _OtherConst = !_Const>
+    requires sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool
+  operator==(const iterator_t<__maybe_const<_OtherConst, _View>>& __x, const __take_while_view_sentinel& __y) {
+    return __x == __y.__end_ || !std::invoke(*__y.__pred_, *__x);
+  }
+};
+
+namespace views {
+namespace __take_while {
+
+struct __fn {
+  template <class _Range, class _Pred>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Range&& __range, _Pred&& __pred) const
+      noexcept(noexcept(/**/ take_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred))))
+          -> decltype(/*--*/ take_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred))) {
+    return /*-------------*/ take_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred));
+  }
+
+  template <class _Pred>
+    requires constructible_from<decay_t<_Pred>, _Pred>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Pred&& __pred) const
+      noexcept(is_nothrow_constructible_v<decay_t<_Pred>, _Pred>) {
+    return __range_adaptor_closure_t(std::__bind_back(*this, std::forward<_Pred>(__pred)));
+  }
+};
+
+} // namespace __take_while
+
+inline namespace __cpo {
+inline constexpr auto take_while = __take_while::__fn{};
+} // namespace __cpo
+} // namespace views
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_TAKE_WHILE_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/transform_view.h b/app/src/main/cpp/libcxx/include/__ranges/transform_view.h
new file mode 100644
index 0000000..66d9e80
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/transform_view.h
@@ -0,0 +1,467 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_TRANSFORM_VIEW_H
+#define _LIBCPP___RANGES_TRANSFORM_VIEW_H
+
+#include <__compare/three_way_comparable.h>
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/copyable.h>
+#include <__concepts/derived_from.h>
+#include <__concepts/equality_comparable.h>
+#include <__concepts/invocable.h>
+#include <__config>
+#include <__functional/bind_back.h>
+#include <__functional/invoke.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/copyable_box.h>
+#include <__ranges/empty.h>
+#include <__ranges/range_adaptor.h>
+#include <__ranges/size.h>
+#include <__ranges/view_interface.h>
+#include <__type_traits/maybe_const.h>
+#include <__utility/forward.h>
+#include <__utility/in_place.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+template<class _Fn, class _View>
+concept __regular_invocable_with_range_ref =
+  regular_invocable<_Fn, range_reference_t<_View>>;
+
+template<class _View, class _Fn>
+concept __transform_view_constraints =
+  view<_View> && is_object_v<_Fn> &&
+  regular_invocable<_Fn&, range_reference_t<_View>> &&
+  __can_reference<invoke_result_t<_Fn&, range_reference_t<_View>>>;
+
+template <input_range _View, copy_constructible _Function, bool _IsConst>
+  requires __transform_view_constraints<_View, _Function>
+class __transform_view_iterator;
+
+template <input_range _View, copy_constructible _Function, bool _IsConst>
+  requires __transform_view_constraints<_View, _Function>
+class __transform_view_sentinel;
+
+template<input_range _View, copy_constructible _Fn>
+  requires __transform_view_constraints<_View, _Fn>
+class transform_view : public view_interface<transform_view<_View, _Fn>> {
+
+  template <bool _IsConst>
+  using __iterator = __transform_view_iterator<_View, _Fn, _IsConst>;
+
+  template <bool _IsConst>
+  using __sentinel = __transform_view_sentinel<_View, _Fn, _IsConst>;
+
+  template <input_range _ViewType, copy_constructible _FunctionType, bool _IsConst>
+    requires __transform_view_constraints<_ViewType, _FunctionType>
+  friend class __transform_view_iterator;
+
+  template <input_range _ViewType, copy_constructible _FunctionType, bool _IsConst>
+    requires __transform_view_constraints<_ViewType, _FunctionType>
+  friend class __transform_view_sentinel;
+
+  _LIBCPP_NO_UNIQUE_ADDRESS __copyable_box<_Fn> __func_;
+  _LIBCPP_NO_UNIQUE_ADDRESS _View __base_ = _View();
+
+public:
+  _LIBCPP_HIDE_FROM_ABI
+  transform_view()
+    requires default_initializable<_View> && default_initializable<_Fn> = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr transform_view(_View __base, _Fn __func)
+    : __func_(std::in_place, std::move(__func)), __base_(std::move(__base)) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _View base() const& requires copy_constructible<_View> { return __base_; }
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _View base() && { return std::move(__base_); }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __iterator<false> begin() {
+    return __iterator<false>{*this, ranges::begin(__base_)};
+  }
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __iterator<true> begin() const
+    requires range<const _View> &&
+             __regular_invocable_with_range_ref<const _Fn&, const _View>
+  {
+    return __iterator<true>(*this, ranges::begin(__base_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __sentinel<false> end() {
+    return __sentinel<false>(ranges::end(__base_));
+  }
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __iterator<false> end()
+    requires common_range<_View>
+  {
+    return __iterator<false>(*this, ranges::end(__base_));
+  }
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __sentinel<true> end() const
+    requires range<const _View> &&
+             __regular_invocable_with_range_ref<const _Fn&, const _View>
+  {
+    return __sentinel<true>(ranges::end(__base_));
+  }
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __iterator<true> end() const
+    requires common_range<const _View> &&
+             __regular_invocable_with_range_ref<const _Fn&, const _View>
+  {
+    return __iterator<true>(*this, ranges::end(__base_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto size() requires sized_range<_View> { return ranges::size(__base_); }
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto size() const requires sized_range<const _View> { return ranges::size(__base_); }
+};
+
+template<class _Range, class _Fn>
+transform_view(_Range&&, _Fn) -> transform_view<views::all_t<_Range>, _Fn>;
+
+template<class _View>
+struct __transform_view_iterator_concept { using type = input_iterator_tag; };
+
+template<random_access_range _View>
+struct __transform_view_iterator_concept<_View> { using type = random_access_iterator_tag; };
+
+template<bidirectional_range _View>
+struct __transform_view_iterator_concept<_View> { using type = bidirectional_iterator_tag; };
+
+template<forward_range _View>
+struct __transform_view_iterator_concept<_View> { using type = forward_iterator_tag; };
+
+template<class, class>
+struct __transform_view_iterator_category_base {};
+
+template<forward_range _View, class _Fn>
+struct __transform_view_iterator_category_base<_View, _Fn> {
+  using _Cat = typename iterator_traits<iterator_t<_View>>::iterator_category;
+
+  using iterator_category = conditional_t<
+    is_lvalue_reference_v<invoke_result_t<_Fn&, range_reference_t<_View>>>,
+    conditional_t<
+      derived_from<_Cat, contiguous_iterator_tag>,
+      random_access_iterator_tag,
+      _Cat
+    >,
+    input_iterator_tag
+  >;
+};
+
+template<input_range _View, copy_constructible _Fn, bool _Const>
+  requires __transform_view_constraints<_View, _Fn>
+class __transform_view_iterator
+  : public __transform_view_iterator_category_base<_View, _Fn> {
+
+  using _Parent = __maybe_const<_Const, transform_view<_View, _Fn>>;
+  using _Base = __maybe_const<_Const, _View>;
+
+  _Parent *__parent_ = nullptr;
+
+  template<input_range _ViewType, copy_constructible _FunctionType, bool _IsConst>
+    requires __transform_view_constraints<_ViewType, _FunctionType>
+  friend class __transform_view_iterator;
+
+  template<input_range _ViewType, copy_constructible _FunctionType, bool _IsConst>
+    requires __transform_view_constraints<_ViewType, _FunctionType>
+  friend class __transform_view_sentinel;
+
+public:
+  iterator_t<_Base> __current_ = iterator_t<_Base>();
+
+  using iterator_concept = typename __transform_view_iterator_concept<_View>::type;
+  using value_type = remove_cvref_t<invoke_result_t<_Fn&, range_reference_t<_Base>>>;
+  using difference_type = range_difference_t<_Base>;
+
+  _LIBCPP_HIDE_FROM_ABI
+  __transform_view_iterator() requires default_initializable<iterator_t<_Base>> = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __transform_view_iterator(_Parent& __parent, iterator_t<_Base> __current)
+    : __parent_(std::addressof(__parent)), __current_(std::move(__current)) {}
+
+  // Note: `__i` should always be `__transform_view_iterator<false>`, but directly using
+  // `__transform_view_iterator<false>` is ill-formed when `_Const` is false
+  // (see http://wg21.link/class.copy.ctor#5).
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __transform_view_iterator(__transform_view_iterator<_View, _Fn, !_Const> __i)
+    requires _Const && convertible_to<iterator_t<_View>, iterator_t<_Base>>
+    : __parent_(__i.__parent_), __current_(std::move(__i.__current_)) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr const iterator_t<_Base>& base() const& noexcept {
+    return __current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr iterator_t<_Base> base() && {
+    return std::move(__current_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr decltype(auto) operator*() const
+    noexcept(noexcept(std::invoke(*__parent_->__func_, *__current_)))
+  {
+    return std::invoke(*__parent_->__func_, *__current_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __transform_view_iterator& operator++() {
+    ++__current_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr void operator++(int) { ++__current_; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __transform_view_iterator operator++(int)
+    requires forward_range<_Base>
+  {
+    auto __tmp = *this;
+    ++*this;
+    return __tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __transform_view_iterator& operator--()
+    requires bidirectional_range<_Base>
+  {
+    --__current_;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __transform_view_iterator operator--(int)
+    requires bidirectional_range<_Base>
+  {
+    auto __tmp = *this;
+    --*this;
+    return __tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __transform_view_iterator& operator+=(difference_type __n)
+    requires random_access_range<_Base>
+  {
+    __current_ += __n;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __transform_view_iterator& operator-=(difference_type __n)
+    requires random_access_range<_Base>
+  {
+    __current_ -= __n;
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr decltype(auto) operator[](difference_type __n) const
+    noexcept(noexcept(std::invoke(*__parent_->__func_, __current_[__n])))
+    requires random_access_range<_Base>
+  {
+    return std::invoke(*__parent_->__func_, __current_[__n]);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(const __transform_view_iterator& __x, const __transform_view_iterator& __y)
+    requires equality_comparable<iterator_t<_Base>>
+  {
+    return __x.__current_ == __y.__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator<(const __transform_view_iterator& __x, const __transform_view_iterator& __y)
+    requires random_access_range<_Base>
+  {
+    return __x.__current_ < __y.__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator>(const __transform_view_iterator& __x, const __transform_view_iterator& __y)
+    requires random_access_range<_Base>
+  {
+    return __x.__current_ > __y.__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator<=(const __transform_view_iterator& __x, const __transform_view_iterator& __y)
+    requires random_access_range<_Base>
+  {
+    return __x.__current_ <= __y.__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator>=(const __transform_view_iterator& __x, const __transform_view_iterator& __y)
+    requires random_access_range<_Base>
+  {
+    return __x.__current_ >= __y.__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr auto operator<=>(const __transform_view_iterator& __x, const __transform_view_iterator& __y)
+    requires random_access_range<_Base> && three_way_comparable<iterator_t<_Base>>
+  {
+    return __x.__current_ <=> __y.__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr __transform_view_iterator operator+(__transform_view_iterator __i, difference_type __n)
+    requires random_access_range<_Base>
+  {
+    return __transform_view_iterator{*__i.__parent_, __i.__current_ + __n};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr __transform_view_iterator operator+(difference_type __n, __transform_view_iterator __i)
+    requires random_access_range<_Base>
+  {
+    return __transform_view_iterator{*__i.__parent_, __i.__current_ + __n};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr __transform_view_iterator operator-(__transform_view_iterator __i, difference_type __n)
+    requires random_access_range<_Base>
+  {
+    return __transform_view_iterator{*__i.__parent_, __i.__current_ - __n};
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr difference_type operator-(const __transform_view_iterator& __x, const __transform_view_iterator& __y)
+    requires sized_sentinel_for<iterator_t<_Base>, iterator_t<_Base>>
+  {
+    return __x.__current_ - __y.__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr decltype(auto) iter_move(const __transform_view_iterator& __i)
+    noexcept(noexcept(*__i))
+  {
+    if constexpr (is_lvalue_reference_v<decltype(*__i)>)
+      return std::move(*__i);
+    else
+      return *__i;
+  }
+};
+
+template<input_range _View, copy_constructible _Fn, bool _Const>
+  requires __transform_view_constraints<_View, _Fn>
+class __transform_view_sentinel {
+  using _Parent = __maybe_const<_Const, transform_view<_View, _Fn>>;
+  using _Base = __maybe_const<_Const, _View>;
+
+  template <bool _IsConst>
+  using __iterator = __transform_view_iterator<_View, _Fn, _IsConst>;
+
+  sentinel_t<_Base> __end_ = sentinel_t<_Base>();
+
+  template<input_range _ViewType, copy_constructible _FunctionType, bool _IsConst>
+    requires __transform_view_constraints<_ViewType, _FunctionType>
+  friend class __transform_view_iterator;
+
+  template<input_range _ViewType, copy_constructible _FunctionType, bool _IsConst>
+    requires __transform_view_constraints<_ViewType, _FunctionType>
+  friend class __transform_view_sentinel;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI
+  __transform_view_sentinel() = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr explicit __transform_view_sentinel(sentinel_t<_Base> __end) : __end_(__end) {}
+
+  // Note: `__i` should always be `__transform_view_sentinel<false>`, but directly using
+  // `__transform_view_sentinel<false>` is ill-formed when `_Const` is false
+  // (see http://wg21.link/class.copy.ctor#5).
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __transform_view_sentinel(__transform_view_sentinel<_View, _Fn, !_Const> __i)
+    requires _Const && convertible_to<sentinel_t<_View>, sentinel_t<_Base>>
+    : __end_(std::move(__i.__end_)) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr sentinel_t<_Base> base() const { return __end_; }
+
+  template<bool _OtherConst>
+    requires sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(const __iterator<_OtherConst>& __x, const __transform_view_sentinel& __y) {
+    return __x.__current_ == __y.__end_;
+  }
+
+  template<bool _OtherConst>
+    requires sized_sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr range_difference_t<__maybe_const<_OtherConst, _View>>
+  operator-(const __iterator<_OtherConst>& __x, const __transform_view_sentinel& __y) {
+    return __x.__current_ - __y.__end_;
+  }
+
+  template<bool _OtherConst>
+    requires sized_sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr range_difference_t<__maybe_const<_OtherConst, _View>>
+  operator-(const __transform_view_sentinel& __x, const __iterator<_OtherConst>& __y) {
+    return __x.__end_ - __y.__current_;
+  }
+};
+
+namespace views {
+namespace __transform {
+  struct __fn {
+    template<class _Range, class _Fn>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Range&& __range, _Fn&& __f) const
+      noexcept(noexcept(transform_view(std::forward<_Range>(__range), std::forward<_Fn>(__f))))
+      -> decltype(      transform_view(std::forward<_Range>(__range), std::forward<_Fn>(__f)))
+      { return          transform_view(std::forward<_Range>(__range), std::forward<_Fn>(__f)); }
+
+    template<class _Fn>
+      requires constructible_from<decay_t<_Fn>, _Fn>
+    [[nodiscard]] _LIBCPP_HIDE_FROM_ABI
+    constexpr auto operator()(_Fn&& __f) const
+      noexcept(is_nothrow_constructible_v<decay_t<_Fn>, _Fn>)
+    { return __range_adaptor_closure_t(std::__bind_back(*this, std::forward<_Fn>(__f))); }
+  };
+} // namespace __transform
+
+inline namespace __cpo {
+  inline constexpr auto transform = __transform::__fn{};
+} // namespace __cpo
+} // namespace views
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_TRANSFORM_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/view_interface.h b/app/src/main/cpp/libcxx/include/__ranges/view_interface.h
new file mode 100644
index 0000000..5581eb9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/view_interface.h
@@ -0,0 +1,177 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_VIEW_INTERFACE_H
+#define _LIBCPP___RANGES_VIEW_INTERFACE_H
+
+#include <__assert>
+#include <__concepts/derived_from.h>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/prev.h>
+#include <__memory/pointer_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/concepts.h>
+#include <__ranges/empty.h>
+#include <__type_traits/is_class.h>
+#include <__type_traits/make_unsigned.h>
+#include <__type_traits/remove_cv.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+template<class _Derived>
+  requires is_class_v<_Derived> && same_as<_Derived, remove_cv_t<_Derived>>
+class view_interface {
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _Derived& __derived() noexcept {
+    static_assert(sizeof(_Derived) && derived_from<_Derived, view_interface> && view<_Derived>);
+    return static_cast<_Derived&>(*this);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr _Derived const& __derived() const noexcept {
+    static_assert(sizeof(_Derived) && derived_from<_Derived, view_interface> && view<_Derived>);
+    return static_cast<_Derived const&>(*this);
+  }
+
+public:
+  template<class _D2 = _Derived>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool empty()
+    requires forward_range<_D2>
+  {
+    return ranges::begin(__derived()) == ranges::end(__derived());
+  }
+
+  template<class _D2 = _Derived>
+  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool empty() const
+    requires forward_range<const _D2>
+  {
+    return ranges::begin(__derived()) == ranges::end(__derived());
+  }
+
+  template<class _D2 = _Derived>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr explicit operator bool()
+    requires requires (_D2& __t) { ranges::empty(__t); }
+  {
+    return !ranges::empty(__derived());
+  }
+
+  template<class _D2 = _Derived>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr explicit operator bool() const
+    requires requires (const _D2& __t) { ranges::empty(__t); }
+  {
+    return !ranges::empty(__derived());
+  }
+
+  template<class _D2 = _Derived>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto data()
+    requires contiguous_iterator<iterator_t<_D2>>
+  {
+    return std::to_address(ranges::begin(__derived()));
+  }
+
+  template<class _D2 = _Derived>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto data() const
+    requires range<const _D2> && contiguous_iterator<iterator_t<const _D2>>
+  {
+    return std::to_address(ranges::begin(__derived()));
+  }
+
+  template<class _D2 = _Derived>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto size()
+    requires forward_range<_D2> && sized_sentinel_for<sentinel_t<_D2>, iterator_t<_D2>>
+  {
+    return std::__to_unsigned_like(ranges::end(__derived()) - ranges::begin(__derived()));
+  }
+
+  template<class _D2 = _Derived>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto size() const
+    requires forward_range<const _D2> && sized_sentinel_for<sentinel_t<const _D2>, iterator_t<const _D2>>
+  {
+    return std::__to_unsigned_like(ranges::end(__derived()) - ranges::begin(__derived()));
+  }
+
+  template<class _D2 = _Derived>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr decltype(auto) front()
+    requires forward_range<_D2>
+  {
+    _LIBCPP_ASSERT(!empty(),
+        "Precondition `!empty()` not satisfied. `.front()` called on an empty view.");
+    return *ranges::begin(__derived());
+  }
+
+  template<class _D2 = _Derived>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr decltype(auto) front() const
+    requires forward_range<const _D2>
+  {
+    _LIBCPP_ASSERT(!empty(),
+        "Precondition `!empty()` not satisfied. `.front()` called on an empty view.");
+    return *ranges::begin(__derived());
+  }
+
+  template<class _D2 = _Derived>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr decltype(auto) back()
+    requires bidirectional_range<_D2> && common_range<_D2>
+  {
+    _LIBCPP_ASSERT(!empty(),
+        "Precondition `!empty()` not satisfied. `.back()` called on an empty view.");
+    return *ranges::prev(ranges::end(__derived()));
+  }
+
+  template<class _D2 = _Derived>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr decltype(auto) back() const
+    requires bidirectional_range<const _D2> && common_range<const _D2>
+  {
+    _LIBCPP_ASSERT(!empty(),
+        "Precondition `!empty()` not satisfied. `.back()` called on an empty view.");
+    return *ranges::prev(ranges::end(__derived()));
+  }
+
+  template<random_access_range _RARange = _Derived>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr decltype(auto) operator[](range_difference_t<_RARange> __index)
+  {
+    return ranges::begin(__derived())[__index];
+  }
+
+  template<random_access_range _RARange = const _Derived>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr decltype(auto) operator[](range_difference_t<_RARange> __index) const
+  {
+    return ranges::begin(__derived())[__index];
+  }
+};
+
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_VIEW_INTERFACE_H
diff --git a/app/src/main/cpp/libcxx/include/__ranges/views.h b/app/src/main/cpp/libcxx/include/__ranges/views.h
new file mode 100644
index 0000000..d40c64a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/views.h
@@ -0,0 +1,35 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_VIEWS
+#define _LIBCPP___RANGES_VIEWS
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+namespace ranges {
+
+namespace views { }
+
+} // namespace ranges
+
+namespace views = ranges::views;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___RANGES_VIEWS
diff --git a/app/src/main/cpp/libcxx/include/__ranges/zip_view.h b/app/src/main/cpp/libcxx/include/__ranges/zip_view.h
new file mode 100644
index 0000000..5624726
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__ranges/zip_view.h
@@ -0,0 +1,512 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___RANGES_ZIP_VIEW_H
+#define _LIBCPP___RANGES_ZIP_VIEW_H
+
+#include <__config>
+
+#include <__algorithm/ranges_min.h>
+#include <__compare/three_way_comparable.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/equality_comparable.h>
+#include <__functional/invoke.h>
+#include <__functional/operations.h>
+#include <__iterator/concepts.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iter_swap.h>
+#include <__iterator/iterator_traits.h>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/concepts.h>
+#include <__ranges/empty_view.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/size.h>
+#include <__ranges/view_interface.h>
+#include <__utility/forward.h>
+#include <__utility/integer_sequence.h>
+#include <__utility/move.h>
+#include <tuple>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 20
+
+namespace ranges {
+
+template <class... _Ranges>
+concept __zip_is_common = (sizeof...(_Ranges) == 1 && (common_range<_Ranges> && ...)) ||
+                          (!(bidirectional_range<_Ranges> && ...) && (common_range<_Ranges> && ...)) ||
+                          ((random_access_range<_Ranges> && ...) && (sized_range<_Ranges> && ...));
+
+template <typename _Tp, typename _Up>
+auto __tuple_or_pair_test() -> pair<_Tp, _Up>;
+
+template <typename... _Types>
+  requires(sizeof...(_Types) != 2)
+auto __tuple_or_pair_test() -> tuple<_Types...>;
+
+template <class... _Types>
+using __tuple_or_pair = decltype(__tuple_or_pair_test<_Types...>());
+
+template <class _Fun, class _Tuple>
+_LIBCPP_HIDE_FROM_ABI constexpr auto __tuple_transform(_Fun&& __f, _Tuple&& __tuple) {
+  return std::apply(
+      [&]<class... _Types>(_Types&&... __elements) {
+        return __tuple_or_pair<invoke_result_t<_Fun&, _Types>...>(
+            std::invoke(__f, std::forward<_Types>(__elements))...);
+      },
+      std::forward<_Tuple>(__tuple));
+}
+
+template <class _Fun, class _Tuple>
+_LIBCPP_HIDE_FROM_ABI constexpr void __tuple_for_each(_Fun&& __f, _Tuple&& __tuple) {
+  std::apply(
+      [&]<class... _Types>(_Types&&... __elements) { (std::invoke(__f, std::forward<_Types>(__elements)), ...); },
+      std::forward<_Tuple>(__tuple));
+}
+
+template <class _Fun, class _Tuple1, class _Tuple2, size_t... _Indices>
+_LIBCPP_HIDE_FROM_ABI constexpr __tuple_or_pair<
+    invoke_result_t<_Fun&, typename tuple_element<_Indices, remove_cvref_t<_Tuple1>>::type,
+                    typename tuple_element<_Indices, remove_cvref_t<_Tuple2>>::type>...>
+__tuple_zip_transform(_Fun&& __f, _Tuple1&& __tuple1, _Tuple2&& __tuple2, index_sequence<_Indices...>) {
+  return {std::invoke(__f, std::get<_Indices>(std::forward<_Tuple1>(__tuple1)),
+                      std::get<_Indices>(std::forward<_Tuple2>(__tuple2)))...};
+}
+
+template <class _Fun, class _Tuple1, class _Tuple2>
+_LIBCPP_HIDE_FROM_ABI constexpr auto __tuple_zip_transform(_Fun&& __f, _Tuple1&& __tuple1, _Tuple2&& __tuple2) {
+  return ranges::__tuple_zip_transform(__f, std::forward<_Tuple1>(__tuple1), std::forward<_Tuple2>(__tuple2),
+                                       std::make_index_sequence<tuple_size<remove_cvref_t<_Tuple1>>::value>());
+}
+
+template <class _Fun, class _Tuple1, class _Tuple2, size_t... _Indices>
+_LIBCPP_HIDE_FROM_ABI constexpr void __tuple_zip_for_each(_Fun&& __f, _Tuple1&& __tuple1, _Tuple2&& __tuple2,
+                                                          index_sequence<_Indices...>) {
+  (std::invoke(__f, std::get<_Indices>(std::forward<_Tuple1>(__tuple1)),
+               std::get<_Indices>(std::forward<_Tuple2>(__tuple2))),
+   ...);
+}
+
+template <class _Fun, class _Tuple1, class _Tuple2>
+_LIBCPP_HIDE_FROM_ABI constexpr auto __tuple_zip_for_each(_Fun&& __f, _Tuple1&& __tuple1, _Tuple2&& __tuple2) {
+  return ranges::__tuple_zip_for_each(__f, std::forward<_Tuple1>(__tuple1), std::forward<_Tuple2>(__tuple2),
+                                      std::make_index_sequence<tuple_size<remove_cvref_t<_Tuple1>>::value>());
+}
+
+template <class _Tuple1, class _Tuple2>
+_LIBCPP_HIDE_FROM_ABI constexpr bool __tuple_any_equals(const _Tuple1& __tuple1, const _Tuple2& __tuple2) {
+  const auto __equals = ranges::__tuple_zip_transform(std::equal_to<>(), __tuple1, __tuple2);
+  return std::apply([](auto... __bools) { return (__bools || ...); }, __equals);
+}
+
+// abs in cstdlib is not constexpr
+// TODO : remove __abs once P0533R9 is implemented.
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr _Tp __abs(_Tp __t) {
+  return __t < 0 ? -__t : __t;
+}
+
+template <input_range... _Views>
+  requires(view<_Views> && ...) && (sizeof...(_Views) > 0)
+class zip_view : public view_interface<zip_view<_Views...>> {
+
+  _LIBCPP_NO_UNIQUE_ADDRESS tuple<_Views...> __views_;
+
+  template <bool>
+  class __iterator;
+
+  template <bool>
+  class __sentinel;
+
+public:
+  _LIBCPP_HIDE_FROM_ABI
+  zip_view() = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr explicit zip_view(_Views... __views) : __views_(std::move(__views)...) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto begin()
+    requires(!(__simple_view<_Views> && ...)) {
+    return __iterator<false>(ranges::__tuple_transform(ranges::begin, __views_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto begin() const
+    requires(range<const _Views> && ...) {
+    return __iterator<true>(ranges::__tuple_transform(ranges::begin, __views_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto end()
+    requires(!(__simple_view<_Views> && ...)) {
+    if constexpr (!__zip_is_common<_Views...>) {
+      return __sentinel<false>(ranges::__tuple_transform(ranges::end, __views_));
+    } else if constexpr ((random_access_range<_Views> && ...)) {
+      return begin() + iter_difference_t<__iterator<false>>(size());
+    } else {
+      return __iterator<false>(ranges::__tuple_transform(ranges::end, __views_));
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto end() const
+    requires(range<const _Views> && ...) {
+    if constexpr (!__zip_is_common<const _Views...>) {
+      return __sentinel<true>(ranges::__tuple_transform(ranges::end, __views_));
+    } else if constexpr ((random_access_range<const _Views> && ...)) {
+      return begin() + iter_difference_t<__iterator<true>>(size());
+    } else {
+      return __iterator<true>(ranges::__tuple_transform(ranges::end, __views_));
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto size()
+    requires(sized_range<_Views> && ...) {
+    return std::apply(
+        [](auto... __sizes) {
+          using _CT = make_unsigned_t<common_type_t<decltype(__sizes)...>>;
+          return ranges::min({_CT(__sizes)...});
+        },
+        ranges::__tuple_transform(ranges::size, __views_));
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto size() const
+    requires(sized_range<const _Views> && ...) {
+    return std::apply(
+        [](auto... __sizes) {
+          using _CT = make_unsigned_t<common_type_t<decltype(__sizes)...>>;
+          return ranges::min({_CT(__sizes)...});
+        },
+        ranges::__tuple_transform(ranges::size, __views_));
+  }
+};
+
+template <class... _Ranges>
+zip_view(_Ranges&&...) -> zip_view<views::all_t<_Ranges>...>;
+
+template <bool _Const, class... _Views>
+concept __zip_all_random_access = (random_access_range<__maybe_const<_Const, _Views>> && ...);
+
+template <bool _Const, class... _Views>
+concept __zip_all_bidirectional = (bidirectional_range<__maybe_const<_Const, _Views>> && ...);
+
+template <bool _Const, class... _Views>
+concept __zip_all_forward = (forward_range<__maybe_const<_Const, _Views>> && ...);
+
+template <bool _Const, class... _Views>
+consteval auto __get_zip_view_iterator_tag() {
+  if constexpr (__zip_all_random_access<_Const, _Views...>) {
+    return random_access_iterator_tag();
+  } else if constexpr (__zip_all_bidirectional<_Const, _Views...>) {
+    return bidirectional_iterator_tag();
+  } else if constexpr (__zip_all_forward<_Const, _Views...>) {
+    return forward_iterator_tag();
+  } else {
+    return input_iterator_tag();
+  }
+}
+
+template <bool _Const, class... _Views>
+struct __zip_view_iterator_category_base {};
+
+template <bool _Const, class... _Views>
+  requires __zip_all_forward<_Const, _Views...>
+struct __zip_view_iterator_category_base<_Const, _Views...> {
+  using iterator_category = input_iterator_tag;
+};
+
+template <input_range... _Views>
+  requires(view<_Views> && ...) && (sizeof...(_Views) > 0)
+template <bool _Const>
+class zip_view<_Views...>::__iterator : public __zip_view_iterator_category_base<_Const, _Views...> {
+
+  __tuple_or_pair<iterator_t<__maybe_const<_Const, _Views>>...> __current_;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr explicit __iterator(__tuple_or_pair<iterator_t<__maybe_const<_Const, _Views>>...> __current)
+      : __current_(std::move(__current)) {}
+
+  template <bool>
+  friend class zip_view<_Views...>::__iterator;
+
+  template <bool>
+  friend class zip_view<_Views...>::__sentinel;
+
+  friend class zip_view<_Views...>;
+
+public:
+  using iterator_concept = decltype(__get_zip_view_iterator_tag<_Const, _Views...>());
+  using value_type = __tuple_or_pair<range_value_t<__maybe_const<_Const, _Views>>...>;
+  using difference_type = common_type_t<range_difference_t<__maybe_const<_Const, _Views>>...>;
+
+  _LIBCPP_HIDE_FROM_ABI
+  __iterator() = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __iterator(__iterator<!_Const> __i)
+    requires _Const && (convertible_to<iterator_t<_Views>, iterator_t<__maybe_const<_Const, _Views>>> && ...)
+  : __current_(std::move(__i.__current_)) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator*() const {
+    return ranges::__tuple_transform([](auto& __i) -> decltype(auto) { return *__i; }, __current_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __iterator& operator++() {
+    ranges::__tuple_for_each([](auto& __i) { ++__i; }, __current_);
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr void operator++(int) { ++*this; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __iterator operator++(int)
+    requires __zip_all_forward<_Const, _Views...> {
+    auto __tmp = *this;
+    ++*this;
+    return __tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __iterator& operator--()
+    requires __zip_all_bidirectional<_Const, _Views...> {
+    ranges::__tuple_for_each([](auto& __i) { --__i; }, __current_);
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __iterator operator--(int)
+    requires __zip_all_bidirectional<_Const, _Views...> {
+    auto __tmp = *this;
+    --*this;
+    return __tmp;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __iterator& operator+=(difference_type __x)
+    requires __zip_all_random_access<_Const, _Views...> {
+    ranges::__tuple_for_each([&]<class _Iter>(_Iter& __i) { __i += iter_difference_t<_Iter>(__x); }, __current_);
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __iterator& operator-=(difference_type __x)
+    requires __zip_all_random_access<_Const, _Views...> {
+    ranges::__tuple_for_each([&]<class _Iter>(_Iter& __i) { __i -= iter_difference_t<_Iter>(__x); }, __current_);
+    return *this;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto operator[](difference_type __n) const
+    requires __zip_all_random_access<_Const, _Views...> {
+    return ranges::__tuple_transform(
+        [&]<class _Iter>(_Iter& __i) -> decltype(auto) { return __i[iter_difference_t<_Iter>(__n)]; }, __current_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator==(const __iterator& __x, const __iterator& __y)
+    requires(equality_comparable<iterator_t<__maybe_const<_Const, _Views>>> && ...) {
+    if constexpr (__zip_all_bidirectional<_Const, _Views...>) {
+      return __x.__current_ == __y.__current_;
+    } else {
+      return ranges::__tuple_any_equals(__x.__current_, __y.__current_);
+    }
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator<(const __iterator& __x, const __iterator& __y)
+    requires __zip_all_random_access<_Const, _Views...> {
+    return __x.__current_ < __y.__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator>(const __iterator& __x, const __iterator& __y)
+    requires __zip_all_random_access<_Const, _Views...> {
+    return __y < __x;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator<=(const __iterator& __x, const __iterator& __y)
+    requires __zip_all_random_access<_Const, _Views...> {
+    return !(__y < __x);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr bool operator>=(const __iterator& __x, const __iterator& __y)
+    requires __zip_all_random_access<_Const, _Views...> {
+    return !(__x < __y);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr auto operator<=>(const __iterator& __x, const __iterator& __y)
+    requires __zip_all_random_access<_Const, _Views...> &&
+             (three_way_comparable<iterator_t<__maybe_const<_Const, _Views>>> && ...) {
+    return __x.__current_ <=> __y.__current_;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr __iterator operator+(const __iterator& __i, difference_type __n)
+    requires __zip_all_random_access<_Const, _Views...> {
+    auto __r = __i;
+    __r += __n;
+    return __r;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr __iterator operator+(difference_type __n, const __iterator& __i)
+    requires __zip_all_random_access<_Const, _Views...> {
+    return __i + __n;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr __iterator operator-(const __iterator& __i, difference_type __n)
+    requires __zip_all_random_access<_Const, _Views...> {
+    auto __r = __i;
+    __r -= __n;
+    return __r;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr difference_type operator-(const __iterator& __x, const __iterator& __y)
+    requires(sized_sentinel_for<iterator_t<__maybe_const<_Const, _Views>>, iterator_t<__maybe_const<_Const, _Views>>> &&
+             ...) {
+    const auto __diffs = ranges::__tuple_zip_transform(minus<>(), __x.__current_, __y.__current_);
+    return std::apply(
+        [](auto... __ds) {
+          return ranges::min({difference_type(__ds)...},
+                             [](auto __a, auto __b) { return ranges::__abs(__a) < ranges::__abs(__b); });
+        },
+        __diffs);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr auto iter_move(const __iterator& __i) noexcept(
+      (noexcept(ranges::iter_move(std::declval<const iterator_t<__maybe_const<_Const, _Views>>&>())) && ...) &&
+      (is_nothrow_move_constructible_v<range_rvalue_reference_t<__maybe_const<_Const, _Views>>> && ...)) {
+    return ranges::__tuple_transform(ranges::iter_move, __i.__current_);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  friend constexpr void iter_swap(const __iterator& __l, const __iterator& __r) noexcept(
+      (noexcept(ranges::iter_swap(std::declval<const iterator_t<__maybe_const<_Const, _Views>>&>(),
+                                  std::declval<const iterator_t<__maybe_const<_Const, _Views>>&>())) &&
+       ...))
+    requires(indirectly_swappable<iterator_t<__maybe_const<_Const, _Views>>> && ...) {
+    ranges::__tuple_zip_for_each(ranges::iter_swap, __l.__current_, __r.__current_);
+  }
+};
+
+template <input_range... _Views>
+  requires(view<_Views> && ...) && (sizeof...(_Views) > 0)
+template <bool _Const>
+class zip_view<_Views...>::__sentinel {
+
+  __tuple_or_pair<sentinel_t<__maybe_const<_Const, _Views>>...> __end_;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr explicit __sentinel(__tuple_or_pair<sentinel_t<__maybe_const<_Const, _Views>>...> __end) : __end_(__end) {}
+
+  friend class zip_view<_Views...>;
+
+  // hidden friend cannot access private member of iterator because they are friends of friends
+  template <bool _OtherConst>
+  _LIBCPP_HIDE_FROM_ABI static constexpr decltype(auto)
+  __iter_current(zip_view<_Views...>::__iterator<_OtherConst> const& __it) {
+    return (__it.__current_);
+  }
+
+public:
+  _LIBCPP_HIDE_FROM_ABI
+  __sentinel() = default;
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __sentinel(__sentinel<!_Const> __i)
+    requires _Const && (convertible_to<sentinel_t<_Views>, sentinel_t<__maybe_const<_Const, _Views>>> && ...)
+  : __end_(std::move(__i.__end_)) {}
+
+  template <bool _OtherConst>
+    requires(sentinel_for<sentinel_t<__maybe_const<_Const, _Views>>, iterator_t<__maybe_const<_OtherConst, _Views>>> &&
+             ...)
+  _LIBCPP_HIDE_FROM_ABI friend constexpr bool operator==(const __iterator<_OtherConst>& __x, const __sentinel& __y) {
+    return ranges::__tuple_any_equals(__iter_current(__x), __y.__end_);
+  }
+
+  template <bool _OtherConst>
+    requires(
+        sized_sentinel_for<sentinel_t<__maybe_const<_Const, _Views>>, iterator_t<__maybe_const<_OtherConst, _Views>>> &&
+        ...)
+  _LIBCPP_HIDE_FROM_ABI friend constexpr common_type_t<range_difference_t<__maybe_const<_OtherConst, _Views>>...>
+  operator-(const __iterator<_OtherConst>& __x, const __sentinel& __y) {
+    const auto __diffs = ranges::__tuple_zip_transform(minus<>(), __iter_current(__x), __y.__end_);
+    return std::apply(
+        [](auto... __ds) {
+          using _Diff = common_type_t<range_difference_t<__maybe_const<_OtherConst, _Views>>...>;
+          return ranges::min({_Diff(__ds)...},
+                             [](auto __a, auto __b) { return ranges::__abs(__a) < ranges::__abs(__b); });
+        },
+        __diffs);
+  }
+
+  template <bool _OtherConst>
+    requires(
+        sized_sentinel_for<sentinel_t<__maybe_const<_Const, _Views>>, iterator_t<__maybe_const<_OtherConst, _Views>>> &&
+        ...)
+  _LIBCPP_HIDE_FROM_ABI friend constexpr common_type_t<range_difference_t<__maybe_const<_OtherConst, _Views>>...>
+  operator-(const __sentinel& __y, const __iterator<_OtherConst>& __x) {
+    return -(__x - __y);
+  }
+};
+
+template <class... _Views>
+inline constexpr bool enable_borrowed_range<zip_view<_Views...>> = (enable_borrowed_range<_Views> && ...);
+
+namespace views {
+namespace __zip {
+
+struct __fn {
+  _LIBCPP_HIDE_FROM_ABI constexpr auto operator()() const noexcept { return empty_view<tuple<>>{}; }
+
+  template <class... _Ranges>
+  _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Ranges&&... __rs) const
+      noexcept(noexcept(zip_view<all_t<_Ranges&&>...>(std::forward<_Ranges>(__rs)...)))
+          -> decltype(zip_view<all_t<_Ranges&&>...>(std::forward<_Ranges>(__rs)...)) {
+    return zip_view<all_t<_Ranges>...>(std::forward<_Ranges>(__rs)...);
+  }
+};
+
+} // namespace __zip
+inline namespace __cpo {
+  inline constexpr auto zip = __zip::__fn{};
+} // namespace __cpo
+} // namespace views
+} // namespace ranges
+
+#endif // _LIBCPP_STD_VER > 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___RANGES_ZIP_VIEW_H
diff --git a/app/src/main/cpp/libcxx/include/__split_buffer b/app/src/main/cpp/libcxx/include/__split_buffer
new file mode 100644
index 0000000..7d0beda
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__split_buffer
@@ -0,0 +1,656 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SPLIT_BUFFER
+#define _LIBCPP___SPLIT_BUFFER
+
+#include <__algorithm/max.h>
+#include <__algorithm/move.h>
+#include <__algorithm/move_backward.h>
+#include <__config>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/move_iterator.h>
+#include <__memory/allocate_at_least.h>
+#include <__memory/allocator.h>
+#include <__memory/allocator_traits.h>
+#include <__memory/compressed_pair.h>
+#include <__memory/pointer_traits.h>
+#include <__memory/swap_allocator.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// __split_buffer allocates a contiguous chunk of memory and stores objects in the range [__begin_, __end_).
+// It has uninitialized memory in the ranges  [__first_, __begin_) and [__end_, __end_cap_.first()). That allows
+// it to grow both in the front and back without having to move the data.
+
+template <class _Tp, class _Allocator = allocator<_Tp> >
+struct __split_buffer
+{
+private:
+    __split_buffer(const __split_buffer&);
+    __split_buffer& operator=(const __split_buffer&);
+public:
+    typedef _Tp                                             value_type;
+    typedef _Allocator                                      allocator_type;
+    typedef __libcpp_remove_reference_t<allocator_type>     __alloc_rr;
+    typedef allocator_traits<__alloc_rr>                    __alloc_traits;
+    typedef value_type&                                     reference;
+    typedef const value_type&                               const_reference;
+    typedef typename __alloc_traits::size_type              size_type;
+    typedef typename __alloc_traits::difference_type        difference_type;
+    typedef typename __alloc_traits::pointer                pointer;
+    typedef typename __alloc_traits::const_pointer          const_pointer;
+    typedef pointer                                         iterator;
+    typedef const_pointer                                   const_iterator;
+
+    pointer                                         __first_;
+    pointer                                         __begin_;
+    pointer                                         __end_;
+    __compressed_pair<pointer, allocator_type> __end_cap_;
+
+    typedef __add_lvalue_reference_t<allocator_type> __alloc_ref;
+    typedef __add_lvalue_reference_t<allocator_type> __alloc_const_ref;
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __alloc_rr&           __alloc() _NOEXCEPT         {return __end_cap_.second();}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const __alloc_rr&     __alloc() const _NOEXCEPT   {return __end_cap_.second();}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI pointer&              __end_cap() _NOEXCEPT       {return __end_cap_.first();}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const pointer&        __end_cap() const _NOEXCEPT {return __end_cap_.first();}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    __split_buffer()
+        _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    explicit __split_buffer(__alloc_rr& __a);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    explicit __split_buffer(const __alloc_rr& __a);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __split_buffer(size_type __cap, size_type __start, __alloc_rr& __a);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI ~__split_buffer();
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __split_buffer(__split_buffer&& __c)
+        _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __split_buffer(__split_buffer&& __c, const __alloc_rr& __a);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __split_buffer& operator=(__split_buffer&& __c)
+        _NOEXCEPT_((__alloc_traits::propagate_on_container_move_assignment::value &&
+                is_nothrow_move_assignable<allocator_type>::value) ||
+               !__alloc_traits::propagate_on_container_move_assignment::value);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI       iterator begin() _NOEXCEPT       {return __begin_;}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT {return __begin_;}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI       iterator end() _NOEXCEPT         {return __end_;}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT   {return __end_;}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void clear() _NOEXCEPT
+        {__destruct_at_end(__begin_);}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type size() const {return static_cast<size_type>(__end_ - __begin_);}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI bool empty()     const {return __end_ == __begin_;}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type capacity() const {return static_cast<size_type>(__end_cap() - __first_);}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type __front_spare() const {return static_cast<size_type>(__begin_ - __first_);}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type __back_spare() const {return static_cast<size_type>(__end_cap() - __end_);}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI       reference front()       {return *__begin_;}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference front() const {return *__begin_;}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI       reference back()        {return *(__end_ - 1);}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference back() const  {return *(__end_ - 1);}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void reserve(size_type __n);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void shrink_to_fit() _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void push_front(const_reference __x);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void push_back(const_reference __x);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void push_front(value_type&& __x);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void push_back(value_type&& __x);
+    template <class... _Args>
+        _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void emplace_back(_Args&&... __args);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void pop_front() {__destruct_at_begin(__begin_+1);}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void pop_back() {__destruct_at_end(__end_-1);}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __construct_at_end(size_type __n);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __construct_at_end(size_type __n, const_reference __x);
+    template <class _InputIter>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __enable_if_t<__is_exactly_cpp17_input_iterator<_InputIter>::value>
+        __construct_at_end(_InputIter __first, _InputIter __last);
+    template <class _ForwardIterator>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI __enable_if_t<__is_cpp17_forward_iterator<_ForwardIterator>::value>
+        __construct_at_end(_ForwardIterator __first, _ForwardIterator __last);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __destruct_at_begin(pointer __new_begin)
+        {__destruct_at_begin(__new_begin, is_trivially_destructible<value_type>());}
+        _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+        void __destruct_at_begin(pointer __new_begin, false_type);
+        _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+        void __destruct_at_begin(pointer __new_begin, true_type);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void __destruct_at_end(pointer __new_last) _NOEXCEPT
+        {__destruct_at_end(__new_last, false_type());}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+        void __destruct_at_end(pointer __new_last, false_type) _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+        void __destruct_at_end(pointer __new_last, true_type) _NOEXCEPT;
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void swap(__split_buffer& __x)
+        _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value||
+                   __is_nothrow_swappable<__alloc_rr>::value);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI bool __invariants() const;
+
+private:
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void __move_assign_alloc(__split_buffer& __c, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
+        {
+            __alloc() = _VSTD::move(__c.__alloc());
+        }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void __move_assign_alloc(__split_buffer&, false_type) _NOEXCEPT
+        {}
+
+    struct _ConstructTransaction {
+      _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI explicit _ConstructTransaction(pointer* __p, size_type __n) _NOEXCEPT
+      : __pos_(*__p), __end_(*__p + __n), __dest_(__p) {
+      }
+      _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI ~_ConstructTransaction() {
+        *__dest_ = __pos_;
+      }
+      pointer __pos_;
+     const pointer __end_;
+    private:
+     pointer *__dest_;
+    };
+};
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+__split_buffer<_Tp, _Allocator>::__invariants() const
+{
+    if (__first_ == nullptr)
+    {
+        if (__begin_ != nullptr)
+            return false;
+        if (__end_ != nullptr)
+            return false;
+        if (__end_cap() != nullptr)
+            return false;
+    }
+    else
+    {
+        if (__begin_ < __first_)
+            return false;
+        if (__end_ < __begin_)
+            return false;
+        if (__end_cap() < __end_)
+            return false;
+    }
+    return true;
+}
+
+//  Default constructs __n objects starting at __end_
+//  throws if construction throws
+//  Precondition:  __n > 0
+//  Precondition:  size() + __n <= capacity()
+//  Postcondition:  size() == size() + __n
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__split_buffer<_Tp, _Allocator>::__construct_at_end(size_type __n)
+{
+    _ConstructTransaction __tx(&this->__end_, __n);
+    for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_) {
+        __alloc_traits::construct(this->__alloc(), _VSTD::__to_address(__tx.__pos_));
+    }
+}
+
+//  Copy constructs __n objects starting at __end_ from __x
+//  throws if construction throws
+//  Precondition:  __n > 0
+//  Precondition:  size() + __n <= capacity()
+//  Postcondition:  size() == old size() + __n
+//  Postcondition:  [i] == __x for all i in [size() - __n, __n)
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__split_buffer<_Tp, _Allocator>::__construct_at_end(size_type __n, const_reference __x)
+{
+    _ConstructTransaction __tx(&this->__end_, __n);
+    for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_) {
+        __alloc_traits::construct(this->__alloc(),
+            _VSTD::__to_address(__tx.__pos_), __x);
+    }
+}
+
+template <class _Tp, class _Allocator>
+template <class _InputIter>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 __enable_if_t<__is_exactly_cpp17_input_iterator<_InputIter>::value>
+__split_buffer<_Tp, _Allocator>::__construct_at_end(_InputIter __first, _InputIter __last)
+{
+    __alloc_rr& __a = this->__alloc();
+    for (; __first != __last; ++__first)
+    {
+        if (__end_ == __end_cap())
+        {
+            size_type __old_cap = __end_cap() - __first_;
+            size_type __new_cap = _VSTD::max<size_type>(2 * __old_cap, 8);
+            __split_buffer __buf(__new_cap, 0, __a);
+            for (pointer __p = __begin_; __p != __end_; ++__p, (void) ++__buf.__end_)
+                __alloc_traits::construct(__buf.__alloc(),
+                        _VSTD::__to_address(__buf.__end_), _VSTD::move(*__p));
+            swap(__buf);
+        }
+        __alloc_traits::construct(__a, _VSTD::__to_address(this->__end_), *__first);
+        ++this->__end_;
+    }
+}
+
+template <class _Tp, class _Allocator>
+template <class _ForwardIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 __enable_if_t<__is_cpp17_forward_iterator<_ForwardIterator>::value>
+__split_buffer<_Tp, _Allocator>::__construct_at_end(_ForwardIterator __first, _ForwardIterator __last)
+{
+    _ConstructTransaction __tx(&this->__end_, _VSTD::distance(__first, __last));
+    for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_, (void) ++__first) {
+        __alloc_traits::construct(this->__alloc(),
+            _VSTD::__to_address(__tx.__pos_), *__first);
+    }
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline
+void
+__split_buffer<_Tp, _Allocator>::__destruct_at_begin(pointer __new_begin, false_type)
+{
+    while (__begin_ != __new_begin)
+        __alloc_traits::destroy(__alloc(), _VSTD::__to_address(__begin_++));
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline
+void
+__split_buffer<_Tp, _Allocator>::__destruct_at_begin(pointer __new_begin, true_type)
+{
+    __begin_ = __new_begin;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+void
+__split_buffer<_Tp, _Allocator>::__destruct_at_end(pointer __new_last, false_type) _NOEXCEPT
+{
+    while (__new_last != __end_)
+        __alloc_traits::destroy(__alloc(), _VSTD::__to_address(--__end_));
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+void
+__split_buffer<_Tp, _Allocator>::__destruct_at_end(pointer __new_last, true_type) _NOEXCEPT
+{
+    __end_ = __new_last;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__split_buffer<_Tp, _Allocator>::__split_buffer(size_type __cap, size_type __start, __alloc_rr& __a)
+    : __end_cap_(nullptr, __a)
+{
+    if (__cap == 0) {
+        __first_ = nullptr;
+    } else {
+        auto __allocation = std::__allocate_at_least(__alloc(), __cap);
+        __first_ = __allocation.ptr;
+        __cap = __allocation.count;
+    }
+    __begin_ = __end_ = __first_ + __start;
+    __end_cap() = __first_ + __cap;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline
+__split_buffer<_Tp, _Allocator>::__split_buffer()
+    _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
+    : __first_(nullptr), __begin_(nullptr), __end_(nullptr), __end_cap_(nullptr, __default_init_tag())
+{
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline
+__split_buffer<_Tp, _Allocator>::__split_buffer(__alloc_rr& __a)
+    : __first_(nullptr), __begin_(nullptr), __end_(nullptr), __end_cap_(nullptr, __a)
+{
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline
+__split_buffer<_Tp, _Allocator>::__split_buffer(const __alloc_rr& __a)
+    : __first_(nullptr), __begin_(nullptr), __end_(nullptr), __end_cap_(nullptr, __a)
+{
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__split_buffer<_Tp, _Allocator>::~__split_buffer()
+{
+    clear();
+    if (__first_)
+        __alloc_traits::deallocate(__alloc(), __first_, capacity());
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__split_buffer<_Tp, _Allocator>::__split_buffer(__split_buffer&& __c)
+    _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value)
+    : __first_(_VSTD::move(__c.__first_)),
+      __begin_(_VSTD::move(__c.__begin_)),
+      __end_(_VSTD::move(__c.__end_)),
+      __end_cap_(_VSTD::move(__c.__end_cap_))
+{
+    __c.__first_ = nullptr;
+    __c.__begin_ = nullptr;
+    __c.__end_ = nullptr;
+    __c.__end_cap() = nullptr;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__split_buffer<_Tp, _Allocator>::__split_buffer(__split_buffer&& __c, const __alloc_rr& __a)
+    : __end_cap_(nullptr, __a)
+{
+    if (__a == __c.__alloc())
+    {
+        __first_ = __c.__first_;
+        __begin_ = __c.__begin_;
+        __end_ = __c.__end_;
+        __end_cap() = __c.__end_cap();
+        __c.__first_ = nullptr;
+        __c.__begin_ = nullptr;
+        __c.__end_ = nullptr;
+        __c.__end_cap() = nullptr;
+    }
+    else
+    {
+        auto __allocation = std::__allocate_at_least(__alloc(), __c.size());
+        __first_ = __allocation.ptr;
+        __begin_ = __end_ = __first_;
+        __end_cap() = __first_ + __allocation.count;
+        typedef move_iterator<iterator> _Ip;
+        __construct_at_end(_Ip(__c.begin()), _Ip(__c.end()));
+    }
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__split_buffer<_Tp, _Allocator>&
+__split_buffer<_Tp, _Allocator>::operator=(__split_buffer&& __c)
+    _NOEXCEPT_((__alloc_traits::propagate_on_container_move_assignment::value &&
+                is_nothrow_move_assignable<allocator_type>::value) ||
+               !__alloc_traits::propagate_on_container_move_assignment::value)
+{
+    clear();
+    shrink_to_fit();
+    __first_ = __c.__first_;
+    __begin_ = __c.__begin_;
+    __end_ = __c.__end_;
+    __end_cap() = __c.__end_cap();
+    __move_assign_alloc(__c,
+        integral_constant<bool,
+                          __alloc_traits::propagate_on_container_move_assignment::value>());
+    __c.__first_ = __c.__begin_ = __c.__end_ = __c.__end_cap() = nullptr;
+    return *this;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__split_buffer<_Tp, _Allocator>::swap(__split_buffer& __x)
+        _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value||
+                   __is_nothrow_swappable<__alloc_rr>::value)
+{
+    _VSTD::swap(__first_, __x.__first_);
+    _VSTD::swap(__begin_, __x.__begin_);
+    _VSTD::swap(__end_, __x.__end_);
+    _VSTD::swap(__end_cap(), __x.__end_cap());
+    _VSTD::__swap_allocator(__alloc(), __x.__alloc());
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__split_buffer<_Tp, _Allocator>::reserve(size_type __n)
+{
+    if (__n < capacity())
+    {
+        __split_buffer<value_type, __alloc_rr&> __t(__n, 0, __alloc());
+        __t.__construct_at_end(move_iterator<pointer>(__begin_),
+                               move_iterator<pointer>(__end_));
+        _VSTD::swap(__first_, __t.__first_);
+        _VSTD::swap(__begin_, __t.__begin_);
+        _VSTD::swap(__end_, __t.__end_);
+        _VSTD::swap(__end_cap(), __t.__end_cap());
+    }
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__split_buffer<_Tp, _Allocator>::shrink_to_fit() _NOEXCEPT
+{
+    if (capacity() > size())
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            __split_buffer<value_type, __alloc_rr&> __t(size(), 0, __alloc());
+            __t.__construct_at_end(move_iterator<pointer>(__begin_),
+                                   move_iterator<pointer>(__end_));
+            __t.__end_ = __t.__begin_ + (__end_ - __begin_);
+            _VSTD::swap(__first_, __t.__first_);
+            _VSTD::swap(__begin_, __t.__begin_);
+            _VSTD::swap(__end_, __t.__end_);
+            _VSTD::swap(__end_cap(), __t.__end_cap());
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__split_buffer<_Tp, _Allocator>::push_front(const_reference __x)
+{
+    if (__begin_ == __first_)
+    {
+        if (__end_ < __end_cap())
+        {
+            difference_type __d = __end_cap() - __end_;
+            __d = (__d + 1) / 2;
+            __begin_ = _VSTD::move_backward(__begin_, __end_, __end_ + __d);
+            __end_ += __d;
+        }
+        else
+        {
+            size_type __c = std::max<size_type>(2 * static_cast<size_t>(__end_cap() - __first_), 1);
+            __split_buffer<value_type, __alloc_rr&> __t(__c, (__c + 3) / 4, __alloc());
+            __t.__construct_at_end(move_iterator<pointer>(__begin_),
+                                   move_iterator<pointer>(__end_));
+            _VSTD::swap(__first_, __t.__first_);
+            _VSTD::swap(__begin_, __t.__begin_);
+            _VSTD::swap(__end_, __t.__end_);
+            _VSTD::swap(__end_cap(), __t.__end_cap());
+        }
+    }
+    __alloc_traits::construct(__alloc(), _VSTD::__to_address(__begin_-1), __x);
+    --__begin_;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__split_buffer<_Tp, _Allocator>::push_front(value_type&& __x)
+{
+    if (__begin_ == __first_)
+    {
+        if (__end_ < __end_cap())
+        {
+            difference_type __d = __end_cap() - __end_;
+            __d = (__d + 1) / 2;
+            __begin_ = _VSTD::move_backward(__begin_, __end_, __end_ + __d);
+            __end_ += __d;
+        }
+        else
+        {
+            size_type __c = std::max<size_type>(2 * static_cast<size_t>(__end_cap() - __first_), 1);
+            __split_buffer<value_type, __alloc_rr&> __t(__c, (__c + 3) / 4, __alloc());
+            __t.__construct_at_end(move_iterator<pointer>(__begin_),
+                                   move_iterator<pointer>(__end_));
+            _VSTD::swap(__first_, __t.__first_);
+            _VSTD::swap(__begin_, __t.__begin_);
+            _VSTD::swap(__end_, __t.__end_);
+            _VSTD::swap(__end_cap(), __t.__end_cap());
+        }
+    }
+    __alloc_traits::construct(__alloc(), _VSTD::__to_address(__begin_-1),
+            _VSTD::move(__x));
+    --__begin_;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+void
+__split_buffer<_Tp, _Allocator>::push_back(const_reference __x)
+{
+    if (__end_ == __end_cap())
+    {
+        if (__begin_ > __first_)
+        {
+            difference_type __d = __begin_ - __first_;
+            __d = (__d + 1) / 2;
+            __end_ = _VSTD::move(__begin_, __end_, __begin_ - __d);
+            __begin_ -= __d;
+        }
+        else
+        {
+            size_type __c = std::max<size_type>(2 * static_cast<size_t>(__end_cap() - __first_), 1);
+            __split_buffer<value_type, __alloc_rr&> __t(__c, __c / 4, __alloc());
+            __t.__construct_at_end(move_iterator<pointer>(__begin_),
+                                   move_iterator<pointer>(__end_));
+            _VSTD::swap(__first_, __t.__first_);
+            _VSTD::swap(__begin_, __t.__begin_);
+            _VSTD::swap(__end_, __t.__end_);
+            _VSTD::swap(__end_cap(), __t.__end_cap());
+        }
+    }
+    __alloc_traits::construct(__alloc(), _VSTD::__to_address(__end_), __x);
+    ++__end_;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__split_buffer<_Tp, _Allocator>::push_back(value_type&& __x)
+{
+    if (__end_ == __end_cap())
+    {
+        if (__begin_ > __first_)
+        {
+            difference_type __d = __begin_ - __first_;
+            __d = (__d + 1) / 2;
+            __end_ = _VSTD::move(__begin_, __end_, __begin_ - __d);
+            __begin_ -= __d;
+        }
+        else
+        {
+            size_type __c = std::max<size_type>(2 * static_cast<size_t>(__end_cap() - __first_), 1);
+            __split_buffer<value_type, __alloc_rr&> __t(__c, __c / 4, __alloc());
+            __t.__construct_at_end(move_iterator<pointer>(__begin_),
+                                   move_iterator<pointer>(__end_));
+            _VSTD::swap(__first_, __t.__first_);
+            _VSTD::swap(__begin_, __t.__begin_);
+            _VSTD::swap(__end_, __t.__end_);
+            _VSTD::swap(__end_cap(), __t.__end_cap());
+        }
+    }
+    __alloc_traits::construct(__alloc(), _VSTD::__to_address(__end_),
+            _VSTD::move(__x));
+    ++__end_;
+}
+
+template <class _Tp, class _Allocator>
+template <class... _Args>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+__split_buffer<_Tp, _Allocator>::emplace_back(_Args&&... __args)
+{
+    if (__end_ == __end_cap())
+    {
+        if (__begin_ > __first_)
+        {
+            difference_type __d = __begin_ - __first_;
+            __d = (__d + 1) / 2;
+            __end_ = _VSTD::move(__begin_, __end_, __begin_ - __d);
+            __begin_ -= __d;
+        }
+        else
+        {
+            size_type __c = std::max<size_type>(2 * static_cast<size_t>(__end_cap() - __first_), 1);
+            __split_buffer<value_type, __alloc_rr&> __t(__c, __c / 4, __alloc());
+            __t.__construct_at_end(move_iterator<pointer>(__begin_),
+                                   move_iterator<pointer>(__end_));
+            _VSTD::swap(__first_, __t.__first_);
+            _VSTD::swap(__begin_, __t.__begin_);
+            _VSTD::swap(__end_, __t.__end_);
+            _VSTD::swap(__end_cap(), __t.__end_cap());
+        }
+    }
+    __alloc_traits::construct(__alloc(), _VSTD::__to_address(__end_),
+                              _VSTD::forward<_Args>(__args)...);
+    ++__end_;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+void
+swap(__split_buffer<_Tp, _Allocator>& __x, __split_buffer<_Tp, _Allocator>& __y)
+        _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___SPLIT_BUFFER
diff --git a/app/src/main/cpp/libcxx/include/__std_stream b/app/src/main/cpp/libcxx/include/__std_stream
new file mode 100644
index 0000000..e419e8c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__std_stream
@@ -0,0 +1,361 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___STD_STREAM
+#define _LIBCPP___STD_STREAM
+
+#include <__config>
+#include <__locale>
+#include <cstdio>
+#include <istream>
+#include <ostream>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+static const int __limit = 8;
+
+// __stdinbuf
+
+template <class _CharT>
+class _LIBCPP_HIDDEN __stdinbuf
+    : public basic_streambuf<_CharT, char_traits<_CharT> >
+{
+public:
+    typedef _CharT                           char_type;
+    typedef char_traits<char_type>           traits_type;
+    typedef typename traits_type::int_type   int_type;
+    typedef typename traits_type::pos_type   pos_type;
+    typedef typename traits_type::off_type   off_type;
+    typedef typename traits_type::state_type state_type;
+
+    __stdinbuf(FILE* __fp, state_type* __st);
+
+protected:
+    virtual int_type underflow();
+    virtual int_type uflow();
+    virtual int_type pbackfail(int_type __c = traits_type::eof());
+    virtual void imbue(const locale& __loc);
+
+private:
+
+    FILE* __file_;
+    const codecvt<char_type, char, state_type>* __cv_;
+    state_type* __st_;
+    int __encoding_;
+    int_type __last_consumed_;
+    bool __last_consumed_is_next_;
+    bool __always_noconv_;
+
+    __stdinbuf(const __stdinbuf&);
+    __stdinbuf& operator=(const __stdinbuf&);
+
+    int_type __getchar(bool __consume);
+};
+
+template <class _CharT>
+__stdinbuf<_CharT>::__stdinbuf(FILE* __fp, state_type* __st)
+    : __file_(__fp),
+      __st_(__st),
+      __last_consumed_(traits_type::eof()),
+      __last_consumed_is_next_(false)
+{
+    imbue(this->getloc());
+}
+
+template <class _CharT>
+void
+__stdinbuf<_CharT>::imbue(const locale& __loc)
+{
+    __cv_ = &use_facet<codecvt<char_type, char, state_type> >(__loc);
+    __encoding_ = __cv_->encoding();
+    __always_noconv_ = __cv_->always_noconv();
+    if (__encoding_ > __limit)
+        __throw_runtime_error("unsupported locale for standard input");
+}
+
+template <class _CharT>
+typename __stdinbuf<_CharT>::int_type
+__stdinbuf<_CharT>::underflow()
+{
+    return __getchar(false);
+}
+
+template <class _CharT>
+typename __stdinbuf<_CharT>::int_type
+__stdinbuf<_CharT>::uflow()
+{
+    return __getchar(true);
+}
+
+template <class _CharT>
+typename __stdinbuf<_CharT>::int_type
+__stdinbuf<_CharT>::__getchar(bool __consume)
+{
+    if (__last_consumed_is_next_)
+    {
+        int_type __result = __last_consumed_;
+        if (__consume)
+        {
+            __last_consumed_ = traits_type::eof();
+            __last_consumed_is_next_ = false;
+        }
+        return __result;
+    }
+    char __extbuf[__limit];
+    int __nread = _VSTD::max(1, __encoding_);
+    for (int __i = 0; __i < __nread; ++__i)
+    {
+        int __c = getc(__file_);
+        if (__c == EOF)
+            return traits_type::eof();
+        __extbuf[__i] = static_cast<char>(__c);
+    }
+    char_type __1buf;
+    if (__always_noconv_)
+        __1buf = static_cast<char_type>(__extbuf[0]);
+    else
+    {
+        const char* __enxt;
+        char_type* __inxt;
+        codecvt_base::result __r;
+        do
+        {
+            state_type __sv_st = *__st_;
+            __r = __cv_->in(*__st_, __extbuf, __extbuf + __nread, __enxt,
+                                   &__1buf, &__1buf + 1, __inxt);
+            switch (__r)
+            {
+            case _VSTD::codecvt_base::ok:
+                break;
+            case codecvt_base::partial:
+                *__st_ = __sv_st;
+                if (__nread == sizeof(__extbuf))
+                    return traits_type::eof();
+                {
+                    int __c = getc(__file_);
+                    if (__c == EOF)
+                        return traits_type::eof();
+                    __extbuf[__nread] = static_cast<char>(__c);
+                }
+                ++__nread;
+                break;
+            case codecvt_base::error:
+                return traits_type::eof();
+            case _VSTD::codecvt_base::noconv:
+                __1buf = static_cast<char_type>(__extbuf[0]);
+                break;
+            }
+        } while (__r == _VSTD::codecvt_base::partial);
+    }
+    if (!__consume)
+    {
+        for (int __i = __nread; __i > 0;)
+        {
+            if (ungetc(traits_type::to_int_type(__extbuf[--__i]), __file_) == EOF)
+                return traits_type::eof();
+        }
+    }
+    else
+        __last_consumed_ = traits_type::to_int_type(__1buf);
+    return traits_type::to_int_type(__1buf);
+}
+
+template <class _CharT>
+typename __stdinbuf<_CharT>::int_type
+__stdinbuf<_CharT>::pbackfail(int_type __c)
+{
+    if (traits_type::eq_int_type(__c, traits_type::eof()))
+    {
+        if (!__last_consumed_is_next_)
+        {
+            __c = __last_consumed_;
+            __last_consumed_is_next_ = !traits_type::eq_int_type(__last_consumed_,
+                                                                 traits_type::eof());
+        }
+        return __c;
+    }
+    if (__last_consumed_is_next_)
+    {
+        char __extbuf[__limit];
+        char* __enxt;
+        const char_type __ci = traits_type::to_char_type(__last_consumed_);
+        const char_type* __inxt;
+        switch (__cv_->out(*__st_, &__ci, &__ci + 1, __inxt,
+                                  __extbuf, __extbuf + sizeof(__extbuf), __enxt))
+        {
+        case _VSTD::codecvt_base::ok:
+            break;
+        case _VSTD::codecvt_base::noconv:
+            __extbuf[0] = static_cast<char>(__last_consumed_);
+            __enxt = __extbuf + 1;
+            break;
+        case codecvt_base::partial:
+        case codecvt_base::error:
+            return traits_type::eof();
+        }
+        while (__enxt > __extbuf)
+            if (ungetc(*--__enxt, __file_) == EOF)
+                return traits_type::eof();
+    }
+    __last_consumed_ = __c;
+    __last_consumed_is_next_ = true;
+    return __c;
+}
+
+// __stdoutbuf
+
+template <class _CharT>
+class _LIBCPP_HIDDEN __stdoutbuf
+    : public basic_streambuf<_CharT, char_traits<_CharT> >
+{
+public:
+    typedef _CharT                           char_type;
+    typedef char_traits<char_type>           traits_type;
+    typedef typename traits_type::int_type   int_type;
+    typedef typename traits_type::pos_type   pos_type;
+    typedef typename traits_type::off_type   off_type;
+    typedef typename traits_type::state_type state_type;
+
+    __stdoutbuf(FILE* __fp, state_type* __st);
+
+protected:
+    virtual int_type overflow (int_type __c = traits_type::eof());
+    virtual streamsize xsputn(const char_type* __s, streamsize __n);
+    virtual int sync();
+    virtual void imbue(const locale& __loc);
+
+private:
+    FILE* __file_;
+    const codecvt<char_type, char, state_type>* __cv_;
+    state_type* __st_;
+    bool __always_noconv_;
+
+    __stdoutbuf(const __stdoutbuf&);
+    __stdoutbuf& operator=(const __stdoutbuf&);
+};
+
+template <class _CharT>
+__stdoutbuf<_CharT>::__stdoutbuf(FILE* __fp, state_type* __st)
+    : __file_(__fp),
+      __cv_(&use_facet<codecvt<char_type, char, state_type> >(this->getloc())),
+      __st_(__st),
+      __always_noconv_(__cv_->always_noconv())
+{
+}
+
+template <class _CharT>
+typename __stdoutbuf<_CharT>::int_type
+__stdoutbuf<_CharT>::overflow(int_type __c)
+{
+    char __extbuf[__limit];
+    char_type __1buf;
+    if (!traits_type::eq_int_type(__c, traits_type::eof()))
+    {
+        __1buf = traits_type::to_char_type(__c);
+        if (__always_noconv_)
+        {
+            if (fwrite(&__1buf, sizeof(char_type), 1, __file_) != 1)
+                return traits_type::eof();
+        }
+        else
+        {
+            char* __extbe = __extbuf;
+            codecvt_base::result __r;
+            char_type* pbase = &__1buf;
+            char_type* pptr = pbase + 1;
+            do
+            {
+                const char_type* __e;
+                __r = __cv_->out(*__st_, pbase, pptr, __e,
+                                        __extbuf,
+                                        __extbuf + sizeof(__extbuf),
+                                        __extbe);
+                if (__e == pbase)
+                    return traits_type::eof();
+                if (__r == codecvt_base::noconv)
+                {
+                    if (fwrite(pbase, 1, 1, __file_) != 1)
+                        return traits_type::eof();
+                }
+                else if (__r == codecvt_base::ok || __r == codecvt_base::partial)
+                {
+                    size_t __nmemb = static_cast<size_t>(__extbe - __extbuf);
+                    if (fwrite(__extbuf, 1, __nmemb, __file_) != __nmemb)
+                        return traits_type::eof();
+                    if (__r == codecvt_base::partial)
+                    {
+                        pbase = const_cast<char_type*>(__e);
+                    }
+                }
+                else
+                    return traits_type::eof();
+            } while (__r == codecvt_base::partial);
+        }
+    }
+    return traits_type::not_eof(__c);
+}
+
+template <class _CharT>
+streamsize
+__stdoutbuf<_CharT>::xsputn(const char_type* __s, streamsize __n)
+{
+    if (__always_noconv_)
+        return fwrite(__s, sizeof(char_type), __n, __file_);
+    streamsize __i = 0;
+    for (; __i < __n; ++__i, ++__s)
+        if (overflow(traits_type::to_int_type(*__s)) == traits_type::eof())
+            break;
+    return __i;
+}
+
+template <class _CharT>
+int
+__stdoutbuf<_CharT>::sync()
+{
+    char __extbuf[__limit];
+    codecvt_base::result __r;
+    do
+    {
+        char* __extbe;
+        __r = __cv_->unshift(*__st_, __extbuf,
+                                    __extbuf + sizeof(__extbuf),
+                                    __extbe);
+        size_t __nmemb = static_cast<size_t>(__extbe - __extbuf);
+        if (fwrite(__extbuf, 1, __nmemb, __file_) != __nmemb)
+            return -1;
+    } while (__r == codecvt_base::partial);
+    if (__r == codecvt_base::error)
+        return -1;
+    if (fflush(__file_))
+        return -1;
+    return 0;
+}
+
+template <class _CharT>
+void
+__stdoutbuf<_CharT>::imbue(const locale& __loc)
+{
+    sync();
+    __cv_ = &use_facet<codecvt<char_type, char, state_type> >(__loc);
+    __always_noconv_ = __cv_->always_noconv();
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___STD_STREAM
diff --git a/app/src/main/cpp/libcxx/include/__string/char_traits.h b/app/src/main/cpp/libcxx/include/__string/char_traits.h
new file mode 100644
index 0000000..622ee22
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__string/char_traits.h
@@ -0,0 +1,836 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___STRING_CHAR_TRAITS_H
+#define _LIBCPP___STRING_CHAR_TRAITS_H
+
+#include <__algorithm/copy_n.h>
+#include <__algorithm/fill_n.h>
+#include <__algorithm/find_end.h>
+#include <__algorithm/find_first_of.h>
+#include <__algorithm/min.h>
+#include <__compare/ordering.h>
+#include <__config>
+#include <__functional/hash.h>
+#include <__iterator/iterator_traits.h>
+#include <__type_traits/is_constant_evaluated.h>
+#include <cstddef>
+#include <cstdint>
+#include <cstdio>
+#include <cstring>
+#include <iosfwd>
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+#   include <cwchar> // for wmemcpy
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _CharT>
+struct char_traits;
+/*
+The Standard does not define the base template for char_traits because it is impossible to provide
+a correct definition for arbitrary character types. Instead, it requires implementations to provide
+specializations for predefined character types like `char`, `wchar_t` and others. We provide this as
+exposition-only to document what members a char_traits specialization should provide:
+{
+    using char_type  = _CharT;
+    using int_type   = ...;
+    using off_type   = ...;
+    using pos_type   = ...;
+    using state_type = ...;
+
+    static void assign(char_type&, const char_type&);
+    static bool eq(char_type, char_type);
+    static bool lt(char_type, char_type);
+
+    static int              compare(const char_type*, const char_type*, size_t);
+    static size_t           length(const char_type*);
+    static const char_type* find(const char_type*, size_t, const char_type&);
+    static char_type*       move(char_type*, const char_type*, size_t);
+    static char_type*       copy(char_type*, const char_type*, size_t);
+    static char_type*       assign(char_type*, size_t, char_type);
+
+    static int_type  not_eof(int_type);
+    static char_type to_char_type(int_type);
+    static int_type  to_int_type(char_type);
+    static bool      eq_int_type(int_type, int_type);
+    static int_type  eof();
+};
+*/
+
+//
+// Temporary extension to provide a base template for std::char_traits.
+// TODO: Remove in LLVM 18.
+//
+template <class _CharT>
+struct _LIBCPP_DEPRECATED_("char_traits<T> for T not equal to char, wchar_t, char8_t, char16_t or char32_t is non-standard and is provided for a temporary period. It will be removed in LLVM 18, so please migrate off of it.")
+    char_traits
+{
+    using char_type  = _CharT;
+    using int_type   = int;
+    using off_type   = streamoff;
+    using pos_type   = streampos;
+    using state_type = mbstate_t;
+
+    static inline void _LIBCPP_CONSTEXPR_SINCE_CXX17
+        assign(char_type& __c1, const char_type& __c2) _NOEXCEPT {__c1 = __c2;}
+    static inline _LIBCPP_CONSTEXPR bool eq(char_type __c1, char_type __c2) _NOEXCEPT
+        {return __c1 == __c2;}
+    static inline _LIBCPP_CONSTEXPR bool lt(char_type __c1, char_type __c2) _NOEXCEPT
+        {return __c1 < __c2;}
+
+    static _LIBCPP_CONSTEXPR_SINCE_CXX17
+    int compare(const char_type* __s1, const char_type* __s2, size_t __n) {
+        for (; __n; --__n, ++__s1, ++__s2)
+        {
+            if (lt(*__s1, *__s2))
+                return -1;
+            if (lt(*__s2, *__s1))
+                return 1;
+        }
+        return 0;
+    }
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR_SINCE_CXX17
+    size_t length(const char_type* __s) {
+        size_t __len = 0;
+        for (; !eq(*__s, char_type(0)); ++__s)
+            ++__len;
+        return __len;
+    }
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const char_type* find(const char_type* __s, size_t __n, const char_type& __a) {
+        for (; __n; --__n)
+        {
+            if (eq(*__s, __a))
+                return __s;
+            ++__s;
+        }
+        return nullptr;
+    }
+    static _LIBCPP_CONSTEXPR_SINCE_CXX20
+    char_type*       move(char_type* __s1, const char_type* __s2, size_t __n) {
+        if (__n == 0) return __s1;
+        char_type* __r = __s1;
+        if (__s1 < __s2)
+        {
+            for (; __n; --__n, ++__s1, ++__s2)
+                assign(*__s1, *__s2);
+        }
+        else if (__s2 < __s1)
+        {
+            __s1 += __n;
+            __s2 += __n;
+            for (; __n; --__n)
+                assign(*--__s1, *--__s2);
+        }
+        return __r;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR_SINCE_CXX20
+    char_type*       copy(char_type* __s1, const char_type* __s2, size_t __n) {
+        if (!__libcpp_is_constant_evaluated()) {
+            _LIBCPP_ASSERT(__s2 < __s1 || __s2 >= __s1+__n, "char_traits::copy overlapped range");
+        }
+        char_type* __r = __s1;
+        for (; __n; --__n, ++__s1, ++__s2)
+            assign(*__s1, *__s2);
+        return __r;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    static _LIBCPP_CONSTEXPR_SINCE_CXX20
+    char_type*       assign(char_type* __s, size_t __n, char_type __a) {
+        char_type* __r = __s;
+        for (; __n; --__n, ++__s)
+            assign(*__s, __a);
+        return __r;
+    }
+
+    static inline _LIBCPP_CONSTEXPR int_type  not_eof(int_type __c) _NOEXCEPT
+        {return eq_int_type(__c, eof()) ? ~eof() : __c;}
+    static inline _LIBCPP_CONSTEXPR char_type to_char_type(int_type __c) _NOEXCEPT
+        {return char_type(__c);}
+    static inline _LIBCPP_CONSTEXPR int_type  to_int_type(char_type __c) _NOEXCEPT
+        {return int_type(__c);}
+    static inline _LIBCPP_CONSTEXPR bool      eq_int_type(int_type __c1, int_type __c2) _NOEXCEPT
+        {return __c1 == __c2;}
+    static inline _LIBCPP_CONSTEXPR int_type  eof() _NOEXCEPT
+        {return int_type(EOF);}
+};
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI static inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+_CharT* __char_traits_move(_CharT* __dest, const _CharT* __source, size_t __n) _NOEXCEPT
+{
+#ifdef _LIBCPP_COMPILER_GCC
+  if (__libcpp_is_constant_evaluated()) {
+    if (__n == 0)
+      return __dest;
+    _CharT* __allocation = new _CharT[__n];
+    std::copy_n(__source, __n, __allocation);
+    std::copy_n(static_cast<const _CharT*>(__allocation), __n, __dest);
+    delete[] __allocation;
+    return __dest;
+  }
+#endif
+  ::__builtin_memmove(__dest, __source, __n * sizeof(_CharT));
+  return __dest;
+}
+
+// char_traits<char>
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS char_traits<char>
+{
+    using char_type           = char;
+    using int_type            = int;
+    using off_type            = streamoff;
+    using pos_type            = streampos;
+    using state_type          = mbstate_t;
+#if _LIBCPP_STD_VER > 17
+    using comparison_category = strong_ordering;
+#endif
+
+    static inline _LIBCPP_CONSTEXPR_SINCE_CXX17
+    void assign(char_type& __c1, const char_type& __c2) _NOEXCEPT {__c1 = __c2;}
+    static inline _LIBCPP_CONSTEXPR bool eq(char_type __c1, char_type __c2) _NOEXCEPT
+            {return __c1 == __c2;}
+    static inline _LIBCPP_CONSTEXPR bool lt(char_type __c1, char_type __c2) _NOEXCEPT
+        {return (unsigned char)__c1 < (unsigned char)__c2;}
+
+  static _LIBCPP_CONSTEXPR_SINCE_CXX17 int compare(const char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+    if (__n == 0)
+      return 0;
+    return std::__constexpr_memcmp(__s1, __s2, __n);
+  }
+
+  static inline size_t _LIBCPP_CONSTEXPR_SINCE_CXX17 length(const char_type* __s)  _NOEXCEPT {
+    return std::__constexpr_strlen(__s);
+  }
+
+  static _LIBCPP_CONSTEXPR_SINCE_CXX17
+  const char_type* find(const char_type* __s, size_t __n, const char_type& __a) _NOEXCEPT {
+    if (__n == 0)
+        return nullptr;
+    return std::__constexpr_char_memchr(__s, static_cast<int>(__a), __n);
+  }
+
+    static inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+    char_type* move(char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+        return std::__char_traits_move(__s1, __s2, __n);
+    }
+
+    static inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+    char_type* copy(char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+        if (!__libcpp_is_constant_evaluated())
+            _LIBCPP_ASSERT(__s2 < __s1 || __s2 >= __s1+__n, "char_traits::copy overlapped range");
+        std::copy_n(__s2, __n, __s1);
+        return __s1;
+    }
+
+    static inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+    char_type* assign(char_type* __s, size_t __n, char_type __a) _NOEXCEPT {
+        std::fill_n(__s, __n, __a);
+        return __s;
+    }
+
+    static inline _LIBCPP_CONSTEXPR int_type  not_eof(int_type __c) _NOEXCEPT
+        {return eq_int_type(__c, eof()) ? ~eof() : __c;}
+    static inline _LIBCPP_CONSTEXPR char_type to_char_type(int_type __c) _NOEXCEPT
+        {return char_type(__c);}
+    static inline _LIBCPP_CONSTEXPR int_type to_int_type(char_type __c) _NOEXCEPT
+        {return int_type((unsigned char)__c);}
+    static inline _LIBCPP_CONSTEXPR bool eq_int_type(int_type __c1, int_type __c2) _NOEXCEPT
+        {return __c1 == __c2;}
+    static inline _LIBCPP_CONSTEXPR int_type  eof() _NOEXCEPT
+        {return int_type(EOF);}
+};
+
+// char_traits<wchar_t>
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+struct _LIBCPP_TEMPLATE_VIS char_traits<wchar_t>
+{
+    using char_type           = wchar_t;
+    using int_type            = wint_t;
+    using off_type            = streamoff;
+    using pos_type            = streampos;
+    using state_type          = mbstate_t;
+#if _LIBCPP_STD_VER > 17
+    using comparison_category = strong_ordering;
+#endif
+
+    static inline _LIBCPP_CONSTEXPR_SINCE_CXX17
+    void assign(char_type& __c1, const char_type& __c2) _NOEXCEPT {__c1 = __c2;}
+    static inline _LIBCPP_CONSTEXPR bool eq(char_type __c1, char_type __c2) _NOEXCEPT
+        {return __c1 == __c2;}
+    static inline _LIBCPP_CONSTEXPR bool lt(char_type __c1, char_type __c2) _NOEXCEPT
+        {return __c1 < __c2;}
+
+  static _LIBCPP_CONSTEXPR_SINCE_CXX17 int compare(const char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+    if (__n == 0)
+        return 0;
+    return std::__constexpr_wmemcmp(__s1, __s2, __n);
+  }
+
+  static _LIBCPP_CONSTEXPR_SINCE_CXX17 size_t length(const char_type* __s) _NOEXCEPT {
+    return std::__constexpr_wcslen(__s);
+  }
+
+  static _LIBCPP_CONSTEXPR_SINCE_CXX17
+  const char_type* find(const char_type* __s, size_t __n, const char_type& __a) _NOEXCEPT {
+    if (__n == 0)
+        return nullptr;
+    return std::__constexpr_wmemchr(__s, __a, __n);
+  }
+
+    static inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+    char_type* move(char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+        return std::__char_traits_move(__s1, __s2, __n);
+    }
+
+    static inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+    char_type* copy(char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+        if (!__libcpp_is_constant_evaluated())
+            _LIBCPP_ASSERT(__s2 < __s1 || __s2 >= __s1+__n, "char_traits::copy overlapped range");
+        std::copy_n(__s2, __n, __s1);
+        return __s1;
+    }
+
+    static inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+    char_type* assign(char_type* __s, size_t __n, char_type __a) _NOEXCEPT {
+        std::fill_n(__s, __n, __a);
+        return __s;
+    }
+
+    static inline _LIBCPP_CONSTEXPR int_type  not_eof(int_type __c) _NOEXCEPT
+        {return eq_int_type(__c, eof()) ? ~eof() : __c;}
+    static inline _LIBCPP_CONSTEXPR char_type to_char_type(int_type __c) _NOEXCEPT
+        {return char_type(__c);}
+    static inline _LIBCPP_CONSTEXPR int_type to_int_type(char_type __c) _NOEXCEPT
+        {return int_type(__c);}
+    static inline _LIBCPP_CONSTEXPR bool eq_int_type(int_type __c1, int_type __c2) _NOEXCEPT
+        {return __c1 == __c2;}
+    static inline _LIBCPP_CONSTEXPR int_type eof() _NOEXCEPT
+        {return int_type(WEOF);}
+};
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS char_traits<char8_t>
+{
+    using char_type           = char8_t;
+    using int_type            = unsigned int;
+    using off_type            = streamoff;
+    using pos_type            = u8streampos;
+    using state_type          = mbstate_t;
+#if _LIBCPP_STD_VER > 17
+    using comparison_category = strong_ordering;
+#endif
+
+    static inline constexpr void assign(char_type& __c1, const char_type& __c2) noexcept
+        {__c1 = __c2;}
+    static inline constexpr bool eq(char_type __c1, char_type __c2) noexcept
+        {return __c1 == __c2;}
+    static inline constexpr bool lt(char_type __c1, char_type __c2) noexcept
+        {return __c1 < __c2;}
+
+  static _LIBCPP_HIDE_FROM_ABI constexpr int
+  compare(const char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+      return std::__constexpr_memcmp(__s1, __s2, __n);
+  }
+
+    static constexpr
+    size_t           length(const char_type* __s) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY static constexpr
+    const char_type* find(const char_type* __s, size_t __n, const char_type& __a) _NOEXCEPT;
+
+    static _LIBCPP_CONSTEXPR_SINCE_CXX20
+    char_type*       move(char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+        return std::__char_traits_move(__s1, __s2, __n);
+    }
+
+    static _LIBCPP_CONSTEXPR_SINCE_CXX20
+    char_type*       copy(char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+        if (!__libcpp_is_constant_evaluated())
+            _LIBCPP_ASSERT(__s2 < __s1 || __s2 >= __s1+__n, "char_traits::copy overlapped range");
+        std::copy_n(__s2, __n, __s1);
+        return __s1;
+    }
+
+    static _LIBCPP_CONSTEXPR_SINCE_CXX20
+    char_type*       assign(char_type* __s, size_t __n, char_type __a) _NOEXCEPT {
+        std::fill_n(__s, __n, __a);
+        return __s;
+    }
+
+    static inline constexpr int_type  not_eof(int_type __c) noexcept
+        {return eq_int_type(__c, eof()) ? ~eof() : __c;}
+    static inline constexpr char_type to_char_type(int_type __c) noexcept
+        {return char_type(__c);}
+    static inline constexpr int_type to_int_type(char_type __c) noexcept
+        {return int_type(__c);}
+    static inline constexpr bool eq_int_type(int_type __c1, int_type __c2) noexcept
+        {return __c1 == __c2;}
+    static inline constexpr int_type eof() noexcept
+        {return int_type(EOF);}
+};
+
+// TODO use '__builtin_strlen' if it ever supports char8_t ??
+inline constexpr
+size_t
+char_traits<char8_t>::length(const char_type* __s) _NOEXCEPT
+{
+    size_t __len = 0;
+    for (; !eq(*__s, char_type(0)); ++__s)
+        ++__len;
+    return __len;
+}
+
+// TODO use '__builtin_char_memchr' if it ever supports char8_t ??
+inline constexpr
+const char8_t*
+char_traits<char8_t>::find(const char_type* __s, size_t __n, const char_type& __a) _NOEXCEPT
+{
+    for (; __n; --__n)
+    {
+        if (eq(*__s, __a))
+            return __s;
+        ++__s;
+    }
+    return nullptr;
+}
+
+#endif // _LIBCPP_HAS_NO_CHAR8_T
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS char_traits<char16_t>
+{
+    using char_type           = char16_t;
+    using int_type            = uint_least16_t;
+    using off_type            = streamoff;
+    using pos_type            = u16streampos;
+    using state_type          = mbstate_t;
+#if _LIBCPP_STD_VER > 17
+    using comparison_category = strong_ordering;
+#endif
+
+    static inline _LIBCPP_CONSTEXPR_SINCE_CXX17
+    void assign(char_type& __c1, const char_type& __c2) _NOEXCEPT {__c1 = __c2;}
+    static inline _LIBCPP_CONSTEXPR bool eq(char_type __c1, char_type __c2) _NOEXCEPT
+        {return __c1 == __c2;}
+    static inline _LIBCPP_CONSTEXPR bool lt(char_type __c1, char_type __c2) _NOEXCEPT
+        {return __c1 < __c2;}
+
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR_SINCE_CXX17
+    int              compare(const char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR_SINCE_CXX17
+    size_t           length(const char_type* __s) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const char_type* find(const char_type* __s, size_t __n, const char_type& __a) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static char_type*       move(char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+        return std::__char_traits_move(__s1, __s2, __n);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static char_type*       copy(char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+        if (!__libcpp_is_constant_evaluated())
+            _LIBCPP_ASSERT(__s2 < __s1 || __s2 >= __s1+__n, "char_traits::copy overlapped range");
+        std::copy_n(__s2, __n, __s1);
+        return __s1;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static char_type*       assign(char_type* __s, size_t __n, char_type __a) _NOEXCEPT {
+        std::fill_n(__s, __n, __a);
+        return __s;
+    }
+
+    static inline _LIBCPP_CONSTEXPR int_type  not_eof(int_type __c) _NOEXCEPT
+        {return eq_int_type(__c, eof()) ? ~eof() : __c;}
+    static inline _LIBCPP_CONSTEXPR char_type to_char_type(int_type __c) _NOEXCEPT
+        {return char_type(__c);}
+    static inline _LIBCPP_CONSTEXPR int_type to_int_type(char_type __c) _NOEXCEPT
+        {return int_type(__c);}
+    static inline _LIBCPP_CONSTEXPR bool eq_int_type(int_type __c1, int_type __c2) _NOEXCEPT
+        {return __c1 == __c2;}
+    static inline _LIBCPP_CONSTEXPR int_type eof() _NOEXCEPT
+        {return int_type(0xFFFF);}
+};
+
+inline _LIBCPP_CONSTEXPR_SINCE_CXX17
+int
+char_traits<char16_t>::compare(const char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT
+{
+    for (; __n; --__n, ++__s1, ++__s2)
+    {
+        if (lt(*__s1, *__s2))
+            return -1;
+        if (lt(*__s2, *__s1))
+            return 1;
+    }
+    return 0;
+}
+
+inline _LIBCPP_CONSTEXPR_SINCE_CXX17
+size_t
+char_traits<char16_t>::length(const char_type* __s) _NOEXCEPT
+{
+    size_t __len = 0;
+    for (; !eq(*__s, char_type(0)); ++__s)
+        ++__len;
+    return __len;
+}
+
+inline _LIBCPP_CONSTEXPR_SINCE_CXX17
+const char16_t*
+char_traits<char16_t>::find(const char_type* __s, size_t __n, const char_type& __a) _NOEXCEPT
+{
+    for (; __n; --__n)
+    {
+        if (eq(*__s, __a))
+            return __s;
+        ++__s;
+    }
+    return nullptr;
+}
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS char_traits<char32_t>
+{
+    using char_type           = char32_t;
+    using int_type            = uint_least32_t;
+    using off_type            = streamoff;
+    using pos_type            = u32streampos;
+    using state_type          = mbstate_t;
+#if _LIBCPP_STD_VER > 17
+    using comparison_category = strong_ordering;
+#endif
+
+    static inline _LIBCPP_CONSTEXPR_SINCE_CXX17
+    void assign(char_type& __c1, const char_type& __c2) _NOEXCEPT {__c1 = __c2;}
+    static inline _LIBCPP_CONSTEXPR bool eq(char_type __c1, char_type __c2) _NOEXCEPT
+        {return __c1 == __c2;}
+    static inline _LIBCPP_CONSTEXPR bool lt(char_type __c1, char_type __c2) _NOEXCEPT
+        {return __c1 < __c2;}
+
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR_SINCE_CXX17
+    int              compare(const char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR_SINCE_CXX17
+    size_t           length(const char_type* __s) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const char_type* find(const char_type* __s, size_t __n, const char_type& __a) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static char_type*       move(char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+        return std::__char_traits_move(__s1, __s2, __n);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static char_type*       copy(char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {
+        std::copy_n(__s2, __n, __s1);
+        return __s1;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static char_type*       assign(char_type* __s, size_t __n, char_type __a) _NOEXCEPT {
+        std::fill_n(__s, __n, __a);
+        return __s;
+    }
+
+    static inline _LIBCPP_CONSTEXPR int_type  not_eof(int_type __c) _NOEXCEPT
+        {return eq_int_type(__c, eof()) ? ~eof() : __c;}
+    static inline _LIBCPP_CONSTEXPR char_type to_char_type(int_type __c) _NOEXCEPT
+        {return char_type(__c);}
+    static inline _LIBCPP_CONSTEXPR int_type to_int_type(char_type __c) _NOEXCEPT
+        {return int_type(__c);}
+    static inline _LIBCPP_CONSTEXPR bool eq_int_type(int_type __c1, int_type __c2) _NOEXCEPT
+        {return __c1 == __c2;}
+    static inline _LIBCPP_CONSTEXPR int_type eof() _NOEXCEPT
+        {return int_type(0xFFFFFFFF);}
+};
+
+inline _LIBCPP_CONSTEXPR_SINCE_CXX17
+int
+char_traits<char32_t>::compare(const char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT
+{
+    for (; __n; --__n, ++__s1, ++__s2)
+    {
+        if (lt(*__s1, *__s2))
+            return -1;
+        if (lt(*__s2, *__s1))
+            return 1;
+    }
+    return 0;
+}
+
+inline _LIBCPP_CONSTEXPR_SINCE_CXX17
+size_t
+char_traits<char32_t>::length(const char_type* __s) _NOEXCEPT
+{
+    size_t __len = 0;
+    for (; !eq(*__s, char_type(0)); ++__s)
+        ++__len;
+    return __len;
+}
+
+inline _LIBCPP_CONSTEXPR_SINCE_CXX17
+const char32_t*
+char_traits<char32_t>::find(const char_type* __s, size_t __n, const char_type& __a) _NOEXCEPT
+{
+    for (; __n; --__n)
+    {
+        if (eq(*__s, __a))
+            return __s;
+        ++__s;
+    }
+    return nullptr;
+}
+
+// helper fns for basic_string and string_view
+
+// __str_find
+template<class _CharT, class _SizeT, class _Traits, _SizeT __npos>
+inline _SizeT _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+__str_find(const _CharT *__p, _SizeT __sz,
+             _CharT __c, _SizeT __pos) _NOEXCEPT
+{
+    if (__pos >= __sz)
+        return __npos;
+    const _CharT* __r = _Traits::find(__p + __pos, __sz - __pos, __c);
+    if (__r == nullptr)
+        return __npos;
+    return static_cast<_SizeT>(__r - __p);
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI inline _LIBCPP_CONSTEXPR_SINCE_CXX14 const _CharT *
+__search_substring(const _CharT *__first1, const _CharT *__last1,
+                   const _CharT *__first2, const _CharT *__last2) _NOEXCEPT {
+  // Take advantage of knowing source and pattern lengths.
+  // Stop short when source is smaller than pattern.
+  const ptrdiff_t __len2 = __last2 - __first2;
+  if (__len2 == 0)
+    return __first1;
+
+  ptrdiff_t __len1 = __last1 - __first1;
+  if (__len1 < __len2)
+    return __last1;
+
+  // First element of __first2 is loop invariant.
+  _CharT __f2 = *__first2;
+  while (true) {
+    __len1 = __last1 - __first1;
+    // Check whether __first1 still has at least __len2 bytes.
+    if (__len1 < __len2)
+      return __last1;
+
+    // Find __f2 the first byte matching in __first1.
+    __first1 = _Traits::find(__first1, __len1 - __len2 + 1, __f2);
+    if (__first1 == nullptr)
+      return __last1;
+
+    // It is faster to compare from the first byte of __first1 even if we
+    // already know that it matches the first byte of __first2: this is because
+    // __first2 is most likely aligned, as it is user's "pattern" string, and
+    // __first1 + 1 is most likely not aligned, as the match is in the middle of
+    // the string.
+    if (_Traits::compare(__first1, __first2, __len2) == 0)
+      return __first1;
+
+    ++__first1;
+  }
+}
+
+template<class _CharT, class _SizeT, class _Traits, _SizeT __npos>
+inline _SizeT _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+__str_find(const _CharT *__p, _SizeT __sz,
+       const _CharT* __s, _SizeT __pos, _SizeT __n) _NOEXCEPT
+{
+    if (__pos > __sz)
+        return __npos;
+
+    if (__n == 0) // There is nothing to search, just return __pos.
+        return __pos;
+
+    const _CharT *__r = std::__search_substring<_CharT, _Traits>(
+        __p + __pos, __p + __sz, __s, __s + __n);
+
+    if (__r == __p + __sz)
+        return __npos;
+    return static_cast<_SizeT>(__r - __p);
+}
+
+
+// __str_rfind
+
+template<class _CharT, class _SizeT, class _Traits, _SizeT __npos>
+inline _SizeT _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+__str_rfind(const _CharT *__p, _SizeT __sz,
+              _CharT __c, _SizeT __pos) _NOEXCEPT
+{
+    if (__sz < 1)
+        return __npos;
+    if (__pos < __sz)
+        ++__pos;
+    else
+        __pos = __sz;
+    for (const _CharT* __ps = __p + __pos; __ps != __p;)
+    {
+        if (_Traits::eq(*--__ps, __c))
+            return static_cast<_SizeT>(__ps - __p);
+    }
+    return __npos;
+}
+
+template<class _CharT, class _SizeT, class _Traits, _SizeT __npos>
+inline _SizeT _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+__str_rfind(const _CharT *__p, _SizeT __sz,
+        const _CharT* __s, _SizeT __pos, _SizeT __n) _NOEXCEPT
+{
+    __pos = _VSTD::min(__pos, __sz);
+    if (__n < __sz - __pos)
+        __pos += __n;
+    else
+        __pos = __sz;
+    const _CharT* __r = std::__find_end_classic(__p, __p + __pos, __s, __s + __n, _Traits::eq);
+    if (__n > 0 && __r == __p + __pos)
+        return __npos;
+    return static_cast<_SizeT>(__r - __p);
+}
+
+// __str_find_first_of
+template<class _CharT, class _SizeT, class _Traits, _SizeT __npos>
+inline _SizeT _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+__str_find_first_of(const _CharT *__p, _SizeT __sz,
+                const _CharT* __s, _SizeT __pos, _SizeT __n) _NOEXCEPT
+{
+    if (__pos >= __sz || __n == 0)
+        return __npos;
+    const _CharT* __r = _VSTD::__find_first_of_ce
+        (__p + __pos, __p + __sz, __s, __s + __n, _Traits::eq );
+    if (__r == __p + __sz)
+        return __npos;
+    return static_cast<_SizeT>(__r - __p);
+}
+
+
+// __str_find_last_of
+template<class _CharT, class _SizeT, class _Traits, _SizeT __npos>
+inline _SizeT _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+__str_find_last_of(const _CharT *__p, _SizeT __sz,
+               const _CharT* __s, _SizeT __pos, _SizeT __n) _NOEXCEPT
+    {
+    if (__n != 0)
+    {
+        if (__pos < __sz)
+            ++__pos;
+        else
+            __pos = __sz;
+        for (const _CharT* __ps = __p + __pos; __ps != __p;)
+        {
+            const _CharT* __r = _Traits::find(__s, __n, *--__ps);
+            if (__r)
+                return static_cast<_SizeT>(__ps - __p);
+        }
+    }
+    return __npos;
+}
+
+
+// __str_find_first_not_of
+template<class _CharT, class _SizeT, class _Traits, _SizeT __npos>
+inline _SizeT _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+__str_find_first_not_of(const _CharT *__p, _SizeT __sz,
+                    const _CharT* __s, _SizeT __pos, _SizeT __n) _NOEXCEPT
+{
+    if (__pos < __sz)
+    {
+        const _CharT* __pe = __p + __sz;
+        for (const _CharT* __ps = __p + __pos; __ps != __pe; ++__ps)
+            if (_Traits::find(__s, __n, *__ps) == nullptr)
+                return static_cast<_SizeT>(__ps - __p);
+    }
+    return __npos;
+}
+
+
+template<class _CharT, class _SizeT, class _Traits, _SizeT __npos>
+inline _SizeT _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+__str_find_first_not_of(const _CharT *__p, _SizeT __sz,
+                          _CharT __c, _SizeT __pos) _NOEXCEPT
+{
+    if (__pos < __sz)
+    {
+        const _CharT* __pe = __p + __sz;
+        for (const _CharT* __ps = __p + __pos; __ps != __pe; ++__ps)
+            if (!_Traits::eq(*__ps, __c))
+                return static_cast<_SizeT>(__ps - __p);
+    }
+    return __npos;
+}
+
+
+// __str_find_last_not_of
+template<class _CharT, class _SizeT, class _Traits, _SizeT __npos>
+inline _SizeT _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+__str_find_last_not_of(const _CharT *__p, _SizeT __sz,
+                   const _CharT* __s, _SizeT __pos, _SizeT __n) _NOEXCEPT
+{
+    if (__pos < __sz)
+        ++__pos;
+    else
+        __pos = __sz;
+    for (const _CharT* __ps = __p + __pos; __ps != __p;)
+        if (_Traits::find(__s, __n, *--__ps) == nullptr)
+            return static_cast<_SizeT>(__ps - __p);
+    return __npos;
+}
+
+
+template<class _CharT, class _SizeT, class _Traits, _SizeT __npos>
+inline _SizeT _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+__str_find_last_not_of(const _CharT *__p, _SizeT __sz,
+                         _CharT __c, _SizeT __pos) _NOEXCEPT
+{
+    if (__pos < __sz)
+        ++__pos;
+    else
+        __pos = __sz;
+    for (const _CharT* __ps = __p + __pos; __ps != __p;)
+        if (!_Traits::eq(*--__ps, __c))
+            return static_cast<_SizeT>(__ps - __p);
+    return __npos;
+}
+
+template<class _Ptr>
+inline _LIBCPP_INLINE_VISIBILITY
+size_t __do_string_hash(_Ptr __p, _Ptr __e)
+{
+    typedef typename iterator_traits<_Ptr>::value_type value_type;
+    return __murmur2_or_cityhash<size_t>()(__p, (__e-__p)*sizeof(value_type));
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___STRING_CHAR_TRAITS_H
diff --git a/app/src/main/cpp/libcxx/include/__string/extern_template_lists.h b/app/src/main/cpp/libcxx/include/__string/extern_template_lists.h
new file mode 100644
index 0000000..edbda7c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__string/extern_template_lists.h
@@ -0,0 +1,131 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___STRING_EXTERN_TEMPLATE_LISTS_H
+#define _LIBCPP___STRING_EXTERN_TEMPLATE_LISTS_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+// We maintain 2 ABI lists:
+// - _LIBCPP_STRING_V1_EXTERN_TEMPLATE_LIST
+// - _LIBCPP_STRING_UNSTABLE_EXTERN_TEMPLATE_LIST
+// As the name implies, the ABI lists define the V1 (Stable) and unstable ABI.
+//
+// For unstable, we may explicitly remove function that are external in V1,
+// and add (new) external functions to better control inlining and compiler
+// optimization opportunities.
+//
+// For stable, the ABI list should rarely change, except for adding new
+// functions supporting new c++ version / API changes. Typically entries
+// must never be removed from the stable list.
+#define _LIBCPP_STRING_V1_EXTERN_TEMPLATE_LIST(_Func, _CharType) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::replace(size_type, size_type, value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::rfind(value_type const*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__init(value_type const*, size_type, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::basic_string(basic_string const&)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::replace(size_type, size_type, value_type const*)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::basic_string(basic_string const&, allocator<_CharType> const&)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::find_last_not_of(value_type const*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::~basic_string()) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::find_first_not_of(value_type const*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::insert(size_type, size_type, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::operator=(value_type)) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__init(value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS const _CharType& basic_string<_CharType>::at(size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::insert(size_type, value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::find_first_of(value_type const*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::replace(size_type, size_type, size_type, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::assign(value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::reserve(size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::append(value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::assign(basic_string const&, size_type, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::copy(value_type*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::basic_string(basic_string const&, size_type, size_type, allocator<_CharType> const&)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::find(value_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__init(size_type, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::insert(size_type, value_type const*)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::find_last_of(value_type const*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__grow_by(size_type, size_type, size_type, size_type, size_type, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__grow_by_and_replace(size_type, size_type, size_type, size_type, size_type, size_type, value_type const*)) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::push_back(value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::append(size_type, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::rfind(value_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS const basic_string<_CharType>::size_type basic_string<_CharType>::npos) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::assign(size_type, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::erase(size_type, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::append(basic_string const&, size_type, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS int basic_string<_CharType>::compare(value_type const*) const) \
+  _Func(_LIBCPP_FUNC_VIS int basic_string<_CharType>::compare(size_type, size_type, value_type const*) const) \
+  _Func(_LIBCPP_FUNC_VIS _CharType& basic_string<_CharType>::at(size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::assign(value_type const*)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::find(value_type const*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS int basic_string<_CharType>::compare(size_type, size_type, basic_string const&, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS int basic_string<_CharType>::compare(size_type, size_type, value_type const*, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::operator=(basic_string const&)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::append(value_type const*)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::replace(size_type, size_type, basic_string const&, size_type, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::iterator basic_string<_CharType>::insert(basic_string::const_iterator, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::resize(size_type, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::insert(size_type, basic_string const&, size_type, size_type))
+
+#define _LIBCPP_STRING_UNSTABLE_EXTERN_TEMPLATE_LIST(_Func, _CharType) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::replace(size_type, size_type, value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::rfind(value_type const*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__init(value_type const*, size_type, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::replace(size_type, size_type, value_type const*)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::find_last_not_of(value_type const*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::~basic_string()) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::find_first_not_of(value_type const*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::insert(size_type, size_type, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::operator=(value_type)) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__init(value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__init_copy_ctor_external(value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS const _CharType& basic_string<_CharType>::at(size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::insert(size_type, value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::find_first_of(value_type const*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::replace(size_type, size_type, size_type, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::__assign_external(value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::__assign_external(value_type const*)) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::reserve(size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::append(value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::assign(basic_string const&, size_type, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::copy(value_type*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::basic_string(basic_string const&, size_type, size_type, allocator<_CharType> const&)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::find(value_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__init(size_type, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::insert(size_type, value_type const*)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::find_last_of(value_type const*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__grow_by(size_type, size_type, size_type, size_type, size_type, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__grow_by_and_replace(size_type, size_type, size_type, size_type, size_type, size_type, value_type const*)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::__assign_no_alias<false>(value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::__assign_no_alias<true>(value_type const*, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::push_back(value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::append(size_type, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::rfind(value_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS const basic_string<_CharType>::size_type basic_string<_CharType>::npos) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::assign(size_type, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__erase_external_with_move(size_type, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::append(basic_string const&, size_type, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS int basic_string<_CharType>::compare(value_type const*) const) \
+  _Func(_LIBCPP_FUNC_VIS int basic_string<_CharType>::compare(size_type, size_type, value_type const*) const) \
+  _Func(_LIBCPP_FUNC_VIS _CharType& basic_string<_CharType>::at(size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::size_type basic_string<_CharType>::find(value_type const*, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS int basic_string<_CharType>::compare(size_type, size_type, basic_string const&, size_type, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS int basic_string<_CharType>::compare(size_type, size_type, value_type const*, size_type) const) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::append(value_type const*)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::replace(size_type, size_type, basic_string const&, size_type, size_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>::iterator basic_string<_CharType>::insert(basic_string::const_iterator, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::resize(size_type, value_type)) \
+  _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::insert(size_type, basic_string const&, size_type, size_type))
+
+
+#endif // _LIBCPP___STRING_EXTERN_TEMPLATE_LISTS_H
diff --git a/app/src/main/cpp/libcxx/include/__support/android/locale_bionic.h b/app/src/main/cpp/libcxx/include/__support/android/locale_bionic.h
new file mode 100644
index 0000000..30e345c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/android/locale_bionic.h
@@ -0,0 +1,72 @@
+// -*- C++ -*-
+//===-----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_ANDROID_LOCALE_BIONIC_H
+#define _LIBCPP___SUPPORT_ANDROID_LOCALE_BIONIC_H
+
+#if defined(__BIONIC__)
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#include <stdlib.h>
+#include <xlocale.h>
+
+#ifdef __cplusplus
+}
+#endif
+
+#if defined(__ANDROID__)
+
+#include <android/api-level.h>
+#if __ANDROID_API__ < 21
+#include <__support/xlocale/__posix_l_fallback.h>
+#endif
+
+// If we do not have this header, we are in a platform build rather than an NDK
+// build, which will always be at least as new as the ToT NDK, in which case we
+// don't need any of the inlines below since libc provides them.
+#if __has_include(<android/ndk-version.h>)
+#include <android/ndk-version.h>
+// In NDK versions later than 16, locale-aware functions are provided by
+// legacy_stdlib_inlines.h
+#if __NDK_MAJOR__ <= 16
+#if __ANDROID_API__ < 21
+#include <__support/xlocale/__strtonum_fallback.h>
+#elif __ANDROID_API__ < 26
+
+#if defined(__cplusplus)
+extern "C" {
+#endif
+
+inline _LIBCPP_HIDE_FROM_ABI_C float strtof_l(const char* __nptr, char** __endptr, locale_t) {
+  return ::strtof(__nptr, __endptr);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C double strtod_l(const char* __nptr, char** __endptr, locale_t) {
+  return ::strtod(__nptr, __endptr);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C long strtol_l(const char* __nptr, char** __endptr, int __base, locale_t) {
+  return ::strtol(__nptr, __endptr, __base);
+}
+
+#if defined(__cplusplus)
+}
+#endif
+
+#endif // __ANDROID_API__ < 26
+
+#endif // __NDK_MAJOR__ <= 16
+#endif // __has_include(<android/ndk-version.h>)
+#endif // defined(__ANDROID__)
+
+#endif // defined(__BIONIC__)
+#endif // _LIBCPP___SUPPORT_ANDROID_LOCALE_BIONIC_H
diff --git a/app/src/main/cpp/libcxx/include/__support/fuchsia/xlocale.h b/app/src/main/cpp/libcxx/include/__support/fuchsia/xlocale.h
new file mode 100644
index 0000000..1e4ece8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/fuchsia/xlocale.h
@@ -0,0 +1,22 @@
+// -*- C++ -*-
+//===-----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_FUCHSIA_XLOCALE_H
+#define _LIBCPP___SUPPORT_FUCHSIA_XLOCALE_H
+
+#if defined(__Fuchsia__)
+
+#include <cstdlib>
+#include <cwchar>
+#include <__support/xlocale/__posix_l_fallback.h>
+#include <__support/xlocale/__strtonum_fallback.h>
+
+#endif // defined(__Fuchsia__)
+
+#endif // _LIBCPP___SUPPORT_FUCHSIA_XLOCALE_H
diff --git a/app/src/main/cpp/libcxx/include/__support/ibm/gettod_zos.h b/app/src/main/cpp/libcxx/include/__support/ibm/gettod_zos.h
new file mode 100644
index 0000000..fe7dc8b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/ibm/gettod_zos.h
@@ -0,0 +1,54 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_IBM_GETTOD_ZOS_H
+#define _LIBCPP___SUPPORT_IBM_GETTOD_ZOS_H
+
+#include <time.h>
+
+inline _LIBCPP_HIDE_FROM_ABI int
+gettimeofdayMonotonic(struct timespec64* Output) {
+
+  // The POSIX gettimeofday() function is not available on z/OS. Therefore,
+  // we will call stcke and other hardware instructions in implement equivalent.
+  // Note that nanoseconds alone will overflow when reaching new epoch in 2042.
+
+  struct _t {
+    uint64_t Hi;
+    uint64_t Lo;
+  };
+  struct _t Value = {0, 0};
+  uint64_t CC = 0;
+  asm(" stcke %0\n"
+      " ipm %1\n"
+      " srlg %1,%1,28\n"
+      : "=m"(Value), "+r"(CC)::);
+
+  if (CC != 0) {
+    errno = EMVSTODNOTSET;
+    return CC;
+  }
+  uint64_t us = (Value.Hi >> 4);
+  uint64_t ns = ((Value.Hi & 0x0F) << 8) + (Value.Lo >> 56);
+  ns = (ns * 1000) >> 12;
+  us = us - 2208988800000000;
+
+  register uint64_t DivPair0 asm("r0"); // dividend (upper half), remainder
+  DivPair0 = 0;
+  register uint64_t DivPair1 asm("r1"); // dividend (lower half), quotient
+  DivPair1 = us;
+  uint64_t Divisor = 1000000;
+  asm(" dlgr %0,%2" : "+r"(DivPair0), "+r"(DivPair1) : "r"(Divisor) :);
+
+  Output->tv_sec = DivPair1;
+  Output->tv_nsec = DivPair0 * 1000 + ns;
+  return 0;
+}
+
+#endif // _LIBCPP___SUPPORT_IBM_GETTOD_ZOS_H
diff --git a/app/src/main/cpp/libcxx/include/__support/ibm/locale_mgmt_zos.h b/app/src/main/cpp/libcxx/include/__support/ibm/locale_mgmt_zos.h
new file mode 100644
index 0000000..179f563
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/ibm/locale_mgmt_zos.h
@@ -0,0 +1,53 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_IBM_LOCALE_MGMT_ZOS_H
+#define _LIBCPP___SUPPORT_IBM_LOCALE_MGMT_ZOS_H
+
+#if defined(__MVS__)
+#include <locale.h>
+#include <string>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#define _LC_MAX           LC_MESSAGES          /* highest real category */
+#define _NCAT             (_LC_MAX + 1)        /* maximum + 1 */
+
+#define _CATMASK(n)       (1 << (n))
+#define LC_COLLATE_MASK   _CATMASK(LC_COLLATE)
+#define LC_CTYPE_MASK     _CATMASK(LC_CTYPE)
+#define LC_MONETARY_MASK  _CATMASK(LC_MONETARY)
+#define LC_NUMERIC_MASK   _CATMASK(LC_NUMERIC)
+#define LC_TIME_MASK      _CATMASK(LC_TIME)
+#define LC_MESSAGES_MASK  _CATMASK(LC_MESSAGES)
+#define LC_ALL_MASK       (_CATMASK(_NCAT) - 1)
+
+typedef struct locale_struct {
+  int category_mask;
+  std::string lc_collate;
+  std::string lc_ctype;
+  std::string lc_monetary;
+  std::string lc_numeric;
+  std::string lc_time;
+  std::string lc_messages;
+} * locale_t;
+
+// z/OS does not have newlocale, freelocale and uselocale.
+// The functions below are workarounds in single thread mode.
+locale_t newlocale(int category_mask, const char* locale, locale_t base);
+void freelocale(locale_t locobj);
+locale_t uselocale(locale_t newloc);
+
+#ifdef __cplusplus
+}
+#endif
+#endif // defined(__MVS__)
+#endif // _LIBCPP___SUPPORT_IBM_LOCALE_MGMT_ZOS_H
diff --git a/app/src/main/cpp/libcxx/include/__support/ibm/nanosleep.h b/app/src/main/cpp/libcxx/include/__support/ibm/nanosleep.h
new file mode 100644
index 0000000..7a32c66
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/ibm/nanosleep.h
@@ -0,0 +1,55 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_IBM_NANOSLEEP_H
+#define _LIBCPP___SUPPORT_IBM_NANOSLEEP_H
+
+#include <unistd.h>
+
+inline int nanosleep(const struct timespec* __req, struct timespec* __rem) {
+  // The nanosleep() function is not available on z/OS. Therefore, we will call
+  // sleep() to sleep for whole seconds and usleep() to sleep for any remaining
+  // fraction of a second. Any remaining nanoseconds will round up to the next
+  // microsecond.
+  if (__req->tv_sec < 0 || __req->tv_nsec < 0 || __req->tv_nsec > 999999999) {
+    errno = EINVAL;
+    return -1;
+  }
+  long __micro_sec = (__req->tv_nsec + 999) / 1000;
+  time_t __sec = __req->tv_sec;
+  if (__micro_sec > 999999) {
+    ++__sec;
+    __micro_sec -= 1000000;
+  }
+  __sec = static_cast<time_t>(sleep(static_cast<unsigned int>(__sec)));
+  if (__sec) {
+    if (__rem) {
+      // Updating the remaining time to sleep in case of unsuccessful call to sleep().
+      __rem->tv_sec = __sec;
+      __rem->tv_nsec = __micro_sec * 1000;
+    }
+    errno = EINTR;
+    return -1;
+  }
+  if (__micro_sec) {
+    int __rt = usleep(static_cast<unsigned int>(__micro_sec));
+    if (__rt != 0 && __rem) {
+      // The usleep() does not provide the amount of remaining time upon its failure,
+      // so the time slept will be ignored.
+      __rem->tv_sec = 0;
+      __rem->tv_nsec = __micro_sec * 1000;
+      // The errno is already set.
+      return -1;
+    }
+    return __rt;
+  }
+  return 0;
+}
+
+#endif // _LIBCPP___SUPPORT_IBM_NANOSLEEP_H
diff --git a/app/src/main/cpp/libcxx/include/__support/ibm/xlocale.h b/app/src/main/cpp/libcxx/include/__support/ibm/xlocale.h
new file mode 100644
index 0000000..03302b0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/ibm/xlocale.h
@@ -0,0 +1,129 @@
+// -*- C++ -*-
+//===-----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_IBM_XLOCALE_H
+#define _LIBCPP___SUPPORT_IBM_XLOCALE_H
+
+#if defined(__MVS__)
+#include <__support/ibm/locale_mgmt_zos.h>
+#endif // defined(__MVS__)
+
+#include <stdarg.h>
+
+#include "cstdlib"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if defined(__MVS__)
+#include <wctype.h>
+// POSIX routines
+#include <__support/xlocale/__posix_l_fallback.h>
+#endif // defined(__MVS__)
+
+namespace {
+
+struct __setAndRestore {
+  explicit __setAndRestore(locale_t locale) {
+    if (locale == (locale_t)0) {
+      __cloc = newlocale(LC_ALL_MASK, "C", /* base */ (locale_t)0);
+      __stored = uselocale(__cloc);
+    } else {
+      __stored = uselocale(locale);
+    }
+  }
+
+  ~__setAndRestore() {
+    uselocale(__stored);
+    if (__cloc)
+      freelocale(__cloc);
+  }
+
+private:
+  locale_t __stored = (locale_t)0;
+  locale_t __cloc = (locale_t)0;
+};
+
+} // namespace
+
+// The following are not POSIX routines.  These are quick-and-dirty hacks
+// to make things pretend to work
+inline _LIBCPP_HIDE_FROM_ABI long long
+strtoll_l(const char *__nptr, char **__endptr, int __base, locale_t locale) {
+  __setAndRestore __newloc(locale);
+  return ::strtoll(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long
+strtol_l(const char *__nptr, char **__endptr, int __base, locale_t locale) {
+  __setAndRestore __newloc(locale);
+  return ::strtol(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI double
+strtod_l(const char *__nptr, char **__endptr, locale_t locale) {
+  __setAndRestore __newloc(locale);
+  return ::strtod(__nptr, __endptr);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI float
+strtof_l(const char *__nptr, char **__endptr, locale_t locale) {
+  __setAndRestore __newloc(locale);
+  return ::strtof(__nptr, __endptr);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double
+strtold_l(const char *__nptr, char **__endptr, locale_t locale) {
+  __setAndRestore __newloc(locale);
+  return ::strtold(__nptr, __endptr);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI unsigned long long
+strtoull_l(const char *__nptr, char **__endptr, int __base, locale_t locale) {
+  __setAndRestore __newloc(locale);
+  return ::strtoull(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI unsigned long
+strtoul_l(const char *__nptr, char **__endptr, int __base, locale_t locale) {
+  __setAndRestore __newloc(locale);
+  return ::strtoul(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI int
+vasprintf(char **strp, const char *fmt, va_list ap) {
+  const size_t buff_size = 256;
+  if ((*strp = (char *)malloc(buff_size)) == NULL) {
+    return -1;
+  }
+
+  va_list ap_copy;
+  // va_copy may not be provided by the C library in C++ 03 mode.
+#if defined(_LIBCPP_CXX03_LANG) && __has_builtin(__builtin_va_copy)
+  __builtin_va_copy(ap_copy, ap);
+#else
+  va_copy(ap_copy, ap);
+#endif
+  int str_size = vsnprintf(*strp, buff_size, fmt,  ap_copy);
+  va_end(ap_copy);
+
+  if ((size_t) str_size >= buff_size) {
+    if ((*strp = (char *)realloc(*strp, str_size + 1)) == NULL) {
+      return -1;
+    }
+    str_size = vsnprintf(*strp, str_size + 1, fmt,  ap);
+  }
+  return str_size;
+}
+
+#ifdef __cplusplus
+}
+#endif
+#endif // _LIBCPP___SUPPORT_IBM_XLOCALE_H
diff --git a/app/src/main/cpp/libcxx/include/__support/musl/xlocale.h b/app/src/main/cpp/libcxx/include/__support/musl/xlocale.h
new file mode 100644
index 0000000..fe1dcf6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/musl/xlocale.h
@@ -0,0 +1,52 @@
+// -*- C++ -*-
+//===-----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+// This adds support for the extended locale functions that are currently
+// missing from the Musl C library.
+//
+// This only works when the specified locale is "C" or "POSIX", but that's
+// about as good as we can do without implementing full xlocale support
+// in Musl.
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_MUSL_XLOCALE_H
+#define _LIBCPP___SUPPORT_MUSL_XLOCALE_H
+
+#include <cstdlib>
+#include <cwchar>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+inline _LIBCPP_HIDE_FROM_ABI_C long long strtoll_l(const char* __nptr, char** __endptr, int __base, locale_t) {
+  return ::strtoll(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C unsigned long long
+strtoull_l(const char* __nptr, char** __endptr, int __base, locale_t) {
+  return ::strtoull(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C long long wcstoll_l(const wchar_t* __nptr, wchar_t** __endptr, int __base, locale_t) {
+  return ::wcstoll(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C long long wcstoull_l(const wchar_t* __nptr, wchar_t** __endptr, int __base, locale_t) {
+  return ::wcstoull(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C long double wcstold_l(const wchar_t* __nptr, wchar_t** __endptr, locale_t) {
+  return ::wcstold(__nptr, __endptr);
+}
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // _LIBCPP___SUPPORT_MUSL_XLOCALE_H
diff --git a/app/src/main/cpp/libcxx/include/__support/newlib/xlocale.h b/app/src/main/cpp/libcxx/include/__support/newlib/xlocale.h
new file mode 100644
index 0000000..4e54650
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/newlib/xlocale.h
@@ -0,0 +1,23 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_NEWLIB_XLOCALE_H
+#define _LIBCPP___SUPPORT_NEWLIB_XLOCALE_H
+
+#if defined(_NEWLIB_VERSION)
+
+#if !defined(__NEWLIB__) || __NEWLIB__ < 2 || \
+    __NEWLIB__ == 2 && __NEWLIB_MINOR__ < 5
+#include <__support/xlocale/__nop_locale_mgmt.h>
+#include <__support/xlocale/__posix_l_fallback.h>
+#include <__support/xlocale/__strtonum_fallback.h>
+#endif
+
+#endif // _NEWLIB_VERSION
+
+#endif
diff --git a/app/src/main/cpp/libcxx/include/__support/openbsd/xlocale.h b/app/src/main/cpp/libcxx/include/__support/openbsd/xlocale.h
new file mode 100644
index 0000000..b969ae9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/openbsd/xlocale.h
@@ -0,0 +1,35 @@
+// -*- C++ -*-
+//===-----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_OPENBSD_XLOCALE_H
+#define _LIBCPP___SUPPORT_OPENBSD_XLOCALE_H
+
+#include <__support/xlocale/__strtonum_fallback.h>
+#include <clocale>
+#include <cstdlib>
+#include <ctype.h>
+#include <cwctype>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+inline _LIBCPP_HIDE_FROM_ABI_C long strtol_l(const char* __nptr, char** __endptr, int __base, locale_t) {
+  return ::strtol(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C unsigned long strtoul_l(const char* __nptr, char** __endptr, int __base, locale_t) {
+  return ::strtoul(__nptr, __endptr, __base);
+}
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/app/src/main/cpp/libcxx/include/__support/solaris/floatingpoint.h b/app/src/main/cpp/libcxx/include/__support/solaris/floatingpoint.h
new file mode 100644
index 0000000..5f1628f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/solaris/floatingpoint.h
@@ -0,0 +1,13 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#define atof sun_atof
+#define strtod sun_strtod
+#include_next "floatingpoint.h"
+#undef atof
+#undef strtod
diff --git a/app/src/main/cpp/libcxx/include/__support/solaris/wchar.h b/app/src/main/cpp/libcxx/include/__support/solaris/wchar.h
new file mode 100644
index 0000000..f01fd74
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/solaris/wchar.h
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#define iswalpha sun_iswalpha
+#define iswupper sun_iswupper
+#define iswlower sun_iswlower
+#define iswdigit sun_iswdigit
+#define iswxdigit sun_iswxdigit
+#define iswalnum sun_iswalnum
+#define iswspace sun_iswspace
+#define iswpunct sun_iswpunct
+#define iswprint sun_iswprint
+#define iswgraph sun_iswgraph
+#define iswcntrl sun_iswcntrl
+#define iswctype sun_iswctype
+#define towlower sun_towlower
+#define towupper sun_towupper
+#define wcswcs sun_wcswcs
+#define wcswidth sun_wcswidth
+#define wcwidth sun_wcwidth
+#define wctype sun_wctype
+#define _WCHAR_T 1
+#include_next "wchar.h"
+#undef iswalpha
+#undef iswupper
+#undef iswlower
+#undef iswdigit
+#undef iswxdigit
+#undef iswalnum
+#undef iswspace
+#undef iswpunct
+#undef iswprint
+#undef iswgraph
+#undef iswcntrl
+#undef iswctype
+#undef towlower
+#undef towupper
+#undef wcswcs
+#undef wcswidth
+#undef wcwidth
+#undef wctype
diff --git a/app/src/main/cpp/libcxx/include/__support/solaris/xlocale.h b/app/src/main/cpp/libcxx/include/__support/solaris/xlocale.h
new file mode 100644
index 0000000..373fbfb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/solaris/xlocale.h
@@ -0,0 +1,75 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+////////////////////////////////////////////////////////////////////////////////
+// Minimal xlocale implementation for Solaris.  This implements the subset of
+// the xlocale APIs that libc++ depends on.
+////////////////////////////////////////////////////////////////////////////////
+#ifndef __XLOCALE_H_INCLUDED
+#define __XLOCALE_H_INCLUDED
+
+#include <stdlib.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+int snprintf_l(char *__s, size_t __n, locale_t __l, const char *__format, ...);
+int asprintf_l(char **__s, locale_t __l, const char *__format, ...);
+
+int sscanf_l(const char *__s, locale_t __l, const char *__format, ...);
+
+int toupper_l(int __c, locale_t __l);
+int tolower_l(int __c, locale_t __l);
+
+struct lconv *localeconv(void);
+struct lconv *localeconv_l(locale_t __l);
+
+// FIXME: These are quick-and-dirty hacks to make things pretend to work
+inline _LIBCPP_HIDE_FROM_ABI long long
+strtoll_l(const char *__nptr, char **__endptr, int __base, locale_t __loc) {
+  return ::strtoll(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long
+strtol_l(const char *__nptr, char **__endptr, int __base, locale_t __loc) {
+  return ::strtol(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI unsigned long long
+strtoull_l(const char *__nptr, char **__endptr, int __base, locale_t __loc)
+  return ::strtoull(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI unsigned long
+strtoul_l(const char *__nptr, char **__endptr, int __base, locale_t __loc) {
+  return ::strtoul(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI float
+strtof_l(const char *__nptr, char **__endptr, locale_t __loc) {
+  return ::strtof(__nptr, __endptr);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI double
+strtod_l(const char *__nptr, char **__endptr, locale_t __loc) {
+  return ::strtod(__nptr, __endptr);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double
+strtold_l(const char *__nptr, char **__endptr, locale_t __loc) {
+  return ::strtold(__nptr, __endptr);
+}
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/app/src/main/cpp/libcxx/include/__support/win32/locale_win32.h b/app/src/main/cpp/libcxx/include/__support/win32/locale_win32.h
new file mode 100644
index 0000000..b890804
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/win32/locale_win32.h
@@ -0,0 +1,282 @@
+// -*- C++ -*-
+//===-----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_WIN32_LOCALE_WIN32_H
+#define _LIBCPP___SUPPORT_WIN32_LOCALE_WIN32_H
+
+#include <__config>
+#include <cstddef>
+#include <locale.h> // _locale_t
+#include <stdio.h>
+#include <string>
+
+#define _X_ALL LC_ALL
+#define _X_COLLATE LC_COLLATE
+#define _X_CTYPE LC_CTYPE
+#define _X_MONETARY LC_MONETARY
+#define _X_NUMERIC LC_NUMERIC
+#define _X_TIME LC_TIME
+#define _X_MAX LC_MAX
+#define _X_MESSAGES 6
+#define _NCAT (_X_MESSAGES + 1)
+
+#define _CATMASK(n) ((1 << (n)) >> 1)
+#define _M_COLLATE _CATMASK(_X_COLLATE)
+#define _M_CTYPE _CATMASK(_X_CTYPE)
+#define _M_MONETARY _CATMASK(_X_MONETARY)
+#define _M_NUMERIC _CATMASK(_X_NUMERIC)
+#define _M_TIME _CATMASK(_X_TIME)
+#define _M_MESSAGES _CATMASK(_X_MESSAGES)
+#define _M_ALL (_CATMASK(_NCAT) - 1)
+
+#define LC_COLLATE_MASK _M_COLLATE
+#define LC_CTYPE_MASK _M_CTYPE
+#define LC_MONETARY_MASK _M_MONETARY
+#define LC_NUMERIC_MASK _M_NUMERIC
+#define LC_TIME_MASK _M_TIME
+#define LC_MESSAGES_MASK _M_MESSAGES
+#define LC_ALL_MASK (  LC_COLLATE_MASK \
+                     | LC_CTYPE_MASK \
+                     | LC_MESSAGES_MASK \
+                     | LC_MONETARY_MASK \
+                     | LC_NUMERIC_MASK \
+                     | LC_TIME_MASK )
+
+class __lconv_storage {
+public:
+    __lconv_storage(const lconv *__lc_input) {
+        __lc_ = *__lc_input;
+
+        __decimal_point_ = __lc_input->decimal_point;
+        __thousands_sep_ = __lc_input->thousands_sep;
+        __grouping_ = __lc_input->grouping;
+        __int_curr_symbol_ = __lc_input->int_curr_symbol;
+        __currency_symbol_ = __lc_input->currency_symbol;
+        __mon_decimal_point_ = __lc_input->mon_decimal_point;
+        __mon_thousands_sep_ = __lc_input->mon_thousands_sep;
+        __mon_grouping_ = __lc_input->mon_grouping;
+        __positive_sign_ = __lc_input->positive_sign;
+        __negative_sign_ = __lc_input->negative_sign;
+
+        __lc_.decimal_point = const_cast<char *>(__decimal_point_.c_str());
+        __lc_.thousands_sep = const_cast<char *>(__thousands_sep_.c_str());
+        __lc_.grouping = const_cast<char *>(__grouping_.c_str());
+        __lc_.int_curr_symbol = const_cast<char *>(__int_curr_symbol_.c_str());
+        __lc_.currency_symbol = const_cast<char *>(__currency_symbol_.c_str());
+        __lc_.mon_decimal_point = const_cast<char *>(__mon_decimal_point_.c_str());
+        __lc_.mon_thousands_sep = const_cast<char *>(__mon_thousands_sep_.c_str());
+        __lc_.mon_grouping = const_cast<char *>(__mon_grouping_.c_str());
+        __lc_.positive_sign = const_cast<char *>(__positive_sign_.c_str());
+        __lc_.negative_sign = const_cast<char *>(__negative_sign_.c_str());
+    }
+
+    lconv *__get() {
+        return &__lc_;
+    }
+private:
+    lconv __lc_;
+    std::string __decimal_point_;
+    std::string __thousands_sep_;
+    std::string __grouping_;
+    std::string __int_curr_symbol_;
+    std::string __currency_symbol_;
+    std::string __mon_decimal_point_;
+    std::string __mon_thousands_sep_;
+    std::string __mon_grouping_;
+    std::string __positive_sign_;
+    std::string __negative_sign_;
+};
+
+class locale_t {
+public:
+    locale_t()
+        : __locale_(nullptr), __locale_str_(nullptr), __lc_(nullptr) {}
+    locale_t(std::nullptr_t)
+        : __locale_(nullptr), __locale_str_(nullptr), __lc_(nullptr) {}
+    locale_t(_locale_t __xlocale, const char* __xlocale_str)
+        : __locale_(__xlocale), __locale_str_(__xlocale_str), __lc_(nullptr) {}
+    locale_t(const locale_t &__l)
+        : __locale_(__l.__locale_), __locale_str_(__l.__locale_str_), __lc_(nullptr) {}
+
+    ~locale_t() {
+        delete __lc_;
+    }
+
+    locale_t &operator =(const locale_t &__l) {
+        __locale_ = __l.__locale_;
+        __locale_str_ = __l.__locale_str_;
+        // __lc_ not copied
+        return *this;
+    }
+
+    friend bool operator==(const locale_t& __left, const locale_t& __right) {
+        return __left.__locale_ == __right.__locale_;
+    }
+
+    friend bool operator==(const locale_t& __left, int __right) {
+        return __left.__locale_ == nullptr && __right == 0;
+    }
+
+    friend bool operator==(const locale_t& __left, long long __right) {
+        return __left.__locale_ == nullptr && __right == 0;
+    }
+
+    friend bool operator==(const locale_t& __left, std::nullptr_t) {
+        return __left.__locale_ == nullptr;
+    }
+
+    friend bool operator==(int __left, const locale_t& __right) {
+        return __left == 0 && nullptr == __right.__locale_;
+    }
+
+    friend bool operator==(std::nullptr_t, const locale_t& __right) {
+        return nullptr == __right.__locale_;
+    }
+
+    friend bool operator!=(const locale_t& __left, const locale_t& __right) {
+        return !(__left == __right);
+    }
+
+    friend bool operator!=(const locale_t& __left, int __right) {
+        return !(__left == __right);
+    }
+
+    friend bool operator!=(const locale_t& __left, long long __right) {
+        return !(__left == __right);
+    }
+
+    friend bool operator!=(const locale_t& __left, std::nullptr_t __right) {
+        return !(__left == __right);
+    }
+
+    friend bool operator!=(int __left, const locale_t& __right) {
+        return !(__left == __right);
+    }
+
+    friend bool operator!=(std::nullptr_t __left, const locale_t& __right) {
+        return !(__left == __right);
+    }
+
+    operator bool() const {
+        return __locale_ != nullptr;
+    }
+
+    const char* __get_locale() const { return __locale_str_; }
+
+    operator _locale_t() const {
+        return __locale_;
+    }
+
+    lconv *__store_lconv(const lconv *__input_lc) {
+        delete __lc_;
+        __lc_ = new __lconv_storage(__input_lc);
+        return __lc_->__get();
+    }
+private:
+    _locale_t __locale_;
+    const char* __locale_str_;
+    __lconv_storage *__lc_ = nullptr;
+};
+
+// Locale management functions
+#define freelocale _free_locale
+// FIXME: base currently unused. Needs manual work to construct the new locale
+locale_t newlocale( int __mask, const char * __locale, locale_t __base );
+// uselocale can't be implemented on Windows because Windows allows partial modification
+// of thread-local locale and so _get_current_locale() returns a copy while uselocale does
+// not create any copies.
+// We can still implement raii even without uselocale though.
+
+
+lconv *localeconv_l( locale_t & __loc );
+size_t mbrlen_l( const char *__restrict __s, size_t __n,
+                 mbstate_t *__restrict __ps, locale_t __loc);
+size_t mbsrtowcs_l( wchar_t *__restrict __dst, const char **__restrict __src,
+                    size_t __len, mbstate_t *__restrict __ps, locale_t __loc );
+size_t wcrtomb_l( char *__restrict __s, wchar_t __wc, mbstate_t *__restrict __ps,
+                  locale_t __loc);
+size_t mbrtowc_l( wchar_t *__restrict __pwc, const char *__restrict __s,
+                  size_t __n, mbstate_t *__restrict __ps, locale_t __loc);
+size_t mbsnrtowcs_l( wchar_t *__restrict __dst, const char **__restrict __src,
+                     size_t __nms, size_t __len, mbstate_t *__restrict __ps, locale_t __loc);
+size_t wcsnrtombs_l( char *__restrict __dst, const wchar_t **__restrict __src,
+                     size_t __nwc, size_t __len, mbstate_t *__restrict __ps, locale_t __loc);
+wint_t btowc_l( int __c, locale_t __loc );
+int wctob_l( wint_t __c, locale_t __loc );
+
+decltype(MB_CUR_MAX) MB_CUR_MAX_L( locale_t __l );
+
+// the *_l functions are prefixed on Windows, only available for msvcr80+, VS2005+
+#define mbtowc_l _mbtowc_l
+#define strtoll_l _strtoi64_l
+#define strtoull_l _strtoui64_l
+#define strtod_l _strtod_l
+#if defined(_LIBCPP_MSVCRT)
+#define strtof_l _strtof_l
+#define strtold_l _strtold_l
+#else
+_LIBCPP_FUNC_VIS float strtof_l(const char*, char**, locale_t);
+_LIBCPP_FUNC_VIS long double strtold_l(const char*, char**, locale_t);
+#endif
+inline _LIBCPP_HIDE_FROM_ABI int
+islower_l(int __c, _locale_t __loc)
+{
+ return _islower_l((int)__c, __loc);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI int
+isupper_l(int __c, _locale_t __loc)
+{
+ return _isupper_l((int)__c, __loc);
+}
+
+#define isdigit_l _isdigit_l
+#define isxdigit_l _isxdigit_l
+#define strcoll_l _strcoll_l
+#define strxfrm_l _strxfrm_l
+#define wcscoll_l _wcscoll_l
+#define wcsxfrm_l _wcsxfrm_l
+#define toupper_l _toupper_l
+#define tolower_l _tolower_l
+#define iswspace_l _iswspace_l
+#define iswprint_l _iswprint_l
+#define iswcntrl_l _iswcntrl_l
+#define iswupper_l _iswupper_l
+#define iswlower_l _iswlower_l
+#define iswalpha_l _iswalpha_l
+#define iswdigit_l _iswdigit_l
+#define iswpunct_l _iswpunct_l
+#define iswxdigit_l _iswxdigit_l
+#define towupper_l _towupper_l
+#define towlower_l _towlower_l
+#if defined(__MINGW32__) && __MSVCRT_VERSION__ < 0x0800
+_LIBCPP_FUNC_VIS size_t strftime_l(char *ret, size_t n, const char *format,
+                                   const struct tm *tm, locale_t loc);
+#else
+#define strftime_l _strftime_l
+#endif
+#define sscanf_l( __s, __l, __f, ...) _sscanf_l( __s, __f, __l, __VA_ARGS__ )
+#define sprintf_l( __s, __l, __f, ... ) _sprintf_l( __s, __f, __l, __VA_ARGS__ )
+#define vsprintf_l( __s, __l, __f, ... ) _vsprintf_l( __s, __f, __l, __VA_ARGS__ )
+#define vsnprintf_l( __s, __n, __l, __f, ... ) _vsnprintf_l( __s, __n, __f, __l, __VA_ARGS__ )
+_LIBCPP_FUNC_VIS int snprintf_l(char *__ret, size_t __n, locale_t __loc, const char *__format, ...);
+_LIBCPP_FUNC_VIS int asprintf_l( char **__ret, locale_t __loc, const char *__format, ... );
+_LIBCPP_FUNC_VIS int vasprintf_l( char **__ret, locale_t __loc, const char *__format, va_list __ap );
+
+// not-so-pressing FIXME: use locale to determine blank characters
+inline int isblank_l( int __c, locale_t /*loc*/ )
+{
+    return ( __c == ' ' || __c == '\t' );
+}
+inline int iswblank_l( wint_t __c, locale_t /*loc*/ )
+{
+    return ( __c == L' ' || __c == L'\t' );
+}
+
+#endif // _LIBCPP___SUPPORT_WIN32_LOCALE_WIN32_H
diff --git a/app/src/main/cpp/libcxx/include/__support/xlocale/__nop_locale_mgmt.h b/app/src/main/cpp/libcxx/include/__support/xlocale/__nop_locale_mgmt.h
new file mode 100644
index 0000000..4b3caa8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/xlocale/__nop_locale_mgmt.h
@@ -0,0 +1,47 @@
+// -*- C++ -*-
+//===-----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_XLOCALE_NOP_LOCALE_MGMT_H
+#define _LIBCPP___SUPPORT_XLOCALE_NOP_LOCALE_MGMT_H
+
+#include <__config>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+// Patch over lack of extended locale support
+typedef void *locale_t;
+
+inline _LIBCPP_HIDE_FROM_ABI_C locale_t duplocale(locale_t) { return NULL; }
+
+inline _LIBCPP_HIDE_FROM_ABI_C void freelocale(locale_t) {}
+
+inline _LIBCPP_HIDE_FROM_ABI_C locale_t newlocale(int, const char*, locale_t) { return NULL; }
+
+inline _LIBCPP_HIDE_FROM_ABI_C locale_t uselocale(locale_t) { return NULL; }
+
+#define LC_COLLATE_MASK  (1 << LC_COLLATE)
+#define LC_CTYPE_MASK    (1 << LC_CTYPE)
+#define LC_MESSAGES_MASK (1 << LC_MESSAGES)
+#define LC_MONETARY_MASK (1 << LC_MONETARY)
+#define LC_NUMERIC_MASK  (1 << LC_NUMERIC)
+#define LC_TIME_MASK     (1 << LC_TIME)
+#define LC_ALL_MASK (LC_COLLATE_MASK|\
+                     LC_CTYPE_MASK|\
+                     LC_MONETARY_MASK|\
+                     LC_NUMERIC_MASK|\
+                     LC_TIME_MASK|\
+                     LC_MESSAGES_MASK)
+
+#ifdef __cplusplus
+} // extern "C"
+#endif
+
+#endif // _LIBCPP___SUPPORT_XLOCALE_NOP_LOCALE_MGMT_H
diff --git a/app/src/main/cpp/libcxx/include/__support/xlocale/__posix_l_fallback.h b/app/src/main/cpp/libcxx/include/__support/xlocale/__posix_l_fallback.h
new file mode 100644
index 0000000..774081a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/xlocale/__posix_l_fallback.h
@@ -0,0 +1,115 @@
+// -*- C++ -*-
+//===-----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+// These are reimplementations of some extended locale functions ( *_l ) that
+// are normally part of POSIX.  This shared implementation provides parts of the
+// extended locale support for libc's that normally don't have any (like
+// Android's bionic and Newlib).
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_XLOCALE_POSIX_L_FALLBACK_H
+#define _LIBCPP___SUPPORT_XLOCALE_POSIX_L_FALLBACK_H
+
+#include <__config>
+#include <ctype.h>
+#include <time.h>
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+#  include <wctype.h>
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+inline _LIBCPP_HIDE_FROM_ABI_C int isalnum_l(int __c, locale_t) { return ::isalnum(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int isalpha_l(int __c, locale_t) { return ::isalpha(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int isblank_l(int __c, locale_t) { return ::isblank(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int iscntrl_l(int __c, locale_t) { return ::iscntrl(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int isdigit_l(int __c, locale_t) { return ::isdigit(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int isgraph_l(int __c, locale_t) { return ::isgraph(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int islower_l(int __c, locale_t) { return ::islower(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int isprint_l(int __c, locale_t) { return ::isprint(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int ispunct_l(int __c, locale_t) { return ::ispunct(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int isspace_l(int __c, locale_t) { return ::isspace(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int isupper_l(int __c, locale_t) { return ::isupper(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int isxdigit_l(int __c, locale_t) { return ::isxdigit(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int toupper_l(int __c, locale_t) { return ::toupper(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int tolower_l(int __c, locale_t) { return ::tolower(__c); }
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+inline _LIBCPP_HIDE_FROM_ABI_C int iswalnum_l(wint_t __c, locale_t) { return ::iswalnum(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int iswalpha_l(wint_t __c, locale_t) { return ::iswalpha(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int iswblank_l(wint_t __c, locale_t) { return ::iswblank(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int iswcntrl_l(wint_t __c, locale_t) { return ::iswcntrl(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int iswdigit_l(wint_t __c, locale_t) { return ::iswdigit(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int iswgraph_l(wint_t __c, locale_t) { return ::iswgraph(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int iswlower_l(wint_t __c, locale_t) { return ::iswlower(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int iswprint_l(wint_t __c, locale_t) { return ::iswprint(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int iswpunct_l(wint_t __c, locale_t) { return ::iswpunct(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int iswspace_l(wint_t __c, locale_t) { return ::iswspace(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int iswupper_l(wint_t __c, locale_t) { return ::iswupper(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C int iswxdigit_l(wint_t __c, locale_t) { return ::iswxdigit(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C wint_t towupper_l(wint_t __c, locale_t) { return ::towupper(__c); }
+
+inline _LIBCPP_HIDE_FROM_ABI_C wint_t towlower_l(wint_t __c, locale_t) { return ::towlower(__c); }
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+inline _LIBCPP_HIDE_FROM_ABI_C int strcoll_l(const char* __s1, const char* __s2, locale_t) {
+  return ::strcoll(__s1, __s2);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C size_t strxfrm_l(char* __dest, const char* __src, size_t __n, locale_t) {
+  return ::strxfrm(__dest, __src, __n);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C size_t
+strftime_l(char* __s, size_t __max, const char* __format, const struct tm* __tm, locale_t) {
+  return ::strftime(__s, __max, __format, __tm);
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+inline _LIBCPP_HIDE_FROM_ABI_C int wcscoll_l(const wchar_t* __ws1, const wchar_t* __ws2, locale_t) {
+  return ::wcscoll(__ws1, __ws2);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C size_t wcsxfrm_l(wchar_t* __dest, const wchar_t* __src, size_t __n, locale_t) {
+  return ::wcsxfrm(__dest, __src, __n);
+}
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // _LIBCPP___SUPPORT_XLOCALE_POSIX_L_FALLBACK_H
diff --git a/app/src/main/cpp/libcxx/include/__support/xlocale/__strtonum_fallback.h b/app/src/main/cpp/libcxx/include/__support/xlocale/__strtonum_fallback.h
new file mode 100644
index 0000000..ae8e13a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__support/xlocale/__strtonum_fallback.h
@@ -0,0 +1,69 @@
+// -*- C++ -*-
+//===-----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+// These are reimplementations of some extended locale functions ( *_l ) that
+// aren't part of POSIX.  They are widely available though (GLIBC, BSD, maybe
+// others).  The unifying aspect in this case is that all of these functions
+// convert strings to some numeric type.
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___SUPPORT_XLOCALE_STRTONUM_FALLBACK_H
+#define _LIBCPP___SUPPORT_XLOCALE_STRTONUM_FALLBACK_H
+
+#include <__config>
+#include <stdlib.h>
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+#  include <wchar.h>
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+inline _LIBCPP_HIDE_FROM_ABI_C float strtof_l(const char* __nptr, char** __endptr, locale_t) {
+  return ::strtof(__nptr, __endptr);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C double strtod_l(const char* __nptr, char** __endptr, locale_t) {
+  return ::strtod(__nptr, __endptr);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C long double strtold_l(const char* __nptr, char** __endptr, locale_t) {
+  return ::strtold(__nptr, __endptr);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C long long strtoll_l(const char* __nptr, char** __endptr, int __base, locale_t) {
+  return ::strtoll(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C unsigned long long
+strtoull_l(const char* __nptr, char** __endptr, int __base, locale_t) {
+  return ::strtoull(__nptr, __endptr, __base);
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+inline _LIBCPP_HIDE_FROM_ABI_C long long wcstoll_l(const wchar_t* __nptr, wchar_t** __endptr, int __base, locale_t) {
+  return ::wcstoll(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C unsigned long long
+wcstoull_l(const wchar_t* __nptr, wchar_t** __endptr, int __base, locale_t) {
+  return ::wcstoull(__nptr, __endptr, __base);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI_C long double wcstold_l(const wchar_t* __nptr, wchar_t** __endptr, locale_t) {
+  return ::wcstold(__nptr, __endptr);
+}
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // _LIBCPP___SUPPORT_XLOCALE_STRTONUM_FALLBACK_H
diff --git a/app/src/main/cpp/libcxx/include/__thread/poll_with_backoff.h b/app/src/main/cpp/libcxx/include/__thread/poll_with_backoff.h
new file mode 100644
index 0000000..d027a27
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__thread/poll_with_backoff.h
@@ -0,0 +1,71 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___THREAD_POLL_WITH_BACKOFF_H
+#define _LIBCPP___THREAD_POLL_WITH_BACKOFF_H
+
+#include <__availability>
+#include <__chrono/duration.h>
+#include <__chrono/high_resolution_clock.h>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+static _LIBCPP_CONSTEXPR const int __libcpp_polling_count = 64;
+
+// Polls a thread for a condition given by a predicate, and backs off based on a backoff policy
+// before polling again.
+//
+// - __f is the "test function" that should return true if polling succeeded, and false if it failed.
+//
+// - __bf is the "backoff policy", which is called with the duration since we started polling. It should
+//   return false in order to resume polling, and true if polling should stop entirely for some reason.
+//   In general, backoff policies sleep for some time before returning control to the polling loop.
+//
+// - __max_elapsed is the maximum duration to try polling for. If the maximum duration is exceeded,
+//   the polling loop will return false to report a timeout.
+template<class _Fn, class _BFn>
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI
+bool __libcpp_thread_poll_with_backoff(_Fn&& __f, _BFn&& __bf, chrono::nanoseconds __max_elapsed = chrono::nanoseconds::zero()) {
+    auto const __start = chrono::high_resolution_clock::now();
+    for (int __count = 0;;) {
+      if (__f())
+        return true; // _Fn completion means success
+      if (__count < __libcpp_polling_count) {
+        __count += 1;
+        continue;
+      }
+      chrono::nanoseconds const __elapsed = chrono::high_resolution_clock::now() - __start;
+      if (__max_elapsed != chrono::nanoseconds::zero() && __max_elapsed < __elapsed)
+          return false; // timeout failure
+      if (__bf(__elapsed))
+        return false; // _BFn completion means failure
+    }
+}
+
+// A trivial backoff policy that always immediately returns the control to
+// the polling loop.
+//
+// This is not very well-behaved since it will cause the polling loop to spin,
+// so this should most likely only be used on single-threaded systems where there
+// are no other threads to compete with.
+struct __spinning_backoff_policy {
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+  bool operator()(chrono::nanoseconds const&) const {
+      return false;
+  }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___THREAD_POLL_WITH_BACKOFF_H
diff --git a/app/src/main/cpp/libcxx/include/__thread/timed_backoff_policy.h b/app/src/main/cpp/libcxx/include/__thread/timed_backoff_policy.h
new file mode 100644
index 0000000..a54b296
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__thread/timed_backoff_policy.h
@@ -0,0 +1,46 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___THREAD_TIMED_BACKOFF_POLICY_H
+#define _LIBCPP___THREAD_TIMED_BACKOFF_POLICY_H
+
+#include <__config>
+
+#ifndef _LIBCPP_HAS_NO_THREADS
+
+#  include <__chrono/duration.h>
+#  include <__threading_support>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+struct __libcpp_timed_backoff_policy {
+  _LIBCPP_INLINE_VISIBILITY
+  bool operator()(chrono::nanoseconds __elapsed) const
+  {
+      if(__elapsed > chrono::milliseconds(128))
+          __libcpp_thread_sleep_for(chrono::milliseconds(8));
+      else if(__elapsed > chrono::microseconds(64))
+          __libcpp_thread_sleep_for(__elapsed / 2);
+      else if(__elapsed > chrono::microseconds(4))
+        __libcpp_thread_yield();
+      else
+        {} // poll
+      return false;
+  }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_HAS_NO_THREADS
+
+#endif // _LIBCPP___THREAD_TIMED_BACKOFF_POLICY_H
diff --git a/app/src/main/cpp/libcxx/include/__threading_support b/app/src/main/cpp/libcxx/include/__threading_support
new file mode 100644
index 0000000..dcf2763
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__threading_support
@@ -0,0 +1,706 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___THREADING_SUPPORT
+#define _LIBCPP___THREADING_SUPPORT
+
+#include <__availability>
+#include <__chrono/convert_to_timespec.h>
+#include <__chrono/duration.h>
+#include <__compare/ordering.h>
+#include <__config>
+#include <__fwd/hash.h>
+#include <__thread/poll_with_backoff.h>
+#include <errno.h>
+#include <iosfwd>
+#include <limits>
+
+#ifdef __MVS__
+# include <__support/ibm/nanosleep.h>
+#endif
+
+#ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
+#  pragma GCC system_header
+#endif
+
+#if defined(_LIBCPP_HAS_THREAD_API_EXTERNAL)
+# include <__external_threading>
+#elif !defined(_LIBCPP_HAS_NO_THREADS)
+
+#if defined(_LIBCPP_HAS_THREAD_API_PTHREAD)
+# include <pthread.h>
+# include <sched.h>
+#elif defined(_LIBCPP_HAS_THREAD_API_C11)
+# include <threads.h>
+#endif
+
+#if defined(_LIBCPP_HAS_THREAD_LIBRARY_EXTERNAL) || \
+    defined(_LIBCPP_BUILDING_THREAD_LIBRARY_EXTERNAL) || \
+    defined(_LIBCPP_HAS_THREAD_API_WIN32)
+#define _LIBCPP_THREAD_ABI_VISIBILITY _LIBCPP_FUNC_VIS
+#else
+#define _LIBCPP_THREAD_ABI_VISIBILITY inline _LIBCPP_INLINE_VISIBILITY
+#endif
+
+#if defined(__FreeBSD__) && defined(__clang__) && __has_attribute(no_thread_safety_analysis)
+#define _LIBCPP_NO_THREAD_SAFETY_ANALYSIS __attribute__((no_thread_safety_analysis))
+#else
+#define _LIBCPP_NO_THREAD_SAFETY_ANALYSIS
+#endif
+
+typedef ::timespec __libcpp_timespec_t;
+#endif // !defined(_LIBCPP_HAS_NO_THREADS)
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if !defined(_LIBCPP_HAS_NO_THREADS)
+
+#if defined(_LIBCPP_HAS_THREAD_API_PTHREAD)
+// Mutex
+typedef pthread_mutex_t __libcpp_mutex_t;
+#define _LIBCPP_MUTEX_INITIALIZER PTHREAD_MUTEX_INITIALIZER
+
+typedef pthread_mutex_t __libcpp_recursive_mutex_t;
+
+// Condition Variable
+typedef pthread_cond_t __libcpp_condvar_t;
+#define _LIBCPP_CONDVAR_INITIALIZER PTHREAD_COND_INITIALIZER
+
+// Execute once
+typedef pthread_once_t __libcpp_exec_once_flag;
+#define _LIBCPP_EXEC_ONCE_INITIALIZER PTHREAD_ONCE_INIT
+
+// Thread id
+#if defined(__MVS__)
+  typedef unsigned long long __libcpp_thread_id;
+#else
+  typedef pthread_t __libcpp_thread_id;
+#endif
+
+// Thread
+#define _LIBCPP_NULL_THREAD ((__libcpp_thread_t()))
+typedef pthread_t __libcpp_thread_t;
+
+// Thread Local Storage
+typedef pthread_key_t __libcpp_tls_key;
+
+#define _LIBCPP_TLS_DESTRUCTOR_CC
+#elif defined(_LIBCPP_HAS_THREAD_API_C11)
+// Mutex
+typedef mtx_t __libcpp_mutex_t;
+// mtx_t is a struct so using {} for initialization is valid.
+#define _LIBCPP_MUTEX_INITIALIZER {}
+
+typedef mtx_t __libcpp_recursive_mutex_t;
+
+// Condition Variable
+typedef cnd_t __libcpp_condvar_t;
+// cnd_t is a struct so using {} for initialization is valid.
+#define _LIBCPP_CONDVAR_INITIALIZER {}
+
+// Execute once
+typedef once_flag __libcpp_exec_once_flag;
+#define _LIBCPP_EXEC_ONCE_INITIALIZER ONCE_FLAG_INIT
+
+// Thread id
+typedef thrd_t __libcpp_thread_id;
+
+// Thread
+#define _LIBCPP_NULL_THREAD 0U
+
+typedef thrd_t __libcpp_thread_t;
+
+// Thread Local Storage
+typedef tss_t __libcpp_tls_key;
+
+#define _LIBCPP_TLS_DESTRUCTOR_CC
+#elif !defined(_LIBCPP_HAS_THREAD_API_EXTERNAL)
+// Mutex
+typedef void* __libcpp_mutex_t;
+#define _LIBCPP_MUTEX_INITIALIZER 0
+
+#if defined(_M_IX86) || defined(__i386__) || defined(_M_ARM) || defined(__arm__)
+typedef void* __libcpp_recursive_mutex_t[6];
+#elif defined(_M_AMD64) || defined(__x86_64__) || defined(_M_ARM64) || defined(__aarch64__)
+typedef void* __libcpp_recursive_mutex_t[5];
+#else
+# error Unsupported architecture
+#endif
+
+// Condition Variable
+typedef void* __libcpp_condvar_t;
+#define _LIBCPP_CONDVAR_INITIALIZER 0
+
+// Execute Once
+typedef void* __libcpp_exec_once_flag;
+#define _LIBCPP_EXEC_ONCE_INITIALIZER 0
+
+// Thread ID
+typedef long __libcpp_thread_id;
+
+// Thread
+#define _LIBCPP_NULL_THREAD 0U
+
+typedef void* __libcpp_thread_t;
+
+// Thread Local Storage
+typedef long __libcpp_tls_key;
+
+#define _LIBCPP_TLS_DESTRUCTOR_CC __stdcall
+#endif // !defined(_LIBCPP_HAS_THREAD_API_PTHREAD) && !defined(_LIBCPP_HAS_THREAD_API_EXTERNAL)
+
+#if !defined(_LIBCPP_HAS_THREAD_API_EXTERNAL)
+// Mutex
+_LIBCPP_THREAD_ABI_VISIBILITY
+int __libcpp_recursive_mutex_init(__libcpp_recursive_mutex_t *__m);
+
+_LIBCPP_THREAD_ABI_VISIBILITY _LIBCPP_NO_THREAD_SAFETY_ANALYSIS
+int __libcpp_recursive_mutex_lock(__libcpp_recursive_mutex_t *__m);
+
+_LIBCPP_THREAD_ABI_VISIBILITY _LIBCPP_NO_THREAD_SAFETY_ANALYSIS
+bool __libcpp_recursive_mutex_trylock(__libcpp_recursive_mutex_t *__m);
+
+_LIBCPP_THREAD_ABI_VISIBILITY _LIBCPP_NO_THREAD_SAFETY_ANALYSIS
+int __libcpp_recursive_mutex_unlock(__libcpp_recursive_mutex_t *__m);
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+int __libcpp_recursive_mutex_destroy(__libcpp_recursive_mutex_t *__m);
+
+_LIBCPP_THREAD_ABI_VISIBILITY _LIBCPP_NO_THREAD_SAFETY_ANALYSIS
+int __libcpp_mutex_lock(__libcpp_mutex_t *__m);
+
+_LIBCPP_THREAD_ABI_VISIBILITY _LIBCPP_NO_THREAD_SAFETY_ANALYSIS
+bool __libcpp_mutex_trylock(__libcpp_mutex_t *__m);
+
+_LIBCPP_THREAD_ABI_VISIBILITY _LIBCPP_NO_THREAD_SAFETY_ANALYSIS
+int __libcpp_mutex_unlock(__libcpp_mutex_t *__m);
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+int __libcpp_mutex_destroy(__libcpp_mutex_t *__m);
+
+// Condition variable
+_LIBCPP_THREAD_ABI_VISIBILITY
+int __libcpp_condvar_signal(__libcpp_condvar_t* __cv);
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+int __libcpp_condvar_broadcast(__libcpp_condvar_t* __cv);
+
+_LIBCPP_THREAD_ABI_VISIBILITY _LIBCPP_NO_THREAD_SAFETY_ANALYSIS
+int __libcpp_condvar_wait(__libcpp_condvar_t* __cv, __libcpp_mutex_t* __m);
+
+_LIBCPP_THREAD_ABI_VISIBILITY _LIBCPP_NO_THREAD_SAFETY_ANALYSIS
+int __libcpp_condvar_timedwait(__libcpp_condvar_t *__cv, __libcpp_mutex_t *__m,
+                               __libcpp_timespec_t *__ts);
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+int __libcpp_condvar_destroy(__libcpp_condvar_t* __cv);
+
+// Execute once
+_LIBCPP_THREAD_ABI_VISIBILITY
+int __libcpp_execute_once(__libcpp_exec_once_flag *__flag,
+                          void (*__init_routine)());
+
+// Thread id
+_LIBCPP_THREAD_ABI_VISIBILITY
+bool __libcpp_thread_id_equal(__libcpp_thread_id __t1, __libcpp_thread_id __t2);
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+bool __libcpp_thread_id_less(__libcpp_thread_id __t1, __libcpp_thread_id __t2);
+
+// Thread
+_LIBCPP_THREAD_ABI_VISIBILITY
+bool __libcpp_thread_isnull(const __libcpp_thread_t *__t);
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+int __libcpp_thread_create(__libcpp_thread_t *__t, void *(*__func)(void *),
+                           void *__arg);
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+__libcpp_thread_id __libcpp_thread_get_current_id();
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+__libcpp_thread_id __libcpp_thread_get_id(const __libcpp_thread_t *__t);
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+int __libcpp_thread_join(__libcpp_thread_t *__t);
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+int __libcpp_thread_detach(__libcpp_thread_t *__t);
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+void __libcpp_thread_yield();
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+void __libcpp_thread_sleep_for(const chrono::nanoseconds& __ns);
+
+// Thread local storage
+_LIBCPP_THREAD_ABI_VISIBILITY
+int __libcpp_tls_create(__libcpp_tls_key* __key,
+                        void(_LIBCPP_TLS_DESTRUCTOR_CC* __at_exit)(void*));
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+void *__libcpp_tls_get(__libcpp_tls_key __key);
+
+_LIBCPP_THREAD_ABI_VISIBILITY
+int __libcpp_tls_set(__libcpp_tls_key __key, void *__p);
+
+#endif // !defined(_LIBCPP_HAS_THREAD_API_EXTERNAL)
+
+#if (!defined(_LIBCPP_HAS_THREAD_LIBRARY_EXTERNAL) || \
+     defined(_LIBCPP_BUILDING_THREAD_LIBRARY_EXTERNAL))
+
+#if defined(_LIBCPP_HAS_THREAD_API_PTHREAD)
+
+int __libcpp_recursive_mutex_init(__libcpp_recursive_mutex_t *__m)
+{
+  pthread_mutexattr_t attr;
+  int __ec = pthread_mutexattr_init(&attr);
+  if (__ec)
+    return __ec;
+  __ec = pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_RECURSIVE);
+  if (__ec) {
+    pthread_mutexattr_destroy(&attr);
+    return __ec;
+  }
+  __ec = pthread_mutex_init(__m, &attr);
+  if (__ec) {
+    pthread_mutexattr_destroy(&attr);
+    return __ec;
+  }
+  __ec = pthread_mutexattr_destroy(&attr);
+  if (__ec) {
+    pthread_mutex_destroy(__m);
+    return __ec;
+  }
+  return 0;
+}
+
+int __libcpp_recursive_mutex_lock(__libcpp_recursive_mutex_t *__m)
+{
+  return pthread_mutex_lock(__m);
+}
+
+bool __libcpp_recursive_mutex_trylock(__libcpp_recursive_mutex_t *__m)
+{
+  return pthread_mutex_trylock(__m) == 0;
+}
+
+int __libcpp_recursive_mutex_unlock(__libcpp_recursive_mutex_t *__m)
+{
+  return pthread_mutex_unlock(__m);
+}
+
+int __libcpp_recursive_mutex_destroy(__libcpp_recursive_mutex_t *__m)
+{
+  return pthread_mutex_destroy(__m);
+}
+
+int __libcpp_mutex_lock(__libcpp_mutex_t *__m)
+{
+  return pthread_mutex_lock(__m);
+}
+
+bool __libcpp_mutex_trylock(__libcpp_mutex_t *__m)
+{
+  return pthread_mutex_trylock(__m) == 0;
+}
+
+int __libcpp_mutex_unlock(__libcpp_mutex_t *__m)
+{
+  return pthread_mutex_unlock(__m);
+}
+
+int __libcpp_mutex_destroy(__libcpp_mutex_t *__m)
+{
+  return pthread_mutex_destroy(__m);
+}
+
+// Condition Variable
+int __libcpp_condvar_signal(__libcpp_condvar_t *__cv)
+{
+  return pthread_cond_signal(__cv);
+}
+
+int __libcpp_condvar_broadcast(__libcpp_condvar_t *__cv)
+{
+  return pthread_cond_broadcast(__cv);
+}
+
+int __libcpp_condvar_wait(__libcpp_condvar_t *__cv, __libcpp_mutex_t *__m)
+{
+  return pthread_cond_wait(__cv, __m);
+}
+
+int __libcpp_condvar_timedwait(__libcpp_condvar_t *__cv, __libcpp_mutex_t *__m,
+                               __libcpp_timespec_t *__ts)
+{
+  return pthread_cond_timedwait(__cv, __m, __ts);
+}
+
+int __libcpp_condvar_destroy(__libcpp_condvar_t *__cv)
+{
+  return pthread_cond_destroy(__cv);
+}
+
+// Execute once
+int __libcpp_execute_once(__libcpp_exec_once_flag *__flag,
+                          void (*__init_routine)()) {
+  return pthread_once(__flag, __init_routine);
+}
+
+// Thread id
+// Returns non-zero if the thread ids are equal, otherwise 0
+bool __libcpp_thread_id_equal(__libcpp_thread_id __t1, __libcpp_thread_id __t2)
+{
+  return __t1 == __t2;
+}
+
+// Returns non-zero if t1 < t2, otherwise 0
+bool __libcpp_thread_id_less(__libcpp_thread_id __t1, __libcpp_thread_id __t2)
+{
+  return __t1 < __t2;
+}
+
+// Thread
+bool __libcpp_thread_isnull(const __libcpp_thread_t *__t) {
+  return __libcpp_thread_get_id(__t) == 0;
+}
+
+int __libcpp_thread_create(__libcpp_thread_t *__t, void *(*__func)(void *),
+                           void *__arg)
+{
+  return pthread_create(__t, nullptr, __func, __arg);
+}
+
+__libcpp_thread_id __libcpp_thread_get_current_id()
+{
+  const __libcpp_thread_t thread = pthread_self();
+  return __libcpp_thread_get_id(&thread);
+}
+
+__libcpp_thread_id __libcpp_thread_get_id(const __libcpp_thread_t *__t)
+{
+#if defined(__MVS__)
+  return __t->__;
+#else
+  return *__t;
+#endif
+}
+
+int __libcpp_thread_join(__libcpp_thread_t *__t)
+{
+  return pthread_join(*__t, nullptr);
+}
+
+int __libcpp_thread_detach(__libcpp_thread_t *__t)
+{
+  return pthread_detach(*__t);
+}
+
+void __libcpp_thread_yield()
+{
+  sched_yield();
+}
+
+void __libcpp_thread_sleep_for(const chrono::nanoseconds& __ns)
+{
+   __libcpp_timespec_t __ts = _VSTD::__convert_to_timespec<__libcpp_timespec_t>(__ns);
+   while (nanosleep(&__ts, &__ts) == -1 && errno == EINTR);
+}
+
+// Thread local storage
+int __libcpp_tls_create(__libcpp_tls_key *__key, void (*__at_exit)(void *))
+{
+  return pthread_key_create(__key, __at_exit);
+}
+
+void *__libcpp_tls_get(__libcpp_tls_key __key)
+{
+  return pthread_getspecific(__key);
+}
+
+int __libcpp_tls_set(__libcpp_tls_key __key, void *__p)
+{
+    return pthread_setspecific(__key, __p);
+}
+
+#elif defined(_LIBCPP_HAS_THREAD_API_C11)
+
+int __libcpp_recursive_mutex_init(__libcpp_recursive_mutex_t *__m)
+{
+  return mtx_init(__m, mtx_plain | mtx_recursive) == thrd_success ? 0 : EINVAL;
+}
+
+int __libcpp_recursive_mutex_lock(__libcpp_recursive_mutex_t *__m)
+{
+  return mtx_lock(__m) == thrd_success ? 0 : EINVAL;
+}
+
+bool __libcpp_recursive_mutex_trylock(__libcpp_recursive_mutex_t *__m)
+{
+  return mtx_trylock(__m) == thrd_success;
+}
+
+int __libcpp_recursive_mutex_unlock(__libcpp_recursive_mutex_t *__m)
+{
+  return mtx_unlock(__m) == thrd_success ? 0 : EINVAL;
+}
+
+int __libcpp_recursive_mutex_destroy(__libcpp_recursive_mutex_t *__m)
+{
+  mtx_destroy(__m);
+  return 0;
+}
+
+int __libcpp_mutex_lock(__libcpp_mutex_t *__m)
+{
+  return mtx_lock(__m) == thrd_success ? 0 : EINVAL;
+}
+
+bool __libcpp_mutex_trylock(__libcpp_mutex_t *__m)
+{
+  return mtx_trylock(__m) == thrd_success;
+}
+
+int __libcpp_mutex_unlock(__libcpp_mutex_t *__m)
+{
+  return mtx_unlock(__m) == thrd_success ? 0 : EINVAL;
+}
+
+int __libcpp_mutex_destroy(__libcpp_mutex_t *__m)
+{
+  mtx_destroy(__m);
+  return 0;
+}
+
+// Condition Variable
+int __libcpp_condvar_signal(__libcpp_condvar_t *__cv)
+{
+  return cnd_signal(__cv) == thrd_success ? 0 : EINVAL;
+}
+
+int __libcpp_condvar_broadcast(__libcpp_condvar_t *__cv)
+{
+  return cnd_broadcast(__cv) == thrd_success ? 0 : EINVAL;
+}
+
+int __libcpp_condvar_wait(__libcpp_condvar_t *__cv, __libcpp_mutex_t *__m)
+{
+  return cnd_wait(__cv, __m) == thrd_success ? 0 : EINVAL;
+}
+
+int __libcpp_condvar_timedwait(__libcpp_condvar_t *__cv, __libcpp_mutex_t *__m,
+                               timespec *__ts)
+{
+  int __ec = cnd_timedwait(__cv, __m, __ts);
+  return __ec == thrd_timedout ? ETIMEDOUT : __ec;
+}
+
+int __libcpp_condvar_destroy(__libcpp_condvar_t *__cv)
+{
+  cnd_destroy(__cv);
+  return 0;
+}
+
+// Execute once
+int __libcpp_execute_once(__libcpp_exec_once_flag *flag,
+                          void (*init_routine)(void)) {
+  ::call_once(flag, init_routine);
+  return 0;
+}
+
+// Thread id
+// Returns non-zero if the thread ids are equal, otherwise 0
+bool __libcpp_thread_id_equal(__libcpp_thread_id t1, __libcpp_thread_id t2)
+{
+  return thrd_equal(t1, t2) != 0;
+}
+
+// Returns non-zero if t1 < t2, otherwise 0
+bool __libcpp_thread_id_less(__libcpp_thread_id t1, __libcpp_thread_id t2)
+{
+  return t1 < t2;
+}
+
+// Thread
+bool __libcpp_thread_isnull(const __libcpp_thread_t *__t) {
+  return __libcpp_thread_get_id(__t) == 0;
+}
+
+int __libcpp_thread_create(__libcpp_thread_t *__t, void *(*__func)(void *),
+                           void *__arg)
+{
+  int __ec = thrd_create(__t, reinterpret_cast<thrd_start_t>(__func), __arg);
+  return __ec == thrd_nomem ? ENOMEM : __ec;
+}
+
+__libcpp_thread_id __libcpp_thread_get_current_id()
+{
+  return thrd_current();
+}
+
+__libcpp_thread_id __libcpp_thread_get_id(const __libcpp_thread_t *__t)
+{
+  return *__t;
+}
+
+int __libcpp_thread_join(__libcpp_thread_t *__t)
+{
+  return thrd_join(*__t, nullptr) == thrd_success ? 0 : EINVAL;
+}
+
+int __libcpp_thread_detach(__libcpp_thread_t *__t)
+{
+  return thrd_detach(*__t) == thrd_success ? 0 : EINVAL;
+}
+
+void __libcpp_thread_yield()
+{
+  thrd_yield();
+}
+
+void __libcpp_thread_sleep_for(const chrono::nanoseconds& __ns)
+{
+   __libcpp_timespec_t __ts = _VSTD::__convert_to_timespec<__libcpp_timespec_t>(__ns);
+  thrd_sleep(&__ts, nullptr);
+}
+
+// Thread local storage
+int __libcpp_tls_create(__libcpp_tls_key *__key, void (*__at_exit)(void *))
+{
+  return tss_create(__key, __at_exit) == thrd_success ? 0 : EINVAL;
+}
+
+void *__libcpp_tls_get(__libcpp_tls_key __key)
+{
+  return tss_get(__key);
+}
+
+int __libcpp_tls_set(__libcpp_tls_key __key, void *__p)
+{
+  return tss_set(__key, __p) == thrd_success ? 0 : EINVAL;
+}
+
+#endif
+
+
+#endif // !_LIBCPP_HAS_THREAD_LIBRARY_EXTERNAL || _LIBCPP_BUILDING_THREAD_LIBRARY_EXTERNAL
+
+class _LIBCPP_TYPE_VIS thread;
+class _LIBCPP_TYPE_VIS __thread_id;
+
+namespace this_thread
+{
+
+_LIBCPP_INLINE_VISIBILITY __thread_id get_id() _NOEXCEPT;
+
+} // namespace this_thread
+
+template<> struct hash<__thread_id>;
+
+class _LIBCPP_TEMPLATE_VIS __thread_id
+{
+    // FIXME: pthread_t is a pointer on Darwin but a long on Linux.
+    // NULL is the no-thread value on Darwin.  Someone needs to check
+    // on other platforms.  We assume 0 works everywhere for now.
+    __libcpp_thread_id __id_;
+
+    static _LIBCPP_HIDE_FROM_ABI
+        bool __lt_impl(__thread_id __x, __thread_id __y) _NOEXCEPT
+        { // id==0 is always less than any other thread_id
+        if (__x.__id_ == 0) return __y.__id_ != 0;
+        if (__y.__id_ == 0) return false;
+        return  __libcpp_thread_id_less(__x.__id_, __y.__id_);
+        }
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __thread_id() _NOEXCEPT : __id_(0) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __reset() { __id_ = 0; }
+
+    friend _LIBCPP_HIDE_FROM_ABI bool operator==(__thread_id __x, __thread_id __y) _NOEXCEPT;
+#if _LIBCPP_STD_VER <= 17
+    friend _LIBCPP_HIDE_FROM_ABI bool operator<(__thread_id __x, __thread_id __y) _NOEXCEPT;
+#else // _LIBCPP_STD_VER <= 17
+    friend _LIBCPP_HIDE_FROM_ABI strong_ordering operator<=>(__thread_id __x, __thread_id __y) noexcept;
+#endif // _LIBCPP_STD_VER <= 17
+
+    template<class _CharT, class _Traits>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os, __thread_id __id);
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    __thread_id(__libcpp_thread_id __id) : __id_(__id) {}
+
+    friend __thread_id this_thread::get_id() _NOEXCEPT;
+    friend class _LIBCPP_TYPE_VIS thread;
+    friend struct _LIBCPP_TEMPLATE_VIS hash<__thread_id>;
+};
+
+inline _LIBCPP_HIDE_FROM_ABI
+bool operator==(__thread_id __x, __thread_id __y) _NOEXCEPT {
+  // Don't pass id==0 to underlying routines
+  if (__x.__id_ == 0)
+    return __y.__id_ == 0;
+  if (__y.__id_ == 0)
+    return false;
+  return __libcpp_thread_id_equal(__x.__id_, __y.__id_);
+}
+
+#if _LIBCPP_STD_VER <= 17
+
+inline _LIBCPP_HIDE_FROM_ABI
+bool operator!=(__thread_id __x, __thread_id __y) _NOEXCEPT {
+  return !(__x == __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI
+bool operator<(__thread_id __x, __thread_id __y) _NOEXCEPT {
+  return __thread_id::__lt_impl(__x.__id_, __y.__id_);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI bool operator<=(__thread_id __x, __thread_id __y) _NOEXCEPT { return !(__y < __x); }
+inline _LIBCPP_HIDE_FROM_ABI bool operator>(__thread_id __x, __thread_id __y) _NOEXCEPT { return __y < __x; }
+inline _LIBCPP_HIDE_FROM_ABI bool operator>=(__thread_id __x, __thread_id __y) _NOEXCEPT { return !(__x < __y); }
+
+#else // _LIBCPP_STD_VER <= 17
+
+inline _LIBCPP_HIDE_FROM_ABI
+strong_ordering operator<=>(__thread_id __x, __thread_id __y) noexcept {
+  if (__x == __y)
+    return strong_ordering::equal;
+  if (__thread_id::__lt_impl(__x, __y))
+    return strong_ordering::less;
+  return strong_ordering::greater;
+}
+
+#endif // _LIBCPP_STD_VER <= 17
+
+namespace this_thread
+{
+
+inline _LIBCPP_INLINE_VISIBILITY
+__thread_id
+get_id() _NOEXCEPT
+{
+    return __libcpp_thread_get_current_id();
+}
+
+} // namespace this_thread
+
+#endif // !_LIBCPP_HAS_NO_THREADS
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___THREADING_SUPPORT
diff --git a/app/src/main/cpp/libcxx/include/__tree b/app/src/main/cpp/libcxx/include/__tree
new file mode 100644
index 0000000..f5d9d59
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__tree
@@ -0,0 +1,2758 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TREE
+#define _LIBCPP___TREE
+
+#include <__algorithm/min.h>
+#include <__assert>
+#include <__config>
+#include <__debug>
+#include <__functional/invoke.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__memory/allocator_traits.h>
+#include <__memory/compressed_pair.h>
+#include <__memory/pointer_traits.h>
+#include <__memory/swap_allocator.h>
+#include <__memory/unique_ptr.h>
+#include <__type_traits/can_extract_key.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/is_const.h>
+#include <__type_traits/is_nothrow_copy_constructible.h>
+#include <__type_traits/is_nothrow_default_constructible.h>
+#include <__type_traits/is_nothrow_move_assignable.h>
+#include <__type_traits/is_nothrow_move_constructible.h>
+#include <__type_traits/is_pointer.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_swappable.h>
+#include <__type_traits/remove_const_ref.h>
+#include <__type_traits/remove_cvref.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <__utility/swap.h>
+#include <limits>
+#include <stdexcept>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class, class, class, class> class _LIBCPP_TEMPLATE_VIS map;
+template <class, class, class, class> class _LIBCPP_TEMPLATE_VIS multimap;
+template <class, class, class> class _LIBCPP_TEMPLATE_VIS set;
+template <class, class, class> class _LIBCPP_TEMPLATE_VIS multiset;
+
+template <class _Tp, class _Compare, class _Allocator> class __tree;
+template <class _Tp, class _NodePtr, class _DiffType>
+    class _LIBCPP_TEMPLATE_VIS __tree_iterator;
+template <class _Tp, class _ConstNodePtr, class _DiffType>
+    class _LIBCPP_TEMPLATE_VIS __tree_const_iterator;
+
+template <class _Pointer> class __tree_end_node;
+template <class _VoidPtr> class __tree_node_base;
+template <class _Tp, class _VoidPtr> class __tree_node;
+
+template <class _Key, class _Value>
+struct __value_type;
+
+template <class _Allocator> class __map_node_destructor;
+template <class _TreeIterator> class _LIBCPP_TEMPLATE_VIS __map_iterator;
+template <class _TreeIterator> class _LIBCPP_TEMPLATE_VIS __map_const_iterator;
+
+/*
+
+_NodePtr algorithms
+
+The algorithms taking _NodePtr are red black tree algorithms.  Those
+algorithms taking a parameter named __root should assume that __root
+points to a proper red black tree (unless otherwise specified).
+
+Each algorithm herein assumes that __root->__parent_ points to a non-null
+structure which has a member __left_ which points back to __root.  No other
+member is read or written to at __root->__parent_.
+
+__root->__parent_ will be referred to below (in comments only) as end_node.
+end_node->__left_ is an externably accessible lvalue for __root, and can be
+changed by node insertion and removal (without explicit reference to end_node).
+
+All nodes (with the exception of end_node), even the node referred to as
+__root, have a non-null __parent_ field.
+
+*/
+
+// Returns:  true if __x is a left child of its parent, else false
+// Precondition:  __x != nullptr.
+template <class _NodePtr>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+__tree_is_left_child(_NodePtr __x) _NOEXCEPT
+{
+    return __x == __x->__parent_->__left_;
+}
+
+// Determines if the subtree rooted at __x is a proper red black subtree.  If
+//    __x is a proper subtree, returns the black height (null counts as 1).  If
+//    __x is an improper subtree, returns 0.
+template <class _NodePtr>
+unsigned
+__tree_sub_invariant(_NodePtr __x)
+{
+    if (__x == nullptr)
+        return 1;
+    // parent consistency checked by caller
+    // check __x->__left_ consistency
+    if (__x->__left_ != nullptr && __x->__left_->__parent_ != __x)
+        return 0;
+    // check __x->__right_ consistency
+    if (__x->__right_ != nullptr && __x->__right_->__parent_ != __x)
+        return 0;
+    // check __x->__left_ != __x->__right_ unless both are nullptr
+    if (__x->__left_ == __x->__right_ && __x->__left_ != nullptr)
+        return 0;
+    // If this is red, neither child can be red
+    if (!__x->__is_black_)
+    {
+        if (__x->__left_ && !__x->__left_->__is_black_)
+            return 0;
+        if (__x->__right_ && !__x->__right_->__is_black_)
+            return 0;
+    }
+    unsigned __h = _VSTD::__tree_sub_invariant(__x->__left_);
+    if (__h == 0)
+        return 0;  // invalid left subtree
+    if (__h != _VSTD::__tree_sub_invariant(__x->__right_))
+        return 0;  // invalid or different height right subtree
+    return __h + __x->__is_black_;  // return black height of this node
+}
+
+// Determines if the red black tree rooted at __root is a proper red black tree.
+//    __root == nullptr is a proper tree.  Returns true is __root is a proper
+//    red black tree, else returns false.
+template <class _NodePtr>
+_LIBCPP_HIDE_FROM_ABI bool
+__tree_invariant(_NodePtr __root)
+{
+    if (__root == nullptr)
+        return true;
+    // check __x->__parent_ consistency
+    if (__root->__parent_ == nullptr)
+        return false;
+    if (!_VSTD::__tree_is_left_child(__root))
+        return false;
+    // root must be black
+    if (!__root->__is_black_)
+        return false;
+    // do normal node checks
+    return _VSTD::__tree_sub_invariant(__root) != 0;
+}
+
+// Returns:  pointer to the left-most node under __x.
+template <class _NodePtr>
+inline _LIBCPP_INLINE_VISIBILITY
+_NodePtr
+__tree_min(_NodePtr __x) _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__x != nullptr, "Root node shouldn't be null");
+    while (__x->__left_ != nullptr)
+        __x = __x->__left_;
+    return __x;
+}
+
+// Returns:  pointer to the right-most node under __x.
+template <class _NodePtr>
+inline _LIBCPP_INLINE_VISIBILITY
+_NodePtr
+__tree_max(_NodePtr __x) _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__x != nullptr, "Root node shouldn't be null");
+    while (__x->__right_ != nullptr)
+        __x = __x->__right_;
+    return __x;
+}
+
+// Returns:  pointer to the next in-order node after __x.
+template <class _NodePtr>
+_LIBCPP_HIDE_FROM_ABI _NodePtr
+__tree_next(_NodePtr __x) _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__x != nullptr, "node shouldn't be null");
+    if (__x->__right_ != nullptr)
+        return _VSTD::__tree_min(__x->__right_);
+    while (!_VSTD::__tree_is_left_child(__x))
+        __x = __x->__parent_unsafe();
+    return __x->__parent_unsafe();
+}
+
+template <class _EndNodePtr, class _NodePtr>
+inline _LIBCPP_INLINE_VISIBILITY
+_EndNodePtr
+__tree_next_iter(_NodePtr __x) _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__x != nullptr, "node shouldn't be null");
+    if (__x->__right_ != nullptr)
+        return static_cast<_EndNodePtr>(_VSTD::__tree_min(__x->__right_));
+    while (!_VSTD::__tree_is_left_child(__x))
+        __x = __x->__parent_unsafe();
+    return static_cast<_EndNodePtr>(__x->__parent_);
+}
+
+// Returns:  pointer to the previous in-order node before __x.
+// Note: __x may be the end node.
+template <class _NodePtr, class _EndNodePtr>
+inline _LIBCPP_INLINE_VISIBILITY
+_NodePtr
+__tree_prev_iter(_EndNodePtr __x) _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__x != nullptr, "node shouldn't be null");
+    if (__x->__left_ != nullptr)
+        return _VSTD::__tree_max(__x->__left_);
+    _NodePtr __xx = static_cast<_NodePtr>(__x);
+    while (_VSTD::__tree_is_left_child(__xx))
+        __xx = __xx->__parent_unsafe();
+    return __xx->__parent_unsafe();
+}
+
+// Returns:  pointer to a node which has no children
+template <class _NodePtr>
+_LIBCPP_HIDE_FROM_ABI _NodePtr
+__tree_leaf(_NodePtr __x) _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__x != nullptr, "node shouldn't be null");
+    while (true)
+    {
+        if (__x->__left_ != nullptr)
+        {
+            __x = __x->__left_;
+            continue;
+        }
+        if (__x->__right_ != nullptr)
+        {
+            __x = __x->__right_;
+            continue;
+        }
+        break;
+    }
+    return __x;
+}
+
+// Effects:  Makes __x->__right_ the subtree root with __x as its left child
+//           while preserving in-order order.
+template <class _NodePtr>
+_LIBCPP_HIDE_FROM_ABI void
+__tree_left_rotate(_NodePtr __x) _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__x != nullptr, "node shouldn't be null");
+    _LIBCPP_ASSERT(__x->__right_ != nullptr, "node should have a right child");
+    _NodePtr __y = __x->__right_;
+    __x->__right_ = __y->__left_;
+    if (__x->__right_ != nullptr)
+        __x->__right_->__set_parent(__x);
+    __y->__parent_ = __x->__parent_;
+    if (_VSTD::__tree_is_left_child(__x))
+        __x->__parent_->__left_ = __y;
+    else
+        __x->__parent_unsafe()->__right_ = __y;
+    __y->__left_ = __x;
+    __x->__set_parent(__y);
+}
+
+// Effects:  Makes __x->__left_ the subtree root with __x as its right child
+//           while preserving in-order order.
+template <class _NodePtr>
+_LIBCPP_HIDE_FROM_ABI void
+__tree_right_rotate(_NodePtr __x) _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__x != nullptr, "node shouldn't be null");
+    _LIBCPP_ASSERT(__x->__left_ != nullptr, "node should have a left child");
+    _NodePtr __y = __x->__left_;
+    __x->__left_ = __y->__right_;
+    if (__x->__left_ != nullptr)
+        __x->__left_->__set_parent(__x);
+    __y->__parent_ = __x->__parent_;
+    if (_VSTD::__tree_is_left_child(__x))
+        __x->__parent_->__left_ = __y;
+    else
+        __x->__parent_unsafe()->__right_ = __y;
+    __y->__right_ = __x;
+    __x->__set_parent(__y);
+}
+
+// Effects:  Rebalances __root after attaching __x to a leaf.
+// Precondition:  __x has no children.
+//                __x == __root or == a direct or indirect child of __root.
+//                If __x were to be unlinked from __root (setting __root to
+//                  nullptr if __root == __x), __tree_invariant(__root) == true.
+// Postcondition: __tree_invariant(end_node->__left_) == true.  end_node->__left_
+//                may be different than the value passed in as __root.
+template <class _NodePtr>
+_LIBCPP_HIDE_FROM_ABI void
+__tree_balance_after_insert(_NodePtr __root, _NodePtr __x) _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__root != nullptr, "Root of the tree shouldn't be null");
+    _LIBCPP_ASSERT(__x != nullptr, "Can't attach null node to a leaf");
+    __x->__is_black_ = __x == __root;
+    while (__x != __root && !__x->__parent_unsafe()->__is_black_)
+    {
+        // __x->__parent_ != __root because __x->__parent_->__is_black == false
+        if (_VSTD::__tree_is_left_child(__x->__parent_unsafe()))
+        {
+            _NodePtr __y = __x->__parent_unsafe()->__parent_unsafe()->__right_;
+            if (__y != nullptr && !__y->__is_black_)
+            {
+                __x = __x->__parent_unsafe();
+                __x->__is_black_ = true;
+                __x = __x->__parent_unsafe();
+                __x->__is_black_ = __x == __root;
+                __y->__is_black_ = true;
+            }
+            else
+            {
+                if (!_VSTD::__tree_is_left_child(__x))
+                {
+                    __x = __x->__parent_unsafe();
+                    _VSTD::__tree_left_rotate(__x);
+                }
+                __x = __x->__parent_unsafe();
+                __x->__is_black_ = true;
+                __x = __x->__parent_unsafe();
+                __x->__is_black_ = false;
+                _VSTD::__tree_right_rotate(__x);
+                break;
+            }
+        }
+        else
+        {
+            _NodePtr __y = __x->__parent_unsafe()->__parent_->__left_;
+            if (__y != nullptr && !__y->__is_black_)
+            {
+                __x = __x->__parent_unsafe();
+                __x->__is_black_ = true;
+                __x = __x->__parent_unsafe();
+                __x->__is_black_ = __x == __root;
+                __y->__is_black_ = true;
+            }
+            else
+            {
+                if (_VSTD::__tree_is_left_child(__x))
+                {
+                    __x = __x->__parent_unsafe();
+                    _VSTD::__tree_right_rotate(__x);
+                }
+                __x = __x->__parent_unsafe();
+                __x->__is_black_ = true;
+                __x = __x->__parent_unsafe();
+                __x->__is_black_ = false;
+                _VSTD::__tree_left_rotate(__x);
+                break;
+            }
+        }
+    }
+}
+
+// Precondition:  __z == __root or == a direct or indirect child of __root.
+// Effects:  unlinks __z from the tree rooted at __root, rebalancing as needed.
+// Postcondition: __tree_invariant(end_node->__left_) == true && end_node->__left_
+//                nor any of its children refer to __z.  end_node->__left_
+//                may be different than the value passed in as __root.
+template <class _NodePtr>
+_LIBCPP_HIDE_FROM_ABI void
+__tree_remove(_NodePtr __root, _NodePtr __z) _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__root != nullptr, "Root node should not be null");
+    _LIBCPP_ASSERT(__z != nullptr, "The node to remove should not be null");
+    _LIBCPP_DEBUG_ASSERT(__tree_invariant(__root), "The tree invariants should hold");
+    // __z will be removed from the tree.  Client still needs to destruct/deallocate it
+    // __y is either __z, or if __z has two children, __tree_next(__z).
+    // __y will have at most one child.
+    // __y will be the initial hole in the tree (make the hole at a leaf)
+    _NodePtr __y = (__z->__left_ == nullptr || __z->__right_ == nullptr) ?
+                    __z : _VSTD::__tree_next(__z);
+    // __x is __y's possibly null single child
+    _NodePtr __x = __y->__left_ != nullptr ? __y->__left_ : __y->__right_;
+    // __w is __x's possibly null uncle (will become __x's sibling)
+    _NodePtr __w = nullptr;
+    // link __x to __y's parent, and find __w
+    if (__x != nullptr)
+        __x->__parent_ = __y->__parent_;
+    if (_VSTD::__tree_is_left_child(__y))
+    {
+        __y->__parent_->__left_ = __x;
+        if (__y != __root)
+            __w = __y->__parent_unsafe()->__right_;
+        else
+            __root = __x;  // __w == nullptr
+    }
+    else
+    {
+        __y->__parent_unsafe()->__right_ = __x;
+        // __y can't be root if it is a right child
+        __w = __y->__parent_->__left_;
+    }
+    bool __removed_black = __y->__is_black_;
+    // If we didn't remove __z, do so now by splicing in __y for __z,
+    //    but copy __z's color.  This does not impact __x or __w.
+    if (__y != __z)
+    {
+        // __z->__left_ != nulptr but __z->__right_ might == __x == nullptr
+        __y->__parent_ = __z->__parent_;
+        if (_VSTD::__tree_is_left_child(__z))
+            __y->__parent_->__left_ = __y;
+        else
+            __y->__parent_unsafe()->__right_ = __y;
+        __y->__left_ = __z->__left_;
+        __y->__left_->__set_parent(__y);
+        __y->__right_ = __z->__right_;
+        if (__y->__right_ != nullptr)
+            __y->__right_->__set_parent(__y);
+        __y->__is_black_ = __z->__is_black_;
+        if (__root == __z)
+            __root = __y;
+    }
+    // There is no need to rebalance if we removed a red, or if we removed
+    //     the last node.
+    if (__removed_black && __root != nullptr)
+    {
+        // Rebalance:
+        // __x has an implicit black color (transferred from the removed __y)
+        //    associated with it, no matter what its color is.
+        // If __x is __root (in which case it can't be null), it is supposed
+        //    to be black anyway, and if it is doubly black, then the double
+        //    can just be ignored.
+        // If __x is red (in which case it can't be null), then it can absorb
+        //    the implicit black just by setting its color to black.
+        // Since __y was black and only had one child (which __x points to), __x
+        //   is either red with no children, else null, otherwise __y would have
+        //   different black heights under left and right pointers.
+        // if (__x == __root || __x != nullptr && !__x->__is_black_)
+        if (__x != nullptr)
+            __x->__is_black_ = true;
+        else
+        {
+            //  Else __x isn't root, and is "doubly black", even though it may
+            //     be null.  __w can not be null here, else the parent would
+            //     see a black height >= 2 on the __x side and a black height
+            //     of 1 on the __w side (__w must be a non-null black or a red
+            //     with a non-null black child).
+            while (true)
+            {
+                if (!_VSTD::__tree_is_left_child(__w))  // if x is left child
+                {
+                    if (!__w->__is_black_)
+                    {
+                        __w->__is_black_ = true;
+                        __w->__parent_unsafe()->__is_black_ = false;
+                        _VSTD::__tree_left_rotate(__w->__parent_unsafe());
+                        // __x is still valid
+                        // reset __root only if necessary
+                        if (__root == __w->__left_)
+                            __root = __w;
+                        // reset sibling, and it still can't be null
+                        __w = __w->__left_->__right_;
+                    }
+                    // __w->__is_black_ is now true, __w may have null children
+                    if ((__w->__left_  == nullptr || __w->__left_->__is_black_) &&
+                        (__w->__right_ == nullptr || __w->__right_->__is_black_))
+                    {
+                        __w->__is_black_ = false;
+                        __x = __w->__parent_unsafe();
+                        // __x can no longer be null
+                        if (__x == __root || !__x->__is_black_)
+                        {
+                            __x->__is_black_ = true;
+                            break;
+                        }
+                        // reset sibling, and it still can't be null
+                        __w = _VSTD::__tree_is_left_child(__x) ?
+                                    __x->__parent_unsafe()->__right_ :
+                                    __x->__parent_->__left_;
+                        // continue;
+                    }
+                    else  // __w has a red child
+                    {
+                        if (__w->__right_ == nullptr || __w->__right_->__is_black_)
+                        {
+                            // __w left child is non-null and red
+                            __w->__left_->__is_black_ = true;
+                            __w->__is_black_ = false;
+                            _VSTD::__tree_right_rotate(__w);
+                            // __w is known not to be root, so root hasn't changed
+                            // reset sibling, and it still can't be null
+                            __w = __w->__parent_unsafe();
+                        }
+                        // __w has a right red child, left child may be null
+                        __w->__is_black_ = __w->__parent_unsafe()->__is_black_;
+                        __w->__parent_unsafe()->__is_black_ = true;
+                        __w->__right_->__is_black_ = true;
+                        _VSTD::__tree_left_rotate(__w->__parent_unsafe());
+                        break;
+                    }
+                }
+                else
+                {
+                    if (!__w->__is_black_)
+                    {
+                        __w->__is_black_ = true;
+                        __w->__parent_unsafe()->__is_black_ = false;
+                        _VSTD::__tree_right_rotate(__w->__parent_unsafe());
+                        // __x is still valid
+                        // reset __root only if necessary
+                        if (__root == __w->__right_)
+                            __root = __w;
+                        // reset sibling, and it still can't be null
+                        __w = __w->__right_->__left_;
+                    }
+                    // __w->__is_black_ is now true, __w may have null children
+                    if ((__w->__left_  == nullptr || __w->__left_->__is_black_) &&
+                        (__w->__right_ == nullptr || __w->__right_->__is_black_))
+                    {
+                        __w->__is_black_ = false;
+                        __x = __w->__parent_unsafe();
+                        // __x can no longer be null
+                        if (!__x->__is_black_ || __x == __root)
+                        {
+                            __x->__is_black_ = true;
+                            break;
+                        }
+                        // reset sibling, and it still can't be null
+                        __w = _VSTD::__tree_is_left_child(__x) ?
+                                    __x->__parent_unsafe()->__right_ :
+                                    __x->__parent_->__left_;
+                        // continue;
+                    }
+                    else  // __w has a red child
+                    {
+                        if (__w->__left_ == nullptr || __w->__left_->__is_black_)
+                        {
+                            // __w right child is non-null and red
+                            __w->__right_->__is_black_ = true;
+                            __w->__is_black_ = false;
+                            _VSTD::__tree_left_rotate(__w);
+                            // __w is known not to be root, so root hasn't changed
+                            // reset sibling, and it still can't be null
+                            __w = __w->__parent_unsafe();
+                        }
+                        // __w has a left red child, right child may be null
+                        __w->__is_black_ = __w->__parent_unsafe()->__is_black_;
+                        __w->__parent_unsafe()->__is_black_ = true;
+                        __w->__left_->__is_black_ = true;
+                        _VSTD::__tree_right_rotate(__w->__parent_unsafe());
+                        break;
+                    }
+                }
+            }
+        }
+    }
+}
+
+// node traits
+
+
+template <class _Tp>
+struct __is_tree_value_type_imp : false_type {};
+
+template <class _Key, class _Value>
+struct __is_tree_value_type_imp<__value_type<_Key, _Value> > : true_type {};
+
+template <class ..._Args>
+struct __is_tree_value_type : false_type {};
+
+template <class _One>
+struct __is_tree_value_type<_One> : __is_tree_value_type_imp<__remove_cvref_t<_One> > {};
+
+template <class _Tp>
+struct __tree_key_value_types {
+  typedef _Tp key_type;
+  typedef _Tp __node_value_type;
+  typedef _Tp __container_value_type;
+  static const bool __is_map = false;
+
+  _LIBCPP_INLINE_VISIBILITY
+  static key_type const& __get_key(_Tp const& __v) {
+    return __v;
+  }
+  _LIBCPP_INLINE_VISIBILITY
+  static __container_value_type const& __get_value(__node_value_type const& __v) {
+    return __v;
+  }
+  _LIBCPP_INLINE_VISIBILITY
+  static __container_value_type* __get_ptr(__node_value_type& __n) {
+    return _VSTD::addressof(__n);
+  }
+  _LIBCPP_INLINE_VISIBILITY
+  static __container_value_type&& __move(__node_value_type& __v) {
+    return _VSTD::move(__v);
+  }
+};
+
+template <class _Key, class _Tp>
+struct __tree_key_value_types<__value_type<_Key, _Tp> > {
+  typedef _Key                                         key_type;
+  typedef _Tp                                          mapped_type;
+  typedef __value_type<_Key, _Tp>                      __node_value_type;
+  typedef pair<const _Key, _Tp>                        __container_value_type;
+  typedef __container_value_type                       __map_value_type;
+  static const bool __is_map = true;
+
+  _LIBCPP_INLINE_VISIBILITY
+  static key_type const&
+  __get_key(__node_value_type const& __t) {
+    return __t.__get_value().first;
+  }
+
+  template <class _Up>
+  _LIBCPP_INLINE_VISIBILITY
+  static __enable_if_t<__is_same_uncvref<_Up, __container_value_type>::value, key_type const&>
+  __get_key(_Up& __t) {
+    return __t.first;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  static __container_value_type const&
+  __get_value(__node_value_type const& __t) {
+    return __t.__get_value();
+  }
+
+  template <class _Up>
+  _LIBCPP_INLINE_VISIBILITY
+  static __enable_if_t<__is_same_uncvref<_Up, __container_value_type>::value, __container_value_type const&>
+  __get_value(_Up& __t) {
+    return __t;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  static __container_value_type* __get_ptr(__node_value_type& __n) {
+    return _VSTD::addressof(__n.__get_value());
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  static pair<key_type&&, mapped_type&&> __move(__node_value_type& __v) {
+    return __v.__move();
+  }
+};
+
+template <class _VoidPtr>
+struct __tree_node_base_types {
+  typedef _VoidPtr                                               __void_pointer;
+
+  typedef __tree_node_base<__void_pointer>                      __node_base_type;
+  typedef __rebind_pointer_t<_VoidPtr, __node_base_type>
+                                                             __node_base_pointer;
+
+  typedef __tree_end_node<__node_base_pointer>                  __end_node_type;
+  typedef __rebind_pointer_t<_VoidPtr, __end_node_type>
+                                                             __end_node_pointer;
+#if defined(_LIBCPP_ABI_TREE_REMOVE_NODE_POINTER_UB)
+  typedef __end_node_pointer __parent_pointer;
+#else
+  typedef __conditional_t< is_pointer<__end_node_pointer>::value, __end_node_pointer, __node_base_pointer>
+      __parent_pointer;
+#endif
+
+private:
+  static_assert((is_same<typename pointer_traits<_VoidPtr>::element_type, void>::value),
+                  "_VoidPtr does not point to unqualified void type");
+};
+
+template <class _Tp, class _AllocPtr, class _KVTypes = __tree_key_value_types<_Tp>,
+         bool = _KVTypes::__is_map>
+struct __tree_map_pointer_types {};
+
+template <class _Tp, class _AllocPtr, class _KVTypes>
+struct __tree_map_pointer_types<_Tp, _AllocPtr, _KVTypes, true> {
+  typedef typename _KVTypes::__map_value_type   _Mv;
+  typedef __rebind_pointer_t<_AllocPtr, _Mv>
+                                                       __map_value_type_pointer;
+  typedef __rebind_pointer_t<_AllocPtr, const _Mv>
+                                                 __const_map_value_type_pointer;
+};
+
+template <class _NodePtr, class _NodeT = typename pointer_traits<_NodePtr>::element_type>
+struct __tree_node_types;
+
+template <class _NodePtr, class _Tp, class _VoidPtr>
+struct __tree_node_types<_NodePtr, __tree_node<_Tp, _VoidPtr> >
+    : public __tree_node_base_types<_VoidPtr>,
+             __tree_key_value_types<_Tp>,
+             __tree_map_pointer_types<_Tp, _VoidPtr>
+{
+  typedef __tree_node_base_types<_VoidPtr> __base;
+  typedef __tree_key_value_types<_Tp>      __key_base;
+  typedef __tree_map_pointer_types<_Tp, _VoidPtr> __map_pointer_base;
+public:
+
+  typedef typename pointer_traits<_NodePtr>::element_type       __node_type;
+  typedef _NodePtr                                              __node_pointer;
+
+  typedef _Tp                                                 __node_value_type;
+  typedef __rebind_pointer_t<_VoidPtr, __node_value_type>
+                                                      __node_value_type_pointer;
+  typedef __rebind_pointer_t<_VoidPtr, const __node_value_type>
+                                                __const_node_value_type_pointer;
+#if defined(_LIBCPP_ABI_TREE_REMOVE_NODE_POINTER_UB)
+  typedef typename __base::__end_node_pointer __iter_pointer;
+#else
+  typedef __conditional_t< is_pointer<__node_pointer>::value, typename __base::__end_node_pointer, __node_pointer>
+      __iter_pointer;
+#endif
+private:
+    static_assert(!is_const<__node_type>::value,
+                "_NodePtr should never be a pointer to const");
+    static_assert((is_same<__rebind_pointer_t<_VoidPtr, __node_type>,
+                          _NodePtr>::value), "_VoidPtr does not rebind to _NodePtr.");
+};
+
+template <class _ValueTp, class _VoidPtr>
+struct __make_tree_node_types {
+  typedef __rebind_pointer_t<_VoidPtr, __tree_node<_ValueTp, _VoidPtr> >
+                                                                        _NodePtr;
+  typedef __tree_node_types<_NodePtr> type;
+};
+
+// node
+
+template <class _Pointer>
+class __tree_end_node
+{
+public:
+    typedef _Pointer pointer;
+    pointer __left_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __tree_end_node() _NOEXCEPT : __left_() {}
+};
+
+template <class _VoidPtr>
+class _LIBCPP_STANDALONE_DEBUG __tree_node_base
+    : public __tree_node_base_types<_VoidPtr>::__end_node_type
+{
+    typedef __tree_node_base_types<_VoidPtr> _NodeBaseTypes;
+
+public:
+    typedef typename _NodeBaseTypes::__node_base_pointer pointer;
+    typedef typename _NodeBaseTypes::__parent_pointer __parent_pointer;
+
+    pointer          __right_;
+    __parent_pointer __parent_;
+    bool __is_black_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    pointer __parent_unsafe() const { return static_cast<pointer>(__parent_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __set_parent(pointer __p) {
+        __parent_ = static_cast<__parent_pointer>(__p);
+    }
+
+private:
+  ~__tree_node_base() = delete;
+  __tree_node_base(__tree_node_base const&) = delete;
+  __tree_node_base& operator=(__tree_node_base const&) = delete;
+};
+
+template <class _Tp, class _VoidPtr>
+class _LIBCPP_STANDALONE_DEBUG __tree_node
+    : public __tree_node_base<_VoidPtr>
+{
+public:
+    typedef _Tp __node_value_type;
+
+    __node_value_type __value_;
+
+private:
+  ~__tree_node() = delete;
+  __tree_node(__tree_node const&) = delete;
+  __tree_node& operator=(__tree_node const&) = delete;
+};
+
+
+template <class _Allocator>
+class __tree_node_destructor
+{
+    typedef _Allocator                                      allocator_type;
+    typedef allocator_traits<allocator_type>                __alloc_traits;
+
+public:
+    typedef typename __alloc_traits::pointer                pointer;
+private:
+    typedef __tree_node_types<pointer> _NodeTypes;
+    allocator_type& __na_;
+
+
+public:
+    bool __value_constructed;
+
+
+    __tree_node_destructor(const __tree_node_destructor &) = default;
+    __tree_node_destructor& operator=(const __tree_node_destructor&) = delete;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __tree_node_destructor(allocator_type& __na, bool __val = false) _NOEXCEPT
+        : __na_(__na),
+          __value_constructed(__val)
+        {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator()(pointer __p) _NOEXCEPT
+    {
+        if (__value_constructed)
+            __alloc_traits::destroy(__na_, _NodeTypes::__get_ptr(__p->__value_));
+        if (__p)
+            __alloc_traits::deallocate(__na_, __p, 1);
+    }
+
+    template <class> friend class __map_node_destructor;
+};
+
+#if _LIBCPP_STD_VER > 14
+template <class _NodeType, class _Alloc>
+struct __generic_container_node_destructor;
+template <class _Tp, class _VoidPtr, class _Alloc>
+struct __generic_container_node_destructor<__tree_node<_Tp, _VoidPtr>, _Alloc>
+    : __tree_node_destructor<_Alloc>
+{
+    using __tree_node_destructor<_Alloc>::__tree_node_destructor;
+};
+#endif
+
+template <class _Tp, class _NodePtr, class _DiffType>
+class _LIBCPP_TEMPLATE_VIS __tree_iterator
+{
+    typedef __tree_node_types<_NodePtr>                     _NodeTypes;
+    typedef _NodePtr                                        __node_pointer;
+    typedef typename _NodeTypes::__node_base_pointer        __node_base_pointer;
+    typedef typename _NodeTypes::__end_node_pointer         __end_node_pointer;
+    typedef typename _NodeTypes::__iter_pointer             __iter_pointer;
+    typedef pointer_traits<__node_pointer> __pointer_traits;
+
+    __iter_pointer __ptr_;
+
+public:
+    typedef bidirectional_iterator_tag                     iterator_category;
+    typedef _Tp                                            value_type;
+    typedef _DiffType                                      difference_type;
+    typedef value_type&                                    reference;
+    typedef typename _NodeTypes::__node_value_type_pointer pointer;
+
+    _LIBCPP_INLINE_VISIBILITY __tree_iterator() _NOEXCEPT
+#if _LIBCPP_STD_VER > 11
+    : __ptr_(nullptr)
+#endif
+    {}
+
+    _LIBCPP_INLINE_VISIBILITY reference operator*() const
+        {return __get_np()->__value_;}
+    _LIBCPP_INLINE_VISIBILITY pointer operator->() const
+        {return pointer_traits<pointer>::pointer_to(__get_np()->__value_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __tree_iterator& operator++() {
+      __ptr_ = static_cast<__iter_pointer>(
+          _VSTD::__tree_next_iter<__end_node_pointer>(static_cast<__node_base_pointer>(__ptr_)));
+      return *this;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    __tree_iterator operator++(int)
+        {__tree_iterator __t(*this); ++(*this); return __t;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __tree_iterator& operator--() {
+      __ptr_ = static_cast<__iter_pointer>(_VSTD::__tree_prev_iter<__node_base_pointer>(
+          static_cast<__end_node_pointer>(__ptr_)));
+      return *this;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    __tree_iterator operator--(int)
+        {__tree_iterator __t(*this); --(*this); return __t;}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const __tree_iterator& __x, const __tree_iterator& __y)
+        {return __x.__ptr_ == __y.__ptr_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const __tree_iterator& __x, const __tree_iterator& __y)
+        {return !(__x == __y);}
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __tree_iterator(__node_pointer __p) _NOEXCEPT : __ptr_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __tree_iterator(__end_node_pointer __p) _NOEXCEPT : __ptr_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    __node_pointer __get_np() const { return static_cast<__node_pointer>(__ptr_); }
+    template <class, class, class> friend class __tree;
+    template <class, class, class> friend class _LIBCPP_TEMPLATE_VIS __tree_const_iterator;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __map_iterator;
+    template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS map;
+    template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS multimap;
+    template <class, class, class> friend class _LIBCPP_TEMPLATE_VIS set;
+    template <class, class, class> friend class _LIBCPP_TEMPLATE_VIS multiset;
+};
+
+template <class _Tp, class _NodePtr, class _DiffType>
+class _LIBCPP_TEMPLATE_VIS __tree_const_iterator
+{
+    typedef __tree_node_types<_NodePtr>                     _NodeTypes;
+    typedef typename _NodeTypes::__node_pointer             __node_pointer;
+    typedef typename _NodeTypes::__node_base_pointer        __node_base_pointer;
+    typedef typename _NodeTypes::__end_node_pointer         __end_node_pointer;
+    typedef typename _NodeTypes::__iter_pointer             __iter_pointer;
+    typedef pointer_traits<__node_pointer> __pointer_traits;
+
+    __iter_pointer __ptr_;
+
+public:
+    typedef bidirectional_iterator_tag                           iterator_category;
+    typedef _Tp                                                  value_type;
+    typedef _DiffType                                            difference_type;
+    typedef const value_type&                                    reference;
+    typedef typename _NodeTypes::__const_node_value_type_pointer pointer;
+
+    _LIBCPP_INLINE_VISIBILITY __tree_const_iterator() _NOEXCEPT
+#if _LIBCPP_STD_VER > 11
+    : __ptr_(nullptr)
+#endif
+    {}
+
+private:
+    typedef __tree_iterator<value_type, __node_pointer, difference_type>
+                                                           __non_const_iterator;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __tree_const_iterator(__non_const_iterator __p) _NOEXCEPT
+        : __ptr_(__p.__ptr_) {}
+
+    _LIBCPP_INLINE_VISIBILITY reference operator*() const
+        {return __get_np()->__value_;}
+    _LIBCPP_INLINE_VISIBILITY pointer operator->() const
+        {return pointer_traits<pointer>::pointer_to(__get_np()->__value_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __tree_const_iterator& operator++() {
+      __ptr_ = static_cast<__iter_pointer>(
+          _VSTD::__tree_next_iter<__end_node_pointer>(static_cast<__node_base_pointer>(__ptr_)));
+      return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __tree_const_iterator operator++(int)
+        {__tree_const_iterator __t(*this); ++(*this); return __t;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __tree_const_iterator& operator--() {
+      __ptr_ = static_cast<__iter_pointer>(_VSTD::__tree_prev_iter<__node_base_pointer>(
+          static_cast<__end_node_pointer>(__ptr_)));
+      return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __tree_const_iterator operator--(int)
+        {__tree_const_iterator __t(*this); --(*this); return __t;}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const __tree_const_iterator& __x, const __tree_const_iterator& __y)
+        {return __x.__ptr_ == __y.__ptr_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const __tree_const_iterator& __x, const __tree_const_iterator& __y)
+        {return !(__x == __y);}
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __tree_const_iterator(__node_pointer __p) _NOEXCEPT
+        : __ptr_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __tree_const_iterator(__end_node_pointer __p) _NOEXCEPT
+        : __ptr_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    __node_pointer __get_np() const { return static_cast<__node_pointer>(__ptr_); }
+
+    template <class, class, class> friend class __tree;
+    template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS map;
+    template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS multimap;
+    template <class, class, class> friend class _LIBCPP_TEMPLATE_VIS set;
+    template <class, class, class> friend class _LIBCPP_TEMPLATE_VIS multiset;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __map_const_iterator;
+
+};
+
+template<class _Tp, class _Compare>
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_DIAGNOSE_WARNING(!__invokable<_Compare const&, _Tp const&, _Tp const&>::value,
+        "the specified comparator type does not provide a viable const call operator")
+#endif
+int __diagnose_non_const_comparator();
+
+template <class _Tp, class _Compare, class _Allocator>
+class __tree
+{
+public:
+    typedef _Tp                                      value_type;
+    typedef _Compare                                 value_compare;
+    typedef _Allocator                               allocator_type;
+
+private:
+    typedef allocator_traits<allocator_type>         __alloc_traits;
+    typedef typename __make_tree_node_types<value_type,
+        typename __alloc_traits::void_pointer>::type
+                                                    _NodeTypes;
+    typedef typename _NodeTypes::key_type           key_type;
+public:
+    typedef typename _NodeTypes::__node_value_type      __node_value_type;
+    typedef typename _NodeTypes::__container_value_type __container_value_type;
+
+    typedef typename __alloc_traits::pointer         pointer;
+    typedef typename __alloc_traits::const_pointer   const_pointer;
+    typedef typename __alloc_traits::size_type       size_type;
+    typedef typename __alloc_traits::difference_type difference_type;
+
+public:
+    typedef typename _NodeTypes::__void_pointer        __void_pointer;
+
+    typedef typename _NodeTypes::__node_type           __node;
+    typedef typename _NodeTypes::__node_pointer        __node_pointer;
+
+    typedef typename _NodeTypes::__node_base_type      __node_base;
+    typedef typename _NodeTypes::__node_base_pointer   __node_base_pointer;
+
+    typedef typename _NodeTypes::__end_node_type       __end_node_t;
+    typedef typename _NodeTypes::__end_node_pointer    __end_node_ptr;
+
+    typedef typename _NodeTypes::__parent_pointer      __parent_pointer;
+    typedef typename _NodeTypes::__iter_pointer        __iter_pointer;
+
+    typedef __rebind_alloc<__alloc_traits, __node> __node_allocator;
+    typedef allocator_traits<__node_allocator>         __node_traits;
+
+private:
+    // check for sane allocator pointer rebinding semantics. Rebinding the
+    // allocator for a new pointer type should be exactly the same as rebinding
+    // the pointer using 'pointer_traits'.
+    static_assert((is_same<__node_pointer, typename __node_traits::pointer>::value),
+                  "Allocator does not rebind pointers in a sane manner.");
+    typedef __rebind_alloc<__node_traits, __node_base> __node_base_allocator;
+    typedef allocator_traits<__node_base_allocator> __node_base_traits;
+    static_assert((is_same<__node_base_pointer, typename __node_base_traits::pointer>::value),
+                 "Allocator does not rebind pointers in a sane manner.");
+
+private:
+    __iter_pointer                                     __begin_node_;
+    __compressed_pair<__end_node_t, __node_allocator>  __pair1_;
+    __compressed_pair<size_type, value_compare>        __pair3_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __iter_pointer __end_node() _NOEXCEPT
+    {
+        return static_cast<__iter_pointer>(
+                pointer_traits<__end_node_ptr>::pointer_to(__pair1_.first())
+        );
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    __iter_pointer __end_node() const _NOEXCEPT
+    {
+        return static_cast<__iter_pointer>(
+            pointer_traits<__end_node_ptr>::pointer_to(
+                const_cast<__end_node_t&>(__pair1_.first())
+            )
+        );
+    }
+    _LIBCPP_INLINE_VISIBILITY
+          __node_allocator& __node_alloc() _NOEXCEPT {return __pair1_.second();}
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    const __node_allocator& __node_alloc() const _NOEXCEPT
+        {return __pair1_.second();}
+    _LIBCPP_INLINE_VISIBILITY
+          __iter_pointer& __begin_node() _NOEXCEPT {return __begin_node_;}
+    _LIBCPP_INLINE_VISIBILITY
+    const __iter_pointer& __begin_node() const _NOEXCEPT {return __begin_node_;}
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type __alloc() const _NOEXCEPT
+        {return allocator_type(__node_alloc());}
+private:
+    _LIBCPP_INLINE_VISIBILITY
+          size_type& size() _NOEXCEPT {return __pair3_.first();}
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    const size_type& size() const _NOEXCEPT {return __pair3_.first();}
+    _LIBCPP_INLINE_VISIBILITY
+          value_compare& value_comp() _NOEXCEPT {return __pair3_.second();}
+    _LIBCPP_INLINE_VISIBILITY
+    const value_compare& value_comp() const _NOEXCEPT
+        {return __pair3_.second();}
+public:
+
+    _LIBCPP_INLINE_VISIBILITY
+    __node_pointer __root() const _NOEXCEPT
+        {return static_cast<__node_pointer>(__end_node()->__left_);}
+
+    __node_base_pointer* __root_ptr() const _NOEXCEPT {
+        return _VSTD::addressof(__end_node()->__left_);
+    }
+
+    typedef __tree_iterator<value_type, __node_pointer, difference_type>             iterator;
+    typedef __tree_const_iterator<value_type, __node_pointer, difference_type> const_iterator;
+
+    explicit __tree(const value_compare& __comp)
+        _NOEXCEPT_(
+            is_nothrow_default_constructible<__node_allocator>::value &&
+            is_nothrow_copy_constructible<value_compare>::value);
+    explicit __tree(const allocator_type& __a);
+    __tree(const value_compare& __comp, const allocator_type& __a);
+    __tree(const __tree& __t);
+    __tree& operator=(const __tree& __t);
+    template <class _ForwardIterator>
+        void __assign_unique(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _InputIterator>
+        void __assign_multi(_InputIterator __first, _InputIterator __last);
+    __tree(__tree&& __t)
+        _NOEXCEPT_(
+            is_nothrow_move_constructible<__node_allocator>::value &&
+            is_nothrow_move_constructible<value_compare>::value);
+    __tree(__tree&& __t, const allocator_type& __a);
+    __tree& operator=(__tree&& __t)
+        _NOEXCEPT_(
+            __node_traits::propagate_on_container_move_assignment::value &&
+            is_nothrow_move_assignable<value_compare>::value &&
+            is_nothrow_move_assignable<__node_allocator>::value);
+    ~__tree();
+
+    _LIBCPP_INLINE_VISIBILITY
+          iterator begin()  _NOEXCEPT {return       iterator(__begin_node());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin() const _NOEXCEPT {return const_iterator(__begin_node());}
+    _LIBCPP_INLINE_VISIBILITY
+          iterator end() _NOEXCEPT {return       iterator(__end_node());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end() const _NOEXCEPT {return const_iterator(__end_node());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT
+        {return _VSTD::min<size_type>(
+                __node_traits::max_size(__node_alloc()),
+                numeric_limits<difference_type >::max());}
+
+    void clear() _NOEXCEPT;
+
+    void swap(__tree& __t)
+#if _LIBCPP_STD_VER <= 11
+        _NOEXCEPT_(
+            __is_nothrow_swappable<value_compare>::value
+            && (!__node_traits::propagate_on_container_swap::value ||
+                 __is_nothrow_swappable<__node_allocator>::value)
+            );
+#else
+        _NOEXCEPT_(__is_nothrow_swappable<value_compare>::value);
+#endif
+
+    template <class _Key, class ..._Args>
+    pair<iterator, bool>
+    __emplace_unique_key_args(_Key const&, _Args&&... __args);
+    template <class _Key, class ..._Args>
+    pair<iterator, bool>
+    __emplace_hint_unique_key_args(const_iterator, _Key const&, _Args&&...);
+
+    template <class... _Args>
+    pair<iterator, bool> __emplace_unique_impl(_Args&&... __args);
+
+    template <class... _Args>
+    iterator __emplace_hint_unique_impl(const_iterator __p, _Args&&... __args);
+
+    template <class... _Args>
+    iterator __emplace_multi(_Args&&... __args);
+
+    template <class... _Args>
+    iterator __emplace_hint_multi(const_iterator __p, _Args&&... __args);
+
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __emplace_unique(_Pp&& __x) {
+        return __emplace_unique_extract_key(_VSTD::forward<_Pp>(__x),
+                                            __can_extract_key<_Pp, key_type>());
+    }
+
+    template <class _First, class _Second>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__can_extract_map_key<_First, key_type, __container_value_type>::value, pair<iterator, bool> >
+    __emplace_unique(_First&& __f, _Second&& __s) {
+        return __emplace_unique_key_args(__f, _VSTD::forward<_First>(__f),
+                                              _VSTD::forward<_Second>(__s));
+    }
+
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __emplace_unique(_Args&&... __args) {
+        return __emplace_unique_impl(_VSTD::forward<_Args>(__args)...);
+    }
+
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool>
+    __emplace_unique_extract_key(_Pp&& __x, __extract_key_fail_tag) {
+      return __emplace_unique_impl(_VSTD::forward<_Pp>(__x));
+    }
+
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool>
+    __emplace_unique_extract_key(_Pp&& __x, __extract_key_self_tag) {
+      return __emplace_unique_key_args(__x, _VSTD::forward<_Pp>(__x));
+    }
+
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool>
+    __emplace_unique_extract_key(_Pp&& __x, __extract_key_first_tag) {
+      return __emplace_unique_key_args(__x.first, _VSTD::forward<_Pp>(__x));
+    }
+
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __emplace_hint_unique(const_iterator __p, _Pp&& __x) {
+        return __emplace_hint_unique_extract_key(__p, _VSTD::forward<_Pp>(__x),
+                                            __can_extract_key<_Pp, key_type>());
+    }
+
+    template <class _First, class _Second>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__can_extract_map_key<_First, key_type, __container_value_type>::value, iterator>
+    __emplace_hint_unique(const_iterator __p, _First&& __f, _Second&& __s) {
+        return __emplace_hint_unique_key_args(__p, __f,
+                                              _VSTD::forward<_First>(__f),
+                                              _VSTD::forward<_Second>(__s)).first;
+    }
+
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __emplace_hint_unique(const_iterator __p, _Args&&... __args) {
+        return __emplace_hint_unique_impl(__p, _VSTD::forward<_Args>(__args)...);
+    }
+
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator
+    __emplace_hint_unique_extract_key(const_iterator __p, _Pp&& __x, __extract_key_fail_tag) {
+      return __emplace_hint_unique_impl(__p, _VSTD::forward<_Pp>(__x));
+    }
+
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator
+    __emplace_hint_unique_extract_key(const_iterator __p, _Pp&& __x, __extract_key_self_tag) {
+      return __emplace_hint_unique_key_args(__p, __x, _VSTD::forward<_Pp>(__x)).first;
+    }
+
+    template <class _Pp>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator
+    __emplace_hint_unique_extract_key(const_iterator __p, _Pp&& __x, __extract_key_first_tag) {
+      return __emplace_hint_unique_key_args(__p, __x.first, _VSTD::forward<_Pp>(__x)).first;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __insert_unique(const __container_value_type& __v) {
+        return __emplace_unique_key_args(_NodeTypes::__get_key(__v), __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __insert_unique(const_iterator __p, const __container_value_type& __v) {
+        return __emplace_hint_unique_key_args(__p, _NodeTypes::__get_key(__v), __v).first;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __insert_unique(__container_value_type&& __v) {
+        return __emplace_unique_key_args(_NodeTypes::__get_key(__v), _VSTD::move(__v));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __insert_unique(const_iterator __p, __container_value_type&& __v) {
+        return __emplace_hint_unique_key_args(__p, _NodeTypes::__get_key(__v), _VSTD::move(__v)).first;
+    }
+
+    template <class _Vp,
+              class = __enable_if_t<!is_same<__remove_const_ref_t<_Vp>, __container_value_type>::value> >
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __insert_unique(_Vp&& __v) {
+        return __emplace_unique(_VSTD::forward<_Vp>(__v));
+    }
+
+    template <class _Vp,
+              class = __enable_if_t<!is_same<__remove_const_ref_t<_Vp>, __container_value_type>::value> >
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __insert_unique(const_iterator __p, _Vp&& __v) {
+        return __emplace_hint_unique(__p, _VSTD::forward<_Vp>(__v));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __insert_multi(__container_value_type&& __v) {
+        return __emplace_multi(_VSTD::move(__v));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __insert_multi(const_iterator __p, __container_value_type&& __v) {
+        return __emplace_hint_multi(__p, _VSTD::move(__v));
+    }
+
+    template <class _Vp>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __insert_multi(_Vp&& __v) {
+        return __emplace_multi(_VSTD::forward<_Vp>(__v));
+    }
+
+    template <class _Vp>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __insert_multi(const_iterator __p, _Vp&& __v) {
+        return __emplace_hint_multi(__p, _VSTD::forward<_Vp>(__v));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> __node_assign_unique(const __container_value_type& __v, __node_pointer __dest);
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __node_insert_multi(__node_pointer __nd);
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __node_insert_multi(const_iterator __p, __node_pointer __nd);
+
+
+    _LIBCPP_INLINE_VISIBILITY iterator
+    __remove_node_pointer(__node_pointer) _NOEXCEPT;
+
+#if _LIBCPP_STD_VER > 14
+    template <class _NodeHandle, class _InsertReturnType>
+    _LIBCPP_INLINE_VISIBILITY
+    _InsertReturnType __node_handle_insert_unique(_NodeHandle&&);
+    template <class _NodeHandle>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __node_handle_insert_unique(const_iterator, _NodeHandle&&);
+    template <class _Tree>
+    _LIBCPP_INLINE_VISIBILITY
+    void __node_handle_merge_unique(_Tree& __source);
+
+    template <class _NodeHandle>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __node_handle_insert_multi(_NodeHandle&&);
+    template <class _NodeHandle>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator __node_handle_insert_multi(const_iterator, _NodeHandle&&);
+    template <class _Tree>
+    _LIBCPP_INLINE_VISIBILITY
+    void __node_handle_merge_multi(_Tree& __source);
+
+
+    template <class _NodeHandle>
+    _LIBCPP_INLINE_VISIBILITY
+    _NodeHandle __node_handle_extract(key_type const&);
+    template <class _NodeHandle>
+    _LIBCPP_INLINE_VISIBILITY
+    _NodeHandle __node_handle_extract(const_iterator);
+#endif
+
+    iterator erase(const_iterator __p);
+    iterator erase(const_iterator __f, const_iterator __l);
+    template <class _Key>
+        size_type __erase_unique(const _Key& __k);
+    template <class _Key>
+        size_type __erase_multi(const _Key& __k);
+
+    void __insert_node_at(__parent_pointer     __parent,
+                          __node_base_pointer& __child,
+                          __node_base_pointer __new_node) _NOEXCEPT;
+
+    template <class _Key>
+        iterator find(const _Key& __v);
+    template <class _Key>
+        const_iterator find(const _Key& __v) const;
+
+    template <class _Key>
+        size_type __count_unique(const _Key& __k) const;
+    template <class _Key>
+        size_type __count_multi(const _Key& __k) const;
+
+    template <class _Key>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator lower_bound(const _Key& __v)
+            {return __lower_bound(__v, __root(), __end_node());}
+    template <class _Key>
+        iterator __lower_bound(const _Key& __v,
+                               __node_pointer __root,
+                               __iter_pointer __result);
+    template <class _Key>
+        _LIBCPP_INLINE_VISIBILITY
+        const_iterator lower_bound(const _Key& __v) const
+            {return __lower_bound(__v, __root(), __end_node());}
+    template <class _Key>
+        const_iterator __lower_bound(const _Key& __v,
+                                     __node_pointer __root,
+                                     __iter_pointer __result) const;
+    template <class _Key>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator upper_bound(const _Key& __v)
+            {return __upper_bound(__v, __root(), __end_node());}
+    template <class _Key>
+        iterator __upper_bound(const _Key& __v,
+                               __node_pointer __root,
+                               __iter_pointer __result);
+    template <class _Key>
+        _LIBCPP_INLINE_VISIBILITY
+        const_iterator upper_bound(const _Key& __v) const
+            {return __upper_bound(__v, __root(), __end_node());}
+    template <class _Key>
+        const_iterator __upper_bound(const _Key& __v,
+                                     __node_pointer __root,
+                                     __iter_pointer __result) const;
+    template <class _Key>
+        pair<iterator, iterator>
+        __equal_range_unique(const _Key& __k);
+    template <class _Key>
+        pair<const_iterator, const_iterator>
+        __equal_range_unique(const _Key& __k) const;
+
+    template <class _Key>
+        pair<iterator, iterator>
+        __equal_range_multi(const _Key& __k);
+    template <class _Key>
+        pair<const_iterator, const_iterator>
+        __equal_range_multi(const _Key& __k) const;
+
+    typedef __tree_node_destructor<__node_allocator> _Dp;
+    typedef unique_ptr<__node, _Dp> __node_holder;
+
+    __node_holder remove(const_iterator __p) _NOEXCEPT;
+private:
+    __node_base_pointer&
+        __find_leaf_low(__parent_pointer& __parent, const key_type& __v);
+    __node_base_pointer&
+        __find_leaf_high(__parent_pointer& __parent, const key_type& __v);
+    __node_base_pointer&
+        __find_leaf(const_iterator __hint,
+                    __parent_pointer& __parent, const key_type& __v);
+    // FIXME: Make this function const qualified. Unfortunately doing so
+    // breaks existing code which uses non-const callable comparators.
+    template <class _Key>
+    __node_base_pointer&
+        __find_equal(__parent_pointer& __parent, const _Key& __v);
+    template <class _Key>
+    _LIBCPP_INLINE_VISIBILITY __node_base_pointer&
+    __find_equal(__parent_pointer& __parent, const _Key& __v) const {
+      return const_cast<__tree*>(this)->__find_equal(__parent, __v);
+    }
+    template <class _Key>
+    __node_base_pointer&
+        __find_equal(const_iterator __hint, __parent_pointer& __parent,
+                     __node_base_pointer& __dummy,
+                     const _Key& __v);
+
+    template <class ..._Args>
+    __node_holder __construct_node(_Args&& ...__args);
+
+    void destroy(__node_pointer __nd) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __copy_assign_alloc(const __tree& __t)
+        {__copy_assign_alloc(__t, integral_constant<bool,
+             __node_traits::propagate_on_container_copy_assignment::value>());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __copy_assign_alloc(const __tree& __t, true_type)
+        {
+        if (__node_alloc() != __t.__node_alloc())
+            clear();
+        __node_alloc() = __t.__node_alloc();
+        }
+    _LIBCPP_INLINE_VISIBILITY
+    void __copy_assign_alloc(const __tree&, false_type) {}
+
+    void __move_assign(__tree& __t, false_type);
+    void __move_assign(__tree& __t, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<value_compare>::value &&
+                   is_nothrow_move_assignable<__node_allocator>::value);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __move_assign_alloc(__tree& __t)
+        _NOEXCEPT_(
+            !__node_traits::propagate_on_container_move_assignment::value ||
+            is_nothrow_move_assignable<__node_allocator>::value)
+        {__move_assign_alloc(__t, integral_constant<bool,
+             __node_traits::propagate_on_container_move_assignment::value>());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __move_assign_alloc(__tree& __t, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<__node_allocator>::value)
+        {__node_alloc() = _VSTD::move(__t.__node_alloc());}
+    _LIBCPP_INLINE_VISIBILITY
+    void __move_assign_alloc(__tree&, false_type) _NOEXCEPT {}
+
+    struct _DetachedTreeCache {
+      _LIBCPP_INLINE_VISIBILITY
+      explicit _DetachedTreeCache(__tree *__t) _NOEXCEPT : __t_(__t),
+        __cache_root_(__detach_from_tree(__t)) {
+          __advance();
+        }
+
+      _LIBCPP_INLINE_VISIBILITY
+      __node_pointer __get() const _NOEXCEPT {
+        return __cache_elem_;
+      }
+
+      _LIBCPP_INLINE_VISIBILITY
+      void __advance() _NOEXCEPT {
+        __cache_elem_ = __cache_root_;
+        if (__cache_root_) {
+          __cache_root_ = __detach_next(__cache_root_);
+        }
+      }
+
+      _LIBCPP_INLINE_VISIBILITY
+      ~_DetachedTreeCache() {
+        __t_->destroy(__cache_elem_);
+        if (__cache_root_) {
+          while (__cache_root_->__parent_ != nullptr)
+            __cache_root_ = static_cast<__node_pointer>(__cache_root_->__parent_);
+          __t_->destroy(__cache_root_);
+        }
+      }
+
+       _DetachedTreeCache(_DetachedTreeCache const&) = delete;
+       _DetachedTreeCache& operator=(_DetachedTreeCache const&) = delete;
+
+    private:
+      _LIBCPP_INLINE_VISIBILITY
+      static __node_pointer __detach_from_tree(__tree *__t) _NOEXCEPT;
+      _LIBCPP_INLINE_VISIBILITY
+      static __node_pointer __detach_next(__node_pointer) _NOEXCEPT;
+
+      __tree *__t_;
+      __node_pointer __cache_root_;
+      __node_pointer __cache_elem_;
+    };
+
+
+    template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS map;
+    template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS multimap;
+};
+
+template <class _Tp, class _Compare, class _Allocator>
+__tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp)
+        _NOEXCEPT_(
+            is_nothrow_default_constructible<__node_allocator>::value &&
+            is_nothrow_copy_constructible<value_compare>::value)
+    : __pair3_(0, __comp)
+{
+    __begin_node() = __end_node();
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+__tree<_Tp, _Compare, _Allocator>::__tree(const allocator_type& __a)
+    : __begin_node_(__iter_pointer()),
+      __pair1_(__default_init_tag(), __node_allocator(__a)),
+      __pair3_(0, __default_init_tag())
+{
+    __begin_node() = __end_node();
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+__tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp,
+                                           const allocator_type& __a)
+    : __begin_node_(__iter_pointer()),
+      __pair1_(__default_init_tag(), __node_allocator(__a)),
+      __pair3_(0, __comp)
+{
+    __begin_node() = __end_node();
+}
+
+// Precondition:  size() != 0
+template <class _Tp, class _Compare, class _Allocator>
+typename __tree<_Tp, _Compare, _Allocator>::__node_pointer
+__tree<_Tp, _Compare, _Allocator>::_DetachedTreeCache::__detach_from_tree(__tree *__t) _NOEXCEPT
+{
+    __node_pointer __cache = static_cast<__node_pointer>(__t->__begin_node());
+    __t->__begin_node() = __t->__end_node();
+    __t->__end_node()->__left_->__parent_ = nullptr;
+    __t->__end_node()->__left_ = nullptr;
+    __t->size() = 0;
+    // __cache->__left_ == nullptr
+    if (__cache->__right_ != nullptr)
+        __cache = static_cast<__node_pointer>(__cache->__right_);
+    // __cache->__left_ == nullptr
+    // __cache->__right_ == nullptr
+    return __cache;
+}
+
+// Precondition:  __cache != nullptr
+//    __cache->left_ == nullptr
+//    __cache->right_ == nullptr
+//    This is no longer a red-black tree
+template <class _Tp, class _Compare, class _Allocator>
+typename __tree<_Tp, _Compare, _Allocator>::__node_pointer
+__tree<_Tp, _Compare, _Allocator>::_DetachedTreeCache::__detach_next(__node_pointer __cache) _NOEXCEPT
+{
+    if (__cache->__parent_ == nullptr)
+        return nullptr;
+    if (_VSTD::__tree_is_left_child(static_cast<__node_base_pointer>(__cache)))
+    {
+        __cache->__parent_->__left_ = nullptr;
+        __cache = static_cast<__node_pointer>(__cache->__parent_);
+        if (__cache->__right_ == nullptr)
+            return __cache;
+        return static_cast<__node_pointer>(_VSTD::__tree_leaf(__cache->__right_));
+    }
+    // __cache is right child
+    __cache->__parent_unsafe()->__right_ = nullptr;
+    __cache = static_cast<__node_pointer>(__cache->__parent_);
+    if (__cache->__left_ == nullptr)
+        return __cache;
+    return static_cast<__node_pointer>(_VSTD::__tree_leaf(__cache->__left_));
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+__tree<_Tp, _Compare, _Allocator>&
+__tree<_Tp, _Compare, _Allocator>::operator=(const __tree& __t)
+{
+    if (this != _VSTD::addressof(__t))
+    {
+        value_comp() = __t.value_comp();
+        __copy_assign_alloc(__t);
+        __assign_multi(__t.begin(), __t.end());
+    }
+    return *this;
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _ForwardIterator>
+void
+__tree<_Tp, _Compare, _Allocator>::__assign_unique(_ForwardIterator __first, _ForwardIterator __last)
+{
+    typedef iterator_traits<_ForwardIterator> _ITraits;
+    typedef typename _ITraits::value_type _ItValueType;
+    static_assert((is_same<_ItValueType, __container_value_type>::value),
+                  "__assign_unique may only be called with the containers value type");
+    static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value,
+                  "__assign_unique requires a forward iterator");
+    if (size() != 0)
+    {
+        _DetachedTreeCache __cache(this);
+          for (; __cache.__get() != nullptr && __first != __last; ++__first) {
+              if (__node_assign_unique(*__first, __cache.__get()).second)
+                  __cache.__advance();
+            }
+    }
+    for (; __first != __last; ++__first)
+        __insert_unique(*__first);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _InputIterator>
+void
+__tree<_Tp, _Compare, _Allocator>::__assign_multi(_InputIterator __first, _InputIterator __last)
+{
+    typedef iterator_traits<_InputIterator> _ITraits;
+    typedef typename _ITraits::value_type _ItValueType;
+    static_assert((is_same<_ItValueType, __container_value_type>::value ||
+                  is_same<_ItValueType, __node_value_type>::value),
+                  "__assign_multi may only be called with the containers value type"
+                  " or the nodes value type");
+    if (size() != 0)
+    {
+        _DetachedTreeCache __cache(this);
+        for (; __cache.__get() && __first != __last; ++__first) {
+            __cache.__get()->__value_ = *__first;
+            __node_insert_multi(__cache.__get());
+            __cache.__advance();
+        }
+    }
+    for (; __first != __last; ++__first)
+        __insert_multi(_NodeTypes::__get_value(*__first));
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+__tree<_Tp, _Compare, _Allocator>::__tree(const __tree& __t)
+    : __begin_node_(__iter_pointer()),
+      __pair1_(__default_init_tag(), __node_traits::select_on_container_copy_construction(__t.__node_alloc())),
+      __pair3_(0, __t.value_comp())
+{
+    __begin_node() = __end_node();
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+__tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t)
+    _NOEXCEPT_(
+        is_nothrow_move_constructible<__node_allocator>::value &&
+        is_nothrow_move_constructible<value_compare>::value)
+    : __begin_node_(_VSTD::move(__t.__begin_node_)),
+      __pair1_(_VSTD::move(__t.__pair1_)),
+      __pair3_(_VSTD::move(__t.__pair3_))
+{
+    if (size() == 0)
+        __begin_node() = __end_node();
+    else
+    {
+        __end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__end_node());
+        __t.__begin_node() = __t.__end_node();
+        __t.__end_node()->__left_ = nullptr;
+        __t.size() = 0;
+    }
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+__tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t, const allocator_type& __a)
+    : __pair1_(__default_init_tag(), __node_allocator(__a)),
+      __pair3_(0, _VSTD::move(__t.value_comp()))
+{
+    if (__a == __t.__alloc())
+    {
+        if (__t.size() == 0)
+            __begin_node() = __end_node();
+        else
+        {
+            __begin_node() = __t.__begin_node();
+            __end_node()->__left_ = __t.__end_node()->__left_;
+            __end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__end_node());
+            size() = __t.size();
+            __t.__begin_node() = __t.__end_node();
+            __t.__end_node()->__left_ = nullptr;
+            __t.size() = 0;
+        }
+    }
+    else
+    {
+        __begin_node() = __end_node();
+    }
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+void
+__tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, true_type)
+    _NOEXCEPT_(is_nothrow_move_assignable<value_compare>::value &&
+               is_nothrow_move_assignable<__node_allocator>::value)
+{
+    destroy(static_cast<__node_pointer>(__end_node()->__left_));
+    __begin_node_ = __t.__begin_node_;
+    __pair1_.first() = __t.__pair1_.first();
+    __move_assign_alloc(__t);
+    __pair3_ = _VSTD::move(__t.__pair3_);
+    if (size() == 0)
+        __begin_node() = __end_node();
+    else
+    {
+        __end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__end_node());
+        __t.__begin_node() = __t.__end_node();
+        __t.__end_node()->__left_ = nullptr;
+        __t.size() = 0;
+    }
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+void
+__tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, false_type)
+{
+    if (__node_alloc() == __t.__node_alloc())
+        __move_assign(__t, true_type());
+    else
+    {
+        value_comp() = _VSTD::move(__t.value_comp());
+        const_iterator __e = end();
+        if (size() != 0)
+        {
+            _DetachedTreeCache __cache(this);
+            while (__cache.__get() != nullptr && __t.size() != 0) {
+              __cache.__get()->__value_ = _VSTD::move(__t.remove(__t.begin())->__value_);
+              __node_insert_multi(__cache.__get());
+              __cache.__advance();
+            }
+        }
+        while (__t.size() != 0)
+            __insert_multi(__e, _NodeTypes::__move(__t.remove(__t.begin())->__value_));
+    }
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+__tree<_Tp, _Compare, _Allocator>&
+__tree<_Tp, _Compare, _Allocator>::operator=(__tree&& __t)
+    _NOEXCEPT_(
+        __node_traits::propagate_on_container_move_assignment::value &&
+        is_nothrow_move_assignable<value_compare>::value &&
+        is_nothrow_move_assignable<__node_allocator>::value)
+
+{
+    __move_assign(__t, integral_constant<bool,
+                  __node_traits::propagate_on_container_move_assignment::value>());
+    return *this;
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+__tree<_Tp, _Compare, _Allocator>::~__tree()
+{
+    static_assert((is_copy_constructible<value_compare>::value),
+                 "Comparator must be copy-constructible.");
+  destroy(__root());
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+void
+__tree<_Tp, _Compare, _Allocator>::destroy(__node_pointer __nd) _NOEXCEPT
+{
+    if (__nd != nullptr)
+    {
+        destroy(static_cast<__node_pointer>(__nd->__left_));
+        destroy(static_cast<__node_pointer>(__nd->__right_));
+        __node_allocator& __na = __node_alloc();
+        __node_traits::destroy(__na, _NodeTypes::__get_ptr(__nd->__value_));
+        __node_traits::deallocate(__na, __nd, 1);
+    }
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+void
+__tree<_Tp, _Compare, _Allocator>::swap(__tree& __t)
+#if _LIBCPP_STD_VER <= 11
+        _NOEXCEPT_(
+            __is_nothrow_swappable<value_compare>::value
+            && (!__node_traits::propagate_on_container_swap::value ||
+                 __is_nothrow_swappable<__node_allocator>::value)
+            )
+#else
+        _NOEXCEPT_(__is_nothrow_swappable<value_compare>::value)
+#endif
+{
+    using _VSTD::swap;
+    swap(__begin_node_, __t.__begin_node_);
+    swap(__pair1_.first(), __t.__pair1_.first());
+    _VSTD::__swap_allocator(__node_alloc(), __t.__node_alloc());
+    __pair3_.swap(__t.__pair3_);
+    if (size() == 0)
+        __begin_node() = __end_node();
+    else
+        __end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__end_node());
+    if (__t.size() == 0)
+        __t.__begin_node() = __t.__end_node();
+    else
+        __t.__end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__t.__end_node());
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+void
+__tree<_Tp, _Compare, _Allocator>::clear() _NOEXCEPT
+{
+    destroy(__root());
+    size() = 0;
+    __begin_node() = __end_node();
+    __end_node()->__left_ = nullptr;
+}
+
+// Find lower_bound place to insert
+// Set __parent to parent of null leaf
+// Return reference to null leaf
+template <class _Tp, class _Compare, class _Allocator>
+typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer&
+__tree<_Tp, _Compare, _Allocator>::__find_leaf_low(__parent_pointer& __parent,
+                                                   const key_type& __v)
+{
+    __node_pointer __nd = __root();
+    if (__nd != nullptr)
+    {
+        while (true)
+        {
+            if (value_comp()(__nd->__value_, __v))
+            {
+                if (__nd->__right_ != nullptr)
+                    __nd = static_cast<__node_pointer>(__nd->__right_);
+                else
+                {
+                    __parent = static_cast<__parent_pointer>(__nd);
+                    return __nd->__right_;
+                }
+            }
+            else
+            {
+                if (__nd->__left_ != nullptr)
+                    __nd = static_cast<__node_pointer>(__nd->__left_);
+                else
+                {
+                    __parent = static_cast<__parent_pointer>(__nd);
+                    return __parent->__left_;
+                }
+            }
+        }
+    }
+    __parent = static_cast<__parent_pointer>(__end_node());
+    return __parent->__left_;
+}
+
+// Find upper_bound place to insert
+// Set __parent to parent of null leaf
+// Return reference to null leaf
+template <class _Tp, class _Compare, class _Allocator>
+typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer&
+__tree<_Tp, _Compare, _Allocator>::__find_leaf_high(__parent_pointer& __parent,
+                                                    const key_type& __v)
+{
+    __node_pointer __nd = __root();
+    if (__nd != nullptr)
+    {
+        while (true)
+        {
+            if (value_comp()(__v, __nd->__value_))
+            {
+                if (__nd->__left_ != nullptr)
+                    __nd = static_cast<__node_pointer>(__nd->__left_);
+                else
+                {
+                    __parent = static_cast<__parent_pointer>(__nd);
+                    return __parent->__left_;
+                }
+            }
+            else
+            {
+                if (__nd->__right_ != nullptr)
+                    __nd = static_cast<__node_pointer>(__nd->__right_);
+                else
+                {
+                    __parent = static_cast<__parent_pointer>(__nd);
+                    return __nd->__right_;
+                }
+            }
+        }
+    }
+    __parent = static_cast<__parent_pointer>(__end_node());
+    return __parent->__left_;
+}
+
+// Find leaf place to insert closest to __hint
+// First check prior to __hint.
+// Next check after __hint.
+// Next do O(log N) search.
+// Set __parent to parent of null leaf
+// Return reference to null leaf
+template <class _Tp, class _Compare, class _Allocator>
+typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer&
+__tree<_Tp, _Compare, _Allocator>::__find_leaf(const_iterator __hint,
+                                               __parent_pointer& __parent,
+                                               const key_type& __v)
+{
+    if (__hint == end() || !value_comp()(*__hint, __v))  // check before
+    {
+        // __v <= *__hint
+        const_iterator __prior = __hint;
+        if (__prior == begin() || !value_comp()(__v, *--__prior))
+        {
+            // *prev(__hint) <= __v <= *__hint
+            if (__hint.__ptr_->__left_ == nullptr)
+            {
+                __parent = static_cast<__parent_pointer>(__hint.__ptr_);
+                return __parent->__left_;
+            }
+            else
+            {
+                __parent = static_cast<__parent_pointer>(__prior.__ptr_);
+                return static_cast<__node_base_pointer>(__prior.__ptr_)->__right_;
+            }
+        }
+        // __v < *prev(__hint)
+        return __find_leaf_high(__parent, __v);
+    }
+    // else __v > *__hint
+    return __find_leaf_low(__parent, __v);
+}
+
+// Find place to insert if __v doesn't exist
+// Set __parent to parent of null leaf
+// Return reference to null leaf
+// If __v exists, set parent to node of __v and return reference to node of __v
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer&
+__tree<_Tp, _Compare, _Allocator>::__find_equal(__parent_pointer& __parent,
+                                                const _Key& __v)
+{
+    __node_pointer __nd = __root();
+    __node_base_pointer* __nd_ptr = __root_ptr();
+    if (__nd != nullptr)
+    {
+        while (true)
+        {
+            if (value_comp()(__v, __nd->__value_))
+            {
+                if (__nd->__left_ != nullptr) {
+                    __nd_ptr = _VSTD::addressof(__nd->__left_);
+                    __nd = static_cast<__node_pointer>(__nd->__left_);
+                } else {
+                    __parent = static_cast<__parent_pointer>(__nd);
+                    return __parent->__left_;
+                }
+            }
+            else if (value_comp()(__nd->__value_, __v))
+            {
+                if (__nd->__right_ != nullptr) {
+                    __nd_ptr = _VSTD::addressof(__nd->__right_);
+                    __nd = static_cast<__node_pointer>(__nd->__right_);
+                } else {
+                    __parent = static_cast<__parent_pointer>(__nd);
+                    return __nd->__right_;
+                }
+            }
+            else
+            {
+                __parent = static_cast<__parent_pointer>(__nd);
+                return *__nd_ptr;
+            }
+        }
+    }
+    __parent = static_cast<__parent_pointer>(__end_node());
+    return __parent->__left_;
+}
+
+// Find place to insert if __v doesn't exist
+// First check prior to __hint.
+// Next check after __hint.
+// Next do O(log N) search.
+// Set __parent to parent of null leaf
+// Return reference to null leaf
+// If __v exists, set parent to node of __v and return reference to node of __v
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer&
+__tree<_Tp, _Compare, _Allocator>::__find_equal(const_iterator __hint,
+                                                __parent_pointer& __parent,
+                                                __node_base_pointer& __dummy,
+                                                const _Key& __v)
+{
+    if (__hint == end() || value_comp()(__v, *__hint))  // check before
+    {
+        // __v < *__hint
+        const_iterator __prior = __hint;
+        if (__prior == begin() || value_comp()(*--__prior, __v))
+        {
+            // *prev(__hint) < __v < *__hint
+            if (__hint.__ptr_->__left_ == nullptr)
+            {
+                __parent = static_cast<__parent_pointer>(__hint.__ptr_);
+                return __parent->__left_;
+            }
+            else
+            {
+                __parent = static_cast<__parent_pointer>(__prior.__ptr_);
+                return static_cast<__node_base_pointer>(__prior.__ptr_)->__right_;
+            }
+        }
+        // __v <= *prev(__hint)
+        return __find_equal(__parent, __v);
+    }
+    else if (value_comp()(*__hint, __v))  // check after
+    {
+        // *__hint < __v
+        const_iterator __next = _VSTD::next(__hint);
+        if (__next == end() || value_comp()(__v, *__next))
+        {
+            // *__hint < __v < *_VSTD::next(__hint)
+            if (__hint.__get_np()->__right_ == nullptr)
+            {
+                __parent = static_cast<__parent_pointer>(__hint.__ptr_);
+                return static_cast<__node_base_pointer>(__hint.__ptr_)->__right_;
+            }
+            else
+            {
+                __parent = static_cast<__parent_pointer>(__next.__ptr_);
+                return __parent->__left_;
+            }
+        }
+        // *next(__hint) <= __v
+        return __find_equal(__parent, __v);
+    }
+    // else __v == *__hint
+    __parent = static_cast<__parent_pointer>(__hint.__ptr_);
+    __dummy = static_cast<__node_base_pointer>(__hint.__ptr_);
+    return __dummy;
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+void __tree<_Tp, _Compare, _Allocator>::__insert_node_at(
+    __parent_pointer __parent, __node_base_pointer& __child,
+    __node_base_pointer __new_node) _NOEXCEPT
+{
+    __new_node->__left_   = nullptr;
+    __new_node->__right_  = nullptr;
+    __new_node->__parent_ = __parent;
+    // __new_node->__is_black_ is initialized in __tree_balance_after_insert
+    __child = __new_node;
+    if (__begin_node()->__left_ != nullptr)
+        __begin_node() = static_cast<__iter_pointer>(__begin_node()->__left_);
+    _VSTD::__tree_balance_after_insert(__end_node()->__left_, __child);
+    ++size();
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key, class... _Args>
+pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
+__tree<_Tp, _Compare, _Allocator>::__emplace_unique_key_args(_Key const& __k, _Args&&... __args)
+{
+    __parent_pointer __parent;
+    __node_base_pointer& __child = __find_equal(__parent, __k);
+    __node_pointer __r = static_cast<__node_pointer>(__child);
+    bool __inserted = false;
+    if (__child == nullptr)
+    {
+        __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
+        __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
+        __r = __h.release();
+        __inserted = true;
+    }
+    return pair<iterator, bool>(iterator(__r), __inserted);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key, class... _Args>
+pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
+__tree<_Tp, _Compare, _Allocator>::__emplace_hint_unique_key_args(
+    const_iterator __p, _Key const& __k, _Args&&... __args)
+{
+    __parent_pointer __parent;
+    __node_base_pointer __dummy;
+    __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __k);
+    __node_pointer __r = static_cast<__node_pointer>(__child);
+    bool __inserted = false;
+    if (__child == nullptr)
+    {
+        __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
+        __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
+        __r = __h.release();
+        __inserted = true;
+    }
+    return pair<iterator, bool>(iterator(__r), __inserted);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class ..._Args>
+typename __tree<_Tp, _Compare, _Allocator>::__node_holder
+__tree<_Tp, _Compare, _Allocator>::__construct_node(_Args&& ...__args)
+{
+    static_assert(!__is_tree_value_type<_Args...>::value,
+                  "Cannot construct from __value_type");
+    __node_allocator& __na = __node_alloc();
+    __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
+    __node_traits::construct(__na, _NodeTypes::__get_ptr(__h->__value_), _VSTD::forward<_Args>(__args)...);
+    __h.get_deleter().__value_constructed = true;
+    return __h;
+}
+
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class... _Args>
+pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
+__tree<_Tp, _Compare, _Allocator>::__emplace_unique_impl(_Args&&... __args)
+{
+    __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
+    __parent_pointer __parent;
+    __node_base_pointer& __child = __find_equal(__parent, __h->__value_);
+    __node_pointer __r = static_cast<__node_pointer>(__child);
+    bool __inserted = false;
+    if (__child == nullptr)
+    {
+        __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
+        __r = __h.release();
+        __inserted = true;
+    }
+    return pair<iterator, bool>(iterator(__r), __inserted);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class... _Args>
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::__emplace_hint_unique_impl(const_iterator __p, _Args&&... __args)
+{
+    __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
+    __parent_pointer __parent;
+    __node_base_pointer __dummy;
+    __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __h->__value_);
+    __node_pointer __r = static_cast<__node_pointer>(__child);
+    if (__child == nullptr)
+    {
+        __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
+        __r = __h.release();
+    }
+    return iterator(__r);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class... _Args>
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::__emplace_multi(_Args&&... __args)
+{
+    __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
+    __parent_pointer __parent;
+    __node_base_pointer& __child = __find_leaf_high(__parent, _NodeTypes::__get_key(__h->__value_));
+    __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
+    return iterator(static_cast<__node_pointer>(__h.release()));
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class... _Args>
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::__emplace_hint_multi(const_iterator __p,
+                                                        _Args&&... __args)
+{
+    __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
+    __parent_pointer __parent;
+    __node_base_pointer& __child = __find_leaf(__p, __parent, _NodeTypes::__get_key(__h->__value_));
+    __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
+    return iterator(static_cast<__node_pointer>(__h.release()));
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
+__tree<_Tp, _Compare, _Allocator>::__node_assign_unique(const __container_value_type& __v, __node_pointer __nd)
+{
+    __parent_pointer __parent;
+    __node_base_pointer& __child = __find_equal(__parent, _NodeTypes::__get_key(__v));
+    __node_pointer __r = static_cast<__node_pointer>(__child);
+    bool __inserted = false;
+    if (__child == nullptr)
+    {
+        __nd->__value_ = __v;
+        __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
+        __r = __nd;
+        __inserted = true;
+    }
+    return pair<iterator, bool>(iterator(__r), __inserted);
+}
+
+
+template <class _Tp, class _Compare, class _Allocator>
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::__node_insert_multi(__node_pointer __nd)
+{
+    __parent_pointer __parent;
+    __node_base_pointer& __child = __find_leaf_high(__parent, _NodeTypes::__get_key(__nd->__value_));
+    __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
+    return iterator(__nd);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::__node_insert_multi(const_iterator __p,
+                                                       __node_pointer __nd)
+{
+    __parent_pointer __parent;
+    __node_base_pointer& __child = __find_leaf(__p, __parent, _NodeTypes::__get_key(__nd->__value_));
+    __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
+    return iterator(__nd);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::__remove_node_pointer(__node_pointer __ptr) _NOEXCEPT
+{
+    iterator __r(__ptr);
+    ++__r;
+    if (__begin_node() == __ptr)
+        __begin_node() = __r.__ptr_;
+    --size();
+    _VSTD::__tree_remove(__end_node()->__left_,
+                         static_cast<__node_base_pointer>(__ptr));
+    return __r;
+}
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp, class _Compare, class _Allocator>
+template <class _NodeHandle, class _InsertReturnType>
+_LIBCPP_INLINE_VISIBILITY
+_InsertReturnType
+__tree<_Tp, _Compare, _Allocator>::__node_handle_insert_unique(
+    _NodeHandle&& __nh)
+{
+    if (__nh.empty())
+        return _InsertReturnType{end(), false, _NodeHandle()};
+
+    __node_pointer __ptr = __nh.__ptr_;
+    __parent_pointer __parent;
+    __node_base_pointer& __child = __find_equal(__parent,
+                                                __ptr->__value_);
+    if (__child != nullptr)
+        return _InsertReturnType{
+            iterator(static_cast<__node_pointer>(__child)),
+            false, _VSTD::move(__nh)};
+
+    __insert_node_at(__parent, __child,
+                     static_cast<__node_base_pointer>(__ptr));
+    __nh.__release_ptr();
+    return _InsertReturnType{iterator(__ptr), true, _NodeHandle()};
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _NodeHandle>
+_LIBCPP_INLINE_VISIBILITY
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::__node_handle_insert_unique(
+    const_iterator __hint, _NodeHandle&& __nh)
+{
+    if (__nh.empty())
+        return end();
+
+    __node_pointer __ptr = __nh.__ptr_;
+    __parent_pointer __parent;
+    __node_base_pointer __dummy;
+    __node_base_pointer& __child = __find_equal(__hint, __parent, __dummy,
+                                                __ptr->__value_);
+    __node_pointer __r = static_cast<__node_pointer>(__child);
+    if (__child == nullptr)
+    {
+        __insert_node_at(__parent, __child,
+                         static_cast<__node_base_pointer>(__ptr));
+        __r = __ptr;
+        __nh.__release_ptr();
+    }
+    return iterator(__r);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _NodeHandle>
+_LIBCPP_INLINE_VISIBILITY
+_NodeHandle
+__tree<_Tp, _Compare, _Allocator>::__node_handle_extract(key_type const& __key)
+{
+    iterator __it = find(__key);
+    if (__it == end())
+        return _NodeHandle();
+    return __node_handle_extract<_NodeHandle>(__it);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _NodeHandle>
+_LIBCPP_INLINE_VISIBILITY
+_NodeHandle
+__tree<_Tp, _Compare, _Allocator>::__node_handle_extract(const_iterator __p)
+{
+    __node_pointer __np = __p.__get_np();
+    __remove_node_pointer(__np);
+    return _NodeHandle(__np, __alloc());
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Tree>
+_LIBCPP_INLINE_VISIBILITY
+void
+__tree<_Tp, _Compare, _Allocator>::__node_handle_merge_unique(_Tree& __source)
+{
+    static_assert(is_same<typename _Tree::__node_pointer, __node_pointer>::value, "");
+
+    for (typename _Tree::iterator __i = __source.begin();
+         __i != __source.end();)
+    {
+        __node_pointer __src_ptr = __i.__get_np();
+        __parent_pointer __parent;
+        __node_base_pointer& __child =
+            __find_equal(__parent, _NodeTypes::__get_key(__src_ptr->__value_));
+        ++__i;
+        if (__child != nullptr)
+            continue;
+        __source.__remove_node_pointer(__src_ptr);
+        __insert_node_at(__parent, __child,
+                         static_cast<__node_base_pointer>(__src_ptr));
+    }
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _NodeHandle>
+_LIBCPP_INLINE_VISIBILITY
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::__node_handle_insert_multi(_NodeHandle&& __nh)
+{
+    if (__nh.empty())
+        return end();
+    __node_pointer __ptr = __nh.__ptr_;
+    __parent_pointer __parent;
+    __node_base_pointer& __child = __find_leaf_high(
+        __parent, _NodeTypes::__get_key(__ptr->__value_));
+    __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__ptr));
+    __nh.__release_ptr();
+    return iterator(__ptr);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _NodeHandle>
+_LIBCPP_INLINE_VISIBILITY
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::__node_handle_insert_multi(
+    const_iterator __hint, _NodeHandle&& __nh)
+{
+    if (__nh.empty())
+        return end();
+
+    __node_pointer __ptr = __nh.__ptr_;
+    __parent_pointer __parent;
+    __node_base_pointer& __child = __find_leaf(__hint, __parent,
+                                               _NodeTypes::__get_key(__ptr->__value_));
+    __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__ptr));
+    __nh.__release_ptr();
+    return iterator(__ptr);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Tree>
+_LIBCPP_INLINE_VISIBILITY
+void
+__tree<_Tp, _Compare, _Allocator>::__node_handle_merge_multi(_Tree& __source)
+{
+    static_assert(is_same<typename _Tree::__node_pointer, __node_pointer>::value, "");
+
+    for (typename _Tree::iterator __i = __source.begin();
+         __i != __source.end();)
+    {
+        __node_pointer __src_ptr = __i.__get_np();
+        __parent_pointer __parent;
+        __node_base_pointer& __child = __find_leaf_high(
+            __parent, _NodeTypes::__get_key(__src_ptr->__value_));
+        ++__i;
+        __source.__remove_node_pointer(__src_ptr);
+        __insert_node_at(__parent, __child,
+                         static_cast<__node_base_pointer>(__src_ptr));
+    }
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+template <class _Tp, class _Compare, class _Allocator>
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::erase(const_iterator __p)
+{
+    __node_pointer __np = __p.__get_np();
+    iterator __r = __remove_node_pointer(__np);
+    __node_allocator& __na = __node_alloc();
+    __node_traits::destroy(__na, _NodeTypes::__get_ptr(
+        const_cast<__node_value_type&>(*__p)));
+    __node_traits::deallocate(__na, __np, 1);
+    return __r;
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::erase(const_iterator __f, const_iterator __l)
+{
+    while (__f != __l)
+        __f = erase(__f);
+    return iterator(__l.__ptr_);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+typename __tree<_Tp, _Compare, _Allocator>::size_type
+__tree<_Tp, _Compare, _Allocator>::__erase_unique(const _Key& __k)
+{
+    iterator __i = find(__k);
+    if (__i == end())
+        return 0;
+    erase(__i);
+    return 1;
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+typename __tree<_Tp, _Compare, _Allocator>::size_type
+__tree<_Tp, _Compare, _Allocator>::__erase_multi(const _Key& __k)
+{
+    pair<iterator, iterator> __p = __equal_range_multi(__k);
+    size_type __r = 0;
+    for (; __p.first != __p.second; ++__r)
+        __p.first = erase(__p.first);
+    return __r;
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::find(const _Key& __v)
+{
+    iterator __p = __lower_bound(__v, __root(), __end_node());
+    if (__p != end() && !value_comp()(__v, *__p))
+        return __p;
+    return end();
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+typename __tree<_Tp, _Compare, _Allocator>::const_iterator
+__tree<_Tp, _Compare, _Allocator>::find(const _Key& __v) const
+{
+    const_iterator __p = __lower_bound(__v, __root(), __end_node());
+    if (__p != end() && !value_comp()(__v, *__p))
+        return __p;
+    return end();
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+typename __tree<_Tp, _Compare, _Allocator>::size_type
+__tree<_Tp, _Compare, _Allocator>::__count_unique(const _Key& __k) const
+{
+    __node_pointer __rt = __root();
+    while (__rt != nullptr)
+    {
+        if (value_comp()(__k, __rt->__value_))
+        {
+            __rt = static_cast<__node_pointer>(__rt->__left_);
+        }
+        else if (value_comp()(__rt->__value_, __k))
+            __rt = static_cast<__node_pointer>(__rt->__right_);
+        else
+            return 1;
+    }
+    return 0;
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+typename __tree<_Tp, _Compare, _Allocator>::size_type
+__tree<_Tp, _Compare, _Allocator>::__count_multi(const _Key& __k) const
+{
+    __iter_pointer __result = __end_node();
+    __node_pointer __rt = __root();
+    while (__rt != nullptr)
+    {
+        if (value_comp()(__k, __rt->__value_))
+        {
+            __result = static_cast<__iter_pointer>(__rt);
+            __rt = static_cast<__node_pointer>(__rt->__left_);
+        }
+        else if (value_comp()(__rt->__value_, __k))
+            __rt = static_cast<__node_pointer>(__rt->__right_);
+        else
+            return _VSTD::distance(
+                __lower_bound(__k, static_cast<__node_pointer>(__rt->__left_), static_cast<__iter_pointer>(__rt)),
+                __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result)
+            );
+    }
+    return 0;
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v,
+                                                 __node_pointer __root,
+                                                 __iter_pointer __result)
+{
+    while (__root != nullptr)
+    {
+        if (!value_comp()(__root->__value_, __v))
+        {
+            __result = static_cast<__iter_pointer>(__root);
+            __root = static_cast<__node_pointer>(__root->__left_);
+        }
+        else
+            __root = static_cast<__node_pointer>(__root->__right_);
+    }
+    return iterator(__result);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+typename __tree<_Tp, _Compare, _Allocator>::const_iterator
+__tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v,
+                                                 __node_pointer __root,
+                                                 __iter_pointer __result) const
+{
+    while (__root != nullptr)
+    {
+        if (!value_comp()(__root->__value_, __v))
+        {
+            __result = static_cast<__iter_pointer>(__root);
+            __root = static_cast<__node_pointer>(__root->__left_);
+        }
+        else
+            __root = static_cast<__node_pointer>(__root->__right_);
+    }
+    return const_iterator(__result);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+typename __tree<_Tp, _Compare, _Allocator>::iterator
+__tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
+                                                 __node_pointer __root,
+                                                 __iter_pointer __result)
+{
+    while (__root != nullptr)
+    {
+        if (value_comp()(__v, __root->__value_))
+        {
+            __result = static_cast<__iter_pointer>(__root);
+            __root = static_cast<__node_pointer>(__root->__left_);
+        }
+        else
+            __root = static_cast<__node_pointer>(__root->__right_);
+    }
+    return iterator(__result);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+typename __tree<_Tp, _Compare, _Allocator>::const_iterator
+__tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
+                                                 __node_pointer __root,
+                                                 __iter_pointer __result) const
+{
+    while (__root != nullptr)
+    {
+        if (value_comp()(__v, __root->__value_))
+        {
+            __result = static_cast<__iter_pointer>(__root);
+            __root = static_cast<__node_pointer>(__root->__left_);
+        }
+        else
+            __root = static_cast<__node_pointer>(__root->__right_);
+    }
+    return const_iterator(__result);
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+pair<typename __tree<_Tp, _Compare, _Allocator>::iterator,
+     typename __tree<_Tp, _Compare, _Allocator>::iterator>
+__tree<_Tp, _Compare, _Allocator>::__equal_range_unique(const _Key& __k)
+{
+    typedef pair<iterator, iterator> _Pp;
+    __iter_pointer __result = __end_node();
+    __node_pointer __rt = __root();
+    while (__rt != nullptr)
+    {
+        if (value_comp()(__k, __rt->__value_))
+        {
+            __result = static_cast<__iter_pointer>(__rt);
+            __rt = static_cast<__node_pointer>(__rt->__left_);
+        }
+        else if (value_comp()(__rt->__value_, __k))
+            __rt = static_cast<__node_pointer>(__rt->__right_);
+        else
+            return _Pp(iterator(__rt),
+                      iterator(
+                          __rt->__right_ != nullptr ?
+                              static_cast<__iter_pointer>(_VSTD::__tree_min(__rt->__right_))
+                            : __result));
+    }
+    return _Pp(iterator(__result), iterator(__result));
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+pair<typename __tree<_Tp, _Compare, _Allocator>::const_iterator,
+     typename __tree<_Tp, _Compare, _Allocator>::const_iterator>
+__tree<_Tp, _Compare, _Allocator>::__equal_range_unique(const _Key& __k) const
+{
+    typedef pair<const_iterator, const_iterator> _Pp;
+    __iter_pointer __result = __end_node();
+    __node_pointer __rt = __root();
+    while (__rt != nullptr)
+    {
+        if (value_comp()(__k, __rt->__value_))
+        {
+            __result = static_cast<__iter_pointer>(__rt);
+            __rt = static_cast<__node_pointer>(__rt->__left_);
+        }
+        else if (value_comp()(__rt->__value_, __k))
+            __rt = static_cast<__node_pointer>(__rt->__right_);
+        else
+            return _Pp(const_iterator(__rt),
+                      const_iterator(
+                          __rt->__right_ != nullptr ?
+                              static_cast<__iter_pointer>(_VSTD::__tree_min(__rt->__right_))
+                            : __result));
+    }
+    return _Pp(const_iterator(__result), const_iterator(__result));
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+pair<typename __tree<_Tp, _Compare, _Allocator>::iterator,
+     typename __tree<_Tp, _Compare, _Allocator>::iterator>
+__tree<_Tp, _Compare, _Allocator>::__equal_range_multi(const _Key& __k)
+{
+    typedef pair<iterator, iterator> _Pp;
+    __iter_pointer __result = __end_node();
+    __node_pointer __rt = __root();
+    while (__rt != nullptr)
+    {
+        if (value_comp()(__k, __rt->__value_))
+        {
+            __result = static_cast<__iter_pointer>(__rt);
+            __rt = static_cast<__node_pointer>(__rt->__left_);
+        }
+        else if (value_comp()(__rt->__value_, __k))
+            __rt = static_cast<__node_pointer>(__rt->__right_);
+        else
+            return _Pp(__lower_bound(__k, static_cast<__node_pointer>(__rt->__left_), static_cast<__iter_pointer>(__rt)),
+                      __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
+    }
+    return _Pp(iterator(__result), iterator(__result));
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+template <class _Key>
+pair<typename __tree<_Tp, _Compare, _Allocator>::const_iterator,
+     typename __tree<_Tp, _Compare, _Allocator>::const_iterator>
+__tree<_Tp, _Compare, _Allocator>::__equal_range_multi(const _Key& __k) const
+{
+    typedef pair<const_iterator, const_iterator> _Pp;
+    __iter_pointer __result = __end_node();
+    __node_pointer __rt = __root();
+    while (__rt != nullptr)
+    {
+        if (value_comp()(__k, __rt->__value_))
+        {
+            __result = static_cast<__iter_pointer>(__rt);
+            __rt = static_cast<__node_pointer>(__rt->__left_);
+        }
+        else if (value_comp()(__rt->__value_, __k))
+            __rt = static_cast<__node_pointer>(__rt->__right_);
+        else
+            return _Pp(__lower_bound(__k, static_cast<__node_pointer>(__rt->__left_), static_cast<__iter_pointer>(__rt)),
+                      __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
+    }
+    return _Pp(const_iterator(__result), const_iterator(__result));
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+typename __tree<_Tp, _Compare, _Allocator>::__node_holder
+__tree<_Tp, _Compare, _Allocator>::remove(const_iterator __p) _NOEXCEPT
+{
+    __node_pointer __np = __p.__get_np();
+    if (__begin_node() == __p.__ptr_)
+    {
+        if (__np->__right_ != nullptr)
+            __begin_node() = static_cast<__iter_pointer>(__np->__right_);
+        else
+            __begin_node() = static_cast<__iter_pointer>(__np->__parent_);
+    }
+    --size();
+    _VSTD::__tree_remove(__end_node()->__left_,
+                         static_cast<__node_base_pointer>(__np));
+    return __node_holder(__np, _Dp(__node_alloc(), true));
+}
+
+template <class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(__tree<_Tp, _Compare, _Allocator>& __x,
+     __tree<_Tp, _Compare, _Allocator>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___TREE
diff --git a/app/src/main/cpp/libcxx/include/__tuple_dir/apply_cv.h b/app/src/main/cpp/libcxx/include/__tuple_dir/apply_cv.h
new file mode 100644
index 0000000..296755a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__tuple_dir/apply_cv.h
@@ -0,0 +1,70 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TUPLE_APPLY_CV_H
+#define _LIBCPP___TUPLE_APPLY_CV_H
+
+#include <__config>
+#include <__type_traits/is_const.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/is_volatile.h>
+#include <__type_traits/remove_reference.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <bool _ApplyLV, bool _ApplyConst, bool _ApplyVolatile>
+struct __apply_cv_mf;
+template <>
+struct __apply_cv_mf<false, false, false> {
+  template <class _Tp> using __apply = _Tp;
+};
+template <>
+struct __apply_cv_mf<false, true, false> {
+  template <class _Tp> using __apply _LIBCPP_NODEBUG = const _Tp;
+};
+template <>
+struct __apply_cv_mf<false, false, true> {
+  template <class _Tp> using __apply _LIBCPP_NODEBUG = volatile _Tp;
+};
+template <>
+struct __apply_cv_mf<false, true, true> {
+  template <class _Tp> using __apply _LIBCPP_NODEBUG = const volatile _Tp;
+};
+template <>
+struct __apply_cv_mf<true, false, false> {
+  template <class _Tp> using __apply _LIBCPP_NODEBUG = _Tp&;
+};
+template <>
+struct __apply_cv_mf<true, true, false> {
+  template <class _Tp> using __apply _LIBCPP_NODEBUG = const _Tp&;
+};
+template <>
+struct __apply_cv_mf<true, false, true> {
+  template <class _Tp> using __apply _LIBCPP_NODEBUG = volatile _Tp&;
+};
+template <>
+struct __apply_cv_mf<true, true, true> {
+  template <class _Tp> using __apply _LIBCPP_NODEBUG = const volatile _Tp&;
+};
+template <class _Tp, class _RawTp = __libcpp_remove_reference_t<_Tp> >
+using __apply_cv_t _LIBCPP_NODEBUG = __apply_cv_mf<
+    is_lvalue_reference<_Tp>::value,
+    is_const<_RawTp>::value,
+    is_volatile<_RawTp>::value>;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___TUPLE_APPLY_CV_H
diff --git a/app/src/main/cpp/libcxx/include/__tuple_dir/make_tuple_types.h b/app/src/main/cpp/libcxx/include/__tuple_dir/make_tuple_types.h
new file mode 100644
index 0000000..913ff9b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__tuple_dir/make_tuple_types.h
@@ -0,0 +1,84 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TUPLE_MAKE_TUPLE_TYPES_H
+#define _LIBCPP___TUPLE_MAKE_TUPLE_TYPES_H
+
+#include <__config>
+#include <__fwd/array.h>
+#include <__fwd/tuple.h>
+#include <__tuple_dir/apply_cv.h>
+#include <__tuple_dir/tuple_element.h>
+#include <__tuple_dir/tuple_indices.h>
+#include <__tuple_dir/tuple_size.h>
+#include <__tuple_dir/tuple_types.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/remove_reference.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// __make_tuple_types<_Tuple<_Types...>, _Ep, _Sp>::type is a
+// __tuple_types<_Types...> using only those _Types in the range [_Sp, _Ep).
+// _Sp defaults to 0 and _Ep defaults to tuple_size<_Tuple>.  If _Tuple is a
+// lvalue_reference type, then __tuple_types<_Types&...> is the result.
+
+template <class _TupleTypes, class _TupleIndices>
+struct __make_tuple_types_flat;
+
+template <template <class...> class _Tuple, class ..._Types, size_t ..._Idx>
+struct __make_tuple_types_flat<_Tuple<_Types...>, __tuple_indices<_Idx...>> {
+  // Specialization for pair, tuple, and __tuple_types
+  template <class _Tp, class _ApplyFn = __apply_cv_t<_Tp>>
+  using __apply_quals _LIBCPP_NODEBUG = __tuple_types<
+      typename _ApplyFn::template __apply<__type_pack_element<_Idx, _Types...>>...
+    >;
+};
+
+template <class _Vt, size_t _Np, size_t ..._Idx>
+struct __make_tuple_types_flat<array<_Vt, _Np>, __tuple_indices<_Idx...>> {
+  template <size_t>
+  using __value_type = _Vt;
+  template <class _Tp, class _ApplyFn = __apply_cv_t<_Tp>>
+  using __apply_quals = __tuple_types<
+      typename _ApplyFn::template __apply<__value_type<_Idx>>...
+    >;
+};
+
+template <class _Tp, size_t _Ep = tuple_size<__libcpp_remove_reference_t<_Tp> >::value,
+          size_t _Sp = 0,
+          bool _SameSize = (_Ep == tuple_size<__libcpp_remove_reference_t<_Tp> >::value)>
+struct __make_tuple_types
+{
+    static_assert(_Sp <= _Ep, "__make_tuple_types input error");
+    using _RawTp = __remove_cv_t<__libcpp_remove_reference_t<_Tp> >;
+    using _Maker = __make_tuple_types_flat<_RawTp, typename __make_tuple_indices<_Ep, _Sp>::type>;
+    using type = typename _Maker::template __apply_quals<_Tp>;
+};
+
+template <class ..._Types, size_t _Ep>
+struct __make_tuple_types<tuple<_Types...>, _Ep, 0, true> {
+  typedef _LIBCPP_NODEBUG __tuple_types<_Types...> type;
+};
+
+template <class ..._Types, size_t _Ep>
+struct __make_tuple_types<__tuple_types<_Types...>, _Ep, 0, true> {
+  typedef _LIBCPP_NODEBUG __tuple_types<_Types...> type;
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___TUPLE_MAKE_TUPLE_TYPES_H
diff --git a/app/src/main/cpp/libcxx/include/__tuple_dir/pair_like.h b/app/src/main/cpp/libcxx/include/__tuple_dir/pair_like.h
new file mode 100644
index 0000000..87407ad
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__tuple_dir/pair_like.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TUPLE_PAIR_LIKE_H
+#define _LIBCPP___TUPLE_PAIR_LIKE_H
+
+#include <__config>
+#include <__tuple_dir/tuple_like.h>
+#include <__tuple_dir/tuple_size.h>
+#include <__type_traits/remove_cvref.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER >= 20
+
+template <class _Tp>
+concept __pair_like = __tuple_like<_Tp> && tuple_size<remove_cvref_t<_Tp>>::value == 2;
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TUPLE_PAIR_LIKE_H
diff --git a/app/src/main/cpp/libcxx/include/__tuple_dir/sfinae_helpers.h b/app/src/main/cpp/libcxx/include/__tuple_dir/sfinae_helpers.h
new file mode 100644
index 0000000..fcd65a0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__tuple_dir/sfinae_helpers.h
@@ -0,0 +1,196 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TUPLE_SFINAE_HELPERS_H
+#define _LIBCPP___TUPLE_SFINAE_HELPERS_H
+
+#include <__config>
+#include <__fwd/tuple.h>
+#include <__tuple_dir/make_tuple_types.h>
+#include <__tuple_dir/tuple_element.h>
+#include <__tuple_dir/tuple_like_ext.h>
+#include <__tuple_dir/tuple_size.h>
+#include <__tuple_dir/tuple_types.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_assignable.h>
+#include <__type_traits/is_constructible.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/remove_cvref.h>
+#include <__type_traits/remove_reference.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <bool ..._Preds>
+struct __all_dummy;
+
+template <bool ..._Pred>
+struct __all : _IsSame<__all_dummy<_Pred...>, __all_dummy<((void)_Pred, true)...>> {};
+
+struct __tuple_sfinae_base {
+  template <template <class, class...> class _Trait,
+            class ..._LArgs, class ..._RArgs>
+  static auto __do_test(__tuple_types<_LArgs...>, __tuple_types<_RArgs...>)
+    -> __all<__enable_if_t<_Trait<_LArgs, _RArgs>::value, bool>{true}...>;
+  template <template <class...> class>
+  static auto __do_test(...) -> false_type;
+
+  template <class _FromArgs, class _ToArgs>
+  using __constructible = decltype(__do_test<is_constructible>(_ToArgs{}, _FromArgs{}));
+  template <class _FromArgs, class _ToArgs>
+  using __convertible = decltype(__do_test<is_convertible>(_FromArgs{}, _ToArgs{}));
+  template <class _FromArgs, class _ToArgs>
+  using __assignable = decltype(__do_test<is_assignable>(_ToArgs{}, _FromArgs{}));
+};
+
+// __tuple_convertible
+
+template <class _Tp, class _Up, bool = __tuple_like_ext<__libcpp_remove_reference_t<_Tp> >::value,
+                                bool = __tuple_like_ext<_Up>::value>
+struct __tuple_convertible
+    : public false_type {};
+
+template <class _Tp, class _Up>
+struct __tuple_convertible<_Tp, _Up, true, true>
+    : public __tuple_sfinae_base::__convertible<
+      typename __make_tuple_types<_Tp>::type
+    , typename __make_tuple_types<_Up>::type
+    >
+{};
+
+// __tuple_constructible
+
+template <class _Tp, class _Up, bool = __tuple_like_ext<__libcpp_remove_reference_t<_Tp> >::value,
+                                bool = __tuple_like_ext<_Up>::value>
+struct __tuple_constructible
+    : public false_type {};
+
+template <class _Tp, class _Up>
+struct __tuple_constructible<_Tp, _Up, true, true>
+    : public __tuple_sfinae_base::__constructible<
+      typename __make_tuple_types<_Tp>::type
+    , typename __make_tuple_types<_Up>::type
+    >
+{};
+
+// __tuple_assignable
+
+template <class _Tp, class _Up, bool = __tuple_like_ext<__libcpp_remove_reference_t<_Tp> >::value,
+                                bool = __tuple_like_ext<_Up>::value>
+struct __tuple_assignable
+    : public false_type {};
+
+template <class _Tp, class _Up>
+struct __tuple_assignable<_Tp, _Up, true, true>
+    : public __tuple_sfinae_base::__assignable<
+      typename __make_tuple_types<_Tp>::type
+    , typename __make_tuple_types<_Up&>::type
+    >
+{};
+
+
+template <size_t _Ip, class ..._Tp>
+struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, tuple<_Tp...> >
+{
+    typedef _LIBCPP_NODEBUG typename tuple_element<_Ip, __tuple_types<_Tp...> >::type type;
+};
+
+template <bool _IsTuple, class _SizeTrait, size_t _Expected>
+struct __tuple_like_with_size_imp : false_type {};
+
+template <class _SizeTrait, size_t _Expected>
+struct __tuple_like_with_size_imp<true, _SizeTrait, _Expected>
+    : integral_constant<bool, _SizeTrait::value == _Expected> {};
+
+template <class _Tuple, size_t _ExpectedSize, class _RawTuple = __libcpp_remove_reference_t<_Tuple> >
+using __tuple_like_with_size _LIBCPP_NODEBUG = __tuple_like_with_size_imp<
+                                   __tuple_like_ext<_RawTuple>::value,
+                                   tuple_size<_RawTuple>, _ExpectedSize
+                              >;
+
+struct _LIBCPP_TYPE_VIS __check_tuple_constructor_fail {
+
+    static constexpr bool __enable_explicit_default() { return false; }
+    static constexpr bool __enable_implicit_default() { return false; }
+    template <class ...>
+    static constexpr bool __enable_explicit() { return false; }
+    template <class ...>
+    static constexpr bool __enable_implicit() { return false; }
+    template <class ...>
+    static constexpr bool __enable_assign() { return false; }
+};
+#endif // !defined(_LIBCPP_CXX03_LANG)
+
+#if _LIBCPP_STD_VER > 14
+
+template <bool _CanCopy, bool _CanMove>
+struct __sfinae_ctor_base {};
+template <>
+struct __sfinae_ctor_base<false, false> {
+  __sfinae_ctor_base() = default;
+  __sfinae_ctor_base(__sfinae_ctor_base const&) = delete;
+  __sfinae_ctor_base(__sfinae_ctor_base &&) = delete;
+  __sfinae_ctor_base& operator=(__sfinae_ctor_base const&) = default;
+  __sfinae_ctor_base& operator=(__sfinae_ctor_base&&) = default;
+};
+template <>
+struct __sfinae_ctor_base<true, false> {
+  __sfinae_ctor_base() = default;
+  __sfinae_ctor_base(__sfinae_ctor_base const&) = default;
+  __sfinae_ctor_base(__sfinae_ctor_base &&) = delete;
+  __sfinae_ctor_base& operator=(__sfinae_ctor_base const&) = default;
+  __sfinae_ctor_base& operator=(__sfinae_ctor_base&&) = default;
+};
+template <>
+struct __sfinae_ctor_base<false, true> {
+  __sfinae_ctor_base() = default;
+  __sfinae_ctor_base(__sfinae_ctor_base const&) = delete;
+  __sfinae_ctor_base(__sfinae_ctor_base &&) = default;
+  __sfinae_ctor_base& operator=(__sfinae_ctor_base const&) = default;
+  __sfinae_ctor_base& operator=(__sfinae_ctor_base&&) = default;
+};
+
+template <bool _CanCopy, bool _CanMove>
+struct __sfinae_assign_base {};
+template <>
+struct __sfinae_assign_base<false, false> {
+  __sfinae_assign_base() = default;
+  __sfinae_assign_base(__sfinae_assign_base const&) = default;
+  __sfinae_assign_base(__sfinae_assign_base &&) = default;
+  __sfinae_assign_base& operator=(__sfinae_assign_base const&) = delete;
+  __sfinae_assign_base& operator=(__sfinae_assign_base&&) = delete;
+};
+template <>
+struct __sfinae_assign_base<true, false> {
+  __sfinae_assign_base() = default;
+  __sfinae_assign_base(__sfinae_assign_base const&) = default;
+  __sfinae_assign_base(__sfinae_assign_base &&) = default;
+  __sfinae_assign_base& operator=(__sfinae_assign_base const&) = default;
+  __sfinae_assign_base& operator=(__sfinae_assign_base&&) = delete;
+};
+template <>
+struct __sfinae_assign_base<false, true> {
+  __sfinae_assign_base() = default;
+  __sfinae_assign_base(__sfinae_assign_base const&) = default;
+  __sfinae_assign_base(__sfinae_assign_base &&) = default;
+  __sfinae_assign_base& operator=(__sfinae_assign_base const&) = delete;
+  __sfinae_assign_base& operator=(__sfinae_assign_base&&) = default;
+};
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TUPLE_SFINAE_HELPERS_H
diff --git a/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_element.h b/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_element.h
new file mode 100644
index 0000000..06f49bf
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_element.h
@@ -0,0 +1,93 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TUPLE_TUPLE_ELEMENT_H
+#define _LIBCPP___TUPLE_TUPLE_ELEMENT_H
+
+#include <__config>
+#include <__tuple_dir/tuple_indices.h>
+#include <__tuple_dir/tuple_types.h>
+#include <__type_traits/add_const.h>
+#include <__type_traits/add_cv.h>
+#include <__type_traits/add_volatile.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <size_t _Ip, class _Tp> struct _LIBCPP_TEMPLATE_VIS tuple_element;
+
+template <size_t _Ip, class _Tp>
+struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, const _Tp>
+{
+    typedef _LIBCPP_NODEBUG typename add_const<typename tuple_element<_Ip, _Tp>::type>::type type;
+};
+
+template <size_t _Ip, class _Tp>
+struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, volatile _Tp>
+{
+    typedef _LIBCPP_NODEBUG typename add_volatile<typename tuple_element<_Ip, _Tp>::type>::type type;
+};
+
+template <size_t _Ip, class _Tp>
+struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, const volatile _Tp>
+{
+    typedef _LIBCPP_NODEBUG typename add_cv<typename tuple_element<_Ip, _Tp>::type>::type type;
+};
+
+#ifndef _LIBCPP_CXX03_LANG
+
+#if !__has_builtin(__type_pack_element)
+
+namespace __indexer_detail {
+
+template <size_t _Idx, class _Tp>
+struct __indexed { using type _LIBCPP_NODEBUG = _Tp; };
+
+template <class _Types, class _Indexes> struct __indexer;
+
+template <class ..._Types, size_t ..._Idx>
+struct __indexer<__tuple_types<_Types...>, __tuple_indices<_Idx...>>
+    : __indexed<_Idx, _Types>...
+{};
+
+template <size_t _Idx, class _Tp>
+__indexed<_Idx, _Tp> __at_index(__indexed<_Idx, _Tp> const&);
+
+} // namespace __indexer_detail
+
+template <size_t _Idx, class ..._Types>
+using __type_pack_element _LIBCPP_NODEBUG = typename decltype(
+    __indexer_detail::__at_index<_Idx>(
+        __indexer_detail::__indexer<
+            __tuple_types<_Types...>,
+            typename __make_tuple_indices<sizeof...(_Types)>::type
+        >{})
+  )::type;
+#endif
+
+template <size_t _Ip, class ..._Types>
+struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, __tuple_types<_Types...> >
+{
+    static_assert(_Ip < sizeof...(_Types), "tuple_element index out of range");
+    typedef _LIBCPP_NODEBUG __type_pack_element<_Ip, _Types...> type;
+};
+
+#if _LIBCPP_STD_VER > 11
+template <size_t _Ip, class ..._Tp>
+using tuple_element_t _LIBCPP_NODEBUG = typename tuple_element <_Ip, _Tp...>::type;
+#endif
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TUPLE_TUPLE_ELEMENT_H
diff --git a/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_indices.h b/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_indices.h
new file mode 100644
index 0000000..18666d5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_indices.h
@@ -0,0 +1,37 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TUPLE_MAKE_TUPLE_INDICES_H
+#define _LIBCPP___TUPLE_MAKE_TUPLE_INDICES_H
+
+#include <__config>
+#include <__utility/integer_sequence.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <size_t...> struct __tuple_indices {};
+
+template <size_t _Ep, size_t _Sp = 0>
+struct __make_tuple_indices
+{
+    static_assert(_Sp <= _Ep, "__make_tuple_indices input error");
+    typedef __make_indices_imp<_Ep, _Sp> type;
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP___TUPLE_MAKE_TUPLE_INDICES_H
diff --git a/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_like.h b/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_like.h
new file mode 100644
index 0000000..dab395b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_like.h
@@ -0,0 +1,51 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TUPLE_TUPLE_LIKE_H
+#define _LIBCPP___TUPLE_TUPLE_LIKE_H
+
+#include <__config>
+#include <__fwd/array.h>
+#include <__fwd/pair.h>
+#include <__fwd/subrange.h>
+#include <__fwd/tuple.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/remove_cvref.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER >= 20
+
+template <class _Tp>
+struct __tuple_like_impl : false_type {};
+
+template <class... _Tp>
+struct __tuple_like_impl<tuple<_Tp...> > : true_type {};
+
+template <class _T1, class _T2>
+struct __tuple_like_impl<pair<_T1, _T2> > : true_type {};
+
+template <class _Tp, size_t _Size>
+struct __tuple_like_impl<array<_Tp, _Size> > : true_type {};
+
+template <class _Ip, class _Sp, ranges::subrange_kind _Kp>
+struct __tuple_like_impl<ranges::subrange<_Ip, _Sp, _Kp> > : true_type {};
+
+template <class _Tp>
+concept __tuple_like = __tuple_like_impl<remove_cvref_t<_Tp>>::value;
+
+#endif // _LIBCPP_STD_VER >= 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TUPLE_TUPLE_LIKE_H
diff --git a/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_like_ext.h b/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_like_ext.h
new file mode 100644
index 0000000..bf98696
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_like_ext.h
@@ -0,0 +1,44 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TUPLE_TUPLE_LIKE_EXT_H
+#define _LIBCPP___TUPLE_TUPLE_LIKE_EXT_H
+
+#include <__config>
+#include <__fwd/array.h>
+#include <__fwd/pair.h>
+#include <__fwd/tuple.h>
+#include <__tuple_dir/tuple_types.h>
+#include <__type_traits/integral_constant.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct __tuple_like_ext : false_type {};
+
+template <class _Tp> struct __tuple_like_ext<const _Tp> : public __tuple_like_ext<_Tp> {};
+template <class _Tp> struct __tuple_like_ext<volatile _Tp> : public __tuple_like_ext<_Tp> {};
+template <class _Tp> struct __tuple_like_ext<const volatile _Tp> : public __tuple_like_ext<_Tp> {};
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class... _Tp> struct __tuple_like_ext<tuple<_Tp...> > : true_type {};
+#endif
+
+template <class _T1, class _T2> struct __tuple_like_ext<pair<_T1, _T2> > : true_type {};
+
+template <class _Tp, size_t _Size> struct __tuple_like_ext<array<_Tp, _Size> > : true_type {};
+
+template <class... _Tp> struct __tuple_like_ext<__tuple_types<_Tp...> > : true_type {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TUPLE_TUPLE_LIKE_EXT_H
diff --git a/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_size.h b/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_size.h
new file mode 100644
index 0000000..d551b22
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_size.h
@@ -0,0 +1,75 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TUPLE_TUPLE_SIZE_H
+#define _LIBCPP___TUPLE_TUPLE_SIZE_H
+
+#include <__config>
+#include <__fwd/tuple.h>
+#include <__tuple_dir/tuple_types.h>
+#include <__type_traits/is_const.h>
+#include <__type_traits/is_volatile.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS tuple_size;
+
+#if !defined(_LIBCPP_CXX03_LANG)
+template <class _Tp, class...>
+using __enable_if_tuple_size_imp = _Tp;
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS tuple_size<__enable_if_tuple_size_imp<
+    const _Tp,
+    __enable_if_t<!is_volatile<_Tp>::value>,
+    integral_constant<size_t, sizeof(tuple_size<_Tp>)>>>
+    : public integral_constant<size_t, tuple_size<_Tp>::value> {};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS tuple_size<__enable_if_tuple_size_imp<
+    volatile _Tp,
+    __enable_if_t<!is_const<_Tp>::value>,
+    integral_constant<size_t, sizeof(tuple_size<_Tp>)>>>
+    : public integral_constant<size_t, tuple_size<_Tp>::value> {};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS tuple_size<__enable_if_tuple_size_imp<
+    const volatile _Tp,
+    integral_constant<size_t, sizeof(tuple_size<_Tp>)>>>
+    : public integral_constant<size_t, tuple_size<_Tp>::value> {};
+
+#else
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS tuple_size<const _Tp> : public tuple_size<_Tp> {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS tuple_size<volatile _Tp> : public tuple_size<_Tp> {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS tuple_size<const volatile _Tp> : public tuple_size<_Tp> {};
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class ..._Tp>
+struct _LIBCPP_TEMPLATE_VIS tuple_size<tuple<_Tp...> >
+    : public integral_constant<size_t, sizeof...(_Tp)>
+{
+};
+
+template <class ..._Tp>
+struct _LIBCPP_TEMPLATE_VIS tuple_size<__tuple_types<_Tp...> >
+    : public integral_constant<size_t, sizeof...(_Tp)>
+{
+};
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TUPLE_TUPLE_SIZE_H
diff --git a/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_types.h b/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_types.h
new file mode 100644
index 0000000..c5be81c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__tuple_dir/tuple_types.h
@@ -0,0 +1,24 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TUPLE_TUPLE_TYPES_H
+#define _LIBCPP___TUPLE_TUPLE_TYPES_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class ..._Tp> struct __tuple_types {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TUPLE_TUPLE_TYPES_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/add_const.h b/app/src/main/cpp/libcxx/include/__type_traits/add_const.h
new file mode 100644
index 0000000..c616a13
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/add_const.h
@@ -0,0 +1,30 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_ADD_CONST_H
+#define _LIBCPP___TYPE_TRAITS_ADD_CONST_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS add_const {
+  typedef _LIBCPP_NODEBUG const _Tp type;
+};
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using add_const_t = typename add_const<_Tp>::type;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_ADD_CONST_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/add_cv.h b/app/src/main/cpp/libcxx/include/__type_traits/add_cv.h
new file mode 100644
index 0000000..8a85353
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/add_cv.h
@@ -0,0 +1,30 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_ADD_CV_H
+#define _LIBCPP___TYPE_TRAITS_ADD_CV_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS add_cv {
+  typedef _LIBCPP_NODEBUG const volatile _Tp type;
+};
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using add_cv_t = typename add_cv<_Tp>::type;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_ADD_CV_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/add_lvalue_reference.h b/app/src/main/cpp/libcxx/include/__type_traits/add_lvalue_reference.h
new file mode 100644
index 0000000..daa5cb9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/add_lvalue_reference.h
@@ -0,0 +1,53 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_ADD_LVALUE_REFERENCE_H
+#define _LIBCPP___TYPE_TRAITS_ADD_LVALUE_REFERENCE_H
+
+#include <__config>
+#include <__type_traits/is_referenceable.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__add_lvalue_reference)
+
+template <class _Tp>
+using __add_lvalue_reference_t = __add_lvalue_reference(_Tp);
+
+#else
+
+template <class _Tp, bool = __libcpp_is_referenceable<_Tp>::value>
+struct __add_lvalue_reference_impl {
+  typedef _LIBCPP_NODEBUG _Tp type;
+};
+template <class _Tp >
+struct __add_lvalue_reference_impl<_Tp, true> {
+  typedef _LIBCPP_NODEBUG _Tp& type;
+};
+
+template <class _Tp>
+using __add_lvalue_reference_t = typename __add_lvalue_reference_impl<_Tp>::type;
+
+#endif // __has_builtin(__add_lvalue_reference)
+
+template <class _Tp>
+struct add_lvalue_reference {
+  using type _LIBCPP_NODEBUG = __add_lvalue_reference_t<_Tp>;
+};
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using add_lvalue_reference_t = __add_lvalue_reference_t<_Tp>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_ADD_LVALUE_REFERENCE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/add_pointer.h b/app/src/main/cpp/libcxx/include/__type_traits/add_pointer.h
new file mode 100644
index 0000000..9d0c201
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/add_pointer.h
@@ -0,0 +1,55 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_ADD_POINTER_H
+#define _LIBCPP___TYPE_TRAITS_ADD_POINTER_H
+
+#include <__config>
+#include <__type_traits/is_referenceable.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_void.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/remove_reference.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__add_pointer)
+
+template <class _Tp>
+using __add_pointer_t = __add_pointer(_Tp);
+
+#else
+template <class _Tp,
+          bool = __libcpp_is_referenceable<_Tp>::value || is_void<_Tp>::value>
+struct __add_pointer_impl {
+  typedef _LIBCPP_NODEBUG __libcpp_remove_reference_t<_Tp>* type;
+};
+template <class _Tp> struct __add_pointer_impl<_Tp, false>
+    {typedef _LIBCPP_NODEBUG _Tp type;};
+
+template <class _Tp>
+using __add_pointer_t = typename __add_pointer_impl<_Tp>::type;
+
+#endif // __has_builtin(__add_pointer)
+
+template <class _Tp>
+struct add_pointer {
+  using type _LIBCPP_NODEBUG = __add_pointer_t<_Tp>;
+};
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using add_pointer_t = __add_pointer_t<_Tp>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_ADD_POINTER_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/add_rvalue_reference.h b/app/src/main/cpp/libcxx/include/__type_traits/add_rvalue_reference.h
new file mode 100644
index 0000000..098e84c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/add_rvalue_reference.h
@@ -0,0 +1,54 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_ADD_RVALUE_REFERENCE_H
+#define _LIBCPP___TYPE_TRAITS_ADD_RVALUE_REFERENCE_H
+
+#include <__config>
+#include <__type_traits/is_referenceable.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__add_rvalue_reference)
+
+template <class _Tp>
+using __add_rvalue_reference_t = __add_rvalue_reference(_Tp);
+
+#else
+
+template <class _Tp, bool = __libcpp_is_referenceable<_Tp>::value>
+struct __add_rvalue_reference_impl {
+  typedef _LIBCPP_NODEBUG _Tp type;
+};
+template <class _Tp >
+struct __add_rvalue_reference_impl<_Tp, true> {
+  typedef _LIBCPP_NODEBUG _Tp&& type;
+};
+
+template <class _Tp>
+using __add_rvalue_reference_t = typename __add_rvalue_reference_impl<_Tp>::type;
+
+#endif // __has_builtin(__add_rvalue_reference)
+
+template <class _Tp>
+struct add_rvalue_reference {
+  using type = __add_rvalue_reference_t<_Tp>;
+};
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp>
+using add_rvalue_reference_t = __add_rvalue_reference_t<_Tp>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_ADD_RVALUE_REFERENCE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/add_volatile.h b/app/src/main/cpp/libcxx/include/__type_traits/add_volatile.h
new file mode 100644
index 0000000..73b1cb8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/add_volatile.h
@@ -0,0 +1,30 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_ADD_VOLATILE_H
+#define _LIBCPP___TYPE_TRAITS_ADD_VOLATILE_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS add_volatile {
+  typedef _LIBCPP_NODEBUG volatile _Tp type;
+};
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using add_volatile_t = typename add_volatile<_Tp>::type;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_ADD_VOLATILE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/aligned_storage.h b/app/src/main/cpp/libcxx/include/__type_traits/aligned_storage.h
new file mode 100644
index 0000000..c564d58
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/aligned_storage.h
@@ -0,0 +1,138 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_ALIGNED_STORAGE_H
+#define _LIBCPP___TYPE_TRAITS_ALIGNED_STORAGE_H
+
+#include <__config>
+#include <__type_traits/conditional.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/nat.h>
+#include <__type_traits/type_list.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct __align_type
+{
+    static const size_t value = _LIBCPP_PREFERRED_ALIGNOF(_Tp);
+    typedef _Tp type;
+};
+
+struct __struct_double {long double __lx;};
+struct __struct_double4 {double __lx[4];};
+
+typedef
+    __type_list<__align_type<unsigned char>,
+    __type_list<__align_type<unsigned short>,
+    __type_list<__align_type<unsigned int>,
+    __type_list<__align_type<unsigned long>,
+    __type_list<__align_type<unsigned long long>,
+    __type_list<__align_type<double>,
+    __type_list<__align_type<long double>,
+    __type_list<__align_type<__struct_double>,
+    __type_list<__align_type<__struct_double4>,
+    __type_list<__align_type<int*>,
+    __nat
+    > > > > > > > > > > __all_types;
+
+template <size_t _Align>
+struct _ALIGNAS(_Align) __fallback_overaligned {};
+
+template <class _TL, size_t _Align> struct __find_pod;
+
+template <class _Hp, size_t _Align>
+struct __find_pod<__type_list<_Hp, __nat>, _Align>
+{
+    typedef __conditional_t<_Align == _Hp::value, typename _Hp::type, __fallback_overaligned<_Align> > type;
+};
+
+template <class _Hp, class _Tp, size_t _Align>
+struct __find_pod<__type_list<_Hp, _Tp>, _Align>
+{
+    typedef __conditional_t<_Align == _Hp::value, typename _Hp::type, typename __find_pod<_Tp, _Align>::type> type;
+};
+
+template <class _TL, size_t _Len> struct __find_max_align;
+
+template <class _Hp, size_t _Len>
+struct __find_max_align<__type_list<_Hp, __nat>, _Len> : public integral_constant<size_t, _Hp::value> {};
+
+template <size_t _Len, size_t _A1, size_t _A2>
+struct __select_align
+{
+private:
+    static const size_t __min = _A2 < _A1 ? _A2 : _A1;
+    static const size_t __max = _A1 < _A2 ? _A2 : _A1;
+public:
+    static const size_t value = _Len < __max ? __min : __max;
+};
+
+template <class _Hp, class _Tp, size_t _Len>
+struct __find_max_align<__type_list<_Hp, _Tp>, _Len>
+    : public integral_constant<size_t, __select_align<_Len, _Hp::value, __find_max_align<_Tp, _Len>::value>::value> {};
+
+template <size_t _Len, size_t _Align = __find_max_align<__all_types, _Len>::value>
+struct _LIBCPP_DEPRECATED_IN_CXX23 _LIBCPP_TEMPLATE_VIS aligned_storage
+{
+    typedef typename __find_pod<__all_types, _Align>::type _Aligner;
+    union type
+    {
+        _Aligner __align;
+        unsigned char __data[(_Len + _Align - 1)/_Align * _Align];
+    };
+};
+
+#if _LIBCPP_STD_VER > 11
+
+  _LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <size_t _Len, size_t _Align = __find_max_align<__all_types, _Len>::value>
+    using aligned_storage_t _LIBCPP_DEPRECATED_IN_CXX23 = typename aligned_storage<_Len, _Align>::type;
+  _LIBCPP_SUPPRESS_DEPRECATED_POP
+
+#endif
+
+#define _CREATE_ALIGNED_STORAGE_SPECIALIZATION(n) \
+template <size_t _Len>\
+struct _LIBCPP_DEPRECATED_IN_CXX23 _LIBCPP_TEMPLATE_VIS aligned_storage<_Len, n>\
+{\
+    struct _ALIGNAS(n) type\
+    {\
+        unsigned char __lx[(_Len + n - 1)/n * n];\
+    };\
+}
+
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x1);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x2);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x4);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x8);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x10);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x20);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x40);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x80);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x100);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x200);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x400);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x800);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x1000);
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x2000);
+// PE/COFF does not support alignment beyond 8192 (=0x2000)
+#if !defined(_LIBCPP_OBJECT_FORMAT_COFF)
+_CREATE_ALIGNED_STORAGE_SPECIALIZATION(0x4000);
+#endif // !defined(_LIBCPP_OBJECT_FORMAT_COFF)
+
+#undef _CREATE_ALIGNED_STORAGE_SPECIALIZATION
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_ALIGNED_STORAGE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/aligned_union.h b/app/src/main/cpp/libcxx/include/__type_traits/aligned_union.h
new file mode 100644
index 0000000..2c64130
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/aligned_union.h
@@ -0,0 +1,56 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_ALIGNED_UNION_H
+#define _LIBCPP___TYPE_TRAITS_ALIGNED_UNION_H
+
+#include <__config>
+#include <__type_traits/aligned_storage.h>
+#include <__type_traits/integral_constant.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <size_t _I0, size_t ..._In>
+struct __static_max;
+
+template <size_t _I0>
+struct __static_max<_I0>
+{
+    static const size_t value = _I0;
+};
+
+template <size_t _I0, size_t _I1, size_t ..._In>
+struct __static_max<_I0, _I1, _In...>
+{
+    static const size_t value = _I0 >= _I1 ? __static_max<_I0, _In...>::value :
+                                             __static_max<_I1, _In...>::value;
+};
+
+template <size_t _Len, class _Type0, class ..._Types>
+struct _LIBCPP_DEPRECATED_IN_CXX23 aligned_union
+{
+    static const size_t alignment_value = __static_max<_LIBCPP_PREFERRED_ALIGNOF(_Type0),
+                                                       _LIBCPP_PREFERRED_ALIGNOF(_Types)...>::value;
+    static const size_t __len = __static_max<_Len, sizeof(_Type0),
+                                             sizeof(_Types)...>::value;
+    typedef typename aligned_storage<__len, alignment_value>::type type;
+};
+
+#if _LIBCPP_STD_VER > 11
+template <size_t _Len, class... _Types>
+using aligned_union_t _LIBCPP_DEPRECATED_IN_CXX23 = typename aligned_union<_Len, _Types...>::type;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_ALIGNED_UNION_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/alignment_of.h b/app/src/main/cpp/libcxx/include/__type_traits/alignment_of.h
new file mode 100644
index 0000000..45b4cbc
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/alignment_of.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_ALIGNMENT_OF_H
+#define _LIBCPP___TYPE_TRAITS_ALIGNMENT_OF_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS alignment_of
+    : public integral_constant<size_t, _LIBCPP_ALIGNOF(_Tp)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr size_t alignment_of_v = _LIBCPP_ALIGNOF(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_ALIGNMENT_OF_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/apply_cv.h b/app/src/main/cpp/libcxx/include/__type_traits/apply_cv.h
new file mode 100644
index 0000000..680ff6a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/apply_cv.h
@@ -0,0 +1,75 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_APPLY_CV_H
+#define _LIBCPP___TYPE_TRAITS_APPLY_CV_H
+
+#include <__config>
+#include <__type_traits/is_const.h>
+#include <__type_traits/is_volatile.h>
+#include <__type_traits/remove_reference.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _Up, bool = is_const<__libcpp_remove_reference_t<_Tp> >::value,
+                             bool = is_volatile<__libcpp_remove_reference_t<_Tp> >::value>
+struct __apply_cv
+{
+    typedef _LIBCPP_NODEBUG _Up type;
+};
+
+template <class _Tp, class _Up>
+struct __apply_cv<_Tp, _Up, true, false>
+{
+    typedef _LIBCPP_NODEBUG const _Up type;
+};
+
+template <class _Tp, class _Up>
+struct __apply_cv<_Tp, _Up, false, true>
+{
+    typedef volatile _Up type;
+};
+
+template <class _Tp, class _Up>
+struct __apply_cv<_Tp, _Up, true, true>
+{
+    typedef const volatile _Up type;
+};
+
+template <class _Tp, class _Up>
+struct __apply_cv<_Tp&, _Up, false, false>
+{
+    typedef _Up& type;
+};
+
+template <class _Tp, class _Up>
+struct __apply_cv<_Tp&, _Up, true, false>
+{
+    typedef const _Up& type;
+};
+
+template <class _Tp, class _Up>
+struct __apply_cv<_Tp&, _Up, false, true>
+{
+    typedef volatile _Up& type;
+};
+
+template <class _Tp, class _Up>
+struct __apply_cv<_Tp&, _Up, true, true>
+{
+    typedef const volatile _Up& type;
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_APPLY_CV_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/can_extract_key.h b/app/src/main/cpp/libcxx/include/__type_traits/can_extract_key.h
new file mode 100644
index 0000000..454c56b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/can_extract_key.h
@@ -0,0 +1,56 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_CAN_EXTRACT_KEY_H
+#define _LIBCPP___TYPE_TRAITS_CAN_EXTRACT_KEY_H
+
+#include <__config>
+#include <__fwd/pair.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/remove_const.h>
+#include <__type_traits/remove_const_ref.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// These traits are used in __tree and __hash_table
+struct __extract_key_fail_tag {};
+struct __extract_key_self_tag {};
+struct __extract_key_first_tag {};
+
+template <class _ValTy, class _Key, class _RawValTy = __remove_const_ref_t<_ValTy> >
+struct __can_extract_key
+    : __conditional_t<_IsSame<_RawValTy, _Key>::value, __extract_key_self_tag, __extract_key_fail_tag> {};
+
+template <class _Pair, class _Key, class _First, class _Second>
+struct __can_extract_key<_Pair, _Key, pair<_First, _Second> >
+    : __conditional_t<_IsSame<__remove_const_t<_First>, _Key>::value, __extract_key_first_tag, __extract_key_fail_tag> {
+};
+
+// __can_extract_map_key uses true_type/false_type instead of the tags.
+// It returns true if _Key != _ContainerValueTy (the container is a map not a set)
+// and _ValTy == _Key.
+template <class _ValTy, class _Key, class _ContainerValueTy,
+          class _RawValTy = __remove_const_ref_t<_ValTy> >
+struct __can_extract_map_key
+    : integral_constant<bool, _IsSame<_RawValTy, _Key>::value> {};
+
+// This specialization returns __extract_key_fail_tag for non-map containers
+// because _Key == _ContainerValueTy
+template <class _ValTy, class _Key, class _RawValTy>
+struct __can_extract_map_key<_ValTy, _Key, _Key, _RawValTy>
+    : false_type {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_CAN_EXTRACT_KEY_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/common_reference.h b/app/src/main/cpp/libcxx/include/__type_traits/common_reference.h
new file mode 100644
index 0000000..f919586
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/common_reference.h
@@ -0,0 +1,188 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_COMMON_REFERENCE_H
+#define _LIBCPP___TYPE_TRAITS_COMMON_REFERENCE_H
+
+#include <__config>
+#include <__type_traits/common_type.h>
+#include <__type_traits/copy_cv.h>
+#include <__type_traits/copy_cvref.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/remove_cvref.h>
+#include <__type_traits/remove_reference.h>
+#include <__utility/declval.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// common_reference
+#if _LIBCPP_STD_VER > 17
+// Let COND_RES(X, Y) be:
+template <class _Xp, class _Yp>
+using __cond_res =
+    decltype(false ? std::declval<_Xp(&)()>()() : std::declval<_Yp(&)()>()());
+
+// Let `XREF(A)` denote a unary alias template `T` such that `T<U>` denotes the same type as `U`
+// with the addition of `A`'s cv and reference qualifiers, for a non-reference cv-unqualified type
+// `U`.
+// [Note: `XREF(A)` is `__xref<A>::template __apply`]
+template <class _Tp>
+struct __xref {
+  template<class _Up>
+  using __apply = __copy_cvref_t<_Tp, _Up>;
+};
+
+// Given types A and B, let X be remove_reference_t<A>, let Y be remove_reference_t<B>,
+// and let COMMON-REF(A, B) be:
+template<class _Ap, class _Bp, class _Xp = remove_reference_t<_Ap>, class _Yp = remove_reference_t<_Bp>>
+struct __common_ref;
+
+template<class _Xp, class _Yp>
+using __common_ref_t = typename __common_ref<_Xp, _Yp>::__type;
+
+template<class _Xp, class _Yp>
+using __cv_cond_res = __cond_res<__copy_cv_t<_Xp, _Yp>&, __copy_cv_t<_Yp, _Xp>&>;
+
+
+//    If A and B are both lvalue reference types, COMMON-REF(A, B) is
+//    COND-RES(COPYCV(X, Y)&, COPYCV(Y, X)&) if that type exists and is a reference type.
+template<class _Ap, class _Bp, class _Xp, class _Yp>
+requires requires { typename __cv_cond_res<_Xp, _Yp>; } && is_reference_v<__cv_cond_res<_Xp, _Yp>>
+struct __common_ref<_Ap&, _Bp&, _Xp, _Yp>
+{
+    using __type = __cv_cond_res<_Xp, _Yp>;
+};
+
+//    Otherwise, let C be remove_reference_t<COMMON-REF(X&, Y&)>&&. ...
+template <class _Xp, class _Yp>
+using __common_ref_C = remove_reference_t<__common_ref_t<_Xp&, _Yp&>>&&;
+
+
+//    .... If A and B are both rvalue reference types, C is well-formed, and
+//    is_convertible_v<A, C> && is_convertible_v<B, C> is true, then COMMON-REF(A, B) is C.
+template<class _Ap, class _Bp, class _Xp, class _Yp>
+requires
+  requires { typename __common_ref_C<_Xp, _Yp>; } &&
+  is_convertible_v<_Ap&&, __common_ref_C<_Xp, _Yp>> &&
+  is_convertible_v<_Bp&&, __common_ref_C<_Xp, _Yp>>
+struct __common_ref<_Ap&&, _Bp&&, _Xp, _Yp>
+{
+    using __type = __common_ref_C<_Xp, _Yp>;
+};
+
+//    Otherwise, let D be COMMON-REF(const X&, Y&). ...
+template <class _Tp, class _Up>
+using __common_ref_D = __common_ref_t<const _Tp&, _Up&>;
+
+//    ... If A is an rvalue reference and B is an lvalue reference and D is well-formed and
+//    is_convertible_v<A, D> is true, then COMMON-REF(A, B) is D.
+template<class _Ap, class _Bp, class _Xp, class _Yp>
+requires requires { typename __common_ref_D<_Xp, _Yp>; } &&
+         is_convertible_v<_Ap&&, __common_ref_D<_Xp, _Yp>>
+struct __common_ref<_Ap&&, _Bp&, _Xp, _Yp>
+{
+    using __type = __common_ref_D<_Xp, _Yp>;
+};
+
+//    Otherwise, if A is an lvalue reference and B is an rvalue reference, then
+//    COMMON-REF(A, B) is COMMON-REF(B, A).
+template<class _Ap, class _Bp, class _Xp, class _Yp>
+struct __common_ref<_Ap&, _Bp&&, _Xp, _Yp> : __common_ref<_Bp&&, _Ap&> {};
+
+//    Otherwise, COMMON-REF(A, B) is ill-formed.
+template<class _Ap, class _Bp, class _Xp, class _Yp>
+struct __common_ref {};
+
+// Note C: For the common_reference trait applied to a parameter pack [...]
+
+template <class...>
+struct common_reference;
+
+template <class... _Types>
+using common_reference_t = typename common_reference<_Types...>::type;
+
+// bullet 1 - sizeof...(T) == 0
+template<>
+struct common_reference<> {};
+
+// bullet 2 - sizeof...(T) == 1
+template <class _Tp>
+struct common_reference<_Tp>
+{
+    using type = _Tp;
+};
+
+// bullet 3 - sizeof...(T) == 2
+template <class _Tp, class _Up> struct __common_reference_sub_bullet3;
+template <class _Tp, class _Up> struct __common_reference_sub_bullet2 : __common_reference_sub_bullet3<_Tp, _Up> {};
+template <class _Tp, class _Up> struct __common_reference_sub_bullet1 : __common_reference_sub_bullet2<_Tp, _Up> {};
+
+// sub-bullet 1 - If T1 and T2 are reference types and COMMON-REF(T1, T2) is well-formed, then
+// the member typedef `type` denotes that type.
+template <class _Tp, class _Up> struct common_reference<_Tp, _Up> : __common_reference_sub_bullet1<_Tp, _Up> {};
+
+template <class _Tp, class _Up>
+requires is_reference_v<_Tp> && is_reference_v<_Up> && requires { typename __common_ref_t<_Tp, _Up>; }
+struct __common_reference_sub_bullet1<_Tp, _Up>
+{
+    using type = __common_ref_t<_Tp, _Up>;
+};
+
+// sub-bullet 2 - Otherwise, if basic_common_reference<remove_cvref_t<T1>, remove_cvref_t<T2>, XREF(T1), XREF(T2)>::type
+// is well-formed, then the member typedef `type` denotes that type.
+template <class, class, template <class> class, template <class> class> struct basic_common_reference {};
+
+template <class _Tp, class _Up>
+using __basic_common_reference_t = typename basic_common_reference<
+    remove_cvref_t<_Tp>, remove_cvref_t<_Up>,
+    __xref<_Tp>::template __apply, __xref<_Up>::template __apply>::type;
+
+template <class _Tp, class _Up>
+requires requires { typename __basic_common_reference_t<_Tp, _Up>; }
+struct __common_reference_sub_bullet2<_Tp, _Up>
+{
+    using type = __basic_common_reference_t<_Tp, _Up>;
+};
+
+// sub-bullet 3 - Otherwise, if COND-RES(T1, T2) is well-formed,
+// then the member typedef `type` denotes that type.
+template <class _Tp, class _Up>
+requires requires { typename __cond_res<_Tp, _Up>; }
+struct __common_reference_sub_bullet3<_Tp, _Up>
+{
+    using type = __cond_res<_Tp, _Up>;
+};
+
+
+// sub-bullet 4 & 5 - Otherwise, if common_type_t<T1, T2> is well-formed,
+//                    then the member typedef `type` denotes that type.
+//                  - Otherwise, there shall be no member `type`.
+template <class _Tp, class _Up> struct __common_reference_sub_bullet3 : common_type<_Tp, _Up> {};
+
+// bullet 4 - If there is such a type `C`, the member typedef type shall denote the same type, if
+//            any, as `common_reference_t<C, Rest...>`.
+template <class _Tp, class _Up, class _Vp, class... _Rest>
+requires requires { typename common_reference_t<_Tp, _Up>; }
+struct common_reference<_Tp, _Up, _Vp, _Rest...>
+    : common_reference<common_reference_t<_Tp, _Up>, _Vp, _Rest...>
+{};
+
+// bullet 5 - Otherwise, there shall be no member `type`.
+template <class...> struct common_reference {};
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_COMMON_REFERENCE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/common_type.h b/app/src/main/cpp/libcxx/include/__type_traits/common_type.h
new file mode 100644
index 0000000..6d2df6c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/common_type.h
@@ -0,0 +1,134 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_COMMON_TYPE_H
+#define _LIBCPP___TYPE_TRAITS_COMMON_TYPE_H
+
+#include <__config>
+#include <__type_traits/conditional.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/remove_cvref.h>
+#include <__type_traits/void_t.h>
+#include <__utility/declval.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+// Let COND_RES(X, Y) be:
+template <class _Tp, class _Up>
+using __cond_type = decltype(false ? std::declval<_Tp>() : std::declval<_Up>());
+
+template <class _Tp, class _Up, class = void>
+struct __common_type3 {};
+
+// sub-bullet 4 - "if COND_RES(CREF(D1), CREF(D2)) denotes a type..."
+template <class _Tp, class _Up>
+struct __common_type3<_Tp, _Up, void_t<__cond_type<const _Tp&, const _Up&>>>
+{
+    using type = remove_cvref_t<__cond_type<const _Tp&, const _Up&>>;
+};
+
+template <class _Tp, class _Up, class = void>
+struct __common_type2_imp : __common_type3<_Tp, _Up> {};
+#else
+template <class _Tp, class _Up, class = void>
+struct __common_type2_imp {};
+#endif
+
+// sub-bullet 3 - "if decay_t<decltype(false ? declval<D1>() : declval<D2>())> ..."
+template <class _Tp, class _Up>
+struct __common_type2_imp<_Tp, _Up, __void_t<decltype(true ? std::declval<_Tp>() : std::declval<_Up>())> >
+{
+  typedef _LIBCPP_NODEBUG typename decay<decltype(
+                         true ? std::declval<_Tp>() : std::declval<_Up>()
+                         )>::type type;
+};
+
+template <class, class = void>
+struct __common_type_impl {};
+
+// Clang provides variadic templates in C++03 as an extension.
+#if !defined(_LIBCPP_CXX03_LANG) || defined(__clang__)
+# define _LIBCPP_OPTIONAL_PACK(...) , __VA_ARGS__
+template <class... _Tp>
+struct __common_types;
+template <class... _Tp>
+struct _LIBCPP_TEMPLATE_VIS common_type;
+#else
+# define _LIBCPP_OPTIONAL_PACK(...)
+struct __no_arg;
+template <class _Tp, class _Up, class = __no_arg>
+struct __common_types;
+template <class _Tp = __no_arg, class _Up = __no_arg, class _Vp = __no_arg,
+          class _Unused = __no_arg>
+struct common_type {
+  static_assert(sizeof(_Unused) == 0,
+                "common_type accepts at most 3 arguments in C++03");
+};
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Up>
+struct __common_type_impl<
+    __common_types<_Tp, _Up>, __void_t<typename common_type<_Tp, _Up>::type> >
+{
+  typedef typename common_type<_Tp, _Up>::type type;
+};
+
+template <class _Tp, class _Up, class _Vp _LIBCPP_OPTIONAL_PACK(class... _Rest)>
+struct __common_type_impl<
+    __common_types<_Tp, _Up, _Vp _LIBCPP_OPTIONAL_PACK(_Rest...)>,
+    __void_t<typename common_type<_Tp, _Up>::type> >
+    : __common_type_impl<__common_types<typename common_type<_Tp, _Up>::type,
+                                        _Vp _LIBCPP_OPTIONAL_PACK(_Rest...)> > {
+};
+
+// bullet 1 - sizeof...(Tp) == 0
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS common_type<> {};
+
+// bullet 2 - sizeof...(Tp) == 1
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS common_type<_Tp>
+    : public common_type<_Tp, _Tp> {};
+
+// bullet 3 - sizeof...(Tp) == 2
+
+// sub-bullet 1 - "If is_same_v<T1, D1> is false or ..."
+template <class _Tp, class _Up>
+struct _LIBCPP_TEMPLATE_VIS common_type<_Tp, _Up>
+    : conditional<
+        _IsSame<_Tp, typename decay<_Tp>::type>::value && _IsSame<_Up, typename decay<_Up>::type>::value,
+        __common_type2_imp<_Tp, _Up>,
+        common_type<typename decay<_Tp>::type, typename decay<_Up>::type>
+    >::type
+{};
+
+// bullet 4 - sizeof...(Tp) > 2
+
+template <class _Tp, class _Up, class _Vp _LIBCPP_OPTIONAL_PACK(class... _Rest)>
+struct _LIBCPP_TEMPLATE_VIS
+    common_type<_Tp, _Up, _Vp _LIBCPP_OPTIONAL_PACK(_Rest...)>
+    : __common_type_impl<
+          __common_types<_Tp, _Up, _Vp _LIBCPP_OPTIONAL_PACK(_Rest...)> > {};
+
+#undef _LIBCPP_OPTIONAL_PACK
+
+#if _LIBCPP_STD_VER > 11
+template <class ..._Tp> using common_type_t = typename common_type<_Tp...>::type;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_COMMON_TYPE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/conditional.h b/app/src/main/cpp/libcxx/include/__type_traits/conditional.h
new file mode 100644
index 0000000..6249812
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/conditional.h
@@ -0,0 +1,58 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_CONDITIONAL_H
+#define _LIBCPP___TYPE_TRAITS_CONDITIONAL_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <bool>
+struct _IfImpl;
+
+template <>
+struct _IfImpl<true> {
+  template <class _IfRes, class _ElseRes>
+  using _Select _LIBCPP_NODEBUG = _IfRes;
+};
+
+template <>
+struct _IfImpl<false> {
+  template <class _IfRes, class _ElseRes>
+  using _Select _LIBCPP_NODEBUG = _ElseRes;
+};
+
+template <bool _Cond, class _IfRes, class _ElseRes>
+using _If _LIBCPP_NODEBUG = typename _IfImpl<_Cond>::template _Select<_IfRes, _ElseRes>;
+
+template <bool _Bp, class _If, class _Then>
+struct _LIBCPP_TEMPLATE_VIS conditional {
+  using type _LIBCPP_NODEBUG = _If;
+};
+template <class _If, class _Then>
+struct _LIBCPP_TEMPLATE_VIS conditional<false, _If, _Then> {
+  using type _LIBCPP_NODEBUG = _Then;
+};
+
+#if _LIBCPP_STD_VER > 11
+template <bool _Bp, class _IfRes, class _ElseRes>
+using conditional_t _LIBCPP_NODEBUG = typename conditional<_Bp, _IfRes, _ElseRes>::type;
+#endif
+
+// Helper so we can use "conditional_t" in all language versions.
+template <bool _Bp, class _If, class _Then>
+using __conditional_t _LIBCPP_NODEBUG = typename conditional<_Bp, _If, _Then>::type;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_CONDITIONAL_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/conjunction.h b/app/src/main/cpp/libcxx/include/__type_traits/conjunction.h
new file mode 100644
index 0000000..0d95347
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/conjunction.h
@@ -0,0 +1,58 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_CONJUNCTION_H
+#define _LIBCPP___TYPE_TRAITS_CONJUNCTION_H
+
+#include <__config>
+#include <__type_traits/conditional.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class...>
+using __expand_to_true = true_type;
+
+template <class... _Pred>
+__expand_to_true<__enable_if_t<_Pred::value>...> __and_helper(int);
+
+template <class...>
+false_type __and_helper(...);
+
+// _And always performs lazy evaluation of its arguments.
+//
+// However, `_And<_Pred...>` itself will evaluate its result immediately (without having to
+// be instantiated) since it is an alias, unlike `conjunction<_Pred...>`, which is a struct.
+// If you want to defer the evaluation of `_And<_Pred...>` itself, use `_Lazy<_And, _Pred...>`.
+template <class... _Pred>
+using _And _LIBCPP_NODEBUG = decltype(std::__and_helper<_Pred...>(0));
+
+#if _LIBCPP_STD_VER > 14
+
+template <class...>
+struct conjunction : true_type {};
+
+template <class _Arg>
+struct conjunction<_Arg> : _Arg {};
+
+template <class _Arg, class... _Args>
+struct conjunction<_Arg, _Args...> : conditional_t<!bool(_Arg::value), _Arg, conjunction<_Args...>> {};
+
+template <class... _Args>
+inline constexpr bool conjunction_v = conjunction<_Args...>::value;
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_CONJUNCTION_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/copy_cv.h b/app/src/main/cpp/libcxx/include/__type_traits/copy_cv.h
new file mode 100644
index 0000000..8e9bfe0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/copy_cv.h
@@ -0,0 +1,54 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_COPY_CV_H
+#define _LIBCPP___TYPE_TRAITS_COPY_CV_H
+
+#include <__config>
+#include <__type_traits/add_const.h>
+#include <__type_traits/add_cv.h>
+#include <__type_traits/add_volatile.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Let COPYCV(FROM, TO) be an alias for type TO with the addition of FROM's
+// top-level cv-qualifiers.
+template <class _From, class _To>
+struct __copy_cv
+{
+    using type = _To;
+};
+
+template <class _From, class _To>
+struct __copy_cv<const _From, _To>
+{
+    using type = typename add_const<_To>::type;
+};
+
+template <class _From, class _To>
+struct __copy_cv<volatile _From, _To>
+{
+    using type = typename add_volatile<_To>::type;
+};
+
+template <class _From, class _To>
+struct __copy_cv<const volatile _From, _To>
+{
+    using type = typename add_cv<_To>::type;
+};
+
+template <class _From, class _To>
+using __copy_cv_t = typename __copy_cv<_From, _To>::type;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_COPY_CV_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/copy_cvref.h b/app/src/main/cpp/libcxx/include/__type_traits/copy_cvref.h
new file mode 100644
index 0000000..8ec59b9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/copy_cvref.h
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_COPY_CVREF_H
+#define _LIBCPP___TYPE_TRAITS_COPY_CVREF_H
+
+#include <__config>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/add_rvalue_reference.h>
+#include <__type_traits/copy_cv.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _From, class _To>
+struct __copy_cvref
+{
+    using type = __copy_cv_t<_From, _To>;
+};
+
+template <class _From, class _To>
+struct __copy_cvref<_From&, _To>
+{
+    using type = __add_lvalue_reference_t<__copy_cv_t<_From, _To> >;
+};
+
+template <class _From, class _To>
+struct __copy_cvref<_From&&, _To>
+{
+    using type = __add_rvalue_reference_t<__copy_cv_t<_From, _To> >;
+};
+
+template <class _From, class _To>
+using __copy_cvref_t = typename __copy_cvref<_From, _To>::type;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_COPY_CVREF_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/decay.h b/app/src/main/cpp/libcxx/include/__type_traits/decay.h
new file mode 100644
index 0000000..f45d33b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/decay.h
@@ -0,0 +1,71 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_DECAY_H
+#define _LIBCPP___TYPE_TRAITS_DECAY_H
+
+#include <__config>
+#include <__type_traits/add_pointer.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/is_array.h>
+#include <__type_traits/is_function.h>
+#include <__type_traits/is_referenceable.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/remove_extent.h>
+#include <__type_traits/remove_reference.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__decay)
+template <class _Tp>
+struct decay {
+  using type _LIBCPP_NODEBUG = __decay(_Tp);
+};
+#else
+template <class _Up, bool>
+struct __decay {
+    typedef _LIBCPP_NODEBUG __remove_cv_t<_Up> type;
+};
+
+template <class _Up>
+struct __decay<_Up, true> {
+public:
+    typedef _LIBCPP_NODEBUG typename conditional
+                     <
+                         is_array<_Up>::value,
+                         __add_pointer_t<__remove_extent_t<_Up> >,
+                         typename conditional
+                         <
+                              is_function<_Up>::value,
+                              typename add_pointer<_Up>::type,
+                              __remove_cv_t<_Up>
+                         >::type
+                     >::type type;
+};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS decay
+{
+private:
+    typedef _LIBCPP_NODEBUG __libcpp_remove_reference_t<_Tp> _Up;
+public:
+  typedef _LIBCPP_NODEBUG typename __decay<_Up, __libcpp_is_referenceable<_Up>::value>::type type;
+};
+#endif // __has_builtin(__decay)
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using decay_t = typename decay<_Tp>::type;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_DECAY_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/dependent_type.h b/app/src/main/cpp/libcxx/include/__type_traits/dependent_type.h
new file mode 100644
index 0000000..db8a869
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/dependent_type.h
@@ -0,0 +1,25 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_DEPENDENT_TYPE_H
+#define _LIBCPP___TYPE_TRAITS_DEPENDENT_TYPE_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, bool>
+struct _LIBCPP_TEMPLATE_VIS __dependent_type : public _Tp {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_DEPENDENT_TYPE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/disjunction.h b/app/src/main/cpp/libcxx/include/__type_traits/disjunction.h
new file mode 100644
index 0000000..125f168
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/disjunction.h
@@ -0,0 +1,58 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_DISJUNCTION_H
+#define _LIBCPP___TYPE_TRAITS_DISJUNCTION_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <bool>
+struct _OrImpl;
+
+template <>
+struct _OrImpl<true> {
+  template <class _Res, class _First, class... _Rest>
+  using _Result _LIBCPP_NODEBUG =
+      typename _OrImpl<!bool(_First::value) && sizeof...(_Rest) != 0>::template _Result<_First, _Rest...>;
+};
+
+template <>
+struct _OrImpl<false> {
+  template <class _Res, class...>
+  using _Result = _Res;
+};
+
+// _Or always performs lazy evaluation of its arguments.
+//
+// However, `_Or<_Pred...>` itself will evaluate its result immediately (without having to
+// be instantiated) since it is an alias, unlike `disjunction<_Pred...>`, which is a struct.
+// If you want to defer the evaluation of `_Or<_Pred...>` itself, use `_Lazy<_Or, _Pred...>`
+// or `disjunction<_Pred...>` directly.
+template <class... _Args>
+using _Or _LIBCPP_NODEBUG = typename _OrImpl<sizeof...(_Args) != 0>::template _Result<false_type, _Args...>;
+
+#if _LIBCPP_STD_VER > 14
+
+template <class... _Args>
+struct disjunction : _Or<_Args...> {};
+
+template <class... _Args>
+inline constexpr bool disjunction_v = _Or<_Args...>::value;
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_DISJUNCTION_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/enable_if.h b/app/src/main/cpp/libcxx/include/__type_traits/enable_if.h
new file mode 100644
index 0000000..c5e8df4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/enable_if.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_ENABLE_IF_H
+#define _LIBCPP___TYPE_TRAITS_ENABLE_IF_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <bool, class _Tp = void> struct _LIBCPP_TEMPLATE_VIS enable_if {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS enable_if<true, _Tp> {typedef _Tp type;};
+
+template <bool _Bp, class _Tp = void> using __enable_if_t _LIBCPP_NODEBUG = typename enable_if<_Bp, _Tp>::type;
+
+#if _LIBCPP_STD_VER > 11
+template <bool _Bp, class _Tp = void> using enable_if_t = typename enable_if<_Bp, _Tp>::type;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_ENABLE_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/extent.h b/app/src/main/cpp/libcxx/include/__type_traits/extent.h
new file mode 100644
index 0000000..0a4d84e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/extent.h
@@ -0,0 +1,55 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_EXTENT_H
+#define _LIBCPP___TYPE_TRAITS_EXTENT_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__array_extent)
+
+template<class _Tp, size_t _Dim = 0>
+struct _LIBCPP_TEMPLATE_VIS extent
+    : integral_constant<size_t, __array_extent(_Tp, _Dim)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp, unsigned _Ip = 0>
+inline constexpr size_t extent_v = __array_extent(_Tp, _Ip);
+#endif
+
+#else // __has_builtin(__array_extent)
+
+template <class _Tp, unsigned _Ip = 0> struct _LIBCPP_TEMPLATE_VIS extent
+    : public integral_constant<size_t, 0> {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS extent<_Tp[], 0>
+    : public integral_constant<size_t, 0> {};
+template <class _Tp, unsigned _Ip> struct _LIBCPP_TEMPLATE_VIS extent<_Tp[], _Ip>
+    : public integral_constant<size_t, extent<_Tp, _Ip-1>::value> {};
+template <class _Tp, size_t _Np> struct _LIBCPP_TEMPLATE_VIS extent<_Tp[_Np], 0>
+    : public integral_constant<size_t, _Np> {};
+template <class _Tp, size_t _Np, unsigned _Ip> struct _LIBCPP_TEMPLATE_VIS extent<_Tp[_Np], _Ip>
+    : public integral_constant<size_t, extent<_Tp, _Ip-1>::value> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp, unsigned _Ip = 0>
+inline constexpr size_t extent_v = extent<_Tp, _Ip>::value;
+#endif
+
+#endif // __has_builtin(__array_extent)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_EXTENT_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/has_unique_object_representation.h b/app/src/main/cpp/libcxx/include/__type_traits/has_unique_object_representation.h
new file mode 100644
index 0000000..d6f75c9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/has_unique_object_representation.h
@@ -0,0 +1,36 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_HAS_UNIQUE_OBJECT_REPRESENTATION_H
+#define _LIBCPP___TYPE_TRAITS_HAS_UNIQUE_OBJECT_REPRESENTATION_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/remove_all_extents.h>
+#include <__type_traits/remove_cv.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS has_unique_object_representations
+    : public integral_constant<bool,
+       __has_unique_object_representations(remove_cv_t<remove_all_extents_t<_Tp>>)> {};
+
+template <class _Tp>
+inline constexpr bool has_unique_object_representations_v = has_unique_object_representations<_Tp>::value;
+
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_HAS_UNIQUE_OBJECT_REPRESENTATION_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/has_virtual_destructor.h b/app/src/main/cpp/libcxx/include/__type_traits/has_virtual_destructor.h
new file mode 100644
index 0000000..e73a2b2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/has_virtual_destructor.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_HAS_VIRTUAL_DESTRUCTOR_H
+#define _LIBCPP___TYPE_TRAITS_HAS_VIRTUAL_DESTRUCTOR_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS has_virtual_destructor
+    : public integral_constant<bool, __has_virtual_destructor(_Tp)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool has_virtual_destructor_v = __has_virtual_destructor(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_HAS_VIRTUAL_DESTRUCTOR_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/integral_constant.h b/app/src/main/cpp/libcxx/include/__type_traits/integral_constant.h
new file mode 100644
index 0000000..2449d1a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/integral_constant.h
@@ -0,0 +1,50 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_INTEGRAL_CONSTANT_H
+#define _LIBCPP___TYPE_TRAITS_INTEGRAL_CONSTANT_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, _Tp __v>
+struct _LIBCPP_TEMPLATE_VIS integral_constant
+{
+  static _LIBCPP_CONSTEXPR const _Tp      value = __v;
+  typedef _Tp               value_type;
+  typedef integral_constant type;
+  _LIBCPP_INLINE_VISIBILITY
+  _LIBCPP_CONSTEXPR operator value_type() const _NOEXCEPT {return value;}
+#if _LIBCPP_STD_VER > 11
+  _LIBCPP_INLINE_VISIBILITY
+  constexpr value_type operator ()() const _NOEXCEPT {return value;}
+#endif
+};
+
+template <class _Tp, _Tp __v>
+_LIBCPP_CONSTEXPR const _Tp integral_constant<_Tp, __v>::value;
+
+typedef integral_constant<bool, true>  true_type;
+typedef integral_constant<bool, false> false_type;
+
+template <bool _Val>
+using _BoolConstant _LIBCPP_NODEBUG = integral_constant<bool, _Val>;
+
+#if _LIBCPP_STD_VER > 14
+template <bool __b>
+using bool_constant = integral_constant<bool, __b>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_INTEGRAL_CONSTANT_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_abstract.h b/app/src/main/cpp/libcxx/include/__type_traits/is_abstract.h
new file mode 100644
index 0000000..c74b328
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_abstract.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_ABSTRACT_H
+#define _LIBCPP___TYPE_TRAITS_IS_ABSTRACT_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_abstract
+    : public integral_constant<bool, __is_abstract(_Tp)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_abstract_v = __is_abstract(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_ABSTRACT_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_aggregate.h b/app/src/main/cpp/libcxx/include/__type_traits/is_aggregate.h
new file mode 100644
index 0000000..ea9de84
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_aggregate.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_AGGREGATE_H
+#define _LIBCPP___TYPE_TRAITS_IS_AGGREGATE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS
+is_aggregate : public integral_constant<bool, __is_aggregate(_Tp)> {};
+
+template <class _Tp>
+inline constexpr bool is_aggregate_v = __is_aggregate(_Tp);
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_AGGREGATE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_allocator.h b/app/src/main/cpp/libcxx/include/__type_traits/is_allocator.h
new file mode 100644
index 0000000..ee4154d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_allocator.h
@@ -0,0 +1,36 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_IS_ALLOCATOR_H
+#define _LIBCPP___TYPE_IS_ALLOCATOR_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/void_t.h>
+#include <__utility/declval.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<typename _Alloc, typename = void, typename = void>
+struct __is_allocator : false_type {};
+
+template<typename _Alloc>
+struct __is_allocator<_Alloc,
+       __void_t<typename _Alloc::value_type>,
+       __void_t<decltype(std::declval<_Alloc&>().allocate(size_t(0)))>
+     >
+   : true_type {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_IS_ALLOCATOR_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_always_bitcastable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_always_bitcastable.h
new file mode 100644
index 0000000..63304eb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_always_bitcastable.h
@@ -0,0 +1,82 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_ALWAYS_BITCASTABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_ALWAYS_BITCASTABLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_integral.h>
+#include <__type_traits/is_object.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_trivially_copyable.h>
+#include <__type_traits/remove_cv.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Checks whether an object of type `From` can always be bit-cast to an object of type `To` and represent a valid value
+// of type `To`. In other words, `From` and `To` have the same value representation and the set of values of `From` is
+// a subset of the set of values of `To`.
+//
+// Note that types that cannot be assigned to each other using built-in assignment (e.g. arrays) might still be
+// considered bit-castable.
+template <class _From, class _To>
+struct __is_always_bitcastable {
+  using _UnqualFrom = __remove_cv_t<_From>;
+  using _UnqualTo = __remove_cv_t<_To>;
+
+  static const bool value =
+    // First, the simple case -- `From` and `To` are the same object type.
+    (is_same<_UnqualFrom, _UnqualTo>::value && is_trivially_copyable<_UnqualFrom>::value) ||
+
+    // Beyond the simple case, we say that one type is "always bit-castable" to another if:
+    // - (1) `From` and `To` have the same value representation, and in addition every possible value of `From` has
+    //   a corresponding value in the `To` type (in other words, the set of values of `To` is a superset of the set of
+    //   values of `From`);
+    // - (2) When the corresponding values are not the same value (as, for example, between an unsigned and a signed
+    //   integer, where a large positive value of the unsigned integer corresponds to a negative value in the signed
+    //   integer type), the value of `To` that results from a bitwise copy of `From` is the same what would be produced
+    //   by the built-in assignment (if it were defined for the two types, to which there are minor exceptions, e.g.
+    //   built-in arrays).
+    //
+    // In practice, that means:
+    // - all integral types (except `bool`, see below) -- that is, character types and `int` types, both signed and
+    //   unsigned...
+    // - as well as arrays of such types...
+    // - ...that have the same size.
+    //
+    // Other trivially-copyable types can't be validly bit-cast outside of their own type:
+    // - floating-point types normally have different sizes and thus aren't bit-castable between each other (fails #1);
+    // - integral types and floating-point types use different representations, so for example bit-casting an integral
+    //   `1` to `float` results in a very small less-than-one value, unlike built-in assignment that produces `1.0`
+    //   (fails #2);
+    // - booleans normally use only a single bit of their object representation; bit-casting an integer to a boolean
+    //   will result in a boolean object with an incorrect representation, which is undefined behavior (fails #2).
+    //   Bit-casting from a boolean into an integer, however, is valid;
+    // - enumeration types may have different ranges of possible values (fails #1);
+    // - for pointers, it is not guaranteed that pointers to different types use the same set of values to represent
+    //   addresses, and the conversion results are explicitly unspecified for types with different alignments
+    //   (fails #1);
+    // - for structs and unions it is impossible to determine whether the set of values of one of them is a subset of
+    //   the other (fails #1);
+    // - there is no need to consider `nullptr_t` for practical purposes.
+    (
+      sizeof(_From) == sizeof(_To) &&
+      is_integral<_From>::value &&
+      is_integral<_To>::value &&
+      !is_same<_UnqualTo, bool>::value
+    );
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_ALWAYS_BITCASTABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_arithmetic.h b/app/src/main/cpp/libcxx/include/__type_traits/is_arithmetic.h
new file mode 100644
index 0000000..6d631f4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_arithmetic.h
@@ -0,0 +1,34 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_ARITHMETIC_H
+#define _LIBCPP___TYPE_TRAITS_IS_ARITHMETIC_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_floating_point.h>
+#include <__type_traits/is_integral.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_arithmetic
+    : public integral_constant<bool, is_integral<_Tp>::value      ||
+                                     is_floating_point<_Tp>::value> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_arithmetic_v = is_arithmetic<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_ARITHMETIC_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_array.h b/app/src/main/cpp/libcxx/include/__type_traits/is_array.h
new file mode 100644
index 0000000..bc10590
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_array.h
@@ -0,0 +1,52 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_ARRAY_H
+#define _LIBCPP___TYPE_TRAITS_IS_ARRAY_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// TODO: Clang incorrectly reports that __is_array is true for T[0].
+//       Re-enable the branch once https://llvm.org/PR54705 is fixed.
+#if __has_builtin(__is_array) && 0
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_array : _BoolConstant<__is_array(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_array_v = __is_array(_Tp);
+#endif
+
+#else
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_array
+    : public false_type {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_array<_Tp[]>
+    : public true_type {};
+template <class _Tp, size_t _Np> struct _LIBCPP_TEMPLATE_VIS is_array<_Tp[_Np]>
+    : public true_type {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_array_v = is_array<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_array)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_ARRAY_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_assignable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_assignable.h
new file mode 100644
index 0000000..13cd682
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_assignable.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_ASSIGNABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_ASSIGNABLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Tp, class _Up>
+struct _LIBCPP_TEMPLATE_VIS is_assignable : _BoolConstant<__is_assignable(_Tp, _Up)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp, class _Arg>
+inline constexpr bool is_assignable_v = __is_assignable(_Tp, _Arg);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_ASSIGNABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_base_of.h b/app/src/main/cpp/libcxx/include/__type_traits/is_base_of.h
new file mode 100644
index 0000000..0e6dec0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_base_of.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_BASE_OF_H
+#define _LIBCPP___TYPE_TRAITS_IS_BASE_OF_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Bp, class _Dp>
+struct _LIBCPP_TEMPLATE_VIS is_base_of
+    : public integral_constant<bool, __is_base_of(_Bp, _Dp)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Bp, class _Dp>
+inline constexpr bool is_base_of_v = __is_base_of(_Bp, _Dp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_BASE_OF_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_bounded_array.h b/app/src/main/cpp/libcxx/include/__type_traits/is_bounded_array.h
new file mode 100644
index 0000000..27de9df
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_bounded_array.h
@@ -0,0 +1,38 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_BOUNDED_ARRAY_H
+#define _LIBCPP___TYPE_TRAITS_IS_BOUNDED_ARRAY_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class>                 struct _LIBCPP_TEMPLATE_VIS __libcpp_is_bounded_array           : false_type {};
+template <class _Tp, size_t _Np> struct _LIBCPP_TEMPLATE_VIS __libcpp_is_bounded_array<_Tp[_Np]> : true_type {};
+
+#if _LIBCPP_STD_VER > 17
+
+template <class>                 struct _LIBCPP_TEMPLATE_VIS is_bounded_array           : false_type {};
+template <class _Tp, size_t _Np> struct _LIBCPP_TEMPLATE_VIS is_bounded_array<_Tp[_Np]> : true_type {};
+
+template <class _Tp>
+inline constexpr
+bool is_bounded_array_v  = is_bounded_array<_Tp>::value;
+
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_BOUNDED_ARRAY_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_callable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_callable.h
new file mode 100644
index 0000000..445373c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_callable.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_CALLABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_CALLABLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__utility/declval.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Func, class... _Args, class = decltype(std::declval<_Func>()(std::declval<_Args>()...))>
+true_type __is_callable_helper(int);
+template<class...>
+false_type __is_callable_helper(...);
+
+template<class _Func, class... _Args>
+struct __is_callable : decltype(std::__is_callable_helper<_Func, _Args...>(0)) {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_CALLABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_char_like_type.h b/app/src/main/cpp/libcxx/include/__type_traits/is_char_like_type.h
new file mode 100644
index 0000000..2620584
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_char_like_type.h
@@ -0,0 +1,28 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_CHAR_LIKE_TYPE_H
+#define _LIBCPP___TYPE_TRAITS_IS_CHAR_LIKE_TYPE_H
+
+#include <__config>
+#include <__type_traits/conjunction.h>
+#include <__type_traits/is_standard_layout.h>
+#include <__type_traits/is_trivial.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _CharT>
+using _IsCharLikeType = _And<is_standard_layout<_CharT>, is_trivial<_CharT> >;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_CHAR_LIKE_TYPE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_class.h b/app/src/main/cpp/libcxx/include/__type_traits/is_class.h
new file mode 100644
index 0000000..031430f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_class.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_CLASS_H
+#define _LIBCPP___TYPE_TRAITS_IS_CLASS_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_class
+    : public integral_constant<bool, __is_class(_Tp)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_class_v = __is_class(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_CLASS_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_compound.h b/app/src/main/cpp/libcxx/include/__type_traits/is_compound.h
new file mode 100644
index 0000000..1395ed8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_compound.h
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_COMPOUND_H
+#define _LIBCPP___TYPE_TRAITS_IS_COMPOUND_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_fundamental.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_compound)
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_compound : _BoolConstant<__is_compound(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_compound_v = __is_compound(_Tp);
+#endif
+
+#else // __has_builtin(__is_compound)
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_compound
+    : public integral_constant<bool, !is_fundamental<_Tp>::value> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_compound_v = is_compound<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_compound)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_COMPOUND_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_const.h b/app/src/main/cpp/libcxx/include/__type_traits/is_const.h
new file mode 100644
index 0000000..42b892c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_const.h
@@ -0,0 +1,45 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_CONST_H
+#define _LIBCPP___TYPE_TRAITS_IS_CONST_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_const)
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_const : _BoolConstant<__is_const(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_const_v = __is_const(_Tp);
+#endif
+
+#else
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_const            : public false_type {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_const<_Tp const> : public true_type {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_const_v = is_const<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_const)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_CONST_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_constant_evaluated.h b/app/src/main/cpp/libcxx/include/__type_traits/is_constant_evaluated.h
new file mode 100644
index 0000000..ae903da
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_constant_evaluated.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_CONSTANT_EVALUATED_H
+#define _LIBCPP___TYPE_TRAITS_IS_CONSTANT_EVALUATED_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+_LIBCPP_INLINE_VISIBILITY
+inline constexpr bool is_constant_evaluated() noexcept {
+  return __builtin_is_constant_evaluated();
+}
+#endif
+
+_LIBCPP_HIDE_FROM_ABI inline _LIBCPP_CONSTEXPR
+bool __libcpp_is_constant_evaluated() _NOEXCEPT { return __builtin_is_constant_evaluated(); }
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_CONSTANT_EVALUATED_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_constructible.h
new file mode 100644
index 0000000..cbe61b4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_constructible.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_IS_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_IS_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class ..._Args>
+struct _LIBCPP_TEMPLATE_VIS is_constructible
+    : public integral_constant<bool, __is_constructible(_Tp, _Args...)>
+{ };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp, class ..._Args>
+inline constexpr bool is_constructible_v = __is_constructible(_Tp, _Args...);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_IS_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_convertible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_convertible.h
new file mode 100644
index 0000000..5f77fd4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_convertible.h
@@ -0,0 +1,108 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_CONVERTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_CONVERTIBLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_array.h>
+#include <__type_traits/is_function.h>
+#include <__type_traits/is_void.h>
+#include <__type_traits/remove_reference.h>
+#include <__utility/declval.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_convertible_to) && !defined(_LIBCPP_USE_IS_CONVERTIBLE_FALLBACK)
+
+template <class _T1, class _T2> struct _LIBCPP_TEMPLATE_VIS is_convertible
+    : public integral_constant<bool, __is_convertible_to(_T1, _T2)> {};
+
+#else  // __has_builtin(__is_convertible_to) && !defined(_LIBCPP_USE_IS_CONVERTIBLE_FALLBACK)
+
+namespace __is_convertible_imp
+{
+template <class _Tp> void  __test_convert(_Tp);
+
+template <class _From, class _To, class = void>
+struct __is_convertible_test : public false_type {};
+
+template <class _From, class _To>
+struct __is_convertible_test<_From, _To,
+    decltype(__is_convertible_imp::__test_convert<_To>(std::declval<_From>()))> : public true_type
+{};
+
+template <class _Tp, bool _IsArray =    is_array<_Tp>::value,
+                     bool _IsFunction = is_function<_Tp>::value,
+                     bool _IsVoid =     is_void<_Tp>::value>
+                     struct __is_array_function_or_void                          {enum {value = 0};};
+template <class _Tp> struct __is_array_function_or_void<_Tp, true, false, false> {enum {value = 1};};
+template <class _Tp> struct __is_array_function_or_void<_Tp, false, true, false> {enum {value = 2};};
+template <class _Tp> struct __is_array_function_or_void<_Tp, false, false, true> {enum {value = 3};};
+}
+
+template <class _Tp,
+    unsigned = __is_convertible_imp::__is_array_function_or_void<__libcpp_remove_reference_t<_Tp> >::value>
+struct __is_convertible_check
+{
+    static const size_t __v = 0;
+};
+
+template <class _Tp>
+struct __is_convertible_check<_Tp, 0>
+{
+    static const size_t __v = sizeof(_Tp);
+};
+
+template <class _T1, class _T2,
+    unsigned _T1_is_array_function_or_void = __is_convertible_imp::__is_array_function_or_void<_T1>::value,
+    unsigned _T2_is_array_function_or_void = __is_convertible_imp::__is_array_function_or_void<_T2>::value>
+struct __is_convertible
+    : public integral_constant<bool,
+        __is_convertible_imp::__is_convertible_test<_T1, _T2>::value
+    >
+{};
+
+template <class _T1, class _T2> struct __is_convertible<_T1, _T2, 0, 1> : public false_type {};
+template <class _T1, class _T2> struct __is_convertible<_T1, _T2, 1, 1> : public false_type {};
+template <class _T1, class _T2> struct __is_convertible<_T1, _T2, 2, 1> : public false_type {};
+template <class _T1, class _T2> struct __is_convertible<_T1, _T2, 3, 1> : public false_type {};
+
+template <class _T1, class _T2> struct __is_convertible<_T1, _T2, 0, 2> : public false_type {};
+template <class _T1, class _T2> struct __is_convertible<_T1, _T2, 1, 2> : public false_type {};
+template <class _T1, class _T2> struct __is_convertible<_T1, _T2, 2, 2> : public false_type {};
+template <class _T1, class _T2> struct __is_convertible<_T1, _T2, 3, 2> : public false_type {};
+
+template <class _T1, class _T2> struct __is_convertible<_T1, _T2, 0, 3> : public false_type {};
+template <class _T1, class _T2> struct __is_convertible<_T1, _T2, 1, 3> : public false_type {};
+template <class _T1, class _T2> struct __is_convertible<_T1, _T2, 2, 3> : public false_type {};
+template <class _T1, class _T2> struct __is_convertible<_T1, _T2, 3, 3> : public true_type {};
+
+template <class _T1, class _T2> struct _LIBCPP_TEMPLATE_VIS is_convertible
+    : public __is_convertible<_T1, _T2>
+{
+    static const size_t __complete_check1 = __is_convertible_check<_T1>::__v;
+    static const size_t __complete_check2 = __is_convertible_check<_T2>::__v;
+};
+
+#endif // __has_builtin(__is_convertible_to) && !defined(_LIBCPP_USE_IS_CONVERTIBLE_FALLBACK)
+
+#if _LIBCPP_STD_VER > 14
+template <class _From, class _To>
+inline constexpr bool is_convertible_v = is_convertible<_From, _To>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_CONVERTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_copy_assignable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_copy_assignable.h
new file mode 100644
index 0000000..b3a965f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_copy_assignable.h
@@ -0,0 +1,37 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_COPY_ASSIGNABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_COPY_ASSIGNABLE_H
+
+#include <__config>
+#include <__type_traits/add_const.h>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_copy_assignable
+    : public integral_constant<
+          bool,
+          __is_assignable(__add_lvalue_reference_t<_Tp>,
+                          __add_lvalue_reference_t<typename add_const<_Tp>::type>)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_copy_assignable_v = is_copy_assignable<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_COPY_ASSIGNABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_copy_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_copy_constructible.h
new file mode 100644
index 0000000..053e159
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_copy_constructible.h
@@ -0,0 +1,36 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_COPY_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_COPY_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/add_const.h>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_copy_constructible
+    : public integral_constant<
+          bool,
+          __is_constructible(_Tp, __add_lvalue_reference_t<typename add_const<_Tp>::type>)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_copy_constructible_v = is_copy_constructible<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_COPY_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_core_convertible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_core_convertible.h
new file mode 100644
index 0000000..1ce4079
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_core_convertible.h
@@ -0,0 +1,36 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_CORE_CONVERTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_CORE_CONVERTIBLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// [conv.general]/3 says "E is convertible to T" whenever "T t=E;" is well-formed.
+// We can't test for that, but we can test implicit convertibility by passing it
+// to a function. Notice that __is_core_convertible<void,void> is false,
+// and __is_core_convertible<immovable-type,immovable-type> is true in C++17 and later.
+
+template <class _Tp, class _Up, class = void>
+struct __is_core_convertible : public false_type {};
+
+template <class _Tp, class _Up>
+struct __is_core_convertible<_Tp, _Up, decltype(
+    static_cast<void(*)(_Up)>(0) ( static_cast<_Tp(*)()>(0)() )
+)> : public true_type {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_CORE_CONVERTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_default_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_default_constructible.h
new file mode 100644
index 0000000..d2180c6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_default_constructible.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_DEFAULT_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_DEFAULT_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_default_constructible
+    : public integral_constant<bool, __is_constructible(_Tp)>
+    {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_default_constructible_v = __is_constructible(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_DEFAULT_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_destructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_destructible.h
new file mode 100644
index 0000000..376d74d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_destructible.h
@@ -0,0 +1,102 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_DESTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_DESTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_function.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/remove_all_extents.h>
+#include <__utility/declval.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_destructible)
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_destructible : _BoolConstant<__is_destructible(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_destructible_v = __is_destructible(_Tp);
+#endif
+
+#else // __has_builtin(__is_destructible)
+
+//  if it's a reference, return true
+//  if it's a function, return false
+//  if it's   void,     return false
+//  if it's an array of unknown bound, return false
+//  Otherwise, return "declval<_Up&>().~_Up()" is well-formed
+//    where _Up is remove_all_extents<_Tp>::type
+
+template <class>
+struct __is_destructible_apply { typedef int type; };
+
+template <typename _Tp>
+struct __is_destructor_wellformed {
+    template <typename _Tp1>
+    static true_type  __test (
+        typename __is_destructible_apply<decltype(std::declval<_Tp1&>().~_Tp1())>::type
+    );
+
+    template <typename _Tp1>
+    static false_type __test (...);
+
+    static const bool value = decltype(__test<_Tp>(12))::value;
+};
+
+template <class _Tp, bool>
+struct __destructible_imp;
+
+template <class _Tp>
+struct __destructible_imp<_Tp, false>
+   : public integral_constant<bool,
+        __is_destructor_wellformed<__remove_all_extents_t<_Tp> >::value> {};
+
+template <class _Tp>
+struct __destructible_imp<_Tp, true>
+    : public true_type {};
+
+template <class _Tp, bool>
+struct __destructible_false;
+
+template <class _Tp>
+struct __destructible_false<_Tp, false> : public __destructible_imp<_Tp, is_reference<_Tp>::value> {};
+
+template <class _Tp>
+struct __destructible_false<_Tp, true> : public false_type {};
+
+template <class _Tp>
+struct is_destructible
+    : public __destructible_false<_Tp, is_function<_Tp>::value> {};
+
+template <class _Tp>
+struct is_destructible<_Tp[]>
+    : public false_type {};
+
+template <>
+struct is_destructible<void>
+    : public false_type {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_destructible_v = is_destructible<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_destructible)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_DESTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_empty.h b/app/src/main/cpp/libcxx/include/__type_traits/is_empty.h
new file mode 100644
index 0000000..042b4e6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_empty.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_EMPTY_H
+#define _LIBCPP___TYPE_TRAITS_IS_EMPTY_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_empty
+    : public integral_constant<bool, __is_empty(_Tp)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_empty_v = __is_empty(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_EMPTY_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_enum.h b/app/src/main/cpp/libcxx/include/__type_traits/is_enum.h
new file mode 100644
index 0000000..4c1db41
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_enum.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_ENUM_H
+#define _LIBCPP___TYPE_TRAITS_IS_ENUM_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_enum
+    : public integral_constant<bool, __is_enum(_Tp)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_enum_v = __is_enum(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_ENUM_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_final.h b/app/src/main/cpp/libcxx/include/__type_traits/is_final.h
new file mode 100644
index 0000000..74ced23
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_final.h
@@ -0,0 +1,36 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_FINAL_H
+#define _LIBCPP___TYPE_TRAITS_IS_FINAL_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS
+__libcpp_is_final : public integral_constant<bool, __is_final(_Tp)> {};
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS
+is_final : public integral_constant<bool, __is_final(_Tp)> {};
+#endif
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_final_v = __is_final(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_FINAL_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_floating_point.h b/app/src/main/cpp/libcxx/include/__type_traits/is_floating_point.h
new file mode 100644
index 0000000..3928448
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_floating_point.h
@@ -0,0 +1,37 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_FLOATING_POINT_H
+#define _LIBCPP___TYPE_TRAITS_IS_FLOATING_POINT_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/remove_cv.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct __libcpp_is_floating_point              : public false_type {};
+template <>          struct __libcpp_is_floating_point<float>       : public true_type {};
+template <>          struct __libcpp_is_floating_point<double>      : public true_type {};
+template <>          struct __libcpp_is_floating_point<long double> : public true_type {};
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_floating_point
+    : public __libcpp_is_floating_point<__remove_cv_t<_Tp> > {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_floating_point_v = is_floating_point<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_FLOATING_POINT_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_function.h b/app/src/main/cpp/libcxx/include/__type_traits/is_function.h
new file mode 100644
index 0000000..53f34b3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_function.h
@@ -0,0 +1,43 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_FUNCTIONAL_H
+#define _LIBCPP___TYPE_TRAITS_IS_FUNCTIONAL_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_const.h>
+#include <__type_traits/is_reference.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_function)
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_function : integral_constant<bool, __is_function(_Tp)> {};
+
+#else
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_function
+    : public integral_constant<bool, !(is_reference<_Tp>::value || is_const<const _Tp>::value)> {};
+
+#endif // __has_builtin(__is_function)
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_function_v = is_function<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_FUNCTIONAL_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_fundamental.h b/app/src/main/cpp/libcxx/include/__type_traits/is_fundamental.h
new file mode 100644
index 0000000..46f81a1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_fundamental.h
@@ -0,0 +1,49 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_FUNDAMENTAL_H
+#define _LIBCPP___TYPE_TRAITS_IS_FUNDAMENTAL_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_null_pointer.h>
+#include <__type_traits/is_void.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_fundamental)
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_fundamental : _BoolConstant<__is_fundamental(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_fundamental_v = __is_fundamental(_Tp);
+#endif
+
+#else // __has_builtin(__is_fundamental)
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_fundamental
+    : public integral_constant<bool, is_void<_Tp>::value        ||
+                                     __is_nullptr_t<_Tp>::value ||
+                                     is_arithmetic<_Tp>::value> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_fundamental_v = is_fundamental<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_fundamental)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_FUNDAMENTAL_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_implicitly_default_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_implicitly_default_constructible.h
new file mode 100644
index 0000000..b77f948
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_implicitly_default_constructible.h
@@ -0,0 +1,48 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_IMPLICITLY_DEFAULT_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_IMPLICITLY_DEFAULT_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_default_constructible.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#ifndef _LIBCPP_CXX03_LANG
+// First of all, we can't implement this check in C++03 mode because the {}
+// default initialization syntax isn't valid.
+// Second, we implement the trait in a funny manner with two defaulted template
+// arguments to workaround Clang's PR43454.
+template <class _Tp>
+void __test_implicit_default_constructible(_Tp);
+
+template <class _Tp, class = void, class = typename is_default_constructible<_Tp>::type>
+struct __is_implicitly_default_constructible
+    : false_type
+{ };
+
+template <class _Tp>
+struct __is_implicitly_default_constructible<_Tp, decltype(std::__test_implicit_default_constructible<_Tp const&>({})), true_type>
+    : true_type
+{ };
+
+template <class _Tp>
+struct __is_implicitly_default_constructible<_Tp, decltype(std::__test_implicit_default_constructible<_Tp const&>({})), false_type>
+    : false_type
+{ };
+#endif // !C++03
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_IMPLICITLY_DEFAULT_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_integral.h b/app/src/main/cpp/libcxx/include/__type_traits/is_integral.h
new file mode 100644
index 0000000..4dcc191
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_integral.h
@@ -0,0 +1,72 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_INTEGRAL_H
+#define _LIBCPP___TYPE_TRAITS_IS_INTEGRAL_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/remove_cv.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct __libcpp_is_integral                     { enum { value = 0 }; };
+template <>          struct __libcpp_is_integral<bool>               { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<char>               { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<signed char>        { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<unsigned char>      { enum { value = 1 }; };
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>          struct __libcpp_is_integral<wchar_t>            { enum { value = 1 }; };
+#endif
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+template <>          struct __libcpp_is_integral<char8_t>            { enum { value = 1 }; };
+#endif
+template <>          struct __libcpp_is_integral<char16_t>           { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<char32_t>           { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<short>              { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<unsigned short>     { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<int>                { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<unsigned int>       { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<long>               { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<unsigned long>      { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<long long>          { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<unsigned long long> { enum { value = 1 }; };
+#ifndef _LIBCPP_HAS_NO_INT128
+template <>          struct __libcpp_is_integral<__int128_t>         { enum { value = 1 }; };
+template <>          struct __libcpp_is_integral<__uint128_t>        { enum { value = 1 }; };
+#endif
+
+#if __has_builtin(__is_integral)
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_integral : _BoolConstant<__is_integral(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_integral_v = __is_integral(_Tp);
+#endif
+
+#else
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_integral
+    : public _BoolConstant<__libcpp_is_integral<__remove_cv_t<_Tp> >::value> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_integral_v = is_integral<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_integral)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_INTEGRAL_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_literal_type.h b/app/src/main/cpp/libcxx/include/__type_traits/is_literal_type.h
new file mode 100644
index 0000000..be01745
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_literal_type.h
@@ -0,0 +1,34 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_LITERAL_TYPE
+#define _LIBCPP___TYPE_TRAITS_IS_LITERAL_TYPE
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_TYPE_TRAITS)
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX17 is_literal_type
+    : public integral_constant<bool, __is_literal_type(_Tp)>
+    {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+_LIBCPP_DEPRECATED_IN_CXX17 inline constexpr bool is_literal_type_v = __is_literal_type(_Tp);
+#endif // _LIBCPP_STD_VER > 14
+#endif // _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_TYPE_TRAITS)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_LITERAL_TYPE
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_member_function_pointer.h b/app/src/main/cpp/libcxx/include/__type_traits/is_member_function_pointer.h
new file mode 100644
index 0000000..c28f359
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_member_function_pointer.h
@@ -0,0 +1,64 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_MEMBER_FUNCTION_POINTER_H
+#define _LIBCPP___TYPE_TRAITS_IS_MEMBER_FUNCTION_POINTER_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_function.h>
+#include <__type_traits/remove_cv.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct __libcpp_is_member_pointer {
+  enum {
+    __is_member = false,
+    __is_func = false,
+    __is_obj = false
+  };
+};
+template <class _Tp, class _Up> struct __libcpp_is_member_pointer<_Tp _Up::*> {
+  enum {
+    __is_member = true,
+    __is_func = is_function<_Tp>::value,
+    __is_obj = !__is_func,
+  };
+};
+
+#if __has_builtin(__is_member_function_pointer)
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_member_function_pointer
+    : _BoolConstant<__is_member_function_pointer(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_member_function_pointer_v = __is_member_function_pointer(_Tp);
+#endif
+
+#else // __has_builtin(__is_member_function_pointer)
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_member_function_pointer
+    : public _BoolConstant< __libcpp_is_member_pointer<__remove_cv_t<_Tp> >::__is_func > {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_member_function_pointer_v = is_member_function_pointer<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_member_function_pointer)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_MEMBER_FUNCTION_POINTER_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_member_object_pointer.h b/app/src/main/cpp/libcxx/include/__type_traits/is_member_object_pointer.h
new file mode 100644
index 0000000..5bab14b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_member_object_pointer.h
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_MEMBER_OBJECT_POINTER_H
+#define _LIBCPP___TYPE_TRAITS_IS_MEMBER_OBJECT_POINTER_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_member_object_pointer)
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_member_object_pointer
+    : _BoolConstant<__is_member_object_pointer(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_member_object_pointer_v = __is_member_object_pointer(_Tp);
+#endif
+
+#else // __has_builtin(__is_member_object_pointer)
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_member_object_pointer
+    : public _BoolConstant< __libcpp_is_member_pointer<__remove_cv_t<_Tp> >::__is_obj >  {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_member_object_pointer_v = is_member_object_pointer<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_member_object_pointer)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_MEMBER_FUNCTION_POINTER_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_member_pointer.h b/app/src/main/cpp/libcxx/include/__type_traits/is_member_pointer.h
new file mode 100644
index 0000000..904d845
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_member_pointer.h
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_MEMBER_POINTER_H
+#define _LIBCPP___TYPE_TRAITS_IS_MEMBER_POINTER_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_member_function_pointer.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_member_pointer)
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_member_pointer : _BoolConstant<__is_member_pointer(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_member_pointer_v = __is_member_pointer(_Tp);
+#endif
+
+#else // __has_builtin(__is_member_pointer)
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_member_pointer
+ : public _BoolConstant< __libcpp_is_member_pointer<__remove_cv_t<_Tp> >::__is_member > {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_member_pointer_v = is_member_pointer<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_member_pointer)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_MEMBER_POINTER_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_move_assignable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_move_assignable.h
new file mode 100644
index 0000000..3c7158b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_move_assignable.h
@@ -0,0 +1,36 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_MOVE_ASSIGNABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_MOVE_ASSIGNABLE_H
+
+#include <__config>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/add_rvalue_reference.h>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_move_assignable
+    : public integral_constant<
+          bool,
+          __is_assignable(__add_lvalue_reference_t<_Tp>, __add_rvalue_reference_t<_Tp>)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_move_assignable_v = is_move_assignable<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_MOVE_ASSIGNABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_move_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_move_constructible.h
new file mode 100644
index 0000000..667d104
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_move_constructible.h
@@ -0,0 +1,34 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_MOVE_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_MOVE_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/add_rvalue_reference.h>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_move_constructible
+    : public integral_constant<bool, __is_constructible(_Tp, __add_rvalue_reference_t<_Tp>)>
+    {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_move_constructible_v = is_move_constructible<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_MOVE_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_assignable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_assignable.h
new file mode 100644
index 0000000..0cd9d5d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_assignable.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_NOTHROW_ASSIGNABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_NOTHROW_ASSIGNABLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _Arg>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_assignable
+    : public integral_constant<bool, __is_nothrow_assignable(_Tp, _Arg)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp, class _Arg>
+inline constexpr bool is_nothrow_assignable_v = __is_nothrow_assignable(_Tp, _Arg);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_NOTHROW_ASSIGNABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_constructible.h
new file mode 100644
index 0000000..8919b79
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_constructible.h
@@ -0,0 +1,78 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_NOTHROW_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_NOTHROW_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_constructible.h>
+#include <__type_traits/is_reference.h>
+#include <__utility/declval.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_nothrow_constructible)
+
+template <
+    class _Tp, class... _Args>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_constructible
+    : public integral_constant<bool, __is_nothrow_constructible(_Tp, _Args...)> {};
+#else
+
+template <bool, bool, class _Tp, class... _Args> struct __libcpp_is_nothrow_constructible;
+
+template <class _Tp, class... _Args>
+struct __libcpp_is_nothrow_constructible</*is constructible*/true, /*is reference*/false, _Tp, _Args...>
+    : public integral_constant<bool, noexcept(_Tp(std::declval<_Args>()...))>
+{
+};
+
+template <class _Tp>
+void __implicit_conversion_to(_Tp) noexcept { }
+
+template <class _Tp, class _Arg>
+struct __libcpp_is_nothrow_constructible</*is constructible*/true, /*is reference*/true, _Tp, _Arg>
+    : public integral_constant<bool, noexcept(_VSTD::__implicit_conversion_to<_Tp>(std::declval<_Arg>()))>
+{
+};
+
+template <class _Tp, bool _IsReference, class... _Args>
+struct __libcpp_is_nothrow_constructible</*is constructible*/false, _IsReference, _Tp, _Args...>
+    : public false_type
+{
+};
+
+template <class _Tp, class... _Args>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_constructible
+    : __libcpp_is_nothrow_constructible<is_constructible<_Tp, _Args...>::value, is_reference<_Tp>::value, _Tp, _Args...>
+{
+};
+
+template <class _Tp, size_t _Ns>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_constructible<_Tp[_Ns]>
+    : __libcpp_is_nothrow_constructible<is_constructible<_Tp>::value, is_reference<_Tp>::value, _Tp>
+{
+};
+
+#endif // __has_builtin(__is_nothrow_constructible)
+
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp, class ..._Args>
+inline constexpr bool is_nothrow_constructible_v = is_nothrow_constructible<_Tp, _Args...>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_NOTHROW_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_convertible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_convertible.h
new file mode 100644
index 0000000..a8ca1c4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_convertible.h
@@ -0,0 +1,53 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_NOTHROW_CONVERTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_NOTHROW_CONVERTIBLE_H
+
+#include <__config>
+#include <__type_traits/conjunction.h>
+#include <__type_traits/disjunction.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_void.h>
+#include <__type_traits/lazy.h>
+#include <__utility/declval.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <typename _Tp>
+static void __test_noexcept(_Tp) noexcept;
+
+template<typename _Fm, typename _To>
+static bool_constant<noexcept(_VSTD::__test_noexcept<_To>(std::declval<_Fm>()))>
+__is_nothrow_convertible_test();
+
+template <typename _Fm, typename _To>
+struct __is_nothrow_convertible_helper: decltype(__is_nothrow_convertible_test<_Fm, _To>())
+{ };
+
+template <typename _Fm, typename _To>
+struct is_nothrow_convertible : _Or<
+    _And<is_void<_To>, is_void<_Fm>>,
+    _Lazy<_And, is_convertible<_Fm, _To>, __is_nothrow_convertible_helper<_Fm, _To>>
+>::type { };
+
+template <typename _Fm, typename _To>
+inline constexpr bool is_nothrow_convertible_v = is_nothrow_convertible<_Fm, _To>::value;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_NOTHROW_CONVERTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_copy_assignable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_copy_assignable.h
new file mode 100644
index 0000000..58f7d97
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_copy_assignable.h
@@ -0,0 +1,38 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_NOTHROW_COPY_ASSIGNABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_NOTHROW_COPY_ASSIGNABLE_H
+
+#include <__config>
+#include <__type_traits/add_const.h>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_copy_assignable
+    : public integral_constant<
+          bool,
+          __is_nothrow_assignable(
+              __add_lvalue_reference_t<_Tp>,
+              __add_lvalue_reference_t<typename add_const<_Tp>::type>)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_nothrow_copy_assignable_v = is_nothrow_copy_assignable<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_NOTHROW_COPY_ASSIGNABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_copy_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_copy_constructible.h
new file mode 100644
index 0000000..ce17334
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_copy_constructible.h
@@ -0,0 +1,48 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_NOTHROW_COPY_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_NOTHROW_COPY_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/add_const.h>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_nothrow_constructible.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// TODO: remove this implementation once https://gcc.gnu.org/bugzilla/show_bug.cgi?id=106611 is fixed
+#ifdef _LIBCPP_COMPILER_GCC
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_nothrow_copy_constructible
+    : public is_nothrow_constructible<_Tp,
+                  __add_lvalue_reference_t<typename add_const<_Tp>::type> > {};
+
+#else // _LIBCPP_COMPILER_GCC
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_copy_constructible
+    : public integral_constant<
+          bool,
+          __is_nothrow_constructible(_Tp, typename add_lvalue_reference<typename add_const<_Tp>::type>::type)> {};
+
+#endif // _LIBCPP_COMPILER_GCC
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_nothrow_copy_constructible_v = is_nothrow_copy_constructible<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_NOTHROW_COPY_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_default_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_default_constructible.h
new file mode 100644
index 0000000..91bffa5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_default_constructible.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_NOTHROW_DEFAULT_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_NOTHROW_DEFAULT_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_nothrow_default_constructible
+    : public integral_constant<bool, __is_nothrow_constructible(_Tp)>
+    {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_nothrow_default_constructible_v = __is_nothrow_constructible(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_NOTHROW_DEFAULT_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_destructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_destructible.h
new file mode 100644
index 0000000..03ebf44
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_destructible.h
@@ -0,0 +1,89 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_NOTHROW_DESTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_NOTHROW_DESTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_destructible.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/is_scalar.h>
+#include <__type_traits/remove_all_extents.h>
+#include <__utility/declval.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if !defined(_LIBCPP_CXX03_LANG)
+
+template <bool, class _Tp> struct __libcpp_is_nothrow_destructible;
+
+template <class _Tp>
+struct __libcpp_is_nothrow_destructible<false, _Tp>
+    : public false_type
+{
+};
+
+template <class _Tp>
+struct __libcpp_is_nothrow_destructible<true, _Tp>
+    : public integral_constant<bool, noexcept(std::declval<_Tp>().~_Tp()) >
+{
+};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_destructible
+    : public __libcpp_is_nothrow_destructible<is_destructible<_Tp>::value, _Tp>
+{
+};
+
+template <class _Tp, size_t _Ns>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_destructible<_Tp[_Ns]>
+    : public is_nothrow_destructible<_Tp>
+{
+};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_destructible<_Tp&>
+    : public true_type
+{
+};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_destructible<_Tp&&>
+    : public true_type
+{
+};
+
+#else
+
+template <class _Tp> struct __libcpp_nothrow_destructor
+    : public integral_constant<bool, is_scalar<_Tp>::value ||
+                                     is_reference<_Tp>::value> {};
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_nothrow_destructible
+    : public __libcpp_nothrow_destructor<__remove_all_extents_t<_Tp> > {};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_destructible<_Tp[]>
+    : public false_type {};
+
+#endif
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_nothrow_destructible_v = is_nothrow_destructible<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_NOTHROW_DESTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_move_assignable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_move_assignable.h
new file mode 100644
index 0000000..18dcc9b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_move_assignable.h
@@ -0,0 +1,37 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_NOTHROW_MOVE_ASSIGNABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_NOTHROW_MOVE_ASSIGNABLE_H
+
+#include <__config>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/add_rvalue_reference.h>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_move_assignable
+    : public integral_constant<
+          bool,
+          __is_nothrow_assignable(__add_lvalue_reference_t<_Tp>, __add_rvalue_reference_t<_Tp>)> {
+};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_nothrow_move_assignable_v = is_nothrow_move_assignable<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_NOTHROW_MOVE_ASSIGNABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_move_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_move_constructible.h
new file mode 100644
index 0000000..ad8222a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_nothrow_move_constructible.h
@@ -0,0 +1,45 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_NOTHROW_MOVE_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_NOTHROW_MOVE_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/add_rvalue_reference.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_nothrow_constructible.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// TODO: remove this implementation once https://gcc.gnu.org/bugzilla/show_bug.cgi?id=106611 is fixed
+#ifndef _LIBCPP_COMPILER_GCC
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_nothrow_move_constructible
+    : public integral_constant<bool, __is_nothrow_constructible(_Tp, __add_rvalue_reference_t<_Tp>)>
+    {};
+
+#else // _LIBCPP_COMPILER_GCC
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_nothrow_move_constructible
+    : public is_nothrow_constructible<_Tp, __add_rvalue_reference_t<_Tp> >
+    {};
+
+#endif // _LIBCPP_COMPILER_GCC
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_nothrow_move_constructible_v = is_nothrow_move_constructible<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_NOTHROW_MOVE_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_null_pointer.h b/app/src/main/cpp/libcxx/include/__type_traits/is_null_pointer.h
new file mode 100644
index 0000000..4864cee
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_null_pointer.h
@@ -0,0 +1,41 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_NULL_POINTER_H
+#define _LIBCPP___TYPE_TRAITS_IS_NULL_POINTER_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/remove_cv.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct __is_nullptr_t_impl       : public false_type {};
+template <>          struct __is_nullptr_t_impl<nullptr_t> : public true_type {};
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS __is_nullptr_t
+    : public __is_nullptr_t_impl<__remove_cv_t<_Tp> > {};
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_null_pointer
+    : public __is_nullptr_t_impl<__remove_cv_t<_Tp> > {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_null_pointer_v = is_null_pointer<_Tp>::value;
+#endif
+#endif // _LIBCPP_STD_VER > 11
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_NULL_POINTER_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_object.h b/app/src/main/cpp/libcxx/include/__type_traits/is_object.h
new file mode 100644
index 0000000..943f1a7
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_object.h
@@ -0,0 +1,52 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_OBJECT_H
+#define _LIBCPP___TYPE_TRAITS_IS_OBJECT_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_array.h>
+#include <__type_traits/is_class.h>
+#include <__type_traits/is_scalar.h>
+#include <__type_traits/is_union.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_object)
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_object : _BoolConstant<__is_object(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_object_v = __is_object(_Tp);
+#endif
+
+#else // __has_builtin(__is_object)
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_object
+    : public integral_constant<bool, is_scalar<_Tp>::value ||
+                                     is_array<_Tp>::value  ||
+                                     is_union<_Tp>::value  ||
+                                     is_class<_Tp>::value  > {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_object_v = is_object<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_object)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_OBJECT_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_pod.h b/app/src/main/cpp/libcxx/include/__type_traits/is_pod.h
new file mode 100644
index 0000000..c1d00b2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_pod.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_POD_H
+#define _LIBCPP___TYPE_TRAITS_IS_POD_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_pod
+    : public integral_constant<bool, __is_pod(_Tp)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_pod_v = __is_pod(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_POD_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_pointer.h b/app/src/main/cpp/libcxx/include/__type_traits/is_pointer.h
new file mode 100644
index 0000000..3c0ad04
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_pointer.h
@@ -0,0 +1,57 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_POINTER_H
+#define _LIBCPP___TYPE_TRAITS_IS_POINTER_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/remove_cv.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_pointer)
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_pointer : _BoolConstant<__is_pointer(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_pointer_v = __is_pointer(_Tp);
+#endif
+
+#else // __has_builtin(__is_pointer)
+
+template <class _Tp> struct __libcpp_is_pointer       : public false_type {};
+template <class _Tp> struct __libcpp_is_pointer<_Tp*> : public true_type {};
+
+template <class _Tp> struct __libcpp_remove_objc_qualifiers { typedef _Tp type; };
+#if defined(_LIBCPP_HAS_OBJC_ARC)
+template <class _Tp> struct __libcpp_remove_objc_qualifiers<_Tp __strong> { typedef _Tp type; };
+template <class _Tp> struct __libcpp_remove_objc_qualifiers<_Tp __weak> { typedef _Tp type; };
+template <class _Tp> struct __libcpp_remove_objc_qualifiers<_Tp __autoreleasing> { typedef _Tp type; };
+template <class _Tp> struct __libcpp_remove_objc_qualifiers<_Tp __unsafe_unretained> { typedef _Tp type; };
+#endif
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_pointer
+    : public __libcpp_is_pointer<typename __libcpp_remove_objc_qualifiers<__remove_cv_t<_Tp> >::type> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_pointer_v = is_pointer<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_pointer)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_POINTER_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_polymorphic.h b/app/src/main/cpp/libcxx/include/__type_traits/is_polymorphic.h
new file mode 100644
index 0000000..96da48a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_polymorphic.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_POLYMORPHIC_H
+#define _LIBCPP___TYPE_TRAITS_IS_POLYMORPHIC_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_polymorphic
+    : public integral_constant<bool, __is_polymorphic(_Tp)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_polymorphic_v = __is_polymorphic(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_POLYMORPHIC_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_primary_template.h b/app/src/main/cpp/libcxx/include/__type_traits/is_primary_template.h
new file mode 100644
index 0000000..a9bebcf
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_primary_template.h
@@ -0,0 +1,34 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_PRIMARY_TEMPLATE_H
+#define _LIBCPP___TYPE_TRAITS_IS_PRIMARY_TEMPLATE_H
+
+#include <__config>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_valid_expansion.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+using __test_for_primary_template = __enable_if_t<
+    _IsSame<_Tp, typename _Tp::__primary_template>::value
+  >;
+template <class _Tp>
+using __is_primary_template = _IsValidExpansion<
+    __test_for_primary_template, _Tp
+  >;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_PRIMARY_TEMPLATE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_reference.h b/app/src/main/cpp/libcxx/include/__type_traits/is_reference.h
new file mode 100644
index 0000000..27ca2dd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_reference.h
@@ -0,0 +1,70 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_REFERENCE_H
+#define _LIBCPP___TYPE_TRAITS_IS_REFERENCE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_lvalue_reference) && \
+    __has_builtin(__is_rvalue_reference) && \
+    __has_builtin(__is_reference)
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_lvalue_reference : _BoolConstant<__is_lvalue_reference(_Tp)> { };
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_rvalue_reference : _BoolConstant<__is_rvalue_reference(_Tp)> { };
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_reference : _BoolConstant<__is_reference(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_reference_v = __is_reference(_Tp);
+template <class _Tp>
+inline constexpr bool is_lvalue_reference_v = __is_lvalue_reference(_Tp);
+template <class _Tp>
+inline constexpr bool is_rvalue_reference_v = __is_rvalue_reference(_Tp);
+#endif
+
+#else // __has_builtin(__is_lvalue_reference) && etc...
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_lvalue_reference       : public false_type {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_lvalue_reference<_Tp&> : public true_type {};
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_rvalue_reference        : public false_type {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_rvalue_reference<_Tp&&> : public true_type {};
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_reference        : public false_type {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_reference<_Tp&>  : public true_type {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_reference<_Tp&&> : public true_type {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_reference_v = is_reference<_Tp>::value;
+
+template <class _Tp>
+inline constexpr bool is_lvalue_reference_v = is_lvalue_reference<_Tp>::value;
+
+template <class _Tp>
+inline constexpr bool is_rvalue_reference_v = is_rvalue_reference<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_lvalue_reference) && etc...
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_REFERENCE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_reference_wrapper.h b/app/src/main/cpp/libcxx/include/__type_traits/is_reference_wrapper.h
new file mode 100644
index 0000000..d187eec
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_reference_wrapper.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_REFERENCE_WRAPPER_H
+#define _LIBCPP___TYPE_TRAITS_IS_REFERENCE_WRAPPER_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/remove_cv.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> class _LIBCPP_TEMPLATE_VIS reference_wrapper;
+
+template <class _Tp> struct __is_reference_wrapper_impl : public false_type {};
+template <class _Tp> struct __is_reference_wrapper_impl<reference_wrapper<_Tp> > : public true_type {};
+template <class _Tp> struct __is_reference_wrapper
+    : public __is_reference_wrapper_impl<__remove_cv_t<_Tp> > {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_ENABLE_IF_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_referenceable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_referenceable.h
new file mode 100644
index 0000000..4b34ec2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_referenceable.h
@@ -0,0 +1,41 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_REFERENCEABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_REFERENCEABLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_same.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_referenceable)
+template <class _Tp>
+struct __libcpp_is_referenceable : integral_constant<bool, __is_referenceable(_Tp)> {};
+#else
+struct __libcpp_is_referenceable_impl {
+  template <class _Tp>
+  static _Tp& __test(int);
+  template <class _Tp>
+  static false_type __test(...);
+};
+
+template <class _Tp>
+struct __libcpp_is_referenceable
+    : integral_constant<bool, _IsNotSame<decltype(__libcpp_is_referenceable_impl::__test<_Tp>(0)), false_type>::value> {
+};
+#endif // __has_builtin(__is_referenceable)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_REFERENCEABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_same.h b/app/src/main/cpp/libcxx/include/__type_traits/is_same.h
new file mode 100644
index 0000000..6fa0afb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_same.h
@@ -0,0 +1,44 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_SAME_H
+#define _LIBCPP___TYPE_TRAITS_IS_SAME_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _Up>
+struct _LIBCPP_TEMPLATE_VIS is_same : _BoolConstant<__is_same(_Tp, _Up)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp, class _Up>
+inline constexpr bool is_same_v = __is_same(_Tp, _Up);
+#endif
+
+// _IsSame<T,U> has the same effect as is_same<T,U> but instantiates fewer types:
+// is_same<A,B> and is_same<C,D> are guaranteed to be different types, but
+// _IsSame<A,B> and _IsSame<C,D> are the same type (namely, false_type).
+// Neither GCC nor Clang can mangle the __is_same builtin, so _IsSame
+// mustn't be directly used anywhere that contributes to name-mangling
+// (such as in a dependent return type).
+
+template <class _Tp, class _Up>
+using _IsSame = _BoolConstant<__is_same(_Tp, _Up)>;
+
+template <class _Tp, class _Up>
+using _IsNotSame = _BoolConstant<!__is_same(_Tp, _Up)>;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_SAME_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_scalar.h b/app/src/main/cpp/libcxx/include/__type_traits/is_scalar.h
new file mode 100644
index 0000000..b4dc70b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_scalar.h
@@ -0,0 +1,62 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_SCALAR_H
+#define _LIBCPP___TYPE_TRAITS_IS_SCALAR_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_arithmetic.h>
+#include <__type_traits/is_enum.h>
+#include <__type_traits/is_member_pointer.h>
+#include <__type_traits/is_null_pointer.h>
+#include <__type_traits/is_pointer.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_scalar)
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_scalar : _BoolConstant<__is_scalar(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_scalar_v = __is_scalar(_Tp);
+#endif
+
+#else // __has_builtin(__is_scalar)
+
+template <class _Tp> struct __is_block : false_type {};
+#if defined(_LIBCPP_HAS_EXTENSION_BLOCKS)
+template <class _Rp, class ..._Args> struct __is_block<_Rp (^)(_Args...)> : true_type {};
+#endif
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_scalar
+    : public integral_constant<bool, is_arithmetic<_Tp>::value     ||
+                                     is_member_pointer<_Tp>::value ||
+                                     is_pointer<_Tp>::value        ||
+                                     __is_nullptr_t<_Tp>::value    ||
+                                     __is_block<_Tp>::value        ||
+                                     is_enum<_Tp>::value           > {};
+
+template <> struct _LIBCPP_TEMPLATE_VIS is_scalar<nullptr_t> : public true_type {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_scalar_v = is_scalar<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_scalar)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_SCALAR_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_scoped_enum.h b/app/src/main/cpp/libcxx/include/__type_traits/is_scoped_enum.h
new file mode 100644
index 0000000..85a4128
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_scoped_enum.h
@@ -0,0 +1,42 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_SCOPED_ENUM_H
+#define _LIBCPP___TYPE_TRAITS_IS_SCOPED_ENUM_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_enum.h>
+#include <__type_traits/underlying_type.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 20
+template <class _Tp, bool = is_enum_v<_Tp> >
+struct __is_scoped_enum_helper : false_type {};
+
+template <class _Tp>
+struct __is_scoped_enum_helper<_Tp, true>
+    : public bool_constant<!is_convertible_v<_Tp, underlying_type_t<_Tp> > > {};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_scoped_enum
+    : public __is_scoped_enum_helper<_Tp> {};
+
+template <class _Tp>
+inline constexpr bool is_scoped_enum_v = is_scoped_enum<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_SCOPED_ENUM_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_signed.h b/app/src/main/cpp/libcxx/include/__type_traits/is_signed.h
new file mode 100644
index 0000000..aa42a4e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_signed.h
@@ -0,0 +1,57 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_SIGNED_H
+#define _LIBCPP___TYPE_TRAITS_IS_SIGNED_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_arithmetic.h>
+#include <__type_traits/is_integral.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_signed)
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_signed : _BoolConstant<__is_signed(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_signed_v = __is_signed(_Tp);
+#endif
+
+#else // __has_builtin(__is_signed)
+
+template <class _Tp, bool = is_integral<_Tp>::value>
+struct __libcpp_is_signed_impl : public _BoolConstant<(_Tp(-1) < _Tp(0))> {};
+
+template <class _Tp>
+struct __libcpp_is_signed_impl<_Tp, false> : public true_type {};  // floating point
+
+template <class _Tp, bool = is_arithmetic<_Tp>::value>
+struct __libcpp_is_signed : public __libcpp_is_signed_impl<_Tp> {};
+
+template <class _Tp> struct __libcpp_is_signed<_Tp, false> : public false_type {};
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_signed : public __libcpp_is_signed<_Tp> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_signed_v = is_signed<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_signed)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_SIGNED_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_signed_integer.h b/app/src/main/cpp/libcxx/include/__type_traits/is_signed_integer.h
new file mode 100644
index 0000000..95aa11b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_signed_integer.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_SIGNED_INTEGER_H
+#define _LIBCPP___TYPE_TRAITS_IS_SIGNED_INTEGER_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct __libcpp_is_signed_integer : public false_type {};
+template <> struct __libcpp_is_signed_integer<signed char>      : public true_type {};
+template <> struct __libcpp_is_signed_integer<signed short>     : public true_type {};
+template <> struct __libcpp_is_signed_integer<signed int>       : public true_type {};
+template <> struct __libcpp_is_signed_integer<signed long>      : public true_type {};
+template <> struct __libcpp_is_signed_integer<signed long long> : public true_type {};
+#ifndef _LIBCPP_HAS_NO_INT128
+template <> struct __libcpp_is_signed_integer<__int128_t>       : public true_type {};
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_SIGNED_INTEGER_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_specialization.h b/app/src/main/cpp/libcxx/include/__type_traits/is_specialization.h
new file mode 100644
index 0000000..0cc3667
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_specialization.h
@@ -0,0 +1,45 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_SPECIALIZATION
+#define _LIBCPP___TYPE_TRAITS_IS_SPECIALIZATION
+
+// This contains parts of P2098R1 but is based on MSVC STL's implementation.
+//
+// The paper has been rejected
+//   We will not pursue P2098R0 (std::is_specialization_of) at this time; we'd
+//   like to see a solution to this problem, but it requires language evolution
+//   too.
+//
+// Since it is expected a real solution will be provided in the future only the
+// minimal part is implemented.
+//
+// Note a cvref qualified _Tp is never considered a specialization.
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _Tp, template <class...> class _Template>
+inline constexpr bool __is_specialization_v = false; // true if and only if _Tp is a specialization of _Template
+
+template <template <class...> class _Template, class... _Args>
+inline constexpr bool __is_specialization_v<_Template<_Args...>, _Template> = true;
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_SPECIALIZATION
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_standard_layout.h b/app/src/main/cpp/libcxx/include/__type_traits/is_standard_layout.h
new file mode 100644
index 0000000..12c1712
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_standard_layout.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_STANDARD_LAYOUT_H
+#define _LIBCPP___TYPE_TRAITS_IS_STANDARD_LAYOUT_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_standard_layout
+    : public integral_constant<bool, __is_standard_layout(_Tp)>
+    {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_standard_layout_v = __is_standard_layout(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_STANDARD_LAYOUT_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_swappable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_swappable.h
new file mode 100644
index 0000000..3821de1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_swappable.h
@@ -0,0 +1,165 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_SWAPPABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_SWAPPABLE_H
+
+#include <__config>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_move_assignable.h>
+#include <__type_traits/is_move_constructible.h>
+#include <__type_traits/is_nothrow_move_assignable.h>
+#include <__type_traits/is_nothrow_move_constructible.h>
+#include <__type_traits/is_referenceable.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_void.h>
+#include <__type_traits/nat.h>
+#include <__utility/declval.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct __is_swappable;
+template <class _Tp> struct __is_nothrow_swappable;
+
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Tp>
+using __swap_result_t = typename enable_if<is_move_constructible<_Tp>::value && is_move_assignable<_Tp>::value>::type;
+#else
+template <class>
+using __swap_result_t = void;
+#endif
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX20 __swap_result_t<_Tp>
+swap(_Tp& __x, _Tp& __y) _NOEXCEPT_(is_nothrow_move_constructible<_Tp>::value &&
+                                    is_nothrow_move_assignable<_Tp>::value);
+
+template<class _Tp, size_t _Np>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename enable_if<
+    __is_swappable<_Tp>::value
+>::type
+swap(_Tp (&__a)[_Np], _Tp (&__b)[_Np]) _NOEXCEPT_(__is_nothrow_swappable<_Tp>::value);
+
+namespace __detail
+{
+// ALL generic swap overloads MUST already have a declaration available at this point.
+
+template <class _Tp, class _Up = _Tp,
+          bool _NotVoid = !is_void<_Tp>::value && !is_void<_Up>::value>
+struct __swappable_with
+{
+    template <class _LHS, class _RHS>
+    static decltype(swap(std::declval<_LHS>(), std::declval<_RHS>()))
+    __test_swap(int);
+    template <class, class>
+    static __nat __test_swap(long);
+
+    // Extra parens are needed for the C++03 definition of decltype.
+    typedef decltype((__test_swap<_Tp, _Up>(0))) __swap1;
+    typedef decltype((__test_swap<_Up, _Tp>(0))) __swap2;
+
+    static const bool value = _IsNotSame<__swap1, __nat>::value
+                           && _IsNotSame<__swap2, __nat>::value;
+};
+
+template <class _Tp, class _Up>
+struct __swappable_with<_Tp, _Up,  false> : false_type {};
+
+template <class _Tp, class _Up = _Tp, bool _Swappable = __swappable_with<_Tp, _Up>::value>
+struct __nothrow_swappable_with {
+  static const bool value =
+#ifndef _LIBCPP_HAS_NO_NOEXCEPT
+      noexcept(swap(std::declval<_Tp>(), std::declval<_Up>()))
+  &&  noexcept(swap(std::declval<_Up>(), std::declval<_Tp>()));
+#else
+      false;
+#endif
+};
+
+template <class _Tp, class _Up>
+struct __nothrow_swappable_with<_Tp, _Up, false> : false_type {};
+
+} // namespace __detail
+
+template <class _Tp>
+struct __is_swappable
+    : public integral_constant<bool, __detail::__swappable_with<_Tp&>::value>
+{
+};
+
+template <class _Tp>
+struct __is_nothrow_swappable
+    : public integral_constant<bool, __detail::__nothrow_swappable_with<_Tp&>::value>
+{
+};
+
+#if _LIBCPP_STD_VER > 14
+
+template <class _Tp, class _Up>
+struct _LIBCPP_TEMPLATE_VIS is_swappable_with
+    : public integral_constant<bool, __detail::__swappable_with<_Tp, _Up>::value>
+{
+};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_swappable
+    : public __conditional_t<
+        __libcpp_is_referenceable<_Tp>::value,
+        is_swappable_with<
+            __add_lvalue_reference_t<_Tp>,
+            __add_lvalue_reference_t<_Tp> >,
+        false_type
+    >
+{
+};
+
+template <class _Tp, class _Up>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_swappable_with
+    : public integral_constant<bool, __detail::__nothrow_swappable_with<_Tp, _Up>::value>
+{
+};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_nothrow_swappable
+    : public __conditional_t<
+        __libcpp_is_referenceable<_Tp>::value,
+        is_nothrow_swappable_with<
+            __add_lvalue_reference_t<_Tp>,
+            __add_lvalue_reference_t<_Tp> >,
+        false_type
+    >
+{
+};
+
+template <class _Tp, class _Up>
+inline constexpr bool is_swappable_with_v = is_swappable_with<_Tp, _Up>::value;
+
+template <class _Tp>
+inline constexpr bool is_swappable_v = is_swappable<_Tp>::value;
+
+template <class _Tp, class _Up>
+inline constexpr bool is_nothrow_swappable_with_v = is_nothrow_swappable_with<_Tp, _Up>::value;
+
+template <class _Tp>
+inline constexpr bool is_nothrow_swappable_v = is_nothrow_swappable<_Tp>::value;
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_SWAPPABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_trivial.h b/app/src/main/cpp/libcxx/include/__type_traits/is_trivial.h
new file mode 100644
index 0000000..840770d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_trivial.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_TRIVIAL_H
+#define _LIBCPP___TYPE_TRAITS_IS_TRIVIAL_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_trivial
+    : public integral_constant<bool, __is_trivial(_Tp)>
+    {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_trivial_v = __is_trivial(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_TRIVIAL_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_assignable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_assignable.h
new file mode 100644
index 0000000..9ef101f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_assignable.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_ASSIGNABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_ASSIGNABLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _Arg>
+struct is_trivially_assignable
+    : integral_constant<bool, __is_trivially_assignable(_Tp, _Arg)>
+{ };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp, class _Arg>
+inline constexpr bool is_trivially_assignable_v = __is_trivially_assignable(_Tp, _Arg);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_ASSIGNABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_constructible.h
new file mode 100644
index 0000000..4173e3b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_constructible.h
@@ -0,0 +1,34 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class... _Args>
+struct _LIBCPP_TEMPLATE_VIS is_trivially_constructible
+    : integral_constant<bool, __is_trivially_constructible(_Tp, _Args...)>
+{
+};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp, class... _Args>
+inline constexpr bool is_trivially_constructible_v = __is_trivially_constructible(_Tp, _Args...);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_copy_assignable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_copy_assignable.h
new file mode 100644
index 0000000..e6a4a35
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_copy_assignable.h
@@ -0,0 +1,38 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_COPY_ASSIGNABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_COPY_ASSIGNABLE_H
+
+#include <__config>
+#include <__type_traits/add_const.h>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_trivially_copy_assignable
+    : public integral_constant<
+          bool,
+          __is_trivially_assignable(
+              __add_lvalue_reference_t<_Tp>,
+              __add_lvalue_reference_t<typename add_const<_Tp>::type>)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_trivially_copy_assignable_v = is_trivially_copy_assignable<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_COPY_ASSIGNABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_copy_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_copy_constructible.h
new file mode 100644
index 0000000..4bbb803
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_copy_constructible.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_COPY_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_COPY_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_trivially_copy_constructible
+    : public integral_constant<bool, __is_trivially_constructible(_Tp, __add_lvalue_reference_t<const _Tp>)>
+    {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_trivially_copy_constructible_v = is_trivially_copy_constructible<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_COPY_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_copyable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_copyable.h
new file mode 100644
index 0000000..ef118bf
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_copyable.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_COPYABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_COPYABLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_trivially_copyable
+    : public integral_constant<bool, __is_trivially_copyable(_Tp)>
+    {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_trivially_copyable_v = __is_trivially_copyable(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_COPYABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_default_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_default_constructible.h
new file mode 100644
index 0000000..5c53bd5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_default_constructible.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_DEFAULT_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_DEFAULT_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_trivially_default_constructible
+    : public integral_constant<bool, __is_trivially_constructible(_Tp)>
+    {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_trivially_default_constructible_v = __is_trivially_constructible(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_DEFAULT_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_destructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_destructible.h
new file mode 100644
index 0000000..0239fca
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_destructible.h
@@ -0,0 +1,45 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_DESTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_DESTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_destructible.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_trivially_destructible)
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_trivially_destructible
+    : public integral_constant<bool, __is_trivially_destructible(_Tp)> {};
+
+#elif __has_builtin(__has_trivial_destructor)
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_trivially_destructible
+    : public integral_constant<bool, is_destructible<_Tp>::value && __has_trivial_destructor(_Tp)> {};
+
+#else
+
+#error is_trivially_destructible is not implemented
+
+#endif // __has_builtin(__is_trivially_destructible)
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_trivially_destructible_v = is_trivially_destructible<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_DESTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_move_assignable.h b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_move_assignable.h
new file mode 100644
index 0000000..8f8876f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_move_assignable.h
@@ -0,0 +1,36 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_MOVE_ASSIGNABLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_MOVE_ASSIGNABLE_H
+
+#include <__config>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/add_rvalue_reference.h>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_trivially_move_assignable
+    : public integral_constant<
+          bool,
+          __is_trivially_assignable(__add_lvalue_reference_t<_Tp>, __add_rvalue_reference_t<_Tp>)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_trivially_move_assignable_v = is_trivially_move_assignable<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_MOVE_ASSIGNABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_move_constructible.h b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_move_constructible.h
new file mode 100644
index 0000000..151bb25
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_trivially_move_constructible.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_MOVE_CONSTRUCTIBLE_H
+#define _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_MOVE_CONSTRUCTIBLE_H
+
+#include <__config>
+#include <__type_traits/add_rvalue_reference.h>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_trivially_move_constructible
+    : public integral_constant<bool, __is_trivially_constructible(_Tp, __add_rvalue_reference_t<_Tp>)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_trivially_move_constructible_v = is_trivially_move_constructible<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_TRIVIALLY_MOVE_CONSTRUCTIBLE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_unbounded_array.h b/app/src/main/cpp/libcxx/include/__type_traits/is_unbounded_array.h
new file mode 100644
index 0000000..11a1260
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_unbounded_array.h
@@ -0,0 +1,37 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_UNBOUNDED_ARRAY_H
+#define _LIBCPP___TYPE_TRAITS_IS_UNBOUNDED_ARRAY_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class>     struct _LIBCPP_TEMPLATE_VIS __libcpp_is_unbounded_array        : false_type {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS __libcpp_is_unbounded_array<_Tp[]> : true_type {};
+
+#if _LIBCPP_STD_VER > 17
+
+template <class>     struct _LIBCPP_TEMPLATE_VIS is_unbounded_array        : false_type {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_unbounded_array<_Tp[]> : true_type {};
+
+template <class _Tp>
+inline constexpr
+bool is_unbounded_array_v  = is_unbounded_array<_Tp>::value;
+
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_UNBOUNDED_ARRAY_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_union.h b/app/src/main/cpp/libcxx/include/__type_traits/is_union.h
new file mode 100644
index 0000000..998aedd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_union.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_UNION_H
+#define _LIBCPP___TYPE_TRAITS_IS_UNION_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_union
+    : public integral_constant<bool, __is_union(_Tp)> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_union_v = __is_union(_Tp);
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_UNION_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_unsigned.h b/app/src/main/cpp/libcxx/include/__type_traits/is_unsigned.h
new file mode 100644
index 0000000..3d75409
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_unsigned.h
@@ -0,0 +1,57 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_UNSIGNED_H
+#define _LIBCPP___TYPE_TRAITS_IS_UNSIGNED_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_arithmetic.h>
+#include <__type_traits/is_integral.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_unsigned)
+
+template<class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_unsigned : _BoolConstant<__is_unsigned(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_unsigned_v = __is_unsigned(_Tp);
+#endif
+
+#else // __has_builtin(__is_unsigned)
+
+template <class _Tp, bool = is_integral<_Tp>::value>
+struct __libcpp_is_unsigned_impl : public _BoolConstant<(_Tp(0) < _Tp(-1))> {};
+
+template <class _Tp>
+struct __libcpp_is_unsigned_impl<_Tp, false> : public false_type {};  // floating point
+
+template <class _Tp, bool = is_arithmetic<_Tp>::value>
+struct __libcpp_is_unsigned : public __libcpp_is_unsigned_impl<_Tp> {};
+
+template <class _Tp> struct __libcpp_is_unsigned<_Tp, false> : public false_type {};
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_unsigned : public __libcpp_is_unsigned<_Tp> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_unsigned_v = is_unsigned<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_unsigned)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_UNSIGNED_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_unsigned_integer.h b/app/src/main/cpp/libcxx/include/__type_traits/is_unsigned_integer.h
new file mode 100644
index 0000000..54b29ac
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_unsigned_integer.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_UNSIGNED_INTEGER_H
+#define _LIBCPP___TYPE_TRAITS_IS_UNSIGNED_INTEGER_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> struct __libcpp_is_unsigned_integer : public false_type {};
+template <> struct __libcpp_is_unsigned_integer<unsigned char>      : public true_type {};
+template <> struct __libcpp_is_unsigned_integer<unsigned short>     : public true_type {};
+template <> struct __libcpp_is_unsigned_integer<unsigned int>       : public true_type {};
+template <> struct __libcpp_is_unsigned_integer<unsigned long>      : public true_type {};
+template <> struct __libcpp_is_unsigned_integer<unsigned long long> : public true_type {};
+#ifndef _LIBCPP_HAS_NO_INT128
+template <> struct __libcpp_is_unsigned_integer<__uint128_t>        : public true_type {};
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_UNSIGNED_INTEGER_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_valid_expansion.h b/app/src/main/cpp/libcxx/include/__type_traits/is_valid_expansion.h
new file mode 100644
index 0000000..db7d7e5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_valid_expansion.h
@@ -0,0 +1,31 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_VALID_EXPANSION_H
+#define _LIBCPP___TYPE_TRAITS_IS_VALID_EXPANSION_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <template <class...> class _Templ, class ..._Args, class = _Templ<_Args...> >
+true_type __sfinae_test_impl(int);
+template <template <class...> class, class ...>
+false_type __sfinae_test_impl(...);
+
+template <template <class ...> class _Templ, class ..._Args>
+using _IsValidExpansion _LIBCPP_NODEBUG = decltype(std::__sfinae_test_impl<_Templ, _Args...>(0));
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_VALID_EXPANSION_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_void.h b/app/src/main/cpp/libcxx/include/__type_traits/is_void.h
new file mode 100644
index 0000000..d8ffdbd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_void.h
@@ -0,0 +1,47 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_VOID_H
+#define _LIBCPP___TYPE_TRAITS_IS_VOID_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/remove_cv.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_void)
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_void : _BoolConstant<__is_void(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_void_v = __is_void(_Tp);
+#endif
+
+#else
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_void
+    : public is_same<__remove_cv_t<_Tp>, void> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_void_v = is_void<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_void)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_VOID_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/is_volatile.h b/app/src/main/cpp/libcxx/include/__type_traits/is_volatile.h
new file mode 100644
index 0000000..fb92267
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/is_volatile.h
@@ -0,0 +1,45 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_IS_VOLATILE_H
+#define _LIBCPP___TYPE_TRAITS_IS_VOLATILE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__is_volatile)
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_volatile : _BoolConstant<__is_volatile(_Tp)> { };
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_volatile_v = __is_volatile(_Tp);
+#endif
+
+#else
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_volatile               : public false_type {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS is_volatile<_Tp volatile> : public true_type {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_volatile_v = is_volatile<_Tp>::value;
+#endif
+
+#endif // __has_builtin(__is_volatile)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_IS_VOLATILE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/lazy.h b/app/src/main/cpp/libcxx/include/__type_traits/lazy.h
new file mode 100644
index 0000000..6874b06
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/lazy.h
@@ -0,0 +1,25 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_LAZY_H
+#define _LIBCPP___TYPE_TRAITS_LAZY_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <template <class...> class _Func, class ..._Args>
+struct _Lazy : _Func<_Args...> {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_LAZY_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/make_32_64_or_128_bit.h b/app/src/main/cpp/libcxx/include/__type_traits/make_32_64_or_128_bit.h
new file mode 100644
index 0000000..87340ea
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/make_32_64_or_128_bit.h
@@ -0,0 +1,48 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_MAKE_32_64_OR_128_BIT_H
+#define _LIBCPP___TYPE_TRAITS_MAKE_32_64_OR_128_BIT_H
+
+#include <__config>
+#include <__type_traits/conditional.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_signed.h>
+#include <__type_traits/is_unsigned.h>
+#include <__type_traits/make_unsigned.h>
+#include <cstdint>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+/// Helper to promote an integral to smallest 32, 64, or 128 bit representation.
+///
+/// The restriction is the same as the integral version of to_char.
+template <class _Tp>
+#if _LIBCPP_STD_VER > 17
+  requires (is_signed_v<_Tp> || is_unsigned_v<_Tp> || is_same_v<_Tp, char>)
+#endif
+using __make_32_64_or_128_bit_t =
+  __copy_unsigned_t<_Tp,
+    __conditional_t<sizeof(_Tp) <= sizeof(int32_t),    int32_t,
+    __conditional_t<sizeof(_Tp) <= sizeof(int64_t),    int64_t,
+#ifndef _LIBCPP_HAS_NO_INT128
+    __conditional_t<sizeof(_Tp) <= sizeof(__int128_t), __int128_t,
+    /* else */                                         void>
+#else
+    /* else */                                         void
+#endif
+    > >
+  >;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_MAKE_32_64_OR_128_BIT_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/make_const_lvalue_ref.h b/app/src/main/cpp/libcxx/include/__type_traits/make_const_lvalue_ref.h
new file mode 100644
index 0000000..deea40d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/make_const_lvalue_ref.h
@@ -0,0 +1,26 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_MAKE_CONST_LVALUE_REF_H
+#define _LIBCPP___TYPE_TRAITS_MAKE_CONST_LVALUE_REF_H
+
+#include <__config>
+#include <__type_traits/remove_reference.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Tp>
+using __make_const_lvalue_ref = const __libcpp_remove_reference_t<_Tp>&;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_MAKE_CONST_LVALUE_REF_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/make_signed.h b/app/src/main/cpp/libcxx/include/__type_traits/make_signed.h
new file mode 100644
index 0000000..bff8744
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/make_signed.h
@@ -0,0 +1,86 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_MAKE_SIGNED_H
+#define _LIBCPP___TYPE_TRAITS_MAKE_SIGNED_H
+
+#include <__config>
+#include <__type_traits/apply_cv.h>
+#include <__type_traits/is_enum.h>
+#include <__type_traits/is_integral.h>
+#include <__type_traits/nat.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/type_list.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__make_signed)
+
+template <class _Tp>
+using __make_signed_t = __make_signed(_Tp);
+
+#else
+typedef
+    __type_list<signed char,
+    __type_list<signed short,
+    __type_list<signed int,
+    __type_list<signed long,
+    __type_list<signed long long,
+#  ifndef _LIBCPP_HAS_NO_INT128
+    __type_list<__int128_t,
+#  endif
+    __nat
+#  ifndef _LIBCPP_HAS_NO_INT128
+    >
+#  endif
+    > > > > > __signed_types;
+
+template <class _Tp, bool = is_integral<_Tp>::value || is_enum<_Tp>::value>
+struct __make_signed {};
+
+template <class _Tp>
+struct __make_signed<_Tp, true>
+{
+    typedef typename __find_first<__signed_types, sizeof(_Tp)>::type type;
+};
+
+template <> struct __make_signed<bool,               true> {};
+template <> struct __make_signed<  signed short,     true> {typedef short     type;};
+template <> struct __make_signed<unsigned short,     true> {typedef short     type;};
+template <> struct __make_signed<  signed int,       true> {typedef int       type;};
+template <> struct __make_signed<unsigned int,       true> {typedef int       type;};
+template <> struct __make_signed<  signed long,      true> {typedef long      type;};
+template <> struct __make_signed<unsigned long,      true> {typedef long      type;};
+template <> struct __make_signed<  signed long long, true> {typedef long long type;};
+template <> struct __make_signed<unsigned long long, true> {typedef long long type;};
+#  ifndef _LIBCPP_HAS_NO_INT128
+template <> struct __make_signed<__int128_t,         true> {typedef __int128_t type;};
+template <> struct __make_signed<__uint128_t,        true> {typedef __int128_t type;};
+#  endif
+
+template <class _Tp>
+using __make_signed_t = typename __apply_cv<_Tp, typename __make_signed<__remove_cv_t<_Tp> >::type>::type;
+
+#endif // __has_builtin(__make_signed)
+
+template <class _Tp>
+struct make_signed {
+  using type _LIBCPP_NODEBUG = __make_signed_t<_Tp>;
+};
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using make_signed_t = __make_signed_t<_Tp>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_MAKE_SIGNED_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/make_unsigned.h b/app/src/main/cpp/libcxx/include/__type_traits/make_unsigned.h
new file mode 100644
index 0000000..33c3014
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/make_unsigned.h
@@ -0,0 +1,99 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_MAKE_UNSIGNED_H
+#define _LIBCPP___TYPE_TRAITS_MAKE_UNSIGNED_H
+
+#include <__config>
+#include <__type_traits/apply_cv.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/is_enum.h>
+#include <__type_traits/is_integral.h>
+#include <__type_traits/is_unsigned.h>
+#include <__type_traits/nat.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/type_list.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__make_unsigned)
+
+template <class _Tp>
+using __make_unsigned_t = __make_unsigned(_Tp);
+
+#else
+typedef
+    __type_list<unsigned char,
+    __type_list<unsigned short,
+    __type_list<unsigned int,
+    __type_list<unsigned long,
+    __type_list<unsigned long long,
+#  ifndef _LIBCPP_HAS_NO_INT128
+    __type_list<__uint128_t,
+#  endif
+    __nat
+#  ifndef _LIBCPP_HAS_NO_INT128
+    >
+#  endif
+    > > > > > __unsigned_types;
+
+template <class _Tp, bool = is_integral<_Tp>::value || is_enum<_Tp>::value>
+struct __make_unsigned {};
+
+template <class _Tp>
+struct __make_unsigned<_Tp, true>
+{
+    typedef typename __find_first<__unsigned_types, sizeof(_Tp)>::type type;
+};
+
+template <> struct __make_unsigned<bool,               true> {};
+template <> struct __make_unsigned<  signed short,     true> {typedef unsigned short     type;};
+template <> struct __make_unsigned<unsigned short,     true> {typedef unsigned short     type;};
+template <> struct __make_unsigned<  signed int,       true> {typedef unsigned int       type;};
+template <> struct __make_unsigned<unsigned int,       true> {typedef unsigned int       type;};
+template <> struct __make_unsigned<  signed long,      true> {typedef unsigned long      type;};
+template <> struct __make_unsigned<unsigned long,      true> {typedef unsigned long      type;};
+template <> struct __make_unsigned<  signed long long, true> {typedef unsigned long long type;};
+template <> struct __make_unsigned<unsigned long long, true> {typedef unsigned long long type;};
+#  ifndef _LIBCPP_HAS_NO_INT128
+template <> struct __make_unsigned<__int128_t,         true> {typedef __uint128_t        type;};
+template <> struct __make_unsigned<__uint128_t,        true> {typedef __uint128_t        type;};
+#  endif
+
+template <class _Tp>
+using __make_unsigned_t = typename __apply_cv<_Tp, typename __make_unsigned<__remove_cv_t<_Tp> >::type>::type;
+
+#endif // __has_builtin(__make_unsigned)
+
+template <class _Tp>
+struct make_unsigned {
+  using type _LIBCPP_NODEBUG = __make_unsigned_t<_Tp>;
+};
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using make_unsigned_t = __make_unsigned_t<_Tp>;
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr
+__make_unsigned_t<_Tp> __to_unsigned_like(_Tp __x) noexcept {
+    return static_cast<__make_unsigned_t<_Tp> >(__x);
+}
+#endif
+
+template <class _Tp, class _Up>
+using __copy_unsigned_t = __conditional_t<is_unsigned<_Tp>::value, __make_unsigned_t<_Up>, _Up>;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_MAKE_UNSIGNED_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/maybe_const.h b/app/src/main/cpp/libcxx/include/__type_traits/maybe_const.h
new file mode 100644
index 0000000..8403f6a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/maybe_const.h
@@ -0,0 +1,26 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_MAYBE_CONST_H
+#define _LIBCPP___TYPE_TRAITS_MAYBE_CONST_H
+
+#include <__config>
+#include <__type_traits/conditional.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<bool _Const, class _Tp>
+using __maybe_const = __conditional_t<_Const, const _Tp, _Tp>;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_MAYBE_CONST_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/nat.h b/app/src/main/cpp/libcxx/include/__type_traits/nat.h
new file mode 100644
index 0000000..5216ef5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/nat.h
@@ -0,0 +1,32 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_NAT_H
+#define _LIBCPP___TYPE_TRAITS_NAT_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+struct __nat
+{
+#ifndef _LIBCPP_CXX03_LANG
+    __nat() = delete;
+    __nat(const __nat&) = delete;
+    __nat& operator=(const __nat&) = delete;
+    ~__nat() = delete;
+#endif
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_NAT_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/negation.h b/app/src/main/cpp/libcxx/include/__type_traits/negation.h
new file mode 100644
index 0000000..b72f285
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/negation.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_NEGATION_H
+#define _LIBCPP___TYPE_TRAITS_NEGATION_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Pred>
+struct _Not : _BoolConstant<!_Pred::value> {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+struct negation : _Not<_Tp> {};
+template<class _Tp>
+inline constexpr bool negation_v = !_Tp::value;
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_NEGATION_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/noexcept_move_assign_container.h b/app/src/main/cpp/libcxx/include/__type_traits/noexcept_move_assign_container.h
new file mode 100644
index 0000000..35b0e51
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/noexcept_move_assign_container.h
@@ -0,0 +1,35 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_NOEXCEPT_MOVE_ASSIGN_CONTAINER_H
+#define _LIBCPP___TYPE_TRAITS_NOEXCEPT_MOVE_ASSIGN_CONTAINER_H
+
+#include <__config>
+#include <__memory/allocator_traits.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_nothrow_move_assignable.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <typename _Alloc, typename _Traits=allocator_traits<_Alloc> >
+struct __noexcept_move_assign_container : public integral_constant<bool,
+    _Traits::propagate_on_container_move_assignment::value
+#if _LIBCPP_STD_VER > 14
+        || _Traits::is_always_equal::value
+#else
+        && is_nothrow_move_assignable<_Alloc>::value
+#endif
+    > {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_NOEXCEPT_MOVE_ASSIGN_CONTAINER_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/promote.h b/app/src/main/cpp/libcxx/include/__type_traits/promote.h
new file mode 100644
index 0000000..c2af327
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/promote.h
@@ -0,0 +1,99 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_PROMOTE_H
+#define _LIBCPP___TYPE_TRAITS_PROMOTE_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_same.h>
+#include <__utility/declval.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct __numeric_type
+{
+   static void __test(...);
+   static float __test(float);
+   static double __test(char);
+   static double __test(int);
+   static double __test(unsigned);
+   static double __test(long);
+   static double __test(unsigned long);
+   static double __test(long long);
+   static double __test(unsigned long long);
+#ifndef _LIBCPP_HAS_NO_INT128
+   static double __test(__int128_t);
+   static double __test(__uint128_t);
+#endif
+   static double __test(double);
+   static long double __test(long double);
+
+   typedef decltype(__test(std::declval<_Tp>())) type;
+   static const bool value = _IsNotSame<type, void>::value;
+};
+
+template <>
+struct __numeric_type<void>
+{
+   static const bool value = true;
+};
+
+template <class _A1, class _A2 = void, class _A3 = void,
+          bool = __numeric_type<_A1>::value &&
+                 __numeric_type<_A2>::value &&
+                 __numeric_type<_A3>::value>
+class __promote_imp
+{
+public:
+    static const bool value = false;
+};
+
+template <class _A1, class _A2, class _A3>
+class __promote_imp<_A1, _A2, _A3, true>
+{
+private:
+    typedef typename __promote_imp<_A1>::type __type1;
+    typedef typename __promote_imp<_A2>::type __type2;
+    typedef typename __promote_imp<_A3>::type __type3;
+public:
+    typedef decltype(__type1() + __type2() + __type3()) type;
+    static const bool value = true;
+};
+
+template <class _A1, class _A2>
+class __promote_imp<_A1, _A2, void, true>
+{
+private:
+    typedef typename __promote_imp<_A1>::type __type1;
+    typedef typename __promote_imp<_A2>::type __type2;
+public:
+    typedef decltype(__type1() + __type2()) type;
+    static const bool value = true;
+};
+
+template <class _A1>
+class __promote_imp<_A1, void, void, true>
+{
+public:
+    typedef typename __numeric_type<_A1>::type type;
+    static const bool value = true;
+};
+
+template <class _A1, class _A2 = void, class _A3 = void>
+class __promote : public __promote_imp<_A1, _A2, _A3> {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_PROMOTE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/rank.h b/app/src/main/cpp/libcxx/include/__type_traits/rank.h
new file mode 100644
index 0000000..9950907
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/rank.h
@@ -0,0 +1,46 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_RANK_H
+#define _LIBCPP___TYPE_TRAITS_RANK_H
+
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// TODO: Enable using the builtin __array_rank when https://llvm.org/PR57133 is resolved
+#if __has_builtin(__array_rank) && 0
+
+template <class _Tp>
+struct rank : integral_constant<size_t, __array_rank(_Tp)> {};
+
+#else
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS rank
+    : public integral_constant<size_t, 0> {};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS rank<_Tp[]>
+    : public integral_constant<size_t, rank<_Tp>::value + 1> {};
+template <class _Tp, size_t _Np> struct _LIBCPP_TEMPLATE_VIS rank<_Tp[_Np]>
+    : public integral_constant<size_t, rank<_Tp>::value + 1> {};
+
+#endif // __has_builtin(__array_rank)
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr size_t rank_v = rank<_Tp>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_RANK_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/remove_all_extents.h b/app/src/main/cpp/libcxx/include/__type_traits/remove_all_extents.h
new file mode 100644
index 0000000..868cf10
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/remove_all_extents.h
@@ -0,0 +1,47 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_REMOVE_ALL_EXTENTS_H
+#define _LIBCPP___TYPE_TRAITS_REMOVE_ALL_EXTENTS_H
+
+#include <__config>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__remove_all_extents)
+template <class _Tp>
+struct remove_all_extents {
+  using type _LIBCPP_NODEBUG = __remove_all_extents(_Tp);
+};
+
+template <class _Tp>
+using __remove_all_extents_t = __remove_all_extents(_Tp);
+#else
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_all_extents
+    {typedef _Tp type;};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_all_extents<_Tp[]>
+    {typedef typename remove_all_extents<_Tp>::type type;};
+template <class _Tp, size_t _Np> struct _LIBCPP_TEMPLATE_VIS remove_all_extents<_Tp[_Np]>
+    {typedef typename remove_all_extents<_Tp>::type type;};
+
+template <class _Tp>
+using __remove_all_extents_t = typename remove_all_extents<_Tp>::type;
+#endif // __has_builtin(__remove_all_extents)
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using remove_all_extents_t = __remove_all_extents_t<_Tp>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_REMOVE_ALL_EXTENTS_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/remove_const.h b/app/src/main/cpp/libcxx/include/__type_traits/remove_const.h
new file mode 100644
index 0000000..dc56533
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/remove_const.h
@@ -0,0 +1,42 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_REMOVE_CONST_H
+#define _LIBCPP___TYPE_TRAITS_REMOVE_CONST_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__remove_const)
+template <class _Tp>
+struct remove_const {
+  using type _LIBCPP_NODEBUG = __remove_const(_Tp);
+};
+
+template <class _Tp>
+using __remove_const_t = __remove_const(_Tp);
+#else
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_const            {typedef _Tp type;};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_const<const _Tp> {typedef _Tp type;};
+
+template <class _Tp>
+using __remove_const_t = typename remove_const<_Tp>::type;
+#endif // __has_builtin(__remove_const)
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using remove_const_t = __remove_const_t<_Tp>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_REMOVE_CONST_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/remove_const_ref.h b/app/src/main/cpp/libcxx/include/__type_traits/remove_const_ref.h
new file mode 100644
index 0000000..d3b3349
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/remove_const_ref.h
@@ -0,0 +1,27 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_REMOVE_CONST_REF_H
+#define _LIBCPP___TYPE_TRAITS_REMOVE_CONST_REF_H
+
+#include <__config>
+#include <__type_traits/remove_const.h>
+#include <__type_traits/remove_reference.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+using __remove_const_ref_t = __remove_const_t<__libcpp_remove_reference_t<_Tp> >;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_REMOVE_CONST_REF_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/remove_cv.h b/app/src/main/cpp/libcxx/include/__type_traits/remove_cv.h
new file mode 100644
index 0000000..ea85e23
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/remove_cv.h
@@ -0,0 +1,44 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_REMOVE_CV_H
+#define _LIBCPP___TYPE_TRAITS_REMOVE_CV_H
+
+#include <__config>
+#include <__type_traits/remove_const.h>
+#include <__type_traits/remove_volatile.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__remove_cv)
+template <class _Tp>
+struct remove_cv {
+  using type _LIBCPP_NODEBUG = __remove_cv(_Tp);
+};
+
+template <class _Tp>
+using __remove_cv_t = __remove_cv(_Tp);
+#else
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_cv
+{typedef __remove_volatile_t<__remove_const_t<_Tp> > type;};
+
+template <class _Tp>
+using __remove_cv_t = __remove_volatile_t<__remove_const_t<_Tp> >;
+#endif // __has_builtin(__remove_cv)
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using remove_cv_t = __remove_cv_t<_Tp>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_REMOVE_CV_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/remove_cvref.h b/app/src/main/cpp/libcxx/include/__type_traits/remove_cvref.h
new file mode 100644
index 0000000..e96cc65
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/remove_cvref.h
@@ -0,0 +1,45 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_REMOVE_CVREF_H
+#define _LIBCPP___TYPE_TRAITS_REMOVE_CVREF_H
+
+#include <__config>
+#include <__type_traits/is_same.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/remove_reference.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__remove_cvref)
+template <class _Tp>
+using __remove_cvref_t _LIBCPP_NODEBUG = __remove_cvref(_Tp);
+#else
+template <class _Tp>
+using __remove_cvref_t _LIBCPP_NODEBUG = __remove_cv_t<__libcpp_remove_reference_t<_Tp> >;
+#endif // __has_builtin(__remove_cvref)
+
+template <class _Tp, class _Up>
+struct __is_same_uncvref : _IsSame<__remove_cvref_t<_Tp>, __remove_cvref_t<_Up> > {};
+
+#if _LIBCPP_STD_VER > 17
+template <class _Tp>
+struct remove_cvref {
+    using type _LIBCPP_NODEBUG = __remove_cvref_t<_Tp>;
+};
+
+template <class _Tp> using remove_cvref_t = __remove_cvref_t<_Tp>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_REMOVE_CVREF_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/remove_extent.h b/app/src/main/cpp/libcxx/include/__type_traits/remove_extent.h
new file mode 100644
index 0000000..79d6e57
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/remove_extent.h
@@ -0,0 +1,47 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_REMOVE_EXTENT_H
+#define _LIBCPP___TYPE_TRAITS_REMOVE_EXTENT_H
+
+#include <__config>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__remove_extent)
+template <class _Tp>
+struct remove_extent {
+  using type _LIBCPP_NODEBUG = __remove_extent(_Tp);
+};
+
+template <class _Tp>
+using __remove_extent_t = __remove_extent(_Tp);
+#else
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_extent
+    {typedef _Tp type;};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_extent<_Tp[]>
+    {typedef _Tp type;};
+template <class _Tp, size_t _Np> struct _LIBCPP_TEMPLATE_VIS remove_extent<_Tp[_Np]>
+    {typedef _Tp type;};
+
+template <class _Tp>
+using __remove_extent_t = typename remove_extent<_Tp>::type;
+#endif // __has_builtin(__remove_extent)
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using remove_extent_t = __remove_extent_t<_Tp>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_REMOVE_EXTENT_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/remove_pointer.h b/app/src/main/cpp/libcxx/include/__type_traits/remove_pointer.h
new file mode 100644
index 0000000..33ddb71
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/remove_pointer.h
@@ -0,0 +1,45 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_REMOVE_POINTER_H
+#define _LIBCPP___TYPE_TRAITS_REMOVE_POINTER_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__remove_pointer)
+template <class _Tp>
+struct remove_pointer {
+  using type _LIBCPP_NODEBUG = __remove_pointer(_Tp);
+};
+
+template <class _Tp>
+using __remove_pointer_t = __remove_pointer(_Tp);
+#else
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_pointer                      {typedef _LIBCPP_NODEBUG _Tp type;};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_pointer<_Tp*>                {typedef _LIBCPP_NODEBUG _Tp type;};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_pointer<_Tp* const>          {typedef _LIBCPP_NODEBUG _Tp type;};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_pointer<_Tp* volatile>       {typedef _LIBCPP_NODEBUG _Tp type;};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_pointer<_Tp* const volatile> {typedef _LIBCPP_NODEBUG _Tp type;};
+
+template <class _Tp>
+using __remove_pointer_t = typename remove_pointer<_Tp>::type;
+#endif // __has_builtin(__remove_pointer)
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using remove_pointer_t = __remove_pointer_t<_Tp>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_REMOVE_POINTER_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/remove_reference.h b/app/src/main/cpp/libcxx/include/__type_traits/remove_reference.h
new file mode 100644
index 0000000..b9a6974
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/remove_reference.h
@@ -0,0 +1,44 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_REMOVE_REFERENCE_H
+#define _LIBCPP___TYPE_TRAITS_REMOVE_REFERENCE_H
+
+#include <__config>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__remove_reference_t)
+template <class _Tp>
+struct remove_reference {
+  using type _LIBCPP_NODEBUG = __remove_reference_t(_Tp);
+};
+
+template <class _Tp>
+using __libcpp_remove_reference_t = __remove_reference_t(_Tp);
+#else
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_reference        {typedef _LIBCPP_NODEBUG _Tp type;};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_reference<_Tp&>  {typedef _LIBCPP_NODEBUG _Tp type;};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_reference<_Tp&&> {typedef _LIBCPP_NODEBUG _Tp type;};
+
+template <class _Tp>
+using __libcpp_remove_reference_t = typename remove_reference<_Tp>::type;
+#endif // __has_builtin(__remove_reference_t)
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using remove_reference_t = __libcpp_remove_reference_t<_Tp>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_REMOVE_REFERENCE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/remove_volatile.h b/app/src/main/cpp/libcxx/include/__type_traits/remove_volatile.h
new file mode 100644
index 0000000..ed6d63b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/remove_volatile.h
@@ -0,0 +1,42 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_REMOVE_VOLATILE_H
+#define _LIBCPP___TYPE_TRAITS_REMOVE_VOLATILE_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if __has_builtin(__remove_volatile)
+template <class _Tp>
+struct remove_volatile {
+  using type _LIBCPP_NODEBUG = __remove_volatile(_Tp);
+};
+
+template <class _Tp>
+using __remove_volatile_t = __remove_volatile(_Tp);
+#else
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_volatile               {typedef _Tp type;};
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS remove_volatile<volatile _Tp> {typedef _Tp type;};
+
+template <class _Tp>
+using __remove_volatile_t = typename remove_volatile<_Tp>::type;
+#endif // __has_builtin(__remove_volatile)
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using remove_volatile_t = __remove_volatile_t<_Tp>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_REMOVE_VOLATILE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/result_of.h b/app/src/main/cpp/libcxx/include/__type_traits/result_of.h
new file mode 100644
index 0000000..804173e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/result_of.h
@@ -0,0 +1,39 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_RESULT_OF_H
+#define _LIBCPP___TYPE_TRAITS_RESULT_OF_H
+
+#include <__config>
+#include <__functional/invoke.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// result_of
+
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_TYPE_TRAITS)
+template <class _Callable> class _LIBCPP_DEPRECATED_IN_CXX17 result_of;
+
+template <class _Fp, class ..._Args>
+class _LIBCPP_TEMPLATE_VIS result_of<_Fp(_Args...)>
+    : public __invoke_of<_Fp, _Args...>
+{
+};
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using result_of_t _LIBCPP_DEPRECATED_IN_CXX17 = typename result_of<_Tp>::type;
+#endif // _LIBCPP_STD_VER > 11
+#endif // _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_TYPE_TRAITS)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_RESULT_OF_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/strip_signature.h b/app/src/main/cpp/libcxx/include/__type_traits/strip_signature.h
new file mode 100644
index 0000000..2bb7393
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/strip_signature.h
@@ -0,0 +1,79 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_STRIP_SIGNATURE_H
+#define _LIBCPP___TYPE_TRAITS_STRIP_SIGNATURE_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER >= 17
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Fp>
+struct __strip_signature;
+
+#  if defined(__cpp_static_call_operator) && __cpp_static_call_operator >= 202207L
+
+template <class _Rp, class... _Args>
+struct __strip_signature<_Rp(*)(_Args...)> {
+  using type = _Rp(_Args...);
+};
+
+template <class _Rp, class... _Args>
+struct __strip_signature<_Rp(*)(_Args...) noexcept> {
+  using type = _Rp(_Args...);
+};
+
+#  endif // defined(__cpp_static_call_operator) && __cpp_static_call_operator >= 202207L
+
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...)> { using type = _Rp(_Ap...); };
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) const> { using type = _Rp(_Ap...); };
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) volatile> { using type = _Rp(_Ap...); };
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) const volatile> { using type = _Rp(_Ap...); };
+
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) &> { using type = _Rp(_Ap...); };
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) const &> { using type = _Rp(_Ap...); };
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) volatile &> { using type = _Rp(_Ap...); };
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) const volatile &> { using type = _Rp(_Ap...); };
+
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) noexcept> { using type = _Rp(_Ap...); };
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) const noexcept> { using type = _Rp(_Ap...); };
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) volatile noexcept> { using type = _Rp(_Ap...); };
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) const volatile noexcept> { using type = _Rp(_Ap...); };
+
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) & noexcept> { using type = _Rp(_Ap...); };
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) const & noexcept> { using type = _Rp(_Ap...); };
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) volatile & noexcept> { using type = _Rp(_Ap...); };
+template<class _Rp, class _Gp, class ..._Ap>
+struct __strip_signature<_Rp (_Gp::*) (_Ap...) const volatile & noexcept> { using type = _Rp(_Ap...); };
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 17
+
+#endif // _LIBCPP___TYPE_TRAITS_STRIP_SIGNATURE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/type_identity.h b/app/src/main/cpp/libcxx/include/__type_traits/type_identity.h
new file mode 100644
index 0000000..42e52b1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/type_identity.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_TYPE_IDENTITY_H
+#define _LIBCPP___TYPE_TRAITS_TYPE_IDENTITY_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct __type_identity { typedef _Tp type; };
+
+template <class _Tp>
+using __type_identity_t _LIBCPP_NODEBUG = typename __type_identity<_Tp>::type;
+
+#if _LIBCPP_STD_VER > 17
+template<class _Tp> struct type_identity { typedef _Tp type; };
+template<class _Tp> using type_identity_t = typename type_identity<_Tp>::type;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_TYPE_IDENTITY_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/type_list.h b/app/src/main/cpp/libcxx/include/__type_traits/type_list.h
new file mode 100644
index 0000000..5a9e331
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/type_list.h
@@ -0,0 +1,44 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_TYPE_LIST_H
+#define _LIBCPP___TYPE_TRAITS_TYPE_LIST_H
+
+#include <__config>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Hp, class _Tp>
+struct __type_list
+{
+    typedef _Hp _Head;
+    typedef _Tp _Tail;
+};
+
+template <class _TypeList, size_t _Size, bool = _Size <= sizeof(typename _TypeList::_Head)> struct __find_first;
+
+template <class _Hp, class _Tp, size_t _Size>
+struct __find_first<__type_list<_Hp, _Tp>, _Size, true>
+{
+    typedef _LIBCPP_NODEBUG _Hp type;
+};
+
+template <class _Hp, class _Tp, size_t _Size>
+struct __find_first<__type_list<_Hp, _Tp>, _Size, false>
+{
+    typedef _LIBCPP_NODEBUG typename __find_first<_Tp, _Size>::type type;
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_TYPE_LIST_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/underlying_type.h b/app/src/main/cpp/libcxx/include/__type_traits/underlying_type.h
new file mode 100644
index 0000000..1c8db64
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/underlying_type.h
@@ -0,0 +1,41 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_UNDERLYING_TYPE_H
+#define _LIBCPP___TYPE_TRAITS_UNDERLYING_TYPE_H
+
+#include <__config>
+#include <__type_traits/is_enum.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, bool = is_enum<_Tp>::value> struct __underlying_type_impl;
+
+template <class _Tp>
+struct __underlying_type_impl<_Tp, false> {};
+
+template <class _Tp>
+struct __underlying_type_impl<_Tp, true>
+{
+    typedef __underlying_type(_Tp) type;
+};
+
+template <class _Tp>
+struct underlying_type : __underlying_type_impl<_Tp, is_enum<_Tp>::value> {};
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp> using underlying_type_t = typename underlying_type<_Tp>::type;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_UNDERLYING_TYPE_H
diff --git a/app/src/main/cpp/libcxx/include/__type_traits/void_t.h b/app/src/main/cpp/libcxx/include/__type_traits/void_t.h
new file mode 100644
index 0000000..1ed4e43
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__type_traits/void_t.h
@@ -0,0 +1,29 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___TYPE_TRAITS_VOID_T_H
+#define _LIBCPP___TYPE_TRAITS_VOID_T_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+template <class...> using void_t = void;
+#endif
+
+template <class...>
+using __void_t = void;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___TYPE_TRAITS_VOID_T_H
diff --git a/app/src/main/cpp/libcxx/include/__undef_macros b/app/src/main/cpp/libcxx/include/__undef_macros
new file mode 100644
index 0000000..3bacbba
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__undef_macros
@@ -0,0 +1,16 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifdef min
+#  undef min
+#endif
+
+#ifdef max
+#  undef max
+#endif
diff --git a/app/src/main/cpp/libcxx/include/__utility/as_const.h b/app/src/main/cpp/libcxx/include/__utility/as_const.h
new file mode 100644
index 0000000..d4a72f4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/as_const.h
@@ -0,0 +1,33 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_AS_CONST_H
+#define _LIBCPP___UTILITY_AS_CONST_H
+
+#include <__config>
+#include <__type_traits/add_const.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr add_const_t<_Tp>& as_const(_Tp& __t) noexcept { return __t; }
+
+template <class _Tp>
+void as_const(const _Tp&&) = delete;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_AS_CONST_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/auto_cast.h b/app/src/main/cpp/libcxx/include/__utility/auto_cast.h
new file mode 100644
index 0000000..381ed0c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/auto_cast.h
@@ -0,0 +1,22 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_AUTO_CAST_H
+#define _LIBCPP___UTILITY_AUTO_CAST_H
+
+#include <__config>
+#include <__type_traits/decay.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#define _LIBCPP_AUTO_CAST(expr) static_cast<typename decay<decltype((expr))>::type>(expr)
+
+#endif // _LIBCPP___UTILITY_AUTO_CAST_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/cmp.h b/app/src/main/cpp/libcxx/include/__utility/cmp.h
new file mode 100644
index 0000000..d448a1d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/cmp.h
@@ -0,0 +1,111 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_CMP_H
+#define _LIBCPP___UTILITY_CMP_H
+
+#include <__config>
+#include <__type_traits/disjunction.h>
+#include <__type_traits/is_integral.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_signed.h>
+#include <__type_traits/make_unsigned.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+template<class _Tp, class... _Up>
+struct _IsSameAsAny : _Or<_IsSame<_Tp, _Up>...> {};
+
+template<class _Tp>
+concept __is_safe_integral_cmp = is_integral_v<_Tp> &&
+                      !_IsSameAsAny<_Tp, bool, char, char16_t, char32_t
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+                                    , char8_t
+#endif
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+                                    , wchar_t
+#endif
+                                    >::value;
+
+template<__is_safe_integral_cmp _Tp, __is_safe_integral_cmp _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool cmp_equal(_Tp __t, _Up __u) noexcept
+{
+  if constexpr (is_signed_v<_Tp> == is_signed_v<_Up>)
+    return __t == __u;
+  else if constexpr (is_signed_v<_Tp>)
+    return __t < 0 ? false : make_unsigned_t<_Tp>(__t) == __u;
+  else
+    return __u < 0 ? false : __t == make_unsigned_t<_Up>(__u);
+}
+
+template<__is_safe_integral_cmp _Tp, __is_safe_integral_cmp _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool cmp_not_equal(_Tp __t, _Up __u) noexcept
+{
+  return !_VSTD::cmp_equal(__t, __u);
+}
+
+template<__is_safe_integral_cmp _Tp, __is_safe_integral_cmp _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool cmp_less(_Tp __t, _Up __u) noexcept
+{
+  if constexpr (is_signed_v<_Tp> == is_signed_v<_Up>)
+    return __t < __u;
+  else if constexpr (is_signed_v<_Tp>)
+    return __t < 0 ? true : make_unsigned_t<_Tp>(__t) < __u;
+  else
+    return __u < 0 ? false : __t < make_unsigned_t<_Up>(__u);
+}
+
+template<__is_safe_integral_cmp _Tp, __is_safe_integral_cmp _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool cmp_greater(_Tp __t, _Up __u) noexcept
+{
+  return _VSTD::cmp_less(__u, __t);
+}
+
+template<__is_safe_integral_cmp _Tp, __is_safe_integral_cmp _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool cmp_less_equal(_Tp __t, _Up __u) noexcept
+{
+  return !_VSTD::cmp_greater(__t, __u);
+}
+
+template<__is_safe_integral_cmp _Tp, __is_safe_integral_cmp _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool cmp_greater_equal(_Tp __t, _Up __u) noexcept
+{
+  return !_VSTD::cmp_less(__t, __u);
+}
+
+template<__is_safe_integral_cmp _Tp, __is_safe_integral_cmp _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool in_range(_Up __u) noexcept
+{
+  return _VSTD::cmp_less_equal(__u, numeric_limits<_Tp>::max()) &&
+         _VSTD::cmp_greater_equal(__u, numeric_limits<_Tp>::min());
+}
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP___UTILITY_CMP_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/convert_to_integral.h b/app/src/main/cpp/libcxx/include/__utility/convert_to_integral.h
new file mode 100644
index 0000000..0cc858a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/convert_to_integral.h
@@ -0,0 +1,72 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_CONVERT_TO_INTEGRAL_H
+#define _LIBCPP___UTILITY_CONVERT_TO_INTEGRAL_H
+
+#include <__config>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_enum.h>
+#include <__type_traits/is_floating_point.h>
+#include <__type_traits/underlying_type.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+int __convert_to_integral(int __val) { return __val; }
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+unsigned __convert_to_integral(unsigned __val) { return __val; }
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+long __convert_to_integral(long __val) { return __val; }
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+unsigned long __convert_to_integral(unsigned long __val) { return __val; }
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+long long __convert_to_integral(long long __val) { return __val; }
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+unsigned long long __convert_to_integral(unsigned long long __val) {return __val; }
+
+template<typename _Fp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+typename enable_if<is_floating_point<_Fp>::value, long long>::type
+ __convert_to_integral(_Fp __val) { return __val; }
+
+#ifndef _LIBCPP_HAS_NO_INT128
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+__int128_t __convert_to_integral(__int128_t __val) { return __val; }
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+__uint128_t __convert_to_integral(__uint128_t __val) { return __val; }
+#endif
+
+template <class _Tp, bool = is_enum<_Tp>::value>
+struct __sfinae_underlying_type
+{
+    typedef typename underlying_type<_Tp>::type type;
+    typedef decltype(((type)1) + 0) __promoted_type;
+};
+
+template <class _Tp>
+struct __sfinae_underlying_type<_Tp, false> {};
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+typename __sfinae_underlying_type<_Tp>::__promoted_type
+__convert_to_integral(_Tp __val) { return __val; }
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_CONVERT_TO_INTEGRAL_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/declval.h b/app/src/main/cpp/libcxx/include/__utility/declval.h
new file mode 100644
index 0000000..c2f4bec
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/declval.h
@@ -0,0 +1,34 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_DECLVAL_H
+#define _LIBCPP___UTILITY_DECLVAL_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Suppress deprecation notice for volatile-qualified return type resulting
+// from volatile-qualified types _Tp.
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Tp>
+_Tp&& __declval(int);
+template <class _Tp>
+_Tp __declval(long);
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+template <class _Tp>
+decltype(std::__declval<_Tp>(0)) declval() _NOEXCEPT;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_DECLVAL_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/exception_guard.h b/app/src/main/cpp/libcxx/include/__utility/exception_guard.h
new file mode 100644
index 0000000..737d1a6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/exception_guard.h
@@ -0,0 +1,128 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_TRANSACTION_H
+#define _LIBCPP___UTILITY_TRANSACTION_H
+
+#include <__assert>
+#include <__config>
+#include <__type_traits/is_nothrow_move_constructible.h>
+#include <__utility/exchange.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// __exception_guard is a helper class for writing code with the strong exception guarantee.
+//
+// When writing code that can throw an exception, one can store rollback instructions in an
+// exception guard so that if an exception is thrown at any point during the lifetime of the
+// exception guard, it will be rolled back automatically. When the exception guard is done, one
+// must mark it as being complete so it isn't rolled back when the exception guard is destroyed.
+//
+// Exception guards are not default constructible, they can't be copied or assigned to, but
+// they can be moved around for convenience.
+//
+// __exception_guard is a no-op in -fno-exceptions mode to produce better code-gen. This means
+// that we don't provide the strong exception guarantees. However, Clang doesn't generate cleanup
+// code with exceptions disabled, so even if we wanted to provide the strong exception guarantees
+// we couldn't. This is also only relevant for constructs with a stack of
+// -fexceptions > -fno-exceptions > -fexceptions code, since the exception can't be caught where
+// exceptions are disabled. While -fexceptions > -fno-exceptions is quite common
+// (e.g. libc++.dylib > -fno-exceptions), having another layer with exceptions enabled seems a lot
+// less common, especially one that tries to catch an exception through -fno-exceptions code.
+//
+// __exception_guard can help greatly simplify code that would normally be cluttered by
+// `#if _LIBCPP_NO_EXCEPTIONS`. For example:
+//
+//    template <class Iterator, class Size, class OutputIterator>
+//    Iterator uninitialized_copy_n(Iterator iter, Size n, OutputIterator out) {
+//        typedef typename iterator_traits<Iterator>::value_type value_type;
+//        __exception_guard guard([start=out, &out] {
+//            std::destroy(start, out);
+//        });
+//
+//        for (; n > 0; ++iter, ++out, --n) {
+//            ::new ((void*)std::addressof(*out)) value_type(*iter);
+//        }
+//        guard.__complete();
+//        return out;
+//    }
+//
+
+#ifndef _LIBCPP_NO_EXCEPTIONS
+template <class _Rollback>
+struct __exception_guard {
+  __exception_guard() = delete;
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit __exception_guard(_Rollback __rollback)
+      : __rollback_(std::move(__rollback)), __completed_(false) {}
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 __exception_guard(__exception_guard&& __other)
+      _NOEXCEPT_(is_nothrow_move_constructible<_Rollback>::value)
+      : __rollback_(std::move(__other.__rollback_)), __completed_(__other.__completed_) {
+    __other.__completed_ = true;
+  }
+
+  __exception_guard(__exception_guard const&)            = delete;
+  __exception_guard& operator=(__exception_guard const&) = delete;
+  __exception_guard& operator=(__exception_guard&&)      = delete;
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __complete() _NOEXCEPT { __completed_ = true; }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 ~__exception_guard() {
+    if (!__completed_)
+      __rollback_();
+  }
+
+private:
+  _Rollback __rollback_;
+  bool __completed_;
+};
+#else  // _LIBCPP_NO_EXCEPTIONS
+template <class _Rollback>
+struct __exception_guard {
+  __exception_guard() = delete;
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_NODEBUG explicit __exception_guard(_Rollback) {}
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_NODEBUG __exception_guard(__exception_guard&& __other)
+      _NOEXCEPT_(is_nothrow_move_constructible<_Rollback>::value)
+      : __completed_(__other.__completed_) {
+    __other.__completed_ = true;
+  }
+
+  __exception_guard(__exception_guard const&)            = delete;
+  __exception_guard& operator=(__exception_guard const&) = delete;
+  __exception_guard& operator=(__exception_guard&&)      = delete;
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_NODEBUG void __complete() _NOEXCEPT {
+    __completed_ = true;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_NODEBUG ~__exception_guard() {
+    _LIBCPP_ASSERT(__completed_, "__exception_guard not completed with exceptions disabled");
+  }
+
+private:
+  bool __completed_ = false;
+};
+#endif // _LIBCPP_NO_EXCEPTIONS
+
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(__exception_guard);
+
+template <class _Rollback>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR __exception_guard<_Rollback> __make_exception_guard(_Rollback __rollback) {
+  return __exception_guard<_Rollback>(std::move(__rollback));
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_TRANSACTION_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/exchange.h b/app/src/main/cpp/libcxx/include/__utility/exchange.h
new file mode 100644
index 0000000..8df71a1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/exchange.h
@@ -0,0 +1,38 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_EXCHANGE_H
+#define _LIBCPP___UTILITY_EXCHANGE_H
+
+#include <__config>
+#include <__type_traits/is_nothrow_assignable.h>
+#include <__type_traits/is_nothrow_move_constructible.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 11
+template<class _T1, class _T2 = _T1>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_T1 exchange(_T1& __obj, _T2&& __new_value)
+    noexcept(is_nothrow_move_constructible<_T1>::value && is_nothrow_assignable<_T1&, _T2>::value)
+{
+    _T1 __old_value = _VSTD::move(__obj);
+    __obj = _VSTD::forward<_T2>(__new_value);
+    return __old_value;
+}
+#endif // _LIBCPP_STD_VER > 11
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_EXCHANGE_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/forward.h b/app/src/main/cpp/libcxx/include/__utility/forward.h
new file mode 100644
index 0000000..010f236
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/forward.h
@@ -0,0 +1,38 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_FORWARD_H
+#define _LIBCPP___UTILITY_FORWARD_H
+
+#include <__config>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/remove_reference.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Tp&&
+forward(_LIBCPP_LIFETIMEBOUND __libcpp_remove_reference_t<_Tp>& __t) _NOEXCEPT {
+  return static_cast<_Tp&&>(__t);
+}
+
+template <class _Tp>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Tp&&
+forward(_LIBCPP_LIFETIMEBOUND __libcpp_remove_reference_t<_Tp>&& __t) _NOEXCEPT {
+  static_assert(!is_lvalue_reference<_Tp>::value, "cannot forward an rvalue as an lvalue");
+  return static_cast<_Tp&&>(__t);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_FORWARD_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/forward_like.h b/app/src/main/cpp/libcxx/include/__utility/forward_like.h
new file mode 100644
index 0000000..7bb0d7d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/forward_like.h
@@ -0,0 +1,46 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_FORWARD_LIKE_H
+#define _LIBCPP___UTILITY_FORWARD_LIKE_H
+
+#include <__config>
+#include <__type_traits/conditional.h>
+#include <__type_traits/is_const.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/remove_reference.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 20
+
+template <class _Ap, class _Bp>
+using _CopyConst = _If<is_const_v<_Ap>, const _Bp, _Bp>;
+
+template <class _Ap, class _Bp>
+using _OverrideRef = _If<is_rvalue_reference_v<_Ap>, remove_reference_t<_Bp>&&, _Bp&>;
+
+template <class _Ap, class _Bp>
+using _ForwardLike = _OverrideRef<_Ap&&, _CopyConst<remove_reference_t<_Ap>, remove_reference_t<_Bp>>>;
+
+template <class _Tp, class _Up>
+[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto forward_like(_LIBCPP_LIFETIMEBOUND _Up&& __ux) noexcept
+    -> _ForwardLike<_Tp, _Up> {
+  return static_cast<_ForwardLike<_Tp, _Up>>(__ux);
+}
+
+#endif // _LIBCPP_STD_VER > 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_FORWARD_LIKE_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/in_place.h b/app/src/main/cpp/libcxx/include/__utility/in_place.h
new file mode 100644
index 0000000..a351845
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/in_place.h
@@ -0,0 +1,59 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_IN_PLACE_H
+#define _LIBCPP___UTILITY_IN_PLACE_H
+
+#include <__config>
+#include <__type_traits/remove_cvref.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+struct _LIBCPP_TYPE_VIS in_place_t {
+    explicit in_place_t() = default;
+};
+inline constexpr in_place_t in_place{};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS in_place_type_t {
+    explicit in_place_type_t() = default;
+};
+template <class _Tp>
+inline constexpr in_place_type_t<_Tp> in_place_type{};
+
+template <size_t _Idx>
+struct _LIBCPP_TEMPLATE_VIS in_place_index_t {
+    explicit in_place_index_t() = default;
+};
+template <size_t _Idx>
+inline constexpr in_place_index_t<_Idx> in_place_index{};
+
+template <class _Tp> struct __is_inplace_type_imp : false_type {};
+template <class _Tp> struct __is_inplace_type_imp<in_place_type_t<_Tp>> : true_type {};
+
+template <class _Tp>
+using __is_inplace_type = __is_inplace_type_imp<__remove_cvref_t<_Tp>>;
+
+template <class _Tp> struct __is_inplace_index_imp : false_type {};
+template <size_t _Idx> struct __is_inplace_index_imp<in_place_index_t<_Idx>> : true_type {};
+
+template <class _Tp>
+using __is_inplace_index = __is_inplace_index_imp<__remove_cvref_t<_Tp>>;
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_IN_PLACE_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/integer_sequence.h b/app/src/main/cpp/libcxx/include/__utility/integer_sequence.h
new file mode 100644
index 0000000..257b430
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/integer_sequence.h
@@ -0,0 +1,153 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_INTEGER_SEQUENCE_H
+#define _LIBCPP___UTILITY_INTEGER_SEQUENCE_H
+
+#include <__config>
+#include <__type_traits/is_integral.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <size_t...> struct __tuple_indices;
+
+template <class _IdxType, _IdxType... _Values>
+struct __integer_sequence {
+  template <template <class _OIdxType, _OIdxType...> class _ToIndexSeq, class _ToIndexType>
+  using __convert = _ToIndexSeq<_ToIndexType, _Values...>;
+
+  template <size_t _Sp>
+  using __to_tuple_indices = __tuple_indices<(_Values + _Sp)...>;
+};
+
+#if !__has_builtin(__make_integer_seq) || defined(_LIBCPP_TESTING_FALLBACK_MAKE_INTEGER_SEQUENCE)
+
+namespace __detail {
+
+template<typename _Tp, size_t ..._Extra> struct __repeat;
+template<typename _Tp, _Tp ..._Np, size_t ..._Extra> struct __repeat<__integer_sequence<_Tp, _Np...>, _Extra...> {
+  typedef _LIBCPP_NODEBUG __integer_sequence<_Tp,
+                           _Np...,
+                           sizeof...(_Np) + _Np...,
+                           2 * sizeof...(_Np) + _Np...,
+                           3 * sizeof...(_Np) + _Np...,
+                           4 * sizeof...(_Np) + _Np...,
+                           5 * sizeof...(_Np) + _Np...,
+                           6 * sizeof...(_Np) + _Np...,
+                           7 * sizeof...(_Np) + _Np...,
+                           _Extra...> type;
+};
+
+template<size_t _Np> struct __parity;
+template<size_t _Np> struct __make : __parity<_Np % 8>::template __pmake<_Np> {};
+
+template<> struct __make<0> { typedef __integer_sequence<size_t> type; };
+template<> struct __make<1> { typedef __integer_sequence<size_t, 0> type; };
+template<> struct __make<2> { typedef __integer_sequence<size_t, 0, 1> type; };
+template<> struct __make<3> { typedef __integer_sequence<size_t, 0, 1, 2> type; };
+template<> struct __make<4> { typedef __integer_sequence<size_t, 0, 1, 2, 3> type; };
+template<> struct __make<5> { typedef __integer_sequence<size_t, 0, 1, 2, 3, 4> type; };
+template<> struct __make<6> { typedef __integer_sequence<size_t, 0, 1, 2, 3, 4, 5> type; };
+template<> struct __make<7> { typedef __integer_sequence<size_t, 0, 1, 2, 3, 4, 5, 6> type; };
+
+template<> struct __parity<0> { template<size_t _Np> struct __pmake : __repeat<typename __make<_Np / 8>::type> {}; };
+template<> struct __parity<1> { template<size_t _Np> struct __pmake : __repeat<typename __make<_Np / 8>::type, _Np - 1> {}; };
+template<> struct __parity<2> { template<size_t _Np> struct __pmake : __repeat<typename __make<_Np / 8>::type, _Np - 2, _Np - 1> {}; };
+template<> struct __parity<3> { template<size_t _Np> struct __pmake : __repeat<typename __make<_Np / 8>::type, _Np - 3, _Np - 2, _Np - 1> {}; };
+template<> struct __parity<4> { template<size_t _Np> struct __pmake : __repeat<typename __make<_Np / 8>::type, _Np - 4, _Np - 3, _Np - 2, _Np - 1> {}; };
+template<> struct __parity<5> { template<size_t _Np> struct __pmake : __repeat<typename __make<_Np / 8>::type, _Np - 5, _Np - 4, _Np - 3, _Np - 2, _Np - 1> {}; };
+template<> struct __parity<6> { template<size_t _Np> struct __pmake : __repeat<typename __make<_Np / 8>::type, _Np - 6, _Np - 5, _Np - 4, _Np - 3, _Np - 2, _Np - 1> {}; };
+template<> struct __parity<7> { template<size_t _Np> struct __pmake : __repeat<typename __make<_Np / 8>::type, _Np - 7, _Np - 6, _Np - 5, _Np - 4, _Np - 3, _Np - 2, _Np - 1> {}; };
+
+} // namespace detail
+
+#endif
+
+#if __has_builtin(__make_integer_seq)
+template <size_t _Ep, size_t _Sp>
+using __make_indices_imp =
+    typename __make_integer_seq<__integer_sequence, size_t, _Ep - _Sp>::template
+    __to_tuple_indices<_Sp>;
+#else
+template <size_t _Ep, size_t _Sp>
+using __make_indices_imp =
+    typename __detail::__make<_Ep - _Sp>::type::template __to_tuple_indices<_Sp>;
+
+#endif
+
+#if _LIBCPP_STD_VER > 11
+
+template<class _Tp, _Tp... _Ip>
+struct _LIBCPP_TEMPLATE_VIS integer_sequence
+{
+    typedef _Tp value_type;
+    static_assert( is_integral<_Tp>::value,
+                  "std::integer_sequence can only be instantiated with an integral type" );
+    static
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr
+    size_t
+    size() noexcept { return sizeof...(_Ip); }
+};
+
+template<size_t... _Ip>
+    using index_sequence = integer_sequence<size_t, _Ip...>;
+
+#if __has_builtin(__make_integer_seq) && !defined(_LIBCPP_TESTING_FALLBACK_MAKE_INTEGER_SEQUENCE)
+
+template <class _Tp, _Tp _Ep>
+using __make_integer_sequence _LIBCPP_NODEBUG = __make_integer_seq<integer_sequence, _Tp, _Ep>;
+
+#else
+
+template<typename _Tp, _Tp _Np> using __make_integer_sequence_unchecked _LIBCPP_NODEBUG =
+  typename __detail::__make<_Np>::type::template __convert<integer_sequence, _Tp>;
+
+template <class _Tp, _Tp _Ep>
+struct __make_integer_sequence_checked
+{
+    static_assert(is_integral<_Tp>::value,
+                  "std::make_integer_sequence can only be instantiated with an integral type" );
+    static_assert(0 <= _Ep, "std::make_integer_sequence must have a non-negative sequence length");
+    // Workaround GCC bug by preventing bad installations when 0 <= _Ep
+    // https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68929
+    typedef _LIBCPP_NODEBUG __make_integer_sequence_unchecked<_Tp, 0 <= _Ep ? _Ep : 0> type;
+};
+
+template <class _Tp, _Tp _Ep>
+using __make_integer_sequence _LIBCPP_NODEBUG = typename __make_integer_sequence_checked<_Tp, _Ep>::type;
+
+#endif
+
+template<class _Tp, _Tp _Np>
+    using make_integer_sequence = __make_integer_sequence<_Tp, _Np>;
+
+template<size_t _Np>
+    using make_index_sequence = make_integer_sequence<size_t, _Np>;
+
+template<class... _Tp>
+    using index_sequence_for = make_index_sequence<sizeof...(_Tp)>;
+
+#  if _LIBCPP_STD_VER > 17
+// Executes __func for every element in an index_sequence.
+template <size_t... _Index, class _Function>
+_LIBCPP_HIDE_FROM_ABI constexpr void __for_each_index_sequence(index_sequence<_Index...>, _Function __func) {
+    (__func.template operator()<_Index>(), ...);
+}
+#  endif // _LIBCPP_STD_VER > 17
+
+#endif // _LIBCPP_STD_VER > 11
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_INTEGER_SEQUENCE_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/move.h b/app/src/main/cpp/libcxx/include/__utility/move.h
new file mode 100644
index 0000000..4859c39
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/move.h
@@ -0,0 +1,44 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_MOVE_H
+#define _LIBCPP___UTILITY_MOVE_H
+
+#include <__config>
+#include <__type_traits/conditional.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__type_traits/is_nothrow_move_constructible.h>
+#include <__type_traits/remove_reference.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR __libcpp_remove_reference_t<_Tp>&&
+move(_LIBCPP_LIFETIMEBOUND _Tp&& __t) _NOEXCEPT {
+  typedef _LIBCPP_NODEBUG __libcpp_remove_reference_t<_Tp> _Up;
+  return static_cast<_Up&&>(__t);
+}
+
+template <class _Tp>
+using __move_if_noexcept_result_t =
+    __conditional_t<!is_nothrow_move_constructible<_Tp>::value && is_copy_constructible<_Tp>::value, const _Tp&, _Tp&&>;
+
+template <class _Tp>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __move_if_noexcept_result_t<_Tp>
+move_if_noexcept(_LIBCPP_LIFETIMEBOUND _Tp& __x) _NOEXCEPT {
+  return std::move(__x);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_MOVE_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/pair.h b/app/src/main/cpp/libcxx/include/__utility/pair.h
new file mode 100644
index 0000000..8151674
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/pair.h
@@ -0,0 +1,721 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_PAIR_H
+#define _LIBCPP___UTILITY_PAIR_H
+
+#include <__compare/common_comparison_category.h>
+#include <__compare/synth_three_way.h>
+#include <__config>
+#include <__functional/unwrap_ref.h>
+#include <__fwd/get.h>
+#include <__fwd/tuple.h>
+#include <__tuple_dir/sfinae_helpers.h>
+#include <__tuple_dir/tuple_element.h>
+#include <__tuple_dir/tuple_indices.h>
+#include <__tuple_dir/tuple_size.h>
+#include <__type_traits/common_reference.h>
+#include <__type_traits/common_type.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/is_assignable.h>
+#include <__type_traits/is_constructible.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_copy_assignable.h>
+#include <__type_traits/is_default_constructible.h>
+#include <__type_traits/is_implicitly_default_constructible.h>
+#include <__type_traits/is_move_assignable.h>
+#include <__type_traits/is_nothrow_assignable.h>
+#include <__type_traits/is_nothrow_constructible.h>
+#include <__type_traits/is_nothrow_copy_assignable.h>
+#include <__type_traits/is_nothrow_copy_constructible.h>
+#include <__type_traits/is_nothrow_default_constructible.h>
+#include <__type_traits/is_nothrow_move_assignable.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_swappable.h>
+#include <__type_traits/nat.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/piecewise_construct.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if defined(_LIBCPP_DEPRECATED_ABI_DISABLE_PAIR_TRIVIAL_COPY_CTOR)
+template <class, class>
+struct __non_trivially_copyable_base {
+  _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+  __non_trivially_copyable_base() _NOEXCEPT {}
+  _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+  __non_trivially_copyable_base(__non_trivially_copyable_base const&) _NOEXCEPT {}
+};
+#endif
+
+template <class _T1, class _T2>
+struct _LIBCPP_TEMPLATE_VIS pair
+#if defined(_LIBCPP_DEPRECATED_ABI_DISABLE_PAIR_TRIVIAL_COPY_CTOR)
+: private __non_trivially_copyable_base<_T1, _T2>
+#endif
+{
+    typedef _T1 first_type;
+    typedef _T2 second_type;
+
+    _T1 first;
+    _T2 second;
+
+    pair(pair const&) = default;
+    pair(pair&&) = default;
+
+#ifdef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    pair() : first(), second() {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair(_T1 const& __t1, _T2 const& __t2) : first(__t1), second(__t2) {}
+
+    template <class _U1, class _U2>
+    _LIBCPP_INLINE_VISIBILITY
+    pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair& operator=(pair const& __p) {
+        first = __p.first;
+        second = __p.second;
+        return *this;
+    }
+#else
+    struct _CheckArgs {
+      template <int&...>
+      static constexpr bool __enable_explicit_default() {
+          return is_default_constructible<_T1>::value
+              && is_default_constructible<_T2>::value
+              && !__enable_implicit_default<>();
+      }
+
+      template <int&...>
+      static constexpr bool __enable_implicit_default() {
+          return __is_implicitly_default_constructible<_T1>::value
+              && __is_implicitly_default_constructible<_T2>::value;
+      }
+
+      template <class _U1, class _U2>
+      static constexpr bool __is_pair_constructible() {
+          return is_constructible<first_type, _U1>::value
+              && is_constructible<second_type, _U2>::value;
+      }
+
+      template <class _U1, class _U2>
+      static constexpr bool __is_implicit() {
+          return is_convertible<_U1, first_type>::value
+              && is_convertible<_U2, second_type>::value;
+      }
+
+      template <class _U1, class _U2>
+      static constexpr bool __enable_explicit() {
+          return __is_pair_constructible<_U1, _U2>() && !__is_implicit<_U1, _U2>();
+      }
+
+      template <class _U1, class _U2>
+      static constexpr bool __enable_implicit() {
+          return __is_pair_constructible<_U1, _U2>() && __is_implicit<_U1, _U2>();
+      }
+    };
+
+    template <bool _MaybeEnable>
+    using _CheckArgsDep _LIBCPP_NODEBUG = typename conditional<
+      _MaybeEnable, _CheckArgs, __check_tuple_constructor_fail>::type;
+
+    struct _CheckTupleLikeConstructor {
+        template <class _Tuple>
+        static constexpr bool __enable_implicit() {
+            return __tuple_convertible<_Tuple, pair>::value;
+        }
+
+        template <class _Tuple>
+        static constexpr bool __enable_explicit() {
+            return __tuple_constructible<_Tuple, pair>::value
+               && !__tuple_convertible<_Tuple, pair>::value;
+        }
+
+        template <class _Tuple>
+        static constexpr bool __enable_assign() {
+            return __tuple_assignable<_Tuple, pair>::value;
+        }
+    };
+
+    template <class _Tuple>
+    using _CheckTLC _LIBCPP_NODEBUG = __conditional_t<
+        __tuple_like_with_size<_Tuple, 2>::value
+            && !is_same<typename decay<_Tuple>::type, pair>::value,
+        _CheckTupleLikeConstructor,
+        __check_tuple_constructor_fail
+    >;
+
+    template<bool _Dummy = true, typename enable_if<
+            _CheckArgsDep<_Dummy>::__enable_explicit_default()
+    >::type* = nullptr>
+    explicit _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    pair() _NOEXCEPT_(is_nothrow_default_constructible<first_type>::value &&
+                      is_nothrow_default_constructible<second_type>::value)
+        : first(), second() {}
+
+    template<bool _Dummy = true, typename enable_if<
+            _CheckArgsDep<_Dummy>::__enable_implicit_default()
+    >::type* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    pair() _NOEXCEPT_(is_nothrow_default_constructible<first_type>::value &&
+                      is_nothrow_default_constructible<second_type>::value)
+        : first(), second() {}
+
+    template <bool _Dummy = true, typename enable_if<
+             _CheckArgsDep<_Dummy>::template __enable_explicit<_T1 const&, _T2 const&>()
+    >::type* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    explicit pair(_T1 const& __t1, _T2 const& __t2)
+        _NOEXCEPT_(is_nothrow_copy_constructible<first_type>::value &&
+                   is_nothrow_copy_constructible<second_type>::value)
+        : first(__t1), second(__t2) {}
+
+    template<bool _Dummy = true, typename enable_if<
+            _CheckArgsDep<_Dummy>::template __enable_implicit<_T1 const&, _T2 const&>()
+    >::type* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    pair(_T1 const& __t1, _T2 const& __t2)
+        _NOEXCEPT_(is_nothrow_copy_constructible<first_type>::value &&
+                   is_nothrow_copy_constructible<second_type>::value)
+        : first(__t1), second(__t2) {}
+
+    template <
+#if _LIBCPP_STD_VER > 20 // http://wg21.link/P1951
+        class _U1 = _T1, class _U2 = _T2,
+#else
+        class _U1, class _U2,
+#endif
+        typename enable_if<_CheckArgs::template __enable_explicit<_U1, _U2>()>::type* = nullptr
+    >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    explicit pair(_U1&& __u1, _U2&& __u2)
+        _NOEXCEPT_((is_nothrow_constructible<first_type, _U1>::value &&
+                    is_nothrow_constructible<second_type, _U2>::value))
+        : first(_VSTD::forward<_U1>(__u1)), second(_VSTD::forward<_U2>(__u2)) {}
+
+    template <
+#if _LIBCPP_STD_VER > 20 // http://wg21.link/P1951
+        class _U1 = _T1, class _U2 = _T2,
+#else
+        class _U1, class _U2,
+#endif
+        typename enable_if<_CheckArgs::template __enable_implicit<_U1, _U2>()>::type* = nullptr
+    >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    pair(_U1&& __u1, _U2&& __u2)
+        _NOEXCEPT_((is_nothrow_constructible<first_type, _U1>::value &&
+                    is_nothrow_constructible<second_type, _U2>::value))
+        : first(_VSTD::forward<_U1>(__u1)), second(_VSTD::forward<_U2>(__u2)) {}
+
+#if _LIBCPP_STD_VER > 20
+    template<class _U1, class _U2, __enable_if_t<
+            _CheckArgs::template __is_pair_constructible<_U1&, _U2&>()
+    >* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    explicit(!_CheckArgs::template __is_implicit<_U1&, _U2&>()) pair(pair<_U1, _U2>& __p)
+        noexcept((is_nothrow_constructible<first_type, _U1&>::value &&
+                  is_nothrow_constructible<second_type, _U2&>::value))
+        : first(__p.first), second(__p.second) {}
+#endif
+
+    template<class _U1, class _U2, typename enable_if<
+            _CheckArgs::template __enable_explicit<_U1 const&, _U2 const&>()
+    >::type* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    explicit pair(pair<_U1, _U2> const& __p)
+        _NOEXCEPT_((is_nothrow_constructible<first_type, _U1 const&>::value &&
+                    is_nothrow_constructible<second_type, _U2 const&>::value))
+        : first(__p.first), second(__p.second) {}
+
+    template<class _U1, class _U2, typename enable_if<
+            _CheckArgs::template __enable_implicit<_U1 const&, _U2 const&>()
+    >::type* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    pair(pair<_U1, _U2> const& __p)
+        _NOEXCEPT_((is_nothrow_constructible<first_type, _U1 const&>::value &&
+                    is_nothrow_constructible<second_type, _U2 const&>::value))
+        : first(__p.first), second(__p.second) {}
+
+    template<class _U1, class _U2, typename enable_if<
+            _CheckArgs::template __enable_explicit<_U1, _U2>()
+    >::type* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    explicit pair(pair<_U1, _U2>&&__p)
+        _NOEXCEPT_((is_nothrow_constructible<first_type, _U1&&>::value &&
+                    is_nothrow_constructible<second_type, _U2&&>::value))
+        : first(_VSTD::forward<_U1>(__p.first)), second(_VSTD::forward<_U2>(__p.second)) {}
+
+    template<class _U1, class _U2, typename enable_if<
+            _CheckArgs::template __enable_implicit<_U1, _U2>()
+    >::type* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    pair(pair<_U1, _U2>&& __p)
+        _NOEXCEPT_((is_nothrow_constructible<first_type, _U1&&>::value &&
+                    is_nothrow_constructible<second_type, _U2&&>::value))
+        : first(_VSTD::forward<_U1>(__p.first)), second(_VSTD::forward<_U2>(__p.second)) {}
+
+#if _LIBCPP_STD_VER > 20
+    template<class _U1, class _U2, __enable_if_t<
+            _CheckArgs::template __is_pair_constructible<const _U1&&, const _U2&&>()
+    >* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    explicit(!_CheckArgs::template __is_implicit<const _U1&&, const _U2&&>())
+    pair(const pair<_U1, _U2>&& __p)
+        noexcept(is_nothrow_constructible<first_type, const _U1&&>::value &&
+                 is_nothrow_constructible<second_type, const _U2&&>::value)
+        : first(std::move(__p.first)), second(std::move(__p.second)) {}
+#endif
+
+    template<class _Tuple, typename enable_if<
+            _CheckTLC<_Tuple>::template __enable_explicit<_Tuple>()
+    >::type* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    explicit pair(_Tuple&& __p)
+        : first(_VSTD::get<0>(_VSTD::forward<_Tuple>(__p))),
+          second(_VSTD::get<1>(_VSTD::forward<_Tuple>(__p))) {}
+
+    template<class _Tuple, typename enable_if<
+            _CheckTLC<_Tuple>::template __enable_implicit<_Tuple>()
+    >::type* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    pair(_Tuple&& __p)
+        : first(_VSTD::get<0>(_VSTD::forward<_Tuple>(__p))),
+          second(_VSTD::get<1>(_VSTD::forward<_Tuple>(__p))) {}
+
+    template <class... _Args1, class... _Args2>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    pair(piecewise_construct_t __pc,
+         tuple<_Args1...> __first_args, tuple<_Args2...> __second_args)
+        _NOEXCEPT_((is_nothrow_constructible<first_type, _Args1...>::value &&
+                    is_nothrow_constructible<second_type, _Args2...>::value))
+        : pair(__pc, __first_args, __second_args,
+                typename __make_tuple_indices<sizeof...(_Args1)>::type(),
+                typename __make_tuple_indices<sizeof...(_Args2) >::type()) {}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    pair& operator=(__conditional_t<
+                        is_copy_assignable<first_type>::value &&
+                        is_copy_assignable<second_type>::value,
+                    pair, __nat> const& __p)
+        _NOEXCEPT_(is_nothrow_copy_assignable<first_type>::value &&
+                   is_nothrow_copy_assignable<second_type>::value)
+    {
+        first = __p.first;
+        second = __p.second;
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    pair& operator=(__conditional_t<
+                        is_move_assignable<first_type>::value &&
+                        is_move_assignable<second_type>::value,
+                    pair, __nat>&& __p)
+        _NOEXCEPT_(is_nothrow_move_assignable<first_type>::value &&
+                   is_nothrow_move_assignable<second_type>::value)
+    {
+        first = _VSTD::forward<first_type>(__p.first);
+        second = _VSTD::forward<second_type>(__p.second);
+        return *this;
+    }
+
+#if _LIBCPP_STD_VER > 20
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    const pair& operator=(pair const& __p) const
+      noexcept(is_nothrow_copy_assignable_v<const first_type> &&
+               is_nothrow_copy_assignable_v<const second_type>)
+      requires(is_copy_assignable_v<const first_type> &&
+               is_copy_assignable_v<const second_type>) {
+        first = __p.first;
+        second = __p.second;
+        return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    const pair& operator=(pair&& __p) const
+      noexcept(is_nothrow_assignable_v<const first_type&, first_type> &&
+               is_nothrow_assignable_v<const second_type&, second_type>)
+      requires(is_assignable_v<const first_type&, first_type> &&
+               is_assignable_v<const second_type&, second_type>) {
+        first = std::forward<first_type>(__p.first);
+        second = std::forward<second_type>(__p.second);
+        return *this;
+    }
+
+    template<class _U1, class _U2>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    const pair& operator=(const pair<_U1, _U2>& __p) const
+      requires(is_assignable_v<const first_type&, const _U1&> &&
+               is_assignable_v<const second_type&, const _U2&>) {
+        first = __p.first;
+        second = __p.second;
+        return *this;
+    }
+
+    template<class _U1, class _U2>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    const pair& operator=(pair<_U1, _U2>&& __p) const
+      requires(is_assignable_v<const first_type&, _U1> &&
+               is_assignable_v<const second_type&, _U2>) {
+        first = std::forward<_U1>(__p.first);
+        second = std::forward<_U2>(__p.second);
+        return *this;
+    }
+#endif // _LIBCPP_STD_VER > 20
+
+    template <class _Tuple, typename enable_if<
+            _CheckTLC<_Tuple>::template __enable_assign<_Tuple>()
+     >::type* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    pair& operator=(_Tuple&& __p) {
+        first = _VSTD::get<0>(_VSTD::forward<_Tuple>(__p));
+        second = _VSTD::get<1>(_VSTD::forward<_Tuple>(__p));
+        return *this;
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void
+    swap(pair& __p) _NOEXCEPT_(__is_nothrow_swappable<first_type>::value &&
+                               __is_nothrow_swappable<second_type>::value)
+    {
+        using _VSTD::swap;
+        swap(first,  __p.first);
+        swap(second, __p.second);
+    }
+
+#if _LIBCPP_STD_VER > 20
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    void swap(const pair& __p) const
+        noexcept(__is_nothrow_swappable<const first_type>::value &&
+                 __is_nothrow_swappable<const second_type>::value)
+    {
+        using std::swap;
+        swap(first,  __p.first);
+        swap(second, __p.second);
+    }
+#endif
+private:
+
+#ifndef _LIBCPP_CXX03_LANG
+    template <class... _Args1, class... _Args2, size_t... _I1, size_t... _I2>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    pair(piecewise_construct_t,
+         tuple<_Args1...>& __first_args, tuple<_Args2...>& __second_args,
+         __tuple_indices<_I1...>, __tuple_indices<_I2...>);
+#endif
+};
+
+#if _LIBCPP_STD_VER > 14
+template<class _T1, class _T2>
+pair(_T1, _T2) -> pair<_T1, _T2>;
+#endif
+
+// [pairs.spec], specialized algorithms
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator==(const pair<_T1,_T2>& __x, const pair<_T1,_T2>& __y)
+{
+    return __x.first == __y.first && __x.second == __y.second;
+}
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _T1, class _T2>
+_LIBCPP_HIDE_FROM_ABI constexpr
+common_comparison_category_t<
+        __synth_three_way_result<_T1>,
+        __synth_three_way_result<_T2> >
+operator<=>(const pair<_T1,_T2>& __x, const pair<_T1,_T2>& __y)
+{
+    if (auto __c = _VSTD::__synth_three_way(__x.first, __y.first); __c != 0) {
+      return __c;
+    }
+    return _VSTD::__synth_three_way(__x.second, __y.second);
+}
+
+#else // _LIBCPP_STD_VER > 17
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator!=(const pair<_T1,_T2>& __x, const pair<_T1,_T2>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator< (const pair<_T1,_T2>& __x, const pair<_T1,_T2>& __y)
+{
+    return __x.first < __y.first || (!(__y.first < __x.first) && __x.second < __y.second);
+}
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator> (const pair<_T1,_T2>& __x, const pair<_T1,_T2>& __y)
+{
+    return __y < __x;
+}
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator>=(const pair<_T1,_T2>& __x, const pair<_T1,_T2>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator<=(const pair<_T1,_T2>& __x, const pair<_T1,_T2>& __y)
+{
+    return !(__y < __x);
+}
+
+#endif // _LIBCPP_STD_VER > 17
+
+#if _LIBCPP_STD_VER > 20
+template <class _T1, class _T2, class _U1, class _U2, template<class> class _TQual, template<class> class _UQual>
+    requires requires { typename pair<common_reference_t<_TQual<_T1>, _UQual<_U1>>,
+                                      common_reference_t<_TQual<_T2>, _UQual<_U2>>>; }
+struct basic_common_reference<pair<_T1, _T2>, pair<_U1, _U2>, _TQual, _UQual> {
+    using type = pair<common_reference_t<_TQual<_T1>, _UQual<_U1>>,
+                      common_reference_t<_TQual<_T2>, _UQual<_U2>>>;
+};
+
+template <class _T1, class _T2, class _U1, class _U2>
+    requires requires { typename pair<common_type_t<_T1, _U1>, common_type_t<_T2, _U2>>; }
+struct common_type<pair<_T1, _T2>, pair<_U1, _U2>> {
+    using type = pair<common_type_t<_T1, _U1>, common_type_t<_T2, _U2>>;
+};
+#endif // _LIBCPP_STD_VER > 20
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename enable_if
+<
+    __is_swappable<_T1>::value &&
+    __is_swappable<_T2>::value,
+    void
+>::type
+swap(pair<_T1, _T2>& __x, pair<_T1, _T2>& __y)
+                     _NOEXCEPT_((__is_nothrow_swappable<_T1>::value &&
+                                 __is_nothrow_swappable<_T2>::value))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 20
+template <class _T1, class _T2>
+  requires (__is_swappable<const _T1>::value &&
+            __is_swappable<const _T2>::value)
+_LIBCPP_HIDE_FROM_ABI constexpr
+void swap(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
+    noexcept(noexcept(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+#endif
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+pair<typename __unwrap_ref_decay<_T1>::type, typename __unwrap_ref_decay<_T2>::type>
+make_pair(_T1&& __t1, _T2&& __t2)
+{
+    return pair<typename __unwrap_ref_decay<_T1>::type, typename __unwrap_ref_decay<_T2>::type>
+               (_VSTD::forward<_T1>(__t1), _VSTD::forward<_T2>(__t2));
+}
+
+template <class _T1, class _T2>
+  struct _LIBCPP_TEMPLATE_VIS tuple_size<pair<_T1, _T2> >
+    : public integral_constant<size_t, 2> {};
+
+template <size_t _Ip, class _T1, class _T2>
+struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, pair<_T1, _T2> >
+{
+    static_assert(_Ip < 2, "Index out of bounds in std::tuple_element<std::pair<T1, T2>>");
+};
+
+template <class _T1, class _T2>
+struct _LIBCPP_TEMPLATE_VIS tuple_element<0, pair<_T1, _T2> >
+{
+    typedef _LIBCPP_NODEBUG _T1 type;
+};
+
+template <class _T1, class _T2>
+struct _LIBCPP_TEMPLATE_VIS tuple_element<1, pair<_T1, _T2> >
+{
+    typedef _LIBCPP_NODEBUG _T2 type;
+};
+
+template <size_t _Ip> struct __get_pair;
+
+template <>
+struct __get_pair<0>
+{
+    template <class _T1, class _T2>
+    static
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    _T1&
+    get(pair<_T1, _T2>& __p) _NOEXCEPT {return __p.first;}
+
+    template <class _T1, class _T2>
+    static
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    const _T1&
+    get(const pair<_T1, _T2>& __p) _NOEXCEPT {return __p.first;}
+
+    template <class _T1, class _T2>
+    static
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    _T1&&
+    get(pair<_T1, _T2>&& __p) _NOEXCEPT {return _VSTD::forward<_T1>(__p.first);}
+
+    template <class _T1, class _T2>
+    static
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    const _T1&&
+    get(const pair<_T1, _T2>&& __p) _NOEXCEPT {return _VSTD::forward<const _T1>(__p.first);}
+};
+
+template <>
+struct __get_pair<1>
+{
+    template <class _T1, class _T2>
+    static
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    _T2&
+    get(pair<_T1, _T2>& __p) _NOEXCEPT {return __p.second;}
+
+    template <class _T1, class _T2>
+    static
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    const _T2&
+    get(const pair<_T1, _T2>& __p) _NOEXCEPT {return __p.second;}
+
+    template <class _T1, class _T2>
+    static
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    _T2&&
+    get(pair<_T1, _T2>&& __p) _NOEXCEPT {return _VSTD::forward<_T2>(__p.second);}
+
+    template <class _T1, class _T2>
+    static
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    const _T2&&
+    get(const pair<_T1, _T2>&& __p) _NOEXCEPT {return _VSTD::forward<const _T2>(__p.second);}
+};
+
+template <size_t _Ip, class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+typename tuple_element<_Ip, pair<_T1, _T2> >::type&
+get(pair<_T1, _T2>& __p) _NOEXCEPT
+{
+    return __get_pair<_Ip>::get(__p);
+}
+
+template <size_t _Ip, class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const typename tuple_element<_Ip, pair<_T1, _T2> >::type&
+get(const pair<_T1, _T2>& __p) _NOEXCEPT
+{
+    return __get_pair<_Ip>::get(__p);
+}
+
+template <size_t _Ip, class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+typename tuple_element<_Ip, pair<_T1, _T2> >::type&&
+get(pair<_T1, _T2>&& __p) _NOEXCEPT
+{
+    return __get_pair<_Ip>::get(_VSTD::move(__p));
+}
+
+template <size_t _Ip, class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const typename tuple_element<_Ip, pair<_T1, _T2> >::type&&
+get(const pair<_T1, _T2>&& __p) _NOEXCEPT
+{
+    return __get_pair<_Ip>::get(_VSTD::move(__p));
+}
+
+#if _LIBCPP_STD_VER > 11
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _T1 & get(pair<_T1, _T2>& __p) _NOEXCEPT
+{
+    return __get_pair<0>::get(__p);
+}
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _T1 const & get(pair<_T1, _T2> const& __p) _NOEXCEPT
+{
+    return __get_pair<0>::get(__p);
+}
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _T1 && get(pair<_T1, _T2>&& __p) _NOEXCEPT
+{
+    return __get_pair<0>::get(_VSTD::move(__p));
+}
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _T1 const && get(pair<_T1, _T2> const&& __p) _NOEXCEPT
+{
+    return __get_pair<0>::get(_VSTD::move(__p));
+}
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _T1 & get(pair<_T2, _T1>& __p) _NOEXCEPT
+{
+    return __get_pair<1>::get(__p);
+}
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _T1 const & get(pair<_T2, _T1> const& __p) _NOEXCEPT
+{
+    return __get_pair<1>::get(__p);
+}
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _T1 && get(pair<_T2, _T1>&& __p) _NOEXCEPT
+{
+    return __get_pair<1>::get(_VSTD::move(__p));
+}
+
+template <class _T1, class _T2>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _T1 const && get(pair<_T2, _T1> const&& __p) _NOEXCEPT
+{
+    return __get_pair<1>::get(_VSTD::move(__p));
+}
+
+#endif // _LIBCPP_STD_VER > 11
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_PAIR_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/piecewise_construct.h b/app/src/main/cpp/libcxx/include/__utility/piecewise_construct.h
new file mode 100644
index 0000000..3cc86fe
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/piecewise_construct.h
@@ -0,0 +1,29 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_PIECEWISE_CONSTRUCT_H
+#define _LIBCPP___UTILITY_PIECEWISE_CONSTRUCT_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+struct _LIBCPP_TEMPLATE_VIS piecewise_construct_t { explicit piecewise_construct_t() = default; };
+#if defined(_LIBCPP_CXX03_LANG) || defined(_LIBCPP_BUILDING_LIBRARY)
+extern _LIBCPP_EXPORTED_FROM_ABI const piecewise_construct_t piecewise_construct;// = piecewise_construct_t();
+#else
+/* inline */ constexpr piecewise_construct_t piecewise_construct = piecewise_construct_t();
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_PIECEWISE_CONSTRUCT_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/priority_tag.h b/app/src/main/cpp/libcxx/include/__utility/priority_tag.h
new file mode 100644
index 0000000..e51ba6b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/priority_tag.h
@@ -0,0 +1,26 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_PRIORITY_TAG_H
+#define _LIBCPP___UTILITY_PRIORITY_TAG_H
+
+#include <__config>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<size_t _Ip> struct __priority_tag : __priority_tag<_Ip - 1> {};
+template<> struct __priority_tag<0> {};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_PRIORITY_TAG_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/rel_ops.h b/app/src/main/cpp/libcxx/include/__utility/rel_ops.h
new file mode 100644
index 0000000..5f8d42c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/rel_ops.h
@@ -0,0 +1,59 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_REL_OPS_H
+#define _LIBCPP___UTILITY_REL_OPS_H
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace rel_ops
+{
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const _Tp& __x, const _Tp& __y)
+{
+    return !(__x == __y);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator> (const _Tp& __x, const _Tp& __y)
+{
+    return __y < __x;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const _Tp& __x, const _Tp& __y)
+{
+    return !(__y < __x);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const _Tp& __x, const _Tp& __y)
+{
+    return !(__x < __y);
+}
+
+} // namespace rel_ops
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_REL_OPS_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/swap.h b/app/src/main/cpp/libcxx/include/__utility/swap.h
new file mode 100644
index 0000000..0843b35
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/swap.h
@@ -0,0 +1,54 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_SWAP_H
+#define _LIBCPP___UTILITY_SWAP_H
+
+#include <__config>
+#include <__type_traits/is_move_assignable.h>
+#include <__type_traits/is_move_constructible.h>
+#include <__type_traits/is_nothrow_move_assignable.h>
+#include <__type_traits/is_nothrow_move_constructible.h>
+#include <__type_traits/is_swappable.h>
+#include <__utility/declval.h>
+#include <__utility/move.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Tp>
+using __swap_result_t = typename enable_if<is_move_constructible<_Tp>::value && is_move_assignable<_Tp>::value>::type;
+#else
+template <class>
+using __swap_result_t = void;
+#endif
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY __swap_result_t<_Tp> _LIBCPP_CONSTEXPR_SINCE_CXX20 swap(_Tp& __x, _Tp& __y)
+    _NOEXCEPT_(is_nothrow_move_constructible<_Tp>::value&& is_nothrow_move_assignable<_Tp>::value) {
+  _Tp __t(_VSTD::move(__x));
+  __x = _VSTD::move(__y);
+  __y = _VSTD::move(__t);
+}
+
+template <class _Tp, size_t _Np>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 typename enable_if<__is_swappable<_Tp>::value>::type
+swap(_Tp (&__a)[_Np], _Tp (&__b)[_Np]) _NOEXCEPT_(__is_nothrow_swappable<_Tp>::value) {
+  for (size_t __i = 0; __i != _Np; ++__i) {
+    swap(__a[__i], __b[__i]);
+  }
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_SWAP_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/to_underlying.h b/app/src/main/cpp/libcxx/include/__utility/to_underlying.h
new file mode 100644
index 0000000..a194d3e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/to_underlying.h
@@ -0,0 +1,40 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_TO_UNDERLYING_H
+#define _LIBCPP___UTILITY_TO_UNDERLYING_H
+
+#include <__config>
+#include <__type_traits/underlying_type.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr typename underlying_type<_Tp>::type
+__to_underlying(_Tp __val) noexcept {
+  return static_cast<typename underlying_type<_Tp>::type>(__val);
+}
+#endif // !_LIBCPP_CXX03_LANG
+
+#if _LIBCPP_STD_VER > 20
+template <class _Tp>
+_LIBCPP_NODISCARD_EXT _LIBCPP_INLINE_VISIBILITY constexpr underlying_type_t<_Tp>
+to_underlying(_Tp __val) noexcept {
+  return _VSTD::__to_underlying(__val);
+}
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_TO_UNDERLYING_H
diff --git a/app/src/main/cpp/libcxx/include/__utility/unreachable.h b/app/src/main/cpp/libcxx/include/__utility/unreachable.h
new file mode 100644
index 0000000..d93e60b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__utility/unreachable.h
@@ -0,0 +1,34 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___UTILITY_UNREACHABLE_H
+#define _LIBCPP___UTILITY_UNREACHABLE_H
+
+#include <__assert>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+_LIBCPP_NORETURN _LIBCPP_HIDE_FROM_ABI inline void __libcpp_unreachable() {
+    _LIBCPP_ASSERT(false, "std::unreachable() was reached");
+    __builtin_unreachable();
+}
+
+#if _LIBCPP_STD_VER > 20
+
+[[noreturn]] _LIBCPP_HIDE_FROM_ABI inline void unreachable() { __libcpp_unreachable(); }
+
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___UTILITY_UNREACHABLE_H
diff --git a/app/src/main/cpp/libcxx/include/__variant/monostate.h b/app/src/main/cpp/libcxx/include/__variant/monostate.h
new file mode 100644
index 0000000..b3b4597
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__variant/monostate.h
@@ -0,0 +1,64 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___VARIANT_MONOSTATE_H
+#define _LIBCPP___VARIANT_MONOSTATE_H
+
+#include <__compare/ordering.h>
+#include <__config>
+#include <__functional/hash.h>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+struct _LIBCPP_TEMPLATE_VIS monostate {};
+
+_LIBCPP_HIDE_FROM_ABI constexpr bool operator==(monostate, monostate) noexcept { return true; }
+
+#  if _LIBCPP_STD_VER > 17
+
+_LIBCPP_HIDE_FROM_ABI constexpr strong_ordering operator<=>(monostate, monostate) noexcept {
+  return strong_ordering::equal;
+}
+
+#  else // _LIBCPP_STD_VER > 17
+
+_LIBCPP_HIDE_FROM_ABI constexpr bool operator!=(monostate, monostate) noexcept { return false; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr bool operator<(monostate, monostate) noexcept { return false; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr bool operator>(monostate, monostate) noexcept { return false; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr bool operator<=(monostate, monostate) noexcept { return true; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr bool operator>=(monostate, monostate) noexcept { return true; }
+
+#  endif // _LIBCPP_STD_VER > 17
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<monostate> {
+  using argument_type = monostate;
+  using result_type = size_t;
+
+  inline _LIBCPP_HIDE_FROM_ABI result_type operator()(const argument_type&) const _NOEXCEPT {
+    return 66740831; // return a fundamentally attractive random value.
+  }
+};
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___VARIANT_MONOSTATE_H
diff --git a/app/src/main/cpp/libcxx/include/__verbose_abort b/app/src/main/cpp/libcxx/include/__verbose_abort
new file mode 100644
index 0000000..a16d75d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/__verbose_abort
@@ -0,0 +1,57 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP___VERBOSE_ABORT
+#define _LIBCPP___VERBOSE_ABORT
+
+#include <__availability>
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// This function should never be called directly from the code -- it should only be called through
+// the _LIBCPP_VERBOSE_ABORT macro.
+_LIBCPP_NORETURN _LIBCPP_OVERRIDABLE_FUNC_VIS _LIBCPP_ATTRIBUTE_FORMAT(__printf__, 1, 2)
+void __libcpp_verbose_abort(const char *__format, ...);
+
+// _LIBCPP_VERBOSE_ABORT(format, args...)
+//
+// This macro is used to abort the program abnormally while providing additional diagnostic information.
+//
+// The first argument is a printf-style format string, and the remaining arguments are values to format
+// into the format-string. This macro can be customized by users to provide fine-grained control over
+// how verbose termination is triggered.
+//
+// If the user does not supply their own version of the _LIBCPP_VERBOSE_ABORT macro, we pick the default
+// behavior based on whether we know the built library we're running against provides support for the
+// verbose termination handler or not. If it does, we call it. If it doesn't, we call __builtin_abort to
+// make sure that the program terminates but without taking any complex dependencies in this header.
+#if !defined(_LIBCPP_VERBOSE_ABORT)
+
+// Support _LIBCPP_AVAILABILITY_CUSTOM_VERBOSE_ABORT_PROVIDED until LLVM 18, but tell people
+// to move to customizing _LIBCPP_VERBOSE_ABORT instead.
+#  if defined(_LIBCPP_HAS_NO_VERBOSE_ABORT_IN_LIBRARY) && defined(_LIBCPP_AVAILABILITY_CUSTOM_VERBOSE_ABORT_PROVIDED)
+#    undef _LIBCPP_HAS_NO_VERBOSE_ABORT_IN_LIBRARY
+#    warning _LIBCPP_AVAILABILITY_CUSTOM_VERBOSE_ABORT_PROVIDED is deprecated, please customize _LIBCPP_VERBOSE_ABORT instead
+#  endif
+
+#  if defined(_LIBCPP_HAS_NO_VERBOSE_ABORT_IN_LIBRARY)
+#    define _LIBCPP_VERBOSE_ABORT(...) __builtin_abort()
+#  else
+#    define _LIBCPP_VERBOSE_ABORT(...) ::std::__libcpp_verbose_abort(__VA_ARGS__)
+#  endif
+#endif // !defined(_LIBCPP_VERBOSE_ABORT)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP___VERBOSE_ABORT
diff --git a/app/src/main/cpp/libcxx/include/abi/CMakeLists.txt b/app/src/main/cpp/libcxx/include/abi/CMakeLists.txt
new file mode 100644
index 0000000..5b1cc25
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/abi/CMakeLists.txt
@@ -0,0 +1,39 @@
+set(files
+  __cxxabi_config.h
+  cxxabi.h
+  )
+
+foreach(f ${files})
+  set(src "${CMAKE_CURRENT_SOURCE_DIR}/${f}")
+  set(dst "${LIBCXXABI_GENERATED_INCLUDE_DIR}/${f}")
+  add_custom_command(OUTPUT ${dst}
+    DEPENDS ${src}
+    COMMAND ${CMAKE_COMMAND} -E copy_if_different ${src} ${dst}
+    COMMENT "Copying CXXABI header ${f}")
+  list(APPEND _all_includes "${dst}")
+endforeach()
+
+add_custom_target(generate-cxxabi-headers ALL DEPENDS ${_all_includes})
+
+add_library(cxxabi-headers INTERFACE)
+add_dependencies(cxxabi-headers generate-cxxabi-headers)
+target_include_directories(cxxabi-headers INTERFACE "${CMAKE_CURRENT_SOURCE_DIR}")
+
+if (LIBCXXABI_INSTALL_HEADERS)
+  foreach(file ${files})
+    get_filename_component(dir ${file} DIRECTORY)
+    install(FILES ${file}
+      DESTINATION ${LIBCXXABI_INSTALL_INCLUDE_DIR}/${dir}
+      COMPONENT cxxabi-headers
+      PERMISSIONS OWNER_READ OWNER_WRITE GROUP_READ WORLD_READ
+    )
+  endforeach()
+
+  add_custom_target(install-cxxabi-headers
+                    DEPENDS cxxabi-headers
+                    COMMAND "${CMAKE_COMMAND}"
+                            -DCMAKE_INSTALL_COMPONENT=cxxabi-headers
+                            -P "${CMAKE_BINARY_DIR}/cmake_install.cmake")
+  # Stripping is a no-op for headers
+  add_custom_target(install-cxxabi-headers-stripped DEPENDS install-cxxabi-headers)
+endif()
diff --git a/app/src/main/cpp/libcxx/include/abi/__cxxabi_config.h b/app/src/main/cpp/libcxx/include/abi/__cxxabi_config.h
new file mode 100644
index 0000000..c97dd65
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/abi/__cxxabi_config.h
@@ -0,0 +1,106 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef ____CXXABI_CONFIG_H
+#define ____CXXABI_CONFIG_H
+
+#if defined(__arm__) && !defined(__USING_SJLJ_EXCEPTIONS__) &&                 \
+    !defined(__ARM_DWARF_EH__) && !defined(__SEH__)
+#define _LIBCXXABI_ARM_EHABI
+#endif
+
+#if !defined(__has_attribute)
+#define __has_attribute(_attribute_) 0
+#endif
+
+#if defined(__clang__)
+#  define _LIBCXXABI_COMPILER_CLANG
+#  ifndef __apple_build_version__
+#    define _LIBCXXABI_CLANG_VER (__clang_major__ * 100 + __clang_minor__)
+#  endif
+#elif defined(__GNUC__)
+#  define _LIBCXXABI_COMPILER_GCC
+#elif defined(_MSC_VER)
+#  define _LIBCXXABI_COMPILER_MSVC
+#elif defined(__IBMCPP__)
+#  define _LIBCXXABI_COMPILER_IBM
+#endif
+
+#if defined(_WIN32)
+ #if defined(_LIBCXXABI_DISABLE_VISIBILITY_ANNOTATIONS)
+  #define _LIBCXXABI_HIDDEN
+  #define _LIBCXXABI_DATA_VIS
+  #define _LIBCXXABI_FUNC_VIS
+  #define _LIBCXXABI_TYPE_VIS
+ #elif defined(_LIBCXXABI_BUILDING_LIBRARY)
+  #define _LIBCXXABI_HIDDEN
+  #define _LIBCXXABI_DATA_VIS __declspec(dllexport)
+  #define _LIBCXXABI_FUNC_VIS __declspec(dllexport)
+  #define _LIBCXXABI_TYPE_VIS __declspec(dllexport)
+ #else
+  #define _LIBCXXABI_HIDDEN
+  #define _LIBCXXABI_DATA_VIS __declspec(dllimport)
+  #define _LIBCXXABI_FUNC_VIS __declspec(dllimport)
+  #define _LIBCXXABI_TYPE_VIS __declspec(dllimport)
+ #endif
+#else
+ #if !defined(_LIBCXXABI_DISABLE_VISIBILITY_ANNOTATIONS)
+  #define _LIBCXXABI_HIDDEN __attribute__((__visibility__("hidden")))
+  #define _LIBCXXABI_DATA_VIS __attribute__((__visibility__("default")))
+  #define _LIBCXXABI_FUNC_VIS __attribute__((__visibility__("default")))
+  #if __has_attribute(__type_visibility__)
+   #define _LIBCXXABI_TYPE_VIS __attribute__((__type_visibility__("default")))
+  #else
+   #define _LIBCXXABI_TYPE_VIS __attribute__((__visibility__("default")))
+  #endif
+ #else
+  #define _LIBCXXABI_HIDDEN
+  #define _LIBCXXABI_DATA_VIS
+  #define _LIBCXXABI_FUNC_VIS
+  #define _LIBCXXABI_TYPE_VIS
+ #endif
+#endif
+
+#if defined(_LIBCXXABI_COMPILER_MSVC)
+#define _LIBCXXABI_WEAK
+#else
+#define _LIBCXXABI_WEAK __attribute__((__weak__))
+#endif
+
+#if defined(__clang__)
+#define _LIBCXXABI_COMPILER_CLANG
+#elif defined(__GNUC__)
+#define _LIBCXXABI_COMPILER_GCC
+#endif
+
+#if __has_attribute(__no_sanitize__) && defined(_LIBCXXABI_COMPILER_CLANG)
+#define _LIBCXXABI_NO_CFI __attribute__((__no_sanitize__("cfi")))
+#else
+#define _LIBCXXABI_NO_CFI
+#endif
+
+// wasm32 follows the arm32 ABI convention of using 32-bit guard.
+#if defined(__arm__) || defined(__wasm32__) || defined(__ARM64_ARCH_8_32__)
+#  define _LIBCXXABI_GUARD_ABI_ARM
+#endif
+
+#if defined(_LIBCXXABI_COMPILER_CLANG)
+#  if !__has_feature(cxx_exceptions)
+#    define _LIBCXXABI_NO_EXCEPTIONS
+#  endif
+#elif defined(_LIBCXXABI_COMPILER_GCC) && !defined(__EXCEPTIONS)
+#  define _LIBCXXABI_NO_EXCEPTIONS
+#endif
+
+#if defined(_WIN32)
+#define _LIBCXXABI_DTOR_FUNC __thiscall
+#else
+#define _LIBCXXABI_DTOR_FUNC
+#endif
+
+#endif // ____CXXABI_CONFIG_H
diff --git a/app/src/main/cpp/libcxx/include/abi/cxxabi.h b/app/src/main/cpp/libcxx/include/abi/cxxabi.h
new file mode 100644
index 0000000..85cb4b3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/abi/cxxabi.h
@@ -0,0 +1,177 @@
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef __CXXABI_H
+#define __CXXABI_H
+
+/*
+ * This header provides the interface to the C++ ABI as defined at:
+ *       https://itanium-cxx-abi.github.io/cxx-abi/
+ */
+
+#include <stddef.h>
+#include <stdint.h>
+
+#include <__cxxabi_config.h>
+
+#define _LIBCPPABI_VERSION 15000
+#define _LIBCXXABI_NORETURN  __attribute__((noreturn))
+#define _LIBCXXABI_ALWAYS_COLD __attribute__((cold))
+
+#ifdef __cplusplus
+
+namespace std {
+#if defined(_WIN32)
+class _LIBCXXABI_TYPE_VIS type_info; // forward declaration
+#else
+class type_info; // forward declaration
+#endif
+}
+
+
+// runtime routines use C calling conventions, but are in __cxxabiv1 namespace
+namespace __cxxabiv1 {
+extern "C"  {
+
+// 2.4.2 Allocating the Exception Object
+extern _LIBCXXABI_FUNC_VIS void *
+__cxa_allocate_exception(size_t thrown_size) throw();
+extern _LIBCXXABI_FUNC_VIS void
+__cxa_free_exception(void *thrown_exception) throw();
+
+// 2.4.3 Throwing the Exception Object
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_NORETURN void
+__cxa_throw(void *thrown_exception, std::type_info *tinfo,
+            void (_LIBCXXABI_DTOR_FUNC *dest)(void *));
+
+// 2.5.3 Exception Handlers
+extern _LIBCXXABI_FUNC_VIS void *
+__cxa_get_exception_ptr(void *exceptionObject) throw();
+extern _LIBCXXABI_FUNC_VIS void *
+__cxa_begin_catch(void *exceptionObject) throw();
+extern _LIBCXXABI_FUNC_VIS void __cxa_end_catch();
+#if defined(_LIBCXXABI_ARM_EHABI)
+extern _LIBCXXABI_FUNC_VIS bool
+__cxa_begin_cleanup(void *exceptionObject) throw();
+extern _LIBCXXABI_FUNC_VIS void __cxa_end_cleanup();
+#endif
+extern _LIBCXXABI_FUNC_VIS std::type_info *__cxa_current_exception_type();
+
+// 2.5.4 Rethrowing Exceptions
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_NORETURN void __cxa_rethrow();
+
+// 2.6 Auxiliary Runtime APIs
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_NORETURN void __cxa_bad_cast(void);
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_NORETURN void __cxa_bad_typeid(void);
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_NORETURN void
+__cxa_throw_bad_array_new_length(void);
+
+// 3.2.6 Pure Virtual Function API
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_NORETURN void __cxa_pure_virtual(void);
+
+// 3.2.7 Deleted Virtual Function API
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_NORETURN void __cxa_deleted_virtual(void);
+
+// 3.3.2 One-time Construction API
+#if defined(_LIBCXXABI_GUARD_ABI_ARM)
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_ALWAYS_COLD int __cxa_guard_acquire(uint32_t *);
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_ALWAYS_COLD void __cxa_guard_release(uint32_t *);
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_ALWAYS_COLD void __cxa_guard_abort(uint32_t *);
+#else
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_ALWAYS_COLD int __cxa_guard_acquire(uint64_t *);
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_ALWAYS_COLD void __cxa_guard_release(uint64_t *);
+extern _LIBCXXABI_FUNC_VIS _LIBCXXABI_ALWAYS_COLD void __cxa_guard_abort(uint64_t *);
+#endif
+
+// 3.3.3 Array Construction and Destruction API
+extern _LIBCXXABI_FUNC_VIS void *
+__cxa_vec_new(size_t element_count, size_t element_size, size_t padding_size,
+              void (*constructor)(void *), void (*destructor)(void *));
+
+extern _LIBCXXABI_FUNC_VIS void *
+__cxa_vec_new2(size_t element_count, size_t element_size, size_t padding_size,
+               void (*constructor)(void *), void (*destructor)(void *),
+               void *(*alloc)(size_t), void (*dealloc)(void *));
+
+extern _LIBCXXABI_FUNC_VIS void *
+__cxa_vec_new3(size_t element_count, size_t element_size, size_t padding_size,
+               void (*constructor)(void *), void (*destructor)(void *),
+               void *(*alloc)(size_t), void (*dealloc)(void *, size_t));
+
+extern _LIBCXXABI_FUNC_VIS void
+__cxa_vec_ctor(void *array_address, size_t element_count, size_t element_size,
+               void (*constructor)(void *), void (*destructor)(void *));
+
+extern _LIBCXXABI_FUNC_VIS void __cxa_vec_dtor(void *array_address,
+                                               size_t element_count,
+                                               size_t element_size,
+                                               void (*destructor)(void *));
+
+extern _LIBCXXABI_FUNC_VIS void __cxa_vec_cleanup(void *array_address,
+                                                  size_t element_count,
+                                                  size_t element_size,
+                                                  void (*destructor)(void *));
+
+extern _LIBCXXABI_FUNC_VIS void __cxa_vec_delete(void *array_address,
+                                                 size_t element_size,
+                                                 size_t padding_size,
+                                                 void (*destructor)(void *));
+
+extern _LIBCXXABI_FUNC_VIS void
+__cxa_vec_delete2(void *array_address, size_t element_size, size_t padding_size,
+                  void (*destructor)(void *), void (*dealloc)(void *));
+
+extern _LIBCXXABI_FUNC_VIS void
+__cxa_vec_delete3(void *__array_address, size_t element_size,
+                  size_t padding_size, void (*destructor)(void *),
+                  void (*dealloc)(void *, size_t));
+
+extern _LIBCXXABI_FUNC_VIS void
+__cxa_vec_cctor(void *dest_array, void *src_array, size_t element_count,
+                size_t element_size, void (*constructor)(void *, void *),
+                void (*destructor)(void *));
+
+// 3.3.5.3 Runtime API
+// These functions are part of the C++ ABI, but they are not defined in libc++abi:
+//    int __cxa_atexit(void (*)(void *), void *, void *);
+//    void __cxa_finalize(void *);
+
+// 3.4 Demangler API
+extern _LIBCXXABI_FUNC_VIS char *__cxa_demangle(const char *mangled_name,
+                                                char *output_buffer,
+                                                size_t *length, int *status);
+
+// Apple additions to support C++ 0x exception_ptr class
+// These are primitives to wrap a smart pointer around an exception object
+extern _LIBCXXABI_FUNC_VIS void *__cxa_current_primary_exception() throw();
+extern _LIBCXXABI_FUNC_VIS void
+__cxa_rethrow_primary_exception(void *primary_exception);
+extern _LIBCXXABI_FUNC_VIS void
+__cxa_increment_exception_refcount(void *primary_exception) throw();
+extern _LIBCXXABI_FUNC_VIS void
+__cxa_decrement_exception_refcount(void *primary_exception) throw();
+
+// Apple extension to support std::uncaught_exception()
+extern _LIBCXXABI_FUNC_VIS bool __cxa_uncaught_exception() throw();
+extern _LIBCXXABI_FUNC_VIS unsigned int __cxa_uncaught_exceptions() throw();
+
+#if defined(__linux__) || defined(__Fuchsia__)
+// Linux and Fuchsia TLS support. Not yet an official part of the Itanium ABI.
+// https://sourceware.org/glibc/wiki/Destructor%20support%20for%20thread_local%20variables
+extern _LIBCXXABI_FUNC_VIS int __cxa_thread_atexit(void (*)(void *), void *,
+                                                   void *) throw();
+#endif
+
+} // extern "C"
+} // namespace __cxxabiv1
+
+namespace abi = __cxxabiv1;
+
+#endif // __cplusplus
+
+#endif // __CXXABI_H
diff --git a/app/src/main/cpp/libcxx/include/algorithm b/app/src/main/cpp/libcxx/include/algorithm
new file mode 100644
index 0000000..cb2d27c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/algorithm
@@ -0,0 +1,1926 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_ALGORITHM
+#define _LIBCPP_ALGORITHM
+
+/*
+    algorithm synopsis
+
+#include <initializer_list>
+
+namespace std
+{
+
+namespace ranges {
+
+  // [algorithms.results], algorithm result types
+  template <class I, class F>
+    struct in_fun_result;     // since C++20
+
+  template <class I1, class I2>
+    struct in_in_result;      // since C++20
+
+  template <class I, class O>
+    struct in_out_result;  // since C++20
+
+  template <class I1, class I2, class O>
+    struct in_in_out_result;  // since C++20
+
+  template <class I, class O1, class O2>
+    struct in_out_out_result; // since C++20
+
+  template <class I1, class I2>
+    struct min_max_result;    // since C++20
+
+  template <class I>
+    struct in_found_result;   // since C++20
+
+  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
+    indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>             // since C++20
+  constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
+
+  template<forward_range R, class Proj = identity,
+    indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20
+  constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
+
+  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
+    indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
+  constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {});                        // since C++20
+
+  template<forward_range R, class Proj = identity,
+    indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+  constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {});             // since C++20
+
+  template<class I1, class I2>
+    using mismatch_result = in_in_result<I1, I2>;
+
+  template <input_iterator I1, sentinel_for<_I1> S1, input_iterator I2, sentinel_for<_I2> S2,
+          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
+    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
+  constexpr mismatch_result<_I1, _I2>
+  mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20
+
+  template <input_range R1, input_range R2,
+          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
+    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
+  constexpr mismatch_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
+  mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {})                           // since C++20
+
+    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
+    constexpr I find(I first, S last, const T& value, Proj proj = {});              // since C++20
+
+  template<input_range R, class T, class Proj = identity>
+    requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
+    constexpr borrowed_iterator_t<R>
+      find(R&& r, const T& value, Proj proj = {});                                  // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    constexpr I find_if(I first, S last, Pred pred, Proj proj = {});                // since C++20
+
+  template<input_range R, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    constexpr borrowed_iterator_t<R>
+      find_if(R&& r, Pred pred, Proj proj = {});                                    // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {});            // since C++20
+
+  template<input_range R, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    constexpr borrowed_iterator_t<R>
+      find_if_not(R&& r, Pred pred, Proj proj = {});                                // since C++20
+
+  template<class T, class Proj = identity,
+           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
+    constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
+
+  template<copyable T, class Proj = identity,
+           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
+    constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {});         // since C++20
+
+ template<input_range R, class Proj = identity,
+          indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+   requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
+   constexpr range_value_t<R>
+     min(R&& r, Comp comp = {}, Proj proj = {});                                    // since C++20
+
+  template<class T, class Proj = identity,
+           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
+    constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
+
+  template<copyable T, class Proj = identity,
+           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
+    constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {});         // since C++20
+
+  template<input_range R, class Proj = identity,
+           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+    requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
+    constexpr range_value_t<R>
+      max(R&& r, Comp comp = {}, Proj proj = {});                                   // since C++20
+
+  template<class I, class O>
+    using unary_transform_result = in_out_result<I, O>;                             // since C++20
+
+  template<class I1, class I2, class O>
+    using binary_transform_result = in_in_out_result<I1, I2, O>;                    // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O,
+           copy_constructible F, class Proj = identity>
+    requires indirectly_writable<O, indirect_result_t<F&, projected<I, Proj>>>
+    constexpr ranges::unary_transform_result<I, O>
+      transform(I first1, S last1, O result, F op, Proj proj = {});                 // since C++20
+
+  template<input_range R, weakly_incrementable O, copy_constructible F,
+           class Proj = identity>
+    requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R>, Proj>>>
+    constexpr ranges::unary_transform_result<borrowed_iterator_t<R>, O>
+      transform(R&& r, O result, F op, Proj proj = {});                             // since C++20
+
+  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
+           weakly_incrementable O, copy_constructible F, class Proj1 = identity,
+           class Proj2 = identity>
+    requires indirectly_writable<O, indirect_result_t<F&, projected<I1, Proj1>,
+                                           projected<I2, Proj2>>>
+    constexpr ranges::binary_transform_result<I1, I2, O>
+      transform(I1 first1, S1 last1, I2 first2, S2 last2, O result,
+                        F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {});           // since C++20
+
+  template<input_range R1, input_range R2, weakly_incrementable O,
+           copy_constructible F, class Proj1 = identity, class Proj2 = identity>
+    requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R1>, Proj1>,
+                                           projected<iterator_t<R2>, Proj2>>>
+    constexpr ranges::binary_transform_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
+      transform(R1&& r1, R2&& r2, O result,
+                        F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {});           // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity>
+    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
+    constexpr iter_difference_t<I>
+      count(I first, S last, const T& value, Proj proj = {});                       // since C++20
+
+  template<input_range R, class T, class Proj = identity>
+    requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
+    constexpr range_difference_t<R>
+      count(R&& r, const T& value, Proj proj = {});                                 // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    constexpr iter_difference_t<I>
+      count_if(I first, S last, Pred pred, Proj proj = {});                         // since C++20
+
+  template<input_range R, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    constexpr range_difference_t<R>
+      count_if(R&& r, Pred pred, Proj proj = {});                                   // since C++20
+
+  template<class T>
+  using minmax_result = min_max_result<T>;
+
+  template<class T, class Proj = identity,
+           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
+    constexpr ranges::minmax_result<const T&>
+      minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {});                     // since C++20
+
+  template<copyable T, class Proj = identity,
+           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
+    constexpr ranges::minmax_result<T>
+      minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {});                      // since C++20
+
+  template<input_range R, class Proj = identity,
+           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+    requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
+    constexpr ranges::minmax_result<range_value_t<R>>
+      minmax(R&& r, Comp comp = {}, Proj proj = {});                                      // since C++20
+
+  template<class I>
+  using minmax_element_result = min_max_result<I>;
+
+  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
+    constexpr ranges::minmax_element_result<I>
+      minmax_element(I first, S last, Comp comp = {}, Proj proj = {});                    // since C++20
+
+  template<forward_range R, class Proj = identity,
+           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+    constexpr ranges::minmax_element_result<borrowed_iterator_t<R>>
+      minmax_element(R&& r, Comp comp = {}, Proj proj = {});                              // since C++20
+
+  template<class I, class O>
+    using copy_result = in_out_result<I, O>;                                              // since C++20
+
+  template<class I, class O>
+    using copy_n_result = in_out_result<I, O>;                                            // since C++20
+
+  template<class I, class O>
+    using copy_if_result = in_out_result<I, O>;                                             // since C++20
+
+  template<class I1, class I2>
+    using copy_backward_result = in_out_result<I1, I2>;                                     // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O>
+    requires indirectly_copyable<I, O>
+    constexpr ranges::copy_result<I, O> ranges::copy(I first, S last, O result);            // since C++20
+
+  template<input_range R, weakly_incrementable O>
+    requires indirectly_copyable<iterator_t<R>, O>
+    constexpr ranges::copy_result<borrowed_iterator_t<R>, O> ranges::copy(R&& r, O result); // since C++20
+
+  template<input_iterator I, weakly_incrementable O>
+    requires indirectly_copyable<I, O>
+    constexpr ranges::copy_n_result<I, O>
+      ranges::copy_n(I first, iter_difference_t<I> n, O result);                            // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    requires indirectly_copyable<I, O>
+    constexpr ranges::copy_if_result<I, O>
+      ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {});                // since C++20
+
+  template<input_range R, weakly_incrementable O, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    requires indirectly_copyable<iterator_t<R>, O>
+    constexpr ranges::copy_if_result<borrowed_iterator_t<R>, O>
+      ranges::copy_if(R&& r, O result, Pred pred, Proj proj = {});                          // since C++20
+
+  template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2>
+    requires indirectly_copyable<I1, I2>
+    constexpr ranges::copy_backward_result<I1, I2>
+      ranges::copy_backward(I1 first, S1 last, I2 result);                                  // since C++20
+
+  template<bidirectional_range R, bidirectional_iterator I>
+    requires indirectly_copyable<iterator_t<R>, I>
+    constexpr ranges::copy_backward_result<borrowed_iterator_t<R>, I>
+      ranges::copy_backward(R&& r, I result);                                               // since C++20
+
+  template<class I, class F>
+    using for_each_result = in_fun_result<I, F>;                                            // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirectly_unary_invocable<projected<I, Proj>> Fun>
+    constexpr ranges::for_each_result<I, Fun>
+      ranges::for_each(I first, S last, Fun f, Proj proj = {});                             // since C++20
+
+  template<input_range R, class Proj = identity,
+           indirectly_unary_invocable<projected<iterator_t<R>, Proj>> Fun>
+    constexpr ranges::for_each_result<borrowed_iterator_t<R>, Fun>
+      ranges::for_each(R&& r, Fun f, Proj proj = {});                                       // since C++20
+
+  template<input_iterator I, class Proj = identity,
+           indirectly_unary_invocable<projected<I, Proj>> Fun>
+    constexpr ranges::for_each_n_result<I, Fun>
+      ranges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {});           // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {});      // since C++20
+
+  template<input_range R, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {});                // since C++20
+
+  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
+          class Proj = identity>
+    requires sortable<I, Comp, Proj>
+    constexpr I
+      ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {});                   // since C++20
+
+  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
+    requires sortable<iterator_t<R>, Comp, Proj>
+    constexpr borrowed_iterator_t<R>
+      ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {});                             // since C++20
+
+  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
+          class Proj = identity>
+    requires sortable<I, Comp, Proj>
+    constexpr I
+      ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {});                    // since C++20
+
+  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
+    requires sortable<iterator_t<R>, Comp, Proj>
+    constexpr borrowed_iterator_t<R>
+      ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {});                              // since C++20
+
+  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
+          class Proj = identity>
+    requires sortable<I, Comp, Proj>
+    constexpr I
+      ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {});                   // since C++20
+
+  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
+    requires sortable<iterator_t<R>, Comp, Proj>
+    constexpr borrowed_iterator_t<R>
+      ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {});                             // since C++20
+
+  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
+          class Proj = identity>
+    requires sortable<I, Comp, Proj>
+    constexpr I
+      ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {});                   // since C++20
+
+  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
+    requires sortable<iterator_t<R>, Comp, Proj>
+    constexpr borrowed_iterator_t<R>
+      ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {});                             // since C++20
+
+  template<random_access_iterator I, sentinel_for<I> S, class Proj = identity,
+            indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
+    constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {});                // Since C++20
+
+  template<random_access_range R, class Proj = identity,
+            indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+    constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {});                          // Since C++20
+
+  template<random_access_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
+    constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {});             // Since C++20
+
+  template<random_access_range R, class Proj = identity,
+           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+    constexpr borrowed_iterator_t<R>
+      is_heap_until(R&& r, Comp comp = {}, Proj proj = {});                                 // Since C++20
+
+  template<bidirectional_iterator I, sentinel_for<I> S>
+    requires permutable<I>
+    constexpr I ranges::reverse(I first, S last);                                           // since C++20
+
+  template<bidirectional_range R>
+    requires permutable<iterator_t<R>>
+    constexpr borrowed_iterator_t<R> ranges::reverse(R&& r);                                // since C++20
+
+  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
+            class Proj = identity>
+    requires sortable<I, Comp, Proj>
+    constexpr I
+      ranges::sort(I first, S last, Comp comp = {}, Proj proj = {});                        // since C++20
+
+  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
+    requires sortable<iterator_t<R>, Comp, Proj>
+    constexpr borrowed_iterator_t<R>
+      ranges::sort(R&& r, Comp comp = {}, Proj proj = {});                                  // since C++20
+
+  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
+          class Proj = identity>
+    requires sortable<I, Comp, Proj>
+    I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {});                 // since C++20
+
+  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
+    requires sortable<iterator_t<R>, Comp, Proj>
+    borrowed_iterator_t<R>
+      ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {});                           // since C++20
+
+  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
+           class Proj = identity>
+    requires sortable<I, Comp, Proj>
+    constexpr I
+      ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {});      // since C++20
+
+  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
+    requires sortable<iterator_t<R>, Comp, Proj>
+    constexpr borrowed_iterator_t<R>
+      ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {});    // since C++20
+
+  template<class T, output_iterator<const T&> O, sentinel_for<O> S>
+    constexpr O ranges::fill(O first, S last, const T& value);                              // since C++20
+
+  template<class T, output_range<const T&> R>
+    constexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value);                   // since C++20
+
+  template<class T, output_iterator<const T&> O>
+    constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value);            // since C++20
+
+  template<input_or_output_iterator O, sentinel_for<O> S, copy_constructible F>
+    requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>>
+    constexpr O generate(O first, S last, F gen);                                           // Since C++20
+
+  template<class R, copy_constructible F>
+    requires invocable<F&> && output_range<R, invoke_result_t<F&>>
+    constexpr borrowed_iterator_t<R> generate(R&& r, F gen);                                // Since C++20
+
+  template<input_or_output_iterator O, copy_constructible F>
+    requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>>
+    constexpr O generate_n(O first, iter_difference_t<O> n, F gen);                         // Since C++20
+
+ template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
+          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
+   requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
+   constexpr bool ranges::equal(I1 first1, S1 last1, I2 first2, S2 last2,
+                                Pred pred = {},
+                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
+
+ template<input_range R1, input_range R2, class Pred = ranges::equal_to,
+          class Proj1 = identity, class Proj2 = identity>
+   requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
+   constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {},
+                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {});      // since C++20
+
+  template<input_range R, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {});                // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {});      // since C++20
+
+  template<input_range R, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {});                // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {});     // since C++20
+
+  template<input_range R, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {});               // since C++20
+
+  template<input_iterator I1, sentinel_for<I1> S1,
+          random_access_iterator I2, sentinel_for<I2> S2,
+          class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
+    requires indirectly_copyable<I1, I2> && sortable<I2, Comp, Proj2> &&
+            indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
+    constexpr partial_sort_copy_result<I1, I2>
+      partial_sort_copy(I1 first, S1 last, I2 result_first, S2 result_last,
+                        Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});        // Since C++20
+
+  template<input_range R1, random_access_range R2, class Comp = ranges::less,
+          class Proj1 = identity, class Proj2 = identity>
+    requires indirectly_copyable<iterator_t<R1>, iterator_t<R2>> &&
+            sortable<iterator_t<R2>, Comp, Proj2> &&
+            indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
+                                        projected<iterator_t<R2>, Proj2>>
+    constexpr partial_sort_copy_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
+      partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
+                        Proj1 proj1 = {}, Proj2 proj2 = {});                        // Since C++20
+
+  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
+    constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {});      // since C++20
+
+  template<forward_range R, class Proj = identity,
+           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+    constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {});                // since C++20
+
+  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
+    constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {});   // since C++20
+
+  template<forward_range R, class Proj = identity,
+           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+    constexpr borrowed_iterator_t<R>
+      ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {});                       // since C++20
+
+  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
+          class Proj = identity>
+    requires sortable<I, Comp, Proj>
+    constexpr I
+      ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {});            // since C++20
+
+  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
+    requires sortable<iterator_t<R>, Comp, Proj>
+    constexpr borrowed_iterator_t<R>
+      ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {});          // since C++20
+
+  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
+           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
+    constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
+
+  template<forward_range R, class T, class Proj = identity,
+           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
+             ranges::less>
+    constexpr borrowed_iterator_t<R>
+      upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                     // since C++20
+
+  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
+           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
+    constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
+                                    Proj proj = {});                                          // since C++20
+  template<forward_range R, class T, class Proj = identity,
+           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
+             ranges::less>
+    constexpr borrowed_iterator_t<R>
+      lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                     // since C++20
+
+  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
+           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
+    constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
+                                         Proj proj = {});                                     // since C++20
+
+  template<forward_range R, class T, class Proj = identity,
+           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
+             ranges::less>
+    constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
+                                         Proj proj = {});                                     // since C++20
+
+  template<permutable I, sentinel_for<I> S, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    constexpr subrange<I>
+      partition(I first, S last, Pred pred, Proj proj = {});                                  // Since C++20
+
+  template<forward_range R, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    requires permutable<iterator_t<R>>
+    constexpr borrowed_subrange_t<R>
+      partition(R&& r, Pred pred, Proj proj = {});                                            // Since C++20
+
+  template<bidirectional_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    requires permutable<I>
+    subrange<I> stable_partition(I first, S last, Pred pred, Proj proj = {});                 // Since C++20
+
+  template<bidirectional_range R, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    requires permutable<iterator_t<R>>
+    borrowed_subrange_t<R> stable_partition(R&& r, Pred pred, Proj proj = {});                // Since C++20
+
+  template<input_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2,
+           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
+    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
+    constexpr I1 ranges::find_first_of(I1 first1, S1 last1, I2 first2, S2 last2,
+                                       Pred pred = {},
+                                       Proj1 proj1 = {}, Proj2 proj2 = {});                 // since C++20
+
+  template<input_range R1, forward_range R2,
+           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
+    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
+    constexpr borrowed_iterator_t<R1>
+      ranges::find_first_of(R1&& r1, R2&& r2,
+                            Pred pred = {},
+                            Proj1 proj1 = {}, Proj2 proj2 = {});                            // since C++20
+
+  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_binary_predicate<projected<I, Proj>,
+                                     projected<I, Proj>> Pred = ranges::equal_to>
+    constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {});     // since C+20
+
+  template<forward_range R, class Proj = identity,
+           indirect_binary_predicate<projected<iterator_t<R>, Proj>,
+                                     projected<iterator_t<R>, Proj>> Pred = ranges::equal_to>
+    constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {});  // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class T1, class T2, class Proj = identity>
+    requires indirectly_writable<I, const T2&> &&
+             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*>
+    constexpr I
+      ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {});   // since C++20
+
+  template<input_range R, class T1, class T2, class Proj = identity>
+    requires indirectly_writable<iterator_t<R>, const T2&> &&
+             indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*>
+    constexpr borrowed_iterator_t<R>
+      ranges::replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {});             // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    requires indirectly_writable<I, const T&>
+    constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20
+
+  template<input_range R, class T, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    requires indirectly_writable<iterator_t<R>, const T&>
+    constexpr borrowed_iterator_t<R>
+      ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {});                     // since C++20
+
+  template<class T, class Proj = identity,
+           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
+    constexpr const T&
+      ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {});          // since C++20
+
+  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
+           class Proj1 = identity, class Proj2 = identity,
+           indirect_strict_weak_order<projected<I1, Proj1>,
+                                      projected<I2, Proj2>> Comp = ranges::less>
+    constexpr bool
+      ranges::lexicographical_compare(I1 first1, S1 last1, I2 first2, S2 last2,
+                                      Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});    // since C++20
+
+  template<input_range R1, input_range R2, class Proj1 = identity,
+           class Proj2 = identity,
+           indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
+                                      projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
+    constexpr bool
+      ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
+                                      Proj1 proj1 = {}, Proj2 proj2 = {});                    // since C++20
+
+  template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2>
+    requires indirectly_movable<I1, I2>
+    constexpr ranges::move_backward_result<I1, I2>
+      ranges::move_backward(I1 first, S1 last, I2 result);                                          // since C++20
+
+  template<bidirectional_range R, bidirectional_iterator I>
+    requires indirectly_movable<iterator_t<R>, I>
+    constexpr ranges::move_backward_result<borrowed_iterator_t<R>, I>
+      ranges::move_backward(R&& r, I result);                                                       // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O>
+    requires indirectly_movable<I, O>
+    constexpr ranges::move_result<I, O>
+      ranges::move(I first, S last, O result);                                                      // since C++20
+
+  template<input_range R, weakly_incrementable O>
+    requires indirectly_movable<iterator_t<R>, O>
+    constexpr ranges::move_result<borrowed_iterator_t<R>, O>
+      ranges::move(R&& r, O result);                                                                // since C++20
+
+  template<class I, class O1, class O2>
+      using partition_copy_result = in_out_out_result<I, O1, O2>;                                   // since C++20
+
+  template<input_iterator I, sentinel_for<I> S,
+          weakly_incrementable O1, weakly_incrementable O2,
+          class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>
+    requires indirectly_copyable<I, O1> && indirectly_copyable<I, O2>
+    constexpr partition_copy_result<I, O1, O2>
+      partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred,
+                    Proj proj = {});                                                                // Since C++20
+
+  template<input_range R, weakly_incrementable O1, weakly_incrementable O2,
+          class Proj = identity,
+          indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    requires indirectly_copyable<iterator_t<R>, O1> &&
+            indirectly_copyable<iterator_t<R>, O2>
+    constexpr partition_copy_result<borrowed_iterator_t<R>, O1, O2>
+      partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {});                  // Since C++20
+
+  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    constexpr I partition_point(I first, S last, Pred pred, Proj proj = {});                        // Since C++20
+
+  template<forward_range R, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    constexpr borrowed_iterator_t<R>
+      partition_point(R&& r, Pred pred, Proj proj = {});                                            // Since C++20
+
+  template<class I1, class I2, class O>
+    using merge_result = in_in_out_result<I1, I2, O>;                                               // since C++20
+
+  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
+           weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity,
+           class Proj2 = identity>
+    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
+    constexpr merge_result<I1, I2, O>
+      merge(I1 first1, S1 last1, I2 first2, S2 last2, O result,
+            Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                                    // since C++20
+
+  template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less,
+           class Proj1 = identity, class Proj2 = identity>
+    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
+    constexpr merge_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
+      merge(R1&& r1, R2&& r2, O result,
+            Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                                    // since C++20
+
+  template<permutable I, sentinel_for<I> S, class T, class Proj = identity>
+    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
+    constexpr subrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {});          // since C++20
+
+  template<forward_range R, class T, class Proj = identity>
+    requires permutable<iterator_t<R>> &&
+             indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
+    constexpr borrowed_subrange_t<R>
+      ranges::remove(R&& r, const T& value, Proj proj = {});                                        // since C++20
+
+  template<permutable I, sentinel_for<I> S, class Proj = identity,
+           indirect_unary_predicate<projected<I, Proj>> Pred>
+    constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {});            // since C++20
+
+  template<forward_range R, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    requires permutable<iterator_t<R>>
+    constexpr borrowed_subrange_t<R>
+      ranges::remove_if(R&& r, Pred pred, Proj proj = {});                                          // since C++20
+
+  template<class I, class O>
+    using set_difference_result = in_out_result<I, O>;                                              // since C++20
+
+  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
+           weakly_incrementable O, class Comp = ranges::less,
+           class Proj1 = identity, class Proj2 = identity>
+    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
+    constexpr set_difference_result<I1, O>
+      set_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result,
+                     Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                           // since C++20
+
+  template<input_range R1, input_range R2, weakly_incrementable O,
+           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
+    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
+    constexpr set_difference_result<borrowed_iterator_t<R1>, O>
+      set_difference(R1&& r1, R2&& r2, O result,
+                     Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                           // since C++20
+
+  template<class I1, class I2, class O>
+    using set_intersection_result = in_in_out_result<I1, I2, O>;                                    // since C++20
+
+  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
+           weakly_incrementable O, class Comp = ranges::less,
+           class Proj1 = identity, class Proj2 = identity>
+    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
+    constexpr set_intersection_result<I1, I2, O>
+      set_intersection(I1 first1, S1 last1, I2 first2, S2 last2, O result,
+                       Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                         // since C++20
+
+  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
+           weakly_incrementable O, class Comp = ranges::less,
+           class Proj1 = identity, class Proj2 = identity>
+    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
+    constexpr set_intersection_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
+      set_intersection(R1&& r1, R2&& r2, O result,
+                       Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                         // since C++20
+
+  template <class _InIter, class _OutIter>
+  using reverse_copy_result = in_out_result<_InIter, _OutIter>;                                     // since C++20
+
+  template<bidirectional_iterator I, sentinel_for<I> S, weakly_incrementable O>
+    requires indirectly_copyable<I, O>
+    constexpr ranges::reverse_copy_result<I, O>
+      ranges::reverse_copy(I first, S last, O result);                                              // since C++20
+
+  template<bidirectional_range R, weakly_incrementable O>
+    requires indirectly_copyable<iterator_t<R>, O>
+    constexpr ranges::reverse_copy_result<borrowed_iterator_t<R>, O>
+      ranges::reverse_copy(R&& r, O result);                                                        // since C++20
+
+  template<permutable I, sentinel_for<I> S>
+    constexpr subrange<I> rotate(I first, I middle, S last);                                        // since C++20
+
+  template<forward_range R>
+    requires permutable<iterator_t<R>>
+    constexpr borrowed_subrange_t<R> rotate(R&& r, iterator_t<R> middle);                           // Since C++20
+
+  template <class _InIter, class _OutIter>
+  using rotate_copy_result = in_out_result<_InIter, _OutIter>;                                      // since C++20
+
+  template<forward_iterator I, sentinel_for<I> S, weakly_incrementable O>
+    requires indirectly_copyable<I, O>
+    constexpr ranges::rotate_copy_result<I, O>
+      ranges::rotate_copy(I first, I middle, S last, O result);                                     // since C++20
+
+  template<forward_range R, weakly_incrementable O>
+    requires indirectly_copyable<iterator_t<R>, O>
+    constexpr ranges::rotate_copy_result<borrowed_iterator_t<R>, O>
+      ranges::rotate_copy(R&& r, iterator_t<R> middle, O result);                                   // since C++20
+
+  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Gen>
+    requires (forward_iterator<I> || random_access_iterator<O>) &&
+            indirectly_copyable<I, O> &&
+            uniform_random_bit_generator<remove_reference_t<Gen>>
+    O sample(I first, S last, O out, iter_difference_t<I> n, Gen&& g);                              // Since C++20
+
+  template<input_range R, weakly_incrementable O, class Gen>
+    requires (forward_range<R> || random_access_iterator<O>) &&
+            indirectly_copyable<iterator_t<R>, O> &&
+            uniform_random_bit_generator<remove_reference_t<Gen>>
+    O sample(R&& r, O out, range_difference_t<R> n, Gen&& g);                                       // Since C++20
+
+  template<random_access_iterator I, sentinel_for<I> S, class Gen>
+    requires permutable<I> &&
+            uniform_random_bit_generator<remove_reference_t<Gen>>
+    I shuffle(I first, S last, Gen&& g);                                                           // Since C++20
+
+  template<random_access_range R, class Gen>
+    requires permutable<iterator_t<R>> &&
+            uniform_random_bit_generator<remove_reference_t<Gen>>
+    borrowed_iterator_t<R> shuffle(R&& r, Gen&& g);                                                // Since C++20
+
+  template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2,
+         sentinel_for<I2> S2, class Proj1 = identity, class Proj2 = identity,
+         indirect_equivalence_relation<projected<I1, Proj1>,
+                                       projected<I2, Proj2>> Pred = ranges::equal_to>
+  constexpr bool ranges::is_permutation(I1 first1, S1 last1, I2 first2, S2 last2,
+                                        Pred pred = {},
+                                        Proj1 proj1 = {}, Proj2 proj2 = {});                       // Since C++20
+
+  template<forward_range R1, forward_range R2,
+         class Proj1 = identity, class Proj2 = identity,
+         indirect_equivalence_relation<projected<iterator_t<R1>, Proj1>,
+                                       projected<iterator_t<R2>, Proj2>> Pred = ranges::equal_to>
+  constexpr bool ranges::is_permutation(R1&& r1, R2&& r2, Pred pred = {},
+                                        Proj1 proj1 = {}, Proj2 proj2 = {});                       // Since C++20
+
+  template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2,
+           sentinel_for<I2> S2, class Pred = ranges::equal_to,
+           class Proj1 = identity, class Proj2 = identity>
+    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
+    constexpr subrange<I1>
+      ranges::search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
+                     Proj1 proj1 = {}, Proj2 proj2 = {});                                           // since C++20
+
+  template<forward_range R1, forward_range R2, class Pred = ranges::equal_to,
+           class Proj1 = identity, class Proj2 = identity>
+    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
+    constexpr borrowed_subrange_t<R1>
+      ranges::search(R1&& r1, R2&& r2, Pred pred = {},
+                     Proj1 proj1 = {}, Proj2 proj2 = {});                                           // since C++20
+
+  template<forward_iterator I, sentinel_for<I> S, class T,
+           class Pred = ranges::equal_to, class Proj = identity>
+    requires indirectly_comparable<I, const T*, Pred, Proj>
+    constexpr subrange<I>
+      ranges::search_n(I first, S last, iter_difference_t<I> count,
+                       const T& value, Pred pred = {}, Proj proj = {});                             // since C++20
+
+  template<forward_range R, class T, class Pred = ranges::equal_to,
+           class Proj = identity>
+    requires indirectly_comparable<iterator_t<R>, const T*, Pred, Proj>
+    constexpr borrowed_subrange_t<R>
+      ranges::search_n(R&& r, range_difference_t<R> count,
+                       const T& value, Pred pred = {}, Proj proj = {});                             // since C++20
+
+  template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2,
+           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
+    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
+    constexpr subrange<I1>
+      ranges::find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
+                       Proj1 proj1 = {}, Proj2 proj2 = {});                                         // since C++20
+
+  template<forward_range R1, forward_range R2,
+           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
+    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
+    constexpr borrowed_subrange_t<R1>
+      ranges::find_end(R1&& r1, R2&& r2, Pred pred = {},
+                       Proj1 proj1 = {}, Proj2 proj2 = {});                                         // since C++20
+
+  template<class I1, class I2, class O>
+    using set_symmetric_difference_result = in_in_out_result<I1, I2, O>;                            // since C++20
+
+  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
+           weakly_incrementable O, class Comp = ranges::less,
+           class Proj1 = identity, class Proj2 = identity>
+    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
+    constexpr set_symmetric_difference_result<I1, I2, O>
+      set_symmetric_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result,
+                               Comp comp = {}, Proj1 proj1 = {},
+                               Proj2 proj2 = {});                                                   // since C++20
+
+  template<input_range R1, input_range R2, weakly_incrementable O,
+           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
+    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
+    constexpr set_symmetric_difference_result<borrowed_iterator_t<R1>,
+                                                      borrowed_iterator_t<R2>, O>
+      set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
+                               Proj1 proj1 = {}, Proj2 proj2 = {});                                 // since C++20
+
+  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
+           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
+    constexpr subrange<I>
+      equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {});                 // since C++20
+
+  template<forward_range R, class T, class Proj = identity,
+           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
+             ranges::less>
+    constexpr borrowed_subrange_t<R>
+      equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {});                           // since C++20
+
+  template<class I1, class I2, class O>
+    using set_union_result = in_in_out_result<I1, I2, O>;                                           // since C++20
+
+  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
+           weakly_incrementable O, class Comp = ranges::less,
+           class Proj1 = identity, class Proj2 = identity>
+    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
+    constexpr set_union_result<I1, I2, O>
+      set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
+                Proj1 proj1 = {}, Proj2 proj2 = {});                                                // since C++20
+
+  template<input_range R1, input_range R2, weakly_incrementable O,
+           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
+    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
+    constexpr set_union_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
+      set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
+                Proj1 proj1 = {}, Proj2 proj2 = {});                                                // since C++20
+
+  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
+           class Proj1 = identity, class Proj2 = identity,
+           indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp =
+             ranges::less>
+    constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
+                            Proj1 proj1 = {}, Proj2 proj2 = {});                                   // Since C++20
+
+  template<input_range R1, input_range R2, class Proj1 = identity,
+           class Proj2 = identity,
+           indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
+                                      projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
+    constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
+                            Proj1 proj1 = {}, Proj2 proj2 = {});                                   // Since C++20
+
+  template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
+           class Proj = identity>
+    requires sortable<I, Comp, Proj>
+    I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {});                    // Since C++20
+
+  template<bidirectional_range R, class Comp = ranges::less, class Proj = identity>
+    requires sortable<iterator_t<R>, Comp, Proj>
+    borrowed_iterator_t<R>
+      inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {},
+                    Proj proj = {});                                                               // Since C++20
+
+  template<permutable I, sentinel_for<I> S, class Proj = identity,
+           indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to>
+    constexpr subrange<I> unique(I first, S last, C comp = {}, Proj proj = {});                    // Since C++20
+
+  template<forward_range R, class Proj = identity,
+           indirect_equivalence_relation<projected<iterator_t<R>, Proj>> C = ranges::equal_to>
+    requires permutable<iterator_t<R>>
+    constexpr borrowed_subrange_t<R>
+      unique(R&& r, C comp = {}, Proj proj = {});                                                  // Since C++20
+
+  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity,
+           indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to>
+    requires indirectly_copyable<I, O> &&
+             (forward_iterator<I> ||
+              (input_iterator<O> && same_as<iter_value_t<I>, iter_value_t<O>>) ||
+              indirectly_copyable_storable<I, O>)
+    constexpr unique_copy_result<I, O>
+      unique_copy(I first, S last, O result, C comp = {}, Proj proj = {});                         // Since C++20
+
+  template<input_range R, weakly_incrementable O, class Proj = identity,
+           indirect_equivalence_relation<projected<iterator_t<R>, Proj>> C = ranges::equal_to>
+    requires indirectly_copyable<iterator_t<R>, O> &&
+             (forward_iterator<iterator_t<R>> ||
+              (input_iterator<O> && same_as<range_value_t<R>, iter_value_t<O>>) ||
+              indirectly_copyable_storable<iterator_t<R>, O>)
+    constexpr unique_copy_result<borrowed_iterator_t<R>, O>
+      unique_copy(R&& r, O result, C comp = {}, Proj proj = {});                                   // Since C++20
+
+  template<class I, class O>
+      using remove_copy_result = in_out_result<I, O>;                                              // Since C++20
+
+  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class T,
+           class Proj = identity>
+             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
+    constexpr remove_copy_result<I, O>
+      remove_copy(I first, S last, O result, const T& value, Proj proj = {});                      // Since C++20
+
+  template<input_range R, weakly_incrementable O, class T, class Proj = identity>
+    requires indirectly_copyable<iterator_t<R>, O> &&
+             indirect_binary_predicate<ranges::equal_to,
+                                       projected<iterator_t<R>, Proj>, const T*>
+    constexpr remove_copy_result<borrowed_iterator_t<R>, O>
+      remove_copy(R&& r, O result, const T& value, Proj proj = {});                                // Since C++20
+
+  template<class I, class O>
+      using remove_copy_if_result = in_out_result<I, O>;                                           // Since C++20
+
+  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O,
+           class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>
+    requires indirectly_copyable<I, O>
+    constexpr remove_copy_if_result<I, O>
+      remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {});                        // Since C++20
+
+  template<input_range R, weakly_incrementable O, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    requires indirectly_copyable<iterator_t<R>, O>
+    constexpr remove_copy_if_result<borrowed_iterator_t<R>, O>
+      remove_copy_if(R&& r, O result, Pred pred, Proj proj = {});                                  // Since C++20
+
+  template<class I, class O>
+      using replace_copy_result = in_out_result<I, O>;                                             // Since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class T1, class T2,
+           output_iterator<const T2&> O, class Proj = identity>
+    requires indirectly_copyable<I, O> &&
+             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*>
+    constexpr replace_copy_result<I, O>
+      replace_copy(I first, S last, O result, const T1& old_value, const T2& new_value,
+                   Proj proj = {});                                                                // Since C++20
+
+  template<input_range R, class T1, class T2, output_iterator<const T2&> O,
+           class Proj = identity>
+    requires indirectly_copyable<iterator_t<R>, O> &&
+             indirect_binary_predicate<ranges::equal_to,
+                                       projected<iterator_t<R>, Proj>, const T1*>
+    constexpr replace_copy_result<borrowed_iterator_t<R>, O>
+      replace_copy(R&& r, O result, const T1& old_value, const T2& new_value,
+                   Proj proj = {});                                                                // Since C++20
+
+  template<class I, class O>
+      using replace_copy_if_result = in_out_result<I, O>;                                          // Since C++20
+
+  template<input_iterator I, sentinel_for<I> S, class T, output_iterator<const T&> O,
+           class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>
+    requires indirectly_copyable<I, O>
+    constexpr replace_copy_if_result<I, O>
+      replace_copy_if(I first, S last, O result, Pred pred, const T& new_value,
+                      Proj proj = {});                                                             // Since C++20
+
+  template<input_range R, class T, output_iterator<const T&> O, class Proj = identity,
+           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
+    requires indirectly_copyable<iterator_t<R>, O>
+    constexpr replace_copy_if_result<borrowed_iterator_t<R>, O>
+      replace_copy_if(R&& r, O result, Pred pred, const T& new_value,
+                      Proj proj = {});                                                             // Since C++20
+
+  template<class I>
+    using prev_permutation_result = in_found_result<I>;                                            // Since C++20
+
+  template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
+           class Proj = identity>
+    requires sortable<I, Comp, Proj>
+    constexpr ranges::prev_permutation_result<I>
+      ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {});                   // Since C++20
+
+  template<bidirectional_range R, class Comp = ranges::less,
+           class Proj = identity>
+    requires sortable<iterator_t<R>, Comp, Proj>
+    constexpr ranges::prev_permutation_result<borrowed_iterator_t<R>>
+      ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {});                             // Since C++20
+
+  template<class I>
+    using next_permutation_result = in_found_result<I>;                                            // Since C++20
+
+  template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
+           class Proj = identity>
+    requires sortable<I, Comp, Proj>
+    constexpr ranges::next_permutation_result<I>
+      ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {});                   // Since C++20
+
+  template<bidirectional_range R, class Comp = ranges::less,
+           class Proj = identity>
+    requires sortable<iterator_t<R>, Comp, Proj>
+    constexpr ranges::next_permutation_result<borrowed_iterator_t<R>>
+      ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {});                             // Since C++20
+
+}
+
+template <class InputIterator, class Predicate>
+    constexpr bool     // constexpr in C++20
+    all_of(InputIterator first, InputIterator last, Predicate pred);
+
+template <class InputIterator, class Predicate>
+    constexpr bool     // constexpr in C++20
+    any_of(InputIterator first, InputIterator last, Predicate pred);
+
+template <class InputIterator, class Predicate>
+    constexpr bool     // constexpr in C++20
+    none_of(InputIterator first, InputIterator last, Predicate pred);
+
+template <class InputIterator, class Function>
+    constexpr Function          // constexpr in C++20
+    for_each(InputIterator first, InputIterator last, Function f);
+
+template<class InputIterator, class Size, class Function>
+    constexpr InputIterator     // constexpr in C++20
+    for_each_n(InputIterator first, Size n, Function f); // C++17
+
+template <class InputIterator, class T>
+    constexpr InputIterator     // constexpr in C++20
+    find(InputIterator first, InputIterator last, const T& value);
+
+template <class InputIterator, class Predicate>
+    constexpr InputIterator     // constexpr in C++20
+    find_if(InputIterator first, InputIterator last, Predicate pred);
+
+template<class InputIterator, class Predicate>
+    constexpr InputIterator     // constexpr in C++20
+    find_if_not(InputIterator first, InputIterator last, Predicate pred);
+
+template <class ForwardIterator1, class ForwardIterator2>
+    constexpr ForwardIterator1  // constexpr in C++20
+    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
+             ForwardIterator2 first2, ForwardIterator2 last2);
+
+template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
+    constexpr ForwardIterator1  // constexpr in C++20
+    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
+             ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
+
+template <class ForwardIterator1, class ForwardIterator2>
+    constexpr ForwardIterator1  // constexpr in C++20
+    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
+                  ForwardIterator2 first2, ForwardIterator2 last2);
+
+template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
+    constexpr ForwardIterator1  // constexpr in C++20
+    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
+                  ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
+
+template <class ForwardIterator>
+    constexpr ForwardIterator   // constexpr in C++20
+    adjacent_find(ForwardIterator first, ForwardIterator last);
+
+template <class ForwardIterator, class BinaryPredicate>
+    constexpr ForwardIterator   // constexpr in C++20
+    adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
+
+template <class InputIterator, class T>
+    constexpr typename iterator_traits<InputIterator>::difference_type  // constexpr in C++20
+    count(InputIterator first, InputIterator last, const T& value);
+
+template <class InputIterator, class Predicate>
+    constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20
+    count_if(InputIterator first, InputIterator last, Predicate pred);
+
+template <class InputIterator1, class InputIterator2>
+    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
+    mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
+
+template <class InputIterator1, class InputIterator2>
+    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
+    mismatch(InputIterator1 first1, InputIterator1 last1,
+             InputIterator2 first2, InputIterator2 last2); // **C++14**
+
+template <class InputIterator1, class InputIterator2, class BinaryPredicate>
+    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
+    mismatch(InputIterator1 first1, InputIterator1 last1,
+             InputIterator2 first2, BinaryPredicate pred);
+
+template <class InputIterator1, class InputIterator2, class BinaryPredicate>
+    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
+    mismatch(InputIterator1 first1, InputIterator1 last1,
+             InputIterator2 first2, InputIterator2 last2,
+             BinaryPredicate pred); // **C++14**
+
+template <class InputIterator1, class InputIterator2>
+    constexpr bool      // constexpr in C++20
+    equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
+
+template <class InputIterator1, class InputIterator2>
+    constexpr bool      // constexpr in C++20
+    equal(InputIterator1 first1, InputIterator1 last1,
+          InputIterator2 first2, InputIterator2 last2); // **C++14**
+
+template <class InputIterator1, class InputIterator2, class BinaryPredicate>
+    constexpr bool      // constexpr in C++20
+    equal(InputIterator1 first1, InputIterator1 last1,
+          InputIterator2 first2, BinaryPredicate pred);
+
+template <class InputIterator1, class InputIterator2, class BinaryPredicate>
+    constexpr bool      // constexpr in C++20
+    equal(InputIterator1 first1, InputIterator1 last1,
+          InputIterator2 first2, InputIterator2 last2,
+          BinaryPredicate pred); // **C++14**
+
+template<class ForwardIterator1, class ForwardIterator2>
+    constexpr bool      // constexpr in C++20
+    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
+                   ForwardIterator2 first2);
+
+template<class ForwardIterator1, class ForwardIterator2>
+    constexpr bool      // constexpr in C++20
+    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
+                   ForwardIterator2 first2, ForwardIterator2 last2); // **C++14**
+
+template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
+    constexpr bool      // constexpr in C++20
+    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
+                   ForwardIterator2 first2, BinaryPredicate pred);
+
+template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
+    constexpr bool      // constexpr in C++20
+    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
+                   ForwardIterator2 first2, ForwardIterator2 last2,
+                   BinaryPredicate pred);  // **C++14**
+
+template <class ForwardIterator1, class ForwardIterator2>
+    constexpr ForwardIterator1      // constexpr in C++20
+    search(ForwardIterator1 first1, ForwardIterator1 last1,
+           ForwardIterator2 first2, ForwardIterator2 last2);
+
+template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
+    constexpr ForwardIterator1      // constexpr in C++20
+    search(ForwardIterator1 first1, ForwardIterator1 last1,
+           ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
+
+template <class ForwardIterator, class Size, class T>
+    constexpr ForwardIterator       // constexpr in C++20
+    search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
+
+template <class ForwardIterator, class Size, class T, class BinaryPredicate>
+    constexpr ForwardIterator       // constexpr in C++20
+    search_n(ForwardIterator first, ForwardIterator last,
+             Size count, const T& value, BinaryPredicate pred);
+
+template <class InputIterator, class OutputIterator>
+    constexpr OutputIterator      // constexpr in C++20
+    copy(InputIterator first, InputIterator last, OutputIterator result);
+
+template<class InputIterator, class OutputIterator, class Predicate>
+    constexpr OutputIterator      // constexpr in C++20
+    copy_if(InputIterator first, InputIterator last,
+            OutputIterator result, Predicate pred);
+
+template<class InputIterator, class Size, class OutputIterator>
+    constexpr OutputIterator      // constexpr in C++20
+    copy_n(InputIterator first, Size n, OutputIterator result);
+
+template <class BidirectionalIterator1, class BidirectionalIterator2>
+    constexpr BidirectionalIterator2      // constexpr in C++20
+    copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
+                  BidirectionalIterator2 result);
+
+// [alg.move], move
+template<class InputIterator, class OutputIterator>
+    constexpr OutputIterator move(InputIterator first, InputIterator last,
+                                OutputIterator result);
+
+template<class BidirectionalIterator1, class BidirectionalIterator2>
+    constexpr BidirectionalIterator2
+    move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
+                  BidirectionalIterator2 result);
+
+template <class ForwardIterator1, class ForwardIterator2>
+    constexpr ForwardIterator2    // constexpr in C++20
+    swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2);
+
+namespace ranges {
+    template<class I1, class I2>
+    using swap_ranges_result = in_in_result<I1, I2>;
+
+template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2>
+        requires indirectly_swappable<I1, I2>
+    constexpr ranges::swap_ranges_result<I1, I2>
+        swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2);
+
+template<input_range R1, input_range R2>
+        requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>>
+    constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
+        swap_ranges(R1&& r1, R2&& r2);
+}
+
+template <class ForwardIterator1, class ForwardIterator2>
+    constexpr void                // constexpr in C++20
+    iter_swap(ForwardIterator1 a, ForwardIterator2 b);
+
+template <class InputIterator, class OutputIterator, class UnaryOperation>
+    constexpr OutputIterator      // constexpr in C++20
+    transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op);
+
+template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation>
+    constexpr OutputIterator      // constexpr in C++20
+    transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
+              OutputIterator result, BinaryOperation binary_op);
+
+template <class ForwardIterator, class T>
+    constexpr void      // constexpr in C++20
+    replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
+
+template <class ForwardIterator, class Predicate, class T>
+    constexpr void      // constexpr in C++20
+    replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
+
+template <class InputIterator, class OutputIterator, class T>
+    constexpr OutputIterator      // constexpr in C++20
+    replace_copy(InputIterator first, InputIterator last, OutputIterator result,
+                 const T& old_value, const T& new_value);
+
+template <class InputIterator, class OutputIterator, class Predicate, class T>
+    constexpr OutputIterator      // constexpr in C++20
+    replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value);
+
+template <class ForwardIterator, class T>
+    constexpr void      // constexpr in C++20
+    fill(ForwardIterator first, ForwardIterator last, const T& value);
+
+template <class OutputIterator, class Size, class T>
+    constexpr OutputIterator      // constexpr in C++20
+    fill_n(OutputIterator first, Size n, const T& value);
+
+template <class ForwardIterator, class Generator>
+    constexpr void      // constexpr in C++20
+    generate(ForwardIterator first, ForwardIterator last, Generator gen);
+
+template <class OutputIterator, class Size, class Generator>
+    constexpr OutputIterator      // constexpr in C++20
+    generate_n(OutputIterator first, Size n, Generator gen);
+
+template <class ForwardIterator, class T>
+    constexpr ForwardIterator     // constexpr in C++20
+    remove(ForwardIterator first, ForwardIterator last, const T& value);
+
+template <class ForwardIterator, class Predicate>
+    constexpr ForwardIterator     // constexpr in C++20
+    remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
+
+template <class InputIterator, class OutputIterator, class T>
+    constexpr OutputIterator     // constexpr in C++20
+    remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
+
+template <class InputIterator, class OutputIterator, class Predicate>
+    constexpr OutputIterator     // constexpr in C++20
+    remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
+
+template <class ForwardIterator>
+    constexpr ForwardIterator    // constexpr in C++20
+    unique(ForwardIterator first, ForwardIterator last);
+
+template <class ForwardIterator, class BinaryPredicate>
+    constexpr ForwardIterator    // constexpr in C++20
+    unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
+
+template <class InputIterator, class OutputIterator>
+    constexpr OutputIterator     // constexpr in C++20
+    unique_copy(InputIterator first, InputIterator last, OutputIterator result);
+
+template <class InputIterator, class OutputIterator, class BinaryPredicate>
+    constexpr OutputIterator     // constexpr in C++20
+    unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
+
+template <class BidirectionalIterator>
+    constexpr void               // constexpr in C++20
+    reverse(BidirectionalIterator first, BidirectionalIterator last);
+
+template <class BidirectionalIterator, class OutputIterator>
+    constexpr OutputIterator       // constexpr in C++20
+    reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
+
+template <class ForwardIterator>
+    constexpr ForwardIterator      // constexpr in C++20
+    rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
+
+template <class ForwardIterator, class OutputIterator>
+    constexpr OutputIterator       // constexpr in C++20
+    rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result);
+
+template <class RandomAccessIterator>
+    void
+    random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17
+
+template <class RandomAccessIterator, class RandomNumberGenerator>
+    void
+    random_shuffle(RandomAccessIterator first, RandomAccessIterator last,
+                   RandomNumberGenerator& rand);  // deprecated in C++14, removed in C++17
+
+template<class PopulationIterator, class SampleIterator,
+         class Distance, class UniformRandomBitGenerator>
+    SampleIterator sample(PopulationIterator first, PopulationIterator last,
+                          SampleIterator out, Distance n,
+                          UniformRandomBitGenerator&& g); // C++17
+
+template<class RandomAccessIterator, class UniformRandomNumberGenerator>
+    void shuffle(RandomAccessIterator first, RandomAccessIterator last,
+                 UniformRandomNumberGenerator&& g);
+
+template<class ForwardIterator>
+  constexpr ForwardIterator
+    shift_left(ForwardIterator first, ForwardIterator last,
+               typename iterator_traits<ForwardIterator>::difference_type n); // C++20
+
+template<class ForwardIterator>
+  constexpr ForwardIterator
+    shift_right(ForwardIterator first, ForwardIterator last,
+                typename iterator_traits<ForwardIterator>::difference_type n); // C++20
+
+template <class InputIterator, class Predicate>
+    constexpr bool  // constexpr in C++20
+    is_partitioned(InputIterator first, InputIterator last, Predicate pred);
+
+template <class ForwardIterator, class Predicate>
+    constexpr ForwardIterator  // constexpr in C++20
+    partition(ForwardIterator first, ForwardIterator last, Predicate pred);
+
+template <class InputIterator, class OutputIterator1,
+          class OutputIterator2, class Predicate>
+    constexpr pair<OutputIterator1, OutputIterator2>   // constexpr in C++20
+    partition_copy(InputIterator first, InputIterator last,
+                   OutputIterator1 out_true, OutputIterator2 out_false,
+                   Predicate pred);
+
+template <class ForwardIterator, class Predicate>
+    ForwardIterator
+    stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
+
+template<class ForwardIterator, class Predicate>
+    constexpr ForwardIterator  // constexpr in C++20
+    partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
+
+template <class ForwardIterator>
+    constexpr bool  // constexpr in C++20
+    is_sorted(ForwardIterator first, ForwardIterator last);
+
+template <class ForwardIterator, class Compare>
+    constexpr bool  // constexpr in C++20
+    is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
+
+template<class ForwardIterator>
+    constexpr ForwardIterator    // constexpr in C++20
+    is_sorted_until(ForwardIterator first, ForwardIterator last);
+
+template <class ForwardIterator, class Compare>
+    constexpr ForwardIterator    // constexpr in C++20
+    is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
+
+template <class RandomAccessIterator>
+    constexpr void               // constexpr in C++20
+    sort(RandomAccessIterator first, RandomAccessIterator last);
+
+template <class RandomAccessIterator, class Compare>
+    constexpr void               // constexpr in C++20
+    sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
+
+template <class RandomAccessIterator>
+    void
+    stable_sort(RandomAccessIterator first, RandomAccessIterator last);
+
+template <class RandomAccessIterator, class Compare>
+    void
+    stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
+
+template <class RandomAccessIterator>
+    constexpr void                    // constexpr in C++20
+    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
+
+template <class RandomAccessIterator, class Compare>
+    constexpr void                    // constexpr in C++20
+    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
+
+template <class InputIterator, class RandomAccessIterator>
+    constexpr RandomAccessIterator    // constexpr in C++20
+    partial_sort_copy(InputIterator first, InputIterator last,
+                      RandomAccessIterator result_first, RandomAccessIterator result_last);
+
+template <class InputIterator, class RandomAccessIterator, class Compare>
+    constexpr RandomAccessIterator    // constexpr in C++20
+    partial_sort_copy(InputIterator first, InputIterator last,
+                      RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
+
+template <class RandomAccessIterator>
+    constexpr void                    // constexpr in C++20
+    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
+
+template <class RandomAccessIterator, class Compare>
+    constexpr void                    // constexpr in C++20
+    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
+
+template <class ForwardIterator, class T>
+    constexpr ForwardIterator                         // constexpr in C++20
+    lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
+
+template <class ForwardIterator, class T, class Compare>
+    constexpr ForwardIterator                         // constexpr in C++20
+    lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
+
+template <class ForwardIterator, class T>
+    constexpr ForwardIterator                         // constexpr in C++20
+    upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
+
+template <class ForwardIterator, class T, class Compare>
+    constexpr ForwardIterator                         // constexpr in C++20
+    upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
+
+template <class ForwardIterator, class T>
+    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
+    equal_range(ForwardIterator first, ForwardIterator last, const T& value);
+
+template <class ForwardIterator, class T, class Compare>
+    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
+    equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
+
+template <class ForwardIterator, class T>
+    constexpr bool                                    // constexpr in C++20
+    binary_search(ForwardIterator first, ForwardIterator last, const T& value);
+
+template <class ForwardIterator, class T, class Compare>
+    constexpr bool                                    // constexpr in C++20
+    binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
+
+template <class InputIterator1, class InputIterator2, class OutputIterator>
+    constexpr OutputIterator                          // constexpr in C++20
+    merge(InputIterator1 first1, InputIterator1 last1,
+          InputIterator2 first2, InputIterator2 last2, OutputIterator result);
+
+template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
+    constexpr OutputIterator                          // constexpr in C++20
+    merge(InputIterator1 first1, InputIterator1 last1,
+          InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
+
+template <class BidirectionalIterator>
+    void
+    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last);
+
+template <class BidirectionalIterator, class Compare>
+    void
+    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
+
+template <class InputIterator1, class InputIterator2>
+    constexpr bool                                    // constexpr in C++20
+    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
+
+template <class InputIterator1, class InputIterator2, class Compare>
+    constexpr bool                                    // constexpr in C++20
+    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
+
+template <class InputIterator1, class InputIterator2, class OutputIterator>
+    constexpr OutputIterator                          // constexpr in C++20
+    set_union(InputIterator1 first1, InputIterator1 last1,
+              InputIterator2 first2, InputIterator2 last2, OutputIterator result);
+
+template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
+    constexpr OutputIterator                          // constexpr in C++20
+    set_union(InputIterator1 first1, InputIterator1 last1,
+              InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
+
+template <class InputIterator1, class InputIterator2, class OutputIterator>
+    constexpr OutputIterator                         // constexpr in C++20
+    set_intersection(InputIterator1 first1, InputIterator1 last1,
+                     InputIterator2 first2, InputIterator2 last2, OutputIterator result);
+
+template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
+    constexpr OutputIterator                         // constexpr in C++20
+    set_intersection(InputIterator1 first1, InputIterator1 last1,
+                     InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
+
+template <class InputIterator1, class InputIterator2, class OutputIterator>
+    constexpr OutputIterator                         // constexpr in C++20
+    set_difference(InputIterator1 first1, InputIterator1 last1,
+                   InputIterator2 first2, InputIterator2 last2, OutputIterator result);
+
+template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
+    constexpr OutputIterator                         // constexpr in C++20
+    set_difference(InputIterator1 first1, InputIterator1 last1,
+                   InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
+
+template <class InputIterator1, class InputIterator2, class OutputIterator>
+    constexpr OutputIterator                         // constexpr in C++20
+    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
+                             InputIterator2 first2, InputIterator2 last2, OutputIterator result);
+
+template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
+    constexpr OutputIterator                         // constexpr in C++20
+    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
+                             InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
+
+template <class RandomAccessIterator>
+    constexpr void                                   // constexpr in C++20
+    push_heap(RandomAccessIterator first, RandomAccessIterator last);
+
+template <class RandomAccessIterator, class Compare>
+    constexpr void                                   // constexpr in C++20
+    push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
+
+template <class RandomAccessIterator>
+    constexpr void                                   // constexpr in C++20
+    pop_heap(RandomAccessIterator first, RandomAccessIterator last);
+
+template <class RandomAccessIterator, class Compare>
+    constexpr void                                   // constexpr in C++20
+    pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
+
+template <class RandomAccessIterator>
+    constexpr void                                   // constexpr in C++20
+    make_heap(RandomAccessIterator first, RandomAccessIterator last);
+
+template <class RandomAccessIterator, class Compare>
+    constexpr void                                   // constexpr in C++20
+    make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
+
+template <class RandomAccessIterator>
+    constexpr void                                   // constexpr in C++20
+    sort_heap(RandomAccessIterator first, RandomAccessIterator last);
+
+template <class RandomAccessIterator, class Compare>
+    constexpr void                                   // constexpr in C++20
+    sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
+
+template <class RandomAccessIterator>
+    constexpr bool   // constexpr in C++20
+    is_heap(RandomAccessIterator first, RandomAccessiterator last);
+
+template <class RandomAccessIterator, class Compare>
+    constexpr bool   // constexpr in C++20
+    is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
+
+template <class RandomAccessIterator>
+    constexpr RandomAccessIterator   // constexpr in C++20
+    is_heap_until(RandomAccessIterator first, RandomAccessiterator last);
+
+template <class RandomAccessIterator, class Compare>
+    constexpr RandomAccessIterator   // constexpr in C++20
+    is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
+
+template <class ForwardIterator>
+    constexpr ForwardIterator        // constexpr in C++14
+    min_element(ForwardIterator first, ForwardIterator last);
+
+template <class ForwardIterator, class Compare>
+    constexpr ForwardIterator        // constexpr in C++14
+    min_element(ForwardIterator first, ForwardIterator last, Compare comp);
+
+template <class T>
+    constexpr const T&               // constexpr in C++14
+    min(const T& a, const T& b);
+
+template <class T, class Compare>
+    constexpr const T&               // constexpr in C++14
+    min(const T& a, const T& b, Compare comp);
+
+template<class T>
+    constexpr T                      // constexpr in C++14
+    min(initializer_list<T> t);
+
+template<class T, class Compare>
+    constexpr T                      // constexpr in C++14
+    min(initializer_list<T> t, Compare comp);
+
+template<class T>
+    constexpr const T& clamp(const T& v, const T& lo, const T& hi);               // C++17
+
+template<class T, class Compare>
+    constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
+
+template <class ForwardIterator>
+    constexpr ForwardIterator        // constexpr in C++14
+    max_element(ForwardIterator first, ForwardIterator last);
+
+template <class ForwardIterator, class Compare>
+    constexpr ForwardIterator        // constexpr in C++14
+    max_element(ForwardIterator first, ForwardIterator last, Compare comp);
+
+template <class T>
+    constexpr const T&               // constexpr in C++14
+    max(const T& a, const T& b);
+
+template <class T, class Compare>
+    constexpr const T&               // constexpr in C++14
+    max(const T& a, const T& b, Compare comp);
+
+template<class T>
+    constexpr T                      // constexpr in C++14
+    max(initializer_list<T> t);
+
+template<class T, class Compare>
+    constexpr T                      // constexpr in C++14
+    max(initializer_list<T> t, Compare comp);
+
+template<class ForwardIterator>
+    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
+    minmax_element(ForwardIterator first, ForwardIterator last);
+
+template<class ForwardIterator, class Compare>
+    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
+    minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
+
+template<class T>
+    constexpr pair<const T&, const T&>  // constexpr in C++14
+    minmax(const T& a, const T& b);
+
+template<class T, class Compare>
+    constexpr pair<const T&, const T&>  // constexpr in C++14
+    minmax(const T& a, const T& b, Compare comp);
+
+template<class T>
+    constexpr pair<T, T>                // constexpr in C++14
+    minmax(initializer_list<T> t);
+
+template<class T, class Compare>
+    constexpr pair<T, T>                // constexpr in C++14
+    minmax(initializer_list<T> t, Compare comp);
+
+template <class InputIterator1, class InputIterator2>
+    constexpr bool     // constexpr in C++20
+    lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
+
+template <class InputIterator1, class InputIterator2, class Compare>
+    constexpr bool     // constexpr in C++20
+    lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
+                            InputIterator2 first2, InputIterator2 last2, Compare comp);
+
+template <class BidirectionalIterator>
+    constexpr bool     // constexpr in C++20
+    next_permutation(BidirectionalIterator first, BidirectionalIterator last);
+
+template <class BidirectionalIterator, class Compare>
+    constexpr bool     // constexpr in C++20
+    next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
+
+template <class BidirectionalIterator>
+    constexpr bool     // constexpr in C++20
+    prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
+
+template <class BidirectionalIterator, class Compare>
+    constexpr bool     // constexpr in C++20
+    prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__debug>
+#include <cstddef>
+#include <type_traits>
+#include <version>
+
+#include <__algorithm/adjacent_find.h>
+#include <__algorithm/all_of.h>
+#include <__algorithm/any_of.h>
+#include <__algorithm/binary_search.h>
+#include <__algorithm/clamp.h>
+#include <__algorithm/comp.h>
+#include <__algorithm/comp_ref_type.h>
+#include <__algorithm/copy.h>
+#include <__algorithm/copy_backward.h>
+#include <__algorithm/copy_if.h>
+#include <__algorithm/copy_n.h>
+#include <__algorithm/count.h>
+#include <__algorithm/count_if.h>
+#include <__algorithm/equal.h>
+#include <__algorithm/equal_range.h>
+#include <__algorithm/fill.h>
+#include <__algorithm/fill_n.h>
+#include <__algorithm/find.h>
+#include <__algorithm/find_end.h>
+#include <__algorithm/find_first_of.h>
+#include <__algorithm/find_if.h>
+#include <__algorithm/find_if_not.h>
+#include <__algorithm/for_each.h>
+#include <__algorithm/for_each_n.h>
+#include <__algorithm/generate.h>
+#include <__algorithm/generate_n.h>
+#include <__algorithm/half_positive.h>
+#include <__algorithm/in_found_result.h>
+#include <__algorithm/in_fun_result.h>
+#include <__algorithm/in_in_out_result.h>
+#include <__algorithm/in_in_result.h>
+#include <__algorithm/in_out_out_result.h>
+#include <__algorithm/in_out_result.h>
+#include <__algorithm/includes.h>
+#include <__algorithm/inplace_merge.h>
+#include <__algorithm/is_heap.h>
+#include <__algorithm/is_heap_until.h>
+#include <__algorithm/is_partitioned.h>
+#include <__algorithm/is_permutation.h>
+#include <__algorithm/is_sorted.h>
+#include <__algorithm/is_sorted_until.h>
+#include <__algorithm/iter_swap.h>
+#include <__algorithm/lexicographical_compare.h>
+#include <__algorithm/lower_bound.h>
+#include <__algorithm/make_heap.h>
+#include <__algorithm/max.h>
+#include <__algorithm/max_element.h>
+#include <__algorithm/merge.h>
+#include <__algorithm/min.h>
+#include <__algorithm/min_element.h>
+#include <__algorithm/min_max_result.h>
+#include <__algorithm/minmax.h>
+#include <__algorithm/minmax_element.h>
+#include <__algorithm/mismatch.h>
+#include <__algorithm/move.h>
+#include <__algorithm/move_backward.h>
+#include <__algorithm/next_permutation.h>
+#include <__algorithm/none_of.h>
+#include <__algorithm/nth_element.h>
+#include <__algorithm/partial_sort.h>
+#include <__algorithm/partial_sort_copy.h>
+#include <__algorithm/partition.h>
+#include <__algorithm/partition_copy.h>
+#include <__algorithm/partition_point.h>
+#include <__algorithm/pop_heap.h>
+#include <__algorithm/prev_permutation.h>
+#include <__algorithm/push_heap.h>
+#include <__algorithm/ranges_adjacent_find.h>
+#include <__algorithm/ranges_all_of.h>
+#include <__algorithm/ranges_any_of.h>
+#include <__algorithm/ranges_binary_search.h>
+#include <__algorithm/ranges_clamp.h>
+#include <__algorithm/ranges_copy.h>
+#include <__algorithm/ranges_copy_backward.h>
+#include <__algorithm/ranges_copy_if.h>
+#include <__algorithm/ranges_copy_n.h>
+#include <__algorithm/ranges_count.h>
+#include <__algorithm/ranges_count_if.h>
+#include <__algorithm/ranges_equal.h>
+#include <__algorithm/ranges_equal_range.h>
+#include <__algorithm/ranges_fill.h>
+#include <__algorithm/ranges_fill_n.h>
+#include <__algorithm/ranges_find.h>
+#include <__algorithm/ranges_find_end.h>
+#include <__algorithm/ranges_find_first_of.h>
+#include <__algorithm/ranges_find_if.h>
+#include <__algorithm/ranges_find_if_not.h>
+#include <__algorithm/ranges_for_each.h>
+#include <__algorithm/ranges_for_each_n.h>
+#include <__algorithm/ranges_generate.h>
+#include <__algorithm/ranges_generate_n.h>
+#include <__algorithm/ranges_includes.h>
+#include <__algorithm/ranges_inplace_merge.h>
+#include <__algorithm/ranges_is_heap.h>
+#include <__algorithm/ranges_is_heap_until.h>
+#include <__algorithm/ranges_is_partitioned.h>
+#include <__algorithm/ranges_is_permutation.h>
+#include <__algorithm/ranges_is_sorted.h>
+#include <__algorithm/ranges_is_sorted_until.h>
+#include <__algorithm/ranges_lexicographical_compare.h>
+#include <__algorithm/ranges_lower_bound.h>
+#include <__algorithm/ranges_make_heap.h>
+#include <__algorithm/ranges_max.h>
+#include <__algorithm/ranges_max_element.h>
+#include <__algorithm/ranges_merge.h>
+#include <__algorithm/ranges_min.h>
+#include <__algorithm/ranges_min_element.h>
+#include <__algorithm/ranges_minmax.h>
+#include <__algorithm/ranges_minmax_element.h>
+#include <__algorithm/ranges_mismatch.h>
+#include <__algorithm/ranges_move.h>
+#include <__algorithm/ranges_move_backward.h>
+#include <__algorithm/ranges_next_permutation.h>
+#include <__algorithm/ranges_none_of.h>
+#include <__algorithm/ranges_nth_element.h>
+#include <__algorithm/ranges_partial_sort.h>
+#include <__algorithm/ranges_partial_sort_copy.h>
+#include <__algorithm/ranges_partition.h>
+#include <__algorithm/ranges_partition_copy.h>
+#include <__algorithm/ranges_partition_point.h>
+#include <__algorithm/ranges_pop_heap.h>
+#include <__algorithm/ranges_prev_permutation.h>
+#include <__algorithm/ranges_push_heap.h>
+#include <__algorithm/ranges_remove.h>
+#include <__algorithm/ranges_remove_copy.h>
+#include <__algorithm/ranges_remove_copy_if.h>
+#include <__algorithm/ranges_remove_if.h>
+#include <__algorithm/ranges_replace.h>
+#include <__algorithm/ranges_replace_copy.h>
+#include <__algorithm/ranges_replace_copy_if.h>
+#include <__algorithm/ranges_replace_if.h>
+#include <__algorithm/ranges_reverse.h>
+#include <__algorithm/ranges_reverse_copy.h>
+#include <__algorithm/ranges_rotate.h>
+#include <__algorithm/ranges_rotate_copy.h>
+#include <__algorithm/ranges_sample.h>
+#include <__algorithm/ranges_search.h>
+#include <__algorithm/ranges_search_n.h>
+#include <__algorithm/ranges_set_difference.h>
+#include <__algorithm/ranges_set_intersection.h>
+#include <__algorithm/ranges_set_symmetric_difference.h>
+#include <__algorithm/ranges_set_union.h>
+#include <__algorithm/ranges_shuffle.h>
+#include <__algorithm/ranges_sort.h>
+#include <__algorithm/ranges_sort_heap.h>
+#include <__algorithm/ranges_stable_partition.h>
+#include <__algorithm/ranges_stable_sort.h>
+#include <__algorithm/ranges_swap_ranges.h>
+#include <__algorithm/ranges_transform.h>
+#include <__algorithm/ranges_unique.h>
+#include <__algorithm/ranges_unique_copy.h>
+#include <__algorithm/ranges_upper_bound.h>
+#include <__algorithm/remove.h>
+#include <__algorithm/remove_copy.h>
+#include <__algorithm/remove_copy_if.h>
+#include <__algorithm/remove_if.h>
+#include <__algorithm/replace.h>
+#include <__algorithm/replace_copy.h>
+#include <__algorithm/replace_copy_if.h>
+#include <__algorithm/replace_if.h>
+#include <__algorithm/reverse.h>
+#include <__algorithm/reverse_copy.h>
+#include <__algorithm/rotate.h>
+#include <__algorithm/rotate_copy.h>
+#include <__algorithm/sample.h>
+#include <__algorithm/search.h>
+#include <__algorithm/search_n.h>
+#include <__algorithm/set_difference.h>
+#include <__algorithm/set_intersection.h>
+#include <__algorithm/set_symmetric_difference.h>
+#include <__algorithm/set_union.h>
+#include <__algorithm/shift_left.h>
+#include <__algorithm/shift_right.h>
+#include <__algorithm/shuffle.h>
+#include <__algorithm/sift_down.h>
+#include <__algorithm/sort.h>
+#include <__algorithm/sort_heap.h>
+#include <__algorithm/stable_partition.h>
+#include <__algorithm/stable_sort.h>
+#include <__algorithm/swap_ranges.h>
+#include <__algorithm/transform.h>
+#include <__algorithm/unique.h>
+#include <__algorithm/unique_copy.h>
+#include <__algorithm/unwrap_iter.h>
+#include <__algorithm/upper_bound.h>
+
+// standard-mandated includes
+
+// [algorithm.syn]
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17
+#  include <__pstl_algorithm>
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 17
+#  include <chrono>
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <atomic>
+#  include <concepts>
+#  include <cstring>
+#  include <iterator>
+#  include <memory>
+#  include <stdexcept>
+#  include <utility>
+#endif
+
+#endif // _LIBCPP_ALGORITHM
diff --git a/app/src/main/cpp/libcxx/include/any b/app/src/main/cpp/libcxx/include/any
new file mode 100644
index 0000000..92cbc9a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/any
@@ -0,0 +1,712 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_ANY
+#define _LIBCPP_ANY
+
+/*
+   any synopsis
+
+namespace std {
+
+  class bad_any_cast : public bad_cast
+  {
+  public:
+    virtual const char* what() const noexcept;
+  };
+
+  class any
+  {
+  public:
+
+    // 6.3.1 any construct/destruct
+    any() noexcept;
+
+    any(const any& other);
+    any(any&& other) noexcept;
+
+    template <class ValueType>
+      any(ValueType&& value);
+
+    ~any();
+
+    // 6.3.2 any assignments
+    any& operator=(const any& rhs);
+    any& operator=(any&& rhs) noexcept;
+
+    template <class ValueType>
+      any& operator=(ValueType&& rhs);
+
+    // 6.3.3 any modifiers
+    template <class ValueType, class... Args>
+      decay_t<ValueType>& emplace(Args&&... args);
+    template <class ValueType, class U, class... Args>
+      decay_t<ValueType>& emplace(initializer_list<U>, Args&&...);
+    void reset() noexcept;
+    void swap(any& rhs) noexcept;
+
+    // 6.3.4 any observers
+    bool has_value() const noexcept;
+    const type_info& type() const noexcept;
+  };
+
+   // 6.4 Non-member functions
+  void swap(any& x, any& y) noexcept;
+
+  template <class T, class ...Args>
+    any make_any(Args&& ...args);
+  template <class T, class U, class ...Args>
+    any make_any(initializer_list<U>, Args&& ...args);
+
+  template<class ValueType>
+    ValueType any_cast(const any& operand);
+  template<class ValueType>
+    ValueType any_cast(any& operand);
+  template<class ValueType>
+    ValueType any_cast(any&& operand);
+
+  template<class ValueType>
+    const ValueType* any_cast(const any* operand) noexcept;
+  template<class ValueType>
+    ValueType* any_cast(any* operand) noexcept;
+
+} // namespace std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__config>
+#include <__memory/allocator.h>
+#include <__memory/allocator_destructor.h>
+#include <__memory/allocator_traits.h>
+#include <__memory/unique_ptr.h>
+#include <__utility/forward.h>
+#include <__utility/in_place.h>
+#include <__utility/move.h>
+#include <__utility/unreachable.h>
+#include <cstdlib>
+#include <initializer_list>
+#include <type_traits>
+#include <typeinfo>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+namespace std {
+class _LIBCPP_EXCEPTION_ABI _LIBCPP_AVAILABILITY_BAD_ANY_CAST bad_any_cast : public bad_cast
+{
+public:
+    const char* what() const _NOEXCEPT override;
+};
+} // namespace std
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_AVAILABILITY_THROW_BAD_ANY_CAST
+void __throw_bad_any_cast()
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw bad_any_cast();
+#else
+    _VSTD::abort();
+#endif
+}
+
+// Forward declarations
+class _LIBCPP_TEMPLATE_VIS any;
+
+template <class _ValueType>
+_LIBCPP_INLINE_VISIBILITY
+add_pointer_t<add_const_t<_ValueType>>
+any_cast(any const *) _NOEXCEPT;
+
+template <class _ValueType>
+_LIBCPP_INLINE_VISIBILITY
+add_pointer_t<_ValueType> any_cast(any *) _NOEXCEPT;
+
+namespace __any_imp
+{
+  _LIBCPP_SUPPRESS_DEPRECATED_PUSH
+  using _Buffer = aligned_storage_t<3*sizeof(void*), alignment_of<void*>::value>;
+  _LIBCPP_SUPPRESS_DEPRECATED_POP
+
+  template <class _Tp>
+  using _IsSmallObject = integral_constant<bool
+        , sizeof(_Tp) <= sizeof(_Buffer)
+          && alignment_of<_Buffer>::value
+             % alignment_of<_Tp>::value == 0
+          && is_nothrow_move_constructible<_Tp>::value
+        >;
+
+  enum class _Action {
+    _Destroy,
+    _Copy,
+    _Move,
+    _Get,
+    _TypeInfo
+  };
+
+  template <class _Tp> struct _SmallHandler;
+  template <class _Tp> struct _LargeHandler;
+
+  template <class _Tp>
+  struct  _LIBCPP_TEMPLATE_VIS __unique_typeinfo { static constexpr int __id = 0; };
+  template <class _Tp> constexpr int __unique_typeinfo<_Tp>::__id;
+
+  template <class _Tp>
+  inline _LIBCPP_INLINE_VISIBILITY
+  constexpr const void* __get_fallback_typeid() {
+      return &__unique_typeinfo<remove_cv_t<remove_reference_t<_Tp>>>::__id;
+  }
+
+  template <class _Tp>
+  inline _LIBCPP_INLINE_VISIBILITY
+  bool __compare_typeid(type_info const* __id, const void* __fallback_id)
+  {
+#if !defined(_LIBCPP_NO_RTTI)
+      if (__id && *__id == typeid(_Tp))
+          return true;
+#endif
+      if (!__id && __fallback_id == __any_imp::__get_fallback_typeid<_Tp>())
+          return true;
+      return false;
+  }
+
+  template <class _Tp>
+  using _Handler = conditional_t<
+    _IsSmallObject<_Tp>::value, _SmallHandler<_Tp>, _LargeHandler<_Tp>>;
+
+} // namespace __any_imp
+
+class _LIBCPP_TEMPLATE_VIS any
+{
+public:
+  // construct/destruct
+  _LIBCPP_INLINE_VISIBILITY
+  constexpr any() _NOEXCEPT : __h_(nullptr) {}
+
+  _LIBCPP_INLINE_VISIBILITY
+  any(any const & __other) : __h_(nullptr)
+  {
+    if (__other.__h_) __other.__call(_Action::_Copy, this);
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  any(any && __other) _NOEXCEPT : __h_(nullptr)
+  {
+    if (__other.__h_) __other.__call(_Action::_Move, this);
+  }
+
+  template <
+      class _ValueType
+    , class _Tp = decay_t<_ValueType>
+    , class = enable_if_t<
+        !is_same<_Tp, any>::value &&
+        !__is_inplace_type<_ValueType>::value &&
+        is_copy_constructible<_Tp>::value>
+    >
+  _LIBCPP_INLINE_VISIBILITY
+  any(_ValueType && __value);
+
+  template <class _ValueType, class ..._Args,
+    class _Tp = decay_t<_ValueType>,
+    class = enable_if_t<
+        is_constructible<_Tp, _Args...>::value &&
+        is_copy_constructible<_Tp>::value
+    >
+  >
+  _LIBCPP_INLINE_VISIBILITY
+  explicit any(in_place_type_t<_ValueType>, _Args&&... __args);
+
+  template <class _ValueType, class _Up, class ..._Args,
+    class _Tp = decay_t<_ValueType>,
+    class = enable_if_t<
+        is_constructible<_Tp, initializer_list<_Up>&, _Args...>::value &&
+        is_copy_constructible<_Tp>::value>
+  >
+  _LIBCPP_INLINE_VISIBILITY
+  explicit any(in_place_type_t<_ValueType>, initializer_list<_Up>, _Args&&... __args);
+
+  _LIBCPP_INLINE_VISIBILITY
+  ~any() { this->reset(); }
+
+  // assignments
+  _LIBCPP_INLINE_VISIBILITY
+  any & operator=(any const & __rhs) {
+    any(__rhs).swap(*this);
+    return *this;
+  }
+
+  _LIBCPP_INLINE_VISIBILITY
+  any & operator=(any && __rhs) _NOEXCEPT {
+    any(_VSTD::move(__rhs)).swap(*this);
+    return *this;
+  }
+
+  template <
+      class _ValueType
+    , class _Tp = decay_t<_ValueType>
+    , class = enable_if_t<
+          !is_same<_Tp, any>::value
+          && is_copy_constructible<_Tp>::value>
+    >
+  _LIBCPP_INLINE_VISIBILITY
+  any & operator=(_ValueType && __rhs);
+
+  template <class _ValueType, class ..._Args,
+    class _Tp = decay_t<_ValueType>,
+    class = enable_if_t<
+        is_constructible<_Tp, _Args...>::value &&
+        is_copy_constructible<_Tp>::value>
+    >
+  _LIBCPP_INLINE_VISIBILITY
+  _Tp& emplace(_Args&&...);
+
+  template <class _ValueType, class _Up, class ..._Args,
+    class _Tp = decay_t<_ValueType>,
+    class = enable_if_t<
+        is_constructible<_Tp, initializer_list<_Up>&, _Args...>::value &&
+        is_copy_constructible<_Tp>::value>
+  >
+  _LIBCPP_INLINE_VISIBILITY
+  _Tp& emplace(initializer_list<_Up>, _Args&&...);
+
+  // 6.3.3 any modifiers
+  _LIBCPP_INLINE_VISIBILITY
+  void reset() _NOEXCEPT { if (__h_) this->__call(_Action::_Destroy); }
+
+  _LIBCPP_INLINE_VISIBILITY
+  void swap(any & __rhs) _NOEXCEPT;
+
+  // 6.3.4 any observers
+  _LIBCPP_INLINE_VISIBILITY
+  bool has_value() const _NOEXCEPT { return __h_ != nullptr; }
+
+#if !defined(_LIBCPP_NO_RTTI)
+  _LIBCPP_INLINE_VISIBILITY
+  const type_info & type() const _NOEXCEPT {
+    if (__h_) {
+        return *static_cast<type_info const *>(this->__call(_Action::_TypeInfo));
+    } else {
+        return typeid(void);
+    }
+  }
+#endif
+
+private:
+    typedef __any_imp::_Action _Action;
+    using _HandleFuncPtr =  void* (*)(_Action, any const *, any *, const type_info *,
+      const void* __fallback_info);
+
+    union _Storage {
+        constexpr _Storage() : __ptr(nullptr) {}
+        void *  __ptr;
+        __any_imp::_Buffer __buf;
+    };
+
+    _LIBCPP_INLINE_VISIBILITY
+    void * __call(_Action __a, any * __other = nullptr,
+                  type_info const * __info = nullptr,
+                   const void* __fallback_info = nullptr) const
+    {
+        return __h_(__a, this, __other, __info, __fallback_info);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void * __call(_Action __a, any * __other = nullptr,
+                  type_info const * __info = nullptr,
+                  const void* __fallback_info = nullptr)
+    {
+        return __h_(__a, this, __other, __info, __fallback_info);
+    }
+
+    template <class>
+    friend struct __any_imp::_SmallHandler;
+    template <class>
+    friend struct __any_imp::_LargeHandler;
+
+    template <class _ValueType>
+    friend add_pointer_t<add_const_t<_ValueType>>
+    any_cast(any const *) _NOEXCEPT;
+
+    template <class _ValueType>
+    friend add_pointer_t<_ValueType>
+    any_cast(any *) _NOEXCEPT;
+
+    _HandleFuncPtr __h_ = nullptr;
+    _Storage __s_;
+};
+
+namespace __any_imp
+{
+  template <class _Tp>
+  struct _LIBCPP_TEMPLATE_VIS _SmallHandler
+  {
+     _LIBCPP_INLINE_VISIBILITY
+     static void* __handle(_Action __act, any const * __this, any * __other,
+                           type_info const * __info, const void* __fallback_info)
+     {
+        switch (__act)
+        {
+        case _Action::_Destroy:
+          __destroy(const_cast<any &>(*__this));
+          return nullptr;
+        case _Action::_Copy:
+            __copy(*__this, *__other);
+            return nullptr;
+        case _Action::_Move:
+          __move(const_cast<any &>(*__this), *__other);
+          return nullptr;
+        case _Action::_Get:
+            return __get(const_cast<any &>(*__this), __info, __fallback_info);
+        case _Action::_TypeInfo:
+          return __type_info();
+        }
+        __libcpp_unreachable();
+    }
+
+    template <class ..._Args>
+    _LIBCPP_INLINE_VISIBILITY
+    static _Tp& __create(any & __dest, _Args&&... __args) {
+        typedef allocator<_Tp> _Alloc;
+        typedef allocator_traits<_Alloc> _ATraits;
+        _Alloc __a;
+        _Tp * __ret = static_cast<_Tp*>(static_cast<void*>(&__dest.__s_.__buf));
+        _ATraits::construct(__a, __ret, _VSTD::forward<_Args>(__args)...);
+        __dest.__h_ = &_SmallHandler::__handle;
+        return *__ret;
+    }
+
+  private:
+    _LIBCPP_INLINE_VISIBILITY
+    static void __destroy(any & __this) {
+        typedef allocator<_Tp> _Alloc;
+        typedef allocator_traits<_Alloc> _ATraits;
+        _Alloc __a;
+        _Tp * __p = static_cast<_Tp *>(static_cast<void*>(&__this.__s_.__buf));
+        _ATraits::destroy(__a, __p);
+        __this.__h_ = nullptr;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    static void __copy(any const & __this, any & __dest) {
+        _SmallHandler::__create(__dest, *static_cast<_Tp const *>(
+            static_cast<void const *>(&__this.__s_.__buf)));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    static void __move(any & __this, any & __dest) {
+        _SmallHandler::__create(__dest, _VSTD::move(
+            *static_cast<_Tp*>(static_cast<void*>(&__this.__s_.__buf))));
+        __destroy(__this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    static void* __get(any & __this,
+                       type_info const * __info,
+                       const void* __fallback_id)
+    {
+        if (__any_imp::__compare_typeid<_Tp>(__info, __fallback_id))
+            return static_cast<void*>(&__this.__s_.__buf);
+        return nullptr;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    static void* __type_info()
+    {
+#if !defined(_LIBCPP_NO_RTTI)
+        return const_cast<void*>(static_cast<void const *>(&typeid(_Tp)));
+#else
+        return nullptr;
+#endif
+    }
+  };
+
+  template <class _Tp>
+  struct _LIBCPP_TEMPLATE_VIS _LargeHandler
+  {
+    _LIBCPP_INLINE_VISIBILITY
+    static void* __handle(_Action __act, any const * __this,
+                          any * __other, type_info const * __info,
+                          void const* __fallback_info)
+    {
+        switch (__act)
+        {
+        case _Action::_Destroy:
+          __destroy(const_cast<any &>(*__this));
+          return nullptr;
+        case _Action::_Copy:
+          __copy(*__this, *__other);
+          return nullptr;
+        case _Action::_Move:
+          __move(const_cast<any &>(*__this), *__other);
+          return nullptr;
+        case _Action::_Get:
+            return __get(const_cast<any &>(*__this), __info, __fallback_info);
+        case _Action::_TypeInfo:
+          return __type_info();
+        }
+        __libcpp_unreachable();
+    }
+
+    template <class ..._Args>
+    _LIBCPP_INLINE_VISIBILITY
+    static _Tp& __create(any & __dest, _Args&&... __args) {
+        typedef allocator<_Tp> _Alloc;
+        typedef allocator_traits<_Alloc> _ATraits;
+        typedef __allocator_destructor<_Alloc> _Dp;
+        _Alloc __a;
+        unique_ptr<_Tp, _Dp> __hold(_ATraits::allocate(__a, 1), _Dp(__a, 1));
+        _Tp * __ret = __hold.get();
+        _ATraits::construct(__a, __ret, _VSTD::forward<_Args>(__args)...);
+        __dest.__s_.__ptr = __hold.release();
+        __dest.__h_ = &_LargeHandler::__handle;
+        return *__ret;
+    }
+
+  private:
+
+    _LIBCPP_INLINE_VISIBILITY
+    static void __destroy(any & __this){
+        typedef allocator<_Tp> _Alloc;
+        typedef allocator_traits<_Alloc> _ATraits;
+        _Alloc __a;
+        _Tp * __p = static_cast<_Tp *>(__this.__s_.__ptr);
+        _ATraits::destroy(__a, __p);
+        _ATraits::deallocate(__a, __p, 1);
+        __this.__h_ = nullptr;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    static void __copy(any const & __this, any & __dest) {
+        _LargeHandler::__create(__dest, *static_cast<_Tp const *>(__this.__s_.__ptr));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    static void __move(any & __this, any & __dest) {
+      __dest.__s_.__ptr = __this.__s_.__ptr;
+      __dest.__h_ = &_LargeHandler::__handle;
+      __this.__h_ = nullptr;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    static void* __get(any & __this, type_info const * __info,
+                       void const* __fallback_info)
+    {
+        if (__any_imp::__compare_typeid<_Tp>(__info, __fallback_info))
+            return static_cast<void*>(__this.__s_.__ptr);
+        return nullptr;
+
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    static void* __type_info()
+    {
+#if !defined(_LIBCPP_NO_RTTI)
+        return const_cast<void*>(static_cast<void const *>(&typeid(_Tp)));
+#else
+        return nullptr;
+#endif
+    }
+  };
+
+} // namespace __any_imp
+
+
+template <class _ValueType, class _Tp, class>
+any::any(_ValueType && __v) : __h_(nullptr)
+{
+  __any_imp::_Handler<_Tp>::__create(*this, _VSTD::forward<_ValueType>(__v));
+}
+
+template <class _ValueType, class ..._Args, class _Tp, class>
+any::any(in_place_type_t<_ValueType>, _Args&&... __args) {
+  __any_imp::_Handler<_Tp>::__create(*this, _VSTD::forward<_Args>(__args)...);
+}
+
+template <class _ValueType, class _Up, class ..._Args, class _Tp, class>
+any::any(in_place_type_t<_ValueType>, initializer_list<_Up> __il, _Args&&... __args) {
+  __any_imp::_Handler<_Tp>::__create(*this, __il, _VSTD::forward<_Args>(__args)...);
+}
+
+template <class _ValueType, class, class>
+inline _LIBCPP_INLINE_VISIBILITY
+any & any::operator=(_ValueType && __v)
+{
+  any(_VSTD::forward<_ValueType>(__v)).swap(*this);
+  return *this;
+}
+
+template <class _ValueType, class ..._Args, class _Tp, class>
+inline _LIBCPP_INLINE_VISIBILITY
+_Tp& any::emplace(_Args&&... __args) {
+  reset();
+  return __any_imp::_Handler<_Tp>::__create(*this, _VSTD::forward<_Args>(__args)...);
+}
+
+template <class _ValueType, class _Up, class ..._Args, class _Tp, class>
+inline _LIBCPP_INLINE_VISIBILITY
+_Tp& any::emplace(initializer_list<_Up> __il, _Args&&... __args) {
+  reset();
+  return __any_imp::_Handler<_Tp>::__create(*this, __il, _VSTD::forward<_Args>(__args)...);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void any::swap(any & __rhs) _NOEXCEPT
+{
+    if (this == &__rhs)
+      return;
+    if (__h_ && __rhs.__h_) {
+        any __tmp;
+        __rhs.__call(_Action::_Move, &__tmp);
+        this->__call(_Action::_Move, &__rhs);
+        __tmp.__call(_Action::_Move, this);
+    }
+    else if (__h_) {
+        this->__call(_Action::_Move, &__rhs);
+    }
+    else if (__rhs.__h_) {
+        __rhs.__call(_Action::_Move, this);
+    }
+}
+
+// 6.4 Non-member functions
+
+inline _LIBCPP_INLINE_VISIBILITY
+void swap(any & __lhs, any & __rhs) _NOEXCEPT
+{
+    __lhs.swap(__rhs);
+}
+
+template <class _Tp, class ..._Args>
+inline _LIBCPP_INLINE_VISIBILITY
+any make_any(_Args&&... __args) {
+    return any(in_place_type<_Tp>, _VSTD::forward<_Args>(__args)...);
+}
+
+template <class _Tp, class _Up, class ..._Args>
+inline _LIBCPP_INLINE_VISIBILITY
+any make_any(initializer_list<_Up> __il, _Args&&... __args) {
+    return any(in_place_type<_Tp>, __il, _VSTD::forward<_Args>(__args)...);
+}
+
+template <class _ValueType>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_AVAILABILITY_THROW_BAD_ANY_CAST
+_ValueType any_cast(any const & __v)
+{
+    using _RawValueType = __remove_cvref_t<_ValueType>;
+    static_assert(is_constructible<_ValueType, _RawValueType const &>::value,
+                  "ValueType is required to be a const lvalue reference "
+                  "or a CopyConstructible type");
+    auto __tmp = _VSTD::any_cast<add_const_t<_RawValueType>>(&__v);
+    if (__tmp == nullptr)
+        __throw_bad_any_cast();
+    return static_cast<_ValueType>(*__tmp);
+}
+
+template <class _ValueType>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_AVAILABILITY_THROW_BAD_ANY_CAST
+_ValueType any_cast(any & __v)
+{
+    using _RawValueType = __remove_cvref_t<_ValueType>;
+    static_assert(is_constructible<_ValueType, _RawValueType &>::value,
+                  "ValueType is required to be an lvalue reference "
+                  "or a CopyConstructible type");
+    auto __tmp = _VSTD::any_cast<_RawValueType>(&__v);
+    if (__tmp == nullptr)
+        __throw_bad_any_cast();
+    return static_cast<_ValueType>(*__tmp);
+}
+
+template <class _ValueType>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_AVAILABILITY_THROW_BAD_ANY_CAST
+_ValueType any_cast(any && __v)
+{
+    using _RawValueType = __remove_cvref_t<_ValueType>;
+    static_assert(is_constructible<_ValueType, _RawValueType>::value,
+                  "ValueType is required to be an rvalue reference "
+                  "or a CopyConstructible type");
+    auto __tmp = _VSTD::any_cast<_RawValueType>(&__v);
+    if (__tmp == nullptr)
+        __throw_bad_any_cast();
+    return static_cast<_ValueType>(_VSTD::move(*__tmp));
+}
+
+template <class _ValueType>
+inline _LIBCPP_INLINE_VISIBILITY
+add_pointer_t<add_const_t<_ValueType>>
+any_cast(any const * __any) _NOEXCEPT
+{
+    static_assert(!is_reference<_ValueType>::value,
+                  "_ValueType may not be a reference.");
+    return _VSTD::any_cast<_ValueType>(const_cast<any *>(__any));
+}
+
+template <class _RetType>
+inline _LIBCPP_INLINE_VISIBILITY
+_RetType __pointer_or_func_cast(void* __p, /*IsFunction*/false_type) noexcept {
+  return static_cast<_RetType>(__p);
+}
+
+template <class _RetType>
+inline _LIBCPP_INLINE_VISIBILITY
+_RetType __pointer_or_func_cast(void*, /*IsFunction*/true_type) noexcept {
+  return nullptr;
+}
+
+template <class _ValueType>
+_LIBCPP_HIDE_FROM_ABI
+add_pointer_t<_ValueType>
+any_cast(any * __any) _NOEXCEPT
+{
+    using __any_imp::_Action;
+    static_assert(!is_reference<_ValueType>::value,
+                  "_ValueType may not be a reference.");
+    typedef add_pointer_t<_ValueType> _ReturnType;
+    if (__any && __any->__h_) {
+      void *__p = __any->__call(_Action::_Get, nullptr,
+#if !defined(_LIBCPP_NO_RTTI)
+                          &typeid(_ValueType),
+#else
+                          nullptr,
+#endif
+                          __any_imp::__get_fallback_typeid<_ValueType>());
+        return _VSTD::__pointer_or_func_cast<_ReturnType>(
+            __p, is_function<_ValueType>{});
+    }
+    return nullptr;
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 17
+#  include <chrono>
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <atomic>
+#  include <concepts>
+#  include <iosfwd>
+#  include <iterator>
+#  include <memory>
+#  include <variant>
+#endif
+
+#endif // _LIBCPP_ANY
diff --git a/app/src/main/cpp/libcxx/include/array b/app/src/main/cpp/libcxx/include/array
new file mode 100644
index 0000000..068a6bd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/array
@@ -0,0 +1,542 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_ARRAY
+#define _LIBCPP_ARRAY
+
+/*
+    array synopsis
+
+namespace std
+{
+template <class T, size_t N >
+struct array
+{
+    // types:
+    typedef T & reference;
+    typedef const T & const_reference;
+    typedef implementation defined iterator;
+    typedef implementation defined const_iterator;
+    typedef size_t size_type;
+    typedef ptrdiff_t difference_type;
+    typedef T value_type;
+    typedef T* pointer;
+    typedef const T* const_pointer;
+    typedef std::reverse_iterator<iterator> reverse_iterator;
+    typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+
+    // No explicit construct/copy/destroy for aggregate type
+    void fill(const T& u);                                      // constexpr in C++20
+    void swap(array& a) noexcept(is_nothrow_swappable_v<T>);    // constexpr in C++20
+
+    // iterators:
+    iterator begin() noexcept;                                  // constexpr in C++17
+    const_iterator begin() const noexcept;                      // constexpr in C++17
+    iterator end() noexcept;                                    // constexpr in C++17
+    const_iterator end() const noexcept;                        // constexpr in C++17
+
+    reverse_iterator rbegin() noexcept;                         // constexpr in C++17
+    const_reverse_iterator rbegin() const noexcept;             // constexpr in C++17
+    reverse_iterator rend() noexcept;                           // constexpr in C++17
+    const_reverse_iterator rend() const noexcept;               // constexpr in C++17
+
+    const_iterator cbegin() const noexcept;                     // constexpr in C++17
+    const_iterator cend() const noexcept;                       // constexpr in C++17
+    const_reverse_iterator crbegin() const noexcept;            // constexpr in C++17
+    const_reverse_iterator crend() const noexcept;              // constexpr in C++17
+
+    // capacity:
+    constexpr size_type size() const noexcept;
+    constexpr size_type max_size() const noexcept;
+    constexpr bool empty() const noexcept;
+
+    // element access:
+    reference operator[](size_type n);                          // constexpr in C++17
+    const_reference operator[](size_type n) const;              // constexpr in C++14
+    reference at(size_type n);                                  // constexpr in C++17
+    const_reference at(size_type n) const;                      // constexpr in C++14
+
+    reference front();                                          // constexpr in C++17
+    const_reference front() const;                              // constexpr in C++14
+    reference back();                                           // constexpr in C++17
+    const_reference back() const;                               // constexpr in C++14
+
+    T* data() noexcept;                                         // constexpr in C++17
+    const T* data() const noexcept;                             // constexpr in C++17
+};
+
+template <class T, class... U>
+  array(T, U...) -> array<T, 1 + sizeof...(U)>;                 // C++17
+
+template <class T, size_t N>
+  bool operator==(const array<T,N>& x, const array<T,N>& y);    // constexpr in C++20
+template <class T, size_t N>
+  bool operator!=(const array<T,N>& x, const array<T,N>& y);    // constexpr in C++20
+template <class T, size_t N>
+  bool operator<(const array<T,N>& x, const array<T,N>& y);     // constexpr in C++20
+template <class T, size_t N>
+  bool operator>(const array<T,N>& x, const array<T,N>& y);     // constexpr in C++20
+template <class T, size_t N>
+  bool operator<=(const array<T,N>& x, const array<T,N>& y);    // constexpr in C++20
+template <class T, size_t N>
+  bool operator>=(const array<T,N>& x, const array<T,N>& y);    // constexpr in C++20
+
+template <class T, size_t N >
+  void swap(array<T,N>& x, array<T,N>& y) noexcept(noexcept(x.swap(y))); // constexpr in C++20
+
+template <class T, size_t N>
+  constexpr array<remove_cv_t<T>, N> to_array(T (&a)[N]);  // C++20
+template <class T, size_t N>
+  constexpr array<remove_cv_t<T>, N> to_array(T (&&a)[N]); // C++20
+
+template <class T> struct tuple_size;
+template <size_t I, class T> struct tuple_element;
+template <class T, size_t N> struct tuple_size<array<T, N>>;
+template <size_t I, class T, size_t N> struct tuple_element<I, array<T, N>>;
+template <size_t I, class T, size_t N> T& get(array<T, N>&) noexcept;               // constexpr in C++14
+template <size_t I, class T, size_t N> const T& get(const array<T, N>&) noexcept;   // constexpr in C++14
+template <size_t I, class T, size_t N> T&& get(array<T, N>&&) noexcept;             // constexpr in C++14
+template <size_t I, class T, size_t N> const T&& get(const array<T, N>&&) noexcept; // constexpr in C++14
+
+}  // std
+
+*/
+
+#include <__algorithm/equal.h>
+#include <__algorithm/fill_n.h>
+#include <__algorithm/lexicographical_compare.h>
+#include <__algorithm/swap_ranges.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__iterator/reverse_iterator.h>
+#include <__tuple_dir/sfinae_helpers.h>
+#include <__utility/integer_sequence.h>
+#include <__utility/move.h>
+#include <__utility/unreachable.h>
+#include <stdexcept>
+#include <type_traits>
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+// [array.syn]
+#include <compare>
+#include <initializer_list>
+
+// [tuple.helper]
+#include <__tuple_dir/tuple_element.h>
+#include <__tuple_dir/tuple_size.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, size_t _Size>
+struct _LIBCPP_TEMPLATE_VIS array
+{
+    // types:
+    typedef array __self;
+    typedef _Tp                                   value_type;
+    typedef value_type&                           reference;
+    typedef const value_type&                     const_reference;
+    typedef value_type*                           iterator;
+    typedef const value_type*                     const_iterator;
+    typedef value_type*                           pointer;
+    typedef const value_type*                     const_pointer;
+    typedef size_t                                size_type;
+    typedef ptrdiff_t                             difference_type;
+    typedef _VSTD::reverse_iterator<iterator>       reverse_iterator;
+    typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
+
+    _Tp __elems_[_Size];
+
+    // No explicit construct/copy/destroy for aggregate type
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void fill(const value_type& __u) {
+        _VSTD::fill_n(data(), _Size, __u);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void swap(array& __a) _NOEXCEPT_(__is_nothrow_swappable<_Tp>::value) {
+        _VSTD::swap_ranges(data(), data() + _Size, __a.data());
+    }
+
+    // iterators:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    iterator begin() _NOEXCEPT {return iterator(data());}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_iterator begin() const _NOEXCEPT {return const_iterator(data());}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    iterator end() _NOEXCEPT {return iterator(data() + _Size);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_iterator end() const _NOEXCEPT {return const_iterator(data() + _Size);}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator rbegin() _NOEXCEPT {return reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_reverse_iterator rbegin() const _NOEXCEPT {return const_reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator rend() _NOEXCEPT {return reverse_iterator(begin());}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_reverse_iterator rend() const _NOEXCEPT {return const_reverse_iterator(begin());}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_iterator cbegin() const _NOEXCEPT {return begin();}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_iterator cend() const _NOEXCEPT {return end();}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_reverse_iterator crend() const _NOEXCEPT {return rend();}
+
+    // capacity:
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR size_type size() const _NOEXCEPT {return _Size;}
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR size_type max_size() const _NOEXCEPT {return _Size;}
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR bool empty() const _NOEXCEPT {return _Size == 0;}
+
+    // element access:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reference operator[](size_type __n) _NOEXCEPT {
+        _LIBCPP_ASSERT(__n < _Size, "out-of-bounds access in std::array<T, N>");
+        return __elems_[__n];
+    }
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    const_reference operator[](size_type __n) const _NOEXCEPT {
+        _LIBCPP_ASSERT(__n < _Size, "out-of-bounds access in std::array<T, N>");
+        return __elems_[__n];
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX17 reference at(size_type __n)
+    {
+        if (__n >= _Size)
+            __throw_out_of_range("array::at");
+        return __elems_[__n];
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference at(size_type __n) const
+    {
+        if (__n >= _Size)
+            __throw_out_of_range("array::at");
+        return __elems_[__n];
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 reference front()             _NOEXCEPT {return (*this)[0];}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference front() const _NOEXCEPT {return (*this)[0];}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17 reference back()              _NOEXCEPT {return (*this)[_Size - 1];}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference back() const  _NOEXCEPT {return (*this)[_Size - 1];}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    value_type* data() _NOEXCEPT {return __elems_;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const value_type* data() const _NOEXCEPT {return __elems_;}
+};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS array<_Tp, 0>
+{
+    // types:
+    typedef array __self;
+    typedef _Tp                                   value_type;
+    typedef value_type&                           reference;
+    typedef const value_type&                     const_reference;
+    typedef value_type*                           iterator;
+    typedef const value_type*                     const_iterator;
+    typedef value_type*                           pointer;
+    typedef const value_type*                     const_pointer;
+    typedef size_t                                size_type;
+    typedef ptrdiff_t                             difference_type;
+    typedef _VSTD::reverse_iterator<iterator>       reverse_iterator;
+    typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
+
+    typedef __conditional_t<is_const<_Tp>::value, const char, char> _CharType;
+
+    struct  _ArrayInStructT { _Tp __data_[1]; };
+    _ALIGNAS_TYPE(_ArrayInStructT) _CharType __elems_[sizeof(_ArrayInStructT)];
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    value_type* data() _NOEXCEPT {return nullptr;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const value_type* data() const _NOEXCEPT {return nullptr;}
+
+    // No explicit construct/copy/destroy for aggregate type
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void fill(const value_type&) {
+      static_assert(!is_const<_Tp>::value,
+                    "cannot fill zero-sized array of type 'const T'");
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void swap(array&) _NOEXCEPT {
+      static_assert(!is_const<_Tp>::value,
+                    "cannot swap zero-sized array of type 'const T'");
+    }
+
+    // iterators:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    iterator begin() _NOEXCEPT {return iterator(data());}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_iterator begin() const _NOEXCEPT {return const_iterator(data());}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    iterator end() _NOEXCEPT {return iterator(data());}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_iterator end() const _NOEXCEPT {return const_iterator(data());}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator rbegin() _NOEXCEPT {return reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_reverse_iterator rbegin() const _NOEXCEPT {return const_reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reverse_iterator rend() _NOEXCEPT {return reverse_iterator(begin());}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_reverse_iterator rend() const _NOEXCEPT {return const_reverse_iterator(begin());}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_iterator cbegin() const _NOEXCEPT {return begin();}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_iterator cend() const _NOEXCEPT {return end();}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    const_reverse_iterator crend() const _NOEXCEPT {return rend();}
+
+    // capacity:
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR size_type size() const _NOEXCEPT {return 0; }
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR size_type max_size() const _NOEXCEPT {return 0;}
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR bool empty() const _NOEXCEPT {return true;}
+
+    // element access:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reference operator[](size_type) _NOEXCEPT {
+      _LIBCPP_ASSERT(false, "cannot call array<T, 0>::operator[] on a zero-sized array");
+      __libcpp_unreachable();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    const_reference operator[](size_type) const _NOEXCEPT {
+      _LIBCPP_ASSERT(false, "cannot call array<T, 0>::operator[] on a zero-sized array");
+      __libcpp_unreachable();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reference at(size_type) {
+      __throw_out_of_range("array<T, 0>::at");
+      __libcpp_unreachable();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    const_reference at(size_type) const {
+      __throw_out_of_range("array<T, 0>::at");
+      __libcpp_unreachable();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reference front() _NOEXCEPT {
+      _LIBCPP_ASSERT(false, "cannot call array<T, 0>::front() on a zero-sized array");
+      __libcpp_unreachable();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    const_reference front() const _NOEXCEPT {
+      _LIBCPP_ASSERT(false, "cannot call array<T, 0>::front() on a zero-sized array");
+      __libcpp_unreachable();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX17
+    reference back() _NOEXCEPT {
+      _LIBCPP_ASSERT(false, "cannot call array<T, 0>::back() on a zero-sized array");
+      __libcpp_unreachable();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    const_reference back() const _NOEXCEPT {
+      _LIBCPP_ASSERT(false, "cannot call array<T, 0>::back() on a zero-sized array");
+      __libcpp_unreachable();
+    }
+};
+
+
+#if _LIBCPP_STD_VER > 14
+template<class _Tp, class... _Args,
+         class = enable_if_t<__all<_IsSame<_Tp, _Args>::value...>::value>
+         >
+array(_Tp, _Args...)
+  -> array<_Tp, 1 + sizeof...(_Args)>;
+#endif
+
+template <class _Tp, size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+operator==(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
+{
+    return _VSTD::equal(__x.begin(), __x.end(), __y.begin());
+}
+
+template <class _Tp, size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+operator!=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Tp, size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+operator<(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
+{
+    return _VSTD::lexicographical_compare(__x.begin(), __x.end(),
+                                          __y.begin(), __y.end());
+}
+
+template <class _Tp, size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+operator>(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
+{
+    return __y < __x;
+}
+
+template <class _Tp, size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+operator<=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _Tp, size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+operator>=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _Tp, size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t<_Size == 0 || __is_swappable<_Tp>::value, void>
+swap(array<_Tp, _Size>& __x, array<_Tp, _Size>& __y)
+                                  _NOEXCEPT_(noexcept(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+template <class _Tp, size_t _Size>
+struct _LIBCPP_TEMPLATE_VIS tuple_size<array<_Tp, _Size> >
+    : public integral_constant<size_t, _Size> {};
+
+template <size_t _Ip, class _Tp, size_t _Size>
+struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, array<_Tp, _Size> >
+{
+    static_assert(_Ip < _Size, "Index out of bounds in std::tuple_element<> (std::array)");
+    typedef _Tp type;
+};
+
+template <size_t _Ip, class _Tp, size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp&
+get(array<_Tp, _Size>& __a) _NOEXCEPT
+{
+    static_assert(_Ip < _Size, "Index out of bounds in std::get<> (std::array)");
+    return __a.__elems_[_Ip];
+}
+
+template <size_t _Ip, class _Tp, size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const _Tp&
+get(const array<_Tp, _Size>& __a) _NOEXCEPT
+{
+    static_assert(_Ip < _Size, "Index out of bounds in std::get<> (const std::array)");
+    return __a.__elems_[_Ip];
+}
+
+template <size_t _Ip, class _Tp, size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp&&
+get(array<_Tp, _Size>&& __a) _NOEXCEPT
+{
+    static_assert(_Ip < _Size, "Index out of bounds in std::get<> (std::array &&)");
+    return _VSTD::move(__a.__elems_[_Ip]);
+}
+
+template <size_t _Ip, class _Tp, size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const _Tp&&
+get(const array<_Tp, _Size>&& __a) _NOEXCEPT
+{
+    static_assert(_Ip < _Size, "Index out of bounds in std::get<> (const std::array &&)");
+    return _VSTD::move(__a.__elems_[_Ip]);
+}
+
+#if _LIBCPP_STD_VER > 17
+
+template <typename _Tp, size_t _Size, size_t... _Index>
+_LIBCPP_INLINE_VISIBILITY constexpr array<remove_cv_t<_Tp>, _Size>
+__to_array_lvalue_impl(_Tp (&__arr)[_Size], index_sequence<_Index...>) {
+  return {{__arr[_Index]...}};
+}
+
+template <typename _Tp, size_t _Size, size_t... _Index>
+_LIBCPP_INLINE_VISIBILITY constexpr array<remove_cv_t<_Tp>, _Size>
+__to_array_rvalue_impl(_Tp(&&__arr)[_Size], index_sequence<_Index...>) {
+  return {{_VSTD::move(__arr[_Index])...}};
+}
+
+template <typename _Tp, size_t _Size>
+_LIBCPP_INLINE_VISIBILITY constexpr array<remove_cv_t<_Tp>, _Size>
+to_array(_Tp (&__arr)[_Size]) noexcept(is_nothrow_constructible_v<_Tp, _Tp&>) {
+  static_assert(
+      !is_array_v<_Tp>,
+      "[array.creation]/1: to_array does not accept multidimensional arrays.");
+  static_assert(
+      is_constructible_v<_Tp, _Tp&>,
+      "[array.creation]/1: to_array requires copy constructible elements.");
+  return _VSTD::__to_array_lvalue_impl(__arr, make_index_sequence<_Size>());
+}
+
+template <typename _Tp, size_t _Size>
+_LIBCPP_INLINE_VISIBILITY constexpr array<remove_cv_t<_Tp>, _Size>
+to_array(_Tp(&&__arr)[_Size]) noexcept(is_nothrow_move_constructible_v<_Tp>) {
+  static_assert(
+      !is_array_v<_Tp>,
+      "[array.creation]/4: to_array does not accept multidimensional arrays.");
+  static_assert(
+      is_move_constructible_v<_Tp>,
+      "[array.creation]/4: to_array requires move constructible elements.");
+  return _VSTD::__to_array_rvalue_impl(_VSTD::move(__arr),
+                                       make_index_sequence<_Size>());
+}
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <algorithm>
+#  include <concepts>
+#  include <iterator>
+#  include <utility>
+#endif
+
+#endif // _LIBCPP_ARRAY
diff --git a/app/src/main/cpp/libcxx/include/atomic b/app/src/main/cpp/libcxx/include/atomic
new file mode 100644
index 0000000..d0d682d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/atomic
@@ -0,0 +1,2673 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_ATOMIC
+#define _LIBCPP_ATOMIC
+
+/*
+    atomic synopsis
+
+namespace std
+{
+
+// feature test macro [version.syn]
+
+#define __cpp_lib_atomic_is_always_lock_free
+#define __cpp_lib_atomic_flag_test
+#define __cpp_lib_atomic_lock_free_type_aliases
+#define __cpp_lib_atomic_wait
+
+ // order and consistency
+
+ enum memory_order: unspecified // enum class in C++20
+ {
+    relaxed,
+    consume, // load-consume
+    acquire, // load-acquire
+    release, // store-release
+    acq_rel, // store-release load-acquire
+    seq_cst // store-release load-acquire
+ };
+
+ inline constexpr auto memory_order_relaxed = memory_order::relaxed;
+ inline constexpr auto memory_order_consume = memory_order::consume;
+ inline constexpr auto memory_order_acquire = memory_order::acquire;
+ inline constexpr auto memory_order_release = memory_order::release;
+ inline constexpr auto memory_order_acq_rel = memory_order::acq_rel;
+ inline constexpr auto memory_order_seq_cst = memory_order::seq_cst;
+
+template <class T> T kill_dependency(T y) noexcept;
+
+// lock-free property
+
+#define ATOMIC_BOOL_LOCK_FREE unspecified
+#define ATOMIC_CHAR_LOCK_FREE unspecified
+#define ATOMIC_CHAR8_T_LOCK_FREE unspecified // C++20
+#define ATOMIC_CHAR16_T_LOCK_FREE unspecified
+#define ATOMIC_CHAR32_T_LOCK_FREE unspecified
+#define ATOMIC_WCHAR_T_LOCK_FREE unspecified
+#define ATOMIC_SHORT_LOCK_FREE unspecified
+#define ATOMIC_INT_LOCK_FREE unspecified
+#define ATOMIC_LONG_LOCK_FREE unspecified
+#define ATOMIC_LLONG_LOCK_FREE unspecified
+#define ATOMIC_POINTER_LOCK_FREE unspecified
+
+template <class T>
+struct atomic
+{
+    using value_type = T;
+
+    static constexpr bool is_always_lock_free;
+    bool is_lock_free() const volatile noexcept;
+    bool is_lock_free() const noexcept;
+
+    atomic() noexcept = default; // until C++20
+    constexpr atomic() noexcept(is_nothrow_default_constructible_v<T>); // since C++20
+    constexpr atomic(T desr) noexcept;
+    atomic(const atomic&) = delete;
+    atomic& operator=(const atomic&) = delete;
+    atomic& operator=(const atomic&) volatile = delete;
+
+    T load(memory_order m = memory_order_seq_cst) const volatile noexcept;
+    T load(memory_order m = memory_order_seq_cst) const noexcept;
+    operator T() const volatile noexcept;
+    operator T() const noexcept;
+    void store(T desr, memory_order m = memory_order_seq_cst) volatile noexcept;
+    void store(T desr, memory_order m = memory_order_seq_cst) noexcept;
+    T operator=(T) volatile noexcept;
+    T operator=(T) noexcept;
+
+    T exchange(T desr, memory_order m = memory_order_seq_cst) volatile noexcept;
+    T exchange(T desr, memory_order m = memory_order_seq_cst) noexcept;
+    bool compare_exchange_weak(T& expc, T desr,
+                               memory_order s, memory_order f) volatile noexcept;
+    bool compare_exchange_weak(T& expc, T desr, memory_order s, memory_order f) noexcept;
+    bool compare_exchange_strong(T& expc, T desr,
+                                 memory_order s, memory_order f) volatile noexcept;
+    bool compare_exchange_strong(T& expc, T desr,
+                                 memory_order s, memory_order f) noexcept;
+    bool compare_exchange_weak(T& expc, T desr,
+                               memory_order m = memory_order_seq_cst) volatile noexcept;
+    bool compare_exchange_weak(T& expc, T desr,
+                               memory_order m = memory_order_seq_cst) noexcept;
+    bool compare_exchange_strong(T& expc, T desr,
+                                memory_order m = memory_order_seq_cst) volatile noexcept;
+    bool compare_exchange_strong(T& expc, T desr,
+                                 memory_order m = memory_order_seq_cst) noexcept;
+
+    void wait(T, memory_order = memory_order::seq_cst) const volatile noexcept;
+    void wait(T, memory_order = memory_order::seq_cst) const noexcept;
+    void notify_one() volatile noexcept;
+    void notify_one() noexcept;
+    void notify_all() volatile noexcept;
+    void notify_all() noexcept;
+};
+
+template <>
+struct atomic<integral>
+{
+    using value_type = integral;
+    using difference_type = value_type;
+
+    static constexpr bool is_always_lock_free;
+    bool is_lock_free() const volatile noexcept;
+    bool is_lock_free() const noexcept;
+
+    atomic() noexcept = default;
+    constexpr atomic(integral desr) noexcept;
+    atomic(const atomic&) = delete;
+    atomic& operator=(const atomic&) = delete;
+    atomic& operator=(const atomic&) volatile = delete;
+
+    integral load(memory_order m = memory_order_seq_cst) const volatile noexcept;
+    integral load(memory_order m = memory_order_seq_cst) const noexcept;
+    operator integral() const volatile noexcept;
+    operator integral() const noexcept;
+    void store(integral desr, memory_order m = memory_order_seq_cst) volatile noexcept;
+    void store(integral desr, memory_order m = memory_order_seq_cst) noexcept;
+    integral operator=(integral desr) volatile noexcept;
+    integral operator=(integral desr) noexcept;
+
+    integral exchange(integral desr,
+                      memory_order m = memory_order_seq_cst) volatile noexcept;
+    integral exchange(integral desr, memory_order m = memory_order_seq_cst) noexcept;
+    bool compare_exchange_weak(integral& expc, integral desr,
+                               memory_order s, memory_order f) volatile noexcept;
+    bool compare_exchange_weak(integral& expc, integral desr,
+                               memory_order s, memory_order f) noexcept;
+    bool compare_exchange_strong(integral& expc, integral desr,
+                                 memory_order s, memory_order f) volatile noexcept;
+    bool compare_exchange_strong(integral& expc, integral desr,
+                                 memory_order s, memory_order f) noexcept;
+    bool compare_exchange_weak(integral& expc, integral desr,
+                               memory_order m = memory_order_seq_cst) volatile noexcept;
+    bool compare_exchange_weak(integral& expc, integral desr,
+                               memory_order m = memory_order_seq_cst) noexcept;
+    bool compare_exchange_strong(integral& expc, integral desr,
+                                memory_order m = memory_order_seq_cst) volatile noexcept;
+    bool compare_exchange_strong(integral& expc, integral desr,
+                                 memory_order m = memory_order_seq_cst) noexcept;
+
+    integral fetch_add(integral op, memory_order m = memory_order_seq_cst) volatile noexcept;
+    integral fetch_add(integral op, memory_order m = memory_order_seq_cst) noexcept;
+    integral fetch_sub(integral op, memory_order m = memory_order_seq_cst) volatile noexcept;
+    integral fetch_sub(integral op, memory_order m = memory_order_seq_cst) noexcept;
+    integral fetch_and(integral op, memory_order m = memory_order_seq_cst) volatile noexcept;
+    integral fetch_and(integral op, memory_order m = memory_order_seq_cst) noexcept;
+    integral fetch_or(integral op, memory_order m = memory_order_seq_cst) volatile noexcept;
+    integral fetch_or(integral op, memory_order m = memory_order_seq_cst) noexcept;
+    integral fetch_xor(integral op, memory_order m = memory_order_seq_cst) volatile noexcept;
+    integral fetch_xor(integral op, memory_order m = memory_order_seq_cst) noexcept;
+
+    integral operator++(int) volatile noexcept;
+    integral operator++(int) noexcept;
+    integral operator--(int) volatile noexcept;
+    integral operator--(int) noexcept;
+    integral operator++() volatile noexcept;
+    integral operator++() noexcept;
+    integral operator--() volatile noexcept;
+    integral operator--() noexcept;
+    integral operator+=(integral op) volatile noexcept;
+    integral operator+=(integral op) noexcept;
+    integral operator-=(integral op) volatile noexcept;
+    integral operator-=(integral op) noexcept;
+    integral operator&=(integral op) volatile noexcept;
+    integral operator&=(integral op) noexcept;
+    integral operator|=(integral op) volatile noexcept;
+    integral operator|=(integral op) noexcept;
+    integral operator^=(integral op) volatile noexcept;
+    integral operator^=(integral op) noexcept;
+
+    void wait(integral, memory_order = memory_order::seq_cst) const volatile noexcept;
+    void wait(integral, memory_order = memory_order::seq_cst) const noexcept;
+    void notify_one() volatile noexcept;
+    void notify_one() noexcept;
+    void notify_all() volatile noexcept;
+    void notify_all() noexcept;
+};
+
+template <class T>
+struct atomic<T*>
+{
+    using value_type = T*;
+    using difference_type = ptrdiff_t;
+
+    static constexpr bool is_always_lock_free;
+    bool is_lock_free() const volatile noexcept;
+    bool is_lock_free() const noexcept;
+
+    atomic() noexcept = default; // until C++20
+    constexpr atomic() noexcept; // since C++20
+    constexpr atomic(T* desr) noexcept;
+    atomic(const atomic&) = delete;
+    atomic& operator=(const atomic&) = delete;
+    atomic& operator=(const atomic&) volatile = delete;
+
+    T* load(memory_order m = memory_order_seq_cst) const volatile noexcept;
+    T* load(memory_order m = memory_order_seq_cst) const noexcept;
+    operator T*() const volatile noexcept;
+    operator T*() const noexcept;
+    void store(T* desr, memory_order m = memory_order_seq_cst) volatile noexcept;
+    void store(T* desr, memory_order m = memory_order_seq_cst) noexcept;
+    T* operator=(T*) volatile noexcept;
+    T* operator=(T*) noexcept;
+
+    T* exchange(T* desr, memory_order m = memory_order_seq_cst) volatile noexcept;
+    T* exchange(T* desr, memory_order m = memory_order_seq_cst) noexcept;
+    bool compare_exchange_weak(T*& expc, T* desr,
+                               memory_order s, memory_order f) volatile noexcept;
+    bool compare_exchange_weak(T*& expc, T* desr,
+                               memory_order s, memory_order f) noexcept;
+    bool compare_exchange_strong(T*& expc, T* desr,
+                                 memory_order s, memory_order f) volatile noexcept;
+    bool compare_exchange_strong(T*& expc, T* desr,
+                                 memory_order s, memory_order f) noexcept;
+    bool compare_exchange_weak(T*& expc, T* desr,
+                               memory_order m = memory_order_seq_cst) volatile noexcept;
+    bool compare_exchange_weak(T*& expc, T* desr,
+                               memory_order m = memory_order_seq_cst) noexcept;
+    bool compare_exchange_strong(T*& expc, T* desr,
+                                memory_order m = memory_order_seq_cst) volatile noexcept;
+    bool compare_exchange_strong(T*& expc, T* desr,
+                                 memory_order m = memory_order_seq_cst) noexcept;
+    T* fetch_add(ptrdiff_t op, memory_order m = memory_order_seq_cst) volatile noexcept;
+    T* fetch_add(ptrdiff_t op, memory_order m = memory_order_seq_cst) noexcept;
+    T* fetch_sub(ptrdiff_t op, memory_order m = memory_order_seq_cst) volatile noexcept;
+    T* fetch_sub(ptrdiff_t op, memory_order m = memory_order_seq_cst) noexcept;
+
+    T* operator++(int) volatile noexcept;
+    T* operator++(int) noexcept;
+    T* operator--(int) volatile noexcept;
+    T* operator--(int) noexcept;
+    T* operator++() volatile noexcept;
+    T* operator++() noexcept;
+    T* operator--() volatile noexcept;
+    T* operator--() noexcept;
+    T* operator+=(ptrdiff_t op) volatile noexcept;
+    T* operator+=(ptrdiff_t op) noexcept;
+    T* operator-=(ptrdiff_t op) volatile noexcept;
+    T* operator-=(ptrdiff_t op) noexcept;
+
+    void wait(T*, memory_order = memory_order::seq_cst) const volatile noexcept;
+    void wait(T*, memory_order = memory_order::seq_cst) const noexcept;
+    void notify_one() volatile noexcept;
+    void notify_one() noexcept;
+    void notify_all() volatile noexcept;
+    void notify_all() noexcept;
+};
+
+
+// [atomics.nonmembers], non-member functions
+template<class T>
+  bool atomic_is_lock_free(const volatile atomic<T>*) noexcept;
+template<class T>
+  bool atomic_is_lock_free(const atomic<T>*) noexcept;
+template<class T>
+  void atomic_store(volatile atomic<T>*, atomic<T>::value_type) noexcept;
+template<class T>
+  void atomic_store(atomic<T>*, atomic<T>::value_type) noexcept;
+template<class T>
+  void atomic_store_explicit(volatile atomic<T>*, atomic<T>::value_type,
+                             memory_order) noexcept;
+template<class T>
+  void atomic_store_explicit(atomic<T>*, atomic<T>::value_type,
+                             memory_order) noexcept;
+template<class T>
+  T atomic_load(const volatile atomic<T>*) noexcept;
+template<class T>
+  T atomic_load(const atomic<T>*) noexcept;
+template<class T>
+  T atomic_load_explicit(const volatile atomic<T>*, memory_order) noexcept;
+template<class T>
+  T atomic_load_explicit(const atomic<T>*, memory_order) noexcept;
+template<class T>
+  T atomic_exchange(volatile atomic<T>*, atomic<T>::value_type) noexcept;
+template<class T>
+  T atomic_exchange(atomic<T>*, atomic<T>::value_type) noexcept;
+template<class T>
+  T atomic_exchange_explicit(volatile atomic<T>*, atomic<T>::value_type,
+                             memory_order) noexcept;
+template<class T>
+  T atomic_exchange_explicit(atomic<T>*, atomic<T>::value_type,
+                             memory_order) noexcept;
+template<class T>
+  bool atomic_compare_exchange_weak(volatile atomic<T>*, atomic<T>::value_type*,
+                                    atomic<T>::value_type) noexcept;
+template<class T>
+  bool atomic_compare_exchange_weak(atomic<T>*, atomic<T>::value_type*,
+                                    atomic<T>::value_type) noexcept;
+template<class T>
+  bool atomic_compare_exchange_strong(volatile atomic<T>*, atomic<T>::value_type*,
+                                      atomic<T>::value_type) noexcept;
+template<class T>
+  bool atomic_compare_exchange_strong(atomic<T>*, atomic<T>::value_type*,
+                                      atomic<T>::value_type) noexcept;
+template<class T>
+  bool atomic_compare_exchange_weak_explicit(volatile atomic<T>*, atomic<T>::value_type*,
+                                             atomic<T>::value_type,
+                                             memory_order, memory_order) noexcept;
+template<class T>
+  bool atomic_compare_exchange_weak_explicit(atomic<T>*, atomic<T>::value_type*,
+                                             atomic<T>::value_type,
+                                             memory_order, memory_order) noexcept;
+template<class T>
+  bool atomic_compare_exchange_strong_explicit(volatile atomic<T>*, atomic<T>::value_type*,
+                                               atomic<T>::value_type,
+                                               memory_order, memory_order) noexcept;
+template<class T>
+  bool atomic_compare_exchange_strong_explicit(atomic<T>*, atomic<T>::value_type*,
+                                               atomic<T>::value_type,
+                                               memory_order, memory_order) noexcept;
+
+template<class T>
+  T atomic_fetch_add(volatile atomic<T>*, atomic<T>::difference_type) noexcept;
+template<class T>
+  T atomic_fetch_add(atomic<T>*, atomic<T>::difference_type) noexcept;
+template<class T>
+  T atomic_fetch_add_explicit(volatile atomic<T>*, atomic<T>::difference_type,
+                              memory_order) noexcept;
+template<class T>
+  T atomic_fetch_add_explicit(atomic<T>*, atomic<T>::difference_type,
+                              memory_order) noexcept;
+template<class T>
+  T atomic_fetch_sub(volatile atomic<T>*, atomic<T>::difference_type) noexcept;
+template<class T>
+  T atomic_fetch_sub(atomic<T>*, atomic<T>::difference_type) noexcept;
+template<class T>
+  T atomic_fetch_sub_explicit(volatile atomic<T>*, atomic<T>::difference_type,
+                              memory_order) noexcept;
+template<class T>
+  T atomic_fetch_sub_explicit(atomic<T>*, atomic<T>::difference_type,
+                              memory_order) noexcept;
+template<class T>
+  T atomic_fetch_and(volatile atomic<T>*, atomic<T>::value_type) noexcept;
+template<class T>
+  T atomic_fetch_and(atomic<T>*, atomic<T>::value_type) noexcept;
+template<class T>
+  T atomic_fetch_and_explicit(volatile atomic<T>*, atomic<T>::value_type,
+                              memory_order) noexcept;
+template<class T>
+  T atomic_fetch_and_explicit(atomic<T>*, atomic<T>::value_type,
+                              memory_order) noexcept;
+template<class T>
+  T atomic_fetch_or(volatile atomic<T>*, atomic<T>::value_type) noexcept;
+template<class T>
+  T atomic_fetch_or(atomic<T>*, atomic<T>::value_type) noexcept;
+template<class T>
+  T atomic_fetch_or_explicit(volatile atomic<T>*, atomic<T>::value_type,
+                             memory_order) noexcept;
+template<class T>
+  T atomic_fetch_or_explicit(atomic<T>*, atomic<T>::value_type,
+                             memory_order) noexcept;
+template<class T>
+  T atomic_fetch_xor(volatile atomic<T>*, atomic<T>::value_type) noexcept;
+template<class T>
+  T atomic_fetch_xor(atomic<T>*, atomic<T>::value_type) noexcept;
+template<class T>
+  T atomic_fetch_xor_explicit(volatile atomic<T>*, atomic<T>::value_type,
+                              memory_order) noexcept;
+template<class T>
+  T atomic_fetch_xor_explicit(atomic<T>*, atomic<T>::value_type,
+                              memory_order) noexcept;
+
+template<class T>
+  void atomic_wait(const volatile atomic<T>*, atomic<T>::value_type) noexcept;
+template<class T>
+  void atomic_wait(const atomic<T>*, atomic<T>::value_type) noexcept;
+template<class T>
+  void atomic_wait_explicit(const volatile atomic<T>*, atomic<T>::value_type,
+                            memory_order) noexcept;
+template<class T>
+  void atomic_wait_explicit(const atomic<T>*, atomic<T>::value_type,
+                            memory_order) noexcept;
+template<class T>
+  void atomic_notify_one(volatile atomic<T>*) noexcept;
+template<class T>
+  void atomic_notify_one(atomic<T>*) noexcept;
+template<class T>
+  void atomic_notify_all(volatile atomic<T>*) noexcept;
+template<class T>
+  void atomic_notify_all(atomic<T>*) noexcept;
+
+// Atomics for standard typedef types
+
+typedef atomic<bool>               atomic_bool;
+typedef atomic<char>               atomic_char;
+typedef atomic<signed char>        atomic_schar;
+typedef atomic<unsigned char>      atomic_uchar;
+typedef atomic<short>              atomic_short;
+typedef atomic<unsigned short>     atomic_ushort;
+typedef atomic<int>                atomic_int;
+typedef atomic<unsigned int>       atomic_uint;
+typedef atomic<long>               atomic_long;
+typedef atomic<unsigned long>      atomic_ulong;
+typedef atomic<long long>          atomic_llong;
+typedef atomic<unsigned long long> atomic_ullong;
+typedef atomic<char8_t>            atomic_char8_t; // C++20
+typedef atomic<char16_t>           atomic_char16_t;
+typedef atomic<char32_t>           atomic_char32_t;
+typedef atomic<wchar_t>            atomic_wchar_t;
+
+typedef atomic<int_least8_t>   atomic_int_least8_t;
+typedef atomic<uint_least8_t>  atomic_uint_least8_t;
+typedef atomic<int_least16_t>  atomic_int_least16_t;
+typedef atomic<uint_least16_t> atomic_uint_least16_t;
+typedef atomic<int_least32_t>  atomic_int_least32_t;
+typedef atomic<uint_least32_t> atomic_uint_least32_t;
+typedef atomic<int_least64_t>  atomic_int_least64_t;
+typedef atomic<uint_least64_t> atomic_uint_least64_t;
+
+typedef atomic<int_fast8_t>   atomic_int_fast8_t;
+typedef atomic<uint_fast8_t>  atomic_uint_fast8_t;
+typedef atomic<int_fast16_t>  atomic_int_fast16_t;
+typedef atomic<uint_fast16_t> atomic_uint_fast16_t;
+typedef atomic<int_fast32_t>  atomic_int_fast32_t;
+typedef atomic<uint_fast32_t> atomic_uint_fast32_t;
+typedef atomic<int_fast64_t>  atomic_int_fast64_t;
+typedef atomic<uint_fast64_t> atomic_uint_fast64_t;
+
+typedef atomic<int8_t>   atomic_int8_t;
+typedef atomic<uint8_t>  atomic_uint8_t;
+typedef atomic<int16_t>  atomic_int16_t;
+typedef atomic<uint16_t> atomic_uint16_t;
+typedef atomic<int32_t>  atomic_int32_t;
+typedef atomic<uint32_t> atomic_uint32_t;
+typedef atomic<int64_t>  atomic_int64_t;
+typedef atomic<uint64_t> atomic_uint64_t;
+
+typedef atomic<intptr_t>  atomic_intptr_t;
+typedef atomic<uintptr_t> atomic_uintptr_t;
+typedef atomic<size_t>    atomic_size_t;
+typedef atomic<ptrdiff_t> atomic_ptrdiff_t;
+typedef atomic<intmax_t>  atomic_intmax_t;
+typedef atomic<uintmax_t> atomic_uintmax_t;
+
+// flag type and operations
+
+typedef struct atomic_flag
+{
+    atomic_flag() noexcept = default; // until C++20
+    constexpr atomic_flag() noexcept; // since C++20
+    atomic_flag(const atomic_flag&) = delete;
+    atomic_flag& operator=(const atomic_flag&) = delete;
+    atomic_flag& operator=(const atomic_flag&) volatile = delete;
+
+    bool test(memory_order m = memory_order_seq_cst) volatile noexcept;
+    bool test(memory_order m = memory_order_seq_cst) noexcept;
+    bool test_and_set(memory_order m = memory_order_seq_cst) volatile noexcept;
+    bool test_and_set(memory_order m = memory_order_seq_cst) noexcept;
+    void clear(memory_order m = memory_order_seq_cst) volatile noexcept;
+    void clear(memory_order m = memory_order_seq_cst) noexcept;
+
+    void wait(bool, memory_order = memory_order::seq_cst) const volatile noexcept;
+    void wait(bool, memory_order = memory_order::seq_cst) const noexcept;
+    void notify_one() volatile noexcept;
+    void notify_one() noexcept;
+    void notify_all() volatile noexcept;
+    void notify_all() noexcept;
+} atomic_flag;
+
+bool atomic_flag_test(volatile atomic_flag* obj) noexcept;
+bool atomic_flag_test(atomic_flag* obj) noexcept;
+bool atomic_flag_test_explicit(volatile atomic_flag* obj,
+                               memory_order m) noexcept;
+bool atomic_flag_test_explicit(atomic_flag* obj, memory_order m) noexcept;
+bool atomic_flag_test_and_set(volatile atomic_flag* obj) noexcept;
+bool atomic_flag_test_and_set(atomic_flag* obj) noexcept;
+bool atomic_flag_test_and_set_explicit(volatile atomic_flag* obj,
+                                       memory_order m) noexcept;
+bool atomic_flag_test_and_set_explicit(atomic_flag* obj, memory_order m) noexcept;
+void atomic_flag_clear(volatile atomic_flag* obj) noexcept;
+void atomic_flag_clear(atomic_flag* obj) noexcept;
+void atomic_flag_clear_explicit(volatile atomic_flag* obj, memory_order m) noexcept;
+void atomic_flag_clear_explicit(atomic_flag* obj, memory_order m) noexcept;
+
+void atomic_wait(const volatile atomic_flag* obj, T old) noexcept;
+void atomic_wait(const atomic_flag* obj, T old) noexcept;
+void atomic_wait_explicit(const volatile atomic_flag* obj, T old, memory_order m) noexcept;
+void atomic_wait_explicit(const atomic_flag* obj, T old, memory_order m) noexcept;
+void atomic_one(volatile atomic_flag* obj) noexcept;
+void atomic_one(atomic_flag* obj) noexcept;
+void atomic_all(volatile atomic_flag* obj) noexcept;
+void atomic_all(atomic_flag* obj) noexcept;
+
+// fences
+
+void atomic_thread_fence(memory_order m) noexcept;
+void atomic_signal_fence(memory_order m) noexcept;
+
+// deprecated
+
+template <class T>
+  void atomic_init(volatile atomic<T>* obj, atomic<T>::value_type desr) noexcept;
+
+template <class T>
+  void atomic_init(atomic<T>* obj, atomic<T>::value_type desr) noexcept;
+
+#define ATOMIC_VAR_INIT(value) see below
+
+#define ATOMIC_FLAG_INIT see below
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__chrono/duration.h>
+#include <__config>
+#include <__thread/poll_with_backoff.h>
+#include <__thread/timed_backoff_policy.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_assignable.h>
+#include <__type_traits/is_function.h>
+#include <__type_traits/is_nothrow_default_constructible.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_trivially_copyable.h>
+#include <__type_traits/remove_const.h>
+#include <__type_traits/remove_pointer.h>
+#include <__type_traits/underlying_type.h>
+#include <cstddef>
+#include <cstdint>
+#include <cstring>
+#include <version>
+
+#ifndef _LIBCPP_HAS_NO_THREADS
+# include <__threading_support>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifdef _LIBCPP_HAS_NO_ATOMIC_HEADER
+# error <atomic> is not implemented
+#endif
+#ifdef kill_dependency
+# error <atomic> is incompatible with <stdatomic.h> before C++23. Please compile with -std=c++23.
+#endif
+
+#define _LIBCPP_CHECK_STORE_MEMORY_ORDER(__m) \
+  _LIBCPP_DIAGNOSE_WARNING(__m == memory_order_consume || \
+                           __m == memory_order_acquire || \
+                           __m == memory_order_acq_rel,   \
+                        "memory order argument to atomic operation is invalid")
+
+#define _LIBCPP_CHECK_LOAD_MEMORY_ORDER(__m) \
+  _LIBCPP_DIAGNOSE_WARNING(__m == memory_order_release || \
+                           __m == memory_order_acq_rel,   \
+                        "memory order argument to atomic operation is invalid")
+
+#define _LIBCPP_CHECK_EXCHANGE_MEMORY_ORDER(__m, __f) \
+  _LIBCPP_DIAGNOSE_WARNING(__f == memory_order_release || \
+                           __f == memory_order_acq_rel,   \
+                        "memory order argument to atomic operation is invalid")
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Figure out what the underlying type for `memory_order` would be if it were
+// declared as an unscoped enum (accounting for -fshort-enums). Use this result
+// to pin the underlying type in C++20.
+enum __legacy_memory_order {
+    __mo_relaxed,
+    __mo_consume,
+    __mo_acquire,
+    __mo_release,
+    __mo_acq_rel,
+    __mo_seq_cst
+};
+
+typedef underlying_type<__legacy_memory_order>::type __memory_order_underlying_t;
+
+#if _LIBCPP_STD_VER > 17
+
+enum class memory_order : __memory_order_underlying_t {
+  relaxed = __mo_relaxed,
+  consume = __mo_consume,
+  acquire = __mo_acquire,
+  release = __mo_release,
+  acq_rel = __mo_acq_rel,
+  seq_cst = __mo_seq_cst
+};
+
+inline constexpr auto memory_order_relaxed = memory_order::relaxed;
+inline constexpr auto memory_order_consume = memory_order::consume;
+inline constexpr auto memory_order_acquire = memory_order::acquire;
+inline constexpr auto memory_order_release = memory_order::release;
+inline constexpr auto memory_order_acq_rel = memory_order::acq_rel;
+inline constexpr auto memory_order_seq_cst = memory_order::seq_cst;
+
+#else
+
+typedef enum memory_order {
+  memory_order_relaxed = __mo_relaxed,
+  memory_order_consume = __mo_consume,
+  memory_order_acquire = __mo_acquire,
+  memory_order_release = __mo_release,
+  memory_order_acq_rel = __mo_acq_rel,
+  memory_order_seq_cst = __mo_seq_cst,
+} memory_order;
+
+#endif // _LIBCPP_STD_VER > 17
+
+template <typename _Tp> _LIBCPP_INLINE_VISIBILITY
+bool __cxx_nonatomic_compare_equal(_Tp const& __lhs, _Tp const& __rhs) {
+    return _VSTD::memcmp(&__lhs, &__rhs, sizeof(_Tp)) == 0;
+}
+
+static_assert((is_same<underlying_type<memory_order>::type, __memory_order_underlying_t>::value),
+  "unexpected underlying type for std::memory_order");
+
+#if defined(_LIBCPP_HAS_GCC_ATOMIC_IMP) || \
+    defined(_LIBCPP_ATOMIC_ONLY_USE_BUILTINS)
+
+// [atomics.types.generic]p1 guarantees _Tp is trivially copyable. Because
+// the default operator= in an object is not volatile, a byte-by-byte copy
+// is required.
+template <typename _Tp, typename _Tv> _LIBCPP_INLINE_VISIBILITY
+typename enable_if<is_assignable<_Tp&, _Tv>::value>::type
+__cxx_atomic_assign_volatile(_Tp& __a_value, _Tv const& __val) {
+  __a_value = __val;
+}
+template <typename _Tp, typename _Tv> _LIBCPP_INLINE_VISIBILITY
+typename enable_if<is_assignable<_Tp&, _Tv>::value>::type
+__cxx_atomic_assign_volatile(_Tp volatile& __a_value, _Tv volatile const& __val) {
+  volatile char* __to = reinterpret_cast<volatile char*>(&__a_value);
+  volatile char* __end = __to + sizeof(_Tp);
+  volatile const char* __from = reinterpret_cast<volatile const char*>(&__val);
+  while (__to != __end)
+    *__to++ = *__from++;
+}
+
+#endif
+
+#if defined(_LIBCPP_HAS_GCC_ATOMIC_IMP)
+
+template <typename _Tp>
+struct __cxx_atomic_base_impl {
+
+  _LIBCPP_INLINE_VISIBILITY
+#ifndef _LIBCPP_CXX03_LANG
+    __cxx_atomic_base_impl() _NOEXCEPT = default;
+#else
+    __cxx_atomic_base_impl() _NOEXCEPT : __a_value() {}
+#endif // _LIBCPP_CXX03_LANG
+  _LIBCPP_CONSTEXPR explicit __cxx_atomic_base_impl(_Tp value) _NOEXCEPT
+    : __a_value(value) {}
+  _Tp __a_value;
+};
+
+_LIBCPP_INLINE_VISIBILITY inline _LIBCPP_CONSTEXPR int __to_gcc_order(memory_order __order) {
+  // Avoid switch statement to make this a constexpr.
+  return __order == memory_order_relaxed ? __ATOMIC_RELAXED:
+         (__order == memory_order_acquire ? __ATOMIC_ACQUIRE:
+          (__order == memory_order_release ? __ATOMIC_RELEASE:
+           (__order == memory_order_seq_cst ? __ATOMIC_SEQ_CST:
+            (__order == memory_order_acq_rel ? __ATOMIC_ACQ_REL:
+              __ATOMIC_CONSUME))));
+}
+
+_LIBCPP_INLINE_VISIBILITY inline _LIBCPP_CONSTEXPR int __to_gcc_failure_order(memory_order __order) {
+  // Avoid switch statement to make this a constexpr.
+  return __order == memory_order_relaxed ? __ATOMIC_RELAXED:
+         (__order == memory_order_acquire ? __ATOMIC_ACQUIRE:
+          (__order == memory_order_release ? __ATOMIC_RELAXED:
+           (__order == memory_order_seq_cst ? __ATOMIC_SEQ_CST:
+            (__order == memory_order_acq_rel ? __ATOMIC_ACQUIRE:
+              __ATOMIC_CONSUME))));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void __cxx_atomic_init(volatile __cxx_atomic_base_impl<_Tp>* __a,  _Tp __val) {
+  __cxx_atomic_assign_volatile(__a->__a_value, __val);
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void __cxx_atomic_init(__cxx_atomic_base_impl<_Tp>* __a,  _Tp __val) {
+  __a->__a_value = __val;
+}
+
+_LIBCPP_INLINE_VISIBILITY inline
+void __cxx_atomic_thread_fence(memory_order __order) {
+  __atomic_thread_fence(__to_gcc_order(__order));
+}
+
+_LIBCPP_INLINE_VISIBILITY inline
+void __cxx_atomic_signal_fence(memory_order __order) {
+  __atomic_signal_fence(__to_gcc_order(__order));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void __cxx_atomic_store(volatile __cxx_atomic_base_impl<_Tp>* __a,  _Tp __val,
+                        memory_order __order) {
+  __atomic_store(&__a->__a_value, &__val,
+                 __to_gcc_order(__order));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void __cxx_atomic_store(__cxx_atomic_base_impl<_Tp>* __a,  _Tp __val,
+                        memory_order __order) {
+  __atomic_store(&__a->__a_value, &__val,
+                 __to_gcc_order(__order));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_load(const volatile __cxx_atomic_base_impl<_Tp>* __a,
+                      memory_order __order) {
+  _Tp __ret;
+  __atomic_load(&__a->__a_value, &__ret,
+                __to_gcc_order(__order));
+  return __ret;
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_load(const __cxx_atomic_base_impl<_Tp>* __a, memory_order __order) {
+  _Tp __ret;
+  __atomic_load(&__a->__a_value, &__ret,
+                __to_gcc_order(__order));
+  return __ret;
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_exchange(volatile __cxx_atomic_base_impl<_Tp>* __a,
+                          _Tp __value, memory_order __order) {
+  _Tp __ret;
+  __atomic_exchange(&__a->__a_value, &__value, &__ret,
+                    __to_gcc_order(__order));
+  return __ret;
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_exchange(__cxx_atomic_base_impl<_Tp>* __a, _Tp __value,
+                          memory_order __order) {
+  _Tp __ret;
+  __atomic_exchange(&__a->__a_value, &__value, &__ret,
+                    __to_gcc_order(__order));
+  return __ret;
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool __cxx_atomic_compare_exchange_strong(
+    volatile __cxx_atomic_base_impl<_Tp>* __a, _Tp* __expected, _Tp __value,
+    memory_order __success, memory_order __failure) {
+  return __atomic_compare_exchange(&__a->__a_value, __expected, &__value,
+                                   false,
+                                   __to_gcc_order(__success),
+                                   __to_gcc_failure_order(__failure));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool __cxx_atomic_compare_exchange_strong(
+    __cxx_atomic_base_impl<_Tp>* __a, _Tp* __expected, _Tp __value, memory_order __success,
+    memory_order __failure) {
+  return __atomic_compare_exchange(&__a->__a_value, __expected, &__value,
+                                   false,
+                                   __to_gcc_order(__success),
+                                   __to_gcc_failure_order(__failure));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool __cxx_atomic_compare_exchange_weak(
+    volatile __cxx_atomic_base_impl<_Tp>* __a, _Tp* __expected, _Tp __value,
+    memory_order __success, memory_order __failure) {
+  return __atomic_compare_exchange(&__a->__a_value, __expected, &__value,
+                                   true,
+                                   __to_gcc_order(__success),
+                                   __to_gcc_failure_order(__failure));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool __cxx_atomic_compare_exchange_weak(
+    __cxx_atomic_base_impl<_Tp>* __a, _Tp* __expected, _Tp __value, memory_order __success,
+    memory_order __failure) {
+  return __atomic_compare_exchange(&__a->__a_value, __expected, &__value,
+                                   true,
+                                   __to_gcc_order(__success),
+                                   __to_gcc_failure_order(__failure));
+}
+
+template <typename _Tp>
+struct __skip_amt { enum {value = 1}; };
+
+template <typename _Tp>
+struct __skip_amt<_Tp*> { enum {value = sizeof(_Tp)}; };
+
+// FIXME: Haven't figured out what the spec says about using arrays with
+// atomic_fetch_add. Force a failure rather than creating bad behavior.
+template <typename _Tp>
+struct __skip_amt<_Tp[]> { };
+template <typename _Tp, int n>
+struct __skip_amt<_Tp[n]> { };
+
+template <typename _Tp, typename _Td>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_add(volatile __cxx_atomic_base_impl<_Tp>* __a,
+                           _Td __delta, memory_order __order) {
+  return __atomic_fetch_add(&__a->__a_value, __delta * __skip_amt<_Tp>::value,
+                            __to_gcc_order(__order));
+}
+
+template <typename _Tp, typename _Td>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_add(__cxx_atomic_base_impl<_Tp>* __a, _Td __delta,
+                           memory_order __order) {
+  return __atomic_fetch_add(&__a->__a_value, __delta * __skip_amt<_Tp>::value,
+                            __to_gcc_order(__order));
+}
+
+template <typename _Tp, typename _Td>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_sub(volatile __cxx_atomic_base_impl<_Tp>* __a,
+                           _Td __delta, memory_order __order) {
+  return __atomic_fetch_sub(&__a->__a_value, __delta * __skip_amt<_Tp>::value,
+                            __to_gcc_order(__order));
+}
+
+template <typename _Tp, typename _Td>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_sub(__cxx_atomic_base_impl<_Tp>* __a, _Td __delta,
+                           memory_order __order) {
+  return __atomic_fetch_sub(&__a->__a_value, __delta * __skip_amt<_Tp>::value,
+                            __to_gcc_order(__order));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_and(volatile __cxx_atomic_base_impl<_Tp>* __a,
+                           _Tp __pattern, memory_order __order) {
+  return __atomic_fetch_and(&__a->__a_value, __pattern,
+                            __to_gcc_order(__order));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_and(__cxx_atomic_base_impl<_Tp>* __a,
+                           _Tp __pattern, memory_order __order) {
+  return __atomic_fetch_and(&__a->__a_value, __pattern,
+                            __to_gcc_order(__order));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_or(volatile __cxx_atomic_base_impl<_Tp>* __a,
+                          _Tp __pattern, memory_order __order) {
+  return __atomic_fetch_or(&__a->__a_value, __pattern,
+                           __to_gcc_order(__order));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_or(__cxx_atomic_base_impl<_Tp>* __a, _Tp __pattern,
+                          memory_order __order) {
+  return __atomic_fetch_or(&__a->__a_value, __pattern,
+                           __to_gcc_order(__order));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_xor(volatile __cxx_atomic_base_impl<_Tp>* __a,
+                           _Tp __pattern, memory_order __order) {
+  return __atomic_fetch_xor(&__a->__a_value, __pattern,
+                            __to_gcc_order(__order));
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_xor(__cxx_atomic_base_impl<_Tp>* __a, _Tp __pattern,
+                           memory_order __order) {
+  return __atomic_fetch_xor(&__a->__a_value, __pattern,
+                            __to_gcc_order(__order));
+}
+
+#define __cxx_atomic_is_lock_free(__s) __atomic_is_lock_free(__s, 0)
+
+#elif defined(_LIBCPP_HAS_C_ATOMIC_IMP)
+
+template <typename _Tp>
+struct __cxx_atomic_base_impl {
+
+  _LIBCPP_INLINE_VISIBILITY
+#ifndef _LIBCPP_CXX03_LANG
+    __cxx_atomic_base_impl() _NOEXCEPT = default;
+#else
+    __cxx_atomic_base_impl() _NOEXCEPT : __a_value() {}
+#endif // _LIBCPP_CXX03_LANG
+  _LIBCPP_CONSTEXPR explicit __cxx_atomic_base_impl(_Tp __value) _NOEXCEPT
+    : __a_value(__value) {}
+  _LIBCPP_DISABLE_EXTENSION_WARNING _Atomic(_Tp) __a_value;
+};
+
+#define __cxx_atomic_is_lock_free(__s) __c11_atomic_is_lock_free(__s)
+
+_LIBCPP_INLINE_VISIBILITY inline
+void __cxx_atomic_thread_fence(memory_order __order) _NOEXCEPT {
+    __c11_atomic_thread_fence(static_cast<__memory_order_underlying_t>(__order));
+}
+
+_LIBCPP_INLINE_VISIBILITY inline
+void __cxx_atomic_signal_fence(memory_order __order) _NOEXCEPT {
+    __c11_atomic_signal_fence(static_cast<__memory_order_underlying_t>(__order));
+}
+
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void __cxx_atomic_init(__cxx_atomic_base_impl<_Tp> volatile* __a, _Tp __val) _NOEXCEPT {
+    __c11_atomic_init(&__a->__a_value, __val);
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void __cxx_atomic_init(__cxx_atomic_base_impl<_Tp> * __a, _Tp __val) _NOEXCEPT {
+    __c11_atomic_init(&__a->__a_value, __val);
+}
+
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void __cxx_atomic_store(__cxx_atomic_base_impl<_Tp> volatile* __a, _Tp __val, memory_order __order) _NOEXCEPT {
+    __c11_atomic_store(&__a->__a_value, __val, static_cast<__memory_order_underlying_t>(__order));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void __cxx_atomic_store(__cxx_atomic_base_impl<_Tp> * __a, _Tp __val, memory_order __order) _NOEXCEPT {
+    __c11_atomic_store(&__a->__a_value, __val, static_cast<__memory_order_underlying_t>(__order));
+}
+
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_load(__cxx_atomic_base_impl<_Tp> const volatile* __a, memory_order __order) _NOEXCEPT {
+    using __ptr_type = __remove_const_t<decltype(__a->__a_value)>*;
+    return __c11_atomic_load(const_cast<__ptr_type>(&__a->__a_value), static_cast<__memory_order_underlying_t>(__order));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_load(__cxx_atomic_base_impl<_Tp> const* __a, memory_order __order) _NOEXCEPT {
+    using __ptr_type = __remove_const_t<decltype(__a->__a_value)>*;
+    return __c11_atomic_load(const_cast<__ptr_type>(&__a->__a_value), static_cast<__memory_order_underlying_t>(__order));
+}
+
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_exchange(__cxx_atomic_base_impl<_Tp> volatile* __a, _Tp __value, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_exchange(&__a->__a_value, __value, static_cast<__memory_order_underlying_t>(__order));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_exchange(__cxx_atomic_base_impl<_Tp> * __a, _Tp __value, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_exchange(&__a->__a_value, __value, static_cast<__memory_order_underlying_t>(__order));
+}
+
+_LIBCPP_INLINE_VISIBILITY inline _LIBCPP_CONSTEXPR memory_order __to_failure_order(memory_order __order) {
+  // Avoid switch statement to make this a constexpr.
+  return __order == memory_order_release ? memory_order_relaxed:
+         (__order == memory_order_acq_rel ? memory_order_acquire:
+             __order);
+}
+
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool __cxx_atomic_compare_exchange_strong(__cxx_atomic_base_impl<_Tp> volatile* __a, _Tp* __expected, _Tp __value, memory_order __success, memory_order __failure) _NOEXCEPT {
+    return __c11_atomic_compare_exchange_strong(&__a->__a_value, __expected, __value, static_cast<__memory_order_underlying_t>(__success), static_cast<__memory_order_underlying_t>(__to_failure_order(__failure)));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool __cxx_atomic_compare_exchange_strong(__cxx_atomic_base_impl<_Tp> * __a, _Tp* __expected, _Tp __value, memory_order __success, memory_order __failure) _NOEXCEPT {
+    return __c11_atomic_compare_exchange_strong(&__a->__a_value, __expected, __value, static_cast<__memory_order_underlying_t>(__success), static_cast<__memory_order_underlying_t>(__to_failure_order(__failure)));
+}
+
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool __cxx_atomic_compare_exchange_weak(__cxx_atomic_base_impl<_Tp> volatile* __a, _Tp* __expected, _Tp __value, memory_order __success, memory_order __failure) _NOEXCEPT {
+    return __c11_atomic_compare_exchange_weak(&__a->__a_value, __expected, __value, static_cast<__memory_order_underlying_t>(__success), static_cast<__memory_order_underlying_t>(__to_failure_order(__failure)));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool __cxx_atomic_compare_exchange_weak(__cxx_atomic_base_impl<_Tp> * __a, _Tp* __expected, _Tp __value, memory_order __success, memory_order __failure) _NOEXCEPT {
+    return __c11_atomic_compare_exchange_weak(&__a->__a_value, __expected, __value,  static_cast<__memory_order_underlying_t>(__success), static_cast<__memory_order_underlying_t>(__to_failure_order(__failure)));
+}
+
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_add(__cxx_atomic_base_impl<_Tp> volatile* __a, _Tp __delta, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_add(&__a->__a_value, __delta, static_cast<__memory_order_underlying_t>(__order));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_add(__cxx_atomic_base_impl<_Tp> * __a, _Tp __delta, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_add(&__a->__a_value, __delta, static_cast<__memory_order_underlying_t>(__order));
+}
+
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp* __cxx_atomic_fetch_add(__cxx_atomic_base_impl<_Tp*> volatile* __a, ptrdiff_t __delta, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_add(&__a->__a_value, __delta, static_cast<__memory_order_underlying_t>(__order));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp* __cxx_atomic_fetch_add(__cxx_atomic_base_impl<_Tp*> * __a, ptrdiff_t __delta, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_add(&__a->__a_value, __delta, static_cast<__memory_order_underlying_t>(__order));
+}
+
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_sub(__cxx_atomic_base_impl<_Tp> volatile* __a, _Tp __delta, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_sub(&__a->__a_value, __delta, static_cast<__memory_order_underlying_t>(__order));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_sub(__cxx_atomic_base_impl<_Tp> * __a, _Tp __delta, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_sub(&__a->__a_value, __delta, static_cast<__memory_order_underlying_t>(__order));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp* __cxx_atomic_fetch_sub(__cxx_atomic_base_impl<_Tp*> volatile* __a, ptrdiff_t __delta, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_sub(&__a->__a_value, __delta, static_cast<__memory_order_underlying_t>(__order));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp* __cxx_atomic_fetch_sub(__cxx_atomic_base_impl<_Tp*> * __a, ptrdiff_t __delta, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_sub(&__a->__a_value, __delta, static_cast<__memory_order_underlying_t>(__order));
+}
+
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_and(__cxx_atomic_base_impl<_Tp> volatile* __a, _Tp __pattern, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_and(&__a->__a_value, __pattern, static_cast<__memory_order_underlying_t>(__order));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_and(__cxx_atomic_base_impl<_Tp> * __a, _Tp __pattern, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_and(&__a->__a_value, __pattern, static_cast<__memory_order_underlying_t>(__order));
+}
+
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_or(__cxx_atomic_base_impl<_Tp> volatile* __a, _Tp __pattern, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_or(&__a->__a_value, __pattern, static_cast<__memory_order_underlying_t>(__order));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_or(__cxx_atomic_base_impl<_Tp> * __a, _Tp __pattern, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_or(&__a->__a_value, __pattern, static_cast<__memory_order_underlying_t>(__order));
+}
+
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_xor(__cxx_atomic_base_impl<_Tp> volatile* __a, _Tp __pattern, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_xor(&__a->__a_value, __pattern, static_cast<__memory_order_underlying_t>(__order));
+}
+template<class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_xor(__cxx_atomic_base_impl<_Tp> * __a, _Tp __pattern, memory_order __order) _NOEXCEPT {
+    return __c11_atomic_fetch_xor(&__a->__a_value, __pattern, static_cast<__memory_order_underlying_t>(__order));
+}
+
+#endif // _LIBCPP_HAS_GCC_ATOMIC_IMP, _LIBCPP_HAS_C_ATOMIC_IMP
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp kill_dependency(_Tp __y) _NOEXCEPT
+{
+    return __y;
+}
+
+#if defined(__CLANG_ATOMIC_BOOL_LOCK_FREE)
+# define ATOMIC_BOOL_LOCK_FREE      __CLANG_ATOMIC_BOOL_LOCK_FREE
+# define ATOMIC_CHAR_LOCK_FREE      __CLANG_ATOMIC_CHAR_LOCK_FREE
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+# define ATOMIC_CHAR8_T_LOCK_FREE   __CLANG_ATOMIC_CHAR8_T_LOCK_FREE
+#endif
+# define ATOMIC_CHAR16_T_LOCK_FREE  __CLANG_ATOMIC_CHAR16_T_LOCK_FREE
+# define ATOMIC_CHAR32_T_LOCK_FREE  __CLANG_ATOMIC_CHAR32_T_LOCK_FREE
+# define ATOMIC_WCHAR_T_LOCK_FREE   __CLANG_ATOMIC_WCHAR_T_LOCK_FREE
+# define ATOMIC_SHORT_LOCK_FREE     __CLANG_ATOMIC_SHORT_LOCK_FREE
+# define ATOMIC_INT_LOCK_FREE       __CLANG_ATOMIC_INT_LOCK_FREE
+# define ATOMIC_LONG_LOCK_FREE      __CLANG_ATOMIC_LONG_LOCK_FREE
+# define ATOMIC_LLONG_LOCK_FREE     __CLANG_ATOMIC_LLONG_LOCK_FREE
+# define ATOMIC_POINTER_LOCK_FREE   __CLANG_ATOMIC_POINTER_LOCK_FREE
+#elif defined(__GCC_ATOMIC_BOOL_LOCK_FREE)
+# define ATOMIC_BOOL_LOCK_FREE      __GCC_ATOMIC_BOOL_LOCK_FREE
+# define ATOMIC_CHAR_LOCK_FREE      __GCC_ATOMIC_CHAR_LOCK_FREE
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+# define ATOMIC_CHAR8_T_LOCK_FREE   __GCC_ATOMIC_CHAR8_T_LOCK_FREE
+#endif
+# define ATOMIC_CHAR16_T_LOCK_FREE  __GCC_ATOMIC_CHAR16_T_LOCK_FREE
+# define ATOMIC_CHAR32_T_LOCK_FREE  __GCC_ATOMIC_CHAR32_T_LOCK_FREE
+# define ATOMIC_WCHAR_T_LOCK_FREE   __GCC_ATOMIC_WCHAR_T_LOCK_FREE
+# define ATOMIC_SHORT_LOCK_FREE     __GCC_ATOMIC_SHORT_LOCK_FREE
+# define ATOMIC_INT_LOCK_FREE       __GCC_ATOMIC_INT_LOCK_FREE
+# define ATOMIC_LONG_LOCK_FREE      __GCC_ATOMIC_LONG_LOCK_FREE
+# define ATOMIC_LLONG_LOCK_FREE     __GCC_ATOMIC_LLONG_LOCK_FREE
+# define ATOMIC_POINTER_LOCK_FREE   __GCC_ATOMIC_POINTER_LOCK_FREE
+#endif
+
+template <class _Tp>
+struct __libcpp_is_always_lock_free {
+  // __atomic_always_lock_free is available in all Standard modes
+  static const bool __value = __atomic_always_lock_free(sizeof(_Tp), 0);
+};
+
+#ifdef _LIBCPP_ATOMIC_ONLY_USE_BUILTINS
+
+template<typename _Tp>
+struct __cxx_atomic_lock_impl {
+
+  _LIBCPP_INLINE_VISIBILITY
+  __cxx_atomic_lock_impl() _NOEXCEPT
+    : __a_value(), __a_lock(0) {}
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR explicit
+  __cxx_atomic_lock_impl(_Tp value) _NOEXCEPT
+    : __a_value(value), __a_lock(0) {}
+
+  _Tp __a_value;
+  mutable __cxx_atomic_base_impl<_LIBCPP_ATOMIC_FLAG_TYPE> __a_lock;
+
+  _LIBCPP_INLINE_VISIBILITY void __lock() const volatile {
+    while(1 == __cxx_atomic_exchange(&__a_lock, _LIBCPP_ATOMIC_FLAG_TYPE(true), memory_order_acquire))
+        /*spin*/;
+  }
+  _LIBCPP_INLINE_VISIBILITY void __lock() const {
+    while(1 == __cxx_atomic_exchange(&__a_lock, _LIBCPP_ATOMIC_FLAG_TYPE(true), memory_order_acquire))
+        /*spin*/;
+  }
+  _LIBCPP_INLINE_VISIBILITY void __unlock() const volatile {
+    __cxx_atomic_store(&__a_lock, _LIBCPP_ATOMIC_FLAG_TYPE(false), memory_order_release);
+  }
+  _LIBCPP_INLINE_VISIBILITY void __unlock() const {
+    __cxx_atomic_store(&__a_lock, _LIBCPP_ATOMIC_FLAG_TYPE(false), memory_order_release);
+  }
+  _LIBCPP_INLINE_VISIBILITY _Tp __read() const volatile {
+    __lock();
+    _Tp __old;
+    __cxx_atomic_assign_volatile(__old, __a_value);
+    __unlock();
+    return __old;
+  }
+  _LIBCPP_INLINE_VISIBILITY _Tp __read() const {
+    __lock();
+    _Tp __old = __a_value;
+    __unlock();
+    return __old;
+  }
+};
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void __cxx_atomic_init(volatile __cxx_atomic_lock_impl<_Tp>* __a,  _Tp __val) {
+  __cxx_atomic_assign_volatile(__a->__a_value, __val);
+}
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void __cxx_atomic_init(__cxx_atomic_lock_impl<_Tp>* __a,  _Tp __val) {
+  __a->__a_value = __val;
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void __cxx_atomic_store(volatile __cxx_atomic_lock_impl<_Tp>* __a,  _Tp __val, memory_order) {
+  __a->__lock();
+  __cxx_atomic_assign_volatile(__a->__a_value, __val);
+  __a->__unlock();
+}
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void __cxx_atomic_store(__cxx_atomic_lock_impl<_Tp>* __a,  _Tp __val, memory_order) {
+  __a->__lock();
+  __a->__a_value = __val;
+  __a->__unlock();
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_load(const volatile __cxx_atomic_lock_impl<_Tp>* __a, memory_order) {
+  return __a->__read();
+}
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_load(const __cxx_atomic_lock_impl<_Tp>* __a, memory_order) {
+  return __a->__read();
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_exchange(volatile __cxx_atomic_lock_impl<_Tp>* __a, _Tp __value, memory_order) {
+  __a->__lock();
+  _Tp __old;
+  __cxx_atomic_assign_volatile(__old, __a->__a_value);
+  __cxx_atomic_assign_volatile(__a->__a_value, __value);
+  __a->__unlock();
+  return __old;
+}
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_exchange(__cxx_atomic_lock_impl<_Tp>* __a, _Tp __value, memory_order) {
+  __a->__lock();
+  _Tp __old = __a->__a_value;
+  __a->__a_value = __value;
+  __a->__unlock();
+  return __old;
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool __cxx_atomic_compare_exchange_strong(volatile __cxx_atomic_lock_impl<_Tp>* __a,
+                                          _Tp* __expected, _Tp __value, memory_order, memory_order) {
+  _Tp __temp;
+  __a->__lock();
+  __cxx_atomic_assign_volatile(__temp, __a->__a_value);
+  bool __ret = (_VSTD::memcmp(&__temp, __expected, sizeof(_Tp)) == 0);
+  if(__ret)
+    __cxx_atomic_assign_volatile(__a->__a_value, __value);
+  else
+    __cxx_atomic_assign_volatile(*__expected, __a->__a_value);
+  __a->__unlock();
+  return __ret;
+}
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool __cxx_atomic_compare_exchange_strong(__cxx_atomic_lock_impl<_Tp>* __a,
+                                          _Tp* __expected, _Tp __value, memory_order, memory_order) {
+  __a->__lock();
+  bool __ret = (_VSTD::memcmp(&__a->__a_value, __expected, sizeof(_Tp)) == 0);
+  if(__ret)
+    _VSTD::memcpy(&__a->__a_value, &__value, sizeof(_Tp));
+  else
+    _VSTD::memcpy(__expected, &__a->__a_value, sizeof(_Tp));
+  __a->__unlock();
+  return __ret;
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool __cxx_atomic_compare_exchange_weak(volatile __cxx_atomic_lock_impl<_Tp>* __a,
+                                        _Tp* __expected, _Tp __value, memory_order, memory_order) {
+  _Tp __temp;
+  __a->__lock();
+  __cxx_atomic_assign_volatile(__temp, __a->__a_value);
+  bool __ret = (_VSTD::memcmp(&__temp, __expected, sizeof(_Tp)) == 0);
+  if(__ret)
+    __cxx_atomic_assign_volatile(__a->__a_value, __value);
+  else
+    __cxx_atomic_assign_volatile(*__expected, __a->__a_value);
+  __a->__unlock();
+  return __ret;
+}
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool __cxx_atomic_compare_exchange_weak(__cxx_atomic_lock_impl<_Tp>* __a,
+                                        _Tp* __expected, _Tp __value, memory_order, memory_order) {
+  __a->__lock();
+  bool __ret = (_VSTD::memcmp(&__a->__a_value, __expected, sizeof(_Tp)) == 0);
+  if(__ret)
+    _VSTD::memcpy(&__a->__a_value, &__value, sizeof(_Tp));
+  else
+    _VSTD::memcpy(__expected, &__a->__a_value, sizeof(_Tp));
+  __a->__unlock();
+  return __ret;
+}
+
+template <typename _Tp, typename _Td>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_add(volatile __cxx_atomic_lock_impl<_Tp>* __a,
+                           _Td __delta, memory_order) {
+  __a->__lock();
+  _Tp __old;
+  __cxx_atomic_assign_volatile(__old, __a->__a_value);
+  __cxx_atomic_assign_volatile(__a->__a_value, _Tp(__old + __delta));
+  __a->__unlock();
+  return __old;
+}
+template <typename _Tp, typename _Td>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_add(__cxx_atomic_lock_impl<_Tp>* __a,
+                           _Td __delta, memory_order) {
+  __a->__lock();
+  _Tp __old = __a->__a_value;
+  __a->__a_value += __delta;
+  __a->__unlock();
+  return __old;
+}
+
+template <typename _Tp, typename _Td>
+_LIBCPP_INLINE_VISIBILITY
+_Tp* __cxx_atomic_fetch_add(volatile __cxx_atomic_lock_impl<_Tp*>* __a,
+                           ptrdiff_t __delta, memory_order) {
+  __a->__lock();
+  _Tp* __old;
+  __cxx_atomic_assign_volatile(__old, __a->__a_value);
+  __cxx_atomic_assign_volatile(__a->__a_value, __old + __delta);
+  __a->__unlock();
+  return __old;
+}
+template <typename _Tp, typename _Td>
+_LIBCPP_INLINE_VISIBILITY
+_Tp* __cxx_atomic_fetch_add(__cxx_atomic_lock_impl<_Tp*>* __a,
+                           ptrdiff_t __delta, memory_order) {
+  __a->__lock();
+  _Tp* __old = __a->__a_value;
+  __a->__a_value += __delta;
+  __a->__unlock();
+  return __old;
+}
+
+template <typename _Tp, typename _Td>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_sub(volatile __cxx_atomic_lock_impl<_Tp>* __a,
+                           _Td __delta, memory_order) {
+  __a->__lock();
+  _Tp __old;
+  __cxx_atomic_assign_volatile(__old, __a->__a_value);
+  __cxx_atomic_assign_volatile(__a->__a_value, _Tp(__old - __delta));
+  __a->__unlock();
+  return __old;
+}
+template <typename _Tp, typename _Td>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_sub(__cxx_atomic_lock_impl<_Tp>* __a,
+                           _Td __delta, memory_order) {
+  __a->__lock();
+  _Tp __old = __a->__a_value;
+  __a->__a_value -= __delta;
+  __a->__unlock();
+  return __old;
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_and(volatile __cxx_atomic_lock_impl<_Tp>* __a,
+                           _Tp __pattern, memory_order) {
+  __a->__lock();
+  _Tp __old;
+  __cxx_atomic_assign_volatile(__old, __a->__a_value);
+  __cxx_atomic_assign_volatile(__a->__a_value, _Tp(__old & __pattern));
+  __a->__unlock();
+  return __old;
+}
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_and(__cxx_atomic_lock_impl<_Tp>* __a,
+                           _Tp __pattern, memory_order) {
+  __a->__lock();
+  _Tp __old = __a->__a_value;
+  __a->__a_value &= __pattern;
+  __a->__unlock();
+  return __old;
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_or(volatile __cxx_atomic_lock_impl<_Tp>* __a,
+                          _Tp __pattern, memory_order) {
+  __a->__lock();
+  _Tp __old;
+  __cxx_atomic_assign_volatile(__old, __a->__a_value);
+  __cxx_atomic_assign_volatile(__a->__a_value, _Tp(__old | __pattern));
+  __a->__unlock();
+  return __old;
+}
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_or(__cxx_atomic_lock_impl<_Tp>* __a,
+                          _Tp __pattern, memory_order) {
+  __a->__lock();
+  _Tp __old = __a->__a_value;
+  __a->__a_value |= __pattern;
+  __a->__unlock();
+  return __old;
+}
+
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_xor(volatile __cxx_atomic_lock_impl<_Tp>* __a,
+                           _Tp __pattern, memory_order) {
+  __a->__lock();
+  _Tp __old;
+  __cxx_atomic_assign_volatile(__old, __a->__a_value);
+  __cxx_atomic_assign_volatile(__a->__a_value, _Tp(__old ^ __pattern));
+  __a->__unlock();
+  return __old;
+}
+template <typename _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __cxx_atomic_fetch_xor(__cxx_atomic_lock_impl<_Tp>* __a,
+                           _Tp __pattern, memory_order) {
+  __a->__lock();
+  _Tp __old = __a->__a_value;
+  __a->__a_value ^= __pattern;
+  __a->__unlock();
+  return __old;
+}
+
+template <typename _Tp,
+          typename _Base = typename conditional<__libcpp_is_always_lock_free<_Tp>::__value,
+                                                __cxx_atomic_base_impl<_Tp>,
+                                                __cxx_atomic_lock_impl<_Tp> >::type>
+#else
+template <typename _Tp,
+          typename _Base = __cxx_atomic_base_impl<_Tp> >
+#endif //_LIBCPP_ATOMIC_ONLY_USE_BUILTINS
+struct __cxx_atomic_impl : public _Base {
+    static_assert(is_trivially_copyable<_Tp>::value,
+      "std::atomic<T> requires that 'T' be a trivially copyable type");
+
+  _LIBCPP_INLINE_VISIBILITY __cxx_atomic_impl() _NOEXCEPT = default;
+  _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR explicit __cxx_atomic_impl(_Tp __value) _NOEXCEPT
+    : _Base(__value) {}
+};
+
+#if defined(__linux__) || (defined(_AIX) && !defined(__64BIT__))
+    using __cxx_contention_t = int32_t;
+#else
+    using __cxx_contention_t = int64_t;
+#endif // __linux__ || (_AIX && !__64BIT__)
+
+using __cxx_atomic_contention_t = __cxx_atomic_impl<__cxx_contention_t>;
+
+#ifndef _LIBCPP_HAS_NO_THREADS
+
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_EXPORTED_FROM_ABI void __cxx_atomic_notify_one(void const volatile*);
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_EXPORTED_FROM_ABI void __cxx_atomic_notify_all(void const volatile*);
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_EXPORTED_FROM_ABI __cxx_contention_t __libcpp_atomic_monitor(void const volatile*);
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_EXPORTED_FROM_ABI void __libcpp_atomic_wait(void const volatile*, __cxx_contention_t);
+
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_EXPORTED_FROM_ABI void __cxx_atomic_notify_one(__cxx_atomic_contention_t const volatile*);
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_EXPORTED_FROM_ABI void __cxx_atomic_notify_all(__cxx_atomic_contention_t const volatile*);
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_EXPORTED_FROM_ABI __cxx_contention_t __libcpp_atomic_monitor(__cxx_atomic_contention_t const volatile*);
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_EXPORTED_FROM_ABI void __libcpp_atomic_wait(__cxx_atomic_contention_t const volatile*, __cxx_contention_t);
+
+template <class _Atp, class _Fn>
+struct __libcpp_atomic_wait_backoff_impl {
+    _Atp* __a;
+    _Fn __test_fn;
+    _LIBCPP_AVAILABILITY_SYNC
+    _LIBCPP_INLINE_VISIBILITY bool operator()(chrono::nanoseconds __elapsed) const
+    {
+        if(__elapsed > chrono::microseconds(64))
+        {
+            auto const __monitor = std::__libcpp_atomic_monitor(__a);
+            if(__test_fn())
+                return true;
+            std::__libcpp_atomic_wait(__a, __monitor);
+        }
+        else if(__elapsed > chrono::microseconds(4))
+            __libcpp_thread_yield();
+        else
+            {} // poll
+        return false;
+    }
+};
+
+template <class _Atp, class _Fn>
+_LIBCPP_AVAILABILITY_SYNC
+_LIBCPP_INLINE_VISIBILITY bool __cxx_atomic_wait(_Atp* __a, _Fn && __test_fn)
+{
+    __libcpp_atomic_wait_backoff_impl<_Atp, typename decay<_Fn>::type> __backoff_fn = {__a, __test_fn};
+    return std::__libcpp_thread_poll_with_backoff(__test_fn, __backoff_fn);
+}
+
+#else // _LIBCPP_HAS_NO_THREADS
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY void __cxx_atomic_notify_all(__cxx_atomic_impl<_Tp> const volatile*) { }
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY void __cxx_atomic_notify_one(__cxx_atomic_impl<_Tp> const volatile*) { }
+template <class _Atp, class _Fn>
+_LIBCPP_INLINE_VISIBILITY bool __cxx_atomic_wait(_Atp*, _Fn && __test_fn)
+{
+    return __libcpp_thread_poll_with_backoff(__test_fn, __spinning_backoff_policy());
+}
+
+#endif // _LIBCPP_HAS_NO_THREADS
+
+template <class _Atp, class _Tp>
+struct __cxx_atomic_wait_test_fn_impl {
+    _Atp* __a;
+    _Tp __val;
+    memory_order __order;
+    _LIBCPP_INLINE_VISIBILITY bool operator()() const
+    {
+        return !std::__cxx_nonatomic_compare_equal(std::__cxx_atomic_load(__a, __order), __val);
+    }
+};
+
+template <class _Atp, class _Tp>
+_LIBCPP_AVAILABILITY_SYNC
+_LIBCPP_INLINE_VISIBILITY bool __cxx_atomic_wait(_Atp* __a, _Tp const __val, memory_order __order)
+{
+    __cxx_atomic_wait_test_fn_impl<_Atp, _Tp> __test_fn = {__a, __val, __order};
+    return std::__cxx_atomic_wait(__a, __test_fn);
+}
+
+// general atomic<T>
+
+template <class _Tp, bool = is_integral<_Tp>::value && !is_same<_Tp, bool>::value>
+struct __atomic_base  // false
+{
+    mutable __cxx_atomic_impl<_Tp> __a_;
+
+#if defined(__cpp_lib_atomic_is_always_lock_free)
+  static _LIBCPP_CONSTEXPR bool is_always_lock_free = __libcpp_is_always_lock_free<__cxx_atomic_impl<_Tp> >::__value;
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool is_lock_free() const volatile _NOEXCEPT
+        {return __cxx_atomic_is_lock_free(sizeof(_Tp));}
+    _LIBCPP_INLINE_VISIBILITY
+    bool is_lock_free() const _NOEXCEPT
+        {return static_cast<__atomic_base const volatile*>(this)->is_lock_free();}
+    _LIBCPP_INLINE_VISIBILITY
+    void store(_Tp __d, memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT
+      _LIBCPP_CHECK_STORE_MEMORY_ORDER(__m)
+        {std::__cxx_atomic_store(&__a_, __d, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    void store(_Tp __d, memory_order __m = memory_order_seq_cst) _NOEXCEPT
+      _LIBCPP_CHECK_STORE_MEMORY_ORDER(__m)
+        {std::__cxx_atomic_store(&__a_, __d, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp load(memory_order __m = memory_order_seq_cst) const volatile _NOEXCEPT
+      _LIBCPP_CHECK_LOAD_MEMORY_ORDER(__m)
+        {return std::__cxx_atomic_load(&__a_, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp load(memory_order __m = memory_order_seq_cst) const _NOEXCEPT
+      _LIBCPP_CHECK_LOAD_MEMORY_ORDER(__m)
+        {return std::__cxx_atomic_load(&__a_, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    operator _Tp() const volatile _NOEXCEPT {return load();}
+    _LIBCPP_INLINE_VISIBILITY
+    operator _Tp() const _NOEXCEPT          {return load();}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp exchange(_Tp __d, memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT
+        {return std::__cxx_atomic_exchange(&__a_, __d, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp exchange(_Tp __d, memory_order __m = memory_order_seq_cst) _NOEXCEPT
+        {return std::__cxx_atomic_exchange(&__a_, __d, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool compare_exchange_weak(_Tp& __e, _Tp __d,
+                               memory_order __s, memory_order __f) volatile _NOEXCEPT
+      _LIBCPP_CHECK_EXCHANGE_MEMORY_ORDER(__s, __f)
+        {return std::__cxx_atomic_compare_exchange_weak(&__a_, &__e, __d, __s, __f);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool compare_exchange_weak(_Tp& __e, _Tp __d,
+                               memory_order __s, memory_order __f) _NOEXCEPT
+      _LIBCPP_CHECK_EXCHANGE_MEMORY_ORDER(__s, __f)
+        {return std::__cxx_atomic_compare_exchange_weak(&__a_, &__e, __d, __s, __f);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool compare_exchange_strong(_Tp& __e, _Tp __d,
+                                 memory_order __s, memory_order __f) volatile _NOEXCEPT
+      _LIBCPP_CHECK_EXCHANGE_MEMORY_ORDER(__s, __f)
+        {return std::__cxx_atomic_compare_exchange_strong(&__a_, &__e, __d, __s, __f);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool compare_exchange_strong(_Tp& __e, _Tp __d,
+                                 memory_order __s, memory_order __f) _NOEXCEPT
+      _LIBCPP_CHECK_EXCHANGE_MEMORY_ORDER(__s, __f)
+        {return std::__cxx_atomic_compare_exchange_strong(&__a_, &__e, __d, __s, __f);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool compare_exchange_weak(_Tp& __e, _Tp __d,
+                              memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT
+        {return std::__cxx_atomic_compare_exchange_weak(&__a_, &__e, __d, __m, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool compare_exchange_weak(_Tp& __e, _Tp __d,
+                               memory_order __m = memory_order_seq_cst) _NOEXCEPT
+        {return std::__cxx_atomic_compare_exchange_weak(&__a_, &__e, __d, __m, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool compare_exchange_strong(_Tp& __e, _Tp __d,
+                              memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT
+        {return std::__cxx_atomic_compare_exchange_strong(&__a_, &__e, __d, __m, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool compare_exchange_strong(_Tp& __e, _Tp __d,
+                                 memory_order __m = memory_order_seq_cst) _NOEXCEPT
+        {return std::__cxx_atomic_compare_exchange_strong(&__a_, &__e, __d, __m, __m);}
+
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY void wait(_Tp __v, memory_order __m = memory_order_seq_cst) const volatile _NOEXCEPT
+        {std::__cxx_atomic_wait(&__a_, __v, __m);}
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY void wait(_Tp __v, memory_order __m = memory_order_seq_cst) const _NOEXCEPT
+        {std::__cxx_atomic_wait(&__a_, __v, __m);}
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY void notify_one() volatile _NOEXCEPT
+        {std::__cxx_atomic_notify_one(&__a_);}
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY void notify_one() _NOEXCEPT
+        {std::__cxx_atomic_notify_one(&__a_);}
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY void notify_all() volatile _NOEXCEPT
+        {std::__cxx_atomic_notify_all(&__a_);}
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY void notify_all() _NOEXCEPT
+        {std::__cxx_atomic_notify_all(&__a_);}
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY constexpr
+    __atomic_base() noexcept(is_nothrow_default_constructible_v<_Tp>) : __a_(_Tp()) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    __atomic_base() _NOEXCEPT = default;
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    __atomic_base(_Tp __d) _NOEXCEPT : __a_(__d) {}
+
+    __atomic_base(const __atomic_base&) = delete;
+};
+
+#if defined(__cpp_lib_atomic_is_always_lock_free)
+template <class _Tp, bool __b>
+_LIBCPP_CONSTEXPR bool __atomic_base<_Tp, __b>::is_always_lock_free;
+#endif
+
+// atomic<Integral>
+
+template <class _Tp>
+struct __atomic_base<_Tp, true>
+    : public __atomic_base<_Tp, false>
+{
+    typedef __atomic_base<_Tp, false> __base;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __atomic_base() _NOEXCEPT = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR __atomic_base(_Tp __d) _NOEXCEPT : __base(__d) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp fetch_add(_Tp __op, memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT
+        {return std::__cxx_atomic_fetch_add(&this->__a_, __op, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp fetch_add(_Tp __op, memory_order __m = memory_order_seq_cst) _NOEXCEPT
+        {return std::__cxx_atomic_fetch_add(&this->__a_, __op, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp fetch_sub(_Tp __op, memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT
+        {return std::__cxx_atomic_fetch_sub(&this->__a_, __op, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp fetch_sub(_Tp __op, memory_order __m = memory_order_seq_cst) _NOEXCEPT
+        {return std::__cxx_atomic_fetch_sub(&this->__a_, __op, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp fetch_and(_Tp __op, memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT
+        {return std::__cxx_atomic_fetch_and(&this->__a_, __op, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp fetch_and(_Tp __op, memory_order __m = memory_order_seq_cst) _NOEXCEPT
+        {return std::__cxx_atomic_fetch_and(&this->__a_, __op, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp fetch_or(_Tp __op, memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT
+        {return std::__cxx_atomic_fetch_or(&this->__a_, __op, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp fetch_or(_Tp __op, memory_order __m = memory_order_seq_cst) _NOEXCEPT
+        {return std::__cxx_atomic_fetch_or(&this->__a_, __op, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp fetch_xor(_Tp __op, memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT
+        {return std::__cxx_atomic_fetch_xor(&this->__a_, __op, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp fetch_xor(_Tp __op, memory_order __m = memory_order_seq_cst) _NOEXCEPT
+        {return std::__cxx_atomic_fetch_xor(&this->__a_, __op, __m);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator++(int) volatile _NOEXCEPT      {return fetch_add(_Tp(1));}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator++(int) _NOEXCEPT               {return fetch_add(_Tp(1));}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator--(int) volatile _NOEXCEPT      {return fetch_sub(_Tp(1));}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator--(int) _NOEXCEPT               {return fetch_sub(_Tp(1));}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator++() volatile _NOEXCEPT         {return fetch_add(_Tp(1)) + _Tp(1);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator++() _NOEXCEPT                  {return fetch_add(_Tp(1)) + _Tp(1);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator--() volatile _NOEXCEPT         {return fetch_sub(_Tp(1)) - _Tp(1);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator--() _NOEXCEPT                  {return fetch_sub(_Tp(1)) - _Tp(1);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator+=(_Tp __op) volatile _NOEXCEPT {return fetch_add(__op) + __op;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator+=(_Tp __op) _NOEXCEPT          {return fetch_add(__op) + __op;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator-=(_Tp __op) volatile _NOEXCEPT {return fetch_sub(__op) - __op;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator-=(_Tp __op) _NOEXCEPT          {return fetch_sub(__op) - __op;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator&=(_Tp __op) volatile _NOEXCEPT {return fetch_and(__op) & __op;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator&=(_Tp __op) _NOEXCEPT          {return fetch_and(__op) & __op;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator|=(_Tp __op) volatile _NOEXCEPT {return fetch_or(__op) | __op;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator|=(_Tp __op) _NOEXCEPT          {return fetch_or(__op) | __op;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator^=(_Tp __op) volatile _NOEXCEPT {return fetch_xor(__op) ^ __op;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator^=(_Tp __op) _NOEXCEPT          {return fetch_xor(__op) ^ __op;}
+};
+
+// atomic<T>
+
+template <class _Tp>
+struct atomic
+    : public __atomic_base<_Tp>
+{
+    typedef __atomic_base<_Tp> __base;
+    typedef _Tp value_type;
+    typedef value_type difference_type;
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY
+    atomic() = default;
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    atomic() _NOEXCEPT = default;
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR atomic(_Tp __d) _NOEXCEPT : __base(__d) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator=(_Tp __d) volatile _NOEXCEPT
+        {__base::store(__d); return __d;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator=(_Tp __d) _NOEXCEPT
+        {__base::store(__d); return __d;}
+
+    atomic& operator=(const atomic&) = delete;
+    atomic& operator=(const atomic&) volatile = delete;
+};
+
+// atomic<T*>
+
+template <class _Tp>
+struct atomic<_Tp*>
+    : public __atomic_base<_Tp*>
+{
+    typedef __atomic_base<_Tp*> __base;
+    typedef _Tp* value_type;
+    typedef ptrdiff_t difference_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    atomic() _NOEXCEPT = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR atomic(_Tp* __d) _NOEXCEPT : __base(__d) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator=(_Tp* __d) volatile _NOEXCEPT
+        {__base::store(__d); return __d;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator=(_Tp* __d) _NOEXCEPT
+        {__base::store(__d); return __d;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* fetch_add(ptrdiff_t __op, memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT {
+        // __atomic_fetch_add accepts function pointers, guard against them.
+        static_assert(!is_function<__remove_pointer_t<_Tp> >::value, "Pointer to function isn't allowed");
+        return std::__cxx_atomic_fetch_add(&this->__a_, __op, __m);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* fetch_add(ptrdiff_t __op, memory_order __m = memory_order_seq_cst) _NOEXCEPT {
+        // __atomic_fetch_add accepts function pointers, guard against them.
+        static_assert(!is_function<__remove_pointer_t<_Tp> >::value, "Pointer to function isn't allowed");
+        return std::__cxx_atomic_fetch_add(&this->__a_, __op, __m);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* fetch_sub(ptrdiff_t __op, memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT {
+        // __atomic_fetch_add accepts function pointers, guard against them.
+        static_assert(!is_function<__remove_pointer_t<_Tp> >::value, "Pointer to function isn't allowed");
+        return std::__cxx_atomic_fetch_sub(&this->__a_, __op, __m);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* fetch_sub(ptrdiff_t __op, memory_order __m = memory_order_seq_cst) _NOEXCEPT {
+        // __atomic_fetch_add accepts function pointers, guard against them.
+        static_assert(!is_function<__remove_pointer_t<_Tp> >::value, "Pointer to function isn't allowed");
+        return std::__cxx_atomic_fetch_sub(&this->__a_, __op, __m);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator++(int) volatile _NOEXCEPT            {return fetch_add(1);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator++(int) _NOEXCEPT                     {return fetch_add(1);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator--(int) volatile _NOEXCEPT            {return fetch_sub(1);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator--(int) _NOEXCEPT                     {return fetch_sub(1);}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator++() volatile _NOEXCEPT               {return fetch_add(1) + 1;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator++() _NOEXCEPT                        {return fetch_add(1) + 1;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator--() volatile _NOEXCEPT               {return fetch_sub(1) - 1;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator--() _NOEXCEPT                        {return fetch_sub(1) - 1;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator+=(ptrdiff_t __op) volatile _NOEXCEPT {return fetch_add(__op) + __op;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator+=(ptrdiff_t __op) _NOEXCEPT          {return fetch_add(__op) + __op;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator-=(ptrdiff_t __op) volatile _NOEXCEPT {return fetch_sub(__op) - __op;}
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp* operator-=(ptrdiff_t __op) _NOEXCEPT          {return fetch_sub(__op) - __op;}
+
+    atomic& operator=(const atomic&) = delete;
+    atomic& operator=(const atomic&) volatile = delete;
+};
+
+// atomic_is_lock_free
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool
+atomic_is_lock_free(const volatile atomic<_Tp>* __o) _NOEXCEPT
+{
+    return __o->is_lock_free();
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool
+atomic_is_lock_free(const atomic<_Tp>* __o) _NOEXCEPT
+{
+    return __o->is_lock_free();
+}
+
+// atomic_init
+
+template <class _Tp>
+_LIBCPP_DEPRECATED_IN_CXX20 _LIBCPP_INLINE_VISIBILITY
+void
+atomic_init(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type __d) _NOEXCEPT
+{
+    std::__cxx_atomic_init(&__o->__a_, __d);
+}
+
+template <class _Tp>
+_LIBCPP_DEPRECATED_IN_CXX20 _LIBCPP_INLINE_VISIBILITY
+void
+atomic_init(atomic<_Tp>* __o, typename atomic<_Tp>::value_type __d) _NOEXCEPT
+{
+    std::__cxx_atomic_init(&__o->__a_, __d);
+}
+
+// atomic_store
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void
+atomic_store(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type __d) _NOEXCEPT
+{
+    __o->store(__d);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void
+atomic_store(atomic<_Tp>* __o, typename atomic<_Tp>::value_type __d) _NOEXCEPT
+{
+    __o->store(__d);
+}
+
+// atomic_store_explicit
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void
+atomic_store_explicit(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type __d, memory_order __m) _NOEXCEPT
+  _LIBCPP_CHECK_STORE_MEMORY_ORDER(__m)
+{
+    __o->store(__d, __m);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+void
+atomic_store_explicit(atomic<_Tp>* __o, typename atomic<_Tp>::value_type __d, memory_order __m) _NOEXCEPT
+  _LIBCPP_CHECK_STORE_MEMORY_ORDER(__m)
+{
+    __o->store(__d, __m);
+}
+
+// atomic_load
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp
+atomic_load(const volatile atomic<_Tp>* __o) _NOEXCEPT
+{
+    return __o->load();
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp
+atomic_load(const atomic<_Tp>* __o) _NOEXCEPT
+{
+    return __o->load();
+}
+
+// atomic_load_explicit
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp
+atomic_load_explicit(const volatile atomic<_Tp>* __o, memory_order __m) _NOEXCEPT
+  _LIBCPP_CHECK_LOAD_MEMORY_ORDER(__m)
+{
+    return __o->load(__m);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp
+atomic_load_explicit(const atomic<_Tp>* __o, memory_order __m) _NOEXCEPT
+  _LIBCPP_CHECK_LOAD_MEMORY_ORDER(__m)
+{
+    return __o->load(__m);
+}
+
+// atomic_exchange
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp
+atomic_exchange(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type __d) _NOEXCEPT
+{
+    return __o->exchange(__d);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp
+atomic_exchange(atomic<_Tp>* __o, typename atomic<_Tp>::value_type __d) _NOEXCEPT
+{
+    return __o->exchange(__d);
+}
+
+// atomic_exchange_explicit
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp
+atomic_exchange_explicit(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type __d, memory_order __m) _NOEXCEPT
+{
+    return __o->exchange(__d, __m);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp
+atomic_exchange_explicit(atomic<_Tp>* __o, typename atomic<_Tp>::value_type __d, memory_order __m) _NOEXCEPT
+{
+    return __o->exchange(__d, __m);
+}
+
+// atomic_compare_exchange_weak
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool
+atomic_compare_exchange_weak(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type* __e, typename atomic<_Tp>::value_type __d) _NOEXCEPT
+{
+    return __o->compare_exchange_weak(*__e, __d);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool
+atomic_compare_exchange_weak(atomic<_Tp>* __o, typename atomic<_Tp>::value_type* __e, typename atomic<_Tp>::value_type __d) _NOEXCEPT
+{
+    return __o->compare_exchange_weak(*__e, __d);
+}
+
+// atomic_compare_exchange_strong
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool
+atomic_compare_exchange_strong(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type* __e, typename atomic<_Tp>::value_type __d) _NOEXCEPT
+{
+    return __o->compare_exchange_strong(*__e, __d);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool
+atomic_compare_exchange_strong(atomic<_Tp>* __o, typename atomic<_Tp>::value_type* __e, typename atomic<_Tp>::value_type __d) _NOEXCEPT
+{
+    return __o->compare_exchange_strong(*__e, __d);
+}
+
+// atomic_compare_exchange_weak_explicit
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool
+atomic_compare_exchange_weak_explicit(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type* __e,
+                                      typename atomic<_Tp>::value_type __d,
+                                      memory_order __s, memory_order __f) _NOEXCEPT
+  _LIBCPP_CHECK_EXCHANGE_MEMORY_ORDER(__s, __f)
+{
+    return __o->compare_exchange_weak(*__e, __d, __s, __f);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool
+atomic_compare_exchange_weak_explicit(atomic<_Tp>* __o, typename atomic<_Tp>::value_type* __e, typename atomic<_Tp>::value_type __d,
+                                      memory_order __s, memory_order __f) _NOEXCEPT
+  _LIBCPP_CHECK_EXCHANGE_MEMORY_ORDER(__s, __f)
+{
+    return __o->compare_exchange_weak(*__e, __d, __s, __f);
+}
+
+// atomic_compare_exchange_strong_explicit
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool
+atomic_compare_exchange_strong_explicit(volatile atomic<_Tp>* __o,
+                                        typename atomic<_Tp>::value_type* __e, typename atomic<_Tp>::value_type __d,
+                                        memory_order __s, memory_order __f) _NOEXCEPT
+  _LIBCPP_CHECK_EXCHANGE_MEMORY_ORDER(__s, __f)
+{
+    return __o->compare_exchange_strong(*__e, __d, __s, __f);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+bool
+atomic_compare_exchange_strong_explicit(atomic<_Tp>* __o, typename atomic<_Tp>::value_type* __e,
+                                        typename atomic<_Tp>::value_type __d,
+                                        memory_order __s, memory_order __f) _NOEXCEPT
+  _LIBCPP_CHECK_EXCHANGE_MEMORY_ORDER(__s, __f)
+{
+    return __o->compare_exchange_strong(*__e, __d, __s, __f);
+}
+
+// atomic_wait
+
+template <class _Tp>
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+void atomic_wait(const volatile atomic<_Tp>* __o,
+                 typename atomic<_Tp>::value_type __v) _NOEXCEPT
+{
+    return __o->wait(__v);
+}
+
+template <class _Tp>
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+void atomic_wait(const atomic<_Tp>* __o,
+                 typename atomic<_Tp>::value_type __v) _NOEXCEPT
+{
+    return __o->wait(__v);
+}
+
+// atomic_wait_explicit
+
+template <class _Tp>
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+void atomic_wait_explicit(const volatile atomic<_Tp>* __o,
+                          typename atomic<_Tp>::value_type __v,
+                          memory_order __m) _NOEXCEPT
+  _LIBCPP_CHECK_LOAD_MEMORY_ORDER(__m)
+{
+    return __o->wait(__v, __m);
+}
+
+template <class _Tp>
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+void atomic_wait_explicit(const atomic<_Tp>* __o,
+                          typename atomic<_Tp>::value_type __v,
+                          memory_order __m) _NOEXCEPT
+  _LIBCPP_CHECK_LOAD_MEMORY_ORDER(__m)
+{
+    return __o->wait(__v, __m);
+}
+
+// atomic_notify_one
+
+template <class _Tp>
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+void atomic_notify_one(volatile atomic<_Tp>* __o) _NOEXCEPT
+{
+    __o->notify_one();
+}
+template <class _Tp>
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+void atomic_notify_one(atomic<_Tp>* __o) _NOEXCEPT
+{
+    __o->notify_one();
+}
+
+// atomic_notify_all
+
+template <class _Tp>
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+void atomic_notify_all(volatile atomic<_Tp>* __o) _NOEXCEPT
+{
+    __o->notify_all();
+}
+template <class _Tp>
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+void atomic_notify_all(atomic<_Tp>* __o) _NOEXCEPT
+{
+    __o->notify_all();
+}
+
+// atomic_fetch_add
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp
+atomic_fetch_add(volatile atomic<_Tp>* __o, typename atomic<_Tp>::difference_type __op) _NOEXCEPT
+{
+    return __o->fetch_add(__op);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp
+atomic_fetch_add(atomic<_Tp>* __o, typename atomic<_Tp>::difference_type __op) _NOEXCEPT
+{
+    return __o->fetch_add(__op);
+}
+
+// atomic_fetch_add_explicit
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp atomic_fetch_add_explicit(volatile atomic<_Tp>* __o, typename atomic<_Tp>::difference_type __op, memory_order __m) _NOEXCEPT
+{
+    return __o->fetch_add(__op, __m);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp atomic_fetch_add_explicit(atomic<_Tp>* __o, typename atomic<_Tp>::difference_type __op, memory_order __m) _NOEXCEPT
+{
+    return __o->fetch_add(__op, __m);
+}
+
+// atomic_fetch_sub
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp atomic_fetch_sub(volatile atomic<_Tp>* __o, typename atomic<_Tp>::difference_type __op) _NOEXCEPT
+{
+    return __o->fetch_sub(__op);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp atomic_fetch_sub(atomic<_Tp>* __o, typename atomic<_Tp>::difference_type __op) _NOEXCEPT
+{
+    return __o->fetch_sub(__op);
+}
+
+// atomic_fetch_sub_explicit
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp atomic_fetch_sub_explicit(volatile atomic<_Tp>* __o, typename atomic<_Tp>::difference_type __op, memory_order __m) _NOEXCEPT
+{
+    return __o->fetch_sub(__op, __m);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp atomic_fetch_sub_explicit(atomic<_Tp>* __o, typename atomic<_Tp>::difference_type __op, memory_order __m) _NOEXCEPT
+{
+    return __o->fetch_sub(__op, __m);
+}
+
+// atomic_fetch_and
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value && !is_same<_Tp, bool>::value,
+    _Tp
+>::type
+atomic_fetch_and(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type __op) _NOEXCEPT
+{
+    return __o->fetch_and(__op);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value && !is_same<_Tp, bool>::value,
+    _Tp
+>::type
+atomic_fetch_and(atomic<_Tp>* __o, typename atomic<_Tp>::value_type __op) _NOEXCEPT
+{
+    return __o->fetch_and(__op);
+}
+
+// atomic_fetch_and_explicit
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value && !is_same<_Tp, bool>::value,
+    _Tp
+>::type
+atomic_fetch_and_explicit(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type __op, memory_order __m) _NOEXCEPT
+{
+    return __o->fetch_and(__op, __m);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value && !is_same<_Tp, bool>::value,
+    _Tp
+>::type
+atomic_fetch_and_explicit(atomic<_Tp>* __o, typename atomic<_Tp>::value_type __op, memory_order __m) _NOEXCEPT
+{
+    return __o->fetch_and(__op, __m);
+}
+
+// atomic_fetch_or
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value && !is_same<_Tp, bool>::value,
+    _Tp
+>::type
+atomic_fetch_or(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type __op) _NOEXCEPT
+{
+    return __o->fetch_or(__op);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value && !is_same<_Tp, bool>::value,
+    _Tp
+>::type
+atomic_fetch_or(atomic<_Tp>* __o, typename atomic<_Tp>::value_type __op) _NOEXCEPT
+{
+    return __o->fetch_or(__op);
+}
+
+// atomic_fetch_or_explicit
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value && !is_same<_Tp, bool>::value,
+    _Tp
+>::type
+atomic_fetch_or_explicit(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type __op, memory_order __m) _NOEXCEPT
+{
+    return __o->fetch_or(__op, __m);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value && !is_same<_Tp, bool>::value,
+    _Tp
+>::type
+atomic_fetch_or_explicit(atomic<_Tp>* __o, typename atomic<_Tp>::value_type __op, memory_order __m) _NOEXCEPT
+{
+    return __o->fetch_or(__op, __m);
+}
+
+// atomic_fetch_xor
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value && !is_same<_Tp, bool>::value,
+    _Tp
+>::type
+atomic_fetch_xor(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type __op) _NOEXCEPT
+{
+    return __o->fetch_xor(__op);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value && !is_same<_Tp, bool>::value,
+    _Tp
+>::type
+atomic_fetch_xor(atomic<_Tp>* __o, typename atomic<_Tp>::value_type __op) _NOEXCEPT
+{
+    return __o->fetch_xor(__op);
+}
+
+// atomic_fetch_xor_explicit
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value && !is_same<_Tp, bool>::value,
+    _Tp
+>::type
+atomic_fetch_xor_explicit(volatile atomic<_Tp>* __o, typename atomic<_Tp>::value_type __op, memory_order __m) _NOEXCEPT
+{
+    return __o->fetch_xor(__op, __m);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value && !is_same<_Tp, bool>::value,
+    _Tp
+>::type
+atomic_fetch_xor_explicit(atomic<_Tp>* __o, typename atomic<_Tp>::value_type __op, memory_order __m) _NOEXCEPT
+{
+    return __o->fetch_xor(__op, __m);
+}
+
+// flag type and operations
+
+typedef struct atomic_flag
+{
+    __cxx_atomic_impl<_LIBCPP_ATOMIC_FLAG_TYPE> __a_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool test(memory_order __m = memory_order_seq_cst) const volatile _NOEXCEPT
+        {return _LIBCPP_ATOMIC_FLAG_TYPE(true) == __cxx_atomic_load(&__a_, __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool test(memory_order __m = memory_order_seq_cst) const _NOEXCEPT
+        {return _LIBCPP_ATOMIC_FLAG_TYPE(true) == __cxx_atomic_load(&__a_, __m);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool test_and_set(memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT
+        {return __cxx_atomic_exchange(&__a_, _LIBCPP_ATOMIC_FLAG_TYPE(true), __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool test_and_set(memory_order __m = memory_order_seq_cst) _NOEXCEPT
+        {return __cxx_atomic_exchange(&__a_, _LIBCPP_ATOMIC_FLAG_TYPE(true), __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear(memory_order __m = memory_order_seq_cst) volatile _NOEXCEPT
+        {__cxx_atomic_store(&__a_, _LIBCPP_ATOMIC_FLAG_TYPE(false), __m);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear(memory_order __m = memory_order_seq_cst) _NOEXCEPT
+        {__cxx_atomic_store(&__a_, _LIBCPP_ATOMIC_FLAG_TYPE(false), __m);}
+
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void wait(bool __v, memory_order __m = memory_order_seq_cst) const volatile _NOEXCEPT
+        {__cxx_atomic_wait(&__a_, _LIBCPP_ATOMIC_FLAG_TYPE(__v), __m);}
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void wait(bool __v, memory_order __m = memory_order_seq_cst) const _NOEXCEPT
+        {__cxx_atomic_wait(&__a_, _LIBCPP_ATOMIC_FLAG_TYPE(__v), __m);}
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void notify_one() volatile _NOEXCEPT
+        {__cxx_atomic_notify_one(&__a_);}
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void notify_one() _NOEXCEPT
+        {__cxx_atomic_notify_one(&__a_);}
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void notify_all() volatile _NOEXCEPT
+        {__cxx_atomic_notify_all(&__a_);}
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void notify_all() _NOEXCEPT
+        {__cxx_atomic_notify_all(&__a_);}
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY constexpr
+    atomic_flag() _NOEXCEPT : __a_(false) {}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    atomic_flag() _NOEXCEPT = default;
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    atomic_flag(bool __b) _NOEXCEPT : __a_(__b) {} // EXTENSION
+
+    atomic_flag(const atomic_flag&) = delete;
+    atomic_flag& operator=(const atomic_flag&) = delete;
+    atomic_flag& operator=(const atomic_flag&) volatile = delete;
+
+} atomic_flag;
+
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+atomic_flag_test(const volatile atomic_flag* __o) _NOEXCEPT
+{
+    return __o->test();
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+atomic_flag_test(const atomic_flag* __o) _NOEXCEPT
+{
+    return __o->test();
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+atomic_flag_test_explicit(const volatile atomic_flag* __o, memory_order __m) _NOEXCEPT
+{
+    return __o->test(__m);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+atomic_flag_test_explicit(const atomic_flag* __o, memory_order __m) _NOEXCEPT
+{
+    return __o->test(__m);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+atomic_flag_test_and_set(volatile atomic_flag* __o) _NOEXCEPT
+{
+    return __o->test_and_set();
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+atomic_flag_test_and_set(atomic_flag* __o) _NOEXCEPT
+{
+    return __o->test_and_set();
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+atomic_flag_test_and_set_explicit(volatile atomic_flag* __o, memory_order __m) _NOEXCEPT
+{
+    return __o->test_and_set(__m);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+atomic_flag_test_and_set_explicit(atomic_flag* __o, memory_order __m) _NOEXCEPT
+{
+    return __o->test_and_set(__m);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void
+atomic_flag_clear(volatile atomic_flag* __o) _NOEXCEPT
+{
+    __o->clear();
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void
+atomic_flag_clear(atomic_flag* __o) _NOEXCEPT
+{
+    __o->clear();
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void
+atomic_flag_clear_explicit(volatile atomic_flag* __o, memory_order __m) _NOEXCEPT
+{
+    __o->clear(__m);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void
+atomic_flag_clear_explicit(atomic_flag* __o, memory_order __m) _NOEXCEPT
+{
+    __o->clear(__m);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_AVAILABILITY_SYNC
+void
+atomic_flag_wait(const volatile atomic_flag* __o, bool __v) _NOEXCEPT
+{
+    __o->wait(__v);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_AVAILABILITY_SYNC
+void
+atomic_flag_wait(const atomic_flag* __o, bool __v) _NOEXCEPT
+{
+    __o->wait(__v);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_AVAILABILITY_SYNC
+void
+atomic_flag_wait_explicit(const volatile atomic_flag* __o,
+                          bool __v, memory_order __m) _NOEXCEPT
+{
+    __o->wait(__v, __m);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_AVAILABILITY_SYNC
+void
+atomic_flag_wait_explicit(const atomic_flag* __o,
+                          bool __v, memory_order __m) _NOEXCEPT
+{
+    __o->wait(__v, __m);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_AVAILABILITY_SYNC
+void
+atomic_flag_notify_one(volatile atomic_flag* __o) _NOEXCEPT
+{
+    __o->notify_one();
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_AVAILABILITY_SYNC
+void
+atomic_flag_notify_one(atomic_flag* __o) _NOEXCEPT
+{
+    __o->notify_one();
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_AVAILABILITY_SYNC
+void
+atomic_flag_notify_all(volatile atomic_flag* __o) _NOEXCEPT
+{
+    __o->notify_all();
+}
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_AVAILABILITY_SYNC
+void
+atomic_flag_notify_all(atomic_flag* __o) _NOEXCEPT
+{
+    __o->notify_all();
+}
+
+// fences
+
+inline _LIBCPP_INLINE_VISIBILITY
+void
+atomic_thread_fence(memory_order __m) _NOEXCEPT
+{
+    __cxx_atomic_thread_fence(__m);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void
+atomic_signal_fence(memory_order __m) _NOEXCEPT
+{
+    __cxx_atomic_signal_fence(__m);
+}
+
+// Atomics for standard typedef types
+
+typedef atomic<bool>               atomic_bool;
+typedef atomic<char>               atomic_char;
+typedef atomic<signed char>        atomic_schar;
+typedef atomic<unsigned char>      atomic_uchar;
+typedef atomic<short>              atomic_short;
+typedef atomic<unsigned short>     atomic_ushort;
+typedef atomic<int>                atomic_int;
+typedef atomic<unsigned int>       atomic_uint;
+typedef atomic<long>               atomic_long;
+typedef atomic<unsigned long>      atomic_ulong;
+typedef atomic<long long>          atomic_llong;
+typedef atomic<unsigned long long> atomic_ullong;
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+typedef atomic<char8_t>            atomic_char8_t;
+#endif
+typedef atomic<char16_t>           atomic_char16_t;
+typedef atomic<char32_t>           atomic_char32_t;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+typedef atomic<wchar_t>            atomic_wchar_t;
+#endif
+
+typedef atomic<int_least8_t>   atomic_int_least8_t;
+typedef atomic<uint_least8_t>  atomic_uint_least8_t;
+typedef atomic<int_least16_t>  atomic_int_least16_t;
+typedef atomic<uint_least16_t> atomic_uint_least16_t;
+typedef atomic<int_least32_t>  atomic_int_least32_t;
+typedef atomic<uint_least32_t> atomic_uint_least32_t;
+typedef atomic<int_least64_t>  atomic_int_least64_t;
+typedef atomic<uint_least64_t> atomic_uint_least64_t;
+
+typedef atomic<int_fast8_t>   atomic_int_fast8_t;
+typedef atomic<uint_fast8_t>  atomic_uint_fast8_t;
+typedef atomic<int_fast16_t>  atomic_int_fast16_t;
+typedef atomic<uint_fast16_t> atomic_uint_fast16_t;
+typedef atomic<int_fast32_t>  atomic_int_fast32_t;
+typedef atomic<uint_fast32_t> atomic_uint_fast32_t;
+typedef atomic<int_fast64_t>  atomic_int_fast64_t;
+typedef atomic<uint_fast64_t> atomic_uint_fast64_t;
+
+typedef atomic< int8_t>  atomic_int8_t;
+typedef atomic<uint8_t>  atomic_uint8_t;
+typedef atomic< int16_t> atomic_int16_t;
+typedef atomic<uint16_t> atomic_uint16_t;
+typedef atomic< int32_t> atomic_int32_t;
+typedef atomic<uint32_t> atomic_uint32_t;
+typedef atomic< int64_t> atomic_int64_t;
+typedef atomic<uint64_t> atomic_uint64_t;
+
+typedef atomic<intptr_t>  atomic_intptr_t;
+typedef atomic<uintptr_t> atomic_uintptr_t;
+typedef atomic<size_t>    atomic_size_t;
+typedef atomic<ptrdiff_t> atomic_ptrdiff_t;
+typedef atomic<intmax_t>  atomic_intmax_t;
+typedef atomic<uintmax_t> atomic_uintmax_t;
+
+// atomic_*_lock_free : prefer the contention type most highly, then the largest lock-free type
+
+#ifdef __cpp_lib_atomic_is_always_lock_free
+# define _LIBCPP_CONTENTION_LOCK_FREE ::std::__libcpp_is_always_lock_free<__cxx_contention_t>::__value
+#else
+# define _LIBCPP_CONTENTION_LOCK_FREE false
+#endif
+
+#if ATOMIC_LLONG_LOCK_FREE == 2
+typedef __conditional_t<_LIBCPP_CONTENTION_LOCK_FREE, __cxx_contention_t, long long>          __libcpp_signed_lock_free;
+typedef __conditional_t<_LIBCPP_CONTENTION_LOCK_FREE, __cxx_contention_t, unsigned long long> __libcpp_unsigned_lock_free;
+#elif ATOMIC_INT_LOCK_FREE == 2
+typedef __conditional_t<_LIBCPP_CONTENTION_LOCK_FREE, __cxx_contention_t, int>                __libcpp_signed_lock_free;
+typedef __conditional_t<_LIBCPP_CONTENTION_LOCK_FREE, __cxx_contention_t, unsigned int>       __libcpp_unsigned_lock_free;
+#elif ATOMIC_SHORT_LOCK_FREE == 2
+typedef __conditional_t<_LIBCPP_CONTENTION_LOCK_FREE, __cxx_contention_t, short>              __libcpp_signed_lock_free;
+typedef __conditional_t<_LIBCPP_CONTENTION_LOCK_FREE, __cxx_contention_t, unsigned short>     __libcpp_unsigned_lock_free;
+#elif ATOMIC_CHAR_LOCK_FREE == 2
+typedef __conditional_t<_LIBCPP_CONTENTION_LOCK_FREE, __cxx_contention_t, char>               __libcpp_signed_lock_free;
+typedef __conditional_t<_LIBCPP_CONTENTION_LOCK_FREE, __cxx_contention_t, unsigned char>      __libcpp_unsigned_lock_free;
+#else
+    // No signed/unsigned lock-free types
+#define _LIBCPP_NO_LOCK_FREE_TYPES
+#endif
+
+#if !defined(_LIBCPP_NO_LOCK_FREE_TYPES)
+typedef atomic<__libcpp_signed_lock_free> atomic_signed_lock_free;
+typedef atomic<__libcpp_unsigned_lock_free> atomic_unsigned_lock_free;
+#endif
+
+#define ATOMIC_FLAG_INIT {false}
+#define ATOMIC_VAR_INIT(__v) {__v}
+
+#if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_DISABLE_DEPRECATION_WARNINGS)
+# if defined(_LIBCPP_CLANG_VER) && _LIBCPP_CLANG_VER >= 1400
+#  pragma clang deprecated(ATOMIC_VAR_INIT)
+# endif
+#endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_DISABLE_DEPRECATION_WARNINGS)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <cmath>
+#  include <compare>
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_ATOMIC
diff --git a/app/src/main/cpp/libcxx/include/barrier b/app/src/main/cpp/libcxx/include/barrier
new file mode 100644
index 0000000..2e8906b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/barrier
@@ -0,0 +1,339 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_BARRIER
+#define _LIBCPP_BARRIER
+
+/*
+    barrier synopsis
+
+namespace std
+{
+
+  template<class CompletionFunction = see below>
+  class barrier
+  {
+  public:
+    using arrival_token = see below;
+
+    static constexpr ptrdiff_t max() noexcept;
+
+    constexpr explicit barrier(ptrdiff_t phase_count,
+                               CompletionFunction f = CompletionFunction());
+    ~barrier();
+
+    barrier(const barrier&) = delete;
+    barrier& operator=(const barrier&) = delete;
+
+    [[nodiscard]] arrival_token arrive(ptrdiff_t update = 1);
+    void wait(arrival_token&& arrival) const;
+
+    void arrive_and_wait();
+    void arrive_and_drop();
+
+  private:
+    CompletionFunction completion; // exposition only
+  };
+
+}
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__config>
+#include <__memory/unique_ptr.h>
+#include <__thread/timed_backoff_policy.h>
+#include <__utility/move.h>
+#include <atomic>
+#include <limits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifdef _LIBCPP_HAS_NO_THREADS
+# error "<barrier> is not supported since libc++ has been configured without support for threads."
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+#if _LIBCPP_STD_VER >= 14
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+struct __empty_completion
+{
+    inline _LIBCPP_INLINE_VISIBILITY
+    void operator()() noexcept
+    {
+    }
+};
+
+#ifndef _LIBCPP_HAS_NO_TREE_BARRIER
+
+/*
+
+The default implementation of __barrier_base is a classic tree barrier.
+
+It looks different from literature pseudocode for two main reasons:
+ 1. Threads that call into std::barrier functions do not provide indices,
+    so a numbering step is added before the actual barrier algorithm,
+    appearing as an N+1 round to the N rounds of the tree barrier.
+ 2. A great deal of attention has been paid to avoid cache line thrashing
+    by flattening the tree structure into cache-line sized arrays, that
+    are indexed in an efficient way.
+
+*/
+
+using __barrier_phase_t = uint8_t;
+
+class __barrier_algorithm_base;
+
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_EXPORTED_FROM_ABI
+__barrier_algorithm_base* __construct_barrier_algorithm_base(ptrdiff_t& __expected);
+
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_EXPORTED_FROM_ABI
+bool __arrive_barrier_algorithm_base(__barrier_algorithm_base* __barrier,
+                                     __barrier_phase_t __old_phase);
+
+_LIBCPP_AVAILABILITY_SYNC _LIBCPP_EXPORTED_FROM_ABI
+void __destroy_barrier_algorithm_base(__barrier_algorithm_base* __barrier);
+
+template<class _CompletionF>
+class __barrier_base {
+    ptrdiff_t                                               __expected_;
+    unique_ptr<__barrier_algorithm_base,
+               void (*)(__barrier_algorithm_base*)>         __base_;
+    __atomic_base<ptrdiff_t>                                __expected_adjustment_;
+    _CompletionF                                            __completion_;
+    __atomic_base<__barrier_phase_t>                        __phase_;
+
+public:
+    using arrival_token = __barrier_phase_t;
+
+    static constexpr ptrdiff_t max() noexcept {
+        return numeric_limits<ptrdiff_t>::max();
+    }
+
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    __barrier_base(ptrdiff_t __expected, _CompletionF __completion = _CompletionF())
+            : __expected_(__expected), __base_(std::__construct_barrier_algorithm_base(this->__expected_),
+                                               &__destroy_barrier_algorithm_base),
+              __expected_adjustment_(0), __completion_(std::move(__completion)), __phase_(0)
+    {
+    }
+    [[nodiscard]] _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    arrival_token arrive(ptrdiff_t __update)
+    {
+        auto const __old_phase = __phase_.load(memory_order_relaxed);
+        for(; __update; --__update)
+            if(__arrive_barrier_algorithm_base(__base_.get(), __old_phase)) {
+                __completion_();
+                __expected_ += __expected_adjustment_.load(memory_order_relaxed);
+                __expected_adjustment_.store(0, memory_order_relaxed);
+                __phase_.store(__old_phase + 2, memory_order_release);
+                __phase_.notify_all();
+            }
+        return __old_phase;
+    }
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void wait(arrival_token&& __old_phase) const
+    {
+        auto const __test_fn = [this, __old_phase]() -> bool {
+            return __phase_.load(memory_order_acquire) != __old_phase;
+        };
+        std::__libcpp_thread_poll_with_backoff(__test_fn, __libcpp_timed_backoff_policy());
+    }
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void arrive_and_drop()
+    {
+        __expected_adjustment_.fetch_sub(1, memory_order_relaxed);
+        (void)arrive(1);
+    }
+};
+
+#else
+
+/*
+
+The alternative implementation of __barrier_base is a central barrier.
+
+Two versions of this algorithm are provided:
+ 1. A fairly straightforward implementation of the litterature for the
+    general case where the completion function is not empty.
+ 2. An optimized implementation that exploits 2's complement arithmetic
+    and well-defined overflow in atomic arithmetic, to handle the phase
+    roll-over for free.
+
+*/
+
+template<class _CompletionF>
+class __barrier_base {
+
+    __atomic_base<ptrdiff_t> __expected;
+    __atomic_base<ptrdiff_t> __arrived;
+    _CompletionF             __completion;
+    __atomic_base<bool>      __phase;
+public:
+    using arrival_token = bool;
+
+    static constexpr ptrdiff_t max() noexcept {
+        return numeric_limits<ptrdiff_t>::max();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __barrier_base(ptrdiff_t __expected, _CompletionF __completion = _CompletionF())
+        : __expected(__expected), __arrived(__expected), __completion(std::move(__completion)), __phase(false)
+    {
+    }
+    [[nodiscard]] _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    arrival_token arrive(ptrdiff_t update)
+    {
+        auto const __old_phase = __phase.load(memory_order_relaxed);
+        auto const __result = __arrived.fetch_sub(update, memory_order_acq_rel) - update;
+        auto const new_expected = __expected.load(memory_order_relaxed);
+        if(0 == __result) {
+            __completion();
+            __arrived.store(new_expected, memory_order_relaxed);
+            __phase.store(!__old_phase, memory_order_release);
+            __phase.notify_all();
+        }
+        return __old_phase;
+    }
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void wait(arrival_token&& __old_phase) const
+    {
+        __phase.wait(__old_phase, memory_order_acquire);
+    }
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void arrive_and_drop()
+    {
+        __expected.fetch_sub(1, memory_order_relaxed);
+        (void)arrive(1);
+    }
+};
+
+template<>
+class __barrier_base<__empty_completion> {
+
+    static constexpr uint64_t __expected_unit = 1ull;
+    static constexpr uint64_t __arrived_unit = 1ull << 32;
+    static constexpr uint64_t __expected_mask = __arrived_unit - 1;
+    static constexpr uint64_t __phase_bit = 1ull << 63;
+    static constexpr uint64_t __arrived_mask = (__phase_bit - 1) & ~__expected_mask;
+
+    __atomic_base<uint64_t>   __phase_arrived_expected;
+
+    static _LIBCPP_INLINE_VISIBILITY
+    constexpr uint64_t __init(ptrdiff_t __count) _NOEXCEPT
+    {
+        return ((uint64_t(1u << 31) - __count) << 32)
+              | (uint64_t(1u << 31) - __count);
+    }
+
+public:
+    using arrival_token = uint64_t;
+
+    static constexpr ptrdiff_t max() noexcept {
+        return ptrdiff_t(1u << 31) - 1;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit inline __barrier_base(ptrdiff_t __count, __empty_completion = __empty_completion())
+        : __phase_arrived_expected(__init(__count))
+    {
+    }
+    [[nodiscard]] inline _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    arrival_token arrive(ptrdiff_t update)
+    {
+        auto const __inc = __arrived_unit * update;
+        auto const __old = __phase_arrived_expected.fetch_add(__inc, memory_order_acq_rel);
+        if((__old ^ (__old + __inc)) & __phase_bit) {
+            __phase_arrived_expected.fetch_add((__old & __expected_mask) << 32, memory_order_relaxed);
+            __phase_arrived_expected.notify_all();
+        }
+        return __old & __phase_bit;
+    }
+    inline _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void wait(arrival_token&& __phase) const
+    {
+        auto const __test_fn = [=]() -> bool {
+            uint64_t const __current = __phase_arrived_expected.load(memory_order_acquire);
+            return ((__current & __phase_bit) != __phase);
+        };
+        __libcpp_thread_poll_with_backoff(__test_fn, __libcpp_timed_backoff_policy());
+    }
+    inline _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void arrive_and_drop()
+    {
+        __phase_arrived_expected.fetch_add(__expected_unit, memory_order_relaxed);
+        (void)arrive(1);
+    }
+};
+
+#endif // !_LIBCPP_HAS_NO_TREE_BARRIER
+
+template<class _CompletionF = __empty_completion>
+class barrier {
+
+    __barrier_base<_CompletionF> __b_;
+public:
+    using arrival_token = typename __barrier_base<_CompletionF>::arrival_token;
+
+    static constexpr ptrdiff_t max() noexcept {
+        return __barrier_base<_CompletionF>::max();
+    }
+
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    barrier(ptrdiff_t __count, _CompletionF __completion = _CompletionF())
+        : __b_(__count, _VSTD::move(__completion)) {
+    }
+
+    barrier(barrier const&) = delete;
+    barrier& operator=(barrier const&) = delete;
+
+    [[nodiscard]] _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    arrival_token arrive(ptrdiff_t __update = 1)
+    {
+        return __b_.arrive(__update);
+    }
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void wait(arrival_token&& __phase) const
+    {
+        __b_.wait(_VSTD::move(__phase));
+    }
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void arrive_and_wait()
+    {
+        wait(arrive());
+    }
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void arrive_and_drop()
+    {
+        __b_.arrive_and_drop();
+    }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 14
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <iterator>
+#  include <memory>
+#  include <stdexcept>
+#  include <variant>
+#endif
+
+#endif //_LIBCPP_BARRIER
diff --git a/app/src/main/cpp/libcxx/include/bit b/app/src/main/cpp/libcxx/include/bit
new file mode 100644
index 0000000..d17a6e4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/bit
@@ -0,0 +1,91 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===---------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_BIT
+#define _LIBCPP_BIT
+
+/*
+    bit synopsis
+
+namespace std {
+  // [bit.cast], bit_cast
+  template<class To, class From>
+    constexpr To bit_cast(const From& from) noexcept; // C++20
+
+  // [bit.byteswap], byteswap
+  template<class T>
+    constexpr T byteswap(T value) noexcept;      // C++23
+
+  // [bit.pow.two], integral powers of 2
+  template <class T>
+    constexpr bool has_single_bit(T x) noexcept; // C++20
+  template <class T>
+    constexpr T bit_ceil(T x);                   // C++20
+  template <class T>
+    constexpr T bit_floor(T x) noexcept;         // C++20
+  template <class T>
+    constexpr int bit_width(T x) noexcept;       // C++20
+
+  // [bit.rotate], rotating
+  template<class T>
+    constexpr T rotl(T x, unsigned int s) noexcept; // C++20
+  template<class T>
+    constexpr T rotr(T x, unsigned int s) noexcept; // C++20
+
+  // [bit.count], counting
+  template<class T>
+    constexpr int countl_zero(T x) noexcept;  // C++20
+  template<class T>
+    constexpr int countl_one(T x) noexcept;   // C++20
+  template<class T>
+    constexpr int countr_zero(T x) noexcept;  // C++20
+  template<class T>
+    constexpr int countr_one(T x) noexcept;   // C++20
+  template<class T>
+    constexpr int popcount(T x) noexcept;     // C++20
+
+  // [bit.endian], endian
+  enum class endian {
+    little = see below,        // C++20
+    big = see below,           // C++20
+    native = see below         // C++20
+  };
+
+} // namespace std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__bit/bit_cast.h>
+#include <__bit/bit_ceil.h>
+#include <__bit/bit_floor.h>
+#include <__bit/bit_log2.h>
+#include <__bit/bit_width.h>
+#include <__bit/blsr.h>
+#include <__bit/byteswap.h>
+#include <__bit/countl.h>
+#include <__bit/countr.h>
+#include <__bit/endian.h>
+#include <__bit/has_single_bit.h>
+#include <__bit/popcount.h>
+#include <__bit/rotate.h>
+#include <__config>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <iosfwd>
+#  include <limits>
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_BIT
diff --git a/app/src/main/cpp/libcxx/include/bitset b/app/src/main/cpp/libcxx/include/bitset
new file mode 100644
index 0000000..c260f9f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/bitset
@@ -0,0 +1,1159 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_BITSET
+#define _LIBCPP_BITSET
+
+/*
+    bitset synopsis
+
+namespace std
+{
+
+namespace std {
+
+template <size_t N>
+class bitset
+{
+public:
+    // bit reference:
+    class reference
+    {
+        friend class bitset;
+        reference() noexcept;
+    public:
+        ~reference() noexcept;
+        reference& operator=(bool x) noexcept;           // for b[i] = x;
+        reference& operator=(const reference&) noexcept; // for b[i] = b[j];
+        bool operator~() const noexcept;                 // flips the bit
+        operator bool() const noexcept;                  // for x = b[i];
+        reference& flip() noexcept;                      // for b[i].flip();
+    };
+
+    // 23.3.5.1 constructors:
+    constexpr bitset() noexcept;
+    constexpr bitset(unsigned long long val) noexcept;
+    template <class charT>
+        explicit bitset(const charT* str,
+                        typename basic_string<charT>::size_type n = basic_string<charT>::npos,
+                        charT zero = charT('0'), charT one = charT('1')); // constexpr since C++23
+    template<class charT, class traits, class Allocator>
+        explicit bitset(const basic_string<charT,traits,Allocator>& str,
+                        typename basic_string<charT,traits,Allocator>::size_type pos = 0,
+                        typename basic_string<charT,traits,Allocator>::size_type n =
+                                 basic_string<charT,traits,Allocator>::npos,
+                        charT zero = charT('0'), charT one = charT('1')); // constexpr since C++23
+
+    // 23.3.5.2 bitset operations:
+    bitset& operator&=(const bitset& rhs) noexcept; // constexpr since C++23
+    bitset& operator|=(const bitset& rhs) noexcept; // constexpr since C++23
+    bitset& operator^=(const bitset& rhs) noexcept; // constexpr since C++23
+    bitset& operator<<=(size_t pos) noexcept;       // constexpr since C++23
+    bitset& operator>>=(size_t pos) noexcept;       // constexpr since C++23
+    bitset& set() noexcept;                         // constexpr since C++23
+    bitset& set(size_t pos, bool val = true);       // constexpr since C++23
+    bitset& reset() noexcept;                       // constexpr since C++23
+    bitset& reset(size_t pos);                      // constexpr since C++23
+    bitset operator~() const noexcept;              // constexpr since C++23
+    bitset& flip() noexcept;                        // constexpr since C++23
+    bitset& flip(size_t pos);                       // constexpr since C++23
+
+    // element access:
+    constexpr bool operator[](size_t pos) const;
+    reference operator[](size_t pos);            // constexpr since C++23
+    unsigned long to_ulong() const;              // constexpr since C++23
+    unsigned long long to_ullong() const;        // constexpr since C++23
+    template <class charT, class traits, class Allocator> // constexpr since C++23
+        basic_string<charT, traits, Allocator> to_string(charT zero = charT('0'), charT one = charT('1')) const;
+    template <class charT, class traits> // constexpr since C++23
+        basic_string<charT, traits, allocator<charT> > to_string(charT zero = charT('0'), charT one = charT('1')) const;
+    template <class charT> // constexpr since C++23
+        basic_string<charT, char_traits<charT>, allocator<charT> > to_string(charT zero = charT('0'), charT one = charT('1')) const;
+    basic_string<char, char_traits<char>, allocator<char> > to_string(char zero = '0', char one = '1') const; // constexpr since C++23
+    size_t count() const noexcept;                     // constexpr since C++23
+    constexpr size_t size() const noexcept;            // constexpr since C++23
+    bool operator==(const bitset& rhs) const noexcept; // constexpr since C++23
+    bool operator!=(const bitset& rhs) const noexcept; // constexpr since C++23
+    bool test(size_t pos) const;                       // constexpr since C++23
+    bool all() const noexcept;                         // constexpr since C++23
+    bool any() const noexcept;                         // constexpr since C++23
+    bool none() const noexcept;                        // constexpr since C++23
+    bitset<N> operator<<(size_t pos) const noexcept;   // constexpr since C++23
+    bitset<N> operator>>(size_t pos) const noexcept;   // constexpr since C++23
+};
+
+// 23.3.5.3 bitset operators:
+template <size_t N>
+bitset<N> operator&(const bitset<N>&, const bitset<N>&) noexcept; // constexpr since C++23
+
+template <size_t N>
+bitset<N> operator|(const bitset<N>&, const bitset<N>&) noexcept; // constexpr since C++23
+
+template <size_t N>
+bitset<N> operator^(const bitset<N>&, const bitset<N>&) noexcept; // constexpr since C++23
+
+template <class charT, class traits, size_t N>
+basic_istream<charT, traits>&
+operator>>(basic_istream<charT, traits>& is, bitset<N>& x);
+
+template <class charT, class traits, size_t N>
+basic_ostream<charT, traits>&
+operator<<(basic_ostream<charT, traits>& os, const bitset<N>& x);
+
+template <size_t N> struct hash<std::bitset<N>>;
+
+}  // std
+
+*/
+
+#include <__algorithm/fill.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__bit_reference>
+#include <__config>
+#include <__functional/hash.h>
+#include <__functional/unary_function.h>
+#include <__type_traits/is_char_like_type.h>
+#include <climits>
+#include <cstddef>
+#include <stdexcept>
+#include <version>
+
+// standard-mandated includes
+
+// [bitset.syn]
+#include <iosfwd>
+#include <string>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <size_t _N_words, size_t _Size>
+class __bitset;
+
+template <size_t _N_words, size_t _Size>
+struct __has_storage_type<__bitset<_N_words, _Size> >
+{
+    static const bool value = true;
+};
+
+template <size_t _N_words, size_t _Size>
+class __bitset
+{
+public:
+    typedef ptrdiff_t              difference_type;
+    typedef size_t                 size_type;
+    typedef size_type              __storage_type;
+protected:
+    typedef __bitset __self;
+    typedef       __storage_type*  __storage_pointer;
+    typedef const __storage_type*  __const_storage_pointer;
+    static const unsigned __bits_per_word = static_cast<unsigned>(sizeof(__storage_type) * CHAR_BIT);
+
+    friend class __bit_reference<__bitset>;
+    friend class __bit_const_reference<__bitset>;
+    friend class __bit_iterator<__bitset, false>;
+    friend class __bit_iterator<__bitset, true>;
+    friend struct __bit_array<__bitset>;
+
+    __storage_type __first_[_N_words];
+
+    typedef __bit_reference<__bitset>                  reference;
+    typedef __bit_const_reference<__bitset>            const_reference;
+    typedef __bit_iterator<__bitset, false>            iterator;
+    typedef __bit_iterator<__bitset, true>             const_iterator;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR __bitset() _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    explicit _LIBCPP_CONSTEXPR __bitset(unsigned long long __v) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 reference __make_ref(size_t __pos) _NOEXCEPT
+        {return reference(__first_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR const_reference __make_ref(size_t __pos) const _NOEXCEPT
+        {return const_reference(__first_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 iterator __make_iter(size_t __pos) _NOEXCEPT
+        {return iterator(__first_ + __pos / __bits_per_word, __pos % __bits_per_word);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 const_iterator __make_iter(size_t __pos) const _NOEXCEPT
+        {return const_iterator(__first_ + __pos / __bits_per_word, __pos % __bits_per_word);}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    void operator&=(const __bitset& __v) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    void operator|=(const __bitset& __v) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    void operator^=(const __bitset& __v) _NOEXCEPT;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 void flip() _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unsigned long to_ulong() const
+        {return to_ulong(integral_constant<bool, _Size < sizeof(unsigned long) * CHAR_BIT>());}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unsigned long long to_ullong() const
+        {return to_ullong(integral_constant<bool, _Size < sizeof(unsigned long long) * CHAR_BIT>());}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 bool all() const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 bool any() const _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    size_t __hash_code() const _NOEXCEPT;
+private:
+#ifdef _LIBCPP_CXX03_LANG
+    void __init(unsigned long long __v, false_type) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    void __init(unsigned long long __v, true_type) _NOEXCEPT;
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+    unsigned long to_ulong(false_type) const;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    unsigned long to_ulong(true_type) const;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+    unsigned long long to_ullong(false_type) const;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    unsigned long long to_ullong(true_type) const;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    unsigned long long to_ullong(true_type, false_type) const;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+    unsigned long long to_ullong(true_type, true_type) const;
+};
+
+template <size_t _N_words, size_t _Size>
+inline
+_LIBCPP_CONSTEXPR
+__bitset<_N_words, _Size>::__bitset() _NOEXCEPT
+#ifndef _LIBCPP_CXX03_LANG
+    : __first_{0}
+#endif
+{
+#ifdef _LIBCPP_CXX03_LANG
+    _VSTD::fill_n(__first_, _N_words, __storage_type(0));
+#endif
+}
+
+#ifdef _LIBCPP_CXX03_LANG
+
+template <size_t _N_words, size_t _Size>
+void
+__bitset<_N_words, _Size>::__init(unsigned long long __v, false_type) _NOEXCEPT
+{
+    __storage_type __t[sizeof(unsigned long long) / sizeof(__storage_type)];
+    size_t __sz = _Size;
+    for (size_t __i = 0; __i < sizeof(__t)/sizeof(__t[0]); ++__i, __v >>= __bits_per_word, __sz -= __bits_per_word )
+        if ( __sz < __bits_per_word)
+            __t[__i] = static_cast<__storage_type>(__v) & ( 1ULL << __sz ) - 1;
+        else
+            __t[__i] = static_cast<__storage_type>(__v);
+
+    _VSTD::copy(__t, __t + sizeof(__t)/sizeof(__t[0]), __first_);
+    _VSTD::fill(__first_ + sizeof(__t)/sizeof(__t[0]), __first_ + sizeof(__first_)/sizeof(__first_[0]),
+               __storage_type(0));
+}
+
+template <size_t _N_words, size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+__bitset<_N_words, _Size>::__init(unsigned long long __v, true_type) _NOEXCEPT
+{
+    __first_[0] = __v;
+    if (_Size < __bits_per_word)
+        __first_[0] &= ( 1ULL << _Size ) - 1;
+
+    _VSTD::fill(__first_ + 1, __first_ + sizeof(__first_)/sizeof(__first_[0]), __storage_type(0));
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <size_t _N_words, size_t _Size>
+inline
+_LIBCPP_CONSTEXPR
+__bitset<_N_words, _Size>::__bitset(unsigned long long __v) _NOEXCEPT
+#ifndef _LIBCPP_CXX03_LANG
+#if __SIZEOF_SIZE_T__ == 8
+    : __first_{__v}
+#elif __SIZEOF_SIZE_T__ == 4
+    : __first_{static_cast<__storage_type>(__v),
+                _Size >= 2 * __bits_per_word ? static_cast<__storage_type>(__v >> __bits_per_word)
+                : static_cast<__storage_type>((__v >> __bits_per_word) & (__storage_type(1) << (_Size - __bits_per_word)) - 1)}
+#else
+#error This constructor has not been ported to this platform
+#endif
+#endif
+{
+#ifdef _LIBCPP_CXX03_LANG
+    __init(__v, integral_constant<bool, sizeof(unsigned long long) == sizeof(__storage_type)>());
+#endif
+}
+
+template <size_t _N_words, size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 void
+__bitset<_N_words, _Size>::operator&=(const __bitset& __v) _NOEXCEPT
+{
+    for (size_type __i = 0; __i < _N_words; ++__i)
+        __first_[__i] &= __v.__first_[__i];
+}
+
+template <size_t _N_words, size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 void
+__bitset<_N_words, _Size>::operator|=(const __bitset& __v) _NOEXCEPT
+{
+    for (size_type __i = 0; __i < _N_words; ++__i)
+        __first_[__i] |= __v.__first_[__i];
+}
+
+template <size_t _N_words, size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 void
+__bitset<_N_words, _Size>::operator^=(const __bitset& __v) _NOEXCEPT
+{
+    for (size_type __i = 0; __i < _N_words; ++__i)
+        __first_[__i] ^= __v.__first_[__i];
+}
+
+template <size_t _N_words, size_t _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 void
+__bitset<_N_words, _Size>::flip() _NOEXCEPT
+{
+    // do middle whole words
+    size_type __n = _Size;
+    __storage_pointer __p = __first_;
+    for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word)
+        *__p = ~*__p;
+    // do last partial word
+    if (__n > 0)
+    {
+        __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+        __storage_type __b = *__p & __m;
+        *__p &= ~__m;
+        *__p |= ~__b & __m;
+    }
+}
+
+template <size_t _N_words, size_t _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 unsigned long
+__bitset<_N_words, _Size>::to_ulong(false_type) const
+{
+    const_iterator __e = __make_iter(_Size);
+    const_iterator __i = _VSTD::find(__make_iter(sizeof(unsigned long) * CHAR_BIT), __e, true);
+    if (__i != __e)
+        __throw_overflow_error("bitset to_ulong overflow error");
+
+    return __first_[0];
+}
+
+template <size_t _N_words, size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 unsigned long
+__bitset<_N_words, _Size>::to_ulong(true_type) const
+{
+    return __first_[0];
+}
+
+template <size_t _N_words, size_t _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 unsigned long long
+__bitset<_N_words, _Size>::to_ullong(false_type) const
+{
+    const_iterator __e = __make_iter(_Size);
+    const_iterator __i = _VSTD::find(__make_iter(sizeof(unsigned long long) * CHAR_BIT), __e, true);
+    if (__i != __e)
+        __throw_overflow_error("bitset to_ullong overflow error");
+
+    return to_ullong(true_type());
+}
+
+template <size_t _N_words, size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 unsigned long long
+__bitset<_N_words, _Size>::to_ullong(true_type) const
+{
+    return to_ullong(true_type(), integral_constant<bool, sizeof(__storage_type) < sizeof(unsigned long long)>());
+}
+
+template <size_t _N_words, size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 unsigned long long
+__bitset<_N_words, _Size>::to_ullong(true_type, false_type) const
+{
+    return __first_[0];
+}
+
+template <size_t _N_words, size_t _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 unsigned long long
+__bitset<_N_words, _Size>::to_ullong(true_type, true_type) const
+{
+    unsigned long long __r = __first_[0];
+    for (size_t __i = 1; __i < sizeof(unsigned long long) / sizeof(__storage_type); ++__i)
+        __r |= static_cast<unsigned long long>(__first_[__i]) << (sizeof(__storage_type) * CHAR_BIT);
+    return __r;
+}
+
+template <size_t _N_words, size_t _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+__bitset<_N_words, _Size>::all() const _NOEXCEPT
+{
+    // do middle whole words
+    size_type __n = _Size;
+    __const_storage_pointer __p = __first_;
+    for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word)
+        if (~*__p)
+            return false;
+    // do last partial word
+    if (__n > 0)
+    {
+        __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+        if (~*__p & __m)
+            return false;
+    }
+    return true;
+}
+
+template <size_t _N_words, size_t _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+__bitset<_N_words, _Size>::any() const _NOEXCEPT
+{
+    // do middle whole words
+    size_type __n = _Size;
+    __const_storage_pointer __p = __first_;
+    for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word)
+        if (*__p)
+            return true;
+    // do last partial word
+    if (__n > 0)
+    {
+        __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+        if (*__p & __m)
+            return true;
+    }
+    return false;
+}
+
+template <size_t _N_words, size_t _Size>
+inline
+size_t
+__bitset<_N_words, _Size>::__hash_code() const _NOEXCEPT
+{
+    size_t __h = 0;
+    for (size_type __i = 0; __i < _N_words; ++__i)
+        __h ^= __first_[__i];
+    return __h;
+}
+
+template <size_t _Size>
+class __bitset<1, _Size>
+{
+public:
+    typedef ptrdiff_t              difference_type;
+    typedef size_t                 size_type;
+    typedef size_type              __storage_type;
+protected:
+    typedef __bitset __self;
+    typedef       __storage_type*  __storage_pointer;
+    typedef const __storage_type*  __const_storage_pointer;
+    static const unsigned __bits_per_word = static_cast<unsigned>(sizeof(__storage_type) * CHAR_BIT);
+
+    friend class __bit_reference<__bitset>;
+    friend class __bit_const_reference<__bitset>;
+    friend class __bit_iterator<__bitset, false>;
+    friend class __bit_iterator<__bitset, true>;
+    friend struct __bit_array<__bitset>;
+
+    __storage_type __first_;
+
+    typedef __bit_reference<__bitset>                  reference;
+    typedef __bit_const_reference<__bitset>            const_reference;
+    typedef __bit_iterator<__bitset, false>            iterator;
+    typedef __bit_iterator<__bitset, true>             const_iterator;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR __bitset() _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    explicit _LIBCPP_CONSTEXPR __bitset(unsigned long long __v) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 reference __make_ref(size_t __pos) _NOEXCEPT
+        {return reference(&__first_, __storage_type(1) << __pos);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR const_reference __make_ref(size_t __pos) const _NOEXCEPT
+        {return const_reference(&__first_, __storage_type(1) << __pos);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 iterator __make_iter(size_t __pos) _NOEXCEPT
+        {return iterator(&__first_ + __pos / __bits_per_word, __pos % __bits_per_word);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 const_iterator __make_iter(size_t __pos) const _NOEXCEPT
+        {return const_iterator(&__first_ + __pos / __bits_per_word, __pos % __bits_per_word);}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    void operator&=(const __bitset& __v) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    void operator|=(const __bitset& __v) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    void operator^=(const __bitset& __v) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    void flip() _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    unsigned long to_ulong() const;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    unsigned long long to_ullong() const;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bool all() const _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bool any() const _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t __hash_code() const _NOEXCEPT;
+};
+
+template <size_t _Size>
+inline
+_LIBCPP_CONSTEXPR
+__bitset<1, _Size>::__bitset() _NOEXCEPT
+    : __first_(0)
+{
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_CONSTEXPR
+__bitset<1, _Size>::__bitset(unsigned long long __v) _NOEXCEPT
+    : __first_(
+        _Size == __bits_per_word ? static_cast<__storage_type>(__v)
+                                 : static_cast<__storage_type>(__v) & ((__storage_type(1) << _Size) - 1)
+    )
+{
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 void
+__bitset<1, _Size>::operator&=(const __bitset& __v) _NOEXCEPT
+{
+    __first_ &= __v.__first_;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 void
+__bitset<1, _Size>::operator|=(const __bitset& __v) _NOEXCEPT
+{
+    __first_ |= __v.__first_;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 void
+__bitset<1, _Size>::operator^=(const __bitset& __v) _NOEXCEPT
+{
+    __first_ ^= __v.__first_;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 void
+__bitset<1, _Size>::flip() _NOEXCEPT
+{
+    __storage_type __m = ~__storage_type(0) >> (__bits_per_word - _Size);
+    __first_ = ~__first_;
+    __first_ &= __m;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_CONSTEXPR_SINCE_CXX23 unsigned long
+__bitset<1, _Size>::to_ulong() const
+{
+    return __first_;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 unsigned long long
+__bitset<1, _Size>::to_ullong() const
+{
+    return __first_;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+__bitset<1, _Size>::all() const _NOEXCEPT
+{
+    __storage_type __m = ~__storage_type(0) >> (__bits_per_word - _Size);
+    return !(~__first_ & __m);
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 bool
+__bitset<1, _Size>::any() const _NOEXCEPT
+{
+    __storage_type __m = ~__storage_type(0) >> (__bits_per_word - _Size);
+    return __first_ & __m;
+}
+
+template <size_t _Size>
+inline
+size_t
+__bitset<1, _Size>::__hash_code() const _NOEXCEPT
+{
+    return __first_;
+}
+
+template <>
+class __bitset<0, 0>
+{
+public:
+    typedef ptrdiff_t              difference_type;
+    typedef size_t                 size_type;
+    typedef size_type              __storage_type;
+protected:
+    typedef __bitset __self;
+    typedef       __storage_type*  __storage_pointer;
+    typedef const __storage_type*  __const_storage_pointer;
+    static const unsigned __bits_per_word = static_cast<unsigned>(sizeof(__storage_type) * CHAR_BIT);
+
+    friend class __bit_reference<__bitset>;
+    friend class __bit_const_reference<__bitset>;
+    friend class __bit_iterator<__bitset, false>;
+    friend class __bit_iterator<__bitset, true>;
+    friend struct __bit_array<__bitset>;
+
+    typedef __bit_reference<__bitset>                  reference;
+    typedef __bit_const_reference<__bitset>            const_reference;
+    typedef __bit_iterator<__bitset, false>            iterator;
+    typedef __bit_iterator<__bitset, true>             const_iterator;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR __bitset() _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    explicit _LIBCPP_CONSTEXPR __bitset(unsigned long long) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 reference __make_ref(size_t) _NOEXCEPT
+        {return reference(nullptr, 1);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR const_reference __make_ref(size_t) const _NOEXCEPT
+        {return const_reference(nullptr, 1);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 iterator __make_iter(size_t) _NOEXCEPT
+        {return iterator(nullptr, 0);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 const_iterator __make_iter(size_t) const _NOEXCEPT
+        {return const_iterator(nullptr, 0);}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 void operator&=(const __bitset&) _NOEXCEPT {}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 void operator|=(const __bitset&) _NOEXCEPT {}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 void operator^=(const __bitset&) _NOEXCEPT {}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 void flip() _NOEXCEPT {}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unsigned long to_ulong() const {return 0;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 unsigned long long to_ullong() const {return 0;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool all() const _NOEXCEPT {return true;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool any() const _NOEXCEPT {return false;}
+
+    _LIBCPP_INLINE_VISIBILITY size_t __hash_code() const _NOEXCEPT {return 0;}
+};
+
+inline
+_LIBCPP_CONSTEXPR
+__bitset<0, 0>::__bitset() _NOEXCEPT
+{
+}
+
+inline
+_LIBCPP_CONSTEXPR
+__bitset<0, 0>::__bitset(unsigned long long) _NOEXCEPT
+{
+}
+
+template <size_t _Size> class _LIBCPP_TEMPLATE_VIS bitset;
+template <size_t _Size> struct hash<bitset<_Size> >;
+
+template <size_t _Size>
+class _LIBCPP_TEMPLATE_VIS bitset
+    : private __bitset<_Size == 0 ? 0 : (_Size - 1) / (sizeof(size_t) * CHAR_BIT) + 1, _Size>
+{
+public:
+    static const unsigned __n_words = _Size == 0 ? 0 : (_Size - 1) / (sizeof(size_t) * CHAR_BIT) + 1;
+    typedef __bitset<__n_words, _Size> base;
+
+public:
+    typedef typename base::reference       reference;
+    typedef typename base::const_reference const_reference;
+
+    // 23.3.5.1 constructors:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR bitset() _NOEXCEPT {}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+        bitset(unsigned long long __v) _NOEXCEPT : base(__v) {}
+    template<class _CharT, class = __enable_if_t<_IsCharLikeType<_CharT>::value> >
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+        explicit bitset(const _CharT* __str,
+                        typename basic_string<_CharT>::size_type __n = basic_string<_CharT>::npos,
+                        _CharT __zero = _CharT('0'), _CharT __one = _CharT('1'));
+    template<class _CharT, class _Traits, class _Allocator>
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+        explicit bitset(const basic_string<_CharT,_Traits,_Allocator>& __str,
+                        typename basic_string<_CharT,_Traits,_Allocator>::size_type __pos = 0,
+                        typename basic_string<_CharT,_Traits,_Allocator>::size_type __n =
+                                (basic_string<_CharT,_Traits,_Allocator>::npos),
+                        _CharT __zero = _CharT('0'), _CharT __one = _CharT('1'));
+
+    // 23.3.5.2 bitset operations:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset& operator&=(const bitset& __rhs) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset& operator|=(const bitset& __rhs) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset& operator^=(const bitset& __rhs) _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset& operator<<=(size_t __pos) _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset& operator>>=(size_t __pos) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset& set() _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset& set(size_t __pos, bool __val = true);
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset& reset() _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset& reset(size_t __pos);
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset  operator~() const _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset& flip() _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset& flip(size_t __pos);
+
+    // element access:
+#ifdef _LIBCPP_ABI_BITSET_VECTOR_BOOL_CONST_SUBSCRIPT_RETURN_BOOL
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR            bool operator[](size_t __p) const {return base::__make_ref(__p);}
+#else
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR const_reference operator[](size_t __p) const {return base::__make_ref(__p);}
+#endif
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 reference operator[](size_t __p)       {return base::__make_ref(__p);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    unsigned long to_ulong() const;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    unsigned long long to_ullong() const;
+    template <class _CharT, class _Traits, class _Allocator>
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+        basic_string<_CharT, _Traits, _Allocator> to_string(_CharT __zero = _CharT('0'),
+                                                            _CharT __one = _CharT('1')) const;
+    template <class _CharT, class _Traits>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+        basic_string<_CharT, _Traits, allocator<_CharT> > to_string(_CharT __zero = _CharT('0'),
+                                                                    _CharT __one = _CharT('1')) const;
+    template <class _CharT>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+        basic_string<_CharT, char_traits<_CharT>, allocator<_CharT> > to_string(_CharT __zero = _CharT('0'),
+                                                                                _CharT __one = _CharT('1')) const;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    basic_string<char, char_traits<char>, allocator<char> > to_string(char __zero = '0',
+                                                                      char __one = '1') const;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    size_t count() const _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR size_t size() const _NOEXCEPT {return _Size;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bool operator==(const bitset& __rhs) const _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bool operator!=(const bitset& __rhs) const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bool test(size_t __pos) const;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bool all() const _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bool any() const _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23 bool none() const _NOEXCEPT {return !any();}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset operator<<(size_t __pos) const _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+    bitset operator>>(size_t __pos) const _NOEXCEPT;
+
+private:
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t __hash_code() const _NOEXCEPT {return base::__hash_code();}
+
+    friend struct hash<bitset>;
+};
+
+template <size_t _Size>
+template<class _CharT, class>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>::bitset(const _CharT* __str,
+                      typename basic_string<_CharT>::size_type __n,
+                      _CharT __zero, _CharT __one)
+{
+    size_t __rlen = _VSTD::min(__n, char_traits<_CharT>::length(__str));
+    for (size_t __i = 0; __i < __rlen; ++__i)
+        if (__str[__i] != __zero && __str[__i] != __one)
+            __throw_invalid_argument("bitset string ctor has invalid argument");
+
+    size_t _Mp = _VSTD::min(__rlen, _Size);
+    size_t __i = 0;
+    for (; __i < _Mp; ++__i)
+    {
+        _CharT __c = __str[_Mp - 1 - __i];
+        (*this)[__i] = (__c == __one);
+    }
+    _VSTD::fill(base::__make_iter(__i), base::__make_iter(_Size), false);
+}
+
+template <size_t _Size>
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>::bitset(const basic_string<_CharT,_Traits,_Allocator>& __str,
+       typename basic_string<_CharT,_Traits,_Allocator>::size_type __pos,
+       typename basic_string<_CharT,_Traits,_Allocator>::size_type __n,
+       _CharT __zero, _CharT __one)
+{
+    if (__pos > __str.size())
+        __throw_out_of_range("bitset string pos out of range");
+
+    size_t __rlen = _VSTD::min(__n, __str.size() - __pos);
+    for (size_t __i = __pos; __i < __pos + __rlen; ++__i)
+        if (!_Traits::eq(__str[__i], __zero) && !_Traits::eq(__str[__i], __one))
+            __throw_invalid_argument("bitset string ctor has invalid argument");
+
+    size_t _Mp = _VSTD::min(__rlen, _Size);
+    size_t __i = 0;
+    for (; __i < _Mp; ++__i)
+    {
+        _CharT __c = __str[__pos + _Mp - 1 - __i];
+        (*this)[__i] = _Traits::eq(__c, __one);
+    }
+    _VSTD::fill(base::__make_iter(__i), base::__make_iter(_Size), false);
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>&
+bitset<_Size>::operator&=(const bitset& __rhs) _NOEXCEPT
+{
+    base::operator&=(__rhs);
+    return *this;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>&
+bitset<_Size>::operator|=(const bitset& __rhs) _NOEXCEPT
+{
+    base::operator|=(__rhs);
+    return *this;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>&
+bitset<_Size>::operator^=(const bitset& __rhs) _NOEXCEPT
+{
+    base::operator^=(__rhs);
+    return *this;
+}
+
+template <size_t _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>&
+bitset<_Size>::operator<<=(size_t __pos) _NOEXCEPT
+{
+    __pos = _VSTD::min(__pos, _Size);
+    _VSTD::copy_backward(base::__make_iter(0), base::__make_iter(_Size - __pos), base::__make_iter(_Size));
+    _VSTD::fill_n(base::__make_iter(0), __pos, false);
+    return *this;
+}
+
+template <size_t _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>&
+bitset<_Size>::operator>>=(size_t __pos) _NOEXCEPT
+{
+    __pos = _VSTD::min(__pos, _Size);
+    _VSTD::copy(base::__make_iter(__pos), base::__make_iter(_Size), base::__make_iter(0));
+    _VSTD::fill_n(base::__make_iter(_Size - __pos), __pos, false);
+    return *this;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>&
+bitset<_Size>::set() _NOEXCEPT
+{
+    _VSTD::fill_n(base::__make_iter(0), _Size, true);
+    return *this;
+}
+
+template <size_t _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>&
+bitset<_Size>::set(size_t __pos, bool __val)
+{
+    if (__pos >= _Size)
+        __throw_out_of_range("bitset set argument out of range");
+
+    (*this)[__pos] = __val;
+    return *this;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>&
+bitset<_Size>::reset() _NOEXCEPT
+{
+    _VSTD::fill_n(base::__make_iter(0), _Size, false);
+    return *this;
+}
+
+template <size_t _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>&
+bitset<_Size>::reset(size_t __pos)
+{
+    if (__pos >= _Size)
+        __throw_out_of_range("bitset reset argument out of range");
+
+    (*this)[__pos] = false;
+    return *this;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>
+bitset<_Size>::operator~() const _NOEXCEPT
+{
+    bitset __x(*this);
+    __x.flip();
+    return __x;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>&
+bitset<_Size>::flip() _NOEXCEPT
+{
+    base::flip();
+    return *this;
+}
+
+template <size_t _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>&
+bitset<_Size>::flip(size_t __pos)
+{
+    if (__pos >= _Size)
+        __throw_out_of_range("bitset flip argument out of range");
+
+    reference r = base::__make_ref(__pos);
+    r = ~r;
+    return *this;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+unsigned long
+bitset<_Size>::to_ulong() const
+{
+    return base::to_ulong();
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+unsigned long long
+bitset<_Size>::to_ullong() const
+{
+    return base::to_ullong();
+}
+
+template <size_t _Size>
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+basic_string<_CharT, _Traits, _Allocator>
+bitset<_Size>::to_string(_CharT __zero, _CharT __one) const
+{
+    basic_string<_CharT, _Traits, _Allocator> __r(_Size, __zero);
+    for (size_t __i = 0; __i != _Size; ++__i)
+    {
+        if ((*this)[__i])
+            __r[_Size - 1 - __i] = __one;
+    }
+    return __r;
+}
+
+template <size_t _Size>
+template <class _CharT, class _Traits>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+basic_string<_CharT, _Traits, allocator<_CharT> >
+bitset<_Size>::to_string(_CharT __zero, _CharT __one) const
+{
+    return to_string<_CharT, _Traits, allocator<_CharT> >(__zero, __one);
+}
+
+template <size_t _Size>
+template <class _CharT>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+basic_string<_CharT, char_traits<_CharT>, allocator<_CharT> >
+bitset<_Size>::to_string(_CharT __zero, _CharT __one) const
+{
+    return to_string<_CharT, char_traits<_CharT>, allocator<_CharT> >(__zero, __one);
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+basic_string<char, char_traits<char>, allocator<char> >
+bitset<_Size>::to_string(char __zero, char __one) const
+{
+    return to_string<char, char_traits<char>, allocator<char> >(__zero, __one);
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+size_t
+bitset<_Size>::count() const _NOEXCEPT
+{
+    return static_cast<size_t>(_VSTD::__count_bool_true(base::__make_iter(0), _Size));
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bool
+bitset<_Size>::operator==(const bitset& __rhs) const _NOEXCEPT
+{
+    return _VSTD::equal(base::__make_iter(0), base::__make_iter(_Size), __rhs.__make_iter(0));
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bool
+bitset<_Size>::operator!=(const bitset& __rhs) const _NOEXCEPT
+{
+    return !(*this == __rhs);
+}
+
+template <size_t _Size>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bool
+bitset<_Size>::test(size_t __pos) const
+{
+    if (__pos >= _Size)
+        __throw_out_of_range("bitset test argument out of range");
+
+    return (*this)[__pos];
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bool
+bitset<_Size>::all() const _NOEXCEPT
+{
+    return base::all();
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bool
+bitset<_Size>::any() const _NOEXCEPT
+{
+    return base::any();
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>
+bitset<_Size>::operator<<(size_t __pos) const _NOEXCEPT
+{
+    bitset __r = *this;
+    __r <<= __pos;
+    return __r;
+}
+
+template <size_t _Size>
+inline
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>
+bitset<_Size>::operator>>(size_t __pos) const _NOEXCEPT
+{
+    bitset __r = *this;
+    __r >>= __pos;
+    return __r;
+}
+
+template <size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>
+operator&(const bitset<_Size>& __x, const bitset<_Size>& __y) _NOEXCEPT
+{
+    bitset<_Size> __r = __x;
+    __r &= __y;
+    return __r;
+}
+
+template <size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>
+operator|(const bitset<_Size>& __x, const bitset<_Size>& __y) _NOEXCEPT
+{
+    bitset<_Size> __r = __x;
+    __r |= __y;
+    return __r;
+}
+
+template <size_t _Size>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX23
+bitset<_Size>
+operator^(const bitset<_Size>& __x, const bitset<_Size>& __y) _NOEXCEPT
+{
+    bitset<_Size> __r = __x;
+    __r ^= __y;
+    return __r;
+}
+
+template <size_t _Size>
+struct _LIBCPP_TEMPLATE_VIS hash<bitset<_Size> >
+    : public __unary_function<bitset<_Size>, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const bitset<_Size>& __bs) const _NOEXCEPT
+        {return __bs.__hash_code();}
+};
+
+template <class _CharT, class _Traits, size_t _Size>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is, bitset<_Size>& __x);
+
+template <class _CharT, class _Traits, size_t _Size>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const bitset<_Size>& __x);
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#endif
+
+#endif // _LIBCPP_BITSET
diff --git a/app/src/main/cpp/libcxx/include/cassert b/app/src/main/cpp/libcxx/include/cassert
new file mode 100644
index 0000000..761f57d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cassert
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+/*
+    cassert synopsis
+
+Macros:
+
+    assert
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+// <assert.h> is not provided by libc++
+#if __has_include(<assert.h>)
+#  include <assert.h>
+#  ifdef _LIBCPP_ASSERT_H
+#    error "If libc++ starts defining <assert.h>, the __has_include check should move to libc++'s <assert.h>"
+#  endif
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
diff --git a/app/src/main/cpp/libcxx/include/ccomplex b/app/src/main/cpp/libcxx/include/ccomplex
new file mode 100644
index 0000000..cf05c7a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/ccomplex
@@ -0,0 +1,27 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CCOMPLEX
+#define _LIBCPP_CCOMPLEX
+
+/*
+    ccomplex synopsis
+
+#include <complex>
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <complex>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif // _LIBCPP_CCOMPLEX
diff --git a/app/src/main/cpp/libcxx/include/cctype b/app/src/main/cpp/libcxx/include/cctype
new file mode 100644
index 0000000..867e7d5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cctype
@@ -0,0 +1,129 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CCTYPE
+#define _LIBCPP_CCTYPE
+
+/*
+    cctype synopsis
+
+namespace std
+{
+
+int isalnum(int c);
+int isalpha(int c);
+int isblank(int c);  // C99
+int iscntrl(int c);
+int isdigit(int c);
+int isgraph(int c);
+int islower(int c);
+int isprint(int c);
+int ispunct(int c);
+int isspace(int c);
+int isupper(int c);
+int isxdigit(int c);
+int tolower(int c);
+int toupper(int c);
+
+}  // std
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#include <ctype.h>
+
+#ifndef _LIBCPP_CTYPE_H
+#   error <cctype> tried including <ctype.h> but didn't find libc++'s <ctype.h> header. \
+          This usually means that your header search paths are not configured properly.  \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#ifdef isalnum
+#undef isalnum
+#endif
+
+#ifdef isalpha
+#undef isalpha
+#endif
+
+#ifdef isblank
+#undef isblank
+#endif
+
+#ifdef iscntrl
+#undef iscntrl
+#endif
+
+#ifdef isdigit
+#undef isdigit
+#endif
+
+#ifdef isgraph
+#undef isgraph
+#endif
+
+#ifdef islower
+#undef islower
+#endif
+
+#ifdef isprint
+#undef isprint
+#endif
+
+#ifdef ispunct
+#undef ispunct
+#endif
+
+#ifdef isspace
+#undef isspace
+#endif
+
+#ifdef isupper
+#undef isupper
+#endif
+
+#ifdef isxdigit
+#undef isxdigit
+#endif
+
+#ifdef tolower
+#undef tolower
+#endif
+
+#ifdef toupper
+#undef toupper
+#endif
+
+
+using ::isalnum _LIBCPP_USING_IF_EXISTS;
+using ::isalpha _LIBCPP_USING_IF_EXISTS;
+using ::isblank _LIBCPP_USING_IF_EXISTS;
+using ::iscntrl _LIBCPP_USING_IF_EXISTS;
+using ::isdigit _LIBCPP_USING_IF_EXISTS;
+using ::isgraph _LIBCPP_USING_IF_EXISTS;
+using ::islower _LIBCPP_USING_IF_EXISTS;
+using ::isprint _LIBCPP_USING_IF_EXISTS;
+using ::ispunct _LIBCPP_USING_IF_EXISTS;
+using ::isspace _LIBCPP_USING_IF_EXISTS;
+using ::isupper _LIBCPP_USING_IF_EXISTS;
+using ::isxdigit _LIBCPP_USING_IF_EXISTS;
+using ::tolower _LIBCPP_USING_IF_EXISTS;
+using ::toupper _LIBCPP_USING_IF_EXISTS;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CCTYPE
diff --git a/app/src/main/cpp/libcxx/include/cerrno b/app/src/main/cpp/libcxx/include/cerrno
new file mode 100644
index 0000000..937ec23
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cerrno
@@ -0,0 +1,42 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CERRNO
+#define _LIBCPP_CERRNO
+
+/*
+    cerrno synopsis
+
+Macros:
+
+    EDOM
+    EILSEQ  // C99
+    ERANGE
+    errno
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#include <errno.h>
+
+#ifndef _LIBCPP_ERRNO_H
+#   error <cerrno> tried including <errno.h> but didn't find libc++'s <errno.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif // _LIBCPP_CERRNO
diff --git a/app/src/main/cpp/libcxx/include/cfenv b/app/src/main/cpp/libcxx/include/cfenv
new file mode 100644
index 0000000..16b3761
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cfenv
@@ -0,0 +1,91 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CFENV
+#define _LIBCPP_CFENV
+
+/*
+    cfenv synopsis
+
+This entire header is C99 / C++0X
+
+Macros:
+
+    FE_DIVBYZERO
+    FE_INEXACT
+    FE_INVALID
+    FE_OVERFLOW
+    FE_UNDERFLOW
+    FE_ALL_EXCEPT
+    FE_DOWNWARD
+    FE_TONEAREST
+    FE_TOWARDZERO
+    FE_UPWARD
+    FE_DFL_ENV
+
+namespace std
+{
+
+Types:
+
+    fenv_t
+    fexcept_t
+
+int feclearexcept(int excepts);
+int fegetexceptflag(fexcept_t* flagp, int excepts);
+int feraiseexcept(int excepts);
+int fesetexceptflag(const fexcept_t* flagp, int excepts);
+int fetestexcept(int excepts);
+int fegetround();
+int fesetround(int round);
+int fegetenv(fenv_t* envp);
+int feholdexcept(fenv_t* envp);
+int fesetenv(const fenv_t* envp);
+int feupdateenv(const fenv_t* envp);
+
+}  // std
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#include <fenv.h>
+
+#ifndef _LIBCPP_FENV_H
+#   error <cfenv> tried including <fenv.h> but didn't find libc++'s <fenv.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::fenv_t _LIBCPP_USING_IF_EXISTS;
+using ::fexcept_t _LIBCPP_USING_IF_EXISTS;
+
+using ::feclearexcept _LIBCPP_USING_IF_EXISTS;
+using ::fegetexceptflag _LIBCPP_USING_IF_EXISTS;
+using ::feraiseexcept _LIBCPP_USING_IF_EXISTS;
+using ::fesetexceptflag _LIBCPP_USING_IF_EXISTS;
+using ::fetestexcept _LIBCPP_USING_IF_EXISTS;
+using ::fegetround _LIBCPP_USING_IF_EXISTS;
+using ::fesetround _LIBCPP_USING_IF_EXISTS;
+using ::fegetenv _LIBCPP_USING_IF_EXISTS;
+using ::feholdexcept _LIBCPP_USING_IF_EXISTS;
+using ::fesetenv _LIBCPP_USING_IF_EXISTS;
+using ::feupdateenv _LIBCPP_USING_IF_EXISTS;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CFENV
diff --git a/app/src/main/cpp/libcxx/include/cfloat b/app/src/main/cpp/libcxx/include/cfloat
new file mode 100644
index 0000000..4f991dd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cfloat
@@ -0,0 +1,89 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CFLOAT
+#define _LIBCPP_CFLOAT
+
+/*
+    cfloat synopsis
+
+Macros:
+
+    FLT_ROUNDS
+    FLT_EVAL_METHOD     // C99
+    FLT_RADIX
+
+    FLT_HAS_SUBNORM     // C11
+    DBL_HAS_SUBNORM     // C11
+    LDBL_HAS_SUBNORM    // C11
+
+    FLT_MANT_DIG
+    DBL_MANT_DIG
+    LDBL_MANT_DIG
+
+    DECIMAL_DIG         // C99
+    FLT_DECIMAL_DIG     // C11
+    DBL_DECIMAL_DIG     // C11
+    LDBL_DECIMAL_DIG    // C11
+
+    FLT_DIG
+    DBL_DIG
+    LDBL_DIG
+
+    FLT_MIN_EXP
+    DBL_MIN_EXP
+    LDBL_MIN_EXP
+
+    FLT_MIN_10_EXP
+    DBL_MIN_10_EXP
+    LDBL_MIN_10_EXP
+
+    FLT_MAX_EXP
+    DBL_MAX_EXP
+    LDBL_MAX_EXP
+
+    FLT_MAX_10_EXP
+    DBL_MAX_10_EXP
+    LDBL_MAX_10_EXP
+
+    FLT_MAX
+    DBL_MAX
+    LDBL_MAX
+
+    FLT_EPSILON
+    DBL_EPSILON
+    LDBL_EPSILON
+
+    FLT_MIN
+    DBL_MIN
+    LDBL_MIN
+
+    FLT_TRUE_MIN        // C11
+    DBL_TRUE_MIN        // C11
+    LDBL_TRUE_MIN       // C11
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#include <float.h>
+
+#ifndef _LIBCPP_FLOAT_H
+#   error <cfloat> tried including <float.h> but didn't find libc++'s <float.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif // _LIBCPP_CFLOAT
diff --git a/app/src/main/cpp/libcxx/include/charconv b/app/src/main/cpp/libcxx/include/charconv
new file mode 100644
index 0000000..9c74ce3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/charconv
@@ -0,0 +1,847 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CHARCONV
+#define _LIBCPP_CHARCONV
+
+/*
+    charconv synopsis
+
+namespace std {
+
+  // floating-point format for primitive numerical conversion
+  enum class chars_format {
+    scientific = unspecified,
+    fixed = unspecified,
+    hex = unspecified,
+    general = fixed | scientific
+  };
+
+  // 23.20.2, primitive numerical output conversion
+  struct to_chars_result {
+    char* ptr;
+    errc ec;
+    friend bool operator==(const to_chars_result&, const to_chars_result&) = default; // since C++20
+  };
+
+  constexpr to_chars_result to_chars(char* first, char* last, see below value,
+                                     int base = 10);                                  // constexpr since C++23
+  to_chars_result to_chars(char* first, char* last, bool value,
+                           int base = 10) = delete;
+
+  to_chars_result to_chars(char* first, char* last, float value);
+  to_chars_result to_chars(char* first, char* last, double value);
+  to_chars_result to_chars(char* first, char* last, long double value);
+
+  to_chars_result to_chars(char* first, char* last, float value,
+                           chars_format fmt);
+  to_chars_result to_chars(char* first, char* last, double value,
+                           chars_format fmt);
+  to_chars_result to_chars(char* first, char* last, long double value,
+                           chars_format fmt);
+
+  to_chars_result to_chars(char* first, char* last, float value,
+                           chars_format fmt, int precision);
+  to_chars_result to_chars(char* first, char* last, double value,
+                           chars_format fmt, int precision);
+  to_chars_result to_chars(char* first, char* last, long double value,
+                           chars_format fmt, int precision);
+
+  // 23.20.3, primitive numerical input conversion
+  struct from_chars_result {
+    const char* ptr;
+    errc ec;
+    friend bool operator==(const from_chars_result&, const from_chars_result&) = default; // since C++20
+  };
+
+  constexpr from_chars_result from_chars(const char* first, const char* last,
+                               see below& value, int base = 10);                         // constexpr since C++23
+
+  from_chars_result from_chars(const char* first, const char* last,
+                               float& value,
+                               chars_format fmt = chars_format::general);
+  from_chars_result from_chars(const char* first, const char* last,
+                               double& value,
+                               chars_format fmt = chars_format::general);
+  from_chars_result from_chars(const char* first, const char* last,
+                               long double& value,
+                               chars_format fmt = chars_format::general);
+
+} // namespace std
+
+*/
+
+#include <__algorithm/copy_n.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__bit/countl.h>
+#include <__charconv/chars_format.h>
+#include <__charconv/from_chars_result.h>
+#include <__charconv/tables.h>
+#include <__charconv/to_chars_base_10.h>
+#include <__charconv/to_chars_result.h>
+#include <__config>
+#include <__debug>
+#include <__errc>
+#include <__memory/addressof.h>
+#include <__type_traits/make_32_64_or_128_bit.h>
+#include <__utility/unreachable.h>
+#include <cmath> // for log2f
+#include <cstdint>
+#include <cstdlib>
+#include <cstring>
+#include <limits>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+to_chars_result to_chars(char*, char*, bool, int = 10) = delete;
+from_chars_result from_chars(const char*, const char*, bool, int = 10) = delete;
+
+namespace __itoa
+{
+
+template <typename _Tp, typename = void>
+struct _LIBCPP_HIDDEN __traits_base;
+
+template <typename _Tp>
+struct _LIBCPP_HIDDEN __traits_base<_Tp, __enable_if_t<sizeof(_Tp) <= sizeof(uint32_t)>>
+{
+    using type = uint32_t;
+
+    /// The width estimation using a log10 algorithm.
+    ///
+    /// The algorithm is based on
+    /// http://graphics.stanford.edu/~seander/bithacks.html#IntegerLog10
+    /// Instead of using IntegerLogBase2 it uses __libcpp_clz. Since that
+    /// function requires its input to have at least one bit set the value of
+    /// zero is set to one. This means the first element of the lookup table is
+    /// zero.
+    static _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI int __width(_Tp __v)
+    {
+        auto __t = (32 - std::__libcpp_clz(static_cast<type>(__v | 1))) * 1233 >> 12;
+        return __t - (__v < __itoa::__pow10_32[__t]) + 1;
+    }
+
+    static _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI char* __convert(char* __p, _Tp __v)
+    {
+        return __itoa::__base_10_u32(__p, __v);
+    }
+
+    static _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI decltype(__pow10_32)& __pow() { return __itoa::__pow10_32; }
+};
+
+template <typename _Tp>
+struct _LIBCPP_HIDDEN
+    __traits_base<_Tp, __enable_if_t<sizeof(_Tp) == sizeof(uint64_t)>> {
+  using type = uint64_t;
+
+  /// The width estimation using a log10 algorithm.
+  ///
+  /// The algorithm is based on
+  /// http://graphics.stanford.edu/~seander/bithacks.html#IntegerLog10
+  /// Instead of using IntegerLogBase2 it uses __libcpp_clz. Since that
+  /// function requires its input to have at least one bit set the value of
+  /// zero is set to one. This means the first element of the lookup table is
+  /// zero.
+  static _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI int __width(_Tp __v) {
+    auto __t = (64 - std::__libcpp_clz(static_cast<type>(__v | 1))) * 1233 >> 12;
+    return __t - (__v < __itoa::__pow10_64[__t]) + 1;
+  }
+
+  static _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI char* __convert(char* __p, _Tp __v) { return __itoa::__base_10_u64(__p, __v); }
+
+  static _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI decltype(__pow10_64)& __pow() { return __itoa::__pow10_64; }
+};
+
+
+#  ifndef _LIBCPP_HAS_NO_INT128
+template <typename _Tp>
+struct _LIBCPP_HIDDEN
+    __traits_base<_Tp, __enable_if_t<sizeof(_Tp) == sizeof(__uint128_t)> > {
+  using type = __uint128_t;
+
+  /// The width estimation using a log10 algorithm.
+  ///
+  /// The algorithm is based on
+  /// http://graphics.stanford.edu/~seander/bithacks.html#IntegerLog10
+  /// Instead of using IntegerLogBase2 it uses __libcpp_clz. Since that
+  /// function requires its input to have at least one bit set the value of
+  /// zero is set to one. This means the first element of the lookup table is
+  /// zero.
+  static _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI int __width(_Tp __v) {
+    _LIBCPP_ASSERT(__v > numeric_limits<uint64_t>::max(), "The optimizations for this algorithm fail when this isn't true.");
+    // There's always a bit set in the upper 64-bits.
+    auto __t = (128 - std::__libcpp_clz(static_cast<uint64_t>(__v >> 64))) * 1233 >> 12;
+    _LIBCPP_ASSERT(__t >= __itoa::__pow10_128_offset, "Index out of bounds");
+    // __t is adjusted since the lookup table misses the lower entries.
+    return __t - (__v < __itoa::__pow10_128[__t - __itoa::__pow10_128_offset]) + 1;
+  }
+
+  static _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI char* __convert(char* __p, _Tp __v) { return __itoa::__base_10_u128(__p, __v); }
+
+  // TODO FMT This pow function should get an index.
+  // By moving this to its own header it can be reused by the pow function in to_chars_base_10.
+  static _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI decltype(__pow10_128)& __pow() { return __itoa::__pow10_128; }
+};
+#endif
+
+template <typename _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool
+__mul_overflowed(unsigned char __a, _Tp __b, unsigned char& __r)
+{
+    auto __c = __a * __b;
+    __r = __c;
+    return __c > numeric_limits<unsigned char>::max();
+}
+
+template <typename _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool
+__mul_overflowed(unsigned short __a, _Tp __b, unsigned short& __r)
+{
+    auto __c = __a * __b;
+    __r = __c;
+    return __c > numeric_limits<unsigned short>::max();
+}
+
+template <typename _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool
+__mul_overflowed(_Tp __a, _Tp __b, _Tp& __r)
+{
+    static_assert(is_unsigned<_Tp>::value, "");
+    return __builtin_mul_overflow(__a, __b, &__r);
+}
+
+template <typename _Tp, typename _Up>
+inline _LIBCPP_HIDE_FROM_ABI bool
+_LIBCPP_CONSTEXPR_SINCE_CXX23 __mul_overflowed(_Tp __a, _Up __b, _Tp& __r)
+{
+    return __itoa::__mul_overflowed(__a, static_cast<_Tp>(__b), __r);
+}
+
+template <typename _Tp>
+struct _LIBCPP_HIDDEN __traits : __traits_base<_Tp>
+{
+    static constexpr int digits = numeric_limits<_Tp>::digits10 + 1;
+    using __traits_base<_Tp>::__pow;
+    using typename __traits_base<_Tp>::type;
+
+    // precondition: at least one non-zero character available
+    static _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI char const*
+    __read(char const* __p, char const* __ep, type& __a, type& __b)
+    {
+        type __cprod[digits];
+        int __j = digits - 1;
+        int __i = digits;
+        do
+        {
+            if (*__p < '0' || *__p > '9')
+                break;
+            __cprod[--__i] = *__p++ - '0';
+        } while (__p != __ep && __i != 0);
+
+        __a = __inner_product(__cprod + __i + 1, __cprod + __j, __pow() + 1,
+                              __cprod[__i]);
+        if (__itoa::__mul_overflowed(__cprod[__j], __pow()[__j - __i], __b))
+            --__p;
+        return __p;
+    }
+
+    template <typename _It1, typename _It2, class _Up>
+    static _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI _Up
+    __inner_product(_It1 __first1, _It1 __last1, _It2 __first2, _Up __init)
+    {
+        for (; __first1 < __last1; ++__first1, ++__first2)
+            __init = __init + *__first1 * *__first2;
+        return __init;
+    }
+};
+
+}  // namespace __itoa
+
+template <typename _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI _Tp
+__complement(_Tp __x)
+{
+    static_assert(is_unsigned<_Tp>::value, "cast to unsigned first");
+    return _Tp(~__x + 1);
+}
+
+template <typename _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI to_chars_result
+__to_chars_itoa(char* __first, char* __last, _Tp __value, false_type);
+
+template <typename _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI to_chars_result
+__to_chars_itoa(char* __first, char* __last, _Tp __value, true_type)
+{
+    auto __x = std::__to_unsigned_like(__value);
+    if (__value < 0 && __first != __last)
+    {
+        *__first++ = '-';
+        __x = std::__complement(__x);
+    }
+
+    return std::__to_chars_itoa(__first, __last, __x, false_type());
+}
+
+template <typename _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI to_chars_result
+__to_chars_itoa(char* __first, char* __last, _Tp __value, false_type)
+{
+    using __tx = __itoa::__traits<_Tp>;
+    auto __diff = __last - __first;
+
+    if (__tx::digits <= __diff || __tx::__width(__value) <= __diff)
+        return {__tx::__convert(__first, __value), errc(0)};
+    else
+        return {__last, errc::value_too_large};
+}
+
+#  ifndef _LIBCPP_HAS_NO_INT128
+template <>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI to_chars_result
+__to_chars_itoa(char* __first, char* __last, __uint128_t __value, false_type)
+{
+    // When the value fits in 64-bits use the 64-bit code path. This reduces
+    // the number of expensive calculations on 128-bit values.
+    //
+    // NOTE the 128-bit code path requires this optimization.
+    if(__value <= numeric_limits<uint64_t>::max())
+        return __to_chars_itoa(__first, __last, static_cast<uint64_t>(__value), false_type());
+
+    using __tx = __itoa::__traits<__uint128_t>;
+    auto __diff = __last - __first;
+
+    if (__tx::digits <= __diff || __tx::__width(__value) <= __diff)
+        return {__tx::__convert(__first, __value), errc(0)};
+    else
+        return {__last, errc::value_too_large};
+}
+#endif
+
+template <class _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI to_chars_result
+__to_chars_integral(char* __first, char* __last, _Tp __value, int __base, false_type);
+
+template <typename _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI to_chars_result
+__to_chars_integral(char* __first, char* __last, _Tp __value, int __base,
+                    true_type)
+{
+    auto __x = std::__to_unsigned_like(__value);
+    if (__value < 0 && __first != __last)
+    {
+        *__first++ = '-';
+        __x = std::__complement(__x);
+    }
+
+    return std::__to_chars_integral(__first, __last, __x, __base, false_type());
+}
+
+namespace __itoa {
+
+template <unsigned _Base>
+struct _LIBCPP_HIDDEN __integral;
+
+template <>
+struct _LIBCPP_HIDDEN __integral<2> {
+  template <typename _Tp>
+  _LIBCPP_HIDE_FROM_ABI static constexpr int __width(_Tp __value) noexcept {
+    // If value == 0 still need one digit. If the value != this has no
+    // effect since the code scans for the most significant bit set. (Note
+    // that __libcpp_clz doesn't work for 0.)
+    return numeric_limits<_Tp>::digits - std::__libcpp_clz(__value | 1);
+  }
+
+  template <typename _Tp>
+  _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI static to_chars_result __to_chars(char* __first, char* __last, _Tp __value) {
+    ptrdiff_t __cap = __last - __first;
+    int __n = __width(__value);
+    if (__n > __cap)
+      return {__last, errc::value_too_large};
+
+    __last = __first + __n;
+    char* __p = __last;
+    const unsigned __divisor = 16;
+    while (__value > __divisor) {
+      unsigned __c = __value % __divisor;
+      __value /= __divisor;
+      __p -= 4;
+      std::copy_n(&__base_2_lut[4 * __c], 4, __p);
+    }
+    do {
+      unsigned __c = __value % 2;
+      __value /= 2;
+      *--__p = "01"[__c];
+    } while (__value != 0);
+    return {__last, errc(0)};
+  }
+};
+
+template <>
+struct _LIBCPP_HIDDEN __integral<8> {
+  template <typename _Tp>
+  _LIBCPP_HIDE_FROM_ABI static constexpr int __width(_Tp __value) noexcept {
+    // If value == 0 still need one digit. If the value != this has no
+    // effect since the code scans for the most significat bit set. (Note
+    // that __libcpp_clz doesn't work for 0.)
+    return ((numeric_limits<_Tp>::digits - std::__libcpp_clz(__value | 1)) + 2) / 3;
+  }
+
+  template <typename _Tp>
+  _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI static to_chars_result __to_chars(char* __first, char* __last, _Tp __value) {
+    ptrdiff_t __cap = __last - __first;
+    int __n = __width(__value);
+    if (__n > __cap)
+      return {__last, errc::value_too_large};
+
+    __last = __first + __n;
+    char* __p = __last;
+    unsigned __divisor = 64;
+    while (__value > __divisor) {
+      unsigned __c = __value % __divisor;
+      __value /= __divisor;
+      __p -= 2;
+      std::copy_n(&__base_8_lut[2 * __c], 2, __p);
+    }
+    do {
+      unsigned __c = __value % 8;
+      __value /= 8;
+      *--__p = "01234567"[__c];
+    } while (__value != 0);
+    return {__last, errc(0)};
+  }
+
+};
+
+template <>
+struct _LIBCPP_HIDDEN __integral<16> {
+  template <typename _Tp>
+  _LIBCPP_HIDE_FROM_ABI static constexpr int __width(_Tp __value) noexcept {
+    // If value == 0 still need one digit. If the value != this has no
+    // effect since the code scans for the most significat bit set. (Note
+    // that __libcpp_clz doesn't work for 0.)
+    return (numeric_limits<_Tp>::digits - std::__libcpp_clz(__value | 1) + 3) / 4;
+  }
+
+  template <typename _Tp>
+  _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI static to_chars_result __to_chars(char* __first, char* __last, _Tp __value) {
+    ptrdiff_t __cap = __last - __first;
+    int __n = __width(__value);
+    if (__n > __cap)
+      return {__last, errc::value_too_large};
+
+    __last = __first + __n;
+    char* __p = __last;
+    unsigned __divisor = 256;
+    while (__value > __divisor) {
+      unsigned __c = __value % __divisor;
+      __value /= __divisor;
+      __p -= 2;
+      std::copy_n(&__base_16_lut[2 * __c], 2, __p);
+    }
+    if (__first != __last)
+      do {
+        unsigned __c = __value % 16;
+        __value /= 16;
+        *--__p = "0123456789abcdef"[__c];
+      } while (__value != 0);
+    return {__last, errc(0)};
+  }
+};
+
+} // namespace __itoa
+
+template <unsigned _Base, typename _Tp,
+          typename enable_if<(sizeof(_Tp) >= sizeof(unsigned)), int>::type = 0>
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI int
+__to_chars_integral_width(_Tp __value) {
+  return __itoa::__integral<_Base>::__width(__value);
+}
+
+template <unsigned _Base, typename _Tp,
+          typename enable_if<(sizeof(_Tp) < sizeof(unsigned)), int>::type = 0>
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI int
+__to_chars_integral_width(_Tp __value) {
+  return std::__to_chars_integral_width<_Base>(static_cast<unsigned>(__value));
+}
+
+template <unsigned _Base, typename _Tp,
+          typename enable_if<(sizeof(_Tp) >= sizeof(unsigned)), int>::type = 0>
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI to_chars_result
+__to_chars_integral(char* __first, char* __last, _Tp __value) {
+  return __itoa::__integral<_Base>::__to_chars(__first, __last, __value);
+}
+
+template <unsigned _Base, typename _Tp,
+          typename enable_if<(sizeof(_Tp) < sizeof(unsigned)), int>::type = 0>
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI to_chars_result
+__to_chars_integral(char* __first, char* __last, _Tp __value) {
+  return std::__to_chars_integral<_Base>(__first, __last, static_cast<unsigned>(__value));
+}
+
+template <typename _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI int
+__to_chars_integral_width(_Tp __value, unsigned __base) {
+  _LIBCPP_ASSERT(__value >= 0, "The function requires a non-negative value.");
+
+  unsigned __base_2 = __base * __base;
+  unsigned __base_3 = __base_2 * __base;
+  unsigned __base_4 = __base_2 * __base_2;
+
+  int __r = 0;
+  while (true) {
+    if (__value < __base)
+      return __r + 1;
+    if (__value < __base_2)
+      return __r + 2;
+    if (__value < __base_3)
+      return __r + 3;
+    if (__value < __base_4)
+      return __r + 4;
+
+    __value /= __base_4;
+    __r += 4;
+  }
+
+  __libcpp_unreachable();
+}
+
+template <typename _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI to_chars_result
+__to_chars_integral(char* __first, char* __last, _Tp __value, int __base,
+                    false_type)
+{
+  if (__base == 10) [[likely]]
+    return std::__to_chars_itoa(__first, __last, __value, false_type());
+
+  switch (__base) {
+  case 2:
+    return std::__to_chars_integral<2>(__first, __last, __value);
+  case 8:
+    return std::__to_chars_integral<8>(__first, __last, __value);
+  case 16:
+    return std::__to_chars_integral<16>(__first, __last, __value);
+  }
+
+  ptrdiff_t __cap = __last - __first;
+  int __n = std::__to_chars_integral_width(__value, __base);
+  if (__n > __cap)
+    return {__last, errc::value_too_large};
+
+  __last = __first + __n;
+  char* __p = __last;
+  do {
+    unsigned __c = __value % __base;
+    __value /= __base;
+    *--__p = "0123456789abcdefghijklmnopqrstuvwxyz"[__c];
+  } while (__value != 0);
+  return {__last, errc(0)};
+}
+
+template <typename _Tp, typename enable_if<is_integral<_Tp>::value, int>::type = 0>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI to_chars_result
+to_chars(char* __first, char* __last, _Tp __value)
+{
+  using _Type = __make_32_64_or_128_bit_t<_Tp>;
+  static_assert(!is_same<_Type, void>::value, "unsupported integral type used in to_chars");
+  return std::__to_chars_itoa(__first, __last, static_cast<_Type>(__value), is_signed<_Tp>());
+}
+
+template <typename _Tp, typename enable_if<is_integral<_Tp>::value, int>::type = 0>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI to_chars_result
+to_chars(char* __first, char* __last, _Tp __value, int __base)
+{
+  _LIBCPP_ASSERT(2 <= __base && __base <= 36, "base not in [2, 36]");
+
+  using _Type = __make_32_64_or_128_bit_t<_Tp>;
+  return std::__to_chars_integral(__first, __last, static_cast<_Type>(__value), __base, is_signed<_Tp>());
+}
+
+template <typename _It, typename _Tp, typename _Fn, typename... _Ts>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI from_chars_result
+__sign_combinator(_It __first, _It __last, _Tp& __value, _Fn __f, _Ts... __args)
+{
+    using __tl = numeric_limits<_Tp>;
+    decltype(std::__to_unsigned_like(__value)) __x;
+
+    bool __neg = (__first != __last && *__first == '-');
+    auto __r = __f(__neg ? __first + 1 : __first, __last, __x, __args...);
+    switch (__r.ec)
+    {
+    case errc::invalid_argument:
+        return {__first, __r.ec};
+    case errc::result_out_of_range:
+        return __r;
+    default:
+        break;
+    }
+
+    if (__neg)
+    {
+        if (__x <= std::__complement(std::__to_unsigned_like(__tl::min())))
+        {
+            __x = std::__complement(__x);
+            std::copy_n(std::addressof(__x), 1, std::addressof(__value));
+            return __r;
+        }
+    }
+    else
+    {
+        if (__x <= std::__to_unsigned_like(__tl::max()))
+        {
+            __value = __x;
+            return __r;
+        }
+    }
+
+    return {__r.ptr, errc::result_out_of_range};
+}
+
+template <typename _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool
+__in_pattern(_Tp __c)
+{
+    return '0' <= __c && __c <= '9';
+}
+
+struct _LIBCPP_HIDDEN __in_pattern_result
+{
+    bool __ok;
+    int __val;
+
+    explicit _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI operator bool() const { return __ok; }
+};
+
+template <typename _Tp>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI __in_pattern_result
+__in_pattern(_Tp __c, int __base)
+{
+    if (__base <= 10)
+        return {'0' <= __c && __c < '0' + __base, __c - '0'};
+    else if (std::__in_pattern(__c))
+        return {true, __c - '0'};
+    else if ('a' <= __c && __c < 'a' + __base - 10)
+        return {true, __c - 'a' + 10};
+    else
+        return {'A' <= __c && __c < 'A' + __base - 10, __c - 'A' + 10};
+}
+
+template <typename _It, typename _Tp, typename _Fn, typename... _Ts>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI from_chars_result
+__subject_seq_combinator(_It __first, _It __last, _Tp& __value, _Fn __f,
+                         _Ts... __args)
+{
+    auto __find_non_zero = [](_It __firstit, _It __lastit) {
+        for (; __firstit != __lastit; ++__firstit)
+            if (*__firstit != '0')
+                break;
+        return __firstit;
+    };
+
+    auto __p = __find_non_zero(__first, __last);
+    if (__p == __last || !std::__in_pattern(*__p, __args...))
+    {
+        if (__p == __first)
+            return {__first, errc::invalid_argument};
+        else
+        {
+            __value = 0;
+            return {__p, {}};
+        }
+    }
+
+    auto __r = __f(__p, __last, __value, __args...);
+    if (__r.ec == errc::result_out_of_range)
+    {
+        for (; __r.ptr != __last; ++__r.ptr)
+        {
+            if (!std::__in_pattern(*__r.ptr, __args...))
+                break;
+        }
+    }
+
+    return __r;
+}
+
+template <typename _Tp, typename enable_if<is_unsigned<_Tp>::value, int>::type = 0>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI from_chars_result
+__from_chars_atoi(const char* __first, const char* __last, _Tp& __value)
+{
+    using __tx = __itoa::__traits<_Tp>;
+    using __output_type = typename __tx::type;
+
+    return std::__subject_seq_combinator(
+        __first, __last, __value,
+        [](const char* __f, const char* __l,
+           _Tp& __val) -> from_chars_result {
+            __output_type __a, __b;
+            auto __p = __tx::__read(__f, __l, __a, __b);
+            if (__p == __l || !std::__in_pattern(*__p))
+            {
+                __output_type __m = numeric_limits<_Tp>::max();
+                if (__m >= __a && __m - __a >= __b)
+                {
+                    __val = __a + __b;
+                    return {__p, {}};
+                }
+            }
+            return {__p, errc::result_out_of_range};
+        });
+}
+
+template <typename _Tp, typename enable_if<is_signed<_Tp>::value, int>::type = 0>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI from_chars_result
+__from_chars_atoi(const char* __first, const char* __last, _Tp& __value)
+{
+    using __t = decltype(std::__to_unsigned_like(__value));
+    return std::__sign_combinator(__first, __last, __value, __from_chars_atoi<__t>);
+}
+
+
+/*
+// Code used to generate __from_chars_log2f_lut.
+#include <cmath>
+#include <iostream>
+#include <format>
+
+int main() {
+  for (int i = 2; i <= 36; ++i)
+    std::cout << std::format("{},\n", log2f(i));
+}
+*/
+/// log2f table for bases [2, 36].
+inline constexpr float __from_chars_log2f_lut[35] = {
+    1,         1.5849625, 2,         2.321928, 2.5849626, 2.807355, 3,        3.169925,  3.321928,
+    3.4594316, 3.5849626, 3.7004397, 3.807355, 3.9068906, 4,        4.087463, 4.169925,  4.2479277,
+    4.321928,  4.3923173, 4.4594316, 4.523562, 4.5849624, 4.643856, 4.70044,  4.7548876, 4.807355,
+    4.857981,  4.9068904, 4.9541965, 5,        5.044394,  5.087463, 5.129283, 5.169925};
+
+template <typename _Tp, typename enable_if<is_unsigned<_Tp>::value, int>::type = 0>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI from_chars_result
+__from_chars_integral(const char* __first, const char* __last, _Tp& __value,
+                      int __base)
+{
+    if (__base == 10)
+        return std::__from_chars_atoi(__first, __last, __value);
+
+    return std::__subject_seq_combinator(
+        __first, __last, __value,
+        [](const char* __p, const char* __lastp, _Tp& __val,
+           int __b) -> from_chars_result {
+            using __tl = numeric_limits<_Tp>;
+            // __base is always between 2 and 36 inclusive.
+            auto __digits = __tl::digits / __from_chars_log2f_lut[__b - 2];
+            _Tp __x = __in_pattern(*__p++, __b).__val, __y = 0;
+
+            for (int __i = 1; __p != __lastp; ++__i, ++__p)
+            {
+                if (auto __c = __in_pattern(*__p, __b))
+                {
+                    if (__i < __digits - 1)
+                        __x = __x * __b + __c.__val;
+                    else
+                    {
+                        if (!__itoa::__mul_overflowed(__x, __b, __x))
+                            ++__p;
+                        __y = __c.__val;
+                        break;
+                    }
+                }
+                else
+                    break;
+            }
+
+            if (__p == __lastp || !__in_pattern(*__p, __b))
+            {
+                if (__tl::max() - __x >= __y)
+                {
+                    __val = __x + __y;
+                    return {__p, {}};
+                }
+            }
+            return {__p, errc::result_out_of_range};
+        },
+        __base);
+}
+
+template <typename _Tp, typename enable_if<is_signed<_Tp>::value, int>::type = 0>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI from_chars_result
+__from_chars_integral(const char* __first, const char* __last, _Tp& __value,
+                      int __base)
+{
+    using __t = decltype(std::__to_unsigned_like(__value));
+    return std::__sign_combinator(__first, __last, __value,
+                                  __from_chars_integral<__t>, __base);
+}
+
+template <typename _Tp, typename enable_if<is_integral<_Tp>::value, int>::type = 0>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI from_chars_result
+from_chars(const char* __first, const char* __last, _Tp& __value)
+{
+    return std::__from_chars_atoi(__first, __last, __value);
+}
+
+template <typename _Tp, typename enable_if<is_integral<_Tp>::value, int>::type = 0>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI from_chars_result
+from_chars(const char* __first, const char* __last, _Tp& __value, int __base)
+{
+    _LIBCPP_ASSERT(2 <= __base && __base <= 36, "base not in [2, 36]");
+    return std::__from_chars_integral(__first, __last, __value, __base);
+}
+
+_LIBCPP_AVAILABILITY_TO_CHARS_FLOATING_POINT _LIBCPP_FUNC_VIS
+to_chars_result to_chars(char* __first, char* __last, float __value);
+
+_LIBCPP_AVAILABILITY_TO_CHARS_FLOATING_POINT _LIBCPP_FUNC_VIS
+to_chars_result to_chars(char* __first, char* __last, double __value);
+
+_LIBCPP_AVAILABILITY_TO_CHARS_FLOATING_POINT _LIBCPP_FUNC_VIS
+to_chars_result to_chars(char* __first, char* __last, long double __value);
+
+_LIBCPP_AVAILABILITY_TO_CHARS_FLOATING_POINT _LIBCPP_FUNC_VIS
+to_chars_result to_chars(char* __first, char* __last, float __value, chars_format __fmt);
+
+_LIBCPP_AVAILABILITY_TO_CHARS_FLOATING_POINT _LIBCPP_FUNC_VIS
+to_chars_result to_chars(char* __first, char* __last, double __value, chars_format __fmt);
+
+_LIBCPP_AVAILABILITY_TO_CHARS_FLOATING_POINT _LIBCPP_FUNC_VIS
+to_chars_result to_chars(char* __first, char* __last, long double __value, chars_format __fmt);
+
+_LIBCPP_AVAILABILITY_TO_CHARS_FLOATING_POINT _LIBCPP_FUNC_VIS
+to_chars_result to_chars(char* __first, char* __last, float __value, chars_format __fmt, int __precision);
+
+_LIBCPP_AVAILABILITY_TO_CHARS_FLOATING_POINT _LIBCPP_FUNC_VIS
+to_chars_result to_chars(char* __first, char* __last, double __value, chars_format __fmt, int __precision);
+
+_LIBCPP_AVAILABILITY_TO_CHARS_FLOATING_POINT _LIBCPP_FUNC_VIS
+to_chars_result to_chars(char* __first, char* __last, long double __value, chars_format __fmt, int __precision);
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <iosfwd>
+#endif
+
+#endif // _LIBCPP_CHARCONV
diff --git a/app/src/main/cpp/libcxx/include/chrono b/app/src/main/cpp/libcxx/include/chrono
new file mode 100644
index 0000000..44073b5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/chrono
@@ -0,0 +1,788 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CHRONO
+#define _LIBCPP_CHRONO
+
+/*
+    chrono synopsis
+
+#include <compare> // C++20
+
+namespace std
+{
+namespace chrono
+{
+
+template <class ToDuration, class Rep, class Period>
+constexpr
+ToDuration
+duration_cast(const duration<Rep, Period>& fd);
+
+template <class Rep> struct treat_as_floating_point : is_floating_point<Rep> {};
+
+template <class Rep> inline constexpr bool treat_as_floating_point_v
+    = treat_as_floating_point<Rep>::value;                       // C++17
+
+template <class Rep>
+struct duration_values
+{
+public:
+    static constexpr Rep zero(); // noexcept in C++20
+    static constexpr Rep max();  // noexcept in C++20
+    static constexpr Rep min();  // noexcept in C++20
+};
+
+// duration
+
+template <class Rep, class Period = ratio<1>>
+class duration
+{
+    static_assert(!__is_duration<Rep>::value, "A duration representation can not be a duration");
+    static_assert(__is_ratio<Period>::value, "Second template parameter of duration must be a std::ratio");
+    static_assert(Period::num > 0, "duration period must be positive");
+public:
+    typedef Rep rep;
+    typedef typename _Period::type period;
+
+    constexpr duration() = default;
+    template <class Rep2>
+        constexpr explicit duration(const Rep2& r,
+            typename enable_if
+            <
+               is_convertible<Rep2, rep>::value &&
+               (treat_as_floating_point<rep>::value ||
+               !treat_as_floating_point<rep>::value && !treat_as_floating_point<Rep2>::value)
+            >::type* = 0);
+
+    // conversions
+    template <class Rep2, class Period2>
+        constexpr duration(const duration<Rep2, Period2>& d,
+            typename enable_if
+            <
+                treat_as_floating_point<rep>::value ||
+                ratio_divide<Period2, period>::type::den == 1
+            >::type* = 0);
+
+    // observer
+
+    constexpr rep count() const;
+
+    // arithmetic
+
+    constexpr common_type<duration>::type  operator+() const;
+    constexpr common_type<duration>::type  operator-() const;
+    constexpr duration& operator++();    // constexpr in C++17
+    constexpr duration  operator++(int); // constexpr in C++17
+    constexpr duration& operator--();    // constexpr in C++17
+    constexpr duration  operator--(int); // constexpr in C++17
+
+    constexpr duration& operator+=(const duration& d);  // constexpr in C++17
+    constexpr duration& operator-=(const duration& d);  // constexpr in C++17
+
+    duration& operator*=(const rep& rhs);       // constexpr in C++17
+    duration& operator/=(const rep& rhs);       // constexpr in C++17
+    duration& operator%=(const rep& rhs);       // constexpr in C++17
+    duration& operator%=(const duration& rhs);  // constexpr in C++17
+
+    // special values
+
+    static constexpr duration zero(); // noexcept in C++20
+    static constexpr duration min();  // noexcept in C++20
+    static constexpr duration max();  // noexcept in C++20
+};
+
+typedef duration<long long,         nano> nanoseconds;
+typedef duration<long long,        micro> microseconds;
+typedef duration<long long,        milli> milliseconds;
+typedef duration<long long              > seconds;
+typedef duration<     long, ratio<  60> > minutes;
+typedef duration<     long, ratio<3600> > hours;
+
+template <class Clock, class Duration = typename Clock::duration>
+class time_point
+{
+public:
+    typedef Clock                     clock;
+    typedef Duration                  duration;
+    typedef typename duration::rep    rep;
+    typedef typename duration::period period;
+private:
+    duration d_;  // exposition only
+
+public:
+    time_point();  // has value "epoch" // constexpr in C++14
+    explicit time_point(const duration& d);  // same as time_point() + d // constexpr in C++14
+
+    // conversions
+    template <class Duration2>
+       time_point(const time_point<clock, Duration2>& t); // constexpr in C++14
+
+    // observer
+
+    duration time_since_epoch() const; // constexpr in C++14
+
+    // arithmetic
+
+    time_point& operator+=(const duration& d); // constexpr in C++17
+    time_point& operator-=(const duration& d); // constexpr in C++17
+
+    // special values
+
+    static constexpr time_point min();  // noexcept in C++20
+    static constexpr time_point max();  // noexcept in C++20
+};
+
+} // chrono
+
+// common_type traits
+template <class Rep1, class Period1, class Rep2, class Period2>
+  struct common_type<chrono::duration<Rep1, Period1>, chrono::duration<Rep2, Period2>>;
+
+template <class Clock, class Duration1, class Duration2>
+  struct common_type<chrono::time_point<Clock, Duration1>, chrono::time_point<Clock, Duration2>>;
+
+namespace chrono {
+
+// duration arithmetic
+template <class Rep1, class Period1, class Rep2, class Period2>
+  constexpr
+  typename common_type<duration<Rep1, Period1>, duration<Rep2, Period2>>::type
+  operator+(const duration<Rep1, Period1>& lhs, const duration<Rep2, Period2>& rhs);
+template <class Rep1, class Period1, class Rep2, class Period2>
+  constexpr
+  typename common_type<duration<Rep1, Period1>, duration<Rep2, Period2>>::type
+  operator-(const duration<Rep1, Period1>& lhs, const duration<Rep2, Period2>& rhs);
+template <class Rep1, class Period, class Rep2>
+  constexpr
+  duration<typename common_type<Rep1, Rep2>::type, Period>
+  operator*(const duration<Rep1, Period>& d, const Rep2& s);
+template <class Rep1, class Period, class Rep2>
+  constexpr
+  duration<typename common_type<Rep1, Rep2>::type, Period>
+  operator*(const Rep1& s, const duration<Rep2, Period>& d);
+template <class Rep1, class Period, class Rep2>
+  constexpr
+  duration<typename common_type<Rep1, Rep2>::type, Period>
+  operator/(const duration<Rep1, Period>& d, const Rep2& s);
+template <class Rep1, class Period1, class Rep2, class Period2>
+  constexpr
+  typename common_type<Rep1, Rep2>::type
+  operator/(const duration<Rep1, Period1>& lhs, const duration<Rep2, Period2>& rhs);
+
+// duration comparisons
+template <class Rep1, class Period1, class Rep2, class Period2>
+   constexpr
+   bool operator==(const duration<Rep1, Period1>& lhs, const duration<Rep2, Period2>& rhs);
+template <class Rep1, class Period1, class Rep2, class Period2>
+   constexpr
+   bool operator!=(const duration<Rep1, Period1>& lhs, const duration<Rep2, Period2>& rhs);
+template <class Rep1, class Period1, class Rep2, class Period2>
+   constexpr
+   bool operator< (const duration<Rep1, Period1>& lhs, const duration<Rep2, Period2>& rhs);
+template <class Rep1, class Period1, class Rep2, class Period2>
+   constexpr
+   bool operator<=(const duration<Rep1, Period1>& lhs, const duration<Rep2, Period2>& rhs);
+template <class Rep1, class Period1, class Rep2, class Period2>
+   constexpr
+   bool operator> (const duration<Rep1, Period1>& lhs, const duration<Rep2, Period2>& rhs);
+template <class Rep1, class Period1, class Rep2, class Period2>
+   constexpr
+   bool operator>=(const duration<Rep1, Period1>& lhs, const duration<Rep2, Period2>& rhs);
+
+// duration_cast
+template <class ToDuration, class Rep, class Period>
+  ToDuration duration_cast(const duration<Rep, Period>& d);
+
+template <class ToDuration, class Rep, class Period>
+    constexpr ToDuration floor(const duration<Rep, Period>& d);    // C++17
+template <class ToDuration, class Rep, class Period>
+    constexpr ToDuration ceil(const duration<Rep, Period>& d);     // C++17
+template <class ToDuration, class Rep, class Period>
+    constexpr ToDuration round(const duration<Rep, Period>& d);    // C++17
+
+// duration I/O
+template<class charT, class traits, class Rep, class Period>       // C++20
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const duration<Rep, Period>& d);
+
+// time_point arithmetic (all constexpr in C++14)
+template <class Clock, class Duration1, class Rep2, class Period2>
+  time_point<Clock, typename common_type<Duration1, duration<Rep2, Period2>>::type>
+  operator+(const time_point<Clock, Duration1>& lhs, const duration<Rep2, Period2>& rhs);
+template <class Rep1, class Period1, class Clock, class Duration2>
+  time_point<Clock, typename common_type<duration<Rep1, Period1>, Duration2>::type>
+  operator+(const duration<Rep1, Period1>& lhs, const time_point<Clock, Duration2>& rhs);
+template <class Clock, class Duration1, class Rep2, class Period2>
+  time_point<Clock, typename common_type<Duration1, duration<Rep2, Period2>>::type>
+  operator-(const time_point<Clock, Duration1>& lhs, const duration<Rep2, Period2>& rhs);
+template <class Clock, class Duration1, class Duration2>
+  typename common_type<Duration1, Duration2>::type
+  operator-(const time_point<Clock, Duration1>& lhs, const time_point<Clock, Duration2>& rhs);
+
+// time_point comparisons (all constexpr in C++14)
+template <class Clock, class Duration1, class Duration2>
+   bool operator==(const time_point<Clock, Duration1>& lhs, const time_point<Clock, Duration2>& rhs);
+template <class Clock, class Duration1, class Duration2>
+   bool operator!=(const time_point<Clock, Duration1>& lhs, const time_point<Clock, Duration2>& rhs);
+template <class Clock, class Duration1, class Duration2>
+   bool operator< (const time_point<Clock, Duration1>& lhs, const time_point<Clock, Duration2>& rhs);
+template <class Clock, class Duration1, class Duration2>
+   bool operator<=(const time_point<Clock, Duration1>& lhs, const time_point<Clock, Duration2>& rhs);
+template <class Clock, class Duration1, class Duration2>
+   bool operator> (const time_point<Clock, Duration1>& lhs, const time_point<Clock, Duration2>& rhs);
+template <class Clock, class Duration1, class Duration2>
+   bool operator>=(const time_point<Clock, Duration1>& lhs, const time_point<Clock, Duration2>& rhs);
+
+// time_point_cast (constexpr in C++14)
+
+template <class ToDuration, class Clock, class Duration>
+  time_point<Clock, ToDuration> time_point_cast(const time_point<Clock, Duration>& t);
+
+template <class ToDuration, class Clock, class Duration>
+    constexpr time_point<Clock, ToDuration>
+    floor(const time_point<Clock, Duration>& tp);                  // C++17
+
+template <class ToDuration, class Clock, class Duration>
+    constexpr time_point<Clock, ToDuration>
+    ceil(const time_point<Clock, Duration>& tp);                   // C++17
+
+template <class ToDuration, class Clock, class Duration>
+    constexpr time_point<Clock, ToDuration>
+    round(const time_point<Clock, Duration>& tp);                  // C++17
+
+template <class Rep, class Period>
+    constexpr duration<Rep, Period> abs(duration<Rep, Period> d);  // C++17
+
+// Clocks
+
+class system_clock
+{
+public:
+    typedef microseconds                     duration;
+    typedef duration::rep                    rep;
+    typedef duration::period                 period;
+    typedef chrono::time_point<system_clock> time_point;
+    static const bool is_steady =            false; // constexpr in C++14
+
+    static time_point now() noexcept;
+    static time_t     to_time_t  (const time_point& __t) noexcept;
+    static time_point from_time_t(time_t __t) noexcept;
+};
+
+template <class Duration>
+  using sys_time  = time_point<system_clock, Duration>; // C++20
+using sys_seconds = sys_time<seconds>;                  // C++20
+using sys_days    = sys_time<days>;                     // C++20
+
+class file_clock                                        // C++20
+{
+public:
+    typedef see-below                      rep;
+    typedef nano                           period;
+    typedef chrono::duration<rep, period>  duration;
+    typedef chrono::time_point<file_clock> time_point;
+    static constexpr bool is_steady =      false;
+
+    static time_point now() noexcept;
+
+    template<class Duration>
+    static sys_time<see-below> to_sys(const file_time<Duration>&);
+
+    template<class Duration>
+    static file_time<see-below> from_sys(const sys_time<Duration>&);
+};
+
+template<class Duration>
+  using file_time = time_point<file_clock, Duration>;   // C++20
+
+class steady_clock
+{
+public:
+    typedef nanoseconds                                   duration;
+    typedef duration::rep                                 rep;
+    typedef duration::period                              period;
+    typedef chrono::time_point<steady_clock, duration>    time_point;
+    static const bool is_steady =                         true; // constexpr in C++14
+
+    static time_point now() noexcept;
+};
+
+typedef steady_clock high_resolution_clock;
+
+// 25.7.8, local time           // C++20
+struct local_t {};
+template<class Duration>
+  using local_time  = time_point<local_t, Duration>;
+using local_seconds = local_time<seconds>;
+using local_days    = local_time<days>;
+
+// 25.8.2, class last_spec    // C++20
+struct last_spec;
+
+// 25.8.3, class day          // C++20
+
+class day;
+constexpr bool operator==(const day& x, const day& y) noexcept;
+constexpr strong_ordering operator<=>(const day& x, const day& y) noexcept;
+constexpr day  operator+(const day&  x, const days& y) noexcept;
+constexpr day  operator+(const days& x, const day&  y) noexcept;
+constexpr day  operator-(const day&  x, const days& y) noexcept;
+constexpr days operator-(const day&  x, const day&  y) noexcept;
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const day& d);
+
+// 25.8.4, class month    // C++20
+class month;
+constexpr bool operator==(const month& x, const month& y) noexcept;
+constexpr strong_ordering operator<=>(const month& x, const month& y) noexcept;
+
+constexpr month  operator+(const month&  x, const months& y) noexcept;
+constexpr month  operator+(const months& x,  const month& y) noexcept;
+constexpr month  operator-(const month&  x, const months& y) noexcept;
+constexpr months operator-(const month&  x,  const month& y) noexcept;
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const month& m);
+
+// 25.8.5, class year    // C++20
+class year;
+constexpr bool operator==(const year& x, const year& y) noexcept;
+constexpr strong_ordering operator<=>(const year& x, const year& y) noexcept;
+
+constexpr year  operator+(const year&  x, const years& y) noexcept;
+constexpr year  operator+(const years& x, const year&  y) noexcept;
+constexpr year  operator-(const year&  x, const years& y) noexcept;
+constexpr years operator-(const year&  x, const year&  y) noexcept;
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const year& y);
+
+// 25.8.6, class weekday    // C++20
+class weekday;
+
+constexpr bool operator==(const weekday& x, const weekday& y) noexcept;
+constexpr bool operator!=(const weekday& x, const weekday& y) noexcept;
+constexpr weekday operator+(const weekday& x, const days&    y) noexcept;
+constexpr weekday operator+(const days&    x, const weekday& y) noexcept;
+constexpr weekday operator-(const weekday& x, const days&    y) noexcept;
+constexpr days    operator-(const weekday& x, const weekday& y) noexcept;
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const weekday& wd);
+
+// 25.8.7, class weekday_indexed    // C++20
+
+class weekday_indexed;
+constexpr bool operator==(const weekday_indexed& x, const weekday_indexed& y) noexcept;
+constexpr bool operator!=(const weekday_indexed& x, const weekday_indexed& y) noexcept;
+
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const weekday_indexed& wdi);
+
+// 25.8.8, class weekday_last    // C++20
+class weekday_last;
+
+constexpr bool operator==(const weekday_last& x, const weekday_last& y) noexcept;
+constexpr bool operator!=(const weekday_last& x, const weekday_last& y) noexcept;
+
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const weekday_last& wdl);
+
+// 25.8.9, class month_day    // C++20
+class month_day;
+
+constexpr bool operator==(const month_day& x, const month_day& y) noexcept;
+constexpr strong_ordering operator<=>(const month_day& x, const month_day& y) noexcept;
+
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const month_day& md);
+
+// 25.8.10, class month_day_last    // C++20
+class month_day_last;
+
+constexpr bool operator==(const month_day_last& x, const month_day_last& y) noexcept;
+constexpr strong_ordering operator<=>(const month_day_last& x, const month_day_last& y) noexcept;
+
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const month_day_last& mdl);
+
+// 25.8.11, class month_weekday    // C++20
+class month_weekday;
+
+constexpr bool operator==(const month_weekday& x, const month_weekday& y) noexcept;
+constexpr bool operator!=(const month_weekday& x, const month_weekday& y) noexcept;
+
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const month_weekday& mwd);
+
+// 25.8.12, class month_weekday_last    // C++20
+class month_weekday_last;
+
+constexpr bool operator==(const month_weekday_last& x, const month_weekday_last& y) noexcept;
+constexpr bool operator!=(const month_weekday_last& x, const month_weekday_last& y) noexcept;
+
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const month_weekday_last& mwdl);
+
+
+// 25.8.13, class year_month    // C++20
+class year_month;
+
+constexpr bool operator==(const year_month& x, const year_month& y) noexcept;
+constexpr strong_ordering operator<=>(const year_month& x, const year_month& y) noexcept;
+
+constexpr year_month operator+(const year_month& ym, const months& dm) noexcept;
+constexpr year_month operator+(const months& dm, const year_month& ym) noexcept;
+constexpr year_month operator-(const year_month& ym, const months& dm) noexcept;
+constexpr months operator-(const year_month& x, const year_month& y) noexcept;
+constexpr year_month operator+(const year_month& ym, const years& dy) noexcept;
+constexpr year_month operator+(const years& dy, const year_month& ym) noexcept;
+constexpr year_month operator-(const year_month& ym, const years& dy) noexcept;
+
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const year_month& ym);
+
+// 25.8.14, class year_month_day class    // C++20
+year_month_day;
+
+constexpr bool operator==(const year_month_day& x, const year_month_day& y) noexcept;
+constexpr strong_ordering operator<=>(const year_month_day& x, const year_month_day& y) noexcept;
+
+constexpr year_month_day operator+(const year_month_day& ymd, const months& dm) noexcept;
+constexpr year_month_day operator+(const months& dm, const year_month_day& ymd) noexcept;
+constexpr year_month_day operator+(const year_month_day& ymd, const years& dy) noexcept;
+constexpr year_month_day operator+(const years& dy, const year_month_day& ymd) noexcept;
+constexpr year_month_day operator-(const year_month_day& ymd, const months& dm) noexcept;
+constexpr year_month_day operator-(const year_month_day& ymd, const years& dy) noexcept;
+
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const year_month_day& ymd);
+
+// 25.8.15, class year_month_day_last    // C++20
+class year_month_day_last;
+
+constexpr bool operator==(const year_month_day_last& x, const year_month_day_last& y) noexcept;
+constexpr strong_ordering operator<=>(const year_month_day_last_day& x, const year_month_day_last_day& y) noexcept;
+
+constexpr year_month_day_last
+  operator+(const year_month_day_last& ymdl, const months& dm) noexcept;
+constexpr year_month_day_last
+  operator+(const months& dm, const year_month_day_last& ymdl) noexcept;
+constexpr year_month_day_last
+  operator+(const year_month_day_last& ymdl, const years& dy) noexcept;
+constexpr year_month_day_last
+  operator+(const years& dy, const year_month_day_last& ymdl) noexcept;
+constexpr year_month_day_last
+  operator-(const year_month_day_last& ymdl, const months& dm) noexcept;
+constexpr year_month_day_last
+  operator-(const year_month_day_last& ymdl, const years& dy) noexcept;
+
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const year_month_day_last& ymdl);
+
+// 25.8.16, class year_month_weekday    // C++20
+class year_month_weekday;
+
+constexpr bool operator==(const year_month_weekday& x,
+                          const year_month_weekday& y) noexcept;
+constexpr bool operator!=(const year_month_weekday& x,
+                          const year_month_weekday& y) noexcept;
+
+constexpr year_month_weekday
+  operator+(const year_month_weekday& ymwd, const months& dm) noexcept;
+constexpr year_month_weekday
+  operator+(const months& dm, const year_month_weekday& ymwd) noexcept;
+constexpr year_month_weekday
+  operator+(const year_month_weekday& ymwd, const years& dy) noexcept;
+constexpr year_month_weekday
+  operator+(const years& dy, const year_month_weekday& ymwd) noexcept;
+constexpr year_month_weekday
+  operator-(const year_month_weekday& ymwd, const months& dm) noexcept;
+constexpr year_month_weekday
+  operator-(const year_month_weekday& ymwd, const years& dy) noexcept;
+
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const year_month_weekday& ymwd);
+
+// 25.8.17, class year_month_weekday_last    // C++20
+class year_month_weekday_last;
+
+constexpr bool operator==(const year_month_weekday_last& x,
+                          const year_month_weekday_last& y) noexcept;
+constexpr bool operator!=(const year_month_weekday_last& x,
+                          const year_month_weekday_last& y) noexcept;
+constexpr year_month_weekday_last
+  operator+(const year_month_weekday_last& ymwdl, const months& dm) noexcept;
+constexpr year_month_weekday_last
+  operator+(const months& dm, const year_month_weekday_last& ymwdl) noexcept;
+constexpr year_month_weekday_last
+  operator+(const year_month_weekday_last& ymwdl, const years& dy) noexcept;
+constexpr year_month_weekday_last
+  operator+(const years& dy, const year_month_weekday_last& ymwdl) noexcept;
+constexpr year_month_weekday_last
+  operator-(const year_month_weekday_last& ymwdl, const months& dm) noexcept;
+constexpr year_month_weekday_last
+  operator-(const year_month_weekday_last& ymwdl, const years& dy) noexcept;
+
+template<class charT, class traits>
+  basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os, const year_month_weekday_last& ymwdl);
+
+// 25.8.18, civil calendar conventional syntax operators    // C++20
+constexpr year_month
+  operator/(const year& y, const month& m) noexcept;
+constexpr year_month
+  operator/(const year& y, int m) noexcept;
+constexpr month_day
+  operator/(const month& m, const day& d) noexcept;
+constexpr month_day
+  operator/(const month& m, int d) noexcept;
+constexpr month_day
+  operator/(int m, const day& d) noexcept;
+constexpr month_day
+  operator/(const day& d, const month& m) noexcept;
+constexpr month_day
+  operator/(const day& d, int m) noexcept;
+constexpr month_day_last
+  operator/(const month& m, last_spec) noexcept;
+constexpr month_day_last
+  operator/(int m, last_spec) noexcept;
+constexpr month_day_last
+  operator/(last_spec, const month& m) noexcept;
+constexpr month_day_last
+  operator/(last_spec, int m) noexcept;
+constexpr month_weekday
+  operator/(const month& m, const weekday_indexed& wdi) noexcept;
+constexpr month_weekday
+  operator/(int m, const weekday_indexed& wdi) noexcept;
+constexpr month_weekday
+  operator/(const weekday_indexed& wdi, const month& m) noexcept;
+constexpr month_weekday
+  operator/(const weekday_indexed& wdi, int m) noexcept;
+constexpr month_weekday_last
+  operator/(const month& m, const weekday_last& wdl) noexcept;
+constexpr month_weekday_last
+  operator/(int m, const weekday_last& wdl) noexcept;
+constexpr month_weekday_last
+  operator/(const weekday_last& wdl, const month& m) noexcept;
+constexpr month_weekday_last
+  operator/(const weekday_last& wdl, int m) noexcept;
+constexpr year_month_day
+  operator/(const year_month& ym, const day& d) noexcept;
+constexpr year_month_day
+  operator/(const year_month& ym, int d) noexcept;
+constexpr year_month_day
+  operator/(const year& y, const month_day& md) noexcept;
+constexpr year_month_day
+  operator/(int y, const month_day& md) noexcept;
+constexpr year_month_day
+  operator/(const month_day& md, const year& y) noexcept;
+constexpr year_month_day
+  operator/(const month_day& md, int y) noexcept;
+constexpr year_month_day_last
+  operator/(const year_month& ym, last_spec) noexcept;
+constexpr year_month_day_last
+  operator/(const year& y, const month_day_last& mdl) noexcept;
+constexpr year_month_day_last
+  operator/(int y, const month_day_last& mdl) noexcept;
+constexpr year_month_day_last
+  operator/(const month_day_last& mdl, const year& y) noexcept;
+constexpr year_month_day_last
+  operator/(const month_day_last& mdl, int y) noexcept;
+constexpr year_month_weekday
+  operator/(const year_month& ym, const weekday_indexed& wdi) noexcept;
+constexpr year_month_weekday
+  operator/(const year& y, const month_weekday& mwd) noexcept;
+constexpr year_month_weekday
+  operator/(int y, const month_weekday& mwd) noexcept;
+constexpr year_month_weekday
+  operator/(const month_weekday& mwd, const year& y) noexcept;
+constexpr year_month_weekday
+  operator/(const month_weekday& mwd, int y) noexcept;
+constexpr year_month_weekday_last
+  operator/(const year_month& ym, const weekday_last& wdl) noexcept;
+constexpr year_month_weekday_last
+  operator/(const year& y, const month_weekday_last& mwdl) noexcept;
+constexpr year_month_weekday_last
+  operator/(int y, const month_weekday_last& mwdl) noexcept;
+constexpr year_month_weekday_last
+  operator/(const month_weekday_last& mwdl, const year& y) noexcept;
+constexpr year_month_weekday_last
+  operator/(const month_weekday_last& mwdl, int y) noexcept;
+
+// 26.9, class template hh_mm_ss
+template <class Duration>
+class hh_mm_ss
+{
+    bool            is_neg; // exposition only
+    chrono::hours   h;      // exposition only
+    chrono::minutes m;      // exposition only
+    chrono::seconds s;      // exposition only
+    precision       ss;     // exposition only
+
+public:
+    static unsigned constexpr fractional_width = see below;
+    using precision                            = see below;
+
+    constexpr hh_mm_ss() noexcept : hh_mm_ss{Duration::zero()} {}
+    constexpr explicit hh_mm_ss(Duration d) noexcept;
+
+    constexpr bool is_negative() const noexcept;
+    constexpr chrono::hours hours() const noexcept;
+    constexpr chrono::minutes minutes() const noexcept;
+    constexpr chrono::seconds seconds() const noexcept;
+    constexpr precision subseconds() const noexcept;
+
+    constexpr explicit operator  precision()   const noexcept;
+    constexpr          precision to_duration() const noexcept;
+};
+
+// 26.10, 12/24 hour functions
+constexpr bool is_am(hours const& h) noexcept;
+constexpr bool is_pm(hours const& h) noexcept;
+constexpr hours make12(const hours& h) noexcept;
+constexpr hours make24(const hours& h, bool is_pm) noexcept;
+
+// 25.10.5, class time_zone    // C++20
+enum class choose {earliest, latest};
+class time_zone;
+bool operator==(const time_zone& x, const time_zone& y) noexcept;
+bool operator!=(const time_zone& x, const time_zone& y) noexcept;
+bool operator<(const time_zone& x, const time_zone& y) noexcept;
+bool operator>(const time_zone& x, const time_zone& y) noexcept;
+bool operator<=(const time_zone& x, const time_zone& y) noexcept;
+bool operator>=(const time_zone& x, const time_zone& y) noexcept;
+}  // chrono
+
+namespace std {
+  template<class Rep, class Period, class charT>
+    struct formatter<chrono::duration<Rep, Period>, charT>;                       // C++20
+  template<class charT> struct formatter<chrono::day, charT>;                     // C++20
+  template<class charT> struct formatter<chrono::month, charT>;                   // C++20
+  template<class charT> struct formatter<chrono::year, charT>;                    // C++20
+  template<class charT> struct formatter<chrono::weekday, charT>;                 // C++20
+  template<class charT> struct formatter<chrono::weekday_indexed, charT>;         // C++20
+  template<class charT> struct formatter<chrono::weekday_last, charT>;            // C++20
+  template<class charT> struct formatter<chrono::month_day, charT>;               // C++20
+  template<class charT> struct formatter<chrono::month_day_last, charT>;          // C++20
+  template<class charT> struct formatter<chrono::month_weekday, charT>;           // C++20
+  template<class charT> struct formatter<chrono::month_weekday_last, charT>;      // C++20
+  template<class charT> struct formatter<chrono::year_month, charT>;              // C++20
+  template<class charT> struct formatter<chrono::year_month_day, charT>;          // C++20
+  template<class charT> struct formatter<chrono::year_month_day_last, charT>;     // C++20
+  template<class charT> struct formatter<chrono::year_month_weekday, charT>;      // C++20
+  template<class charT> struct formatter<chrono::year_month_weekday_last, charT>; // C++20
+} // namespace std
+
+namespace chrono {
+// calendrical constants
+inline constexpr last_spec                              last{};       // C++20
+inline constexpr chrono::weekday                        Sunday{0};    // C++20
+inline constexpr chrono::weekday                        Monday{1};    // C++20
+inline constexpr chrono::weekday                        Tuesday{2};   // C++20
+inline constexpr chrono::weekday                        Wednesday{3}; // C++20
+inline constexpr chrono::weekday                        Thursday{4};  // C++20
+inline constexpr chrono::weekday                        Friday{5};    // C++20
+inline constexpr chrono::weekday                        Saturday{6};  // C++20
+
+inline constexpr chrono::month                          January{1};   // C++20
+inline constexpr chrono::month                          February{2};  // C++20
+inline constexpr chrono::month                          March{3};     // C++20
+inline constexpr chrono::month                          April{4};     // C++20
+inline constexpr chrono::month                          May{5};       // C++20
+inline constexpr chrono::month                          June{6};      // C++20
+inline constexpr chrono::month                          July{7};      // C++20
+inline constexpr chrono::month                          August{8};    // C++20
+inline constexpr chrono::month                          September{9}; // C++20
+inline constexpr chrono::month                          October{10};  // C++20
+inline constexpr chrono::month                          November{11}; // C++20
+inline constexpr chrono::month                          December{12}; // C++20
+}  // chrono
+
+inline namespace literals {
+  inline namespace chrono_literals {
+constexpr chrono::hours                                 operator ""h(unsigned long long); // C++14
+constexpr chrono::duration<unspecified , ratio<3600,1>> operator ""h(long double); // C++14
+constexpr chrono::minutes                               operator ""min(unsigned long long); // C++14
+constexpr chrono::duration<unspecified , ratio<60,1>>   operator ""min(long double); // C++14
+constexpr chrono::seconds                               operator ""s(unsigned long long); // C++14
+constexpr chrono::duration<unspecified >                operator ""s(long double); // C++14
+constexpr chrono::milliseconds                          operator ""ms(unsigned long long); // C++14
+constexpr chrono::duration<unspecified , milli>         operator ""ms(long double); // C++14
+constexpr chrono::microseconds                          operator ""us(unsigned long long); // C++14
+constexpr chrono::duration<unspecified , micro>         operator ""us(long double); // C++14
+constexpr chrono::nanoseconds                           operator ""ns(unsigned long long); // C++14
+constexpr chrono::duration<unspecified , nano>          operator ""ns(long double); // C++14
+constexpr chrono::day                                   operator ""d(unsigned long long d) noexcept; // C++20
+constexpr chrono::year                                  operator ""y(unsigned long long y) noexcept; // C++20
+}  // chrono_literals
+}  // literals
+
+}  // std
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__chrono/calendar.h>
+#include <__chrono/convert_to_timespec.h>
+#include <__chrono/convert_to_tm.h>
+#include <__chrono/day.h>
+#include <__chrono/duration.h>
+#include <__chrono/file_clock.h>
+#include <__chrono/hh_mm_ss.h>
+#include <__chrono/high_resolution_clock.h>
+#include <__chrono/literals.h>
+#include <__chrono/month.h>
+#include <__chrono/month_weekday.h>
+#include <__chrono/monthday.h>
+#include <__chrono/steady_clock.h>
+#include <__chrono/system_clock.h>
+#include <__chrono/time_point.h>
+#include <__chrono/weekday.h>
+#include <__chrono/year.h>
+#include <__chrono/year_month.h>
+#include <__chrono/year_month_day.h>
+#include <__chrono/year_month_weekday.h>
+#include <__config>
+#include <version>
+
+// standard-mandated includes
+
+// [time.syn]
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_LOCALIZATION) && !defined(_LIBCPP_HAS_NO_INCOMPLETE_FORMAT) && _LIBCPP_STD_VER > 17
+#  include <__chrono/formatter.h>
+#  include <__chrono/ostream.h>
+#  include <__chrono/parser_std_format_spec.h>
+#  include <__chrono/statically_widen.h>
+#endif
+
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#endif
+
+#endif // _LIBCPP_CHRONO
diff --git a/app/src/main/cpp/libcxx/include/cinttypes b/app/src/main/cpp/libcxx/include/cinttypes
new file mode 100644
index 0000000..a5b9558
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cinttypes
@@ -0,0 +1,271 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CINTTYPES
+#define _LIBCPP_CINTTYPES
+
+/*
+    cinttypes synopsis
+
+This entire header is C99 / C++0X
+
+#include <cstdint>  // <cinttypes> includes <cstdint>
+
+Macros:
+
+    PRId8
+    PRId16
+    PRId32
+    PRId64
+
+    PRIdLEAST8
+    PRIdLEAST16
+    PRIdLEAST32
+    PRIdLEAST64
+
+    PRIdFAST8
+    PRIdFAST16
+    PRIdFAST32
+    PRIdFAST64
+
+    PRIdMAX
+    PRIdPTR
+
+    PRIi8
+    PRIi16
+    PRIi32
+    PRIi64
+
+    PRIiLEAST8
+    PRIiLEAST16
+    PRIiLEAST32
+    PRIiLEAST64
+
+    PRIiFAST8
+    PRIiFAST16
+    PRIiFAST32
+    PRIiFAST64
+
+    PRIiMAX
+    PRIiPTR
+
+    PRIo8
+    PRIo16
+    PRIo32
+    PRIo64
+
+    PRIoLEAST8
+    PRIoLEAST16
+    PRIoLEAST32
+    PRIoLEAST64
+
+    PRIoFAST8
+    PRIoFAST16
+    PRIoFAST32
+    PRIoFAST64
+
+    PRIoMAX
+    PRIoPTR
+
+    PRIu8
+    PRIu16
+    PRIu32
+    PRIu64
+
+    PRIuLEAST8
+    PRIuLEAST16
+    PRIuLEAST32
+    PRIuLEAST64
+
+    PRIuFAST8
+    PRIuFAST16
+    PRIuFAST32
+    PRIuFAST64
+
+    PRIuMAX
+    PRIuPTR
+
+    PRIx8
+    PRIx16
+    PRIx32
+    PRIx64
+
+    PRIxLEAST8
+    PRIxLEAST16
+    PRIxLEAST32
+    PRIxLEAST64
+
+    PRIxFAST8
+    PRIxFAST16
+    PRIxFAST32
+    PRIxFAST64
+
+    PRIxMAX
+    PRIxPTR
+
+    PRIX8
+    PRIX16
+    PRIX32
+    PRIX64
+
+    PRIXLEAST8
+    PRIXLEAST16
+    PRIXLEAST32
+    PRIXLEAST64
+
+    PRIXFAST8
+    PRIXFAST16
+    PRIXFAST32
+    PRIXFAST64
+
+    PRIXMAX
+    PRIXPTR
+
+    SCNd8
+    SCNd16
+    SCNd32
+    SCNd64
+
+    SCNdLEAST8
+    SCNdLEAST16
+    SCNdLEAST32
+    SCNdLEAST64
+
+    SCNdFAST8
+    SCNdFAST16
+    SCNdFAST32
+    SCNdFAST64
+
+    SCNdMAX
+    SCNdPTR
+
+    SCNi8
+    SCNi16
+    SCNi32
+    SCNi64
+
+    SCNiLEAST8
+    SCNiLEAST16
+    SCNiLEAST32
+    SCNiLEAST64
+
+    SCNiFAST8
+    SCNiFAST16
+    SCNiFAST32
+    SCNiFAST64
+
+    SCNiMAX
+    SCNiPTR
+
+    SCNo8
+    SCNo16
+    SCNo32
+    SCNo64
+
+    SCNoLEAST8
+    SCNoLEAST16
+    SCNoLEAST32
+    SCNoLEAST64
+
+    SCNoFAST8
+    SCNoFAST16
+    SCNoFAST32
+    SCNoFAST64
+
+    SCNoMAX
+    SCNoPTR
+
+    SCNu8
+    SCNu16
+    SCNu32
+    SCNu64
+
+    SCNuLEAST8
+    SCNuLEAST16
+    SCNuLEAST32
+    SCNuLEAST64
+
+    SCNuFAST8
+    SCNuFAST16
+    SCNuFAST32
+    SCNuFAST64
+
+    SCNuMAX
+    SCNuPTR
+
+    SCNx8
+    SCNx16
+    SCNx32
+    SCNx64
+
+    SCNxLEAST8
+    SCNxLEAST16
+    SCNxLEAST32
+    SCNxLEAST64
+
+    SCNxFAST8
+    SCNxFAST16
+    SCNxFAST32
+    SCNxFAST64
+
+    SCNxMAX
+    SCNxPTR
+
+namespace std
+{
+
+Types:
+
+    imaxdiv_t
+
+intmax_t  imaxabs(intmax_t j);
+imaxdiv_t imaxdiv(intmax_t numer, intmax_t denom);
+intmax_t  strtoimax(const char* restrict nptr, char** restrict endptr, int base);
+uintmax_t strtoumax(const char* restrict nptr, char** restrict endptr, int base);
+intmax_t  wcstoimax(const wchar_t* restrict nptr, wchar_t** restrict endptr, int base);
+uintmax_t wcstoumax(const wchar_t* restrict nptr, wchar_t** restrict endptr, int base);
+
+}  // std
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+// standard-mandated includes
+
+// [cinttypes.syn]
+#include <cstdint>
+
+#include <inttypes.h>
+
+#ifndef _LIBCPP_INTTYPES_H
+#   error <cinttypes> tried including <inttypes.h> but didn't find libc++'s <inttypes.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::imaxdiv_t _LIBCPP_USING_IF_EXISTS;
+using ::imaxabs _LIBCPP_USING_IF_EXISTS;
+using ::imaxdiv _LIBCPP_USING_IF_EXISTS;
+using ::strtoimax _LIBCPP_USING_IF_EXISTS;
+using ::strtoumax _LIBCPP_USING_IF_EXISTS;
+using ::wcstoimax _LIBCPP_USING_IF_EXISTS;
+using ::wcstoumax _LIBCPP_USING_IF_EXISTS;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CINTTYPES
diff --git a/app/src/main/cpp/libcxx/include/ciso646 b/app/src/main/cpp/libcxx/include/ciso646
new file mode 100644
index 0000000..e0cd722
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/ciso646
@@ -0,0 +1,25 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CISO646
+#define _LIBCPP_CISO646
+
+/*
+    ciso646 synopsis
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif // _LIBCPP_CISO646
diff --git a/app/src/main/cpp/libcxx/include/climits b/app/src/main/cpp/libcxx/include/climits
new file mode 100644
index 0000000..d773af5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/climits
@@ -0,0 +1,57 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CLIMITS
+#define _LIBCPP_CLIMITS
+
+/*
+    climits synopsis
+
+Macros:
+
+    CHAR_BIT
+    SCHAR_MIN
+    SCHAR_MAX
+    UCHAR_MAX
+    CHAR_MIN
+    CHAR_MAX
+    MB_LEN_MAX
+    SHRT_MIN
+    SHRT_MAX
+    USHRT_MAX
+    INT_MIN
+    INT_MAX
+    UINT_MAX
+    LONG_MIN
+    LONG_MAX
+    ULONG_MAX
+    LLONG_MIN   // C99
+    LLONG_MAX   // C99
+    ULLONG_MAX  // C99
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#include <limits.h>
+
+#ifndef _LIBCPP_LIMITS_H
+#   error <climits> tried including <limits.h> but didn't find libc++'s <limits.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif // _LIBCPP_CLIMITS
diff --git a/app/src/main/cpp/libcxx/include/clocale b/app/src/main/cpp/libcxx/include/clocale
new file mode 100644
index 0000000..e2ace35
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/clocale
@@ -0,0 +1,62 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CLOCALE
+#define _LIBCPP_CLOCALE
+
+/*
+    clocale synopsis
+
+Macros:
+
+    LC_ALL
+    LC_COLLATE
+    LC_CTYPE
+    LC_MONETARY
+    LC_NUMERIC
+    LC_TIME
+    NULL
+
+namespace std
+{
+
+struct lconv;
+char* setlocale(int category, const char* locale);
+lconv* localeconv();
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#include <locale.h>
+
+#ifndef _LIBCPP_LOCALE_H
+#   error <clocale> tried including <locale.h> but didn't find libc++'s <locale.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::lconv _LIBCPP_USING_IF_EXISTS;
+using ::setlocale _LIBCPP_USING_IF_EXISTS;
+using ::localeconv _LIBCPP_USING_IF_EXISTS;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CLOCALE
diff --git a/app/src/main/cpp/libcxx/include/cmath b/app/src/main/cpp/libcxx/include/cmath
new file mode 100644
index 0000000..a27d0eb
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cmath
@@ -0,0 +1,836 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CMATH
+#define _LIBCPP_CMATH
+
+/*
+    cmath synopsis
+
+Macros:
+
+    HUGE_VAL
+    HUGE_VALF               // C99
+    HUGE_VALL               // C99
+    INFINITY                // C99
+    NAN                     // C99
+    FP_INFINITE             // C99
+    FP_NAN                  // C99
+    FP_NORMAL               // C99
+    FP_SUBNORMAL            // C99
+    FP_ZERO                 // C99
+    FP_FAST_FMA             // C99
+    FP_FAST_FMAF            // C99
+    FP_FAST_FMAL            // C99
+    FP_ILOGB0               // C99
+    FP_ILOGBNAN             // C99
+    MATH_ERRNO              // C99
+    MATH_ERREXCEPT          // C99
+    math_errhandling        // C99
+
+namespace std
+{
+
+Types:
+
+    float_t                 // C99
+    double_t                // C99
+
+// C90
+
+floating_point abs(floating_point x);
+
+floating_point acos (arithmetic x);
+float          acosf(float x);
+long double    acosl(long double x);
+
+floating_point asin (arithmetic x);
+float          asinf(float x);
+long double    asinl(long double x);
+
+floating_point atan (arithmetic x);
+float          atanf(float x);
+long double    atanl(long double x);
+
+floating_point atan2 (arithmetic y, arithmetic x);
+float          atan2f(float y, float x);
+long double    atan2l(long double y, long double x);
+
+floating_point ceil (arithmetic x);
+float          ceilf(float x);
+long double    ceill(long double x);
+
+floating_point cos (arithmetic x);
+float          cosf(float x);
+long double    cosl(long double x);
+
+floating_point cosh (arithmetic x);
+float          coshf(float x);
+long double    coshl(long double x);
+
+floating_point exp (arithmetic x);
+float          expf(float x);
+long double    expl(long double x);
+
+floating_point fabs (arithmetic x);
+float          fabsf(float x);
+long double    fabsl(long double x);
+
+floating_point floor (arithmetic x);
+float          floorf(float x);
+long double    floorl(long double x);
+
+floating_point fmod (arithmetic x, arithmetic y);
+float          fmodf(float x, float y);
+long double    fmodl(long double x, long double y);
+
+floating_point frexp (arithmetic value, int* exp);
+float          frexpf(float value, int* exp);
+long double    frexpl(long double value, int* exp);
+
+floating_point ldexp (arithmetic value, int exp);
+float          ldexpf(float value, int exp);
+long double    ldexpl(long double value, int exp);
+
+floating_point log (arithmetic x);
+float          logf(float x);
+long double    logl(long double x);
+
+floating_point log10 (arithmetic x);
+float          log10f(float x);
+long double    log10l(long double x);
+
+floating_point modf (floating_point value, floating_point* iptr);
+float          modff(float value, float* iptr);
+long double    modfl(long double value, long double* iptr);
+
+floating_point pow (arithmetic x, arithmetic y);
+float          powf(float x, float y);
+long double    powl(long double x, long double y);
+
+floating_point sin (arithmetic x);
+float          sinf(float x);
+long double    sinl(long double x);
+
+floating_point sinh (arithmetic x);
+float          sinhf(float x);
+long double    sinhl(long double x);
+
+floating_point sqrt (arithmetic x);
+float          sqrtf(float x);
+long double    sqrtl(long double x);
+
+floating_point tan (arithmetic x);
+float          tanf(float x);
+long double    tanl(long double x);
+
+floating_point tanh (arithmetic x);
+float          tanhf(float x);
+long double    tanhl(long double x);
+
+//  C99
+
+bool signbit(arithmetic x);
+
+int fpclassify(arithmetic x);
+
+bool isfinite(arithmetic x);
+bool isinf(arithmetic x);
+bool isnan(arithmetic x);
+bool isnormal(arithmetic x);
+
+bool isgreater(arithmetic x, arithmetic y);
+bool isgreaterequal(arithmetic x, arithmetic y);
+bool isless(arithmetic x, arithmetic y);
+bool islessequal(arithmetic x, arithmetic y);
+bool islessgreater(arithmetic x, arithmetic y);
+bool isunordered(arithmetic x, arithmetic y);
+
+floating_point acosh (arithmetic x);
+float          acoshf(float x);
+long double    acoshl(long double x);
+
+floating_point asinh (arithmetic x);
+float          asinhf(float x);
+long double    asinhl(long double x);
+
+floating_point atanh (arithmetic x);
+float          atanhf(float x);
+long double    atanhl(long double x);
+
+floating_point cbrt (arithmetic x);
+float          cbrtf(float x);
+long double    cbrtl(long double x);
+
+floating_point copysign (arithmetic x, arithmetic y);
+float          copysignf(float x, float y);
+long double    copysignl(long double x, long double y);
+
+floating_point erf (arithmetic x);
+float          erff(float x);
+long double    erfl(long double x);
+
+floating_point erfc (arithmetic x);
+float          erfcf(float x);
+long double    erfcl(long double x);
+
+floating_point exp2 (arithmetic x);
+float          exp2f(float x);
+long double    exp2l(long double x);
+
+floating_point expm1 (arithmetic x);
+float          expm1f(float x);
+long double    expm1l(long double x);
+
+floating_point fdim (arithmetic x, arithmetic y);
+float          fdimf(float x, float y);
+long double    fdiml(long double x, long double y);
+
+floating_point fma (arithmetic x, arithmetic y, arithmetic z);
+float          fmaf(float x, float y, float z);
+long double    fmal(long double x, long double y, long double z);
+
+floating_point fmax (arithmetic x, arithmetic y);
+float          fmaxf(float x, float y);
+long double    fmaxl(long double x, long double y);
+
+floating_point fmin (arithmetic x, arithmetic y);
+float          fminf(float x, float y);
+long double    fminl(long double x, long double y);
+
+floating_point hypot (arithmetic x, arithmetic y);
+float          hypotf(float x, float y);
+long double    hypotl(long double x, long double y);
+
+double       hypot(double x, double y, double z);                // C++17
+float        hypot(float x, float y, float z);                   // C++17
+long double  hypot(long double x, long double y, long double z); // C++17
+
+int ilogb (arithmetic x);
+int ilogbf(float x);
+int ilogbl(long double x);
+
+floating_point lgamma (arithmetic x);
+float          lgammaf(float x);
+long double    lgammal(long double x);
+
+long long llrint (arithmetic x);
+long long llrintf(float x);
+long long llrintl(long double x);
+
+long long llround (arithmetic x);
+long long llroundf(float x);
+long long llroundl(long double x);
+
+floating_point log1p (arithmetic x);
+float          log1pf(float x);
+long double    log1pl(long double x);
+
+floating_point log2 (arithmetic x);
+float          log2f(float x);
+long double    log2l(long double x);
+
+floating_point logb (arithmetic x);
+float          logbf(float x);
+long double    logbl(long double x);
+
+long lrint (arithmetic x);
+long lrintf(float x);
+long lrintl(long double x);
+
+long lround (arithmetic x);
+long lroundf(float x);
+long lroundl(long double x);
+
+double      nan (const char* str);
+float       nanf(const char* str);
+long double nanl(const char* str);
+
+floating_point nearbyint (arithmetic x);
+float          nearbyintf(float x);
+long double    nearbyintl(long double x);
+
+floating_point nextafter (arithmetic x, arithmetic y);
+float          nextafterf(float x, float y);
+long double    nextafterl(long double x, long double y);
+
+floating_point nexttoward (arithmetic x, long double y);
+float          nexttowardf(float x, long double y);
+long double    nexttowardl(long double x, long double y);
+
+floating_point remainder (arithmetic x, arithmetic y);
+float          remainderf(float x, float y);
+long double    remainderl(long double x, long double y);
+
+floating_point remquo (arithmetic x, arithmetic y, int* pquo);
+float          remquof(float x, float y, int* pquo);
+long double    remquol(long double x, long double y, int* pquo);
+
+floating_point rint (arithmetic x);
+float          rintf(float x);
+long double    rintl(long double x);
+
+floating_point round (arithmetic x);
+float          roundf(float x);
+long double    roundl(long double x);
+
+floating_point scalbln (arithmetic x, long ex);
+float          scalblnf(float x, long ex);
+long double    scalblnl(long double x, long ex);
+
+floating_point scalbn (arithmetic x, int ex);
+float          scalbnf(float x, int ex);
+long double    scalbnl(long double x, int ex);
+
+floating_point tgamma (arithmetic x);
+float          tgammaf(float x);
+long double    tgammal(long double x);
+
+floating_point trunc (arithmetic x);
+float          truncf(float x);
+long double    truncl(long double x);
+
+constexpr float       lerp(float a, float b, float t) noexcept;                   // C++20
+constexpr double      lerp(double a, double b, double t) noexcept;                // C++20
+constexpr long double lerp(long double a, long double b, long double t) noexcept; // C++20
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_arithmetic.h>
+#include <__type_traits/is_constant_evaluated.h>
+#include <__type_traits/is_floating_point.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/remove_cv.h>
+#include <version>
+
+#include <math.h>
+
+#ifndef _LIBCPP_MATH_H
+#   error <cmath> tried including <math.h> but didn't find libc++'s <math.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::signbit _LIBCPP_USING_IF_EXISTS;
+using ::fpclassify _LIBCPP_USING_IF_EXISTS;
+using ::isfinite _LIBCPP_USING_IF_EXISTS;
+using ::isinf _LIBCPP_USING_IF_EXISTS;
+using ::isnan _LIBCPP_USING_IF_EXISTS;
+using ::isnormal _LIBCPP_USING_IF_EXISTS;
+using ::isgreater _LIBCPP_USING_IF_EXISTS;
+using ::isgreaterequal _LIBCPP_USING_IF_EXISTS;
+using ::isless _LIBCPP_USING_IF_EXISTS;
+using ::islessequal _LIBCPP_USING_IF_EXISTS;
+using ::islessgreater _LIBCPP_USING_IF_EXISTS;
+using ::isunordered _LIBCPP_USING_IF_EXISTS;
+using ::isunordered _LIBCPP_USING_IF_EXISTS;
+
+using ::float_t _LIBCPP_USING_IF_EXISTS;
+using ::double_t _LIBCPP_USING_IF_EXISTS;
+
+using ::abs _LIBCPP_USING_IF_EXISTS;
+
+using ::acos _LIBCPP_USING_IF_EXISTS;
+using ::acosf _LIBCPP_USING_IF_EXISTS;
+using ::asin _LIBCPP_USING_IF_EXISTS;
+using ::asinf _LIBCPP_USING_IF_EXISTS;
+using ::atan _LIBCPP_USING_IF_EXISTS;
+using ::atanf _LIBCPP_USING_IF_EXISTS;
+using ::atan2 _LIBCPP_USING_IF_EXISTS;
+using ::atan2f _LIBCPP_USING_IF_EXISTS;
+using ::ceil _LIBCPP_USING_IF_EXISTS;
+using ::ceilf _LIBCPP_USING_IF_EXISTS;
+using ::cos _LIBCPP_USING_IF_EXISTS;
+using ::cosf _LIBCPP_USING_IF_EXISTS;
+using ::cosh _LIBCPP_USING_IF_EXISTS;
+using ::coshf _LIBCPP_USING_IF_EXISTS;
+
+using ::exp _LIBCPP_USING_IF_EXISTS;
+using ::expf _LIBCPP_USING_IF_EXISTS;
+
+using ::fabs _LIBCPP_USING_IF_EXISTS;
+using ::fabsf _LIBCPP_USING_IF_EXISTS;
+using ::floor _LIBCPP_USING_IF_EXISTS;
+using ::floorf _LIBCPP_USING_IF_EXISTS;
+
+using ::fmod _LIBCPP_USING_IF_EXISTS;
+using ::fmodf _LIBCPP_USING_IF_EXISTS;
+
+using ::frexp _LIBCPP_USING_IF_EXISTS;
+using ::frexpf _LIBCPP_USING_IF_EXISTS;
+using ::ldexp _LIBCPP_USING_IF_EXISTS;
+using ::ldexpf _LIBCPP_USING_IF_EXISTS;
+
+using ::log _LIBCPP_USING_IF_EXISTS;
+using ::logf _LIBCPP_USING_IF_EXISTS;
+
+using ::log10 _LIBCPP_USING_IF_EXISTS;
+using ::log10f _LIBCPP_USING_IF_EXISTS;
+using ::modf _LIBCPP_USING_IF_EXISTS;
+using ::modff _LIBCPP_USING_IF_EXISTS;
+
+using ::pow _LIBCPP_USING_IF_EXISTS;
+using ::powf _LIBCPP_USING_IF_EXISTS;
+
+using ::sin _LIBCPP_USING_IF_EXISTS;
+using ::sinf _LIBCPP_USING_IF_EXISTS;
+using ::sinh _LIBCPP_USING_IF_EXISTS;
+using ::sinhf _LIBCPP_USING_IF_EXISTS;
+
+using ::sqrt _LIBCPP_USING_IF_EXISTS;
+using ::sqrtf _LIBCPP_USING_IF_EXISTS;
+using ::tan _LIBCPP_USING_IF_EXISTS;
+using ::tanf _LIBCPP_USING_IF_EXISTS;
+
+using ::tanh _LIBCPP_USING_IF_EXISTS;
+using ::tanhf _LIBCPP_USING_IF_EXISTS;
+
+using ::acosh _LIBCPP_USING_IF_EXISTS;
+using ::acoshf _LIBCPP_USING_IF_EXISTS;
+using ::asinh _LIBCPP_USING_IF_EXISTS;
+using ::asinhf _LIBCPP_USING_IF_EXISTS;
+using ::atanh _LIBCPP_USING_IF_EXISTS;
+using ::atanhf _LIBCPP_USING_IF_EXISTS;
+using ::cbrt _LIBCPP_USING_IF_EXISTS;
+using ::cbrtf _LIBCPP_USING_IF_EXISTS;
+
+using ::copysign _LIBCPP_USING_IF_EXISTS;
+using ::copysignf _LIBCPP_USING_IF_EXISTS;
+
+using ::erf _LIBCPP_USING_IF_EXISTS;
+using ::erff _LIBCPP_USING_IF_EXISTS;
+using ::erfc _LIBCPP_USING_IF_EXISTS;
+using ::erfcf _LIBCPP_USING_IF_EXISTS;
+using ::exp2 _LIBCPP_USING_IF_EXISTS;
+using ::exp2f _LIBCPP_USING_IF_EXISTS;
+using ::expm1 _LIBCPP_USING_IF_EXISTS;
+using ::expm1f _LIBCPP_USING_IF_EXISTS;
+using ::fdim _LIBCPP_USING_IF_EXISTS;
+using ::fdimf _LIBCPP_USING_IF_EXISTS;
+using ::fmaf _LIBCPP_USING_IF_EXISTS;
+using ::fma _LIBCPP_USING_IF_EXISTS;
+using ::fmax _LIBCPP_USING_IF_EXISTS;
+using ::fmaxf _LIBCPP_USING_IF_EXISTS;
+using ::fmin _LIBCPP_USING_IF_EXISTS;
+using ::fminf _LIBCPP_USING_IF_EXISTS;
+using ::hypot _LIBCPP_USING_IF_EXISTS;
+using ::hypotf _LIBCPP_USING_IF_EXISTS;
+using ::ilogb _LIBCPP_USING_IF_EXISTS;
+using ::ilogbf _LIBCPP_USING_IF_EXISTS;
+using ::lgamma _LIBCPP_USING_IF_EXISTS;
+using ::lgammaf _LIBCPP_USING_IF_EXISTS;
+using ::llrint _LIBCPP_USING_IF_EXISTS;
+using ::llrintf _LIBCPP_USING_IF_EXISTS;
+using ::llround _LIBCPP_USING_IF_EXISTS;
+using ::llroundf _LIBCPP_USING_IF_EXISTS;
+using ::log1p _LIBCPP_USING_IF_EXISTS;
+using ::log1pf _LIBCPP_USING_IF_EXISTS;
+using ::log2 _LIBCPP_USING_IF_EXISTS;
+using ::log2f _LIBCPP_USING_IF_EXISTS;
+using ::logb _LIBCPP_USING_IF_EXISTS;
+using ::logbf _LIBCPP_USING_IF_EXISTS;
+using ::lrint _LIBCPP_USING_IF_EXISTS;
+using ::lrintf _LIBCPP_USING_IF_EXISTS;
+using ::lround _LIBCPP_USING_IF_EXISTS;
+using ::lroundf _LIBCPP_USING_IF_EXISTS;
+
+using ::nan _LIBCPP_USING_IF_EXISTS;
+using ::nanf _LIBCPP_USING_IF_EXISTS;
+
+using ::nearbyint _LIBCPP_USING_IF_EXISTS;
+using ::nearbyintf _LIBCPP_USING_IF_EXISTS;
+using ::nextafter _LIBCPP_USING_IF_EXISTS;
+using ::nextafterf _LIBCPP_USING_IF_EXISTS;
+using ::nexttoward _LIBCPP_USING_IF_EXISTS;
+using ::nexttowardf _LIBCPP_USING_IF_EXISTS;
+using ::remainder _LIBCPP_USING_IF_EXISTS;
+using ::remainderf _LIBCPP_USING_IF_EXISTS;
+using ::remquo _LIBCPP_USING_IF_EXISTS;
+using ::remquof _LIBCPP_USING_IF_EXISTS;
+using ::rint _LIBCPP_USING_IF_EXISTS;
+using ::rintf _LIBCPP_USING_IF_EXISTS;
+using ::round _LIBCPP_USING_IF_EXISTS;
+using ::roundf _LIBCPP_USING_IF_EXISTS;
+using ::scalbln _LIBCPP_USING_IF_EXISTS;
+using ::scalblnf _LIBCPP_USING_IF_EXISTS;
+using ::scalbn _LIBCPP_USING_IF_EXISTS;
+using ::scalbnf _LIBCPP_USING_IF_EXISTS;
+using ::tgamma _LIBCPP_USING_IF_EXISTS;
+using ::tgammaf _LIBCPP_USING_IF_EXISTS;
+using ::trunc _LIBCPP_USING_IF_EXISTS;
+using ::truncf _LIBCPP_USING_IF_EXISTS;
+
+using ::acosl _LIBCPP_USING_IF_EXISTS;
+using ::asinl _LIBCPP_USING_IF_EXISTS;
+using ::atanl _LIBCPP_USING_IF_EXISTS;
+using ::atan2l _LIBCPP_USING_IF_EXISTS;
+using ::ceill _LIBCPP_USING_IF_EXISTS;
+using ::cosl _LIBCPP_USING_IF_EXISTS;
+using ::coshl _LIBCPP_USING_IF_EXISTS;
+using ::expl _LIBCPP_USING_IF_EXISTS;
+using ::fabsl _LIBCPP_USING_IF_EXISTS;
+using ::floorl _LIBCPP_USING_IF_EXISTS;
+using ::fmodl _LIBCPP_USING_IF_EXISTS;
+using ::frexpl _LIBCPP_USING_IF_EXISTS;
+using ::ldexpl _LIBCPP_USING_IF_EXISTS;
+using ::logl _LIBCPP_USING_IF_EXISTS;
+using ::log10l _LIBCPP_USING_IF_EXISTS;
+using ::modfl _LIBCPP_USING_IF_EXISTS;
+using ::powl _LIBCPP_USING_IF_EXISTS;
+using ::sinl _LIBCPP_USING_IF_EXISTS;
+using ::sinhl _LIBCPP_USING_IF_EXISTS;
+using ::sqrtl _LIBCPP_USING_IF_EXISTS;
+using ::tanl _LIBCPP_USING_IF_EXISTS;
+
+using ::tanhl _LIBCPP_USING_IF_EXISTS;
+using ::acoshl _LIBCPP_USING_IF_EXISTS;
+using ::asinhl _LIBCPP_USING_IF_EXISTS;
+using ::atanhl _LIBCPP_USING_IF_EXISTS;
+using ::cbrtl _LIBCPP_USING_IF_EXISTS;
+
+using ::copysignl _LIBCPP_USING_IF_EXISTS;
+
+using ::erfl _LIBCPP_USING_IF_EXISTS;
+using ::erfcl _LIBCPP_USING_IF_EXISTS;
+using ::exp2l _LIBCPP_USING_IF_EXISTS;
+using ::expm1l _LIBCPP_USING_IF_EXISTS;
+using ::fdiml _LIBCPP_USING_IF_EXISTS;
+using ::fmal _LIBCPP_USING_IF_EXISTS;
+using ::fmaxl _LIBCPP_USING_IF_EXISTS;
+using ::fminl _LIBCPP_USING_IF_EXISTS;
+using ::hypotl _LIBCPP_USING_IF_EXISTS;
+using ::ilogbl _LIBCPP_USING_IF_EXISTS;
+using ::lgammal _LIBCPP_USING_IF_EXISTS;
+using ::llrintl _LIBCPP_USING_IF_EXISTS;
+using ::llroundl _LIBCPP_USING_IF_EXISTS;
+using ::log1pl _LIBCPP_USING_IF_EXISTS;
+using ::log2l _LIBCPP_USING_IF_EXISTS;
+using ::logbl _LIBCPP_USING_IF_EXISTS;
+using ::lrintl _LIBCPP_USING_IF_EXISTS;
+using ::lroundl _LIBCPP_USING_IF_EXISTS;
+using ::nanl _LIBCPP_USING_IF_EXISTS;
+using ::nearbyintl _LIBCPP_USING_IF_EXISTS;
+using ::nextafterl _LIBCPP_USING_IF_EXISTS;
+using ::nexttowardl _LIBCPP_USING_IF_EXISTS;
+using ::remainderl _LIBCPP_USING_IF_EXISTS;
+using ::remquol _LIBCPP_USING_IF_EXISTS;
+using ::rintl _LIBCPP_USING_IF_EXISTS;
+using ::roundl _LIBCPP_USING_IF_EXISTS;
+using ::scalblnl _LIBCPP_USING_IF_EXISTS;
+using ::scalbnl _LIBCPP_USING_IF_EXISTS;
+using ::tgammal _LIBCPP_USING_IF_EXISTS;
+using ::truncl _LIBCPP_USING_IF_EXISTS;
+
+#if _LIBCPP_STD_VER > 14
+inline _LIBCPP_INLINE_VISIBILITY float       hypot(       float __x,       float __y,       float __z ) { return sqrt(__x*__x + __y*__y + __z*__z); }
+inline _LIBCPP_INLINE_VISIBILITY double      hypot(      double __x,      double __y,      double __z ) { return sqrt(__x*__x + __y*__y + __z*__z); }
+inline _LIBCPP_INLINE_VISIBILITY long double hypot( long double __x, long double __y, long double __z ) { return sqrt(__x*__x + __y*__y + __z*__z); }
+
+template <class _A1, class _A2, class _A3>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if_t
+<
+    is_arithmetic<_A1>::value &&
+    is_arithmetic<_A2>::value &&
+    is_arithmetic<_A3>::value,
+    __promote<_A1, _A2, _A3>
+>::type
+hypot(_A1 __lcpp_x, _A2 __lcpp_y, _A3 __lcpp_z) _NOEXCEPT
+{
+    typedef typename __promote<_A1, _A2, _A3>::type __result_type;
+    static_assert((!(is_same<_A1, __result_type>::value &&
+                     is_same<_A2, __result_type>::value &&
+                     is_same<_A3, __result_type>::value)), "");
+    return std::hypot((__result_type)__lcpp_x, (__result_type)__lcpp_y, (__result_type)__lcpp_z);
+}
+#endif
+
+template <class _A1>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR typename enable_if<is_floating_point<_A1>::value, bool>::type
+__constexpr_isnan(_A1 __lcpp_x) _NOEXCEPT
+{
+#if __has_builtin(__builtin_isnan)
+    return __builtin_isnan(__lcpp_x);
+#else
+    return isnan(__lcpp_x);
+#endif
+}
+
+template <class _A1>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR typename enable_if<!is_floating_point<_A1>::value, bool>::type
+__constexpr_isnan(_A1 __lcpp_x) _NOEXCEPT
+{
+    return std::isnan(__lcpp_x);
+}
+
+template <class _A1>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR typename enable_if<is_floating_point<_A1>::value, bool>::type
+__constexpr_isinf(_A1 __lcpp_x) _NOEXCEPT
+{
+#if __has_builtin(__builtin_isinf)
+    return __builtin_isinf(__lcpp_x);
+#else
+    return isinf(__lcpp_x);
+#endif
+}
+
+template <class _A1>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR typename enable_if<!is_floating_point<_A1>::value, bool>::type
+__constexpr_isinf(_A1 __lcpp_x) _NOEXCEPT
+{
+    return std::isinf(__lcpp_x);
+}
+
+template <class _A1>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR typename enable_if<is_floating_point<_A1>::value, bool>::type
+__constexpr_isfinite(_A1 __lcpp_x) _NOEXCEPT
+{
+#if __has_builtin(__builtin_isfinite)
+    return __builtin_isfinite(__lcpp_x);
+#else
+    return isfinite(__lcpp_x);
+#endif
+}
+
+template <class _A1>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR typename enable_if<!is_floating_point<_A1>::value, bool>::type
+__constexpr_isfinite(_A1 __lcpp_x) _NOEXCEPT
+{
+    return __builtin_isfinite(__lcpp_x);
+}
+
+_LIBCPP_CONSTEXPR inline _LIBCPP_HIDE_FROM_ABI float __constexpr_copysign(float __x, float __y) _NOEXCEPT {
+    return __builtin_copysignf(__x, __y);
+}
+
+_LIBCPP_CONSTEXPR inline _LIBCPP_HIDE_FROM_ABI double __constexpr_copysign(double __x, double __y) _NOEXCEPT {
+    return __builtin_copysign(__x, __y);
+}
+
+_LIBCPP_CONSTEXPR inline _LIBCPP_HIDE_FROM_ABI long double
+__constexpr_copysign(long double __x, long double __y) _NOEXCEPT {
+    return __builtin_copysignl(__x, __y);
+}
+
+template <class _A1, class _A2>
+_LIBCPP_CONSTEXPR inline _LIBCPP_HIDE_FROM_ABI
+    typename std::__enable_if_t<std::is_arithmetic<_A1>::value && std::is_arithmetic<_A2>::value,
+                                std::__promote<_A1, _A2> >::type
+    __constexpr_copysign(_A1 __x, _A2 __y) _NOEXCEPT {
+    typedef typename std::__promote<_A1, _A2>::type __result_type;
+    static_assert((!(std::_IsSame<_A1, __result_type>::value && std::_IsSame<_A2, __result_type>::value)), "");
+    return __builtin_copysign((__result_type)__x, (__result_type)__y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR float __constexpr_fabs(float __x) _NOEXCEPT {
+    return __builtin_fabsf(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR double __constexpr_fabs(double __x) _NOEXCEPT {
+    return __builtin_fabs(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR long double __constexpr_fabs(long double __x) _NOEXCEPT {
+    return __builtin_fabsl(__x);
+}
+
+template <class _Tp, __enable_if_t<is_integral<_Tp>::value, int> = 0>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR double __constexpr_fabs(_Tp __x) _NOEXCEPT {
+    return __builtin_fabs(static_cast<double>(__x));
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 float __constexpr_fmax(float __x, float __y) _NOEXCEPT {
+#if !__has_constexpr_builtin(__builtin_fmaxf)
+  if (__libcpp_is_constant_evaluated()) {
+    if (std::__constexpr_isnan(__x))
+      return __y;
+    if (std::__constexpr_isnan(__y))
+      return __x;
+    return __x < __y ? __y : __x;
+  }
+#endif
+  return __builtin_fmaxf(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 double __constexpr_fmax(double __x, double __y) _NOEXCEPT {
+#if !__has_constexpr_builtin(__builtin_fmax)
+  if (__libcpp_is_constant_evaluated()) {
+    if (std::__constexpr_isnan(__x))
+      return __y;
+    if (std::__constexpr_isnan(__y))
+      return __x;
+    return __x < __y ? __y : __x;
+  }
+#endif
+  return __builtin_fmax(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 long double
+__constexpr_fmax(long double __x, long double __y) _NOEXCEPT {
+#if !__has_constexpr_builtin(__builtin_fmaxl)
+  if (__libcpp_is_constant_evaluated()) {
+    if (std::__constexpr_isnan(__x))
+      return __y;
+    if (std::__constexpr_isnan(__y))
+      return __x;
+    return __x < __y ? __y : __x;
+  }
+#endif
+  return __builtin_fmaxl(__x, __y);
+}
+
+template <class _Tp, class _Up, __enable_if_t<is_arithmetic<_Tp>::value && is_arithmetic<_Up>::value, int> = 0>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 typename __promote<_Tp, _Up>::type
+__constexpr_fmax(_Tp __x, _Up __y) _NOEXCEPT {
+  using __result_type = typename __promote<_Tp, _Up>::type;
+  return std::__constexpr_fmax(static_cast<__result_type>(__x), static_cast<__result_type>(__y));
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp __constexpr_logb(_Tp __x) {
+#if !__has_constexpr_builtin(__builtin_logb)
+  if (__libcpp_is_constant_evaluated()) {
+    if (__x == _Tp(0)) {
+      // raise FE_DIVBYZERO
+      return -numeric_limits<_Tp>::infinity();
+    }
+
+    if (std::__constexpr_isinf(__x))
+      return numeric_limits<_Tp>::infinity();
+
+    if (std::__constexpr_isnan(__x))
+      return numeric_limits<_Tp>::quiet_NaN();
+
+    __x = std::__constexpr_fabs(__x);
+    unsigned long long __exp = 0;
+    while (__x >= numeric_limits<_Tp>::radix) {
+      __x /= numeric_limits<_Tp>::radix;
+      __exp += 1;
+    }
+    return _Tp(__exp);
+  }
+#endif // !__has_constexpr_builtin(__builtin_logb)
+  return __builtin_logb(__x);
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp __constexpr_scalbn(_Tp __x, int __exp) {
+#if !__has_constexpr_builtin(__builtin_scalbln)
+  if (__libcpp_is_constant_evaluated()) {
+    if (__x == _Tp(0))
+      return __x;
+
+    if (std::__constexpr_isinf(__x))
+      return __x;
+
+    if (__exp == _Tp(0))
+      return __x;
+
+    if (std::__constexpr_isnan(__x))
+      return numeric_limits<_Tp>::quiet_NaN();
+
+    _Tp __mult(1);
+    if (__exp > 0) {
+      __mult = numeric_limits<_Tp>::radix;
+      --__exp;
+    } else {
+      ++__exp;
+      __exp = -__exp;
+      __mult /= numeric_limits<_Tp>::radix;
+    }
+
+    while (__exp > 0) {
+      if (!(__exp & 1)) {
+        __mult *= __mult;
+        __exp >>= 1;
+      } else {
+        __x *= __mult;
+        --__exp;
+      }
+    }
+    return __x;
+  }
+#endif // !__has_constexpr_builtin(__builtin_scalbln)
+  return __builtin_scalbn(__x, __exp);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <typename _Fp>
+_LIBCPP_HIDE_FROM_ABI constexpr
+_Fp __lerp(_Fp __a, _Fp __b, _Fp __t) noexcept {
+    if ((__a <= 0 && __b >= 0) || (__a >= 0 && __b <= 0))
+        return __t * __b + (1 - __t) * __a;
+
+    if (__t == 1) return __b;
+    const _Fp __x = __a + __t * (__b - __a);
+    if ((__t > 1) == (__b > __a))
+        return __b < __x ? __x : __b;
+    else
+        return __x < __b ? __x : __b;
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr float
+lerp(float __a, float __b, float __t)                   _NOEXCEPT { return __lerp(__a, __b, __t); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr double
+lerp(double __a, double __b, double __t)                _NOEXCEPT { return __lerp(__a, __b, __t); }
+
+_LIBCPP_HIDE_FROM_ABI constexpr long double
+lerp(long double __a, long double __b, long double __t) _NOEXCEPT { return __lerp(__a, __b, __t); }
+
+template <class _A1, class _A2, class _A3>
+inline _LIBCPP_HIDE_FROM_ABI
+constexpr typename enable_if_t
+<
+    is_arithmetic<_A1>::value &&
+    is_arithmetic<_A2>::value &&
+    is_arithmetic<_A3>::value,
+    __promote<_A1, _A2, _A3>
+>::type
+lerp(_A1 __a, _A2 __b, _A3 __t) noexcept
+{
+    typedef typename __promote<_A1, _A2, _A3>::type __result_type;
+    static_assert(!(_IsSame<_A1, __result_type>::value &&
+                    _IsSame<_A2, __result_type>::value &&
+                    _IsSame<_A3, __result_type>::value));
+    return std::__lerp((__result_type)__a, (__result_type)__b, (__result_type)__t);
+}
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_CMATH
diff --git a/app/src/main/cpp/libcxx/include/codecvt b/app/src/main/cpp/libcxx/include/codecvt
new file mode 100644
index 0000000..ce378c8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/codecvt
@@ -0,0 +1,571 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CODECVT
+#define _LIBCPP_CODECVT
+
+/*
+    codecvt synopsis
+
+namespace std
+{
+
+enum codecvt_mode
+{
+    consume_header = 4,
+    generate_header = 2,
+    little_endian = 1
+};
+
+template <class Elem, unsigned long Maxcode = 0x10ffff,
+          codecvt_mode Mode = (codecvt_mode)0>
+class codecvt_utf8
+    : public codecvt<Elem, char, mbstate_t>
+{
+    explicit codecvt_utf8(size_t refs = 0);
+    ~codecvt_utf8();
+};
+
+template <class Elem, unsigned long Maxcode = 0x10ffff,
+          codecvt_mode Mode = (codecvt_mode)0>
+class codecvt_utf16
+    : public codecvt<Elem, char, mbstate_t>
+{
+    explicit codecvt_utf16(size_t refs = 0);
+    ~codecvt_utf16();
+};
+
+template <class Elem, unsigned long Maxcode = 0x10ffff,
+          codecvt_mode Mode = (codecvt_mode)0>
+class codecvt_utf8_utf16
+    : public codecvt<Elem, char, mbstate_t>
+{
+    explicit codecvt_utf8_utf16(size_t refs = 0);
+    ~codecvt_utf8_utf16();
+};
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__locale>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+enum _LIBCPP_DEPRECATED_IN_CXX17 codecvt_mode
+{
+    consume_header = 4,
+    generate_header = 2,
+    little_endian = 1
+};
+
+// codecvt_utf8
+
+template <class _Elem> class __codecvt_utf8;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+class _LIBCPP_TYPE_VIS __codecvt_utf8<wchar_t>
+    : public codecvt<wchar_t, char, mbstate_t>
+{
+    unsigned long __maxcode_;
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    codecvt_mode __mode_;
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+public:
+    typedef wchar_t   intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __codecvt_utf8(size_t __refs, unsigned long __maxcode,
+                            codecvt_mode __mode)
+        : codecvt<wchar_t, char, mbstate_t>(__refs), __maxcode_(__maxcode),
+          __mode_(__mode) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+protected:
+    result do_out(state_type& __st,
+                  const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                  extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+    result do_in(state_type& __st,
+                 const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                 intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const override;
+    result do_unshift(state_type& __st,
+                      extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+    int do_encoding() const _NOEXCEPT override;
+    bool do_always_noconv() const _NOEXCEPT override;
+    int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const override;
+    int do_max_length() const _NOEXCEPT override;
+};
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <>
+class _LIBCPP_TYPE_VIS __codecvt_utf8<char16_t>
+    : public codecvt<char16_t, char, mbstate_t>
+{
+    unsigned long __maxcode_;
+    codecvt_mode __mode_;
+public:
+    typedef char16_t  intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __codecvt_utf8(size_t __refs, unsigned long __maxcode,
+                            codecvt_mode __mode)
+        : codecvt<char16_t, char, mbstate_t>(__refs), __maxcode_(__maxcode),
+          __mode_(__mode) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+protected:
+     result do_out(state_type& __st,
+                   const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     result do_in(state_type& __st,
+                  const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                  intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const override;
+     result do_unshift(state_type& __st,
+                       extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     int do_encoding() const _NOEXCEPT override;
+     bool do_always_noconv() const _NOEXCEPT override;
+     int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const override;
+     int do_max_length() const _NOEXCEPT override;
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <>
+class _LIBCPP_TYPE_VIS __codecvt_utf8<char32_t>
+    : public codecvt<char32_t, char, mbstate_t>
+{
+    unsigned long __maxcode_;
+    codecvt_mode __mode_;
+public:
+    typedef char32_t  intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __codecvt_utf8(size_t __refs, unsigned long __maxcode,
+                            codecvt_mode __mode)
+        : codecvt<char32_t, char, mbstate_t>(__refs), __maxcode_(__maxcode),
+          __mode_(__mode) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+protected:
+     result do_out(state_type& __st,
+                   const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     result do_in(state_type& __st,
+                  const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                  intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const override;
+     result do_unshift(state_type& __st,
+                       extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     int do_encoding() const _NOEXCEPT override;
+     bool do_always_noconv() const _NOEXCEPT override;
+     int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const override;
+     int do_max_length() const _NOEXCEPT override;
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Elem, unsigned long _Maxcode = 0x10ffff,
+          codecvt_mode _Mode = (codecvt_mode)0>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX17 codecvt_utf8
+    : public __codecvt_utf8<_Elem>
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt_utf8(size_t __refs = 0)
+        : __codecvt_utf8<_Elem>(__refs, _Maxcode, _Mode) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~codecvt_utf8() {}
+};
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+// codecvt_utf16
+
+template <class _Elem, bool _LittleEndian> class __codecvt_utf16;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+class _LIBCPP_TYPE_VIS __codecvt_utf16<wchar_t, false>
+    : public codecvt<wchar_t, char, mbstate_t>
+{
+    unsigned long __maxcode_;
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    codecvt_mode __mode_;
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+public:
+    typedef wchar_t   intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __codecvt_utf16(size_t __refs, unsigned long __maxcode,
+                            codecvt_mode __mode)
+        : codecvt<wchar_t, char, mbstate_t>(__refs), __maxcode_(__maxcode),
+          __mode_(__mode) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+protected:
+     result do_out(state_type& __st,
+                   const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     result do_in(state_type& __st,
+                  const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                  intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const override;
+     result do_unshift(state_type& __st,
+                       extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     int do_encoding() const _NOEXCEPT override;
+     bool do_always_noconv() const _NOEXCEPT override;
+     int do_length(state_type&, const extern_type* __frm, const extern_type* __end,
+                          size_t __mx) const override;
+     int do_max_length() const _NOEXCEPT override;
+};
+
+template <>
+class _LIBCPP_TYPE_VIS __codecvt_utf16<wchar_t, true>
+    : public codecvt<wchar_t, char, mbstate_t>
+{
+    unsigned long __maxcode_;
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    codecvt_mode __mode_;
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+public:
+    typedef wchar_t   intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __codecvt_utf16(size_t __refs, unsigned long __maxcode,
+                            codecvt_mode __mode)
+        : codecvt<wchar_t, char, mbstate_t>(__refs), __maxcode_(__maxcode),
+          __mode_(__mode) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+protected:
+     result do_out(state_type& __st,
+                   const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     result do_in(state_type& __st,
+                  const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                  intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const override;
+     result do_unshift(state_type& __st,
+                       extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     int do_encoding() const _NOEXCEPT override;
+     bool do_always_noconv() const _NOEXCEPT override;
+     int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const override;
+     int do_max_length() const _NOEXCEPT override;
+};
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <>
+class _LIBCPP_TYPE_VIS __codecvt_utf16<char16_t, false>
+    : public codecvt<char16_t, char, mbstate_t>
+{
+    unsigned long __maxcode_;
+    codecvt_mode __mode_;
+public:
+    typedef char16_t  intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __codecvt_utf16(size_t __refs, unsigned long __maxcode,
+                            codecvt_mode __mode)
+        : codecvt<char16_t, char, mbstate_t>(__refs), __maxcode_(__maxcode),
+          __mode_(__mode) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+protected:
+     result do_out(state_type& __st,
+                   const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     result do_in(state_type& __st,
+                  const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                  intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const override;
+     result do_unshift(state_type& __st,
+                       extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     int do_encoding() const _NOEXCEPT override;
+     bool do_always_noconv() const _NOEXCEPT override;
+     int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const override;
+     int do_max_length() const _NOEXCEPT override;
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <>
+class _LIBCPP_TYPE_VIS __codecvt_utf16<char16_t, true>
+    : public codecvt<char16_t, char, mbstate_t>
+{
+    unsigned long __maxcode_;
+    codecvt_mode __mode_;
+public:
+    typedef char16_t  intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __codecvt_utf16(size_t __refs, unsigned long __maxcode,
+                            codecvt_mode __mode)
+        : codecvt<char16_t, char, mbstate_t>(__refs), __maxcode_(__maxcode),
+          __mode_(__mode) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+protected:
+     result do_out(state_type& __st,
+                   const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     result do_in(state_type& __st,
+                  const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                  intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const override;
+     result do_unshift(state_type& __st,
+                       extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     int do_encoding() const _NOEXCEPT override;
+     bool do_always_noconv() const _NOEXCEPT override;
+     int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const override;
+     int do_max_length() const _NOEXCEPT override;
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <>
+class _LIBCPP_TYPE_VIS __codecvt_utf16<char32_t, false>
+    : public codecvt<char32_t, char, mbstate_t>
+{
+    unsigned long __maxcode_;
+    codecvt_mode __mode_;
+public:
+    typedef char32_t  intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __codecvt_utf16(size_t __refs, unsigned long __maxcode,
+                            codecvt_mode __mode)
+        : codecvt<char32_t, char, mbstate_t>(__refs), __maxcode_(__maxcode),
+          __mode_(__mode) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+protected:
+     result do_out(state_type& __st,
+                   const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     result do_in(state_type& __st,
+                  const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                  intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const override;
+     result do_unshift(state_type& __st,
+                       extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     int do_encoding() const _NOEXCEPT override;
+     bool do_always_noconv() const _NOEXCEPT override;
+     int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const override;
+     int do_max_length() const _NOEXCEPT override;
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <>
+class _LIBCPP_TYPE_VIS __codecvt_utf16<char32_t, true>
+    : public codecvt<char32_t, char, mbstate_t>
+{
+    unsigned long __maxcode_;
+    codecvt_mode __mode_;
+public:
+    typedef char32_t  intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __codecvt_utf16(size_t __refs, unsigned long __maxcode,
+                            codecvt_mode __mode)
+        : codecvt<char32_t, char, mbstate_t>(__refs), __maxcode_(__maxcode),
+          __mode_(__mode) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+protected:
+     result do_out(state_type& __st,
+                   const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     result do_in(state_type& __st,
+                  const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                  intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const override;
+     result do_unshift(state_type& __st,
+                       extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     int do_encoding() const _NOEXCEPT override;
+     bool do_always_noconv() const _NOEXCEPT override;
+     int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const override;
+     int do_max_length() const _NOEXCEPT override;
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Elem, unsigned long _Maxcode = 0x10ffff,
+          codecvt_mode _Mode = (codecvt_mode)0>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX17 codecvt_utf16
+    : public __codecvt_utf16<_Elem, _Mode & little_endian>
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt_utf16(size_t __refs = 0)
+        : __codecvt_utf16<_Elem, _Mode & little_endian>(__refs, _Maxcode, _Mode) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~codecvt_utf16() {}
+};
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+// codecvt_utf8_utf16
+
+template <class _Elem> class __codecvt_utf8_utf16;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+class _LIBCPP_TYPE_VIS __codecvt_utf8_utf16<wchar_t>
+    : public codecvt<wchar_t, char, mbstate_t>
+{
+    unsigned long __maxcode_;
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    codecvt_mode __mode_;
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+public:
+    typedef wchar_t   intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __codecvt_utf8_utf16(size_t __refs, unsigned long __maxcode,
+                            codecvt_mode __mode)
+        : codecvt<wchar_t, char, mbstate_t>(__refs), __maxcode_(__maxcode),
+          __mode_(__mode) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+protected:
+     result do_out(state_type& __st,
+                   const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     result do_in(state_type& __st,
+                  const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                  intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const override;
+     result do_unshift(state_type& __st,
+                       extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     int do_encoding() const _NOEXCEPT override;
+     bool do_always_noconv() const _NOEXCEPT override;
+     int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const override;
+     int do_max_length() const _NOEXCEPT override;
+};
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <>
+class _LIBCPP_TYPE_VIS __codecvt_utf8_utf16<char32_t>
+    : public codecvt<char32_t, char, mbstate_t>
+{
+    unsigned long __maxcode_;
+    codecvt_mode __mode_;
+public:
+    typedef char32_t  intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __codecvt_utf8_utf16(size_t __refs, unsigned long __maxcode,
+                            codecvt_mode __mode)
+        : codecvt<char32_t, char, mbstate_t>(__refs), __maxcode_(__maxcode),
+          __mode_(__mode) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+protected:
+     result do_out(state_type& __st,
+                   const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     result do_in(state_type& __st,
+                  const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                  intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const override;
+     result do_unshift(state_type& __st,
+                       extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     int do_encoding() const _NOEXCEPT override;
+     bool do_always_noconv() const _NOEXCEPT override;
+     int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const override;
+     int do_max_length() const _NOEXCEPT override;
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <>
+class _LIBCPP_TYPE_VIS __codecvt_utf8_utf16<char16_t>
+    : public codecvt<char16_t, char, mbstate_t>
+{
+    unsigned long __maxcode_;
+    codecvt_mode __mode_;
+public:
+    typedef char16_t  intern_type;
+    typedef char      extern_type;
+    typedef mbstate_t state_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __codecvt_utf8_utf16(size_t __refs, unsigned long __maxcode,
+                            codecvt_mode __mode)
+        : codecvt<char16_t, char, mbstate_t>(__refs), __maxcode_(__maxcode),
+          __mode_(__mode) {}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+protected:
+     result do_out(state_type& __st,
+                   const intern_type* __frm, const intern_type* __frm_end, const intern_type*& __frm_nxt,
+                   extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     result do_in(state_type& __st,
+                  const extern_type* __frm, const extern_type* __frm_end, const extern_type*& __frm_nxt,
+                  intern_type* __to, intern_type* __to_end, intern_type*& __to_nxt) const override;
+     result do_unshift(state_type& __st,
+                       extern_type* __to, extern_type* __to_end, extern_type*& __to_nxt) const override;
+     int do_encoding() const _NOEXCEPT override;
+     bool do_always_noconv() const _NOEXCEPT override;
+     int do_length(state_type&, const extern_type* __frm, const extern_type* __end, size_t __mx) const override;
+     int do_max_length() const _NOEXCEPT override;
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Elem, unsigned long _Maxcode = 0x10ffff,
+          codecvt_mode _Mode = (codecvt_mode)0>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX17 codecvt_utf8_utf16
+    : public __codecvt_utf8_utf16<_Elem>
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit codecvt_utf8_utf16(size_t __refs = 0)
+        : __codecvt_utf8_utf16<_Elem>(__refs, _Maxcode, _Mode) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~codecvt_utf8_utf16() {}
+};
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <atomic>
+#  include <concepts>
+#  include <cstddef>
+#  include <cstdlib>
+#  include <cstring>
+#  include <initializer_list>
+#  include <iosfwd>
+#  include <limits>
+#  include <new>
+#  include <stdexcept>
+#  include <type_traits>
+#  include <typeinfo>
+#endif
+
+#endif // _LIBCPP_CODECVT
diff --git a/app/src/main/cpp/libcxx/include/compare b/app/src/main/cpp/libcxx/include/compare
new file mode 100644
index 0000000..9272dbf
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/compare
@@ -0,0 +1,167 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_COMPARE
+#define _LIBCPP_COMPARE
+
+/*
+    compare synopsis
+
+namespace std {
+  // [cmp.categories], comparison category types
+  class partial_ordering;
+  class weak_ordering;
+  class strong_ordering;
+
+  // named comparison functions
+  constexpr bool is_eq  (partial_ordering cmp) noexcept { return cmp == 0; }
+  constexpr bool is_neq (partial_ordering cmp) noexcept { return cmp != 0; }
+  constexpr bool is_lt  (partial_ordering cmp) noexcept { return cmp < 0; }
+  constexpr bool is_lteq(partial_ordering cmp) noexcept { return cmp <= 0; }
+  constexpr bool is_gt  (partial_ordering cmp) noexcept { return cmp > 0; }
+  constexpr bool is_gteq(partial_ordering cmp) noexcept { return cmp >= 0; }
+
+  // [cmp.common], common comparison category type
+  template<class... Ts>
+  struct common_comparison_category {
+    using type = see below;
+  };
+  template<class... Ts>
+    using common_comparison_category_t = typename common_comparison_category<Ts...>::type;
+
+  // [cmp.concept], concept three_way_comparable
+  template<class T, class Cat = partial_ordering>
+    concept three_way_comparable = see below;
+  template<class T, class U, class Cat = partial_ordering>
+    concept three_way_comparable_with = see below;
+
+  // [cmp.result], result of three-way comparison
+  template<class T, class U = T> struct compare_three_way_result;
+
+  template<class T, class U = T>
+    using compare_three_way_result_t = typename compare_three_way_result<T, U>::type;
+
+  // [comparisons.three.way], class compare_three_way
+  struct compare_three_way; // C++20
+
+  // [cmp.alg], comparison algorithms
+  inline namespace unspecified {
+    inline constexpr unspecified strong_order = unspecified;
+    inline constexpr unspecified weak_order = unspecified;
+    inline constexpr unspecified partial_order = unspecified;
+    inline constexpr unspecified compare_strong_order_fallback = unspecified;
+    inline constexpr unspecified compare_weak_order_fallback = unspecified;
+    inline constexpr unspecified compare_partial_order_fallback = unspecified;
+  }
+
+  // [cmp.partialord], Class partial_ordering
+  class partial_ordering {
+  public:
+    // valid values
+    static const partial_ordering less;
+    static const partial_ordering equivalent;
+    static const partial_ordering greater;
+    static const partial_ordering unordered;
+
+    // comparisons
+    friend constexpr bool operator==(partial_ordering v, unspecified) noexcept;
+    friend constexpr bool operator==(partial_ordering v, partial_ordering w) noexcept = default;
+    friend constexpr bool operator< (partial_ordering v, unspecified) noexcept;
+    friend constexpr bool operator> (partial_ordering v, unspecified) noexcept;
+    friend constexpr bool operator<=(partial_ordering v, unspecified) noexcept;
+    friend constexpr bool operator>=(partial_ordering v, unspecified) noexcept;
+    friend constexpr bool operator< (unspecified, partial_ordering v) noexcept;
+    friend constexpr bool operator> (unspecified, partial_ordering v) noexcept;
+    friend constexpr bool operator<=(unspecified, partial_ordering v) noexcept;
+    friend constexpr bool operator>=(unspecified, partial_ordering v) noexcept;
+    friend constexpr partial_ordering operator<=>(partial_ordering v, unspecified) noexcept;
+    friend constexpr partial_ordering operator<=>(unspecified, partial_ordering v) noexcept;
+  };
+
+  // [cmp.weakord], Class weak_ordering
+  class weak_ordering {
+  public:
+    // valid values
+    static const weak_ordering less;
+    static const weak_ordering equivalent;
+    static const weak_ordering greater;
+
+    // conversions
+    constexpr operator partial_ordering() const noexcept;
+
+    // comparisons
+    friend constexpr bool operator==(weak_ordering v, unspecified) noexcept;
+    friend constexpr bool operator==(weak_ordering v, weak_ordering w) noexcept = default;
+    friend constexpr bool operator< (weak_ordering v, unspecified) noexcept;
+    friend constexpr bool operator> (weak_ordering v, unspecified) noexcept;
+    friend constexpr bool operator<=(weak_ordering v, unspecified) noexcept;
+    friend constexpr bool operator>=(weak_ordering v, unspecified) noexcept;
+    friend constexpr bool operator< (unspecified, weak_ordering v) noexcept;
+    friend constexpr bool operator> (unspecified, weak_ordering v) noexcept;
+    friend constexpr bool operator<=(unspecified, weak_ordering v) noexcept;
+    friend constexpr bool operator>=(unspecified, weak_ordering v) noexcept;
+    friend constexpr weak_ordering operator<=>(weak_ordering v, unspecified) noexcept;
+    friend constexpr weak_ordering operator<=>(unspecified, weak_ordering v) noexcept;
+  };
+
+  // [cmp.strongord], Class strong_ordering
+  class strong_ordering {
+  public:
+    // valid values
+    static const strong_ordering less;
+    static const strong_ordering equal;
+    static const strong_ordering equivalent;
+    static const strong_ordering greater;
+
+    // conversions
+    constexpr operator partial_ordering() const noexcept;
+    constexpr operator weak_ordering() const noexcept;
+
+    // comparisons
+    friend constexpr bool operator==(strong_ordering v, unspecified) noexcept;
+    friend constexpr bool operator==(strong_ordering v, strong_ordering w) noexcept = default;
+    friend constexpr bool operator< (strong_ordering v, unspecified) noexcept;
+    friend constexpr bool operator> (strong_ordering v, unspecified) noexcept;
+    friend constexpr bool operator<=(strong_ordering v, unspecified) noexcept;
+    friend constexpr bool operator>=(strong_ordering v, unspecified) noexcept;
+    friend constexpr bool operator< (unspecified, strong_ordering v) noexcept;
+    friend constexpr bool operator> (unspecified, strong_ordering v) noexcept;
+    friend constexpr bool operator<=(unspecified, strong_ordering v) noexcept;
+    friend constexpr bool operator>=(unspecified, strong_ordering v) noexcept;
+    friend constexpr strong_ordering operator<=>(strong_ordering v, unspecified) noexcept;
+    friend constexpr strong_ordering operator<=>(unspecified, strong_ordering v) noexcept;
+  };
+}
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__compare/common_comparison_category.h>
+#include <__compare/compare_partial_order_fallback.h>
+#include <__compare/compare_strong_order_fallback.h>
+#include <__compare/compare_three_way.h>
+#include <__compare/compare_three_way_result.h>
+#include <__compare/compare_weak_order_fallback.h>
+#include <__compare/is_eq.h>
+#include <__compare/ordering.h>
+#include <__compare/partial_order.h>
+#include <__compare/strong_order.h>
+#include <__compare/three_way_comparable.h>
+#include <__compare/weak_order.h>
+#include <__config>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_COMPARE
diff --git a/app/src/main/cpp/libcxx/include/complex b/app/src/main/cpp/libcxx/include/complex
new file mode 100644
index 0000000..760fbaa
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/complex
@@ -0,0 +1,1568 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_COMPLEX
+#define _LIBCPP_COMPLEX
+
+/*
+    complex synopsis
+
+namespace std
+{
+
+template<class T>
+class complex
+{
+public:
+    typedef T value_type;
+
+    complex(const T& re = T(), const T& im = T()); // constexpr in C++14
+    complex(const complex&);  // constexpr in C++14
+    template<class X> complex(const complex<X>&);  // constexpr in C++14
+
+    T real() const; // constexpr in C++14
+    T imag() const; // constexpr in C++14
+
+    void real(T); // constexpr in C++20
+    void imag(T); // constexpr in C++20
+
+    complex<T>& operator= (const T&); // constexpr in C++20
+    complex<T>& operator+=(const T&); // constexpr in C++20
+    complex<T>& operator-=(const T&); // constexpr in C++20
+    complex<T>& operator*=(const T&); // constexpr in C++20
+    complex<T>& operator/=(const T&); // constexpr in C++20
+
+    complex& operator=(const complex&); // constexpr in C++20
+    template<class X> complex<T>& operator= (const complex<X>&); // constexpr in C++20
+    template<class X> complex<T>& operator+=(const complex<X>&); // constexpr in C++20
+    template<class X> complex<T>& operator-=(const complex<X>&); // constexpr in C++20
+    template<class X> complex<T>& operator*=(const complex<X>&); // constexpr in C++20
+    template<class X> complex<T>& operator/=(const complex<X>&); // constexpr in C++20
+};
+
+template<>
+class complex<float>
+{
+public:
+    typedef float value_type;
+
+    constexpr complex(float re = 0.0f, float im = 0.0f);
+    explicit constexpr complex(const complex<double>&);
+    explicit constexpr complex(const complex<long double>&);
+
+    constexpr float real() const;
+    void real(float); // constexpr in C++20
+    constexpr float imag() const;
+    void imag(float); // constexpr in C++20
+
+    complex<float>& operator= (float); // constexpr in C++20
+    complex<float>& operator+=(float); // constexpr in C++20
+    complex<float>& operator-=(float); // constexpr in C++20
+    complex<float>& operator*=(float); // constexpr in C++20
+    complex<float>& operator/=(float); // constexpr in C++20
+
+    complex<float>& operator=(const complex<float>&); // constexpr in C++20
+    template<class X> complex<float>& operator= (const complex<X>&); // constexpr in C++20
+    template<class X> complex<float>& operator+=(const complex<X>&); // constexpr in C++20
+    template<class X> complex<float>& operator-=(const complex<X>&); // constexpr in C++20
+    template<class X> complex<float>& operator*=(const complex<X>&); // constexpr in C++20
+    template<class X> complex<float>& operator/=(const complex<X>&); // constexpr in C++20
+};
+
+template<>
+class complex<double>
+{
+public:
+    typedef double value_type;
+
+    constexpr complex(double re = 0.0, double im = 0.0);
+    constexpr complex(const complex<float>&);
+    explicit constexpr complex(const complex<long double>&);
+
+    constexpr double real() const;
+    void real(double); // constexpr in C++20
+    constexpr double imag() const;
+    void imag(double); // constexpr in C++20
+
+    complex<double>& operator= (double); // constexpr in C++20
+    complex<double>& operator+=(double); // constexpr in C++20
+    complex<double>& operator-=(double); // constexpr in C++20
+    complex<double>& operator*=(double); // constexpr in C++20
+    complex<double>& operator/=(double); // constexpr in C++20
+    complex<double>& operator=(const complex<double>&); // constexpr in C++20
+
+    template<class X> complex<double>& operator= (const complex<X>&); // constexpr in C++20
+    template<class X> complex<double>& operator+=(const complex<X>&); // constexpr in C++20
+    template<class X> complex<double>& operator-=(const complex<X>&); // constexpr in C++20
+    template<class X> complex<double>& operator*=(const complex<X>&); // constexpr in C++20
+    template<class X> complex<double>& operator/=(const complex<X>&); // constexpr in C++20
+};
+
+template<>
+class complex<long double>
+{
+public:
+    typedef long double value_type;
+
+    constexpr complex(long double re = 0.0L, long double im = 0.0L);
+    constexpr complex(const complex<float>&);
+    constexpr complex(const complex<double>&);
+
+    constexpr long double real() const;
+    void real(long double); // constexpr in C++20
+    constexpr long double imag() const;
+    void imag(long double); // constexpr in C++20
+
+    complex<long double>& operator=(const complex<long double>&); // constexpr in C++20
+    complex<long double>& operator= (long double); // constexpr in C++20
+    complex<long double>& operator+=(long double); // constexpr in C++20
+    complex<long double>& operator-=(long double); // constexpr in C++20
+    complex<long double>& operator*=(long double); // constexpr in C++20
+    complex<long double>& operator/=(long double); // constexpr in C++20
+
+    template<class X> complex<long double>& operator= (const complex<X>&); // constexpr in C++20
+    template<class X> complex<long double>& operator+=(const complex<X>&); // constexpr in C++20
+    template<class X> complex<long double>& operator-=(const complex<X>&); // constexpr in C++20
+    template<class X> complex<long double>& operator*=(const complex<X>&); // constexpr in C++20
+    template<class X> complex<long double>& operator/=(const complex<X>&); // constexpr in C++20
+};
+
+// 26.3.6 operators:
+template<class T> complex<T> operator+(const complex<T>&, const complex<T>&); // constexpr in C++20
+template<class T> complex<T> operator+(const complex<T>&, const T&);          // constexpr in C++20
+template<class T> complex<T> operator+(const T&, const complex<T>&);          // constexpr in C++20
+template<class T> complex<T> operator-(const complex<T>&, const complex<T>&); // constexpr in C++20
+template<class T> complex<T> operator-(const complex<T>&, const T&);          // constexpr in C++20
+template<class T> complex<T> operator-(const T&, const complex<T>&);          // constexpr in C++20
+template<class T> complex<T> operator*(const complex<T>&, const complex<T>&); // constexpr in C++20
+template<class T> complex<T> operator*(const complex<T>&, const T&);          // constexpr in C++20
+template<class T> complex<T> operator*(const T&, const complex<T>&);          // constexpr in C++20
+template<class T> complex<T> operator/(const complex<T>&, const complex<T>&); // constexpr in C++20
+template<class T> complex<T> operator/(const complex<T>&, const T&);          // constexpr in C++20
+template<class T> complex<T> operator/(const T&, const complex<T>&);          // constexpr in C++20
+template<class T> complex<T> operator+(const complex<T>&);                    // constexpr in C++20
+template<class T> complex<T> operator-(const complex<T>&);                    // constexpr in C++20
+template<class T> bool operator==(const complex<T>&, const complex<T>&); // constexpr in C++14
+template<class T> bool operator==(const complex<T>&, const T&); // constexpr in C++14
+template<class T> bool operator==(const T&, const complex<T>&); // constexpr in C++14
+template<class T> bool operator!=(const complex<T>&, const complex<T>&); // constexpr in C++14
+template<class T> bool operator!=(const complex<T>&, const T&); // constexpr in C++14
+template<class T> bool operator!=(const T&, const complex<T>&); // constexpr in C++14
+
+template<class T, class charT, class traits>
+  basic_istream<charT, traits>&
+  operator>>(basic_istream<charT, traits>&, complex<T>&);
+template<class T, class charT, class traits>
+  basic_ostream<charT, traits>&
+  operator<<(basic_ostream<charT, traits>&, const complex<T>&);
+
+// 26.3.7 values:
+
+template<class T>              T real(const complex<T>&); // constexpr in C++14
+                     long double real(long double);       // constexpr in C++14
+                          double real(double);            // constexpr in C++14
+template<Integral T>      double real(T);                 // constexpr in C++14
+                          float  real(float);             // constexpr in C++14
+
+template<class T>              T imag(const complex<T>&); // constexpr in C++14
+                     long double imag(long double);       // constexpr in C++14
+                          double imag(double);            // constexpr in C++14
+template<Integral T>      double imag(T);                 // constexpr in C++14
+                          float  imag(float);             // constexpr in C++14
+
+template<class T> T abs(const complex<T>&);
+
+template<class T>              T arg(const complex<T>&);
+                     long double arg(long double);
+                          double arg(double);
+template<Integral T>      double arg(T);
+                          float  arg(float);
+
+template<class T>              T norm(const complex<T>&); // constexpr in C++20
+                     long double norm(long double);       // constexpr in C++20
+                          double norm(double);            // constexpr in C++20
+template<Integral T>      double norm(T);                 // constexpr in C++20
+                          float  norm(float);             // constexpr in C++20
+
+template<class T>      complex<T>           conj(const complex<T>&); // constexpr in C++20
+                       complex<long double> conj(long double);       // constexpr in C++20
+                       complex<double>      conj(double);            // constexpr in C++20
+template<Integral T>   complex<double>      conj(T);                 // constexpr in C++20
+                       complex<float>       conj(float);             // constexpr in C++20
+
+template<class T>    complex<T>           proj(const complex<T>&);
+                     complex<long double> proj(long double);
+                     complex<double>      proj(double);
+template<Integral T> complex<double>      proj(T);
+                     complex<float>       proj(float);
+
+template<class T> complex<T> polar(const T&, const T& = T());
+
+// 26.3.8 transcendentals:
+template<class T> complex<T> acos(const complex<T>&);
+template<class T> complex<T> asin(const complex<T>&);
+template<class T> complex<T> atan(const complex<T>&);
+template<class T> complex<T> acosh(const complex<T>&);
+template<class T> complex<T> asinh(const complex<T>&);
+template<class T> complex<T> atanh(const complex<T>&);
+template<class T> complex<T> cos (const complex<T>&);
+template<class T> complex<T> cosh (const complex<T>&);
+template<class T> complex<T> exp (const complex<T>&);
+template<class T> complex<T> log (const complex<T>&);
+template<class T> complex<T> log10(const complex<T>&);
+
+template<class T> complex<T> pow(const complex<T>&, const T&);
+template<class T> complex<T> pow(const complex<T>&, const complex<T>&);
+template<class T> complex<T> pow(const T&, const complex<T>&);
+
+template<class T> complex<T> sin (const complex<T>&);
+template<class T> complex<T> sinh (const complex<T>&);
+template<class T> complex<T> sqrt (const complex<T>&);
+template<class T> complex<T> tan (const complex<T>&);
+template<class T> complex<T> tanh (const complex<T>&);
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <cmath>
+#include <iosfwd>
+#include <stdexcept>
+#include <type_traits>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_LOCALIZATION)
+#   include <sstream> // for std::basic_ostringstream
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Tp> class _LIBCPP_TEMPLATE_VIS complex;
+
+template<class _Tp> _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 complex<_Tp> operator*(const complex<_Tp>& __z, const complex<_Tp>& __w);
+template<class _Tp> _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 complex<_Tp> operator/(const complex<_Tp>& __x, const complex<_Tp>& __y);
+
+template<class _Tp>
+class _LIBCPP_TEMPLATE_VIS complex
+{
+public:
+    typedef _Tp value_type;
+private:
+    value_type __re_;
+    value_type __im_;
+public:
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    complex(const value_type& __re = value_type(), const value_type& __im = value_type())
+        : __re_(__re), __im_(__im) {}
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    complex(const complex<_Xp>& __c)
+        : __re_(__c.real()), __im_(__c.imag()) {}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14 value_type real() const {return __re_;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14 value_type imag() const {return __im_;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 void real(value_type __re) {__re_ = __re;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 void imag(value_type __im) {__im_ = __im;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator= (const value_type& __re)
+        {__re_ = __re; __im_ = value_type(); return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator+=(const value_type& __re) {__re_ += __re; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator-=(const value_type& __re) {__re_ -= __re; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator*=(const value_type& __re) {__re_ *= __re; __im_ *= __re; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator/=(const value_type& __re) {__re_ /= __re; __im_ /= __re; return *this;}
+
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator= (const complex<_Xp>& __c)
+        {
+            __re_ = __c.real();
+            __im_ = __c.imag();
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator+=(const complex<_Xp>& __c)
+        {
+            __re_ += __c.real();
+            __im_ += __c.imag();
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator-=(const complex<_Xp>& __c)
+        {
+            __re_ -= __c.real();
+            __im_ -= __c.imag();
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator*=(const complex<_Xp>& __c)
+        {
+            *this = *this * complex(__c.real(), __c.imag());
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator/=(const complex<_Xp>& __c)
+        {
+            *this = *this / complex(__c.real(), __c.imag());
+            return *this;
+        }
+};
+
+template<> class _LIBCPP_TEMPLATE_VIS complex<double>;
+template<> class _LIBCPP_TEMPLATE_VIS complex<long double>;
+
+template<>
+class _LIBCPP_TEMPLATE_VIS complex<float>
+{
+    float __re_;
+    float __im_;
+public:
+    typedef float value_type;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR complex(float __re = 0.0f, float __im = 0.0f)
+        : __re_(__re), __im_(__im) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit _LIBCPP_CONSTEXPR complex(const complex<double>& __c);
+    _LIBCPP_INLINE_VISIBILITY
+    explicit _LIBCPP_CONSTEXPR complex(const complex<long double>& __c);
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR float real() const {return __re_;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR float imag() const {return __im_;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 void real(value_type __re) {__re_ = __re;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 void imag(value_type __im) {__im_ = __im;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator= (float __re)
+        {__re_ = __re; __im_ = value_type(); return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator+=(float __re) {__re_ += __re; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator-=(float __re) {__re_ -= __re; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator*=(float __re) {__re_ *= __re; __im_ *= __re; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator/=(float __re) {__re_ /= __re; __im_ /= __re; return *this;}
+
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator= (const complex<_Xp>& __c)
+        {
+            __re_ = __c.real();
+            __im_ = __c.imag();
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator+=(const complex<_Xp>& __c)
+        {
+            __re_ += __c.real();
+            __im_ += __c.imag();
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator-=(const complex<_Xp>& __c)
+        {
+            __re_ -= __c.real();
+            __im_ -= __c.imag();
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator*=(const complex<_Xp>& __c)
+        {
+            *this = *this * complex(__c.real(), __c.imag());
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator/=(const complex<_Xp>& __c)
+        {
+            *this = *this / complex(__c.real(), __c.imag());
+            return *this;
+        }
+};
+
+template<>
+class _LIBCPP_TEMPLATE_VIS complex<double>
+{
+    double __re_;
+    double __im_;
+public:
+    typedef double value_type;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR complex(double __re = 0.0, double __im = 0.0)
+        : __re_(__re), __im_(__im) {}
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR complex(const complex<float>& __c);
+    _LIBCPP_INLINE_VISIBILITY
+    explicit _LIBCPP_CONSTEXPR complex(const complex<long double>& __c);
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR double real() const {return __re_;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR double imag() const {return __im_;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 void real(value_type __re) {__re_ = __re;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 void imag(value_type __im) {__im_ = __im;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator= (double __re)
+        {__re_ = __re; __im_ = value_type(); return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator+=(double __re) {__re_ += __re; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator-=(double __re) {__re_ -= __re; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator*=(double __re) {__re_ *= __re; __im_ *= __re; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator/=(double __re) {__re_ /= __re; __im_ /= __re; return *this;}
+
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator= (const complex<_Xp>& __c)
+        {
+            __re_ = __c.real();
+            __im_ = __c.imag();
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator+=(const complex<_Xp>& __c)
+        {
+            __re_ += __c.real();
+            __im_ += __c.imag();
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator-=(const complex<_Xp>& __c)
+        {
+            __re_ -= __c.real();
+            __im_ -= __c.imag();
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator*=(const complex<_Xp>& __c)
+        {
+            *this = *this * complex(__c.real(), __c.imag());
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator/=(const complex<_Xp>& __c)
+        {
+            *this = *this / complex(__c.real(), __c.imag());
+            return *this;
+        }
+};
+
+template<>
+class _LIBCPP_TEMPLATE_VIS complex<long double>
+{
+    long double __re_;
+    long double __im_;
+public:
+    typedef long double value_type;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR complex(long double __re = 0.0L, long double __im = 0.0L)
+        : __re_(__re), __im_(__im) {}
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR complex(const complex<float>& __c);
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR complex(const complex<double>& __c);
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR long double real() const {return __re_;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR long double imag() const {return __im_;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 void real(value_type __re) {__re_ = __re;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 void imag(value_type __im) {__im_ = __im;}
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator= (long double __re)
+        {__re_ = __re; __im_ = value_type(); return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator+=(long double __re) {__re_ += __re; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator-=(long double __re) {__re_ -= __re; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator*=(long double __re) {__re_ *= __re; __im_ *= __re; return *this;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator/=(long double __re) {__re_ /= __re; __im_ /= __re; return *this;}
+
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator= (const complex<_Xp>& __c)
+        {
+            __re_ = __c.real();
+            __im_ = __c.imag();
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator+=(const complex<_Xp>& __c)
+        {
+            __re_ += __c.real();
+            __im_ += __c.imag();
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator-=(const complex<_Xp>& __c)
+        {
+            __re_ -= __c.real();
+            __im_ -= __c.imag();
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator*=(const complex<_Xp>& __c)
+        {
+            *this = *this * complex(__c.real(), __c.imag());
+            return *this;
+        }
+    template<class _Xp> _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20 complex& operator/=(const complex<_Xp>& __c)
+        {
+            *this = *this / complex(__c.real(), __c.imag());
+            return *this;
+        }
+};
+
+inline
+_LIBCPP_CONSTEXPR
+complex<float>::complex(const complex<double>& __c)
+    : __re_(__c.real()), __im_(__c.imag()) {}
+
+inline
+_LIBCPP_CONSTEXPR
+complex<float>::complex(const complex<long double>& __c)
+    : __re_(__c.real()), __im_(__c.imag()) {}
+
+inline
+_LIBCPP_CONSTEXPR
+complex<double>::complex(const complex<float>& __c)
+    : __re_(__c.real()), __im_(__c.imag()) {}
+
+inline
+_LIBCPP_CONSTEXPR
+complex<double>::complex(const complex<long double>& __c)
+    : __re_(__c.real()), __im_(__c.imag()) {}
+
+inline
+_LIBCPP_CONSTEXPR
+complex<long double>::complex(const complex<float>& __c)
+    : __re_(__c.real()), __im_(__c.imag()) {}
+
+inline
+_LIBCPP_CONSTEXPR
+complex<long double>::complex(const complex<double>& __c)
+    : __re_(__c.real()), __im_(__c.imag()) {}
+
+// 26.3.6 operators:
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+operator+(const complex<_Tp>& __x, const complex<_Tp>& __y)
+{
+    complex<_Tp> __t(__x);
+    __t += __y;
+    return __t;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+operator+(const complex<_Tp>& __x, const _Tp& __y)
+{
+    complex<_Tp> __t(__x);
+    __t += __y;
+    return __t;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+operator+(const _Tp& __x, const complex<_Tp>& __y)
+{
+    complex<_Tp> __t(__y);
+    __t += __x;
+    return __t;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)
+{
+    complex<_Tp> __t(__x);
+    __t -= __y;
+    return __t;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+operator-(const complex<_Tp>& __x, const _Tp& __y)
+{
+    complex<_Tp> __t(__x);
+    __t -= __y;
+    return __t;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+operator-(const _Tp& __x, const complex<_Tp>& __y)
+{
+    complex<_Tp> __t(-__y);
+    __t += __x;
+    return __t;
+}
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 complex<_Tp>
+operator*(const complex<_Tp>& __z, const complex<_Tp>& __w)
+{
+    _Tp __a = __z.real();
+    _Tp __b = __z.imag();
+    _Tp __c = __w.real();
+    _Tp __d = __w.imag();
+
+    // Avoid floating point operations that are invalid during constant evaluation
+    if (__libcpp_is_constant_evaluated()) {
+        bool __z_zero = __a == _Tp(0) && __b == _Tp(0);
+        bool __w_zero = __c == _Tp(0) && __d == _Tp(0);
+        bool __z_inf = std::__constexpr_isinf(__a) || std::__constexpr_isinf(__b);
+        bool __w_inf = std::__constexpr_isinf(__c) || std::__constexpr_isinf(__d);
+        bool __z_nan = !__z_inf && (
+            (std::__constexpr_isnan(__a) && std::__constexpr_isnan(__b))
+            || (std::__constexpr_isnan(__a) && __b == _Tp(0))
+            || (__a == _Tp(0) && std::__constexpr_isnan(__b))
+        );
+        bool __w_nan = !__w_inf && (
+            (std::__constexpr_isnan(__c) && std::__constexpr_isnan(__d))
+            || (std::__constexpr_isnan(__c) && __d == _Tp(0))
+            || (__c == _Tp(0) && std::__constexpr_isnan(__d))
+        );
+        if (__z_nan || __w_nan) {
+            return complex<_Tp>(_Tp(numeric_limits<_Tp>::quiet_NaN()), _Tp(0));
+        }
+        if (__z_inf || __w_inf) {
+            if (__z_zero || __w_zero) {
+                return complex<_Tp>(_Tp(numeric_limits<_Tp>::quiet_NaN()), _Tp(0));
+            }
+            return complex<_Tp>(_Tp(numeric_limits<_Tp>::infinity()), _Tp(numeric_limits<_Tp>::infinity()));
+        }
+        bool __z_nonzero_nan = !__z_inf && !__z_nan && (std::__constexpr_isnan(__a) || std::__constexpr_isnan(__b));
+        bool __w_nonzero_nan = !__w_inf && !__w_nan && (std::__constexpr_isnan(__c) || std::__constexpr_isnan(__d));
+        if (__z_nonzero_nan || __w_nonzero_nan) {
+            return complex<_Tp>(_Tp(numeric_limits<_Tp>::quiet_NaN()), _Tp(0));
+        }
+    }
+
+    _Tp __ac = __a * __c;
+    _Tp __bd = __b * __d;
+    _Tp __ad = __a * __d;
+    _Tp __bc = __b * __c;
+    _Tp __x = __ac - __bd;
+    _Tp __y = __ad + __bc;
+    if (std::__constexpr_isnan(__x) && std::__constexpr_isnan(__y))
+    {
+        bool __recalc = false;
+        if (std::__constexpr_isinf(__a) || std::__constexpr_isinf(__b))
+        {
+            __a = std::__constexpr_copysign(std::__constexpr_isinf(__a) ? _Tp(1) : _Tp(0), __a);
+            __b = std::__constexpr_copysign(std::__constexpr_isinf(__b) ? _Tp(1) : _Tp(0), __b);
+            if (std::__constexpr_isnan(__c))
+                __c = std::__constexpr_copysign(_Tp(0), __c);
+            if (std::__constexpr_isnan(__d))
+                __d = std::__constexpr_copysign(_Tp(0), __d);
+            __recalc = true;
+        }
+        if (std::__constexpr_isinf(__c) || std::__constexpr_isinf(__d))
+        {
+            __c = std::__constexpr_copysign(std::__constexpr_isinf(__c) ? _Tp(1) : _Tp(0), __c);
+            __d = std::__constexpr_copysign(std::__constexpr_isinf(__d) ? _Tp(1) : _Tp(0), __d);
+            if (std::__constexpr_isnan(__a))
+                __a = std::__constexpr_copysign(_Tp(0), __a);
+            if (std::__constexpr_isnan(__b))
+                __b = std::__constexpr_copysign(_Tp(0), __b);
+            __recalc = true;
+        }
+        if (!__recalc && (std::__constexpr_isinf(__ac) || std::__constexpr_isinf(__bd) ||
+                          std::__constexpr_isinf(__ad) || std::__constexpr_isinf(__bc)))
+        {
+            if (std::__constexpr_isnan(__a))
+                __a = std::__constexpr_copysign(_Tp(0), __a);
+            if (std::__constexpr_isnan(__b))
+                __b = std::__constexpr_copysign(_Tp(0), __b);
+            if (std::__constexpr_isnan(__c))
+                __c = std::__constexpr_copysign(_Tp(0), __c);
+            if (std::__constexpr_isnan(__d))
+                __d = std::__constexpr_copysign(_Tp(0), __d);
+            __recalc = true;
+        }
+        if (__recalc)
+        {
+            __x = _Tp(INFINITY) * (__a * __c - __b * __d);
+            __y = _Tp(INFINITY) * (__a * __d + __b * __c);
+        }
+    }
+    return complex<_Tp>(__x, __y);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+operator*(const complex<_Tp>& __x, const _Tp& __y)
+{
+    complex<_Tp> __t(__x);
+    __t *= __y;
+    return __t;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+operator*(const _Tp& __x, const complex<_Tp>& __y)
+{
+    complex<_Tp> __t(__y);
+    __t *= __x;
+    return __t;
+}
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 complex<_Tp>
+operator/(const complex<_Tp>& __z, const complex<_Tp>& __w)
+{
+    int __ilogbw = 0;
+    _Tp __a = __z.real();
+    _Tp __b = __z.imag();
+    _Tp __c = __w.real();
+    _Tp __d = __w.imag();
+    _Tp __logbw = std::__constexpr_logb(std::__constexpr_fmax(std::__constexpr_fabs(__c), std::__constexpr_fabs(__d)));
+    if (std::__constexpr_isfinite(__logbw))
+    {
+        __ilogbw = static_cast<int>(__logbw);
+        __c = std::__constexpr_scalbn(__c, -__ilogbw);
+        __d = std::__constexpr_scalbn(__d, -__ilogbw);
+    }
+
+    // Avoid floating point operations that are invalid during constant evaluation
+    if (__libcpp_is_constant_evaluated()) {
+        bool __z_zero = __a == _Tp(0) && __b == _Tp(0);
+        bool __w_zero = __c == _Tp(0) && __d == _Tp(0);
+        bool __z_inf = std::__constexpr_isinf(__a) || std::__constexpr_isinf(__b);
+        bool __w_inf = std::__constexpr_isinf(__c) || std::__constexpr_isinf(__d);
+        bool __z_nan = !__z_inf && (
+            (std::__constexpr_isnan(__a) && std::__constexpr_isnan(__b))
+            || (std::__constexpr_isnan(__a) && __b == _Tp(0))
+            || (__a == _Tp(0) && std::__constexpr_isnan(__b))
+        );
+        bool __w_nan = !__w_inf && (
+            (std::__constexpr_isnan(__c) && std::__constexpr_isnan(__d))
+            || (std::__constexpr_isnan(__c) && __d == _Tp(0))
+            || (__c == _Tp(0) && std::__constexpr_isnan(__d))
+        );
+        if ((__z_nan || __w_nan) || (__z_inf && __w_inf)) {
+            return complex<_Tp>(_Tp(numeric_limits<_Tp>::quiet_NaN()), _Tp(0));
+        }
+        bool __z_nonzero_nan = !__z_inf && !__z_nan && (std::__constexpr_isnan(__a) || std::__constexpr_isnan(__b));
+        bool __w_nonzero_nan = !__w_inf && !__w_nan && (std::__constexpr_isnan(__c) || std::__constexpr_isnan(__d));
+        if (__z_nonzero_nan || __w_nonzero_nan) {
+            if (__w_zero) {
+                return complex<_Tp>(_Tp(numeric_limits<_Tp>::infinity()), _Tp(numeric_limits<_Tp>::infinity()));
+            }
+            return complex<_Tp>(_Tp(numeric_limits<_Tp>::quiet_NaN()), _Tp(0));
+        }
+        if (__w_inf) {
+            return complex<_Tp>(_Tp(0), _Tp(0));
+        }
+        if (__z_inf) {
+            return complex<_Tp>(_Tp(numeric_limits<_Tp>::infinity()), _Tp(numeric_limits<_Tp>::infinity()));
+        }
+        if (__w_zero) {
+            if (__z_zero) {
+                return complex<_Tp>(_Tp(numeric_limits<_Tp>::quiet_NaN()), _Tp(0));
+            }
+            return complex<_Tp>(_Tp(numeric_limits<_Tp>::infinity()), _Tp(numeric_limits<_Tp>::infinity()));
+        }
+    }
+
+    _Tp __denom = __c * __c + __d * __d;
+    _Tp __x = std::__constexpr_scalbn((__a * __c + __b * __d) / __denom, -__ilogbw);
+    _Tp __y = std::__constexpr_scalbn((__b * __c - __a * __d) / __denom, -__ilogbw);
+    if (std::__constexpr_isnan(__x) && std::__constexpr_isnan(__y))
+    {
+        if ((__denom == _Tp(0)) && (!std::__constexpr_isnan(__a) || !std::__constexpr_isnan(__b)))
+        {
+            __x = std::__constexpr_copysign(_Tp(INFINITY), __c) * __a;
+            __y = std::__constexpr_copysign(_Tp(INFINITY), __c) * __b;
+        } else if ((std::__constexpr_isinf(__a) || std::__constexpr_isinf(__b)) && std::__constexpr_isfinite(__c) &&
+                   std::__constexpr_isfinite(__d)) {
+            __a = std::__constexpr_copysign(std::__constexpr_isinf(__a) ? _Tp(1) : _Tp(0), __a);
+            __b = std::__constexpr_copysign(std::__constexpr_isinf(__b) ? _Tp(1) : _Tp(0), __b);
+            __x = _Tp(INFINITY) * (__a * __c + __b * __d);
+            __y = _Tp(INFINITY) * (__b * __c - __a * __d);
+        } else if (std::__constexpr_isinf(__logbw) && __logbw > _Tp(0) && std::__constexpr_isfinite(__a) &&
+                   std::__constexpr_isfinite(__b)) {
+            __c = std::__constexpr_copysign(std::__constexpr_isinf(__c) ? _Tp(1) : _Tp(0), __c);
+            __d = std::__constexpr_copysign(std::__constexpr_isinf(__d) ? _Tp(1) : _Tp(0), __d);
+            __x = _Tp(0) * (__a * __c + __b * __d);
+            __y = _Tp(0) * (__b * __c - __a * __d);
+        }
+    }
+    return complex<_Tp>(__x, __y);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+operator/(const complex<_Tp>& __x, const _Tp& __y)
+{
+    return complex<_Tp>(__x.real() / __y, __x.imag() / __y);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+operator/(const _Tp& __x, const complex<_Tp>& __y)
+{
+    complex<_Tp> __t(__x);
+    __t /= __y;
+    return __t;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+operator+(const complex<_Tp>& __x)
+{
+    return __x;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+operator-(const complex<_Tp>& __x)
+{
+    return complex<_Tp>(-__x.real(), -__x.imag());
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator==(const complex<_Tp>& __x, const complex<_Tp>& __y)
+{
+    return __x.real() == __y.real() && __x.imag() == __y.imag();
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator==(const complex<_Tp>& __x, const _Tp& __y)
+{
+    return __x.real() == __y && __x.imag() == 0;
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator==(const _Tp& __x, const complex<_Tp>& __y)
+{
+    return __x == __y.real() && 0 == __y.imag();
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator!=(const complex<_Tp>& __x, const complex<_Tp>& __y)
+{
+    return !(__x == __y);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator!=(const complex<_Tp>& __x, const _Tp& __y)
+{
+    return !(__x == __y);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator!=(const _Tp& __x, const complex<_Tp>& __y)
+{
+    return !(__x == __y);
+}
+
+// 26.3.7 values:
+
+template <class _Tp, bool = is_integral<_Tp>::value,
+                     bool = is_floating_point<_Tp>::value
+                     >
+struct __libcpp_complex_overload_traits {};
+
+// Integral Types
+template <class _Tp>
+struct __libcpp_complex_overload_traits<_Tp, true, false>
+{
+    typedef double _ValueType;
+    typedef complex<double> _ComplexType;
+};
+
+// Floating point types
+template <class _Tp>
+struct __libcpp_complex_overload_traits<_Tp, false, true>
+{
+    typedef _Tp _ValueType;
+    typedef complex<_Tp> _ComplexType;
+};
+
+// real
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp
+real(const complex<_Tp>& __c)
+{
+    return __c.real();
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+typename __libcpp_complex_overload_traits<_Tp>::_ValueType
+real(_Tp __re)
+{
+    return __re;
+}
+
+// imag
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+_Tp
+imag(const complex<_Tp>& __c)
+{
+    return __c.imag();
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+typename __libcpp_complex_overload_traits<_Tp>::_ValueType
+imag(_Tp)
+{
+    return 0;
+}
+
+// abs
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+_Tp
+abs(const complex<_Tp>& __c)
+{
+    return std::hypot(__c.real(), __c.imag());
+}
+
+// arg
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+_Tp
+arg(const complex<_Tp>& __c)
+{
+    return std::atan2(__c.imag(), __c.real());
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if<
+    is_same<_Tp, long double>::value,
+    long double
+>::type
+arg(_Tp __re)
+{
+    return std::atan2l(0.L, __re);
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value || is_same<_Tp, double>::value,
+    double
+>::type
+arg(_Tp __re)
+{
+    return std::atan2(0., __re);
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if<
+    is_same<_Tp, float>::value,
+    float
+>::type
+arg(_Tp __re)
+{
+    return std::atan2f(0.F, __re);
+}
+
+// norm
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+_Tp
+norm(const complex<_Tp>& __c)
+{
+    if (std::__constexpr_isinf(__c.real()))
+        return std::abs(__c.real());
+    if (std::__constexpr_isinf(__c.imag()))
+        return std::abs(__c.imag());
+    return __c.real() * __c.real() + __c.imag() * __c.imag();
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename __libcpp_complex_overload_traits<_Tp>::_ValueType
+norm(_Tp __re)
+{
+    typedef typename __libcpp_complex_overload_traits<_Tp>::_ValueType _ValueType;
+    return static_cast<_ValueType>(__re) * __re;
+}
+
+// conj
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+complex<_Tp>
+conj(const complex<_Tp>& __c)
+{
+    return complex<_Tp>(__c.real(), -__c.imag());
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename __libcpp_complex_overload_traits<_Tp>::_ComplexType
+conj(_Tp __re)
+{
+    typedef typename __libcpp_complex_overload_traits<_Tp>::_ComplexType _ComplexType;
+    return _ComplexType(__re);
+}
+
+
+
+// proj
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+complex<_Tp>
+proj(const complex<_Tp>& __c)
+{
+    complex<_Tp> __r = __c;
+    if (std::__constexpr_isinf(__c.real()) || std::__constexpr_isinf(__c.imag()))
+        __r = complex<_Tp>(INFINITY, std::copysign(_Tp(0), __c.imag()));
+    return __r;
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_floating_point<_Tp>::value,
+    typename __libcpp_complex_overload_traits<_Tp>::_ComplexType
+>::type
+proj(_Tp __re)
+{
+    if (std::__constexpr_isinf(__re))
+        __re = std::abs(__re);
+    return complex<_Tp>(__re);
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_integral<_Tp>::value,
+    typename __libcpp_complex_overload_traits<_Tp>::_ComplexType
+>::type
+proj(_Tp __re)
+{
+    typedef typename __libcpp_complex_overload_traits<_Tp>::_ComplexType _ComplexType;
+    return _ComplexType(__re);
+}
+
+// polar
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+polar(const _Tp& __rho, const _Tp& __theta = _Tp())
+{
+    if (std::__constexpr_isnan(__rho) || std::signbit(__rho))
+        return complex<_Tp>(_Tp(NAN), _Tp(NAN));
+    if (std::__constexpr_isnan(__theta))
+    {
+        if (std::__constexpr_isinf(__rho))
+            return complex<_Tp>(__rho, __theta);
+        return complex<_Tp>(__theta, __theta);
+    }
+    if (std::__constexpr_isinf(__theta))
+    {
+        if (std::__constexpr_isinf(__rho))
+            return complex<_Tp>(__rho, _Tp(NAN));
+        return complex<_Tp>(_Tp(NAN), _Tp(NAN));
+    }
+    _Tp __x = __rho * std::cos(__theta);
+    if (std::__constexpr_isnan(__x))
+        __x = 0;
+    _Tp __y = __rho * std::sin(__theta);
+    if (std::__constexpr_isnan(__y))
+        __y = 0;
+    return complex<_Tp>(__x, __y);
+}
+
+// log
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+complex<_Tp>
+log(const complex<_Tp>& __x)
+{
+    return complex<_Tp>(std::log(std::abs(__x)), std::arg(__x));
+}
+
+// log10
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+complex<_Tp>
+log10(const complex<_Tp>& __x)
+{
+    return std::log(__x) / std::log(_Tp(10));
+}
+
+// sqrt
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+sqrt(const complex<_Tp>& __x)
+{
+    if (std::__constexpr_isinf(__x.imag()))
+        return complex<_Tp>(_Tp(INFINITY), __x.imag());
+    if (std::__constexpr_isinf(__x.real()))
+    {
+        if (__x.real() > _Tp(0))
+            return complex<_Tp>(__x.real(), std::__constexpr_isnan(__x.imag()) ? __x.imag() : std::copysign(_Tp(0), __x.imag()));
+        return complex<_Tp>(std::__constexpr_isnan(__x.imag()) ? __x.imag() : _Tp(0), std::copysign(__x.real(), __x.imag()));
+    }
+    return std::polar(std::sqrt(std::abs(__x)), std::arg(__x) / _Tp(2));
+}
+
+// exp
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+exp(const complex<_Tp>& __x)
+{
+    _Tp __i = __x.imag();
+    if (__i == 0) {
+        return complex<_Tp>(std::exp(__x.real()), std::copysign(_Tp(0), __x.imag()));
+    }
+    if (std::__constexpr_isinf(__x.real()))
+    {
+        if (__x.real() < _Tp(0))
+        {
+            if (!std::__constexpr_isfinite(__i))
+                __i = _Tp(1);
+        }
+        else if (__i == 0 || !std::__constexpr_isfinite(__i))
+        {
+            if (std::__constexpr_isinf(__i))
+                __i = _Tp(NAN);
+            return complex<_Tp>(__x.real(), __i);
+        }
+    }
+    _Tp __e = std::exp(__x.real());
+    return complex<_Tp>(__e * std::cos(__i), __e * std::sin(__i));
+}
+
+// pow
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+complex<_Tp>
+pow(const complex<_Tp>& __x, const complex<_Tp>& __y)
+{
+    return std::exp(__y * std::log(__x));
+}
+
+template<class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY
+complex<typename __promote<_Tp, _Up>::type>
+pow(const complex<_Tp>& __x, const complex<_Up>& __y)
+{
+    typedef complex<typename __promote<_Tp, _Up>::type> result_type;
+    return _VSTD::pow(result_type(__x), result_type(__y));
+}
+
+template<class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_arithmetic<_Up>::value,
+    complex<typename __promote<_Tp, _Up>::type>
+>::type
+pow(const complex<_Tp>& __x, const _Up& __y)
+{
+    typedef complex<typename __promote<_Tp, _Up>::type> result_type;
+    return _VSTD::pow(result_type(__x), result_type(__y));
+}
+
+template<class _Tp, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_arithmetic<_Tp>::value,
+    complex<typename __promote<_Tp, _Up>::type>
+>::type
+pow(const _Tp& __x, const complex<_Up>& __y)
+{
+    typedef complex<typename __promote<_Tp, _Up>::type> result_type;
+    return _VSTD::pow(result_type(__x), result_type(__y));
+}
+
+// __sqr, computes pow(x, 2)
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+complex<_Tp>
+__sqr(const complex<_Tp>& __x)
+{
+    return complex<_Tp>((__x.real() - __x.imag()) * (__x.real() + __x.imag()),
+                        _Tp(2) * __x.real() * __x.imag());
+}
+
+// asinh
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+asinh(const complex<_Tp>& __x)
+{
+    const _Tp __pi(atan2(+0., -0.));
+    if (std::__constexpr_isinf(__x.real()))
+    {
+        if (std::__constexpr_isnan(__x.imag()))
+            return __x;
+        if (std::__constexpr_isinf(__x.imag()))
+            return complex<_Tp>(__x.real(), std::copysign(__pi * _Tp(0.25), __x.imag()));
+        return complex<_Tp>(__x.real(), std::copysign(_Tp(0), __x.imag()));
+    }
+    if (std::__constexpr_isnan(__x.real()))
+    {
+        if (std::__constexpr_isinf(__x.imag()))
+            return complex<_Tp>(__x.imag(), __x.real());
+        if (__x.imag() == 0)
+            return __x;
+        return complex<_Tp>(__x.real(), __x.real());
+    }
+    if (std::__constexpr_isinf(__x.imag()))
+        return complex<_Tp>(std::copysign(__x.imag(), __x.real()), std::copysign(__pi/_Tp(2), __x.imag()));
+    complex<_Tp> __z = std::log(__x + std::sqrt(std::__sqr(__x) + _Tp(1)));
+    return complex<_Tp>(std::copysign(__z.real(), __x.real()), std::copysign(__z.imag(), __x.imag()));
+}
+
+// acosh
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+acosh(const complex<_Tp>& __x)
+{
+    const _Tp __pi(atan2(+0., -0.));
+    if (std::__constexpr_isinf(__x.real()))
+    {
+        if (std::__constexpr_isnan(__x.imag()))
+            return complex<_Tp>(std::abs(__x.real()), __x.imag());
+        if (std::__constexpr_isinf(__x.imag()))
+        {
+            if (__x.real() > 0)
+                return complex<_Tp>(__x.real(), std::copysign(__pi * _Tp(0.25), __x.imag()));
+            else
+                return complex<_Tp>(-__x.real(), std::copysign(__pi * _Tp(0.75), __x.imag()));
+        }
+        if (__x.real() < 0)
+            return complex<_Tp>(-__x.real(), std::copysign(__pi, __x.imag()));
+        return complex<_Tp>(__x.real(), std::copysign(_Tp(0), __x.imag()));
+    }
+    if (std::__constexpr_isnan(__x.real()))
+    {
+        if (std::__constexpr_isinf(__x.imag()))
+            return complex<_Tp>(std::abs(__x.imag()), __x.real());
+        return complex<_Tp>(__x.real(), __x.real());
+    }
+    if (std::__constexpr_isinf(__x.imag()))
+        return complex<_Tp>(std::abs(__x.imag()), std::copysign(__pi/_Tp(2), __x.imag()));
+    complex<_Tp> __z = std::log(__x + std::sqrt(std::__sqr(__x) - _Tp(1)));
+    return complex<_Tp>(std::copysign(__z.real(), _Tp(0)), std::copysign(__z.imag(), __x.imag()));
+}
+
+// atanh
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+atanh(const complex<_Tp>& __x)
+{
+    const _Tp __pi(atan2(+0., -0.));
+    if (std::__constexpr_isinf(__x.imag()))
+    {
+        return complex<_Tp>(std::copysign(_Tp(0), __x.real()), std::copysign(__pi/_Tp(2), __x.imag()));
+    }
+    if (std::__constexpr_isnan(__x.imag()))
+    {
+        if (std::__constexpr_isinf(__x.real()) || __x.real() == 0)
+            return complex<_Tp>(std::copysign(_Tp(0), __x.real()), __x.imag());
+        return complex<_Tp>(__x.imag(), __x.imag());
+    }
+    if (std::__constexpr_isnan(__x.real()))
+    {
+        return complex<_Tp>(__x.real(), __x.real());
+    }
+    if (std::__constexpr_isinf(__x.real()))
+    {
+        return complex<_Tp>(std::copysign(_Tp(0), __x.real()), std::copysign(__pi/_Tp(2), __x.imag()));
+    }
+    if (std::abs(__x.real()) == _Tp(1) && __x.imag() == _Tp(0))
+    {
+        return complex<_Tp>(std::copysign(_Tp(INFINITY), __x.real()), std::copysign(_Tp(0), __x.imag()));
+    }
+    complex<_Tp> __z = std::log((_Tp(1) + __x) / (_Tp(1) - __x)) / _Tp(2);
+    return complex<_Tp>(std::copysign(__z.real(), __x.real()), std::copysign(__z.imag(), __x.imag()));
+}
+
+// sinh
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+sinh(const complex<_Tp>& __x)
+{
+    if (std::__constexpr_isinf(__x.real()) && !std::__constexpr_isfinite(__x.imag()))
+        return complex<_Tp>(__x.real(), _Tp(NAN));
+    if (__x.real() == 0 && !std::__constexpr_isfinite(__x.imag()))
+        return complex<_Tp>(__x.real(), _Tp(NAN));
+    if (__x.imag() == 0 && !std::__constexpr_isfinite(__x.real()))
+        return __x;
+    return complex<_Tp>(std::sinh(__x.real()) * std::cos(__x.imag()), std::cosh(__x.real()) * std::sin(__x.imag()));
+}
+
+// cosh
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+cosh(const complex<_Tp>& __x)
+{
+    if (std::__constexpr_isinf(__x.real()) && !std::__constexpr_isfinite(__x.imag()))
+        return complex<_Tp>(std::abs(__x.real()), _Tp(NAN));
+    if (__x.real() == 0 && !std::__constexpr_isfinite(__x.imag()))
+        return complex<_Tp>(_Tp(NAN), __x.real());
+    if (__x.real() == 0 && __x.imag() == 0)
+        return complex<_Tp>(_Tp(1), __x.imag());
+    if (__x.imag() == 0 && !std::__constexpr_isfinite(__x.real()))
+        return complex<_Tp>(std::abs(__x.real()), __x.imag());
+    return complex<_Tp>(std::cosh(__x.real()) * std::cos(__x.imag()), std::sinh(__x.real()) * std::sin(__x.imag()));
+}
+
+// tanh
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+tanh(const complex<_Tp>& __x)
+{
+    if (std::__constexpr_isinf(__x.real()))
+    {
+        if (!std::__constexpr_isfinite(__x.imag()))
+            return complex<_Tp>(std::copysign(_Tp(1), __x.real()), _Tp(0));
+        return complex<_Tp>(std::copysign(_Tp(1), __x.real()), std::copysign(_Tp(0), std::sin(_Tp(2) * __x.imag())));
+    }
+    if (std::__constexpr_isnan(__x.real()) && __x.imag() == 0)
+        return __x;
+    _Tp __2r(_Tp(2) * __x.real());
+    _Tp __2i(_Tp(2) * __x.imag());
+    _Tp __d(std::cosh(__2r) + std::cos(__2i));
+    _Tp __2rsh(std::sinh(__2r));
+    if (std::__constexpr_isinf(__2rsh) && std::__constexpr_isinf(__d))
+        return complex<_Tp>(__2rsh > _Tp(0) ? _Tp(1) : _Tp(-1),
+                            __2i > _Tp(0) ? _Tp(0) : _Tp(-0.));
+    return  complex<_Tp>(__2rsh/__d, std::sin(__2i)/__d);
+}
+
+// asin
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+asin(const complex<_Tp>& __x)
+{
+    complex<_Tp> __z = std::asinh(complex<_Tp>(-__x.imag(), __x.real()));
+    return complex<_Tp>(__z.imag(), -__z.real());
+}
+
+// acos
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+acos(const complex<_Tp>& __x)
+{
+    const _Tp __pi(atan2(+0., -0.));
+    if (std::__constexpr_isinf(__x.real()))
+    {
+        if (std::__constexpr_isnan(__x.imag()))
+            return complex<_Tp>(__x.imag(), __x.real());
+        if (std::__constexpr_isinf(__x.imag()))
+        {
+            if (__x.real() < _Tp(0))
+                return complex<_Tp>(_Tp(0.75) * __pi, -__x.imag());
+            return complex<_Tp>(_Tp(0.25) * __pi, -__x.imag());
+        }
+        if (__x.real() < _Tp(0))
+            return complex<_Tp>(__pi, std::signbit(__x.imag()) ? -__x.real() : __x.real());
+        return complex<_Tp>(_Tp(0), std::signbit(__x.imag()) ? __x.real() : -__x.real());
+    }
+    if (std::__constexpr_isnan(__x.real()))
+    {
+        if (std::__constexpr_isinf(__x.imag()))
+            return complex<_Tp>(__x.real(), -__x.imag());
+        return complex<_Tp>(__x.real(), __x.real());
+    }
+    if (std::__constexpr_isinf(__x.imag()))
+        return complex<_Tp>(__pi/_Tp(2), -__x.imag());
+    if (__x.real() == 0 && (__x.imag() == 0 || std::isnan(__x.imag())))
+        return complex<_Tp>(__pi/_Tp(2), -__x.imag());
+    complex<_Tp> __z = std::log(__x + std::sqrt(std::__sqr(__x) - _Tp(1)));
+    if (std::signbit(__x.imag()))
+        return complex<_Tp>(std::abs(__z.imag()), std::abs(__z.real()));
+    return complex<_Tp>(std::abs(__z.imag()), -std::abs(__z.real()));
+}
+
+// atan
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+atan(const complex<_Tp>& __x)
+{
+    complex<_Tp> __z = std::atanh(complex<_Tp>(-__x.imag(), __x.real()));
+    return complex<_Tp>(__z.imag(), -__z.real());
+}
+
+// sin
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+sin(const complex<_Tp>& __x)
+{
+    complex<_Tp> __z = std::sinh(complex<_Tp>(-__x.imag(), __x.real()));
+    return complex<_Tp>(__z.imag(), -__z.real());
+}
+
+// cos
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+complex<_Tp>
+cos(const complex<_Tp>& __x)
+{
+    return std::cosh(complex<_Tp>(-__x.imag(), __x.real()));
+}
+
+// tan
+
+template<class _Tp>
+_LIBCPP_HIDE_FROM_ABI complex<_Tp>
+tan(const complex<_Tp>& __x)
+{
+    complex<_Tp> __z = std::tanh(complex<_Tp>(-__x.imag(), __x.real()));
+    return complex<_Tp>(__z.imag(), -__z.real());
+}
+
+#if !defined(_LIBCPP_HAS_NO_LOCALIZATION)
+template<class _Tp, class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x)
+{
+    if (__is.good())
+    {
+        std::ws(__is);
+        if (__is.peek() == _CharT('('))
+        {
+            __is.get();
+            _Tp __r;
+            __is >> __r;
+            if (!__is.fail())
+            {
+                std::ws(__is);
+                _CharT __c = __is.peek();
+                if (__c == _CharT(','))
+                {
+                    __is.get();
+                    _Tp __i;
+                    __is >> __i;
+                    if (!__is.fail())
+                    {
+                        std::ws(__is);
+                        __c = __is.peek();
+                        if (__c == _CharT(')'))
+                        {
+                            __is.get();
+                            __x = complex<_Tp>(__r, __i);
+                        }
+                        else
+                            __is.setstate(__is.failbit);
+                    }
+                    else
+                        __is.setstate(__is.failbit);
+                }
+                else if (__c == _CharT(')'))
+                {
+                    __is.get();
+                    __x = complex<_Tp>(__r, _Tp(0));
+                }
+                else
+                    __is.setstate(__is.failbit);
+            }
+            else
+                __is.setstate(__is.failbit);
+        }
+        else
+        {
+            _Tp __r;
+            __is >> __r;
+            if (!__is.fail())
+                __x = complex<_Tp>(__r, _Tp(0));
+            else
+                __is.setstate(__is.failbit);
+        }
+    }
+    else
+        __is.setstate(__is.failbit);
+    return __is;
+}
+
+template<class _Tp, class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const complex<_Tp>& __x)
+{
+    basic_ostringstream<_CharT, _Traits> __s;
+    __s.flags(__os.flags());
+    __s.imbue(__os.getloc());
+    __s.precision(__os.precision());
+    __s << '(' << __x.real() << ',' << __x.imag() << ')';
+    return __os << __s.str();
+}
+#endif // !_LIBCPP_HAS_NO_LOCALIZATION
+
+#if _LIBCPP_STD_VER > 11
+// Literal suffix for complex number literals [complex.literals]
+inline namespace literals
+{
+  inline namespace complex_literals
+  {
+    _LIBCPP_HIDE_FROM_ABI constexpr complex<long double> operator""il(long double __im)
+    {
+        return { 0.0l, __im };
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr complex<long double> operator""il(unsigned long long __im)
+    {
+        return { 0.0l, static_cast<long double>(__im) };
+    }
+
+
+    _LIBCPP_HIDE_FROM_ABI constexpr complex<double> operator""i(long double __im)
+    {
+        return { 0.0, static_cast<double>(__im) };
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr complex<double> operator""i(unsigned long long __im)
+    {
+        return { 0.0, static_cast<double>(__im) };
+    }
+
+
+    _LIBCPP_HIDE_FROM_ABI constexpr complex<float> operator""if(long double __im)
+    {
+        return { 0.0f, static_cast<float>(__im) };
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr complex<float> operator""if(unsigned long long __im)
+    {
+        return { 0.0f, static_cast<float>(__im) };
+    }
+  } // namespace complex_literals
+} // namespace literals
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_COMPLEX
diff --git a/app/src/main/cpp/libcxx/include/complex.h b/app/src/main/cpp/libcxx/include/complex.h
new file mode 100644
index 0000000..a3da21c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/complex.h
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_COMPLEX_H
+#define _LIBCPP_COMPLEX_H
+
+/*
+    complex.h synopsis
+
+#include <ccomplex>
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifdef __cplusplus
+#  include <ccomplex>
+#elif __has_include_next(<complex.h>)
+#  include_next <complex.h>
+#endif
+
+#endif // _LIBCPP_COMPLEX_H
diff --git a/app/src/main/cpp/libcxx/include/concepts b/app/src/main/cpp/libcxx/include/concepts
new file mode 100644
index 0000000..196fa2e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/concepts
@@ -0,0 +1,166 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CONCEPTS
+#define _LIBCPP_CONCEPTS
+
+/*
+    concepts synopsis
+namespace std {
+  // [concepts.lang], language-related concepts
+  // [concept.same], concept same_as
+  template<class T, class U>
+    concept same_as = see below;
+
+  // [concept.derived], concept derived_from
+  template<class Derived, class Base>
+    concept derived_from = see below;
+
+  // [concept.convertible], concept convertible_to
+  template<class From, class To>
+    concept convertible_to = see below;
+
+  // [concept.commonref], concept common_reference_with
+  template<class T, class U>
+    concept common_reference_with = see below;
+
+  // [concept.common], concept common_with
+  template<class T, class U>
+    concept common_with = see below;
+
+  // [concepts.arithmetic], arithmetic concepts
+  template<class T>
+    concept integral = see below;
+  template<class T>
+    concept signed_integral = see below;
+  template<class T>
+    concept unsigned_integral = see below;
+  template<class T>
+    concept floating_point = see below;
+
+  // [concept.assignable], concept assignable_from
+  template<class LHS, class RHS>
+    concept assignable_from = see below;
+
+  // [concept.swappable], concept swappable
+  namespace ranges {
+    inline namespace unspecified {
+      inline constexpr unspecified swap = unspecified;
+    }
+  }
+  template<class T>
+    concept swappable = see below;
+  template<class T, class U>
+    concept swappable_with = see below;
+
+  // [concept.destructible], concept destructible
+  template<class T>
+    concept destructible = see below;
+
+  // [concept.constructible], concept constructible_from
+  template<class T, class... Args>
+    concept constructible_from = see below;
+
+  // [concept.default.init], concept default_initializable
+  template<class T>
+    concept default_initializable = see below;
+
+  // [concept.moveconstructible], concept move_constructible
+  template<class T>
+    concept move_constructible = see below;
+
+  // [concept.copyconstructible], concept copy_constructible
+  template<class T>
+    concept copy_constructible = see below;
+
+  // [concept.equalitycomparable], concept equality_comparable
+  template<class T>
+    concept equality_comparable = see below;
+  template<class T, class U>
+    concept equality_comparable_with = see below;
+
+  // [concept.totallyordered], concept totally_ordered
+  template<class T>
+    concept totally_ordered = see below;
+  template<class T, class U>
+    concept totally_ordered_with = see below;
+
+  // [concepts.object], object concepts
+  template<class T>
+    concept movable = see below;
+  template<class T>
+    concept copyable = see below;
+  template<class T>
+    concept semiregular = see below;
+  template<class T>
+    concept regular = see below;
+
+  // [concepts.callable], callable concepts
+  // [concept.invocable], concept invocable
+  template<class F, class... Args>
+    concept invocable = see below;
+
+  // [concept.regularinvocable], concept regular_invocable
+  template<class F, class... Args>
+    concept regular_invocable = see below;
+
+  // [concept.predicate], concept predicate
+  template<class F, class... Args>
+    concept predicate = see below;
+
+  // [concept.relation], concept relation
+  template<class R, class T, class U>
+    concept relation = see below;
+
+  // [concept.equiv], concept equivalence_relation
+  template<class R, class T, class U>
+    concept equivalence_relation = see below;
+
+  // [concept.strictweakorder], concept strict_weak_order
+  template<class R, class T, class U>
+    concept strict_weak_order = see below;
+}
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__concepts/arithmetic.h>
+#include <__concepts/assignable.h>
+#include <__concepts/boolean_testable.h>
+#include <__concepts/class_or_enum.h>
+#include <__concepts/common_reference_with.h>
+#include <__concepts/common_with.h>
+#include <__concepts/constructible.h>
+#include <__concepts/convertible_to.h>
+#include <__concepts/copyable.h>
+#include <__concepts/derived_from.h>
+#include <__concepts/destructible.h>
+#include <__concepts/different_from.h>
+#include <__concepts/equality_comparable.h>
+#include <__concepts/invocable.h>
+#include <__concepts/movable.h>
+#include <__concepts/predicate.h>
+#include <__concepts/regular.h>
+#include <__concepts/relation.h>
+#include <__concepts/same_as.h>
+#include <__concepts/semiregular.h>
+#include <__concepts/swappable.h>
+#include <__concepts/totally_ordered.h>
+#include <__config>
+#include <version>
+
+#if _LIBCPP_STD_VER <= 20 && !defined(_LIPCPP_REMOVE_TRANSITIVE_INCLUDES)
+#  include <type_traits>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif // _LIBCPP_CONCEPTS
diff --git a/app/src/main/cpp/libcxx/include/condition_variable b/app/src/main/cpp/libcxx/include/condition_variable
new file mode 100644
index 0000000..f13df1c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/condition_variable
@@ -0,0 +1,276 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CONDITION_VARIABLE
+#define _LIBCPP_CONDITION_VARIABLE
+
+/*
+    condition_variable synopsis
+
+namespace std
+{
+
+enum class cv_status { no_timeout, timeout };
+
+class condition_variable
+{
+public:
+    condition_variable();
+    ~condition_variable();
+
+    condition_variable(const condition_variable&) = delete;
+    condition_variable& operator=(const condition_variable&) = delete;
+
+    void notify_one() noexcept;
+    void notify_all() noexcept;
+
+    void wait(unique_lock<mutex>& lock);
+    template <class Predicate>
+        void wait(unique_lock<mutex>& lock, Predicate pred);
+
+    template <class Clock, class Duration>
+        cv_status
+        wait_until(unique_lock<mutex>& lock,
+                   const chrono::time_point<Clock, Duration>& abs_time);
+
+    template <class Clock, class Duration, class Predicate>
+        bool
+        wait_until(unique_lock<mutex>& lock,
+                   const chrono::time_point<Clock, Duration>& abs_time,
+                   Predicate pred);
+
+    template <class Rep, class Period>
+        cv_status
+        wait_for(unique_lock<mutex>& lock,
+                 const chrono::duration<Rep, Period>& rel_time);
+
+    template <class Rep, class Period, class Predicate>
+        bool
+        wait_for(unique_lock<mutex>& lock,
+                 const chrono::duration<Rep, Period>& rel_time,
+                 Predicate pred);
+
+    typedef pthread_cond_t* native_handle_type;
+    native_handle_type native_handle();
+};
+
+void notify_all_at_thread_exit(condition_variable& cond, unique_lock<mutex> lk);
+
+class condition_variable_any
+{
+public:
+    condition_variable_any();
+    ~condition_variable_any();
+
+    condition_variable_any(const condition_variable_any&) = delete;
+    condition_variable_any& operator=(const condition_variable_any&) = delete;
+
+    void notify_one() noexcept;
+    void notify_all() noexcept;
+
+    template <class Lock>
+        void wait(Lock& lock);
+    template <class Lock, class Predicate>
+        void wait(Lock& lock, Predicate pred);
+
+    template <class Lock, class Clock, class Duration>
+        cv_status
+        wait_until(Lock& lock,
+                   const chrono::time_point<Clock, Duration>& abs_time);
+
+    template <class Lock, class Clock, class Duration, class Predicate>
+        bool
+        wait_until(Lock& lock,
+                   const chrono::time_point<Clock, Duration>& abs_time,
+                   Predicate pred);
+
+    template <class Lock, class Rep, class Period>
+        cv_status
+        wait_for(Lock& lock,
+                 const chrono::duration<Rep, Period>& rel_time);
+
+    template <class Lock, class Rep, class Period, class Predicate>
+        bool
+        wait_for(Lock& lock,
+                 const chrono::duration<Rep, Period>& rel_time,
+                 Predicate pred);
+};
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__memory/shared_ptr.h>
+#include <__memory/unique_ptr.h>
+#include <__mutex_base>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_HAS_NO_THREADS
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+class _LIBCPP_TYPE_VIS condition_variable_any
+{
+    condition_variable __cv_;
+    shared_ptr<mutex>  __mut_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    condition_variable_any();
+
+    _LIBCPP_INLINE_VISIBILITY
+    void notify_one() _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    void notify_all() _NOEXCEPT;
+
+    template <class _Lock>
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        void wait(_Lock& __lock);
+    template <class _Lock, class _Predicate>
+        _LIBCPP_INLINE_VISIBILITY
+        void wait(_Lock& __lock, _Predicate __pred);
+
+    template <class _Lock, class _Clock, class _Duration>
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        cv_status
+        wait_until(_Lock& __lock,
+                   const chrono::time_point<_Clock, _Duration>& __t);
+
+    template <class _Lock, class _Clock, class _Duration, class _Predicate>
+        bool
+        _LIBCPP_INLINE_VISIBILITY
+        wait_until(_Lock& __lock,
+                   const chrono::time_point<_Clock, _Duration>& __t,
+                   _Predicate __pred);
+
+    template <class _Lock, class _Rep, class _Period>
+        cv_status
+        _LIBCPP_INLINE_VISIBILITY
+        wait_for(_Lock& __lock,
+                 const chrono::duration<_Rep, _Period>& __d);
+
+    template <class _Lock, class _Rep, class _Period, class _Predicate>
+        bool
+        _LIBCPP_INLINE_VISIBILITY
+        wait_for(_Lock& __lock,
+                 const chrono::duration<_Rep, _Period>& __d,
+                 _Predicate __pred);
+};
+
+inline
+condition_variable_any::condition_variable_any()
+    : __mut_(make_shared<mutex>()) {}
+
+inline
+void
+condition_variable_any::notify_one() _NOEXCEPT
+{
+    {lock_guard<mutex> __lx(*__mut_);}
+    __cv_.notify_one();
+}
+
+inline
+void
+condition_variable_any::notify_all() _NOEXCEPT
+{
+    {lock_guard<mutex> __lx(*__mut_);}
+    __cv_.notify_all();
+}
+
+struct __lock_external
+{
+    template <class _Lock>
+    void operator()(_Lock* __m) {__m->lock();}
+};
+
+template <class _Lock>
+void
+condition_variable_any::wait(_Lock& __lock)
+{
+    shared_ptr<mutex> __mut = __mut_;
+    unique_lock<mutex> __lk(*__mut);
+    __lock.unlock();
+    unique_ptr<_Lock, __lock_external> __lxx(&__lock);
+    lock_guard<unique_lock<mutex> > __lx(__lk, adopt_lock);
+    __cv_.wait(__lk);
+}  // __mut_.unlock(), __lock.lock()
+
+template <class _Lock, class _Predicate>
+inline
+void
+condition_variable_any::wait(_Lock& __lock, _Predicate __pred)
+{
+    while (!__pred())
+        wait(__lock);
+}
+
+template <class _Lock, class _Clock, class _Duration>
+cv_status
+condition_variable_any::wait_until(_Lock& __lock,
+                                   const chrono::time_point<_Clock, _Duration>& __t)
+{
+    shared_ptr<mutex> __mut = __mut_;
+    unique_lock<mutex> __lk(*__mut);
+    __lock.unlock();
+    unique_ptr<_Lock, __lock_external> __lxx(&__lock);
+    lock_guard<unique_lock<mutex> > __lx(__lk, adopt_lock);
+    return __cv_.wait_until(__lk, __t);
+}  // __mut_.unlock(), __lock.lock()
+
+template <class _Lock, class _Clock, class _Duration, class _Predicate>
+inline
+bool
+condition_variable_any::wait_until(_Lock& __lock,
+                                   const chrono::time_point<_Clock, _Duration>& __t,
+                                   _Predicate __pred)
+{
+    while (!__pred())
+        if (wait_until(__lock, __t) == cv_status::timeout)
+            return __pred();
+    return true;
+}
+
+template <class _Lock, class _Rep, class _Period>
+inline
+cv_status
+condition_variable_any::wait_for(_Lock& __lock,
+                                 const chrono::duration<_Rep, _Period>& __d)
+{
+    return wait_until(__lock, chrono::steady_clock::now() + __d);
+}
+
+template <class _Lock, class _Rep, class _Period, class _Predicate>
+inline
+bool
+condition_variable_any::wait_for(_Lock& __lock,
+                                 const chrono::duration<_Rep, _Period>& __d,
+                                 _Predicate __pred)
+{
+    return wait_until(__lock, chrono::steady_clock::now() + __d,
+                      _VSTD::move(__pred));
+}
+
+_LIBCPP_FUNC_VIS
+void notify_all_at_thread_exit(condition_variable&, unique_lock<mutex>);
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // !_LIBCPP_HAS_NO_THREADS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_CONDITION_VARIABLE
diff --git a/app/src/main/cpp/libcxx/include/coroutine b/app/src/main/cpp/libcxx/include/coroutine
new file mode 100644
index 0000000..f264570
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/coroutine
@@ -0,0 +1,63 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_COROUTINE
+#define _LIBCPP_COROUTINE
+
+/**
+    coroutine synopsis
+
+namespace std {
+// [coroutine.traits]
+template <class R, class... ArgTypes>
+  struct coroutine_traits;
+// [coroutine.handle]
+template <class Promise = void>
+  struct coroutine_handle;
+// [coroutine.handle.compare]
+constexpr bool operator==(coroutine_handle<> x, coroutine_handle<> y) noexcept;
+constexpr strong_ordering operator<=>(coroutine_handle<> x, coroutine_handle<> y) noexcept;
+// [coroutine.handle.hash]
+template <class T> struct hash;
+template <class P> struct hash<coroutine_handle<P>>;
+// [coroutine.noop]
+struct noop_coroutine_promise;
+template<> struct coroutine_handle<noop_coroutine_promise>;
+using noop_coroutine_handle = coroutine_handle<noop_coroutine_promise>;
+noop_coroutine_handle noop_coroutine() noexcept;
+// [coroutine.trivial.awaitables]
+struct suspend_never;
+struct suspend_always;
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__coroutine/coroutine_handle.h>
+#include <__coroutine/coroutine_traits.h>
+#include <__coroutine/noop_coroutine_handle.h>
+#include <__coroutine/trivial_awaitables.h>
+#include <version>
+
+// standard-mandated includes
+
+// [coroutine.syn]
+#include <compare>
+
+#ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
+#  pragma GCC system_header
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <iosfwd>
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_COROUTINE
diff --git a/app/src/main/cpp/libcxx/include/csetjmp b/app/src/main/cpp/libcxx/include/csetjmp
new file mode 100644
index 0000000..4c64e83
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/csetjmp
@@ -0,0 +1,57 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CSETJMP
+#define _LIBCPP_CSETJMP
+
+/*
+    csetjmp synopsis
+
+Macros:
+
+    setjmp
+
+namespace std
+{
+
+Types:
+
+    jmp_buf
+
+void longjmp(jmp_buf env, int val);
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#include <setjmp.h>
+
+#ifndef _LIBCPP_SETJMP_H
+#   error <csetjmp> tried including <setjmp.h> but didn't find libc++'s <setjmp.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::jmp_buf _LIBCPP_USING_IF_EXISTS;
+using ::longjmp _LIBCPP_USING_IF_EXISTS;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CSETJMP
diff --git a/app/src/main/cpp/libcxx/include/csignal b/app/src/main/cpp/libcxx/include/csignal
new file mode 100644
index 0000000..cf45f50
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/csignal
@@ -0,0 +1,65 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CSIGNAL
+#define _LIBCPP_CSIGNAL
+
+/*
+    csignal synopsis
+
+Macros:
+
+    SIG_DFL
+    SIG_ERR
+    SIG_IGN
+    SIGABRT
+    SIGFPE
+    SIGILL
+    SIGINT
+    SIGSEGV
+    SIGTERM
+
+namespace std
+{
+
+Types:
+
+    sig_atomic_t
+
+void (*signal(int sig, void (*func)(int)))(int);
+int raise(int sig);
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+// <signal.h> is not provided by libc++
+#if __has_include(<signal.h>)
+#  include <signal.h>
+#  ifdef _LIBCPP_SIGNAL_H
+#    error "If libc++ starts defining <signal.h>, the __has_include check should move to libc++'s <signal.h>"
+#  endif
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::sig_atomic_t _LIBCPP_USING_IF_EXISTS;
+using ::signal _LIBCPP_USING_IF_EXISTS;
+using ::raise _LIBCPP_USING_IF_EXISTS;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CSIGNAL
diff --git a/app/src/main/cpp/libcxx/include/cstdarg b/app/src/main/cpp/libcxx/include/cstdarg
new file mode 100644
index 0000000..3a4291f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cstdarg
@@ -0,0 +1,55 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CSTDARG
+#define _LIBCPP_CSTDARG
+
+/*
+    cstdarg synopsis
+
+Macros:
+
+    type va_arg(va_list ap, type);
+    void va_copy(va_list dest, va_list src);  // C99
+    void va_end(va_list ap);
+    void va_start(va_list ap, parmN);
+
+namespace std
+{
+
+Types:
+
+    va_list
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+// <stdarg.h> is not provided by libc++
+#if __has_include(<stdarg.h>)
+#  include <stdarg.h>
+#  ifdef _LIBCPP_STDARG_H
+#    error "If libc++ starts defining <stdarg.h>, the __has_include check should move to libc++'s <stdarg.h>"
+#  endif
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::va_list _LIBCPP_USING_IF_EXISTS;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CSTDARG
diff --git a/app/src/main/cpp/libcxx/include/cstdbool b/app/src/main/cpp/libcxx/include/cstdbool
new file mode 100644
index 0000000..ce60803
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cstdbool
@@ -0,0 +1,32 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CSTDBOOL
+#define _LIBCPP_CSTDBOOL
+
+/*
+    cstdbool synopsis
+
+Macros:
+
+    __bool_true_false_are_defined
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#undef __bool_true_false_are_defined
+#define __bool_true_false_are_defined 1
+
+#endif // _LIBCPP_CSTDBOOL
diff --git a/app/src/main/cpp/libcxx/include/cstddef b/app/src/main/cpp/libcxx/include/cstddef
new file mode 100644
index 0000000..e3c0669
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cstddef
@@ -0,0 +1,146 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CSTDDEF
+#define _LIBCPP_CSTDDEF
+
+/*
+    cstddef synopsis
+
+Macros:
+
+    offsetof(type,member-designator)
+    NULL
+
+namespace std
+{
+
+Types:
+
+    ptrdiff_t
+    size_t
+    max_align_t // C++11
+    nullptr_t
+    byte // C++17
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_integral.h>
+#include <version>
+
+#include <stddef.h>
+
+#ifndef _LIBCPP_STDDEF_H
+#   error <cstddef> tried including <stddef.h> but didn't find libc++'s <stddef.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::nullptr_t;
+using ::ptrdiff_t _LIBCPP_USING_IF_EXISTS;
+using ::size_t _LIBCPP_USING_IF_EXISTS;
+
+#if !defined(_LIBCPP_CXX03_LANG)
+using ::max_align_t _LIBCPP_USING_IF_EXISTS;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+namespace std  // purposefully not versioned
+{
+enum class byte : unsigned char {};
+
+_LIBCPP_HIDE_FROM_ABI constexpr byte  operator| (byte  __lhs, byte __rhs) noexcept
+{
+    return static_cast<byte>(
+      static_cast<unsigned char>(
+         static_cast<unsigned int>(__lhs) | static_cast<unsigned int>(__rhs)
+    ));
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr byte& operator|=(byte& __lhs, byte __rhs) noexcept
+{ return __lhs = __lhs | __rhs; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr byte  operator& (byte  __lhs, byte __rhs) noexcept
+{
+    return static_cast<byte>(
+      static_cast<unsigned char>(
+         static_cast<unsigned int>(__lhs) & static_cast<unsigned int>(__rhs)
+    ));
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr byte& operator&=(byte& __lhs, byte __rhs) noexcept
+{ return __lhs = __lhs & __rhs; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr byte  operator^ (byte  __lhs, byte __rhs) noexcept
+{
+    return static_cast<byte>(
+      static_cast<unsigned char>(
+         static_cast<unsigned int>(__lhs) ^ static_cast<unsigned int>(__rhs)
+    ));
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr byte& operator^=(byte& __lhs, byte __rhs) noexcept
+{ return __lhs = __lhs ^ __rhs; }
+
+_LIBCPP_HIDE_FROM_ABI constexpr byte  operator~ (byte __b) noexcept
+{
+    return static_cast<byte>(
+      static_cast<unsigned char>(
+        ~static_cast<unsigned int>(__b)
+    ));
+}
+
+template <class _Tp>
+using _EnableByteOverload = __enable_if_t<is_integral<_Tp>::value, byte>;
+
+template <class _Integer>
+_LIBCPP_HIDE_FROM_ABI constexpr _EnableByteOverload<_Integer> &
+  operator<<=(byte& __lhs, _Integer __shift) noexcept
+  { return __lhs = __lhs << __shift; }
+
+template <class _Integer>
+_LIBCPP_HIDE_FROM_ABI constexpr _EnableByteOverload<_Integer>
+  operator<< (byte  __lhs, _Integer __shift) noexcept
+  { return static_cast<byte>(static_cast<unsigned char>(static_cast<unsigned int>(__lhs) << __shift)); }
+
+template <class _Integer>
+_LIBCPP_HIDE_FROM_ABI constexpr _EnableByteOverload<_Integer> &
+  operator>>=(byte& __lhs, _Integer __shift) noexcept
+  { return __lhs = __lhs >> __shift; }
+
+template <class _Integer>
+_LIBCPP_HIDE_FROM_ABI constexpr _EnableByteOverload<_Integer>
+  operator>> (byte  __lhs, _Integer __shift) noexcept
+  { return static_cast<byte>(static_cast<unsigned char>(static_cast<unsigned int>(__lhs) >> __shift)); }
+
+template <class _Integer, class = _EnableByteOverload<_Integer> >
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr _Integer
+  to_integer(byte __b) noexcept { return static_cast<_Integer>(__b); }
+
+} // namespace std
+
+#endif
+
+#endif // _LIBCPP_CSTDDEF
diff --git a/app/src/main/cpp/libcxx/include/cstdint b/app/src/main/cpp/libcxx/include/cstdint
new file mode 100644
index 0000000..829d939
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cstdint
@@ -0,0 +1,200 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CSTDINT
+#define _LIBCPP_CSTDINT
+
+/*
+    cstdint synopsis
+
+Macros:
+
+    INT8_MIN
+    INT16_MIN
+    INT32_MIN
+    INT64_MIN
+
+    INT8_MAX
+    INT16_MAX
+    INT32_MAX
+    INT64_MAX
+
+    UINT8_MAX
+    UINT16_MAX
+    UINT32_MAX
+    UINT64_MAX
+
+    INT_LEAST8_MIN
+    INT_LEAST16_MIN
+    INT_LEAST32_MIN
+    INT_LEAST64_MIN
+
+    INT_LEAST8_MAX
+    INT_LEAST16_MAX
+    INT_LEAST32_MAX
+    INT_LEAST64_MAX
+
+    UINT_LEAST8_MAX
+    UINT_LEAST16_MAX
+    UINT_LEAST32_MAX
+    UINT_LEAST64_MAX
+
+    INT_FAST8_MIN
+    INT_FAST16_MIN
+    INT_FAST32_MIN
+    INT_FAST64_MIN
+
+    INT_FAST8_MAX
+    INT_FAST16_MAX
+    INT_FAST32_MAX
+    INT_FAST64_MAX
+
+    UINT_FAST8_MAX
+    UINT_FAST16_MAX
+    UINT_FAST32_MAX
+    UINT_FAST64_MAX
+
+    INTPTR_MIN
+    INTPTR_MAX
+    UINTPTR_MAX
+
+    INTMAX_MIN
+    INTMAX_MAX
+
+    UINTMAX_MAX
+
+    PTRDIFF_MIN
+    PTRDIFF_MAX
+
+    SIG_ATOMIC_MIN
+    SIG_ATOMIC_MAX
+
+    SIZE_MAX
+
+    WCHAR_MIN
+    WCHAR_MAX
+
+    WINT_MIN
+    WINT_MAX
+
+    INT8_C(value)
+    INT16_C(value)
+    INT32_C(value)
+    INT64_C(value)
+
+    UINT8_C(value)
+    UINT16_C(value)
+    UINT32_C(value)
+    UINT64_C(value)
+
+    INTMAX_C(value)
+    UINTMAX_C(value)
+
+namespace std
+{
+
+Types:
+
+    int8_t
+    int16_t
+    int32_t
+    int64_t
+
+    uint8_t
+    uint16_t
+    uint32_t
+    uint64_t
+
+    int_least8_t
+    int_least16_t
+    int_least32_t
+    int_least64_t
+
+    uint_least8_t
+    uint_least16_t
+    uint_least32_t
+    uint_least64_t
+
+    int_fast8_t
+    int_fast16_t
+    int_fast32_t
+    int_fast64_t
+
+    uint_fast8_t
+    uint_fast16_t
+    uint_fast32_t
+    uint_fast64_t
+
+    intptr_t
+    uintptr_t
+
+    intmax_t
+    uintmax_t
+
+}  // std
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#include <stdint.h>
+
+#ifndef _LIBCPP_STDINT_H
+#   error <cstdint> tried including <stdint.h> but didn't find libc++'s <stdint.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::int8_t _LIBCPP_USING_IF_EXISTS;
+using ::int16_t _LIBCPP_USING_IF_EXISTS;
+using ::int32_t _LIBCPP_USING_IF_EXISTS;
+using ::int64_t _LIBCPP_USING_IF_EXISTS;
+
+using ::uint8_t _LIBCPP_USING_IF_EXISTS;
+using ::uint16_t _LIBCPP_USING_IF_EXISTS;
+using ::uint32_t _LIBCPP_USING_IF_EXISTS;
+using ::uint64_t _LIBCPP_USING_IF_EXISTS;
+
+using ::int_least8_t _LIBCPP_USING_IF_EXISTS;
+using ::int_least16_t _LIBCPP_USING_IF_EXISTS;
+using ::int_least32_t _LIBCPP_USING_IF_EXISTS;
+using ::int_least64_t _LIBCPP_USING_IF_EXISTS;
+
+using ::uint_least8_t _LIBCPP_USING_IF_EXISTS;
+using ::uint_least16_t _LIBCPP_USING_IF_EXISTS;
+using ::uint_least32_t _LIBCPP_USING_IF_EXISTS;
+using ::uint_least64_t _LIBCPP_USING_IF_EXISTS;
+
+using ::int_fast8_t _LIBCPP_USING_IF_EXISTS;
+using ::int_fast16_t _LIBCPP_USING_IF_EXISTS;
+using ::int_fast32_t _LIBCPP_USING_IF_EXISTS;
+using ::int_fast64_t _LIBCPP_USING_IF_EXISTS;
+
+using ::uint_fast8_t _LIBCPP_USING_IF_EXISTS;
+using ::uint_fast16_t _LIBCPP_USING_IF_EXISTS;
+using ::uint_fast32_t _LIBCPP_USING_IF_EXISTS;
+using ::uint_fast64_t _LIBCPP_USING_IF_EXISTS;
+
+using ::intptr_t _LIBCPP_USING_IF_EXISTS;
+using ::uintptr_t _LIBCPP_USING_IF_EXISTS;
+
+using ::intmax_t _LIBCPP_USING_IF_EXISTS;
+using ::uintmax_t _LIBCPP_USING_IF_EXISTS;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CSTDINT
diff --git a/app/src/main/cpp/libcxx/include/cstdio b/app/src/main/cpp/libcxx/include/cstdio
new file mode 100644
index 0000000..221b0b3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cstdio
@@ -0,0 +1,179 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CSTDIO
+#define _LIBCPP_CSTDIO
+
+/*
+    cstdio synopsis
+
+Macros:
+
+    BUFSIZ
+    EOF
+    FILENAME_MAX
+    FOPEN_MAX
+    L_tmpnam
+    NULL
+    SEEK_CUR
+    SEEK_END
+    SEEK_SET
+    TMP_MAX
+    _IOFBF
+    _IOLBF
+    _IONBF
+    stderr
+    stdin
+    stdout
+
+namespace std
+{
+
+Types:
+
+FILE
+fpos_t
+size_t
+
+int remove(const char* filename);
+int rename(const char* old, const char* new);
+FILE* tmpfile(void);
+char* tmpnam(char* s);
+int fclose(FILE* stream);
+int fflush(FILE* stream);
+FILE* fopen(const char* restrict filename, const char* restrict mode);
+FILE* freopen(const char* restrict filename, const char * restrict mode,
+              FILE * restrict stream);
+void setbuf(FILE* restrict stream, char* restrict buf);
+int setvbuf(FILE* restrict stream, char* restrict buf, int mode, size_t size);
+int fprintf(FILE* restrict stream, const char* restrict format, ...);
+int fscanf(FILE* restrict stream, const char * restrict format, ...);
+int printf(const char* restrict format, ...);
+int scanf(const char* restrict format, ...);
+int snprintf(char* restrict s, size_t n, const char* restrict format, ...);    // C99
+int sprintf(char* restrict s, const char* restrict format, ...);
+int sscanf(const char* restrict s, const char* restrict format, ...);
+int vfprintf(FILE* restrict stream, const char* restrict format, va_list arg);
+int vfscanf(FILE* restrict stream, const char* restrict format, va_list arg);  // C99
+int vprintf(const char* restrict format, va_list arg);
+int vscanf(const char* restrict format, va_list arg);                          // C99
+int vsnprintf(char* restrict s, size_t n, const char* restrict format,         // C99
+              va_list arg);
+int vsprintf(char* restrict s, const char* restrict format, va_list arg);
+int vsscanf(const char* restrict s, const char* restrict format, va_list arg); // C99
+int fgetc(FILE* stream);
+char* fgets(char* restrict s, int n, FILE* restrict stream);
+int fputc(int c, FILE* stream);
+int fputs(const char* restrict s, FILE* restrict stream);
+int getc(FILE* stream);
+int getchar(void);
+char* gets(char* s);  // removed in C++14
+int putc(int c, FILE* stream);
+int putchar(int c);
+int puts(const char* s);
+int ungetc(int c, FILE* stream);
+size_t fread(void* restrict ptr, size_t size, size_t nmemb,
+             FILE* restrict stream);
+size_t fwrite(const void* restrict ptr, size_t size, size_t nmemb,
+              FILE* restrict stream);
+int fgetpos(FILE* restrict stream, fpos_t* restrict pos);
+int fseek(FILE* stream, long offset, int whence);
+int fsetpos(FILE*stream, const fpos_t* pos);
+long ftell(FILE* stream);
+void rewind(FILE* stream);
+void clearerr(FILE* stream);
+int feof(FILE* stream);
+int ferror(FILE* stream);
+void perror(const char* s);
+
+}  // std
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#include <stdio.h>
+
+#ifndef _LIBCPP_STDIO_H
+#   error <cstdio> tried including <stdio.h> but didn't find libc++'s <stdio.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::FILE _LIBCPP_USING_IF_EXISTS;
+using ::fpos_t _LIBCPP_USING_IF_EXISTS;
+using ::size_t _LIBCPP_USING_IF_EXISTS;
+
+using ::fclose _LIBCPP_USING_IF_EXISTS;
+using ::fflush _LIBCPP_USING_IF_EXISTS;
+using ::setbuf _LIBCPP_USING_IF_EXISTS;
+using ::setvbuf _LIBCPP_USING_IF_EXISTS;
+using ::fprintf _LIBCPP_USING_IF_EXISTS;
+using ::fscanf _LIBCPP_USING_IF_EXISTS;
+using ::snprintf _LIBCPP_USING_IF_EXISTS;
+using ::sprintf _LIBCPP_USING_IF_EXISTS;
+using ::sscanf _LIBCPP_USING_IF_EXISTS;
+using ::vfprintf _LIBCPP_USING_IF_EXISTS;
+using ::vfscanf _LIBCPP_USING_IF_EXISTS;
+using ::vsscanf _LIBCPP_USING_IF_EXISTS;
+using ::vsnprintf _LIBCPP_USING_IF_EXISTS;
+using ::vsprintf _LIBCPP_USING_IF_EXISTS;
+using ::fgetc _LIBCPP_USING_IF_EXISTS;
+using ::fgets _LIBCPP_USING_IF_EXISTS;
+using ::fputc _LIBCPP_USING_IF_EXISTS;
+using ::fputs _LIBCPP_USING_IF_EXISTS;
+using ::getc _LIBCPP_USING_IF_EXISTS;
+using ::putc _LIBCPP_USING_IF_EXISTS;
+using ::ungetc _LIBCPP_USING_IF_EXISTS;
+using ::fread _LIBCPP_USING_IF_EXISTS;
+using ::fwrite _LIBCPP_USING_IF_EXISTS;
+#ifndef _LIBCPP_HAS_NO_FGETPOS_FSETPOS
+using ::fgetpos _LIBCPP_USING_IF_EXISTS;
+#endif
+using ::fseek _LIBCPP_USING_IF_EXISTS;
+#ifndef _LIBCPP_HAS_NO_FGETPOS_FSETPOS
+using ::fsetpos _LIBCPP_USING_IF_EXISTS;
+#endif
+using ::ftell _LIBCPP_USING_IF_EXISTS;
+using ::rewind _LIBCPP_USING_IF_EXISTS;
+using ::clearerr _LIBCPP_USING_IF_EXISTS;
+using ::feof _LIBCPP_USING_IF_EXISTS;
+using ::ferror _LIBCPP_USING_IF_EXISTS;
+using ::perror _LIBCPP_USING_IF_EXISTS;
+
+using ::fopen _LIBCPP_USING_IF_EXISTS;
+using ::freopen _LIBCPP_USING_IF_EXISTS;
+using ::remove _LIBCPP_USING_IF_EXISTS;
+using ::rename _LIBCPP_USING_IF_EXISTS;
+using ::tmpfile _LIBCPP_USING_IF_EXISTS;
+using ::tmpnam _LIBCPP_USING_IF_EXISTS;
+
+using ::getchar _LIBCPP_USING_IF_EXISTS;
+#if _LIBCPP_STD_VER <= 11 && !defined(_LIBCPP_C_HAS_NO_GETS)
+using ::gets _LIBCPP_USING_IF_EXISTS;
+#endif
+using ::scanf _LIBCPP_USING_IF_EXISTS;
+using ::vscanf _LIBCPP_USING_IF_EXISTS;
+
+using ::printf _LIBCPP_USING_IF_EXISTS;
+using ::putchar _LIBCPP_USING_IF_EXISTS;
+using ::puts _LIBCPP_USING_IF_EXISTS;
+using ::vprintf _LIBCPP_USING_IF_EXISTS;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CSTDIO
diff --git a/app/src/main/cpp/libcxx/include/cstdlib b/app/src/main/cpp/libcxx/include/cstdlib
new file mode 100644
index 0000000..25c9de5
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cstdlib
@@ -0,0 +1,153 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CSTDLIB
+#define _LIBCPP_CSTDLIB
+
+/*
+    cstdlib synopsis
+
+Macros:
+
+    EXIT_FAILURE
+    EXIT_SUCCESS
+    MB_CUR_MAX
+    NULL
+    RAND_MAX
+
+namespace std
+{
+
+Types:
+
+    size_t
+    div_t
+    ldiv_t
+    lldiv_t                                                               // C99
+
+double    atof (const char* nptr);
+int       atoi (const char* nptr);
+long      atol (const char* nptr);
+long long atoll(const char* nptr);                                        // C99
+double             strtod  (const char* restrict nptr, char** restrict endptr);
+float              strtof  (const char* restrict nptr, char** restrict endptr); // C99
+long double        strtold (const char* restrict nptr, char** restrict endptr); // C99
+long               strtol  (const char* restrict nptr, char** restrict endptr, int base);
+long long          strtoll (const char* restrict nptr, char** restrict endptr, int base); // C99
+unsigned long      strtoul (const char* restrict nptr, char** restrict endptr, int base);
+unsigned long long strtoull(const char* restrict nptr, char** restrict endptr, int base); // C99
+int rand(void);
+void srand(unsigned int seed);
+void* calloc(size_t nmemb, size_t size);
+void free(void* ptr);
+void* malloc(size_t size);
+void* realloc(void* ptr, size_t size);
+void abort(void);
+int atexit(void (*func)(void));
+void exit(int status);
+void _Exit(int status);
+char* getenv(const char* name);
+int system(const char* string);
+void* bsearch(const void* key, const void* base, size_t nmemb, size_t size,
+              int (*compar)(const void *, const void *));
+void qsort(void* base, size_t nmemb, size_t size,
+           int (*compar)(const void *, const void *));
+int         abs(      int j);
+long        abs(     long j);
+long long   abs(long long j);                                             // C++0X
+long       labs(     long j);
+long long llabs(long long j);                                             // C99
+div_t     div(      int numer,       int denom);
+ldiv_t    div(     long numer,      long denom);
+lldiv_t   div(long long numer, long long denom);                          // C++0X
+ldiv_t   ldiv(     long numer,      long denom);
+lldiv_t lldiv(long long numer, long long denom);                          // C99
+int mblen(const char* s, size_t n);
+int mbtowc(wchar_t* restrict pwc, const char* restrict s, size_t n);
+int wctomb(char* s, wchar_t wchar);
+size_t mbstowcs(wchar_t* restrict pwcs, const char* restrict s, size_t n);
+size_t wcstombs(char* restrict s, const wchar_t* restrict pwcs, size_t n);
+int at_quick_exit(void (*func)(void))                                     // C++11
+void quick_exit(int status);                                              // C++11
+void *aligned_alloc(size_t alignment, size_t size);                       // C11
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#include <stdlib.h>
+
+#ifndef _LIBCPP_STDLIB_H
+#   error <cstdlib> tried including <stdlib.h> but didn't find libc++'s <stdlib.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::size_t _LIBCPP_USING_IF_EXISTS;
+using ::div_t _LIBCPP_USING_IF_EXISTS;
+using ::ldiv_t _LIBCPP_USING_IF_EXISTS;
+using ::lldiv_t _LIBCPP_USING_IF_EXISTS;
+using ::atof _LIBCPP_USING_IF_EXISTS;
+using ::atoi _LIBCPP_USING_IF_EXISTS;
+using ::atol _LIBCPP_USING_IF_EXISTS;
+using ::atoll _LIBCPP_USING_IF_EXISTS;
+using ::strtod _LIBCPP_USING_IF_EXISTS;
+using ::strtof _LIBCPP_USING_IF_EXISTS;
+using ::strtold _LIBCPP_USING_IF_EXISTS;
+using ::strtol _LIBCPP_USING_IF_EXISTS;
+using ::strtoll _LIBCPP_USING_IF_EXISTS;
+using ::strtoul _LIBCPP_USING_IF_EXISTS;
+using ::strtoull _LIBCPP_USING_IF_EXISTS;
+using ::rand _LIBCPP_USING_IF_EXISTS;
+using ::srand _LIBCPP_USING_IF_EXISTS;
+using ::calloc _LIBCPP_USING_IF_EXISTS;
+using ::free _LIBCPP_USING_IF_EXISTS;
+using ::malloc _LIBCPP_USING_IF_EXISTS;
+using ::realloc _LIBCPP_USING_IF_EXISTS;
+using ::abort _LIBCPP_USING_IF_EXISTS;
+using ::atexit _LIBCPP_USING_IF_EXISTS;
+using ::exit _LIBCPP_USING_IF_EXISTS;
+using ::_Exit _LIBCPP_USING_IF_EXISTS;
+using ::getenv _LIBCPP_USING_IF_EXISTS;
+using ::system _LIBCPP_USING_IF_EXISTS;
+using ::bsearch _LIBCPP_USING_IF_EXISTS;
+using ::qsort _LIBCPP_USING_IF_EXISTS;
+using ::abs _LIBCPP_USING_IF_EXISTS;
+using ::labs _LIBCPP_USING_IF_EXISTS;
+using ::llabs _LIBCPP_USING_IF_EXISTS;
+using ::div _LIBCPP_USING_IF_EXISTS;
+using ::ldiv _LIBCPP_USING_IF_EXISTS;
+using ::lldiv _LIBCPP_USING_IF_EXISTS;
+using ::mblen _LIBCPP_USING_IF_EXISTS;
+using ::mbtowc _LIBCPP_USING_IF_EXISTS;
+using ::wctomb _LIBCPP_USING_IF_EXISTS;
+using ::mbstowcs _LIBCPP_USING_IF_EXISTS;
+using ::wcstombs _LIBCPP_USING_IF_EXISTS;
+#if !defined(_LIBCPP_CXX03_LANG)
+using ::at_quick_exit _LIBCPP_USING_IF_EXISTS;
+using ::quick_exit _LIBCPP_USING_IF_EXISTS;
+#endif
+#if _LIBCPP_STD_VER > 14
+using ::aligned_alloc _LIBCPP_USING_IF_EXISTS;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CSTDLIB
diff --git a/app/src/main/cpp/libcxx/include/cstring b/app/src/main/cpp/libcxx/include/cstring
new file mode 100644
index 0000000..c88d977
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cstring
@@ -0,0 +1,152 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CSTRING
+#define _LIBCPP_CSTRING
+
+/*
+    cstring synopsis
+
+Macros:
+
+    NULL
+
+namespace std
+{
+
+Types:
+
+    size_t
+
+void* memcpy(void* restrict s1, const void* restrict s2, size_t n);
+void* memmove(void* s1, const void* s2, size_t n);
+char* strcpy (char* restrict s1, const char* restrict s2);
+char* strncpy(char* restrict s1, const char* restrict s2, size_t n);
+char* strcat (char* restrict s1, const char* restrict s2);
+char* strncat(char* restrict s1, const char* restrict s2, size_t n);
+int memcmp(const void* s1, const void* s2, size_t n);
+int strcmp (const char* s1, const char* s2);
+int strncmp(const char* s1, const char* s2, size_t n);
+int strcoll(const char* s1, const char* s2);
+size_t strxfrm(char* restrict s1, const char* restrict s2, size_t n);
+const void* memchr(const void* s, int c, size_t n);
+      void* memchr(      void* s, int c, size_t n);
+const char* strchr(const char* s, int c);
+      char* strchr(      char* s, int c);
+size_t strcspn(const char* s1, const char* s2);
+const char* strpbrk(const char* s1, const char* s2);
+      char* strpbrk(      char* s1, const char* s2);
+const char* strrchr(const char* s, int c);
+      char* strrchr(      char* s, int c);
+size_t strspn(const char* s1, const char* s2);
+const char* strstr(const char* s1, const char* s2);
+      char* strstr(      char* s1, const char* s2);
+char* strtok(char* restrict s1, const char* restrict s2);
+void* memset(void* s, int c, size_t n);
+char* strerror(int errnum);
+size_t strlen(const char* s);
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__type_traits/is_constant_evaluated.h>
+
+#include <string.h>
+
+#ifndef _LIBCPP_STRING_H
+#   error <cstring> tried including <string.h> but didn't find libc++'s <string.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::size_t _LIBCPP_USING_IF_EXISTS;
+using ::memcpy _LIBCPP_USING_IF_EXISTS;
+using ::memmove _LIBCPP_USING_IF_EXISTS;
+using ::strcpy _LIBCPP_USING_IF_EXISTS;
+using ::strncpy _LIBCPP_USING_IF_EXISTS;
+using ::strcat _LIBCPP_USING_IF_EXISTS;
+using ::strncat _LIBCPP_USING_IF_EXISTS;
+using ::memcmp _LIBCPP_USING_IF_EXISTS;
+using ::strcmp _LIBCPP_USING_IF_EXISTS;
+using ::strncmp _LIBCPP_USING_IF_EXISTS;
+using ::strcoll _LIBCPP_USING_IF_EXISTS;
+using ::strxfrm _LIBCPP_USING_IF_EXISTS;
+using ::memchr _LIBCPP_USING_IF_EXISTS;
+using ::strchr _LIBCPP_USING_IF_EXISTS;
+using ::strcspn _LIBCPP_USING_IF_EXISTS;
+using ::strpbrk _LIBCPP_USING_IF_EXISTS;
+using ::strrchr _LIBCPP_USING_IF_EXISTS;
+using ::strspn _LIBCPP_USING_IF_EXISTS;
+using ::strstr _LIBCPP_USING_IF_EXISTS;
+using ::strtok _LIBCPP_USING_IF_EXISTS;
+using ::memset _LIBCPP_USING_IF_EXISTS;
+using ::strerror _LIBCPP_USING_IF_EXISTS;
+using ::strlen _LIBCPP_USING_IF_EXISTS;
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 size_t __constexpr_strlen(const char* __str) {
+  // GCC currently doesn't support __builtin_strlen for heap-allocated memory during constant evaluation.
+  // https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70816
+#ifdef _LIBCPP_COMPILER_GCC
+  if (__libcpp_is_constant_evaluated()) {
+    size_t __i = 0;
+    for (; __str[__i] != '\0'; ++__i)
+      ;
+    return __i;
+  }
+#endif
+  return __builtin_strlen(__str);
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 int
+__constexpr_memcmp(const _Tp* __lhs, const _Tp* __rhs, size_t __count) {
+#ifdef _LIBCPP_COMPILER_GCC
+  if (__libcpp_is_constant_evaluated()) {
+    for (; __count; --__count, ++__lhs, ++__rhs) {
+      if (*__lhs < *__rhs)
+        return -1;
+      if (*__rhs < *__lhs)
+        return 1;
+    }
+    return 0;
+  }
+#endif
+  return __builtin_memcmp(__lhs, __rhs, __count);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const char*
+__constexpr_char_memchr(const char* __str, int __char, size_t __count) {
+#if __has_builtin(__builtin_char_memchr)
+  return __builtin_char_memchr(__str, __char, __count);
+#else
+  if (!__libcpp_is_constant_evaluated())
+    return static_cast<const char*>(std::memchr(__str, __char, __count));
+  for (; __count; --__count) {
+    if (*__str == __char)
+      return __str;
+    ++__str;
+  }
+  return nullptr;
+#endif
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CSTRING
diff --git a/app/src/main/cpp/libcxx/include/ctgmath b/app/src/main/cpp/libcxx/include/ctgmath
new file mode 100644
index 0000000..bfcf2f9
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/ctgmath
@@ -0,0 +1,29 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CTGMATH
+#define _LIBCPP_CTGMATH
+
+/*
+    ctgmath synopsis
+
+#include <ccomplex>
+#include <cmath>
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <ccomplex>
+#include <cmath>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif // _LIBCPP_CTGMATH
diff --git a/app/src/main/cpp/libcxx/include/ctime b/app/src/main/cpp/libcxx/include/ctime
new file mode 100644
index 0000000..2293675
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/ctime
@@ -0,0 +1,87 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CTIME
+#define _LIBCPP_CTIME
+
+/*
+    ctime synopsis
+
+Macros:
+
+    NULL
+    CLOCKS_PER_SEC
+    TIME_UTC // C++17
+
+namespace std
+{
+
+Types:
+
+    clock_t
+    size_t
+    time_t
+    tm
+    timespec // C++17
+
+clock_t clock();
+double difftime(time_t time1, time_t time0);
+time_t mktime(tm* timeptr);
+time_t time(time_t* timer);
+char* asctime(const tm* timeptr);
+char* ctime(const time_t* timer);
+tm*    gmtime(const time_t* timer);
+tm* localtime(const time_t* timer);
+size_t strftime(char* restrict s, size_t maxsize, const char* restrict format,
+                const tm* restrict timeptr);
+int timespec_get( struct timespec *ts, int base); // C++17
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+// <time.h> is not provided by libc++
+#if __has_include(<time.h>)
+#  include <time.h>
+#  ifdef _LIBCPP_TIME_H
+#    error "If libc++ starts defining <time.h>, the __has_include check should move to libc++'s <time.h>"
+#  endif
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::clock_t _LIBCPP_USING_IF_EXISTS;
+using ::size_t _LIBCPP_USING_IF_EXISTS;
+using ::time_t _LIBCPP_USING_IF_EXISTS;
+using ::tm _LIBCPP_USING_IF_EXISTS;
+#if _LIBCPP_STD_VER > 14
+using ::timespec _LIBCPP_USING_IF_EXISTS;
+#endif
+using ::clock _LIBCPP_USING_IF_EXISTS;
+using ::difftime _LIBCPP_USING_IF_EXISTS;
+using ::mktime _LIBCPP_USING_IF_EXISTS;
+using ::time _LIBCPP_USING_IF_EXISTS;
+using ::asctime _LIBCPP_USING_IF_EXISTS;
+using ::ctime _LIBCPP_USING_IF_EXISTS;
+using ::gmtime _LIBCPP_USING_IF_EXISTS;
+using ::localtime _LIBCPP_USING_IF_EXISTS;
+using ::strftime _LIBCPP_USING_IF_EXISTS;
+#if _LIBCPP_STD_VER > 14
+using ::timespec_get _LIBCPP_USING_IF_EXISTS;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CTIME
diff --git a/app/src/main/cpp/libcxx/include/ctype.h b/app/src/main/cpp/libcxx/include/ctype.h
new file mode 100644
index 0000000..728173e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/ctype.h
@@ -0,0 +1,61 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CTYPE_H
+#define _LIBCPP_CTYPE_H
+
+/*
+    ctype.h synopsis
+
+int isalnum(int c);
+int isalpha(int c);
+int isblank(int c);  // C99
+int iscntrl(int c);
+int isdigit(int c);
+int isgraph(int c);
+int islower(int c);
+int isprint(int c);
+int ispunct(int c);
+int isspace(int c);
+int isupper(int c);
+int isxdigit(int c);
+int tolower(int c);
+int toupper(int c);
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if __has_include_next(<ctype.h>)
+#  include_next <ctype.h>
+#endif
+
+#ifdef __cplusplus
+
+#undef isalnum
+#undef isalpha
+#undef isblank
+#undef iscntrl
+#undef isdigit
+#undef isgraph
+#undef islower
+#undef isprint
+#undef ispunct
+#undef isspace
+#undef isupper
+#undef isxdigit
+#undef tolower
+#undef toupper
+
+#endif
+
+#endif // _LIBCPP_CTYPE_H
diff --git a/app/src/main/cpp/libcxx/include/cuchar b/app/src/main/cpp/libcxx/include/cuchar
new file mode 100644
index 0000000..93e657e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cuchar
@@ -0,0 +1,76 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CUCHAR
+#define _LIBCPP_CUCHAR
+
+/*
+    cuchar synopsis // since C++11
+
+Macros:
+
+    __STDC_UTF_16__
+    __STDC_UTF_32__
+
+namespace std {
+
+Types:
+
+  mbstate_t
+  size_t
+
+size_t mbrtoc8(char8_t* pc8, const char* s, size_t n, mbstate_t* ps);   // since C++20
+size_t c8rtomb(char* s, char8_t c8, mbstate_t* ps);                     // since C++20
+size_t mbrtoc16(char16_t* pc16, const char* s, size_t n, mbstate_t* ps);
+size_t c16rtomb(char* s, char16_t c16, mbstate_t* ps);
+size_t mbrtoc32(char32_t* pc32, const char* s, size_t n, mbstate_t* ps);
+size_t c32rtomb(char* s, char32_t c32, mbstate_t* ps);
+
+} // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#include <uchar.h>
+
+#ifndef _LIBCPP_UCHAR_H
+#   error <cuchar> tried including <uchar.h> but didn't find libc++'s <uchar.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if !defined(_LIBCPP_CXX03_LANG)
+
+using ::mbstate_t _LIBCPP_USING_IF_EXISTS;
+using ::size_t _LIBCPP_USING_IF_EXISTS;
+
+#  if !defined(_LIBCPP_HAS_NO_C8RTOMB_MBRTOC8)
+using ::mbrtoc8 _LIBCPP_USING_IF_EXISTS;
+using ::c8rtomb _LIBCPP_USING_IF_EXISTS;
+#  endif
+using ::mbrtoc16 _LIBCPP_USING_IF_EXISTS;
+using ::c16rtomb _LIBCPP_USING_IF_EXISTS;
+using ::mbrtoc32 _LIBCPP_USING_IF_EXISTS;
+using ::c32rtomb _LIBCPP_USING_IF_EXISTS;
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif  // _LIBCPP_CUCHAR
diff --git a/app/src/main/cpp/libcxx/include/cwchar b/app/src/main/cpp/libcxx/include/cwchar
new file mode 100644
index 0000000..fb7b92b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cwchar
@@ -0,0 +1,244 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CWCHAR
+#define _LIBCPP_CWCHAR
+
+/*
+    cwchar synopsis
+
+Macros:
+
+    NULL
+    WCHAR_MAX
+    WCHAR_MIN
+    WEOF
+
+namespace std
+{
+
+Types:
+
+    mbstate_t
+    size_t
+    tm
+    wint_t
+
+int fwprintf(FILE* restrict stream, const wchar_t* restrict format, ...);
+int fwscanf(FILE* restrict stream, const wchar_t* restrict format, ...);
+int swprintf(wchar_t* restrict s, size_t n, const wchar_t* restrict format, ...);
+int swscanf(const wchar_t* restrict s, const wchar_t* restrict format, ...);
+int vfwprintf(FILE* restrict stream, const wchar_t* restrict format, va_list arg);
+int vfwscanf(FILE* restrict stream, const wchar_t* restrict format, va_list arg);  // C99
+int vswprintf(wchar_t* restrict s, size_t n, const wchar_t* restrict format, va_list arg);
+int vswscanf(const wchar_t* restrict s, const wchar_t* restrict format, va_list arg);  // C99
+int vwprintf(const wchar_t* restrict format, va_list arg);
+int vwscanf(const wchar_t* restrict format, va_list arg);  // C99
+int wprintf(const wchar_t* restrict format, ...);
+int wscanf(const wchar_t* restrict format, ...);
+wint_t fgetwc(FILE* stream);
+wchar_t* fgetws(wchar_t* restrict s, int n, FILE* restrict stream);
+wint_t fputwc(wchar_t c, FILE* stream);
+int fputws(const wchar_t* restrict s, FILE* restrict stream);
+int fwide(FILE* stream, int mode);
+wint_t getwc(FILE* stream);
+wint_t getwchar();
+wint_t putwc(wchar_t c, FILE* stream);
+wint_t putwchar(wchar_t c);
+wint_t ungetwc(wint_t c, FILE* stream);
+double wcstod(const wchar_t* restrict nptr, wchar_t** restrict endptr);
+float wcstof(const wchar_t* restrict nptr, wchar_t** restrict endptr);         // C99
+long double wcstold(const wchar_t* restrict nptr, wchar_t** restrict endptr);  // C99
+long wcstol(const wchar_t* restrict nptr, wchar_t** restrict endptr, int base);
+long long wcstoll(const wchar_t* restrict nptr, wchar_t** restrict endptr, int base);  // C99
+unsigned long wcstoul(const wchar_t* restrict nptr, wchar_t** restrict endptr, int base);
+unsigned long long wcstoull(const wchar_t* restrict nptr, wchar_t** restrict endptr, int base);  // C99
+wchar_t* wcscpy(wchar_t* restrict s1, const wchar_t* restrict s2);
+wchar_t* wcsncpy(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
+wchar_t* wcscat(wchar_t* restrict s1, const wchar_t* restrict s2);
+wchar_t* wcsncat(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
+int wcscmp(const wchar_t* s1, const wchar_t* s2);
+int wcscoll(const wchar_t* s1, const wchar_t* s2);
+int wcsncmp(const wchar_t* s1, const wchar_t* s2, size_t n);
+size_t wcsxfrm(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
+const wchar_t* wcschr(const wchar_t* s, wchar_t c);
+      wchar_t* wcschr(      wchar_t* s, wchar_t c);
+size_t wcscspn(const wchar_t* s1, const wchar_t* s2);
+size_t wcslen(const wchar_t* s);
+const wchar_t* wcspbrk(const wchar_t* s1, const wchar_t* s2);
+      wchar_t* wcspbrk(      wchar_t* s1, const wchar_t* s2);
+const wchar_t* wcsrchr(const wchar_t* s, wchar_t c);
+      wchar_t* wcsrchr(      wchar_t* s, wchar_t c);
+size_t wcsspn(const wchar_t* s1, const wchar_t* s2);
+const wchar_t* wcsstr(const wchar_t* s1, const wchar_t* s2);
+      wchar_t* wcsstr(      wchar_t* s1, const wchar_t* s2);
+wchar_t* wcstok(wchar_t* restrict s1, const wchar_t* restrict s2, wchar_t** restrict ptr);
+const wchar_t* wmemchr(const wchar_t* s, wchar_t c, size_t n);
+      wchar_t* wmemchr(      wchar_t* s, wchar_t c, size_t n);
+int wmemcmp(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
+wchar_t* wmemcpy(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
+wchar_t* wmemmove(wchar_t* s1, const wchar_t* s2, size_t n);
+wchar_t* wmemset(wchar_t* s, wchar_t c, size_t n);
+size_t wcsftime(wchar_t* restrict s, size_t maxsize, const wchar_t* restrict format,
+                const tm* restrict timeptr);
+wint_t btowc(int c);
+int wctob(wint_t c);
+int mbsinit(const mbstate_t* ps);
+size_t mbrlen(const char* restrict s, size_t n, mbstate_t* restrict ps);
+size_t mbrtowc(wchar_t* restrict pwc, const char* restrict s, size_t n, mbstate_t* restrict ps);
+size_t wcrtomb(char* restrict s, wchar_t wc, mbstate_t* restrict ps);
+size_t mbsrtowcs(wchar_t* restrict dst, const char** restrict src, size_t len,
+                 mbstate_t* restrict ps);
+size_t wcsrtombs(char* restrict dst, const wchar_t** restrict src, size_t len,
+                 mbstate_t* restrict ps);
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__type_traits/is_constant_evaluated.h>
+#include <cwctype>
+
+#include <wchar.h>
+
+#ifndef _LIBCPP_WCHAR_H
+#   error <cwchar> tried including <wchar.h> but didn't find libc++'s <wchar.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+using ::mbstate_t _LIBCPP_USING_IF_EXISTS;
+using ::size_t _LIBCPP_USING_IF_EXISTS;
+using ::tm _LIBCPP_USING_IF_EXISTS;
+using ::wint_t _LIBCPP_USING_IF_EXISTS;
+using ::FILE _LIBCPP_USING_IF_EXISTS;
+using ::fwprintf _LIBCPP_USING_IF_EXISTS;
+using ::fwscanf _LIBCPP_USING_IF_EXISTS;
+using ::swprintf _LIBCPP_USING_IF_EXISTS;
+using ::vfwprintf _LIBCPP_USING_IF_EXISTS;
+using ::vswprintf _LIBCPP_USING_IF_EXISTS;
+using ::swscanf _LIBCPP_USING_IF_EXISTS;
+using ::vfwscanf _LIBCPP_USING_IF_EXISTS;
+using ::vswscanf _LIBCPP_USING_IF_EXISTS;
+using ::fgetwc _LIBCPP_USING_IF_EXISTS;
+using ::fgetws _LIBCPP_USING_IF_EXISTS;
+using ::fputwc _LIBCPP_USING_IF_EXISTS;
+using ::fputws _LIBCPP_USING_IF_EXISTS;
+using ::fwide _LIBCPP_USING_IF_EXISTS;
+using ::getwc _LIBCPP_USING_IF_EXISTS;
+using ::putwc _LIBCPP_USING_IF_EXISTS;
+using ::ungetwc _LIBCPP_USING_IF_EXISTS;
+using ::wcstod _LIBCPP_USING_IF_EXISTS;
+using ::wcstof _LIBCPP_USING_IF_EXISTS;
+using ::wcstold _LIBCPP_USING_IF_EXISTS;
+using ::wcstol _LIBCPP_USING_IF_EXISTS;
+using ::wcstoll _LIBCPP_USING_IF_EXISTS;
+using ::wcstoul _LIBCPP_USING_IF_EXISTS;
+using ::wcstoull _LIBCPP_USING_IF_EXISTS;
+using ::wcscpy _LIBCPP_USING_IF_EXISTS;
+using ::wcsncpy _LIBCPP_USING_IF_EXISTS;
+using ::wcscat _LIBCPP_USING_IF_EXISTS;
+using ::wcsncat _LIBCPP_USING_IF_EXISTS;
+using ::wcscmp _LIBCPP_USING_IF_EXISTS;
+using ::wcscoll _LIBCPP_USING_IF_EXISTS;
+using ::wcsncmp _LIBCPP_USING_IF_EXISTS;
+using ::wcsxfrm _LIBCPP_USING_IF_EXISTS;
+using ::wcschr _LIBCPP_USING_IF_EXISTS;
+using ::wcspbrk _LIBCPP_USING_IF_EXISTS;
+using ::wcsrchr _LIBCPP_USING_IF_EXISTS;
+using ::wcsstr _LIBCPP_USING_IF_EXISTS;
+using ::wmemchr _LIBCPP_USING_IF_EXISTS;
+using ::wcscspn _LIBCPP_USING_IF_EXISTS;
+using ::wcslen _LIBCPP_USING_IF_EXISTS;
+using ::wcsspn _LIBCPP_USING_IF_EXISTS;
+using ::wcstok _LIBCPP_USING_IF_EXISTS;
+using ::wmemcmp _LIBCPP_USING_IF_EXISTS;
+using ::wmemcpy _LIBCPP_USING_IF_EXISTS;
+using ::wmemmove _LIBCPP_USING_IF_EXISTS;
+using ::wmemset _LIBCPP_USING_IF_EXISTS;
+using ::wcsftime _LIBCPP_USING_IF_EXISTS;
+using ::btowc _LIBCPP_USING_IF_EXISTS;
+using ::wctob _LIBCPP_USING_IF_EXISTS;
+using ::mbsinit _LIBCPP_USING_IF_EXISTS;
+using ::mbrlen _LIBCPP_USING_IF_EXISTS;
+using ::mbrtowc _LIBCPP_USING_IF_EXISTS;
+using ::wcrtomb _LIBCPP_USING_IF_EXISTS;
+using ::mbsrtowcs _LIBCPP_USING_IF_EXISTS;
+using ::wcsrtombs _LIBCPP_USING_IF_EXISTS;
+
+using ::getwchar _LIBCPP_USING_IF_EXISTS;
+using ::vwscanf _LIBCPP_USING_IF_EXISTS;
+using ::wscanf _LIBCPP_USING_IF_EXISTS;
+
+using ::putwchar _LIBCPP_USING_IF_EXISTS;
+using ::vwprintf _LIBCPP_USING_IF_EXISTS;
+using ::wprintf _LIBCPP_USING_IF_EXISTS;
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 size_t __constexpr_wcslen(const wchar_t* __str) {
+#if __has_builtin(__builtin_wcslen)
+  return __builtin_wcslen(__str);
+#else
+  if (!__libcpp_is_constant_evaluated())
+    return std::wcslen(__str);
+
+  size_t __len = 0;
+  for (; *__str != L'\0'; ++__str)
+    ++__len;
+  return __len;
+#endif
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 int
+__constexpr_wmemcmp(const wchar_t* __lhs, const wchar_t* __rhs, size_t __count) {
+#if __has_builtin(__builtin_wmemcmp)
+  return __builtin_wmemcmp(__lhs, __rhs, __count);
+#else
+  if (!__libcpp_is_constant_evaluated())
+    return std::wmemcmp(__lhs, __rhs, __count);
+
+  for (; __count; --__count, ++__lhs, ++__rhs) {
+    if (*__lhs < *__rhs)
+      return -1;
+    if (*__rhs < *__lhs)
+      return 1;
+  }
+  return 0;
+#endif
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const wchar_t*
+__constexpr_wmemchr(const wchar_t* __str, wchar_t __char, size_t __count) {
+#if __has_feature(cxx_constexpr_string_builtins)
+  return __builtin_wmemchr(__str, __char, __count);
+#else
+  if (!__libcpp_is_constant_evaluated())
+    return std::wmemchr(__str, __char, __count);
+
+  for (; __count; --__count) {
+    if (*__str == __char)
+      return __str;
+    ++__str;
+  }
+  return nullptr;
+#endif
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CWCHAR
diff --git a/app/src/main/cpp/libcxx/include/cwctype b/app/src/main/cpp/libcxx/include/cwctype
new file mode 100644
index 0000000..5a2d242
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/cwctype
@@ -0,0 +1,98 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_CWCTYPE
+#define _LIBCPP_CWCTYPE
+
+/*
+    cwctype synopsis
+
+Macros:
+
+    WEOF
+
+namespace std
+{
+
+Types:
+
+    wint_t
+    wctrans_t
+    wctype_t
+
+int iswalnum(wint_t wc);
+int iswalpha(wint_t wc);
+int iswblank(wint_t wc);  // C99
+int iswcntrl(wint_t wc);
+int iswdigit(wint_t wc);
+int iswgraph(wint_t wc);
+int iswlower(wint_t wc);
+int iswprint(wint_t wc);
+int iswpunct(wint_t wc);
+int iswspace(wint_t wc);
+int iswupper(wint_t wc);
+int iswxdigit(wint_t wc);
+int iswctype(wint_t wc, wctype_t desc);
+wctype_t wctype(const char* property);
+wint_t towlower(wint_t wc);
+wint_t towupper(wint_t wc);
+wint_t towctrans(wint_t wc, wctrans_t desc);
+wctrans_t wctrans(const char* property);
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <cctype>
+
+#include <wctype.h>
+
+#ifndef _LIBCPP_WCTYPE_H
+#   error <cwctype> tried including <wctype.h> but didn't find libc++'s <wctype.h> header. \
+          This usually means that your header search paths are not configured properly. \
+          The header search paths should contain the C++ Standard Library headers before \
+          any C Standard Library, and you are probably using compiler flags that make that \
+          not be the case.
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if defined(_LIBCPP_INCLUDED_C_LIBRARY_WCTYPE_H)
+using ::wint_t _LIBCPP_USING_IF_EXISTS;
+using ::wctrans_t _LIBCPP_USING_IF_EXISTS;
+using ::wctype_t _LIBCPP_USING_IF_EXISTS;
+using ::iswalnum _LIBCPP_USING_IF_EXISTS;
+using ::iswalpha _LIBCPP_USING_IF_EXISTS;
+using ::iswblank _LIBCPP_USING_IF_EXISTS;
+using ::iswcntrl _LIBCPP_USING_IF_EXISTS;
+using ::iswdigit _LIBCPP_USING_IF_EXISTS;
+using ::iswgraph _LIBCPP_USING_IF_EXISTS;
+using ::iswlower _LIBCPP_USING_IF_EXISTS;
+using ::iswprint _LIBCPP_USING_IF_EXISTS;
+using ::iswpunct _LIBCPP_USING_IF_EXISTS;
+using ::iswspace _LIBCPP_USING_IF_EXISTS;
+using ::iswupper _LIBCPP_USING_IF_EXISTS;
+using ::iswxdigit _LIBCPP_USING_IF_EXISTS;
+using ::iswctype _LIBCPP_USING_IF_EXISTS;
+using ::wctype _LIBCPP_USING_IF_EXISTS;
+using ::towlower _LIBCPP_USING_IF_EXISTS;
+using ::towupper _LIBCPP_USING_IF_EXISTS;
+using ::towctrans _LIBCPP_USING_IF_EXISTS;
+using ::wctrans _LIBCPP_USING_IF_EXISTS;
+#endif // _LIBCPP_INCLUDED_C_LIBRARY_WCTYPE_H
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_CWCTYPE
diff --git a/app/src/main/cpp/libcxx/include/deque b/app/src/main/cpp/libcxx/include/deque
new file mode 100644
index 0000000..f2b8076
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/deque
@@ -0,0 +1,2443 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_DEQUE
+#define _LIBCPP_DEQUE
+
+/*
+    deque synopsis
+
+namespace std
+{
+
+template <class T, class Allocator = allocator<T> >
+class deque
+{
+public:
+    // types:
+    typedef T value_type;
+    typedef Allocator allocator_type;
+
+    typedef typename allocator_type::reference       reference;
+    typedef typename allocator_type::const_reference const_reference;
+    typedef implementation-defined                   iterator;
+    typedef implementation-defined                   const_iterator;
+    typedef typename allocator_type::size_type       size_type;
+    typedef typename allocator_type::difference_type difference_type;
+
+    typedef typename allocator_type::pointer         pointer;
+    typedef typename allocator_type::const_pointer   const_pointer;
+    typedef std::reverse_iterator<iterator>          reverse_iterator;
+    typedef std::reverse_iterator<const_iterator>    const_reverse_iterator;
+
+    // construct/copy/destroy:
+    deque() noexcept(is_nothrow_default_constructible<allocator_type>::value);
+    explicit deque(const allocator_type& a);
+    explicit deque(size_type n);
+    explicit deque(size_type n, const allocator_type& a); // C++14
+    deque(size_type n, const value_type& v);
+    deque(size_type n, const value_type& v, const allocator_type& a);
+    template <class InputIterator>
+        deque(InputIterator f, InputIterator l);
+    template <class InputIterator>
+        deque(InputIterator f, InputIterator l, const allocator_type& a);
+    deque(const deque& c);
+    deque(deque&& c)
+        noexcept(is_nothrow_move_constructible<allocator_type>::value);
+    deque(initializer_list<value_type> il, const Allocator& a = allocator_type());
+    deque(const deque& c, const allocator_type& a);
+    deque(deque&& c, const allocator_type& a);
+    ~deque();
+
+    deque& operator=(const deque& c);
+    deque& operator=(deque&& c)
+        noexcept(
+             allocator_type::propagate_on_container_move_assignment::value &&
+             is_nothrow_move_assignable<allocator_type>::value);
+    deque& operator=(initializer_list<value_type> il);
+
+    template <class InputIterator>
+        void assign(InputIterator f, InputIterator l);
+    void assign(size_type n, const value_type& v);
+    void assign(initializer_list<value_type> il);
+
+    allocator_type get_allocator() const noexcept;
+
+    // iterators:
+
+    iterator       begin() noexcept;
+    const_iterator begin() const noexcept;
+    iterator       end() noexcept;
+    const_iterator end() const noexcept;
+
+    reverse_iterator       rbegin() noexcept;
+    const_reverse_iterator rbegin() const noexcept;
+    reverse_iterator       rend() noexcept;
+    const_reverse_iterator rend() const noexcept;
+
+    const_iterator         cbegin() const noexcept;
+    const_iterator         cend() const noexcept;
+    const_reverse_iterator crbegin() const noexcept;
+    const_reverse_iterator crend() const noexcept;
+
+    // capacity:
+    size_type size() const noexcept;
+    size_type max_size() const noexcept;
+    void resize(size_type n);
+    void resize(size_type n, const value_type& v);
+    void shrink_to_fit();
+    bool empty() const noexcept;
+
+    // element access:
+    reference operator[](size_type i);
+    const_reference operator[](size_type i) const;
+    reference at(size_type i);
+    const_reference at(size_type i) const;
+    reference front();
+    const_reference front() const;
+    reference back();
+    const_reference back() const;
+
+    // modifiers:
+    void push_front(const value_type& v);
+    void push_front(value_type&& v);
+    void push_back(const value_type& v);
+    void push_back(value_type&& v);
+    template <class... Args> reference emplace_front(Args&&... args);  // reference in C++17
+    template <class... Args> reference emplace_back(Args&&... args);   // reference in C++17
+    template <class... Args> iterator emplace(const_iterator p, Args&&... args);
+    iterator insert(const_iterator p, const value_type& v);
+    iterator insert(const_iterator p, value_type&& v);
+    iterator insert(const_iterator p, size_type n, const value_type& v);
+    template <class InputIterator>
+        iterator insert(const_iterator p, InputIterator f, InputIterator l);
+    iterator insert(const_iterator p, initializer_list<value_type> il);
+    void pop_front();
+    void pop_back();
+    iterator erase(const_iterator p);
+    iterator erase(const_iterator f, const_iterator l);
+    void swap(deque& c)
+        noexcept(allocator_traits<allocator_type>::is_always_equal::value);  // C++17
+    void clear() noexcept;
+};
+
+template <class InputIterator, class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
+   deque(InputIterator, InputIterator, Allocator = Allocator())
+   -> deque<typename iterator_traits<InputIterator>::value_type, Allocator>; // C++17
+
+template <class T, class Allocator>
+    bool operator==(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+template <class T, class Allocator>
+    bool operator< (const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+template <class T, class Allocator>
+    bool operator!=(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+template <class T, class Allocator>
+    bool operator> (const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+template <class T, class Allocator>
+    bool operator>=(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+template <class T, class Allocator>
+    bool operator<=(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+
+// specialized algorithms:
+template <class T, class Allocator>
+    void swap(deque<T,Allocator>& x, deque<T,Allocator>& y)
+         noexcept(noexcept(x.swap(y)));
+
+template <class T, class Allocator, class U>
+    typename deque<T, Allocator>::size_type
+    erase(deque<T, Allocator>& c, const U& value);       // C++20
+template <class T, class Allocator, class Predicate>
+    typename deque<T, Allocator>::size_type
+    erase_if(deque<T, Allocator>& c, Predicate pred);    // C++20
+
+}  // std
+
+*/
+
+#include <__algorithm/copy.h>
+#include <__algorithm/copy_backward.h>
+#include <__algorithm/equal.h>
+#include <__algorithm/fill_n.h>
+#include <__algorithm/lexicographical_compare.h>
+#include <__algorithm/min.h>
+#include <__algorithm/remove.h>
+#include <__algorithm/remove_if.h>
+#include <__algorithm/unwrap_iter.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__format/enable_insertable.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/next.h>
+#include <__iterator/prev.h>
+#include <__iterator/reverse_iterator.h>
+#include <__iterator/segmented_iterator.h>
+#include <__memory/allocator_destructor.h>
+#include <__memory/pointer_traits.h>
+#include <__memory/temp_value.h>
+#include <__memory/unique_ptr.h>
+#include <__memory_resource/polymorphic_allocator.h>
+#include <__split_buffer>
+#include <__type_traits/is_allocator.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <limits>
+#include <stdexcept>
+#include <type_traits>
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+// [deque.syn]
+#include <compare>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _Allocator = allocator<_Tp> > class _LIBCPP_TEMPLATE_VIS deque;
+
+template <class _ValueType, class _DiffType>
+struct __deque_block_size {
+  static const _DiffType value = sizeof(_ValueType) < 256 ? 4096 / sizeof(_ValueType) : 16;
+};
+
+template <class _ValueType, class _Pointer, class _Reference, class _MapPointer,
+          class _DiffType, _DiffType _BS =
+#ifdef _LIBCPP_ABI_INCOMPLETE_TYPES_IN_DEQUE
+// Keep template parameter to avoid changing all template declarations thoughout
+// this file.
+                               0
+#else
+                               __deque_block_size<_ValueType, _DiffType>::value
+#endif
+          >
+class _LIBCPP_TEMPLATE_VIS __deque_iterator
+{
+    typedef _MapPointer __map_iterator;
+public:
+    typedef _Pointer  pointer;
+    typedef _DiffType difference_type;
+private:
+    __map_iterator __m_iter_;
+    pointer        __ptr_;
+
+    static const difference_type __block_size;
+public:
+    typedef _ValueType                  value_type;
+    typedef random_access_iterator_tag  iterator_category;
+    typedef _Reference                  reference;
+
+    _LIBCPP_HIDE_FROM_ABI __deque_iterator() _NOEXCEPT
+#if _LIBCPP_STD_VER > 11
+     : __m_iter_(nullptr), __ptr_(nullptr)
+#endif
+     {}
+
+    template <class _Pp, class _Rp, class _MP>
+    _LIBCPP_HIDE_FROM_ABI
+    __deque_iterator(const __deque_iterator<value_type, _Pp, _Rp, _MP, difference_type, _BS>& __it,
+                typename enable_if<is_convertible<_Pp, pointer>::value>::type* = 0) _NOEXCEPT
+        : __m_iter_(__it.__m_iter_), __ptr_(__it.__ptr_) {}
+
+    _LIBCPP_HIDE_FROM_ABI reference operator*() const {return *__ptr_;}
+    _LIBCPP_HIDE_FROM_ABI pointer operator->() const {return __ptr_;}
+
+    _LIBCPP_HIDE_FROM_ABI __deque_iterator& operator++()
+    {
+        if (++__ptr_ - *__m_iter_ == __block_size)
+        {
+            ++__m_iter_;
+            __ptr_ = *__m_iter_;
+        }
+        return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI __deque_iterator operator++(int)
+    {
+        __deque_iterator __tmp = *this;
+        ++(*this);
+        return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI __deque_iterator& operator--()
+    {
+        if (__ptr_ == *__m_iter_)
+        {
+            --__m_iter_;
+            __ptr_ = *__m_iter_ + __block_size;
+        }
+        --__ptr_;
+        return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI __deque_iterator operator--(int)
+    {
+        __deque_iterator __tmp = *this;
+        --(*this);
+        return __tmp;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI __deque_iterator& operator+=(difference_type __n)
+    {
+        if (__n != 0)
+        {
+            __n += __ptr_ - *__m_iter_;
+            if (__n > 0)
+            {
+                __m_iter_ += __n / __block_size;
+                __ptr_ = *__m_iter_ + __n % __block_size;
+            }
+            else // (__n < 0)
+            {
+                difference_type __z = __block_size - 1 - __n;
+                __m_iter_ -= __z / __block_size;
+                __ptr_ = *__m_iter_ + (__block_size - 1 - __z % __block_size);
+            }
+        }
+        return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI __deque_iterator& operator-=(difference_type __n)
+    {
+        return *this += -__n;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI __deque_iterator operator+(difference_type __n) const
+    {
+        __deque_iterator __t(*this);
+        __t += __n;
+        return __t;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI __deque_iterator operator-(difference_type __n) const
+    {
+        __deque_iterator __t(*this);
+        __t -= __n;
+        return __t;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend __deque_iterator operator+(difference_type __n, const __deque_iterator& __it)
+        {return __it + __n;}
+
+    _LIBCPP_HIDE_FROM_ABI
+    friend difference_type operator-(const __deque_iterator& __x, const __deque_iterator& __y)
+    {
+        if (__x != __y)
+            return (__x.__m_iter_ - __y.__m_iter_) * __block_size
+                 + (__x.__ptr_ - *__x.__m_iter_)
+                 - (__y.__ptr_ - *__y.__m_iter_);
+        return 0;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI reference operator[](difference_type __n) const
+        {return *(*this + __n);}
+
+    _LIBCPP_HIDE_FROM_ABI friend
+        bool operator==(const __deque_iterator& __x, const __deque_iterator& __y)
+        {return __x.__ptr_ == __y.__ptr_;}
+
+    _LIBCPP_HIDE_FROM_ABI friend
+        bool operator!=(const __deque_iterator& __x, const __deque_iterator& __y)
+        {return !(__x == __y);}
+
+    _LIBCPP_HIDE_FROM_ABI friend
+        bool operator<(const __deque_iterator& __x, const __deque_iterator& __y)
+        {return __x.__m_iter_ < __y.__m_iter_ ||
+               (__x.__m_iter_ == __y.__m_iter_ && __x.__ptr_ < __y.__ptr_);}
+
+    _LIBCPP_HIDE_FROM_ABI friend
+        bool operator>(const __deque_iterator& __x, const __deque_iterator& __y)
+        {return __y < __x;}
+
+    _LIBCPP_HIDE_FROM_ABI friend
+        bool operator<=(const __deque_iterator& __x, const __deque_iterator& __y)
+        {return !(__y < __x);}
+
+    _LIBCPP_HIDE_FROM_ABI friend
+        bool operator>=(const __deque_iterator& __x, const __deque_iterator& __y)
+        {return !(__x < __y);}
+
+private:
+    _LIBCPP_HIDE_FROM_ABI explicit __deque_iterator(__map_iterator __m, pointer __p) _NOEXCEPT
+        : __m_iter_(__m), __ptr_(__p) {}
+
+    template <class _Tp, class _Ap> friend class _LIBCPP_TEMPLATE_VIS deque;
+    template <class _Vp, class _Pp, class _Rp, class _MP, class _Dp, _Dp>
+        friend class _LIBCPP_TEMPLATE_VIS __deque_iterator;
+
+    template <class>
+    friend struct __segmented_iterator_traits;
+};
+
+template <class _ValueType, class _Pointer, class _Reference, class _MapPointer, class _DiffType, _DiffType _BlockSize>
+struct __segmented_iterator_traits<
+    __deque_iterator<_ValueType, _Pointer, _Reference, _MapPointer, _DiffType, _BlockSize> > {
+private:
+  using _Iterator = __deque_iterator<_ValueType, _Pointer, _Reference, _MapPointer, _DiffType, _BlockSize>;
+
+public:
+  using __is_segmented_iterator = true_type;
+  using __segment_iterator = _MapPointer;
+  using __local_iterator = _Pointer;
+
+  static _LIBCPP_HIDE_FROM_ABI __segment_iterator __segment(_Iterator __iter) { return __iter.__m_iter_; }
+  static _LIBCPP_HIDE_FROM_ABI __local_iterator __local(_Iterator __iter) { return __iter.__ptr_; }
+  static _LIBCPP_HIDE_FROM_ABI __local_iterator __begin(__segment_iterator __iter) { return *__iter; }
+
+  static _LIBCPP_HIDE_FROM_ABI __local_iterator __end(__segment_iterator __iter) {
+        return *__iter + _Iterator::__block_size;
+  }
+
+  static _LIBCPP_HIDE_FROM_ABI _Iterator __compose(__segment_iterator __segment, __local_iterator __local) {
+        if (__local == __end(__segment)) {
+            ++__segment;
+            return _Iterator(__segment, *__segment);
+        }
+        return _Iterator(__segment, __local);
+  }
+};
+
+template <class _ValueType, class _Pointer, class _Reference, class _MapPointer,
+          class _DiffType, _DiffType _BlockSize>
+const _DiffType __deque_iterator<_ValueType, _Pointer, _Reference, _MapPointer,
+                                 _DiffType, _BlockSize>::__block_size =
+    __deque_block_size<_ValueType, _DiffType>::value;
+
+template <class _Tp, class _Allocator /*= allocator<_Tp>*/>
+class _LIBCPP_TEMPLATE_VIS deque
+{
+public:
+    // types:
+
+  using value_type = _Tp;
+
+  static_assert((is_same<typename _Allocator::value_type, value_type>::value),
+                "Allocator::value_type must be same type as value_type");
+
+  using allocator_type = _Allocator;
+  using __alloc_traits = allocator_traits<allocator_type>;
+
+  using size_type       = typename __alloc_traits::size_type;
+  using difference_type = typename __alloc_traits::difference_type;
+
+  using pointer       = typename __alloc_traits::pointer;
+  using const_pointer = typename __alloc_traits::const_pointer;
+
+  using __pointer_allocator       = __rebind_alloc<__alloc_traits, pointer>;
+  using __const_pointer_allocator = __rebind_alloc<__alloc_traits, const_pointer>;
+  using __map                     = __split_buffer<pointer, __pointer_allocator>;
+  using __map_alloc_traits        = allocator_traits<__pointer_allocator>;
+  using __map_pointer             = typename __map_alloc_traits::pointer;
+  using __map_const_pointer       = typename allocator_traits<__const_pointer_allocator>::const_pointer;
+
+  using reference       = value_type&;
+  using const_reference = const value_type&;
+
+  using iterator = __deque_iterator<value_type, pointer, reference, __map_pointer, difference_type>;
+  using const_iterator =
+      __deque_iterator<value_type, const_pointer, const_reference, __map_const_pointer, difference_type>;
+  using reverse_iterator       = std::reverse_iterator<iterator>;
+  using const_reverse_iterator = std::reverse_iterator<const_iterator>;
+
+  static_assert(is_same<allocator_type, __rebind_alloc<__alloc_traits, value_type> >::value,
+                "[allocator.requirements] states that rebinding an allocator to the same type should result in the "
+                "original allocator");
+  static_assert(is_nothrow_default_constructible<allocator_type>::value ==
+                    is_nothrow_default_constructible<__pointer_allocator>::value,
+                "rebinding an allocator should not change excpetion guarantees");
+  static_assert(is_nothrow_move_constructible<allocator_type>::value ==
+                    is_nothrow_move_constructible<typename __map::allocator_type>::value,
+                "rebinding an allocator should not change excpetion guarantees");
+
+private:
+  struct __deque_block_range {
+    explicit _LIBCPP_HIDE_FROM_ABI
+    __deque_block_range(pointer __b, pointer __e) _NOEXCEPT : __begin_(__b), __end_(__e) {}
+    const pointer __begin_;
+    const pointer __end_;
+  };
+
+  struct __deque_range {
+    iterator __pos_;
+    const iterator __end_;
+
+    _LIBCPP_HIDE_FROM_ABI __deque_range(iterator __pos, iterator __e) _NOEXCEPT
+      : __pos_(__pos), __end_(__e) {}
+
+    explicit _LIBCPP_HIDE_FROM_ABI operator bool() const _NOEXCEPT {
+      return __pos_ != __end_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI __deque_range begin() const {
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI __deque_range end() const {
+      return __deque_range(__end_, __end_);
+    }
+    _LIBCPP_HIDE_FROM_ABI __deque_block_range operator*() const _NOEXCEPT {
+        if (__pos_.__m_iter_ == __end_.__m_iter_) {
+        return __deque_block_range(__pos_.__ptr_, __end_.__ptr_);
+      }
+      return __deque_block_range(__pos_.__ptr_, *__pos_.__m_iter_ + __block_size);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI __deque_range& operator++() _NOEXCEPT {
+      if (__pos_.__m_iter_ == __end_.__m_iter_) {
+        __pos_ = __end_;
+      } else {
+        ++__pos_.__m_iter_;
+        __pos_.__ptr_ = *__pos_.__m_iter_;
+      }
+      return *this;
+    }
+
+
+    _LIBCPP_HIDE_FROM_ABI friend bool operator==(__deque_range const& __lhs, __deque_range const& __rhs) {
+      return __lhs.__pos_ == __rhs.__pos_;
+    }
+    _LIBCPP_HIDE_FROM_ABI friend bool operator!=(__deque_range const& __lhs, __deque_range const& __rhs) {
+      return !(__lhs == __rhs);
+    }
+  };
+
+  struct _ConstructTransaction {
+    _LIBCPP_HIDE_FROM_ABI _ConstructTransaction(deque* __db, __deque_block_range& __r)
+      : __pos_(__r.__begin_), __end_(__r.__end_), __begin_(__r.__begin_), __base_(__db) {}
+
+
+    _LIBCPP_HIDE_FROM_ABI ~_ConstructTransaction() {
+      __base_->__size() += (__pos_ - __begin_);
+    }
+
+    pointer __pos_;
+    const pointer __end_;
+  private:
+    const pointer __begin_;
+    deque* const __base_;
+  };
+
+  static const difference_type __block_size;
+
+  __map __map_;
+  size_type __start_;
+  __compressed_pair<size_type, allocator_type> __size_;
+
+public:
+
+    // construct/copy/destroy:
+    _LIBCPP_HIDE_FROM_ABI
+    deque() _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
+        : __start_(0), __size_(0, __default_init_tag()) {}
+
+    _LIBCPP_HIDE_FROM_ABI ~deque() {
+      clear();
+      typename __map::iterator __i = __map_.begin();
+      typename __map::iterator __e = __map_.end();
+      for (; __i != __e; ++__i)
+          __alloc_traits::deallocate(__alloc(), *__i, __block_size);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI explicit deque(const allocator_type& __a)
+        : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a) {}
+
+    explicit _LIBCPP_HIDE_FROM_ABI deque(size_type __n);
+#if _LIBCPP_STD_VER > 11
+    explicit _LIBCPP_HIDE_FROM_ABI deque(size_type __n, const _Allocator& __a);
+#endif
+    _LIBCPP_HIDE_FROM_ABI deque(size_type __n, const value_type& __v);
+
+    template <class = __enable_if_t<__is_allocator<_Allocator>::value> >
+    _LIBCPP_HIDE_FROM_ABI deque(size_type __n, const value_type& __v, const allocator_type& __a)
+        : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a)
+    {
+        if (__n > 0)
+            __append(__n, __v);
+    }
+
+    template <class _InputIter>
+    _LIBCPP_HIDE_FROM_ABI deque(_InputIter __f, _InputIter __l,
+              typename enable_if<__is_cpp17_input_iterator<_InputIter>::value>::type* = 0);
+    template <class _InputIter>
+    _LIBCPP_HIDE_FROM_ABI deque(_InputIter __f, _InputIter __l, const allocator_type& __a,
+              typename enable_if<__is_cpp17_input_iterator<_InputIter>::value>::type* = 0);
+    _LIBCPP_HIDE_FROM_ABI deque(const deque& __c);
+    _LIBCPP_HIDE_FROM_ABI deque(const deque& __c, const __type_identity_t<allocator_type>& __a);
+
+    _LIBCPP_HIDE_FROM_ABI deque& operator=(const deque& __c);
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI deque(initializer_list<value_type> __il);
+    _LIBCPP_HIDE_FROM_ABI deque(initializer_list<value_type> __il, const allocator_type& __a);
+
+    _LIBCPP_HIDE_FROM_ABI
+    deque& operator=(initializer_list<value_type> __il) {assign(__il); return *this;}
+
+    _LIBCPP_HIDE_FROM_ABI
+    deque(deque&& __c) _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value);
+    _LIBCPP_HIDE_FROM_ABI
+    deque(deque&& __c, const __type_identity_t<allocator_type>& __a);
+    _LIBCPP_HIDE_FROM_ABI
+    deque& operator=(deque&& __c)
+        _NOEXCEPT_(__alloc_traits::propagate_on_container_move_assignment::value &&
+                   is_nothrow_move_assignable<allocator_type>::value);
+
+    _LIBCPP_HIDE_FROM_ABI
+    void assign(initializer_list<value_type> __il) {assign(__il.begin(), __il.end());}
+#endif // _LIBCPP_CXX03_LANG
+
+    template <class _InputIter>
+    _LIBCPP_HIDE_FROM_ABI void assign(_InputIter __f, _InputIter __l,
+                    typename enable_if<__is_cpp17_input_iterator<_InputIter>::value &&
+                                      !__is_cpp17_random_access_iterator<_InputIter>::value>::type* = 0);
+    template <class _RAIter>
+    _LIBCPP_HIDE_FROM_ABI void assign(_RAIter __f, _RAIter __l,
+                    typename enable_if<__is_cpp17_random_access_iterator<_RAIter>::value>::type* = 0);
+    _LIBCPP_HIDE_FROM_ABI void assign(size_type __n, const value_type& __v);
+
+    _LIBCPP_HIDE_FROM_ABI
+    allocator_type get_allocator() const _NOEXCEPT;
+  _LIBCPP_HIDE_FROM_ABI allocator_type& __alloc() _NOEXCEPT { return __size_.second(); }
+  _LIBCPP_HIDE_FROM_ABI const allocator_type& __alloc() const _NOEXCEPT { return __size_.second(); }
+
+  // iterators:
+
+  _LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT {
+      __map_pointer __mp = __map_.begin() + __start_ / __block_size;
+      return iterator(__mp, __map_.empty() ? 0 : *__mp + __start_ % __block_size);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT {
+      __map_const_pointer __mp =
+          static_cast<__map_const_pointer>(__map_.begin() + __start_ / __block_size);
+      return const_iterator(__mp, __map_.empty() ? 0 : *__mp + __start_ % __block_size);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI iterator end() _NOEXCEPT {
+      size_type __p      = size() + __start_;
+      __map_pointer __mp = __map_.begin() + __p / __block_size;
+      return iterator(__mp, __map_.empty() ? 0 : *__mp + __p % __block_size);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT {
+      size_type __p            = size() + __start_;
+      __map_const_pointer __mp = static_cast<__map_const_pointer>(__map_.begin() + __p / __block_size);
+      return const_iterator(__mp, __map_.empty() ? 0 : *__mp + __p % __block_size);
+  }
+
+    _LIBCPP_HIDE_FROM_ABI
+    reverse_iterator       rbegin() _NOEXCEPT
+        {return       reverse_iterator(end());}
+    _LIBCPP_HIDE_FROM_ABI
+    const_reverse_iterator rbegin() const _NOEXCEPT
+        {return const_reverse_iterator(end());}
+    _LIBCPP_HIDE_FROM_ABI
+    reverse_iterator       rend() _NOEXCEPT
+        {return       reverse_iterator(begin());}
+    _LIBCPP_HIDE_FROM_ABI
+    const_reverse_iterator rend()   const _NOEXCEPT
+        {return const_reverse_iterator(begin());}
+
+    _LIBCPP_HIDE_FROM_ABI
+    const_iterator         cbegin()  const _NOEXCEPT
+        {return begin();}
+    _LIBCPP_HIDE_FROM_ABI
+    const_iterator         cend()    const _NOEXCEPT
+        {return end();}
+    _LIBCPP_HIDE_FROM_ABI
+    const_reverse_iterator crbegin() const _NOEXCEPT
+        {return const_reverse_iterator(end());}
+    _LIBCPP_HIDE_FROM_ABI
+    const_reverse_iterator crend()   const _NOEXCEPT
+        {return const_reverse_iterator(begin());}
+
+    // capacity:
+    _LIBCPP_HIDE_FROM_ABI
+    size_type size() const _NOEXCEPT {return __size();}
+
+  _LIBCPP_HIDE_FROM_ABI size_type& __size() _NOEXCEPT { return __size_.first(); }
+  _LIBCPP_HIDE_FROM_ABI const size_type& __size() const _NOEXCEPT { return __size_.first(); }
+
+    _LIBCPP_HIDE_FROM_ABI
+    size_type max_size() const _NOEXCEPT
+        {return _VSTD::min<size_type>(
+            __alloc_traits::max_size(__alloc()),
+            numeric_limits<difference_type>::max());}
+    _LIBCPP_HIDE_FROM_ABI void resize(size_type __n);
+    _LIBCPP_HIDE_FROM_ABI void resize(size_type __n, const value_type& __v);
+    _LIBCPP_HIDE_FROM_ABI void shrink_to_fit() _NOEXCEPT;
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI
+    bool empty() const _NOEXCEPT {return size() == 0;}
+
+    // element access:
+    _LIBCPP_HIDE_FROM_ABI
+    reference operator[](size_type __i) _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI
+    const_reference operator[](size_type __i) const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI
+    reference at(size_type __i);
+    _LIBCPP_HIDE_FROM_ABI
+    const_reference at(size_type __i) const;
+    _LIBCPP_HIDE_FROM_ABI
+    reference front() _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI
+    const_reference front() const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI
+    reference back() _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI
+    const_reference back() const _NOEXCEPT;
+
+    // 23.2.2.3 modifiers:
+    _LIBCPP_HIDE_FROM_ABI void push_front(const value_type& __v);
+    _LIBCPP_HIDE_FROM_ABI void push_back(const value_type& __v);
+#ifndef _LIBCPP_CXX03_LANG
+#if _LIBCPP_STD_VER > 14
+    template <class... _Args> _LIBCPP_HIDE_FROM_ABI reference emplace_front(_Args&&... __args);
+    template <class... _Args> _LIBCPP_HIDE_FROM_ABI reference emplace_back (_Args&&... __args);
+#else
+    template <class... _Args> _LIBCPP_HIDE_FROM_ABI void      emplace_front(_Args&&... __args);
+    template <class... _Args> _LIBCPP_HIDE_FROM_ABI void      emplace_back (_Args&&... __args);
+#endif
+    template <class... _Args> _LIBCPP_HIDE_FROM_ABI iterator emplace(const_iterator __p, _Args&&... __args);
+
+    _LIBCPP_HIDE_FROM_ABI void push_front(value_type&& __v);
+    _LIBCPP_HIDE_FROM_ABI void push_back(value_type&& __v);
+    _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, value_type&& __v);
+
+    _LIBCPP_HIDE_FROM_ABI
+    iterator insert(const_iterator __p, initializer_list<value_type> __il)
+        {return insert(__p, __il.begin(), __il.end());}
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, const value_type& __v);
+    _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, size_type __n, const value_type& __v);
+    template <class _InputIter>
+    _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, _InputIter __f, _InputIter __l,
+                         typename enable_if<__is_exactly_cpp17_input_iterator<_InputIter>::value>::type* = 0);
+    template <class _ForwardIterator>
+    _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, _ForwardIterator __f, _ForwardIterator __l,
+                        typename enable_if<__is_exactly_cpp17_forward_iterator<_ForwardIterator>::value>::type* = 0);
+    template <class _BiIter>
+    _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, _BiIter __f, _BiIter __l,
+                         typename enable_if<__is_cpp17_bidirectional_iterator<_BiIter>::value>::type* = 0);
+
+    _LIBCPP_HIDE_FROM_ABI void pop_front();
+    _LIBCPP_HIDE_FROM_ABI void pop_back();
+    _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __p);
+    _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __f, const_iterator __l);
+
+    _LIBCPP_HIDE_FROM_ABI
+    void swap(deque& __c)
+#if _LIBCPP_STD_VER >= 14
+        _NOEXCEPT;
+#else
+        _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
+                   __is_nothrow_swappable<allocator_type>::value);
+#endif
+    _LIBCPP_HIDE_FROM_ABI
+    void clear() _NOEXCEPT;
+
+    _LIBCPP_HIDE_FROM_ABI
+    bool __invariants() const {
+        if (!__map_.__invariants())
+            return false;
+        if (__map_.size() >= size_type(-1) / __block_size)
+            return false;
+        for (typename __map::const_iterator __i = __map_.begin(), __e = __map_.end();
+            __i != __e; ++__i)
+            if (*__i == nullptr)
+                return false;
+        if (__map_.size() != 0)
+        {
+            if (size() >= __map_.size() * __block_size)
+                return false;
+            if (__start_ >= __map_.size() * __block_size - size())
+                return false;
+        }
+        else
+        {
+            if (size() != 0)
+                return false;
+            if (__start_ != 0)
+                return false;
+        }
+        return true;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    void __move_assign_alloc(deque& __c)
+        _NOEXCEPT_(!__alloc_traits::propagate_on_container_move_assignment::value ||
+                   is_nothrow_move_assignable<allocator_type>::value)
+        {__move_assign_alloc(__c, integral_constant<bool,
+                      __alloc_traits::propagate_on_container_move_assignment::value>());}
+
+    _LIBCPP_HIDE_FROM_ABI
+    void __move_assign_alloc(deque& __c, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
+        {
+            __alloc() = _VSTD::move(__c.__alloc());
+        }
+
+    _LIBCPP_HIDE_FROM_ABI
+    void __move_assign_alloc(deque&, false_type) _NOEXCEPT
+        {}
+
+    _LIBCPP_HIDE_FROM_ABI
+    void __move_assign(deque& __c)
+        _NOEXCEPT_(__alloc_traits::propagate_on_container_move_assignment::value &&
+                   is_nothrow_move_assignable<allocator_type>::value)
+    {
+        __map_ = _VSTD::move(__c.__map_);
+        __start_ = __c.__start_;
+        __size() = __c.size();
+        __move_assign_alloc(__c);
+        __c.__start_ = __c.__size() = 0;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    static size_type __recommend_blocks(size_type __n)
+    {
+        return __n / __block_size + (__n % __block_size != 0);
+    }
+    _LIBCPP_HIDE_FROM_ABI
+    size_type __capacity() const
+    {
+        return __map_.size() == 0 ? 0 : __map_.size() * __block_size - 1;
+    }
+    _LIBCPP_HIDE_FROM_ABI
+    size_type __block_count() const
+    {
+        return __map_.size();
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    size_type __front_spare() const
+    {
+        return __start_;
+    }
+    _LIBCPP_HIDE_FROM_ABI
+    size_type __front_spare_blocks() const {
+      return __front_spare() / __block_size;
+    }
+    _LIBCPP_HIDE_FROM_ABI
+    size_type __back_spare() const
+    {
+        return __capacity() - (__start_ + size());
+    }
+    _LIBCPP_HIDE_FROM_ABI
+    size_type __back_spare_blocks() const {
+      return __back_spare() / __block_size;
+    }
+
+ private:
+    _LIBCPP_HIDE_FROM_ABI
+    bool __maybe_remove_front_spare(bool __keep_one = true) {
+      if (__front_spare_blocks() >= 2 || (!__keep_one && __front_spare_blocks())) {
+        __alloc_traits::deallocate(__alloc(), __map_.front(),
+                                   __block_size);
+        __map_.pop_front();
+        __start_ -= __block_size;
+        return true;
+      }
+      return false;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI
+    bool __maybe_remove_back_spare(bool __keep_one = true) {
+      if (__back_spare_blocks() >= 2 || (!__keep_one && __back_spare_blocks())) {
+        __alloc_traits::deallocate(__alloc(), __map_.back(),
+                                   __block_size);
+        __map_.pop_back();
+        return true;
+      }
+      return false;
+    }
+
+    template <class _InpIter>
+    _LIBCPP_HIDE_FROM_ABI void __append(_InpIter __f, _InpIter __l,
+                 typename enable_if<__is_exactly_cpp17_input_iterator<_InpIter>::value>::type* = 0);
+    template <class _ForIter>
+    _LIBCPP_HIDE_FROM_ABI void __append(_ForIter __f, _ForIter __l,
+                      typename enable_if<__is_cpp17_forward_iterator<_ForIter>::value>::type* = 0);
+    _LIBCPP_HIDE_FROM_ABI void __append(size_type __n);
+    _LIBCPP_HIDE_FROM_ABI void __append(size_type __n, const value_type& __v);
+    _LIBCPP_HIDE_FROM_ABI void __erase_to_end(const_iterator __f);
+    _LIBCPP_HIDE_FROM_ABI void __add_front_capacity();
+    _LIBCPP_HIDE_FROM_ABI void __add_front_capacity(size_type __n);
+    _LIBCPP_HIDE_FROM_ABI void __add_back_capacity();
+    _LIBCPP_HIDE_FROM_ABI void __add_back_capacity(size_type __n);
+    _LIBCPP_HIDE_FROM_ABI iterator __move_and_check(iterator __f, iterator __l, iterator __r,
+                              const_pointer& __vt);
+    _LIBCPP_HIDE_FROM_ABI iterator __move_backward_and_check(iterator __f, iterator __l, iterator __r,
+                                       const_pointer& __vt);
+    _LIBCPP_HIDE_FROM_ABI void __move_construct_and_check(iterator __f, iterator __l,
+                                    iterator __r, const_pointer& __vt);
+    _LIBCPP_HIDE_FROM_ABI void __move_construct_backward_and_check(iterator __f, iterator __l,
+                                             iterator __r, const_pointer& __vt);
+
+    _LIBCPP_HIDE_FROM_ABI
+    void __copy_assign_alloc(const deque& __c)
+        {__copy_assign_alloc(__c, integral_constant<bool,
+                      __alloc_traits::propagate_on_container_copy_assignment::value>());}
+
+    _LIBCPP_HIDE_FROM_ABI
+    void __copy_assign_alloc(const deque& __c, true_type)
+        {
+            if (__alloc() != __c.__alloc())
+            {
+                clear();
+                shrink_to_fit();
+            }
+            __alloc() = __c.__alloc();
+            __map_.__alloc() = __c.__map_.__alloc();
+        }
+
+    _LIBCPP_HIDE_FROM_ABI
+    void __copy_assign_alloc(const deque&, false_type)
+        {}
+
+    _LIBCPP_HIDE_FROM_ABI void __move_assign(deque& __c, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value);
+    _LIBCPP_HIDE_FROM_ABI void __move_assign(deque& __c, false_type);
+};
+
+template <class _Tp, class _Alloc>
+_LIBCPP_CONSTEXPR const typename allocator_traits<_Alloc>::difference_type deque<_Tp, _Alloc>::__block_size =
+    __deque_block_size<value_type, difference_type>::value;
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator,
+         class _Alloc = allocator<__iter_value_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Alloc>::value>
+         >
+deque(_InputIterator, _InputIterator)
+  -> deque<__iter_value_type<_InputIterator>, _Alloc>;
+
+template<class _InputIterator,
+         class _Alloc,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Alloc>::value>
+         >
+deque(_InputIterator, _InputIterator, _Alloc)
+  -> deque<__iter_value_type<_InputIterator>, _Alloc>;
+#endif
+
+template <class _Tp, class _Allocator>
+deque<_Tp, _Allocator>::deque(size_type __n)
+    : __start_(0), __size_(0, __default_init_tag())
+{
+    if (__n > 0)
+        __append(__n);
+}
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp, class _Allocator>
+deque<_Tp, _Allocator>::deque(size_type __n, const _Allocator& __a)
+    : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a)
+{
+    if (__n > 0)
+        __append(__n);
+}
+#endif
+
+template <class _Tp, class _Allocator>
+deque<_Tp, _Allocator>::deque(size_type __n, const value_type& __v)
+    : __start_(0), __size_(0, __default_init_tag())
+{
+    if (__n > 0)
+        __append(__n, __v);
+}
+
+template <class _Tp, class _Allocator>
+template <class _InputIter>
+deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l,
+              typename enable_if<__is_cpp17_input_iterator<_InputIter>::value>::type*)
+    : __start_(0), __size_(0, __default_init_tag())
+{
+    __append(__f, __l);
+}
+
+template <class _Tp, class _Allocator>
+template <class _InputIter>
+deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l, const allocator_type& __a,
+              typename enable_if<__is_cpp17_input_iterator<_InputIter>::value>::type*)
+    : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a)
+{
+    __append(__f, __l);
+}
+
+template <class _Tp, class _Allocator>
+deque<_Tp, _Allocator>::deque(const deque& __c)
+    : __map_(__pointer_allocator(__alloc_traits::select_on_container_copy_construction(__c.__alloc()))),
+      __start_(0),
+      __size_(0, __map_.__alloc())
+{
+    __append(__c.begin(), __c.end());
+}
+
+template <class _Tp, class _Allocator>
+deque<_Tp, _Allocator>::deque(const deque& __c, const __type_identity_t<allocator_type>& __a)
+    : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a)
+{
+    __append(__c.begin(), __c.end());
+}
+
+template <class _Tp, class _Allocator>
+deque<_Tp, _Allocator>&
+deque<_Tp, _Allocator>::operator=(const deque& __c)
+{
+    if (this != _VSTD::addressof(__c))
+    {
+        __copy_assign_alloc(__c);
+        assign(__c.begin(), __c.end());
+    }
+    return *this;
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Allocator>
+deque<_Tp, _Allocator>::deque(initializer_list<value_type> __il)
+    : __start_(0), __size_(0, __default_init_tag())
+{
+    __append(__il.begin(), __il.end());
+}
+
+template <class _Tp, class _Allocator>
+deque<_Tp, _Allocator>::deque(initializer_list<value_type> __il, const allocator_type& __a)
+    : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a)
+{
+    __append(__il.begin(), __il.end());
+}
+
+template <class _Tp, class _Allocator>
+inline
+deque<_Tp, _Allocator>::deque(deque&& __c)
+    _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value)
+    : __map_(std::move(__c.__map_)), __start_(std::move(__c.__start_)), __size_(std::move(__c.__size_))
+{
+  __c.__start_ = 0;
+  __c.__size() = 0;
+}
+
+template <class _Tp, class _Allocator>
+inline
+deque<_Tp, _Allocator>::deque(deque&& __c, const __type_identity_t<allocator_type>& __a)
+    : __map_(std::move(__c.__map_), __pointer_allocator(__a)),
+      __start_(std::move(__c.__start_)),
+      __size_(std::move(__c.__size()), __a)
+{
+    if (__a == __c.__alloc())
+    {
+        __c.__start_ = 0;
+        __c.__size() = 0;
+    }
+    else
+    {
+        __map_.clear();
+        __start_ = 0;
+        __size() = 0;
+        typedef move_iterator<iterator> _Ip;
+        assign(_Ip(__c.begin()), _Ip(__c.end()));
+    }
+}
+
+template <class _Tp, class _Allocator>
+inline
+deque<_Tp, _Allocator>&
+deque<_Tp, _Allocator>::operator=(deque&& __c)
+        _NOEXCEPT_(__alloc_traits::propagate_on_container_move_assignment::value &&
+                   is_nothrow_move_assignable<allocator_type>::value)
+{
+    __move_assign(__c, integral_constant<bool,
+          __alloc_traits::propagate_on_container_move_assignment::value>());
+    return *this;
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::__move_assign(deque& __c, false_type)
+{
+    if (__alloc() != __c.__alloc())
+    {
+        typedef move_iterator<iterator> _Ip;
+        assign(_Ip(__c.begin()), _Ip(__c.end()));
+    }
+    else
+        __move_assign(__c, true_type());
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::__move_assign(deque& __c, true_type)
+    _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
+{
+    clear();
+    shrink_to_fit();
+    __move_assign(__c);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Allocator>
+template <class _InputIter>
+void
+deque<_Tp, _Allocator>::assign(_InputIter __f, _InputIter __l,
+                               typename enable_if<__is_cpp17_input_iterator<_InputIter>::value &&
+                                                 !__is_cpp17_random_access_iterator<_InputIter>::value>::type*)
+{
+    iterator __i = begin();
+    iterator __e = end();
+    for (; __f != __l && __i != __e; ++__f, (void) ++__i)
+        *__i = *__f;
+    if (__f != __l)
+        __append(__f, __l);
+    else
+        __erase_to_end(__i);
+}
+
+template <class _Tp, class _Allocator>
+template <class _RAIter>
+void
+deque<_Tp, _Allocator>::assign(_RAIter __f, _RAIter __l,
+                               typename enable_if<__is_cpp17_random_access_iterator<_RAIter>::value>::type*)
+{
+    if (static_cast<size_type>(__l - __f) > size())
+    {
+        _RAIter __m = __f + size();
+        _VSTD::copy(__f, __m, begin());
+        __append(__m, __l);
+    }
+    else
+        __erase_to_end(_VSTD::copy(__f, __l, begin()));
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::assign(size_type __n, const value_type& __v)
+{
+    if (__n > size())
+    {
+        _VSTD::fill_n(begin(), size(), __v);
+        __n -= size();
+        __append(__n, __v);
+    }
+    else
+        __erase_to_end(_VSTD::fill_n(begin(), __n, __v));
+}
+
+template <class _Tp, class _Allocator>
+inline
+_Allocator
+deque<_Tp, _Allocator>::get_allocator() const _NOEXCEPT
+{
+    return __alloc();
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::resize(size_type __n)
+{
+    if (__n > size())
+        __append(__n - size());
+    else if (__n < size())
+        __erase_to_end(begin() + __n);
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::resize(size_type __n, const value_type& __v)
+{
+    if (__n > size())
+        __append(__n - size(), __v);
+    else if (__n < size())
+        __erase_to_end(begin() + __n);
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::shrink_to_fit() _NOEXCEPT
+{
+    allocator_type& __a = __alloc();
+    if (empty())
+    {
+        while (__map_.size() > 0)
+        {
+            __alloc_traits::deallocate(__a, __map_.back(), __block_size);
+            __map_.pop_back();
+        }
+        __start_ = 0;
+    }
+    else
+    {
+      __maybe_remove_front_spare(/*__keep_one=*/false);
+      __maybe_remove_back_spare(/*__keep_one=*/false);
+    }
+    __map_.shrink_to_fit();
+}
+
+template <class _Tp, class _Allocator>
+inline
+typename deque<_Tp, _Allocator>::reference
+deque<_Tp, _Allocator>::operator[](size_type __i) _NOEXCEPT
+{
+    size_type __p = __start_ + __i;
+    return *(*(__map_.begin() + __p / __block_size) + __p % __block_size);
+}
+
+template <class _Tp, class _Allocator>
+inline
+typename deque<_Tp, _Allocator>::const_reference
+deque<_Tp, _Allocator>::operator[](size_type __i) const _NOEXCEPT
+{
+    size_type __p = __start_ + __i;
+    return *(*(__map_.begin() + __p / __block_size) + __p % __block_size);
+}
+
+template <class _Tp, class _Allocator>
+inline
+typename deque<_Tp, _Allocator>::reference
+deque<_Tp, _Allocator>::at(size_type __i)
+{
+    if (__i >= size())
+        _VSTD::__throw_out_of_range("deque");
+    size_type __p = __start_ + __i;
+    return *(*(__map_.begin() + __p / __block_size) + __p % __block_size);
+}
+
+template <class _Tp, class _Allocator>
+inline
+typename deque<_Tp, _Allocator>::const_reference
+deque<_Tp, _Allocator>::at(size_type __i) const
+{
+    if (__i >= size())
+        _VSTD::__throw_out_of_range("deque");
+    size_type __p = __start_ + __i;
+    return *(*(__map_.begin() + __p / __block_size) + __p % __block_size);
+}
+
+template <class _Tp, class _Allocator>
+inline
+typename deque<_Tp, _Allocator>::reference
+deque<_Tp, _Allocator>::front() _NOEXCEPT
+{
+    return *(*(__map_.begin() + __start_ / __block_size)
+                                    + __start_ % __block_size);
+}
+
+template <class _Tp, class _Allocator>
+inline
+typename deque<_Tp, _Allocator>::const_reference
+deque<_Tp, _Allocator>::front() const _NOEXCEPT
+{
+    return *(*(__map_.begin() + __start_ / __block_size)
+                                      + __start_ % __block_size);
+}
+
+template <class _Tp, class _Allocator>
+inline
+typename deque<_Tp, _Allocator>::reference
+deque<_Tp, _Allocator>::back() _NOEXCEPT
+{
+    size_type __p = size() + __start_ - 1;
+    return *(*(__map_.begin() + __p / __block_size) + __p % __block_size);
+}
+
+template <class _Tp, class _Allocator>
+inline
+typename deque<_Tp, _Allocator>::const_reference
+deque<_Tp, _Allocator>::back() const _NOEXCEPT
+{
+    size_type __p = size() + __start_ - 1;
+    return *(*(__map_.begin() + __p / __block_size) + __p % __block_size);
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::push_back(const value_type& __v)
+{
+    allocator_type& __a = __alloc();
+    if (__back_spare() == 0)
+        __add_back_capacity();
+    // __back_spare() >= 1
+    __alloc_traits::construct(__a, _VSTD::addressof(*end()), __v);
+    ++__size();
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::push_front(const value_type& __v)
+{
+    allocator_type& __a = __alloc();
+    if (__front_spare() == 0)
+        __add_front_capacity();
+    // __front_spare() >= 1
+    __alloc_traits::construct(__a, _VSTD::addressof(*--begin()), __v);
+    --__start_;
+    ++__size();
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::push_back(value_type&& __v)
+{
+    allocator_type& __a = __alloc();
+    if (__back_spare() == 0)
+        __add_back_capacity();
+    // __back_spare() >= 1
+    __alloc_traits::construct(__a, _VSTD::addressof(*end()), _VSTD::move(__v));
+    ++__size();
+}
+
+template <class _Tp, class _Allocator>
+template <class... _Args>
+#if _LIBCPP_STD_VER > 14
+typename deque<_Tp, _Allocator>::reference
+#else
+void
+#endif
+deque<_Tp, _Allocator>::emplace_back(_Args&&... __args)
+{
+    allocator_type& __a = __alloc();
+    if (__back_spare() == 0)
+        __add_back_capacity();
+    // __back_spare() >= 1
+    __alloc_traits::construct(__a, _VSTD::addressof(*end()),
+                              _VSTD::forward<_Args>(__args)...);
+    ++__size();
+#if _LIBCPP_STD_VER > 14
+    return *--end();
+#endif
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::push_front(value_type&& __v)
+{
+    allocator_type& __a = __alloc();
+    if (__front_spare() == 0)
+        __add_front_capacity();
+    // __front_spare() >= 1
+    __alloc_traits::construct(__a, _VSTD::addressof(*--begin()), _VSTD::move(__v));
+    --__start_;
+    ++__size();
+}
+
+
+template <class _Tp, class _Allocator>
+template <class... _Args>
+#if _LIBCPP_STD_VER > 14
+typename deque<_Tp, _Allocator>::reference
+#else
+void
+#endif
+deque<_Tp, _Allocator>::emplace_front(_Args&&... __args)
+{
+    allocator_type& __a = __alloc();
+    if (__front_spare() == 0)
+        __add_front_capacity();
+    // __front_spare() >= 1
+    __alloc_traits::construct(__a, _VSTD::addressof(*--begin()), _VSTD::forward<_Args>(__args)...);
+    --__start_;
+    ++__size();
+#if _LIBCPP_STD_VER > 14
+    return *begin();
+#endif
+}
+
+template <class _Tp, class _Allocator>
+typename deque<_Tp, _Allocator>::iterator
+deque<_Tp, _Allocator>::insert(const_iterator __p, value_type&& __v)
+{
+    size_type __pos = __p - begin();
+    size_type __to_end = size() - __pos;
+    allocator_type& __a = __alloc();
+    if (__pos < __to_end)
+    {   // insert by shifting things backward
+        if (__front_spare() == 0)
+            __add_front_capacity();
+        // __front_spare() >= 1
+        if (__pos == 0)
+        {
+            __alloc_traits::construct(__a, _VSTD::addressof(*--begin()), _VSTD::move(__v));
+            --__start_;
+            ++__size();
+        }
+        else
+        {
+            iterator __b = begin();
+            iterator __bm1 = _VSTD::prev(__b);
+            __alloc_traits::construct(__a, _VSTD::addressof(*__bm1), _VSTD::move(*__b));
+            --__start_;
+            ++__size();
+            if (__pos > 1)
+                __b = _VSTD::move(_VSTD::next(__b), __b + __pos, __b);
+            *__b = _VSTD::move(__v);
+        }
+    }
+    else
+    {   // insert by shifting things forward
+        if (__back_spare() == 0)
+            __add_back_capacity();
+        // __back_capacity >= 1
+        size_type __de = size() - __pos;
+        if (__de == 0)
+        {
+            __alloc_traits::construct(__a, _VSTD::addressof(*end()), _VSTD::move(__v));
+            ++__size();
+        }
+        else
+        {
+            iterator __e = end();
+            iterator __em1 = _VSTD::prev(__e);
+            __alloc_traits::construct(__a, _VSTD::addressof(*__e), _VSTD::move(*__em1));
+            ++__size();
+            if (__de > 1)
+                __e = _VSTD::move_backward(__e - __de, __em1, __e);
+            *--__e = _VSTD::move(__v);
+        }
+    }
+    return begin() + __pos;
+}
+
+template <class _Tp, class _Allocator>
+template <class... _Args>
+typename deque<_Tp, _Allocator>::iterator
+deque<_Tp, _Allocator>::emplace(const_iterator __p, _Args&&... __args)
+{
+    size_type __pos = __p - begin();
+    size_type __to_end = size() - __pos;
+    allocator_type& __a = __alloc();
+    if (__pos < __to_end)
+    {   // insert by shifting things backward
+        if (__front_spare() == 0)
+            __add_front_capacity();
+        // __front_spare() >= 1
+        if (__pos == 0)
+        {
+            __alloc_traits::construct(__a, _VSTD::addressof(*--begin()), _VSTD::forward<_Args>(__args)...);
+            --__start_;
+            ++__size();
+        }
+        else
+        {
+            __temp_value<value_type, _Allocator> __tmp(__alloc(), _VSTD::forward<_Args>(__args)...);
+            iterator __b = begin();
+            iterator __bm1 = _VSTD::prev(__b);
+            __alloc_traits::construct(__a, _VSTD::addressof(*__bm1), _VSTD::move(*__b));
+            --__start_;
+            ++__size();
+            if (__pos > 1)
+                __b = _VSTD::move(_VSTD::next(__b), __b + __pos, __b);
+            *__b = _VSTD::move(__tmp.get());
+        }
+    }
+    else
+    {   // insert by shifting things forward
+        if (__back_spare() == 0)
+            __add_back_capacity();
+        // __back_capacity >= 1
+        size_type __de = size() - __pos;
+        if (__de == 0)
+        {
+            __alloc_traits::construct(__a, _VSTD::addressof(*end()), _VSTD::forward<_Args>(__args)...);
+            ++__size();
+        }
+        else
+        {
+            __temp_value<value_type, _Allocator> __tmp(__alloc(), _VSTD::forward<_Args>(__args)...);
+            iterator __e = end();
+            iterator __em1 = _VSTD::prev(__e);
+            __alloc_traits::construct(__a, _VSTD::addressof(*__e), _VSTD::move(*__em1));
+            ++__size();
+            if (__de > 1)
+                __e = _VSTD::move_backward(__e - __de, __em1, __e);
+            *--__e = _VSTD::move(__tmp.get());
+        }
+    }
+    return begin() + __pos;
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+
+template <class _Tp, class _Allocator>
+typename deque<_Tp, _Allocator>::iterator
+deque<_Tp, _Allocator>::insert(const_iterator __p, const value_type& __v)
+{
+    size_type __pos = __p - begin();
+    size_type __to_end = size() - __pos;
+    allocator_type& __a = __alloc();
+    if (__pos < __to_end)
+    {   // insert by shifting things backward
+        if (__front_spare() == 0)
+            __add_front_capacity();
+        // __front_spare() >= 1
+        if (__pos == 0)
+        {
+            __alloc_traits::construct(__a, _VSTD::addressof(*--begin()), __v);
+            --__start_;
+            ++__size();
+        }
+        else
+        {
+            const_pointer __vt = pointer_traits<const_pointer>::pointer_to(__v);
+            iterator __b = begin();
+            iterator __bm1 = _VSTD::prev(__b);
+            if (__vt == pointer_traits<const_pointer>::pointer_to(*__b))
+                __vt = pointer_traits<const_pointer>::pointer_to(*__bm1);
+            __alloc_traits::construct(__a, _VSTD::addressof(*__bm1), _VSTD::move(*__b));
+            --__start_;
+            ++__size();
+            if (__pos > 1)
+                __b = __move_and_check(_VSTD::next(__b), __b + __pos, __b, __vt);
+            *__b = *__vt;
+        }
+    }
+    else
+    {   // insert by shifting things forward
+        if (__back_spare() == 0)
+            __add_back_capacity();
+        // __back_capacity >= 1
+        size_type __de = size() - __pos;
+        if (__de == 0)
+        {
+            __alloc_traits::construct(__a, _VSTD::addressof(*end()), __v);
+            ++__size();
+        }
+        else
+        {
+            const_pointer __vt = pointer_traits<const_pointer>::pointer_to(__v);
+            iterator __e = end();
+            iterator __em1 = _VSTD::prev(__e);
+            if (__vt == pointer_traits<const_pointer>::pointer_to(*__em1))
+                __vt = pointer_traits<const_pointer>::pointer_to(*__e);
+            __alloc_traits::construct(__a, _VSTD::addressof(*__e), _VSTD::move(*__em1));
+            ++__size();
+            if (__de > 1)
+                __e = __move_backward_and_check(__e - __de, __em1, __e, __vt);
+            *--__e = *__vt;
+        }
+    }
+    return begin() + __pos;
+}
+
+template <class _Tp, class _Allocator>
+typename deque<_Tp, _Allocator>::iterator
+deque<_Tp, _Allocator>::insert(const_iterator __p, size_type __n, const value_type& __v)
+{
+    size_type __pos = __p - begin();
+    size_type __to_end = __size() - __pos;
+    allocator_type& __a = __alloc();
+    if (__pos < __to_end)
+    {   // insert by shifting things backward
+        if (__n > __front_spare())
+            __add_front_capacity(__n - __front_spare());
+        // __n <= __front_spare()
+        iterator __old_begin = begin();
+        iterator __i = __old_begin;
+        if (__n > __pos)
+        {
+            for (size_type __m = __n - __pos; __m; --__m, --__start_, ++__size())
+                __alloc_traits::construct(__a, _VSTD::addressof(*--__i), __v);
+            __n = __pos;
+        }
+        if (__n > 0)
+        {
+            const_pointer __vt = pointer_traits<const_pointer>::pointer_to(__v);
+            iterator __obn = __old_begin + __n;
+            __move_construct_backward_and_check(__old_begin, __obn, __i, __vt);
+            if (__n < __pos)
+                __old_begin = __move_and_check(__obn, __old_begin + __pos, __old_begin, __vt);
+            _VSTD::fill_n(__old_begin, __n, *__vt);
+        }
+    }
+    else
+    {   // insert by shifting things forward
+        size_type __back_capacity = __back_spare();
+        if (__n > __back_capacity)
+            __add_back_capacity(__n - __back_capacity);
+        // __n <= __back_capacity
+        iterator __old_end = end();
+        iterator __i = __old_end;
+        size_type __de = size() - __pos;
+        if (__n > __de)
+        {
+            for (size_type __m = __n - __de; __m; --__m, (void) ++__i, ++__size())
+                __alloc_traits::construct(__a, _VSTD::addressof(*__i), __v);
+            __n = __de;
+        }
+        if (__n > 0)
+        {
+            const_pointer __vt = pointer_traits<const_pointer>::pointer_to(__v);
+            iterator __oen = __old_end - __n;
+            __move_construct_and_check(__oen, __old_end, __i, __vt);
+            if (__n < __de)
+                __old_end = __move_backward_and_check(__old_end - __de, __oen, __old_end, __vt);
+            _VSTD::fill_n(__old_end - __n, __n, *__vt);
+        }
+    }
+    return begin() + __pos;
+}
+
+template <class _Tp, class _Allocator>
+template <class _InputIter>
+typename deque<_Tp, _Allocator>::iterator
+deque<_Tp, _Allocator>::insert(const_iterator __p, _InputIter __f, _InputIter __l,
+                               typename enable_if<__is_exactly_cpp17_input_iterator<_InputIter>::value>::type*)
+{
+    __split_buffer<value_type, allocator_type&> __buf(__alloc());
+    __buf.__construct_at_end(__f, __l);
+    typedef typename __split_buffer<value_type, allocator_type&>::iterator __bi;
+    return insert(__p, move_iterator<__bi>(__buf.begin()), move_iterator<__bi>(__buf.end()));
+}
+
+template <class _Tp, class _Allocator>
+template <class _ForwardIterator>
+typename deque<_Tp, _Allocator>::iterator
+deque<_Tp, _Allocator>::insert(const_iterator __p, _ForwardIterator __f, _ForwardIterator __l,
+                               typename enable_if<__is_exactly_cpp17_forward_iterator<_ForwardIterator>::value>::type*)
+{
+    size_type __n = _VSTD::distance(__f, __l);
+    __split_buffer<value_type, allocator_type&> __buf(__n, 0, __alloc());
+    __buf.__construct_at_end(__f, __l);
+    typedef typename __split_buffer<value_type, allocator_type&>::iterator __fwd;
+    return insert(__p, move_iterator<__fwd>(__buf.begin()), move_iterator<__fwd>(__buf.end()));
+}
+
+template <class _Tp, class _Allocator>
+template <class _BiIter>
+typename deque<_Tp, _Allocator>::iterator
+deque<_Tp, _Allocator>::insert(const_iterator __p, _BiIter __f, _BiIter __l,
+                               typename enable_if<__is_cpp17_bidirectional_iterator<_BiIter>::value>::type*)
+{
+    size_type __n = _VSTD::distance(__f, __l);
+    size_type __pos = __p - begin();
+    size_type __to_end = size() - __pos;
+    allocator_type& __a = __alloc();
+    if (__pos < __to_end)
+    {   // insert by shifting things backward
+        if (__n > __front_spare())
+            __add_front_capacity(__n - __front_spare());
+        // __n <= __front_spare()
+        iterator __old_begin = begin();
+        iterator __i = __old_begin;
+        _BiIter __m = __f;
+        if (__n > __pos)
+        {
+            __m = __pos < __n / 2 ? _VSTD::prev(__l, __pos) : _VSTD::next(__f, __n - __pos);
+            for (_BiIter __j = __m; __j != __f; --__start_, ++__size())
+                __alloc_traits::construct(__a, _VSTD::addressof(*--__i), *--__j);
+            __n = __pos;
+        }
+        if (__n > 0)
+        {
+            iterator __obn = __old_begin + __n;
+            for (iterator __j = __obn; __j != __old_begin;)
+            {
+                __alloc_traits::construct(__a, _VSTD::addressof(*--__i), _VSTD::move(*--__j));
+                --__start_;
+                ++__size();
+            }
+            if (__n < __pos)
+                __old_begin = _VSTD::move(__obn, __old_begin + __pos, __old_begin);
+            _VSTD::copy(__m, __l, __old_begin);
+        }
+    }
+    else
+    {   // insert by shifting things forward
+        size_type __back_capacity = __back_spare();
+        if (__n > __back_capacity)
+            __add_back_capacity(__n - __back_capacity);
+        // __n <= __back_capacity
+        iterator __old_end = end();
+        iterator __i = __old_end;
+        _BiIter __m = __l;
+        size_type __de = size() - __pos;
+        if (__n > __de)
+        {
+            __m = __de < __n / 2 ? _VSTD::next(__f, __de) : _VSTD::prev(__l, __n - __de);
+            for (_BiIter __j = __m; __j != __l; ++__i, (void) ++__j, ++__size())
+                __alloc_traits::construct(__a, _VSTD::addressof(*__i), *__j);
+            __n = __de;
+        }
+        if (__n > 0)
+        {
+            iterator __oen = __old_end - __n;
+            for (iterator __j = __oen; __j != __old_end; ++__i, (void) ++__j, ++__size())
+                __alloc_traits::construct(__a, _VSTD::addressof(*__i), _VSTD::move(*__j));
+            if (__n < __de)
+                __old_end = _VSTD::move_backward(__old_end - __de, __oen, __old_end);
+            _VSTD::copy_backward(__f, __m, __old_end);
+        }
+    }
+    return begin() + __pos;
+}
+
+template <class _Tp, class _Allocator>
+template <class _InpIter>
+void
+deque<_Tp, _Allocator>::__append(_InpIter __f, _InpIter __l,
+                                 typename enable_if<__is_exactly_cpp17_input_iterator<_InpIter>::value>::type*)
+{
+    for (; __f != __l; ++__f)
+#ifdef _LIBCPP_CXX03_LANG
+        push_back(*__f);
+#else
+        emplace_back(*__f);
+#endif
+}
+
+template <class _Tp, class _Allocator>
+template <class _ForIter>
+void
+deque<_Tp, _Allocator>::__append(_ForIter __f, _ForIter __l,
+                                 typename enable_if<__is_cpp17_forward_iterator<_ForIter>::value>::type*)
+{
+    size_type __n = _VSTD::distance(__f, __l);
+    allocator_type& __a = __alloc();
+    size_type __back_capacity = __back_spare();
+    if (__n > __back_capacity)
+        __add_back_capacity(__n - __back_capacity);
+    // __n <= __back_capacity
+    for (__deque_block_range __br : __deque_range(end(), end() + __n)) {
+      _ConstructTransaction __tx(this, __br);
+      for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_, (void)++__f) {
+        __alloc_traits::construct(__a, _VSTD::__to_address(__tx.__pos_), *__f);
+      }
+    }
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::__append(size_type __n)
+{
+    allocator_type& __a = __alloc();
+    size_type __back_capacity = __back_spare();
+    if (__n > __back_capacity)
+        __add_back_capacity(__n - __back_capacity);
+    // __n <= __back_capacity
+    for (__deque_block_range __br : __deque_range(end(), end() + __n)) {
+      _ConstructTransaction __tx(this, __br);
+      for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_) {
+        __alloc_traits::construct(__a, _VSTD::__to_address(__tx.__pos_));
+      }
+    }
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::__append(size_type __n, const value_type& __v)
+{
+    allocator_type& __a = __alloc();
+    size_type __back_capacity = __back_spare();
+    if (__n > __back_capacity)
+        __add_back_capacity(__n - __back_capacity);
+    // __n <= __back_capacity
+    for (__deque_block_range __br : __deque_range(end(), end() + __n)) {
+      _ConstructTransaction __tx(this, __br);
+      for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_) {
+        __alloc_traits::construct(__a, _VSTD::__to_address(__tx.__pos_), __v);
+      }
+    }
+
+}
+
+// Create front capacity for one block of elements.
+// Strong guarantee.  Either do it or don't touch anything.
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::__add_front_capacity()
+{
+    allocator_type& __a = __alloc();
+    if (__back_spare() >= __block_size)
+    {
+        __start_ += __block_size;
+        pointer __pt = __map_.back();
+        __map_.pop_back();
+        __map_.push_front(__pt);
+    }
+    // Else if __map_.size() < __map_.capacity() then we need to allocate 1 buffer
+    else if (__map_.size() < __map_.capacity())
+    {   // we can put the new buffer into the map, but don't shift things around
+        // until all buffers are allocated.  If we throw, we don't need to fix
+        // anything up (any added buffers are undetectible)
+        if (__map_.__front_spare() > 0)
+            __map_.push_front(__alloc_traits::allocate(__a, __block_size));
+        else
+        {
+            __map_.push_back(__alloc_traits::allocate(__a, __block_size));
+            // Done allocating, reorder capacity
+            pointer __pt = __map_.back();
+            __map_.pop_back();
+            __map_.push_front(__pt);
+        }
+        __start_ = __map_.size() == 1 ?
+                               __block_size / 2 :
+                               __start_ + __block_size;
+    }
+    // Else need to allocate 1 buffer, *and* we need to reallocate __map_.
+    else
+    {
+        __split_buffer<pointer, __pointer_allocator&>
+            __buf(std::max<size_type>(2 * __map_.capacity(), 1),
+                  0, __map_.__alloc());
+
+        typedef __allocator_destructor<_Allocator> _Dp;
+        unique_ptr<pointer, _Dp> __hold(
+            __alloc_traits::allocate(__a, __block_size),
+                _Dp(__a, __block_size));
+        __buf.push_back(__hold.get());
+        __hold.release();
+
+        for (__map_pointer __i = __map_.begin();
+                __i != __map_.end(); ++__i)
+            __buf.push_back(*__i);
+        _VSTD::swap(__map_.__first_, __buf.__first_);
+        _VSTD::swap(__map_.__begin_, __buf.__begin_);
+        _VSTD::swap(__map_.__end_, __buf.__end_);
+        _VSTD::swap(__map_.__end_cap(), __buf.__end_cap());
+        __start_ = __map_.size() == 1 ?
+                               __block_size / 2 :
+                               __start_ + __block_size;
+    }
+}
+
+// Create front capacity for __n elements.
+// Strong guarantee.  Either do it or don't touch anything.
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::__add_front_capacity(size_type __n)
+{
+    allocator_type& __a = __alloc();
+    size_type __nb = __recommend_blocks(__n + __map_.empty());
+    // Number of unused blocks at back:
+    size_type __back_capacity = __back_spare() / __block_size;
+    __back_capacity = _VSTD::min(__back_capacity, __nb);  // don't take more than you need
+    __nb -= __back_capacity;  // number of blocks need to allocate
+    // If __nb == 0, then we have sufficient capacity.
+    if (__nb == 0)
+    {
+        __start_ += __block_size * __back_capacity;
+        for (; __back_capacity > 0; --__back_capacity)
+        {
+            pointer __pt = __map_.back();
+            __map_.pop_back();
+            __map_.push_front(__pt);
+        }
+    }
+    // Else if __nb <= __map_.capacity() - __map_.size() then we need to allocate __nb buffers
+    else if (__nb <= __map_.capacity() - __map_.size())
+    {   // we can put the new buffers into the map, but don't shift things around
+        // until all buffers are allocated.  If we throw, we don't need to fix
+        // anything up (any added buffers are undetectible)
+        for (; __nb > 0; --__nb, __start_ += __block_size - (__map_.size() == 1))
+        {
+            if (__map_.__front_spare() == 0)
+                break;
+            __map_.push_front(__alloc_traits::allocate(__a, __block_size));
+        }
+        for (; __nb > 0; --__nb, ++__back_capacity)
+            __map_.push_back(__alloc_traits::allocate(__a, __block_size));
+        // Done allocating, reorder capacity
+        __start_ += __back_capacity * __block_size;
+        for (; __back_capacity > 0; --__back_capacity)
+        {
+            pointer __pt = __map_.back();
+            __map_.pop_back();
+            __map_.push_front(__pt);
+        }
+    }
+    // Else need to allocate __nb buffers, *and* we need to reallocate __map_.
+    else
+    {
+        size_type __ds = (__nb + __back_capacity) * __block_size - __map_.empty();
+        __split_buffer<pointer, __pointer_allocator&>
+            __buf(std::max<size_type>(2* __map_.capacity(),
+                                      __nb + __map_.size()),
+                  0, __map_.__alloc());
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (; __nb > 0; --__nb)
+                __buf.push_back(__alloc_traits::allocate(__a, __block_size));
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            for (__map_pointer __i = __buf.begin();
+                    __i != __buf.end(); ++__i)
+                __alloc_traits::deallocate(__a, *__i, __block_size);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        for (; __back_capacity > 0; --__back_capacity)
+        {
+            __buf.push_back(__map_.back());
+            __map_.pop_back();
+        }
+        for (__map_pointer __i = __map_.begin();
+                __i != __map_.end(); ++__i)
+            __buf.push_back(*__i);
+        _VSTD::swap(__map_.__first_, __buf.__first_);
+        _VSTD::swap(__map_.__begin_, __buf.__begin_);
+        _VSTD::swap(__map_.__end_, __buf.__end_);
+        _VSTD::swap(__map_.__end_cap(), __buf.__end_cap());
+        __start_ += __ds;
+    }
+}
+
+// Create back capacity for one block of elements.
+// Strong guarantee.  Either do it or don't touch anything.
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::__add_back_capacity()
+{
+    allocator_type& __a = __alloc();
+    if (__front_spare() >= __block_size)
+    {
+        __start_ -= __block_size;
+        pointer __pt = __map_.front();
+        __map_.pop_front();
+        __map_.push_back(__pt);
+    }
+    // Else if __nb <= __map_.capacity() - __map_.size() then we need to allocate __nb buffers
+    else if (__map_.size() < __map_.capacity())
+    {   // we can put the new buffer into the map, but don't shift things around
+        // until it is allocated.  If we throw, we don't need to fix
+        // anything up (any added buffers are undetectible)
+        if (__map_.__back_spare() != 0)
+            __map_.push_back(__alloc_traits::allocate(__a, __block_size));
+        else
+        {
+            __map_.push_front(__alloc_traits::allocate(__a, __block_size));
+            // Done allocating, reorder capacity
+            pointer __pt = __map_.front();
+            __map_.pop_front();
+            __map_.push_back(__pt);
+        }
+    }
+    // Else need to allocate 1 buffer, *and* we need to reallocate __map_.
+    else
+    {
+        __split_buffer<pointer, __pointer_allocator&>
+            __buf(std::max<size_type>(2* __map_.capacity(), 1),
+                  __map_.size(),
+                  __map_.__alloc());
+
+        typedef __allocator_destructor<_Allocator> _Dp;
+        unique_ptr<pointer, _Dp> __hold(
+            __alloc_traits::allocate(__a, __block_size),
+                _Dp(__a, __block_size));
+        __buf.push_back(__hold.get());
+        __hold.release();
+
+        for (__map_pointer __i = __map_.end();
+                __i != __map_.begin();)
+            __buf.push_front(*--__i);
+        _VSTD::swap(__map_.__first_, __buf.__first_);
+        _VSTD::swap(__map_.__begin_, __buf.__begin_);
+        _VSTD::swap(__map_.__end_, __buf.__end_);
+        _VSTD::swap(__map_.__end_cap(), __buf.__end_cap());
+    }
+}
+
+// Create back capacity for __n elements.
+// Strong guarantee.  Either do it or don't touch anything.
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::__add_back_capacity(size_type __n)
+{
+    allocator_type& __a = __alloc();
+    size_type __nb = __recommend_blocks(__n + __map_.empty());
+    // Number of unused blocks at front:
+    size_type __front_capacity = __front_spare() / __block_size;
+    __front_capacity = _VSTD::min(__front_capacity, __nb);  // don't take more than you need
+    __nb -= __front_capacity;  // number of blocks need to allocate
+    // If __nb == 0, then we have sufficient capacity.
+    if (__nb == 0)
+    {
+        __start_ -= __block_size * __front_capacity;
+        for (; __front_capacity > 0; --__front_capacity)
+        {
+            pointer __pt = __map_.front();
+            __map_.pop_front();
+            __map_.push_back(__pt);
+        }
+    }
+    // Else if __nb <= __map_.capacity() - __map_.size() then we need to allocate __nb buffers
+    else if (__nb <= __map_.capacity() - __map_.size())
+    {   // we can put the new buffers into the map, but don't shift things around
+        // until all buffers are allocated.  If we throw, we don't need to fix
+        // anything up (any added buffers are undetectible)
+        for (; __nb > 0; --__nb)
+        {
+            if (__map_.__back_spare() == 0)
+                break;
+            __map_.push_back(__alloc_traits::allocate(__a, __block_size));
+        }
+        for (; __nb > 0; --__nb, ++__front_capacity, __start_ +=
+                                 __block_size - (__map_.size() == 1))
+            __map_.push_front(__alloc_traits::allocate(__a, __block_size));
+        // Done allocating, reorder capacity
+        __start_ -= __block_size * __front_capacity;
+        for (; __front_capacity > 0; --__front_capacity)
+        {
+            pointer __pt = __map_.front();
+            __map_.pop_front();
+            __map_.push_back(__pt);
+        }
+    }
+    // Else need to allocate __nb buffers, *and* we need to reallocate __map_.
+    else
+    {
+        size_type __ds = __front_capacity * __block_size;
+        __split_buffer<pointer, __pointer_allocator&>
+            __buf(std::max<size_type>(2* __map_.capacity(),
+                                      __nb + __map_.size()),
+                  __map_.size() - __front_capacity,
+                  __map_.__alloc());
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (; __nb > 0; --__nb)
+                __buf.push_back(__alloc_traits::allocate(__a, __block_size));
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            for (__map_pointer __i = __buf.begin();
+                    __i != __buf.end(); ++__i)
+                __alloc_traits::deallocate(__a, *__i, __block_size);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        for (; __front_capacity > 0; --__front_capacity)
+        {
+            __buf.push_back(__map_.front());
+            __map_.pop_front();
+        }
+        for (__map_pointer __i = __map_.end();
+                __i != __map_.begin();)
+            __buf.push_front(*--__i);
+        _VSTD::swap(__map_.__first_, __buf.__first_);
+        _VSTD::swap(__map_.__begin_, __buf.__begin_);
+        _VSTD::swap(__map_.__end_, __buf.__end_);
+        _VSTD::swap(__map_.__end_cap(), __buf.__end_cap());
+        __start_ -= __ds;
+    }
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::pop_front()
+{
+    allocator_type& __a = __alloc();
+    __alloc_traits::destroy(__a, _VSTD::__to_address(*(__map_.begin() +
+                                                    __start_ / __block_size) +
+                                                    __start_ % __block_size));
+    --__size();
+    ++__start_;
+    __maybe_remove_front_spare();
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::pop_back()
+{
+    _LIBCPP_ASSERT(!empty(), "deque::pop_back called on an empty deque");
+    allocator_type& __a = __alloc();
+    size_type __p = size() + __start_ - 1;
+    __alloc_traits::destroy(__a, _VSTD::__to_address(*(__map_.begin() +
+                                                    __p / __block_size) +
+                                                    __p % __block_size));
+    --__size();
+    __maybe_remove_back_spare();
+}
+
+// move assign [__f, __l) to [__r, __r + (__l-__f)).
+// If __vt points into [__f, __l), then subtract (__f - __r) from __vt.
+template <class _Tp, class _Allocator>
+typename deque<_Tp, _Allocator>::iterator
+deque<_Tp, _Allocator>::__move_and_check(iterator __f, iterator __l, iterator __r,
+                                         const_pointer& __vt)
+{
+    // as if
+    //   for (; __f != __l; ++__f, ++__r)
+    //       *__r = _VSTD::move(*__f);
+    difference_type __n = __l - __f;
+    while (__n > 0)
+    {
+        pointer __fb = __f.__ptr_;
+        pointer __fe = *__f.__m_iter_ + __block_size;
+        difference_type __bs = __fe - __fb;
+        if (__bs > __n)
+        {
+            __bs = __n;
+            __fe = __fb + __bs;
+        }
+        if (__fb <= __vt && __vt < __fe)
+            __vt = (const_iterator(static_cast<__map_const_pointer>(__f.__m_iter_), __vt) -= __f - __r).__ptr_;
+        __r = _VSTD::move(__fb, __fe, __r);
+        __n -= __bs;
+        __f += __bs;
+    }
+    return __r;
+}
+
+// move assign [__f, __l) to [__r - (__l-__f), __r) backwards.
+// If __vt points into [__f, __l), then add (__r - __l) to __vt.
+template <class _Tp, class _Allocator>
+typename deque<_Tp, _Allocator>::iterator
+deque<_Tp, _Allocator>::__move_backward_and_check(iterator __f, iterator __l, iterator __r,
+                                                  const_pointer& __vt)
+{
+    // as if
+    //   while (__f != __l)
+    //       *--__r = _VSTD::move(*--__l);
+    difference_type __n = __l - __f;
+    while (__n > 0)
+    {
+        --__l;
+        pointer __lb = *__l.__m_iter_;
+        pointer __le = __l.__ptr_ + 1;
+        difference_type __bs = __le - __lb;
+        if (__bs > __n)
+        {
+            __bs = __n;
+            __lb = __le - __bs;
+        }
+        if (__lb <= __vt && __vt < __le)
+            __vt = (const_iterator(static_cast<__map_const_pointer>(__l.__m_iter_), __vt) += __r - __l - 1).__ptr_;
+        __r = _VSTD::move_backward(__lb, __le, __r);
+        __n -= __bs;
+        __l -= __bs - 1;
+    }
+    return __r;
+}
+
+// move construct [__f, __l) to [__r, __r + (__l-__f)).
+// If __vt points into [__f, __l), then add (__r - __f) to __vt.
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::__move_construct_and_check(iterator __f, iterator __l,
+                                                   iterator __r, const_pointer& __vt)
+{
+    allocator_type& __a = __alloc();
+    // as if
+    //   for (; __f != __l; ++__r, ++__f, ++__size())
+    //       __alloc_traits::construct(__a, _VSTD::addressof(*__r), _VSTD::move(*__f));
+    difference_type __n = __l - __f;
+    while (__n > 0)
+    {
+        pointer __fb = __f.__ptr_;
+        pointer __fe = *__f.__m_iter_ + __block_size;
+        difference_type __bs = __fe - __fb;
+        if (__bs > __n)
+        {
+            __bs = __n;
+            __fe = __fb + __bs;
+        }
+        if (__fb <= __vt && __vt < __fe)
+            __vt = (const_iterator(static_cast<__map_const_pointer>(__f.__m_iter_), __vt) += __r - __f).__ptr_;
+        for (; __fb != __fe; ++__fb, ++__r, ++__size())
+            __alloc_traits::construct(__a, _VSTD::addressof(*__r), _VSTD::move(*__fb));
+        __n -= __bs;
+        __f += __bs;
+    }
+}
+
+// move construct [__f, __l) to [__r - (__l-__f), __r) backwards.
+// If __vt points into [__f, __l), then subtract (__l - __r) from __vt.
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::__move_construct_backward_and_check(iterator __f, iterator __l,
+                                                            iterator __r, const_pointer& __vt)
+{
+    allocator_type& __a = __alloc();
+    // as if
+    //   for (iterator __j = __l; __j != __f;)
+    //   {
+    //       __alloc_traitsconstruct(__a, _VSTD::addressof(*--__r), _VSTD::move(*--__j));
+    //       --__start_;
+    //       ++__size();
+    //   }
+    difference_type __n = __l - __f;
+    while (__n > 0)
+    {
+        --__l;
+        pointer __lb = *__l.__m_iter_;
+        pointer __le = __l.__ptr_ + 1;
+        difference_type __bs = __le - __lb;
+        if (__bs > __n)
+        {
+            __bs = __n;
+            __lb = __le - __bs;
+        }
+        if (__lb <= __vt && __vt < __le)
+            __vt = (const_iterator(static_cast<__map_const_pointer>(__l.__m_iter_), __vt) -= __l - __r + 1).__ptr_;
+        while (__le != __lb)
+        {
+            __alloc_traits::construct(__a, _VSTD::addressof(*--__r), _VSTD::move(*--__le));
+            --__start_;
+            ++__size();
+        }
+        __n -= __bs;
+        __l -= __bs - 1;
+    }
+}
+
+template <class _Tp, class _Allocator>
+typename deque<_Tp, _Allocator>::iterator
+deque<_Tp, _Allocator>::erase(const_iterator __f)
+{
+    iterator __b = begin();
+    difference_type __pos = __f - __b;
+    iterator __p = __b + __pos;
+    allocator_type& __a = __alloc();
+    if (static_cast<size_t>(__pos) <= (size() - 1) / 2)
+    {   // erase from front
+        _VSTD::move_backward(__b, __p, _VSTD::next(__p));
+        __alloc_traits::destroy(__a, _VSTD::addressof(*__b));
+        --__size();
+        ++__start_;
+        __maybe_remove_front_spare();
+    }
+    else
+    {   // erase from back
+        iterator __i = _VSTD::move(_VSTD::next(__p), end(), __p);
+        __alloc_traits::destroy(__a, _VSTD::addressof(*__i));
+        --__size();
+        __maybe_remove_back_spare();
+    }
+    return begin() + __pos;
+}
+
+template <class _Tp, class _Allocator>
+typename deque<_Tp, _Allocator>::iterator
+deque<_Tp, _Allocator>::erase(const_iterator __f, const_iterator __l)
+{
+    difference_type __n = __l - __f;
+    iterator __b = begin();
+    difference_type __pos = __f - __b;
+    iterator __p = __b + __pos;
+    if (__n > 0)
+    {
+        allocator_type& __a = __alloc();
+        if (static_cast<size_t>(__pos) <= (size() - __n) / 2)
+        {   // erase from front
+            iterator __i = _VSTD::move_backward(__b, __p, __p + __n);
+            for (; __b != __i; ++__b)
+                __alloc_traits::destroy(__a, _VSTD::addressof(*__b));
+            __size() -= __n;
+            __start_ += __n;
+            while (__maybe_remove_front_spare()) {
+            }
+        }
+        else
+        {   // erase from back
+            iterator __i = _VSTD::move(__p + __n, end(), __p);
+            for (iterator __e = end(); __i != __e; ++__i)
+                __alloc_traits::destroy(__a, _VSTD::addressof(*__i));
+            __size() -= __n;
+            while (__maybe_remove_back_spare()) {
+            }
+        }
+    }
+    return begin() + __pos;
+}
+
+template <class _Tp, class _Allocator>
+void
+deque<_Tp, _Allocator>::__erase_to_end(const_iterator __f)
+{
+    iterator __e = end();
+    difference_type __n = __e - __f;
+    if (__n > 0)
+    {
+        allocator_type& __a = __alloc();
+        iterator __b = begin();
+        difference_type __pos = __f - __b;
+        for (iterator __p = __b + __pos; __p != __e; ++__p)
+            __alloc_traits::destroy(__a, _VSTD::addressof(*__p));
+        __size() -= __n;
+        while (__maybe_remove_back_spare()) {
+        }
+    }
+}
+
+template <class _Tp, class _Allocator>
+inline
+void
+deque<_Tp, _Allocator>::swap(deque& __c)
+#if _LIBCPP_STD_VER >= 14
+        _NOEXCEPT
+#else
+        _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
+                    __is_nothrow_swappable<allocator_type>::value)
+#endif
+{
+    __map_.swap(__c.__map_);
+    _VSTD::swap(__start_, __c.__start_);
+    _VSTD::swap(__size(), __c.__size());
+    _VSTD::__swap_allocator(__alloc(), __c.__alloc());
+}
+
+template <class _Tp, class _Allocator>
+inline
+void
+deque<_Tp, _Allocator>::clear() _NOEXCEPT
+{
+    allocator_type& __a = __alloc();
+    for (iterator __i = begin(), __e = end(); __i != __e; ++__i)
+        __alloc_traits::destroy(__a, _VSTD::addressof(*__i));
+    __size() = 0;
+    while (__map_.size() > 2)
+    {
+        __alloc_traits::deallocate(__a, __map_.front(), __block_size);
+        __map_.pop_front();
+    }
+    switch (__map_.size())
+    {
+    case 1:
+        __start_ = __block_size / 2;
+        break;
+    case 2:
+        __start_ = __block_size;
+        break;
+    }
+}
+
+template <class _Tp, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator==(const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y)
+{
+    const typename deque<_Tp, _Allocator>::size_type __sz = __x.size();
+    return __sz == __y.size() && _VSTD::equal(__x.begin(), __x.end(), __y.begin());
+}
+
+template <class _Tp, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator!=(const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Tp, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator< (const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y)
+{
+    return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
+}
+
+template <class _Tp, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator> (const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y)
+{
+    return __y < __x;
+}
+
+template <class _Tp, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator>=(const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _Tp, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator<=(const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _Tp, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+void
+swap(deque<_Tp, _Allocator>& __x, deque<_Tp, _Allocator>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Tp, class _Allocator, class _Up>
+inline _LIBCPP_HIDE_FROM_ABI typename deque<_Tp, _Allocator>::size_type
+erase(deque<_Tp, _Allocator>& __c, const _Up& __v) {
+  auto __old_size = __c.size();
+  __c.erase(_VSTD::remove(__c.begin(), __c.end(), __v), __c.end());
+  return __old_size - __c.size();
+}
+
+template <class _Tp, class _Allocator, class _Predicate>
+inline _LIBCPP_HIDE_FROM_ABI typename deque<_Tp, _Allocator>::size_type
+erase_if(deque<_Tp, _Allocator>& __c, _Predicate __pred) {
+  auto __old_size = __c.size();
+  __c.erase(_VSTD::remove_if(__c.begin(), __c.end(), __pred), __c.end());
+  return __old_size - __c.size();
+}
+
+template <>
+inline constexpr bool __format::__enable_insertable<std::deque<char>> = true;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+inline constexpr bool __format::__enable_insertable<std::deque<wchar_t>> = true;
+#endif
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+_LIBCPP_BEGIN_NAMESPACE_STD
+namespace pmr {
+template <class _ValueT>
+using deque = std::deque<_ValueT, polymorphic_allocator<_ValueT>>;
+} // namespace pmr
+_LIBCPP_END_NAMESPACE_STD
+#endif
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <algorithm>
+#  include <atomic>
+#  include <concepts>
+#  include <functional>
+#  include <iosfwd>
+#  include <iterator>
+#  include <typeinfo>
+#endif
+
+#endif // _LIBCPP_DEQUE
diff --git a/app/src/main/cpp/libcxx/include/errno.h b/app/src/main/cpp/libcxx/include/errno.h
new file mode 100644
index 0000000..7b02d2b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/errno.h
@@ -0,0 +1,399 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_ERRNO_H
+#define _LIBCPP_ERRNO_H
+
+/*
+    errno.h synopsis
+
+Macros:
+
+    EDOM
+    EILSEQ  // C99
+    ERANGE
+    errno
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if __has_include_next(<errno.h>)
+#  include_next <errno.h>
+#endif
+
+#ifdef __cplusplus
+
+#if !defined(EOWNERDEAD) || !defined(ENOTRECOVERABLE)
+
+#ifdef ELAST
+
+static const int __elast1 = ELAST+1;
+static const int __elast2 = ELAST+2;
+
+#else
+
+static const int __elast1 = 104;
+static const int __elast2 = 105;
+
+#endif
+
+#ifdef ENOTRECOVERABLE
+
+#define EOWNERDEAD __elast1
+
+#ifdef ELAST
+#undef ELAST
+#define ELAST EOWNERDEAD
+#endif
+
+#elif defined(EOWNERDEAD)
+
+#define ENOTRECOVERABLE __elast1
+#ifdef ELAST
+#undef ELAST
+#define ELAST ENOTRECOVERABLE
+#endif
+
+#else  // defined(EOWNERDEAD)
+
+#define EOWNERDEAD __elast1
+#define ENOTRECOVERABLE __elast2
+#ifdef ELAST
+#undef ELAST
+#define ELAST ENOTRECOVERABLE
+#endif
+
+#endif // defined(EOWNERDEAD)
+
+#endif // !defined(EOWNERDEAD) || !defined(ENOTRECOVERABLE)
+
+//  supply errno values likely to be missing, particularly on Windows
+
+#ifndef EAFNOSUPPORT
+#define EAFNOSUPPORT 9901
+#endif
+
+#ifndef EADDRINUSE
+#define EADDRINUSE 9902
+#endif
+
+#ifndef EADDRNOTAVAIL
+#define EADDRNOTAVAIL 9903
+#endif
+
+#ifndef EISCONN
+#define EISCONN 9904
+#endif
+
+#ifndef EBADMSG
+#define EBADMSG 9905
+#endif
+
+#ifndef ECONNABORTED
+#define ECONNABORTED 9906
+#endif
+
+#ifndef EALREADY
+#define EALREADY 9907
+#endif
+
+#ifndef ECONNREFUSED
+#define ECONNREFUSED 9908
+#endif
+
+#ifndef ECONNRESET
+#define ECONNRESET 9909
+#endif
+
+#ifndef EDESTADDRREQ
+#define EDESTADDRREQ 9910
+#endif
+
+#ifndef EHOSTUNREACH
+#define EHOSTUNREACH 9911
+#endif
+
+#ifndef EIDRM
+#define EIDRM 9912
+#endif
+
+#ifndef EMSGSIZE
+#define EMSGSIZE 9913
+#endif
+
+#ifndef ENETDOWN
+#define ENETDOWN 9914
+#endif
+
+#ifndef ENETRESET
+#define ENETRESET 9915
+#endif
+
+#ifndef ENETUNREACH
+#define ENETUNREACH 9916
+#endif
+
+#ifndef ENOBUFS
+#define ENOBUFS 9917
+#endif
+
+#ifndef ENOLINK
+#define ENOLINK 9918
+#endif
+
+#ifndef ENODATA
+#define ENODATA 9919
+#endif
+
+#ifndef ENOMSG
+#define ENOMSG 9920
+#endif
+
+#ifndef ENOPROTOOPT
+#define ENOPROTOOPT 9921
+#endif
+
+#ifndef ENOSR
+#define ENOSR 9922
+#endif
+
+#ifndef ENOTSOCK
+#define ENOTSOCK 9923
+#endif
+
+#ifndef ENOSTR
+#define ENOSTR 9924
+#endif
+
+#ifndef ENOTCONN
+#define ENOTCONN 9925
+#endif
+
+#ifndef ENOTSUP
+#define ENOTSUP 9926
+#endif
+
+#ifndef ECANCELED
+#define ECANCELED 9927
+#endif
+
+#ifndef EINPROGRESS
+#define EINPROGRESS 9928
+#endif
+
+#ifndef EOPNOTSUPP
+#define EOPNOTSUPP 9929
+#endif
+
+#ifndef EWOULDBLOCK
+#define EWOULDBLOCK 9930
+#endif
+
+#ifndef EOWNERDEAD
+#define EOWNERDEAD  9931
+#endif
+
+#ifndef EPROTO
+#define EPROTO 9932
+#endif
+
+#ifndef EPROTONOSUPPORT
+#define EPROTONOSUPPORT 9933
+#endif
+
+#ifndef ENOTRECOVERABLE
+#define ENOTRECOVERABLE 9934
+#endif
+
+#ifndef ETIME
+#define ETIME 9935
+#endif
+
+#ifndef ETXTBSY
+#define ETXTBSY 9936
+#endif
+
+#ifndef ETIMEDOUT
+#define ETIMEDOUT 9938
+#endif
+
+#ifndef ELOOP
+#define ELOOP 9939
+#endif
+
+#ifndef EOVERFLOW
+#define EOVERFLOW 9940
+#endif
+
+#ifndef EPROTOTYPE
+#define EPROTOTYPE 9941
+#endif
+
+#ifndef ENOSYS
+#define ENOSYS 9942
+#endif
+
+#ifndef EINVAL
+#define EINVAL 9943
+#endif
+
+#ifndef ERANGE
+#define ERANGE 9944
+#endif
+
+#ifndef EILSEQ
+#define EILSEQ 9945
+#endif
+
+//  Windows Mobile doesn't appear to define these:
+
+#ifndef E2BIG
+#define E2BIG 9946
+#endif
+
+#ifndef EDOM
+#define EDOM 9947
+#endif
+
+#ifndef EFAULT
+#define EFAULT 9948
+#endif
+
+#ifndef EBADF
+#define EBADF 9949
+#endif
+
+#ifndef EPIPE
+#define EPIPE 9950
+#endif
+
+#ifndef EXDEV
+#define EXDEV 9951
+#endif
+
+#ifndef EBUSY
+#define EBUSY 9952
+#endif
+
+#ifndef ENOTEMPTY
+#define ENOTEMPTY 9953
+#endif
+
+#ifndef ENOEXEC
+#define ENOEXEC 9954
+#endif
+
+#ifndef EEXIST
+#define EEXIST 9955
+#endif
+
+#ifndef EFBIG
+#define EFBIG 9956
+#endif
+
+#ifndef ENAMETOOLONG
+#define ENAMETOOLONG 9957
+#endif
+
+#ifndef ENOTTY
+#define ENOTTY 9958
+#endif
+
+#ifndef EINTR
+#define EINTR 9959
+#endif
+
+#ifndef ESPIPE
+#define ESPIPE 9960
+#endif
+
+#ifndef EIO
+#define EIO 9961
+#endif
+
+#ifndef EISDIR
+#define EISDIR 9962
+#endif
+
+#ifndef ECHILD
+#define ECHILD 9963
+#endif
+
+#ifndef ENOLCK
+#define ENOLCK 9964
+#endif
+
+#ifndef ENOSPC
+#define ENOSPC 9965
+#endif
+
+#ifndef ENXIO
+#define ENXIO 9966
+#endif
+
+#ifndef ENODEV
+#define ENODEV 9967
+#endif
+
+#ifndef ENOENT
+#define ENOENT 9968
+#endif
+
+#ifndef ESRCH
+#define ESRCH 9969
+#endif
+
+#ifndef ENOTDIR
+#define ENOTDIR 9970
+#endif
+
+#ifndef ENOMEM
+#define ENOMEM 9971
+#endif
+
+#ifndef EPERM
+#define EPERM 9972
+#endif
+
+#ifndef EACCES
+#define EACCES 9973
+#endif
+
+#ifndef EROFS
+#define EROFS 9974
+#endif
+
+#ifndef EDEADLK
+#define EDEADLK 9975
+#endif
+
+#ifndef EAGAIN
+#define EAGAIN 9976
+#endif
+
+#ifndef ENFILE
+#define ENFILE 9977
+#endif
+
+#ifndef EMFILE
+#define EMFILE 9978
+#endif
+
+#ifndef EMLINK
+#define EMLINK 9979
+#endif
+
+#endif // __cplusplus
+
+#endif // _LIBCPP_ERRNO_H
diff --git a/app/src/main/cpp/libcxx/include/exception b/app/src/main/cpp/libcxx/include/exception
new file mode 100644
index 0000000..e0f4268
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/exception
@@ -0,0 +1,384 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXCEPTION
+#define _LIBCPP_EXCEPTION
+
+/*
+    exception synopsis
+
+namespace std
+{
+
+class exception
+{
+public:
+    exception() noexcept;
+    exception(const exception&) noexcept;
+    exception& operator=(const exception&) noexcept;
+    virtual ~exception() noexcept;
+    virtual const char* what() const noexcept;
+};
+
+class bad_exception
+    : public exception
+{
+public:
+    bad_exception() noexcept;
+    bad_exception(const bad_exception&) noexcept;
+    bad_exception& operator=(const bad_exception&) noexcept;
+    virtual ~bad_exception() noexcept;
+    virtual const char* what() const noexcept;
+};
+
+typedef void (*unexpected_handler)();
+unexpected_handler set_unexpected(unexpected_handler  f ) noexcept;
+unexpected_handler get_unexpected() noexcept;
+[[noreturn]] void unexpected();
+
+typedef void (*terminate_handler)();
+terminate_handler set_terminate(terminate_handler  f ) noexcept;
+terminate_handler get_terminate() noexcept;
+[[noreturn]] void terminate() noexcept;
+
+bool uncaught_exception()  noexcept;
+int  uncaught_exceptions() noexcept;  // C++17
+
+typedef unspecified exception_ptr;
+
+exception_ptr current_exception() noexcept;
+void rethrow_exception [[noreturn]] (exception_ptr p);
+template<class E> exception_ptr make_exception_ptr(E e) noexcept;
+
+class nested_exception
+{
+public:
+    nested_exception() noexcept;
+    nested_exception(const nested_exception&) noexcept = default;
+    nested_exception& operator=(const nested_exception&) noexcept = default;
+    virtual ~nested_exception() = default;
+
+    // access functions
+    [[noreturn]] void rethrow_nested() const;
+    exception_ptr nested_ptr() const noexcept;
+};
+
+template <class T> [[noreturn]] void throw_with_nested(T&& t);
+template <class E> void rethrow_if_nested(const E& e);
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__config>
+#include <__memory/addressof.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/is_base_of.h>
+#include <__type_traits/is_class.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__type_traits/is_final.h>
+#include <__type_traits/is_polymorphic.h>
+#include <cstddef>
+#include <cstdlib>
+#include <version>
+
+// <vcruntime_exception.h> defines its own std::exception and std::bad_exception types,
+// which we use in order to be ABI-compatible with other STLs on Windows.
+#if defined(_LIBCPP_ABI_VCRUNTIME)
+#  include <vcruntime_exception.h>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+namespace std  // purposefully not using versioning namespace
+{
+
+#if defined(_LIBCPP_ABI_VCRUNTIME) && (!defined(_HAS_EXCEPTIONS) || _HAS_EXCEPTIONS != 0)
+// The std::exception class was already included above, but we're explicit about this condition here for clarity.
+
+#elif defined(_LIBCPP_ABI_VCRUNTIME) && _HAS_EXCEPTIONS == 0
+// However, <vcruntime_exception.h> does not define std::exception and std::bad_exception
+// when _HAS_EXCEPTIONS == 0.
+//
+// Since libc++ still wants to provide the std::exception hierarchy even when _HAS_EXCEPTIONS == 0
+// (after all those are simply types like any other), we define an ABI-compatible version
+// of the VCRuntime std::exception and std::bad_exception types in that mode.
+
+struct __std_exception_data {
+  char const* _What;
+  bool _DoFree;
+};
+
+class exception { // base of all library exceptions
+public:
+  exception() _NOEXCEPT : __data_() {}
+
+  explicit exception(char const* __message) _NOEXCEPT : __data_() {
+    __data_._What = __message;
+    __data_._DoFree = true;
+  }
+
+  exception(exception const&) _NOEXCEPT {}
+
+  exception& operator=(exception const&) _NOEXCEPT { return *this; }
+
+  virtual ~exception() _NOEXCEPT {}
+
+  virtual char const* what() const _NOEXCEPT { return __data_._What ? __data_._What : "Unknown exception"; }
+
+private:
+  __std_exception_data __data_;
+};
+
+class bad_exception : public exception {
+public:
+  bad_exception() _NOEXCEPT : exception("bad exception") {}
+};
+
+#else // !defined(_LIBCPP_ABI_VCRUNTIME)
+// On all other platforms, we define our own std::exception and std::bad_exception types
+// regardless of whether exceptions are turned on as a language feature.
+
+class _LIBCPP_EXCEPTION_ABI exception {
+public:
+  _LIBCPP_INLINE_VISIBILITY exception() _NOEXCEPT {}
+  _LIBCPP_INLINE_VISIBILITY exception(const exception&) _NOEXCEPT = default;
+
+  virtual ~exception() _NOEXCEPT;
+  virtual const char* what() const _NOEXCEPT;
+};
+
+class _LIBCPP_EXCEPTION_ABI bad_exception : public exception {
+public:
+  _LIBCPP_INLINE_VISIBILITY bad_exception() _NOEXCEPT {}
+  ~bad_exception() _NOEXCEPT override;
+  const char* what() const _NOEXCEPT override;
+};
+#endif // !_LIBCPP_ABI_VCRUNTIME
+
+#if _LIBCPP_STD_VER <= 14 \
+    || defined(_LIBCPP_ENABLE_CXX17_REMOVED_UNEXPECTED_FUNCTIONS) \
+    || defined(_LIBCPP_BUILDING_LIBRARY)
+typedef void (*unexpected_handler)();
+_LIBCPP_FUNC_VIS unexpected_handler set_unexpected(unexpected_handler) _NOEXCEPT;
+_LIBCPP_FUNC_VIS unexpected_handler get_unexpected() _NOEXCEPT;
+_LIBCPP_NORETURN _LIBCPP_FUNC_VIS void unexpected();
+#endif
+
+typedef void (*terminate_handler)();
+_LIBCPP_FUNC_VIS terminate_handler set_terminate(terminate_handler) _NOEXCEPT;
+_LIBCPP_FUNC_VIS terminate_handler get_terminate() _NOEXCEPT;
+_LIBCPP_NORETURN _LIBCPP_FUNC_VIS void terminate() _NOEXCEPT;
+
+_LIBCPP_FUNC_VIS bool uncaught_exception() _NOEXCEPT;
+_LIBCPP_FUNC_VIS _LIBCPP_AVAILABILITY_UNCAUGHT_EXCEPTIONS int uncaught_exceptions() _NOEXCEPT;
+
+class _LIBCPP_TYPE_VIS exception_ptr;
+
+_LIBCPP_FUNC_VIS exception_ptr current_exception() _NOEXCEPT;
+_LIBCPP_NORETURN _LIBCPP_FUNC_VIS void rethrow_exception(exception_ptr);
+
+#ifndef _LIBCPP_ABI_MICROSOFT
+
+class _LIBCPP_TYPE_VIS exception_ptr
+{
+    void* __ptr_;
+public:
+    _LIBCPP_INLINE_VISIBILITY exception_ptr() _NOEXCEPT : __ptr_() {}
+    _LIBCPP_INLINE_VISIBILITY exception_ptr(nullptr_t) _NOEXCEPT : __ptr_() {}
+
+    exception_ptr(const exception_ptr&) _NOEXCEPT;
+    exception_ptr& operator=(const exception_ptr&) _NOEXCEPT;
+    ~exception_ptr() _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY explicit operator bool() const _NOEXCEPT
+    {return __ptr_ != nullptr;}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const exception_ptr& __x, const exception_ptr& __y) _NOEXCEPT
+        {return __x.__ptr_ == __y.__ptr_;}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const exception_ptr& __x, const exception_ptr& __y) _NOEXCEPT
+        {return !(__x == __y);}
+
+    friend _LIBCPP_FUNC_VIS exception_ptr current_exception() _NOEXCEPT;
+    friend _LIBCPP_FUNC_VIS void rethrow_exception(exception_ptr);
+};
+
+template<class _Ep>
+_LIBCPP_INLINE_VISIBILITY exception_ptr
+make_exception_ptr(_Ep __e) _NOEXCEPT
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+        throw __e;
+    }
+    catch (...)
+    {
+        return current_exception();
+    }
+#else
+    ((void)__e);
+    _VSTD::abort();
+#endif
+}
+
+#else // _LIBCPP_ABI_MICROSOFT
+
+class _LIBCPP_TYPE_VIS exception_ptr
+{
+_LIBCPP_DIAGNOSTIC_PUSH
+_LIBCPP_CLANG_DIAGNOSTIC_IGNORED("-Wunused-private-field")
+    void* __ptr1_;
+    void* __ptr2_;
+_LIBCPP_DIAGNOSTIC_POP
+public:
+    exception_ptr() _NOEXCEPT;
+    exception_ptr(nullptr_t) _NOEXCEPT;
+    exception_ptr(const exception_ptr& __other) _NOEXCEPT;
+    exception_ptr& operator=(const exception_ptr& __other) _NOEXCEPT;
+    exception_ptr& operator=(nullptr_t) _NOEXCEPT;
+    ~exception_ptr() _NOEXCEPT;
+    explicit operator bool() const _NOEXCEPT;
+};
+
+_LIBCPP_FUNC_VIS
+bool operator==(const exception_ptr& __x, const exception_ptr& __y) _NOEXCEPT;
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator!=(const exception_ptr& __x, const exception_ptr& __y) _NOEXCEPT
+    {return !(__x == __y);}
+
+_LIBCPP_FUNC_VIS void swap(exception_ptr&, exception_ptr&) _NOEXCEPT;
+
+_LIBCPP_FUNC_VIS exception_ptr __copy_exception_ptr(void *__except, const void* __ptr);
+_LIBCPP_FUNC_VIS exception_ptr current_exception() _NOEXCEPT;
+_LIBCPP_NORETURN _LIBCPP_FUNC_VIS void rethrow_exception(exception_ptr);
+
+// This is a built-in template function which automagically extracts the required
+// information.
+template <class _E> void *__GetExceptionInfo(_E);
+
+template<class _Ep>
+_LIBCPP_INLINE_VISIBILITY exception_ptr
+make_exception_ptr(_Ep __e) _NOEXCEPT
+{
+  return __copy_exception_ptr(_VSTD::addressof(__e), __GetExceptionInfo(__e));
+}
+
+#endif // _LIBCPP_ABI_MICROSOFT
+// nested_exception
+
+class _LIBCPP_EXCEPTION_ABI nested_exception
+{
+    exception_ptr __ptr_;
+public:
+    nested_exception() _NOEXCEPT;
+//     nested_exception(const nested_exception&) noexcept = default;
+//     nested_exception& operator=(const nested_exception&) noexcept = default;
+    virtual ~nested_exception() _NOEXCEPT;
+
+    // access functions
+    _LIBCPP_NORETURN void rethrow_nested() const;
+    _LIBCPP_INLINE_VISIBILITY exception_ptr nested_ptr() const _NOEXCEPT {return __ptr_;}
+};
+
+template <class _Tp>
+struct __nested
+    : public _Tp,
+      public nested_exception
+{
+    _LIBCPP_INLINE_VISIBILITY explicit __nested(const _Tp& __t) : _Tp(__t) {}
+};
+
+#ifndef _LIBCPP_NO_EXCEPTIONS
+template <class _Tp, class _Up, bool>
+struct __throw_with_nested;
+
+template <class _Tp, class _Up>
+struct __throw_with_nested<_Tp, _Up, true> {
+    _LIBCPP_NORETURN static inline _LIBCPP_INLINE_VISIBILITY void
+    __do_throw(_Tp&& __t)
+    {
+        throw __nested<_Up>(static_cast<_Tp&&>(__t));
+    }
+};
+
+template <class _Tp, class _Up>
+struct __throw_with_nested<_Tp, _Up, false> {
+    _LIBCPP_NORETURN static inline _LIBCPP_INLINE_VISIBILITY void
+#ifndef _LIBCPP_CXX03_LANG
+    __do_throw(_Tp&& __t)
+#else
+    __do_throw (_Tp& __t)
+#endif // _LIBCPP_CXX03_LANG
+    {
+        throw static_cast<_Tp&&>(__t);
+    }
+};
+#endif
+
+template <class _Tp>
+_LIBCPP_NORETURN _LIBCPP_HIDE_FROM_ABI
+void
+throw_with_nested(_Tp&& __t)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    typedef typename decay<_Tp>::type _Up;
+    static_assert( is_copy_constructible<_Up>::value, "type thrown must be CopyConstructible");
+    __throw_with_nested<_Tp, _Up,
+        is_class<_Up>::value &&
+        !is_base_of<nested_exception, _Up>::value &&
+        !__libcpp_is_final<_Up>::value>::
+            __do_throw(static_cast<_Tp&&>(__t));
+#else
+    ((void)__t);
+    // FIXME: Make this abort
+#endif
+}
+
+template <class _From, class _To>
+struct __can_dynamic_cast : _BoolConstant<
+              is_polymorphic<_From>::value &&
+                 (!is_base_of<_To, _From>::value ||
+                   is_convertible<const _From*, const _To*>::value)> {};
+
+template <class _Ep>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+rethrow_if_nested(const _Ep& __e,
+                  __enable_if_t< __can_dynamic_cast<_Ep, nested_exception>::value>* = 0)
+{
+    const nested_exception* __nep = dynamic_cast<const nested_exception*>(_VSTD::addressof(__e));
+    if (__nep)
+        __nep->rethrow_nested();
+}
+
+template <class _Ep>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+rethrow_if_nested(const _Ep&,
+                  __enable_if_t<!__can_dynamic_cast<_Ep, nested_exception>::value>* = 0)
+{
+}
+
+} // namespace std
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_EXCEPTION
diff --git a/app/src/main/cpp/libcxx/include/execution b/app/src/main/cpp/libcxx/include/execution
new file mode 100644
index 0000000..0402970
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/execution
@@ -0,0 +1,25 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXECUTION
+#define _LIBCPP_EXECUTION
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <version>
+
+#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17
+#   include <__pstl_execution>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif // _LIBCPP_EXECUTION
diff --git a/app/src/main/cpp/libcxx/include/expected b/app/src/main/cpp/libcxx/include/expected
new file mode 100644
index 0000000..486d0a2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/expected
@@ -0,0 +1,54 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPECTED
+#define _LIBCPP_EXPECTED
+
+/*
+  Header <expected> synopsis
+
+namespace std {
+  // [expected.unexpected], class template unexpected
+  template<class E> class unexpected;
+
+  // [expected.bad], class template bad_expected_access
+  template<class E> class bad_expected_access;
+
+  // [expected.bad.void], specialization for void
+  template<> class bad_expected_access<void>;
+
+  // in-place construction of unexpected values
+  struct unexpect_t {
+    explicit unexpect_t() = default;
+  };
+  inline constexpr unexpect_t unexpect{};
+
+  // [expected.expected], class template expected
+  template<class T, class E> class expected;
+
+  // [expected.void], partial specialization of expected for void types
+  template<class T, class E> requires is_void_v<T> class expected<T, E>;
+}
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__expected/bad_expected_access.h>
+#include <__expected/expected.h>
+#include <__expected/unexpect.h>
+#include <__expected/unexpected.h>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif // _LIBCPP_EXPECTED
+
diff --git a/app/src/main/cpp/libcxx/include/experimental/__config b/app/src/main/cpp/libcxx/include/experimental/__config
new file mode 100644
index 0000000..a71b348
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/__config
@@ -0,0 +1,66 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_CONFIG
+#define _LIBCPP_EXPERIMENTAL_CONFIG
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#define _LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL namespace std { namespace experimental {
+#define _LIBCPP_END_NAMESPACE_EXPERIMENTAL  } }
+#define _VSTD_EXPERIMENTAL std::experimental
+
+#define _LIBCPP_BEGIN_NAMESPACE_LFTS _LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL inline namespace fundamentals_v1 {
+#define _LIBCPP_END_NAMESPACE_LFTS  } } }
+#define _VSTD_LFTS _VSTD_EXPERIMENTAL::fundamentals_v1
+
+#define _LIBCPP_BEGIN_NAMESPACE_LFTS_V2 _LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL inline namespace fundamentals_v2 {
+#define _LIBCPP_END_NAMESPACE_LFTS_V2  } } }
+#define _VSTD_LFTS_V2 _VSTD_EXPERIMENTAL::fundamentals_v2
+
+#define _LIBCPP_BEGIN_NAMESPACE_LFTS_PMR _LIBCPP_BEGIN_NAMESPACE_LFTS namespace pmr {
+#define _LIBCPP_END_NAMESPACE_LFTS_PMR _LIBCPP_END_NAMESPACE_LFTS }
+#define _VSTD_LFTS_PMR _VSTD_LFTS::pmr
+
+#if !defined(__cpp_coroutines) || __cpp_coroutines < 201703L
+#define _LIBCPP_HAS_NO_EXPERIMENTAL_COROUTINES
+#endif
+
+#define _LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL_COROUTINES \
+  _LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL inline namespace coroutines_v1 {
+
+#define _LIBCPP_END_NAMESPACE_EXPERIMENTAL_COROUTINES \
+  } _LIBCPP_END_NAMESPACE_EXPERIMENTAL
+
+#define _VSTD_CORO _VSTD_EXPERIMENTAL::coroutines_v1
+
+#define _LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL_SIMD \
+    _LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL inline namespace parallelism_v2 {
+
+#define _LIBCPP_END_NAMESPACE_EXPERIMENTAL_SIMD \
+    } _LIBCPP_END_NAMESPACE_EXPERIMENTAL
+
+#define _LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL_SIMD_ABI \
+    _LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL_SIMD namespace simd_abi {
+
+#define _LIBCPP_END_NAMESPACE_EXPERIMENTAL_SIMD_ABI \
+    } _LIBCPP_END_NAMESPACE_EXPERIMENTAL_SIMD
+
+// TODO: support more targets
+#if defined(__AVX__)
+#define _LIBCPP_NATIVE_SIMD_WIDTH_IN_BYTES 32
+#else
+#define _LIBCPP_NATIVE_SIMD_WIDTH_IN_BYTES 16
+#endif
+
+#endif
diff --git a/app/src/main/cpp/libcxx/include/experimental/__memory b/app/src/main/cpp/libcxx/include/experimental/__memory
new file mode 100644
index 0000000..b36f31e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/__memory
@@ -0,0 +1,117 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL___MEMORY
+#define _LIBCPP_EXPERIMENTAL___MEMORY
+
+#include <__memory/allocator_arg_t.h>
+#include <__memory/uses_allocator.h>
+#include <experimental/__config>
+#include <experimental/utility> // for erased_type
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS
+
+template <
+    class _Tp, class _Alloc
+  , bool = uses_allocator<_Tp, _Alloc>::value
+  , bool = __has_allocator_type<_Tp>::value
+  >
+struct __lfts_uses_allocator : public false_type {};
+
+template <class _Tp, class _Alloc>
+struct __lfts_uses_allocator<_Tp, _Alloc, false, false> : public false_type {};
+
+template <class _Tp, class _Alloc, bool HasAlloc>
+struct __lfts_uses_allocator<_Tp, _Alloc, true, HasAlloc> : public true_type {};
+
+template <class _Tp, class _Alloc>
+struct __lfts_uses_allocator<_Tp, _Alloc, false, true>
+  : public integral_constant<bool
+    , is_convertible<_Alloc, typename _Tp::allocator_type>::value
+      || is_same<erased_type, typename _Tp::allocator_type>::value
+    >
+{};
+
+template <bool _UsesAlloc, class _Tp, class _Alloc, class ..._Args>
+struct __lfts_uses_alloc_ctor_imp
+{
+    static const int value = 0;
+};
+
+template <class _Tp, class _Alloc, class ..._Args>
+struct __lfts_uses_alloc_ctor_imp<true, _Tp, _Alloc, _Args...>
+{
+    static const bool __ic_first
+        = is_constructible<_Tp, allocator_arg_t, _Alloc, _Args...>::value;
+
+    static const bool __ic_second =
+        __conditional_t<
+            __ic_first,
+            false_type,
+            is_constructible<_Tp, _Args..., _Alloc>
+        >::value;
+
+    static_assert(__ic_first || __ic_second,
+                  "Request for uses allocator construction is ill-formed");
+
+    static const int value = __ic_first ? 1 : 2;
+};
+
+template <class _Tp, class _Alloc, class ..._Args>
+struct __lfts_uses_alloc_ctor
+  : integral_constant<int,
+        __lfts_uses_alloc_ctor_imp<
+            __lfts_uses_allocator<_Tp, _Alloc>::value
+          , _Tp, _Alloc, _Args...
+        >::value
+    >
+{};
+
+template <class _Tp, class _Allocator, class... _Args>
+inline _LIBCPP_INLINE_VISIBILITY
+void __user_alloc_construct_impl (integral_constant<int, 0>, _Tp *__storage, const _Allocator &, _Args &&... __args )
+{
+    new (__storage) _Tp (_VSTD::forward<_Args>(__args)...);
+}
+
+// FIXME: This should have a version which takes a non-const alloc.
+template <class _Tp, class _Allocator, class... _Args>
+inline _LIBCPP_INLINE_VISIBILITY
+void __user_alloc_construct_impl (integral_constant<int, 1>, _Tp *__storage, const _Allocator &__a, _Args &&... __args )
+{
+    new (__storage) _Tp (allocator_arg, __a, _VSTD::forward<_Args>(__args)...);
+}
+
+// FIXME: This should have a version which takes a non-const alloc.
+template <class _Tp, class _Allocator, class... _Args>
+inline _LIBCPP_INLINE_VISIBILITY
+void __user_alloc_construct_impl (integral_constant<int, 2>, _Tp *__storage, const _Allocator &__a, _Args &&... __args )
+{
+    new (__storage) _Tp (_VSTD::forward<_Args>(__args)..., __a);
+}
+
+template <class _Tp, class _Alloc, class ..._Args>
+inline _LIBCPP_INLINE_VISIBILITY
+void __lfts_user_alloc_construct(
+    _Tp * __store, const _Alloc & __a, _Args &&... __args)
+{
+    ::std::experimental::fundamentals_v1::__user_alloc_construct_impl(
+        typename __lfts_uses_alloc_ctor<_Tp, _Alloc, _Args...>::type()
+       , __store, __a, _VSTD::forward<_Args>(__args)...
+       );
+}
+
+_LIBCPP_END_NAMESPACE_LFTS
+
+#endif /* _LIBCPP_EXPERIMENTAL___MEMORY */
diff --git a/app/src/main/cpp/libcxx/include/experimental/algorithm b/app/src/main/cpp/libcxx/include/experimental/algorithm
new file mode 100644
index 0000000..e0ca3c7
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/algorithm
@@ -0,0 +1,53 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_ALGORITHM
+#define _LIBCPP_EXPERIMENTAL_ALGORITHM
+
+/*
+   experimental/algorithm synopsis
+
+#include <algorithm>
+
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+
+template <class ForwardIterator, class Searcher>
+ForwardIterator search(ForwardIterator first, ForwardIterator last,
+                       const Searcher &searcher);
+
+// sample removed because it's now part of C++17
+
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__debug>
+#include <algorithm>
+#include <experimental/__config>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS
+
+template <class _ForwardIterator, class _Searcher>
+_LIBCPP_INLINE_VISIBILITY
+_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s)
+{ return __s(__f, __l).first; }
+
+_LIBCPP_END_NAMESPACE_LFTS
+
+#endif /* _LIBCPP_EXPERIMENTAL_ALGORITHM */
diff --git a/app/src/main/cpp/libcxx/include/experimental/coroutine b/app/src/main/cpp/libcxx/include/experimental/coroutine
new file mode 100644
index 0000000..d9f3685
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/coroutine
@@ -0,0 +1,344 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_COROUTINE
+#define _LIBCPP_EXPERIMENTAL_COROUTINE
+
+/**
+    experimental/coroutine synopsis
+
+// C++next
+
+namespace std {
+namespace experimental {
+inline namespace coroutines_v1 {
+
+  // 18.11.1 coroutine traits
+template <typename R, typename... ArgTypes>
+class coroutine_traits;
+// 18.11.2 coroutine handle
+template <typename Promise = void>
+class coroutine_handle;
+// 18.11.2.7 comparison operators:
+bool operator==(coroutine_handle<> x, coroutine_handle<> y) _NOEXCEPT;
+bool operator!=(coroutine_handle<> x, coroutine_handle<> y) _NOEXCEPT;
+bool operator<(coroutine_handle<> x, coroutine_handle<> y) _NOEXCEPT;
+bool operator<=(coroutine_handle<> x, coroutine_handle<> y) _NOEXCEPT;
+bool operator>=(coroutine_handle<> x, coroutine_handle<> y) _NOEXCEPT;
+bool operator>(coroutine_handle<> x, coroutine_handle<> y) _NOEXCEPT;
+// 18.11.3 trivial awaitables
+struct suspend_never;
+struct suspend_always;
+// 18.11.2.8 hash support:
+template <class T> struct hash;
+template <class P> struct hash<coroutine_handle<P>>;
+
+} // namespace coroutines_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__functional/hash.h>
+#include <__functional/operations.h>
+#include <cstddef>
+#include <experimental/__config>
+#include <new>
+#include <type_traits>
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <atomic>
+#  include <climits>
+#  include <cmath>
+#  include <compare>
+#  include <concepts>
+#  include <ctime>
+#  include <initializer_list>
+#  include <iosfwd>
+#  include <iterator>
+#  include <memory>
+#  include <ratio>
+#  include <stdexcept>
+#  include <tuple>
+#  include <typeinfo>
+#  include <utility>
+#  include <variant>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifndef _LIBCPP_HAS_NO_EXPERIMENTAL_COROUTINES
+
+_LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL_COROUTINES
+
+template <class _Tp, class = void>
+struct __coroutine_traits_sfinae {};
+
+template <class _Tp>
+struct __coroutine_traits_sfinae<_Tp, __void_t<typename _Tp::promise_type> >
+{
+  using promise_type = typename _Tp::promise_type;
+};
+
+template <typename _Ret, typename... _Args>
+struct coroutine_traits
+    : public __coroutine_traits_sfinae<_Ret>
+{
+};
+
+template <typename _Promise = void>
+class _LIBCPP_TEMPLATE_VIS coroutine_handle;
+
+template <>
+class _LIBCPP_TEMPLATE_VIS coroutine_handle<void> {
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR coroutine_handle() _NOEXCEPT : __handle_(nullptr) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR coroutine_handle(nullptr_t) _NOEXCEPT : __handle_(nullptr) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    coroutine_handle& operator=(nullptr_t) _NOEXCEPT {
+        __handle_ = nullptr;
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR void* address() const _NOEXCEPT { return __handle_; }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR explicit operator bool() const _NOEXCEPT { return __handle_; }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator()() { resume(); }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void resume() {
+      _LIBCPP_ASSERT(__is_suspended(),
+                     "resume() can only be called on suspended coroutines");
+      _LIBCPP_ASSERT(!done(),
+                "resume() has undefined behavior when the coroutine is done");
+      __builtin_coro_resume(__handle_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void destroy() {
+      _LIBCPP_ASSERT(__is_suspended(),
+                     "destroy() can only be called on suspended coroutines");
+      __builtin_coro_destroy(__handle_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool done() const {
+      _LIBCPP_ASSERT(__is_suspended(),
+                     "done() can only be called on suspended coroutines");
+      return __builtin_coro_done(__handle_);
+    }
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    static coroutine_handle from_address(void* __addr) _NOEXCEPT {
+        coroutine_handle __tmp;
+        __tmp.__handle_ = __addr;
+        return __tmp;
+    }
+
+    // FIXME: Should from_address(nullptr) be allowed?
+    _LIBCPP_INLINE_VISIBILITY
+    static coroutine_handle from_address(nullptr_t) _NOEXCEPT {
+      return coroutine_handle(nullptr);
+    }
+
+    template <class _Tp, bool _CallIsValid = false>
+    static coroutine_handle from_address(_Tp*) {
+      static_assert(_CallIsValid,
+       "coroutine_handle<void>::from_address cannot be called with "
+        "non-void pointers");
+    }
+
+private:
+  bool __is_suspended() const _NOEXCEPT  {
+    // FIXME actually implement a check for if the coro is suspended.
+    return __handle_;
+  }
+
+  template <class _PromiseT> friend class coroutine_handle;
+  void* __handle_;
+};
+
+// 18.11.2.7 comparison operators:
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator==(coroutine_handle<> __x, coroutine_handle<> __y) _NOEXCEPT {
+    return __x.address() == __y.address();
+}
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator!=(coroutine_handle<> __x, coroutine_handle<> __y) _NOEXCEPT {
+    return !(__x == __y);
+}
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator<(coroutine_handle<> __x, coroutine_handle<> __y) _NOEXCEPT {
+    return less<void*>()(__x.address(), __y.address());
+}
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator>(coroutine_handle<> __x, coroutine_handle<> __y) _NOEXCEPT {
+    return __y < __x;
+}
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator<=(coroutine_handle<> __x, coroutine_handle<> __y) _NOEXCEPT {
+    return !(__x > __y);
+}
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator>=(coroutine_handle<> __x, coroutine_handle<> __y) _NOEXCEPT {
+    return !(__x < __y);
+}
+
+template <typename _Promise>
+class _LIBCPP_TEMPLATE_VIS coroutine_handle : public coroutine_handle<> {
+    using _Base = coroutine_handle<>;
+public:
+#ifndef _LIBCPP_CXX03_LANG
+    // 18.11.2.1 construct/reset
+    using coroutine_handle<>::coroutine_handle;
+#else
+    _LIBCPP_INLINE_VISIBILITY coroutine_handle() _NOEXCEPT : _Base() {}
+    _LIBCPP_INLINE_VISIBILITY coroutine_handle(nullptr_t) _NOEXCEPT : _Base(nullptr) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    coroutine_handle& operator=(nullptr_t) _NOEXCEPT {
+        _Base::operator=(nullptr);
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Promise& promise() const {
+        return *static_cast<_Promise*>(
+            __builtin_coro_promise(this->__handle_, _LIBCPP_ALIGNOF(_Promise), false));
+    }
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    static coroutine_handle from_address(void* __addr) _NOEXCEPT {
+        coroutine_handle __tmp;
+        __tmp.__handle_ = __addr;
+        return __tmp;
+    }
+
+    // NOTE: this overload isn't required by the standard but is needed so
+    // the deleted _Promise* overload doesn't make from_address(nullptr)
+    // ambiguous.
+    // FIXME: should from_address work with nullptr?
+    _LIBCPP_INLINE_VISIBILITY
+    static coroutine_handle from_address(nullptr_t) _NOEXCEPT {
+      return coroutine_handle(nullptr);
+    }
+
+    template <class _Tp, bool _CallIsValid = false>
+    static coroutine_handle from_address(_Tp*) {
+      static_assert(_CallIsValid,
+       "coroutine_handle<promise_type>::from_address cannot be called with "
+        "non-void pointers");
+    }
+
+    template <bool _CallIsValid = false>
+    static coroutine_handle from_address(_Promise*) {
+      static_assert(_CallIsValid,
+       "coroutine_handle<promise_type>::from_address cannot be used with "
+        "pointers to the coroutine's promise type; use 'from_promise' instead");
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    static coroutine_handle from_promise(_Promise& __promise) _NOEXCEPT {
+        typedef __remove_cv_t<_Promise> _RawPromise;
+        coroutine_handle __tmp;
+        __tmp.__handle_ = __builtin_coro_promise(
+            _VSTD::addressof(const_cast<_RawPromise&>(__promise)),
+             _LIBCPP_ALIGNOF(_Promise), true);
+        return __tmp;
+    }
+};
+
+#if __has_builtin(__builtin_coro_noop)
+struct noop_coroutine_promise {};
+
+template <>
+class _LIBCPP_TEMPLATE_VIS coroutine_handle<noop_coroutine_promise>
+    : public coroutine_handle<> {
+  using _Base = coroutine_handle<>;
+  using _Promise = noop_coroutine_promise;
+public:
+
+  _LIBCPP_INLINE_VISIBILITY
+  _Promise& promise() const {
+    return *static_cast<_Promise*>(
+      __builtin_coro_promise(this->__handle_, _LIBCPP_ALIGNOF(_Promise), false));
+  }
+
+  _LIBCPP_CONSTEXPR explicit operator bool() const _NOEXCEPT { return true; }
+  _LIBCPP_CONSTEXPR bool done() const _NOEXCEPT { return false; }
+
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 void operator()() const _NOEXCEPT {}
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 void resume() const _NOEXCEPT {}
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 void destroy() const _NOEXCEPT {}
+
+private:
+  _LIBCPP_INLINE_VISIBILITY
+  friend coroutine_handle<noop_coroutine_promise> noop_coroutine() _NOEXCEPT;
+
+  _LIBCPP_INLINE_VISIBILITY coroutine_handle() _NOEXCEPT {
+    this->__handle_ = __builtin_coro_noop();
+  }
+};
+
+using noop_coroutine_handle = coroutine_handle<noop_coroutine_promise>;
+
+inline _LIBCPP_INLINE_VISIBILITY
+noop_coroutine_handle noop_coroutine() _NOEXCEPT {
+  return noop_coroutine_handle();
+}
+#endif // __has_builtin(__builtin_coro_noop)
+
+struct suspend_never {
+  _LIBCPP_INLINE_VISIBILITY
+  bool await_ready() const _NOEXCEPT { return true; }
+  _LIBCPP_INLINE_VISIBILITY
+  void await_suspend(coroutine_handle<>) const _NOEXCEPT {}
+  _LIBCPP_INLINE_VISIBILITY
+  void await_resume() const _NOEXCEPT {}
+};
+
+struct suspend_always {
+  _LIBCPP_INLINE_VISIBILITY
+  bool await_ready() const _NOEXCEPT { return false; }
+  _LIBCPP_INLINE_VISIBILITY
+  void await_suspend(coroutine_handle<>) const _NOEXCEPT {}
+  _LIBCPP_INLINE_VISIBILITY
+  void await_resume() const _NOEXCEPT {}
+};
+
+_LIBCPP_END_NAMESPACE_EXPERIMENTAL_COROUTINES
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct hash<_VSTD_CORO::coroutine_handle<_Tp> > {
+    using __arg_type = _VSTD_CORO::coroutine_handle<_Tp>;
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(__arg_type const& __v) const _NOEXCEPT
+    {return hash<void*>()(__v.address());}
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // !defined(_LIBCPP_HAS_NO_EXPERIMENTAL_COROUTINES)
+
+#endif /* _LIBCPP_EXPERIMENTAL_COROUTINE */
diff --git a/app/src/main/cpp/libcxx/include/experimental/deque b/app/src/main/cpp/libcxx/include/experimental/deque
new file mode 100644
index 0000000..46962af
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/deque
@@ -0,0 +1,52 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_DEQUE
+#define _LIBCPP_EXPERIMENTAL_DEQUE
+
+/*
+    experimental/deque synopsis
+
+// C++1z
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+namespace pmr {
+
+  template <class T>
+  using deque = std::deque<T,polymorphic_allocator<T>>;
+
+} // namespace pmr
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <deque>
+#include <experimental/__config>
+#include <experimental/memory_resource>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _ValueT>
+using deque = _VSTD::deque<_ValueT, polymorphic_allocator<_ValueT>>;
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_LFTS_PMR
+
+#endif /* _LIBCPP_EXPERIMENTAL_DEQUE */
diff --git a/app/src/main/cpp/libcxx/include/experimental/forward_list b/app/src/main/cpp/libcxx/include/experimental/forward_list
new file mode 100644
index 0000000..5d2686d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/forward_list
@@ -0,0 +1,52 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_FORWARD_LIST
+#define _LIBCPP_EXPERIMENTAL_FORWARD_LIST
+
+/*
+    experimental/forward_list synopsis
+
+// C++1z
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+namespace pmr {
+
+  template <class T>
+  using forward_list = std::forward_list<T,polymorphic_allocator<T>>;
+
+} // namespace pmr
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <experimental/__config>
+#include <experimental/memory_resource>
+#include <forward_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _ValueT>
+using forward_list = _VSTD::forward_list<_ValueT, polymorphic_allocator<_ValueT>>;
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_LFTS_PMR
+
+#endif /* _LIBCPP_EXPERIMENTAL_FORWARD_LIST */
diff --git a/app/src/main/cpp/libcxx/include/experimental/functional b/app/src/main/cpp/libcxx/include/experimental/functional
new file mode 100644
index 0000000..cb9a5ef
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/functional
@@ -0,0 +1,436 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_FUNCTIONAL
+#define _LIBCPP_EXPERIMENTAL_FUNCTIONAL
+
+/*
+   experimental/functional synopsis
+
+#include <algorithm>
+
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+    // 4.3, Searchers
+    template<class ForwardIterator, class BinaryPredicate = equal_to<>>
+      class default_searcher;
+
+    template<class RandomAccessIterator,
+             class Hash = hash<typename iterator_traits<RandomAccessIterator>::value_type>,
+             class BinaryPredicate = equal_to<>>
+      class boyer_moore_searcher;
+
+    template<class RandomAccessIterator,
+             class Hash = hash<typename iterator_traits<RandomAccessIterator>::value_type>,
+             class BinaryPredicate = equal_to<>>
+      class boyer_moore_horspool_searcher;
+
+    template<class ForwardIterator, class BinaryPredicate = equal_to<>>
+    default_searcher<ForwardIterator, BinaryPredicate>
+    make_default_searcher(ForwardIterator pat_first, ForwardIterator pat_last,
+                          BinaryPredicate pred = BinaryPredicate());
+
+    template<class RandomAccessIterator,
+             class Hash = hash<typename iterator_traits<RandomAccessIterator>::value_type>,
+             class BinaryPredicate = equal_to<>>
+    boyer_moore_searcher<RandomAccessIterator, Hash, BinaryPredicate>
+    make_boyer_moore_searcher(
+        RandomAccessIterator pat_first, RandomAccessIterator pat_last,
+        Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());
+
+    template<class RandomAccessIterator,
+             class Hash = hash<typename iterator_traits<RandomAccessIterator>::value_type>,
+             class BinaryPredicate = equal_to<>>
+    boyer_moore_horspool_searcher<RandomAccessIterator, Hash, BinaryPredicate>
+    make_boyer_moore_horspool_searcher(
+        RandomAccessIterator pat_first, RandomAccessIterator pat_last,
+        Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());
+
+  } // namespace fundamentals_v1
+  } // namespace experimental
+
+} // namespace std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__debug>
+#include <__functional/identity.h>
+#include <__memory/uses_allocator.h>
+#include <array>
+#include <experimental/__config>
+#include <functional>
+#include <type_traits>
+#include <unordered_map>
+#include <vector>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS
+
+#ifdef _LIBCPP_NO_EXPERIMENTAL_DEPRECATION_WARNING_SEARCHERS
+#  define _LIBCPP_DEPRECATED_DEFAULT_SEARCHER
+#  define _LIBCPP_DEPRECATED_BOYER_MOORE_SEARCHER
+#  define _LIBCPP_DEPRECATED_BOYER_MOORE_HORSPOOL_SEARCHER
+#else
+#  define _LIBCPP_DEPRECATED_DEFAULT_SEARCHER _LIBCPP_DEPRECATED_("std::experimental::default_searcher will be removed in LLVM 17. Use std::default_searcher instead")
+#  define _LIBCPP_DEPRECATED_BOYER_MOORE_SEARCHER _LIBCPP_DEPRECATED_("std::experimental::boyer_moore_searcher will be removed in LLVM 17. Use std::boyer_moore_searcher instead")
+#  define _LIBCPP_DEPRECATED_BOYER_MOORE_HORSPOOL_SEARCHER _LIBCPP_DEPRECATED_("std::experimental::boyer_moore_horspool_searcher will be removed in LLVM 17. Use std::boyer_moore_horspool_searcher instead")
+#endif
+
+#if _LIBCPP_STD_VER > 11
+// default searcher
+template<class _ForwardIterator, class _BinaryPredicate = equal_to<>>
+class _LIBCPP_DEPRECATED_DEFAULT_SEARCHER _LIBCPP_TEMPLATE_VIS default_searcher {
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    default_searcher(_ForwardIterator __f, _ForwardIterator __l,
+                       _BinaryPredicate __p = _BinaryPredicate())
+        : __first_(__f), __last_(__l), __pred_(__p) {}
+
+    template <typename _ForwardIterator2>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<_ForwardIterator2, _ForwardIterator2>
+    operator () (_ForwardIterator2 __f, _ForwardIterator2 __l) const
+    {
+        auto __proj = __identity();
+        return std::__search_impl(__f, __l, __first_, __last_, __pred_, __proj, __proj);
+    }
+
+private:
+    _ForwardIterator __first_;
+    _ForwardIterator __last_;
+    _BinaryPredicate __pred_;
+    };
+
+template<class _ForwardIterator, class _BinaryPredicate = equal_to<>>
+_LIBCPP_DEPRECATED_DEFAULT_SEARCHER _LIBCPP_INLINE_VISIBILITY
+default_searcher<_ForwardIterator, _BinaryPredicate>
+make_default_searcher( _ForwardIterator __f, _ForwardIterator __l, _BinaryPredicate __p = _BinaryPredicate ())
+{
+    return default_searcher<_ForwardIterator, _BinaryPredicate>(__f, __l, __p);
+}
+
+template<class _Key, class _Value, class _Hash, class _BinaryPredicate, bool /*useArray*/> class _BMSkipTable;
+
+//  General case for BM data searching; use a map
+template<class _Key, typename _Value, class _Hash, class _BinaryPredicate>
+class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, false> {
+    typedef _Value value_type;
+    typedef _Key   key_type;
+
+    const _Value __default_value_;
+    std::unordered_map<_Key, _Value, _Hash, _BinaryPredicate> __table_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    _BMSkipTable(size_t __sz, _Value __default, _Hash __hf, _BinaryPredicate __pred)
+        : __default_value_(__default), __table_(__sz, __hf, __pred) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void insert(const key_type &__key, value_type __val)
+    {
+        __table_ [__key] = __val;    // Would skip_.insert (val) be better here?
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    value_type operator [](const key_type & __key) const
+    {
+        auto __it = __table_.find (__key);
+        return __it == __table_.end() ? __default_value_ : __it->second;
+    }
+};
+
+
+//  Special case small numeric values; use an array
+template<class _Key, typename _Value, class _Hash, class _BinaryPredicate>
+class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, true> {
+private:
+    typedef _Value value_type;
+    typedef _Key   key_type;
+
+    typedef __make_unsigned_t<key_type> unsigned_key_type;
+    typedef std::array<value_type, 256> skip_map;
+    skip_map __table_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    _BMSkipTable(size_t /*__sz*/, _Value __default, _Hash /*__hf*/, _BinaryPredicate /*__pred*/)
+    {
+        std::fill_n(__table_.begin(), __table_.size(), __default);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void insert(key_type __key, value_type __val)
+    {
+        __table_[static_cast<unsigned_key_type>(__key)] = __val;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    value_type operator [](key_type __key) const
+    {
+        return __table_[static_cast<unsigned_key_type>(__key)];
+    }
+};
+
+
+template <class _RandomAccessIterator1,
+          class _Hash = hash<typename iterator_traits<_RandomAccessIterator1>::value_type>,
+          class _BinaryPredicate = equal_to<>>
+class _LIBCPP_DEPRECATED_BOYER_MOORE_SEARCHER _LIBCPP_TEMPLATE_VIS boyer_moore_searcher {
+private:
+    typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type difference_type;
+    typedef typename std::iterator_traits<_RandomAccessIterator1>::value_type      value_type;
+    typedef _BMSkipTable<value_type, difference_type, _Hash, _BinaryPredicate,
+                    is_integral<value_type>::value && // what about enums?
+                    sizeof(value_type) == 1 &&
+                    is_same<_Hash, hash<value_type>>::value &&
+                    is_same<_BinaryPredicate, equal_to<>>::value
+            > skip_table_type;
+
+public:
+    boyer_moore_searcher(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l,
+                _Hash __hf = _Hash(), _BinaryPredicate __pred = _BinaryPredicate())
+            : __first_(__f), __last_(__l), __pred_(__pred),
+              __pattern_length_(_VSTD::distance(__first_, __last_)),
+              __skip_{std::make_shared<skip_table_type>(__pattern_length_, -1, __hf, __pred_)},
+              __suffix_{std::make_shared<vector<difference_type>>(__pattern_length_ + 1)}
+        {
+    //  build the skip table
+        for ( difference_type __i = 0; __f != __l; ++__f, (void) ++__i )
+            __skip_->insert(*__f, __i);
+
+        this->__build_suffix_table ( __first_, __last_, __pred_ );
+        }
+
+    template <typename _RandomAccessIterator2>
+    pair<_RandomAccessIterator2, _RandomAccessIterator2>
+    operator ()(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const
+    {
+        static_assert(__is_same_uncvref<typename iterator_traits<_RandomAccessIterator1>::value_type,
+                                        typename iterator_traits<_RandomAccessIterator2>::value_type>::value,
+                      "Corpus and Pattern iterators must point to the same type");
+
+        if (__f      == __l )    return std::make_pair(__l, __l); // empty corpus
+        if (__first_ == __last_) return std::make_pair(__f, __f); // empty pattern
+
+    //  If the pattern is larger than the corpus, we can't find it!
+        if ( __pattern_length_ > _VSTD::distance(__f, __l))
+            return std::make_pair(__l, __l);
+
+    //  Do the search
+        return this->__search(__f, __l);
+    }
+
+private:
+    _RandomAccessIterator1               __first_;
+    _RandomAccessIterator1               __last_;
+    _BinaryPredicate                     __pred_;
+    difference_type                      __pattern_length_;
+    shared_ptr<skip_table_type>          __skip_;
+    shared_ptr<vector<difference_type>>  __suffix_;
+
+    template <typename _RandomAccessIterator2>
+    pair<_RandomAccessIterator2, _RandomAccessIterator2>
+    __search(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const
+    {
+        _RandomAccessIterator2 __cur = __f;
+        const _RandomAccessIterator2 __last = __l - __pattern_length_;
+        const skip_table_type &         __skip   = *__skip_.get();
+        const vector<difference_type> & __suffix = *__suffix_.get();
+
+        while (__cur <= __last)
+        {
+
+        //  Do we match right where we are?
+            difference_type __j = __pattern_length_;
+            while (__pred_(__first_ [__j-1], __cur [__j-1])) {
+                __j--;
+            //  We matched - we're done!
+                if ( __j == 0 )
+                    return std::make_pair(__cur, __cur + __pattern_length_);
+                }
+
+        //  Since we didn't match, figure out how far to skip forward
+            difference_type __k = __skip[__cur [ __j - 1 ]];
+            difference_type __m = __j - __k - 1;
+            if (__k < __j && __m > __suffix[ __j ])
+                __cur += __m;
+            else
+                __cur += __suffix[ __j ];
+        }
+
+        return std::make_pair(__l, __l);     // We didn't find anything
+    }
+
+
+    template<typename _Iterator, typename _Container>
+    void __compute_bm_prefix ( _Iterator __f, _Iterator __l, _BinaryPredicate __pred, _Container &__prefix )
+    {
+        const size_t __count = _VSTD::distance(__f, __l);
+
+        __prefix[0] = 0;
+        size_t __k = 0;
+        for ( size_t __i = 1; __i < __count; ++__i )
+        {
+            while ( __k > 0 && !__pred ( __f[__k], __f[__i] ))
+                __k = __prefix [ __k - 1 ];
+
+            if ( __pred ( __f[__k], __f[__i] ))
+                __k++;
+            __prefix [ __i ] = __k;
+        }
+    }
+
+    void __build_suffix_table(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l,
+                                                    _BinaryPredicate __pred)
+    {
+        const size_t __count = _VSTD::distance(__f, __l);
+        vector<difference_type> & __suffix = *__suffix_.get();
+        if (__count > 0)
+        {
+            vector<difference_type> __scratch(__count);
+
+            __compute_bm_prefix(__f, __l, __pred, __scratch);
+            for ( size_t __i = 0; __i <= __count; __i++ )
+                __suffix[__i] = __count - __scratch[__count-1];
+
+            typedef reverse_iterator<_RandomAccessIterator1> _RevIter;
+            __compute_bm_prefix(_RevIter(__l), _RevIter(__f), __pred, __scratch);
+
+            for ( size_t __i = 0; __i < __count; __i++ )
+            {
+                const size_t     __j = __count - __scratch[__i];
+                const difference_type __k = __i     - __scratch[__i] + 1;
+
+                if (__suffix[__j] > __k)
+                    __suffix[__j] = __k;
+            }
+        }
+    }
+
+};
+
+template<class _RandomAccessIterator,
+         class _Hash = hash<typename iterator_traits<_RandomAccessIterator>::value_type>,
+         class _BinaryPredicate = equal_to<>>
+_LIBCPP_DEPRECATED_BOYER_MOORE_SEARCHER _LIBCPP_INLINE_VISIBILITY
+boyer_moore_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>
+make_boyer_moore_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l,
+                    _Hash __hf = _Hash(), _BinaryPredicate __p = _BinaryPredicate ())
+{
+    return boyer_moore_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __hf, __p);
+}
+
+// boyer-moore-horspool
+template <class _RandomAccessIterator1,
+          class _Hash = hash<typename iterator_traits<_RandomAccessIterator1>::value_type>,
+          class _BinaryPredicate = equal_to<>>
+class _LIBCPP_DEPRECATED_BOYER_MOORE_HORSPOOL_SEARCHER _LIBCPP_TEMPLATE_VIS boyer_moore_horspool_searcher {
+private:
+    typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type difference_type;
+    typedef typename std::iterator_traits<_RandomAccessIterator1>::value_type      value_type;
+    typedef _BMSkipTable<value_type, difference_type, _Hash, _BinaryPredicate,
+                    is_integral<value_type>::value && // what about enums?
+                    sizeof(value_type) == 1 &&
+                    is_same<_Hash, hash<value_type>>::value &&
+                    is_same<_BinaryPredicate, equal_to<>>::value
+            > skip_table_type;
+
+public:
+    boyer_moore_horspool_searcher(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l,
+                _Hash __hf = _Hash(), _BinaryPredicate __pred = _BinaryPredicate())
+            : __first_(__f), __last_(__l), __pred_(__pred),
+              __pattern_length_(_VSTD::distance(__first_, __last_)),
+              __skip_{_VSTD::make_shared<skip_table_type>(__pattern_length_, __pattern_length_, __hf, __pred_)}
+        {
+    //  build the skip table
+            if ( __f != __l )
+            {
+                __l = __l - 1;
+                for ( difference_type __i = 0; __f != __l; ++__f, (void) ++__i )
+                    __skip_->insert(*__f, __pattern_length_ - 1 - __i);
+            }
+        }
+
+    template <typename _RandomAccessIterator2>
+    pair<_RandomAccessIterator2, _RandomAccessIterator2>
+    operator ()(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const
+    {
+        static_assert(__is_same_uncvref<typename std::iterator_traits<_RandomAccessIterator1>::value_type,
+                                        typename std::iterator_traits<_RandomAccessIterator2>::value_type>::value,
+                      "Corpus and Pattern iterators must point to the same type");
+
+        if (__f      == __l )    return std::make_pair(__l, __l); // empty corpus
+        if (__first_ == __last_) return std::make_pair(__f, __f); // empty pattern
+
+    //  If the pattern is larger than the corpus, we can't find it!
+        if ( __pattern_length_ > _VSTD::distance(__f, __l))
+            return std::make_pair(__l, __l);
+
+    //  Do the search
+        return this->__search(__f, __l);
+    }
+
+private:
+    _RandomAccessIterator1      __first_;
+    _RandomAccessIterator1      __last_;
+    _BinaryPredicate            __pred_;
+    difference_type             __pattern_length_;
+    shared_ptr<skip_table_type> __skip_;
+
+    template <typename _RandomAccessIterator2>
+    pair<_RandomAccessIterator2, _RandomAccessIterator2>
+    __search ( _RandomAccessIterator2 __f, _RandomAccessIterator2 __l ) const {
+        _RandomAccessIterator2 __cur = __f;
+        const _RandomAccessIterator2 __last = __l - __pattern_length_;
+        const skip_table_type & __skip = *__skip_.get();
+
+        while (__cur <= __last)
+        {
+        //  Do we match right where we are?
+            difference_type __j = __pattern_length_;
+            while (__pred_(__first_[__j-1], __cur[__j-1]))
+            {
+                __j--;
+            //  We matched - we're done!
+                if ( __j == 0 )
+                    return std::make_pair(__cur, __cur + __pattern_length_);
+            }
+            __cur += __skip[__cur[__pattern_length_-1]];
+        }
+
+        return std::make_pair(__l, __l);
+    }
+};
+
+template<class _RandomAccessIterator,
+         class _Hash = hash<typename iterator_traits<_RandomAccessIterator>::value_type>,
+         class _BinaryPredicate = equal_to<>>
+_LIBCPP_DEPRECATED_BOYER_MOORE_HORSPOOL_SEARCHER _LIBCPP_INLINE_VISIBILITY
+boyer_moore_horspool_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>
+make_boyer_moore_horspool_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l,
+                    _Hash __hf = _Hash(), _BinaryPredicate __p = _BinaryPredicate ())
+{
+    return boyer_moore_horspool_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __hf, __p);
+}
+
+#endif // _LIBCPP_STD_VER > 11
+
+_LIBCPP_END_NAMESPACE_LFTS
+
+_LIBCPP_POP_MACROS
+
+#endif /* _LIBCPP_EXPERIMENTAL_FUNCTIONAL */
diff --git a/app/src/main/cpp/libcxx/include/experimental/iterator b/app/src/main/cpp/libcxx/include/experimental/iterator
new file mode 100644
index 0000000..cf73b74
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/iterator
@@ -0,0 +1,126 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_ITERATOR
+#define _LIBCPP_EXPERIMENTAL_ITERATOR
+
+/*
+namespace std {
+  namespace experimental {
+    inline namespace fundamentals_v2 {
+
+    template <class DelimT, class charT = char, class traits = char_traits<charT>>
+        class ostream_joiner {
+        public:
+         typedef charT                        char_type;
+         typedef traits                       traits_type;
+         typedef basic_ostream<charT, traits> ostream_type;
+         typedef output_iterator_tag          iterator_category;
+         typedef void                         value_type;
+         typedef void                         difference_type;
+         typedef void                         pointer;
+         typedef void                         reference;
+
+         ostream_joiner(ostream_type& s, const DelimT& delimiter);
+         ostream_joiner(ostream_type& s, DelimT&& delimiter);
+
+         template<typename T>
+         ostream_joiner& operator=(const T& value);
+
+         ostream_joiner& operator*() noexcept;
+         ostream_joiner& operator++() noexcept;
+         ostream_joiner& operator++(int) noexcept;
+   private:
+      ostream_type* out_stream;   // exposition only
+      DelimT delim;               // exposition only
+      bool first_element;         // exposition only
+   };
+
+  template <class charT, class traits, class DelimT>
+    ostream_joiner<decay_t<DelimT>, charT, traits>
+    make_ostream_joiner(basic_ostream<charT, traits>& os, DelimT&& delimiter);
+
+    } // inline namespace fundamentals_v2
+  } // namespace experimental
+} // namespace std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__memory/addressof.h>
+#include <__type_traits/decay.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <experimental/__config>
+#include <iosfwd> // char_traits
+#include <iterator>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 11
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS
+
+template <class _Delim, class _CharT = char, class _Traits = char_traits<_CharT>>
+class ostream_joiner {
+public:
+
+    typedef _CharT                               char_type;
+    typedef _Traits                              traits_type;
+    typedef basic_ostream<char_type,traits_type> ostream_type;
+    typedef output_iterator_tag                  iterator_category;
+    typedef void                                 value_type;
+    typedef void                                 difference_type;
+    typedef void                                 pointer;
+    typedef void                                 reference;
+
+    ostream_joiner(ostream_type& __os, _Delim&& __d)
+        : __output_iter_(_VSTD::addressof(__os)), __delim_(_VSTD::move(__d)), __first_(true) {}
+
+    ostream_joiner(ostream_type& __os, const _Delim& __d)
+        : __output_iter_(_VSTD::addressof(__os)), __delim_(__d), __first_(true) {}
+
+
+    template<typename _Tp>
+    ostream_joiner& operator=(const _Tp& __v)
+    {
+        if (!__first_)
+            *__output_iter_ << __delim_;
+        __first_ = false;
+        *__output_iter_ << __v;
+        return *this;
+    }
+
+    ostream_joiner& operator*()     _NOEXCEPT { return *this; }
+    ostream_joiner& operator++()    _NOEXCEPT { return *this; }
+    ostream_joiner& operator++(int) _NOEXCEPT { return *this; }
+
+private:
+    ostream_type*   __output_iter_;
+    _Delim          __delim_;
+    bool            __first_;
+};
+
+
+template <class _CharT, class _Traits, class _Delim>
+_LIBCPP_HIDE_FROM_ABI ostream_joiner<typename decay<_Delim>::type, _CharT, _Traits>
+make_ostream_joiner(basic_ostream<_CharT, _Traits>& __os, _Delim && __d)
+{ return ostream_joiner<typename decay<_Delim>::type, _CharT, _Traits>(__os, _VSTD::forward<_Delim>(__d)); }
+
+_LIBCPP_END_NAMESPACE_LFTS
+
+#endif // _LIBCPP_STD_VER > 11
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_EXPERIMENTAL_ITERATOR
diff --git a/app/src/main/cpp/libcxx/include/experimental/list b/app/src/main/cpp/libcxx/include/experimental/list
new file mode 100644
index 0000000..06abe87
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/list
@@ -0,0 +1,52 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_LIST
+#define _LIBCPP_EXPERIMENTAL_LIST
+
+/*
+    experimental/list synopsis
+
+// C++1z
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+namespace pmr {
+
+  template <class T>
+  using list = std::list<T,polymorphic_allocator<T>>;
+
+} // namespace pmr
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <experimental/__config>
+#include <experimental/memory_resource>
+#include <list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _ValueT>
+using list = _VSTD::list<_ValueT, polymorphic_allocator<_ValueT>>;
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_LFTS_PMR
+
+#endif /* _LIBCPP_EXPERIMENTAL_LIST */
diff --git a/app/src/main/cpp/libcxx/include/experimental/map b/app/src/main/cpp/libcxx/include/experimental/map
new file mode 100644
index 0000000..8ec94e4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/map
@@ -0,0 +1,62 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_MAP
+#define _LIBCPP_EXPERIMENTAL_MAP
+
+/*
+    experimental/map synopsis
+
+// C++1z
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+namespace pmr {
+
+  template <class Key, class T, class Compare = less<Key>>
+  using map = std::map<Key, T, Compare,
+                       polymorphic_allocator<pair<const Key,T>>>;
+
+  template <class Key, class T, class Compare = less<Key>>
+  using multimap = std::multimap<Key, T, Compare,
+                                 polymorphic_allocator<pair<const Key,T>>>;
+
+} // namespace pmr
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <experimental/__config>
+#include <experimental/memory_resource>
+#include <map>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Value, class  _Compare = less<_Key>>
+using map = _VSTD::map<_Key, _Value, _Compare,
+                        polymorphic_allocator<pair<const _Key, _Value>>>;
+
+template <class _Key, class _Value, class  _Compare = less<_Key>>
+using multimap = _VSTD::multimap<_Key, _Value, _Compare,
+                        polymorphic_allocator<pair<const _Key, _Value>>>;
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_LFTS_PMR
+
+#endif /* _LIBCPP_EXPERIMENTAL_MAP */
diff --git a/app/src/main/cpp/libcxx/include/experimental/memory_resource b/app/src/main/cpp/libcxx/include/experimental/memory_resource
new file mode 100644
index 0000000..f107f10
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/memory_resource
@@ -0,0 +1,443 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_MEMORY_RESOURCE
+#define _LIBCPP_EXPERIMENTAL_MEMORY_RESOURCE
+
+/**
+    experimental/memory_resource synopsis
+
+// C++1y
+
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+namespace pmr {
+
+  class memory_resource;
+
+  bool operator==(const memory_resource& a,
+                  const memory_resource& b) noexcept;
+  bool operator!=(const memory_resource& a,
+                  const memory_resource& b) noexcept;
+
+  template <class Tp> class polymorphic_allocator;
+
+  template <class T1, class T2>
+  bool operator==(const polymorphic_allocator<T1>& a,
+                  const polymorphic_allocator<T2>& b) noexcept;
+  template <class T1, class T2>
+  bool operator!=(const polymorphic_allocator<T1>& a,
+                  const polymorphic_allocator<T2>& b) noexcept;
+
+  // The name resource_adaptor_imp is for exposition only.
+  template <class Allocator> class resource_adaptor_imp;
+
+  template <class Allocator>
+    using resource_adaptor = resource_adaptor_imp<
+      allocator_traits<Allocator>::rebind_alloc<char>>;
+
+  // Global memory resources
+  memory_resource* new_delete_resource() noexcept;
+  memory_resource* null_memory_resource() noexcept;
+
+  // The default memory resource
+  memory_resource* set_default_resource(memory_resource* r) noexcept;
+  memory_resource* get_default_resource() noexcept;
+
+  // Standard memory resources
+  struct pool_options;
+  class synchronized_pool_resource;
+  class unsynchronized_pool_resource;
+  class monotonic_buffer_resource;
+
+} // namespace pmr
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__memory/allocator_traits.h>
+#include <__utility/move.h>
+#include <cstddef>
+#include <cstdlib>
+#include <experimental/__config>
+#include <experimental/__memory>
+#include <limits>
+#include <new>
+#include <stdexcept>
+#include <tuple>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR
+
+#define _LIBCPP_DEPCREATED_MEMORY_RESOURCE(name)                                                                       \
+  _LIBCPP_DEPRECATED_("'std::experimental::pmr::" name                                                                 \
+                      "' is deprecated and will be removed in LLVM 18. Use 'std::pmr::" name "' instead.")
+
+#ifndef _LIBCPP_CXX03_LANG
+
+// Round __s up to next multiple of __a.
+inline _LIBCPP_INLINE_VISIBILITY
+size_t __aligned_allocation_size(size_t __s, size_t __a) _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__s + __a > __s, "aligned allocation size overflows");
+    return (__s + __a - 1) & ~(__a - 1);
+}
+
+// 8.5, memory.resource
+class _LIBCPP_DEPCREATED_MEMORY_RESOURCE("memory_resource") _LIBCPP_TYPE_VIS memory_resource
+{
+    static const size_t __max_align = _LIBCPP_ALIGNOF(max_align_t);
+
+// 8.5.2, memory.resource.public
+public:
+    virtual ~memory_resource() = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void* allocate(size_t __bytes, size_t __align = __max_align)
+        { return do_allocate(__bytes, __align); }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void deallocate(void * __p, size_t __bytes, size_t __align = __max_align)
+        { do_deallocate(__p, __bytes, __align); }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool is_equal(memory_resource const & __other) const _NOEXCEPT
+        { return do_is_equal(__other); }
+
+// 8.5.3, memory.resource.priv
+private:
+    virtual void* do_allocate(size_t, size_t) = 0;
+    virtual void do_deallocate(void*, size_t, size_t) = 0;
+    virtual bool do_is_equal(memory_resource const &) const _NOEXCEPT = 0;
+};
+
+// 8.5.4, memory.resource.eq
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("operator==(memory_resource, memory_resource)") inline _LIBCPP_INLINE_VISIBILITY
+bool operator==(memory_resource const & __lhs,
+                memory_resource const & __rhs) _NOEXCEPT
+{
+    return &__lhs == &__rhs || __lhs.is_equal(__rhs);
+}
+
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("operator!=(memory_resource, memory_resource)") inline _LIBCPP_INLINE_VISIBILITY
+bool operator!=(memory_resource const & __lhs,
+                memory_resource const & __rhs) _NOEXCEPT
+{
+    return !(__lhs == __rhs);
+}
+
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("new_delete_resource()") _LIBCPP_FUNC_VIS
+memory_resource * new_delete_resource() _NOEXCEPT;
+
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("null_memory_resource()") _LIBCPP_FUNC_VIS
+memory_resource * null_memory_resource() _NOEXCEPT;
+
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("get_default_resource()") _LIBCPP_FUNC_VIS
+memory_resource * get_default_resource() _NOEXCEPT;
+
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("set_default_resource()") _LIBCPP_FUNC_VIS
+memory_resource * set_default_resource(memory_resource * __new_res) _NOEXCEPT;
+
+// 8.6, memory.polymorphic.allocator.class
+
+// 8.6.1, memory.polymorphic.allocator.overview
+template <class _ValueType>
+class _LIBCPP_DEPCREATED_MEMORY_RESOURCE("polymorphic_allocator") _LIBCPP_TEMPLATE_VIS polymorphic_allocator
+{
+public:
+    typedef _ValueType value_type;
+
+    // 8.6.2, memory.polymorphic.allocator.ctor
+    _LIBCPP_INLINE_VISIBILITY
+    polymorphic_allocator() _NOEXCEPT
+      : __res_(_VSTD_LFTS_PMR::get_default_resource())
+    {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    polymorphic_allocator(memory_resource * __r) _NOEXCEPT
+      : __res_(__r)
+    {}
+
+    polymorphic_allocator(polymorphic_allocator const &) = default;
+
+    template <class _Tp>
+    _LIBCPP_INLINE_VISIBILITY
+    polymorphic_allocator(polymorphic_allocator<_Tp> const & __other) _NOEXCEPT
+      : __res_(__other.resource())
+    {}
+
+    polymorphic_allocator &
+    operator=(polymorphic_allocator const &) = delete;
+
+    // 8.6.3, memory.polymorphic.allocator.mem
+    _LIBCPP_INLINE_VISIBILITY
+    _ValueType* allocate(size_t __n) {
+        if (__n > __max_size())
+            __throw_bad_array_new_length();
+        return static_cast<_ValueType*>(
+            __res_->allocate(__n * sizeof(_ValueType), _LIBCPP_ALIGNOF(_ValueType))
+        );
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void deallocate(_ValueType * __p, size_t __n) _NOEXCEPT {
+        _LIBCPP_ASSERT(__n <= __max_size(),
+                       "deallocate called for size which exceeds max_size()");
+        __res_->deallocate(__p, __n * sizeof(_ValueType), _LIBCPP_ALIGNOF(_ValueType));
+    }
+
+    template <class _Tp, class ..._Ts>
+    _LIBCPP_INLINE_VISIBILITY
+    void construct(_Tp* __p, _Ts &&... __args)
+    {
+        _VSTD_LFTS::__lfts_user_alloc_construct(
+            __p, *this, _VSTD::forward<_Ts>(__args)...
+          );
+    }
+
+    template <class _T1, class _T2, class ..._Args1, class ..._Args2>
+    _LIBCPP_INLINE_VISIBILITY
+    void construct(pair<_T1, _T2>* __p, piecewise_construct_t,
+                   tuple<_Args1...> __x, tuple<_Args2...> __y)
+    {
+        ::new ((void*)__p) pair<_T1, _T2>(piecewise_construct
+          , __transform_tuple(
+              typename __lfts_uses_alloc_ctor<
+                  _T1, polymorphic_allocator&, _Args1...
+              >::type()
+            , _VSTD::move(__x)
+            , typename __make_tuple_indices<sizeof...(_Args1)>::type{}
+          )
+          , __transform_tuple(
+              typename __lfts_uses_alloc_ctor<
+                  _T2, polymorphic_allocator&, _Args2...
+              >::type()
+            , _VSTD::move(__y)
+            , typename __make_tuple_indices<sizeof...(_Args2)>::type{}
+          )
+        );
+    }
+
+    template <class _T1, class _T2>
+    _LIBCPP_INLINE_VISIBILITY
+    void construct(pair<_T1, _T2>* __p) {
+        construct(__p, piecewise_construct, tuple<>(), tuple<>());
+    }
+
+    template <class _T1, class _T2, class _Up, class _Vp>
+    _LIBCPP_INLINE_VISIBILITY
+    void construct(pair<_T1, _T2> * __p, _Up && __u, _Vp && __v) {
+        construct(__p, piecewise_construct
+          , _VSTD::forward_as_tuple(_VSTD::forward<_Up>(__u))
+          , _VSTD::forward_as_tuple(_VSTD::forward<_Vp>(__v)));
+    }
+
+    template <class _T1, class _T2, class _U1, class _U2>
+    _LIBCPP_INLINE_VISIBILITY
+    void construct(pair<_T1, _T2> * __p, pair<_U1, _U2> const & __pr) {
+        construct(__p, piecewise_construct
+            , _VSTD::forward_as_tuple(__pr.first)
+            , _VSTD::forward_as_tuple(__pr.second));
+    }
+
+    template <class _T1, class _T2, class _U1, class _U2>
+    _LIBCPP_INLINE_VISIBILITY
+    void construct(pair<_T1, _T2> * __p, pair<_U1, _U2> && __pr){
+        construct(__p, piecewise_construct
+            , _VSTD::forward_as_tuple(_VSTD::forward<_U1>(__pr.first))
+            , _VSTD::forward_as_tuple(_VSTD::forward<_U2>(__pr.second)));
+    }
+
+    template <class _Tp>
+    _LIBCPP_INLINE_VISIBILITY
+    void destroy(_Tp * __p) _NOEXCEPT
+        { __p->~_Tp(); }
+
+    _LIBCPP_INLINE_VISIBILITY
+    polymorphic_allocator
+    select_on_container_copy_construction() const _NOEXCEPT
+        { return polymorphic_allocator(); }
+
+    _LIBCPP_INLINE_VISIBILITY
+    memory_resource * resource() const _NOEXCEPT
+        { return __res_; }
+
+private:
+    template <class ..._Args, size_t ..._Idx>
+    _LIBCPP_INLINE_VISIBILITY
+    tuple<_Args&&...>
+    __transform_tuple(integral_constant<int, 0>, tuple<_Args...>&& __t,
+                      __tuple_indices<_Idx...>) const
+    {
+        return _VSTD::forward_as_tuple(_VSTD::get<_Idx>(_VSTD::move(__t))...);
+    }
+
+    template <class ..._Args, size_t ..._Idx>
+    _LIBCPP_INLINE_VISIBILITY
+    tuple<allocator_arg_t const&, polymorphic_allocator&, _Args&&...>
+    __transform_tuple(integral_constant<int, 1>, tuple<_Args...> && __t,
+                      __tuple_indices<_Idx...>)
+    {
+        using _Tup = tuple<allocator_arg_t const&, polymorphic_allocator&, _Args&&...>;
+        return _Tup(allocator_arg, *this,
+                    _VSTD::get<_Idx>(_VSTD::move(__t))...);
+    }
+
+    template <class ..._Args, size_t ..._Idx>
+    _LIBCPP_INLINE_VISIBILITY
+    tuple<_Args&&..., polymorphic_allocator&>
+    __transform_tuple(integral_constant<int, 2>, tuple<_Args...> && __t,
+                      __tuple_indices<_Idx...>)
+    {
+        using _Tup = tuple<_Args&&..., polymorphic_allocator&>;
+        return _Tup(_VSTD::get<_Idx>(_VSTD::move(__t))..., *this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t __max_size() const _NOEXCEPT
+        { return numeric_limits<size_t>::max() / sizeof(value_type); }
+
+    memory_resource * __res_;
+};
+
+// 8.6.4, memory.polymorphic.allocator.eq
+
+template <class _Tp, class _Up>
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("operator==(const polymorphic_allocator&, const polymorphic_allocator&)")
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator==(polymorphic_allocator<_Tp> const & __lhs,
+                polymorphic_allocator<_Up> const & __rhs) _NOEXCEPT
+{
+    return *__lhs.resource() == *__rhs.resource();
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("operator!=(const polymorphic_allocator&, const polymorphic_allocator&)")
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator!=(polymorphic_allocator<_Tp> const & __lhs,
+                polymorphic_allocator<_Up> const & __rhs) _NOEXCEPT
+{
+    return !(__lhs == __rhs);
+}
+
+// 8.7, memory.resource.adaptor
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+// 8.7.1, memory.resource.adaptor.overview
+template <class _CharAlloc>
+class _LIBCPP_TEMPLATE_VIS __resource_adaptor_imp
+  : public memory_resource
+{
+    using _CTraits = allocator_traits<_CharAlloc>;
+    static_assert(is_same<typename _CTraits::value_type, char>::value
+               && is_same<typename _CTraits::pointer, char*>::value
+               && is_same<typename _CTraits::void_pointer, void*>::value, "");
+
+    static const size_t _MaxAlign = _LIBCPP_ALIGNOF(max_align_t);
+
+    using _Alloc = typename _CTraits::template rebind_alloc<
+            typename aligned_storage<_MaxAlign, _MaxAlign>::type
+        >;
+
+    using _ValueType = typename _Alloc::value_type;
+
+    _Alloc __alloc_;
+
+public:
+    typedef _CharAlloc allocator_type;
+
+    __resource_adaptor_imp() = default;
+    __resource_adaptor_imp(__resource_adaptor_imp const &) = default;
+    __resource_adaptor_imp(__resource_adaptor_imp &&) = default;
+
+    // 8.7.2, memory.resource.adaptor.ctor
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __resource_adaptor_imp(allocator_type const & __a)
+      : __alloc_(__a)
+    {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __resource_adaptor_imp(allocator_type && __a)
+      : __alloc_(_VSTD::move(__a))
+    {}
+
+    __resource_adaptor_imp &
+    operator=(__resource_adaptor_imp const &) = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const
+    { return __alloc_; }
+
+// 8.7.3, memory.resource.adaptor.mem
+private:
+    void * do_allocate(size_t __bytes, size_t) override
+    {
+        if (__bytes > __max_size())
+            __throw_bad_array_new_length();
+        size_t __s = __aligned_allocation_size(__bytes, _MaxAlign) / _MaxAlign;
+        return __alloc_.allocate(__s);
+    }
+
+    void do_deallocate(void * __p, size_t __bytes, size_t) override
+    {
+        _LIBCPP_ASSERT(__bytes <= __max_size(),
+            "do_deallocate called for size which exceeds the maximum allocation size");
+        size_t __s = __aligned_allocation_size(__bytes, _MaxAlign) / _MaxAlign;
+        __alloc_.deallocate((_ValueType*)__p, __s);
+    }
+
+    bool do_is_equal(memory_resource const & __other) const _NOEXCEPT override {
+        __resource_adaptor_imp const * __p
+          = dynamic_cast<__resource_adaptor_imp const *>(&__other);
+        return __p  ? __alloc_ == __p->__alloc_ : false;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t __max_size() const _NOEXCEPT {
+        return numeric_limits<size_t>::max() - _MaxAlign;
+    }
+};
+
+template <class _Alloc>
+using resource_adaptor = __resource_adaptor_imp<
+    typename allocator_traits<_Alloc>::template rebind_alloc<char>
+  >;
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_LFTS_PMR
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <atomic>
+#  include <climits>
+#  include <concepts>
+#  include <cstring>
+#  include <ctime>
+#  include <iterator>
+#  include <memory>
+#  include <ratio>
+#  include <variant>
+#endif
+
+#endif /* _LIBCPP_EXPERIMENTAL_MEMORY_RESOURCE */
diff --git a/app/src/main/cpp/libcxx/include/experimental/propagate_const b/app/src/main/cpp/libcxx/include/experimental/propagate_const
new file mode 100644
index 0000000..34e917d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/propagate_const
@@ -0,0 +1,581 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_PROPAGATE_CONST
+#define _LIBCPP_EXPERIMENTAL_PROPAGATE_CONST
+
+/*
+    propagate_const synopsis
+
+    namespace std { namespace experimental { inline namespace fundamentals_v2 {
+
+    // [propagate_const]
+    template <class T> class propagate_const;
+
+    // [propagate_const.underlying], underlying pointer access
+    constexpr const _Tp& _VSTD_LFTS_V2::get_underlying(const propagate_const<T>& pt) noexcept;
+    constexpr T& _VSTD_LFTS_V2::get_underlying(propagate_const<T>& pt) noexcept;
+
+    // [propagate_const.relational], relational operators
+    template <class T> constexpr bool operator==(const propagate_const<T>& pt, nullptr_t);
+    template <class T> constexpr bool operator==(nullptr_t, const propagate_const<T>& pu);
+    template <class T> constexpr bool operator!=(const propagate_const<T>& pt, nullptr_t);
+    template <class T> constexpr bool operator!=(nullptr_t, const propagate_const<T>& pu);
+    template <class T, class U> constexpr bool operator==(const propagate_const<T>& pt, const propagate_const<_Up>& pu);
+    template <class T, class U> constexpr bool operator!=(const propagate_const<T>& pt, const propagate_const<_Up>& pu);
+    template <class T, class U> constexpr bool operator<(const propagate_const<T>& pt, const propagate_const<_Up>& pu);
+    template <class T, class U> constexpr bool operator>(const propagate_const<T>& pt, const propagate_const<_Up>& pu);
+    template <class T, class U> constexpr bool operator<=(const propagate_const<T>& pt, const propagate_const<_Up>& pu);
+    template <class T, class U> constexpr bool operator>=(const propagate_const<T>& pt, const propagate_const<_Up>& pu);
+    template <class T, class U> constexpr bool operator==(const propagate_const<T>& pt, const _Up& u);
+    template <class T, class U> constexpr bool operator!=(const propagate_const<T>& pt, const _Up& u);
+    template <class T, class U> constexpr bool operator<(const propagate_const<T>& pt, const _Up& u);
+    template <class T, class U> constexpr bool operator>(const propagate_const<T>& pt, const _Up& u);
+    template <class T, class U> constexpr bool operator<=(const propagate_const<T>& pt, const _Up& u);
+    template <class T, class U> constexpr bool operator>=(const propagate_const<T>& pt, const _Up& u);
+    template <class T, class U> constexpr bool operator==(const _Tp& t, const propagate_const<_Up>& pu);
+    template <class T, class U> constexpr bool operator!=(const _Tp& t, const propagate_const<_Up>& pu);
+    template <class T, class U> constexpr bool operator<(const _Tp& t, const propagate_const<_Up>& pu);
+    template <class T, class U> constexpr bool operator>(const _Tp& t, const propagate_const<_Up>& pu);
+    template <class T, class U> constexpr bool operator<=(const _Tp& t, const propagate_const<_Up>& pu);
+    template <class T, class U> constexpr bool operator>=(const _Tp& t, const propagate_const<_Up>& pu);
+
+    // [propagate_const.algorithms], specialized algorithms
+    template <class T> constexpr void swap(propagate_const<T>& pt, propagate_const<T>& pu) noexcept(see below);
+
+    template <class T>
+    class propagate_const
+    {
+
+    public:
+      typedef remove_reference_t<decltype(*declval<T&>())> element_type;
+
+      // [propagate_const.ctor], constructors
+      constexpr propagate_const() = default;
+      propagate_const(const propagate_const& p) = delete;
+      constexpr propagate_const(propagate_const&& p) = default;
+      template <class U> EXPLICIT constexpr propagate_const(propagate_const<_Up>&& pu); // see below
+      template <class U> EXPLICIT constexpr propagate_const(U&& u); // see below
+
+      // [propagate_const.assignment], assignment
+      propagate_const& operator=(const propagate_const& p) = delete;
+      constexpr propagate_const& operator=(propagate_const&& p) = default;
+      template <class U> constexpr propagate_const& operator=(propagate_const<_Up>&& pu);
+      template <class U> constexpr propagate_const& operator=(U&& u); // see below
+
+      // [propagate_const.const_observers], const observers
+      explicit constexpr operator bool() const;
+      constexpr const element_type* operator->() const;
+      constexpr operator const element_type*() const; // Not always defined
+      constexpr const element_type& operator*() const;
+      constexpr const element_type* get() const;
+
+      // [propagate_const.non_const_observers], non-const observers
+      constexpr element_type* operator->();
+      constexpr operator element_type*(); // Not always defined
+      constexpr element_type& operator*();
+      constexpr element_type* get();
+
+      // [propagate_const.modifiers], modifiers
+      constexpr void swap(propagate_const& pt) noexcept(see below)
+
+    private:
+      T t_; // exposition only
+    };
+
+  } // namespace fundamentals_v2
+  } // namespace experimental
+
+  // [propagate_const.hash], hash support
+  template <class T> struct hash<experimental::fundamentals_v2::propagate_const<T>>;
+
+  // [propagate_const.comparison_function_objects], comparison function objects
+  template <class T> struct equal_to<experimental::fundamentals_v2::propagate_const<T>>;
+  template <class T> struct not_equal_to<experimental::fundamentals_v2::propagate_const<T>>;
+  template <class T> struct less<experimental::fundamentals_v2::propagate_const<T>>;
+  template <class T> struct greater<experimental::fundamentals_v2::propagate_const<T>>;
+  template <class T> struct less_equal<experimental::fundamentals_v2::propagate_const<T>>;
+  template <class T> struct greater_equal<experimental::fundamentals_v2::propagate_const<T>>;
+
+} // namespace std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__functional/operations.h>
+#include <__fwd/hash.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <experimental/__config>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if _LIBCPP_STD_VER > 11
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS_V2
+
+template <class _Tp>
+class propagate_const;
+
+template <class _Up>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+const _Up& get_underlying(const propagate_const<_Up>& __pu) _NOEXCEPT;
+
+template <class _Up>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+_Up& get_underlying(propagate_const<_Up>& __pu) _NOEXCEPT;
+
+template <class _Tp>
+class propagate_const
+{
+public:
+  typedef remove_reference_t<decltype(*std::declval<_Tp&>())> element_type;
+
+  static_assert(!is_array<_Tp>::value,
+      "Instantiation of propagate_const with an array type is ill-formed.");
+  static_assert(!is_reference<_Tp>::value,
+      "Instantiation of propagate_const with a reference type is ill-formed.");
+  static_assert(!(is_pointer<_Tp>::value && is_function<__remove_pointer_t<_Tp> >::value),
+      "Instantiation of propagate_const with a function-pointer type is ill-formed.");
+  static_assert(!(is_pointer<_Tp>::value && is_same<__remove_cv_t<__remove_pointer_t<_Tp> >, void>::value),
+      "Instantiation of propagate_const with a pointer to (possibly cv-qualified) void is ill-formed.");
+
+private:
+  template <class _Up>
+  static _LIBCPP_CONSTEXPR element_type* __get_pointer(_Up* __u)
+  {
+    return __u;
+  }
+
+  template <class _Up>
+  static _LIBCPP_CONSTEXPR element_type* __get_pointer(_Up& __u)
+  {
+    return __get_pointer(__u.get());
+  }
+
+  template <class _Up>
+  static _LIBCPP_CONSTEXPR const element_type* __get_pointer(const _Up* __u)
+  {
+    return __u;
+  }
+
+  template <class _Up>
+  static _LIBCPP_CONSTEXPR const element_type* __get_pointer(const _Up& __u)
+  {
+    return __get_pointer(__u.get());
+  }
+
+  template <class _Up>
+  struct __is_propagate_const : false_type
+  {
+  };
+
+  template <class _Up>
+  struct __is_propagate_const<propagate_const<_Up>> : true_type
+  {
+  };
+
+  _Tp __t_;
+
+public:
+
+  template <class _Up> friend _LIBCPP_CONSTEXPR const _Up& ::_VSTD_LFTS_V2::get_underlying(const propagate_const<_Up>& __pu) _NOEXCEPT;
+  template <class _Up> friend _LIBCPP_CONSTEXPR _Up& ::_VSTD_LFTS_V2::get_underlying(propagate_const<_Up>& __pu) _NOEXCEPT;
+
+  _LIBCPP_CONSTEXPR propagate_const() = default;
+
+  propagate_const(const propagate_const&) = delete;
+
+  _LIBCPP_CONSTEXPR propagate_const(propagate_const&&) = default;
+
+  template <class _Up, enable_if_t<!is_convertible<_Up, _Tp>::value &&
+                                 is_constructible<_Tp, _Up&&>::value,bool> = true>
+  explicit _LIBCPP_CONSTEXPR propagate_const(propagate_const<_Up>&& __pu)
+      : __t_(std::move(_VSTD_LFTS_V2::get_underlying(__pu)))
+  {
+  }
+
+  template <class _Up, enable_if_t<is_convertible<_Up&&, _Tp>::value &&
+                                 is_constructible<_Tp, _Up&&>::value,bool> = false>
+  _LIBCPP_CONSTEXPR propagate_const(propagate_const<_Up>&& __pu)
+      : __t_(std::move(_VSTD_LFTS_V2::get_underlying(__pu)))
+  {
+  }
+
+  template <class _Up, enable_if_t<!is_convertible<_Up&&, _Tp>::value &&
+                                 is_constructible<_Tp, _Up&&>::value &&
+                                 !__is_propagate_const<decay_t<_Up>>::value,bool> = true>
+  explicit _LIBCPP_CONSTEXPR propagate_const(_Up&& __u)
+      : __t_(std::forward<_Up>(__u))
+  {
+  }
+
+  template <class _Up, enable_if_t<is_convertible<_Up&&, _Tp>::value &&
+                                 is_constructible<_Tp, _Up&&>::value &&
+                                 !__is_propagate_const<decay_t<_Up>>::value,bool> = false>
+  _LIBCPP_CONSTEXPR propagate_const(_Up&& __u)
+      : __t_(std::forward<_Up>(__u))
+  {
+  }
+
+  propagate_const& operator=(const propagate_const&) = delete;
+
+  _LIBCPP_CONSTEXPR propagate_const& operator=(propagate_const&&) = default;
+
+  template <class _Up>
+  _LIBCPP_CONSTEXPR propagate_const& operator=(propagate_const<_Up>&& __pu)
+  {
+    __t_ = std::move(_VSTD_LFTS_V2::get_underlying(__pu));
+    return *this;
+  }
+
+  template <class _Up, class _Vp = enable_if_t<!__is_propagate_const<decay_t<_Up>>::value>>
+  _LIBCPP_CONSTEXPR propagate_const& operator=(_Up&& __u)
+  {
+    __t_ = std::forward<_Up>(__u);
+    return *this;
+  }
+
+  _LIBCPP_CONSTEXPR const element_type* get() const
+  {
+    return __get_pointer(__t_);
+  }
+
+  _LIBCPP_CONSTEXPR element_type* get()
+  {
+    return __get_pointer(__t_);
+  }
+
+  explicit _LIBCPP_CONSTEXPR operator bool() const
+  {
+    return get() != nullptr;
+  }
+
+  _LIBCPP_CONSTEXPR const element_type* operator->() const
+  {
+    return get();
+  }
+
+  template <class _Tp_ = _Tp, class _Up = enable_if_t<is_convertible<
+                                  const _Tp_, const element_type *>::value>>
+  _LIBCPP_CONSTEXPR operator const element_type *() const {
+    return get();
+  }
+
+  _LIBCPP_CONSTEXPR const element_type& operator*() const
+  {
+    return *get();
+  }
+
+  _LIBCPP_CONSTEXPR element_type* operator->()
+  {
+    return get();
+  }
+
+  template <class _Tp_ = _Tp, class _Up = enable_if_t<
+                                  is_convertible<_Tp_, element_type *>::value>>
+  _LIBCPP_CONSTEXPR operator element_type *() {
+    return get();
+  }
+
+  _LIBCPP_CONSTEXPR element_type& operator*()
+  {
+    return *get();
+  }
+
+  _LIBCPP_CONSTEXPR void swap(propagate_const& __pt) _NOEXCEPT_(__is_nothrow_swappable<_Tp>::value)
+  {
+    using _VSTD::swap;
+    swap(__t_, __pt.__t_);
+  }
+};
+
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator==(const propagate_const<_Tp>& __pt, nullptr_t)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) == nullptr;
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator==(nullptr_t, const propagate_const<_Tp>& __pt)
+{
+  return nullptr == _VSTD_LFTS_V2::get_underlying(__pt);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator!=(const propagate_const<_Tp>& __pt, nullptr_t)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) != nullptr;
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator!=(nullptr_t, const propagate_const<_Tp>& __pt)
+{
+  return nullptr != _VSTD_LFTS_V2::get_underlying(__pt);
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator==(const propagate_const<_Tp>& __pt,
+                          const propagate_const<_Up>& __pu)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) == _VSTD_LFTS_V2::get_underlying(__pu);
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator!=(const propagate_const<_Tp>& __pt,
+                          const propagate_const<_Up>& __pu)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) != _VSTD_LFTS_V2::get_underlying(__pu);
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator<(const propagate_const<_Tp>& __pt,
+                         const propagate_const<_Up>& __pu)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) < _VSTD_LFTS_V2::get_underlying(__pu);
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator>(const propagate_const<_Tp>& __pt,
+                         const propagate_const<_Up>& __pu)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) > _VSTD_LFTS_V2::get_underlying(__pu);
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator<=(const propagate_const<_Tp>& __pt,
+                          const propagate_const<_Up>& __pu)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) <= _VSTD_LFTS_V2::get_underlying(__pu);
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator>=(const propagate_const<_Tp>& __pt,
+                          const propagate_const<_Up>& __pu)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) >= _VSTD_LFTS_V2::get_underlying(__pu);
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator==(const propagate_const<_Tp>& __pt, const _Up& __u)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) == __u;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator!=(const propagate_const<_Tp>& __pt, const _Up& __u)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) != __u;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator<(const propagate_const<_Tp>& __pt, const _Up& __u)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) < __u;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator>(const propagate_const<_Tp>& __pt, const _Up& __u)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) > __u;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator<=(const propagate_const<_Tp>& __pt, const _Up& __u)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) <= __u;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator>=(const propagate_const<_Tp>& __pt, const _Up& __u)
+{
+  return _VSTD_LFTS_V2::get_underlying(__pt) >= __u;
+}
+
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator==(const _Tp& __t, const propagate_const<_Up>& __pu)
+{
+  return __t == _VSTD_LFTS_V2::get_underlying(__pu);
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator!=(const _Tp& __t, const propagate_const<_Up>& __pu)
+{
+  return __t != _VSTD_LFTS_V2::get_underlying(__pu);
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator<(const _Tp& __t, const propagate_const<_Up>& __pu)
+{
+  return __t < _VSTD_LFTS_V2::get_underlying(__pu);
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator>(const _Tp& __t, const propagate_const<_Up>& __pu)
+{
+  return __t > _VSTD_LFTS_V2::get_underlying(__pu);
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator<=(const _Tp& __t, const propagate_const<_Up>& __pu)
+{
+  return __t <= _VSTD_LFTS_V2::get_underlying(__pu);
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR bool operator>=(const _Tp& __t, const propagate_const<_Up>& __pu)
+{
+  return __t >= _VSTD_LFTS_V2::get_underlying(__pu);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR void swap(propagate_const<_Tp>& __pc1, propagate_const<_Tp>& __pc2) _NOEXCEPT_(__is_nothrow_swappable<_Tp>::value)
+{
+  __pc1.swap(__pc2);
+}
+
+template <class _Tp>
+_LIBCPP_CONSTEXPR const _Tp& get_underlying(const propagate_const<_Tp>& __pt) _NOEXCEPT
+{
+  return __pt.__t_;
+}
+
+template <class _Tp>
+_LIBCPP_CONSTEXPR _Tp& get_underlying(propagate_const<_Tp>& __pt) _NOEXCEPT
+{
+  return __pt.__t_;
+}
+
+_LIBCPP_END_NAMESPACE_LFTS_V2
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp>
+struct hash<experimental::fundamentals_v2::propagate_const<_Tp>>
+{
+  typedef size_t result_type;
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> argument_type;
+
+  size_t operator()(const experimental::fundamentals_v2::propagate_const<_Tp>& __pc1) const
+  {
+    return std::hash<_Tp>()(_VSTD_LFTS_V2::get_underlying(__pc1));
+  }
+};
+
+template <class _Tp>
+struct equal_to<experimental::fundamentals_v2::propagate_const<_Tp>>
+{
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> first_argument_type;
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> second_argument_type;
+
+  bool operator()(const experimental::fundamentals_v2::propagate_const<_Tp>& __pc1,
+      const experimental::fundamentals_v2::propagate_const<_Tp>& __pc2) const
+  {
+    return std::equal_to<_Tp>()(_VSTD_LFTS_V2::get_underlying(__pc1), _VSTD_LFTS_V2::get_underlying(__pc2));
+  }
+};
+
+template <class _Tp>
+struct not_equal_to<experimental::fundamentals_v2::propagate_const<_Tp>>
+{
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> first_argument_type;
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> second_argument_type;
+
+  bool operator()(const experimental::fundamentals_v2::propagate_const<_Tp>& __pc1,
+      const experimental::fundamentals_v2::propagate_const<_Tp>& __pc2) const
+  {
+    return std::not_equal_to<_Tp>()(_VSTD_LFTS_V2::get_underlying(__pc1), _VSTD_LFTS_V2::get_underlying(__pc2));
+  }
+};
+
+template <class _Tp>
+struct less<experimental::fundamentals_v2::propagate_const<_Tp>>
+{
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> first_argument_type;
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> second_argument_type;
+
+  bool operator()(const experimental::fundamentals_v2::propagate_const<_Tp>& __pc1,
+      const experimental::fundamentals_v2::propagate_const<_Tp>& __pc2) const
+  {
+    return std::less<_Tp>()(_VSTD_LFTS_V2::get_underlying(__pc1), _VSTD_LFTS_V2::get_underlying(__pc2));
+  }
+};
+
+template <class _Tp>
+struct greater<experimental::fundamentals_v2::propagate_const<_Tp>>
+{
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> first_argument_type;
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> second_argument_type;
+
+  bool operator()(const experimental::fundamentals_v2::propagate_const<_Tp>& __pc1,
+      const experimental::fundamentals_v2::propagate_const<_Tp>& __pc2) const
+  {
+    return std::greater<_Tp>()(_VSTD_LFTS_V2::get_underlying(__pc1), _VSTD_LFTS_V2::get_underlying(__pc2));
+  }
+};
+
+template <class _Tp>
+struct less_equal<experimental::fundamentals_v2::propagate_const<_Tp>>
+{
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> first_argument_type;
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> second_argument_type;
+
+  bool operator()(const experimental::fundamentals_v2::propagate_const<_Tp>& __pc1,
+      const experimental::fundamentals_v2::propagate_const<_Tp>& __pc2) const
+  {
+    return std::less_equal<_Tp>()(_VSTD_LFTS_V2::get_underlying(__pc1), _VSTD_LFTS_V2::get_underlying(__pc2));
+  }
+};
+
+template <class _Tp>
+struct greater_equal<experimental::fundamentals_v2::propagate_const<_Tp>>
+{
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> first_argument_type;
+  typedef experimental::fundamentals_v2::propagate_const<_Tp> second_argument_type;
+
+  bool operator()(const experimental::fundamentals_v2::propagate_const<_Tp>& __pc1,
+      const experimental::fundamentals_v2::propagate_const<_Tp>& __pc2) const
+  {
+    return std::greater_equal<_Tp>()(_VSTD_LFTS_V2::get_underlying(__pc1), _VSTD_LFTS_V2::get_underlying(__pc2));
+  }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 11
+#endif // _LIBCPP_EXPERIMENTAL_PROPAGATE_CONST
diff --git a/app/src/main/cpp/libcxx/include/experimental/regex b/app/src/main/cpp/libcxx/include/experimental/regex
new file mode 100644
index 0000000..0c871f3
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/regex
@@ -0,0 +1,69 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_REGEX
+#define _LIBCPP_EXPERIMENTAL_REGEX
+
+/*
+    experimental/regex synopsis
+
+// C++1z
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+namespace pmr {
+
+  template <class BidirectionalIterator>
+  using match_results =
+    std::match_results<BidirectionalIterator,
+                       polymorphic_allocator<sub_match<BidirectionalIterator>>>;
+
+  typedef match_results<const char*> cmatch;
+  typedef match_results<const wchar_t*> wcmatch;
+  typedef match_results<string::const_iterator> smatch;
+  typedef match_results<wstring::const_iterator> wsmatch;
+
+} // namespace pmr
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <experimental/__config>
+#include <experimental/memory_resource>
+#include <experimental/string>
+#include <regex>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _BiDirIter>
+using match_results =
+    _VSTD::match_results<_BiDirIter,
+        polymorphic_allocator<_VSTD::sub_match<_BiDirIter>>>;
+
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("cmatch") typedef match_results<const char*> cmatch;
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("smatch") typedef match_results<_VSTD_LFTS_PMR::string::const_iterator> smatch;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("wcmatch") typedef match_results<const wchar_t*> wcmatch;
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("wsmatch") typedef match_results<_VSTD_LFTS_PMR::wstring::const_iterator> wsmatch;
+#endif
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_LFTS_PMR
+
+#endif /* _LIBCPP_EXPERIMENTAL_REGEX */
diff --git a/app/src/main/cpp/libcxx/include/experimental/set b/app/src/main/cpp/libcxx/include/experimental/set
new file mode 100644
index 0000000..cd61e64
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/set
@@ -0,0 +1,62 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_SET
+#define _LIBCPP_EXPERIMENTAL_SET
+
+/*
+    experimental/set synopsis
+
+// C++1z
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+namespace pmr {
+
+  template <class Key, class T, class Compare = less<Key>>
+  using set = std::set<Key, T, Compare,
+                       polymorphic_allocator<pair<const Key,T>>>;
+
+  template <class Key, class T, class Compare = less<Key>>
+  using multiset = std::multiset<Key, T, Compare,
+                                 polymorphic_allocator<pair<const Key,T>>>;
+
+} // namespace pmr
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <experimental/__config>
+#include <experimental/memory_resource>
+#include <set>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Value, class  _Compare = less<_Value>>
+using set = _VSTD::set<_Value, _Compare,
+                        polymorphic_allocator<_Value>>;
+
+template <class _Value, class  _Compare = less<_Value>>
+using multiset = _VSTD::multiset<_Value, _Compare,
+                        polymorphic_allocator<_Value>>;
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_LFTS_PMR
+
+#endif /* _LIBCPP_EXPERIMENTAL_SET */
diff --git a/app/src/main/cpp/libcxx/include/experimental/simd b/app/src/main/cpp/libcxx/include/experimental/simd
new file mode 100644
index 0000000..4ca67d2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/simd
@@ -0,0 +1,1585 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_SIMD
+#define _LIBCPP_EXPERIMENTAL_SIMD
+
+/*
+    experimental/simd synopsis
+
+namespace std::experimental {
+
+inline namespace parallelism_v2 {
+
+namespace simd_abi {
+
+struct scalar {};
+template <int N> struct fixed_size {};
+template <typename T> inline constexpr int max_fixed_size = implementation-defined;
+template <typename T> using compatible = implementation-defined;
+template <typename T> using native = implementation-defined;
+
+} // simd_abi
+
+struct element_aligned_tag {};
+struct vector_aligned_tag {};
+template <size_t> struct overaligned_tag {};
+inline constexpr element_aligned_tag element_aligned{};
+inline constexpr vector_aligned_tag vector_aligned{};
+template <size_t N> inline constexpr overaligned_tag<N> overaligned{};
+
+// traits [simd.traits]
+template <class T> struct is_abi_tag;
+template <class T> inline constexpr bool is_abi_tag_v = is_abi_tag<T>::value;
+
+template <class T> struct is_simd;
+template <class T> inline constexpr bool is_simd_v = is_simd<T>::value;
+
+template <class T> struct is_simd_mask;
+template <class T> inline constexpr bool is_simd_mask_v = is_simd_mask<T>::value;
+
+template <class T> struct is_simd_flag_type;
+template <class T> inline constexpr bool is_simd_flag_type_v = is_simd_flag_type<T>::value;
+
+template <class T, size_t N> struct abi_for_size { using type = see below; };
+template <class T, size_t N> using abi_for_size_t = typename abi_for_size<T, N>::type;
+
+template <class T, class Abi = simd_abi::compatible<T>> struct simd_size;
+template <class T, class Abi = simd_abi::compatible<T>>
+inline constexpr size_t simd_size_v = simd_size<T, Abi>::value;
+
+template <class T, class U = typename T::value_type> struct memory_alignment;
+template <class T, class U = typename T::value_type>
+inline constexpr size_t memory_alignment_v = memory_alignment<T, U>::value;
+
+// class template simd [simd.class]
+template <class T, class Abi = simd_abi::compatible<T>> class simd;
+template <class T> using native_simd = simd<T, simd_abi::native<T>>;
+template <class T, int N> using fixed_size_simd = simd<T, simd_abi::fixed_size<N>>;
+
+// class template simd_mask [simd.mask.class]
+template <class T, class Abi = simd_abi::compatible<T>> class simd_mask;
+template <class T> using native_simd_mask = simd_mask<T, simd_abi::native<T>>;
+template <class T, int N> using fixed_size_simd_mask = simd_mask<T, simd_abi::fixed_size<N>>;
+
+// casts [simd.casts]
+template <class T, class U, class Abi> see below simd_cast(const simd<U, Abi>&);
+template <class T, class U, class Abi> see below static_simd_cast(const simd<U, Abi>&);
+
+template <class T, class Abi>
+fixed_size_simd<T, simd_size_v<T, Abi>> to_fixed_size(const simd<T, Abi>&) noexcept;
+template <class T, class Abi>
+fixed_size_simd_mask<T, simd_size_v<T, Abi>> to_fixed_size(const simd_mask<T, Abi>&) noexcept;
+template <class T, size_t N> native_simd<T> to_native(const fixed_size_simd<T, N>&) noexcept;
+template <class T, size_t N>
+native_simd_mask<T> to_native(const fixed_size_simd_mask<T, N>> &) noexcept;
+template <class T, size_t N> simd<T> to_compatible(const fixed_size_simd<T, N>&) noexcept;
+template <class T, size_t N> simd_mask<T> to_compatible(const fixed_size_simd_mask<T, N>&) noexcept;
+
+template <size_t... Sizes, class T, class Abi>
+tuple<simd<T, abi_for_size_t<Sizes>>...> split(const simd<T, Abi>&);
+template <size_t... Sizes, class T, class Abi>
+tuple<simd_mask<T, abi_for_size_t<Sizes>>...> split(const simd_mask<T, Abi>&);
+template <class V, class Abi>
+array<V, simd_size_v<typename V::value_type, Abi> / V::size()> split(
+const simd<typename V::value_type, Abi>&);
+template <class V, class Abi>
+array<V, simd_size_v<typename V::value_type, Abi> / V::size()> split(
+const simd_mask<typename V::value_type, Abi>&);
+
+template <class T, class... Abis>
+simd<T, abi_for_size_t<T, (simd_size_v<T, Abis> + ...)>> concat(const simd<T, Abis>&...);
+template <class T, class... Abis>
+simd_mask<T, abi_for_size_t<T, (simd_size_v<T, Abis> + ...)>> concat(const simd_mask<T, Abis>&...);
+
+// reductions [simd.mask.reductions]
+template <class T, class Abi> bool all_of(const simd_mask<T, Abi>&) noexcept;
+template <class T, class Abi> bool any_of(const simd_mask<T, Abi>&) noexcept;
+template <class T, class Abi> bool none_of(const simd_mask<T, Abi>&) noexcept;
+template <class T, class Abi> bool some_of(const simd_mask<T, Abi>&) noexcept;
+template <class T, class Abi> int popcount(const simd_mask<T, Abi>&) noexcept;
+template <class T, class Abi> int find_first_set(const simd_mask<T, Abi>&);
+template <class T, class Abi> int find_last_set(const simd_mask<T, Abi>&);
+
+bool all_of(see below) noexcept;
+bool any_of(see below) noexcept;
+bool none_of(see below) noexcept;
+bool some_of(see below) noexcept;
+int popcount(see below) noexcept;
+int find_first_set(see below) noexcept;
+int find_last_set(see below) noexcept;
+
+// masked assignment [simd.whereexpr]
+template <class M, class T> class const_where_expression;
+template <class M, class T> class where_expression;
+
+// masked assignment [simd.mask.where]
+template <class T> struct nodeduce { using type = T; }; // exposition only
+
+template <class T> using nodeduce_t = typename nodeduce<T>::type; // exposition only
+
+template <class T, class Abi>
+where_expression<simd_mask<T, Abi>, simd<T, Abi>>
+where(const typename simd<T, Abi>::mask_type&, simd<T, Abi>&) noexcept;
+
+template <class T, class Abi>
+const_where_expression<simd_mask<T, Abi>, const simd<T, Abi>>
+where(const typename simd<T, Abi>::mask_type&, const simd<T, Abi>&) noexcept;
+
+template <class T, class Abi>
+where_expression<simd_mask<T, Abi>, simd_mask<T, Abi>>
+where(const nodeduce_t<simd_mask<T, Abi>>&, simd_mask<T, Abi>&) noexcept;
+
+template <class T, class Abi>
+const_where_expression<simd_mask<T, Abi>, const simd_mask<T, Abi>>
+where(const nodeduce_t<simd_mask<T, Abi>>&, const simd_mask<T, Abi>&) noexcept;
+
+template <class T> where_expression<bool, T> where(see below k, T& d) noexcept;
+
+template <class T>
+const_where_expression<bool, const T> where(see below k, const T& d) noexcept;
+
+// reductions [simd.reductions]
+template <class T, class Abi, class BinaryOperation = std::plus<>>
+T reduce(const simd<T, Abi>&, BinaryOperation = BinaryOperation());
+
+template <class M, class V, class BinaryOperation>
+typename V::value_type reduce(const const_where_expression<M, V>& x,
+typename V::value_type neutral_element, BinaryOperation binary_op);
+
+template <class M, class V>
+typename V::value_type reduce(const const_where_expression<M, V>& x, plus<> binary_op = plus<>());
+
+template <class M, class V>
+typename V::value_type reduce(const const_where_expression<M, V>& x, multiplies<> binary_op);
+
+template <class M, class V>
+typename V::value_type reduce(const const_where_expression<M, V>& x, bit_and<> binary_op);
+
+template <class M, class V>
+typename V::value_type reduce(const const_where_expression<M, V>& x, bit_or<> binary_op);
+
+template <class M, class V>
+typename V::value_type reduce(const const_where_expression<M, V>& x, bit_xor<> binary_op);
+
+template <class T, class Abi> T hmin(const simd<T, Abi>&);
+template <class M, class V> T hmin(const const_where_expression<M, V>&);
+template <class T, class Abi> T hmax(const simd<T, Abi>&);
+template <class M, class V> T hmax(const const_where_expression<M, V>&);
+
+// algorithms [simd.alg]
+template <class T, class Abi> simd<T, Abi> min(const simd<T, Abi>&, const simd<T, Abi>&) noexcept;
+
+template <class T, class Abi> simd<T, Abi> max(const simd<T, Abi>&, const simd<T, Abi>&) noexcept;
+
+template <class T, class Abi>
+std::pair<simd<T, Abi>, simd<T, Abi>> minmax(const simd<T, Abi>&, const simd<T, Abi>&) noexcept;
+
+template <class T, class Abi>
+simd<T, Abi> clamp(const simd<T, Abi>& v, const simd<T, Abi>& lo, const simd<T, Abi>& hi);
+
+// [simd.whereexpr]
+template <class M, class T>
+class const_where_expression {
+  const M& mask; // exposition only
+  T& data; // exposition only
+public:
+  const_where_expression(const const_where_expression&) = delete;
+  const_where_expression& operator=(const const_where_expression&) = delete;
+  remove_const_t<T> operator-() const &&;
+  template <class U, class Flags> void copy_to(U* mem, Flags f) const &&;
+};
+
+template <class M, class T>
+class where_expression : public const_where_expression<M, T> {
+public:
+  where_expression(const where_expression&) = delete;
+  where_expression& operator=(const where_expression&) = delete;
+  template <class U> void operator=(U&& x);
+  template <class U> void operator+=(U&& x);
+  template <class U> void operator-=(U&& x);
+  template <class U> void operator*=(U&& x);
+  template <class U> void operator/=(U&& x);
+  template <class U> void operator%=(U&& x);
+  template <class U> void operator&=(U&& x);
+  template <class U> void operator|=(U&& x);
+  template <class U> void operator^=(U&& x);
+  template <class U> void operator<<=(U&& x);
+  template <class U> void operator>>=(U&& x);
+  void operator++();
+  void operator++(int);
+  void operator--();
+  void operator--(int);
+  template <class U, class Flags> void copy_from(const U* mem, Flags);
+};
+
+// [simd.class]
+template <class T, class Abi> class simd {
+public:
+  using value_type = T;
+  using reference = see below;
+  using mask_type = simd_mask<T, Abi>;
+
+  using abi_type = Abi;
+  static constexpr size_t size() noexcept;
+  simd() = default;
+
+  // implicit type conversion constructor
+  template <class U> simd(const simd<U, simd_abi::fixed_size<size()>>&);
+
+  // implicit broadcast constructor (see below for constraints)
+  template <class U> simd(U&& value);
+
+  // generator constructor (see below for constraints)
+  template <class G> explicit simd(G&& gen);
+
+  // load constructor
+  template <class U, class Flags> simd(const U* mem, Flags f);
+
+  // loads [simd.load]
+  template <class U, class Flags> void copy_from(const U* mem, Flags f);
+
+  // stores [simd.store]
+  template <class U, class Flags> void copy_to(U* mem, Flags f) const;
+
+  // scalar access [simd.subscr]
+  reference operator[](size_t);
+  value_type operator[](size_t) const;
+
+  // unary operators [simd.unary]
+  simd& operator++();
+  simd operator++(int);
+  simd& operator--();
+  simd operator--(int);
+  mask_type operator!() const;
+  simd operator~() const; // see below
+  simd operator+() const;
+  simd operator-() const;
+
+  // binary operators [simd.binary]
+  friend simd operator+ (const simd&, const simd&);
+  friend simd operator- (const simd&, const simd&);
+  friend simd operator* (const simd&, const simd&);
+  friend simd operator/ (const simd&, const simd&);
+  friend simd operator% (const simd&, const simd&);
+  friend simd operator& (const simd&, const simd&);
+  friend simd operator| (const simd&, const simd&);
+  friend simd operator^ (const simd&, const simd&);
+  friend simd operator<<(const simd&, const simd&);
+  friend simd operator>>(const simd&, const simd&);
+  friend simd operator<<(const simd&, int);
+  friend simd operator>>(const simd&, int);
+
+  // compound assignment [simd.cassign]
+  friend simd& operator+= (simd&, const simd&);
+  friend simd& operator-= (simd&, const simd&);
+  friend simd& operator*= (simd&, const simd&);
+  friend simd& operator/= (simd&, const simd&);
+  friend simd& operator%= (simd&, const simd&);
+
+  friend simd& operator&= (simd&, const simd&);
+  friend simd& operator|= (simd&, const simd&);
+  friend simd& operator^= (simd&, const simd&);
+  friend simd& operator<<=(simd&, const simd&);
+  friend simd& operator>>=(simd&, const simd&);
+  friend simd& operator<<=(simd&, int);
+  friend simd& operator>>=(simd&, int);
+
+  // compares [simd.comparison]
+  friend mask_type operator==(const simd&, const simd&);
+  friend mask_type operator!=(const simd&, const simd&);
+  friend mask_type operator>=(const simd&, const simd&);
+  friend mask_type operator<=(const simd&, const simd&);
+  friend mask_type operator> (const simd&, const simd&);
+  friend mask_type operator< (const simd&, const simd&);
+};
+
+// [simd.math]
+template <class Abi> using scharv = simd<signed char, Abi>; // exposition only
+template <class Abi> using shortv = simd<short, Abi>; // exposition only
+template <class Abi> using intv = simd<int, Abi>; // exposition only
+template <class Abi> using longv = simd<long int, Abi>; // exposition only
+template <class Abi> using llongv = simd<long long int, Abi>; // exposition only
+template <class Abi> using floatv = simd<float, Abi>; // exposition only
+template <class Abi> using doublev = simd<double, Abi>; // exposition only
+template <class Abi> using ldoublev = simd<long double, Abi>; // exposition only
+template <class T, class V> using samesize = fixed_size_simd<T, V::size()>; // exposition only
+
+template <class Abi> floatv<Abi> acos(floatv<Abi> x);
+template <class Abi> doublev<Abi> acos(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> acos(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> asin(floatv<Abi> x);
+template <class Abi> doublev<Abi> asin(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> asin(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> atan(floatv<Abi> x);
+template <class Abi> doublev<Abi> atan(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> atan(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> atan2(floatv<Abi> y, floatv<Abi> x);
+template <class Abi> doublev<Abi> atan2(doublev<Abi> y, doublev<Abi> x);
+template <class Abi> ldoublev<Abi> atan2(ldoublev<Abi> y, ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> cos(floatv<Abi> x);
+template <class Abi> doublev<Abi> cos(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> cos(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> sin(floatv<Abi> x);
+template <class Abi> doublev<Abi> sin(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> sin(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> tan(floatv<Abi> x);
+template <class Abi> doublev<Abi> tan(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> tan(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> acosh(floatv<Abi> x);
+template <class Abi> doublev<Abi> acosh(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> acosh(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> asinh(floatv<Abi> x);
+template <class Abi> doublev<Abi> asinh(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> asinh(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> atanh(floatv<Abi> x);
+template <class Abi> doublev<Abi> atanh(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> atanh(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> cosh(floatv<Abi> x);
+template <class Abi> doublev<Abi> cosh(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> cosh(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> sinh(floatv<Abi> x);
+template <class Abi> doublev<Abi> sinh(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> sinh(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> tanh(floatv<Abi> x);
+template <class Abi> doublev<Abi> tanh(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> tanh(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> exp(floatv<Abi> x);
+template <class Abi> doublev<Abi> exp(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> exp(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> exp2(floatv<Abi> x);
+template <class Abi> doublev<Abi> exp2(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> exp2(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> expm1(floatv<Abi> x);
+template <class Abi> doublev<Abi> expm1(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> expm1(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> frexp(floatv<Abi> value, samesize<int, floatv<Abi>>* exp);
+template <class Abi> doublev<Abi> frexp(doublev<Abi> value, samesize<int, doublev<Abi>>* exp);
+template <class Abi> ldoublev<Abi> frexp(ldoublev<Abi> value, samesize<int, ldoublev<Abi>>* exp);
+
+template <class Abi> samesize<int, floatv<Abi>> ilogb(floatv<Abi> x);
+template <class Abi> samesize<int, doublev<Abi>> ilogb(doublev<Abi> x);
+template <class Abi> samesize<int, ldoublev<Abi>> ilogb(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> ldexp(floatv<Abi> x, samesize<int, floatv<Abi>> exp);
+template <class Abi> doublev<Abi> ldexp(doublev<Abi> x, samesize<int, doublev<Abi>> exp);
+template <class Abi> ldoublev<Abi> ldexp(ldoublev<Abi> x, samesize<int, ldoublev<Abi>> exp);
+
+template <class Abi> floatv<Abi> log(floatv<Abi> x);
+template <class Abi> doublev<Abi> log(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> log(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> log10(floatv<Abi> x);
+template <class Abi> doublev<Abi> log10(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> log10(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> log1p(floatv<Abi> x);
+template <class Abi> doublev<Abi> log1p(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> log1p(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> log2(floatv<Abi> x);
+template <class Abi> doublev<Abi> log2(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> log2(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> logb(floatv<Abi> x);
+template <class Abi> doublev<Abi> logb(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> logb(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> modf(floatv<Abi> value, floatv<Abi>* iptr);
+template <class Abi> doublev<Abi> modf(doublev<Abi> value, doublev<Abi>* iptr);
+template <class Abi> ldoublev<Abi> modf(ldoublev<Abi> value, ldoublev<Abi>* iptr);
+
+template <class Abi> floatv<Abi> scalbn(floatv<Abi> x, samesize<int, floatv<Abi>> n);
+template <class Abi> doublev<Abi> scalbn(doublev<Abi> x, samesize<int, doublev<Abi>> n);
+template <class Abi> ldoublev<Abi> scalbn(ldoublev<Abi> x, samesize<int, ldoublev<Abi>> n);
+template <class Abi> floatv<Abi> scalbln(floatv<Abi> x, samesize<long int, floatv<Abi>> n);
+template <class Abi> doublev<Abi> scalbln(doublev<Abi> x, samesize<long int, doublev<Abi>> n);
+template <class Abi> ldoublev<Abi> scalbln(ldoublev<Abi> x, samesize<long int, ldoublev<Abi>> n);
+
+template <class Abi> floatv<Abi> cbrt(floatv<Abi> x);
+template <class Abi> doublev<Abi> cbrt(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> cbrt(ldoublev<Abi> x);
+
+template <class Abi> scharv<Abi> abs(scharv<Abi> j);
+template <class Abi> shortv<Abi> abs(shortv<Abi> j);
+template <class Abi> intv<Abi> abs(intv<Abi> j);
+template <class Abi> longv<Abi> abs(longv<Abi> j);
+template <class Abi> llongv<Abi> abs(llongv<Abi> j);
+template <class Abi> floatv<Abi> abs(floatv<Abi> j);
+template <class Abi> doublev<Abi> abs(doublev<Abi> j);
+template <class Abi> ldoublev<Abi> abs(ldoublev<Abi> j);
+
+template <class Abi> floatv<Abi> hypot(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> doublev<Abi> hypot(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> ldoublev<Abi> hypot(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> floatv<Abi> hypot(floatv<Abi> x, floatv<Abi> y, floatv<Abi> z);
+template <class Abi> doublev<Abi> hypot(doublev<Abi> x, doublev<Abi> y, doublev<Abi> z);
+template <class Abi> ldoublev<Abi> hypot(ldoublev<Abi> x, ldoublev<Abi> y, ldoublev<Abi> z);
+
+template <class Abi> floatv<Abi> pow(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> doublev<Abi> pow(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> ldoublev<Abi> pow(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> floatv<Abi> sqrt(floatv<Abi> x);
+template <class Abi> doublev<Abi> sqrt(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> sqrt(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> erf(floatv<Abi> x);
+template <class Abi> doublev<Abi> erf(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> erf(ldoublev<Abi> x);
+template <class Abi> floatv<Abi> erfc(floatv<Abi> x);
+template <class Abi> doublev<Abi> erfc(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> erfc(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> lgamma(floatv<Abi> x);
+template <class Abi> doublev<Abi> lgamma(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> lgamma(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> tgamma(floatv<Abi> x);
+template <class Abi> doublev<Abi> tgamma(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> tgamma(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> ceil(floatv<Abi> x);
+template <class Abi> doublev<Abi> ceil(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> ceil(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> floor(floatv<Abi> x);
+template <class Abi> doublev<Abi> floor(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> floor(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> nearbyint(floatv<Abi> x);
+template <class Abi> doublev<Abi> nearbyint(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> nearbyint(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> rint(floatv<Abi> x);
+template <class Abi> doublev<Abi> rint(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> rint(ldoublev<Abi> x);
+
+template <class Abi> samesize<long int, floatv<Abi>> lrint(floatv<Abi> x);
+template <class Abi> samesize<long int, doublev<Abi>> lrint(doublev<Abi> x);
+template <class Abi> samesize<long int, ldoublev<Abi>> lrint(ldoublev<Abi> x);
+template <class Abi> samesize<long long int, floatv<Abi>> llrint(floatv<Abi> x);
+template <class Abi> samesize<long long int, doublev<Abi>> llrint(doublev<Abi> x);
+template <class Abi> samesize<long long int, ldoublev<Abi>> llrint(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> round(floatv<Abi> x);
+template <class Abi> doublev<Abi> round(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> round(ldoublev<Abi> x);
+template <class Abi> samesize<long int, floatv<Abi>> lround(floatv<Abi> x);
+template <class Abi> samesize<long int, doublev<Abi>> lround(doublev<Abi> x);
+template <class Abi> samesize<long int, ldoublev<Abi>> lround(ldoublev<Abi> x);
+template <class Abi> samesize<long long int, floatv<Abi>> llround(floatv<Abi> x);
+template <class Abi> samesize<long long int, doublev<Abi>> llround(doublev<Abi> x);
+template <class Abi> samesize<long long int, ldoublev<Abi>> llround(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> trunc(floatv<Abi> x);
+template <class Abi> doublev<Abi> trunc(doublev<Abi> x);
+template <class Abi> ldoublev<Abi> trunc(ldoublev<Abi> x);
+
+template <class Abi> floatv<Abi> fmod(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> doublev<Abi> fmod(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> ldoublev<Abi> fmod(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> floatv<Abi> remainder(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> doublev<Abi> remainder(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> ldoublev<Abi> remainder(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> floatv<Abi> remquo(floatv<Abi> x, floatv<Abi> y, samesize<int, floatv<Abi>>* quo);
+template <class Abi> doublev<Abi> remquo(doublev<Abi> x, doublev<Abi> y, samesize<int, doublev<Abi>>* quo);
+template <class Abi> ldoublev<Abi> remquo(ldoublev<Abi> x, ldoublev<Abi> y, samesize<int, ldoublev<Abi>>* quo);
+
+template <class Abi> floatv<Abi> copysign(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> doublev<Abi> copysign(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> ldoublev<Abi> copysign(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> doublev<Abi> nan(const char* tagp);
+template <class Abi> floatv<Abi> nanf(const char* tagp);
+template <class Abi> ldoublev<Abi> nanl(const char* tagp);
+
+template <class Abi> floatv<Abi> nextafter(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> doublev<Abi> nextafter(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> ldoublev<Abi> nextafter(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> floatv<Abi> nexttoward(floatv<Abi> x, ldoublev<Abi> y);
+template <class Abi> doublev<Abi> nexttoward(doublev<Abi> x, ldoublev<Abi> y);
+template <class Abi> ldoublev<Abi> nexttoward(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> floatv<Abi> fdim(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> doublev<Abi> fdim(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> ldoublev<Abi> fdim(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> floatv<Abi> fmax(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> doublev<Abi> fmax(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> ldoublev<Abi> fmax(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> floatv<Abi> fmin(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> doublev<Abi> fmin(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> ldoublev<Abi> fmin(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> floatv<Abi> fma(floatv<Abi> x, floatv<Abi> y, floatv<Abi> z);
+template <class Abi> doublev<Abi> fma(doublev<Abi> x, doublev<Abi> y, doublev<Abi> z);
+template <class Abi> ldoublev<Abi> fma(ldoublev<Abi> x, ldoublev<Abi> y, ldoublev<Abi> z);
+
+template <class Abi> samesize<int, floatv<Abi>> fpclassify(floatv<Abi> x);
+template <class Abi> samesize<int, doublev<Abi>> fpclassify(doublev<Abi> x);
+template <class Abi> samesize<int, ldoublev<Abi>> fpclassify(ldoublev<Abi> x);
+
+template <class Abi> simd_mask<float, Abi> isfinite(floatv<Abi> x);
+template <class Abi> simd_mask<double, Abi> isfinite(doublev<Abi> x);
+template <class Abi> simd_mask<long double, Abi> isfinite(ldoublev<Abi> x);
+
+template <class Abi> simd_mask<float, Abi> isinf(floatv<Abi> x);
+template <class Abi> simd_mask<double, Abi> isinf(doublev<Abi> x);
+template <class Abi> simd_mask<long double, Abi> isinf(ldoublev<Abi> x);
+
+template <class Abi> simd_mask<float, Abi> isnan(floatv<Abi> x);
+template <class Abi> simd_mask<double, Abi> isnan(doublev<Abi> x);
+template <class Abi> simd_mask<long double, Abi> isnan(ldoublev<Abi> x);
+
+template <class Abi> simd_mask<float, Abi> isnormal(floatv<Abi> x);
+template <class Abi> simd_mask<double, Abi> isnormal(doublev<Abi> x);
+template <class Abi> simd_mask<long double, Abi> isnormal(ldoublev<Abi> x);
+
+template <class Abi> simd_mask<float, Abi> signbit(floatv<Abi> x);
+template <class Abi> simd_mask<double, Abi> signbit(doublev<Abi> x);
+template <class Abi> simd_mask<long double, Abi> signbit(ldoublev<Abi> x);
+
+template <class Abi> simd_mask<float, Abi> isgreater(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> simd_mask<double, Abi> isgreater(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> simd_mask<long double, Abi> isgreater(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> simd_mask<float, Abi> isgreaterequal(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> simd_mask<double, Abi> isgreaterequal(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> simd_mask<long double, Abi> isgreaterequal(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> simd_mask<float, Abi> isless(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> simd_mask<double, Abi> isless(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> simd_mask<long double, Abi> isless(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> simd_mask<float, Abi> islessequal(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> simd_mask<double, Abi> islessequal(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> simd_mask<long double, Abi> islessequal(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> simd_mask<float, Abi> islessgreater(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> simd_mask<double, Abi> islessgreater(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> simd_mask<long double, Abi> islessgreater(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class Abi> simd_mask<float, Abi> isunordered(floatv<Abi> x, floatv<Abi> y);
+template <class Abi> simd_mask<double, Abi> isunordered(doublev<Abi> x, doublev<Abi> y);
+template <class Abi> simd_mask<long double, Abi> isunordered(ldoublev<Abi> x, ldoublev<Abi> y);
+
+template <class V> struct simd_div_t { V quot, rem; };
+template <class Abi> simd_div_t<scharv<Abi>> div(scharv<Abi> numer, scharv<Abi> denom);
+template <class Abi> simd_div_t<shortv<Abi>> div(shortv<Abi> numer, shortv<Abi> denom);
+template <class Abi> simd_div_t<intv<Abi>> div(intv<Abi> numer, intv<Abi> denom);
+template <class Abi> simd_div_t<longv<Abi>> div(longv<Abi> numer, longv<Abi> denom);
+template <class Abi> simd_div_t<llongv<Abi>> div(llongv<Abi> numer, llongv<Abi> denom);
+
+// [simd.mask.class]
+template <class T, class Abi>
+class simd_mask {
+public:
+  using value_type = bool;
+  using reference = see below;
+  using simd_type = simd<T, Abi>;
+  using abi_type = Abi;
+  static constexpr size_t size() noexcept;
+  simd_mask() = default;
+
+  // broadcast constructor
+  explicit simd_mask(value_type) noexcept;
+
+  // implicit type conversion constructor
+  template <class U> simd_mask(const simd_mask<U, simd_abi::fixed_size<size()>>&) noexcept;
+
+  // load constructor
+  template <class Flags> simd_mask(const value_type* mem, Flags);
+
+  // loads [simd.mask.copy]
+  template <class Flags> void copy_from(const value_type* mem, Flags);
+  template <class Flags> void copy_to(value_type* mem, Flags) const;
+
+  // scalar access [simd.mask.subscr]
+  reference operator[](size_t);
+  value_type operator[](size_t) const;
+
+  // unary operators [simd.mask.unary]
+  simd_mask operator!() const noexcept;
+
+  // simd_mask binary operators [simd.mask.binary]
+  friend simd_mask operator&&(const simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask operator||(const simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask operator& (const simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask operator| (const simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask operator^ (const simd_mask&, const simd_mask&) noexcept;
+
+  // simd_mask compound assignment [simd.mask.cassign]
+  friend simd_mask& operator&=(simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask& operator|=(simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask& operator^=(simd_mask&, const simd_mask&) noexcept;
+
+  // simd_mask compares [simd.mask.comparison]
+  friend simd_mask operator==(const simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask operator!=(const simd_mask&, const simd_mask&) noexcept;
+};
+
+} // parallelism_v2
+} // std::experimental
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__functional/operations.h>
+#include <array>
+#include <cstddef>
+#include <experimental/__config>
+#include <tuple>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL_SIMD
+
+#if _LIBCPP_STD_VER >= 17
+
+enum class _StorageKind {
+  _Scalar,
+  _Array,
+  _VecExt,
+};
+
+template <_StorageKind __kind, int _Np>
+struct __simd_abi {};
+
+template <class _Tp, class _Abi>
+class __simd_storage {};
+
+template <class _Tp, int __num_element>
+class __simd_storage<_Tp, __simd_abi<_StorageKind::_Array, __num_element>> {
+  std::array<_Tp, __num_element> __storage_;
+
+  template <class, class>
+  friend struct simd;
+
+  template <class, class>
+  friend struct simd_mask;
+
+public:
+  _Tp __get(size_t __index) const noexcept { return __storage_[__index]; }
+  void __set(size_t __index, _Tp __val) noexcept {
+    __storage_[__index] = __val;
+  }
+};
+
+template <class _Tp>
+class __simd_storage<_Tp, __simd_abi<_StorageKind::_Scalar, 1>> {
+  _Tp __storage_;
+
+  template <class, class>
+  friend struct simd;
+
+  template <class, class>
+  friend struct simd_mask;
+
+public:
+  _Tp __get(size_t __index) const noexcept { return (&__storage_)[__index]; }
+  void __set(size_t __index, _Tp __val) noexcept {
+    (&__storage_)[__index] = __val;
+  }
+};
+
+#ifndef _LIBCPP_HAS_NO_VECTOR_EXTENSION
+
+_LIBCPP_HIDE_FROM_ABI constexpr size_t __floor_pow_of_2(size_t __val) {
+  return ((__val - 1) & __val) == 0 ? __val
+                                    : __floor_pow_of_2((__val - 1) & __val);
+}
+
+_LIBCPP_HIDE_FROM_ABI constexpr size_t __ceil_pow_of_2(size_t __val) {
+  return __val == 1 ? 1 : __floor_pow_of_2(__val - 1) << 1;
+}
+
+template <class _Tp, size_t __bytes>
+struct __vec_ext_traits {
+#if !defined(_LIBCPP_COMPILER_CLANG_BASED)
+  typedef _Tp type __attribute__((vector_size(__ceil_pow_of_2(__bytes))));
+#endif
+};
+
+#if defined(_LIBCPP_COMPILER_CLANG_BASED)
+#define _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, _NUM_ELEMENT)                        \
+  template <>                                                                  \
+  struct __vec_ext_traits<_TYPE, sizeof(_TYPE) * _NUM_ELEMENT> {               \
+    using type =                                                               \
+        _TYPE __attribute__((vector_size(sizeof(_TYPE) * _NUM_ELEMENT)));      \
+  }
+
+#define _LIBCPP_SPECIALIZE_VEC_EXT_32(_TYPE)                                   \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 1);                                        \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 2);                                        \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 3);                                        \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 4);                                        \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 5);                                        \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 6);                                        \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 7);                                        \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 8);                                        \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 9);                                        \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 10);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 11);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 12);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 13);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 14);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 15);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 16);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 17);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 18);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 19);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 20);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 21);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 22);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 23);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 24);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 25);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 26);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 27);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 28);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 29);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 30);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 31);                                       \
+  _LIBCPP_SPECIALIZE_VEC_EXT(_TYPE, 32)
+
+_LIBCPP_SPECIALIZE_VEC_EXT_32(char);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(char16_t);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(char32_t);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(wchar_t);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(signed char);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(signed short);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(signed int);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(signed long);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(signed long long);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(unsigned char);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(unsigned short);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(unsigned int);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(unsigned long);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(unsigned long long);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(float);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(double);
+_LIBCPP_SPECIALIZE_VEC_EXT_32(long double);
+
+#undef _LIBCPP_SPECIALIZE_VEC_EXT_32
+#undef _LIBCPP_SPECIALIZE_VEC_EXT
+#endif
+
+template <class _Tp, int __num_element>
+class __simd_storage<_Tp, __simd_abi<_StorageKind::_VecExt, __num_element>> {
+  using _StorageType =
+      typename __vec_ext_traits<_Tp, sizeof(_Tp) * __num_element>::type;
+
+  _StorageType __storage_;
+
+  template <class, class>
+  friend struct simd;
+
+  template <class, class>
+  friend struct simd_mask;
+
+public:
+  _Tp __get(size_t __index) const noexcept { return __storage_[__index]; }
+  void __set(size_t __index, _Tp __val) noexcept {
+    __storage_[__index] = __val;
+  }
+};
+
+#endif // _LIBCPP_HAS_NO_VECTOR_EXTENSION
+
+template <class _Vp, class _Tp, class _Abi>
+class __simd_reference {
+  static_assert(std::is_same<_Vp, _Tp>::value, "");
+
+  template <class, class>
+  friend struct simd;
+
+  template <class, class>
+  friend struct simd_mask;
+
+  __simd_storage<_Tp, _Abi>* __ptr_;
+  size_t __index_;
+
+  __simd_reference(__simd_storage<_Tp, _Abi>* __ptr, size_t __index)
+      : __ptr_(__ptr), __index_(__index) {}
+
+  __simd_reference(const __simd_reference&) = default;
+
+public:
+  __simd_reference() = delete;
+  __simd_reference& operator=(const __simd_reference&) = delete;
+
+  operator _Vp() const { return __ptr_->__get(__index_); }
+
+  __simd_reference operator=(_Vp __value) && {
+    __ptr_->__set(__index_, __value);
+    return *this;
+  }
+
+  __simd_reference operator++() && {
+    return std::move(*this) = __ptr_->__get(__index_) + 1;
+  }
+
+  _Vp operator++(int) && {
+    auto __val = __ptr_->__get(__index_);
+    __ptr_->__set(__index_, __val + 1);
+    return __val;
+  }
+
+  __simd_reference operator--() && {
+    return std::move(*this) = __ptr_->__get(__index_) - 1;
+  }
+
+  _Vp operator--(int) && {
+    auto __val = __ptr_->__get(__index_);
+    __ptr_->__set(__index_, __val - 1);
+    return __val;
+  }
+
+  __simd_reference operator+=(_Vp __value) && {
+    return std::move(*this) = __ptr_->__get(__index_) + __value;
+  }
+
+  __simd_reference operator-=(_Vp __value) && {
+    return std::move(*this) = __ptr_->__get(__index_) - __value;
+  }
+
+  __simd_reference operator*=(_Vp __value) && {
+    return std::move(*this) = __ptr_->__get(__index_) * __value;
+  }
+
+  __simd_reference operator/=(_Vp __value) && {
+    return std::move(*this) = __ptr_->__get(__index_) / __value;
+  }
+
+  __simd_reference operator%=(_Vp __value) && {
+    return std::move(*this) = __ptr_->__get(__index_) % __value;
+  }
+
+  __simd_reference operator>>=(_Vp __value) && {
+    return std::move(*this) = __ptr_->__get(__index_) >> __value;
+  }
+
+  __simd_reference operator<<=(_Vp __value) && {
+    return std::move(*this) = __ptr_->__get(__index_) << __value;
+  }
+
+  __simd_reference operator&=(_Vp __value) && {
+    return std::move(*this) = __ptr_->__get(__index_) & __value;
+  }
+
+  __simd_reference operator|=(_Vp __value) && {
+    return std::move(*this) = __ptr_->__get(__index_) | __value;
+  }
+
+  __simd_reference operator^=(_Vp __value) && {
+    return std::move(*this) = __ptr_->__get(__index_) ^ __value;
+  }
+};
+
+template <class _To, class _From>
+_LIBCPP_HIDE_FROM_ABI constexpr decltype(_To{std::declval<_From>()}, true)
+__is_non_narrowing_convertible_impl(_From) {
+  return true;
+}
+
+template <class _To>
+_LIBCPP_HIDE_FROM_ABI constexpr bool __is_non_narrowing_convertible_impl(...) {
+  return false;
+}
+
+template <class _From, class _To>
+_LIBCPP_HIDE_FROM_ABI
+constexpr typename std::enable_if<std::is_arithmetic<_To>::value &&
+                                      std::is_arithmetic<_From>::value,
+                                  bool>::type
+__is_non_narrowing_arithmetic_convertible() {
+  return experimental::__is_non_narrowing_convertible_impl<_To>(_From{});
+}
+
+template <class _From, class _To>
+_LIBCPP_HIDE_FROM_ABI
+constexpr typename std::enable_if<!(std::is_arithmetic<_To>::value &&
+                                    std::is_arithmetic<_From>::value),
+                                  bool>::type
+__is_non_narrowing_arithmetic_convertible() {
+  return false;
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr _Tp __variadic_sum() {
+  return _Tp{};
+}
+
+template <class _Tp, class _Up, class... _Args>
+_LIBCPP_HIDE_FROM_ABI constexpr _Tp __variadic_sum(_Up __first, _Args... __rest) {
+  return static_cast<_Tp>(__first) + experimental::__variadic_sum<_Tp>(__rest...);
+}
+
+template <class _Tp>
+struct __nodeduce {
+  using type = _Tp;
+};
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr bool __vectorizable() {
+  return std::is_arithmetic<_Tp>::value && !std::is_const<_Tp>::value &&
+         !std::is_volatile<_Tp>::value && !std::is_same<_Tp, bool>::value;
+}
+
+_LIBCPP_END_NAMESPACE_EXPERIMENTAL_SIMD
+_LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL_SIMD_ABI
+
+using scalar = __simd_abi<_StorageKind::_Scalar, 1>;
+
+template <int _Np>
+using fixed_size = __simd_abi<_StorageKind::_Array, _Np>;
+
+template <class _Tp>
+inline constexpr size_t max_fixed_size = 32;
+
+template <class _Tp>
+using compatible = fixed_size<16 / sizeof(_Tp)>;
+
+#ifndef _LIBCPP_HAS_NO_VECTOR_EXTENSION
+template <class _Tp>
+using native = __simd_abi<_StorageKind::_VecExt,
+                          _LIBCPP_NATIVE_SIMD_WIDTH_IN_BYTES / sizeof(_Tp)>;
+#else
+template <class _Tp>
+using native =
+    fixed_size<_Tp, _LIBCPP_NATIVE_SIMD_WIDTH_IN_BYTES / sizeof(_Tp)>;
+#endif // _LIBCPP_HAS_NO_VECTOR_EXTENSION
+
+_LIBCPP_END_NAMESPACE_EXPERIMENTAL_SIMD_ABI
+_LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL_SIMD
+
+template <class _Tp, class _Abi = simd_abi::compatible<_Tp>>
+class simd;
+template <class _Tp, class _Abi = simd_abi::compatible<_Tp>>
+class simd_mask;
+
+struct element_aligned_tag {};
+struct vector_aligned_tag {};
+template <size_t>
+struct overaligned_tag {};
+inline constexpr element_aligned_tag element_aligned{};
+inline constexpr vector_aligned_tag vector_aligned{};
+template <size_t _Np>
+inline constexpr overaligned_tag<_Np> overaligned{};
+
+// traits [simd.traits]
+template <class _Tp>
+struct is_abi_tag : std::integral_constant<bool, false> {};
+
+template <_StorageKind __kind, int _Np>
+struct is_abi_tag<__simd_abi<__kind, _Np>>
+    : std::integral_constant<bool, true> {};
+
+template <class _Tp>
+struct is_simd : std::integral_constant<bool, false> {};
+
+template <class _Tp, class _Abi>
+struct is_simd<simd<_Tp, _Abi>> : std::integral_constant<bool, true> {};
+
+template <class _Tp>
+struct is_simd_mask : std::integral_constant<bool, false> {};
+
+template <class _Tp, class _Abi>
+struct is_simd_mask<simd_mask<_Tp, _Abi>> : std::integral_constant<bool, true> {
+};
+
+template <class _Tp>
+struct is_simd_flag_type : std::integral_constant<bool, false> {};
+
+template <>
+struct is_simd_flag_type<element_aligned_tag>
+    : std::integral_constant<bool, true> {};
+
+template <>
+struct is_simd_flag_type<vector_aligned_tag>
+    : std::integral_constant<bool, true> {};
+
+template <size_t _Align>
+struct is_simd_flag_type<overaligned_tag<_Align>>
+    : std::integral_constant<bool, true> {};
+
+template <class _Tp>
+inline constexpr bool is_abi_tag_v = is_abi_tag<_Tp>::value;
+template <class _Tp>
+inline constexpr bool is_simd_v = is_simd<_Tp>::value;
+template <class _Tp>
+inline constexpr bool is_simd_mask_v = is_simd_mask<_Tp>::value;
+template <class _Tp>
+inline constexpr bool is_simd_flag_type_v = is_simd_flag_type<_Tp>::value;
+template <class _Tp, size_t _Np>
+struct abi_for_size {
+  using type = simd_abi::fixed_size<_Np>;
+};
+template <class _Tp, size_t _Np>
+using abi_for_size_t = typename abi_for_size<_Tp, _Np>::type;
+
+template <class _Tp, class _Abi = simd_abi::compatible<_Tp>>
+struct simd_size;
+
+template <class _Tp, _StorageKind __kind, int _Np>
+struct simd_size<_Tp, __simd_abi<__kind, _Np>>
+    : std::integral_constant<size_t, _Np> {
+  static_assert(
+      std::is_arithmetic<_Tp>::value &&
+          !std::is_same<__remove_const_t<_Tp>, bool>::value,
+      "Element type should be vectorizable");
+};
+
+// TODO: implement it.
+template <class _Tp, class _Up = typename _Tp::value_type>
+struct memory_alignment;
+
+template <class _Tp, class _Abi = simd_abi::compatible<_Tp>>
+inline constexpr size_t simd_size_v = simd_size<_Tp, _Abi>::value;
+
+template <class _Tp, class _Up = typename _Tp::value_type>
+inline constexpr size_t memory_alignment_v = memory_alignment<_Tp, _Up>::value;
+
+// class template simd [simd.class]
+template <class _Tp>
+using native_simd = simd<_Tp, simd_abi::native<_Tp>>;
+template <class _Tp, int _Np>
+using fixed_size_simd = simd<_Tp, simd_abi::fixed_size<_Np>>;
+
+// class template simd_mask [simd.mask.class]
+template <class _Tp>
+using native_simd_mask = simd_mask<_Tp, simd_abi::native<_Tp>>;
+
+template <class _Tp, int _Np>
+using fixed_size_simd_mask = simd_mask<_Tp, simd_abi::fixed_size<_Np>>;
+
+// casts [simd.casts]
+template <class _Tp>
+struct __static_simd_cast_traits {
+  template <class _Up, class _Abi>
+  static simd<_Tp, _Abi> __apply(const simd<_Up, _Abi>& __v);
+};
+
+template <class _Tp, class _NewAbi>
+struct __static_simd_cast_traits<simd<_Tp, _NewAbi>> {
+  template <class _Up, class _Abi>
+  static typename std::enable_if<simd<_Up, _Abi>::size() ==
+                                     simd<_Tp, _NewAbi>::size(),
+                                 simd<_Tp, _NewAbi>>::type
+  __apply(const simd<_Up, _Abi>& __v);
+};
+
+template <class _Tp>
+struct __simd_cast_traits {
+  template <class _Up, class _Abi>
+  static typename std::enable_if<
+      __is_non_narrowing_arithmetic_convertible<_Up, _Tp>(),
+      simd<_Tp, _Abi>>::type
+  __apply(const simd<_Up, _Abi>& __v);
+};
+
+template <class _Tp, class _NewAbi>
+struct __simd_cast_traits<simd<_Tp, _NewAbi>> {
+  template <class _Up, class _Abi>
+  static typename std::enable_if<
+      __is_non_narrowing_arithmetic_convertible<_Up, _Tp>() &&
+          simd<_Up, _Abi>::size() == simd<_Tp, _NewAbi>::size(),
+      simd<_Tp, _NewAbi>>::type
+  __apply(const simd<_Up, _Abi>& __v);
+};
+
+template <class _Tp, class _Up, class _Abi>
+_LIBCPP_HIDE_FROM_ABI auto simd_cast(const simd<_Up, _Abi>& __v)
+    -> decltype(__simd_cast_traits<_Tp>::__apply(__v)) {
+  return __simd_cast_traits<_Tp>::__apply(__v);
+}
+
+template <class _Tp, class _Up, class _Abi>
+_LIBCPP_HIDE_FROM_ABI auto static_simd_cast(const simd<_Up, _Abi>& __v)
+    -> decltype(__static_simd_cast_traits<_Tp>::__apply(__v)) {
+  return __static_simd_cast_traits<_Tp>::__apply(__v);
+}
+
+template <class _Tp, class _Abi>
+fixed_size_simd<_Tp, simd_size<_Tp, _Abi>::value>
+to_fixed_size(const simd<_Tp, _Abi>&) noexcept;
+
+template <class _Tp, class _Abi>
+fixed_size_simd_mask<_Tp, simd_size<_Tp, _Abi>::value>
+to_fixed_size(const simd_mask<_Tp, _Abi>&) noexcept;
+
+template <class _Tp, size_t _Np>
+native_simd<_Tp> to_native(const fixed_size_simd<_Tp, _Np>&) noexcept;
+
+template <class _Tp, size_t _Np>
+native_simd_mask<_Tp> to_native(const fixed_size_simd_mask<_Tp, _Np>&) noexcept;
+
+template <class _Tp, size_t _Np>
+simd<_Tp> to_compatible(const fixed_size_simd<_Tp, _Np>&) noexcept;
+
+template <class _Tp, size_t _Np>
+simd_mask<_Tp> to_compatible(const fixed_size_simd_mask<_Tp, _Np>&) noexcept;
+
+template <size_t... __sizes, class _Tp, class _Abi>
+tuple<simd<_Tp, abi_for_size_t<_Tp, __sizes>>...> split(const simd<_Tp, _Abi>&);
+
+template <size_t... __sizes, class _Tp, class _Abi>
+tuple<simd_mask<_Tp, abi_for_size_t<_Tp, __sizes>>...>
+split(const simd_mask<_Tp, _Abi>&);
+
+template <class _SimdType, class _Abi>
+array<_SimdType, simd_size<typename _SimdType::value_type, _Abi>::value /
+                     _SimdType::size()>
+split(const simd<typename _SimdType::value_type, _Abi>&);
+
+template <class _SimdType, class _Abi>
+array<_SimdType, simd_size<typename _SimdType::value_type, _Abi>::value /
+                     _SimdType::size()>
+split(const simd_mask<typename _SimdType::value_type, _Abi>&);
+
+template <class _Tp, class... _Abis>
+simd<_Tp, abi_for_size_t<_Tp, experimental::__variadic_sum(simd_size<_Tp, _Abis>::value...)>>
+concat(const simd<_Tp, _Abis>&...);
+
+template <class _Tp, class... _Abis>
+simd_mask<_Tp,
+          abi_for_size_t<_Tp, experimental::__variadic_sum(simd_size<_Tp, _Abis>::value...)>>
+concat(const simd_mask<_Tp, _Abis>&...);
+
+// reductions [simd.mask.reductions]
+template <class _Tp, class _Abi>
+bool all_of(const simd_mask<_Tp, _Abi>&) noexcept;
+template <class _Tp, class _Abi>
+bool any_of(const simd_mask<_Tp, _Abi>&) noexcept;
+template <class _Tp, class _Abi>
+bool none_of(const simd_mask<_Tp, _Abi>&) noexcept;
+template <class _Tp, class _Abi>
+bool some_of(const simd_mask<_Tp, _Abi>&) noexcept;
+template <class _Tp, class _Abi>
+int popcount(const simd_mask<_Tp, _Abi>&) noexcept;
+template <class _Tp, class _Abi>
+int find_first_set(const simd_mask<_Tp, _Abi>&);
+template <class _Tp, class _Abi>
+int find_last_set(const simd_mask<_Tp, _Abi>&);
+bool all_of(bool) noexcept;
+bool any_of(bool) noexcept;
+bool none_of(bool) noexcept;
+bool some_of(bool) noexcept;
+int popcount(bool) noexcept;
+int find_first_set(bool) noexcept;
+int find_last_set(bool) noexcept;
+
+// masked assignment [simd.whereexpr]
+template <class _MaskType, class _Tp>
+class const_where_expression;
+template <class _MaskType, class _Tp>
+class where_expression;
+
+// masked assignment [simd.mask.where]
+template <class _Tp, class _Abi>
+where_expression<simd_mask<_Tp, _Abi>, simd<_Tp, _Abi>>
+where(const typename simd<_Tp, _Abi>::mask_type&, simd<_Tp, _Abi>&) noexcept;
+
+template <class _Tp, class _Abi>
+const_where_expression<simd_mask<_Tp, _Abi>, const simd<_Tp, _Abi>>
+where(const typename simd<_Tp, _Abi>::mask_type&,
+      const simd<_Tp, _Abi>&) noexcept;
+
+template <class _Tp, class _Abi>
+where_expression<simd_mask<_Tp, _Abi>, simd_mask<_Tp, _Abi>>
+where(const typename __nodeduce<simd_mask<_Tp, _Abi>>::type&,
+      simd_mask<_Tp, _Abi>&) noexcept;
+
+template <class _Tp, class _Abi>
+const_where_expression<simd_mask<_Tp, _Abi>, const simd_mask<_Tp, _Abi>>
+where(const typename __nodeduce<simd_mask<_Tp, _Abi>>::type&,
+      const simd_mask<_Tp, _Abi>&) noexcept;
+
+template <class _Tp>
+where_expression<bool, _Tp> where(bool, _Tp&) noexcept;
+
+template <class _Tp>
+const_where_expression<bool, const _Tp> where(bool, const _Tp&) noexcept;
+
+// reductions [simd.reductions]
+template <class _Tp, class _Abi, class _BinaryOp = std::plus<_Tp>>
+_Tp reduce(const simd<_Tp, _Abi>&, _BinaryOp = _BinaryOp());
+
+template <class _MaskType, class _SimdType, class _BinaryOp>
+typename _SimdType::value_type
+reduce(const const_where_expression<_MaskType, _SimdType>&,
+       typename _SimdType::value_type __neutral_element, _BinaryOp);
+
+template <class _MaskType, class _SimdType>
+typename _SimdType::value_type
+reduce(const const_where_expression<_MaskType, _SimdType>&,
+       plus<typename _SimdType::value_type> = {});
+
+template <class _MaskType, class _SimdType>
+typename _SimdType::value_type
+reduce(const const_where_expression<_MaskType, _SimdType>&,
+       multiplies<typename _SimdType::value_type>);
+
+template <class _MaskType, class _SimdType>
+typename _SimdType::value_type
+reduce(const const_where_expression<_MaskType, _SimdType>&,
+       bit_and<typename _SimdType::value_type>);
+
+template <class _MaskType, class _SimdType>
+typename _SimdType::value_type
+reduce(const const_where_expression<_MaskType, _SimdType>&,
+       bit_or<typename _SimdType::value_type>);
+
+template <class _MaskType, class _SimdType>
+typename _SimdType::value_type
+reduce(const const_where_expression<_MaskType, _SimdType>&,
+       bit_xor<typename _SimdType::value_type>);
+
+template <class _Tp, class _Abi>
+_Tp hmin(const simd<_Tp, _Abi>&);
+template <class _MaskType, class _SimdType>
+typename _SimdType::value_type
+hmin(const const_where_expression<_MaskType, _SimdType>&);
+template <class _Tp, class _Abi>
+_Tp hmax(const simd<_Tp, _Abi>&);
+template <class _MaskType, class _SimdType>
+typename _SimdType::value_type
+hmax(const const_where_expression<_MaskType, _SimdType>&);
+
+// algorithms [simd.alg]
+template <class _Tp, class _Abi>
+simd<_Tp, _Abi> min(const simd<_Tp, _Abi>&, const simd<_Tp, _Abi>&) noexcept;
+
+template <class _Tp, class _Abi>
+simd<_Tp, _Abi> max(const simd<_Tp, _Abi>&, const simd<_Tp, _Abi>&) noexcept;
+
+template <class _Tp, class _Abi>
+std::pair<simd<_Tp, _Abi>, simd<_Tp, _Abi>>
+minmax(const simd<_Tp, _Abi>&, const simd<_Tp, _Abi>&) noexcept;
+
+template <class _Tp, class _Abi>
+simd<_Tp, _Abi> clamp(const simd<_Tp, _Abi>&, const simd<_Tp, _Abi>&,
+                      const simd<_Tp, _Abi>&);
+
+// [simd.whereexpr]
+// TODO implement where expressions.
+template <class _MaskType, class _Tp>
+class const_where_expression {
+public:
+  const_where_expression(const const_where_expression&) = delete;
+  const_where_expression& operator=(const const_where_expression&) = delete;
+  __remove_const_t<_Tp> operator-() const&&;
+  template <class _Up, class _Flags>
+  void copy_to(_Up*, _Flags) const&&;
+};
+
+template <class _MaskType, class _Tp>
+class where_expression : public const_where_expression<_MaskType, _Tp> {
+public:
+  where_expression(const where_expression&) = delete;
+  where_expression& operator=(const where_expression&) = delete;
+  template <class _Up>
+  void operator=(_Up&&);
+  template <class _Up>
+  void operator+=(_Up&&);
+  template <class _Up>
+  void operator-=(_Up&&);
+  template <class _Up>
+  void operator*=(_Up&&);
+  template <class _Up>
+  void operator/=(_Up&&);
+  template <class _Up>
+  void operator%=(_Up&&);
+  template <class _Up>
+  void operator&=(_Up&&);
+  template <class _Up>
+  void operator|=(_Up&&);
+  template <class _Up>
+  void operator^=(_Up&&);
+  template <class _Up>
+  void operator<<=(_Up&&);
+  template <class _Up>
+  void operator>>=(_Up&&);
+  void operator++();
+  void operator++(int);
+  void operator--();
+  void operator--(int);
+  template <class _Up, class _Flags>
+  void copy_from(const _Up*, _Flags);
+};
+
+// [simd.class]
+// TODO: implement simd
+template <class _Tp, class _Abi>
+class simd {
+public:
+  using value_type = _Tp;
+  using reference = __simd_reference<_Tp, _Tp, _Abi>;
+  using mask_type = simd_mask<_Tp, _Abi>;
+  using abi_type = _Abi;
+
+  simd() = default;
+  simd(const simd&) = default;
+  simd& operator=(const simd&) = default;
+
+  static constexpr size_t size() noexcept {
+    return simd_size<_Tp, _Abi>::value;
+  }
+
+private:
+  __simd_storage<_Tp, _Abi> __s_;
+
+  template <class _Up>
+  static constexpr bool __can_broadcast() {
+    return (std::is_arithmetic<_Up>::value &&
+            __is_non_narrowing_arithmetic_convertible<_Up, _Tp>()) ||
+           (!std::is_arithmetic<_Up>::value &&
+            std::is_convertible<_Up, _Tp>::value) ||
+           std::is_same<__remove_const_t<_Up>, int>::value ||
+           (std::is_same<__remove_const_t<_Up>,
+                         unsigned int>::value &&
+            std::is_unsigned<_Tp>::value);
+  }
+
+  template <class _Generator, size_t... __indicies>
+  static constexpr decltype(
+      std::forward_as_tuple(std::declval<_Generator>()(
+          std::integral_constant<size_t, __indicies>())...),
+      bool())
+  __can_generate(std::index_sequence<__indicies...>) {
+    return !experimental::__variadic_sum<bool>(
+        !__can_broadcast<decltype(std::declval<_Generator>()(
+            std::integral_constant<size_t, __indicies>()))>()...);
+  }
+
+  template <class _Generator>
+  static bool __can_generate(...) {
+    return false;
+  }
+
+  template <class _Generator, size_t... __indicies>
+  void __generator_init(_Generator&& __g, std::index_sequence<__indicies...>) {
+    int __not_used[]{((*this)[__indicies] =
+                          __g(std::integral_constant<size_t, __indicies>()),
+                      0)...};
+    (void)__not_used;
+  }
+
+public:
+  // implicit type conversion constructor
+  template <class _Up,
+            class = typename std::enable_if<
+                std::is_same<_Abi, simd_abi::fixed_size<size()>>::value &&
+                __is_non_narrowing_arithmetic_convertible<_Up, _Tp>()>::type>
+  simd(const simd<_Up, simd_abi::fixed_size<size()>>& __v) {
+    for (size_t __i = 0; __i < size(); __i++) {
+      (*this)[__i] = static_cast<_Tp>(__v[__i]);
+    }
+  }
+
+  // implicit broadcast constructor
+  template <class _Up,
+            class = typename std::enable_if<__can_broadcast<_Up>()>::type>
+  simd(_Up&& __rv) {
+    auto __v = static_cast<_Tp>(__rv);
+    for (size_t __i = 0; __i < size(); __i++) {
+      (*this)[__i] = __v;
+    }
+  }
+
+  // generator constructor
+  template <class _Generator,
+            int = typename std::enable_if<
+                __can_generate<_Generator>(std::make_index_sequence<size()>()),
+                int>::type()>
+  explicit simd(_Generator&& __g) {
+    __generator_init(std::forward<_Generator>(__g),
+                     std::make_index_sequence<size()>());
+  }
+
+  // load constructor
+  template <
+      class _Up, class _Flags,
+      class = typename std::enable_if<__vectorizable<_Up>()>::type,
+      class = typename std::enable_if<is_simd_flag_type<_Flags>::value>::type>
+  simd(const _Up* __buffer, _Flags) {
+    // TODO: optimize for overaligned flags
+    for (size_t __i = 0; __i < size(); __i++) {
+      (*this)[__i] = static_cast<_Tp>(__buffer[__i]);
+    }
+  }
+
+  // loads [simd.load]
+  template <class _Up, class _Flags>
+  typename std::enable_if<__vectorizable<_Up>() &&
+                          is_simd_flag_type<_Flags>::value>::type
+  copy_from(const _Up* __buffer, _Flags) {
+    *this = simd(__buffer, _Flags());
+  }
+
+  // stores [simd.store]
+  template <class _Up, class _Flags>
+  typename std::enable_if<__vectorizable<_Up>() &&
+                          is_simd_flag_type<_Flags>::value>::type
+  copy_to(_Up* __buffer, _Flags) const {
+    // TODO: optimize for overaligned flags
+    for (size_t __i = 0; __i < size(); __i++) {
+      __buffer[__i] = static_cast<_Up>((*this)[__i]);
+    }
+  }
+
+  // scalar access [simd.subscr]
+  reference operator[](size_t __i) { return reference(&__s_, __i); }
+
+  value_type operator[](size_t __i) const { return __s_.__get(__i); }
+
+  // unary operators [simd.unary]
+  simd& operator++();
+  simd operator++(int);
+  simd& operator--();
+  simd operator--(int);
+  mask_type operator!() const;
+  simd operator~() const;
+  simd operator+() const;
+  simd operator-() const;
+
+#if 0
+  // binary operators [simd.binary]
+  friend simd operator+(const simd&, const simd&);
+  friend simd operator-(const simd&, const simd&);
+  friend simd operator*(const simd&, const simd&);
+  friend simd operator/(const simd&, const simd&);
+  friend simd operator%(const simd&, const simd&);
+  friend simd operator&(const simd&, const simd&);
+  friend simd operator|(const simd&, const simd&);
+  friend simd operator^(const simd&, const simd&);
+  friend simd operator<<(const simd&, const simd&);
+  friend simd operator>>(const simd&, const simd&);
+  friend simd operator<<(const simd&, int);
+  friend simd operator>>(const simd&, int);
+
+  // compound assignment [simd.cassign]
+  friend simd& operator+=(simd&, const simd&);
+  friend simd& operator-=(simd&, const simd&);
+  friend simd& operator*=(simd&, const simd&);
+  friend simd& operator/=(simd&, const simd&);
+  friend simd& operator%=(simd&, const simd&);
+
+  friend simd& operator&=(simd&, const simd&);
+  friend simd& operator|=(simd&, const simd&);
+  friend simd& operator^=(simd&, const simd&);
+  friend simd& operator<<=(simd&, const simd&);
+  friend simd& operator>>=(simd&, const simd&);
+  friend simd& operator<<=(simd&, int);
+  friend simd& operator>>=(simd&, int);
+
+  // compares [simd.comparison]
+  friend mask_type operator==(const simd&, const simd&);
+  friend mask_type operator!=(const simd&, const simd&);
+  friend mask_type operator>=(const simd&, const simd&);
+  friend mask_type operator<=(const simd&, const simd&);
+  friend mask_type operator>(const simd&, const simd&);
+  friend mask_type operator<(const simd&, const simd&);
+#endif
+};
+
+// [simd.mask.class]
+template <class _Tp, class _Abi>
+// TODO: implement simd_mask
+class simd_mask {
+public:
+  using value_type = bool;
+  // TODO: this is strawman implementation. Turn it into a proxy type.
+  using reference = bool&;
+  using simd_type = simd<_Tp, _Abi>;
+  using abi_type = _Abi;
+  static constexpr size_t size() noexcept;
+  simd_mask() = default;
+
+  // broadcast constructor
+  explicit simd_mask(value_type) noexcept;
+
+  // implicit type conversion constructor
+  template <class _Up>
+  simd_mask(const simd_mask<_Up, simd_abi::fixed_size<size()>>&) noexcept;
+
+  // load constructor
+  template <class _Flags>
+  simd_mask(const value_type*, _Flags);
+
+  // loads [simd.mask.copy]
+  template <class _Flags>
+  void copy_from(const value_type*, _Flags);
+  template <class _Flags>
+  void copy_to(value_type*, _Flags) const;
+
+  // scalar access [simd.mask.subscr]
+  reference operator[](size_t);
+  value_type operator[](size_t) const;
+
+  // unary operators [simd.mask.unary]
+  simd_mask operator!() const noexcept;
+
+#if 0
+  // simd_mask binary operators [simd.mask.binary]
+  friend simd_mask operator&&(const simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask operator||(const simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask operator&(const simd_mask&, const simd_mask&)noexcept;
+  friend simd_mask operator|(const simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask operator^(const simd_mask&, const simd_mask&) noexcept;
+
+  // simd_mask compound assignment [simd.mask.cassign]
+  friend simd_mask& operator&=(simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask& operator|=(simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask& operator^=(simd_mask&, const simd_mask&) noexcept;
+
+  // simd_mask compares [simd.mask.comparison]
+  friend simd_mask operator==(const simd_mask&, const simd_mask&) noexcept;
+  friend simd_mask operator!=(const simd_mask&, const simd_mask&) noexcept;
+#endif
+};
+
+#endif // _LIBCPP_STD_VER >= 17
+
+_LIBCPP_END_NAMESPACE_EXPERIMENTAL_SIMD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <algorithm>
+#  include <functional>
+#endif
+
+#endif /* _LIBCPP_EXPERIMENTAL_SIMD */
diff --git a/app/src/main/cpp/libcxx/include/experimental/string b/app/src/main/cpp/libcxx/include/experimental/string
new file mode 100644
index 0000000..4edbf98
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/string
@@ -0,0 +1,73 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_STRING
+#define _LIBCPP_EXPERIMENTAL_STRING
+
+/*
+    experimental/string synopsis
+
+// C++1z
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+namespace pmr {
+
+  // basic_string using polymorphic allocator in namespace pmr
+  template <class charT, class traits = char_traits<charT>>
+   using basic_string =
+     std::basic_string<charT, traits, polymorphic_allocator<charT>>;
+
+  // basic_string typedef names using polymorphic allocator in namespace
+  // std::experimental::pmr
+  typedef basic_string<char> string;
+  typedef basic_string<char16_t> u16string;
+  typedef basic_string<char32_t> u32string;
+  typedef basic_string<wchar_t> wstring;
+
+} // namespace pmr
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <experimental/__config>
+#include <experimental/memory_resource>
+#include <string>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR
+
+#ifndef _LIBCPP_CXX03_LANG
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+
+template <class _CharT, class _Traits = char_traits<_CharT>>
+using basic_string =
+    _VSTD::basic_string<_CharT, _Traits, polymorphic_allocator<_CharT>>;
+
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("string") typedef basic_string<char> string;
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("u16string") typedef basic_string<char16_t> u16string;
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("u32string") typedef basic_string<char32_t> u32string;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+_LIBCPP_DEPCREATED_MEMORY_RESOURCE("wstring") typedef basic_string<wchar_t> wstring;
+#endif
+
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_LFTS_PMR
+
+#endif /* _LIBCPP_EXPERIMENTAL_STRING */
diff --git a/app/src/main/cpp/libcxx/include/experimental/type_traits b/app/src/main/cpp/libcxx/include/experimental/type_traits
new file mode 100644
index 0000000..dd4c539
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/type_traits
@@ -0,0 +1,155 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_TYPE_TRAITS
+#define _LIBCPP_EXPERIMENTAL_TYPE_TRAITS
+
+/**
+    experimental/type_traits synopsis
+
+// C++1y
+#include <type_traits>
+
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+
+  // 3.3.2, Other type transformations
+  template <class> class invocation_type; // not defined
+  template <class F, class... ArgTypes> class invocation_type<F(ArgTypes...)>;
+  template <class> class raw_invocation_type; // not defined
+  template <class F, class... ArgTypes> class raw_invocation_type<F(ArgTypes...)>;
+
+  template <class T>
+    using invocation_type_t = typename invocation_type<T>::type;
+  template <class T>
+    using raw_invocation_type_t = typename raw_invocation_type<T>::type;
+
+  // 3.3.4, Detection idiom
+  template <class...> using void_t = void;
+
+  struct nonesuch {
+    nonesuch() = delete;
+    ~nonesuch() = delete;
+    nonesuch(nonesuch const&) = delete;
+    void operator=(nonesuch const&) = delete;
+  };
+
+  template <template<class...> class Op, class... Args>
+    using is_detected = see below;
+  template <template<class...> class Op, class... Args>
+    constexpr bool is_detected_v = is_detected<Op, Args...>::value;
+  template <template<class...> class Op, class... Args>
+    using detected_t = see below;
+  template <class Default, template<class...> class Op, class... Args>
+    using detected_or = see below;
+  template <class Default, template<class...> class Op, class... Args>
+    using detected_or_t = typename detected_or<Default, Op, Args...>::type;
+  template <class Expected, template<class...> class Op, class... Args>
+    using is_detected_exact = is_same<Expected, detected_t<Op, Args...>>;
+  template <class Expected, template<class...> class Op, class... Args>
+    constexpr bool is_detected_exact_v
+      = is_detected_exact<Expected, Op, Args...>::value;
+  template <class To, template<class...> class Op, class... Args>
+     using is_detected_convertible = is_convertible<detected_t<Op, Args...>, To>;
+  template <class To, template<class...> class Op, class... Args>
+     constexpr bool is_detected_convertible_v
+       = is_detected_convertible<To, Op, Args...>::value;
+
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <experimental/__config>
+
+#if _LIBCPP_STD_VER > 11
+
+#include <initializer_list>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS
+
+// 3.3.2, Other type transformations
+/*
+template <class>
+class _LIBCPP_TEMPLATE_VIS raw_invocation_type;
+
+template <class _Fn, class ..._Args>
+class _LIBCPP_TEMPLATE_VIS raw_invocation_type<_Fn(_Args...)>;
+
+template <class>
+class _LIBCPP_TEMPLATE_VIS invokation_type;
+
+template <class _Fn, class ..._Args>
+class _LIBCPP_TEMPLATE_VIS invokation_type<_Fn(_Args...)>;
+
+template <class _Tp>
+using invokation_type_t = typename invokation_type<_Tp>::type;
+
+template <class _Tp>
+using raw_invocation_type_t = typename raw_invocation_type<_Tp>::type;
+*/
+
+// 3.3.4, Detection idiom
+template <class...> using void_t = void;
+
+struct nonesuch : private __nat { // make nonesuch "not an aggregate"
+  ~nonesuch() = delete;
+  nonesuch      (nonesuch const&) = delete;
+  void operator=(nonesuch const&) = delete;
+  };
+
+template <class _Default, class _AlwaysVoid, template <class...> class _Op, class... _Args>
+struct _DETECTOR {
+   using value_t = false_type;
+   using type = _Default;
+   };
+
+template <class _Default, template <class...> class _Op, class... _Args>
+struct _DETECTOR<_Default, void_t<_Op<_Args...>>, _Op, _Args...> {
+   using value_t = true_type;
+   using type = _Op<_Args...>;
+   };
+
+
+template <template<class...> class _Op, class... _Args>
+  using is_detected = typename _DETECTOR<nonesuch, void, _Op, _Args...>::value_t;
+template <template<class...> class _Op, class... _Args>
+  using detected_t = typename _DETECTOR<nonesuch, void, _Op, _Args...>::type;
+template <template<class...> class _Op, class... _Args>
+  _LIBCPP_CONSTEXPR bool is_detected_v = is_detected<_Op, _Args...>::value;
+
+template <class Default, template<class...> class _Op, class... _Args>
+  using detected_or = _DETECTOR<Default, void, _Op, _Args...>;
+template <class Default, template<class...> class _Op, class... _Args>
+  using detected_or_t = typename detected_or<Default, _Op, _Args...>::type;
+
+template <class Expected, template<class...> class _Op, class... _Args>
+  using is_detected_exact = is_same<Expected, detected_t<_Op, _Args...>>;
+template <class Expected, template<class...> class _Op, class... _Args>
+  _LIBCPP_CONSTEXPR bool is_detected_exact_v = is_detected_exact<Expected, _Op, _Args...>::value;
+
+template <class To, template<class...> class _Op, class... _Args>
+  using is_detected_convertible = is_convertible<detected_t<_Op, _Args...>, To>;
+template <class To, template<class...> class _Op, class... _Args>
+  _LIBCPP_CONSTEXPR bool is_detected_convertible_v = is_detected_convertible<To, _Op, _Args...>::value;
+
+
+_LIBCPP_END_NAMESPACE_LFTS
+
+#endif /* _LIBCPP_STD_VER > 11 */
+
+#endif /* _LIBCPP_EXPERIMENTAL_TYPE_TRAITS */
diff --git a/app/src/main/cpp/libcxx/include/experimental/unordered_map b/app/src/main/cpp/libcxx/include/experimental/unordered_map
new file mode 100644
index 0000000..d280182
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/unordered_map
@@ -0,0 +1,78 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_UNORDERED_MAP
+#define _LIBCPP_EXPERIMENTAL_UNORDERED_MAP
+
+/*
+    experimental/unordered_map synopsis
+
+// C++1z
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+namespace pmr {
+
+  template <class Key, class T,
+            class Hash = hash<Key>,
+            class Pred = equal_to<Key>>
+  using unordered_map =
+    std::unordered_map<Key, T, Hash, Pred,
+                       polymorphic_allocator<pair<const Key,T>>>;
+
+  template <class Key, class T,
+            class Hash = hash<Key>,
+            class Pred = equal_to<Key>>
+  using unordered_multimap =
+    std::unordered_multimap<Key, T, Hash, Pred,
+                            polymorphic_allocator<pair<const Key,T>>>;
+
+} // namespace pmr
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <experimental/__config>
+#include <experimental/memory_resource>
+#include <unordered_map>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Value,
+          class _Hash = hash<_Key>, class _Pred = equal_to<_Key>>
+using unordered_map = _VSTD::unordered_map<_Key, _Value, _Hash, _Pred,
+                        polymorphic_allocator<pair<const _Key, _Value>>>;
+
+template <class _Key, class _Value,
+          class _Hash = hash<_Key>, class _Pred = equal_to<_Key>>
+using unordered_multimap = _VSTD::unordered_multimap<_Key, _Value, _Hash, _Pred,
+                        polymorphic_allocator<pair<const _Key, _Value>>>;
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_LFTS_PMR
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <algorithm>
+#  include <array>
+#  include <bit>
+#  include <functional>
+#  include <vector>
+#endif
+
+#endif /* _LIBCPP_EXPERIMENTAL_UNORDERED_MAP */
diff --git a/app/src/main/cpp/libcxx/include/experimental/unordered_set b/app/src/main/cpp/libcxx/include/experimental/unordered_set
new file mode 100644
index 0000000..493e3a0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/unordered_set
@@ -0,0 +1,64 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_UNORDERED_SET
+#define _LIBCPP_EXPERIMENTAL_UNORDERED_SET
+
+/*
+    experimental/unordered_set synopsis
+
+// C++1z
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+namespace pmr {
+
+  template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
+  using unordered_set = std::unordered_set<T, Hash, Pred,
+                       polymorphic_allocator<T>>;
+
+  template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
+  using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
+                       polymorphic_allocator<T>>;
+
+} // namespace pmr
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <experimental/__config>
+#include <experimental/memory_resource>
+#include <unordered_set>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Value,
+          class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
+using unordered_set = _VSTD::unordered_set<_Value, _Hash, _Pred,
+                        polymorphic_allocator<_Value>>;
+
+template <class _Value,
+          class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
+using unordered_multiset = _VSTD::unordered_multiset<_Value, _Hash, _Pred,
+                        polymorphic_allocator<_Value>>;
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_LFTS_PMR
+
+#endif /* _LIBCPP_EXPERIMENTAL_UNORDERED_SET */
diff --git a/app/src/main/cpp/libcxx/include/experimental/utility b/app/src/main/cpp/libcxx/include/experimental/utility
new file mode 100644
index 0000000..576b8be
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/utility
@@ -0,0 +1,47 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_UTILITY
+#define _LIBCPP_EXPERIMENTAL_UTILITY
+
+/*
+    experimental/utility synopsis
+
+// C++1y
+
+#include <utility>
+
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+
+  3.1.2, erased-type placeholder
+  struct erased_type { };
+
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <experimental/__config>
+#include <utility>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS
+
+  struct _LIBCPP_TEMPLATE_VIS erased_type { };
+
+_LIBCPP_END_NAMESPACE_LFTS
+
+#endif /* _LIBCPP_EXPERIMENTAL_UTILITY */
diff --git a/app/src/main/cpp/libcxx/include/experimental/vector b/app/src/main/cpp/libcxx/include/experimental/vector
new file mode 100644
index 0000000..2e9d77e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/experimental/vector
@@ -0,0 +1,52 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXPERIMENTAL_VECTOR
+#define _LIBCPP_EXPERIMENTAL_VECTOR
+
+/*
+    experimental/vector synopsis
+
+// C++1z
+namespace std {
+namespace experimental {
+inline namespace fundamentals_v1 {
+namespace pmr {
+
+  template <class T>
+  using vector = std::vector<T, polymorphic_allocator<T>>;
+
+} // namespace pmr
+} // namespace fundamentals_v1
+} // namespace experimental
+} // namespace std
+
+ */
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <experimental/__config>
+#include <experimental/memory_resource>
+#include <vector>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _ValueT>
+using vector = _VSTD::vector<_ValueT, polymorphic_allocator<_ValueT>>;
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_LFTS_PMR
+
+#endif /* _LIBCPP_EXPERIMENTAL_VECTOR */
diff --git a/app/src/main/cpp/libcxx/include/ext/__hash b/app/src/main/cpp/libcxx/include/ext/__hash
new file mode 100644
index 0000000..880d0ee
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/ext/__hash
@@ -0,0 +1,135 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_EXT_HASH
+#define _LIBCPP_EXT_HASH
+
+#  pragma GCC system_header
+
+#include <__config>
+#include <cstring>
+#include <stddef.h>
+#include <string>
+
+namespace __gnu_cxx {
+
+template <typename _Tp> struct _LIBCPP_TEMPLATE_VIS hash { };
+
+template <> struct _LIBCPP_TEMPLATE_VIS hash<const char*>
+ : public std::__unary_function<const char*, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const char *__c) const _NOEXCEPT
+    {
+        return std::__do_string_hash(__c, __c + strlen(__c));
+    }
+};
+
+template <> struct _LIBCPP_TEMPLATE_VIS hash<char *>
+ : public std::__unary_function<char*, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(char *__c) const _NOEXCEPT
+    {
+        return std::__do_string_hash<const char *>(__c, __c + strlen(__c));
+    }
+};
+
+template <> struct _LIBCPP_TEMPLATE_VIS hash<char>
+ : public std::__unary_function<char, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(char __c) const _NOEXCEPT
+    {
+        return __c;
+    }
+};
+
+template <> struct _LIBCPP_TEMPLATE_VIS hash<signed char>
+ : public std::__unary_function<signed char, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(signed char __c) const _NOEXCEPT
+    {
+        return __c;
+    }
+};
+
+template <> struct _LIBCPP_TEMPLATE_VIS hash<unsigned char>
+ : public std::__unary_function<unsigned char, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(unsigned char __c) const _NOEXCEPT
+    {
+        return __c;
+    }
+};
+
+template <> struct _LIBCPP_TEMPLATE_VIS hash<short>
+ : public std::__unary_function<short, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(short __c) const _NOEXCEPT
+    {
+        return __c;
+    }
+};
+
+template <> struct _LIBCPP_TEMPLATE_VIS hash<unsigned short>
+ : public std::__unary_function<unsigned short, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(unsigned short __c) const _NOEXCEPT
+    {
+        return __c;
+    }
+};
+
+template <> struct _LIBCPP_TEMPLATE_VIS hash<int>
+    : public std::__unary_function<int, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(int __c) const _NOEXCEPT
+    {
+        return __c;
+    }
+};
+
+template <> struct _LIBCPP_TEMPLATE_VIS hash<unsigned int>
+    : public std::__unary_function<unsigned int, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(unsigned int __c) const _NOEXCEPT
+    {
+        return __c;
+    }
+};
+
+template <> struct _LIBCPP_TEMPLATE_VIS hash<long>
+    : public std::__unary_function<long, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(long __c) const _NOEXCEPT
+    {
+        return __c;
+    }
+};
+
+template <> struct _LIBCPP_TEMPLATE_VIS hash<unsigned long>
+    : public std::__unary_function<unsigned long, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(unsigned long __c) const _NOEXCEPT
+    {
+        return __c;
+    }
+};
+} // namespace __gnu_cxx
+
+#endif // _LIBCPP_EXT_HASH
diff --git a/app/src/main/cpp/libcxx/include/ext/hash_map b/app/src/main/cpp/libcxx/include/ext/hash_map
new file mode 100644
index 0000000..3ad4b16
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/ext/hash_map
@@ -0,0 +1,990 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_HASH_MAP
+#define _LIBCPP_HASH_MAP
+
+/*
+
+    hash_map synopsis
+
+namespace __gnu_cxx
+{
+
+template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
+          class Alloc = allocator<pair<const Key, T>>>
+class hash_map
+{
+public:
+    // types
+    typedef Key                                                        key_type;
+    typedef T                                                          mapped_type;
+    typedef Hash                                                       hasher;
+    typedef Pred                                                       key_equal;
+    typedef Alloc                                                      allocator_type;
+    typedef pair<const key_type, mapped_type>                          value_type;
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+    typedef typename allocator_traits<allocator_type>::pointer         pointer;
+    typedef typename allocator_traits<allocator_type>::const_pointer   const_pointer;
+    typedef typename allocator_traits<allocator_type>::size_type       size_type;
+    typedef typename allocator_traits<allocator_type>::difference_type difference_type;
+
+    typedef /unspecified/ iterator;
+    typedef /unspecified/ const_iterator;
+
+    hash_map();
+    explicit hash_map(size_type n, const hasher& hf = hasher(),
+                           const key_equal& eql = key_equal(),
+                           const allocator_type& a = allocator_type());
+    template <class InputIterator>
+    hash_map(InputIterator f, InputIterator l);
+    template <class InputIterator>
+    hash_map(InputIterator f, InputIterator l,
+                size_type n, const hasher& hf = hasher(),
+                const key_equal& eql = key_equal(),
+                const allocator_type& a = allocator_type());
+    hash_map(const hash_map&);
+    ~hash_map();
+    hash_map& operator=(const hash_map&);
+
+    allocator_type get_allocator() const;
+
+    bool      empty() const;
+    size_type size() const;
+    size_type max_size() const;
+
+    iterator       begin();
+    iterator       end();
+    const_iterator begin()  const;
+    const_iterator end()    const;
+
+    pair<iterator, bool> insert(const value_type& obj);
+    template <class InputIterator>
+        void insert(InputIterator first, InputIterator last);
+
+    void erase(const_iterator position);
+    size_type erase(const key_type& k);
+    void erase(const_iterator first, const_iterator last);
+    void clear();
+
+    void swap(hash_map&);
+
+    hasher hash_funct() const;
+    key_equal key_eq() const;
+
+    iterator       find(const key_type& k);
+    const_iterator find(const key_type& k) const;
+    size_type count(const key_type& k) const;
+    pair<iterator, iterator>             equal_range(const key_type& k);
+    pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
+
+    mapped_type& operator[](const key_type& k);
+
+    size_type bucket_count() const;
+    size_type max_bucket_count() const;
+
+    size_type elems_in_bucket(size_type n) const;
+
+    void resize(size_type n);
+};
+
+template <class Key, class T, class Hash, class Pred, class Alloc>
+    void swap(hash_map<Key, T, Hash, Pred, Alloc>& x,
+              hash_map<Key, T, Hash, Pred, Alloc>& y);
+
+template <class Key, class T, class Hash, class Pred, class Alloc>
+    bool
+    operator==(const hash_map<Key, T, Hash, Pred, Alloc>& x,
+               const hash_map<Key, T, Hash, Pred, Alloc>& y);
+
+template <class Key, class T, class Hash, class Pred, class Alloc>
+    bool
+    operator!=(const hash_map<Key, T, Hash, Pred, Alloc>& x,
+               const hash_map<Key, T, Hash, Pred, Alloc>& y);
+
+template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
+          class Alloc = allocator<pair<const Key, T>>>
+class hash_multimap
+{
+public:
+    // types
+    typedef Key                                                        key_type;
+    typedef T                                                          mapped_type;
+    typedef Hash                                                       hasher;
+    typedef Pred                                                       key_equal;
+    typedef Alloc                                                      allocator_type;
+    typedef pair<const key_type, mapped_type>                          value_type;
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+    typedef typename allocator_traits<allocator_type>::pointer         pointer;
+    typedef typename allocator_traits<allocator_type>::const_pointer   const_pointer;
+    typedef typename allocator_traits<allocator_type>::size_type       size_type;
+    typedef typename allocator_traits<allocator_type>::difference_type difference_type;
+
+    typedef /unspecified/ iterator;
+    typedef /unspecified/ const_iterator;
+
+    explicit hash_multimap(size_type n = 193, const hasher& hf = hasher(),
+                           const key_equal& eql = key_equal(),
+                           const allocator_type& a = allocator_type());
+    template <class InputIterator>
+        hash_multimap(InputIterator f, InputIterator l,
+                      size_type n = 193, const hasher& hf = hasher(),
+                      const key_equal& eql = key_equal(),
+                      const allocator_type& a = allocator_type());
+    explicit hash_multimap(const allocator_type&);
+    hash_multimap(const hash_multimap&);
+    ~hash_multimap();
+    hash_multimap& operator=(const hash_multimap&);
+
+    allocator_type get_allocator() const;
+
+    bool      empty() const;
+    size_type size() const;
+    size_type max_size() const;
+
+    iterator       begin();
+    iterator       end();
+    const_iterator begin()  const;
+    const_iterator end()    const;
+
+    iterator insert(const value_type& obj);
+    template <class InputIterator>
+        void insert(InputIterator first, InputIterator last);
+
+    void erase(const_iterator position);
+    size_type erase(const key_type& k);
+    void erase(const_iterator first, const_iterator last);
+    void clear();
+
+    void swap(hash_multimap&);
+
+    hasher hash_funct() const;
+    key_equal key_eq() const;
+
+    iterator       find(const key_type& k);
+    const_iterator find(const key_type& k) const;
+    size_type count(const key_type& k) const;
+    pair<iterator, iterator>             equal_range(const key_type& k);
+    pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
+
+    size_type bucket_count() const;
+    size_type max_bucket_count() const;
+
+    size_type elems_in_bucket(size_type n) const;
+
+    void resize(size_type n);
+};
+
+template <class Key, class T, class Hash, class Pred, class Alloc>
+    void swap(hash_multimap<Key, T, Hash, Pred, Alloc>& x,
+              hash_multimap<Key, T, Hash, Pred, Alloc>& y);
+
+template <class Key, class T, class Hash, class Pred, class Alloc>
+    bool
+    operator==(const hash_multimap<Key, T, Hash, Pred, Alloc>& x,
+               const hash_multimap<Key, T, Hash, Pred, Alloc>& y);
+
+template <class Key, class T, class Hash, class Pred, class Alloc>
+    bool
+    operator!=(const hash_multimap<Key, T, Hash, Pred, Alloc>& x,
+               const hash_multimap<Key, T, Hash, Pred, Alloc>& y);
+
+}  // __gnu_cxx
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__hash_table>
+#include <algorithm>
+#include <ext/__hash>
+#include <functional>
+#include <stdexcept>
+#include <type_traits>
+
+#if defined(__DEPRECATED) && __DEPRECATED
+#if defined(_LIBCPP_WARNING)
+    _LIBCPP_WARNING("Use of the header <ext/hash_map> is deprecated.  Migrate to <unordered_map>")
+#else
+#   warning Use of the header <ext/hash_map> is deprecated.  Migrate to <unordered_map>
+#endif
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+namespace __gnu_cxx {
+
+template <class _Tp, class _Hash,
+          bool = std::is_empty<_Hash>::value && !std::__libcpp_is_final<_Hash>::value
+        >
+class __hash_map_hasher
+    : private _Hash
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY __hash_map_hasher() : _Hash() {}
+    _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : _Hash(__h) {}
+    _LIBCPP_INLINE_VISIBILITY const _Hash& hash_function() const {return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const _Tp& __x) const
+        {return static_cast<const _Hash&>(*this)(__x.first);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const typename _Tp::first_type& __x) const
+        {return static_cast<const _Hash&>(*this)(__x);}
+};
+
+template <class _Tp, class _Hash>
+class __hash_map_hasher<_Tp, _Hash, false>
+{
+    _Hash __hash_;
+public:
+    _LIBCPP_INLINE_VISIBILITY __hash_map_hasher() : __hash_() {}
+    _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : __hash_(__h) {}
+    _LIBCPP_INLINE_VISIBILITY const _Hash& hash_function() const {return __hash_;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const _Tp& __x) const
+        {return __hash_(__x.first);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const typename _Tp::first_type& __x) const
+        {return __hash_(__x);}
+};
+
+template <class _Tp, class _Pred,
+          bool = std::is_empty<_Pred>::value && !std::__libcpp_is_final<_Pred>::value
+         >
+class __hash_map_equal
+    : private _Pred
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY __hash_map_equal() : _Pred() {}
+    _LIBCPP_INLINE_VISIBILITY __hash_map_equal(const _Pred& __p) : _Pred(__p) {}
+    _LIBCPP_INLINE_VISIBILITY const _Pred& key_eq() const {return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x, const _Tp& __y) const
+        {return static_cast<const _Pred&>(*this)(__x.first, __y.first);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const typename _Tp::first_type& __x, const _Tp& __y) const
+        {return static_cast<const _Pred&>(*this)(__x, __y.first);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x, const typename _Tp::first_type& __y) const
+        {return static_cast<const _Pred&>(*this)(__x.first, __y);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const typename _Tp::first_type& __x,
+                    const typename _Tp::first_type& __y) const
+        {return static_cast<const _Pred&>(*this)(__x, __y);}
+};
+
+template <class _Tp, class _Pred>
+class __hash_map_equal<_Tp, _Pred, false>
+{
+    _Pred __pred_;
+public:
+    _LIBCPP_INLINE_VISIBILITY __hash_map_equal() : __pred_() {}
+    _LIBCPP_INLINE_VISIBILITY __hash_map_equal(const _Pred& __p) : __pred_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY const _Pred& key_eq() const {return __pred_;}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x, const _Tp& __y) const
+        {return __pred_(__x.first, __y.first);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const typename _Tp::first_type& __x, const _Tp& __y) const
+        {return __pred_(__x, __y.first);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Tp& __x, const typename _Tp::first_type& __y) const
+        {return __pred_(__x.first, __y);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const typename _Tp::first_type& __x,
+                    const typename _Tp::first_type& __y) const
+        {return __pred_(__x, __y);}
+};
+
+template <class _Alloc>
+class __hash_map_node_destructor
+{
+    typedef _Alloc                              allocator_type;
+    typedef std::allocator_traits<allocator_type>    __alloc_traits;
+    typedef typename __alloc_traits::value_type::__node_value_type value_type;
+public:
+    typedef typename __alloc_traits::pointer    pointer;
+private:
+    typedef typename value_type::first_type     first_type;
+    typedef typename value_type::second_type    second_type;
+
+    allocator_type& __na_;
+
+public:
+    bool __first_constructed;
+    bool __second_constructed;
+
+    __hash_map_node_destructor(__hash_map_node_destructor const&) = default;
+    __hash_map_node_destructor& operator=(const __hash_map_node_destructor&) = delete;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __hash_map_node_destructor(allocator_type& __na)
+        : __na_(__na),
+          __first_constructed(false),
+          __second_constructed(false)
+        {}
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_node_destructor(std::__hash_node_destructor<allocator_type>&& __x)
+        : __na_(__x.__na_),
+          __first_constructed(__x.__value_constructed),
+          __second_constructed(__x.__value_constructed)
+        {
+            __x.__value_constructed = false;
+        }
+#else  // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_node_destructor(const std::__hash_node_destructor<allocator_type>& __x)
+        : __na_(__x.__na_),
+          __first_constructed(__x.__value_constructed),
+          __second_constructed(__x.__value_constructed)
+        {
+            const_cast<bool&>(__x.__value_constructed) = false;
+        }
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator()(pointer __p)
+    {
+        if (__second_constructed)
+            __alloc_traits::destroy(__na_, _VSTD::addressof(__p->__value_.second));
+        if (__first_constructed)
+            __alloc_traits::destroy(__na_, _VSTD::addressof(__p->__value_.first));
+        if (__p)
+            __alloc_traits::deallocate(__na_, __p, 1);
+    }
+};
+
+template <class _HashIterator>
+class _LIBCPP_TEMPLATE_VIS __hash_map_iterator
+{
+    _HashIterator __i_;
+
+    typedef const typename _HashIterator::value_type::first_type key_type;
+    typedef typename _HashIterator::value_type::second_type      mapped_type;
+public:
+    typedef std::forward_iterator_tag                            iterator_category;
+    typedef std::pair<key_type, mapped_type>                     value_type;
+    typedef typename _HashIterator::difference_type              difference_type;
+    typedef value_type&                                          reference;
+    typedef std::__rebind_pointer_t<typename _HashIterator::pointer, value_type>
+        pointer;
+
+    _LIBCPP_INLINE_VISIBILITY __hash_map_iterator() {}
+
+    _LIBCPP_INLINE_VISIBILITY __hash_map_iterator(_HashIterator __i) : __i_(__i) {}
+
+    _LIBCPP_INLINE_VISIBILITY reference operator*() const {return *operator->();}
+    _LIBCPP_INLINE_VISIBILITY pointer operator->() const {return (pointer)__i_.operator->();}
+
+    _LIBCPP_INLINE_VISIBILITY __hash_map_iterator& operator++() {++__i_; return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_iterator operator++(int)
+    {
+        __hash_map_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const __hash_map_iterator& __x, const __hash_map_iterator& __y)
+        {return __x.__i_ == __y.__i_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const __hash_map_iterator& __x, const __hash_map_iterator& __y)
+        {return __x.__i_ != __y.__i_;}
+
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS hash_map;
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS hash_multimap;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_const_iterator;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator;
+};
+
+template <class _HashIterator>
+class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator
+{
+    _HashIterator __i_;
+
+    typedef const typename _HashIterator::value_type::first_type key_type;
+    typedef typename _HashIterator::value_type::second_type      mapped_type;
+public:
+    typedef std::forward_iterator_tag                            iterator_category;
+    typedef std::pair<key_type, mapped_type>                     value_type;
+    typedef typename _HashIterator::difference_type              difference_type;
+    typedef const value_type&                                    reference;
+    typedef std::__rebind_pointer_t<typename _HashIterator::pointer, const value_type>
+        pointer;
+
+    _LIBCPP_INLINE_VISIBILITY __hash_map_const_iterator() {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_const_iterator(_HashIterator __i) : __i_(__i) {}
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_const_iterator(
+            __hash_map_iterator<typename _HashIterator::__non_const_iterator> __i)
+                : __i_(__i.__i_) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const {return *operator->();}
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const {return (pointer)__i_.operator->();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_const_iterator& operator++() {++__i_; return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_const_iterator operator++(int)
+    {
+        __hash_map_const_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const __hash_map_const_iterator& __x, const __hash_map_const_iterator& __y)
+        {return __x.__i_ == __y.__i_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const __hash_map_const_iterator& __x, const __hash_map_const_iterator& __y)
+        {return __x.__i_ != __y.__i_;}
+
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS hash_map;
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS hash_multimap;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_const_iterator;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator;
+};
+
+template <class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>,
+          class _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
+class _LIBCPP_TEMPLATE_VIS hash_map
+{
+public:
+    // types
+    typedef _Key                                           key_type;
+    typedef _Tp                                            mapped_type;
+    typedef _Tp                                            data_type;
+    typedef _Hash                                          hasher;
+    typedef _Pred                                          key_equal;
+    typedef _Alloc                                         allocator_type;
+    typedef std::pair<const key_type, mapped_type>         value_type;
+    typedef value_type&                                    reference;
+    typedef const value_type&                              const_reference;
+
+private:
+    typedef std::pair<key_type, mapped_type>                    __value_type;
+    typedef __hash_map_hasher<__value_type, hasher>   __hasher;
+    typedef __hash_map_equal<__value_type, key_equal> __key_equal;
+    typedef std::__rebind_alloc<std::allocator_traits<allocator_type>, __value_type> __allocator_type;
+
+    typedef std::__hash_table<__value_type, __hasher,
+                         __key_equal,  __allocator_type>   __table;
+
+    __table __table_;
+
+    typedef typename __table::__node_pointer               __node_pointer;
+    typedef typename __table::__node_const_pointer         __node_const_pointer;
+    typedef typename __table::__node_traits                __node_traits;
+    typedef typename __table::__node_allocator             __node_allocator;
+    typedef typename __table::__node                       __node;
+    typedef __hash_map_node_destructor<__node_allocator>   _Dp;
+    typedef std::unique_ptr<__node, _Dp>                   __node_holder;
+    typedef std::allocator_traits<allocator_type>          __alloc_traits;
+public:
+    typedef typename __alloc_traits::pointer         pointer;
+    typedef typename __alloc_traits::const_pointer   const_pointer;
+    typedef typename __alloc_traits::size_type       size_type;
+    typedef typename __alloc_traits::difference_type difference_type;
+
+    typedef __hash_map_iterator<typename __table::iterator>       iterator;
+    typedef __hash_map_const_iterator<typename __table::const_iterator> const_iterator;
+
+    _LIBCPP_INLINE_VISIBILITY hash_map() { }
+    explicit hash_map(size_type __n, const hasher& __hf = hasher(),
+                           const key_equal& __eql = key_equal());
+    hash_map(size_type __n, const hasher& __hf,
+                  const key_equal& __eql,
+                  const allocator_type& __a);
+    template <class _InputIterator>
+        hash_map(_InputIterator __first, _InputIterator __last);
+    template <class _InputIterator>
+        hash_map(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf = hasher(),
+                      const key_equal& __eql = key_equal());
+    template <class _InputIterator>
+        hash_map(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf,
+                      const key_equal& __eql,
+                      const allocator_type& __a);
+    hash_map(const hash_map& __u);
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const
+        {return allocator_type(__table_.__node_alloc());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool      empty() const {return __table_.size() == 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const  {return __table_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const {return __table_.max_size();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       begin()        {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       end()          {return __table_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin()  const {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end()    const {return __table_.end();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    std::pair<iterator, bool> insert(const value_type& __x)
+        {return __table_.__insert_unique(__x);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator, const value_type& __x) {return insert(__x).first;}
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        void insert(_InputIterator __first, _InputIterator __last);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void erase(const_iterator __p) {__table_.erase(__p.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    void erase(const_iterator __first, const_iterator __last)
+        {__table_.erase(__first.__i_, __last.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() {__table_.clear();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(hash_map& __u) {__table_.swap(__u.__table_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    hasher hash_funct() const
+        {return __table_.hash_function().hash_function();}
+    _LIBCPP_INLINE_VISIBILITY
+    key_equal key_eq() const
+        {return __table_.key_eq().key_eq();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       find(const key_type& __k)       {return __table_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const key_type& __k) const {return __table_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    std::pair<iterator, iterator>             equal_range(const key_type& __k)
+        {return __table_.__equal_range_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    std::pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
+        {return __table_.__equal_range_unique(__k);}
+
+    mapped_type& operator[](const key_type& __k);
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_count() const {return __table_.bucket_count();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_bucket_count() const {return __table_.max_bucket_count();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type elems_in_bucket(size_type __n) const
+        {return __table_.bucket_size(__n);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void resize(size_type __n) {__table_.__rehash_unique(__n);}
+
+private:
+    __node_holder __construct_node(const key_type& __k);
+};
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
+        size_type __n, const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    __table_.__rehash_unique(__n);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
+        size_type __n, const hasher& __hf, const key_equal& __eql,
+        const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    __table_.__rehash_unique(__n);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
+        _InputIterator __first, _InputIterator __last)
+{
+    insert(__first, __last);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    __table_.__rehash_unique(__n);
+    insert(__first, __last);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    __table_.__rehash_unique(__n);
+    insert(__first, __last);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
+        const hash_map& __u)
+    : __table_(__u.__table_)
+{
+    __table_.__rehash_unique(__u.bucket_count());
+    insert(__u.begin(), __u.end());
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+typename hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__node_holder
+hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__construct_node(const key_type& __k)
+{
+    __node_allocator& __na = __table_.__node_alloc();
+    __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
+    __node_traits::construct(__na, _VSTD::addressof(__h->__value_.first), __k);
+    __h.get_deleter().__first_constructed = true;
+    __node_traits::construct(__na, _VSTD::addressof(__h->__value_.second));
+    __h.get_deleter().__second_constructed = true;
+    return __h;
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+inline
+void
+hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
+                                                       _InputIterator __last)
+{
+    for (; __first != __last; ++__first)
+        __table_.__insert_unique(*__first);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+_Tp&
+hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k)
+{
+    iterator __i = find(__k);
+    if (__i != end())
+        return __i->second;
+    __node_holder __h = __construct_node(__k);
+    std::pair<iterator, bool> __r = __table_.__node_insert_unique(__h.get());
+    __h.release();
+    return __r.first->second;
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
+     hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
+{
+    __x.swap(__y);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(const hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
+           const hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
+{
+    if (__x.size() != __y.size())
+        return false;
+    typedef typename hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator
+                                                                 const_iterator;
+    for (const_iterator __i = __x.begin(), __ex = __x.end(), __ey = __y.end();
+            __i != __ex; ++__i)
+    {
+        const_iterator __j = __y.find(__i->first);
+        if (__j == __ey || !(*__i == *__j))
+            return false;
+    }
+    return true;
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
+           const hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>,
+          class _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
+class _LIBCPP_TEMPLATE_VIS hash_multimap
+{
+public:
+    // types
+    typedef _Key                                           key_type;
+    typedef _Tp                                            mapped_type;
+    typedef _Tp                                            data_type;
+    typedef _Hash                                          hasher;
+    typedef _Pred                                          key_equal;
+    typedef _Alloc                                         allocator_type;
+    typedef std::pair<const key_type, mapped_type>         value_type;
+    typedef value_type&                                    reference;
+    typedef const value_type&                              const_reference;
+
+private:
+    typedef std::pair<key_type, mapped_type>               __value_type;
+    typedef __hash_map_hasher<__value_type, hasher>   __hasher;
+    typedef __hash_map_equal<__value_type, key_equal> __key_equal;
+    typedef std::__rebind_alloc<std::allocator_traits<allocator_type>, __value_type> __allocator_type;
+
+    typedef std::__hash_table<__value_type, __hasher,
+                         __key_equal,  __allocator_type>   __table;
+
+    __table __table_;
+
+    typedef typename __table::__node_traits                __node_traits;
+    typedef typename __table::__node_allocator             __node_allocator;
+    typedef typename __table::__node                       __node;
+    typedef __hash_map_node_destructor<__node_allocator>   _Dp;
+    typedef std::unique_ptr<__node, _Dp>                         __node_holder;
+    typedef std::allocator_traits<allocator_type>               __alloc_traits;
+public:
+    typedef typename __alloc_traits::pointer         pointer;
+    typedef typename __alloc_traits::const_pointer   const_pointer;
+    typedef typename __alloc_traits::size_type       size_type;
+    typedef typename __alloc_traits::difference_type difference_type;
+
+    typedef __hash_map_iterator<typename __table::iterator>       iterator;
+    typedef __hash_map_const_iterator<typename __table::const_iterator> const_iterator;
+
+    _LIBCPP_INLINE_VISIBILITY
+    hash_multimap() { }
+    explicit hash_multimap(size_type __n, const hasher& __hf = hasher(),
+                                const key_equal& __eql = key_equal());
+    hash_multimap(size_type __n, const hasher& __hf,
+                                const key_equal& __eql,
+                                const allocator_type& __a);
+    template <class _InputIterator>
+        hash_multimap(_InputIterator __first, _InputIterator __last);
+    template <class _InputIterator>
+        hash_multimap(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf = hasher(),
+                      const key_equal& __eql = key_equal());
+    template <class _InputIterator>
+        hash_multimap(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf,
+                      const key_equal& __eql,
+                      const allocator_type& __a);
+    hash_multimap(const hash_multimap& __u);
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const
+        {return allocator_type(__table_.__node_alloc());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool      empty() const {return __table_.size() == 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const  {return __table_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const {return __table_.max_size();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       begin()        {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       end()          {return __table_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin()  const {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end()    const {return __table_.end();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const value_type& __x) {return __table_.__insert_multi(__x);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator, const value_type& __x) {return insert(__x);}
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        void insert(_InputIterator __first, _InputIterator __last);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void erase(const_iterator __p) {__table_.erase(__p.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    void erase(const_iterator __first, const_iterator __last)
+        {__table_.erase(__first.__i_, __last.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() {__table_.clear();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(hash_multimap& __u) {__table_.swap(__u.__table_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    hasher hash_funct() const
+        {return __table_.hash_function().hash_function();}
+    _LIBCPP_INLINE_VISIBILITY
+    key_equal key_eq() const
+        {return __table_.key_eq().key_eq();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       find(const key_type& __k)       {return __table_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const key_type& __k) const {return __table_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type count(const key_type& __k) const {return __table_.__count_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    std::pair<iterator, iterator>             equal_range(const key_type& __k)
+        {return __table_.__equal_range_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    std::pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
+        {return __table_.__equal_range_multi(__k);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_count() const {return __table_.bucket_count();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_bucket_count() const {return __table_.max_bucket_count();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type elems_in_bucket(size_type __n) const
+        {return __table_.bucket_size(__n);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void resize(size_type __n) {__table_.__rehash_multi(__n);}
+};
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_multimap(
+        size_type __n, const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    __table_.__rehash_multi(__n);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_multimap(
+        size_type __n, const hasher& __hf, const key_equal& __eql,
+        const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    __table_.__rehash_multi(__n);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_multimap(
+        _InputIterator __first, _InputIterator __last)
+{
+    insert(__first, __last);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_multimap(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    __table_.__rehash_multi(__n);
+    insert(__first, __last);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_multimap(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    __table_.__rehash_multi(__n);
+    insert(__first, __last);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_multimap(
+        const hash_multimap& __u)
+    : __table_(__u.__table_)
+{
+    __table_.__rehash_multi(__u.bucket_count());
+    insert(__u.begin(), __u.end());
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+inline
+void
+hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
+                                                            _InputIterator __last)
+{
+    for (; __first != __last; ++__first)
+        __table_.__insert_multi(*__first);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
+     hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
+{
+    __x.swap(__y);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(const hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
+           const hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
+{
+    if (__x.size() != __y.size())
+        return false;
+    typedef typename hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator
+                                                                 const_iterator;
+    typedef std::pair<const_iterator, const_iterator> _EqRng;
+    for (const_iterator __i = __x.begin(), __ex = __x.end(); __i != __ex;)
+    {
+        _EqRng __xeq = __x.equal_range(__i->first);
+        _EqRng __yeq = __y.equal_range(__i->first);
+        if (_VSTD::distance(__xeq.first, __xeq.second) !=
+            _VSTD::distance(__yeq.first, __yeq.second) ||
+                  !_VSTD::is_permutation(__xeq.first, __xeq.second, __yeq.first))
+            return false;
+        __i = __xeq.second;
+    }
+    return true;
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
+           const hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
+{
+    return !(__x == __y);
+}
+
+} // namespace __gnu_cxx
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <iterator>
+#endif
+
+#endif // _LIBCPP_HASH_MAP
diff --git a/app/src/main/cpp/libcxx/include/ext/hash_set b/app/src/main/cpp/libcxx/include/ext/hash_set
new file mode 100644
index 0000000..dc8b786
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/ext/hash_set
@@ -0,0 +1,670 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_HASH_SET
+#define _LIBCPP_HASH_SET
+
+/*
+
+    hash_set synopsis
+
+namespace __gnu_cxx
+{
+
+template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
+          class Alloc = allocator<Value>>
+class hash_set
+{
+public:
+    // types
+    typedef Value                                                      key_type;
+    typedef key_type                                                   value_type;
+    typedef Hash                                                       hasher;
+    typedef Pred                                                       key_equal;
+    typedef Alloc                                                      allocator_type;
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+    typedef typename allocator_traits<allocator_type>::pointer         pointer;
+    typedef typename allocator_traits<allocator_type>::const_pointer   const_pointer;
+    typedef typename allocator_traits<allocator_type>::size_type       size_type;
+    typedef typename allocator_traits<allocator_type>::difference_type difference_type;
+
+    typedef /unspecified/ iterator;
+    typedef /unspecified/ const_iterator;
+
+    explicit hash_set(size_type n = 193, const hasher& hf = hasher(),
+                           const key_equal& eql = key_equal(),
+                           const allocator_type& a = allocator_type());
+    template <class InputIterator>
+        hash_set(InputIterator f, InputIterator l,
+                      size_type n = 193, const hasher& hf = hasher(),
+                      const key_equal& eql = key_equal(),
+                      const allocator_type& a = allocator_type());
+    hash_set(const hash_set&);
+    ~hash_set();
+    hash_set& operator=(const hash_set&);
+
+    allocator_type get_allocator() const;
+
+    bool      empty() const;
+    size_type size() const;
+    size_type max_size() const;
+
+    iterator       begin();
+    iterator       end();
+    const_iterator begin()  const;
+    const_iterator end()    const;
+
+    pair<iterator, bool> insert(const value_type& obj);
+    template <class InputIterator>
+        void insert(InputIterator first, InputIterator last);
+
+    void erase(const_iterator position);
+    size_type erase(const key_type& k);
+    void erase(const_iterator first, const_iterator last);
+    void clear();
+
+    void swap(hash_set&);
+
+    hasher hash_funct() const;
+    key_equal key_eq() const;
+
+    iterator       find(const key_type& k);
+    const_iterator find(const key_type& k) const;
+    size_type count(const key_type& k) const;
+    pair<iterator, iterator>             equal_range(const key_type& k);
+    pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
+
+    size_type bucket_count() const;
+    size_type max_bucket_count() const;
+
+    size_type elems_in_bucket(size_type n) const;
+
+    void resize(size_type n);
+};
+
+template <class Value, class Hash, class Pred, class Alloc>
+    void swap(hash_set<Value, Hash, Pred, Alloc>& x,
+              hash_set<Value, Hash, Pred, Alloc>& y);
+
+template <class Value, class Hash, class Pred, class Alloc>
+    bool
+    operator==(const hash_set<Value, Hash, Pred, Alloc>& x,
+               const hash_set<Value, Hash, Pred, Alloc>& y);
+
+template <class Value, class Hash, class Pred, class Alloc>
+    bool
+    operator!=(const hash_set<Value, Hash, Pred, Alloc>& x,
+               const hash_set<Value, Hash, Pred, Alloc>& y);
+
+template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
+          class Alloc = allocator<Value>>
+class hash_multiset
+{
+public:
+    // types
+    typedef Value                                                      key_type;
+    typedef key_type                                                   value_type;
+    typedef Hash                                                       hasher;
+    typedef Pred                                                       key_equal;
+    typedef Alloc                                                      allocator_type;
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+    typedef typename allocator_traits<allocator_type>::pointer         pointer;
+    typedef typename allocator_traits<allocator_type>::const_pointer   const_pointer;
+    typedef typename allocator_traits<allocator_type>::size_type       size_type;
+    typedef typename allocator_traits<allocator_type>::difference_type difference_type;
+
+    typedef /unspecified/ iterator;
+    typedef /unspecified/ const_iterator;
+
+    explicit hash_multiset(size_type n = 193, const hasher& hf = hasher(),
+                           const key_equal& eql = key_equal(),
+                           const allocator_type& a = allocator_type());
+    template <class InputIterator>
+        hash_multiset(InputIterator f, InputIterator l,
+                      size_type n = 193, const hasher& hf = hasher(),
+                      const key_equal& eql = key_equal(),
+                      const allocator_type& a = allocator_type());
+    hash_multiset(const hash_multiset&);
+    ~hash_multiset();
+    hash_multiset& operator=(const hash_multiset&);
+
+    allocator_type get_allocator() const;
+
+    bool      empty() const;
+    size_type size() const;
+    size_type max_size() const;
+
+    iterator       begin();
+    iterator       end();
+    const_iterator begin()  const;
+    const_iterator end()    const;
+
+    iterator insert(const value_type& obj);
+    template <class InputIterator>
+        void insert(InputIterator first, InputIterator last);
+
+    void erase(const_iterator position);
+    size_type erase(const key_type& k);
+    void erase(const_iterator first, const_iterator last);
+    void clear();
+
+    void swap(hash_multiset&);
+
+    hasher hash_funct() const;
+    key_equal key_eq() const;
+
+    iterator       find(const key_type& k);
+    const_iterator find(const key_type& k) const;
+    size_type count(const key_type& k) const;
+    pair<iterator, iterator>             equal_range(const key_type& k);
+    pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
+
+    size_type bucket_count() const;
+    size_type max_bucket_count() const;
+
+    size_type elems_in_bucket(size_type n) const;
+
+    void resize(size_type n);
+};
+
+template <class Value, class Hash, class Pred, class Alloc>
+    void swap(hash_multiset<Value, Hash, Pred, Alloc>& x,
+              hash_multiset<Value, Hash, Pred, Alloc>& y);
+
+template <class Value, class Hash, class Pred, class Alloc>
+    bool
+    operator==(const hash_multiset<Value, Hash, Pred, Alloc>& x,
+               const hash_multiset<Value, Hash, Pred, Alloc>& y);
+
+template <class Value, class Hash, class Pred, class Alloc>
+    bool
+    operator!=(const hash_multiset<Value, Hash, Pred, Alloc>& x,
+               const hash_multiset<Value, Hash, Pred, Alloc>& y);
+}  // __gnu_cxx
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__hash_table>
+#include <algorithm>
+#include <ext/__hash>
+#include <functional>
+
+#if defined(__DEPRECATED) && __DEPRECATED
+#if defined(_LIBCPP_WARNING)
+    _LIBCPP_WARNING("Use of the header <ext/hash_set> is deprecated.  Migrate to <unordered_set>")
+#else
+#   warning Use of the header <ext/hash_set> is deprecated.  Migrate to <unordered_set>
+#endif
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+namespace __gnu_cxx {
+
+
+template <class _Value, class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>,
+          class _Alloc = std::allocator<_Value> >
+class _LIBCPP_TEMPLATE_VIS hash_set
+{
+public:
+    // types
+    typedef _Value                                                     key_type;
+    typedef key_type                                                   value_type;
+    typedef _Hash                                                      hasher;
+    typedef _Pred                                                      key_equal;
+    typedef _Alloc                                                     allocator_type;
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+
+private:
+    typedef std::__hash_table<value_type, hasher, key_equal, allocator_type> __table;
+
+    __table __table_;
+
+public:
+    typedef typename __table::pointer         pointer;
+    typedef typename __table::const_pointer   const_pointer;
+    typedef typename __table::size_type       size_type;
+    typedef typename __table::difference_type difference_type;
+
+    typedef typename __table::const_iterator       iterator;
+    typedef typename __table::const_iterator       const_iterator;
+
+    _LIBCPP_INLINE_VISIBILITY
+    hash_set() { }
+    explicit hash_set(size_type __n, const hasher& __hf = hasher(),
+                           const key_equal& __eql = key_equal());
+    hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
+                  const allocator_type& __a);
+    template <class _InputIterator>
+        hash_set(_InputIterator __first, _InputIterator __last);
+    template <class _InputIterator>
+        hash_set(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf = hasher(),
+                      const key_equal& __eql = key_equal());
+    template <class _InputIterator>
+        hash_set(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf, const key_equal& __eql,
+                      const allocator_type& __a);
+    hash_set(const hash_set& __u);
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const
+        {return allocator_type(__table_.__node_alloc());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool      empty() const {return __table_.size() == 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const  {return __table_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const {return __table_.max_size();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       begin()        {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       end()          {return __table_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin()  const {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end()    const {return __table_.end();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    std::pair<iterator, bool> insert(const value_type& __x)
+        {return __table_.__insert_unique(__x);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator, const value_type& __x) {return insert(__x).first;}
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        void insert(_InputIterator __first, _InputIterator __last);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void erase(const_iterator __p) {__table_.erase(__p);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    void erase(const_iterator __first, const_iterator __last)
+        {__table_.erase(__first, __last);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() {__table_.clear();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(hash_set& __u) {__table_.swap(__u.__table_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    hasher hash_funct() const {return __table_.hash_function();}
+    _LIBCPP_INLINE_VISIBILITY
+    key_equal key_eq() const {return __table_.key_eq();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       find(const key_type& __k)       {return __table_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const key_type& __k) const {return __table_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    std::pair<iterator, iterator>             equal_range(const key_type& __k)
+        {return __table_.__equal_range_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    std::pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
+        {return __table_.__equal_range_unique(__k);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_count() const {return __table_.bucket_count();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_bucket_count() const {return __table_.max_bucket_count();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type elems_in_bucket(size_type __n) const {return __table_.bucket_size(__n);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void resize(size_type __n) {__table_.__rehash_unique(__n);}
+};
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(size_type __n,
+        const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    __table_.__rehash_unique(__n);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(size_type __n,
+        const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    __table_.__rehash_unique(__n);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
+        _InputIterator __first, _InputIterator __last)
+{
+    insert(__first, __last);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    __table_.__rehash_unique(__n);
+    insert(__first, __last);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    __table_.__rehash_unique(__n);
+    insert(__first, __last);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
+        const hash_set& __u)
+    : __table_(__u.__table_)
+{
+    __table_.__rehash_unique(__u.bucket_count());
+    insert(__u.begin(), __u.end());
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+inline
+void
+hash_set<_Value, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
+                                                    _InputIterator __last)
+{
+    for (; __first != __last; ++__first)
+        __table_.__insert_unique(*__first);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(hash_set<_Value, _Hash, _Pred, _Alloc>& __x,
+     hash_set<_Value, _Hash, _Pred, _Alloc>& __y)
+{
+    __x.swap(__y);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(const hash_set<_Value, _Hash, _Pred, _Alloc>& __x,
+           const hash_set<_Value, _Hash, _Pred, _Alloc>& __y)
+{
+    if (__x.size() != __y.size())
+        return false;
+    typedef typename hash_set<_Value, _Hash, _Pred, _Alloc>::const_iterator
+                                                                 const_iterator;
+    for (const_iterator __i = __x.begin(), __ex = __x.end(), __ey = __y.end();
+            __i != __ex; ++__i)
+    {
+        const_iterator __j = __y.find(*__i);
+        if (__j == __ey || !(*__i == *__j))
+            return false;
+    }
+    return true;
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const hash_set<_Value, _Hash, _Pred, _Alloc>& __x,
+           const hash_set<_Value, _Hash, _Pred, _Alloc>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Value, class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>,
+          class _Alloc = std::allocator<_Value> >
+class _LIBCPP_TEMPLATE_VIS hash_multiset
+{
+public:
+    // types
+    typedef _Value                                                     key_type;
+    typedef key_type                                                   value_type;
+    typedef _Hash                                                      hasher;
+    typedef _Pred                                                      key_equal;
+    typedef _Alloc                                                     allocator_type;
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+
+private:
+    typedef std::__hash_table<value_type, hasher, key_equal, allocator_type> __table;
+
+    __table __table_;
+
+public:
+    typedef typename __table::pointer         pointer;
+    typedef typename __table::const_pointer   const_pointer;
+    typedef typename __table::size_type       size_type;
+    typedef typename __table::difference_type difference_type;
+
+    typedef typename __table::const_iterator       iterator;
+    typedef typename __table::const_iterator       const_iterator;
+
+    _LIBCPP_INLINE_VISIBILITY
+    hash_multiset() { }
+    explicit hash_multiset(size_type __n, const hasher& __hf = hasher(),
+                                const key_equal& __eql = key_equal());
+    hash_multiset(size_type __n, const hasher& __hf,
+                       const key_equal& __eql, const allocator_type& __a);
+    template <class _InputIterator>
+        hash_multiset(_InputIterator __first, _InputIterator __last);
+    template <class _InputIterator>
+        hash_multiset(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf = hasher(),
+                      const key_equal& __eql = key_equal());
+    template <class _InputIterator>
+        hash_multiset(_InputIterator __first, _InputIterator __last,
+                      size_type __n , const hasher& __hf,
+                      const key_equal& __eql, const allocator_type& __a);
+    hash_multiset(const hash_multiset& __u);
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const
+        {return allocator_type(__table_.__node_alloc());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool      empty() const {return __table_.size() == 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const  {return __table_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const {return __table_.max_size();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       begin()        {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       end()          {return __table_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin()  const {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end()    const {return __table_.end();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const value_type& __x) {return __table_.__insert_multi(__x);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator, const value_type& __x) {return insert(__x);}
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        void insert(_InputIterator __first, _InputIterator __last);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void erase(const_iterator __p) {__table_.erase(__p);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    void erase(const_iterator __first, const_iterator __last)
+        {__table_.erase(__first, __last);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() {__table_.clear();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(hash_multiset& __u) {__table_.swap(__u.__table_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    hasher hash_funct() const {return __table_.hash_function();}
+    _LIBCPP_INLINE_VISIBILITY
+    key_equal key_eq() const {return __table_.key_eq();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       find(const key_type& __k)       {return __table_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const key_type& __k) const {return __table_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type count(const key_type& __k) const {return __table_.__count_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    std::pair<iterator, iterator>             equal_range(const key_type& __k)
+        {return __table_.__equal_range_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    std::pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
+        {return __table_.__equal_range_multi(__k);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_count() const {return __table_.bucket_count();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_bucket_count() const {return __table_.max_bucket_count();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type elems_in_bucket(size_type __n) const {return __table_.bucket_size(__n);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void resize(size_type __n) {__table_.__rehash_multi(__n);}
+};
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+hash_multiset<_Value, _Hash, _Pred, _Alloc>::hash_multiset(
+        size_type __n, const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    __table_.__rehash_multi(__n);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+hash_multiset<_Value, _Hash, _Pred, _Alloc>::hash_multiset(
+        size_type __n, const hasher& __hf, const key_equal& __eql,
+        const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    __table_.__rehash_multi(__n);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+hash_multiset<_Value, _Hash, _Pred, _Alloc>::hash_multiset(
+        _InputIterator __first, _InputIterator __last)
+{
+    insert(__first, __last);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+hash_multiset<_Value, _Hash, _Pred, _Alloc>::hash_multiset(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    __table_.__rehash_multi(__n);
+    insert(__first, __last);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+hash_multiset<_Value, _Hash, _Pred, _Alloc>::hash_multiset(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    __table_.__rehash_multi(__n);
+    insert(__first, __last);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+hash_multiset<_Value, _Hash, _Pred, _Alloc>::hash_multiset(
+        const hash_multiset& __u)
+    : __table_(__u.__table_)
+{
+    __table_.__rehash_multi(__u.bucket_count());
+    insert(__u.begin(), __u.end());
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+inline
+void
+hash_multiset<_Value, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
+                                                    _InputIterator __last)
+{
+    for (; __first != __last; ++__first)
+        __table_.__insert_multi(*__first);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(hash_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
+     hash_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
+{
+    __x.swap(__y);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(const hash_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
+           const hash_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
+{
+    if (__x.size() != __y.size())
+        return false;
+    typedef typename hash_multiset<_Value, _Hash, _Pred, _Alloc>::const_iterator
+                                                                 const_iterator;
+    typedef std::pair<const_iterator, const_iterator> _EqRng;
+    for (const_iterator __i = __x.begin(), __ex = __x.end(); __i != __ex;)
+    {
+        _EqRng __xeq = __x.equal_range(*__i);
+        _EqRng __yeq = __y.equal_range(*__i);
+        if (_VSTD::distance(__xeq.first, __xeq.second) !=
+            _VSTD::distance(__yeq.first, __yeq.second) ||
+                  !_VSTD::is_permutation(__xeq.first, __xeq.second, __yeq.first))
+            return false;
+        __i = __xeq.second;
+    }
+    return true;
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const hash_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
+           const hash_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
+{
+    return !(__x == __y);
+}
+
+} // namespace __gnu_cxx
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <iterator>
+#endif
+
+#endif // _LIBCPP_HASH_SET
diff --git a/app/src/main/cpp/libcxx/include/fenv.h b/app/src/main/cpp/libcxx/include/fenv.h
new file mode 100644
index 0000000..15e4156
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/fenv.h
@@ -0,0 +1,118 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_FENV_H
+#define _LIBCPP_FENV_H
+
+
+/*
+    fenv.h synopsis
+
+This entire header is C99 / C++0X
+
+Macros:
+
+    FE_DIVBYZERO
+    FE_INEXACT
+    FE_INVALID
+    FE_OVERFLOW
+    FE_UNDERFLOW
+    FE_ALL_EXCEPT
+    FE_DOWNWARD
+    FE_TONEAREST
+    FE_TOWARDZERO
+    FE_UPWARD
+    FE_DFL_ENV
+
+Types:
+
+    fenv_t
+    fexcept_t
+
+int feclearexcept(int excepts);
+int fegetexceptflag(fexcept_t* flagp, int excepts);
+int feraiseexcept(int excepts);
+int fesetexceptflag(const fexcept_t* flagp, int excepts);
+int fetestexcept(int excepts);
+int fegetround();
+int fesetround(int round);
+int fegetenv(fenv_t* envp);
+int feholdexcept(fenv_t* envp);
+int fesetenv(const fenv_t* envp);
+int feupdateenv(const fenv_t* envp);
+
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if __has_include_next(<fenv.h>)
+#  include_next <fenv.h>
+#endif
+
+#ifdef __cplusplus
+
+extern "C++" {
+
+#ifdef feclearexcept
+#undef feclearexcept
+#endif
+
+#ifdef fegetexceptflag
+#undef fegetexceptflag
+#endif
+
+
+#ifdef feraiseexcept
+#undef feraiseexcept
+#endif
+
+#ifdef fesetexceptflag
+#undef fesetexceptflag
+#endif
+
+
+#ifdef fetestexcept
+#undef fetestexcept
+#endif
+
+#ifdef fegetround
+#undef fegetround
+#endif
+
+#ifdef fesetround
+#undef fesetround
+#endif
+
+#ifdef fegetenv
+#undef fegetenv
+#endif
+
+#ifdef feholdexcept
+#undef feholdexcept
+#endif
+
+
+#ifdef fesetenv
+#undef fesetenv
+#endif
+
+#ifdef feupdateenv
+#undef feupdateenv
+#endif
+
+} // extern "C++"
+
+#endif // defined(__cplusplus)
+
+#endif // _LIBCPP_FENV_H
diff --git a/app/src/main/cpp/libcxx/include/filesystem b/app/src/main/cpp/libcxx/include/filesystem
new file mode 100644
index 0000000..7efa4ed
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/filesystem
@@ -0,0 +1,469 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_FILESYSTEM
+#define _LIBCPP_FILESYSTEM
+
+/*
+    filesystem synopsis
+
+    namespace std::filesystem {
+
+    // `class path` from http://eel.is/c++draft/fs.class.path.general#6
+    class path {
+      public:
+        using value_type  = see below;
+        using string_type = basic_string<value_type>;
+        static constexpr value_type preferred_separator = see below;
+
+        enum format;
+
+        path() noexcept;
+        path(const path& p);
+        path(path&& p) noexcept;
+        path(string_type&& source, format fmt = auto_format);
+        template<class Source>
+          path(const Source& source, format fmt = auto_format);
+        template<class InputIterator>
+          path(InputIterator first, InputIterator last, format fmt = auto_format);
+        template<class Source>
+          path(const Source& source, const locale& loc, format fmt = auto_format);
+        template<class InputIterator>
+          path(InputIterator first, InputIterator last, const locale& loc, format fmt = auto_format);
+        ~path();
+
+        path& operator=(const path& p);
+        path& operator=(path&& p) noexcept;
+        path& operator=(string_type&& source);
+        path& assign(string_type&& source);
+        template<class Source>
+          path& operator=(const Source& source);
+        template<class Source>
+          path& assign(const Source& source);
+        template<class InputIterator>
+          path& assign(InputIterator first, InputIterator last);
+
+        path& operator/=(const path& p);
+        template<class Source>
+          path& operator/=(const Source& source);
+        template<class Source>
+          path& append(const Source& source);
+        template<class InputIterator>
+          path& append(InputIterator first, InputIterator last);
+
+        path& operator+=(const path& x);
+        path& operator+=(const string_type& x);
+        path& operator+=(basic_string_view<value_type> x);
+        path& operator+=(const value_type* x);
+        path& operator+=(value_type x);
+        template<class Source>
+          path& operator+=(const Source& x);
+        template<class EcharT>
+          path& operator+=(EcharT x);
+        template<class Source>
+          path& concat(const Source& x);
+        template<class InputIterator>
+          path& concat(InputIterator first, InputIterator last);
+
+        void  clear() noexcept;
+        path& make_preferred();
+        path& remove_filename();
+        path& replace_filename(const path& replacement);
+        path& replace_extension(const path& replacement = path());
+        void  swap(path& rhs) noexcept;
+
+        friend bool operator==(const path& lhs, const path& rhs) noexcept;
+        friend bool operator!=(const path& lhs, const path& rhs) noexcept;             // removed in C++20
+        friend bool operator< (const path& lhs, const path& rhs) noexcept;             // removed in C++20
+        friend bool operator<=(const path& lhs, const path& rhs) noexcept;             // removed in C++20
+        friend bool operator> (const path& lhs, const path& rhs) noexcept;             // removed in C++20
+        friend bool operator>=(const path& lhs, const path& rhs) noexcept;             // removed in C++20
+        friend strong_ordering operator<=>(const path& lhs, const path& rhs) noexcept; // C++20
+
+        friend path operator/(const path& lhs, const path& rhs);
+
+        const string_type& native() const noexcept;
+        const value_type*  c_str() const noexcept;
+        operator string_type() const;
+
+        template<class EcharT, class traits = char_traits<EcharT>,
+                 class Allocator = allocator<EcharT>>
+          basic_string<EcharT, traits, Allocator>
+            string(const Allocator& a = Allocator()) const;
+        std::string    string() const;
+        std::wstring   wstring() const;
+        std::u8string  u8string() const;
+        std::u16string u16string() const;
+        std::u32string u32string() const;
+
+        template<class EcharT, class traits = char_traits<EcharT>,
+                 class Allocator = allocator<EcharT>>
+          basic_string<EcharT, traits, Allocator>
+            generic_string(const Allocator& a = Allocator()) const;
+        std::string    generic_string() const;
+        std::wstring   generic_wstring() const;
+        std::u8string  generic_u8string() const;
+        std::u16string generic_u16string() const;
+        std::u32string generic_u32string() const;
+
+        int compare(const path& p) const noexcept;
+        int compare(const string_type& s) const;
+        int compare(basic_string_view<value_type> s) const;
+        int compare(const value_type* s) const;
+
+        path root_name() const;
+        path root_directory() const;
+        path root_path() const;
+        path relative_path() const;
+        path parent_path() const;
+        path filename() const;
+        path stem() const;
+        path extension() const;
+
+        [[nodiscard]] bool empty() const noexcept;
+        bool has_root_name() const;
+        bool has_root_directory() const;
+        bool has_root_path() const;
+        bool has_relative_path() const;
+        bool has_parent_path() const;
+        bool has_filename() const;
+        bool has_stem() const;
+        bool has_extension() const;
+        bool is_absolute() const;
+        bool is_relative() const;
+
+        path lexically_normal() const;
+        path lexically_relative(const path& base) const;
+        path lexically_proximate(const path& base) const;
+
+        class iterator;
+        using const_iterator = iterator;
+
+        iterator begin() const;
+        iterator end() const;
+
+        template<class charT, class traits>
+          friend basic_ostream<charT, traits>&
+            operator<<(basic_ostream<charT, traits>& os, const path& p);
+        template<class charT, class traits>
+          friend basic_istream<charT, traits>&
+            operator>>(basic_istream<charT, traits>& is, path& p);
+    };
+
+    void swap(path& lhs, path& rhs) noexcept;
+    size_t hash_value(const path& p) noexcept;
+
+    template <class Source>
+      path u8path(const Source& source);
+    template <class InputIterator>
+      path u8path(InputIterator first, InputIterator last);
+
+    class filesystem_error;
+
+    class directory_entry {
+    public:
+      directory_entry() noexcept = default;
+      directory_entry(const directory_entry&) = default;
+      directory_entry(directory_entry&&) noexcept = default;
+      explicit directory_entry(const filesystem::path& p);
+      directory_entry(const filesystem::path& p, error_code& ec);
+      ~directory_entry();
+
+      directory_entry& operator=(const directory_entry&) = default;
+      directory_entry& operator=(directory_entry&&) noexcept = default;
+
+      void assign(const filesystem::path& p);
+      void assign(const filesystem::path& p, error_code& ec);
+      void replace_filename(const filesystem::path& p);
+      void replace_filename(const filesystem::path& p, error_code& ec);
+      void refresh();
+      void refresh(error_code& ec) noexcept;
+
+      const filesystem::path& path() const noexcept;
+      operator const filesystem::path&() const noexcept;
+      bool exists() const;
+      bool exists(error_code& ec) const noexcept;
+      bool is_block_file() const;
+      bool is_block_file(error_code& ec) const noexcept;
+      bool is_character_file() const;
+      bool is_character_file(error_code& ec) const noexcept;
+      bool is_directory() const;
+      bool is_directory(error_code& ec) const noexcept;
+      bool is_fifo() const;
+      bool is_fifo(error_code& ec) const noexcept;
+      bool is_other() const;
+      bool is_other(error_code& ec) const noexcept;
+      bool is_regular_file() const;
+      bool is_regular_file(error_code& ec) const noexcept;
+      bool is_socket() const;
+      bool is_socket(error_code& ec) const noexcept;
+      bool is_symlink() const;
+      bool is_symlink(error_code& ec) const noexcept;
+      uintmax_t file_size() const;
+      uintmax_t file_size(error_code& ec) const noexcept;
+      uintmax_t hard_link_count() const;
+      uintmax_t hard_link_count(error_code& ec) const noexcept;
+      file_time_type last_write_time() const;
+      file_time_type last_write_time(error_code& ec) const noexcept;
+      file_status status() const;
+      file_status status(error_code& ec) const noexcept;
+      file_status symlink_status() const;
+      file_status symlink_status(error_code& ec) const noexcept;
+
+      bool operator==(const directory_entry& rhs) const noexcept;
+      bool operator!=(const directory_entry& rhs) const noexcept;             // removed  in C++20
+      bool operator< (const directory_entry& rhs) const noexcept;             // removed  in C++20
+      bool operator<=(const directory_entry& rhs) const noexcept;             // removed  in C++20
+      bool operator> (const directory_entry& rhs) const noexcept;             // removed  in C++20
+      bool operator>=(const directory_entry& rhs) const noexcept;             // removed  in C++20
+      strong_ordering operator<=>(const directory_entry& rhs) const noexcept; // since C++20
+
+      template<class charT, class traits>
+        friend basic_ostream<charT, traits>&
+          operator<<(basic_ostream<charT, traits>& os, const directory_entry& d);
+
+    private:
+      filesystem::path pathobject;        // exposition only
+      friend class directory_iterator;    // exposition only
+    };
+
+    class directory_iterator;
+
+    // enable directory_iterator range-based for statements
+    directory_iterator begin(directory_iterator iter) noexcept;
+    directory_iterator end(directory_iterator) noexcept;
+
+    class recursive_directory_iterator;
+
+    // enable recursive_directory_iterator range-based for statements
+    recursive_directory_iterator begin(recursive_directory_iterator iter) noexcept;
+    recursive_directory_iterator end(recursive_directory_iterator) noexcept;
+
+    class file_status;
+
+    struct space_info
+    {
+      uintmax_t capacity;
+      uintmax_t free;
+      uintmax_t available;
+
+      friend bool operator==(const space_info&, const space_info&) = default; // C++20
+    };
+
+    enum class file_type;
+    enum class perms;
+    enum class perm_options;
+    enum class copy_options;
+    enum class directory_options;
+
+    typedef chrono::time_point<trivial-clock>  file_time_type;
+
+    // operational functions
+
+    path absolute(const path& p);
+    path absolute(const path& p, error_code &ec);
+
+    path canonical(const path& p);
+    path canonical(const path& p, error_code& ec);
+
+    void copy(const path& from, const path& to);
+    void copy(const path& from, const path& to, error_code& ec);
+    void copy(const path& from, const path& to, copy_options options);
+    void copy(const path& from, const path& to, copy_options options,
+                   error_code& ec);
+
+    bool copy_file(const path& from, const path& to);
+    bool copy_file(const path& from, const path& to, error_code& ec);
+    bool copy_file(const path& from, const path& to, copy_options option);
+    bool copy_file(const path& from, const path& to, copy_options option,
+                           error_code& ec);
+
+    void copy_symlink(const path& existing_symlink, const path& new_symlink);
+    void copy_symlink(const path& existing_symlink, const path& new_symlink,
+                              error_code& ec) noexcept;
+
+    bool create_directories(const path& p);
+    bool create_directories(const path& p, error_code& ec);
+
+    bool create_directory(const path& p);
+    bool create_directory(const path& p, error_code& ec) noexcept;
+
+    bool create_directory(const path& p, const path& attributes);
+    bool create_directory(const path& p, const path& attributes,
+                                  error_code& ec) noexcept;
+
+    void create_directory_symlink(const path& to, const path& new_symlink);
+    void create_directory_symlink(const path& to, const path& new_symlink,
+                                          error_code& ec) noexcept;
+
+    void create_hard_link(const path& to, const path& new_hard_link);
+    void create_hard_link(const path& to, const path& new_hard_link,
+                                  error_code& ec) noexcept;
+
+    void create_symlink(const path& to, const path& new_symlink);
+    void create_symlink(const path& to, const path& new_symlink,
+                                error_code& ec) noexcept;
+
+    path current_path();
+    path current_path(error_code& ec);
+    void current_path(const path& p);
+    void current_path(const path& p, error_code& ec) noexcept;
+
+    bool exists(file_status s) noexcept;
+    bool exists(const path& p);
+    bool exists(const path& p, error_code& ec) noexcept;
+
+    bool equivalent(const path& p1, const path& p2);
+    bool equivalent(const path& p1, const path& p2, error_code& ec) noexcept;
+
+    uintmax_t    file_size(const path& p);
+    uintmax_t    file_size(const path& p, error_code& ec) noexcept;
+
+    uintmax_t    hard_link_count(const path& p);
+    uintmax_t    hard_link_count(const path& p, error_code& ec) noexcept;
+
+    bool is_block_file(file_status s) noexcept;
+    bool is_block_file(const path& p);
+    bool is_block_file(const path& p, error_code& ec) noexcept;
+
+    bool is_character_file(file_status s) noexcept;
+    bool is_character_file(const path& p);
+    bool is_character_file(const path& p, error_code& ec) noexcept;
+
+    bool is_directory(file_status s) noexcept;
+    bool is_directory(const path& p);
+    bool is_directory(const path& p, error_code& ec) noexcept;
+
+    bool is_empty(const path& p);
+    bool is_empty(const path& p, error_code& ec) noexcept;
+
+    bool is_fifo(file_status s) noexcept;
+    bool is_fifo(const path& p);
+    bool is_fifo(const path& p, error_code& ec) noexcept;
+
+    bool is_other(file_status s) noexcept;
+    bool is_other(const path& p);
+    bool is_other(const path& p, error_code& ec) noexcept;
+
+    bool is_regular_file(file_status s) noexcept;
+    bool is_regular_file(const path& p);
+    bool is_regular_file(const path& p, error_code& ec) noexcept;
+
+    bool is_socket(file_status s) noexcept;
+    bool is_socket(const path& p);
+    bool is_socket(const path& p, error_code& ec) noexcept;
+
+    bool is_symlink(file_status s) noexcept;
+    bool is_symlink(const path& p);
+    bool is_symlink(const path& p, error_code& ec) noexcept;
+
+    file_time_type  last_write_time(const path& p);
+    file_time_type  last_write_time(const path& p, error_code& ec) noexcept;
+    void last_write_time(const path& p, file_time_type new_time);
+    void last_write_time(const path& p, file_time_type new_time,
+                                 error_code& ec) noexcept;
+
+    void permissions(const path& p, perms prms,
+                     perm_options opts=perm_options::replace);
+    void permissions(const path& p, perms prms, error_code& ec) noexcept;
+    void permissions(const path& p, perms prms, perm_options opts,
+                     error_code& ec);
+
+    path proximate(const path& p, error_code& ec);
+    path proximate(const path& p, const path& base = current_path());
+    path proximate(const path& p, const path& base, error_code &ec);
+
+    path read_symlink(const path& p);
+    path read_symlink(const path& p, error_code& ec);
+
+    path relative(const path& p, error_code& ec);
+    path relative(const path& p, const path& base=current_path());
+    path relative(const path& p, const path& base, error_code& ec);
+
+    bool remove(const path& p);
+    bool remove(const path& p, error_code& ec) noexcept;
+
+    uintmax_t    remove_all(const path& p);
+    uintmax_t    remove_all(const path& p, error_code& ec);
+
+    void rename(const path& from, const path& to);
+    void rename(const path& from, const path& to, error_code& ec) noexcept;
+
+    void resize_file(const path& p, uintmax_t size);
+    void resize_file(const path& p, uintmax_t size, error_code& ec) noexcept;
+
+    space_info   space(const path& p);
+    space_info   space(const path& p, error_code& ec) noexcept;
+
+    file_status  status(const path& p);
+    file_status  status(const path& p, error_code& ec) noexcept;
+
+    bool status_known(file_status s) noexcept;
+
+    file_status  symlink_status(const path& p);
+    file_status  symlink_status(const path& p, error_code& ec) noexcept;
+
+    path temp_directory_path();
+    path temp_directory_path(error_code& ec);
+
+    path weakly_canonical(path const& p);
+    path weakly_canonical(path const& p, error_code& ec);
+
+} // namespace std::filesystem
+
+template <>
+inline constexpr bool std::ranges::enable_borrowed_range<std::filesystem::directory_iterator> = true;
+template <>
+inline constexpr bool std::ranges::enable_borrowed_range<std::filesystem::recursive_directory_iterator> = true;
+
+template <>
+inline constexpr bool std::ranges::enable_view<std::filesystem::directory_iterator> = true;
+template <>
+inline constexpr bool std::ranges::enable_view<std::filesystem::recursive_directory_iterator> = true;
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__filesystem/copy_options.h>
+#include <__filesystem/directory_entry.h>
+#include <__filesystem/directory_iterator.h>
+#include <__filesystem/directory_options.h>
+#include <__filesystem/file_status.h>
+#include <__filesystem/file_time_type.h>
+#include <__filesystem/file_type.h>
+#include <__filesystem/filesystem_error.h>
+#include <__filesystem/operations.h>
+#include <__filesystem/path.h>
+#include <__filesystem/path_iterator.h>
+#include <__filesystem/perm_options.h>
+#include <__filesystem/perms.h>
+#include <__filesystem/recursive_directory_iterator.h>
+#include <__filesystem/space_info.h>
+#include <__filesystem/u8path.h>
+#include <version>
+
+// standard-mandated includes
+
+// [fs.filesystem.syn]
+#include <compare>
+
+#if defined(_LIBCPP_HAS_NO_FILESYSTEM_LIBRARY)
+# error "The <filesystem> library is not supported since libc++ has been configured without support for a filesystem."
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#endif
+
+#endif // _LIBCPP_FILESYSTEM
diff --git a/app/src/main/cpp/libcxx/include/float.h b/app/src/main/cpp/libcxx/include/float.h
new file mode 100644
index 0000000..9e5f711
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/float.h
@@ -0,0 +1,95 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_FLOAT_H
+#define _LIBCPP_FLOAT_H
+
+/*
+    float.h synopsis
+
+Macros:
+
+    FLT_ROUNDS
+    FLT_EVAL_METHOD     // C99
+    FLT_RADIX
+
+    FLT_MANT_DIG
+    DBL_MANT_DIG
+    LDBL_MANT_DIG
+
+    FLT_HAS_SUBNORM     // C11
+    DBL_HAS_SUBNORM     // C11
+    LDBL_HAS_SUBNORM    // C11
+
+    DECIMAL_DIG         // C99
+    FLT_DECIMAL_DIG     // C11
+    DBL_DECIMAL_DIG     // C11
+    LDBL_DECIMAL_DIG    // C11
+
+    FLT_DIG
+    DBL_DIG
+    LDBL_DIG
+
+    FLT_MIN_EXP
+    DBL_MIN_EXP
+    LDBL_MIN_EXP
+
+    FLT_MIN_10_EXP
+    DBL_MIN_10_EXP
+    LDBL_MIN_10_EXP
+
+    FLT_MAX_EXP
+    DBL_MAX_EXP
+    LDBL_MAX_EXP
+
+    FLT_MAX_10_EXP
+    DBL_MAX_10_EXP
+    LDBL_MAX_10_EXP
+
+    FLT_MAX
+    DBL_MAX
+    LDBL_MAX
+
+    FLT_EPSILON
+    DBL_EPSILON
+    LDBL_EPSILON
+
+    FLT_MIN
+    DBL_MIN
+    LDBL_MIN
+
+    FLT_TRUE_MIN        // C11
+    DBL_TRUE_MIN        // C11
+    LDBL_TRUE_MIN       // C11
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if __has_include_next(<float.h>)
+#  include_next <float.h>
+#endif
+
+#ifdef __cplusplus
+
+#ifndef FLT_EVAL_METHOD
+#define FLT_EVAL_METHOD __FLT_EVAL_METHOD__
+#endif
+
+#ifndef DECIMAL_DIG
+#define DECIMAL_DIG __DECIMAL_DIG__
+#endif
+
+#endif // __cplusplus
+
+#endif // _LIBCPP_FLOAT_H
diff --git a/app/src/main/cpp/libcxx/include/format b/app/src/main/cpp/libcxx/include/format
new file mode 100644
index 0000000..2c583c1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/format
@@ -0,0 +1,212 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_FORMAT
+#define _LIBCPP_FORMAT
+
+/*
+
+namespace std {
+  // [format.context], class template basic_format_context
+  template<class Out, class charT> class basic_format_context;
+  using format_context = basic_format_context<unspecified, char>;
+  using wformat_context = basic_format_context<unspecified, wchar_t>;
+
+  // [format.args], class template basic_format_args
+  template<class Context> class basic_format_args;
+  using format_args = basic_format_args<format_context>;
+  using wformat_args = basic_format_args<wformat_context>;
+
+  // [format.fmt.string], class template basic_format_string
+  template<class charT, class... Args>
+    struct basic_format_string {                                // since C++23, exposition only before C++23
+    private:
+      basic_string_view<charT> str;                             // exposition only
+
+    public:
+      template<class T> consteval basic_format_string(const T& s);
+
+      constexpr basic_string_view<charT> get() const noexcept { return str; }
+    };
+  template<class... Args>
+    using format_string =                                       // since C++23, exposition only before C++23
+      basic_format_string<char, type_identity_t<Args>...>;
+  template<class... Args>
+    using wformat_string =                                      // since C++23, exposition only before C++23
+      basic_format_string<wchar_t, type_identity_t<Args>...>;
+
+  // [format.functions], formatting functions
+  template<class... Args>
+    string format(format-string<Args...> fmt, Args&&... args);
+  template<class... Args>
+    wstring format(wformat-string<Args...> fmt, Args&&... args);
+  template<class... Args>
+    string format(const locale& loc, format-string<Args...> fmt, Args&&... args);
+  template<class... Args>
+    wstring format(const locale& loc, wformat-string<Args...> fmt, Args&&... args);
+
+  string vformat(string_view fmt, format_args args);
+  wstring vformat(wstring_view fmt, wformat_args args);
+  string vformat(const locale& loc, string_view fmt, format_args args);
+  wstring vformat(const locale& loc, wstring_view fmt, wformat_args args);
+
+  template<class Out, class... Args>
+    Out format_to(Out out, format-string<Args...> fmt, Args&&... args);
+  template<class Out, class... Args>
+    Out format_to(Out out, wformat-string<Args...> fmt, Args&&... args);
+  template<class Out, class... Args>
+    Out format_to(Out out, const locale& loc, format-string<Args...> fmt, Args&&... args);
+  template<class Out, class... Args>
+    Out format_to(Out out, const locale& loc, wformat-string<Args...> fmt, Args&&... args);
+
+  template<class Out>
+    Out vformat_to(Out out, string_view fmt, format_args args);
+  template<class Out>
+    Out vformat_to(Out out, wstring_view fmt, wformat_args args);
+  template<class Out>
+    Out vformat_to(Out out, const locale& loc, string_view fmt,
+                   format_args char> args);
+  template<class Out>
+    Out vformat_to(Out out, const locale& loc, wstring_view fmt,
+                   wformat_args args);
+
+  template<class Out> struct format_to_n_result {
+    Out out;
+    iter_difference_t<Out> size;
+  };
+  template<class Out, class... Args>
+    format_to_n_result<Out> format_to_n(Out out, iter_difference_t<Out> n,
+                                        format-string<Args...> fmt, Args&&... args);
+  template<class Out, class... Args>
+    format_to_n_result<Out> format_to_n(Out out, iter_difference_t<Out> n,
+                                        wformat-string<Args...> fmt, Args&&... args);
+  template<class Out, class... Args>
+    format_to_n_result<Out> format_to_n(Out out, iter_difference_t<Out> n,
+                                        const locale& loc, format-string<Args...> fmt,
+                                        Args&&... args);
+  template<class Out, class... Args>
+    format_to_n_result<Out> format_to_n(Out out, iter_difference_t<Out> n,
+                                        const locale& loc, wformat-string<Args...> fmt,
+                                        Args&&... args);
+
+  template<class... Args>
+    size_t formatted_size(format-string<Args...> fmt, Args&&... args);
+  template<class... Args>
+    size_t formatted_size(wformat-string<Args...> fmt, Args&&... args);
+  template<class... Args>
+    size_t formatted_size(const locale& loc, format-string<Args...> fmt, Args&&... args);
+  template<class... Args>
+    size_t formatted_size(const locale& loc, wformat-string<Args...> fmt, Args&&... args);
+
+  // [format.formatter], formatter
+  template<class T, class charT = char> struct formatter;
+
+  // [format.parse.ctx], class template basic_format_parse_context
+  template<class charT> class basic_format_parse_context;
+  using format_parse_context = basic_format_parse_context<char>;
+  using wformat_parse_context = basic_format_parse_context<wchar_t>;
+
+  // [format.range], formatting of ranges
+  // [format.range.fmtkind], variable template format_kind
+  enum class range_format {                                     // since C++23
+    disabled,
+    map,
+    set,
+    sequence,
+    string,
+    debug_string
+  };
+
+  template<class R>
+    constexpr unspecified format_kind = unspecified;            // since C++23
+
+  template<ranges::input_range R>
+      requires same_as<R, remove_cvref_t<R>>
+    constexpr range_format format_kind<R> = see below;          // since C++23
+
+  // [format.range.formatter], class template range_formatter
+  template<class T, class charT = char>
+    requires same_as<remove_cvref_t<T>, T> && formattable<T, charT>
+  class range_formatter;                                        // since C++23
+
+  // [format.range.fmtdef], class template range-default-formatter
+  template<range_format K, ranges::input_range R, class charT>
+    struct range-default-formatter;                             // exposition only, since C++23
+
+  // [format.range.fmtmap], [format.range.fmtset], [format.range.fmtstr],
+  // specializations for maps, sets, and strings
+  template<ranges::input_range R, class charT>
+    requires (format_kind<R> != range_format::disabled) &&
+             formattable<ranges::range_reference_t<R>, charT>
+  struct formatter<R, charT> : range-default-formatter<format_kind<R>, R, charT> { }; // since C++23
+
+  // [format.arguments], arguments
+  // [format.arg], class template basic_format_arg
+  template<class Context> class basic_format_arg;
+
+  template<class Visitor, class Context>
+    see below visit_format_arg(Visitor&& vis, basic_format_arg<Context> arg);
+
+  // [format.arg.store], class template format-arg-store
+  template<class Context, class... Args> struct format-arg-store;      // exposition only
+
+  template<class Context = format_context, class... Args>
+    format-arg-store<Context, Args...>
+      make_format_args(Args&&... args);
+  template<class... Args>
+    format-arg-store<wformat_context, Args...>
+      make_wformat_args(Args&&... args);
+
+  // [format.error], class format_error
+  class format_error;
+}
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+// Make sure all feature-test macros are available.
+#include <version>
+// Enable the contents of the header only when libc++ was built with experimental features enabled.
+#if !defined(_LIBCPP_HAS_NO_INCOMPLETE_FORMAT)
+
+#include <__config>
+#include <__format/buffer.h>
+#include <__format/concepts.h>
+#include <__format/container_adaptor.h>
+#include <__format/enable_insertable.h>
+#include <__format/format_arg.h>
+#include <__format/format_arg_store.h>
+#include <__format/format_args.h>
+#include <__format/format_context.h>
+#include <__format/format_error.h>
+#include <__format/format_functions.h>
+#include <__format/format_fwd.h>
+#include <__format/format_parse_context.h>
+#include <__format/format_string.h>
+#include <__format/format_to_n_result.h>
+#include <__format/formatter.h>
+#include <__format/formatter_bool.h>
+#include <__format/formatter_char.h>
+#include <__format/formatter_floating_point.h>
+#include <__format/formatter_integer.h>
+#include <__format/formatter_pointer.h>
+#include <__format/formatter_string.h>
+#include <__format/formatter_tuple.h>
+#include <__format/parser_std_format_spec.h>
+#include <__format/range_default_formatter.h>
+#include <__format/range_formatter.h>
+#include <__format/unicode.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif // !defined(_LIBCPP_HAS_NO_INCOMPLETE_FORMAT)
+
+#endif // _LIBCPP_FORMAT
diff --git a/app/src/main/cpp/libcxx/include/forward_list b/app/src/main/cpp/libcxx/include/forward_list
new file mode 100644
index 0000000..61dde81
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/forward_list
@@ -0,0 +1,1803 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_FORWARD_LIST
+#define _LIBCPP_FORWARD_LIST
+
+/*
+    forward_list synopsis
+
+namespace std
+{
+
+template <class T, class Allocator = allocator<T>>
+class forward_list
+{
+public:
+    typedef T         value_type;
+    typedef Allocator allocator_type;
+
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+    typedef typename allocator_traits<allocator_type>::pointer         pointer;
+    typedef typename allocator_traits<allocator_type>::const_pointer   const_pointer;
+    typedef typename allocator_traits<allocator_type>::size_type       size_type;
+    typedef typename allocator_traits<allocator_type>::difference_type difference_type;
+
+    typedef <details> iterator;
+    typedef <details> const_iterator;
+
+    forward_list()
+        noexcept(is_nothrow_default_constructible<allocator_type>::value);
+    explicit forward_list(const allocator_type& a);
+    explicit forward_list(size_type n);
+    explicit forward_list(size_type n, const allocator_type& a); // C++14
+    forward_list(size_type n, const value_type& v);
+    forward_list(size_type n, const value_type& v, const allocator_type& a);
+    template <class InputIterator>
+        forward_list(InputIterator first, InputIterator last);
+    template <class InputIterator>
+        forward_list(InputIterator first, InputIterator last, const allocator_type& a);
+    forward_list(const forward_list& x);
+    forward_list(const forward_list& x, const allocator_type& a);
+    forward_list(forward_list&& x)
+        noexcept(is_nothrow_move_constructible<allocator_type>::value);
+    forward_list(forward_list&& x, const allocator_type& a);
+    forward_list(initializer_list<value_type> il);
+    forward_list(initializer_list<value_type> il, const allocator_type& a);
+
+    ~forward_list();
+
+    forward_list& operator=(const forward_list& x);
+    forward_list& operator=(forward_list&& x)
+        noexcept(
+             allocator_type::propagate_on_container_move_assignment::value &&
+             is_nothrow_move_assignable<allocator_type>::value);
+    forward_list& operator=(initializer_list<value_type> il);
+
+    template <class InputIterator>
+        void assign(InputIterator first, InputIterator last);
+    void assign(size_type n, const value_type& v);
+    void assign(initializer_list<value_type> il);
+
+    allocator_type get_allocator() const noexcept;
+
+    iterator       begin() noexcept;
+    const_iterator begin() const noexcept;
+    iterator       end() noexcept;
+    const_iterator end() const noexcept;
+
+    const_iterator cbegin() const noexcept;
+    const_iterator cend() const noexcept;
+
+    iterator       before_begin() noexcept;
+    const_iterator before_begin() const noexcept;
+    const_iterator cbefore_begin() const noexcept;
+
+    bool empty() const noexcept;
+    size_type max_size() const noexcept;
+
+    reference       front();
+    const_reference front() const;
+
+    template <class... Args> reference emplace_front(Args&&... args);  // reference in C++17
+    void push_front(const value_type& v);
+    void push_front(value_type&& v);
+
+    void pop_front();
+
+    template <class... Args>
+        iterator emplace_after(const_iterator p, Args&&... args);
+    iterator insert_after(const_iterator p, const value_type& v);
+    iterator insert_after(const_iterator p, value_type&& v);
+    iterator insert_after(const_iterator p, size_type n, const value_type& v);
+    template <class InputIterator>
+        iterator insert_after(const_iterator p,
+                              InputIterator first, InputIterator last);
+    iterator insert_after(const_iterator p, initializer_list<value_type> il);
+
+    iterator erase_after(const_iterator p);
+    iterator erase_after(const_iterator first, const_iterator last);
+
+    void swap(forward_list& x)
+        noexcept(allocator_traits<allocator_type>::is_always_equal::value);  // C++17
+
+    void resize(size_type n);
+    void resize(size_type n, const value_type& v);
+    void clear() noexcept;
+
+    void splice_after(const_iterator p, forward_list& x);
+    void splice_after(const_iterator p, forward_list&& x);
+    void splice_after(const_iterator p, forward_list& x, const_iterator i);
+    void splice_after(const_iterator p, forward_list&& x, const_iterator i);
+    void splice_after(const_iterator p, forward_list& x,
+                      const_iterator first, const_iterator last);
+    void splice_after(const_iterator p, forward_list&& x,
+                      const_iterator first, const_iterator last);
+    size_type remove(const value_type& v);           // void before C++20
+    template <class Predicate>
+      size_type remove_if(Predicate pred);           // void before C++20
+    size_type unique();                              // void before C++20
+    template <class BinaryPredicate>
+      size_type unique(BinaryPredicate binary_pred); // void before C++20
+    void merge(forward_list& x);
+    void merge(forward_list&& x);
+    template <class Compare> void merge(forward_list& x, Compare comp);
+    template <class Compare> void merge(forward_list&& x, Compare comp);
+    void sort();
+    template <class Compare> void sort(Compare comp);
+    void reverse() noexcept;
+};
+
+
+template <class InputIterator, class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
+    forward_list(InputIterator, InputIterator, Allocator = Allocator())
+    -> forward_list<typename iterator_traits<InputIterator>::value_type, Allocator>;  // C++17
+
+template <class T, class Allocator>
+    bool operator==(const forward_list<T, Allocator>& x,
+                    const forward_list<T, Allocator>& y);
+
+template <class T, class Allocator>
+    bool operator< (const forward_list<T, Allocator>& x,
+                    const forward_list<T, Allocator>& y);
+
+template <class T, class Allocator>
+    bool operator!=(const forward_list<T, Allocator>& x,
+                    const forward_list<T, Allocator>& y);
+
+template <class T, class Allocator>
+    bool operator> (const forward_list<T, Allocator>& x,
+                    const forward_list<T, Allocator>& y);
+
+template <class T, class Allocator>
+    bool operator>=(const forward_list<T, Allocator>& x,
+                    const forward_list<T, Allocator>& y);
+
+template <class T, class Allocator>
+    bool operator<=(const forward_list<T, Allocator>& x,
+                    const forward_list<T, Allocator>& y);
+
+template <class T, class Allocator>
+    void swap(forward_list<T, Allocator>& x, forward_list<T, Allocator>& y)
+         noexcept(noexcept(x.swap(y)));
+
+template <class T, class Allocator, class U>
+    typename forward_list<T, Allocator>::size_type
+    erase(forward_list<T, Allocator>& c, const U& value);       // C++20
+template <class T, class Allocator, class Predicate>
+    typename forward_list<T, Allocator>::size_type
+    erase_if(forward_list<T, Allocator>& c, Predicate pred);    // C++20
+
+}  // std
+
+*/
+
+#include <__algorithm/comp.h>
+#include <__algorithm/lexicographical_compare.h>
+#include <__algorithm/min.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/move_iterator.h>
+#include <__iterator/next.h>
+#include <__memory/addressof.h>
+#include <__memory/allocator.h>
+#include <__memory/allocator_destructor.h>
+#include <__memory/allocator_traits.h>
+#include <__memory/compressed_pair.h>
+#include <__memory/pointer_traits.h>
+#include <__memory/swap_allocator.h>
+#include <__memory/unique_ptr.h>
+#include <__memory_resource/polymorphic_allocator.h>
+#include <__type_traits/is_allocator.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <limits>
+#include <type_traits>
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+// [forward.list.syn]
+#include <compare>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _VoidPtr> struct __forward_list_node;
+template <class _NodePtr> struct __forward_begin_node;
+
+
+template <class>
+struct __forward_list_node_value_type;
+
+template <class _Tp, class _VoidPtr>
+struct __forward_list_node_value_type<__forward_list_node<_Tp, _VoidPtr> > {
+  typedef _Tp type;
+};
+
+template <class _NodePtr>
+struct __forward_node_traits {
+
+  typedef __remove_cv_t<
+        typename pointer_traits<_NodePtr>::element_type>        __node;
+  typedef typename __forward_list_node_value_type<__node>::type __node_value_type;
+  typedef _NodePtr                                              __node_pointer;
+  typedef __forward_begin_node<_NodePtr>                        __begin_node;
+  typedef __rebind_pointer_t<_NodePtr, __begin_node>            __begin_node_pointer;
+  typedef __rebind_pointer_t<_NodePtr, void>                    __void_pointer;
+
+#if defined(_LIBCPP_ABI_FORWARD_LIST_REMOVE_NODE_POINTER_UB)
+  typedef __begin_node_pointer __iter_node_pointer;
+#else
+  typedef __conditional_t<is_pointer<__void_pointer>::value, __begin_node_pointer, __node_pointer>
+      __iter_node_pointer;
+#endif
+
+  typedef __conditional_t<is_same<__iter_node_pointer, __node_pointer>::value, __begin_node_pointer, __node_pointer>
+      __non_iter_node_pointer;
+
+  _LIBCPP_INLINE_VISIBILITY
+  static __iter_node_pointer __as_iter_node(__iter_node_pointer __p) {
+      return __p;
+  }
+  _LIBCPP_INLINE_VISIBILITY
+  static __iter_node_pointer __as_iter_node(__non_iter_node_pointer __p) {
+      return static_cast<__iter_node_pointer>(static_cast<__void_pointer>(__p));
+  }
+};
+
+template <class _NodePtr>
+struct __forward_begin_node
+{
+    typedef _NodePtr pointer;
+    typedef __rebind_pointer_t<_NodePtr, __forward_begin_node> __begin_node_pointer;
+
+    pointer __next_;
+
+    _LIBCPP_INLINE_VISIBILITY __forward_begin_node() : __next_(nullptr) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __begin_node_pointer __next_as_begin() const {
+        return static_cast<__begin_node_pointer>(__next_);
+    }
+};
+
+template <class _Tp, class _VoidPtr>
+using __begin_node_of = __forward_begin_node<__rebind_pointer_t<_VoidPtr, __forward_list_node<_Tp, _VoidPtr> > >;
+
+template <class _Tp, class _VoidPtr>
+struct _LIBCPP_STANDALONE_DEBUG __forward_list_node
+    : public __begin_node_of<_Tp, _VoidPtr>
+{
+    typedef _Tp value_type;
+
+    value_type __value_;
+};
+
+
+template <class _Tp, class _Alloc = allocator<_Tp> > class _LIBCPP_TEMPLATE_VIS forward_list;
+template<class _NodeConstPtr> class _LIBCPP_TEMPLATE_VIS __forward_list_const_iterator;
+
+template <class _NodePtr>
+class _LIBCPP_TEMPLATE_VIS __forward_list_iterator
+{
+    typedef __forward_node_traits<_NodePtr>         __traits;
+    typedef typename __traits::__node_pointer       __node_pointer;
+    typedef typename __traits::__begin_node_pointer __begin_node_pointer;
+    typedef typename __traits::__iter_node_pointer  __iter_node_pointer;
+    typedef typename __traits::__void_pointer       __void_pointer;
+
+    __iter_node_pointer __ptr_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __begin_node_pointer __get_begin() const {
+        return static_cast<__begin_node_pointer>(
+                static_cast<__void_pointer>(__ptr_));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    __node_pointer __get_unsafe_node_pointer() const {
+        return static_cast<__node_pointer>(
+                static_cast<__void_pointer>(__ptr_));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __forward_list_iterator(nullptr_t) _NOEXCEPT : __ptr_(nullptr) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __forward_list_iterator(__begin_node_pointer __p) _NOEXCEPT
+        : __ptr_(__traits::__as_iter_node(__p)) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __forward_list_iterator(__node_pointer __p) _NOEXCEPT
+        : __ptr_(__traits::__as_iter_node(__p)) {}
+
+    template<class, class> friend class _LIBCPP_TEMPLATE_VIS forward_list;
+    template<class> friend class _LIBCPP_TEMPLATE_VIS __forward_list_const_iterator;
+
+public:
+    typedef forward_iterator_tag                              iterator_category;
+    typedef typename __traits::__node_value_type              value_type;
+    typedef value_type&                                       reference;
+    typedef typename pointer_traits<__node_pointer>::difference_type
+                                                              difference_type;
+    typedef __rebind_pointer_t<__node_pointer, value_type> pointer;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __forward_list_iterator() _NOEXCEPT : __ptr_(nullptr) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const {return __get_unsafe_node_pointer()->__value_;}
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const {
+        return pointer_traits<pointer>::pointer_to(__get_unsafe_node_pointer()->__value_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __forward_list_iterator& operator++()
+    {
+        __ptr_ = __traits::__as_iter_node(__ptr_->__next_);
+        return *this;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    __forward_list_iterator operator++(int)
+    {
+        __forward_list_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const __forward_list_iterator& __x,
+                    const __forward_list_iterator& __y)
+        {return __x.__ptr_ == __y.__ptr_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const __forward_list_iterator& __x,
+                    const __forward_list_iterator& __y)
+        {return !(__x == __y);}
+};
+
+template <class _NodeConstPtr>
+class _LIBCPP_TEMPLATE_VIS __forward_list_const_iterator
+{
+    static_assert((!is_const<typename pointer_traits<_NodeConstPtr>::element_type>::value), "");
+    typedef _NodeConstPtr _NodePtr;
+
+    typedef __forward_node_traits<_NodePtr>         __traits;
+    typedef typename __traits::__node               __node;
+    typedef typename __traits::__node_pointer       __node_pointer;
+    typedef typename __traits::__begin_node_pointer __begin_node_pointer;
+    typedef typename __traits::__iter_node_pointer  __iter_node_pointer;
+    typedef typename __traits::__void_pointer       __void_pointer;
+
+    __iter_node_pointer __ptr_;
+
+    __begin_node_pointer __get_begin() const {
+        return static_cast<__begin_node_pointer>(
+                static_cast<__void_pointer>(__ptr_));
+    }
+    __node_pointer __get_unsafe_node_pointer() const {
+        return static_cast<__node_pointer>(
+                static_cast<__void_pointer>(__ptr_));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __forward_list_const_iterator(nullptr_t) _NOEXCEPT
+        : __ptr_(nullptr) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __forward_list_const_iterator(__begin_node_pointer __p) _NOEXCEPT
+        : __ptr_(__traits::__as_iter_node(__p)) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __forward_list_const_iterator(__node_pointer __p) _NOEXCEPT
+        : __ptr_(__traits::__as_iter_node(__p)) {}
+
+
+    template<class, class> friend class forward_list;
+
+public:
+    typedef forward_iterator_tag                              iterator_category;
+    typedef typename __traits::__node_value_type              value_type;
+    typedef const value_type&                                 reference;
+    typedef typename pointer_traits<__node_pointer>::difference_type
+                                                              difference_type;
+    typedef __rebind_pointer_t<__node_pointer, const value_type>
+                                                              pointer;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __forward_list_const_iterator() _NOEXCEPT : __ptr_(nullptr) {}
+    _LIBCPP_INLINE_VISIBILITY
+    __forward_list_const_iterator(__forward_list_iterator<__node_pointer> __p) _NOEXCEPT
+        : __ptr_(__p.__ptr_) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const {return __get_unsafe_node_pointer()->__value_;}
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const {return pointer_traits<pointer>::pointer_to(
+                __get_unsafe_node_pointer()->__value_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __forward_list_const_iterator& operator++()
+    {
+        __ptr_ = __traits::__as_iter_node(__ptr_->__next_);
+        return *this;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    __forward_list_const_iterator operator++(int)
+    {
+        __forward_list_const_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const __forward_list_const_iterator& __x,
+                    const __forward_list_const_iterator& __y)
+        {return __x.__ptr_ == __y.__ptr_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const __forward_list_const_iterator& __x,
+                           const __forward_list_const_iterator& __y)
+        {return !(__x == __y);}
+};
+
+template <class _Tp, class _Alloc>
+class __forward_list_base
+{
+protected:
+    typedef _Tp    value_type;
+    typedef _Alloc allocator_type;
+
+    typedef typename allocator_traits<allocator_type>::void_pointer  void_pointer;
+    typedef __forward_list_node<value_type, void_pointer>            __node;
+    typedef __begin_node_of<value_type, void_pointer>                __begin_node;
+    typedef __rebind_alloc<allocator_traits<allocator_type>, __node> __node_allocator;
+    typedef allocator_traits<__node_allocator>        __node_traits;
+    typedef typename __node_traits::pointer           __node_pointer;
+
+    typedef __rebind_alloc<allocator_traits<allocator_type>, __begin_node> __begin_node_allocator;
+    typedef typename allocator_traits<__begin_node_allocator>::pointer
+                                                      __begin_node_pointer;
+
+    static_assert((!is_same<allocator_type, __node_allocator>::value),
+                  "internal allocator type must differ from user-specified "
+                  "type; otherwise overload resolution breaks");
+
+    static_assert(is_same<allocator_type, __rebind_alloc<__node_traits, value_type> >::value,
+                  "[allocator.requirements] states that rebinding an allocator to the same type should result in the "
+                  "original allocator");
+
+    __compressed_pair<__begin_node, __node_allocator> __before_begin_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __begin_node_pointer        __before_begin() _NOEXCEPT
+        {return pointer_traits<__begin_node_pointer>::pointer_to(__before_begin_.first());}
+    _LIBCPP_INLINE_VISIBILITY
+    __begin_node_pointer __before_begin() const _NOEXCEPT
+        {return pointer_traits<__begin_node_pointer>::pointer_to(const_cast<__begin_node&>(__before_begin_.first()));}
+
+    _LIBCPP_INLINE_VISIBILITY
+          __node_allocator& __alloc() _NOEXCEPT
+            {return __before_begin_.second();}
+    _LIBCPP_INLINE_VISIBILITY
+    const __node_allocator& __alloc() const _NOEXCEPT
+        {return __before_begin_.second();}
+
+    typedef __forward_list_iterator<__node_pointer>             iterator;
+    typedef __forward_list_const_iterator<__node_pointer>       const_iterator;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __forward_list_base()
+        _NOEXCEPT_(is_nothrow_default_constructible<__node_allocator>::value)
+        : __before_begin_(__begin_node(), __default_init_tag()) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __forward_list_base(const allocator_type& __a)
+        : __before_begin_(__begin_node(), __node_allocator(__a)) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __forward_list_base(const __node_allocator& __a)
+        : __before_begin_(__begin_node(), __a) {}
+#ifndef _LIBCPP_CXX03_LANG
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __forward_list_base(__forward_list_base&& __x)
+        _NOEXCEPT_(is_nothrow_move_constructible<__node_allocator>::value);
+    _LIBCPP_INLINE_VISIBILITY
+    __forward_list_base(__forward_list_base&& __x, const allocator_type& __a);
+#endif // _LIBCPP_CXX03_LANG
+
+private:
+    __forward_list_base(const __forward_list_base&);
+    __forward_list_base& operator=(const __forward_list_base&);
+
+public:
+    ~__forward_list_base();
+
+protected:
+    _LIBCPP_INLINE_VISIBILITY
+    void __copy_assign_alloc(const __forward_list_base& __x)
+        {__copy_assign_alloc(__x, integral_constant<bool,
+              __node_traits::propagate_on_container_copy_assignment::value>());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __move_assign_alloc(__forward_list_base& __x)
+        _NOEXCEPT_(!__node_traits::propagate_on_container_move_assignment::value ||
+                   is_nothrow_move_assignable<__node_allocator>::value)
+        {__move_assign_alloc(__x, integral_constant<bool,
+              __node_traits::propagate_on_container_move_assignment::value>());}
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(__forward_list_base& __x)
+#if _LIBCPP_STD_VER >= 14
+        _NOEXCEPT;
+#else
+        _NOEXCEPT_(!__node_traits::propagate_on_container_swap::value ||
+                    __is_nothrow_swappable<__node_allocator>::value);
+#endif
+protected:
+    void clear() _NOEXCEPT;
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    void __copy_assign_alloc(const __forward_list_base&, false_type) {}
+    _LIBCPP_INLINE_VISIBILITY
+    void __copy_assign_alloc(const __forward_list_base& __x, true_type)
+    {
+        if (__alloc() != __x.__alloc())
+            clear();
+        __alloc() = __x.__alloc();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __move_assign_alloc(__forward_list_base&, false_type) _NOEXCEPT
+        {}
+    _LIBCPP_INLINE_VISIBILITY
+    void __move_assign_alloc(__forward_list_base& __x, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<__node_allocator>::value)
+        {__alloc() = _VSTD::move(__x.__alloc());}
+};
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Alloc>
+inline
+__forward_list_base<_Tp, _Alloc>::__forward_list_base(__forward_list_base&& __x)
+        _NOEXCEPT_(is_nothrow_move_constructible<__node_allocator>::value)
+    : __before_begin_(_VSTD::move(__x.__before_begin_))
+{
+    __x.__before_begin()->__next_ = nullptr;
+}
+
+template <class _Tp, class _Alloc>
+inline
+__forward_list_base<_Tp, _Alloc>::__forward_list_base(__forward_list_base&& __x,
+                                                      const allocator_type& __a)
+    : __before_begin_(__begin_node(), __node_allocator(__a))
+{
+    if (__alloc() == __x.__alloc())
+    {
+        __before_begin()->__next_ = __x.__before_begin()->__next_;
+        __x.__before_begin()->__next_ = nullptr;
+    }
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Alloc>
+__forward_list_base<_Tp, _Alloc>::~__forward_list_base()
+{
+    clear();
+}
+
+template <class _Tp, class _Alloc>
+inline
+void
+__forward_list_base<_Tp, _Alloc>::swap(__forward_list_base& __x)
+#if _LIBCPP_STD_VER >= 14
+        _NOEXCEPT
+#else
+        _NOEXCEPT_(!__node_traits::propagate_on_container_swap::value ||
+                    __is_nothrow_swappable<__node_allocator>::value)
+#endif
+{
+    _VSTD::__swap_allocator(__alloc(), __x.__alloc(),
+            integral_constant<bool, __node_traits::propagate_on_container_swap::value>());
+    using _VSTD::swap;
+    swap(__before_begin()->__next_, __x.__before_begin()->__next_);
+}
+
+template <class _Tp, class _Alloc>
+void
+__forward_list_base<_Tp, _Alloc>::clear() _NOEXCEPT
+{
+    __node_allocator& __a = __alloc();
+    for (__node_pointer __p = __before_begin()->__next_; __p != nullptr;)
+    {
+        __node_pointer __next = __p->__next_;
+        __node_traits::destroy(__a, _VSTD::addressof(__p->__value_));
+        __node_traits::deallocate(__a, __p, 1);
+        __p = __next;
+    }
+    __before_begin()->__next_ = nullptr;
+}
+
+template <class _Tp, class _Alloc /*= allocator<_Tp>*/>
+class _LIBCPP_TEMPLATE_VIS forward_list
+    : private __forward_list_base<_Tp, _Alloc>
+{
+    typedef __forward_list_base<_Tp, _Alloc> base;
+    typedef typename base::__node_allocator  __node_allocator;
+    typedef typename base::__node               __node;
+    typedef typename base::__node_traits        __node_traits;
+    typedef typename base::__node_pointer       __node_pointer;
+    typedef typename base::__begin_node_pointer __begin_node_pointer;
+
+public:
+    typedef _Tp    value_type;
+    typedef _Alloc allocator_type;
+
+    static_assert((is_same<typename allocator_type::value_type, value_type>::value),
+                  "Allocator::value_type must be same type as value_type");
+
+    typedef value_type&                                                 reference;
+    typedef const value_type&                                           const_reference;
+    typedef typename allocator_traits<allocator_type>::pointer          pointer;
+    typedef typename allocator_traits<allocator_type>::const_pointer    const_pointer;
+    typedef typename allocator_traits<allocator_type>::size_type        size_type;
+    typedef typename allocator_traits<allocator_type>::difference_type  difference_type;
+
+    typedef typename base::iterator       iterator;
+    typedef typename base::const_iterator const_iterator;
+#if _LIBCPP_STD_VER > 17
+    typedef size_type                                __remove_return_type;
+#else
+    typedef void                                     __remove_return_type;
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    forward_list()
+        _NOEXCEPT_(is_nothrow_default_constructible<__node_allocator>::value)
+        {} // = default;
+    _LIBCPP_INLINE_VISIBILITY
+    explicit forward_list(const allocator_type& __a);
+    explicit forward_list(size_type __n);
+#if _LIBCPP_STD_VER > 11
+    explicit forward_list(size_type __n, const allocator_type& __a);
+#endif
+    forward_list(size_type __n, const value_type& __v);
+
+    template <class = __enable_if_t<__is_allocator<_Alloc>::value> >
+    forward_list(size_type __n, const value_type& __v, const allocator_type& __a) : base(__a)
+    {
+        insert_after(cbefore_begin(), __n, __v);
+    }
+
+    template <class _InputIterator>
+        forward_list(_InputIterator __f, _InputIterator __l,
+                     __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>* = nullptr);
+    template <class _InputIterator>
+        forward_list(_InputIterator __f, _InputIterator __l,
+                     const allocator_type& __a,
+                     __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>* = nullptr);
+    forward_list(const forward_list& __x);
+    forward_list(const forward_list& __x, const __type_identity_t<allocator_type>& __a);
+
+    forward_list& operator=(const forward_list& __x);
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    forward_list(forward_list&& __x)
+        _NOEXCEPT_(is_nothrow_move_constructible<base>::value)
+        : base(_VSTD::move(__x)) {}
+    forward_list(forward_list&& __x, const __type_identity_t<allocator_type>& __a);
+
+    forward_list(initializer_list<value_type> __il);
+    forward_list(initializer_list<value_type> __il, const allocator_type& __a);
+
+    _LIBCPP_INLINE_VISIBILITY
+    forward_list& operator=(forward_list&& __x)
+        _NOEXCEPT_(
+             __node_traits::propagate_on_container_move_assignment::value &&
+             is_nothrow_move_assignable<allocator_type>::value);
+
+    _LIBCPP_INLINE_VISIBILITY
+    forward_list& operator=(initializer_list<value_type> __il);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void assign(initializer_list<value_type> __il);
+#endif // _LIBCPP_CXX03_LANG
+
+    // ~forward_list() = default;
+
+    template <class _InputIterator>
+    __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value, void>
+        assign(_InputIterator __f, _InputIterator __l);
+    void assign(size_type __n, const value_type& __v);
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const _NOEXCEPT
+        {return allocator_type(base::__alloc());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       begin() _NOEXCEPT
+        {return       iterator(base::__before_begin()->__next_);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin() const _NOEXCEPT
+        {return const_iterator(base::__before_begin()->__next_);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       end() _NOEXCEPT
+        {return       iterator(nullptr);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end() const _NOEXCEPT
+        {return const_iterator(nullptr);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbegin() const _NOEXCEPT
+        {return const_iterator(base::__before_begin()->__next_);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cend() const _NOEXCEPT
+        {return const_iterator(nullptr);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       before_begin() _NOEXCEPT
+        {return       iterator(base::__before_begin());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator before_begin() const _NOEXCEPT
+        {return const_iterator(base::__before_begin());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbefore_begin() const _NOEXCEPT
+        {return const_iterator(base::__before_begin());}
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool empty() const _NOEXCEPT
+        {return base::__before_begin()->__next_ == nullptr;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT {
+        return _VSTD::min<size_type>(
+            __node_traits::max_size(base::__alloc()),
+            numeric_limits<difference_type>::max());
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference       front()       {return base::__before_begin()->__next_->__value_;}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reference front() const {return base::__before_begin()->__next_->__value_;}
+
+#ifndef _LIBCPP_CXX03_LANG
+#if _LIBCPP_STD_VER > 14
+    template <class... _Args> reference emplace_front(_Args&&... __args);
+#else
+    template <class... _Args> void      emplace_front(_Args&&... __args);
+#endif
+    void push_front(value_type&& __v);
+#endif // _LIBCPP_CXX03_LANG
+    void push_front(const value_type& __v);
+
+    void pop_front();
+
+#ifndef _LIBCPP_CXX03_LANG
+    template <class... _Args>
+        iterator emplace_after(const_iterator __p, _Args&&... __args);
+
+    iterator insert_after(const_iterator __p, value_type&& __v);
+    iterator insert_after(const_iterator __p, initializer_list<value_type> __il)
+        {return insert_after(__p, __il.begin(), __il.end());}
+#endif // _LIBCPP_CXX03_LANG
+    iterator insert_after(const_iterator __p, const value_type& __v);
+    iterator insert_after(const_iterator __p, size_type __n, const value_type& __v);
+    template <class _InputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value, iterator>
+        insert_after(const_iterator __p, _InputIterator __f, _InputIterator __l);
+
+    iterator erase_after(const_iterator __p);
+    iterator erase_after(const_iterator __f, const_iterator __l);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(forward_list& __x)
+#if _LIBCPP_STD_VER >= 14
+        _NOEXCEPT
+#else
+        _NOEXCEPT_(!__node_traits::propagate_on_container_swap::value ||
+                   __is_nothrow_swappable<__node_allocator>::value)
+#endif
+        {base::swap(__x);}
+
+    void resize(size_type __n);
+    void resize(size_type __n, const value_type& __v);
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() _NOEXCEPT {base::clear();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void splice_after(const_iterator __p, forward_list&& __x);
+    _LIBCPP_INLINE_VISIBILITY
+    void splice_after(const_iterator __p, forward_list&& __x, const_iterator __i);
+    _LIBCPP_INLINE_VISIBILITY
+    void splice_after(const_iterator __p, forward_list&& __x,
+                      const_iterator __f, const_iterator __l);
+    void splice_after(const_iterator __p, forward_list& __x);
+    void splice_after(const_iterator __p, forward_list& __x, const_iterator __i);
+    void splice_after(const_iterator __p, forward_list& __x,
+                      const_iterator __f, const_iterator __l);
+    __remove_return_type remove(const value_type& __v);
+    template <class _Predicate> __remove_return_type remove_if(_Predicate __pred);
+    _LIBCPP_INLINE_VISIBILITY
+    __remove_return_type unique() { return unique(__equal_to()); }
+    template <class _BinaryPredicate> __remove_return_type unique(_BinaryPredicate __binary_pred);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(forward_list&& __x) {merge(__x, __less<value_type>());}
+    template <class _Compare>
+        _LIBCPP_INLINE_VISIBILITY
+        void merge(forward_list&& __x, _Compare __comp)
+        {merge(__x, _VSTD::move(__comp));}
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(forward_list& __x) {merge(__x, __less<value_type>());}
+    template <class _Compare> void merge(forward_list& __x, _Compare __comp);
+    _LIBCPP_INLINE_VISIBILITY
+    void sort() {sort(__less<value_type>());}
+    template <class _Compare> _LIBCPP_INLINE_VISIBILITY void sort(_Compare __comp);
+    void reverse() _NOEXCEPT;
+
+private:
+
+#ifndef _LIBCPP_CXX03_LANG
+    void __move_assign(forward_list& __x, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value);
+    void __move_assign(forward_list& __x, false_type);
+#endif // _LIBCPP_CXX03_LANG
+
+    template <class _Compare>
+        static
+        __node_pointer
+        __merge(__node_pointer __f1, __node_pointer __f2, _Compare& __comp);
+
+    template <class _Compare>
+        static
+        __node_pointer
+        __sort(__node_pointer __f, difference_type __sz, _Compare& __comp);
+};
+
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator,
+         class _Alloc = allocator<__iter_value_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Alloc>::value>
+         >
+forward_list(_InputIterator, _InputIterator)
+  -> forward_list<__iter_value_type<_InputIterator>, _Alloc>;
+
+template<class _InputIterator,
+         class _Alloc,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Alloc>::value>
+         >
+forward_list(_InputIterator, _InputIterator, _Alloc)
+  -> forward_list<__iter_value_type<_InputIterator>, _Alloc>;
+#endif
+
+template <class _Tp, class _Alloc>
+inline
+forward_list<_Tp, _Alloc>::forward_list(const allocator_type& __a)
+    : base(__a)
+{
+}
+
+template <class _Tp, class _Alloc>
+forward_list<_Tp, _Alloc>::forward_list(size_type __n)
+{
+    if (__n > 0)
+    {
+        __node_allocator& __a = base::__alloc();
+        typedef __allocator_destructor<__node_allocator> _Dp;
+        unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
+        for (__begin_node_pointer __p = base::__before_begin(); __n > 0; --__n,
+                                                             __p = __p->__next_as_begin())
+        {
+            __h.reset(__node_traits::allocate(__a, 1));
+            __node_traits::construct(__a, _VSTD::addressof(__h->__value_));
+            __h->__next_ = nullptr;
+            __p->__next_ = __h.release();
+        }
+    }
+}
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp, class _Alloc>
+forward_list<_Tp, _Alloc>::forward_list(size_type __n,
+                                        const allocator_type& __base_alloc)
+    : base ( __base_alloc )
+{
+    if (__n > 0)
+    {
+        __node_allocator& __a = base::__alloc();
+        typedef __allocator_destructor<__node_allocator> _Dp;
+        unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
+        for (__begin_node_pointer __p = base::__before_begin(); __n > 0; --__n,
+                                                             __p = __p->__next_as_begin())
+        {
+            __h.reset(__node_traits::allocate(__a, 1));
+            __node_traits::construct(__a, _VSTD::addressof(__h->__value_));
+            __h->__next_ = nullptr;
+            __p->__next_ = __h.release();
+        }
+    }
+}
+#endif
+
+template <class _Tp, class _Alloc>
+forward_list<_Tp, _Alloc>::forward_list(size_type __n, const value_type& __v)
+{
+    insert_after(cbefore_begin(), __n, __v);
+}
+
+template <class _Tp, class _Alloc>
+template <class _InputIterator>
+forward_list<_Tp, _Alloc>::forward_list(_InputIterator __f, _InputIterator __l,
+                                        __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>*)
+{
+    insert_after(cbefore_begin(), __f, __l);
+}
+
+template <class _Tp, class _Alloc>
+template <class _InputIterator>
+forward_list<_Tp, _Alloc>::forward_list(_InputIterator __f, _InputIterator __l,
+                                        const allocator_type& __a,
+                                        __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>*)
+    : base(__a)
+{
+    insert_after(cbefore_begin(), __f, __l);
+}
+
+template <class _Tp, class _Alloc>
+forward_list<_Tp, _Alloc>::forward_list(const forward_list& __x)
+    : base(
+          __node_traits::select_on_container_copy_construction(__x.__alloc())) {
+  insert_after(cbefore_begin(), __x.begin(), __x.end());
+}
+
+template <class _Tp, class _Alloc>
+forward_list<_Tp, _Alloc>::forward_list(const forward_list& __x,
+                                        const __type_identity_t<allocator_type>& __a)
+    : base(__a)
+{
+    insert_after(cbefore_begin(), __x.begin(), __x.end());
+}
+
+template <class _Tp, class _Alloc>
+forward_list<_Tp, _Alloc>&
+forward_list<_Tp, _Alloc>::operator=(const forward_list& __x)
+{
+    if (this != _VSTD::addressof(__x))
+    {
+        base::__copy_assign_alloc(__x);
+        assign(__x.begin(), __x.end());
+    }
+    return *this;
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Tp, class _Alloc>
+forward_list<_Tp, _Alloc>::forward_list(forward_list&& __x,
+                                        const __type_identity_t<allocator_type>& __a)
+    : base(_VSTD::move(__x), __a)
+{
+    if (base::__alloc() != __x.__alloc())
+    {
+        typedef move_iterator<iterator> _Ip;
+        insert_after(cbefore_begin(), _Ip(__x.begin()), _Ip(__x.end()));
+    }
+}
+
+template <class _Tp, class _Alloc>
+forward_list<_Tp, _Alloc>::forward_list(initializer_list<value_type> __il)
+{
+    insert_after(cbefore_begin(), __il.begin(), __il.end());
+}
+
+template <class _Tp, class _Alloc>
+forward_list<_Tp, _Alloc>::forward_list(initializer_list<value_type> __il,
+                                        const allocator_type& __a)
+    : base(__a)
+{
+    insert_after(cbefore_begin(), __il.begin(), __il.end());
+}
+
+template <class _Tp, class _Alloc>
+void
+forward_list<_Tp, _Alloc>::__move_assign(forward_list& __x, true_type)
+    _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
+{
+    clear();
+    base::__move_assign_alloc(__x);
+    base::__before_begin()->__next_ = __x.__before_begin()->__next_;
+    __x.__before_begin()->__next_ = nullptr;
+}
+
+template <class _Tp, class _Alloc>
+void
+forward_list<_Tp, _Alloc>::__move_assign(forward_list& __x, false_type)
+{
+    if (base::__alloc() == __x.__alloc())
+        __move_assign(__x, true_type());
+    else
+    {
+        typedef move_iterator<iterator> _Ip;
+        assign(_Ip(__x.begin()), _Ip(__x.end()));
+    }
+}
+
+template <class _Tp, class _Alloc>
+inline
+forward_list<_Tp, _Alloc>&
+forward_list<_Tp, _Alloc>::operator=(forward_list&& __x)
+    _NOEXCEPT_(
+             __node_traits::propagate_on_container_move_assignment::value &&
+             is_nothrow_move_assignable<allocator_type>::value)
+{
+    __move_assign(__x, integral_constant<bool,
+          __node_traits::propagate_on_container_move_assignment::value>());
+    return *this;
+}
+
+template <class _Tp, class _Alloc>
+inline
+forward_list<_Tp, _Alloc>&
+forward_list<_Tp, _Alloc>::operator=(initializer_list<value_type> __il)
+{
+    assign(__il.begin(), __il.end());
+    return *this;
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Alloc>
+template <class _InputIterator>
+__enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value, void>
+forward_list<_Tp, _Alloc>::assign(_InputIterator __f, _InputIterator __l)
+{
+    iterator __i = before_begin();
+    iterator __j = _VSTD::next(__i);
+    iterator __e = end();
+    for (; __j != __e && __f != __l; ++__i, (void) ++__j, ++__f)
+        *__j = *__f;
+    if (__j == __e)
+        insert_after(__i, __f, __l);
+    else
+        erase_after(__i, __e);
+}
+
+template <class _Tp, class _Alloc>
+void
+forward_list<_Tp, _Alloc>::assign(size_type __n, const value_type& __v)
+{
+    iterator __i = before_begin();
+    iterator __j = _VSTD::next(__i);
+    iterator __e = end();
+    for (; __j != __e && __n > 0; --__n, ++__i, ++__j)
+        *__j = __v;
+    if (__j == __e)
+        insert_after(__i, __n, __v);
+    else
+        erase_after(__i, __e);
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Alloc>
+inline
+void
+forward_list<_Tp, _Alloc>::assign(initializer_list<value_type> __il)
+{
+    assign(__il.begin(), __il.end());
+}
+
+template <class _Tp, class _Alloc>
+template <class... _Args>
+#if _LIBCPP_STD_VER > 14
+typename forward_list<_Tp, _Alloc>::reference
+#else
+void
+#endif
+forward_list<_Tp, _Alloc>::emplace_front(_Args&&... __args)
+{
+    __node_allocator& __a = base::__alloc();
+    typedef __allocator_destructor<__node_allocator> _Dp;
+    unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
+    __node_traits::construct(__a, _VSTD::addressof(__h->__value_),
+                                  _VSTD::forward<_Args>(__args)...);
+    __h->__next_ = base::__before_begin()->__next_;
+    base::__before_begin()->__next_ = __h.release();
+#if _LIBCPP_STD_VER > 14
+    return base::__before_begin()->__next_->__value_;
+#endif
+}
+
+template <class _Tp, class _Alloc>
+void
+forward_list<_Tp, _Alloc>::push_front(value_type&& __v)
+{
+    __node_allocator& __a = base::__alloc();
+    typedef __allocator_destructor<__node_allocator> _Dp;
+    unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
+    __node_traits::construct(__a, _VSTD::addressof(__h->__value_), _VSTD::move(__v));
+    __h->__next_ = base::__before_begin()->__next_;
+    base::__before_begin()->__next_ = __h.release();
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Alloc>
+void
+forward_list<_Tp, _Alloc>::push_front(const value_type& __v)
+{
+    __node_allocator& __a = base::__alloc();
+    typedef __allocator_destructor<__node_allocator> _Dp;
+    unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
+    __node_traits::construct(__a, _VSTD::addressof(__h->__value_), __v);
+    __h->__next_ = base::__before_begin()->__next_;
+    base::__before_begin()->__next_ = __h.release();
+}
+
+template <class _Tp, class _Alloc>
+void
+forward_list<_Tp, _Alloc>::pop_front()
+{
+    __node_allocator& __a = base::__alloc();
+    __node_pointer __p = base::__before_begin()->__next_;
+    base::__before_begin()->__next_ = __p->__next_;
+    __node_traits::destroy(__a, _VSTD::addressof(__p->__value_));
+    __node_traits::deallocate(__a, __p, 1);
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Alloc>
+template <class... _Args>
+typename forward_list<_Tp, _Alloc>::iterator
+forward_list<_Tp, _Alloc>::emplace_after(const_iterator __p, _Args&&... __args)
+{
+    __begin_node_pointer const __r = __p.__get_begin();
+    __node_allocator& __a = base::__alloc();
+    typedef __allocator_destructor<__node_allocator> _Dp;
+    unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
+    __node_traits::construct(__a, _VSTD::addressof(__h->__value_),
+                                  _VSTD::forward<_Args>(__args)...);
+    __h->__next_ = __r->__next_;
+    __r->__next_ = __h.release();
+    return iterator(__r->__next_);
+}
+
+template <class _Tp, class _Alloc>
+typename forward_list<_Tp, _Alloc>::iterator
+forward_list<_Tp, _Alloc>::insert_after(const_iterator __p, value_type&& __v)
+{
+    __begin_node_pointer const __r = __p.__get_begin();
+    __node_allocator& __a = base::__alloc();
+    typedef __allocator_destructor<__node_allocator> _Dp;
+    unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
+    __node_traits::construct(__a, _VSTD::addressof(__h->__value_), _VSTD::move(__v));
+    __h->__next_ = __r->__next_;
+    __r->__next_ = __h.release();
+    return iterator(__r->__next_);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Alloc>
+typename forward_list<_Tp, _Alloc>::iterator
+forward_list<_Tp, _Alloc>::insert_after(const_iterator __p, const value_type& __v)
+{
+    __begin_node_pointer const __r = __p.__get_begin();
+    __node_allocator& __a = base::__alloc();
+    typedef __allocator_destructor<__node_allocator> _Dp;
+    unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
+    __node_traits::construct(__a, _VSTD::addressof(__h->__value_), __v);
+    __h->__next_ = __r->__next_;
+    __r->__next_ = __h.release();
+    return iterator(__r->__next_);
+}
+
+template <class _Tp, class _Alloc>
+typename forward_list<_Tp, _Alloc>::iterator
+forward_list<_Tp, _Alloc>::insert_after(const_iterator __p, size_type __n,
+                                        const value_type& __v)
+{
+    __begin_node_pointer __r = __p.__get_begin();
+    if (__n > 0)
+    {
+        __node_allocator& __a = base::__alloc();
+        typedef __allocator_destructor<__node_allocator> _Dp;
+        unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
+        __node_traits::construct(__a, _VSTD::addressof(__h->__value_), __v);
+        __node_pointer __first = __h.release();
+        __node_pointer __last = __first;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (--__n; __n != 0; --__n, __last = __last->__next_)
+            {
+                __h.reset(__node_traits::allocate(__a, 1));
+                __node_traits::construct(__a, _VSTD::addressof(__h->__value_), __v);
+                __last->__next_ = __h.release();
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            while (__first != nullptr)
+            {
+                __node_pointer __next = __first->__next_;
+                __node_traits::destroy(__a, _VSTD::addressof(__first->__value_));
+                __node_traits::deallocate(__a, __first, 1);
+                __first = __next;
+            }
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __last->__next_ = __r->__next_;
+        __r->__next_ = __first;
+        __r = static_cast<__begin_node_pointer>(__last);
+    }
+    return iterator(__r);
+}
+
+template <class _Tp, class _Alloc>
+template <class _InputIterator>
+__enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value, typename forward_list<_Tp, _Alloc>::iterator>
+forward_list<_Tp, _Alloc>::insert_after(const_iterator __p,
+                                        _InputIterator __f, _InputIterator __l)
+{
+    __begin_node_pointer __r = __p.__get_begin();
+    if (__f != __l)
+    {
+        __node_allocator& __a = base::__alloc();
+        typedef __allocator_destructor<__node_allocator> _Dp;
+        unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
+        __node_traits::construct(__a, _VSTD::addressof(__h->__value_), *__f);
+        __node_pointer __first = __h.release();
+        __node_pointer __last = __first;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (++__f; __f != __l; ++__f, ((void)(__last = __last->__next_)))
+            {
+                __h.reset(__node_traits::allocate(__a, 1));
+                __node_traits::construct(__a, _VSTD::addressof(__h->__value_), *__f);
+                __last->__next_ = __h.release();
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            while (__first != nullptr)
+            {
+                __node_pointer __next = __first->__next_;
+                __node_traits::destroy(__a, _VSTD::addressof(__first->__value_));
+                __node_traits::deallocate(__a, __first, 1);
+                __first = __next;
+            }
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __last->__next_ = __r->__next_;
+        __r->__next_ = __first;
+        __r = static_cast<__begin_node_pointer>(__last);
+    }
+    return iterator(__r);
+}
+
+template <class _Tp, class _Alloc>
+typename forward_list<_Tp, _Alloc>::iterator
+forward_list<_Tp, _Alloc>::erase_after(const_iterator __f)
+{
+    __begin_node_pointer __p = __f.__get_begin();
+    __node_pointer __n = __p->__next_;
+    __p->__next_ = __n->__next_;
+    __node_allocator& __a = base::__alloc();
+    __node_traits::destroy(__a, _VSTD::addressof(__n->__value_));
+    __node_traits::deallocate(__a, __n, 1);
+    return iterator(__p->__next_);
+}
+
+template <class _Tp, class _Alloc>
+typename forward_list<_Tp, _Alloc>::iterator
+forward_list<_Tp, _Alloc>::erase_after(const_iterator __f, const_iterator __l)
+{
+    __node_pointer __e = __l.__get_unsafe_node_pointer();
+    if (__f != __l)
+    {
+        __begin_node_pointer __bp = __f.__get_begin();
+
+        __node_pointer __n = __bp->__next_;
+        if (__n != __e)
+        {
+            __bp->__next_ = __e;
+            __node_allocator& __a = base::__alloc();
+            do
+            {
+                __node_pointer __tmp = __n->__next_;
+                __node_traits::destroy(__a, _VSTD::addressof(__n->__value_));
+                __node_traits::deallocate(__a, __n, 1);
+                __n = __tmp;
+            } while (__n != __e);
+        }
+    }
+    return iterator(__e);
+}
+
+template <class _Tp, class _Alloc>
+void
+forward_list<_Tp, _Alloc>::resize(size_type __n)
+{
+    size_type __sz = 0;
+    iterator __p = before_begin();
+    iterator __i = begin();
+    iterator __e = end();
+    for (; __i != __e && __sz < __n; ++__p, ++__i, ++__sz)
+        ;
+    if (__i != __e)
+        erase_after(__p, __e);
+    else
+    {
+        __n -= __sz;
+        if (__n > 0)
+        {
+            __node_allocator& __a = base::__alloc();
+            typedef __allocator_destructor<__node_allocator> _Dp;
+            unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
+            for (__begin_node_pointer __ptr = __p.__get_begin(); __n > 0; --__n,
+                                                         __ptr = __ptr->__next_as_begin())
+            {
+                __h.reset(__node_traits::allocate(__a, 1));
+                __node_traits::construct(__a, _VSTD::addressof(__h->__value_));
+                __h->__next_ = nullptr;
+                __ptr->__next_ = __h.release();
+            }
+        }
+    }
+}
+
+template <class _Tp, class _Alloc>
+void
+forward_list<_Tp, _Alloc>::resize(size_type __n, const value_type& __v)
+{
+    size_type __sz = 0;
+    iterator __p = before_begin();
+    iterator __i = begin();
+    iterator __e = end();
+    for (; __i != __e && __sz < __n; ++__p, ++__i, ++__sz)
+        ;
+    if (__i != __e)
+        erase_after(__p, __e);
+    else
+    {
+        __n -= __sz;
+        if (__n > 0)
+        {
+            __node_allocator& __a = base::__alloc();
+            typedef __allocator_destructor<__node_allocator> _Dp;
+            unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
+            for (__begin_node_pointer __ptr = __p.__get_begin(); __n > 0; --__n,
+                                                         __ptr = __ptr->__next_as_begin())
+            {
+                __h.reset(__node_traits::allocate(__a, 1));
+                __node_traits::construct(__a, _VSTD::addressof(__h->__value_), __v);
+                __h->__next_ = nullptr;
+                __ptr->__next_ = __h.release();
+            }
+        }
+    }
+}
+
+template <class _Tp, class _Alloc>
+void
+forward_list<_Tp, _Alloc>::splice_after(const_iterator __p,
+                                        forward_list& __x)
+{
+    if (!__x.empty())
+    {
+        if (__p.__get_begin()->__next_ != nullptr)
+        {
+            const_iterator __lm1 = __x.before_begin();
+            while (__lm1.__get_begin()->__next_ != nullptr)
+                ++__lm1;
+            __lm1.__get_begin()->__next_ = __p.__get_begin()->__next_;
+        }
+        __p.__get_begin()->__next_ = __x.__before_begin()->__next_;
+        __x.__before_begin()->__next_ = nullptr;
+    }
+}
+
+template <class _Tp, class _Alloc>
+void
+forward_list<_Tp, _Alloc>::splice_after(const_iterator __p,
+                                        forward_list& /*__other*/,
+                                        const_iterator __i)
+{
+    const_iterator __lm1 = _VSTD::next(__i);
+    if (__p != __i && __p != __lm1)
+    {
+        __i.__get_begin()->__next_ = __lm1.__get_begin()->__next_;
+        __lm1.__get_begin()->__next_ = __p.__get_begin()->__next_;
+        __p.__get_begin()->__next_ = __lm1.__get_unsafe_node_pointer();
+    }
+}
+
+template <class _Tp, class _Alloc>
+void
+forward_list<_Tp, _Alloc>::splice_after(const_iterator __p,
+                                        forward_list& /*__other*/,
+                                        const_iterator __f, const_iterator __l)
+{
+    if (__f != __l && __p != __f)
+    {
+        const_iterator __lm1 = __f;
+        while (__lm1.__get_begin()->__next_ != __l.__get_begin())
+            ++__lm1;
+        if (__f != __lm1)
+        {
+            __lm1.__get_begin()->__next_ = __p.__get_begin()->__next_;
+            __p.__get_begin()->__next_ = __f.__get_begin()->__next_;
+            __f.__get_begin()->__next_ = __l.__get_unsafe_node_pointer();
+        }
+    }
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+forward_list<_Tp, _Alloc>::splice_after(const_iterator __p,
+                                        forward_list&& __x)
+{
+    splice_after(__p, __x);
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+forward_list<_Tp, _Alloc>::splice_after(const_iterator __p,
+                                        forward_list&& __x,
+                                        const_iterator __i)
+{
+    splice_after(__p, __x, __i);
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+forward_list<_Tp, _Alloc>::splice_after(const_iterator __p,
+                                        forward_list&& __x,
+                                        const_iterator __f, const_iterator __l)
+{
+    splice_after(__p, __x, __f, __l);
+}
+
+template <class _Tp, class _Alloc>
+typename forward_list<_Tp, _Alloc>::__remove_return_type
+forward_list<_Tp, _Alloc>::remove(const value_type& __v)
+{
+    forward_list<_Tp, _Alloc> __deleted_nodes(get_allocator()); // collect the nodes we're removing
+    typename forward_list<_Tp, _Alloc>::size_type __count_removed = 0;
+    const iterator __e = end();
+    for (iterator __i = before_begin(); __i.__get_begin()->__next_ != nullptr;)
+    {
+        if (__i.__get_begin()->__next_->__value_ == __v)
+        {
+            ++__count_removed;
+            iterator __j = _VSTD::next(__i, 2);
+            for (; __j != __e && *__j == __v; ++__j)
+                ++__count_removed;
+            __deleted_nodes.splice_after(__deleted_nodes.before_begin(), *this, __i, __j);
+            if (__j == __e)
+                break;
+            __i = __j;
+        }
+        else
+            ++__i;
+    }
+
+    return (__remove_return_type) __count_removed;
+}
+
+template <class _Tp, class _Alloc>
+template <class _Predicate>
+typename forward_list<_Tp, _Alloc>::__remove_return_type
+forward_list<_Tp, _Alloc>::remove_if(_Predicate __pred)
+{
+    forward_list<_Tp, _Alloc> __deleted_nodes(get_allocator()); // collect the nodes we're removing
+    typename forward_list<_Tp, _Alloc>::size_type __count_removed = 0;
+    const iterator __e = end();
+    for (iterator __i = before_begin(); __i.__get_begin()->__next_ != nullptr;)
+    {
+        if (__pred(__i.__get_begin()->__next_->__value_))
+        {
+            ++__count_removed;
+            iterator __j = _VSTD::next(__i, 2);
+            for (; __j != __e && __pred(*__j); ++__j)
+                ++__count_removed;
+            __deleted_nodes.splice_after(__deleted_nodes.before_begin(), *this, __i, __j);
+            if (__j == __e)
+                break;
+            __i = __j;
+        }
+        else
+            ++__i;
+    }
+
+    return (__remove_return_type) __count_removed;
+}
+
+template <class _Tp, class _Alloc>
+template <class _BinaryPredicate>
+typename forward_list<_Tp, _Alloc>::__remove_return_type
+forward_list<_Tp, _Alloc>::unique(_BinaryPredicate __binary_pred)
+{
+    forward_list<_Tp, _Alloc> __deleted_nodes(get_allocator()); // collect the nodes we're removing
+    typename forward_list<_Tp, _Alloc>::size_type __count_removed = 0;
+    for (iterator __i = begin(), __e = end(); __i != __e;)
+    {
+        iterator __j = _VSTD::next(__i);
+        for (; __j != __e && __binary_pred(*__i, *__j); ++__j)
+            ++__count_removed;
+        if (__i.__get_begin()->__next_ != __j.__get_unsafe_node_pointer())
+            __deleted_nodes.splice_after(__deleted_nodes.before_begin(), *this, __i, __j);
+        __i = __j;
+    }
+
+    return (__remove_return_type) __count_removed;
+}
+
+template <class _Tp, class _Alloc>
+template <class _Compare>
+void
+forward_list<_Tp, _Alloc>::merge(forward_list& __x, _Compare __comp)
+{
+    if (this != _VSTD::addressof(__x))
+    {
+        base::__before_begin()->__next_ = __merge(base::__before_begin()->__next_,
+                                                    __x.__before_begin()->__next_,
+                                                    __comp);
+        __x.__before_begin()->__next_ = nullptr;
+    }
+}
+
+template <class _Tp, class _Alloc>
+template <class _Compare>
+typename forward_list<_Tp, _Alloc>::__node_pointer
+forward_list<_Tp, _Alloc>::__merge(__node_pointer __f1, __node_pointer __f2,
+                                   _Compare& __comp)
+{
+    if (__f1 == nullptr)
+        return __f2;
+    if (__f2 == nullptr)
+        return __f1;
+    __node_pointer __r;
+    if (__comp(__f2->__value_, __f1->__value_))
+    {
+        __node_pointer __t = __f2;
+        while (__t->__next_ != nullptr &&
+                             __comp(__t->__next_->__value_, __f1->__value_))
+            __t = __t->__next_;
+        __r = __f2;
+        __f2 = __t->__next_;
+        __t->__next_ = __f1;
+    }
+    else
+        __r = __f1;
+    __node_pointer __p = __f1;
+    __f1 = __f1->__next_;
+    while (__f1 != nullptr && __f2 != nullptr)
+    {
+        if (__comp(__f2->__value_, __f1->__value_))
+        {
+            __node_pointer __t = __f2;
+            while (__t->__next_ != nullptr &&
+                                 __comp(__t->__next_->__value_, __f1->__value_))
+                __t = __t->__next_;
+            __p->__next_ = __f2;
+            __f2 = __t->__next_;
+            __t->__next_ = __f1;
+        }
+        __p = __f1;
+        __f1 = __f1->__next_;
+    }
+    if (__f2 != nullptr)
+        __p->__next_ = __f2;
+    return __r;
+}
+
+template <class _Tp, class _Alloc>
+template <class _Compare>
+inline
+void
+forward_list<_Tp, _Alloc>::sort(_Compare __comp)
+{
+    base::__before_begin()->__next_ = __sort(base::__before_begin()->__next_,
+                                       _VSTD::distance(begin(), end()), __comp);
+}
+
+template <class _Tp, class _Alloc>
+template <class _Compare>
+typename forward_list<_Tp, _Alloc>::__node_pointer
+forward_list<_Tp, _Alloc>::__sort(__node_pointer __f1, difference_type __sz,
+                                  _Compare& __comp)
+{
+    switch (__sz)
+    {
+    case 0:
+    case 1:
+        return __f1;
+    case 2:
+        if (__comp(__f1->__next_->__value_, __f1->__value_))
+        {
+            __node_pointer __t = __f1->__next_;
+            __t->__next_ = __f1;
+            __f1->__next_ = nullptr;
+            __f1 = __t;
+        }
+        return __f1;
+    }
+    difference_type __sz1 = __sz / 2;
+    difference_type __sz2 = __sz - __sz1;
+    __node_pointer __t = _VSTD::next(iterator(__f1), __sz1 - 1).__get_unsafe_node_pointer();
+    __node_pointer __f2 = __t->__next_;
+    __t->__next_ = nullptr;
+    return __merge(__sort(__f1, __sz1, __comp),
+                   __sort(__f2, __sz2, __comp), __comp);
+}
+
+template <class _Tp, class _Alloc>
+void
+forward_list<_Tp, _Alloc>::reverse() _NOEXCEPT
+{
+    __node_pointer __p = base::__before_begin()->__next_;
+    if (__p != nullptr)
+    {
+        __node_pointer __f = __p->__next_;
+        __p->__next_ = nullptr;
+        while (__f != nullptr)
+        {
+            __node_pointer __t = __f->__next_;
+            __f->__next_ = __p;
+            __p = __f;
+            __f = __t;
+        }
+        base::__before_begin()->__next_ = __p;
+    }
+}
+
+template <class _Tp, class _Alloc>
+_LIBCPP_HIDE_FROM_ABI
+bool operator==(const forward_list<_Tp, _Alloc>& __x,
+                const forward_list<_Tp, _Alloc>& __y)
+{
+    typedef forward_list<_Tp, _Alloc> _Cp;
+    typedef typename _Cp::const_iterator _Ip;
+    _Ip __ix = __x.begin();
+    _Ip __ex = __x.end();
+    _Ip __iy = __y.begin();
+    _Ip __ey = __y.end();
+    for (; __ix != __ex && __iy != __ey; ++__ix, ++__iy)
+        if (!(*__ix == *__iy))
+            return false;
+    return (__ix == __ex) == (__iy == __ey);
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator!=(const forward_list<_Tp, _Alloc>& __x,
+                const forward_list<_Tp, _Alloc>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator< (const forward_list<_Tp, _Alloc>& __x,
+                const forward_list<_Tp, _Alloc>& __y)
+{
+    return _VSTD::lexicographical_compare(__x.begin(), __x.end(),
+                                         __y.begin(), __y.end());
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator> (const forward_list<_Tp, _Alloc>& __x,
+                const forward_list<_Tp, _Alloc>& __y)
+{
+    return __y < __x;
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator>=(const forward_list<_Tp, _Alloc>& __x,
+                const forward_list<_Tp, _Alloc>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator<=(const forward_list<_Tp, _Alloc>& __x,
+                const forward_list<_Tp, _Alloc>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(forward_list<_Tp, _Alloc>& __x, forward_list<_Tp, _Alloc>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Tp, class _Allocator, class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY
+    typename forward_list<_Tp, _Allocator>::size_type
+    erase_if(forward_list<_Tp, _Allocator>& __c, _Predicate __pred) {
+  return __c.remove_if(__pred);
+}
+
+template <class _Tp, class _Allocator, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY
+    typename forward_list<_Tp, _Allocator>::size_type
+    erase(forward_list<_Tp, _Allocator>& __c, const _Up& __v) {
+  return _VSTD::erase_if(__c, [&](auto& __elem) { return __elem == __v; });
+}
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+_LIBCPP_BEGIN_NAMESPACE_STD
+namespace pmr {
+template <class _ValueT>
+using forward_list = std::forward_list<_ValueT, polymorphic_allocator<_ValueT>>;
+} // namespace pmr
+_LIBCPP_END_NAMESPACE_STD
+#endif
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <algorithm>
+#  include <atomic>
+#  include <concepts>
+#  include <functional>
+#  include <iosfwd>
+#  include <iterator>
+#  include <typeinfo>
+#endif
+
+#endif // _LIBCPP_FORWARD_LIST
diff --git a/app/src/main/cpp/libcxx/include/fstream b/app/src/main/cpp/libcxx/include/fstream
new file mode 100644
index 0000000..41e95bf
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/fstream
@@ -0,0 +1,1763 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_FSTREAM
+#define _LIBCPP_FSTREAM
+
+/*
+    fstream synopsis
+
+template <class charT, class traits = char_traits<charT> >
+class basic_filebuf
+    : public basic_streambuf<charT, traits>
+{
+public:
+    typedef charT                          char_type;
+    typedef traits                         traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    // 27.9.1.2 Constructors/destructor:
+    basic_filebuf();
+    basic_filebuf(basic_filebuf&& rhs);
+    virtual ~basic_filebuf();
+
+    // 27.9.1.3 Assign/swap:
+    basic_filebuf& operator=(basic_filebuf&& rhs);
+    void swap(basic_filebuf& rhs);
+
+    // 27.9.1.4 Members:
+    bool is_open() const;
+    basic_filebuf* open(const char* s, ios_base::openmode mode);
+    basic_filebuf* open(const string& s, ios_base::openmode mode);
+    basic_filebuf* open(const filesystem::path& p, ios_base::openmode mode); // C++17
+    basic_filebuf* close();
+
+protected:
+    // 27.9.1.5 Overridden virtual functions:
+    virtual streamsize showmanyc();
+    virtual int_type underflow();
+    virtual int_type uflow();
+    virtual int_type pbackfail(int_type c = traits_type::eof());
+    virtual int_type overflow (int_type c = traits_type::eof());
+    virtual basic_streambuf<char_type, traits_type>* setbuf(char_type* s, streamsize n);
+    virtual pos_type seekoff(off_type off, ios_base::seekdir way,
+                             ios_base::openmode which = ios_base::in | ios_base::out);
+    virtual pos_type seekpos(pos_type sp,
+                             ios_base::openmode which = ios_base::in | ios_base::out);
+    virtual int sync();
+    virtual void imbue(const locale& loc);
+};
+
+template <class charT, class traits>
+  void
+  swap(basic_filebuf<charT, traits>& x, basic_filebuf<charT, traits>& y);
+
+typedef basic_filebuf<char>    filebuf;
+typedef basic_filebuf<wchar_t> wfilebuf;
+
+template <class charT, class traits = char_traits<charT> >
+class basic_ifstream
+    : public basic_istream<charT,traits>
+{
+public:
+    typedef charT                          char_type;
+    typedef traits                         traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    basic_ifstream();
+    explicit basic_ifstream(const char* s, ios_base::openmode mode = ios_base::in);
+    explicit basic_ifstream(const string& s, ios_base::openmode mode = ios_base::in);
+    explicit basic_ifstream(const filesystem::path& p,
+                            ios_base::openmode mode = ios_base::in); // C++17
+    basic_ifstream(basic_ifstream&& rhs);
+
+    basic_ifstream& operator=(basic_ifstream&& rhs);
+    void swap(basic_ifstream& rhs);
+
+    basic_filebuf<char_type, traits_type>* rdbuf() const;
+    bool is_open() const;
+    void open(const char* s, ios_base::openmode mode = ios_base::in);
+    void open(const string& s, ios_base::openmode mode = ios_base::in);
+    void open(const filesystem::path& s, ios_base::openmode mode = ios_base::in); // C++17
+
+    void close();
+};
+
+template <class charT, class traits>
+  void
+  swap(basic_ifstream<charT, traits>& x, basic_ifstream<charT, traits>& y);
+
+typedef basic_ifstream<char>    ifstream;
+typedef basic_ifstream<wchar_t> wifstream;
+
+template <class charT, class traits = char_traits<charT> >
+class basic_ofstream
+    : public basic_ostream<charT,traits>
+{
+public:
+    typedef charT                          char_type;
+    typedef traits                         traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    basic_ofstream();
+    explicit basic_ofstream(const char* s, ios_base::openmode mode = ios_base::out);
+    explicit basic_ofstream(const string& s, ios_base::openmode mode = ios_base::out);
+    explicit basic_ofstream(const filesystem::path& p,
+                            ios_base::openmode mode = ios_base::out); // C++17
+    basic_ofstream(basic_ofstream&& rhs);
+
+    basic_ofstream& operator=(basic_ofstream&& rhs);
+    void swap(basic_ofstream& rhs);
+
+    basic_filebuf<char_type, traits_type>* rdbuf() const;
+    bool is_open() const;
+    void open(const char* s, ios_base::openmode mode = ios_base::out);
+    void open(const string& s, ios_base::openmode mode = ios_base::out);
+    void open(const filesystem::path& p,
+              ios_base::openmode mode = ios_base::out); // C++17
+
+    void close();
+};
+
+template <class charT, class traits>
+  void
+  swap(basic_ofstream<charT, traits>& x, basic_ofstream<charT, traits>& y);
+
+typedef basic_ofstream<char>    ofstream;
+typedef basic_ofstream<wchar_t> wofstream;
+
+template <class charT, class traits=char_traits<charT> >
+class basic_fstream
+    : public basic_iostream<charT,traits>
+{
+public:
+    typedef charT                          char_type;
+    typedef traits                         traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    basic_fstream();
+    explicit basic_fstream(const char* s, ios_base::openmode mode = ios_base::in|ios_base::out);
+    explicit basic_fstream(const string& s, ios_base::openmode mode = ios_base::in|ios_base::out);
+    explicit basic_fstream(const filesystem::path& p,
+                           ios_base::openmode mode = ios_base::in|ios_base::out); C++17
+    basic_fstream(basic_fstream&& rhs);
+
+    basic_fstream& operator=(basic_fstream&& rhs);
+    void swap(basic_fstream& rhs);
+
+    basic_filebuf<char_type, traits_type>* rdbuf() const;
+    bool is_open() const;
+    void open(const char* s, ios_base::openmode mode = ios_base::in|ios_base::out);
+    void open(const string& s, ios_base::openmode mode = ios_base::in|ios_base::out);
+    void open(const filesystem::path& s,
+              ios_base::openmode mode = ios_base::in|ios_base::out); // C++17
+
+    void close();
+};
+
+template <class charT, class traits>
+  void swap(basic_fstream<charT, traits>& x, basic_fstream<charT, traits>& y);
+
+typedef basic_fstream<char>    fstream;
+typedef basic_fstream<wchar_t> wfstream;
+
+}  // std
+
+*/
+
+#include <__algorithm/max.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__config>
+#include <__locale>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <__utility/unreachable.h>
+#include <cstdio>
+#include <cstdlib>
+#include <cstring>
+#include <istream>
+#include <ostream>
+#include <typeinfo>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_FILESYSTEM_LIBRARY)
+#   include <filesystem>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+#if defined(_LIBCPP_MSVCRT) || defined(_NEWLIB_VERSION)
+#  define _LIBCPP_HAS_NO_OFF_T_FUNCTIONS
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_FSTREAM)
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS basic_filebuf
+    : public basic_streambuf<_CharT, _Traits>
+{
+public:
+    typedef _CharT                           char_type;
+    typedef _Traits                          traits_type;
+    typedef typename traits_type::int_type   int_type;
+    typedef typename traits_type::pos_type   pos_type;
+    typedef typename traits_type::off_type   off_type;
+    typedef typename traits_type::state_type state_type;
+
+    // 27.9.1.2 Constructors/destructor:
+    basic_filebuf();
+    basic_filebuf(basic_filebuf&& __rhs);
+    ~basic_filebuf() override;
+
+    // 27.9.1.3 Assign/swap:
+    _LIBCPP_INLINE_VISIBILITY
+    basic_filebuf& operator=(basic_filebuf&& __rhs);
+    void swap(basic_filebuf& __rhs);
+
+    // 27.9.1.4 Members:
+    _LIBCPP_INLINE_VISIBILITY
+    bool is_open() const;
+    basic_filebuf* open(const char* __s, ios_base::openmode __mode);
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+    basic_filebuf* open(const wchar_t* __s, ios_base::openmode __mode);
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    basic_filebuf* open(const string& __s, ios_base::openmode __mode);
+
+#if _LIBCPP_STD_VER >= 17 && !defined(_LIBCPP_HAS_NO_FILESYSTEM_LIBRARY)
+    _LIBCPP_AVAILABILITY_FILESYSTEM _LIBCPP_INLINE_VISIBILITY
+    basic_filebuf* open(const _VSTD_FS::path& __p, ios_base::openmode __mode) {
+      return open(__p.c_str(), __mode);
+    }
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    basic_filebuf* __open(int __fd, ios_base::openmode __mode);
+    basic_filebuf* close();
+
+    _LIBCPP_INLINE_VISIBILITY
+    inline static const char*
+    __make_mdstring(ios_base::openmode __mode) _NOEXCEPT;
+
+  protected:
+    // 27.9.1.5 Overridden virtual functions:
+    int_type underflow() override;
+    int_type pbackfail(int_type __c = traits_type::eof()) override;
+    int_type overflow (int_type __c = traits_type::eof()) override;
+    basic_streambuf<char_type, traits_type>* setbuf(char_type* __s, streamsize __n) override;
+    pos_type seekoff(off_type __off, ios_base::seekdir __way,
+                     ios_base::openmode __wch = ios_base::in | ios_base::out) override;
+    pos_type seekpos(pos_type __sp,
+                     ios_base::openmode __wch = ios_base::in | ios_base::out) override;
+    int sync() override;
+    void imbue(const locale& __loc) override;
+
+private:
+  char* __extbuf_;
+  const char* __extbufnext_;
+  const char* __extbufend_;
+  char __extbuf_min_[8];
+  size_t __ebs_;
+  char_type* __intbuf_;
+  size_t __ibs_;
+  FILE* __file_;
+  const codecvt<char_type, char, state_type>* __cv_;
+  state_type __st_;
+  state_type __st_last_;
+  ios_base::openmode __om_;
+  ios_base::openmode __cm_;
+  bool __owns_eb_;
+  bool __owns_ib_;
+  bool __always_noconv_;
+
+  bool __read_mode();
+  void __write_mode();
+};
+
+template <class _CharT, class _Traits>
+basic_filebuf<_CharT, _Traits>::basic_filebuf()
+    : __extbuf_(nullptr),
+      __extbufnext_(nullptr),
+      __extbufend_(nullptr),
+      __ebs_(0),
+      __intbuf_(nullptr),
+      __ibs_(0),
+      __file_(nullptr),
+      __cv_(nullptr),
+      __st_(),
+      __st_last_(),
+      __om_(0),
+      __cm_(0),
+      __owns_eb_(false),
+      __owns_ib_(false),
+      __always_noconv_(false)
+{
+    if (std::has_facet<codecvt<char_type, char, state_type> >(this->getloc()))
+    {
+        __cv_ = &std::use_facet<codecvt<char_type, char, state_type> >(this->getloc());
+        __always_noconv_ = __cv_->always_noconv();
+    }
+    setbuf(nullptr, 4096);
+}
+
+template <class _CharT, class _Traits>
+basic_filebuf<_CharT, _Traits>::basic_filebuf(basic_filebuf&& __rhs)
+    : basic_streambuf<_CharT, _Traits>(__rhs)
+{
+    if (__rhs.__extbuf_ == __rhs.__extbuf_min_)
+    {
+        __extbuf_ = __extbuf_min_;
+        __extbufnext_ = __extbuf_ + (__rhs.__extbufnext_ - __rhs.__extbuf_);
+        __extbufend_ = __extbuf_ + (__rhs.__extbufend_ - __rhs.__extbuf_);
+    }
+    else
+    {
+        __extbuf_ = __rhs.__extbuf_;
+        __extbufnext_ = __rhs.__extbufnext_;
+        __extbufend_ = __rhs.__extbufend_;
+    }
+    __ebs_ = __rhs.__ebs_;
+    __intbuf_ = __rhs.__intbuf_;
+    __ibs_ = __rhs.__ibs_;
+    __file_ = __rhs.__file_;
+    __cv_ = __rhs.__cv_;
+    __st_ = __rhs.__st_;
+    __st_last_ = __rhs.__st_last_;
+    __om_ = __rhs.__om_;
+    __cm_ = __rhs.__cm_;
+    __owns_eb_ = __rhs.__owns_eb_;
+    __owns_ib_ = __rhs.__owns_ib_;
+    __always_noconv_ = __rhs.__always_noconv_;
+    if (__rhs.pbase())
+    {
+        if (__rhs.pbase() == __rhs.__intbuf_)
+            this->setp(__intbuf_, __intbuf_ + (__rhs. epptr() - __rhs.pbase()));
+        else
+            this->setp((char_type*)__extbuf_,
+                       (char_type*)__extbuf_ + (__rhs. epptr() - __rhs.pbase()));
+        this->__pbump(__rhs. pptr() - __rhs.pbase());
+    }
+    else if (__rhs.eback())
+    {
+        if (__rhs.eback() == __rhs.__intbuf_)
+            this->setg(__intbuf_, __intbuf_ + (__rhs.gptr() - __rhs.eback()),
+                                  __intbuf_ + (__rhs.egptr() - __rhs.eback()));
+        else
+            this->setg((char_type*)__extbuf_,
+                       (char_type*)__extbuf_ + (__rhs.gptr() - __rhs.eback()),
+                       (char_type*)__extbuf_ + (__rhs.egptr() - __rhs.eback()));
+    }
+    __rhs.__extbuf_ = nullptr;
+    __rhs.__extbufnext_ = nullptr;
+    __rhs.__extbufend_ = nullptr;
+    __rhs.__ebs_ = 0;
+    __rhs.__intbuf_ = 0;
+    __rhs.__ibs_ = 0;
+    __rhs.__file_ = nullptr;
+    __rhs.__st_ = state_type();
+    __rhs.__st_last_ = state_type();
+    __rhs.__om_ = 0;
+    __rhs.__cm_ = 0;
+    __rhs.__owns_eb_ = false;
+    __rhs.__owns_ib_ = false;
+    __rhs.setg(0, 0, 0);
+    __rhs.setp(0, 0);
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_filebuf<_CharT, _Traits>&
+basic_filebuf<_CharT, _Traits>::operator=(basic_filebuf&& __rhs)
+{
+    close();
+    swap(__rhs);
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_filebuf<_CharT, _Traits>::~basic_filebuf()
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        close();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    if (__owns_eb_)
+        delete [] __extbuf_;
+    if (__owns_ib_)
+        delete [] __intbuf_;
+}
+
+template <class _CharT, class _Traits>
+void
+basic_filebuf<_CharT, _Traits>::swap(basic_filebuf& __rhs)
+{
+    basic_streambuf<char_type, traits_type>::swap(__rhs);
+    if (__extbuf_ != __extbuf_min_ && __rhs.__extbuf_ != __rhs.__extbuf_min_)
+    {
+        // Neither *this nor __rhs uses the small buffer, so we can simply swap the pointers.
+        std::swap(__extbuf_, __rhs.__extbuf_);
+        std::swap(__extbufnext_, __rhs.__extbufnext_);
+        std::swap(__extbufend_, __rhs.__extbufend_);
+    }
+    else
+    {
+        ptrdiff_t __ln = __extbufnext_       ? __extbufnext_ - __extbuf_             : 0;
+        ptrdiff_t __le = __extbufend_        ? __extbufend_ - __extbuf_              : 0;
+        ptrdiff_t __rn = __rhs.__extbufnext_ ? __rhs.__extbufnext_ - __rhs.__extbuf_ : 0;
+        ptrdiff_t __re = __rhs.__extbufend_  ? __rhs.__extbufend_ - __rhs.__extbuf_  : 0;
+        if (__extbuf_ == __extbuf_min_ && __rhs.__extbuf_ != __rhs.__extbuf_min_)
+        {
+            // *this uses the small buffer, but __rhs doesn't.
+            __extbuf_ = __rhs.__extbuf_;
+            __rhs.__extbuf_ = __rhs.__extbuf_min_;
+            std::memmove(__rhs.__extbuf_min_, __extbuf_min_, sizeof(__extbuf_min_));
+        }
+        else if (__extbuf_ != __extbuf_min_ && __rhs.__extbuf_ == __rhs.__extbuf_min_)
+        {
+            // *this doesn't use the small buffer, but __rhs does.
+            __rhs.__extbuf_ = __extbuf_;
+            __extbuf_ = __extbuf_min_;
+            std::memmove(__extbuf_min_, __rhs.__extbuf_min_, sizeof(__extbuf_min_));
+        }
+        else
+        {
+            // Both *this and __rhs use the small buffer.
+            char __tmp[sizeof(__extbuf_min_)];
+            std::memmove(__tmp, __extbuf_min_, sizeof(__extbuf_min_));
+            std::memmove(__extbuf_min_, __rhs.__extbuf_min_, sizeof(__extbuf_min_));
+            std::memmove(__rhs.__extbuf_min_, __tmp, sizeof(__extbuf_min_));
+        }
+        __extbufnext_ = __extbuf_ + __rn;
+        __extbufend_ = __extbuf_ + __re;
+        __rhs.__extbufnext_ = __rhs.__extbuf_ + __ln;
+        __rhs.__extbufend_ = __rhs.__extbuf_ + __le;
+    }
+    _VSTD::swap(__ebs_, __rhs.__ebs_);
+    _VSTD::swap(__intbuf_, __rhs.__intbuf_);
+    _VSTD::swap(__ibs_, __rhs.__ibs_);
+    _VSTD::swap(__file_, __rhs.__file_);
+    _VSTD::swap(__cv_, __rhs.__cv_);
+    _VSTD::swap(__st_, __rhs.__st_);
+    _VSTD::swap(__st_last_, __rhs.__st_last_);
+    _VSTD::swap(__om_, __rhs.__om_);
+    _VSTD::swap(__cm_, __rhs.__cm_);
+    _VSTD::swap(__owns_eb_, __rhs.__owns_eb_);
+    _VSTD::swap(__owns_ib_, __rhs.__owns_ib_);
+    _VSTD::swap(__always_noconv_, __rhs.__always_noconv_);
+    if (this->eback() == (char_type*)__rhs.__extbuf_min_)
+    {
+        ptrdiff_t __n = this->gptr() - this->eback();
+        ptrdiff_t __e = this->egptr() - this->eback();
+        this->setg((char_type*)__extbuf_min_,
+                   (char_type*)__extbuf_min_ + __n,
+                   (char_type*)__extbuf_min_ + __e);
+    }
+    else if (this->pbase() == (char_type*)__rhs.__extbuf_min_)
+    {
+        ptrdiff_t __n = this->pptr() - this->pbase();
+        ptrdiff_t __e = this->epptr() - this->pbase();
+        this->setp((char_type*)__extbuf_min_,
+                   (char_type*)__extbuf_min_ + __e);
+        this->__pbump(__n);
+    }
+    if (__rhs.eback() == (char_type*)__extbuf_min_)
+    {
+        ptrdiff_t __n = __rhs.gptr() - __rhs.eback();
+        ptrdiff_t __e = __rhs.egptr() - __rhs.eback();
+        __rhs.setg((char_type*)__rhs.__extbuf_min_,
+                   (char_type*)__rhs.__extbuf_min_ + __n,
+                   (char_type*)__rhs.__extbuf_min_ + __e);
+    }
+    else if (__rhs.pbase() == (char_type*)__extbuf_min_)
+    {
+        ptrdiff_t __n = __rhs.pptr() - __rhs.pbase();
+        ptrdiff_t __e = __rhs.epptr() - __rhs.pbase();
+        __rhs.setp((char_type*)__rhs.__extbuf_min_,
+                   (char_type*)__rhs.__extbuf_min_ + __e);
+        __rhs.__pbump(__n);
+    }
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(basic_filebuf<_CharT, _Traits>& __x, basic_filebuf<_CharT, _Traits>& __y)
+{
+    __x.swap(__y);
+}
+
+template <class _CharT, class _Traits>
+inline
+bool
+basic_filebuf<_CharT, _Traits>::is_open() const
+{
+    return __file_ != nullptr;
+}
+
+template <class _CharT, class _Traits>
+const char* basic_filebuf<_CharT, _Traits>::__make_mdstring(
+    ios_base::openmode __mode) _NOEXCEPT {
+  switch (__mode & ~ios_base::ate) {
+  case ios_base::out:
+  case ios_base::out | ios_base::trunc:
+    return "w" _LIBCPP_FOPEN_CLOEXEC_MODE;
+  case ios_base::out | ios_base::app:
+  case ios_base::app:
+    return "a" _LIBCPP_FOPEN_CLOEXEC_MODE;
+  case ios_base::in:
+    return "r" _LIBCPP_FOPEN_CLOEXEC_MODE;
+  case ios_base::in | ios_base::out:
+    return "r+" _LIBCPP_FOPEN_CLOEXEC_MODE;
+  case ios_base::in | ios_base::out | ios_base::trunc:
+    return "w+" _LIBCPP_FOPEN_CLOEXEC_MODE;
+  case ios_base::in | ios_base::out | ios_base::app:
+  case ios_base::in | ios_base::app:
+    return "a+" _LIBCPP_FOPEN_CLOEXEC_MODE;
+  case ios_base::out | ios_base::binary:
+  case ios_base::out | ios_base::trunc | ios_base::binary:
+    return "wb" _LIBCPP_FOPEN_CLOEXEC_MODE;
+  case ios_base::out | ios_base::app | ios_base::binary:
+  case ios_base::app | ios_base::binary:
+    return "ab" _LIBCPP_FOPEN_CLOEXEC_MODE;
+  case ios_base::in | ios_base::binary:
+    return "rb" _LIBCPP_FOPEN_CLOEXEC_MODE;
+  case ios_base::in | ios_base::out | ios_base::binary:
+    return "r+b" _LIBCPP_FOPEN_CLOEXEC_MODE;
+  case ios_base::in | ios_base::out | ios_base::trunc | ios_base::binary:
+    return "w+b" _LIBCPP_FOPEN_CLOEXEC_MODE;
+  case ios_base::in | ios_base::out | ios_base::app | ios_base::binary:
+  case ios_base::in | ios_base::app | ios_base::binary:
+    return "a+b" _LIBCPP_FOPEN_CLOEXEC_MODE;
+  default:
+    return nullptr;
+  }
+  __libcpp_unreachable();
+}
+
+template <class _CharT, class _Traits>
+basic_filebuf<_CharT, _Traits>*
+basic_filebuf<_CharT, _Traits>::open(const char* __s, ios_base::openmode __mode)
+{
+    basic_filebuf<_CharT, _Traits>* __rt = nullptr;
+    if (__file_ == nullptr)
+    {
+      if (const char* __mdstr = __make_mdstring(__mode)) {
+        __rt = this;
+        __file_ = fopen(__s, __mdstr);
+        if (__file_) {
+          __om_ = __mode;
+          if (__mode & ios_base::ate) {
+            if (fseek(__file_, 0, SEEK_END)) {
+              fclose(__file_);
+              __file_ = nullptr;
+              __rt = nullptr;
+            }
+          }
+        } else
+          __rt = nullptr;
+      }
+    }
+    return __rt;
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_filebuf<_CharT, _Traits>*
+basic_filebuf<_CharT, _Traits>::__open(int __fd, ios_base::openmode __mode) {
+  basic_filebuf<_CharT, _Traits>* __rt = nullptr;
+  if (__file_ == nullptr) {
+    if (const char* __mdstr = __make_mdstring(__mode)) {
+      __rt = this;
+      __file_ = fdopen(__fd, __mdstr);
+      if (__file_) {
+        __om_ = __mode;
+        if (__mode & ios_base::ate) {
+          if (fseek(__file_, 0, SEEK_END)) {
+            fclose(__file_);
+            __file_ = nullptr;
+            __rt = nullptr;
+          }
+        }
+      } else
+        __rt = nullptr;
+    }
+  }
+  return __rt;
+}
+
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+// This is basically the same as the char* overload except that it uses _wfopen
+// and long mode strings.
+template <class _CharT, class _Traits>
+basic_filebuf<_CharT, _Traits>*
+basic_filebuf<_CharT, _Traits>::open(const wchar_t* __s, ios_base::openmode __mode)
+{
+    basic_filebuf<_CharT, _Traits>* __rt = nullptr;
+    if (__file_ == nullptr)
+    {
+        __rt = this;
+        const wchar_t* __mdstr;
+        switch (__mode & ~ios_base::ate)
+        {
+        case ios_base::out:
+        case ios_base::out | ios_base::trunc:
+            __mdstr = L"w";
+            break;
+        case ios_base::out | ios_base::app:
+        case ios_base::app:
+            __mdstr = L"a";
+            break;
+        case ios_base::in:
+            __mdstr = L"r";
+            break;
+        case ios_base::in | ios_base::out:
+            __mdstr = L"r+";
+            break;
+        case ios_base::in | ios_base::out | ios_base::trunc:
+            __mdstr = L"w+";
+            break;
+        case ios_base::in | ios_base::out | ios_base::app:
+        case ios_base::in | ios_base::app:
+            __mdstr = L"a+";
+            break;
+        case ios_base::out | ios_base::binary:
+        case ios_base::out | ios_base::trunc | ios_base::binary:
+            __mdstr = L"wb";
+            break;
+        case ios_base::out | ios_base::app | ios_base::binary:
+        case ios_base::app | ios_base::binary:
+            __mdstr = L"ab";
+            break;
+        case ios_base::in | ios_base::binary:
+            __mdstr = L"rb";
+            break;
+        case ios_base::in | ios_base::out | ios_base::binary:
+            __mdstr = L"r+b";
+            break;
+        case ios_base::in | ios_base::out | ios_base::trunc | ios_base::binary:
+            __mdstr = L"w+b";
+            break;
+        case ios_base::in | ios_base::out | ios_base::app | ios_base::binary:
+        case ios_base::in | ios_base::app | ios_base::binary:
+            __mdstr = L"a+b";
+            break;
+        default:
+            __rt = nullptr;
+            break;
+        }
+        if (__rt)
+        {
+            __file_ = _wfopen(__s, __mdstr);
+            if (__file_)
+            {
+                __om_ = __mode;
+                if (__mode & ios_base::ate)
+                {
+                    if (fseek(__file_, 0, SEEK_END))
+                    {
+                        fclose(__file_);
+                        __file_ = nullptr;
+                        __rt = nullptr;
+                    }
+                }
+            }
+            else
+                __rt = nullptr;
+        }
+    }
+    return __rt;
+}
+#endif
+
+template <class _CharT, class _Traits>
+inline
+basic_filebuf<_CharT, _Traits>*
+basic_filebuf<_CharT, _Traits>::open(const string& __s, ios_base::openmode __mode)
+{
+    return open(__s.c_str(), __mode);
+}
+
+template <class _CharT, class _Traits>
+basic_filebuf<_CharT, _Traits>*
+basic_filebuf<_CharT, _Traits>::close()
+{
+    basic_filebuf<_CharT, _Traits>* __rt = nullptr;
+    if (__file_)
+    {
+        __rt = this;
+        unique_ptr<FILE, int(*)(FILE*)> __h(__file_, fclose);
+        if (sync())
+            __rt = nullptr;
+        if (fclose(__h.release()))
+            __rt = nullptr;
+        __file_ = nullptr;
+        setbuf(0, 0);
+    }
+    return __rt;
+}
+
+template <class _CharT, class _Traits>
+typename basic_filebuf<_CharT, _Traits>::int_type
+basic_filebuf<_CharT, _Traits>::underflow()
+{
+    if (__file_ == nullptr)
+        return traits_type::eof();
+    bool __initial = __read_mode();
+    char_type __1buf;
+    if (this->gptr() == nullptr)
+        this->setg(&__1buf, &__1buf+1, &__1buf+1);
+    const size_t __unget_sz = __initial ? 0 : std::min<size_t>((this->egptr() - this->eback()) / 2, 4);
+    int_type __c = traits_type::eof();
+    if (this->gptr() == this->egptr())
+    {
+        _VSTD::memmove(this->eback(), this->egptr() - __unget_sz, __unget_sz * sizeof(char_type));
+        if (__always_noconv_)
+        {
+            size_t __nmemb = static_cast<size_t>(this->egptr() - this->eback() - __unget_sz);
+            __nmemb = ::fread(this->eback() + __unget_sz, 1, __nmemb, __file_);
+            if (__nmemb != 0)
+            {
+                this->setg(this->eback(),
+                           this->eback() + __unget_sz,
+                           this->eback() + __unget_sz + __nmemb);
+                __c = traits_type::to_int_type(*this->gptr());
+            }
+        }
+        else
+        {
+            if (__extbufend_ != __extbufnext_) {
+                _LIBCPP_ASSERT(__extbufnext_ != nullptr, "underflow moving from nullptr");
+                _LIBCPP_ASSERT(__extbuf_ != nullptr, "underflow moving into nullptr");
+                _VSTD::memmove(__extbuf_, __extbufnext_, __extbufend_ - __extbufnext_);
+            }
+            __extbufnext_ = __extbuf_ + (__extbufend_ - __extbufnext_);
+            __extbufend_ = __extbuf_ + (__extbuf_ == __extbuf_min_ ? sizeof(__extbuf_min_) : __ebs_);
+            size_t __nmemb = _VSTD::min(static_cast<size_t>(__ibs_ - __unget_sz),
+                                 static_cast<size_t>(__extbufend_ - __extbufnext_));
+            codecvt_base::result __r;
+            __st_last_ = __st_;
+            size_t __nr = fread((void*) const_cast<char *>(__extbufnext_), 1, __nmemb, __file_);
+            if (__nr != 0)
+            {
+                if (!__cv_)
+                    __throw_bad_cast();
+
+                __extbufend_ = __extbufnext_ + __nr;
+                char_type*  __inext;
+                __r = __cv_->in(__st_, __extbuf_, __extbufend_, __extbufnext_,
+                                       this->eback() + __unget_sz,
+                                       this->eback() + __ibs_, __inext);
+                if (__r == codecvt_base::noconv)
+                {
+                    this->setg((char_type*)__extbuf_, (char_type*)__extbuf_,
+                                          (char_type*)const_cast<char *>(__extbufend_));
+                    __c = traits_type::to_int_type(*this->gptr());
+                }
+                else if (__inext != this->eback() + __unget_sz)
+                {
+                    this->setg(this->eback(), this->eback() + __unget_sz, __inext);
+                    __c = traits_type::to_int_type(*this->gptr());
+                }
+            }
+        }
+    }
+    else
+        __c = traits_type::to_int_type(*this->gptr());
+    if (this->eback() == &__1buf)
+        this->setg(nullptr, nullptr, nullptr);
+    return __c;
+}
+
+template <class _CharT, class _Traits>
+typename basic_filebuf<_CharT, _Traits>::int_type
+basic_filebuf<_CharT, _Traits>::pbackfail(int_type __c)
+{
+    if (__file_ && this->eback() < this->gptr())
+    {
+        if (traits_type::eq_int_type(__c, traits_type::eof()))
+        {
+            this->gbump(-1);
+            return traits_type::not_eof(__c);
+        }
+        if ((__om_ & ios_base::out) ||
+            traits_type::eq(traits_type::to_char_type(__c), this->gptr()[-1]))
+        {
+            this->gbump(-1);
+            *this->gptr() = traits_type::to_char_type(__c);
+            return __c;
+        }
+    }
+    return traits_type::eof();
+}
+
+template <class _CharT, class _Traits>
+typename basic_filebuf<_CharT, _Traits>::int_type
+basic_filebuf<_CharT, _Traits>::overflow(int_type __c)
+{
+    if (__file_ == nullptr)
+        return traits_type::eof();
+    __write_mode();
+    char_type __1buf;
+    char_type* __pb_save = this->pbase();
+    char_type* __epb_save = this->epptr();
+    if (!traits_type::eq_int_type(__c, traits_type::eof()))
+    {
+        if (this->pptr() == nullptr)
+            this->setp(&__1buf, &__1buf+1);
+        *this->pptr() = traits_type::to_char_type(__c);
+        this->pbump(1);
+    }
+    if (this->pptr() != this->pbase())
+    {
+        if (__always_noconv_)
+        {
+            size_t __nmemb = static_cast<size_t>(this->pptr() - this->pbase());
+            if (std::fwrite(this->pbase(), sizeof(char_type), __nmemb, __file_) != __nmemb)
+                return traits_type::eof();
+        }
+        else
+        {
+            char* __extbe = __extbuf_;
+            codecvt_base::result __r;
+            do
+            {
+                if (!__cv_)
+                    __throw_bad_cast();
+
+                const char_type* __e;
+                __r = __cv_->out(__st_, this->pbase(), this->pptr(), __e,
+                                        __extbuf_, __extbuf_ + __ebs_, __extbe);
+                if (__e == this->pbase())
+                    return traits_type::eof();
+                if (__r == codecvt_base::noconv)
+                {
+                    size_t __nmemb = static_cast<size_t>(this->pptr() - this->pbase());
+                    if (std::fwrite(this->pbase(), 1, __nmemb, __file_) != __nmemb)
+                        return traits_type::eof();
+                }
+                else if (__r == codecvt_base::ok || __r == codecvt_base::partial)
+                {
+                    size_t __nmemb = static_cast<size_t>(__extbe - __extbuf_);
+                    if (fwrite(__extbuf_, 1, __nmemb, __file_) != __nmemb)
+                        return traits_type::eof();
+                    if (__r == codecvt_base::partial)
+                    {
+                        this->setp(const_cast<char_type*>(__e), this->pptr());
+                        this->__pbump(this->epptr() - this->pbase());
+                    }
+                }
+                else
+                    return traits_type::eof();
+            } while (__r == codecvt_base::partial);
+        }
+        this->setp(__pb_save, __epb_save);
+    }
+    return traits_type::not_eof(__c);
+}
+
+template <class _CharT, class _Traits>
+basic_streambuf<_CharT, _Traits>*
+basic_filebuf<_CharT, _Traits>::setbuf(char_type* __s, streamsize __n)
+{
+    this->setg(nullptr, nullptr, nullptr);
+    this->setp(nullptr, nullptr);
+    if (__owns_eb_)
+        delete [] __extbuf_;
+    if (__owns_ib_)
+        delete [] __intbuf_;
+    __ebs_ = __n;
+    if (__ebs_ > sizeof(__extbuf_min_))
+    {
+        if (__always_noconv_ && __s)
+        {
+            __extbuf_ = (char*)__s;
+            __owns_eb_ = false;
+        }
+        else
+        {
+            __extbuf_ = new char[__ebs_];
+            __owns_eb_ = true;
+        }
+    }
+    else
+    {
+        __extbuf_ = __extbuf_min_;
+        __ebs_ = sizeof(__extbuf_min_);
+        __owns_eb_ = false;
+    }
+    if (!__always_noconv_)
+    {
+        __ibs_ = max<streamsize>(__n, sizeof(__extbuf_min_));
+        if (__s && __ibs_ >= sizeof(__extbuf_min_))
+        {
+            __intbuf_ = __s;
+            __owns_ib_ = false;
+        }
+        else
+        {
+            __intbuf_ = new char_type[__ibs_];
+            __owns_ib_ = true;
+        }
+    }
+    else
+    {
+        __ibs_ = 0;
+        __intbuf_ = nullptr;
+        __owns_ib_ = false;
+    }
+    return this;
+}
+
+template <class _CharT, class _Traits>
+typename basic_filebuf<_CharT, _Traits>::pos_type
+basic_filebuf<_CharT, _Traits>::seekoff(off_type __off, ios_base::seekdir __way,
+                                        ios_base::openmode)
+{
+    if (!__cv_)
+        __throw_bad_cast();
+
+    int __width = __cv_->encoding();
+    if (__file_ == nullptr || (__width <= 0 && __off != 0) || sync())
+        return pos_type(off_type(-1));
+    // __width > 0 || __off == 0
+    int __whence;
+    switch (__way)
+    {
+    case ios_base::beg:
+        __whence = SEEK_SET;
+        break;
+    case ios_base::cur:
+        __whence = SEEK_CUR;
+        break;
+    case ios_base::end:
+        __whence = SEEK_END;
+        break;
+    default:
+        return pos_type(off_type(-1));
+    }
+#if defined(_LIBCPP_HAS_NO_OFF_T_FUNCTIONS)
+    if (fseek(__file_, __width > 0 ? __width * __off : 0, __whence))
+        return pos_type(off_type(-1));
+    pos_type __r = ftell(__file_);
+#else
+    if (::fseeko(__file_, __width > 0 ? __width * __off : 0, __whence))
+        return pos_type(off_type(-1));
+    pos_type __r = ftello(__file_);
+#endif
+    __r.state(__st_);
+    return __r;
+}
+
+template <class _CharT, class _Traits>
+typename basic_filebuf<_CharT, _Traits>::pos_type
+basic_filebuf<_CharT, _Traits>::seekpos(pos_type __sp, ios_base::openmode)
+{
+    if (__file_ == nullptr || sync())
+        return pos_type(off_type(-1));
+#if defined(_LIBCPP_HAS_NO_OFF_T_FUNCTIONS)
+    if (fseek(__file_, __sp, SEEK_SET))
+        return pos_type(off_type(-1));
+#else
+    if (::fseeko(__file_, __sp, SEEK_SET))
+        return pos_type(off_type(-1));
+#endif
+    __st_ = __sp.state();
+    return __sp;
+}
+
+template <class _CharT, class _Traits>
+int
+basic_filebuf<_CharT, _Traits>::sync()
+{
+    if (__file_ == nullptr)
+        return 0;
+    if (!__cv_)
+        __throw_bad_cast();
+
+    if (__cm_ & ios_base::out)
+    {
+        if (this->pptr() != this->pbase())
+            if (overflow() == traits_type::eof())
+                return -1;
+        codecvt_base::result __r;
+        do
+        {
+            char* __extbe;
+            __r = __cv_->unshift(__st_, __extbuf_, __extbuf_ + __ebs_, __extbe);
+            size_t __nmemb = static_cast<size_t>(__extbe - __extbuf_);
+            if (fwrite(__extbuf_, 1, __nmemb, __file_) != __nmemb)
+                return -1;
+        } while (__r == codecvt_base::partial);
+        if (__r == codecvt_base::error)
+            return -1;
+        if (fflush(__file_))
+            return -1;
+    }
+    else if (__cm_ & ios_base::in)
+    {
+        off_type __c;
+        state_type __state = __st_last_;
+        bool __update_st = false;
+        if (__always_noconv_)
+            __c = this->egptr() - this->gptr();
+        else
+        {
+            int __width = __cv_->encoding();
+            __c = __extbufend_ - __extbufnext_;
+            if (__width > 0)
+                __c += __width * (this->egptr() - this->gptr());
+            else
+            {
+                if (this->gptr() != this->egptr())
+                {
+                    const int __off =  __cv_->length(__state, __extbuf_,
+                                                     __extbufnext_,
+                                                     this->gptr() - this->eback());
+                    __c += __extbufnext_ - __extbuf_ - __off;
+                    __update_st = true;
+                }
+            }
+        }
+#if defined(_LIBCPP_HAS_NO_OFF_T_FUNCTIONS)
+        if (fseek(__file_, -__c, SEEK_CUR))
+            return -1;
+#else
+        if (::fseeko(__file_, -__c, SEEK_CUR))
+            return -1;
+#endif
+        if (__update_st)
+            __st_ = __state;
+        __extbufnext_ = __extbufend_ = __extbuf_;
+        this->setg(nullptr, nullptr, nullptr);
+        __cm_ = 0;
+    }
+    return 0;
+}
+
+template <class _CharT, class _Traits>
+void
+basic_filebuf<_CharT, _Traits>::imbue(const locale& __loc)
+{
+    sync();
+    __cv_ = &std::use_facet<codecvt<char_type, char, state_type> >(__loc);
+    bool __old_anc = __always_noconv_;
+    __always_noconv_ = __cv_->always_noconv();
+    if (__old_anc != __always_noconv_)
+    {
+        this->setg(nullptr, nullptr, nullptr);
+        this->setp(nullptr, nullptr);
+        // invariant, char_type is char, else we couldn't get here
+        if (__always_noconv_)  // need to dump __intbuf_
+        {
+            if (__owns_eb_)
+                delete [] __extbuf_;
+            __owns_eb_ = __owns_ib_;
+            __ebs_ = __ibs_;
+            __extbuf_ = (char*)__intbuf_;
+            __ibs_ = 0;
+            __intbuf_ = nullptr;
+            __owns_ib_ = false;
+        }
+        else  // need to obtain an __intbuf_.
+        {     // If __extbuf_ is user-supplied, use it, else new __intbuf_
+            if (!__owns_eb_ && __extbuf_ != __extbuf_min_)
+            {
+                __ibs_ = __ebs_;
+                __intbuf_ = (char_type*)__extbuf_;
+                __owns_ib_ = false;
+                __extbuf_ = new char[__ebs_];
+                __owns_eb_ = true;
+            }
+            else
+            {
+                __ibs_ = __ebs_;
+                __intbuf_ = new char_type[__ibs_];
+                __owns_ib_ = true;
+            }
+        }
+    }
+}
+
+template <class _CharT, class _Traits>
+bool
+basic_filebuf<_CharT, _Traits>::__read_mode()
+{
+    if (!(__cm_ & ios_base::in))
+    {
+        this->setp(nullptr, nullptr);
+        if (__always_noconv_)
+            this->setg((char_type*)__extbuf_,
+                       (char_type*)__extbuf_ + __ebs_,
+                       (char_type*)__extbuf_ + __ebs_);
+        else
+            this->setg(__intbuf_, __intbuf_ + __ibs_, __intbuf_ + __ibs_);
+        __cm_ = ios_base::in;
+        return true;
+    }
+    return false;
+}
+
+template <class _CharT, class _Traits>
+void
+basic_filebuf<_CharT, _Traits>::__write_mode()
+{
+    if (!(__cm_ & ios_base::out))
+    {
+        this->setg(nullptr, nullptr, nullptr);
+        if (__ebs_ > sizeof(__extbuf_min_))
+        {
+            if (__always_noconv_)
+                this->setp((char_type*)__extbuf_,
+                           (char_type*)__extbuf_ + (__ebs_ - 1));
+            else
+                this->setp(__intbuf_, __intbuf_ + (__ibs_ - 1));
+        }
+        else
+            this->setp(nullptr, nullptr);
+        __cm_ = ios_base::out;
+    }
+}
+
+// basic_ifstream
+
+template <class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS basic_ifstream
+    : public basic_istream<_CharT, _Traits>
+{
+public:
+    typedef _CharT                         char_type;
+    typedef _Traits                        traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ifstream();
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_ifstream(const char* __s, ios_base::openmode __mode = ios_base::in);
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_ifstream(const wchar_t* __s, ios_base::openmode __mode = ios_base::in);
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_ifstream(const string& __s, ios_base::openmode __mode = ios_base::in);
+#if _LIBCPP_STD_VER >= 17 && !defined(_LIBCPP_HAS_NO_FILESYSTEM_LIBRARY)
+    _LIBCPP_AVAILABILITY_FILESYSTEM _LIBCPP_INLINE_VISIBILITY
+    explicit basic_ifstream(const filesystem::path& __p, ios_base::openmode __mode = ios_base::in)
+      : basic_ifstream(__p.c_str(), __mode) {}
+#endif // _LIBCPP_STD_VER >= 17
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ifstream(basic_ifstream&& __rhs);
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ifstream& operator=(basic_ifstream&& __rhs);
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(basic_ifstream& __rhs);
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_filebuf<char_type, traits_type>* rdbuf() const;
+    _LIBCPP_INLINE_VISIBILITY
+    bool is_open() const;
+    void open(const char* __s, ios_base::openmode __mode = ios_base::in);
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+    void open(const wchar_t* __s, ios_base::openmode __mode = ios_base::in);
+#endif
+    void open(const string& __s, ios_base::openmode __mode = ios_base::in);
+#if _LIBCPP_STD_VER >= 17 && !defined(_LIBCPP_HAS_NO_FILESYSTEM_LIBRARY)
+    _LIBCPP_AVAILABILITY_FILESYSTEM _LIBCPP_INLINE_VISIBILITY
+    void open(const filesystem::path& __p,
+              ios_base::openmode __mode = ios_base::in) {
+      return open(__p.c_str(), __mode);
+    }
+#endif // _LIBCPP_STD_VER >= 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __open(int __fd, ios_base::openmode __mode);
+    _LIBCPP_INLINE_VISIBILITY
+    void close();
+
+private:
+    basic_filebuf<char_type, traits_type> __sb_;
+};
+
+template <class _CharT, class _Traits>
+inline
+basic_ifstream<_CharT, _Traits>::basic_ifstream()
+    : basic_istream<char_type, traits_type>(&__sb_)
+{
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_ifstream<_CharT, _Traits>::basic_ifstream(const char* __s, ios_base::openmode __mode)
+    : basic_istream<char_type, traits_type>(&__sb_)
+{
+    if (__sb_.open(__s, __mode | ios_base::in) == nullptr)
+        this->setstate(ios_base::failbit);
+}
+
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+template <class _CharT, class _Traits>
+inline
+basic_ifstream<_CharT, _Traits>::basic_ifstream(const wchar_t* __s, ios_base::openmode __mode)
+    : basic_istream<char_type, traits_type>(&__sb_)
+{
+    if (__sb_.open(__s, __mode | ios_base::in) == nullptr)
+        this->setstate(ios_base::failbit);
+}
+#endif
+
+template <class _CharT, class _Traits>
+inline
+basic_ifstream<_CharT, _Traits>::basic_ifstream(const string& __s, ios_base::openmode __mode)
+    : basic_istream<char_type, traits_type>(&__sb_)
+{
+    if (__sb_.open(__s, __mode | ios_base::in) == nullptr)
+        this->setstate(ios_base::failbit);
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_ifstream<_CharT, _Traits>::basic_ifstream(basic_ifstream&& __rhs)
+    : basic_istream<char_type, traits_type>(_VSTD::move(__rhs)),
+      __sb_(_VSTD::move(__rhs.__sb_))
+{
+    this->set_rdbuf(&__sb_);
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_ifstream<_CharT, _Traits>&
+basic_ifstream<_CharT, _Traits>::operator=(basic_ifstream&& __rhs)
+{
+    basic_istream<char_type, traits_type>::operator=(_VSTD::move(__rhs));
+    __sb_ = _VSTD::move(__rhs.__sb_);
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+inline
+void
+basic_ifstream<_CharT, _Traits>::swap(basic_ifstream& __rhs)
+{
+    basic_istream<char_type, traits_type>::swap(__rhs);
+    __sb_.swap(__rhs.__sb_);
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(basic_ifstream<_CharT, _Traits>& __x, basic_ifstream<_CharT, _Traits>& __y)
+{
+    __x.swap(__y);
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_filebuf<_CharT, _Traits>*
+basic_ifstream<_CharT, _Traits>::rdbuf() const
+{
+    return const_cast<basic_filebuf<char_type, traits_type>*>(&__sb_);
+}
+
+template <class _CharT, class _Traits>
+inline
+bool
+basic_ifstream<_CharT, _Traits>::is_open() const
+{
+    return __sb_.is_open();
+}
+
+template <class _CharT, class _Traits>
+void
+basic_ifstream<_CharT, _Traits>::open(const char* __s, ios_base::openmode __mode)
+{
+    if (__sb_.open(__s, __mode | ios_base::in))
+        this->clear();
+    else
+        this->setstate(ios_base::failbit);
+}
+
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+template <class _CharT, class _Traits>
+void
+basic_ifstream<_CharT, _Traits>::open(const wchar_t* __s, ios_base::openmode __mode)
+{
+    if (__sb_.open(__s, __mode | ios_base::in))
+        this->clear();
+    else
+        this->setstate(ios_base::failbit);
+}
+#endif
+
+template <class _CharT, class _Traits>
+void
+basic_ifstream<_CharT, _Traits>::open(const string& __s, ios_base::openmode __mode)
+{
+    if (__sb_.open(__s, __mode | ios_base::in))
+        this->clear();
+    else
+        this->setstate(ios_base::failbit);
+}
+
+template <class _CharT, class _Traits>
+inline
+void basic_ifstream<_CharT, _Traits>::__open(int __fd,
+                                             ios_base::openmode __mode) {
+  if (__sb_.__open(__fd, __mode | ios_base::in))
+    this->clear();
+  else
+    this->setstate(ios_base::failbit);
+}
+
+template <class _CharT, class _Traits>
+inline
+void
+basic_ifstream<_CharT, _Traits>::close()
+{
+    if (__sb_.close() == 0)
+        this->setstate(ios_base::failbit);
+}
+
+// basic_ofstream
+
+template <class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS basic_ofstream
+    : public basic_ostream<_CharT, _Traits>
+{
+public:
+    typedef _CharT                         char_type;
+    typedef _Traits                        traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ofstream();
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_ofstream(const char* __s, ios_base::openmode __mode = ios_base::out);
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_ofstream(const wchar_t* __s, ios_base::openmode __mode = ios_base::out);
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_ofstream(const string& __s, ios_base::openmode __mode = ios_base::out);
+
+#if _LIBCPP_STD_VER >= 17 && !defined(_LIBCPP_HAS_NO_FILESYSTEM_LIBRARY)
+    _LIBCPP_AVAILABILITY_FILESYSTEM _LIBCPP_INLINE_VISIBILITY
+    explicit basic_ofstream(const filesystem::path& __p, ios_base::openmode __mode = ios_base::out)
+      : basic_ofstream(__p.c_str(), __mode) {}
+#endif // _LIBCPP_STD_VER >= 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ofstream(basic_ofstream&& __rhs);
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ofstream& operator=(basic_ofstream&& __rhs);
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(basic_ofstream& __rhs);
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_filebuf<char_type, traits_type>* rdbuf() const;
+    _LIBCPP_INLINE_VISIBILITY
+    bool is_open() const;
+    void open(const char* __s, ios_base::openmode __mode = ios_base::out);
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+    void open(const wchar_t* __s, ios_base::openmode __mode = ios_base::out);
+#endif
+    void open(const string& __s, ios_base::openmode __mode = ios_base::out);
+
+#if _LIBCPP_STD_VER >= 17 && !defined(_LIBCPP_HAS_NO_FILESYSTEM_LIBRARY)
+    _LIBCPP_AVAILABILITY_FILESYSTEM _LIBCPP_INLINE_VISIBILITY
+    void open(const filesystem::path& __p, ios_base::openmode __mode = ios_base::out)
+    { return open(__p.c_str(), __mode); }
+#endif // _LIBCPP_STD_VER >= 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __open(int __fd, ios_base::openmode __mode);
+    _LIBCPP_INLINE_VISIBILITY
+    void close();
+
+private:
+    basic_filebuf<char_type, traits_type> __sb_;
+};
+
+template <class _CharT, class _Traits>
+inline
+basic_ofstream<_CharT, _Traits>::basic_ofstream()
+    : basic_ostream<char_type, traits_type>(&__sb_)
+{
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_ofstream<_CharT, _Traits>::basic_ofstream(const char* __s, ios_base::openmode __mode)
+    : basic_ostream<char_type, traits_type>(&__sb_)
+{
+    if (__sb_.open(__s, __mode | ios_base::out) == nullptr)
+        this->setstate(ios_base::failbit);
+}
+
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+template <class _CharT, class _Traits>
+inline
+basic_ofstream<_CharT, _Traits>::basic_ofstream(const wchar_t* __s, ios_base::openmode __mode)
+    : basic_ostream<char_type, traits_type>(&__sb_)
+{
+    if (__sb_.open(__s, __mode | ios_base::out) == nullptr)
+        this->setstate(ios_base::failbit);
+}
+#endif
+
+template <class _CharT, class _Traits>
+inline
+basic_ofstream<_CharT, _Traits>::basic_ofstream(const string& __s, ios_base::openmode __mode)
+    : basic_ostream<char_type, traits_type>(&__sb_)
+{
+    if (__sb_.open(__s, __mode | ios_base::out) == nullptr)
+        this->setstate(ios_base::failbit);
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_ofstream<_CharT, _Traits>::basic_ofstream(basic_ofstream&& __rhs)
+    : basic_ostream<char_type, traits_type>(_VSTD::move(__rhs)),
+      __sb_(_VSTD::move(__rhs.__sb_))
+{
+    this->set_rdbuf(&__sb_);
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_ofstream<_CharT, _Traits>&
+basic_ofstream<_CharT, _Traits>::operator=(basic_ofstream&& __rhs)
+{
+    basic_ostream<char_type, traits_type>::operator=(_VSTD::move(__rhs));
+    __sb_ = _VSTD::move(__rhs.__sb_);
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+inline
+void
+basic_ofstream<_CharT, _Traits>::swap(basic_ofstream& __rhs)
+{
+    basic_ostream<char_type, traits_type>::swap(__rhs);
+    __sb_.swap(__rhs.__sb_);
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(basic_ofstream<_CharT, _Traits>& __x, basic_ofstream<_CharT, _Traits>& __y)
+{
+    __x.swap(__y);
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_filebuf<_CharT, _Traits>*
+basic_ofstream<_CharT, _Traits>::rdbuf() const
+{
+    return const_cast<basic_filebuf<char_type, traits_type>*>(&__sb_);
+}
+
+template <class _CharT, class _Traits>
+inline
+bool
+basic_ofstream<_CharT, _Traits>::is_open() const
+{
+    return __sb_.is_open();
+}
+
+template <class _CharT, class _Traits>
+void
+basic_ofstream<_CharT, _Traits>::open(const char* __s, ios_base::openmode __mode)
+{
+    if (__sb_.open(__s, __mode | ios_base::out))
+        this->clear();
+    else
+        this->setstate(ios_base::failbit);
+}
+
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+template <class _CharT, class _Traits>
+void
+basic_ofstream<_CharT, _Traits>::open(const wchar_t* __s, ios_base::openmode __mode)
+{
+    if (__sb_.open(__s, __mode | ios_base::out))
+        this->clear();
+    else
+        this->setstate(ios_base::failbit);
+}
+#endif
+
+template <class _CharT, class _Traits>
+void
+basic_ofstream<_CharT, _Traits>::open(const string& __s, ios_base::openmode __mode)
+{
+    if (__sb_.open(__s, __mode | ios_base::out))
+        this->clear();
+    else
+        this->setstate(ios_base::failbit);
+}
+
+template <class _CharT, class _Traits>
+inline
+void basic_ofstream<_CharT, _Traits>::__open(int __fd,
+                                             ios_base::openmode __mode) {
+  if (__sb_.__open(__fd, __mode | ios_base::out))
+    this->clear();
+  else
+    this->setstate(ios_base::failbit);
+}
+
+template <class _CharT, class _Traits>
+inline
+void
+basic_ofstream<_CharT, _Traits>::close()
+{
+    if (__sb_.close() == nullptr)
+        this->setstate(ios_base::failbit);
+}
+
+// basic_fstream
+
+template <class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS basic_fstream
+    : public basic_iostream<_CharT, _Traits>
+{
+public:
+    typedef _CharT                         char_type;
+    typedef _Traits                        traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_fstream();
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_fstream(const char* __s, ios_base::openmode __mode = ios_base::in | ios_base::out);
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_fstream(const wchar_t* __s, ios_base::openmode __mode = ios_base::in | ios_base::out);
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_fstream(const string& __s, ios_base::openmode __mode = ios_base::in | ios_base::out);
+
+#if _LIBCPP_STD_VER >= 17 && !defined(_LIBCPP_HAS_NO_FILESYSTEM_LIBRARY)
+    _LIBCPP_AVAILABILITY_FILESYSTEM _LIBCPP_INLINE_VISIBILITY
+    explicit basic_fstream(const filesystem::path& __p, ios_base::openmode __mode = ios_base::in | ios_base::out)
+      : basic_fstream(__p.c_str(), __mode) {}
+#endif // _LIBCPP_STD_VER >= 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_fstream(basic_fstream&& __rhs);
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_fstream& operator=(basic_fstream&& __rhs);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(basic_fstream& __rhs);
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_filebuf<char_type, traits_type>* rdbuf() const;
+    _LIBCPP_INLINE_VISIBILITY
+    bool is_open() const;
+    void open(const char* __s, ios_base::openmode __mode = ios_base::in | ios_base::out);
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+    void open(const wchar_t* __s, ios_base::openmode __mode = ios_base::in | ios_base::out);
+#endif
+    void open(const string& __s, ios_base::openmode __mode = ios_base::in | ios_base::out);
+
+#if _LIBCPP_STD_VER >= 17 && !defined(_LIBCPP_HAS_NO_FILESYSTEM_LIBRARY)
+    _LIBCPP_AVAILABILITY_FILESYSTEM _LIBCPP_INLINE_VISIBILITY
+    void open(const filesystem::path& __p, ios_base::openmode __mode = ios_base::in|ios_base::out)
+    { return open(__p.c_str(), __mode); }
+#endif // _LIBCPP_STD_VER >= 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    void close();
+
+private:
+    basic_filebuf<char_type, traits_type> __sb_;
+};
+
+template <class _CharT, class _Traits>
+inline
+basic_fstream<_CharT, _Traits>::basic_fstream()
+    : basic_iostream<char_type, traits_type>(&__sb_)
+{
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_fstream<_CharT, _Traits>::basic_fstream(const char* __s, ios_base::openmode __mode)
+    : basic_iostream<char_type, traits_type>(&__sb_)
+{
+    if (__sb_.open(__s, __mode) == nullptr)
+        this->setstate(ios_base::failbit);
+}
+
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+template <class _CharT, class _Traits>
+inline
+basic_fstream<_CharT, _Traits>::basic_fstream(const wchar_t* __s, ios_base::openmode __mode)
+    : basic_iostream<char_type, traits_type>(&__sb_)
+{
+    if (__sb_.open(__s, __mode) == nullptr)
+        this->setstate(ios_base::failbit);
+}
+#endif
+
+template <class _CharT, class _Traits>
+inline
+basic_fstream<_CharT, _Traits>::basic_fstream(const string& __s, ios_base::openmode __mode)
+    : basic_iostream<char_type, traits_type>(&__sb_)
+{
+    if (__sb_.open(__s, __mode) == nullptr)
+        this->setstate(ios_base::failbit);
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_fstream<_CharT, _Traits>::basic_fstream(basic_fstream&& __rhs)
+    : basic_iostream<char_type, traits_type>(_VSTD::move(__rhs)),
+      __sb_(_VSTD::move(__rhs.__sb_))
+{
+    this->set_rdbuf(&__sb_);
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_fstream<_CharT, _Traits>&
+basic_fstream<_CharT, _Traits>::operator=(basic_fstream&& __rhs)
+{
+    basic_iostream<char_type, traits_type>::operator=(_VSTD::move(__rhs));
+    __sb_ = _VSTD::move(__rhs.__sb_);
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+inline
+void
+basic_fstream<_CharT, _Traits>::swap(basic_fstream& __rhs)
+{
+    basic_iostream<char_type, traits_type>::swap(__rhs);
+    __sb_.swap(__rhs.__sb_);
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(basic_fstream<_CharT, _Traits>& __x, basic_fstream<_CharT, _Traits>& __y)
+{
+    __x.swap(__y);
+}
+
+template <class _CharT, class _Traits>
+inline
+basic_filebuf<_CharT, _Traits>*
+basic_fstream<_CharT, _Traits>::rdbuf() const
+{
+    return const_cast<basic_filebuf<char_type, traits_type>*>(&__sb_);
+}
+
+template <class _CharT, class _Traits>
+inline
+bool
+basic_fstream<_CharT, _Traits>::is_open() const
+{
+    return __sb_.is_open();
+}
+
+template <class _CharT, class _Traits>
+void
+basic_fstream<_CharT, _Traits>::open(const char* __s, ios_base::openmode __mode)
+{
+    if (__sb_.open(__s, __mode))
+        this->clear();
+    else
+        this->setstate(ios_base::failbit);
+}
+
+#ifdef _LIBCPP_HAS_OPEN_WITH_WCHAR
+template <class _CharT, class _Traits>
+void
+basic_fstream<_CharT, _Traits>::open(const wchar_t* __s, ios_base::openmode __mode)
+{
+    if (__sb_.open(__s, __mode))
+        this->clear();
+    else
+        this->setstate(ios_base::failbit);
+}
+#endif
+
+template <class _CharT, class _Traits>
+void
+basic_fstream<_CharT, _Traits>::open(const string& __s, ios_base::openmode __mode)
+{
+    if (__sb_.open(__s, __mode))
+        this->clear();
+    else
+        this->setstate(ios_base::failbit);
+}
+
+template <class _CharT, class _Traits>
+inline
+void
+basic_fstream<_CharT, _Traits>::close()
+{
+    if (__sb_.close() == nullptr)
+        this->setstate(ios_base::failbit);
+}
+
+#if defined(_LIBCPP_ABI_ENABLE_ADDITIONAL_IOSTREAM_EXPLICIT_INSTANTIATIONS_1)
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_ifstream<char>;
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_ofstream<char>;
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_filebuf<char>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_HAS_NO_FSTREAM
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <atomic>
+#  include <concepts>
+#  include <iosfwd>
+#  include <limits>
+#  include <new>
+#  include <stdexcept>
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_FSTREAM
diff --git a/app/src/main/cpp/libcxx/include/functional b/app/src/main/cpp/libcxx/include/functional
new file mode 100644
index 0000000..8589d3a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/functional
@@ -0,0 +1,550 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_FUNCTIONAL
+#define _LIBCPP_FUNCTIONAL
+
+/*
+    functional synopsis
+
+namespace std
+{
+
+template <class Arg, class Result>
+struct unary_function
+{
+    typedef Arg    argument_type;
+    typedef Result result_type;
+};
+
+template <class Arg1, class Arg2, class Result>
+struct binary_function
+{
+    typedef Arg1   first_argument_type;
+    typedef Arg2   second_argument_type;
+    typedef Result result_type;
+};
+
+template <class T>
+class reference_wrapper
+    : public unary_function<T1, R> // if wrapping a unary functor
+    : public binary_function<T1, T2, R> // if wraping a binary functor
+{
+public:
+    // types
+    typedef T type;
+    typedef see below result_type; // Not always defined
+
+    // construct/copy/destroy
+    template<class U>
+      reference_wrapper(U&&);
+    reference_wrapper(const reference_wrapper<T>& x) noexcept;
+
+    // assignment
+    reference_wrapper& operator=(const reference_wrapper<T>& x) noexcept;
+
+    // access
+    operator T& () const noexcept;
+    T& get() const noexcept;
+
+    // invoke
+    template <class... ArgTypes>
+      typename result_of<T&(ArgTypes&&...)>::type
+          operator() (ArgTypes&&...) const;
+};
+
+template <class T>
+  reference_wrapper(T&) -> reference_wrapper<T>;
+
+template <class T> reference_wrapper<T> ref(T& t) noexcept;
+template <class T> void ref(const T&& t) = delete;
+template <class T> reference_wrapper<T> ref(reference_wrapper<T>t) noexcept;
+
+template <class T> reference_wrapper<const T> cref(const T& t) noexcept;
+template <class T> void cref(const T&& t) = delete;
+template <class T> reference_wrapper<const T> cref(reference_wrapper<T> t) noexcept;
+
+template <class T> struct unwrap_reference;                                       // since C++20
+template <class T> struct unwrap_ref_decay : unwrap_reference<decay_t<T>> { };    // since C++20
+template <class T> using unwrap_reference_t = typename unwrap_reference<T>::type; // since C++20
+template <class T> using unwrap_ref_decay_t = typename unwrap_ref_decay<T>::type; // since C++20
+
+template <class T> // <class T=void> in C++14
+struct plus {
+    T operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct minus {
+    T operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct multiplies {
+    T operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct divides {
+    T operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct modulus {
+    T operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct negate {
+    T operator()(const T& x) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct equal_to {
+    bool operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct not_equal_to {
+    bool operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct greater {
+    bool operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct less {
+    bool operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct greater_equal {
+    bool operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct less_equal {
+    bool operator()(const T& x, const T& y) const;
+};
+
+// [comparisons.three.way], class compare_three_way
+struct compare_three_way;
+
+template <class T> // <class T=void> in C++14
+struct logical_and {
+    bool operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct logical_or {
+    bool operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct logical_not {
+    bool operator()(const T& x) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct bit_and {
+    T operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct bit_or {
+    T operator()(const T& x, const T& y) const;
+};
+
+template <class T> // <class T=void> in C++14
+struct bit_xor {
+    T operator()(const T& x, const T& y) const;
+};
+
+template <class T=void> // C++14
+struct bit_not {
+    T operator()(const T& x) const;
+};
+
+struct identity; // C++20
+
+template <class Predicate>
+class unary_negate // deprecated in C++17, removed in C++20
+    : public unary_function<typename Predicate::argument_type, bool>
+{
+public:
+    explicit unary_negate(const Predicate& pred);
+    bool operator()(const typename Predicate::argument_type& x) const;
+};
+
+template <class Predicate> // deprecated in C++17, removed in C++20
+unary_negate<Predicate> not1(const Predicate& pred);
+
+template <class Predicate>
+class binary_negate // deprecated in C++17, removed in C++20
+    : public binary_function<typename Predicate::first_argument_type,
+                             typename Predicate::second_argument_type,
+                             bool>
+{
+public:
+    explicit binary_negate(const Predicate& pred);
+    bool operator()(const typename Predicate::first_argument_type& x,
+                    const typename Predicate::second_argument_type& y) const;
+};
+
+template <class Predicate> // deprecated in C++17, removed in C++20
+binary_negate<Predicate> not2(const Predicate& pred);
+
+template <class F>
+constexpr unspecified not_fn(F&& f); // C++17, constexpr in C++20
+
+template<class T> struct is_bind_expression;
+template<class T> struct is_placeholder;
+
+    // See C++14 20.9.9, Function object binders
+template <class T> inline constexpr bool is_bind_expression_v
+  = is_bind_expression<T>::value; // C++17
+template <class T> inline constexpr int is_placeholder_v
+  = is_placeholder<T>::value; // C++17
+
+
+template<class Fn, class... BoundArgs>
+  constexpr unspecified bind(Fn&&, BoundArgs&&...);  // constexpr in C++20
+template<class R, class Fn, class... BoundArgs>
+  constexpr unspecified bind(Fn&&, BoundArgs&&...);  // constexpr in C++20
+
+template<class F, class... Args>
+ constexpr // constexpr in C++20
+ invoke_result_t<F, Args...> invoke(F&& f, Args&&... args) // C++17
+    noexcept(is_nothrow_invocable_v<F, Args...>);
+
+namespace placeholders {
+  // M is the implementation-defined number of placeholders
+  extern unspecified _1;
+  extern unspecified _2;
+  .
+  .
+  .
+  extern unspecified _Mp;
+}
+
+template <class Operation>
+class binder1st     // deprecated in C++11, removed in C++17
+    : public unary_function<typename Operation::second_argument_type,
+                            typename Operation::result_type>
+{
+protected:
+    Operation                               op;
+    typename Operation::first_argument_type value;
+public:
+    binder1st(const Operation& x, const typename Operation::first_argument_type y);
+    typename Operation::result_type operator()(      typename Operation::second_argument_type& x) const;
+    typename Operation::result_type operator()(const typename Operation::second_argument_type& x) const;
+};
+
+template <class Operation, class T>
+binder1st<Operation> bind1st(const Operation& op, const T& x);  // deprecated in C++11, removed in C++17
+
+template <class Operation>
+class binder2nd     // deprecated in C++11, removed in C++17
+    : public unary_function<typename Operation::first_argument_type,
+                            typename Operation::result_type>
+{
+protected:
+    Operation                                op;
+    typename Operation::second_argument_type value;
+public:
+    binder2nd(const Operation& x, const typename Operation::second_argument_type y);
+    typename Operation::result_type operator()(      typename Operation::first_argument_type& x) const;
+    typename Operation::result_type operator()(const typename Operation::first_argument_type& x) const;
+};
+
+template <class Operation, class T>
+binder2nd<Operation> bind2nd(const Operation& op, const T& x);  // deprecated in C++11, removed in C++17
+
+template <class Arg, class Result>      // deprecated in C++11, removed in C++17
+class pointer_to_unary_function : public unary_function<Arg, Result>
+{
+public:
+    explicit pointer_to_unary_function(Result (*f)(Arg));
+    Result operator()(Arg x) const;
+};
+
+template <class Arg, class Result>
+pointer_to_unary_function<Arg,Result> ptr_fun(Result (*f)(Arg));      // deprecated in C++11, removed in C++17
+
+template <class Arg1, class Arg2, class Result>      // deprecated in C++11, removed in C++17
+class pointer_to_binary_function : public binary_function<Arg1, Arg2, Result>
+{
+public:
+    explicit pointer_to_binary_function(Result (*f)(Arg1, Arg2));
+    Result operator()(Arg1 x, Arg2 y) const;
+};
+
+template <class Arg1, class Arg2, class Result>
+pointer_to_binary_function<Arg1,Arg2,Result> ptr_fun(Result (*f)(Arg1,Arg2));      // deprecated in C++11, removed in C++17
+
+template<class S, class T>      // deprecated in C++11, removed in C++17
+class mem_fun_t : public unary_function<T*, S>
+{
+public:
+    explicit mem_fun_t(S (T::*p)());
+    S operator()(T* p) const;
+};
+
+template<class S, class T, class A>
+class mem_fun1_t : public binary_function<T*, A, S>      // deprecated in C++11, removed in C++17
+{
+public:
+    explicit mem_fun1_t(S (T::*p)(A));
+    S operator()(T* p, A x) const;
+};
+
+template<class S, class T>          mem_fun_t<S,T>    mem_fun(S (T::*f)());      // deprecated in C++11, removed in C++17
+template<class S, class T, class A> mem_fun1_t<S,T,A> mem_fun(S (T::*f)(A));     // deprecated in C++11, removed in C++17
+
+template<class S, class T>
+class mem_fun_ref_t : public unary_function<T, S>      // deprecated in C++11, removed in C++17
+{
+public:
+    explicit mem_fun_ref_t(S (T::*p)());
+    S operator()(T& p) const;
+};
+
+template<class S, class T, class A>
+class mem_fun1_ref_t : public binary_function<T, A, S>      // deprecated in C++11, removed in C++17
+{
+public:
+    explicit mem_fun1_ref_t(S (T::*p)(A));
+    S operator()(T& p, A x) const;
+};
+
+template<class S, class T>          mem_fun_ref_t<S,T>    mem_fun_ref(S (T::*f)());      // deprecated in C++11, removed in C++17
+template<class S, class T, class A> mem_fun1_ref_t<S,T,A> mem_fun_ref(S (T::*f)(A));     // deprecated in C++11, removed in C++17
+
+template <class S, class T>
+class const_mem_fun_t : public unary_function<const T*, S>      // deprecated in C++11, removed in C++17
+{
+public:
+    explicit const_mem_fun_t(S (T::*p)() const);
+    S operator()(const T* p) const;
+};
+
+template <class S, class T, class A>
+class const_mem_fun1_t : public binary_function<const T*, A, S>      // deprecated in C++11, removed in C++17
+{
+public:
+    explicit const_mem_fun1_t(S (T::*p)(A) const);
+    S operator()(const T* p, A x) const;
+};
+
+template <class S, class T>          const_mem_fun_t<S,T>    mem_fun(S (T::*f)() const);      // deprecated in C++11, removed in C++17
+template <class S, class T, class A> const_mem_fun1_t<S,T,A> mem_fun(S (T::*f)(A) const);     // deprecated in C++11, removed in C++17
+
+template <class S, class T>
+class const_mem_fun_ref_t : public unary_function<T, S>      // deprecated in C++11, removed in C++17
+{
+public:
+    explicit const_mem_fun_ref_t(S (T::*p)() const);
+    S operator()(const T& p) const;
+};
+
+template <class S, class T, class A>
+class const_mem_fun1_ref_t : public binary_function<T, A, S>      // deprecated in C++11, removed in C++17
+{
+public:
+    explicit const_mem_fun1_ref_t(S (T::*p)(A) const);
+    S operator()(const T& p, A x) const;
+};
+
+template <class S, class T>          const_mem_fun_ref_t<S,T>    mem_fun_ref(S (T::*f)() const);   // deprecated in C++11, removed in C++17
+template <class S, class T, class A> const_mem_fun1_ref_t<S,T,A> mem_fun_ref(S (T::*f)(A) const);  // deprecated in C++11, removed in C++17
+
+template<class R, class T>
+constexpr unspecified mem_fn(R T::*); // constexpr in C++20
+
+class bad_function_call
+    : public exception
+{
+};
+
+template<class> class function; // undefined
+
+template<class R, class... ArgTypes>
+class function<R(ArgTypes...)>
+  : public unary_function<T1, R>      // iff sizeof...(ArgTypes) == 1 and
+                                      // ArgTypes contains T1
+  : public binary_function<T1, T2, R> // iff sizeof...(ArgTypes) == 2 and
+                                      // ArgTypes contains T1 and T2
+{
+public:
+    typedef R result_type;
+
+    // construct/copy/destroy:
+    function() noexcept;
+    function(nullptr_t) noexcept;
+    function(const function&);
+    function(function&&) noexcept;
+    template<class F>
+      function(F);
+    template<Allocator Alloc>
+      function(allocator_arg_t, const Alloc&) noexcept;            // removed in C++17
+    template<Allocator Alloc>
+      function(allocator_arg_t, const Alloc&, nullptr_t) noexcept; // removed in C++17
+    template<Allocator Alloc>
+      function(allocator_arg_t, const Alloc&, const function&);    // removed in C++17
+    template<Allocator Alloc>
+      function(allocator_arg_t, const Alloc&, function&&);         // removed in C++17
+    template<class F, Allocator Alloc>
+      function(allocator_arg_t, const Alloc&, F);                  // removed in C++17
+
+    function& operator=(const function&);
+    function& operator=(function&&) noexcept;
+    function& operator=(nullptr_t) noexcept;
+    template<class F>
+      function& operator=(F&&);
+    template<class F>
+      function& operator=(reference_wrapper<F>) noexcept;
+
+    ~function();
+
+    // function modifiers:
+    void swap(function&) noexcept;
+    template<class F, class Alloc>
+      void assign(F&&, const Alloc&);                 // Removed in C++17
+
+    // function capacity:
+    explicit operator bool() const noexcept;
+
+    // function invocation:
+    R operator()(ArgTypes...) const;
+
+    // function target access:
+    const std::type_info& target_type() const noexcept;
+    template <typename T>       T* target() noexcept;
+    template <typename T> const T* target() const noexcept;
+};
+
+// Deduction guides
+template<class R, class ...Args>
+function(R(*)(Args...)) -> function<R(Args...)>; // since C++17
+
+template<class F>
+function(F) -> function<see-below>; // since C++17
+
+// Null pointer comparisons:
+template <class R, class ... ArgTypes>
+  bool operator==(const function<R(ArgTypes...)>&, nullptr_t) noexcept;
+
+template <class R, class ... ArgTypes>
+  bool operator==(nullptr_t, const function<R(ArgTypes...)>&) noexcept;
+
+template <class R, class ... ArgTypes>
+  bool operator!=(const function<R(ArgTypes...)>&, nullptr_t) noexcept;
+
+template <class  R, class ... ArgTypes>
+  bool operator!=(nullptr_t, const function<R(ArgTypes...)>&) noexcept;
+
+// specialized algorithms:
+template <class  R, class ... ArgTypes>
+  void swap(function<R(ArgTypes...)>&, function<R(ArgTypes...)>&) noexcept;
+
+template <class T> struct hash;
+
+template <> struct hash<bool>;
+template <> struct hash<char>;
+template <> struct hash<signed char>;
+template <> struct hash<unsigned char>;
+template <> struct hash<char8_t>; // since C++20
+template <> struct hash<char16_t>;
+template <> struct hash<char32_t>;
+template <> struct hash<wchar_t>;
+template <> struct hash<short>;
+template <> struct hash<unsigned short>;
+template <> struct hash<int>;
+template <> struct hash<unsigned int>;
+template <> struct hash<long>;
+template <> struct hash<long long>;
+template <> struct hash<unsigned long>;
+template <> struct hash<unsigned long long>;
+
+template <> struct hash<float>;
+template <> struct hash<double>;
+template <> struct hash<long double>;
+
+template<class T> struct hash<T*>;
+template <> struct hash<nullptr_t>;  // C++17
+
+namespace ranges {
+  // [range.cmp], concept-constrained comparisons
+  struct equal_to;
+  struct not_equal_to;
+  struct greater;
+  struct less;
+  struct greater_equal;
+  struct less_equal;
+}
+
+}  // std
+
+POLICY:  For non-variadic implementations, the number of arguments is limited
+         to 3.  It is hoped that the need for non-variadic implementations
+         will be minimal.
+
+*/
+
+#include <__algorithm/search.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__compare/compare_three_way.h>
+#include <__config>
+#include <__debug>
+#include <__functional/binary_function.h> // TODO: deprecate
+#include <__functional/binary_negate.h>
+#include <__functional/bind.h>
+#include <__functional/bind_back.h>
+#include <__functional/bind_front.h>
+#include <__functional/binder1st.h>
+#include <__functional/binder2nd.h>
+#include <__functional/boyer_moore_searcher.h>
+#include <__functional/compose.h>
+#include <__functional/default_searcher.h>
+#include <__functional/function.h>
+#include <__functional/hash.h>
+#include <__functional/identity.h>
+#include <__functional/invoke.h>
+#include <__functional/mem_fn.h> // TODO: deprecate
+#include <__functional/mem_fun_ref.h>
+#include <__functional/not_fn.h>
+#include <__functional/operations.h>
+#include <__functional/pointer_to_binary_function.h>
+#include <__functional/pointer_to_unary_function.h>
+#include <__functional/ranges_operations.h>
+#include <__functional/reference_wrapper.h>
+#include <__functional/unary_function.h> // TODO: deprecate
+#include <__functional/unary_negate.h>
+#include <__functional/unwrap_ref.h>
+#include <__utility/forward.h>
+#include <exception>
+#include <memory> // TODO: find out why removing this breaks the modules build
+#include <type_traits>
+#include <typeinfo>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <tuple>
+#  include <utility>
+#endif
+
+#endif // _LIBCPP_FUNCTIONAL
diff --git a/app/src/main/cpp/libcxx/include/future b/app/src/main/cpp/libcxx/include/future
new file mode 100644
index 0000000..2f14a47
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/future
@@ -0,0 +1,2457 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_FUTURE
+#define _LIBCPP_FUTURE
+
+/*
+    future synopsis
+
+namespace std
+{
+
+enum class future_errc
+{
+    future_already_retrieved = 1,
+    promise_already_satisfied,
+    no_state,
+    broken_promise
+};
+
+enum class launch
+{
+    async = 1,
+    deferred = 2,
+    any = async | deferred
+};
+
+enum class future_status
+{
+    ready,
+    timeout,
+    deferred
+};
+
+template <> struct is_error_code_enum<future_errc> : public true_type { };
+error_code make_error_code(future_errc e) noexcept;
+error_condition make_error_condition(future_errc e) noexcept;
+
+const error_category& future_category() noexcept;
+
+class future_error
+    : public logic_error
+{
+public:
+    future_error(error_code ec);  // exposition only
+    explicit future_error(future_errc); // C++17
+    const error_code& code() const noexcept;
+    const char*       what() const noexcept;
+};
+
+template <class R>
+class promise
+{
+public:
+    promise();
+    template <class Allocator>
+        promise(allocator_arg_t, const Allocator& a);
+    promise(promise&& rhs) noexcept;
+    promise(const promise& rhs) = delete;
+    ~promise();
+
+    // assignment
+    promise& operator=(promise&& rhs) noexcept;
+    promise& operator=(const promise& rhs) = delete;
+    void swap(promise& other) noexcept;
+
+    // retrieving the result
+    future<R> get_future();
+
+    // setting the result
+    void set_value(const R& r);
+    void set_value(R&& r);
+    void set_exception(exception_ptr p);
+
+    // setting the result with deferred notification
+    void set_value_at_thread_exit(const R& r);
+    void set_value_at_thread_exit(R&& r);
+    void set_exception_at_thread_exit(exception_ptr p);
+};
+
+template <class R>
+class promise<R&>
+{
+public:
+    promise();
+    template <class Allocator>
+        promise(allocator_arg_t, const Allocator& a);
+    promise(promise&& rhs) noexcept;
+    promise(const promise& rhs) = delete;
+    ~promise();
+
+    // assignment
+    promise& operator=(promise&& rhs) noexcept;
+    promise& operator=(const promise& rhs) = delete;
+    void swap(promise& other) noexcept;
+
+    // retrieving the result
+    future<R&> get_future();
+
+    // setting the result
+    void set_value(R& r);
+    void set_exception(exception_ptr p);
+
+    // setting the result with deferred notification
+    void set_value_at_thread_exit(R&);
+    void set_exception_at_thread_exit(exception_ptr p);
+};
+
+template <>
+class promise<void>
+{
+public:
+    promise();
+    template <class Allocator>
+        promise(allocator_arg_t, const Allocator& a);
+    promise(promise&& rhs) noexcept;
+    promise(const promise& rhs) = delete;
+    ~promise();
+
+    // assignment
+    promise& operator=(promise&& rhs) noexcept;
+    promise& operator=(const promise& rhs) = delete;
+    void swap(promise& other) noexcept;
+
+    // retrieving the result
+    future<void> get_future();
+
+    // setting the result
+    void set_value();
+    void set_exception(exception_ptr p);
+
+    // setting the result with deferred notification
+    void set_value_at_thread_exit();
+    void set_exception_at_thread_exit(exception_ptr p);
+};
+
+template <class R> void swap(promise<R>& x, promise<R>& y) noexcept;
+
+template <class R, class Alloc>
+    struct uses_allocator<promise<R>, Alloc> : public true_type {};
+
+template <class R>
+class future
+{
+public:
+    future() noexcept;
+    future(future&&) noexcept;
+    future(const future& rhs) = delete;
+    ~future();
+    future& operator=(const future& rhs) = delete;
+    future& operator=(future&&) noexcept;
+    shared_future<R> share() noexcept;
+
+    // retrieving the value
+    R get();
+
+    // functions to check state
+    bool valid() const noexcept;
+
+    void wait() const;
+    template <class Rep, class Period>
+        future_status
+        wait_for(const chrono::duration<Rep, Period>& rel_time) const;
+    template <class Clock, class Duration>
+        future_status
+        wait_until(const chrono::time_point<Clock, Duration>& abs_time) const;
+};
+
+template <class R>
+class future<R&>
+{
+public:
+    future() noexcept;
+    future(future&&) noexcept;
+    future(const future& rhs) = delete;
+    ~future();
+    future& operator=(const future& rhs) = delete;
+    future& operator=(future&&) noexcept;
+    shared_future<R&> share() noexcept;
+
+    // retrieving the value
+    R& get();
+
+    // functions to check state
+    bool valid() const noexcept;
+
+    void wait() const;
+    template <class Rep, class Period>
+        future_status
+        wait_for(const chrono::duration<Rep, Period>& rel_time) const;
+    template <class Clock, class Duration>
+        future_status
+        wait_until(const chrono::time_point<Clock, Duration>& abs_time) const;
+};
+
+template <>
+class future<void>
+{
+public:
+    future() noexcept;
+    future(future&&) noexcept;
+    future(const future& rhs) = delete;
+    ~future();
+    future& operator=(const future& rhs) = delete;
+    future& operator=(future&&) noexcept;
+    shared_future<void> share() noexcept;
+
+    // retrieving the value
+    void get();
+
+    // functions to check state
+    bool valid() const noexcept;
+
+    void wait() const;
+    template <class Rep, class Period>
+        future_status
+        wait_for(const chrono::duration<Rep, Period>& rel_time) const;
+    template <class Clock, class Duration>
+        future_status
+        wait_until(const chrono::time_point<Clock, Duration>& abs_time) const;
+};
+
+template <class R>
+class shared_future
+{
+public:
+    shared_future() noexcept;
+    shared_future(const shared_future& rhs);
+    shared_future(future<R>&&) noexcept;
+    shared_future(shared_future&& rhs) noexcept;
+    ~shared_future();
+    shared_future& operator=(const shared_future& rhs);
+    shared_future& operator=(shared_future&& rhs) noexcept;
+
+    // retrieving the value
+    const R& get() const;
+
+    // functions to check state
+    bool valid() const noexcept;
+
+    void wait() const;
+    template <class Rep, class Period>
+        future_status
+        wait_for(const chrono::duration<Rep, Period>& rel_time) const;
+    template <class Clock, class Duration>
+        future_status
+        wait_until(const chrono::time_point<Clock, Duration>& abs_time) const;
+};
+
+template <class R>
+class shared_future<R&>
+{
+public:
+    shared_future() noexcept;
+    shared_future(const shared_future& rhs);
+    shared_future(future<R&>&&) noexcept;
+    shared_future(shared_future&& rhs) noexcept;
+    ~shared_future();
+    shared_future& operator=(const shared_future& rhs);
+    shared_future& operator=(shared_future&& rhs) noexcept;
+
+    // retrieving the value
+    R& get() const;
+
+    // functions to check state
+    bool valid() const noexcept;
+
+    void wait() const;
+    template <class Rep, class Period>
+        future_status
+        wait_for(const chrono::duration<Rep, Period>& rel_time) const;
+    template <class Clock, class Duration>
+        future_status
+        wait_until(const chrono::time_point<Clock, Duration>& abs_time) const;
+};
+
+template <>
+class shared_future<void>
+{
+public:
+    shared_future() noexcept;
+    shared_future(const shared_future& rhs);
+    shared_future(future<void>&&) noexcept;
+    shared_future(shared_future&& rhs) noexcept;
+    ~shared_future();
+    shared_future& operator=(const shared_future& rhs);
+    shared_future& operator=(shared_future&& rhs) noexcept;
+
+    // retrieving the value
+    void get() const;
+
+    // functions to check state
+    bool valid() const noexcept;
+
+    void wait() const;
+    template <class Rep, class Period>
+        future_status
+        wait_for(const chrono::duration<Rep, Period>& rel_time) const;
+    template <class Clock, class Duration>
+        future_status
+        wait_until(const chrono::time_point<Clock, Duration>& abs_time) const;
+};
+
+template <class F, class... Args>
+  future<typename result_of<typename decay<F>::type(typename decay<Args>::type...)>::type>
+  async(F&& f, Args&&... args);
+
+template <class F, class... Args>
+  future<typename result_of<typename decay<F>::type(typename decay<Args>::type...)>::type>
+  async(launch policy, F&& f, Args&&... args);
+
+template <class> class packaged_task; // undefined
+
+template <class R, class... ArgTypes>
+class packaged_task<R(ArgTypes...)>
+{
+public:
+    typedef R result_type; // extension
+
+    // construction and destruction
+    packaged_task() noexcept;
+    template <class F>
+        explicit packaged_task(F&& f);
+    template <class F, class Allocator>
+        packaged_task(allocator_arg_t, const Allocator& a, F&& f);
+    ~packaged_task();
+
+    // no copy
+    packaged_task(const packaged_task&) = delete;
+    packaged_task& operator=(const packaged_task&) = delete;
+
+    // move support
+    packaged_task(packaged_task&& other) noexcept;
+    packaged_task& operator=(packaged_task&& other) noexcept;
+    void swap(packaged_task& other) noexcept;
+
+    bool valid() const noexcept;
+
+    // result retrieval
+    future<R> get_future();
+
+    // execution
+    void operator()(ArgTypes... );
+    void make_ready_at_thread_exit(ArgTypes...);
+
+    void reset();
+};
+
+template <class R>
+  void swap(packaged_task<R(ArgTypes...)&, packaged_task<R(ArgTypes...)>&) noexcept;
+
+template <class R, class Alloc> struct uses_allocator<packaged_task<R>, Alloc>;
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__chrono/duration.h>
+#include <__chrono/time_point.h>
+#include <__config>
+#include <__memory/allocator_arg_t.h>
+#include <__memory/allocator_destructor.h>
+#include <__memory/uses_allocator.h>
+#include <__type_traits/strip_signature.h>
+#include <__utility/auto_cast.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <exception>
+#include <mutex>
+#include <new>
+#include <system_error>
+#include <thread>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifdef _LIBCPP_HAS_NO_THREADS
+# error "<future> is not supported since libc++ has been configured without support for threads."
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+//enum class future_errc
+_LIBCPP_DECLARE_STRONG_ENUM(future_errc)
+{
+    future_already_retrieved = 1,
+    promise_already_satisfied,
+    no_state,
+    broken_promise
+};
+_LIBCPP_DECLARE_STRONG_ENUM_EPILOG(future_errc)
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS is_error_code_enum<future_errc> : public true_type {};
+
+#ifdef _LIBCPP_CXX03_LANG
+template <>
+struct _LIBCPP_TEMPLATE_VIS is_error_code_enum<future_errc::__lx> : public true_type { };
+#endif
+
+//enum class launch
+_LIBCPP_DECLARE_STRONG_ENUM(launch)
+{
+    async = 1,
+    deferred = 2,
+    any = async | deferred
+};
+_LIBCPP_DECLARE_STRONG_ENUM_EPILOG(launch)
+
+#ifndef _LIBCPP_CXX03_LANG
+
+typedef underlying_type<launch>::type __launch_underlying_type;
+
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+launch
+operator&(launch __x, launch __y)
+{
+    return static_cast<launch>(static_cast<__launch_underlying_type>(__x) &
+                               static_cast<__launch_underlying_type>(__y));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+launch
+operator|(launch __x, launch __y)
+{
+    return static_cast<launch>(static_cast<__launch_underlying_type>(__x) |
+                               static_cast<__launch_underlying_type>(__y));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+launch
+operator^(launch __x, launch __y)
+{
+    return static_cast<launch>(static_cast<__launch_underlying_type>(__x) ^
+                               static_cast<__launch_underlying_type>(__y));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+launch
+operator~(launch __x)
+{
+    return static_cast<launch>(~static_cast<__launch_underlying_type>(__x) & 3);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+launch&
+operator&=(launch& __x, launch __y)
+{
+    __x = __x & __y; return __x;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+launch&
+operator|=(launch& __x, launch __y)
+{
+    __x = __x | __y; return __x;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+launch&
+operator^=(launch& __x, launch __y)
+{
+    __x = __x ^ __y; return __x;
+}
+
+#endif // !_LIBCPP_CXX03_LANG
+
+//enum class future_status
+_LIBCPP_DECLARE_STRONG_ENUM(future_status)
+{
+    ready,
+    timeout,
+    deferred
+};
+_LIBCPP_DECLARE_STRONG_ENUM_EPILOG(future_status)
+
+_LIBCPP_FUNC_VIS
+const error_category& future_category() _NOEXCEPT;
+
+inline _LIBCPP_INLINE_VISIBILITY
+error_code
+make_error_code(future_errc __e) _NOEXCEPT
+{
+    return error_code(static_cast<int>(__e), future_category());
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+error_condition
+make_error_condition(future_errc __e) _NOEXCEPT
+{
+    return error_condition(static_cast<int>(__e), future_category());
+}
+
+class _LIBCPP_EXCEPTION_ABI _LIBCPP_AVAILABILITY_FUTURE_ERROR future_error
+    : public logic_error
+{
+    error_code __ec_;
+public:
+    future_error(error_code __ec);
+
+    _LIBCPP_INLINE_VISIBILITY
+    const error_code& code() const _NOEXCEPT {return __ec_;}
+
+    future_error(const future_error&) _NOEXCEPT = default;
+    ~future_error() _NOEXCEPT override;
+};
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+#ifndef _LIBCPP_NO_EXCEPTIONS
+_LIBCPP_AVAILABILITY_FUTURE_ERROR
+#endif
+void __throw_future_error(future_errc __ev)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw future_error(make_error_code(__ev));
+#else
+    ((void)__ev);
+    _VSTD::abort();
+#endif
+}
+
+class _LIBCPP_TYPE_VIS _LIBCPP_AVAILABILITY_FUTURE __assoc_sub_state
+    : public __shared_count
+{
+protected:
+    exception_ptr __exception_;
+    mutable mutex __mut_;
+    mutable condition_variable __cv_;
+    unsigned __state_;
+
+    void __on_zero_shared() _NOEXCEPT override;
+    void __sub_wait(unique_lock<mutex>& __lk);
+public:
+    enum
+    {
+        __constructed = 1,
+        __future_attached = 2,
+        ready = 4,
+        deferred = 8
+    };
+
+    _LIBCPP_INLINE_VISIBILITY
+    __assoc_sub_state() : __state_(0) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool __has_value() const
+        {return (__state_ & __constructed) || (__exception_ != nullptr);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __attach_future() {
+        lock_guard<mutex> __lk(__mut_);
+        bool __has_future_attached = (__state_ & __future_attached) != 0;
+        if (__has_future_attached)
+            __throw_future_error(future_errc::future_already_retrieved);
+        this->__add_shared();
+        __state_ |= __future_attached;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __set_deferred() {__state_ |= deferred;}
+
+    void __make_ready();
+    _LIBCPP_INLINE_VISIBILITY
+    bool __is_ready() const {return (__state_ & ready) != 0;}
+
+    void set_value();
+    void set_value_at_thread_exit();
+
+    void set_exception(exception_ptr __p);
+    void set_exception_at_thread_exit(exception_ptr __p);
+
+    void copy();
+
+    void wait();
+    template <class _Rep, class _Period>
+        future_status
+        _LIBCPP_INLINE_VISIBILITY
+        wait_for(const chrono::duration<_Rep, _Period>& __rel_time) const;
+    template <class _Clock, class _Duration>
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        future_status
+        wait_until(const chrono::time_point<_Clock, _Duration>& __abs_time) const;
+
+    virtual void __execute();
+};
+
+template <class _Clock, class _Duration>
+future_status
+__assoc_sub_state::wait_until(const chrono::time_point<_Clock, _Duration>& __abs_time) const
+{
+    unique_lock<mutex> __lk(__mut_);
+    if (__state_ & deferred)
+        return future_status::deferred;
+    while (!(__state_ & ready) && _Clock::now() < __abs_time)
+        __cv_.wait_until(__lk, __abs_time);
+    if (__state_ & ready)
+        return future_status::ready;
+    return future_status::timeout;
+}
+
+template <class _Rep, class _Period>
+inline
+future_status
+__assoc_sub_state::wait_for(const chrono::duration<_Rep, _Period>& __rel_time) const
+{
+    return wait_until(chrono::steady_clock::now() + __rel_time);
+}
+
+template <class _Rp>
+class _LIBCPP_AVAILABILITY_FUTURE _LIBCPP_HIDDEN __assoc_state
+    : public __assoc_sub_state
+{
+    typedef __assoc_sub_state base;
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    typedef typename aligned_storage<sizeof(_Rp), alignment_of<_Rp>::value>::type _Up;
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+protected:
+    _Up __value_;
+
+    void __on_zero_shared() _NOEXCEPT override;
+public:
+
+    template <class _Arg>
+    void set_value(_Arg&& __arg);
+
+    template <class _Arg>
+    void set_value_at_thread_exit(_Arg&& __arg);
+
+    _Rp move();
+    __add_lvalue_reference_t<_Rp> copy();
+};
+
+template <class _Rp>
+void
+__assoc_state<_Rp>::__on_zero_shared() _NOEXCEPT
+{
+    if (this->__state_ & base::__constructed)
+        reinterpret_cast<_Rp*>(&__value_)->~_Rp();
+    delete this;
+}
+
+template <class _Rp>
+template <class _Arg>
+_LIBCPP_AVAILABILITY_FUTURE
+void
+__assoc_state<_Rp>::set_value(_Arg&& __arg)
+{
+    unique_lock<mutex> __lk(this->__mut_);
+    if (this->__has_value())
+        __throw_future_error(future_errc::promise_already_satisfied);
+    ::new ((void*)&__value_) _Rp(_VSTD::forward<_Arg>(__arg));
+    this->__state_ |= base::__constructed | base::ready;
+    __cv_.notify_all();
+}
+
+template <class _Rp>
+template <class _Arg>
+void
+__assoc_state<_Rp>::set_value_at_thread_exit(_Arg&& __arg)
+{
+    unique_lock<mutex> __lk(this->__mut_);
+    if (this->__has_value())
+        __throw_future_error(future_errc::promise_already_satisfied);
+    ::new ((void*)&__value_) _Rp(_VSTD::forward<_Arg>(__arg));
+    this->__state_ |= base::__constructed;
+    __thread_local_data()->__make_ready_at_thread_exit(this);
+}
+
+template <class _Rp>
+_Rp
+__assoc_state<_Rp>::move()
+{
+    unique_lock<mutex> __lk(this->__mut_);
+    this->__sub_wait(__lk);
+    if (this->__exception_ != nullptr)
+        std::rethrow_exception(this->__exception_);
+    return _VSTD::move(*reinterpret_cast<_Rp*>(&__value_));
+}
+
+template <class _Rp>
+__add_lvalue_reference_t<_Rp>
+__assoc_state<_Rp>::copy()
+{
+    unique_lock<mutex> __lk(this->__mut_);
+    this->__sub_wait(__lk);
+    if (this->__exception_ != nullptr)
+        std::rethrow_exception(this->__exception_);
+    return *reinterpret_cast<_Rp*>(&__value_);
+}
+
+template <class _Rp>
+class _LIBCPP_AVAILABILITY_FUTURE __assoc_state<_Rp&>
+    : public __assoc_sub_state
+{
+    typedef __assoc_sub_state base;
+    typedef _Rp* _Up;
+protected:
+    _Up __value_;
+
+    void __on_zero_shared() _NOEXCEPT override;
+public:
+
+    void set_value(_Rp& __arg);
+    void set_value_at_thread_exit(_Rp& __arg);
+
+    _Rp& copy();
+};
+
+template <class _Rp>
+void
+__assoc_state<_Rp&>::__on_zero_shared() _NOEXCEPT
+{
+    delete this;
+}
+
+template <class _Rp>
+void
+__assoc_state<_Rp&>::set_value(_Rp& __arg)
+{
+    unique_lock<mutex> __lk(this->__mut_);
+    if (this->__has_value())
+        __throw_future_error(future_errc::promise_already_satisfied);
+    __value_ = _VSTD::addressof(__arg);
+    this->__state_ |= base::__constructed | base::ready;
+    __cv_.notify_all();
+}
+
+template <class _Rp>
+void
+__assoc_state<_Rp&>::set_value_at_thread_exit(_Rp& __arg)
+{
+    unique_lock<mutex> __lk(this->__mut_);
+    if (this->__has_value())
+        __throw_future_error(future_errc::promise_already_satisfied);
+    __value_ = _VSTD::addressof(__arg);
+    this->__state_ |= base::__constructed;
+    __thread_local_data()->__make_ready_at_thread_exit(this);
+}
+
+template <class _Rp>
+_Rp&
+__assoc_state<_Rp&>::copy()
+{
+    unique_lock<mutex> __lk(this->__mut_);
+    this->__sub_wait(__lk);
+    if (this->__exception_ != nullptr)
+        std::rethrow_exception(this->__exception_);
+    return *__value_;
+}
+
+template <class _Rp, class _Alloc>
+class _LIBCPP_AVAILABILITY_FUTURE __assoc_state_alloc
+    : public __assoc_state<_Rp>
+{
+    typedef __assoc_state<_Rp> base;
+    _Alloc __alloc_;
+
+    virtual void __on_zero_shared() _NOEXCEPT;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __assoc_state_alloc(const _Alloc& __a)
+        : __alloc_(__a) {}
+};
+
+template <class _Rp, class _Alloc>
+void
+__assoc_state_alloc<_Rp, _Alloc>::__on_zero_shared() _NOEXCEPT
+{
+    if (this->__state_ & base::__constructed)
+        reinterpret_cast<_Rp*>(_VSTD::addressof(this->__value_))->~_Rp();
+    typedef typename __allocator_traits_rebind<_Alloc, __assoc_state_alloc>::type _Al;
+    typedef allocator_traits<_Al> _ATraits;
+    typedef pointer_traits<typename _ATraits::pointer> _PTraits;
+    _Al __a(__alloc_);
+    this->~__assoc_state_alloc();
+    __a.deallocate(_PTraits::pointer_to(*this), 1);
+}
+
+template <class _Rp, class _Alloc>
+class _LIBCPP_AVAILABILITY_FUTURE __assoc_state_alloc<_Rp&, _Alloc>
+    : public __assoc_state<_Rp&>
+{
+    typedef __assoc_state<_Rp&> base;
+    _Alloc __alloc_;
+
+    virtual void __on_zero_shared() _NOEXCEPT;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __assoc_state_alloc(const _Alloc& __a)
+        : __alloc_(__a) {}
+};
+
+template <class _Rp, class _Alloc>
+void
+__assoc_state_alloc<_Rp&, _Alloc>::__on_zero_shared() _NOEXCEPT
+{
+    typedef typename __allocator_traits_rebind<_Alloc, __assoc_state_alloc>::type _Al;
+    typedef allocator_traits<_Al> _ATraits;
+    typedef pointer_traits<typename _ATraits::pointer> _PTraits;
+    _Al __a(__alloc_);
+    this->~__assoc_state_alloc();
+    __a.deallocate(_PTraits::pointer_to(*this), 1);
+}
+
+template <class _Alloc>
+class _LIBCPP_AVAILABILITY_FUTURE __assoc_sub_state_alloc
+    : public __assoc_sub_state
+{
+    typedef __assoc_sub_state base;
+    _Alloc __alloc_;
+
+    void __on_zero_shared() _NOEXCEPT override;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __assoc_sub_state_alloc(const _Alloc& __a)
+        : __alloc_(__a) {}
+};
+
+template <class _Alloc>
+void
+__assoc_sub_state_alloc<_Alloc>::__on_zero_shared() _NOEXCEPT
+{
+    typedef typename __allocator_traits_rebind<_Alloc, __assoc_sub_state_alloc>::type _Al;
+    typedef allocator_traits<_Al> _ATraits;
+    typedef pointer_traits<typename _ATraits::pointer> _PTraits;
+    _Al __a(__alloc_);
+    this->~__assoc_sub_state_alloc();
+    __a.deallocate(_PTraits::pointer_to(*this), 1);
+}
+
+template <class _Rp, class _Fp>
+class _LIBCPP_AVAILABILITY_FUTURE __deferred_assoc_state
+    : public __assoc_state<_Rp>
+{
+    typedef __assoc_state<_Rp> base;
+
+    _Fp __func_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __deferred_assoc_state(_Fp&& __f);
+
+    virtual void __execute();
+};
+
+template <class _Rp, class _Fp>
+inline
+__deferred_assoc_state<_Rp, _Fp>::__deferred_assoc_state(_Fp&& __f)
+    : __func_(_VSTD::forward<_Fp>(__f))
+{
+    this->__set_deferred();
+}
+
+template <class _Rp, class _Fp>
+void
+__deferred_assoc_state<_Rp, _Fp>::__execute()
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        this->set_value(__func_());
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->set_exception(current_exception());
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+}
+
+template <class _Fp>
+class _LIBCPP_AVAILABILITY_FUTURE __deferred_assoc_state<void, _Fp>
+    : public __assoc_sub_state
+{
+    typedef __assoc_sub_state base;
+
+    _Fp __func_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __deferred_assoc_state(_Fp&& __f);
+
+    void __execute() override;
+};
+
+template <class _Fp>
+inline
+__deferred_assoc_state<void, _Fp>::__deferred_assoc_state(_Fp&& __f)
+    : __func_(_VSTD::forward<_Fp>(__f))
+{
+    this->__set_deferred();
+}
+
+template <class _Fp>
+void
+__deferred_assoc_state<void, _Fp>::__execute()
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __func_();
+        this->set_value();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->set_exception(current_exception());
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+}
+
+template <class _Rp, class _Fp>
+class _LIBCPP_AVAILABILITY_FUTURE __async_assoc_state
+    : public __assoc_state<_Rp>
+{
+    typedef __assoc_state<_Rp> base;
+
+    _Fp __func_;
+
+    virtual void __on_zero_shared() _NOEXCEPT;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __async_assoc_state(_Fp&& __f);
+
+    virtual void __execute();
+};
+
+template <class _Rp, class _Fp>
+inline
+__async_assoc_state<_Rp, _Fp>::__async_assoc_state(_Fp&& __f)
+    : __func_(_VSTD::forward<_Fp>(__f))
+{
+}
+
+template <class _Rp, class _Fp>
+void
+__async_assoc_state<_Rp, _Fp>::__execute()
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        this->set_value(__func_());
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->set_exception(current_exception());
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+}
+
+template <class _Rp, class _Fp>
+void
+__async_assoc_state<_Rp, _Fp>::__on_zero_shared() _NOEXCEPT
+{
+    this->wait();
+    base::__on_zero_shared();
+}
+
+template <class _Fp>
+class _LIBCPP_AVAILABILITY_FUTURE __async_assoc_state<void, _Fp>
+    : public __assoc_sub_state
+{
+    typedef __assoc_sub_state base;
+
+    _Fp __func_;
+
+    void __on_zero_shared() _NOEXCEPT override;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __async_assoc_state(_Fp&& __f);
+
+    void __execute() override;
+};
+
+template <class _Fp>
+inline
+__async_assoc_state<void, _Fp>::__async_assoc_state(_Fp&& __f)
+    : __func_(_VSTD::forward<_Fp>(__f))
+{
+}
+
+template <class _Fp>
+void
+__async_assoc_state<void, _Fp>::__execute()
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __func_();
+        this->set_value();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->set_exception(current_exception());
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+}
+
+template <class _Fp>
+void
+__async_assoc_state<void, _Fp>::__on_zero_shared() _NOEXCEPT
+{
+    this->wait();
+    base::__on_zero_shared();
+}
+
+template <class _Rp> class _LIBCPP_TEMPLATE_VIS promise;
+template <class _Rp> class _LIBCPP_TEMPLATE_VIS shared_future;
+
+// future
+
+template <class _Rp> class _LIBCPP_TEMPLATE_VIS future;
+
+template <class _Rp, class _Fp>
+_LIBCPP_INLINE_VISIBILITY future<_Rp>
+__make_deferred_assoc_state(_Fp&& __f);
+
+template <class _Rp, class _Fp>
+_LIBCPP_INLINE_VISIBILITY future<_Rp>
+__make_async_assoc_state(_Fp&& __f);
+
+template <class _Rp>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FUTURE future
+{
+    __assoc_state<_Rp>* __state_;
+
+    explicit future(__assoc_state<_Rp>* __state);
+
+    template <class> friend class promise;
+    template <class> friend class shared_future;
+
+    template <class _R1, class _Fp>
+        friend future<_R1> __make_deferred_assoc_state(_Fp&& __f);
+    template <class _R1, class _Fp>
+        friend future<_R1> __make_async_assoc_state(_Fp&& __f);
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    future() _NOEXCEPT : __state_(nullptr) {}
+    _LIBCPP_INLINE_VISIBILITY
+    future(future&& __rhs) _NOEXCEPT
+        : __state_(__rhs.__state_) {__rhs.__state_ = nullptr;}
+    future(const future&) = delete;
+    future& operator=(const future&) = delete;
+    _LIBCPP_INLINE_VISIBILITY
+    future& operator=(future&& __rhs) _NOEXCEPT
+        {
+            future(_VSTD::move(__rhs)).swap(*this);
+            return *this;
+        }
+
+    ~future();
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future<_Rp> share() _NOEXCEPT;
+
+    // retrieving the value
+    _Rp get();
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(future& __rhs) _NOEXCEPT {_VSTD::swap(__state_, __rhs.__state_);}
+
+    // functions to check state
+    _LIBCPP_INLINE_VISIBILITY
+    bool valid() const _NOEXCEPT {return __state_ != nullptr;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void wait() const {__state_->wait();}
+    template <class _Rep, class _Period>
+        _LIBCPP_INLINE_VISIBILITY
+        future_status
+        wait_for(const chrono::duration<_Rep, _Period>& __rel_time) const
+            {return __state_->wait_for(__rel_time);}
+    template <class _Clock, class _Duration>
+        _LIBCPP_INLINE_VISIBILITY
+        future_status
+        wait_until(const chrono::time_point<_Clock, _Duration>& __abs_time) const
+            {return __state_->wait_until(__abs_time);}
+};
+
+template <class _Rp>
+future<_Rp>::future(__assoc_state<_Rp>* __state)
+    : __state_(__state)
+{
+    __state_->__attach_future();
+}
+
+struct __release_shared_count
+{
+    void operator()(__shared_count* __p) {__p->__release_shared();}
+};
+
+template <class _Rp>
+future<_Rp>::~future()
+{
+    if (__state_)
+        __state_->__release_shared();
+}
+
+template <class _Rp>
+_Rp
+future<_Rp>::get()
+{
+    unique_ptr<__shared_count, __release_shared_count> __(__state_);
+    __assoc_state<_Rp>* __s = __state_;
+    __state_ = nullptr;
+    return __s->move();
+}
+
+template <class _Rp>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FUTURE future<_Rp&>
+{
+    __assoc_state<_Rp&>* __state_;
+
+    explicit future(__assoc_state<_Rp&>* __state);
+
+    template <class> friend class promise;
+    template <class> friend class shared_future;
+
+    template <class _R1, class _Fp>
+        friend future<_R1> __make_deferred_assoc_state(_Fp&& __f);
+    template <class _R1, class _Fp>
+        friend future<_R1> __make_async_assoc_state(_Fp&& __f);
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    future() _NOEXCEPT : __state_(nullptr) {}
+    _LIBCPP_INLINE_VISIBILITY
+    future(future&& __rhs) _NOEXCEPT
+        : __state_(__rhs.__state_) {__rhs.__state_ = nullptr;}
+    future(const future&) = delete;
+    future& operator=(const future&) = delete;
+    _LIBCPP_INLINE_VISIBILITY
+    future& operator=(future&& __rhs) _NOEXCEPT
+        {
+            future(_VSTD::move(__rhs)).swap(*this);
+            return *this;
+        }
+
+    ~future();
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future<_Rp&> share() _NOEXCEPT;
+
+    // retrieving the value
+    _Rp& get();
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(future& __rhs) _NOEXCEPT {_VSTD::swap(__state_, __rhs.__state_);}
+
+    // functions to check state
+    _LIBCPP_INLINE_VISIBILITY
+    bool valid() const _NOEXCEPT {return __state_ != nullptr;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void wait() const {__state_->wait();}
+    template <class _Rep, class _Period>
+        _LIBCPP_INLINE_VISIBILITY
+        future_status
+        wait_for(const chrono::duration<_Rep, _Period>& __rel_time) const
+            {return __state_->wait_for(__rel_time);}
+    template <class _Clock, class _Duration>
+        _LIBCPP_INLINE_VISIBILITY
+        future_status
+        wait_until(const chrono::time_point<_Clock, _Duration>& __abs_time) const
+            {return __state_->wait_until(__abs_time);}
+};
+
+template <class _Rp>
+future<_Rp&>::future(__assoc_state<_Rp&>* __state)
+    : __state_(__state)
+{
+    __state_->__attach_future();
+}
+
+template <class _Rp>
+future<_Rp&>::~future()
+{
+    if (__state_)
+        __state_->__release_shared();
+}
+
+template <class _Rp>
+_Rp&
+future<_Rp&>::get()
+{
+    unique_ptr<__shared_count, __release_shared_count> __(__state_);
+    __assoc_state<_Rp&>* __s = __state_;
+    __state_ = nullptr;
+    return __s->copy();
+}
+
+template <>
+class _LIBCPP_TYPE_VIS _LIBCPP_AVAILABILITY_FUTURE future<void>
+{
+    __assoc_sub_state* __state_;
+
+    explicit future(__assoc_sub_state* __state);
+
+    template <class> friend class promise;
+    template <class> friend class shared_future;
+
+    template <class _R1, class _Fp>
+        friend future<_R1> __make_deferred_assoc_state(_Fp&& __f);
+    template <class _R1, class _Fp>
+        friend future<_R1> __make_async_assoc_state(_Fp&& __f);
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    future() _NOEXCEPT : __state_(nullptr) {}
+    _LIBCPP_INLINE_VISIBILITY
+    future(future&& __rhs) _NOEXCEPT
+        : __state_(__rhs.__state_) {__rhs.__state_ = nullptr;}
+    future(const future&) = delete;
+    future& operator=(const future&) = delete;
+    _LIBCPP_INLINE_VISIBILITY
+    future& operator=(future&& __rhs) _NOEXCEPT
+        {
+            future(_VSTD::move(__rhs)).swap(*this);
+            return *this;
+        }
+
+    ~future();
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future<void> share() _NOEXCEPT;
+
+    // retrieving the value
+    void get();
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(future& __rhs) _NOEXCEPT {_VSTD::swap(__state_, __rhs.__state_);}
+
+    // functions to check state
+    _LIBCPP_INLINE_VISIBILITY
+    bool valid() const _NOEXCEPT {return __state_ != nullptr;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void wait() const {__state_->wait();}
+    template <class _Rep, class _Period>
+        _LIBCPP_INLINE_VISIBILITY
+        future_status
+        wait_for(const chrono::duration<_Rep, _Period>& __rel_time) const
+            {return __state_->wait_for(__rel_time);}
+    template <class _Clock, class _Duration>
+        _LIBCPP_INLINE_VISIBILITY
+        future_status
+        wait_until(const chrono::time_point<_Clock, _Duration>& __abs_time) const
+            {return __state_->wait_until(__abs_time);}
+};
+
+template <class _Rp>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(future<_Rp>& __x, future<_Rp>& __y) _NOEXCEPT
+{
+    __x.swap(__y);
+}
+
+// promise<R>
+
+template <class _Callable> class packaged_task;
+
+template <class _Rp>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FUTURE promise
+{
+    __assoc_state<_Rp>* __state_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit promise(nullptr_t) _NOEXCEPT : __state_(nullptr) {}
+
+    template <class> friend class packaged_task;
+public:
+    promise();
+    template <class _Alloc>
+        promise(allocator_arg_t, const _Alloc& __a);
+    _LIBCPP_INLINE_VISIBILITY
+    promise(promise&& __rhs) _NOEXCEPT
+        : __state_(__rhs.__state_) {__rhs.__state_ = nullptr;}
+    promise(const promise& __rhs) = delete;
+    ~promise();
+
+    // assignment
+    _LIBCPP_INLINE_VISIBILITY
+    promise& operator=(promise&& __rhs) _NOEXCEPT
+        {
+            promise(_VSTD::move(__rhs)).swap(*this);
+            return *this;
+        }
+    promise& operator=(const promise& __rhs) = delete;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(promise& __rhs) _NOEXCEPT {_VSTD::swap(__state_, __rhs.__state_);}
+
+    // retrieving the result
+    future<_Rp> get_future();
+
+    // setting the result
+    void set_value(const _Rp& __r);
+    void set_value(_Rp&& __r);
+    void set_exception(exception_ptr __p);
+
+    // setting the result with deferred notification
+    void set_value_at_thread_exit(const _Rp& __r);
+    void set_value_at_thread_exit(_Rp&& __r);
+    void set_exception_at_thread_exit(exception_ptr __p);
+};
+
+template <class _Rp>
+promise<_Rp>::promise()
+    : __state_(new __assoc_state<_Rp>)
+{
+}
+
+template <class _Rp>
+template <class _Alloc>
+promise<_Rp>::promise(allocator_arg_t, const _Alloc& __a0)
+{
+    typedef __assoc_state_alloc<_Rp, _Alloc> _State;
+    typedef typename __allocator_traits_rebind<_Alloc, _State>::type _A2;
+    typedef __allocator_destructor<_A2> _D2;
+    _A2 __a(__a0);
+    unique_ptr<_State, _D2> __hold(__a.allocate(1), _D2(__a, 1));
+    ::new ((void*)_VSTD::addressof(*__hold.get())) _State(__a0);
+    __state_ = _VSTD::addressof(*__hold.release());
+}
+
+template <class _Rp>
+promise<_Rp>::~promise()
+{
+    if (__state_)
+    {
+        if (!__state_->__has_value() && __state_->use_count() > 1)
+            __state_->set_exception(make_exception_ptr(
+                      future_error(make_error_code(future_errc::broken_promise))
+                                                      ));
+        __state_->__release_shared();
+    }
+}
+
+template <class _Rp>
+future<_Rp>
+promise<_Rp>::get_future()
+{
+    if (__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    return future<_Rp>(__state_);
+}
+
+template <class _Rp>
+void
+promise<_Rp>::set_value(const _Rp& __r)
+{
+    if (__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    __state_->set_value(__r);
+}
+
+template <class _Rp>
+void
+promise<_Rp>::set_value(_Rp&& __r)
+{
+    if (__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    __state_->set_value(_VSTD::move(__r));
+}
+
+template <class _Rp>
+void
+promise<_Rp>::set_exception(exception_ptr __p)
+{
+    _LIBCPP_ASSERT( __p != nullptr, "promise::set_exception: received nullptr" );
+    if (__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    __state_->set_exception(__p);
+}
+
+template <class _Rp>
+void
+promise<_Rp>::set_value_at_thread_exit(const _Rp& __r)
+{
+    if (__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    __state_->set_value_at_thread_exit(__r);
+}
+
+template <class _Rp>
+void
+promise<_Rp>::set_value_at_thread_exit(_Rp&& __r)
+{
+    if (__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    __state_->set_value_at_thread_exit(_VSTD::move(__r));
+}
+
+template <class _Rp>
+void
+promise<_Rp>::set_exception_at_thread_exit(exception_ptr __p)
+{
+    _LIBCPP_ASSERT( __p != nullptr, "promise::set_exception_at_thread_exit: received nullptr" );
+    if (__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    __state_->set_exception_at_thread_exit(__p);
+}
+
+// promise<R&>
+
+template <class _Rp>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FUTURE promise<_Rp&>
+{
+    __assoc_state<_Rp&>* __state_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit promise(nullptr_t) _NOEXCEPT : __state_(nullptr) {}
+
+    template <class> friend class packaged_task;
+
+public:
+    promise();
+    template <class _Allocator>
+        promise(allocator_arg_t, const _Allocator& __a);
+    _LIBCPP_INLINE_VISIBILITY
+    promise(promise&& __rhs) _NOEXCEPT
+        : __state_(__rhs.__state_) {__rhs.__state_ = nullptr;}
+    promise(const promise& __rhs) = delete;
+    ~promise();
+
+    // assignment
+    _LIBCPP_INLINE_VISIBILITY
+    promise& operator=(promise&& __rhs) _NOEXCEPT
+        {
+            promise(_VSTD::move(__rhs)).swap(*this);
+            return *this;
+        }
+    promise& operator=(const promise& __rhs) = delete;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(promise& __rhs) _NOEXCEPT {_VSTD::swap(__state_, __rhs.__state_);}
+
+    // retrieving the result
+    future<_Rp&> get_future();
+
+    // setting the result
+    void set_value(_Rp& __r);
+    void set_exception(exception_ptr __p);
+
+    // setting the result with deferred notification
+    void set_value_at_thread_exit(_Rp&);
+    void set_exception_at_thread_exit(exception_ptr __p);
+};
+
+template <class _Rp>
+promise<_Rp&>::promise()
+    : __state_(new __assoc_state<_Rp&>)
+{
+}
+
+template <class _Rp>
+template <class _Alloc>
+promise<_Rp&>::promise(allocator_arg_t, const _Alloc& __a0)
+{
+    typedef __assoc_state_alloc<_Rp&, _Alloc> _State;
+    typedef typename __allocator_traits_rebind<_Alloc, _State>::type _A2;
+    typedef __allocator_destructor<_A2> _D2;
+    _A2 __a(__a0);
+    unique_ptr<_State, _D2> __hold(__a.allocate(1), _D2(__a, 1));
+    ::new ((void*)_VSTD::addressof(*__hold.get())) _State(__a0);
+    __state_ = _VSTD::addressof(*__hold.release());
+}
+
+template <class _Rp>
+promise<_Rp&>::~promise()
+{
+    if (__state_)
+    {
+        if (!__state_->__has_value() && __state_->use_count() > 1)
+            __state_->set_exception(make_exception_ptr(
+                      future_error(make_error_code(future_errc::broken_promise))
+                                                      ));
+        __state_->__release_shared();
+    }
+}
+
+template <class _Rp>
+future<_Rp&>
+promise<_Rp&>::get_future()
+{
+    if (__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    return future<_Rp&>(__state_);
+}
+
+template <class _Rp>
+void
+promise<_Rp&>::set_value(_Rp& __r)
+{
+    if (__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    __state_->set_value(__r);
+}
+
+template <class _Rp>
+void
+promise<_Rp&>::set_exception(exception_ptr __p)
+{
+    _LIBCPP_ASSERT( __p != nullptr, "promise::set_exception: received nullptr" );
+    if (__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    __state_->set_exception(__p);
+}
+
+template <class _Rp>
+void
+promise<_Rp&>::set_value_at_thread_exit(_Rp& __r)
+{
+    if (__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    __state_->set_value_at_thread_exit(__r);
+}
+
+template <class _Rp>
+void
+promise<_Rp&>::set_exception_at_thread_exit(exception_ptr __p)
+{
+    _LIBCPP_ASSERT( __p != nullptr, "promise::set_exception_at_thread_exit: received nullptr" );
+    if (__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    __state_->set_exception_at_thread_exit(__p);
+}
+
+// promise<void>
+
+template <>
+class _LIBCPP_TYPE_VIS _LIBCPP_AVAILABILITY_FUTURE promise<void>
+{
+    __assoc_sub_state* __state_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit promise(nullptr_t) _NOEXCEPT : __state_(nullptr) {}
+
+    template <class> friend class packaged_task;
+
+public:
+    promise();
+    template <class _Allocator>
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        promise(allocator_arg_t, const _Allocator& __a);
+    _LIBCPP_INLINE_VISIBILITY
+    promise(promise&& __rhs) _NOEXCEPT
+        : __state_(__rhs.__state_) {__rhs.__state_ = nullptr;}
+    promise(const promise& __rhs) = delete;
+    ~promise();
+
+    // assignment
+    _LIBCPP_INLINE_VISIBILITY
+    promise& operator=(promise&& __rhs) _NOEXCEPT
+        {
+            promise(_VSTD::move(__rhs)).swap(*this);
+            return *this;
+        }
+    promise& operator=(const promise& __rhs) = delete;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(promise& __rhs) _NOEXCEPT {_VSTD::swap(__state_, __rhs.__state_);}
+
+    // retrieving the result
+    future<void> get_future();
+
+    // setting the result
+    void set_value();
+    void set_exception(exception_ptr __p);
+
+    // setting the result with deferred notification
+    void set_value_at_thread_exit();
+    void set_exception_at_thread_exit(exception_ptr __p);
+};
+
+template <class _Alloc>
+promise<void>::promise(allocator_arg_t, const _Alloc& __a0)
+{
+    typedef __assoc_sub_state_alloc<_Alloc> _State;
+    typedef typename __allocator_traits_rebind<_Alloc, _State>::type _A2;
+    typedef __allocator_destructor<_A2> _D2;
+    _A2 __a(__a0);
+    unique_ptr<_State, _D2> __hold(__a.allocate(1), _D2(__a, 1));
+    ::new ((void*)_VSTD::addressof(*__hold.get())) _State(__a0);
+    __state_ = _VSTD::addressof(*__hold.release());
+}
+
+template <class _Rp>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(promise<_Rp>& __x, promise<_Rp>& __y) _NOEXCEPT
+{
+    __x.swap(__y);
+}
+
+template <class _Rp, class _Alloc>
+    struct _LIBCPP_TEMPLATE_VIS uses_allocator<promise<_Rp>, _Alloc>
+        : public true_type {};
+
+// packaged_task
+
+template<class _Fp> class __packaged_task_base;
+
+template<class _Rp, class ..._ArgTypes>
+class _LIBCPP_AVAILABILITY_FUTURE __packaged_task_base<_Rp(_ArgTypes...)>
+{
+    __packaged_task_base(const __packaged_task_base&);
+    __packaged_task_base& operator=(const __packaged_task_base&);
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __packaged_task_base() {}
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL
+    virtual ~__packaged_task_base() {}
+    virtual void __move_to(__packaged_task_base*) _NOEXCEPT = 0;
+    virtual void destroy() = 0;
+    virtual void destroy_deallocate() = 0;
+    virtual _Rp operator()(_ArgTypes&& ...) = 0;
+};
+
+template<class _FD, class _Alloc, class _FB> class __packaged_task_func;
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+class _LIBCPP_AVAILABILITY_FUTURE __packaged_task_func<_Fp, _Alloc, _Rp(_ArgTypes...)>
+    : public  __packaged_task_base<_Rp(_ArgTypes...)>
+{
+    __compressed_pair<_Fp, _Alloc> __f_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __packaged_task_func(const _Fp& __f) : __f_(__f, __default_init_tag()) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __packaged_task_func(_Fp&& __f) : __f_(_VSTD::move(__f), __default_init_tag()) {}
+    _LIBCPP_INLINE_VISIBILITY
+    __packaged_task_func(const _Fp& __f, const _Alloc& __a)
+        : __f_(__f, __a) {}
+    _LIBCPP_INLINE_VISIBILITY
+    __packaged_task_func(_Fp&& __f, const _Alloc& __a)
+        : __f_(_VSTD::move(__f), __a) {}
+    virtual void __move_to(__packaged_task_base<_Rp(_ArgTypes...)>*) _NOEXCEPT;
+    virtual void destroy();
+    virtual void destroy_deallocate();
+    virtual _Rp operator()(_ArgTypes&& ... __args);
+};
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+void
+__packaged_task_func<_Fp, _Alloc, _Rp(_ArgTypes...)>::__move_to(
+                              __packaged_task_base<_Rp(_ArgTypes...)>* __p) _NOEXCEPT
+{
+    ::new ((void*)__p) __packaged_task_func(_VSTD::move(__f_.first()), _VSTD::move(__f_.second()));
+}
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+void
+__packaged_task_func<_Fp, _Alloc, _Rp(_ArgTypes...)>::destroy()
+{
+    __f_.~__compressed_pair<_Fp, _Alloc>();
+}
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+void
+__packaged_task_func<_Fp, _Alloc, _Rp(_ArgTypes...)>::destroy_deallocate()
+{
+    typedef typename __allocator_traits_rebind<_Alloc, __packaged_task_func>::type _Ap;
+    typedef allocator_traits<_Ap> _ATraits;
+    typedef pointer_traits<typename _ATraits::pointer> _PTraits;
+    _Ap __a(__f_.second());
+    __f_.~__compressed_pair<_Fp, _Alloc>();
+    __a.deallocate(_PTraits::pointer_to(*this), 1);
+}
+
+template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes>
+_Rp
+__packaged_task_func<_Fp, _Alloc, _Rp(_ArgTypes...)>::operator()(_ArgTypes&& ... __arg)
+{
+    return _VSTD::__invoke(__f_.first(), _VSTD::forward<_ArgTypes>(__arg)...);
+}
+
+template <class _Callable> class __packaged_task_function;
+
+template<class _Rp, class ..._ArgTypes>
+class _LIBCPP_AVAILABILITY_FUTURE __packaged_task_function<_Rp(_ArgTypes...)>
+{
+    typedef __packaged_task_base<_Rp(_ArgTypes...)> __base;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_NO_CFI
+    __base* __get_buf() { return (__base*)&__buf_; }
+
+    _LIBCPP_SUPPRESS_DEPRECATED_PUSH
+    typename aligned_storage<3*sizeof(void*)>::type __buf_;
+    _LIBCPP_SUPPRESS_DEPRECATED_POP
+    __base* __f_;
+
+public:
+    typedef _Rp result_type;
+
+    // construct/copy/destroy:
+    _LIBCPP_INLINE_VISIBILITY
+    __packaged_task_function() _NOEXCEPT : __f_(nullptr) {}
+    template<class _Fp>
+      __packaged_task_function(_Fp&& __f);
+    template<class _Fp, class _Alloc>
+      __packaged_task_function(allocator_arg_t, const _Alloc& __a, _Fp&& __f);
+
+    __packaged_task_function(__packaged_task_function&&) _NOEXCEPT;
+    __packaged_task_function& operator=(__packaged_task_function&&) _NOEXCEPT;
+
+    __packaged_task_function(const __packaged_task_function&) =  delete;
+    __packaged_task_function& operator=(const __packaged_task_function&) =  delete;
+
+    ~__packaged_task_function();
+
+    void swap(__packaged_task_function&) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Rp operator()(_ArgTypes...) const;
+};
+
+template<class _Rp, class ..._ArgTypes>
+__packaged_task_function<_Rp(_ArgTypes...)>::__packaged_task_function(__packaged_task_function&& __f) _NOEXCEPT
+{
+    if (__f.__f_ == nullptr)
+        __f_ = nullptr;
+    else if (__f.__f_ == __f.__get_buf())
+    {
+        __f.__f_->__move_to(__get_buf());
+        __f_ = (__base*)&__buf_;
+    }
+    else
+    {
+        __f_ = __f.__f_;
+        __f.__f_ = nullptr;
+    }
+}
+
+template<class _Rp, class ..._ArgTypes>
+template <class _Fp>
+__packaged_task_function<_Rp(_ArgTypes...)>::__packaged_task_function(_Fp&& __f)
+    : __f_(nullptr)
+{
+    typedef __libcpp_remove_reference_t<typename decay<_Fp>::type> _FR;
+    typedef __packaged_task_func<_FR, allocator<_FR>, _Rp(_ArgTypes...)> _FF;
+    if (sizeof(_FF) <= sizeof(__buf_))
+    {
+        ::new ((void*)&__buf_) _FF(_VSTD::forward<_Fp>(__f));
+        __f_ = (__base*)&__buf_;
+    }
+    else
+    {
+        typedef allocator<_FF> _Ap;
+        _Ap __a;
+        typedef __allocator_destructor<_Ap> _Dp;
+        unique_ptr<__base, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
+        ::new ((void*)__hold.get()) _FF(_VSTD::forward<_Fp>(__f), allocator<_FR>(__a));
+        __f_ = __hold.release();
+    }
+}
+
+template<class _Rp, class ..._ArgTypes>
+template <class _Fp, class _Alloc>
+__packaged_task_function<_Rp(_ArgTypes...)>::__packaged_task_function(
+                                  allocator_arg_t, const _Alloc& __a0, _Fp&& __f)
+    : __f_(nullptr)
+{
+    typedef __libcpp_remove_reference_t<typename decay<_Fp>::type> _FR;
+    typedef __packaged_task_func<_FR, _Alloc, _Rp(_ArgTypes...)> _FF;
+    if (sizeof(_FF) <= sizeof(__buf_))
+    {
+        __f_ = (__base*)&__buf_;
+        ::new ((void*)__f_) _FF(_VSTD::forward<_Fp>(__f));
+    }
+    else
+    {
+        typedef typename __allocator_traits_rebind<_Alloc, _FF>::type _Ap;
+        _Ap __a(__a0);
+        typedef __allocator_destructor<_Ap> _Dp;
+        unique_ptr<__base, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
+        ::new ((void*)_VSTD::addressof(*__hold.get()))
+            _FF(_VSTD::forward<_Fp>(__f), _Alloc(__a));
+        __f_ = _VSTD::addressof(*__hold.release());
+    }
+}
+
+template<class _Rp, class ..._ArgTypes>
+__packaged_task_function<_Rp(_ArgTypes...)>&
+__packaged_task_function<_Rp(_ArgTypes...)>::operator=(__packaged_task_function&& __f) _NOEXCEPT
+{
+    if (__f_ == __get_buf())
+        __f_->destroy();
+    else if (__f_)
+        __f_->destroy_deallocate();
+    __f_ = nullptr;
+    if (__f.__f_ == nullptr)
+        __f_ = nullptr;
+    else if (__f.__f_ == __f.__get_buf())
+    {
+        __f.__f_->__move_to(__get_buf());
+        __f_ = __get_buf();
+    }
+    else
+    {
+        __f_ = __f.__f_;
+        __f.__f_ = nullptr;
+    }
+    return *this;
+}
+
+template<class _Rp, class ..._ArgTypes>
+__packaged_task_function<_Rp(_ArgTypes...)>::~__packaged_task_function()
+{
+    if (__f_ == __get_buf())
+        __f_->destroy();
+    else if (__f_)
+        __f_->destroy_deallocate();
+}
+
+template<class _Rp, class ..._ArgTypes>
+_LIBCPP_NO_CFI
+void
+__packaged_task_function<_Rp(_ArgTypes...)>::swap(__packaged_task_function& __f) _NOEXCEPT
+{
+    if (__f_ == (__base*)&__buf_ && __f.__f_ == (__base*)&__f.__buf_)
+    {
+        _LIBCPP_SUPPRESS_DEPRECATED_PUSH
+        typename aligned_storage<sizeof(__buf_)>::type __tempbuf;
+        _LIBCPP_SUPPRESS_DEPRECATED_POP
+        __base* __t = (__base*)&__tempbuf;
+        __f_->__move_to(__t);
+        __f_->destroy();
+        __f_ = nullptr;
+        __f.__f_->__move_to((__base*)&__buf_);
+        __f.__f_->destroy();
+        __f.__f_ = nullptr;
+        __f_ = (__base*)&__buf_;
+        __t->__move_to((__base*)&__f.__buf_);
+        __t->destroy();
+        __f.__f_ = (__base*)&__f.__buf_;
+    }
+    else if (__f_ == (__base*)&__buf_)
+    {
+        __f_->__move_to((__base*)&__f.__buf_);
+        __f_->destroy();
+        __f_ = __f.__f_;
+        __f.__f_ = (__base*)&__f.__buf_;
+    }
+    else if (__f.__f_ == (__base*)&__f.__buf_)
+    {
+        __f.__f_->__move_to((__base*)&__buf_);
+        __f.__f_->destroy();
+        __f.__f_ = __f_;
+        __f_ = (__base*)&__buf_;
+    }
+    else
+        _VSTD::swap(__f_, __f.__f_);
+}
+
+template<class _Rp, class ..._ArgTypes>
+inline
+_Rp
+__packaged_task_function<_Rp(_ArgTypes...)>::operator()(_ArgTypes... __arg) const
+{
+    return (*__f_)(_VSTD::forward<_ArgTypes>(__arg)...);
+}
+
+template<class _Rp, class ..._ArgTypes>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FUTURE packaged_task<_Rp(_ArgTypes...)>
+{
+public:
+    typedef _Rp result_type; // extension
+
+private:
+    __packaged_task_function<result_type(_ArgTypes...)> __f_;
+    promise<result_type>                                __p_;
+
+public:
+    // construction and destruction
+    _LIBCPP_INLINE_VISIBILITY
+    packaged_task() _NOEXCEPT : __p_(nullptr) {}
+    template <class _Fp,
+              class = __enable_if_t<!is_same<__remove_cvref_t<_Fp>, packaged_task>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        explicit packaged_task(_Fp&& __f) : __f_(_VSTD::forward<_Fp>(__f)) {}
+    template <class _Fp, class _Allocator,
+              class = __enable_if_t<!is_same<__remove_cvref_t<_Fp>, packaged_task>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        packaged_task(allocator_arg_t, const _Allocator& __a, _Fp&& __f)
+             : __f_(allocator_arg, __a, _VSTD::forward<_Fp>(__f)),
+               __p_(allocator_arg, __a) {}
+    // ~packaged_task() = default;
+
+    // no copy
+    packaged_task(const packaged_task&) = delete;
+    packaged_task& operator=(const packaged_task&) = delete;
+
+    // move support
+    _LIBCPP_INLINE_VISIBILITY
+    packaged_task(packaged_task&& __other) _NOEXCEPT
+        : __f_(_VSTD::move(__other.__f_)), __p_(_VSTD::move(__other.__p_)) {}
+    _LIBCPP_INLINE_VISIBILITY
+    packaged_task& operator=(packaged_task&& __other) _NOEXCEPT
+    {
+        __f_ = _VSTD::move(__other.__f_);
+        __p_ = _VSTD::move(__other.__p_);
+        return *this;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(packaged_task& __other) _NOEXCEPT
+    {
+        __f_.swap(__other.__f_);
+        __p_.swap(__other.__p_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool valid() const _NOEXCEPT {return __p_.__state_ != nullptr;}
+
+    // result retrieval
+    _LIBCPP_INLINE_VISIBILITY
+    future<result_type> get_future() {return __p_.get_future();}
+
+    // execution
+    void operator()(_ArgTypes... __args);
+    void make_ready_at_thread_exit(_ArgTypes... __args);
+
+    void reset();
+};
+
+template<class _Rp, class ..._ArgTypes>
+void
+packaged_task<_Rp(_ArgTypes...)>::operator()(_ArgTypes... __args)
+{
+    if (__p_.__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    if (__p_.__state_->__has_value())
+        __throw_future_error(future_errc::promise_already_satisfied);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __p_.set_value(__f_(_VSTD::forward<_ArgTypes>(__args)...));
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        __p_.set_exception(current_exception());
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+}
+
+template<class _Rp, class ..._ArgTypes>
+void
+packaged_task<_Rp(_ArgTypes...)>::make_ready_at_thread_exit(_ArgTypes... __args)
+{
+    if (__p_.__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    if (__p_.__state_->__has_value())
+        __throw_future_error(future_errc::promise_already_satisfied);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __p_.set_value_at_thread_exit(__f_(_VSTD::forward<_ArgTypes>(__args)...));
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        __p_.set_exception_at_thread_exit(current_exception());
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+}
+
+template<class _Rp, class ..._ArgTypes>
+void
+packaged_task<_Rp(_ArgTypes...)>::reset()
+{
+    if (!valid())
+        __throw_future_error(future_errc::no_state);
+    __p_ = promise<result_type>();
+}
+
+template<class ..._ArgTypes>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FUTURE packaged_task<void(_ArgTypes...)>
+{
+public:
+    typedef void result_type; // extension
+
+private:
+    __packaged_task_function<result_type(_ArgTypes...)> __f_;
+    promise<result_type>                                __p_;
+
+public:
+    // construction and destruction
+    _LIBCPP_INLINE_VISIBILITY
+    packaged_task() _NOEXCEPT : __p_(nullptr) {}
+    template <class _Fp,
+              class = __enable_if_t<!is_same<__remove_cvref_t<_Fp>, packaged_task>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        explicit packaged_task(_Fp&& __f) : __f_(_VSTD::forward<_Fp>(__f)) {}
+    template <class _Fp, class _Allocator,
+              class = __enable_if_t<!is_same<__remove_cvref_t<_Fp>, packaged_task>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        packaged_task(allocator_arg_t, const _Allocator& __a, _Fp&& __f)
+             : __f_(allocator_arg, __a, _VSTD::forward<_Fp>(__f)),
+               __p_(allocator_arg, __a) {}
+    // ~packaged_task() = default;
+
+    // no copy
+    packaged_task(const packaged_task&) = delete;
+    packaged_task& operator=(const packaged_task&) = delete;
+
+    // move support
+    _LIBCPP_INLINE_VISIBILITY
+    packaged_task(packaged_task&& __other) _NOEXCEPT
+        : __f_(_VSTD::move(__other.__f_)), __p_(_VSTD::move(__other.__p_)) {}
+    _LIBCPP_INLINE_VISIBILITY
+    packaged_task& operator=(packaged_task&& __other) _NOEXCEPT
+    {
+        __f_ = _VSTD::move(__other.__f_);
+        __p_ = _VSTD::move(__other.__p_);
+        return *this;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(packaged_task& __other) _NOEXCEPT
+    {
+        __f_.swap(__other.__f_);
+        __p_.swap(__other.__p_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool valid() const _NOEXCEPT {return __p_.__state_ != nullptr;}
+
+    // result retrieval
+    _LIBCPP_INLINE_VISIBILITY
+    future<result_type> get_future() {return __p_.get_future();}
+
+    // execution
+    void operator()(_ArgTypes... __args);
+    void make_ready_at_thread_exit(_ArgTypes... __args);
+
+    void reset();
+};
+
+#if _LIBCPP_STD_VER >= 17
+
+template <class _Rp, class... _Args>
+packaged_task(_Rp(*)(_Args...)) -> packaged_task<_Rp(_Args...)>;
+
+template <class _Fp, class _Stripped = typename __strip_signature<decltype(&_Fp::operator())>::type>
+packaged_task(_Fp) -> packaged_task<_Stripped>;
+
+#endif
+
+template<class ..._ArgTypes>
+void
+packaged_task<void(_ArgTypes...)>::operator()(_ArgTypes... __args)
+{
+    if (__p_.__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    if (__p_.__state_->__has_value())
+        __throw_future_error(future_errc::promise_already_satisfied);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __f_(_VSTD::forward<_ArgTypes>(__args)...);
+        __p_.set_value();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        __p_.set_exception(current_exception());
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+}
+
+template<class ..._ArgTypes>
+void
+packaged_task<void(_ArgTypes...)>::make_ready_at_thread_exit(_ArgTypes... __args)
+{
+    if (__p_.__state_ == nullptr)
+        __throw_future_error(future_errc::no_state);
+    if (__p_.__state_->__has_value())
+        __throw_future_error(future_errc::promise_already_satisfied);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __f_(_VSTD::forward<_ArgTypes>(__args)...);
+        __p_.set_value_at_thread_exit();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        __p_.set_exception_at_thread_exit(current_exception());
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+}
+
+template<class ..._ArgTypes>
+void
+packaged_task<void(_ArgTypes...)>::reset()
+{
+    if (!valid())
+        __throw_future_error(future_errc::no_state);
+    __p_ = promise<result_type>();
+}
+
+template <class _Rp, class... _ArgTypes>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(packaged_task<_Rp(_ArgTypes...)>& __x, packaged_task<_Rp(_ArgTypes...)>& __y) _NOEXCEPT
+{
+    __x.swap(__y);
+}
+
+template <class _Callable, class _Alloc>
+struct _LIBCPP_TEMPLATE_VIS uses_allocator<packaged_task<_Callable>, _Alloc>
+    : public true_type {};
+
+template <class _Rp, class _Fp>
+_LIBCPP_INLINE_VISIBILITY future<_Rp>
+__make_deferred_assoc_state(_Fp&& __f)
+{
+    unique_ptr<__deferred_assoc_state<_Rp, _Fp>, __release_shared_count>
+        __h(new __deferred_assoc_state<_Rp, _Fp>(_VSTD::forward<_Fp>(__f)));
+    return future<_Rp>(__h.get());
+}
+
+template <class _Rp, class _Fp>
+_LIBCPP_INLINE_VISIBILITY future<_Rp>
+__make_async_assoc_state(_Fp&& __f)
+{
+    unique_ptr<__async_assoc_state<_Rp, _Fp>, __release_shared_count>
+        __h(new __async_assoc_state<_Rp, _Fp>(_VSTD::forward<_Fp>(__f)));
+    _VSTD::thread(&__async_assoc_state<_Rp, _Fp>::__execute, __h.get()).detach();
+    return future<_Rp>(__h.get());
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Fp, class... _Args>
+class _LIBCPP_HIDDEN __async_func
+{
+    tuple<_Fp, _Args...> __f_;
+
+public:
+    typedef typename __invoke_of<_Fp, _Args...>::type _Rp;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __async_func(_Fp&& __f, _Args&&... __args)
+        : __f_(_VSTD::move(__f), _VSTD::move(__args)...) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __async_func(__async_func&& __f) : __f_(_VSTD::move(__f.__f_)) {}
+
+    _Rp operator()()
+    {
+        typedef typename __make_tuple_indices<1+sizeof...(_Args), 1>::type _Index;
+        return __execute(_Index());
+    }
+private:
+    template <size_t ..._Indices>
+    _Rp
+    __execute(__tuple_indices<_Indices...>)
+    {
+        return _VSTD::__invoke(_VSTD::move(_VSTD::get<0>(__f_)), _VSTD::move(_VSTD::get<_Indices>(__f_))...);
+    }
+};
+
+inline _LIBCPP_INLINE_VISIBILITY bool __does_policy_contain(launch __policy, launch __value )
+{ return (int(__policy) & int(__value)) != 0; }
+
+template <class _Fp, class... _Args>
+_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI
+future<typename __invoke_of<typename decay<_Fp>::type, typename decay<_Args>::type...>::type>
+async(launch __policy, _Fp&& __f, _Args&&... __args)
+{
+    typedef __async_func<typename decay<_Fp>::type, typename decay<_Args>::type...> _BF;
+    typedef typename _BF::_Rp _Rp;
+
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif
+        if (__does_policy_contain(__policy, launch::async))
+        return _VSTD::__make_async_assoc_state<_Rp>(_BF(_LIBCPP_AUTO_CAST(_VSTD::forward<_Fp>(__f)),
+                                                        _LIBCPP_AUTO_CAST(_VSTD::forward<_Args>(__args))...));
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch ( ... ) { if (__policy == launch::async) throw ; }
+#endif
+
+    if (__does_policy_contain(__policy, launch::deferred))
+        return _VSTD::__make_deferred_assoc_state<_Rp>(_BF(_LIBCPP_AUTO_CAST(_VSTD::forward<_Fp>(__f)),
+                                                           _LIBCPP_AUTO_CAST(_VSTD::forward<_Args>(__args))...));
+    return future<_Rp>{};
+}
+
+template <class _Fp, class... _Args>
+_LIBCPP_NODISCARD_AFTER_CXX17 inline _LIBCPP_INLINE_VISIBILITY
+future<typename __invoke_of<typename decay<_Fp>::type, typename decay<_Args>::type...>::type>
+async(_Fp&& __f, _Args&&... __args)
+{
+    return _VSTD::async(launch::any, _VSTD::forward<_Fp>(__f),
+                                    _VSTD::forward<_Args>(__args)...);
+}
+
+#endif // C++03
+
+// shared_future
+
+template <class _Rp>
+class _LIBCPP_TEMPLATE_VIS shared_future
+{
+    __assoc_state<_Rp>* __state_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future() _NOEXCEPT : __state_(nullptr) {}
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future(const shared_future& __rhs)  _NOEXCEPT : __state_(__rhs.__state_)
+        {if (__state_) __state_->__add_shared();}
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future(future<_Rp>&& __f) _NOEXCEPT : __state_(__f.__state_)
+        {__f.__state_ = nullptr;}
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future(shared_future&& __rhs) _NOEXCEPT : __state_(__rhs.__state_)
+        {__rhs.__state_ = nullptr;}
+    ~shared_future();
+    shared_future& operator=(const shared_future& __rhs) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future& operator=(shared_future&& __rhs) _NOEXCEPT
+        {
+            shared_future(_VSTD::move(__rhs)).swap(*this);
+            return *this;
+        }
+
+    // retrieving the value
+    _LIBCPP_INLINE_VISIBILITY
+    const _Rp& get() const {return __state_->copy();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(shared_future& __rhs) _NOEXCEPT {_VSTD::swap(__state_, __rhs.__state_);}
+
+    // functions to check state
+    _LIBCPP_INLINE_VISIBILITY
+    bool valid() const _NOEXCEPT {return __state_ != nullptr;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void wait() const {__state_->wait();}
+    template <class _Rep, class _Period>
+        _LIBCPP_INLINE_VISIBILITY
+        future_status
+        wait_for(const chrono::duration<_Rep, _Period>& __rel_time) const
+            {return __state_->wait_for(__rel_time);}
+    template <class _Clock, class _Duration>
+        _LIBCPP_INLINE_VISIBILITY
+        future_status
+        wait_until(const chrono::time_point<_Clock, _Duration>& __abs_time) const
+            {return __state_->wait_until(__abs_time);}
+};
+
+template <class _Rp>
+shared_future<_Rp>::~shared_future()
+{
+    if (__state_)
+        __state_->__release_shared();
+}
+
+template <class _Rp>
+shared_future<_Rp>&
+shared_future<_Rp>::operator=(const shared_future& __rhs) _NOEXCEPT
+{
+    if (__rhs.__state_)
+        __rhs.__state_->__add_shared();
+    if (__state_)
+        __state_->__release_shared();
+    __state_ = __rhs.__state_;
+    return *this;
+}
+
+template <class _Rp>
+class _LIBCPP_TEMPLATE_VIS shared_future<_Rp&>
+{
+    __assoc_state<_Rp&>* __state_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future() _NOEXCEPT : __state_(nullptr) {}
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future(const shared_future& __rhs) : __state_(__rhs.__state_)
+        {if (__state_) __state_->__add_shared();}
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future(future<_Rp&>&& __f) _NOEXCEPT : __state_(__f.__state_)
+        {__f.__state_ = nullptr;}
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future(shared_future&& __rhs) _NOEXCEPT : __state_(__rhs.__state_)
+        {__rhs.__state_ = nullptr;}
+    ~shared_future();
+    shared_future& operator=(const shared_future& __rhs);
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future& operator=(shared_future&& __rhs) _NOEXCEPT
+        {
+            shared_future(_VSTD::move(__rhs)).swap(*this);
+            return *this;
+        }
+
+    // retrieving the value
+    _LIBCPP_INLINE_VISIBILITY
+    _Rp& get() const {return __state_->copy();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(shared_future& __rhs) _NOEXCEPT {_VSTD::swap(__state_, __rhs.__state_);}
+
+    // functions to check state
+    _LIBCPP_INLINE_VISIBILITY
+    bool valid() const _NOEXCEPT {return __state_ != nullptr;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void wait() const {__state_->wait();}
+    template <class _Rep, class _Period>
+        _LIBCPP_INLINE_VISIBILITY
+        future_status
+        wait_for(const chrono::duration<_Rep, _Period>& __rel_time) const
+            {return __state_->wait_for(__rel_time);}
+    template <class _Clock, class _Duration>
+        _LIBCPP_INLINE_VISIBILITY
+        future_status
+        wait_until(const chrono::time_point<_Clock, _Duration>& __abs_time) const
+            {return __state_->wait_until(__abs_time);}
+};
+
+template <class _Rp>
+shared_future<_Rp&>::~shared_future()
+{
+    if (__state_)
+        __state_->__release_shared();
+}
+
+template <class _Rp>
+shared_future<_Rp&>&
+shared_future<_Rp&>::operator=(const shared_future& __rhs)
+{
+    if (__rhs.__state_)
+        __rhs.__state_->__add_shared();
+    if (__state_)
+        __state_->__release_shared();
+    __state_ = __rhs.__state_;
+    return *this;
+}
+
+template <>
+class _LIBCPP_TYPE_VIS _LIBCPP_AVAILABILITY_FUTURE shared_future<void>
+{
+    __assoc_sub_state* __state_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future() _NOEXCEPT : __state_(nullptr) {}
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future(const shared_future& __rhs) : __state_(__rhs.__state_)
+        {if (__state_) __state_->__add_shared();}
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future(future<void>&& __f) _NOEXCEPT : __state_(__f.__state_)
+        {__f.__state_ = nullptr;}
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future(shared_future&& __rhs) _NOEXCEPT : __state_(__rhs.__state_)
+        {__rhs.__state_ = nullptr;}
+    ~shared_future();
+    shared_future& operator=(const shared_future& __rhs);
+    _LIBCPP_INLINE_VISIBILITY
+    shared_future& operator=(shared_future&& __rhs) _NOEXCEPT
+        {
+            shared_future(_VSTD::move(__rhs)).swap(*this);
+            return *this;
+        }
+
+    // retrieving the value
+    _LIBCPP_INLINE_VISIBILITY
+    void get() const {__state_->copy();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(shared_future& __rhs) _NOEXCEPT {_VSTD::swap(__state_, __rhs.__state_);}
+
+    // functions to check state
+    _LIBCPP_INLINE_VISIBILITY
+    bool valid() const _NOEXCEPT {return __state_ != nullptr;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void wait() const {__state_->wait();}
+    template <class _Rep, class _Period>
+        _LIBCPP_INLINE_VISIBILITY
+        future_status
+        wait_for(const chrono::duration<_Rep, _Period>& __rel_time) const
+            {return __state_->wait_for(__rel_time);}
+    template <class _Clock, class _Duration>
+        _LIBCPP_INLINE_VISIBILITY
+        future_status
+        wait_until(const chrono::time_point<_Clock, _Duration>& __abs_time) const
+            {return __state_->wait_until(__abs_time);}
+};
+
+template <class _Rp>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(shared_future<_Rp>& __x, shared_future<_Rp>& __y) _NOEXCEPT
+{
+    __x.swap(__y);
+}
+
+template <class _Rp>
+inline
+shared_future<_Rp>
+future<_Rp>::share() _NOEXCEPT
+{
+    return shared_future<_Rp>(_VSTD::move(*this));
+}
+
+template <class _Rp>
+inline
+shared_future<_Rp&>
+future<_Rp&>::share() _NOEXCEPT
+{
+    return shared_future<_Rp&>(_VSTD::move(*this));
+}
+
+inline
+shared_future<void>
+future<void>::share() _NOEXCEPT
+{
+    return shared_future<void>(_VSTD::move(*this));
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 17
+#  include <chrono>
+#endif
+
+#endif // _LIBCPP_FUTURE
diff --git a/app/src/main/cpp/libcxx/include/initializer_list b/app/src/main/cpp/libcxx/include/initializer_list
new file mode 100644
index 0000000..d975722
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/initializer_list
@@ -0,0 +1,118 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_INITIALIZER_LIST
+#define _LIBCPP_INITIALIZER_LIST
+
+/*
+    initializer_list synopsis
+
+namespace std
+{
+
+template<class E>
+class initializer_list
+{
+public:
+    typedef E        value_type;
+    typedef const E& reference;
+    typedef const E& const_reference;
+    typedef size_t   size_type;
+
+    typedef const E* iterator;
+    typedef const E* const_iterator;
+
+    initializer_list() noexcept; // constexpr in C++14
+
+    size_t   size()  const noexcept; // constexpr in C++14
+    const E* begin() const noexcept; // constexpr in C++14
+    const E* end()   const noexcept; // constexpr in C++14
+};
+
+template<class E> const E* begin(initializer_list<E> il) noexcept; // constexpr in C++14
+template<class E> const E* end(initializer_list<E> il) noexcept; // constexpr in C++14
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <cstddef>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+namespace std  // purposefully not versioned
+{
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template<class _Ep>
+class _LIBCPP_TEMPLATE_VIS initializer_list
+{
+    const _Ep* __begin_;
+    size_t    __size_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX14
+    initializer_list(const _Ep* __b, size_t __s) _NOEXCEPT
+        : __begin_(__b),
+          __size_(__s)
+        {}
+public:
+    typedef _Ep        value_type;
+    typedef const _Ep& reference;
+    typedef const _Ep& const_reference;
+    typedef size_t    size_type;
+
+    typedef const _Ep* iterator;
+    typedef const _Ep* const_iterator;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX14
+    initializer_list() _NOEXCEPT : __begin_(nullptr), __size_(0) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX14
+    size_t    size()  const _NOEXCEPT {return __size_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX14
+    const _Ep* begin() const _NOEXCEPT {return __begin_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX14
+    const _Ep* end()   const _NOEXCEPT {return __begin_ + __size_;}
+};
+
+template<class _Ep>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX14
+const _Ep*
+begin(initializer_list<_Ep> __il) _NOEXCEPT
+{
+    return __il.begin();
+}
+
+template<class _Ep>
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR_SINCE_CXX14
+const _Ep*
+end(initializer_list<_Ep> __il) _NOEXCEPT
+{
+    return __il.end();
+}
+
+#endif // !defined(_LIBCPP_CXX03_LANG)
+
+} // namespace std
+
+#endif // _LIBCPP_INITIALIZER_LIST
diff --git a/app/src/main/cpp/libcxx/include/inttypes.h b/app/src/main/cpp/libcxx/include/inttypes.h
new file mode 100644
index 0000000..b755526
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/inttypes.h
@@ -0,0 +1,264 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_INTTYPES_H
+// AIX system headers need inttypes.h to be re-enterable while _STD_TYPES_T
+// is defined until an inclusion of it without _STD_TYPES_T occurs, in which
+// case the header guard macro is defined.
+#if !defined(_AIX) || !defined(_STD_TYPES_T)
+#define _LIBCPP_INTTYPES_H
+#endif // _STD_TYPES_T
+
+/*
+    inttypes.h synopsis
+
+This entire header is C99 / C++0X
+
+#include <stdint.h>  // <cinttypes> includes <cstdint>
+
+Macros:
+
+    PRId8
+    PRId16
+    PRId32
+    PRId64
+
+    PRIdLEAST8
+    PRIdLEAST16
+    PRIdLEAST32
+    PRIdLEAST64
+
+    PRIdFAST8
+    PRIdFAST16
+    PRIdFAST32
+    PRIdFAST64
+
+    PRIdMAX
+    PRIdPTR
+
+    PRIi8
+    PRIi16
+    PRIi32
+    PRIi64
+
+    PRIiLEAST8
+    PRIiLEAST16
+    PRIiLEAST32
+    PRIiLEAST64
+
+    PRIiFAST8
+    PRIiFAST16
+    PRIiFAST32
+    PRIiFAST64
+
+    PRIiMAX
+    PRIiPTR
+
+    PRIo8
+    PRIo16
+    PRIo32
+    PRIo64
+
+    PRIoLEAST8
+    PRIoLEAST16
+    PRIoLEAST32
+    PRIoLEAST64
+
+    PRIoFAST8
+    PRIoFAST16
+    PRIoFAST32
+    PRIoFAST64
+
+    PRIoMAX
+    PRIoPTR
+
+    PRIu8
+    PRIu16
+    PRIu32
+    PRIu64
+
+    PRIuLEAST8
+    PRIuLEAST16
+    PRIuLEAST32
+    PRIuLEAST64
+
+    PRIuFAST8
+    PRIuFAST16
+    PRIuFAST32
+    PRIuFAST64
+
+    PRIuMAX
+    PRIuPTR
+
+    PRIx8
+    PRIx16
+    PRIx32
+    PRIx64
+
+    PRIxLEAST8
+    PRIxLEAST16
+    PRIxLEAST32
+    PRIxLEAST64
+
+    PRIxFAST8
+    PRIxFAST16
+    PRIxFAST32
+    PRIxFAST64
+
+    PRIxMAX
+    PRIxPTR
+
+    PRIX8
+    PRIX16
+    PRIX32
+    PRIX64
+
+    PRIXLEAST8
+    PRIXLEAST16
+    PRIXLEAST32
+    PRIXLEAST64
+
+    PRIXFAST8
+    PRIXFAST16
+    PRIXFAST32
+    PRIXFAST64
+
+    PRIXMAX
+    PRIXPTR
+
+    SCNd8
+    SCNd16
+    SCNd32
+    SCNd64
+
+    SCNdLEAST8
+    SCNdLEAST16
+    SCNdLEAST32
+    SCNdLEAST64
+
+    SCNdFAST8
+    SCNdFAST16
+    SCNdFAST32
+    SCNdFAST64
+
+    SCNdMAX
+    SCNdPTR
+
+    SCNi8
+    SCNi16
+    SCNi32
+    SCNi64
+
+    SCNiLEAST8
+    SCNiLEAST16
+    SCNiLEAST32
+    SCNiLEAST64
+
+    SCNiFAST8
+    SCNiFAST16
+    SCNiFAST32
+    SCNiFAST64
+
+    SCNiMAX
+    SCNiPTR
+
+    SCNo8
+    SCNo16
+    SCNo32
+    SCNo64
+
+    SCNoLEAST8
+    SCNoLEAST16
+    SCNoLEAST32
+    SCNoLEAST64
+
+    SCNoFAST8
+    SCNoFAST16
+    SCNoFAST32
+    SCNoFAST64
+
+    SCNoMAX
+    SCNoPTR
+
+    SCNu8
+    SCNu16
+    SCNu32
+    SCNu64
+
+    SCNuLEAST8
+    SCNuLEAST16
+    SCNuLEAST32
+    SCNuLEAST64
+
+    SCNuFAST8
+    SCNuFAST16
+    SCNuFAST32
+    SCNuFAST64
+
+    SCNuMAX
+    SCNuPTR
+
+    SCNx8
+    SCNx16
+    SCNx32
+    SCNx64
+
+    SCNxLEAST8
+    SCNxLEAST16
+    SCNxLEAST32
+    SCNxLEAST64
+
+    SCNxFAST8
+    SCNxFAST16
+    SCNxFAST32
+    SCNxFAST64
+
+    SCNxMAX
+    SCNxPTR
+
+Types:
+
+    imaxdiv_t
+
+intmax_t  imaxabs(intmax_t j);
+imaxdiv_t imaxdiv(intmax_t numer, intmax_t denom);
+intmax_t  strtoimax(const char* restrict nptr, char** restrict endptr, int base);
+uintmax_t strtoumax(const char* restrict nptr, char** restrict endptr, int base);
+intmax_t  wcstoimax(const wchar_t* restrict nptr, wchar_t** restrict endptr, int base);
+uintmax_t wcstoumax(const wchar_t* restrict nptr, wchar_t** restrict endptr, int base);
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+/* C99 stdlib (e.g. glibc < 2.18) does not provide format macros needed
+   for C++11 unless __STDC_FORMAT_MACROS is defined
+*/
+#if defined(__cplusplus) && !defined(__STDC_FORMAT_MACROS)
+#   define __STDC_FORMAT_MACROS
+#endif
+
+#if __has_include_next(<inttypes.h>)
+#  include_next <inttypes.h>
+#endif
+
+#ifdef __cplusplus
+
+#include <stdint.h>
+
+#undef imaxabs
+#undef imaxdiv
+
+#endif // __cplusplus
+
+#endif // _LIBCPP_INTTYPES_H
diff --git a/app/src/main/cpp/libcxx/include/iomanip b/app/src/main/cpp/libcxx/include/iomanip
new file mode 100644
index 0000000..38c5c9b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/iomanip
@@ -0,0 +1,663 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_IOMANIP
+#define _LIBCPP_IOMANIP
+
+/*
+    iomanip synopsis
+
+namespace std {
+
+// types T1, T2, ... are unspecified implementation types
+T1 resetiosflags(ios_base::fmtflags mask);
+T2 setiosflags (ios_base::fmtflags mask);
+T3 setbase(int base);
+template<charT> T4 setfill(charT c);
+T5 setprecision(int n);
+T6 setw(int n);
+template <class moneyT> T7 get_money(moneyT& mon, bool intl = false);
+template <class charT, class moneyT> T8 put_money(const moneyT& mon, bool intl = false);
+template <class charT> T9 get_time(struct tm* tmb, const charT* fmt);
+template <class charT> T10 put_time(const struct tm* tmb, const charT* fmt);
+
+template <class charT>
+  T11 quoted(const charT* s, charT delim=charT('"'), charT escape=charT('\\')); // C++14
+
+template <class charT, class traits, class Allocator>
+  T12 quoted(const basic_string<charT, traits, Allocator>& s,
+             charT delim=charT('"'), charT escape=charT('\\')); // C++14
+
+template <class charT, class traits, class Allocator>
+  T13 quoted(basic_string<charT, traits, Allocator>& s,
+             charT delim=charT('"'), charT escape=charT('\\')); // C++14
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <istream>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// resetiosflags
+
+class __iom_t1
+{
+    ios_base::fmtflags __mask_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __iom_t1(ios_base::fmtflags __m) : __mask_(__m) {}
+
+    template <class _CharT, class _Traits>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is, const __iom_t1& __x)
+    {
+        __is.unsetf(__x.__mask_);
+        return __is;
+    }
+
+    template <class _CharT, class _Traits>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os, const __iom_t1& __x)
+    {
+        __os.unsetf(__x.__mask_);
+        return __os;
+    }
+};
+
+inline _LIBCPP_INLINE_VISIBILITY
+__iom_t1
+resetiosflags(ios_base::fmtflags __mask)
+{
+    return __iom_t1(__mask);
+}
+
+// setiosflags
+
+class __iom_t2
+{
+    ios_base::fmtflags __mask_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __iom_t2(ios_base::fmtflags __m) : __mask_(__m) {}
+
+    template <class _CharT, class _Traits>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is, const __iom_t2& __x)
+    {
+        __is.setf(__x.__mask_);
+        return __is;
+    }
+
+    template <class _CharT, class _Traits>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os, const __iom_t2& __x)
+    {
+        __os.setf(__x.__mask_);
+        return __os;
+    }
+};
+
+inline _LIBCPP_INLINE_VISIBILITY
+__iom_t2
+setiosflags(ios_base::fmtflags __mask)
+{
+    return __iom_t2(__mask);
+}
+
+// setbase
+
+class __iom_t3
+{
+    int __base_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __iom_t3(int __b) : __base_(__b) {}
+
+    template <class _CharT, class _Traits>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is, const __iom_t3& __x)
+    {
+        __is.setf(__x.__base_ == 8  ? ios_base::oct :
+                  __x.__base_ == 10 ? ios_base::dec :
+                  __x.__base_ == 16 ? ios_base::hex :
+                  ios_base::fmtflags(0), ios_base::basefield);
+        return __is;
+    }
+
+    template <class _CharT, class _Traits>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os, const __iom_t3& __x)
+    {
+        __os.setf(__x.__base_ == 8  ? ios_base::oct :
+                  __x.__base_ == 10 ? ios_base::dec :
+                  __x.__base_ == 16 ? ios_base::hex :
+                  ios_base::fmtflags(0), ios_base::basefield);
+        return __os;
+    }
+};
+
+inline _LIBCPP_INLINE_VISIBILITY
+__iom_t3
+setbase(int __base)
+{
+    return __iom_t3(__base);
+}
+
+// setfill
+
+template<class _CharT>
+class __iom_t4
+{
+    _CharT __fill_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __iom_t4(_CharT __c) : __fill_(__c) {}
+
+    template <class _Traits>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os, const __iom_t4& __x)
+    {
+        __os.fill(__x.__fill_);
+        return __os;
+    }
+};
+
+template<class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+__iom_t4<_CharT>
+setfill(_CharT __c)
+{
+    return __iom_t4<_CharT>(__c);
+}
+
+// setprecision
+
+class __iom_t5
+{
+    int __n_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __iom_t5(int __n) : __n_(__n) {}
+
+    template <class _CharT, class _Traits>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is, const __iom_t5& __x)
+    {
+        __is.precision(__x.__n_);
+        return __is;
+    }
+
+    template <class _CharT, class _Traits>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os, const __iom_t5& __x)
+    {
+        __os.precision(__x.__n_);
+        return __os;
+    }
+};
+
+inline _LIBCPP_INLINE_VISIBILITY
+__iom_t5
+setprecision(int __n)
+{
+    return __iom_t5(__n);
+}
+
+// setw
+
+class __iom_t6
+{
+    int __n_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __iom_t6(int __n) : __n_(__n) {}
+
+    template <class _CharT, class _Traits>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is, const __iom_t6& __x)
+    {
+        __is.width(__x.__n_);
+        return __is;
+    }
+
+    template <class _CharT, class _Traits>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os, const __iom_t6& __x)
+    {
+        __os.width(__x.__n_);
+        return __os;
+    }
+};
+
+inline _LIBCPP_INLINE_VISIBILITY
+__iom_t6
+setw(int __n)
+{
+    return __iom_t6(__n);
+}
+
+// get_money
+
+template <class _MoneyT> class __iom_t7;
+
+template <class _CharT, class _Traits, class _MoneyT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is, const __iom_t7<_MoneyT>& __x);
+
+template <class _MoneyT>
+class __iom_t7
+{
+    _MoneyT& __mon_;
+    bool __intl_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __iom_t7(_MoneyT& __mon, bool __intl)
+        : __mon_(__mon), __intl_(__intl) {}
+
+    template <class _CharT, class _Traits, class _Mp>
+    friend
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is, const __iom_t7<_Mp>& __x);
+};
+
+template <class _CharT, class _Traits, class _MoneyT>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is, const __iom_t7<_MoneyT>& __x)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        typename basic_istream<_CharT, _Traits>::sentry __s(__is);
+        if (__s)
+        {
+            typedef istreambuf_iterator<_CharT, _Traits> _Ip;
+            typedef money_get<_CharT, _Ip> _Fp;
+            ios_base::iostate __err = ios_base::goodbit;
+            const _Fp& __mf = std::use_facet<_Fp>(__is.getloc());
+            __mf.get(_Ip(__is), _Ip(), __x.__intl_, __is, __err, __x.__mon_);
+            __is.setstate(__err);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        __is.__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return __is;
+}
+
+template <class _MoneyT>
+inline _LIBCPP_INLINE_VISIBILITY
+__iom_t7<_MoneyT>
+get_money(_MoneyT& __mon, bool __intl = false)
+{
+    return __iom_t7<_MoneyT>(__mon, __intl);
+}
+
+// put_money
+
+template <class _MoneyT> class __iom_t8;
+
+template <class _CharT, class _Traits, class _MoneyT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const __iom_t8<_MoneyT>& __x);
+
+template <class _MoneyT>
+class __iom_t8
+{
+    const _MoneyT& __mon_;
+    bool __intl_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __iom_t8(const _MoneyT& __mon, bool __intl)
+        : __mon_(__mon), __intl_(__intl) {}
+
+    template <class _CharT, class _Traits, class _Mp>
+    friend
+    basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os, const __iom_t8<_Mp>& __x);
+};
+
+template <class _CharT, class _Traits, class _MoneyT>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const __iom_t8<_MoneyT>& __x)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        typename basic_ostream<_CharT, _Traits>::sentry __s(__os);
+        if (__s)
+        {
+            typedef ostreambuf_iterator<_CharT, _Traits> _Op;
+            typedef money_put<_CharT, _Op> _Fp;
+            const _Fp& __mf = std::use_facet<_Fp>(__os.getloc());
+            if (__mf.put(_Op(__os), __x.__intl_, __os, __os.fill(), __x.__mon_).failed())
+                __os.setstate(ios_base::badbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        __os.__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return __os;
+}
+
+template <class _MoneyT>
+inline _LIBCPP_INLINE_VISIBILITY
+__iom_t8<_MoneyT>
+put_money(const _MoneyT& __mon, bool __intl = false)
+{
+    return __iom_t8<_MoneyT>(__mon, __intl);
+}
+
+// get_time
+
+template <class _CharT> class __iom_t9;
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is, const __iom_t9<_CharT>& __x);
+
+template <class _CharT>
+class __iom_t9
+{
+    tm* __tm_;
+    const _CharT* __fmt_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __iom_t9(tm* __tm, const _CharT* __fmt)
+        : __tm_(__tm), __fmt_(__fmt) {}
+
+    template <class _Cp, class _Traits>
+    friend
+    basic_istream<_Cp, _Traits>&
+    operator>>(basic_istream<_Cp, _Traits>& __is, const __iom_t9<_Cp>& __x);
+};
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is, const __iom_t9<_CharT>& __x)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        typename basic_istream<_CharT, _Traits>::sentry __s(__is);
+        if (__s)
+        {
+            typedef istreambuf_iterator<_CharT, _Traits> _Ip;
+            typedef time_get<_CharT, _Ip> _Fp;
+            ios_base::iostate __err = ios_base::goodbit;
+            const _Fp& __tf = std::use_facet<_Fp>(__is.getloc());
+            __tf.get(_Ip(__is), _Ip(), __is, __err, __x.__tm_,
+                     __x.__fmt_, __x.__fmt_ + _Traits::length(__x.__fmt_));
+            __is.setstate(__err);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        __is.__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return __is;
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+__iom_t9<_CharT>
+get_time(tm* __tm, const _CharT* __fmt)
+{
+    return __iom_t9<_CharT>(__tm, __fmt);
+}
+
+// put_time
+
+template <class _CharT> class __iom_t10;
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const __iom_t10<_CharT>& __x);
+
+template <class _CharT>
+class __iom_t10
+{
+    const tm* __tm_;
+    const _CharT* __fmt_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __iom_t10(const tm* __tm, const _CharT* __fmt)
+        : __tm_(__tm), __fmt_(__fmt) {}
+
+    template <class _Cp, class _Traits>
+    friend
+    basic_ostream<_Cp, _Traits>&
+    operator<<(basic_ostream<_Cp, _Traits>& __os, const __iom_t10<_Cp>& __x);
+};
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const __iom_t10<_CharT>& __x)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        typename basic_ostream<_CharT, _Traits>::sentry __s(__os);
+        if (__s)
+        {
+            typedef ostreambuf_iterator<_CharT, _Traits> _Op;
+            typedef time_put<_CharT, _Op> _Fp;
+            const _Fp& __tf = std::use_facet<_Fp>(__os.getloc());
+            if (__tf.put(_Op(__os), __os, __os.fill(), __x.__tm_,
+                         __x.__fmt_, __x.__fmt_ + _Traits::length(__x.__fmt_)).failed())
+                __os.setstate(ios_base::badbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        __os.__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return __os;
+}
+
+template <class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+__iom_t10<_CharT>
+put_time(const tm* __tm, const _CharT* __fmt)
+{
+    return __iom_t10<_CharT>(__tm, __fmt);
+}
+
+#if _LIBCPP_STD_VER >= 11
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+__quoted_output(basic_ostream<_CharT, _Traits>& __os,
+                const _CharT *__first, const _CharT *__last, _CharT __delim, _CharT __escape)
+{
+    basic_string<_CharT, _Traits> __str;
+    __str.push_back(__delim);
+    for (; __first != __last; ++__first) {
+        if (_Traits::eq(*__first, __escape) || _Traits::eq(*__first, __delim))
+            __str.push_back(__escape);
+        __str.push_back(*__first);
+    }
+    __str.push_back(__delim);
+    return _VSTD::__put_character_sequence(__os, __str.data(), __str.size());
+}
+
+template <class _CharT, class _Traits, class _String>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+__quoted_input(basic_istream<_CharT, _Traits>& __is, _String& __string, _CharT __delim, _CharT __escape)
+{
+    __string.clear();
+    _CharT __c;
+    __is >> __c;
+    if (__is.fail())
+        return __is;
+
+    if (!_Traits::eq(__c, __delim)) {
+        // no delimiter, read the whole string
+        __is.unget();
+        __is >> __string;
+        return __is;
+    }
+
+    __save_flags<_CharT, _Traits> __sf(__is);
+    std::noskipws(__is);
+    while (true) {
+        __is >> __c;
+        if (__is.fail())
+            break;
+        if (_Traits::eq(__c, __escape)) {
+            __is >> __c;
+            if (__is.fail())
+                break;
+        } else if (_Traits::eq(__c, __delim))
+            break;
+        __string.push_back(__c);
+    }
+    return __is;
+}
+
+template <class _CharT, class _Traits>
+struct _LIBCPP_HIDDEN __quoted_output_proxy
+{
+    const _CharT *__first_;
+    const _CharT *__last_;
+    _CharT __delim_;
+    _CharT __escape_;
+
+    _LIBCPP_HIDE_FROM_ABI
+    explicit __quoted_output_proxy(const _CharT *__f, const _CharT *__l, _CharT __d, _CharT __e)
+        : __first_(__f), __last_(__l), __delim_(__d), __escape_(__e) {}
+
+    template<class _T2, __enable_if_t<_IsSame<_Traits, void>::value || _IsSame<_Traits, _T2>::value>* = nullptr>
+    friend _LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _T2>&
+    operator<<(basic_ostream<_CharT, _T2>& __os, const __quoted_output_proxy& __p) {
+        return std::__quoted_output(__os, __p.__first_, __p.__last_, __p.__delim_, __p.__escape_);
+    }
+};
+
+template <class _CharT, class _Traits, class _Allocator>
+struct _LIBCPP_HIDDEN __quoted_proxy
+{
+    basic_string<_CharT, _Traits, _Allocator>& __string_;
+    _CharT __delim_;
+    _CharT __escape_;
+
+    _LIBCPP_HIDE_FROM_ABI
+    explicit __quoted_proxy(basic_string<_CharT, _Traits, _Allocator>& __s, _CharT __d, _CharT __e)
+        : __string_(__s), __delim_(__d), __escape_(__e) {}
+
+    friend _LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os, const __quoted_proxy& __p) {
+        return std::__quoted_output(__os, __p.__string_.data(), __p.__string_.data() + __p.__string_.size(), __p.__delim_, __p.__escape_);
+    }
+
+    friend _LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is, const __quoted_proxy& __p) {
+        return std::__quoted_input(__is, __p.__string_, __p.__delim_, __p.__escape_);
+    }
+};
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI
+__quoted_output_proxy<_CharT, _Traits>
+__quoted(const basic_string<_CharT, _Traits, _Allocator>& __s, _CharT __delim = _CharT('"'), _CharT __escape = _CharT('\\'))
+{
+    return __quoted_output_proxy<_CharT, _Traits>(__s.data(), __s.data() + __s.size(), __delim, __escape);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI
+__quoted_proxy<_CharT, _Traits, _Allocator>
+__quoted(basic_string<_CharT, _Traits, _Allocator>& __s, _CharT __delim = _CharT('"'), _CharT __escape = _CharT('\\'))
+{
+    return __quoted_proxy<_CharT, _Traits, _Allocator>(__s, __delim, __escape);
+}
+
+#endif // _LIBCPP_STD_VER >= 11
+
+#if _LIBCPP_STD_VER > 11
+
+template <class _CharT>
+_LIBCPP_HIDE_FROM_ABI
+auto quoted(const _CharT *__s, _CharT __delim = _CharT('"'), _CharT __escape = _CharT('\\'))
+{
+    const _CharT *__end = __s;
+    while (*__end) ++__end;
+    return __quoted_output_proxy<_CharT, void>(__s, __end, __delim, __escape);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI
+auto quoted(const basic_string<_CharT, _Traits, _Allocator>& __s, _CharT __delim = _CharT('"'), _CharT __escape = _CharT('\\'))
+{
+    return __quoted_output_proxy<_CharT, _Traits>(__s.data(), __s.data() + __s.size(), __delim, __escape);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI
+auto quoted(basic_string<_CharT, _Traits, _Allocator>& __s, _CharT __delim = _CharT('"'), _CharT __escape = _CharT('\\'))
+{
+    return __quoted_proxy<_CharT, _Traits, _Allocator>(__s, __delim, __escape);
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI
+auto quoted(basic_string_view<_CharT, _Traits> __sv, _CharT __delim = _CharT('"'), _CharT __escape = _CharT('\\'))
+{
+    return __quoted_output_proxy<_CharT, _Traits>(__sv.data(), __sv.data() + __sv.size(), __delim, __escape);
+}
+
+#endif // _LIBCPP_STD_VER > 11
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_IOMANIP
diff --git a/app/src/main/cpp/libcxx/include/ios b/app/src/main/cpp/libcxx/include/ios
new file mode 100644
index 0000000..9eecf4d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/ios
@@ -0,0 +1,1054 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_IOS
+#define _LIBCPP_IOS
+
+/*
+    ios synopsis
+
+#include <iosfwd>
+
+namespace std
+{
+
+typedef OFF_T streamoff;
+typedef SZ_T streamsize;
+template <class stateT> class fpos;
+
+class ios_base
+{
+public:
+    class failure;
+
+    typedef T1 fmtflags;
+    static constexpr fmtflags boolalpha;
+    static constexpr fmtflags dec;
+    static constexpr fmtflags fixed;
+    static constexpr fmtflags hex;
+    static constexpr fmtflags internal;
+    static constexpr fmtflags left;
+    static constexpr fmtflags oct;
+    static constexpr fmtflags right;
+    static constexpr fmtflags scientific;
+    static constexpr fmtflags showbase;
+    static constexpr fmtflags showpoint;
+    static constexpr fmtflags showpos;
+    static constexpr fmtflags skipws;
+    static constexpr fmtflags unitbuf;
+    static constexpr fmtflags uppercase;
+    static constexpr fmtflags adjustfield;
+    static constexpr fmtflags basefield;
+    static constexpr fmtflags floatfield;
+
+    typedef T2 iostate;
+    static constexpr iostate badbit;
+    static constexpr iostate eofbit;
+    static constexpr iostate failbit;
+    static constexpr iostate goodbit;
+
+    typedef T3 openmode;
+    static constexpr openmode app;
+    static constexpr openmode ate;
+    static constexpr openmode binary;
+    static constexpr openmode in;
+    static constexpr openmode out;
+    static constexpr openmode trunc;
+
+    typedef T4 seekdir;
+    static constexpr seekdir beg;
+    static constexpr seekdir cur;
+    static constexpr seekdir end;
+
+    class Init;
+
+    // 27.5.2.2 fmtflags state:
+    fmtflags flags() const;
+    fmtflags flags(fmtflags fmtfl);
+    fmtflags setf(fmtflags fmtfl);
+    fmtflags setf(fmtflags fmtfl, fmtflags mask);
+    void unsetf(fmtflags mask);
+
+    streamsize precision() const;
+    streamsize precision(streamsize prec);
+    streamsize width() const;
+    streamsize width(streamsize wide);
+
+    // 27.5.2.3 locales:
+    locale imbue(const locale& loc);
+    locale getloc() const;
+
+    // 27.5.2.5 storage:
+    static int xalloc();
+    long& iword(int index);
+    void*& pword(int index);
+
+    // destructor
+    virtual ~ios_base();
+
+    // 27.5.2.6 callbacks;
+    enum event { erase_event, imbue_event, copyfmt_event };
+    typedef void (*event_callback)(event, ios_base&, int index);
+    void register_callback(event_callback fn, int index);
+
+    ios_base(const ios_base&) = delete;
+    ios_base& operator=(const ios_base&) = delete;
+
+    static bool sync_with_stdio(bool sync = true);
+
+protected:
+    ios_base();
+};
+
+template <class charT, class traits = char_traits<charT> >
+class basic_ios
+    : public ios_base
+{
+public:
+    // types:
+    typedef charT char_type;
+    typedef typename traits::int_type int_type;  // removed in C++17
+    typedef typename traits::pos_type pos_type;  // removed in C++17
+    typedef typename traits::off_type off_type;  // removed in C++17
+    typedef traits traits_type;
+
+    operator unspecified-bool-type() const;
+    bool operator!() const;
+    iostate rdstate() const;
+    void clear(iostate state = goodbit);
+    void setstate(iostate state);
+    bool good() const;
+    bool eof() const;
+    bool fail() const;
+    bool bad() const;
+
+    iostate exceptions() const;
+    void exceptions(iostate except);
+
+    // 27.5.4.1 Constructor/destructor:
+    explicit basic_ios(basic_streambuf<charT,traits>* sb);
+    virtual ~basic_ios();
+
+    // 27.5.4.2 Members:
+    basic_ostream<charT,traits>* tie() const;
+    basic_ostream<charT,traits>* tie(basic_ostream<charT,traits>* tiestr);
+
+    basic_streambuf<charT,traits>* rdbuf() const;
+    basic_streambuf<charT,traits>* rdbuf(basic_streambuf<charT,traits>* sb);
+
+    basic_ios& copyfmt(const basic_ios& rhs);
+
+    char_type fill() const;
+    char_type fill(char_type ch);
+
+    locale imbue(const locale& loc);
+
+    char narrow(char_type c, char dfault) const;
+    char_type widen(char c) const;
+
+    basic_ios(const basic_ios& ) = delete;
+    basic_ios& operator=(const basic_ios&) = delete;
+
+protected:
+    basic_ios();
+    void init(basic_streambuf<charT,traits>* sb);
+    void move(basic_ios& rhs);
+    void swap(basic_ios& rhs) noexcept;
+    void set_rdbuf(basic_streambuf<charT, traits>* sb);
+};
+
+// 27.5.5, manipulators:
+ios_base& boolalpha (ios_base& str);
+ios_base& noboolalpha(ios_base& str);
+ios_base& showbase (ios_base& str);
+ios_base& noshowbase (ios_base& str);
+ios_base& showpoint (ios_base& str);
+ios_base& noshowpoint(ios_base& str);
+ios_base& showpos (ios_base& str);
+ios_base& noshowpos (ios_base& str);
+ios_base& skipws (ios_base& str);
+ios_base& noskipws (ios_base& str);
+ios_base& uppercase (ios_base& str);
+ios_base& nouppercase(ios_base& str);
+ios_base& unitbuf (ios_base& str);
+ios_base& nounitbuf (ios_base& str);
+
+// 27.5.5.2 adjustfield:
+ios_base& internal (ios_base& str);
+ios_base& left (ios_base& str);
+ios_base& right (ios_base& str);
+
+// 27.5.5.3 basefield:
+ios_base& dec (ios_base& str);
+ios_base& hex (ios_base& str);
+ios_base& oct (ios_base& str);
+
+// 27.5.5.4 floatfield:
+ios_base& fixed (ios_base& str);
+ios_base& scientific (ios_base& str);
+ios_base& hexfloat (ios_base& str);
+ios_base& defaultfloat(ios_base& str);
+
+// 27.5.5.5 error reporting:
+enum class io_errc
+{
+    stream = 1
+};
+
+concept_map ErrorCodeEnum<io_errc> { };
+error_code make_error_code(io_errc e) noexcept;
+error_condition make_error_condition(io_errc e) noexcept;
+storage-class-specifier const error_category& iostream_category() noexcept;
+
+}  // std
+
+*/
+
+#include <__config>
+
+#if defined(_LIBCPP_HAS_NO_LOCALIZATION)
+#   error "The iostreams library is not supported since libc++ has been configured without support for localization."
+#endif
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__ios/fpos.h>
+#include <__locale>
+#include <__utility/swap.h>
+#include <system_error>
+#include <version>
+
+// standard-mandated includes
+
+// [ios.syn]
+#include <iosfwd>
+
+#if !defined(_LIBCPP_HAS_NO_ATOMIC_HEADER)
+#include <atomic>     // for __xindex_
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+typedef ptrdiff_t streamsize;
+
+class _LIBCPP_TYPE_VIS ios_base
+{
+public:
+    class _LIBCPP_EXCEPTION_ABI failure;
+
+    typedef unsigned int fmtflags;
+    static const fmtflags boolalpha   = 0x0001;
+    static const fmtflags dec         = 0x0002;
+    static const fmtflags fixed       = 0x0004;
+    static const fmtflags hex         = 0x0008;
+    static const fmtflags internal    = 0x0010;
+    static const fmtflags left        = 0x0020;
+    static const fmtflags oct         = 0x0040;
+    static const fmtflags right       = 0x0080;
+    static const fmtflags scientific  = 0x0100;
+    static const fmtflags showbase    = 0x0200;
+    static const fmtflags showpoint   = 0x0400;
+    static const fmtflags showpos     = 0x0800;
+    static const fmtflags skipws      = 0x1000;
+    static const fmtflags unitbuf     = 0x2000;
+    static const fmtflags uppercase   = 0x4000;
+    static const fmtflags adjustfield = left | right | internal;
+    static const fmtflags basefield   = dec | oct | hex;
+    static const fmtflags floatfield  = scientific | fixed;
+
+    typedef unsigned int iostate;
+    static const iostate badbit  = 0x1;
+    static const iostate eofbit  = 0x2;
+    static const iostate failbit = 0x4;
+    static const iostate goodbit = 0x0;
+
+    typedef unsigned int openmode;
+    static const openmode app    = 0x01;
+    static const openmode ate    = 0x02;
+    static const openmode binary = 0x04;
+    static const openmode in     = 0x08;
+    static const openmode out    = 0x10;
+    static const openmode trunc  = 0x20;
+
+    enum seekdir {beg, cur, end};
+
+#if _LIBCPP_STD_VER <= 14
+    typedef iostate      io_state;
+    typedef openmode     open_mode;
+    typedef seekdir      seek_dir;
+
+    typedef _VSTD::streamoff streamoff;
+    typedef _VSTD::streampos streampos;
+#endif
+
+    class _LIBCPP_TYPE_VIS Init;
+
+    // 27.5.2.2 fmtflags state:
+    _LIBCPP_INLINE_VISIBILITY fmtflags flags() const;
+    _LIBCPP_INLINE_VISIBILITY fmtflags flags(fmtflags __fmtfl);
+    _LIBCPP_INLINE_VISIBILITY fmtflags setf(fmtflags __fmtfl);
+    _LIBCPP_INLINE_VISIBILITY fmtflags setf(fmtflags __fmtfl, fmtflags __mask);
+    _LIBCPP_INLINE_VISIBILITY void unsetf(fmtflags __mask);
+
+    _LIBCPP_INLINE_VISIBILITY streamsize precision() const;
+    _LIBCPP_INLINE_VISIBILITY streamsize precision(streamsize __prec);
+    _LIBCPP_INLINE_VISIBILITY streamsize width() const;
+    _LIBCPP_INLINE_VISIBILITY streamsize width(streamsize __wide);
+
+    // 27.5.2.3 locales:
+    locale imbue(const locale& __loc);
+    locale getloc() const;
+
+    // 27.5.2.5 storage:
+    static int xalloc();
+    long& iword(int __index);
+    void*& pword(int __index);
+
+    // destructor
+    virtual ~ios_base();
+
+    // 27.5.2.6 callbacks;
+    enum event { erase_event, imbue_event, copyfmt_event };
+    typedef void (*event_callback)(event, ios_base&, int __index);
+    void register_callback(event_callback __fn, int __index);
+
+    ios_base(const ios_base&) = delete;
+    ios_base& operator=(const ios_base&) = delete;
+
+    static bool sync_with_stdio(bool __sync = true);
+
+    _LIBCPP_INLINE_VISIBILITY iostate rdstate() const;
+    void clear(iostate __state = goodbit);
+    _LIBCPP_INLINE_VISIBILITY void setstate(iostate __state);
+
+    _LIBCPP_INLINE_VISIBILITY bool good() const;
+    _LIBCPP_INLINE_VISIBILITY bool eof() const;
+    _LIBCPP_INLINE_VISIBILITY bool fail() const;
+    _LIBCPP_INLINE_VISIBILITY bool bad() const;
+
+    _LIBCPP_INLINE_VISIBILITY iostate exceptions() const;
+    _LIBCPP_INLINE_VISIBILITY void exceptions(iostate __iostate);
+
+    void __set_badbit_and_consider_rethrow();
+    void __set_failbit_and_consider_rethrow();
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __setstate_nothrow(iostate __state)
+    {
+        if (__rdbuf_)
+            __rdstate_ |= __state;
+        else
+            __rdstate_ |= __state | ios_base::badbit;
+    }
+
+protected:
+    _LIBCPP_INLINE_VISIBILITY
+    ios_base() {// purposefully does no initialization
+               }
+
+    void init(void* __sb);
+    _LIBCPP_INLINE_VISIBILITY void* rdbuf() const {return __rdbuf_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void rdbuf(void* __sb)
+    {
+        __rdbuf_ = __sb;
+        clear();
+    }
+
+    void __call_callbacks(event);
+    void copyfmt(const ios_base&);
+    void move(ios_base&);
+    void swap(ios_base&) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void set_rdbuf(void* __sb)
+    {
+        __rdbuf_ = __sb;
+    }
+
+private:
+    // All data members must be scalars
+    fmtflags        __fmtflags_;
+    streamsize      __precision_;
+    streamsize      __width_;
+    iostate         __rdstate_;
+    iostate         __exceptions_;
+    void*           __rdbuf_;
+    void*           __loc_;
+    event_callback* __fn_;
+    int*            __index_;
+    size_t          __event_size_;
+    size_t          __event_cap_;
+// TODO(EricWF): Enable this for both Clang and GCC. Currently it is only
+// enabled with clang.
+#if defined(_LIBCPP_HAS_C_ATOMIC_IMP) && !defined(_LIBCPP_HAS_NO_THREADS)
+    static atomic<int> __xindex_;
+#else
+    static int      __xindex_;
+#endif
+    long*           __iarray_;
+    size_t          __iarray_size_;
+    size_t          __iarray_cap_;
+    void**          __parray_;
+    size_t          __parray_size_;
+    size_t          __parray_cap_;
+};
+
+//enum class io_errc
+_LIBCPP_DECLARE_STRONG_ENUM(io_errc)
+{
+    stream = 1
+};
+_LIBCPP_DECLARE_STRONG_ENUM_EPILOG(io_errc)
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS is_error_code_enum<io_errc> : public true_type { };
+
+#ifdef _LIBCPP_CXX03_LANG
+template <>
+struct _LIBCPP_TEMPLATE_VIS is_error_code_enum<io_errc::__lx> : public true_type { };
+#endif
+
+_LIBCPP_FUNC_VIS
+const error_category& iostream_category() _NOEXCEPT;
+
+inline _LIBCPP_INLINE_VISIBILITY
+error_code
+make_error_code(io_errc __e) _NOEXCEPT
+{
+    return error_code(static_cast<int>(__e), iostream_category());
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+error_condition
+make_error_condition(io_errc __e) _NOEXCEPT
+{
+    return error_condition(static_cast<int>(__e), iostream_category());
+}
+
+class _LIBCPP_EXCEPTION_ABI ios_base::failure
+    : public system_error
+{
+public:
+    explicit failure(const string& __msg, const error_code& __ec = io_errc::stream);
+    explicit failure(const char* __msg, const error_code& __ec = io_errc::stream);
+    failure(const failure&) _NOEXCEPT = default;
+    ~failure() _NOEXCEPT override;
+};
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_failure(char const* __msg) {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw ios_base::failure(__msg);
+#else
+    ((void)__msg);
+    _VSTD::abort();
+#endif
+}
+
+class _LIBCPP_TYPE_VIS ios_base::Init
+{
+public:
+    Init();
+    ~Init();
+};
+
+// fmtflags
+
+inline _LIBCPP_INLINE_VISIBILITY
+ios_base::fmtflags
+ios_base::flags() const
+{
+    return __fmtflags_;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+ios_base::fmtflags
+ios_base::flags(fmtflags __fmtfl)
+{
+    fmtflags __r = __fmtflags_;
+    __fmtflags_ = __fmtfl;
+    return __r;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+ios_base::fmtflags
+ios_base::setf(fmtflags __fmtfl)
+{
+    fmtflags __r = __fmtflags_;
+    __fmtflags_ |= __fmtfl;
+    return __r;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void
+ios_base::unsetf(fmtflags __mask)
+{
+    __fmtflags_ &= ~__mask;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+ios_base::fmtflags
+ios_base::setf(fmtflags __fmtfl, fmtflags __mask)
+{
+    fmtflags __r = __fmtflags_;
+    unsetf(__mask);
+    __fmtflags_ |= __fmtfl & __mask;
+    return __r;
+}
+
+// precision
+
+inline _LIBCPP_INLINE_VISIBILITY
+streamsize
+ios_base::precision() const
+{
+    return __precision_;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+streamsize
+ios_base::precision(streamsize __prec)
+{
+    streamsize __r = __precision_;
+    __precision_ = __prec;
+    return __r;
+}
+
+// width
+
+inline _LIBCPP_INLINE_VISIBILITY
+streamsize
+ios_base::width() const
+{
+    return __width_;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+streamsize
+ios_base::width(streamsize __wide)
+{
+    streamsize __r = __width_;
+    __width_ = __wide;
+    return __r;
+}
+
+// iostate
+
+inline _LIBCPP_INLINE_VISIBILITY
+ios_base::iostate
+ios_base::rdstate() const
+{
+    return __rdstate_;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void
+ios_base::setstate(iostate __state)
+{
+    clear(__rdstate_ | __state);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+ios_base::good() const
+{
+    return __rdstate_ == 0;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+ios_base::eof() const
+{
+    return (__rdstate_ & eofbit) != 0;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+ios_base::fail() const
+{
+    return (__rdstate_ & (failbit | badbit)) != 0;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+ios_base::bad() const
+{
+    return (__rdstate_ & badbit) != 0;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+ios_base::iostate
+ios_base::exceptions() const
+{
+    return __exceptions_;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void
+ios_base::exceptions(iostate __iostate)
+{
+    __exceptions_ = __iostate;
+    clear(__rdstate_);
+}
+
+template <class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS basic_ios
+    : public ios_base
+{
+public:
+    // types:
+    typedef _CharT char_type;
+    typedef _Traits traits_type;
+
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    static_assert((is_same<_CharT, typename traits_type::char_type>::value),
+                  "traits_type::char_type must be the same type as CharT");
+
+#ifdef _LIBCPP_CXX03_LANG
+    // Preserve the ability to compare with literal 0,
+    // and implicitly convert to bool, but not implicitly convert to int.
+    _LIBCPP_INLINE_VISIBILITY
+    operator void*() const {return fail() ? nullptr : (void*)this;}
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    explicit operator bool() const {return !fail();}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY bool operator!() const    {return  fail();}
+    _LIBCPP_INLINE_VISIBILITY iostate rdstate() const   {return ios_base::rdstate();}
+    _LIBCPP_INLINE_VISIBILITY void clear(iostate __state = goodbit) {ios_base::clear(__state);}
+    _LIBCPP_INLINE_VISIBILITY void setstate(iostate __state) {ios_base::setstate(__state);}
+    _LIBCPP_INLINE_VISIBILITY bool good() const {return ios_base::good();}
+    _LIBCPP_INLINE_VISIBILITY bool eof() const  {return ios_base::eof();}
+    _LIBCPP_INLINE_VISIBILITY bool fail() const {return ios_base::fail();}
+    _LIBCPP_INLINE_VISIBILITY bool bad() const  {return ios_base::bad();}
+
+    _LIBCPP_INLINE_VISIBILITY iostate exceptions() const {return ios_base::exceptions();}
+    _LIBCPP_INLINE_VISIBILITY void exceptions(iostate __iostate) {ios_base::exceptions(__iostate);}
+
+    // 27.5.4.1 Constructor/destructor:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_ios(basic_streambuf<char_type,traits_type>* __sb);
+    ~basic_ios() override;
+
+    // 27.5.4.2 Members:
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostream<char_type, traits_type>* tie() const;
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostream<char_type, traits_type>* tie(basic_ostream<char_type, traits_type>* __tiestr);
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_streambuf<char_type, traits_type>* rdbuf() const;
+    _LIBCPP_INLINE_VISIBILITY
+    basic_streambuf<char_type, traits_type>* rdbuf(basic_streambuf<char_type, traits_type>* __sb);
+
+    basic_ios& copyfmt(const basic_ios& __rhs);
+
+    _LIBCPP_INLINE_VISIBILITY
+    char_type fill() const;
+    _LIBCPP_INLINE_VISIBILITY
+    char_type fill(char_type __ch);
+
+    _LIBCPP_INLINE_VISIBILITY
+    locale imbue(const locale& __loc);
+
+    _LIBCPP_INLINE_VISIBILITY
+    char narrow(char_type __c, char __dfault) const;
+    _LIBCPP_INLINE_VISIBILITY
+    char_type widen(char __c) const;
+
+protected:
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ios() {// purposefully does no initialization
+                }
+    _LIBCPP_INLINE_VISIBILITY
+    void init(basic_streambuf<char_type, traits_type>* __sb);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void move(basic_ios& __rhs);
+    _LIBCPP_INLINE_VISIBILITY
+    void move(basic_ios&& __rhs) {move(__rhs);}
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(basic_ios& __rhs) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    void set_rdbuf(basic_streambuf<char_type, traits_type>* __sb);
+private:
+    basic_ostream<char_type, traits_type>* __tie_;
+    mutable int_type __fill_;
+};
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_ios<_CharT, _Traits>::basic_ios(basic_streambuf<char_type,traits_type>* __sb)
+{
+    init(__sb);
+}
+
+template <class _CharT, class _Traits>
+basic_ios<_CharT, _Traits>::~basic_ios()
+{
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+basic_ios<_CharT, _Traits>::init(basic_streambuf<char_type, traits_type>* __sb)
+{
+    ios_base::init(__sb);
+    __tie_ = nullptr;
+    __fill_ = traits_type::eof();
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_ostream<_CharT, _Traits>*
+basic_ios<_CharT, _Traits>::tie() const
+{
+    return __tie_;
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_ostream<_CharT, _Traits>*
+basic_ios<_CharT, _Traits>::tie(basic_ostream<char_type, traits_type>* __tiestr)
+{
+    basic_ostream<char_type, traits_type>* __r = __tie_;
+    __tie_ = __tiestr;
+    return __r;
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_streambuf<_CharT, _Traits>*
+basic_ios<_CharT, _Traits>::rdbuf() const
+{
+    return static_cast<basic_streambuf<char_type, traits_type>*>(ios_base::rdbuf());
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_streambuf<_CharT, _Traits>*
+basic_ios<_CharT, _Traits>::rdbuf(basic_streambuf<char_type, traits_type>* __sb)
+{
+    basic_streambuf<char_type, traits_type>* __r = rdbuf();
+    ios_base::rdbuf(__sb);
+    return __r;
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+locale
+basic_ios<_CharT, _Traits>::imbue(const locale& __loc)
+{
+    locale __r = getloc();
+    ios_base::imbue(__loc);
+    if (rdbuf())
+        rdbuf()->pubimbue(__loc);
+    return __r;
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+char
+basic_ios<_CharT, _Traits>::narrow(char_type __c, char __dfault) const
+{
+    return std::use_facet<ctype<char_type> >(getloc()).narrow(__c, __dfault);
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+_CharT
+basic_ios<_CharT, _Traits>::widen(char __c) const
+{
+    return std::use_facet<ctype<char_type> >(getloc()).widen(__c);
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+_CharT
+basic_ios<_CharT, _Traits>::fill() const
+{
+    if (traits_type::eq_int_type(traits_type::eof(), __fill_))
+        __fill_ = widen(' ');
+    return __fill_;
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+_CharT
+basic_ios<_CharT, _Traits>::fill(char_type __ch)
+{
+    if (traits_type::eq_int_type(traits_type::eof(), __fill_))
+        __fill_ = widen(' ');
+    char_type __r = __fill_;
+    __fill_ = __ch;
+    return __r;
+}
+
+template <class _CharT, class _Traits>
+basic_ios<_CharT, _Traits>&
+basic_ios<_CharT, _Traits>::copyfmt(const basic_ios& __rhs)
+{
+    if (this != &__rhs)
+    {
+        __call_callbacks(erase_event);
+        ios_base::copyfmt(__rhs);
+        __tie_ = __rhs.__tie_;
+        __fill_ = __rhs.__fill_;
+        __call_callbacks(copyfmt_event);
+        exceptions(__rhs.exceptions());
+    }
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+basic_ios<_CharT, _Traits>::move(basic_ios& __rhs)
+{
+    ios_base::move(__rhs);
+    __tie_ = __rhs.__tie_;
+    __rhs.__tie_ = nullptr;
+    __fill_ = __rhs.__fill_;
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+basic_ios<_CharT, _Traits>::swap(basic_ios& __rhs) _NOEXCEPT
+{
+    ios_base::swap(__rhs);
+    _VSTD::swap(__tie_, __rhs.__tie_);
+    _VSTD::swap(__fill_, __rhs.__fill_);
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+basic_ios<_CharT, _Traits>::set_rdbuf(basic_streambuf<char_type, traits_type>* __sb)
+{
+    ios_base::set_rdbuf(__sb);
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+boolalpha(ios_base& __str)
+{
+    __str.setf(ios_base::boolalpha);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+noboolalpha(ios_base& __str)
+{
+    __str.unsetf(ios_base::boolalpha);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+showbase(ios_base& __str)
+{
+    __str.setf(ios_base::showbase);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+noshowbase(ios_base& __str)
+{
+    __str.unsetf(ios_base::showbase);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+showpoint(ios_base& __str)
+{
+    __str.setf(ios_base::showpoint);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+noshowpoint(ios_base& __str)
+{
+    __str.unsetf(ios_base::showpoint);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+showpos(ios_base& __str)
+{
+    __str.setf(ios_base::showpos);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+noshowpos(ios_base& __str)
+{
+    __str.unsetf(ios_base::showpos);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+skipws(ios_base& __str)
+{
+    __str.setf(ios_base::skipws);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+noskipws(ios_base& __str)
+{
+    __str.unsetf(ios_base::skipws);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+uppercase(ios_base& __str)
+{
+    __str.setf(ios_base::uppercase);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+nouppercase(ios_base& __str)
+{
+    __str.unsetf(ios_base::uppercase);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+unitbuf(ios_base& __str)
+{
+    __str.setf(ios_base::unitbuf);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+nounitbuf(ios_base& __str)
+{
+    __str.unsetf(ios_base::unitbuf);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+internal(ios_base& __str)
+{
+    __str.setf(ios_base::internal, ios_base::adjustfield);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+left(ios_base& __str)
+{
+    __str.setf(ios_base::left, ios_base::adjustfield);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+right(ios_base& __str)
+{
+    __str.setf(ios_base::right, ios_base::adjustfield);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+dec(ios_base& __str)
+{
+    __str.setf(ios_base::dec, ios_base::basefield);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+hex(ios_base& __str)
+{
+    __str.setf(ios_base::hex, ios_base::basefield);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+oct(ios_base& __str)
+{
+    __str.setf(ios_base::oct, ios_base::basefield);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+fixed(ios_base& __str)
+{
+    __str.setf(ios_base::fixed, ios_base::floatfield);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+scientific(ios_base& __str)
+{
+    __str.setf(ios_base::scientific, ios_base::floatfield);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+hexfloat(ios_base& __str)
+{
+    __str.setf(ios_base::fixed | ios_base::scientific, ios_base::floatfield);
+    return __str;
+}
+
+_LIBCPP_HIDE_FROM_ABI inline
+ios_base&
+defaultfloat(ios_base& __str)
+{
+    __str.unsetf(ios_base::floatfield);
+    return __str;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <cstddef>
+#  include <cstdlib>
+#  include <cstring>
+#  include <initializer_list>
+#  include <limits>
+#  include <new>
+#  include <stdexcept>
+#  include <type_traits>
+#  include <typeinfo>
+#endif
+
+#endif // _LIBCPP_IOS
diff --git a/app/src/main/cpp/libcxx/include/iosfwd b/app/src/main/cpp/libcxx/include/iosfwd
new file mode 100644
index 0000000..7948606
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/iosfwd
@@ -0,0 +1,266 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_IOSFWD
+#define _LIBCPP_IOSFWD
+
+/*
+    iosfwd synopsis
+
+namespace std
+{
+
+template<class charT> struct char_traits;
+template<>            struct char_traits<char>;
+template<>            struct char_traits<char8_t>;  // C++20
+template<>            struct char_traits<char16_t>;
+template<>            struct char_traits<char32_t>;
+template<>            struct char_traits<wchar_t>;
+
+template<class T>     class allocator;
+
+class ios_base;
+template <class charT, class traits = char_traits<charT> > class basic_ios;
+
+template <class charT, class traits = char_traits<charT> > class basic_streambuf;
+template <class charT, class traits = char_traits<charT> > class basic_istream;
+template <class charT, class traits = char_traits<charT> > class basic_ostream;
+template <class charT, class traits = char_traits<charT> > class basic_iostream;
+
+template <class charT, class traits = char_traits<charT>, class Allocator = allocator<charT> >
+    class basic_stringbuf;
+template <class charT, class traits = char_traits<charT>, class Allocator = allocator<charT> >
+    class basic_istringstream;
+template <class charT, class traits = char_traits<charT>, class Allocator = allocator<charT> >
+    class basic_ostringstream;
+template <class charT, class traits = char_traits<charT>, class Allocator = allocator<charT> >
+    class basic_stringstream;
+
+template <class charT, class traits = char_traits<charT> > class basic_filebuf;
+template <class charT, class traits = char_traits<charT> > class basic_ifstream;
+template <class charT, class traits = char_traits<charT> > class basic_ofstream;
+template <class charT, class traits = char_traits<charT> > class basic_fstream;
+
+template <class charT, class traits = char_traits<charT> > class istreambuf_iterator;
+template <class charT, class traits = char_traits<charT> > class ostreambuf_iterator;
+
+typedef basic_ios<char>              ios;
+typedef basic_ios<wchar_t>           wios;
+
+typedef basic_streambuf<char>        streambuf;
+typedef basic_istream<char>          istream;
+typedef basic_ostream<char>          ostream;
+typedef basic_iostream<char>         iostream;
+
+typedef basic_stringbuf<char>        stringbuf;
+typedef basic_istringstream<char>    istringstream;
+typedef basic_ostringstream<char>    ostringstream;
+typedef basic_stringstream<char>     stringstream;
+
+typedef basic_filebuf<char>          filebuf;
+typedef basic_ifstream<char>         ifstream;
+typedef basic_ofstream<char>         ofstream;
+typedef basic_fstream<char>          fstream;
+
+typedef basic_streambuf<wchar_t>     wstreambuf;
+typedef basic_istream<wchar_t>       wistream;
+typedef basic_ostream<wchar_t>       wostream;
+typedef basic_iostream<wchar_t>      wiostream;
+
+typedef basic_stringbuf<wchar_t>     wstringbuf;
+typedef basic_istringstream<wchar_t> wistringstream;
+typedef basic_ostringstream<wchar_t> wostringstream;
+typedef basic_stringstream<wchar_t>  wstringstream;
+
+typedef basic_filebuf<wchar_t>       wfilebuf;
+typedef basic_ifstream<wchar_t>      wifstream;
+typedef basic_ofstream<wchar_t>      wofstream;
+typedef basic_fstream<wchar_t>       wfstream;
+
+template <class state> class fpos;
+using streampos  = fpos<char_traits<char>::state_type>;
+using wstreampos = fpos<char_traits<wchar_t>::state_type>;
+using u8streampos = fpos<char_traits<char8_t>::state_type>; // C++20
+using u16streampos = fpos<char_traits<char16_t>::state_type>;
+using u32streampos = fpos<char_traits<char32_t>::state_type>;
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__fwd/string.h>
+#include <__mbstate_t.h>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+class _LIBCPP_TYPE_VIS ios_base;
+
+template <class _CharT, class _Traits = char_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_ios;
+
+template <class _CharT, class _Traits = char_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_streambuf;
+template <class _CharT, class _Traits = char_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_istream;
+template <class _CharT, class _Traits = char_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_ostream;
+template <class _CharT, class _Traits = char_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_iostream;
+
+template <class _CharT, class _Traits = char_traits<_CharT>,
+          class _Allocator = allocator<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_stringbuf;
+template <class _CharT, class _Traits = char_traits<_CharT>,
+          class _Allocator = allocator<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_istringstream;
+template <class _CharT, class _Traits = char_traits<_CharT>,
+          class _Allocator = allocator<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_ostringstream;
+template <class _CharT, class _Traits = char_traits<_CharT>,
+          class _Allocator = allocator<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_stringstream;
+
+template <class _CharT, class _Traits = char_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_filebuf;
+template <class _CharT, class _Traits = char_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_ifstream;
+template <class _CharT, class _Traits = char_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_ofstream;
+template <class _CharT, class _Traits = char_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_fstream;
+
+template <class _CharT, class _Traits = char_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS istreambuf_iterator;
+template <class _CharT, class _Traits = char_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS ostreambuf_iterator;
+
+typedef basic_ios<char>              ios;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+typedef basic_ios<wchar_t>           wios;
+#endif
+
+typedef basic_streambuf<char>        streambuf;
+typedef basic_istream<char>          istream;
+typedef basic_ostream<char>          ostream;
+typedef basic_iostream<char>         iostream;
+
+typedef basic_stringbuf<char>        stringbuf;
+typedef basic_istringstream<char>    istringstream;
+typedef basic_ostringstream<char>    ostringstream;
+typedef basic_stringstream<char>     stringstream;
+
+typedef basic_filebuf<char>          filebuf;
+typedef basic_ifstream<char>         ifstream;
+typedef basic_ofstream<char>         ofstream;
+typedef basic_fstream<char>          fstream;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+typedef basic_streambuf<wchar_t>     wstreambuf;
+typedef basic_istream<wchar_t>       wistream;
+typedef basic_ostream<wchar_t>       wostream;
+typedef basic_iostream<wchar_t>      wiostream;
+
+typedef basic_stringbuf<wchar_t>     wstringbuf;
+typedef basic_istringstream<wchar_t> wistringstream;
+typedef basic_ostringstream<wchar_t> wostringstream;
+typedef basic_stringstream<wchar_t>  wstringstream;
+
+typedef basic_filebuf<wchar_t>       wfilebuf;
+typedef basic_ifstream<wchar_t>      wifstream;
+typedef basic_ofstream<wchar_t>      wofstream;
+typedef basic_fstream<wchar_t>       wfstream;
+#endif
+
+template <class _CharT, class _Traits>
+    class _LIBCPP_PREFERRED_NAME(ios) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wios)) basic_ios;
+
+template <class _CharT, class _Traits>
+    class _LIBCPP_PREFERRED_NAME(streambuf) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wstreambuf)) basic_streambuf;
+template <class _CharT, class _Traits>
+    class _LIBCPP_PREFERRED_NAME(istream) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wistream)) basic_istream;
+template <class _CharT, class _Traits>
+    class _LIBCPP_PREFERRED_NAME(ostream) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wostream)) basic_ostream;
+template <class _CharT, class _Traits>
+    class _LIBCPP_PREFERRED_NAME(iostream) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wiostream)) basic_iostream;
+
+template <class _CharT, class _Traits, class _Allocator>
+    class _LIBCPP_PREFERRED_NAME(stringbuf) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wstringbuf)) basic_stringbuf;
+template <class _CharT, class _Traits, class _Allocator>
+    class _LIBCPP_PREFERRED_NAME(istringstream) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wistringstream)) basic_istringstream;
+template <class _CharT, class _Traits, class _Allocator>
+    class _LIBCPP_PREFERRED_NAME(ostringstream) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wostringstream)) basic_ostringstream;
+template <class _CharT, class _Traits, class _Allocator>
+    class _LIBCPP_PREFERRED_NAME(stringstream) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wstringstream)) basic_stringstream;
+
+template <class _CharT, class _Traits>
+    class _LIBCPP_PREFERRED_NAME(filebuf) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wfilebuf)) basic_filebuf;
+template <class _CharT, class _Traits>
+    class _LIBCPP_PREFERRED_NAME(ifstream) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wifstream)) basic_ifstream;
+template <class _CharT, class _Traits>
+    class _LIBCPP_PREFERRED_NAME(ofstream) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wofstream)) basic_ofstream;
+template <class _CharT, class _Traits>
+    class _LIBCPP_PREFERRED_NAME(fstream) _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wfstream)) basic_fstream;
+
+template <class _State>             class _LIBCPP_TEMPLATE_VIS fpos;
+typedef fpos<mbstate_t>    streampos;
+typedef fpos<mbstate_t>    wstreampos;
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+typedef fpos<mbstate_t>    u8streampos;
+#endif
+typedef fpos<mbstate_t>    u16streampos;
+typedef fpos<mbstate_t>    u32streampos;
+
+#if defined(_NEWLIB_VERSION)
+// On newlib, off_t is 'long int'
+typedef long int streamoff;         // for char_traits in <string>
+#else
+typedef long long streamoff;        // for char_traits in <string>
+#endif
+
+// Include other forward declarations here
+template <class _Tp, class _Alloc = allocator<_Tp> >
+class _LIBCPP_TEMPLATE_VIS vector;
+
+template <class _CharT, class _Traits>
+class __save_flags
+{
+    typedef basic_ios<_CharT, _Traits> __stream_type;
+    typedef typename __stream_type::fmtflags fmtflags;
+
+    __stream_type& __stream_;
+    fmtflags       __fmtflags_;
+    _CharT         __fill_;
+
+    __save_flags(const __save_flags&);
+    __save_flags& operator=(const __save_flags&);
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __save_flags(__stream_type& __stream)
+        : __stream_(__stream),
+          __fmtflags_(__stream.flags()),
+          __fill_(__stream.fill())
+        {}
+    _LIBCPP_INLINE_VISIBILITY
+    ~__save_flags()
+    {
+        __stream_.flags(__fmtflags_);
+        __stream_.fill(__fill_);
+    }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_IOSFWD
diff --git a/app/src/main/cpp/libcxx/include/iostream b/app/src/main/cpp/libcxx/include/iostream
new file mode 100644
index 0000000..d679d99
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/iostream
@@ -0,0 +1,68 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_IOSTREAM
+#define _LIBCPP_IOSTREAM
+
+/*
+    iostream synopsis
+
+#include <ios>
+#include <istream>
+#include <ostream>
+#include <streambuf>
+
+namespace std {
+
+extern istream cin;
+extern ostream cout;
+extern ostream cerr;
+extern ostream clog;
+extern wistream wcin;
+extern wostream wcout;
+extern wostream wcerr;
+extern wostream wclog;
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <version>
+
+// standard-mandated includes
+
+// [iostream.syn]
+#include <ios>
+#include <istream>
+#include <ostream>
+#include <streambuf>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+extern _LIBCPP_FUNC_VIS istream cin;
+extern _LIBCPP_FUNC_VIS ostream cout;
+extern _LIBCPP_FUNC_VIS ostream cerr;
+extern _LIBCPP_FUNC_VIS ostream clog;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern _LIBCPP_FUNC_VIS wistream wcin;
+extern _LIBCPP_FUNC_VIS wostream wcout;
+extern _LIBCPP_FUNC_VIS wostream wcerr;
+extern _LIBCPP_FUNC_VIS wostream wclog;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_IOSTREAM
diff --git a/app/src/main/cpp/libcxx/include/istream b/app/src/main/cpp/libcxx/include/istream
new file mode 100644
index 0000000..6e67d61
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/istream
@@ -0,0 +1,1647 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_ISTREAM
+#define _LIBCPP_ISTREAM
+
+/*
+    istream synopsis
+
+template <class charT, class traits = char_traits<charT> >
+class basic_istream
+    : virtual public basic_ios<charT,traits>
+{
+public:
+    // types (inherited from basic_ios (27.5.4)):
+    typedef charT                          char_type;
+    typedef traits                         traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    // 27.7.1.1.1 Constructor/destructor:
+    explicit basic_istream(basic_streambuf<char_type, traits_type>* sb);
+    basic_istream(basic_istream&& rhs);
+    virtual ~basic_istream();
+
+    // 27.7.1.1.2 Assign/swap:
+    basic_istream& operator=(basic_istream&& rhs);
+    void swap(basic_istream& rhs);
+
+    // 27.7.1.1.3 Prefix/suffix:
+    class sentry;
+
+    // 27.7.1.2 Formatted input:
+    basic_istream& operator>>(basic_istream& (*pf)(basic_istream&));
+    basic_istream& operator>>(basic_ios<char_type, traits_type>&
+                              (*pf)(basic_ios<char_type, traits_type>&));
+    basic_istream& operator>>(ios_base& (*pf)(ios_base&));
+    basic_istream& operator>>(basic_streambuf<char_type, traits_type>* sb);
+    basic_istream& operator>>(bool& n);
+    basic_istream& operator>>(short& n);
+    basic_istream& operator>>(unsigned short& n);
+    basic_istream& operator>>(int& n);
+    basic_istream& operator>>(unsigned int& n);
+    basic_istream& operator>>(long& n);
+    basic_istream& operator>>(unsigned long& n);
+    basic_istream& operator>>(long long& n);
+    basic_istream& operator>>(unsigned long long& n);
+    basic_istream& operator>>(float& f);
+    basic_istream& operator>>(double& f);
+    basic_istream& operator>>(long double& f);
+    basic_istream& operator>>(void*& p);
+
+    // 27.7.1.3 Unformatted input:
+    streamsize gcount() const;
+    int_type get();
+    basic_istream& get(char_type& c);
+    basic_istream& get(char_type* s, streamsize n);
+    basic_istream& get(char_type* s, streamsize n, char_type delim);
+    basic_istream& get(basic_streambuf<char_type,traits_type>& sb);
+    basic_istream& get(basic_streambuf<char_type,traits_type>& sb, char_type delim);
+
+    basic_istream& getline(char_type* s, streamsize n);
+    basic_istream& getline(char_type* s, streamsize n, char_type delim);
+
+    basic_istream& ignore(streamsize n = 1, int_type delim = traits_type::eof());
+    int_type peek();
+    basic_istream& read (char_type* s, streamsize n);
+    streamsize readsome(char_type* s, streamsize n);
+
+    basic_istream& putback(char_type c);
+    basic_istream& unget();
+    int sync();
+
+    pos_type tellg();
+    basic_istream& seekg(pos_type);
+    basic_istream& seekg(off_type, ios_base::seekdir);
+protected:
+    basic_istream(const basic_istream& rhs) = delete;
+    basic_istream(basic_istream&& rhs);
+    // 27.7.2.1.2 Assign/swap:
+    basic_istream& operator=(const basic_istream& rhs) = delete;
+    basic_istream& operator=(basic_istream&& rhs);
+    void swap(basic_istream& rhs);
+};
+
+// 27.7.1.2.3 character extraction templates:
+template<class charT, class traits>
+  basic_istream<charT,traits>& operator>>(basic_istream<charT,traits>&, charT&);
+
+template<class traits>
+  basic_istream<char,traits>& operator>>(basic_istream<char,traits>&, unsigned char&);
+
+template<class traits>
+  basic_istream<char,traits>& operator>>(basic_istream<char,traits>&, signed char&);
+
+template<class charT, class traits>
+  basic_istream<charT,traits>& operator>>(basic_istream<charT,traits>&, charT*);
+
+template<class traits>
+  basic_istream<char,traits>& operator>>(basic_istream<char,traits>&, unsigned char*);
+
+template<class traits>
+  basic_istream<char,traits>& operator>>(basic_istream<char,traits>&, signed char*);
+
+template <class charT, class traits>
+  void
+  swap(basic_istream<charT, traits>& x, basic_istream<charT, traits>& y);
+
+typedef basic_istream<char> istream;
+typedef basic_istream<wchar_t> wistream;
+
+template <class charT, class traits = char_traits<charT> >
+class basic_iostream :
+    public basic_istream<charT,traits>,
+    public basic_ostream<charT,traits>
+{
+public:
+    // types:
+    typedef charT                          char_type;
+    typedef traits                         traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    // constructor/destructor
+    explicit basic_iostream(basic_streambuf<char_type, traits_type>* sb);
+    basic_iostream(basic_iostream&& rhs);
+    virtual ~basic_iostream();
+
+    // assign/swap
+    basic_iostream& operator=(basic_iostream&& rhs);
+    void swap(basic_iostream& rhs);
+};
+
+template <class charT, class traits>
+  void
+  swap(basic_iostream<charT, traits>& x, basic_iostream<charT, traits>& y);
+
+typedef basic_iostream<char> iostream;
+typedef basic_iostream<wchar_t> wiostream;
+
+template <class charT, class traits>
+  basic_istream<charT,traits>&
+  ws(basic_istream<charT,traits>& is);
+
+// rvalue stream extraction
+template <class Stream, class T>
+  Stream&& operator>>(Stream&& is, T&& x);
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__iterator/istreambuf_iterator.h>
+#include <__utility/forward.h>
+#include <ostream>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS basic_istream
+    : virtual public basic_ios<_CharT, _Traits>
+{
+    streamsize __gc_;
+public:
+    // types (inherited from basic_ios (27.5.4)):
+    typedef _CharT                         char_type;
+    typedef _Traits                        traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    // 27.7.1.1.1 Constructor/destructor:
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    explicit basic_istream(basic_streambuf<char_type, traits_type>* __sb) : __gc_(0)
+    { this->init(__sb); }
+    ~basic_istream() override;
+protected:
+    inline _LIBCPP_INLINE_VISIBILITY
+    basic_istream(basic_istream&& __rhs);
+
+    // 27.7.1.1.2 Assign/swap:
+    inline _LIBCPP_INLINE_VISIBILITY
+    basic_istream& operator=(basic_istream&& __rhs);
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    void swap(basic_istream& __rhs) {
+      _VSTD::swap(__gc_, __rhs.__gc_);
+      basic_ios<char_type, traits_type>::swap(__rhs);
+    }
+
+    basic_istream           (const basic_istream& __rhs) = delete;
+    basic_istream& operator=(const basic_istream& __rhs) = delete;
+public:
+
+    // 27.7.1.1.3 Prefix/suffix:
+    class _LIBCPP_TEMPLATE_VIS sentry;
+
+    // 27.7.1.2 Formatted input:
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_istream& operator>>(basic_istream& (*__pf)(basic_istream&))
+    { return __pf(*this); }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_istream& operator>>(basic_ios<char_type, traits_type>&
+                              (*__pf)(basic_ios<char_type, traits_type>&))
+    { __pf(*this); return *this; }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_istream& operator>>(ios_base& (*__pf)(ios_base&))
+    { __pf(*this); return *this; }
+
+    basic_istream& operator>>(basic_streambuf<char_type, traits_type>* __sb);
+    basic_istream& operator>>(bool& __n);
+    basic_istream& operator>>(short& __n);
+    basic_istream& operator>>(unsigned short& __n);
+    basic_istream& operator>>(int& __n);
+    basic_istream& operator>>(unsigned int& __n);
+    basic_istream& operator>>(long& __n);
+    basic_istream& operator>>(unsigned long& __n);
+    basic_istream& operator>>(long long& __n);
+    basic_istream& operator>>(unsigned long long& __n);
+    basic_istream& operator>>(float& __f);
+    basic_istream& operator>>(double& __f);
+    basic_istream& operator>>(long double& __f);
+    basic_istream& operator>>(void*& __p);
+
+    // 27.7.1.3 Unformatted input:
+    _LIBCPP_INLINE_VISIBILITY
+    streamsize gcount() const {return __gc_;}
+    int_type get();
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_istream& get(char_type& __c) {
+      int_type __ch = get();
+      if (__ch != traits_type::eof())
+        __c = traits_type::to_char_type(__ch);
+      return *this;
+    }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_istream& get(char_type* __s, streamsize __n)
+    { return get(__s, __n, this->widen('\n')); }
+
+    basic_istream& get(char_type* __s, streamsize __n, char_type __dlm);
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_istream& get(basic_streambuf<char_type, traits_type>& __sb)
+    { return get(__sb, this->widen('\n')); }
+
+    basic_istream& get(basic_streambuf<char_type, traits_type>& __sb, char_type __dlm);
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_istream& getline(char_type* __s, streamsize __n)
+    { return getline(__s, __n, this->widen('\n')); }
+
+    basic_istream& getline(char_type* __s, streamsize __n, char_type __dlm);
+
+    basic_istream& ignore(streamsize __n = 1, int_type __dlm = traits_type::eof());
+    int_type peek();
+    basic_istream& read (char_type* __s, streamsize __n);
+    streamsize readsome(char_type* __s, streamsize __n);
+
+    basic_istream& putback(char_type __c);
+    basic_istream& unget();
+    int sync();
+
+    pos_type tellg();
+    basic_istream& seekg(pos_type __pos);
+    basic_istream& seekg(off_type __off, ios_base::seekdir __dir);
+};
+
+template <class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS basic_istream<_CharT, _Traits>::sentry
+{
+    bool __ok_;
+
+public:
+    explicit sentry(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false);
+//    ~sentry() = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit operator bool() const {return __ok_;}
+
+    sentry(const sentry&) = delete;
+    sentry& operator=(const sentry&) = delete;
+};
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>::sentry::sentry(basic_istream<_CharT, _Traits>& __is,
+                                               bool __noskipws)
+    : __ok_(false)
+{
+    if (__is.good())
+    {
+        if (__is.tie())
+            __is.tie()->flush();
+        if (!__noskipws && (__is.flags() & ios_base::skipws))
+        {
+            typedef istreambuf_iterator<_CharT, _Traits> _Ip;
+            const ctype<_CharT>& __ct = std::use_facet<ctype<_CharT> >(__is.getloc());
+            _Ip __i(__is);
+            _Ip __eof;
+            for (; __i != __eof; ++__i)
+                if (!__ct.is(__ct.space, *__i))
+                    break;
+            if (__i == __eof)
+                __is.setstate(ios_base::failbit | ios_base::eofbit);
+        }
+        __ok_ = __is.good();
+    }
+    else
+        __is.setstate(ios_base::failbit);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>::basic_istream(basic_istream&& __rhs)
+    : __gc_(__rhs.__gc_)
+{
+    __rhs.__gc_ = 0;
+    this->move(__rhs);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator=(basic_istream&& __rhs)
+{
+    swap(__rhs);
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>::~basic_istream()
+{
+}
+
+template <class _Tp, class _CharT, class _Traits>
+_LIBCPP_INLINE_VISIBILITY
+basic_istream<_CharT, _Traits>&
+__input_arithmetic(basic_istream<_CharT, _Traits>& __is, _Tp& __n) {
+    ios_base::iostate __state = ios_base::goodbit;
+    typename basic_istream<_CharT, _Traits>::sentry __s(__is);
+    if (__s)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            typedef istreambuf_iterator<_CharT, _Traits> _Ip;
+            typedef num_get<_CharT, _Ip> _Fp;
+            std::use_facet<_Fp>(__is.getloc()).get(_Ip(__is), _Ip(), __is, __state, __n);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            __is.__setstate_nothrow(__state);
+            if (__is.exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif
+        __is.setstate(__state);
+    }
+    return __is;
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(unsigned short& __n)
+{
+    return _VSTD::__input_arithmetic<unsigned short>(*this, __n);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(unsigned int& __n)
+{
+    return _VSTD::__input_arithmetic<unsigned int>(*this, __n);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(long& __n)
+{
+    return _VSTD::__input_arithmetic<long>(*this, __n);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(unsigned long& __n)
+{
+    return _VSTD::__input_arithmetic<unsigned long>(*this, __n);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(long long& __n)
+{
+    return _VSTD::__input_arithmetic<long long>(*this, __n);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(unsigned long long& __n)
+{
+    return _VSTD::__input_arithmetic<unsigned long long>(*this, __n);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(float& __n)
+{
+    return _VSTD::__input_arithmetic<float>(*this, __n);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(double& __n)
+{
+    return _VSTD::__input_arithmetic<double>(*this, __n);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(long double& __n)
+{
+    return _VSTD::__input_arithmetic<long double>(*this, __n);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(bool& __n)
+{
+    return _VSTD::__input_arithmetic<bool>(*this, __n);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(void*& __n)
+{
+    return _VSTD::__input_arithmetic<void*>(*this, __n);
+}
+
+template <class _Tp, class _CharT, class _Traits>
+_LIBCPP_INLINE_VISIBILITY
+basic_istream<_CharT, _Traits>&
+__input_arithmetic_with_numeric_limits(basic_istream<_CharT, _Traits>& __is, _Tp& __n) {
+    ios_base::iostate __state = ios_base::goodbit;
+    typename basic_istream<_CharT, _Traits>::sentry __s(__is);
+    if (__s)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            typedef istreambuf_iterator<_CharT, _Traits> _Ip;
+            typedef num_get<_CharT, _Ip> _Fp;
+            long __temp;
+            std::use_facet<_Fp>(__is.getloc()).get(_Ip(__is), _Ip(), __is, __state, __temp);
+            if (__temp < numeric_limits<_Tp>::min())
+            {
+                __state |= ios_base::failbit;
+                __n = numeric_limits<_Tp>::min();
+            }
+            else if (__temp > numeric_limits<_Tp>::max())
+            {
+                __state |= ios_base::failbit;
+                __n = numeric_limits<_Tp>::max();
+            }
+            else
+            {
+                __n = static_cast<_Tp>(__temp);
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            __is.__setstate_nothrow(__state);
+            if (__is.exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __is.setstate(__state);
+    }
+    return __is;
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(short& __n)
+{
+    return _VSTD::__input_arithmetic_with_numeric_limits<short>(*this, __n);
+}
+
+template <class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(int& __n)
+{
+    return _VSTD::__input_arithmetic_with_numeric_limits<int>(*this, __n);
+}
+
+template<class _CharT, class _Traits>
+_LIBCPP_INLINE_VISIBILITY
+basic_istream<_CharT, _Traits>&
+__input_c_string(basic_istream<_CharT, _Traits>& __is, _CharT* __p, size_t __n)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    typename basic_istream<_CharT, _Traits>::sentry __sen(__is);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif
+            _CharT* __s = __p;
+            const ctype<_CharT>& __ct = std::use_facet<ctype<_CharT> >(__is.getloc());
+            while (__s != __p + (__n-1))
+            {
+                typename _Traits::int_type __i = __is.rdbuf()->sgetc();
+                if (_Traits::eq_int_type(__i, _Traits::eof()))
+                {
+                   __state |= ios_base::eofbit;
+                   break;
+                }
+                _CharT __ch = _Traits::to_char_type(__i);
+                if (__ct.is(__ct.space, __ch))
+                    break;
+                *__s++ = __ch;
+                 __is.rdbuf()->sbumpc();
+            }
+            *__s = _CharT();
+            __is.width(0);
+            if (__s == __p)
+               __state |= ios_base::failbit;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            __is.__setstate_nothrow(__state);
+            if (__is.exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif
+        __is.setstate(__state);
+    }
+    return __is;
+}
+
+#if _LIBCPP_STD_VER > 17
+
+template<class _CharT, class _Traits, size_t _Np>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is, _CharT (&__buf)[_Np])
+{
+    size_t __n = _Np;
+    if (__is.width() > 0)
+        __n = _VSTD::min(size_t(__is.width()), _Np);
+    return _VSTD::__input_c_string(__is, __buf, __n);
+}
+
+template<class _Traits, size_t _Np>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<char, _Traits>&
+operator>>(basic_istream<char, _Traits>& __is, unsigned char (&__buf)[_Np])
+{
+    return __is >> (char(&)[_Np])__buf;
+}
+
+template<class _Traits, size_t _Np>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<char, _Traits>&
+operator>>(basic_istream<char, _Traits>& __is, signed char (&__buf)[_Np])
+{
+    return __is >> (char(&)[_Np])__buf;
+}
+
+#else
+
+template<class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is, _CharT* __s)
+{
+    streamsize __n = __is.width();
+    if (__n <= 0)
+        __n = numeric_limits<streamsize>::max() / sizeof(_CharT) - 1;
+    return _VSTD::__input_c_string(__is, __s, size_t(__n));
+}
+
+template<class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<char, _Traits>&
+operator>>(basic_istream<char, _Traits>& __is, unsigned char* __s)
+{
+    return __is >> (char*)__s;
+}
+
+template<class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<char, _Traits>&
+operator>>(basic_istream<char, _Traits>& __is, signed char* __s)
+{
+    return __is >> (char*)__s;
+}
+
+#endif // _LIBCPP_STD_VER > 17
+
+template<class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is, _CharT& __c)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    typename basic_istream<_CharT, _Traits>::sentry __sen(__is);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif
+            typename _Traits::int_type __i = __is.rdbuf()->sbumpc();
+            if (_Traits::eq_int_type(__i, _Traits::eof()))
+                __state |= ios_base::eofbit | ios_base::failbit;
+            else
+                __c = _Traits::to_char_type(__i);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            __is.__setstate_nothrow(__state);
+            if (__is.exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif
+        __is.setstate(__state);
+    }
+    return __is;
+}
+
+template<class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<char, _Traits>&
+operator>>(basic_istream<char, _Traits>& __is, unsigned char& __c)
+{
+    return __is >> (char&)__c;
+}
+
+template<class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<char, _Traits>&
+operator>>(basic_istream<char, _Traits>& __is, signed char& __c)
+{
+    return __is >> (char&)__c;
+}
+
+template<class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::operator>>(basic_streambuf<char_type, traits_type>* __sb)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    __gc_ = 0;
+    sentry __s(*this, true);
+    if (__s)
+    {
+        if (__sb)
+        {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+            try
+            {
+#endif // _LIBCPP_NO_EXCEPTIONS
+                while (true)
+                {
+                    typename traits_type::int_type __i = this->rdbuf()->sgetc();
+                    if (traits_type::eq_int_type(__i, _Traits::eof()))
+                    {
+                       __state |= ios_base::eofbit;
+                       break;
+                    }
+                    if (traits_type::eq_int_type(
+                            __sb->sputc(traits_type::to_char_type(__i)),
+                            traits_type::eof()))
+                        break;
+                    ++__gc_;
+                    this->rdbuf()->sbumpc();
+                }
+                if (__gc_ == 0)
+                   __state |= ios_base::failbit;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+            }
+            catch (...)
+            {
+                __state |= ios_base::badbit;
+                if (__gc_ == 0)
+                    __state |= ios_base::failbit;
+
+                this->__setstate_nothrow(__state);
+                if (this->exceptions() & ios_base::failbit || this->exceptions() & ios_base::badbit)
+                {
+                    throw;
+                }
+            }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        }
+        else
+        {
+            __state |= ios_base::failbit;
+        }
+        this->setstate(__state);
+    }
+    return *this;
+}
+
+template<class _CharT, class _Traits>
+typename basic_istream<_CharT, _Traits>::int_type
+basic_istream<_CharT, _Traits>::get()
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    __gc_ = 0;
+    int_type __r = traits_type::eof();
+    sentry __s(*this, true);
+    if (__s)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif
+            __r = this->rdbuf()->sbumpc();
+            if (traits_type::eq_int_type(__r, traits_type::eof()))
+               __state |= ios_base::failbit | ios_base::eofbit;
+            else
+                __gc_ = 1;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            this->__setstate_nothrow(this->rdstate() | ios_base::badbit);
+            if (this->exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif
+        this->setstate(__state);
+    }
+    return __r;
+}
+
+template<class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::get(char_type* __s, streamsize __n, char_type __dlm)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    __gc_ = 0;
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+        if (__n > 0)
+        {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+            try
+            {
+#endif
+                while (__gc_ < __n-1)
+                {
+                    int_type __i = this->rdbuf()->sgetc();
+                    if (traits_type::eq_int_type(__i, traits_type::eof()))
+                    {
+                       __state |= ios_base::eofbit;
+                       break;
+                    }
+                    char_type __ch = traits_type::to_char_type(__i);
+                    if (traits_type::eq(__ch, __dlm))
+                        break;
+                    *__s++ = __ch;
+                    ++__gc_;
+                     this->rdbuf()->sbumpc();
+                }
+                if (__gc_ == 0)
+                   __state |= ios_base::failbit;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+            }
+            catch (...)
+            {
+                __state |= ios_base::badbit;
+                this->__setstate_nothrow(__state);
+                if (this->exceptions() & ios_base::badbit)
+                {
+                    if (__n > 0)
+                        *__s = char_type();
+                    throw;
+                }
+            }
+#endif
+        }
+        else
+        {
+            __state |= ios_base::failbit;
+        }
+
+        if (__n > 0)
+            *__s = char_type();
+        this->setstate(__state);
+    }
+    if (__n > 0)
+        *__s = char_type();
+    return *this;
+}
+
+template<class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::get(basic_streambuf<char_type, traits_type>& __sb,
+                                    char_type __dlm)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    __gc_ = 0;
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            while (true)
+            {
+                typename traits_type::int_type __i = this->rdbuf()->sgetc();
+                if (traits_type::eq_int_type(__i, traits_type::eof()))
+                {
+                   __state |= ios_base::eofbit;
+                   break;
+                }
+                char_type __ch = traits_type::to_char_type(__i);
+                if (traits_type::eq(__ch, __dlm))
+                    break;
+                if (traits_type::eq_int_type(__sb.sputc(__ch), traits_type::eof()))
+                    break;
+                ++__gc_;
+                this->rdbuf()->sbumpc();
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            // according to the spec, exceptions here are caught but not rethrown
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        if (__gc_ == 0)
+           __state |= ios_base::failbit;
+        this->setstate(__state);
+    }
+    return *this;
+}
+
+template<class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::getline(char_type* __s, streamsize __n, char_type __dlm)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    __gc_ = 0;
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            while (true)
+            {
+                typename traits_type::int_type __i = this->rdbuf()->sgetc();
+                if (traits_type::eq_int_type(__i, traits_type::eof()))
+                {
+                   __state |= ios_base::eofbit;
+                   break;
+                }
+                char_type __ch = traits_type::to_char_type(__i);
+                if (traits_type::eq(__ch, __dlm))
+                {
+                    this->rdbuf()->sbumpc();
+                    ++__gc_;
+                    break;
+                }
+                if (__gc_ >= __n-1)
+                {
+                    __state |= ios_base::failbit;
+                    break;
+                }
+                *__s++ = __ch;
+                this->rdbuf()->sbumpc();
+                ++__gc_;
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            this->__setstate_nothrow(__state);
+            if (this->exceptions() & ios_base::badbit)
+            {
+                if (__n > 0)
+                    *__s = char_type();
+                if (__gc_ == 0)
+                    __state |= ios_base::failbit;
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+    if (__n > 0)
+        *__s = char_type();
+    if (__gc_ == 0)
+        __state |= ios_base::failbit;
+    this->setstate(__state);
+    return *this;
+}
+
+template<class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::ignore(streamsize __n, int_type __dlm)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    __gc_ = 0;
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            if (__n == numeric_limits<streamsize>::max())
+            {
+                while (true)
+                {
+                    typename traits_type::int_type __i = this->rdbuf()->sbumpc();
+                    if (traits_type::eq_int_type(__i, traits_type::eof()))
+                    {
+                       __state |= ios_base::eofbit;
+                       break;
+                    }
+                    ++__gc_;
+                    if (traits_type::eq_int_type(__i, __dlm))
+                        break;
+                }
+            }
+            else
+            {
+                while (__gc_ < __n)
+                {
+                    typename traits_type::int_type __i = this->rdbuf()->sbumpc();
+                    if (traits_type::eq_int_type(__i, traits_type::eof()))
+                    {
+                       __state |= ios_base::eofbit;
+                       break;
+                    }
+                    ++__gc_;
+                    if (traits_type::eq_int_type(__i, __dlm))
+                        break;
+                }
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            this->__setstate_nothrow(__state);
+            if (this->exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        this->setstate(__state);
+    }
+    return *this;
+}
+
+template<class _CharT, class _Traits>
+typename basic_istream<_CharT, _Traits>::int_type
+basic_istream<_CharT, _Traits>::peek()
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    __gc_ = 0;
+    int_type __r = traits_type::eof();
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            __r = this->rdbuf()->sgetc();
+            if (traits_type::eq_int_type(__r, traits_type::eof()))
+                __state |= ios_base::eofbit;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            this->__setstate_nothrow(__state);
+            if (this->exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        this->setstate(__state);
+    }
+    return __r;
+}
+
+template<class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::read(char_type* __s, streamsize __n)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    __gc_ = 0;
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            __gc_ = this->rdbuf()->sgetn(__s, __n);
+            if (__gc_ != __n)
+                __state |= ios_base::failbit | ios_base::eofbit;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            this->__setstate_nothrow(__state);
+            if (this->exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+    else
+    {
+        __state |= ios_base::failbit;
+    }
+    this->setstate(__state);
+    return *this;
+}
+
+template<class _CharT, class _Traits>
+streamsize
+basic_istream<_CharT, _Traits>::readsome(char_type* __s, streamsize __n)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    __gc_ = 0;
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            streamsize __c = this->rdbuf()->in_avail();
+            switch (__c)
+            {
+            case -1:
+                __state |= ios_base::eofbit;
+                break;
+            case 0:
+                break;
+            default:
+                __n = _VSTD::min(__c, __n);
+                __gc_ = this->rdbuf()->sgetn(__s, __n);
+                if (__gc_ != __n)
+                    __state |= ios_base::failbit | ios_base::eofbit;
+                break;
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            this->__setstate_nothrow(__state);
+            if (this->exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+    else
+    {
+        __state |= ios_base::failbit;
+    }
+    this->setstate(__state);
+    return __gc_;
+}
+
+template<class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::putback(char_type __c)
+{
+    ios_base::iostate __state = this->rdstate() & ~ios_base::eofbit;
+    __gc_ = 0;
+    this->clear(__state);
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            if (this->rdbuf() == nullptr || this->rdbuf()->sputbackc(__c) == traits_type::eof())
+                __state |= ios_base::badbit;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            this->__setstate_nothrow(__state);
+            if (this->exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+    else
+    {
+        __state |= ios_base::failbit;
+    }
+    this->setstate(__state);
+    return *this;
+}
+
+template<class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::unget()
+{
+    ios_base::iostate __state = this->rdstate() & ~ios_base::eofbit;
+    __gc_ = 0;
+    this->clear(__state);
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            if (this->rdbuf() == nullptr || this->rdbuf()->sungetc() == traits_type::eof())
+                __state |= ios_base::badbit;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            this->__setstate_nothrow(__state);
+            if (this->exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+    else
+    {
+        __state |= ios_base::failbit;
+    }
+    this->setstate(__state);
+    return *this;
+}
+
+template<class _CharT, class _Traits>
+int
+basic_istream<_CharT, _Traits>::sync()
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    int __r = 0;
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            if (this->rdbuf() == nullptr)
+                return -1;
+            if (this->rdbuf()->pubsync() == -1)
+            {
+                __state |= ios_base::badbit;
+                return -1;
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            this->__setstate_nothrow(__state);
+            if (this->exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        this->setstate(__state);
+    }
+    return __r;
+}
+
+template<class _CharT, class _Traits>
+typename basic_istream<_CharT, _Traits>::pos_type
+basic_istream<_CharT, _Traits>::tellg()
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    pos_type __r(-1);
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __r = this->rdbuf()->pubseekoff(0, ios_base::cur, ios_base::in);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            this->__setstate_nothrow(__state);
+            if (this->exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        this->setstate(__state);
+    }
+    return __r;
+}
+
+template<class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::seekg(pos_type __pos)
+{
+    ios_base::iostate __state = this->rdstate() & ~ios_base::eofbit;
+    this->clear(__state);
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            if (this->rdbuf()->pubseekpos(__pos, ios_base::in) == pos_type(-1))
+                __state |= ios_base::failbit;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            this->__setstate_nothrow(__state);
+            if (this->exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        this->setstate(__state);
+    }
+    return *this;
+}
+
+template<class _CharT, class _Traits>
+basic_istream<_CharT, _Traits>&
+basic_istream<_CharT, _Traits>::seekg(off_type __off, ios_base::seekdir __dir)
+{
+    ios_base::iostate __state = this->rdstate() & ~ios_base::eofbit;
+    this->clear(__state);
+    sentry __sen(*this, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            if (this->rdbuf()->pubseekoff(__off, __dir, ios_base::in) == pos_type(-1))
+                __state |= ios_base::failbit;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            this->__setstate_nothrow(__state);
+            if (this->exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        this->setstate(__state);
+    }
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+ws(basic_istream<_CharT, _Traits>& __is)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    typename basic_istream<_CharT, _Traits>::sentry __sen(__is, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            const ctype<_CharT>& __ct = std::use_facet<ctype<_CharT> >(__is.getloc());
+            while (true)
+            {
+                typename _Traits::int_type __i = __is.rdbuf()->sgetc();
+                if (_Traits::eq_int_type(__i, _Traits::eof()))
+                {
+                   __state |= ios_base::eofbit;
+                   break;
+                }
+                if (!__ct.is(__ct.space, _Traits::to_char_type(__i)))
+                    break;
+                __is.rdbuf()->sbumpc();
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            __is.__setstate_nothrow(__state);
+            if (__is.exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __is.setstate(__state);
+    }
+    return __is;
+}
+
+template <class _Stream, class _Tp, class = void>
+struct __is_istreamable : false_type { };
+
+template <class _Stream, class _Tp>
+struct __is_istreamable<_Stream, _Tp, decltype(
+    std::declval<_Stream>() >> std::declval<_Tp>(), void()
+)> : true_type { };
+
+template <class _Stream, class _Tp, class = typename enable_if<
+    _And<is_base_of<ios_base, _Stream>,
+         __is_istreamable<_Stream&, _Tp&&> >::value
+>::type>
+_LIBCPP_INLINE_VISIBILITY
+_Stream&& operator>>(_Stream&& __is, _Tp&& __x)
+{
+    __is >> _VSTD::forward<_Tp>(__x);
+    return _VSTD::move(__is);
+}
+
+template <class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS basic_iostream
+    : public basic_istream<_CharT, _Traits>,
+      public basic_ostream<_CharT, _Traits>
+{
+public:
+    // types:
+    typedef _CharT                         char_type;
+    typedef _Traits                        traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    // constructor/destructor
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    explicit basic_iostream(basic_streambuf<char_type, traits_type>* __sb)
+      : basic_istream<_CharT, _Traits>(__sb)
+    {}
+
+    ~basic_iostream() override;
+protected:
+    inline _LIBCPP_INLINE_VISIBILITY
+    basic_iostream(basic_iostream&& __rhs);
+
+    // assign/swap
+    inline _LIBCPP_INLINE_VISIBILITY
+    basic_iostream& operator=(basic_iostream&& __rhs);
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    void swap(basic_iostream& __rhs)
+    { basic_istream<char_type, traits_type>::swap(__rhs); }
+};
+
+template <class _CharT, class _Traits>
+basic_iostream<_CharT, _Traits>::basic_iostream(basic_iostream&& __rhs)
+    : basic_istream<_CharT, _Traits>(_VSTD::move(__rhs))
+{
+}
+
+template <class _CharT, class _Traits>
+basic_iostream<_CharT, _Traits>&
+basic_iostream<_CharT, _Traits>::operator=(basic_iostream&& __rhs)
+{
+    swap(__rhs);
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_iostream<_CharT, _Traits>::~basic_iostream()
+{
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           basic_string<_CharT, _Traits, _Allocator>& __str)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    typename basic_istream<_CharT, _Traits>::sentry __sen(__is);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif
+            __str.clear();
+            streamsize __n = __is.width();
+            if (__n <= 0)
+                __n = __str.max_size();
+            if (__n <= 0)
+                __n = numeric_limits<streamsize>::max();
+            streamsize __c = 0;
+            const ctype<_CharT>& __ct = std::use_facet<ctype<_CharT> >(__is.getloc());
+            while (__c < __n)
+            {
+                typename _Traits::int_type __i = __is.rdbuf()->sgetc();
+                if (_Traits::eq_int_type(__i, _Traits::eof()))
+                {
+                   __state |= ios_base::eofbit;
+                   break;
+                }
+                _CharT __ch = _Traits::to_char_type(__i);
+                if (__ct.is(__ct.space, __ch))
+                    break;
+                __str.push_back(__ch);
+                ++__c;
+                 __is.rdbuf()->sbumpc();
+            }
+            __is.width(0);
+            if (__c == 0)
+               __state |= ios_base::failbit;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            __is.__setstate_nothrow(__state);
+            if (__is.exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif
+        __is.setstate(__state);
+    }
+    return __is;
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+getline(basic_istream<_CharT, _Traits>& __is,
+        basic_string<_CharT, _Traits, _Allocator>& __str, _CharT __dlm)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    typename basic_istream<_CharT, _Traits>::sentry __sen(__is, true);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif
+            __str.clear();
+            streamsize __extr = 0;
+            while (true)
+            {
+                typename _Traits::int_type __i = __is.rdbuf()->sbumpc();
+                if (_Traits::eq_int_type(__i, _Traits::eof()))
+                {
+                   __state |= ios_base::eofbit;
+                   break;
+                }
+                ++__extr;
+                _CharT __ch = _Traits::to_char_type(__i);
+                if (_Traits::eq(__ch, __dlm))
+                    break;
+                __str.push_back(__ch);
+                if (__str.size() == __str.max_size())
+                {
+                    __state |= ios_base::failbit;
+                    break;
+                }
+            }
+            if (__extr == 0)
+               __state |= ios_base::failbit;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            __is.__setstate_nothrow(__state);
+            if (__is.exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif
+        __is.setstate(__state);
+    }
+    return __is;
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<_CharT, _Traits>&
+getline(basic_istream<_CharT, _Traits>& __is,
+        basic_string<_CharT, _Traits, _Allocator>& __str)
+{
+    return std::getline(__is, __str, __is.widen('\n'));
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<_CharT, _Traits>&
+getline(basic_istream<_CharT, _Traits>&& __is,
+        basic_string<_CharT, _Traits, _Allocator>& __str, _CharT __dlm)
+{
+    return std::getline(__is, __str, __dlm);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_istream<_CharT, _Traits>&
+getline(basic_istream<_CharT, _Traits>&& __is,
+        basic_string<_CharT, _Traits, _Allocator>& __str)
+{
+    return std::getline(__is, __str, __is.widen('\n'));
+}
+
+template <class _CharT, class _Traits, size_t _Size>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is, bitset<_Size>& __x)
+{
+    ios_base::iostate __state = ios_base::goodbit;
+    typename basic_istream<_CharT, _Traits>::sentry __sen(__is);
+    if (__sen)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif
+            basic_string<_CharT, _Traits> __str;
+            const ctype<_CharT>& __ct = std::use_facet<ctype<_CharT> >(__is.getloc());
+            size_t __c = 0;
+            _CharT __zero = __ct.widen('0');
+            _CharT __one = __ct.widen('1');
+            while (__c != _Size)
+            {
+                typename _Traits::int_type __i = __is.rdbuf()->sgetc();
+                if (_Traits::eq_int_type(__i, _Traits::eof()))
+                {
+                   __state |= ios_base::eofbit;
+                   break;
+                }
+                _CharT __ch = _Traits::to_char_type(__i);
+                if (!_Traits::eq(__ch, __zero) && !_Traits::eq(__ch, __one))
+                    break;
+                __str.push_back(__ch);
+                ++__c;
+                 __is.rdbuf()->sbumpc();
+            }
+            __x = bitset<_Size>(__str);
+            if (_Size > 0 && __c == 0)
+               __state |= ios_base::failbit;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __state |= ios_base::badbit;
+            __is.__setstate_nothrow(__state);
+            if (__is.exceptions() & ios_base::badbit)
+            {
+                throw;
+            }
+        }
+#endif
+        __is.setstate(__state);
+    }
+    return __is;
+}
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_istream<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_istream<wchar_t>;
+#endif
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_iostream<char>;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <type_traits>
+#endif
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP_ISTREAM
diff --git a/app/src/main/cpp/libcxx/include/iterator b/app/src/main/cpp/libcxx/include/iterator
new file mode 100644
index 0000000..35eca67
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/iterator
@@ -0,0 +1,742 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_ITERATOR
+#define _LIBCPP_ITERATOR
+
+/*
+    iterator synopsis
+
+#include <concepts>
+
+namespace std
+{
+template<class> struct incrementable_traits;       // since C++20
+template<class T>
+  using iter_difference_t = see below;             // since C++20
+
+template<class> struct indirectly_readable_traits; // since C++20
+template<class T>
+  using iter_value_t = see below;                  // since C++20
+
+template<class Iterator>
+struct iterator_traits;
+
+template<class T>
+  requires is_object_v<T>                    // since C++20
+struct iterator_traits<T*>;
+
+template<dereferenceable T>
+  using iter_reference_t = decltype(*declval<T&>());
+
+namespace ranges::inline unspecified {
+    inline constexpr unspecified iter_move = unspecified; // since C++20, nodiscard as an extension
+}}
+
+template<dereferenceable T>
+  requires ...
+using iter_rvalue_reference_t = decltype(ranges::iter_move(declval<T&>())); // since C++20
+
+// [iterator.concepts], iterator concepts
+// [iterator.concept.readable], concept indirectly_readable
+template<class In>
+  concept indirectly_readable = see below;                      // since C++20
+
+template<indirectly_readable T>
+  using iter_common_reference_t =
+    common_reference_t<iter_reference_t<T>, iter_value_t<T>&>;  // since C++20
+
+// [iterator.concept.writable], concept indirectly_writable
+template<class Out, class T>
+  concept indirectly_writable = see below;                // since C++20
+
+// [iterator.concept.winc], concept weakly_incrementable
+template<class I>
+  concept weakly_incrementable = see below;                // since C++20
+
+// [iterator.concept.inc], concept incrementable
+template<class I>
+  concept incrementable = see below;                       // since C++20
+
+// [iterator.concept.iterator], concept input_or_output_iterator
+  template<class I>
+    concept input_or_output_iterator = see below;          // since C++20
+
+// [iterator.concept.sentinel], concept sentinel_for
+template<class S, class I>
+  concept sentinel_for = see below;                        // since C++20
+
+// [iterator.concept.sizedsentinel], concept sized_sentinel_for
+template<class S, class I>
+  inline constexpr bool disable_sized_sentinel_for = false;
+
+template<class S, class I>
+  concept sized_sentinel_for = see below;
+
+// [iterator.concept.input], concept input_iterator
+template<class I>
+  concept input_iterator = see below;                      // since C++20
+
+// [iterator.concept.output], concept output_iterator
+template<class I, class T>
+  concept output_iterator = see below;                     // since C++20
+
+// [iterator.concept.forward], concept forward_iterator
+template<class I>
+  concept forward_iterator = see below;                    // since C++20
+
+// [iterator.concept.bidir], concept bidirectional_iterator
+template<class I>
+  concept bidirectional_iterator = see below;              // since C++20
+
+// [iterator.concept.random.access], concept random_access_iterator
+template<class I>
+  concept random_access_iterator = see below;              // since C++20
+
+// [indirectcallable]
+// [indirectcallable.indirectinvocable]
+template<class F, class I>
+  concept indirectly_unary_invocable = see below;          // since C++20
+
+template<class F, class I>
+  concept indirectly_regular_unary_invocable = see below;  // since C++20
+
+template<class F, class I>
+  concept indirect_unary_predicate = see below;            // since C++20
+
+template<class F, class I1, class I2>
+  concept indirect_binary_predicate = see below;           // since C++20
+
+template<class F, class I1, class I2 = I1>
+  concept indirect_equivalence_relation = see below;       // since C++20
+
+template<class F, class I1, class I2 = I1>
+  concept indirect_strict_weak_order = see below;          // since C++20
+
+template<class F, class... Is>
+  using indirect_result_t = see below;                     // since C++20
+
+// [projected], projected
+template<indirectly_readable I, indirectly_regular_unary_invocable<I> Proj>
+  struct projected;                                        // since C++20
+
+template<weakly_incrementable I, indirectly_regular_unary_invocable<I> Proj>
+  struct incrementable_traits<projected<I, Proj>>;         // since C++20
+
+// [alg.req.ind.move], concept indirectly_movable
+template<class In, class Out>
+  concept indirectly_movable = see below;                  // since C++20
+
+template<class In, class Out>
+  concept indirectly_movable_storable = see below;         // since C++20
+
+// [alg.req.ind.copy], concept indirectly_copyable
+template<class In, class Out>
+  concept indirectly_copyable = see below;                 // since C++20
+
+template<class In, class Out>
+  concept indirectly_copyable_storable = see below;        // since C++20
+
+// [alg.req.ind.swap], concept indirectly_swappable
+template<class I1, class I2 = I1>
+  concept indirectly_swappable = see below;                // since C++20
+
+template<class I1, class I2, class R, class P1 = identity,
+         class P2 = identity>
+  concept indirectly_comparable =
+    indirect_binary_predicate<R, projected<I1, P1>, projected<I2, P2>>; // since C++20
+
+// [alg.req.permutable], concept permutable
+template<class I>
+  concept permutable = see below;                          // since C++20
+
+ // [alg.req.mergeable], concept mergeable
+template<class I1, class I2, class Out,
+    class R = ranges::less, class P1 = identity, class P2 = identity>
+  concept mergeable = see below;                           // since C++20
+
+// [alg.req.sortable], concept sortable
+template<class I, class R = ranges::less, class P = identity>
+  concept sortable = see below;                            // since C++20
+
+template<input_or_output_iterator I, sentinel_for<I> S>
+  requires (!same_as<I, S> && copyable<I>)
+class common_iterator;                                     // since C++20
+
+template<class Category, class T, class Distance = ptrdiff_t,
+         class Pointer = T*, class Reference = T&>
+struct iterator                                            // deprecated in C++17
+{
+    typedef T         value_type;
+    typedef Distance  difference_type;
+    typedef Pointer   pointer;
+    typedef Reference reference;
+    typedef Category  iterator_category;
+};
+
+struct input_iterator_tag  {};
+struct output_iterator_tag {};
+struct forward_iterator_tag       : public input_iterator_tag         {};
+struct bidirectional_iterator_tag : public forward_iterator_tag       {};
+struct random_access_iterator_tag : public bidirectional_iterator_tag {};
+struct contiguous_iterator_tag    : public random_access_iterator_tag {};
+
+// 27.4.3, iterator operations
+template <class InputIterator, class Distance>  // constexpr in C++17
+  constexpr void advance(InputIterator& i, Distance n);
+
+template <class InputIterator>  // constexpr in C++17
+  constexpr typename iterator_traits<InputIterator>::difference_type
+    distance(InputIterator first, InputIterator last);
+
+template <class InputIterator>  // constexpr in C++17
+  constexpr InputIterator next(InputIterator x,
+typename iterator_traits<InputIterator>::difference_type n = 1);
+
+template <class BidirectionalIterator>  // constexpr in C++17
+  constexpr BidirectionalIterator prev(BidirectionalIterator x,
+    typename iterator_traits<BidirectionalIterator>::difference_type n = 1);
+
+// [range.iter.ops], range iterator operations
+namespace ranges {
+  // [range.iter.op.advance], ranges::advance
+  template<input_or_output_iterator I>
+    constexpr void advance(I& i, iter_difference_t<I> n);                          // since C++20
+  template<input_or_output_iterator I, sentinel_for<I> S>
+    constexpr void advance(I& i, S bound);                                         // since C++20
+  template<input_or_output_iterator I, sentinel_for<I> S>
+    constexpr iter_difference_t<I> advance(I& i, iter_difference_t<I> n, S bound); // since C++20
+}
+
+template <class Iterator>
+class reverse_iterator
+    : public iterator<typename iterator_traits<Iterator>::iterator_category, // until C++17
+                      typename iterator_traits<Iterator>::value_type,
+                      typename iterator_traits<Iterator>::difference_type,
+                      typename iterator_traits<Iterator>::pointer,
+                      typename iterator_traits<Iterator>::reference>
+{
+protected:
+    Iterator current;
+public:
+    using iterator_type     = Iterator;
+    using iterator_concept  = see below; // since C++20
+    using iterator_category = typename iterator_traits<Iterator>::iterator_category; // since C++17, until C++20
+    using iterator_category = see below; // since C++20
+    using value_type        = typename iterator_traits<Iterator>::value_type; // since C++17, until C++20
+    using value_type        = iter_value_t<Iterator>; // since C++20
+    using difference_type   = typename iterator_traits<Iterator>::difference_type; // until C++20
+    using difference_type   = iter_difference_t<Iterator>; // since C++20
+    using pointer           = typename iterator_traits<Iterator>::pointer;
+    using reference         = typename iterator_traits<Iterator>::reference; // until C++20
+    using reference         = iter_reference_t<Iterator>; // since C++20
+
+    constexpr reverse_iterator();
+    constexpr explicit reverse_iterator(Iterator x);
+    template <class U> constexpr reverse_iterator(const reverse_iterator<U>& u);
+    template <class U> constexpr reverse_iterator& operator=(const reverse_iterator<U>& u);
+    constexpr Iterator base() const;
+    constexpr reference operator*() const;
+    constexpr pointer   operator->() const; // until C++20
+    constexpr pointer   operator->() const requires see below; // since C++20
+    constexpr reverse_iterator& operator++();
+    constexpr reverse_iterator  operator++(int);
+    constexpr reverse_iterator& operator--();
+    constexpr reverse_iterator  operator--(int);
+    constexpr reverse_iterator  operator+ (difference_type n) const;
+    constexpr reverse_iterator& operator+=(difference_type n);
+    constexpr reverse_iterator  operator- (difference_type n) const;
+    constexpr reverse_iterator& operator-=(difference_type n);
+    constexpr unspecified       operator[](difference_type n) const;
+
+    friend constexpr iter_rvalue_reference_t<Iterator>
+      iter_move(const reverse_iterator& i) noexcept(see below);
+    template<indirectly_swappable<Iterator> Iterator2>
+      friend constexpr void
+        iter_swap(const reverse_iterator& x,
+                  const reverse_iterator<Iterator2>& y) noexcept(see below);
+};
+
+template <class Iterator1, class Iterator2>
+constexpr bool                          // constexpr in C++17
+operator==(const reverse_iterator<Iterator1>& x, const reverse_iterator<Iterator2>& y);
+
+template <class Iterator1, class Iterator2>
+constexpr bool                          // constexpr in C++17
+operator!=(const reverse_iterator<Iterator1>& x, const reverse_iterator<Iterator2>& y);
+
+template <class Iterator1, class Iterator2>
+constexpr bool                          // constexpr in C++17
+operator<(const reverse_iterator<Iterator1>& x, const reverse_iterator<Iterator2>& y);
+
+template <class Iterator1, class Iterator2>
+constexpr bool                          // constexpr in C++17
+operator>(const reverse_iterator<Iterator1>& x, const reverse_iterator<Iterator2>& y);
+
+template <class Iterator1, class Iterator2>
+constexpr bool                          // constexpr in C++17
+operator<=(const reverse_iterator<Iterator1>& x, const reverse_iterator<Iterator2>& y);
+
+template <class Iterator1, class Iterator2>
+constexpr bool                          // constexpr in C++17
+operator>=(const reverse_iterator<Iterator1>& x, const reverse_iterator<Iterator2>& y);
+
+template<class Iterator1, three_way_comparable_with<Iterator1> Iterator2>
+  constexpr compare_three_way_result_t<Iterator1, Iterator2>
+    operator<=>(const reverse_iterator<Iterator1>& x,
+                const reverse_iterator<Iterator2>& y);
+
+template <class Iterator1, class Iterator2>
+constexpr auto
+operator-(const reverse_iterator<Iterator1>& x, const reverse_iterator<Iterator2>& y)
+-> decltype(__y.base() - __x.base());   // constexpr in C++17
+
+template <class Iterator>
+constexpr reverse_iterator<Iterator>
+operator+(typename reverse_iterator<Iterator>::difference_type n,
+          const reverse_iterator<Iterator>& x);   // constexpr in C++17
+
+template <class Iterator>
+constexpr reverse_iterator<Iterator> make_reverse_iterator(Iterator i); // C++14, constexpr in C++17
+
+template<class Iterator1, class Iterator2>
+    requires (!sized_sentinel_for<Iterator1, Iterator2>)
+  inline constexpr bool disable_sized_sentinel_for<reverse_iterator<Iterator1>,
+                                                   reverse_iterator<Iterator2>> = true;
+
+template <class Container>
+class back_insert_iterator
+    : public iterator<output_iterator_tag, void, void, void, void> // until C++17
+{
+protected:
+    Container* container;
+public:
+    typedef Container                   container_type;
+    typedef void                        value_type;
+    typedef void                        difference_type; // until C++20
+    typedef ptrdiff_t                   difference_type; // since C++20
+    typedef void                        reference;
+    typedef void                        pointer;
+
+    explicit back_insert_iterator(Container& x);  // constexpr in C++20
+    back_insert_iterator& operator=(const typename Container::value_type& value);  // constexpr in C++20
+    back_insert_iterator& operator*();  // constexpr in C++20
+    back_insert_iterator& operator++();  // constexpr in C++20
+    back_insert_iterator  operator++(int);  // constexpr in C++20
+};
+
+template <class Container> back_insert_iterator<Container> back_inserter(Container& x);  // constexpr in C++20
+
+template <class Container>
+class front_insert_iterator
+    : public iterator<output_iterator_tag, void, void, void, void> // until C++17
+{
+protected:
+    Container* container;
+public:
+    typedef Container                    container_type;
+    typedef void                         value_type;
+    typedef void                         difference_type; // until C++20
+    typedef ptrdiff_t                    difference_type; // since C++20
+    typedef void                         reference;
+    typedef void                         pointer;
+
+    explicit front_insert_iterator(Container& x);  // constexpr in C++20
+    front_insert_iterator& operator=(const typename Container::value_type& value);  // constexpr in C++20
+    front_insert_iterator& operator*();  // constexpr in C++20
+    front_insert_iterator& operator++();  // constexpr in C++20
+    front_insert_iterator  operator++(int);  // constexpr in C++20
+};
+
+template <class Container> front_insert_iterator<Container> front_inserter(Container& x);  // constexpr in C++20
+
+template <class Container>
+class insert_iterator
+    : public iterator<output_iterator_tag, void, void, void, void> // until C++17
+{
+protected:
+    Container* container;
+    typename Container::iterator iter;
+public:
+    typedef Container              container_type;
+    typedef void                   value_type;
+    typedef void                   difference_type; // until C++20
+    typedef ptrdiff_t              difference_type; // since C++20
+    typedef void                   reference;
+    typedef void                   pointer;
+
+    insert_iterator(Container& x, typename Container::iterator i);  // constexpr in C++20
+    insert_iterator& operator=(const typename Container::value_type& value);  // constexpr in C++20
+    insert_iterator& operator*();  // constexpr in C++20
+    insert_iterator& operator++();  // constexpr in C++20
+    insert_iterator& operator++(int);  // constexpr in C++20
+};
+
+template <class Container>
+insert_iterator<Container> inserter(Container& x, typename Container::iterator i);  // until C++20
+template <class Container>
+constexpr insert_iterator<Container> inserter(Container& x, ranges::iterator_t<Container> i);  // since C++20
+
+template <class Iterator>
+class move_iterator {
+public:
+    using iterator_type     = Iterator;
+    using iterator_concept  = input_iterator_tag; // From C++20
+    using iterator_category = see below; // not always present starting from C++20
+    using value_type        = iter_value_t<Iterator>; // Until C++20, iterator_traits<Iterator>::value_type
+    using difference_type   = iter_difference_t<Iterator>; // Until C++20, iterator_traits<Iterator>::difference_type;
+    using pointer           = Iterator;
+    using reference         = iter_rvalue_reference_t<Iterator>; // Until C++20, value_type&&
+
+    constexpr move_iterator();  // all the constexprs are in C++17
+    constexpr explicit move_iterator(Iterator i);
+    template <class U>
+      constexpr move_iterator(const move_iterator<U>& u);
+    template <class U>
+      constexpr move_iterator& operator=(const move_iterator<U>& u);
+
+    constexpr iterator_type base() const; // Until C++20
+    constexpr const Iterator& base() const & noexcept; // From C++20
+    constexpr Iterator base() &&; // From C++20
+
+    constexpr reference operator*() const;
+    constexpr pointer operator->() const; // Deprecated in C++20
+    constexpr move_iterator& operator++();
+    constexpr auto operator++(int); // Return type was move_iterator until C++20
+    constexpr move_iterator& operator--();
+    constexpr move_iterator operator--(int);
+    constexpr move_iterator operator+(difference_type n) const;
+    constexpr move_iterator& operator+=(difference_type n);
+    constexpr move_iterator operator-(difference_type n) const;
+    constexpr move_iterator& operator-=(difference_type n);
+    constexpr reference operator[](difference_type n) const; // Return type unspecified until C++20
+
+    template<sentinel_for<Iterator> S>
+      friend constexpr bool
+        operator==(const move_iterator& x, const move_sentinel<S>& y); // Since C++20
+    template<sized_sentinel_for<Iterator> S>
+      friend constexpr iter_difference_t<Iterator>
+        operator-(const move_sentinel<S>& x, const move_iterator& y); // Since C++20
+    template<sized_sentinel_for<Iterator> S>
+      friend constexpr iter_difference_t<Iterator>
+        operator-(const move_iterator& x, const move_sentinel<S>& y); // Since C++20
+    friend constexpr iter_rvalue_reference_t<Iterator>
+      iter_move(const move_iterator& i)
+        noexcept(noexcept(ranges::iter_move(i.current))); // Since C++20
+    template<indirectly_swappable<Iterator> Iterator2>
+      friend constexpr void
+        iter_swap(const move_iterator& x, const move_iterator<Iterator2>& y)
+          noexcept(noexcept(ranges::iter_swap(x.current, y.current))); // Since C++20
+
+private:
+    Iterator current; // exposition only
+};
+
+template <class Iterator1, class Iterator2>
+constexpr bool   // constexpr in C++17
+operator==(const move_iterator<Iterator1>& x, const move_iterator<Iterator2>& y);
+
+template <class Iterator1, class Iterator2>
+constexpr bool   // constexpr in C++17
+operator!=(const move_iterator<Iterator1>& x, const move_iterator<Iterator2>& y);
+
+template <class Iterator1, class Iterator2>
+constexpr bool   // constexpr in C++17
+operator<(const move_iterator<Iterator1>& x, const move_iterator<Iterator2>& y);
+
+template <class Iterator1, class Iterator2>
+constexpr bool   // constexpr in C++17
+operator<=(const move_iterator<Iterator1>& x, const move_iterator<Iterator2>& y);
+
+template <class Iterator1, class Iterator2>
+constexpr bool   // constexpr in C++17
+operator>(const move_iterator<Iterator1>& x, const move_iterator<Iterator2>& y);
+
+template <class Iterator1, class Iterator2>
+constexpr bool   // constexpr in C++17
+operator>=(const move_iterator<Iterator1>& x, const move_iterator<Iterator2>& y);
+
+template <class Iterator1, class Iterator2>
+constexpr auto   // constexpr in C++17
+operator-(const move_iterator<Iterator1>& x,
+          const move_iterator<Iterator2>& y) -> decltype(x.base() - y.base());
+
+template <class Iterator>
+constexpr move_iterator<Iterator> operator+(   // constexpr in C++17
+            typename move_iterator<Iterator>::difference_type n,
+            const move_iterator<Iterator>& x);
+
+template <class Iterator>   // constexpr in C++17
+constexpr  move_iterator<Iterator> make_move_iterator(const Iterator& i);
+
+template<semiregular S>
+class move_sentinel {
+public:
+  constexpr move_sentinel();
+  constexpr explicit move_sentinel(S s);
+  template<class S2>
+    requires convertible_to<const S2&, S>
+      constexpr move_sentinel(const move_sentinel<S2>& s);
+  template<class S2>
+    requires assignable_from<S&, const S2&>
+      constexpr move_sentinel& operator=(const move_sentinel<S2>& s);
+
+  constexpr S base() const;
+private:
+  S last;     // exposition only
+};
+
+// [default.sentinel], default sentinel
+struct default_sentinel_t;
+inline constexpr default_sentinel_t default_sentinel{};
+
+// [iterators.counted], counted iterators
+template<input_or_output_iterator I> class counted_iterator;
+
+template<input_iterator I>
+  requires see below
+  struct iterator_traits<counted_iterator<I>>;
+
+// [unreachable.sentinel], unreachable sentinel
+struct unreachable_sentinel_t;
+inline constexpr unreachable_sentinel_t unreachable_sentinel{};
+
+template <class T, class charT = char, class traits = char_traits<charT>, class Distance = ptrdiff_t>
+class istream_iterator
+    : public iterator<input_iterator_tag, T, Distance, const T*, const T&> // until C++17
+{
+public:
+    typedef input_iterator_tag           iterator_category;
+    typedef T                            value_type;
+    typedef Distance                     difference_type;
+    typedef const T*                     pointer;
+    typedef const T&                     reference;
+
+    typedef charT                        char_type;
+    typedef traits                       traits_type;
+    typedef basic_istream<charT, traits> istream_type;
+
+    istream_iterator(); // constexpr since C++11
+    constexpr istream_iterator(default_sentinel_t); // since C++20
+    istream_iterator(istream_type& s);
+    istream_iterator(const istream_iterator& x);
+    ~istream_iterator();
+
+    const T& operator*() const;
+    const T* operator->() const;
+    istream_iterator& operator++();
+    istream_iterator  operator++(int);
+    friend bool operator==(const istream_iterator& i, default_sentinel_t); // since C++20
+};
+
+template <class T, class charT, class traits, class Distance>
+bool operator==(const istream_iterator<T,charT,traits,Distance>& x,
+                const istream_iterator<T,charT,traits,Distance>& y);
+template <class T, class charT, class traits, class Distance>
+bool operator!=(const istream_iterator<T,charT,traits,Distance>& x,
+                const istream_iterator<T,charT,traits,Distance>& y); // until C++20
+
+template <class T, class charT = char, class traits = char_traits<charT> >
+class ostream_iterator
+    : public iterator<output_iterator_tag, void, void, void, void> // until C++17
+{
+public:
+    typedef output_iterator_tag         iterator_category;
+    typedef void                        value_type;
+    typedef void                        difference_type; // until C++20
+    typedef ptrdiff_t                   difference_type; // since C++20
+    typedef void                        pointer;
+    typedef void                        reference;
+
+    typedef charT char_type;
+    typedef traits traits_type;
+    typedef basic_ostream<charT,traits> ostream_type;
+
+    ostream_iterator(ostream_type& s);
+    ostream_iterator(ostream_type& s, const charT* delimiter);
+    ostream_iterator(const ostream_iterator& x);
+    ~ostream_iterator();
+    ostream_iterator& operator=(const T& value);
+
+    ostream_iterator& operator*();
+    ostream_iterator& operator++();
+    ostream_iterator& operator++(int);
+};
+
+template<class charT, class traits = char_traits<charT> >
+class istreambuf_iterator
+    : public iterator<input_iterator_tag, charT, traits::off_type, unspecified, charT> // until C++17
+{
+public:
+    typedef input_iterator_tag              iterator_category;
+    typedef charT                           value_type;
+    typedef traits::off_type                difference_type;
+    typedef unspecified                     pointer;
+    typedef charT                           reference;
+
+    typedef charT                           char_type;
+    typedef traits                          traits_type;
+    typedef traits::int_type                int_type;
+    typedef basic_streambuf<charT, traits>  streambuf_type;
+    typedef basic_istream<charT, traits>    istream_type;
+
+    istreambuf_iterator() noexcept; // constexpr since C++11
+    constexpr istreambuf_iterator(default_sentinel_t) noexcept; // since C++20
+    istreambuf_iterator(istream_type& s) noexcept;
+    istreambuf_iterator(streambuf_type* s) noexcept;
+    istreambuf_iterator(a-private-type) noexcept;
+
+    charT                operator*() const;
+    pointer operator->() const;
+    istreambuf_iterator& operator++();
+    a-private-type       operator++(int);
+
+    bool equal(const istreambuf_iterator& b) const;
+    friend bool operator==(const istreambuf_iterator& i, default_sentinel_t s); // since C++20
+};
+
+template <class charT, class traits>
+bool operator==(const istreambuf_iterator<charT,traits>& a,
+                const istreambuf_iterator<charT,traits>& b);
+template <class charT, class traits>
+bool operator!=(const istreambuf_iterator<charT,traits>& a,
+                const istreambuf_iterator<charT,traits>& b); // until C++20
+
+template <class charT, class traits = char_traits<charT> >
+class ostreambuf_iterator
+    : public iterator<output_iterator_tag, void, void, void, void> // until C++17
+{
+public:
+    typedef output_iterator_tag            iterator_category;
+    typedef void                           value_type;
+    typedef void                           difference_type; // until C++20
+    typedef ptrdiff_t                      difference_type; // since C++20
+    typedef void                           pointer;
+    typedef void                           reference;
+
+    typedef charT                          char_type;
+    typedef traits                         traits_type;
+    typedef basic_streambuf<charT, traits> streambuf_type;
+    typedef basic_ostream<charT, traits>   ostream_type;
+
+    ostreambuf_iterator(ostream_type& s) noexcept;
+    ostreambuf_iterator(streambuf_type* s) noexcept;
+    ostreambuf_iterator& operator=(charT c);
+    ostreambuf_iterator& operator*();
+    ostreambuf_iterator& operator++();
+    ostreambuf_iterator& operator++(int);
+    bool failed() const noexcept;
+};
+
+template <class C> constexpr auto begin(C& c) -> decltype(c.begin());
+template <class C> constexpr auto begin(const C& c) -> decltype(c.begin());
+template <class C> constexpr auto end(C& c) -> decltype(c.end());
+template <class C> constexpr auto end(const C& c) -> decltype(c.end());
+template <class T, size_t N> constexpr T* begin(T (&array)[N]);
+template <class T, size_t N> constexpr T* end(T (&array)[N]);
+
+template <class C> auto constexpr cbegin(const C& c) -> decltype(std::begin(c));        // C++14
+template <class C> auto constexpr cend(const C& c) -> decltype(std::end(c));            // C++14
+template <class C> auto constexpr rbegin(C& c) -> decltype(c.rbegin());                 // C++14
+template <class C> auto constexpr rbegin(const C& c) -> decltype(c.rbegin());           // C++14
+template <class C> auto constexpr rend(C& c) -> decltype(c.rend());                     // C++14
+template <class C> constexpr auto rend(const C& c) -> decltype(c.rend());               // C++14
+template <class E> reverse_iterator<const E*> constexpr rbegin(initializer_list<E> il); // C++14
+template <class E> reverse_iterator<const E*> constexpr rend(initializer_list<E> il);   // C++14
+template <class T, size_t N> reverse_iterator<T*> constexpr rbegin(T (&array)[N]);      // C++14
+template <class T, size_t N> reverse_iterator<T*> constexpr rend(T (&array)[N]);        // C++14
+template <class C> constexpr auto crbegin(const C& c) -> decltype(std::rbegin(c));      // C++14
+template <class C> constexpr auto crend(const C& c) -> decltype(std::rend(c));          // C++14
+
+// 24.8, container access:
+template <class C> constexpr auto size(const C& c) -> decltype(c.size());         // C++17
+template <class T, size_t N> constexpr size_t size(const T (&array)[N]) noexcept; // C++17
+
+template <class C> constexpr auto ssize(const C& c)
+    -> common_type_t<ptrdiff_t, make_signed_t<decltype(c.size())>>;                    // C++20
+template <class T, ptrdiff_t> constexpr ptrdiff_t ssize(const T (&array)[N]) noexcept; // C++20
+
+template <class C> constexpr auto empty(const C& c) -> decltype(c.empty());       // C++17
+template <class T, size_t N> constexpr bool empty(const T (&array)[N]) noexcept;  // C++17
+template <class E> constexpr bool empty(initializer_list<E> il) noexcept;         // C++17
+template <class C> constexpr auto data(C& c) -> decltype(c.data());               // C++17
+template <class C> constexpr auto data(const C& c) -> decltype(c.data());         // C++17
+template <class T, size_t N> constexpr T* data(T (&array)[N]) noexcept;           // C++17
+template <class E> constexpr const E* data(initializer_list<E> il) noexcept;      // C++17
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__debug>
+#include <__iterator/access.h>
+#include <__iterator/advance.h>
+#include <__iterator/back_insert_iterator.h>
+#include <__iterator/bounded_iter.h>
+#include <__iterator/common_iterator.h>
+#include <__iterator/concepts.h>
+#include <__iterator/counted_iterator.h>
+#include <__iterator/data.h>
+#include <__iterator/default_sentinel.h>
+#include <__iterator/distance.h>
+#include <__iterator/empty.h>
+#include <__iterator/erase_if_container.h>
+#include <__iterator/front_insert_iterator.h>
+#include <__iterator/incrementable_traits.h>
+#include <__iterator/indirectly_comparable.h>
+#include <__iterator/insert_iterator.h>
+#include <__iterator/istream_iterator.h>
+#include <__iterator/istreambuf_iterator.h>
+#include <__iterator/iter_move.h>
+#include <__iterator/iter_swap.h>
+#include <__iterator/iterator.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/mergeable.h>
+#include <__iterator/move_iterator.h>
+#include <__iterator/move_sentinel.h>
+#include <__iterator/next.h>
+#include <__iterator/ostream_iterator.h>
+#include <__iterator/ostreambuf_iterator.h>
+#include <__iterator/permutable.h>
+#include <__iterator/prev.h>
+#include <__iterator/projected.h>
+#include <__iterator/readable_traits.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/reverse_iterator.h>
+#include <__iterator/size.h>
+#include <__iterator/sortable.h>
+#include <__iterator/unreachable_sentinel.h>
+#include <__iterator/wrap_iter.h>
+#include <__memory/addressof.h>
+#include <__memory/pointer_traits.h>
+#include <cstddef>
+#include <initializer_list>
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.synopsis]
+#include <compare>
+#include <concepts>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <exception>
+#  include <new>
+#  include <type_traits>
+#  include <typeinfo>
+#  include <utility>
+#endif
+
+#endif // _LIBCPP_ITERATOR
diff --git a/app/src/main/cpp/libcxx/include/latch b/app/src/main/cpp/libcxx/include/latch
new file mode 100644
index 0000000..ff17f84
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/latch
@@ -0,0 +1,114 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_LATCH
+#define _LIBCPP_LATCH
+
+/*
+    latch synopsis
+
+namespace std
+{
+
+  class latch
+  {
+  public:
+    static constexpr ptrdiff_t max() noexcept;
+
+    constexpr explicit latch(ptrdiff_t __expected);
+    ~latch();
+
+    latch(const latch&) = delete;
+    latch& operator=(const latch&) = delete;
+
+    void count_down(ptrdiff_t __update = 1);
+    bool try_wait() const noexcept;
+    void wait() const;
+    void arrive_and_wait(ptrdiff_t __update = 1);
+
+  private:
+    ptrdiff_t __counter; // exposition only
+  };
+
+}
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__config>
+#include <atomic>
+#include <limits>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifdef _LIBCPP_HAS_NO_THREADS
+# error "<latch> is not supported since libc++ has been configured without support for threads."
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+#if _LIBCPP_STD_VER >= 14
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+class latch
+{
+    __atomic_base<ptrdiff_t> __a_;
+
+public:
+    static constexpr ptrdiff_t max() noexcept {
+        return numeric_limits<ptrdiff_t>::max();
+    }
+
+    inline _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit latch(ptrdiff_t __expected) : __a_(__expected) { }
+
+    ~latch() = default;
+    latch(const latch&) = delete;
+    latch& operator=(const latch&) = delete;
+
+    inline _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void count_down(ptrdiff_t __update = 1)
+    {
+        auto const __old = __a_.fetch_sub(__update, memory_order_release);
+        if(__old == __update)
+            __a_.notify_all();
+    }
+    inline _LIBCPP_INLINE_VISIBILITY
+    bool try_wait() const noexcept
+    {
+        return 0 == __a_.load(memory_order_acquire);
+    }
+    inline _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void wait() const
+    {
+        __cxx_atomic_wait(&__a_.__a_, [&]() -> bool {
+            return try_wait();
+        });
+    }
+    inline _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void arrive_and_wait(ptrdiff_t __update = 1)
+    {
+        count_down(__update);
+        wait();
+    }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 14
+
+_LIBCPP_POP_MACROS
+
+#endif //_LIBCPP_LATCH
diff --git a/app/src/main/cpp/libcxx/include/libcxx.imp b/app/src/main/cpp/libcxx/include/libcxx.imp
new file mode 100644
index 0000000..575ce0f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/libcxx.imp
@@ -0,0 +1,45 @@
+[
+  { include: [ "<__hash_table>", "private", "<unordered_map>", "public" ] },
+  { include: [ "<__hash_table>", "private", "<unordered_set>", "public" ] },
+  { include: [ "<__locale>", "private", "<locale>", "public" ] },
+  { include: [ "<__node_handle>", "private", "<map>", "public" ] },
+  { include: [ "<__node_handle>", "private", "<set>", "public" ] },
+  { include: [ "<__node_handle>", "private", "<unordered_map>", "public" ] },
+  { include: [ "<__node_handle>", "private", "<unordered_set>", "public" ] },
+  { include: [ "<__split_buffer>", "private", "<deque>", "public" ] },
+  { include: [ "<__split_buffer>", "private", "<vector>", "public" ] },
+  { include: [ "<__std_stream>", "private", "<iostream>", "public" ] },
+  { include: [ "<__threading_support>", "private", "<atomic>", "public" ] },
+  { include: [ "<__threading_support>", "private", "<mutex>", "public" ] },
+  { include: [ "<__threading_support>", "private", "<semaphore>", "public" ] },
+  { include: [ "<__threading_support>", "private", "<thread>", "public" ] },
+  { include: [ "<__tree>", "private", "<map>", "public" ] },
+  { include: [ "<__tree>", "private", "<set>", "public" ] },
+  { include: [ "@<__algorithm/.*>", "private", "<algorithm>", "public" ] },
+  { include: [ "@<__bit/.*>", "private", "<bit>", "public" ] },
+  { include: [ "@<__charconv/.*>", "private", "<charconv>", "public" ] },
+  { include: [ "@<__chrono/.*>", "private", "<chrono>", "public" ] },
+  { include: [ "@<__compare/.*>", "private", "<compare>", "public" ] },
+  { include: [ "@<__concepts/.*>", "private", "<concepts>", "public" ] },
+  { include: [ "@<__coroutine/.*>", "private", "<coroutine>", "public" ] },
+  { include: [ "@<__debug_utils/.*>", "private", "<debug_utils>", "public" ] },
+  { include: [ "@<__expected/.*>", "private", "<expected>", "public" ] },
+  { include: [ "@<__filesystem/.*>", "private", "<filesystem>", "public" ] },
+  { include: [ "@<__format/.*>", "private", "<format>", "public" ] },
+  { include: [ "@<__functional/.*>", "private", "<functional>", "public" ] },
+  { include: [ "@<__fwd/.*>", "private", "<fwd>", "public" ] },
+  { include: [ "@<__ios/.*>", "private", "<ios>", "public" ] },
+  { include: [ "@<__iterator/.*>", "private", "<iterator>", "public" ] },
+  { include: [ "@<__memory/.*>", "private", "<memory>", "public" ] },
+  { include: [ "@<__memory_resource/.*>", "private", "<memory_resource>", "public" ] },
+  { include: [ "@<__numeric/.*>", "private", "<numeric>", "public" ] },
+  { include: [ "@<__random/.*>", "private", "<random>", "public" ] },
+  { include: [ "@<__ranges/.*>", "private", "<ranges>", "public" ] },
+  { include: [ "@<__string/.*>", "private", "<string>", "public" ] },
+  { include: [ "@<__support/.*>", "private", "<support>", "public" ] },
+  { include: [ "@<__thread/.*>", "private", "<thread>", "public" ] },
+  { include: [ "@<__tuple_dir/.*>", "private", "<tuple>", "public" ] },
+  { include: [ "@<__type_traits/.*>", "private", "<type_traits>", "public" ] },
+  { include: [ "@<__utility/.*>", "private", "<utility>", "public" ] },
+  { include: [ "@<__variant/.*>", "private", "<variant>", "public" ] },
+]
diff --git a/app/src/main/cpp/libcxx/include/limits b/app/src/main/cpp/libcxx/include/limits
new file mode 100644
index 0000000..9f5949e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/limits
@@ -0,0 +1,830 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_LIMITS
+#define _LIBCPP_LIMITS
+
+/*
+    limits synopsis
+
+namespace std
+{
+
+template<class T>
+class numeric_limits
+{
+public:
+    static constexpr bool is_specialized = false;
+    static constexpr T min() noexcept;
+    static constexpr T max() noexcept;
+    static constexpr T lowest() noexcept;
+
+    static constexpr int  digits = 0;
+    static constexpr int  digits10 = 0;
+    static constexpr int  max_digits10 = 0;
+    static constexpr bool is_signed = false;
+    static constexpr bool is_integer = false;
+    static constexpr bool is_exact = false;
+    static constexpr int  radix = 0;
+    static constexpr T epsilon() noexcept;
+    static constexpr T round_error() noexcept;
+
+    static constexpr int  min_exponent = 0;
+    static constexpr int  min_exponent10 = 0;
+    static constexpr int  max_exponent = 0;
+    static constexpr int  max_exponent10 = 0;
+
+    static constexpr bool has_infinity = false;
+    static constexpr bool has_quiet_NaN = false;
+    static constexpr bool has_signaling_NaN = false;
+    static constexpr float_denorm_style has_denorm = denorm_absent;
+    static constexpr bool has_denorm_loss = false;
+    static constexpr T infinity() noexcept;
+    static constexpr T quiet_NaN() noexcept;
+    static constexpr T signaling_NaN() noexcept;
+    static constexpr T denorm_min() noexcept;
+
+    static constexpr bool is_iec559 = false;
+    static constexpr bool is_bounded = false;
+    static constexpr bool is_modulo = false;
+
+    static constexpr bool traps = false;
+    static constexpr bool tinyness_before = false;
+    static constexpr float_round_style round_style = round_toward_zero;
+};
+
+enum float_round_style
+{
+    round_indeterminate       = -1,
+    round_toward_zero         =  0,
+    round_to_nearest          =  1,
+    round_toward_infinity     =  2,
+    round_toward_neg_infinity =  3
+};
+
+enum float_denorm_style
+{
+    denorm_indeterminate = -1,
+    denorm_absent = 0,
+    denorm_present = 1
+};
+
+template<> class numeric_limits<cv bool>;
+
+template<> class numeric_limits<cv char>;
+template<> class numeric_limits<cv signed char>;
+template<> class numeric_limits<cv unsigned char>;
+template<> class numeric_limits<cv wchar_t>;
+template<> class numeric_limits<cv char8_t>; // C++20
+template<> class numeric_limits<cv char16_t>;
+template<> class numeric_limits<cv char32_t>;
+
+template<> class numeric_limits<cv short>;
+template<> class numeric_limits<cv int>;
+template<> class numeric_limits<cv long>;
+template<> class numeric_limits<cv long long>;
+template<> class numeric_limits<cv unsigned short>;
+template<> class numeric_limits<cv unsigned int>;
+template<> class numeric_limits<cv unsigned long>;
+template<> class numeric_limits<cv unsigned long long>;
+
+template<> class numeric_limits<cv float>;
+template<> class numeric_limits<cv double>;
+template<> class numeric_limits<cv long double>;
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__type_traits/is_arithmetic.h>
+#include <__type_traits/is_signed.h>
+#include <__type_traits/remove_cv.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+#include <version>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+enum float_round_style
+{
+    round_indeterminate       = -1,
+    round_toward_zero         =  0,
+    round_to_nearest          =  1,
+    round_toward_infinity     =  2,
+    round_toward_neg_infinity =  3
+};
+
+enum float_denorm_style
+{
+    denorm_indeterminate = -1,
+    denorm_absent = 0,
+    denorm_present = 1
+};
+
+template <class _Tp, bool = is_arithmetic<_Tp>::value>
+class __libcpp_numeric_limits
+{
+protected:
+    typedef _Tp type;
+
+    static _LIBCPP_CONSTEXPR const  bool is_specialized = false;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type min() _NOEXCEPT {return type();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type max() _NOEXCEPT {return type();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type lowest() _NOEXCEPT {return type();}
+
+    static _LIBCPP_CONSTEXPR const int  digits = 0;
+    static _LIBCPP_CONSTEXPR const int  digits10 = 0;
+    static _LIBCPP_CONSTEXPR const int  max_digits10 = 0;
+    static _LIBCPP_CONSTEXPR const bool is_signed = false;
+    static _LIBCPP_CONSTEXPR const bool is_integer = false;
+    static _LIBCPP_CONSTEXPR const bool is_exact = false;
+    static _LIBCPP_CONSTEXPR const int  radix = 0;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type epsilon() _NOEXCEPT {return type();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type round_error() _NOEXCEPT {return type();}
+
+    static _LIBCPP_CONSTEXPR const int  min_exponent = 0;
+    static _LIBCPP_CONSTEXPR const int  min_exponent10 = 0;
+    static _LIBCPP_CONSTEXPR const int  max_exponent = 0;
+    static _LIBCPP_CONSTEXPR const int  max_exponent10 = 0;
+
+    static _LIBCPP_CONSTEXPR const bool has_infinity = false;
+    static _LIBCPP_CONSTEXPR const bool has_quiet_NaN = false;
+    static _LIBCPP_CONSTEXPR const bool has_signaling_NaN = false;
+    static _LIBCPP_CONSTEXPR const float_denorm_style has_denorm = denorm_absent;
+    static _LIBCPP_CONSTEXPR const bool has_denorm_loss = false;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type infinity() _NOEXCEPT {return type();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type quiet_NaN() _NOEXCEPT {return type();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type signaling_NaN() _NOEXCEPT {return type();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type denorm_min() _NOEXCEPT {return type();}
+
+    static _LIBCPP_CONSTEXPR const bool is_iec559 = false;
+    static _LIBCPP_CONSTEXPR const bool is_bounded = false;
+    static _LIBCPP_CONSTEXPR const bool is_modulo = false;
+
+    static _LIBCPP_CONSTEXPR const bool traps = false;
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = false;
+    static _LIBCPP_CONSTEXPR const float_round_style round_style = round_toward_zero;
+};
+
+template <class _Tp, int __digits, bool _IsSigned>
+struct __libcpp_compute_min
+{
+    static _LIBCPP_CONSTEXPR const _Tp value = _Tp(_Tp(1) << __digits);
+};
+
+template <class _Tp, int __digits>
+struct __libcpp_compute_min<_Tp, __digits, false>
+{
+    static _LIBCPP_CONSTEXPR const _Tp value = _Tp(0);
+};
+
+template <class _Tp>
+class __libcpp_numeric_limits<_Tp, true>
+{
+protected:
+    typedef _Tp type;
+
+    static _LIBCPP_CONSTEXPR const bool is_specialized = true;
+
+    static _LIBCPP_CONSTEXPR const bool is_signed = type(-1) < type(0);
+    static _LIBCPP_CONSTEXPR const int  digits = static_cast<int>(sizeof(type) * __CHAR_BIT__ - is_signed);
+    static _LIBCPP_CONSTEXPR const int  digits10 = digits * 3 / 10;
+    static _LIBCPP_CONSTEXPR const int  max_digits10 = 0;
+    static _LIBCPP_CONSTEXPR const type __min = __libcpp_compute_min<type, digits, is_signed>::value;
+    static _LIBCPP_CONSTEXPR const type __max = is_signed ? type(type(~0) ^ __min) : type(~0);
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type min() _NOEXCEPT {return __min;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type max() _NOEXCEPT {return __max;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type lowest() _NOEXCEPT {return min();}
+
+    static _LIBCPP_CONSTEXPR const bool is_integer = true;
+    static _LIBCPP_CONSTEXPR const bool is_exact = true;
+    static _LIBCPP_CONSTEXPR const int  radix = 2;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type epsilon() _NOEXCEPT {return type(0);}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type round_error() _NOEXCEPT {return type(0);}
+
+    static _LIBCPP_CONSTEXPR const int  min_exponent = 0;
+    static _LIBCPP_CONSTEXPR const int  min_exponent10 = 0;
+    static _LIBCPP_CONSTEXPR const int  max_exponent = 0;
+    static _LIBCPP_CONSTEXPR const int  max_exponent10 = 0;
+
+    static _LIBCPP_CONSTEXPR const bool has_infinity = false;
+    static _LIBCPP_CONSTEXPR const bool has_quiet_NaN = false;
+    static _LIBCPP_CONSTEXPR const bool has_signaling_NaN = false;
+    static _LIBCPP_CONSTEXPR const float_denorm_style has_denorm = denorm_absent;
+    static _LIBCPP_CONSTEXPR const bool has_denorm_loss = false;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type infinity() _NOEXCEPT {return type(0);}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type quiet_NaN() _NOEXCEPT {return type(0);}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type signaling_NaN() _NOEXCEPT {return type(0);}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type denorm_min() _NOEXCEPT {return type(0);}
+
+    static _LIBCPP_CONSTEXPR const bool is_iec559 = false;
+    static _LIBCPP_CONSTEXPR const bool is_bounded = true;
+    static _LIBCPP_CONSTEXPR const bool is_modulo = !_VSTD::is_signed<_Tp>::value;
+
+#if defined(__i386__) || defined(__x86_64__) || defined(__pnacl__) || \
+    defined(__wasm__)
+    static _LIBCPP_CONSTEXPR const bool traps = true;
+#else
+    static _LIBCPP_CONSTEXPR const bool traps = false;
+#endif
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = false;
+    static _LIBCPP_CONSTEXPR const float_round_style round_style = round_toward_zero;
+};
+
+template <>
+class __libcpp_numeric_limits<bool, true>
+{
+protected:
+    typedef bool type;
+
+    static _LIBCPP_CONSTEXPR const bool is_specialized = true;
+
+    static _LIBCPP_CONSTEXPR const bool is_signed = false;
+    static _LIBCPP_CONSTEXPR const int  digits = 1;
+    static _LIBCPP_CONSTEXPR const int  digits10 = 0;
+    static _LIBCPP_CONSTEXPR const int  max_digits10 = 0;
+    static _LIBCPP_CONSTEXPR const type __min = false;
+    static _LIBCPP_CONSTEXPR const type __max = true;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type min() _NOEXCEPT {return __min;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type max() _NOEXCEPT {return __max;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type lowest() _NOEXCEPT {return min();}
+
+    static _LIBCPP_CONSTEXPR const bool is_integer = true;
+    static _LIBCPP_CONSTEXPR const bool is_exact = true;
+    static _LIBCPP_CONSTEXPR const int  radix = 2;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type epsilon() _NOEXCEPT {return type(0);}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type round_error() _NOEXCEPT {return type(0);}
+
+    static _LIBCPP_CONSTEXPR const int  min_exponent = 0;
+    static _LIBCPP_CONSTEXPR const int  min_exponent10 = 0;
+    static _LIBCPP_CONSTEXPR const int  max_exponent = 0;
+    static _LIBCPP_CONSTEXPR const int  max_exponent10 = 0;
+
+    static _LIBCPP_CONSTEXPR const bool has_infinity = false;
+    static _LIBCPP_CONSTEXPR const bool has_quiet_NaN = false;
+    static _LIBCPP_CONSTEXPR const bool has_signaling_NaN = false;
+    static _LIBCPP_CONSTEXPR const float_denorm_style has_denorm = denorm_absent;
+    static _LIBCPP_CONSTEXPR const bool has_denorm_loss = false;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type infinity() _NOEXCEPT {return type(0);}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type quiet_NaN() _NOEXCEPT {return type(0);}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type signaling_NaN() _NOEXCEPT {return type(0);}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type denorm_min() _NOEXCEPT {return type(0);}
+
+    static _LIBCPP_CONSTEXPR const bool is_iec559 = false;
+    static _LIBCPP_CONSTEXPR const bool is_bounded = true;
+    static _LIBCPP_CONSTEXPR const bool is_modulo = false;
+
+    static _LIBCPP_CONSTEXPR const bool traps = false;
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = false;
+    static _LIBCPP_CONSTEXPR const float_round_style round_style = round_toward_zero;
+};
+
+template <>
+class __libcpp_numeric_limits<float, true>
+{
+protected:
+    typedef float type;
+
+    static _LIBCPP_CONSTEXPR const bool is_specialized = true;
+
+    static _LIBCPP_CONSTEXPR const bool is_signed = true;
+    static _LIBCPP_CONSTEXPR const int  digits = __FLT_MANT_DIG__;
+    static _LIBCPP_CONSTEXPR const int  digits10 = __FLT_DIG__;
+    static _LIBCPP_CONSTEXPR const int  max_digits10 = 2+(digits * 30103l)/100000l;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type min() _NOEXCEPT {return __FLT_MIN__;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type max() _NOEXCEPT {return __FLT_MAX__;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type lowest() _NOEXCEPT {return -max();}
+
+    static _LIBCPP_CONSTEXPR const bool is_integer = false;
+    static _LIBCPP_CONSTEXPR const bool is_exact = false;
+    static _LIBCPP_CONSTEXPR const int  radix = __FLT_RADIX__;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type epsilon() _NOEXCEPT {return __FLT_EPSILON__;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type round_error() _NOEXCEPT {return 0.5F;}
+
+    static _LIBCPP_CONSTEXPR const int  min_exponent = __FLT_MIN_EXP__;
+    static _LIBCPP_CONSTEXPR const int  min_exponent10 = __FLT_MIN_10_EXP__;
+    static _LIBCPP_CONSTEXPR const int  max_exponent = __FLT_MAX_EXP__;
+    static _LIBCPP_CONSTEXPR const int  max_exponent10 = __FLT_MAX_10_EXP__;
+
+    static _LIBCPP_CONSTEXPR const bool has_infinity = true;
+    static _LIBCPP_CONSTEXPR const bool has_quiet_NaN = true;
+    static _LIBCPP_CONSTEXPR const bool has_signaling_NaN = true;
+    static _LIBCPP_CONSTEXPR const float_denorm_style has_denorm = denorm_present;
+    static _LIBCPP_CONSTEXPR const bool has_denorm_loss = false;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type infinity() _NOEXCEPT {return __builtin_huge_valf();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type quiet_NaN() _NOEXCEPT {return __builtin_nanf("");}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type signaling_NaN() _NOEXCEPT {return __builtin_nansf("");}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type denorm_min() _NOEXCEPT {return __FLT_DENORM_MIN__;}
+
+    static _LIBCPP_CONSTEXPR const bool is_iec559 = true;
+    static _LIBCPP_CONSTEXPR const bool is_bounded = true;
+    static _LIBCPP_CONSTEXPR const bool is_modulo = false;
+
+    static _LIBCPP_CONSTEXPR const bool traps = false;
+#if (defined(__arm__) || defined(__aarch64__))
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = true;
+#else
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = false;
+#endif
+    static _LIBCPP_CONSTEXPR const float_round_style round_style = round_to_nearest;
+};
+
+template <>
+class __libcpp_numeric_limits<double, true>
+{
+protected:
+    typedef double type;
+
+    static _LIBCPP_CONSTEXPR const bool is_specialized = true;
+
+    static _LIBCPP_CONSTEXPR const bool is_signed = true;
+    static _LIBCPP_CONSTEXPR const int  digits = __DBL_MANT_DIG__;
+    static _LIBCPP_CONSTEXPR const int  digits10 = __DBL_DIG__;
+    static _LIBCPP_CONSTEXPR const int  max_digits10 = 2+(digits * 30103l)/100000l;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type min() _NOEXCEPT {return __DBL_MIN__;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type max() _NOEXCEPT {return __DBL_MAX__;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type lowest() _NOEXCEPT {return -max();}
+
+    static _LIBCPP_CONSTEXPR const bool is_integer = false;
+    static _LIBCPP_CONSTEXPR const bool is_exact = false;
+    static _LIBCPP_CONSTEXPR const int  radix = __FLT_RADIX__;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type epsilon() _NOEXCEPT {return __DBL_EPSILON__;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type round_error() _NOEXCEPT {return 0.5;}
+
+    static _LIBCPP_CONSTEXPR const int  min_exponent = __DBL_MIN_EXP__;
+    static _LIBCPP_CONSTEXPR const int  min_exponent10 = __DBL_MIN_10_EXP__;
+    static _LIBCPP_CONSTEXPR const int  max_exponent = __DBL_MAX_EXP__;
+    static _LIBCPP_CONSTEXPR const int  max_exponent10 = __DBL_MAX_10_EXP__;
+
+    static _LIBCPP_CONSTEXPR const bool has_infinity = true;
+    static _LIBCPP_CONSTEXPR const bool has_quiet_NaN = true;
+    static _LIBCPP_CONSTEXPR const bool has_signaling_NaN = true;
+    static _LIBCPP_CONSTEXPR const float_denorm_style has_denorm = denorm_present;
+    static _LIBCPP_CONSTEXPR const bool has_denorm_loss = false;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type infinity() _NOEXCEPT {return __builtin_huge_val();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type quiet_NaN() _NOEXCEPT {return __builtin_nan("");}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type signaling_NaN() _NOEXCEPT {return __builtin_nans("");}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type denorm_min() _NOEXCEPT {return __DBL_DENORM_MIN__;}
+
+    static _LIBCPP_CONSTEXPR const bool is_iec559 = true;
+    static _LIBCPP_CONSTEXPR const bool is_bounded = true;
+    static _LIBCPP_CONSTEXPR const bool is_modulo = false;
+
+    static _LIBCPP_CONSTEXPR const bool traps = false;
+#if (defined(__arm__) || defined(__aarch64__))
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = true;
+#else
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = false;
+#endif
+    static _LIBCPP_CONSTEXPR const float_round_style round_style = round_to_nearest;
+};
+
+template <>
+class __libcpp_numeric_limits<long double, true>
+{
+protected:
+    typedef long double type;
+
+    static _LIBCPP_CONSTEXPR const bool is_specialized = true;
+
+    static _LIBCPP_CONSTEXPR const bool is_signed = true;
+    static _LIBCPP_CONSTEXPR const int  digits = __LDBL_MANT_DIG__;
+    static _LIBCPP_CONSTEXPR const int  digits10 = __LDBL_DIG__;
+    static _LIBCPP_CONSTEXPR const int  max_digits10 = 2+(digits * 30103l)/100000l;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type min() _NOEXCEPT {return __LDBL_MIN__;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type max() _NOEXCEPT {return __LDBL_MAX__;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type lowest() _NOEXCEPT {return -max();}
+
+    static _LIBCPP_CONSTEXPR const bool is_integer = false;
+    static _LIBCPP_CONSTEXPR const bool is_exact = false;
+    static _LIBCPP_CONSTEXPR const int  radix = __FLT_RADIX__;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type epsilon() _NOEXCEPT {return __LDBL_EPSILON__;}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type round_error() _NOEXCEPT {return 0.5L;}
+
+    static _LIBCPP_CONSTEXPR const int  min_exponent = __LDBL_MIN_EXP__;
+    static _LIBCPP_CONSTEXPR const int  min_exponent10 = __LDBL_MIN_10_EXP__;
+    static _LIBCPP_CONSTEXPR const int  max_exponent = __LDBL_MAX_EXP__;
+    static _LIBCPP_CONSTEXPR const int  max_exponent10 = __LDBL_MAX_10_EXP__;
+
+    static _LIBCPP_CONSTEXPR const bool has_infinity = true;
+    static _LIBCPP_CONSTEXPR const bool has_quiet_NaN = true;
+    static _LIBCPP_CONSTEXPR const bool has_signaling_NaN = true;
+    static _LIBCPP_CONSTEXPR const float_denorm_style has_denorm = denorm_present;
+    static _LIBCPP_CONSTEXPR const bool has_denorm_loss = false;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type infinity() _NOEXCEPT {return __builtin_huge_vall();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type quiet_NaN() _NOEXCEPT {return __builtin_nanl("");}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type signaling_NaN() _NOEXCEPT {return __builtin_nansl("");}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type denorm_min() _NOEXCEPT {return __LDBL_DENORM_MIN__;}
+
+#if defined(__powerpc__) && defined(__LONG_DOUBLE_IBM128__)
+    static _LIBCPP_CONSTEXPR const bool is_iec559 = false;
+#else
+    static _LIBCPP_CONSTEXPR const bool is_iec559 = true;
+#endif
+    static _LIBCPP_CONSTEXPR const bool is_bounded = true;
+    static _LIBCPP_CONSTEXPR const bool is_modulo = false;
+
+    static _LIBCPP_CONSTEXPR const bool traps = false;
+#if (defined(__arm__) || defined(__aarch64__))
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = true;
+#else
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = false;
+#endif
+    static _LIBCPP_CONSTEXPR const float_round_style round_style = round_to_nearest;
+};
+
+template <class _Tp>
+class _LIBCPP_TEMPLATE_VIS numeric_limits
+    : private __libcpp_numeric_limits<__remove_cv_t<_Tp> >
+{
+    typedef __libcpp_numeric_limits<__remove_cv_t<_Tp> > __base;
+    typedef typename __base::type type;
+public:
+    static _LIBCPP_CONSTEXPR const bool is_specialized = __base::is_specialized;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type min() _NOEXCEPT {return __base::min();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type max() _NOEXCEPT {return __base::max();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type lowest() _NOEXCEPT {return __base::lowest();}
+
+    static _LIBCPP_CONSTEXPR const int  digits = __base::digits;
+    static _LIBCPP_CONSTEXPR const int  digits10 = __base::digits10;
+    static _LIBCPP_CONSTEXPR const int  max_digits10 = __base::max_digits10;
+    static _LIBCPP_CONSTEXPR const bool is_signed = __base::is_signed;
+    static _LIBCPP_CONSTEXPR const bool is_integer = __base::is_integer;
+    static _LIBCPP_CONSTEXPR const bool is_exact = __base::is_exact;
+    static _LIBCPP_CONSTEXPR const int  radix = __base::radix;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type epsilon() _NOEXCEPT {return __base::epsilon();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type round_error() _NOEXCEPT {return __base::round_error();}
+
+    static _LIBCPP_CONSTEXPR const int  min_exponent = __base::min_exponent;
+    static _LIBCPP_CONSTEXPR const int  min_exponent10 = __base::min_exponent10;
+    static _LIBCPP_CONSTEXPR const int  max_exponent = __base::max_exponent;
+    static _LIBCPP_CONSTEXPR const int  max_exponent10 = __base::max_exponent10;
+
+    static _LIBCPP_CONSTEXPR const bool has_infinity = __base::has_infinity;
+    static _LIBCPP_CONSTEXPR const bool has_quiet_NaN = __base::has_quiet_NaN;
+    static _LIBCPP_CONSTEXPR const bool has_signaling_NaN = __base::has_signaling_NaN;
+    static _LIBCPP_CONSTEXPR const float_denorm_style has_denorm = __base::has_denorm;
+    static _LIBCPP_CONSTEXPR const bool has_denorm_loss = __base::has_denorm_loss;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type infinity() _NOEXCEPT {return __base::infinity();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type quiet_NaN() _NOEXCEPT {return __base::quiet_NaN();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type signaling_NaN() _NOEXCEPT {return __base::signaling_NaN();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type denorm_min() _NOEXCEPT {return __base::denorm_min();}
+
+    static _LIBCPP_CONSTEXPR const bool is_iec559 = __base::is_iec559;
+    static _LIBCPP_CONSTEXPR const bool is_bounded = __base::is_bounded;
+    static _LIBCPP_CONSTEXPR const bool is_modulo = __base::is_modulo;
+
+    static _LIBCPP_CONSTEXPR const bool traps = __base::traps;
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = __base::tinyness_before;
+    static _LIBCPP_CONSTEXPR const float_round_style round_style = __base::round_style;
+};
+
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::is_specialized;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<_Tp>::digits;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<_Tp>::digits10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<_Tp>::max_digits10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::is_signed;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::is_integer;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::is_exact;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<_Tp>::radix;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<_Tp>::min_exponent;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<_Tp>::min_exponent10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<_Tp>::max_exponent;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<_Tp>::max_exponent10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::has_infinity;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::has_quiet_NaN;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::has_signaling_NaN;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const float_denorm_style numeric_limits<_Tp>::has_denorm;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::has_denorm_loss;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::is_iec559;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::is_bounded;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::is_modulo;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::traps;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<_Tp>::tinyness_before;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const float_round_style numeric_limits<_Tp>::round_style;
+
+template <class _Tp>
+class _LIBCPP_TEMPLATE_VIS numeric_limits<const _Tp>
+    : private numeric_limits<_Tp>
+{
+    typedef numeric_limits<_Tp> __base;
+    typedef _Tp type;
+public:
+    static _LIBCPP_CONSTEXPR const bool is_specialized = __base::is_specialized;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type min() _NOEXCEPT {return __base::min();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type max() _NOEXCEPT {return __base::max();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type lowest() _NOEXCEPT {return __base::lowest();}
+
+    static _LIBCPP_CONSTEXPR const int  digits = __base::digits;
+    static _LIBCPP_CONSTEXPR const int  digits10 = __base::digits10;
+    static _LIBCPP_CONSTEXPR const int  max_digits10 = __base::max_digits10;
+    static _LIBCPP_CONSTEXPR const bool is_signed = __base::is_signed;
+    static _LIBCPP_CONSTEXPR const bool is_integer = __base::is_integer;
+    static _LIBCPP_CONSTEXPR const bool is_exact = __base::is_exact;
+    static _LIBCPP_CONSTEXPR const int  radix = __base::radix;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type epsilon() _NOEXCEPT {return __base::epsilon();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type round_error() _NOEXCEPT {return __base::round_error();}
+
+    static _LIBCPP_CONSTEXPR const int  min_exponent = __base::min_exponent;
+    static _LIBCPP_CONSTEXPR const int  min_exponent10 = __base::min_exponent10;
+    static _LIBCPP_CONSTEXPR const int  max_exponent = __base::max_exponent;
+    static _LIBCPP_CONSTEXPR const int  max_exponent10 = __base::max_exponent10;
+
+    static _LIBCPP_CONSTEXPR const bool has_infinity = __base::has_infinity;
+    static _LIBCPP_CONSTEXPR const bool has_quiet_NaN = __base::has_quiet_NaN;
+    static _LIBCPP_CONSTEXPR const bool has_signaling_NaN = __base::has_signaling_NaN;
+    static _LIBCPP_CONSTEXPR const float_denorm_style has_denorm = __base::has_denorm;
+    static _LIBCPP_CONSTEXPR const bool has_denorm_loss = __base::has_denorm_loss;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type infinity() _NOEXCEPT {return __base::infinity();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type quiet_NaN() _NOEXCEPT {return __base::quiet_NaN();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type signaling_NaN() _NOEXCEPT {return __base::signaling_NaN();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type denorm_min() _NOEXCEPT {return __base::denorm_min();}
+
+    static _LIBCPP_CONSTEXPR const bool is_iec559 = __base::is_iec559;
+    static _LIBCPP_CONSTEXPR const bool is_bounded = __base::is_bounded;
+    static _LIBCPP_CONSTEXPR const bool is_modulo = __base::is_modulo;
+
+    static _LIBCPP_CONSTEXPR const bool traps = __base::traps;
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = __base::tinyness_before;
+    static _LIBCPP_CONSTEXPR const float_round_style round_style = __base::round_style;
+};
+
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::is_specialized;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const _Tp>::digits;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const _Tp>::digits10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const _Tp>::max_digits10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::is_signed;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::is_integer;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::is_exact;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const _Tp>::radix;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const _Tp>::min_exponent;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const _Tp>::min_exponent10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const _Tp>::max_exponent;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const _Tp>::max_exponent10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::has_infinity;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::has_quiet_NaN;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::has_signaling_NaN;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const float_denorm_style numeric_limits<const _Tp>::has_denorm;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::has_denorm_loss;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::is_iec559;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::is_bounded;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::is_modulo;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::traps;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const _Tp>::tinyness_before;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const float_round_style numeric_limits<const _Tp>::round_style;
+
+template <class _Tp>
+class _LIBCPP_TEMPLATE_VIS numeric_limits<volatile _Tp>
+    : private numeric_limits<_Tp>
+{
+    typedef numeric_limits<_Tp> __base;
+    typedef _Tp type;
+public:
+    static _LIBCPP_CONSTEXPR const bool is_specialized = __base::is_specialized;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type min() _NOEXCEPT {return __base::min();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type max() _NOEXCEPT {return __base::max();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type lowest() _NOEXCEPT {return __base::lowest();}
+
+    static _LIBCPP_CONSTEXPR const int  digits = __base::digits;
+    static _LIBCPP_CONSTEXPR const int  digits10 = __base::digits10;
+    static _LIBCPP_CONSTEXPR const int  max_digits10 = __base::max_digits10;
+    static _LIBCPP_CONSTEXPR const bool is_signed = __base::is_signed;
+    static _LIBCPP_CONSTEXPR const bool is_integer = __base::is_integer;
+    static _LIBCPP_CONSTEXPR const bool is_exact = __base::is_exact;
+    static _LIBCPP_CONSTEXPR const int  radix = __base::radix;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type epsilon() _NOEXCEPT {return __base::epsilon();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type round_error() _NOEXCEPT {return __base::round_error();}
+
+    static _LIBCPP_CONSTEXPR const int  min_exponent = __base::min_exponent;
+    static _LIBCPP_CONSTEXPR const int  min_exponent10 = __base::min_exponent10;
+    static _LIBCPP_CONSTEXPR const int  max_exponent = __base::max_exponent;
+    static _LIBCPP_CONSTEXPR const int  max_exponent10 = __base::max_exponent10;
+
+    static _LIBCPP_CONSTEXPR const bool has_infinity = __base::has_infinity;
+    static _LIBCPP_CONSTEXPR const bool has_quiet_NaN = __base::has_quiet_NaN;
+    static _LIBCPP_CONSTEXPR const bool has_signaling_NaN = __base::has_signaling_NaN;
+    static _LIBCPP_CONSTEXPR const float_denorm_style has_denorm = __base::has_denorm;
+    static _LIBCPP_CONSTEXPR const bool has_denorm_loss = __base::has_denorm_loss;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type infinity() _NOEXCEPT {return __base::infinity();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type quiet_NaN() _NOEXCEPT {return __base::quiet_NaN();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type signaling_NaN() _NOEXCEPT {return __base::signaling_NaN();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type denorm_min() _NOEXCEPT {return __base::denorm_min();}
+
+    static _LIBCPP_CONSTEXPR const bool is_iec559 = __base::is_iec559;
+    static _LIBCPP_CONSTEXPR const bool is_bounded = __base::is_bounded;
+    static _LIBCPP_CONSTEXPR const bool is_modulo = __base::is_modulo;
+
+    static _LIBCPP_CONSTEXPR const bool traps = __base::traps;
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = __base::tinyness_before;
+    static _LIBCPP_CONSTEXPR const float_round_style round_style = __base::round_style;
+};
+
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::is_specialized;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<volatile _Tp>::digits;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<volatile _Tp>::digits10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<volatile _Tp>::max_digits10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::is_signed;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::is_integer;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::is_exact;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<volatile _Tp>::radix;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<volatile _Tp>::min_exponent;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<volatile _Tp>::min_exponent10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<volatile _Tp>::max_exponent;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<volatile _Tp>::max_exponent10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::has_infinity;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::has_quiet_NaN;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::has_signaling_NaN;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const float_denorm_style numeric_limits<volatile _Tp>::has_denorm;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::has_denorm_loss;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::is_iec559;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::is_bounded;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::is_modulo;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::traps;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<volatile _Tp>::tinyness_before;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const float_round_style numeric_limits<volatile _Tp>::round_style;
+
+template <class _Tp>
+class _LIBCPP_TEMPLATE_VIS numeric_limits<const volatile _Tp>
+    : private numeric_limits<_Tp>
+{
+    typedef numeric_limits<_Tp> __base;
+    typedef _Tp type;
+public:
+    static _LIBCPP_CONSTEXPR const bool is_specialized = __base::is_specialized;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type min() _NOEXCEPT {return __base::min();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type max() _NOEXCEPT {return __base::max();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type lowest() _NOEXCEPT {return __base::lowest();}
+
+    static _LIBCPP_CONSTEXPR const int  digits = __base::digits;
+    static _LIBCPP_CONSTEXPR const int  digits10 = __base::digits10;
+    static _LIBCPP_CONSTEXPR const int  max_digits10 = __base::max_digits10;
+    static _LIBCPP_CONSTEXPR const bool is_signed = __base::is_signed;
+    static _LIBCPP_CONSTEXPR const bool is_integer = __base::is_integer;
+    static _LIBCPP_CONSTEXPR const bool is_exact = __base::is_exact;
+    static _LIBCPP_CONSTEXPR const int  radix = __base::radix;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type epsilon() _NOEXCEPT {return __base::epsilon();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type round_error() _NOEXCEPT {return __base::round_error();}
+
+    static _LIBCPP_CONSTEXPR const int  min_exponent = __base::min_exponent;
+    static _LIBCPP_CONSTEXPR const int  min_exponent10 = __base::min_exponent10;
+    static _LIBCPP_CONSTEXPR const int  max_exponent = __base::max_exponent;
+    static _LIBCPP_CONSTEXPR const int  max_exponent10 = __base::max_exponent10;
+
+    static _LIBCPP_CONSTEXPR const bool has_infinity = __base::has_infinity;
+    static _LIBCPP_CONSTEXPR const bool has_quiet_NaN = __base::has_quiet_NaN;
+    static _LIBCPP_CONSTEXPR const bool has_signaling_NaN = __base::has_signaling_NaN;
+    static _LIBCPP_CONSTEXPR const float_denorm_style has_denorm = __base::has_denorm;
+    static _LIBCPP_CONSTEXPR const bool has_denorm_loss = __base::has_denorm_loss;
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type infinity() _NOEXCEPT {return __base::infinity();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type quiet_NaN() _NOEXCEPT {return __base::quiet_NaN();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type signaling_NaN() _NOEXCEPT {return __base::signaling_NaN();}
+    _LIBCPP_INLINE_VISIBILITY static _LIBCPP_CONSTEXPR type denorm_min() _NOEXCEPT {return __base::denorm_min();}
+
+    static _LIBCPP_CONSTEXPR const bool is_iec559 = __base::is_iec559;
+    static _LIBCPP_CONSTEXPR const bool is_bounded = __base::is_bounded;
+    static _LIBCPP_CONSTEXPR const bool is_modulo = __base::is_modulo;
+
+    static _LIBCPP_CONSTEXPR const bool traps = __base::traps;
+    static _LIBCPP_CONSTEXPR const bool tinyness_before = __base::tinyness_before;
+    static _LIBCPP_CONSTEXPR const float_round_style round_style = __base::round_style;
+};
+
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::is_specialized;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const volatile _Tp>::digits;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const volatile _Tp>::digits10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const volatile _Tp>::max_digits10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::is_signed;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::is_integer;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::is_exact;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const volatile _Tp>::radix;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const volatile _Tp>::min_exponent;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const volatile _Tp>::min_exponent10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const volatile _Tp>::max_exponent;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const int numeric_limits<const volatile _Tp>::max_exponent10;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::has_infinity;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::has_quiet_NaN;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::has_signaling_NaN;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const float_denorm_style numeric_limits<const volatile _Tp>::has_denorm;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::has_denorm_loss;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::is_iec559;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::is_bounded;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::is_modulo;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::traps;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const bool numeric_limits<const volatile _Tp>::tinyness_before;
+template <class _Tp>
+    _LIBCPP_CONSTEXPR const float_round_style numeric_limits<const volatile _Tp>::round_style;
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_LIMITS
diff --git a/app/src/main/cpp/libcxx/include/limits.h b/app/src/main/cpp/libcxx/include/limits.h
new file mode 100644
index 0000000..537a4b1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/limits.h
@@ -0,0 +1,71 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_LIMITS_H
+#define _LIBCPP_LIMITS_H
+
+/*
+    limits.h synopsis
+
+Macros:
+
+    CHAR_BIT
+    SCHAR_MIN
+    SCHAR_MAX
+    UCHAR_MAX
+    CHAR_MIN
+    CHAR_MAX
+    MB_LEN_MAX
+    SHRT_MIN
+    SHRT_MAX
+    USHRT_MAX
+    INT_MIN
+    INT_MAX
+    UINT_MAX
+    LONG_MIN
+    LONG_MAX
+    ULONG_MAX
+    LLONG_MIN   // C99
+    LLONG_MAX   // C99
+    ULLONG_MAX  // C99
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifdef _LIBCPP_COMPILER_GCC
+
+// GCC header limits.h recursively includes itself through another header called
+// syslimits.h for some reason. This setup breaks down if we directly
+// #include_next GCC's limits.h (reasons not entirely clear to me).
+// See https://gcc.gnu.org/bugzilla/show_bug.cgi?id=107795 for more details.
+// Therefore, we manually re-create the necessary include sequence below:
+
+// Get the system limits.h defines (force recurse into the next level)
+#define _GCC_LIMITS_H_
+#define _GCC_NEXT_LIMITS_H
+#include_next <limits.h>
+
+// Get the ISO C defines
+#undef _GCC_LIMITS_H_
+#include_next <limits.h>
+
+#else
+
+#  if __has_include_next(<limits.h>)
+#    include_next <limits.h>
+#  endif
+
+#endif // _LIBCPP_COMPILER_GCC
+
+#endif // _LIBCPP_LIMITS_H
diff --git a/app/src/main/cpp/libcxx/include/list b/app/src/main/cpp/libcxx/include/list
new file mode 100644
index 0000000..a0c7327
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/list
@@ -0,0 +1,2386 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_LIST
+#define _LIBCPP_LIST
+
+/*
+    list synopsis
+
+namespace std
+{
+
+template <class T, class Alloc = allocator<T> >
+class list
+{
+public:
+
+    // types:
+    typedef T value_type;
+    typedef Alloc allocator_type;
+    typedef typename allocator_type::reference reference;
+    typedef typename allocator_type::const_reference const_reference;
+    typedef typename allocator_type::pointer pointer;
+    typedef typename allocator_type::const_pointer const_pointer;
+    typedef implementation-defined iterator;
+    typedef implementation-defined const_iterator;
+    typedef implementation-defined size_type;
+    typedef implementation-defined difference_type;
+    typedef reverse_iterator<iterator> reverse_iterator;
+    typedef reverse_iterator<const_iterator> const_reverse_iterator;
+
+    list()
+        noexcept(is_nothrow_default_constructible<allocator_type>::value);
+    explicit list(const allocator_type& a);
+    explicit list(size_type n);
+    explicit list(size_type n, const allocator_type& a); // C++14
+    list(size_type n, const value_type& value);
+    list(size_type n, const value_type& value, const allocator_type& a);
+    template <class Iter>
+        list(Iter first, Iter last);
+    template <class Iter>
+        list(Iter first, Iter last, const allocator_type& a);
+    list(const list& x);
+    list(const list&, const allocator_type& a);
+    list(list&& x)
+        noexcept(is_nothrow_move_constructible<allocator_type>::value);
+    list(list&&, const allocator_type& a);
+    list(initializer_list<value_type>);
+    list(initializer_list<value_type>, const allocator_type& a);
+
+    ~list();
+
+    list& operator=(const list& x);
+    list& operator=(list&& x)
+        noexcept(
+             allocator_type::propagate_on_container_move_assignment::value &&
+             is_nothrow_move_assignable<allocator_type>::value);
+    list& operator=(initializer_list<value_type>);
+    template <class Iter>
+        void assign(Iter first, Iter last);
+    void assign(size_type n, const value_type& t);
+    void assign(initializer_list<value_type>);
+
+    allocator_type get_allocator() const noexcept;
+
+    iterator begin() noexcept;
+    const_iterator begin() const noexcept;
+    iterator end() noexcept;
+    const_iterator end() const noexcept;
+    reverse_iterator rbegin() noexcept;
+    const_reverse_iterator rbegin() const noexcept;
+    reverse_iterator rend() noexcept;
+    const_reverse_iterator rend() const noexcept;
+    const_iterator cbegin() const noexcept;
+    const_iterator cend() const noexcept;
+    const_reverse_iterator crbegin() const noexcept;
+    const_reverse_iterator crend() const noexcept;
+
+    reference front();
+    const_reference front() const;
+    reference back();
+    const_reference back() const;
+
+    bool empty() const noexcept;
+    size_type size() const noexcept;
+    size_type max_size() const noexcept;
+
+    template <class... Args>
+        reference emplace_front(Args&&... args); // reference in C++17
+    void pop_front();
+    template <class... Args>
+        reference emplace_back(Args&&... args);  // reference in C++17
+    void pop_back();
+    void push_front(const value_type& x);
+    void push_front(value_type&& x);
+    void push_back(const value_type& x);
+    void push_back(value_type&& x);
+    template <class... Args>
+        iterator emplace(const_iterator position, Args&&... args);
+    iterator insert(const_iterator position, const value_type& x);
+    iterator insert(const_iterator position, value_type&& x);
+    iterator insert(const_iterator position, size_type n, const value_type& x);
+    template <class Iter>
+        iterator insert(const_iterator position, Iter first, Iter last);
+    iterator insert(const_iterator position, initializer_list<value_type> il);
+
+    iterator erase(const_iterator position);
+    iterator erase(const_iterator position, const_iterator last);
+
+    void resize(size_type sz);
+    void resize(size_type sz, const value_type& c);
+
+    void swap(list&)
+        noexcept(allocator_traits<allocator_type>::is_always_equal::value);  // C++17
+    void clear() noexcept;
+
+    void splice(const_iterator position, list& x);
+    void splice(const_iterator position, list&& x);
+    void splice(const_iterator position, list& x, const_iterator i);
+    void splice(const_iterator position, list&& x, const_iterator i);
+    void splice(const_iterator position, list& x, const_iterator first,
+                                                  const_iterator last);
+    void splice(const_iterator position, list&& x, const_iterator first,
+                                                  const_iterator last);
+
+    size_type remove(const value_type& value);       // void before C++20
+    template <class Pred>
+      size_type remove_if(Pred pred);                // void before C++20
+    size_type unique();                              // void before C++20
+    template <class BinaryPredicate>
+      size_type unique(BinaryPredicate binary_pred); // void before C++20
+    void merge(list& x);
+    void merge(list&& x);
+    template <class Compare>
+        void merge(list& x, Compare comp);
+    template <class Compare>
+        void merge(list&& x, Compare comp);
+    void sort();
+    template <class Compare>
+        void sort(Compare comp);
+    void reverse() noexcept;
+};
+
+
+template <class InputIterator, class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
+    list(InputIterator, InputIterator, Allocator = Allocator())
+    -> list<typename iterator_traits<InputIterator>::value_type, Allocator>;  // C++17
+
+template <class T, class Alloc>
+    bool operator==(const list<T,Alloc>& x, const list<T,Alloc>& y);
+template <class T, class Alloc>
+    bool operator< (const list<T,Alloc>& x, const list<T,Alloc>& y);
+template <class T, class Alloc>
+    bool operator!=(const list<T,Alloc>& x, const list<T,Alloc>& y);
+template <class T, class Alloc>
+    bool operator> (const list<T,Alloc>& x, const list<T,Alloc>& y);
+template <class T, class Alloc>
+    bool operator>=(const list<T,Alloc>& x, const list<T,Alloc>& y);
+template <class T, class Alloc>
+    bool operator<=(const list<T,Alloc>& x, const list<T,Alloc>& y);
+
+template <class T, class Alloc>
+    void swap(list<T,Alloc>& x, list<T,Alloc>& y)
+         noexcept(noexcept(x.swap(y)));
+
+template <class T, class Allocator, class U>
+    typename list<T, Allocator>::size_type
+    erase(list<T, Allocator>& c, const U& value);       // C++20
+template <class T, class Allocator, class Predicate>
+    typename list<T, Allocator>::size_type
+    erase_if(list<T, Allocator>& c, Predicate pred);    // C++20
+
+}  // std
+
+*/
+
+#include <__algorithm/comp.h>
+#include <__algorithm/equal.h>
+#include <__algorithm/lexicographical_compare.h>
+#include <__algorithm/min.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__debug>
+#include <__format/enable_insertable.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/move_iterator.h>
+#include <__iterator/next.h>
+#include <__iterator/prev.h>
+#include <__iterator/reverse_iterator.h>
+#include <__memory/addressof.h>
+#include <__memory/allocator.h>
+#include <__memory/allocator_destructor.h>
+#include <__memory/allocator_traits.h>
+#include <__memory/compressed_pair.h>
+#include <__memory/pointer_traits.h>
+#include <__memory/swap_allocator.h>
+#include <__memory/unique_ptr.h>
+#include <__memory_resource/polymorphic_allocator.h>
+#include <__type_traits/is_allocator.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <cstring>
+#include <limits>
+#include <type_traits>
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+// [list.syn]
+#include <compare>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _VoidPtr> struct __list_node;
+template <class _Tp, class _VoidPtr> struct __list_node_base;
+
+template <class _Tp, class _VoidPtr>
+struct __list_node_pointer_traits {
+  typedef __rebind_pointer_t<_VoidPtr, __list_node<_Tp, _VoidPtr> >
+        __node_pointer;
+  typedef __rebind_pointer_t<_VoidPtr, __list_node_base<_Tp, _VoidPtr> >
+        __base_pointer;
+
+#if defined(_LIBCPP_ABI_LIST_REMOVE_NODE_POINTER_UB)
+  typedef __base_pointer __link_pointer;
+#else
+  typedef __conditional_t<is_pointer<_VoidPtr>::value, __base_pointer, __node_pointer> __link_pointer;
+#endif
+
+  typedef __conditional_t<is_same<__link_pointer, __node_pointer>::value, __base_pointer, __node_pointer>
+      __non_link_pointer;
+
+  static _LIBCPP_INLINE_VISIBILITY
+  __link_pointer __unsafe_link_pointer_cast(__link_pointer __p) {
+      return __p;
+  }
+
+  static _LIBCPP_INLINE_VISIBILITY
+  __link_pointer __unsafe_link_pointer_cast(__non_link_pointer __p) {
+      return static_cast<__link_pointer>(static_cast<_VoidPtr>(__p));
+  }
+
+};
+
+template <class _Tp, class _VoidPtr>
+struct __list_node_base
+{
+    typedef __list_node_pointer_traits<_Tp, _VoidPtr> _NodeTraits;
+    typedef typename _NodeTraits::__node_pointer __node_pointer;
+    typedef typename _NodeTraits::__base_pointer __base_pointer;
+    typedef typename _NodeTraits::__link_pointer __link_pointer;
+
+    __link_pointer __prev_;
+    __link_pointer __next_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __list_node_base() : __prev_(_NodeTraits::__unsafe_link_pointer_cast(__self())),
+                         __next_(_NodeTraits::__unsafe_link_pointer_cast(__self())) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __base_pointer __self() {
+        return pointer_traits<__base_pointer>::pointer_to(*this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __node_pointer __as_node() {
+        return static_cast<__node_pointer>(__self());
+    }
+};
+
+template <class _Tp, class _VoidPtr>
+struct _LIBCPP_STANDALONE_DEBUG __list_node
+    : public __list_node_base<_Tp, _VoidPtr>
+{
+    _Tp __value_;
+
+    typedef __list_node_base<_Tp, _VoidPtr> __base;
+    typedef typename __base::__link_pointer __link_pointer;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __link_pointer __as_link() {
+        return static_cast<__link_pointer>(__base::__self());
+    }
+};
+
+template <class _Tp, class _Alloc = allocator<_Tp> > class _LIBCPP_TEMPLATE_VIS list;
+template <class _Tp, class _Alloc> class __list_imp;
+template <class _Tp, class _VoidPtr> class _LIBCPP_TEMPLATE_VIS __list_const_iterator;
+
+template <class _Tp, class _VoidPtr>
+class _LIBCPP_TEMPLATE_VIS __list_iterator
+{
+    typedef __list_node_pointer_traits<_Tp, _VoidPtr> _NodeTraits;
+    typedef typename _NodeTraits::__link_pointer __link_pointer;
+
+    __link_pointer __ptr_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __list_iterator(__link_pointer __p, const void* __c) _NOEXCEPT
+        : __ptr_(__p)
+    {
+        (void)__c;
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+        __get_db()->__insert_ic(this, __c);
+#endif
+    }
+
+    template<class, class> friend class list;
+    template<class, class> friend class __list_imp;
+    template<class, class> friend class __list_const_iterator;
+public:
+    typedef bidirectional_iterator_tag       iterator_category;
+    typedef _Tp                              value_type;
+    typedef value_type&                      reference;
+    typedef __rebind_pointer_t<_VoidPtr, value_type> pointer;
+    typedef typename pointer_traits<pointer>::difference_type difference_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __list_iterator() _NOEXCEPT : __ptr_(nullptr)
+    {
+        _VSTD::__debug_db_insert_i(this);
+    }
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+    _LIBCPP_INLINE_VISIBILITY
+    __list_iterator(const __list_iterator& __p)
+        : __ptr_(__p.__ptr_)
+    {
+        __get_db()->__iterator_copy(this, _VSTD::addressof(__p));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~__list_iterator()
+    {
+        __get_db()->__erase_i(this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __list_iterator& operator=(const __list_iterator& __p)
+    {
+        if (this != _VSTD::addressof(__p))
+        {
+            __get_db()->__iterator_copy(this, _VSTD::addressof(__p));
+            __ptr_ = __p.__ptr_;
+        }
+        return *this;
+    }
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                             "Attempted to dereference a non-dereferenceable list::iterator");
+        return __ptr_->__as_node()->__value_;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                             "Attempted to dereference a non-dereferenceable list::iterator");
+        return pointer_traits<pointer>::pointer_to(__ptr_->__as_node()->__value_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __list_iterator& operator++()
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                             "Attempted to increment a non-incrementable list::iterator");
+        __ptr_ = __ptr_->__next_;
+        return *this;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    __list_iterator operator++(int) {__list_iterator __t(*this); ++(*this); return __t;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __list_iterator& operator--()
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__decrementable(this),
+                             "Attempted to decrement a non-decrementable list::iterator");
+        __ptr_ = __ptr_->__prev_;
+        return *this;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    __list_iterator operator--(int) {__list_iterator __t(*this); --(*this); return __t;}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const __list_iterator& __x, const __list_iterator& __y)
+    {
+        return __x.__ptr_ == __y.__ptr_;
+    }
+    friend _LIBCPP_INLINE_VISIBILITY
+     bool operator!=(const __list_iterator& __x, const __list_iterator& __y)
+        {return !(__x == __y);}
+};
+
+template <class _Tp, class _VoidPtr>
+class _LIBCPP_TEMPLATE_VIS __list_const_iterator
+{
+    typedef __list_node_pointer_traits<_Tp, _VoidPtr> _NodeTraits;
+    typedef typename _NodeTraits::__link_pointer __link_pointer;
+
+    __link_pointer __ptr_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __list_const_iterator(__link_pointer __p, const void* __c) _NOEXCEPT
+        : __ptr_(__p)
+    {
+        (void)__c;
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+        __get_db()->__insert_ic(this, __c);
+#endif
+    }
+
+    template<class, class> friend class list;
+    template<class, class> friend class __list_imp;
+public:
+    typedef bidirectional_iterator_tag       iterator_category;
+    typedef _Tp                              value_type;
+    typedef const value_type&                reference;
+    typedef __rebind_pointer_t<_VoidPtr, const value_type> pointer;
+    typedef typename pointer_traits<pointer>::difference_type difference_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __list_const_iterator() _NOEXCEPT : __ptr_(nullptr)
+    {
+        _VSTD::__debug_db_insert_i(this);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    __list_const_iterator(const __list_iterator<_Tp, _VoidPtr>& __p) _NOEXCEPT
+        : __ptr_(__p.__ptr_)
+    {
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+        __get_db()->__iterator_copy(this, _VSTD::addressof(__p));
+#endif
+    }
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+    _LIBCPP_INLINE_VISIBILITY
+    __list_const_iterator(const __list_const_iterator& __p)
+        : __ptr_(__p.__ptr_)
+    {
+        __get_db()->__iterator_copy(this, _VSTD::addressof(__p));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~__list_const_iterator()
+    {
+        __get_db()->__erase_i(this);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __list_const_iterator& operator=(const __list_const_iterator& __p)
+    {
+        if (this != _VSTD::addressof(__p))
+        {
+            __get_db()->__iterator_copy(this, _VSTD::addressof(__p));
+            __ptr_ = __p.__ptr_;
+        }
+        return *this;
+    }
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                             "Attempted to dereference a non-dereferenceable list::const_iterator");
+        return __ptr_->__as_node()->__value_;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                             "Attempted to dereference a non-dereferenceable list::const_iterator");
+        return pointer_traits<pointer>::pointer_to(__ptr_->__as_node()->__value_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __list_const_iterator& operator++()
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(this),
+                             "Attempted to increment a non-incrementable list::const_iterator");
+        __ptr_ = __ptr_->__next_;
+        return *this;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    __list_const_iterator operator++(int) {__list_const_iterator __t(*this); ++(*this); return __t;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __list_const_iterator& operator--()
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__decrementable(this),
+                             "Attempted to decrement a non-decrementable list::const_iterator");
+        __ptr_ = __ptr_->__prev_;
+        return *this;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    __list_const_iterator operator--(int) {__list_const_iterator __t(*this); --(*this); return __t;}
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const __list_const_iterator& __x, const __list_const_iterator& __y)
+    {
+        return __x.__ptr_ == __y.__ptr_;
+    }
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const __list_const_iterator& __x, const __list_const_iterator& __y)
+        {return !(__x == __y);}
+};
+
+template <class _Tp, class _Alloc>
+class __list_imp
+{
+    __list_imp(const __list_imp&);
+    __list_imp& operator=(const __list_imp&);
+public:
+    typedef _Alloc                                                  allocator_type;
+    typedef allocator_traits<allocator_type>                        __alloc_traits;
+    typedef typename __alloc_traits::size_type                      size_type;
+protected:
+    typedef _Tp                                                     value_type;
+    typedef typename __alloc_traits::void_pointer                   __void_pointer;
+    typedef __list_iterator<value_type, __void_pointer>             iterator;
+    typedef __list_const_iterator<value_type, __void_pointer>       const_iterator;
+    typedef __list_node_base<value_type, __void_pointer>            __node_base;
+    typedef __list_node<value_type, __void_pointer>                 __node;
+    typedef __rebind_alloc<__alloc_traits, __node>                  __node_allocator;
+    typedef allocator_traits<__node_allocator>                       __node_alloc_traits;
+    typedef typename __node_alloc_traits::pointer                    __node_pointer;
+    typedef typename __node_alloc_traits::pointer                    __node_const_pointer;
+    typedef __list_node_pointer_traits<value_type, __void_pointer> __node_pointer_traits;
+    typedef typename __node_pointer_traits::__link_pointer __link_pointer;
+    typedef __link_pointer __link_const_pointer;
+    typedef typename __alloc_traits::pointer                         pointer;
+    typedef typename __alloc_traits::const_pointer                   const_pointer;
+    typedef typename __alloc_traits::difference_type                 difference_type;
+
+    typedef __rebind_alloc<__alloc_traits, __node_base>               __node_base_allocator;
+    typedef typename allocator_traits<__node_base_allocator>::pointer __node_base_pointer;
+    static_assert((!is_same<allocator_type, __node_allocator>::value),
+                  "internal allocator type must differ from user-specified "
+                  "type; otherwise overload resolution breaks");
+
+    __node_base __end_;
+    __compressed_pair<size_type, __node_allocator> __size_alloc_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __link_pointer __end_as_link() const _NOEXCEPT {
+        return __node_pointer_traits::__unsafe_link_pointer_cast(
+                const_cast<__node_base&>(__end_).__self());
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+          size_type& __sz() _NOEXCEPT {return __size_alloc_.first();}
+    _LIBCPP_INLINE_VISIBILITY
+    const size_type& __sz() const _NOEXCEPT
+        {return __size_alloc_.first();}
+    _LIBCPP_INLINE_VISIBILITY
+          __node_allocator& __node_alloc() _NOEXCEPT
+          {return __size_alloc_.second();}
+    _LIBCPP_INLINE_VISIBILITY
+    const __node_allocator& __node_alloc() const _NOEXCEPT
+        {return __size_alloc_.second();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type __node_alloc_max_size() const _NOEXCEPT {
+        return __node_alloc_traits::max_size(__node_alloc());
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    static void __unlink_nodes(__link_pointer __f, __link_pointer __l) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __list_imp()
+        _NOEXCEPT_(is_nothrow_default_constructible<__node_allocator>::value);
+    _LIBCPP_INLINE_VISIBILITY
+    __list_imp(const allocator_type& __a);
+    _LIBCPP_INLINE_VISIBILITY
+    __list_imp(const __node_allocator& __a);
+#ifndef _LIBCPP_CXX03_LANG
+    __list_imp(__node_allocator&& __a) _NOEXCEPT;
+#endif
+    ~__list_imp();
+    void clear() _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    bool empty() const _NOEXCEPT {return __sz() == 0;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator begin() _NOEXCEPT
+    {
+        return iterator(__end_.__next_, this);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin() const  _NOEXCEPT
+    {
+        return const_iterator(__end_.__next_, this);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    iterator end() _NOEXCEPT
+    {
+        return iterator(__end_as_link(), this);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end() const _NOEXCEPT
+    {
+        return const_iterator(__end_as_link(), this);
+    }
+
+    void swap(__list_imp& __c)
+#if _LIBCPP_STD_VER >= 14
+        _NOEXCEPT;
+#else
+        _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
+                    __is_nothrow_swappable<allocator_type>::value);
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __copy_assign_alloc(const __list_imp& __c)
+        {__copy_assign_alloc(__c, integral_constant<bool,
+                      __node_alloc_traits::propagate_on_container_copy_assignment::value>());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __move_assign_alloc(__list_imp& __c)
+        _NOEXCEPT_(
+            !__node_alloc_traits::propagate_on_container_move_assignment::value ||
+            is_nothrow_move_assignable<__node_allocator>::value)
+        {__move_assign_alloc(__c, integral_constant<bool,
+                      __node_alloc_traits::propagate_on_container_move_assignment::value>());}
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    void __copy_assign_alloc(const __list_imp& __c, true_type)
+        {
+            if (__node_alloc() != __c.__node_alloc())
+                clear();
+            __node_alloc() = __c.__node_alloc();
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __copy_assign_alloc(const __list_imp&, false_type)
+        {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __move_assign_alloc(__list_imp& __c, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<__node_allocator>::value)
+        {
+            __node_alloc() = _VSTD::move(__c.__node_alloc());
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __move_assign_alloc(__list_imp&, false_type)
+        _NOEXCEPT
+        {}
+};
+
+// Unlink nodes [__f, __l]
+template <class _Tp, class _Alloc>
+inline
+void
+__list_imp<_Tp, _Alloc>::__unlink_nodes(__link_pointer __f, __link_pointer __l)
+    _NOEXCEPT
+{
+    __f->__prev_->__next_ = __l->__next_;
+    __l->__next_->__prev_ = __f->__prev_;
+}
+
+template <class _Tp, class _Alloc>
+inline
+__list_imp<_Tp, _Alloc>::__list_imp()
+        _NOEXCEPT_(is_nothrow_default_constructible<__node_allocator>::value)
+    : __size_alloc_(0, __default_init_tag())
+{
+}
+
+template <class _Tp, class _Alloc>
+inline
+__list_imp<_Tp, _Alloc>::__list_imp(const allocator_type& __a)
+    : __size_alloc_(0, __node_allocator(__a))
+{
+}
+
+template <class _Tp, class _Alloc>
+inline __list_imp<_Tp, _Alloc>::__list_imp(const __node_allocator& __a)
+    : __size_alloc_(0, __a) {}
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Tp, class _Alloc>
+inline __list_imp<_Tp, _Alloc>::__list_imp(__node_allocator&& __a) _NOEXCEPT
+    : __size_alloc_(0, _VSTD::move(__a)) {}
+#endif
+
+template <class _Tp, class _Alloc>
+__list_imp<_Tp, _Alloc>::~__list_imp() {
+  clear();
+  std::__debug_db_erase_c(this);
+}
+
+template <class _Tp, class _Alloc>
+void
+__list_imp<_Tp, _Alloc>::clear() _NOEXCEPT
+{
+    if (!empty())
+    {
+        __node_allocator& __na = __node_alloc();
+        __link_pointer __f = __end_.__next_;
+        __link_pointer __l = __end_as_link();
+        __unlink_nodes(__f, __l->__prev_);
+        __sz() = 0;
+        while (__f != __l)
+        {
+            __node_pointer __np = __f->__as_node();
+            __f = __f->__next_;
+            __node_alloc_traits::destroy(__na, _VSTD::addressof(__np->__value_));
+            __node_alloc_traits::deallocate(__na, __np, 1);
+        }
+        std::__debug_db_invalidate_all(this);
+    }
+}
+
+template <class _Tp, class _Alloc>
+void
+__list_imp<_Tp, _Alloc>::swap(__list_imp& __c)
+#if _LIBCPP_STD_VER >= 14
+        _NOEXCEPT
+#else
+        _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
+                    __is_nothrow_swappable<allocator_type>::value)
+#endif
+{
+    _LIBCPP_ASSERT(__alloc_traits::propagate_on_container_swap::value ||
+                   this->__node_alloc() == __c.__node_alloc(),
+                   "list::swap: Either propagate_on_container_swap must be true"
+                   " or the allocators must compare equal");
+    using _VSTD::swap;
+    _VSTD::__swap_allocator(__node_alloc(), __c.__node_alloc());
+    swap(__sz(), __c.__sz());
+    swap(__end_, __c.__end_);
+    if (__sz() == 0)
+        __end_.__next_ = __end_.__prev_ = __end_as_link();
+    else
+        __end_.__prev_->__next_ = __end_.__next_->__prev_ = __end_as_link();
+    if (__c.__sz() == 0)
+        __c.__end_.__next_ = __c.__end_.__prev_ = __c.__end_as_link();
+    else
+        __c.__end_.__prev_->__next_ = __c.__end_.__next_->__prev_ = __c.__end_as_link();
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    __libcpp_db* __db = __get_db();
+    __c_node* __cn1 = __db->__find_c_and_lock(this);
+    __c_node* __cn2 = __db->__find_c(_VSTD::addressof(__c));
+    _VSTD::swap(__cn1->beg_, __cn2->beg_);
+    _VSTD::swap(__cn1->end_, __cn2->end_);
+    _VSTD::swap(__cn1->cap_, __cn2->cap_);
+    for (__i_node** __p = __cn1->end_; __p != __cn1->beg_;)
+    {
+        --__p;
+        const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
+        if (__i->__ptr_ == __c.__end_as_link())
+        {
+            __cn2->__add(*__p);
+            if (--__cn1->end_ != __p)
+                _VSTD::memmove(__p, __p+1, (__cn1->end_ - __p)*sizeof(__i_node*));
+        }
+        else
+            (*__p)->__c_ = __cn1;
+    }
+    for (__i_node** __p = __cn2->end_; __p != __cn2->beg_;)
+    {
+        --__p;
+        const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
+        if (__i->__ptr_ == __end_as_link())
+        {
+            __cn1->__add(*__p);
+            if (--__cn2->end_ != __p)
+                _VSTD::memmove(__p, __p+1, (__cn2->end_ - __p)*sizeof(__i_node*));
+        }
+        else
+            (*__p)->__c_ = __cn2;
+    }
+    __db->unlock();
+#endif
+}
+
+template <class _Tp, class _Alloc /*= allocator<_Tp>*/>
+class _LIBCPP_TEMPLATE_VIS list
+    : private __list_imp<_Tp, _Alloc>
+{
+    typedef __list_imp<_Tp, _Alloc> base;
+    typedef typename base::__node              __node;
+    typedef typename base::__node_allocator    __node_allocator;
+    typedef typename base::__node_pointer      __node_pointer;
+    typedef typename base::__node_alloc_traits __node_alloc_traits;
+    typedef typename base::__node_base         __node_base;
+    typedef typename base::__node_base_pointer __node_base_pointer;
+    typedef typename base::__link_pointer __link_pointer;
+
+public:
+    typedef _Tp                                            value_type;
+    typedef _Alloc                                         allocator_type;
+    static_assert((is_same<value_type, typename allocator_type::value_type>::value),
+                  "Invalid allocator::value_type");
+    typedef value_type&                                    reference;
+    typedef const value_type&                              const_reference;
+    typedef typename base::pointer                         pointer;
+    typedef typename base::const_pointer                   const_pointer;
+    typedef typename base::size_type                       size_type;
+    typedef typename base::difference_type                 difference_type;
+    typedef typename base::iterator                        iterator;
+    typedef typename base::const_iterator                  const_iterator;
+    typedef _VSTD::reverse_iterator<iterator>              reverse_iterator;
+    typedef _VSTD::reverse_iterator<const_iterator>        const_reverse_iterator;
+#if _LIBCPP_STD_VER > 17
+    typedef size_type                                      __remove_return_type;
+#else
+    typedef void                                           __remove_return_type;
+#endif
+
+    static_assert(is_same<allocator_type, __rebind_alloc<allocator_traits<allocator_type>, value_type> >::value,
+                  "[allocator.requirements] states that rebinding an allocator to the same type should result in the "
+                  "original allocator");
+
+    _LIBCPP_INLINE_VISIBILITY
+    list()
+        _NOEXCEPT_(is_nothrow_default_constructible<__node_allocator>::value)
+    {
+        _VSTD::__debug_db_insert_c(this);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    explicit list(const allocator_type& __a) : base(__a)
+    {
+        _VSTD::__debug_db_insert_c(this);
+    }
+    explicit list(size_type __n);
+#if _LIBCPP_STD_VER > 11
+    explicit list(size_type __n, const allocator_type& __a);
+#endif
+    list(size_type __n, const value_type& __x);
+    template <class = __enable_if_t<__is_allocator<_Alloc>::value> >
+    list(size_type __n, const value_type& __x, const allocator_type& __a) : base(__a)
+    {
+        _VSTD::__debug_db_insert_c(this);
+        for (; __n > 0; --__n)
+            push_back(__x);
+    }
+
+    template <class _InpIter>
+        list(_InpIter __f, _InpIter __l,
+             __enable_if_t<__is_cpp17_input_iterator<_InpIter>::value>* = 0);
+    template <class _InpIter>
+        list(_InpIter __f, _InpIter __l, const allocator_type& __a,
+             __enable_if_t<__is_cpp17_input_iterator<_InpIter>::value>* = 0);
+
+    list(const list& __c);
+    list(const list& __c, const __type_identity_t<allocator_type>& __a);
+    _LIBCPP_INLINE_VISIBILITY
+    list& operator=(const list& __c);
+#ifndef _LIBCPP_CXX03_LANG
+    list(initializer_list<value_type> __il);
+    list(initializer_list<value_type> __il, const allocator_type& __a);
+
+    _LIBCPP_INLINE_VISIBILITY
+    list(list&& __c)
+        _NOEXCEPT_(is_nothrow_move_constructible<__node_allocator>::value);
+    _LIBCPP_INLINE_VISIBILITY
+    list(list&& __c, const __type_identity_t<allocator_type>& __a);
+    _LIBCPP_INLINE_VISIBILITY
+    list& operator=(list&& __c)
+        _NOEXCEPT_(
+            __node_alloc_traits::propagate_on_container_move_assignment::value &&
+            is_nothrow_move_assignable<__node_allocator>::value);
+
+    _LIBCPP_INLINE_VISIBILITY
+    list& operator=(initializer_list<value_type> __il)
+        {assign(__il.begin(), __il.end()); return *this;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void assign(initializer_list<value_type> __il)
+        {assign(__il.begin(), __il.end());}
+#endif // _LIBCPP_CXX03_LANG
+
+    template <class _InpIter>
+        void assign(_InpIter __f, _InpIter __l,
+                    __enable_if_t<__is_cpp17_input_iterator<_InpIter>::value>* = 0);
+    void assign(size_type __n, const value_type& __x);
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const _NOEXCEPT     {return base::__sz();}
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool empty() const _NOEXCEPT         {return base::empty();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT
+        {
+            return _VSTD::min<size_type>(
+                base::__node_alloc_max_size(),
+                numeric_limits<difference_type >::max());
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+          iterator begin() _NOEXCEPT        {return base::begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin()  const _NOEXCEPT {return base::begin();}
+    _LIBCPP_INLINE_VISIBILITY
+          iterator end() _NOEXCEPT          {return base::end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end()    const _NOEXCEPT {return base::end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbegin() const _NOEXCEPT {return base::begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cend()   const _NOEXCEPT {return base::end();}
+
+    _LIBCPP_INLINE_VISIBILITY
+          reverse_iterator rbegin() _NOEXCEPT
+            {return       reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator rbegin()  const _NOEXCEPT
+        {return const_reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY
+          reverse_iterator rend() _NOEXCEPT
+            {return       reverse_iterator(begin());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator rend()    const _NOEXCEPT
+        {return const_reverse_iterator(begin());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator crbegin() const _NOEXCEPT
+        {return const_reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator crend()   const _NOEXCEPT
+        {return const_reverse_iterator(begin());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference front()
+    {
+        _LIBCPP_ASSERT(!empty(), "list::front called on empty list");
+        return base::__end_.__next_->__as_node()->__value_;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    const_reference front() const
+    {
+        _LIBCPP_ASSERT(!empty(), "list::front called on empty list");
+        return base::__end_.__next_->__as_node()->__value_;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    reference back()
+    {
+        _LIBCPP_ASSERT(!empty(), "list::back called on empty list");
+        return base::__end_.__prev_->__as_node()->__value_;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    const_reference back() const
+    {
+        _LIBCPP_ASSERT(!empty(), "list::back called on empty list");
+        return base::__end_.__prev_->__as_node()->__value_;
+    }
+
+#ifndef _LIBCPP_CXX03_LANG
+    void push_front(value_type&& __x);
+    void push_back(value_type&& __x);
+
+    template <class... _Args>
+#if _LIBCPP_STD_VER > 14
+       reference emplace_front(_Args&&... __args);
+#else
+       void      emplace_front(_Args&&... __args);
+#endif
+    template <class... _Args>
+#if _LIBCPP_STD_VER > 14
+        reference emplace_back(_Args&&... __args);
+#else
+       void       emplace_back(_Args&&... __args);
+#endif
+    template <class... _Args>
+        iterator emplace(const_iterator __p, _Args&&... __args);
+
+    iterator insert(const_iterator __p, value_type&& __x);
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, initializer_list<value_type> __il)
+        {return insert(__p, __il.begin(), __il.end());}
+#endif // _LIBCPP_CXX03_LANG
+
+    void push_front(const value_type& __x);
+    void push_back(const value_type& __x);
+
+#ifndef _LIBCPP_CXX03_LANG
+    template <class _Arg>
+    _LIBCPP_INLINE_VISIBILITY
+    void __emplace_back(_Arg&& __arg) { emplace_back(_VSTD::forward<_Arg>(__arg)); }
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    void __emplace_back(value_type const& __arg) { push_back(__arg); }
+#endif
+
+    iterator insert(const_iterator __p, const value_type& __x);
+    iterator insert(const_iterator __p, size_type __n, const value_type& __x);
+    template <class _InpIter>
+        iterator insert(const_iterator __p, _InpIter __f, _InpIter __l,
+                        __enable_if_t<__is_cpp17_input_iterator<_InpIter>::value>* = 0);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(list& __c)
+#if _LIBCPP_STD_VER >= 14
+        _NOEXCEPT
+#else
+        _NOEXCEPT_(!__node_alloc_traits::propagate_on_container_swap::value ||
+                   __is_nothrow_swappable<__node_allocator>::value)
+#endif
+        {base::swap(__c);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() _NOEXCEPT {base::clear();}
+
+    void pop_front();
+    void pop_back();
+
+    iterator erase(const_iterator __p);
+    iterator erase(const_iterator __f, const_iterator __l);
+
+    void resize(size_type __n);
+    void resize(size_type __n, const value_type& __x);
+
+    void splice(const_iterator __p, list& __c);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    void splice(const_iterator __p, list&& __c) {splice(__p, __c);}
+    _LIBCPP_INLINE_VISIBILITY
+    void splice(const_iterator __p, list&& __c, const_iterator __i)
+        {splice(__p, __c, __i);}
+    _LIBCPP_INLINE_VISIBILITY
+    void splice(const_iterator __p, list&& __c, const_iterator __f, const_iterator __l)
+        {splice(__p, __c, __f, __l);}
+#endif
+    void splice(const_iterator __p, list& __c, const_iterator __i);
+    void splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l);
+
+    __remove_return_type remove(const value_type& __x);
+    template <class _Pred> __remove_return_type remove_if(_Pred __pred);
+    _LIBCPP_INLINE_VISIBILITY
+    __remove_return_type unique() { return unique(__equal_to()); }
+    template <class _BinaryPred>
+        __remove_return_type unique(_BinaryPred __binary_pred);
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(list& __c);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(list&& __c) {merge(__c);}
+
+    template <class _Comp>
+    _LIBCPP_INLINE_VISIBILITY
+        void merge(list&& __c, _Comp __comp) {merge(__c, __comp);}
+#endif
+    template <class _Comp>
+        void merge(list& __c, _Comp __comp);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void sort();
+    template <class _Comp>
+        _LIBCPP_INLINE_VISIBILITY
+        void sort(_Comp __comp);
+
+    void reverse() _NOEXCEPT;
+
+    bool __invariants() const;
+
+    typedef __allocator_destructor<__node_allocator> __node_destructor;
+    typedef unique_ptr<__node, __node_destructor> __hold_pointer;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hold_pointer __allocate_node(__node_allocator& __na) {
+      __node_pointer __p = __node_alloc_traits::allocate(__na, 1);
+      __p->__prev_ = nullptr;
+      return __hold_pointer(__p, __node_destructor(__na, 1));
+    }
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+    bool __dereferenceable(const const_iterator* __i) const;
+    bool __decrementable(const const_iterator* __i) const;
+    bool __addable(const const_iterator* __i, ptrdiff_t __n) const;
+    bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const;
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    static void __link_nodes  (__link_pointer __p, __link_pointer __f, __link_pointer __l);
+    _LIBCPP_INLINE_VISIBILITY
+    void __link_nodes_at_front(__link_pointer __f, __link_pointer __l);
+    _LIBCPP_INLINE_VISIBILITY
+    void __link_nodes_at_back (__link_pointer __f, __link_pointer __l);
+    iterator __iterator(size_type __n);
+    template <class _Comp>
+        static iterator __sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp);
+
+    void __move_assign(list& __c, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<__node_allocator>::value);
+    void __move_assign(list& __c, false_type);
+};
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator,
+         class _Alloc = allocator<__iter_value_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Alloc>::value>
+         >
+list(_InputIterator, _InputIterator)
+  -> list<__iter_value_type<_InputIterator>, _Alloc>;
+
+template<class _InputIterator,
+         class _Alloc,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Alloc>::value>
+         >
+list(_InputIterator, _InputIterator, _Alloc)
+  -> list<__iter_value_type<_InputIterator>, _Alloc>;
+#endif
+
+// Link in nodes [__f, __l] just prior to __p
+template <class _Tp, class _Alloc>
+inline
+void
+list<_Tp, _Alloc>::__link_nodes(__link_pointer __p, __link_pointer __f, __link_pointer __l)
+{
+    __p->__prev_->__next_ = __f;
+    __f->__prev_ = __p->__prev_;
+    __p->__prev_ = __l;
+    __l->__next_ = __p;
+}
+
+// Link in nodes [__f, __l] at the front of the list
+template <class _Tp, class _Alloc>
+inline
+void
+list<_Tp, _Alloc>::__link_nodes_at_front(__link_pointer __f, __link_pointer __l)
+{
+    __f->__prev_ = base::__end_as_link();
+    __l->__next_ = base::__end_.__next_;
+    __l->__next_->__prev_ = __l;
+    base::__end_.__next_ = __f;
+}
+
+// Link in nodes [__f, __l] at the back of the list
+template <class _Tp, class _Alloc>
+inline
+void
+list<_Tp, _Alloc>::__link_nodes_at_back(__link_pointer __f, __link_pointer __l)
+{
+    __l->__next_ = base::__end_as_link();
+    __f->__prev_ = base::__end_.__prev_;
+    __f->__prev_->__next_ = __f;
+    base::__end_.__prev_ = __l;
+}
+
+
+template <class _Tp, class _Alloc>
+inline
+typename list<_Tp, _Alloc>::iterator
+list<_Tp, _Alloc>::__iterator(size_type __n)
+{
+    return __n <= base::__sz() / 2 ? _VSTD::next(begin(), __n)
+                                   : _VSTD::prev(end(), base::__sz() - __n);
+}
+
+template <class _Tp, class _Alloc>
+list<_Tp, _Alloc>::list(size_type __n)
+{
+    _VSTD::__debug_db_insert_c(this);
+    for (; __n > 0; --__n)
+#ifndef _LIBCPP_CXX03_LANG
+        emplace_back();
+#else
+        push_back(value_type());
+#endif
+}
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp, class _Alloc>
+list<_Tp, _Alloc>::list(size_type __n, const allocator_type& __a) : base(__a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    for (; __n > 0; --__n)
+        emplace_back();
+}
+#endif
+
+template <class _Tp, class _Alloc>
+list<_Tp, _Alloc>::list(size_type __n, const value_type& __x)
+{
+    _VSTD::__debug_db_insert_c(this);
+    for (; __n > 0; --__n)
+        push_back(__x);
+}
+
+template <class _Tp, class _Alloc>
+template <class _InpIter>
+list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l,
+                        __enable_if_t<__is_cpp17_input_iterator<_InpIter>::value>*)
+{
+    _VSTD::__debug_db_insert_c(this);
+    for (; __f != __l; ++__f)
+        __emplace_back(*__f);
+}
+
+template <class _Tp, class _Alloc>
+template <class _InpIter>
+list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l, const allocator_type& __a,
+                        __enable_if_t<__is_cpp17_input_iterator<_InpIter>::value>*)
+    : base(__a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    for (; __f != __l; ++__f)
+        __emplace_back(*__f);
+}
+
+template <class _Tp, class _Alloc>
+list<_Tp, _Alloc>::list(const list& __c)
+    : base(__node_alloc_traits::select_on_container_copy_construction(
+          __c.__node_alloc())) {
+    _VSTD::__debug_db_insert_c(this);
+    for (const_iterator __i = __c.begin(), __e = __c.end(); __i != __e; ++__i)
+        push_back(*__i);
+}
+
+template <class _Tp, class _Alloc>
+list<_Tp, _Alloc>::list(const list& __c, const __type_identity_t<allocator_type>& __a)
+    : base(__a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    for (const_iterator __i = __c.begin(), __e = __c.end(); __i != __e; ++__i)
+        push_back(*__i);
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Alloc>
+list<_Tp, _Alloc>::list(initializer_list<value_type> __il, const allocator_type& __a)
+    : base(__a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    for (typename initializer_list<value_type>::const_iterator __i = __il.begin(),
+            __e = __il.end(); __i != __e; ++__i)
+        push_back(*__i);
+}
+
+template <class _Tp, class _Alloc>
+list<_Tp, _Alloc>::list(initializer_list<value_type> __il)
+{
+    _VSTD::__debug_db_insert_c(this);
+    for (typename initializer_list<value_type>::const_iterator __i = __il.begin(),
+            __e = __il.end(); __i != __e; ++__i)
+        push_back(*__i);
+}
+
+template <class _Tp, class _Alloc>
+inline list<_Tp, _Alloc>::list(list&& __c)
+        _NOEXCEPT_(is_nothrow_move_constructible<__node_allocator>::value)
+        : base(_VSTD::move(__c.__node_alloc())) {
+    _VSTD::__debug_db_insert_c(this);
+    splice(end(), __c);
+}
+
+template <class _Tp, class _Alloc>
+inline
+list<_Tp, _Alloc>::list(list&& __c, const __type_identity_t<allocator_type>& __a)
+    : base(__a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    if (__a == __c.get_allocator())
+        splice(end(), __c);
+    else
+    {
+        typedef move_iterator<iterator> _Ip;
+        assign(_Ip(__c.begin()), _Ip(__c.end()));
+    }
+}
+
+template <class _Tp, class _Alloc>
+inline
+list<_Tp, _Alloc>&
+list<_Tp, _Alloc>::operator=(list&& __c)
+        _NOEXCEPT_(
+            __node_alloc_traits::propagate_on_container_move_assignment::value &&
+            is_nothrow_move_assignable<__node_allocator>::value)
+{
+    __move_assign(__c, integral_constant<bool,
+          __node_alloc_traits::propagate_on_container_move_assignment::value>());
+    return *this;
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::__move_assign(list& __c, false_type)
+{
+    if (base::__node_alloc() != __c.__node_alloc())
+    {
+        typedef move_iterator<iterator> _Ip;
+        assign(_Ip(__c.begin()), _Ip(__c.end()));
+    }
+    else
+        __move_assign(__c, true_type());
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::__move_assign(list& __c, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<__node_allocator>::value)
+{
+    clear();
+    base::__move_assign_alloc(__c);
+    splice(end(), __c);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Alloc>
+inline
+list<_Tp, _Alloc>&
+list<_Tp, _Alloc>::operator=(const list& __c)
+{
+    if (this != _VSTD::addressof(__c))
+    {
+        base::__copy_assign_alloc(__c);
+        assign(__c.begin(), __c.end());
+    }
+    return *this;
+}
+
+template <class _Tp, class _Alloc>
+template <class _InpIter>
+void
+list<_Tp, _Alloc>::assign(_InpIter __f, _InpIter __l,
+                          __enable_if_t<__is_cpp17_input_iterator<_InpIter>::value>*)
+{
+    iterator __i = begin();
+    iterator __e = end();
+    for (; __f != __l && __i != __e; ++__f, (void) ++__i)
+        *__i = *__f;
+    if (__i == __e)
+        insert(__e, __f, __l);
+    else
+        erase(__i, __e);
+    std::__debug_db_invalidate_all(this);
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::assign(size_type __n, const value_type& __x)
+{
+    iterator __i = begin();
+    iterator __e = end();
+    for (; __n > 0 && __i != __e; --__n, (void) ++__i)
+        *__i = __x;
+    if (__i == __e)
+        insert(__e, __n, __x);
+    else
+        erase(__i, __e);
+    std::__debug_db_invalidate_all(this);
+}
+
+template <class _Tp, class _Alloc>
+inline
+_Alloc
+list<_Tp, _Alloc>::get_allocator() const _NOEXCEPT
+{
+    return allocator_type(base::__node_alloc());
+}
+
+template <class _Tp, class _Alloc>
+typename list<_Tp, _Alloc>::iterator
+list<_Tp, _Alloc>::insert(const_iterator __p, const value_type& __x)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                         "list::insert(iterator, x) called with an iterator not referring to this list");
+    __node_allocator& __na = base::__node_alloc();
+    __hold_pointer __hold = __allocate_node(__na);
+    __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), __x);
+    __link_nodes(__p.__ptr_, __hold->__as_link(), __hold->__as_link());
+    ++base::__sz();
+    return iterator(__hold.release()->__as_link(), this);
+}
+
+template <class _Tp, class _Alloc>
+typename list<_Tp, _Alloc>::iterator
+list<_Tp, _Alloc>::insert(const_iterator __p, size_type __n, const value_type& __x)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                         "list::insert(iterator, n, x) called with an iterator not referring to this list");
+    iterator __r(__p.__ptr_, this);
+    if (__n > 0)
+    {
+        size_type __ds = 0;
+        __node_allocator& __na = base::__node_alloc();
+        __hold_pointer __hold = __allocate_node(__na);
+        __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), __x);
+        ++__ds;
+        __r = iterator(__hold->__as_link(), this);
+        __hold.release();
+        iterator __e = __r;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (--__n; __n != 0; --__n, (void) ++__e, ++__ds)
+            {
+                __hold.reset(__node_alloc_traits::allocate(__na, 1));
+                __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), __x);
+                __e.__ptr_->__next_ = __hold->__as_link();
+                __hold->__prev_ = __e.__ptr_;
+                __hold.release();
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            while (true)
+            {
+                __node_alloc_traits::destroy(__na, _VSTD::addressof(*__e));
+                __link_pointer __prev = __e.__ptr_->__prev_;
+                __node_alloc_traits::deallocate(__na, __e.__ptr_->__as_node(), 1);
+                if (__prev == 0)
+                    break;
+                __e = iterator(__prev, this);
+            }
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __link_nodes(__p.__ptr_, __r.__ptr_, __e.__ptr_);
+        base::__sz() += __ds;
+    }
+    return __r;
+}
+
+template <class _Tp, class _Alloc>
+template <class _InpIter>
+typename list<_Tp, _Alloc>::iterator
+list<_Tp, _Alloc>::insert(const_iterator __p, _InpIter __f, _InpIter __l,
+                          __enable_if_t<__is_cpp17_input_iterator<_InpIter>::value>*)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                         "list::insert(iterator, range) called with an iterator not referring to this list");
+    iterator __r(__p.__ptr_, this);
+    if (__f != __l)
+    {
+        size_type __ds = 0;
+        __node_allocator& __na = base::__node_alloc();
+        __hold_pointer __hold = __allocate_node(__na);
+        __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), *__f);
+        ++__ds;
+        __r = iterator(__hold.get()->__as_link(), this);
+        __hold.release();
+        iterator __e = __r;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (++__f; __f != __l; ++__f, (void) ++__e, ++__ds)
+            {
+                __hold.reset(__node_alloc_traits::allocate(__na, 1));
+                __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), *__f);
+                __e.__ptr_->__next_ = __hold.get()->__as_link();
+                __hold->__prev_ = __e.__ptr_;
+                __hold.release();
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            while (true)
+            {
+                __node_alloc_traits::destroy(__na, _VSTD::addressof(*__e));
+                __link_pointer __prev = __e.__ptr_->__prev_;
+                __node_alloc_traits::deallocate(__na, __e.__ptr_->__as_node(), 1);
+                if (__prev == 0)
+                    break;
+                __e = iterator(__prev, this);
+            }
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __link_nodes(__p.__ptr_, __r.__ptr_, __e.__ptr_);
+        base::__sz() += __ds;
+    }
+    return __r;
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::push_front(const value_type& __x)
+{
+    __node_allocator& __na = base::__node_alloc();
+    __hold_pointer __hold = __allocate_node(__na);
+    __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), __x);
+    __link_pointer __nl = __hold->__as_link();
+    __link_nodes_at_front(__nl, __nl);
+    ++base::__sz();
+    __hold.release();
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::push_back(const value_type& __x)
+{
+    __node_allocator& __na = base::__node_alloc();
+    __hold_pointer __hold = __allocate_node(__na);
+    __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), __x);
+    __link_nodes_at_back(__hold.get()->__as_link(), __hold.get()->__as_link());
+    ++base::__sz();
+    __hold.release();
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::push_front(value_type&& __x)
+{
+    __node_allocator& __na = base::__node_alloc();
+    __hold_pointer __hold = __allocate_node(__na);
+    __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), _VSTD::move(__x));
+    __link_nodes_at_front(__hold.get()->__as_link(), __hold.get()->__as_link());
+    ++base::__sz();
+    __hold.release();
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::push_back(value_type&& __x)
+{
+    __node_allocator& __na = base::__node_alloc();
+    __hold_pointer __hold = __allocate_node(__na);
+    __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), _VSTD::move(__x));
+    __link_nodes_at_back(__hold.get()->__as_link(), __hold.get()->__as_link());
+    ++base::__sz();
+    __hold.release();
+}
+
+template <class _Tp, class _Alloc>
+template <class... _Args>
+#if _LIBCPP_STD_VER > 14
+typename list<_Tp, _Alloc>::reference
+#else
+void
+#endif
+list<_Tp, _Alloc>::emplace_front(_Args&&... __args)
+{
+    __node_allocator& __na = base::__node_alloc();
+    __hold_pointer __hold = __allocate_node(__na);
+    __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), _VSTD::forward<_Args>(__args)...);
+    __link_nodes_at_front(__hold.get()->__as_link(), __hold.get()->__as_link());
+    ++base::__sz();
+#if _LIBCPP_STD_VER > 14
+    return __hold.release()->__value_;
+#else
+    __hold.release();
+#endif
+}
+
+template <class _Tp, class _Alloc>
+template <class... _Args>
+#if _LIBCPP_STD_VER > 14
+typename list<_Tp, _Alloc>::reference
+#else
+void
+#endif
+list<_Tp, _Alloc>::emplace_back(_Args&&... __args)
+{
+    __node_allocator& __na = base::__node_alloc();
+    __hold_pointer __hold = __allocate_node(__na);
+    __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), _VSTD::forward<_Args>(__args)...);
+    __link_pointer __nl = __hold->__as_link();
+    __link_nodes_at_back(__nl, __nl);
+    ++base::__sz();
+#if _LIBCPP_STD_VER > 14
+    return __hold.release()->__value_;
+#else
+    __hold.release();
+#endif
+}
+
+template <class _Tp, class _Alloc>
+template <class... _Args>
+typename list<_Tp, _Alloc>::iterator
+list<_Tp, _Alloc>::emplace(const_iterator __p, _Args&&... __args)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                         "list::emplace(iterator, args...) called with an iterator not referring to this list");
+    __node_allocator& __na = base::__node_alloc();
+    __hold_pointer __hold = __allocate_node(__na);
+    __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), _VSTD::forward<_Args>(__args)...);
+    __link_pointer __nl = __hold.get()->__as_link();
+    __link_nodes(__p.__ptr_, __nl, __nl);
+    ++base::__sz();
+    __hold.release();
+    return iterator(__nl, this);
+}
+
+template <class _Tp, class _Alloc>
+typename list<_Tp, _Alloc>::iterator
+list<_Tp, _Alloc>::insert(const_iterator __p, value_type&& __x)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                         "list::insert(iterator, x) called with an iterator not referring to this list");
+    __node_allocator& __na = base::__node_alloc();
+    __hold_pointer __hold = __allocate_node(__na);
+    __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), _VSTD::move(__x));
+    __link_pointer __nl = __hold->__as_link();
+    __link_nodes(__p.__ptr_, __nl, __nl);
+    ++base::__sz();
+    __hold.release();
+    return iterator(__nl, this);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::pop_front()
+{
+    _LIBCPP_ASSERT(!empty(), "list::pop_front() called with empty list");
+    __node_allocator& __na = base::__node_alloc();
+    __link_pointer __n = base::__end_.__next_;
+    base::__unlink_nodes(__n, __n);
+    --base::__sz();
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    __c_node* __c = __get_db()->__find_c_and_lock(this);
+    for (__i_node** __p = __c->end_; __p != __c->beg_; )
+    {
+        --__p;
+        iterator* __i = static_cast<iterator*>((*__p)->__i_);
+        if (__i->__ptr_ == __n)
+        {
+            (*__p)->__c_ = nullptr;
+            if (--__c->end_ != __p)
+                _VSTD::memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
+        }
+    }
+    __get_db()->unlock();
+#endif
+    __node_pointer __np = __n->__as_node();
+    __node_alloc_traits::destroy(__na, _VSTD::addressof(__np->__value_));
+    __node_alloc_traits::deallocate(__na, __np, 1);
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::pop_back()
+{
+    _LIBCPP_ASSERT(!empty(), "list::pop_back() called on an empty list");
+    __node_allocator& __na = base::__node_alloc();
+    __link_pointer __n = base::__end_.__prev_;
+    base::__unlink_nodes(__n, __n);
+    --base::__sz();
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    __c_node* __c = __get_db()->__find_c_and_lock(this);
+    for (__i_node** __p = __c->end_; __p != __c->beg_; )
+    {
+        --__p;
+        iterator* __i = static_cast<iterator*>((*__p)->__i_);
+        if (__i->__ptr_ == __n)
+        {
+            (*__p)->__c_ = nullptr;
+            if (--__c->end_ != __p)
+                _VSTD::memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
+        }
+    }
+    __get_db()->unlock();
+#endif
+    __node_pointer __np = __n->__as_node();
+    __node_alloc_traits::destroy(__na, _VSTD::addressof(__np->__value_));
+    __node_alloc_traits::deallocate(__na, __np, 1);
+}
+
+template <class _Tp, class _Alloc>
+typename list<_Tp, _Alloc>::iterator
+list<_Tp, _Alloc>::erase(const_iterator __p)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                         "list::erase(iterator) called with an iterator not referring to this list");
+    _LIBCPP_ASSERT(__p != end(),
+        "list::erase(iterator) called with a non-dereferenceable iterator");
+    __node_allocator& __na = base::__node_alloc();
+    __link_pointer __n = __p.__ptr_;
+    __link_pointer __r = __n->__next_;
+    base::__unlink_nodes(__n, __n);
+    --base::__sz();
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    __c_node* __c = __get_db()->__find_c_and_lock(this);
+    for (__i_node** __ip = __c->end_; __ip != __c->beg_; )
+    {
+        --__ip;
+        iterator* __i = static_cast<iterator*>((*__ip)->__i_);
+        if (__i->__ptr_ == __n)
+        {
+            (*__ip)->__c_ = nullptr;
+            if (--__c->end_ != __ip)
+                _VSTD::memmove(__ip, __ip+1, (__c->end_ - __ip)*sizeof(__i_node*));
+        }
+    }
+    __get_db()->unlock();
+#endif
+    __node_pointer __np = __n->__as_node();
+    __node_alloc_traits::destroy(__na, _VSTD::addressof(__np->__value_));
+    __node_alloc_traits::deallocate(__na, __np, 1);
+    return iterator(__r, this);
+}
+
+template <class _Tp, class _Alloc>
+typename list<_Tp, _Alloc>::iterator
+list<_Tp, _Alloc>::erase(const_iterator __f, const_iterator __l)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__f)) == this,
+                         "list::erase(iterator, iterator) called with an iterator not referring to this list");
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__l)) == this,
+                         "list::erase(iterator, iterator) called with an iterator not referring to this list");
+    if (__f != __l)
+    {
+        __node_allocator& __na = base::__node_alloc();
+        base::__unlink_nodes(__f.__ptr_, __l.__ptr_->__prev_);
+        while (__f != __l)
+        {
+            __link_pointer __n = __f.__ptr_;
+            ++__f;
+            --base::__sz();
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+            __c_node* __c = __get_db()->__find_c_and_lock(this);
+            for (__i_node** __p = __c->end_; __p != __c->beg_; )
+            {
+                --__p;
+                iterator* __i = static_cast<iterator*>((*__p)->__i_);
+                if (__i->__ptr_ == __n)
+                {
+                    (*__p)->__c_ = nullptr;
+                    if (--__c->end_ != __p)
+                        _VSTD::memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
+                }
+            }
+            __get_db()->unlock();
+#endif
+            __node_pointer __np = __n->__as_node();
+            __node_alloc_traits::destroy(__na, _VSTD::addressof(__np->__value_));
+            __node_alloc_traits::deallocate(__na, __np, 1);
+        }
+    }
+    return iterator(__l.__ptr_, this);
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::resize(size_type __n)
+{
+    if (__n < base::__sz())
+        erase(__iterator(__n), end());
+    else if (__n > base::__sz())
+    {
+        __n -= base::__sz();
+        size_type __ds = 0;
+        __node_allocator& __na = base::__node_alloc();
+        __hold_pointer __hold = __allocate_node(__na);
+        __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_));
+        ++__ds;
+        iterator __r = iterator(__hold.release()->__as_link(), this);
+        iterator __e = __r;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (--__n; __n != 0; --__n, (void) ++__e, ++__ds)
+            {
+                __hold.reset(__node_alloc_traits::allocate(__na, 1));
+                __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_));
+                __e.__ptr_->__next_ = __hold.get()->__as_link();
+                __hold->__prev_ = __e.__ptr_;
+                __hold.release();
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            while (true)
+            {
+                __node_alloc_traits::destroy(__na, _VSTD::addressof(*__e));
+                __link_pointer __prev = __e.__ptr_->__prev_;
+                __node_alloc_traits::deallocate(__na, __e.__ptr_->__as_node(), 1);
+                if (__prev == 0)
+                    break;
+                __e = iterator(__prev, this);
+            }
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __link_nodes_at_back(__r.__ptr_, __e.__ptr_);
+        base::__sz() += __ds;
+    }
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::resize(size_type __n, const value_type& __x)
+{
+    if (__n < base::__sz())
+        erase(__iterator(__n), end());
+    else if (__n > base::__sz())
+    {
+        __n -= base::__sz();
+        size_type __ds = 0;
+        __node_allocator& __na = base::__node_alloc();
+        __hold_pointer __hold = __allocate_node(__na);
+        __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), __x);
+        ++__ds;
+        __link_pointer __nl = __hold.release()->__as_link();
+        iterator __r = iterator(__nl, this);
+        iterator __e = __r;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (--__n; __n != 0; --__n, (void) ++__e, ++__ds)
+            {
+                __hold.reset(__node_alloc_traits::allocate(__na, 1));
+                __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), __x);
+                __e.__ptr_->__next_ = __hold.get()->__as_link();
+                __hold->__prev_ = __e.__ptr_;
+                __hold.release();
+            }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            while (true)
+            {
+                __node_alloc_traits::destroy(__na, _VSTD::addressof(*__e));
+                __link_pointer __prev = __e.__ptr_->__prev_;
+                __node_alloc_traits::deallocate(__na, __e.__ptr_->__as_node(), 1);
+                if (__prev == 0)
+                    break;
+                __e = iterator(__prev, this);
+            }
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        __link_nodes(base::__end_as_link(), __r.__ptr_, __e.__ptr_);
+        base::__sz() += __ds;
+    }
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::splice(const_iterator __p, list& __c)
+{
+    _LIBCPP_ASSERT(this != _VSTD::addressof(__c),
+                   "list::splice(iterator, list) called with this == &list");
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                         "list::splice(iterator, list) called with an iterator not referring to this list");
+    if (!__c.empty())
+    {
+        __link_pointer __f = __c.__end_.__next_;
+        __link_pointer __l = __c.__end_.__prev_;
+        base::__unlink_nodes(__f, __l);
+        __link_nodes(__p.__ptr_, __f, __l);
+        base::__sz() += __c.__sz();
+        __c.__sz() = 0;
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+        if (_VSTD::addressof(__c) != this) {
+            __libcpp_db* __db = __get_db();
+            __c_node* __cn1 = __db->__find_c_and_lock(this);
+            __c_node* __cn2 = __db->__find_c(_VSTD::addressof(__c));
+            for (__i_node** __ip = __cn2->end_; __ip != __cn2->beg_;)
+            {
+                --__ip;
+                iterator* __i = static_cast<iterator*>((*__ip)->__i_);
+                if (__i->__ptr_ != __c.__end_as_link())
+                {
+                    __cn1->__add(*__ip);
+                    (*__ip)->__c_ = __cn1;
+                    if (--__cn2->end_ != __ip)
+                        _VSTD::memmove(__ip, __ip+1, (__cn2->end_ - __ip)*sizeof(__i_node*));
+                }
+            }
+            __db->unlock();
+        }
+#endif
+    }
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __i)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+        "list::splice(iterator, list, iterator) called with the first iterator not referring to this list");
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__i)) == _VSTD::addressof(__c),
+        "list::splice(iterator, list, iterator) called with the second iterator not referring to the list argument");
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__dereferenceable(_VSTD::addressof(__i)),
+        "list::splice(iterator, list, iterator) called with the second iterator not dereferenceable");
+
+    if (__p.__ptr_ != __i.__ptr_ && __p.__ptr_ != __i.__ptr_->__next_)
+    {
+        __link_pointer __f = __i.__ptr_;
+        base::__unlink_nodes(__f, __f);
+        __link_nodes(__p.__ptr_, __f, __f);
+        --__c.__sz();
+        ++base::__sz();
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+        if (_VSTD::addressof(__c) != this) {
+            __libcpp_db* __db = __get_db();
+            __c_node* __cn1 = __db->__find_c_and_lock(this);
+            __c_node* __cn2 = __db->__find_c(_VSTD::addressof(__c));
+            for (__i_node** __ip = __cn2->end_; __ip != __cn2->beg_;)
+            {
+                --__ip;
+                iterator* __j = static_cast<iterator*>((*__ip)->__i_);
+                if (__j->__ptr_ == __f)
+                {
+                    __cn1->__add(*__ip);
+                    (*__ip)->__c_ = __cn1;
+                    if (--__cn2->end_ != __ip)
+                        _VSTD::memmove(__ip, __ip+1, (__cn2->end_ - __ip)*sizeof(__i_node*));
+                }
+            }
+            __db->unlock();
+        }
+#endif
+    }
+}
+
+template <class _Iterator>
+_LIBCPP_HIDE_FROM_ABI
+bool __iterator_in_range(_Iterator __first, _Iterator __last, _Iterator __it) {
+    for (_Iterator __p = __first; __p != __last; ++__p) {
+        if (__p == __it) {
+            return true;
+        }
+    }
+    return false;
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+        "list::splice(iterator, list, iterator, iterator) called with first iterator not referring to this list");
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__f)) == _VSTD::addressof(__c),
+        "list::splice(iterator, list, iterator, iterator) called with second iterator not referring to the list argument");
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__l)) == _VSTD::addressof(__c),
+        "list::splice(iterator, list, iterator, iterator) called with third iterator not referring to the list argument");
+    _LIBCPP_DEBUG_ASSERT(this != std::addressof(__c) || !std::__iterator_in_range(__f, __l, __p),
+        "list::splice(iterator, list, iterator, iterator)"
+        " called with the first iterator within the range of the second and third iterators");
+
+    if (__f != __l)
+    {
+        __link_pointer __first = __f.__ptr_;
+        --__l;
+        __link_pointer __last = __l.__ptr_;
+        if (this != _VSTD::addressof(__c))
+        {
+            size_type __s = _VSTD::distance(__f, __l) + 1;
+            __c.__sz() -= __s;
+            base::__sz() += __s;
+        }
+        base::__unlink_nodes(__first, __last);
+        __link_nodes(__p.__ptr_, __first, __last);
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+        if (_VSTD::addressof(__c) != this) {
+            __libcpp_db* __db = __get_db();
+            __c_node* __cn1 = __db->__find_c_and_lock(this);
+            __c_node* __cn2 = __db->__find_c(_VSTD::addressof(__c));
+            for (__i_node** __ip = __cn2->end_; __ip != __cn2->beg_;)
+            {
+                --__ip;
+                iterator* __j = static_cast<iterator*>((*__ip)->__i_);
+                for (__link_pointer __k = __f.__ptr_;
+                                              __k != __l.__ptr_; __k = __k->__next_)
+                {
+                    if (__j->__ptr_ == __k)
+                    {
+                        __cn1->__add(*__ip);
+                        (*__ip)->__c_ = __cn1;
+                        if (--__cn2->end_ != __ip)
+                            _VSTD::memmove(__ip, __ip+1, (__cn2->end_ - __ip)*sizeof(__i_node*));
+                    }
+                }
+            }
+            __db->unlock();
+        }
+#endif
+    }
+}
+
+template <class _Tp, class _Alloc>
+typename list<_Tp, _Alloc>::__remove_return_type
+list<_Tp, _Alloc>::remove(const value_type& __x)
+{
+    list<_Tp, _Alloc> __deleted_nodes(get_allocator()); // collect the nodes we're removing
+    for (const_iterator __i = begin(), __e = end(); __i != __e;)
+    {
+        if (*__i == __x)
+        {
+            const_iterator __j = _VSTD::next(__i);
+            for (; __j != __e && *__j == __x; ++__j)
+                ;
+            __deleted_nodes.splice(__deleted_nodes.end(), *this, __i, __j);
+            __i = __j;
+            if (__i != __e)
+                ++__i;
+        }
+        else
+            ++__i;
+    }
+
+    return (__remove_return_type) __deleted_nodes.size();
+}
+
+template <class _Tp, class _Alloc>
+template <class _Pred>
+typename list<_Tp, _Alloc>::__remove_return_type
+list<_Tp, _Alloc>::remove_if(_Pred __pred)
+{
+    list<_Tp, _Alloc> __deleted_nodes(get_allocator()); // collect the nodes we're removing
+    for (iterator __i = begin(), __e = end(); __i != __e;)
+    {
+        if (__pred(*__i))
+        {
+            iterator __j = _VSTD::next(__i);
+            for (; __j != __e && __pred(*__j); ++__j)
+                ;
+            __deleted_nodes.splice(__deleted_nodes.end(), *this, __i, __j);
+            __i = __j;
+            if (__i != __e)
+                ++__i;
+        }
+        else
+            ++__i;
+    }
+
+    return (__remove_return_type) __deleted_nodes.size();
+}
+
+template <class _Tp, class _Alloc>
+template <class _BinaryPred>
+typename list<_Tp, _Alloc>::__remove_return_type
+list<_Tp, _Alloc>::unique(_BinaryPred __binary_pred)
+{
+    list<_Tp, _Alloc> __deleted_nodes(get_allocator()); // collect the nodes we're removing
+    for (iterator __i = begin(), __e = end(); __i != __e;)
+    {
+        iterator __j = _VSTD::next(__i);
+        for (; __j != __e && __binary_pred(*__i, *__j); ++__j)
+            ;
+        if (++__i != __j) {
+            __deleted_nodes.splice(__deleted_nodes.end(), *this, __i, __j);
+            __i = __j;
+            }
+    }
+
+    return (__remove_return_type) __deleted_nodes.size();
+}
+
+template <class _Tp, class _Alloc>
+inline
+void
+list<_Tp, _Alloc>::merge(list& __c)
+{
+    merge(__c, __less<value_type>());
+}
+
+template <class _Tp, class _Alloc>
+template <class _Comp>
+void
+list<_Tp, _Alloc>::merge(list& __c, _Comp __comp)
+{
+    if (this != _VSTD::addressof(__c))
+    {
+        iterator __f1 = begin();
+        iterator __e1 = end();
+        iterator __f2 = __c.begin();
+        iterator __e2 = __c.end();
+        while (__f1 != __e1 && __f2 != __e2)
+        {
+            if (__comp(*__f2, *__f1))
+            {
+                size_type __ds = 1;
+                iterator __m2 = _VSTD::next(__f2);
+                for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2, (void) ++__ds)
+                    ;
+                base::__sz() += __ds;
+                __c.__sz() -= __ds;
+                __link_pointer __f = __f2.__ptr_;
+                __link_pointer __l = __m2.__ptr_->__prev_;
+                __f2 = __m2;
+                base::__unlink_nodes(__f, __l);
+                __m2 = _VSTD::next(__f1);
+                __link_nodes(__f1.__ptr_, __f, __l);
+                __f1 = __m2;
+            }
+            else
+                ++__f1;
+        }
+        splice(__e1, __c);
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+        __libcpp_db* __db = __get_db();
+        __c_node* __cn1 = __db->__find_c_and_lock(this);
+        __c_node* __cn2 = __db->__find_c(_VSTD::addressof(__c));
+        for (__i_node** __p = __cn2->end_; __p != __cn2->beg_;)
+        {
+            --__p;
+            iterator* __i = static_cast<iterator*>((*__p)->__i_);
+            if (__i->__ptr_ != __c.__end_as_link())
+            {
+                __cn1->__add(*__p);
+                (*__p)->__c_ = __cn1;
+                if (--__cn2->end_ != __p)
+                    _VSTD::memmove(__p, __p+1, (__cn2->end_ - __p)*sizeof(__i_node*));
+            }
+        }
+        __db->unlock();
+#endif
+    }
+}
+
+template <class _Tp, class _Alloc>
+inline
+void
+list<_Tp, _Alloc>::sort()
+{
+    sort(__less<value_type>());
+}
+
+template <class _Tp, class _Alloc>
+template <class _Comp>
+inline
+void
+list<_Tp, _Alloc>::sort(_Comp __comp)
+{
+    __sort(begin(), end(), base::__sz(), __comp);
+}
+
+template <class _Tp, class _Alloc>
+template <class _Comp>
+typename list<_Tp, _Alloc>::iterator
+list<_Tp, _Alloc>::__sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp)
+{
+    switch (__n)
+    {
+    case 0:
+    case 1:
+        return __f1;
+    case 2:
+        if (__comp(*--__e2, *__f1))
+        {
+            __link_pointer __f = __e2.__ptr_;
+            base::__unlink_nodes(__f, __f);
+            __link_nodes(__f1.__ptr_, __f, __f);
+            return __e2;
+        }
+        return __f1;
+    }
+    size_type __n2 = __n / 2;
+    iterator __e1 = _VSTD::next(__f1, __n2);
+    iterator  __r = __f1 = __sort(__f1, __e1, __n2, __comp);
+    iterator __f2 = __e1 = __sort(__e1, __e2, __n - __n2, __comp);
+    if (__comp(*__f2, *__f1))
+    {
+        iterator __m2 = _VSTD::next(__f2);
+        for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2)
+            ;
+        __link_pointer __f = __f2.__ptr_;
+        __link_pointer __l = __m2.__ptr_->__prev_;
+        __r = __f2;
+        __e1 = __f2 = __m2;
+        base::__unlink_nodes(__f, __l);
+        __m2 = _VSTD::next(__f1);
+        __link_nodes(__f1.__ptr_, __f, __l);
+        __f1 = __m2;
+    }
+    else
+        ++__f1;
+    while (__f1 != __e1 && __f2 != __e2)
+    {
+        if (__comp(*__f2, *__f1))
+        {
+            iterator __m2 = _VSTD::next(__f2);
+            for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2)
+                ;
+            __link_pointer __f = __f2.__ptr_;
+            __link_pointer __l = __m2.__ptr_->__prev_;
+            if (__e1 == __f2)
+                __e1 = __m2;
+            __f2 = __m2;
+            base::__unlink_nodes(__f, __l);
+            __m2 = _VSTD::next(__f1);
+            __link_nodes(__f1.__ptr_, __f, __l);
+            __f1 = __m2;
+        }
+        else
+            ++__f1;
+    }
+    return __r;
+}
+
+template <class _Tp, class _Alloc>
+void
+list<_Tp, _Alloc>::reverse() _NOEXCEPT
+{
+    if (base::__sz() > 1)
+    {
+        iterator __e = end();
+        for (iterator __i = begin(); __i.__ptr_ != __e.__ptr_;)
+        {
+            _VSTD::swap(__i.__ptr_->__prev_, __i.__ptr_->__next_);
+            __i.__ptr_ = __i.__ptr_->__prev_;
+        }
+        _VSTD::swap(__e.__ptr_->__prev_, __e.__ptr_->__next_);
+    }
+}
+
+template <class _Tp, class _Alloc>
+bool
+list<_Tp, _Alloc>::__invariants() const
+{
+    return size() == _VSTD::distance(begin(), end());
+}
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+template <class _Tp, class _Alloc>
+bool
+list<_Tp, _Alloc>::__dereferenceable(const const_iterator* __i) const
+{
+    return __i->__ptr_ != this->__end_as_link();
+}
+
+template <class _Tp, class _Alloc>
+bool
+list<_Tp, _Alloc>::__decrementable(const const_iterator* __i) const
+{
+    return !empty() &&  __i->__ptr_ != base::__end_.__next_;
+}
+
+template <class _Tp, class _Alloc>
+bool
+list<_Tp, _Alloc>::__addable(const const_iterator*, ptrdiff_t) const
+{
+    return false;
+}
+
+template <class _Tp, class _Alloc>
+bool
+list<_Tp, _Alloc>::__subscriptable(const const_iterator*, ptrdiff_t) const
+{
+    return false;
+}
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
+{
+    return __x.size() == __y.size() && _VSTD::equal(__x.begin(), __x.end(), __y.begin());
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator< (const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
+{
+    return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator> (const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
+{
+    return __y < __x;
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _Tp, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Tp, class _Allocator, class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY typename list<_Tp, _Allocator>::size_type
+erase_if(list<_Tp, _Allocator>& __c, _Predicate __pred) {
+  return __c.remove_if(__pred);
+}
+
+template <class _Tp, class _Allocator, class _Up>
+inline _LIBCPP_INLINE_VISIBILITY typename list<_Tp, _Allocator>::size_type
+erase(list<_Tp, _Allocator>& __c, const _Up& __v) {
+  return _VSTD::erase_if(__c, [&](auto& __elem) { return __elem == __v; });
+}
+
+template <>
+inline constexpr bool __format::__enable_insertable<std::list<char>> = true;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+inline constexpr bool __format::__enable_insertable<std::list<wchar_t>> = true;
+#endif
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+_LIBCPP_BEGIN_NAMESPACE_STD
+namespace pmr {
+template <class _ValueT>
+using list = std::list<_ValueT, polymorphic_allocator<_ValueT>>;
+} // namespace pmr
+_LIBCPP_END_NAMESPACE_STD
+#endif
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <algorithm>
+#  include <atomic>
+#  include <concepts>
+#  include <functional>
+#  include <iosfwd>
+#  include <iterator>
+#  include <typeinfo>
+#endif
+
+#endif // _LIBCPP_LIST
diff --git a/app/src/main/cpp/libcxx/include/locale b/app/src/main/cpp/libcxx/include/locale
new file mode 100644
index 0000000..874866f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/locale
@@ -0,0 +1,4368 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_LOCALE
+#define _LIBCPP_LOCALE
+
+/*
+    locale synopsis
+
+namespace std
+{
+
+class locale
+{
+public:
+    // types:
+    class facet;
+    class id;
+
+    typedef int category;
+    static const category // values assigned here are for exposition only
+        none     = 0x000,
+        collate  = 0x010,
+        ctype    = 0x020,
+        monetary = 0x040,
+        numeric  = 0x080,
+        time     = 0x100,
+        messages = 0x200,
+        all = collate | ctype | monetary | numeric | time | messages;
+
+    // construct/copy/destroy:
+    locale() noexcept;
+    locale(const locale& other) noexcept;
+    explicit locale(const char* std_name);
+    explicit locale(const string& std_name);
+    locale(const locale& other, const char* std_name, category);
+    locale(const locale& other, const string& std_name, category);
+    template <class Facet> locale(const locale& other, Facet* f);
+    locale(const locale& other, const locale& one, category);
+
+    ~locale(); // not virtual
+
+    const locale& operator=(const locale& other) noexcept;
+
+    template <class Facet> locale combine(const locale& other) const;
+
+    // locale operations:
+    basic_string<char> name() const;
+    bool operator==(const locale& other) const;
+    bool operator!=(const locale& other) const;
+    template <class charT, class Traits, class Allocator>
+      bool operator()(const basic_string<charT,Traits,Allocator>& s1,
+                      const basic_string<charT,Traits,Allocator>& s2) const;
+
+    // global locale objects:
+    static locale global(const locale&);
+    static const locale& classic();
+};
+
+template <class Facet> const Facet& use_facet(const locale&);
+template <class Facet> bool has_facet(const locale&) noexcept;
+
+// 22.3.3, convenience interfaces:
+template <class charT> bool isspace (charT c, const locale& loc);
+template <class charT> bool isprint (charT c, const locale& loc);
+template <class charT> bool iscntrl (charT c, const locale& loc);
+template <class charT> bool isupper (charT c, const locale& loc);
+template <class charT> bool islower (charT c, const locale& loc);
+template <class charT> bool isalpha (charT c, const locale& loc);
+template <class charT> bool isdigit (charT c, const locale& loc);
+template <class charT> bool ispunct (charT c, const locale& loc);
+template <class charT> bool isxdigit(charT c, const locale& loc);
+template <class charT> bool isalnum (charT c, const locale& loc);
+template <class charT> bool isgraph (charT c, const locale& loc);
+template <class charT> charT toupper(charT c, const locale& loc);
+template <class charT> charT tolower(charT c, const locale& loc);
+
+template<class Codecvt, class Elem = wchar_t,
+         class Wide_alloc = allocator<Elem>,
+         class Byte_alloc = allocator<char>>
+class wstring_convert
+{
+public:
+    typedef basic_string<char, char_traits<char>, Byte_alloc> byte_string;
+    typedef basic_string<Elem, char_traits<Elem>, Wide_alloc> wide_string;
+    typedef typename Codecvt::state_type                      state_type;
+    typedef typename wide_string::traits_type::int_type       int_type;
+
+    wstring_convert(Codecvt* pcvt = new Codecvt);          // before C++14
+    explicit wstring_convert(Codecvt* pcvt = new Codecvt); // before C++20
+    wstring_convert() : wstring_convert(new Codecvt) {}    // C++20
+    explicit wstring_convert(Codecvt* pcvt);               // C++20
+
+    wstring_convert(Codecvt* pcvt, state_type state);
+    explicit wstring_convert(const byte_string& byte_err,           // explicit in C++14
+                    const wide_string& wide_err = wide_string());
+    wstring_convert(const wstring_convert&) = delete;               // C++14
+    wstring_convert & operator=(const wstring_convert &) = delete;  // C++14
+    ~wstring_convert();
+
+    wide_string from_bytes(char byte);
+    wide_string from_bytes(const char* ptr);
+    wide_string from_bytes(const byte_string& str);
+    wide_string from_bytes(const char* first, const char* last);
+
+    byte_string to_bytes(Elem wchar);
+    byte_string to_bytes(const Elem* wptr);
+    byte_string to_bytes(const wide_string& wstr);
+    byte_string to_bytes(const Elem* first, const Elem* last);
+
+    size_t converted() const; // noexcept in C++14
+    state_type state() const;
+};
+
+template <class Codecvt, class Elem = wchar_t, class Tr = char_traits<Elem>>
+class wbuffer_convert
+    : public basic_streambuf<Elem, Tr>
+{
+public:
+    typedef typename Tr::state_type state_type;
+
+    wbuffer_convert(streambuf* bytebuf = 0, Codecvt* pcvt = new Codecvt,
+                    state_type state = state_type());          // before C++14
+    explicit wbuffer_convert(streambuf* bytebuf = nullptr, Codecvt* pcvt = new Codecvt,
+                            state_type state = state_type()); // before C++20
+    wbuffer_convert() : wbuffer_convert(nullptr) {} // C++20
+    explicit wbuffer_convert(streambuf* bytebuf, Codecvt* pcvt = new Codecvt,
+                            state_type state = state_type()); // C++20
+
+    wbuffer_convert(const wbuffer_convert&) = delete;               // C++14
+    wbuffer_convert & operator=(const wbuffer_convert &) = delete;  // C++14
+    ~wbuffer_convert();                                             // C++14
+
+    streambuf* rdbuf() const;
+    streambuf* rdbuf(streambuf* bytebuf);
+
+    state_type state() const;
+};
+
+// 22.4.1 and 22.4.1.3, ctype:
+class ctype_base;
+template <class charT> class ctype;
+template <> class ctype<char>; // specialization
+template <class charT> class ctype_byname;
+template <> class ctype_byname<char>; // specialization
+
+class codecvt_base;
+template <class internT, class externT, class stateT> class codecvt;
+template <class internT, class externT, class stateT> class codecvt_byname;
+
+// 22.4.2 and 22.4.3, numeric:
+template <class charT, class InputIterator> class num_get;
+template <class charT, class OutputIterator> class num_put;
+template <class charT> class numpunct;
+template <class charT> class numpunct_byname;
+
+// 22.4.4, col lation:
+template <class charT> class collate;
+template <class charT> class collate_byname;
+
+// 22.4.5, date and time:
+class time_base;
+template <class charT, class InputIterator> class time_get;
+template <class charT, class InputIterator> class time_get_byname;
+template <class charT, class OutputIterator> class time_put;
+template <class charT, class OutputIterator> class time_put_byname;
+
+// 22.4.6, money:
+class money_base;
+template <class charT, class InputIterator> class money_get;
+template <class charT, class OutputIterator> class money_put;
+template <class charT, bool Intl> class moneypunct;
+template <class charT, bool Intl> class moneypunct_byname;
+
+// 22.4.7, message retrieval:
+class messages_base;
+template <class charT> class messages;
+template <class charT> class messages_byname;
+
+}  // std
+
+*/
+
+#include <__algorithm/copy.h>
+#include <__algorithm/equal.h>
+#include <__algorithm/find.h>
+#include <__algorithm/max.h>
+#include <__algorithm/reverse.h>
+#include <__algorithm/unwrap_iter.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__debug>
+#include <__iterator/access.h>
+#include <__iterator/back_insert_iterator.h>
+#include <__iterator/istreambuf_iterator.h>
+#include <__iterator/ostreambuf_iterator.h>
+#include <__locale>
+#include <__memory/unique_ptr.h>
+#include <cstdio>
+#include <cstdlib>
+#include <ctime>
+#include <ios>
+#include <limits>
+#include <new>
+#include <streambuf>
+#include <version>
+
+// TODO: Fix __bsd_locale_defaults.h
+// NOLINTBEGIN(libcpp-robust-against-adl)
+
+#if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
+// Most unix variants have catopen.  These are the specific ones that don't.
+#  if !defined(__BIONIC__) && !defined(_NEWLIB_VERSION) && !defined(__EMSCRIPTEN__)
+#    define _LIBCPP_HAS_CATOPEN 1
+#    include <nl_types.h>
+#  endif
+#endif
+
+#ifdef _LIBCPP_LOCALE__L_EXTENSIONS
+#include <__bsd_locale_defaults.h>
+#else
+#include <__bsd_locale_fallbacks.h>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if defined(__APPLE__) || defined(__FreeBSD__)
+#  define _LIBCPP_GET_C_LOCALE 0
+#elif defined(__NetBSD__)
+#  define _LIBCPP_GET_C_LOCALE LC_C_LOCALE
+#else
+#  define _LIBCPP_GET_C_LOCALE __cloc()
+   // Get the C locale object
+   _LIBCPP_FUNC_VIS locale_t __cloc();
+#define __cloc_defined
+#endif
+
+// __scan_keyword
+// Scans [__b, __e) until a match is found in the basic_strings range
+//  [__kb, __ke) or until it can be shown that there is no match in [__kb, __ke).
+//  __b will be incremented (visibly), consuming CharT until a match is found
+//  or proved to not exist.  A keyword may be "", in which will match anything.
+//  If one keyword is a prefix of another, and the next CharT in the input
+//  might match another keyword, the algorithm will attempt to find the longest
+//  matching keyword.  If the longer matching keyword ends up not matching, then
+//  no keyword match is found.  If no keyword match is found, __ke is returned
+//  and failbit is set in __err.
+//  Else an iterator pointing to the matching keyword is found.  If more than
+//  one keyword matches, an iterator to the first matching keyword is returned.
+//  If on exit __b == __e, eofbit is set in __err.  If __case_sensitive is false,
+//  __ct is used to force to lower case before comparing characters.
+//  Examples:
+//  Keywords:  "a", "abb"
+//  If the input is "a", the first keyword matches and eofbit is set.
+//  If the input is "abc", no match is found and "ab" are consumed.
+template <class _InputIterator, class _ForwardIterator, class _Ctype>
+_LIBCPP_HIDE_FROM_ABI
+_ForwardIterator
+__scan_keyword(_InputIterator& __b, _InputIterator __e,
+               _ForwardIterator __kb, _ForwardIterator __ke,
+               const _Ctype& __ct, ios_base::iostate& __err,
+               bool __case_sensitive = true)
+{
+    typedef typename iterator_traits<_InputIterator>::value_type _CharT;
+    size_t __nkw = static_cast<size_t>(_VSTD::distance(__kb, __ke));
+    const unsigned char __doesnt_match = '\0';
+    const unsigned char __might_match = '\1';
+    const unsigned char __does_match = '\2';
+    unsigned char __statbuf[100];
+    unsigned char* __status = __statbuf;
+    unique_ptr<unsigned char, void(*)(void*)> __stat_hold(nullptr, free);
+    if (__nkw > sizeof(__statbuf))
+    {
+        __status = (unsigned char*)malloc(__nkw);
+        if (__status == nullptr)
+            __throw_bad_alloc();
+        __stat_hold.reset(__status);
+    }
+    size_t __n_might_match = __nkw;  // At this point, any keyword might match
+    size_t __n_does_match = 0;       // but none of them definitely do
+    // Initialize all statuses to __might_match, except for "" keywords are __does_match
+    unsigned char* __st = __status;
+    for (_ForwardIterator __ky = __kb; __ky != __ke; ++__ky, (void) ++__st)
+    {
+        if (!__ky->empty())
+            *__st = __might_match;
+        else
+        {
+            *__st = __does_match;
+            --__n_might_match;
+            ++__n_does_match;
+        }
+    }
+    // While there might be a match, test keywords against the next CharT
+    for (size_t __indx = 0; __b != __e && __n_might_match > 0; ++__indx)
+    {
+        // Peek at the next CharT but don't consume it
+        _CharT __c = *__b;
+        if (!__case_sensitive)
+            __c = __ct.toupper(__c);
+        bool __consume = false;
+        // For each keyword which might match, see if the __indx character is __c
+        // If a match if found, consume __c
+        // If a match is found, and that is the last character in the keyword,
+        //    then that keyword matches.
+        // If the keyword doesn't match this character, then change the keyword
+        //    to doesn't match
+        __st = __status;
+        for (_ForwardIterator __ky = __kb; __ky != __ke; ++__ky, (void) ++__st)
+        {
+            if (*__st == __might_match)
+            {
+                _CharT __kc = (*__ky)[__indx];
+                if (!__case_sensitive)
+                    __kc = __ct.toupper(__kc);
+                if (__c == __kc)
+                {
+                    __consume = true;
+                    if (__ky->size() == __indx+1)
+                    {
+                        *__st = __does_match;
+                        --__n_might_match;
+                        ++__n_does_match;
+                    }
+                }
+                else
+                {
+                    *__st = __doesnt_match;
+                    --__n_might_match;
+                }
+            }
+        }
+        // consume if we matched a character
+        if (__consume)
+        {
+            ++__b;
+            // If we consumed a character and there might be a matched keyword that
+            //   was marked matched on a previous iteration, then such keywords
+            //   which are now marked as not matching.
+            if (__n_might_match + __n_does_match > 1)
+            {
+                __st = __status;
+                for (_ForwardIterator __ky = __kb; __ky != __ke; ++__ky, (void) ++__st)
+                {
+                    if (*__st == __does_match && __ky->size() != __indx+1)
+                    {
+                        *__st = __doesnt_match;
+                        --__n_does_match;
+                    }
+                }
+            }
+        }
+    }
+    // We've exited the loop because we hit eof and/or we have no more "might matches".
+    if (__b == __e)
+        __err |= ios_base::eofbit;
+    // Return the first matching result
+    for (__st = __status; __kb != __ke; ++__kb, (void) ++__st)
+        if (*__st == __does_match)
+            break;
+    if (__kb == __ke)
+        __err |= ios_base::failbit;
+    return __kb;
+}
+
+struct _LIBCPP_TYPE_VIS __num_get_base
+{
+    static const int __num_get_buf_sz = 40;
+
+    static int __get_base(ios_base&);
+    static const char __src[33];
+};
+
+_LIBCPP_FUNC_VIS
+void __check_grouping(const string& __grouping, unsigned* __g, unsigned* __g_end,
+                      ios_base::iostate& __err);
+
+template <class _CharT>
+struct __num_get
+    : protected __num_get_base
+{
+    static string __stage2_float_prep(ios_base& __iob, _CharT* __atoms, _CharT& __decimal_point,
+                                      _CharT& __thousands_sep);
+
+    static int __stage2_float_loop(_CharT __ct, bool& __in_units, char& __exp,
+                                   char* __a, char*& __a_end,
+                                   _CharT __decimal_point, _CharT __thousands_sep,
+                                   const string& __grouping, unsigned* __g,
+                                   unsigned*& __g_end, unsigned& __dc, _CharT* __atoms);
+#ifndef _LIBCPP_ABI_OPTIMIZED_LOCALE_NUM_GET
+    static string __stage2_int_prep(ios_base& __iob, _CharT* __atoms, _CharT& __thousands_sep);
+    static int __stage2_int_loop(_CharT __ct, int __base, char* __a, char*& __a_end,
+                  unsigned& __dc, _CharT __thousands_sep, const string& __grouping,
+                  unsigned* __g, unsigned*& __g_end, _CharT* __atoms);
+
+#else
+    static string __stage2_int_prep(ios_base& __iob, _CharT& __thousands_sep)
+    {
+        locale __loc = __iob.getloc();
+        const numpunct<_CharT>& __np = use_facet<numpunct<_CharT> >(__loc);
+        __thousands_sep = __np.thousands_sep();
+        return __np.grouping();
+    }
+
+    const _CharT* __do_widen(ios_base& __iob, _CharT* __atoms) const
+    {
+      return __do_widen_p(__iob, __atoms);
+    }
+
+
+    static int __stage2_int_loop(_CharT __ct, int __base, char* __a, char*& __a_end,
+                  unsigned& __dc, _CharT __thousands_sep, const string& __grouping,
+                  unsigned* __g, unsigned*& __g_end, const _CharT* __atoms);
+private:
+    template<typename _Tp>
+    const _Tp* __do_widen_p(ios_base& __iob, _Tp* __atoms) const
+    {
+      locale __loc = __iob.getloc();
+      use_facet<ctype<_Tp> >(__loc).widen(__src, __src + 26, __atoms);
+      return __atoms;
+    }
+
+    const char* __do_widen_p(ios_base& __iob, char* __atoms) const
+    {
+      (void)__iob;
+      (void)__atoms;
+      return __src;
+    }
+#endif
+};
+
+#ifndef _LIBCPP_ABI_OPTIMIZED_LOCALE_NUM_GET
+template <class _CharT>
+string
+__num_get<_CharT>::__stage2_int_prep(ios_base& __iob, _CharT* __atoms, _CharT& __thousands_sep)
+{
+    locale __loc = __iob.getloc();
+    std::use_facet<ctype<_CharT> >(__loc).widen(__src, __src + 26, __atoms);
+    const numpunct<_CharT>& __np = std::use_facet<numpunct<_CharT> >(__loc);
+    __thousands_sep = __np.thousands_sep();
+    return __np.grouping();
+}
+#endif
+
+template <class _CharT>
+string
+__num_get<_CharT>::__stage2_float_prep(ios_base& __iob, _CharT* __atoms, _CharT& __decimal_point,
+                    _CharT& __thousands_sep)
+{
+    locale __loc = __iob.getloc();
+    std::use_facet<ctype<_CharT> >(__loc).widen(__src, __src + 32, __atoms);
+    const numpunct<_CharT>& __np = std::use_facet<numpunct<_CharT> >(__loc);
+    __decimal_point = __np.decimal_point();
+    __thousands_sep = __np.thousands_sep();
+    return __np.grouping();
+}
+
+template <class _CharT>
+int
+#ifndef _LIBCPP_ABI_OPTIMIZED_LOCALE_NUM_GET
+__num_get<_CharT>::__stage2_int_loop(_CharT __ct, int __base, char* __a, char*& __a_end,
+                  unsigned& __dc, _CharT __thousands_sep, const string& __grouping,
+                  unsigned* __g, unsigned*& __g_end, _CharT* __atoms)
+#else
+__num_get<_CharT>::__stage2_int_loop(_CharT __ct, int __base, char* __a, char*& __a_end,
+                  unsigned& __dc, _CharT __thousands_sep, const string& __grouping,
+                  unsigned* __g, unsigned*& __g_end, const _CharT* __atoms)
+
+#endif
+{
+    if (__a_end == __a && (__ct == __atoms[24] || __ct == __atoms[25]))
+    {
+        *__a_end++ = __ct == __atoms[24] ? '+' : '-';
+        __dc = 0;
+        return 0;
+    }
+    if (__grouping.size() != 0 && __ct == __thousands_sep)
+    {
+        if (__g_end-__g < __num_get_buf_sz)
+        {
+            *__g_end++ = __dc;
+            __dc = 0;
+        }
+        return 0;
+    }
+    ptrdiff_t __f = std::find(__atoms, __atoms + 26, __ct) - __atoms;
+    if (__f >= 24)
+        return -1;
+    switch (__base)
+    {
+    case 8:
+    case 10:
+        if (__f >= __base)
+            return -1;
+        break;
+    case 16:
+        if (__f < 22)
+            break;
+        if (__a_end != __a && __a_end - __a <= 2 && __a_end[-1] == '0')
+        {
+            __dc = 0;
+            *__a_end++ = __src[__f];
+            return 0;
+        }
+        return -1;
+    }
+    *__a_end++ = __src[__f];
+    ++__dc;
+    return 0;
+}
+
+template <class _CharT>
+int
+__num_get<_CharT>::__stage2_float_loop(_CharT __ct, bool& __in_units, char& __exp, char* __a, char*& __a_end,
+                    _CharT __decimal_point, _CharT __thousands_sep, const string& __grouping,
+                    unsigned* __g, unsigned*& __g_end, unsigned& __dc, _CharT* __atoms)
+{
+    if (__ct == __decimal_point)
+    {
+        if (!__in_units)
+            return -1;
+        __in_units = false;
+        *__a_end++ = '.';
+        if (__grouping.size() != 0 && __g_end-__g < __num_get_buf_sz)
+            *__g_end++ = __dc;
+        return 0;
+    }
+    if (__ct == __thousands_sep && __grouping.size() != 0)
+    {
+        if (!__in_units)
+            return -1;
+        if (__g_end-__g < __num_get_buf_sz)
+        {
+            *__g_end++ = __dc;
+            __dc = 0;
+        }
+        return 0;
+    }
+    ptrdiff_t __f = std::find(__atoms, __atoms + 32, __ct) - __atoms;
+    if (__f >= 32)
+        return -1;
+    char __x = __src[__f];
+    if (__x == '-' || __x == '+')
+    {
+        if (__a_end == __a || (std::toupper(__a_end[-1]) == std::toupper(__exp)))
+        {
+            *__a_end++ = __x;
+            return 0;
+        }
+        return -1;
+    }
+    if (__x == 'x' || __x == 'X')
+        __exp = 'P';
+    else if (std::toupper(__x) == __exp)
+    {
+        __exp = std::tolower(__exp);
+        if (__in_units)
+        {
+            __in_units = false;
+            if (__grouping.size() != 0 && __g_end-__g < __num_get_buf_sz)
+                *__g_end++ = __dc;
+        }
+    }
+    *__a_end++ = __x;
+    if (__f >= 22)
+        return 0;
+    ++__dc;
+    return 0;
+}
+
+extern template struct _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS __num_get<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template struct _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS __num_get<wchar_t>;
+#endif
+
+template <class _CharT, class _InputIterator = istreambuf_iterator<_CharT> >
+class _LIBCPP_TEMPLATE_VIS num_get
+    : public locale::facet,
+      private __num_get<_CharT>
+{
+public:
+    typedef _CharT char_type;
+    typedef _InputIterator iter_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit num_get(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, bool& __v) const
+    {
+        return do_get(__b, __e, __iob, __err, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, long& __v) const
+    {
+        return do_get(__b, __e, __iob, __err, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, long long& __v) const
+    {
+        return do_get(__b, __e, __iob, __err, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, unsigned short& __v) const
+    {
+        return do_get(__b, __e, __iob, __err, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, unsigned int& __v) const
+    {
+        return do_get(__b, __e, __iob, __err, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, unsigned long& __v) const
+    {
+        return do_get(__b, __e, __iob, __err, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, unsigned long long& __v) const
+    {
+        return do_get(__b, __e, __iob, __err, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, float& __v) const
+    {
+        return do_get(__b, __e, __iob, __err, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, double& __v) const
+    {
+        return do_get(__b, __e, __iob, __err, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, long double& __v) const
+    {
+        return do_get(__b, __e, __iob, __err, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, void*& __v) const
+    {
+        return do_get(__b, __e, __iob, __err, __v);
+    }
+
+    static locale::id id;
+
+protected:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~num_get() override {}
+
+    template <class _Fp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+    iter_type __do_get_floating_point
+                            (iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, _Fp& __v) const;
+
+    template <class _Signed>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+    iter_type __do_get_signed
+                            (iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, _Signed& __v) const;
+
+    template <class _Unsigned>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+    iter_type __do_get_unsigned
+                            (iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, _Unsigned& __v) const;
+
+
+    virtual iter_type do_get(iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, bool& __v) const;
+
+    virtual iter_type do_get(iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, long& __v) const
+    { return this->__do_get_signed ( __b, __e, __iob, __err, __v ); }
+
+    virtual iter_type do_get(iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, long long& __v) const
+    { return this->__do_get_signed ( __b, __e, __iob, __err, __v ); }
+
+    virtual iter_type do_get(iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, unsigned short& __v) const
+    { return this->__do_get_unsigned ( __b, __e, __iob, __err, __v ); }
+
+    virtual iter_type do_get(iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, unsigned int& __v) const
+    { return this->__do_get_unsigned ( __b, __e, __iob, __err, __v ); }
+
+    virtual iter_type do_get(iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, unsigned long& __v) const
+    { return this->__do_get_unsigned ( __b, __e, __iob, __err, __v ); }
+
+    virtual iter_type do_get(iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, unsigned long long& __v) const
+    { return this->__do_get_unsigned ( __b, __e, __iob, __err, __v ); }
+
+    virtual iter_type do_get(iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, float& __v) const
+    { return this->__do_get_floating_point ( __b, __e, __iob, __err, __v ); }
+
+    virtual iter_type do_get(iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, double& __v) const
+    { return this->__do_get_floating_point ( __b, __e, __iob, __err, __v ); }
+
+    virtual iter_type do_get(iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, long double& __v) const
+    { return this->__do_get_floating_point ( __b, __e, __iob, __err, __v ); }
+
+    virtual iter_type do_get(iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, void*& __v) const;
+};
+
+template <class _CharT, class _InputIterator>
+locale::id
+num_get<_CharT, _InputIterator>::id;
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI _Tp
+__num_get_signed_integral(const char* __a, const char* __a_end,
+                          ios_base::iostate& __err, int __base)
+{
+    if (__a != __a_end)
+    {
+        __libcpp_remove_reference_t<decltype(errno)> __save_errno = errno;
+        errno = 0;
+        char *__p2;
+        long long __ll = strtoll_l(__a, &__p2, __base, _LIBCPP_GET_C_LOCALE);
+        __libcpp_remove_reference_t<decltype(errno)> __current_errno = errno;
+        if (__current_errno == 0)
+            errno = __save_errno;
+        if (__p2 != __a_end)
+        {
+            __err = ios_base::failbit;
+            return 0;
+        }
+        else if (__current_errno == ERANGE         ||
+                 __ll < numeric_limits<_Tp>::min() ||
+                 numeric_limits<_Tp>::max() < __ll)
+        {
+            __err = ios_base::failbit;
+            if (__ll > 0)
+                return numeric_limits<_Tp>::max();
+            else
+                return numeric_limits<_Tp>::min();
+        }
+        return static_cast<_Tp>(__ll);
+    }
+    __err = ios_base::failbit;
+    return 0;
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI _Tp
+__num_get_unsigned_integral(const char* __a, const char* __a_end,
+                            ios_base::iostate& __err, int __base)
+{
+    if (__a != __a_end)
+    {
+        const bool __negate = *__a == '-';
+        if (__negate && ++__a == __a_end) {
+          __err = ios_base::failbit;
+          return 0;
+        }
+        __libcpp_remove_reference_t<decltype(errno)> __save_errno = errno;
+        errno = 0;
+        char *__p2;
+        unsigned long long __ll = strtoull_l(__a, &__p2, __base, _LIBCPP_GET_C_LOCALE);
+        __libcpp_remove_reference_t<decltype(errno)> __current_errno = errno;
+        if (__current_errno == 0)
+            errno = __save_errno;
+        if (__p2 != __a_end)
+        {
+            __err = ios_base::failbit;
+            return 0;
+        }
+        else if (__current_errno == ERANGE || numeric_limits<_Tp>::max() < __ll)
+        {
+            __err = ios_base::failbit;
+            return numeric_limits<_Tp>::max();
+        }
+        _Tp __res = static_cast<_Tp>(__ll);
+        if (__negate) __res = -__res;
+        return __res;
+    }
+    __err = ios_base::failbit;
+    return 0;
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp __do_strtod(const char* __a, char** __p2);
+
+template <>
+inline _LIBCPP_INLINE_VISIBILITY
+float __do_strtod<float>(const char* __a, char** __p2) {
+    return strtof_l(__a, __p2, _LIBCPP_GET_C_LOCALE);
+}
+
+template <>
+inline _LIBCPP_INLINE_VISIBILITY
+double __do_strtod<double>(const char* __a, char** __p2) {
+    return strtod_l(__a, __p2, _LIBCPP_GET_C_LOCALE);
+}
+
+template <>
+inline _LIBCPP_INLINE_VISIBILITY
+long double __do_strtod<long double>(const char* __a, char** __p2) {
+    return strtold_l(__a, __p2, _LIBCPP_GET_C_LOCALE);
+}
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI
+_Tp
+__num_get_float(const char* __a, const char* __a_end, ios_base::iostate& __err)
+{
+    if (__a != __a_end)
+    {
+        __libcpp_remove_reference_t<decltype(errno)> __save_errno = errno;
+        errno = 0;
+        char *__p2;
+        _Tp __ld = std::__do_strtod<_Tp>(__a, &__p2);
+        __libcpp_remove_reference_t<decltype(errno)> __current_errno = errno;
+        if (__current_errno == 0)
+            errno = __save_errno;
+        if (__p2 != __a_end)
+        {
+            __err = ios_base::failbit;
+            return 0;
+        }
+        else if (__current_errno == ERANGE)
+            __err = ios_base::failbit;
+        return __ld;
+    }
+    __err = ios_base::failbit;
+    return 0;
+}
+
+template <class _CharT, class _InputIterator>
+_InputIterator
+num_get<_CharT, _InputIterator>::do_get(iter_type __b, iter_type __e,
+                                        ios_base& __iob,
+                                        ios_base::iostate& __err,
+                                        bool& __v) const
+{
+    if ((__iob.flags() & ios_base::boolalpha) == 0)
+    {
+        long __lv = -1;
+        __b = do_get(__b, __e, __iob, __err, __lv);
+        switch (__lv)
+        {
+        case 0:
+            __v = false;
+            break;
+        case 1:
+            __v = true;
+            break;
+        default:
+            __v = true;
+            __err = ios_base::failbit;
+            break;
+        }
+        return __b;
+    }
+    const ctype<_CharT>& __ct = std::use_facet<ctype<_CharT> >(__iob.getloc());
+    const numpunct<_CharT>& __np = std::use_facet<numpunct<_CharT> >(__iob.getloc());
+    typedef typename numpunct<_CharT>::string_type string_type;
+    const string_type __names[2] = {__np.truename(), __np.falsename()};
+    const string_type* __i = _VSTD::__scan_keyword(__b, __e, __names, __names+2,
+                                                   __ct, __err);
+    __v = __i == __names;
+    return __b;
+}
+
+// signed
+
+template <class _CharT, class _InputIterator>
+template <class _Signed>
+_InputIterator
+num_get<_CharT, _InputIterator>::__do_get_signed(iter_type __b, iter_type __e,
+                                        ios_base& __iob,
+                                        ios_base::iostate& __err,
+                                        _Signed& __v) const
+{
+    // Stage 1
+    int __base = this->__get_base(__iob);
+    // Stage 2
+    char_type __thousands_sep;
+    const int __atoms_size = 26;
+#ifdef _LIBCPP_ABI_OPTIMIZED_LOCALE_NUM_GET
+    char_type __atoms1[__atoms_size];
+    const char_type *__atoms = this->__do_widen(__iob, __atoms1);
+    string __grouping = this->__stage2_int_prep(__iob, __thousands_sep);
+#else
+    char_type __atoms[__atoms_size];
+    string __grouping = this->__stage2_int_prep(__iob, __atoms, __thousands_sep);
+#endif
+    string __buf;
+    __buf.resize(__buf.capacity());
+    char* __a = &__buf[0];
+    char* __a_end = __a;
+    unsigned __g[__num_get_base::__num_get_buf_sz];
+    unsigned* __g_end = __g;
+    unsigned __dc = 0;
+    for (; __b != __e; ++__b)
+    {
+        if (__a_end == __a + __buf.size())
+        {
+            size_t __tmp = __buf.size();
+            __buf.resize(2*__buf.size());
+            __buf.resize(__buf.capacity());
+            __a = &__buf[0];
+            __a_end = __a + __tmp;
+        }
+        if (this->__stage2_int_loop(*__b, __base, __a, __a_end, __dc,
+                                    __thousands_sep, __grouping, __g, __g_end,
+                                    __atoms))
+            break;
+    }
+    if (__grouping.size() != 0 && __g_end-__g < __num_get_base::__num_get_buf_sz)
+        *__g_end++ = __dc;
+    // Stage 3
+    __v = std::__num_get_signed_integral<_Signed>(__a, __a_end, __err, __base);
+    // Digit grouping checked
+    __check_grouping(__grouping, __g, __g_end, __err);
+    // EOF checked
+    if (__b == __e)
+        __err |= ios_base::eofbit;
+    return __b;
+}
+
+// unsigned
+
+template <class _CharT, class _InputIterator>
+template <class _Unsigned>
+_InputIterator
+num_get<_CharT, _InputIterator>::__do_get_unsigned(iter_type __b, iter_type __e,
+                                        ios_base& __iob,
+                                        ios_base::iostate& __err,
+                                        _Unsigned& __v) const
+{
+    // Stage 1
+    int __base = this->__get_base(__iob);
+    // Stage 2
+    char_type __thousands_sep;
+    const int __atoms_size = 26;
+#ifdef _LIBCPP_ABI_OPTIMIZED_LOCALE_NUM_GET
+    char_type __atoms1[__atoms_size];
+    const char_type *__atoms = this->__do_widen(__iob, __atoms1);
+    string __grouping = this->__stage2_int_prep(__iob, __thousands_sep);
+#else
+    char_type __atoms[__atoms_size];
+    string __grouping = this->__stage2_int_prep(__iob, __atoms, __thousands_sep);
+#endif
+    string __buf;
+    __buf.resize(__buf.capacity());
+    char* __a = &__buf[0];
+    char* __a_end = __a;
+    unsigned __g[__num_get_base::__num_get_buf_sz];
+    unsigned* __g_end = __g;
+    unsigned __dc = 0;
+    for (; __b != __e; ++__b)
+    {
+        if (__a_end == __a + __buf.size())
+        {
+            size_t __tmp = __buf.size();
+            __buf.resize(2*__buf.size());
+            __buf.resize(__buf.capacity());
+            __a = &__buf[0];
+            __a_end = __a + __tmp;
+        }
+        if (this->__stage2_int_loop(*__b, __base, __a, __a_end, __dc,
+                                    __thousands_sep, __grouping, __g, __g_end,
+                                    __atoms))
+            break;
+    }
+    if (__grouping.size() != 0 && __g_end-__g < __num_get_base::__num_get_buf_sz)
+        *__g_end++ = __dc;
+    // Stage 3
+    __v = std::__num_get_unsigned_integral<_Unsigned>(__a, __a_end, __err, __base);
+    // Digit grouping checked
+    __check_grouping(__grouping, __g, __g_end, __err);
+    // EOF checked
+    if (__b == __e)
+        __err |= ios_base::eofbit;
+    return __b;
+}
+
+// floating point
+
+template <class _CharT, class _InputIterator>
+template <class _Fp>
+_InputIterator
+num_get<_CharT, _InputIterator>::__do_get_floating_point(iter_type __b, iter_type __e,
+                                        ios_base& __iob,
+                                        ios_base::iostate& __err,
+                                        _Fp& __v) const
+{
+    // Stage 1, nothing to do
+    // Stage 2
+    char_type __atoms[32];
+    char_type __decimal_point;
+    char_type __thousands_sep;
+    string __grouping = this->__stage2_float_prep(__iob, __atoms,
+                                                  __decimal_point,
+                                                  __thousands_sep);
+    string __buf;
+    __buf.resize(__buf.capacity());
+    char* __a = &__buf[0];
+    char* __a_end = __a;
+    unsigned __g[__num_get_base::__num_get_buf_sz];
+    unsigned* __g_end = __g;
+    unsigned __dc = 0;
+    bool __in_units = true;
+    char __exp = 'E';
+    for (; __b != __e; ++__b)
+    {
+        if (__a_end == __a + __buf.size())
+        {
+            size_t __tmp = __buf.size();
+            __buf.resize(2*__buf.size());
+            __buf.resize(__buf.capacity());
+            __a = &__buf[0];
+            __a_end = __a + __tmp;
+        }
+        if (this->__stage2_float_loop(*__b, __in_units, __exp, __a, __a_end,
+                                      __decimal_point, __thousands_sep,
+                                      __grouping, __g, __g_end,
+                                      __dc, __atoms))
+            break;
+    }
+    if (__grouping.size() != 0 && __in_units && __g_end-__g < __num_get_base::__num_get_buf_sz)
+        *__g_end++ = __dc;
+    // Stage 3
+    __v = std::__num_get_float<_Fp>(__a, __a_end, __err);
+    // Digit grouping checked
+    __check_grouping(__grouping, __g, __g_end, __err);
+    // EOF checked
+    if (__b == __e)
+        __err |= ios_base::eofbit;
+    return __b;
+}
+
+template <class _CharT, class _InputIterator>
+_InputIterator
+num_get<_CharT, _InputIterator>::do_get(iter_type __b, iter_type __e,
+                                        ios_base& __iob,
+                                        ios_base::iostate& __err,
+                                        void*& __v) const
+{
+    // Stage 1
+    int __base = 16;
+    // Stage 2
+    char_type __atoms[26];
+    char_type __thousands_sep = 0;
+    string __grouping;
+    std::use_facet<ctype<_CharT> >(__iob.getloc()).widen(__num_get_base::__src,
+                                                         __num_get_base::__src + 26, __atoms);
+    string __buf;
+    __buf.resize(__buf.capacity());
+    char* __a = &__buf[0];
+    char* __a_end = __a;
+    unsigned __g[__num_get_base::__num_get_buf_sz];
+    unsigned* __g_end = __g;
+    unsigned __dc = 0;
+    for (; __b != __e; ++__b)
+    {
+        if (__a_end == __a + __buf.size())
+        {
+            size_t __tmp = __buf.size();
+            __buf.resize(2*__buf.size());
+            __buf.resize(__buf.capacity());
+            __a = &__buf[0];
+            __a_end = __a + __tmp;
+        }
+        if (this->__stage2_int_loop(*__b, __base, __a, __a_end, __dc,
+                                    __thousands_sep, __grouping,
+                                    __g, __g_end, __atoms))
+            break;
+    }
+    // Stage 3
+    __buf.resize(__a_end - __a);
+    if (__libcpp_sscanf_l(__buf.c_str(), _LIBCPP_GET_C_LOCALE, "%p", &__v) != 1)
+        __err = ios_base::failbit;
+    // EOF checked
+    if (__b == __e)
+        __err |= ios_base::eofbit;
+    return __b;
+}
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS num_get<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS num_get<wchar_t>;
+#endif
+
+struct _LIBCPP_TYPE_VIS __num_put_base
+{
+protected:
+    static void __format_int(char* __fmt, const char* __len, bool __signd,
+                             ios_base::fmtflags __flags);
+    static bool __format_float(char* __fmt, const char* __len,
+                               ios_base::fmtflags __flags);
+    static char* __identify_padding(char* __nb, char* __ne,
+                                    const ios_base& __iob);
+};
+
+template <class _CharT>
+struct __num_put
+    : protected __num_put_base
+{
+    static void __widen_and_group_int(char* __nb, char* __np, char* __ne,
+                                      _CharT* __ob, _CharT*& __op, _CharT*& __oe,
+                                      const locale& __loc);
+    static void __widen_and_group_float(char* __nb, char* __np, char* __ne,
+                                        _CharT* __ob, _CharT*& __op, _CharT*& __oe,
+                                        const locale& __loc);
+};
+
+template <class _CharT>
+void
+__num_put<_CharT>::__widen_and_group_int(char* __nb, char* __np, char* __ne,
+                                         _CharT* __ob, _CharT*& __op, _CharT*& __oe,
+                                         const locale& __loc)
+{
+    const ctype<_CharT>&    __ct = std::use_facet<ctype<_CharT> >   (__loc);
+    const numpunct<_CharT>& __npt = std::use_facet<numpunct<_CharT> >(__loc);
+    string __grouping = __npt.grouping();
+    if (__grouping.empty())
+    {
+        __ct.widen(__nb, __ne, __ob);
+        __oe = __ob + (__ne - __nb);
+    }
+    else
+    {
+        __oe = __ob;
+        char* __nf = __nb;
+        if (*__nf == '-' || *__nf == '+')
+            *__oe++ = __ct.widen(*__nf++);
+        if (__ne - __nf >= 2 && __nf[0] == '0' && (__nf[1] == 'x' ||
+                                                   __nf[1] == 'X'))
+        {
+            *__oe++ = __ct.widen(*__nf++);
+            *__oe++ = __ct.widen(*__nf++);
+        }
+        std::reverse(__nf, __ne);
+        _CharT __thousands_sep = __npt.thousands_sep();
+        unsigned __dc = 0;
+        unsigned __dg = 0;
+        for (char* __p = __nf; __p < __ne; ++__p)
+        {
+            if (static_cast<unsigned>(__grouping[__dg]) > 0 &&
+                __dc == static_cast<unsigned>(__grouping[__dg]))
+            {
+                *__oe++ = __thousands_sep;
+                __dc = 0;
+                if (__dg < __grouping.size()-1)
+                    ++__dg;
+            }
+            *__oe++ = __ct.widen(*__p);
+            ++__dc;
+        }
+        std::reverse(__ob + (__nf - __nb), __oe);
+    }
+    if (__np == __ne)
+        __op = __oe;
+    else
+        __op = __ob + (__np - __nb);
+}
+
+template <class _CharT>
+void
+__num_put<_CharT>::__widen_and_group_float(char* __nb, char* __np, char* __ne,
+                                           _CharT* __ob, _CharT*& __op, _CharT*& __oe,
+                                           const locale& __loc)
+{
+    const ctype<_CharT>&    __ct = std::use_facet<ctype<_CharT> >   (__loc);
+    const numpunct<_CharT>& __npt = std::use_facet<numpunct<_CharT> >(__loc);
+    string __grouping = __npt.grouping();
+    __oe = __ob;
+    char* __nf = __nb;
+    if (*__nf == '-' || *__nf == '+')
+        *__oe++ = __ct.widen(*__nf++);
+    char* __ns;
+    if (__ne - __nf >= 2 && __nf[0] == '0' && (__nf[1] == 'x' ||
+                                               __nf[1] == 'X'))
+    {
+        *__oe++ = __ct.widen(*__nf++);
+        *__oe++ = __ct.widen(*__nf++);
+        for (__ns = __nf; __ns < __ne; ++__ns)
+            if (!isxdigit_l(*__ns, _LIBCPP_GET_C_LOCALE))
+                break;
+    }
+    else
+    {
+        for (__ns = __nf; __ns < __ne; ++__ns)
+            if (!isdigit_l(*__ns, _LIBCPP_GET_C_LOCALE))
+                break;
+    }
+    if (__grouping.empty())
+    {
+        __ct.widen(__nf, __ns, __oe);
+        __oe += __ns - __nf;
+    }
+    else
+    {
+        std::reverse(__nf, __ns);
+        _CharT __thousands_sep = __npt.thousands_sep();
+        unsigned __dc = 0;
+        unsigned __dg = 0;
+        for (char* __p = __nf; __p < __ns; ++__p)
+        {
+            if (__grouping[__dg] > 0 && __dc == static_cast<unsigned>(__grouping[__dg]))
+            {
+                *__oe++ = __thousands_sep;
+                __dc = 0;
+                if (__dg < __grouping.size()-1)
+                    ++__dg;
+            }
+            *__oe++ = __ct.widen(*__p);
+            ++__dc;
+        }
+        std::reverse(__ob + (__nf - __nb), __oe);
+    }
+    for (__nf = __ns; __nf < __ne; ++__nf)
+    {
+        if (*__nf == '.')
+        {
+            *__oe++ = __npt.decimal_point();
+            ++__nf;
+            break;
+        }
+        else
+            *__oe++ = __ct.widen(*__nf);
+    }
+    __ct.widen(__nf, __ne, __oe);
+    __oe += __ne - __nf;
+    if (__np == __ne)
+        __op = __oe;
+    else
+        __op = __ob + (__np - __nb);
+}
+
+extern template struct _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS __num_put<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template struct _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS __num_put<wchar_t>;
+#endif
+
+template <class _CharT, class _OutputIterator = ostreambuf_iterator<_CharT> >
+class _LIBCPP_TEMPLATE_VIS num_put
+    : public locale::facet,
+      private __num_put<_CharT>
+{
+public:
+    typedef _CharT char_type;
+    typedef _OutputIterator iter_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit num_put(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type put(iter_type __s, ios_base& __iob, char_type __fl,
+                  bool __v) const
+    {
+        return do_put(__s, __iob, __fl, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type put(iter_type __s, ios_base& __iob, char_type __fl,
+                  long __v) const
+    {
+        return do_put(__s, __iob, __fl, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type put(iter_type __s, ios_base& __iob, char_type __fl,
+                  long long __v) const
+    {
+        return do_put(__s, __iob, __fl, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type put(iter_type __s, ios_base& __iob, char_type __fl,
+                  unsigned long __v) const
+    {
+        return do_put(__s, __iob, __fl, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type put(iter_type __s, ios_base& __iob, char_type __fl,
+                  unsigned long long __v) const
+    {
+        return do_put(__s, __iob, __fl, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type put(iter_type __s, ios_base& __iob, char_type __fl,
+                  double __v) const
+    {
+        return do_put(__s, __iob, __fl, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type put(iter_type __s, ios_base& __iob, char_type __fl,
+                  long double __v) const
+    {
+        return do_put(__s, __iob, __fl, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type put(iter_type __s, ios_base& __iob, char_type __fl,
+                  const void* __v) const
+    {
+        return do_put(__s, __iob, __fl, __v);
+    }
+
+    static locale::id id;
+
+protected:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~num_put() override {}
+
+    virtual iter_type do_put(iter_type __s, ios_base& __iob, char_type __fl,
+                             bool __v) const;
+    virtual iter_type do_put(iter_type __s, ios_base& __iob, char_type __fl,
+                             long __v) const;
+    virtual iter_type do_put(iter_type __s, ios_base& __iob, char_type __fl,
+                             long long __v) const;
+    virtual iter_type do_put(iter_type __s, ios_base& __iob, char_type __fl,
+                             unsigned long) const;
+    virtual iter_type do_put(iter_type __s, ios_base& __iob, char_type __fl,
+                             unsigned long long) const;
+    virtual iter_type do_put(iter_type __s, ios_base& __iob, char_type __fl,
+                             double __v) const;
+    virtual iter_type do_put(iter_type __s, ios_base& __iob, char_type __fl,
+                             long double __v) const;
+    virtual iter_type do_put(iter_type __s, ios_base& __iob, char_type __fl,
+                             const void* __v) const;
+
+    template <class _Integral>
+    _LIBCPP_HIDE_FROM_ABI inline
+    _OutputIterator __do_put_integral(iter_type __s, ios_base& __iob,
+                                      char_type __fl, _Integral __v,
+                                      char const* __len) const;
+
+    template <class _Float>
+    _LIBCPP_HIDE_FROM_ABI inline
+    _OutputIterator __do_put_floating_point(iter_type __s, ios_base& __iob,
+                                            char_type __fl, _Float __v,
+                                            char const* __len) const;
+};
+
+template <class _CharT, class _OutputIterator>
+locale::id
+num_put<_CharT, _OutputIterator>::id;
+
+template <class _CharT, class _OutputIterator>
+_LIBCPP_HIDE_FROM_ABI
+_OutputIterator
+__pad_and_output(_OutputIterator __s,
+                 const _CharT* __ob, const _CharT* __op, const _CharT* __oe,
+                 ios_base& __iob, _CharT __fl)
+{
+    streamsize __sz = __oe - __ob;
+    streamsize __ns = __iob.width();
+    if (__ns > __sz)
+        __ns -= __sz;
+    else
+        __ns = 0;
+    for (;__ob < __op; ++__ob, ++__s)
+        *__s = *__ob;
+    for (; __ns; --__ns, ++__s)
+        *__s = __fl;
+    for (; __ob < __oe; ++__ob, ++__s)
+        *__s = *__ob;
+    __iob.width(0);
+    return __s;
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI
+ostreambuf_iterator<_CharT, _Traits>
+__pad_and_output(ostreambuf_iterator<_CharT, _Traits> __s,
+                 const _CharT* __ob, const _CharT* __op, const _CharT* __oe,
+                 ios_base& __iob, _CharT __fl)
+{
+    if (__s.__sbuf_ == nullptr)
+        return __s;
+    streamsize __sz = __oe - __ob;
+    streamsize __ns = __iob.width();
+    if (__ns > __sz)
+        __ns -= __sz;
+    else
+        __ns = 0;
+    streamsize __np = __op - __ob;
+    if (__np > 0)
+    {
+        if (__s.__sbuf_->sputn(__ob, __np) != __np)
+        {
+            __s.__sbuf_ = nullptr;
+            return __s;
+        }
+    }
+    if (__ns > 0)
+    {
+        basic_string<_CharT, _Traits> __sp(__ns, __fl);
+        if (__s.__sbuf_->sputn(__sp.data(), __ns) != __ns)
+        {
+            __s.__sbuf_ = nullptr;
+            return __s;
+        }
+    }
+    __np = __oe - __op;
+    if (__np > 0)
+    {
+        if (__s.__sbuf_->sputn(__op, __np) != __np)
+        {
+            __s.__sbuf_ = nullptr;
+            return __s;
+        }
+    }
+    __iob.width(0);
+    return __s;
+}
+
+template <class _CharT, class _OutputIterator>
+_OutputIterator
+num_put<_CharT, _OutputIterator>::do_put(iter_type __s, ios_base& __iob,
+                                         char_type __fl, bool __v) const
+{
+    if ((__iob.flags() & ios_base::boolalpha) == 0)
+        return do_put(__s, __iob, __fl, (unsigned long)__v);
+    const numpunct<char_type>& __np = std::use_facet<numpunct<char_type> >(__iob.getloc());
+    typedef typename numpunct<char_type>::string_type string_type;
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    string_type __tmp(__v ? __np.truename() : __np.falsename());
+    string_type __nm = _VSTD::move(__tmp);
+#else
+    string_type __nm = __v ? __np.truename() : __np.falsename();
+#endif
+    for (typename string_type::iterator __i = __nm.begin(); __i != __nm.end(); ++__i, ++__s)
+        *__s = *__i;
+    return __s;
+}
+
+template <class _CharT, class _OutputIterator>
+template <class _Integral>
+_LIBCPP_HIDE_FROM_ABI inline
+_OutputIterator
+num_put<_CharT, _OutputIterator>::__do_put_integral(iter_type __s, ios_base& __iob,
+                                                    char_type __fl, _Integral __v,
+                                                    char const* __len) const
+{
+    // Stage 1 - Get number in narrow char
+    char __fmt[8] = {'%', 0};
+    this->__format_int(__fmt+1, __len, is_signed<_Integral>::value, __iob.flags());
+    // Worst case is octal, with showbase enabled. Note that octal is always
+    // printed as an unsigned value.
+    using _Unsigned = typename make_unsigned<_Integral>::type;
+    _LIBCPP_CONSTEXPR const unsigned __nbuf
+        = (numeric_limits<_Unsigned>::digits / 3)        // 1 char per 3 bits
+        + ((numeric_limits<_Unsigned>::digits % 3) != 0) // round up
+        + 2; // base prefix + terminating null character
+    char __nar[__nbuf];
+    _LIBCPP_DIAGNOSTIC_PUSH
+    _LIBCPP_CLANG_DIAGNOSTIC_IGNORED("-Wformat-nonliteral")
+    _LIBCPP_GCC_DIAGNOSTIC_IGNORED("-Wformat-nonliteral")
+    int __nc = __libcpp_snprintf_l(__nar, sizeof(__nar), _LIBCPP_GET_C_LOCALE, __fmt, __v);
+    _LIBCPP_DIAGNOSTIC_POP
+    char* __ne = __nar + __nc;
+    char* __np = this->__identify_padding(__nar, __ne, __iob);
+    // Stage 2 - Widen __nar while adding thousands separators
+    char_type __o[2*(__nbuf-1) - 1];
+    char_type* __op;  // pad here
+    char_type* __oe;  // end of output
+    this->__widen_and_group_int(__nar, __np, __ne, __o, __op, __oe, __iob.getloc());
+    // [__o, __oe) contains thousands_sep'd wide number
+    // Stage 3 & 4
+    return std::__pad_and_output(__s, __o, __op, __oe, __iob, __fl);
+}
+
+template <class _CharT, class _OutputIterator>
+_OutputIterator
+num_put<_CharT, _OutputIterator>::do_put(iter_type __s, ios_base& __iob,
+                                         char_type __fl, long __v) const
+{
+    return this->__do_put_integral(__s, __iob, __fl, __v, "l");
+}
+
+template <class _CharT, class _OutputIterator>
+_OutputIterator
+num_put<_CharT, _OutputIterator>::do_put(iter_type __s, ios_base& __iob,
+                                         char_type __fl, long long __v) const
+{
+    return this->__do_put_integral(__s, __iob, __fl, __v, "ll");
+}
+
+template <class _CharT, class _OutputIterator>
+_OutputIterator
+num_put<_CharT, _OutputIterator>::do_put(iter_type __s, ios_base& __iob,
+                                         char_type __fl, unsigned long __v) const
+{
+    return this->__do_put_integral(__s, __iob, __fl, __v, "l");
+}
+
+template <class _CharT, class _OutputIterator>
+_OutputIterator
+num_put<_CharT, _OutputIterator>::do_put(iter_type __s, ios_base& __iob,
+                                         char_type __fl, unsigned long long __v) const
+{
+    return this->__do_put_integral(__s, __iob, __fl, __v, "ll");
+}
+
+template <class _CharT, class _OutputIterator>
+template <class _Float>
+_LIBCPP_HIDE_FROM_ABI inline
+_OutputIterator
+num_put<_CharT, _OutputIterator>::__do_put_floating_point(iter_type __s, ios_base& __iob,
+                                                          char_type __fl, _Float __v,
+                                                          char const* __len) const
+{
+    // Stage 1 - Get number in narrow char
+    char __fmt[8] = {'%', 0};
+    bool __specify_precision = this->__format_float(__fmt+1, __len, __iob.flags());
+    const unsigned __nbuf = 30;
+    char __nar[__nbuf];
+    char* __nb = __nar;
+    int __nc;
+    _LIBCPP_DIAGNOSTIC_PUSH
+    _LIBCPP_CLANG_DIAGNOSTIC_IGNORED("-Wformat-nonliteral")
+    _LIBCPP_GCC_DIAGNOSTIC_IGNORED("-Wformat-nonliteral")
+    if (__specify_precision)
+        __nc = __libcpp_snprintf_l(__nb, __nbuf, _LIBCPP_GET_C_LOCALE, __fmt,
+                                   (int)__iob.precision(), __v);
+    else
+        __nc = __libcpp_snprintf_l(__nb, __nbuf, _LIBCPP_GET_C_LOCALE, __fmt, __v);
+    unique_ptr<char, void(*)(void*)> __nbh(nullptr, free);
+    if (__nc > static_cast<int>(__nbuf-1))
+    {
+        if (__specify_precision)
+            __nc = __libcpp_asprintf_l(&__nb, _LIBCPP_GET_C_LOCALE, __fmt, (int)__iob.precision(), __v);
+        else
+            __nc = __libcpp_asprintf_l(&__nb, _LIBCPP_GET_C_LOCALE, __fmt, __v);
+        if (__nc == -1)
+            __throw_bad_alloc();
+        __nbh.reset(__nb);
+    }
+    _LIBCPP_DIAGNOSTIC_POP
+    char* __ne = __nb + __nc;
+    char* __np = this->__identify_padding(__nb, __ne, __iob);
+    // Stage 2 - Widen __nar while adding thousands separators
+    char_type __o[2*(__nbuf-1) - 1];
+    char_type* __ob = __o;
+    unique_ptr<char_type, void(*)(void*)> __obh(0, free);
+    if (__nb != __nar)
+    {
+        __ob = (char_type*)malloc(2*static_cast<size_t>(__nc)*sizeof(char_type));
+        if (__ob == 0)
+            __throw_bad_alloc();
+        __obh.reset(__ob);
+    }
+    char_type* __op;  // pad here
+    char_type* __oe;  // end of output
+    this->__widen_and_group_float(__nb, __np, __ne, __ob, __op, __oe, __iob.getloc());
+    // [__o, __oe) contains thousands_sep'd wide number
+    // Stage 3 & 4
+    __s = std::__pad_and_output(__s, __ob, __op, __oe, __iob, __fl);
+    return __s;
+}
+
+template <class _CharT, class _OutputIterator>
+_OutputIterator
+num_put<_CharT, _OutputIterator>::do_put(iter_type __s, ios_base& __iob,
+                                         char_type __fl, double __v) const
+{
+    return this->__do_put_floating_point(__s, __iob, __fl, __v, "");
+}
+
+template <class _CharT, class _OutputIterator>
+_OutputIterator
+num_put<_CharT, _OutputIterator>::do_put(iter_type __s, ios_base& __iob,
+                                         char_type __fl, long double __v) const
+{
+    return this->__do_put_floating_point(__s, __iob, __fl, __v, "L");
+}
+
+template <class _CharT, class _OutputIterator>
+_OutputIterator
+num_put<_CharT, _OutputIterator>::do_put(iter_type __s, ios_base& __iob,
+                                         char_type __fl, const void* __v) const
+{
+    // Stage 1 - Get pointer in narrow char
+    const unsigned __nbuf = 20;
+    char __nar[__nbuf];
+    int __nc = __libcpp_snprintf_l(__nar, sizeof(__nar), _LIBCPP_GET_C_LOCALE, "%p", __v);
+    char* __ne = __nar + __nc;
+    char* __np = this->__identify_padding(__nar, __ne, __iob);
+    // Stage 2 - Widen __nar
+    char_type __o[2*(__nbuf-1) - 1];
+    char_type* __op;  // pad here
+    char_type* __oe;  // end of output
+    const ctype<char_type>& __ct = std::use_facet<ctype<char_type> >(__iob.getloc());
+    __ct.widen(__nar, __ne, __o);
+    __oe = __o + (__ne - __nar);
+    if (__np == __ne)
+        __op = __oe;
+    else
+        __op = __o + (__np - __nar);
+    // [__o, __oe) contains wide number
+    // Stage 3 & 4
+    return std::__pad_and_output(__s, __o, __op, __oe, __iob, __fl);
+}
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS num_put<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS num_put<wchar_t>;
+#endif
+
+template <class _CharT, class _InputIterator>
+_LIBCPP_HIDE_FROM_ABI
+int
+__get_up_to_n_digits(_InputIterator& __b, _InputIterator __e,
+                     ios_base::iostate& __err, const ctype<_CharT>& __ct, int __n)
+{
+    // Precondition:  __n >= 1
+    if (__b == __e)
+    {
+        __err |= ios_base::eofbit | ios_base::failbit;
+        return 0;
+    }
+    // get first digit
+    _CharT __c = *__b;
+    if (!__ct.is(ctype_base::digit, __c))
+    {
+        __err |= ios_base::failbit;
+        return 0;
+    }
+    int __r = __ct.narrow(__c, 0) - '0';
+    for (++__b, (void) --__n; __b != __e && __n > 0; ++__b, (void) --__n)
+    {
+        // get next digit
+        __c = *__b;
+        if (!__ct.is(ctype_base::digit, __c))
+            return __r;
+        __r = __r * 10 + __ct.narrow(__c, 0) - '0';
+    }
+    if (__b == __e)
+        __err |= ios_base::eofbit;
+    return __r;
+}
+
+class _LIBCPP_TYPE_VIS time_base
+{
+public:
+    enum dateorder {no_order, dmy, mdy, ymd, ydm};
+};
+
+template <class _CharT>
+class _LIBCPP_TEMPLATE_VIS __time_get_c_storage
+{
+protected:
+    typedef basic_string<_CharT> string_type;
+
+    virtual const string_type* __weeks() const;
+    virtual const string_type* __months() const;
+    virtual const string_type* __am_pm() const;
+    virtual const string_type& __c() const;
+    virtual const string_type& __r() const;
+    virtual const string_type& __x() const;
+    virtual const string_type& __X() const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~__time_get_c_storage() {}
+};
+
+template <> _LIBCPP_FUNC_VIS const string* __time_get_c_storage<char>::__weeks() const;
+template <> _LIBCPP_FUNC_VIS const string* __time_get_c_storage<char>::__months() const;
+template <> _LIBCPP_FUNC_VIS const string* __time_get_c_storage<char>::__am_pm() const;
+template <> _LIBCPP_FUNC_VIS const string& __time_get_c_storage<char>::__c() const;
+template <> _LIBCPP_FUNC_VIS const string& __time_get_c_storage<char>::__r() const;
+template <> _LIBCPP_FUNC_VIS const string& __time_get_c_storage<char>::__x() const;
+template <> _LIBCPP_FUNC_VIS const string& __time_get_c_storage<char>::__X() const;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <> _LIBCPP_FUNC_VIS const wstring* __time_get_c_storage<wchar_t>::__weeks() const;
+template <> _LIBCPP_FUNC_VIS const wstring* __time_get_c_storage<wchar_t>::__months() const;
+template <> _LIBCPP_FUNC_VIS const wstring* __time_get_c_storage<wchar_t>::__am_pm() const;
+template <> _LIBCPP_FUNC_VIS const wstring& __time_get_c_storage<wchar_t>::__c() const;
+template <> _LIBCPP_FUNC_VIS const wstring& __time_get_c_storage<wchar_t>::__r() const;
+template <> _LIBCPP_FUNC_VIS const wstring& __time_get_c_storage<wchar_t>::__x() const;
+template <> _LIBCPP_FUNC_VIS const wstring& __time_get_c_storage<wchar_t>::__X() const;
+#endif
+
+template <class _CharT, class _InputIterator = istreambuf_iterator<_CharT> >
+class _LIBCPP_TEMPLATE_VIS time_get
+    : public locale::facet,
+      public time_base,
+      private __time_get_c_storage<_CharT>
+{
+public:
+    typedef _CharT                  char_type;
+    typedef _InputIterator          iter_type;
+    typedef time_base::dateorder    dateorder;
+    typedef basic_string<char_type> string_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit time_get(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    dateorder date_order() const
+    {
+        return this->do_date_order();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get_time(iter_type __b, iter_type __e, ios_base& __iob,
+                       ios_base::iostate& __err, tm* __tm) const
+    {
+        return do_get_time(__b, __e, __iob, __err, __tm);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get_date(iter_type __b, iter_type __e, ios_base& __iob,
+                       ios_base::iostate& __err, tm* __tm) const
+    {
+        return do_get_date(__b, __e, __iob, __err, __tm);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get_weekday(iter_type __b, iter_type __e, ios_base& __iob,
+                          ios_base::iostate& __err, tm* __tm) const
+    {
+        return do_get_weekday(__b, __e, __iob, __err, __tm);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get_monthname(iter_type __b, iter_type __e, ios_base& __iob,
+                            ios_base::iostate& __err, tm* __tm) const
+    {
+        return do_get_monthname(__b, __e, __iob, __err, __tm);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get_year(iter_type __b, iter_type __e, ios_base& __iob,
+                       ios_base::iostate& __err, tm* __tm) const
+    {
+        return do_get_year(__b, __e, __iob, __err, __tm);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, tm *__tm,
+                  char __fmt, char __mod = 0) const
+    {
+        return do_get(__b, __e, __iob, __err, __tm, __fmt, __mod);
+    }
+
+    iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
+                  ios_base::iostate& __err, tm* __tm,
+                  const char_type* __fmtb, const char_type* __fmte) const;
+
+    static locale::id id;
+
+protected:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~time_get() override {}
+
+    virtual dateorder do_date_order() const;
+    virtual iter_type do_get_time(iter_type __b, iter_type __e, ios_base& __iob,
+                                  ios_base::iostate& __err, tm* __tm) const;
+    virtual iter_type do_get_date(iter_type __b, iter_type __e, ios_base& __iob,
+                                  ios_base::iostate& __err, tm* __tm) const;
+    virtual iter_type do_get_weekday(iter_type __b, iter_type __e, ios_base& __iob,
+                                     ios_base::iostate& __err, tm* __tm) const;
+    virtual iter_type do_get_monthname(iter_type __b, iter_type __e, ios_base& __iob,
+                                       ios_base::iostate& __err, tm* __tm) const;
+    virtual iter_type do_get_year(iter_type __b, iter_type __e, ios_base& __iob,
+                                  ios_base::iostate& __err, tm* __tm) const;
+    virtual iter_type do_get(iter_type __b, iter_type __e, ios_base& __iob,
+                             ios_base::iostate& __err, tm* __tm,
+                             char __fmt, char __mod) const;
+private:
+    void __get_white_space(iter_type& __b, iter_type __e,
+                           ios_base::iostate& __err, const ctype<char_type>& __ct) const;
+    void __get_percent(iter_type& __b, iter_type __e, ios_base::iostate& __err,
+                       const ctype<char_type>& __ct) const;
+
+    void __get_weekdayname(int& __m,
+                           iter_type& __b, iter_type __e,
+                           ios_base::iostate& __err,
+                           const ctype<char_type>& __ct) const;
+    void __get_monthname(int& __m,
+                         iter_type& __b, iter_type __e,
+                         ios_base::iostate& __err,
+                         const ctype<char_type>& __ct) const;
+    void __get_day(int& __d,
+                   iter_type& __b, iter_type __e,
+                   ios_base::iostate& __err,
+                   const ctype<char_type>& __ct) const;
+    void __get_month(int& __m,
+                     iter_type& __b, iter_type __e,
+                     ios_base::iostate& __err,
+                     const ctype<char_type>& __ct) const;
+    void __get_year(int& __y,
+                   iter_type& __b, iter_type __e,
+                   ios_base::iostate& __err,
+                   const ctype<char_type>& __ct) const;
+    void __get_year4(int& __y,
+                    iter_type& __b, iter_type __e,
+                    ios_base::iostate& __err,
+                    const ctype<char_type>& __ct) const;
+    void __get_hour(int& __d,
+                    iter_type& __b, iter_type __e,
+                    ios_base::iostate& __err,
+                    const ctype<char_type>& __ct) const;
+    void __get_12_hour(int& __h,
+                       iter_type& __b, iter_type __e,
+                       ios_base::iostate& __err,
+                       const ctype<char_type>& __ct) const;
+    void __get_am_pm(int& __h,
+                     iter_type& __b, iter_type __e,
+                     ios_base::iostate& __err,
+                     const ctype<char_type>& __ct) const;
+    void __get_minute(int& __m,
+                      iter_type& __b, iter_type __e,
+                      ios_base::iostate& __err,
+                      const ctype<char_type>& __ct) const;
+    void __get_second(int& __s,
+                      iter_type& __b, iter_type __e,
+                      ios_base::iostate& __err,
+                      const ctype<char_type>& __ct) const;
+    void __get_weekday(int& __w,
+                       iter_type& __b, iter_type __e,
+                       ios_base::iostate& __err,
+                       const ctype<char_type>& __ct) const;
+    void __get_day_year_num(int& __w,
+                            iter_type& __b, iter_type __e,
+                            ios_base::iostate& __err,
+                            const ctype<char_type>& __ct) const;
+};
+
+template <class _CharT, class _InputIterator>
+locale::id
+time_get<_CharT, _InputIterator>::id;
+
+// time_get primitives
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_weekdayname(int& __w,
+                                                    iter_type& __b, iter_type __e,
+                                                    ios_base::iostate& __err,
+                                                    const ctype<char_type>& __ct) const
+{
+    // Note:  ignoring case comes from the POSIX strptime spec
+    const string_type* __wk = this->__weeks();
+    ptrdiff_t __i = _VSTD::__scan_keyword(__b, __e, __wk, __wk+14, __ct, __err, false) - __wk;
+    if (__i < 14)
+        __w = __i % 7;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_monthname(int& __m,
+                                                  iter_type& __b, iter_type __e,
+                                                  ios_base::iostate& __err,
+                                                  const ctype<char_type>& __ct) const
+{
+    // Note:  ignoring case comes from the POSIX strptime spec
+    const string_type* __month = this->__months();
+    ptrdiff_t __i = _VSTD::__scan_keyword(__b, __e, __month, __month+24, __ct, __err, false) - __month;
+    if (__i < 24)
+        __m = __i % 12;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_day(int& __d,
+                                            iter_type& __b, iter_type __e,
+                                            ios_base::iostate& __err,
+                                            const ctype<char_type>& __ct) const
+{
+    int __t = _VSTD::__get_up_to_n_digits(__b, __e, __err, __ct, 2);
+    if (!(__err & ios_base::failbit) && 1 <= __t && __t <= 31)
+        __d = __t;
+    else
+        __err |= ios_base::failbit;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_month(int& __m,
+                                              iter_type& __b, iter_type __e,
+                                              ios_base::iostate& __err,
+                                              const ctype<char_type>& __ct) const
+{
+    int __t = std::__get_up_to_n_digits(__b, __e, __err, __ct, 2) - 1;
+    if (!(__err & ios_base::failbit) && 0 <= __t && __t <= 11)
+        __m = __t;
+    else
+        __err |= ios_base::failbit;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_year(int& __y,
+                                             iter_type& __b, iter_type __e,
+                                             ios_base::iostate& __err,
+                                             const ctype<char_type>& __ct) const
+{
+    int __t = std::__get_up_to_n_digits(__b, __e, __err, __ct, 4);
+    if (!(__err & ios_base::failbit))
+    {
+        if (__t < 69)
+            __t += 2000;
+        else if (69 <= __t && __t <= 99)
+            __t += 1900;
+        __y = __t - 1900;
+    }
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_year4(int& __y,
+                                              iter_type& __b, iter_type __e,
+                                              ios_base::iostate& __err,
+                                              const ctype<char_type>& __ct) const
+{
+    int __t = std::__get_up_to_n_digits(__b, __e, __err, __ct, 4);
+    if (!(__err & ios_base::failbit))
+        __y = __t - 1900;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_hour(int& __h,
+                                             iter_type& __b, iter_type __e,
+                                             ios_base::iostate& __err,
+                                             const ctype<char_type>& __ct) const
+{
+    int __t = std::__get_up_to_n_digits(__b, __e, __err, __ct, 2);
+    if (!(__err & ios_base::failbit) && __t <= 23)
+        __h = __t;
+    else
+        __err |= ios_base::failbit;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_12_hour(int& __h,
+                                                iter_type& __b, iter_type __e,
+                                                ios_base::iostate& __err,
+                                                const ctype<char_type>& __ct) const
+{
+    int __t = std::__get_up_to_n_digits(__b, __e, __err, __ct, 2);
+    if (!(__err & ios_base::failbit) && 1 <= __t && __t <= 12)
+        __h = __t;
+    else
+        __err |= ios_base::failbit;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_minute(int& __m,
+                                               iter_type& __b, iter_type __e,
+                                               ios_base::iostate& __err,
+                                               const ctype<char_type>& __ct) const
+{
+    int __t = std::__get_up_to_n_digits(__b, __e, __err, __ct, 2);
+    if (!(__err & ios_base::failbit) && __t <= 59)
+        __m = __t;
+    else
+        __err |= ios_base::failbit;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_second(int& __s,
+                                               iter_type& __b, iter_type __e,
+                                               ios_base::iostate& __err,
+                                               const ctype<char_type>& __ct) const
+{
+    int __t = std::__get_up_to_n_digits(__b, __e, __err, __ct, 2);
+    if (!(__err & ios_base::failbit) && __t <= 60)
+        __s = __t;
+    else
+        __err |= ios_base::failbit;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_weekday(int& __w,
+                                                iter_type& __b, iter_type __e,
+                                                ios_base::iostate& __err,
+                                                const ctype<char_type>& __ct) const
+{
+    int __t = std::__get_up_to_n_digits(__b, __e, __err, __ct, 1);
+    if (!(__err & ios_base::failbit) && __t <= 6)
+        __w = __t;
+    else
+        __err |= ios_base::failbit;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_day_year_num(int& __d,
+                                                     iter_type& __b, iter_type __e,
+                                                     ios_base::iostate& __err,
+                                                     const ctype<char_type>& __ct) const
+{
+    int __t = std::__get_up_to_n_digits(__b, __e, __err, __ct, 3);
+    if (!(__err & ios_base::failbit) && __t <= 365)
+        __d = __t;
+    else
+        __err |= ios_base::failbit;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_white_space(iter_type& __b, iter_type __e,
+                                                    ios_base::iostate& __err,
+                                                    const ctype<char_type>& __ct) const
+{
+    for (; __b != __e && __ct.is(ctype_base::space, *__b); ++__b)
+        ;
+    if (__b == __e)
+        __err |= ios_base::eofbit;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_am_pm(int& __h,
+                                              iter_type& __b, iter_type __e,
+                                              ios_base::iostate& __err,
+                                              const ctype<char_type>& __ct) const
+{
+    const string_type* __ap = this->__am_pm();
+    if (__ap[0].size() + __ap[1].size() == 0)
+    {
+        __err |= ios_base::failbit;
+        return;
+    }
+    ptrdiff_t __i = _VSTD::__scan_keyword(__b, __e, __ap, __ap+2, __ct, __err, false) - __ap;
+    if (__i == 0 && __h == 12)
+        __h = 0;
+    else if (__i == 1 && __h < 12)
+        __h += 12;
+}
+
+template <class _CharT, class _InputIterator>
+void
+time_get<_CharT, _InputIterator>::__get_percent(iter_type& __b, iter_type __e,
+                                                ios_base::iostate& __err,
+                                                const ctype<char_type>& __ct) const
+{
+    if (__b == __e)
+    {
+        __err |= ios_base::eofbit | ios_base::failbit;
+        return;
+    }
+    if (__ct.narrow(*__b, 0) != '%')
+        __err |= ios_base::failbit;
+    else if(++__b == __e)
+        __err |= ios_base::eofbit;
+}
+
+// time_get end primitives
+
+template <class _CharT, class _InputIterator>
+_InputIterator
+time_get<_CharT, _InputIterator>::get(iter_type __b, iter_type __e,
+                                      ios_base& __iob,
+                                      ios_base::iostate& __err, tm* __tm,
+                                      const char_type* __fmtb, const char_type* __fmte) const
+{
+    const ctype<char_type>& __ct = std::use_facet<ctype<char_type> >(__iob.getloc());
+    __err = ios_base::goodbit;
+    while (__fmtb != __fmte && __err == ios_base::goodbit)
+    {
+        if (__b == __e)
+        {
+            __err = ios_base::failbit;
+            break;
+        }
+        if (__ct.narrow(*__fmtb, 0) == '%')
+        {
+            if (++__fmtb == __fmte)
+            {
+                __err = ios_base::failbit;
+                break;
+            }
+            char __cmd = __ct.narrow(*__fmtb, 0);
+            char __opt = '\0';
+            if (__cmd == 'E' || __cmd == '0')
+            {
+                if (++__fmtb == __fmte)
+                {
+                    __err = ios_base::failbit;
+                    break;
+                }
+                __opt = __cmd;
+                __cmd = __ct.narrow(*__fmtb, 0);
+            }
+            __b = do_get(__b, __e, __iob, __err, __tm, __cmd, __opt);
+            ++__fmtb;
+        }
+        else if (__ct.is(ctype_base::space, *__fmtb))
+        {
+            for (++__fmtb; __fmtb != __fmte && __ct.is(ctype_base::space, *__fmtb); ++__fmtb)
+                ;
+            for (        ;    __b != __e    && __ct.is(ctype_base::space, *__b);    ++__b)
+                ;
+        }
+        else if (__ct.toupper(*__b) == __ct.toupper(*__fmtb))
+        {
+            ++__b;
+            ++__fmtb;
+        }
+        else
+            __err = ios_base::failbit;
+    }
+    if (__b == __e)
+        __err |= ios_base::eofbit;
+    return __b;
+}
+
+template <class _CharT, class _InputIterator>
+typename time_get<_CharT, _InputIterator>::dateorder
+time_get<_CharT, _InputIterator>::do_date_order() const
+{
+    return mdy;
+}
+
+template <class _CharT, class _InputIterator>
+_InputIterator
+time_get<_CharT, _InputIterator>::do_get_time(iter_type __b, iter_type __e,
+                                              ios_base& __iob,
+                                              ios_base::iostate& __err,
+                                              tm* __tm) const
+{
+    const char_type __fmt[] = {'%', 'H', ':', '%', 'M', ':', '%', 'S'};
+    return get(__b, __e, __iob, __err, __tm, __fmt, __fmt + sizeof(__fmt)/sizeof(__fmt[0]));
+}
+
+template <class _CharT, class _InputIterator>
+_InputIterator
+time_get<_CharT, _InputIterator>::do_get_date(iter_type __b, iter_type __e,
+                                              ios_base& __iob,
+                                              ios_base::iostate& __err,
+                                              tm* __tm) const
+{
+    const string_type& __fmt = this->__x();
+    return get(__b, __e, __iob, __err, __tm, __fmt.data(), __fmt.data() + __fmt.size());
+}
+
+template <class _CharT, class _InputIterator>
+_InputIterator
+time_get<_CharT, _InputIterator>::do_get_weekday(iter_type __b, iter_type __e,
+                                                 ios_base& __iob,
+                                                 ios_base::iostate& __err,
+                                                 tm* __tm) const
+{
+    const ctype<char_type>& __ct = std::use_facet<ctype<char_type> >(__iob.getloc());
+    __get_weekdayname(__tm->tm_wday, __b, __e, __err, __ct);
+    return __b;
+}
+
+template <class _CharT, class _InputIterator>
+_InputIterator
+time_get<_CharT, _InputIterator>::do_get_monthname(iter_type __b, iter_type __e,
+                                                   ios_base& __iob,
+                                                   ios_base::iostate& __err,
+                                                   tm* __tm) const
+{
+    const ctype<char_type>& __ct = std::use_facet<ctype<char_type> >(__iob.getloc());
+    __get_monthname(__tm->tm_mon, __b, __e, __err, __ct);
+    return __b;
+}
+
+template <class _CharT, class _InputIterator>
+_InputIterator
+time_get<_CharT, _InputIterator>::do_get_year(iter_type __b, iter_type __e,
+                                              ios_base& __iob,
+                                              ios_base::iostate& __err,
+                                              tm* __tm) const
+{
+    const ctype<char_type>& __ct = std::use_facet<ctype<char_type> >(__iob.getloc());
+    __get_year(__tm->tm_year, __b, __e, __err, __ct);
+    return __b;
+}
+
+template <class _CharT, class _InputIterator>
+_InputIterator
+time_get<_CharT, _InputIterator>::do_get(iter_type __b, iter_type __e,
+                                         ios_base& __iob,
+                                         ios_base::iostate& __err, tm* __tm,
+                                         char __fmt, char) const
+{
+    __err = ios_base::goodbit;
+    const ctype<char_type>& __ct = std::use_facet<ctype<char_type> >(__iob.getloc());
+    switch (__fmt)
+    {
+    case 'a':
+    case 'A':
+        __get_weekdayname(__tm->tm_wday, __b, __e, __err, __ct);
+        break;
+    case 'b':
+    case 'B':
+    case 'h':
+        __get_monthname(__tm->tm_mon, __b, __e, __err, __ct);
+        break;
+    case 'c':
+        {
+        const string_type& __fm = this->__c();
+        __b = get(__b, __e, __iob, __err, __tm, __fm.data(), __fm.data() + __fm.size());
+        }
+        break;
+    case 'd':
+    case 'e':
+        __get_day(__tm->tm_mday, __b, __e, __err, __ct);
+        break;
+    case 'D':
+        {
+        const char_type __fm[] = {'%', 'm', '/', '%', 'd', '/', '%', 'y'};
+        __b = get(__b, __e, __iob, __err, __tm, __fm, __fm + sizeof(__fm)/sizeof(__fm[0]));
+        }
+        break;
+    case 'F':
+        {
+        const char_type __fm[] = {'%', 'Y', '-', '%', 'm', '-', '%', 'd'};
+        __b = get(__b, __e, __iob, __err, __tm, __fm, __fm + sizeof(__fm)/sizeof(__fm[0]));
+        }
+        break;
+    case 'H':
+        __get_hour(__tm->tm_hour, __b, __e, __err, __ct);
+        break;
+    case 'I':
+        __get_12_hour(__tm->tm_hour, __b, __e, __err, __ct);
+        break;
+    case 'j':
+        __get_day_year_num(__tm->tm_yday, __b, __e, __err, __ct);
+        break;
+    case 'm':
+        __get_month(__tm->tm_mon, __b, __e, __err, __ct);
+        break;
+    case 'M':
+        __get_minute(__tm->tm_min, __b, __e, __err, __ct);
+        break;
+    case 'n':
+    case 't':
+        __get_white_space(__b, __e, __err, __ct);
+        break;
+    case 'p':
+        __get_am_pm(__tm->tm_hour, __b, __e, __err, __ct);
+        break;
+    case 'r':
+        {
+        const char_type __fm[] = {'%', 'I', ':', '%', 'M', ':', '%', 'S', ' ', '%', 'p'};
+        __b = get(__b, __e, __iob, __err, __tm, __fm, __fm + sizeof(__fm)/sizeof(__fm[0]));
+        }
+        break;
+    case 'R':
+        {
+        const char_type __fm[] = {'%', 'H', ':', '%', 'M'};
+        __b = get(__b, __e, __iob, __err, __tm, __fm, __fm + sizeof(__fm)/sizeof(__fm[0]));
+        }
+        break;
+    case 'S':
+        __get_second(__tm->tm_sec, __b, __e, __err, __ct);
+        break;
+    case 'T':
+        {
+        const char_type __fm[] = {'%', 'H', ':', '%', 'M', ':', '%', 'S'};
+        __b = get(__b, __e, __iob, __err, __tm, __fm, __fm + sizeof(__fm)/sizeof(__fm[0]));
+        }
+        break;
+    case 'w':
+        __get_weekday(__tm->tm_wday, __b, __e, __err, __ct);
+        break;
+    case 'x':
+        return do_get_date(__b, __e, __iob, __err, __tm);
+    case 'X':
+        {
+        const string_type& __fm = this->__X();
+        __b = get(__b, __e, __iob, __err, __tm, __fm.data(), __fm.data() + __fm.size());
+        }
+        break;
+    case 'y':
+        __get_year(__tm->tm_year, __b, __e, __err, __ct);
+        break;
+    case 'Y':
+        __get_year4(__tm->tm_year, __b, __e, __err, __ct);
+        break;
+    case '%':
+        __get_percent(__b, __e, __err, __ct);
+        break;
+    default:
+        __err |= ios_base::failbit;
+    }
+    return __b;
+}
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS time_get<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS time_get<wchar_t>;
+#endif
+
+class _LIBCPP_TYPE_VIS __time_get
+{
+protected:
+    locale_t __loc_;
+
+    __time_get(const char* __nm);
+    __time_get(const string& __nm);
+    ~__time_get();
+};
+
+template <class _CharT>
+class _LIBCPP_TEMPLATE_VIS __time_get_storage
+    : public __time_get
+{
+protected:
+    typedef basic_string<_CharT> string_type;
+
+    string_type __weeks_[14];
+    string_type __months_[24];
+    string_type __am_pm_[2];
+    string_type __c_;
+    string_type __r_;
+    string_type __x_;
+    string_type __X_;
+
+    explicit __time_get_storage(const char* __nm);
+    explicit __time_get_storage(const string& __nm);
+
+    _LIBCPP_INLINE_VISIBILITY ~__time_get_storage() {}
+
+    time_base::dateorder __do_date_order() const;
+
+private:
+    void init(const ctype<_CharT>&);
+    string_type __analyze(char __fmt, const ctype<_CharT>&);
+};
+
+#define _LIBCPP_TIME_GET_STORAGE_EXPLICIT_INSTANTIATION(_CharT) \
+template <> _LIBCPP_FUNC_VIS time_base::dateorder __time_get_storage<_CharT>::__do_date_order() const; \
+template <> _LIBCPP_FUNC_VIS __time_get_storage<_CharT>::__time_get_storage(const char*); \
+template <> _LIBCPP_FUNC_VIS __time_get_storage<_CharT>::__time_get_storage(const string&); \
+template <> _LIBCPP_FUNC_VIS void __time_get_storage<_CharT>::init(const ctype<_CharT>&); \
+template <> _LIBCPP_FUNC_VIS __time_get_storage<_CharT>::string_type __time_get_storage<_CharT>::__analyze(char, const ctype<_CharT>&); \
+extern template _LIBCPP_FUNC_VIS time_base::dateorder __time_get_storage<_CharT>::__do_date_order() const; \
+extern template _LIBCPP_FUNC_VIS __time_get_storage<_CharT>::__time_get_storage(const char*); \
+extern template _LIBCPP_FUNC_VIS __time_get_storage<_CharT>::__time_get_storage(const string&); \
+extern template _LIBCPP_FUNC_VIS void __time_get_storage<_CharT>::init(const ctype<_CharT>&); \
+extern template _LIBCPP_FUNC_VIS __time_get_storage<_CharT>::string_type __time_get_storage<_CharT>::__analyze(char, const ctype<_CharT>&); \
+/**/
+
+_LIBCPP_TIME_GET_STORAGE_EXPLICIT_INSTANTIATION(char)
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+_LIBCPP_TIME_GET_STORAGE_EXPLICIT_INSTANTIATION(wchar_t)
+#endif
+#undef _LIBCPP_TIME_GET_STORAGE_EXPLICIT_INSTANTIATION
+
+template <class _CharT, class _InputIterator = istreambuf_iterator<_CharT> >
+class _LIBCPP_TEMPLATE_VIS time_get_byname
+    : public time_get<_CharT, _InputIterator>,
+      private __time_get_storage<_CharT>
+{
+public:
+    typedef time_base::dateorder    dateorder;
+    typedef _InputIterator          iter_type;
+    typedef _CharT                  char_type;
+    typedef basic_string<char_type> string_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit time_get_byname(const char* __nm, size_t __refs = 0)
+        : time_get<_CharT, _InputIterator>(__refs),
+          __time_get_storage<_CharT>(__nm) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit time_get_byname(const string& __nm, size_t __refs = 0)
+        : time_get<_CharT, _InputIterator>(__refs),
+          __time_get_storage<_CharT>(__nm) {}
+
+protected:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~time_get_byname() override {}
+
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL dateorder do_date_order() const override {return this->__do_date_order();}
+private:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL const string_type* __weeks() const override  {return this->__weeks_;}
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL const string_type* __months() const override {return this->__months_;}
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL const string_type* __am_pm() const override  {return this->__am_pm_;}
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL const string_type& __c() const override      {return this->__c_;}
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL const string_type& __r() const override      {return this->__r_;}
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL const string_type& __x() const override      {return this->__x_;}
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL const string_type& __X() const override      {return this->__X_;}
+};
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS time_get_byname<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS time_get_byname<wchar_t>;
+#endif
+
+class _LIBCPP_TYPE_VIS __time_put
+{
+    locale_t __loc_;
+protected:
+    _LIBCPP_INLINE_VISIBILITY __time_put() : __loc_(_LIBCPP_GET_C_LOCALE) {}
+    __time_put(const char* __nm);
+    __time_put(const string& __nm);
+    ~__time_put();
+    void __do_put(char* __nb, char*& __ne, const tm* __tm,
+                  char __fmt, char __mod) const;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+    void __do_put(wchar_t* __wb, wchar_t*& __we, const tm* __tm,
+                  char __fmt, char __mod) const;
+#endif
+};
+
+template <class _CharT, class _OutputIterator = ostreambuf_iterator<_CharT> >
+class _LIBCPP_TEMPLATE_VIS time_put
+    : public locale::facet,
+      private __time_put
+{
+public:
+    typedef _CharT char_type;
+    typedef _OutputIterator iter_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit time_put(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    iter_type put(iter_type __s, ios_base& __iob, char_type __fl, const tm* __tm,
+                  const char_type* __pb, const char_type* __pe) const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type put(iter_type __s, ios_base& __iob, char_type __fl,
+                  const tm* __tm, char __fmt, char __mod = 0) const
+    {
+        return do_put(__s, __iob, __fl, __tm, __fmt, __mod);
+    }
+
+    static locale::id id;
+
+protected:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~time_put() override {}
+    virtual iter_type do_put(iter_type __s, ios_base&, char_type, const tm* __tm,
+                             char __fmt, char __mod) const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit time_put(const char* __nm, size_t __refs)
+        : locale::facet(__refs),
+          __time_put(__nm) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit time_put(const string& __nm, size_t __refs)
+        : locale::facet(__refs),
+          __time_put(__nm) {}
+};
+
+template <class _CharT, class _OutputIterator>
+locale::id
+time_put<_CharT, _OutputIterator>::id;
+
+template <class _CharT, class _OutputIterator>
+_OutputIterator
+time_put<_CharT, _OutputIterator>::put(iter_type __s, ios_base& __iob,
+                                       char_type __fl, const tm* __tm,
+                                       const char_type* __pb,
+                                       const char_type* __pe) const
+{
+    const ctype<char_type>& __ct = std::use_facet<ctype<char_type> >(__iob.getloc());
+    for (; __pb != __pe; ++__pb)
+    {
+        if (__ct.narrow(*__pb, 0) == '%')
+        {
+            if (++__pb == __pe)
+            {
+                *__s++ = __pb[-1];
+                break;
+            }
+            char __mod = 0;
+            char __fmt = __ct.narrow(*__pb, 0);
+            if (__fmt == 'E' || __fmt == 'O')
+            {
+                if (++__pb == __pe)
+                {
+                    *__s++ = __pb[-2];
+                    *__s++ = __pb[-1];
+                    break;
+                }
+                __mod = __fmt;
+                __fmt = __ct.narrow(*__pb, 0);
+            }
+            __s = do_put(__s, __iob, __fl, __tm, __fmt, __mod);
+        }
+        else
+            *__s++ = *__pb;
+    }
+    return __s;
+}
+
+template <class _CharT, class _OutputIterator>
+_OutputIterator
+time_put<_CharT, _OutputIterator>::do_put(iter_type __s, ios_base&,
+                                          char_type, const tm* __tm,
+                                          char __fmt, char __mod) const
+{
+    char_type __nar[100];
+    char_type* __nb = __nar;
+    char_type* __ne = __nb + 100;
+    __do_put(__nb, __ne, __tm, __fmt, __mod);
+    return _VSTD::copy(__nb, __ne, __s);
+}
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS time_put<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS time_put<wchar_t>;
+#endif
+
+template <class _CharT, class _OutputIterator = ostreambuf_iterator<_CharT> >
+class _LIBCPP_TEMPLATE_VIS time_put_byname
+    : public time_put<_CharT, _OutputIterator>
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit time_put_byname(const char* __nm, size_t __refs = 0)
+        : time_put<_CharT, _OutputIterator>(__nm, __refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit time_put_byname(const string& __nm, size_t __refs = 0)
+        : time_put<_CharT, _OutputIterator>(__nm, __refs) {}
+
+protected:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~time_put_byname() override {}
+};
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS time_put_byname<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS time_put_byname<wchar_t>;
+#endif
+
+// money_base
+
+class _LIBCPP_TYPE_VIS money_base
+{
+public:
+    enum part {none, space, symbol, sign, value};
+    struct pattern {char field[4];};
+
+    _LIBCPP_INLINE_VISIBILITY money_base() {}
+};
+
+// moneypunct
+
+template <class _CharT, bool _International = false>
+class _LIBCPP_TEMPLATE_VIS moneypunct
+    : public locale::facet,
+      public money_base
+{
+public:
+    typedef _CharT                  char_type;
+    typedef basic_string<char_type> string_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit moneypunct(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY char_type   decimal_point() const {return do_decimal_point();}
+    _LIBCPP_INLINE_VISIBILITY char_type   thousands_sep() const {return do_thousands_sep();}
+    _LIBCPP_INLINE_VISIBILITY string      grouping()      const {return do_grouping();}
+    _LIBCPP_INLINE_VISIBILITY string_type curr_symbol()   const {return do_curr_symbol();}
+    _LIBCPP_INLINE_VISIBILITY string_type positive_sign() const {return do_positive_sign();}
+    _LIBCPP_INLINE_VISIBILITY string_type negative_sign() const {return do_negative_sign();}
+    _LIBCPP_INLINE_VISIBILITY int         frac_digits()   const {return do_frac_digits();}
+    _LIBCPP_INLINE_VISIBILITY pattern     pos_format()    const {return do_pos_format();}
+    _LIBCPP_INLINE_VISIBILITY pattern     neg_format()    const {return do_neg_format();}
+
+    static locale::id id;
+    static const bool intl = _International;
+
+protected:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~moneypunct() override {}
+
+    virtual char_type   do_decimal_point() const {return numeric_limits<char_type>::max();}
+    virtual char_type   do_thousands_sep() const {return numeric_limits<char_type>::max();}
+    virtual string      do_grouping()      const {return string();}
+    virtual string_type do_curr_symbol()   const {return string_type();}
+    virtual string_type do_positive_sign() const {return string_type();}
+    virtual string_type do_negative_sign() const {return string_type(1, '-');}
+    virtual int         do_frac_digits()   const {return 0;}
+    virtual pattern     do_pos_format()    const
+        {pattern __p = {{symbol, sign, none, value}}; return __p;}
+    virtual pattern     do_neg_format()    const
+        {pattern __p = {{symbol, sign, none, value}}; return __p;}
+};
+
+template <class _CharT, bool _International>
+locale::id
+moneypunct<_CharT, _International>::id;
+
+template <class _CharT, bool _International>
+const bool
+moneypunct<_CharT, _International>::intl;
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS moneypunct<char, false>;
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS moneypunct<char, true>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS moneypunct<wchar_t, false>;
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS moneypunct<wchar_t, true>;
+#endif
+
+// moneypunct_byname
+
+template <class _CharT, bool _International = false>
+class _LIBCPP_TEMPLATE_VIS moneypunct_byname
+    : public moneypunct<_CharT, _International>
+{
+public:
+    typedef money_base::pattern  pattern;
+    typedef _CharT                  char_type;
+    typedef basic_string<char_type> string_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit moneypunct_byname(const char* __nm, size_t __refs = 0)
+        : moneypunct<_CharT, _International>(__refs) {init(__nm);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit moneypunct_byname(const string& __nm, size_t __refs = 0)
+        : moneypunct<_CharT, _International>(__refs) {init(__nm.c_str());}
+
+protected:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~moneypunct_byname() override {}
+
+     char_type   do_decimal_point() const override {return __decimal_point_;}
+     char_type   do_thousands_sep() const override {return __thousands_sep_;}
+     string      do_grouping()      const override {return __grouping_;}
+     string_type do_curr_symbol()   const override {return __curr_symbol_;}
+     string_type do_positive_sign() const override {return __positive_sign_;}
+     string_type do_negative_sign() const override {return __negative_sign_;}
+     int         do_frac_digits()   const override {return __frac_digits_;}
+     pattern     do_pos_format()    const override {return __pos_format_;}
+     pattern     do_neg_format()    const override {return __neg_format_;}
+
+private:
+    char_type   __decimal_point_;
+    char_type   __thousands_sep_;
+    string      __grouping_;
+    string_type __curr_symbol_;
+    string_type __positive_sign_;
+    string_type __negative_sign_;
+    int         __frac_digits_;
+    pattern     __pos_format_;
+    pattern     __neg_format_;
+
+    void init(const char*);
+};
+
+template<> _LIBCPP_FUNC_VIS void moneypunct_byname<char, false>::init(const char*);
+template<> _LIBCPP_FUNC_VIS void moneypunct_byname<char, true>::init(const char*);
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS moneypunct_byname<char, false>;
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS moneypunct_byname<char, true>;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template<> _LIBCPP_FUNC_VIS void moneypunct_byname<wchar_t, false>::init(const char*);
+template<> _LIBCPP_FUNC_VIS void moneypunct_byname<wchar_t, true>::init(const char*);
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS moneypunct_byname<wchar_t, false>;
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS moneypunct_byname<wchar_t, true>;
+#endif
+
+// money_get
+
+template <class _CharT>
+class __money_get
+{
+protected:
+    typedef _CharT                  char_type;
+    typedef basic_string<char_type> string_type;
+
+    _LIBCPP_INLINE_VISIBILITY __money_get() {}
+
+    static void __gather_info(bool __intl, const locale& __loc,
+                              money_base::pattern& __pat, char_type& __dp,
+                              char_type& __ts, string& __grp,
+                              string_type& __sym, string_type& __psn,
+                              string_type& __nsn, int& __fd);
+};
+
+template <class _CharT>
+void
+__money_get<_CharT>::__gather_info(bool __intl, const locale& __loc,
+                                   money_base::pattern& __pat, char_type& __dp,
+                                   char_type& __ts, string& __grp,
+                                   string_type& __sym, string_type& __psn,
+                                   string_type& __nsn, int& __fd)
+{
+    if (__intl)
+    {
+        const moneypunct<char_type, true>& __mp =
+            std::use_facet<moneypunct<char_type, true> >(__loc);
+        __pat = __mp.neg_format();
+        __nsn = __mp.negative_sign();
+        __psn = __mp.positive_sign();
+        __dp = __mp.decimal_point();
+        __ts = __mp.thousands_sep();
+        __grp = __mp.grouping();
+        __sym = __mp.curr_symbol();
+        __fd = __mp.frac_digits();
+    }
+    else
+    {
+        const moneypunct<char_type, false>& __mp =
+            std::use_facet<moneypunct<char_type, false> >(__loc);
+        __pat = __mp.neg_format();
+        __nsn = __mp.negative_sign();
+        __psn = __mp.positive_sign();
+        __dp = __mp.decimal_point();
+        __ts = __mp.thousands_sep();
+        __grp = __mp.grouping();
+        __sym = __mp.curr_symbol();
+        __fd = __mp.frac_digits();
+    }
+}
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS __money_get<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS __money_get<wchar_t>;
+#endif
+
+template <class _CharT, class _InputIterator = istreambuf_iterator<_CharT> >
+class _LIBCPP_TEMPLATE_VIS money_get
+    : public locale::facet,
+      private __money_get<_CharT>
+{
+public:
+    typedef _CharT                  char_type;
+    typedef _InputIterator          iter_type;
+    typedef basic_string<char_type> string_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit money_get(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, bool __intl, ios_base& __iob,
+                  ios_base::iostate& __err, long double& __v) const
+    {
+        return do_get(__b, __e, __intl, __iob, __err, __v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type get(iter_type __b, iter_type __e, bool __intl, ios_base& __iob,
+                  ios_base::iostate& __err, string_type& __v) const
+    {
+        return do_get(__b, __e, __intl, __iob, __err, __v);
+    }
+
+    static locale::id id;
+
+protected:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~money_get() override {}
+
+    virtual iter_type do_get(iter_type __b, iter_type __e, bool __intl,
+                             ios_base& __iob, ios_base::iostate& __err,
+                             long double& __v) const;
+    virtual iter_type do_get(iter_type __b, iter_type __e, bool __intl,
+                             ios_base& __iob, ios_base::iostate& __err,
+                             string_type& __v) const;
+
+private:
+    static bool __do_get(iter_type& __b, iter_type __e,
+                         bool __intl, const locale& __loc,
+                         ios_base::fmtflags __flags, ios_base::iostate& __err,
+                         bool& __neg, const ctype<char_type>& __ct,
+                         unique_ptr<char_type, void(*)(void*)>& __wb,
+                         char_type*& __wn, char_type* __we);
+};
+
+template <class _CharT, class _InputIterator>
+locale::id
+money_get<_CharT, _InputIterator>::id;
+
+_LIBCPP_FUNC_VIS void __do_nothing(void*);
+
+template <class _Tp>
+_LIBCPP_HIDE_FROM_ABI
+void
+__double_or_nothing(unique_ptr<_Tp, void(*)(void*)>& __b, _Tp*& __n, _Tp*& __e)
+{
+    bool __owns = __b.get_deleter() != __do_nothing;
+    size_t __cur_cap = static_cast<size_t>(__e-__b.get()) * sizeof(_Tp);
+    size_t __new_cap = __cur_cap < numeric_limits<size_t>::max() / 2 ?
+                       2 * __cur_cap : numeric_limits<size_t>::max();
+    if (__new_cap == 0)
+        __new_cap = sizeof(_Tp);
+    size_t __n_off = static_cast<size_t>(__n - __b.get());
+    _Tp* __t = (_Tp*)std::realloc(__owns ? __b.get() : 0, __new_cap);
+    if (__t == 0)
+        __throw_bad_alloc();
+    if (__owns)
+        __b.release();
+    __b = unique_ptr<_Tp, void(*)(void*)>(__t, free);
+    __new_cap /= sizeof(_Tp);
+    __n = __b.get() + __n_off;
+    __e = __b.get() + __new_cap;
+}
+
+// true == success
+template <class _CharT, class _InputIterator>
+bool
+money_get<_CharT, _InputIterator>::__do_get(iter_type& __b, iter_type __e,
+                                            bool __intl, const locale& __loc,
+                                            ios_base::fmtflags __flags,
+                                            ios_base::iostate& __err,
+                                            bool& __neg,
+                                            const ctype<char_type>& __ct,
+                                            unique_ptr<char_type, void(*)(void*)>& __wb,
+                                            char_type*& __wn, char_type* __we)
+{
+    if (__b == __e) {
+        __err |= ios_base::failbit;
+        return false;
+    }
+    const unsigned __bz = 100;
+    unsigned __gbuf[__bz];
+    unique_ptr<unsigned, void(*)(void*)> __gb(__gbuf, __do_nothing);
+    unsigned* __gn = __gb.get();
+    unsigned* __ge = __gn + __bz;
+    money_base::pattern __pat;
+    char_type __dp;
+    char_type __ts;
+    string __grp;
+    string_type __sym;
+    string_type __psn;
+    string_type __nsn;
+    // Capture the spaces read into money_base::{space,none} so they
+    // can be compared to initial spaces in __sym.
+    string_type __spaces;
+    int __fd;
+    __money_get<_CharT>::__gather_info(__intl, __loc, __pat, __dp, __ts, __grp,
+                                       __sym, __psn, __nsn, __fd);
+    const string_type* __trailing_sign = 0;
+    __wn = __wb.get();
+    for (unsigned __p = 0; __p < 4 && __b != __e; ++__p)
+    {
+        switch (__pat.field[__p])
+        {
+        case money_base::space:
+            if (__p != 3)
+            {
+                if (__ct.is(ctype_base::space, *__b))
+                    __spaces.push_back(*__b++);
+                else
+                {
+                    __err |= ios_base::failbit;
+                    return false;
+                }
+            }
+            _LIBCPP_FALLTHROUGH();
+        case money_base::none:
+            if (__p != 3)
+            {
+                while (__b != __e && __ct.is(ctype_base::space, *__b))
+                    __spaces.push_back(*__b++);
+            }
+            break;
+        case money_base::sign:
+            if (__psn.size() > 0 && *__b == __psn[0])
+            {
+                ++__b;
+                __neg = false;
+                if (__psn.size() > 1)
+                  __trailing_sign = &__psn;
+                break;
+            }
+            if (__nsn.size() > 0 && *__b == __nsn[0])
+            {
+                ++__b;
+                __neg = true;
+                if (__nsn.size() > 1)
+                    __trailing_sign = &__nsn;
+                break;
+            }
+            if (__psn.size() > 0 && __nsn.size() > 0)
+            {   // sign is required
+                __err |= ios_base::failbit;
+                return false;
+            }
+            if (__psn.size() == 0 && __nsn.size() == 0)
+                // locale has no way of specifying a sign. Use the initial value of __neg as a default
+                break;
+            __neg = (__nsn.size() == 0);
+            break;
+        case money_base::symbol:
+            {
+            bool __more_needed = __trailing_sign ||
+                                 (__p < 2)       ||
+                                 (__p == 2 && __pat.field[3] != static_cast<char>(money_base::none));
+            bool __sb = (__flags & ios_base::showbase) != 0;
+            if (__sb || __more_needed)
+            {
+                typename string_type::const_iterator __sym_space_end = __sym.begin();
+                if (__p > 0 && (__pat.field[__p - 1] == money_base::none ||
+                                __pat.field[__p - 1] == money_base::space)) {
+                    // Match spaces we've already read against spaces at
+                    // the beginning of __sym.
+                    while (__sym_space_end != __sym.end() &&
+                           __ct.is(ctype_base::space, *__sym_space_end))
+                        ++__sym_space_end;
+                    const size_t __num_spaces = __sym_space_end - __sym.begin();
+                    if (__num_spaces > __spaces.size() ||
+                        !std::equal(__spaces.end() - __num_spaces, __spaces.end(),
+                               __sym.begin())) {
+                        // No match. Put __sym_space_end back at the
+                        // beginning of __sym, which will prevent a
+                        // match in the next loop.
+                        __sym_space_end = __sym.begin();
+                    }
+                }
+                typename string_type::const_iterator __sym_curr_char = __sym_space_end;
+                while (__sym_curr_char != __sym.end() && __b != __e &&
+                       *__b == *__sym_curr_char) {
+                    ++__b;
+                    ++__sym_curr_char;
+                }
+                if (__sb && __sym_curr_char != __sym.end())
+                {
+                    __err |= ios_base::failbit;
+                    return false;
+                }
+            }
+            }
+            break;
+        case money_base::value:
+            {
+            unsigned __ng = 0;
+            for (; __b != __e; ++__b)
+            {
+                char_type __c = *__b;
+                if (__ct.is(ctype_base::digit, __c))
+                {
+                    if (__wn == __we)
+                        std::__double_or_nothing(__wb, __wn, __we);
+                    *__wn++ = __c;
+                    ++__ng;
+                }
+                else if (__grp.size() > 0 && __ng > 0 && __c == __ts)
+                {
+                    if (__gn == __ge)
+                        std::__double_or_nothing(__gb, __gn, __ge);
+                    *__gn++ = __ng;
+                    __ng = 0;
+                }
+                else
+                    break;
+            }
+            if (__gb.get() != __gn && __ng > 0)
+            {
+                if (__gn == __ge)
+                    std::__double_or_nothing(__gb, __gn, __ge);
+                *__gn++ = __ng;
+            }
+            if (__fd > 0)
+            {
+                if (__b == __e || *__b != __dp)
+                {
+                    __err |= ios_base::failbit;
+                    return false;
+                }
+                for (++__b; __fd > 0; --__fd, ++__b)
+                {
+                    if (__b == __e || !__ct.is(ctype_base::digit, *__b))
+                    {
+                        __err |= ios_base::failbit;
+                        return false;
+                    }
+                    if (__wn == __we)
+                        std::__double_or_nothing(__wb, __wn, __we);
+                    *__wn++ = *__b;
+                }
+            }
+            if (__wn == __wb.get())
+            {
+                __err |= ios_base::failbit;
+                return false;
+            }
+            }
+            break;
+        }
+    }
+    if (__trailing_sign)
+    {
+        for (unsigned __i = 1; __i < __trailing_sign->size(); ++__i, ++__b)
+        {
+            if (__b == __e || *__b != (*__trailing_sign)[__i])
+            {
+                __err |= ios_base::failbit;
+                return false;
+            }
+        }
+    }
+    if (__gb.get() != __gn)
+    {
+        ios_base::iostate __et = ios_base::goodbit;
+        __check_grouping(__grp, __gb.get(), __gn, __et);
+        if (__et)
+        {
+            __err |= ios_base::failbit;
+            return false;
+        }
+    }
+    return true;
+}
+
+template <class _CharT, class _InputIterator>
+_InputIterator
+money_get<_CharT, _InputIterator>::do_get(iter_type __b, iter_type __e,
+                                          bool __intl, ios_base& __iob,
+                                          ios_base::iostate& __err,
+                                          long double& __v) const
+{
+    const int __bz = 100;
+    char_type __wbuf[__bz];
+    unique_ptr<char_type, void(*)(void*)> __wb(__wbuf, __do_nothing);
+    char_type* __wn;
+    char_type* __we = __wbuf + __bz;
+    locale __loc = __iob.getloc();
+    const ctype<char_type>& __ct = std::use_facet<ctype<char_type> >(__loc);
+    bool __neg = false;
+    if (__do_get(__b, __e, __intl, __loc, __iob.flags(), __err, __neg, __ct,
+                 __wb, __wn, __we))
+    {
+        const char __src[] = "0123456789";
+        char_type __atoms[sizeof(__src)-1];
+        __ct.widen(__src, __src + (sizeof(__src)-1), __atoms);
+        char __nbuf[__bz];
+        char* __nc = __nbuf;
+        unique_ptr<char, void(*)(void*)> __h(nullptr, free);
+        if (__wn - __wb.get() > __bz-2)
+        {
+            __h.reset((char*)malloc(static_cast<size_t>(__wn - __wb.get() + 2)));
+            if (__h.get() == nullptr)
+                __throw_bad_alloc();
+            __nc = __h.get();
+        }
+        if (__neg)
+            *__nc++ = '-';
+        for (const char_type* __w = __wb.get(); __w < __wn; ++__w, ++__nc)
+            *__nc = __src[std::find(__atoms, _VSTD::end(__atoms), *__w) - __atoms];
+        *__nc = char();
+        if (sscanf(__nbuf, "%Lf", &__v) != 1)
+            __throw_runtime_error("money_get error");
+    }
+    if (__b == __e)
+        __err |= ios_base::eofbit;
+    return __b;
+}
+
+template <class _CharT, class _InputIterator>
+_InputIterator
+money_get<_CharT, _InputIterator>::do_get(iter_type __b, iter_type __e,
+                                          bool __intl, ios_base& __iob,
+                                          ios_base::iostate& __err,
+                                          string_type& __v) const
+{
+    const int __bz = 100;
+    char_type __wbuf[__bz];
+    unique_ptr<char_type, void(*)(void*)> __wb(__wbuf, __do_nothing);
+    char_type* __wn;
+    char_type* __we = __wbuf + __bz;
+    locale __loc = __iob.getloc();
+    const ctype<char_type>& __ct = std::use_facet<ctype<char_type> >(__loc);
+    bool __neg = false;
+    if (__do_get(__b, __e, __intl, __loc, __iob.flags(), __err, __neg, __ct,
+                 __wb, __wn, __we))
+    {
+        __v.clear();
+        if (__neg)
+            __v.push_back(__ct.widen('-'));
+        char_type __z = __ct.widen('0');
+        char_type* __w;
+        for (__w = __wb.get(); __w < __wn-1; ++__w)
+            if (*__w != __z)
+                break;
+        __v.append(__w, __wn);
+    }
+    if (__b == __e)
+        __err |= ios_base::eofbit;
+    return __b;
+}
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS money_get<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS money_get<wchar_t>;
+#endif
+
+// money_put
+
+template <class _CharT>
+class __money_put
+{
+protected:
+    typedef _CharT                  char_type;
+    typedef basic_string<char_type> string_type;
+
+    _LIBCPP_INLINE_VISIBILITY __money_put() {}
+
+    static void __gather_info(bool __intl, bool __neg, const locale& __loc,
+                              money_base::pattern& __pat, char_type& __dp,
+                              char_type& __ts, string& __grp,
+                              string_type& __sym, string_type& __sn,
+                              int& __fd);
+    static void __format(char_type* __mb, char_type*& __mi, char_type*& __me,
+                         ios_base::fmtflags __flags,
+                         const char_type* __db, const char_type* __de,
+                         const ctype<char_type>& __ct, bool __neg,
+                         const money_base::pattern& __pat, char_type __dp,
+                         char_type __ts, const string& __grp,
+                         const string_type& __sym, const string_type& __sn,
+                         int __fd);
+};
+
+template <class _CharT>
+void
+__money_put<_CharT>::__gather_info(bool __intl, bool __neg, const locale& __loc,
+                                   money_base::pattern& __pat, char_type& __dp,
+                                   char_type& __ts, string& __grp,
+                                   string_type& __sym, string_type& __sn,
+                                   int& __fd)
+{
+    if (__intl)
+    {
+        const moneypunct<char_type, true>& __mp =
+            std::use_facet<moneypunct<char_type, true> >(__loc);
+        if (__neg)
+        {
+            __pat = __mp.neg_format();
+            __sn = __mp.negative_sign();
+        }
+        else
+        {
+            __pat = __mp.pos_format();
+            __sn = __mp.positive_sign();
+        }
+        __dp = __mp.decimal_point();
+        __ts = __mp.thousands_sep();
+        __grp = __mp.grouping();
+        __sym = __mp.curr_symbol();
+        __fd = __mp.frac_digits();
+    }
+    else
+    {
+        const moneypunct<char_type, false>& __mp =
+            std::use_facet<moneypunct<char_type, false> >(__loc);
+        if (__neg)
+        {
+            __pat = __mp.neg_format();
+            __sn = __mp.negative_sign();
+        }
+        else
+        {
+            __pat = __mp.pos_format();
+            __sn = __mp.positive_sign();
+        }
+        __dp = __mp.decimal_point();
+        __ts = __mp.thousands_sep();
+        __grp = __mp.grouping();
+        __sym = __mp.curr_symbol();
+        __fd = __mp.frac_digits();
+    }
+}
+
+template <class _CharT>
+void
+__money_put<_CharT>::__format(char_type* __mb, char_type*& __mi, char_type*& __me,
+                              ios_base::fmtflags __flags,
+                              const char_type* __db, const char_type* __de,
+                              const ctype<char_type>& __ct, bool __neg,
+                              const money_base::pattern& __pat, char_type __dp,
+                              char_type __ts, const string& __grp,
+                              const string_type& __sym, const string_type& __sn,
+                              int __fd)
+{
+    __me = __mb;
+    for (char __p : __pat.field)
+    {
+        switch (__p)
+        {
+        case money_base::none:
+            __mi = __me;
+            break;
+        case money_base::space:
+            __mi = __me;
+            *__me++ = __ct.widen(' ');
+            break;
+        case money_base::sign:
+            if (!__sn.empty())
+                *__me++ = __sn[0];
+            break;
+        case money_base::symbol:
+            if (!__sym.empty() && (__flags & ios_base::showbase))
+                __me = _VSTD::copy(__sym.begin(), __sym.end(), __me);
+            break;
+        case money_base::value:
+            {
+            // remember start of value so we can reverse it
+            char_type* __t = __me;
+            // find beginning of digits
+            if (__neg)
+                ++__db;
+            // find end of digits
+            const char_type* __d;
+            for (__d = __db; __d < __de; ++__d)
+                if (!__ct.is(ctype_base::digit, *__d))
+                    break;
+            // print fractional part
+            if (__fd > 0)
+            {
+                int __f;
+                for (__f = __fd; __d > __db && __f > 0; --__f)
+                    *__me++ = *--__d;
+                char_type __z = __f > 0 ? __ct.widen('0') : char_type();
+                for (; __f > 0; --__f)
+                    *__me++ = __z;
+                *__me++ = __dp;
+            }
+            // print units part
+            if (__d == __db)
+            {
+                *__me++ = __ct.widen('0');
+            }
+            else
+            {
+                unsigned __ng = 0;
+                unsigned __ig = 0;
+                unsigned __gl = __grp.empty() ? numeric_limits<unsigned>::max()
+                                              : static_cast<unsigned>(__grp[__ig]);
+                while (__d != __db)
+                {
+                    if (__ng == __gl)
+                    {
+                        *__me++ = __ts;
+                        __ng = 0;
+                        if (++__ig < __grp.size())
+                            __gl = __grp[__ig] == numeric_limits<char>::max() ?
+                                        numeric_limits<unsigned>::max() :
+                                        static_cast<unsigned>(__grp[__ig]);
+                    }
+                    *__me++ = *--__d;
+                    ++__ng;
+                }
+            }
+            // reverse it
+            std::reverse(__t, __me);
+            }
+            break;
+        }
+    }
+    // print rest of sign, if any
+    if (__sn.size() > 1)
+        __me = _VSTD::copy(__sn.begin()+1, __sn.end(), __me);
+    // set alignment
+    if ((__flags & ios_base::adjustfield) == ios_base::left)
+        __mi = __me;
+    else if ((__flags & ios_base::adjustfield) != ios_base::internal)
+        __mi = __mb;
+}
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS __money_put<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS __money_put<wchar_t>;
+#endif
+
+template <class _CharT, class _OutputIterator = ostreambuf_iterator<_CharT> >
+class _LIBCPP_TEMPLATE_VIS money_put
+    : public locale::facet,
+      private __money_put<_CharT>
+{
+public:
+    typedef _CharT                  char_type;
+    typedef _OutputIterator         iter_type;
+    typedef basic_string<char_type> string_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit money_put(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type put(iter_type __s, bool __intl, ios_base& __iob, char_type __fl,
+                  long double __units) const
+    {
+        return do_put(__s, __intl, __iob, __fl, __units);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iter_type put(iter_type __s, bool __intl, ios_base& __iob, char_type __fl,
+                  const string_type& __digits) const
+    {
+        return do_put(__s, __intl, __iob, __fl, __digits);
+    }
+
+    static locale::id id;
+
+protected:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~money_put() override {}
+
+    virtual iter_type do_put(iter_type __s, bool __intl, ios_base& __iob,
+                             char_type __fl, long double __units) const;
+    virtual iter_type do_put(iter_type __s, bool __intl, ios_base& __iob,
+                             char_type __fl, const string_type& __digits) const;
+};
+
+template <class _CharT, class _OutputIterator>
+locale::id
+money_put<_CharT, _OutputIterator>::id;
+
+template <class _CharT, class _OutputIterator>
+_OutputIterator
+money_put<_CharT, _OutputIterator>::do_put(iter_type __s, bool __intl,
+                                           ios_base& __iob, char_type __fl,
+                                           long double __units) const
+{
+    // convert to char
+    const size_t __bs = 100;
+    char __buf[__bs];
+    char* __bb = __buf;
+    char_type __digits[__bs];
+    char_type* __db = __digits;
+    int __n = snprintf(__bb, __bs, "%.0Lf", __units);
+    unique_ptr<char, void(*)(void*)> __hn(nullptr, free);
+    unique_ptr<char_type, void(*)(void*)> __hd(0, free);
+    // secure memory for digit storage
+    if (static_cast<size_t>(__n) > __bs-1)
+    {
+        __n = __libcpp_asprintf_l(&__bb, _LIBCPP_GET_C_LOCALE, "%.0Lf", __units);
+        if (__n == -1)
+            __throw_bad_alloc();
+        __hn.reset(__bb);
+        __hd.reset((char_type*)malloc(static_cast<size_t>(__n) * sizeof(char_type)));
+        if (__hd == nullptr)
+            __throw_bad_alloc();
+        __db = __hd.get();
+    }
+    // gather info
+    locale __loc = __iob.getloc();
+    const ctype<char_type>& __ct = std::use_facet<ctype<char_type> >(__loc);
+    __ct.widen(__bb, __bb + __n, __db);
+    bool __neg = __n > 0 && __bb[0] == '-';
+    money_base::pattern __pat;
+    char_type __dp;
+    char_type __ts;
+    string __grp;
+    string_type __sym;
+    string_type __sn;
+    int __fd;
+    this->__gather_info(__intl, __neg, __loc, __pat, __dp, __ts, __grp, __sym, __sn, __fd);
+    // secure memory for formatting
+    char_type __mbuf[__bs];
+    char_type* __mb = __mbuf;
+    unique_ptr<char_type, void(*)(void*)> __hw(0, free);
+    size_t __exn = __n > __fd ?
+                   (static_cast<size_t>(__n) - static_cast<size_t>(__fd)) * 2 +
+                    __sn.size() + __sym.size() + static_cast<size_t>(__fd) + 1
+                 : __sn.size() + __sym.size() + static_cast<size_t>(__fd) + 2;
+    if (__exn > __bs)
+    {
+        __hw.reset((char_type*)malloc(__exn * sizeof(char_type)));
+        __mb = __hw.get();
+        if (__mb == 0)
+            __throw_bad_alloc();
+    }
+    // format
+    char_type* __mi;
+    char_type* __me;
+    this->__format(__mb, __mi, __me, __iob.flags(),
+                   __db, __db + __n, __ct,
+                   __neg, __pat, __dp, __ts, __grp, __sym, __sn, __fd);
+    return std::__pad_and_output(__s, __mb, __mi, __me, __iob, __fl);
+}
+
+template <class _CharT, class _OutputIterator>
+_OutputIterator
+money_put<_CharT, _OutputIterator>::do_put(iter_type __s, bool __intl,
+                                           ios_base& __iob, char_type __fl,
+                                           const string_type& __digits) const
+{
+    // gather info
+    locale __loc = __iob.getloc();
+    const ctype<char_type>& __ct = std::use_facet<ctype<char_type> >(__loc);
+    bool __neg = __digits.size() > 0 && __digits[0] == __ct.widen('-');
+    money_base::pattern __pat;
+    char_type __dp;
+    char_type __ts;
+    string __grp;
+    string_type __sym;
+    string_type __sn;
+    int __fd;
+    this->__gather_info(__intl, __neg, __loc, __pat, __dp, __ts, __grp, __sym, __sn, __fd);
+    // secure memory for formatting
+    char_type __mbuf[100];
+    char_type* __mb = __mbuf;
+    unique_ptr<char_type, void(*)(void*)> __h(0, free);
+    size_t __exn = static_cast<int>(__digits.size()) > __fd ?
+                   (__digits.size() - static_cast<size_t>(__fd)) * 2 +
+                    __sn.size() + __sym.size() + static_cast<size_t>(__fd) + 1
+                 : __sn.size() + __sym.size() + static_cast<size_t>(__fd) + 2;
+    if (__exn > 100)
+    {
+        __h.reset((char_type*)malloc(__exn * sizeof(char_type)));
+        __mb = __h.get();
+        if (__mb == 0)
+            __throw_bad_alloc();
+    }
+    // format
+    char_type* __mi;
+    char_type* __me;
+    this->__format(__mb, __mi, __me, __iob.flags(),
+                   __digits.data(), __digits.data() + __digits.size(), __ct,
+                   __neg, __pat, __dp, __ts, __grp, __sym, __sn, __fd);
+    return std::__pad_and_output(__s, __mb, __mi, __me, __iob, __fl);
+}
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS money_put<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS money_put<wchar_t>;
+#endif
+
+// messages
+
+class _LIBCPP_TYPE_VIS messages_base
+{
+public:
+    typedef ptrdiff_t catalog;
+
+    _LIBCPP_INLINE_VISIBILITY messages_base() {}
+};
+
+template <class _CharT>
+class _LIBCPP_TEMPLATE_VIS messages
+    : public locale::facet,
+      public messages_base
+{
+public:
+    typedef _CharT               char_type;
+    typedef basic_string<_CharT> string_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit messages(size_t __refs = 0)
+        : locale::facet(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    catalog open(const basic_string<char>& __nm, const locale& __loc) const
+    {
+        return do_open(__nm, __loc);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    string_type get(catalog __c, int __set, int __msgid,
+                    const string_type& __dflt) const
+    {
+        return do_get(__c, __set, __msgid, __dflt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void close(catalog __c) const
+    {
+        do_close(__c);
+    }
+
+    static locale::id id;
+
+protected:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~messages() override {}
+
+    virtual catalog do_open(const basic_string<char>&, const locale&) const;
+    virtual string_type do_get(catalog, int __set, int __msgid,
+                               const string_type& __dflt) const;
+    virtual void do_close(catalog) const;
+};
+
+template <class _CharT>
+locale::id
+messages<_CharT>::id;
+
+template <class _CharT>
+typename messages<_CharT>::catalog
+messages<_CharT>::do_open(const basic_string<char>& __nm, const locale&) const
+{
+#ifdef _LIBCPP_HAS_CATOPEN
+    catalog __cat = (catalog)catopen(__nm.c_str(), NL_CAT_LOCALE);
+    if (__cat != -1)
+        __cat = static_cast<catalog>((static_cast<size_t>(__cat) >> 1));
+    return __cat;
+#else // !_LIBCPP_HAS_CATOPEN
+    (void)__nm;
+    return -1;
+#endif // _LIBCPP_HAS_CATOPEN
+}
+
+template <class _CharT>
+typename messages<_CharT>::string_type
+messages<_CharT>::do_get(catalog __c, int __set, int __msgid,
+                         const string_type& __dflt) const
+{
+#ifdef _LIBCPP_HAS_CATOPEN
+    string __ndflt;
+    __narrow_to_utf8<sizeof(char_type)*__CHAR_BIT__>()(std::back_inserter(__ndflt),
+                                                       __dflt.c_str(),
+                                                       __dflt.c_str() + __dflt.size());
+    if (__c != -1)
+        __c <<= 1;
+    nl_catd __cat = (nl_catd)__c;
+    char* __n = catgets(__cat, __set, __msgid, __ndflt.c_str());
+    string_type __w;
+    __widen_from_utf8<sizeof(char_type)*__CHAR_BIT__>()(std::back_inserter(__w),
+                                                        __n, __n + _VSTD::strlen(__n));
+    return __w;
+#else // !_LIBCPP_HAS_CATOPEN
+    (void)__c;
+    (void)__set;
+    (void)__msgid;
+    return __dflt;
+#endif // _LIBCPP_HAS_CATOPEN
+}
+
+template <class _CharT>
+void
+messages<_CharT>::do_close(catalog __c) const
+{
+#ifdef _LIBCPP_HAS_CATOPEN
+    if (__c != -1)
+        __c <<= 1;
+    nl_catd __cat = (nl_catd)__c;
+    catclose(__cat);
+#else // !_LIBCPP_HAS_CATOPEN
+    (void)__c;
+#endif // _LIBCPP_HAS_CATOPEN
+}
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS messages<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS messages<wchar_t>;
+#endif
+
+template <class _CharT>
+class _LIBCPP_TEMPLATE_VIS messages_byname
+    : public messages<_CharT>
+{
+public:
+    typedef messages_base::catalog catalog;
+    typedef basic_string<_CharT> string_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit messages_byname(const char*, size_t __refs = 0)
+        : messages<_CharT>(__refs) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit messages_byname(const string&, size_t __refs = 0)
+        : messages<_CharT>(__refs) {}
+
+protected:
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL ~messages_byname() override {}
+};
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS messages_byname<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS messages_byname<wchar_t>;
+#endif
+
+template<class _Codecvt, class _Elem = wchar_t,
+         class _Wide_alloc = allocator<_Elem>,
+         class _Byte_alloc = allocator<char> >
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX17 wstring_convert
+{
+public:
+    typedef basic_string<char, char_traits<char>, _Byte_alloc>   byte_string;
+    typedef basic_string<_Elem, char_traits<_Elem>, _Wide_alloc> wide_string;
+    typedef typename _Codecvt::state_type                        state_type;
+    typedef typename wide_string::traits_type::int_type          int_type;
+
+private:
+    byte_string __byte_err_string_;
+    wide_string __wide_err_string_;
+    _Codecvt* __cvtptr_;
+    state_type __cvtstate_;
+    size_t __cvtcount_;
+
+    wstring_convert(const wstring_convert& __wc);
+    wstring_convert& operator=(const wstring_convert& __wc);
+public:
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    wstring_convert() : wstring_convert(new _Codecvt) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit wstring_convert(_Codecvt* __pcvt);
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_EXPLICIT_AFTER_CXX11
+    wstring_convert(_Codecvt* __pcvt = new _Codecvt);
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    wstring_convert(_Codecvt* __pcvt, state_type __state);
+    _LIBCPP_EXPLICIT_AFTER_CXX11 wstring_convert(const byte_string& __byte_err,
+                    const wide_string& __wide_err = wide_string());
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    wstring_convert(wstring_convert&& __wc);
+#endif
+    ~wstring_convert();
+
+    _LIBCPP_INLINE_VISIBILITY
+    wide_string from_bytes(char __byte)
+        {return from_bytes(&__byte, &__byte+1);}
+    _LIBCPP_INLINE_VISIBILITY
+    wide_string from_bytes(const char* __ptr)
+        {return from_bytes(__ptr, __ptr + char_traits<char>::length(__ptr));}
+    _LIBCPP_INLINE_VISIBILITY
+    wide_string from_bytes(const byte_string& __str)
+        {return from_bytes(__str.data(), __str.data() + __str.size());}
+    wide_string from_bytes(const char* __first, const char* __last);
+
+    _LIBCPP_INLINE_VISIBILITY
+    byte_string to_bytes(_Elem __wchar)
+        {return to_bytes(&__wchar, &__wchar+1);}
+    _LIBCPP_INLINE_VISIBILITY
+    byte_string to_bytes(const _Elem* __wptr)
+        {return to_bytes(__wptr, __wptr + char_traits<_Elem>::length(__wptr));}
+    _LIBCPP_INLINE_VISIBILITY
+    byte_string to_bytes(const wide_string& __wstr)
+        {return to_bytes(__wstr.data(), __wstr.data() + __wstr.size());}
+    byte_string to_bytes(const _Elem* __first, const _Elem* __last);
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t converted() const _NOEXCEPT {return __cvtcount_;}
+    _LIBCPP_INLINE_VISIBILITY
+    state_type state() const {return __cvtstate_;}
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template<class _Codecvt, class _Elem, class _Wide_alloc, class _Byte_alloc>
+inline
+wstring_convert<_Codecvt, _Elem, _Wide_alloc, _Byte_alloc>::
+    wstring_convert(_Codecvt* __pcvt)
+        : __cvtptr_(__pcvt), __cvtstate_(), __cvtcount_(0)
+{
+}
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+template<class _Codecvt, class _Elem, class _Wide_alloc, class _Byte_alloc>
+inline
+wstring_convert<_Codecvt, _Elem, _Wide_alloc, _Byte_alloc>::
+    wstring_convert(_Codecvt* __pcvt, state_type __state)
+        : __cvtptr_(__pcvt), __cvtstate_(__state), __cvtcount_(0)
+{
+}
+
+template<class _Codecvt, class _Elem, class _Wide_alloc, class _Byte_alloc>
+wstring_convert<_Codecvt, _Elem, _Wide_alloc, _Byte_alloc>::
+    wstring_convert(const byte_string& __byte_err, const wide_string& __wide_err)
+        : __byte_err_string_(__byte_err), __wide_err_string_(__wide_err),
+          __cvtstate_(), __cvtcount_(0)
+{
+    __cvtptr_ = new _Codecvt;
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template<class _Codecvt, class _Elem, class _Wide_alloc, class _Byte_alloc>
+inline
+wstring_convert<_Codecvt, _Elem, _Wide_alloc, _Byte_alloc>::
+    wstring_convert(wstring_convert&& __wc)
+        : __byte_err_string_(_VSTD::move(__wc.__byte_err_string_)),
+          __wide_err_string_(_VSTD::move(__wc.__wide_err_string_)),
+          __cvtptr_(__wc.__cvtptr_),
+          __cvtstate_(__wc.__cvtstate_), __cvtcount_(__wc.__cvtcount_)
+{
+    __wc.__cvtptr_ = nullptr;
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template<class _Codecvt, class _Elem, class _Wide_alloc, class _Byte_alloc>
+wstring_convert<_Codecvt, _Elem, _Wide_alloc, _Byte_alloc>::~wstring_convert()
+{
+    delete __cvtptr_;
+}
+
+template<class _Codecvt, class _Elem, class _Wide_alloc, class _Byte_alloc>
+typename wstring_convert<_Codecvt, _Elem, _Wide_alloc, _Byte_alloc>::wide_string
+wstring_convert<_Codecvt, _Elem, _Wide_alloc, _Byte_alloc>::
+    from_bytes(const char* __frm, const char* __frm_end)
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+    __cvtcount_ = 0;
+    if (__cvtptr_ != nullptr)
+    {
+        wide_string __ws(2*(__frm_end - __frm), _Elem());
+        if (__frm != __frm_end)
+            __ws.resize(__ws.capacity());
+        codecvt_base::result __r = codecvt_base::ok;
+        state_type __st = __cvtstate_;
+        if (__frm != __frm_end)
+        {
+            _Elem* __to = &__ws[0];
+            _Elem* __to_end = __to + __ws.size();
+            const char* __frm_nxt;
+            do
+            {
+                _Elem* __to_nxt;
+                __r = __cvtptr_->in(__st, __frm, __frm_end, __frm_nxt,
+                                          __to, __to_end, __to_nxt);
+                __cvtcount_ += __frm_nxt - __frm;
+                if (__frm_nxt == __frm)
+                {
+                    __r = codecvt_base::error;
+                }
+                else if (__r == codecvt_base::noconv)
+                {
+                    __ws.resize(__to - &__ws[0]);
+                    // This only gets executed if _Elem is char
+                    __ws.append((const _Elem*)__frm, (const _Elem*)__frm_end);
+                    __frm = __frm_nxt;
+                    __r = codecvt_base::ok;
+                }
+                else if (__r == codecvt_base::ok)
+                {
+                    __ws.resize(__to_nxt - &__ws[0]);
+                    __frm = __frm_nxt;
+                }
+                else if (__r == codecvt_base::partial)
+                {
+                    ptrdiff_t __s = __to_nxt - &__ws[0];
+                    __ws.resize(2 * __s);
+                    __to = &__ws[0] + __s;
+                    __to_end = &__ws[0] + __ws.size();
+                    __frm = __frm_nxt;
+                }
+            } while (__r == codecvt_base::partial && __frm_nxt < __frm_end);
+        }
+        if (__r == codecvt_base::ok)
+            return __ws;
+    }
+
+    if (__wide_err_string_.empty())
+        __throw_range_error("wstring_convert: from_bytes error");
+
+    return __wide_err_string_;
+}
+
+template<class _Codecvt, class _Elem, class _Wide_alloc, class _Byte_alloc>
+typename wstring_convert<_Codecvt, _Elem, _Wide_alloc, _Byte_alloc>::byte_string
+wstring_convert<_Codecvt, _Elem, _Wide_alloc, _Byte_alloc>::
+    to_bytes(const _Elem* __frm, const _Elem* __frm_end)
+{
+    __cvtcount_ = 0;
+    if (__cvtptr_ != nullptr)
+    {
+        byte_string __bs(2*(__frm_end - __frm), char());
+        if (__frm != __frm_end)
+            __bs.resize(__bs.capacity());
+        codecvt_base::result __r = codecvt_base::ok;
+        state_type __st = __cvtstate_;
+        if (__frm != __frm_end)
+        {
+            char* __to = &__bs[0];
+            char* __to_end = __to + __bs.size();
+            const _Elem* __frm_nxt;
+            do
+            {
+                char* __to_nxt;
+                __r = __cvtptr_->out(__st, __frm, __frm_end, __frm_nxt,
+                                           __to, __to_end, __to_nxt);
+                __cvtcount_ += __frm_nxt - __frm;
+                if (__frm_nxt == __frm)
+                {
+                    __r = codecvt_base::error;
+                }
+                else if (__r == codecvt_base::noconv)
+                {
+                    __bs.resize(__to - &__bs[0]);
+                    // This only gets executed if _Elem is char
+                    __bs.append((const char*)__frm, (const char*)__frm_end);
+                    __frm = __frm_nxt;
+                    __r = codecvt_base::ok;
+                }
+                else if (__r == codecvt_base::ok)
+                {
+                    __bs.resize(__to_nxt - &__bs[0]);
+                    __frm = __frm_nxt;
+                }
+                else if (__r == codecvt_base::partial)
+                {
+                    ptrdiff_t __s = __to_nxt - &__bs[0];
+                    __bs.resize(2 * __s);
+                    __to = &__bs[0] + __s;
+                    __to_end = &__bs[0] + __bs.size();
+                    __frm = __frm_nxt;
+                }
+            } while (__r == codecvt_base::partial && __frm_nxt < __frm_end);
+        }
+        if (__r == codecvt_base::ok)
+        {
+            size_t __s = __bs.size();
+            __bs.resize(__bs.capacity());
+            char* __to = &__bs[0] + __s;
+            char* __to_end = __to + __bs.size();
+            do
+            {
+                char* __to_nxt;
+                __r = __cvtptr_->unshift(__st, __to, __to_end, __to_nxt);
+                if (__r == codecvt_base::noconv)
+                {
+                    __bs.resize(__to - &__bs[0]);
+                    __r = codecvt_base::ok;
+                }
+                else if (__r == codecvt_base::ok)
+                {
+                    __bs.resize(__to_nxt - &__bs[0]);
+                }
+                else if (__r == codecvt_base::partial)
+                {
+                    ptrdiff_t __sp = __to_nxt - &__bs[0];
+                    __bs.resize(2 * __sp);
+                    __to = &__bs[0] + __sp;
+                    __to_end = &__bs[0] + __bs.size();
+                }
+            } while (__r == codecvt_base::partial);
+            if (__r == codecvt_base::ok)
+                return __bs;
+        }
+    }
+
+    if (__byte_err_string_.empty())
+        __throw_range_error("wstring_convert: to_bytes error");
+
+    return __byte_err_string_;
+}
+
+template <class _Codecvt, class _Elem = wchar_t, class _Tr = char_traits<_Elem> >
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_DEPRECATED_IN_CXX17 wbuffer_convert
+    : public basic_streambuf<_Elem, _Tr>
+{
+public:
+    // types:
+    typedef _Elem                          char_type;
+    typedef _Tr                            traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+    typedef typename _Codecvt::state_type  state_type;
+
+private:
+    char*       __extbuf_;
+    const char* __extbufnext_;
+    const char* __extbufend_;
+    char __extbuf_min_[8];
+    size_t __ebs_;
+    char_type* __intbuf_;
+    size_t __ibs_;
+    streambuf* __bufptr_;
+    _Codecvt* __cv_;
+    state_type __st_;
+    ios_base::openmode __cm_;
+    bool __owns_eb_;
+    bool __owns_ib_;
+    bool __always_noconv_;
+
+    wbuffer_convert(const wbuffer_convert&);
+    wbuffer_convert& operator=(const wbuffer_convert&);
+
+public:
+#ifndef _LIBCPP_CXX03_LANG
+    wbuffer_convert() : wbuffer_convert(nullptr) {}
+    explicit wbuffer_convert(streambuf* __bytebuf,
+                             _Codecvt* __pcvt = new _Codecvt,
+                             state_type __state = state_type());
+#else
+    _LIBCPP_EXPLICIT_AFTER_CXX11
+    wbuffer_convert(streambuf* __bytebuf = nullptr,
+                    _Codecvt* __pcvt = new _Codecvt,
+                    state_type __state = state_type());
+#endif
+
+    ~wbuffer_convert();
+
+    _LIBCPP_INLINE_VISIBILITY
+    streambuf* rdbuf() const {return __bufptr_;}
+    _LIBCPP_INLINE_VISIBILITY
+    streambuf* rdbuf(streambuf* __bytebuf)
+    {
+        streambuf* __r = __bufptr_;
+        __bufptr_ = __bytebuf;
+        return __r;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    state_type state() const {return __st_;}
+
+protected:
+    virtual int_type underflow();
+    virtual int_type pbackfail(int_type __c = traits_type::eof());
+    virtual int_type overflow (int_type __c = traits_type::eof());
+    virtual basic_streambuf<char_type, traits_type>* setbuf(char_type* __s,
+                                                            streamsize __n);
+    virtual pos_type seekoff(off_type __off, ios_base::seekdir __way,
+                             ios_base::openmode __wch = ios_base::in | ios_base::out);
+    virtual pos_type seekpos(pos_type __sp,
+                             ios_base::openmode __wch = ios_base::in | ios_base::out);
+    virtual int sync();
+
+private:
+    bool __read_mode();
+    void __write_mode();
+    wbuffer_convert* __close();
+};
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Codecvt, class _Elem, class _Tr>
+wbuffer_convert<_Codecvt, _Elem, _Tr>::
+    wbuffer_convert(streambuf* __bytebuf, _Codecvt* __pcvt, state_type __state)
+    : __extbuf_(nullptr),
+      __extbufnext_(nullptr),
+      __extbufend_(nullptr),
+      __ebs_(0),
+      __intbuf_(0),
+      __ibs_(0),
+      __bufptr_(__bytebuf),
+      __cv_(__pcvt),
+      __st_(__state),
+      __cm_(0),
+      __owns_eb_(false),
+      __owns_ib_(false),
+      __always_noconv_(__cv_ ? __cv_->always_noconv() : false)
+{
+    setbuf(0, 4096);
+}
+
+template <class _Codecvt, class _Elem, class _Tr>
+wbuffer_convert<_Codecvt, _Elem, _Tr>::~wbuffer_convert()
+{
+    __close();
+    delete __cv_;
+    if (__owns_eb_)
+        delete [] __extbuf_;
+    if (__owns_ib_)
+        delete [] __intbuf_;
+}
+
+template <class _Codecvt, class _Elem, class _Tr>
+typename wbuffer_convert<_Codecvt, _Elem, _Tr>::int_type
+wbuffer_convert<_Codecvt, _Elem, _Tr>::underflow()
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+    if (__cv_ == 0 || __bufptr_ == 0)
+        return traits_type::eof();
+    bool __initial = __read_mode();
+    char_type __1buf;
+    if (this->gptr() == 0)
+        this->setg(&__1buf, &__1buf+1, &__1buf+1);
+    const size_t __unget_sz = __initial ? 0 : std::min<size_t>((this->egptr() - this->eback()) / 2, 4);
+    int_type __c = traits_type::eof();
+    if (this->gptr() == this->egptr())
+    {
+        _VSTD::memmove(this->eback(), this->egptr() - __unget_sz, __unget_sz * sizeof(char_type));
+        if (__always_noconv_)
+        {
+            streamsize __nmemb = static_cast<streamsize>(this->egptr() - this->eback() - __unget_sz);
+            __nmemb = __bufptr_->sgetn((char*)this->eback() + __unget_sz, __nmemb);
+            if (__nmemb != 0)
+            {
+                this->setg(this->eback(),
+                           this->eback() + __unget_sz,
+                           this->eback() + __unget_sz + __nmemb);
+                __c = *this->gptr();
+            }
+        }
+        else
+        {
+             if (__extbufend_ != __extbufnext_) {
+                _LIBCPP_ASSERT(__extbufnext_ != nullptr, "underflow moving from nullptr");
+                _LIBCPP_ASSERT(__extbuf_ != nullptr, "underflow moving into nullptr");
+                _VSTD::memmove(__extbuf_, __extbufnext_, __extbufend_ - __extbufnext_);
+             }
+            __extbufnext_ = __extbuf_ + (__extbufend_ - __extbufnext_);
+            __extbufend_ = __extbuf_ + (__extbuf_ == __extbuf_min_ ? sizeof(__extbuf_min_) : __ebs_);
+            streamsize __nmemb = _VSTD::min(static_cast<streamsize>(this->egptr() - this->eback() - __unget_sz),
+                                 static_cast<streamsize>(__extbufend_ - __extbufnext_));
+            codecvt_base::result __r;
+            // FIXME: Do we ever need to restore the state here?
+            //state_type __svs = __st_;
+            streamsize __nr = __bufptr_->sgetn(const_cast<char*>(__extbufnext_), __nmemb);
+            if (__nr != 0)
+            {
+                __extbufend_ = __extbufnext_ + __nr;
+                char_type*  __inext;
+                __r = __cv_->in(__st_, __extbuf_, __extbufend_, __extbufnext_,
+                                       this->eback() + __unget_sz,
+                                       this->egptr(), __inext);
+                if (__r == codecvt_base::noconv)
+                {
+                    this->setg((char_type*)__extbuf_, (char_type*)__extbuf_,
+                               (char_type*) const_cast<char *>(__extbufend_));
+                    __c = *this->gptr();
+                }
+                else if (__inext != this->eback() + __unget_sz)
+                {
+                    this->setg(this->eback(), this->eback() + __unget_sz, __inext);
+                    __c = *this->gptr();
+                }
+            }
+        }
+    }
+    else
+        __c = *this->gptr();
+    if (this->eback() == &__1buf)
+        this->setg(0, 0, 0);
+    return __c;
+}
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Codecvt, class _Elem, class _Tr>
+typename wbuffer_convert<_Codecvt, _Elem, _Tr>::int_type
+wbuffer_convert<_Codecvt, _Elem, _Tr>::pbackfail(int_type __c)
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+    if (__cv_ != 0 && __bufptr_ != 0 && this->eback() < this->gptr())
+    {
+        if (traits_type::eq_int_type(__c, traits_type::eof()))
+        {
+            this->gbump(-1);
+            return traits_type::not_eof(__c);
+        }
+        if (traits_type::eq(traits_type::to_char_type(__c), this->gptr()[-1]))
+        {
+            this->gbump(-1);
+            *this->gptr() = traits_type::to_char_type(__c);
+            return __c;
+        }
+    }
+    return traits_type::eof();
+}
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Codecvt, class _Elem, class _Tr>
+typename wbuffer_convert<_Codecvt, _Elem, _Tr>::int_type
+wbuffer_convert<_Codecvt, _Elem, _Tr>::overflow(int_type __c)
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+    if (__cv_ == 0 || __bufptr_ == 0)
+        return traits_type::eof();
+    __write_mode();
+    char_type __1buf;
+    char_type* __pb_save = this->pbase();
+    char_type* __epb_save = this->epptr();
+    if (!traits_type::eq_int_type(__c, traits_type::eof()))
+    {
+        if (this->pptr() == 0)
+            this->setp(&__1buf, &__1buf+1);
+        *this->pptr() = traits_type::to_char_type(__c);
+        this->pbump(1);
+    }
+    if (this->pptr() != this->pbase())
+    {
+        if (__always_noconv_)
+        {
+            streamsize __nmemb = static_cast<streamsize>(this->pptr() - this->pbase());
+            if (__bufptr_->sputn((const char*)this->pbase(), __nmemb) != __nmemb)
+                return traits_type::eof();
+        }
+        else
+        {
+            char* __extbe = __extbuf_;
+            codecvt_base::result __r;
+            do
+            {
+                const char_type* __e;
+                __r = __cv_->out(__st_, this->pbase(), this->pptr(), __e,
+                                        __extbuf_, __extbuf_ + __ebs_, __extbe);
+                if (__e == this->pbase())
+                    return traits_type::eof();
+                if (__r == codecvt_base::noconv)
+                {
+                    streamsize __nmemb = static_cast<size_t>(this->pptr() - this->pbase());
+                    if (__bufptr_->sputn((const char*)this->pbase(), __nmemb) != __nmemb)
+                        return traits_type::eof();
+                }
+                else if (__r == codecvt_base::ok || __r == codecvt_base::partial)
+                {
+                    streamsize __nmemb = static_cast<size_t>(__extbe - __extbuf_);
+                    if (__bufptr_->sputn(__extbuf_, __nmemb) != __nmemb)
+                        return traits_type::eof();
+                    if (__r == codecvt_base::partial)
+                    {
+                        this->setp(const_cast<char_type *>(__e), this->pptr());
+                        this->__pbump(this->epptr() - this->pbase());
+                    }
+                }
+                else
+                    return traits_type::eof();
+            } while (__r == codecvt_base::partial);
+        }
+        this->setp(__pb_save, __epb_save);
+    }
+    return traits_type::not_eof(__c);
+}
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Codecvt, class _Elem, class _Tr>
+basic_streambuf<_Elem, _Tr>*
+wbuffer_convert<_Codecvt, _Elem, _Tr>::setbuf(char_type* __s, streamsize __n)
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+    this->setg(0, 0, 0);
+    this->setp(0, 0);
+    if (__owns_eb_)
+        delete [] __extbuf_;
+    if (__owns_ib_)
+        delete [] __intbuf_;
+    __ebs_ = __n;
+    if (__ebs_ > sizeof(__extbuf_min_))
+    {
+        if (__always_noconv_ && __s)
+        {
+            __extbuf_ = (char*)__s;
+            __owns_eb_ = false;
+        }
+        else
+        {
+            __extbuf_ = new char[__ebs_];
+            __owns_eb_ = true;
+        }
+    }
+    else
+    {
+        __extbuf_ = __extbuf_min_;
+        __ebs_ = sizeof(__extbuf_min_);
+        __owns_eb_ = false;
+    }
+    if (!__always_noconv_)
+    {
+        __ibs_ = max<streamsize>(__n, sizeof(__extbuf_min_));
+        if (__s && __ibs_ >= sizeof(__extbuf_min_))
+        {
+            __intbuf_ = __s;
+            __owns_ib_ = false;
+        }
+        else
+        {
+            __intbuf_ = new char_type[__ibs_];
+            __owns_ib_ = true;
+        }
+    }
+    else
+    {
+        __ibs_ = 0;
+        __intbuf_ = 0;
+        __owns_ib_ = false;
+    }
+    return this;
+}
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Codecvt, class _Elem, class _Tr>
+typename wbuffer_convert<_Codecvt, _Elem, _Tr>::pos_type
+wbuffer_convert<_Codecvt, _Elem, _Tr>::seekoff(off_type __off, ios_base::seekdir __way,
+                                        ios_base::openmode __om)
+{
+    int __width = __cv_->encoding();
+    if (__cv_ == 0 || __bufptr_ == 0 || (__width <= 0 && __off != 0) || sync())
+        return pos_type(off_type(-1));
+    // __width > 0 || __off == 0, now check __way
+    if (__way != ios_base::beg && __way != ios_base::cur && __way != ios_base::end)
+        return pos_type(off_type(-1));
+    pos_type __r = __bufptr_->pubseekoff(__width * __off, __way, __om);
+    __r.state(__st_);
+    return __r;
+}
+
+template <class _Codecvt, class _Elem, class _Tr>
+typename wbuffer_convert<_Codecvt, _Elem, _Tr>::pos_type
+wbuffer_convert<_Codecvt, _Elem, _Tr>::seekpos(pos_type __sp, ios_base::openmode __wch)
+{
+    if (__cv_ == 0 || __bufptr_ == 0 || sync())
+        return pos_type(off_type(-1));
+    if (__bufptr_->pubseekpos(__sp, __wch) == pos_type(off_type(-1)))
+        return pos_type(off_type(-1));
+    return __sp;
+}
+
+template <class _Codecvt, class _Elem, class _Tr>
+int
+wbuffer_convert<_Codecvt, _Elem, _Tr>::sync()
+{
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+    if (__cv_ == 0 || __bufptr_ == 0)
+        return 0;
+    if (__cm_ & ios_base::out)
+    {
+        if (this->pptr() != this->pbase())
+            if (overflow() == traits_type::eof())
+                return -1;
+        codecvt_base::result __r;
+        do
+        {
+            char* __extbe;
+            __r = __cv_->unshift(__st_, __extbuf_, __extbuf_ + __ebs_, __extbe);
+            streamsize __nmemb = static_cast<streamsize>(__extbe - __extbuf_);
+            if (__bufptr_->sputn(__extbuf_, __nmemb) != __nmemb)
+                return -1;
+        } while (__r == codecvt_base::partial);
+        if (__r == codecvt_base::error)
+            return -1;
+        if (__bufptr_->pubsync())
+            return -1;
+    }
+    else if (__cm_ & ios_base::in)
+    {
+        off_type __c;
+        if (__always_noconv_)
+            __c = this->egptr() - this->gptr();
+        else
+        {
+            int __width = __cv_->encoding();
+            __c = __extbufend_ - __extbufnext_;
+            if (__width > 0)
+                __c += __width * (this->egptr() - this->gptr());
+            else
+            {
+                if (this->gptr() != this->egptr())
+                {
+                    std::reverse(this->gptr(), this->egptr());
+                    codecvt_base::result __r;
+                    const char_type* __e = this->gptr();
+                    char* __extbe;
+                    do
+                    {
+                        __r = __cv_->out(__st_, __e, this->egptr(), __e,
+                                         __extbuf_, __extbuf_ + __ebs_, __extbe);
+                        switch (__r)
+                        {
+                        case codecvt_base::noconv:
+                            __c += this->egptr() - this->gptr();
+                            break;
+                        case codecvt_base::ok:
+                        case codecvt_base::partial:
+                            __c += __extbe - __extbuf_;
+                            break;
+                        default:
+                            return -1;
+                        }
+                    } while (__r == codecvt_base::partial);
+                }
+            }
+        }
+        if (__bufptr_->pubseekoff(-__c, ios_base::cur, __cm_) == pos_type(off_type(-1)))
+            return -1;
+        this->setg(0, 0, 0);
+        __cm_ = 0;
+    }
+    return 0;
+}
+
+_LIBCPP_SUPPRESS_DEPRECATED_PUSH
+template <class _Codecvt, class _Elem, class _Tr>
+bool
+wbuffer_convert<_Codecvt, _Elem, _Tr>::__read_mode()
+{
+    if (!(__cm_ & ios_base::in))
+    {
+        this->setp(0, 0);
+        if (__always_noconv_)
+            this->setg((char_type*)__extbuf_,
+                       (char_type*)__extbuf_ + __ebs_,
+                       (char_type*)__extbuf_ + __ebs_);
+        else
+            this->setg(__intbuf_, __intbuf_ + __ibs_, __intbuf_ + __ibs_);
+        __cm_ = ios_base::in;
+        return true;
+    }
+    return false;
+}
+
+template <class _Codecvt, class _Elem, class _Tr>
+void
+wbuffer_convert<_Codecvt, _Elem, _Tr>::__write_mode()
+{
+    if (!(__cm_ & ios_base::out))
+    {
+        this->setg(0, 0, 0);
+        if (__ebs_ > sizeof(__extbuf_min_))
+        {
+            if (__always_noconv_)
+                this->setp((char_type*)__extbuf_,
+                           (char_type*)__extbuf_ + (__ebs_ - 1));
+            else
+                this->setp(__intbuf_, __intbuf_ + (__ibs_ - 1));
+        }
+        else
+            this->setp(0, 0);
+        __cm_ = ios_base::out;
+    }
+}
+
+template <class _Codecvt, class _Elem, class _Tr>
+wbuffer_convert<_Codecvt, _Elem, _Tr>*
+wbuffer_convert<_Codecvt, _Elem, _Tr>::__close()
+{
+    wbuffer_convert* __rt = nullptr;
+    if (__cv_ != nullptr && __bufptr_ != nullptr)
+    {
+        __rt = this;
+        if ((__cm_ & ios_base::out) && sync())
+            __rt = nullptr;
+    }
+    return __rt;
+}
+
+_LIBCPP_SUPPRESS_DEPRECATED_POP
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+// NOLINTEND(libcpp-robust-against-adl)
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <atomic>
+#  include <concepts>
+#  include <cstdarg>
+#  include <iterator>
+#  include <stdexcept>
+#  include <type_traits>
+#  include <typeinfo>
+#endif
+
+#endif // _LIBCPP_LOCALE
diff --git a/app/src/main/cpp/libcxx/include/locale.h b/app/src/main/cpp/libcxx/include/locale.h
new file mode 100644
index 0000000..3fb8120
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/locale.h
@@ -0,0 +1,50 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_LOCALE_H
+#define _LIBCPP_LOCALE_H
+
+/*
+    locale.h synopsis
+
+Macros:
+
+    LC_ALL
+    LC_COLLATE
+    LC_CTYPE
+    LC_MONETARY
+    LC_NUMERIC
+    LC_TIME
+
+Types:
+
+    lconv
+
+Functions:
+
+   setlocale
+   localeconv
+
+*/
+
+#include <__config>
+
+#if defined(_LIBCPP_HAS_NO_LOCALIZATION)
+#   error "<locale.h> is not supported since libc++ has been configured without support for localization."
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if __has_include_next(<locale.h>)
+#  include_next <locale.h>
+#endif
+
+#endif // _LIBCPP_LOCALE_H
diff --git a/app/src/main/cpp/libcxx/include/map b/app/src/main/cpp/libcxx/include/map
new file mode 100644
index 0000000..9cf47b2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/map
@@ -0,0 +1,2361 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_MAP
+#define _LIBCPP_MAP
+
+/*
+
+    map synopsis
+
+namespace std
+{
+
+template <class Key, class T, class Compare = less<Key>,
+          class Allocator = allocator<pair<const Key, T>>>
+class map
+{
+public:
+    // types:
+    typedef Key                                      key_type;
+    typedef T                                        mapped_type;
+    typedef pair<const key_type, mapped_type>        value_type;
+    typedef Compare                                  key_compare;
+    typedef Allocator                                allocator_type;
+    typedef typename allocator_type::reference       reference;
+    typedef typename allocator_type::const_reference const_reference;
+    typedef typename allocator_type::pointer         pointer;
+    typedef typename allocator_type::const_pointer   const_pointer;
+    typedef typename allocator_type::size_type       size_type;
+    typedef typename allocator_type::difference_type difference_type;
+
+    typedef implementation-defined                   iterator;
+    typedef implementation-defined                   const_iterator;
+    typedef std::reverse_iterator<iterator>          reverse_iterator;
+    typedef std::reverse_iterator<const_iterator>    const_reverse_iterator;
+    typedef unspecified                              node_type;              // C++17
+    typedef INSERT_RETURN_TYPE<iterator, node_type>  insert_return_type;     // C++17
+
+    class value_compare
+    {
+        friend class map;
+    protected:
+        key_compare comp;
+
+        value_compare(key_compare c);
+    public:
+        typedef bool result_type;  // deprecated in C++17, removed in C++20
+        typedef value_type first_argument_type;  // deprecated in C++17, removed in C++20
+        typedef value_type second_argument_type;  // deprecated in C++17, removed in C++20
+        bool operator()(const value_type& x, const value_type& y) const;
+    };
+
+    // construct/copy/destroy:
+    map()
+        noexcept(
+            is_nothrow_default_constructible<allocator_type>::value &&
+            is_nothrow_default_constructible<key_compare>::value &&
+            is_nothrow_copy_constructible<key_compare>::value);
+    explicit map(const key_compare& comp);
+    map(const key_compare& comp, const allocator_type& a);
+    template <class InputIterator>
+        map(InputIterator first, InputIterator last,
+            const key_compare& comp = key_compare());
+    template <class InputIterator>
+        map(InputIterator first, InputIterator last,
+            const key_compare& comp, const allocator_type& a);
+    map(const map& m);
+    map(map&& m)
+        noexcept(
+            is_nothrow_move_constructible<allocator_type>::value &&
+            is_nothrow_move_constructible<key_compare>::value);
+    explicit map(const allocator_type& a);
+    map(const map& m, const allocator_type& a);
+    map(map&& m, const allocator_type& a);
+    map(initializer_list<value_type> il, const key_compare& comp = key_compare());
+    map(initializer_list<value_type> il, const key_compare& comp, const allocator_type& a);
+    template <class InputIterator>
+        map(InputIterator first, InputIterator last, const allocator_type& a)
+            : map(first, last, Compare(), a) {}  // C++14
+    map(initializer_list<value_type> il, const allocator_type& a)
+        : map(il, Compare(), a) {}  // C++14
+   ~map();
+
+    map& operator=(const map& m);
+    map& operator=(map&& m)
+        noexcept(
+            allocator_type::propagate_on_container_move_assignment::value &&
+            is_nothrow_move_assignable<allocator_type>::value &&
+            is_nothrow_move_assignable<key_compare>::value);
+    map& operator=(initializer_list<value_type> il);
+
+    // iterators:
+          iterator begin() noexcept;
+    const_iterator begin() const noexcept;
+          iterator end() noexcept;
+    const_iterator end()   const noexcept;
+
+          reverse_iterator rbegin() noexcept;
+    const_reverse_iterator rbegin() const noexcept;
+          reverse_iterator rend() noexcept;
+    const_reverse_iterator rend()   const noexcept;
+
+    const_iterator         cbegin()  const noexcept;
+    const_iterator         cend()    const noexcept;
+    const_reverse_iterator crbegin() const noexcept;
+    const_reverse_iterator crend()   const noexcept;
+
+    // capacity:
+    bool      empty()    const noexcept;
+    size_type size()     const noexcept;
+    size_type max_size() const noexcept;
+
+    // element access:
+    mapped_type& operator[](const key_type& k);
+    mapped_type& operator[](key_type&& k);
+
+          mapped_type& at(const key_type& k);
+    const mapped_type& at(const key_type& k) const;
+
+    // modifiers:
+    template <class... Args>
+        pair<iterator, bool> emplace(Args&&... args);
+    template <class... Args>
+        iterator emplace_hint(const_iterator position, Args&&... args);
+    pair<iterator, bool> insert(const value_type& v);
+    pair<iterator, bool> insert(      value_type&& v);                                // C++17
+    template <class P>
+        pair<iterator, bool> insert(P&& p);
+    iterator insert(const_iterator position, const value_type& v);
+    iterator insert(const_iterator position,       value_type&& v);                   // C++17
+    template <class P>
+        iterator insert(const_iterator position, P&& p);
+    template <class InputIterator>
+        void insert(InputIterator first, InputIterator last);
+    void insert(initializer_list<value_type> il);
+
+    node_type extract(const_iterator position);                                       // C++17
+    node_type extract(const key_type& x);                                             // C++17
+    insert_return_type insert(node_type&& nh);                                        // C++17
+    iterator insert(const_iterator hint, node_type&& nh);                             // C++17
+
+    template <class... Args>
+        pair<iterator, bool> try_emplace(const key_type& k, Args&&... args);          // C++17
+    template <class... Args>
+        pair<iterator, bool> try_emplace(key_type&& k, Args&&... args);               // C++17
+    template <class... Args>
+        iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args); // C++17
+    template <class... Args>
+        iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args);      // C++17
+    template <class M>
+        pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj);            // C++17
+    template <class M>
+        pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj);                 // C++17
+    template <class M>
+        iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj);   // C++17
+    template <class M>
+        iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj);        // C++17
+
+    iterator  erase(const_iterator position);
+    iterator  erase(iterator position); // C++14
+    size_type erase(const key_type& k);
+    iterator  erase(const_iterator first, const_iterator last);
+    void clear() noexcept;
+
+    template<class C2>
+      void merge(map<Key, T, C2, Allocator>& source);         // C++17
+    template<class C2>
+      void merge(map<Key, T, C2, Allocator>&& source);        // C++17
+    template<class C2>
+      void merge(multimap<Key, T, C2, Allocator>& source);    // C++17
+    template<class C2>
+      void merge(multimap<Key, T, C2, Allocator>&& source);   // C++17
+
+    void swap(map& m)
+        noexcept(allocator_traits<allocator_type>::is_always_equal::value &&
+            is_nothrow_swappable<key_compare>::value); // C++17
+
+    // observers:
+    allocator_type get_allocator() const noexcept;
+    key_compare    key_comp()      const;
+    value_compare  value_comp()    const;
+
+    // map operations:
+          iterator find(const key_type& k);
+    const_iterator find(const key_type& k) const;
+    template<typename K>
+        iterator find(const K& x);              // C++14
+    template<typename K>
+        const_iterator find(const K& x) const;  // C++14
+
+    template<typename K>
+      size_type count(const K& x) const;        // C++14
+    size_type      count(const key_type& k) const;
+
+    bool           contains(const key_type& x) const;  // C++20
+    template<class K> bool contains(const K& x) const; // C++20
+
+          iterator lower_bound(const key_type& k);
+    const_iterator lower_bound(const key_type& k) const;
+    template<typename K>
+        iterator lower_bound(const K& x);              // C++14
+    template<typename K>
+        const_iterator lower_bound(const K& x) const;  // C++14
+
+          iterator upper_bound(const key_type& k);
+    const_iterator upper_bound(const key_type& k) const;
+    template<typename K>
+        iterator upper_bound(const K& x);              // C++14
+    template<typename K>
+        const_iterator upper_bound(const K& x) const;  // C++14
+
+    pair<iterator,iterator>             equal_range(const key_type& k);
+    pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
+    template<typename K>
+        pair<iterator,iterator>             equal_range(const K& x);        // C++14
+    template<typename K>
+        pair<const_iterator,const_iterator> equal_range(const K& x) const;  // C++14
+};
+
+template <class InputIterator,
+      class Compare = less<iter_key_t<InputIterator>>,
+      class Allocator = allocator<iter_to_alloc_t<InputIterator>>>
+map(InputIterator, InputIterator, Compare = Compare(), Allocator = Allocator())
+  -> map<iter_key_t<InputIterator>, iter_val_t<InputIterator>, Compare, Allocator>; // C++17
+
+template<class Key, class T, class Compare = less<Key>,
+    class Allocator = allocator<pair<const Key, T>>>
+map(initializer_list<pair<const Key, T>>, Compare = Compare(), Allocator = Allocator())
+  -> map<Key, T, Compare, Allocator>; // C++17
+
+template <class InputIterator, class Allocator>
+map(InputIterator, InputIterator, Allocator)
+  -> map<iter_key_t<InputIterator>, iter_val_t<InputIterator>, less<iter_key_t<InputIterator>>,
+    Allocator>; // C++17
+
+template<class Key, class T, class Allocator>
+map(initializer_list<pair<const Key, T>>, Allocator) -> map<Key, T, less<Key>, Allocator>; // C++17
+
+template <class Key, class T, class Compare, class Allocator>
+bool
+operator==(const map<Key, T, Compare, Allocator>& x,
+           const map<Key, T, Compare, Allocator>& y);
+
+template <class Key, class T, class Compare, class Allocator>
+bool
+operator< (const map<Key, T, Compare, Allocator>& x,
+           const map<Key, T, Compare, Allocator>& y);
+
+template <class Key, class T, class Compare, class Allocator>
+bool
+operator!=(const map<Key, T, Compare, Allocator>& x,
+           const map<Key, T, Compare, Allocator>& y);
+
+template <class Key, class T, class Compare, class Allocator>
+bool
+operator> (const map<Key, T, Compare, Allocator>& x,
+           const map<Key, T, Compare, Allocator>& y);
+
+template <class Key, class T, class Compare, class Allocator>
+bool
+operator>=(const map<Key, T, Compare, Allocator>& x,
+           const map<Key, T, Compare, Allocator>& y);
+
+template <class Key, class T, class Compare, class Allocator>
+bool
+operator<=(const map<Key, T, Compare, Allocator>& x,
+           const map<Key, T, Compare, Allocator>& y);
+
+// specialized algorithms:
+template <class Key, class T, class Compare, class Allocator>
+void
+swap(map<Key, T, Compare, Allocator>& x, map<Key, T, Compare, Allocator>& y)
+    noexcept(noexcept(x.swap(y)));
+
+template <class Key, class T, class Compare, class Allocator, class Predicate>
+typename map<Key, T, Compare, Allocator>::size_type
+erase_if(map<Key, T, Compare, Allocator>& c, Predicate pred);  // C++20
+
+
+template <class Key, class T, class Compare = less<Key>,
+          class Allocator = allocator<pair<const Key, T>>>
+class multimap
+{
+public:
+    // types:
+    typedef Key                                      key_type;
+    typedef T                                        mapped_type;
+    typedef pair<const key_type,mapped_type>         value_type;
+    typedef Compare                                  key_compare;
+    typedef Allocator                                allocator_type;
+    typedef typename allocator_type::reference       reference;
+    typedef typename allocator_type::const_reference const_reference;
+    typedef typename allocator_type::size_type       size_type;
+    typedef typename allocator_type::difference_type difference_type;
+    typedef typename allocator_type::pointer         pointer;
+    typedef typename allocator_type::const_pointer   const_pointer;
+
+    typedef implementation-defined                   iterator;
+    typedef implementation-defined                   const_iterator;
+    typedef std::reverse_iterator<iterator>          reverse_iterator;
+    typedef std::reverse_iterator<const_iterator>    const_reverse_iterator;
+    typedef unspecified                              node_type;              // C++17
+
+    class value_compare
+    {
+        friend class multimap;
+    protected:
+        key_compare comp;
+        value_compare(key_compare c);
+    public:
+        typedef bool result_type;  // deprecated in C++17, removed in C++20
+        typedef value_type first_argument_type;  // deprecated in C++17, removed in C++20
+        typedef value_type second_argument_type;  // deprecated in C++17, removed in C++20
+        bool operator()(const value_type& x, const value_type& y) const;
+    };
+
+    // construct/copy/destroy:
+    multimap()
+        noexcept(
+            is_nothrow_default_constructible<allocator_type>::value &&
+            is_nothrow_default_constructible<key_compare>::value &&
+            is_nothrow_copy_constructible<key_compare>::value);
+    explicit multimap(const key_compare& comp);
+    multimap(const key_compare& comp, const allocator_type& a);
+    template <class InputIterator>
+        multimap(InputIterator first, InputIterator last, const key_compare& comp);
+    template <class InputIterator>
+        multimap(InputIterator first, InputIterator last, const key_compare& comp,
+                 const allocator_type& a);
+    multimap(const multimap& m);
+    multimap(multimap&& m)
+        noexcept(
+            is_nothrow_move_constructible<allocator_type>::value &&
+            is_nothrow_move_constructible<key_compare>::value);
+    explicit multimap(const allocator_type& a);
+    multimap(const multimap& m, const allocator_type& a);
+    multimap(multimap&& m, const allocator_type& a);
+    multimap(initializer_list<value_type> il, const key_compare& comp = key_compare());
+    multimap(initializer_list<value_type> il, const key_compare& comp,
+             const allocator_type& a);
+    template <class InputIterator>
+        multimap(InputIterator first, InputIterator last, const allocator_type& a)
+            : multimap(first, last, Compare(), a) {} // C++14
+    multimap(initializer_list<value_type> il, const allocator_type& a)
+        : multimap(il, Compare(), a) {} // C++14
+    ~multimap();
+
+    multimap& operator=(const multimap& m);
+    multimap& operator=(multimap&& m)
+        noexcept(
+            allocator_type::propagate_on_container_move_assignment::value &&
+            is_nothrow_move_assignable<allocator_type>::value &&
+            is_nothrow_move_assignable<key_compare>::value);
+    multimap& operator=(initializer_list<value_type> il);
+
+    // iterators:
+          iterator begin() noexcept;
+    const_iterator begin() const noexcept;
+          iterator end() noexcept;
+    const_iterator end()   const noexcept;
+
+          reverse_iterator rbegin() noexcept;
+    const_reverse_iterator rbegin() const noexcept;
+          reverse_iterator rend() noexcept;
+    const_reverse_iterator rend()   const noexcept;
+
+    const_iterator         cbegin()  const noexcept;
+    const_iterator         cend()    const noexcept;
+    const_reverse_iterator crbegin() const noexcept;
+    const_reverse_iterator crend()   const noexcept;
+
+    // capacity:
+    bool      empty()    const noexcept;
+    size_type size()     const noexcept;
+    size_type max_size() const noexcept;
+
+    // modifiers:
+    template <class... Args>
+        iterator emplace(Args&&... args);
+    template <class... Args>
+        iterator emplace_hint(const_iterator position, Args&&... args);
+    iterator insert(const value_type& v);
+    iterator insert(      value_type&& v);                                            // C++17
+    template <class P>
+        iterator insert(P&& p);
+    iterator insert(const_iterator position, const value_type& v);
+    iterator insert(const_iterator position,       value_type&& v);                   // C++17
+    template <class P>
+        iterator insert(const_iterator position, P&& p);
+    template <class InputIterator>
+        void insert(InputIterator first, InputIterator last);
+    void insert(initializer_list<value_type> il);
+
+    node_type extract(const_iterator position);                                       // C++17
+    node_type extract(const key_type& x);                                             // C++17
+    iterator insert(node_type&& nh);                                                  // C++17
+    iterator insert(const_iterator hint, node_type&& nh);                             // C++17
+
+    iterator  erase(const_iterator position);
+    iterator  erase(iterator position); // C++14
+    size_type erase(const key_type& k);
+    iterator  erase(const_iterator first, const_iterator last);
+    void clear() noexcept;
+
+    template<class C2>
+      void merge(multimap<Key, T, C2, Allocator>& source);    // C++17
+    template<class C2>
+      void merge(multimap<Key, T, C2, Allocator>&& source);   // C++17
+    template<class C2>
+      void merge(map<Key, T, C2, Allocator>& source);         // C++17
+    template<class C2>
+      void merge(map<Key, T, C2, Allocator>&& source);        // C++17
+
+    void swap(multimap& m)
+        noexcept(allocator_traits<allocator_type>::is_always_equal::value &&
+            is_nothrow_swappable<key_compare>::value); // C++17
+
+    // observers:
+    allocator_type get_allocator() const noexcept;
+    key_compare    key_comp()      const;
+    value_compare  value_comp()    const;
+
+    // map operations:
+          iterator find(const key_type& k);
+    const_iterator find(const key_type& k) const;
+    template<typename K>
+        iterator find(const K& x);              // C++14
+    template<typename K>
+        const_iterator find(const K& x) const;  // C++14
+
+    template<typename K>
+      size_type count(const K& x) const;        // C++14
+    size_type      count(const key_type& k) const;
+
+    bool           contains(const key_type& x) const;  // C++20
+    template<class K> bool contains(const K& x) const; // C++20
+
+          iterator lower_bound(const key_type& k);
+    const_iterator lower_bound(const key_type& k) const;
+    template<typename K>
+        iterator lower_bound(const K& x);              // C++14
+    template<typename K>
+        const_iterator lower_bound(const K& x) const;  // C++14
+
+          iterator upper_bound(const key_type& k);
+    const_iterator upper_bound(const key_type& k) const;
+    template<typename K>
+        iterator upper_bound(const K& x);              // C++14
+    template<typename K>
+        const_iterator upper_bound(const K& x) const;  // C++14
+
+    pair<iterator,iterator>             equal_range(const key_type& k);
+    pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
+    template<typename K>
+        pair<iterator,iterator>             equal_range(const K& x);        // C++14
+    template<typename K>
+        pair<const_iterator,const_iterator> equal_range(const K& x) const;  // C++14
+};
+
+template <class InputIterator,
+      class Compare = less<iter_key_t<InputIterator>>,
+      class Allocator = allocator<iter_to_alloc_t<InputIterator>>>
+multimap(InputIterator, InputIterator, Compare = Compare(), Allocator = Allocator())
+  -> multimap<iter_key_t<InputIterator>, iter_val_t<InputIterator>, Compare, Allocator>; // C++17
+
+template<class Key, class T, class Compare = less<Key>,
+    class Allocator = allocator<pair<const Key, T>>>
+multimap(initializer_list<pair<const Key, T>>, Compare = Compare(), Allocator = Allocator())
+  -> multimap<Key, T, Compare, Allocator>; // C++17
+
+template <class InputIterator, class Allocator>
+multimap(InputIterator, InputIterator, Allocator)
+  -> multimap<iter_key_t<InputIterator>, iter_val_t<InputIterator>,
+    less<iter_key_t<InputIterator>>, Allocator>; // C++17
+
+template<class Key, class T, class Allocator>
+multimap(initializer_list<pair<const Key, T>>, Allocator)
+  -> multimap<Key, T, less<Key>, Allocator>; // C++17
+
+template <class Key, class T, class Compare, class Allocator>
+bool
+operator==(const multimap<Key, T, Compare, Allocator>& x,
+           const multimap<Key, T, Compare, Allocator>& y);
+
+template <class Key, class T, class Compare, class Allocator>
+bool
+operator< (const multimap<Key, T, Compare, Allocator>& x,
+           const multimap<Key, T, Compare, Allocator>& y);
+
+template <class Key, class T, class Compare, class Allocator>
+bool
+operator!=(const multimap<Key, T, Compare, Allocator>& x,
+           const multimap<Key, T, Compare, Allocator>& y);
+
+template <class Key, class T, class Compare, class Allocator>
+bool
+operator> (const multimap<Key, T, Compare, Allocator>& x,
+           const multimap<Key, T, Compare, Allocator>& y);
+
+template <class Key, class T, class Compare, class Allocator>
+bool
+operator>=(const multimap<Key, T, Compare, Allocator>& x,
+           const multimap<Key, T, Compare, Allocator>& y);
+
+template <class Key, class T, class Compare, class Allocator>
+bool
+operator<=(const multimap<Key, T, Compare, Allocator>& x,
+           const multimap<Key, T, Compare, Allocator>& y);
+
+// specialized algorithms:
+template <class Key, class T, class Compare, class Allocator>
+void
+swap(multimap<Key, T, Compare, Allocator>& x,
+     multimap<Key, T, Compare, Allocator>& y)
+    noexcept(noexcept(x.swap(y)));
+
+template <class Key, class T, class Compare, class Allocator, class Predicate>
+typename multimap<Key, T, Compare, Allocator>::size_type
+erase_if(multimap<Key, T, Compare, Allocator>& c, Predicate pred);  // C++20
+
+}  // std
+
+*/
+
+#include <__algorithm/equal.h>
+#include <__algorithm/lexicographical_compare.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__functional/binary_function.h>
+#include <__functional/is_transparent.h>
+#include <__functional/operations.h>
+#include <__iterator/erase_if_container.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/reverse_iterator.h>
+#include <__memory/allocator.h>
+#include <__memory_resource/polymorphic_allocator.h>
+#include <__node_handle>
+#include <__tree>
+#include <__type_traits/is_allocator.h>
+#include <__utility/forward.h>
+#include <__utility/piecewise_construct.h>
+#include <__utility/swap.h>
+#include <tuple>
+#include <type_traits>
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+// [associative.map.syn]
+#include <compare>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Key, class _CP, class _Compare,
+          bool = is_empty<_Compare>::value && !__libcpp_is_final<_Compare>::value>
+class __map_value_compare
+    : private _Compare
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __map_value_compare()
+        _NOEXCEPT_(is_nothrow_default_constructible<_Compare>::value)
+        : _Compare() {}
+    _LIBCPP_INLINE_VISIBILITY
+    __map_value_compare(_Compare __c)
+        _NOEXCEPT_(is_nothrow_copy_constructible<_Compare>::value)
+        : _Compare(__c) {}
+    _LIBCPP_INLINE_VISIBILITY
+    const _Compare& key_comp() const _NOEXCEPT {return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _CP& __x, const _CP& __y) const
+        {return static_cast<const _Compare&>(*this)(__x.__get_value().first, __y.__get_value().first);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _CP& __x, const _Key& __y) const
+        {return static_cast<const _Compare&>(*this)(__x.__get_value().first, __y);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Key& __x, const _CP& __y) const
+        {return static_cast<const _Compare&>(*this)(__x, __y.__get_value().first);}
+    void swap(__map_value_compare& __y)
+        _NOEXCEPT_(__is_nothrow_swappable<_Compare>::value)
+    {
+      using _VSTD::swap;
+      swap(static_cast<_Compare&>(*this), static_cast<_Compare&>(__y));
+    }
+
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _K2& __x, const _CP& __y) const
+        {return static_cast<const _Compare&>(*this)(__x, __y.__get_value().first);}
+
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _CP& __x, const _K2& __y) const
+        {return static_cast<const _Compare&>(*this)(__x.__get_value().first, __y);}
+#endif
+};
+
+template <class _Key, class _CP, class _Compare>
+class __map_value_compare<_Key, _CP, _Compare, false>
+{
+    _Compare __comp_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __map_value_compare()
+        _NOEXCEPT_(is_nothrow_default_constructible<_Compare>::value)
+        : __comp_() {}
+    _LIBCPP_INLINE_VISIBILITY
+    __map_value_compare(_Compare __c)
+        _NOEXCEPT_(is_nothrow_copy_constructible<_Compare>::value)
+        : __comp_(__c) {}
+    _LIBCPP_INLINE_VISIBILITY
+    const _Compare& key_comp() const _NOEXCEPT {return __comp_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _CP& __x, const _CP& __y) const
+        {return __comp_(__x.__get_value().first, __y.__get_value().first);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _CP& __x, const _Key& __y) const
+        {return __comp_(__x.__get_value().first, __y);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Key& __x, const _CP& __y) const
+        {return __comp_(__x, __y.__get_value().first);}
+    void swap(__map_value_compare& __y)
+        _NOEXCEPT_(__is_nothrow_swappable<_Compare>::value)
+    {
+        using _VSTD::swap;
+        swap(__comp_, __y.__comp_);
+    }
+
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _K2& __x, const _CP& __y) const
+        {return __comp_(__x, __y.__get_value().first);}
+
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _CP& __x, const _K2& __y) const
+        {return __comp_(__x.__get_value().first, __y);}
+#endif
+};
+
+template <class _Key, class _CP, class _Compare, bool __b>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(__map_value_compare<_Key, _CP, _Compare, __b>& __x,
+     __map_value_compare<_Key, _CP, _Compare, __b>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+template <class _Allocator>
+class __map_node_destructor
+{
+    typedef _Allocator                          allocator_type;
+    typedef allocator_traits<allocator_type>    __alloc_traits;
+
+public:
+    typedef typename __alloc_traits::pointer    pointer;
+
+private:
+    allocator_type& __na_;
+
+    __map_node_destructor& operator=(const __map_node_destructor&);
+
+public:
+    bool __first_constructed;
+    bool __second_constructed;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __map_node_destructor(allocator_type& __na) _NOEXCEPT
+        : __na_(__na),
+          __first_constructed(false),
+          __second_constructed(false)
+        {}
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    __map_node_destructor(__tree_node_destructor<allocator_type>&& __x) _NOEXCEPT
+        : __na_(__x.__na_),
+          __first_constructed(__x.__value_constructed),
+          __second_constructed(__x.__value_constructed)
+        {
+            __x.__value_constructed = false;
+        }
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator()(pointer __p) _NOEXCEPT
+    {
+        if (__second_constructed)
+            __alloc_traits::destroy(__na_, _VSTD::addressof(__p->__value_.__get_value().second));
+        if (__first_constructed)
+            __alloc_traits::destroy(__na_, _VSTD::addressof(__p->__value_.__get_value().first));
+        if (__p)
+            __alloc_traits::deallocate(__na_, __p, 1);
+    }
+};
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+    class map;
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+    class multimap;
+template <class _TreeIterator> class __map_const_iterator;
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Tp>
+struct _LIBCPP_STANDALONE_DEBUG __value_type
+{
+    typedef _Key                                     key_type;
+    typedef _Tp                                      mapped_type;
+    typedef pair<const key_type, mapped_type>        value_type;
+    typedef pair<key_type&, mapped_type&>            __nc_ref_pair_type;
+    typedef pair<key_type&&, mapped_type&&>          __nc_rref_pair_type;
+
+private:
+    value_type __cc_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    value_type& __get_value()
+    {
+#if _LIBCPP_STD_VER > 14
+        return *_VSTD::launder(_VSTD::addressof(__cc_));
+#else
+        return __cc_;
+#endif
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const value_type& __get_value() const
+    {
+#if _LIBCPP_STD_VER > 14
+        return *_VSTD::launder(_VSTD::addressof(__cc_));
+#else
+        return __cc_;
+#endif
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __nc_ref_pair_type __ref()
+    {
+        value_type& __v = __get_value();
+        return __nc_ref_pair_type(const_cast<key_type&>(__v.first), __v.second);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __nc_rref_pair_type __move()
+    {
+        value_type& __v = __get_value();
+        return __nc_rref_pair_type(
+            _VSTD::move(const_cast<key_type&>(__v.first)),
+            _VSTD::move(__v.second));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __value_type& operator=(const __value_type& __v)
+    {
+        __ref() = __v.__get_value();
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __value_type& operator=(__value_type&& __v)
+    {
+        __ref() = __v.__move();
+        return *this;
+    }
+
+    template <class _ValueTp,
+              class = __enable_if_t<__is_same_uncvref<_ValueTp, value_type>::value>
+             >
+    _LIBCPP_INLINE_VISIBILITY
+    __value_type& operator=(_ValueTp&& __v)
+    {
+        __ref() = _VSTD::forward<_ValueTp>(__v);
+        return *this;
+    }
+
+private:
+    __value_type() = delete;
+    ~__value_type() = delete;
+    __value_type(const __value_type&) = delete;
+    __value_type(__value_type&&) = delete;
+};
+
+#else
+
+template <class _Key, class _Tp>
+struct __value_type
+{
+    typedef _Key                                     key_type;
+    typedef _Tp                                      mapped_type;
+    typedef pair<const key_type, mapped_type>        value_type;
+
+private:
+    value_type __cc_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    value_type& __get_value() { return __cc_; }
+    _LIBCPP_INLINE_VISIBILITY
+    const value_type& __get_value() const { return __cc_; }
+
+private:
+   __value_type();
+   __value_type(__value_type const&);
+   __value_type& operator=(__value_type const&);
+   ~__value_type();
+};
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp>
+struct __extract_key_value_types;
+
+template <class _Key, class _Tp>
+struct __extract_key_value_types<__value_type<_Key, _Tp> >
+{
+  typedef _Key const __key_type;
+  typedef _Tp        __mapped_type;
+};
+
+template <class _TreeIterator>
+class _LIBCPP_TEMPLATE_VIS __map_iterator
+{
+    typedef typename _TreeIterator::_NodeTypes                   _NodeTypes;
+    typedef typename _TreeIterator::__pointer_traits             __pointer_traits;
+
+    _TreeIterator __i_;
+
+public:
+    typedef bidirectional_iterator_tag                           iterator_category;
+    typedef typename _NodeTypes::__map_value_type                value_type;
+    typedef typename _TreeIterator::difference_type              difference_type;
+    typedef value_type&                                          reference;
+    typedef typename _NodeTypes::__map_value_type_pointer        pointer;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __map_iterator() _NOEXCEPT {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __map_iterator(_TreeIterator __i) _NOEXCEPT : __i_(__i) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const {return __i_->__get_value();}
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const {return pointer_traits<pointer>::pointer_to(__i_->__get_value());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __map_iterator& operator++() {++__i_; return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    __map_iterator operator++(int)
+    {
+        __map_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __map_iterator& operator--() {--__i_; return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    __map_iterator operator--(int)
+    {
+        __map_iterator __t(*this);
+        --(*this);
+        return __t;
+    }
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const __map_iterator& __x, const __map_iterator& __y)
+        {return __x.__i_ == __y.__i_;}
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const __map_iterator& __x, const __map_iterator& __y)
+        {return __x.__i_ != __y.__i_;}
+
+    template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS map;
+    template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS multimap;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __map_const_iterator;
+};
+
+template <class _TreeIterator>
+class _LIBCPP_TEMPLATE_VIS __map_const_iterator
+{
+    typedef typename _TreeIterator::_NodeTypes                   _NodeTypes;
+    typedef typename _TreeIterator::__pointer_traits             __pointer_traits;
+
+    _TreeIterator __i_;
+
+public:
+    typedef bidirectional_iterator_tag                           iterator_category;
+    typedef typename _NodeTypes::__map_value_type                value_type;
+    typedef typename _TreeIterator::difference_type              difference_type;
+    typedef const value_type&                                    reference;
+    typedef typename _NodeTypes::__const_map_value_type_pointer  pointer;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __map_const_iterator() _NOEXCEPT {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __map_const_iterator(_TreeIterator __i) _NOEXCEPT : __i_(__i) {}
+    _LIBCPP_INLINE_VISIBILITY
+    __map_const_iterator(__map_iterator<
+        typename _TreeIterator::__non_const_iterator> __i) _NOEXCEPT
+        : __i_(__i.__i_) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const {return __i_->__get_value();}
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const {return pointer_traits<pointer>::pointer_to(__i_->__get_value());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __map_const_iterator& operator++() {++__i_; return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    __map_const_iterator operator++(int)
+    {
+        __map_const_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __map_const_iterator& operator--() {--__i_; return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    __map_const_iterator operator--(int)
+    {
+        __map_const_iterator __t(*this);
+        --(*this);
+        return __t;
+    }
+
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const __map_const_iterator& __x, const __map_const_iterator& __y)
+        {return __x.__i_ == __y.__i_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const __map_const_iterator& __x, const __map_const_iterator& __y)
+        {return __x.__i_ != __y.__i_;}
+
+    template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS map;
+    template <class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS multimap;
+    template <class, class, class> friend class _LIBCPP_TEMPLATE_VIS __tree_const_iterator;
+};
+
+template <class _Key, class _Tp, class _Compare = less<_Key>,
+          class _Allocator = allocator<pair<const _Key, _Tp> > >
+class _LIBCPP_TEMPLATE_VIS map
+{
+public:
+    // types:
+    typedef _Key                                     key_type;
+    typedef _Tp                                      mapped_type;
+    typedef pair<const key_type, mapped_type>        value_type;
+    typedef __type_identity_t<_Compare>              key_compare;
+    typedef __type_identity_t<_Allocator>            allocator_type;
+    typedef value_type&                              reference;
+    typedef const value_type&                        const_reference;
+
+    static_assert((is_same<typename allocator_type::value_type, value_type>::value),
+                  "Allocator::value_type must be same type as value_type");
+
+    class _LIBCPP_TEMPLATE_VIS value_compare
+        : public __binary_function<value_type, value_type, bool>
+    {
+        friend class map;
+    protected:
+        key_compare comp;
+
+        _LIBCPP_INLINE_VISIBILITY value_compare(key_compare __c) : comp(__c) {}
+    public:
+        _LIBCPP_INLINE_VISIBILITY
+        bool operator()(const value_type& __x, const value_type& __y) const
+            {return comp(__x.first, __y.first);}
+    };
+
+private:
+
+    typedef _VSTD::__value_type<key_type, mapped_type>             __value_type;
+    typedef __map_value_compare<key_type, __value_type, key_compare> __vc;
+    typedef __rebind_alloc<allocator_traits<allocator_type>, __value_type> __allocator_type;
+    typedef __tree<__value_type, __vc, __allocator_type>   __base;
+    typedef typename __base::__node_traits                 __node_traits;
+    typedef allocator_traits<allocator_type>               __alloc_traits;
+
+    static_assert(is_same<allocator_type, __rebind_alloc<__alloc_traits, value_type> >::value,
+                  "[allocator.requirements] states that rebinding an allocator to the same type should result in the "
+                  "original allocator");
+
+    __base __tree_;
+
+public:
+    typedef typename __alloc_traits::pointer               pointer;
+    typedef typename __alloc_traits::const_pointer         const_pointer;
+    typedef typename __alloc_traits::size_type             size_type;
+    typedef typename __alloc_traits::difference_type       difference_type;
+    typedef __map_iterator<typename __base::iterator>             iterator;
+    typedef __map_const_iterator<typename __base::const_iterator> const_iterator;
+    typedef _VSTD::reverse_iterator<iterator>               reverse_iterator;
+    typedef _VSTD::reverse_iterator<const_iterator>         const_reverse_iterator;
+
+#if _LIBCPP_STD_VER > 14
+    typedef __map_node_handle<typename __base::__node, allocator_type> node_type;
+    typedef __insert_return_type<iterator, node_type> insert_return_type;
+#endif
+
+    template <class _Key2, class _Value2, class _Comp2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS map;
+    template <class _Key2, class _Value2, class _Comp2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS multimap;
+
+    _LIBCPP_INLINE_VISIBILITY
+    map()
+        _NOEXCEPT_(
+            is_nothrow_default_constructible<allocator_type>::value &&
+            is_nothrow_default_constructible<key_compare>::value &&
+            is_nothrow_copy_constructible<key_compare>::value)
+        : __tree_(__vc(key_compare())) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit map(const key_compare& __comp)
+        _NOEXCEPT_(
+            is_nothrow_default_constructible<allocator_type>::value &&
+            is_nothrow_copy_constructible<key_compare>::value)
+        : __tree_(__vc(__comp)) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit map(const key_compare& __comp, const allocator_type& __a)
+        : __tree_(__vc(__comp), typename __base::allocator_type(__a)) {}
+
+    template <class _InputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+        map(_InputIterator __f, _InputIterator __l,
+            const key_compare& __comp = key_compare())
+        : __tree_(__vc(__comp))
+        {
+            insert(__f, __l);
+        }
+
+    template <class _InputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+        map(_InputIterator __f, _InputIterator __l,
+            const key_compare& __comp, const allocator_type& __a)
+        : __tree_(__vc(__comp), typename __base::allocator_type(__a))
+        {
+            insert(__f, __l);
+        }
+
+#if _LIBCPP_STD_VER > 11
+    template <class _InputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+    map(_InputIterator __f, _InputIterator __l, const allocator_type& __a)
+        : map(__f, __l, key_compare(), __a) {}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    map(const map& __m)
+        : __tree_(__m.__tree_)
+        {
+            insert(__m.begin(), __m.end());
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    map& operator=(const map& __m)
+        {
+#ifndef _LIBCPP_CXX03_LANG
+            __tree_ = __m.__tree_;
+#else
+            if (this != _VSTD::addressof(__m)) {
+                __tree_.clear();
+                __tree_.value_comp() = __m.__tree_.value_comp();
+                __tree_.__copy_assign_alloc(__m.__tree_);
+                insert(__m.begin(), __m.end());
+            }
+#endif
+            return *this;
+        }
+
+#ifndef _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    map(map&& __m)
+        _NOEXCEPT_(is_nothrow_move_constructible<__base>::value)
+        : __tree_(_VSTD::move(__m.__tree_))
+        {
+        }
+
+    map(map&& __m, const allocator_type& __a);
+
+    _LIBCPP_INLINE_VISIBILITY
+    map& operator=(map&& __m)
+        _NOEXCEPT_(is_nothrow_move_assignable<__base>::value)
+        {
+            __tree_ = _VSTD::move(__m.__tree_);
+            return *this;
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    map(initializer_list<value_type> __il, const key_compare& __comp = key_compare())
+        : __tree_(__vc(__comp))
+        {
+            insert(__il.begin(), __il.end());
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    map(initializer_list<value_type> __il, const key_compare& __comp, const allocator_type& __a)
+        : __tree_(__vc(__comp), typename __base::allocator_type(__a))
+        {
+            insert(__il.begin(), __il.end());
+        }
+
+#if _LIBCPP_STD_VER > 11
+    _LIBCPP_INLINE_VISIBILITY
+    map(initializer_list<value_type> __il, const allocator_type& __a)
+        : map(__il, key_compare(), __a) {}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    map& operator=(initializer_list<value_type> __il)
+        {
+            __tree_.__assign_unique(__il.begin(), __il.end());
+            return *this;
+        }
+
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit map(const allocator_type& __a)
+        : __tree_(typename __base::allocator_type(__a))
+        {
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    map(const map& __m, const allocator_type& __a)
+        : __tree_(__m.__tree_.value_comp(), typename __base::allocator_type(__a))
+        {
+            insert(__m.begin(), __m.end());
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~map() {
+        static_assert(sizeof(__diagnose_non_const_comparator<_Key, _Compare>()), "");
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+          iterator begin() _NOEXCEPT {return __tree_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+          iterator end() _NOEXCEPT {return __tree_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end() const _NOEXCEPT {return __tree_.end();}
+
+    _LIBCPP_INLINE_VISIBILITY
+          reverse_iterator rbegin() _NOEXCEPT {return reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator rbegin() const _NOEXCEPT
+        {return const_reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY
+          reverse_iterator rend() _NOEXCEPT
+            {return       reverse_iterator(begin());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator rend() const _NOEXCEPT
+        {return const_reverse_iterator(begin());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbegin() const _NOEXCEPT {return begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cend() const _NOEXCEPT {return end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator crend() const _NOEXCEPT {return rend();}
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool      empty() const _NOEXCEPT {return __tree_.size() == 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const _NOEXCEPT {return __tree_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT {return __tree_.max_size();}
+
+    mapped_type& operator[](const key_type& __k);
+#ifndef _LIBCPP_CXX03_LANG
+    mapped_type& operator[](key_type&& __k);
+#endif
+
+          mapped_type& at(const key_type& __k);
+    const mapped_type& at(const key_type& __k) const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const _NOEXCEPT {return allocator_type(__tree_.__alloc());}
+    _LIBCPP_INLINE_VISIBILITY
+    key_compare    key_comp()      const {return __tree_.value_comp().key_comp();}
+    _LIBCPP_INLINE_VISIBILITY
+    value_compare  value_comp()    const {return value_compare(__tree_.value_comp().key_comp());}
+
+#ifndef _LIBCPP_CXX03_LANG
+    template <class ..._Args>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> emplace(_Args&& ...__args) {
+        return __tree_.__emplace_unique(_VSTD::forward<_Args>(__args)...);
+    }
+
+    template <class ..._Args>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator emplace_hint(const_iterator __p, _Args&& ...__args) {
+        return __tree_.__emplace_hint_unique(__p.__i_, _VSTD::forward<_Args>(__args)...);
+    }
+
+    template <class _Pp,
+              class = __enable_if_t<is_constructible<value_type, _Pp>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        pair<iterator, bool> insert(_Pp&& __p)
+            {return __tree_.__insert_unique(_VSTD::forward<_Pp>(__p));}
+
+    template <class _Pp,
+              class = __enable_if_t<is_constructible<value_type, _Pp>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        iterator insert(const_iterator __pos, _Pp&& __p)
+            {return __tree_.__insert_unique(__pos.__i_, _VSTD::forward<_Pp>(__p));}
+
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool>
+        insert(const value_type& __v) {return __tree_.__insert_unique(__v);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator
+        insert(const_iterator __p, const value_type& __v)
+            {return __tree_.__insert_unique(__p.__i_, __v);}
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool>
+    insert(value_type&& __v) {return __tree_.__insert_unique(_VSTD::move(__v));}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p,  value_type&& __v)
+    {return __tree_.__insert_unique(__p.__i_, _VSTD::move(__v));}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void insert(initializer_list<value_type> __il)
+        {insert(__il.begin(), __il.end());}
+#endif
+
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        void insert(_InputIterator __f, _InputIterator __l)
+        {
+            for (const_iterator __e = cend(); __f != __l; ++__f)
+                insert(__e.__i_, *__f);
+        }
+
+#if _LIBCPP_STD_VER > 14
+
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        pair<iterator, bool> try_emplace(const key_type& __k, _Args&&... __args)
+    {
+        return __tree_.__emplace_unique_key_args(__k,
+            _VSTD::piecewise_construct,
+            _VSTD::forward_as_tuple(__k),
+            _VSTD::forward_as_tuple(_VSTD::forward<_Args>(__args)...));
+    }
+
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        pair<iterator, bool> try_emplace(key_type&& __k, _Args&&... __args)
+    {
+        return __tree_.__emplace_unique_key_args(__k,
+            _VSTD::piecewise_construct,
+            _VSTD::forward_as_tuple(_VSTD::move(__k)),
+            _VSTD::forward_as_tuple(_VSTD::forward<_Args>(__args)...));
+    }
+
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
+    {
+        return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
+            _VSTD::piecewise_construct,
+            _VSTD::forward_as_tuple(__k),
+            _VSTD::forward_as_tuple(_VSTD::forward<_Args>(__args)...)).first;
+    }
+
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args)
+    {
+        return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
+            _VSTD::piecewise_construct,
+            _VSTD::forward_as_tuple(_VSTD::move(__k)),
+            _VSTD::forward_as_tuple(_VSTD::forward<_Args>(__args)...)).first;
+    }
+
+    template <class _Vp>
+        _LIBCPP_INLINE_VISIBILITY
+        pair<iterator, bool> insert_or_assign(const key_type& __k, _Vp&& __v)
+    {
+        iterator __p = lower_bound(__k);
+        if ( __p != end() && !key_comp()(__k, __p->first))
+        {
+            __p->second = _VSTD::forward<_Vp>(__v);
+            return _VSTD::make_pair(__p, false);
+        }
+        return _VSTD::make_pair(emplace_hint(__p, __k, _VSTD::forward<_Vp>(__v)), true);
+    }
+
+    template <class _Vp>
+        _LIBCPP_INLINE_VISIBILITY
+        pair<iterator, bool> insert_or_assign(key_type&& __k, _Vp&& __v)
+    {
+        iterator __p = lower_bound(__k);
+        if ( __p != end() && !key_comp()(__k, __p->first))
+        {
+            __p->second = _VSTD::forward<_Vp>(__v);
+            return _VSTD::make_pair(__p, false);
+        }
+        return _VSTD::make_pair(emplace_hint(__p, _VSTD::move(__k), _VSTD::forward<_Vp>(__v)), true);
+    }
+
+    template <class _Vp>
+    _LIBCPP_INLINE_VISIBILITY iterator insert_or_assign(const_iterator __h,
+                                                        const key_type& __k,
+                                                        _Vp&& __v) {
+      auto [__r, __inserted] = __tree_.__emplace_hint_unique_key_args(
+          __h.__i_, __k, __k, _VSTD::forward<_Vp>(__v));
+
+      if (!__inserted)
+        __r->__get_value().second = _VSTD::forward<_Vp>(__v);
+
+      return __r;
+    }
+
+    template <class _Vp>
+    _LIBCPP_INLINE_VISIBILITY iterator insert_or_assign(const_iterator __h,
+                                                        key_type&& __k,
+                                                        _Vp&& __v) {
+      auto [__r, __inserted] = __tree_.__emplace_hint_unique_key_args(
+          __h.__i_, __k, _VSTD::move(__k), _VSTD::forward<_Vp>(__v));
+
+      if (!__inserted)
+        __r->__get_value().second = _VSTD::forward<_Vp>(__v);
+
+      return __r;
+    }
+
+#endif // _LIBCPP_STD_VER > 14
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(const_iterator __p) {return __tree_.erase(__p.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(iterator __p)       {return __tree_.erase(__p.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type erase(const key_type& __k)
+        {return __tree_.__erase_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator  erase(const_iterator __f, const_iterator __l)
+        {return __tree_.erase(__f.__i_, __l.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() _NOEXCEPT {__tree_.clear();}
+
+#if _LIBCPP_STD_VER > 14
+    _LIBCPP_INLINE_VISIBILITY
+    insert_return_type insert(node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to map::insert()");
+        return __tree_.template __node_handle_insert_unique<
+            node_type, insert_return_type>(_VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __hint, node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to map::insert()");
+        return __tree_.template __node_handle_insert_unique<node_type>(
+            __hint.__i_, _VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(key_type const& __key)
+    {
+        return __tree_.template __node_handle_extract<node_type>(__key);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(const_iterator __it)
+    {
+        return __tree_.template __node_handle_extract<node_type>(__it.__i_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(map<key_type, mapped_type, _Compare2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __tree_.__node_handle_merge_unique(__source.__tree_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(map<key_type, mapped_type, _Compare2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __tree_.__node_handle_merge_unique(__source.__tree_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(multimap<key_type, mapped_type, _Compare2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __tree_.__node_handle_merge_unique(__source.__tree_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(multimap<key_type, mapped_type, _Compare2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __tree_.__node_handle_merge_unique(__source.__tree_);
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(map& __m)
+        _NOEXCEPT_(__is_nothrow_swappable<__base>::value)
+        {__tree_.swap(__m.__tree_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator find(const key_type& __k)             {return __tree_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, iterator>
+    find(const _K2& __k)                           {return __tree_.find(__k);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, const_iterator>
+    find(const _K2& __k) const                     {return __tree_.find(__k);}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type      count(const key_type& __k) const
+        {return __tree_.__count_unique(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, size_type>
+    count(const _K2& __k) const {return __tree_.__count_multi(__k);}
+#endif
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY
+    bool contains(const key_type& __k) const {return find(__k) != end();}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, bool>
+    contains(const _K2& __k) const { return find(__k) != end(); }
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator lower_bound(const key_type& __k)
+        {return __tree_.lower_bound(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator lower_bound(const key_type& __k) const
+        {return __tree_.lower_bound(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, iterator>
+    lower_bound(const _K2& __k)       {return __tree_.lower_bound(__k);}
+
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, const_iterator>
+    lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator upper_bound(const key_type& __k)
+        {return __tree_.upper_bound(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator upper_bound(const key_type& __k) const
+        {return __tree_.upper_bound(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, iterator>
+    upper_bound(const _K2& __k)       {return __tree_.upper_bound(__k);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, const_iterator>
+    upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator,iterator> equal_range(const key_type& __k)
+        {return __tree_.__equal_range_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
+        {return __tree_.__equal_range_unique(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, pair<iterator,iterator>>
+    equal_range(const _K2& __k)       {return __tree_.__equal_range_multi(__k);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, pair<const_iterator,const_iterator>>
+    equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}
+#endif
+
+private:
+    typedef typename __base::__node                    __node;
+    typedef typename __base::__node_allocator          __node_allocator;
+    typedef typename __base::__node_pointer            __node_pointer;
+    typedef typename __base::__node_base_pointer       __node_base_pointer;
+    typedef typename __base::__parent_pointer          __parent_pointer;
+
+    typedef __map_node_destructor<__node_allocator> _Dp;
+    typedef unique_ptr<__node, _Dp> __node_holder;
+
+#ifdef _LIBCPP_CXX03_LANG
+    __node_holder __construct_node_with_key(const key_type& __k);
+#endif
+};
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator, class _Compare = less<__iter_key_type<_InputIterator>>,
+         class _Allocator = allocator<__iter_to_alloc_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value, void>,
+         class = enable_if_t<!__is_allocator<_Compare>::value, void>,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+map(_InputIterator, _InputIterator, _Compare = _Compare(), _Allocator = _Allocator())
+  -> map<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>, _Compare, _Allocator>;
+
+template<class _Key, class _Tp, class _Compare = less<remove_const_t<_Key>>,
+         class _Allocator = allocator<pair<const _Key, _Tp>>,
+         class = enable_if_t<!__is_allocator<_Compare>::value, void>,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+map(initializer_list<pair<_Key, _Tp>>, _Compare = _Compare(), _Allocator = _Allocator())
+  -> map<remove_const_t<_Key>, _Tp, _Compare, _Allocator>;
+
+template<class _InputIterator, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value, void>,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+map(_InputIterator, _InputIterator, _Allocator)
+  -> map<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>,
+         less<__iter_key_type<_InputIterator>>, _Allocator>;
+
+template<class _Key, class _Tp, class _Allocator,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+map(initializer_list<pair<_Key, _Tp>>, _Allocator)
+  -> map<remove_const_t<_Key>, _Tp, less<remove_const_t<_Key>>, _Allocator>;
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+map<_Key, _Tp, _Compare, _Allocator>::map(map&& __m, const allocator_type& __a)
+    : __tree_(_VSTD::move(__m.__tree_), typename __base::allocator_type(__a))
+{
+    if (__a != __m.get_allocator())
+    {
+        const_iterator __e = cend();
+        while (!__m.empty())
+            __tree_.__insert_unique(__e.__i_,
+                    __m.__tree_.remove(__m.begin().__i_)->__value_.__move());
+    }
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+_Tp&
+map<_Key, _Tp, _Compare, _Allocator>::operator[](const key_type& __k)
+{
+    return __tree_.__emplace_unique_key_args(__k,
+        _VSTD::piecewise_construct,
+        _VSTD::forward_as_tuple(__k),
+        _VSTD::forward_as_tuple()).first->__get_value().second;
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+_Tp&
+map<_Key, _Tp, _Compare, _Allocator>::operator[](key_type&& __k)
+{
+    return __tree_.__emplace_unique_key_args(__k,
+        _VSTD::piecewise_construct,
+        _VSTD::forward_as_tuple(_VSTD::move(__k)),
+        _VSTD::forward_as_tuple()).first->__get_value().second;
+}
+
+#else // _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+typename map<_Key, _Tp, _Compare, _Allocator>::__node_holder
+map<_Key, _Tp, _Compare, _Allocator>::__construct_node_with_key(const key_type& __k)
+{
+    __node_allocator& __na = __tree_.__node_alloc();
+    __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
+    __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__get_value().first), __k);
+    __h.get_deleter().__first_constructed = true;
+    __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__get_value().second));
+    __h.get_deleter().__second_constructed = true;
+    return __h;
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+_Tp&
+map<_Key, _Tp, _Compare, _Allocator>::operator[](const key_type& __k)
+{
+    __parent_pointer __parent;
+    __node_base_pointer& __child = __tree_.__find_equal(__parent, __k);
+    __node_pointer __r = static_cast<__node_pointer>(__child);
+    if (__child == nullptr)
+    {
+        __node_holder __h = __construct_node_with_key(__k);
+        __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
+        __r = __h.release();
+    }
+    return __r->__value_.__get_value().second;
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+_Tp&
+map<_Key, _Tp, _Compare, _Allocator>::at(const key_type& __k)
+{
+    __parent_pointer __parent;
+    __node_base_pointer& __child = __tree_.__find_equal(__parent, __k);
+    if (__child == nullptr)
+        __throw_out_of_range("map::at:  key not found");
+    return static_cast<__node_pointer>(__child)->__value_.__get_value().second;
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+const _Tp&
+map<_Key, _Tp, _Compare, _Allocator>::at(const key_type& __k) const
+{
+    __parent_pointer __parent;
+    __node_base_pointer __child = __tree_.__find_equal(__parent, __k);
+    if (__child == nullptr)
+        __throw_out_of_range("map::at:  key not found");
+    return static_cast<__node_pointer>(__child)->__value_.__get_value().second;
+}
+
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const map<_Key, _Tp, _Compare, _Allocator>& __x,
+           const map<_Key, _Tp, _Compare, _Allocator>& __y)
+{
+    return __x.size() == __y.size() && _VSTD::equal(__x.begin(), __x.end(), __y.begin());
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator< (const map<_Key, _Tp, _Compare, _Allocator>& __x,
+           const map<_Key, _Tp, _Compare, _Allocator>& __y)
+{
+    return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const map<_Key, _Tp, _Compare, _Allocator>& __x,
+           const map<_Key, _Tp, _Compare, _Allocator>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator> (const map<_Key, _Tp, _Compare, _Allocator>& __x,
+           const map<_Key, _Tp, _Compare, _Allocator>& __y)
+{
+    return __y < __x;
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const map<_Key, _Tp, _Compare, _Allocator>& __x,
+           const map<_Key, _Tp, _Compare, _Allocator>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const map<_Key, _Tp, _Compare, _Allocator>& __x,
+           const map<_Key, _Tp, _Compare, _Allocator>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(map<_Key, _Tp, _Compare, _Allocator>& __x,
+     map<_Key, _Tp, _Compare, _Allocator>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Key, class _Tp, class _Compare, class _Allocator,
+          class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY
+    typename map<_Key, _Tp, _Compare, _Allocator>::size_type
+    erase_if(map<_Key, _Tp, _Compare, _Allocator>& __c, _Predicate __pred) {
+  return _VSTD::__libcpp_erase_if_container(__c, __pred);
+}
+#endif
+
+
+template <class _Key, class _Tp, class _Compare = less<_Key>,
+          class _Allocator = allocator<pair<const _Key, _Tp> > >
+class _LIBCPP_TEMPLATE_VIS multimap
+{
+public:
+    // types:
+    typedef _Key                                     key_type;
+    typedef _Tp                                      mapped_type;
+    typedef pair<const key_type, mapped_type>        value_type;
+    typedef __type_identity_t<_Compare>              key_compare;
+    typedef __type_identity_t<_Allocator>            allocator_type;
+    typedef value_type&                              reference;
+    typedef const value_type&                        const_reference;
+
+    static_assert((is_same<typename allocator_type::value_type, value_type>::value),
+                  "Allocator::value_type must be same type as value_type");
+
+    class _LIBCPP_TEMPLATE_VIS value_compare
+        : public __binary_function<value_type, value_type, bool>
+    {
+        friend class multimap;
+    protected:
+        key_compare comp;
+
+        _LIBCPP_INLINE_VISIBILITY
+        value_compare(key_compare __c) : comp(__c) {}
+    public:
+        _LIBCPP_INLINE_VISIBILITY
+        bool operator()(const value_type& __x, const value_type& __y) const
+            {return comp(__x.first, __y.first);}
+    };
+
+private:
+
+    typedef _VSTD::__value_type<key_type, mapped_type>             __value_type;
+    typedef __map_value_compare<key_type, __value_type, key_compare> __vc;
+    typedef __rebind_alloc<allocator_traits<allocator_type>, __value_type> __allocator_type;
+    typedef __tree<__value_type, __vc, __allocator_type>            __base;
+    typedef typename __base::__node_traits                          __node_traits;
+    typedef allocator_traits<allocator_type>                        __alloc_traits;
+
+    static_assert(is_same<allocator_type, __rebind_alloc<__alloc_traits, value_type> >::value,
+                  "[allocator.requirements] states that rebinding an allocator to the same type should result in the "
+                  "original allocator");
+
+    __base __tree_;
+
+public:
+    typedef typename __alloc_traits::pointer               pointer;
+    typedef typename __alloc_traits::const_pointer         const_pointer;
+    typedef typename __alloc_traits::size_type             size_type;
+    typedef typename __alloc_traits::difference_type       difference_type;
+    typedef __map_iterator<typename __base::iterator>      iterator;
+    typedef __map_const_iterator<typename __base::const_iterator> const_iterator;
+    typedef _VSTD::reverse_iterator<iterator>               reverse_iterator;
+    typedef _VSTD::reverse_iterator<const_iterator>         const_reverse_iterator;
+
+#if _LIBCPP_STD_VER > 14
+    typedef __map_node_handle<typename __base::__node, allocator_type> node_type;
+#endif
+
+    template <class _Key2, class _Value2, class _Comp2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS map;
+    template <class _Key2, class _Value2, class _Comp2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS multimap;
+
+    _LIBCPP_INLINE_VISIBILITY
+    multimap()
+        _NOEXCEPT_(
+            is_nothrow_default_constructible<allocator_type>::value &&
+            is_nothrow_default_constructible<key_compare>::value &&
+            is_nothrow_copy_constructible<key_compare>::value)
+        : __tree_(__vc(key_compare())) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit multimap(const key_compare& __comp)
+        _NOEXCEPT_(
+            is_nothrow_default_constructible<allocator_type>::value &&
+            is_nothrow_copy_constructible<key_compare>::value)
+        : __tree_(__vc(__comp)) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit multimap(const key_compare& __comp, const allocator_type& __a)
+        : __tree_(__vc(__comp), typename __base::allocator_type(__a)) {}
+
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        multimap(_InputIterator __f, _InputIterator __l,
+            const key_compare& __comp = key_compare())
+        : __tree_(__vc(__comp))
+        {
+            insert(__f, __l);
+        }
+
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        multimap(_InputIterator __f, _InputIterator __l,
+            const key_compare& __comp, const allocator_type& __a)
+        : __tree_(__vc(__comp), typename __base::allocator_type(__a))
+        {
+            insert(__f, __l);
+        }
+
+#if _LIBCPP_STD_VER > 11
+    template <class _InputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+    multimap(_InputIterator __f, _InputIterator __l, const allocator_type& __a)
+        : multimap(__f, __l, key_compare(), __a) {}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    multimap(const multimap& __m)
+        : __tree_(__m.__tree_.value_comp(),
+          __alloc_traits::select_on_container_copy_construction(__m.__tree_.__alloc()))
+        {
+            insert(__m.begin(), __m.end());
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    multimap& operator=(const multimap& __m)
+        {
+#ifndef _LIBCPP_CXX03_LANG
+            __tree_ = __m.__tree_;
+#else
+            if (this != _VSTD::addressof(__m)) {
+                __tree_.clear();
+                __tree_.value_comp() = __m.__tree_.value_comp();
+                __tree_.__copy_assign_alloc(__m.__tree_);
+                insert(__m.begin(), __m.end());
+            }
+#endif
+            return *this;
+        }
+
+#ifndef _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    multimap(multimap&& __m)
+        _NOEXCEPT_(is_nothrow_move_constructible<__base>::value)
+        : __tree_(_VSTD::move(__m.__tree_))
+        {
+        }
+
+    multimap(multimap&& __m, const allocator_type& __a);
+
+    _LIBCPP_INLINE_VISIBILITY
+    multimap& operator=(multimap&& __m)
+        _NOEXCEPT_(is_nothrow_move_assignable<__base>::value)
+        {
+            __tree_ = _VSTD::move(__m.__tree_);
+            return *this;
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    multimap(initializer_list<value_type> __il, const key_compare& __comp = key_compare())
+        : __tree_(__vc(__comp))
+        {
+            insert(__il.begin(), __il.end());
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    multimap(initializer_list<value_type> __il, const key_compare& __comp, const allocator_type& __a)
+        : __tree_(__vc(__comp), typename __base::allocator_type(__a))
+        {
+            insert(__il.begin(), __il.end());
+        }
+
+#if _LIBCPP_STD_VER > 11
+    _LIBCPP_INLINE_VISIBILITY
+    multimap(initializer_list<value_type> __il, const allocator_type& __a)
+        : multimap(__il, key_compare(), __a) {}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    multimap& operator=(initializer_list<value_type> __il)
+        {
+            __tree_.__assign_multi(__il.begin(), __il.end());
+            return *this;
+        }
+
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit multimap(const allocator_type& __a)
+        : __tree_(typename __base::allocator_type(__a))
+        {
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    multimap(const multimap& __m, const allocator_type& __a)
+        : __tree_(__m.__tree_.value_comp(), typename __base::allocator_type(__a))
+        {
+            insert(__m.begin(), __m.end());
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~multimap() {
+        static_assert(sizeof(__diagnose_non_const_comparator<_Key, _Compare>()), "");
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+          iterator begin() _NOEXCEPT {return __tree_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+          iterator end() _NOEXCEPT {return __tree_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end() const _NOEXCEPT {return __tree_.end();}
+
+    _LIBCPP_INLINE_VISIBILITY
+          reverse_iterator rbegin() _NOEXCEPT {return reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator rbegin() const _NOEXCEPT
+        {return const_reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY
+          reverse_iterator rend() _NOEXCEPT {return reverse_iterator(begin());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator rend() const _NOEXCEPT
+        {return const_reverse_iterator(begin());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbegin()  const _NOEXCEPT {return begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cend() const _NOEXCEPT {return end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator crend() const _NOEXCEPT {return rend();}
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool empty() const _NOEXCEPT {return __tree_.size() == 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const _NOEXCEPT {return __tree_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT {return __tree_.max_size();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const _NOEXCEPT {return allocator_type(__tree_.__alloc());}
+    _LIBCPP_INLINE_VISIBILITY
+    key_compare    key_comp() const {return __tree_.value_comp().key_comp();}
+    _LIBCPP_INLINE_VISIBILITY
+    value_compare  value_comp() const
+        {return value_compare(__tree_.value_comp().key_comp());}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+    template <class ..._Args>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator emplace(_Args&& ...__args) {
+        return __tree_.__emplace_multi(_VSTD::forward<_Args>(__args)...);
+    }
+
+    template <class ..._Args>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator emplace_hint(const_iterator __p, _Args&& ...__args) {
+        return __tree_.__emplace_hint_multi(__p.__i_, _VSTD::forward<_Args>(__args)...);
+    }
+
+    template <class _Pp,
+              class = __enable_if_t<is_constructible<value_type, _Pp>::value>>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator insert(_Pp&& __p)
+            {return __tree_.__insert_multi(_VSTD::forward<_Pp>(__p));}
+
+    template <class _Pp,
+              class = __enable_if_t<is_constructible<value_type, _Pp>::value>>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator insert(const_iterator __pos, _Pp&& __p)
+            {return __tree_.__insert_multi(__pos.__i_, _VSTD::forward<_Pp>(__p));}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(value_type&& __v)
+        {return __tree_.__insert_multi(_VSTD::move(__v));}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, value_type&& __v)
+        {return __tree_.__insert_multi(__p.__i_, _VSTD::move(__v));}
+
+
+    _LIBCPP_INLINE_VISIBILITY
+    void insert(initializer_list<value_type> __il)
+        {insert(__il.begin(), __il.end());}
+
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const value_type& __v) {return __tree_.__insert_multi(__v);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, const value_type& __v)
+            {return __tree_.__insert_multi(__p.__i_, __v);}
+
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        void insert(_InputIterator __f, _InputIterator __l)
+        {
+            for (const_iterator __e = cend(); __f != __l; ++__f)
+                __tree_.__insert_multi(__e.__i_, *__f);
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(const_iterator __p) {return __tree_.erase(__p.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(iterator __p)       {return __tree_.erase(__p.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type erase(const key_type& __k) {return __tree_.__erase_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator  erase(const_iterator __f, const_iterator __l)
+        {return __tree_.erase(__f.__i_, __l.__i_);}
+
+#if _LIBCPP_STD_VER > 14
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to multimap::insert()");
+        return __tree_.template __node_handle_insert_multi<node_type>(
+            _VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __hint, node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to multimap::insert()");
+        return __tree_.template __node_handle_insert_multi<node_type>(
+            __hint.__i_, _VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(key_type const& __key)
+    {
+        return __tree_.template __node_handle_extract<node_type>(__key);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(const_iterator __it)
+    {
+        return __tree_.template __node_handle_extract<node_type>(
+            __it.__i_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(multimap<key_type, mapped_type, _Compare2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __tree_.__node_handle_merge_multi(__source.__tree_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(multimap<key_type, mapped_type, _Compare2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __tree_.__node_handle_merge_multi(__source.__tree_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(map<key_type, mapped_type, _Compare2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __tree_.__node_handle_merge_multi(__source.__tree_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(map<key_type, mapped_type, _Compare2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __tree_.__node_handle_merge_multi(__source.__tree_);
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() _NOEXCEPT {__tree_.clear();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(multimap& __m)
+        _NOEXCEPT_(__is_nothrow_swappable<__base>::value)
+        {__tree_.swap(__m.__tree_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator find(const key_type& __k)             {return __tree_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, iterator>
+    find(const _K2& __k)                           {return __tree_.find(__k);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, const_iterator>
+    find(const _K2& __k) const                     {return __tree_.find(__k);}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type      count(const key_type& __k) const
+        {return __tree_.__count_multi(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, size_type>
+    count(const _K2& __k) const {return __tree_.__count_multi(__k);}
+#endif
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY
+    bool contains(const key_type& __k) const {return find(__k) != end();}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, bool>
+    contains(const _K2& __k) const { return find(__k) != end(); }
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator lower_bound(const key_type& __k)
+        {return __tree_.lower_bound(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator lower_bound(const key_type& __k) const
+            {return __tree_.lower_bound(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, iterator>
+    lower_bound(const _K2& __k)       {return __tree_.lower_bound(__k);}
+
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, const_iterator>
+    lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator upper_bound(const key_type& __k)
+            {return __tree_.upper_bound(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator upper_bound(const key_type& __k) const
+            {return __tree_.upper_bound(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, iterator>
+    upper_bound(const _K2& __k)       {return __tree_.upper_bound(__k);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, const_iterator>
+    upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator,iterator>             equal_range(const key_type& __k)
+            {return __tree_.__equal_range_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
+            {return __tree_.__equal_range_multi(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, pair<iterator,iterator>>
+    equal_range(const _K2& __k)       {return __tree_.__equal_range_multi(__k);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    __enable_if_t<__is_transparent<_Compare, _K2>::value, pair<const_iterator,const_iterator>>
+    equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}
+#endif
+
+private:
+    typedef typename __base::__node                    __node;
+    typedef typename __base::__node_allocator          __node_allocator;
+    typedef typename __base::__node_pointer            __node_pointer;
+
+    typedef __map_node_destructor<__node_allocator> _Dp;
+    typedef unique_ptr<__node, _Dp> __node_holder;
+};
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator, class _Compare = less<__iter_key_type<_InputIterator>>,
+         class _Allocator = allocator<__iter_to_alloc_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value, void>,
+         class = enable_if_t<!__is_allocator<_Compare>::value, void>,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+multimap(_InputIterator, _InputIterator, _Compare = _Compare(), _Allocator = _Allocator())
+  -> multimap<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>, _Compare, _Allocator>;
+
+template<class _Key, class _Tp, class _Compare = less<remove_const_t<_Key>>,
+         class _Allocator = allocator<pair<const _Key, _Tp>>,
+         class = enable_if_t<!__is_allocator<_Compare>::value, void>,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+multimap(initializer_list<pair<_Key, _Tp>>, _Compare = _Compare(), _Allocator = _Allocator())
+  -> multimap<remove_const_t<_Key>, _Tp, _Compare, _Allocator>;
+
+template<class _InputIterator, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value, void>,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+multimap(_InputIterator, _InputIterator, _Allocator)
+  -> multimap<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>,
+         less<__iter_key_type<_InputIterator>>, _Allocator>;
+
+template<class _Key, class _Tp, class _Allocator,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+multimap(initializer_list<pair<_Key, _Tp>>, _Allocator)
+  -> multimap<remove_const_t<_Key>, _Tp, less<remove_const_t<_Key>>, _Allocator>;
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+multimap<_Key, _Tp, _Compare, _Allocator>::multimap(multimap&& __m, const allocator_type& __a)
+    : __tree_(_VSTD::move(__m.__tree_), typename __base::allocator_type(__a))
+{
+    if (__a != __m.get_allocator())
+    {
+        const_iterator __e = cend();
+        while (!__m.empty())
+            __tree_.__insert_multi(__e.__i_,
+                    _VSTD::move(__m.__tree_.remove(__m.begin().__i_)->__value_.__move()));
+    }
+}
+#endif
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const multimap<_Key, _Tp, _Compare, _Allocator>& __x,
+           const multimap<_Key, _Tp, _Compare, _Allocator>& __y)
+{
+    return __x.size() == __y.size() && _VSTD::equal(__x.begin(), __x.end(), __y.begin());
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator< (const multimap<_Key, _Tp, _Compare, _Allocator>& __x,
+           const multimap<_Key, _Tp, _Compare, _Allocator>& __y)
+{
+    return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const multimap<_Key, _Tp, _Compare, _Allocator>& __x,
+           const multimap<_Key, _Tp, _Compare, _Allocator>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator> (const multimap<_Key, _Tp, _Compare, _Allocator>& __x,
+           const multimap<_Key, _Tp, _Compare, _Allocator>& __y)
+{
+    return __y < __x;
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const multimap<_Key, _Tp, _Compare, _Allocator>& __x,
+           const multimap<_Key, _Tp, _Compare, _Allocator>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const multimap<_Key, _Tp, _Compare, _Allocator>& __x,
+           const multimap<_Key, _Tp, _Compare, _Allocator>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _Key, class _Tp, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(multimap<_Key, _Tp, _Compare, _Allocator>& __x,
+     multimap<_Key, _Tp, _Compare, _Allocator>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Key, class _Tp, class _Compare, class _Allocator,
+          class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY
+    typename multimap<_Key, _Tp, _Compare, _Allocator>::size_type
+    erase_if(multimap<_Key, _Tp, _Compare, _Allocator>& __c,
+             _Predicate __pred) {
+  return _VSTD::__libcpp_erase_if_container(__c, __pred);
+}
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+_LIBCPP_BEGIN_NAMESPACE_STD
+namespace pmr {
+template <class _KeyT, class _ValueT, class _CompareT = std::less<_KeyT>>
+using map = std::map<_KeyT, _ValueT, _CompareT, polymorphic_allocator<std::pair<const _KeyT, _ValueT>>>;
+
+template <class _KeyT, class _ValueT, class _CompareT = std::less<_KeyT>>
+using multimap = std::multimap<_KeyT, _ValueT, _CompareT, polymorphic_allocator<std::pair<const _KeyT, _ValueT>>>;
+} // namespace pmr
+_LIBCPP_END_NAMESPACE_STD
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <functional>
+#  include <iterator>
+#  include <utility>
+#endif
+
+#endif // _LIBCPP_MAP
diff --git a/app/src/main/cpp/libcxx/include/math.h b/app/src/main/cpp/libcxx/include/math.h
new file mode 100644
index 0000000..a23d1ff
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/math.h
@@ -0,0 +1,1710 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_MATH_H
+#define _LIBCPP_MATH_H
+
+/*
+    math.h synopsis
+
+Macros:
+
+    HUGE_VAL
+    HUGE_VALF               // C99
+    HUGE_VALL               // C99
+    INFINITY                // C99
+    NAN                     // C99
+    FP_INFINITE             // C99
+    FP_NAN                  // C99
+    FP_NORMAL               // C99
+    FP_SUBNORMAL            // C99
+    FP_ZERO                 // C99
+    FP_FAST_FMA             // C99
+    FP_FAST_FMAF            // C99
+    FP_FAST_FMAL            // C99
+    FP_ILOGB0               // C99
+    FP_ILOGBNAN             // C99
+    MATH_ERRNO              // C99
+    MATH_ERREXCEPT          // C99
+    math_errhandling        // C99
+
+Types:
+
+    float_t                 // C99
+    double_t                // C99
+
+// C90
+
+floating_point abs(floating_point x);
+
+floating_point acos (arithmetic x);
+float          acosf(float x);
+long double    acosl(long double x);
+
+floating_point asin (arithmetic x);
+float          asinf(float x);
+long double    asinl(long double x);
+
+floating_point atan (arithmetic x);
+float          atanf(float x);
+long double    atanl(long double x);
+
+floating_point atan2 (arithmetic y, arithmetic x);
+float          atan2f(float y, float x);
+long double    atan2l(long double y, long double x);
+
+floating_point ceil (arithmetic x);
+float          ceilf(float x);
+long double    ceill(long double x);
+
+floating_point cos (arithmetic x);
+float          cosf(float x);
+long double    cosl(long double x);
+
+floating_point cosh (arithmetic x);
+float          coshf(float x);
+long double    coshl(long double x);
+
+floating_point exp (arithmetic x);
+float          expf(float x);
+long double    expl(long double x);
+
+floating_point fabs (arithmetic x);
+float          fabsf(float x);
+long double    fabsl(long double x);
+
+floating_point floor (arithmetic x);
+float          floorf(float x);
+long double    floorl(long double x);
+
+floating_point fmod (arithmetic x, arithmetic y);
+float          fmodf(float x, float y);
+long double    fmodl(long double x, long double y);
+
+floating_point frexp (arithmetic value, int* exp);
+float          frexpf(float value, int* exp);
+long double    frexpl(long double value, int* exp);
+
+floating_point ldexp (arithmetic value, int exp);
+float          ldexpf(float value, int exp);
+long double    ldexpl(long double value, int exp);
+
+floating_point log (arithmetic x);
+float          logf(float x);
+long double    logl(long double x);
+
+floating_point log10 (arithmetic x);
+float          log10f(float x);
+long double    log10l(long double x);
+
+floating_point modf (floating_point value, floating_point* iptr);
+float          modff(float value, float* iptr);
+long double    modfl(long double value, long double* iptr);
+
+floating_point pow (arithmetic x, arithmetic y);
+float          powf(float x, float y);
+long double    powl(long double x, long double y);
+
+floating_point sin (arithmetic x);
+float          sinf(float x);
+long double    sinl(long double x);
+
+floating_point sinh (arithmetic x);
+float          sinhf(float x);
+long double    sinhl(long double x);
+
+floating_point sqrt (arithmetic x);
+float          sqrtf(float x);
+long double    sqrtl(long double x);
+
+floating_point tan (arithmetic x);
+float          tanf(float x);
+long double    tanl(long double x);
+
+floating_point tanh (arithmetic x);
+float          tanhf(float x);
+long double    tanhl(long double x);
+
+//  C99
+
+bool signbit(arithmetic x);
+
+int fpclassify(arithmetic x);
+
+bool isfinite(arithmetic x);
+bool isinf(arithmetic x);
+bool isnan(arithmetic x);
+bool isnormal(arithmetic x);
+
+bool isgreater(arithmetic x, arithmetic y);
+bool isgreaterequal(arithmetic x, arithmetic y);
+bool isless(arithmetic x, arithmetic y);
+bool islessequal(arithmetic x, arithmetic y);
+bool islessgreater(arithmetic x, arithmetic y);
+bool isunordered(arithmetic x, arithmetic y);
+
+floating_point acosh (arithmetic x);
+float          acoshf(float x);
+long double    acoshl(long double x);
+
+floating_point asinh (arithmetic x);
+float          asinhf(float x);
+long double    asinhl(long double x);
+
+floating_point atanh (arithmetic x);
+float          atanhf(float x);
+long double    atanhl(long double x);
+
+floating_point cbrt (arithmetic x);
+float          cbrtf(float x);
+long double    cbrtl(long double x);
+
+floating_point copysign (arithmetic x, arithmetic y);
+float          copysignf(float x, float y);
+long double    copysignl(long double x, long double y);
+
+floating_point erf (arithmetic x);
+float          erff(float x);
+long double    erfl(long double x);
+
+floating_point erfc (arithmetic x);
+float          erfcf(float x);
+long double    erfcl(long double x);
+
+floating_point exp2 (arithmetic x);
+float          exp2f(float x);
+long double    exp2l(long double x);
+
+floating_point expm1 (arithmetic x);
+float          expm1f(float x);
+long double    expm1l(long double x);
+
+floating_point fdim (arithmetic x, arithmetic y);
+float          fdimf(float x, float y);
+long double    fdiml(long double x, long double y);
+
+floating_point fma (arithmetic x, arithmetic y, arithmetic z);
+float          fmaf(float x, float y, float z);
+long double    fmal(long double x, long double y, long double z);
+
+floating_point fmax (arithmetic x, arithmetic y);
+float          fmaxf(float x, float y);
+long double    fmaxl(long double x, long double y);
+
+floating_point fmin (arithmetic x, arithmetic y);
+float          fminf(float x, float y);
+long double    fminl(long double x, long double y);
+
+floating_point hypot (arithmetic x, arithmetic y);
+float          hypotf(float x, float y);
+long double    hypotl(long double x, long double y);
+
+int ilogb (arithmetic x);
+int ilogbf(float x);
+int ilogbl(long double x);
+
+floating_point lgamma (arithmetic x);
+float          lgammaf(float x);
+long double    lgammal(long double x);
+
+long long llrint (arithmetic x);
+long long llrintf(float x);
+long long llrintl(long double x);
+
+long long llround (arithmetic x);
+long long llroundf(float x);
+long long llroundl(long double x);
+
+floating_point log1p (arithmetic x);
+float          log1pf(float x);
+long double    log1pl(long double x);
+
+floating_point log2 (arithmetic x);
+float          log2f(float x);
+long double    log2l(long double x);
+
+floating_point logb (arithmetic x);
+float          logbf(float x);
+long double    logbl(long double x);
+
+long lrint (arithmetic x);
+long lrintf(float x);
+long lrintl(long double x);
+
+long lround (arithmetic x);
+long lroundf(float x);
+long lroundl(long double x);
+
+double      nan (const char* str);
+float       nanf(const char* str);
+long double nanl(const char* str);
+
+floating_point nearbyint (arithmetic x);
+float          nearbyintf(float x);
+long double    nearbyintl(long double x);
+
+floating_point nextafter (arithmetic x, arithmetic y);
+float          nextafterf(float x, float y);
+long double    nextafterl(long double x, long double y);
+
+floating_point nexttoward (arithmetic x, long double y);
+float          nexttowardf(float x, long double y);
+long double    nexttowardl(long double x, long double y);
+
+floating_point remainder (arithmetic x, arithmetic y);
+float          remainderf(float x, float y);
+long double    remainderl(long double x, long double y);
+
+floating_point remquo (arithmetic x, arithmetic y, int* pquo);
+float          remquof(float x, float y, int* pquo);
+long double    remquol(long double x, long double y, int* pquo);
+
+floating_point rint (arithmetic x);
+float          rintf(float x);
+long double    rintl(long double x);
+
+floating_point round (arithmetic x);
+float          roundf(float x);
+long double    roundl(long double x);
+
+floating_point scalbln (arithmetic x, long ex);
+float          scalblnf(float x, long ex);
+long double    scalblnl(long double x, long ex);
+
+floating_point scalbn (arithmetic x, int ex);
+float          scalbnf(float x, int ex);
+long double    scalbnl(long double x, int ex);
+
+floating_point tgamma (arithmetic x);
+float          tgammaf(float x);
+long double    tgammal(long double x);
+
+floating_point trunc (arithmetic x);
+float          truncf(float x);
+long double    truncl(long double x);
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#  if __has_include_next(<math.h>)
+#    include_next <math.h>
+#  endif
+
+#ifdef __cplusplus
+
+// We support including .h headers inside 'extern "C"' contexts, so switch
+// back to C++ linkage before including these C++ headers.
+extern "C++" {
+
+#include <__type_traits/enable_if.h>
+#include <__type_traits/is_floating_point.h>
+#include <__type_traits/is_integral.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/promote.h>
+#include <limits>
+#include <stdlib.h>
+
+
+#    ifdef fpclassify
+#      undef fpclassify
+#    endif
+
+#    ifdef signbit
+#      undef signbit
+#    endif
+
+#    ifdef isfinite
+#      undef isfinite
+#    endif
+
+#    ifdef isinf
+#      undef isinf
+#    endif
+
+#    ifdef isnan
+#      undef isnan
+#    endif
+
+#    ifdef isnormal
+#      undef isnormal
+#    endif
+
+#    ifdef isgreater
+#      undef isgreater
+#    endif
+
+#    ifdef isgreaterequal
+#      undef isgreaterequal
+#    endif
+
+#    ifdef isless
+#      undef isless
+#    endif
+
+#    ifdef islessequal
+#      undef islessequal
+#    endif
+
+#    ifdef islessgreater
+#      undef islessgreater
+#    endif
+
+#    ifdef isunordered
+#      undef isunordered
+#    endif
+
+// signbit
+
+template <class _A1, std::__enable_if_t<std::is_floating_point<_A1>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI bool signbit(_A1 __x) _NOEXCEPT {
+  return __builtin_signbit(__x);
+}
+
+template <class _A1, std::__enable_if_t<std::is_integral<_A1>::value && std::is_signed<_A1>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI bool signbit(_A1 __x) _NOEXCEPT {
+  return __x < 0;
+}
+
+template <class _A1, std::__enable_if_t<std::is_integral<_A1>::value && !std::is_signed<_A1>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI bool signbit(_A1) _NOEXCEPT {
+  return false;
+}
+
+// fpclassify
+
+template <class _A1, std::__enable_if_t<std::is_floating_point<_A1>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI int fpclassify(_A1 __x) _NOEXCEPT {
+  return __builtin_fpclassify(FP_NAN, FP_INFINITE, FP_NORMAL, FP_SUBNORMAL, FP_ZERO, __x);
+}
+
+template <class _A1, std::__enable_if_t<std::is_integral<_A1>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI int fpclassify(_A1 __x) _NOEXCEPT {
+  return __x == 0 ? FP_ZERO : FP_NORMAL;
+}
+
+// The MSVC runtime already provides these functions as templates
+#ifndef _LIBCPP_MSVCRT
+
+// isfinite
+
+template <class _A1,
+          std::__enable_if_t<std::is_arithmetic<_A1>::value && std::numeric_limits<_A1>::has_infinity, int> = 0>
+_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool isfinite(_A1 __x) _NOEXCEPT {
+  return __builtin_isfinite((typename std::__promote<_A1>::type)__x);
+}
+
+template <class _A1,
+          std::__enable_if_t<std::is_arithmetic<_A1>::value && !std::numeric_limits<_A1>::has_infinity, int> = 0>
+_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool isfinite(_A1) _NOEXCEPT {
+  return true;
+}
+
+// isinf
+
+template <class _A1,
+          std::__enable_if_t<std::is_arithmetic<_A1>::value && std::numeric_limits<_A1>::has_infinity, int> = 0>
+_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool isinf(_A1 __x) _NOEXCEPT {
+  return __builtin_isinf((typename std::__promote<_A1>::type)__x);
+}
+
+template <class _A1>
+_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI
+    typename std::enable_if< std::is_arithmetic<_A1>::value && !std::numeric_limits<_A1>::has_infinity, bool>::type
+    isinf(_A1) _NOEXCEPT {
+  return false;
+}
+
+#      ifdef _LIBCPP_PREFERRED_OVERLOAD
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool isinf(float __x) _NOEXCEPT {
+  return __builtin_isinf(__x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI _LIBCPP_PREFERRED_OVERLOAD bool isinf(double __x) _NOEXCEPT {
+  return __builtin_isinf(__x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool isinf(long double __x) _NOEXCEPT {
+  return __builtin_isinf(__x);
+}
+#      endif
+
+// isnan
+
+template <class _A1, std::__enable_if_t<std::is_floating_point<_A1>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool isnan(_A1 __x) _NOEXCEPT {
+  return __builtin_isnan(__x);
+}
+
+template <class _A1, std::__enable_if_t<std::is_integral<_A1>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool isnan(_A1) _NOEXCEPT {
+  return false;
+}
+
+#      ifdef _LIBCPP_PREFERRED_OVERLOAD
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool isnan(float __x) _NOEXCEPT {
+  return __builtin_isnan(__x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI _LIBCPP_PREFERRED_OVERLOAD bool isnan(double __x) _NOEXCEPT {
+  return __builtin_isnan(__x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool isnan(long double __x) _NOEXCEPT {
+  return __builtin_isnan(__x);
+}
+#      endif
+
+// isnormal
+
+template <class _A1, std::__enable_if_t<std::is_floating_point<_A1>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool isnormal(_A1 __x) _NOEXCEPT {
+  return __builtin_isnormal(__x);
+}
+
+template <class _A1, std::__enable_if_t<std::is_integral<_A1>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI bool isnormal(_A1 __x) _NOEXCEPT {
+  return __x != 0;
+}
+
+// isgreater
+
+template <class _A1,
+          class _A2,
+          std::__enable_if_t<std::is_arithmetic<_A1>::value && std::is_arithmetic<_A2>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI bool isgreater(_A1 __x, _A2 __y) _NOEXCEPT {
+  typedef typename std::__promote<_A1, _A2>::type type;
+  return __builtin_isgreater((type)__x, (type)__y);
+}
+
+// isgreaterequal
+
+template <class _A1,
+          class _A2,
+          std::__enable_if_t<std::is_arithmetic<_A1>::value && std::is_arithmetic<_A2>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI bool isgreaterequal(_A1 __x, _A2 __y) _NOEXCEPT {
+  typedef typename std::__promote<_A1, _A2>::type type;
+  return __builtin_isgreaterequal((type)__x, (type)__y);
+}
+
+// isless
+
+template <class _A1,
+          class _A2,
+          std::__enable_if_t<std::is_arithmetic<_A1>::value && std::is_arithmetic<_A2>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI bool isless(_A1 __x, _A2 __y) _NOEXCEPT {
+  typedef typename std::__promote<_A1, _A2>::type type;
+  return __builtin_isless((type)__x, (type)__y);
+}
+
+// islessequal
+
+template <class _A1,
+          class _A2,
+          std::__enable_if_t<std::is_arithmetic<_A1>::value && std::is_arithmetic<_A2>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI bool islessequal(_A1 __x, _A2 __y) _NOEXCEPT {
+  typedef typename std::__promote<_A1, _A2>::type type;
+  return __builtin_islessequal((type)__x, (type)__y);
+}
+
+// islessgreater
+
+template <class _A1,
+          class _A2,
+          std::__enable_if_t<std::is_arithmetic<_A1>::value && std::is_arithmetic<_A2>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI bool islessgreater(_A1 __x, _A2 __y) _NOEXCEPT {
+  typedef typename std::__promote<_A1, _A2>::type type;
+  return __builtin_islessgreater((type)__x, (type)__y);
+}
+
+// isunordered
+
+template <class _A1,
+          class _A2,
+          std::__enable_if_t<std::is_arithmetic<_A1>::value && std::is_arithmetic<_A2>::value, int> = 0>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI bool isunordered(_A1 __x, _A2 __y) _NOEXCEPT {
+  typedef typename std::__promote<_A1, _A2>::type type;
+  return __builtin_isunordered((type)__x, (type)__y);
+}
+
+#endif // _LIBCPP_MSVCRT
+
+// abs
+//
+// handled in stdlib.h
+
+// div
+//
+// handled in stdlib.h
+
+// We have to provide double overloads for <math.h> to work on platforms that don't provide the full set of math
+// functions. To make the overload set work with multiple functions that take the same arguments, we make our overloads
+// templates. Functions are preferred over function templates during overload resolution, which means that our overload
+// will only be selected when the C library doesn't provide one.
+
+// acos
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       acos(float __x) _NOEXCEPT       {return __builtin_acosf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double acos(double __x) _NOEXCEPT {
+  return __builtin_acos(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double acos(long double __x) _NOEXCEPT {return __builtin_acosl(__x);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+acos(_A1 __x) _NOEXCEPT {return __builtin_acos((double)__x);}
+
+// asin
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       asin(float __x) _NOEXCEPT       {return __builtin_asinf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double asin(double __x) _NOEXCEPT {
+  return __builtin_asin(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double asin(long double __x) _NOEXCEPT {return __builtin_asinl(__x);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+asin(_A1 __x) _NOEXCEPT {return __builtin_asin((double)__x);}
+
+// atan
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       atan(float __x) _NOEXCEPT       {return __builtin_atanf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double atan(double __x) _NOEXCEPT {
+  return __builtin_atan(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double atan(long double __x) _NOEXCEPT {return __builtin_atanl(__x);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+atan(_A1 __x) _NOEXCEPT {return __builtin_atan((double)__x);}
+
+// atan2
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       atan2(float __y, float __x) _NOEXCEPT             {return __builtin_atan2f(__y, __x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double atan2(double __x, double __y) _NOEXCEPT {
+  return __builtin_atan2(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double atan2(long double __y, long double __x) _NOEXCEPT {return __builtin_atan2l(__y, __x);}
+#    endif
+
+template <class _A1, class _A2>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::__enable_if_t
+<
+    std::is_arithmetic<_A1>::value &&
+    std::is_arithmetic<_A2>::value,
+    std::__promote<_A1, _A2>
+>::type
+atan2(_A1 __y, _A2 __x) _NOEXCEPT
+{
+    typedef typename std::__promote<_A1, _A2>::type __result_type;
+    static_assert((!(std::_IsSame<_A1, __result_type>::value &&
+                     std::_IsSame<_A2, __result_type>::value)), "");
+    return ::atan2((__result_type)__y, (__result_type)__x);
+}
+
+// ceil
+
+#    if !defined(__sun__)
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI float       ceil(float __x) _NOEXCEPT       {return __builtin_ceilf(__x);}
+
+template <class = int>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI double ceil(double __x) _NOEXCEPT {
+  return __builtin_ceil(__x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI long double ceil(long double __x) _NOEXCEPT {return __builtin_ceill(__x);}
+#    endif
+
+template <class _A1>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+ceil(_A1 __x) _NOEXCEPT {return __builtin_ceil((double)__x);}
+
+// cos
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       cos(float __x) _NOEXCEPT       {return __builtin_cosf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double cos(double __x) _NOEXCEPT {
+  return __builtin_cos(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double cos(long double __x) _NOEXCEPT {return __builtin_cosl(__x);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+cos(_A1 __x) _NOEXCEPT {return __builtin_cos((double)__x);}
+
+// cosh
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       cosh(float __x) _NOEXCEPT       {return __builtin_coshf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double cosh(double __x) _NOEXCEPT {
+  return __builtin_cosh(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double cosh(long double __x) _NOEXCEPT {return __builtin_coshl(__x);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+cosh(_A1 __x) _NOEXCEPT {return __builtin_cosh((double)__x);}
+
+// exp
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       exp(float __x) _NOEXCEPT       {return __builtin_expf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double exp(double __x) _NOEXCEPT {
+  return __builtin_exp(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double exp(long double __x) _NOEXCEPT {return __builtin_expl(__x);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+exp(_A1 __x) _NOEXCEPT {return __builtin_exp((double)__x);}
+
+// fabs
+
+#    if !defined(__sun__)
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI float       fabs(float __x) _NOEXCEPT       {return __builtin_fabsf(__x);}
+
+template <class = int>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI double fabs(double __x) _NOEXCEPT {
+  return __builtin_fabs(__x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI long double fabs(long double __x) _NOEXCEPT {return __builtin_fabsl(__x);}
+#    endif
+
+template <class _A1>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+fabs(_A1 __x) _NOEXCEPT {return __builtin_fabs((double)__x);}
+
+// floor
+
+#    if !defined(__sun__)
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI float       floor(float __x) _NOEXCEPT       {return __builtin_floorf(__x);}
+
+template <class = int>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI double floor(double __x) _NOEXCEPT {
+  return __builtin_floor(__x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI long double floor(long double __x) _NOEXCEPT {return __builtin_floorl(__x);}
+#    endif
+
+template <class _A1>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+floor(_A1 __x) _NOEXCEPT {return __builtin_floor((double)__x);}
+
+// fmod
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       fmod(float __x, float __y) _NOEXCEPT             {return __builtin_fmodf(__x, __y);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double fmod(double __x, double __y) _NOEXCEPT {
+  return __builtin_fmod(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double fmod(long double __x, long double __y) _NOEXCEPT {return __builtin_fmodl(__x, __y);}
+#    endif
+
+template <class _A1, class _A2>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::__enable_if_t
+<
+    std::is_arithmetic<_A1>::value &&
+    std::is_arithmetic<_A2>::value,
+    std::__promote<_A1, _A2>
+>::type
+fmod(_A1 __x, _A2 __y) _NOEXCEPT
+{
+    typedef typename std::__promote<_A1, _A2>::type __result_type;
+    static_assert((!(std::_IsSame<_A1, __result_type>::value &&
+                     std::_IsSame<_A2, __result_type>::value)), "");
+    return ::fmod((__result_type)__x, (__result_type)__y);
+}
+
+// frexp
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       frexp(float __x, int* __e) _NOEXCEPT       {return __builtin_frexpf(__x, __e);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double frexp(double __x, int* __e) _NOEXCEPT {
+  return __builtin_frexp(__x, __e);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double frexp(long double __x, int* __e) _NOEXCEPT {return __builtin_frexpl(__x, __e);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+frexp(_A1 __x, int* __e) _NOEXCEPT {return __builtin_frexp((double)__x, __e);}
+
+// ldexp
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       ldexp(float __x, int __e) _NOEXCEPT       {return __builtin_ldexpf(__x, __e);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double ldexp(double __x, int __e) _NOEXCEPT {
+  return __builtin_ldexp(__x, __e);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double ldexp(long double __x, int __e) _NOEXCEPT {return __builtin_ldexpl(__x, __e);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+ldexp(_A1 __x, int __e) _NOEXCEPT {return __builtin_ldexp((double)__x, __e);}
+
+// log
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       log(float __x) _NOEXCEPT       {return __builtin_logf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double log(double __x) _NOEXCEPT {
+  return __builtin_log(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double log(long double __x) _NOEXCEPT {return __builtin_logl(__x);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+log(_A1 __x) _NOEXCEPT {return __builtin_log((double)__x);}
+
+// log10
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       log10(float __x) _NOEXCEPT       {return __builtin_log10f(__x);}
+
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double log10(double __x) _NOEXCEPT {
+  return __builtin_log10(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double log10(long double __x) _NOEXCEPT {return __builtin_log10l(__x);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+log10(_A1 __x) _NOEXCEPT {return __builtin_log10((double)__x);}
+
+// modf
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       modf(float __x, float* __y) _NOEXCEPT             {return __builtin_modff(__x, __y);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double modf(double __x, double* __y) _NOEXCEPT {
+  return __builtin_modf(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double modf(long double __x, long double* __y) _NOEXCEPT {return __builtin_modfl(__x, __y);}
+#    endif
+
+// pow
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       pow(float __x, float __y) _NOEXCEPT             {return __builtin_powf(__x, __y);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double pow(double __x, double __y) _NOEXCEPT {
+  return __builtin_pow(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double pow(long double __x, long double __y) _NOEXCEPT {return __builtin_powl(__x, __y);}
+#    endif
+
+template <class _A1, class _A2>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::__enable_if_t
+<
+    std::is_arithmetic<_A1>::value &&
+    std::is_arithmetic<_A2>::value,
+    std::__promote<_A1, _A2>
+>::type
+pow(_A1 __x, _A2 __y) _NOEXCEPT
+{
+    typedef typename std::__promote<_A1, _A2>::type __result_type;
+    static_assert((!(std::_IsSame<_A1, __result_type>::value &&
+                     std::_IsSame<_A2, __result_type>::value)), "");
+    return ::pow((__result_type)__x, (__result_type)__y);
+}
+
+// sin
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       sin(float __x) _NOEXCEPT       {return __builtin_sinf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double sin(double __x) _NOEXCEPT {
+  return __builtin_sin(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double sin(long double __x) _NOEXCEPT {return __builtin_sinl(__x);}
+#endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+sin(_A1 __x) _NOEXCEPT {return __builtin_sin((double)__x);}
+
+// sinh
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       sinh(float __x) _NOEXCEPT       {return __builtin_sinhf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double sinh(double __x) _NOEXCEPT {
+  return __builtin_sinh(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double sinh(long double __x) _NOEXCEPT {return __builtin_sinhl(__x);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+sinh(_A1 __x) _NOEXCEPT {return __builtin_sinh((double)__x);}
+
+// sqrt
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       sqrt(float __x) _NOEXCEPT       {return __builtin_sqrtf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double sqrt(double __x) _NOEXCEPT {
+  return __builtin_sqrt(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double sqrt(long double __x) _NOEXCEPT {return __builtin_sqrtl(__x);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+sqrt(_A1 __x) _NOEXCEPT {return __builtin_sqrt((double)__x);}
+
+// tan
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       tan(float __x) _NOEXCEPT       {return __builtin_tanf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double tan(double __x) _NOEXCEPT {
+  return __builtin_tan(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double tan(long double __x) _NOEXCEPT {return __builtin_tanl(__x);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+tan(_A1 __x) _NOEXCEPT {return __builtin_tan((double)__x);}
+
+// tanh
+
+#    if !defined(__sun__)
+inline _LIBCPP_HIDE_FROM_ABI float       tanh(float __x) _NOEXCEPT       {return __builtin_tanhf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double tanh(double __x) _NOEXCEPT {
+  return __builtin_tanh(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double tanh(long double __x) _NOEXCEPT {return __builtin_tanhl(__x);}
+#    endif
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+tanh(_A1 __x) _NOEXCEPT {return __builtin_tanh((double)__x);}
+
+// acosh
+
+inline _LIBCPP_HIDE_FROM_ABI float       acosh(float __x) _NOEXCEPT       {return __builtin_acoshf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double acosh(double __x) _NOEXCEPT {
+  return __builtin_acosh(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double acosh(long double __x) _NOEXCEPT {return __builtin_acoshl(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+acosh(_A1 __x) _NOEXCEPT {return __builtin_acosh((double)__x);}
+
+// asinh
+
+inline _LIBCPP_HIDE_FROM_ABI float       asinh(float __x) _NOEXCEPT       {return __builtin_asinhf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double asinh(double __x) _NOEXCEPT {
+  return __builtin_asinh(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double asinh(long double __x) _NOEXCEPT {return __builtin_asinhl(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+asinh(_A1 __x) _NOEXCEPT {return __builtin_asinh((double)__x);}
+
+// atanh
+
+inline _LIBCPP_HIDE_FROM_ABI float       atanh(float __x) _NOEXCEPT       {return __builtin_atanhf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double atanh(double __x) _NOEXCEPT {
+  return __builtin_atanh(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double atanh(long double __x) _NOEXCEPT {return __builtin_atanhl(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+atanh(_A1 __x) _NOEXCEPT {return __builtin_atanh((double)__x);}
+
+// cbrt
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI float       cbrt(float __x) _NOEXCEPT       {return __builtin_cbrtf(__x);}
+
+template <class = int>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI double cbrt(double __x) _NOEXCEPT {
+  return __builtin_cbrt(__x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI long double cbrt(long double __x) _NOEXCEPT {return __builtin_cbrtl(__x);}
+
+template <class _A1>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+cbrt(_A1 __x) _NOEXCEPT {return __builtin_cbrt((double)__x);}
+
+// copysign
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI float copysign(float __x, float __y) _NOEXCEPT {
+  return ::__builtin_copysignf(__x, __y);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI long double copysign(long double __x, long double __y) _NOEXCEPT {
+  return ::__builtin_copysignl(__x, __y);
+}
+
+template <class _A1, class _A2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI
+typename std::__enable_if_t
+<
+    std::is_arithmetic<_A1>::value &&
+    std::is_arithmetic<_A2>::value,
+    std::__promote<_A1, _A2>
+>::type
+    copysign(_A1 __x, _A2 __y) _NOEXCEPT {
+  return ::__builtin_copysign(__x, __y);
+}
+
+// erf
+
+inline _LIBCPP_HIDE_FROM_ABI float       erf(float __x) _NOEXCEPT       {return __builtin_erff(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double erf(double __x) _NOEXCEPT {
+  return __builtin_erf(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double erf(long double __x) _NOEXCEPT {return __builtin_erfl(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+erf(_A1 __x) _NOEXCEPT {return __builtin_erf((double)__x);}
+
+// erfc
+
+inline _LIBCPP_HIDE_FROM_ABI float       erfc(float __x) _NOEXCEPT       {return __builtin_erfcf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double erfc(double __x) _NOEXCEPT {
+  return __builtin_erfc(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double erfc(long double __x) _NOEXCEPT {return __builtin_erfcl(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+erfc(_A1 __x) _NOEXCEPT {return __builtin_erfc((double)__x);}
+
+// exp2
+
+inline _LIBCPP_HIDE_FROM_ABI float       exp2(float __x) _NOEXCEPT       {return __builtin_exp2f(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double exp2(double __x) _NOEXCEPT {
+  return __builtin_exp2(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double exp2(long double __x) _NOEXCEPT {return __builtin_exp2l(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+exp2(_A1 __x) _NOEXCEPT {return __builtin_exp2((double)__x);}
+
+// expm1
+
+inline _LIBCPP_HIDE_FROM_ABI float       expm1(float __x) _NOEXCEPT       {return __builtin_expm1f(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double expm1(double __x) _NOEXCEPT {
+  return __builtin_expm1(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double expm1(long double __x) _NOEXCEPT {return __builtin_expm1l(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+expm1(_A1 __x) _NOEXCEPT {return __builtin_expm1((double)__x);}
+
+// fdim
+
+inline _LIBCPP_HIDE_FROM_ABI float       fdim(float __x, float __y) _NOEXCEPT             {return __builtin_fdimf(__x, __y);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double fdim(double __x, double __y) _NOEXCEPT {
+  return __builtin_fdim(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double fdim(long double __x, long double __y) _NOEXCEPT {return __builtin_fdiml(__x, __y);}
+
+template <class _A1, class _A2>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::__enable_if_t
+<
+    std::is_arithmetic<_A1>::value &&
+    std::is_arithmetic<_A2>::value,
+    std::__promote<_A1, _A2>
+>::type
+fdim(_A1 __x, _A2 __y) _NOEXCEPT
+{
+    typedef typename std::__promote<_A1, _A2>::type __result_type;
+    static_assert((!(std::_IsSame<_A1, __result_type>::value &&
+                     std::_IsSame<_A2, __result_type>::value)), "");
+    return ::fdim((__result_type)__x, (__result_type)__y);
+}
+
+// fma
+
+inline _LIBCPP_HIDE_FROM_ABI float       fma(float __x, float __y, float __z) _NOEXCEPT
+{
+    return __builtin_fmaf(__x, __y, __z);
+}
+
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double fma(double __x, double __y, double __z) _NOEXCEPT {
+  return __builtin_fma(__x, __y, __z);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double fma(long double __x, long double __y, long double __z) _NOEXCEPT
+{
+    return __builtin_fmal(__x, __y, __z);
+}
+
+template <class _A1, class _A2, class _A3>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::__enable_if_t
+<
+    std::is_arithmetic<_A1>::value &&
+    std::is_arithmetic<_A2>::value &&
+    std::is_arithmetic<_A3>::value,
+    std::__promote<_A1, _A2, _A3>
+>::type
+fma(_A1 __x, _A2 __y, _A3 __z) _NOEXCEPT
+{
+    typedef typename std::__promote<_A1, _A2, _A3>::type __result_type;
+    static_assert((!(std::_IsSame<_A1, __result_type>::value &&
+                     std::_IsSame<_A2, __result_type>::value &&
+                     std::_IsSame<_A3, __result_type>::value)), "");
+    return __builtin_fma((__result_type)__x, (__result_type)__y, (__result_type)__z);
+}
+
+// fmax
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI float       fmax(float __x, float __y) _NOEXCEPT             {return __builtin_fmaxf(__x, __y);}
+
+template <class = int>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI double fmax(double __x, double __y) _NOEXCEPT {
+  return __builtin_fmax(__x, __y);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI long double fmax(long double __x, long double __y) _NOEXCEPT {return __builtin_fmaxl(__x, __y);}
+
+template <class _A1, class _A2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI
+typename std::__enable_if_t
+<
+    std::is_arithmetic<_A1>::value &&
+    std::is_arithmetic<_A2>::value,
+    std::__promote<_A1, _A2>
+>::type
+fmax(_A1 __x, _A2 __y) _NOEXCEPT
+{
+    typedef typename std::__promote<_A1, _A2>::type __result_type;
+    static_assert((!(std::_IsSame<_A1, __result_type>::value &&
+                     std::_IsSame<_A2, __result_type>::value)), "");
+    return ::fmax((__result_type)__x, (__result_type)__y);
+}
+
+// fmin
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI float       fmin(float __x, float __y) _NOEXCEPT             {return __builtin_fminf(__x, __y);}
+
+template <class = int>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI double fmin(double __x, double __y) _NOEXCEPT {
+  return __builtin_fmin(__x, __y);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI long double fmin(long double __x, long double __y) _NOEXCEPT {return __builtin_fminl(__x, __y);}
+
+template <class _A1, class _A2>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI
+typename std::__enable_if_t
+<
+    std::is_arithmetic<_A1>::value &&
+    std::is_arithmetic<_A2>::value,
+    std::__promote<_A1, _A2>
+>::type
+fmin(_A1 __x, _A2 __y) _NOEXCEPT
+{
+    typedef typename std::__promote<_A1, _A2>::type __result_type;
+    static_assert((!(std::_IsSame<_A1, __result_type>::value &&
+                     std::_IsSame<_A2, __result_type>::value)), "");
+    return ::fmin((__result_type)__x, (__result_type)__y);
+}
+
+// hypot
+
+inline _LIBCPP_HIDE_FROM_ABI float       hypot(float __x, float __y) _NOEXCEPT             {return __builtin_hypotf(__x, __y);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double hypot(double __x, double __y) _NOEXCEPT {
+  return __builtin_hypot(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double hypot(long double __x, long double __y) _NOEXCEPT {return __builtin_hypotl(__x, __y);}
+
+template <class _A1, class _A2>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::__enable_if_t
+<
+    std::is_arithmetic<_A1>::value &&
+    std::is_arithmetic<_A2>::value,
+    std::__promote<_A1, _A2>
+>::type
+hypot(_A1 __x, _A2 __y) _NOEXCEPT
+{
+    typedef typename std::__promote<_A1, _A2>::type __result_type;
+    static_assert((!(std::_IsSame<_A1, __result_type>::value &&
+                     std::_IsSame<_A2, __result_type>::value)), "");
+    return ::hypot((__result_type)__x, (__result_type)__y);
+}
+
+// ilogb
+
+inline _LIBCPP_HIDE_FROM_ABI int ilogb(float __x) _NOEXCEPT       {return __builtin_ilogbf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double ilogb(double __x) _NOEXCEPT {
+  return __builtin_ilogb(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI int ilogb(long double __x) _NOEXCEPT {return __builtin_ilogbl(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, int>::type
+ilogb(_A1 __x) _NOEXCEPT {return __builtin_ilogb((double)__x);}
+
+// lgamma
+
+inline _LIBCPP_HIDE_FROM_ABI float       lgamma(float __x) _NOEXCEPT       {return __builtin_lgammaf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double lgamma(double __x) _NOEXCEPT {
+  return __builtin_lgamma(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double lgamma(long double __x) _NOEXCEPT {return __builtin_lgammal(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+lgamma(_A1 __x) _NOEXCEPT {return __builtin_lgamma((double)__x);}
+
+// llrint
+
+inline _LIBCPP_HIDE_FROM_ABI long long llrint(float __x) _NOEXCEPT
+{
+    return __builtin_llrintf(__x);
+}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI long long llrint(double __x) _NOEXCEPT {
+  return __builtin_llrint(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long long llrint(long double __x) _NOEXCEPT
+{
+    return __builtin_llrintl(__x);
+}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, long long>::type
+llrint(_A1 __x) _NOEXCEPT
+{
+    return __builtin_llrint((double)__x);
+}
+
+// llround
+
+inline _LIBCPP_HIDE_FROM_ABI long long llround(float __x) _NOEXCEPT
+{
+    return __builtin_llroundf(__x);
+}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI long long llround(double __x) _NOEXCEPT {
+  return __builtin_llround(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long long llround(long double __x) _NOEXCEPT
+{
+    return __builtin_llroundl(__x);
+}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, long long>::type
+llround(_A1 __x) _NOEXCEPT
+{
+    return __builtin_llround((double)__x);
+}
+
+// log1p
+
+inline _LIBCPP_HIDE_FROM_ABI float       log1p(float __x) _NOEXCEPT       {return __builtin_log1pf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double log1p(double __x) _NOEXCEPT {
+  return __builtin_log1p(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double log1p(long double __x) _NOEXCEPT {return __builtin_log1pl(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+log1p(_A1 __x) _NOEXCEPT {return __builtin_log1p((double)__x);}
+
+// log2
+
+inline _LIBCPP_HIDE_FROM_ABI float       log2(float __x) _NOEXCEPT       {return __builtin_log2f(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double log2(double __x) _NOEXCEPT {
+  return __builtin_log2(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double log2(long double __x) _NOEXCEPT {return __builtin_log2l(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+log2(_A1 __x) _NOEXCEPT {return __builtin_log2((double)__x);}
+
+// logb
+
+inline _LIBCPP_HIDE_FROM_ABI float       logb(float __x) _NOEXCEPT       {return __builtin_logbf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double logb(double __x) _NOEXCEPT {
+  return __builtin_logb(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double logb(long double __x) _NOEXCEPT {return __builtin_logbl(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+logb(_A1 __x) _NOEXCEPT {return __builtin_logb((double)__x);}
+
+// lrint
+
+inline _LIBCPP_HIDE_FROM_ABI long lrint(float __x) _NOEXCEPT
+{
+    return __builtin_lrintf(__x);
+}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI long lrint(double __x) _NOEXCEPT {
+  return __builtin_lrint(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long lrint(long double __x) _NOEXCEPT
+{
+    return __builtin_lrintl(__x);
+}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, long>::type
+lrint(_A1 __x) _NOEXCEPT
+{
+    return __builtin_lrint((double)__x);
+}
+
+// lround
+
+inline _LIBCPP_HIDE_FROM_ABI long lround(float __x) _NOEXCEPT
+{
+    return __builtin_lroundf(__x);
+}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI long lround(double __x) _NOEXCEPT {
+  return __builtin_lround(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long lround(long double __x) _NOEXCEPT
+{
+    return __builtin_lroundl(__x);
+}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, long>::type
+lround(_A1 __x) _NOEXCEPT
+{
+    return __builtin_lround((double)__x);
+}
+
+// nan
+
+// nearbyint
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI float       nearbyint(float __x) _NOEXCEPT       {return __builtin_nearbyintf(__x);}
+
+template <class = int>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI double nearbyint(double __x) _NOEXCEPT {
+  return __builtin_nearbyint(__x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI long double nearbyint(long double __x) _NOEXCEPT {return __builtin_nearbyintl(__x);}
+
+template <class _A1>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+nearbyint(_A1 __x) _NOEXCEPT {return __builtin_nearbyint((double)__x);}
+
+// nextafter
+
+inline _LIBCPP_HIDE_FROM_ABI float       nextafter(float __x, float __y) _NOEXCEPT             {return __builtin_nextafterf(__x, __y);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double nextafter(double __x, double __y) _NOEXCEPT {
+  return __builtin_nextafter(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double nextafter(long double __x, long double __y) _NOEXCEPT {return __builtin_nextafterl(__x, __y);}
+
+template <class _A1, class _A2>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::__enable_if_t
+<
+    std::is_arithmetic<_A1>::value &&
+    std::is_arithmetic<_A2>::value,
+    std::__promote<_A1, _A2>
+>::type
+nextafter(_A1 __x, _A2 __y) _NOEXCEPT
+{
+    typedef typename std::__promote<_A1, _A2>::type __result_type;
+    static_assert((!(std::_IsSame<_A1, __result_type>::value &&
+                     std::_IsSame<_A2, __result_type>::value)), "");
+    return ::nextafter((__result_type)__x, (__result_type)__y);
+}
+
+// nexttoward
+
+inline _LIBCPP_HIDE_FROM_ABI float       nexttoward(float __x, long double __y) _NOEXCEPT       {return __builtin_nexttowardf(__x, __y);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double nexttoward(double __x, long double __y) _NOEXCEPT {
+  return __builtin_nexttoward(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double nexttoward(long double __x, long double __y) _NOEXCEPT {return __builtin_nexttowardl(__x, __y);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+nexttoward(_A1 __x, long double __y) _NOEXCEPT {return __builtin_nexttoward((double)__x, __y);}
+
+// remainder
+
+inline _LIBCPP_HIDE_FROM_ABI float       remainder(float __x, float __y) _NOEXCEPT             {return __builtin_remainderf(__x, __y);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double remainder(double __x, double __y) _NOEXCEPT {
+  return __builtin_remainder(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double remainder(long double __x, long double __y) _NOEXCEPT {return __builtin_remainderl(__x, __y);}
+
+template <class _A1, class _A2>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::__enable_if_t
+<
+    std::is_arithmetic<_A1>::value &&
+    std::is_arithmetic<_A2>::value,
+    std::__promote<_A1, _A2>
+>::type
+remainder(_A1 __x, _A2 __y) _NOEXCEPT
+{
+    typedef typename std::__promote<_A1, _A2>::type __result_type;
+    static_assert((!(std::_IsSame<_A1, __result_type>::value &&
+                     std::_IsSame<_A2, __result_type>::value)), "");
+    return ::remainder((__result_type)__x, (__result_type)__y);
+}
+
+// remquo
+
+inline _LIBCPP_HIDE_FROM_ABI float       remquo(float __x, float __y, int* __z) _NOEXCEPT             {return __builtin_remquof(__x, __y, __z);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double remquo(double __x, double __y, int* __z) _NOEXCEPT {
+  return __builtin_remquo(__x, __y, __z);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double remquo(long double __x, long double __y, int* __z) _NOEXCEPT {return __builtin_remquol(__x, __y, __z);}
+
+template <class _A1, class _A2>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::__enable_if_t
+<
+    std::is_arithmetic<_A1>::value &&
+    std::is_arithmetic<_A2>::value,
+    std::__promote<_A1, _A2>
+>::type
+remquo(_A1 __x, _A2 __y, int* __z) _NOEXCEPT
+{
+    typedef typename std::__promote<_A1, _A2>::type __result_type;
+    static_assert((!(std::_IsSame<_A1, __result_type>::value &&
+                     std::_IsSame<_A2, __result_type>::value)), "");
+    return ::remquo((__result_type)__x, (__result_type)__y, __z);
+}
+
+// rint
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI float       rint(float __x) _NOEXCEPT
+{
+    return __builtin_rintf(__x);
+}
+
+template <class = int>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI double rint(double __x) _NOEXCEPT {
+  return __builtin_rint(__x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI long double rint(long double __x) _NOEXCEPT
+{
+    return __builtin_rintl(__x);
+}
+
+template <class _A1>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+rint(_A1 __x) _NOEXCEPT
+{
+    return __builtin_rint((double)__x);
+}
+
+// round
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI float       round(float __x) _NOEXCEPT
+{
+    return __builtin_round(__x);
+}
+
+template <class = int>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI double round(double __x) _NOEXCEPT {
+  return __builtin_round(__x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI long double round(long double __x) _NOEXCEPT
+{
+    return __builtin_roundl(__x);
+}
+
+template <class _A1>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+round(_A1 __x) _NOEXCEPT
+{
+    return __builtin_round((double)__x);
+}
+
+// scalbln
+
+inline _LIBCPP_HIDE_FROM_ABI float       scalbln(float __x, long __y) _NOEXCEPT       {return __builtin_scalblnf(__x, __y);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double scalbln(double __x, long __y) _NOEXCEPT {
+  return __builtin_scalbln(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double scalbln(long double __x, long __y) _NOEXCEPT {return __builtin_scalblnl(__x, __y);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+scalbln(_A1 __x, long __y) _NOEXCEPT {return __builtin_scalbln((double)__x, __y);}
+
+// scalbn
+
+inline _LIBCPP_HIDE_FROM_ABI float       scalbn(float __x, int __y) _NOEXCEPT       {return __builtin_scalbnf(__x, __y);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double scalbn(double __x, int __y) _NOEXCEPT {
+  return __builtin_scalbn(__x, __y);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double scalbn(long double __x, int __y) _NOEXCEPT {return __builtin_scalbnl(__x, __y);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+scalbn(_A1 __x, int __y) _NOEXCEPT {return __builtin_scalbn((double)__x, __y);}
+
+// tgamma
+
+inline _LIBCPP_HIDE_FROM_ABI float       tgamma(float __x) _NOEXCEPT       {return __builtin_tgammaf(__x);}
+
+template <class = int>
+_LIBCPP_HIDE_FROM_ABI double tgamma(double __x) _NOEXCEPT {
+  return __builtin_tgamma(__x);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI long double tgamma(long double __x) _NOEXCEPT {return __builtin_tgammal(__x);}
+
+template <class _A1>
+inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+tgamma(_A1 __x) _NOEXCEPT {return __builtin_tgamma((double)__x);}
+
+// trunc
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI float       trunc(float __x) _NOEXCEPT
+{
+    return __builtin_trunc(__x);
+}
+
+template <class = int>
+_LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI double trunc(double __x) _NOEXCEPT {
+  return __builtin_trunc(__x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI long double trunc(long double __x) _NOEXCEPT
+{
+    return __builtin_truncl(__x);
+}
+
+template <class _A1>
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_HIDE_FROM_ABI
+typename std::enable_if<std::is_integral<_A1>::value, double>::type
+trunc(_A1 __x) _NOEXCEPT
+{
+    return __builtin_trunc((double)__x);
+}
+
+} // extern "C++"
+
+#endif // __cplusplus
+
+#else // _LIBCPP_MATH_H
+
+// This include lives outside the header guard in order to support an MSVC
+// extension which allows users to do:
+//
+// #define _USE_MATH_DEFINES
+// #include <math.h>
+//
+// and receive the definitions of mathematical constants, even if <math.h>
+// has previously been included.
+#if defined(_LIBCPP_MSVCRT) && defined(_USE_MATH_DEFINES)
+#include_next <math.h>
+#endif
+
+#endif // _LIBCPP_MATH_H
diff --git a/app/src/main/cpp/libcxx/include/memory b/app/src/main/cpp/libcxx/include/memory
new file mode 100644
index 0000000..0a7787a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/memory
@@ -0,0 +1,934 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_MEMORY
+#define _LIBCPP_MEMORY
+
+/*
+    memory synopsis
+
+namespace std
+{
+
+struct allocator_arg_t { };
+inline constexpr allocator_arg_t allocator_arg = allocator_arg_t();
+
+template <class T, class Alloc> struct uses_allocator;
+
+template <class Ptr>
+struct pointer_traits
+{
+    typedef Ptr pointer;
+    typedef <details> element_type;
+    typedef <details> difference_type;
+
+    template <class U> using rebind = <details>;
+
+    static pointer pointer_to(<details>);
+};
+
+template <class T>
+struct pointer_traits<T*>
+{
+    typedef T* pointer;
+    typedef T element_type;
+    typedef ptrdiff_t difference_type;
+
+    template <class U> using rebind = U*;
+
+    static pointer pointer_to(<details>) noexcept; // constexpr in C++20
+};
+
+template <class T> constexpr T* to_address(T* p) noexcept; // C++20
+template <class Ptr> constexpr auto to_address(const Ptr& p) noexcept; // C++20
+
+template <class Alloc>
+struct allocator_traits
+{
+    typedef Alloc                        allocator_type;
+    typedef typename allocator_type::value_type
+                                         value_type;
+
+    typedef Alloc::pointer | value_type* pointer;
+    typedef Alloc::const_pointer
+          | pointer_traits<pointer>::rebind<const value_type>
+                                         const_pointer;
+    typedef Alloc::void_pointer
+          | pointer_traits<pointer>::rebind<void>
+                                         void_pointer;
+    typedef Alloc::const_void_pointer
+          | pointer_traits<pointer>::rebind<const void>
+                                         const_void_pointer;
+    typedef Alloc::difference_type
+          | pointer_traits<pointer>::difference_type
+                                         difference_type;
+    typedef Alloc::size_type
+          | make_unsigned<difference_type>::type
+                                         size_type;
+    typedef Alloc::propagate_on_container_copy_assignment
+          | false_type                   propagate_on_container_copy_assignment;
+    typedef Alloc::propagate_on_container_move_assignment
+          | false_type                   propagate_on_container_move_assignment;
+    typedef Alloc::propagate_on_container_swap
+          | false_type                   propagate_on_container_swap;
+    typedef Alloc::is_always_equal
+          | is_empty                     is_always_equal;
+
+    template <class T> using rebind_alloc  = Alloc::rebind<T>::other | Alloc<T, Args...>;
+    template <class T> using rebind_traits = allocator_traits<rebind_alloc<T>>;
+
+    static pointer allocate(allocator_type& a, size_type n);                          // constexpr and [[nodiscard]] in C++20
+    static pointer allocate(allocator_type& a, size_type n, const_void_pointer hint); // constexpr and [[nodiscard]] in C++20
+
+    static void deallocate(allocator_type& a, pointer p, size_type n) noexcept; // constexpr in C++20
+
+    template <class T, class... Args>
+    static void construct(allocator_type& a, T* p, Args&&... args); // constexpr in C++20
+
+    template <class T>
+    static void destroy(allocator_type& a, T* p); // constexpr in C++20
+
+    static size_type max_size(const allocator_type& a); // noexcept in C++14, constexpr in C++20
+    static allocator_type select_on_container_copy_construction(const allocator_type& a); // constexpr in C++20
+};
+
+template<class Pointer>
+struct allocation_result {
+    Pointer ptr;
+    size_t count;
+}; // since C++23
+
+template<class Allocator>
+[[nodiscard]] constexpr allocation_result<typename allocator_traits<Allocator>::pointer>
+    allocate_at_least(Allocator& a, size_t n); // since C++23
+
+template <>
+class allocator<void> // removed in C++20
+{
+public:
+    typedef void*                                 pointer;
+    typedef const void*                           const_pointer;
+    typedef void                                  value_type;
+
+    template <class _Up> struct rebind {typedef allocator<_Up> other;};
+};
+
+template <class T>
+class allocator
+{
+public:
+    typedef size_t    size_type;
+    typedef ptrdiff_t difference_type;
+    typedef T*        pointer;                           // deprecated in C++17, removed in C++20
+    typedef const T*  const_pointer;                     // deprecated in C++17, removed in C++20
+    typedef typename add_lvalue_reference<T>::type
+                      reference;                         // deprecated in C++17, removed in C++20
+    typedef typename add_lvalue_reference<const T>::type
+                      const_reference;                   // deprecated in C++17, removed in C++20
+
+    typedef T         value_type;
+
+    template <class U> struct rebind {typedef allocator<U> other;}; // deprecated in C++17, removed in C++20
+
+    typedef true_type propagate_on_container_move_assignment;
+    typedef true_type is_always_equal;
+
+    constexpr allocator() noexcept;                      // constexpr in C++20
+    constexpr allocator(const allocator&) noexcept;      // constexpr in C++20
+    template <class U>
+      constexpr allocator(const allocator<U>&) noexcept; // constexpr in C++20
+    ~allocator();                                        // constexpr in C++20
+    pointer address(reference x) const noexcept;             // deprecated in C++17, removed in C++20
+    const_pointer address(const_reference x) const noexcept; // deprecated in C++17, removed in C++20
+    T* allocate(size_t n, const void* hint);          // deprecated in C++17, removed in C++20
+    T* allocate(size_t n);                              // constexpr in C++20
+    void deallocate(T* p, size_t n) noexcept;           // constexpr in C++20
+    size_type max_size() const noexcept;              // deprecated in C++17, removed in C++20
+    template<class U, class... Args>
+        void construct(U* p, Args&&... args);         // deprecated in C++17, removed in C++20
+    template <class U>
+        void destroy(U* p);                           // deprecated in C++17, removed in C++20
+};
+
+template <class T, class U>
+bool operator==(const allocator<T>&, const allocator<U>&) noexcept; // constexpr in C++20
+
+template <class T, class U>
+bool operator!=(const allocator<T>&, const allocator<U>&) noexcept; // constexpr in C++20
+
+template <class OutputIterator, class T>
+class raw_storage_iterator // deprecated in C++17, removed in C++20
+    : public iterator<output_iterator_tag, void, void, void, void> // until C++17
+{
+public:
+    typedef output_iterator_tag iterator_category;
+    typedef void                value_type;
+    typedef void                difference_type; // until C++20
+    typedef ptrdiff_t           difference_type; // since C++20
+    typedef void                pointer;
+    typedef void                reference;
+
+    explicit raw_storage_iterator(OutputIterator x);
+    raw_storage_iterator& operator*();
+    raw_storage_iterator& operator=(const T& element);
+    raw_storage_iterator& operator++();
+    raw_storage_iterator  operator++(int);
+};
+
+template <class T> pair<T*,ptrdiff_t> get_temporary_buffer(ptrdiff_t n) noexcept;
+template <class T> void               return_temporary_buffer(T* p) noexcept;
+
+template <class T> T* addressof(T& r) noexcept;
+template <class T> T* addressof(const T&& r) noexcept = delete;
+
+template <class InputIterator, class ForwardIterator>
+ForwardIterator
+uninitialized_copy(InputIterator first, InputIterator last, ForwardIterator result);
+
+namespace ranges {
+
+template<class InputIterator, class OutputIterator>
+using uninitialized_copy_result = in_out_result<InputIterator, OutputIterator>; // since C++20
+
+template<input_iterator InputIterator, sentinel-for<InputIterator> Sentinel1, nothrow-forward-iterator OutputIterator, nothrow-sentinel-for<OutputIterator> Sentinel2>
+  requires constructible_from<iter_value_t<OutputIterator>, iter_reference_t<InputIterator>>
+uninitialized_copy_result<InputIterator, OutputIterator>
+uninitialized_copy(InputIterator ifirst, Sentinel1 ilast, OutputIterator ofirst, Sentinel2 olast); // since C++20
+
+template<input_range InputRange, nothrow-forward-range OutputRange>
+  requires constructible_from<range_value_t<OutputRange>, range_reference_t<InputRange>>
+uninitialized_copy_result<borrowed_iterator_t<InputRange>, borrowed_iterator_t<OutputRange>>
+uninitialized_copy(InputRange&& in_range, OutputRange&& out_range); // since C++20
+
+}
+
+template <class InputIterator, class Size, class ForwardIterator>
+ForwardIterator
+uninitialized_copy_n(InputIterator first, Size n, ForwardIterator result);
+
+namespace ranges {
+
+template<class InputIterator, class OutputIterator>
+using uninitialized_copy_n_result = in_out_result<InputIterator, OutputIterator>; // since C++20
+
+template<input_iterator InputIterator, nothrow-forward-iterator OutputIterator, nothrow-sentinel-for<OutputIterator> Sentinel>
+  requires constructible_from<iter_value_t<OutputIterator>, iter_reference_t<InputIterator>>
+uninitialized_copy_n_result<InputIterator, OutputIterator>
+uninitialized_copy_n(InputIterator ifirst, iter_difference_t<InputIterator> n, OutputIterator ofirst, Sentinel olast); // since C++20
+
+}
+
+template <class ForwardIterator, class T>
+void uninitialized_fill(ForwardIterator first, ForwardIterator last, const T& x);
+
+namespace ranges {
+
+template <nothrow-forward-iterator ForwardIterator, nothrow-sentinel-for<ForwardIterator> Sentinel, class T>
+  requires constructible_from<iter_value_t<ForwardIterator>, const T&>
+ForwardIterator uninitialized_fill(ForwardIterator first, Sentinel last, const T& x); // since C++20
+
+template <nothrow-forward-range ForwardRange, class T>
+  requires constructible_from<range_value_t<ForwardRange>, const T&>
+borrowed_iterator_t<ForwardRange> uninitialized_fill(ForwardRange&& range, const T& x); // since C++20
+
+}
+
+template <class ForwardIterator, class Size, class T>
+ForwardIterator
+uninitialized_fill_n(ForwardIterator first, Size n, const T& x);
+
+namespace ranges {
+
+template <nothrow-forward-iterator ForwardIterator, class T>
+  requires constructible_from<iter_value_t<ForwardIterator>, const T&>
+ForwardIterator uninitialized_fill_n(ForwardIterator first, iter_difference_t<ForwardIterator> n); // since C++20
+
+}
+
+template <class T, class ...Args>
+constexpr T* construct_at(T* location, Args&& ...args); // since C++20
+
+namespace ranges {
+  template<class T, class... Args>
+    constexpr T* construct_at(T* location, Args&&... args); // since C++20
+}
+
+template <class T>
+void destroy_at(T* location); // constexpr in C++20
+
+namespace ranges {
+  template<destructible T>
+    constexpr void destroy_at(T* location) noexcept; // since C++20
+}
+
+template <class ForwardIterator>
+void destroy(ForwardIterator first, ForwardIterator last); // constexpr in C++20
+
+namespace ranges {
+  template<nothrow-input-iterator InputIterator, nothrow-sentinel-for<InputIterator> Sentinel>
+    requires destructible<iter_value_t<InputIterator>>
+    constexpr InputIterator destroy(InputIterator first, Sentinel last) noexcept; // since C++20
+  template<nothrow-input-range InputRange>
+    requires destructible<range_value_t<InputRange>>
+    constexpr borrowed_iterator_t<InputRange> destroy(InputRange&& range) noexcept; // since C++20
+}
+
+template <class ForwardIterator, class Size>
+ForwardIterator destroy_n(ForwardIterator first, Size n); // constexpr in C++20
+
+namespace ranges {
+  template<nothrow-input-iterator InputIterator>
+    requires destructible<iter_value_t<InputIterator>>
+    constexpr InputIterator destroy_n(InputIterator first, iter_difference_t<InputIterator> n) noexcept; // since C++20
+}
+
+template <class InputIterator, class ForwardIterator>
+ ForwardIterator uninitialized_move(InputIterator first, InputIterator last, ForwardIterator result);
+
+namespace ranges {
+
+template<class InputIterator, class OutputIterator>
+using uninitialized_move_result = in_out_result<InputIterator, OutputIterator>; // since C++20
+
+template <input_iterator InputIterator, sentinel_for<InputIterator> Sentinel1, nothrow-forward-iterator OutputIterator, nothrow-sentinel-for<O> Sentinel2>
+  requires constructible_from<iter_value_t<OutputIterator>, iter_rvalue_reference_t<InputIterator>>
+uninitialized_move_result<InputIterator, OutputIterator>
+uninitialized_move(InputIterator ifirst, Sentinel1 ilast, OutputIterator ofirst, Sentinel2 olast); // since C++20
+
+template<input_range InputRange, nothrow-forward-range OutputRange>
+  requires constructible_from<range_value_t<OutputRange>, range_rvalue_reference_t<InputRange>>
+uninitialized_move_result<borrowed_iterator_t<InputRange>, borrowed_iterator_t<OutputRange>>
+uninitialized_move(InputRange&& in_range, OutputRange&& out_range); // since C++20
+
+}
+
+template <class InputIterator, class Size, class ForwardIterator>
+ pair<InputIterator,ForwardIterator> uninitialized_move_n(InputIterator first, Size n, ForwardIterator result);
+
+namespace ranges {
+
+template<class InputIterator, class OutputIterator>
+using uninitialized_move_n_result = in_out_result<InputIterator, OutputIterator>; // since C++20
+
+template<input_iterator InputIterator, nothrow-forward-iterator OutputIterator, nothrow-sentinel-for<OutputIterator> Sentinel>
+  requires constructible_from<iter_value_t<OutputIterator>, iter_rvalue_reference_t<InputIterator>>
+uninitialized_move_n_result<InputIterator, OutputIterator>
+uninitialized_move_n(InputIterator ifirst, iter_difference_t<InputIterator> n, OutputIterator ofirst, Sentinel olast); // since C++20
+
+}
+
+template <class ForwardIterator>
+ void uninitialized_value_construct(ForwardIterator first, ForwardIterator last);
+
+namespace ranges {
+
+template <nothrow-forward-iterator ForwardIterator, nothrow-sentinel-for<ForwardIterator> Sentinel>
+  requires default_initializable<iter_value_t<ForwardIterator>>
+ ForwardIterator uninitialized_value_construct(ForwardIterator first, Sentinel last); // since C++20
+
+template <nothrow-forward-range ForwardRange>
+  requires default_initializable<range_value_t<ForwardRange>>
+ borrowed_iterator_t<ForwardRange> uninitialized_value_construct(ForwardRange&& r); // since C++20
+
+}
+
+template <class ForwardIterator, class Size>
+ ForwardIterator uninitialized_value_construct_n(ForwardIterator first, Size n);
+
+namespace ranges {
+
+template <nothrow-forward-iterator ForwardIterator>
+  requires default_initializable<iter_value_t<ForwardIterator>>
+ ForwardIterator uninitialized_value_construct_n(ForwardIterator first, iter_difference_t<ForwardIterator> n); // since C++20
+
+}
+
+template <class ForwardIterator>
+ void uninitialized_default_construct(ForwardIterator first, ForwardIterator last);
+
+namespace ranges {
+
+template <nothrow-forward-iterator ForwardIterator, nothrow-sentinel-for<ForwardIterator> Sentinel>
+  requires default_initializable<iter_value_t<ForwardIterator>>
+ ForwardIterator uninitialized_default_construct(ForwardIterator first, Sentinel last); // since C++20
+
+template <nothrow-forward-range ForwardRange>
+  requires default_initializable<range_value_t<ForwardRange>>
+ borrowed_iterator_t<ForwardRange> uninitialized_default_construct(ForwardRange&& r); // since C++20
+
+}
+
+template <class ForwardIterator, class Size>
+ ForwardIterator uninitialized_default_construct_n(ForwardIterator first, Size n);
+
+namespace ranges {
+
+template <nothrow-forward-iterator ForwardIterator>
+  requires default_initializable<iter_value_t<ForwardIterator>>
+ ForwardIterator uninitialized_default_construct_n(ForwardIterator first, iter_difference_t<ForwardIterator> n); // since C++20
+
+}
+
+template <class Y> struct auto_ptr_ref {};      // deprecated in C++11, removed in C++17
+
+template<class X>
+class auto_ptr                                  // deprecated in C++11, removed in C++17
+{
+public:
+    typedef X element_type;
+
+    explicit auto_ptr(X* p =0) throw();
+    auto_ptr(auto_ptr&) throw();
+    template<class Y> auto_ptr(auto_ptr<Y>&) throw();
+    auto_ptr& operator=(auto_ptr&) throw();
+    template<class Y> auto_ptr& operator=(auto_ptr<Y>&) throw();
+    auto_ptr& operator=(auto_ptr_ref<X> r) throw();
+    ~auto_ptr() throw();
+
+    typename add_lvalue_reference<X>::type operator*() const throw();
+    X* operator->() const throw();
+    X* get() const throw();
+    X* release() throw();
+    void reset(X* p =0) throw();
+
+    auto_ptr(auto_ptr_ref<X>) throw();
+    template<class Y> operator auto_ptr_ref<Y>() throw();
+    template<class Y> operator auto_ptr<Y>() throw();
+};
+
+template <class T>
+struct default_delete
+{
+    constexpr default_delete() noexcept = default;
+    template <class U> constexpr default_delete(const default_delete<U>&) noexcept; // constexpr since C++23
+
+    constexpr void operator()(T*) const noexcept;                                   // constexpr since C++23
+};
+
+template <class T>
+struct default_delete<T[]>
+{
+    constexpr default_delete() noexcept = default;
+    template <class U> constexpr default_delete(const default_delete <U[]>&) noexcept; // constexpr since C++23
+    constexpr void operator()(T*) const noexcept;                                      // constexpr since C++23
+    template <class U> void operator()(U*) const = delete;
+};
+
+template <class T, class D = default_delete<T>>
+class unique_ptr
+{
+public:
+    typedef see below pointer;
+    typedef T element_type;
+    typedef D deleter_type;
+
+    // constructors
+    constexpr unique_ptr() noexcept;
+    constexpr explicit unique_ptr(pointer p) noexcept;           // constexpr since C++23
+    constexpr unique_ptr(pointer p, see below d1) noexcept;      // constexpr since C++23
+    constexpr unique_ptr(pointer p, see below d2) noexcept;      // constexpr since C++23
+    constexpr unique_ptr(unique_ptr&& u) noexcept;               // constexpr since C++23
+    constexpr unique_ptr(nullptr_t) noexcept : unique_ptr() { }
+    template <class U, class E>
+        constexpr unique_ptr(unique_ptr<U, E>&& u) noexcept;     // constexpr since C++23
+    template <class U>
+        unique_ptr(auto_ptr<U>&& u) noexcept;                    // removed in C++17
+
+    // destructor
+    constexpr ~unique_ptr();                                     // constexpr since C++23
+
+    // assignment
+    constexpr unique_ptr& operator=(unique_ptr&& u) noexcept;                         // constexpr since C++23
+    template <class U, class E>
+    constexpr unique_ptr& operator=(unique_ptr<U, E>&& u) noexcept;                   // constexpr since C++23
+    constexpr unique_ptr& operator=(nullptr_t) noexcept;                              // constexpr since C++23
+
+    // observers
+    typename constexpr add_lvalue_reference<T>::type operator*() const;               // constexpr since C++23
+    constexpr pointer operator->() const noexcept;                                    // constexpr since C++23
+    constexpr pointer get() const noexcept;                                           // constexpr since C++23
+    constexpr deleter_type& get_deleter() noexcept;                                   // constexpr since C++23
+    constexpr const deleter_type& get_deleter() const noexcept;                       // constexpr since C++23
+    constexpr explicit operator bool() const noexcept;                                // constexpr since C++23
+
+    // modifiers
+    constexpr pointer release() noexcept;                                             // constexpr since C++23
+    constexpr void reset(pointer p = pointer()) noexcept;                             // constexpr since C++23
+    constexpr void swap(unique_ptr& u) noexcept;                                      // constexpr since C++23
+};
+
+template <class T, class D>
+class unique_ptr<T[], D>
+{
+public:
+    typedef implementation-defined pointer;
+    typedef T element_type;
+    typedef D deleter_type;
+
+    // constructors
+    constexpr unique_ptr() noexcept;
+    constexpr explicit unique_ptr(pointer p) noexcept;          // constexpr since C++23
+    constexpr unique_ptr(pointer p, see below d) noexcept;      // constexpr since C++23
+    constexpr unique_ptr(pointer p, see below d) noexcept;      // constexpr since C++23
+    constexpr unique_ptr(unique_ptr&& u) noexcept;              // constexpr since C++23
+    template <class U, class E>
+    constexpr unique_ptr(unique_ptr <U, E>&& u) noexcept;       // constexpr since C++23
+    constexpr unique_ptr(nullptr_t) noexcept : unique_ptr() { }
+
+    // destructor
+    constexpr ~unique_ptr();                                    // constexpr since C++23
+
+    // assignment
+    constexpr unique_ptr& operator=(unique_ptr&& u) noexcept;        // constexpr since C++23
+    template <class U, class E>
+    constexpr unique_ptr& operator=(unique_ptr <U, E>&& u) noexcept; // constexpr since C++23
+    constexpr unique_ptr& operator=(nullptr_t) noexcept;             // constexpr since C++23
+
+    // observers
+    constexpr T& operator[](size_t i) const;                    // constexpr since C++23
+    constexpr pointer get() const noexcept;                     // constexpr since C++23
+    constexpr deleter_type& get_deleter() noexcept;             // constexpr since C++23
+    constexpr const deleter_type& get_deleter() const noexcept; // constexpr since C++23
+    constexpr explicit operator bool() const noexcept;          // constexpr since C++23
+
+    // modifiers
+    constexpr pointer release() noexcept;                       // constexpr since C++23
+    constexpr void reset(pointer p = pointer()) noexcept;       // constexpr since C++23
+    constexpr void reset(nullptr_t) noexcept;                   // constexpr since C++23
+  template <class U> void reset(U) = delete;
+    constexpr void swap(unique_ptr& u) noexcept;                // constexpr since C++23
+};
+
+template <class T, class D>
+    constexpr void swap(unique_ptr<T, D>& x, unique_ptr<T, D>& y) noexcept;                 // constexpr since C++23
+
+template <class T1, class D1, class T2, class D2>
+    constexpr bool operator==(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);    // constexpr since C++23
+template <class T1, class D1, class T2, class D2>
+    bool operator!=(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);              // removed in C++20
+template <class T1, class D1, class T2, class D2>
+    bool operator<(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);
+template <class T1, class D1, class T2, class D2>
+    bool operator<=(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);
+template <class T1, class D1, class T2, class D2>
+    bool operator>(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);
+template <class T1, class D1, class T2, class D2>
+    bool operator>=(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);
+template<class T1, class D1, class T2, class D2>
+  requires three_way_comparable_with<typename unique_ptr<T1, D1>::pointer,
+                                     typename unique_ptr<T2, D2>::pointer>
+  compare_three_way_result_t<typename unique_ptr<T1, D1>::pointer,
+                             typename unique_ptr<T2, D2>::pointer>
+    operator<=>(const unique_ptr<T1, D1>& x, const unique_ptr<T2, D2>& y);      // C++20
+
+template <class T, class D>
+    constexpr bool operator==(const unique_ptr<T, D>& x, nullptr_t) noexcept;   // constexpr since C++23
+template <class T, class D>
+    bool operator==(nullptr_t, const unique_ptr<T, D>& y) noexcept;             // removed in C++20
+template <class T, class D>
+    bool operator!=(const unique_ptr<T, D>& x, nullptr_t) noexcept;             // removed in C++20
+template <class T, class D>
+    bool operator!=(nullptr_t, const unique_ptr<T, D>& y) noexcept;             // removed in C++20
+
+template <class T, class D>
+    constexpr bool operator<(const unique_ptr<T, D>& x, nullptr_t);     // constexpr since C++23
+template <class T, class D>
+    constexpr bool operator<(nullptr_t, const unique_ptr<T, D>& y);     // constexpr since C++23
+template <class T, class D>
+    constexpr bool operator<=(const unique_ptr<T, D>& x, nullptr_t);    // constexpr since C++23
+template <class T, class D>
+    constexpr bool operator<=(nullptr_t, const unique_ptr<T, D>& y);    // constexpr since C++23
+template <class T, class D>
+    constexpr bool operator>(const unique_ptr<T, D>& x, nullptr_t);     // constexpr since C++23
+template <class T, class D>
+    constexpr bool operator>(nullptr_t, const unique_ptr<T, D>& y);     // constexpr since C++23
+template <class T, class D>
+    constexpr bool operator>=(const unique_ptr<T, D>& x, nullptr_t);    // constexpr since C++23
+template <class T, class D>
+    constexpr bool operator>=(nullptr_t, const unique_ptr<T, D>& y);    // constexpr since C++23
+template<class T, class D>
+  requires three_way_comparable<typename unique_ptr<T, D>::pointer>
+  compare_three_way_result_t<typename unique_ptr<T, D>::pointer>
+    constexpr operator<=>(const unique_ptr<T, D>& x, nullptr_t);        // C++20, constexpr since C++23
+
+class bad_weak_ptr
+    : public std::exception
+{
+    bad_weak_ptr() noexcept;
+};
+
+template<class T, class... Args>
+constexpr unique_ptr<T> make_unique(Args&&... args);                            // C++14, constexpr since C++23
+template<class T>
+constexpr unique_ptr<T> make_unique(size_t n);                                  // C++14, constexpr since C++23
+template<class T, class... Args> unspecified   make_unique(Args&&...) = delete; // C++14, T == U[N]
+
+template<class T>
+  constexpr unique_ptr<T> make_unique_for_overwrite();                        // T is not array, C++20, constexpr since C++23
+template<class T>
+  constexpr unique_ptr<T> make_unique_for_overwrite(size_t n);                // T is U[], C++20, constexpr since C++23
+template<class T, class... Args>
+  unspecified make_unique_for_overwrite(Args&&...) = delete;                  // T is U[N], C++20
+
+template<class E, class T, class Y, class D>
+    basic_ostream<E, T>& operator<< (basic_ostream<E, T>& os, unique_ptr<Y, D> const& p);
+
+template<class T>
+class shared_ptr
+{
+public:
+    typedef T element_type; // until C++17
+    typedef remove_extent_t<T> element_type; // since C++17
+    typedef weak_ptr<T> weak_type; // C++17
+
+    // constructors:
+    constexpr shared_ptr() noexcept;
+    template<class Y> explicit shared_ptr(Y* p);
+    template<class Y, class D> shared_ptr(Y* p, D d);
+    template<class Y, class D, class A> shared_ptr(Y* p, D d, A a);
+    template <class D> shared_ptr(nullptr_t p, D d);
+    template <class D, class A> shared_ptr(nullptr_t p, D d, A a);
+    template<class Y> shared_ptr(const shared_ptr<Y>& r, T *p) noexcept;
+    shared_ptr(const shared_ptr& r) noexcept;
+    template<class Y> shared_ptr(const shared_ptr<Y>& r) noexcept;
+    shared_ptr(shared_ptr&& r) noexcept;
+    template<class Y> shared_ptr(shared_ptr<Y>&& r) noexcept;
+    template<class Y> explicit shared_ptr(const weak_ptr<Y>& r);
+    template<class Y> shared_ptr(auto_ptr<Y>&& r);          // removed in C++17
+    template <class Y, class D> shared_ptr(unique_ptr<Y, D>&& r);
+    shared_ptr(nullptr_t) : shared_ptr() { }
+
+    // destructor:
+    ~shared_ptr();
+
+    // assignment:
+    shared_ptr& operator=(const shared_ptr& r) noexcept;
+    template<class Y> shared_ptr& operator=(const shared_ptr<Y>& r) noexcept;
+    shared_ptr& operator=(shared_ptr&& r) noexcept;
+    template<class Y> shared_ptr& operator=(shared_ptr<Y>&& r);
+    template<class Y> shared_ptr& operator=(auto_ptr<Y>&& r); // removed in C++17
+    template <class Y, class D> shared_ptr& operator=(unique_ptr<Y, D>&& r);
+
+    // modifiers:
+    void swap(shared_ptr& r) noexcept;
+    void reset() noexcept;
+    template<class Y> void reset(Y* p);
+    template<class Y, class D> void reset(Y* p, D d);
+    template<class Y, class D, class A> void reset(Y* p, D d, A a);
+
+    // observers:
+    T* get() const noexcept;
+    T& operator*() const noexcept;
+    T* operator->() const noexcept;
+    long use_count() const noexcept;
+    bool unique() const noexcept;
+    explicit operator bool() const noexcept;
+    template<class U> bool owner_before(shared_ptr<U> const& b) const noexcept;
+    template<class U> bool owner_before(weak_ptr<U> const& b) const noexcept;
+};
+
+template<class T>
+shared_ptr(weak_ptr<T>) -> shared_ptr<T>;
+template<class T, class D>
+shared_ptr(unique_ptr<T, D>) -> shared_ptr<T>;
+
+// shared_ptr comparisons:
+template<class T, class U>
+    bool operator==(shared_ptr<T> const& a, shared_ptr<U> const& b) noexcept;
+template<class T, class U>
+    bool operator!=(shared_ptr<T> const& a, shared_ptr<U> const& b) noexcept;               // removed in C++20
+template<class T, class U>
+    bool operator<(shared_ptr<T> const& a, shared_ptr<U> const& b) noexcept;                // removed in C++20
+template<class T, class U>
+    bool operator>(shared_ptr<T> const& a, shared_ptr<U> const& b) noexcept;                // removed in C++20
+template<class T, class U>
+    bool operator<=(shared_ptr<T> const& a, shared_ptr<U> const& b) noexcept;               // removed in C++20
+template<class T, class U>
+    bool operator>=(shared_ptr<T> const& a, shared_ptr<U> const& b) noexcept;               // removed in C++20
+template<class T, class U>
+    strong_ordering operator<=>(shared_ptr<T> const& a, shared_ptr<U> const& b) noexcept;   // C++20
+
+template <class T>
+    bool operator==(const shared_ptr<T>& x, nullptr_t) noexcept;
+template <class T>
+    bool operator==(nullptr_t, const shared_ptr<T>& y) noexcept;               // removed in C++20
+template <class T>
+    bool operator!=(const shared_ptr<T>& x, nullptr_t) noexcept;               // removed in C++20
+template <class T>
+    bool operator!=(nullptr_t, const shared_ptr<T>& y) noexcept;               // removed in C++20
+template <class T>
+    bool operator<(const shared_ptr<T>& x, nullptr_t) noexcept;                // removed in C++20
+template <class T>
+    bool operator<(nullptr_t, const shared_ptr<T>& y) noexcept;                // removed in C++20
+template <class T>
+    bool operator<=(const shared_ptr<T>& x, nullptr_t) noexcept;               // removed in C++20
+template <class T>
+    bool operator<=(nullptr_t, const shared_ptr<T>& y) noexcept;               // removed in C++20
+template <class T>
+    bool operator>(const shared_ptr<T>& x, nullptr_t) noexcept;                // removed in C++20
+template <class T>
+    bool operator>(nullptr_t, const shared_ptr<T>& y) noexcept;                // removed in C++20
+template <class T>
+    bool operator>=(const shared_ptr<T>& x, nullptr_t) noexcept;               // removed in C++20
+template <class T>
+    bool operator>=(nullptr_t, const shared_ptr<T>& y) noexcept;               // removed in C++20
+template<class T>
+    strong_ordering operator<=>(shared_ptr<T> const& x, nullptr_t) noexcept;   // C++20
+
+// shared_ptr specialized algorithms:
+template<class T> void swap(shared_ptr<T>& a, shared_ptr<T>& b) noexcept;
+
+// shared_ptr casts:
+template<class T, class U>
+    shared_ptr<T> static_pointer_cast(shared_ptr<U> const& r) noexcept;
+template<class T, class U>
+    shared_ptr<T> dynamic_pointer_cast(shared_ptr<U> const& r) noexcept;
+template<class T, class U>
+    shared_ptr<T> const_pointer_cast(shared_ptr<U> const& r) noexcept;
+
+// shared_ptr I/O:
+template<class E, class T, class Y>
+    basic_ostream<E, T>& operator<< (basic_ostream<E, T>& os, shared_ptr<Y> const& p);
+
+// shared_ptr get_deleter:
+template<class D, class T> D* get_deleter(shared_ptr<T> const& p) noexcept;
+
+template<class T, class... Args>
+    shared_ptr<T> make_shared(Args&&... args); // T is not an array
+template<class T, class A, class... Args>
+    shared_ptr<T> allocate_shared(const A& a, Args&&... args); // T is not an array
+
+template<class T>
+    shared_ptr<T> make_shared(size_t N); // T is U[] (since C++20)
+template<class T, class A>
+    shared_ptr<T> allocate_shared(const A& a, size_t N); // T is U[] (since C++20)
+
+template<class T>
+    shared_ptr<T> make_shared(); // T is U[N] (since C++20)
+template<class T, class A>
+    shared_ptr<T> allocate_shared(const A& a); // T is U[N] (since C++20)
+
+template<class T>
+    shared_ptr<T> make_shared(size_t N, const remove_extent_t<T>& u); // T is U[] (since C++20)
+template<class T, class A>
+    shared_ptr<T> allocate_shared(const A& a, size_t N, const remove_extent_t<T>& u); // T is U[] (since C++20)
+
+template<class T> shared_ptr<T>
+    make_shared(const remove_extent_t<T>& u); // T is U[N] (since C++20)
+template<class T, class A>
+    shared_ptr<T> allocate_shared(const A& a, const remove_extent_t<T>& u); // T is U[N] (since C++20)
+
+template<class T>
+  shared_ptr<T> make_shared_for_overwrite();                                  // T is not U[], C++20
+template<class T, class A>
+  shared_ptr<T> allocate_shared_for_overwrite(const A& a);                    // T is not U[], C++20
+
+template<class T>
+  shared_ptr<T> make_shared_for_overwrite(size_t N);                          // T is U[], C++20
+template<class T, class A>
+  shared_ptr<T> allocate_shared_for_overwrite(const A& a, size_t N);          // T is U[], C++20
+
+template<class T>
+class weak_ptr
+{
+public:
+    typedef T element_type; // until C++17
+    typedef remove_extent_t<T> element_type; // since C++17
+
+    // constructors
+    constexpr weak_ptr() noexcept;
+    template<class Y> weak_ptr(shared_ptr<Y> const& r) noexcept;
+    weak_ptr(weak_ptr const& r) noexcept;
+    template<class Y> weak_ptr(weak_ptr<Y> const& r) noexcept;
+    weak_ptr(weak_ptr&& r) noexcept;                      // C++14
+    template<class Y> weak_ptr(weak_ptr<Y>&& r) noexcept; // C++14
+
+    // destructor
+    ~weak_ptr();
+
+    // assignment
+    weak_ptr& operator=(weak_ptr const& r) noexcept;
+    template<class Y> weak_ptr& operator=(weak_ptr<Y> const& r) noexcept;
+    template<class Y> weak_ptr& operator=(shared_ptr<Y> const& r) noexcept;
+    weak_ptr& operator=(weak_ptr&& r) noexcept;                      // C++14
+    template<class Y> weak_ptr& operator=(weak_ptr<Y>&& r) noexcept; // C++14
+
+    // modifiers
+    void swap(weak_ptr& r) noexcept;
+    void reset() noexcept;
+
+    // observers
+    long use_count() const noexcept;
+    bool expired() const noexcept;
+    shared_ptr<T> lock() const noexcept;
+    template<class U> bool owner_before(shared_ptr<U> const& b) const noexcept;
+    template<class U> bool owner_before(weak_ptr<U> const& b) const noexcept;
+};
+
+template<class T>
+weak_ptr(shared_ptr<T>) -> weak_ptr<T>;
+
+// weak_ptr specialized algorithms:
+template<class T> void swap(weak_ptr<T>& a, weak_ptr<T>& b) noexcept;
+
+// class owner_less:
+template<class T> struct owner_less;
+
+template<class T>
+struct owner_less<shared_ptr<T> >
+    : binary_function<shared_ptr<T>, shared_ptr<T>, bool>
+{
+    typedef bool result_type;
+    bool operator()(shared_ptr<T> const&, shared_ptr<T> const&) const noexcept;
+    bool operator()(shared_ptr<T> const&, weak_ptr<T> const&) const noexcept;
+    bool operator()(weak_ptr<T> const&, shared_ptr<T> const&) const noexcept;
+};
+
+template<class T>
+struct owner_less<weak_ptr<T> >
+    : binary_function<weak_ptr<T>, weak_ptr<T>, bool>
+{
+    typedef bool result_type;
+    bool operator()(weak_ptr<T> const&, weak_ptr<T> const&) const noexcept;
+    bool operator()(shared_ptr<T> const&, weak_ptr<T> const&) const noexcept;
+    bool operator()(weak_ptr<T> const&, shared_ptr<T> const&) const noexcept;
+};
+
+template <>  // Added in C++14
+struct owner_less<void>
+{
+    template <class _Tp, class _Up>
+    bool operator()( shared_ptr<_Tp> const& __x, shared_ptr<_Up> const& __y) const noexcept;
+    template <class _Tp, class _Up>
+    bool operator()( shared_ptr<_Tp> const& __x,   weak_ptr<_Up> const& __y) const noexcept;
+    template <class _Tp, class _Up>
+    bool operator()(   weak_ptr<_Tp> const& __x, shared_ptr<_Up> const& __y) const noexcept;
+    template <class _Tp, class _Up>
+    bool operator()(   weak_ptr<_Tp> const& __x,   weak_ptr<_Up> const& __y) const noexcept;
+
+    typedef void is_transparent;
+};
+
+template<class T>
+class enable_shared_from_this
+{
+protected:
+    constexpr enable_shared_from_this() noexcept;
+    enable_shared_from_this(enable_shared_from_this const&) noexcept;
+    enable_shared_from_this& operator=(enable_shared_from_this const&) noexcept;
+    ~enable_shared_from_this();
+public:
+    shared_ptr<T> shared_from_this();
+    shared_ptr<T const> shared_from_this() const;
+};
+
+template<class T>
+    bool atomic_is_lock_free(const shared_ptr<T>* p);
+template<class T>
+    shared_ptr<T> atomic_load(const shared_ptr<T>* p);
+template<class T>
+    shared_ptr<T> atomic_load_explicit(const shared_ptr<T>* p, memory_order mo);
+template<class T>
+    void atomic_store(shared_ptr<T>* p, shared_ptr<T> r);
+template<class T>
+    void atomic_store_explicit(shared_ptr<T>* p, shared_ptr<T> r, memory_order mo);
+template<class T>
+    shared_ptr<T> atomic_exchange(shared_ptr<T>* p, shared_ptr<T> r);
+template<class T>
+    shared_ptr<T>
+    atomic_exchange_explicit(shared_ptr<T>* p, shared_ptr<T> r, memory_order mo);
+template<class T>
+    bool
+    atomic_compare_exchange_weak(shared_ptr<T>* p, shared_ptr<T>* v, shared_ptr<T> w);
+template<class T>
+    bool
+    atomic_compare_exchange_strong( shared_ptr<T>* p, shared_ptr<T>* v, shared_ptr<T> w);
+template<class T>
+    bool
+    atomic_compare_exchange_weak_explicit(shared_ptr<T>* p, shared_ptr<T>* v,
+                                          shared_ptr<T> w, memory_order success,
+                                          memory_order failure);
+template<class T>
+    bool
+    atomic_compare_exchange_strong_explicit(shared_ptr<T>* p, shared_ptr<T>* v,
+                                            shared_ptr<T> w, memory_order success,
+                                            memory_order failure);
+// Hash support
+template <class T> struct hash;
+template <class T, class D> struct hash<unique_ptr<T, D> >;
+template <class T> struct hash<shared_ptr<T> >;
+
+template <class T, class Alloc>
+  inline constexpr bool uses_allocator_v = uses_allocator<T, Alloc>::value;
+
+// [ptr.align]
+void* align(size_t alignment, size_t size, void*& ptr, size_t& space);
+
+template<size_t N, class T>
+[[nodiscard]] constexpr T* assume_aligned(T* ptr); // since C++20
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__memory/addressof.h>
+#include <__memory/align.h>
+#include <__memory/allocate_at_least.h>
+#include <__memory/allocation_guard.h>
+#include <__memory/allocator.h>
+#include <__memory/allocator_arg_t.h>
+#include <__memory/allocator_traits.h>
+#include <__memory/assume_aligned.h>
+#include <__memory/auto_ptr.h>
+#include <__memory/compressed_pair.h>
+#include <__memory/concepts.h>
+#include <__memory/construct_at.h>
+#include <__memory/pointer_traits.h>
+#include <__memory/ranges_construct_at.h>
+#include <__memory/ranges_uninitialized_algorithms.h>
+#include <__memory/raw_storage_iterator.h>
+#include <__memory/shared_ptr.h>
+#include <__memory/temporary_buffer.h>
+#include <__memory/uninitialized_algorithms.h>
+#include <__memory/unique_ptr.h>
+#include <__memory/uses_allocator.h>
+#include <__memory/uses_allocator_construction.h>
+#include <version>
+
+// standard-mandated includes
+
+// [memory.syn]
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17
+#   include <__pstl_memory>
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <cstddef>
+#  include <cstdint>
+#  include <cstring>
+#  include <iosfwd>
+#  include <iterator>
+#  include <new>
+#  include <stdexcept>
+#  include <tuple>
+#  include <type_traits>
+#  include <typeinfo>
+#  include <utility>
+#endif
+
+#endif // _LIBCPP_MEMORY
diff --git a/app/src/main/cpp/libcxx/include/memory_resource b/app/src/main/cpp/libcxx/include/memory_resource
new file mode 100644
index 0000000..4b39343
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/memory_resource
@@ -0,0 +1,65 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_MEMORY_RESOURCE
+#define _LIBCPP_MEMORY_RESOURCE
+
+/**
+    memory_resource synopsis
+
+// C++17
+
+namespace std::pmr {
+
+  class memory_resource;
+
+  bool operator==(const memory_resource& a,
+                  const memory_resource& b) noexcept;
+  bool operator!=(const memory_resource& a,
+                  const memory_resource& b) noexcept;
+
+  template <class Tp> class polymorphic_allocator;
+
+  template <class T1, class T2>
+  bool operator==(const polymorphic_allocator<T1>& a,
+                  const polymorphic_allocator<T2>& b) noexcept;
+  template <class T1, class T2>
+  bool operator!=(const polymorphic_allocator<T1>& a,
+                  const polymorphic_allocator<T2>& b) noexcept;
+
+  // Global memory resources
+  memory_resource* set_default_resource(memory_resource* r) noexcept;
+  memory_resource* get_default_resource() noexcept;
+  memory_resource* new_delete_resource() noexcept;
+  memory_resource* null_memory_resource() noexcept;
+
+  // Pool resource classes
+  struct pool_options;
+  class synchronized_pool_resource;
+  class unsynchronized_pool_resource;
+  class monotonic_buffer_resource;
+
+} // namespace std::pmr
+
+ */
+
+#include <__config>
+#include <__memory_resource/memory_resource.h>
+#include <__memory_resource/monotonic_buffer_resource.h>
+#include <__memory_resource/polymorphic_allocator.h>
+#include <__memory_resource/pool_options.h>
+#include <__memory_resource/synchronized_pool_resource.h>
+#include <__memory_resource/unsynchronized_pool_resource.h>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif /* _LIBCPP_MEMORY_RESOURCE */
diff --git a/app/src/main/cpp/libcxx/include/module.modulemap.in b/app/src/main/cpp/libcxx/include/module.modulemap.in
new file mode 100644
index 0000000..1f1d67d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/module.modulemap.in
@@ -0,0 +1,1724 @@
+// define the module for __config outside of the top level 'std' module
+// since __config may be included from C headers which may create an
+// include cycle.
+module std_config [system] [extern_c] {
+  header "__config"
+  export *
+}
+
+module std [system] {
+  export std_config
+  // FIXME: The standard does not require that each of these submodules
+  // re-exports its imported modules. We should provide an alternative form of
+  // export that issues a warning if a name from the submodule is used, and
+  // use that to provide a 'strict mode' for libc++.
+
+  // Deprecated C-compatibility headers. These can all be included from within
+  // an 'extern "C"' context.
+  module depr [extern_c] {
+    // <assert.h> provided by C library.
+    module ctype_h {
+      header "ctype.h"
+      export *
+    }
+    module errno_h {
+      header "errno.h"
+      export *
+    }
+    module fenv_h {
+      header "fenv.h"
+      export *
+    }
+    // <float.h> provided by compiler or C library.
+    module inttypes_h {
+      header "inttypes.h"
+      export stdint_h
+      export *
+    }
+    // <iso646.h> provided by compiler.
+    // <limits.h> provided by compiler or C library.
+    module locale_h {
+      @requires_LIBCXX_ENABLE_LOCALIZATION@
+      header "locale.h"
+      export *
+    }
+    module math_h {
+      header "math.h"
+      export *
+    }
+    module setjmp_h {
+      header "setjmp.h"
+      export *
+    }
+    module stdatomic_h {
+      @requires_LIBCXX_ENABLE_THREADS@
+      requires cplusplus23
+      header "stdatomic.h"
+      export *
+    }
+    // FIXME: <stdalign.h> is missing.
+    // <signal.h> provided by C library.
+    // <stdarg.h> provided by compiler.
+    module stdbool_h {
+      // <stdbool.h>'s __bool_true_false_are_defined macro requires textual inclusion.
+      textual header "stdbool.h"
+    }
+    module stddef_h {
+      // <stddef.h>'s __need_* macros require textual inclusion.
+      textual header "stddef.h"
+    }
+    module stdint_h {
+      header "stdint.h"
+      export *
+      // FIXME: This module only exists on OS X and for some reason the
+      // wildcard above doesn't export it.
+      export Darwin.C.stdint
+    }
+    module stdio_h {
+      // <stdio.h>'s __need_* macros require textual inclusion.
+      textual header "stdio.h"
+      export *
+      export Darwin.C.stdio
+    }
+    module stdlib_h {
+      // <stdlib.h>'s __need_* macros require textual inclusion.
+      textual header "stdlib.h"
+      export *
+    }
+    module string_h {
+      header "string.h"
+      export *
+    }
+    module uchar_h {
+      header "uchar.h"
+      export *
+    }
+    // <time.h> provided by C library.
+    module wchar_h {
+      @requires_LIBCXX_ENABLE_WIDE_CHARACTERS@
+      // <wchar.h>'s __need_* macros require textual inclusion.
+      textual header "wchar.h"
+      export *
+    }
+    module wctype_h {
+      @requires_LIBCXX_ENABLE_WIDE_CHARACTERS@
+      header "wctype.h"
+      export *
+    }
+  }
+
+  // <complex.h> and <tgmath.h> are not C headers in any real sense, do not
+  // allow their use in extern "C" contexts.
+  module complex_h {
+    header "complex.h"
+    export ccomplex
+    export *
+  }
+  module tgmath_h {
+    header "tgmath.h"
+    export ccomplex
+    export cmath
+    export *
+  }
+
+  // C compatibility headers.
+  module compat {
+    module cassert {
+      // <cassert>'s use of NDEBUG requires textual inclusion.
+      textual header "cassert"
+    }
+    module ccomplex {
+      header "ccomplex"
+      export complex
+      export *
+    }
+    module cctype {
+      header "cctype"
+      export *
+    }
+    module cerrno {
+      header "cerrno"
+      export *
+    }
+    module cfenv {
+      header "cfenv"
+      export *
+    }
+    module cfloat {
+      header "cfloat"
+      export *
+    }
+    module cinttypes {
+      header "cinttypes"
+      export cstdint
+      export *
+    }
+    module ciso646 {
+      header "ciso646"
+      export *
+    }
+    module climits {
+      header "climits"
+      export *
+    }
+    module clocale {
+      @requires_LIBCXX_ENABLE_LOCALIZATION@
+      header "clocale"
+      export *
+    }
+    module cmath {
+      header "cmath"
+      export *
+    }
+    module csetjmp {
+      header "csetjmp"
+      export *
+    }
+    module csignal {
+      header "csignal"
+      export *
+    }
+    // FIXME: <cstdalign> is missing.
+    module cstdarg {
+      header "cstdarg"
+      export *
+    }
+    module cstdbool {
+      header "cstdbool"
+      export *
+    }
+    module cstddef {
+      header "cstddef"
+      export *
+    }
+    module cstdint {
+      header "cstdint"
+      export depr.stdint_h
+      export *
+    }
+    module cstdio {
+      header "cstdio"
+      export *
+    }
+    module cstdlib {
+      header "cstdlib"
+      export *
+    }
+    module cstring {
+      header "cstring"
+      export *
+    }
+    module ctgmath {
+      header "ctgmath"
+      export ccomplex
+      export cmath
+      export *
+    }
+    module ctime {
+      header "ctime"
+      export *
+    }
+    module cuchar {
+      header "cuchar"
+      export *
+    }
+    module cwchar {
+      @requires_LIBCXX_ENABLE_WIDE_CHARACTERS@
+      header "cwchar"
+      export depr.stdio_h
+      export *
+    }
+    module cwctype {
+      @requires_LIBCXX_ENABLE_WIDE_CHARACTERS@
+      header "cwctype"
+      export *
+    }
+  }
+
+  module algorithm {
+    header "algorithm"
+    export initializer_list
+    export *
+
+    module __algorithm {
+      module adjacent_find                   { private header "__algorithm/adjacent_find.h" }
+      module all_of                          { private header "__algorithm/all_of.h" }
+      module any_of                          { private header "__algorithm/any_of.h" }
+      module binary_search                   { private header "__algorithm/binary_search.h" }
+      module clamp                           { private header "__algorithm/clamp.h" }
+      module comp                            { private header "__algorithm/comp.h" }
+      module comp_ref_type                   { private header "__algorithm/comp_ref_type.h" }
+      module copy                            { private header "__algorithm/copy.h" }
+      module copy_backward                   { private header "__algorithm/copy_backward.h" }
+      module copy_if                         { private header "__algorithm/copy_if.h" }
+      module copy_move_common                { private header "__algorithm/copy_move_common.h" }
+      module copy_n                          { private header "__algorithm/copy_n.h" }
+      module count                           { private header "__algorithm/count.h" }
+      module count_if                        { private header "__algorithm/count_if.h" }
+      module equal                           { private header "__algorithm/equal.h" }
+      module equal_range                     { private header "__algorithm/equal_range.h" }
+      module fill                            { private header "__algorithm/fill.h" }
+      module fill_n                          { private header "__algorithm/fill_n.h" }
+      module find                            { private header "__algorithm/find.h" }
+      module find_end                        { private header "__algorithm/find_end.h" }
+      module find_first_of                   { private header "__algorithm/find_first_of.h" }
+      module find_if                         { private header "__algorithm/find_if.h" }
+      module find_if_not                     { private header "__algorithm/find_if_not.h" }
+      module for_each                        { private header "__algorithm/for_each.h" }
+      module for_each_n                      { private header "__algorithm/for_each_n.h" }
+      module generate                        { private header "__algorithm/generate.h" }
+      module generate_n                      { private header "__algorithm/generate_n.h" }
+      module half_positive                   { private header "__algorithm/half_positive.h" }
+      module in_found_result                 { private header "__algorithm/in_found_result.h" }
+      module in_fun_result                   { private header "__algorithm/in_fun_result.h" }
+      module in_in_out_result                { private header "__algorithm/in_in_out_result.h" }
+      module in_in_result                    { private header "__algorithm/in_in_result.h" }
+      module in_out_out_result               { private header "__algorithm/in_out_out_result.h" }
+      module in_out_result                   { private header "__algorithm/in_out_result.h" }
+      module includes                        { private header "__algorithm/includes.h" }
+      module inplace_merge                   { private header "__algorithm/inplace_merge.h" }
+      module is_heap                         { private header "__algorithm/is_heap.h" }
+      module is_heap_until                   { private header "__algorithm/is_heap_until.h" }
+      module is_partitioned                  { private header "__algorithm/is_partitioned.h" }
+      module is_permutation                  { private header "__algorithm/is_permutation.h" }
+      module is_sorted                       { private header "__algorithm/is_sorted.h" }
+      module is_sorted_until                 { private header "__algorithm/is_sorted_until.h" }
+      module iter_swap                       { private header "__algorithm/iter_swap.h" }
+      module iterator_operations             {
+        private header "__algorithm/iterator_operations.h"
+        export *
+      }
+      module lexicographical_compare         { private header "__algorithm/lexicographical_compare.h" }
+      module lower_bound                     { private header "__algorithm/lower_bound.h" }
+      module make_heap                       { private header "__algorithm/make_heap.h" }
+      module make_projected                  { private header "__algorithm/make_projected.h" }
+      module max                             { private header "__algorithm/max.h" }
+      module max_element                     { private header "__algorithm/max_element.h" }
+      module merge                           { private header "__algorithm/merge.h" }
+      module min                             { private header "__algorithm/min.h" }
+      module min_element                     { private header "__algorithm/min_element.h" }
+      module min_max_result                  { private header "__algorithm/min_max_result.h" }
+      module minmax                          { private header "__algorithm/minmax.h" }
+      module minmax_element                  { private header "__algorithm/minmax_element.h" }
+      module mismatch                        { private header "__algorithm/mismatch.h" }
+      module move                            { private header "__algorithm/move.h" }
+      module move_backward                   { private header "__algorithm/move_backward.h" }
+      module next_permutation                { private header "__algorithm/next_permutation.h" }
+      module none_of                         { private header "__algorithm/none_of.h" }
+      module nth_element                     { private header "__algorithm/nth_element.h" }
+      module partial_sort                    { private header "__algorithm/partial_sort.h" }
+      module partial_sort_copy               { private header "__algorithm/partial_sort_copy.h" }
+      module partition                       { private header "__algorithm/partition.h" }
+      module partition_copy                  { private header "__algorithm/partition_copy.h" }
+      module partition_point                 { private header "__algorithm/partition_point.h" }
+      module pop_heap                        { private header "__algorithm/pop_heap.h" }
+      module prev_permutation                { private header "__algorithm/prev_permutation.h" }
+      module push_heap                       { private header "__algorithm/push_heap.h" }
+      module ranges_adjacent_find            { private header "__algorithm/ranges_adjacent_find.h" }
+      module ranges_all_of                   { private header "__algorithm/ranges_all_of.h" }
+      module ranges_any_of                   { private header "__algorithm/ranges_any_of.h" }
+      module ranges_binary_search {
+        private header "__algorithm/ranges_binary_search.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_clamp {
+        private header "__algorithm/ranges_clamp.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_copy {
+        private header "__algorithm/ranges_copy.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_copy_backward {
+        private header "__algorithm/ranges_copy_backward.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_copy_if {
+        private header "__algorithm/ranges_copy_if.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_copy_n {
+        private header "__algorithm/ranges_copy_n.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_count                    { private header "__algorithm/ranges_count.h" }
+      module ranges_count_if                 { private header "__algorithm/ranges_count_if.h" }
+      module ranges_equal                    { private header "__algorithm/ranges_equal.h" }
+      module ranges_equal_range {
+        private header "__algorithm/ranges_equal_range.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_fill                     { private header "__algorithm/ranges_fill.h" }
+      module ranges_fill_n                   { private header "__algorithm/ranges_fill_n.h" }
+      module ranges_find                     { private header "__algorithm/ranges_find.h" }
+      module ranges_find_end                 { private header "__algorithm/ranges_find_end.h" }
+      module ranges_find_first_of            { private header "__algorithm/ranges_find_first_of.h" }
+      module ranges_find_if                  { private header "__algorithm/ranges_find_if.h" }
+      module ranges_find_if_not              { private header "__algorithm/ranges_find_if_not.h" }
+      module ranges_for_each {
+        private header "__algorithm/ranges_for_each.h"
+        export algorithm.__algorithm.in_fun_result
+      }
+      module ranges_for_each_n {
+        private header "__algorithm/ranges_for_each_n.h"
+        export algorithm.__algorithm.in_fun_result
+      }
+      module ranges_generate                 { private header "__algorithm/ranges_generate.h" }
+      module ranges_generate_n               { private header "__algorithm/ranges_generate_n.h" }
+      module ranges_includes {
+        private header "__algorithm/ranges_includes.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_inplace_merge {
+        private header "__algorithm/ranges_inplace_merge.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_is_heap {
+        private header "__algorithm/ranges_is_heap.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_is_heap_until {
+        private header "__algorithm/ranges_is_heap_until.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_is_partitioned           { private header "__algorithm/ranges_is_partitioned.h" }
+      module ranges_is_permutation           { private header "__algorithm/ranges_is_permutation.h" }
+      module ranges_is_sorted {
+        private header "__algorithm/ranges_is_sorted.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_is_sorted_until {
+        private header "__algorithm/ranges_is_sorted_until.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_iterator_concept         { private header "__algorithm/ranges_iterator_concept.h" }
+      module ranges_lexicographical_compare {
+        private header "__algorithm/ranges_lexicographical_compare.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_lower_bound {
+        private header "__algorithm/ranges_lower_bound.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_make_heap {
+        private header "__algorithm/ranges_make_heap.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_max {
+        private header "__algorithm/ranges_max.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_max_element {
+        private header "__algorithm/ranges_max_element.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_merge {
+        private header "__algorithm/ranges_merge.h"
+        export algorithm.__algorithm.in_in_out_result
+      }
+      module ranges_min {
+        private header "__algorithm/ranges_min.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_min_element {
+        private header "__algorithm/ranges_min_element.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_minmax {
+        private header "__algorithm/ranges_minmax.h"
+        export functional.__functional.ranges_operations
+        export algorithm.__algorithm.min_max_result
+      }
+      module ranges_minmax_element {
+        private header "__algorithm/ranges_minmax_element.h"
+        export functional.__functional.ranges_operations
+        export algorithm.__algorithm.min_max_result
+      }
+      module ranges_mismatch {
+        private header "__algorithm/ranges_mismatch.h"
+        export algorithm.__algorithm.in_in_result
+      }
+      module ranges_move {
+        private header "__algorithm/ranges_move.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_move_backward {
+        private header "__algorithm/ranges_move_backward.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_next_permutation {
+        private header "__algorithm/ranges_next_permutation.h"
+        export algorithm.__algorithm.in_found_result
+        export functional.__functional.ranges_operations
+      }
+      module ranges_none_of                  { private header "__algorithm/ranges_none_of.h" }
+      module ranges_nth_element {
+        private header "__algorithm/ranges_nth_element.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_partial_sort {
+        private header "__algorithm/ranges_partial_sort.h"
+        export algorithm.__algorithm.in_out_result
+        export functional.__functional.ranges_operations
+      }
+      module ranges_partial_sort_copy {
+        private header "__algorithm/ranges_partial_sort_copy.h"
+        export algorithm.__algorithm.in_out_out_result
+        export functional.__functional.ranges_operations
+      }
+      module ranges_partition                { private header "__algorithm/ranges_partition.h" }
+      module ranges_partition_copy           { private header "__algorithm/ranges_partition_copy.h" }
+      module ranges_partition_point          { private header "__algorithm/ranges_partition_point.h" }
+      module ranges_pop_heap {
+        private header "__algorithm/ranges_pop_heap.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_prev_permutation {
+        private header "__algorithm/ranges_prev_permutation.h"
+        export algorithm.__algorithm.in_found_result
+        export functional.__functional.ranges_operations
+      }
+      module ranges_push_heap {
+        private header "__algorithm/ranges_push_heap.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_remove                   { private header "__algorithm/ranges_remove.h" }
+      module ranges_remove_copy {
+        private header "__algorithm/ranges_remove_copy.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_remove_copy_if {
+        private header "__algorithm/ranges_remove_copy_if.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_remove_if                { private header "__algorithm/ranges_remove_if.h" }
+      module ranges_replace                  { private header "__algorithm/ranges_replace.h" }
+      module ranges_replace_copy {
+        private header "__algorithm/ranges_replace_copy.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_replace_copy_if {
+        private header "__algorithm/ranges_replace_copy_if.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_replace_if               { private header "__algorithm/ranges_replace_if.h" }
+      module ranges_reverse                  { private header "__algorithm/ranges_reverse.h" }
+      module ranges_reverse_copy {
+        private header "__algorithm/ranges_reverse_copy.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_rotate                   { private header "__algorithm/ranges_rotate.h" }
+      module ranges_rotate_copy {
+        private header "__algorithm/ranges_rotate_copy.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_sample                   { private header "__algorithm/ranges_sample.h" }
+      module ranges_search                   { private header "__algorithm/ranges_search.h" }
+      module ranges_search_n                 { private header "__algorithm/ranges_search_n.h" }
+      module ranges_set_difference {
+        private header "__algorithm/ranges_set_difference.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_set_intersection {
+        private header "__algorithm/ranges_set_intersection.h"
+        export algorithm.__algorithm.in_in_out_result
+      }
+      module ranges_set_symmetric_difference {
+        private header "__algorithm/ranges_set_symmetric_difference.h"
+        export algorithm.__algorithm.in_in_out_result
+        export functional.__functional.ranges_operations
+      }
+      module ranges_set_union {
+        private header "__algorithm/ranges_set_union.h"
+        export algorithm.__algorithm.in_in_out_result
+        export functional.__functional.ranges_operations
+      }
+      module ranges_shuffle                  { private header "__algorithm/ranges_shuffle.h" }
+      module ranges_sort {
+        private header "__algorithm/ranges_sort.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_sort_heap {
+        private header "__algorithm/ranges_sort_heap.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_stable_partition         { private header "__algorithm/ranges_stable_partition.h" }
+      module ranges_stable_sort {
+        private header "__algorithm/ranges_stable_sort.h"
+        export functional.__functional.ranges_operations
+      }
+      module ranges_swap_ranges {
+        private header "__algorithm/ranges_swap_ranges.h"
+        export algorithm.__algorithm.in_in_result
+      }
+      module ranges_transform {
+        private header "__algorithm/ranges_transform.h"
+        export algorithm.__algorithm.in_in_out_result
+        export algorithm.__algorithm.in_out_result
+      }
+      module uniform_random_bit_generator_adaptor {
+        private header "__algorithm/uniform_random_bit_generator_adaptor.h"
+      }
+      module ranges_unique                   { private header "__algorithm/ranges_unique.h" }
+      module ranges_unique_copy {
+        private header "__algorithm/ranges_unique_copy.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module ranges_upper_bound {
+        private header "__algorithm/ranges_upper_bound.h"
+        export functional.__functional.ranges_operations
+      }
+      module remove                          { private header "__algorithm/remove.h" }
+      module remove_copy                     { private header "__algorithm/remove_copy.h" }
+      module remove_copy_if                  { private header "__algorithm/remove_copy_if.h" }
+      module remove_if                       { private header "__algorithm/remove_if.h" }
+      module replace                         { private header "__algorithm/replace.h" }
+      module replace_copy                    { private header "__algorithm/replace_copy.h" }
+      module replace_copy_if                 { private header "__algorithm/replace_copy_if.h" }
+      module replace_if                      { private header "__algorithm/replace_if.h" }
+      module reverse                         { private header "__algorithm/reverse.h" }
+      module reverse_copy                    { private header "__algorithm/reverse_copy.h" }
+      module rotate                          { private header "__algorithm/rotate.h" }
+      module rotate_copy                     { private header "__algorithm/rotate_copy.h" }
+      module sample                          { private header "__algorithm/sample.h" }
+      module search                          { private header "__algorithm/search.h" }
+      module search_n                        { private header "__algorithm/search_n.h" }
+      module set_difference                  { private header "__algorithm/set_difference.h" }
+      module set_intersection                { private header "__algorithm/set_intersection.h" }
+      module set_symmetric_difference        { private header "__algorithm/set_symmetric_difference.h" }
+      module set_union                       { private header "__algorithm/set_union.h" }
+      module shift_left                      { private header "__algorithm/shift_left.h" }
+      module shift_right                     { private header "__algorithm/shift_right.h" }
+      module shuffle                         { private header "__algorithm/shuffle.h" }
+      module sift_down                       { private header "__algorithm/sift_down.h" }
+      module sort                            { private header "__algorithm/sort.h" }
+      module sort_heap                       { private header "__algorithm/sort_heap.h" }
+      module stable_partition                { private header "__algorithm/stable_partition.h" }
+      module stable_sort                     { private header "__algorithm/stable_sort.h" }
+      module swap_ranges                     { private header "__algorithm/swap_ranges.h" }
+      module transform                       { private header "__algorithm/transform.h" }
+      module unique                          { private header "__algorithm/unique.h" }
+      module unique_copy                     { private header "__algorithm/unique_copy.h" }
+      module unwrap_iter                     { private header "__algorithm/unwrap_iter.h" }
+      module unwrap_range                    { private header "__algorithm/unwrap_range.h" }
+      module upper_bound                     { private header "__algorithm/upper_bound.h" }
+    }
+  }
+  module any {
+    header "any"
+    export *
+  }
+  module array {
+    header "array"
+    export initializer_list
+    export *
+
+    module array_fwd { private header "__fwd/array.h" }
+  }
+  module atomic {
+    header "atomic"
+    export *
+  }
+  module barrier {
+    @requires_LIBCXX_ENABLE_THREADS@
+    header "barrier"
+    export *
+  }
+  module bit {
+    header "bit"
+    export *
+
+    module __bit {
+      module bit_cast       { private header "__bit/bit_cast.h" }
+      module bit_ceil       { private header "__bit/bit_ceil.h" }
+      module bit_floor      { private header "__bit/bit_floor.h" }
+      module bit_log2       { private header "__bit/bit_log2.h" }
+      module bit_width      { private header "__bit/bit_width.h" }
+      module blsr           { private header "__bit/blsr.h" }
+      module byteswap       { private header "__bit/byteswap.h" }
+      module countl         { private header "__bit/countl.h" }
+      module countr         { private header "__bit/countr.h" }
+      module endian         { private header "__bit/endian.h" }
+      module has_single_bit { private header "__bit/has_single_bit.h" }
+      module popcount       { private header "__bit/popcount.h" }
+      module rotate         { private header "__bit/rotate.h" }
+    }
+  }
+  module bitset {
+    header "bitset"
+    export string
+    export iosfwd
+    export *
+  }
+  // No submodule for cassert. It fundamentally needs repeated, textual inclusion.
+  module charconv {
+    header "charconv"
+    export *
+
+    module __charconv {
+      module chars_format      { private header "__charconv/chars_format.h" }
+      module from_chars_result { private header "__charconv/from_chars_result.h" }
+      module tables            { private header "__charconv/tables.h" }
+      module to_chars_base_10  { private header "__charconv/to_chars_base_10.h" }
+      module to_chars_result   { private header "__charconv/to_chars_result.h" }
+    }
+
+  }
+  module chrono {
+    header "chrono"
+    export *
+
+    module __chrono {
+      module calendar               { private header "__chrono/calendar.h" }
+      module convert_to_timespec    { private header "__chrono/convert_to_timespec.h" }
+      module convert_to_tm          { private header "__chrono/convert_to_tm.h" }
+      module day                    { private header "__chrono/day.h" }
+      module duration               { private header "__chrono/duration.h" }
+      module file_clock             { private header "__chrono/file_clock.h" }
+      module formatter              {
+        @requires_LIBCXX_ENABLE_LOCALIZATION@
+        private header "__chrono/formatter.h"
+      }
+      module hh_mm_ss               { private header "__chrono/hh_mm_ss.h" }
+      module high_resolution_clock  {
+        private header "__chrono/high_resolution_clock.h"
+        export steady_clock
+        export system_clock
+        export time_point
+      }
+      module literals               { private header "__chrono/literals.h" }
+      module month                  { private header "__chrono/month.h" }
+      module month_weekday          { private header "__chrono/month_weekday.h" }
+      module monthday               { private header "__chrono/monthday.h" }
+      module ostream                {
+        @requires_LIBCXX_ENABLE_LOCALIZATION@
+        private header "__chrono/ostream.h"
+      }
+      module parser_std_format_spec {
+        @requires_LIBCXX_ENABLE_LOCALIZATION@
+        private header "__chrono/parser_std_format_spec.h"
+      }
+      module statically_widen       { private header "__chrono/statically_widen.h" }
+      module steady_clock           { private header "__chrono/steady_clock.h" }
+      module system_clock           { private header "__chrono/system_clock.h" }
+      module time_point             { private header "__chrono/time_point.h" }
+      module weekday                { private header "__chrono/weekday.h" }
+      module year                   { private header "__chrono/year.h" }
+      module year_month             { private header "__chrono/year_month.h" }
+      module year_month_day         { private header "__chrono/year_month_day.h" }
+      module year_month_weekday     { private header "__chrono/year_month_weekday.h" }
+    }
+  }
+  module codecvt {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    header "codecvt"
+    export *
+  }
+  module compare {
+    header "compare"
+    export *
+
+    module __compare {
+      module common_comparison_category     { private header "__compare/common_comparison_category.h" }
+      module compare_partial_order_fallback { private header "__compare/compare_partial_order_fallback.h" }
+      module compare_strong_order_fallback  { private header "__compare/compare_strong_order_fallback.h" }
+      module compare_three_way              { private header "__compare/compare_three_way.h" }
+      module compare_three_way_result       { private header "__compare/compare_three_way_result.h" }
+      module compare_weak_order_fallback    { private header "__compare/compare_weak_order_fallback.h" }
+      module is_eq                          { private header "__compare/is_eq.h" }
+      module ordering                       { private header "__compare/ordering.h" }
+      module partial_order                  { private header "__compare/partial_order.h" }
+      module strong_order                   { private header "__compare/strong_order.h" }
+      module synth_three_way                { private header "__compare/synth_three_way.h" }
+      module three_way_comparable           { private header "__compare/three_way_comparable.h" }
+      module weak_order                     { private header "__compare/weak_order.h" }
+    }
+  }
+  module complex {
+    header "complex"
+    export *
+  }
+  module concepts {
+    header "concepts"
+    export *
+
+    module __concepts {
+      module arithmetic                 { private header "__concepts/arithmetic.h" }
+      module assignable                 { private header "__concepts/assignable.h" }
+      module boolean_testable           { private header "__concepts/boolean_testable.h" }
+      module class_or_enum              { private header "__concepts/class_or_enum.h" }
+      module common_reference_with      { private header "__concepts/common_reference_with.h" }
+      module common_with                { private header "__concepts/common_with.h" }
+      module constructible              { private header "__concepts/constructible.h" }
+      module convertible_to             { private header "__concepts/convertible_to.h" }
+      module copyable                   { private header "__concepts/copyable.h" }
+      module derived_from               { private header "__concepts/derived_from.h" }
+      module destructible               { private header "__concepts/destructible.h" }
+      module different_from             { private header "__concepts/different_from.h" }
+      module equality_comparable        { private header "__concepts/equality_comparable.h" }
+      module invocable                  { private header "__concepts/invocable.h" }
+      module movable                    { private header "__concepts/movable.h" }
+      module predicate                  { private header "__concepts/predicate.h" }
+      module regular                    { private header "__concepts/regular.h" }
+      module relation                   { private header "__concepts/relation.h" }
+      module same_as                    { private header "__concepts/same_as.h" }
+      module semiregular                { private header "__concepts/semiregular.h" }
+      module swappable                  { private header "__concepts/swappable.h" }
+      module totally_ordered            { private header "__concepts/totally_ordered.h" }
+    }
+  }
+  module condition_variable {
+    header "condition_variable"
+    export *
+  }
+  module coroutine {
+    requires coroutines
+    header "coroutine"
+    export compare
+    export *
+
+    module __coroutine {
+      module coroutine_handle           { private header "__coroutine/coroutine_handle.h" }
+      module coroutine_traits           { private header "__coroutine/coroutine_traits.h" }
+      module noop_coroutine_handle      { private header "__coroutine/noop_coroutine_handle.h" }
+      module trivial_awaitables         { private header "__coroutine/trivial_awaitables.h" }
+    }
+  }
+  module deque {
+    header "deque"
+    export initializer_list
+    export *
+  }
+  module exception {
+    header "exception"
+    export *
+  }
+  module execution {
+    header "execution"
+    export *
+  }
+  module expected {
+    header "expected"
+    export *
+
+    module __expected {
+      module bad_expected_access          { private header "__expected/bad_expected_access.h" }
+      module expected                     { private header "__expected/expected.h" }
+      module unexpect                     { private header "__expected/unexpect.h" }
+      module unexpected                   { private header "__expected/unexpected.h" }
+    }
+  }
+  module filesystem {
+    @requires_LIBCXX_ENABLE_FILESYSTEM@
+    header "filesystem"
+    export *
+
+    module __filesystem {
+      module copy_options                 { private header "__filesystem/copy_options.h" }
+      module directory_entry              { private header "__filesystem/directory_entry.h" }
+      module directory_iterator           { private header "__filesystem/directory_iterator.h" }
+      module directory_options            { private header "__filesystem/directory_options.h" }
+      module file_status                  { private header "__filesystem/file_status.h" }
+      module file_time_type               { private header "__filesystem/file_time_type.h" }
+      module file_type                    { private header "__filesystem/file_type.h" }
+      module filesystem_error             { private header "__filesystem/filesystem_error.h" }
+      module operations                   { private header "__filesystem/operations.h" }
+      module path                         { private header "__filesystem/path.h" }
+      module path_iterator                { private header "__filesystem/path_iterator.h" }
+      module perm_options                 { private header "__filesystem/perm_options.h" }
+      module perms                        { private header "__filesystem/perms.h" }
+      module recursive_directory_iterator { private header "__filesystem/recursive_directory_iterator.h" }
+      module space_info                   { private header "__filesystem/space_info.h" }
+      module u8path                       { private header "__filesystem/u8path.h" }
+    }
+  }
+  module format {
+    header "format"
+    export *
+
+    module __format {
+      module buffer                          { private header "__format/buffer.h" }
+      module concepts                        { private header "__format/concepts.h" }
+      module container_adaptor               { private header "__format/container_adaptor.h" }
+      module enable_insertable               { private header "__format/enable_insertable.h" }
+      module escaped_output_table            { private header "__format/escaped_output_table.h" }
+      module extended_grapheme_cluster_table { private header "__format/extended_grapheme_cluster_table.h" }
+      module format_arg                      { private header "__format/format_arg.h" }
+      module format_arg_store                { private header "__format/format_arg_store.h" }
+      module format_args                     { private header "__format/format_args.h" }
+      module format_context {
+        private header "__format/format_context.h"
+        export optional
+        export locale
+      }
+      module format_error                    { private header "__format/format_error.h" }
+      module format_functions                { private header "__format/format_functions.h" }
+      module format_fwd                      { private header "__format/format_fwd.h" }
+      module format_parse_context            { private header "__format/format_parse_context.h" }
+      module format_string                   { private header "__format/format_string.h" }
+      module format_to_n_result {
+        private header "__format/format_to_n_result.h"
+        export iterator.__iterator.incrementable_traits
+      }
+      module formatter                       { private header "__format/formatter.h" }
+      module formatter_bool                  { private header "__format/formatter_bool.h" }
+      module formatter_char                  { private header "__format/formatter_char.h" }
+      module formatter_floating_point        { private header "__format/formatter_floating_point.h" }
+      module formatter_integer               { private header "__format/formatter_integer.h" }
+      module formatter_integral              { private header "__format/formatter_integral.h" }
+      module formatter_output                { private header "__format/formatter_output.h" }
+      module formatter_pointer               { private header "__format/formatter_pointer.h" }
+      module formatter_string                { private header "__format/formatter_string.h" }
+      module formatter_tuple                 { private header "__format/formatter_tuple.h" }
+      module parser_std_format_spec          { private header "__format/parser_std_format_spec.h" }
+      module range_default_formatter         { private header "__format/range_default_formatter.h" }
+      module range_formatter                 { private header "__format/range_formatter.h" }
+      module unicode                         { private header "__format/unicode.h" }
+    }
+  }
+  module forward_list {
+    header "forward_list"
+    export initializer_list
+    export *
+  }
+  module fstream {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    @requires_LIBCXX_ENABLE_FSTREAM@
+    header "fstream"
+    export *
+  }
+  module functional {
+    header "functional"
+    export *
+
+    module __functional {
+      module binary_function            { private header "__functional/binary_function.h" }
+      module binary_negate              { private header "__functional/binary_negate.h" }
+      module bind                       { private header "__functional/bind.h" }
+      module bind_back                  { private header "__functional/bind_back.h" }
+      module bind_front                 { private header "__functional/bind_front.h" }
+      module binder1st                  { private header "__functional/binder1st.h" }
+      module binder2nd                  { private header "__functional/binder2nd.h" }
+      module boyer_moore_searcher       { private header "__functional/boyer_moore_searcher.h" }
+      module compose                    { private header "__functional/compose.h" }
+      module default_searcher           { private header "__functional/default_searcher.h" }
+      module function                   { private header "__functional/function.h" }
+      module hash                       { private header "__functional/hash.h" }
+      module hash_fwd                   { private header "__fwd/hash.h" }
+      module identity                   { private header "__functional/identity.h" }
+      module invoke                     {
+        private header "__functional/invoke.h"
+        export type_traits
+      }
+      module is_transparent             { private header "__functional/is_transparent.h" }
+      module mem_fn                     { private header "__functional/mem_fn.h" }
+      module mem_fun_ref                { private header "__functional/mem_fun_ref.h" }
+      module not_fn                     { private header "__functional/not_fn.h" }
+      module operations                 { private header "__functional/operations.h" }
+      module perfect_forward            { private header "__functional/perfect_forward.h" }
+      module pointer_to_binary_function { private header "__functional/pointer_to_binary_function.h" }
+      module pointer_to_unary_function  { private header "__functional/pointer_to_unary_function.h" }
+      module ranges_operations          { private header "__functional/ranges_operations.h" }
+      module reference_wrapper          { private header "__functional/reference_wrapper.h" }
+      module unary_function             { private header "__functional/unary_function.h" }
+      module unary_negate               { private header "__functional/unary_negate.h" }
+      module unwrap_ref                 { private header "__functional/unwrap_ref.h" }
+      module weak_result_type           { private header "__functional/weak_result_type.h" }
+    }
+  }
+  module future {
+    @requires_LIBCXX_ENABLE_THREADS@
+    header "future"
+    export *
+  }
+  module initializer_list {
+    header "initializer_list"
+    export *
+  }
+  module iomanip {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    header "iomanip"
+    export *
+  }
+  module ios {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    header "ios"
+    export iosfwd
+    export *
+
+    module __ios {
+      module fpos { private header "__ios/fpos.h" }
+    }
+  }
+  module iosfwd {
+    header "iosfwd"
+    export *
+  }
+  module iostream {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    header "iostream"
+    export ios
+    export streambuf
+    export istream
+    export ostream
+    export *
+  }
+  module istream {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    header "istream"
+    // FIXME: should re-export ios, streambuf?
+    export *
+  }
+  module iterator {
+    header "iterator"
+    export *
+
+    module __iterator {
+      module access                { private header "__iterator/access.h" }
+      module advance               { private header "__iterator/advance.h" }
+      module back_insert_iterator  { private header "__iterator/back_insert_iterator.h" }
+      module bounded_iter          { private header "__iterator/bounded_iter.h" }
+      module common_iterator       { private header "__iterator/common_iterator.h" }
+      module concepts              { private header "__iterator/concepts.h" }
+      module counted_iterator      { private header "__iterator/counted_iterator.h" }
+      module data                  { private header "__iterator/data.h" }
+      module default_sentinel      { private header "__iterator/default_sentinel.h" }
+      module distance              { private header "__iterator/distance.h" }
+      module empty                 { private header "__iterator/empty.h" }
+      module erase_if_container    { private header "__iterator/erase_if_container.h" }
+      module front_insert_iterator { private header "__iterator/front_insert_iterator.h" }
+      module incrementable_traits  { private header "__iterator/incrementable_traits.h" }
+      module indirectly_comparable { private header "__iterator/indirectly_comparable.h" }
+      module insert_iterator       { private header "__iterator/insert_iterator.h" }
+      module istream_iterator      { private header "__iterator/istream_iterator.h" }
+      module istreambuf_iterator   { private header "__iterator/istreambuf_iterator.h" }
+      module iter_move             { private header "__iterator/iter_move.h" }
+      module iter_swap             { private header "__iterator/iter_swap.h" }
+      module iterator              { private header "__iterator/iterator.h" }
+      module iterator_traits       { private header "__iterator/iterator_traits.h" }
+      module iterator_with_data    { private header "__iterator/iterator_with_data.h" }
+      module mergeable {
+        private header "__iterator/mergeable.h"
+        export functional.__functional.ranges_operations
+      }
+      module move_iterator         { private header "__iterator/move_iterator.h" }
+      module move_sentinel         { private header "__iterator/move_sentinel.h" }
+      module next                  { private header "__iterator/next.h" }
+      module ostream_iterator      { private header "__iterator/ostream_iterator.h" }
+      module ostreambuf_iterator   {
+        private header "__iterator/ostreambuf_iterator.h"
+        export iosfwd
+      }
+      module permutable            { private header "__iterator/permutable.h" }
+      module prev                  { private header "__iterator/prev.h" }
+      module projected             { private header "__iterator/projected.h" }
+      module readable_traits       { private header "__iterator/readable_traits.h" }
+      module reverse_access        { private header "__iterator/reverse_access.h" }
+      module reverse_iterator      { private header "__iterator/reverse_iterator.h" }
+      module segmented_iterator    { private header "__iterator/segmented_iterator.h" }
+      module size                  { private header "__iterator/size.h" }
+      module sortable {
+        private header "__iterator/sortable.h"
+        export functional.__functional.ranges_operations
+      }
+      module unreachable_sentinel  { private header "__iterator/unreachable_sentinel.h" }
+      module wrap_iter             { private header "__iterator/wrap_iter.h" }
+    }
+  }
+  module latch {
+    @requires_LIBCXX_ENABLE_THREADS@
+    header "latch"
+    export *
+  }
+
+  module __debug_utils {
+    module randomize_range { private header "__debug_utils/randomize_range.h" }
+  }
+
+  module limits {
+    header "limits"
+    export *
+  }
+  module list {
+    header "list"
+    export initializer_list
+    export *
+  }
+  module locale {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    header "locale"
+    export *
+  }
+  module map {
+    header "map"
+    export initializer_list
+    export *
+  }
+  module memory {
+    header "memory"
+    export *
+
+    module __memory {
+      module addressof                       { private header "__memory/addressof.h" }
+      module align                           { private header "__memory/align.h" }
+      module allocate_at_least               { private header "__memory/allocate_at_least.h" }
+      module allocation_guard                { private header "__memory/allocation_guard.h" }
+      module allocator                       { private header "__memory/allocator.h" }
+      module allocator_arg_t                 { private header "__memory/allocator_arg_t.h" }
+      module allocator_destructor            { private header "__memory/allocator_destructor.h" }
+      module allocator_traits                { private header "__memory/allocator_traits.h" }
+      module assume_aligned                  { private header "__memory/assume_aligned.h" }
+      module auto_ptr                        { private header "__memory/auto_ptr.h" }
+      module builtin_new_allocator           { private header "__memory/builtin_new_allocator.h" }
+      module compressed_pair                 { private header "__memory/compressed_pair.h" }
+      module concepts                        { private header "__memory/concepts.h" }
+      module construct_at                    { private header "__memory/construct_at.h" }
+      module destruct_n                      { private header "__memory/destruct_n.h" }
+      module pointer_traits                  { private header "__memory/pointer_traits.h" }
+      module ranges_construct_at             { private header "__memory/ranges_construct_at.h" }
+      module ranges_uninitialized_algorithms {
+        private header "__memory/ranges_uninitialized_algorithms.h"
+        export algorithm.__algorithm.in_out_result
+      }
+      module raw_storage_iterator            { private header "__memory/raw_storage_iterator.h" }
+      module shared_ptr                      { private header "__memory/shared_ptr.h" }
+      module swap_allocator                  { private header "__memory/swap_allocator.h" }
+      module temp_value                      { private header "__memory/temp_value.h" }
+      module temporary_buffer                { private header "__memory/temporary_buffer.h" }
+      module uninitialized_algorithms        { private header "__memory/uninitialized_algorithms.h" }
+      module unique_ptr                      { private header "__memory/unique_ptr.h" }
+      module uses_allocator                  { private header "__memory/uses_allocator.h" }
+      module uses_allocator_construction     { private header "__memory/uses_allocator_construction.h" }
+      module voidify                         { private header "__memory/voidify.h" }
+    }
+  }
+  module memory_resource {
+    header "memory_resource"
+    export *
+
+    module __memory_resource {
+      module memory_resource              { private header "__memory_resource/memory_resource.h" }
+      module memory_resource_fwd          { private header "__fwd/memory_resource.h" }
+      module monotonic_buffer_resource    { private header "__memory_resource/monotonic_buffer_resource.h" }
+      module polymorphic_allocator        { private header "__memory_resource/polymorphic_allocator.h" }
+      module pool_options                 { private header "__memory_resource/pool_options.h" }
+      module synchronized_pool_resource   { private header "__memory_resource/synchronized_pool_resource.h" }
+      module unsynchronized_pool_resource { private header "__memory_resource/unsynchronized_pool_resource.h" }
+    }
+  }
+  module mutex {
+    @requires_LIBCXX_ENABLE_THREADS@
+    header "mutex"
+    export *
+  }
+  module new {
+    header "new"
+    export *
+  }
+  module numbers {
+    header "numbers"
+    export *
+  }
+  module numeric {
+    header "numeric"
+    export *
+
+    module __numeric {
+      module accumulate               { private header "__numeric/accumulate.h" }
+      module adjacent_difference      { private header "__numeric/adjacent_difference.h" }
+      module exclusive_scan           { private header "__numeric/exclusive_scan.h" }
+      module gcd_lcm                  { private header "__numeric/gcd_lcm.h" }
+      module inclusive_scan           { private header "__numeric/inclusive_scan.h" }
+      module inner_product            { private header "__numeric/inner_product.h" }
+      module iota                     { private header "__numeric/iota.h" }
+      module midpoint                 { private header "__numeric/midpoint.h" }
+      module partial_sum              { private header "__numeric/partial_sum.h" }
+      module reduce                   { private header "__numeric/reduce.h" }
+      module transform_exclusive_scan { private header "__numeric/transform_exclusive_scan.h" }
+      module transform_inclusive_scan { private header "__numeric/transform_inclusive_scan.h" }
+      module transform_reduce         { private header "__numeric/transform_reduce.h" }
+    }
+  }
+  module optional {
+    header "optional"
+    export *
+  }
+  module ostream {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    header "ostream"
+    // FIXME: should re-export ios, streambuf?
+    export *
+  }
+  module queue {
+    header "queue"
+    export initializer_list
+    export *
+  }
+  module random {
+    header "random"
+    export initializer_list
+    export *
+
+    module __random {
+      module bernoulli_distribution          { private header "__random/bernoulli_distribution.h" }
+      module binomial_distribution           { private header "__random/binomial_distribution.h" }
+      module cauchy_distribution             { private header "__random/cauchy_distribution.h" }
+      module chi_squared_distribution        { private header "__random/chi_squared_distribution.h" }
+      module clamp_to_integral               { private header "__random/clamp_to_integral.h" }
+      module default_random_engine           { private header "__random/default_random_engine.h" }
+      module discard_block_engine            { private header "__random/discard_block_engine.h" }
+      module discrete_distribution {
+        private header "__random/discrete_distribution.h"
+        export vector
+      }
+      module exponential_distribution        { private header "__random/exponential_distribution.h" }
+      module extreme_value_distribution      { private header "__random/extreme_value_distribution.h" }
+      module fisher_f_distribution           { private header "__random/fisher_f_distribution.h" }
+      module gamma_distribution              { private header "__random/gamma_distribution.h" }
+      module generate_canonical              { private header "__random/generate_canonical.h" }
+      module geometric_distribution          { private header "__random/geometric_distribution.h" }
+      module independent_bits_engine         { private header "__random/independent_bits_engine.h" }
+      module is_seed_sequence                { private header "__random/is_seed_sequence.h" }
+      module is_valid                        { private header "__random/is_valid.h" }
+      module knuth_b                         { private header "__random/knuth_b.h" }
+      module linear_congruential_engine      { private header "__random/linear_congruential_engine.h" }
+      module log2                            { private header "__random/log2.h" }
+      module lognormal_distribution          { private header "__random/lognormal_distribution.h" }
+      module mersenne_twister_engine         { private header "__random/mersenne_twister_engine.h" }
+      module negative_binomial_distribution  { private header "__random/negative_binomial_distribution.h" }
+      module normal_distribution             { private header "__random/normal_distribution.h" }
+      module piecewise_constant_distribution {
+        private header "__random/piecewise_constant_distribution.h"
+        export vector
+      }
+      module piecewise_linear_distribution {
+        private header "__random/piecewise_linear_distribution.h"
+        export vector
+      }
+      module poisson_distribution            { private header "__random/poisson_distribution.h" }
+      module random_device                   { private header "__random/random_device.h" }
+      module ranlux                          { private header "__random/ranlux.h" }
+      module seed_seq                        { private header "__random/seed_seq.h" }
+      module shuffle_order_engine            { private header "__random/shuffle_order_engine.h" }
+      module student_t_distribution          { private header "__random/student_t_distribution.h" }
+      module subtract_with_carry_engine      { private header "__random/subtract_with_carry_engine.h" }
+      module uniform_int_distribution        { private header "__random/uniform_int_distribution.h" }
+      module uniform_random_bit_generator    { private header "__random/uniform_random_bit_generator.h" }
+      module uniform_real_distribution       { private header "__random/uniform_real_distribution.h" }
+      module weibull_distribution            { private header "__random/weibull_distribution.h" }
+    }
+  }
+  module ranges {
+    header "ranges"
+    export compare
+    export initializer_list
+    export iterator
+    export *
+
+    module __ranges {
+      module access                 { private header "__ranges/access.h" }
+      module all                    {
+        private header "__ranges/all.h"
+        export functional.__functional.compose
+        export functional.__functional.perfect_forward
+      }
+      module as_rvalue_view         { private header "__ranges/as_rvalue_view.h" }
+      module common_view            { private header "__ranges/common_view.h" }
+      module concepts               { private header "__ranges/concepts.h" }
+      module copyable_box           { private header "__ranges/copyable_box.h" }
+      module counted                {
+        private header "__ranges/counted.h"
+        export span
+      }
+      module dangling               { private header "__ranges/dangling.h" }
+      module data                   { private header "__ranges/data.h" }
+      module drop_view              { private header "__ranges/drop_view.h" }
+      module drop_while_view        { private header "__ranges/drop_while_view.h" }
+      module elements_view          { private header "__ranges/elements_view.h" }
+      module empty                  { private header "__ranges/empty.h" }
+      module empty_view             { private header "__ranges/empty_view.h" }
+      module enable_borrowed_range  { private header "__ranges/enable_borrowed_range.h" }
+      module enable_view            { private header "__ranges/enable_view.h" }
+      module filter_view            { private header "__ranges/filter_view.h" }
+      module iota_view              { private header "__ranges/iota_view.h" }
+      module istream_view           {
+        @requires_LIBCXX_ENABLE_LOCALIZATION@
+        private header "__ranges/istream_view.h"
+      }
+      module join_view              { private header "__ranges/join_view.h" }
+      module lazy_split_view        { private header "__ranges/lazy_split_view.h" }
+      module non_propagating_cache  { private header "__ranges/non_propagating_cache.h" }
+      module owning_view            { private header "__ranges/owning_view.h" }
+      module range_adaptor          { private header "__ranges/range_adaptor.h" }
+      module rbegin                 { private header "__ranges/rbegin.h" }
+      module ref_view               { private header "__ranges/ref_view.h" }
+      module rend                   { private header "__ranges/rend.h" }
+      module reverse_view           { private header "__ranges/reverse_view.h" }
+      module single_view            { private header "__ranges/single_view.h" }
+      module size                   { private header "__ranges/size.h" }
+      module split_view             { private header "__ranges/split_view.h" }
+      module subrange               {
+        private header "__ranges/subrange.h"
+
+        module subrange_fwd { private header "__fwd/subrange.h" }
+      }
+      module take_view              { private header "__ranges/take_view.h" }
+      module take_while_view        { private header "__ranges/take_while_view.h" }
+      module transform_view         {
+        private header "__ranges/transform_view.h"
+        export functional.__functional.bind_back
+        export functional.__functional.perfect_forward
+      }
+      module view_interface         { private header "__ranges/view_interface.h" }
+      module views                  { private header "__ranges/views.h" }
+      module zip_view               { private header "__ranges/zip_view.h" }
+    }
+  }
+  module ratio {
+    header "ratio"
+    export *
+  }
+  module regex {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    header "regex"
+    export initializer_list
+    export *
+  }
+  module scoped_allocator {
+    header "scoped_allocator"
+    export *
+  }
+  module semaphore {
+    @requires_LIBCXX_ENABLE_THREADS@
+    header "semaphore"
+    export *
+  }
+  module set {
+    header "set"
+    export initializer_list
+    export *
+  }
+  module shared_mutex {
+    @requires_LIBCXX_ENABLE_THREADS@
+    header "shared_mutex"
+    export version
+  }
+  module source_location {
+    header "source_location"
+    export *
+  }
+  module span {
+    header "span"
+    export ranges.__ranges.enable_borrowed_range
+    export version
+    module span_fwd { private header "__fwd/span.h" }
+  }
+  module sstream {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    header "sstream"
+    // FIXME: should re-export istream, ostream, ios, streambuf, string?
+    export *
+  }
+  module stack {
+    header "stack"
+    export initializer_list
+    export *
+  }
+  module stdexcept {
+    header "stdexcept"
+    export *
+  }
+  module streambuf {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    header "streambuf"
+    export *
+  }
+  module string {
+    header "string"
+    export initializer_list
+    export string_view
+    module __string {
+      module char_traits           { private header "__string/char_traits.h" }
+      module extern_template_lists { private header "__string/extern_template_lists.h" }
+      module string_fwd            { private header "__fwd/string.h" }
+    }
+    export *
+  }
+  module string_view {
+    header "string_view"
+    export initializer_list
+    export *
+    module string_view_fwd { private header "__fwd/string_view.h" }
+  }
+  module strstream {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    header "strstream"
+    export *
+  }
+  module system_error {
+    header "system_error"
+    export *
+  }
+  module thread {
+    @requires_LIBCXX_ENABLE_THREADS@
+    header "thread"
+    export *
+
+    module __thread {
+      module poll_with_backoff    { private header "__thread/poll_with_backoff.h" }
+      module timed_backoff_policy { private header "__thread/timed_backoff_policy.h" }
+    }
+  }
+  module tuple {
+    header "tuple"
+    export *
+
+    module apply_cv         { private header "__tuple_dir/apply_cv.h" }
+    module get_fwd          { private header "__fwd/get.h" }
+    module make_tuple_types { private header "__tuple_dir/make_tuple_types.h" }
+    module pair_like        { private header "__tuple_dir/pair_like.h" }
+    module sfinae_helpers   { private header "__tuple_dir/sfinae_helpers.h" }
+    module tuple_element    { private header "__tuple_dir/tuple_element.h" }
+    module tuple_fwd        { private header "__fwd/tuple.h" }
+    module tuple_indices    { private header "__tuple_dir/tuple_indices.h" }
+    module tuple_like       { private header "__tuple_dir/tuple_like.h" }
+    module tuple_like_ext   { private header "__tuple_dir/tuple_like_ext.h" }
+    module tuple_size       { private header "__tuple_dir/tuple_size.h" }
+    module tuple_types      { private header "__tuple_dir/tuple_types.h" }
+  }
+  module type_traits {
+    header "type_traits"
+    export functional.__functional.unwrap_ref
+    export *
+
+    module add_const                           { private header "__type_traits/add_const.h" }
+    module add_cv                              { private header "__type_traits/add_cv.h" }
+    module add_lvalue_reference                { private header "__type_traits/add_lvalue_reference.h" }
+    module add_pointer                         { private header "__type_traits/add_pointer.h" }
+    module add_rvalue_reference                { private header "__type_traits/add_rvalue_reference.h" }
+    module add_volatile                        { private header "__type_traits/add_volatile.h" }
+    module aligned_storage                     { private header "__type_traits/aligned_storage.h" }
+    module aligned_union                       { private header "__type_traits/aligned_union.h" }
+    module alignment_of                        { private header "__type_traits/alignment_of.h" }
+    module apply_cv                            { private header "__type_traits/apply_cv.h" }
+    module can_extract_key                     { private header "__type_traits/can_extract_key.h" }
+    module common_reference                    { private header "__type_traits/common_reference.h" }
+    module common_type                         { private header "__type_traits/common_type.h" }
+    module conditional                         { private header "__type_traits/conditional.h" }
+    module conjunction                         { private header "__type_traits/conjunction.h" }
+    module copy_cv                             { private header "__type_traits/copy_cv.h" }
+    module copy_cvref                          { private header "__type_traits/copy_cvref.h" }
+    module decay                               { private header "__type_traits/decay.h" }
+    module dependent_type                      { private header "__type_traits/dependent_type.h" }
+    module disjunction                         { private header "__type_traits/disjunction.h" }
+    module enable_if                           { private header "__type_traits/enable_if.h" }
+    module extent                              { private header "__type_traits/extent.h" }
+    module has_unique_object_representation    { private header "__type_traits/has_unique_object_representation.h" }
+    module has_virtual_destructor              { private header "__type_traits/has_virtual_destructor.h" }
+    module integral_constant                   { private header "__type_traits/integral_constant.h" }
+    module is_abstract                         { private header "__type_traits/is_abstract.h" }
+    module is_aggregate                        { private header "__type_traits/is_aggregate.h" }
+    module is_allocator                        { private header "__type_traits/is_allocator.h" }
+    module is_always_bitcastable               { private header "__type_traits/is_always_bitcastable.h" }
+    module is_arithmetic {
+      private header "__type_traits/is_arithmetic.h"
+      export integral_constant
+    }
+    module is_array                            {
+      private header "__type_traits/is_array.h"
+      export integral_constant
+    }
+    module is_assignable                       { private header "__type_traits/is_assignable.h" }
+    module is_base_of                          { private header "__type_traits/is_base_of.h" }
+    module is_bounded_array                    { private header "__type_traits/is_bounded_array.h" }
+    module is_callable                         { private header "__type_traits/is_callable.h" }
+    module is_char_like_type                   { private header "__type_traits/is_char_like_type.h" }
+    module is_class                            { private header "__type_traits/is_class.h" }
+    module is_compound                         { private header "__type_traits/is_compound.h" }
+    module is_const                            { private header "__type_traits/is_const.h" }
+    module is_constant_evaluated               { private header "__type_traits/is_constant_evaluated.h" }
+    module is_constructible                    { private header "__type_traits/is_constructible.h" }
+    module is_convertible                      { private header "__type_traits/is_convertible.h" }
+    module is_copy_assignable                  { private header "__type_traits/is_copy_assignable.h" }
+    module is_copy_constructible               { private header "__type_traits/is_copy_constructible.h" }
+    module is_core_convertible                 {
+      private header "__type_traits/is_core_convertible.h"
+      export integral_constant
+    }
+    module is_default_constructible            { private header "__type_traits/is_default_constructible.h" }
+    module is_destructible                     { private header "__type_traits/is_destructible.h" }
+    module is_empty                            { private header "__type_traits/is_empty.h" }
+    module is_enum                             { private header "__type_traits/is_enum.h" }
+    module is_final                            { private header "__type_traits/is_final.h" }
+    module is_floating_point                   { private header "__type_traits/is_floating_point.h" }
+    module is_function                         { private header "__type_traits/is_function.h" }
+    module is_fundamental                      { private header "__type_traits/is_fundamental.h" }
+    module is_implicitly_default_constructible { private header "__type_traits/is_implicitly_default_constructible.h" }
+    module is_integral                         { private header "__type_traits/is_integral.h" }
+    module is_literal_type                     { private header "__type_traits/is_literal_type.h" }
+    module is_member_function_pointer          { private header "__type_traits/is_member_function_pointer.h" }
+    module is_member_object_pointer            { private header "__type_traits/is_member_object_pointer.h" }
+    module is_member_pointer                   { private header "__type_traits/is_member_pointer.h" }
+    module is_move_assignable                  { private header "__type_traits/is_move_assignable.h" }
+    module is_move_constructible               { private header "__type_traits/is_move_constructible.h" }
+    module is_nothrow_assignable               { private header "__type_traits/is_nothrow_assignable.h" }
+    module is_nothrow_constructible            { private header "__type_traits/is_nothrow_constructible.h" }
+    module is_nothrow_convertible              { private header "__type_traits/is_nothrow_convertible.h" }
+    module is_nothrow_copy_assignable          { private header "__type_traits/is_nothrow_copy_assignable.h" }
+    module is_nothrow_copy_constructible       { private header "__type_traits/is_nothrow_copy_constructible.h" }
+    module is_nothrow_default_constructible    { private header "__type_traits/is_nothrow_default_constructible.h" }
+    module is_nothrow_destructible             { private header "__type_traits/is_nothrow_destructible.h" }
+    module is_nothrow_move_assignable          { private header "__type_traits/is_nothrow_move_assignable.h" }
+    module is_nothrow_move_constructible       { private header "__type_traits/is_nothrow_move_constructible.h" }
+    module is_null_pointer                     { private header "__type_traits/is_null_pointer.h" }
+    module is_object                           { private header "__type_traits/is_object.h" }
+    module is_pod                              { private header "__type_traits/is_pod.h" }
+    module is_pointer                          { private header "__type_traits/is_pointer.h" }
+    module is_polymorphic                      { private header "__type_traits/is_polymorphic.h" }
+    module is_primary_template                 { private header "__type_traits/is_primary_template.h" }
+    module is_reference                        { private header "__type_traits/is_reference.h" }
+    module is_reference_wrapper                { private header "__type_traits/is_reference_wrapper.h" }
+    module is_referenceable                    { private header "__type_traits/is_referenceable.h" }
+    module is_same                             {
+      private header "__type_traits/is_same.h"
+      export type_traits.integral_constant
+    }
+    module is_scalar                           { private header "__type_traits/is_scalar.h" }
+    module is_scoped_enum                      { private header "__type_traits/is_scoped_enum.h" }
+    module is_signed                           { private header "__type_traits/is_signed.h" }
+    module is_signed_integer                   { private header "__type_traits/is_signed_integer.h" }
+    module is_specialization                   { private header "__type_traits/is_specialization.h" }
+    module is_standard_layout                  { private header "__type_traits/is_standard_layout.h" }
+    module is_swappable                        { private header "__type_traits/is_swappable.h" }
+    module is_trivial                          { private header "__type_traits/is_trivial.h" }
+    module is_trivially_assignable             { private header "__type_traits/is_trivially_assignable.h" }
+    module is_trivially_constructible          { private header "__type_traits/is_trivially_constructible.h" }
+    module is_trivially_copy_assignable        { private header "__type_traits/is_trivially_copy_assignable.h" }
+    module is_trivially_copy_constructible     { private header "__type_traits/is_trivially_copy_constructible.h" }
+    module is_trivially_copyable               { private header "__type_traits/is_trivially_copyable.h" }
+    module is_trivially_default_constructible  { private header "__type_traits/is_trivially_default_constructible.h" }
+    module is_trivially_destructible           { private header "__type_traits/is_trivially_destructible.h" }
+    module is_trivially_move_assignable        { private header "__type_traits/is_trivially_move_assignable.h" }
+    module is_trivially_move_constructible     { private header "__type_traits/is_trivially_move_constructible.h" }
+    module is_unbounded_array                  { private header "__type_traits/is_unbounded_array.h" }
+    module is_union                            { private header "__type_traits/is_union.h" }
+    module is_unsigned                         { private header "__type_traits/is_unsigned.h" }
+    module is_unsigned_integer                 { private header "__type_traits/is_unsigned_integer.h" }
+    module is_valid_expansion                  { private header "__type_traits/is_valid_expansion.h" }
+    module is_void                             {
+      private header "__type_traits/is_void.h"
+      export integral_constant
+    }
+    module is_volatile                         { private header "__type_traits/is_volatile.h" }
+    module lazy                                { private header "__type_traits/lazy.h" }
+    module make_32_64_or_128_bit               { private header "__type_traits/make_32_64_or_128_bit.h" }
+    module make_const_lvalue_ref               { private header "__type_traits/make_const_lvalue_ref.h" }
+    module make_signed                         { private header "__type_traits/make_signed.h" }
+    module make_unsigned                       { private header "__type_traits/make_unsigned.h" }
+    module maybe_const                         { private header "__type_traits/maybe_const.h" }
+    module nat                                 { private header "__type_traits/nat.h" }
+    module negation                            { private header "__type_traits/negation.h" }
+    module noexcept_move_assign_container      { private header "__type_traits/noexcept_move_assign_container.h" }
+    module promote                             { private header "__type_traits/promote.h" }
+    module rank                                { private header "__type_traits/rank.h" }
+    module remove_all_extents                  { private header "__type_traits/remove_all_extents.h" }
+    module remove_const                        { private header "__type_traits/remove_const.h" }
+    module remove_const_ref                    { private header "__type_traits/remove_const_ref.h" }
+    module remove_cv                           { private header "__type_traits/remove_cv.h" }
+    module remove_cvref                        { private header "__type_traits/remove_cvref.h" }
+    module remove_extent                       { private header "__type_traits/remove_extent.h" }
+    module remove_pointer                      { private header "__type_traits/remove_pointer.h" }
+    module remove_reference                    { private header "__type_traits/remove_reference.h" }
+    module remove_volatile                     { private header "__type_traits/remove_volatile.h" }
+    module result_of                           { private header "__type_traits/result_of.h" }
+    module strip_signature                     { private header "__type_traits/strip_signature.h" }
+    module type_identity                       { private header "__type_traits/type_identity.h" }
+    module type_list                           { private header "__type_traits/type_list.h" }
+    module underlying_type                     { private header "__type_traits/underlying_type.h" }
+    module void_t                              { private header "__type_traits/void_t.h" }
+  }
+  module typeindex {
+    header "typeindex"
+    export *
+  }
+  module typeinfo {
+    header "typeinfo"
+    export *
+  }
+  module unordered_map {
+    header "unordered_map"
+    export initializer_list
+    export *
+  }
+  module unordered_set {
+    header "unordered_set"
+    export initializer_list
+    export *
+  }
+  module utility {
+    header "utility"
+    export initializer_list
+    export *
+
+    module __utility {
+      module as_const            { private header "__utility/as_const.h" }
+      module auto_cast           { private header "__utility/auto_cast.h" }
+      module cmp                 { private header "__utility/cmp.h" }
+      module convert_to_integral { private header "__utility/convert_to_integral.h" }
+      module declval             { private header "__utility/declval.h" }
+      module exception_guard     { private header "__utility/exception_guard.h" }
+      module exchange            { private header "__utility/exchange.h" }
+      module forward             { private header "__utility/forward.h" }
+      module forward_like        { private header "__utility/forward_like.h" }
+      module in_place            { private header "__utility/in_place.h" }
+      module integer_sequence    { private header "__utility/integer_sequence.h" }
+      module move                { private header "__utility/move.h" }
+      module pair                { private header "__utility/pair.h" }
+      module pair_fwd            { private header "__fwd/pair.h" }
+      module piecewise_construct { private header "__utility/piecewise_construct.h" }
+      module priority_tag        { private header "__utility/priority_tag.h" }
+      module rel_ops             { private header "__utility/rel_ops.h" }
+      module swap                { private header "__utility/swap.h" }
+      module to_underlying       { private header "__utility/to_underlying.h" }
+      module unreachable         { private header "__utility/unreachable.h" }
+    }
+  }
+  module valarray {
+    header "valarray"
+    export initializer_list
+    export *
+  }
+  module variant {
+    header "variant"
+    export *
+
+    module __variant {
+      module monostate { private header "__variant/monostate.h" }
+    }
+  }
+  module vector {
+    header "vector"
+    export initializer_list
+    export *
+  }
+  module version {
+    header "version"
+    export *
+  }
+
+  // FIXME: These should be private.
+  module __assert            {         header "__assert"            export * }
+  module __availability      { private header "__availability"      export * }
+  module __bit_reference     { private header "__bit_reference"     export * }
+  module __debug             {         header "__debug"             export * }
+  module __errc              { private header "__errc"              export * }
+  module __hash_table        {         header "__hash_table"        export * }
+  module __locale            {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    private header "__locale" export *
+  }
+  module __mbstate_t         { private header "__mbstate_t.h"       export * }
+  module __mutex_base        { private header "__mutex_base"        export * }
+  module __node_handle       { private header "__node_handle"       export * }
+  module __split_buffer      { private header "__split_buffer"      export * }
+  module __std_stream        {
+    @requires_LIBCXX_ENABLE_LOCALIZATION@
+    private header "__std_stream" export *
+  }
+  module __threading_support {         header "__threading_support" export * }
+  module __tree              {         header "__tree"              export * }
+  module __undef_macros      {         header "__undef_macros"      export * }
+  module __verbose_abort     {         header "__verbose_abort"     export * }
+
+  module experimental {
+    requires cplusplus11
+
+    module algorithm {
+      header "experimental/algorithm"
+      export *
+    }
+    module coroutine {
+      requires coroutines
+      header "experimental/coroutine"
+      export *
+    }
+    module deque {
+      header "experimental/deque"
+      export *
+    }
+    module forward_list {
+      header "experimental/forward_list"
+      export *
+    }
+    module functional {
+      header "experimental/functional"
+      export *
+    }
+    module iterator {
+      header "experimental/iterator"
+      export *
+    }
+    module list {
+      header "experimental/list"
+      export *
+    }
+    module map {
+      header "experimental/map"
+      export *
+    }
+    module memory_resource {
+      header "experimental/memory_resource"
+      export *
+    }
+    module propagate_const {
+      header "experimental/propagate_const"
+      export *
+    }
+    module regex {
+      @requires_LIBCXX_ENABLE_LOCALIZATION@
+      header "experimental/regex"
+      export *
+    }
+    module simd {
+      header "experimental/simd"
+      export *
+    }
+    module set {
+      header "experimental/set"
+      export *
+    }
+    module span {
+      header "span"
+      export *
+    }
+    module string {
+      header "experimental/string"
+      export *
+    }
+    module type_traits {
+      header "experimental/type_traits"
+      export *
+    }
+    module unordered_map {
+      header "experimental/unordered_map"
+      export *
+    }
+    module unordered_set {
+      header "experimental/unordered_set"
+      export *
+    }
+    module utility {
+      header "experimental/utility"
+      export *
+    }
+    module vector {
+      header "experimental/vector"
+      export *
+    }
+    // FIXME these should be private
+    module __memory {
+      header "experimental/__memory"
+      export *
+    }
+  } // end experimental
+}
diff --git a/app/src/main/cpp/libcxx/include/mutex b/app/src/main/cpp/libcxx/include/mutex
new file mode 100644
index 0000000..d93fba8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/mutex
@@ -0,0 +1,712 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_MUTEX
+#define _LIBCPP_MUTEX
+
+/*
+    mutex synopsis
+
+namespace std
+{
+
+class mutex
+{
+public:
+     constexpr mutex() noexcept;
+     ~mutex();
+
+    mutex(const mutex&) = delete;
+    mutex& operator=(const mutex&) = delete;
+
+    void lock();
+    bool try_lock();
+    void unlock();
+
+    typedef pthread_mutex_t* native_handle_type;
+    native_handle_type native_handle();
+};
+
+class recursive_mutex
+{
+public:
+     recursive_mutex();
+     ~recursive_mutex();
+
+    recursive_mutex(const recursive_mutex&) = delete;
+    recursive_mutex& operator=(const recursive_mutex&) = delete;
+
+    void lock();
+    bool try_lock() noexcept;
+    void unlock();
+
+    typedef pthread_mutex_t* native_handle_type;
+    native_handle_type native_handle();
+};
+
+class timed_mutex
+{
+public:
+     timed_mutex();
+     ~timed_mutex();
+
+    timed_mutex(const timed_mutex&) = delete;
+    timed_mutex& operator=(const timed_mutex&) = delete;
+
+    void lock();
+    bool try_lock();
+    template <class Rep, class Period>
+        bool try_lock_for(const chrono::duration<Rep, Period>& rel_time);
+    template <class Clock, class Duration>
+        bool try_lock_until(const chrono::time_point<Clock, Duration>& abs_time);
+    void unlock();
+};
+
+class recursive_timed_mutex
+{
+public:
+     recursive_timed_mutex();
+     ~recursive_timed_mutex();
+
+    recursive_timed_mutex(const recursive_timed_mutex&) = delete;
+    recursive_timed_mutex& operator=(const recursive_timed_mutex&) = delete;
+
+    void lock();
+    bool try_lock() noexcept;
+    template <class Rep, class Period>
+        bool try_lock_for(const chrono::duration<Rep, Period>& rel_time);
+    template <class Clock, class Duration>
+        bool try_lock_until(const chrono::time_point<Clock, Duration>& abs_time);
+    void unlock();
+};
+
+struct defer_lock_t { explicit defer_lock_t() = default; };
+struct try_to_lock_t { explicit try_to_lock_t() = default; };
+struct adopt_lock_t { explicit adopt_lock_t() = default; };
+
+inline constexpr defer_lock_t  defer_lock{};
+inline constexpr try_to_lock_t try_to_lock{};
+inline constexpr adopt_lock_t  adopt_lock{};
+
+template <class Mutex>
+class lock_guard
+{
+public:
+    typedef Mutex mutex_type;
+
+    explicit lock_guard(mutex_type& m);
+    lock_guard(mutex_type& m, adopt_lock_t);
+    ~lock_guard();
+
+    lock_guard(lock_guard const&) = delete;
+    lock_guard& operator=(lock_guard const&) = delete;
+};
+
+template <class... MutexTypes>
+class scoped_lock // C++17
+{
+public:
+    using mutex_type = Mutex;  // Only if sizeof...(MutexTypes) == 1
+
+    explicit scoped_lock(MutexTypes&... m);
+    scoped_lock(adopt_lock_t, MutexTypes&... m);
+    ~scoped_lock();
+    scoped_lock(scoped_lock const&) = delete;
+    scoped_lock& operator=(scoped_lock const&) = delete;
+private:
+    tuple<MutexTypes&...> pm; // exposition only
+};
+
+template <class Mutex>
+class unique_lock
+{
+public:
+    typedef Mutex mutex_type;
+    unique_lock() noexcept;
+    explicit unique_lock(mutex_type& m);
+    unique_lock(mutex_type& m, defer_lock_t) noexcept;
+    unique_lock(mutex_type& m, try_to_lock_t);
+    unique_lock(mutex_type& m, adopt_lock_t);
+    template <class Clock, class Duration>
+        unique_lock(mutex_type& m, const chrono::time_point<Clock, Duration>& abs_time);
+    template <class Rep, class Period>
+        unique_lock(mutex_type& m, const chrono::duration<Rep, Period>& rel_time);
+    ~unique_lock();
+
+    unique_lock(unique_lock const&) = delete;
+    unique_lock& operator=(unique_lock const&) = delete;
+
+    unique_lock(unique_lock&& u) noexcept;
+    unique_lock& operator=(unique_lock&& u) noexcept;
+
+    void lock();
+    bool try_lock();
+
+    template <class Rep, class Period>
+        bool try_lock_for(const chrono::duration<Rep, Period>& rel_time);
+    template <class Clock, class Duration>
+        bool try_lock_until(const chrono::time_point<Clock, Duration>& abs_time);
+
+    void unlock();
+
+    void swap(unique_lock& u) noexcept;
+    mutex_type* release() noexcept;
+
+    bool owns_lock() const noexcept;
+    explicit operator bool () const noexcept;
+    mutex_type* mutex() const noexcept;
+};
+
+template <class Mutex>
+  void swap(unique_lock<Mutex>& x, unique_lock<Mutex>& y) noexcept;
+
+template <class L1, class L2, class... L3>
+  int try_lock(L1&, L2&, L3&...);
+template <class L1, class L2, class... L3>
+  void lock(L1&, L2&, L3&...);
+
+struct once_flag
+{
+    constexpr once_flag() noexcept;
+
+    once_flag(const once_flag&) = delete;
+    once_flag& operator=(const once_flag&) = delete;
+};
+
+template<class Callable, class ...Args>
+  void call_once(once_flag& flag, Callable&& func, Args&&... args);
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__memory/shared_ptr.h>
+#include <__mutex_base>
+#include <__threading_support>
+#include <__utility/forward.h>
+#include <cstdint>
+#ifndef _LIBCPP_CXX03_LANG
+# include <tuple>
+#endif
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#ifndef _LIBCPP_HAS_NO_THREADS
+
+class _LIBCPP_TYPE_VIS recursive_mutex
+{
+    __libcpp_recursive_mutex_t __m_;
+
+public:
+    recursive_mutex();
+    ~recursive_mutex();
+
+    recursive_mutex(const recursive_mutex&) = delete;
+    recursive_mutex& operator=(const recursive_mutex&) = delete;
+
+    void lock();
+    bool try_lock() _NOEXCEPT;
+    void unlock()  _NOEXCEPT;
+
+    typedef __libcpp_recursive_mutex_t* native_handle_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    native_handle_type native_handle() {return &__m_;}
+};
+
+class _LIBCPP_TYPE_VIS timed_mutex
+{
+    mutex              __m_;
+    condition_variable __cv_;
+    bool               __locked_;
+public:
+     timed_mutex();
+     ~timed_mutex();
+
+    timed_mutex(const timed_mutex&) = delete;
+    timed_mutex& operator=(const timed_mutex&) = delete;
+
+public:
+    void lock();
+    bool try_lock() _NOEXCEPT;
+    template <class _Rep, class _Period>
+        _LIBCPP_INLINE_VISIBILITY
+        bool try_lock_for(const chrono::duration<_Rep, _Period>& __d)
+            {return try_lock_until(chrono::steady_clock::now() + __d);}
+    template <class _Clock, class _Duration>
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        bool try_lock_until(const chrono::time_point<_Clock, _Duration>& __t);
+    void unlock() _NOEXCEPT;
+};
+
+template <class _Clock, class _Duration>
+bool
+timed_mutex::try_lock_until(const chrono::time_point<_Clock, _Duration>& __t)
+{
+    using namespace chrono;
+    unique_lock<mutex> __lk(__m_);
+    bool no_timeout = _Clock::now() < __t;
+    while (no_timeout && __locked_)
+        no_timeout = __cv_.wait_until(__lk, __t) == cv_status::no_timeout;
+    if (!__locked_)
+    {
+        __locked_ = true;
+        return true;
+    }
+    return false;
+}
+
+class _LIBCPP_TYPE_VIS recursive_timed_mutex
+{
+    mutex              __m_;
+    condition_variable __cv_;
+    size_t             __count_;
+    __thread_id        __id_;
+public:
+    recursive_timed_mutex();
+    ~recursive_timed_mutex();
+
+    recursive_timed_mutex(const recursive_timed_mutex&) = delete;
+    recursive_timed_mutex& operator=(const recursive_timed_mutex&) = delete;
+
+    void lock();
+    bool try_lock() _NOEXCEPT;
+    template <class _Rep, class _Period>
+        _LIBCPP_INLINE_VISIBILITY
+        bool try_lock_for(const chrono::duration<_Rep, _Period>& __d)
+            {return try_lock_until(chrono::steady_clock::now() + __d);}
+    template <class _Clock, class _Duration>
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        bool try_lock_until(const chrono::time_point<_Clock, _Duration>& __t);
+    void unlock() _NOEXCEPT;
+};
+
+template <class _Clock, class _Duration>
+bool
+recursive_timed_mutex::try_lock_until(const chrono::time_point<_Clock, _Duration>& __t)
+{
+    using namespace chrono;
+    __thread_id __id = this_thread::get_id();
+    unique_lock<mutex> lk(__m_);
+    if (__id == __id_)
+    {
+        if (__count_ == numeric_limits<size_t>::max())
+            return false;
+        ++__count_;
+        return true;
+    }
+    bool no_timeout = _Clock::now() < __t;
+    while (no_timeout && __count_ != 0)
+        no_timeout = __cv_.wait_until(lk, __t) == cv_status::no_timeout;
+    if (__count_ == 0)
+    {
+        __count_ = 1;
+        __id_ = __id;
+        return true;
+    }
+    return false;
+}
+
+template <class _L0, class _L1>
+_LIBCPP_HIDE_FROM_ABI int
+try_lock(_L0& __l0, _L1& __l1)
+{
+    unique_lock<_L0> __u0(__l0, try_to_lock);
+    if (__u0.owns_lock())
+    {
+        if (__l1.try_lock())
+        {
+            __u0.release();
+            return -1;
+        }
+        else
+            return 1;
+    }
+    return 0;
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _L0, class _L1, class _L2, class... _L3>
+_LIBCPP_HIDE_FROM_ABI int
+try_lock(_L0& __l0, _L1& __l1, _L2& __l2, _L3&... __l3)
+{
+    int __r = 0;
+    unique_lock<_L0> __u0(__l0, try_to_lock);
+    if (__u0.owns_lock())
+    {
+        __r = std::try_lock(__l1, __l2, __l3...);
+        if (__r == -1)
+            __u0.release();
+        else
+            ++__r;
+    }
+    return __r;
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _L0, class _L1>
+_LIBCPP_HIDE_FROM_ABI void
+lock(_L0& __l0, _L1& __l1)
+{
+    while (true)
+    {
+        {
+            unique_lock<_L0> __u0(__l0);
+            if (__l1.try_lock())
+            {
+                __u0.release();
+                break;
+            }
+        }
+        __libcpp_thread_yield();
+        {
+            unique_lock<_L1> __u1(__l1);
+            if (__l0.try_lock())
+            {
+                __u1.release();
+                break;
+            }
+        }
+        __libcpp_thread_yield();
+    }
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _L0, class _L1, class _L2, class ..._L3>
+void
+__lock_first(int __i, _L0& __l0, _L1& __l1, _L2& __l2, _L3& ...__l3)
+{
+    while (true)
+    {
+        switch (__i)
+        {
+        case 0:
+            {
+                unique_lock<_L0> __u0(__l0);
+                __i = std::try_lock(__l1, __l2, __l3...);
+                if (__i == -1)
+                {
+                    __u0.release();
+                    return;
+                }
+            }
+            ++__i;
+            __libcpp_thread_yield();
+            break;
+        case 1:
+            {
+                unique_lock<_L1> __u1(__l1);
+                __i = std::try_lock(__l2, __l3..., __l0);
+                if (__i == -1)
+                {
+                    __u1.release();
+                    return;
+                }
+            }
+            if (__i == sizeof...(_L3) + 1)
+                __i = 0;
+            else
+                __i += 2;
+            __libcpp_thread_yield();
+            break;
+        default:
+            std::__lock_first(__i - 2, __l2, __l3..., __l0, __l1);
+            return;
+        }
+    }
+}
+
+template <class _L0, class _L1, class _L2, class ..._L3>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+lock(_L0& __l0, _L1& __l1, _L2& __l2, _L3& ...__l3)
+{
+    std::__lock_first(0, __l0, __l1, __l2, __l3...);
+}
+
+template <class _L0>
+inline _LIBCPP_INLINE_VISIBILITY
+void __unlock(_L0& __l0) {
+    __l0.unlock();
+}
+
+template <class _L0, class _L1>
+inline _LIBCPP_INLINE_VISIBILITY
+void __unlock(_L0& __l0, _L1& __l1) {
+    __l0.unlock();
+    __l1.unlock();
+}
+
+template <class _L0, class _L1, class _L2, class ..._L3>
+inline _LIBCPP_INLINE_VISIBILITY
+void __unlock(_L0& __l0, _L1& __l1, _L2& __l2, _L3&... __l3) {
+    __l0.unlock();
+    __l1.unlock();
+    _VSTD::__unlock(__l2, __l3...);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+#if _LIBCPP_STD_VER > 14
+template <class ..._Mutexes>
+class _LIBCPP_TEMPLATE_VIS scoped_lock;
+
+template <>
+class _LIBCPP_TEMPLATE_VIS scoped_lock<> {
+public:
+    explicit scoped_lock() {}
+    ~scoped_lock() = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit scoped_lock(adopt_lock_t) {}
+
+    scoped_lock(scoped_lock const&) = delete;
+    scoped_lock& operator=(scoped_lock const&) = delete;
+};
+
+template <class _Mutex>
+class _LIBCPP_TEMPLATE_VIS _LIBCPP_THREAD_SAFETY_ANNOTATION(scoped_lockable) scoped_lock<_Mutex> {
+public:
+    typedef _Mutex  mutex_type;
+private:
+    mutex_type& __m_;
+public:
+    explicit scoped_lock(mutex_type & __m) _LIBCPP_THREAD_SAFETY_ANNOTATION(acquire_capability(__m))
+        : __m_(__m) {__m_.lock();}
+
+    ~scoped_lock() _LIBCPP_THREAD_SAFETY_ANNOTATION(release_capability()) {__m_.unlock();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit scoped_lock(adopt_lock_t, mutex_type& __m) _LIBCPP_THREAD_SAFETY_ANNOTATION(requires_capability(__m))
+        : __m_(__m) {}
+
+    scoped_lock(scoped_lock const&) = delete;
+    scoped_lock& operator=(scoped_lock const&) = delete;
+};
+
+template <class ..._MArgs>
+class _LIBCPP_TEMPLATE_VIS scoped_lock
+{
+    static_assert(sizeof...(_MArgs) > 1, "At least 2 lock types required");
+    typedef tuple<_MArgs&...> _MutexTuple;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit scoped_lock(_MArgs&... __margs)
+      : __t_(__margs...)
+    {
+        _VSTD::lock(__margs...);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    scoped_lock(adopt_lock_t, _MArgs&... __margs)
+        : __t_(__margs...)
+    {
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~scoped_lock() {
+        typedef typename __make_tuple_indices<sizeof...(_MArgs)>::type _Indices;
+        __unlock_unpack(_Indices{}, __t_);
+    }
+
+    scoped_lock(scoped_lock const&) = delete;
+    scoped_lock& operator=(scoped_lock const&) = delete;
+
+private:
+    template <size_t ..._Indx>
+    _LIBCPP_INLINE_VISIBILITY
+    static void __unlock_unpack(__tuple_indices<_Indx...>, _MutexTuple& __mt) {
+        _VSTD::__unlock(_VSTD::get<_Indx>(__mt)...);
+    }
+
+    _MutexTuple __t_;
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(scoped_lock);
+
+#endif // _LIBCPP_STD_VER > 14
+#endif // !_LIBCPP_HAS_NO_THREADS
+
+struct _LIBCPP_TEMPLATE_VIS once_flag;
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template<class _Callable, class... _Args>
+_LIBCPP_INLINE_VISIBILITY
+void call_once(once_flag&, _Callable&&, _Args&&...);
+
+#else  // _LIBCPP_CXX03_LANG
+
+template<class _Callable>
+_LIBCPP_INLINE_VISIBILITY
+void call_once(once_flag&, _Callable&);
+
+template<class _Callable>
+_LIBCPP_INLINE_VISIBILITY
+void call_once(once_flag&, const _Callable&);
+
+#endif // _LIBCPP_CXX03_LANG
+
+struct _LIBCPP_TEMPLATE_VIS once_flag
+{
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR
+        once_flag() _NOEXCEPT : __state_(0) {}
+    once_flag(const once_flag&) = delete;
+    once_flag& operator=(const once_flag&) = delete;
+
+#if defined(_LIBCPP_ABI_MICROSOFT)
+   typedef uintptr_t _State_type;
+#else
+   typedef unsigned long _State_type;
+#endif
+
+private:
+    _State_type __state_;
+
+#ifndef _LIBCPP_CXX03_LANG
+    template<class _Callable, class... _Args>
+    friend
+    void call_once(once_flag&, _Callable&&, _Args&&...);
+#else  // _LIBCPP_CXX03_LANG
+    template<class _Callable>
+    friend
+    void call_once(once_flag&, _Callable&);
+
+    template<class _Callable>
+    friend
+    void call_once(once_flag&, const _Callable&);
+#endif // _LIBCPP_CXX03_LANG
+};
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Fp>
+class __call_once_param
+{
+    _Fp& __f_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __call_once_param(_Fp& __f) : __f_(__f) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator()()
+    {
+        typedef typename __make_tuple_indices<tuple_size<_Fp>::value, 1>::type _Index;
+        __execute(_Index());
+    }
+
+private:
+    template <size_t ..._Indices>
+    _LIBCPP_INLINE_VISIBILITY
+    void __execute(__tuple_indices<_Indices...>)
+    {
+        _VSTD::__invoke(_VSTD::get<0>(_VSTD::move(__f_)), _VSTD::get<_Indices>(_VSTD::move(__f_))...);
+    }
+};
+
+#else
+
+template <class _Fp>
+class __call_once_param
+{
+    _Fp& __f_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __call_once_param(_Fp& __f) : __f_(__f) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator()()
+    {
+        __f_();
+    }
+};
+
+#endif
+
+template <class _Fp>
+void _LIBCPP_INLINE_VISIBILITY
+__call_once_proxy(void* __vp)
+{
+    __call_once_param<_Fp>* __p = static_cast<__call_once_param<_Fp>*>(__vp);
+    (*__p)();
+}
+
+_LIBCPP_FUNC_VIS void __call_once(volatile once_flag::_State_type&, void*,
+                                  void (*)(void*));
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template<class _Callable, class... _Args>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+call_once(once_flag& __flag, _Callable&& __func, _Args&&... __args)
+{
+    if (__libcpp_acquire_load(&__flag.__state_) != ~once_flag::_State_type(0))
+    {
+        typedef tuple<_Callable&&, _Args&&...> _Gp;
+        _Gp __f(_VSTD::forward<_Callable>(__func), _VSTD::forward<_Args>(__args)...);
+        __call_once_param<_Gp> __p(__f);
+        std::__call_once(__flag.__state_, &__p, &__call_once_proxy<_Gp>);
+    }
+}
+
+#else  // _LIBCPP_CXX03_LANG
+
+template<class _Callable>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+call_once(once_flag& __flag, _Callable& __func)
+{
+    if (__libcpp_acquire_load(&__flag.__state_) != ~once_flag::_State_type(0))
+    {
+        __call_once_param<_Callable> __p(__func);
+        std::__call_once(__flag.__state_, &__p, &__call_once_proxy<_Callable>);
+    }
+}
+
+template<class _Callable>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+call_once(once_flag& __flag, const _Callable& __func)
+{
+    if (__libcpp_acquire_load(&__flag.__state_) != ~once_flag::_State_type(0))
+    {
+        __call_once_param<const _Callable> __p(__func);
+        std::__call_once(__flag.__state_, &__p, &__call_once_proxy<const _Callable>);
+    }
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <functional>
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_MUTEX
diff --git a/app/src/main/cpp/libcxx/include/new b/app/src/main/cpp/libcxx/include/new
new file mode 100644
index 0000000..0c826f4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/new
@@ -0,0 +1,410 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_NEW
+#define _LIBCPP_NEW
+
+/*
+    new synopsis
+
+namespace std
+{
+
+class bad_alloc
+    : public exception
+{
+public:
+    bad_alloc() noexcept;
+    bad_alloc(const bad_alloc&) noexcept;
+    bad_alloc& operator=(const bad_alloc&) noexcept;
+    virtual const char* what() const noexcept;
+};
+
+class bad_array_new_length : public bad_alloc // C++14
+{
+public:
+    bad_array_new_length() noexcept;
+};
+
+enum class align_val_t : size_t {}; // C++17
+
+struct destroying_delete_t { // C++20
+  explicit destroying_delete_t() = default;
+};
+inline constexpr destroying_delete_t destroying_delete{}; // C++20
+
+struct nothrow_t { explicit nothrow_t() = default; };
+extern const nothrow_t nothrow;
+typedef void (*new_handler)();
+new_handler set_new_handler(new_handler new_p) noexcept;
+new_handler get_new_handler() noexcept;
+
+// 21.6.4, pointer optimization barrier
+template <class T> constexpr T* launder(T* p) noexcept; // C++17
+}  // std
+
+void* operator new(std::size_t size);                                   // replaceable, nodiscard in C++20
+void* operator new(std::size_t size, std::align_val_t alignment);       // replaceable, C++17, nodiscard in C++20
+void* operator new(std::size_t size, const std::nothrow_t&) noexcept;   // replaceable, nodiscard in C++20
+void* operator new(std::size_t size, std::align_val_t alignment,
+                   const std::nothrow_t&) noexcept;                     // replaceable, C++17, nodiscard in C++20
+void  operator delete(void* ptr) noexcept;                              // replaceable
+void  operator delete(void* ptr, std::size_t size) noexcept;            // replaceable, C++14
+void  operator delete(void* ptr, std::align_val_t alignment) noexcept;  // replaceable, C++17
+void  operator delete(void* ptr, std::size_t size,
+                      std::align_val_t alignment) noexcept;             // replaceable, C++17
+void  operator delete(void* ptr, const std::nothrow_t&) noexcept;       // replaceable
+void  operator delete(void* ptr, std:align_val_t alignment,
+                      const std::nothrow_t&) noexcept;                  // replaceable, C++17
+
+void* operator new[](std::size_t size);                                 // replaceable, nodiscard in C++20
+void* operator new[](std::size_t size,
+                     std::align_val_t alignment) noexcept;              // replaceable, C++17, nodiscard in C++20
+void* operator new[](std::size_t size, const std::nothrow_t&) noexcept; // replaceable, nodiscard in C++20
+void* operator new[](std::size_t size, std::align_val_t alignment,
+                     const std::nothrow_t&) noexcept;                   // replaceable, C++17, nodiscard in C++20
+void  operator delete[](void* ptr) noexcept;                            // replaceable
+void  operator delete[](void* ptr, std::size_t size) noexcept;          // replaceable, C++14
+void  operator delete[](void* ptr,
+                        std::align_val_t alignment) noexcept;           // replaceable, C++17
+void  operator delete[](void* ptr, std::size_t size,
+                        std::align_val_t alignment) noexcept;           // replaceable, C++17
+void  operator delete[](void* ptr, const std::nothrow_t&) noexcept;     // replaceable
+void  operator delete[](void* ptr, std::align_val_t alignment,
+                        const std::nothrow_t&) noexcept;                // replaceable, C++17
+
+void* operator new  (std::size_t size, void* ptr) noexcept;             // nodiscard in C++20
+void* operator new[](std::size_t size, void* ptr) noexcept;             // nodiscard in C++20
+void  operator delete  (void* ptr, void*) noexcept;
+void  operator delete[](void* ptr, void*) noexcept;
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__config>
+#include <__type_traits/is_function.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/remove_cv.h>
+#include <cstddef>
+#include <cstdlib>
+#include <exception>
+#include <version>
+
+#if defined(_LIBCPP_ABI_VCRUNTIME)
+#include <new.h>
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if !defined(__cpp_sized_deallocation) || __cpp_sized_deallocation  < 201309L
+#define _LIBCPP_HAS_NO_LANGUAGE_SIZED_DEALLOCATION
+#endif
+
+#if !defined(_LIBCPP_BUILDING_LIBRARY) && _LIBCPP_STD_VER < 14 && \
+    defined(_LIBCPP_HAS_NO_LANGUAGE_SIZED_DEALLOCATION)
+# define _LIBCPP_HAS_NO_LIBRARY_SIZED_DEALLOCATION
+#endif
+
+#if defined(_LIBCPP_HAS_NO_LIBRARY_SIZED_DEALLOCATION) || \
+    defined(_LIBCPP_HAS_NO_LANGUAGE_SIZED_DEALLOCATION)
+# define _LIBCPP_HAS_NO_SIZED_DEALLOCATION
+#endif
+
+namespace std  // purposefully not using versioning namespace
+{
+
+#if !defined(_LIBCPP_ABI_VCRUNTIME)
+struct _LIBCPP_TYPE_VIS nothrow_t { explicit nothrow_t() = default; };
+extern _LIBCPP_FUNC_VIS const nothrow_t nothrow;
+
+class _LIBCPP_EXCEPTION_ABI bad_alloc
+    : public exception
+{
+public:
+    bad_alloc() _NOEXCEPT;
+    ~bad_alloc() _NOEXCEPT override;
+    const char* what() const _NOEXCEPT override;
+};
+
+class _LIBCPP_EXCEPTION_ABI bad_array_new_length
+    : public bad_alloc
+{
+public:
+    bad_array_new_length() _NOEXCEPT;
+    ~bad_array_new_length() _NOEXCEPT override;
+    const char* what() const _NOEXCEPT override;
+};
+
+typedef void (*new_handler)();
+_LIBCPP_FUNC_VIS new_handler set_new_handler(new_handler) _NOEXCEPT;
+_LIBCPP_FUNC_VIS new_handler get_new_handler() _NOEXCEPT;
+
+#elif defined(_HAS_EXCEPTIONS) && _HAS_EXCEPTIONS == 0 // !_LIBCPP_ABI_VCRUNTIME
+
+// When _HAS_EXCEPTIONS == 0, these complete definitions are needed,
+// since they would normally be provided in vcruntime_exception.h
+class bad_alloc : public exception {
+public:
+  bad_alloc() noexcept : exception("bad allocation") {}
+
+private:
+  friend class bad_array_new_length;
+
+  bad_alloc(char const* const __message) noexcept : exception(__message) {}
+};
+
+class bad_array_new_length : public bad_alloc {
+public:
+  bad_array_new_length() noexcept : bad_alloc("bad array new length") {}
+};
+#endif // defined(_LIBCPP_ABI_VCRUNTIME) && defined(_HAS_EXCEPTIONS) && _HAS_EXCEPTIONS == 0
+
+_LIBCPP_NORETURN _LIBCPP_FUNC_VIS void __throw_bad_alloc();  // not in C++ spec
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_bad_array_new_length()
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw bad_array_new_length();
+#else
+    _VSTD::abort();
+#endif
+}
+
+#if !defined(_LIBCPP_HAS_NO_LIBRARY_ALIGNED_ALLOCATION) && \
+    !defined(_LIBCPP_ABI_VCRUNTIME)
+#ifndef _LIBCPP_CXX03_LANG
+enum class _LIBCPP_ENUM_VIS align_val_t : size_t { };
+#else
+enum align_val_t { __zero = 0, __max = (size_t)-1 };
+#endif
+#endif
+
+#if _LIBCPP_STD_VER > 17
+// Enable the declaration even if the compiler doesn't support the language
+// feature.
+struct destroying_delete_t {
+  explicit destroying_delete_t() = default;
+};
+inline constexpr destroying_delete_t destroying_delete{};
+#endif // _LIBCPP_STD_VER > 17
+
+} // namespace std
+
+#if defined(_LIBCPP_CXX03_LANG)
+#define _THROW_BAD_ALLOC throw(std::bad_alloc)
+#else
+#define _THROW_BAD_ALLOC
+#endif
+
+#if !defined(_LIBCPP_ABI_VCRUNTIME)
+
+_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_OVERRIDABLE_FUNC_VIS void* operator new(std::size_t __sz) _THROW_BAD_ALLOC;
+_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_OVERRIDABLE_FUNC_VIS void* operator new(std::size_t __sz, const std::nothrow_t&) _NOEXCEPT _LIBCPP_NOALIAS;
+_LIBCPP_OVERRIDABLE_FUNC_VIS void  operator delete(void* __p) _NOEXCEPT;
+_LIBCPP_OVERRIDABLE_FUNC_VIS void  operator delete(void* __p, const std::nothrow_t&) _NOEXCEPT;
+#ifndef _LIBCPP_HAS_NO_LIBRARY_SIZED_DEALLOCATION
+_LIBCPP_OVERRIDABLE_FUNC_VIS _LIBCPP_AVAILABILITY_SIZED_NEW_DELETE void  operator delete(void* __p, std::size_t __sz) _NOEXCEPT;
+#endif
+
+_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_OVERRIDABLE_FUNC_VIS void* operator new[](std::size_t __sz) _THROW_BAD_ALLOC;
+_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_OVERRIDABLE_FUNC_VIS void* operator new[](std::size_t __sz, const std::nothrow_t&) _NOEXCEPT _LIBCPP_NOALIAS;
+_LIBCPP_OVERRIDABLE_FUNC_VIS void  operator delete[](void* __p) _NOEXCEPT;
+_LIBCPP_OVERRIDABLE_FUNC_VIS void  operator delete[](void* __p, const std::nothrow_t&) _NOEXCEPT;
+#ifndef _LIBCPP_HAS_NO_LIBRARY_SIZED_DEALLOCATION
+_LIBCPP_OVERRIDABLE_FUNC_VIS _LIBCPP_AVAILABILITY_SIZED_NEW_DELETE void  operator delete[](void* __p, std::size_t __sz) _NOEXCEPT;
+#endif
+
+#ifndef _LIBCPP_HAS_NO_LIBRARY_ALIGNED_ALLOCATION
+_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_OVERRIDABLE_FUNC_VIS void* operator new(std::size_t __sz, std::align_val_t) _THROW_BAD_ALLOC;
+_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_OVERRIDABLE_FUNC_VIS void* operator new(std::size_t __sz, std::align_val_t, const std::nothrow_t&) _NOEXCEPT _LIBCPP_NOALIAS;
+_LIBCPP_OVERRIDABLE_FUNC_VIS void  operator delete(void* __p, std::align_val_t) _NOEXCEPT;
+_LIBCPP_OVERRIDABLE_FUNC_VIS void  operator delete(void* __p, std::align_val_t, const std::nothrow_t&) _NOEXCEPT;
+#ifndef _LIBCPP_HAS_NO_LIBRARY_SIZED_DEALLOCATION
+_LIBCPP_OVERRIDABLE_FUNC_VIS _LIBCPP_AVAILABILITY_SIZED_NEW_DELETE void  operator delete(void* __p, std::size_t __sz, std::align_val_t) _NOEXCEPT;
+#endif
+
+_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_OVERRIDABLE_FUNC_VIS void* operator new[](std::size_t __sz, std::align_val_t) _THROW_BAD_ALLOC;
+_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_OVERRIDABLE_FUNC_VIS void* operator new[](std::size_t __sz, std::align_val_t, const std::nothrow_t&) _NOEXCEPT _LIBCPP_NOALIAS;
+_LIBCPP_OVERRIDABLE_FUNC_VIS void  operator delete[](void* __p, std::align_val_t) _NOEXCEPT;
+_LIBCPP_OVERRIDABLE_FUNC_VIS void  operator delete[](void* __p, std::align_val_t, const std::nothrow_t&) _NOEXCEPT;
+#ifndef _LIBCPP_HAS_NO_LIBRARY_SIZED_DEALLOCATION
+_LIBCPP_OVERRIDABLE_FUNC_VIS _LIBCPP_AVAILABILITY_SIZED_NEW_DELETE void  operator delete[](void* __p, std::size_t __sz, std::align_val_t) _NOEXCEPT;
+#endif
+#endif
+
+_LIBCPP_NODISCARD_AFTER_CXX17 inline _LIBCPP_INLINE_VISIBILITY void* operator new  (std::size_t, void* __p) _NOEXCEPT {return __p;}
+_LIBCPP_NODISCARD_AFTER_CXX17 inline _LIBCPP_INLINE_VISIBILITY void* operator new[](std::size_t, void* __p) _NOEXCEPT {return __p;}
+inline _LIBCPP_INLINE_VISIBILITY void  operator delete  (void*, void*) _NOEXCEPT {}
+inline _LIBCPP_INLINE_VISIBILITY void  operator delete[](void*, void*) _NOEXCEPT {}
+
+#endif // !_LIBCPP_ABI_VCRUNTIME
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+_LIBCPP_CONSTEXPR inline _LIBCPP_INLINE_VISIBILITY bool __is_overaligned_for_new(size_t __align) _NOEXCEPT {
+#ifdef __STDCPP_DEFAULT_NEW_ALIGNMENT__
+  return __align > __STDCPP_DEFAULT_NEW_ALIGNMENT__;
+#else
+  return __align > alignment_of<max_align_t>::value;
+#endif
+}
+
+template <class ..._Args>
+_LIBCPP_INLINE_VISIBILITY
+void* __libcpp_operator_new(_Args ...__args) {
+#if __has_builtin(__builtin_operator_new) && __has_builtin(__builtin_operator_delete)
+  return __builtin_operator_new(__args...);
+#else
+  return ::operator new(__args...);
+#endif
+}
+
+template <class ..._Args>
+_LIBCPP_INLINE_VISIBILITY
+void __libcpp_operator_delete(_Args ...__args) {
+#if __has_builtin(__builtin_operator_new) && __has_builtin(__builtin_operator_delete)
+  __builtin_operator_delete(__args...);
+#else
+  ::operator delete(__args...);
+#endif
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void *__libcpp_allocate(size_t __size, size_t __align) {
+#ifndef _LIBCPP_HAS_NO_ALIGNED_ALLOCATION
+  if (__is_overaligned_for_new(__align)) {
+    const align_val_t __align_val = static_cast<align_val_t>(__align);
+    return __libcpp_operator_new(__size, __align_val);
+  }
+#endif
+
+  (void)__align;
+  return __libcpp_operator_new(__size);
+}
+
+template <class ..._Args>
+_LIBCPP_INLINE_VISIBILITY
+void __do_deallocate_handle_size(void *__ptr, size_t __size, _Args ...__args) {
+#ifdef _LIBCPP_HAS_NO_SIZED_DEALLOCATION
+  (void)__size;
+  return std::__libcpp_operator_delete(__ptr, __args...);
+#else
+  return std::__libcpp_operator_delete(__ptr, __size, __args...);
+#endif
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void __libcpp_deallocate(void* __ptr, size_t __size, size_t __align) {
+#if defined(_LIBCPP_HAS_NO_ALIGNED_ALLOCATION)
+    (void)__align;
+    return __do_deallocate_handle_size(__ptr, __size);
+#else
+    if (__is_overaligned_for_new(__align)) {
+      const align_val_t __align_val = static_cast<align_val_t>(__align);
+      return __do_deallocate_handle_size(__ptr, __size, __align_val);
+    } else {
+      return __do_deallocate_handle_size(__ptr, __size);
+    }
+#endif
+}
+
+inline _LIBCPP_INLINE_VISIBILITY void __libcpp_deallocate_unsized(void* __ptr, size_t __align) {
+#if defined(_LIBCPP_HAS_NO_ALIGNED_ALLOCATION)
+    (void)__align;
+    return __libcpp_operator_delete(__ptr);
+#else
+    if (__is_overaligned_for_new(__align)) {
+      const align_val_t __align_val = static_cast<align_val_t>(__align);
+      return __libcpp_operator_delete(__ptr, __align_val);
+    } else {
+      return __libcpp_operator_delete(__ptr);
+    }
+#endif
+}
+
+#if !defined(_LIBCPP_HAS_NO_LIBRARY_ALIGNED_ALLOCATION)
+// Low-level helpers to call the aligned allocation and deallocation functions
+// on the target platform. This is used to implement libc++'s own memory
+// allocation routines -- if you need to allocate memory inside the library,
+// chances are that you want to use `__libcpp_allocate` instead.
+//
+// Returns the allocated memory, or `nullptr` on failure.
+inline _LIBCPP_INLINE_VISIBILITY void* __libcpp_aligned_alloc(std::size_t __alignment, std::size_t __size) {
+#  if defined(_LIBCPP_MSVCRT_LIKE)
+    return ::_aligned_malloc(__size, __alignment);
+#  elif _LIBCPP_STD_VER > 14 && !defined(_LIBCPP_HAS_NO_C11_ALIGNED_ALLOC)
+    // aligned_alloc() requires that __size is a multiple of __alignment,
+    // but for C++ [new.delete.general], only states "if the value of an
+    // alignment argument passed to any of these functions is not a valid
+    // alignment value, the behavior is undefined".
+    // To handle calls such as ::operator new(1, std::align_val_t(128)), we
+    // round __size up to the next multiple of __alignment.
+    size_t __rounded_size = (__size + __alignment - 1) & ~(__alignment - 1);
+    // Rounding up could have wrapped around to zero, so we have to add another
+    // max() ternary to the actual call site to avoid succeeded in that case.
+    return ::aligned_alloc(__alignment, __size > __rounded_size ? __size : __rounded_size);
+#  else
+    void* __result = nullptr;
+    (void)::posix_memalign(&__result, __alignment, __size);
+    // If posix_memalign fails, __result is unmodified so we still return `nullptr`.
+    return __result;
+#  endif
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void __libcpp_aligned_free(void* __ptr) {
+#if defined(_LIBCPP_MSVCRT_LIKE)
+  ::_aligned_free(__ptr);
+#else
+  ::free(__ptr);
+#endif
+}
+#endif // !_LIBCPP_HAS_NO_ALIGNED_ALLOCATION
+
+
+template <class _Tp>
+_LIBCPP_NODISCARD_AFTER_CXX17 inline _LIBCPP_HIDE_FROM_ABI
+_LIBCPP_CONSTEXPR _Tp* __launder(_Tp* __p) _NOEXCEPT
+{
+    static_assert (!(is_function<_Tp>::value), "can't launder functions" );
+    static_assert (!(is_same<void, __remove_cv_t<_Tp> >::value), "can't launder cv-void" );
+    return __builtin_launder(__p);
+}
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+_LIBCPP_NODISCARD_AFTER_CXX17 inline _LIBCPP_HIDE_FROM_ABI
+constexpr _Tp* launder(_Tp* __p) noexcept
+{
+    return _VSTD::__launder(__p);
+}
+#endif
+
+#if _LIBCPP_STD_VER > 14
+
+#if defined(__GCC_DESTRUCTIVE_SIZE) && defined(__GCC_CONSTRUCTIVE_SIZE)
+
+inline constexpr size_t hardware_destructive_interference_size = __GCC_DESTRUCTIVE_SIZE;
+inline constexpr size_t hardware_constructive_interference_size = __GCC_CONSTRUCTIVE_SIZE;
+
+#endif // defined(__GCC_DESTRUCTIVE_SIZE) && defined(__GCC_CONSTRUCTIVE_SIZE)
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_NEW
diff --git a/app/src/main/cpp/libcxx/include/numbers b/app/src/main/cpp/libcxx/include/numbers
new file mode 100644
index 0000000..72034a6
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/numbers
@@ -0,0 +1,138 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_NUMBERS
+#define _LIBCPP_NUMBERS
+
+/*
+    numbers synopsis
+
+namespace std::numbers {
+  template<class T> inline constexpr T e_v          = unspecified;
+  template<class T> inline constexpr T log2e_v      = unspecified;
+  template<class T> inline constexpr T log10e_v     = unspecified;
+  template<class T> inline constexpr T pi_v         = unspecified;
+  template<class T> inline constexpr T inv_pi_v     = unspecified;
+  template<class T> inline constexpr T inv_sqrtpi_v = unspecified;
+  template<class T> inline constexpr T ln2_v        = unspecified;
+  template<class T> inline constexpr T ln10_v       = unspecified;
+  template<class T> inline constexpr T sqrt2_v      = unspecified;
+  template<class T> inline constexpr T sqrt3_v      = unspecified;
+  template<class T> inline constexpr T inv_sqrt3_v  = unspecified;
+  template<class T> inline constexpr T egamma_v     = unspecified;
+  template<class T> inline constexpr T phi_v        = unspecified;
+
+  template<floating_point T> inline constexpr T e_v<T>          = see below;
+  template<floating_point T> inline constexpr T log2e_v<T>      = see below;
+  template<floating_point T> inline constexpr T log10e_v<T>     = see below;
+  template<floating_point T> inline constexpr T pi_v<T>         = see below;
+  template<floating_point T> inline constexpr T inv_pi_v<T>     = see below;
+  template<floating_point T> inline constexpr T inv_sqrtpi_v<T> = see below;
+  template<floating_point T> inline constexpr T ln2_v<T>        = see below;
+  template<floating_point T> inline constexpr T ln10_v<T>       = see below;
+  template<floating_point T> inline constexpr T sqrt2_v<T>      = see below;
+  template<floating_point T> inline constexpr T sqrt3_v<T>      = see below;
+  template<floating_point T> inline constexpr T inv_sqrt3_v<T>  = see below;
+  template<floating_point T> inline constexpr T egamma_v<T>     = see below;
+  template<floating_point T> inline constexpr T phi_v<T>        = see below;
+
+  inline constexpr double e          = e_v<double>;
+  inline constexpr double log2e      = log2e_v<double>;
+  inline constexpr double log10e     = log10e_v<double>;
+  inline constexpr double pi         = pi_v<double>;
+  inline constexpr double inv_pi     = inv_pi_v<double>;
+  inline constexpr double inv_sqrtpi = inv_sqrtpi_v<double>;
+  inline constexpr double ln2        = ln2_v<double>;
+  inline constexpr double ln10       = ln10_v<double>;
+  inline constexpr double sqrt2      = sqrt2_v<double>;
+  inline constexpr double sqrt3      = sqrt3_v<double>;
+  inline constexpr double inv_sqrt3  = inv_sqrt3_v<double>;
+  inline constexpr double egamma     = egamma_v<double>;
+  inline constexpr double phi        = phi_v<double>;
+}
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__concepts/arithmetic.h>
+#include <__config>
+#include <version>
+
+#if _LIBCPP_STD_VER > 17
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace numbers {
+
+template <class _Tp>
+inline constexpr bool __false = false;
+
+template <class _Tp>
+struct __illformed
+{
+  static_assert(__false<_Tp>, "A program that instantiates a primary template of a mathematical constant variable template is ill-formed.");
+};
+
+template <class _Tp> inline constexpr _Tp e_v =          __illformed<_Tp>{};
+template <class _Tp> inline constexpr _Tp log2e_v =      __illformed<_Tp>{};
+template <class _Tp> inline constexpr _Tp log10e_v =     __illformed<_Tp>{};
+template <class _Tp> inline constexpr _Tp pi_v =         __illformed<_Tp>{};
+template <class _Tp> inline constexpr _Tp inv_pi_v =     __illformed<_Tp>{};
+template <class _Tp> inline constexpr _Tp inv_sqrtpi_v = __illformed<_Tp>{};
+template <class _Tp> inline constexpr _Tp ln2_v =        __illformed<_Tp>{};
+template <class _Tp> inline constexpr _Tp ln10_v =       __illformed<_Tp>{};
+template <class _Tp> inline constexpr _Tp sqrt2_v =      __illformed<_Tp>{};
+template <class _Tp> inline constexpr _Tp sqrt3_v =      __illformed<_Tp>{};
+template <class _Tp> inline constexpr _Tp inv_sqrt3_v =  __illformed<_Tp>{};
+template <class _Tp> inline constexpr _Tp egamma_v =     __illformed<_Tp>{};
+template <class _Tp> inline constexpr _Tp phi_v =        __illformed<_Tp>{};
+
+template <floating_point _Tp> inline constexpr _Tp e_v<_Tp>          = 2.718281828459045235360287471352662;
+template <floating_point _Tp> inline constexpr _Tp log2e_v<_Tp>      = 1.442695040888963407359924681001892;
+template <floating_point _Tp> inline constexpr _Tp log10e_v<_Tp>     = 0.434294481903251827651128918916605;
+template <floating_point _Tp> inline constexpr _Tp pi_v<_Tp>         = 3.141592653589793238462643383279502;
+template <floating_point _Tp> inline constexpr _Tp inv_pi_v<_Tp>     = 0.318309886183790671537767526745028;
+template <floating_point _Tp> inline constexpr _Tp inv_sqrtpi_v<_Tp> = 0.564189583547756286948079451560772;
+template <floating_point _Tp> inline constexpr _Tp ln2_v<_Tp>        = 0.693147180559945309417232121458176;
+template <floating_point _Tp> inline constexpr _Tp ln10_v<_Tp>       = 2.302585092994045684017991454684364;
+template <floating_point _Tp> inline constexpr _Tp sqrt2_v<_Tp>      = 1.414213562373095048801688724209698;
+template <floating_point _Tp> inline constexpr _Tp sqrt3_v<_Tp>      = 1.732050807568877293527446341505872;
+template <floating_point _Tp> inline constexpr _Tp inv_sqrt3_v<_Tp>  = 0.577350269189625764509148780501957;
+template <floating_point _Tp> inline constexpr _Tp egamma_v<_Tp>     = 0.577215664901532860606512090082402;
+template <floating_point _Tp> inline constexpr _Tp phi_v<_Tp>        = 1.618033988749894848204586834365638;
+
+inline constexpr double e          = e_v<double>;
+inline constexpr double log2e      = log2e_v<double>;
+inline constexpr double log10e     = log10e_v<double>;
+inline constexpr double pi         = pi_v<double>;
+inline constexpr double inv_pi     = inv_pi_v<double>;
+inline constexpr double inv_sqrtpi = inv_sqrtpi_v<double>;
+inline constexpr double ln2        = ln2_v<double>;
+inline constexpr double ln10       = ln10_v<double>;
+inline constexpr double sqrt2      = sqrt2_v<double>;
+inline constexpr double sqrt3      = sqrt3_v<double>;
+inline constexpr double inv_sqrt3  = inv_sqrt3_v<double>;
+inline constexpr double egamma     = egamma_v<double>;
+inline constexpr double phi        = phi_v<double>;
+
+} // namespace numbers
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 17
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_NUMBERS
diff --git a/app/src/main/cpp/libcxx/include/numeric b/app/src/main/cpp/libcxx/include/numeric
new file mode 100644
index 0000000..100dbe1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/numeric
@@ -0,0 +1,181 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_NUMERIC
+#define _LIBCPP_NUMERIC
+
+/*
+    numeric synopsis
+
+namespace std
+{
+
+template <class InputIterator, class T>
+    constexpr T  // constexpr since C++20
+    accumulate(InputIterator first, InputIterator last, T init);
+
+template <class InputIterator, class T, class BinaryOperation>
+    constexpr T  // constexpr since C++20
+    accumulate(InputIterator first, InputIterator last, T init, BinaryOperation binary_op);
+
+template<class InputIterator>
+    constexpr typename iterator_traits<InputIterator>::value_type  // constexpr since C++20
+    reduce(InputIterator first, InputIterator last);  // C++17
+
+template<class InputIterator, class T>
+    constexpr T  // constexpr since C++20
+    reduce(InputIterator first, InputIterator last, T init);  // C++17
+
+template<class InputIterator, class T, class BinaryOperation>
+    constexpr T  // constexpr since C++20
+    reduce(InputIterator first, InputIterator last, T init, BinaryOperation binary_op);  // C++17
+
+template <class InputIterator1, class InputIterator2, class T>
+    constexpr T  // constexpr since C++20
+    inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, T init);
+
+template <class InputIterator1, class InputIterator2, class T, class BinaryOperation1, class BinaryOperation2>
+    constexpr T  // constexpr since C++20
+    inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
+                  T init, BinaryOperation1 binary_op1, BinaryOperation2 binary_op2);
+
+
+template<class InputIterator1, class InputIterator2, class T>
+    constexpr T  // constexpr since C++20
+    transform_reduce(InputIterator1 first1, InputIterator1 last1,
+                     InputIterator2 first2, T init);  // C++17
+
+template<class InputIterator1, class InputIterator2, class T, class BinaryOperation1, class BinaryOperation2>
+    constexpr T  // constexpr since C++20
+    transform_reduce(InputIterator1 first1, InputIterator1 last1,
+                     InputIterator2 first2, T init,
+                     BinaryOperation1 binary_op1, BinaryOperation2 binary_op2);  // C++17
+
+template<class InputIterator, class T, class BinaryOperation, class UnaryOperation>
+    constexpr T  // constexpr since C++20
+    transform_reduce(InputIterator first, InputIterator last, T init,
+                     BinaryOperation binary_op, UnaryOperation unary_op);  // C++17
+
+template <class InputIterator, class OutputIterator>
+    constexpr OutputIterator  // constexpr since C++20
+    partial_sum(InputIterator first, InputIterator last, OutputIterator result);
+
+template <class InputIterator, class OutputIterator, class BinaryOperation>
+    constexpr OutputIterator  // constexpr since C++20
+    partial_sum(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation binary_op);
+
+template<class InputIterator, class OutputIterator, class T>
+    constexpr OutputIterator  // constexpr since C++20
+    exclusive_scan(InputIterator first, InputIterator last,
+                   OutputIterator result, T init); // C++17
+
+template<class InputIterator, class OutputIterator, class T, class BinaryOperation>
+    constexpr OutputIterator  // constexpr since C++20
+    exclusive_scan(InputIterator first, InputIterator last,
+                   OutputIterator result, T init, BinaryOperation binary_op); // C++17
+
+template<class InputIterator, class OutputIterator>
+    constexpr OutputIterator  // constexpr since C++20
+    inclusive_scan(InputIterator first, InputIterator last, OutputIterator result);  // C++17
+
+template<class InputIterator, class OutputIterator, class BinaryOperation>
+    constexpr OutputIterator  // constexpr since C++20
+    inclusive_scan(InputIterator first, InputIterator last,
+                   OutputIterator result, BinaryOperation binary_op);  // C++17
+
+template<class InputIterator, class OutputIterator, class BinaryOperation, class T>
+    constexpr OutputIterator  // constexpr since C++20
+    inclusive_scan(InputIterator first, InputIterator last,
+                   OutputIterator result, BinaryOperation binary_op, T init);  // C++17
+
+template<class InputIterator, class OutputIterator, class T,
+         class BinaryOperation, class UnaryOperation>
+    constexpr OutputIterator  // constexpr since C++20
+    transform_exclusive_scan(InputIterator first, InputIterator last,
+                             OutputIterator result, T init,
+                             BinaryOperation binary_op, UnaryOperation unary_op);  // C++17
+
+template<class InputIterator, class OutputIterator,
+         class BinaryOperation, class UnaryOperation>
+    constexpr OutputIterator  // constexpr since C++20
+    transform_inclusive_scan(InputIterator first, InputIterator last,
+                             OutputIterator result,
+                             BinaryOperation binary_op, UnaryOperation unary_op);  // C++17
+
+template<class InputIterator, class OutputIterator,
+         class BinaryOperation, class UnaryOperation, class T>
+    constexpr OutputIterator  // constexpr since C++20
+    transform_inclusive_scan(InputIterator first, InputIterator last,
+                             OutputIterator result,
+                             BinaryOperation binary_op, UnaryOperation unary_op,
+                             T init);  // C++17
+
+template <class InputIterator, class OutputIterator>
+    constexpr OutputIterator  // constexpr since C++20
+    adjacent_difference(InputIterator first, InputIterator last, OutputIterator result);
+
+template <class InputIterator, class OutputIterator, class BinaryOperation>
+    constexpr OutputIterator  // constexpr since C++20
+    adjacent_difference(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation binary_op);
+
+template <class ForwardIterator, class T>
+    constexpr void  // constexpr since C++20
+    iota(ForwardIterator first, ForwardIterator last, T value);
+
+template <class M, class N>
+    constexpr common_type_t<M,N> gcd(M m, N n);    // C++17
+
+template <class M, class N>
+    constexpr common_type_t<M,N> lcm(M m, N n);    // C++17
+
+template<class T>
+    constexpr T midpoint(T a, T b) noexcept;  // C++20
+
+template<class T>
+    constexpr T* midpoint(T* a, T* b);        // C++20
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <cmath> // for isnormal
+#include <version>
+
+#include <__numeric/accumulate.h>
+#include <__numeric/adjacent_difference.h>
+#include <__numeric/exclusive_scan.h>
+#include <__numeric/gcd_lcm.h>
+#include <__numeric/inclusive_scan.h>
+#include <__numeric/inner_product.h>
+#include <__numeric/iota.h>
+#include <__numeric/midpoint.h>
+#include <__numeric/partial_sum.h>
+#include <__numeric/reduce.h>
+#include <__numeric/transform_exclusive_scan.h>
+#include <__numeric/transform_inclusive_scan.h>
+#include <__numeric/transform_reduce.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17
+#   include <__pstl_numeric>
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <functional>
+#  include <iterator>
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_NUMERIC
diff --git a/app/src/main/cpp/libcxx/include/optional b/app/src/main/cpp/libcxx/include/optional
new file mode 100644
index 0000000..6a7e2d2
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/optional
@@ -0,0 +1,1591 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_OPTIONAL
+#define _LIBCPP_OPTIONAL
+
+/*
+    optional synopsis
+
+// C++1z
+
+namespace std {
+  // 23.6.3, optional for object types
+  template <class T> class optional;
+
+  // 23.6.4, no-value state indicator
+  struct nullopt_t{see below };
+  inline constexpr nullopt_t nullopt(unspecified );
+
+  // 23.6.5, class bad_optional_access
+  class bad_optional_access;
+
+  // 23.6.6, relational operators
+  template <class T, class U>
+  constexpr bool operator==(const optional<T>&, const optional<U>&);
+  template <class T, class U>
+  constexpr bool operator!=(const optional<T>&, const optional<U>&);
+  template <class T, class U>
+  constexpr bool operator<(const optional<T>&, const optional<U>&);
+  template <class T, class U>
+  constexpr bool operator>(const optional<T>&, const optional<U>&);
+  template <class T, class U>
+  constexpr bool operator<=(const optional<T>&, const optional<U>&);
+  template <class T, class U>
+  constexpr bool operator>=(const optional<T>&, const optional<U>&);
+
+  // 23.6.7 comparison with nullopt
+  template <class T> constexpr bool operator==(const optional<T>&, nullopt_t) noexcept;
+  template <class T> constexpr bool operator==(nullopt_t, const optional<T>&) noexcept;
+  template <class T> constexpr bool operator!=(const optional<T>&, nullopt_t) noexcept;
+  template <class T> constexpr bool operator!=(nullopt_t, const optional<T>&) noexcept;
+  template <class T> constexpr bool operator<(const optional<T>&, nullopt_t) noexcept;
+  template <class T> constexpr bool operator<(nullopt_t, const optional<T>&) noexcept;
+  template <class T> constexpr bool operator<=(const optional<T>&, nullopt_t) noexcept;
+  template <class T> constexpr bool operator<=(nullopt_t, const optional<T>&) noexcept;
+  template <class T> constexpr bool operator>(const optional<T>&, nullopt_t) noexcept;
+  template <class T> constexpr bool operator>(nullopt_t, const optional<T>&) noexcept;
+  template <class T> constexpr bool operator>=(const optional<T>&, nullopt_t) noexcept;
+  template <class T> constexpr bool operator>=(nullopt_t, const optional<T>&) noexcept;
+
+  // 23.6.8, comparison with T
+  template <class T, class U> constexpr bool operator==(const optional<T>&, const U&);
+  template <class T, class U> constexpr bool operator==(const T&, const optional<U>&);
+  template <class T, class U> constexpr bool operator!=(const optional<T>&, const U&);
+  template <class T, class U> constexpr bool operator!=(const T&, const optional<U>&);
+  template <class T, class U> constexpr bool operator<(const optional<T>&, const U&);
+  template <class T, class U> constexpr bool operator<(const T&, const optional<U>&);
+  template <class T, class U> constexpr bool operator<=(const optional<T>&, const U&);
+  template <class T, class U> constexpr bool operator<=(const T&, const optional<U>&);
+  template <class T, class U> constexpr bool operator>(const optional<T>&, const U&);
+  template <class T, class U> constexpr bool operator>(const T&, const optional<U>&);
+  template <class T, class U> constexpr bool operator>=(const optional<T>&, const U&);
+  template <class T, class U> constexpr bool operator>=(const T&, const optional<U>&);
+
+  // 23.6.9, specialized algorithms
+  template <class T> void swap(optional<T>&, optional<T>&) noexcept(see below ); // constexpr in C++20
+  template <class T> constexpr optional<see below > make_optional(T&&);
+  template <class T, class... Args>
+    constexpr optional<T> make_optional(Args&&... args);
+  template <class T, class U, class... Args>
+    constexpr optional<T> make_optional(initializer_list<U> il, Args&&... args);
+
+  // 23.6.10, hash support
+  template <class T> struct hash;
+  template <class T> struct hash<optional<T>>;
+
+  template <class T> class optional {
+  public:
+    using value_type = T;
+
+    // 23.6.3.1, constructors
+    constexpr optional() noexcept;
+    constexpr optional(nullopt_t) noexcept;
+    constexpr optional(const optional &);
+    constexpr optional(optional &&) noexcept(see below);
+    template <class... Args> constexpr explicit optional(in_place_t, Args &&...);
+    template <class U, class... Args>
+      constexpr explicit optional(in_place_t, initializer_list<U>, Args &&...);
+    template <class U = T>
+      constexpr explicit(see-below) optional(U &&);
+    template <class U>
+      explicit(see-below) optional(const optional<U> &);         // constexpr in C++20
+    template <class U>
+      explicit(see-below) optional(optional<U> &&);              // constexpr in C++20
+
+    // 23.6.3.2, destructor
+    ~optional(); // constexpr in C++20
+
+    // 23.6.3.3, assignment
+    optional &operator=(nullopt_t) noexcept;                     // constexpr in C++20
+    constexpr optional &operator=(const optional &);
+    constexpr optional &operator=(optional &&) noexcept(see below);
+    template <class U = T> optional &operator=(U &&);            // constexpr in C++20
+    template <class U> optional &operator=(const optional<U> &); // constexpr in C++20
+    template <class U> optional &operator=(optional<U> &&);      // constexpr in C++20
+    template <class... Args> T& emplace(Args &&...);             // constexpr in C++20
+    template <class U, class... Args>
+      T& emplace(initializer_list<U>, Args &&...);               // constexpr in C++20
+
+    // 23.6.3.4, swap
+    void swap(optional &) noexcept(see below ); // constexpr in C++20
+
+    // 23.6.3.5, observers
+    constexpr T const *operator->() const;
+    constexpr T *operator->();
+    constexpr T const &operator*() const &;
+    constexpr T &operator*() &;
+    constexpr T &&operator*() &&;
+    constexpr const T &&operator*() const &&;
+    constexpr explicit operator bool() const noexcept;
+    constexpr bool has_value() const noexcept;
+    constexpr T const &value() const &;
+    constexpr T &value() &;
+    constexpr T &&value() &&;
+    constexpr const T &&value() const &&;
+    template <class U> constexpr T value_or(U &&) const &;
+    template <class U> constexpr T value_or(U &&) &&;
+
+    // [optional.monadic], monadic operations
+    template<class F> constexpr auto and_then(F&& f) &;         // since C++23
+    template<class F> constexpr auto and_then(F&& f) &&;        // since C++23
+    template<class F> constexpr auto and_then(F&& f) const&;    // since C++23
+    template<class F> constexpr auto and_then(F&& f) const&&;   // since C++23
+    template<class F> constexpr auto transform(F&& f) &;        // since C++23
+    template<class F> constexpr auto transform(F&& f) &&;       // since C++23
+    template<class F> constexpr auto transform(F&& f) const&;   // since C++23
+    template<class F> constexpr auto transform(F&& f) const&&;  // since C++23
+    template<class F> constexpr optional or_else(F&& f) &&;     // since C++23
+    template<class F> constexpr optional or_else(F&& f) const&; // since C++23
+
+    // 23.6.3.6, modifiers
+    void reset() noexcept; // constexpr in C++20
+
+  private:
+    T *val; // exposition only
+  };
+
+template<class T>
+  optional(T) -> optional<T>;
+
+} // namespace std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__concepts/invocable.h>
+#include <__config>
+#include <__functional/hash.h>
+#include <__functional/invoke.h>
+#include <__functional/unary_function.h>
+#include <__memory/construct_at.h>
+#include <__tuple_dir/sfinae_helpers.h>
+#include <__utility/forward.h>
+#include <__utility/in_place.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <initializer_list>
+#include <new>
+#include <stdexcept>
+#include <type_traits>
+#include <version>
+
+// standard-mandated includes
+
+// [optional.syn]
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+namespace std  // purposefully not using versioning namespace
+{
+
+class _LIBCPP_EXCEPTION_ABI _LIBCPP_AVAILABILITY_BAD_OPTIONAL_ACCESS bad_optional_access
+    : public exception
+{
+public:
+    // Get the key function ~bad_optional_access() into the dylib
+    ~bad_optional_access() _NOEXCEPT override;
+    const char* what() const _NOEXCEPT override;
+};
+
+} // namespace std
+
+#if _LIBCPP_STD_VER > 14
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+_LIBCPP_NORETURN
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+void __throw_bad_optional_access() {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        throw bad_optional_access();
+#else
+        _VSTD::abort();
+#endif
+}
+
+struct nullopt_t
+{
+    struct __secret_tag { _LIBCPP_INLINE_VISIBILITY explicit __secret_tag() = default; };
+    _LIBCPP_INLINE_VISIBILITY constexpr explicit nullopt_t(__secret_tag, __secret_tag) noexcept {}
+};
+
+inline constexpr nullopt_t nullopt{nullopt_t::__secret_tag{}, nullopt_t::__secret_tag{}};
+
+struct __optional_construct_from_invoke_tag {};
+
+template <class _Tp, bool = is_trivially_destructible<_Tp>::value>
+struct __optional_destruct_base;
+
+template <class _Tp>
+struct __optional_destruct_base<_Tp, false>
+{
+    typedef _Tp value_type;
+    static_assert(is_object_v<value_type>,
+        "instantiation of optional with a non-object type is undefined behavior");
+    union
+    {
+        char __null_state_;
+        value_type __val_;
+    };
+    bool __engaged_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 ~__optional_destruct_base()
+    {
+        if (__engaged_)
+            __val_.~value_type();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr __optional_destruct_base() noexcept
+        :  __null_state_(),
+           __engaged_(false) {}
+
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit __optional_destruct_base(in_place_t, _Args&&... __args)
+        :  __val_(_VSTD::forward<_Args>(__args)...),
+           __engaged_(true) {}
+
+#if _LIBCPP_STD_VER > 20
+  template <class _Fp, class... _Args>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __optional_destruct_base(__optional_construct_from_invoke_tag, _Fp&& __f, _Args&&... __args)
+      : __val_(_VSTD::invoke(_VSTD::forward<_Fp>(__f), _VSTD::forward<_Args>(__args)...)), __engaged_(true) {}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void reset() noexcept
+    {
+        if (__engaged_)
+        {
+            __val_.~value_type();
+            __engaged_ = false;
+        }
+    }
+};
+
+template <class _Tp>
+struct __optional_destruct_base<_Tp, true>
+{
+    typedef _Tp value_type;
+    static_assert(is_object_v<value_type>,
+        "instantiation of optional with a non-object type is undefined behavior");
+    union
+    {
+        char __null_state_;
+        value_type __val_;
+    };
+    bool __engaged_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr __optional_destruct_base() noexcept
+        :  __null_state_(),
+           __engaged_(false) {}
+
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit __optional_destruct_base(in_place_t, _Args&&... __args)
+        :  __val_(_VSTD::forward<_Args>(__args)...),
+           __engaged_(true) {}
+
+#if _LIBCPP_STD_VER > 20
+  template <class _Fp, class... _Args>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr __optional_destruct_base(__optional_construct_from_invoke_tag, _Fp&& __f, _Args&&... __args)
+      : __val_(_VSTD::invoke(_VSTD::forward<_Fp>(__f), _VSTD::forward<_Args>(__args)...)), __engaged_(true) {}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void reset() noexcept
+    {
+        if (__engaged_)
+        {
+            __engaged_ = false;
+        }
+    }
+};
+
+template <class _Tp, bool = is_reference<_Tp>::value>
+struct __optional_storage_base : __optional_destruct_base<_Tp>
+{
+    using __base = __optional_destruct_base<_Tp>;
+    using value_type = _Tp;
+    using __base::__base;
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr bool has_value() const noexcept
+    {
+        return this->__engaged_;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr value_type& __get() & noexcept
+    {
+        return this->__val_;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr const value_type& __get() const& noexcept
+    {
+        return this->__val_;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr value_type&& __get() && noexcept
+    {
+        return _VSTD::move(this->__val_);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr const value_type&& __get() const&& noexcept
+    {
+        return _VSTD::move(this->__val_);
+    }
+
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void __construct(_Args&&... __args)
+    {
+        _LIBCPP_ASSERT(!has_value(), "__construct called for engaged __optional_storage");
+#if _LIBCPP_STD_VER > 17
+        _VSTD::construct_at(_VSTD::addressof(this->__val_), _VSTD::forward<_Args>(__args)...);
+#else
+        ::new ((void*)_VSTD::addressof(this->__val_)) value_type(_VSTD::forward<_Args>(__args)...);
+#endif
+        this->__engaged_ = true;
+    }
+
+    template <class _That>
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void __construct_from(_That&& __opt)
+    {
+        if (__opt.has_value())
+            __construct(_VSTD::forward<_That>(__opt).__get());
+    }
+
+    template <class _That>
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void __assign_from(_That&& __opt)
+    {
+        if (this->__engaged_ == __opt.has_value())
+        {
+            if (this->__engaged_)
+                this->__val_ = _VSTD::forward<_That>(__opt).__get();
+        }
+        else
+        {
+            if (this->__engaged_)
+                this->reset();
+            else
+                __construct(_VSTD::forward<_That>(__opt).__get());
+        }
+    }
+};
+
+// optional<T&> is currently required to be ill-formed. However, it may
+// be allowed in the future. For this reason, it has already been implemented
+// to ensure we can make the change in an ABI-compatible manner.
+template <class _Tp>
+struct __optional_storage_base<_Tp, true>
+{
+    using value_type = _Tp;
+    using __raw_type = remove_reference_t<_Tp>;
+    __raw_type* __value_;
+
+    template <class _Up>
+    static constexpr bool __can_bind_reference() {
+        using _RawUp = __libcpp_remove_reference_t<_Up>;
+        using _UpPtr = _RawUp*;
+        using _RawTp = __libcpp_remove_reference_t<_Tp>;
+        using _TpPtr = _RawTp*;
+        using _CheckLValueArg = integral_constant<bool,
+            (is_lvalue_reference<_Up>::value && is_convertible<_UpPtr, _TpPtr>::value)
+        ||  is_same<_RawUp, reference_wrapper<_RawTp>>::value
+        ||  is_same<_RawUp, reference_wrapper<__remove_const_t<_RawTp>>>::value
+        >;
+        return (is_lvalue_reference<_Tp>::value && _CheckLValueArg::value)
+            || (is_rvalue_reference<_Tp>::value && !is_lvalue_reference<_Up>::value &&
+                is_convertible<_UpPtr, _TpPtr>::value);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr __optional_storage_base() noexcept
+        :  __value_(nullptr) {}
+
+    template <class _UArg>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit __optional_storage_base(in_place_t, _UArg&& __uarg)
+        :  __value_(_VSTD::addressof(__uarg))
+    {
+      static_assert(__can_bind_reference<_UArg>(),
+        "Attempted to construct a reference element in tuple from a "
+        "possible temporary");
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void reset() noexcept { __value_ = nullptr; }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr bool has_value() const noexcept
+      { return __value_ != nullptr; }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr value_type& __get() const& noexcept
+      { return *__value_; }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr value_type&& __get() const&& noexcept
+      { return _VSTD::forward<value_type>(*__value_); }
+
+    template <class _UArg>
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void __construct(_UArg&& __val)
+    {
+        _LIBCPP_ASSERT(!has_value(), "__construct called for engaged __optional_storage");
+        static_assert(__can_bind_reference<_UArg>(),
+            "Attempted to construct a reference element in tuple from a "
+            "possible temporary");
+        __value_ = _VSTD::addressof(__val);
+    }
+
+    template <class _That>
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void __construct_from(_That&& __opt)
+    {
+        if (__opt.has_value())
+            __construct(_VSTD::forward<_That>(__opt).__get());
+    }
+
+    template <class _That>
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void __assign_from(_That&& __opt)
+    {
+        if (has_value() == __opt.has_value())
+        {
+            if (has_value())
+                *__value_ = _VSTD::forward<_That>(__opt).__get();
+        }
+        else
+        {
+            if (has_value())
+                reset();
+            else
+                __construct(_VSTD::forward<_That>(__opt).__get());
+        }
+    }
+};
+
+template <class _Tp, bool = is_trivially_copy_constructible<_Tp>::value>
+struct __optional_copy_base : __optional_storage_base<_Tp>
+{
+    using __optional_storage_base<_Tp>::__optional_storage_base;
+};
+
+template <class _Tp>
+struct __optional_copy_base<_Tp, false> : __optional_storage_base<_Tp>
+{
+    using __optional_storage_base<_Tp>::__optional_storage_base;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_copy_base() = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 __optional_copy_base(const __optional_copy_base& __opt)
+    {
+        this->__construct_from(__opt);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_copy_base(__optional_copy_base&&) = default;
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_copy_base& operator=(const __optional_copy_base&) = default;
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_copy_base& operator=(__optional_copy_base&&) = default;
+};
+
+template <class _Tp, bool = is_trivially_move_constructible<_Tp>::value>
+struct __optional_move_base : __optional_copy_base<_Tp>
+{
+    using __optional_copy_base<_Tp>::__optional_copy_base;
+};
+
+template <class _Tp>
+struct __optional_move_base<_Tp, false> : __optional_copy_base<_Tp>
+{
+    using value_type = _Tp;
+    using __optional_copy_base<_Tp>::__optional_copy_base;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_move_base() = default;
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_move_base(const __optional_move_base&) = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 __optional_move_base(__optional_move_base&& __opt)
+        noexcept(is_nothrow_move_constructible_v<value_type>)
+    {
+        this->__construct_from(_VSTD::move(__opt));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_move_base& operator=(const __optional_move_base&) = default;
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_move_base& operator=(__optional_move_base&&) = default;
+};
+
+template <class _Tp, bool =
+    is_trivially_destructible<_Tp>::value &&
+    is_trivially_copy_constructible<_Tp>::value &&
+    is_trivially_copy_assignable<_Tp>::value>
+struct __optional_copy_assign_base : __optional_move_base<_Tp>
+{
+    using __optional_move_base<_Tp>::__optional_move_base;
+};
+
+template <class _Tp>
+struct __optional_copy_assign_base<_Tp, false> : __optional_move_base<_Tp>
+{
+    using __optional_move_base<_Tp>::__optional_move_base;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_copy_assign_base() = default;
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_copy_assign_base(const __optional_copy_assign_base&) = default;
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_copy_assign_base(__optional_copy_assign_base&&) = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 __optional_copy_assign_base& operator=(const __optional_copy_assign_base& __opt)
+    {
+        this->__assign_from(__opt);
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_copy_assign_base& operator=(__optional_copy_assign_base&&) = default;
+};
+
+template <class _Tp, bool =
+    is_trivially_destructible<_Tp>::value &&
+    is_trivially_move_constructible<_Tp>::value &&
+    is_trivially_move_assignable<_Tp>::value>
+struct __optional_move_assign_base : __optional_copy_assign_base<_Tp>
+{
+    using __optional_copy_assign_base<_Tp>::__optional_copy_assign_base;
+};
+
+template <class _Tp>
+struct __optional_move_assign_base<_Tp, false> : __optional_copy_assign_base<_Tp>
+{
+    using value_type = _Tp;
+    using __optional_copy_assign_base<_Tp>::__optional_copy_assign_base;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_move_assign_base() = default;
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_move_assign_base(const __optional_move_assign_base& __opt) = default;
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_move_assign_base(__optional_move_assign_base&&) = default;
+    _LIBCPP_INLINE_VISIBILITY
+    __optional_move_assign_base& operator=(const __optional_move_assign_base&) = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 __optional_move_assign_base& operator=(__optional_move_assign_base&& __opt)
+        noexcept(is_nothrow_move_assignable_v<value_type> &&
+                 is_nothrow_move_constructible_v<value_type>)
+    {
+        this->__assign_from(_VSTD::move(__opt));
+        return *this;
+    }
+};
+
+template <class _Tp>
+using __optional_sfinae_ctor_base_t = __sfinae_ctor_base<
+    is_copy_constructible<_Tp>::value,
+    is_move_constructible<_Tp>::value
+>;
+
+template <class _Tp>
+using __optional_sfinae_assign_base_t = __sfinae_assign_base<
+    (is_copy_constructible<_Tp>::value && is_copy_assignable<_Tp>::value),
+    (is_move_constructible<_Tp>::value && is_move_assignable<_Tp>::value)
+>;
+
+template<class _Tp>
+class optional;
+template <class _Tp>
+struct __is_std_optional : false_type {};
+template <class _Tp> struct __is_std_optional<optional<_Tp>> : true_type {};
+
+template <class _Tp>
+class optional
+    : private __optional_move_assign_base<_Tp>
+    , private __optional_sfinae_ctor_base_t<_Tp>
+    , private __optional_sfinae_assign_base_t<_Tp>
+{
+    using __base = __optional_move_assign_base<_Tp>;
+public:
+    using value_type = _Tp;
+
+private:
+     // Disable the reference extension using this static assert.
+    static_assert(!is_same_v<__remove_cvref_t<value_type>, in_place_t>,
+        "instantiation of optional with in_place_t is ill-formed");
+    static_assert(!is_same_v<__remove_cvref_t<value_type>, nullopt_t>,
+        "instantiation of optional with nullopt_t is ill-formed");
+    static_assert(!is_reference_v<value_type>,
+        "instantiation of optional with a reference type is ill-formed");
+    static_assert(is_destructible_v<value_type>,
+        "instantiation of optional with a non-destructible type is ill-formed");
+    static_assert(!is_array_v<value_type>,
+        "instantiation of optional with an array type is ill-formed");
+
+    // LWG2756: conditionally explicit conversion from _Up
+    struct _CheckOptionalArgsConstructor {
+      template <class _Up>
+      static constexpr bool __enable_implicit() {
+          return is_constructible_v<_Tp, _Up&&> &&
+                 is_convertible_v<_Up&&, _Tp>;
+      }
+
+      template <class _Up>
+      static constexpr bool __enable_explicit() {
+          return is_constructible_v<_Tp, _Up&&> &&
+                 !is_convertible_v<_Up&&, _Tp>;
+      }
+    };
+    template <class _Up>
+    using _CheckOptionalArgsCtor = _If<
+        _IsNotSame<__remove_cvref_t<_Up>, in_place_t>::value &&
+        _IsNotSame<__remove_cvref_t<_Up>, optional>::value,
+        _CheckOptionalArgsConstructor,
+        __check_tuple_constructor_fail
+    >;
+    template <class _QualUp>
+    struct _CheckOptionalLikeConstructor {
+      template <class _Up, class _Opt = optional<_Up>>
+      using __check_constructible_from_opt = _Or<
+          is_constructible<_Tp, _Opt&>,
+          is_constructible<_Tp, _Opt const&>,
+          is_constructible<_Tp, _Opt&&>,
+          is_constructible<_Tp, _Opt const&&>,
+          is_convertible<_Opt&, _Tp>,
+          is_convertible<_Opt const&, _Tp>,
+          is_convertible<_Opt&&, _Tp>,
+          is_convertible<_Opt const&&, _Tp>
+      >;
+      template <class _Up, class _Opt = optional<_Up>>
+      using __check_assignable_from_opt = _Or<
+          is_assignable<_Tp&, _Opt&>,
+          is_assignable<_Tp&, _Opt const&>,
+          is_assignable<_Tp&, _Opt&&>,
+          is_assignable<_Tp&, _Opt const&&>
+      >;
+      template <class _Up, class _QUp = _QualUp>
+      static constexpr bool __enable_implicit() {
+          return is_convertible<_QUp, _Tp>::value &&
+              !__check_constructible_from_opt<_Up>::value;
+      }
+      template <class _Up, class _QUp = _QualUp>
+      static constexpr bool __enable_explicit() {
+          return !is_convertible<_QUp, _Tp>::value &&
+              !__check_constructible_from_opt<_Up>::value;
+      }
+      template <class _Up, class _QUp = _QualUp>
+      static constexpr bool __enable_assign() {
+          // Construction and assignability of _QUp to _Tp has already been
+          // checked.
+          return !__check_constructible_from_opt<_Up>::value &&
+              !__check_assignable_from_opt<_Up>::value;
+      }
+    };
+
+    template <class _Up, class _QualUp>
+    using _CheckOptionalLikeCtor = _If<
+      _And<
+         _IsNotSame<_Up, _Tp>,
+          is_constructible<_Tp, _QualUp>
+      >::value,
+      _CheckOptionalLikeConstructor<_QualUp>,
+      __check_tuple_constructor_fail
+    >;
+    template <class _Up, class _QualUp>
+    using _CheckOptionalLikeAssign = _If<
+      _And<
+          _IsNotSame<_Up, _Tp>,
+          is_constructible<_Tp, _QualUp>,
+          is_assignable<_Tp&, _QualUp>
+      >::value,
+      _CheckOptionalLikeConstructor<_QualUp>,
+      __check_tuple_constructor_fail
+    >;
+
+public:
+
+    _LIBCPP_INLINE_VISIBILITY constexpr optional() noexcept {}
+    _LIBCPP_INLINE_VISIBILITY constexpr optional(const optional&) = default;
+    _LIBCPP_INLINE_VISIBILITY constexpr optional(optional&&) = default;
+    _LIBCPP_INLINE_VISIBILITY constexpr optional(nullopt_t) noexcept {}
+
+    template <class _InPlaceT, class... _Args, class = enable_if_t<
+          _And<
+              _IsSame<_InPlaceT, in_place_t>,
+              is_constructible<value_type, _Args...>
+            >::value
+        >
+    >
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit optional(_InPlaceT, _Args&&... __args)
+        : __base(in_place, _VSTD::forward<_Args>(__args)...) {}
+
+    template <class _Up, class... _Args, class = enable_if_t<
+        is_constructible_v<value_type, initializer_list<_Up>&, _Args...>>
+    >
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit optional(in_place_t, initializer_list<_Up> __il, _Args&&... __args)
+        : __base(in_place, __il, _VSTD::forward<_Args>(__args)...) {}
+
+    template <class _Up = value_type, enable_if_t<
+        _CheckOptionalArgsCtor<_Up>::template __enable_implicit<_Up>()
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr optional(_Up&& __v)
+        : __base(in_place, _VSTD::forward<_Up>(__v)) {}
+
+    template <class _Up, enable_if_t<
+        _CheckOptionalArgsCtor<_Up>::template __enable_explicit<_Up>()
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit optional(_Up&& __v)
+        : __base(in_place, _VSTD::forward<_Up>(__v)) {}
+
+    // LWG2756: conditionally explicit conversion from const optional<_Up>&
+    template <class _Up, enable_if_t<
+        _CheckOptionalLikeCtor<_Up, _Up const&>::template __enable_implicit<_Up>()
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 optional(const optional<_Up>& __v)
+    {
+        this->__construct_from(__v);
+    }
+    template <class _Up, enable_if_t<
+        _CheckOptionalLikeCtor<_Up, _Up const&>::template __enable_explicit<_Up>()
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit optional(const optional<_Up>& __v)
+    {
+        this->__construct_from(__v);
+    }
+
+    // LWG2756: conditionally explicit conversion from optional<_Up>&&
+    template <class _Up, enable_if_t<
+        _CheckOptionalLikeCtor<_Up, _Up &&>::template __enable_implicit<_Up>()
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 optional(optional<_Up>&& __v)
+    {
+        this->__construct_from(_VSTD::move(__v));
+    }
+    template <class _Up, enable_if_t<
+        _CheckOptionalLikeCtor<_Up, _Up &&>::template __enable_explicit<_Up>()
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit optional(optional<_Up>&& __v)
+    {
+        this->__construct_from(_VSTD::move(__v));
+    }
+
+#if _LIBCPP_STD_VER > 20
+  template<class _Fp, class... _Args>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr explicit optional(__optional_construct_from_invoke_tag, _Fp&& __f, _Args&&... __args)
+      : __base(__optional_construct_from_invoke_tag{}, _VSTD::forward<_Fp>(__f), _VSTD::forward<_Args>(__args)...) {
+  }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 optional& operator=(nullopt_t) noexcept
+    {
+        reset();
+        return *this;
+    }
+
+    constexpr optional& operator=(const optional&) = default;
+    constexpr optional& operator=(optional&&) = default;
+
+    // LWG2756
+    template <class _Up = value_type,
+              class = enable_if_t<
+                      _And<
+                          _IsNotSame<__remove_cvref_t<_Up>, optional>,
+                          _Or<
+                              _IsNotSame<__remove_cvref_t<_Up>, value_type>,
+                              _Not<is_scalar<value_type>>
+                          >,
+                          is_constructible<value_type, _Up>,
+                          is_assignable<value_type&, _Up>
+                      >::value>
+             >
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 optional&
+    operator=(_Up&& __v)
+    {
+        if (this->has_value())
+            this->__get() = _VSTD::forward<_Up>(__v);
+        else
+            this->__construct(_VSTD::forward<_Up>(__v));
+        return *this;
+    }
+
+    // LWG2756
+    template <class _Up, enable_if_t<
+        _CheckOptionalLikeAssign<_Up, _Up const&>::template __enable_assign<_Up>()
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 optional&
+    operator=(const optional<_Up>& __v)
+    {
+        this->__assign_from(__v);
+        return *this;
+    }
+
+    // LWG2756
+    template <class _Up, enable_if_t<
+        _CheckOptionalLikeCtor<_Up, _Up &&>::template __enable_assign<_Up>()
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 optional&
+    operator=(optional<_Up>&& __v)
+    {
+        this->__assign_from(_VSTD::move(__v));
+        return *this;
+    }
+
+    template <class... _Args,
+              class = enable_if_t
+                      <
+                          is_constructible_v<value_type, _Args...>
+                      >
+             >
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp &
+    emplace(_Args&&... __args)
+    {
+        reset();
+        this->__construct(_VSTD::forward<_Args>(__args)...);
+        return this->__get();
+    }
+
+    template <class _Up, class... _Args,
+              class = enable_if_t
+                      <
+                          is_constructible_v<value_type, initializer_list<_Up>&, _Args...>
+                      >
+             >
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp &
+    emplace(initializer_list<_Up> __il, _Args&&... __args)
+    {
+        reset();
+        this->__construct(__il, _VSTD::forward<_Args>(__args)...);
+        return this->__get();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void swap(optional& __opt)
+        noexcept(is_nothrow_move_constructible_v<value_type> &&
+                 is_nothrow_swappable_v<value_type>)
+    {
+        if (this->has_value() == __opt.has_value())
+        {
+            using _VSTD::swap;
+            if (this->has_value())
+                swap(this->__get(), __opt.__get());
+        }
+        else
+        {
+            if (this->has_value())
+            {
+                __opt.__construct(_VSTD::move(this->__get()));
+                reset();
+            }
+            else
+            {
+                this->__construct(_VSTD::move(__opt.__get()));
+                __opt.reset();
+            }
+        }
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr
+    add_pointer_t<value_type const>
+    operator->() const
+    {
+        _LIBCPP_ASSERT(this->has_value(), "optional operator-> called on a disengaged value");
+        return _VSTD::addressof(this->__get());
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr
+    add_pointer_t<value_type>
+    operator->()
+    {
+        _LIBCPP_ASSERT(this->has_value(), "optional operator-> called on a disengaged value");
+        return _VSTD::addressof(this->__get());
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr
+    const value_type&
+    operator*() const& noexcept
+    {
+        _LIBCPP_ASSERT(this->has_value(), "optional operator* called on a disengaged value");
+        return this->__get();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr
+    value_type&
+    operator*() & noexcept
+    {
+        _LIBCPP_ASSERT(this->has_value(), "optional operator* called on a disengaged value");
+        return this->__get();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr
+    value_type&&
+    operator*() && noexcept
+    {
+        _LIBCPP_ASSERT(this->has_value(), "optional operator* called on a disengaged value");
+        return _VSTD::move(this->__get());
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr
+    const value_type&&
+    operator*() const&& noexcept
+    {
+        _LIBCPP_ASSERT(this->has_value(), "optional operator* called on a disengaged value");
+        return _VSTD::move(this->__get());
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit operator bool() const noexcept { return has_value(); }
+
+    using __base::has_value;
+    using __base::__get;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+    constexpr value_type const& value() const&
+    {
+        if (!this->has_value())
+            __throw_bad_optional_access();
+        return this->__get();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+    constexpr value_type& value() &
+    {
+        if (!this->has_value())
+            __throw_bad_optional_access();
+        return this->__get();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+    constexpr value_type&& value() &&
+    {
+        if (!this->has_value())
+            __throw_bad_optional_access();
+        return _VSTD::move(this->__get());
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+    constexpr value_type const&& value() const&&
+    {
+        if (!this->has_value())
+            __throw_bad_optional_access();
+        return _VSTD::move(this->__get());
+    }
+
+    template <class _Up>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr value_type value_or(_Up&& __v) const&
+    {
+        static_assert(is_copy_constructible_v<value_type>,
+                      "optional<T>::value_or: T must be copy constructible");
+        static_assert(is_convertible_v<_Up, value_type>,
+                      "optional<T>::value_or: U must be convertible to T");
+        return this->has_value() ? this->__get() :
+                                  static_cast<value_type>(_VSTD::forward<_Up>(__v));
+    }
+
+    template <class _Up>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr value_type value_or(_Up&& __v) &&
+    {
+        static_assert(is_move_constructible_v<value_type>,
+                      "optional<T>::value_or: T must be move constructible");
+        static_assert(is_convertible_v<_Up, value_type>,
+                      "optional<T>::value_or: U must be convertible to T");
+        return this->has_value() ? _VSTD::move(this->__get()) :
+                                  static_cast<value_type>(_VSTD::forward<_Up>(__v));
+    }
+
+#if _LIBCPP_STD_VER > 20
+  template<class _Func>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+  constexpr auto and_then(_Func&& __f) & {
+    using _Up = invoke_result_t<_Func, value_type&>;
+    static_assert(__is_std_optional<remove_cvref_t<_Up>>::value,
+                  "Result of f(value()) must be a specialization of std::optional");
+    if (*this)
+      return _VSTD::invoke(_VSTD::forward<_Func>(__f), value());
+    return remove_cvref_t<_Up>();
+  }
+
+  template<class _Func>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+  constexpr auto and_then(_Func&& __f) const& {
+    using _Up = invoke_result_t<_Func, const value_type&>;
+    static_assert(__is_std_optional<remove_cvref_t<_Up>>::value,
+                  "Result of f(value()) must be a specialization of std::optional");
+    if (*this)
+      return _VSTD::invoke(_VSTD::forward<_Func>(__f), value());
+    return remove_cvref_t<_Up>();
+  }
+
+  template<class _Func>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+  constexpr auto and_then(_Func&& __f) && {
+    using _Up = invoke_result_t<_Func, value_type&&>;
+    static_assert(__is_std_optional<remove_cvref_t<_Up>>::value,
+                  "Result of f(std::move(value())) must be a specialization of std::optional");
+    if (*this)
+      return _VSTD::invoke(_VSTD::forward<_Func>(__f), _VSTD::move(value()));
+    return remove_cvref_t<_Up>();
+  }
+
+  template<class _Func>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto and_then(_Func&& __f) const&& {
+    using _Up = invoke_result_t<_Func, const value_type&&>;
+    static_assert(__is_std_optional<remove_cvref_t<_Up>>::value,
+                  "Result of f(std::move(value())) must be a specialization of std::optional");
+    if (*this)
+      return _VSTD::invoke(_VSTD::forward<_Func>(__f), _VSTD::move(value()));
+    return remove_cvref_t<_Up>();
+  }
+
+  template<class _Func>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+  constexpr auto transform(_Func&& __f) & {
+    using _Up = remove_cv_t<invoke_result_t<_Func, value_type&>>;
+    static_assert(!is_array_v<_Up>, "Result of f(value()) should not be an Array");
+    static_assert(!is_same_v<_Up, in_place_t>,
+                  "Result of f(value()) should not be std::in_place_t");
+    static_assert(!is_same_v<_Up, nullopt_t>,
+                  "Result of f(value()) should not be std::nullopt_t");
+    static_assert(is_object_v<_Up>, "Result of f(value()) should be an object type");
+    if (*this)
+      return optional<_Up>(__optional_construct_from_invoke_tag{}, _VSTD::forward<_Func>(__f), value());
+    return optional<_Up>();
+  }
+
+  template<class _Func>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+  constexpr auto transform(_Func&& __f) const& {
+    using _Up = remove_cv_t<invoke_result_t<_Func, const value_type&>>;
+    static_assert(!is_array_v<_Up>, "Result of f(value()) should not be an Array");
+    static_assert(!is_same_v<_Up, in_place_t>,
+                  "Result of f(value()) should not be std::in_place_t");
+    static_assert(!is_same_v<_Up, nullopt_t>,
+                  "Result of f(value()) should not be std::nullopt_t");
+    static_assert(is_object_v<_Up>, "Result of f(value()) should be an object type");
+    if (*this)
+      return optional<_Up>(__optional_construct_from_invoke_tag{}, _VSTD::forward<_Func>(__f), value());
+    return optional<_Up>();
+  }
+
+  template<class _Func>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+  constexpr auto transform(_Func&& __f) && {
+    using _Up = remove_cv_t<invoke_result_t<_Func, value_type&&>>;
+    static_assert(!is_array_v<_Up>, "Result of f(std::move(value())) should not be an Array");
+    static_assert(!is_same_v<_Up, in_place_t>,
+                  "Result of f(std::move(value())) should not be std::in_place_t");
+    static_assert(!is_same_v<_Up, nullopt_t>,
+                  "Result of f(std::move(value())) should not be std::nullopt_t");
+    static_assert(is_object_v<_Up>, "Result of f(std::move(value())) should be an object type");
+    if (*this)
+      return optional<_Up>(__optional_construct_from_invoke_tag{}, _VSTD::forward<_Func>(__f), _VSTD::move(value()));
+    return optional<_Up>();
+  }
+
+  template<class _Func>
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_AVAILABILITY_THROW_BAD_OPTIONAL_ACCESS
+  constexpr auto transform(_Func&& __f) const&& {
+    using _Up = remove_cvref_t<invoke_result_t<_Func, const value_type&&>>;
+    static_assert(!is_array_v<_Up>, "Result of f(std::move(value())) should not be an Array");
+    static_assert(!is_same_v<_Up, in_place_t>,
+                  "Result of f(std::move(value())) should not be std::in_place_t");
+    static_assert(!is_same_v<_Up, nullopt_t>,
+                  "Result of f(std::move(value())) should not be std::nullopt_t");
+    static_assert(is_object_v<_Up>, "Result of f(std::move(value())) should be an object type");
+    if (*this)
+      return optional<_Up>(__optional_construct_from_invoke_tag{}, _VSTD::forward<_Func>(__f), _VSTD::move(value()));
+    return optional<_Up>();
+  }
+
+  template<invocable _Func>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr optional or_else(_Func&& __f) const& requires is_copy_constructible_v<value_type> {
+    static_assert(is_same_v<remove_cvref_t<invoke_result_t<_Func>>, optional>,
+                  "Result of f() should be the same type as this optional");
+    if (*this)
+      return *this;
+    return _VSTD::forward<_Func>(__f)();
+  }
+
+  template<invocable _Func>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr optional or_else(_Func&& __f) && requires is_move_constructible_v<value_type> {
+    static_assert(is_same_v<remove_cvref_t<invoke_result_t<_Func>>, optional>,
+                  "Result of f() should be the same type as this optional");
+    if (*this)
+      return _VSTD::move(*this);
+    return _VSTD::forward<_Func>(__f)();
+  }
+#endif // _LIBCPP_STD_VER > 20
+
+    using __base::reset;
+};
+
+#if _LIBCPP_STD_VER >= 17
+template<class _Tp>
+    optional(_Tp) -> optional<_Tp>;
+#endif
+
+// Comparisons between optionals
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() ==
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator==(const optional<_Tp>& __x, const optional<_Up>& __y)
+{
+    if (static_cast<bool>(__x) != static_cast<bool>(__y))
+        return false;
+    if (!static_cast<bool>(__x))
+        return true;
+    return *__x == *__y;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() !=
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator!=(const optional<_Tp>& __x, const optional<_Up>& __y)
+{
+    if (static_cast<bool>(__x) != static_cast<bool>(__y))
+        return true;
+    if (!static_cast<bool>(__x))
+        return false;
+    return *__x != *__y;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() <
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator<(const optional<_Tp>& __x, const optional<_Up>& __y)
+{
+    if (!static_cast<bool>(__y))
+        return false;
+    if (!static_cast<bool>(__x))
+        return true;
+    return *__x < *__y;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() >
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator>(const optional<_Tp>& __x, const optional<_Up>& __y)
+{
+    if (!static_cast<bool>(__x))
+        return false;
+    if (!static_cast<bool>(__y))
+        return true;
+    return *__x > *__y;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() <=
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator<=(const optional<_Tp>& __x, const optional<_Up>& __y)
+{
+    if (!static_cast<bool>(__x))
+        return true;
+    if (!static_cast<bool>(__y))
+        return false;
+    return *__x <= *__y;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() >=
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator>=(const optional<_Tp>& __x, const optional<_Up>& __y)
+{
+    if (!static_cast<bool>(__y))
+        return true;
+    if (!static_cast<bool>(__x))
+        return false;
+    return *__x >= *__y;
+}
+
+// Comparisons with nullopt
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool
+operator==(const optional<_Tp>& __x, nullopt_t) noexcept
+{
+    return !static_cast<bool>(__x);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool
+operator==(nullopt_t, const optional<_Tp>& __x) noexcept
+{
+    return !static_cast<bool>(__x);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool
+operator!=(const optional<_Tp>& __x, nullopt_t) noexcept
+{
+    return static_cast<bool>(__x);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool
+operator!=(nullopt_t, const optional<_Tp>& __x) noexcept
+{
+    return static_cast<bool>(__x);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool
+operator<(const optional<_Tp>&, nullopt_t) noexcept
+{
+    return false;
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool
+operator<(nullopt_t, const optional<_Tp>& __x) noexcept
+{
+    return static_cast<bool>(__x);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool
+operator<=(const optional<_Tp>& __x, nullopt_t) noexcept
+{
+    return !static_cast<bool>(__x);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool
+operator<=(nullopt_t, const optional<_Tp>&) noexcept
+{
+    return true;
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool
+operator>(const optional<_Tp>& __x, nullopt_t) noexcept
+{
+    return static_cast<bool>(__x);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool
+operator>(nullopt_t, const optional<_Tp>&) noexcept
+{
+    return false;
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool
+operator>=(const optional<_Tp>&, nullopt_t) noexcept
+{
+    return true;
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+bool
+operator>=(nullopt_t, const optional<_Tp>& __x) noexcept
+{
+    return !static_cast<bool>(__x);
+}
+
+// Comparisons with T
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() ==
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator==(const optional<_Tp>& __x, const _Up& __v)
+{
+    return static_cast<bool>(__x) ? *__x == __v : false;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() ==
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator==(const _Tp& __v, const optional<_Up>& __x)
+{
+    return static_cast<bool>(__x) ? __v == *__x : false;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() !=
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator!=(const optional<_Tp>& __x, const _Up& __v)
+{
+    return static_cast<bool>(__x) ? *__x != __v : true;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() !=
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator!=(const _Tp& __v, const optional<_Up>& __x)
+{
+    return static_cast<bool>(__x) ? __v != *__x : true;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() <
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator<(const optional<_Tp>& __x, const _Up& __v)
+{
+    return static_cast<bool>(__x) ? *__x < __v : true;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() <
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator<(const _Tp& __v, const optional<_Up>& __x)
+{
+    return static_cast<bool>(__x) ? __v < *__x : false;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() <=
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator<=(const optional<_Tp>& __x, const _Up& __v)
+{
+    return static_cast<bool>(__x) ? *__x <= __v : true;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() <=
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator<=(const _Tp& __v, const optional<_Up>& __x)
+{
+    return static_cast<bool>(__x) ? __v <= *__x : false;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() >
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator>(const optional<_Tp>& __x, const _Up& __v)
+{
+    return static_cast<bool>(__x) ? *__x > __v : false;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() >
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator>(const _Tp& __v, const optional<_Up>& __x)
+{
+    return static_cast<bool>(__x) ? __v > *__x : true;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() >=
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator>=(const optional<_Tp>& __x, const _Up& __v)
+{
+    return static_cast<bool>(__x) ? *__x >= __v : false;
+}
+
+template <class _Tp, class _Up>
+_LIBCPP_INLINE_VISIBILITY constexpr
+enable_if_t<
+    is_convertible_v<decltype(std::declval<const _Tp&>() >=
+        std::declval<const _Up&>()), bool>,
+    bool
+>
+operator>=(const _Tp& __v, const optional<_Up>& __x)
+{
+    return static_cast<bool>(__x) ? __v >= *__x : true;
+}
+
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+enable_if_t<
+    is_move_constructible_v<_Tp> && is_swappable_v<_Tp>,
+    void
+>
+swap(optional<_Tp>& __x, optional<_Tp>& __y) noexcept(noexcept(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY constexpr
+optional<decay_t<_Tp>> make_optional(_Tp&& __v)
+{
+    return optional<decay_t<_Tp>>(_VSTD::forward<_Tp>(__v));
+}
+
+template <class _Tp, class... _Args>
+_LIBCPP_INLINE_VISIBILITY constexpr
+optional<_Tp> make_optional(_Args&&... __args)
+{
+    return optional<_Tp>(in_place, _VSTD::forward<_Args>(__args)...);
+}
+
+template <class _Tp, class _Up, class... _Args>
+_LIBCPP_INLINE_VISIBILITY constexpr
+optional<_Tp> make_optional(initializer_list<_Up> __il,  _Args&&... __args)
+{
+    return optional<_Tp>(in_place, __il, _VSTD::forward<_Args>(__args)...);
+}
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS hash<
+    __enable_hash_helper<optional<_Tp>, remove_const_t<_Tp>>
+>
+{
+#if _LIBCPP_STD_VER <= 17 || defined(_LIBCPP_ENABLE_CXX20_REMOVED_BINDER_TYPEDEFS)
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef optional<_Tp> argument_type;
+    _LIBCPP_DEPRECATED_IN_CXX17 typedef size_t        result_type;
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const optional<_Tp>& __opt) const
+    {
+        return static_cast<bool>(__opt) ? hash<remove_const_t<_Tp>>()(*__opt) : 0;
+    }
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 14
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <atomic>
+#  include <climits>
+#  include <concepts>
+#  include <ctime>
+#  include <iterator>
+#  include <memory>
+#  include <ratio>
+#  include <tuple>
+#  include <typeinfo>
+#  include <utility>
+#  include <variant>
+#endif
+
+#endif // _LIBCPP_OPTIONAL
diff --git a/app/src/main/cpp/libcxx/include/ostream b/app/src/main/cpp/libcxx/include/ostream
new file mode 100644
index 0000000..4780c76
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/ostream
@@ -0,0 +1,1197 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_OSTREAM
+#define _LIBCPP_OSTREAM
+
+/*
+    ostream synopsis
+
+template <class charT, class traits = char_traits<charT> >
+class basic_ostream
+    : virtual public basic_ios<charT,traits>
+{
+public:
+    // types (inherited from basic_ios (27.5.4)):
+    typedef charT                          char_type;
+    typedef traits                         traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    // 27.7.2.2 Constructor/destructor:
+    explicit basic_ostream(basic_streambuf<char_type,traits>* sb);
+    basic_ostream(basic_ostream&& rhs);
+    virtual ~basic_ostream();
+
+    // 27.7.2.3 Assign/swap
+    basic_ostream& operator=(const basic_ostream& rhs) = delete; // C++14
+    basic_ostream& operator=(basic_ostream&& rhs);
+    void swap(basic_ostream& rhs);
+
+    // 27.7.2.4 Prefix/suffix:
+    class sentry;
+
+    // 27.7.2.6 Formatted output:
+    basic_ostream& operator<<(basic_ostream& (*pf)(basic_ostream&));
+    basic_ostream& operator<<(basic_ios<charT, traits>& (*pf)(basic_ios<charT,traits>&));
+    basic_ostream& operator<<(ios_base& (*pf)(ios_base&));
+    basic_ostream& operator<<(bool n);
+    basic_ostream& operator<<(short n);
+    basic_ostream& operator<<(unsigned short n);
+    basic_ostream& operator<<(int n);
+    basic_ostream& operator<<(unsigned int n);
+    basic_ostream& operator<<(long n);
+    basic_ostream& operator<<(unsigned long n);
+    basic_ostream& operator<<(long long n);
+    basic_ostream& operator<<(unsigned long long n);
+    basic_ostream& operator<<(float f);
+    basic_ostream& operator<<(double f);
+    basic_ostream& operator<<(long double f);
+    basic_ostream& operator<<(const void* p);
+    basic_ostream& operator<<(const volatile void* val); // C++23
+    basic_ostream& operator<<(basic_streambuf<char_type,traits>* sb);
+    basic_ostream& operator<<(nullptr_t);
+
+    // 27.7.2.7 Unformatted output:
+    basic_ostream& put(char_type c);
+    basic_ostream& write(const char_type* s, streamsize n);
+    basic_ostream& flush();
+
+    // 27.7.2.5 seeks:
+    pos_type tellp();
+    basic_ostream& seekp(pos_type);
+    basic_ostream& seekp(off_type, ios_base::seekdir);
+protected:
+    basic_ostream(const basic_ostream& rhs) = delete;
+    basic_ostream(basic_ostream&& rhs);
+    // 27.7.3.3 Assign/swap
+    basic_ostream& operator=(basic_ostream& rhs) = delete;
+    basic_ostream& operator=(const basic_ostream&& rhs);
+    void swap(basic_ostream& rhs);
+};
+
+// 27.7.2.6.4 character inserters
+
+template<class charT, class traits>
+  basic_ostream<charT,traits>& operator<<(basic_ostream<charT,traits>&, charT);
+
+template<class charT, class traits>
+  basic_ostream<charT,traits>& operator<<(basic_ostream<charT,traits>&, char);
+
+template<class traits>
+  basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&, char);
+
+// signed and unsigned
+
+template<class traits>
+  basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&, signed char);
+
+template<class traits>
+  basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&, unsigned char);
+
+// NTBS
+template<class charT, class traits>
+  basic_ostream<charT,traits>& operator<<(basic_ostream<charT,traits>&, const charT*);
+
+template<class charT, class traits>
+  basic_ostream<charT,traits>& operator<<(basic_ostream<charT,traits>&, const char*);
+
+template<class traits>
+  basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&, const char*);
+
+// signed and unsigned
+template<class traits>
+basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&, const signed char*);
+
+template<class traits>
+  basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&, const unsigned char*);
+
+// swap:
+template <class charT, class traits>
+  void swap(basic_ostream<charT, traits>& x, basic_ostream<charT, traits>& y);
+
+template <class charT, class traits>
+  basic_ostream<charT,traits>& endl(basic_ostream<charT,traits>& os);
+
+template <class charT, class traits>
+  basic_ostream<charT,traits>& ends(basic_ostream<charT,traits>& os);
+
+template <class charT, class traits>
+  basic_ostream<charT,traits>& flush(basic_ostream<charT,traits>& os);
+
+// rvalue stream insertion
+template <class Stream, class T>
+  Stream&& operator<<(Stream&& os, const T& x);
+
+template<class traits>
+basic_ostream<char, traits>& operator<<(basic_ostream<char, traits>&, wchar_t) = delete;               // since C++20
+template<class traits>
+basic_ostream<char, traits>& operator<<(basic_ostream<char, traits>&, char8_t) = delete;               // since C++20
+template<class traits>
+basic_ostream<char, traits>& operator<<(basic_ostream<char, traits>&, char16_t) = delete;              // since C++20
+template<class traits>
+basic_ostream<char, traits>& operator<<(basic_ostream<char, traits>&, char32_t) = delete;              // since C++20
+template<class traits>
+basic_ostream<wchar_t, traits>& operator<<(basic_ostream<wchar_t, traits>&, char8_t) = delete;         // since C++20
+template<class traits>
+basic_ostream<wchar_t, traits>& operator<<(basic_ostream<wchar_t, traits>&, char16_t) = delete;        // since C++20
+template<class traits>
+basic_ostream<wchar_t, traits>& operator<<(basic_ostream<wchar_t, traits>&, char32_t) = delete;        // since C++20
+template<class traits>
+basic_ostream<char, traits>& operator<<(basic_ostream<char, traits>&, const wchar_t*) = delete;        // since C++20
+template<class traits>
+basic_ostream<char, traits>& operator<<(basic_ostream<char, traits>&, const char8_t*) = delete;        // since C++20
+template<class traits>
+basic_ostream<char, traits>& operator<<(basic_ostream<char, traits>&, const char16_t*) = delete;       // since C++20
+template<class traits>
+basic_ostream<char, traits>& operator<<(basic_ostream<char, traits>&, const char32_t*) = delete;       // since C++20
+template<class traits>
+basic_ostream<wchar_t, traits>& operator<<(basic_ostream<wchar_t, traits>&, const char8_t*) = delete;  // since C++20
+template<class traits>
+basic_ostream<wchar_t, traits>& operator<<(basic_ostream<wchar_t, traits>&, const char16_t*) = delete; // since C++20
+template<class traits>
+basic_ostream<wchar_t, traits>& operator<<(basic_ostream<wchar_t, traits>&, const char32_t*) = delete; // since C++20
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__memory/shared_ptr.h>
+#include <__memory/unique_ptr.h>
+#include <bitset>
+#include <ios>
+#include <locale>
+#include <new>
+#include <streambuf>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS basic_ostream
+    : virtual public basic_ios<_CharT, _Traits>
+{
+public:
+    // types (inherited from basic_ios (27.5.4)):
+    typedef _CharT                         char_type;
+    typedef _Traits                        traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    // 27.7.2.2 Constructor/destructor:
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    explicit basic_ostream(basic_streambuf<char_type, traits_type>* __sb)
+    { this->init(__sb); }
+    ~basic_ostream() override;
+protected:
+    inline _LIBCPP_INLINE_VISIBILITY
+    basic_ostream(basic_ostream&& __rhs);
+
+    // 27.7.2.3 Assign/swap
+    inline _LIBCPP_INLINE_VISIBILITY
+    basic_ostream& operator=(basic_ostream&& __rhs);
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    void swap(basic_ostream& __rhs)
+    { basic_ios<char_type, traits_type>::swap(__rhs); }
+
+    basic_ostream           (const basic_ostream& __rhs) = delete;
+    basic_ostream& operator=(const basic_ostream& __rhs) = delete;
+
+public:
+    // 27.7.2.4 Prefix/suffix:
+    class _LIBCPP_TEMPLATE_VIS sentry;
+
+    // 27.7.2.6 Formatted output:
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_ostream& operator<<(basic_ostream& (*__pf)(basic_ostream&))
+    { return __pf(*this); }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_ostream& operator<<(basic_ios<char_type, traits_type>&
+                              (*__pf)(basic_ios<char_type,traits_type>&))
+    { __pf(*this); return *this; }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_ostream& operator<<(ios_base& (*__pf)(ios_base&))
+    { __pf(*this); return *this; }
+
+    basic_ostream& operator<<(bool __n);
+    basic_ostream& operator<<(short __n);
+    basic_ostream& operator<<(unsigned short __n);
+    basic_ostream& operator<<(int __n);
+    basic_ostream& operator<<(unsigned int __n);
+    basic_ostream& operator<<(long __n);
+    basic_ostream& operator<<(unsigned long __n);
+    basic_ostream& operator<<(long long __n);
+    basic_ostream& operator<<(unsigned long long __n);
+    basic_ostream& operator<<(float __f);
+    basic_ostream& operator<<(double __f);
+    basic_ostream& operator<<(long double __f);
+    basic_ostream& operator<<(const void* __p);
+
+#if _LIBCPP_STD_VER > 20
+    _LIBCPP_HIDE_FROM_ABI
+    basic_ostream& operator<<(const volatile void* __p) {
+        return operator<<(const_cast<const void*>(__p));
+    }
+#endif
+
+    basic_ostream& operator<<(basic_streambuf<char_type, traits_type>* __sb);
+
+#if _LIBCPP_STD_VER > 14
+// LWG 2221 - nullptr. This is not backported to older standards modes.
+// See https://reviews.llvm.org/D127033 for more info on the rationale.
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostream& operator<<(nullptr_t)
+    { return *this << "nullptr"; }
+#endif
+
+    // 27.7.2.7 Unformatted output:
+    basic_ostream& put(char_type __c);
+    basic_ostream& write(const char_type* __s, streamsize __n);
+    basic_ostream& flush();
+
+    // 27.7.2.5 seeks:
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    pos_type tellp();
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_ostream& seekp(pos_type __pos);
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_ostream& seekp(off_type __off, ios_base::seekdir __dir);
+
+protected:
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostream() {}  // extension, intentially does not initialize
+};
+
+template <class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS basic_ostream<_CharT, _Traits>::sentry
+{
+    bool __ok_;
+    basic_ostream<_CharT, _Traits>& __os_;
+
+public:
+    explicit sentry(basic_ostream<_CharT, _Traits>& __os);
+    ~sentry();
+    sentry(const sentry&) = delete;
+    sentry& operator=(const sentry&) = delete;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit operator bool() const {return __ok_;}
+};
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>::sentry::sentry(basic_ostream<_CharT, _Traits>& __os)
+    : __ok_(false),
+      __os_(__os)
+{
+    if (__os.good())
+    {
+        if (__os.tie())
+            __os.tie()->flush();
+        __ok_ = true;
+    }
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>::sentry::~sentry()
+{
+    if (__os_.rdbuf() && __os_.good() && (__os_.flags() & ios_base::unitbuf)
+                      && !uncaught_exception())
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            if (__os_.rdbuf()->pubsync() == -1)
+                __os_.setstate(ios_base::badbit);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>::basic_ostream(basic_ostream&& __rhs)
+{
+    this->move(__rhs);
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator=(basic_ostream&& __rhs)
+{
+    swap(__rhs);
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>::~basic_ostream()
+{
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(basic_streambuf<char_type, traits_type>* __sb)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            if (__sb)
+            {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+                try
+                {
+#endif // _LIBCPP_NO_EXCEPTIONS
+                    typedef istreambuf_iterator<_CharT, _Traits> _Ip;
+                    typedef ostreambuf_iterator<_CharT, _Traits> _Op;
+                    _Ip __i(__sb);
+                    _Ip __eof;
+                    _Op __o(*this);
+                    size_t __c = 0;
+                    for (; __i != __eof; ++__i, ++__o, ++__c)
+                    {
+                        *__o = *__i;
+                        if (__o.failed())
+                            break;
+                    }
+                    if (__c == 0)
+                        this->setstate(ios_base::failbit);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+                }
+                catch (...)
+                {
+                    this->__set_failbit_and_consider_rethrow();
+                }
+#endif // _LIBCPP_NO_EXCEPTIONS
+            }
+            else
+                this->setstate(ios_base::badbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(bool __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(), __n).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(short __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            ios_base::fmtflags __flags = ios_base::flags() & ios_base::basefield;
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(),
+                        __flags == ios_base::oct || __flags == ios_base::hex ?
+                        static_cast<long>(static_cast<unsigned short>(__n))  :
+                        static_cast<long>(__n)).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(unsigned short __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(), static_cast<unsigned long>(__n)).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(int __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            ios_base::fmtflags __flags = ios_base::flags() & ios_base::basefield;
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(),
+                        __flags == ios_base::oct || __flags == ios_base::hex ?
+                        static_cast<long>(static_cast<unsigned int>(__n))  :
+                        static_cast<long>(__n)).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(unsigned int __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(), static_cast<unsigned long>(__n)).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(long __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(), __n).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(unsigned long __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(), __n).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(long long __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(), __n).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(unsigned long long __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(), __n).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(float __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(), static_cast<double>(__n)).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(double __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(), __n).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(long double __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(), __n).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::operator<<(const void* __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            typedef num_put<char_type, ostreambuf_iterator<char_type, traits_type> > _Fp;
+            const _Fp& __f = std::use_facet<_Fp>(this->getloc());
+            if (__f.put(*this, *this, this->fill(), __n).failed())
+                this->setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template<class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+__put_character_sequence(basic_ostream<_CharT, _Traits>& __os,
+                          const _CharT* __str, size_t __len)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        typename basic_ostream<_CharT, _Traits>::sentry __s(__os);
+        if (__s)
+        {
+            typedef ostreambuf_iterator<_CharT, _Traits> _Ip;
+            if (std::__pad_and_output(_Ip(__os),
+                                      __str,
+                                      (__os.flags() & ios_base::adjustfield) == ios_base::left ?
+                                          __str + __len :
+                                          __str,
+                                      __str + __len,
+                                      __os,
+                                      __os.fill()).failed())
+                __os.setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        __os.__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return __os;
+}
+
+
+template<class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, _CharT __c)
+{
+    return _VSTD::__put_character_sequence(__os, &__c, 1);
+}
+
+template<class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, char __cn)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        typename basic_ostream<_CharT, _Traits>::sentry __s(__os);
+        if (__s)
+        {
+            _CharT __c = __os.widen(__cn);
+            typedef ostreambuf_iterator<_CharT, _Traits> _Ip;
+            if (std::__pad_and_output(_Ip(__os),
+                                      &__c,
+                                      (__os.flags() & ios_base::adjustfield) == ios_base::left ?
+                                          &__c + 1 :
+                                          &__c,
+                                      &__c + 1,
+                                      __os,
+                                      __os.fill()).failed())
+                __os.setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        __os.__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return __os;
+}
+
+template<class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<char, _Traits>&
+operator<<(basic_ostream<char, _Traits>& __os, char __c)
+{
+    return _VSTD::__put_character_sequence(__os, &__c, 1);
+}
+
+template<class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<char, _Traits>&
+operator<<(basic_ostream<char, _Traits>& __os, signed char __c)
+{
+    return _VSTD::__put_character_sequence(__os, (char *) &__c, 1);
+}
+
+template<class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<char, _Traits>&
+operator<<(basic_ostream<char, _Traits>& __os, unsigned char __c)
+{
+    return _VSTD::__put_character_sequence(__os, (char *) &__c, 1);
+}
+
+template<class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const _CharT* __str)
+{
+    return _VSTD::__put_character_sequence(__os, __str, _Traits::length(__str));
+}
+
+template<class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const char* __strn)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        typename basic_ostream<_CharT, _Traits>::sentry __s(__os);
+        if (__s)
+        {
+            typedef ostreambuf_iterator<_CharT, _Traits> _Ip;
+            size_t __len = char_traits<char>::length(__strn);
+            const int __bs = 100;
+            _CharT __wbb[__bs];
+            _CharT* __wb = __wbb;
+            unique_ptr<_CharT, void(*)(void*)> __h(0, free);
+            if (__len > __bs)
+            {
+                __wb = (_CharT*)malloc(__len*sizeof(_CharT));
+                if (__wb == 0)
+                    __throw_bad_alloc();
+                __h.reset(__wb);
+            }
+            for (_CharT* __p = __wb; *__strn != '\0'; ++__strn, ++__p)
+                *__p = __os.widen(*__strn);
+            if (std::__pad_and_output(_Ip(__os),
+                                      __wb,
+                                      (__os.flags() & ios_base::adjustfield) == ios_base::left ?
+                                          __wb + __len :
+                                          __wb,
+                                      __wb + __len,
+                                      __os,
+                                      __os.fill()).failed())
+                __os.setstate(ios_base::badbit | ios_base::failbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        __os.__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return __os;
+}
+
+template<class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<char, _Traits>&
+operator<<(basic_ostream<char, _Traits>& __os, const char* __str)
+{
+    return _VSTD::__put_character_sequence(__os, __str, _Traits::length(__str));
+}
+
+template<class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<char, _Traits>&
+operator<<(basic_ostream<char, _Traits>& __os, const signed char* __str)
+{
+    const char *__s = (const char *) __str;
+    return _VSTD::__put_character_sequence(__os, __s, _Traits::length(__s));
+}
+
+template<class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<char, _Traits>&
+operator<<(basic_ostream<char, _Traits>& __os, const unsigned char* __str)
+{
+    const char *__s = (const char *) __str;
+    return _VSTD::__put_character_sequence(__os, __s, _Traits::length(__s));
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::put(char_type __c)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __s(*this);
+        if (__s)
+        {
+            typedef ostreambuf_iterator<_CharT, _Traits> _Op;
+            _Op __o(*this);
+            *__o = __c;
+            if (__o.failed())
+                this->setstate(ios_base::badbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::write(const char_type* __s, streamsize __n)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        sentry __sen(*this);
+        if (__sen && __n)
+        {
+            if (this->rdbuf()->sputn(__s, __n) != __n)
+                this->setstate(ios_base::badbit);
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::flush()
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        if (this->rdbuf())
+        {
+            sentry __s(*this);
+            if (__s)
+            {
+                if (this->rdbuf()->pubsync() == -1)
+                    this->setstate(ios_base::badbit);
+            }
+        }
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        this->__set_badbit_and_consider_rethrow();
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+typename basic_ostream<_CharT, _Traits>::pos_type
+basic_ostream<_CharT, _Traits>::tellp()
+{
+    if (this->fail())
+        return pos_type(-1);
+    return this->rdbuf()->pubseekoff(0, ios_base::cur, ios_base::out);
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::seekp(pos_type __pos)
+{
+    sentry __s(*this);
+    if (!this->fail())
+    {
+        if (this->rdbuf()->pubseekpos(__pos, ios_base::out) == pos_type(-1))
+            this->setstate(ios_base::failbit);
+    }
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+basic_ostream<_CharT, _Traits>&
+basic_ostream<_CharT, _Traits>::seekp(off_type __off, ios_base::seekdir __dir)
+{
+    sentry __s(*this);
+    if (!this->fail())
+    {
+        if (this->rdbuf()->pubseekoff(__off, __dir, ios_base::out) == pos_type(-1))
+            this->setstate(ios_base::failbit);
+    }
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI inline
+basic_ostream<_CharT, _Traits>&
+endl(basic_ostream<_CharT, _Traits>& __os)
+{
+    __os.put(__os.widen('\n'));
+    __os.flush();
+    return __os;
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI inline
+basic_ostream<_CharT, _Traits>&
+ends(basic_ostream<_CharT, _Traits>& __os)
+{
+    __os.put(_CharT());
+    return __os;
+}
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI inline
+basic_ostream<_CharT, _Traits>&
+flush(basic_ostream<_CharT, _Traits>& __os)
+{
+    __os.flush();
+    return __os;
+}
+
+template <class _Stream, class _Tp, class = void>
+struct __is_ostreamable : false_type { };
+
+template <class _Stream, class _Tp>
+struct __is_ostreamable<_Stream, _Tp, decltype(
+    std::declval<_Stream>() << std::declval<_Tp>(), void()
+)> : true_type { };
+
+template <class _Stream, class _Tp, class = typename enable_if<
+    _And<is_base_of<ios_base, _Stream>,
+         __is_ostreamable<_Stream&, const _Tp&> >::value
+>::type>
+_LIBCPP_INLINE_VISIBILITY
+_Stream&& operator<<(_Stream&& __os, const _Tp& __x)
+{
+    __os << __x;
+    return _VSTD::move(__os);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const basic_string<_CharT, _Traits, _Allocator>& __str)
+{
+    return _VSTD::__put_character_sequence(__os, __str.data(), __str.size());
+}
+
+template<class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           basic_string_view<_CharT, _Traits> __sv)
+{
+    return _VSTD::__put_character_sequence(__os, __sv.data(), __sv.size());
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const error_code& __ec)
+{
+    return __os << __ec.category().name() << ':' << __ec.value();
+}
+
+template<class _CharT, class _Traits, class _Yp>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, shared_ptr<_Yp> const& __p)
+{
+    return __os << __p.get();
+}
+
+template<class _CharT, class _Traits, class _Yp, class _Dp>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    is_same<void, __void_t<decltype((std::declval<basic_ostream<_CharT, _Traits>&>() << std::declval<typename unique_ptr<_Yp, _Dp>::pointer>()))> >::value,
+    basic_ostream<_CharT, _Traits>&
+>::type
+operator<<(basic_ostream<_CharT, _Traits>& __os, unique_ptr<_Yp, _Dp> const& __p)
+{
+    return __os << __p.get();
+}
+
+template <class _CharT, class _Traits, size_t _Size>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, const bitset<_Size>& __x)
+{
+    return __os << __x.template to_string<_CharT, _Traits>
+                        (std::use_facet<ctype<_CharT> >(__os.getloc()).widen('0'),
+                         std::use_facet<ctype<_CharT> >(__os.getloc()).widen('1'));
+}
+
+#if _LIBCPP_STD_VER > 17
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class _Traits>
+basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>&, wchar_t) = delete;
+
+template <class _Traits>
+basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>&, const wchar_t*) = delete;
+
+template <class _Traits>
+basic_ostream<wchar_t, _Traits>& operator<<(basic_ostream<wchar_t, _Traits>&, char16_t) = delete;
+
+template <class _Traits>
+basic_ostream<wchar_t, _Traits>& operator<<(basic_ostream<wchar_t, _Traits>&, char32_t) = delete;
+
+template <class _Traits>
+basic_ostream<wchar_t, _Traits>& operator<<(basic_ostream<wchar_t, _Traits>&, const char16_t*) = delete;
+
+template <class _Traits>
+basic_ostream<wchar_t, _Traits>& operator<<(basic_ostream<wchar_t, _Traits>&, const char32_t*) = delete;
+
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+template <class _Traits>
+basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>&, char8_t) = delete;
+
+template <class _Traits>
+basic_ostream<wchar_t, _Traits>& operator<<(basic_ostream<wchar_t, _Traits>&, char8_t) = delete;
+
+template <class _Traits>
+basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>&, const char8_t*) = delete;
+
+template <class _Traits>
+basic_ostream<wchar_t, _Traits>& operator<<(basic_ostream<wchar_t, _Traits>&, const char8_t*) = delete;
+#endif
+
+template <class _Traits>
+basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>&, char16_t) = delete;
+
+template <class _Traits>
+basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>&, char32_t) = delete;
+
+template <class _Traits>
+basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>&, const char16_t*) = delete;
+
+template <class _Traits>
+basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>&, const char32_t*) = delete;
+
+#endif // _LIBCPP_STD_VER > 17
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_ostream<char>;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_ostream<wchar_t>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <iterator>
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_OSTREAM
diff --git a/app/src/main/cpp/libcxx/include/queue b/app/src/main/cpp/libcxx/include/queue
new file mode 100644
index 0000000..6c1b892
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/queue
@@ -0,0 +1,970 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_QUEUE
+#define _LIBCPP_QUEUE
+
+/*
+    queue synopsis
+
+namespace std
+{
+
+template <class T, class Container = deque<T>>
+class queue
+{
+public:
+    typedef Container                                container_type;
+    typedef typename container_type::value_type      value_type;
+    typedef typename container_type::reference       reference;
+    typedef typename container_type::const_reference const_reference;
+    typedef typename container_type::size_type       size_type;
+
+protected:
+    container_type c;
+
+public:
+    queue() = default;
+    ~queue() = default;
+
+    queue(const queue& q) = default;
+    queue(queue&& q) = default;
+
+    queue& operator=(const queue& q) = default;
+    queue& operator=(queue&& q) = default;
+
+    explicit queue(const container_type& c);
+    explicit queue(container_type&& c)
+    template<class InputIterator>
+        queue(InputIterator first, InputIterator last); // since C++23
+    template <class Alloc>
+        explicit queue(const Alloc& a);
+    template <class Alloc>
+        queue(const container_type& c, const Alloc& a);
+    template <class Alloc>
+        queue(container_type&& c, const Alloc& a);
+    template <class Alloc>
+        queue(const queue& q, const Alloc& a);
+    template <class Alloc>
+        queue(queue&& q, const Alloc& a);
+    template <class InputIterator, class Alloc>
+        queue(InputIterator first, InputIterator last, const Alloc&); // since C++23
+
+    bool      empty() const;
+    size_type size() const;
+
+    reference       front();
+    const_reference front() const;
+    reference       back();
+    const_reference back() const;
+
+    void push(const value_type& v);
+    void push(value_type&& v);
+    template <class... Args> reference emplace(Args&&... args); // reference in C++17
+    void pop();
+
+    void swap(queue& q) noexcept(is_nothrow_swappable_v<Container>)
+};
+
+template<class Container>
+  queue(Container) -> queue<typename Container::value_type, Container>; // C++17
+
+template<class InputIterator>
+  queue(InputIterator, InputIterator) -> queue<iter-value-type<InputIterator>>; // since C++23
+
+template<class Container, class Allocator>
+  queue(Container, Allocator) -> queue<typename Container::value_type, Container>; // C++17
+
+template<class InputIterator, class Allocator>
+  queue(InputIterator, InputIterator, Allocator)
+  -> queue<iter-value-type<InputIterator>,
+           deque<iter-value-type<InputIterator>, Allocator>>; // since C++23
+
+template <class T, class Container>
+  bool operator==(const queue<T, Container>& x,const queue<T, Container>& y);
+
+template <class T, class Container>
+  bool operator< (const queue<T, Container>& x,const queue<T, Container>& y);
+
+template <class T, class Container>
+  bool operator!=(const queue<T, Container>& x,const queue<T, Container>& y);
+
+template <class T, class Container>
+  bool operator> (const queue<T, Container>& x,const queue<T, Container>& y);
+
+template <class T, class Container>
+  bool operator>=(const queue<T, Container>& x,const queue<T, Container>& y);
+
+template <class T, class Container>
+  bool operator<=(const queue<T, Container>& x,const queue<T, Container>& y);
+
+template <class T, class Container>
+  void swap(queue<T, Container>& x, queue<T, Container>& y)
+  noexcept(noexcept(x.swap(y)));
+
+template <class T, class Container = vector<T>,
+          class Compare = less<typename Container::value_type>>
+class priority_queue
+{
+public:
+    typedef Container                                container_type;
+    typedef typename container_type::value_type      value_type;
+    typedef typename container_type::reference       reference;
+    typedef typename container_type::const_reference const_reference;
+    typedef typename container_type::size_type       size_type;
+
+protected:
+    container_type c;
+    Compare comp;
+
+public:
+    priority_queue() : priority_queue(Compare()) {} // C++20
+    explicit priority_queue(const Compare& x) : priority_queue(x, Container()) {}
+    priority_queue(const Compare& x, const Container&);
+    explicit priority_queue(const Compare& x = Compare(), Container&& = Container()); // before C++20
+    priority_queue(const Compare& x, Container&&); // C++20
+    template <class InputIterator>
+        priority_queue(InputIterator first, InputIterator last,
+                       const Compare& comp = Compare());
+    template <class InputIterator>
+        priority_queue(InputIterator first, InputIterator last,
+                       const Compare& comp, const Container& c);
+    template <class InputIterator>
+        priority_queue(InputIterator first, InputIterator last,
+                       const Compare& comp, Container&& c);
+    template <class Alloc>
+        explicit priority_queue(const Alloc& a);
+    template <class Alloc>
+        priority_queue(const Compare& comp, const Alloc& a);
+    template <class Alloc>
+        priority_queue(const Compare& comp, const Container& c,
+                       const Alloc& a);
+    template <class Alloc>
+        priority_queue(const Compare& comp, Container&& c,
+                       const Alloc& a);
+    template <class InputIterator>
+        priority_queue(InputIterator first, InputIterator last,
+                       const Alloc& a);
+    template <class InputIterator>
+        priority_queue(InputIterator first, InputIterator last,
+                       const Compare& comp, const Alloc& a);
+    template <class InputIterator>
+        priority_queue(InputIterator first, InputIterator last,
+                       const Compare& comp, const Container& c, const Alloc& a);
+    template <class InputIterator>
+        priority_queue(InputIterator first, InputIterator last,
+                       const Compare& comp, Container&& c, const Alloc& a);
+    template <class Alloc>
+        priority_queue(const priority_queue& q, const Alloc& a);
+    template <class Alloc>
+        priority_queue(priority_queue&& q, const Alloc& a);
+
+    bool            empty() const;
+    size_type       size() const;
+    const_reference top() const;
+
+    void push(const value_type& v);
+    void push(value_type&& v);
+    template <class... Args> void emplace(Args&&... args);
+    void pop();
+
+    void swap(priority_queue& q)
+        noexcept(is_nothrow_swappable_v<Container> &&
+                 is_nothrow_swappable_v<Comp>)
+};
+
+template <class Compare, class Container>
+priority_queue(Compare, Container)
+    -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
+
+template<class InputIterator,
+         class Compare = less<iter-value-type<InputIterator>>,
+         class Container = vector<iter-value-type<InputIterator>>>
+priority_queue(InputIterator, InputIterator, Compare = Compare(), Container = Container())
+    -> priority_queue<iter-value-type<InputIterator>, Container, Compare>; // C++17
+
+template<class Compare, class Container, class Allocator>
+priority_queue(Compare, Container, Allocator)
+    -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
+
+template<class InputIterator, class Allocator>
+priority_queue(InputIterator, InputIterator, Allocator)
+    -> priority_queue<iter-value-type<InputIterator>,
+                      vector<iter-value-type<InputIterator>, Allocator>,
+                      less<iter-value-type<InputIterator>>>; // C++17
+
+template<class InputIterator, class Compare, class Allocator>
+priority_queue(InputIterator, InputIterator, Compare, Allocator)
+    -> priority_queue<iter-value-type<InputIterator>,
+                      vector<iter-value-type<InputIterator>, Allocator>, Compare>; // C++17
+
+template<class InputIterator, class Compare, class Container, class Allocator>
+priority_queue(InputIterator, InputIterator, Compare, Container, Allocator)
+    -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
+
+template <class T, class Container, class Compare>
+  void swap(priority_queue<T, Container, Compare>& x,
+            priority_queue<T, Container, Compare>& y)
+            noexcept(noexcept(x.swap(y)));
+
+}  // std
+
+*/
+
+#include <__algorithm/make_heap.h>
+#include <__algorithm/pop_heap.h>
+#include <__algorithm/push_heap.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__functional/operations.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/uses_allocator.h>
+#include <__utility/forward.h>
+#include <deque>
+#include <type_traits>
+#include <vector>
+#include <version>
+
+// standard-mandated includes
+
+// [queue.syn]
+#include <compare>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _Container = deque<_Tp> > class _LIBCPP_TEMPLATE_VIS queue;
+
+template <class _Tp, class _Container>
+_LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const queue<_Tp, _Container>& __x,const queue<_Tp, _Container>& __y);
+
+template <class _Tp, class _Container>
+_LIBCPP_INLINE_VISIBILITY
+bool
+operator< (const queue<_Tp, _Container>& __x,const queue<_Tp, _Container>& __y);
+
+template <class _Tp, class _Container /*= deque<_Tp>*/>
+class _LIBCPP_TEMPLATE_VIS queue
+{
+public:
+    typedef _Container                               container_type;
+    typedef typename container_type::value_type      value_type;
+    typedef typename container_type::reference       reference;
+    typedef typename container_type::const_reference const_reference;
+    typedef typename container_type::size_type       size_type;
+    static_assert((is_same<_Tp, value_type>::value), "" );
+
+protected:
+    container_type c;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    queue()
+        _NOEXCEPT_(is_nothrow_default_constructible<container_type>::value)
+        : c() {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    queue(const queue& __q) : c(__q.c) {}
+
+#if _LIBCPP_STD_VER > 20
+    template <class _InputIterator,
+              class = __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>>
+    _LIBCPP_HIDE_FROM_ABI
+    queue(_InputIterator __first, _InputIterator __last) : c(__first, __last) {}
+
+    template <class _InputIterator,
+              class _Alloc,
+              class = __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+              class = __enable_if_t<uses_allocator<container_type, _Alloc>::value>>
+    _LIBCPP_HIDE_FROM_ABI
+    queue(_InputIterator __first, _InputIterator __second, const _Alloc& __alloc) : c(__first, __second, __alloc) {}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    queue& operator=(const queue& __q) {c = __q.c; return *this;}
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    queue(queue&& __q)
+        _NOEXCEPT_(is_nothrow_move_constructible<container_type>::value)
+        : c(_VSTD::move(__q.c)) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    queue& operator=(queue&& __q)
+        _NOEXCEPT_(is_nothrow_move_assignable<container_type>::value)
+        {c = _VSTD::move(__q.c); return *this;}
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit queue(const container_type& __c)  : c(__c) {}
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    explicit queue(container_type&& __c) : c(_VSTD::move(__c)) {}
+#endif // _LIBCPP_CXX03_LANG
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        explicit queue(const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
+            : c(__a) {}
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        queue(const queue& __q, const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
+            : c(__q.c, __a) {}
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        queue(const container_type& __c, const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
+            : c(__c, __a) {}
+#ifndef _LIBCPP_CXX03_LANG
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        queue(container_type&& __c, const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
+            : c(_VSTD::move(__c), __a) {}
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        queue(queue&& __q, const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
+            : c(_VSTD::move(__q.c), __a) {}
+
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool      empty() const {return c.empty();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const  {return c.size();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference       front()       {return c.front();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reference front() const {return c.front();}
+    _LIBCPP_INLINE_VISIBILITY
+    reference       back()        {return c.back();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reference back() const  {return c.back();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void push(const value_type& __v) {c.push_back(__v);}
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    void push(value_type&& __v)      {c.push_back(_VSTD::move(__v));}
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+#if _LIBCPP_STD_VER > 14
+        decltype(auto) emplace(_Args&&... __args)
+            { return c.emplace_back(_VSTD::forward<_Args>(__args)...);}
+#else
+        void     emplace(_Args&&... __args)
+            {        c.emplace_back(_VSTD::forward<_Args>(__args)...);}
+#endif
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    void pop() {c.pop_front();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(queue& __q)
+        _NOEXCEPT_(__is_nothrow_swappable<container_type>::value)
+    {
+        using _VSTD::swap;
+        swap(c, __q.c);
+    }
+
+    _LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI const _Container& __get_container() const { return c; }
+
+    template <class _T1, class _C1>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    bool
+    operator==(const queue<_T1, _C1>& __x,const queue<_T1, _C1>& __y);
+
+    template <class _T1, class _C1>
+    friend
+    _LIBCPP_INLINE_VISIBILITY
+    bool
+    operator< (const queue<_T1, _C1>& __x,const queue<_T1, _C1>& __y);
+};
+
+#if _LIBCPP_STD_VER > 14
+template<class _Container,
+         class = enable_if_t<!__is_allocator<_Container>::value>
+>
+queue(_Container)
+    -> queue<typename _Container::value_type, _Container>;
+
+template<class _Container,
+         class _Alloc,
+         class = enable_if_t<!__is_allocator<_Container>::value>,
+         class = enable_if_t<uses_allocator<_Container, _Alloc>::value>
+>
+queue(_Container, _Alloc)
+    -> queue<typename _Container::value_type, _Container>;
+#endif
+
+#if _LIBCPP_STD_VER > 20
+template <class _InputIterator,
+          class = __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>>
+queue(_InputIterator, _InputIterator)
+    -> queue<__iter_value_type<_InputIterator>>;
+
+template <class _InputIterator,
+          class _Alloc,
+          class = __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+          class = __enable_if_t<__is_allocator<_Alloc>::value>>
+queue(_InputIterator, _InputIterator, _Alloc)
+    -> queue<__iter_value_type<_InputIterator>, deque<__iter_value_type<_InputIterator>, _Alloc>>;
+#endif
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const queue<_Tp, _Container>& __x,const queue<_Tp, _Container>& __y)
+{
+    return __x.c == __y.c;
+}
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator< (const queue<_Tp, _Container>& __x,const queue<_Tp, _Container>& __y)
+{
+    return __x.c < __y.c;
+}
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const queue<_Tp, _Container>& __x,const queue<_Tp, _Container>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator> (const queue<_Tp, _Container>& __x,const queue<_Tp, _Container>& __y)
+{
+    return __y < __x;
+}
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const queue<_Tp, _Container>& __x,const queue<_Tp, _Container>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const queue<_Tp, _Container>& __x,const queue<_Tp, _Container>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+__enable_if_t<__is_swappable<_Container>::value, void>
+swap(queue<_Tp, _Container>& __x, queue<_Tp, _Container>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+template <class _Tp, class _Container, class _Alloc>
+struct _LIBCPP_TEMPLATE_VIS uses_allocator<queue<_Tp, _Container>, _Alloc>
+    : public uses_allocator<_Container, _Alloc>
+{
+};
+
+template <class _Tp, class _Container = vector<_Tp>,
+          class _Compare = less<typename _Container::value_type> >
+class _LIBCPP_TEMPLATE_VIS priority_queue
+{
+public:
+    typedef _Container                               container_type;
+    typedef _Compare                                 value_compare;
+    typedef typename container_type::value_type      value_type;
+    typedef typename container_type::reference       reference;
+    typedef typename container_type::const_reference const_reference;
+    typedef typename container_type::size_type       size_type;
+    static_assert((is_same<_Tp, value_type>::value), "" );
+
+protected:
+    container_type c;
+    value_compare comp;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    priority_queue()
+        _NOEXCEPT_(is_nothrow_default_constructible<container_type>::value &&
+                   is_nothrow_default_constructible<value_compare>::value)
+        : c(), comp() {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    priority_queue(const priority_queue& __q) : c(__q.c), comp(__q.comp) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    priority_queue& operator=(const priority_queue& __q)
+        {c = __q.c; comp = __q.comp; return *this;}
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    priority_queue(priority_queue&& __q)
+        _NOEXCEPT_(is_nothrow_move_constructible<container_type>::value &&
+                   is_nothrow_move_constructible<value_compare>::value)
+        : c(_VSTD::move(__q.c)), comp(_VSTD::move(__q.comp)) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    priority_queue& operator=(priority_queue&& __q)
+        _NOEXCEPT_(is_nothrow_move_assignable<container_type>::value &&
+                   is_nothrow_move_assignable<value_compare>::value)
+        {c = _VSTD::move(__q.c); comp = _VSTD::move(__q.comp); return *this;}
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit priority_queue(const value_compare& __comp)
+        : c(), comp(__comp) {}
+    _LIBCPP_INLINE_VISIBILITY
+    priority_queue(const value_compare& __comp, const container_type& __c);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    priority_queue(const value_compare& __comp, container_type&& __c);
+#endif
+    template <class _InputIter, class = __enable_if_t<__is_cpp17_input_iterator<_InputIter>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        priority_queue(_InputIter __f, _InputIter __l,
+                       const value_compare& __comp = value_compare());
+    template <class _InputIter, class = __enable_if_t<__is_cpp17_input_iterator<_InputIter>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        priority_queue(_InputIter __f, _InputIter __l,
+                       const value_compare& __comp, const container_type& __c);
+#ifndef _LIBCPP_CXX03_LANG
+    template <class _InputIter, class = __enable_if_t<__is_cpp17_input_iterator<_InputIter>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        priority_queue(_InputIter __f, _InputIter __l,
+                       const value_compare& __comp, container_type&& __c);
+#endif // _LIBCPP_CXX03_LANG
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        explicit priority_queue(const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        priority_queue(const value_compare& __comp, const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        priority_queue(const value_compare& __comp, const container_type& __c,
+                       const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        priority_queue(const priority_queue& __q, const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
+#ifndef _LIBCPP_CXX03_LANG
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        priority_queue(const value_compare& __comp, container_type&& __c,
+                       const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        priority_queue(priority_queue&& __q, const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
+#endif // _LIBCPP_CXX03_LANG
+
+    template <class _InputIter, class _Alloc, class = __enable_if_t<__is_cpp17_input_iterator<_InputIter>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        priority_queue(_InputIter __f, _InputIter __l, const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
+
+    template <class _InputIter, class _Alloc, class = __enable_if_t<__is_cpp17_input_iterator<_InputIter>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        priority_queue(_InputIter __f, _InputIter __l,
+                       const value_compare& __comp, const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
+
+    template <class _InputIter, class _Alloc, class = __enable_if_t<__is_cpp17_input_iterator<_InputIter>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        priority_queue(_InputIter __f, _InputIter __l,
+                       const value_compare& __comp, const container_type& __c, const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
+
+#ifndef _LIBCPP_CXX03_LANG
+    template <class _InputIter, class _Alloc, class = __enable_if_t<__is_cpp17_input_iterator<_InputIter>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        priority_queue(_InputIter __f, _InputIter __l,
+                       const value_compare& __comp, container_type&& __c, const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
+#endif  // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool            empty() const {return c.empty();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type       size() const  {return c.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reference top() const   {return c.front();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void push(const value_type& __v);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    void push(value_type&& __v);
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    void emplace(_Args&&... __args);
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    void pop();
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(priority_queue& __q)
+        _NOEXCEPT_(__is_nothrow_swappable<container_type>::value &&
+                   __is_nothrow_swappable<value_compare>::value);
+
+    _LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI const _Container& __get_container() const { return c; }
+};
+
+#if _LIBCPP_STD_VER >= 17
+template <class _Compare,
+          class _Container,
+          class = enable_if_t<!__is_allocator<_Compare>::value>,
+          class = enable_if_t<!__is_allocator<_Container>::value>
+>
+priority_queue(_Compare, _Container)
+    -> priority_queue<typename _Container::value_type, _Container, _Compare>;
+
+template<class _InputIterator,
+         class _Compare = less<__iter_value_type<_InputIterator>>,
+         class _Container = vector<__iter_value_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<!__is_allocator<_Compare>::value>,
+         class = enable_if_t<!__is_allocator<_Container>::value>
+>
+priority_queue(_InputIterator, _InputIterator, _Compare = _Compare(), _Container = _Container())
+    -> priority_queue<__iter_value_type<_InputIterator>, _Container, _Compare>;
+
+template<class _Compare,
+         class _Container,
+         class _Alloc,
+         class = enable_if_t<!__is_allocator<_Compare>::value>,
+         class = enable_if_t<!__is_allocator<_Container>::value>,
+         class = enable_if_t<uses_allocator<_Container, _Alloc>::value>
+>
+priority_queue(_Compare, _Container, _Alloc)
+    -> priority_queue<typename _Container::value_type, _Container, _Compare>;
+
+template<class _InputIterator, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>
+>
+priority_queue(_InputIterator, _InputIterator, _Allocator)
+    -> priority_queue<__iter_value_type<_InputIterator>,
+                      vector<__iter_value_type<_InputIterator>, _Allocator>,
+                      less<__iter_value_type<_InputIterator>>>;
+
+template<class _InputIterator, class _Compare, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<!__is_allocator<_Compare>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>
+>
+priority_queue(_InputIterator, _InputIterator, _Compare, _Allocator)
+    -> priority_queue<__iter_value_type<_InputIterator>,
+                      vector<__iter_value_type<_InputIterator>, _Allocator>, _Compare>;
+
+template<class _InputIterator, class _Compare, class _Container, class _Alloc,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<!__is_allocator<_Compare>::value>,
+         class = enable_if_t<!__is_allocator<_Container>::value>,
+         class = enable_if_t<uses_allocator<_Container, _Alloc>::value>
+>
+priority_queue(_InputIterator, _InputIterator, _Compare, _Container, _Alloc)
+    -> priority_queue<typename _Container::value_type, _Container, _Compare>;
+#endif
+
+template <class _Tp, class _Container, class _Compare>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(const _Compare& __comp,
+                                                          const container_type& __c)
+    : c(__c),
+      comp(__comp)
+{
+    _VSTD::make_heap(c.begin(), c.end(), comp);
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Container, class _Compare>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(const value_compare& __comp,
+                                                          container_type&& __c)
+    : c(_VSTD::move(__c)),
+      comp(__comp)
+{
+    _VSTD::make_heap(c.begin(), c.end(), comp);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Container, class _Compare>
+template <class _InputIter, class>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(_InputIter __f, _InputIter __l,
+                                                          const value_compare& __comp)
+    : c(__f, __l),
+      comp(__comp)
+{
+    _VSTD::make_heap(c.begin(), c.end(), comp);
+}
+
+template <class _Tp, class _Container, class _Compare>
+template <class _InputIter, class>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(_InputIter __f, _InputIter __l,
+                                                          const value_compare& __comp,
+                                                          const container_type& __c)
+    : c(__c),
+      comp(__comp)
+{
+    c.insert(c.end(), __f, __l);
+    _VSTD::make_heap(c.begin(), c.end(), comp);
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Container, class _Compare>
+template <class _InputIter, class>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(_InputIter __f, _InputIter __l,
+                                                          const value_compare& __comp,
+                                                          container_type&& __c)
+    : c(_VSTD::move(__c)),
+      comp(__comp)
+{
+    c.insert(c.end(), __f, __l);
+    _VSTD::make_heap(c.begin(), c.end(), comp);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Container, class _Compare>
+template <class _Alloc>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
+    : c(__a)
+{
+}
+
+template <class _Tp, class _Container, class _Compare>
+template <class _Alloc>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(const value_compare& __comp,
+                                                          const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
+    : c(__a),
+      comp(__comp)
+{
+}
+
+template <class _Tp, class _Container, class _Compare>
+template <class _Alloc>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(const value_compare& __comp,
+                                                          const container_type& __c,
+                                                          const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
+    : c(__c, __a),
+      comp(__comp)
+{
+    _VSTD::make_heap(c.begin(), c.end(), comp);
+}
+
+template <class _Tp, class _Container, class _Compare>
+template <class _Alloc>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(const priority_queue& __q,
+                                                          const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
+    : c(__q.c, __a),
+      comp(__q.comp)
+{
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Container, class _Compare>
+template <class _Alloc>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(const value_compare& __comp,
+                                                          container_type&& __c,
+                                                          const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
+    : c(_VSTD::move(__c), __a),
+      comp(__comp)
+{
+    _VSTD::make_heap(c.begin(), c.end(), comp);
+}
+
+template <class _Tp, class _Container, class _Compare>
+template <class _Alloc>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(priority_queue&& __q,
+                                                          const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
+    : c(_VSTD::move(__q.c), __a),
+      comp(_VSTD::move(__q.comp))
+{
+}
+
+#endif  // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Container, class _Compare>
+template <class _InputIter, class _Alloc, class>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(
+        _InputIter __f, _InputIter __l, const _Alloc& __a,
+        __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
+    : c(__f, __l, __a),
+      comp()
+{
+    _VSTD::make_heap(c.begin(), c.end(), comp);
+}
+
+template <class _Tp, class _Container, class _Compare>
+template <class _InputIter, class _Alloc, class>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(
+        _InputIter __f, _InputIter __l,
+        const value_compare& __comp, const _Alloc& __a,
+        __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
+    : c(__f, __l, __a),
+      comp(__comp)
+{
+    _VSTD::make_heap(c.begin(), c.end(), comp);
+}
+
+template <class _Tp, class _Container, class _Compare>
+template <class _InputIter, class _Alloc, class>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(
+        _InputIter __f, _InputIter __l,
+        const value_compare& __comp, const container_type& __c, const _Alloc& __a,
+        __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
+    : c(__c, __a),
+      comp(__comp)
+{
+    c.insert(c.end(), __f, __l);
+    _VSTD::make_heap(c.begin(), c.end(), comp);
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Tp, class _Container, class _Compare>
+template <class _InputIter, class _Alloc, class>
+inline
+priority_queue<_Tp, _Container, _Compare>::priority_queue(
+        _InputIter __f, _InputIter __l, const value_compare& __comp,
+        container_type&& __c, const _Alloc& __a,
+        __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
+    : c(_VSTD::move(__c), __a),
+      comp(__comp)
+{
+    c.insert(c.end(), __f, __l);
+    _VSTD::make_heap(c.begin(), c.end(), comp);
+}
+#endif  // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Container, class _Compare>
+inline
+void
+priority_queue<_Tp, _Container, _Compare>::push(const value_type& __v)
+{
+    c.push_back(__v);
+    _VSTD::push_heap(c.begin(), c.end(), comp);
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Container, class _Compare>
+inline
+void
+priority_queue<_Tp, _Container, _Compare>::push(value_type&& __v)
+{
+    c.push_back(_VSTD::move(__v));
+    _VSTD::push_heap(c.begin(), c.end(), comp);
+}
+
+template <class _Tp, class _Container, class _Compare>
+template <class... _Args>
+inline
+void
+priority_queue<_Tp, _Container, _Compare>::emplace(_Args&&... __args)
+{
+    c.emplace_back(_VSTD::forward<_Args>(__args)...);
+    _VSTD::push_heap(c.begin(), c.end(), comp);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Container, class _Compare>
+inline
+void
+priority_queue<_Tp, _Container, _Compare>::pop()
+{
+    _VSTD::pop_heap(c.begin(), c.end(), comp);
+    c.pop_back();
+}
+
+template <class _Tp, class _Container, class _Compare>
+inline
+void
+priority_queue<_Tp, _Container, _Compare>::swap(priority_queue& __q)
+        _NOEXCEPT_(__is_nothrow_swappable<container_type>::value &&
+                   __is_nothrow_swappable<value_compare>::value)
+{
+    using _VSTD::swap;
+    swap(c, __q.c);
+    swap(comp, __q.comp);
+}
+
+template <class _Tp, class _Container, class _Compare>
+inline _LIBCPP_INLINE_VISIBILITY
+__enable_if_t<
+    __is_swappable<_Container>::value && __is_swappable<_Compare>::value,
+    void
+>
+swap(priority_queue<_Tp, _Container, _Compare>& __x,
+     priority_queue<_Tp, _Container, _Compare>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+template <class _Tp, class _Container, class _Compare, class _Alloc>
+struct _LIBCPP_TEMPLATE_VIS uses_allocator<priority_queue<_Tp, _Container, _Compare>, _Alloc>
+    : public uses_allocator<_Container, _Alloc>
+{
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <functional>
+#endif
+
+#endif // _LIBCPP_QUEUE
diff --git a/app/src/main/cpp/libcxx/include/random b/app/src/main/cpp/libcxx/include/random
new file mode 100644
index 0000000..5fe4906
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/random
@@ -0,0 +1,1745 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_RANDOM
+#define _LIBCPP_RANDOM
+
+/*
+    random synopsis
+
+#include <initializer_list>
+
+namespace std
+{
+// [rand.req.urng], uniform random bit generator requirements
+template<class G>
+concept uniform_random_bit_generator = see below; // C++20
+
+// Engines
+
+template <class UIntType, UIntType a, UIntType c, UIntType m>
+class linear_congruential_engine
+{
+public:
+    // types
+    typedef UIntType result_type;
+
+    // engine characteristics
+    static constexpr result_type multiplier = a;
+    static constexpr result_type increment = c;
+    static constexpr result_type modulus = m;
+    static constexpr result_type min() { return c == 0u ? 1u: 0u;}
+    static constexpr result_type max() { return m - 1u;}
+    static constexpr result_type default_seed = 1u;
+
+    // constructors and seeding functions
+    explicit linear_congruential_engine(result_type s = default_seed);         // before C++20
+    linear_congruential_engine() : linear_congruential_engine(default_seed) {} // C++20
+    explicit linear_congruential_engine(result_type s);                        // C++20
+    template<class Sseq> explicit linear_congruential_engine(Sseq& q);
+    void seed(result_type s = default_seed);
+    template<class Sseq> void seed(Sseq& q);
+
+    // generating functions
+    result_type operator()();
+    void discard(unsigned long long z);
+};
+
+template <class UIntType, UIntType a, UIntType c, UIntType m>
+bool
+operator==(const linear_congruential_engine<UIntType, a, c, m>& x,
+           const linear_congruential_engine<UIntType, a, c, m>& y);
+
+template <class UIntType, UIntType a, UIntType c, UIntType m>
+bool
+operator!=(const linear_congruential_engine<UIntType, a, c, m>& x,
+           const linear_congruential_engine<UIntType, a, c, m>& y);
+
+template <class charT, class traits,
+          class UIntType, UIntType a, UIntType c, UIntType m>
+basic_ostream<charT, traits>&
+operator<<(basic_ostream<charT, traits>& os,
+           const linear_congruential_engine<UIntType, a, c, m>& x);
+
+template <class charT, class traits,
+          class UIntType, UIntType a, UIntType c, UIntType m>
+basic_istream<charT, traits>&
+operator>>(basic_istream<charT, traits>& is,
+           linear_congruential_engine<UIntType, a, c, m>& x);
+
+template <class UIntType, size_t w, size_t n, size_t m, size_t r,
+          UIntType a, size_t u, UIntType d, size_t s,
+          UIntType b, size_t t, UIntType c, size_t l, UIntType f>
+class mersenne_twister_engine
+{
+public:
+    // types
+    typedef UIntType result_type;
+
+    // engine characteristics
+    static constexpr size_t word_size = w;
+    static constexpr size_t state_size = n;
+    static constexpr size_t shift_size = m;
+    static constexpr size_t mask_bits = r;
+    static constexpr result_type xor_mask = a;
+    static constexpr size_t tempering_u = u;
+    static constexpr result_type tempering_d = d;
+    static constexpr size_t tempering_s = s;
+    static constexpr result_type tempering_b = b;
+    static constexpr size_t tempering_t = t;
+    static constexpr result_type tempering_c = c;
+    static constexpr size_t tempering_l = l;
+    static constexpr result_type initialization_multiplier = f;
+    static constexpr result_type min () { return 0; }
+    static constexpr result_type max() { return 2^w - 1; }
+    static constexpr result_type default_seed = 5489u;
+
+    // constructors and seeding functions
+    explicit mersenne_twister_engine(result_type s = default_seed);      // before C++20
+    mersenne_twister_engine() : mersenne_twister_engine(default_seed) {} // C++20
+    explicit mersenne_twister_engine(result_type s);                     // C++20
+    template<class Sseq> explicit mersenne_twister_engine(Sseq& q);
+    void seed(result_type value = default_seed);
+    template<class Sseq> void seed(Sseq& q);
+
+    // generating functions
+    result_type operator()();
+    void discard(unsigned long long z);
+};
+
+template <class UIntType, size_t w, size_t n, size_t m, size_t r,
+          UIntType a, size_t u, UIntType d, size_t s,
+          UIntType b, size_t t, UIntType c, size_t l, UIntType f>
+bool
+operator==(
+    const mersenne_twister_engine<UIntType, w, n, m, r, a, u, d, s, b, t, c, l, f>& x,
+    const mersenne_twister_engine<UIntType, w, n, m, r, a, u, d, s, b, t, c, l, f>& y);
+
+template <class UIntType, size_t w, size_t n, size_t m, size_t r,
+          UIntType a, size_t u, UIntType d, size_t s,
+          UIntType b, size_t t, UIntType c, size_t l, UIntType f>
+bool
+operator!=(
+    const mersenne_twister_engine<UIntType, w, n, m, r, a, u, d, s, b, t, c, l, f>& x,
+    const mersenne_twister_engine<UIntType, w, n, m, r, a, u, d, s, b, t, c, l, f>& y);
+
+template <class charT, class traits,
+          class UIntType, size_t w, size_t n, size_t m, size_t r,
+          UIntType a, size_t u, UIntType d, size_t s,
+          UIntType b, size_t t, UIntType c, size_t l, UIntType f>
+basic_ostream<charT, traits>&
+operator<<(basic_ostream<charT, traits>& os,
+           const mersenne_twister_engine<UIntType, w, n, m, r, a, u, d, s, b, t, c, l, f>& x);
+
+template <class charT, class traits,
+          class UIntType, size_t w, size_t n, size_t m, size_t r,
+          UIntType a, size_t u, UIntType d, size_t s,
+          UIntType b, size_t t, UIntType c, size_t l, UIntType f>
+basic_istream<charT, traits>&
+operator>>(basic_istream<charT, traits>& is,
+           mersenne_twister_engine<UIntType, w, n, m, r, a, u, d, s, b, t, c, l, f>& x);
+
+template<class UIntType, size_t w, size_t s, size_t r>
+class subtract_with_carry_engine
+{
+public:
+    // types
+    typedef UIntType result_type;
+
+    // engine characteristics
+    static constexpr size_t word_size = w;
+    static constexpr size_t short_lag = s;
+    static constexpr size_t long_lag = r;
+    static constexpr result_type min() { return 0; }
+    static constexpr result_type max() { return m-1; }
+    static constexpr result_type default_seed = 19780503u;
+
+    // constructors and seeding functions
+    explicit subtract_with_carry_engine(result_type value = default_seed);     // before C++20
+    subtract_with_carry_engine() : subtract_with_carry_engine(default_seed) {} // C++20
+    explicit subtract_with_carry_engine(result_type value);                    // C++20
+    template<class Sseq> explicit subtract_with_carry_engine(Sseq& q);
+    void seed(result_type value = default_seed);
+    template<class Sseq> void seed(Sseq& q);
+
+    // generating functions
+    result_type operator()();
+    void discard(unsigned long long z);
+};
+
+template<class UIntType, size_t w, size_t s, size_t r>
+bool
+operator==(
+    const subtract_with_carry_engine<UIntType, w, s, r>& x,
+    const subtract_with_carry_engine<UIntType, w, s, r>& y);
+
+template<class UIntType, size_t w, size_t s, size_t r>
+bool
+operator!=(
+    const subtract_with_carry_engine<UIntType, w, s, r>& x,
+    const subtract_with_carry_engine<UIntType, w, s, r>& y);
+
+template <class charT, class traits,
+          class UIntType, size_t w, size_t s, size_t r>
+basic_ostream<charT, traits>&
+operator<<(basic_ostream<charT, traits>& os,
+           const subtract_with_carry_engine<UIntType, w, s, r>& x);
+
+template <class charT, class traits,
+          class UIntType, size_t w, size_t s, size_t r>
+basic_istream<charT, traits>&
+operator>>(basic_istream<charT, traits>& is,
+           subtract_with_carry_engine<UIntType, w, s, r>& x);
+
+template<class Engine, size_t p, size_t r>
+class discard_block_engine
+{
+public:
+    // types
+    typedef typename Engine::result_type result_type;
+
+    // engine characteristics
+    static constexpr size_t block_size = p;
+    static constexpr size_t used_block = r;
+    static constexpr result_type min() { return Engine::min(); }
+    static constexpr result_type max() { return Engine::max(); }
+
+    // constructors and seeding functions
+    discard_block_engine();
+    explicit discard_block_engine(const Engine& e);
+    explicit discard_block_engine(Engine&& e);
+    explicit discard_block_engine(result_type s);
+    template<class Sseq> explicit discard_block_engine(Sseq& q);
+    void seed();
+    void seed(result_type s);
+    template<class Sseq> void seed(Sseq& q);
+
+    // generating functions
+    result_type operator()();
+    void discard(unsigned long long z);
+
+    // property functions
+    const Engine& base() const noexcept;
+};
+
+template<class Engine, size_t p, size_t r>
+bool
+operator==(
+    const discard_block_engine<Engine, p, r>& x,
+    const discard_block_engine<Engine, p, r>& y);
+
+template<class Engine, size_t p, size_t r>
+bool
+operator!=(
+    const discard_block_engine<Engine, p, r>& x,
+    const discard_block_engine<Engine, p, r>& y);
+
+template <class charT, class traits,
+          class Engine, size_t p, size_t r>
+basic_ostream<charT, traits>&
+operator<<(basic_ostream<charT, traits>& os,
+           const discard_block_engine<Engine, p, r>& x);
+
+template <class charT, class traits,
+          class Engine, size_t p, size_t r>
+basic_istream<charT, traits>&
+operator>>(basic_istream<charT, traits>& is,
+           discard_block_engine<Engine, p, r>& x);
+
+template<class Engine, size_t w, class UIntType>
+class independent_bits_engine
+{
+public:
+    // types
+    typedef UIntType result_type;
+
+    // engine characteristics
+    static constexpr result_type min() { return 0; }
+    static constexpr result_type max() { return 2^w - 1; }
+
+    // constructors and seeding functions
+    independent_bits_engine();
+    explicit independent_bits_engine(const Engine& e);
+    explicit independent_bits_engine(Engine&& e);
+    explicit independent_bits_engine(result_type s);
+    template<class Sseq> explicit independent_bits_engine(Sseq& q);
+    void seed();
+    void seed(result_type s);
+    template<class Sseq> void seed(Sseq& q);
+
+    // generating functions
+    result_type operator()(); void discard(unsigned long long z);
+
+    // property functions
+    const Engine& base() const noexcept;
+};
+
+template<class Engine, size_t w, class UIntType>
+bool
+operator==(
+    const independent_bits_engine<Engine, w, UIntType>& x,
+    const independent_bits_engine<Engine, w, UIntType>& y);
+
+template<class Engine, size_t w, class UIntType>
+bool
+operator!=(
+    const independent_bits_engine<Engine, w, UIntType>& x,
+    const independent_bits_engine<Engine, w, UIntType>& y);
+
+template <class charT, class traits,
+          class Engine, size_t w, class UIntType>
+basic_ostream<charT, traits>&
+operator<<(basic_ostream<charT, traits>& os,
+           const independent_bits_engine<Engine, w, UIntType>& x);
+
+template <class charT, class traits,
+          class Engine, size_t w, class UIntType>
+basic_istream<charT, traits>&
+operator>>(basic_istream<charT, traits>& is,
+           independent_bits_engine<Engine, w, UIntType>& x);
+
+template<class Engine, size_t k>
+class shuffle_order_engine
+{
+public:
+    // types
+    typedef typename Engine::result_type result_type;
+
+    // engine characteristics
+    static constexpr size_t table_size = k;
+    static constexpr result_type min() { return Engine::min; }
+    static constexpr result_type max() { return Engine::max; }
+
+    // constructors and seeding functions
+    shuffle_order_engine();
+    explicit shuffle_order_engine(const Engine& e);
+    explicit shuffle_order_engine(Engine&& e);
+    explicit shuffle_order_engine(result_type s);
+    template<class Sseq> explicit shuffle_order_engine(Sseq& q);
+    void seed();
+    void seed(result_type s);
+    template<class Sseq> void seed(Sseq& q);
+
+    // generating functions
+    result_type operator()();
+    void discard(unsigned long long z);
+
+    // property functions
+    const Engine& base() const noexcept;
+};
+
+template<class Engine, size_t k>
+bool
+operator==(
+    const shuffle_order_engine<Engine, k>& x,
+    const shuffle_order_engine<Engine, k>& y);
+
+template<class Engine, size_t k>
+bool
+operator!=(
+    const shuffle_order_engine<Engine, k>& x,
+    const shuffle_order_engine<Engine, k>& y);
+
+template <class charT, class traits,
+          class Engine, size_t k>
+basic_ostream<charT, traits>&
+operator<<(basic_ostream<charT, traits>& os,
+           const shuffle_order_engine<Engine, k>& x);
+
+template <class charT, class traits,
+          class Engine, size_t k>
+basic_istream<charT, traits>&
+operator>>(basic_istream<charT, traits>& is,
+           shuffle_order_engine<Engine, k>& x);
+
+typedef linear_congruential_engine<uint_fast32_t, 16807, 0, 2147483647>
+                                                                   minstd_rand0;
+typedef linear_congruential_engine<uint_fast32_t, 48271, 0, 2147483647>
+                                                                    minstd_rand;
+typedef mersenne_twister_engine<uint_fast32_t, 32, 624, 397, 31,
+                                0x9908b0df,
+                                11, 0xffffffff,
+                                7,  0x9d2c5680,
+                                15, 0xefc60000,
+                                18, 1812433253>                         mt19937;
+typedef mersenne_twister_engine<uint_fast64_t, 64, 312, 156, 31,
+                                0xb5026f5aa96619e9,
+                                29, 0x5555555555555555,
+                                17, 0x71d67fffeda60000,
+                                37, 0xfff7eee000000000,
+                                43, 6364136223846793005>             mt19937_64;
+typedef subtract_with_carry_engine<uint_fast32_t, 24, 10, 24>     ranlux24_base;
+typedef subtract_with_carry_engine<uint_fast64_t, 48,  5, 12>     ranlux48_base;
+typedef discard_block_engine<ranlux24_base, 223, 23>                   ranlux24;
+typedef discard_block_engine<ranlux48_base, 389, 11>                   ranlux48;
+typedef shuffle_order_engine<minstd_rand0, 256>                         knuth_b;
+typedef minstd_rand                                       default_random_engine;
+
+// Generators
+
+class random_device
+{
+public:
+    // types
+    typedef unsigned int result_type;
+
+    // generator characteristics
+    static constexpr result_type min() { return numeric_limits<result_type>::min(); }
+    static constexpr result_type max() { return numeric_limits<result_type>::max(); }
+
+    // constructors
+    explicit random_device(const string& token = implementation-defined); // before C++20
+    random_device() : random_device(implementation-defined) {}            // C++20
+    explicit random_device(const string& token);                          // C++20
+
+    // generating functions
+    result_type operator()();
+
+    // property functions
+    double entropy() const noexcept;
+
+    // no copy functions
+    random_device(const random_device& ) = delete;
+    void operator=(const random_device& ) = delete;
+};
+
+// Utilities
+
+class seed_seq
+{
+public:
+    // types
+    typedef uint_least32_t result_type;
+
+    // constructors
+    seed_seq();
+    template<class T>
+        seed_seq(initializer_list<T> il);
+    template<class InputIterator>
+        seed_seq(InputIterator begin, InputIterator end);
+
+    // generating functions
+    template<class RandomAccessIterator>
+        void generate(RandomAccessIterator begin, RandomAccessIterator end);
+
+    // property functions
+    size_t size() const;
+    template<class OutputIterator>
+        void param(OutputIterator dest) const;
+
+    // no copy functions
+    seed_seq(const seed_seq&) = delete;
+    void operator=(const seed_seq& ) = delete;
+};
+
+template<class RealType, size_t bits, class URNG>
+    RealType generate_canonical(URNG& g);
+
+// Distributions
+
+template<class IntType = int>
+class uniform_int_distribution
+{
+public:
+    // types
+    typedef IntType result_type;
+
+    class param_type
+    {
+    public:
+        typedef uniform_int_distribution distribution_type;
+
+        explicit param_type(IntType a = 0,
+                                    IntType b = numeric_limits<IntType>::max());
+
+        result_type a() const;
+        result_type b() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructors and reset functions
+    explicit uniform_int_distribution(IntType a = 0,
+                                      IntType b = numeric_limits<IntType>::max()); // before C++20
+    uniform_int_distribution() : uniform_int_distribution(0) {}                    // C++20
+    explicit uniform_int_distribution(IntType a,
+                                      IntType b = numeric_limits<IntType>::max()); // C++20
+    explicit uniform_int_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type a() const;
+    result_type b() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const uniform_int_distribution& x,
+                           const uniform_int_distribution& y);
+    friend bool operator!=(const uniform_int_distribution& x,
+                           const uniform_int_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const uniform_int_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               uniform_int_distribution& x);
+};
+
+template<class RealType = double>
+class uniform_real_distribution
+{
+public:
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef uniform_real_distribution distribution_type;
+
+        explicit param_type(RealType a = 0,
+                            RealType b = 1);
+
+        result_type a() const;
+        result_type b() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructors and reset functions
+    explicit uniform_real_distribution(RealType a = 0.0, RealType b = 1.0); // before C++20
+    uniform_real_distribution() : uniform_real_distribution(0.0) {}         // C++20
+    explicit uniform_real_distribution(RealType a, RealType b = 1.0);       // C++20
+    explicit uniform_real_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type a() const;
+    result_type b() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const uniform_real_distribution& x,
+                           const uniform_real_distribution& y);
+    friend bool operator!=(const uniform_real_distribution& x,
+                           const uniform_real_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const uniform_real_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               uniform_real_distribution& x);
+};
+
+class bernoulli_distribution
+{
+public:
+    // types
+    typedef bool result_type;
+
+    class param_type
+    {
+    public:
+        typedef bernoulli_distribution distribution_type;
+
+        explicit param_type(double p = 0.5);
+
+        double p() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructors and reset functions
+    explicit bernoulli_distribution(double p = 0.5);          // before C++20
+    bernoulli_distribution() : bernoulli_distribution(0.5) {} // C++20
+    explicit bernoulli_distribution(double p);                // C++20
+    explicit bernoulli_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    double p() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const bernoulli_distribution& x,
+                           const bernoulli_distribution& y);
+    friend bool operator!=(const bernoulli_distribution& x,
+                           const bernoulli_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const bernoulli_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               bernoulli_distribution& x);
+};
+
+template<class IntType = int>
+class binomial_distribution
+{
+public:
+    // types
+    typedef IntType result_type;
+
+    class param_type
+    {
+    public:
+        typedef binomial_distribution distribution_type;
+
+        explicit param_type(IntType t = 1, double p = 0.5);
+
+        IntType t() const;
+        double p() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructors and reset functions
+    explicit binomial_distribution(IntType t = 1, double p = 0.5); // before C++20
+    binomial_distribution() : binomial_distribution(1) {}          // C++20
+    explicit binomial_distribution(IntType t, double p = 0.5);     // C++20
+    explicit binomial_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    IntType t() const;
+    double p() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const binomial_distribution& x,
+                           const binomial_distribution& y);
+    friend bool operator!=(const binomial_distribution& x,
+                           const binomial_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const binomial_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               binomial_distribution& x);
+};
+
+template<class IntType = int>
+class geometric_distribution
+{
+public:
+    // types
+    typedef IntType result_type;
+
+    class param_type
+    {
+    public:
+        typedef geometric_distribution distribution_type;
+
+        explicit param_type(double p = 0.5);
+
+        double p() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructors and reset functions
+    explicit geometric_distribution(double p = 0.5);          // before C++20
+    geometric_distribution() : geometric_distribution(0.5) {} // C++20
+    explicit geometric_distribution(double p);                // C++20
+    explicit geometric_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    double p() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const geometric_distribution& x,
+                           const geometric_distribution& y);
+    friend bool operator!=(const geometric_distribution& x,
+                           const geometric_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const geometric_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               geometric_distribution& x);
+};
+
+template<class IntType = int>
+class negative_binomial_distribution
+{
+public:
+    // types
+    typedef IntType result_type;
+
+    class param_type
+    {
+    public:
+        typedef negative_binomial_distribution distribution_type;
+
+        explicit param_type(result_type k = 1, double p = 0.5);
+
+        result_type k() const;
+        double p() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructor and reset functions
+    explicit negative_binomial_distribution(IntType k = 1, double p = 0.5); // before C++20
+    negative_binomial_distribution() : negative_binomial_distribution(1) {} // C++20
+    explicit negative_binomial_distribution(IntType k, double p = 0.5);     // C++20
+    explicit negative_binomial_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type k() const;
+    double p() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const negative_binomial_distribution& x,
+                           const negative_binomial_distribution& y);
+    friend bool operator!=(const negative_binomial_distribution& x,
+                           const negative_binomial_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const negative_binomial_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               negative_binomial_distribution& x);
+};
+
+template<class IntType = int>
+class poisson_distribution
+{
+public:
+    // types
+    typedef IntType result_type;
+
+    class param_type
+    {
+    public:
+        typedef poisson_distribution distribution_type;
+
+        explicit param_type(double mean = 1.0);
+
+        double mean() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructors and reset functions
+    explicit poisson_distribution(double mean = 1.0);     // before C++20
+    poisson_distribution() : poisson_distribution(1.0) {} // C++20
+    explicit poisson_distribution(double mean);           // C++20
+    explicit poisson_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    double mean() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const poisson_distribution& x,
+                           const poisson_distribution& y);
+    friend bool operator!=(const poisson_distribution& x,
+                           const poisson_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const poisson_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               poisson_distribution& x);
+};
+
+template<class RealType = double>
+class exponential_distribution
+{
+public:
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef exponential_distribution distribution_type;
+
+        explicit param_type(result_type lambda = 1.0);
+
+        result_type lambda() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructors and reset functions
+    explicit exponential_distribution(RealType lambda = 1.0);     // before C++20
+    exponential_distribution() : exponential_distribution(1.0) {} // C++20
+    explicit exponential_distribution(RealType lambda);           // C++20
+    explicit exponential_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type lambda() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const exponential_distribution& x,
+                           const exponential_distribution& y);
+    friend bool operator!=(const exponential_distribution& x,
+                           const exponential_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const exponential_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               exponential_distribution& x);
+};
+
+template<class RealType = double>
+class gamma_distribution
+{
+public:
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef gamma_distribution distribution_type;
+
+        explicit param_type(result_type alpha = 1, result_type beta = 1);
+
+        result_type alpha() const;
+        result_type beta() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructors and reset functions
+    explicit gamma_distribution(RealType alpha = 0.0, RealType beta = 1.0); // before C++20
+    gamma_distribution() : gamma_distribution(0.0) {}                       // C++20
+    explicit gamma_distribution(RealType alpha, RealType beta = 1.0);       // C++20
+    explicit gamma_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type alpha() const;
+    result_type beta() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const gamma_distribution& x,
+                           const gamma_distribution& y);
+    friend bool operator!=(const gamma_distribution& x,
+                           const gamma_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const gamma_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               gamma_distribution& x);
+};
+
+template<class RealType = double>
+class weibull_distribution
+{
+public:
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef weibull_distribution distribution_type;
+
+        explicit param_type(result_type alpha = 1, result_type beta = 1);
+
+        result_type a() const;
+        result_type b() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructor and reset functions
+    explicit weibull_distribution(RealType a = 1.0, RealType b = 1.0); // before C++20
+    weibull_distribution() : weibull_distribution(1.0) {}              // C++20
+    explicit weibull_distribution(RealType a, RealType b = 1.0);       // C++20
+    explicit weibull_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type a() const;
+    result_type b() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const weibull_distribution& x,
+                           const weibull_distribution& y);
+    friend bool operator!=(const weibull_distribution& x,
+                           const weibull_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const weibull_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               weibull_distribution& x);
+};
+
+template<class RealType = double>
+class extreme_value_distribution
+{
+public:
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef extreme_value_distribution distribution_type;
+
+        explicit param_type(result_type a = 0, result_type b = 1);
+
+        result_type a() const;
+        result_type b() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructor and reset functions
+    explicit extreme_value_distribution(RealType a = 0.0, RealType b = 1.0); // before C++20
+    extreme_value_distribution() : extreme_value_distribution(0.0) {}        // C++20
+    explicit extreme_value_distribution(RealType a, RealType b = 1.0);       // C++20
+    explicit extreme_value_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type a() const;
+    result_type b() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const extreme_value_distribution& x,
+                           const extreme_value_distribution& y);
+    friend bool operator!=(const extreme_value_distribution& x,
+                           const extreme_value_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const extreme_value_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               extreme_value_distribution& x);
+};
+
+template<class RealType = double>
+class normal_distribution
+{
+public:
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef normal_distribution distribution_type;
+
+        explicit param_type(result_type mean = 0, result_type stddev = 1);
+
+        result_type mean() const;
+        result_type stddev() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructors and reset functions
+    explicit normal_distribution(RealType mean = 0.0, RealType stddev = 1.0); // before C++20
+    normal_distribution() : normal_distribution(0.0) {}                       // C++20
+    explicit normal_distribution(RealType mean, RealType stddev = 1.0);       // C++20
+    explicit normal_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type mean() const;
+    result_type stddev() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const normal_distribution& x,
+                           const normal_distribution& y);
+    friend bool operator!=(const normal_distribution& x,
+                           const normal_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const normal_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               normal_distribution& x);
+};
+
+template<class RealType = double>
+class lognormal_distribution
+{
+public:
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef lognormal_distribution distribution_type;
+
+        explicit param_type(result_type m = 0, result_type s = 1);
+
+        result_type m() const;
+        result_type s() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructor and reset functions
+    explicit lognormal_distribution(RealType mean = 0.0, RealType stddev = 1.0); // before C++20
+    lognormal_distribution() : lognormal_distribution(0.0) {}                    // C++20
+    explicit lognormal_distribution(RealType mean, RealType stddev = 1.0);       // C++20
+    explicit lognormal_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type m() const;
+    result_type s() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const lognormal_distribution& x,
+                           const lognormal_distribution& y);
+    friend bool operator!=(const lognormal_distribution& x,
+                           const lognormal_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const lognormal_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               lognormal_distribution& x);
+};
+
+template<class RealType = double>
+class chi_squared_distribution
+{
+public:
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef chi_squared_distribution distribution_type;
+
+        explicit param_type(result_type n = 1);
+
+        result_type n() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructor and reset functions
+    explicit chi_squared_distribution(RealType n = 1.0);          // before C++20
+    chi_squared_distribution() : chi_squared_distribution(1.0) {} // C++20
+    explicit chi_squared_distribution(RealType n);                // C++20
+    explicit chi_squared_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type n() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const chi_squared_distribution& x,
+                           const chi_squared_distribution& y);
+    friend bool operator!=(const chi_squared_distribution& x,
+                           const chi_squared_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const chi_squared_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               chi_squared_distribution& x);
+};
+
+template<class RealType = double>
+class cauchy_distribution
+{
+public:
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef cauchy_distribution distribution_type;
+
+        explicit param_type(result_type a = 0, result_type b = 1);
+
+        result_type a() const;
+        result_type b() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructor and reset functions
+    explicit cauchy_distribution(RealType a = 0.0, RealType b = 1.0); // before C++20
+    cauchy_distribution() : cauchy_distribution(0.0) {}               // C++20
+    explicit cauchy_distribution(RealType a, RealType b = 1.0);       // C++20
+    explicit cauchy_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type a() const;
+    result_type b() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const cauchy_distribution& x,
+                           const cauchy_distribution& y);
+    friend bool operator!=(const cauchy_distribution& x,
+                           const cauchy_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const cauchy_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               cauchy_distribution& x);
+};
+
+template<class RealType = double>
+class fisher_f_distribution
+{
+public:
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef fisher_f_distribution distribution_type;
+
+        explicit param_type(result_type m = 1, result_type n = 1);
+
+        result_type m() const;
+        result_type n() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructor and reset functions
+    explicit fisher_f_distribution(RealType m = 1.0, RealType n = 1.0); // before C++20
+    fisher_f_distribution() : fisher_f_distribution(1.0) {}             // C++20
+    explicit fisher_f_distribution(RealType m, RealType n = 1.0);       // C++20
+    explicit fisher_f_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type m() const;
+    result_type n() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const fisher_f_distribution& x,
+                           const fisher_f_distribution& y);
+    friend bool operator!=(const fisher_f_distribution& x,
+                           const fisher_f_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const fisher_f_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               fisher_f_distribution& x);
+};
+
+template<class RealType = double>
+class student_t_distribution
+{
+public:
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef student_t_distribution distribution_type;
+
+        explicit param_type(result_type n = 1);
+
+        result_type n() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructor and reset functions
+    explicit student_t_distribution(RealType n = 1.0);        // before C++20
+    student_t_distribution() : student_t_distribution(1.0) {} // C++20
+    explicit student_t_distribution(RealType n);              // C++20
+    explicit student_t_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    result_type n() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const student_t_distribution& x,
+                           const student_t_distribution& y);
+    friend bool operator!=(const student_t_distribution& x,
+                           const student_t_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const student_t_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               student_t_distribution& x);
+};
+
+template<class IntType = int>
+class discrete_distribution
+{
+public:
+    // types
+    typedef IntType result_type;
+
+    class param_type
+    {
+    public:
+        typedef discrete_distribution distribution_type;
+
+        param_type();
+        template<class InputIterator>
+            param_type(InputIterator firstW, InputIterator lastW);
+        param_type(initializer_list<double> wl);
+        template<class UnaryOperation>
+            param_type(size_t nw, double xmin, double xmax, UnaryOperation fw);
+
+        vector<double> probabilities() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructor and reset functions
+    discrete_distribution();
+    template<class InputIterator>
+        discrete_distribution(InputIterator firstW, InputIterator lastW);
+    discrete_distribution(initializer_list<double> wl);
+    template<class UnaryOperation>
+        discrete_distribution(size_t nw, double xmin, double xmax,
+                              UnaryOperation fw);
+    explicit discrete_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    vector<double> probabilities() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const discrete_distribution& x,
+                           const discrete_distribution& y);
+    friend bool operator!=(const discrete_distribution& x,
+                           const discrete_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const discrete_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               discrete_distribution& x);
+};
+
+template<class RealType = double>
+class piecewise_constant_distribution
+{
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef piecewise_constant_distribution distribution_type;
+
+        param_type();
+        template<class InputIteratorB, class InputIteratorW>
+            param_type(InputIteratorB firstB, InputIteratorB lastB,
+                       InputIteratorW firstW);
+        template<class UnaryOperation>
+            param_type(initializer_list<result_type> bl, UnaryOperation fw);
+        template<class UnaryOperation>
+            param_type(size_t nw, result_type xmin, result_type xmax,
+                       UnaryOperation fw);
+
+        vector<result_type> intervals() const;
+        vector<result_type> densities() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructor and reset functions
+    piecewise_constant_distribution();
+    template<class InputIteratorB, class InputIteratorW>
+        piecewise_constant_distribution(InputIteratorB firstB,
+                                        InputIteratorB lastB,
+                                        InputIteratorW firstW);
+    template<class UnaryOperation>
+        piecewise_constant_distribution(initializer_list<result_type> bl,
+                                        UnaryOperation fw);
+    template<class UnaryOperation>
+        piecewise_constant_distribution(size_t nw, result_type xmin,
+                                        result_type xmax, UnaryOperation fw);
+    explicit piecewise_constant_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    vector<result_type> intervals() const;
+    vector<result_type> densities() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const piecewise_constant_distribution& x,
+                           const piecewise_constant_distribution& y);
+    friend bool operator!=(const piecewise_constant_distribution& x,
+                           const piecewise_constant_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const piecewise_constant_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               piecewise_constant_distribution& x);
+};
+
+template<class RealType = double>
+class piecewise_linear_distribution
+{
+    // types
+    typedef RealType result_type;
+
+    class param_type
+    {
+    public:
+        typedef piecewise_linear_distribution distribution_type;
+
+        param_type();
+        template<class InputIteratorB, class InputIteratorW>
+            param_type(InputIteratorB firstB, InputIteratorB lastB,
+                       InputIteratorW firstW);
+        template<class UnaryOperation>
+            param_type(initializer_list<result_type> bl, UnaryOperation fw);
+        template<class UnaryOperation>
+            param_type(size_t nw, result_type xmin, result_type xmax,
+                       UnaryOperation fw);
+
+        vector<result_type> intervals() const;
+        vector<result_type> densities() const;
+
+        friend bool operator==(const param_type& x, const param_type& y);
+        friend bool operator!=(const param_type& x, const param_type& y);
+    };
+
+    // constructor and reset functions
+    piecewise_linear_distribution();
+    template<class InputIteratorB, class InputIteratorW>
+        piecewise_linear_distribution(InputIteratorB firstB,
+                                      InputIteratorB lastB,
+                                      InputIteratorW firstW);
+
+    template<class UnaryOperation>
+        piecewise_linear_distribution(initializer_list<result_type> bl,
+                                      UnaryOperation fw);
+
+    template<class UnaryOperation>
+        piecewise_linear_distribution(size_t nw, result_type xmin,
+                                      result_type xmax, UnaryOperation fw);
+
+    explicit piecewise_linear_distribution(const param_type& parm);
+    void reset();
+
+    // generating functions
+    template<class URNG> result_type operator()(URNG& g);
+    template<class URNG> result_type operator()(URNG& g, const param_type& parm);
+
+    // property functions
+    vector<result_type> intervals() const;
+    vector<result_type> densities() const;
+
+    param_type param() const;
+    void param(const param_type& parm);
+
+    result_type min() const;
+    result_type max() const;
+
+    friend bool operator==(const piecewise_linear_distribution& x,
+                           const piecewise_linear_distribution& y);
+    friend bool operator!=(const piecewise_linear_distribution& x,
+                           const piecewise_linear_distribution& y);
+
+    template <class charT, class traits>
+    friend
+    basic_ostream<charT, traits>&
+    operator<<(basic_ostream<charT, traits>& os,
+               const piecewise_linear_distribution& x);
+
+    template <class charT, class traits>
+    friend
+    basic_istream<charT, traits>&
+    operator>>(basic_istream<charT, traits>& is,
+               piecewise_linear_distribution& x);
+};
+
+} // std
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__random/bernoulli_distribution.h>
+#include <__random/binomial_distribution.h>
+#include <__random/cauchy_distribution.h>
+#include <__random/chi_squared_distribution.h>
+#include <__random/clamp_to_integral.h>
+#include <__random/default_random_engine.h>
+#include <__random/discard_block_engine.h>
+#include <__random/discrete_distribution.h>
+#include <__random/exponential_distribution.h>
+#include <__random/extreme_value_distribution.h>
+#include <__random/fisher_f_distribution.h>
+#include <__random/gamma_distribution.h>
+#include <__random/generate_canonical.h>
+#include <__random/geometric_distribution.h>
+#include <__random/independent_bits_engine.h>
+#include <__random/is_seed_sequence.h>
+#include <__random/is_valid.h>
+#include <__random/knuth_b.h>
+#include <__random/linear_congruential_engine.h>
+#include <__random/log2.h>
+#include <__random/lognormal_distribution.h>
+#include <__random/mersenne_twister_engine.h>
+#include <__random/negative_binomial_distribution.h>
+#include <__random/normal_distribution.h>
+#include <__random/piecewise_constant_distribution.h>
+#include <__random/piecewise_linear_distribution.h>
+#include <__random/poisson_distribution.h>
+#include <__random/random_device.h>
+#include <__random/ranlux.h>
+#include <__random/seed_seq.h>
+#include <__random/shuffle_order_engine.h>
+#include <__random/student_t_distribution.h>
+#include <__random/subtract_with_carry_engine.h>
+#include <__random/uniform_int_distribution.h>
+#include <__random/uniform_random_bit_generator.h>
+#include <__random/uniform_real_distribution.h>
+#include <__random/weibull_distribution.h>
+#include <version>
+
+// standard-mandated includes
+
+// [rand.synopsis]
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <algorithm>
+#  include <climits>
+#  include <cmath>
+#  include <concepts>
+#  include <cstddef>
+#  include <cstdint>
+#  include <iosfwd>
+#  include <limits>
+#  include <numeric>
+#  include <string>
+#  include <type_traits>
+#  include <vector>
+#endif
+
+#endif // _LIBCPP_RANDOM
diff --git a/app/src/main/cpp/libcxx/include/ranges b/app/src/main/cpp/libcxx/include/ranges
new file mode 100644
index 0000000..f999fa0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/ranges
@@ -0,0 +1,400 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_RANGES
+#define _LIBCPP_RANGES
+
+/*
+
+#include <compare>              // see [compare.syn]
+#include <initializer_list>     // see [initializer.list.syn]
+#include <iterator>             // see [iterator.synopsis]
+
+namespace std::ranges {
+  inline namespace unspecified {
+    // [range.access], range access
+    inline constexpr unspecified begin = unspecified;
+    inline constexpr unspecified end = unspecified;
+    inline constexpr unspecified cbegin = unspecified;
+    inline constexpr unspecified cend = unspecified;
+
+    inline constexpr unspecified size = unspecified;
+    inline constexpr unspecified ssize = unspecified;
+  }
+
+  // [range.range], ranges
+  template<class T>
+    concept range = see below;
+
+  template<class T>
+    inline constexpr bool enable_borrowed_range = false;
+
+  template<class T>
+    using iterator_t = decltype(ranges::begin(declval<T&>()));
+  template<range R>
+    using sentinel_t = decltype(ranges::end(declval<R&>()));
+  template<range R>
+    using range_difference_t = iter_difference_t<iterator_t<R>>;
+  template<sized_range R>
+    using range_size_t = decltype(ranges::size(declval<R&>()));
+  template<range R>
+    using range_value_t = iter_value_t<iterator_t<R>>;
+  template<range R>
+    using range_reference_t = iter_reference_t<iterator_t<R>>;
+  template<range R>
+    using range_rvalue_reference_t = iter_rvalue_reference_t<iterator_t<R>>;
+
+  // [range.sized], sized ranges
+  template<class>
+    inline constexpr bool disable_sized_range = false;
+
+  template<class T>
+    concept sized_range = ...;
+
+  // [range.view], views
+  template<class T>
+    inline constexpr bool enable_view = ...;
+
+  struct view_base { };
+
+  template<class T>
+    concept view = ...;
+
+  // [range.refinements], other range refinements
+  template<class R, class T>
+    concept output_range = see below;
+
+  template<class T>
+    concept input_range = see below;
+
+  template<class T>
+    concept forward_range = see below;
+
+  template<class T>
+  concept bidirectional_range = see below;
+
+  template<class T>
+  concept random_access_range = see below;
+
+  template<class T>
+  concept contiguous_range = see below;
+
+  template <class _Tp>
+    concept common_range = see below;
+
+  template<class T>
+  concept viewable_range = see below;
+
+  // [view.interface], class template view_interface
+  template<class D>
+    requires is_class_v<D> && same_as<D, remove_cv_t<D>>
+  class view_interface;
+
+  // [range.subrange], sub-ranges
+  enum class subrange_kind : bool { unsized, sized };
+
+  template<input_or_output_iterator I, sentinel_for<I> S = I, subrange_kind K = see below>
+    requires (K == subrange_kind::sized || !sized_sentinel_for<S, I>)
+  class subrange;
+
+  template<class I, class S, subrange_kind K>
+    inline constexpr bool enable_borrowed_range<subrange<I, S, K>> = true;
+
+  // [range.dangling], dangling iterator handling
+  struct dangling;
+
+  template<range R>
+    using borrowed_iterator_t = see below;
+
+  template<range R>
+    using borrowed_subrange_t = see below;
+
+  // [range.elements], elements view
+  template<input_range V, size_t N>
+    requires see below
+  class elements_view;
+
+  template<class T, size_t N>
+    inline constexpr bool enable_borrowed_range<elements_view<T, N>> =
+      enable_borrowed_range<T>;
+
+  template<class R>
+    using keys_view = elements_view<R, 0>;
+  template<class R>
+    using values_view = elements_view<R, 1>;
+
+  namespace views {
+    template<size_t N>
+      inline constexpr unspecified elements = unspecified;
+    inline constexpr auto keys = elements<0>;
+    inline constexpr auto values = elements<1>;
+  }
+
+  // [range.empty], empty view
+  template<class T>
+    requires is_object_v<T>
+  class empty_view;
+
+  template<class T>
+    inline constexpr bool enable_borrowed_range<empty_view<T>> = true;
+
+  namespace views {
+    template<class T>
+      inline constexpr empty_view<T> empty{};
+  }
+
+  // [range.all], all view
+  namespace views {
+    inline constexpr unspecified all = unspecified;
+
+    template<viewable_range R>
+      using all_t = decltype(all(declval<R>()));
+  }
+
+  template<range R>
+    requires is_object_v<R>
+  class ref_view;
+
+  template<class T>
+    inline constexpr bool enable_borrowed_range<ref_view<T>> = true;
+
+  template<range R>
+    requires see below
+  class owning_view;
+
+  template<class T>
+    inline constexpr bool enable_borrowed_range<owning_view<T>> = enable_borrowed_range<T>;
+
+  // [range.filter], filter view
+  template<input_range V, indirect_unary_predicate<iterator_t<V>> Pred>
+    requires view<V> && is_object_v<Pred>
+  class filter_view;
+
+  namespace views {
+    inline constexpr unspecified filter = unspecified;
+  }
+
+  // [range.drop], drop view
+  template<view V>
+    class drop_view;
+
+  template<class T>
+    inline constexpr bool enable_borrowed_range<drop_view<T>> = enable_borrowed_range<T>;
+
+  // [range.drop.while], drop while view
+  template<view V, class Pred>
+    requires input_range<V> && is_object_v<Pred> &&
+             indirect_unary_predicate<const Pred, iterator_t<V>>
+    class drop_while_view;
+
+  template<class T, class Pred>
+    inline constexpr bool enable_borrowed_range<drop_while_view<T, Pred>> =
+      enable_borrowed_range<T>;
+
+  namespace views { inline constexpr unspecified drop_while = unspecified; }
+
+  // [range.transform], transform view
+  template<input_range V, copy_constructible F>
+    requires view<V> && is_object_v<F> &&
+             regular_invocable<F&, range_reference_t<V>> &&
+             can-reference<invoke_result_t<F&, range_reference_t<V>>>
+  class transform_view;
+
+  // [range.counted], counted view
+  namespace views { inline constexpr unspecified counted = unspecified; }
+
+  // [range.common], common view
+  template<view V>
+    requires (!common_range<V> && copyable<iterator_t<V>>)
+  class common_view;
+
+ // [range.reverse], reverse view
+  template<view V>
+    requires bidirectional_range<V>
+  class reverse_view;
+
+  template<class T>
+    inline constexpr bool enable_borrowed_range<reverse_view<T>> = enable_borrowed_range<T>;
+
+  template<class T>
+  inline constexpr bool enable_borrowed_range<common_view<T>> = enable_borrowed_range<T>;
+
+   // [range.take], take view
+  template<view> class take_view;
+
+  template<class T>
+  inline constexpr bool enable_borrowed_range<take_view<T>> = enable_borrowed_range<T>;
+
+    // [range.take.while], take while view
+  template<view V, class Pred>
+    requires input_range<V> && is_object_v<Pred> &&
+             indirect_unary_predicate<const Pred, iterator_t<V>>
+    class take_while_view;
+
+  namespace views { inline constexpr unspecified take_while = unspecified; }
+
+  template<copy_constructible T>
+    requires is_object_v<T>
+  class single_view;
+
+  template<weakly_incrementable W, semiregular Bound = unreachable_sentinel_t>
+    requires weakly-equality-comparable-with<W, Bound> && copyable<W>
+  class iota_view;
+
+  template<class W, class Bound>
+    inline constexpr bool enable_borrowed_range<iota_view<W, Bound>> = true;
+
+  // [range.join], join view
+  template<input_range V>
+    requires view<V> && input_range<range_reference_t<V>>
+  class join_view;
+
+  // [range.lazy.split], lazy split view
+  template<class R>
+    concept tiny-range = see below;   // exposition only
+
+  template<input_range V, forward_range Pattern>
+    requires view<V> && view<Pattern> &&
+             indirectly_comparable<iterator_t<V>, iterator_t<Pattern>, ranges::equal_to> &&
+             (forward_range<V> || tiny-range<Pattern>)
+  class lazy_split_view;
+
+  // [range.split], split view
+  template<forward_range V, forward_range Pattern>
+    requires view<V> && view<Pattern> &&
+             indirectly_comparable<iterator_t<V>, iterator_t<Pattern>, ranges::equal_to>
+  class split_view;
+
+  namespace views {
+    inline constexpr unspecified lazy_split = unspecified;
+    inline constexpr unspecified split = unspecified;
+  }
+
+  // [range.istream], istream view
+  template<movable Val, class CharT, class Traits = char_traits<CharT>>
+    requires see below
+  class basic_istream_view;
+
+  template<class Val>
+    using istream_view = basic_istream_view<Val, char>;
+
+  template<class Val>
+    using wistream_view = basic_istream_view<Val, wchar_t>;
+
+  namespace views { template<class T> inline constexpr unspecified istream = unspecified; }
+
+  // [range.zip], zip view
+  template<input_range... Views>
+    requires (view<Views> && ...) && (sizeof...(Views) > 0)
+  class zip_view;        // C++2b
+
+  template<class... Views>
+    inline constexpr bool enable_borrowed_range<zip_view<Views...>> =    // C++2b
+      (enable_borrowed_range<Views> && ...);
+
+  namespace views { inline constexpr unspecified zip = unspecified; }    // C++2b
+
+  // [range.as.rvalue]
+  template <view V>
+    requires input_range<V>
+  class as_rvalue_view; // since C++23
+
+  namespace views { inline constexpr unspecified as_rvalue ) unspecified; } // since C++23
+}
+
+namespace std {
+  namespace views = ranges::views;
+
+  template<class T> struct tuple_size;
+  template<size_t I, class T> struct tuple_element;
+
+  template<class I, class S, ranges::subrange_kind K>
+  struct tuple_size<ranges::subrange<I, S, K>>
+    : integral_constant<size_t, 2> {};
+
+  template<class I, class S, ranges::subrange_kind K>
+  struct tuple_element<0, ranges::subrange<I, S, K>> {
+    using type = I;
+  };
+
+  template<class I, class S, ranges::subrange_kind K>
+  struct tuple_element<1, ranges::subrange<I, S, K>> {
+    using type = S;
+  };
+
+  template<class I, class S, ranges::subrange_kind K>
+  struct tuple_element<0, const ranges::subrange<I, S, K>> {
+    using type = I;
+  };
+
+  template<class I, class S, ranges::subrange_kind K>
+  struct tuple_element<1, const ranges::subrange<I, S, K>> {
+    using type = S;
+  };
+}
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__ranges/access.h>
+#include <__ranges/all.h>
+#include <__ranges/as_rvalue_view.h>
+#include <__ranges/common_view.h>
+#include <__ranges/concepts.h>
+#include <__ranges/counted.h>
+#include <__ranges/dangling.h>
+#include <__ranges/data.h>
+#include <__ranges/drop_view.h>
+#include <__ranges/drop_while_view.h>
+#include <__ranges/elements_view.h>
+#include <__ranges/empty.h>
+#include <__ranges/empty_view.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/enable_view.h>
+#include <__ranges/filter_view.h>
+#include <__ranges/iota_view.h>
+#include <__ranges/join_view.h>
+#include <__ranges/lazy_split_view.h>
+#include <__ranges/rbegin.h>
+#include <__ranges/ref_view.h>
+#include <__ranges/rend.h>
+#include <__ranges/reverse_view.h>
+#include <__ranges/single_view.h>
+#include <__ranges/size.h>
+#include <__ranges/split_view.h>
+#include <__ranges/subrange.h>
+#include <__ranges/take_view.h>
+#include <__ranges/take_while_view.h>
+#include <__ranges/transform_view.h>
+#include <__ranges/view_interface.h>
+#include <__ranges/views.h>
+#include <__ranges/zip_view.h>
+#include <type_traits>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_LOCALIZATION)
+#include <__ranges/istream_view.h>
+#endif
+
+// standard-mandated includes
+
+// [ranges.syn]
+#include <compare>
+#include <initializer_list>
+#include <iterator>
+
+// [tuple.helper]
+#include <__tuple_dir/tuple_element.h>
+#include <__tuple_dir/tuple_size.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif // _LIBCPP_RANGES
diff --git a/app/src/main/cpp/libcxx/include/ratio b/app/src/main/cpp/libcxx/include/ratio
new file mode 100644
index 0000000..3969a39
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/ratio
@@ -0,0 +1,532 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_RATIO
+#define _LIBCPP_RATIO
+
+/*
+    ratio synopsis
+
+namespace std
+{
+
+template <intmax_t N, intmax_t D = 1>
+class ratio
+{
+public:
+    static constexpr intmax_t num;
+    static constexpr intmax_t den;
+    typedef ratio<num, den> type;
+};
+
+// ratio arithmetic
+template <class R1, class R2> using ratio_add = ...;
+template <class R1, class R2> using ratio_subtract = ...;
+template <class R1, class R2> using ratio_multiply = ...;
+template <class R1, class R2> using ratio_divide = ...;
+
+// ratio comparison
+template <class R1, class R2> struct ratio_equal;
+template <class R1, class R2> struct ratio_not_equal;
+template <class R1, class R2> struct ratio_less;
+template <class R1, class R2> struct ratio_less_equal;
+template <class R1, class R2> struct ratio_greater;
+template <class R1, class R2> struct ratio_greater_equal;
+
+// convenience SI typedefs
+typedef ratio<1, 1000000000000000000000000> yocto;  // not supported
+typedef ratio<1,    1000000000000000000000> zepto;  // not supported
+typedef ratio<1,       1000000000000000000> atto;
+typedef ratio<1,          1000000000000000> femto;
+typedef ratio<1,             1000000000000> pico;
+typedef ratio<1,                1000000000> nano;
+typedef ratio<1,                   1000000> micro;
+typedef ratio<1,                      1000> milli;
+typedef ratio<1,                       100> centi;
+typedef ratio<1,                        10> deci;
+typedef ratio<                       10, 1> deca;
+typedef ratio<                      100, 1> hecto;
+typedef ratio<                     1000, 1> kilo;
+typedef ratio<                  1000000, 1> mega;
+typedef ratio<               1000000000, 1> giga;
+typedef ratio<            1000000000000, 1> tera;
+typedef ratio<         1000000000000000, 1> peta;
+typedef ratio<      1000000000000000000, 1> exa;
+typedef ratio<   1000000000000000000000, 1> zetta;  // not supported
+typedef ratio<1000000000000000000000000, 1> yotta;  // not supported
+
+  // 20.11.5, ratio comparison
+  template <class R1, class R2> inline constexpr bool ratio_equal_v
+    = ratio_equal<R1, R2>::value;                                       // C++17
+  template <class R1, class R2> inline constexpr bool ratio_not_equal_v
+    = ratio_not_equal<R1, R2>::value;                                   // C++17
+  template <class R1, class R2> inline constexpr bool ratio_less_v
+    = ratio_less<R1, R2>::value;                                        // C++17
+  template <class R1, class R2> inline constexpr bool ratio_less_equal_v
+    = ratio_less_equal<R1, R2>::value;                                  // C++17
+  template <class R1, class R2> inline constexpr bool ratio_greater_v
+    = ratio_greater<R1, R2>::value;                                     // C++17
+  template <class R1, class R2> inline constexpr bool ratio_greater_equal_v
+    = ratio_greater_equal<R1, R2>::value;                               // C++17
+}
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__type_traits/integral_constant.h>
+#include <climits>
+#include <cstdint>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// __static_gcd
+
+template <intmax_t _Xp, intmax_t _Yp>
+struct __static_gcd
+{
+    static const intmax_t value = __static_gcd<_Yp, _Xp % _Yp>::value;
+};
+
+template <intmax_t _Xp>
+struct __static_gcd<_Xp, 0>
+{
+    static const intmax_t value = _Xp;
+};
+
+template <>
+struct __static_gcd<0, 0>
+{
+    static const intmax_t value = 1;
+};
+
+// __static_lcm
+
+template <intmax_t _Xp, intmax_t _Yp>
+struct __static_lcm
+{
+    static const intmax_t value = _Xp / __static_gcd<_Xp, _Yp>::value * _Yp;
+};
+
+template <intmax_t _Xp>
+struct __static_abs
+{
+    static const intmax_t value = _Xp < 0 ? -_Xp : _Xp;
+};
+
+template <intmax_t _Xp>
+struct __static_sign
+{
+    static const intmax_t value = _Xp == 0 ? 0 : (_Xp < 0 ? -1 : 1);
+};
+
+template <intmax_t _Xp, intmax_t _Yp, intmax_t = __static_sign<_Yp>::value>
+class __ll_add;
+
+template <intmax_t _Xp, intmax_t _Yp>
+class __ll_add<_Xp, _Yp, 1>
+{
+    static const intmax_t min = (1LL << (sizeof(intmax_t) * CHAR_BIT - 1)) + 1;
+    static const intmax_t max = -min;
+
+    static_assert(_Xp <= max - _Yp, "overflow in __ll_add");
+public:
+    static const intmax_t value = _Xp + _Yp;
+};
+
+template <intmax_t _Xp, intmax_t _Yp>
+class __ll_add<_Xp, _Yp, 0>
+{
+public:
+    static const intmax_t value = _Xp;
+};
+
+template <intmax_t _Xp, intmax_t _Yp>
+class __ll_add<_Xp, _Yp, -1>
+{
+    static const intmax_t min = (1LL << (sizeof(intmax_t) * CHAR_BIT - 1)) + 1;
+    static const intmax_t max = -min;
+
+    static_assert(min - _Yp <= _Xp, "overflow in __ll_add");
+public:
+    static const intmax_t value = _Xp + _Yp;
+};
+
+template <intmax_t _Xp, intmax_t _Yp, intmax_t = __static_sign<_Yp>::value>
+class __ll_sub;
+
+template <intmax_t _Xp, intmax_t _Yp>
+class __ll_sub<_Xp, _Yp, 1>
+{
+    static const intmax_t min = (1LL << (sizeof(intmax_t) * CHAR_BIT - 1)) + 1;
+    static const intmax_t max = -min;
+
+    static_assert(min + _Yp <= _Xp, "overflow in __ll_sub");
+public:
+    static const intmax_t value = _Xp - _Yp;
+};
+
+template <intmax_t _Xp, intmax_t _Yp>
+class __ll_sub<_Xp, _Yp, 0>
+{
+public:
+    static const intmax_t value = _Xp;
+};
+
+template <intmax_t _Xp, intmax_t _Yp>
+class __ll_sub<_Xp, _Yp, -1>
+{
+    static const intmax_t min = (1LL << (sizeof(intmax_t) * CHAR_BIT - 1)) + 1;
+    static const intmax_t max = -min;
+
+    static_assert(_Xp <= max + _Yp, "overflow in __ll_sub");
+public:
+    static const intmax_t value = _Xp - _Yp;
+};
+
+template <intmax_t _Xp, intmax_t _Yp>
+class __ll_mul
+{
+    static const intmax_t nan = (1LL << (sizeof(intmax_t) * CHAR_BIT - 1));
+    static const intmax_t min = nan + 1;
+    static const intmax_t max = -min;
+    static const intmax_t __a_x = __static_abs<_Xp>::value;
+    static const intmax_t __a_y = __static_abs<_Yp>::value;
+
+    static_assert(_Xp != nan && _Yp != nan && __a_x <= max / __a_y, "overflow in __ll_mul");
+public:
+    static const intmax_t value = _Xp * _Yp;
+};
+
+template <intmax_t _Yp>
+class __ll_mul<0, _Yp>
+{
+public:
+    static const intmax_t value = 0;
+};
+
+template <intmax_t _Xp>
+class __ll_mul<_Xp, 0>
+{
+public:
+    static const intmax_t value = 0;
+};
+
+template <>
+class __ll_mul<0, 0>
+{
+public:
+    static const intmax_t value = 0;
+};
+
+// Not actually used but left here in case needed in future maintenance
+template <intmax_t _Xp, intmax_t _Yp>
+class __ll_div
+{
+    static const intmax_t nan = (1LL << (sizeof(intmax_t) * CHAR_BIT - 1));
+    static const intmax_t min = nan + 1;
+    static const intmax_t max = -min;
+
+    static_assert(_Xp != nan && _Yp != nan && _Yp != 0, "overflow in __ll_div");
+public:
+    static const intmax_t value = _Xp / _Yp;
+};
+
+template <intmax_t _Num, intmax_t _Den = 1>
+class _LIBCPP_TEMPLATE_VIS ratio
+{
+    static_assert(__static_abs<_Num>::value >= 0, "ratio numerator is out of range");
+    static_assert(_Den != 0, "ratio divide by 0");
+    static_assert(__static_abs<_Den>::value >  0, "ratio denominator is out of range");
+    static _LIBCPP_CONSTEXPR const intmax_t __na = __static_abs<_Num>::value;
+    static _LIBCPP_CONSTEXPR const intmax_t __da = __static_abs<_Den>::value;
+    static _LIBCPP_CONSTEXPR const intmax_t __s = __static_sign<_Num>::value * __static_sign<_Den>::value;
+    static _LIBCPP_CONSTEXPR const intmax_t __gcd = __static_gcd<__na, __da>::value;
+public:
+    static _LIBCPP_CONSTEXPR const intmax_t num = __s * __na / __gcd;
+    static _LIBCPP_CONSTEXPR const intmax_t den = __da / __gcd;
+
+    typedef ratio<num, den> type;
+};
+
+template <intmax_t _Num, intmax_t _Den>
+_LIBCPP_CONSTEXPR const intmax_t ratio<_Num, _Den>::num;
+
+template <intmax_t _Num, intmax_t _Den>
+_LIBCPP_CONSTEXPR const intmax_t ratio<_Num, _Den>::den;
+
+template <class _Tp>                    struct __is_ratio                     : false_type {};
+template <intmax_t _Num, intmax_t _Den> struct __is_ratio<ratio<_Num, _Den> > : true_type  {};
+
+typedef ratio<1LL, 1000000000000000000LL> atto;
+typedef ratio<1LL,    1000000000000000LL> femto;
+typedef ratio<1LL,       1000000000000LL> pico;
+typedef ratio<1LL,          1000000000LL> nano;
+typedef ratio<1LL,             1000000LL> micro;
+typedef ratio<1LL,                1000LL> milli;
+typedef ratio<1LL,                 100LL> centi;
+typedef ratio<1LL,                  10LL> deci;
+typedef ratio<                 10LL, 1LL> deca;
+typedef ratio<                100LL, 1LL> hecto;
+typedef ratio<               1000LL, 1LL> kilo;
+typedef ratio<            1000000LL, 1LL> mega;
+typedef ratio<         1000000000LL, 1LL> giga;
+typedef ratio<      1000000000000LL, 1LL> tera;
+typedef ratio<   1000000000000000LL, 1LL> peta;
+typedef ratio<1000000000000000000LL, 1LL> exa;
+
+template <class _R1, class _R2>
+struct __ratio_multiply
+{
+private:
+    static const intmax_t __gcd_n1_d2 = __static_gcd<_R1::num, _R2::den>::value;
+    static const intmax_t __gcd_d1_n2 = __static_gcd<_R1::den, _R2::num>::value;
+public:
+    typedef typename ratio
+        <
+            __ll_mul<_R1::num / __gcd_n1_d2, _R2::num / __gcd_d1_n2>::value,
+            __ll_mul<_R2::den / __gcd_n1_d2, _R1::den / __gcd_d1_n2>::value
+        >::type type;
+};
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _R1, class _R2> using ratio_multiply
+                                    = typename __ratio_multiply<_R1, _R2>::type;
+
+#else  // _LIBCPP_CXX03_LANG
+
+template <class _R1, class _R2>
+struct _LIBCPP_TEMPLATE_VIS ratio_multiply
+    : public __ratio_multiply<_R1, _R2>::type {};
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _R1, class _R2>
+struct __ratio_divide
+{
+private:
+    static const intmax_t __gcd_n1_n2 = __static_gcd<_R1::num, _R2::num>::value;
+    static const intmax_t __gcd_d1_d2 = __static_gcd<_R1::den, _R2::den>::value;
+public:
+    typedef typename ratio
+        <
+            __ll_mul<_R1::num / __gcd_n1_n2, _R2::den / __gcd_d1_d2>::value,
+            __ll_mul<_R2::num / __gcd_n1_n2, _R1::den / __gcd_d1_d2>::value
+        >::type type;
+};
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _R1, class _R2> using ratio_divide
+                                      = typename __ratio_divide<_R1, _R2>::type;
+
+#else  // _LIBCPP_CXX03_LANG
+
+template <class _R1, class _R2>
+struct _LIBCPP_TEMPLATE_VIS ratio_divide
+    : public __ratio_divide<_R1, _R2>::type {};
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _R1, class _R2>
+struct __ratio_add
+{
+private:
+    static const intmax_t __gcd_n1_n2 = __static_gcd<_R1::num, _R2::num>::value;
+    static const intmax_t __gcd_d1_d2 = __static_gcd<_R1::den, _R2::den>::value;
+public:
+    typedef typename ratio_multiply
+        <
+            ratio<__gcd_n1_n2, _R1::den / __gcd_d1_d2>,
+            ratio
+            <
+                __ll_add
+                <
+                    __ll_mul<_R1::num / __gcd_n1_n2, _R2::den / __gcd_d1_d2>::value,
+                    __ll_mul<_R2::num / __gcd_n1_n2, _R1::den / __gcd_d1_d2>::value
+                >::value,
+                _R2::den
+            >
+        >::type type;
+};
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _R1, class _R2> using ratio_add
+                                         = typename __ratio_add<_R1, _R2>::type;
+
+#else  // _LIBCPP_CXX03_LANG
+
+template <class _R1, class _R2>
+struct _LIBCPP_TEMPLATE_VIS ratio_add
+    : public __ratio_add<_R1, _R2>::type {};
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _R1, class _R2>
+struct __ratio_subtract
+{
+private:
+    static const intmax_t __gcd_n1_n2 = __static_gcd<_R1::num, _R2::num>::value;
+    static const intmax_t __gcd_d1_d2 = __static_gcd<_R1::den, _R2::den>::value;
+public:
+    typedef typename ratio_multiply
+        <
+            ratio<__gcd_n1_n2, _R1::den / __gcd_d1_d2>,
+            ratio
+            <
+                __ll_sub
+                <
+                    __ll_mul<_R1::num / __gcd_n1_n2, _R2::den / __gcd_d1_d2>::value,
+                    __ll_mul<_R2::num / __gcd_n1_n2, _R1::den / __gcd_d1_d2>::value
+                >::value,
+                _R2::den
+            >
+        >::type type;
+};
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _R1, class _R2> using ratio_subtract
+                                    = typename __ratio_subtract<_R1, _R2>::type;
+
+#else  // _LIBCPP_CXX03_LANG
+
+template <class _R1, class _R2>
+struct _LIBCPP_TEMPLATE_VIS ratio_subtract
+    : public __ratio_subtract<_R1, _R2>::type {};
+
+#endif // _LIBCPP_CXX03_LANG
+
+// ratio_equal
+
+template <class _R1, class _R2>
+struct _LIBCPP_TEMPLATE_VIS ratio_equal
+    : _BoolConstant<(_R1::num == _R2::num && _R1::den == _R2::den)> {};
+
+template <class _R1, class _R2>
+struct _LIBCPP_TEMPLATE_VIS ratio_not_equal
+    : _BoolConstant<!ratio_equal<_R1, _R2>::value> {};
+
+// ratio_less
+
+template <class _R1, class _R2, bool _Odd = false,
+          intmax_t _Q1 = _R1::num / _R1::den, intmax_t _M1 = _R1::num % _R1::den,
+          intmax_t _Q2 = _R2::num / _R2::den, intmax_t _M2 = _R2::num % _R2::den>
+struct __ratio_less1
+{
+    static const bool value = _Odd ? _Q2 < _Q1 : _Q1 < _Q2;
+};
+
+template <class _R1, class _R2, bool _Odd, intmax_t _Qp>
+struct __ratio_less1<_R1, _R2, _Odd, _Qp, 0, _Qp, 0>
+{
+    static const bool value = false;
+};
+
+template <class _R1, class _R2, bool _Odd, intmax_t _Qp, intmax_t _M2>
+struct __ratio_less1<_R1, _R2, _Odd, _Qp, 0, _Qp, _M2>
+{
+    static const bool value = !_Odd;
+};
+
+template <class _R1, class _R2, bool _Odd, intmax_t _Qp, intmax_t _M1>
+struct __ratio_less1<_R1, _R2, _Odd, _Qp, _M1, _Qp, 0>
+{
+    static const bool value = _Odd;
+};
+
+template <class _R1, class _R2, bool _Odd, intmax_t _Qp, intmax_t _M1,
+                                                        intmax_t _M2>
+struct __ratio_less1<_R1, _R2, _Odd, _Qp, _M1, _Qp, _M2>
+{
+    static const bool value = __ratio_less1<ratio<_R1::den, _M1>,
+                                            ratio<_R2::den, _M2>, !_Odd>::value;
+};
+
+template <class _R1, class _R2, intmax_t _S1 = __static_sign<_R1::num>::value,
+                                intmax_t _S2 = __static_sign<_R2::num>::value>
+struct __ratio_less
+{
+    static const bool value = _S1 < _S2;
+};
+
+template <class _R1, class _R2>
+struct __ratio_less<_R1, _R2, 1LL, 1LL>
+{
+    static const bool value = __ratio_less1<_R1, _R2>::value;
+};
+
+template <class _R1, class _R2>
+struct __ratio_less<_R1, _R2, -1LL, -1LL>
+{
+    static const bool value = __ratio_less1<ratio<-_R2::num, _R2::den>, ratio<-_R1::num, _R1::den> >::value;
+};
+
+template <class _R1, class _R2>
+struct _LIBCPP_TEMPLATE_VIS ratio_less
+    : _BoolConstant<__ratio_less<_R1, _R2>::value> {};
+
+template <class _R1, class _R2>
+struct _LIBCPP_TEMPLATE_VIS ratio_less_equal
+    : _BoolConstant<!ratio_less<_R2, _R1>::value> {};
+
+template <class _R1, class _R2>
+struct _LIBCPP_TEMPLATE_VIS ratio_greater
+    : _BoolConstant<ratio_less<_R2, _R1>::value> {};
+
+template <class _R1, class _R2>
+struct _LIBCPP_TEMPLATE_VIS ratio_greater_equal
+    : _BoolConstant<!ratio_less<_R1, _R2>::value> {};
+
+template <class _R1, class _R2>
+struct __ratio_gcd
+{
+    typedef ratio<__static_gcd<_R1::num, _R2::num>::value,
+                  __static_lcm<_R1::den, _R2::den>::value> type;
+};
+
+#if _LIBCPP_STD_VER > 14
+template <class _R1, class _R2>
+inline constexpr bool ratio_equal_v = ratio_equal<_R1, _R2>::value;
+
+template <class _R1, class _R2>
+inline constexpr bool ratio_not_equal_v = ratio_not_equal<_R1, _R2>::value;
+
+template <class _R1, class _R2>
+inline constexpr bool ratio_less_v = ratio_less<_R1, _R2>::value;
+
+template <class _R1, class _R2>
+inline constexpr bool ratio_less_equal_v = ratio_less_equal<_R1, _R2>::value;
+
+template <class _R1, class _R2>
+inline constexpr bool ratio_greater_v = ratio_greater<_R1, _R2>::value;
+
+template <class _R1, class _R2>
+inline constexpr bool ratio_greater_equal_v = ratio_greater_equal<_R1, _R2>::value;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_RATIO
diff --git a/app/src/main/cpp/libcxx/include/regex b/app/src/main/cpp/libcxx/include/regex
new file mode 100644
index 0000000..06c017f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/regex
@@ -0,0 +1,6876 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_REGEX
+#define _LIBCPP_REGEX
+
+/*
+    regex synopsis
+
+#include <initializer_list>
+
+namespace std
+{
+
+namespace regex_constants
+{
+
+enum syntax_option_type
+{
+    icase      = unspecified,
+    nosubs     = unspecified,
+    optimize   = unspecified,
+    collate    = unspecified,
+    ECMAScript = unspecified,
+    basic      = unspecified,
+    extended   = unspecified,
+    awk        = unspecified,
+    grep       = unspecified,
+    egrep      = unspecified,
+    multiline  = unspecified
+};
+
+constexpr syntax_option_type operator~(syntax_option_type f);
+constexpr syntax_option_type operator&(syntax_option_type lhs, syntax_option_type rhs);
+constexpr syntax_option_type operator|(syntax_option_type lhs, syntax_option_type rhs);
+
+enum match_flag_type
+{
+    match_default     = 0,
+    match_not_bol     = unspecified,
+    match_not_eol     = unspecified,
+    match_not_bow     = unspecified,
+    match_not_eow     = unspecified,
+    match_any         = unspecified,
+    match_not_null    = unspecified,
+    match_continuous  = unspecified,
+    match_prev_avail  = unspecified,
+    format_default    = 0,
+    format_sed        = unspecified,
+    format_no_copy    = unspecified,
+    format_first_only = unspecified
+};
+
+constexpr match_flag_type operator~(match_flag_type f);
+constexpr match_flag_type operator&(match_flag_type lhs, match_flag_type rhs);
+constexpr match_flag_type operator|(match_flag_type lhs, match_flag_type rhs);
+
+enum error_type
+{
+    error_collate    = unspecified,
+    error_ctype      = unspecified,
+    error_escape     = unspecified,
+    error_backref    = unspecified,
+    error_brack      = unspecified,
+    error_paren      = unspecified,
+    error_brace      = unspecified,
+    error_badbrace   = unspecified,
+    error_range      = unspecified,
+    error_space      = unspecified,
+    error_badrepeat  = unspecified,
+    error_complexity = unspecified,
+    error_stack      = unspecified
+};
+
+}  // regex_constants
+
+class regex_error
+    : public runtime_error
+{
+public:
+    explicit regex_error(regex_constants::error_type ecode);
+    regex_constants::error_type code() const;
+};
+
+template <class charT>
+struct regex_traits
+{
+public:
+    typedef charT                   char_type;
+    typedef basic_string<char_type> string_type;
+    typedef locale                  locale_type;
+    typedef /bitmask_type/          char_class_type;
+
+    regex_traits();
+
+    static size_t length(const char_type* p);
+    charT translate(charT c) const;
+    charT translate_nocase(charT c) const;
+    template <class ForwardIterator>
+        string_type
+        transform(ForwardIterator first, ForwardIterator last) const;
+    template <class ForwardIterator>
+        string_type
+        transform_primary( ForwardIterator first, ForwardIterator last) const;
+    template <class ForwardIterator>
+        string_type
+        lookup_collatename(ForwardIterator first, ForwardIterator last) const;
+    template <class ForwardIterator>
+        char_class_type
+        lookup_classname(ForwardIterator first, ForwardIterator last,
+                         bool icase = false) const;
+    bool isctype(charT c, char_class_type f) const;
+    int value(charT ch, int radix) const;
+    locale_type imbue(locale_type l);
+    locale_type getloc()const;
+};
+
+template <class charT, class traits = regex_traits<charT>>
+class basic_regex
+{
+public:
+    // types:
+    typedef charT                               value_type;
+    typedef traits                              traits_type;
+    typedef typename traits::string_type        string_type;
+    typedef regex_constants::syntax_option_type flag_type;
+    typedef typename traits::locale_type        locale_type;
+
+    // constants:
+    static constexpr regex_constants::syntax_option_type icase = regex_constants::icase;
+    static constexpr regex_constants::syntax_option_type nosubs = regex_constants::nosubs;
+    static constexpr regex_constants::syntax_option_type optimize = regex_constants::optimize;
+    static constexpr regex_constants::syntax_option_type collate = regex_constants::collate;
+    static constexpr regex_constants::syntax_option_type ECMAScript = regex_constants::ECMAScript;
+    static constexpr regex_constants::syntax_option_type basic = regex_constants::basic;
+    static constexpr regex_constants::syntax_option_type extended = regex_constants::extended;
+    static constexpr regex_constants::syntax_option_type awk = regex_constants::awk;
+    static constexpr regex_constants::syntax_option_type grep = regex_constants::grep;
+    static constexpr regex_constants::syntax_option_type egrep = regex_constants::egrep;
+    static constexpr regex_constants::syntax_option_type multiline = regex_constants::multiline;
+
+    // construct/copy/destroy:
+    basic_regex();
+    explicit basic_regex(const charT* p, flag_type f = regex_constants::ECMAScript);
+    basic_regex(const charT* p, size_t len, flag_type f = regex_constants::ECMAScript);
+    basic_regex(const basic_regex&);
+    basic_regex(basic_regex&&) noexcept;
+    template <class ST, class SA>
+        explicit basic_regex(const basic_string<charT, ST, SA>& p,
+                             flag_type f = regex_constants::ECMAScript);
+    template <class ForwardIterator>
+        basic_regex(ForwardIterator first, ForwardIterator last,
+                    flag_type f = regex_constants::ECMAScript);
+    basic_regex(initializer_list<charT>, flag_type = regex_constants::ECMAScript);
+
+    ~basic_regex();
+
+    basic_regex& operator=(const basic_regex&);
+    basic_regex& operator=(basic_regex&&) noexcept;
+    basic_regex& operator=(const charT* ptr);
+    basic_regex& operator=(initializer_list<charT> il);
+    template <class ST, class SA>
+        basic_regex& operator=(const basic_string<charT, ST, SA>& p);
+
+    // assign:
+    basic_regex& assign(const basic_regex& that);
+    basic_regex& assign(basic_regex&& that) noexcept;
+    basic_regex& assign(const charT* ptr,           flag_type f = regex_constants::ECMAScript);
+    basic_regex& assign(const charT* p, size_t len, flag_type f = regex_constants::ECMAScript);
+    template <class string_traits, class A>
+        basic_regex& assign(const basic_string<charT, string_traits, A>& s,
+                                                    flag_type f = regex_constants::ECMAScript);
+    template <class InputIterator>
+        basic_regex& assign(InputIterator first, InputIterator last,
+                                                    flag_type f = regex_constants::ECMAScript);
+    basic_regex& assign(initializer_list<charT>,    flag_type f = regex_constants::ECMAScript);
+
+    // const operations:
+    unsigned mark_count() const;
+    flag_type flags() const;
+
+    // locale:
+    locale_type imbue(locale_type loc);
+    locale_type getloc() const;
+
+    // swap:
+    void swap(basic_regex&);
+};
+
+template<class ForwardIterator>
+basic_regex(ForwardIterator, ForwardIterator,
+            regex_constants::syntax_option_type = regex_constants::ECMAScript)
+    -> basic_regex<typename iterator_traits<ForwardIterator>::value_type>; // C++17
+
+typedef basic_regex<char>    regex;
+typedef basic_regex<wchar_t> wregex;
+
+template <class charT, class traits>
+    void swap(basic_regex<charT, traits>& e1, basic_regex<charT, traits>& e2);
+
+template <class BidirectionalIterator>
+class sub_match
+    : public pair<BidirectionalIterator, BidirectionalIterator>
+{
+public:
+    typedef typename iterator_traits<BidirectionalIterator>::value_type value_type;
+    typedef typename iterator_traits<BidirectionalIterator>::difference_type difference_type;
+    typedef BidirectionalIterator                                      iterator;
+    typedef basic_string<value_type>                                string_type;
+
+    bool matched;
+
+    constexpr sub_match();
+
+    difference_type length() const;
+    operator string_type() const;
+    string_type str() const;
+
+    int compare(const sub_match& s) const;
+    int compare(const string_type& s) const;
+    int compare(const value_type* s) const;
+};
+
+typedef sub_match<const char*>             csub_match;
+typedef sub_match<const wchar_t*>          wcsub_match;
+typedef sub_match<string::const_iterator>  ssub_match;
+typedef sub_match<wstring::const_iterator> wssub_match;
+
+template <class BiIter>
+    bool
+    operator==(const sub_match<BiIter>& lhs, const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator!=(const sub_match<BiIter>& lhs, const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator<(const sub_match<BiIter>& lhs, const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator<=(const sub_match<BiIter>& lhs, const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator>=(const sub_match<BiIter>& lhs, const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator>(const sub_match<BiIter>& lhs, const sub_match<BiIter>& rhs);
+
+template <class BiIter, class ST, class SA>
+    bool
+    operator==(const basic_string<typename iterator_traits<BiIter>::value_type, ST, SA>& lhs,
+               const sub_match<BiIter>& rhs);
+
+template <class BiIter, class ST, class SA>
+    bool
+    operator!=(const basic_string<typename iterator_traits<BiIter>::value_type, ST, SA>& lhs,
+               const sub_match<BiIter>& rhs);
+
+template <class BiIter, class ST, class SA>
+    bool
+    operator<(const basic_string<typename iterator_traits<BiIter>::value_type, ST, SA>& lhs,
+              const sub_match<BiIter>& rhs);
+
+template <class BiIter, class ST, class SA>
+    bool
+    operator>(const basic_string<typename iterator_traits<BiIter>::value_type, ST, SA>& lhs,
+              const sub_match<BiIter>& rhs);
+
+template <class BiIter, class ST, class SA>
+    bool operator>=(const basic_string<typename iterator_traits<BiIter>::value_type, ST, SA>& lhs,
+                    const sub_match<BiIter>& rhs);
+
+template <class BiIter, class ST, class SA>
+    bool
+    operator<=(const basic_string<typename iterator_traits<BiIter>::value_type, ST, SA>& lhs,
+               const sub_match<BiIter>& rhs);
+
+template <class BiIter, class ST, class SA>
+    bool
+    operator==(const sub_match<BiIter>& lhs,
+               const basic_string<typename iterator_traits<BiIter>::value_type, ST, SA>& rhs);
+
+template <class BiIter, class ST, class SA>
+    bool
+    operator!=(const sub_match<BiIter>& lhs,
+               const basic_string<typename iterator_traits<BiIter>::value_type, ST, SA>& rhs);
+
+template <class BiIter, class ST, class SA>
+    bool
+    operator<(const sub_match<BiIter>& lhs,
+              const basic_string<typename iterator_traits<BiIter>::value_type, ST, SA>& rhs);
+
+template <class BiIter, class ST, class SA>
+    bool operator>(const sub_match<BiIter>& lhs,
+                   const basic_string<typename iterator_traits<BiIter>::value_type, ST, SA>& rhs);
+
+template <class BiIter, class ST, class SA>
+    bool
+    operator>=(const sub_match<BiIter>& lhs,
+               const basic_string<typename iterator_traits<BiIter>::value_type, ST, SA>& rhs);
+
+template <class BiIter, class ST, class SA>
+    bool
+    operator<=(const sub_match<BiIter>& lhs,
+               const basic_string<typename iterator_traits<BiIter>::value_type, ST, SA>& rhs);
+
+template <class BiIter>
+    bool
+    operator==(typename iterator_traits<BiIter>::value_type const* lhs,
+               const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator!=(typename iterator_traits<BiIter>::value_type const* lhs,
+               const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator<(typename iterator_traits<BiIter>::value_type const* lhs,
+              const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator>(typename iterator_traits<BiIter>::value_type const* lhs,
+              const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator>=(typename iterator_traits<BiIter>::value_type const* lhs,
+               const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator<=(typename iterator_traits<BiIter>::value_type const* lhs,
+               const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator==(const sub_match<BiIter>& lhs,
+               typename iterator_traits<BiIter>::value_type const* rhs);
+
+template <class BiIter>
+    bool
+    operator!=(const sub_match<BiIter>& lhs,
+               typename iterator_traits<BiIter>::value_type const* rhs);
+
+template <class BiIter>
+    bool
+    operator<(const sub_match<BiIter>& lhs,
+              typename iterator_traits<BiIter>::value_type const* rhs);
+
+template <class BiIter>
+    bool
+    operator>(const sub_match<BiIter>& lhs,
+              typename iterator_traits<BiIter>::value_type const* rhs);
+
+template <class BiIter>
+    bool
+    operator>=(const sub_match<BiIter>& lhs,
+               typename iterator_traits<BiIter>::value_type const* rhs);
+
+template <class BiIter>
+    bool
+    operator<=(const sub_match<BiIter>& lhs,
+               typename iterator_traits<BiIter>::value_type const* rhs);
+
+template <class BiIter>
+    bool
+    operator==(typename iterator_traits<BiIter>::value_type const& lhs,
+               const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator!=(typename iterator_traits<BiIter>::value_type const& lhs,
+               const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator<(typename iterator_traits<BiIter>::value_type const& lhs,
+              const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator>(typename iterator_traits<BiIter>::value_type const& lhs,
+              const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator>=(typename iterator_traits<BiIter>::value_type const& lhs,
+               const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator<=(typename iterator_traits<BiIter>::value_type const& lhs,
+               const sub_match<BiIter>& rhs);
+
+template <class BiIter>
+    bool
+    operator==(const sub_match<BiIter>& lhs,
+               typename iterator_traits<BiIter>::value_type const& rhs);
+
+template <class BiIter>
+    bool
+    operator!=(const sub_match<BiIter>& lhs,
+               typename iterator_traits<BiIter>::value_type const& rhs);
+
+template <class BiIter>
+    bool
+    operator<(const sub_match<BiIter>& lhs,
+              typename iterator_traits<BiIter>::value_type const& rhs);
+
+template <class BiIter>
+    bool
+    operator>(const sub_match<BiIter>& lhs,
+              typename iterator_traits<BiIter>::value_type const& rhs);
+
+template <class BiIter>
+    bool
+    operator>=(const sub_match<BiIter>& lhs,
+               typename iterator_traits<BiIter>::value_type const& rhs);
+
+template <class BiIter>
+    bool
+    operator<=(const sub_match<BiIter>& lhs,
+               typename iterator_traits<BiIter>::value_type const& rhs);
+
+template <class charT, class ST, class BiIter>
+    basic_ostream<charT, ST>&
+    operator<<(basic_ostream<charT, ST>& os, const sub_match<BiIter>& m);
+
+template <class BidirectionalIterator,
+          class Allocator = allocator<sub_match<BidirectionalIterator>>>
+class match_results
+{
+public:
+    typedef sub_match<BidirectionalIterator>                  value_type;
+    typedef const value_type&                                 const_reference;
+    typedef value_type&                                       reference;
+    typedef /implementation-defined/                          const_iterator;
+    typedef const_iterator                                    iterator;
+    typedef typename iterator_traits<BidirectionalIterator>::difference_type difference_type;
+    typedef typename allocator_traits<Allocator>::size_type   size_type;
+    typedef Allocator                                         allocator_type;
+    typedef typename iterator_traits<BidirectionalIterator>::value_type char_type;
+    typedef basic_string<char_type>                           string_type;
+
+    // construct/copy/destroy:
+    explicit match_results(const Allocator& a = Allocator()); // before C++20
+    match_results() : match_results(Allocator()) {}           // C++20
+    explicit match_results(const Allocator& a);               // C++20
+    match_results(const match_results& m);
+    match_results(match_results&& m) noexcept;
+    match_results& operator=(const match_results& m);
+    match_results& operator=(match_results&& m);
+    ~match_results();
+
+    bool ready() const;
+
+    // size:
+    size_type size() const;
+    size_type max_size() const;
+    bool empty() const;
+
+    // element access:
+    difference_type length(size_type sub = 0) const;
+    difference_type position(size_type sub = 0) const;
+    string_type str(size_type sub = 0) const;
+    const_reference operator[](size_type n) const;
+
+    const_reference prefix() const;
+    const_reference suffix() const;
+
+    const_iterator begin() const;
+    const_iterator end() const;
+    const_iterator cbegin() const;
+    const_iterator cend() const;
+
+    // format:
+    template <class OutputIter>
+        OutputIter
+        format(OutputIter out, const char_type* fmt_first,
+               const char_type* fmt_last,
+               regex_constants::match_flag_type flags = regex_constants::format_default) const;
+    template <class OutputIter, class ST, class SA>
+        OutputIter
+        format(OutputIter out, const basic_string<char_type, ST, SA>& fmt,
+               regex_constants::match_flag_type flags = regex_constants::format_default) const;
+    template <class ST, class SA>
+        basic_string<char_type, ST, SA>
+        format(const basic_string<char_type, ST, SA>& fmt,
+               regex_constants::match_flag_type flags = regex_constants::format_default) const;
+    string_type
+        format(const char_type* fmt,
+               regex_constants::match_flag_type flags = regex_constants::format_default) const;
+
+    // allocator:
+    allocator_type get_allocator() const;
+
+    // swap:
+    void swap(match_results& that);
+};
+
+typedef match_results<const char*>             cmatch;
+typedef match_results<const wchar_t*>          wcmatch;
+typedef match_results<string::const_iterator>  smatch;
+typedef match_results<wstring::const_iterator> wsmatch;
+
+template <class BidirectionalIterator, class Allocator>
+    bool
+    operator==(const match_results<BidirectionalIterator, Allocator>& m1,
+               const match_results<BidirectionalIterator, Allocator>& m2);
+
+template <class BidirectionalIterator, class Allocator>
+    bool
+    operator!=(const match_results<BidirectionalIterator, Allocator>& m1,
+               const match_results<BidirectionalIterator, Allocator>& m2);
+
+template <class BidirectionalIterator, class Allocator>
+    void
+    swap(match_results<BidirectionalIterator, Allocator>& m1,
+         match_results<BidirectionalIterator, Allocator>& m2);
+
+template <class BidirectionalIterator, class Allocator, class charT, class traits>
+    bool
+    regex_match(BidirectionalIterator first, BidirectionalIterator last,
+                match_results<BidirectionalIterator, Allocator>& m,
+                const basic_regex<charT, traits>& e,
+                regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class BidirectionalIterator, class charT, class traits>
+    bool
+    regex_match(BidirectionalIterator first, BidirectionalIterator last,
+                const basic_regex<charT, traits>& e,
+                regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class charT, class Allocator, class traits>
+    bool
+    regex_match(const charT* str, match_results<const charT*, Allocator>& m,
+                const basic_regex<charT, traits>& e,
+                regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class ST, class SA, class Allocator, class charT, class traits>
+    bool
+    regex_match(const basic_string<charT, ST, SA>& s,
+                match_results<typename basic_string<charT, ST, SA>::const_iterator, Allocator>& m,
+                const basic_regex<charT, traits>& e,
+                regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class ST, class SA, class Allocator, class charT, class traits>
+    bool
+    regex_match(const basic_string<charT, ST, SA>&& s,
+                match_results<typename basic_string<charT, ST, SA>::const_iterator, Allocator>& m,
+                const basic_regex<charT, traits>& e,
+                regex_constants::match_flag_type flags = regex_constants::match_default) = delete; // C++14
+
+template <class charT, class traits>
+    bool
+    regex_match(const charT* str, const basic_regex<charT, traits>& e,
+                regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class ST, class SA, class charT, class traits>
+    bool
+    regex_match(const basic_string<charT, ST, SA>& s,
+                const basic_regex<charT, traits>& e,
+                regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class BidirectionalIterator, class Allocator, class charT, class traits>
+    bool
+    regex_search(BidirectionalIterator first, BidirectionalIterator last,
+                 match_results<BidirectionalIterator, Allocator>& m,
+                 const basic_regex<charT, traits>& e,
+                 regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class BidirectionalIterator, class charT, class traits>
+    bool
+    regex_search(BidirectionalIterator first, BidirectionalIterator last,
+                 const basic_regex<charT, traits>& e,
+                 regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class charT, class Allocator, class traits>
+    bool
+    regex_search(const charT* str, match_results<const charT*, Allocator>& m,
+                 const basic_regex<charT, traits>& e,
+                 regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class charT, class traits>
+    bool
+    regex_search(const charT* str, const basic_regex<charT, traits>& e,
+                 regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class ST, class SA, class charT, class traits>
+    bool
+    regex_search(const basic_string<charT, ST, SA>& s,
+                 const basic_regex<charT, traits>& e,
+                 regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class ST, class SA, class Allocator, class charT, class traits>
+    bool
+    regex_search(const basic_string<charT, ST, SA>& s,
+                 match_results<typename basic_string<charT, ST, SA>::const_iterator, Allocator>& m,
+                 const basic_regex<charT, traits>& e,
+                 regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class ST, class SA, class Allocator, class charT, class traits>
+    bool
+    regex_search(const basic_string<charT, ST, SA>&& s,
+                 match_results<typename basic_string<charT, ST, SA>::const_iterator, Allocator>& m,
+                 const basic_regex<charT, traits>& e,
+                 regex_constants::match_flag_type flags = regex_constants::match_default) = delete; // C++14
+
+template <class OutputIterator, class BidirectionalIterator,
+          class traits, class charT, class ST, class SA>
+    OutputIterator
+    regex_replace(OutputIterator out,
+                  BidirectionalIterator first, BidirectionalIterator last,
+                  const basic_regex<charT, traits>& e,
+                  const basic_string<charT, ST, SA>& fmt,
+                  regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class OutputIterator, class BidirectionalIterator,
+          class traits, class charT>
+    OutputIterator
+    regex_replace(OutputIterator out,
+                  BidirectionalIterator first, BidirectionalIterator last,
+                  const basic_regex<charT, traits>& e, const charT* fmt,
+                  regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class traits, class charT, class ST, class SA, class FST, class FSA>
+    basic_string<charT, ST, SA>
+    regex_replace(const basic_string<charT, ST, SA>& s,
+                  const basic_regex<charT, traits>& e,
+                  const basic_string<charT, FST, FSA>& fmt,
+                  regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class traits, class charT, class ST, class SA>
+    basic_string<charT, ST, SA>
+    regex_replace(const basic_string<charT, ST, SA>& s,
+                  const basic_regex<charT, traits>& e, const charT* fmt,
+                  regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class traits, class charT, class ST, class SA>
+    basic_string<charT>
+    regex_replace(const charT* s,
+                  const basic_regex<charT, traits>& e,
+                  const basic_string<charT, ST, SA>& fmt,
+                  regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class traits, class charT>
+    basic_string<charT>
+    regex_replace(const charT* s,
+                  const basic_regex<charT, traits>& e,
+                  const charT* fmt,
+                  regex_constants::match_flag_type flags = regex_constants::match_default);
+
+template <class BidirectionalIterator,
+          class charT = typename iterator_traits< BidirectionalIterator>::value_type,
+          class traits = regex_traits<charT>>
+class regex_iterator
+{
+public:
+    typedef basic_regex<charT, traits>           regex_type;
+    typedef match_results<BidirectionalIterator> value_type;
+    typedef ptrdiff_t                            difference_type;
+    typedef const value_type*                    pointer;
+    typedef const value_type&                    reference;
+    typedef forward_iterator_tag                 iterator_category;
+
+    regex_iterator();
+    regex_iterator(BidirectionalIterator a, BidirectionalIterator b,
+                   const regex_type& re,
+                   regex_constants::match_flag_type m = regex_constants::match_default);
+    regex_iterator(BidirectionalIterator a, BidirectionalIterator b,
+                   const regex_type&& re,
+                   regex_constants::match_flag_type m
+                                     = regex_constants::match_default) = delete; // C++14
+    regex_iterator(const regex_iterator&);
+    regex_iterator& operator=(const regex_iterator&);
+
+    bool operator==(const regex_iterator&) const;
+    bool operator!=(const regex_iterator&) const;
+
+    const value_type& operator*() const;
+    const value_type* operator->() const;
+
+    regex_iterator& operator++();
+    regex_iterator operator++(int);
+};
+
+typedef regex_iterator<const char*>             cregex_iterator;
+typedef regex_iterator<const wchar_t*>          wcregex_iterator;
+typedef regex_iterator<string::const_iterator>  sregex_iterator;
+typedef regex_iterator<wstring::const_iterator> wsregex_iterator;
+
+template <class BidirectionalIterator,
+          class charT = typename iterator_traits<BidirectionalIterator>::value_type,
+          class traits = regex_traits<charT>>
+class regex_token_iterator
+{
+public:
+    typedef basic_regex<charT, traits>       regex_type;
+    typedef sub_match<BidirectionalIterator> value_type;
+    typedef ptrdiff_t                        difference_type;
+    typedef const value_type*                pointer;
+    typedef const value_type&                reference;
+    typedef forward_iterator_tag             iterator_category;
+
+    regex_token_iterator();
+    regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
+                         const regex_type& re, int submatch = 0,
+                         regex_constants::match_flag_type m = regex_constants::match_default);
+    regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
+                         const regex_type&& re, int submatch = 0,
+                         regex_constants::match_flag_type m = regex_constants::match_default) = delete; // C++14
+    regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
+                         const regex_type& re, const vector<int>& submatches,
+                         regex_constants::match_flag_type m = regex_constants::match_default);
+    regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
+                         const regex_type&& re, const vector<int>& submatches,
+                         regex_constants::match_flag_type m = regex_constants::match_default) = delete; // C++14
+    regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
+                         const regex_type& re, initializer_list<int> submatches,
+                         regex_constants::match_flag_type m = regex_constants::match_default);
+    regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
+                         const regex_type&& re, initializer_list<int> submatches,
+                         regex_constants::match_flag_type m = regex_constants::match_default) = delete; // C++14
+    template <size_t N>
+        regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
+                             const regex_type& re, const int (&submatches)[N],
+                             regex_constants::match_flag_type m = regex_constants::match_default);
+    template <size_t N>
+        regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
+                             const regex_type&& re, const int (&submatches)[N],
+                             regex_constants::match_flag_type m = regex_constants::match_default) = delete; // C++14
+    regex_token_iterator(const regex_token_iterator&);
+    regex_token_iterator& operator=(const regex_token_iterator&);
+
+    bool operator==(const regex_token_iterator&) const;
+    bool operator!=(const regex_token_iterator&) const;
+
+    const value_type& operator*() const;
+    const value_type* operator->() const;
+
+    regex_token_iterator& operator++();
+    regex_token_iterator operator++(int);
+};
+
+typedef regex_token_iterator<const char*>             cregex_token_iterator;
+typedef regex_token_iterator<const wchar_t*>          wcregex_token_iterator;
+typedef regex_token_iterator<string::const_iterator>  sregex_token_iterator;
+typedef regex_token_iterator<wstring::const_iterator> wsregex_token_iterator;
+
+} // std
+*/
+
+#include <__algorithm/find.h>
+#include <__algorithm/search.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__iterator/back_insert_iterator.h>
+#include <__iterator/wrap_iter.h>
+#include <__locale>
+#include <__memory_resource/polymorphic_allocator.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <__utility/swap.h>
+#include <cstring>
+#include <deque>
+#include <stdexcept>
+#include <string>
+#include <vector>
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+// [re.syn]
+#include <compare>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+#define _LIBCPP_REGEX_COMPLEXITY_FACTOR 4096
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+namespace regex_constants
+{
+
+// syntax_option_type
+
+enum syntax_option_type
+{
+    icase      = 1 << 0,
+    nosubs     = 1 << 1,
+    optimize   = 1 << 2,
+    collate    = 1 << 3,
+#ifdef _LIBCPP_ABI_REGEX_CONSTANTS_NONZERO
+    ECMAScript = 1 << 9,
+#else
+    ECMAScript = 0,
+#endif
+    basic      = 1 << 4,
+    extended   = 1 << 5,
+    awk        = 1 << 6,
+    grep       = 1 << 7,
+    egrep      = 1 << 8,
+    // 1 << 9 may be used by ECMAScript
+    multiline  = 1 << 10
+};
+
+_LIBCPP_HIDE_FROM_ABI inline _LIBCPP_CONSTEXPR
+syntax_option_type __get_grammar(syntax_option_type __g)
+{
+#ifdef _LIBCPP_ABI_REGEX_CONSTANTS_NONZERO
+    return static_cast<syntax_option_type>(__g & 0x3F0);
+#else
+    return static_cast<syntax_option_type>(__g & 0x1F0);
+#endif
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+syntax_option_type
+operator~(syntax_option_type __x)
+{
+    return syntax_option_type(~int(__x) & 0x1FF);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+syntax_option_type
+operator&(syntax_option_type __x, syntax_option_type __y)
+{
+    return syntax_option_type(int(__x) & int(__y));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+syntax_option_type
+operator|(syntax_option_type __x, syntax_option_type __y)
+{
+    return syntax_option_type(int(__x) | int(__y));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+syntax_option_type
+operator^(syntax_option_type __x, syntax_option_type __y)
+{
+    return syntax_option_type(int(__x) ^ int(__y));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+syntax_option_type&
+operator&=(syntax_option_type& __x, syntax_option_type __y)
+{
+    __x = __x & __y;
+    return __x;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+syntax_option_type&
+operator|=(syntax_option_type& __x, syntax_option_type __y)
+{
+    __x = __x | __y;
+    return __x;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+syntax_option_type&
+operator^=(syntax_option_type& __x, syntax_option_type __y)
+{
+    __x = __x ^ __y;
+    return __x;
+}
+
+// match_flag_type
+
+enum match_flag_type
+{
+    match_default     = 0,
+    match_not_bol     = 1 << 0,
+    match_not_eol     = 1 << 1,
+    match_not_bow     = 1 << 2,
+    match_not_eow     = 1 << 3,
+    match_any         = 1 << 4,
+    match_not_null    = 1 << 5,
+    match_continuous  = 1 << 6,
+    match_prev_avail  = 1 << 7,
+    format_default    = 0,
+    format_sed        = 1 << 8,
+    format_no_copy    = 1 << 9,
+    format_first_only = 1 << 10,
+    __no_update_pos   = 1 << 11,
+    __full_match      = 1 << 12
+};
+
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+match_flag_type
+operator~(match_flag_type __x)
+{
+    return match_flag_type(~int(__x) & 0x0FFF);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+match_flag_type
+operator&(match_flag_type __x, match_flag_type __y)
+{
+    return match_flag_type(int(__x) & int(__y));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+match_flag_type
+operator|(match_flag_type __x, match_flag_type __y)
+{
+    return match_flag_type(int(__x) | int(__y));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+_LIBCPP_CONSTEXPR
+match_flag_type
+operator^(match_flag_type __x, match_flag_type __y)
+{
+    return match_flag_type(int(__x) ^ int(__y));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+match_flag_type&
+operator&=(match_flag_type& __x, match_flag_type __y)
+{
+    __x = __x & __y;
+    return __x;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+match_flag_type&
+operator|=(match_flag_type& __x, match_flag_type __y)
+{
+    __x = __x | __y;
+    return __x;
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+match_flag_type&
+operator^=(match_flag_type& __x, match_flag_type __y)
+{
+    __x = __x ^ __y;
+    return __x;
+}
+
+enum error_type
+{
+    error_collate = 1,
+    error_ctype,
+    error_escape,
+    error_backref,
+    error_brack,
+    error_paren,
+    error_brace,
+    error_badbrace,
+    error_range,
+    error_space,
+    error_badrepeat,
+    error_complexity,
+    error_stack,
+    __re_err_grammar,
+    __re_err_empty,
+    __re_err_unknown,
+    __re_err_parse
+};
+
+} // namespace regex_constants
+
+class _LIBCPP_EXCEPTION_ABI regex_error
+    : public runtime_error
+{
+    regex_constants::error_type __code_;
+public:
+    explicit regex_error(regex_constants::error_type __ecode);
+    regex_error(const regex_error&) _NOEXCEPT = default;
+    ~regex_error() _NOEXCEPT override;
+    _LIBCPP_INLINE_VISIBILITY
+    regex_constants::error_type code() const {return __code_;}
+};
+
+template <regex_constants::error_type _Ev>
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_regex_error()
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw regex_error(_Ev);
+#else
+    _VSTD::abort();
+#endif
+}
+
+template <class _CharT>
+struct _LIBCPP_TEMPLATE_VIS regex_traits
+{
+public:
+    typedef _CharT                  char_type;
+    typedef basic_string<char_type> string_type;
+    typedef locale                  locale_type;
+#if defined(__BIONIC__) || defined(_NEWLIB_VERSION)
+    // Originally bionic's ctype_base used its own ctype masks because the
+    // builtin ctype implementation wasn't in libc++ yet. Bionic's ctype mask
+    // was only 8 bits wide and already saturated, so it used a wider type here
+    // to make room for __regex_word (then a part of this class rather than
+    // ctype_base). Bionic has since moved to the builtin ctype_base
+    // implementation, but this was not updated to match. Since then Android has
+    // needed to maintain a stable libc++ ABI, and this can't be changed without
+    // an ABI break.
+    // We also need this workaround for newlib since _NEWLIB_VERSION is not
+    // defined yet inside __config, so we can't set the
+    // _LIBCPP_PROVIDES_DEFAULT_RUNE_TABLE macro. Additionally, newlib is
+    // often used for space constrained environments, so it makes sense not to
+    // duplicate the ctype table.
+    typedef uint16_t char_class_type;
+#else
+    typedef ctype_base::mask        char_class_type;
+#endif
+
+    static const char_class_type __regex_word = ctype_base::__regex_word;
+private:
+    locale __loc_;
+    const ctype<char_type>* __ct_;
+    const collate<char_type>* __col_;
+
+public:
+    regex_traits();
+
+    _LIBCPP_INLINE_VISIBILITY
+    static size_t length(const char_type* __p)
+        {return char_traits<char_type>::length(__p);}
+    _LIBCPP_INLINE_VISIBILITY
+    char_type translate(char_type __c) const {return __c;}
+    char_type translate_nocase(char_type __c) const;
+    template <class _ForwardIterator>
+        string_type
+        transform(_ForwardIterator __f, _ForwardIterator __l) const;
+    template <class _ForwardIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        string_type
+        transform_primary( _ForwardIterator __f, _ForwardIterator __l) const
+            {return __transform_primary(__f, __l, char_type());}
+    template <class _ForwardIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        string_type
+        lookup_collatename(_ForwardIterator __f, _ForwardIterator __l) const
+            {return __lookup_collatename(__f, __l, char_type());}
+    template <class _ForwardIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        char_class_type
+        lookup_classname(_ForwardIterator __f, _ForwardIterator __l,
+                         bool __icase = false) const
+            {return __lookup_classname(__f, __l, __icase, char_type());}
+    bool isctype(char_type __c, char_class_type __m) const;
+    _LIBCPP_INLINE_VISIBILITY
+    int value(char_type __ch, int __radix) const
+        {return __regex_traits_value(__ch, __radix);}
+    locale_type imbue(locale_type __l);
+    _LIBCPP_INLINE_VISIBILITY
+    locale_type getloc()const {return __loc_;}
+
+private:
+    void __init();
+
+    template <class _ForwardIterator>
+        string_type
+        __transform_primary(_ForwardIterator __f, _ForwardIterator __l, char) const;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+    template <class _ForwardIterator>
+        string_type
+        __transform_primary(_ForwardIterator __f, _ForwardIterator __l, wchar_t) const;
+#endif
+    template <class _ForwardIterator>
+        string_type
+        __lookup_collatename(_ForwardIterator __f, _ForwardIterator __l, char) const;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+    template <class _ForwardIterator>
+        string_type
+        __lookup_collatename(_ForwardIterator __f, _ForwardIterator __l, wchar_t) const;
+#endif
+    template <class _ForwardIterator>
+        char_class_type
+        __lookup_classname(_ForwardIterator __f, _ForwardIterator __l,
+                           bool __icase, char) const;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+    template <class _ForwardIterator>
+        char_class_type
+        __lookup_classname(_ForwardIterator __f, _ForwardIterator __l,
+                           bool __icase, wchar_t) const;
+#endif
+
+    static int __regex_traits_value(unsigned char __ch, int __radix);
+    _LIBCPP_INLINE_VISIBILITY
+    int __regex_traits_value(char __ch, int __radix) const
+        {return __regex_traits_value(static_cast<unsigned char>(__ch), __radix);}
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+    _LIBCPP_INLINE_VISIBILITY
+    int __regex_traits_value(wchar_t __ch, int __radix) const;
+#endif
+};
+
+template <class _CharT>
+const typename regex_traits<_CharT>::char_class_type
+regex_traits<_CharT>::__regex_word;
+
+template <class _CharT>
+regex_traits<_CharT>::regex_traits()
+{
+    __init();
+}
+
+template <class _CharT>
+typename regex_traits<_CharT>::char_type
+regex_traits<_CharT>::translate_nocase(char_type __c) const
+{
+    return __ct_->tolower(__c);
+}
+
+template <class _CharT>
+template <class _ForwardIterator>
+typename regex_traits<_CharT>::string_type
+regex_traits<_CharT>::transform(_ForwardIterator __f, _ForwardIterator __l) const
+{
+    string_type __s(__f, __l);
+    return __col_->transform(__s.data(), __s.data() + __s.size());
+}
+
+template <class _CharT>
+void
+regex_traits<_CharT>::__init()
+{
+    __ct_ = &std::use_facet<ctype<char_type> >(__loc_);
+    __col_ = &std::use_facet<collate<char_type> >(__loc_);
+}
+
+template <class _CharT>
+typename regex_traits<_CharT>::locale_type
+regex_traits<_CharT>::imbue(locale_type __l)
+{
+    locale __r = __loc_;
+    __loc_ = __l;
+    __init();
+    return __r;
+}
+
+// transform_primary is very FreeBSD-specific
+
+template <class _CharT>
+template <class _ForwardIterator>
+typename regex_traits<_CharT>::string_type
+regex_traits<_CharT>::__transform_primary(_ForwardIterator __f,
+                                          _ForwardIterator __l, char) const
+{
+    const string_type __s(__f, __l);
+    string_type __d = __col_->transform(__s.data(), __s.data() + __s.size());
+    switch (__d.size())
+    {
+    case 1:
+        break;
+    case 12:
+        __d[11] = __d[3];
+        break;
+    default:
+        __d.clear();
+        break;
+    }
+    return __d;
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class _CharT>
+template <class _ForwardIterator>
+typename regex_traits<_CharT>::string_type
+regex_traits<_CharT>::__transform_primary(_ForwardIterator __f,
+                                          _ForwardIterator __l, wchar_t) const
+{
+    const string_type __s(__f, __l);
+    string_type __d = __col_->transform(__s.data(), __s.data() + __s.size());
+    switch (__d.size())
+    {
+    case 1:
+        break;
+    case 3:
+        __d[2] = __d[0];
+        break;
+    default:
+        __d.clear();
+        break;
+    }
+    return __d;
+}
+#endif
+
+// lookup_collatename is very FreeBSD-specific
+
+_LIBCPP_FUNC_VIS string __get_collation_name(const char* __s);
+
+template <class _CharT>
+template <class _ForwardIterator>
+typename regex_traits<_CharT>::string_type
+regex_traits<_CharT>::__lookup_collatename(_ForwardIterator __f,
+                                           _ForwardIterator __l, char) const
+{
+    string_type __s(__f, __l);
+    string_type __r;
+    if (!__s.empty())
+    {
+        __r = std::__get_collation_name(__s.c_str());
+        if (__r.empty() && __s.size() <= 2)
+        {
+            __r = __col_->transform(__s.data(), __s.data() + __s.size());
+            if (__r.size() == 1 || __r.size() == 12)
+                __r = __s;
+            else
+                __r.clear();
+        }
+    }
+    return __r;
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class _CharT>
+template <class _ForwardIterator>
+typename regex_traits<_CharT>::string_type
+regex_traits<_CharT>::__lookup_collatename(_ForwardIterator __f,
+                                           _ForwardIterator __l, wchar_t) const
+{
+    string_type __s(__f, __l);
+    string __n;
+    __n.reserve(__s.size());
+    for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end();
+                                                              __i != __e; ++__i)
+    {
+        if (static_cast<unsigned>(*__i) >= 127)
+            return string_type();
+        __n.push_back(char(*__i));
+    }
+    string_type __r;
+    if (!__s.empty())
+    {
+        __n = __get_collation_name(__n.c_str());
+        if (!__n.empty())
+            __r.assign(__n.begin(), __n.end());
+        else if (__s.size() <= 2)
+        {
+            __r = __col_->transform(__s.data(), __s.data() + __s.size());
+            if (__r.size() == 1 || __r.size() == 3)
+                __r = __s;
+            else
+                __r.clear();
+        }
+    }
+    return __r;
+}
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+// lookup_classname
+
+regex_traits<char>::char_class_type _LIBCPP_FUNC_VIS
+__get_classname(const char* __s, bool __icase);
+
+template <class _CharT>
+template <class _ForwardIterator>
+typename regex_traits<_CharT>::char_class_type
+regex_traits<_CharT>::__lookup_classname(_ForwardIterator __f,
+                                         _ForwardIterator __l,
+                                         bool __icase, char) const
+{
+    string_type __s(__f, __l);
+    __ct_->tolower(&__s[0], &__s[0] + __s.size());
+    return std::__get_classname(__s.c_str(), __icase);
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class _CharT>
+template <class _ForwardIterator>
+typename regex_traits<_CharT>::char_class_type
+regex_traits<_CharT>::__lookup_classname(_ForwardIterator __f,
+                                         _ForwardIterator __l,
+                                         bool __icase, wchar_t) const
+{
+    string_type __s(__f, __l);
+    __ct_->tolower(&__s[0], &__s[0] + __s.size());
+    string __n;
+    __n.reserve(__s.size());
+    for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end();
+                                                              __i != __e; ++__i)
+    {
+        if (static_cast<unsigned>(*__i) >= 127)
+            return char_class_type();
+        __n.push_back(char(*__i));
+    }
+    return __get_classname(__n.c_str(), __icase);
+}
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+template <class _CharT>
+bool
+regex_traits<_CharT>::isctype(char_type __c, char_class_type __m) const
+{
+    if (__ct_->is(__m, __c))
+        return true;
+    return (__c == '_' && (__m & __regex_word));
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool __is_07(unsigned char __c)
+{
+    return (__c & 0xF8u) ==
+#if defined(__MVS__) && !defined(__NATIVE_ASCII_F)
+        0xF0;
+#else
+        0x30;
+#endif
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool __is_89(unsigned char __c)
+{
+    return (__c & 0xFEu) ==
+#if defined(__MVS__) && !defined(__NATIVE_ASCII_F)
+        0xF8;
+#else
+        0x38;
+#endif
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+unsigned char __to_lower(unsigned char __c)
+{
+#if defined(__MVS__) && !defined(__NATIVE_ASCII_F)
+    return __c & 0xBF;
+#else
+    return __c | 0x20;
+#endif
+}
+
+template <class _CharT>
+int
+regex_traits<_CharT>::__regex_traits_value(unsigned char __ch, int __radix)
+{
+    if (__is_07(__ch))  // '0' <= __ch && __ch <= '7'
+        return __ch - '0';
+    if (__radix != 8)
+    {
+        if (__is_89(__ch))  // '8' <= __ch && __ch <= '9'
+            return __ch - '0';
+        if (__radix == 16)
+        {
+            __ch = __to_lower(__ch);  // tolower
+            if ('a' <= __ch && __ch <= 'f')
+                return __ch - ('a' - 10);
+        }
+    }
+    return -1;
+}
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class _CharT>
+inline
+int
+regex_traits<_CharT>::__regex_traits_value(wchar_t __ch, int __radix) const
+{
+    return __regex_traits_value(static_cast<unsigned char>(__ct_->narrow(__ch, char_type())), __radix);
+}
+#endif
+
+template <class _CharT> class __node;
+
+template <class _BidirectionalIterator> class _LIBCPP_TEMPLATE_VIS sub_match;
+
+template <class _BidirectionalIterator,
+          class _Allocator = allocator<sub_match<_BidirectionalIterator> > >
+class _LIBCPP_TEMPLATE_VIS match_results;
+
+template <class _CharT>
+struct __state
+{
+    enum
+    {
+        __end_state = -1000,
+        __consume_input,  // -999
+        __begin_marked_expr, // -998
+        __end_marked_expr,   // -997
+        __pop_state,           // -996
+        __accept_and_consume,  // -995
+        __accept_but_not_consume,  // -994
+        __reject,                  // -993
+        __split,
+        __repeat
+    };
+
+    int __do_;
+    const _CharT* __first_;
+    const _CharT* __current_;
+    const _CharT* __last_;
+    vector<sub_match<const _CharT*> > __sub_matches_;
+    vector<pair<size_t, const _CharT*> > __loop_data_;
+    const __node<_CharT>* __node_;
+    regex_constants::match_flag_type __flags_;
+    bool __at_first_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __state()
+        : __do_(0), __first_(nullptr), __current_(nullptr), __last_(nullptr),
+          __node_(nullptr), __flags_() {}
+};
+
+// __node
+
+template <class _CharT>
+class __node
+{
+    __node(const __node&);
+    __node& operator=(const __node&);
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __node() {}
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL
+    virtual ~__node() {}
+
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL
+    virtual void __exec(__state&) const {}
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL
+    virtual void __exec_split(bool, __state&) const {}
+};
+
+// __end_state
+
+template <class _CharT>
+class __end_state
+    : public __node<_CharT>
+{
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __end_state() {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT>
+void
+__end_state<_CharT>::__exec(__state& __s) const
+{
+    __s.__do_ = __state::__end_state;
+}
+
+// __has_one_state
+
+template <class _CharT>
+class __has_one_state
+    : public __node<_CharT>
+{
+    __node<_CharT>* __first_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __has_one_state(__node<_CharT>* __s)
+        : __first_(__s) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __node<_CharT>*  first() const {return __first_;}
+    _LIBCPP_INLINE_VISIBILITY
+    __node<_CharT>*& first()       {return __first_;}
+};
+
+// __owns_one_state
+
+template <class _CharT>
+class __owns_one_state
+    : public __has_one_state<_CharT>
+{
+    typedef __has_one_state<_CharT> base;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __owns_one_state(__node<_CharT>* __s)
+        : base(__s) {}
+
+    ~__owns_one_state() override;
+};
+
+template <class _CharT>
+__owns_one_state<_CharT>::~__owns_one_state()
+{
+    delete this->first();
+}
+
+// __empty_state
+
+template <class _CharT>
+class __empty_state
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __empty_state(__node<_CharT>* __s)
+        : base(__s) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT>
+void
+__empty_state<_CharT>::__exec(__state& __s) const
+{
+    __s.__do_ = __state::__accept_but_not_consume;
+    __s.__node_ = this->first();
+}
+
+// __empty_non_own_state
+
+template <class _CharT>
+class __empty_non_own_state
+    : public __has_one_state<_CharT>
+{
+    typedef __has_one_state<_CharT> base;
+
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __empty_non_own_state(__node<_CharT>* __s)
+        : base(__s) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT>
+void
+__empty_non_own_state<_CharT>::__exec(__state& __s) const
+{
+    __s.__do_ = __state::__accept_but_not_consume;
+    __s.__node_ = this->first();
+}
+
+// __repeat_one_loop
+
+template <class _CharT>
+class __repeat_one_loop
+    : public __has_one_state<_CharT>
+{
+    typedef __has_one_state<_CharT> base;
+
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __repeat_one_loop(__node<_CharT>* __s)
+        : base(__s) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT>
+void
+__repeat_one_loop<_CharT>::__exec(__state& __s) const
+{
+    __s.__do_ = __state::__repeat;
+    __s.__node_ = this->first();
+}
+
+// __owns_two_states
+
+template <class _CharT>
+class __owns_two_states
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    base* __second_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __owns_two_states(__node<_CharT>* __s1, base* __s2)
+        : base(__s1), __second_(__s2) {}
+
+    virtual ~__owns_two_states();
+
+    _LIBCPP_INLINE_VISIBILITY
+    base*  second() const {return __second_;}
+    _LIBCPP_INLINE_VISIBILITY
+    base*& second()       {return __second_;}
+};
+
+template <class _CharT>
+__owns_two_states<_CharT>::~__owns_two_states()
+{
+    delete __second_;
+}
+
+// __loop
+
+template <class _CharT>
+class __loop
+    : public __owns_two_states<_CharT>
+{
+    typedef __owns_two_states<_CharT> base;
+
+    size_t __min_;
+    size_t __max_;
+    unsigned __loop_id_;
+    unsigned __mexp_begin_;
+    unsigned __mexp_end_;
+    bool __greedy_;
+
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __loop(unsigned __loop_id,
+                          __node<_CharT>* __s1, __owns_one_state<_CharT>* __s2,
+                          unsigned __mexp_begin, unsigned __mexp_end,
+                          bool __greedy = true,
+                          size_t __min = 0,
+                          size_t __max = numeric_limits<size_t>::max())
+        : base(__s1, __s2), __min_(__min), __max_(__max), __loop_id_(__loop_id),
+          __mexp_begin_(__mexp_begin), __mexp_end_(__mexp_end),
+          __greedy_(__greedy) {}
+
+    virtual void __exec(__state& __s) const;
+    virtual void __exec_split(bool __second, __state& __s) const;
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    void __init_repeat(__state& __s) const
+    {
+        __s.__loop_data_[__loop_id_].second = __s.__current_;
+        for (size_t __i = __mexp_begin_-1; __i != __mexp_end_-1; ++__i)
+        {
+            __s.__sub_matches_[__i].first = __s.__last_;
+            __s.__sub_matches_[__i].second = __s.__last_;
+            __s.__sub_matches_[__i].matched = false;
+        }
+    }
+};
+
+template <class _CharT>
+void
+__loop<_CharT>::__exec(__state& __s) const
+{
+    if (__s.__do_ == __state::__repeat)
+    {
+        bool __do_repeat = ++__s.__loop_data_[__loop_id_].first < __max_;
+        bool __do_alt = __s.__loop_data_[__loop_id_].first >= __min_;
+        if (__do_repeat && __do_alt &&
+                               __s.__loop_data_[__loop_id_].second == __s.__current_)
+            __do_repeat = false;
+        if (__do_repeat && __do_alt)
+            __s.__do_ = __state::__split;
+        else if (__do_repeat)
+        {
+            __s.__do_ = __state::__accept_but_not_consume;
+            __s.__node_ = this->first();
+            __init_repeat(__s);
+        }
+        else
+        {
+            __s.__do_ = __state::__accept_but_not_consume;
+            __s.__node_ = this->second();
+        }
+    }
+    else
+    {
+        __s.__loop_data_[__loop_id_].first = 0;
+        bool __do_repeat = 0 < __max_;
+        bool __do_alt = 0 >= __min_;
+        if (__do_repeat && __do_alt)
+            __s.__do_ = __state::__split;
+        else if (__do_repeat)
+        {
+            __s.__do_ = __state::__accept_but_not_consume;
+            __s.__node_ = this->first();
+            __init_repeat(__s);
+        }
+        else
+        {
+            __s.__do_ = __state::__accept_but_not_consume;
+            __s.__node_ = this->second();
+        }
+    }
+}
+
+template <class _CharT>
+void
+__loop<_CharT>::__exec_split(bool __second, __state& __s) const
+{
+    __s.__do_ = __state::__accept_but_not_consume;
+    if (__greedy_ != __second)
+    {
+        __s.__node_ = this->first();
+        __init_repeat(__s);
+    }
+    else
+        __s.__node_ = this->second();
+}
+
+// __alternate
+
+template <class _CharT>
+class __alternate
+    : public __owns_two_states<_CharT>
+{
+    typedef __owns_two_states<_CharT> base;
+
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __alternate(__owns_one_state<_CharT>* __s1,
+                         __owns_one_state<_CharT>* __s2)
+        : base(__s1, __s2) {}
+
+    virtual void __exec(__state& __s) const;
+    virtual void __exec_split(bool __second, __state& __s) const;
+};
+
+template <class _CharT>
+void
+__alternate<_CharT>::__exec(__state& __s) const
+{
+    __s.__do_ = __state::__split;
+}
+
+template <class _CharT>
+void
+__alternate<_CharT>::__exec_split(bool __second, __state& __s) const
+{
+    __s.__do_ = __state::__accept_but_not_consume;
+    if (__second)
+        __s.__node_ = this->second();
+    else
+        __s.__node_ = this->first();
+}
+
+// __begin_marked_subexpression
+
+template <class _CharT>
+class __begin_marked_subexpression
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    unsigned __mexp_;
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __begin_marked_subexpression(unsigned __mexp, __node<_CharT>* __s)
+        : base(__s), __mexp_(__mexp) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT>
+void
+__begin_marked_subexpression<_CharT>::__exec(__state& __s) const
+{
+    __s.__do_ = __state::__accept_but_not_consume;
+    __s.__sub_matches_[__mexp_-1].first = __s.__current_;
+    __s.__node_ = this->first();
+}
+
+// __end_marked_subexpression
+
+template <class _CharT>
+class __end_marked_subexpression
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    unsigned __mexp_;
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __end_marked_subexpression(unsigned __mexp, __node<_CharT>* __s)
+        : base(__s), __mexp_(__mexp) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT>
+void
+__end_marked_subexpression<_CharT>::__exec(__state& __s) const
+{
+    __s.__do_ = __state::__accept_but_not_consume;
+    __s.__sub_matches_[__mexp_-1].second = __s.__current_;
+    __s.__sub_matches_[__mexp_-1].matched = true;
+    __s.__node_ = this->first();
+}
+
+// __back_ref
+
+template <class _CharT>
+class __back_ref
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    unsigned __mexp_;
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __back_ref(unsigned __mexp, __node<_CharT>* __s)
+        : base(__s), __mexp_(__mexp) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT>
+void
+__back_ref<_CharT>::__exec(__state& __s) const
+{
+    if (__mexp_ > __s.__sub_matches_.size())
+        __throw_regex_error<regex_constants::error_backref>();
+    sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_-1];
+    if (__sm.matched)
+    {
+        ptrdiff_t __len = __sm.second - __sm.first;
+        if (__s.__last_ - __s.__current_ >= __len &&
+            _VSTD::equal(__sm.first, __sm.second, __s.__current_))
+        {
+            __s.__do_ = __state::__accept_but_not_consume;
+            __s.__current_ += __len;
+            __s.__node_ = this->first();
+        }
+        else
+        {
+            __s.__do_ = __state::__reject;
+            __s.__node_ = nullptr;
+        }
+    }
+    else
+    {
+        __s.__do_ = __state::__reject;
+        __s.__node_ = nullptr;
+    }
+}
+
+// __back_ref_icase
+
+template <class _CharT, class _Traits>
+class __back_ref_icase
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    _Traits __traits_;
+    unsigned __mexp_;
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __back_ref_icase(const _Traits& __traits, unsigned __mexp,
+                              __node<_CharT>* __s)
+        : base(__s), __traits_(__traits), __mexp_(__mexp) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT, class _Traits>
+void
+__back_ref_icase<_CharT, _Traits>::__exec(__state& __s) const
+{
+    sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_-1];
+    if (__sm.matched)
+    {
+        ptrdiff_t __len = __sm.second - __sm.first;
+        if (__s.__last_ - __s.__current_ >= __len)
+        {
+            for (ptrdiff_t __i = 0; __i < __len; ++__i)
+            {
+                if (__traits_.translate_nocase(__sm.first[__i]) !=
+                                __traits_.translate_nocase(__s.__current_[__i]))
+                    goto __not_equal;
+            }
+            __s.__do_ = __state::__accept_but_not_consume;
+            __s.__current_ += __len;
+            __s.__node_ = this->first();
+        }
+        else
+        {
+            __s.__do_ = __state::__reject;
+            __s.__node_ = nullptr;
+        }
+    }
+    else
+    {
+__not_equal:
+        __s.__do_ = __state::__reject;
+        __s.__node_ = nullptr;
+    }
+}
+
+// __back_ref_collate
+
+template <class _CharT, class _Traits>
+class __back_ref_collate
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    _Traits __traits_;
+    unsigned __mexp_;
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __back_ref_collate(const _Traits& __traits, unsigned __mexp,
+                              __node<_CharT>* __s)
+        : base(__s), __traits_(__traits), __mexp_(__mexp) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT, class _Traits>
+void
+__back_ref_collate<_CharT, _Traits>::__exec(__state& __s) const
+{
+    sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_-1];
+    if (__sm.matched)
+    {
+        ptrdiff_t __len = __sm.second - __sm.first;
+        if (__s.__last_ - __s.__current_ >= __len)
+        {
+            for (ptrdiff_t __i = 0; __i < __len; ++__i)
+            {
+                if (__traits_.translate(__sm.first[__i]) !=
+                                       __traits_.translate(__s.__current_[__i]))
+                    goto __not_equal;
+            }
+            __s.__do_ = __state::__accept_but_not_consume;
+            __s.__current_ += __len;
+            __s.__node_ = this->first();
+        }
+        else
+        {
+            __s.__do_ = __state::__reject;
+            __s.__node_ = nullptr;
+        }
+    }
+    else
+    {
+__not_equal:
+        __s.__do_ = __state::__reject;
+        __s.__node_ = nullptr;
+    }
+}
+
+// __word_boundary
+
+template <class _CharT, class _Traits>
+class __word_boundary
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    _Traits __traits_;
+    bool __invert_;
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __word_boundary(const _Traits& __traits, bool __invert,
+                             __node<_CharT>* __s)
+        : base(__s), __traits_(__traits), __invert_(__invert) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT, class _Traits>
+void
+__word_boundary<_CharT, _Traits>::__exec(__state& __s) const
+{
+    bool __is_word_b = false;
+    if (__s.__first_ != __s.__last_)
+    {
+        if (__s.__current_ == __s.__last_)
+        {
+            if (!(__s.__flags_ & regex_constants::match_not_eow))
+            {
+                _CharT __c = __s.__current_[-1];
+                __is_word_b = __c == '_' ||
+                              __traits_.isctype(__c, ctype_base::alnum);
+            }
+        }
+        else if (__s.__current_ == __s.__first_ &&
+                !(__s.__flags_ & regex_constants::match_prev_avail))
+        {
+            if (!(__s.__flags_ & regex_constants::match_not_bow))
+            {
+                _CharT __c = *__s.__current_;
+                __is_word_b = __c == '_' ||
+                              __traits_.isctype(__c, ctype_base::alnum);
+            }
+        }
+        else
+        {
+            _CharT __c1 = __s.__current_[-1];
+            _CharT __c2 = *__s.__current_;
+            bool __is_c1_b = __c1 == '_' ||
+                             __traits_.isctype(__c1, ctype_base::alnum);
+            bool __is_c2_b = __c2 == '_' ||
+                             __traits_.isctype(__c2, ctype_base::alnum);
+            __is_word_b = __is_c1_b != __is_c2_b;
+        }
+    }
+    if (__is_word_b != __invert_)
+    {
+        __s.__do_ = __state::__accept_but_not_consume;
+        __s.__node_ = this->first();
+    }
+    else
+    {
+        __s.__do_ = __state::__reject;
+        __s.__node_ = nullptr;
+    }
+}
+
+// __l_anchor
+
+template <class _CharT>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+bool __is_eol(_CharT __c)
+{
+    return __c == '\r' || __c == '\n';
+}
+
+template <class _CharT>
+class __l_anchor_multiline
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    bool __multiline_;
+
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __l_anchor_multiline(bool __multiline, __node<_CharT>* __s)
+        : base(__s), __multiline_(__multiline) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT>
+void
+__l_anchor_multiline<_CharT>::__exec(__state& __s) const
+{
+    if (__s.__at_first_ && __s.__current_ == __s.__first_ &&
+        !(__s.__flags_ & regex_constants::match_not_bol))
+    {
+        __s.__do_ = __state::__accept_but_not_consume;
+        __s.__node_ = this->first();
+    }
+    else if (__multiline_ &&
+             !__s.__at_first_ &&
+             std::__is_eol(*_VSTD::prev(__s.__current_)))
+    {
+        __s.__do_ = __state::__accept_but_not_consume;
+        __s.__node_ = this->first();
+    }
+    else
+    {
+        __s.__do_ = __state::__reject;
+        __s.__node_ = nullptr;
+    }
+}
+
+// __r_anchor
+
+template <class _CharT>
+class __r_anchor_multiline
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    bool __multiline_;
+
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __r_anchor_multiline(bool __multiline, __node<_CharT>* __s)
+        : base(__s), __multiline_(__multiline) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT>
+void
+__r_anchor_multiline<_CharT>::__exec(__state& __s) const
+{
+    if (__s.__current_ == __s.__last_ &&
+        !(__s.__flags_ & regex_constants::match_not_eol))
+    {
+        __s.__do_ = __state::__accept_but_not_consume;
+        __s.__node_ = this->first();
+    }
+    else if (__multiline_ && std::__is_eol(*__s.__current_))
+    {
+        __s.__do_ = __state::__accept_but_not_consume;
+        __s.__node_ = this->first();
+    }
+    else
+    {
+        __s.__do_ = __state::__reject;
+        __s.__node_ = nullptr;
+    }
+}
+
+// __match_any
+
+template <class _CharT>
+class __match_any
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __match_any(__node<_CharT>* __s)
+        : base(__s) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT>
+void
+__match_any<_CharT>::__exec(__state& __s) const
+{
+    if (__s.__current_ != __s.__last_ && *__s.__current_ != 0)
+    {
+        __s.__do_ = __state::__accept_and_consume;
+        ++__s.__current_;
+        __s.__node_ = this->first();
+    }
+    else
+    {
+        __s.__do_ = __state::__reject;
+        __s.__node_ = nullptr;
+    }
+}
+
+// __match_any_but_newline
+
+template <class _CharT>
+class __match_any_but_newline
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __match_any_but_newline(__node<_CharT>* __s)
+        : base(__s) {}
+
+    void __exec(__state&) const override;
+};
+
+template <> _LIBCPP_FUNC_VIS void __match_any_but_newline<char>::__exec(__state&) const;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <> _LIBCPP_FUNC_VIS void __match_any_but_newline<wchar_t>::__exec(__state&) const;
+#endif
+
+// __match_char
+
+template <class _CharT>
+class __match_char
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    _CharT __c_;
+
+    __match_char(const __match_char&);
+    __match_char& operator=(const __match_char&);
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __match_char(_CharT __c, __node<_CharT>* __s)
+        : base(__s), __c_(__c) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT>
+void
+__match_char<_CharT>::__exec(__state& __s) const
+{
+    if (__s.__current_ != __s.__last_ && *__s.__current_ == __c_)
+    {
+        __s.__do_ = __state::__accept_and_consume;
+        ++__s.__current_;
+        __s.__node_ = this->first();
+    }
+    else
+    {
+        __s.__do_ = __state::__reject;
+        __s.__node_ = nullptr;
+    }
+}
+
+// __match_char_icase
+
+template <class _CharT, class _Traits>
+class __match_char_icase
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    _Traits __traits_;
+    _CharT __c_;
+
+    __match_char_icase(const __match_char_icase&);
+    __match_char_icase& operator=(const __match_char_icase&);
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __match_char_icase(const _Traits& __traits, _CharT __c, __node<_CharT>* __s)
+        : base(__s), __traits_(__traits), __c_(__traits.translate_nocase(__c)) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT, class _Traits>
+void
+__match_char_icase<_CharT, _Traits>::__exec(__state& __s) const
+{
+    if (__s.__current_ != __s.__last_ &&
+        __traits_.translate_nocase(*__s.__current_) == __c_)
+    {
+        __s.__do_ = __state::__accept_and_consume;
+        ++__s.__current_;
+        __s.__node_ = this->first();
+    }
+    else
+    {
+        __s.__do_ = __state::__reject;
+        __s.__node_ = nullptr;
+    }
+}
+
+// __match_char_collate
+
+template <class _CharT, class _Traits>
+class __match_char_collate
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    _Traits __traits_;
+    _CharT __c_;
+
+    __match_char_collate(const __match_char_collate&);
+    __match_char_collate& operator=(const __match_char_collate&);
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __match_char_collate(const _Traits& __traits, _CharT __c, __node<_CharT>* __s)
+        : base(__s), __traits_(__traits), __c_(__traits.translate(__c)) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT, class _Traits>
+void
+__match_char_collate<_CharT, _Traits>::__exec(__state& __s) const
+{
+    if (__s.__current_ != __s.__last_ &&
+        __traits_.translate(*__s.__current_) == __c_)
+    {
+        __s.__do_ = __state::__accept_and_consume;
+        ++__s.__current_;
+        __s.__node_ = this->first();
+    }
+    else
+    {
+        __s.__do_ = __state::__reject;
+        __s.__node_ = nullptr;
+    }
+}
+
+// __bracket_expression
+
+template <class _CharT, class _Traits>
+class __bracket_expression
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+    typedef typename _Traits::string_type string_type;
+
+    _Traits __traits_;
+    vector<_CharT> __chars_;
+    vector<_CharT> __neg_chars_;
+    vector<pair<string_type, string_type> > __ranges_;
+    vector<pair<_CharT, _CharT> > __digraphs_;
+    vector<string_type> __equivalences_;
+    typename regex_traits<_CharT>::char_class_type __mask_;
+    typename regex_traits<_CharT>::char_class_type __neg_mask_;
+    bool __negate_;
+    bool __icase_;
+    bool __collate_;
+    bool __might_have_digraph_;
+
+    __bracket_expression(const __bracket_expression&);
+    __bracket_expression& operator=(const __bracket_expression&);
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __bracket_expression(const _Traits& __traits, __node<_CharT>* __s,
+                                 bool __negate, bool __icase, bool __collate)
+        : base(__s), __traits_(__traits), __mask_(), __neg_mask_(),
+          __negate_(__negate), __icase_(__icase), __collate_(__collate),
+          __might_have_digraph_(__traits_.getloc().name() != "C") {}
+
+    virtual void __exec(__state&) const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool __negated() const {return __negate_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __add_char(_CharT __c)
+        {
+            if (__icase_)
+                __chars_.push_back(__traits_.translate_nocase(__c));
+            else if (__collate_)
+                __chars_.push_back(__traits_.translate(__c));
+            else
+                __chars_.push_back(__c);
+        }
+    _LIBCPP_INLINE_VISIBILITY
+    void __add_neg_char(_CharT __c)
+        {
+            if (__icase_)
+                __neg_chars_.push_back(__traits_.translate_nocase(__c));
+            else if (__collate_)
+                __neg_chars_.push_back(__traits_.translate(__c));
+            else
+                __neg_chars_.push_back(__c);
+        }
+    _LIBCPP_INLINE_VISIBILITY
+    void __add_range(string_type __b, string_type __e)
+        {
+            if (__collate_)
+            {
+                if (__icase_)
+                {
+                    for (size_t __i = 0; __i < __b.size(); ++__i)
+                        __b[__i] = __traits_.translate_nocase(__b[__i]);
+                    for (size_t __i = 0; __i < __e.size(); ++__i)
+                        __e[__i] = __traits_.translate_nocase(__e[__i]);
+                }
+                else
+                {
+                    for (size_t __i = 0; __i < __b.size(); ++__i)
+                        __b[__i] = __traits_.translate(__b[__i]);
+                    for (size_t __i = 0; __i < __e.size(); ++__i)
+                        __e[__i] = __traits_.translate(__e[__i]);
+                }
+                __ranges_.push_back(std::make_pair(
+                                  __traits_.transform(__b.begin(), __b.end()),
+                                  __traits_.transform(__e.begin(), __e.end())));
+            }
+            else
+            {
+                if (__b.size() != 1 || __e.size() != 1)
+                    __throw_regex_error<regex_constants::error_range>();
+                if (__icase_)
+                {
+                    __b[0] = __traits_.translate_nocase(__b[0]);
+                    __e[0] = __traits_.translate_nocase(__e[0]);
+                }
+                __ranges_.push_back(std::make_pair(_VSTD::move(__b), _VSTD::move(__e)));
+            }
+        }
+    _LIBCPP_INLINE_VISIBILITY
+    void __add_digraph(_CharT __c1, _CharT __c2)
+        {
+            if (__icase_)
+                __digraphs_.push_back(std::make_pair(__traits_.translate_nocase(__c1),
+                                                     __traits_.translate_nocase(__c2)));
+            else if (__collate_)
+                __digraphs_.push_back(std::make_pair(__traits_.translate(__c1),
+                                                     __traits_.translate(__c2)));
+            else
+                __digraphs_.push_back(std::make_pair(__c1, __c2));
+        }
+    _LIBCPP_INLINE_VISIBILITY
+    void __add_equivalence(const string_type& __s)
+        {__equivalences_.push_back(__s);}
+    _LIBCPP_INLINE_VISIBILITY
+    void __add_class(typename regex_traits<_CharT>::char_class_type __mask)
+        {__mask_ |= __mask;}
+    _LIBCPP_INLINE_VISIBILITY
+    void __add_neg_class(typename regex_traits<_CharT>::char_class_type __mask)
+        {__neg_mask_ |= __mask;}
+};
+
+template <class _CharT, class _Traits>
+void
+__bracket_expression<_CharT, _Traits>::__exec(__state& __s) const
+{
+    bool __found = false;
+    unsigned __consumed = 0;
+    if (__s.__current_ != __s.__last_)
+    {
+        ++__consumed;
+        if (__might_have_digraph_)
+        {
+            const _CharT* __next = _VSTD::next(__s.__current_);
+            if (__next != __s.__last_)
+            {
+                pair<_CharT, _CharT> __ch2(*__s.__current_, *__next);
+                if (__icase_)
+                {
+                    __ch2.first = __traits_.translate_nocase(__ch2.first);
+                    __ch2.second = __traits_.translate_nocase(__ch2.second);
+                }
+                else if (__collate_)
+                {
+                    __ch2.first = __traits_.translate(__ch2.first);
+                    __ch2.second = __traits_.translate(__ch2.second);
+                }
+                if (!__traits_.lookup_collatename(&__ch2.first, &__ch2.first+2).empty())
+                {
+                    // __ch2 is a digraph in this locale
+                    ++__consumed;
+                    for (size_t __i = 0; __i < __digraphs_.size(); ++__i)
+                    {
+                        if (__ch2 == __digraphs_[__i])
+                        {
+                            __found = true;
+                            goto __exit;
+                        }
+                    }
+                    if (__collate_ && !__ranges_.empty())
+                    {
+                        string_type __s2 = __traits_.transform(&__ch2.first,
+                                                               &__ch2.first + 2);
+                        for (size_t __i = 0; __i < __ranges_.size(); ++__i)
+                        {
+                            if (__ranges_[__i].first <= __s2 &&
+                                __s2 <= __ranges_[__i].second)
+                            {
+                                __found = true;
+                                goto __exit;
+                            }
+                        }
+                    }
+                    if (!__equivalences_.empty())
+                    {
+                        string_type __s2 = __traits_.transform_primary(&__ch2.first,
+                                                                       &__ch2.first + 2);
+                        for (size_t __i = 0; __i < __equivalences_.size(); ++__i)
+                        {
+                            if (__s2 == __equivalences_[__i])
+                            {
+                                __found = true;
+                                goto __exit;
+                            }
+                        }
+                    }
+                    if (__traits_.isctype(__ch2.first, __mask_) &&
+                        __traits_.isctype(__ch2.second, __mask_))
+                    {
+                        __found = true;
+                        goto __exit;
+                    }
+                    if (!__traits_.isctype(__ch2.first, __neg_mask_) &&
+                        !__traits_.isctype(__ch2.second, __neg_mask_))
+                    {
+                        __found = true;
+                        goto __exit;
+                    }
+                    goto __exit;
+                }
+            }
+        }
+        // test *__s.__current_ as not a digraph
+        _CharT __ch = *__s.__current_;
+        if (__icase_)
+            __ch = __traits_.translate_nocase(__ch);
+        else if (__collate_)
+            __ch = __traits_.translate(__ch);
+        for (size_t __i = 0; __i < __chars_.size(); ++__i)
+        {
+            if (__ch == __chars_[__i])
+            {
+                __found = true;
+                goto __exit;
+            }
+        }
+        // When there's at least one of __neg_chars_ and __neg_mask_, the set
+        // of "__found" chars is
+        //   union(complement(union(__neg_chars_, __neg_mask_)),
+        //         other cases...)
+        //
+        // It doesn't make sense to check this when there are no __neg_chars_
+        // and no __neg_mask_.
+        if (!(__neg_mask_ == 0 && __neg_chars_.empty()))
+        {
+            const bool __in_neg_mask = __traits_.isctype(__ch, __neg_mask_);
+          const bool __in_neg_chars =
+              _VSTD::find(__neg_chars_.begin(), __neg_chars_.end(), __ch) !=
+              __neg_chars_.end();
+          if (!(__in_neg_mask || __in_neg_chars))
+          {
+            __found = true;
+            goto __exit;
+          }
+        }
+        if (!__ranges_.empty())
+        {
+            string_type __s2 = __collate_ ?
+                                   __traits_.transform(&__ch, &__ch + 1) :
+                                   string_type(1, __ch);
+            for (size_t __i = 0; __i < __ranges_.size(); ++__i)
+            {
+                if (__ranges_[__i].first <= __s2 && __s2 <= __ranges_[__i].second)
+                {
+                    __found = true;
+                    goto __exit;
+                }
+            }
+        }
+        if (!__equivalences_.empty())
+        {
+            string_type __s2 = __traits_.transform_primary(&__ch, &__ch + 1);
+            for (size_t __i = 0; __i < __equivalences_.size(); ++__i)
+            {
+                if (__s2 == __equivalences_[__i])
+                {
+                    __found = true;
+                    goto __exit;
+                }
+            }
+        }
+        if (__traits_.isctype(__ch, __mask_))
+        {
+            __found = true;
+            goto __exit;
+        }
+    }
+    else
+        __found = __negate_;  // force reject
+__exit:
+    if (__found != __negate_)
+    {
+        __s.__do_ = __state::__accept_and_consume;
+        __s.__current_ += __consumed;
+        __s.__node_ = this->first();
+    }
+    else
+    {
+        __s.__do_ = __state::__reject;
+        __s.__node_ = nullptr;
+    }
+}
+
+template <class _CharT, class _Traits> class __lookahead;
+
+template <class _CharT, class _Traits = regex_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS basic_regex;
+
+typedef basic_regex<char>    regex;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+typedef basic_regex<wchar_t> wregex;
+#endif
+
+template <class _CharT, class _Traits>
+class
+    _LIBCPP_TEMPLATE_VIS
+    _LIBCPP_PREFERRED_NAME(regex)
+    _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wregex))
+    basic_regex
+{
+public:
+    // types:
+    typedef _CharT                              value_type;
+    typedef _Traits                             traits_type;
+    typedef typename _Traits::string_type       string_type;
+    typedef regex_constants::syntax_option_type flag_type;
+    typedef typename _Traits::locale_type       locale_type;
+
+private:
+    _Traits   __traits_;
+    flag_type __flags_;
+    unsigned __marked_count_;
+    unsigned __loop_count_;
+    int __open_count_;
+    shared_ptr<__empty_state<_CharT> > __start_;
+    __owns_one_state<_CharT>* __end_;
+
+    typedef _VSTD::__state<_CharT> __state;
+    typedef _VSTD::__node<_CharT> __node;
+
+public:
+    // constants:
+    static const regex_constants::syntax_option_type icase = regex_constants::icase;
+    static const regex_constants::syntax_option_type nosubs = regex_constants::nosubs;
+    static const regex_constants::syntax_option_type optimize = regex_constants::optimize;
+    static const regex_constants::syntax_option_type collate = regex_constants::collate;
+    static const regex_constants::syntax_option_type ECMAScript = regex_constants::ECMAScript;
+    static const regex_constants::syntax_option_type basic = regex_constants::basic;
+    static const regex_constants::syntax_option_type extended = regex_constants::extended;
+    static const regex_constants::syntax_option_type awk = regex_constants::awk;
+    static const regex_constants::syntax_option_type grep = regex_constants::grep;
+    static const regex_constants::syntax_option_type egrep = regex_constants::egrep;
+    static const regex_constants::syntax_option_type multiline = regex_constants::multiline;
+
+    // construct/copy/destroy:
+    _LIBCPP_INLINE_VISIBILITY
+    basic_regex()
+        : __flags_(regex_constants::ECMAScript), __marked_count_(0), __loop_count_(0), __open_count_(0),
+          __end_(nullptr)
+        {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_regex(const value_type* __p, flag_type __f = regex_constants::ECMAScript)
+        : __flags_(__f), __marked_count_(0), __loop_count_(0), __open_count_(0),
+          __end_(nullptr)
+        {
+        __init(__p, __p + __traits_.length(__p));
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_regex(const value_type* __p, size_t __len, flag_type __f = regex_constants::ECMAScript)
+        : __flags_(__f), __marked_count_(0), __loop_count_(0), __open_count_(0),
+          __end_(nullptr)
+        {
+        __init(__p, __p + __len);
+        }
+
+//     basic_regex(const basic_regex&) = default;
+//     basic_regex(basic_regex&&) = default;
+    template <class _ST, class _SA>
+        _LIBCPP_INLINE_VISIBILITY
+        explicit basic_regex(const basic_string<value_type, _ST, _SA>& __p,
+                             flag_type __f = regex_constants::ECMAScript)
+        : __flags_(__f), __marked_count_(0), __loop_count_(0), __open_count_(0),
+          __end_(nullptr)
+        {
+        __init(__p.begin(), __p.end());
+        }
+
+    template <class _ForwardIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        basic_regex(_ForwardIterator __first, _ForwardIterator __last,
+                    flag_type __f = regex_constants::ECMAScript)
+        : __flags_(__f), __marked_count_(0), __loop_count_(0), __open_count_(0),
+          __end_(nullptr)
+        {
+        __init(__first, __last);
+        }
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    basic_regex(initializer_list<value_type> __il,
+                flag_type __f = regex_constants::ECMAScript)
+        : __flags_(__f), __marked_count_(0), __loop_count_(0), __open_count_(0),
+          __end_(nullptr)
+        {
+        __init(__il.begin(), __il.end());
+        }
+#endif // _LIBCPP_CXX03_LANG
+
+//    ~basic_regex() = default;
+
+//     basic_regex& operator=(const basic_regex&) = default;
+//     basic_regex& operator=(basic_regex&&) = default;
+    _LIBCPP_INLINE_VISIBILITY
+    basic_regex& operator=(const value_type* __p)
+        {return assign(__p);}
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    basic_regex& operator=(initializer_list<value_type> __il)
+        {return assign(__il);}
+#endif // _LIBCPP_CXX03_LANG
+    template <class _ST, class _SA>
+        _LIBCPP_INLINE_VISIBILITY
+        basic_regex& operator=(const basic_string<value_type, _ST, _SA>& __p)
+        {return assign(__p);}
+
+    // assign:
+    _LIBCPP_INLINE_VISIBILITY
+    basic_regex& assign(const basic_regex& __that)
+        {return *this = __that;}
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    basic_regex& assign(basic_regex&& __that) _NOEXCEPT
+        {return *this = _VSTD::move(__that);}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    basic_regex& assign(const value_type* __p, flag_type __f = regex_constants::ECMAScript)
+        {return assign(__p, __p + __traits_.length(__p), __f);}
+    _LIBCPP_INLINE_VISIBILITY
+    basic_regex& assign(const value_type* __p, size_t __len, flag_type __f = regex_constants::ECMAScript)
+        {return assign(__p, __p + __len, __f);}
+    template <class _ST, class _SA>
+        _LIBCPP_INLINE_VISIBILITY
+        basic_regex& assign(const basic_string<value_type, _ST, _SA>& __s,
+                            flag_type __f = regex_constants::ECMAScript)
+            {return assign(__s.begin(), __s.end(), __f);}
+
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        typename enable_if<__is_exactly_cpp17_input_iterator<_InputIterator>::value, basic_regex&>::type
+        assign(_InputIterator __first, _InputIterator __last,
+                            flag_type __f = regex_constants::ECMAScript)
+        {
+            basic_string<_CharT> __t(__first, __last);
+            return assign(__t.begin(), __t.end(), __f);
+        }
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    void __member_init(flag_type __f)
+    {
+        __flags_ = __f;
+        __marked_count_ = 0;
+        __loop_count_ = 0;
+        __open_count_ = 0;
+        __end_ = nullptr;
+    }
+public:
+
+    template <class _ForwardIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        typename enable_if
+        <
+            __is_cpp17_forward_iterator<_ForwardIterator>::value,
+            basic_regex&
+        >::type
+        assign(_ForwardIterator __first, _ForwardIterator __last,
+                            flag_type __f = regex_constants::ECMAScript)
+        {
+            return assign(basic_regex(__first, __last, __f));
+        }
+
+#ifndef _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_regex& assign(initializer_list<value_type> __il,
+                        flag_type __f = regex_constants::ECMAScript)
+        {return assign(__il.begin(), __il.end(), __f);}
+
+#endif // _LIBCPP_CXX03_LANG
+
+    // const operations:
+    _LIBCPP_INLINE_VISIBILITY
+    unsigned mark_count() const {return __marked_count_;}
+    _LIBCPP_INLINE_VISIBILITY
+    flag_type flags() const {return __flags_;}
+
+    // locale:
+    _LIBCPP_INLINE_VISIBILITY
+    locale_type imbue(locale_type __loc)
+    {
+        __member_init(ECMAScript);
+        __start_.reset();
+        return __traits_.imbue(__loc);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    locale_type getloc() const {return __traits_.getloc();}
+
+    // swap:
+    void swap(basic_regex& __r);
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    unsigned __loop_count() const {return __loop_count_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool __use_multiline() const
+    {
+        return __get_grammar(__flags_) == ECMAScript && (__flags_ & multiline);
+    }
+
+    template <class _ForwardIterator>
+        void
+        __init(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_basic_reg_exp(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_RE_expression(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_simple_RE(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_nondupl_RE(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_one_char_or_coll_elem_RE(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_Back_open_paren(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_Back_close_paren(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_Back_open_brace(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_Back_close_brace(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_BACKREF(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_ORD_CHAR(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_QUOTED_CHAR(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_RE_dupl_symbol(_ForwardIterator __first, _ForwardIterator __last,
+                               __owns_one_state<_CharT>* __s,
+                               unsigned __mexp_begin, unsigned __mexp_end);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_ERE_dupl_symbol(_ForwardIterator __first, _ForwardIterator __last,
+                                __owns_one_state<_CharT>* __s,
+                                unsigned __mexp_begin, unsigned __mexp_end);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_bracket_expression(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_follow_list(_ForwardIterator __first, _ForwardIterator __last,
+                            __bracket_expression<_CharT, _Traits>* __ml);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_expression_term(_ForwardIterator __first, _ForwardIterator __last,
+                                __bracket_expression<_CharT, _Traits>* __ml);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_equivalence_class(_ForwardIterator __first, _ForwardIterator __last,
+                                  __bracket_expression<_CharT, _Traits>* __ml);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_character_class(_ForwardIterator __first, _ForwardIterator __last,
+                                __bracket_expression<_CharT, _Traits>* __ml);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_collating_symbol(_ForwardIterator __first, _ForwardIterator __last,
+                                 basic_string<_CharT>& __col_sym);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_DUP_COUNT(_ForwardIterator __first, _ForwardIterator __last, int& __c);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_extended_reg_exp(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_ERE_branch(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_ERE_expression(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_one_char_or_coll_elem_ERE(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_ORD_CHAR_ERE(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_QUOTED_CHAR_ERE(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_ecma_exp(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_alternative(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_term(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_assertion(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_atom(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_atom_escape(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_decimal_escape(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_character_class_escape(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_character_escape(_ForwardIterator __first, _ForwardIterator __last,
+                                 basic_string<_CharT>* __str = nullptr);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_pattern_character(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_grep(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_egrep(_ForwardIterator __first, _ForwardIterator __last);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_class_escape(_ForwardIterator __first, _ForwardIterator __last,
+                          basic_string<_CharT>& __str,
+                          __bracket_expression<_CharT, _Traits>* __ml);
+    template <class _ForwardIterator>
+        _ForwardIterator
+        __parse_awk_escape(_ForwardIterator __first, _ForwardIterator __last,
+                          basic_string<_CharT>* __str = nullptr);
+
+    bool __test_back_ref(_CharT);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __push_l_anchor();
+    void __push_r_anchor();
+    void __push_match_any();
+    void __push_match_any_but_newline();
+    _LIBCPP_INLINE_VISIBILITY
+    void __push_greedy_inf_repeat(size_t __min, __owns_one_state<_CharT>* __s,
+                                  unsigned __mexp_begin = 0, unsigned __mexp_end = 0)
+        {__push_loop(__min, numeric_limits<size_t>::max(), __s,
+                     __mexp_begin, __mexp_end);}
+    _LIBCPP_INLINE_VISIBILITY
+    void __push_nongreedy_inf_repeat(size_t __min, __owns_one_state<_CharT>* __s,
+                                  unsigned __mexp_begin = 0, unsigned __mexp_end = 0)
+        {__push_loop(__min, numeric_limits<size_t>::max(), __s,
+                     __mexp_begin, __mexp_end, false);}
+    void __push_loop(size_t __min, size_t __max, __owns_one_state<_CharT>* __s,
+                     size_t __mexp_begin = 0, size_t __mexp_end = 0,
+                     bool __greedy = true);
+    __bracket_expression<_CharT, _Traits>* __start_matching_list(bool __negate);
+    void __push_char(value_type __c);
+    void __push_back_ref(int __i);
+    void __push_alternation(__owns_one_state<_CharT>* __sa,
+                            __owns_one_state<_CharT>* __sb);
+    void __push_begin_marked_subexpression();
+    void __push_end_marked_subexpression(unsigned);
+    void __push_empty();
+    void __push_word_boundary(bool);
+    void __push_lookahead(const basic_regex&, bool, unsigned);
+
+    template <class _Allocator>
+        bool
+        __search(const _CharT* __first, const _CharT* __last,
+                 match_results<const _CharT*, _Allocator>& __m,
+                 regex_constants::match_flag_type __flags) const;
+
+    template <class _Allocator>
+        bool
+        __match_at_start(const _CharT* __first, const _CharT* __last,
+                 match_results<const _CharT*, _Allocator>& __m,
+                 regex_constants::match_flag_type __flags, bool) const;
+    template <class _Allocator>
+        bool
+        __match_at_start_ecma(const _CharT* __first, const _CharT* __last,
+                 match_results<const _CharT*, _Allocator>& __m,
+                 regex_constants::match_flag_type __flags, bool) const;
+    template <class _Allocator>
+        bool
+        __match_at_start_posix_nosubs(const _CharT* __first, const _CharT* __last,
+                 match_results<const _CharT*, _Allocator>& __m,
+                 regex_constants::match_flag_type __flags, bool) const;
+    template <class _Allocator>
+        bool
+        __match_at_start_posix_subs(const _CharT* __first, const _CharT* __last,
+                 match_results<const _CharT*, _Allocator>& __m,
+                 regex_constants::match_flag_type __flags, bool) const;
+
+    template <class _Bp, class _Ap, class _Cp, class _Tp>
+    friend
+    bool
+    regex_search(_Bp, _Bp, match_results<_Bp, _Ap>&, const basic_regex<_Cp, _Tp>&,
+                 regex_constants::match_flag_type);
+
+    template <class _Ap, class _Cp, class _Tp>
+    friend
+    bool
+    regex_search(const _Cp*, const _Cp*, match_results<const _Cp*, _Ap>&,
+                 const basic_regex<_Cp, _Tp>&, regex_constants::match_flag_type);
+
+    template <class _Bp, class _Cp, class _Tp>
+    friend
+    bool
+    regex_search(_Bp, _Bp, const basic_regex<_Cp, _Tp>&,
+                 regex_constants::match_flag_type);
+
+    template <class _Cp, class _Tp>
+    friend
+    bool
+    regex_search(const _Cp*, const _Cp*,
+                 const basic_regex<_Cp, _Tp>&, regex_constants::match_flag_type);
+
+    template <class _Cp, class _Ap, class _Tp>
+    friend
+    bool
+    regex_search(const _Cp*, match_results<const _Cp*, _Ap>&, const basic_regex<_Cp, _Tp>&,
+                 regex_constants::match_flag_type);
+
+    template <class _ST, class _SA, class _Cp, class _Tp>
+    friend
+    bool
+    regex_search(const basic_string<_Cp, _ST, _SA>& __s,
+                 const basic_regex<_Cp, _Tp>& __e,
+                 regex_constants::match_flag_type __flags);
+
+    template <class _ST, class _SA, class _Ap, class _Cp, class _Tp>
+    friend
+    bool
+    regex_search(const basic_string<_Cp, _ST, _SA>& __s,
+                 match_results<typename basic_string<_Cp, _ST, _SA>::const_iterator, _Ap>&,
+                 const basic_regex<_Cp, _Tp>& __e,
+                 regex_constants::match_flag_type __flags);
+
+    template <class _Iter, class _Ap, class _Cp, class _Tp>
+    friend
+    bool
+    regex_search(__wrap_iter<_Iter> __first,
+                 __wrap_iter<_Iter> __last,
+                 match_results<__wrap_iter<_Iter>, _Ap>& __m,
+                 const basic_regex<_Cp, _Tp>& __e,
+                 regex_constants::match_flag_type __flags);
+
+    template <class, class> friend class __lookahead;
+};
+
+#if _LIBCPP_STD_VER >= 17
+template <class _ForwardIterator,
+          class = typename enable_if<__is_cpp17_forward_iterator<_ForwardIterator>::value, nullptr_t>::type
+>
+basic_regex(_ForwardIterator, _ForwardIterator,
+            regex_constants::syntax_option_type = regex_constants::ECMAScript)
+    -> basic_regex<typename iterator_traits<_ForwardIterator>::value_type>;
+#endif
+
+template <class _CharT, class _Traits>
+    const regex_constants::syntax_option_type basic_regex<_CharT, _Traits>::icase;
+template <class _CharT, class _Traits>
+    const regex_constants::syntax_option_type basic_regex<_CharT, _Traits>::nosubs;
+template <class _CharT, class _Traits>
+    const regex_constants::syntax_option_type basic_regex<_CharT, _Traits>::optimize;
+template <class _CharT, class _Traits>
+    const regex_constants::syntax_option_type basic_regex<_CharT, _Traits>::collate;
+template <class _CharT, class _Traits>
+    const regex_constants::syntax_option_type basic_regex<_CharT, _Traits>::ECMAScript;
+template <class _CharT, class _Traits>
+    const regex_constants::syntax_option_type basic_regex<_CharT, _Traits>::basic;
+template <class _CharT, class _Traits>
+    const regex_constants::syntax_option_type basic_regex<_CharT, _Traits>::extended;
+template <class _CharT, class _Traits>
+    const regex_constants::syntax_option_type basic_regex<_CharT, _Traits>::awk;
+template <class _CharT, class _Traits>
+    const regex_constants::syntax_option_type basic_regex<_CharT, _Traits>::grep;
+template <class _CharT, class _Traits>
+    const regex_constants::syntax_option_type basic_regex<_CharT, _Traits>::egrep;
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::swap(basic_regex& __r)
+{
+    using _VSTD::swap;
+    swap(__traits_, __r.__traits_);
+    swap(__flags_, __r.__flags_);
+    swap(__marked_count_, __r.__marked_count_);
+    swap(__loop_count_, __r.__loop_count_);
+    swap(__open_count_, __r.__open_count_);
+    swap(__start_, __r.__start_);
+    swap(__end_, __r.__end_);
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(basic_regex<_CharT, _Traits>& __x, basic_regex<_CharT, _Traits>& __y)
+{
+    return __x.swap(__y);
+}
+
+// __lookahead
+
+template <class _CharT, class _Traits>
+class __lookahead
+    : public __owns_one_state<_CharT>
+{
+    typedef __owns_one_state<_CharT> base;
+
+    basic_regex<_CharT, _Traits> __exp_;
+    unsigned __mexp_;
+    bool __invert_;
+
+    __lookahead(const __lookahead&);
+    __lookahead& operator=(const __lookahead&);
+public:
+    typedef _VSTD::__state<_CharT> __state;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __lookahead(const basic_regex<_CharT, _Traits>& __exp, bool __invert, __node<_CharT>* __s, unsigned __mexp)
+        : base(__s), __exp_(__exp), __mexp_(__mexp), __invert_(__invert) {}
+
+    virtual void __exec(__state&) const;
+};
+
+template <class _CharT, class _Traits>
+void
+__lookahead<_CharT, _Traits>::__exec(__state& __s) const
+{
+    match_results<const _CharT*> __m;
+    __m.__init(1 + __exp_.mark_count(), __s.__current_, __s.__last_);
+    bool __matched = __exp_.__match_at_start_ecma(
+        __s.__current_, __s.__last_,
+        __m,
+        (__s.__flags_ | regex_constants::match_continuous) &
+        ~regex_constants::__full_match,
+        __s.__at_first_ && __s.__current_ == __s.__first_);
+    if (__matched != __invert_)
+    {
+        __s.__do_ = __state::__accept_but_not_consume;
+        __s.__node_ = this->first();
+        for (unsigned __i = 1; __i < __m.size(); ++__i) {
+            __s.__sub_matches_[__mexp_ + __i - 1] = __m.__matches_[__i];
+        }
+    }
+    else
+    {
+        __s.__do_ = __state::__reject;
+        __s.__node_ = nullptr;
+    }
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+void
+basic_regex<_CharT, _Traits>::__init(_ForwardIterator __first, _ForwardIterator __last)
+{
+    if (__get_grammar(__flags_) == 0) __flags_ |= regex_constants::ECMAScript;
+    _ForwardIterator __temp = __parse(__first, __last);
+    if ( __temp != __last)
+        __throw_regex_error<regex_constants::__re_err_parse>();
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse(_ForwardIterator __first,
+                                      _ForwardIterator __last)
+{
+    {
+        unique_ptr<__node> __h(new __end_state<_CharT>);
+        __start_.reset(new __empty_state<_CharT>(__h.get()));
+        __h.release();
+        __end_ = __start_.get();
+    }
+    switch (__get_grammar(__flags_))
+    {
+    case ECMAScript:
+        __first = __parse_ecma_exp(__first, __last);
+        break;
+    case basic:
+        __first = __parse_basic_reg_exp(__first, __last);
+        break;
+    case extended:
+    case awk:
+        __first = __parse_extended_reg_exp(__first, __last);
+        break;
+    case grep:
+        __first = __parse_grep(__first, __last);
+        break;
+    case egrep:
+        __first = __parse_egrep(__first, __last);
+        break;
+    default:
+        __throw_regex_error<regex_constants::__re_err_grammar>();
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_basic_reg_exp(_ForwardIterator __first,
+                                                    _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        if (*__first == '^')
+        {
+            __push_l_anchor();
+            ++__first;
+        }
+        if (__first != __last)
+        {
+            __first = __parse_RE_expression(__first, __last);
+            if (__first != __last)
+            {
+                _ForwardIterator __temp = _VSTD::next(__first);
+                if (__temp == __last && *__first == '$')
+                {
+                    __push_r_anchor();
+                    ++__first;
+                }
+            }
+        }
+        if (__first != __last)
+            __throw_regex_error<regex_constants::__re_err_empty>();
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_extended_reg_exp(_ForwardIterator __first,
+                                                       _ForwardIterator __last)
+{
+    __owns_one_state<_CharT>* __sa = __end_;
+    _ForwardIterator __temp = __parse_ERE_branch(__first, __last);
+    if (__temp == __first)
+        __throw_regex_error<regex_constants::__re_err_empty>();
+    __first = __temp;
+    while (__first != __last && *__first == '|')
+    {
+        __owns_one_state<_CharT>* __sb = __end_;
+        __temp = __parse_ERE_branch(++__first, __last);
+        if (__temp == __first)
+            __throw_regex_error<regex_constants::__re_err_empty>();
+        __push_alternation(__sa, __sb);
+        __first = __temp;
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_ERE_branch(_ForwardIterator __first,
+                                                 _ForwardIterator __last)
+{
+    _ForwardIterator __temp = __parse_ERE_expression(__first, __last);
+    if (__temp == __first)
+        __throw_regex_error<regex_constants::__re_err_empty>();
+    do
+    {
+        __first = __temp;
+        __temp = __parse_ERE_expression(__first, __last);
+    } while (__temp != __first);
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_ERE_expression(_ForwardIterator __first,
+                                                     _ForwardIterator __last)
+{
+    __owns_one_state<_CharT>* __e = __end_;
+    unsigned __mexp_begin = __marked_count_;
+    _ForwardIterator __temp = __parse_one_char_or_coll_elem_ERE(__first, __last);
+    if (__temp == __first && __temp != __last)
+    {
+        switch (*__temp)
+        {
+        case '^':
+            __push_l_anchor();
+            ++__temp;
+            break;
+        case '$':
+            __push_r_anchor();
+            ++__temp;
+            break;
+        case '(':
+            __push_begin_marked_subexpression();
+            unsigned __temp_count = __marked_count_;
+            ++__open_count_;
+            __temp = __parse_extended_reg_exp(++__temp, __last);
+            if (__temp == __last || *__temp != ')')
+                __throw_regex_error<regex_constants::error_paren>();
+            __push_end_marked_subexpression(__temp_count);
+            --__open_count_;
+            ++__temp;
+            break;
+        }
+    }
+    if (__temp != __first)
+        __temp = __parse_ERE_dupl_symbol(__temp, __last, __e, __mexp_begin+1,
+                                         __marked_count_+1);
+    __first = __temp;
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_RE_expression(_ForwardIterator __first,
+                                                    _ForwardIterator __last)
+{
+    while (true)
+    {
+        _ForwardIterator __temp = __parse_simple_RE(__first, __last);
+        if (__temp == __first)
+            break;
+        __first = __temp;
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_simple_RE(_ForwardIterator __first,
+                                                _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        __owns_one_state<_CharT>* __e = __end_;
+        unsigned __mexp_begin = __marked_count_;
+        _ForwardIterator __temp = __parse_nondupl_RE(__first, __last);
+        if (__temp != __first)
+            __first = __parse_RE_dupl_symbol(__temp, __last, __e,
+                                             __mexp_begin+1, __marked_count_+1);
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_nondupl_RE(_ForwardIterator __first,
+                                                 _ForwardIterator __last)
+{
+    _ForwardIterator __temp = __first;
+    __first = __parse_one_char_or_coll_elem_RE(__first, __last);
+    if (__temp == __first)
+    {
+        __temp = __parse_Back_open_paren(__first, __last);
+        if (__temp != __first)
+        {
+            __push_begin_marked_subexpression();
+            unsigned __temp_count = __marked_count_;
+            __first = __parse_RE_expression(__temp, __last);
+            __temp = __parse_Back_close_paren(__first, __last);
+            if (__temp == __first)
+                __throw_regex_error<regex_constants::error_paren>();
+            __push_end_marked_subexpression(__temp_count);
+            __first = __temp;
+        }
+        else
+            __first = __parse_BACKREF(__first, __last);
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_one_char_or_coll_elem_RE(
+                                                       _ForwardIterator __first,
+                                                       _ForwardIterator __last)
+{
+    _ForwardIterator __temp = __parse_ORD_CHAR(__first, __last);
+    if (__temp == __first)
+    {
+        __temp = __parse_QUOTED_CHAR(__first, __last);
+        if (__temp == __first)
+        {
+            if (__temp != __last && *__temp == '.')
+            {
+                __push_match_any();
+                ++__temp;
+            }
+            else
+                __temp = __parse_bracket_expression(__first, __last);
+        }
+    }
+    __first = __temp;
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_one_char_or_coll_elem_ERE(
+                                                       _ForwardIterator __first,
+                                                       _ForwardIterator __last)
+{
+    _ForwardIterator __temp = __parse_ORD_CHAR_ERE(__first, __last);
+    if (__temp == __first)
+    {
+        __temp = __parse_QUOTED_CHAR_ERE(__first, __last);
+        if (__temp == __first)
+        {
+            if (__temp != __last && *__temp == '.')
+            {
+                __push_match_any();
+                ++__temp;
+            }
+            else
+                __temp = __parse_bracket_expression(__first, __last);
+        }
+    }
+    __first = __temp;
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_Back_open_paren(_ForwardIterator __first,
+                                                      _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        _ForwardIterator __temp = _VSTD::next(__first);
+        if (__temp != __last)
+        {
+            if (*__first == '\\' && *__temp == '(')
+                __first = ++__temp;
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_Back_close_paren(_ForwardIterator __first,
+                                                       _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        _ForwardIterator __temp = _VSTD::next(__first);
+        if (__temp != __last)
+        {
+            if (*__first == '\\' && *__temp == ')')
+                __first = ++__temp;
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_Back_open_brace(_ForwardIterator __first,
+                                                      _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        _ForwardIterator __temp = _VSTD::next(__first);
+        if (__temp != __last)
+        {
+            if (*__first == '\\' && *__temp == '{')
+                __first = ++__temp;
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_Back_close_brace(_ForwardIterator __first,
+                                                       _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        _ForwardIterator __temp = _VSTD::next(__first);
+        if (__temp != __last)
+        {
+            if (*__first == '\\' && *__temp == '}')
+                __first = ++__temp;
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_BACKREF(_ForwardIterator __first,
+                                              _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        _ForwardIterator __temp = _VSTD::next(__first);
+        if (__temp != __last && *__first == '\\' && __test_back_ref(*__temp))
+            __first = ++__temp;
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_ORD_CHAR(_ForwardIterator __first,
+                                               _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        _ForwardIterator __temp = _VSTD::next(__first);
+        if (__temp == __last && *__first == '$')
+            return __first;
+        // Not called inside a bracket
+        if (*__first == '.' || *__first == '\\' || *__first == '[')
+            return __first;
+        __push_char(*__first);
+        ++__first;
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_ORD_CHAR_ERE(_ForwardIterator __first,
+                                                   _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        switch (*__first)
+        {
+        case '^':
+        case '.':
+        case '[':
+        case '$':
+        case '(':
+        case '|':
+        case '*':
+        case '+':
+        case '?':
+        case '{':
+        case '\\':
+            break;
+        case ')':
+            if (__open_count_ == 0)
+            {
+                __push_char(*__first);
+                ++__first;
+            }
+            break;
+        default:
+            __push_char(*__first);
+            ++__first;
+            break;
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_QUOTED_CHAR(_ForwardIterator __first,
+                                                  _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        _ForwardIterator __temp = _VSTD::next(__first);
+        if (__temp != __last)
+        {
+            if (*__first == '\\')
+            {
+                switch (*__temp)
+                {
+                case '^':
+                case '.':
+                case '*':
+                case '[':
+                case '$':
+                case '\\':
+                    __push_char(*__temp);
+                    __first = ++__temp;
+                    break;
+                }
+            }
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_QUOTED_CHAR_ERE(_ForwardIterator __first,
+                                                      _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        _ForwardIterator __temp = _VSTD::next(__first);
+        if (__temp != __last)
+        {
+            if (*__first == '\\')
+            {
+                switch (*__temp)
+                {
+                case '^':
+                case '.':
+                case '*':
+                case '[':
+                case '$':
+                case '\\':
+                case '(':
+                case ')':
+                case '|':
+                case '+':
+                case '?':
+                case '{':
+                case '}':
+                    __push_char(*__temp);
+                    __first = ++__temp;
+                    break;
+                default:
+                    if (__get_grammar(__flags_) == awk)
+                        __first = __parse_awk_escape(++__first, __last);
+                    else if(__test_back_ref(*__temp))
+                        __first = ++__temp;
+                    break;
+                }
+            }
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_RE_dupl_symbol(_ForwardIterator __first,
+                                                     _ForwardIterator __last,
+                                                     __owns_one_state<_CharT>* __s,
+                                                     unsigned __mexp_begin,
+                                                     unsigned __mexp_end)
+{
+    if (__first != __last)
+    {
+        if (*__first == '*')
+        {
+            __push_greedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
+            ++__first;
+        }
+        else
+        {
+            _ForwardIterator __temp = __parse_Back_open_brace(__first, __last);
+            if (__temp != __first)
+            {
+                int __min = 0;
+                __first = __temp;
+                __temp = __parse_DUP_COUNT(__first, __last, __min);
+                if (__temp == __first)
+                    __throw_regex_error<regex_constants::error_badbrace>();
+                __first = __temp;
+                if (__first == __last)
+                    __throw_regex_error<regex_constants::error_brace>();
+                if (*__first != ',')
+                {
+                    __temp = __parse_Back_close_brace(__first, __last);
+                    if (__temp == __first)
+                        __throw_regex_error<regex_constants::error_brace>();
+                    __push_loop(__min, __min, __s, __mexp_begin, __mexp_end,
+                                    true);
+                    __first = __temp;
+                }
+                else
+                {
+                    ++__first;  // consume ','
+                    int __max = -1;
+                    __first = __parse_DUP_COUNT(__first, __last, __max);
+                    __temp = __parse_Back_close_brace(__first, __last);
+                    if (__temp == __first)
+                        __throw_regex_error<regex_constants::error_brace>();
+                    if (__max == -1)
+                        __push_greedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
+                    else
+                    {
+                        if (__max < __min)
+                            __throw_regex_error<regex_constants::error_badbrace>();
+                        __push_loop(__min, __max, __s, __mexp_begin, __mexp_end,
+                                    true);
+                    }
+                    __first = __temp;
+                }
+            }
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_ERE_dupl_symbol(_ForwardIterator __first,
+                                                      _ForwardIterator __last,
+                                                      __owns_one_state<_CharT>* __s,
+                                                      unsigned __mexp_begin,
+                                                      unsigned __mexp_end)
+{
+    if (__first != __last)
+    {
+        unsigned __grammar = __get_grammar(__flags_);
+        switch (*__first)
+        {
+        case '*':
+            ++__first;
+            if (__grammar == ECMAScript && __first != __last && *__first == '?')
+            {
+                ++__first;
+                __push_nongreedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
+            }
+            else
+                __push_greedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
+            break;
+        case '+':
+            ++__first;
+            if (__grammar == ECMAScript && __first != __last && *__first == '?')
+            {
+                ++__first;
+                __push_nongreedy_inf_repeat(1, __s, __mexp_begin, __mexp_end);
+            }
+            else
+                __push_greedy_inf_repeat(1, __s, __mexp_begin, __mexp_end);
+            break;
+        case '?':
+            ++__first;
+            if (__grammar == ECMAScript && __first != __last && *__first == '?')
+            {
+                ++__first;
+                __push_loop(0, 1, __s, __mexp_begin, __mexp_end, false);
+            }
+            else
+                __push_loop(0, 1, __s, __mexp_begin, __mexp_end);
+            break;
+        case '{':
+            {
+                int __min;
+                _ForwardIterator __temp = __parse_DUP_COUNT(++__first, __last, __min);
+                if (__temp == __first)
+                    __throw_regex_error<regex_constants::error_badbrace>();
+                __first = __temp;
+                if (__first == __last)
+                    __throw_regex_error<regex_constants::error_brace>();
+                switch (*__first)
+                {
+                case '}':
+                    ++__first;
+                    if (__grammar == ECMAScript && __first != __last && *__first == '?')
+                    {
+                        ++__first;
+                        __push_loop(__min, __min, __s, __mexp_begin, __mexp_end, false);
+                    }
+                    else
+                        __push_loop(__min, __min, __s, __mexp_begin, __mexp_end);
+                    break;
+                case ',':
+                    ++__first;
+                    if (__first == __last)
+                        __throw_regex_error<regex_constants::error_badbrace>();
+                    if (*__first == '}')
+                    {
+                        ++__first;
+                        if (__grammar == ECMAScript && __first != __last && *__first == '?')
+                        {
+                            ++__first;
+                            __push_nongreedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
+                        }
+                        else
+                            __push_greedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
+                    }
+                    else
+                    {
+                        int __max = -1;
+                        __temp = __parse_DUP_COUNT(__first, __last, __max);
+                        if (__temp == __first)
+                            __throw_regex_error<regex_constants::error_brace>();
+                        __first = __temp;
+                        if (__first == __last || *__first != '}')
+                            __throw_regex_error<regex_constants::error_brace>();
+                        ++__first;
+                        if (__max < __min)
+                            __throw_regex_error<regex_constants::error_badbrace>();
+                        if (__grammar == ECMAScript && __first != __last && *__first == '?')
+                        {
+                            ++__first;
+                            __push_loop(__min, __max, __s, __mexp_begin, __mexp_end, false);
+                        }
+                        else
+                            __push_loop(__min, __max, __s, __mexp_begin, __mexp_end);
+                    }
+                    break;
+                default:
+                    __throw_regex_error<regex_constants::error_badbrace>();
+                }
+            }
+            break;
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_bracket_expression(_ForwardIterator __first,
+                                                         _ForwardIterator __last)
+{
+    if (__first != __last && *__first == '[')
+    {
+        ++__first;
+        if (__first == __last)
+            __throw_regex_error<regex_constants::error_brack>();
+        bool __negate = false;
+        if (*__first == '^')
+        {
+            ++__first;
+            __negate = true;
+        }
+        __bracket_expression<_CharT, _Traits>* __ml = __start_matching_list(__negate);
+        // __ml owned by *this
+        if (__first == __last)
+            __throw_regex_error<regex_constants::error_brack>();
+        if (__get_grammar(__flags_) != ECMAScript && *__first == ']')
+        {
+            __ml->__add_char(']');
+            ++__first;
+        }
+        __first = __parse_follow_list(__first, __last, __ml);
+        if (__first == __last)
+            __throw_regex_error<regex_constants::error_brack>();
+        if (*__first == '-')
+        {
+            __ml->__add_char('-');
+            ++__first;
+        }
+        if (__first == __last || *__first != ']')
+            __throw_regex_error<regex_constants::error_brack>();
+        ++__first;
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_follow_list(_ForwardIterator __first,
+                                    _ForwardIterator __last,
+                                    __bracket_expression<_CharT, _Traits>* __ml)
+{
+    if (__first != __last)
+    {
+        while (true)
+        {
+            _ForwardIterator __temp = __parse_expression_term(__first, __last,
+                                                              __ml);
+            if (__temp == __first)
+                break;
+            __first = __temp;
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_expression_term(_ForwardIterator __first,
+                                    _ForwardIterator __last,
+                                    __bracket_expression<_CharT, _Traits>* __ml)
+{
+    if (__first != __last && *__first != ']')
+    {
+        _ForwardIterator __temp = _VSTD::next(__first);
+        basic_string<_CharT> __start_range;
+        if (__temp != __last && *__first == '[')
+        {
+            if (*__temp == '=')
+                return __parse_equivalence_class(++__temp, __last, __ml);
+            else if (*__temp == ':')
+                return __parse_character_class(++__temp, __last, __ml);
+            else if (*__temp == '.')
+                __first = __parse_collating_symbol(++__temp, __last, __start_range);
+        }
+        unsigned __grammar = __get_grammar(__flags_);
+        if (__start_range.empty())
+        {
+            if ((__grammar == ECMAScript || __grammar == awk) && *__first == '\\')
+            {
+                if (__grammar == ECMAScript)
+                    __first = __parse_class_escape(++__first, __last, __start_range, __ml);
+                else
+                    __first = __parse_awk_escape(++__first, __last, &__start_range);
+            }
+            else
+            {
+                __start_range = *__first;
+                ++__first;
+            }
+        }
+        if (__first != __last && *__first != ']')
+        {
+            __temp = _VSTD::next(__first);
+            if (__temp != __last && *__first == '-' && *__temp != ']')
+            {
+                // parse a range
+                basic_string<_CharT> __end_range;
+                __first = __temp;
+                ++__temp;
+                if (__temp != __last && *__first == '[' && *__temp == '.')
+                    __first = __parse_collating_symbol(++__temp, __last, __end_range);
+                else
+                {
+                    if ((__grammar == ECMAScript || __grammar == awk) && *__first == '\\')
+                    {
+                        if (__grammar == ECMAScript)
+                            __first = __parse_class_escape(++__first, __last,
+                                                           __end_range, __ml);
+                        else
+                            __first = __parse_awk_escape(++__first, __last,
+                                                         &__end_range);
+                    }
+                    else
+                    {
+                        __end_range = *__first;
+                        ++__first;
+                    }
+                }
+                __ml->__add_range(_VSTD::move(__start_range), _VSTD::move(__end_range));
+            }
+            else if (!__start_range.empty())
+            {
+                if (__start_range.size() == 1)
+                    __ml->__add_char(__start_range[0]);
+                else
+                    __ml->__add_digraph(__start_range[0], __start_range[1]);
+            }
+        }
+        else if (!__start_range.empty())
+        {
+            if (__start_range.size() == 1)
+                __ml->__add_char(__start_range[0]);
+            else
+                __ml->__add_digraph(__start_range[0], __start_range[1]);
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_class_escape(_ForwardIterator __first,
+                          _ForwardIterator __last,
+                          basic_string<_CharT>& __str,
+                          __bracket_expression<_CharT, _Traits>* __ml)
+{
+    if (__first == __last)
+        __throw_regex_error<regex_constants::error_escape>();
+    switch (*__first)
+    {
+    case 0:
+        __str = *__first;
+        return ++__first;
+    case 'b':
+        __str = _CharT(8);
+        return ++__first;
+    case 'd':
+        __ml->__add_class(ctype_base::digit);
+        return ++__first;
+    case 'D':
+        __ml->__add_neg_class(ctype_base::digit);
+        return ++__first;
+    case 's':
+        __ml->__add_class(ctype_base::space);
+        return ++__first;
+    case 'S':
+        __ml->__add_neg_class(ctype_base::space);
+        return ++__first;
+    case 'w':
+        __ml->__add_class(ctype_base::alnum);
+        __ml->__add_char('_');
+        return ++__first;
+    case 'W':
+        __ml->__add_neg_class(ctype_base::alnum);
+        __ml->__add_neg_char('_');
+        return ++__first;
+    }
+    __first = __parse_character_escape(__first, __last, &__str);
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_awk_escape(_ForwardIterator __first,
+                          _ForwardIterator __last,
+                          basic_string<_CharT>* __str)
+{
+    if (__first == __last)
+        __throw_regex_error<regex_constants::error_escape>();
+    switch (*__first)
+    {
+    case '\\':
+    case '"':
+    case '/':
+        if (__str)
+            *__str = *__first;
+        else
+            __push_char(*__first);
+        return ++__first;
+    case 'a':
+        if (__str)
+            *__str = _CharT(7);
+        else
+            __push_char(_CharT(7));
+        return ++__first;
+    case 'b':
+        if (__str)
+            *__str = _CharT(8);
+        else
+            __push_char(_CharT(8));
+        return ++__first;
+    case 'f':
+        if (__str)
+            *__str = _CharT(0xC);
+        else
+            __push_char(_CharT(0xC));
+        return ++__first;
+    case 'n':
+        if (__str)
+            *__str = _CharT(0xA);
+        else
+            __push_char(_CharT(0xA));
+        return ++__first;
+    case 'r':
+        if (__str)
+            *__str = _CharT(0xD);
+        else
+            __push_char(_CharT(0xD));
+        return ++__first;
+    case 't':
+        if (__str)
+            *__str = _CharT(0x9);
+        else
+            __push_char(_CharT(0x9));
+        return ++__first;
+    case 'v':
+        if (__str)
+            *__str = _CharT(0xB);
+        else
+            __push_char(_CharT(0xB));
+        return ++__first;
+    }
+    if ('0' <= *__first && *__first <= '7')
+    {
+        unsigned __val = *__first - '0';
+        if (++__first != __last && ('0' <= *__first && *__first <= '7'))
+        {
+            __val = 8 * __val + *__first - '0';
+            if (++__first != __last && ('0' <= *__first && *__first <= '7'))
+                __val = 8 * __val + *__first++ - '0';
+        }
+        if (__str)
+            *__str = _CharT(__val);
+        else
+            __push_char(_CharT(__val));
+    }
+    else
+        __throw_regex_error<regex_constants::error_escape>();
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_equivalence_class(_ForwardIterator __first,
+                                    _ForwardIterator __last,
+                                    __bracket_expression<_CharT, _Traits>* __ml)
+{
+    // Found [=
+    //   This means =] must exist
+    value_type _Equal_close[2] = {'=', ']'};
+    _ForwardIterator __temp = _VSTD::search(__first, __last, _Equal_close,
+                                                            _Equal_close+2);
+    if (__temp == __last)
+        __throw_regex_error<regex_constants::error_brack>();
+    // [__first, __temp) contains all text in [= ... =]
+    string_type __collate_name =
+        __traits_.lookup_collatename(__first, __temp);
+    if (__collate_name.empty())
+        __throw_regex_error<regex_constants::error_collate>();
+    string_type __equiv_name =
+        __traits_.transform_primary(__collate_name.begin(),
+                                    __collate_name.end());
+    if (!__equiv_name.empty())
+        __ml->__add_equivalence(__equiv_name);
+    else
+    {
+        switch (__collate_name.size())
+        {
+        case 1:
+            __ml->__add_char(__collate_name[0]);
+            break;
+        case 2:
+            __ml->__add_digraph(__collate_name[0], __collate_name[1]);
+            break;
+        default:
+            __throw_regex_error<regex_constants::error_collate>();
+        }
+    }
+    __first = _VSTD::next(__temp, 2);
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_character_class(_ForwardIterator __first,
+                                    _ForwardIterator __last,
+                                    __bracket_expression<_CharT, _Traits>* __ml)
+{
+    // Found [:
+    //   This means :] must exist
+    value_type _Colon_close[2] = {':', ']'};
+    _ForwardIterator __temp = _VSTD::search(__first, __last, _Colon_close,
+                                                            _Colon_close+2);
+    if (__temp == __last)
+        __throw_regex_error<regex_constants::error_brack>();
+    // [__first, __temp) contains all text in [: ... :]
+    typedef typename _Traits::char_class_type char_class_type;
+    char_class_type __class_type =
+        __traits_.lookup_classname(__first, __temp, __flags_ & icase);
+    if (__class_type == 0)
+        __throw_regex_error<regex_constants::error_ctype>();
+    __ml->__add_class(__class_type);
+    __first = _VSTD::next(__temp, 2);
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_collating_symbol(_ForwardIterator __first,
+                                                _ForwardIterator __last,
+                                                basic_string<_CharT>& __col_sym)
+{
+    // Found [.
+    //   This means .] must exist
+    value_type _Dot_close[2] = {'.', ']'};
+    _ForwardIterator __temp = _VSTD::search(__first, __last, _Dot_close,
+                                                            _Dot_close+2);
+    if (__temp == __last)
+        __throw_regex_error<regex_constants::error_brack>();
+    // [__first, __temp) contains all text in [. ... .]
+    __col_sym = __traits_.lookup_collatename(__first, __temp);
+    switch (__col_sym.size())
+    {
+    case 1:
+    case 2:
+        break;
+    default:
+        __throw_regex_error<regex_constants::error_collate>();
+    }
+    __first = _VSTD::next(__temp, 2);
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_DUP_COUNT(_ForwardIterator __first,
+                                                _ForwardIterator __last,
+                                                int& __c)
+{
+    if (__first != __last )
+    {
+        int __val = __traits_.value(*__first, 10);
+        if ( __val != -1 )
+        {
+            __c = __val;
+            for (++__first;
+                 __first != __last && ( __val = __traits_.value(*__first, 10)) != -1;
+                 ++__first)
+            {
+                if (__c >= numeric_limits<int>::max() / 10)
+                    __throw_regex_error<regex_constants::error_badbrace>();
+                __c *= 10;
+                __c += __val;
+            }
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_ecma_exp(_ForwardIterator __first,
+                                               _ForwardIterator __last)
+{
+    __owns_one_state<_CharT>* __sa = __end_;
+    _ForwardIterator __temp = __parse_alternative(__first, __last);
+    if (__temp == __first)
+        __push_empty();
+    __first = __temp;
+    while (__first != __last && *__first == '|')
+    {
+        __owns_one_state<_CharT>* __sb = __end_;
+        __temp = __parse_alternative(++__first, __last);
+        if (__temp == __first)
+            __push_empty();
+        __push_alternation(__sa, __sb);
+        __first = __temp;
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_alternative(_ForwardIterator __first,
+                                                  _ForwardIterator __last)
+{
+    while (true)
+    {
+        _ForwardIterator __temp = __parse_term(__first, __last);
+        if (__temp == __first)
+            break;
+        __first = __temp;
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_term(_ForwardIterator __first,
+                                           _ForwardIterator __last)
+{
+    _ForwardIterator __temp = __parse_assertion(__first, __last);
+    if (__temp == __first)
+    {
+        __owns_one_state<_CharT>* __e = __end_;
+        unsigned __mexp_begin = __marked_count_;
+        __temp = __parse_atom(__first, __last);
+        if (__temp != __first)
+            __first = __parse_ERE_dupl_symbol(__temp, __last, __e,
+                                              __mexp_begin+1, __marked_count_+1);
+    }
+    else
+        __first = __temp;
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_assertion(_ForwardIterator __first,
+                                                _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        switch (*__first)
+        {
+        case '^':
+            __push_l_anchor();
+            ++__first;
+            break;
+        case '$':
+            __push_r_anchor();
+            ++__first;
+            break;
+        case '\\':
+            {
+                _ForwardIterator __temp = _VSTD::next(__first);
+                if (__temp != __last)
+                {
+                    if (*__temp == 'b')
+                    {
+                        __push_word_boundary(false);
+                        __first = ++__temp;
+                    }
+                    else if (*__temp == 'B')
+                    {
+                        __push_word_boundary(true);
+                        __first = ++__temp;
+                    }
+                }
+            }
+            break;
+        case '(':
+            {
+                _ForwardIterator __temp = _VSTD::next(__first);
+                if (__temp != __last && *__temp == '?')
+                {
+                    if (++__temp != __last)
+                    {
+                        switch (*__temp)
+                        {
+                        case '=':
+                            {
+                                basic_regex __exp;
+                                __exp.__flags_ = __flags_;
+                                __temp = __exp.__parse(++__temp, __last);
+                                unsigned __mexp = __exp.__marked_count_;
+                                __push_lookahead(_VSTD::move(__exp), false, __marked_count_);
+                                __marked_count_ += __mexp;
+                                if (__temp == __last || *__temp != ')')
+                                    __throw_regex_error<regex_constants::error_paren>();
+                                __first = ++__temp;
+                            }
+                            break;
+                        case '!':
+                            {
+                                basic_regex __exp;
+                                __exp.__flags_ = __flags_;
+                                __temp = __exp.__parse(++__temp, __last);
+                                unsigned __mexp = __exp.__marked_count_;
+                                __push_lookahead(_VSTD::move(__exp), true, __marked_count_);
+                                __marked_count_ += __mexp;
+                                if (__temp == __last || *__temp != ')')
+                                    __throw_regex_error<regex_constants::error_paren>();
+                                __first = ++__temp;
+                            }
+                            break;
+                        }
+                    }
+                }
+            }
+            break;
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_atom(_ForwardIterator __first,
+                                           _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        switch (*__first)
+        {
+        case '.':
+            __push_match_any_but_newline();
+            ++__first;
+            break;
+        case '\\':
+            __first = __parse_atom_escape(__first, __last);
+            break;
+        case '[':
+            __first = __parse_bracket_expression(__first, __last);
+            break;
+        case '(':
+            {
+                ++__first;
+                if (__first == __last)
+                    __throw_regex_error<regex_constants::error_paren>();
+                _ForwardIterator __temp = _VSTD::next(__first);
+                if (__temp != __last && *__first == '?' && *__temp == ':')
+                {
+                    ++__open_count_;
+                    __first = __parse_ecma_exp(++__temp, __last);
+                    if (__first == __last || *__first != ')')
+                        __throw_regex_error<regex_constants::error_paren>();
+                    --__open_count_;
+                    ++__first;
+                }
+                else
+                {
+                    __push_begin_marked_subexpression();
+                    unsigned __temp_count = __marked_count_;
+                    ++__open_count_;
+                    __first = __parse_ecma_exp(__first, __last);
+                    if (__first == __last || *__first != ')')
+                        __throw_regex_error<regex_constants::error_paren>();
+                    __push_end_marked_subexpression(__temp_count);
+                    --__open_count_;
+                    ++__first;
+                }
+            }
+            break;
+        case '*':
+        case '+':
+        case '?':
+        case '{':
+            __throw_regex_error<regex_constants::error_badrepeat>();
+            break;
+        default:
+            __first = __parse_pattern_character(__first, __last);
+            break;
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_atom_escape(_ForwardIterator __first,
+                                                  _ForwardIterator __last)
+{
+    if (__first != __last && *__first == '\\')
+    {
+        _ForwardIterator __t1 = _VSTD::next(__first);
+        if (__t1 == __last)
+            __throw_regex_error<regex_constants::error_escape>();
+
+        _ForwardIterator __t2 = __parse_decimal_escape(__t1, __last);
+        if (__t2 != __t1)
+            __first = __t2;
+        else
+        {
+            __t2 = __parse_character_class_escape(__t1, __last);
+            if (__t2 != __t1)
+                __first = __t2;
+            else
+            {
+                __t2 = __parse_character_escape(__t1, __last);
+                if (__t2 != __t1)
+                    __first = __t2;
+            }
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_decimal_escape(_ForwardIterator __first,
+                                                     _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        if (*__first == '0')
+        {
+            __push_char(_CharT());
+            ++__first;
+        }
+        else if ('1' <= *__first && *__first <= '9')
+        {
+            unsigned __v = *__first - '0';
+            for (++__first;
+                    __first != __last && '0' <= *__first && *__first <= '9'; ++__first)
+                {
+                if (__v >= numeric_limits<unsigned>::max() / 10)
+                    __throw_regex_error<regex_constants::error_backref>();
+                __v = 10 * __v + *__first - '0';
+                }
+            if (__v == 0 || __v > mark_count())
+                __throw_regex_error<regex_constants::error_backref>();
+            __push_back_ref(__v);
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_character_class_escape(_ForwardIterator __first,
+                                                             _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        __bracket_expression<_CharT, _Traits>* __ml;
+        switch (*__first)
+        {
+        case 'd':
+            __ml = __start_matching_list(false);
+            __ml->__add_class(ctype_base::digit);
+            ++__first;
+            break;
+        case 'D':
+            __ml = __start_matching_list(true);
+            __ml->__add_class(ctype_base::digit);
+            ++__first;
+            break;
+        case 's':
+            __ml = __start_matching_list(false);
+            __ml->__add_class(ctype_base::space);
+            ++__first;
+            break;
+        case 'S':
+            __ml = __start_matching_list(true);
+            __ml->__add_class(ctype_base::space);
+            ++__first;
+            break;
+        case 'w':
+            __ml = __start_matching_list(false);
+            __ml->__add_class(ctype_base::alnum);
+            __ml->__add_char('_');
+            ++__first;
+            break;
+        case 'W':
+            __ml = __start_matching_list(true);
+            __ml->__add_class(ctype_base::alnum);
+            __ml->__add_char('_');
+            ++__first;
+            break;
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_character_escape(_ForwardIterator __first,
+                                                    _ForwardIterator __last,
+                                                    basic_string<_CharT>* __str)
+{
+    if (__first != __last)
+    {
+        _ForwardIterator __t;
+        unsigned __sum = 0;
+        int __hd;
+        switch (*__first)
+        {
+        case 'f':
+            if (__str)
+                *__str = _CharT(0xC);
+            else
+                __push_char(_CharT(0xC));
+            ++__first;
+            break;
+        case 'n':
+            if (__str)
+                *__str = _CharT(0xA);
+            else
+                __push_char(_CharT(0xA));
+            ++__first;
+            break;
+        case 'r':
+            if (__str)
+                *__str = _CharT(0xD);
+            else
+                __push_char(_CharT(0xD));
+            ++__first;
+            break;
+        case 't':
+            if (__str)
+                *__str = _CharT(0x9);
+            else
+                __push_char(_CharT(0x9));
+            ++__first;
+            break;
+        case 'v':
+            if (__str)
+                *__str = _CharT(0xB);
+            else
+                __push_char(_CharT(0xB));
+            ++__first;
+            break;
+        case 'c':
+            if ((__t = _VSTD::next(__first)) != __last)
+            {
+                if (('A' <= *__t && *__t <= 'Z') ||
+                    ('a' <= *__t && *__t <= 'z'))
+                {
+                    if (__str)
+                        *__str = _CharT(*__t % 32);
+                    else
+                        __push_char(_CharT(*__t % 32));
+                    __first = ++__t;
+                }
+                else
+                    __throw_regex_error<regex_constants::error_escape>();
+            }
+            else
+                __throw_regex_error<regex_constants::error_escape>();
+            break;
+        case 'u':
+            ++__first;
+            if (__first == __last)
+                __throw_regex_error<regex_constants::error_escape>();
+            __hd = __traits_.value(*__first, 16);
+            if (__hd == -1)
+                __throw_regex_error<regex_constants::error_escape>();
+            __sum = 16 * __sum + static_cast<unsigned>(__hd);
+            ++__first;
+            if (__first == __last)
+                __throw_regex_error<regex_constants::error_escape>();
+            __hd = __traits_.value(*__first, 16);
+            if (__hd == -1)
+                __throw_regex_error<regex_constants::error_escape>();
+            __sum = 16 * __sum + static_cast<unsigned>(__hd);
+            // fallthrough
+        case 'x':
+            ++__first;
+            if (__first == __last)
+                __throw_regex_error<regex_constants::error_escape>();
+            __hd = __traits_.value(*__first, 16);
+            if (__hd == -1)
+                __throw_regex_error<regex_constants::error_escape>();
+            __sum = 16 * __sum + static_cast<unsigned>(__hd);
+            ++__first;
+            if (__first == __last)
+                __throw_regex_error<regex_constants::error_escape>();
+            __hd = __traits_.value(*__first, 16);
+            if (__hd == -1)
+                __throw_regex_error<regex_constants::error_escape>();
+            __sum = 16 * __sum + static_cast<unsigned>(__hd);
+            if (__str)
+                *__str = _CharT(__sum);
+            else
+                __push_char(_CharT(__sum));
+            ++__first;
+            break;
+        case '0':
+            if (__str)
+                *__str = _CharT(0);
+            else
+                __push_char(_CharT(0));
+            ++__first;
+            break;
+        default:
+            if (*__first != '_' && !__traits_.isctype(*__first, ctype_base::alnum))
+            {
+                if (__str)
+                    *__str = *__first;
+                else
+                    __push_char(*__first);
+                ++__first;
+            }
+            else
+                __throw_regex_error<regex_constants::error_escape>();
+            break;
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_pattern_character(_ForwardIterator __first,
+                                                        _ForwardIterator __last)
+{
+    if (__first != __last)
+    {
+        switch (*__first)
+        {
+        case '^':
+        case '$':
+        case '\\':
+        case '.':
+        case '*':
+        case '+':
+        case '?':
+        case '(':
+        case ')':
+        case '[':
+        case ']':
+        case '{':
+        case '}':
+        case '|':
+            break;
+        default:
+            __push_char(*__first);
+            ++__first;
+            break;
+        }
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_grep(_ForwardIterator __first,
+                                           _ForwardIterator __last)
+{
+    __owns_one_state<_CharT>* __sa = __end_;
+    _ForwardIterator __t1 = _VSTD::find(__first, __last, _CharT('\n'));
+    if (__t1 != __first)
+        __parse_basic_reg_exp(__first, __t1);
+    else
+        __push_empty();
+    __first = __t1;
+    if (__first != __last)
+        ++__first;
+    while (__first != __last)
+    {
+        __t1 = _VSTD::find(__first, __last, _CharT('\n'));
+        __owns_one_state<_CharT>* __sb = __end_;
+        if (__t1 != __first)
+            __parse_basic_reg_exp(__first, __t1);
+        else
+            __push_empty();
+        __push_alternation(__sa, __sb);
+        __first = __t1;
+        if (__first != __last)
+            ++__first;
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+template <class _ForwardIterator>
+_ForwardIterator
+basic_regex<_CharT, _Traits>::__parse_egrep(_ForwardIterator __first,
+                                            _ForwardIterator __last)
+{
+    __owns_one_state<_CharT>* __sa = __end_;
+    _ForwardIterator __t1 = _VSTD::find(__first, __last, _CharT('\n'));
+    if (__t1 != __first)
+        __parse_extended_reg_exp(__first, __t1);
+    else
+        __push_empty();
+    __first = __t1;
+    if (__first != __last)
+        ++__first;
+    while (__first != __last)
+    {
+        __t1 = _VSTD::find(__first, __last, _CharT('\n'));
+        __owns_one_state<_CharT>* __sb = __end_;
+        if (__t1 != __first)
+            __parse_extended_reg_exp(__first, __t1);
+        else
+            __push_empty();
+        __push_alternation(__sa, __sb);
+        __first = __t1;
+        if (__first != __last)
+            ++__first;
+    }
+    return __first;
+}
+
+template <class _CharT, class _Traits>
+bool
+basic_regex<_CharT, _Traits>::__test_back_ref(_CharT __c)
+{
+    unsigned __val = __traits_.value(__c, 10);
+    if (__val >= 1 && __val <= 9)
+    {
+        if (__val > mark_count())
+            __throw_regex_error<regex_constants::error_backref>();
+        __push_back_ref(__val);
+        return true;
+    }
+
+    return false;
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_loop(size_t __min, size_t __max,
+        __owns_one_state<_CharT>* __s, size_t __mexp_begin, size_t __mexp_end,
+        bool __greedy)
+{
+    unique_ptr<__empty_state<_CharT> > __e1(new __empty_state<_CharT>(__end_->first()));
+    __end_->first() = nullptr;
+    unique_ptr<__loop<_CharT> > __e2(new __loop<_CharT>(__loop_count_,
+                __s->first(), __e1.get(), __mexp_begin, __mexp_end, __greedy,
+                __min, __max));
+    __s->first() = nullptr;
+    __e1.release();
+    __end_->first() = new __repeat_one_loop<_CharT>(__e2.get());
+    __end_ = __e2->second();
+    __s->first() = __e2.release();
+    ++__loop_count_;
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_char(value_type __c)
+{
+    if (flags() & icase)
+        __end_->first() = new __match_char_icase<_CharT, _Traits>
+                                              (__traits_, __c, __end_->first());
+    else if (flags() & collate)
+        __end_->first() = new __match_char_collate<_CharT, _Traits>
+                                              (__traits_, __c, __end_->first());
+    else
+        __end_->first() = new __match_char<_CharT>(__c, __end_->first());
+    __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_begin_marked_subexpression()
+{
+    if (!(__flags_ & nosubs))
+    {
+        __end_->first() =
+                new __begin_marked_subexpression<_CharT>(++__marked_count_,
+                                                         __end_->first());
+        __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
+    }
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_end_marked_subexpression(unsigned __sub)
+{
+    if (!(__flags_ & nosubs))
+    {
+        __end_->first() =
+                new __end_marked_subexpression<_CharT>(__sub, __end_->first());
+        __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
+    }
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_l_anchor()
+{
+    __end_->first() = new __l_anchor_multiline<_CharT>(__use_multiline(), __end_->first());
+    __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_r_anchor()
+{
+    __end_->first() = new __r_anchor_multiline<_CharT>(__use_multiline(), __end_->first());
+    __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_match_any()
+{
+    __end_->first() = new __match_any<_CharT>(__end_->first());
+    __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_match_any_but_newline()
+{
+    __end_->first() = new __match_any_but_newline<_CharT>(__end_->first());
+    __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_empty()
+{
+    __end_->first() = new __empty_state<_CharT>(__end_->first());
+    __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_word_boundary(bool __invert)
+{
+    __end_->first() = new __word_boundary<_CharT, _Traits>(__traits_, __invert,
+                                                           __end_->first());
+    __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_back_ref(int __i)
+{
+    if (flags() & icase)
+        __end_->first() = new __back_ref_icase<_CharT, _Traits>
+                                              (__traits_, __i, __end_->first());
+    else if (flags() & collate)
+        __end_->first() = new __back_ref_collate<_CharT, _Traits>
+                                              (__traits_, __i, __end_->first());
+    else
+        __end_->first() = new __back_ref<_CharT>(__i, __end_->first());
+    __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_alternation(__owns_one_state<_CharT>* __sa,
+                                                 __owns_one_state<_CharT>* __ea)
+{
+    __sa->first() = new __alternate<_CharT>(
+                         static_cast<__owns_one_state<_CharT>*>(__sa->first()),
+                         static_cast<__owns_one_state<_CharT>*>(__ea->first()));
+    __ea->first() = nullptr;
+    __ea->first() = new __empty_state<_CharT>(__end_->first());
+    __end_->first() = nullptr;
+    __end_->first() = new __empty_non_own_state<_CharT>(__ea->first());
+    __end_ = static_cast<__owns_one_state<_CharT>*>(__ea->first());
+}
+
+template <class _CharT, class _Traits>
+__bracket_expression<_CharT, _Traits>*
+basic_regex<_CharT, _Traits>::__start_matching_list(bool __negate)
+{
+    __bracket_expression<_CharT, _Traits>* __r =
+        new __bracket_expression<_CharT, _Traits>(__traits_, __end_->first(),
+                                                  __negate, __flags_ & icase,
+                                                  __flags_ & collate);
+    __end_->first() = __r;
+    __end_ = __r;
+    return __r;
+}
+
+template <class _CharT, class _Traits>
+void
+basic_regex<_CharT, _Traits>::__push_lookahead(const basic_regex& __exp,
+                                               bool __invert,
+                                               unsigned __mexp)
+{
+    __end_->first() = new __lookahead<_CharT, _Traits>(__exp, __invert,
+                                                           __end_->first(), __mexp);
+    __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
+}
+
+// sub_match
+
+typedef sub_match<const char*>             csub_match;
+typedef sub_match<string::const_iterator>  ssub_match;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+typedef sub_match<const wchar_t*>          wcsub_match;
+typedef sub_match<wstring::const_iterator> wssub_match;
+#endif
+
+template <class _BidirectionalIterator>
+class
+    _LIBCPP_TEMPLATE_VIS
+    _LIBCPP_PREFERRED_NAME(csub_match)
+    _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wcsub_match))
+    _LIBCPP_PREFERRED_NAME(ssub_match)
+    _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wssub_match))
+    sub_match
+    : public pair<_BidirectionalIterator, _BidirectionalIterator>
+{
+public:
+    typedef _BidirectionalIterator                              iterator;
+    typedef typename iterator_traits<iterator>::value_type      value_type;
+    typedef typename iterator_traits<iterator>::difference_type difference_type;
+    typedef basic_string<value_type>                            string_type;
+
+    bool matched;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR sub_match() : matched() {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    difference_type length() const
+        {return matched ? _VSTD::distance(this->first, this->second) : 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    string_type str() const
+        {return matched ? string_type(this->first, this->second) : string_type();}
+    _LIBCPP_INLINE_VISIBILITY
+    operator string_type() const
+        {return str();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    int compare(const sub_match& __s) const
+        {return str().compare(__s.str());}
+    _LIBCPP_INLINE_VISIBILITY
+    int compare(const string_type& __s) const
+        {return str().compare(__s);}
+    _LIBCPP_INLINE_VISIBILITY
+    int compare(const value_type* __s) const
+        {return str().compare(__s);}
+};
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const sub_match<_BiIter>& __x, const sub_match<_BiIter>& __y)
+{
+    return __x.compare(__y) == 0;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const sub_match<_BiIter>& __x, const sub_match<_BiIter>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<(const sub_match<_BiIter>& __x, const sub_match<_BiIter>& __y)
+{
+    return __x.compare(__y) < 0;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const sub_match<_BiIter>& __x, const sub_match<_BiIter>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const sub_match<_BiIter>& __x, const sub_match<_BiIter>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>(const sub_match<_BiIter>& __x, const sub_match<_BiIter>& __y)
+{
+    return __y < __x;
+}
+
+template <class _BiIter, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const basic_string<typename iterator_traits<_BiIter>::value_type, _ST, _SA>& __x,
+           const sub_match<_BiIter>& __y)
+{
+    return __y.compare(typename sub_match<_BiIter>::string_type(__x.data(), __x.size())) == 0;
+}
+
+template <class _BiIter, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const basic_string<typename iterator_traits<_BiIter>::value_type, _ST, _SA>& __x,
+           const sub_match<_BiIter>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _BiIter, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<(const basic_string<typename iterator_traits<_BiIter>::value_type, _ST, _SA>& __x,
+          const sub_match<_BiIter>& __y)
+{
+    return __y.compare(typename sub_match<_BiIter>::string_type(__x.data(), __x.size())) > 0;
+}
+
+template <class _BiIter, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>(const basic_string<typename iterator_traits<_BiIter>::value_type, _ST, _SA>& __x,
+          const sub_match<_BiIter>& __y)
+{
+    return __y < __x;
+}
+
+template <class _BiIter, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator>=(const basic_string<typename iterator_traits<_BiIter>::value_type, _ST, _SA>& __x,
+                const sub_match<_BiIter>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _BiIter, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const basic_string<typename iterator_traits<_BiIter>::value_type, _ST, _SA>& __x,
+           const sub_match<_BiIter>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _BiIter, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const sub_match<_BiIter>& __x,
+           const basic_string<typename iterator_traits<_BiIter>::value_type, _ST, _SA>& __y)
+{
+    return __x.compare(typename sub_match<_BiIter>::string_type(__y.data(), __y.size())) == 0;
+}
+
+template <class _BiIter, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const sub_match<_BiIter>& __x,
+           const basic_string<typename iterator_traits<_BiIter>::value_type, _ST, _SA>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _BiIter, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<(const sub_match<_BiIter>& __x,
+          const basic_string<typename iterator_traits<_BiIter>::value_type, _ST, _SA>& __y)
+{
+    return __x.compare(typename sub_match<_BiIter>::string_type(__y.data(), __y.size())) < 0;
+}
+
+template <class _BiIter, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+bool operator>(const sub_match<_BiIter>& __x,
+               const basic_string<typename iterator_traits<_BiIter>::value_type, _ST, _SA>& __y)
+{
+    return __y < __x;
+}
+
+template <class _BiIter, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const sub_match<_BiIter>& __x,
+           const basic_string<typename iterator_traits<_BiIter>::value_type, _ST, _SA>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _BiIter, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const sub_match<_BiIter>& __x,
+           const basic_string<typename iterator_traits<_BiIter>::value_type, _ST, _SA>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(typename iterator_traits<_BiIter>::value_type const* __x,
+           const sub_match<_BiIter>& __y)
+{
+    return __y.compare(__x) == 0;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(typename iterator_traits<_BiIter>::value_type const* __x,
+           const sub_match<_BiIter>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<(typename iterator_traits<_BiIter>::value_type const* __x,
+          const sub_match<_BiIter>& __y)
+{
+    return __y.compare(__x) > 0;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>(typename iterator_traits<_BiIter>::value_type const* __x,
+          const sub_match<_BiIter>& __y)
+{
+    return __y < __x;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(typename iterator_traits<_BiIter>::value_type const* __x,
+           const sub_match<_BiIter>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(typename iterator_traits<_BiIter>::value_type const* __x,
+           const sub_match<_BiIter>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const sub_match<_BiIter>& __x,
+           typename iterator_traits<_BiIter>::value_type const* __y)
+{
+    return __x.compare(__y) == 0;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const sub_match<_BiIter>& __x,
+           typename iterator_traits<_BiIter>::value_type const* __y)
+{
+    return !(__x == __y);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<(const sub_match<_BiIter>& __x,
+          typename iterator_traits<_BiIter>::value_type const* __y)
+{
+    return __x.compare(__y) < 0;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>(const sub_match<_BiIter>& __x,
+          typename iterator_traits<_BiIter>::value_type const* __y)
+{
+    return __y < __x;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const sub_match<_BiIter>& __x,
+           typename iterator_traits<_BiIter>::value_type const* __y)
+{
+    return !(__x < __y);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const sub_match<_BiIter>& __x,
+           typename iterator_traits<_BiIter>::value_type const* __y)
+{
+    return !(__y < __x);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(typename iterator_traits<_BiIter>::value_type const& __x,
+           const sub_match<_BiIter>& __y)
+{
+    typedef basic_string<typename iterator_traits<_BiIter>::value_type> string_type;
+    return __y.compare(string_type(1, __x)) == 0;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(typename iterator_traits<_BiIter>::value_type const& __x,
+           const sub_match<_BiIter>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<(typename iterator_traits<_BiIter>::value_type const& __x,
+          const sub_match<_BiIter>& __y)
+{
+    typedef basic_string<typename iterator_traits<_BiIter>::value_type> string_type;
+    return __y.compare(string_type(1, __x)) > 0;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>(typename iterator_traits<_BiIter>::value_type const& __x,
+          const sub_match<_BiIter>& __y)
+{
+    return __y < __x;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(typename iterator_traits<_BiIter>::value_type const& __x,
+           const sub_match<_BiIter>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(typename iterator_traits<_BiIter>::value_type const& __x,
+           const sub_match<_BiIter>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const sub_match<_BiIter>& __x,
+           typename iterator_traits<_BiIter>::value_type const& __y)
+{
+    typedef basic_string<typename iterator_traits<_BiIter>::value_type> string_type;
+    return __x.compare(string_type(1, __y)) == 0;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const sub_match<_BiIter>& __x,
+           typename iterator_traits<_BiIter>::value_type const& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<(const sub_match<_BiIter>& __x,
+          typename iterator_traits<_BiIter>::value_type const& __y)
+{
+    typedef basic_string<typename iterator_traits<_BiIter>::value_type> string_type;
+    return __x.compare(string_type(1, __y)) < 0;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>(const sub_match<_BiIter>& __x,
+          typename iterator_traits<_BiIter>::value_type const& __y)
+{
+    return __y < __x;
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const sub_match<_BiIter>& __x,
+           typename iterator_traits<_BiIter>::value_type const& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const sub_match<_BiIter>& __x,
+           typename iterator_traits<_BiIter>::value_type const& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _CharT, class _ST, class _BiIter>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_ostream<_CharT, _ST>&
+operator<<(basic_ostream<_CharT, _ST>& __os, const sub_match<_BiIter>& __m)
+{
+    return __os << __m.str();
+}
+
+typedef match_results<const char*>             cmatch;
+typedef match_results<string::const_iterator>  smatch;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+typedef match_results<const wchar_t*>          wcmatch;
+typedef match_results<wstring::const_iterator> wsmatch;
+#endif
+
+template <class _BidirectionalIterator, class _Allocator>
+class
+    _LIBCPP_TEMPLATE_VIS
+    _LIBCPP_PREFERRED_NAME(cmatch)
+    _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wcmatch))
+    _LIBCPP_PREFERRED_NAME(smatch)
+    _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wsmatch))
+    match_results
+{
+public:
+    typedef _Allocator                                        allocator_type;
+    typedef sub_match<_BidirectionalIterator>                 value_type;
+private:
+    typedef vector<value_type, allocator_type>                __container_type;
+
+    __container_type  __matches_;
+    value_type __unmatched_;
+    value_type __prefix_;
+    value_type __suffix_;
+    bool       __ready_;
+public:
+    _BidirectionalIterator __position_start_;
+    typedef const value_type&                                 const_reference;
+    typedef value_type&                                       reference;
+    typedef typename __container_type::const_iterator         const_iterator;
+    typedef const_iterator                                    iterator;
+    typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type;
+    typedef typename allocator_traits<allocator_type>::size_type size_type;
+    typedef typename iterator_traits<_BidirectionalIterator>::value_type char_type;
+    typedef basic_string<char_type>                           string_type;
+
+    // construct/copy/destroy:
+#ifndef _LIBCPP_CXX03_LANG
+    match_results() : match_results(allocator_type()) {}
+    explicit match_results(const allocator_type& __a);
+#else
+    explicit match_results(const allocator_type& __a = allocator_type());
+#endif
+
+//    match_results(const match_results&) = default;
+//    match_results& operator=(const match_results&) = default;
+//    match_results(match_results&& __m) = default;
+//    match_results& operator=(match_results&& __m) = default;
+//    ~match_results() = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool ready() const {return __ready_;}
+
+    // size:
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const _NOEXCEPT {return __matches_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT {return __matches_.max_size();}
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool empty() const _NOEXCEPT {return size() == 0;}
+
+    // element access:
+    _LIBCPP_INLINE_VISIBILITY
+    difference_type length(size_type __sub = 0) const
+        {
+        _LIBCPP_ASSERT(ready(), "match_results::length() called when not ready");
+        return (*this)[__sub].length();
+        }
+    _LIBCPP_INLINE_VISIBILITY
+    difference_type position(size_type __sub = 0) const
+        {
+        _LIBCPP_ASSERT(ready(), "match_results::position() called when not ready");
+        return _VSTD::distance(__position_start_, (*this)[__sub].first);
+        }
+    _LIBCPP_INLINE_VISIBILITY
+    string_type str(size_type __sub = 0) const
+        {
+        _LIBCPP_ASSERT(ready(), "match_results::str() called when not ready");
+        return (*this)[__sub].str();
+        }
+    _LIBCPP_INLINE_VISIBILITY
+    const_reference operator[](size_type __n) const
+        {
+        _LIBCPP_ASSERT(ready(), "match_results::operator[]() called when not ready");
+        return __n < __matches_.size() ? __matches_[__n] : __unmatched_;
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const_reference prefix() const
+        {
+        _LIBCPP_ASSERT(ready(), "match_results::prefix() called when not ready");
+        return __prefix_;
+        }
+    _LIBCPP_INLINE_VISIBILITY
+    const_reference suffix() const
+        {
+        _LIBCPP_ASSERT(ready(), "match_results::suffix() called when not ready");
+        return __suffix_;
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin() const {return empty() ? __matches_.end() : __matches_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end() const {return __matches_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbegin() const {return empty() ? __matches_.end() : __matches_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cend() const {return __matches_.end();}
+
+    // format:
+    template <class _OutputIter>
+        _OutputIter
+        format(_OutputIter __output_iter, const char_type* __fmt_first,
+               const char_type* __fmt_last,
+               regex_constants::match_flag_type __flags = regex_constants::format_default) const;
+    template <class _OutputIter, class _ST, class _SA>
+        _LIBCPP_INLINE_VISIBILITY
+        _OutputIter
+        format(_OutputIter __output_iter, const basic_string<char_type, _ST, _SA>& __fmt,
+               regex_constants::match_flag_type __flags = regex_constants::format_default) const
+            {return format(__output_iter, __fmt.data(), __fmt.data() + __fmt.size(), __flags);}
+    template <class _ST, class _SA>
+        _LIBCPP_INLINE_VISIBILITY
+        basic_string<char_type, _ST, _SA>
+        format(const basic_string<char_type, _ST, _SA>& __fmt,
+               regex_constants::match_flag_type __flags = regex_constants::format_default) const
+        {
+            basic_string<char_type, _ST, _SA> __r;
+            format(std::back_inserter(__r), __fmt.data(), __fmt.data() + __fmt.size(),
+                   __flags);
+            return __r;
+        }
+    _LIBCPP_INLINE_VISIBILITY
+    string_type
+        format(const char_type* __fmt,
+               regex_constants::match_flag_type __flags = regex_constants::format_default) const
+        {
+            string_type __r;
+            format(std::back_inserter(__r), __fmt,
+                   __fmt + char_traits<char_type>::length(__fmt), __flags);
+            return __r;
+        }
+
+    // allocator:
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const {return __matches_.get_allocator();}
+
+    // swap:
+    void swap(match_results& __m);
+
+    template <class _Bp, class _Ap>
+        _LIBCPP_INLINE_VISIBILITY
+        void __assign(_BidirectionalIterator __f, _BidirectionalIterator __l,
+                      const match_results<_Bp, _Ap>& __m, bool __no_update_pos)
+    {
+        _Bp __mf = __m.prefix().first;
+        __matches_.resize(__m.size());
+        for (size_type __i = 0; __i < __matches_.size(); ++__i)
+        {
+            __matches_[__i].first = _VSTD::next(__f, _VSTD::distance(__mf, __m[__i].first));
+            __matches_[__i].second = _VSTD::next(__f, _VSTD::distance(__mf, __m[__i].second));
+            __matches_[__i].matched = __m[__i].matched;
+        }
+        __unmatched_.first   = __l;
+        __unmatched_.second  = __l;
+        __unmatched_.matched = false;
+        __prefix_.first = _VSTD::next(__f, _VSTD::distance(__mf, __m.prefix().first));
+        __prefix_.second = _VSTD::next(__f, _VSTD::distance(__mf, __m.prefix().second));
+        __prefix_.matched = __m.prefix().matched;
+        __suffix_.first = _VSTD::next(__f, _VSTD::distance(__mf, __m.suffix().first));
+        __suffix_.second = _VSTD::next(__f, _VSTD::distance(__mf, __m.suffix().second));
+        __suffix_.matched = __m.suffix().matched;
+        if (!__no_update_pos)
+            __position_start_ = __prefix_.first;
+        __ready_ = __m.ready();
+    }
+
+private:
+    void __init(unsigned __s,
+                _BidirectionalIterator __f, _BidirectionalIterator __l,
+                bool __no_update_pos = false);
+
+    template <class, class> friend class basic_regex;
+
+    template <class _Bp, class _Ap, class _Cp, class _Tp>
+    friend
+    bool
+    regex_match(_Bp, _Bp, match_results<_Bp, _Ap>&, const basic_regex<_Cp, _Tp>&,
+                regex_constants::match_flag_type);
+
+    template <class _Bp, class _Ap>
+    friend
+    bool
+    operator==(const match_results<_Bp, _Ap>&, const match_results<_Bp, _Ap>&);
+
+    template <class, class> friend class __lookahead;
+};
+
+template <class _BidirectionalIterator, class _Allocator>
+match_results<_BidirectionalIterator, _Allocator>::match_results(
+        const allocator_type& __a)
+    : __matches_(__a),
+      __unmatched_(),
+      __prefix_(),
+      __suffix_(),
+      __ready_(false),
+      __position_start_()
+{
+}
+
+template <class _BidirectionalIterator, class _Allocator>
+void
+match_results<_BidirectionalIterator, _Allocator>::__init(unsigned __s,
+                         _BidirectionalIterator __f, _BidirectionalIterator __l,
+                         bool __no_update_pos)
+{
+    __unmatched_.first   = __l;
+    __unmatched_.second  = __l;
+    __unmatched_.matched = false;
+    __matches_.assign(__s, __unmatched_);
+    __prefix_.first      = __f;
+    __prefix_.second     = __f;
+    __prefix_.matched    = false;
+    __suffix_ = __unmatched_;
+    if (!__no_update_pos)
+        __position_start_ = __prefix_.first;
+    __ready_ = true;
+}
+
+template <class _BidirectionalIterator, class _Allocator>
+template <class _OutputIter>
+_OutputIter
+match_results<_BidirectionalIterator, _Allocator>::format(_OutputIter __output_iter,
+        const char_type* __fmt_first, const char_type* __fmt_last,
+        regex_constants::match_flag_type __flags) const
+{
+    _LIBCPP_ASSERT(ready(), "match_results::format() called when not ready");
+    if (__flags & regex_constants::format_sed)
+    {
+        for (; __fmt_first != __fmt_last; ++__fmt_first)
+        {
+            if (*__fmt_first == '&')
+                __output_iter = _VSTD::copy(__matches_[0].first, __matches_[0].second,
+                                   __output_iter);
+            else if (*__fmt_first == '\\' && __fmt_first + 1 != __fmt_last)
+            {
+                ++__fmt_first;
+                if ('0' <= *__fmt_first && *__fmt_first <= '9')
+                {
+                    size_t __i = *__fmt_first - '0';
+                    __output_iter = _VSTD::copy((*this)[__i].first,
+                                        (*this)[__i].second, __output_iter);
+                }
+                else
+                {
+                    *__output_iter = *__fmt_first;
+                    ++__output_iter;
+                }
+            }
+            else
+            {
+                *__output_iter = *__fmt_first;
+                ++__output_iter;
+            }
+        }
+    }
+    else
+    {
+        for (; __fmt_first != __fmt_last; ++__fmt_first)
+        {
+            if (*__fmt_first == '$' && __fmt_first + 1 != __fmt_last)
+            {
+                switch (__fmt_first[1])
+                {
+                case '$':
+                    *__output_iter = *++__fmt_first;
+                    ++__output_iter;
+                    break;
+                case '&':
+                    ++__fmt_first;
+                    __output_iter = _VSTD::copy(__matches_[0].first, __matches_[0].second,
+                                       __output_iter);
+                    break;
+                case '`':
+                    ++__fmt_first;
+                    __output_iter = _VSTD::copy(__prefix_.first, __prefix_.second, __output_iter);
+                    break;
+                case '\'':
+                    ++__fmt_first;
+                    __output_iter = _VSTD::copy(__suffix_.first, __suffix_.second, __output_iter);
+                    break;
+                default:
+                    if ('0' <= __fmt_first[1] && __fmt_first[1] <= '9')
+                    {
+                        ++__fmt_first;
+                        size_t __idx = *__fmt_first - '0';
+                        if (__fmt_first + 1 != __fmt_last &&
+                            '0' <= __fmt_first[1] && __fmt_first[1] <= '9')
+                        {
+                            ++__fmt_first;
+                            if (__idx >= numeric_limits<size_t>::max() / 10)
+                                __throw_regex_error<regex_constants::error_escape>();
+                            __idx = 10 * __idx + *__fmt_first - '0';
+                        }
+                        __output_iter = _VSTD::copy((*this)[__idx].first,
+                                            (*this)[__idx].second, __output_iter);
+                    }
+                    else
+                    {
+                        *__output_iter = *__fmt_first;
+                        ++__output_iter;
+                    }
+                    break;
+                }
+            }
+            else
+            {
+                *__output_iter = *__fmt_first;
+                ++__output_iter;
+            }
+        }
+    }
+    return __output_iter;
+}
+
+template <class _BidirectionalIterator, class _Allocator>
+void
+match_results<_BidirectionalIterator, _Allocator>::swap(match_results& __m)
+{
+    using _VSTD::swap;
+    swap(__matches_, __m.__matches_);
+    swap(__unmatched_, __m.__unmatched_);
+    swap(__prefix_, __m.__prefix_);
+    swap(__suffix_, __m.__suffix_);
+    swap(__position_start_, __m.__position_start_);
+    swap(__ready_, __m.__ready_);
+}
+
+template <class _BidirectionalIterator, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(const match_results<_BidirectionalIterator, _Allocator>& __x,
+           const match_results<_BidirectionalIterator, _Allocator>& __y)
+{
+    if (__x.__ready_ != __y.__ready_)
+        return false;
+    if (!__x.__ready_)
+        return true;
+    return __x.__matches_ == __y.__matches_ &&
+           __x.__prefix_ == __y.__prefix_ &&
+           __x.__suffix_ == __y.__suffix_;
+}
+
+template <class _BidirectionalIterator, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const match_results<_BidirectionalIterator, _Allocator>& __x,
+           const match_results<_BidirectionalIterator, _Allocator>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _BidirectionalIterator, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(match_results<_BidirectionalIterator, _Allocator>& __x,
+     match_results<_BidirectionalIterator, _Allocator>& __y)
+{
+    __x.swap(__y);
+}
+
+// regex_search
+
+template <class _CharT, class _Traits>
+template <class _Allocator>
+bool
+basic_regex<_CharT, _Traits>::__match_at_start_ecma(
+        const _CharT* __first, const _CharT* __last,
+        match_results<const _CharT*, _Allocator>& __m,
+        regex_constants::match_flag_type __flags, bool __at_first) const
+{
+    vector<__state> __states;
+    __node* __st = __start_.get();
+    if (__st)
+    {
+        sub_match<const _CharT*> __unmatched;
+        __unmatched.first   = __last;
+        __unmatched.second  = __last;
+        __unmatched.matched = false;
+
+        __states.push_back(__state());
+        __states.back().__do_ = 0;
+        __states.back().__first_ = __first;
+        __states.back().__current_ = __first;
+        __states.back().__last_ = __last;
+        __states.back().__sub_matches_.resize(mark_count(), __unmatched);
+        __states.back().__loop_data_.resize(__loop_count());
+        __states.back().__node_ = __st;
+        __states.back().__flags_ = __flags;
+        __states.back().__at_first_ = __at_first;
+        int __counter = 0;
+        int __length = __last - __first;
+        do
+        {
+            ++__counter;
+            if (__counter % _LIBCPP_REGEX_COMPLEXITY_FACTOR == 0 &&
+                __counter / _LIBCPP_REGEX_COMPLEXITY_FACTOR >= __length)
+              __throw_regex_error<regex_constants::error_complexity>();
+            __state& __s = __states.back();
+            if (__s.__node_)
+                __s.__node_->__exec(__s);
+            switch (__s.__do_)
+            {
+            case __state::__end_state:
+                if ((__flags & regex_constants::match_not_null) &&
+                    __s.__current_ == __first)
+                {
+                  __states.pop_back();
+                  break;
+                }
+                if ((__flags & regex_constants::__full_match) &&
+                    __s.__current_ != __last)
+                {
+                  __states.pop_back();
+                  break;
+                }
+                __m.__matches_[0].first = __first;
+                __m.__matches_[0].second = _VSTD::next(__first, __s.__current_ - __first);
+                __m.__matches_[0].matched = true;
+                for (unsigned __i = 0; __i < __s.__sub_matches_.size(); ++__i)
+                    __m.__matches_[__i+1] = __s.__sub_matches_[__i];
+                return true;
+            case __state::__accept_and_consume:
+            case __state::__repeat:
+            case __state::__accept_but_not_consume:
+                break;
+            case __state::__split:
+                {
+                __state __snext = __s;
+                __s.__node_->__exec_split(true, __s);
+                __snext.__node_->__exec_split(false, __snext);
+                __states.push_back(_VSTD::move(__snext));
+                }
+                break;
+            case __state::__reject:
+                __states.pop_back();
+                break;
+            default:
+                __throw_regex_error<regex_constants::__re_err_unknown>();
+                break;
+
+            }
+        } while (!__states.empty());
+    }
+    return false;
+}
+
+template <class _CharT, class _Traits>
+template <class _Allocator>
+bool
+basic_regex<_CharT, _Traits>::__match_at_start_posix_nosubs(
+        const _CharT* __first, const _CharT* __last,
+        match_results<const _CharT*, _Allocator>& __m,
+        regex_constants::match_flag_type __flags, bool __at_first) const
+{
+    deque<__state> __states;
+    ptrdiff_t __highest_j = 0;
+    ptrdiff_t _Np = _VSTD::distance(__first, __last);
+    __node* __st = __start_.get();
+    if (__st)
+    {
+        __states.push_back(__state());
+        __states.back().__do_ = 0;
+        __states.back().__first_ = __first;
+        __states.back().__current_ = __first;
+        __states.back().__last_ = __last;
+        __states.back().__loop_data_.resize(__loop_count());
+        __states.back().__node_ = __st;
+        __states.back().__flags_ = __flags;
+        __states.back().__at_first_ = __at_first;
+        bool __matched = false;
+        int __counter = 0;
+        int __length = __last - __first;
+        do
+        {
+            ++__counter;
+            if (__counter % _LIBCPP_REGEX_COMPLEXITY_FACTOR == 0 &&
+                __counter / _LIBCPP_REGEX_COMPLEXITY_FACTOR >= __length)
+              __throw_regex_error<regex_constants::error_complexity>();
+            __state& __s = __states.back();
+            if (__s.__node_)
+                __s.__node_->__exec(__s);
+            switch (__s.__do_)
+            {
+            case __state::__end_state:
+                if ((__flags & regex_constants::match_not_null) &&
+                    __s.__current_ == __first)
+                {
+                  __states.pop_back();
+                  break;
+                }
+                if ((__flags & regex_constants::__full_match) &&
+                    __s.__current_ != __last)
+                {
+                  __states.pop_back();
+                  break;
+                }
+                if (!__matched || __highest_j < __s.__current_ - __s.__first_)
+                    __highest_j = __s.__current_ - __s.__first_;
+                __matched = true;
+                if (__highest_j == _Np)
+                    __states.clear();
+                else
+                    __states.pop_back();
+                break;
+            case __state::__consume_input:
+                break;
+            case __state::__accept_and_consume:
+                __states.push_front(_VSTD::move(__s));
+                __states.pop_back();
+                break;
+            case __state::__repeat:
+            case __state::__accept_but_not_consume:
+                break;
+            case __state::__split:
+                {
+                __state __snext = __s;
+                __s.__node_->__exec_split(true, __s);
+                __snext.__node_->__exec_split(false, __snext);
+                __states.push_back(_VSTD::move(__snext));
+                }
+                break;
+            case __state::__reject:
+                __states.pop_back();
+                break;
+            default:
+                __throw_regex_error<regex_constants::__re_err_unknown>();
+                break;
+            }
+        } while (!__states.empty());
+        if (__matched)
+        {
+            __m.__matches_[0].first = __first;
+            __m.__matches_[0].second = _VSTD::next(__first, __highest_j);
+            __m.__matches_[0].matched = true;
+            return true;
+        }
+    }
+    return false;
+}
+
+template <class _CharT, class _Traits>
+template <class _Allocator>
+bool
+basic_regex<_CharT, _Traits>::__match_at_start_posix_subs(
+        const _CharT* __first, const _CharT* __last,
+        match_results<const _CharT*, _Allocator>& __m,
+        regex_constants::match_flag_type __flags, bool __at_first) const
+{
+    vector<__state> __states;
+    __state __best_state;
+    ptrdiff_t __highest_j = 0;
+    ptrdiff_t _Np = _VSTD::distance(__first, __last);
+    __node* __st = __start_.get();
+    if (__st)
+    {
+        sub_match<const _CharT*> __unmatched;
+        __unmatched.first   = __last;
+        __unmatched.second  = __last;
+        __unmatched.matched = false;
+
+        __states.push_back(__state());
+        __states.back().__do_ = 0;
+        __states.back().__first_ = __first;
+        __states.back().__current_ = __first;
+        __states.back().__last_ = __last;
+        __states.back().__sub_matches_.resize(mark_count(), __unmatched);
+        __states.back().__loop_data_.resize(__loop_count());
+        __states.back().__node_ = __st;
+        __states.back().__flags_ = __flags;
+        __states.back().__at_first_ = __at_first;
+        bool __matched = false;
+        int __counter = 0;
+        int __length = __last - __first;
+        do
+        {
+            ++__counter;
+            if (__counter % _LIBCPP_REGEX_COMPLEXITY_FACTOR == 0 &&
+                __counter / _LIBCPP_REGEX_COMPLEXITY_FACTOR >= __length)
+              __throw_regex_error<regex_constants::error_complexity>();
+            __state& __s = __states.back();
+            if (__s.__node_)
+                __s.__node_->__exec(__s);
+            switch (__s.__do_)
+            {
+            case __state::__end_state:
+                if ((__flags & regex_constants::match_not_null) &&
+                    __s.__current_ == __first)
+                {
+                  __states.pop_back();
+                  break;
+                }
+                if ((__flags & regex_constants::__full_match) &&
+                    __s.__current_ != __last)
+                {
+                  __states.pop_back();
+                  break;
+                }
+                if (!__matched || __highest_j < __s.__current_ - __s.__first_)
+                {
+                    __highest_j = __s.__current_ - __s.__first_;
+                    __best_state = __s;
+                }
+                __matched = true;
+                if (__highest_j == _Np)
+                    __states.clear();
+                else
+                    __states.pop_back();
+                break;
+            case __state::__accept_and_consume:
+            case __state::__repeat:
+            case __state::__accept_but_not_consume:
+                break;
+            case __state::__split:
+                {
+                __state __snext = __s;
+                __s.__node_->__exec_split(true, __s);
+                __snext.__node_->__exec_split(false, __snext);
+                __states.push_back(_VSTD::move(__snext));
+                }
+                break;
+            case __state::__reject:
+                __states.pop_back();
+                break;
+            default:
+                __throw_regex_error<regex_constants::__re_err_unknown>();
+                break;
+            }
+        } while (!__states.empty());
+        if (__matched)
+        {
+            __m.__matches_[0].first = __first;
+            __m.__matches_[0].second = _VSTD::next(__first, __highest_j);
+            __m.__matches_[0].matched = true;
+            for (unsigned __i = 0; __i < __best_state.__sub_matches_.size(); ++__i)
+                __m.__matches_[__i+1] = __best_state.__sub_matches_[__i];
+            return true;
+        }
+    }
+    return false;
+}
+
+template <class _CharT, class _Traits>
+template <class _Allocator>
+bool
+basic_regex<_CharT, _Traits>::__match_at_start(
+        const _CharT* __first, const _CharT* __last,
+        match_results<const _CharT*, _Allocator>& __m,
+        regex_constants::match_flag_type __flags, bool __at_first) const
+{
+    if (__get_grammar(__flags_) == ECMAScript)
+        return __match_at_start_ecma(__first, __last, __m, __flags, __at_first);
+    if (mark_count() == 0)
+        return __match_at_start_posix_nosubs(__first, __last, __m, __flags, __at_first);
+    return __match_at_start_posix_subs(__first, __last, __m, __flags, __at_first);
+}
+
+template <class _CharT, class _Traits>
+template <class _Allocator>
+bool
+basic_regex<_CharT, _Traits>::__search(
+        const _CharT* __first, const _CharT* __last,
+        match_results<const _CharT*, _Allocator>& __m,
+        regex_constants::match_flag_type __flags) const
+{
+    if (__flags & regex_constants::match_prev_avail)
+        __flags &= ~(regex_constants::match_not_bol | regex_constants::match_not_bow);
+
+    __m.__init(1 + mark_count(), __first, __last,
+                                    __flags & regex_constants::__no_update_pos);
+    if (__match_at_start(__first, __last, __m, __flags,
+                                    !(__flags & regex_constants::__no_update_pos)))
+    {
+        __m.__prefix_.second = __m[0].first;
+        __m.__prefix_.matched = __m.__prefix_.first != __m.__prefix_.second;
+        __m.__suffix_.first = __m[0].second;
+        __m.__suffix_.matched = __m.__suffix_.first != __m.__suffix_.second;
+        return true;
+    }
+    if (__first != __last && !(__flags & regex_constants::match_continuous))
+    {
+        __flags |= regex_constants::match_prev_avail;
+        for (++__first; __first != __last; ++__first)
+        {
+            __m.__matches_.assign(__m.size(), __m.__unmatched_);
+            if (__match_at_start(__first, __last, __m, __flags, false))
+            {
+                __m.__prefix_.second = __m[0].first;
+                __m.__prefix_.matched = __m.__prefix_.first != __m.__prefix_.second;
+                __m.__suffix_.first = __m[0].second;
+                __m.__suffix_.matched = __m.__suffix_.first != __m.__suffix_.second;
+                return true;
+            }
+            __m.__matches_.assign(__m.size(), __m.__unmatched_);
+        }
+    }
+    __m.__matches_.clear();
+    return false;
+}
+
+template <class _BidirectionalIterator, class _Allocator, class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_search(_BidirectionalIterator __first, _BidirectionalIterator __last,
+             match_results<_BidirectionalIterator, _Allocator>& __m,
+             const basic_regex<_CharT, _Traits>& __e,
+             regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    int __offset = (__flags & regex_constants::match_prev_avail) ? 1 : 0;
+    basic_string<_CharT> __s(_VSTD::prev(__first, __offset), __last);
+    match_results<const _CharT*> __mc;
+    bool __r = __e.__search(__s.data() + __offset, __s.data() + __s.size(), __mc, __flags);
+    __m.__assign(__first, __last, __mc, __flags & regex_constants::__no_update_pos);
+    return __r;
+}
+
+template <class _Iter, class _Allocator, class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_search(__wrap_iter<_Iter> __first,
+             __wrap_iter<_Iter> __last,
+             match_results<__wrap_iter<_Iter>, _Allocator>& __m,
+             const basic_regex<_CharT, _Traits>& __e,
+             regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    match_results<const _CharT*> __mc;
+    bool __r = __e.__search(__first.base(), __last.base(), __mc, __flags);
+    __m.__assign(__first, __last, __mc, __flags & regex_constants::__no_update_pos);
+    return __r;
+}
+
+template <class _Allocator, class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_search(const _CharT* __first, const _CharT* __last,
+             match_results<const _CharT*, _Allocator>& __m,
+             const basic_regex<_CharT, _Traits>& __e,
+             regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    return __e.__search(__first, __last, __m, __flags);
+}
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_search(_BidirectionalIterator __first, _BidirectionalIterator __last,
+             const basic_regex<_CharT, _Traits>& __e,
+             regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    basic_string<_CharT> __s(__first, __last);
+    match_results<const _CharT*> __mc;
+    return __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_search(const _CharT* __first, const _CharT* __last,
+             const basic_regex<_CharT, _Traits>& __e,
+             regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    match_results<const _CharT*> __mc;
+    return __e.__search(__first, __last, __mc, __flags);
+}
+
+template <class _CharT, class _Allocator, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_search(const _CharT* __str, match_results<const _CharT*, _Allocator>& __m,
+             const basic_regex<_CharT, _Traits>& __e,
+             regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    return __e.__search(__str, __str + _Traits::length(__str), __m, __flags);
+}
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_search(const _CharT* __str, const basic_regex<_CharT, _Traits>& __e,
+             regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    match_results<const _CharT*> __m;
+    return _VSTD::regex_search(__str, __m, __e, __flags);
+}
+
+template <class _ST, class _SA, class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_search(const basic_string<_CharT, _ST, _SA>& __s,
+             const basic_regex<_CharT, _Traits>& __e,
+             regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    match_results<const _CharT*> __mc;
+    return __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
+}
+
+template <class _ST, class _SA, class _Allocator, class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_search(const basic_string<_CharT, _ST, _SA>& __s,
+             match_results<typename basic_string<_CharT, _ST, _SA>::const_iterator, _Allocator>& __m,
+             const basic_regex<_CharT, _Traits>& __e,
+             regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    match_results<const _CharT*> __mc;
+    bool __r = __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
+    __m.__assign(__s.begin(), __s.end(), __mc, __flags & regex_constants::__no_update_pos);
+    return __r;
+}
+
+#if _LIBCPP_STD_VER > 11
+template <class _ST, class _SA, class _Ap, class _Cp, class _Tp>
+bool
+regex_search(const basic_string<_Cp, _ST, _SA>&& __s,
+             match_results<typename basic_string<_Cp, _ST, _SA>::const_iterator, _Ap>&,
+             const basic_regex<_Cp, _Tp>& __e,
+             regex_constants::match_flag_type __flags = regex_constants::match_default) = delete;
+#endif
+
+// regex_match
+
+template <class _BidirectionalIterator, class _Allocator, class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI bool
+regex_match(_BidirectionalIterator __first, _BidirectionalIterator __last,
+            match_results<_BidirectionalIterator, _Allocator>& __m,
+            const basic_regex<_CharT, _Traits>& __e,
+            regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    bool __r = _VSTD::regex_search(
+        __first, __last, __m, __e,
+        __flags | regex_constants::match_continuous |
+        regex_constants::__full_match);
+    if (__r)
+    {
+        __r = !__m.suffix().matched;
+        if (!__r)
+            __m.__matches_.clear();
+    }
+    return __r;
+}
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_match(_BidirectionalIterator __first, _BidirectionalIterator __last,
+            const basic_regex<_CharT, _Traits>& __e,
+            regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    match_results<_BidirectionalIterator> __m;
+    return _VSTD::regex_match(__first, __last, __m, __e, __flags);
+}
+
+template <class _CharT, class _Allocator, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_match(const _CharT* __str, match_results<const _CharT*, _Allocator>& __m,
+            const basic_regex<_CharT, _Traits>& __e,
+            regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    return _VSTD::regex_match(__str, __str + _Traits::length(__str), __m, __e, __flags);
+}
+
+template <class _ST, class _SA, class _Allocator, class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_match(const basic_string<_CharT, _ST, _SA>& __s,
+            match_results<typename basic_string<_CharT, _ST, _SA>::const_iterator, _Allocator>& __m,
+            const basic_regex<_CharT, _Traits>& __e,
+            regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    return _VSTD::regex_match(__s.begin(), __s.end(), __m, __e, __flags);
+}
+
+#if _LIBCPP_STD_VER > 11
+template <class _ST, class _SA, class _Allocator, class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_match(const basic_string<_CharT, _ST, _SA>&& __s,
+            match_results<typename basic_string<_CharT, _ST, _SA>::const_iterator, _Allocator>& __m,
+            const basic_regex<_CharT, _Traits>& __e,
+            regex_constants::match_flag_type __flags = regex_constants::match_default) = delete;
+#endif
+
+template <class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_match(const _CharT* __str, const basic_regex<_CharT, _Traits>& __e,
+            regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    return _VSTD::regex_match(__str, __str + _Traits::length(__str), __e, __flags);
+}
+
+template <class _ST, class _SA, class _CharT, class _Traits>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+regex_match(const basic_string<_CharT, _ST, _SA>& __s,
+            const basic_regex<_CharT, _Traits>& __e,
+            regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    return _VSTD::regex_match(__s.begin(), __s.end(), __e, __flags);
+}
+
+// regex_iterator
+
+template <class _BidirectionalIterator,
+          class _CharT = typename iterator_traits<_BidirectionalIterator>::value_type,
+          class _Traits = regex_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS regex_iterator;
+
+typedef regex_iterator<const char*>             cregex_iterator;
+typedef regex_iterator<string::const_iterator>  sregex_iterator;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+typedef regex_iterator<const wchar_t*>          wcregex_iterator;
+typedef regex_iterator<wstring::const_iterator> wsregex_iterator;
+#endif
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+class
+    _LIBCPP_TEMPLATE_VIS
+    _LIBCPP_PREFERRED_NAME(cregex_iterator)
+    _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wcregex_iterator))
+    _LIBCPP_PREFERRED_NAME(sregex_iterator)
+    _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wsregex_iterator))
+    regex_iterator
+{
+public:
+    typedef basic_regex<_CharT, _Traits>          regex_type;
+    typedef match_results<_BidirectionalIterator> value_type;
+    typedef ptrdiff_t                             difference_type;
+    typedef const value_type*                     pointer;
+    typedef const value_type&                     reference;
+    typedef forward_iterator_tag                  iterator_category;
+
+private:
+    _BidirectionalIterator           __begin_;
+    _BidirectionalIterator           __end_;
+    const regex_type*                __pregex_;
+    regex_constants::match_flag_type __flags_;
+    value_type                       __match_;
+
+public:
+    regex_iterator();
+    regex_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                   const regex_type& __re,
+                   regex_constants::match_flag_type __m
+                                              = regex_constants::match_default);
+#if _LIBCPP_STD_VER > 11
+    regex_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                   const regex_type&& __re,
+                   regex_constants::match_flag_type __m
+                                     = regex_constants::match_default) = delete;
+#endif
+
+    bool operator==(const regex_iterator& __x) const;
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const regex_iterator& __x) const {return !(*this == __x);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const {return  __match_;}
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const  {return _VSTD::addressof(__match_);}
+
+    regex_iterator& operator++();
+    _LIBCPP_INLINE_VISIBILITY
+    regex_iterator operator++(int)
+    {
+        regex_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+};
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+regex_iterator<_BidirectionalIterator, _CharT, _Traits>::regex_iterator()
+    : __begin_(), __end_(), __pregex_(nullptr), __flags_(), __match_()
+{
+}
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+regex_iterator<_BidirectionalIterator, _CharT, _Traits>::
+    regex_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                   const regex_type& __re, regex_constants::match_flag_type __m)
+    : __begin_(__a),
+      __end_(__b),
+      __pregex_(_VSTD::addressof(__re)),
+      __flags_(__m)
+{
+    _VSTD::regex_search(__begin_, __end_, __match_, *__pregex_, __flags_);
+}
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+bool
+regex_iterator<_BidirectionalIterator, _CharT, _Traits>::
+    operator==(const regex_iterator& __x) const
+{
+    if (__match_.empty() && __x.__match_.empty())
+        return true;
+    if (__match_.empty() || __x.__match_.empty())
+        return false;
+    return __begin_ == __x.__begin_       &&
+           __end_ == __x.__end_           &&
+           __pregex_ == __x.__pregex_     &&
+           __flags_ == __x.__flags_       &&
+           __match_[0] == __x.__match_[0];
+}
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+regex_iterator<_BidirectionalIterator, _CharT, _Traits>&
+regex_iterator<_BidirectionalIterator, _CharT, _Traits>::operator++()
+{
+    __flags_ |= regex_constants::__no_update_pos;
+    _BidirectionalIterator __start = __match_[0].second;
+    if (__match_[0].first == __match_[0].second)
+    {
+        if (__start == __end_)
+        {
+            __match_ = value_type();
+            return *this;
+        }
+        else if (_VSTD::regex_search(__start, __end_, __match_, *__pregex_,
+                                    __flags_ | regex_constants::match_not_null |
+                                    regex_constants::match_continuous))
+            return *this;
+        else
+            ++__start;
+    }
+    __flags_ |= regex_constants::match_prev_avail;
+    if (!_VSTD::regex_search(__start, __end_, __match_, *__pregex_, __flags_))
+        __match_ = value_type();
+    return *this;
+}
+
+// regex_token_iterator
+
+template <class _BidirectionalIterator,
+          class _CharT = typename iterator_traits<_BidirectionalIterator>::value_type,
+          class _Traits = regex_traits<_CharT> >
+    class _LIBCPP_TEMPLATE_VIS regex_token_iterator;
+
+typedef regex_token_iterator<const char*>             cregex_token_iterator;
+typedef regex_token_iterator<string::const_iterator>  sregex_token_iterator;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+typedef regex_token_iterator<const wchar_t*>          wcregex_token_iterator;
+typedef regex_token_iterator<wstring::const_iterator> wsregex_token_iterator;
+#endif
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+class
+    _LIBCPP_TEMPLATE_VIS
+    _LIBCPP_PREFERRED_NAME(cregex_token_iterator)
+    _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wcregex_token_iterator))
+    _LIBCPP_PREFERRED_NAME(sregex_token_iterator)
+    _LIBCPP_IF_WIDE_CHARACTERS(_LIBCPP_PREFERRED_NAME(wsregex_token_iterator))
+    regex_token_iterator
+{
+public:
+    typedef basic_regex<_CharT, _Traits>      regex_type;
+    typedef sub_match<_BidirectionalIterator> value_type;
+    typedef ptrdiff_t                         difference_type;
+    typedef const value_type*                 pointer;
+    typedef const value_type&                 reference;
+    typedef forward_iterator_tag              iterator_category;
+
+private:
+    typedef regex_iterator<_BidirectionalIterator, _CharT, _Traits> _Position;
+
+    _Position         __position_;
+    const value_type* __result_;
+    value_type        __suffix_;
+    ptrdiff_t         __n_;
+    vector<int>       __subs_;
+
+public:
+    regex_token_iterator();
+    regex_token_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                         const regex_type& __re, int __submatch = 0,
+                         regex_constants::match_flag_type __m =
+                                                regex_constants::match_default);
+#if _LIBCPP_STD_VER > 11
+    regex_token_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                         const regex_type&& __re, int __submatch = 0,
+                         regex_constants::match_flag_type __m =
+                                       regex_constants::match_default) = delete;
+#endif
+
+    regex_token_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                         const regex_type& __re, const vector<int>& __submatches,
+                         regex_constants::match_flag_type __m =
+                                                regex_constants::match_default);
+#if _LIBCPP_STD_VER > 11
+    regex_token_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                         const regex_type&& __re, const vector<int>& __submatches,
+                         regex_constants::match_flag_type __m =
+                                     regex_constants::match_default) = delete;
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+    regex_token_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                         const regex_type& __re,
+                         initializer_list<int> __submatches,
+                         regex_constants::match_flag_type __m =
+                                                regex_constants::match_default);
+
+#if _LIBCPP_STD_VER > 11
+    regex_token_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                         const regex_type&& __re,
+                         initializer_list<int> __submatches,
+                         regex_constants::match_flag_type __m =
+                                       regex_constants::match_default) = delete;
+#endif
+#endif // _LIBCPP_CXX03_LANG
+    template <size_t _Np>
+        regex_token_iterator(_BidirectionalIterator __a,
+                             _BidirectionalIterator __b,
+                             const regex_type& __re,
+                             const int (&__submatches)[_Np],
+                             regex_constants::match_flag_type __m =
+                                                regex_constants::match_default);
+#if _LIBCPP_STD_VER > 11
+    template <size_t _Np>
+        regex_token_iterator(_BidirectionalIterator __a,
+                             _BidirectionalIterator __b,
+                             const regex_type&& __re,
+                             const int (&__submatches)[_Np],
+                             regex_constants::match_flag_type __m =
+                                      regex_constants::match_default) = delete;
+#endif
+
+    regex_token_iterator(const regex_token_iterator&);
+    regex_token_iterator& operator=(const regex_token_iterator&);
+
+    bool operator==(const regex_token_iterator& __x) const;
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const regex_token_iterator& __x) const {return !(*this == __x);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    const value_type& operator*() const {return *__result_;}
+    _LIBCPP_INLINE_VISIBILITY
+    const value_type* operator->() const {return __result_;}
+
+    regex_token_iterator& operator++();
+    _LIBCPP_INLINE_VISIBILITY
+    regex_token_iterator operator++(int)
+    {
+        regex_token_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+private:
+    void __init(_BidirectionalIterator __a, _BidirectionalIterator __b);
+    void __establish_result () {
+        if (__subs_[__n_] == -1)
+            __result_ = &__position_->prefix();
+        else
+            __result_ = &(*__position_)[__subs_[__n_]];
+        }
+};
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+regex_token_iterator<_BidirectionalIterator, _CharT, _Traits>::
+    regex_token_iterator()
+    : __result_(nullptr),
+      __suffix_(),
+      __n_(0)
+{
+}
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+void
+regex_token_iterator<_BidirectionalIterator, _CharT, _Traits>::
+    __init(_BidirectionalIterator __a, _BidirectionalIterator __b)
+{
+    if (__position_ != _Position())
+        __establish_result ();
+    else if (__subs_[__n_] == -1)
+    {
+        __suffix_.matched = true;
+        __suffix_.first = __a;
+        __suffix_.second = __b;
+        __result_ = &__suffix_;
+    }
+    else
+        __result_ = nullptr;
+}
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+regex_token_iterator<_BidirectionalIterator, _CharT, _Traits>::
+    regex_token_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                         const regex_type& __re, int __submatch,
+                         regex_constants::match_flag_type __m)
+    : __position_(__a, __b, __re, __m),
+      __n_(0),
+      __subs_(1, __submatch)
+{
+    __init(__a, __b);
+}
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+regex_token_iterator<_BidirectionalIterator, _CharT, _Traits>::
+    regex_token_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                         const regex_type& __re, const vector<int>& __submatches,
+                         regex_constants::match_flag_type __m)
+    : __position_(__a, __b, __re, __m),
+      __n_(0),
+      __subs_(__submatches)
+{
+    __init(__a, __b);
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+regex_token_iterator<_BidirectionalIterator, _CharT, _Traits>::
+    regex_token_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                         const regex_type& __re,
+                         initializer_list<int> __submatches,
+                         regex_constants::match_flag_type __m)
+    : __position_(__a, __b, __re, __m),
+      __n_(0),
+      __subs_(__submatches)
+{
+    __init(__a, __b);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+template <size_t _Np>
+regex_token_iterator<_BidirectionalIterator, _CharT, _Traits>::
+    regex_token_iterator(_BidirectionalIterator __a, _BidirectionalIterator __b,
+                             const regex_type& __re,
+                             const int (&__submatches)[_Np],
+                             regex_constants::match_flag_type __m)
+    : __position_(__a, __b, __re, __m),
+      __n_(0),
+      __subs_(begin(__submatches), end(__submatches))
+{
+    __init(__a, __b);
+}
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+regex_token_iterator<_BidirectionalIterator, _CharT, _Traits>::
+    regex_token_iterator(const regex_token_iterator& __x)
+    : __position_(__x.__position_),
+      __result_(__x.__result_),
+      __suffix_(__x.__suffix_),
+      __n_(__x.__n_),
+      __subs_(__x.__subs_)
+{
+    if (__x.__result_ == &__x.__suffix_)
+        __result_ = &__suffix_;
+    else if ( __result_ != nullptr )
+        __establish_result ();
+}
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+regex_token_iterator<_BidirectionalIterator, _CharT, _Traits>&
+regex_token_iterator<_BidirectionalIterator, _CharT, _Traits>::
+    operator=(const regex_token_iterator& __x)
+{
+    if (this != &__x)
+    {
+        __position_ = __x.__position_;
+        if (__x.__result_ == &__x.__suffix_)
+            __result_ = &__suffix_;
+        else
+            __result_ = __x.__result_;
+        __suffix_ = __x.__suffix_;
+        __n_ = __x.__n_;
+        __subs_ = __x.__subs_;
+
+        if ( __result_ != nullptr && __result_ != &__suffix_ )
+            __establish_result();
+    }
+    return *this;
+}
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+bool
+regex_token_iterator<_BidirectionalIterator, _CharT, _Traits>::
+    operator==(const regex_token_iterator& __x) const
+{
+    if (__result_ == nullptr && __x.__result_ == nullptr)
+        return true;
+    if (__result_ == &__suffix_ && __x.__result_ == &__x.__suffix_ &&
+            __suffix_ == __x.__suffix_)
+        return true;
+    if (__result_ == nullptr || __x.__result_ == nullptr)
+        return false;
+    if (__result_ == &__suffix_ || __x.__result_ == &__x.__suffix_)
+        return false;
+    return __position_ == __x.__position_ && __n_ == __x.__n_ &&
+           __subs_ == __x.__subs_;
+}
+
+template <class _BidirectionalIterator, class _CharT, class _Traits>
+regex_token_iterator<_BidirectionalIterator, _CharT, _Traits>&
+regex_token_iterator<_BidirectionalIterator, _CharT, _Traits>::operator++()
+{
+    _Position __prev = __position_;
+    if (__result_ == &__suffix_)
+        __result_ = nullptr;
+    else if (static_cast<size_t>(__n_ + 1) < __subs_.size())
+    {
+        ++__n_;
+        __establish_result();
+    }
+    else
+    {
+        __n_ = 0;
+        ++__position_;
+        if (__position_ != _Position())
+            __establish_result();
+        else
+        {
+            if (_VSTD::find(__subs_.begin(), __subs_.end(), -1) != __subs_.end()
+                && __prev->suffix().length() != 0)
+            {
+                __suffix_.matched = true;
+                __suffix_.first = __prev->suffix().first;
+                __suffix_.second = __prev->suffix().second;
+                __result_ = &__suffix_;
+            }
+            else
+                __result_ = nullptr;
+        }
+    }
+    return *this;
+}
+
+// regex_replace
+
+template <class _OutputIterator, class _BidirectionalIterator,
+          class _Traits, class _CharT>
+_LIBCPP_HIDE_FROM_ABI _OutputIterator
+regex_replace(_OutputIterator __output_iter,
+              _BidirectionalIterator __first, _BidirectionalIterator __last,
+              const basic_regex<_CharT, _Traits>& __e, const _CharT* __fmt,
+              regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    typedef regex_iterator<_BidirectionalIterator, _CharT, _Traits> _Iter;
+    _Iter __i(__first, __last, __e, __flags);
+    _Iter __eof;
+    if (__i == __eof)
+    {
+        if (!(__flags & regex_constants::format_no_copy))
+            __output_iter = _VSTD::copy(__first, __last, __output_iter);
+    }
+    else
+    {
+        sub_match<_BidirectionalIterator> __lm;
+        for (size_t __len = char_traits<_CharT>::length(__fmt); __i != __eof; ++__i)
+        {
+            if (!(__flags & regex_constants::format_no_copy))
+                __output_iter = _VSTD::copy(__i->prefix().first, __i->prefix().second, __output_iter);
+            __output_iter = __i->format(__output_iter, __fmt, __fmt + __len, __flags);
+            __lm = __i->suffix();
+            if (__flags & regex_constants::format_first_only)
+                break;
+        }
+        if (!(__flags & regex_constants::format_no_copy))
+            __output_iter = _VSTD::copy(__lm.first, __lm.second, __output_iter);
+    }
+    return __output_iter;
+}
+
+template <class _OutputIterator, class _BidirectionalIterator,
+          class _Traits, class _CharT, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+_OutputIterator
+regex_replace(_OutputIterator __output_iter,
+              _BidirectionalIterator __first, _BidirectionalIterator __last,
+              const basic_regex<_CharT, _Traits>& __e,
+              const basic_string<_CharT, _ST, _SA>& __fmt,
+              regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    return _VSTD::regex_replace(__output_iter, __first, __last, __e, __fmt.c_str(), __flags);
+}
+
+template <class _Traits, class _CharT, class _ST, class _SA, class _FST,
+          class _FSA>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_string<_CharT, _ST, _SA>
+regex_replace(const basic_string<_CharT, _ST, _SA>& __s,
+              const basic_regex<_CharT, _Traits>& __e,
+              const basic_string<_CharT, _FST, _FSA>& __fmt,
+              regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    basic_string<_CharT, _ST, _SA> __r;
+    _VSTD::regex_replace(std::back_inserter(__r), __s.begin(), __s.end(), __e,
+                        __fmt.c_str(), __flags);
+    return __r;
+}
+
+template <class _Traits, class _CharT, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_string<_CharT, _ST, _SA>
+regex_replace(const basic_string<_CharT, _ST, _SA>& __s,
+              const basic_regex<_CharT, _Traits>& __e, const _CharT* __fmt,
+              regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    basic_string<_CharT, _ST, _SA> __r;
+    _VSTD::regex_replace(std::back_inserter(__r), __s.begin(), __s.end(), __e,
+                        __fmt, __flags);
+    return __r;
+}
+
+template <class _Traits, class _CharT, class _ST, class _SA>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_string<_CharT>
+regex_replace(const _CharT* __s,
+              const basic_regex<_CharT, _Traits>& __e,
+              const basic_string<_CharT, _ST, _SA>& __fmt,
+              regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    basic_string<_CharT> __r;
+    _VSTD::regex_replace(std::back_inserter(__r), __s,
+                        __s + char_traits<_CharT>::length(__s), __e,
+                        __fmt.c_str(), __flags);
+    return __r;
+}
+
+template <class _Traits, class _CharT>
+inline _LIBCPP_INLINE_VISIBILITY
+basic_string<_CharT>
+regex_replace(const _CharT* __s,
+              const basic_regex<_CharT, _Traits>& __e,
+              const _CharT* __fmt,
+              regex_constants::match_flag_type __flags = regex_constants::match_default)
+{
+    basic_string<_CharT> __r;
+    _VSTD::regex_replace(std::back_inserter(__r), __s,
+                        __s + char_traits<_CharT>::length(__s), __e,
+                        __fmt, __flags);
+    return __r;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+_LIBCPP_BEGIN_NAMESPACE_STD
+namespace pmr {
+template <class _BidirT>
+using match_results = std::match_results<_BidirT, polymorphic_allocator<std::sub_match<_BidirT>>>;
+
+using cmatch  = match_results<const char*>;
+using smatch  = match_results<std::pmr::string::const_iterator>;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+using wcmatch = match_results<const wchar_t*>;
+using wsmatch = match_results<std::pmr::wstring::const_iterator>;
+#endif
+} // namespace pmr
+_LIBCPP_END_NAMESPACE_STD
+#endif
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <atomic>
+#  include <concepts>
+#  include <iosfwd>
+#  include <iterator>
+#  include <new>
+#  include <typeinfo>
+#  include <utility>
+#endif
+
+#endif // _LIBCPP_REGEX
diff --git a/app/src/main/cpp/libcxx/include/scoped_allocator b/app/src/main/cpp/libcxx/include/scoped_allocator
new file mode 100644
index 0000000..461c67e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/scoped_allocator
@@ -0,0 +1,733 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_SCOPED_ALLOCATOR
+#define _LIBCPP_SCOPED_ALLOCATOR
+
+/*
+    scoped_allocator synopsis
+
+namespace std
+{
+
+template <class OuterAlloc, class... InnerAllocs>
+class scoped_allocator_adaptor : public OuterAlloc
+{
+    typedef allocator_traits<OuterAlloc> OuterTraits; // exposition only
+    scoped_allocator_adaptor<InnerAllocs...> inner;   // exposition only
+public:
+
+    typedef OuterAlloc outer_allocator_type;
+    typedef see below inner_allocator_type;
+
+    typedef typename OuterTraits::value_type value_type;
+    typedef typename OuterTraits::size_type size_type;
+    typedef typename OuterTraits::difference_type difference_type;
+    typedef typename OuterTraits::pointer pointer;
+    typedef typename OuterTraits::const_pointer const_pointer;
+    typedef typename OuterTraits::void_pointer void_pointer;
+    typedef typename OuterTraits::const_void_pointer const_void_pointer;
+
+    typedef see below propagate_on_container_copy_assignment;
+    typedef see below propagate_on_container_move_assignment;
+    typedef see below propagate_on_container_swap;
+    typedef see below is_always_equal;
+
+    template <class Tp>
+        struct rebind
+        {
+            typedef scoped_allocator_adaptor<
+                OuterTraits::template rebind_alloc<Tp>, InnerAllocs...> other;
+        };
+
+    scoped_allocator_adaptor();
+    template <class OuterA2>
+        scoped_allocator_adaptor(OuterA2&& outerAlloc,
+                                 const InnerAllocs&... innerAllocs) noexcept;
+    scoped_allocator_adaptor(const scoped_allocator_adaptor& other) noexcept;
+    scoped_allocator_adaptor(scoped_allocator_adaptor&& other) noexcept;
+    template <class OuterA2>
+        scoped_allocator_adaptor(const scoped_allocator_adaptor<OuterA2, InnerAllocs...>& other) noexcept;
+    template <class OuterA2>
+        scoped_allocator_adaptor(const scoped_allocator_adaptor<OuterA2, InnerAllocs...>&& other) noexcept;
+
+    scoped_allocator_adaptor& operator=(const scoped_allocator_adaptor&) = default;
+    scoped_allocator_adaptor& operator=(scoped_allocator_adaptor&&) = default;
+    ~scoped_allocator_adaptor();
+
+    inner_allocator_type& inner_allocator() noexcept;
+    const inner_allocator_type& inner_allocator() const noexcept;
+
+    outer_allocator_type& outer_allocator() noexcept;
+    const outer_allocator_type& outer_allocator() const noexcept;
+
+    pointer allocate(size_type n);                           // [[nodiscard]] in C++20
+    pointer allocate(size_type n, const_void_pointer hint);  // [[nodiscard]] in C++20
+    void deallocate(pointer p, size_type n) noexcept;
+
+    size_type max_size() const;
+    template <class T, class... Args> void construct(T* p, Args&& args);
+    template <class T1, class T2, class... Args1, class... Args2>
+        void construct(pair<T1, T2>* p, piecewise_construct t, tuple<Args1...> x,
+                       tuple<Args2...> y);
+    template <class T1, class T2>
+        void construct(pair<T1, T2>* p);
+    template <class T1, class T2, class U, class V>
+        void construct(pair<T1, T2>* p, U&& x, V&& y);
+    template <class T1, class T2, class U, class V>
+        void construct(pair<T1, T2>* p, const pair<U, V>& x);
+    template <class T1, class T2, class U, class V>
+        void construct(pair<T1, T2>* p, pair<U, V>&& x);
+    template <class T> void destroy(T* p);
+
+    template <class T> void destroy(T* p) noexcept;
+
+    scoped_allocator_adaptor select_on_container_copy_construction() const noexcept;
+};
+
+template<class OuterAlloc, class... InnerAllocs>
+    scoped_allocator_adaptor(OuterAlloc, InnerAllocs...)
+        -> scoped_allocator_adaptor<OuterAlloc, InnerAllocs...>;
+
+template <class OuterA1, class OuterA2, class... InnerAllocs>
+    bool
+    operator==(const scoped_allocator_adaptor<OuterA1, InnerAllocs...>& a,
+               const scoped_allocator_adaptor<OuterA2, InnerAllocs...>& b) noexcept;
+
+template <class OuterA1, class OuterA2, class... InnerAllocs>
+    bool
+    operator!=(const scoped_allocator_adaptor<OuterA1, InnerAllocs...>& a,
+               const scoped_allocator_adaptor<OuterA2, InnerAllocs...>& b) noexcept;
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__memory/allocator_traits.h>
+#include <__memory/uses_allocator_construction.h>
+#include <__type_traits/common_type.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_constructible.h>
+#include <__type_traits/remove_reference.h>
+#include <__utility/declval.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <__utility/piecewise_construct.h>
+#include <tuple>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if !defined(_LIBCPP_CXX03_LANG)
+
+// scoped_allocator_adaptor
+
+template <class ..._Allocs>
+class scoped_allocator_adaptor;
+
+template <class ..._Allocs> struct __get_poc_copy_assignment;
+
+template <class _A0>
+struct __get_poc_copy_assignment<_A0>
+{
+    static const bool value = allocator_traits<_A0>::
+                              propagate_on_container_copy_assignment::value;
+};
+
+template <class _A0, class ..._Allocs>
+struct __get_poc_copy_assignment<_A0, _Allocs...>
+{
+    static const bool value =
+        allocator_traits<_A0>::propagate_on_container_copy_assignment::value ||
+        __get_poc_copy_assignment<_Allocs...>::value;
+};
+
+template <class ..._Allocs> struct __get_poc_move_assignment;
+
+template <class _A0>
+struct __get_poc_move_assignment<_A0>
+{
+    static const bool value = allocator_traits<_A0>::
+                              propagate_on_container_move_assignment::value;
+};
+
+template <class _A0, class ..._Allocs>
+struct __get_poc_move_assignment<_A0, _Allocs...>
+{
+    static const bool value =
+        allocator_traits<_A0>::propagate_on_container_move_assignment::value ||
+        __get_poc_move_assignment<_Allocs...>::value;
+};
+
+template <class ..._Allocs> struct __get_poc_swap;
+
+template <class _A0>
+struct __get_poc_swap<_A0>
+{
+    static const bool value = allocator_traits<_A0>::
+                              propagate_on_container_swap::value;
+};
+
+template <class _A0, class ..._Allocs>
+struct __get_poc_swap<_A0, _Allocs...>
+{
+    static const bool value =
+        allocator_traits<_A0>::propagate_on_container_swap::value ||
+        __get_poc_swap<_Allocs...>::value;
+};
+
+template <class ..._Allocs> struct __get_is_always_equal;
+
+template <class _A0>
+struct __get_is_always_equal<_A0>
+{
+    static const bool value = allocator_traits<_A0>::is_always_equal::value;
+};
+
+template <class _A0, class ..._Allocs>
+struct __get_is_always_equal<_A0, _Allocs...>
+{
+    static const bool value =
+        allocator_traits<_A0>::is_always_equal::value &&
+        __get_is_always_equal<_Allocs...>::value;
+};
+
+template <class ..._Allocs>
+class __scoped_allocator_storage;
+
+template <class _OuterAlloc, class... _InnerAllocs>
+class __scoped_allocator_storage<_OuterAlloc, _InnerAllocs...>
+    : public _OuterAlloc
+{
+    typedef _OuterAlloc outer_allocator_type;
+protected:
+    typedef scoped_allocator_adaptor<_InnerAllocs...> inner_allocator_type;
+
+private:
+    inner_allocator_type __inner_;
+
+protected:
+
+    _LIBCPP_INLINE_VISIBILITY
+    __scoped_allocator_storage() _NOEXCEPT {}
+
+    template <class _OuterA2,
+              class = typename enable_if<
+                        is_constructible<outer_allocator_type, _OuterA2>::value
+                      >::type>
+        _LIBCPP_INLINE_VISIBILITY
+        __scoped_allocator_storage(_OuterA2&& __outer_alloc,
+                                   const _InnerAllocs& ...__inner_allocs) _NOEXCEPT
+            : outer_allocator_type(_VSTD::forward<_OuterA2>(__outer_alloc)),
+              __inner_(__inner_allocs...) {}
+
+    template <class _OuterA2,
+              class = typename enable_if<
+                        is_constructible<outer_allocator_type, const _OuterA2&>::value
+                      >::type>
+        _LIBCPP_INLINE_VISIBILITY
+        __scoped_allocator_storage(
+            const __scoped_allocator_storage<_OuterA2, _InnerAllocs...>& __other) _NOEXCEPT
+            : outer_allocator_type(__other.outer_allocator()),
+              __inner_(__other.inner_allocator()) {}
+
+    template <class _OuterA2,
+              class = typename enable_if<
+                        is_constructible<outer_allocator_type, _OuterA2>::value
+                      >::type>
+        _LIBCPP_INLINE_VISIBILITY
+        __scoped_allocator_storage(
+            __scoped_allocator_storage<_OuterA2, _InnerAllocs...>&& __other) _NOEXCEPT
+            : outer_allocator_type(_VSTD::move(__other.outer_allocator())),
+              __inner_(_VSTD::move(__other.inner_allocator())) {}
+
+    template <class _OuterA2,
+              class = typename enable_if<
+                        is_constructible<outer_allocator_type, _OuterA2>::value
+                      >::type>
+        _LIBCPP_INLINE_VISIBILITY
+        __scoped_allocator_storage(_OuterA2&& __o,
+                                   const inner_allocator_type& __i) _NOEXCEPT
+            : outer_allocator_type(_VSTD::forward<_OuterA2>(__o)),
+              __inner_(__i)
+        {
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    inner_allocator_type& inner_allocator() _NOEXCEPT             {return __inner_;}
+    _LIBCPP_INLINE_VISIBILITY
+    const inner_allocator_type& inner_allocator() const _NOEXCEPT {return __inner_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    outer_allocator_type& outer_allocator() _NOEXCEPT
+        {return static_cast<outer_allocator_type&>(*this);}
+    _LIBCPP_INLINE_VISIBILITY
+    const outer_allocator_type& outer_allocator() const _NOEXCEPT
+        {return static_cast<const outer_allocator_type&>(*this);}
+
+    scoped_allocator_adaptor<outer_allocator_type, _InnerAllocs...>
+    _LIBCPP_INLINE_VISIBILITY
+    select_on_container_copy_construction() const _NOEXCEPT
+        {
+            return scoped_allocator_adaptor<outer_allocator_type, _InnerAllocs...>
+            (
+                allocator_traits<outer_allocator_type>::
+                    select_on_container_copy_construction(outer_allocator()),
+                allocator_traits<inner_allocator_type>::
+                    select_on_container_copy_construction(inner_allocator())
+            );
+        }
+
+    template <class...> friend class __scoped_allocator_storage;
+};
+
+template <class _OuterAlloc>
+class __scoped_allocator_storage<_OuterAlloc>
+    : public _OuterAlloc
+{
+    typedef _OuterAlloc outer_allocator_type;
+protected:
+    typedef scoped_allocator_adaptor<_OuterAlloc> inner_allocator_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __scoped_allocator_storage() _NOEXCEPT {}
+
+    template <class _OuterA2,
+              class = typename enable_if<
+                        is_constructible<outer_allocator_type, _OuterA2>::value
+                      >::type>
+        _LIBCPP_INLINE_VISIBILITY
+        __scoped_allocator_storage(_OuterA2&& __outer_alloc) _NOEXCEPT
+            : outer_allocator_type(_VSTD::forward<_OuterA2>(__outer_alloc)) {}
+
+    template <class _OuterA2,
+              class = typename enable_if<
+                        is_constructible<outer_allocator_type, const _OuterA2&>::value
+                      >::type>
+        _LIBCPP_INLINE_VISIBILITY
+        __scoped_allocator_storage(
+            const __scoped_allocator_storage<_OuterA2>& __other) _NOEXCEPT
+            : outer_allocator_type(__other.outer_allocator()) {}
+
+    template <class _OuterA2,
+              class = typename enable_if<
+                        is_constructible<outer_allocator_type, _OuterA2>::value
+                      >::type>
+        _LIBCPP_INLINE_VISIBILITY
+        __scoped_allocator_storage(
+            __scoped_allocator_storage<_OuterA2>&& __other) _NOEXCEPT
+            : outer_allocator_type(_VSTD::move(__other.outer_allocator())) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    inner_allocator_type& inner_allocator() _NOEXCEPT
+        {return static_cast<inner_allocator_type&>(*this);}
+    _LIBCPP_INLINE_VISIBILITY
+    const inner_allocator_type& inner_allocator() const _NOEXCEPT
+        {return static_cast<const inner_allocator_type&>(*this);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    outer_allocator_type& outer_allocator() _NOEXCEPT
+        {return static_cast<outer_allocator_type&>(*this);}
+    _LIBCPP_INLINE_VISIBILITY
+    const outer_allocator_type& outer_allocator() const _NOEXCEPT
+        {return static_cast<const outer_allocator_type&>(*this);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    scoped_allocator_adaptor<outer_allocator_type>
+    select_on_container_copy_construction() const _NOEXCEPT
+        {return scoped_allocator_adaptor<outer_allocator_type>(
+            allocator_traits<outer_allocator_type>::
+                select_on_container_copy_construction(outer_allocator())
+        );}
+
+    __scoped_allocator_storage(const outer_allocator_type& __o,
+                               const inner_allocator_type& __i) _NOEXCEPT;
+
+    template <class...> friend class __scoped_allocator_storage;
+};
+
+// __outermost
+
+template <class _Alloc>
+decltype(std::declval<_Alloc>().outer_allocator(), true_type())
+__has_outer_allocator_test(_Alloc&& __a);
+
+template <class _Alloc>
+false_type
+__has_outer_allocator_test(const volatile _Alloc& __a);
+
+template <class _Alloc>
+struct __has_outer_allocator
+    : public common_type
+             <
+                 decltype(std::__has_outer_allocator_test(std::declval<_Alloc&>()))
+             >::type
+{
+};
+
+template <class _Alloc, bool = __has_outer_allocator<_Alloc>::value>
+struct __outermost
+{
+    typedef _Alloc type;
+    _LIBCPP_INLINE_VISIBILITY
+    type& operator()(type& __a) const _NOEXCEPT {return __a;}
+};
+
+template <class _Alloc>
+struct __outermost<_Alloc, true>
+{
+    typedef __libcpp_remove_reference_t
+                     <
+                        decltype(std::declval<_Alloc>().outer_allocator())
+                     >                                    _OuterAlloc;
+    typedef typename __outermost<_OuterAlloc>::type             type;
+    _LIBCPP_INLINE_VISIBILITY
+    type& operator()(_Alloc& __a) const _NOEXCEPT
+        {return __outermost<_OuterAlloc>()(__a.outer_allocator());}
+};
+
+template <class _OuterAlloc, class... _InnerAllocs>
+class _LIBCPP_TEMPLATE_VIS scoped_allocator_adaptor<_OuterAlloc, _InnerAllocs...>
+    : public __scoped_allocator_storage<_OuterAlloc, _InnerAllocs...>
+{
+    typedef __scoped_allocator_storage<_OuterAlloc, _InnerAllocs...> base;
+    typedef allocator_traits<_OuterAlloc>             _OuterTraits;
+public:
+    typedef _OuterAlloc                               outer_allocator_type;
+    typedef typename base::inner_allocator_type       inner_allocator_type;
+    typedef typename _OuterTraits::size_type          size_type;
+    typedef typename _OuterTraits::difference_type    difference_type;
+    typedef typename _OuterTraits::pointer            pointer;
+    typedef typename _OuterTraits::const_pointer      const_pointer;
+    typedef typename _OuterTraits::void_pointer       void_pointer;
+    typedef typename _OuterTraits::const_void_pointer const_void_pointer;
+
+    typedef integral_constant
+            <
+                bool,
+                __get_poc_copy_assignment<outer_allocator_type,
+                                          _InnerAllocs...>::value
+            > propagate_on_container_copy_assignment;
+    typedef integral_constant
+            <
+                bool,
+                __get_poc_move_assignment<outer_allocator_type,
+                                          _InnerAllocs...>::value
+            > propagate_on_container_move_assignment;
+    typedef integral_constant
+            <
+                bool,
+                __get_poc_swap<outer_allocator_type, _InnerAllocs...>::value
+            > propagate_on_container_swap;
+    typedef integral_constant
+            <
+                bool,
+                __get_is_always_equal<outer_allocator_type, _InnerAllocs...>::value
+            > is_always_equal;
+
+    template <class _Tp>
+    struct rebind
+    {
+        typedef scoped_allocator_adaptor
+        <
+            typename _OuterTraits::template rebind_alloc<_Tp>, _InnerAllocs...
+        > other;
+    };
+
+    _LIBCPP_INLINE_VISIBILITY
+    scoped_allocator_adaptor() _NOEXCEPT {}
+    template <class _OuterA2,
+              class = typename enable_if<
+                        is_constructible<outer_allocator_type, _OuterA2>::value
+                      >::type>
+        _LIBCPP_INLINE_VISIBILITY
+        scoped_allocator_adaptor(_OuterA2&& __outer_alloc,
+                                 const _InnerAllocs& ...__inner_allocs) _NOEXCEPT
+            : base(_VSTD::forward<_OuterA2>(__outer_alloc), __inner_allocs...) {}
+    // scoped_allocator_adaptor(const scoped_allocator_adaptor& __other) = default;
+    template <class _OuterA2,
+              class = typename enable_if<
+                        is_constructible<outer_allocator_type, const _OuterA2&>::value
+                      >::type>
+        _LIBCPP_INLINE_VISIBILITY
+        scoped_allocator_adaptor(
+            const scoped_allocator_adaptor<_OuterA2, _InnerAllocs...>& __other) _NOEXCEPT
+                : base(__other) {}
+    template <class _OuterA2,
+              class = typename enable_if<
+                        is_constructible<outer_allocator_type, _OuterA2>::value
+                      >::type>
+        _LIBCPP_INLINE_VISIBILITY
+        scoped_allocator_adaptor(
+            scoped_allocator_adaptor<_OuterA2, _InnerAllocs...>&& __other) _NOEXCEPT
+                : base(_VSTD::move(__other)) {}
+
+    // scoped_allocator_adaptor& operator=(const scoped_allocator_adaptor&) = default;
+    // scoped_allocator_adaptor& operator=(scoped_allocator_adaptor&&) = default;
+    // ~scoped_allocator_adaptor() = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    inner_allocator_type& inner_allocator() _NOEXCEPT
+        {return base::inner_allocator();}
+    _LIBCPP_INLINE_VISIBILITY
+    const inner_allocator_type& inner_allocator() const _NOEXCEPT
+        {return base::inner_allocator();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    outer_allocator_type& outer_allocator() _NOEXCEPT
+        {return base::outer_allocator();}
+    _LIBCPP_INLINE_VISIBILITY
+    const outer_allocator_type& outer_allocator() const _NOEXCEPT
+        {return base::outer_allocator();}
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    pointer allocate(size_type __n)
+        {return allocator_traits<outer_allocator_type>::
+            allocate(outer_allocator(), __n);}
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    pointer allocate(size_type __n, const_void_pointer __hint)
+        {return allocator_traits<outer_allocator_type>::
+            allocate(outer_allocator(), __n, __hint);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void deallocate(pointer __p, size_type __n) _NOEXCEPT
+        {allocator_traits<outer_allocator_type>::
+            deallocate(outer_allocator(), __p, __n);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const
+        {return allocator_traits<outer_allocator_type>::max_size(outer_allocator());}
+
+#if _LIBCPP_STD_VER >= 20
+    template <class _Type, class... _Args>
+    _LIBCPP_HIDE_FROM_ABI void construct(_Type* __ptr, _Args&&... __args) {
+      using _OM = __outermost<outer_allocator_type>;
+      std::apply(
+          [__ptr, this](auto&&... __newargs) {
+            allocator_traits<typename _OM::type>::construct(
+                _OM()(outer_allocator()), __ptr, std::forward<decltype(__newargs)>(__newargs)...);
+          },
+          std::uses_allocator_construction_args<_Type>(inner_allocator(), std::forward<_Args>(__args)...));
+    }
+#else
+    template <class _Tp, class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        void construct(_Tp* __p, _Args&& ...__args)
+            {__construct(__uses_alloc_ctor<_Tp, inner_allocator_type&, _Args...>(),
+                         __p, _VSTD::forward<_Args>(__args)...);}
+
+    template <class _T1, class _T2, class... _Args1, class... _Args2>
+    void construct(pair<_T1, _T2>* __p, piecewise_construct_t,
+                       tuple<_Args1...> __x, tuple<_Args2...> __y)
+    {
+        typedef __outermost<outer_allocator_type> _OM;
+        allocator_traits<typename _OM::type>::construct(
+            _OM()(outer_allocator()), __p, piecewise_construct
+          , __transform_tuple(
+              typename __uses_alloc_ctor<
+                  _T1, inner_allocator_type&, _Args1...
+              >::type()
+            , _VSTD::move(__x)
+            , typename __make_tuple_indices<sizeof...(_Args1)>::type{}
+          )
+          , __transform_tuple(
+              typename __uses_alloc_ctor<
+                  _T2, inner_allocator_type&, _Args2...
+              >::type()
+            , _VSTD::move(__y)
+            , typename __make_tuple_indices<sizeof...(_Args2)>::type{}
+          )
+        );
+    }
+
+    template <class _T1, class _T2>
+    void construct(pair<_T1, _T2>* __p)
+    { construct(__p, piecewise_construct, tuple<>{}, tuple<>{}); }
+
+    template <class _T1, class _T2, class _Up, class _Vp>
+    void construct(pair<_T1, _T2>* __p, _Up&& __x, _Vp&& __y) {
+        construct(__p, piecewise_construct,
+                  _VSTD::forward_as_tuple(_VSTD::forward<_Up>(__x)),
+                  _VSTD::forward_as_tuple(_VSTD::forward<_Vp>(__y)));
+    }
+
+    template <class _T1, class _T2, class _Up, class _Vp>
+    void construct(pair<_T1, _T2>* __p, const pair<_Up, _Vp>& __x) {
+        construct(__p, piecewise_construct,
+                  _VSTD::forward_as_tuple(__x.first),
+                  _VSTD::forward_as_tuple(__x.second));
+    }
+
+    template <class _T1, class _T2, class _Up, class _Vp>
+    void construct(pair<_T1, _T2>* __p, pair<_Up, _Vp>&& __x) {
+        construct(__p, piecewise_construct,
+                  _VSTD::forward_as_tuple(_VSTD::forward<_Up>(__x.first)),
+                  _VSTD::forward_as_tuple(_VSTD::forward<_Vp>(__x.second)));
+    }
+#endif
+
+    template <class _Tp>
+        _LIBCPP_INLINE_VISIBILITY
+        void destroy(_Tp* __p)
+            {
+                typedef __outermost<outer_allocator_type> _OM;
+                allocator_traits<typename _OM::type>::
+                                         destroy(_OM()(outer_allocator()), __p);
+            }
+
+    _LIBCPP_INLINE_VISIBILITY
+    scoped_allocator_adaptor select_on_container_copy_construction() const _NOEXCEPT
+        {return base::select_on_container_copy_construction();}
+
+private:
+
+
+    template <class _OuterA2,
+              class = typename enable_if<
+                        is_constructible<outer_allocator_type, _OuterA2>::value
+                      >::type>
+    _LIBCPP_INLINE_VISIBILITY
+    scoped_allocator_adaptor(_OuterA2&& __o,
+                             const inner_allocator_type& __i) _NOEXCEPT
+        : base(_VSTD::forward<_OuterA2>(__o), __i) {}
+
+    template <class _Tp, class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        void __construct(integral_constant<int, 0>, _Tp* __p, _Args&& ...__args)
+            {
+                typedef __outermost<outer_allocator_type> _OM;
+                allocator_traits<typename _OM::type>::construct
+                (
+                    _OM()(outer_allocator()),
+                    __p,
+                    _VSTD::forward<_Args>(__args)...
+                );
+            }
+
+    template <class _Tp, class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        void __construct(integral_constant<int, 1>, _Tp* __p, _Args&& ...__args)
+            {
+                typedef __outermost<outer_allocator_type> _OM;
+                allocator_traits<typename _OM::type>::construct
+                (
+                    _OM()(outer_allocator()),
+                    __p, allocator_arg, inner_allocator(),
+                    _VSTD::forward<_Args>(__args)...
+                );
+            }
+
+    template <class _Tp, class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        void __construct(integral_constant<int, 2>, _Tp* __p, _Args&& ...__args)
+            {
+                typedef __outermost<outer_allocator_type> _OM;
+                allocator_traits<typename _OM::type>::construct
+                (
+                    _OM()(outer_allocator()),
+                    __p,
+                    _VSTD::forward<_Args>(__args)...,
+                    inner_allocator()
+                );
+            }
+
+    template <class ..._Args, size_t ..._Idx>
+    _LIBCPP_INLINE_VISIBILITY
+    tuple<_Args&&...>
+    __transform_tuple(integral_constant<int, 0>, tuple<_Args...>&& __t,
+                      __tuple_indices<_Idx...>)
+    {
+        return _VSTD::forward_as_tuple(_VSTD::get<_Idx>(_VSTD::move(__t))...);
+    }
+
+    template <class ..._Args, size_t ..._Idx>
+    _LIBCPP_INLINE_VISIBILITY
+    tuple<allocator_arg_t, inner_allocator_type&, _Args&&...>
+    __transform_tuple(integral_constant<int, 1>, tuple<_Args...> && __t,
+                      __tuple_indices<_Idx...>)
+    {
+        using _Tup = tuple<allocator_arg_t, inner_allocator_type&, _Args&&...>;
+        return _Tup(allocator_arg, inner_allocator(),
+                    _VSTD::get<_Idx>(_VSTD::move(__t))...);
+    }
+
+    template <class ..._Args, size_t ..._Idx>
+    _LIBCPP_INLINE_VISIBILITY
+    tuple<_Args&&..., inner_allocator_type&>
+    __transform_tuple(integral_constant<int, 2>, tuple<_Args...> && __t,
+                      __tuple_indices<_Idx...>)
+    {
+        using _Tup = tuple<_Args&&..., inner_allocator_type&>;
+        return _Tup(_VSTD::get<_Idx>(_VSTD::move(__t))..., inner_allocator());
+    }
+
+    template <class...> friend class __scoped_allocator_storage;
+};
+
+#if _LIBCPP_STD_VER > 14
+template<class _OuterAlloc, class... _InnerAllocs>
+    scoped_allocator_adaptor(_OuterAlloc, _InnerAllocs...)
+        -> scoped_allocator_adaptor<_OuterAlloc, _InnerAllocs...>;
+#endif
+
+template <class _OuterA1, class _OuterA2>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const scoped_allocator_adaptor<_OuterA1>& __a,
+           const scoped_allocator_adaptor<_OuterA2>& __b) _NOEXCEPT
+{
+    return __a.outer_allocator() == __b.outer_allocator();
+}
+
+template <class _OuterA1, class _OuterA2, class _InnerA0, class... _InnerAllocs>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const scoped_allocator_adaptor<_OuterA1, _InnerA0, _InnerAllocs...>& __a,
+           const scoped_allocator_adaptor<_OuterA2, _InnerA0, _InnerAllocs...>& __b) _NOEXCEPT
+{
+    return __a.outer_allocator() == __b.outer_allocator() &&
+           __a.inner_allocator() == __b.inner_allocator();
+}
+
+template <class _OuterA1, class _OuterA2, class... _InnerAllocs>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const scoped_allocator_adaptor<_OuterA1, _InnerAllocs...>& __a,
+           const scoped_allocator_adaptor<_OuterA2, _InnerAllocs...>& __b) _NOEXCEPT
+{
+    return !(__a == __b);
+}
+
+#endif // !defined(_LIBCPP_CXX03_LANG)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <atomic>
+#  include <climits>
+#  include <concepts>
+#  include <cstring>
+#  include <ctime>
+#  include <iterator>
+#  include <memory>
+#  include <ratio>
+#  include <stdexcept>
+#  include <type_traits>
+#  include <variant>
+#endif
+
+#endif // _LIBCPP_SCOPED_ALLOCATOR
diff --git a/app/src/main/cpp/libcxx/include/semaphore b/app/src/main/cpp/libcxx/include/semaphore
new file mode 100644
index 0000000..ddccb28
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/semaphore
@@ -0,0 +1,191 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_SEMAPHORE
+#define _LIBCPP_SEMAPHORE
+
+/*
+    semaphore synopsis
+
+namespace std {
+
+template<ptrdiff_t least_max_value = implementation-defined>
+class counting_semaphore
+{
+public:
+static constexpr ptrdiff_t max() noexcept;
+
+constexpr explicit counting_semaphore(ptrdiff_t desired);
+~counting_semaphore();
+
+counting_semaphore(const counting_semaphore&) = delete;
+counting_semaphore& operator=(const counting_semaphore&) = delete;
+
+void release(ptrdiff_t update = 1);
+void acquire();
+bool try_acquire() noexcept;
+template<class Rep, class Period>
+    bool try_acquire_for(const chrono::duration<Rep, Period>& rel_time);
+template<class Clock, class Duration>
+    bool try_acquire_until(const chrono::time_point<Clock, Duration>& abs_time);
+
+private:
+ptrdiff_t counter; // exposition only
+};
+
+using binary_semaphore = counting_semaphore<1>;
+
+}
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__chrono/time_point.h>
+#include <__config>
+#include <__thread/timed_backoff_policy.h>
+#include <__threading_support>
+#include <atomic>
+#include <limits>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifdef _LIBCPP_HAS_NO_THREADS
+# error "<semaphore> is not supported since libc++ has been configured without support for threads."
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+#if _LIBCPP_STD_VER >= 14
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+/*
+
+__atomic_semaphore_base is the general-case implementation.
+It is a typical Dijkstra semaphore algorithm over atomics, wait and notify
+functions. It avoids contention against users' own use of those facilities.
+
+*/
+
+class __atomic_semaphore_base
+{
+    __atomic_base<ptrdiff_t> __a_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit __atomic_semaphore_base(ptrdiff_t __count) : __a_(__count)
+    {
+    }
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void release(ptrdiff_t __update = 1)
+    {
+        if(0 < __a_.fetch_add(__update, memory_order_release))
+            ;
+        else if(__update > 1)
+            __a_.notify_all();
+        else
+            __a_.notify_one();
+    }
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void acquire()
+    {
+        auto const __test_fn = [this]() -> bool {
+            auto __old = __a_.load(memory_order_relaxed);
+            return (__old != 0) && __a_.compare_exchange_strong(__old, __old - 1, memory_order_acquire, memory_order_relaxed);
+        };
+        __cxx_atomic_wait(&__a_.__a_, __test_fn);
+    }
+    template <class Rep, class Period>
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    bool try_acquire_for(chrono::duration<Rep, Period> const& __rel_time)
+    {
+        if (__rel_time == chrono::duration<Rep, Period>::zero())
+            return try_acquire();
+        auto const __test_fn = [this]() { return try_acquire(); };
+        return std::__libcpp_thread_poll_with_backoff(__test_fn, __libcpp_timed_backoff_policy(), __rel_time);
+    }
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    bool try_acquire()
+    {
+        auto __old = __a_.load(memory_order_acquire);
+        while (true) {
+            if (__old == 0)
+                return false;
+            if (__a_.compare_exchange_strong(__old, __old - 1, memory_order_acquire, memory_order_relaxed))
+                return true;
+        }
+    }
+};
+
+#define _LIBCPP_SEMAPHORE_MAX (numeric_limits<ptrdiff_t>::max())
+
+template<ptrdiff_t __least_max_value = _LIBCPP_SEMAPHORE_MAX>
+class counting_semaphore
+{
+    __atomic_semaphore_base __semaphore_;
+
+public:
+    static constexpr ptrdiff_t max() noexcept {
+        return __least_max_value;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit counting_semaphore(ptrdiff_t __count) : __semaphore_(__count) { }
+    ~counting_semaphore() = default;
+
+    counting_semaphore(const counting_semaphore&) = delete;
+    counting_semaphore& operator=(const counting_semaphore&) = delete;
+
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void release(ptrdiff_t __update = 1)
+    {
+        __semaphore_.release(__update);
+    }
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    void acquire()
+    {
+        __semaphore_.acquire();
+    }
+    template<class Rep, class Period>
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    bool try_acquire_for(chrono::duration<Rep, Period> const& __rel_time)
+    {
+        return __semaphore_.try_acquire_for(chrono::duration_cast<chrono::nanoseconds>(__rel_time));
+    }
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    bool try_acquire()
+    {
+        return __semaphore_.try_acquire();
+    }
+    template <class Clock, class Duration>
+    _LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
+    bool try_acquire_until(chrono::time_point<Clock, Duration> const& __abs_time)
+    {
+        auto const current = Clock::now();
+        if (current >= __abs_time)
+            return try_acquire();
+        else
+            return try_acquire_for(__abs_time - current);
+    }
+};
+
+using binary_semaphore = counting_semaphore<1>;
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER >= 14
+
+_LIBCPP_POP_MACROS
+
+#endif //_LIBCPP_SEMAPHORE
diff --git a/app/src/main/cpp/libcxx/include/set b/app/src/main/cpp/libcxx/include/set
new file mode 100644
index 0000000..1154c4e
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/set
@@ -0,0 +1,1605 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_SET
+#define _LIBCPP_SET
+
+/*
+
+    set synopsis
+
+namespace std
+{
+
+template <class Key, class Compare = less<Key>,
+          class Allocator = allocator<Key>>
+class set
+{
+public:
+    // types:
+    typedef Key                                      key_type;
+    typedef key_type                                 value_type;
+    typedef Compare                                  key_compare;
+    typedef key_compare                              value_compare;
+    typedef Allocator                                allocator_type;
+    typedef typename allocator_type::reference       reference;
+    typedef typename allocator_type::const_reference const_reference;
+    typedef typename allocator_type::size_type       size_type;
+    typedef typename allocator_type::difference_type difference_type;
+    typedef typename allocator_type::pointer         pointer;
+    typedef typename allocator_type::const_pointer   const_pointer;
+
+    typedef implementation-defined                   iterator;
+    typedef implementation-defined                   const_iterator;
+    typedef std::reverse_iterator<iterator>          reverse_iterator;
+    typedef std::reverse_iterator<const_iterator>    const_reverse_iterator;
+    typedef unspecified                              node_type;               // C++17
+    typedef INSERT_RETURN_TYPE<iterator, node_type>  insert_return_type;      // C++17
+
+    // construct/copy/destroy:
+    set()
+        noexcept(
+            is_nothrow_default_constructible<allocator_type>::value &&
+            is_nothrow_default_constructible<key_compare>::value &&
+            is_nothrow_copy_constructible<key_compare>::value);
+    explicit set(const value_compare& comp);
+    set(const value_compare& comp, const allocator_type& a);
+    template <class InputIterator>
+        set(InputIterator first, InputIterator last,
+            const value_compare& comp = value_compare());
+    template <class InputIterator>
+        set(InputIterator first, InputIterator last, const value_compare& comp,
+            const allocator_type& a);
+    set(const set& s);
+    set(set&& s)
+        noexcept(
+            is_nothrow_move_constructible<allocator_type>::value &&
+            is_nothrow_move_constructible<key_compare>::value);
+    explicit set(const allocator_type& a);
+    set(const set& s, const allocator_type& a);
+    set(set&& s, const allocator_type& a);
+    set(initializer_list<value_type> il, const value_compare& comp = value_compare());
+    set(initializer_list<value_type> il, const value_compare& comp,
+        const allocator_type& a);
+    template <class InputIterator>
+        set(InputIterator first, InputIterator last, const allocator_type& a)
+            : set(first, last, Compare(), a) {}  // C++14
+    set(initializer_list<value_type> il, const allocator_type& a)
+        : set(il, Compare(), a) {}  // C++14
+    ~set();
+
+    set& operator=(const set& s);
+    set& operator=(set&& s)
+        noexcept(
+            allocator_type::propagate_on_container_move_assignment::value &&
+            is_nothrow_move_assignable<allocator_type>::value &&
+            is_nothrow_move_assignable<key_compare>::value);
+    set& operator=(initializer_list<value_type> il);
+
+    // iterators:
+          iterator begin() noexcept;
+    const_iterator begin() const noexcept;
+          iterator end() noexcept;
+    const_iterator end()   const noexcept;
+
+          reverse_iterator rbegin() noexcept;
+    const_reverse_iterator rbegin() const noexcept;
+          reverse_iterator rend() noexcept;
+    const_reverse_iterator rend()   const noexcept;
+
+    const_iterator         cbegin()  const noexcept;
+    const_iterator         cend()    const noexcept;
+    const_reverse_iterator crbegin() const noexcept;
+    const_reverse_iterator crend()   const noexcept;
+
+    // capacity:
+    bool      empty()    const noexcept;
+    size_type size()     const noexcept;
+    size_type max_size() const noexcept;
+
+    // modifiers:
+    template <class... Args>
+        pair<iterator, bool> emplace(Args&&... args);
+    template <class... Args>
+        iterator emplace_hint(const_iterator position, Args&&... args);
+    pair<iterator,bool> insert(const value_type& v);
+    pair<iterator,bool> insert(value_type&& v);
+    iterator insert(const_iterator position, const value_type& v);
+    iterator insert(const_iterator position, value_type&& v);
+    template <class InputIterator>
+        void insert(InputIterator first, InputIterator last);
+    void insert(initializer_list<value_type> il);
+
+    node_type extract(const_iterator position);                                       // C++17
+    node_type extract(const key_type& x);                                             // C++17
+    insert_return_type insert(node_type&& nh);                                        // C++17
+    iterator insert(const_iterator hint, node_type&& nh);                             // C++17
+
+    iterator  erase(const_iterator position);
+    iterator  erase(iterator position);  // C++14
+    size_type erase(const key_type& k);
+    iterator  erase(const_iterator first, const_iterator last);
+    void clear() noexcept;
+
+    template<class C2>
+      void merge(set<Key, C2, Allocator>& source);         // C++17
+    template<class C2>
+      void merge(set<Key, C2, Allocator>&& source);        // C++17
+    template<class C2>
+      void merge(multiset<Key, C2, Allocator>& source);    // C++17
+    template<class C2>
+      void merge(multiset<Key, C2, Allocator>&& source);   // C++17
+
+    void swap(set& s)
+        noexcept(
+            __is_nothrow_swappable<key_compare>::value &&
+            (!allocator_type::propagate_on_container_swap::value ||
+             __is_nothrow_swappable<allocator_type>::value));
+
+    // observers:
+    allocator_type get_allocator() const noexcept;
+    key_compare    key_comp()      const;
+    value_compare  value_comp()    const;
+
+    // set operations:
+          iterator find(const key_type& k);
+    const_iterator find(const key_type& k) const;
+    template<typename K>
+        iterator find(const K& x);
+    template<typename K>
+        const_iterator find(const K& x) const;  // C++14
+
+    template<typename K>
+        size_type count(const K& x) const;        // C++14
+    size_type      count(const key_type& k) const;
+
+    bool           contains(const key_type& x) const;  // C++20
+    template<class K> bool contains(const K& x) const; // C++20
+
+          iterator lower_bound(const key_type& k);
+    const_iterator lower_bound(const key_type& k) const;
+    template<typename K>
+        iterator lower_bound(const K& x);              // C++14
+    template<typename K>
+        const_iterator lower_bound(const K& x) const;  // C++14
+
+          iterator upper_bound(const key_type& k);
+    const_iterator upper_bound(const key_type& k) const;
+    template<typename K>
+        iterator upper_bound(const K& x);              // C++14
+    template<typename K>
+        const_iterator upper_bound(const K& x) const;  // C++14
+    pair<iterator,iterator>             equal_range(const key_type& k);
+    pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
+    template<typename K>
+        pair<iterator,iterator>             equal_range(const K& x);        // C++14
+    template<typename K>
+        pair<const_iterator,const_iterator> equal_range(const K& x) const;  // C++14
+};
+
+template <class InputIterator,
+      class Compare = less<typename iterator_traits<InputIterator>::value_type>,
+      class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
+set(InputIterator, InputIterator,
+    Compare = Compare(), Allocator = Allocator())
+  -> set<typename iterator_traits<InputIterator>::value_type, Compare, Allocator>; // C++17
+
+template<class Key, class Compare = less<Key>, class Allocator = allocator<Key>>
+set(initializer_list<Key>, Compare = Compare(), Allocator = Allocator())
+  -> set<Key, Compare, Allocator>; // C++17
+
+template<class InputIterator, class Allocator>
+set(InputIterator, InputIterator, Allocator)
+  -> set<typename iterator_traits<InputIterator>::value_type,
+          less<typename iterator_traits<InputIterator>::value_type>, Allocator>; // C++17
+
+template<class Key, class Allocator>
+set(initializer_list<Key>, Allocator) -> set<Key, less<Key>, Allocator>; // C++17
+
+template <class Key, class Compare, class Allocator>
+bool
+operator==(const set<Key, Compare, Allocator>& x,
+           const set<Key, Compare, Allocator>& y);
+
+template <class Key, class Compare, class Allocator>
+bool
+operator< (const set<Key, Compare, Allocator>& x,
+           const set<Key, Compare, Allocator>& y);
+
+template <class Key, class Compare, class Allocator>
+bool
+operator!=(const set<Key, Compare, Allocator>& x,
+           const set<Key, Compare, Allocator>& y);
+
+template <class Key, class Compare, class Allocator>
+bool
+operator> (const set<Key, Compare, Allocator>& x,
+           const set<Key, Compare, Allocator>& y);
+
+template <class Key, class Compare, class Allocator>
+bool
+operator>=(const set<Key, Compare, Allocator>& x,
+           const set<Key, Compare, Allocator>& y);
+
+template <class Key, class Compare, class Allocator>
+bool
+operator<=(const set<Key, Compare, Allocator>& x,
+           const set<Key, Compare, Allocator>& y);
+
+// specialized algorithms:
+template <class Key, class Compare, class Allocator>
+void
+swap(set<Key, Compare, Allocator>& x, set<Key, Compare, Allocator>& y)
+    noexcept(noexcept(x.swap(y)));
+
+template <class Key, class Compare, class Allocator, class Predicate>
+typename set<Key, Compare, Allocator>::size_type
+erase_if(set<Key, Compare, Allocator>& c, Predicate pred);  // C++20
+
+template <class Key, class Compare = less<Key>,
+          class Allocator = allocator<Key>>
+class multiset
+{
+public:
+    // types:
+    typedef Key                                      key_type;
+    typedef key_type                                 value_type;
+    typedef Compare                                  key_compare;
+    typedef key_compare                              value_compare;
+    typedef Allocator                                allocator_type;
+    typedef typename allocator_type::reference       reference;
+    typedef typename allocator_type::const_reference const_reference;
+    typedef typename allocator_type::size_type       size_type;
+    typedef typename allocator_type::difference_type difference_type;
+    typedef typename allocator_type::pointer         pointer;
+    typedef typename allocator_type::const_pointer   const_pointer;
+
+    typedef implementation-defined                   iterator;
+    typedef implementation-defined                   const_iterator;
+    typedef std::reverse_iterator<iterator>          reverse_iterator;
+    typedef std::reverse_iterator<const_iterator>    const_reverse_iterator;
+    typedef unspecified                              node_type;               // C++17
+
+    // construct/copy/destroy:
+    multiset()
+        noexcept(
+            is_nothrow_default_constructible<allocator_type>::value &&
+            is_nothrow_default_constructible<key_compare>::value &&
+            is_nothrow_copy_constructible<key_compare>::value);
+    explicit multiset(const value_compare& comp);
+    multiset(const value_compare& comp, const allocator_type& a);
+    template <class InputIterator>
+        multiset(InputIterator first, InputIterator last,
+                 const value_compare& comp = value_compare());
+    template <class InputIterator>
+        multiset(InputIterator first, InputIterator last,
+                 const value_compare& comp, const allocator_type& a);
+    multiset(const multiset& s);
+    multiset(multiset&& s)
+        noexcept(
+            is_nothrow_move_constructible<allocator_type>::value &&
+            is_nothrow_move_constructible<key_compare>::value);
+    explicit multiset(const allocator_type& a);
+    multiset(const multiset& s, const allocator_type& a);
+    multiset(multiset&& s, const allocator_type& a);
+    multiset(initializer_list<value_type> il, const value_compare& comp = value_compare());
+    multiset(initializer_list<value_type> il, const value_compare& comp,
+             const allocator_type& a);
+    template <class InputIterator>
+        multiset(InputIterator first, InputIterator last, const allocator_type& a)
+            : set(first, last, Compare(), a) {}  // C++14
+    multiset(initializer_list<value_type> il, const allocator_type& a)
+        : set(il, Compare(), a) {}  // C++14
+    ~multiset();
+
+    multiset& operator=(const multiset& s);
+    multiset& operator=(multiset&& s)
+        noexcept(
+            allocator_type::propagate_on_container_move_assignment::value &&
+            is_nothrow_move_assignable<allocator_type>::value &&
+            is_nothrow_move_assignable<key_compare>::value);
+    multiset& operator=(initializer_list<value_type> il);
+
+    // iterators:
+          iterator begin() noexcept;
+    const_iterator begin() const noexcept;
+          iterator end() noexcept;
+    const_iterator end()   const noexcept;
+
+          reverse_iterator rbegin() noexcept;
+    const_reverse_iterator rbegin() const noexcept;
+          reverse_iterator rend() noexcept;
+    const_reverse_iterator rend()   const noexcept;
+
+    const_iterator         cbegin()  const noexcept;
+    const_iterator         cend()    const noexcept;
+    const_reverse_iterator crbegin() const noexcept;
+    const_reverse_iterator crend()   const noexcept;
+
+    // capacity:
+    bool      empty()    const noexcept;
+    size_type size()     const noexcept;
+    size_type max_size() const noexcept;
+
+    // modifiers:
+    template <class... Args>
+        iterator emplace(Args&&... args);
+    template <class... Args>
+        iterator emplace_hint(const_iterator position, Args&&... args);
+    iterator insert(const value_type& v);
+    iterator insert(value_type&& v);
+    iterator insert(const_iterator position, const value_type& v);
+    iterator insert(const_iterator position, value_type&& v);
+    template <class InputIterator>
+        void insert(InputIterator first, InputIterator last);
+    void insert(initializer_list<value_type> il);
+
+    node_type extract(const_iterator position);                                       // C++17
+    node_type extract(const key_type& x);                                             // C++17
+    iterator insert(node_type&& nh);                                                  // C++17
+    iterator insert(const_iterator hint, node_type&& nh);                             // C++17
+
+    iterator  erase(const_iterator position);
+    iterator  erase(iterator position);  // C++14
+    size_type erase(const key_type& k);
+    iterator  erase(const_iterator first, const_iterator last);
+    void clear() noexcept;
+
+    template<class C2>
+      void merge(multiset<Key, C2, Allocator>& source);    // C++17
+    template<class C2>
+      void merge(multiset<Key, C2, Allocator>&& source);   // C++17
+    template<class C2>
+      void merge(set<Key, C2, Allocator>& source);         // C++17
+    template<class C2>
+      void merge(set<Key, C2, Allocator>&& source);        // C++17
+
+    void swap(multiset& s)
+        noexcept(
+            __is_nothrow_swappable<key_compare>::value &&
+            (!allocator_type::propagate_on_container_swap::value ||
+             __is_nothrow_swappable<allocator_type>::value));
+
+    // observers:
+    allocator_type get_allocator() const noexcept;
+    key_compare    key_comp()      const;
+    value_compare  value_comp()    const;
+
+    // set operations:
+          iterator find(const key_type& k);
+    const_iterator find(const key_type& k) const;
+    template<typename K>
+        iterator find(const K& x);
+    template<typename K>
+        const_iterator find(const K& x) const;  // C++14
+
+    template<typename K>
+        size_type count(const K& x) const;      // C++14
+    size_type      count(const key_type& k) const;
+
+    bool           contains(const key_type& x) const;  // C++20
+    template<class K> bool contains(const K& x) const; // C++20
+
+          iterator lower_bound(const key_type& k);
+    const_iterator lower_bound(const key_type& k) const;
+    template<typename K>
+        iterator lower_bound(const K& x);              // C++14
+    template<typename K>
+        const_iterator lower_bound(const K& x) const;  // C++14
+
+          iterator upper_bound(const key_type& k);
+    const_iterator upper_bound(const key_type& k) const;
+    template<typename K>
+        iterator upper_bound(const K& x);              // C++14
+    template<typename K>
+        const_iterator upper_bound(const K& x) const;  // C++14
+
+    pair<iterator,iterator>             equal_range(const key_type& k);
+    pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
+    template<typename K>
+        pair<iterator,iterator>             equal_range(const K& x);        // C++14
+    template<typename K>
+        pair<const_iterator,const_iterator> equal_range(const K& x) const;  // C++14
+};
+
+template <class InputIterator,
+      class Compare = less<typename iterator_traits<InputIterator>::value_type>,
+      class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
+multiset(InputIterator, InputIterator,
+    Compare = Compare(), Allocator = Allocator())
+  -> multiset<typename iterator_traits<InputIterator>::value_type, Compare, Allocator>; // C++17
+
+template<class Key, class Compare = less<Key>, class Allocator = allocator<Key>>
+multiset(initializer_list<Key>, Compare = Compare(), Allocator = Allocator())
+  -> multiset<Key, Compare, Allocator>; // C++17
+
+template<class InputIterator, class Allocator>
+multiset(InputIterator, InputIterator, Allocator)
+  -> multiset<typename iterator_traits<InputIterator>::value_type,
+          less<typename iterator_traits<InputIterator>::value_type>, Allocator>; // C++17
+
+template<class Key, class Allocator>
+multiset(initializer_list<Key>, Allocator) -> multiset<Key, less<Key>, Allocator>; // C++17
+
+template <class Key, class Compare, class Allocator>
+bool
+operator==(const multiset<Key, Compare, Allocator>& x,
+           const multiset<Key, Compare, Allocator>& y);
+
+template <class Key, class Compare, class Allocator>
+bool
+operator< (const multiset<Key, Compare, Allocator>& x,
+           const multiset<Key, Compare, Allocator>& y);
+
+template <class Key, class Compare, class Allocator>
+bool
+operator!=(const multiset<Key, Compare, Allocator>& x,
+           const multiset<Key, Compare, Allocator>& y);
+
+template <class Key, class Compare, class Allocator>
+bool
+operator> (const multiset<Key, Compare, Allocator>& x,
+           const multiset<Key, Compare, Allocator>& y);
+
+template <class Key, class Compare, class Allocator>
+bool
+operator>=(const multiset<Key, Compare, Allocator>& x,
+           const multiset<Key, Compare, Allocator>& y);
+
+template <class Key, class Compare, class Allocator>
+bool
+operator<=(const multiset<Key, Compare, Allocator>& x,
+           const multiset<Key, Compare, Allocator>& y);
+
+// specialized algorithms:
+template <class Key, class Compare, class Allocator>
+void
+swap(multiset<Key, Compare, Allocator>& x, multiset<Key, Compare, Allocator>& y)
+    noexcept(noexcept(x.swap(y)));
+
+template <class Key, class Compare, class Allocator, class Predicate>
+typename multiset<Key, Compare, Allocator>::size_type
+erase_if(multiset<Key, Compare, Allocator>& c, Predicate pred);  // C++20
+
+}  // std
+
+*/
+
+#include <__algorithm/equal.h>
+#include <__algorithm/lexicographical_compare.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__functional/is_transparent.h>
+#include <__functional/operations.h>
+#include <__iterator/erase_if_container.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/reverse_iterator.h>
+#include <__memory/allocator.h>
+#include <__memory_resource/polymorphic_allocator.h>
+#include <__node_handle>
+#include <__tree>
+#include <__type_traits/is_allocator.h>
+#include <__utility/forward.h>
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+// [associative.set.syn]
+#include <compare>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Key, class _Compare, class _Allocator>
+class multiset;
+
+template <class _Key, class _Compare = less<_Key>,
+          class _Allocator = allocator<_Key> >
+class _LIBCPP_TEMPLATE_VIS set
+{
+public:
+    // types:
+    typedef _Key                                     key_type;
+    typedef key_type                                 value_type;
+    typedef __type_identity_t<_Compare>              key_compare;
+    typedef key_compare                              value_compare;
+    typedef __type_identity_t<_Allocator>            allocator_type;
+    typedef value_type&                              reference;
+    typedef const value_type&                        const_reference;
+
+    static_assert((is_same<typename allocator_type::value_type, value_type>::value),
+                  "Allocator::value_type must be same type as value_type");
+
+private:
+    typedef __tree<value_type, value_compare, allocator_type> __base;
+    typedef allocator_traits<allocator_type>                  __alloc_traits;
+
+    static_assert(is_same<allocator_type, __rebind_alloc<__alloc_traits, value_type> >::value,
+                  "[allocator.requirements] states that rebinding an allocator to the same type should result in the "
+                  "original allocator");
+
+    __base __tree_;
+
+public:
+    typedef typename __base::pointer               pointer;
+    typedef typename __base::const_pointer         const_pointer;
+    typedef typename __base::size_type             size_type;
+    typedef typename __base::difference_type       difference_type;
+    typedef typename __base::const_iterator        iterator;
+    typedef typename __base::const_iterator        const_iterator;
+    typedef _VSTD::reverse_iterator<iterator>       reverse_iterator;
+    typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
+
+#if _LIBCPP_STD_VER > 14
+    typedef __set_node_handle<typename __base::__node, allocator_type> node_type;
+    typedef __insert_return_type<iterator, node_type> insert_return_type;
+#endif
+
+    template <class _Key2, class _Compare2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS set;
+    template <class _Key2, class _Compare2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS multiset;
+
+    _LIBCPP_INLINE_VISIBILITY
+    set()
+        _NOEXCEPT_(
+            is_nothrow_default_constructible<allocator_type>::value &&
+            is_nothrow_default_constructible<key_compare>::value &&
+            is_nothrow_copy_constructible<key_compare>::value)
+        : __tree_(value_compare()) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit set(const value_compare& __comp)
+        _NOEXCEPT_(
+            is_nothrow_default_constructible<allocator_type>::value &&
+            is_nothrow_copy_constructible<key_compare>::value)
+        : __tree_(__comp) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit set(const value_compare& __comp, const allocator_type& __a)
+        : __tree_(__comp, __a) {}
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        set(_InputIterator __f, _InputIterator __l,
+            const value_compare& __comp = value_compare())
+        : __tree_(__comp)
+        {
+            insert(__f, __l);
+        }
+
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        set(_InputIterator __f, _InputIterator __l, const value_compare& __comp,
+            const allocator_type& __a)
+        : __tree_(__comp, __a)
+        {
+            insert(__f, __l);
+        }
+
+#if _LIBCPP_STD_VER > 11
+        template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        set(_InputIterator __f, _InputIterator __l, const allocator_type& __a)
+            : set(__f, __l, key_compare(), __a) {}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    set(const set& __s)
+        : __tree_(__s.__tree_)
+        {
+            insert(__s.begin(), __s.end());
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    set& operator=(const set& __s)
+        {
+            __tree_ = __s.__tree_;
+            return *this;
+        }
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    set(set&& __s)
+        _NOEXCEPT_(is_nothrow_move_constructible<__base>::value)
+        : __tree_(_VSTD::move(__s.__tree_)) {}
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit set(const allocator_type& __a)
+        : __tree_(__a) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    set(const set& __s, const allocator_type& __a)
+        : __tree_(__s.__tree_.value_comp(), __a)
+        {
+            insert(__s.begin(), __s.end());
+        }
+
+#ifndef _LIBCPP_CXX03_LANG
+    set(set&& __s, const allocator_type& __a);
+
+    _LIBCPP_INLINE_VISIBILITY
+    set(initializer_list<value_type> __il, const value_compare& __comp = value_compare())
+        : __tree_(__comp)
+        {
+            insert(__il.begin(), __il.end());
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    set(initializer_list<value_type> __il, const value_compare& __comp,
+        const allocator_type& __a)
+        : __tree_(__comp, __a)
+        {
+            insert(__il.begin(), __il.end());
+        }
+
+#if _LIBCPP_STD_VER > 11
+    _LIBCPP_INLINE_VISIBILITY
+    set(initializer_list<value_type> __il, const allocator_type& __a)
+        : set(__il, key_compare(), __a) {}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    set& operator=(initializer_list<value_type> __il)
+        {
+            __tree_.__assign_unique(__il.begin(), __il.end());
+            return *this;
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    set& operator=(set&& __s)
+        _NOEXCEPT_(is_nothrow_move_assignable<__base>::value)
+        {
+            __tree_ = _VSTD::move(__s.__tree_);
+            return *this;
+        }
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~set() {
+        static_assert(sizeof(__diagnose_non_const_comparator<_Key, _Compare>()), "");
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+          iterator begin() _NOEXCEPT       {return __tree_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+          iterator end() _NOEXCEPT         {return __tree_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end()   const _NOEXCEPT {return __tree_.end();}
+
+    _LIBCPP_INLINE_VISIBILITY
+          reverse_iterator rbegin() _NOEXCEPT
+            {return reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator rbegin() const _NOEXCEPT
+        {return const_reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY
+          reverse_iterator rend() _NOEXCEPT
+            {return reverse_iterator(begin());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator rend() const _NOEXCEPT
+        {return const_reverse_iterator(begin());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbegin()  const _NOEXCEPT {return begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cend() const _NOEXCEPT {return end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator crend() const _NOEXCEPT {return rend();}
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool empty() const _NOEXCEPT {return __tree_.size() == 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const _NOEXCEPT {return __tree_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT {return __tree_.max_size();}
+
+    // modifiers:
+#ifndef _LIBCPP_CXX03_LANG
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        pair<iterator, bool> emplace(_Args&&... __args)
+            {return __tree_.__emplace_unique(_VSTD::forward<_Args>(__args)...);}
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator emplace_hint(const_iterator __p, _Args&&... __args)
+            {return __tree_.__emplace_hint_unique(__p, _VSTD::forward<_Args>(__args)...);}
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator,bool> insert(const value_type& __v)
+        {return __tree_.__insert_unique(__v);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, const value_type& __v)
+        {return __tree_.__insert_unique(__p, __v);}
+
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        void insert(_InputIterator __f, _InputIterator __l)
+        {
+            for (const_iterator __e = cend(); __f != __l; ++__f)
+                __tree_.__insert_unique(__e, *__f);
+        }
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator,bool> insert(value_type&& __v)
+        {return __tree_.__insert_unique(_VSTD::move(__v));}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, value_type&& __v)
+        {return __tree_.__insert_unique(__p, _VSTD::move(__v));}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void insert(initializer_list<value_type> __il)
+        {insert(__il.begin(), __il.end());}
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator  erase(const_iterator __p) {return __tree_.erase(__p);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type erase(const key_type& __k)
+        {return __tree_.__erase_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator  erase(const_iterator __f, const_iterator __l)
+        {return __tree_.erase(__f, __l);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() _NOEXCEPT {__tree_.clear();}
+
+#if _LIBCPP_STD_VER > 14
+    _LIBCPP_INLINE_VISIBILITY
+    insert_return_type insert(node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to set::insert()");
+        return __tree_.template __node_handle_insert_unique<
+            node_type, insert_return_type>(_VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __hint, node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to set::insert()");
+        return __tree_.template __node_handle_insert_unique<node_type>(
+            __hint, _VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(key_type const& __key)
+    {
+        return __tree_.template __node_handle_extract<node_type>(__key);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(const_iterator __it)
+    {
+        return __tree_.template __node_handle_extract<node_type>(__it);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(set<key_type, _Compare2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __tree_.__node_handle_merge_unique(__source.__tree_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(set<key_type, _Compare2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __tree_.__node_handle_merge_unique(__source.__tree_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(multiset<key_type, _Compare2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __tree_.__node_handle_merge_unique(__source.__tree_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(multiset<key_type, _Compare2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __tree_.__node_handle_merge_unique(__source.__tree_);
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(set& __s) _NOEXCEPT_(__is_nothrow_swappable<__base>::value)
+        {__tree_.swap(__s.__tree_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const _NOEXCEPT {return __tree_.__alloc();}
+    _LIBCPP_INLINE_VISIBILITY
+    key_compare    key_comp()      const {return __tree_.value_comp();}
+    _LIBCPP_INLINE_VISIBILITY
+    value_compare  value_comp()    const {return __tree_.value_comp();}
+
+    // set operations:
+    _LIBCPP_INLINE_VISIBILITY
+    iterator find(const key_type& __k)             {return __tree_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
+    find(const _K2& __k)                           {return __tree_.find(__k);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
+    find(const _K2& __k) const                     {return __tree_.find(__k);}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type      count(const key_type& __k) const
+        {return __tree_.__count_unique(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,size_type>::type
+    count(const _K2& __k) const                    {return __tree_.__count_multi(__k);}
+#endif
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY
+    bool contains(const key_type& __k) const {return find(__k) != end();}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value, bool>::type
+    contains(const _K2& __k) const { return find(__k) != end(); }
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator lower_bound(const key_type& __k)
+        {return __tree_.lower_bound(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator lower_bound(const key_type& __k) const
+        {return __tree_.lower_bound(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
+    lower_bound(const _K2& __k)       {return __tree_.lower_bound(__k);}
+
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
+    lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator upper_bound(const key_type& __k)
+        {return __tree_.upper_bound(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator upper_bound(const key_type& __k) const
+        {return __tree_.upper_bound(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
+    upper_bound(const _K2& __k)       {return __tree_.upper_bound(__k);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
+    upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator,iterator> equal_range(const key_type& __k)
+        {return __tree_.__equal_range_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
+        {return __tree_.__equal_range_unique(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,pair<iterator,iterator>>::type
+    equal_range(const _K2& __k)       {return __tree_.__equal_range_multi(__k);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::type
+    equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}
+#endif
+};
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator,
+         class _Compare = less<__iter_value_type<_InputIterator>>,
+         class _Allocator = allocator<__iter_value_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value, void>,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>,
+         class = enable_if_t<!__is_allocator<_Compare>::value, void>>
+set(_InputIterator, _InputIterator, _Compare = _Compare(), _Allocator = _Allocator())
+  -> set<__iter_value_type<_InputIterator>, _Compare, _Allocator>;
+
+template<class _Key, class _Compare = less<_Key>,
+         class _Allocator = allocator<_Key>,
+         class = enable_if_t<!__is_allocator<_Compare>::value, void>,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+set(initializer_list<_Key>, _Compare = _Compare(), _Allocator = _Allocator())
+  -> set<_Key, _Compare, _Allocator>;
+
+template<class _InputIterator, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value, void>,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+set(_InputIterator, _InputIterator, _Allocator)
+  -> set<__iter_value_type<_InputIterator>,
+         less<__iter_value_type<_InputIterator>>, _Allocator>;
+
+template<class _Key, class _Allocator,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+set(initializer_list<_Key>, _Allocator)
+  -> set<_Key, less<_Key>, _Allocator>;
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Compare, class _Allocator>
+set<_Key, _Compare, _Allocator>::set(set&& __s, const allocator_type& __a)
+    : __tree_(_VSTD::move(__s.__tree_), __a)
+{
+    if (__a != __s.get_allocator())
+    {
+        const_iterator __e = cend();
+        while (!__s.empty())
+            insert(__e, _VSTD::move(__s.__tree_.remove(__s.begin())->__value_));
+    }
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const set<_Key, _Compare, _Allocator>& __x,
+           const set<_Key, _Compare, _Allocator>& __y)
+{
+    return __x.size() == __y.size() && _VSTD::equal(__x.begin(), __x.end(), __y.begin());
+}
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator< (const set<_Key, _Compare, _Allocator>& __x,
+           const set<_Key, _Compare, _Allocator>& __y)
+{
+    return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
+}
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const set<_Key, _Compare, _Allocator>& __x,
+           const set<_Key, _Compare, _Allocator>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator> (const set<_Key, _Compare, _Allocator>& __x,
+           const set<_Key, _Compare, _Allocator>& __y)
+{
+    return __y < __x;
+}
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const set<_Key, _Compare, _Allocator>& __x,
+           const set<_Key, _Compare, _Allocator>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const set<_Key, _Compare, _Allocator>& __x,
+           const set<_Key, _Compare, _Allocator>& __y)
+{
+    return !(__y < __x);
+}
+
+// specialized algorithms:
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(set<_Key, _Compare, _Allocator>& __x,
+     set<_Key, _Compare, _Allocator>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Key, class _Compare, class _Allocator, class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY
+    typename set<_Key, _Compare, _Allocator>::size_type
+    erase_if(set<_Key, _Compare, _Allocator>& __c, _Predicate __pred) {
+  return _VSTD::__libcpp_erase_if_container(__c, __pred);
+}
+#endif
+
+template <class _Key, class _Compare = less<_Key>,
+          class _Allocator = allocator<_Key> >
+class _LIBCPP_TEMPLATE_VIS multiset
+{
+public:
+    // types:
+    typedef _Key                                     key_type;
+    typedef key_type                                 value_type;
+    typedef __type_identity_t<_Compare>              key_compare;
+    typedef key_compare                              value_compare;
+    typedef __type_identity_t<_Allocator>            allocator_type;
+    typedef value_type&                              reference;
+    typedef const value_type&                        const_reference;
+
+    static_assert((is_same<typename allocator_type::value_type, value_type>::value),
+                  "Allocator::value_type must be same type as value_type");
+
+private:
+    typedef __tree<value_type, value_compare, allocator_type> __base;
+    typedef allocator_traits<allocator_type>                  __alloc_traits;
+
+    static_assert(is_same<allocator_type, __rebind_alloc<__alloc_traits, value_type> >::value,
+                  "[allocator.requirements] states that rebinding an allocator to the same type should result in the "
+                  "original allocator");
+
+    __base __tree_;
+
+public:
+    typedef typename __base::pointer               pointer;
+    typedef typename __base::const_pointer         const_pointer;
+    typedef typename __base::size_type             size_type;
+    typedef typename __base::difference_type       difference_type;
+    typedef typename __base::const_iterator        iterator;
+    typedef typename __base::const_iterator        const_iterator;
+    typedef _VSTD::reverse_iterator<iterator>       reverse_iterator;
+    typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
+
+#if _LIBCPP_STD_VER > 14
+    typedef __set_node_handle<typename __base::__node, allocator_type> node_type;
+#endif
+
+    template <class _Key2, class _Compare2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS set;
+    template <class _Key2, class _Compare2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS multiset;
+
+    // construct/copy/destroy:
+    _LIBCPP_INLINE_VISIBILITY
+    multiset()
+        _NOEXCEPT_(
+            is_nothrow_default_constructible<allocator_type>::value &&
+            is_nothrow_default_constructible<key_compare>::value &&
+            is_nothrow_copy_constructible<key_compare>::value)
+        : __tree_(value_compare()) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit multiset(const value_compare& __comp)
+        _NOEXCEPT_(
+            is_nothrow_default_constructible<allocator_type>::value &&
+            is_nothrow_copy_constructible<key_compare>::value)
+        : __tree_(__comp) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit multiset(const value_compare& __comp, const allocator_type& __a)
+        : __tree_(__comp, __a) {}
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        multiset(_InputIterator __f, _InputIterator __l,
+                 const value_compare& __comp = value_compare())
+        : __tree_(__comp)
+        {
+            insert(__f, __l);
+        }
+
+#if _LIBCPP_STD_VER > 11
+        template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        multiset(_InputIterator __f, _InputIterator __l, const allocator_type& __a)
+            : multiset(__f, __l, key_compare(), __a) {}
+#endif
+
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        multiset(_InputIterator __f, _InputIterator __l,
+                 const value_compare& __comp, const allocator_type& __a)
+        : __tree_(__comp, __a)
+        {
+            insert(__f, __l);
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    multiset(const multiset& __s)
+        : __tree_(__s.__tree_.value_comp(),
+          __alloc_traits::select_on_container_copy_construction(__s.__tree_.__alloc()))
+        {
+            insert(__s.begin(), __s.end());
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    multiset& operator=(const multiset& __s)
+        {
+            __tree_ = __s.__tree_;
+            return *this;
+        }
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    multiset(multiset&& __s)
+        _NOEXCEPT_(is_nothrow_move_constructible<__base>::value)
+        : __tree_(_VSTD::move(__s.__tree_)) {}
+
+    multiset(multiset&& __s, const allocator_type& __a);
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    explicit multiset(const allocator_type& __a)
+        : __tree_(__a) {}
+    _LIBCPP_INLINE_VISIBILITY
+    multiset(const multiset& __s, const allocator_type& __a)
+        : __tree_(__s.__tree_.value_comp(), __a)
+        {
+            insert(__s.begin(), __s.end());
+        }
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    multiset(initializer_list<value_type> __il, const value_compare& __comp = value_compare())
+        : __tree_(__comp)
+        {
+            insert(__il.begin(), __il.end());
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    multiset(initializer_list<value_type> __il, const value_compare& __comp,
+        const allocator_type& __a)
+        : __tree_(__comp, __a)
+        {
+            insert(__il.begin(), __il.end());
+        }
+
+#if _LIBCPP_STD_VER > 11
+    _LIBCPP_INLINE_VISIBILITY
+    multiset(initializer_list<value_type> __il, const allocator_type& __a)
+        : multiset(__il, key_compare(), __a) {}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    multiset& operator=(initializer_list<value_type> __il)
+        {
+            __tree_.__assign_multi(__il.begin(), __il.end());
+            return *this;
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    multiset& operator=(multiset&& __s)
+        _NOEXCEPT_(is_nothrow_move_assignable<__base>::value)
+        {
+            __tree_ = _VSTD::move(__s.__tree_);
+            return *this;
+        }
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~multiset() {
+        static_assert(sizeof(__diagnose_non_const_comparator<_Key, _Compare>()), "");
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+          iterator begin() _NOEXCEPT       {return __tree_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+          iterator end() _NOEXCEPT         {return __tree_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end()   const _NOEXCEPT {return __tree_.end();}
+
+    _LIBCPP_INLINE_VISIBILITY
+          reverse_iterator rbegin() _NOEXCEPT
+            {return reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator rbegin() const _NOEXCEPT
+        {return const_reverse_iterator(end());}
+    _LIBCPP_INLINE_VISIBILITY
+          reverse_iterator rend() _NOEXCEPT
+            {return       reverse_iterator(begin());}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator rend() const _NOEXCEPT
+        {return const_reverse_iterator(begin());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbegin()  const _NOEXCEPT {return begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cend() const _NOEXCEPT {return end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator crend() const _NOEXCEPT {return rend();}
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool empty() const _NOEXCEPT {return __tree_.size() == 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const _NOEXCEPT {return __tree_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT {return __tree_.max_size();}
+
+    // modifiers:
+#ifndef _LIBCPP_CXX03_LANG
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator emplace(_Args&&... __args)
+            {return __tree_.__emplace_multi(_VSTD::forward<_Args>(__args)...);}
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator emplace_hint(const_iterator __p, _Args&&... __args)
+            {return __tree_.__emplace_hint_multi(__p, _VSTD::forward<_Args>(__args)...);}
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const value_type& __v)
+        {return __tree_.__insert_multi(__v);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, const value_type& __v)
+        {return __tree_.__insert_multi(__p, __v);}
+
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        void insert(_InputIterator __f, _InputIterator __l)
+        {
+            for (const_iterator __e = cend(); __f != __l; ++__f)
+                __tree_.__insert_multi(__e, *__f);
+        }
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(value_type&& __v)
+        {return __tree_.__insert_multi(_VSTD::move(__v));}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, value_type&& __v)
+        {return __tree_.__insert_multi(__p, _VSTD::move(__v));}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void insert(initializer_list<value_type> __il)
+        {insert(__il.begin(), __il.end());}
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator  erase(const_iterator __p) {return __tree_.erase(__p);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type erase(const key_type& __k) {return __tree_.__erase_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator  erase(const_iterator __f, const_iterator __l)
+        {return __tree_.erase(__f, __l);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() _NOEXCEPT {__tree_.clear();}
+
+#if _LIBCPP_STD_VER > 14
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to multiset::insert()");
+        return __tree_.template __node_handle_insert_multi<node_type>(
+            _VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __hint, node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to multiset::insert()");
+        return __tree_.template __node_handle_insert_multi<node_type>(
+            __hint, _VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(key_type const& __key)
+    {
+        return __tree_.template __node_handle_extract<node_type>(__key);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(const_iterator __it)
+    {
+        return __tree_.template __node_handle_extract<node_type>(__it);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(multiset<key_type, _Compare2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __tree_.__node_handle_merge_multi(__source.__tree_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(multiset<key_type, _Compare2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __tree_.__node_handle_merge_multi(__source.__tree_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(set<key_type, _Compare2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __tree_.__node_handle_merge_multi(__source.__tree_);
+    }
+    template <class _Compare2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(set<key_type, _Compare2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __tree_.__node_handle_merge_multi(__source.__tree_);
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(multiset& __s)
+        _NOEXCEPT_(__is_nothrow_swappable<__base>::value)
+        {__tree_.swap(__s.__tree_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const _NOEXCEPT {return __tree_.__alloc();}
+    _LIBCPP_INLINE_VISIBILITY
+    key_compare    key_comp()      const {return __tree_.value_comp();}
+    _LIBCPP_INLINE_VISIBILITY
+    value_compare  value_comp()    const {return __tree_.value_comp();}
+
+    // set operations:
+    _LIBCPP_INLINE_VISIBILITY
+    iterator find(const key_type& __k)             {return __tree_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
+    find(const _K2& __k)                           {return __tree_.find(__k);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
+    find(const _K2& __k) const                     {return __tree_.find(__k);}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type      count(const key_type& __k) const
+        {return __tree_.__count_multi(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,size_type>::type
+    count(const _K2& __k) const            {return __tree_.__count_multi(__k);}
+#endif
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY
+    bool contains(const key_type& __k) const {return find(__k) != end();}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value, bool>::type
+    contains(const _K2& __k) const { return find(__k) != end(); }
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator lower_bound(const key_type& __k)
+        {return __tree_.lower_bound(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator lower_bound(const key_type& __k) const
+            {return __tree_.lower_bound(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
+    lower_bound(const _K2& __k)       {return __tree_.lower_bound(__k);}
+
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
+    lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator upper_bound(const key_type& __k)
+            {return __tree_.upper_bound(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator upper_bound(const key_type& __k) const
+            {return __tree_.upper_bound(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
+    upper_bound(const _K2& __k)       {return __tree_.upper_bound(__k);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
+    upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator,iterator>             equal_range(const key_type& __k)
+            {return __tree_.__equal_range_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
+            {return __tree_.__equal_range_multi(__k);}
+#if _LIBCPP_STD_VER > 11
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,pair<iterator,iterator>>::type
+    equal_range(const _K2& __k)       {return __tree_.__equal_range_multi(__k);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::type
+    equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}
+#endif
+};
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator,
+         class _Compare = less<__iter_value_type<_InputIterator>>,
+         class _Allocator = allocator<__iter_value_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value, void>,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>,
+         class = enable_if_t<!__is_allocator<_Compare>::value, void>>
+multiset(_InputIterator, _InputIterator, _Compare = _Compare(), _Allocator = _Allocator())
+  -> multiset<__iter_value_type<_InputIterator>, _Compare, _Allocator>;
+
+template<class _Key, class _Compare = less<_Key>,
+         class _Allocator = allocator<_Key>,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>,
+         class = enable_if_t<!__is_allocator<_Compare>::value, void>>
+multiset(initializer_list<_Key>, _Compare = _Compare(), _Allocator = _Allocator())
+  -> multiset<_Key, _Compare, _Allocator>;
+
+template<class _InputIterator, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value, void>,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+multiset(_InputIterator, _InputIterator, _Allocator)
+  -> multiset<__iter_value_type<_InputIterator>,
+         less<__iter_value_type<_InputIterator>>, _Allocator>;
+
+template<class _Key, class _Allocator,
+         class = enable_if_t<__is_allocator<_Allocator>::value, void>>
+multiset(initializer_list<_Key>, _Allocator)
+  -> multiset<_Key, less<_Key>, _Allocator>;
+#endif
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Compare, class _Allocator>
+multiset<_Key, _Compare, _Allocator>::multiset(multiset&& __s, const allocator_type& __a)
+    : __tree_(_VSTD::move(__s.__tree_), __a)
+{
+    if (__a != __s.get_allocator())
+    {
+        const_iterator __e = cend();
+        while (!__s.empty())
+            insert(__e, _VSTD::move(__s.__tree_.remove(__s.begin())->__value_));
+    }
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const multiset<_Key, _Compare, _Allocator>& __x,
+           const multiset<_Key, _Compare, _Allocator>& __y)
+{
+    return __x.size() == __y.size() && _VSTD::equal(__x.begin(), __x.end(), __y.begin());
+}
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator< (const multiset<_Key, _Compare, _Allocator>& __x,
+           const multiset<_Key, _Compare, _Allocator>& __y)
+{
+    return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
+}
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const multiset<_Key, _Compare, _Allocator>& __x,
+           const multiset<_Key, _Compare, _Allocator>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator> (const multiset<_Key, _Compare, _Allocator>& __x,
+           const multiset<_Key, _Compare, _Allocator>& __y)
+{
+    return __y < __x;
+}
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const multiset<_Key, _Compare, _Allocator>& __x,
+           const multiset<_Key, _Compare, _Allocator>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const multiset<_Key, _Compare, _Allocator>& __x,
+           const multiset<_Key, _Compare, _Allocator>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _Key, class _Compare, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(multiset<_Key, _Compare, _Allocator>& __x,
+     multiset<_Key, _Compare, _Allocator>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Key, class _Compare, class _Allocator, class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY
+    typename multiset<_Key, _Compare, _Allocator>::size_type
+    erase_if(multiset<_Key, _Compare, _Allocator>& __c, _Predicate __pred) {
+  return _VSTD::__libcpp_erase_if_container(__c, __pred);
+}
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+_LIBCPP_BEGIN_NAMESPACE_STD
+namespace pmr {
+template <class _KeyT, class _CompareT = std::less<_KeyT>>
+using set = std::set<_KeyT, _CompareT, polymorphic_allocator<_KeyT>>;
+
+template <class _KeyT, class _CompareT = std::less<_KeyT>>
+using multiset = std::multiset<_KeyT, _CompareT, polymorphic_allocator<_KeyT>>;
+} // namespace pmr
+_LIBCPP_END_NAMESPACE_STD
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <functional>
+#  include <iterator>
+#endif
+
+#endif // _LIBCPP_SET
diff --git a/app/src/main/cpp/libcxx/include/setjmp.h b/app/src/main/cpp/libcxx/include/setjmp.h
new file mode 100644
index 0000000..f4a2bbc
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/setjmp.h
@@ -0,0 +1,46 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_SETJMP_H
+#define _LIBCPP_SETJMP_H
+
+/*
+    setjmp.h synopsis
+
+Macros:
+
+    setjmp
+
+Types:
+
+    jmp_buf
+
+void longjmp(jmp_buf env, int val);
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if __has_include_next(<setjmp.h>)
+#  include_next <setjmp.h>
+#endif
+
+#ifdef __cplusplus
+
+#ifndef setjmp
+#define setjmp(env) setjmp(env)
+#endif
+
+#endif // __cplusplus
+
+#endif // _LIBCPP_SETJMP_H
diff --git a/app/src/main/cpp/libcxx/include/shared_mutex b/app/src/main/cpp/libcxx/include/shared_mutex
new file mode 100644
index 0000000..6919898
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/shared_mutex
@@ -0,0 +1,509 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_SHARED_MUTEX
+#define _LIBCPP_SHARED_MUTEX
+
+/*
+    shared_mutex synopsis
+
+// C++1y
+
+namespace std
+{
+
+class shared_mutex      // C++17
+{
+public:
+    shared_mutex();
+    ~shared_mutex();
+
+    shared_mutex(const shared_mutex&) = delete;
+    shared_mutex& operator=(const shared_mutex&) = delete;
+
+    // Exclusive ownership
+    void lock(); // blocking
+    bool try_lock();
+    void unlock();
+
+    // Shared ownership
+    void lock_shared(); // blocking
+    bool try_lock_shared();
+    void unlock_shared();
+
+    typedef implementation-defined native_handle_type; // See 30.2.3
+    native_handle_type native_handle(); // See 30.2.3
+};
+
+class shared_timed_mutex
+{
+public:
+    shared_timed_mutex();
+    ~shared_timed_mutex();
+
+    shared_timed_mutex(const shared_timed_mutex&) = delete;
+    shared_timed_mutex& operator=(const shared_timed_mutex&) = delete;
+
+    // Exclusive ownership
+    void lock(); // blocking
+    bool try_lock();
+    template <class Rep, class Period>
+        bool try_lock_for(const chrono::duration<Rep, Period>& rel_time);
+    template <class Clock, class Duration>
+        bool try_lock_until(const chrono::time_point<Clock, Duration>& abs_time);
+    void unlock();
+
+    // Shared ownership
+    void lock_shared(); // blocking
+    bool try_lock_shared();
+    template <class Rep, class Period>
+        bool
+        try_lock_shared_for(const chrono::duration<Rep, Period>& rel_time);
+    template <class Clock, class Duration>
+        bool
+        try_lock_shared_until(const chrono::time_point<Clock, Duration>& abs_time);
+    void unlock_shared();
+};
+
+template <class Mutex>
+class shared_lock
+{
+public:
+    typedef Mutex mutex_type;
+
+    // Shared locking
+    shared_lock() noexcept;
+    explicit shared_lock(mutex_type& m); // blocking
+    shared_lock(mutex_type& m, defer_lock_t) noexcept;
+    shared_lock(mutex_type& m, try_to_lock_t);
+    shared_lock(mutex_type& m, adopt_lock_t);
+    template <class Clock, class Duration>
+        shared_lock(mutex_type& m,
+                    const chrono::time_point<Clock, Duration>& abs_time);
+    template <class Rep, class Period>
+        shared_lock(mutex_type& m,
+                    const chrono::duration<Rep, Period>& rel_time);
+    ~shared_lock();
+
+    shared_lock(shared_lock const&) = delete;
+    shared_lock& operator=(shared_lock const&) = delete;
+
+    shared_lock(shared_lock&& u) noexcept;
+    shared_lock& operator=(shared_lock&& u) noexcept;
+
+    void lock(); // blocking
+    bool try_lock();
+    template <class Rep, class Period>
+        bool try_lock_for(const chrono::duration<Rep, Period>& rel_time);
+    template <class Clock, class Duration>
+        bool try_lock_until(const chrono::time_point<Clock, Duration>& abs_time);
+    void unlock();
+
+    // Setters
+    void swap(shared_lock& u) noexcept;
+    mutex_type* release() noexcept;
+
+    // Getters
+    bool owns_lock() const noexcept;
+    explicit operator bool () const noexcept;
+    mutex_type* mutex() const noexcept;
+};
+
+template <class Mutex>
+    void swap(shared_lock<Mutex>& x, shared_lock<Mutex>& y) noexcept;
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__config>
+#include <version>
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+#if _LIBCPP_STD_VER > 11 || defined(_LIBCPP_BUILDING_LIBRARY)
+
+#include <__mutex_base>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifdef _LIBCPP_HAS_NO_THREADS
+# error "<shared_mutex> is not supported since libc++ has been configured without support for threads."
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+struct _LIBCPP_TYPE_VIS _LIBCPP_AVAILABILITY_SHARED_MUTEX _LIBCPP_THREAD_SAFETY_ANNOTATION(capability("shared_mutex"))
+__shared_mutex_base
+{
+    mutex               __mut_;
+    condition_variable  __gate1_;
+    condition_variable  __gate2_;
+    unsigned            __state_;
+
+    static const unsigned __write_entered_ = 1U << (sizeof(unsigned)*__CHAR_BIT__ - 1);
+    static const unsigned __n_readers_ = ~__write_entered_;
+
+    __shared_mutex_base();
+    _LIBCPP_INLINE_VISIBILITY ~__shared_mutex_base() = default;
+
+    __shared_mutex_base(const __shared_mutex_base&) = delete;
+    __shared_mutex_base& operator=(const __shared_mutex_base&) = delete;
+
+    // Exclusive ownership
+    void lock() _LIBCPP_THREAD_SAFETY_ANNOTATION(acquire_capability()); // blocking
+    bool try_lock() _LIBCPP_THREAD_SAFETY_ANNOTATION(try_acquire_capability(true));
+    void unlock() _LIBCPP_THREAD_SAFETY_ANNOTATION(release_capability());
+
+    // Shared ownership
+    void lock_shared() _LIBCPP_THREAD_SAFETY_ANNOTATION(acquire_shared_capability()); // blocking
+    bool try_lock_shared() _LIBCPP_THREAD_SAFETY_ANNOTATION(try_acquire_shared_capability(true));
+    void unlock_shared() _LIBCPP_THREAD_SAFETY_ANNOTATION(release_shared_capability());
+
+//     typedef implementation-defined native_handle_type; // See 30.2.3
+//     native_handle_type native_handle(); // See 30.2.3
+};
+
+
+#if _LIBCPP_STD_VER > 14
+class _LIBCPP_TYPE_VIS _LIBCPP_AVAILABILITY_SHARED_MUTEX shared_mutex
+{
+    __shared_mutex_base __base_;
+public:
+    _LIBCPP_INLINE_VISIBILITY shared_mutex() : __base_() {}
+    _LIBCPP_INLINE_VISIBILITY ~shared_mutex() = default;
+
+    shared_mutex(const shared_mutex&) = delete;
+    shared_mutex& operator=(const shared_mutex&) = delete;
+
+    // Exclusive ownership
+    _LIBCPP_INLINE_VISIBILITY void lock()     { return __base_.lock(); }
+    _LIBCPP_INLINE_VISIBILITY bool try_lock() { return __base_.try_lock(); }
+    _LIBCPP_INLINE_VISIBILITY void unlock()   { return __base_.unlock(); }
+
+    // Shared ownership
+    _LIBCPP_INLINE_VISIBILITY void lock_shared()     { return __base_.lock_shared(); }
+    _LIBCPP_INLINE_VISIBILITY bool try_lock_shared() { return __base_.try_lock_shared(); }
+    _LIBCPP_INLINE_VISIBILITY void unlock_shared()   { return __base_.unlock_shared(); }
+
+//     typedef __shared_mutex_base::native_handle_type native_handle_type;
+//     _LIBCPP_INLINE_VISIBILITY native_handle_type native_handle() { return __base::unlock_shared(); }
+};
+#endif
+
+
+class _LIBCPP_TYPE_VIS _LIBCPP_AVAILABILITY_SHARED_MUTEX shared_timed_mutex
+{
+    __shared_mutex_base __base_;
+public:
+    shared_timed_mutex();
+    _LIBCPP_INLINE_VISIBILITY ~shared_timed_mutex() = default;
+
+    shared_timed_mutex(const shared_timed_mutex&) = delete;
+    shared_timed_mutex& operator=(const shared_timed_mutex&) = delete;
+
+    // Exclusive ownership
+    void lock();
+    bool try_lock();
+    template <class _Rep, class _Period>
+        _LIBCPP_INLINE_VISIBILITY
+        bool
+        try_lock_for(const chrono::duration<_Rep, _Period>& __rel_time)
+        {
+            return try_lock_until(chrono::steady_clock::now() + __rel_time);
+        }
+    template <class _Clock, class _Duration>
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        bool
+        try_lock_until(const chrono::time_point<_Clock, _Duration>& __abs_time);
+    void unlock();
+
+    // Shared ownership
+    void lock_shared();
+    bool try_lock_shared();
+    template <class _Rep, class _Period>
+        _LIBCPP_INLINE_VISIBILITY
+        bool
+        try_lock_shared_for(const chrono::duration<_Rep, _Period>& __rel_time)
+        {
+            return try_lock_shared_until(chrono::steady_clock::now() + __rel_time);
+        }
+    template <class _Clock, class _Duration>
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        bool
+        try_lock_shared_until(const chrono::time_point<_Clock, _Duration>& __abs_time);
+    void unlock_shared();
+};
+
+template <class _Clock, class _Duration>
+bool
+shared_timed_mutex::try_lock_until(
+                        const chrono::time_point<_Clock, _Duration>& __abs_time)
+{
+    unique_lock<mutex> __lk(__base_.__mut_);
+    if (__base_.__state_ & __base_.__write_entered_)
+    {
+        while (true)
+        {
+            cv_status __status = __base_.__gate1_.wait_until(__lk, __abs_time);
+            if ((__base_.__state_ & __base_.__write_entered_) == 0)
+                break;
+            if (__status == cv_status::timeout)
+                return false;
+        }
+    }
+    __base_.__state_ |= __base_.__write_entered_;
+    if (__base_.__state_ & __base_.__n_readers_)
+    {
+        while (true)
+        {
+            cv_status __status = __base_.__gate2_.wait_until(__lk, __abs_time);
+            if ((__base_.__state_ & __base_.__n_readers_) == 0)
+                break;
+            if (__status == cv_status::timeout)
+            {
+                __base_.__state_ &= ~__base_.__write_entered_;
+                __base_.__gate1_.notify_all();
+                return false;
+            }
+        }
+    }
+    return true;
+}
+
+template <class _Clock, class _Duration>
+bool
+shared_timed_mutex::try_lock_shared_until(
+                        const chrono::time_point<_Clock, _Duration>& __abs_time)
+{
+    unique_lock<mutex> __lk(__base_.__mut_);
+    if ((__base_.__state_ & __base_.__write_entered_) || (__base_.__state_ & __base_.__n_readers_) == __base_.__n_readers_)
+    {
+        while (true)
+        {
+            cv_status status = __base_.__gate1_.wait_until(__lk, __abs_time);
+            if ((__base_.__state_ & __base_.__write_entered_) == 0 &&
+                                       (__base_.__state_ & __base_.__n_readers_) < __base_.__n_readers_)
+                break;
+            if (status == cv_status::timeout)
+                return false;
+        }
+    }
+    unsigned __num_readers = (__base_.__state_ & __base_.__n_readers_) + 1;
+    __base_.__state_ &= ~__base_.__n_readers_;
+    __base_.__state_ |= __num_readers;
+    return true;
+}
+
+template <class _Mutex>
+class shared_lock
+{
+public:
+    typedef _Mutex mutex_type;
+
+private:
+    mutex_type* __m_;
+    bool __owns_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    shared_lock() _NOEXCEPT
+        : __m_(nullptr),
+          __owns_(false)
+        {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit shared_lock(mutex_type& __m)
+        : __m_(_VSTD::addressof(__m)),
+          __owns_(true)
+        {__m_->lock_shared();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    shared_lock(mutex_type& __m, defer_lock_t) _NOEXCEPT
+        : __m_(_VSTD::addressof(__m)),
+          __owns_(false)
+        {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    shared_lock(mutex_type& __m, try_to_lock_t)
+        : __m_(_VSTD::addressof(__m)),
+          __owns_(__m.try_lock_shared())
+        {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    shared_lock(mutex_type& __m, adopt_lock_t)
+        : __m_(_VSTD::addressof(__m)),
+          __owns_(true)
+        {}
+
+    template <class _Clock, class _Duration>
+        _LIBCPP_INLINE_VISIBILITY
+        shared_lock(mutex_type& __m,
+                    const chrono::time_point<_Clock, _Duration>& __abs_time)
+            : __m_(_VSTD::addressof(__m)),
+              __owns_(__m.try_lock_shared_until(__abs_time))
+            {}
+
+    template <class _Rep, class _Period>
+        _LIBCPP_INLINE_VISIBILITY
+        shared_lock(mutex_type& __m,
+                    const chrono::duration<_Rep, _Period>& __rel_time)
+            : __m_(_VSTD::addressof(__m)),
+              __owns_(__m.try_lock_shared_for(__rel_time))
+            {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    ~shared_lock()
+    {
+        if (__owns_)
+            __m_->unlock_shared();
+    }
+
+    shared_lock(shared_lock const&) = delete;
+    shared_lock& operator=(shared_lock const&) = delete;
+
+    _LIBCPP_INLINE_VISIBILITY
+    shared_lock(shared_lock&& __u) _NOEXCEPT
+        : __m_(__u.__m_),
+          __owns_(__u.__owns_)
+        {
+            __u.__m_ = nullptr;
+            __u.__owns_ = false;
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    shared_lock& operator=(shared_lock&& __u) _NOEXCEPT
+    {
+        if (__owns_)
+            __m_->unlock_shared();
+        __m_ = nullptr;
+        __owns_ = false;
+        __m_ = __u.__m_;
+        __owns_ = __u.__owns_;
+        __u.__m_ = nullptr;
+        __u.__owns_ = false;
+        return *this;
+    }
+
+    void lock();
+    bool try_lock();
+    template <class Rep, class Period>
+        bool try_lock_for(const chrono::duration<Rep, Period>& __rel_time);
+    template <class Clock, class Duration>
+        bool try_lock_until(const chrono::time_point<Clock, Duration>& __abs_time);
+    void unlock();
+
+    // Setters
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(shared_lock& __u) _NOEXCEPT
+    {
+        _VSTD::swap(__m_, __u.__m_);
+        _VSTD::swap(__owns_, __u.__owns_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    mutex_type* release() _NOEXCEPT
+    {
+        mutex_type* __m = __m_;
+        __m_ = nullptr;
+        __owns_ = false;
+        return __m;
+    }
+
+    // Getters
+    _LIBCPP_INLINE_VISIBILITY
+    bool owns_lock() const _NOEXCEPT {return __owns_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit operator bool () const _NOEXCEPT {return __owns_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    mutex_type* mutex() const _NOEXCEPT {return __m_;}
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(shared_lock);
+
+template <class _Mutex>
+void
+shared_lock<_Mutex>::lock()
+{
+    if (__m_ == nullptr)
+        __throw_system_error(EPERM, "shared_lock::lock: references null mutex");
+    if (__owns_)
+        __throw_system_error(EDEADLK, "shared_lock::lock: already locked");
+    __m_->lock_shared();
+    __owns_ = true;
+}
+
+template <class _Mutex>
+bool
+shared_lock<_Mutex>::try_lock()
+{
+    if (__m_ == nullptr)
+        __throw_system_error(EPERM, "shared_lock::try_lock: references null mutex");
+    if (__owns_)
+        __throw_system_error(EDEADLK, "shared_lock::try_lock: already locked");
+    __owns_ = __m_->try_lock_shared();
+    return __owns_;
+}
+
+template <class _Mutex>
+template <class _Rep, class _Period>
+bool
+shared_lock<_Mutex>::try_lock_for(const chrono::duration<_Rep, _Period>& __d)
+{
+    if (__m_ == nullptr)
+        __throw_system_error(EPERM, "shared_lock::try_lock_for: references null mutex");
+    if (__owns_)
+        __throw_system_error(EDEADLK, "shared_lock::try_lock_for: already locked");
+    __owns_ = __m_->try_lock_shared_for(__d);
+    return __owns_;
+}
+
+template <class _Mutex>
+template <class _Clock, class _Duration>
+bool
+shared_lock<_Mutex>::try_lock_until(const chrono::time_point<_Clock, _Duration>& __t)
+{
+    if (__m_ == nullptr)
+        __throw_system_error(EPERM, "shared_lock::try_lock_until: references null mutex");
+    if (__owns_)
+        __throw_system_error(EDEADLK, "shared_lock::try_lock_until: already locked");
+    __owns_ = __m_->try_lock_shared_until(__t);
+    return __owns_;
+}
+
+template <class _Mutex>
+void
+shared_lock<_Mutex>::unlock()
+{
+    if (!__owns_)
+        __throw_system_error(EPERM, "shared_lock::unlock: not locked");
+    __m_->unlock_shared();
+    __owns_ = false;
+}
+
+template <class _Mutex>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(shared_lock<_Mutex>& __x, shared_lock<_Mutex>& __y) _NOEXCEPT
+    {__x.swap(__y);}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STD_VER > 11
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP_SHARED_MUTEX
diff --git a/app/src/main/cpp/libcxx/include/source_location b/app/src/main/cpp/libcxx/include/source_location
new file mode 100644
index 0000000..4c4a096
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/source_location
@@ -0,0 +1,85 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_SOURCE_LOCATION
+#define _LIBCPP_SOURCE_LOCATION
+
+/* source_location synopsis
+
+namespace std {
+  struct source_location {
+    static consteval source_location current() noexcept;
+    constexpr source_location() noexcept;
+
+    constexpr uint_least32_t line() const noexcept;
+    constexpr uint_least32_t column() const noexcept;
+    constexpr const char* file_name() const noexcept;
+    constexpr const char* function_name() const noexcept;
+  };
+}
+*/
+
+#include <__config>
+#include <cstdint>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER >= 20 && __has_builtin(__builtin_source_location)
+
+class source_location {
+  // The names source_location::__impl, _M_file_name, _M_function_name, _M_line, and _M_column
+  // are hard-coded in the compiler and must not be changed here.
+  struct __impl {
+    const char* _M_file_name;
+    const char* _M_function_name;
+    unsigned _M_line;
+    unsigned _M_column;
+  };
+  const __impl* __ptr_ = nullptr;
+  // GCC returns the type 'const void*' from the builtin, while clang returns
+  // `const __impl*`. Per C++ [expr.const], casts from void* are not permitted
+  // in constant evaluation, so we don't want to use `void*` as the argument
+  // type unless the builtin returned that, anyhow, and the invalid cast is
+  // unavoidable.
+  using __bsl_ty = decltype(__builtin_source_location());
+
+public:
+  // The defaulted __ptr argument is necessary so that the builtin is evaluated
+  // in the context of the caller. An explicit value should never be provided.
+  static consteval source_location current(__bsl_ty __ptr = __builtin_source_location()) noexcept {
+    source_location __sl;
+    __sl.__ptr_ = static_cast<const __impl*>(__ptr);
+    return __sl;
+  }
+  _LIBCPP_HIDE_FROM_ABI constexpr source_location() noexcept = default;
+
+  _LIBCPP_HIDE_FROM_ABI constexpr uint_least32_t line() const noexcept {
+    return __ptr_ != nullptr ? __ptr_->_M_line : 0;
+  }
+  _LIBCPP_HIDE_FROM_ABI constexpr uint_least32_t column() const noexcept {
+    return __ptr_ != nullptr ? __ptr_->_M_column : 0;
+  }
+  _LIBCPP_HIDE_FROM_ABI constexpr const char* file_name() const noexcept {
+    return __ptr_ != nullptr ? __ptr_->_M_file_name : "";
+  }
+  _LIBCPP_HIDE_FROM_ABI constexpr const char* function_name() const noexcept {
+    return __ptr_ != nullptr ? __ptr_->_M_function_name : "";
+  }
+};
+
+#endif // _LIBCPP_STD_VER >= 20 && __has_builtin(__builtin_source_location)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_SOURCE_LOCATION
diff --git a/app/src/main/cpp/libcxx/include/span b/app/src/main/cpp/libcxx/include/span
new file mode 100644
index 0000000..23af04f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/span
@@ -0,0 +1,598 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===---------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_SPAN
+#define _LIBCPP_SPAN
+
+/*
+    span synopsis
+
+namespace std {
+
+// constants
+inline constexpr size_t dynamic_extent = numeric_limits<size_t>::max();
+
+// [views.span], class template span
+template <class ElementType, size_t Extent = dynamic_extent>
+    class span;
+
+template<class ElementType, size_t Extent>
+  inline constexpr bool ranges::enable_view<span<ElementType, Extent>> = true;
+
+template<class ElementType, size_t Extent>
+    inline constexpr bool ranges::enable_borrowed_range<span<ElementType, Extent>> = true;
+
+// [span.objectrep], views of object representation
+template <class ElementType, size_t Extent>
+    span<const byte, ((Extent == dynamic_extent) ? dynamic_extent :
+        (sizeof(ElementType) * Extent))> as_bytes(span<ElementType, Extent> s) noexcept;
+
+template <class ElementType, size_t Extent>
+    span<      byte, ((Extent == dynamic_extent) ? dynamic_extent :
+        (sizeof(ElementType) * Extent))> as_writable_bytes(span<ElementType, Extent> s) noexcept;
+
+
+template <class ElementType, size_t Extent = dynamic_extent>
+class span {
+public:
+    // constants and types
+    using element_type = ElementType;
+    using value_type = remove_cv_t<ElementType>;
+    using size_type = size_t;
+    using difference_type = ptrdiff_t;
+    using pointer = element_type*;
+    using const_pointer = const element_type*;
+    using reference = element_type&;
+    using const_reference = const element_type&;
+    using iterator = implementation-defined;
+    using reverse_iterator = std::reverse_iterator<iterator>;
+    static constexpr size_type extent = Extent;
+
+    // [span.cons], span constructors, copy, assignment, and destructor
+    constexpr span() noexcept;
+    template <class It>
+    constexpr explicit(Extent != dynamic_extent) span(It first, size_type count);
+    template <class It, class End>
+    constexpr explicit(Extent != dynamic_extent) span(It first, End last);
+    template <size_t N>
+        constexpr span(type_identity_t<element_type> (&arr)[N]) noexcept;
+    template <size_t N>
+        constexpr span(array<value_type, N>& arr) noexcept;
+    template <size_t N>
+        constexpr span(const array<value_type, N>& arr) noexcept;
+    template<class R>
+      constexpr explicit(Extent != dynamic_extent) span(R&& r);
+    constexpr span(const span& other) noexcept = default;
+    template <class OtherElementType, size_t OtherExtent>
+        constexpr explicit(Extent != dynamic_extent) span(const span<OtherElementType, OtherExtent>& s) noexcept;
+    ~span() noexcept = default;
+    constexpr span& operator=(const span& other) noexcept = default;
+
+    // [span.sub], span subviews
+    template <size_t Count>
+        constexpr span<element_type, Count> first() const;
+    template <size_t Count>
+        constexpr span<element_type, Count> last() const;
+    template <size_t Offset, size_t Count = dynamic_extent>
+        constexpr span<element_type, see below> subspan() const;
+
+    constexpr span<element_type, dynamic_extent> first(size_type count) const;
+    constexpr span<element_type, dynamic_extent> last(size_type count) const;
+    constexpr span<element_type, dynamic_extent> subspan(size_type offset, size_type count = dynamic_extent) const;
+
+    // [span.obs], span observers
+    constexpr size_type size() const noexcept;
+    constexpr size_type size_bytes() const noexcept;
+    [[nodiscard]] constexpr bool empty() const noexcept;
+
+    // [span.elem], span element access
+    constexpr reference operator[](size_type idx) const;
+    constexpr reference front() const;
+    constexpr reference back() const;
+    constexpr pointer data() const noexcept;
+
+    // [span.iterators], span iterator support
+    constexpr iterator begin() const noexcept;
+    constexpr iterator end() const noexcept;
+    constexpr reverse_iterator rbegin() const noexcept;
+    constexpr reverse_iterator rend() const noexcept;
+
+private:
+    pointer data_;    // exposition only
+    size_type size_;  // exposition only
+};
+
+template<class It, class EndOrSize>
+    span(It, EndOrSize) -> span<remove_reference_t<iter_reference_t<_It>>>;
+
+template<class T, size_t N>
+    span(T (&)[N]) -> span<T, N>;
+
+template<class T, size_t N>
+    span(array<T, N>&) -> span<T, N>;
+
+template<class T, size_t N>
+    span(const array<T, N>&) -> span<const T, N>;
+
+template<class R>
+    span(R&&) -> span<remove_reference_t<ranges::range_reference_t<R>>>;
+
+} // namespace std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__debug>
+#include <__fwd/span.h>
+#include <__iterator/bounded_iter.h>
+#include <__iterator/concepts.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/wrap_iter.h>
+#include <__memory/pointer_traits.h>
+#include <__ranges/concepts.h>
+#include <__ranges/data.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/enable_view.h>
+#include <__ranges/size.h>
+#include <__utility/forward.h>
+#include <array>        // for array
+#include <cstddef>      // for byte
+#include <limits>
+#include <type_traits>  // for remove_cv, etc
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _Tp>
+struct __is_std_array : false_type {};
+
+template <class _Tp, size_t _Sz>
+struct __is_std_array<array<_Tp, _Sz>> : true_type {};
+
+template <class _Tp>
+struct __is_std_span : false_type {};
+
+template <class _Tp, size_t _Sz>
+struct __is_std_span<span<_Tp, _Sz>> : true_type {};
+
+template <class _Range, class _ElementType>
+concept __span_compatible_range =
+  ranges::contiguous_range<_Range> &&
+  ranges::sized_range<_Range> &&
+  (ranges::borrowed_range<_Range> || is_const_v<_ElementType>) &&
+  !__is_std_span<remove_cvref_t<_Range>>::value  &&
+  !__is_std_array<remove_cvref_t<_Range>>::value &&
+  !is_array_v<remove_cvref_t<_Range>> &&
+  is_convertible_v<remove_reference_t<ranges::range_reference_t<_Range>>(*)[], _ElementType(*)[]>;
+
+template <class _From, class _To>
+concept __span_array_convertible = is_convertible_v<_From(*)[], _To(*)[]>;
+
+template <class _It, class _Tp>
+concept __span_compatible_iterator = contiguous_iterator<_It> && __span_array_convertible<remove_reference_t<iter_reference_t<_It>>, _Tp>;
+
+template <class _Sentinel, class _It>
+concept __span_compatible_sentinel_for = sized_sentinel_for<_Sentinel, _It> && !is_convertible_v<_Sentinel, size_t>;
+
+template <typename _Tp, size_t _Extent>
+class _LIBCPP_TEMPLATE_VIS span {
+public:
+//  constants and types
+    using element_type           = _Tp;
+    using value_type             = remove_cv_t<_Tp>;
+    using size_type              = size_t;
+    using difference_type        = ptrdiff_t;
+    using pointer                = _Tp *;
+    using const_pointer          = const _Tp *;
+    using reference              = _Tp &;
+    using const_reference        = const _Tp &;
+#ifdef _LIBCPP_DEBUG_ITERATOR_BOUNDS_CHECKING
+    using iterator               = __bounded_iter<pointer>;
+#else
+    using iterator               = __wrap_iter<pointer>;
+#endif
+    using reverse_iterator       = _VSTD::reverse_iterator<iterator>;
+
+    static constexpr size_type extent = _Extent;
+
+// [span.cons], span constructors, copy, assignment, and destructor
+    template <size_t _Sz = _Extent> requires(_Sz == 0)
+    _LIBCPP_INLINE_VISIBILITY constexpr span() noexcept : __data_{nullptr} {}
+
+    constexpr span           (const span&) noexcept = default;
+    constexpr span& operator=(const span&) noexcept = default;
+
+    template <__span_compatible_iterator<element_type> _It>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit span(_It __first, size_type __count)
+        : __data_{_VSTD::to_address(__first)} {
+      (void)__count;
+      _LIBCPP_ASSERT(_Extent == __count, "size mismatch in span's constructor (iterator, len)");
+    }
+
+    template <__span_compatible_iterator<element_type> _It, __span_compatible_sentinel_for<_It> _End>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit span(_It __first, _End __last) : __data_{_VSTD::to_address(__first)} {
+      (void)__last;
+      _LIBCPP_ASSERT((__last - __first >= 0), "invalid range in span's constructor (iterator, sentinel)");
+      _LIBCPP_ASSERT(__last - __first == _Extent,
+                     "invalid range in span's constructor (iterator, sentinel): last - first != extent");
+    }
+
+    _LIBCPP_INLINE_VISIBILITY constexpr span(type_identity_t<element_type> (&__arr)[_Extent]) noexcept : __data_{__arr} {}
+
+    template <__span_array_convertible<element_type> _OtherElementType>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span(array<_OtherElementType, _Extent>& __arr) noexcept : __data_{__arr.data()} {}
+
+    template <class _OtherElementType>
+        requires __span_array_convertible<const _OtherElementType, element_type>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span(const array<_OtherElementType, _Extent>& __arr) noexcept : __data_{__arr.data()} {}
+
+    template <__span_compatible_range<element_type> _Range>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr explicit span(_Range&& __r) : __data_{ranges::data(__r)} {
+      _LIBCPP_ASSERT(ranges::size(__r) == _Extent, "size mismatch in span's constructor (range)");
+    }
+
+    template <__span_array_convertible<element_type> _OtherElementType>
+    _LIBCPP_INLINE_VISIBILITY
+        constexpr span(const span<_OtherElementType, _Extent>& __other)
+        : __data_{__other.data()} {}
+
+    template <__span_array_convertible<element_type> _OtherElementType>
+    _LIBCPP_INLINE_VISIBILITY
+        constexpr explicit span(const span<_OtherElementType, dynamic_extent>& __other) noexcept
+        : __data_{__other.data()} { _LIBCPP_ASSERT(_Extent == __other.size(), "size mismatch in span's constructor (other span)"); }
+
+
+//  ~span() noexcept = default;
+
+    template <size_t _Count>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span<element_type, _Count> first() const noexcept
+    {
+        static_assert(_Count <= _Extent, "span<T, N>::first<Count>(): Count out of range");
+        return span<element_type, _Count>{data(), _Count};
+    }
+
+    template <size_t _Count>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span<element_type, _Count> last() const noexcept
+    {
+        static_assert(_Count <= _Extent, "span<T, N>::last<Count>(): Count out of range");
+        return span<element_type, _Count>{data() + size() - _Count, _Count};
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span<element_type, dynamic_extent> first(size_type __count) const noexcept
+    {
+        _LIBCPP_ASSERT(__count <= size(), "span<T, N>::first(count): count out of range");
+        return {data(), __count};
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span<element_type, dynamic_extent> last(size_type __count) const noexcept
+    {
+        _LIBCPP_ASSERT(__count <= size(), "span<T, N>::last(count): count out of range");
+        return {data() + size() - __count, __count};
+    }
+
+    template <size_t _Offset, size_t _Count = dynamic_extent>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr auto subspan() const noexcept
+        -> span<element_type, _Count != dynamic_extent ? _Count : _Extent - _Offset>
+    {
+        static_assert(_Offset <= _Extent, "span<T, N>::subspan<Offset, Count>(): Offset out of range");
+        static_assert(_Count == dynamic_extent || _Count <= _Extent - _Offset, "span<T, N>::subspan<Offset, Count>(): Offset + Count out of range");
+
+        using _ReturnType = span<element_type, _Count != dynamic_extent ? _Count : _Extent - _Offset>;
+        return _ReturnType{data() + _Offset, _Count == dynamic_extent ? size() - _Offset : _Count};
+    }
+
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span<element_type, dynamic_extent>
+       subspan(size_type __offset, size_type __count = dynamic_extent) const noexcept
+    {
+        _LIBCPP_ASSERT(__offset <= size(), "span<T, N>::subspan(offset, count): offset out of range");
+        _LIBCPP_ASSERT(__count  <= size() || __count == dynamic_extent, "span<T, N>::subspan(offset, count): count out of range");
+        if (__count == dynamic_extent)
+            return {data() + __offset, size() - __offset};
+        _LIBCPP_ASSERT(__count <= size() - __offset, "span<T, N>::subspan(offset, count): offset + count out of range");
+        return {data() + __offset, __count};
+    }
+
+    _LIBCPP_INLINE_VISIBILITY constexpr size_type size()           const noexcept { return _Extent; }
+    _LIBCPP_INLINE_VISIBILITY constexpr size_type size_bytes()     const noexcept { return _Extent * sizeof(element_type); }
+    [[nodiscard]] _LIBCPP_INLINE_VISIBILITY constexpr bool empty() const noexcept { return _Extent == 0; }
+
+    _LIBCPP_INLINE_VISIBILITY constexpr reference operator[](size_type __idx) const noexcept
+    {
+        _LIBCPP_ASSERT(__idx < size(), "span<T, N>::operator[](index): index out of range");
+        return __data_[__idx];
+    }
+
+    _LIBCPP_INLINE_VISIBILITY constexpr reference front() const noexcept
+    {
+        _LIBCPP_ASSERT(!empty(), "span<T, N>::front() on empty span");
+        return __data_[0];
+    }
+
+    _LIBCPP_INLINE_VISIBILITY constexpr reference back() const noexcept
+    {
+        _LIBCPP_ASSERT(!empty(), "span<T, N>::back() on empty span");
+        return __data_[size()-1];
+    }
+
+    _LIBCPP_INLINE_VISIBILITY constexpr pointer data()                         const noexcept { return __data_; }
+
+// [span.iter], span iterator support
+    _LIBCPP_INLINE_VISIBILITY constexpr iterator begin() const noexcept {
+#ifdef _LIBCPP_DEBUG_ITERATOR_BOUNDS_CHECKING
+        return std::__make_bounded_iter(data(), data(), data() + size());
+#else
+        return iterator(this, data());
+#endif
+    }
+    _LIBCPP_INLINE_VISIBILITY constexpr iterator end() const noexcept {
+#ifdef _LIBCPP_DEBUG_ITERATOR_BOUNDS_CHECKING
+        return std::__make_bounded_iter(data() + size(), data(), data() + size());
+#else
+        return iterator(this, data() + size());
+#endif
+    }
+    _LIBCPP_INLINE_VISIBILITY constexpr reverse_iterator        rbegin() const noexcept { return reverse_iterator(end()); }
+    _LIBCPP_INLINE_VISIBILITY constexpr reverse_iterator          rend() const noexcept { return reverse_iterator(begin()); }
+
+    _LIBCPP_INLINE_VISIBILITY span<const byte, _Extent * sizeof(element_type)> __as_bytes() const noexcept
+    { return span<const byte, _Extent * sizeof(element_type)>{reinterpret_cast<const byte *>(data()), size_bytes()}; }
+
+    _LIBCPP_INLINE_VISIBILITY span<byte, _Extent * sizeof(element_type)> __as_writable_bytes() const noexcept
+    { return span<byte, _Extent * sizeof(element_type)>{reinterpret_cast<byte *>(data()), size_bytes()}; }
+
+private:
+    pointer    __data_;
+};
+
+
+template <typename _Tp>
+class _LIBCPP_TEMPLATE_VIS span<_Tp, dynamic_extent> {
+public:
+//  constants and types
+    using element_type           = _Tp;
+    using value_type             = remove_cv_t<_Tp>;
+    using size_type              = size_t;
+    using difference_type        = ptrdiff_t;
+    using pointer                = _Tp *;
+    using const_pointer          = const _Tp *;
+    using reference              = _Tp &;
+    using const_reference        = const _Tp &;
+#ifdef _LIBCPP_DEBUG_ITERATOR_BOUNDS_CHECKING
+    using iterator               = __bounded_iter<pointer>;
+#else
+    using iterator               = __wrap_iter<pointer>;
+#endif
+    using reverse_iterator       = _VSTD::reverse_iterator<iterator>;
+
+    static constexpr size_type extent = dynamic_extent;
+
+// [span.cons], span constructors, copy, assignment, and destructor
+    _LIBCPP_INLINE_VISIBILITY constexpr span() noexcept : __data_{nullptr}, __size_{0} {}
+
+    constexpr span           (const span&) noexcept = default;
+    constexpr span& operator=(const span&) noexcept = default;
+
+    template <__span_compatible_iterator<element_type> _It>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span(_It __first, size_type __count)
+        : __data_{_VSTD::to_address(__first)}, __size_{__count} {}
+
+    template <__span_compatible_iterator<element_type> _It, __span_compatible_sentinel_for<_It> _End>
+    _LIBCPP_INLINE_VISIBILITY constexpr span(_It __first, _End __last)
+        : __data_(_VSTD::to_address(__first)), __size_(__last - __first) {
+      _LIBCPP_ASSERT(__last - __first >= 0, "invalid range in span's constructor (iterator, sentinel)");
+    }
+
+    template <size_t _Sz>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span(type_identity_t<element_type> (&__arr)[_Sz]) noexcept : __data_{__arr}, __size_{_Sz} {}
+
+    template <__span_array_convertible<element_type> _OtherElementType, size_t _Sz>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span(array<_OtherElementType, _Sz>& __arr) noexcept : __data_{__arr.data()}, __size_{_Sz} {}
+
+    template <class _OtherElementType, size_t _Sz>
+        requires __span_array_convertible<const _OtherElementType, element_type>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span(const array<_OtherElementType, _Sz>& __arr) noexcept : __data_{__arr.data()}, __size_{_Sz} {}
+
+    template <__span_compatible_range<element_type> _Range>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span(_Range&& __r) : __data_(ranges::data(__r)), __size_{ranges::size(__r)} {}
+
+    template <__span_array_convertible<element_type> _OtherElementType, size_t _OtherExtent>
+    _LIBCPP_INLINE_VISIBILITY
+        constexpr span(const span<_OtherElementType, _OtherExtent>& __other)  noexcept
+        : __data_{__other.data()}, __size_{__other.size()} {}
+
+//    ~span() noexcept = default;
+
+    template <size_t _Count>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span<element_type, _Count> first() const noexcept
+    {
+        _LIBCPP_ASSERT(_Count <= size(), "span<T>::first<Count>(): Count out of range");
+        return span<element_type, _Count>{data(), _Count};
+    }
+
+    template <size_t _Count>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span<element_type, _Count> last() const noexcept
+    {
+        _LIBCPP_ASSERT(_Count <= size(), "span<T>::last<Count>(): Count out of range");
+        return span<element_type, _Count>{data() + size() - _Count, _Count};
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span<element_type, dynamic_extent> first(size_type __count) const noexcept
+    {
+        _LIBCPP_ASSERT(__count <= size(), "span<T>::first(count): count out of range");
+        return {data(), __count};
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span<element_type, dynamic_extent> last (size_type __count) const noexcept
+    {
+        _LIBCPP_ASSERT(__count <= size(), "span<T>::last(count): count out of range");
+        return {data() + size() - __count, __count};
+    }
+
+    template <size_t _Offset, size_t _Count = dynamic_extent>
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr span<element_type, _Count> subspan() const noexcept
+    {
+        _LIBCPP_ASSERT(_Offset <= size(), "span<T>::subspan<Offset, Count>(): Offset out of range");
+        _LIBCPP_ASSERT(_Count == dynamic_extent || _Count <= size() - _Offset, "span<T>::subspan<Offset, Count>(): Offset + Count out of range");
+        return span<element_type, _Count>{data() + _Offset, _Count == dynamic_extent ? size() - _Offset : _Count};
+    }
+
+    constexpr span<element_type, dynamic_extent>
+    _LIBCPP_INLINE_VISIBILITY
+    subspan(size_type __offset, size_type __count = dynamic_extent) const noexcept
+    {
+        _LIBCPP_ASSERT(__offset <= size(), "span<T>::subspan(offset, count): offset out of range");
+        _LIBCPP_ASSERT(__count <= size() || __count == dynamic_extent, "span<T>::subspan(offset, count): count out of range");
+        if (__count == dynamic_extent)
+            return {data() + __offset, size() - __offset};
+        _LIBCPP_ASSERT(__count <= size() - __offset, "span<T>::subspan(offset, count): offset + count out of range");
+        return {data() + __offset, __count};
+    }
+
+    _LIBCPP_INLINE_VISIBILITY constexpr size_type size()           const noexcept { return __size_; }
+    _LIBCPP_INLINE_VISIBILITY constexpr size_type size_bytes()     const noexcept { return __size_ * sizeof(element_type); }
+    [[nodiscard]] _LIBCPP_INLINE_VISIBILITY constexpr bool empty() const noexcept { return __size_ == 0; }
+
+    _LIBCPP_INLINE_VISIBILITY constexpr reference operator[](size_type __idx) const noexcept
+    {
+        _LIBCPP_ASSERT(__idx < size(), "span<T>::operator[](index): index out of range");
+        return __data_[__idx];
+    }
+
+    _LIBCPP_INLINE_VISIBILITY constexpr reference front() const noexcept
+    {
+        _LIBCPP_ASSERT(!empty(), "span<T>::front() on empty span");
+        return __data_[0];
+    }
+
+    _LIBCPP_INLINE_VISIBILITY constexpr reference back() const noexcept
+    {
+        _LIBCPP_ASSERT(!empty(), "span<T>::back() on empty span");
+        return __data_[size()-1];
+    }
+
+
+    _LIBCPP_INLINE_VISIBILITY constexpr pointer data()                         const noexcept { return __data_; }
+
+// [span.iter], span iterator support
+    _LIBCPP_INLINE_VISIBILITY constexpr iterator begin() const noexcept {
+#ifdef _LIBCPP_DEBUG_ITERATOR_BOUNDS_CHECKING
+        return std::__make_bounded_iter(data(), data(), data() + size());
+#else
+        return iterator(this, data());
+#endif
+    }
+    _LIBCPP_INLINE_VISIBILITY constexpr iterator end() const noexcept {
+#ifdef _LIBCPP_DEBUG_ITERATOR_BOUNDS_CHECKING
+        return std::__make_bounded_iter(data() + size(), data(), data() + size());
+#else
+        return iterator(this, data() + size());
+#endif
+    }
+    _LIBCPP_INLINE_VISIBILITY constexpr reverse_iterator        rbegin() const noexcept { return reverse_iterator(end()); }
+    _LIBCPP_INLINE_VISIBILITY constexpr reverse_iterator          rend() const noexcept { return reverse_iterator(begin()); }
+
+    _LIBCPP_INLINE_VISIBILITY span<const byte, dynamic_extent> __as_bytes() const noexcept
+    { return {reinterpret_cast<const byte *>(data()), size_bytes()}; }
+
+    _LIBCPP_INLINE_VISIBILITY span<byte, dynamic_extent> __as_writable_bytes() const noexcept
+    { return {reinterpret_cast<byte *>(data()), size_bytes()}; }
+
+private:
+    pointer   __data_;
+    size_type __size_;
+};
+
+template <class _Tp, size_t _Extent>
+inline constexpr bool ranges::enable_borrowed_range<span<_Tp, _Extent> > = true;
+
+template <class _ElementType, size_t _Extent>
+inline constexpr bool ranges::enable_view<span<_ElementType, _Extent>> = true;
+
+//  as_bytes & as_writable_bytes
+template <class _Tp, size_t _Extent>
+_LIBCPP_INLINE_VISIBILITY
+auto as_bytes(span<_Tp, _Extent> __s) noexcept
+{ return __s.__as_bytes(); }
+
+template <class _Tp, size_t _Extent> requires(!is_const_v<_Tp>)
+_LIBCPP_INLINE_VISIBILITY
+auto as_writable_bytes(span<_Tp, _Extent> __s) noexcept
+{ return __s.__as_writable_bytes(); }
+
+#if _LIBCPP_STD_VER > 17
+template<contiguous_iterator _It, class _EndOrSize>
+    span(_It, _EndOrSize) -> span<remove_reference_t<iter_reference_t<_It>>>;
+#endif // _LIBCPP_STD_VER > 17
+
+template<class _Tp, size_t _Sz>
+    span(_Tp (&)[_Sz]) -> span<_Tp, _Sz>;
+
+template<class _Tp, size_t _Sz>
+    span(array<_Tp, _Sz>&) -> span<_Tp, _Sz>;
+
+template<class _Tp, size_t _Sz>
+    span(const array<_Tp, _Sz>&) -> span<const _Tp, _Sz>;
+
+template<ranges::contiguous_range _Range>
+    span(_Range&&) -> span<remove_reference_t<ranges::range_reference_t<_Range>>>;
+
+#endif // _LIBCPP_STD_VER > 17
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <functional>
+#  include <iterator>
+#endif
+
+#endif // _LIBCPP_SPAN
diff --git a/app/src/main/cpp/libcxx/include/sstream b/app/src/main/cpp/libcxx/include/sstream
new file mode 100644
index 0000000..78cc28a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/sstream
@@ -0,0 +1,883 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_SSTREAM
+#define _LIBCPP_SSTREAM
+
+/*
+    sstream synopsis [sstream.syn]
+
+// Class template basic_stringbuf [stringbuf]
+template <class charT, class traits = char_traits<charT>, class Allocator = allocator<charT> >
+class basic_stringbuf
+    : public basic_streambuf<charT, traits>
+{
+public:
+    typedef charT                          char_type;
+    typedef traits                         traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+    typedef Allocator                      allocator_type;
+
+    // [stringbuf.cons] constructors:
+    explicit basic_stringbuf(ios_base::openmode which = ios_base::in | ios_base::out); // before C++20
+    basic_stringbuf() : basic_stringbuf(ios_base::in | ios_base::out) {}               // C++20
+    explicit basic_stringbuf(ios_base::openmode which);                                // C++20
+    explicit basic_stringbuf(const basic_string<char_type, traits_type, allocator_type>& str,
+                             ios_base::openmode which = ios_base::in | ios_base::out);
+    basic_stringbuf(basic_stringbuf&& rhs);
+
+    // [stringbuf.assign] Assign and swap:
+    basic_stringbuf& operator=(basic_stringbuf&& rhs);
+    void swap(basic_stringbuf& rhs);
+
+    // [stringbuf.members] Member functions:
+    basic_string<char_type, traits_type, allocator_type> str() const;
+    void str(const basic_string<char_type, traits_type, allocator_type>& s);
+
+protected:
+    // [stringbuf.virtuals] Overridden virtual functions:
+    virtual int_type underflow();
+    virtual int_type pbackfail(int_type c = traits_type::eof());
+    virtual int_type overflow (int_type c = traits_type::eof());
+    virtual basic_streambuf<char_type, traits_type>* setbuf(char_type*, streamsize);
+    virtual pos_type seekoff(off_type off, ios_base::seekdir way,
+                             ios_base::openmode which = ios_base::in | ios_base::out);
+    virtual pos_type seekpos(pos_type sp,
+                             ios_base::openmode which = ios_base::in | ios_base::out);
+};
+
+// [stringbuf.assign] non member swap
+template <class charT, class traits, class Allocator>
+  void swap(basic_stringbuf<charT, traits, Allocator>& x,
+            basic_stringbuf<charT, traits, Allocator>& y);
+
+typedef basic_stringbuf<char>    stringbuf;
+typedef basic_stringbuf<wchar_t> wstringbuf;
+
+// Class template basic_istringstream [istringstream]
+template <class charT, class traits = char_traits<charT>, class Allocator = allocator<charT> >
+class basic_istringstream
+    : public basic_istream<charT, traits>
+{
+public:
+    typedef charT                          char_type;
+    typedef traits                         traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+    typedef Allocator                      allocator_type;
+
+    // [istringstream.cons] Constructors:
+    explicit basic_istringstream(ios_base::openmode which = ios_base::in); // before C++20
+    basic_istringstream() : basic_istringstream(ios_base::in) {}           // C++20
+    explicit basic_istringstream(ios_base::openmode which);                // C++20
+
+    explicit basic_istringstream(const basic_string<char_type, traits_type,allocator_type>& str,
+                                 ios_base::openmode which = ios_base::in);
+    basic_istringstream(basic_istringstream&& rhs);
+
+    // [istringstream.assign] Assign and swap:
+    basic_istringstream& operator=(basic_istringstream&& rhs);
+    void swap(basic_istringstream& rhs);
+
+    // [istringstream.members] Member functions:
+    basic_stringbuf<char_type, traits_type, allocator_type>* rdbuf() const;
+    basic_string<char_type, traits_type, allocator_type> str() const;
+    void str(const basic_string<char_type, traits_type, allocator_type>& s);
+};
+
+template <class charT, class traits, class Allocator>
+  void swap(basic_istringstream<charT, traits, Allocator>& x,
+            basic_istringstream<charT, traits, Allocator>& y);
+
+typedef basic_istringstream<char>    istringstream;
+typedef basic_istringstream<wchar_t> wistringstream;
+
+// Class template basic_ostringstream [ostringstream]
+template <class charT, class traits = char_traits<charT>, class Allocator = allocator<charT> >
+class basic_ostringstream
+    : public basic_ostream<charT, traits>
+{
+public:
+    // types:
+    typedef charT                          char_type;
+    typedef traits                         traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+    typedef Allocator                      allocator_type;
+
+    // [ostringstream.cons] Constructors:
+    explicit basic_ostringstream(ios_base::openmode which = ios_base::out); // before C++20
+    basic_ostringstream() : basic_ostringstream(ios_base::out) {}           // C++20
+    explicit basic_ostringstream(ios_base::openmode which);                 // C++20
+
+    explicit basic_ostringstream(const basic_string<char_type, traits_type, allocator_type>& str,
+                                 ios_base::openmode which = ios_base::out);
+    basic_ostringstream(basic_ostringstream&& rhs);
+
+    // [ostringstream.assign] Assign and swap:
+    basic_ostringstream& operator=(basic_ostringstream&& rhs);
+    void swap(basic_ostringstream& rhs);
+
+    // [ostringstream.members] Member functions:
+    basic_stringbuf<char_type, traits_type, allocator_type>* rdbuf() const;
+    basic_string<char_type, traits_type, allocator_type> str() const;
+    void str(const basic_string<char_type, traits_type, allocator_type>& s);
+};
+
+template <class charT, class traits, class Allocator>
+  void swap(basic_ostringstream<charT, traits, Allocator>& x,
+            basic_ostringstream<charT, traits, Allocator>& y);
+
+typedef basic_ostringstream<char>    ostringstream;
+typedef basic_ostringstream<wchar_t> wostringstream;
+
+// Class template basic_stringstream [stringstream]
+template <class charT, class traits = char_traits<charT>, class Allocator = allocator<charT> >
+class basic_stringstream
+    : public basic_iostream<charT, traits>
+{
+public:
+    // types:
+    typedef charT                          char_type;
+    typedef traits                         traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+    typedef Allocator                      allocator_type;
+
+    // [stringstream.cons] constructors
+    explicit basic_stringstream(ios_base::openmode which = ios_base::out | ios_base::in); // before C++20
+    basic_stringstream() : basic_stringstream(ios_base::out | ios_base::in) {}            // C++20
+    explicit basic_stringstream(ios_base::openmode which);                                // C++20
+
+    explicit basic_stringstream(const basic_string<char_type, traits_type, allocator_type>& str,
+                                ios_base::openmode which = ios_base::out|ios_base::in);
+    basic_stringstream(basic_stringstream&& rhs);
+
+    // [stringstream.assign] Assign and swap:
+    basic_stringstream& operator=(basic_stringstream&& rhs);
+    void swap(basic_stringstream& rhs);
+
+    // [stringstream.members] Member functions:
+    basic_stringbuf<char_type, traits_type, allocator_type>* rdbuf() const;
+    basic_string<char_type, traits_type, allocator_type> str() const;
+    void str(const basic_string<char_type, traits_type, allocator_type>& str);
+};
+
+template <class charT, class traits, class Allocator>
+  void swap(basic_stringstream<charT, traits, Allocator>& x,
+            basic_stringstream<charT, traits, Allocator>& y);
+
+typedef basic_stringstream<char>    stringstream;
+typedef basic_stringstream<wchar_t> wstringstream;
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__utility/swap.h>
+#include <istream>
+#include <ostream>
+#include <string>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// Class template basic_stringbuf [stringbuf]
+
+template <class _CharT, class _Traits, class _Allocator>
+class _LIBCPP_TEMPLATE_VIS basic_stringbuf
+    : public basic_streambuf<_CharT, _Traits>
+{
+public:
+    typedef _CharT                         char_type;
+    typedef _Traits                        traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+    typedef _Allocator                     allocator_type;
+
+    typedef basic_string<char_type, traits_type, allocator_type> string_type;
+
+private:
+
+    string_type __str_;
+    mutable char_type* __hm_;
+    ios_base::openmode __mode_;
+
+public:
+    // [stringbuf.cons] constructors:
+    _LIBCPP_INLINE_VISIBILITY
+    basic_stringbuf()
+        : __hm_(nullptr), __mode_(ios_base::in | ios_base::out) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_stringbuf(ios_base::openmode __wch)
+        : __hm_(nullptr), __mode_(__wch) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_stringbuf(const string_type& __s,
+                             ios_base::openmode __wch = ios_base::in | ios_base::out)
+        : __str_(__s.get_allocator()), __hm_(nullptr), __mode_(__wch)
+    {
+        str(__s);
+    }
+
+    basic_stringbuf(basic_stringbuf&& __rhs);
+
+    // [stringbuf.assign] Assign and swap:
+    basic_stringbuf& operator=(basic_stringbuf&& __rhs);
+    void swap(basic_stringbuf& __rhs);
+
+    // [stringbuf.members] Member functions:
+    string_type str() const;
+    void str(const string_type& __s);
+
+protected:
+    // [stringbuf.virtuals] Overridden virtual functions:
+    int_type underflow() override;
+    int_type pbackfail(int_type __c = traits_type::eof()) override;
+    int_type overflow (int_type __c = traits_type::eof()) override;
+    pos_type seekoff(off_type __off, ios_base::seekdir __way,
+                     ios_base::openmode __wch = ios_base::in | ios_base::out) override;
+    _LIBCPP_HIDE_FROM_ABI_VIRTUAL
+    pos_type seekpos(pos_type __sp,
+                     ios_base::openmode __wch = ios_base::in | ios_base::out) override {
+        return seekoff(__sp, ios_base::beg, __wch);
+    }
+};
+
+template <class _CharT, class _Traits, class _Allocator>
+basic_stringbuf<_CharT, _Traits, _Allocator>::basic_stringbuf(basic_stringbuf&& __rhs)
+    : __mode_(__rhs.__mode_)
+{
+    char_type* __p = const_cast<char_type*>(__rhs.__str_.data());
+    ptrdiff_t __binp = -1;
+    ptrdiff_t __ninp = -1;
+    ptrdiff_t __einp = -1;
+    if (__rhs.eback() != nullptr)
+    {
+        __binp = __rhs.eback() - __p;
+        __ninp = __rhs.gptr() - __p;
+        __einp = __rhs.egptr() - __p;
+    }
+    ptrdiff_t __bout = -1;
+    ptrdiff_t __nout = -1;
+    ptrdiff_t __eout = -1;
+    if (__rhs.pbase() != nullptr)
+    {
+        __bout = __rhs.pbase() - __p;
+        __nout = __rhs.pptr() - __p;
+        __eout = __rhs.epptr() - __p;
+    }
+    ptrdiff_t __hm = __rhs.__hm_ == nullptr ? -1 : __rhs.__hm_ - __p;
+    __str_ = _VSTD::move(__rhs.__str_);
+    __p = const_cast<char_type*>(__str_.data());
+    if (__binp != -1)
+        this->setg(__p + __binp, __p + __ninp, __p + __einp);
+    if (__bout != -1)
+    {
+        this->setp(__p + __bout, __p + __eout);
+        this->__pbump(__nout);
+    }
+    __hm_ = __hm == -1 ? nullptr : __p + __hm;
+    __p = const_cast<char_type*>(__rhs.__str_.data());
+    __rhs.setg(__p, __p, __p);
+    __rhs.setp(__p, __p);
+    __rhs.__hm_ = __p;
+    this->pubimbue(__rhs.getloc());
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+basic_stringbuf<_CharT, _Traits, _Allocator>&
+basic_stringbuf<_CharT, _Traits, _Allocator>::operator=(basic_stringbuf&& __rhs)
+{
+    char_type* __p = const_cast<char_type*>(__rhs.__str_.data());
+    ptrdiff_t __binp = -1;
+    ptrdiff_t __ninp = -1;
+    ptrdiff_t __einp = -1;
+    if (__rhs.eback() != nullptr)
+    {
+        __binp = __rhs.eback() - __p;
+        __ninp = __rhs.gptr() - __p;
+        __einp = __rhs.egptr() - __p;
+    }
+    ptrdiff_t __bout = -1;
+    ptrdiff_t __nout = -1;
+    ptrdiff_t __eout = -1;
+    if (__rhs.pbase() != nullptr)
+    {
+        __bout = __rhs.pbase() - __p;
+        __nout = __rhs.pptr() - __p;
+        __eout = __rhs.epptr() - __p;
+    }
+    ptrdiff_t __hm = __rhs.__hm_ == nullptr ? -1 : __rhs.__hm_ - __p;
+    __str_ = _VSTD::move(__rhs.__str_);
+    __p = const_cast<char_type*>(__str_.data());
+    if (__binp != -1)
+        this->setg(__p + __binp, __p + __ninp, __p + __einp);
+    else
+        this->setg(nullptr, nullptr, nullptr);
+    if (__bout != -1)
+    {
+        this->setp(__p + __bout, __p + __eout);
+        this->__pbump(__nout);
+    }
+    else
+        this->setp(nullptr, nullptr);
+
+    __hm_ = __hm == -1 ? nullptr : __p + __hm;
+    __mode_ = __rhs.__mode_;
+    __p = const_cast<char_type*>(__rhs.__str_.data());
+    __rhs.setg(__p, __p, __p);
+    __rhs.setp(__p, __p);
+    __rhs.__hm_ = __p;
+    this->pubimbue(__rhs.getloc());
+    return *this;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+void
+basic_stringbuf<_CharT, _Traits, _Allocator>::swap(basic_stringbuf& __rhs)
+{
+    char_type* __p = const_cast<char_type*>(__rhs.__str_.data());
+    ptrdiff_t __rbinp = -1;
+    ptrdiff_t __rninp = -1;
+    ptrdiff_t __reinp = -1;
+    if (__rhs.eback() != nullptr)
+    {
+        __rbinp = __rhs.eback() - __p;
+        __rninp = __rhs.gptr() - __p;
+        __reinp = __rhs.egptr() - __p;
+    }
+    ptrdiff_t __rbout = -1;
+    ptrdiff_t __rnout = -1;
+    ptrdiff_t __reout = -1;
+    if (__rhs.pbase() != nullptr)
+    {
+        __rbout = __rhs.pbase() - __p;
+        __rnout = __rhs.pptr() - __p;
+        __reout = __rhs.epptr() - __p;
+    }
+    ptrdiff_t __rhm = __rhs.__hm_ == nullptr ? -1 : __rhs.__hm_ - __p;
+    __p = const_cast<char_type*>(__str_.data());
+    ptrdiff_t __lbinp = -1;
+    ptrdiff_t __lninp = -1;
+    ptrdiff_t __leinp = -1;
+    if (this->eback() != nullptr)
+    {
+        __lbinp = this->eback() - __p;
+        __lninp = this->gptr() - __p;
+        __leinp = this->egptr() - __p;
+    }
+    ptrdiff_t __lbout = -1;
+    ptrdiff_t __lnout = -1;
+    ptrdiff_t __leout = -1;
+    if (this->pbase() != nullptr)
+    {
+        __lbout = this->pbase() - __p;
+        __lnout = this->pptr() - __p;
+        __leout = this->epptr() - __p;
+    }
+    ptrdiff_t __lhm = __hm_ == nullptr ? -1 : __hm_ - __p;
+    _VSTD::swap(__mode_, __rhs.__mode_);
+    __str_.swap(__rhs.__str_);
+    __p = const_cast<char_type*>(__str_.data());
+    if (__rbinp != -1)
+        this->setg(__p + __rbinp, __p + __rninp, __p + __reinp);
+    else
+        this->setg(nullptr, nullptr, nullptr);
+    if (__rbout != -1)
+    {
+        this->setp(__p + __rbout, __p + __reout);
+        this->__pbump(__rnout);
+    }
+    else
+        this->setp(nullptr, nullptr);
+    __hm_ = __rhm == -1 ? nullptr : __p + __rhm;
+    __p = const_cast<char_type*>(__rhs.__str_.data());
+    if (__lbinp != -1)
+        __rhs.setg(__p + __lbinp, __p + __lninp, __p + __leinp);
+    else
+        __rhs.setg(nullptr, nullptr, nullptr);
+    if (__lbout != -1)
+    {
+        __rhs.setp(__p + __lbout, __p + __leout);
+        __rhs.__pbump(__lnout);
+    }
+    else
+        __rhs.setp(nullptr, nullptr);
+    __rhs.__hm_ = __lhm == -1 ? nullptr : __p + __lhm;
+    locale __tl = __rhs.getloc();
+    __rhs.pubimbue(this->getloc());
+    this->pubimbue(__tl);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(basic_stringbuf<_CharT, _Traits, _Allocator>& __x,
+     basic_stringbuf<_CharT, _Traits, _Allocator>& __y)
+{
+    __x.swap(__y);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+basic_string<_CharT, _Traits, _Allocator>
+basic_stringbuf<_CharT, _Traits, _Allocator>::str() const
+{
+    if (__mode_ & ios_base::out)
+    {
+        if (__hm_ < this->pptr())
+            __hm_ = this->pptr();
+        return string_type(this->pbase(), __hm_, __str_.get_allocator());
+    }
+    else if (__mode_ & ios_base::in)
+        return string_type(this->eback(), this->egptr(), __str_.get_allocator());
+    return string_type(__str_.get_allocator());
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+void
+basic_stringbuf<_CharT, _Traits, _Allocator>::str(const string_type& __s)
+{
+    __str_ = __s;
+    __hm_ = nullptr;
+    if (__mode_ & ios_base::in)
+    {
+        __hm_ = const_cast<char_type*>(__str_.data()) + __str_.size();
+        this->setg(const_cast<char_type*>(__str_.data()),
+                   const_cast<char_type*>(__str_.data()),
+                   __hm_);
+    }
+    if (__mode_ & ios_base::out)
+    {
+        typename string_type::size_type __sz = __str_.size();
+        __hm_ = const_cast<char_type*>(__str_.data()) + __sz;
+        __str_.resize(__str_.capacity());
+        this->setp(const_cast<char_type*>(__str_.data()),
+                   const_cast<char_type*>(__str_.data()) + __str_.size());
+        if (__mode_ & (ios_base::app | ios_base::ate))
+        {
+            while (__sz > INT_MAX)
+            {
+                this->pbump(INT_MAX);
+                __sz -= INT_MAX;
+            }
+            if (__sz > 0)
+                this->pbump(__sz);
+        }
+    }
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+typename basic_stringbuf<_CharT, _Traits, _Allocator>::int_type
+basic_stringbuf<_CharT, _Traits, _Allocator>::underflow()
+{
+    if (__hm_ < this->pptr())
+        __hm_ = this->pptr();
+    if (__mode_ & ios_base::in)
+    {
+        if (this->egptr() < __hm_)
+            this->setg(this->eback(), this->gptr(), __hm_);
+        if (this->gptr() < this->egptr())
+            return traits_type::to_int_type(*this->gptr());
+    }
+    return traits_type::eof();
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+typename basic_stringbuf<_CharT, _Traits, _Allocator>::int_type
+basic_stringbuf<_CharT, _Traits, _Allocator>::pbackfail(int_type __c)
+{
+    if (__hm_ < this->pptr())
+        __hm_ = this->pptr();
+    if (this->eback() < this->gptr())
+    {
+        if (traits_type::eq_int_type(__c, traits_type::eof()))
+        {
+            this->setg(this->eback(), this->gptr()-1, __hm_);
+            return traits_type::not_eof(__c);
+        }
+        if ((__mode_ & ios_base::out) ||
+            traits_type::eq(traits_type::to_char_type(__c), this->gptr()[-1]))
+        {
+            this->setg(this->eback(), this->gptr()-1, __hm_);
+            *this->gptr() = traits_type::to_char_type(__c);
+            return __c;
+        }
+    }
+    return traits_type::eof();
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+typename basic_stringbuf<_CharT, _Traits, _Allocator>::int_type
+basic_stringbuf<_CharT, _Traits, _Allocator>::overflow(int_type __c)
+{
+    if (!traits_type::eq_int_type(__c, traits_type::eof()))
+    {
+        ptrdiff_t __ninp = this->gptr()  - this->eback();
+        if (this->pptr() == this->epptr())
+        {
+            if (!(__mode_ & ios_base::out))
+                return traits_type::eof();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+            try
+            {
+#endif // _LIBCPP_NO_EXCEPTIONS
+                ptrdiff_t __nout = this->pptr()  - this->pbase();
+                ptrdiff_t __hm = __hm_ - this->pbase();
+                __str_.push_back(char_type());
+                __str_.resize(__str_.capacity());
+                char_type* __p = const_cast<char_type*>(__str_.data());
+                this->setp(__p, __p + __str_.size());
+                this->__pbump(__nout);
+                __hm_ = this->pbase() + __hm;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+            }
+            catch (...)
+            {
+                return traits_type::eof();
+            }
+#endif // _LIBCPP_NO_EXCEPTIONS
+        }
+        __hm_ = _VSTD::max(this->pptr() + 1, __hm_);
+        if (__mode_ & ios_base::in)
+        {
+            char_type* __p = const_cast<char_type*>(__str_.data());
+            this->setg(__p, __p + __ninp, __hm_);
+        }
+        return this->sputc(traits_type::to_char_type(__c));
+    }
+    return traits_type::not_eof(__c);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+typename basic_stringbuf<_CharT, _Traits, _Allocator>::pos_type
+basic_stringbuf<_CharT, _Traits, _Allocator>::seekoff(off_type __off,
+                                                      ios_base::seekdir __way,
+                                                      ios_base::openmode __wch)
+{
+    if (__hm_ < this->pptr())
+        __hm_ = this->pptr();
+    if ((__wch & (ios_base::in | ios_base::out)) == 0)
+        return pos_type(-1);
+    if ((__wch & (ios_base::in | ios_base::out)) == (ios_base::in | ios_base::out)
+        && __way == ios_base::cur)
+        return pos_type(-1);
+    const ptrdiff_t __hm = __hm_ == nullptr ? 0 : __hm_ - __str_.data();
+    off_type __noff;
+    switch (__way)
+    {
+    case ios_base::beg:
+        __noff = 0;
+        break;
+    case ios_base::cur:
+        if (__wch & ios_base::in)
+            __noff = this->gptr() - this->eback();
+        else
+            __noff = this->pptr() - this->pbase();
+        break;
+    case ios_base::end:
+        __noff = __hm;
+        break;
+    default:
+        return pos_type(-1);
+    }
+    __noff += __off;
+    if (__noff < 0 || __hm < __noff)
+        return pos_type(-1);
+    if (__noff != 0)
+    {
+        if ((__wch & ios_base::in) && this->gptr() == nullptr)
+            return pos_type(-1);
+        if ((__wch & ios_base::out) && this->pptr() == nullptr)
+            return pos_type(-1);
+    }
+    if (__wch & ios_base::in)
+        this->setg(this->eback(), this->eback() + __noff, __hm_);
+    if (__wch & ios_base::out)
+    {
+        this->setp(this->pbase(), this->epptr());
+        this->pbump(__noff);
+    }
+    return pos_type(__noff);
+}
+
+// Class template basic_istringstream [istringstream]
+
+template <class _CharT, class _Traits, class _Allocator>
+class _LIBCPP_TEMPLATE_VIS basic_istringstream
+    : public basic_istream<_CharT, _Traits>
+{
+public:
+    typedef _CharT                         char_type;
+    typedef _Traits                        traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+    typedef _Allocator                     allocator_type;
+
+    typedef basic_string<char_type, traits_type, allocator_type> string_type;
+
+private:
+    basic_stringbuf<char_type, traits_type, allocator_type> __sb_;
+
+public:
+    // [istringstream.cons] Constructors:
+    _LIBCPP_INLINE_VISIBILITY
+    basic_istringstream()
+        : basic_istream<_CharT, _Traits>(&__sb_), __sb_(ios_base::in) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_istringstream(ios_base::openmode __wch)
+        : basic_istream<_CharT, _Traits>(&__sb_), __sb_(__wch | ios_base::in) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_istringstream(const string_type& __s,
+                                 ios_base::openmode __wch = ios_base::in)
+        : basic_istream<_CharT, _Traits>(&__sb_)
+        , __sb_(__s, __wch | ios_base::in)
+    { }
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_istringstream(basic_istringstream&& __rhs)
+        : basic_istream<_CharT, _Traits>(_VSTD::move(__rhs))
+        , __sb_(_VSTD::move(__rhs.__sb_))
+    {
+        basic_istream<_CharT, _Traits>::set_rdbuf(&__sb_);
+    }
+
+    // [istringstream.assign] Assign and swap:
+    basic_istringstream& operator=(basic_istringstream&& __rhs) {
+        basic_istream<char_type, traits_type>::operator=(_VSTD::move(__rhs));
+        __sb_ = _VSTD::move(__rhs.__sb_);
+        return *this;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(basic_istringstream& __rhs) {
+        basic_istream<char_type, traits_type>::swap(__rhs);
+        __sb_.swap(__rhs.__sb_);
+    }
+
+    // [istringstream.members] Member functions:
+    _LIBCPP_INLINE_VISIBILITY
+    basic_stringbuf<char_type, traits_type, allocator_type>* rdbuf() const {
+        return const_cast<basic_stringbuf<char_type, traits_type, allocator_type>*>(&__sb_);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    string_type str() const {
+        return __sb_.str();
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    void str(const string_type& __s) {
+        __sb_.str(__s);
+    }
+};
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(basic_istringstream<_CharT, _Traits, _Allocator>& __x,
+     basic_istringstream<_CharT, _Traits, _Allocator>& __y)
+{
+    __x.swap(__y);
+}
+
+// Class template basic_ostringstream [ostringstream]
+
+template <class _CharT, class _Traits, class _Allocator>
+class _LIBCPP_TEMPLATE_VIS basic_ostringstream
+    : public basic_ostream<_CharT, _Traits>
+{
+public:
+    typedef _CharT                         char_type;
+    typedef _Traits                        traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+    typedef _Allocator                     allocator_type;
+
+    typedef basic_string<char_type, traits_type, allocator_type> string_type;
+
+private:
+    basic_stringbuf<char_type, traits_type, allocator_type> __sb_;
+
+public:
+    // [ostringstream.cons] Constructors:
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostringstream()
+        : basic_ostream<_CharT, _Traits>(&__sb_), __sb_(ios_base::out) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_ostringstream(ios_base::openmode __wch)
+        : basic_ostream<_CharT, _Traits>(&__sb_), __sb_(__wch | ios_base::out) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_ostringstream(const string_type& __s,
+                                 ios_base::openmode __wch = ios_base::out)
+        : basic_ostream<_CharT, _Traits>(&__sb_)
+        , __sb_(__s, __wch | ios_base::out)
+    { }
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_ostringstream(basic_ostringstream&& __rhs)
+        : basic_ostream<_CharT, _Traits>(_VSTD::move(__rhs))
+        , __sb_(_VSTD::move(__rhs.__sb_))
+    {
+        basic_ostream<_CharT, _Traits>::set_rdbuf(&__sb_);
+    }
+
+    // [ostringstream.assign] Assign and swap:
+    basic_ostringstream& operator=(basic_ostringstream&& __rhs) {
+        basic_ostream<char_type, traits_type>::operator=(_VSTD::move(__rhs));
+        __sb_ = _VSTD::move(__rhs.__sb_);
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(basic_ostringstream& __rhs) {
+        basic_ostream<char_type, traits_type>::swap(__rhs);
+        __sb_.swap(__rhs.__sb_);
+    }
+
+    // [ostringstream.members] Member functions:
+    _LIBCPP_INLINE_VISIBILITY
+    basic_stringbuf<char_type, traits_type, allocator_type>* rdbuf() const {
+        return const_cast<basic_stringbuf<char_type, traits_type, allocator_type>*>(&__sb_);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    string_type str() const {
+        return __sb_.str();
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    void str(const string_type& __s) {
+        __sb_.str(__s);
+    }
+};
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(basic_ostringstream<_CharT, _Traits, _Allocator>& __x,
+     basic_ostringstream<_CharT, _Traits, _Allocator>& __y)
+{
+    __x.swap(__y);
+}
+
+// Class template basic_stringstream [stringstream]
+
+template <class _CharT, class _Traits, class _Allocator>
+class _LIBCPP_TEMPLATE_VIS basic_stringstream
+    : public basic_iostream<_CharT, _Traits>
+{
+public:
+    typedef _CharT                         char_type;
+    typedef _Traits                        traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+    typedef _Allocator                     allocator_type;
+
+    typedef basic_string<char_type, traits_type, allocator_type> string_type;
+
+private:
+    basic_stringbuf<char_type, traits_type, allocator_type> __sb_;
+
+public:
+    // [stringstream.cons] constructors
+    _LIBCPP_INLINE_VISIBILITY
+    basic_stringstream()
+        : basic_iostream<_CharT, _Traits>(&__sb_), __sb_(ios_base::in | ios_base::out) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_stringstream(ios_base::openmode __wch)
+        : basic_iostream<_CharT, _Traits>(&__sb_), __sb_(__wch) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit basic_stringstream(const string_type& __s,
+                                ios_base::openmode __wch = ios_base::in | ios_base::out)
+        : basic_iostream<_CharT, _Traits>(&__sb_)
+        , __sb_(__s, __wch)
+    { }
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_stringstream(basic_stringstream&& __rhs)
+        : basic_iostream<_CharT, _Traits>(_VSTD::move(__rhs))
+        , __sb_(_VSTD::move(__rhs.__sb_))
+    {
+        basic_istream<_CharT, _Traits>::set_rdbuf(&__sb_);
+    }
+
+    // [stringstream.assign] Assign and swap:
+    basic_stringstream& operator=(basic_stringstream&& __rhs) {
+        basic_iostream<char_type, traits_type>::operator=(_VSTD::move(__rhs));
+        __sb_ = _VSTD::move(__rhs.__sb_);
+        return *this;
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(basic_stringstream& __rhs) {
+        basic_iostream<char_type, traits_type>::swap(__rhs);
+        __sb_.swap(__rhs.__sb_);
+    }
+
+    // [stringstream.members] Member functions:
+    _LIBCPP_INLINE_VISIBILITY
+    basic_stringbuf<char_type, traits_type, allocator_type>* rdbuf() const {
+        return const_cast<basic_stringbuf<char_type, traits_type, allocator_type>*>(&__sb_);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    string_type str() const {
+        return __sb_.str();
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    void str(const string_type& __s) {
+        __sb_.str(__s);
+    }
+};
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(basic_stringstream<_CharT, _Traits, _Allocator>& __x,
+     basic_stringstream<_CharT, _Traits, _Allocator>& __y)
+{
+    __x.swap(__y);
+}
+
+#if defined(_LIBCPP_ABI_ENABLE_ADDITIONAL_IOSTREAM_EXPLICIT_INSTANTIATIONS_1)
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_stringbuf<char>;
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_stringstream<char>;
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_ostringstream<char>;
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_istringstream<char>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if _LIBCPP_STD_VER <= 20 && !defined(_LIPCPP_REMOVE_TRANSITIVE_INCLUDES)
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_SSTREAM
diff --git a/app/src/main/cpp/libcxx/include/stack b/app/src/main/cpp/libcxx/include/stack
new file mode 100644
index 0000000..d653d1b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/stack
@@ -0,0 +1,371 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_STACK
+#define _LIBCPP_STACK
+
+/*
+    stack synopsis
+
+namespace std
+{
+
+template <class T, class Container = deque<T>>
+class stack
+{
+public:
+    typedef Container                                container_type;
+    typedef typename container_type::value_type      value_type;
+    typedef typename container_type::reference       reference;
+    typedef typename container_type::const_reference const_reference;
+    typedef typename container_type::size_type       size_type;
+
+protected:
+    container_type c;
+
+public:
+    stack() = default;
+    ~stack() = default;
+
+    stack(const stack& q) = default;
+    stack(stack&& q) = default;
+
+    stack& operator=(const stack& q) = default;
+    stack& operator=(stack&& q) = default;
+
+    explicit stack(const container_type& c);
+    explicit stack(container_type&& c);
+    template <class InputIterator> stack(InputIterator first, InputIterator last); // since C++23
+    template <class Alloc> explicit stack(const Alloc& a);
+    template <class Alloc> stack(const container_type& c, const Alloc& a);
+    template <class Alloc> stack(container_type&& c, const Alloc& a);
+    template <class Alloc> stack(const stack& c, const Alloc& a);
+    template <class Alloc> stack(stack&& c, const Alloc& a);
+    template<class InputIterator, class Alloc>
+    stack(InputIterator first, InputIterator last, const Alloc&); // since C++23
+
+    bool empty() const;
+    size_type size() const;
+    reference top();
+    const_reference top() const;
+
+    void push(const value_type& x);
+    void push(value_type&& x);
+    template <class... Args> reference emplace(Args&&... args); // reference in C++17
+    void pop();
+
+    void swap(stack& c) noexcept(is_nothrow_swappable_v<Container>)
+};
+
+template<class Container>
+  stack(Container) -> stack<typename Container::value_type, Container>;  // C++17
+
+template<class InputIterator>
+  stack(InputIterator, InputIterator) -> stack<iter-value-type<InputIterator>>; // since C++23
+
+template<class Container, class Allocator>
+  stack(Container, Allocator) -> stack<typename Container::value_type, Container>; // C++17
+
+template<class InputIterator, class Allocator>
+  stack(InputIterator, InputIterator, Allocator)
+    -> stack<iter-value-type<InputIterator>,
+             deque<iter-value-type<InputIterator>, Allocator>>; // since C++23
+
+template <class T, class Container>
+  bool operator==(const stack<T, Container>& x, const stack<T, Container>& y);
+template <class T, class Container>
+  bool operator< (const stack<T, Container>& x, const stack<T, Container>& y);
+template <class T, class Container>
+  bool operator!=(const stack<T, Container>& x, const stack<T, Container>& y);
+template <class T, class Container>
+  bool operator> (const stack<T, Container>& x, const stack<T, Container>& y);
+template <class T, class Container>
+  bool operator>=(const stack<T, Container>& x, const stack<T, Container>& y);
+template <class T, class Container>
+  bool operator<=(const stack<T, Container>& x, const stack<T, Container>& y);
+
+template <class T, class Container>
+  void swap(stack<T, Container>& x, stack<T, Container>& y)
+  noexcept(noexcept(x.swap(y)));
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__iterator/iterator_traits.h>
+#include <__memory/uses_allocator.h>
+#include <__utility/forward.h>
+#include <deque>
+#include <type_traits>
+#include <version>
+
+// standard-mandated includes
+
+// [stack.syn]
+#include <compare>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _Container = deque<_Tp> > class _LIBCPP_TEMPLATE_VIS stack;
+
+template <class _Tp, class _Container>
+_LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y);
+
+template <class _Tp, class _Container>
+_LIBCPP_INLINE_VISIBILITY
+bool
+operator< (const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y);
+
+template <class _Tp, class _Container /*= deque<_Tp>*/>
+class _LIBCPP_TEMPLATE_VIS stack
+{
+public:
+    typedef _Container                               container_type;
+    typedef typename container_type::value_type      value_type;
+    typedef typename container_type::reference       reference;
+    typedef typename container_type::const_reference const_reference;
+    typedef typename container_type::size_type       size_type;
+    static_assert((is_same<_Tp, value_type>::value), "" );
+
+protected:
+    container_type c;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    stack()
+        _NOEXCEPT_(is_nothrow_default_constructible<container_type>::value)
+        : c() {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    stack(const stack& __q) : c(__q.c) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    stack& operator=(const stack& __q) {c = __q.c; return *this;}
+
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    stack(stack&& __q)
+        _NOEXCEPT_(is_nothrow_move_constructible<container_type>::value)
+        : c(_VSTD::move(__q.c)) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    stack& operator=(stack&& __q)
+        _NOEXCEPT_(is_nothrow_move_assignable<container_type>::value)
+        {c = _VSTD::move(__q.c); return *this;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit stack(container_type&& __c) : c(_VSTD::move(__c)) {}
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit stack(const container_type& __c) : c(__c) {}
+
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        explicit stack(const _Alloc& __a,
+                       __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
+            : c(__a) {}
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        stack(const container_type& __c, const _Alloc& __a,
+              __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
+            : c(__c, __a) {}
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        stack(const stack& __s, const _Alloc& __a,
+              __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
+            : c(__s.c, __a) {}
+#ifndef _LIBCPP_CXX03_LANG
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        stack(container_type&& __c, const _Alloc& __a,
+              __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
+            : c(_VSTD::move(__c), __a) {}
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY
+        stack(stack&& __s, const _Alloc& __a,
+              __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
+            : c(_VSTD::move(__s.c), __a) {}
+#endif // _LIBCPP_CXX03_LANG
+
+#if _LIBCPP_STD_VER > 20
+    template <class _InputIterator,
+              class = __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>>
+    _LIBCPP_HIDE_FROM_ABI
+    stack(_InputIterator __first, _InputIterator __last) : c(__first, __last) {}
+
+    template <class _InputIterator,
+              class _Alloc,
+              class = __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+              class = __enable_if_t<uses_allocator<container_type, _Alloc>::value>>
+    _LIBCPP_HIDE_FROM_ABI
+    stack(_InputIterator __first, _InputIterator __last, const _Alloc& __alloc) : c(__first, __last, __alloc) {}
+#endif
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool empty()     const      {return c.empty();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const      {return c.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    reference top()             {return c.back();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_reference top() const {return c.back();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void push(const value_type& __v) {c.push_back(__v);}
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    void push(value_type&& __v) {c.push_back(_VSTD::move(__v));}
+
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+#if _LIBCPP_STD_VER > 14
+        decltype(auto) emplace(_Args&&... __args)
+        { return c.emplace_back(_VSTD::forward<_Args>(__args)...);}
+#else
+        void      emplace(_Args&&... __args)
+        {        c.emplace_back(_VSTD::forward<_Args>(__args)...);}
+#endif
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    void pop() {c.pop_back();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(stack& __s)
+        _NOEXCEPT_(__is_nothrow_swappable<container_type>::value)
+    {
+        using _VSTD::swap;
+        swap(c, __s.c);
+    }
+
+    _LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI const _Container& __get_container() const { return c; }
+
+    template <class T1, class _C1>
+    friend
+    bool
+    operator==(const stack<T1, _C1>& __x, const stack<T1, _C1>& __y);
+
+    template <class T1, class _C1>
+    friend
+    bool
+    operator< (const stack<T1, _C1>& __x, const stack<T1, _C1>& __y);
+};
+
+#if _LIBCPP_STD_VER > 14
+template<class _Container,
+         class = enable_if_t<!__is_allocator<_Container>::value>
+>
+stack(_Container)
+    -> stack<typename _Container::value_type, _Container>;
+
+template<class _Container,
+         class _Alloc,
+         class = enable_if_t<!__is_allocator<_Container>::value>,
+         class = enable_if_t<uses_allocator<_Container, _Alloc>::value>
+         >
+stack(_Container, _Alloc)
+    -> stack<typename _Container::value_type, _Container>;
+#endif
+
+#if _LIBCPP_STD_VER > 20
+template<class _InputIterator,
+         class = __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>>
+stack(_InputIterator, _InputIterator)
+    -> stack<__iter_value_type<_InputIterator>>;
+
+template<class _InputIterator,
+         class _Alloc,
+         class = __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = __enable_if_t<__is_allocator<_Alloc>::value>>
+stack(_InputIterator, _InputIterator, _Alloc)
+    -> stack<__iter_value_type<_InputIterator>, deque<__iter_value_type<_InputIterator>, _Alloc>>;
+#endif
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y)
+{
+    return __x.c == __y.c;
+}
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator< (const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y)
+{
+    return __x.c < __y.c;
+}
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator> (const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y)
+{
+    return __y < __x;
+}
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator>=(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<=(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _Tp, class _Container>
+inline _LIBCPP_INLINE_VISIBILITY
+__enable_if_t<__is_swappable<_Container>::value, void>
+swap(stack<_Tp, _Container>& __x, stack<_Tp, _Container>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+template <class _Tp, class _Container, class _Alloc>
+struct _LIBCPP_TEMPLATE_VIS uses_allocator<stack<_Tp, _Container>, _Alloc>
+    : public uses_allocator<_Container, _Alloc>
+{
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <functional>
+#endif
+
+#endif // _LIBCPP_STACK
diff --git a/app/src/main/cpp/libcxx/include/stdatomic.h b/app/src/main/cpp/libcxx/include/stdatomic.h
new file mode 100644
index 0000000..ff2a568
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/stdatomic.h
@@ -0,0 +1,235 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_STDATOMIC_H
+#define _LIBCPP_STDATOMIC_H
+
+/*
+    stdatomic.h synopsis
+
+template<class T>
+  using std-atomic = std::atomic<T>;        // exposition only
+
+#define _Atomic(T) std-atomic<T>
+
+#define ATOMIC_BOOL_LOCK_FREE see below
+#define ATOMIC_CHAR_LOCK_FREE see below
+#define ATOMIC_CHAR16_T_LOCK_FREE see below
+#define ATOMIC_CHAR32_T_LOCK_FREE see below
+#define ATOMIC_WCHAR_T_LOCK_FREE see below
+#define ATOMIC_SHORT_LOCK_FREE see below
+#define ATOMIC_INT_LOCK_FREE see below
+#define ATOMIC_LONG_LOCK_FREE see below
+#define ATOMIC_LLONG_LOCK_FREE see below
+#define ATOMIC_POINTER_LOCK_FREE see below
+
+using std::memory_order                // see below
+using std::memory_order_relaxed        // see below
+using std::memory_order_consume        // see below
+using std::memory_order_acquire        // see below
+using std::memory_order_release        // see below
+using std::memory_order_acq_rel        // see below
+using std::memory_order_seq_cst        // see below
+
+using std::atomic_flag                 // see below
+
+using std::atomic_bool                 // see below
+using std::atomic_char                 // see below
+using std::atomic_schar                // see below
+using std::atomic_uchar                // see below
+using std::atomic_short                // see below
+using std::atomic_ushort               // see below
+using std::atomic_int                  // see below
+using std::atomic_uint                 // see below
+using std::atomic_long                 // see below
+using std::atomic_ulong                // see below
+using std::atomic_llong                // see below
+using std::atomic_ullong               // see below
+using std::atomic_char8_t              // see below
+using std::atomic_char16_t             // see below
+using std::atomic_char32_t             // see below
+using std::atomic_wchar_t              // see below
+using std::atomic_int8_t               // see below
+using std::atomic_uint8_t              // see below
+using std::atomic_int16_t              // see below
+using std::atomic_uint16_t             // see below
+using std::atomic_int32_t              // see below
+using std::atomic_uint32_t             // see below
+using std::atomic_int64_t              // see below
+using std::atomic_uint64_t             // see below
+using std::atomic_int_least8_t         // see below
+using std::atomic_uint_least8_t        // see below
+using std::atomic_int_least16_t        // see below
+using std::atomic_uint_least16_t       // see below
+using std::atomic_int_least32_t        // see below
+using std::atomic_uint_least32_t       // see below
+using std::atomic_int_least64_t        // see below
+using std::atomic_uint_least64_t       // see below
+using std::atomic_int_fast8_t          // see below
+using std::atomic_uint_fast8_t         // see below
+using std::atomic_int_fast16_t         // see below
+using std::atomic_uint_fast16_t        // see below
+using std::atomic_int_fast32_t         // see below
+using std::atomic_uint_fast32_t        // see below
+using std::atomic_int_fast64_t         // see below
+using std::atomic_uint_fast64_t        // see below
+using std::atomic_intptr_t             // see below
+using std::atomic_uintptr_t            // see below
+using std::atomic_size_t               // see below
+using std::atomic_ptrdiff_t            // see below
+using std::atomic_intmax_t             // see below
+using std::atomic_uintmax_t            // see below
+
+using std::atomic_is_lock_free                         // see below
+using std::atomic_load                                 // see below
+using std::atomic_load_explicit                        // see below
+using std::atomic_store                                // see below
+using std::atomic_store_explicit                       // see below
+using std::atomic_exchange                             // see below
+using std::atomic_exchange_explicit                    // see below
+using std::atomic_compare_exchange_strong              // see below
+using std::atomic_compare_exchange_strong_explicit     // see below
+using std::atomic_compare_exchange_weak                // see below
+using std::atomic_compare_exchange_weak_explicit       // see below
+using std::atomic_fetch_add                            // see below
+using std::atomic_fetch_add_explicit                   // see below
+using std::atomic_fetch_sub                            // see below
+using std::atomic_fetch_sub_explicit                   // see below
+using std::atomic_fetch_or                             // see below
+using std::atomic_fetch_or_explicit                    // see below
+using std::atomic_fetch_and                            // see below
+using std::atomic_fetch_and_explicit                   // see below
+using std::atomic_flag_test_and_set                    // see below
+using std::atomic_flag_test_and_set_explicit           // see below
+using std::atomic_flag_clear                           // see below
+using std::atomic_flag_clear_explicit                  // see below
+
+using std::atomic_thread_fence                         // see below
+using std::atomic_signal_fence                         // see below
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if defined(__cplusplus) && _LIBCPP_STD_VER > 20
+
+#include <atomic>
+#include <version>
+
+#ifdef _Atomic
+# undef _Atomic
+#endif
+
+#define _Atomic(_Tp) ::std::atomic<_Tp>
+
+using std::memory_order _LIBCPP_USING_IF_EXISTS;
+using std::memory_order_relaxed _LIBCPP_USING_IF_EXISTS;
+using std::memory_order_consume _LIBCPP_USING_IF_EXISTS;
+using std::memory_order_acquire _LIBCPP_USING_IF_EXISTS;
+using std::memory_order_release _LIBCPP_USING_IF_EXISTS;
+using std::memory_order_acq_rel _LIBCPP_USING_IF_EXISTS;
+using std::memory_order_seq_cst _LIBCPP_USING_IF_EXISTS;
+
+using std::atomic_flag _LIBCPP_USING_IF_EXISTS;
+
+using std::atomic_bool _LIBCPP_USING_IF_EXISTS;
+using std::atomic_char _LIBCPP_USING_IF_EXISTS;
+using std::atomic_schar _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uchar _LIBCPP_USING_IF_EXISTS;
+using std::atomic_short _LIBCPP_USING_IF_EXISTS;
+using std::atomic_ushort _LIBCPP_USING_IF_EXISTS;
+using std::atomic_int _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint _LIBCPP_USING_IF_EXISTS;
+using std::atomic_long _LIBCPP_USING_IF_EXISTS;
+using std::atomic_ulong _LIBCPP_USING_IF_EXISTS;
+using std::atomic_llong _LIBCPP_USING_IF_EXISTS;
+using std::atomic_ullong _LIBCPP_USING_IF_EXISTS;
+using std::atomic_char8_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_char16_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_char32_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_wchar_t _LIBCPP_USING_IF_EXISTS;
+
+using std::atomic_int8_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint8_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_int16_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint16_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_int32_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint32_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_int64_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint64_t _LIBCPP_USING_IF_EXISTS;
+
+using std::atomic_int_least8_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint_least8_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_int_least16_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint_least16_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_int_least32_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint_least32_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_int_least64_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint_least64_t _LIBCPP_USING_IF_EXISTS;
+
+using std::atomic_int_fast8_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint_fast8_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_int_fast16_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint_fast16_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_int_fast32_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint_fast32_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_int_fast64_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uint_fast64_t _LIBCPP_USING_IF_EXISTS;
+
+using std::atomic_intptr_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uintptr_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_size_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_ptrdiff_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_intmax_t _LIBCPP_USING_IF_EXISTS;
+using std::atomic_uintmax_t _LIBCPP_USING_IF_EXISTS;
+
+using std::atomic_compare_exchange_strong _LIBCPP_USING_IF_EXISTS;
+using std::atomic_compare_exchange_strong_explicit _LIBCPP_USING_IF_EXISTS;
+using std::atomic_compare_exchange_weak _LIBCPP_USING_IF_EXISTS;
+using std::atomic_compare_exchange_weak_explicit _LIBCPP_USING_IF_EXISTS;
+using std::atomic_exchange _LIBCPP_USING_IF_EXISTS;
+using std::atomic_exchange_explicit _LIBCPP_USING_IF_EXISTS;
+using std::atomic_fetch_add _LIBCPP_USING_IF_EXISTS;
+using std::atomic_fetch_add_explicit _LIBCPP_USING_IF_EXISTS;
+using std::atomic_fetch_and _LIBCPP_USING_IF_EXISTS;
+using std::atomic_fetch_and_explicit _LIBCPP_USING_IF_EXISTS;
+using std::atomic_fetch_or _LIBCPP_USING_IF_EXISTS;
+using std::atomic_fetch_or_explicit _LIBCPP_USING_IF_EXISTS;
+using std::atomic_fetch_sub _LIBCPP_USING_IF_EXISTS;
+using std::atomic_fetch_sub_explicit _LIBCPP_USING_IF_EXISTS;
+using std::atomic_flag_clear _LIBCPP_USING_IF_EXISTS;
+using std::atomic_flag_clear_explicit _LIBCPP_USING_IF_EXISTS;
+using std::atomic_flag_test_and_set _LIBCPP_USING_IF_EXISTS;
+using std::atomic_flag_test_and_set_explicit _LIBCPP_USING_IF_EXISTS;
+using std::atomic_is_lock_free _LIBCPP_USING_IF_EXISTS;
+using std::atomic_load _LIBCPP_USING_IF_EXISTS;
+using std::atomic_load_explicit _LIBCPP_USING_IF_EXISTS;
+using std::atomic_store _LIBCPP_USING_IF_EXISTS;
+using std::atomic_store_explicit _LIBCPP_USING_IF_EXISTS;
+
+using std::atomic_signal_fence _LIBCPP_USING_IF_EXISTS;
+using std::atomic_thread_fence _LIBCPP_USING_IF_EXISTS;
+
+#elif defined(_LIBCPP_COMPILER_CLANG_BASED)
+
+// Before C++23, we include the next <stdatomic.h> on the path to avoid hijacking
+// the header. We do this because Clang has historically shipped a <stdatomic.h>
+// header that would be available in all Standard modes, and we don't want to
+// break that use case.
+# if __has_include_next(<stdatomic.h>)
+#   include_next <stdatomic.h>
+# endif
+
+#endif // defined(__cplusplus) && _LIBCPP_STD_VER > 20
+
+#endif // _LIBCPP_STDATOMIC_H
diff --git a/app/src/main/cpp/libcxx/include/stdbool.h b/app/src/main/cpp/libcxx/include/stdbool.h
new file mode 100644
index 0000000..74869b4
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/stdbool.h
@@ -0,0 +1,40 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_STDBOOL_H
+#define _LIBCPP_STDBOOL_H
+
+/*
+    stdbool.h synopsis
+
+Macros:
+
+    __bool_true_false_are_defined
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if __has_include_next(<stdbool.h>)
+#  include_next <stdbool.h>
+#endif
+
+#ifdef __cplusplus
+#undef bool
+#undef true
+#undef false
+#undef __bool_true_false_are_defined
+#define __bool_true_false_are_defined 1
+#endif
+
+#endif // _LIBCPP_STDBOOL_H
diff --git a/app/src/main/cpp/libcxx/include/stddef.h b/app/src/main/cpp/libcxx/include/stddef.h
new file mode 100644
index 0000000..f1725db
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/stddef.h
@@ -0,0 +1,53 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#if defined(__need_ptrdiff_t) || defined(__need_size_t) || \
+    defined(__need_wchar_t) || defined(__need_NULL) || defined(__need_wint_t)
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#include_next <stddef.h>
+
+#elif !defined(_LIBCPP_STDDEF_H)
+#define _LIBCPP_STDDEF_H
+
+/*
+    stddef.h synopsis
+
+Macros:
+
+    offsetof(type,member-designator)
+    NULL
+
+Types:
+
+    ptrdiff_t
+    size_t
+    max_align_t // C++11
+    nullptr_t
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#  if __has_include_next(<stddef.h>)
+#    include_next <stddef.h>
+#  endif
+
+#ifdef __cplusplus
+    typedef decltype(nullptr) nullptr_t;
+#endif
+
+#endif // _LIBCPP_STDDEF_H
diff --git a/app/src/main/cpp/libcxx/include/stdexcept b/app/src/main/cpp/libcxx/include/stdexcept
new file mode 100644
index 0000000..68de6ce
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/stdexcept
@@ -0,0 +1,310 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_STDEXCEPT
+#define _LIBCPP_STDEXCEPT
+
+/*
+    stdexcept synopsis
+
+namespace std
+{
+
+class logic_error;
+    class domain_error;
+    class invalid_argument;
+    class length_error;
+    class out_of_range;
+class runtime_error;
+    class range_error;
+    class overflow_error;
+    class underflow_error;
+
+for each class xxx_error:
+
+class xxx_error : public exception // at least indirectly
+{
+public:
+    explicit xxx_error(const string& what_arg);
+    explicit xxx_error(const char*   what_arg);
+
+    virtual const char* what() const noexcept // returns what_arg
+};
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <cstdlib>
+#include <exception>
+#include <iosfwd>  // for string forward decl
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#ifndef _LIBCPP_ABI_VCRUNTIME
+class _LIBCPP_HIDDEN __libcpp_refstring
+{
+    const char* __imp_;
+
+    bool __uses_refcount() const;
+public:
+    explicit __libcpp_refstring(const char* __msg);
+    __libcpp_refstring(const __libcpp_refstring& __s) _NOEXCEPT;
+    __libcpp_refstring& operator=(const __libcpp_refstring& __s) _NOEXCEPT;
+    ~__libcpp_refstring();
+
+    const char* c_str() const _NOEXCEPT {return __imp_;}
+};
+#endif // !_LIBCPP_ABI_VCRUNTIME
+
+_LIBCPP_END_NAMESPACE_STD
+
+namespace std  // purposefully not using versioning namespace
+{
+
+class _LIBCPP_EXCEPTION_ABI logic_error
+    : public exception
+{
+#ifndef _LIBCPP_ABI_VCRUNTIME
+private:
+    _VSTD::__libcpp_refstring __imp_;
+public:
+    explicit logic_error(const string&);
+    explicit logic_error(const char*);
+
+    logic_error(const logic_error&) _NOEXCEPT;
+    logic_error& operator=(const logic_error&) _NOEXCEPT;
+
+    ~logic_error() _NOEXCEPT override;
+
+    const char* what() const _NOEXCEPT override;
+#else
+public:
+    explicit logic_error(const _VSTD::string&); // Symbol uses versioned std::string
+    _LIBCPP_INLINE_VISIBILITY explicit logic_error(const char* __s) : exception(__s) {}
+#endif
+};
+
+class _LIBCPP_EXCEPTION_ABI runtime_error
+    : public exception
+{
+#ifndef _LIBCPP_ABI_VCRUNTIME
+private:
+    _VSTD::__libcpp_refstring __imp_;
+public:
+    explicit runtime_error(const string&);
+    explicit runtime_error(const char*);
+
+    runtime_error(const runtime_error&) _NOEXCEPT;
+    runtime_error& operator=(const runtime_error&) _NOEXCEPT;
+
+    ~runtime_error() _NOEXCEPT override;
+
+    const char* what() const _NOEXCEPT override;
+#else
+public:
+   explicit runtime_error(const _VSTD::string&); // Symbol uses versioned std::string
+   _LIBCPP_INLINE_VISIBILITY explicit runtime_error(const char* __s) : exception(__s) {}
+#endif // _LIBCPP_ABI_VCRUNTIME
+};
+
+class _LIBCPP_EXCEPTION_ABI domain_error
+    : public logic_error
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit domain_error(const string& __s) : logic_error(__s) {}
+    _LIBCPP_INLINE_VISIBILITY explicit domain_error(const char* __s)   : logic_error(__s) {}
+
+#ifndef _LIBCPP_ABI_VCRUNTIME
+    domain_error(const domain_error&) _NOEXCEPT = default;
+    ~domain_error() _NOEXCEPT override;
+#endif
+};
+
+class _LIBCPP_EXCEPTION_ABI invalid_argument
+    : public logic_error
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit invalid_argument(const string& __s) : logic_error(__s) {}
+    _LIBCPP_INLINE_VISIBILITY explicit invalid_argument(const char* __s)   : logic_error(__s) {}
+
+#ifndef _LIBCPP_ABI_VCRUNTIME
+    invalid_argument(const invalid_argument&) _NOEXCEPT = default;
+    ~invalid_argument() _NOEXCEPT override;
+#endif
+};
+
+class _LIBCPP_EXCEPTION_ABI length_error
+    : public logic_error
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit length_error(const string& __s) : logic_error(__s) {}
+    _LIBCPP_INLINE_VISIBILITY explicit length_error(const char* __s)   : logic_error(__s) {}
+#ifndef _LIBCPP_ABI_VCRUNTIME
+    length_error(const length_error&) _NOEXCEPT = default;
+    ~length_error() _NOEXCEPT override;
+#endif
+};
+
+class _LIBCPP_EXCEPTION_ABI out_of_range
+    : public logic_error
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit out_of_range(const string& __s) : logic_error(__s) {}
+    _LIBCPP_INLINE_VISIBILITY explicit out_of_range(const char* __s)   : logic_error(__s) {}
+
+#ifndef _LIBCPP_ABI_VCRUNTIME
+    out_of_range(const out_of_range&) _NOEXCEPT = default;
+    ~out_of_range() _NOEXCEPT override;
+#endif
+};
+
+class _LIBCPP_EXCEPTION_ABI range_error
+    : public runtime_error
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit range_error(const string& __s) : runtime_error(__s) {}
+    _LIBCPP_INLINE_VISIBILITY explicit range_error(const char* __s)   : runtime_error(__s) {}
+
+#ifndef _LIBCPP_ABI_VCRUNTIME
+    range_error(const range_error&) _NOEXCEPT = default;
+    ~range_error() _NOEXCEPT override;
+#endif
+};
+
+class _LIBCPP_EXCEPTION_ABI overflow_error
+    : public runtime_error
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit overflow_error(const string& __s) : runtime_error(__s) {}
+    _LIBCPP_INLINE_VISIBILITY explicit overflow_error(const char* __s)   : runtime_error(__s) {}
+
+#ifndef _LIBCPP_ABI_VCRUNTIME
+    overflow_error(const overflow_error&) _NOEXCEPT = default;
+    ~overflow_error() _NOEXCEPT override;
+#endif
+};
+
+class _LIBCPP_EXCEPTION_ABI underflow_error
+    : public runtime_error
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY explicit underflow_error(const string& __s) : runtime_error(__s) {}
+    _LIBCPP_INLINE_VISIBILITY explicit underflow_error(const char* __s)   : runtime_error(__s) {}
+
+#ifndef _LIBCPP_ABI_VCRUNTIME
+    underflow_error(const underflow_error&) _NOEXCEPT = default;
+    ~underflow_error() _NOEXCEPT override;
+#endif
+};
+
+} // namespace std
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// in the dylib
+_LIBCPP_NORETURN _LIBCPP_FUNC_VIS void __throw_runtime_error(const char*);
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_logic_error(const char*__msg)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw logic_error(__msg);
+#else
+    ((void)__msg);
+    _VSTD::abort();
+#endif
+}
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_domain_error(const char*__msg)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw domain_error(__msg);
+#else
+    ((void)__msg);
+    _VSTD::abort();
+#endif
+}
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_invalid_argument(const char*__msg)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw invalid_argument(__msg);
+#else
+    ((void)__msg);
+    _VSTD::abort();
+#endif
+}
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_length_error(const char*__msg)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw length_error(__msg);
+#else
+    ((void)__msg);
+    _VSTD::abort();
+#endif
+}
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_out_of_range(const char*__msg)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw out_of_range(__msg);
+#else
+    ((void)__msg);
+    _VSTD::abort();
+#endif
+}
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_range_error(const char*__msg)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw range_error(__msg);
+#else
+    ((void)__msg);
+    _VSTD::abort();
+#endif
+}
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_overflow_error(const char*__msg)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw overflow_error(__msg);
+#else
+    ((void)__msg);
+    _VSTD::abort();
+#endif
+}
+
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_underflow_error(const char*__msg)
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw underflow_error(__msg);
+#else
+    ((void)__msg);
+    _VSTD::abort();
+#endif
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STDEXCEPT
diff --git a/app/src/main/cpp/libcxx/include/stdint.h b/app/src/main/cpp/libcxx/include/stdint.h
new file mode 100644
index 0000000..fa7b011
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/stdint.h
@@ -0,0 +1,127 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_STDINT_H
+// AIX system headers need stdint.h to be re-enterable while _STD_TYPES_T
+// is defined until an inclusion of it without _STD_TYPES_T occurs, in which
+// case the header guard macro is defined.
+#if !defined(_AIX) || !defined(_STD_TYPES_T)
+#define _LIBCPP_STDINT_H
+#endif // _STD_TYPES_T
+
+/*
+    stdint.h synopsis
+
+Macros:
+
+    INT8_MIN
+    INT16_MIN
+    INT32_MIN
+    INT64_MIN
+
+    INT8_MAX
+    INT16_MAX
+    INT32_MAX
+    INT64_MAX
+
+    UINT8_MAX
+    UINT16_MAX
+    UINT32_MAX
+    UINT64_MAX
+
+    INT_LEAST8_MIN
+    INT_LEAST16_MIN
+    INT_LEAST32_MIN
+    INT_LEAST64_MIN
+
+    INT_LEAST8_MAX
+    INT_LEAST16_MAX
+    INT_LEAST32_MAX
+    INT_LEAST64_MAX
+
+    UINT_LEAST8_MAX
+    UINT_LEAST16_MAX
+    UINT_LEAST32_MAX
+    UINT_LEAST64_MAX
+
+    INT_FAST8_MIN
+    INT_FAST16_MIN
+    INT_FAST32_MIN
+    INT_FAST64_MIN
+
+    INT_FAST8_MAX
+    INT_FAST16_MAX
+    INT_FAST32_MAX
+    INT_FAST64_MAX
+
+    UINT_FAST8_MAX
+    UINT_FAST16_MAX
+    UINT_FAST32_MAX
+    UINT_FAST64_MAX
+
+    INTPTR_MIN
+    INTPTR_MAX
+    UINTPTR_MAX
+
+    INTMAX_MIN
+    INTMAX_MAX
+
+    UINTMAX_MAX
+
+    PTRDIFF_MIN
+    PTRDIFF_MAX
+
+    SIG_ATOMIC_MIN
+    SIG_ATOMIC_MAX
+
+    SIZE_MAX
+
+    WCHAR_MIN
+    WCHAR_MAX
+
+    WINT_MIN
+    WINT_MAX
+
+    INT8_C(value)
+    INT16_C(value)
+    INT32_C(value)
+    INT64_C(value)
+
+    UINT8_C(value)
+    UINT16_C(value)
+    UINT32_C(value)
+    UINT64_C(value)
+
+    INTMAX_C(value)
+    UINTMAX_C(value)
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+/* C99 stdlib (e.g. glibc < 2.18) does not provide macros needed
+   for C++11 unless __STDC_LIMIT_MACROS and __STDC_CONSTANT_MACROS
+   are defined
+*/
+#if defined(__cplusplus) && !defined(__STDC_LIMIT_MACROS)
+#   define __STDC_LIMIT_MACROS
+#endif
+#if defined(__cplusplus) && !defined(__STDC_CONSTANT_MACROS)
+#   define __STDC_CONSTANT_MACROS
+#endif
+
+#if __has_include_next(<stdint.h>)
+#  include_next <stdint.h>
+#endif
+
+#endif // _LIBCPP_STDINT_H
diff --git a/app/src/main/cpp/libcxx/include/stdio.h b/app/src/main/cpp/libcxx/include/stdio.h
new file mode 100644
index 0000000..cea43aa
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/stdio.h
@@ -0,0 +1,121 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#if defined(__need_FILE) || defined(__need___FILE)
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#include_next <stdio.h>
+
+#elif !defined(_LIBCPP_STDIO_H)
+#define _LIBCPP_STDIO_H
+
+/*
+    stdio.h synopsis
+
+Macros:
+
+    BUFSIZ
+    EOF
+    FILENAME_MAX
+    FOPEN_MAX
+    L_tmpnam
+    NULL
+    SEEK_CUR
+    SEEK_END
+    SEEK_SET
+    TMP_MAX
+    _IOFBF
+    _IOLBF
+    _IONBF
+    stderr
+    stdin
+    stdout
+
+Types:
+
+FILE
+fpos_t
+size_t
+
+int remove(const char* filename);
+int rename(const char* old, const char* new);
+FILE* tmpfile(void);
+char* tmpnam(char* s);
+int fclose(FILE* stream);
+int fflush(FILE* stream);
+FILE* fopen(const char* restrict filename, const char* restrict mode);
+FILE* freopen(const char* restrict filename, const char * restrict mode,
+              FILE * restrict stream);
+void setbuf(FILE* restrict stream, char* restrict buf);
+int setvbuf(FILE* restrict stream, char* restrict buf, int mode, size_t size);
+int fprintf(FILE* restrict stream, const char* restrict format, ...);
+int fscanf(FILE* restrict stream, const char * restrict format, ...);
+int printf(const char* restrict format, ...);
+int scanf(const char* restrict format, ...);
+int snprintf(char* restrict s, size_t n, const char* restrict format, ...);    // C99
+int sprintf(char* restrict s, const char* restrict format, ...);
+int sscanf(const char* restrict s, const char* restrict format, ...);
+int vfprintf(FILE* restrict stream, const char* restrict format, va_list arg);
+int vfscanf(FILE* restrict stream, const char* restrict format, va_list arg);  // C99
+int vprintf(const char* restrict format, va_list arg);
+int vscanf(const char* restrict format, va_list arg);                          // C99
+int vsnprintf(char* restrict s, size_t n, const char* restrict format,         // C99
+              va_list arg);
+int vsprintf(char* restrict s, const char* restrict format, va_list arg);
+int vsscanf(const char* restrict s, const char* restrict format, va_list arg); // C99
+int fgetc(FILE* stream);
+char* fgets(char* restrict s, int n, FILE* restrict stream);
+int fputc(int c, FILE* stream);
+int fputs(const char* restrict s, FILE* restrict stream);
+int getc(FILE* stream);
+int getchar(void);
+char* gets(char* s);  // removed in C++14
+int putc(int c, FILE* stream);
+int putchar(int c);
+int puts(const char* s);
+int ungetc(int c, FILE* stream);
+size_t fread(void* restrict ptr, size_t size, size_t nmemb,
+             FILE* restrict stream);
+size_t fwrite(const void* restrict ptr, size_t size, size_t nmemb,
+              FILE* restrict stream);
+int fgetpos(FILE* restrict stream, fpos_t* restrict pos);
+int fseek(FILE* stream, long offset, int whence);
+int fsetpos(FILE*stream, const fpos_t* pos);
+long ftell(FILE* stream);
+void rewind(FILE* stream);
+void clearerr(FILE* stream);
+int feof(FILE* stream);
+int ferror(FILE* stream);
+void perror(const char* s);
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#  if __has_include_next(<stdio.h>)
+#    include_next <stdio.h>
+#  endif
+
+#ifdef __cplusplus
+
+#undef getc
+#undef putc
+#undef clearerr
+#undef feof
+#undef ferror
+
+#endif
+
+#endif // _LIBCPP_STDIO_H
diff --git a/app/src/main/cpp/libcxx/include/stdlib.h b/app/src/main/cpp/libcxx/include/stdlib.h
new file mode 100644
index 0000000..4dd3a9c
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/stdlib.h
@@ -0,0 +1,163 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#if defined(__need_malloc_and_calloc)
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#include_next <stdlib.h>
+
+#elif !defined(_LIBCPP_STDLIB_H)
+#define _LIBCPP_STDLIB_H
+
+/*
+    stdlib.h synopsis
+
+Macros:
+
+    EXIT_FAILURE
+    EXIT_SUCCESS
+    MB_CUR_MAX
+    NULL
+    RAND_MAX
+
+Types:
+
+    size_t
+    div_t
+    ldiv_t
+    lldiv_t                                                               // C99
+
+double    atof (const char* nptr);
+int       atoi (const char* nptr);
+long      atol (const char* nptr);
+long long atoll(const char* nptr);                                        // C99
+double             strtod  (const char* restrict nptr, char** restrict endptr);
+float              strtof  (const char* restrict nptr, char** restrict endptr); // C99
+long double        strtold (const char* restrict nptr, char** restrict endptr); // C99
+long               strtol  (const char* restrict nptr, char** restrict endptr, int base);
+long long          strtoll (const char* restrict nptr, char** restrict endptr, int base); // C99
+unsigned long      strtoul (const char* restrict nptr, char** restrict endptr, int base);
+unsigned long long strtoull(const char* restrict nptr, char** restrict endptr, int base); // C99
+int rand(void);
+void srand(unsigned int seed);
+void* calloc(size_t nmemb, size_t size);
+void free(void* ptr);
+void* malloc(size_t size);
+void* realloc(void* ptr, size_t size);
+void abort(void);
+int atexit(void (*func)(void));
+void exit(int status);
+void _Exit(int status);
+char* getenv(const char* name);
+int system(const char* string);
+void* bsearch(const void* key, const void* base, size_t nmemb, size_t size,
+              int (*compar)(const void *, const void *));
+void qsort(void* base, size_t nmemb, size_t size,
+           int (*compar)(const void *, const void *));
+int         abs(      int j);
+long        abs(     long j);
+long long   abs(long long j);                                             // C++0X
+long       labs(     long j);
+long long llabs(long long j);                                             // C99
+div_t     div(      int numer,       int denom);
+ldiv_t    div(     long numer,      long denom);
+lldiv_t   div(long long numer, long long denom);                          // C++0X
+ldiv_t   ldiv(     long numer,      long denom);
+lldiv_t lldiv(long long numer, long long denom);                          // C99
+int mblen(const char* s, size_t n);
+int mbtowc(wchar_t* restrict pwc, const char* restrict s, size_t n);
+int wctomb(char* s, wchar_t wchar);
+size_t mbstowcs(wchar_t* restrict pwcs, const char* restrict s, size_t n);
+size_t wcstombs(char* restrict s, const wchar_t* restrict pwcs, size_t n);
+int at_quick_exit(void (*func)(void))                                     // C++11
+void quick_exit(int status);                                              // C++11
+void *aligned_alloc(size_t alignment, size_t size);                       // C11
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#  if __has_include_next(<stdlib.h>)
+#    include_next <stdlib.h>
+#  endif
+
+#ifdef __cplusplus
+extern "C++" {
+// abs
+
+#ifdef abs
+# undef abs
+#endif
+#ifdef labs
+# undef labs
+#endif
+#ifdef llabs
+# undef llabs
+#endif
+
+// MSVCRT already has the correct prototype in <stdlib.h> if __cplusplus is defined
+#if !defined(_LIBCPP_MSVCRT) && !defined(__sun__)
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY long abs(long __x) _NOEXCEPT {
+  return __builtin_labs(__x);
+}
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY long long abs(long long __x) _NOEXCEPT {
+  return __builtin_llabs(__x);
+}
+#endif // !defined(_LIBCPP_MSVCRT) && !defined(__sun__)
+
+#if !defined(__sun__)
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY float abs(float __lcpp_x) _NOEXCEPT {
+  return __builtin_fabsf(__lcpp_x); // Use builtins to prevent needing math.h
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY double abs(double __lcpp_x) _NOEXCEPT {
+  return __builtin_fabs(__lcpp_x);
+}
+
+_LIBCPP_NODISCARD_EXT inline _LIBCPP_INLINE_VISIBILITY long double
+abs(long double __lcpp_x) _NOEXCEPT {
+  return __builtin_fabsl(__lcpp_x);
+}
+#endif // !defined(__sun__)
+
+// div
+
+#ifdef div
+# undef div
+#endif
+#ifdef ldiv
+# undef ldiv
+#endif
+#ifdef lldiv
+# undef lldiv
+#endif
+
+// MSVCRT already has the correct prototype in <stdlib.h> if __cplusplus is defined
+#if !defined(_LIBCPP_MSVCRT) && !defined(__sun__)
+inline _LIBCPP_INLINE_VISIBILITY ldiv_t div(long __x, long __y) _NOEXCEPT {
+  return ::ldiv(__x, __y);
+}
+#if !(defined(__FreeBSD__) && !defined(__LONG_LONG_SUPPORTED))
+inline _LIBCPP_INLINE_VISIBILITY lldiv_t div(long long __x,
+                                             long long __y) _NOEXCEPT {
+  return ::lldiv(__x, __y);
+}
+#endif
+#endif // _LIBCPP_MSVCRT / __sun__
+} // extern "C++"
+#endif // __cplusplus
+
+#endif // _LIBCPP_STDLIB_H
diff --git a/app/src/main/cpp/libcxx/include/streambuf b/app/src/main/cpp/libcxx/include/streambuf
new file mode 100644
index 0000000..d473df1
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/streambuf
@@ -0,0 +1,503 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_STREAMBUF
+#define _LIBCPP_STREAMBUF
+
+/*
+    streambuf synopsis
+
+namespace std
+{
+
+template <class charT, class traits = char_traits<charT> >
+class basic_streambuf
+{
+public:
+    // types:
+    typedef charT char_type;
+    typedef traits traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    virtual ~basic_streambuf();
+
+    // 27.6.2.2.1 locales:
+    locale pubimbue(const locale& loc);
+    locale getloc() const;
+
+    // 27.6.2.2.2 buffer and positioning:
+    basic_streambuf* pubsetbuf(char_type* s, streamsize n);
+    pos_type pubseekoff(off_type off, ios_base::seekdir way,
+                        ios_base::openmode which = ios_base::in | ios_base::out);
+    pos_type pubseekpos(pos_type sp,
+                        ios_base::openmode which = ios_base::in | ios_base::out);
+    int pubsync();
+
+    // Get and put areas:
+    // 27.6.2.2.3 Get area:
+    streamsize in_avail();
+    int_type snextc();
+    int_type sbumpc();
+    int_type sgetc();
+    streamsize sgetn(char_type* s, streamsize n);
+
+    // 27.6.2.2.4 Putback:
+    int_type sputbackc(char_type c);
+    int_type sungetc();
+
+    // 27.6.2.2.5 Put area:
+    int_type sputc(char_type c);
+    streamsize sputn(const char_type* s, streamsize n);
+
+protected:
+    basic_streambuf();
+    basic_streambuf(const basic_streambuf& rhs);
+    basic_streambuf& operator=(const basic_streambuf& rhs);
+    void swap(basic_streambuf& rhs);
+
+    // 27.6.2.3.2 Get area:
+    char_type* eback() const;
+    char_type* gptr() const;
+    char_type* egptr() const;
+    void gbump(int n);
+    void setg(char_type* gbeg, char_type* gnext, char_type* gend);
+
+    // 27.6.2.3.3 Put area:
+    char_type* pbase() const;
+    char_type* pptr() const;
+    char_type* epptr() const;
+    void pbump(int n);
+    void setp(char_type* pbeg, char_type* pend);
+
+    // 27.6.2.4 virtual functions:
+    // 27.6.2.4.1 Locales:
+    virtual void imbue(const locale& loc);
+
+    // 27.6.2.4.2 Buffer management and positioning:
+    virtual basic_streambuf* setbuf(char_type* s, streamsize n);
+    virtual pos_type seekoff(off_type off, ios_base::seekdir way,
+                             ios_base::openmode which = ios_base::in | ios_base::out);
+    virtual pos_type seekpos(pos_type sp,
+                             ios_base::openmode which = ios_base::in | ios_base::out);
+    virtual int sync();
+
+    // 27.6.2.4.3 Get area:
+    virtual streamsize showmanyc();
+    virtual streamsize xsgetn(char_type* s, streamsize n);
+    virtual int_type underflow();
+    virtual int_type uflow();
+
+    // 27.6.2.4.4 Putback:
+    virtual int_type pbackfail(int_type c = traits_type::eof());
+
+    // 27.6.2.4.5 Put area:
+    virtual streamsize xsputn(const char_type* s, streamsize n);
+    virtual int_type overflow (int_type c = traits_type::eof());
+};
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <cstdint>
+#include <ios>
+#include <iosfwd>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _CharT, class _Traits>
+class _LIBCPP_TEMPLATE_VIS basic_streambuf
+{
+public:
+    // types:
+    typedef _CharT                         char_type;
+    typedef _Traits                        traits_type;
+    typedef typename traits_type::int_type int_type;
+    typedef typename traits_type::pos_type pos_type;
+    typedef typename traits_type::off_type off_type;
+
+    static_assert((is_same<_CharT, typename traits_type::char_type>::value),
+                  "traits_type::char_type must be the same type as CharT");
+
+    virtual ~basic_streambuf();
+
+    // 27.6.2.2.1 locales:
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    locale pubimbue(const locale& __loc) {
+        imbue(__loc);
+        locale __r = __loc_;
+        __loc_ = __loc;
+        return __r;
+    }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    locale getloc() const { return __loc_; }
+
+    // 27.6.2.2.2 buffer and positioning:
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    basic_streambuf* pubsetbuf(char_type* __s, streamsize __n)
+    { return setbuf(__s, __n); }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    pos_type pubseekoff(off_type __off, ios_base::seekdir __way,
+                        ios_base::openmode __which = ios_base::in | ios_base::out)
+    { return seekoff(__off, __way, __which); }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    pos_type pubseekpos(pos_type __sp,
+                        ios_base::openmode __which = ios_base::in | ios_base::out)
+    { return seekpos(__sp, __which); }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    int pubsync() { return sync(); }
+
+    // Get and put areas:
+    // 27.6.2.2.3 Get area:
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    streamsize in_avail() {
+        if (__ninp_ < __einp_)
+            return static_cast<streamsize>(__einp_ - __ninp_);
+        return showmanyc();
+    }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    int_type snextc() {
+        if (sbumpc() == traits_type::eof())
+            return traits_type::eof();
+        return sgetc();
+    }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    int_type sbumpc() {
+        if (__ninp_ == __einp_)
+            return uflow();
+        return traits_type::to_int_type(*__ninp_++);
+    }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    int_type sgetc() {
+        if (__ninp_ == __einp_)
+            return underflow();
+        return traits_type::to_int_type(*__ninp_);
+    }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    streamsize sgetn(char_type* __s, streamsize __n)
+    { return xsgetn(__s, __n); }
+
+    // 27.6.2.2.4 Putback:
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    int_type sputbackc(char_type __c) {
+        if (__binp_ == __ninp_ || !traits_type::eq(__c, __ninp_[-1]))
+            return pbackfail(traits_type::to_int_type(__c));
+        return traits_type::to_int_type(*--__ninp_);
+    }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    int_type sungetc() {
+        if (__binp_ == __ninp_)
+          return pbackfail();
+        return traits_type::to_int_type(*--__ninp_);
+    }
+
+    // 27.6.2.2.5 Put area:
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    int_type sputc(char_type __c) {
+        if (__nout_ == __eout_)
+            return overflow(traits_type::to_int_type(__c));
+        *__nout_++ = __c;
+        return traits_type::to_int_type(__c);
+    }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    streamsize sputn(const char_type* __s, streamsize __n)
+    { return xsputn(__s, __n); }
+
+protected:
+    basic_streambuf();
+    basic_streambuf(const basic_streambuf& __rhs);
+    basic_streambuf& operator=(const basic_streambuf& __rhs);
+    void swap(basic_streambuf& __rhs);
+
+    // 27.6.2.3.2 Get area:
+    _LIBCPP_INLINE_VISIBILITY char_type* eback() const {return __binp_;}
+    _LIBCPP_INLINE_VISIBILITY char_type* gptr()  const {return __ninp_;}
+    _LIBCPP_INLINE_VISIBILITY char_type* egptr() const {return __einp_;}
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    void gbump(int __n) { __ninp_ += __n; }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    void setg(char_type* __gbeg, char_type* __gnext, char_type* __gend) {
+        __binp_ = __gbeg;
+        __ninp_ = __gnext;
+        __einp_ = __gend;
+    }
+
+    // 27.6.2.3.3 Put area:
+    _LIBCPP_INLINE_VISIBILITY char_type* pbase() const {return __bout_;}
+    _LIBCPP_INLINE_VISIBILITY char_type* pptr()  const {return __nout_;}
+    _LIBCPP_INLINE_VISIBILITY char_type* epptr() const {return __eout_;}
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    void pbump(int __n) { __nout_ += __n; }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __pbump(streamsize __n) { __nout_ += __n; }
+
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    void setp(char_type* __pbeg, char_type* __pend) {
+        __bout_ = __nout_ = __pbeg;
+        __eout_ = __pend;
+    }
+
+    // 27.6.2.4 virtual functions:
+    // 27.6.2.4.1 Locales:
+    virtual void imbue(const locale& __loc);
+
+    // 27.6.2.4.2 Buffer management and positioning:
+    virtual basic_streambuf* setbuf(char_type* __s, streamsize __n);
+    virtual pos_type seekoff(off_type __off, ios_base::seekdir __way,
+                             ios_base::openmode __which = ios_base::in | ios_base::out);
+    virtual pos_type seekpos(pos_type __sp,
+                             ios_base::openmode __which = ios_base::in | ios_base::out);
+    virtual int sync();
+
+    // 27.6.2.4.3 Get area:
+    virtual streamsize showmanyc();
+    virtual streamsize xsgetn(char_type* __s, streamsize __n);
+    virtual int_type underflow();
+    virtual int_type uflow();
+
+    // 27.6.2.4.4 Putback:
+    virtual int_type pbackfail(int_type __c = traits_type::eof());
+
+    // 27.6.2.4.5 Put area:
+    virtual streamsize xsputn(const char_type* __s, streamsize __n);
+    virtual int_type overflow(int_type __c = traits_type::eof());
+
+private:
+    locale __loc_;
+    char_type* __binp_;
+    char_type* __ninp_;
+    char_type* __einp_;
+    char_type* __bout_;
+    char_type* __nout_;
+    char_type* __eout_;
+};
+
+template <class _CharT, class _Traits>
+basic_streambuf<_CharT, _Traits>::~basic_streambuf()
+{
+}
+
+template <class _CharT, class _Traits>
+basic_streambuf<_CharT, _Traits>::basic_streambuf()
+    : __binp_(nullptr),
+      __ninp_(nullptr),
+      __einp_(nullptr),
+      __bout_(nullptr),
+      __nout_(nullptr),
+      __eout_(nullptr)
+{
+}
+
+template <class _CharT, class _Traits>
+basic_streambuf<_CharT, _Traits>::basic_streambuf(const basic_streambuf& __sb)
+    : __loc_(__sb.__loc_),
+      __binp_(__sb.__binp_),
+      __ninp_(__sb.__ninp_),
+      __einp_(__sb.__einp_),
+      __bout_(__sb.__bout_),
+      __nout_(__sb.__nout_),
+      __eout_(__sb.__eout_)
+{
+}
+
+template <class _CharT, class _Traits>
+basic_streambuf<_CharT, _Traits>&
+basic_streambuf<_CharT, _Traits>::operator=(const basic_streambuf& __sb)
+{
+    __loc_ = __sb.__loc_;
+    __binp_ = __sb.__binp_;
+    __ninp_ = __sb.__ninp_;
+    __einp_ = __sb.__einp_;
+    __bout_ = __sb.__bout_;
+    __nout_ = __sb.__nout_;
+    __eout_ = __sb.__eout_;
+    return *this;
+}
+
+template <class _CharT, class _Traits>
+void
+basic_streambuf<_CharT, _Traits>::swap(basic_streambuf& __sb)
+{
+    _VSTD::swap(__loc_, __sb.__loc_);
+    _VSTD::swap(__binp_, __sb.__binp_);
+    _VSTD::swap(__ninp_, __sb.__ninp_);
+    _VSTD::swap(__einp_, __sb.__einp_);
+    _VSTD::swap(__bout_, __sb.__bout_);
+    _VSTD::swap(__nout_, __sb.__nout_);
+    _VSTD::swap(__eout_, __sb.__eout_);
+}
+
+template <class _CharT, class _Traits>
+void
+basic_streambuf<_CharT, _Traits>::imbue(const locale&)
+{
+}
+
+template <class _CharT, class _Traits>
+basic_streambuf<_CharT, _Traits>*
+basic_streambuf<_CharT, _Traits>::setbuf(char_type*, streamsize)
+{
+    return this;
+}
+
+template <class _CharT, class _Traits>
+typename basic_streambuf<_CharT, _Traits>::pos_type
+basic_streambuf<_CharT, _Traits>::seekoff(off_type, ios_base::seekdir,
+                                          ios_base::openmode)
+{
+    return pos_type(off_type(-1));
+}
+
+template <class _CharT, class _Traits>
+typename basic_streambuf<_CharT, _Traits>::pos_type
+basic_streambuf<_CharT, _Traits>::seekpos(pos_type, ios_base::openmode)
+{
+    return pos_type(off_type(-1));
+}
+
+template <class _CharT, class _Traits>
+int
+basic_streambuf<_CharT, _Traits>::sync()
+{
+    return 0;
+}
+
+template <class _CharT, class _Traits>
+streamsize
+basic_streambuf<_CharT, _Traits>::showmanyc()
+{
+    return 0;
+}
+
+template <class _CharT, class _Traits>
+streamsize
+basic_streambuf<_CharT, _Traits>::xsgetn(char_type* __s, streamsize __n)
+{
+    const int_type __eof = traits_type::eof();
+    int_type __c;
+    streamsize __i = 0;
+    while(__i < __n)
+    {
+        if (__ninp_ < __einp_)
+        {
+            const streamsize __len = _VSTD::min(static_cast<streamsize>(INT_MAX),
+                                _VSTD::min(__einp_ - __ninp_, __n - __i));
+            traits_type::copy(__s, __ninp_, __len);
+            __s +=  __len;
+            __i +=  __len;
+            this->gbump(__len);
+        }
+        else if ((__c = uflow()) != __eof)
+        {
+            *__s = traits_type::to_char_type(__c);
+            ++__s;
+            ++__i;
+        }
+        else
+            break;
+    }
+    return __i;
+}
+
+template <class _CharT, class _Traits>
+typename basic_streambuf<_CharT, _Traits>::int_type
+basic_streambuf<_CharT, _Traits>::underflow()
+{
+    return traits_type::eof();
+}
+
+template <class _CharT, class _Traits>
+typename basic_streambuf<_CharT, _Traits>::int_type
+basic_streambuf<_CharT, _Traits>::uflow()
+{
+    if (underflow() == traits_type::eof())
+        return traits_type::eof();
+    return traits_type::to_int_type(*__ninp_++);
+}
+
+template <class _CharT, class _Traits>
+typename basic_streambuf<_CharT, _Traits>::int_type
+basic_streambuf<_CharT, _Traits>::pbackfail(int_type)
+{
+    return traits_type::eof();
+}
+
+template <class _CharT, class _Traits>
+streamsize
+basic_streambuf<_CharT, _Traits>::xsputn(const char_type* __s, streamsize __n)
+{
+    streamsize __i = 0;
+    int_type __eof = traits_type::eof();
+    while( __i < __n)
+    {
+        if (__nout_ >= __eout_)
+        {
+            if (overflow(traits_type::to_int_type(*__s)) == __eof)
+                break;
+            ++__s;
+            ++__i;
+        }
+        else
+        {
+            streamsize __chunk_size = _VSTD::min(__eout_ - __nout_, __n - __i);
+            traits_type::copy(__nout_, __s, __chunk_size);
+            __nout_ += __chunk_size;
+            __s     += __chunk_size;
+            __i     += __chunk_size;
+        }
+    }
+    return __i;
+}
+
+template <class _CharT, class _Traits>
+typename basic_streambuf<_CharT, _Traits>::int_type
+basic_streambuf<_CharT, _Traits>::overflow(int_type)
+{
+    return traits_type::eof();
+}
+
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_streambuf<char>;
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_ios<char>;
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_streambuf<wchar_t>;
+extern template class _LIBCPP_EXTERN_TEMPLATE_TYPE_VIS basic_ios<wchar_t>;
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#endif // _LIBCPP_STREAMBUF
diff --git a/app/src/main/cpp/libcxx/include/string b/app/src/main/cpp/libcxx/include/string
new file mode 100644
index 0000000..9f5838d
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/string
@@ -0,0 +1,4633 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_STRING
+#define _LIBCPP_STRING
+
+/*
+    string synopsis
+
+#include <compare>
+#include <initializer_list>
+
+namespace std
+{
+
+template <class stateT>
+class fpos
+{
+private:
+    stateT st;
+public:
+    fpos(streamoff = streamoff());
+
+    operator streamoff() const;
+
+    stateT state() const;
+    void state(stateT);
+
+    fpos& operator+=(streamoff);
+    fpos  operator+ (streamoff) const;
+    fpos& operator-=(streamoff);
+    fpos  operator- (streamoff) const;
+};
+
+template <class stateT> streamoff operator-(const fpos<stateT>& x, const fpos<stateT>& y);
+
+template <class stateT> bool operator==(const fpos<stateT>& x, const fpos<stateT>& y);
+template <class stateT> bool operator!=(const fpos<stateT>& x, const fpos<stateT>& y);
+
+template <class charT>
+struct char_traits
+{
+    using char_type           = charT;
+    using int_type            = ...;
+    using off_type            = streamoff;
+    using pos_type            = streampos;
+    using state_type          = mbstate_t;
+    using comparison_category = strong_ordering; // Since C++20 only for the specializations
+                                                 // char, wchar_t, char8_t, char16_t, and char32_t.
+
+    static void assign(char_type& c1, const char_type& c2) noexcept;
+    static constexpr bool eq(char_type c1, char_type c2) noexcept;
+    static constexpr bool lt(char_type c1, char_type c2) noexcept;
+
+    static int              compare(const char_type* s1, const char_type* s2, size_t n);
+    static size_t           length(const char_type* s);
+    static const char_type* find(const char_type* s, size_t n, const char_type& a);
+    static char_type*       move(char_type* s1, const char_type* s2, size_t n);
+    static char_type*       copy(char_type* s1, const char_type* s2, size_t n);
+    static char_type*       assign(char_type* s, size_t n, char_type a);
+
+    static constexpr int_type  not_eof(int_type c) noexcept;
+    static constexpr char_type to_char_type(int_type c) noexcept;
+    static constexpr int_type  to_int_type(char_type c) noexcept;
+    static constexpr bool      eq_int_type(int_type c1, int_type c2) noexcept;
+    static constexpr int_type  eof() noexcept;
+};
+
+template <> struct char_traits<char>;
+template <> struct char_traits<wchar_t>;
+template <> struct char_traits<char8_t>;  // C++20
+template <> struct char_traits<char16_t>;
+template <> struct char_traits<char32_t>;
+
+template<class charT, class traits = char_traits<charT>, class Allocator = allocator<charT> >
+class basic_string
+{
+public:
+// types:
+    typedef traits traits_type;
+    typedef typename traits_type::char_type value_type;
+    typedef Allocator allocator_type;
+    typedef typename allocator_type::size_type size_type;
+    typedef typename allocator_type::difference_type difference_type;
+    typedef typename allocator_type::reference reference;
+    typedef typename allocator_type::const_reference const_reference;
+    typedef typename allocator_type::pointer pointer;
+    typedef typename allocator_type::const_pointer const_pointer;
+    typedef implementation-defined iterator;
+    typedef implementation-defined const_iterator;
+    typedef std::reverse_iterator<iterator> reverse_iterator;
+    typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+
+    static const size_type npos = -1;
+
+    basic_string()
+        noexcept(is_nothrow_default_constructible<allocator_type>::value);                      // constexpr since C++20
+    explicit basic_string(const allocator_type& a);                                             // constexpr since C++20
+    basic_string(const basic_string& str);                                                      // constexpr since C++20
+    basic_string(basic_string&& str)
+        noexcept(is_nothrow_move_constructible<allocator_type>::value);                         // constexpr since C++20
+    basic_string(const basic_string& str, size_type pos,
+                 const allocator_type& a = allocator_type());                                   // constexpr since C++20
+    basic_string(const basic_string& str, size_type pos, size_type n,
+                 const Allocator& a = Allocator());                                             // constexpr since C++20
+    constexpr basic_string(
+        basic_string&& str, size_type pos, const Allocator& a = Allocator());                   // since C++23
+    constexpr basic_string(
+        basic_string&& str, size_type pos, size_type n, const Allocator& a = Allocator());      // since C++23
+    template<class T>
+        basic_string(const T& t, size_type pos, size_type n, const Allocator& a = Allocator()); // C++17, constexpr since C++20
+    template <class T>
+        explicit basic_string(const T& t, const Allocator& a = Allocator());                    // C++17, constexpr since C++20
+    basic_string(const value_type* s, const allocator_type& a = allocator_type());              // constexpr since C++20
+    basic_string(const value_type* s, size_type n, const allocator_type& a = allocator_type()); // constexpr since C++20
+    basic_string(nullptr_t) = delete; // C++2b
+    basic_string(size_type n, value_type c, const allocator_type& a = allocator_type());        // constexpr since C++20
+    template<class InputIterator>
+        basic_string(InputIterator begin, InputIterator end,
+                     const allocator_type& a = allocator_type());                               // constexpr since C++20
+    basic_string(initializer_list<value_type>, const Allocator& = Allocator());                 // constexpr since C++20
+    basic_string(const basic_string&, const Allocator&);                                        // constexpr since C++20
+    basic_string(basic_string&&, const Allocator&);                                             // constexpr since C++20
+
+    ~basic_string();                                                                            // constexpr since C++20
+
+    operator basic_string_view<charT, traits>() const noexcept;                                 // constexpr since C++20
+
+    basic_string& operator=(const basic_string& str);                                           // constexpr since C++20
+    template <class T>
+        basic_string& operator=(const T& t);                                                    // C++17, constexpr since C++20
+    basic_string& operator=(basic_string&& str)
+        noexcept(
+             allocator_type::propagate_on_container_move_assignment::value ||
+             allocator_type::is_always_equal::value );                                          // C++17, constexpr since C++20
+    basic_string& operator=(const value_type* s);                                               // constexpr since C++20
+    basic_string& operator=(nullptr_t) = delete; // C++2b
+    basic_string& operator=(value_type c);                                                      // constexpr since C++20
+    basic_string& operator=(initializer_list<value_type>);                                      // constexpr since C++20
+
+    iterator       begin() noexcept;                                                            // constexpr since C++20
+    const_iterator begin() const noexcept;                                                      // constexpr since C++20
+    iterator       end() noexcept;                                                              // constexpr since C++20
+    const_iterator end() const noexcept;                                                        // constexpr since C++20
+
+    reverse_iterator       rbegin() noexcept;                                                   // constexpr since C++20
+    const_reverse_iterator rbegin() const noexcept;                                             // constexpr since C++20
+    reverse_iterator       rend() noexcept;                                                     // constexpr since C++20
+    const_reverse_iterator rend() const noexcept;                                               // constexpr since C++20
+
+    const_iterator         cbegin() const noexcept;                                             // constexpr since C++20
+    const_iterator         cend() const noexcept;                                               // constexpr since C++20
+    const_reverse_iterator crbegin() const noexcept;                                            // constexpr since C++20
+    const_reverse_iterator crend() const noexcept;                                              // constexpr since C++20
+
+    size_type size() const noexcept;                                                            // constexpr since C++20
+    size_type length() const noexcept;                                                          // constexpr since C++20
+    size_type max_size() const noexcept;                                                        // constexpr since C++20
+    size_type capacity() const noexcept;                                                        // constexpr since C++20
+
+    void resize(size_type n, value_type c);                                                     // constexpr since C++20
+    void resize(size_type n);                                                                   // constexpr since C++20
+
+    template<class Operation>
+    constexpr void resize_and_overwrite(size_type n, Operation op); // since C++23
+
+    void reserve(size_type res_arg);                                                            // constexpr since C++20
+    void reserve(); // deprecated in C++20
+    void shrink_to_fit();                                                                       // constexpr since C++20
+    void clear() noexcept;                                                                      // constexpr since C++20
+    bool empty() const noexcept;                                                                // constexpr since C++20
+
+    const_reference operator[](size_type pos) const;                                            // constexpr since C++20
+    reference       operator[](size_type pos);                                                  // constexpr since C++20
+
+    const_reference at(size_type n) const;                                                      // constexpr since C++20
+    reference       at(size_type n);                                                            // constexpr since C++20
+
+    basic_string& operator+=(const basic_string& str);                                          // constexpr since C++20
+    template <class T>
+        basic_string& operator+=(const T& t);                                                   // C++17, constexpr since C++20
+    basic_string& operator+=(const value_type* s);                                              // constexpr since C++20
+    basic_string& operator+=(value_type c);                                                     // constexpr since C++20
+    basic_string& operator+=(initializer_list<value_type>);                                     // constexpr since C++20
+
+    basic_string& append(const basic_string& str);                                              // constexpr since C++20
+    template <class T>
+        basic_string& append(const T& t);                                                       // C++17, constexpr since C++20
+    basic_string& append(const basic_string& str, size_type pos, size_type n=npos);             // C++14, constexpr since C++20
+    template <class T>
+        basic_string& append(const T& t, size_type pos, size_type n=npos);                      // C++17, constexpr since C++20
+    basic_string& append(const value_type* s, size_type n);                                     // constexpr since C++20
+    basic_string& append(const value_type* s);                                                  // constexpr since C++20
+    basic_string& append(size_type n, value_type c);                                            // constexpr since C++20
+    template<class InputIterator>
+        basic_string& append(InputIterator first, InputIterator last);                          // constexpr since C++20
+    basic_string& append(initializer_list<value_type>);                                         // constexpr since C++20
+
+    void push_back(value_type c);                                                               // constexpr since C++20
+    void pop_back();                                                                            // constexpr since C++20
+    reference       front();                                                                    // constexpr since C++20
+    const_reference front() const;                                                              // constexpr since C++20
+    reference       back();                                                                     // constexpr since C++20
+    const_reference back() const;                                                               // constexpr since C++20
+
+    basic_string& assign(const basic_string& str);                                              // constexpr since C++20
+    template <class T>
+        basic_string& assign(const T& t);                                                       // C++17, constexpr since C++20
+    basic_string& assign(basic_string&& str);                                                   // constexpr since C++20
+    basic_string& assign(const basic_string& str, size_type pos, size_type n=npos);             // C++14, constexpr since C++20
+    template <class T>
+        basic_string& assign(const T& t, size_type pos, size_type n=npos);                      // C++17, constexpr since C++20
+    basic_string& assign(const value_type* s, size_type n);                                     // constexpr since C++20
+    basic_string& assign(const value_type* s);                                                  // constexpr since C++20
+    basic_string& assign(size_type n, value_type c);                                            // constexpr since C++20
+    template<class InputIterator>
+        basic_string& assign(InputIterator first, InputIterator last);                          // constexpr since C++20
+    basic_string& assign(initializer_list<value_type>);                                         // constexpr since C++20
+
+    basic_string& insert(size_type pos1, const basic_string& str);                              // constexpr since C++20
+    template <class T>
+        basic_string& insert(size_type pos1, const T& t);                                       // constexpr since C++20
+    basic_string& insert(size_type pos1, const basic_string& str,
+                         size_type pos2, size_type n);                                          // constexpr since C++20
+    template <class T>
+        basic_string& insert(size_type pos1, const T& t, size_type pos2, size_type n);          // C++17, constexpr since C++20
+    basic_string& insert(size_type pos, const value_type* s, size_type n=npos);                 // C++14, constexpr since C++20
+    basic_string& insert(size_type pos, const value_type* s);                                   // constexpr since C++20
+    basic_string& insert(size_type pos, size_type n, value_type c);                             // constexpr since C++20
+    iterator      insert(const_iterator p, value_type c);                                       // constexpr since C++20
+    iterator      insert(const_iterator p, size_type n, value_type c);                          // constexpr since C++20
+    template<class InputIterator>
+        iterator insert(const_iterator p, InputIterator first, InputIterator last);             // constexpr since C++20
+    iterator      insert(const_iterator p, initializer_list<value_type>);                       // constexpr since C++20
+
+    basic_string& erase(size_type pos = 0, size_type n = npos);                                 // constexpr since C++20
+    iterator      erase(const_iterator position);                                               // constexpr since C++20
+    iterator      erase(const_iterator first, const_iterator last);                             // constexpr since C++20
+
+    basic_string& replace(size_type pos1, size_type n1, const basic_string& str);               // constexpr since C++20
+    template <class T>
+    basic_string& replace(size_type pos1, size_type n1, const T& t);                            // C++17, constexpr since C++20
+    basic_string& replace(size_type pos1, size_type n1, const basic_string& str,
+                          size_type pos2, size_type n2=npos);                                   // C++14, constexpr since C++20
+    template <class T>
+        basic_string& replace(size_type pos1, size_type n1, const T& t,
+                              size_type pos2, size_type n);                                     // C++17, constexpr since C++20
+    basic_string& replace(size_type pos, size_type n1, const value_type* s, size_type n2);      // constexpr since C++20
+    basic_string& replace(size_type pos, size_type n1, const value_type* s);                    // constexpr since C++20
+    basic_string& replace(size_type pos, size_type n1, size_type n2, value_type c);             // constexpr since C++20
+    basic_string& replace(const_iterator i1, const_iterator i2, const basic_string& str);       // constexpr since C++20
+    template <class T>
+        basic_string& replace(const_iterator i1, const_iterator i2, const T& t);                // C++17, constexpr since C++20
+    basic_string& replace(const_iterator i1, const_iterator i2, const value_type* s, size_type n); // constexpr since C++20
+    basic_string& replace(const_iterator i1, const_iterator i2, const value_type* s);           // constexpr since C++20
+    basic_string& replace(const_iterator i1, const_iterator i2, size_type n, value_type c);     // constexpr since C++20
+    template<class InputIterator>
+        basic_string& replace(const_iterator i1, const_iterator i2, InputIterator j1, InputIterator j2); // constexpr since C++20
+    basic_string& replace(const_iterator i1, const_iterator i2, initializer_list<value_type>);  // constexpr since C++20
+
+    size_type copy(value_type* s, size_type n, size_type pos = 0) const;                        // constexpr since C++20
+    basic_string substr(size_type pos = 0, size_type n = npos) const;                           // constexpr in C++20, removed in C++23
+    basic_string substr(size_type pos = 0, size_type n = npos) const&;                          // since C++23
+    constexpr basic_string substr(size_type pos = 0, size_type n = npos) &&;                    // since C++23
+    void swap(basic_string& str)
+        noexcept(allocator_traits<allocator_type>::propagate_on_container_swap::value ||
+                 allocator_traits<allocator_type>::is_always_equal::value);                     // C++17, constexpr since C++20
+
+    const value_type* c_str() const noexcept;                                                   // constexpr since C++20
+    const value_type* data() const noexcept;                                                    // constexpr since C++20
+          value_type* data()       noexcept;                                                    // C++17, constexpr since C++20
+
+    allocator_type get_allocator() const noexcept;                                              // constexpr since C++20
+
+    size_type find(const basic_string& str, size_type pos = 0) const noexcept;                  // constexpr since C++20
+    template <class T>
+        size_type find(const T& t, size_type pos = 0) const noexcept;                           // C++17, noexcept as an extension, constexpr since C++20
+    size_type find(const value_type* s, size_type pos, size_type n) const noexcept;             // constexpr since C++20
+    size_type find(const value_type* s, size_type pos = 0) const noexcept;                      // constexpr since C++20
+    size_type find(value_type c, size_type pos = 0) const noexcept;                             // constexpr since C++20
+
+    size_type rfind(const basic_string& str, size_type pos = npos) const noexcept;              // constexpr since C++20
+    template <class T>
+        size_type rfind(const T& t, size_type pos = npos) const noexcept;                       // C++17, noexcept as an extension, constexpr since C++20
+    size_type rfind(const value_type* s, size_type pos, size_type n) const noexcept;            // constexpr since C++20
+    size_type rfind(const value_type* s, size_type pos = npos) const noexcept;                  // constexpr since C++20
+    size_type rfind(value_type c, size_type pos = npos) const noexcept;                         // constexpr since C++20
+
+    size_type find_first_of(const basic_string& str, size_type pos = 0) const noexcept;         // constexpr since C++20
+    template <class T>
+        size_type find_first_of(const T& t, size_type pos = 0) const noexcept;                  // C++17, noexcept as an extension, constexpr since C++20
+    size_type find_first_of(const value_type* s, size_type pos, size_type n) const noexcept;    // constexpr since C++20
+    size_type find_first_of(const value_type* s, size_type pos = 0) const noexcept;             // constexpr since C++20
+    size_type find_first_of(value_type c, size_type pos = 0) const noexcept;                    // constexpr since C++20
+
+    size_type find_last_of(const basic_string& str, size_type pos = npos) const noexcept;       // constexpr since C++20
+    template <class T>
+        size_type find_last_of(const T& t, size_type pos = npos) const noexcept noexcept;       // C++17, noexcept as an extension, constexpr since C++20
+    size_type find_last_of(const value_type* s, size_type pos, size_type n) const noexcept;     // constexpr since C++20
+    size_type find_last_of(const value_type* s, size_type pos = npos) const noexcept;           // constexpr since C++20
+    size_type find_last_of(value_type c, size_type pos = npos) const noexcept;                  // constexpr since C++20
+
+    size_type find_first_not_of(const basic_string& str, size_type pos = 0) const noexcept;     // constexpr since C++20
+    template <class T>
+        size_type find_first_not_of(const T& t, size_type pos = 0) const noexcept;              // C++17, noexcept as an extension, constexpr since C++20
+    size_type find_first_not_of(const value_type* s, size_type pos, size_type n) const noexcept; // constexpr since C++20
+    size_type find_first_not_of(const value_type* s, size_type pos = 0) const noexcept;         // constexpr since C++20
+    size_type find_first_not_of(value_type c, size_type pos = 0) const noexcept;                // constexpr since C++20
+
+    size_type find_last_not_of(const basic_string& str, size_type pos = npos) const noexcept;   // constexpr since C++20
+    template <class T>
+        size_type find_last_not_of(const T& t, size_type pos = npos) const noexcept;            // C++17, noexcept as an extension, constexpr since C++20
+    size_type find_last_not_of(const value_type* s, size_type pos, size_type n) const noexcept; // constexpr since C++20
+    size_type find_last_not_of(const value_type* s, size_type pos = npos) const noexcept;       // constexpr since C++20
+    size_type find_last_not_of(value_type c, size_type pos = npos) const noexcept;              // constexpr since C++20
+
+    int compare(const basic_string& str) const noexcept;                                        // constexpr since C++20
+    template <class T>
+        int compare(const T& t) const noexcept;                                                 // C++17, noexcept as an extension, constexpr since C++20
+    int compare(size_type pos1, size_type n1, const basic_string& str) const;                   // constexpr since C++20
+    template <class T>
+        int compare(size_type pos1, size_type n1, const T& t) const;                            // C++17, constexpr since C++20
+    int compare(size_type pos1, size_type n1, const basic_string& str,
+                size_type pos2, size_type n2=npos) const;                                       // C++14, constexpr since C++20
+    template <class T>
+        int compare(size_type pos1, size_type n1, const T& t,
+                    size_type pos2, size_type n2=npos) const;                                   // C++17, constexpr since C++20
+    int compare(const value_type* s) const noexcept;                                            // constexpr since C++20
+    int compare(size_type pos1, size_type n1, const value_type* s) const;                       // constexpr since C++20
+    int compare(size_type pos1, size_type n1, const value_type* s, size_type n2) const;         // constexpr since C++20
+
+    constexpr bool starts_with(basic_string_view<charT, traits> sv) const noexcept;             // C++20
+    constexpr bool starts_with(charT c) const noexcept;                                         // C++20
+    constexpr bool starts_with(const charT* s) const;                                           // C++20
+    constexpr bool ends_with(basic_string_view<charT, traits> sv) const noexcept;               // C++20
+    constexpr bool ends_with(charT c) const noexcept;                                           // C++20
+    constexpr bool ends_with(const charT* s) const;                                             // C++20
+
+    constexpr bool contains(basic_string_view<charT, traits> sv) const noexcept;                // C++2b
+    constexpr bool contains(charT c) const noexcept;                                            // C++2b
+    constexpr bool contains(const charT* s) const;                                              // C++2b
+};
+
+template<class InputIterator,
+         class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
+basic_string(InputIterator, InputIterator, Allocator = Allocator())
+   -> basic_string<typename iterator_traits<InputIterator>::value_type,
+                  char_traits<typename iterator_traits<InputIterator>::value_type>,
+                  Allocator>;   // C++17
+
+template<class charT, class traits, class Allocator>
+basic_string<charT, traits, Allocator>
+operator+(const basic_string<charT, traits, Allocator>& lhs,
+          const basic_string<charT, traits, Allocator>& rhs);                                   // constexpr since C++20
+
+template<class charT, class traits, class Allocator>
+basic_string<charT, traits, Allocator>
+operator+(const charT* lhs , const basic_string<charT,traits,Allocator>&rhs);                   // constexpr since C++20
+
+template<class charT, class traits, class Allocator>
+basic_string<charT, traits, Allocator>
+operator+(charT lhs, const basic_string<charT,traits,Allocator>& rhs);                          // constexpr since C++20
+
+template<class charT, class traits, class Allocator>
+basic_string<charT, traits, Allocator>
+operator+(const basic_string<charT, traits, Allocator>& lhs, const charT* rhs);                 // constexpr since C++20
+
+template<class charT, class traits, class Allocator>
+basic_string<charT, traits, Allocator>
+operator+(const basic_string<charT, traits, Allocator>& lhs, charT rhs);                        // constexpr since C++20
+
+template<class charT, class traits, class Allocator>
+bool operator==(const basic_string<charT, traits, Allocator>& lhs,
+                const basic_string<charT, traits, Allocator>& rhs) noexcept;                    // constexpr since C++20
+
+template<class charT, class traits, class Allocator>
+bool operator==(const charT* lhs, const basic_string<charT, traits, Allocator>& rhs) noexcept;  // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator==(const basic_string<charT,traits,Allocator>& lhs, const charT* rhs) noexcept;    // constexpr since C++20
+
+template<class charT, class traits, class Allocator>
+bool operator!=(const basic_string<charT,traits,Allocator>& lhs,
+                const basic_string<charT, traits, Allocator>& rhs) noexcept;                    // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator!=(const charT* lhs, const basic_string<charT, traits, Allocator>& rhs) noexcept;  // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator!=(const basic_string<charT, traits, Allocator>& lhs, const charT* rhs) noexcept;  // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator< (const basic_string<charT, traits, Allocator>& lhs,
+                const basic_string<charT, traits, Allocator>& rhs) noexcept;                    // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator< (const basic_string<charT, traits, Allocator>& lhs, const charT* rhs) noexcept;  // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator< (const charT* lhs, const basic_string<charT, traits, Allocator>& rhs) noexcept;  // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator> (const basic_string<charT, traits, Allocator>& lhs,
+                const basic_string<charT, traits, Allocator>& rhs) noexcept;                    // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator> (const basic_string<charT, traits, Allocator>& lhs, const charT* rhs) noexcept;  // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator> (const charT* lhs, const basic_string<charT, traits, Allocator>& rhs) noexcept;  // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator<=(const basic_string<charT, traits, Allocator>& lhs,
+                const basic_string<charT, traits, Allocator>& rhs) noexcept;                    // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator<=(const basic_string<charT, traits, Allocator>& lhs, const charT* rhs) noexcept;  // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator<=(const charT* lhs, const basic_string<charT, traits, Allocator>& rhs) noexcept;  // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator>=(const basic_string<charT, traits, Allocator>& lhs,
+                const basic_string<charT, traits, Allocator>& rhs) noexcept;                    // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator>=(const basic_string<charT, traits, Allocator>& lhs, const charT* rhs) noexcept;  // removed in C++20
+
+template<class charT, class traits, class Allocator>
+bool operator>=(const charT* lhs, const basic_string<charT, traits, Allocator>& rhs) noexcept;  // removed in C++20
+
+template<class charT, class traits, class Allocator>                                            // since C++20
+constexpr see below operator<=>(const basic_string<charT, traits, Allocator>& lhs,
+                                const basic_string<charT, traits, Allocator>& rhs) noexcept;
+
+template<class charT, class traits, class Allocator>                                            // since C++20
+constexpr see below operator<=>(const basic_string<charT, traits, Allocator>& lhs,
+                                const charT* rhs) noexcept;
+
+template<class charT, class traits, class Allocator>
+void swap(basic_string<charT, traits, Allocator>& lhs,
+          basic_string<charT, traits, Allocator>& rhs)
+            noexcept(noexcept(lhs.swap(rhs)));                                                  // constexpr since C++20
+
+template<class charT, class traits, class Allocator>
+basic_istream<charT, traits>&
+operator>>(basic_istream<charT, traits>& is, basic_string<charT, traits, Allocator>& str);
+
+template<class charT, class traits, class Allocator>
+basic_ostream<charT, traits>&
+operator<<(basic_ostream<charT, traits>& os, const basic_string<charT, traits, Allocator>& str);
+
+template<class charT, class traits, class Allocator>
+basic_istream<charT, traits>&
+getline(basic_istream<charT, traits>& is, basic_string<charT, traits, Allocator>& str,
+        charT delim);
+
+template<class charT, class traits, class Allocator>
+basic_istream<charT, traits>&
+getline(basic_istream<charT, traits>& is, basic_string<charT, traits, Allocator>& str);
+
+template<class charT, class traits, class Allocator, class U>
+typename basic_string<charT, traits, Allocator>::size_type
+erase(basic_string<charT, traits, Allocator>& c, const U& value);    // C++20
+template<class charT, class traits, class Allocator, class Predicate>
+typename basic_string<charT, traits, Allocator>::size_type
+erase_if(basic_string<charT, traits, Allocator>& c, Predicate pred); // C++20
+
+typedef basic_string<char>    string;
+typedef basic_string<wchar_t> wstring;
+typedef basic_string<char8_t> u8string; // C++20
+typedef basic_string<char16_t> u16string;
+typedef basic_string<char32_t> u32string;
+
+int                stoi  (const string& str, size_t* idx = nullptr, int base = 10);
+long               stol  (const string& str, size_t* idx = nullptr, int base = 10);
+unsigned long      stoul (const string& str, size_t* idx = nullptr, int base = 10);
+long long          stoll (const string& str, size_t* idx = nullptr, int base = 10);
+unsigned long long stoull(const string& str, size_t* idx = nullptr, int base = 10);
+
+float       stof (const string& str, size_t* idx = nullptr);
+double      stod (const string& str, size_t* idx = nullptr);
+long double stold(const string& str, size_t* idx = nullptr);
+
+string to_string(int val);
+string to_string(unsigned val);
+string to_string(long val);
+string to_string(unsigned long val);
+string to_string(long long val);
+string to_string(unsigned long long val);
+string to_string(float val);
+string to_string(double val);
+string to_string(long double val);
+
+int                stoi  (const wstring& str, size_t* idx = nullptr, int base = 10);
+long               stol  (const wstring& str, size_t* idx = nullptr, int base = 10);
+unsigned long      stoul (const wstring& str, size_t* idx = nullptr, int base = 10);
+long long          stoll (const wstring& str, size_t* idx = nullptr, int base = 10);
+unsigned long long stoull(const wstring& str, size_t* idx = nullptr, int base = 10);
+
+float       stof (const wstring& str, size_t* idx = nullptr);
+double      stod (const wstring& str, size_t* idx = nullptr);
+long double stold(const wstring& str, size_t* idx = nullptr);
+
+wstring to_wstring(int val);
+wstring to_wstring(unsigned val);
+wstring to_wstring(long val);
+wstring to_wstring(unsigned long val);
+wstring to_wstring(long long val);
+wstring to_wstring(unsigned long long val);
+wstring to_wstring(float val);
+wstring to_wstring(double val);
+wstring to_wstring(long double val);
+
+template <> struct hash<string>;
+template <> struct hash<u8string>; // C++20
+template <> struct hash<u16string>;
+template <> struct hash<u32string>;
+template <> struct hash<wstring>;
+
+basic_string<char>     operator "" s( const char *str,     size_t len );           // C++14, constexpr since C++20
+basic_string<wchar_t>  operator "" s( const wchar_t *str,  size_t len );           // C++14, constexpr since C++20
+constexpr basic_string<char8_t>  operator "" s( const char8_t *str,  size_t len ); // C++20
+basic_string<char16_t> operator "" s( const char16_t *str, size_t len );           // C++14, constexpr since C++20
+basic_string<char32_t> operator "" s( const char32_t *str, size_t len );           // C++14, constexpr since C++20
+
+}  // std
+
+*/
+
+#include <__algorithm/max.h>
+#include <__algorithm/min.h>
+#include <__algorithm/remove.h>
+#include <__algorithm/remove_if.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__debug>
+#include <__format/enable_insertable.h>
+#include <__functional/hash.h>
+#include <__functional/unary_function.h>
+#include <__fwd/string.h>
+#include <__ios/fpos.h>
+#include <__iterator/distance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/reverse_iterator.h>
+#include <__iterator/wrap_iter.h>
+#include <__memory/allocate_at_least.h>
+#include <__memory/allocator.h>
+#include <__memory/allocator_traits.h>
+#include <__memory/compressed_pair.h>
+#include <__memory/construct_at.h>
+#include <__memory/pointer_traits.h>
+#include <__memory/swap_allocator.h>
+#include <__memory_resource/polymorphic_allocator.h>
+#include <__string/char_traits.h>
+#include <__string/extern_template_lists.h>
+#include <__type_traits/is_allocator.h>
+#include <__type_traits/noexcept_move_assign_container.h>
+#include <__utility/auto_cast.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <__utility/unreachable.h>
+#include <climits>
+#include <cstdint>
+#include <cstdio>  // EOF
+#include <cstdlib>
+#include <cstring>
+#include <limits>
+#include <stdexcept>
+#include <string_view>
+#include <type_traits>
+#include <version>
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+#  include <cwchar>
+#endif
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+// [string.syn]
+#include <compare>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// basic_string
+
+template<class _CharT, class _Traits, class _Allocator>
+basic_string<_CharT, _Traits, _Allocator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+operator+(const basic_string<_CharT, _Traits, _Allocator>& __x,
+          const basic_string<_CharT, _Traits, _Allocator>& __y);
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDDEN _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(const _CharT* __x, const basic_string<_CharT,_Traits,_Allocator>& __y);
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(_CharT __x, const basic_string<_CharT,_Traits,_Allocator>& __y);
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(const basic_string<_CharT, _Traits, _Allocator>& __x, const _CharT* __y);
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(const basic_string<_CharT, _Traits, _Allocator>& __x, _CharT __y);
+
+extern template _LIBCPP_FUNC_VIS string operator+<char, char_traits<char>, allocator<char> >(char const*, string const&);
+
+template <class _Iter>
+struct __string_is_trivial_iterator : public false_type {};
+
+template <class _Tp>
+struct __string_is_trivial_iterator<_Tp*>
+    : public is_arithmetic<_Tp> {};
+
+template <class _Iter>
+struct __string_is_trivial_iterator<__wrap_iter<_Iter> >
+    : public __string_is_trivial_iterator<_Iter> {};
+
+template <class _CharT, class _Traits, class _Tp>
+struct __can_be_converted_to_string_view : public _BoolConstant<
+      is_convertible<const _Tp&, basic_string_view<_CharT, _Traits> >::value &&
+     !is_convertible<const _Tp&, const _CharT*>::value
+    > {};
+
+struct __uninitialized_size_tag {};
+
+template<class _CharT, class _Traits, class _Allocator>
+class basic_string
+{
+public:
+    typedef basic_string                                 __self;
+    typedef basic_string_view<_CharT, _Traits>           __self_view;
+    typedef _Traits                                      traits_type;
+    typedef _CharT                                       value_type;
+    typedef _Allocator                                   allocator_type;
+    typedef allocator_traits<allocator_type>             __alloc_traits;
+    typedef typename __alloc_traits::size_type           size_type;
+    typedef typename __alloc_traits::difference_type     difference_type;
+    typedef value_type&                                  reference;
+    typedef const value_type&                            const_reference;
+    typedef typename __alloc_traits::pointer             pointer;
+    typedef typename __alloc_traits::const_pointer       const_pointer;
+
+    static_assert((!is_array<value_type>::value), "Character type of basic_string must not be an array");
+    static_assert(( is_standard_layout<value_type>::value), "Character type of basic_string must be standard-layout");
+    static_assert(( is_trivial<value_type>::value), "Character type of basic_string must be trivial");
+    static_assert(( is_same<_CharT, typename traits_type::char_type>::value),
+                  "traits_type::char_type must be the same type as CharT");
+    static_assert(( is_same<typename allocator_type::value_type, value_type>::value),
+                  "Allocator::value_type must be same type as value_type");
+
+    static_assert(is_same<allocator_type, __rebind_alloc<__alloc_traits, value_type> >::value,
+                  "[allocator.requirements] states that rebinding an allocator to the same type should result in the "
+                  "original allocator");
+
+    // TODO: Implement iterator bounds checking without requiring the global database.
+    typedef __wrap_iter<pointer>                         iterator;
+    typedef __wrap_iter<const_pointer>                   const_iterator;
+    typedef std::reverse_iterator<iterator>              reverse_iterator;
+    typedef std::reverse_iterator<const_iterator>        const_reverse_iterator;
+
+private:
+    static_assert(CHAR_BIT == 8, "This implementation assumes that one byte contains 8 bits");
+
+#ifdef _LIBCPP_ABI_ALTERNATE_STRING_LAYOUT
+
+    struct __long
+    {
+        pointer   __data_;
+        size_type __size_;
+        size_type __cap_ : sizeof(size_type) * CHAR_BIT - 1;
+        size_type __is_long_ : 1;
+    };
+
+    enum {__min_cap = (sizeof(__long) - 1)/sizeof(value_type) > 2 ?
+                      (sizeof(__long) - 1)/sizeof(value_type) : 2};
+
+    struct __short
+    {
+        value_type __data_[__min_cap];
+        unsigned char __padding_[sizeof(value_type) - 1];
+        unsigned char __size_ : 7;
+        unsigned char __is_long_ : 1;
+    };
+
+// The __endian_factor is required because the field we use to store the size
+// has one fewer bit than it would if it were not a bitfield.
+//
+// If the LSB is used to store the short-flag in the short string representation,
+// we have to multiply the size by two when it is stored and divide it by two when
+// it is loaded to make sure that we always store an even number. In the long string
+// representation, we can ignore this because we can assume that we always allocate
+// an even amount of value_types.
+//
+// If the MSB is used for the short-flag, the max_size() is numeric_limits<size_type>::max() / 2.
+// This does not impact the short string representation, since we never need the MSB
+// for representing the size of a short string anyway.
+
+#ifdef _LIBCPP_BIG_ENDIAN
+    static const size_type __endian_factor = 2;
+#else
+    static const size_type __endian_factor = 1;
+#endif
+
+#else // _LIBCPP_ABI_ALTERNATE_STRING_LAYOUT
+
+#ifdef _LIBCPP_BIG_ENDIAN
+    static const size_type __endian_factor = 1;
+#else
+    static const size_type __endian_factor = 2;
+#endif
+
+    // Attribute 'packed' is used to keep the layout compatible with the
+    // previous definition that did not use bit fields. This is because on
+    // some platforms bit fields have a default size rather than the actual
+    // size used, e.g., it is 4 bytes on AIX. See D128285 for details.
+    struct __long
+    {
+        struct _LIBCPP_PACKED {
+            size_type __is_long_ : 1;
+            size_type __cap_ : sizeof(size_type) * CHAR_BIT - 1;
+        };
+        size_type __size_;
+        pointer   __data_;
+    };
+
+    enum {__min_cap = (sizeof(__long) - 1)/sizeof(value_type) > 2 ?
+                      (sizeof(__long) - 1)/sizeof(value_type) : 2};
+
+    struct __short
+    {
+        struct _LIBCPP_PACKED {
+            unsigned char __is_long_ : 1;
+            unsigned char __size_ : 7;
+        };
+        char __padding_[sizeof(value_type) - 1];
+        value_type __data_[__min_cap];
+    };
+
+#endif // _LIBCPP_ABI_ALTERNATE_STRING_LAYOUT
+
+    static_assert(sizeof(__short) == (sizeof(value_type) * (__min_cap + 1)), "__short has an unexpected size.");
+
+    union __ulx{__long __lx; __short __lxx;};
+
+    enum {__n_words = sizeof(__ulx) / sizeof(size_type)};
+
+    struct __raw
+    {
+        size_type __words[__n_words];
+    };
+
+    struct __rep
+    {
+        union
+        {
+            __long  __l;
+            __short __s;
+            __raw   __r;
+        };
+    };
+
+    __compressed_pair<__rep, allocator_type> __r_;
+
+    // Construct a string with the given allocator and enough storage to hold `__size` characters, but
+    // don't initialize the characters. The contents of the string, including the null terminator, must be
+    // initialized separately.
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    explicit basic_string(__uninitialized_size_tag, size_type __size, const allocator_type& __a)
+            : __r_(__default_init_tag(), __a) {
+        if (__size > max_size())
+            __throw_length_error();
+        if (__fits_in_sso(__size)) {
+            __r_.first() = __rep();
+            __set_short_size(__size);
+        } else {
+            auto __capacity = __recommend(__size) + 1;
+            auto __allocation = __alloc_traits::allocate(__alloc(), __capacity);
+            __begin_lifetime(__allocation, __capacity);
+            __set_long_cap(__capacity);
+            __set_long_pointer(__allocation);
+            __set_long_size(__size);
+        }
+        std::__debug_db_insert_c(this);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator __make_iterator(pointer __p) {
+        return iterator(this, __p);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_iterator __make_const_iterator(const_pointer __p) const {
+        return const_iterator(this, __p);
+    }
+
+public:
+  _LIBCPP_TEMPLATE_DATA_VIS static const size_type npos = -1;
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string()
+      _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
+      : __r_(__default_init_tag(), __default_init_tag()) {
+    std::__debug_db_insert_c(this);
+    __default_init();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit basic_string(const allocator_type& __a)
+#if _LIBCPP_STD_VER <= 14
+      _NOEXCEPT_(is_nothrow_copy_constructible<allocator_type>::value)
+#else
+      _NOEXCEPT
+#endif
+      : __r_(__default_init_tag(), __a) {
+    std::__debug_db_insert_c(this);
+    __default_init();
+  }
+
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string(const basic_string& __str);
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string(const basic_string& __str, const allocator_type& __a);
+
+#ifndef _LIBCPP_CXX03_LANG
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string(basic_string&& __str)
+#  if _LIBCPP_STD_VER <= 14
+      _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value)
+#  else
+      _NOEXCEPT
+#  endif
+      : __r_(std::move(__str.__r_)) {
+    __str.__default_init();
+    std::__debug_db_insert_c(this);
+    if (__is_long())
+      std::__debug_db_swap(this, &__str);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string(basic_string&& __str, const allocator_type& __a)
+      : __r_(__default_init_tag(), __a) {
+    if (__str.__is_long() && __a != __str.__alloc()) // copy, not move
+      __init(std::__to_address(__str.__get_long_pointer()), __str.__get_long_size());
+    else {
+      if (__libcpp_is_constant_evaluated())
+        __r_.first() = __rep();
+      __r_.first() = __str.__r_.first();
+      __str.__default_init();
+    }
+    std::__debug_db_insert_c(this);
+    if (__is_long())
+      std::__debug_db_swap(this, &__str);
+  }
+#endif // _LIBCPP_CXX03_LANG
+
+  template <class = __enable_if_t<__is_allocator<_Allocator>::value, nullptr_t> >
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string(const _CharT* __s)
+      : __r_(__default_init_tag(), __default_init_tag()) {
+    _LIBCPP_ASSERT(__s != nullptr, "basic_string(const char*) detected nullptr");
+    __init(__s, traits_type::length(__s));
+    std::__debug_db_insert_c(this);
+  }
+
+  template <class = __enable_if_t<__is_allocator<_Allocator>::value, nullptr_t> >
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string(const _CharT* __s, const _Allocator& __a);
+
+#if _LIBCPP_STD_VER > 20
+  basic_string(nullptr_t) = delete;
+#endif
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string(const _CharT* __s, size_type __n)
+      : __r_(__default_init_tag(), __default_init_tag()) {
+    _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "basic_string(const char*, n) detected nullptr");
+    __init(__s, __n);
+    std::__debug_db_insert_c(this);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+  basic_string(const _CharT* __s, size_type __n, const _Allocator& __a)
+      : __r_(__default_init_tag(), __a) {
+    _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "basic_string(const char*, n, allocator) detected nullptr");
+    __init(__s, __n);
+    std::__debug_db_insert_c(this);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string(size_type __n, _CharT __c)
+      : __r_(__default_init_tag(), __default_init_tag()) {
+    __init(__n, __c);
+    std::__debug_db_insert_c(this);
+  }
+
+#if _LIBCPP_STD_VER > 20
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  basic_string(basic_string&& __str, size_type __pos, const _Allocator& __alloc = _Allocator())
+      : basic_string(std::move(__str), __pos, npos, __alloc) {}
+
+  _LIBCPP_HIDE_FROM_ABI constexpr
+  basic_string(basic_string&& __str, size_type __pos, size_type __n, const _Allocator& __alloc = _Allocator())
+      : __r_(__default_init_tag(), __alloc) {
+    if (__pos > __str.size())
+      __throw_out_of_range();
+
+    auto __len = std::min<size_type>(__n, __str.size() - __pos);
+    if (__alloc_traits::is_always_equal::value || __alloc == __str.__alloc()) {
+      __r_.first() = __str.__r_.first();
+      __str.__default_init();
+
+      _Traits::move(data(), data() + __pos, __len);
+      __set_size(__len);
+      _Traits::assign(data()[__len], value_type());
+    } else {
+      // Perform a copy because the allocators are not compatible.
+      __init(__str.data() + __pos, __len);
+    }
+
+    std::__debug_db_insert_c(this);
+    if (__is_long())
+      std::__debug_db_swap(this, &__str);
+  }
+#endif
+
+  template <class = __enable_if_t<__is_allocator<_Allocator>::value, nullptr_t> >
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string(size_type __n, _CharT __c, const _Allocator& __a);
+
+  _LIBCPP_CONSTEXPR_SINCE_CXX20
+  basic_string(const basic_string& __str, size_type __pos, size_type __n, const _Allocator& __a = _Allocator());
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+  basic_string(const basic_string& __str, size_type __pos, const _Allocator& __a = _Allocator())
+      : __r_(__default_init_tag(), __a) {
+    size_type __str_sz = __str.size();
+    if (__pos > __str_sz)
+      __throw_out_of_range();
+    __init(__str.data() + __pos, __str_sz - __pos);
+    std::__debug_db_insert_c(this);
+  }
+
+  template <class _Tp,
+            class = __enable_if_t<__can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value &&
+                                  !__is_same_uncvref<_Tp, basic_string>::value> >
+  _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+  basic_string(const _Tp& __t, size_type __pos, size_type __n, const allocator_type& __a = allocator_type());
+
+  template <class _Tp,
+            class = __enable_if_t<__can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value &&
+                                  !__is_same_uncvref<_Tp, basic_string>::value> >
+  _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit basic_string(
+      const _Tp& __t);
+
+  template <class _Tp,
+            class = __enable_if_t<__can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value &&
+                                  !__is_same_uncvref<_Tp, basic_string>::value> >
+  _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit basic_string(
+      const _Tp& __t, const allocator_type& __a);
+
+  template <class _InputIterator, class = __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value> >
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string(_InputIterator __first, _InputIterator __last)
+      : __r_(__default_init_tag(), __default_init_tag()) {
+    __init(__first, __last);
+    std::__debug_db_insert_c(this);
+  }
+
+  template <class _InputIterator, class = __enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value> >
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+  basic_string(_InputIterator __first, _InputIterator __last, const allocator_type& __a)
+      : __r_(__default_init_tag(), __a) {
+    __init(__first, __last);
+    std::__debug_db_insert_c(this);
+  }
+
+#ifndef _LIBCPP_CXX03_LANG
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string(initializer_list<_CharT> __il)
+      : __r_(__default_init_tag(), __default_init_tag()) {
+    __init(__il.begin(), __il.end());
+    std::__debug_db_insert_c(this);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string(initializer_list<_CharT> __il, const _Allocator& __a)
+      : __r_(__default_init_tag(), __a) {
+    __init(__il.begin(), __il.end());
+    std::__debug_db_insert_c(this);
+  }
+#endif // _LIBCPP_CXX03_LANG
+
+    inline _LIBCPP_CONSTEXPR_SINCE_CXX20 ~basic_string();
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    operator __self_view() const _NOEXCEPT { return __self_view(data(), size()); }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& operator=(const basic_string& __str);
+
+    template <class _Tp, class = __enable_if_t<__can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value &&
+                                               !__is_same_uncvref<_Tp, basic_string>::value> >
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& operator=(const _Tp& __t) {
+      __self_view __sv = __t;
+      return assign(__sv);
+    }
+
+#ifndef _LIBCPP_CXX03_LANG
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& operator=(basic_string&& __str)
+      _NOEXCEPT_((__noexcept_move_assign_container<_Allocator, __alloc_traits>::value)) {
+    __move_assign(__str, integral_constant<bool, __alloc_traits::propagate_on_container_move_assignment::value>());
+    return *this;
+  }
+
+     _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string& operator=(initializer_list<value_type> __il) {return assign(__il.begin(), __il.size());}
+#endif
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string& operator=(const value_type* __s) {return assign(__s);}
+#if _LIBCPP_STD_VER > 20
+    basic_string& operator=(nullptr_t) = delete;
+#endif
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& operator=(value_type __c);
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    iterator begin() _NOEXCEPT
+        {return __make_iterator(__get_pointer());}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_iterator begin() const _NOEXCEPT
+        {return __make_const_iterator(__get_pointer());}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    iterator end() _NOEXCEPT
+        {return __make_iterator(__get_pointer() + size());}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_iterator end() const _NOEXCEPT
+        {return __make_const_iterator(__get_pointer() + size());}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    reverse_iterator rbegin() _NOEXCEPT
+        {return reverse_iterator(end());}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_reverse_iterator rbegin() const _NOEXCEPT
+        {return const_reverse_iterator(end());}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    reverse_iterator rend() _NOEXCEPT
+        {return reverse_iterator(begin());}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_reverse_iterator rend() const _NOEXCEPT
+        {return const_reverse_iterator(begin());}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_iterator cbegin() const _NOEXCEPT
+        {return begin();}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_iterator cend() const _NOEXCEPT
+        {return end();}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_reverse_iterator crbegin() const _NOEXCEPT
+        {return rbegin();}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_reverse_iterator crend() const _NOEXCEPT
+        {return rend();}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type size() const _NOEXCEPT
+        {return __is_long() ? __get_long_size() : __get_short_size();}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type length() const _NOEXCEPT {return size();}
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type max_size() const _NOEXCEPT {
+    size_type __m = __alloc_traits::max_size(__alloc());
+    if (__m <= std::numeric_limits<size_type>::max() / 2) {
+      return __m - __alignment;
+    } else {
+    bool __uses_lsb = __endian_factor == 2;
+      return __uses_lsb ? __m - __alignment : (__m / 2) - __alignment;
+    }
+  }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type capacity() const _NOEXCEPT {
+        return (__is_long() ? __get_long_cap() : static_cast<size_type>(__min_cap)) - 1;
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void resize(size_type __n, value_type __c);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void resize(size_type __n) { resize(__n, value_type()); }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void reserve(size_type __requested_capacity);
+
+#if _LIBCPP_STD_VER > 20
+    template <class _Op>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    void resize_and_overwrite(size_type __n, _Op __op) {
+      __resize_default_init(__n);
+      __erase_to_end(std::move(__op)(data(), _LIBCPP_AUTO_CAST(__n)));
+    }
+#endif
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __resize_default_init(size_type __n);
+
+    _LIBCPP_DEPRECATED_IN_CXX20 _LIBCPP_HIDE_FROM_ABI void reserve() _NOEXCEPT { shrink_to_fit(); }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void shrink_to_fit() _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void clear() _NOEXCEPT;
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    bool empty() const _NOEXCEPT {return size() == 0;}
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference operator[](size_type __pos) const _NOEXCEPT {
+    _LIBCPP_ASSERT(__pos <= size(), "string index out of bounds");
+    return *(data() + __pos);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference operator[](size_type __pos) _NOEXCEPT {
+    _LIBCPP_ASSERT(__pos <= size(), "string index out of bounds");
+    return *(__get_pointer() + __pos);
+  }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference at(size_type __n) const;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 reference       at(size_type __n);
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& operator+=(const basic_string& __str) {
+        return append(__str);
+    }
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value
+            && !__is_same_uncvref<_Tp, basic_string >::value,
+            basic_string&
+        >
+    operator+=(const _Tp& __t) {
+        __self_view __sv = __t; return append(__sv);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& operator+=(const value_type* __s) {
+        return append(__s);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& operator+=(value_type __c) {
+        push_back(__c);
+        return *this;
+    }
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string& operator+=(initializer_list<value_type> __il) { return append(__il); }
+#endif // _LIBCPP_CXX03_LANG
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& append(const basic_string& __str) {
+        return append(__str.data(), __str.size());
+  }
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t<
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value
+            && !__is_same_uncvref<_Tp, basic_string>::value,
+            basic_string&
+        >
+                  append(const _Tp& __t) { __self_view __sv = __t; return append(__sv.data(), __sv.size()); }
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& append(const basic_string& __str, size_type __pos, size_type __n=npos);
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value
+            && !__is_same_uncvref<_Tp, basic_string>::value,
+            basic_string&
+        >
+                  append(const _Tp& __t, size_type __pos, size_type __n=npos);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& append(const value_type* __s, size_type __n);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& append(const value_type* __s);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& append(size_type __n, value_type __c);
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __append_default_init(size_type __n);
+
+    template<class _InputIterator>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+    __enable_if_t
+        <
+            __is_exactly_cpp17_input_iterator<_InputIterator>::value,
+            basic_string&
+        >
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    append(_InputIterator __first, _InputIterator __last) {
+      const basic_string __temp(__first, __last, __alloc());
+      append(__temp.data(), __temp.size());
+      return *this;
+    }
+    template<class _ForwardIterator>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+    __enable_if_t
+        <
+            __is_cpp17_forward_iterator<_ForwardIterator>::value,
+            basic_string&
+        >
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    append(_ForwardIterator __first, _ForwardIterator __last);
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string& append(initializer_list<value_type> __il) {return append(__il.begin(), __il.size());}
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void push_back(value_type __c);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void pop_back();
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference front() _NOEXCEPT {
+    _LIBCPP_ASSERT(!empty(), "string::front(): string is empty");
+    return *__get_pointer();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference front() const _NOEXCEPT {
+    _LIBCPP_ASSERT(!empty(), "string::front(): string is empty");
+    return *data();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference back() _NOEXCEPT {
+    _LIBCPP_ASSERT(!empty(), "string::back(): string is empty");
+    return *(__get_pointer() + size() - 1);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference back() const _NOEXCEPT {
+    _LIBCPP_ASSERT(!empty(), "string::back(): string is empty");
+    return *(data() + size() - 1);
+  }
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+            basic_string&
+        >
+                 assign(const _Tp & __t) { __self_view __sv = __t; return assign(__sv.data(), __sv.size()); }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string& assign(const basic_string& __str) { return *this = __str; }
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string& assign(basic_string&& __str)
+        _NOEXCEPT_((__noexcept_move_assign_container<_Allocator, __alloc_traits>::value))
+        {*this = std::move(__str); return *this;}
+#endif
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& assign(const basic_string& __str, size_type __pos, size_type __n=npos);
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value
+            && !__is_same_uncvref<_Tp, basic_string>::value,
+            basic_string&
+        >
+                  assign(const _Tp & __t, size_type __pos, size_type __n=npos);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& assign(const value_type* __s, size_type __n);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& assign(const value_type* __s);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& assign(size_type __n, value_type __c);
+    template<class _InputIterator>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __is_exactly_cpp17_input_iterator<_InputIterator>::value,
+            basic_string&
+        >
+        assign(_InputIterator __first, _InputIterator __last);
+    template<class _ForwardIterator>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __is_cpp17_forward_iterator<_ForwardIterator>::value,
+            basic_string&
+        >
+        assign(_ForwardIterator __first, _ForwardIterator __last);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string& assign(initializer_list<value_type> __il) {return assign(__il.begin(), __il.size());}
+#endif // _LIBCPP_CXX03_LANG
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string&
+  insert(size_type __pos1, const basic_string& __str) {
+    return insert(__pos1, __str.data(), __str.size());
+  }
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+            basic_string&
+        >
+                 insert(size_type __pos1, const _Tp& __t)
+    { __self_view __sv = __t; return insert(__pos1, __sv.data(), __sv.size()); }
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value && !__is_same_uncvref<_Tp, basic_string>::value,
+            basic_string&
+        >
+                  insert(size_type __pos1, const _Tp& __t, size_type __pos2, size_type __n=npos);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string& insert(size_type __pos1, const basic_string& __str, size_type __pos2, size_type __n=npos);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& insert(size_type __pos, const value_type* __s, size_type __n);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& insert(size_type __pos, const value_type* __s);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& insert(size_type __pos, size_type __n, value_type __c);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator      insert(const_iterator __pos, value_type __c);
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator
+  insert(const_iterator __pos, size_type __n, value_type __c) {
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(&__pos) == this,
+                         "string::insert(iterator, n, value) called with an iterator not referring to this string");
+    difference_type __p = __pos - begin();
+    insert(static_cast<size_type>(__p), __n, __c);
+    return begin() + __p;
+  }
+
+    template<class _InputIterator>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __is_exactly_cpp17_input_iterator<_InputIterator>::value,
+            iterator
+        >
+        insert(const_iterator __pos, _InputIterator __first, _InputIterator __last);
+    template<class _ForwardIterator>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __is_cpp17_forward_iterator<_ForwardIterator>::value,
+            iterator
+        >
+        insert(const_iterator __pos, _ForwardIterator __first, _ForwardIterator __last);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    iterator insert(const_iterator __pos, initializer_list<value_type> __il)
+                    {return insert(__pos, __il.begin(), __il.end());}
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& erase(size_type __pos = 0, size_type __n = npos);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    iterator      erase(const_iterator __pos);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    iterator      erase(const_iterator __first, const_iterator __last);
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string&
+  replace(size_type __pos1, size_type __n1, const basic_string& __str) {
+    return replace(__pos1, __n1, __str.data(), __str.size());
+  }
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+            basic_string&
+        >
+                  replace(size_type __pos1, size_type __n1, const _Tp& __t) { __self_view __sv = __t; return replace(__pos1, __n1, __sv.data(), __sv.size()); }
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string& replace(size_type __pos1, size_type __n1, const basic_string& __str, size_type __pos2, size_type __n2=npos);
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value  && !__is_same_uncvref<_Tp, basic_string>::value,
+            basic_string&
+        >
+                  replace(size_type __pos1, size_type __n1, const _Tp& __t, size_type __pos2, size_type __n2=npos);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string& replace(size_type __pos, size_type __n1, const value_type* __s, size_type __n2);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& replace(size_type __pos, size_type __n1, const value_type* __s);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& replace(size_type __pos, size_type __n1, size_type __n2, value_type __c);
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string&
+  replace(const_iterator __i1, const_iterator __i2, const basic_string& __str) {
+    return replace(
+        static_cast<size_type>(__i1 - begin()), static_cast<size_type>(__i2 - __i1), __str.data(), __str.size());
+  }
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+            basic_string&
+        >
+                  replace(const_iterator __i1, const_iterator __i2, const _Tp& __t) { __self_view __sv = __t; return replace(__i1 - begin(), __i2 - __i1, __sv); }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string&
+  replace(const_iterator __i1, const_iterator __i2, const value_type* __s, size_type __n) {
+    return replace(static_cast<size_type>(__i1 - begin()), static_cast<size_type>(__i2 - __i1), __s, __n);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string&
+  replace(const_iterator __i1, const_iterator __i2, const value_type* __s) {
+    return replace(static_cast<size_type>(__i1 - begin()), static_cast<size_type>(__i2 - __i1), __s);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string&
+  replace(const_iterator __i1, const_iterator __i2, size_type __n, value_type __c) {
+    return replace(static_cast<size_type>(__i1 - begin()), static_cast<size_type>(__i2 - __i1), __n, __c);
+  }
+
+    template<class _InputIterator>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __is_cpp17_input_iterator<_InputIterator>::value,
+            basic_string&
+        >
+        replace(const_iterator __i1, const_iterator __i2, _InputIterator __j1, _InputIterator __j2);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string& replace(const_iterator __i1, const_iterator __i2, initializer_list<value_type> __il)
+        {return replace(__i1, __i2, __il.begin(), __il.end());}
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type copy(value_type* __s, size_type __n, size_type __pos = 0) const;
+
+#if _LIBCPP_STD_VER <= 20
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string substr(size_type __pos = 0, size_type __n = npos) const {
+      return basic_string(*this, __pos, __n);
+    }
+#else
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    basic_string substr(size_type __pos = 0, size_type __n = npos) const& {
+      return basic_string(*this, __pos, __n);
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    basic_string substr(size_type __pos = 0, size_type __n = npos) && {
+      return basic_string(std::move(*this), __pos, __n);
+    }
+#endif
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void swap(basic_string& __str)
+#if _LIBCPP_STD_VER >= 14
+        _NOEXCEPT;
+#else
+        _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
+                    __is_nothrow_swappable<allocator_type>::value);
+#endif
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const value_type* c_str() const _NOEXCEPT {return data();}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const value_type* data() const _NOEXCEPT  {return std::__to_address(__get_pointer());}
+#if _LIBCPP_STD_VER > 14 || defined(_LIBCPP_BUILDING_LIBRARY)
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    value_type* data()             _NOEXCEPT  {return std::__to_address(__get_pointer());}
+#endif
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    allocator_type get_allocator() const _NOEXCEPT {return __alloc();}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find(const basic_string& __str, size_type __pos = 0) const _NOEXCEPT;
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+            size_type
+        >
+              find(const _Tp& __t, size_type __pos = 0) const _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find(const value_type* __s, size_type __pos, size_type __n) const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find(const value_type* __s, size_type __pos = 0) const _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type find(value_type __c, size_type __pos = 0) const _NOEXCEPT;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type rfind(const basic_string& __str, size_type __pos = npos) const _NOEXCEPT;
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+            size_type
+        >
+              rfind(const _Tp& __t, size_type __pos = npos) const _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type rfind(const value_type* __s, size_type __pos, size_type __n) const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type rfind(const value_type* __s, size_type __pos = npos) const _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type rfind(value_type __c, size_type __pos = npos) const _NOEXCEPT;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_first_of(const basic_string& __str, size_type __pos = 0) const _NOEXCEPT;
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+            size_type
+        >
+              find_first_of(const _Tp& __t, size_type __pos = 0) const _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_first_of(const value_type* __s, size_type __pos, size_type __n) const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_first_of(const value_type* __s, size_type __pos = 0) const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_first_of(value_type __c, size_type __pos = 0) const _NOEXCEPT;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_last_of(const basic_string& __str, size_type __pos = npos) const _NOEXCEPT;
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+            size_type
+        >
+              find_last_of(const _Tp& __t, size_type __pos = npos) const _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_last_of(const value_type* __s, size_type __pos, size_type __n) const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_last_of(const value_type* __s, size_type __pos = npos) const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_last_of(value_type __c, size_type __pos = npos) const _NOEXCEPT;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_first_not_of(const basic_string& __str, size_type __pos = 0) const _NOEXCEPT;
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+            size_type
+        >
+              find_first_not_of(const _Tp &__t, size_type __pos = 0) const _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_first_not_of(const value_type* __s, size_type __pos, size_type __n) const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_first_not_of(const value_type* __s, size_type __pos = 0) const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_first_not_of(value_type __c, size_type __pos = 0) const _NOEXCEPT;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_last_not_of(const basic_string& __str, size_type __pos = npos) const _NOEXCEPT;
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+            size_type
+        >
+              find_last_not_of(const _Tp& __t, size_type __pos = npos) const _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_last_not_of(const value_type* __s, size_type __pos, size_type __n) const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_last_not_of(const value_type* __s, size_type __pos = npos) const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type find_last_not_of(value_type __c, size_type __pos = npos) const _NOEXCEPT;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    int compare(const basic_string& __str) const _NOEXCEPT;
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+            int
+        >
+        compare(const _Tp &__t) const _NOEXCEPT;
+
+    template <class _Tp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+            int
+        >
+         compare(size_type __pos1, size_type __n1, const _Tp& __t) const;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    int compare(size_type __pos1, size_type __n1, const basic_string& __str) const;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    int compare(size_type __pos1, size_type __n1, const basic_string& __str, size_type __pos2,
+                size_type __n2 = npos) const;
+
+    template <class _Tp>
+    inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+        __enable_if_t
+        <
+            __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value  && !__is_same_uncvref<_Tp, basic_string>::value,
+            int
+        >
+        compare(size_type __pos1, size_type __n1, const _Tp& __t, size_type __pos2, size_type __n2=npos) const;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 int compare(const value_type* __s) const _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 int compare(size_type __pos1, size_type __n1, const value_type* __s) const;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    int compare(size_type __pos1, size_type __n1, const value_type* __s, size_type __n2) const;
+
+#if _LIBCPP_STD_VER > 17
+    constexpr _LIBCPP_HIDE_FROM_ABI
+    bool starts_with(__self_view __sv) const noexcept
+    { return __self_view(data(), size()).starts_with(__sv); }
+
+    constexpr _LIBCPP_HIDE_FROM_ABI
+    bool starts_with(value_type __c) const noexcept
+    { return !empty() && _Traits::eq(front(), __c); }
+
+    constexpr _LIBCPP_HIDE_FROM_ABI
+    bool starts_with(const value_type* __s) const noexcept
+    { return starts_with(__self_view(__s)); }
+
+    constexpr _LIBCPP_HIDE_FROM_ABI
+    bool ends_with(__self_view __sv) const noexcept
+    { return __self_view(data(), size()).ends_with( __sv); }
+
+    constexpr _LIBCPP_HIDE_FROM_ABI
+    bool ends_with(value_type __c) const noexcept
+    { return !empty() && _Traits::eq(back(), __c); }
+
+    constexpr _LIBCPP_HIDE_FROM_ABI
+    bool ends_with(const value_type* __s) const noexcept
+    { return ends_with(__self_view(__s)); }
+#endif
+
+#if _LIBCPP_STD_VER > 20
+    constexpr _LIBCPP_HIDE_FROM_ABI
+    bool contains(__self_view __sv) const noexcept
+    { return __self_view(data(), size()).contains(__sv); }
+
+    constexpr _LIBCPP_HIDE_FROM_ABI
+    bool contains(value_type __c) const noexcept
+    { return __self_view(data(), size()).contains(__c); }
+
+    constexpr _LIBCPP_HIDE_FROM_ABI
+    bool contains(const value_type* __s) const
+    { return __self_view(data(), size()).contains(__s); }
+#endif
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool __invariants() const;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __clear_and_shrink() _NOEXCEPT;
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+    bool __dereferenceable(const const_iterator* __i) const;
+    bool __decrementable(const const_iterator* __i) const;
+    bool __addable(const const_iterator* __i, ptrdiff_t __n) const;
+    bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const;
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+private:
+    template<class _Alloc>
+    inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    bool friend operator==(const basic_string<char, char_traits<char>, _Alloc>& __lhs,
+                           const basic_string<char, char_traits<char>, _Alloc>& __rhs) _NOEXCEPT;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __shrink_or_extend(size_type __target_capacity);
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    bool __is_long() const _NOEXCEPT {
+        if (__libcpp_is_constant_evaluated())
+            return true;
+        return __r_.first().__s.__is_long_;
+    }
+
+    static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __begin_lifetime(pointer __begin, size_type __n) {
+#if _LIBCPP_STD_VER > 17
+        if (__libcpp_is_constant_evaluated()) {
+            for (size_type __i = 0; __i != __n; ++__i)
+                std::construct_at(std::addressof(__begin[__i]));
+        }
+#else
+        (void)__begin;
+        (void)__n;
+#endif // _LIBCPP_STD_VER > 17
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __default_init() {
+        __r_.first() = __rep();
+        if (__libcpp_is_constant_evaluated()) {
+            size_type __sz = __recommend(0) + 1;
+            pointer __ptr = __alloc_traits::allocate(__alloc(), __sz);
+            __begin_lifetime(__ptr, __sz);
+            __set_long_pointer(__ptr);
+            __set_long_cap(__sz);
+            __set_long_size(0);
+        }
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __deallocate_constexpr() {
+        if (__libcpp_is_constant_evaluated() && __get_pointer() != nullptr)
+            __alloc_traits::deallocate(__alloc(), __get_pointer(), __get_long_cap());
+    }
+
+    _LIBCPP_CONSTEXPR _LIBCPP_HIDE_FROM_ABI static bool __fits_in_sso(size_type __sz) {
+        // SSO is disabled during constant evaluation because `__is_long` isn't constexpr friendly
+        return !__libcpp_is_constant_evaluated() && (__sz < __min_cap);
+    }
+
+    template <class _ForwardIterator>
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+    iterator __insert_from_safe_copy(size_type __n, size_type __ip, _ForwardIterator __first, _ForwardIterator __last) {
+        size_type __sz = size();
+        size_type __cap = capacity();
+        value_type* __p;
+        if (__cap - __sz >= __n)
+        {
+            __p = std::__to_address(__get_pointer());
+            size_type __n_move = __sz - __ip;
+            if (__n_move != 0)
+                traits_type::move(__p + __ip + __n, __p + __ip, __n_move);
+        }
+        else
+        {
+            __grow_by(__cap, __sz + __n - __cap, __sz, __ip, 0, __n);
+            __p = std::__to_address(__get_long_pointer());
+        }
+        __sz += __n;
+        __set_size(__sz);
+        traits_type::assign(__p[__sz], value_type());
+        for (__p += __ip; __first != __last; ++__p, ++__first)
+            traits_type::assign(*__p, *__first);
+
+        return begin() + __ip;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 allocator_type& __alloc() _NOEXCEPT { return __r_.second(); }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR const allocator_type& __alloc() const _NOEXCEPT { return __r_.second(); }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __set_short_size(size_type __s) _NOEXCEPT {
+        _LIBCPP_ASSERT(__s < __min_cap, "__s should never be greater than or equal to the short string capacity");
+        __r_.first().__s.__size_ = __s;
+        __r_.first().__s.__is_long_ = false;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type __get_short_size() const _NOEXCEPT {
+        _LIBCPP_ASSERT(!__r_.first().__s.__is_long_, "String has to be short when trying to get the short size");
+        return __r_.first().__s.__size_;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __set_long_size(size_type __s) _NOEXCEPT
+        {__r_.first().__l.__size_ = __s;}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type __get_long_size() const _NOEXCEPT
+        {return __r_.first().__l.__size_;}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __set_size(size_type __s) _NOEXCEPT
+        {if (__is_long()) __set_long_size(__s); else __set_short_size(__s);}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __set_long_cap(size_type __s) _NOEXCEPT {
+        __r_.first().__l.__cap_ = __s / __endian_factor;
+        __r_.first().__l.__is_long_ = true;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type __get_long_cap() const _NOEXCEPT {
+        return __r_.first().__l.__cap_ * __endian_factor;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __set_long_pointer(pointer __p) _NOEXCEPT
+        {__r_.first().__l.__data_ = __p;}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    pointer __get_long_pointer() _NOEXCEPT
+        {return __r_.first().__l.__data_;}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_pointer __get_long_pointer() const _NOEXCEPT
+        {return __r_.first().__l.__data_;}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    pointer __get_short_pointer() _NOEXCEPT
+        {return pointer_traits<pointer>::pointer_to(__r_.first().__s.__data_[0]);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_pointer __get_short_pointer() const _NOEXCEPT
+        {return pointer_traits<const_pointer>::pointer_to(__r_.first().__s.__data_[0]);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    pointer __get_pointer() _NOEXCEPT
+        {return __is_long() ? __get_long_pointer() : __get_short_pointer();}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_pointer __get_pointer() const _NOEXCEPT
+        {return __is_long() ? __get_long_pointer() : __get_short_pointer();}
+
+    template <size_type __a> static
+        _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+        size_type __align_it(size_type __s) _NOEXCEPT
+            {return (__s + (__a-1)) & ~(__a-1);}
+    enum {__alignment = 16};
+    static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type __recommend(size_type __s) _NOEXCEPT
+    {
+        if (__s < __min_cap) {
+            if (__libcpp_is_constant_evaluated())
+                return static_cast<size_type>(__min_cap);
+            else
+                return static_cast<size_type>(__min_cap) - 1;
+        }
+        size_type __guess = __align_it<sizeof(value_type) < __alignment ?
+                     __alignment/sizeof(value_type) : 1 > (__s+1) - 1;
+        if (__guess == __min_cap) ++__guess;
+        return __guess;
+    }
+
+    inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __init(const value_type* __s, size_type __sz, size_type __reserve);
+    inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __init(const value_type* __s, size_type __sz);
+    inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __init(size_type __n, value_type __c);
+
+    // Slow path for the (inlined) copy constructor for 'long' strings.
+    // Always externally instantiated and not inlined.
+    // Requires that __s is zero terminated.
+    // The main reason for this function to exist is because for unstable, we
+    // want to allow inlining of the copy constructor. However, we don't want
+    // to call the __init() functions as those are marked as inline which may
+    // result in over-aggressive inlining by the compiler, where our aim is
+    // to only inline the fast path code directly in the ctor.
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void __init_copy_ctor_external(const value_type* __s, size_type __sz);
+
+    template <class _InputIterator>
+    inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+    <
+        __is_exactly_cpp17_input_iterator<_InputIterator>::value
+    >
+    __init(_InputIterator __first, _InputIterator __last);
+
+    template <class _ForwardIterator>
+    inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+    <
+        __is_cpp17_forward_iterator<_ForwardIterator>::value
+    >
+    __init(_ForwardIterator __first, _ForwardIterator __last);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __grow_by(size_type __old_cap, size_type __delta_cap, size_type __old_sz,
+                   size_type __n_copy,  size_type __n_del,     size_type __n_add = 0);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __grow_by_and_replace(size_type __old_cap, size_type __delta_cap, size_type __old_sz,
+                               size_type __n_copy,  size_type __n_del,
+                               size_type __n_add, const value_type* __p_new_stuff);
+
+    // __assign_no_alias is invoked for assignment operations where we
+    // have proof that the input does not alias the current instance.
+    // For example, operator=(basic_string) performs a 'self' check.
+    template <bool __is_short>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& __assign_no_alias(const value_type* __s, size_type __n);
+
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __erase_to_end(size_type __pos) {
+    __null_terminate_at(std::__to_address(__get_pointer()), __pos);
+  }
+
+    // __erase_external_with_move is invoked for erase() invocations where
+    // `n ~= npos`, likely requiring memory moves on the string data.
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void __erase_external_with_move(size_type __pos, size_type __n);
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __copy_assign_alloc(const basic_string& __str)
+        {__copy_assign_alloc(__str, integral_constant<bool,
+                      __alloc_traits::propagate_on_container_copy_assignment::value>());}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __copy_assign_alloc(const basic_string& __str, true_type)
+        {
+            if (__alloc() == __str.__alloc())
+                __alloc() = __str.__alloc();
+            else
+            {
+                if (!__str.__is_long())
+                {
+                    __clear_and_shrink();
+                    __alloc() = __str.__alloc();
+                }
+                else
+                {
+                    allocator_type __a = __str.__alloc();
+                    auto __allocation = std::__allocate_at_least(__a, __str.__get_long_cap());
+                    __begin_lifetime(__allocation.ptr, __allocation.count);
+                    __alloc_traits::deallocate(__alloc(), __get_long_pointer(), __get_long_cap());
+                    __alloc() = std::move(__a);
+                    __set_long_pointer(__allocation.ptr);
+                    __set_long_cap(__allocation.count);
+                    __set_long_size(__str.size());
+                }
+            }
+        }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __copy_assign_alloc(const basic_string&, false_type) _NOEXCEPT
+        {}
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __move_assign(basic_string& __str, false_type)
+        _NOEXCEPT_(__alloc_traits::is_always_equal::value);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __move_assign(basic_string& __str, true_type)
+#if _LIBCPP_STD_VER > 14
+        _NOEXCEPT;
+#else
+        _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value);
+#endif
+#endif
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void
+    __move_assign_alloc(basic_string& __str)
+        _NOEXCEPT_(
+            !__alloc_traits::propagate_on_container_move_assignment::value ||
+            is_nothrow_move_assignable<allocator_type>::value)
+    {__move_assign_alloc(__str, integral_constant<bool,
+                      __alloc_traits::propagate_on_container_move_assignment::value>());}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __move_assign_alloc(basic_string& __c, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
+        {
+            __alloc() = std::move(__c.__alloc());
+        }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __move_assign_alloc(basic_string&, false_type)
+        _NOEXCEPT
+        {}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& __assign_external(const value_type* __s);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string& __assign_external(const value_type* __s, size_type __n);
+
+    // Assigns the value in __s, guaranteed to be __n < __min_cap in length.
+    inline basic_string& __assign_short(const value_type* __s, size_type __n) {
+      pointer __p = __is_long()
+                        ? (__set_long_size(__n), __get_long_pointer())
+                        : (__set_short_size(__n), __get_short_pointer());
+      traits_type::move(std::__to_address(__p), __s, __n);
+      traits_type::assign(__p[__n], value_type());
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string& __null_terminate_at(value_type* __p, size_type __newsz) {
+      __set_size(__newsz);
+      __invalidate_iterators_past(__newsz);
+      traits_type::assign(__p[__newsz], value_type());
+      return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __invalidate_iterators_past(size_type);
+
+    template<class _Tp>
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    bool __addr_in_range(_Tp&& __t) const {
+        // assume that the ranges overlap, because we can't check during constant evaluation
+        if (__libcpp_is_constant_evaluated())
+          return true;
+        const volatile void *__p = std::addressof(__t);
+        return data() <= __p && __p <= data() + size();
+    }
+
+    _LIBCPP_NORETURN _LIBCPP_HIDE_FROM_ABI
+    void __throw_length_error() const {
+        std::__throw_length_error("basic_string");
+    }
+
+    _LIBCPP_NORETURN _LIBCPP_HIDE_FROM_ABI
+    void __throw_out_of_range() const {
+        std::__throw_out_of_range("basic_string");
+    }
+
+    friend _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string operator+<>(const basic_string&, const basic_string&);
+    friend _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string operator+<>(const value_type*, const basic_string&);
+    friend _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string operator+<>(value_type, const basic_string&);
+    friend _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string operator+<>(const basic_string&, const value_type*);
+    friend _LIBCPP_CONSTEXPR_SINCE_CXX20 basic_string operator+<>(const basic_string&, value_type);
+};
+
+// These declarations must appear before any functions are implicitly used
+// so that they have the correct visibility specifier.
+#define _LIBCPP_DECLARE(...) extern template __VA_ARGS__;
+#ifdef _LIBCPP_ABI_STRING_OPTIMIZED_EXTERNAL_INSTANTIATION
+    _LIBCPP_STRING_UNSTABLE_EXTERN_TEMPLATE_LIST(_LIBCPP_DECLARE, char)
+#   ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+        _LIBCPP_STRING_UNSTABLE_EXTERN_TEMPLATE_LIST(_LIBCPP_DECLARE, wchar_t)
+#   endif
+#else
+    _LIBCPP_STRING_V1_EXTERN_TEMPLATE_LIST(_LIBCPP_DECLARE, char)
+#   ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+        _LIBCPP_STRING_V1_EXTERN_TEMPLATE_LIST(_LIBCPP_DECLARE, wchar_t)
+#   endif
+#endif
+#undef _LIBCPP_DECLARE
+
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator,
+         class _CharT = __iter_value_type<_InputIterator>,
+         class _Allocator = allocator<_CharT>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>
+         >
+basic_string(_InputIterator, _InputIterator, _Allocator = _Allocator())
+  -> basic_string<_CharT, char_traits<_CharT>, _Allocator>;
+
+template<class _CharT,
+         class _Traits,
+         class _Allocator = allocator<_CharT>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>
+         >
+explicit basic_string(basic_string_view<_CharT, _Traits>, const _Allocator& = _Allocator())
+  -> basic_string<_CharT, _Traits, _Allocator>;
+
+template<class _CharT,
+         class _Traits,
+         class _Allocator = allocator<_CharT>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>,
+         class _Sz = typename allocator_traits<_Allocator>::size_type
+         >
+basic_string(basic_string_view<_CharT, _Traits>, _Sz, _Sz, const _Allocator& = _Allocator())
+  -> basic_string<_CharT, _Traits, _Allocator>;
+#endif
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::__invalidate_iterators_past(size_type __pos)
+{
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+    if (!__libcpp_is_constant_evaluated()) {
+        __c_node* __c = __get_db()->__find_c_and_lock(this);
+        if (__c)
+        {
+            const_pointer __new_last = __get_pointer() + __pos;
+            for (__i_node** __p = __c->end_; __p != __c->beg_; )
+            {
+                --__p;
+                const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
+                if (__i->base() > __new_last)
+                {
+                    (*__p)->__c_ = nullptr;
+                    if (--__c->end_ != __p)
+                        std::memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
+                }
+            }
+            __get_db()->unlock();
+        }
+    }
+#else
+    (void)__pos;
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void basic_string<_CharT, _Traits, _Allocator>::__init(const value_type* __s,
+                                                       size_type __sz,
+                                                       size_type __reserve)
+{
+    if (__libcpp_is_constant_evaluated())
+        __r_.first() = __rep();
+    if (__reserve > max_size())
+        __throw_length_error();
+    pointer __p;
+    if (__fits_in_sso(__reserve))
+    {
+        __set_short_size(__sz);
+        __p = __get_short_pointer();
+    }
+    else
+    {
+        auto __allocation = std::__allocate_at_least(__alloc(), __recommend(__reserve) + 1);
+        __p = __allocation.ptr;
+        __begin_lifetime(__p, __allocation.count);
+        __set_long_pointer(__p);
+        __set_long_cap(__allocation.count);
+        __set_long_size(__sz);
+    }
+    traits_type::copy(std::__to_address(__p), __s, __sz);
+    traits_type::assign(__p[__sz], value_type());
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::__init(const value_type* __s, size_type __sz)
+{
+    if (__libcpp_is_constant_evaluated())
+        __r_.first() = __rep();
+    if (__sz > max_size())
+        __throw_length_error();
+    pointer __p;
+    if (__fits_in_sso(__sz))
+    {
+        __set_short_size(__sz);
+        __p = __get_short_pointer();
+    }
+    else
+    {
+        auto __allocation = std::__allocate_at_least(__alloc(), __recommend(__sz) + 1);
+        __p = __allocation.ptr;
+        __begin_lifetime(__p, __allocation.count);
+        __set_long_pointer(__p);
+        __set_long_cap(__allocation.count);
+        __set_long_size(__sz);
+    }
+    traits_type::copy(std::__to_address(__p), __s, __sz);
+    traits_type::assign(__p[__sz], value_type());
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>::basic_string(const _CharT* __s, const _Allocator& __a)
+    : __r_(__default_init_tag(), __a)
+{
+    _LIBCPP_ASSERT(__s != nullptr, "basic_string(const char*, allocator) detected nullptr");
+    __init(__s, traits_type::length(__s));
+    std::__debug_db_insert_c(this);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>::basic_string(const basic_string& __str)
+    : __r_(__default_init_tag(), __alloc_traits::select_on_container_copy_construction(__str.__alloc()))
+{
+    if (!__str.__is_long())
+        __r_.first() = __str.__r_.first();
+    else
+        __init_copy_ctor_external(std::__to_address(__str.__get_long_pointer()),
+                                  __str.__get_long_size());
+    std::__debug_db_insert_c(this);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>::basic_string(
+    const basic_string& __str, const allocator_type& __a)
+    : __r_(__default_init_tag(), __a)
+{
+    if (!__str.__is_long())
+        __r_.first() = __str.__r_.first();
+    else
+        __init_copy_ctor_external(std::__to_address(__str.__get_long_pointer()),
+                                  __str.__get_long_size());
+    std::__debug_db_insert_c(this);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void basic_string<_CharT, _Traits, _Allocator>::__init_copy_ctor_external(
+    const value_type* __s, size_type __sz) {
+  if (__libcpp_is_constant_evaluated())
+    __r_.first() = __rep();
+
+  pointer __p;
+  if (__fits_in_sso(__sz)) {
+    __p = __get_short_pointer();
+    __set_short_size(__sz);
+  } else {
+    if (__sz > max_size())
+      __throw_length_error();
+    auto __allocation = std::__allocate_at_least(__alloc(), __recommend(__sz) + 1);
+    __p = __allocation.ptr;
+    __begin_lifetime(__p, __allocation.count);
+    __set_long_pointer(__p);
+    __set_long_cap(__allocation.count);
+    __set_long_size(__sz);
+  }
+  traits_type::copy(std::__to_address(__p), __s, __sz + 1);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::__init(size_type __n, value_type __c)
+{
+    if (__libcpp_is_constant_evaluated())
+        __r_.first() = __rep();
+
+    if (__n > max_size())
+        __throw_length_error();
+    pointer __p;
+    if (__fits_in_sso(__n))
+    {
+        __set_short_size(__n);
+        __p = __get_short_pointer();
+    }
+    else
+    {
+        auto __allocation = std::__allocate_at_least(__alloc(), __recommend(__n) + 1);
+        __p = __allocation.ptr;
+        __begin_lifetime(__p, __allocation.count);
+        __set_long_pointer(__p);
+        __set_long_cap(__allocation.count);
+        __set_long_size(__n);
+    }
+    traits_type::assign(std::__to_address(__p), __n, __c);
+    traits_type::assign(__p[__n], value_type());
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>::basic_string(size_type __n, _CharT __c, const _Allocator& __a)
+    : __r_(__default_init_tag(), __a)
+{
+    __init(__n, __c);
+    std::__debug_db_insert_c(this);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>::basic_string(const basic_string& __str,
+                                                        size_type __pos, size_type __n,
+                                                        const _Allocator& __a)
+    : __r_(__default_init_tag(), __a)
+{
+    size_type __str_sz = __str.size();
+    if (__pos > __str_sz)
+        __throw_out_of_range();
+    __init(__str.data() + __pos, std::min(__n, __str_sz - __pos));
+    std::__debug_db_insert_c(this);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class _Tp, class>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>::basic_string(
+             const _Tp& __t, size_type __pos, size_type __n, const allocator_type& __a)
+    : __r_(__default_init_tag(), __a)
+{
+    __self_view __sv0 = __t;
+    __self_view __sv = __sv0.substr(__pos, __n);
+    __init(__sv.data(), __sv.size());
+    std::__debug_db_insert_c(this);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class _Tp, class>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>::basic_string(const _Tp & __t)
+     : __r_(__default_init_tag(), __default_init_tag())
+{
+    __self_view __sv = __t;
+    __init(__sv.data(), __sv.size());
+    std::__debug_db_insert_c(this);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class _Tp, class>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>::basic_string(const _Tp & __t, const _Allocator& __a)
+    : __r_(__default_init_tag(), __a)
+{
+    __self_view __sv = __t;
+    __init(__sv.data(), __sv.size());
+    std::__debug_db_insert_c(this);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class _InputIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __is_exactly_cpp17_input_iterator<_InputIterator>::value
+>
+basic_string<_CharT, _Traits, _Allocator>::__init(_InputIterator __first, _InputIterator __last)
+{
+    __default_init();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+    for (; __first != __last; ++__first)
+        push_back(*__first);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        if (__is_long())
+            __alloc_traits::deallocate(__alloc(), __get_long_pointer(), __get_long_cap());
+        throw;
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class _ForwardIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __is_cpp17_forward_iterator<_ForwardIterator>::value
+>
+basic_string<_CharT, _Traits, _Allocator>::__init(_ForwardIterator __first, _ForwardIterator __last)
+{
+    if (__libcpp_is_constant_evaluated())
+        __r_.first() = __rep();
+    size_type __sz = static_cast<size_type>(std::distance(__first, __last));
+    if (__sz > max_size())
+        __throw_length_error();
+    pointer __p;
+    if (__fits_in_sso(__sz))
+    {
+        __set_short_size(__sz);
+        __p = __get_short_pointer();
+    }
+    else
+    {
+        auto __allocation = std::__allocate_at_least(__alloc(), __recommend(__sz) + 1);
+        __p = __allocation.ptr;
+        __begin_lifetime(__p, __allocation.count);
+        __set_long_pointer(__p);
+        __set_long_cap(__allocation.count);
+        __set_long_size(__sz);
+    }
+
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif  // _LIBCPP_NO_EXCEPTIONS
+    for (; __first != __last; ++__first, (void) ++__p)
+        traits_type::assign(*__p, *__first);
+    traits_type::assign(*__p, value_type());
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        if (__is_long())
+            __alloc_traits::deallocate(__alloc(), __get_long_pointer(), __get_long_cap());
+        throw;
+    }
+#endif  // _LIBCPP_NO_EXCEPTIONS
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>::~basic_string()
+{
+    std::__debug_db_erase_c(this);
+    if (__is_long())
+        __alloc_traits::deallocate(__alloc(), __get_long_pointer(), __get_long_cap());
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::__grow_by_and_replace
+    (size_type __old_cap, size_type __delta_cap, size_type __old_sz,
+     size_type __n_copy,  size_type __n_del,     size_type __n_add, const value_type* __p_new_stuff)
+{
+    size_type __ms = max_size();
+    if (__delta_cap > __ms - __old_cap - 1)
+        __throw_length_error();
+    pointer __old_p = __get_pointer();
+    size_type __cap = __old_cap < __ms / 2 - __alignment ?
+                          __recommend(std::max(__old_cap + __delta_cap, 2 * __old_cap)) :
+                          __ms - 1;
+    auto __allocation = std::__allocate_at_least(__alloc(), __cap + 1);
+    pointer __p = __allocation.ptr;
+    __begin_lifetime(__p, __allocation.count);
+    std::__debug_db_invalidate_all(this);
+    if (__n_copy != 0)
+        traits_type::copy(std::__to_address(__p),
+                          std::__to_address(__old_p), __n_copy);
+    if (__n_add != 0)
+        traits_type::copy(std::__to_address(__p) + __n_copy, __p_new_stuff, __n_add);
+    size_type __sec_cp_sz = __old_sz - __n_del - __n_copy;
+    if (__sec_cp_sz != 0)
+        traits_type::copy(std::__to_address(__p) + __n_copy + __n_add,
+                          std::__to_address(__old_p) + __n_copy + __n_del, __sec_cp_sz);
+    if (__old_cap+1 != __min_cap || __libcpp_is_constant_evaluated())
+        __alloc_traits::deallocate(__alloc(), __old_p, __old_cap+1);
+    __set_long_pointer(__p);
+    __set_long_cap(__allocation.count);
+    __old_sz = __n_copy + __n_add + __sec_cp_sz;
+    __set_long_size(__old_sz);
+    traits_type::assign(__p[__old_sz], value_type());
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+void
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>::__grow_by(size_type __old_cap, size_type __delta_cap, size_type __old_sz,
+                                                     size_type __n_copy,  size_type __n_del,     size_type __n_add)
+{
+    size_type __ms = max_size();
+    if (__delta_cap > __ms - __old_cap)
+        __throw_length_error();
+    pointer __old_p = __get_pointer();
+    size_type __cap = __old_cap < __ms / 2 - __alignment ?
+                          __recommend(std::max(__old_cap + __delta_cap, 2 * __old_cap)) :
+                          __ms - 1;
+    auto __allocation = std::__allocate_at_least(__alloc(), __cap + 1);
+    pointer __p = __allocation.ptr;
+    __begin_lifetime(__p, __allocation.count);
+    std::__debug_db_invalidate_all(this);
+    if (__n_copy != 0)
+        traits_type::copy(std::__to_address(__p),
+                          std::__to_address(__old_p), __n_copy);
+    size_type __sec_cp_sz = __old_sz - __n_del - __n_copy;
+    if (__sec_cp_sz != 0)
+        traits_type::copy(std::__to_address(__p) + __n_copy + __n_add,
+                          std::__to_address(__old_p) + __n_copy + __n_del,
+                          __sec_cp_sz);
+    if (__libcpp_is_constant_evaluated() || __old_cap + 1 != __min_cap)
+        __alloc_traits::deallocate(__alloc(), __old_p, __old_cap + 1);
+    __set_long_pointer(__p);
+    __set_long_cap(__allocation.count);
+}
+
+// assign
+
+template <class _CharT, class _Traits, class _Allocator>
+template <bool __is_short>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::__assign_no_alias(
+    const value_type* __s, size_type __n) {
+  size_type __cap = __is_short ? static_cast<size_type>(__min_cap) : __get_long_cap();
+  if (__n < __cap) {
+    pointer __p = __is_short ? __get_short_pointer() : __get_long_pointer();
+    __is_short ? __set_short_size(__n) : __set_long_size(__n);
+    traits_type::copy(std::__to_address(__p), __s, __n);
+    traits_type::assign(__p[__n], value_type());
+    __invalidate_iterators_past(__n);
+  } else {
+    size_type __sz = __is_short ? __get_short_size() : __get_long_size();
+    __grow_by_and_replace(__cap - 1, __n - __cap + 1, __sz, 0, __sz, __n, __s);
+  }
+  return *this;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::__assign_external(
+    const value_type* __s, size_type __n) {
+  size_type __cap = capacity();
+  if (__cap >= __n) {
+    value_type* __p = std::__to_address(__get_pointer());
+    traits_type::move(__p, __s, __n);
+    return __null_terminate_at(__p, __n);
+  } else {
+    size_type __sz = size();
+    __grow_by_and_replace(__cap, __n - __cap, __sz, 0, __sz, __n, __s);
+    return *this;
+  }
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::assign(const value_type* __s, size_type __n)
+{
+    _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string::assign received nullptr");
+    return (__builtin_constant_p(__n) && __fits_in_sso(__n))
+               ? __assign_short(__s, __n)
+               : __assign_external(__s, __n);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::assign(size_type __n, value_type __c)
+{
+    size_type __cap = capacity();
+    if (__cap < __n)
+    {
+        size_type __sz = size();
+        __grow_by(__cap, __n - __cap, __sz, 0, __sz);
+    }
+    value_type* __p = std::__to_address(__get_pointer());
+    traits_type::assign(__p, __n, __c);
+    return __null_terminate_at(__p, __n);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::operator=(value_type __c)
+{
+    pointer __p;
+    if (__is_long())
+    {
+        __p = __get_long_pointer();
+        __set_long_size(1);
+    }
+    else
+    {
+        __p = __get_short_pointer();
+        __set_short_size(1);
+    }
+    traits_type::assign(*__p, __c);
+    traits_type::assign(*++__p, value_type());
+    __invalidate_iterators_past(1);
+    return *this;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::operator=(const basic_string& __str)
+{
+  if (this != &__str) {
+    __copy_assign_alloc(__str);
+    if (!__is_long()) {
+      if (!__str.__is_long()) {
+        __r_.first() = __str.__r_.first();
+      } else {
+        return __assign_no_alias<true>(__str.data(), __str.size());
+      }
+    } else {
+      return __assign_no_alias<false>(__str.data(), __str.size());
+    }
+  }
+  return *this;
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::__move_assign(basic_string& __str, false_type)
+    _NOEXCEPT_(__alloc_traits::is_always_equal::value)
+{
+    if (__alloc() != __str.__alloc())
+        assign(__str);
+    else
+        __move_assign(__str, true_type());
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::__move_assign(basic_string& __str, true_type)
+#if _LIBCPP_STD_VER > 14
+    _NOEXCEPT
+#else
+    _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
+#endif
+{
+  if (__is_long()) {
+    __alloc_traits::deallocate(__alloc(), __get_long_pointer(),
+                               __get_long_cap());
+#if _LIBCPP_STD_VER <= 14
+    if (!is_nothrow_move_assignable<allocator_type>::value) {
+      __set_short_size(0);
+      traits_type::assign(__get_short_pointer()[0], value_type());
+    }
+#endif
+  }
+  __move_assign_alloc(__str);
+  __r_.first() = __str.__r_.first();
+  if (__libcpp_is_constant_evaluated()) {
+    __str.__default_init();
+  } else {
+    __str.__set_short_size(0);
+    traits_type::assign(__str.__get_short_pointer()[0], value_type());
+  }
+}
+
+#endif
+
+template <class _CharT, class _Traits, class _Allocator>
+template<class _InputIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+     __is_exactly_cpp17_input_iterator<_InputIterator>::value,
+    basic_string<_CharT, _Traits, _Allocator>&
+>
+basic_string<_CharT, _Traits, _Allocator>::assign(_InputIterator __first, _InputIterator __last)
+{
+    const basic_string __temp(__first, __last, __alloc());
+    assign(__temp.data(), __temp.size());
+    return *this;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template<class _ForwardIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __is_cpp17_forward_iterator<_ForwardIterator>::value,
+    basic_string<_CharT, _Traits, _Allocator>&
+>
+basic_string<_CharT, _Traits, _Allocator>::assign(_ForwardIterator __first, _ForwardIterator __last)
+{
+    size_type __cap = capacity();
+    size_type __n = __string_is_trivial_iterator<_ForwardIterator>::value ?
+        static_cast<size_type>(std::distance(__first, __last)) : 0;
+
+    if (__string_is_trivial_iterator<_ForwardIterator>::value &&
+        (__cap >= __n || !__addr_in_range(*__first)))
+    {
+        if (__cap < __n)
+        {
+            size_type __sz = size();
+            __grow_by(__cap, __n - __cap, __sz, 0, __sz);
+        }
+        pointer __p = __get_pointer();
+        for (; __first != __last; ++__p, (void) ++__first)
+            traits_type::assign(*__p, *__first);
+        traits_type::assign(*__p, value_type());
+        __set_size(__n);
+        __invalidate_iterators_past(__n);
+    }
+    else
+    {
+        const basic_string __temp(__first, __last, __alloc());
+        assign(__temp.data(), __temp.size());
+    }
+    return *this;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::assign(const basic_string& __str, size_type __pos, size_type __n)
+{
+    size_type __sz = __str.size();
+    if (__pos > __sz)
+        __throw_out_of_range();
+    return assign(__str.data() + __pos, std::min(__n, __sz - __pos));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value
+    && !__is_same_uncvref<_Tp, basic_string<_CharT, _Traits, _Allocator> >::value,
+    basic_string<_CharT, _Traits, _Allocator>&
+>
+basic_string<_CharT, _Traits, _Allocator>::assign(const _Tp & __t, size_type __pos, size_type __n)
+{
+    __self_view __sv = __t;
+    size_type __sz = __sv.size();
+    if (__pos > __sz)
+        __throw_out_of_range();
+    return assign(__sv.data() + __pos, std::min(__n, __sz - __pos));
+}
+
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::__assign_external(const value_type* __s) {
+  return __assign_external(__s, traits_type::length(__s));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::assign(const value_type* __s)
+{
+    _LIBCPP_ASSERT(__s != nullptr, "string::assign received nullptr");
+    return __builtin_constant_p(*__s)
+               ? (__fits_in_sso(traits_type::length(__s))
+                      ? __assign_short(__s, traits_type::length(__s))
+                      : __assign_external(__s, traits_type::length(__s)))
+               : __assign_external(__s);
+}
+// append
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::append(const value_type* __s, size_type __n)
+{
+    _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string::append received nullptr");
+    size_type __cap = capacity();
+    size_type __sz = size();
+    if (__cap - __sz >= __n)
+    {
+        if (__n)
+        {
+            value_type* __p = std::__to_address(__get_pointer());
+            traits_type::copy(__p + __sz, __s, __n);
+            __sz += __n;
+            __set_size(__sz);
+            traits_type::assign(__p[__sz], value_type());
+        }
+    }
+    else
+        __grow_by_and_replace(__cap, __sz + __n - __cap, __sz, __sz, 0, __n, __s);
+    return *this;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::append(size_type __n, value_type __c)
+{
+    if (__n)
+    {
+        size_type __cap = capacity();
+        size_type __sz = size();
+        if (__cap - __sz < __n)
+            __grow_by(__cap, __sz + __n - __cap, __sz, __sz, 0);
+        pointer __p = __get_pointer();
+        traits_type::assign(std::__to_address(__p) + __sz, __n, __c);
+        __sz += __n;
+        __set_size(__sz);
+        traits_type::assign(__p[__sz], value_type());
+    }
+    return *this;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 inline void
+basic_string<_CharT, _Traits, _Allocator>::__append_default_init(size_type __n)
+{
+    if (__n)
+    {
+        size_type __cap = capacity();
+        size_type __sz = size();
+        if (__cap - __sz < __n)
+            __grow_by(__cap, __sz + __n - __cap, __sz, __sz, 0);
+        pointer __p = __get_pointer();
+        __sz += __n;
+        __set_size(__sz);
+        traits_type::assign(__p[__sz], value_type());
+    }
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::push_back(value_type __c)
+{
+    bool __is_short = !__is_long();
+    size_type __cap;
+    size_type __sz;
+    if (__is_short)
+    {
+        __cap = __min_cap - 1;
+        __sz = __get_short_size();
+    }
+    else
+    {
+        __cap = __get_long_cap() - 1;
+        __sz = __get_long_size();
+    }
+    if (__sz == __cap)
+    {
+        __grow_by(__cap, 1, __sz, __sz, 0);
+        __is_short = false; // the string is always long after __grow_by
+    }
+    pointer __p = __get_pointer();
+    if (__is_short)
+    {
+        __p = __get_short_pointer() + __sz;
+        __set_short_size(__sz+1);
+    }
+    else
+    {
+        __p = __get_long_pointer() + __sz;
+        __set_long_size(__sz+1);
+    }
+    traits_type::assign(*__p, __c);
+    traits_type::assign(*++__p, value_type());
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template<class _ForwardIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __is_cpp17_forward_iterator<_ForwardIterator>::value,
+    basic_string<_CharT, _Traits, _Allocator>&
+>
+basic_string<_CharT, _Traits, _Allocator>::append(
+    _ForwardIterator __first, _ForwardIterator __last)
+{
+    size_type __sz = size();
+    size_type __cap = capacity();
+    size_type __n = static_cast<size_type>(std::distance(__first, __last));
+    if (__n)
+    {
+        if (__string_is_trivial_iterator<_ForwardIterator>::value &&
+            !__addr_in_range(*__first))
+        {
+            if (__cap - __sz < __n)
+                __grow_by(__cap, __sz + __n - __cap, __sz, __sz, 0);
+            pointer __p = __get_pointer() + __sz;
+            for (; __first != __last; ++__p, (void) ++__first)
+                traits_type::assign(*__p, *__first);
+            traits_type::assign(*__p, value_type());
+            __set_size(__sz + __n);
+        }
+        else
+        {
+            const basic_string __temp(__first, __last, __alloc());
+            append(__temp.data(), __temp.size());
+        }
+    }
+    return *this;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::append(const basic_string& __str, size_type __pos, size_type __n)
+{
+    size_type __sz = __str.size();
+    if (__pos > __sz)
+        __throw_out_of_range();
+    return append(__str.data() + __pos, std::min(__n, __sz - __pos));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+    __enable_if_t
+    <
+        __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value  && !__is_same_uncvref<_Tp, basic_string<_CharT, _Traits, _Allocator> >::value,
+        basic_string<_CharT, _Traits, _Allocator>&
+    >
+basic_string<_CharT, _Traits, _Allocator>::append(const _Tp & __t, size_type __pos, size_type __n)
+{
+    __self_view __sv = __t;
+    size_type __sz = __sv.size();
+    if (__pos > __sz)
+        __throw_out_of_range();
+    return append(__sv.data() + __pos, std::min(__n, __sz - __pos));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::append(const value_type* __s)
+{
+    _LIBCPP_ASSERT(__s != nullptr, "string::append received nullptr");
+    return append(__s, traits_type::length(__s));
+}
+
+// insert
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::insert(size_type __pos, const value_type* __s, size_type __n)
+{
+    _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string::insert received nullptr");
+    size_type __sz = size();
+    if (__pos > __sz)
+        __throw_out_of_range();
+    size_type __cap = capacity();
+    if (__libcpp_is_constant_evaluated()) {
+        if (__cap - __sz >= __n)
+            __grow_by_and_replace(__cap, 0, __sz, __pos, 0, __n, __s);
+        else
+            __grow_by_and_replace(__cap, __sz + __n - __cap, __sz, __pos, 0, __n, __s);
+        return *this;
+    }
+    if (__cap - __sz >= __n)
+    {
+        if (__n)
+        {
+            value_type* __p = std::__to_address(__get_pointer());
+            size_type __n_move = __sz - __pos;
+            if (__n_move != 0)
+            {
+                if (__p + __pos <= __s && __s < __p + __sz)
+                    __s += __n;
+                traits_type::move(__p + __pos + __n, __p + __pos, __n_move);
+            }
+            traits_type::move(__p + __pos, __s, __n);
+            __sz += __n;
+            __set_size(__sz);
+            traits_type::assign(__p[__sz], value_type());
+        }
+    }
+    else
+        __grow_by_and_replace(__cap, __sz + __n - __cap, __sz, __pos, 0, __n, __s);
+    return *this;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::insert(size_type __pos, size_type __n, value_type __c)
+{
+    size_type __sz = size();
+    if (__pos > __sz)
+        __throw_out_of_range();
+    if (__n)
+    {
+        size_type __cap = capacity();
+        value_type* __p;
+        if (__cap - __sz >= __n)
+        {
+            __p = std::__to_address(__get_pointer());
+            size_type __n_move = __sz - __pos;
+            if (__n_move != 0)
+                traits_type::move(__p + __pos + __n, __p + __pos, __n_move);
+        }
+        else
+        {
+            __grow_by(__cap, __sz + __n - __cap, __sz, __pos, 0, __n);
+            __p = std::__to_address(__get_long_pointer());
+        }
+        traits_type::assign(__p + __pos, __n, __c);
+        __sz += __n;
+        __set_size(__sz);
+        traits_type::assign(__p[__sz], value_type());
+    }
+    return *this;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template<class _InputIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+   __is_exactly_cpp17_input_iterator<_InputIterator>::value,
+   typename basic_string<_CharT, _Traits, _Allocator>::iterator
+>
+basic_string<_CharT, _Traits, _Allocator>::insert(const_iterator __pos, _InputIterator __first, _InputIterator __last)
+{
+  _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(&__pos) == this,
+                       "string::insert(iterator, range) called with an iterator not"
+                       " referring to this string");
+  const basic_string __temp(__first, __last, __alloc());
+  return insert(__pos, __temp.data(), __temp.data() + __temp.size());
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template<class _ForwardIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __is_cpp17_forward_iterator<_ForwardIterator>::value,
+    typename basic_string<_CharT, _Traits, _Allocator>::iterator
+>
+basic_string<_CharT, _Traits, _Allocator>::insert(const_iterator __pos, _ForwardIterator __first, _ForwardIterator __last)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(&__pos) == this,
+                         "string::insert(iterator, range) called with an iterator not referring to this string");
+
+    size_type __ip = static_cast<size_type>(__pos - begin());
+    size_type __n = static_cast<size_type>(std::distance(__first, __last));
+    if (__n == 0)
+        return begin() + __ip;
+
+    if (__string_is_trivial_iterator<_ForwardIterator>::value && !__addr_in_range(*__first))
+    {
+        return __insert_from_safe_copy(__n, __ip, __first, __last);
+    }
+    else
+    {
+        const basic_string __temp(__first, __last, __alloc());
+        return __insert_from_safe_copy(__n, __ip, __temp.begin(), __temp.end());
+    }
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::insert(size_type __pos1, const basic_string& __str,
+                                                  size_type __pos2, size_type __n)
+{
+    size_type __str_sz = __str.size();
+    if (__pos2 > __str_sz)
+        __throw_out_of_range();
+    return insert(__pos1, __str.data() + __pos2, std::min(__n, __str_sz - __pos2));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value  && !__is_same_uncvref<_Tp, basic_string<_CharT, _Traits, _Allocator> >::value,
+    basic_string<_CharT, _Traits, _Allocator>&
+>
+basic_string<_CharT, _Traits, _Allocator>::insert(size_type __pos1, const _Tp& __t,
+                                                  size_type __pos2, size_type __n)
+{
+    __self_view __sv = __t;
+    size_type __str_sz = __sv.size();
+    if (__pos2 > __str_sz)
+        __throw_out_of_range();
+    return insert(__pos1, __sv.data() + __pos2, std::min(__n, __str_sz - __pos2));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::insert(size_type __pos, const value_type* __s)
+{
+    _LIBCPP_ASSERT(__s != nullptr, "string::insert received nullptr");
+    return insert(__pos, __s, traits_type::length(__s));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::iterator
+basic_string<_CharT, _Traits, _Allocator>::insert(const_iterator __pos, value_type __c)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(&__pos) == this,
+                         "string::insert(iterator, character) called with an iterator not"
+                         " referring to this string");
+
+    size_type __ip = static_cast<size_type>(__pos - begin());
+    size_type __sz = size();
+    size_type __cap = capacity();
+    value_type* __p;
+    if (__cap == __sz)
+    {
+        __grow_by(__cap, 1, __sz, __ip, 0, 1);
+        __p = std::__to_address(__get_long_pointer());
+    }
+    else
+    {
+        __p = std::__to_address(__get_pointer());
+        size_type __n_move = __sz - __ip;
+        if (__n_move != 0)
+            traits_type::move(__p + __ip + 1, __p + __ip, __n_move);
+    }
+    traits_type::assign(__p[__ip], __c);
+    traits_type::assign(__p[++__sz], value_type());
+    __set_size(__sz);
+    return begin() + static_cast<difference_type>(__ip);
+}
+
+// replace
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::replace(size_type __pos, size_type __n1, const value_type* __s, size_type __n2)
+    _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
+{
+    _LIBCPP_ASSERT(__n2 == 0 || __s != nullptr, "string::replace received nullptr");
+    size_type __sz = size();
+    if (__pos > __sz)
+        __throw_out_of_range();
+    __n1 = std::min(__n1, __sz - __pos);
+    size_type __cap = capacity();
+    if (__cap - __sz + __n1 >= __n2)
+    {
+        if (__libcpp_is_constant_evaluated()) {
+            __grow_by_and_replace(__cap, 0, __sz, __pos, __n1, __n2, __s);
+            return *this;
+        }
+        value_type* __p = std::__to_address(__get_pointer());
+        if (__n1 != __n2)
+        {
+            size_type __n_move = __sz - __pos - __n1;
+            if (__n_move != 0)
+            {
+                if (__n1 > __n2)
+                {
+                    traits_type::move(__p + __pos, __s, __n2);
+                    traits_type::move(__p + __pos + __n2, __p + __pos + __n1, __n_move);
+                    return __null_terminate_at(__p, __sz + (__n2 - __n1));
+                }
+                if (__p + __pos < __s && __s < __p + __sz)
+                {
+                    if (__p + __pos + __n1 <= __s)
+                        __s += __n2 - __n1;
+                    else // __p + __pos < __s < __p + __pos + __n1
+                    {
+                        traits_type::move(__p + __pos, __s, __n1);
+                        __pos += __n1;
+                        __s += __n2;
+                        __n2 -= __n1;
+                        __n1 = 0;
+                    }
+                }
+                traits_type::move(__p + __pos + __n2, __p + __pos + __n1, __n_move);
+            }
+        }
+        traits_type::move(__p + __pos, __s, __n2);
+        return __null_terminate_at(__p, __sz + (__n2 - __n1));
+    }
+    else
+        __grow_by_and_replace(__cap, __sz - __n1 + __n2 - __cap, __sz, __pos, __n1, __n2, __s);
+    return *this;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::replace(size_type __pos, size_type __n1, size_type __n2, value_type __c)
+{
+    size_type __sz = size();
+    if (__pos > __sz)
+        __throw_out_of_range();
+    __n1 = std::min(__n1, __sz - __pos);
+    size_type __cap = capacity();
+    value_type* __p;
+    if (__cap - __sz + __n1 >= __n2)
+    {
+        __p = std::__to_address(__get_pointer());
+        if (__n1 != __n2)
+        {
+            size_type __n_move = __sz - __pos - __n1;
+            if (__n_move != 0)
+                traits_type::move(__p + __pos + __n2, __p + __pos + __n1, __n_move);
+        }
+    }
+    else
+    {
+        __grow_by(__cap, __sz - __n1 + __n2 - __cap, __sz, __pos, __n1, __n2);
+        __p = std::__to_address(__get_long_pointer());
+    }
+    traits_type::assign(__p + __pos, __n2, __c);
+    return __null_terminate_at(__p, __sz - (__n1 - __n2));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template<class _InputIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __is_cpp17_input_iterator<_InputIterator>::value,
+    basic_string<_CharT, _Traits, _Allocator>&
+>
+basic_string<_CharT, _Traits, _Allocator>::replace(const_iterator __i1, const_iterator __i2,
+                                                   _InputIterator __j1, _InputIterator __j2)
+{
+    const basic_string __temp(__j1, __j2, __alloc());
+    return replace(__i1, __i2, __temp);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::replace(size_type __pos1, size_type __n1, const basic_string& __str,
+                                                   size_type __pos2, size_type __n2)
+{
+    size_type __str_sz = __str.size();
+    if (__pos2 > __str_sz)
+        __throw_out_of_range();
+    return replace(__pos1, __n1, __str.data() + __pos2, std::min(__n2, __str_sz - __pos2));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value && !__is_same_uncvref<_Tp, basic_string<_CharT, _Traits, _Allocator> >::value,
+    basic_string<_CharT, _Traits, _Allocator>&
+>
+basic_string<_CharT, _Traits, _Allocator>::replace(size_type __pos1, size_type __n1, const _Tp& __t,
+                                                   size_type __pos2, size_type __n2)
+{
+    __self_view __sv = __t;
+    size_type __str_sz = __sv.size();
+    if (__pos2 > __str_sz)
+        __throw_out_of_range();
+    return replace(__pos1, __n1, __sv.data() + __pos2, std::min(__n2, __str_sz - __pos2));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::replace(size_type __pos, size_type __n1, const value_type* __s)
+{
+    _LIBCPP_ASSERT(__s != nullptr, "string::replace received nullptr");
+    return replace(__pos, __n1, __s, traits_type::length(__s));
+}
+
+// erase
+
+// 'externally instantiated' erase() implementation, called when __n != npos.
+// Does not check __pos against size()
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::__erase_external_with_move(
+    size_type __pos, size_type __n)
+{
+    if (__n)
+    {
+        size_type __sz = size();
+        value_type* __p = std::__to_address(__get_pointer());
+        __n = std::min(__n, __sz - __pos);
+        size_type __n_move = __sz - __pos - __n;
+        if (__n_move != 0)
+            traits_type::move(__p + __pos, __p + __pos + __n, __n_move);
+        __null_terminate_at(__p, __sz - __n);
+    }
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>&
+basic_string<_CharT, _Traits, _Allocator>::erase(size_type __pos,
+                                                 size_type __n) {
+  if (__pos > size())
+    __throw_out_of_range();
+  if (__n == npos) {
+    __erase_to_end(__pos);
+  } else {
+    __erase_external_with_move(__pos, __n);
+  }
+  return *this;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::iterator
+basic_string<_CharT, _Traits, _Allocator>::erase(const_iterator __pos)
+{
+  _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(&__pos) == this,
+                       "string::erase(iterator) called with an iterator not"
+                       " referring to this string");
+
+  _LIBCPP_ASSERT(__pos != end(), "string::erase(iterator) called with a non-dereferenceable iterator");
+  iterator __b = begin();
+  size_type __r = static_cast<size_type>(__pos - __b);
+  erase(__r, 1);
+  return __b + static_cast<difference_type>(__r);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::iterator
+basic_string<_CharT, _Traits, _Allocator>::erase(const_iterator __first, const_iterator __last)
+{
+  _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(&__first) == this,
+                       "string::erase(iterator,  iterator) called with an iterator not"
+                       " referring to this string");
+
+  _LIBCPP_ASSERT(__first <= __last, "string::erase(first, last) called with invalid range");
+  iterator __b = begin();
+  size_type __r = static_cast<size_type>(__first - __b);
+  erase(__r, static_cast<size_type>(__last - __first));
+  return __b + static_cast<difference_type>(__r);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::pop_back()
+{
+    _LIBCPP_ASSERT(!empty(), "string::pop_back(): string is already empty");
+    __erase_to_end(size() - 1);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::clear() _NOEXCEPT
+{
+    std::__debug_db_invalidate_all(this);
+    if (__is_long())
+    {
+        traits_type::assign(*__get_long_pointer(), value_type());
+        __set_long_size(0);
+    }
+    else
+    {
+        traits_type::assign(*__get_short_pointer(), value_type());
+        __set_short_size(0);
+    }
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::resize(size_type __n, value_type __c)
+{
+    size_type __sz = size();
+    if (__n > __sz)
+        append(__n - __sz, __c);
+    else
+        __erase_to_end(__n);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 inline void
+basic_string<_CharT, _Traits, _Allocator>::__resize_default_init(size_type __n)
+{
+    size_type __sz = size();
+    if (__n > __sz) {
+       __append_default_init(__n - __sz);
+    } else
+        __erase_to_end(__n);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::reserve(size_type __requested_capacity)
+{
+    if (__requested_capacity > max_size())
+        __throw_length_error();
+
+    // Make sure reserve(n) never shrinks. This is technically only required in C++20
+    // and later (since P0966R1), however we provide consistent behavior in all Standard
+    // modes because this function is instantiated in the shared library.
+    if (__requested_capacity <= capacity())
+        return;
+
+    size_type __target_capacity = std::max(__requested_capacity, size());
+    __target_capacity = __recommend(__target_capacity);
+    if (__target_capacity == capacity()) return;
+
+    __shrink_or_extend(__target_capacity);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::shrink_to_fit() _NOEXCEPT
+{
+    size_type __target_capacity = __recommend(size());
+    if (__target_capacity == capacity()) return;
+
+    __shrink_or_extend(__target_capacity);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::__shrink_or_extend(size_type __target_capacity)
+{
+    size_type __cap = capacity();
+    size_type __sz = size();
+
+    pointer __new_data, __p;
+    bool __was_long, __now_long;
+    if (__fits_in_sso(__target_capacity))
+    {
+        __was_long = true;
+        __now_long = false;
+        __new_data = __get_short_pointer();
+        __p = __get_long_pointer();
+    }
+    else
+    {
+        if (__target_capacity > __cap) {
+            auto __allocation = std::__allocate_at_least(__alloc(), __target_capacity + 1);
+            __new_data = __allocation.ptr;
+            __target_capacity = __allocation.count - 1;
+        }
+        else
+        {
+        #ifndef _LIBCPP_NO_EXCEPTIONS
+            try
+            {
+        #endif // _LIBCPP_NO_EXCEPTIONS
+                auto __allocation = std::__allocate_at_least(__alloc(), __target_capacity + 1);
+                __new_data = __allocation.ptr;
+                __target_capacity = __allocation.count - 1;
+        #ifndef _LIBCPP_NO_EXCEPTIONS
+            }
+            catch (...)
+            {
+                return;
+            }
+        #else  // _LIBCPP_NO_EXCEPTIONS
+            if (__new_data == nullptr)
+                return;
+        #endif // _LIBCPP_NO_EXCEPTIONS
+        }
+        __begin_lifetime(__new_data, __target_capacity + 1);
+        __now_long = true;
+        __was_long = __is_long();
+        __p = __get_pointer();
+    }
+    traits_type::copy(std::__to_address(__new_data),
+                      std::__to_address(__p), size()+1);
+    if (__was_long)
+        __alloc_traits::deallocate(__alloc(), __p, __cap+1);
+    if (__now_long)
+    {
+        __set_long_cap(__target_capacity+1);
+        __set_long_size(__sz);
+        __set_long_pointer(__new_data);
+    }
+    else
+        __set_short_size(__sz);
+    std::__debug_db_invalidate_all(this);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::const_reference
+basic_string<_CharT, _Traits, _Allocator>::at(size_type __n) const
+{
+    if (__n >= size())
+        __throw_out_of_range();
+    return (*this)[__n];
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::reference
+basic_string<_CharT, _Traits, _Allocator>::at(size_type __n)
+{
+    if (__n >= size())
+        __throw_out_of_range();
+    return (*this)[__n];
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::copy(value_type* __s, size_type __n, size_type __pos) const
+{
+    size_type __sz = size();
+    if (__pos > __sz)
+        __throw_out_of_range();
+    size_type __rlen = std::min(__n, __sz - __pos);
+    traits_type::copy(__s, data() + __pos, __rlen);
+    return __rlen;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::swap(basic_string& __str)
+#if _LIBCPP_STD_VER >= 14
+        _NOEXCEPT
+#else
+        _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
+                    __is_nothrow_swappable<allocator_type>::value)
+#endif
+{
+    if (!__is_long())
+        std::__debug_db_invalidate_all(this);
+    if (!__str.__is_long())
+        std::__debug_db_invalidate_all(&__str);
+    std::__debug_db_swap(this, &__str);
+
+    _LIBCPP_ASSERT(
+        __alloc_traits::propagate_on_container_swap::value ||
+        __alloc_traits::is_always_equal::value ||
+        __alloc() == __str.__alloc(), "swapping non-equal allocators");
+    std::swap(__r_.first(), __str.__r_.first());
+    std::__swap_allocator(__alloc(), __str.__alloc());
+}
+
+// find
+
+template <class _Traits>
+struct _LIBCPP_HIDDEN __traits_eq
+{
+    typedef typename _Traits::char_type char_type;
+    _LIBCPP_HIDE_FROM_ABI
+    bool operator()(const char_type& __x, const char_type& __y) _NOEXCEPT
+        {return _Traits::eq(__x, __y);}
+};
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find(const value_type* __s,
+                                                size_type __pos,
+                                                size_type __n) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string::find(): received nullptr");
+    return std::__str_find<value_type, size_type, traits_type, npos>
+        (data(), size(), __s, __pos, __n);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find(const basic_string& __str,
+                                                size_type __pos) const _NOEXCEPT
+{
+    return std::__str_find<value_type, size_type, traits_type, npos>
+        (data(), size(), __str.data(), __pos, __str.size());
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+    typename basic_string<_CharT, _Traits, _Allocator>::size_type
+>
+basic_string<_CharT, _Traits, _Allocator>::find(const _Tp &__t,
+                                                size_type __pos) const _NOEXCEPT
+{
+    __self_view __sv = __t;
+    return std::__str_find<value_type, size_type, traits_type, npos>
+        (data(), size(), __sv.data(), __pos, __sv.size());
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find(const value_type* __s,
+                                                size_type __pos) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__s != nullptr, "string::find(): received nullptr");
+    return std::__str_find<value_type, size_type, traits_type, npos>
+        (data(), size(), __s, __pos, traits_type::length(__s));
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find(value_type __c,
+                                                size_type __pos) const _NOEXCEPT
+{
+    return std::__str_find<value_type, size_type, traits_type, npos>
+        (data(), size(), __c, __pos);
+}
+
+// rfind
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::rfind(const value_type* __s,
+                                                 size_type __pos,
+                                                 size_type __n) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string::rfind(): received nullptr");
+    return std::__str_rfind<value_type, size_type, traits_type, npos>
+        (data(), size(), __s, __pos, __n);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::rfind(const basic_string& __str,
+                                                 size_type __pos) const _NOEXCEPT
+{
+    return std::__str_rfind<value_type, size_type, traits_type, npos>
+        (data(), size(), __str.data(), __pos, __str.size());
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+    typename basic_string<_CharT, _Traits, _Allocator>::size_type
+>
+basic_string<_CharT, _Traits, _Allocator>::rfind(const _Tp& __t,
+                                                size_type __pos) const _NOEXCEPT
+{
+    __self_view __sv = __t;
+    return std::__str_rfind<value_type, size_type, traits_type, npos>
+        (data(), size(), __sv.data(), __pos, __sv.size());
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::rfind(const value_type* __s,
+                                                 size_type __pos) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__s != nullptr, "string::rfind(): received nullptr");
+    return std::__str_rfind<value_type, size_type, traits_type, npos>
+        (data(), size(), __s, __pos, traits_type::length(__s));
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::rfind(value_type __c,
+                                                 size_type __pos) const _NOEXCEPT
+{
+    return std::__str_rfind<value_type, size_type, traits_type, npos>
+        (data(), size(), __c, __pos);
+}
+
+// find_first_of
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_first_of(const value_type* __s,
+                                                         size_type __pos,
+                                                         size_type __n) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string::find_first_of(): received nullptr");
+    return std::__str_find_first_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __s, __pos, __n);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_first_of(const basic_string& __str,
+                                                         size_type __pos) const _NOEXCEPT
+{
+    return std::__str_find_first_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __str.data(), __pos, __str.size());
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+    typename basic_string<_CharT, _Traits, _Allocator>::size_type
+>
+basic_string<_CharT, _Traits, _Allocator>::find_first_of(const _Tp& __t,
+                                                size_type __pos) const _NOEXCEPT
+{
+    __self_view __sv = __t;
+    return std::__str_find_first_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __sv.data(), __pos, __sv.size());
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_first_of(const value_type* __s,
+                                                         size_type __pos) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__s != nullptr, "string::find_first_of(): received nullptr");
+    return std::__str_find_first_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __s, __pos, traits_type::length(__s));
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_first_of(value_type __c,
+                                                         size_type __pos) const _NOEXCEPT
+{
+    return find(__c, __pos);
+}
+
+// find_last_of
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_last_of(const value_type* __s,
+                                                        size_type __pos,
+                                                        size_type __n) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string::find_last_of(): received nullptr");
+    return std::__str_find_last_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __s, __pos, __n);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_last_of(const basic_string& __str,
+                                                        size_type __pos) const _NOEXCEPT
+{
+    return std::__str_find_last_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __str.data(), __pos, __str.size());
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+    typename basic_string<_CharT, _Traits, _Allocator>::size_type
+>
+basic_string<_CharT, _Traits, _Allocator>::find_last_of(const _Tp& __t,
+                                                size_type __pos) const _NOEXCEPT
+{
+    __self_view __sv = __t;
+    return std::__str_find_last_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __sv.data(), __pos, __sv.size());
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_last_of(const value_type* __s,
+                                                        size_type __pos) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__s != nullptr, "string::find_last_of(): received nullptr");
+    return std::__str_find_last_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __s, __pos, traits_type::length(__s));
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_last_of(value_type __c,
+                                                        size_type __pos) const _NOEXCEPT
+{
+    return rfind(__c, __pos);
+}
+
+// find_first_not_of
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_first_not_of(const value_type* __s,
+                                                             size_type __pos,
+                                                             size_type __n) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string::find_first_not_of(): received nullptr");
+    return std::__str_find_first_not_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __s, __pos, __n);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_first_not_of(const basic_string& __str,
+                                                             size_type __pos) const _NOEXCEPT
+{
+    return std::__str_find_first_not_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __str.data(), __pos, __str.size());
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+    typename basic_string<_CharT, _Traits, _Allocator>::size_type
+>
+basic_string<_CharT, _Traits, _Allocator>::find_first_not_of(const _Tp& __t,
+                                                size_type __pos) const _NOEXCEPT
+{
+    __self_view __sv = __t;
+    return std::__str_find_first_not_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __sv.data(), __pos, __sv.size());
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_first_not_of(const value_type* __s,
+                                                             size_type __pos) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__s != nullptr, "string::find_first_not_of(): received nullptr");
+    return std::__str_find_first_not_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __s, __pos, traits_type::length(__s));
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_first_not_of(value_type __c,
+                                                             size_type __pos) const _NOEXCEPT
+{
+    return std::__str_find_first_not_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __c, __pos);
+}
+
+// find_last_not_of
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_last_not_of(const value_type* __s,
+                                                            size_type __pos,
+                                                            size_type __n) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string::find_last_not_of(): received nullptr");
+    return std::__str_find_last_not_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __s, __pos, __n);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_last_not_of(const basic_string& __str,
+                                                            size_type __pos) const _NOEXCEPT
+{
+    return std::__str_find_last_not_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __str.data(), __pos, __str.size());
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+    typename basic_string<_CharT, _Traits, _Allocator>::size_type
+>
+basic_string<_CharT, _Traits, _Allocator>::find_last_not_of(const _Tp& __t,
+                                                size_type __pos) const _NOEXCEPT
+{
+    __self_view __sv = __t;
+    return std::__str_find_last_not_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __sv.data(), __pos, __sv.size());
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_last_not_of(const value_type* __s,
+                                                            size_type __pos) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__s != nullptr, "string::find_last_not_of(): received nullptr");
+    return std::__str_find_last_not_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __s, __pos, traits_type::length(__s));
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename basic_string<_CharT, _Traits, _Allocator>::size_type
+basic_string<_CharT, _Traits, _Allocator>::find_last_not_of(value_type __c,
+                                                            size_type __pos) const _NOEXCEPT
+{
+    return std::__str_find_last_not_of<value_type, size_type, traits_type, npos>
+        (data(), size(), __c, __pos);
+}
+
+// compare
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+    int
+>
+basic_string<_CharT, _Traits, _Allocator>::compare(const _Tp& __t) const _NOEXCEPT
+{
+    __self_view __sv = __t;
+    size_t __lhs_sz = size();
+    size_t __rhs_sz = __sv.size();
+    int __result = traits_type::compare(data(), __sv.data(),
+                                        std::min(__lhs_sz, __rhs_sz));
+    if (__result != 0)
+        return __result;
+    if (__lhs_sz < __rhs_sz)
+        return -1;
+    if (__lhs_sz > __rhs_sz)
+        return 1;
+    return 0;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+int
+basic_string<_CharT, _Traits, _Allocator>::compare(const basic_string& __str) const _NOEXCEPT
+{
+    return compare(__self_view(__str));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+int
+basic_string<_CharT, _Traits, _Allocator>::compare(size_type __pos1,
+                                                   size_type __n1,
+                                                   const value_type* __s,
+                                                   size_type __n2) const
+{
+    _LIBCPP_ASSERT(__n2 == 0 || __s != nullptr, "string::compare(): received nullptr");
+    size_type __sz = size();
+    if (__pos1 > __sz || __n2 == npos)
+        __throw_out_of_range();
+    size_type __rlen = std::min(__n1, __sz - __pos1);
+    int __r = traits_type::compare(data() + __pos1, __s, std::min(__rlen, __n2));
+    if (__r == 0)
+    {
+        if (__rlen < __n2)
+            __r = -1;
+        else if (__rlen > __n2)
+            __r = 1;
+    }
+    return __r;
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value,
+    int
+>
+basic_string<_CharT, _Traits, _Allocator>::compare(size_type __pos1,
+                                                   size_type __n1,
+                                                   const _Tp& __t) const
+{
+    __self_view __sv = __t;
+    return compare(__pos1, __n1, __sv.data(), __sv.size());
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+int
+basic_string<_CharT, _Traits, _Allocator>::compare(size_type __pos1,
+                                                   size_type __n1,
+                                                   const basic_string& __str) const
+{
+    return compare(__pos1, __n1, __str.data(), __str.size());
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+template <class _Tp>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t
+<
+    __can_be_converted_to_string_view<_CharT, _Traits, _Tp>::value
+    && !__is_same_uncvref<_Tp, basic_string<_CharT, _Traits, _Allocator> >::value,
+    int
+>
+basic_string<_CharT, _Traits, _Allocator>::compare(size_type __pos1,
+                                                   size_type __n1,
+                                                   const _Tp& __t,
+                                                   size_type __pos2,
+                                                   size_type __n2) const
+{
+    __self_view __sv = __t;
+    return __self_view(*this).substr(__pos1, __n1).compare(__sv.substr(__pos2, __n2));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+int
+basic_string<_CharT, _Traits, _Allocator>::compare(size_type __pos1,
+                                                   size_type __n1,
+                                                   const basic_string& __str,
+                                                   size_type __pos2,
+                                                   size_type __n2) const
+{
+    return compare(__pos1, __n1, __self_view(__str), __pos2, __n2);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+int
+basic_string<_CharT, _Traits, _Allocator>::compare(const value_type* __s) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__s != nullptr, "string::compare(): received nullptr");
+    return compare(0, npos, __s, traits_type::length(__s));
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+int
+basic_string<_CharT, _Traits, _Allocator>::compare(size_type __pos1,
+                                                   size_type __n1,
+                                                   const value_type* __s) const
+{
+    _LIBCPP_ASSERT(__s != nullptr, "string::compare(): received nullptr");
+    return compare(__pos1, __n1, __s, traits_type::length(__s));
+}
+
+// __invariants
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+basic_string<_CharT, _Traits, _Allocator>::__invariants() const
+{
+    if (size() > capacity())
+        return false;
+    if (capacity() < __min_cap - 1)
+        return false;
+    if (data() == nullptr)
+        return false;
+    if (data()[size()] != value_type())
+        return false;
+    return true;
+}
+
+// __clear_and_shrink
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+basic_string<_CharT, _Traits, _Allocator>::__clear_and_shrink() _NOEXCEPT
+{
+    clear();
+    if(__is_long())
+    {
+        __alloc_traits::deallocate(__alloc(), __get_long_pointer(), capacity() + 1);
+        __default_init();
+    }
+}
+
+// operator==
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+bool
+operator==(const basic_string<_CharT, _Traits, _Allocator>& __lhs,
+           const basic_string<_CharT, _Traits, _Allocator>& __rhs) _NOEXCEPT
+{
+#if _LIBCPP_STD_VER > 17
+    return basic_string_view<_CharT, _Traits>(__lhs) == basic_string_view<_CharT, _Traits>(__rhs);
+#else
+    size_t __lhs_sz = __lhs.size();
+    return __lhs_sz == __rhs.size() && _Traits::compare(__lhs.data(),
+                                                        __rhs.data(),
+                                                        __lhs_sz) == 0;
+#endif
+}
+
+template<class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+bool
+operator==(const basic_string<char, char_traits<char>, _Allocator>& __lhs,
+           const basic_string<char, char_traits<char>, _Allocator>& __rhs) _NOEXCEPT
+{
+    size_t __lhs_sz = __lhs.size();
+    if (__lhs_sz != __rhs.size())
+        return false;
+    const char* __lp = __lhs.data();
+    const char* __rp = __rhs.data();
+    if (__lhs.__is_long())
+        return char_traits<char>::compare(__lp, __rp, __lhs_sz) == 0;
+    for (; __lhs_sz != 0; --__lhs_sz, ++__lp, ++__rp)
+        if (*__lp != *__rp)
+            return false;
+    return true;
+}
+
+#if _LIBCPP_STD_VER <= 17
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator==(const _CharT* __lhs,
+           const basic_string<_CharT, _Traits, _Allocator>& __rhs) _NOEXCEPT
+{
+    typedef basic_string<_CharT, _Traits, _Allocator> _String;
+    _LIBCPP_ASSERT(__lhs != nullptr, "operator==(char*, basic_string): received nullptr");
+    size_t __lhs_len = _Traits::length(__lhs);
+    if (__lhs_len != __rhs.size()) return false;
+    return __rhs.compare(0, _String::npos, __lhs, __lhs_len) == 0;
+}
+#endif // _LIBCPP_STD_VER <= 17
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+bool
+operator==(const basic_string<_CharT,_Traits,_Allocator>& __lhs,
+           const _CharT* __rhs) _NOEXCEPT
+{
+#if _LIBCPP_STD_VER > 17
+    return basic_string_view<_CharT, _Traits>(__lhs) == basic_string_view<_CharT, _Traits>(__rhs);
+#else
+    typedef basic_string<_CharT, _Traits, _Allocator> _String;
+    _LIBCPP_ASSERT(__rhs != nullptr, "operator==(basic_string, char*): received nullptr");
+    size_t __rhs_len = _Traits::length(__rhs);
+    if (__rhs_len != __lhs.size()) return false;
+    return __lhs.compare(0, _String::npos, __rhs, __rhs_len) == 0;
+#endif
+}
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI constexpr auto operator<=>(
+    const basic_string<_CharT, _Traits, _Allocator>& __lhs,
+    const basic_string<_CharT, _Traits, _Allocator>& __rhs) noexcept {
+    return basic_string_view<_CharT, _Traits>(__lhs) <=> basic_string_view<_CharT, _Traits>(__rhs);
+}
+
+template <class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI constexpr auto
+operator<=>(const basic_string<_CharT, _Traits, _Allocator>& __lhs, const _CharT* __rhs) {
+    return basic_string_view<_CharT, _Traits>(__lhs) <=> basic_string_view<_CharT, _Traits>(__rhs);
+}
+
+#else // _LIBCPP_STD_VER > 17
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator!=(const basic_string<_CharT,_Traits,_Allocator>& __lhs,
+           const basic_string<_CharT, _Traits, _Allocator>& __rhs) _NOEXCEPT
+{
+    return !(__lhs == __rhs);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator!=(const _CharT* __lhs,
+           const basic_string<_CharT, _Traits, _Allocator>& __rhs) _NOEXCEPT
+{
+    return !(__lhs == __rhs);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator!=(const basic_string<_CharT, _Traits, _Allocator>& __lhs,
+           const _CharT* __rhs) _NOEXCEPT
+{
+    return !(__lhs == __rhs);
+}
+
+// operator<
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator< (const basic_string<_CharT, _Traits, _Allocator>& __lhs,
+           const basic_string<_CharT, _Traits, _Allocator>& __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) < 0;
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator< (const basic_string<_CharT, _Traits, _Allocator>& __lhs,
+           const _CharT* __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) < 0;
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator< (const _CharT* __lhs,
+           const basic_string<_CharT, _Traits, _Allocator>& __rhs) _NOEXCEPT
+{
+    return __rhs.compare(__lhs) > 0;
+}
+
+// operator>
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator> (const basic_string<_CharT, _Traits, _Allocator>& __lhs,
+           const basic_string<_CharT, _Traits, _Allocator>& __rhs) _NOEXCEPT
+{
+    return __rhs < __lhs;
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator> (const basic_string<_CharT, _Traits, _Allocator>& __lhs,
+           const _CharT* __rhs) _NOEXCEPT
+{
+    return __rhs < __lhs;
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator> (const _CharT* __lhs,
+           const basic_string<_CharT, _Traits, _Allocator>& __rhs) _NOEXCEPT
+{
+    return __rhs < __lhs;
+}
+
+// operator<=
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator<=(const basic_string<_CharT, _Traits, _Allocator>& __lhs,
+           const basic_string<_CharT, _Traits, _Allocator>& __rhs) _NOEXCEPT
+{
+    return !(__rhs < __lhs);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator<=(const basic_string<_CharT, _Traits, _Allocator>& __lhs,
+           const _CharT* __rhs) _NOEXCEPT
+{
+    return !(__rhs < __lhs);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator<=(const _CharT* __lhs,
+           const basic_string<_CharT, _Traits, _Allocator>& __rhs) _NOEXCEPT
+{
+    return !(__rhs < __lhs);
+}
+
+// operator>=
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator>=(const basic_string<_CharT, _Traits, _Allocator>& __lhs,
+           const basic_string<_CharT, _Traits, _Allocator>& __rhs) _NOEXCEPT
+{
+    return !(__lhs < __rhs);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator>=(const basic_string<_CharT, _Traits, _Allocator>& __lhs,
+           const _CharT* __rhs) _NOEXCEPT
+{
+    return !(__lhs < __rhs);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator>=(const _CharT* __lhs,
+           const basic_string<_CharT, _Traits, _Allocator>& __rhs) _NOEXCEPT
+{
+    return !(__lhs < __rhs);
+}
+#endif // _LIBCPP_STD_VER > 17
+
+// operator +
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(const basic_string<_CharT, _Traits, _Allocator>& __lhs,
+          const basic_string<_CharT, _Traits, _Allocator>& __rhs)
+{
+    using _String = basic_string<_CharT, _Traits, _Allocator>;
+    auto __lhs_sz = __lhs.size();
+    auto __rhs_sz = __rhs.size();
+    _String __r(__uninitialized_size_tag(),
+                __lhs_sz + __rhs_sz,
+                _String::__alloc_traits::select_on_container_copy_construction(__lhs.get_allocator()));
+    auto __ptr = std::__to_address(__r.__get_pointer());
+    _Traits::copy(__ptr, __lhs.data(), __lhs_sz);
+    _Traits::copy(__ptr + __lhs_sz, __rhs.data(), __rhs_sz);
+    _Traits::assign(__ptr + __lhs_sz + __rhs_sz, 1, _CharT());
+    return __r;
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDDEN _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(const _CharT* __lhs , const basic_string<_CharT,_Traits,_Allocator>& __rhs)
+{
+    using _String = basic_string<_CharT, _Traits, _Allocator>;
+    auto __lhs_sz = _Traits::length(__lhs);
+    auto __rhs_sz = __rhs.size();
+    _String __r(__uninitialized_size_tag(),
+                __lhs_sz + __rhs_sz,
+                _String::__alloc_traits::select_on_container_copy_construction(__rhs.get_allocator()));
+    auto __ptr = std::__to_address(__r.__get_pointer());
+    _Traits::copy(__ptr, __lhs, __lhs_sz);
+    _Traits::copy(__ptr + __lhs_sz, __rhs.data(), __rhs_sz);
+    _Traits::assign(__ptr + __lhs_sz + __rhs_sz, 1, _CharT());
+    return __r;
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Allocator>& __rhs)
+{
+    using _String = basic_string<_CharT, _Traits, _Allocator>;
+    typename _String::size_type __rhs_sz = __rhs.size();
+    _String __r(__uninitialized_size_tag(),
+                __rhs_sz + 1,
+                _String::__alloc_traits::select_on_container_copy_construction(__rhs.get_allocator()));
+    auto __ptr = std::__to_address(__r.__get_pointer());
+    _Traits::assign(__ptr, 1, __lhs);
+    _Traits::copy(__ptr + 1, __rhs.data(), __rhs_sz);
+    _Traits::assign(__ptr + 1 + __rhs_sz, 1, _CharT());
+    return __r;
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(const basic_string<_CharT, _Traits, _Allocator>& __lhs, const _CharT* __rhs)
+{
+    using _String = basic_string<_CharT, _Traits, _Allocator>;
+    typename _String::size_type __lhs_sz = __lhs.size();
+    typename _String::size_type __rhs_sz = _Traits::length(__rhs);
+    _String __r(__uninitialized_size_tag(),
+                __lhs_sz + __rhs_sz,
+                _String::__alloc_traits::select_on_container_copy_construction(__lhs.get_allocator()));
+    auto __ptr = std::__to_address(__r.__get_pointer());
+    _Traits::copy(__ptr, __lhs.data(), __lhs_sz);
+    _Traits::copy(__ptr + __lhs_sz, __rhs, __rhs_sz);
+    _Traits::assign(__ptr + __lhs_sz + __rhs_sz, 1, _CharT());
+    return __r;
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(const basic_string<_CharT, _Traits, _Allocator>& __lhs, _CharT __rhs)
+{
+    using _String = basic_string<_CharT, _Traits, _Allocator>;
+    typename _String::size_type __lhs_sz = __lhs.size();
+    _String __r(__uninitialized_size_tag(),
+                __lhs_sz + 1,
+                _String::__alloc_traits::select_on_container_copy_construction(__lhs.get_allocator()));
+    auto __ptr = std::__to_address(__r.__get_pointer());
+    _Traits::copy(__ptr, __lhs.data(), __lhs_sz);
+    _Traits::assign(__ptr + __lhs_sz, 1, __rhs);
+    _Traits::assign(__ptr + 1 + __lhs_sz, 1, _CharT());
+    return __r;
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(basic_string<_CharT, _Traits, _Allocator>&& __lhs, const basic_string<_CharT, _Traits, _Allocator>& __rhs)
+{
+    return std::move(__lhs.append(__rhs));
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(const basic_string<_CharT, _Traits, _Allocator>& __lhs, basic_string<_CharT, _Traits, _Allocator>&& __rhs)
+{
+    return std::move(__rhs.insert(0, __lhs));
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(basic_string<_CharT, _Traits, _Allocator>&& __lhs, basic_string<_CharT, _Traits, _Allocator>&& __rhs)
+{
+    return std::move(__lhs.append(__rhs));
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(const _CharT* __lhs , basic_string<_CharT,_Traits,_Allocator>&& __rhs)
+{
+    return std::move(__rhs.insert(0, __lhs));
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(_CharT __lhs, basic_string<_CharT,_Traits,_Allocator>&& __rhs)
+{
+    __rhs.insert(__rhs.begin(), __lhs);
+    return std::move(__rhs);
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(basic_string<_CharT, _Traits, _Allocator>&& __lhs, const _CharT* __rhs)
+{
+    return std::move(__lhs.append(__rhs));
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+basic_string<_CharT, _Traits, _Allocator>
+operator+(basic_string<_CharT, _Traits, _Allocator>&& __lhs, _CharT __rhs)
+{
+    __lhs.push_back(__rhs);
+    return std::move(__lhs);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+// swap
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+swap(basic_string<_CharT, _Traits, _Allocator>& __lhs,
+     basic_string<_CharT, _Traits, _Allocator>& __rhs)
+     _NOEXCEPT_(_NOEXCEPT_(__lhs.swap(__rhs)))
+{
+    __lhs.swap(__rhs);
+}
+
+_LIBCPP_FUNC_VIS int                stoi  (const string& __str, size_t* __idx = nullptr, int __base = 10);
+_LIBCPP_FUNC_VIS long               stol  (const string& __str, size_t* __idx = nullptr, int __base = 10);
+_LIBCPP_FUNC_VIS unsigned long      stoul (const string& __str, size_t* __idx = nullptr, int __base = 10);
+_LIBCPP_FUNC_VIS long long          stoll (const string& __str, size_t* __idx = nullptr, int __base = 10);
+_LIBCPP_FUNC_VIS unsigned long long stoull(const string& __str, size_t* __idx = nullptr, int __base = 10);
+
+_LIBCPP_FUNC_VIS float       stof (const string& __str, size_t* __idx = nullptr);
+_LIBCPP_FUNC_VIS double      stod (const string& __str, size_t* __idx = nullptr);
+_LIBCPP_FUNC_VIS long double stold(const string& __str, size_t* __idx = nullptr);
+
+_LIBCPP_FUNC_VIS string to_string(int __val);
+_LIBCPP_FUNC_VIS string to_string(unsigned __val);
+_LIBCPP_FUNC_VIS string to_string(long __val);
+_LIBCPP_FUNC_VIS string to_string(unsigned long __val);
+_LIBCPP_FUNC_VIS string to_string(long long __val);
+_LIBCPP_FUNC_VIS string to_string(unsigned long long __val);
+_LIBCPP_FUNC_VIS string to_string(float __val);
+_LIBCPP_FUNC_VIS string to_string(double __val);
+_LIBCPP_FUNC_VIS string to_string(long double __val);
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+_LIBCPP_FUNC_VIS int                stoi  (const wstring& __str, size_t* __idx = nullptr, int __base = 10);
+_LIBCPP_FUNC_VIS long               stol  (const wstring& __str, size_t* __idx = nullptr, int __base = 10);
+_LIBCPP_FUNC_VIS unsigned long      stoul (const wstring& __str, size_t* __idx = nullptr, int __base = 10);
+_LIBCPP_FUNC_VIS long long          stoll (const wstring& __str, size_t* __idx = nullptr, int __base = 10);
+_LIBCPP_FUNC_VIS unsigned long long stoull(const wstring& __str, size_t* __idx = nullptr, int __base = 10);
+
+_LIBCPP_FUNC_VIS float       stof (const wstring& __str, size_t* __idx = nullptr);
+_LIBCPP_FUNC_VIS double      stod (const wstring& __str, size_t* __idx = nullptr);
+_LIBCPP_FUNC_VIS long double stold(const wstring& __str, size_t* __idx = nullptr);
+
+_LIBCPP_FUNC_VIS wstring to_wstring(int __val);
+_LIBCPP_FUNC_VIS wstring to_wstring(unsigned __val);
+_LIBCPP_FUNC_VIS wstring to_wstring(long __val);
+_LIBCPP_FUNC_VIS wstring to_wstring(unsigned long __val);
+_LIBCPP_FUNC_VIS wstring to_wstring(long long __val);
+_LIBCPP_FUNC_VIS wstring to_wstring(unsigned long long __val);
+_LIBCPP_FUNC_VIS wstring to_wstring(float __val);
+_LIBCPP_FUNC_VIS wstring to_wstring(double __val);
+_LIBCPP_FUNC_VIS wstring to_wstring(long double __val);
+#endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_TEMPLATE_DATA_VIS
+const typename basic_string<_CharT, _Traits, _Allocator>::size_type
+               basic_string<_CharT, _Traits, _Allocator>::npos;
+
+template <class _CharT, class _Allocator>
+struct __string_hash : public __unary_function<basic_string<_CharT, char_traits<_CharT>, _Allocator>, size_t>
+{
+    size_t
+    operator()(const basic_string<_CharT, char_traits<_CharT>, _Allocator>& __val) const _NOEXCEPT
+    { return std::__do_string_hash(__val.data(), __val.data() + __val.size()); }
+};
+
+template <class _Allocator>
+struct hash<basic_string<char, char_traits<char>, _Allocator> > : __string_hash<char, _Allocator> {};
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+template <class _Allocator>
+struct hash<basic_string<char8_t, char_traits<char8_t>, _Allocator> > : __string_hash<char8_t, _Allocator> {};
+#endif
+
+template <class _Allocator>
+struct hash<basic_string<char16_t, char_traits<char16_t>, _Allocator> > : __string_hash<char16_t, _Allocator> {};
+
+template <class _Allocator>
+struct hash<basic_string<char32_t, char_traits<char32_t>, _Allocator> > : __string_hash<char32_t, _Allocator> {};
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <class _Allocator>
+struct hash<basic_string<wchar_t, char_traits<wchar_t>, _Allocator> > : __string_hash<wchar_t, _Allocator> {};
+#endif
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           const basic_string<_CharT, _Traits, _Allocator>& __str);
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+operator>>(basic_istream<_CharT, _Traits>& __is,
+           basic_string<_CharT, _Traits, _Allocator>& __str);
+
+template<class _CharT, class _Traits, class _Allocator>
+_LIBCPP_HIDE_FROM_ABI basic_istream<_CharT, _Traits>&
+getline(basic_istream<_CharT, _Traits>& __is,
+        basic_string<_CharT, _Traits, _Allocator>& __str, _CharT __dlm);
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+basic_istream<_CharT, _Traits>&
+getline(basic_istream<_CharT, _Traits>& __is,
+        basic_string<_CharT, _Traits, _Allocator>& __str);
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+basic_istream<_CharT, _Traits>&
+getline(basic_istream<_CharT, _Traits>&& __is,
+        basic_string<_CharT, _Traits, _Allocator>& __str, _CharT __dlm);
+
+template<class _CharT, class _Traits, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+basic_istream<_CharT, _Traits>&
+getline(basic_istream<_CharT, _Traits>&& __is,
+        basic_string<_CharT, _Traits, _Allocator>& __str);
+
+#if _LIBCPP_STD_VER > 17
+template <class _CharT, class _Traits, class _Allocator, class _Up>
+inline _LIBCPP_HIDE_FROM_ABI
+    typename basic_string<_CharT, _Traits, _Allocator>::size_type
+    erase(basic_string<_CharT, _Traits, _Allocator>& __str, const _Up& __v) {
+  auto __old_size = __str.size();
+  __str.erase(std::remove(__str.begin(), __str.end(), __v), __str.end());
+  return __old_size - __str.size();
+}
+
+template <class _CharT, class _Traits, class _Allocator, class _Predicate>
+inline _LIBCPP_HIDE_FROM_ABI
+    typename basic_string<_CharT, _Traits, _Allocator>::size_type
+    erase_if(basic_string<_CharT, _Traits, _Allocator>& __str,
+             _Predicate __pred) {
+  auto __old_size = __str.size();
+  __str.erase(std::remove_if(__str.begin(), __str.end(), __pred),
+              __str.end());
+  return __old_size - __str.size();
+}
+#endif
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+template<class _CharT, class _Traits, class _Allocator>
+bool
+basic_string<_CharT, _Traits, _Allocator>::__dereferenceable(const const_iterator* __i) const
+{
+    return data() <= std::__to_address(__i->base()) &&
+           std::__to_address(__i->base()) < data() + size();
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+bool
+basic_string<_CharT, _Traits, _Allocator>::__decrementable(const const_iterator* __i) const
+{
+    return data() < std::__to_address(__i->base()) &&
+           std::__to_address(__i->base()) <= data() + size();
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+bool
+basic_string<_CharT, _Traits, _Allocator>::__addable(const const_iterator* __i, ptrdiff_t __n) const
+{
+    const value_type* __p = std::__to_address(__i->base()) + __n;
+    return data() <= __p && __p <= data() + size();
+}
+
+template<class _CharT, class _Traits, class _Allocator>
+bool
+basic_string<_CharT, _Traits, _Allocator>::__subscriptable(const const_iterator* __i, ptrdiff_t __n) const
+{
+    const value_type* __p = std::__to_address(__i->base()) + __n;
+    return data() <= __p && __p < data() + size();
+}
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+#if _LIBCPP_STD_VER > 11
+// Literal suffixes for basic_string [basic.string.literals]
+inline namespace literals
+{
+  inline namespace string_literals
+  {
+    inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string<char> operator "" s( const char *__str, size_t __len )
+    {
+        return basic_string<char> (__str, __len);
+    }
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+    inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string<wchar_t> operator "" s( const wchar_t *__str, size_t __len )
+    {
+        return basic_string<wchar_t> (__str, __len);
+    }
+#endif
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+    inline _LIBCPP_HIDE_FROM_ABI constexpr
+    basic_string<char8_t> operator "" s(const char8_t *__str, size_t __len)
+    {
+        return basic_string<char8_t> (__str, __len);
+    }
+#endif
+
+    inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string<char16_t> operator "" s( const char16_t *__str, size_t __len )
+    {
+        return basic_string<char16_t> (__str, __len);
+    }
+
+    inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    basic_string<char32_t> operator "" s( const char32_t *__str, size_t __len )
+    {
+        return basic_string<char32_t> (__str, __len);
+    }
+  } // namespace string_literals
+} // namespace literals
+
+#if _LIBCPP_STD_VER > 17
+template <>
+inline constexpr bool __format::__enable_insertable<std::basic_string<char>> = true;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+inline constexpr bool __format::__enable_insertable<std::basic_string<wchar_t>> = true;
+#endif
+#endif
+
+#endif
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <algorithm>
+#  include <concepts>
+#  include <functional>
+#  include <iterator>
+#  include <new>
+#  include <typeinfo>
+#  include <utility>
+#  include <vector>
+#endif
+
+#endif // _LIBCPP_STRING
diff --git a/app/src/main/cpp/libcxx/include/string.h b/app/src/main/cpp/libcxx/include/string.h
new file mode 100644
index 0000000..3ec877b
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/string.h
@@ -0,0 +1,111 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_STRING_H
+#define _LIBCPP_STRING_H
+
+/*
+    string.h synopsis
+
+Macros:
+
+    NULL
+
+Types:
+
+    size_t
+
+void* memcpy(void* restrict s1, const void* restrict s2, size_t n);
+void* memmove(void* s1, const void* s2, size_t n);
+char* strcpy (char* restrict s1, const char* restrict s2);
+char* strncpy(char* restrict s1, const char* restrict s2, size_t n);
+char* strcat (char* restrict s1, const char* restrict s2);
+char* strncat(char* restrict s1, const char* restrict s2, size_t n);
+int memcmp(const void* s1, const void* s2, size_t n);
+int strcmp (const char* s1, const char* s2);
+int strncmp(const char* s1, const char* s2, size_t n);
+int strcoll(const char* s1, const char* s2);
+size_t strxfrm(char* restrict s1, const char* restrict s2, size_t n);
+const void* memchr(const void* s, int c, size_t n);
+      void* memchr(      void* s, int c, size_t n);
+const char* strchr(const char* s, int c);
+      char* strchr(      char* s, int c);
+size_t strcspn(const char* s1, const char* s2);
+const char* strpbrk(const char* s1, const char* s2);
+      char* strpbrk(      char* s1, const char* s2);
+const char* strrchr(const char* s, int c);
+      char* strrchr(      char* s, int c);
+size_t strspn(const char* s1, const char* s2);
+const char* strstr(const char* s1, const char* s2);
+      char* strstr(      char* s1, const char* s2);
+char* strtok(char* restrict s1, const char* restrict s2);
+void* memset(void* s, int c, size_t n);
+char* strerror(int errnum);
+size_t strlen(const char* s);
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if __has_include_next(<string.h>)
+#  include_next <string.h>
+#endif
+
+// MSVCRT, GNU libc and its derivates may already have the correct prototype in
+// <string.h>. This macro can be defined by users if their C library provides
+// the right signature.
+#if defined(__CORRECT_ISO_CPP_STRING_H_PROTO) || defined(_LIBCPP_MSVCRT) || \
+    defined(__sun__) || defined(_STRING_H_CPLUSPLUS_98_CONFORMANCE_)
+#define _LIBCPP_STRING_H_HAS_CONST_OVERLOADS
+#endif
+
+#if defined(__cplusplus) && !defined(_LIBCPP_STRING_H_HAS_CONST_OVERLOADS) && defined(_LIBCPP_PREFERRED_OVERLOAD)
+extern "C++" {
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_PREFERRED_OVERLOAD const char* strchr(const char* __s, int __c) {
+  return __builtin_strchr(__s, __c);
+}
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_PREFERRED_OVERLOAD char* strchr(char* __s, int __c) {
+  return __builtin_strchr(__s, __c);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_PREFERRED_OVERLOAD const char* strpbrk(const char* __s1, const char* __s2) {
+  return __builtin_strpbrk(__s1, __s2);
+}
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_PREFERRED_OVERLOAD char* strpbrk(char* __s1, const char* __s2) {
+  return __builtin_strpbrk(__s1, __s2);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_PREFERRED_OVERLOAD const char* strrchr(const char* __s, int __c) {
+  return __builtin_strrchr(__s, __c);
+}
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_PREFERRED_OVERLOAD char* strrchr(char* __s, int __c) {
+  return __builtin_strrchr(__s, __c);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_PREFERRED_OVERLOAD const void* memchr(const void* __s, int __c, size_t __n) {
+  return __builtin_memchr(__s, __c, __n);
+}
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_PREFERRED_OVERLOAD void* memchr(void* __s, int __c, size_t __n) {
+  return __builtin_memchr(__s, __c, __n);
+}
+
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_PREFERRED_OVERLOAD const char* strstr(const char* __s1, const char* __s2) {
+  return __builtin_strstr(__s1, __s2);
+}
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_PREFERRED_OVERLOAD char* strstr(char* __s1, const char* __s2) {
+  return __builtin_strstr(__s1, __s2);
+}
+} // extern "C++"
+#endif
+
+#endif // _LIBCPP_STRING_H
diff --git a/app/src/main/cpp/libcxx/include/string_view b/app/src/main/cpp/libcxx/include/string_view
new file mode 100644
index 0000000..ea98e38
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/string_view
@@ -0,0 +1,1031 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_STRING_VIEW
+#define _LIBCPP_STRING_VIEW
+
+/*
+
+    string_view synopsis
+
+#include <compare>
+
+namespace std {
+
+    // 7.2, Class template basic_string_view
+    template<class charT, class traits = char_traits<charT>>
+        class basic_string_view;
+
+    template<class charT, class traits>
+    inline constexpr bool ranges::enable_view<basic_string_view<charT, traits>> = true;
+
+    template<class charT, class traits>
+    inline constexpr bool ranges::enable_borrowed_range<basic_string_view<charT, traits>> = true;  // C++20
+
+    // 7.9, basic_string_view non-member comparison functions
+    template<class charT, class traits>
+    constexpr bool operator==(basic_string_view<charT, traits> x,
+                              basic_string_view<charT, traits> y) noexcept;
+    template<class charT, class traits>                                                            // Removed in C++20
+    constexpr bool operator!=(basic_string_view<charT, traits> x,
+                              basic_string_view<charT, traits> y) noexcept;
+    template<class charT, class traits>                                                            // Removed in C++20
+    constexpr bool operator< (basic_string_view<charT, traits> x,
+                                 basic_string_view<charT, traits> y) noexcept;
+    template<class charT, class traits>                                                            // Removed in C++20
+    constexpr bool operator> (basic_string_view<charT, traits> x,
+                              basic_string_view<charT, traits> y) noexcept;
+    template<class charT, class traits>                                                            // Removed in C++20
+    constexpr bool operator<=(basic_string_view<charT, traits> x,
+                                 basic_string_view<charT, traits> y) noexcept;
+    template<class charT, class traits>                                                            // Removed in C++20
+    constexpr bool operator>=(basic_string_view<charT, traits> x,
+                              basic_string_view<charT, traits> y) noexcept;
+    template<class charT, class traits>                                                            // Since C++20
+    constexpr see below operator<=>(basic_string_view<charT, traits> x,
+                                    basic_string_view<charT, traits> y) noexcept;
+
+    // see below, sufficient additional overloads of comparison functions
+
+    // 7.10, Inserters and extractors
+    template<class charT, class traits>
+      basic_ostream<charT, traits>&
+        operator<<(basic_ostream<charT, traits>& os,
+                   basic_string_view<charT, traits> str);
+
+    // basic_string_view typedef names
+    typedef basic_string_view<char> string_view;
+    typedef basic_string_view<char8_t> u8string_view; // C++20
+    typedef basic_string_view<char16_t> u16string_view;
+    typedef basic_string_view<char32_t> u32string_view;
+    typedef basic_string_view<wchar_t> wstring_view;
+
+    template<class charT, class traits = char_traits<charT>>
+    class basic_string_view {
+      public:
+      // types
+      typedef traits traits_type;
+      typedef charT value_type;
+      typedef charT* pointer;
+      typedef const charT* const_pointer;
+      typedef charT& reference;
+      typedef const charT& const_reference;
+      typedef implementation-defined const_iterator;
+      typedef const_iterator iterator;
+      typedef reverse_iterator<const_iterator> const_reverse_iterator;
+      typedef const_reverse_iterator reverse_iterator;
+      typedef size_t size_type;
+      typedef ptrdiff_t difference_type;
+      static constexpr size_type npos = size_type(-1);
+
+      // 7.3, basic_string_view constructors and assignment operators
+      constexpr basic_string_view() noexcept;
+      constexpr basic_string_view(const basic_string_view&) noexcept = default;
+      basic_string_view& operator=(const basic_string_view&) noexcept = default;
+      template<class Allocator>
+      constexpr basic_string_view(const charT* str);
+      basic_string_view(nullptr_t) = delete; // C++2b
+      constexpr basic_string_view(const charT* str, size_type len);
+      template <class It, class End>
+      constexpr basic_string_view(It begin, End end); // C++20
+      template <class Range>
+      constexpr basic_string_view(Range&& r); // C++23
+
+      // 7.4, basic_string_view iterator support
+      constexpr const_iterator begin() const noexcept;
+      constexpr const_iterator end() const noexcept;
+      constexpr const_iterator cbegin() const noexcept;
+      constexpr const_iterator cend() const noexcept;
+      const_reverse_iterator rbegin() const noexcept;
+      const_reverse_iterator rend() const noexcept;
+      const_reverse_iterator crbegin() const noexcept;
+      const_reverse_iterator crend() const noexcept;
+
+      // 7.5, basic_string_view capacity
+      constexpr size_type size() const noexcept;
+      constexpr size_type length() const noexcept;
+      constexpr size_type max_size() const noexcept;
+      constexpr bool empty() const noexcept;
+
+      // 7.6, basic_string_view element access
+      constexpr const_reference operator[](size_type pos) const;
+      constexpr const_reference at(size_type pos) const;
+      constexpr const_reference front() const;
+      constexpr const_reference back() const;
+      constexpr const_pointer data() const noexcept;
+
+      // 7.7, basic_string_view modifiers
+      constexpr void remove_prefix(size_type n);
+      constexpr void remove_suffix(size_type n);
+      constexpr void swap(basic_string_view& s) noexcept;
+
+      size_type copy(charT* s, size_type n, size_type pos = 0) const;  // constexpr in C++20
+
+      constexpr basic_string_view substr(size_type pos = 0, size_type n = npos) const;
+      constexpr int compare(basic_string_view s) const noexcept;
+      constexpr int compare(size_type pos1, size_type n1, basic_string_view s) const;
+      constexpr int compare(size_type pos1, size_type n1,
+                            basic_string_view s, size_type pos2, size_type n2) const;
+      constexpr int compare(const charT* s) const;
+      constexpr int compare(size_type pos1, size_type n1, const charT* s) const;
+      constexpr int compare(size_type pos1, size_type n1,
+                            const charT* s, size_type n2) const;
+      constexpr size_type find(basic_string_view s, size_type pos = 0) const noexcept;
+      constexpr size_type find(charT c, size_type pos = 0) const noexcept;
+      constexpr size_type find(const charT* s, size_type pos, size_type n) const noexcept; // noexcept as an extension
+      constexpr size_type find(const charT* s, size_type pos = 0) const noexcept; // noexcept as an extension
+      constexpr size_type rfind(basic_string_view s, size_type pos = npos) const noexcept;
+      constexpr size_type rfind(charT c, size_type pos = npos) const noexcept;
+      constexpr size_type rfind(const charT* s, size_type pos, size_type n) const noexcept; // noexcept as an extension
+      constexpr size_type rfind(const charT* s, size_type pos = npos) const noexcept; // noexcept as an extension
+      constexpr size_type find_first_of(basic_string_view s, size_type pos = 0) const noexcept;
+      constexpr size_type find_first_of(charT c, size_type pos = 0) const noexcept;
+      constexpr size_type find_first_of(const charT* s, size_type pos, size_type n) const noexcept; // noexcept as an extension
+      constexpr size_type find_first_of(const charT* s, size_type pos = 0) const noexcept; // noexcept as an extension
+      constexpr size_type find_last_of(basic_string_view s, size_type pos = npos) const noexcept;
+      constexpr size_type find_last_of(charT c, size_type pos = npos) const noexcept;
+      constexpr size_type find_last_of(const charT* s, size_type pos, size_type n) const noexcept; // noexcept as an extension
+      constexpr size_type find_last_of(const charT* s, size_type pos = npos) const noexcept; // noexcept as an extension
+      constexpr size_type find_first_not_of(basic_string_view s, size_type pos = 0) const noexcept;
+      constexpr size_type find_first_not_of(charT c, size_type pos = 0) const noexcept;
+      constexpr size_type find_first_not_of(const charT* s, size_type pos, size_type n) const noexcept; // noexcept as an extension
+      constexpr size_type find_first_not_of(const charT* s, size_type pos = 0) const noexcept; // noexcept as an extension
+      constexpr size_type find_last_not_of(basic_string_view s, size_type pos = npos) const noexcept;
+      constexpr size_type find_last_not_of(charT c, size_type pos = npos) const noexcept;
+      constexpr size_type find_last_not_of(const charT* s, size_type pos, size_type n) const noexcept; // noexcept as an extension
+      constexpr size_type find_last_not_of(const charT* s, size_type pos = npos) const noexcept; // noexcept as an extension
+
+      constexpr bool starts_with(basic_string_view s) const noexcept; // C++20
+      constexpr bool starts_with(charT c) const noexcept;             // C++20
+      constexpr bool starts_with(const charT* s) const;               // C++20
+      constexpr bool ends_with(basic_string_view s) const noexcept;   // C++20
+      constexpr bool ends_with(charT c) const noexcept;               // C++20
+      constexpr bool ends_with(const charT* s) const;                 // C++20
+
+      constexpr bool contains(basic_string_view s) const noexcept; // C++2b
+      constexpr bool contains(charT c) const noexcept;             // C++2b
+      constexpr bool contains(const charT* s) const;               // C++2b
+
+     private:
+      const_pointer data_;  // exposition only
+      size_type     size_;  // exposition only
+    };
+
+  // basic_string_view deduction guides
+  template<class It, class End>
+    basic_string_view(It, End) -> basic_string_view<iter_value_t<It>>; // C++20
+  template<class Range>
+    basic_string_view(Range&&) -> basic_string_view<ranges::range_value_t<Range>>; // C++23
+
+  // 7.11, Hash support
+  template <class T> struct hash;
+  template <> struct hash<string_view>;
+  template <> struct hash<u8string_view>; // C++20
+  template <> struct hash<u16string_view>;
+  template <> struct hash<u32string_view>;
+  template <> struct hash<wstring_view>;
+
+  constexpr basic_string_view<char>     operator "" sv(const char *str,     size_t len) noexcept;
+  constexpr basic_string_view<wchar_t>  operator "" sv(const wchar_t *str,  size_t len) noexcept;
+  constexpr basic_string_view<char8_t>  operator "" sv(const char8_t *str,  size_t len) noexcept; // C++20
+  constexpr basic_string_view<char16_t> operator "" sv(const char16_t *str, size_t len) noexcept;
+  constexpr basic_string_view<char32_t> operator "" sv(const char32_t *str, size_t len) noexcept;
+
+}  // namespace std
+
+
+*/
+
+#include <__algorithm/min.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__functional/hash.h>
+#include <__functional/unary_function.h>
+#include <__fwd/string_view.h>
+#include <__iterator/concepts.h>
+#include <__iterator/readable_traits.h>
+#include <__iterator/reverse_iterator.h>
+#include <__memory/pointer_traits.h>
+#include <__ranges/concepts.h>
+#include <__ranges/data.h>
+#include <__ranges/enable_borrowed_range.h>
+#include <__ranges/enable_view.h>
+#include <__ranges/size.h>
+#include <__string/char_traits.h>
+#include <iosfwd>
+#include <limits>
+#include <stdexcept>
+#include <type_traits>
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+// [string.view.synop]
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// TODO: This is a workaround for some vendors to carry a downstream diff to accept `nullptr` in
+//       string_view constructors. This can be refactored when this exact form isn't needed anymore.
+template <class _Traits>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR
+inline size_t __char_traits_length_checked(const typename _Traits::char_type* __s) _NOEXCEPT {
+  // This needs to be a single statement for C++11 constexpr
+  return _LIBCPP_ASSERT(__s != nullptr, "null pointer passed to non-null argument of char_traits<...>::length"), _Traits::length(__s);
+}
+
+template<class _CharT, class _Traits>
+class basic_string_view {
+public:
+    // types
+    using traits_type            = _Traits;
+    using value_type             = _CharT;
+    using pointer                = _CharT*;
+    using const_pointer          = const _CharT*;
+    using reference              = _CharT&;
+    using const_reference        = const _CharT&;
+    using const_iterator         = const_pointer; // See [string.view.iterators]
+    using iterator               = const_iterator;
+    using const_reverse_iterator = _VSTD::reverse_iterator<const_iterator>;
+    using reverse_iterator       = const_reverse_iterator;
+    using size_type              = size_t;
+    using difference_type        = ptrdiff_t;
+    static _LIBCPP_CONSTEXPR const size_type npos = -1; // size_type(-1);
+
+    static_assert((!is_array<value_type>::value), "Character type of basic_string_view must not be an array");
+    static_assert(( is_standard_layout<value_type>::value), "Character type of basic_string_view must be standard-layout");
+    static_assert(( is_trivial<value_type>::value), "Character type of basic_string_view must be trivial");
+    static_assert((is_same<_CharT, typename traits_type::char_type>::value),
+                  "traits_type::char_type must be the same type as CharT");
+
+    // [string.view.cons], construct/copy
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    basic_string_view() _NOEXCEPT : __data_(nullptr), __size_(0) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_string_view(const basic_string_view&) _NOEXCEPT = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    basic_string_view& operator=(const basic_string_view&) _NOEXCEPT = default;
+
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    basic_string_view(const _CharT* __s, size_type __len) _NOEXCEPT
+        : __data_(__s), __size_(__len)
+    {
+#if _LIBCPP_STD_VER > 11
+    _LIBCPP_ASSERT(__len == 0 || __s != nullptr, "string_view::string_view(_CharT *, size_t): received nullptr");
+#endif
+    }
+
+#if _LIBCPP_STD_VER > 17
+    template <contiguous_iterator _It, sized_sentinel_for<_It> _End>
+      requires (is_same_v<iter_value_t<_It>, _CharT> && !is_convertible_v<_End, size_type>)
+    constexpr _LIBCPP_HIDE_FROM_ABI basic_string_view(_It __begin, _End __end)
+       : __data_(_VSTD::to_address(__begin)), __size_(__end - __begin)
+    {
+      _LIBCPP_ASSERT((__end - __begin) >= 0, "std::string_view::string_view(iterator, sentinel) received invalid range");
+    }
+#endif // _LIBCPP_STD_VER > 17
+
+#if _LIBCPP_STD_VER > 20
+    template <class _Range>
+      requires (
+        !is_same_v<remove_cvref_t<_Range>, basic_string_view> &&
+        ranges::contiguous_range<_Range> &&
+        ranges::sized_range<_Range> &&
+        is_same_v<ranges::range_value_t<_Range>, _CharT> &&
+        !is_convertible_v<_Range, const _CharT*> &&
+        (!requires(remove_cvref_t<_Range>& __d) {
+          __d.operator _VSTD::basic_string_view<_CharT, _Traits>();
+        }) &&
+        (!requires {
+         typename remove_reference_t<_Range>::traits_type;
+        } || is_same_v<typename remove_reference_t<_Range>::traits_type, _Traits>)
+      )
+    constexpr explicit _LIBCPP_HIDE_FROM_ABI
+    basic_string_view(_Range&& __r) : __data_(ranges::data(__r)), __size_(ranges::size(__r)) {}
+#endif // _LIBCPP_STD_VER > 20
+
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    basic_string_view(const _CharT* __s)
+        : __data_(__s), __size_(_VSTD::__char_traits_length_checked<_Traits>(__s)) {}
+
+#if _LIBCPP_STD_VER > 20
+    basic_string_view(nullptr_t) = delete;
+#endif
+
+    // [string.view.iterators], iterators
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin()  const _NOEXCEPT { return cbegin(); }
+
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    const_iterator end()    const _NOEXCEPT { return cend(); }
+
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbegin() const _NOEXCEPT { return __data_; }
+
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    const_iterator cend()   const _NOEXCEPT { return __data_ + __size_; }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX17 _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator rbegin()   const _NOEXCEPT { return const_reverse_iterator(cend()); }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX17 _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator rend()     const _NOEXCEPT { return const_reverse_iterator(cbegin()); }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX17 _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator crbegin()  const _NOEXCEPT { return const_reverse_iterator(cend()); }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX17 _LIBCPP_INLINE_VISIBILITY
+    const_reverse_iterator crend()    const _NOEXCEPT { return const_reverse_iterator(cbegin()); }
+
+    // [string.view.capacity], capacity
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    size_type size()     const _NOEXCEPT { return __size_; }
+
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    size_type length()   const _NOEXCEPT { return __size_; }
+
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT { return numeric_limits<size_type>::max() / sizeof(value_type); }
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    bool empty()         const _NOEXCEPT { return __size_ == 0; }
+
+    // [string.view.access], element access
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    const_reference operator[](size_type __pos) const _NOEXCEPT {
+      return _LIBCPP_ASSERT(__pos < size(), "string_view[] index out of bounds"), __data_[__pos];
+    }
+
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    const_reference at(size_type __pos) const
+    {
+        return __pos >= size()
+            ? (__throw_out_of_range("string_view::at"), __data_[0])
+            : __data_[__pos];
+    }
+
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    const_reference front() const _NOEXCEPT
+    {
+        return _LIBCPP_ASSERT(!empty(), "string_view::front(): string is empty"), __data_[0];
+    }
+
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    const_reference back() const _NOEXCEPT
+    {
+        return _LIBCPP_ASSERT(!empty(), "string_view::back(): string is empty"), __data_[__size_-1];
+    }
+
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    const_pointer data() const _NOEXCEPT { return __data_; }
+
+    // [string.view.modifiers], modifiers:
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    void remove_prefix(size_type __n) _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__n <= size(), "remove_prefix() can't remove more than size()");
+        __data_ += __n;
+        __size_ -= __n;
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    void remove_suffix(size_type __n) _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__n <= size(), "remove_suffix() can't remove more than size()");
+        __size_ -= __n;
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    void swap(basic_string_view& __other) _NOEXCEPT
+    {
+        const value_type *__p = __data_;
+        __data_ = __other.__data_;
+        __other.__data_ = __p;
+
+        size_type __sz = __size_;
+        __size_ = __other.__size_;
+        __other.__size_ = __sz;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type copy(_CharT* __s, size_type __n, size_type __pos = 0) const
+    {
+        if (__pos > size())
+            __throw_out_of_range("string_view::copy");
+        size_type __rlen = _VSTD::min(__n, size() - __pos);
+        _Traits::copy(__s, data() + __pos, __rlen);
+        return __rlen;
+    }
+
+    _LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
+    basic_string_view substr(size_type __pos = 0, size_type __n = npos) const
+    {
+        return __pos > size()
+            ? (__throw_out_of_range("string_view::substr"), basic_string_view())
+            : basic_string_view(data() + __pos, _VSTD::min(__n, size() - __pos));
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 int compare(basic_string_view __sv) const _NOEXCEPT
+    {
+        size_type __rlen = _VSTD::min(size(), __sv.size());
+        int __retval = _Traits::compare(data(), __sv.data(), __rlen);
+        if (__retval == 0) // first __rlen chars matched
+            __retval = size() == __sv.size() ? 0 : (size() < __sv.size() ? -1 : 1);
+        return __retval;
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    int compare(size_type __pos1, size_type __n1, basic_string_view __sv) const
+    {
+        return substr(__pos1, __n1).compare(__sv);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    int compare(                       size_type __pos1, size_type __n1,
+                basic_string_view __sv, size_type __pos2, size_type __n2) const
+    {
+        return substr(__pos1, __n1).compare(__sv.substr(__pos2, __n2));
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    int compare(const _CharT* __s) const _NOEXCEPT
+    {
+        return compare(basic_string_view(__s));
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    int compare(size_type __pos1, size_type __n1, const _CharT* __s) const
+    {
+        return substr(__pos1, __n1).compare(basic_string_view(__s));
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    int compare(size_type __pos1, size_type __n1, const _CharT* __s, size_type __n2) const
+    {
+        return substr(__pos1, __n1).compare(basic_string_view(__s, __n2));
+    }
+
+    // find
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find(basic_string_view __s, size_type __pos = 0) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__s.size() == 0 || __s.data() != nullptr, "string_view::find(): received nullptr");
+        return std::__str_find<value_type, size_type, traits_type, npos>
+            (data(), size(), __s.data(), __pos, __s.size());
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find(_CharT __c, size_type __pos = 0) const _NOEXCEPT
+    {
+        return std::__str_find<value_type, size_type, traits_type, npos>
+            (data(), size(), __c, __pos);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find(const _CharT* __s, size_type __pos, size_type __n) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string_view::find(): received nullptr");
+        return std::__str_find<value_type, size_type, traits_type, npos>
+            (data(), size(), __s, __pos, __n);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find(const _CharT* __s, size_type __pos = 0) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__s != nullptr, "string_view::find(): received nullptr");
+        return std::__str_find<value_type, size_type, traits_type, npos>
+            (data(), size(), __s, __pos, traits_type::length(__s));
+    }
+
+    // rfind
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type rfind(basic_string_view __s, size_type __pos = npos) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__s.size() == 0 || __s.data() != nullptr, "string_view::find(): received nullptr");
+        return std::__str_rfind<value_type, size_type, traits_type, npos>
+            (data(), size(), __s.data(), __pos, __s.size());
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type rfind(_CharT __c, size_type __pos = npos) const _NOEXCEPT
+    {
+        return std::__str_rfind<value_type, size_type, traits_type, npos>
+            (data(), size(), __c, __pos);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type rfind(const _CharT* __s, size_type __pos, size_type __n) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string_view::rfind(): received nullptr");
+        return std::__str_rfind<value_type, size_type, traits_type, npos>
+            (data(), size(), __s, __pos, __n);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type rfind(const _CharT* __s, size_type __pos=npos) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__s != nullptr, "string_view::rfind(): received nullptr");
+        return std::__str_rfind<value_type, size_type, traits_type, npos>
+            (data(), size(), __s, __pos, traits_type::length(__s));
+    }
+
+    // find_first_of
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_first_of(basic_string_view __s, size_type __pos = 0) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__s.size() == 0 || __s.data() != nullptr, "string_view::find_first_of(): received nullptr");
+        return std::__str_find_first_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __s.data(), __pos, __s.size());
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_first_of(_CharT __c, size_type __pos = 0) const _NOEXCEPT
+    { return find(__c, __pos); }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_first_of(const _CharT* __s, size_type __pos, size_type __n) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string_view::find_first_of(): received nullptr");
+        return std::__str_find_first_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __s, __pos, __n);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_first_of(const _CharT* __s, size_type __pos=0) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__s != nullptr, "string_view::find_first_of(): received nullptr");
+        return std::__str_find_first_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __s, __pos, traits_type::length(__s));
+    }
+
+    // find_last_of
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_last_of(basic_string_view __s, size_type __pos=npos) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__s.size() == 0 || __s.data() != nullptr, "string_view::find_last_of(): received nullptr");
+        return std::__str_find_last_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __s.data(), __pos, __s.size());
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_last_of(_CharT __c, size_type __pos = npos) const _NOEXCEPT
+    { return rfind(__c, __pos); }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_last_of(const _CharT* __s, size_type __pos, size_type __n) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string_view::find_last_of(): received nullptr");
+        return std::__str_find_last_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __s, __pos, __n);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_last_of(const _CharT* __s, size_type __pos=npos) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__s != nullptr, "string_view::find_last_of(): received nullptr");
+        return std::__str_find_last_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __s, __pos, traits_type::length(__s));
+    }
+
+    // find_first_not_of
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_first_not_of(basic_string_view __s, size_type __pos=0) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__s.size() == 0 || __s.data() != nullptr, "string_view::find_first_not_of(): received nullptr");
+        return std::__str_find_first_not_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __s.data(), __pos, __s.size());
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_first_not_of(_CharT __c, size_type __pos=0) const _NOEXCEPT
+    {
+        return std::__str_find_first_not_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __c, __pos);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string_view::find_first_not_of(): received nullptr");
+        return std::__str_find_first_not_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __s, __pos, __n);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_first_not_of(const _CharT* __s, size_type __pos=0) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__s != nullptr, "string_view::find_first_not_of(): received nullptr");
+        return std::__str_find_first_not_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __s, __pos, traits_type::length(__s));
+    }
+
+    // find_last_not_of
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_last_not_of(basic_string_view __s, size_type __pos=npos) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__s.size() == 0 || __s.data() != nullptr, "string_view::find_last_not_of(): received nullptr");
+        return std::__str_find_last_not_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __s.data(), __pos, __s.size());
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_last_not_of(_CharT __c, size_type __pos=npos) const _NOEXCEPT
+    {
+        return std::__str_find_last_not_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __c, __pos);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__n == 0 || __s != nullptr, "string_view::find_last_not_of(): received nullptr");
+        return std::__str_find_last_not_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __s, __pos, __n);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+    size_type find_last_not_of(const _CharT* __s, size_type __pos=npos) const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(__s != nullptr, "string_view::find_last_not_of(): received nullptr");
+        return std::__str_find_last_not_of<value_type, size_type, traits_type, npos>
+            (data(), size(), __s, __pos, traits_type::length(__s));
+    }
+
+#if _LIBCPP_STD_VER > 17
+    constexpr _LIBCPP_INLINE_VISIBILITY
+    bool starts_with(basic_string_view __s) const noexcept
+    { return size() >= __s.size() && compare(0, __s.size(), __s) == 0; }
+
+    constexpr _LIBCPP_INLINE_VISIBILITY
+    bool starts_with(value_type __c) const noexcept
+    { return !empty() && _Traits::eq(front(), __c); }
+
+    constexpr _LIBCPP_INLINE_VISIBILITY
+    bool starts_with(const value_type* __s) const noexcept
+    { return starts_with(basic_string_view(__s)); }
+
+    constexpr _LIBCPP_INLINE_VISIBILITY
+    bool ends_with(basic_string_view __s) const noexcept
+    { return size() >= __s.size() && compare(size() - __s.size(), npos, __s) == 0; }
+
+    constexpr _LIBCPP_INLINE_VISIBILITY
+    bool ends_with(value_type __c) const noexcept
+    { return !empty() && _Traits::eq(back(), __c); }
+
+    constexpr _LIBCPP_INLINE_VISIBILITY
+    bool ends_with(const value_type* __s) const noexcept
+    { return ends_with(basic_string_view(__s)); }
+#endif
+
+#if _LIBCPP_STD_VER > 20
+    constexpr _LIBCPP_INLINE_VISIBILITY
+    bool contains(basic_string_view __sv) const noexcept
+    { return find(__sv) != npos; }
+
+    constexpr _LIBCPP_INLINE_VISIBILITY
+    bool contains(value_type __c) const noexcept
+    { return find(__c) != npos; }
+
+    constexpr _LIBCPP_INLINE_VISIBILITY
+    bool contains(const value_type* __s) const
+    { return find(__s) != npos; }
+#endif
+
+private:
+    const   value_type* __data_;
+    size_type           __size_;
+};
+_LIBCPP_CTAD_SUPPORTED_FOR_TYPE(basic_string_view);
+
+#if _LIBCPP_STD_VER > 17
+template <class _CharT, class _Traits>
+inline constexpr bool ranges::enable_view<basic_string_view<_CharT, _Traits>> = true;
+
+template <class _CharT, class _Traits>
+inline constexpr bool ranges::enable_borrowed_range<basic_string_view<_CharT, _Traits> > = true;
+#endif // _LIBCPP_STD_VER > 17
+
+// [string.view.deduct]
+
+#if _LIBCPP_STD_VER > 17
+template <contiguous_iterator _It, sized_sentinel_for<_It> _End>
+  basic_string_view(_It, _End) -> basic_string_view<iter_value_t<_It>>;
+#endif // _LIBCPP_STD_VER > 17
+
+
+#if _LIBCPP_STD_VER > 20
+template <ranges::contiguous_range _Range>
+  basic_string_view(_Range) -> basic_string_view<ranges::range_value_t<_Range>>;
+#endif
+
+// [string.view.comparison]
+// operator ==
+template<class _CharT, class _Traits>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator==(basic_string_view<_CharT, _Traits> __lhs,
+                basic_string_view<_CharT, _Traits> __rhs) _NOEXCEPT
+{
+    if (__lhs.size() != __rhs.size()) return false;
+    return __lhs.compare(__rhs) == 0;
+}
+
+// The dummy default template parameters are used to work around a MSVC issue with mangling, see VSO-409326 for details.
+// This applies to the other sufficient overloads below for the other comparison operators.
+template<class _CharT, class _Traits, int = 1>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator==(basic_string_view<_CharT, _Traits> __lhs,
+                __type_identity_t<basic_string_view<_CharT, _Traits> > __rhs) _NOEXCEPT
+{
+    if (__lhs.size() != __rhs.size()) return false;
+    return __lhs.compare(__rhs) == 0;
+}
+
+#if _LIBCPP_STD_VER < 20
+// This overload is automatically generated in C++20.
+template<class _CharT, class _Traits, int = 2>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator==(__type_identity_t<basic_string_view<_CharT, _Traits> > __lhs,
+                basic_string_view<_CharT, _Traits> __rhs) _NOEXCEPT
+{
+    if (__lhs.size() != __rhs.size()) return false;
+    return __lhs.compare(__rhs) == 0;
+}
+#endif // _LIBCPP_STD_VER > 17
+
+// operator <=>
+
+#if _LIBCPP_STD_VER > 17
+
+template <class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI constexpr auto
+operator<=>(basic_string_view<_CharT, _Traits> __lhs, basic_string_view<_CharT, _Traits> __rhs) noexcept {
+    if constexpr (requires { typename _Traits::comparison_category; }) {
+        // [string.view]/4
+        static_assert(
+            __comparison_category<typename _Traits::comparison_category>,
+            "return type is not a comparison category type");
+        return static_cast<typename _Traits::comparison_category>(__lhs.compare(__rhs) <=> 0);
+    } else {
+        return static_cast<weak_ordering>(__lhs.compare(__rhs) <=> 0);
+    }
+}
+
+template <class _CharT, class _Traits, int = 1>
+_LIBCPP_HIDE_FROM_ABI constexpr auto operator<=>(
+    basic_string_view<_CharT, _Traits> __lhs, type_identity_t<basic_string_view<_CharT, _Traits>> __rhs) noexcept {
+    if constexpr (requires { typename _Traits::comparison_category; }) {
+        // [string.view]/4
+        static_assert(
+            __comparison_category<typename _Traits::comparison_category>,
+            "return type is not a comparison category type");
+        return static_cast<typename _Traits::comparison_category>(__lhs.compare(__rhs) <=> 0);
+    } else {
+        return static_cast<weak_ordering>(__lhs.compare(__rhs) <=> 0);
+    }
+}
+
+#else //  _LIBCPP_STD_VER > 17
+
+// operator !=
+template<class _CharT, class _Traits>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator!=(basic_string_view<_CharT, _Traits> __lhs, basic_string_view<_CharT, _Traits> __rhs) _NOEXCEPT
+{
+    if (__lhs.size() != __rhs.size())
+        return true;
+    return __lhs.compare(__rhs) != 0;
+}
+
+template<class _CharT, class _Traits, int = 1>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator!=(basic_string_view<_CharT, _Traits> __lhs,
+                __type_identity_t<basic_string_view<_CharT, _Traits> > __rhs) _NOEXCEPT
+{
+    if (__lhs.size() != __rhs.size())
+        return true;
+    return __lhs.compare(__rhs) != 0;
+}
+
+template<class _CharT, class _Traits, int = 2>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator!=(__type_identity_t<basic_string_view<_CharT, _Traits> > __lhs,
+                basic_string_view<_CharT, _Traits> __rhs) _NOEXCEPT
+{
+    if (__lhs.size() != __rhs.size())
+        return true;
+    return __lhs.compare(__rhs) != 0;
+}
+
+
+// operator <
+template<class _CharT, class _Traits>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator<(basic_string_view<_CharT, _Traits> __lhs, basic_string_view<_CharT, _Traits> __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) < 0;
+}
+
+template<class _CharT, class _Traits, int = 1>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator<(basic_string_view<_CharT, _Traits> __lhs,
+                __type_identity_t<basic_string_view<_CharT, _Traits> > __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) < 0;
+}
+
+template<class _CharT, class _Traits, int = 2>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator<(__type_identity_t<basic_string_view<_CharT, _Traits> > __lhs,
+                basic_string_view<_CharT, _Traits> __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) < 0;
+}
+
+
+// operator >
+template<class _CharT, class _Traits>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator> (basic_string_view<_CharT, _Traits> __lhs, basic_string_view<_CharT, _Traits> __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) > 0;
+}
+
+template<class _CharT, class _Traits, int = 1>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator>(basic_string_view<_CharT, _Traits> __lhs,
+                __type_identity_t<basic_string_view<_CharT, _Traits> > __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) > 0;
+}
+
+template<class _CharT, class _Traits, int = 2>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator>(__type_identity_t<basic_string_view<_CharT, _Traits> > __lhs,
+                basic_string_view<_CharT, _Traits> __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) > 0;
+}
+
+
+// operator <=
+template<class _CharT, class _Traits>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator<=(basic_string_view<_CharT, _Traits> __lhs, basic_string_view<_CharT, _Traits> __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) <= 0;
+}
+
+template<class _CharT, class _Traits, int = 1>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator<=(basic_string_view<_CharT, _Traits> __lhs,
+                __type_identity_t<basic_string_view<_CharT, _Traits> > __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) <= 0;
+}
+
+template<class _CharT, class _Traits, int = 2>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator<=(__type_identity_t<basic_string_view<_CharT, _Traits> > __lhs,
+                basic_string_view<_CharT, _Traits> __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) <= 0;
+}
+
+
+// operator >=
+template<class _CharT, class _Traits>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator>=(basic_string_view<_CharT, _Traits> __lhs, basic_string_view<_CharT, _Traits> __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) >= 0;
+}
+
+
+template<class _CharT, class _Traits, int = 1>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator>=(basic_string_view<_CharT, _Traits> __lhs,
+                __type_identity_t<basic_string_view<_CharT, _Traits> > __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) >= 0;
+}
+
+template<class _CharT, class _Traits, int = 2>
+_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_INLINE_VISIBILITY
+bool operator>=(__type_identity_t<basic_string_view<_CharT, _Traits> > __lhs,
+                basic_string_view<_CharT, _Traits> __rhs) _NOEXCEPT
+{
+    return __lhs.compare(__rhs) >= 0;
+}
+
+#endif //  _LIBCPP_STD_VER > 17
+
+template<class _CharT, class _Traits>
+_LIBCPP_HIDE_FROM_ABI basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os,
+           basic_string_view<_CharT, _Traits> __str);
+
+// [string.view.hash]
+template<class _CharT>
+struct __string_view_hash : public __unary_function<basic_string_view<_CharT, char_traits<_CharT> >, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const basic_string_view<_CharT, char_traits<_CharT> > __val) const _NOEXCEPT {
+        return std::__do_string_hash(__val.data(), __val.data() + __val.size());
+    }
+};
+
+template <>
+struct hash<basic_string_view<char, char_traits<char> > > : __string_view_hash<char> {};
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+template <>
+struct hash<basic_string_view<char8_t, char_traits<char8_t> > > : __string_view_hash<char8_t> {};
+#endif
+
+template <>
+struct hash<basic_string_view<char16_t, char_traits<char16_t> > > : __string_view_hash<char16_t> {};
+
+template <>
+struct hash<basic_string_view<char32_t, char_traits<char32_t> > > : __string_view_hash<char32_t> {};
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+struct hash<basic_string_view<wchar_t, char_traits<wchar_t> > > : __string_view_hash<wchar_t> {};
+#endif
+
+#if _LIBCPP_STD_VER > 11
+inline namespace literals
+{
+  inline namespace string_view_literals
+  {
+    inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    basic_string_view<char> operator "" sv(const char *__str, size_t __len) _NOEXCEPT
+    {
+        return basic_string_view<char> (__str, __len);
+    }
+
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+    inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    basic_string_view<wchar_t> operator "" sv(const wchar_t *__str, size_t __len) _NOEXCEPT
+    {
+        return basic_string_view<wchar_t> (__str, __len);
+    }
+#endif
+
+#ifndef _LIBCPP_HAS_NO_CHAR8_T
+    inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    basic_string_view<char8_t> operator "" sv(const char8_t *__str, size_t __len) _NOEXCEPT
+    {
+        return basic_string_view<char8_t> (__str, __len);
+    }
+#endif
+
+    inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    basic_string_view<char16_t> operator "" sv(const char16_t *__str, size_t __len) _NOEXCEPT
+    {
+        return basic_string_view<char16_t> (__str, __len);
+    }
+
+    inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    basic_string_view<char32_t> operator "" sv(const char32_t *__str, size_t __len) _NOEXCEPT
+    {
+        return basic_string_view<char32_t> (__str, __len);
+    }
+  } // namespace string_view_literals
+} // namespace literals
+#endif
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <algorithm>
+#  include <concepts>
+#  include <functional>
+#  include <iterator>
+#endif
+
+#endif // _LIBCPP_STRING_VIEW
diff --git a/app/src/main/cpp/libcxx/include/strstream b/app/src/main/cpp/libcxx/include/strstream
new file mode 100644
index 0000000..9382473
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/strstream
@@ -0,0 +1,409 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_STRSTREAM
+#define _LIBCPP_STRSTREAM
+
+/*
+    strstream synopsis
+
+class strstreambuf
+    : public basic_streambuf<char>
+{
+public:
+    explicit strstreambuf(streamsize alsize_arg = 0); // before C++20
+    strstreambuf() : strstreambuf(0) {}               // C++20
+    explicit strstreambuf(streamsize alsize_arg);     // C++20
+
+    strstreambuf(void* (*palloc_arg)(size_t), void (*pfree_arg)(void*));
+    strstreambuf(char* gnext_arg, streamsize n, char* pbeg_arg = nullptr);
+    strstreambuf(const char* gnext_arg, streamsize n);
+
+    strstreambuf(signed char* gnext_arg, streamsize n, signed char* pbeg_arg = nullptr);
+    strstreambuf(const signed char* gnext_arg, streamsize n);
+    strstreambuf(unsigned char* gnext_arg, streamsize n, unsigned char* pbeg_arg = nullptr);
+    strstreambuf(const unsigned char* gnext_arg, streamsize n);
+
+    strstreambuf(strstreambuf&& rhs);
+    strstreambuf& operator=(strstreambuf&& rhs);
+
+    virtual ~strstreambuf();
+
+    void swap(strstreambuf& rhs);
+
+    void freeze(bool freezefl = true);
+    char* str();
+    int pcount() const;
+
+protected:
+    virtual int_type overflow (int_type c = EOF);
+    virtual int_type pbackfail(int_type c = EOF);
+    virtual int_type underflow();
+    virtual pos_type seekoff(off_type off, ios_base::seekdir way,
+                             ios_base::openmode which = ios_base::in | ios_base::out);
+    virtual pos_type seekpos(pos_type sp,
+                             ios_base::openmode which = ios_base::in | ios_base::out);
+    virtual streambuf* setbuf(char* s, streamsize n);
+
+private:
+    typedef T1 strstate;                // exposition only
+    static const strstate allocated;    // exposition only
+    static const strstate constant;     // exposition only
+    static const strstate dynamic;      // exposition only
+    static const strstate frozen;       // exposition only
+    strstate strmode;                   // exposition only
+    streamsize alsize;                  // exposition only
+    void* (*palloc)(size_t);            // exposition only
+    void (*pfree)(void*);               // exposition only
+};
+
+class istrstream
+    : public basic_istream<char>
+{
+public:
+    explicit istrstream(const char* s);
+    explicit istrstream(char* s);
+    istrstream(const char* s, streamsize n);
+    istrstream(char* s, streamsize n);
+
+    virtual ~istrstream();
+
+    strstreambuf* rdbuf() const;
+    char *str();
+
+private:
+    strstreambuf sb; // exposition only
+};
+
+class ostrstream
+    : public basic_ostream<char>
+{
+public:
+    ostrstream();
+    ostrstream(char* s, int n, ios_base::openmode mode = ios_base::out);
+
+    virtual ~ostrstream();
+
+    strstreambuf* rdbuf() const;
+    void freeze(bool freezefl = true);
+    char* str();
+    int pcount() const;
+
+private:
+    strstreambuf sb; // exposition only
+};
+
+class strstream
+    : public basic_iostream<char>
+{
+public:
+    // Types
+    typedef char                        char_type;
+    typedef char_traits<char>::int_type int_type;
+    typedef char_traits<char>::pos_type pos_type;
+    typedef char_traits<char>::off_type off_type;
+
+    // constructors/destructor
+    strstream();
+    strstream(char* s, int n, ios_base::openmode mode = ios_base::in | ios_base::out);
+
+    virtual ~strstream();
+
+    // Members:
+    strstreambuf* rdbuf() const;
+    void freeze(bool freezefl = true);
+    int pcount() const;
+    char* str();
+
+private:
+    strstreambuf sb; // exposition only
+};
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <istream>
+#include <ostream>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+class _LIBCPP_TYPE_VIS strstreambuf
+    : public streambuf
+{
+public:
+#ifndef _LIBCPP_CXX03_LANG
+    strstreambuf() : strstreambuf(0) {}
+    explicit strstreambuf(streamsize __alsize);
+#else
+    explicit strstreambuf(streamsize __alsize = 0);
+#endif
+    strstreambuf(void* (*__palloc)(size_t), void (*__pfree)(void*));
+    strstreambuf(char* __gnext, streamsize __n, char* __pbeg = nullptr);
+    strstreambuf(const char* __gnext, streamsize __n);
+
+    strstreambuf(signed char* __gnext, streamsize __n, signed char* __pbeg = nullptr);
+    strstreambuf(const signed char* __gnext, streamsize __n);
+    strstreambuf(unsigned char* __gnext, streamsize __n, unsigned char* __pbeg = nullptr);
+    strstreambuf(const unsigned char* __gnext, streamsize __n);
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    strstreambuf(strstreambuf&& __rhs);
+    _LIBCPP_INLINE_VISIBILITY
+    strstreambuf& operator=(strstreambuf&& __rhs);
+#endif // _LIBCPP_CXX03_LANG
+
+    ~strstreambuf() override;
+
+    void swap(strstreambuf& __rhs);
+
+    void freeze(bool __freezefl = true);
+    char* str();
+    int pcount() const;
+
+protected:
+    int_type overflow (int_type __c = EOF) override;
+    int_type pbackfail(int_type __c = EOF) override;
+    int_type underflow() override;
+    pos_type seekoff(off_type __off, ios_base::seekdir __way,
+                     ios_base::openmode __which = ios_base::in | ios_base::out) override;
+    pos_type seekpos(pos_type __sp,
+                     ios_base::openmode __which = ios_base::in | ios_base::out) override;
+
+private:
+    typedef unsigned __mode_type;
+    static const __mode_type __allocated = 0x01;
+    static const __mode_type __constant  = 0x02;
+    static const __mode_type __dynamic   = 0x04;
+    static const __mode_type __frozen    = 0x08;
+    static const streamsize    __default_alsize = 4096;
+
+    __mode_type __strmode_;
+    streamsize __alsize_;
+    void* (*__palloc_)(size_t);
+    void (*__pfree_)(void*);
+
+    void __init(char* __gnext, streamsize __n, char* __pbeg);
+};
+
+#ifndef _LIBCPP_CXX03_LANG
+
+inline _LIBCPP_INLINE_VISIBILITY
+strstreambuf::strstreambuf(strstreambuf&& __rhs)
+    : streambuf(__rhs),
+      __strmode_(__rhs.__strmode_),
+      __alsize_(__rhs.__alsize_),
+      __palloc_(__rhs.__palloc_),
+      __pfree_(__rhs.__pfree_)
+{
+    __rhs.setg(nullptr, nullptr, nullptr);
+    __rhs.setp(nullptr, nullptr);
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+strstreambuf&
+strstreambuf::operator=(strstreambuf&& __rhs)
+{
+    if (eback() && (__strmode_ & __allocated) != 0 && (__strmode_ & __frozen) == 0)
+    {
+        if (__pfree_)
+            __pfree_(eback());
+        else
+            delete [] eback();
+    }
+    streambuf::operator=(__rhs);
+    __strmode_ = __rhs.__strmode_;
+    __alsize_ = __rhs.__alsize_;
+    __palloc_ = __rhs.__palloc_;
+    __pfree_ = __rhs.__pfree_;
+    __rhs.setg(nullptr, nullptr, nullptr);
+    __rhs.setp(nullptr, nullptr);
+    return *this;
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+class _LIBCPP_TYPE_VIS istrstream
+    : public istream
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit istrstream(const char* __s)
+        : istream(&__sb_), __sb_(__s, 0) {}
+    _LIBCPP_INLINE_VISIBILITY
+    explicit istrstream(char* __s)
+        : istream(&__sb_), __sb_(__s, 0) {}
+    _LIBCPP_INLINE_VISIBILITY
+    istrstream(const char* __s, streamsize __n)
+        : istream(&__sb_), __sb_(__s, __n) {}
+    _LIBCPP_INLINE_VISIBILITY
+    istrstream(char* __s, streamsize __n)
+        : istream(&__sb_), __sb_(__s, __n) {}
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    istrstream(istrstream&& __rhs)
+        : istream(_VSTD::move(__rhs)),
+          __sb_(_VSTD::move(__rhs.__sb_))
+    {
+        istream::set_rdbuf(&__sb_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    istrstream& operator=(istrstream&& __rhs)
+    {
+        __sb_ = _VSTD::move(__rhs.__sb_);
+        istream::operator=(_VSTD::move(__rhs));
+        return *this;
+    }
+#endif // _LIBCPP_CXX03_LANG
+
+    ~istrstream() override;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(istrstream& __rhs)
+    {
+        istream::swap(__rhs);
+        __sb_.swap(__rhs.__sb_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    strstreambuf* rdbuf() const {return const_cast<strstreambuf*>(&__sb_);}
+    _LIBCPP_INLINE_VISIBILITY
+    char *str() {return __sb_.str();}
+
+private:
+    strstreambuf __sb_;
+};
+
+class _LIBCPP_TYPE_VIS ostrstream
+    : public ostream
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    ostrstream()
+        : ostream(&__sb_) {}
+    _LIBCPP_INLINE_VISIBILITY
+    ostrstream(char* __s, int __n, ios_base::openmode __mode = ios_base::out)
+        : ostream(&__sb_),
+          __sb_(__s, __n, __s + (__mode & ios::app ? _VSTD::strlen(__s) : 0))
+        {}
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    ostrstream(ostrstream&& __rhs)
+        : ostream(_VSTD::move(__rhs)),
+          __sb_(_VSTD::move(__rhs.__sb_))
+    {
+        ostream::set_rdbuf(&__sb_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    ostrstream& operator=(ostrstream&& __rhs)
+    {
+        __sb_ = _VSTD::move(__rhs.__sb_);
+        ostream::operator=(_VSTD::move(__rhs));
+        return *this;
+    }
+#endif // _LIBCPP_CXX03_LANG
+
+    ~ostrstream() override;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(ostrstream& __rhs)
+    {
+        ostream::swap(__rhs);
+        __sb_.swap(__rhs.__sb_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    strstreambuf* rdbuf() const {return const_cast<strstreambuf*>(&__sb_);}
+    _LIBCPP_INLINE_VISIBILITY
+    void freeze(bool __freezefl = true) {__sb_.freeze(__freezefl);}
+    _LIBCPP_INLINE_VISIBILITY
+    char* str()         {return __sb_.str();}
+    _LIBCPP_INLINE_VISIBILITY
+    int pcount() const  {return __sb_.pcount();}
+
+private:
+    strstreambuf __sb_; // exposition only
+};
+
+class _LIBCPP_TYPE_VIS strstream
+    : public iostream
+{
+public:
+    // Types
+    typedef char                        char_type;
+    typedef char_traits<char>::int_type int_type;
+    typedef char_traits<char>::pos_type pos_type;
+    typedef char_traits<char>::off_type off_type;
+
+    // constructors/destructor
+    _LIBCPP_INLINE_VISIBILITY
+    strstream()
+        : iostream(&__sb_) {}
+    _LIBCPP_INLINE_VISIBILITY
+    strstream(char* __s, int __n, ios_base::openmode __mode = ios_base::in | ios_base::out)
+        : iostream(&__sb_),
+          __sb_(__s, __n, __s + (__mode & ios::app ? _VSTD::strlen(__s) : 0))
+        {}
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    strstream(strstream&& __rhs)
+        : iostream(_VSTD::move(__rhs)),
+          __sb_(_VSTD::move(__rhs.__sb_))
+    {
+        iostream::set_rdbuf(&__sb_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    strstream& operator=(strstream&& __rhs)
+    {
+        __sb_ = _VSTD::move(__rhs.__sb_);
+        iostream::operator=(_VSTD::move(__rhs));
+        return *this;
+    }
+#endif // _LIBCPP_CXX03_LANG
+
+    ~strstream() override;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(strstream& __rhs)
+    {
+        iostream::swap(__rhs);
+        __sb_.swap(__rhs.__sb_);
+    }
+
+    // Members:
+    _LIBCPP_INLINE_VISIBILITY
+    strstreambuf* rdbuf() const {return const_cast<strstreambuf*>(&__sb_);}
+    _LIBCPP_INLINE_VISIBILITY
+    void freeze(bool __freezefl = true) {__sb_.freeze(__freezefl);}
+    _LIBCPP_INLINE_VISIBILITY
+    int pcount() const {return __sb_.pcount();}
+    _LIBCPP_INLINE_VISIBILITY
+    char* str()        {return __sb_.str();}
+
+private:
+    strstreambuf __sb_; // exposition only
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_STRSTREAM
diff --git a/app/src/main/cpp/libcxx/include/system_error b/app/src/main/cpp/libcxx/include/system_error
new file mode 100644
index 0000000..9891992
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/system_error
@@ -0,0 +1,548 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_SYSTEM_ERROR
+#define _LIBCPP_SYSTEM_ERROR
+
+/*
+    system_error synopsis
+
+namespace std
+{
+
+class error_category
+{
+public:
+    virtual ~error_category() noexcept;
+
+    constexpr error_category();
+    error_category(const error_category&) = delete;
+    error_category& operator=(const error_category&) = delete;
+
+    virtual const char* name() const noexcept = 0;
+    virtual error_condition default_error_condition(int ev) const noexcept;
+    virtual bool equivalent(int code, const error_condition& condition) const noexcept;
+    virtual bool equivalent(const error_code& code, int condition) const noexcept;
+    virtual string message(int ev) const = 0;
+
+    bool operator==(const error_category& rhs) const noexcept;
+    bool operator!=(const error_category& rhs) const noexcept;              // removed in C++20
+    bool operator<(const error_category& rhs) const noexcept;               // removed in C++20
+    strong_ordering operator<=>(const error_category& rhs) const noexcept;  // C++20
+};
+
+const error_category& generic_category() noexcept;
+const error_category& system_category() noexcept;
+
+template <class T> struct is_error_code_enum
+    : public false_type {};
+
+template <class T> struct is_error_condition_enum
+    : public false_type {};
+
+template <class _Tp>
+inline constexpr bool is_error_condition_enum_v = is_error_condition_enum<_Tp>::value; // C++17
+
+template <class _Tp>
+inline constexpr bool is_error_code_enum_v = is_error_code_enum<_Tp>::value; // C++17
+
+class error_code
+{
+public:
+    // constructors:
+    error_code() noexcept;
+    error_code(int val, const error_category& cat) noexcept;
+    template <class ErrorCodeEnum>
+        error_code(ErrorCodeEnum e) noexcept;
+
+    // modifiers:
+    void assign(int val, const error_category& cat) noexcept;
+    template <class ErrorCodeEnum>
+        error_code& operator=(ErrorCodeEnum e) noexcept;
+    void clear() noexcept;
+
+    // observers:
+    int value() const noexcept;
+    const error_category& category() const noexcept;
+    error_condition default_error_condition() const noexcept;
+    string message() const;
+    explicit operator bool() const noexcept;
+};
+
+// non-member functions:
+template <class charT, class traits>
+    basic_ostream<charT,traits>&
+    operator<<(basic_ostream<charT,traits>& os, const error_code& ec);
+
+class error_condition
+{
+public:
+    // constructors:
+    error_condition() noexcept;
+    error_condition(int val, const error_category& cat) noexcept;
+    template <class ErrorConditionEnum>
+        error_condition(ErrorConditionEnum e) noexcept;
+
+    // modifiers:
+    void assign(int val, const error_category& cat) noexcept;
+    template <class ErrorConditionEnum>
+        error_condition& operator=(ErrorConditionEnum e) noexcept;
+    void clear() noexcept;
+
+    // observers:
+    int value() const noexcept;
+    const error_category& category() const noexcept;
+    string message() const noexcept;
+    explicit operator bool() const noexcept;
+};
+
+class system_error
+    : public runtime_error
+{
+public:
+    system_error(error_code ec, const string& what_arg);
+    system_error(error_code ec, const char* what_arg);
+    system_error(error_code ec);
+    system_error(int ev, const error_category& ecat, const string& what_arg);
+    system_error(int ev, const error_category& ecat, const char* what_arg);
+    system_error(int ev, const error_category& ecat);
+
+    const error_code& code() const noexcept;
+    const char* what() const noexcept;
+};
+
+template <> struct is_error_condition_enum<errc>
+    : true_type { }
+
+error_code make_error_code(errc e) noexcept;
+error_condition make_error_condition(errc e) noexcept;
+
+// Comparison operators:
+bool operator==(const error_code& lhs, const error_code& rhs) noexcept;
+bool operator==(const error_code& lhs, const error_condition& rhs) noexcept;
+bool operator==(const error_condition& lhs, const error_code& rhs) noexcept;                  // removed in C++20
+bool operator==(const error_condition& lhs, const error_condition& rhs) noexcept;
+bool operator!=(const error_code& lhs, const error_code& rhs) noexcept;                       // removed in C++20
+bool operator!=(const error_code& lhs, const error_condition& rhs) noexcept;                  // removed in C++20
+bool operator!=(const error_condition& lhs, const error_code& rhs) noexcept;                  // removed in C++20
+bool operator!=(const error_condition& lhs, const error_condition& rhs) noexcept;             // removed in C++20
+bool operator<(const error_condition& lhs, const error_condition& rhs) noexcept;              // removed in C++20
+bool operator<(const error_code& lhs, const error_code& rhs) noexcept;                        // removed in C++20
+strong_ordering operator<=>(const error_code& lhs, const error_code& rhs) noexcept;           // C++20
+strong_ordering operator<=>(const error_condition& lhs, const error_condition& rhs) noexcept; // C++20
+
+template <> struct hash<std::error_code>;
+template <> struct hash<std::error_condition>;
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__errc>
+#include <__functional/hash.h>
+#include <__functional/unary_function.h>
+#include <__memory/addressof.h>
+#include <stdexcept>
+#include <string>
+#include <type_traits>
+#include <version>
+
+// standard-mandated includes
+
+// [system.error.syn]
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+// is_error_code_enum
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_error_code_enum
+    : public false_type {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_error_code_enum_v = is_error_code_enum<_Tp>::value;
+#endif
+
+// is_error_condition_enum
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS is_error_condition_enum
+    : public false_type {};
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr bool is_error_condition_enum_v = is_error_condition_enum<_Tp>::value;
+#endif
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS is_error_condition_enum<errc>
+    : true_type { };
+
+#ifdef _LIBCPP_CXX03_LANG
+template <>
+struct _LIBCPP_TEMPLATE_VIS is_error_condition_enum<errc::__lx>
+    : true_type { };
+#endif
+
+class _LIBCPP_TYPE_VIS error_condition;
+class _LIBCPP_TYPE_VIS error_code;
+
+// class error_category
+
+class _LIBCPP_HIDDEN __do_message;
+
+class _LIBCPP_TYPE_VIS error_category
+{
+public:
+    virtual ~error_category() _NOEXCEPT;
+
+#if defined(_LIBCPP_ERROR_CATEGORY_DEFINE_LEGACY_INLINE_FUNCTIONS)
+    error_category() noexcept;
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    _LIBCPP_CONSTEXPR_SINCE_CXX14 error_category() _NOEXCEPT = default;
+#endif
+    error_category(const error_category&) = delete;
+    error_category& operator=(const error_category&) = delete;
+
+    virtual const char* name() const _NOEXCEPT = 0;
+    virtual error_condition default_error_condition(int __ev) const _NOEXCEPT;
+    virtual bool equivalent(int __code, const error_condition& __condition) const _NOEXCEPT;
+    virtual bool equivalent(const error_code& __code, int __condition) const _NOEXCEPT;
+    virtual string message(int __ev) const = 0;
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const error_category& __rhs) const _NOEXCEPT {return this == &__rhs;}
+
+#if _LIBCPP_STD_VER > 17
+
+    _LIBCPP_HIDE_FROM_ABI
+    strong_ordering operator<=>(const error_category& __rhs) const noexcept {return compare_three_way()(this, std::addressof(__rhs));}
+
+#else // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const error_category& __rhs) const _NOEXCEPT {return !(*this == __rhs);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator< (const error_category& __rhs) const _NOEXCEPT {return this < &__rhs;}
+
+#endif // _LIBCPP_STD_VER > 17
+
+    friend class _LIBCPP_HIDDEN __do_message;
+};
+
+class _LIBCPP_HIDDEN __do_message
+    : public error_category
+{
+public:
+    string message(int __ev) const override;
+};
+
+_LIBCPP_FUNC_VIS const error_category& generic_category() _NOEXCEPT;
+_LIBCPP_FUNC_VIS const error_category& system_category() _NOEXCEPT;
+
+namespace __adl_only {
+    // Those cause ADL to trigger but they are not viable candidates,
+    // so they are never actually selected.
+    void make_error_condition() = delete;
+    void make_error_code() = delete;
+} // namespace __adl_only
+
+class _LIBCPP_TYPE_VIS error_condition
+{
+    int __val_;
+    const error_category* __cat_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    error_condition() _NOEXCEPT : __val_(0), __cat_(&generic_category()) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    error_condition(int __val, const error_category& __cat) _NOEXCEPT
+        : __val_(__val), __cat_(&__cat) {}
+
+    template <class _Ep>
+        _LIBCPP_INLINE_VISIBILITY
+        error_condition(_Ep __e,
+              typename enable_if<is_error_condition_enum<_Ep>::value>::type* = nullptr
+                                                                     ) _NOEXCEPT
+            {
+                using __adl_only::make_error_condition;
+                *this = make_error_condition(__e);
+            }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void assign(int __val, const error_category& __cat) _NOEXCEPT
+    {
+        __val_ = __val;
+        __cat_ = &__cat;
+    }
+
+    template <class _Ep>
+        _LIBCPP_INLINE_VISIBILITY
+        typename enable_if
+        <
+            is_error_condition_enum<_Ep>::value,
+            error_condition&
+        >::type
+        operator=(_Ep __e) _NOEXCEPT
+            {
+                using __adl_only::make_error_condition;
+                *this = make_error_condition(__e);
+                return *this;
+            }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() _NOEXCEPT
+    {
+        __val_ = 0;
+        __cat_ = &generic_category();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int value() const _NOEXCEPT {return __val_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    const error_category& category() const _NOEXCEPT {return *__cat_;}
+    string message() const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit operator bool() const _NOEXCEPT {return __val_ != 0;}
+};
+
+inline _LIBCPP_INLINE_VISIBILITY
+error_condition
+make_error_condition(errc __e) _NOEXCEPT
+{
+    return error_condition(static_cast<int>(__e), generic_category());
+}
+
+// error_code
+
+class _LIBCPP_TYPE_VIS error_code
+{
+    int __val_;
+    const error_category* __cat_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    error_code() _NOEXCEPT : __val_(0), __cat_(&system_category()) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    error_code(int __val, const error_category& __cat) _NOEXCEPT
+        : __val_(__val), __cat_(&__cat) {}
+
+    template <class _Ep>
+        _LIBCPP_INLINE_VISIBILITY
+        error_code(_Ep __e,
+                   typename enable_if<is_error_code_enum<_Ep>::value>::type* = nullptr
+                                                                     ) _NOEXCEPT
+            {
+                using __adl_only::make_error_code;
+                *this = make_error_code(__e);
+            }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void assign(int __val, const error_category& __cat) _NOEXCEPT
+    {
+        __val_ = __val;
+        __cat_ = &__cat;
+    }
+
+    template <class _Ep>
+        _LIBCPP_INLINE_VISIBILITY
+        typename enable_if
+        <
+            is_error_code_enum<_Ep>::value,
+            error_code&
+        >::type
+        operator=(_Ep __e) _NOEXCEPT
+            {
+                using __adl_only::make_error_code;
+                *this = make_error_code(__e);
+                return *this;
+            }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() _NOEXCEPT
+    {
+        __val_ = 0;
+        __cat_ = &system_category();
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    int value() const _NOEXCEPT {return __val_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    const error_category& category() const _NOEXCEPT {return *__cat_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    error_condition default_error_condition() const _NOEXCEPT
+        {return __cat_->default_error_condition(__val_);}
+
+    string message() const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit operator bool() const _NOEXCEPT {return __val_ != 0;}
+};
+
+inline _LIBCPP_INLINE_VISIBILITY
+error_code
+make_error_code(errc __e) _NOEXCEPT
+{
+    return error_code(static_cast<int>(__e), generic_category());
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const error_code& __x, const error_code& __y) _NOEXCEPT
+{
+    return __x.category() == __y.category() && __x.value() == __y.value();
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const error_code& __x, const error_condition& __y) _NOEXCEPT
+{
+    return __x.category().equivalent(__x.value(), __y)
+        || __y.category().equivalent(__x, __y.value());
+}
+
+#if _LIBCPP_STD_VER <= 17
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const error_condition& __x, const error_code& __y) _NOEXCEPT
+{
+    return __y == __x;
+}
+#endif
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator==(const error_condition& __x, const error_condition& __y) _NOEXCEPT
+{
+    return __x.category() == __y.category() && __x.value() == __y.value();
+}
+
+#if _LIBCPP_STD_VER <= 17
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const error_code& __x, const error_code& __y) _NOEXCEPT
+{return !(__x == __y);}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const error_code& __x, const error_condition& __y) _NOEXCEPT
+{return !(__x == __y);}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const error_condition& __x, const error_code& __y) _NOEXCEPT
+{return !(__x == __y);}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const error_condition& __x, const error_condition& __y) _NOEXCEPT
+{return !(__x == __y);}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<(const error_condition& __x, const error_condition& __y) _NOEXCEPT
+{
+    return __x.category() < __y.category()
+        || (__x.category() == __y.category() && __x.value() < __y.value());
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator<(const error_code& __x, const error_code& __y) _NOEXCEPT
+{
+    return __x.category() < __y.category()
+        || (__x.category() == __y.category() && __x.value() < __y.value());
+}
+
+#else // _LIBCPP_STD_VER <= 17
+
+inline _LIBCPP_HIDE_FROM_ABI strong_ordering
+operator<=>(const error_code& __x, const error_code& __y) noexcept
+{
+    if (auto __c = __x.category() <=> __y.category(); __c != 0)
+        return __c;
+    return __x.value() <=> __y.value();
+}
+
+inline _LIBCPP_HIDE_FROM_ABI strong_ordering
+operator<=>(const error_condition& __x, const error_condition& __y) noexcept
+{
+    if (auto __c = __x.category() <=> __y.category(); __c != 0)
+       return __c;
+    return __x.value() <=> __y.value();
+}
+
+#endif // _LIBCPP_STD_VER <= 17
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<error_code>
+    : public __unary_function<error_code, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const error_code& __ec) const _NOEXCEPT
+    {
+        return static_cast<size_t>(__ec.value());
+    }
+};
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<error_condition>
+    : public __unary_function<error_condition, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const error_condition& __ec) const _NOEXCEPT
+    {
+        return static_cast<size_t>(__ec.value());
+    }
+};
+
+// system_error
+
+class _LIBCPP_TYPE_VIS system_error
+    : public runtime_error
+{
+    error_code __ec_;
+public:
+    system_error(error_code __ec, const string& __what_arg);
+    system_error(error_code __ec, const char* __what_arg);
+    system_error(error_code __ec);
+    system_error(int __ev, const error_category& __ecat, const string& __what_arg);
+    system_error(int __ev, const error_category& __ecat, const char* __what_arg);
+    system_error(int __ev, const error_category& __ecat);
+    system_error(const system_error&) _NOEXCEPT = default;
+    ~system_error() _NOEXCEPT override;
+
+    _LIBCPP_INLINE_VISIBILITY
+    const error_code& code() const _NOEXCEPT {return __ec_;}
+
+private:
+    static string __init(const error_code&, string);
+};
+
+_LIBCPP_NORETURN _LIBCPP_FUNC_VIS
+void __throw_system_error(int __ev, const char* __what_arg);
+
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // _LIBCPP_SYSTEM_ERROR
diff --git a/app/src/main/cpp/libcxx/include/tgmath.h b/app/src/main/cpp/libcxx/include/tgmath.h
new file mode 100644
index 0000000..e6f0a4a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/tgmath.h
@@ -0,0 +1,34 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_TGMATH_H
+#define _LIBCPP_TGMATH_H
+
+/*
+    tgmath.h synopsis
+
+#include <ctgmath>
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifdef __cplusplus
+#  include <ctgmath>
+#else
+#  if __has_include_next(<tgmath.h>)
+#    include_next <tgmath.h>
+#  endif
+#endif
+
+#endif // _LIBCPP_TGMATH_H
diff --git a/app/src/main/cpp/libcxx/include/thread b/app/src/main/cpp/libcxx/include/thread
new file mode 100644
index 0000000..7a1117f
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/thread
@@ -0,0 +1,421 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_THREAD
+#define _LIBCPP_THREAD
+
+/*
+
+    thread synopsis
+
+namespace std
+{
+
+class thread
+{
+public:
+    class id;
+    typedef pthread_t native_handle_type;
+
+    thread() noexcept;
+    template <class F, class ...Args> explicit thread(F&& f, Args&&... args);
+    ~thread();
+
+    thread(const thread&) = delete;
+    thread(thread&& t) noexcept;
+
+    thread& operator=(const thread&) = delete;
+    thread& operator=(thread&& t) noexcept;
+
+    void swap(thread& t) noexcept;
+
+    bool joinable() const noexcept;
+    void join();
+    void detach();
+    id get_id() const noexcept;
+    native_handle_type native_handle();
+
+    static unsigned hardware_concurrency() noexcept;
+};
+
+void swap(thread& x, thread& y) noexcept;
+
+class thread::id
+{
+public:
+    id() noexcept;
+};
+
+bool operator==(thread::id x, thread::id y) noexcept;
+bool operator!=(thread::id x, thread::id y) noexcept;             // removed in C++20
+bool operator< (thread::id x, thread::id y) noexcept;             // removed in C++20
+bool operator<=(thread::id x, thread::id y) noexcept;             // removed in C++20
+bool operator> (thread::id x, thread::id y) noexcept;             // removed in C++20
+bool operator>=(thread::id x, thread::id y) noexcept;             // removed in C++20
+strong_ordering operator<=>(thread::id x, thread::id y) noexcept; // C++20
+
+template<class charT, class traits>
+basic_ostream<charT, traits>&
+operator<<(basic_ostream<charT, traits>& out, thread::id id);
+
+namespace this_thread
+{
+
+thread::id get_id() noexcept;
+
+void yield() noexcept;
+
+template <class Clock, class Duration>
+void sleep_until(const chrono::time_point<Clock, Duration>& abs_time);
+
+template <class Rep, class Period>
+void sleep_for(const chrono::duration<Rep, Period>& rel_time);
+
+}  // this_thread
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__functional/hash.h>
+#include <__memory/unique_ptr.h>
+#include <__mutex_base>
+#include <__thread/poll_with_backoff.h>
+#include <__thread/timed_backoff_policy.h>
+#include <__threading_support>
+#include <__utility/forward.h>
+#include <cstddef>
+#include <iosfwd>
+#include <system_error>
+#include <tuple>
+#include <type_traits>
+#include <version>
+
+// standard-mandated includes
+
+// [thread.syn]
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+#ifdef _LIBCPP_HAS_NO_THREADS
+# error "<thread> is not supported since libc++ has been configured without support for threads."
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp> class __thread_specific_ptr;
+class _LIBCPP_TYPE_VIS __thread_struct;
+class _LIBCPP_HIDDEN __thread_struct_imp;
+class __assoc_sub_state;
+
+_LIBCPP_FUNC_VIS __thread_specific_ptr<__thread_struct>& __thread_local_data();
+
+class _LIBCPP_TYPE_VIS __thread_struct
+{
+    __thread_struct_imp* __p_;
+
+    __thread_struct(const __thread_struct&);
+    __thread_struct& operator=(const __thread_struct&);
+public:
+    __thread_struct();
+    ~__thread_struct();
+
+    void notify_all_at_thread_exit(condition_variable*, mutex*);
+    void __make_ready_at_thread_exit(__assoc_sub_state*);
+};
+
+template <class _Tp>
+class __thread_specific_ptr
+{
+    __libcpp_tls_key __key_;
+
+     // Only __thread_local_data() may construct a __thread_specific_ptr
+     // and only with _Tp == __thread_struct.
+    static_assert((is_same<_Tp, __thread_struct>::value), "");
+    __thread_specific_ptr();
+    friend _LIBCPP_FUNC_VIS __thread_specific_ptr<__thread_struct>& __thread_local_data();
+
+    __thread_specific_ptr(const __thread_specific_ptr&);
+    __thread_specific_ptr& operator=(const __thread_specific_ptr&);
+
+    _LIBCPP_HIDDEN static void _LIBCPP_TLS_DESTRUCTOR_CC __at_thread_exit(void*);
+
+public:
+    typedef _Tp* pointer;
+
+    ~__thread_specific_ptr();
+
+    _LIBCPP_INLINE_VISIBILITY
+    pointer get() const {return static_cast<_Tp*>(__libcpp_tls_get(__key_));}
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator*() const {return *get();}
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const {return get();}
+    void set_pointer(pointer __p);
+};
+
+template <class _Tp>
+void _LIBCPP_TLS_DESTRUCTOR_CC
+__thread_specific_ptr<_Tp>::__at_thread_exit(void* __p)
+{
+    delete static_cast<pointer>(__p);
+}
+
+template <class _Tp>
+__thread_specific_ptr<_Tp>::__thread_specific_ptr()
+{
+  int __ec =
+      __libcpp_tls_create(&__key_, &__thread_specific_ptr::__at_thread_exit);
+  if (__ec)
+    __throw_system_error(__ec, "__thread_specific_ptr construction failed");
+}
+
+template <class _Tp>
+__thread_specific_ptr<_Tp>::~__thread_specific_ptr()
+{
+    // __thread_specific_ptr is only created with a static storage duration
+    // so this destructor is only invoked during program termination. Invoking
+    // pthread_key_delete(__key_) may prevent other threads from deleting their
+    // thread local data. For this reason we leak the key.
+}
+
+template <class _Tp>
+void
+__thread_specific_ptr<_Tp>::set_pointer(pointer __p)
+{
+    _LIBCPP_ASSERT(get() == nullptr,
+                   "Attempting to overwrite thread local data");
+    std::__libcpp_tls_set(__key_, __p);
+}
+
+template<>
+struct _LIBCPP_TEMPLATE_VIS hash<__thread_id>
+    : public __unary_function<__thread_id, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(__thread_id __v) const _NOEXCEPT
+    {
+        return hash<__libcpp_thread_id>()(__v.__id_);
+    }
+};
+
+template<class _CharT, class _Traits>
+_LIBCPP_INLINE_VISIBILITY
+basic_ostream<_CharT, _Traits>&
+operator<<(basic_ostream<_CharT, _Traits>& __os, __thread_id __id)
+{return __os << __id.__id_;}
+
+class _LIBCPP_TYPE_VIS thread
+{
+    __libcpp_thread_t __t_;
+
+    thread(const thread&);
+    thread& operator=(const thread&);
+public:
+    typedef __thread_id id;
+    typedef __libcpp_thread_t native_handle_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    thread() _NOEXCEPT : __t_(_LIBCPP_NULL_THREAD) {}
+#ifndef _LIBCPP_CXX03_LANG
+    template <class _Fp, class ..._Args,
+              class = __enable_if_t<!is_same<__remove_cvref_t<_Fp>, thread>::value> >
+        _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+        explicit thread(_Fp&& __f, _Args&&... __args);
+#else  // _LIBCPP_CXX03_LANG
+    template <class _Fp>
+    _LIBCPP_METHOD_TEMPLATE_IMPLICIT_INSTANTIATION_VIS
+    explicit thread(_Fp __f);
+#endif
+    ~thread();
+
+    _LIBCPP_INLINE_VISIBILITY
+    thread(thread&& __t) _NOEXCEPT : __t_(__t.__t_) {
+        __t.__t_ = _LIBCPP_NULL_THREAD;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    thread& operator=(thread&& __t) _NOEXCEPT {
+        if (!__libcpp_thread_isnull(&__t_))
+            terminate();
+        __t_ = __t.__t_;
+        __t.__t_ = _LIBCPP_NULL_THREAD;
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(thread& __t) _NOEXCEPT {_VSTD::swap(__t_, __t.__t_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool joinable() const _NOEXCEPT {return !__libcpp_thread_isnull(&__t_);}
+    void join();
+    void detach();
+    _LIBCPP_INLINE_VISIBILITY
+    id get_id() const _NOEXCEPT {return __libcpp_thread_get_id(&__t_);}
+    _LIBCPP_INLINE_VISIBILITY
+    native_handle_type native_handle() _NOEXCEPT {return __t_;}
+
+    static unsigned hardware_concurrency() _NOEXCEPT;
+};
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _TSp, class _Fp, class ..._Args, size_t ..._Indices>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+__thread_execute(tuple<_TSp, _Fp, _Args...>& __t, __tuple_indices<_Indices...>)
+{
+    _VSTD::__invoke(_VSTD::move(_VSTD::get<1>(__t)), _VSTD::move(_VSTD::get<_Indices>(__t))...);
+}
+
+template <class _Fp>
+_LIBCPP_INLINE_VISIBILITY
+void* __thread_proxy(void* __vp)
+{
+    // _Fp = tuple< unique_ptr<__thread_struct>, Functor, Args...>
+    unique_ptr<_Fp> __p(static_cast<_Fp*>(__vp));
+    __thread_local_data().set_pointer(_VSTD::get<0>(*__p.get()).release());
+    typedef typename __make_tuple_indices<tuple_size<_Fp>::value, 2>::type _Index;
+    _VSTD::__thread_execute(*__p.get(), _Index());
+    return nullptr;
+}
+
+template <class _Fp, class ..._Args,
+          class
+         >
+thread::thread(_Fp&& __f, _Args&&... __args)
+{
+    typedef unique_ptr<__thread_struct> _TSPtr;
+    _TSPtr __tsp(new __thread_struct);
+    typedef tuple<_TSPtr, typename decay<_Fp>::type, typename decay<_Args>::type...> _Gp;
+    unique_ptr<_Gp> __p(
+            new _Gp(_VSTD::move(__tsp),
+                    _VSTD::forward<_Fp>(__f),
+                    _VSTD::forward<_Args>(__args)...));
+    int __ec = _VSTD::__libcpp_thread_create(&__t_, &__thread_proxy<_Gp>, __p.get());
+    if (__ec == 0)
+        __p.release();
+    else
+        __throw_system_error(__ec, "thread constructor failed");
+}
+
+#else  // _LIBCPP_CXX03_LANG
+
+template <class _Fp>
+struct __thread_invoke_pair {
+    // This type is used to pass memory for thread local storage and a functor
+    // to a newly created thread because std::pair doesn't work with
+    // std::unique_ptr in C++03.
+    __thread_invoke_pair(_Fp& __f) : __tsp_(new __thread_struct), __fn_(__f) {}
+    unique_ptr<__thread_struct> __tsp_;
+    _Fp __fn_;
+};
+
+template <class _Fp>
+_LIBCPP_HIDE_FROM_ABI void* __thread_proxy_cxx03(void* __vp)
+{
+    unique_ptr<_Fp> __p(static_cast<_Fp*>(__vp));
+    __thread_local_data().set_pointer(__p->__tsp_.release());
+    (__p->__fn_)();
+    return nullptr;
+}
+
+template <class _Fp>
+thread::thread(_Fp __f)
+{
+
+    typedef __thread_invoke_pair<_Fp> _InvokePair;
+    typedef unique_ptr<_InvokePair> _PairPtr;
+    _PairPtr __pp(new _InvokePair(__f));
+    int __ec = _VSTD::__libcpp_thread_create(&__t_, &__thread_proxy_cxx03<_InvokePair>, __pp.get());
+    if (__ec == 0)
+        __pp.release();
+    else
+        __throw_system_error(__ec, "thread constructor failed");
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+inline _LIBCPP_INLINE_VISIBILITY
+void swap(thread& __x, thread& __y) _NOEXCEPT {__x.swap(__y);}
+
+namespace this_thread
+{
+
+_LIBCPP_FUNC_VIS void sleep_for(const chrono::nanoseconds& __ns);
+
+template <class _Rep, class _Period>
+_LIBCPP_HIDE_FROM_ABI void
+sleep_for(const chrono::duration<_Rep, _Period>& __d)
+{
+    if (__d > chrono::duration<_Rep, _Period>::zero())
+    {
+        // The standard guarantees a 64bit signed integer resolution for nanoseconds,
+        // so use INT64_MAX / 1e9 as cut-off point. Use a constant to avoid <climits>
+        // and issues with long double folding on PowerPC with GCC.
+        _LIBCPP_CONSTEXPR chrono::duration<long double> _Max =
+            chrono::duration<long double>(9223372036.0L);
+        chrono::nanoseconds __ns;
+        if (__d < _Max)
+        {
+            __ns = chrono::duration_cast<chrono::nanoseconds>(__d);
+            if (__ns < __d)
+                ++__ns;
+        }
+        else
+            __ns = chrono::nanoseconds::max();
+        this_thread::sleep_for(__ns);
+    }
+}
+
+template <class _Clock, class _Duration>
+_LIBCPP_HIDE_FROM_ABI void
+sleep_until(const chrono::time_point<_Clock, _Duration>& __t)
+{
+    mutex __mut;
+    condition_variable __cv;
+    unique_lock<mutex> __lk(__mut);
+    while (_Clock::now() < __t)
+        __cv.wait_until(__lk, __t);
+}
+
+template <class _Duration>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+sleep_until(const chrono::time_point<chrono::steady_clock, _Duration>& __t)
+{
+    this_thread::sleep_for(__t - chrono::steady_clock::now());
+}
+
+inline _LIBCPP_INLINE_VISIBILITY
+void yield() _NOEXCEPT {__libcpp_thread_yield();}
+
+} // namespace this_thread
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 17
+#  include <chrono>
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <functional>
+#endif
+
+#endif // _LIBCPP_THREAD
diff --git a/app/src/main/cpp/libcxx/include/tuple b/app/src/main/cpp/libcxx/include/tuple
new file mode 100644
index 0000000..b0616bd
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/tuple
@@ -0,0 +1,1863 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_TUPLE
+#define _LIBCPP_TUPLE
+
+/*
+    tuple synopsis
+
+namespace std
+{
+
+template <class... T>
+class tuple {
+public:
+    explicit(see-below) constexpr tuple();
+    explicit(see-below) tuple(const T&...);  // constexpr in C++14
+    template <class... U>
+        explicit(see-below) tuple(U&&...);  // constexpr in C++14
+    tuple(const tuple&) = default;
+    tuple(tuple&&) = default;
+
+    template<class... UTypes>
+        constexpr explicit(see-below) tuple(tuple<UTypes...>&);  // C++23
+    template <class... U>
+        explicit(see-below) tuple(const tuple<U...>&);  // constexpr in C++14
+    template <class... U>
+        explicit(see-below) tuple(tuple<U...>&&);  // constexpr in C++14
+    template<class... UTypes>
+        constexpr explicit(see-below) tuple(const tuple<UTypes...>&&); // C++23
+
+    template<class U1, class U2>
+        constexpr explicit(see-below) tuple(pair<U1, U2>&);  // iff sizeof...(Types) == 2 // C++23
+    template <class U1, class U2>
+        explicit(see-below) tuple(const pair<U1, U2>&); // iff sizeof...(T) == 2 // constexpr in C++14
+    template <class U1, class U2>
+        explicit(see-below) tuple(pair<U1, U2>&&); // iff sizeof...(T) == 2  // constexpr in C++14
+    template<class U1, class U2>
+        constexpr explicit(see-below) tuple(const pair<U1, U2>&&);  // iff sizeof...(Types) == 2 // C++23
+
+    // allocator-extended constructors
+    template <class Alloc>
+        tuple(allocator_arg_t, const Alloc& a);
+    template <class Alloc>
+        explicit(see-below) tuple(allocator_arg_t, const Alloc& a, const T&...);          // constexpr in C++20
+    template <class Alloc, class... U>
+        explicit(see-below) tuple(allocator_arg_t, const Alloc& a, U&&...);               // constexpr in C++20
+    template <class Alloc>
+        tuple(allocator_arg_t, const Alloc& a, const tuple&);                             // constexpr in C++20
+    template <class Alloc>
+        tuple(allocator_arg_t, const Alloc& a, tuple&&);                                  // constexpr in C++20
+    template<class Alloc, class... UTypes>
+        constexpr explicit(see-below)
+          tuple(allocator_arg_t, const Alloc& a, tuple<UTypes...>&);                      // C++23
+    template <class Alloc, class... U>
+        explicit(see-below) tuple(allocator_arg_t, const Alloc& a, const tuple<U...>&);   // constexpr in C++20
+    template <class Alloc, class... U>
+        explicit(see-below) tuple(allocator_arg_t, const Alloc& a, tuple<U...>&&);        // constexpr in C++20
+    template<class Alloc, class... UTypes>
+        constexpr explicit(see-below)
+          tuple(allocator_arg_t, const Alloc& a, const tuple<UTypes...>&&);               // C++23
+    template<class Alloc, class U1, class U2>
+        constexpr explicit(see-below)
+          tuple(allocator_arg_t, const Alloc& a, pair<U1, U2>&);                          // C++23
+    template <class Alloc, class U1, class U2>
+        explicit(see-below) tuple(allocator_arg_t, const Alloc& a, const pair<U1, U2>&);  // constexpr in C++20
+    template <class Alloc, class U1, class U2>
+        explicit(see-below) tuple(allocator_arg_t, const Alloc& a, pair<U1, U2>&&);       // constexpr in C++20
+    template<class Alloc, class U1, class U2>
+        constexpr explicit(see-below)
+          tuple(allocator_arg_t, const Alloc& a, const pair<U1, U2>&&);                   // C++23
+
+    tuple& operator=(const tuple&);                                                       // constexpr in C++20
+    constexpr const tuple& operator=(const tuple&) const;                                 // C++23
+    tuple& operator=(tuple&&) noexcept(is_nothrow_move_assignable_v<T> && ...);           // constexpr in C++20
+    constexpr const tuple& operator=(tuple&&) const;                                      // C++23
+    template <class... U>
+        tuple& operator=(const tuple<U...>&);                                             // constexpr in C++20
+    template<class... UTypes>
+        constexpr const tuple& operator=(const tuple<UTypes...>&) const;                  // C++23
+    template <class... U>
+        tuple& operator=(tuple<U...>&&);                                                  // constexpr in C++20
+    template<class... UTypes>
+        constexpr const tuple& operator=(tuple<UTypes...>&&) const;                       // C++23
+    template <class U1, class U2>
+        tuple& operator=(const pair<U1, U2>&); // iff sizeof...(T) == 2                   // constexpr in C++20
+    template<class U1, class U2>
+        constexpr const tuple& operator=(const pair<U1, U2>&) const;   // iff sizeof...(Types) == 2 // C++23
+    template <class U1, class U2>
+        tuple& operator=(pair<U1, U2>&&); // iff sizeof...(T) == 2                        // constexpr in C++20
+    template<class U1, class U2>
+        constexpr const tuple& operator=(pair<U1, U2>&&) const;  // iff sizeof...(Types) == 2 // C++23
+
+    template<class U, size_t N>
+        tuple& operator=(array<U, N> const&) // iff sizeof...(T) == N, EXTENSION
+    template<class U, size_t N>
+        tuple& operator=(array<U, N>&&) // iff sizeof...(T) == N, EXTENSION
+
+    void swap(tuple&) noexcept(AND(swap(declval<T&>(), declval<T&>())...));               // constexpr in C++20
+    constexpr void swap(const tuple&) const noexcept(see-below);                          // C++23
+};
+
+
+template<class... TTypes, class... UTypes, template<class> class TQual, template<class> class UQual> // since C++23
+  requires requires { typename tuple<common_reference_t<TQual<TTypes>, UQual<UTypes>>...>; }
+struct basic_common_reference<tuple<TTypes...>, tuple<UTypes...>, TQual, UQual> {
+  using type = tuple<common_reference_t<TQual<TTypes>, UQual<UTypes>>...>;
+};
+
+template<class... TTypes, class... UTypes>                                // since C++23
+  requires requires { typename tuple<common_type_t<TTypes, UTypes>...>; }
+struct common_type<tuple<TTypes...>, tuple<UTypes...>> {
+  using type = tuple<common_type_t<TTypes, UTypes>...>;
+};
+
+template <class ...T>
+tuple(T...) -> tuple<T...>;                                         // since C++17
+template <class T1, class T2>
+tuple(pair<T1, T2>) -> tuple<T1, T2>;                               // since C++17
+template <class Alloc, class ...T>
+tuple(allocator_arg_t, Alloc, T...) -> tuple<T...>;                 // since C++17
+template <class Alloc, class T1, class T2>
+tuple(allocator_arg_t, Alloc, pair<T1, T2>) -> tuple<T1, T2>;       // since C++17
+template <class Alloc, class ...T>
+tuple(allocator_arg_t, Alloc, tuple<T...>) -> tuple<T...>;          // since C++17
+
+inline constexpr unspecified ignore;
+
+template <class... T> tuple<V...>  make_tuple(T&&...); // constexpr in C++14
+template <class... T> tuple<ATypes...> forward_as_tuple(T&&...) noexcept; // constexpr in C++14
+template <class... T> tuple<T&...> tie(T&...) noexcept; // constexpr in C++14
+template <class... Tuples> tuple<CTypes...> tuple_cat(Tuples&&... tpls); // constexpr in C++14
+
+// [tuple.apply], calling a function with a tuple of arguments:
+template <class F, class Tuple>
+  constexpr decltype(auto) apply(F&& f, Tuple&& t); // C++17
+template <class T, class Tuple>
+  constexpr T make_from_tuple(Tuple&& t); // C++17
+
+// 20.4.1.4, tuple helper classes:
+template <class T> struct tuple_size; // undefined
+template <class... T> struct tuple_size<tuple<T...>>;
+template <class T>
+ inline constexpr size_t tuple_size_v = tuple_size<T>::value; // C++17
+template <size_t I, class T> struct tuple_element; // undefined
+template <size_t I, class... T> struct tuple_element<I, tuple<T...>>;
+template <size_t I, class T>
+  using tuple_element_t = typename tuple_element <I, T>::type; // C++14
+
+// 20.4.1.5, element access:
+template <size_t I, class... T>
+    typename tuple_element<I, tuple<T...>>::type&
+    get(tuple<T...>&) noexcept; // constexpr in C++14
+template <size_t I, class... T>
+    const typename tuple_element<I, tuple<T...>>::type&
+    get(const tuple<T...>&) noexcept; // constexpr in C++14
+template <size_t I, class... T>
+    typename tuple_element<I, tuple<T...>>::type&&
+    get(tuple<T...>&&) noexcept; // constexpr in C++14
+template <size_t I, class... T>
+    const typename tuple_element<I, tuple<T...>>::type&&
+    get(const tuple<T...>&&) noexcept; // constexpr in C++14
+
+template <class T1, class... T>
+    constexpr T1& get(tuple<T...>&) noexcept;  // C++14
+template <class T1, class... T>
+    constexpr const T1& get(const tuple<T...>&) noexcept;   // C++14
+template <class T1, class... T>
+    constexpr T1&& get(tuple<T...>&&) noexcept;   // C++14
+template <class T1, class... T>
+    constexpr const T1&& get(const tuple<T...>&&) noexcept;   // C++14
+
+// 20.4.1.6, relational operators:
+template<class... T, class... U> bool operator==(const tuple<T...>&, const tuple<U...>&); // constexpr in C++14
+template<class... T, class... U> bool operator<(const tuple<T...>&, const tuple<U...>&);  // constexpr in C++14, removed in C++20
+template<class... T, class... U> bool operator!=(const tuple<T...>&, const tuple<U...>&); // constexpr in C++14, removed in C++20
+template<class... T, class... U> bool operator>(const tuple<T...>&, const tuple<U...>&);  // constexpr in C++14, removed in C++20
+template<class... T, class... U> bool operator<=(const tuple<T...>&, const tuple<U...>&); // constexpr in C++14, removed in C++20
+template<class... T, class... U> bool operator>=(const tuple<T...>&, const tuple<U...>&); // constexpr in C++14, removed in C++20
+template<class... T, class... U>
+  constexpr common_comparison_category_t<synth-three-way-result<T, U>...>
+    operator<=>(const tuple<T...>&, const tuple<U...>&);                                  // since C++20
+
+template <class... Types, class Alloc>
+  struct uses_allocator<tuple<Types...>, Alloc>;
+
+template <class... Types>
+  void
+  swap(tuple<Types...>& x, tuple<Types...>& y) noexcept(noexcept(x.swap(y)));
+
+template <class... Types>
+  constexpr void swap(const tuple<Types...>& x, const tuple<Types...>& y) noexcept(see-below);   // C++23
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__compare/common_comparison_category.h>
+#include <__compare/synth_three_way.h>
+#include <__config>
+#include <__functional/invoke.h>
+#include <__functional/unwrap_ref.h>
+#include <__fwd/array.h>
+#include <__memory/allocator_arg_t.h>
+#include <__memory/uses_allocator.h>
+#include <__type_traits/apply_cv.h>
+#include <__type_traits/common_reference.h>
+#include <__type_traits/common_type.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/conjunction.h>
+#include <__type_traits/copy_cvref.h>
+#include <__type_traits/disjunction.h>
+#include <__type_traits/is_arithmetic.h>
+#include <__type_traits/is_assignable.h>
+#include <__type_traits/is_constructible.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_copy_assignable.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__type_traits/is_default_constructible.h>
+#include <__type_traits/is_empty.h>
+#include <__type_traits/is_final.h>
+#include <__type_traits/is_implicitly_default_constructible.h>
+#include <__type_traits/is_move_assignable.h>
+#include <__type_traits/is_move_constructible.h>
+#include <__type_traits/is_nothrow_assignable.h>
+#include <__type_traits/is_nothrow_constructible.h>
+#include <__type_traits/is_nothrow_copy_assignable.h>
+#include <__type_traits/is_nothrow_copy_constructible.h>
+#include <__type_traits/is_nothrow_default_constructible.h>
+#include <__type_traits/is_nothrow_move_assignable.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_swappable.h>
+#include <__type_traits/lazy.h>
+#include <__type_traits/maybe_const.h>
+#include <__type_traits/nat.h>
+#include <__type_traits/negation.h>
+#include <__type_traits/remove_cvref.h>
+#include <__type_traits/remove_reference.h>
+#include <__utility/forward.h>
+#include <__utility/integer_sequence.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <__utility/piecewise_construct.h>
+#include <__utility/swap.h>
+#include <cstddef>
+#include <version>
+
+// standard-mandated includes
+
+// [tuple.syn]
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#ifndef _LIBCPP_CXX03_LANG
+
+
+// __tuple_leaf
+
+template <size_t _Ip, class _Hp,
+          bool=is_empty<_Hp>::value && !__libcpp_is_final<_Hp>::value
+         >
+class __tuple_leaf;
+
+template <size_t _Ip, class _Hp, bool _Ep>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+void swap(__tuple_leaf<_Ip, _Hp, _Ep>& __x, __tuple_leaf<_Ip, _Hp, _Ep>& __y)
+    _NOEXCEPT_(__is_nothrow_swappable<_Hp>::value)
+{
+    swap(__x.get(), __y.get());
+}
+
+template <size_t _Ip, class _Hp, bool _Ep>
+_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
+void swap(const __tuple_leaf<_Ip, _Hp, _Ep>& __x, const __tuple_leaf<_Ip, _Hp, _Ep>& __y)
+     _NOEXCEPT_(__is_nothrow_swappable<const _Hp>::value) {
+  swap(__x.get(), __y.get());
+}
+
+template <size_t _Ip, class _Hp, bool>
+class __tuple_leaf
+{
+    _Hp __value_;
+
+    template <class _Tp>
+    static constexpr bool __can_bind_reference() {
+#if __has_keyword(__reference_binds_to_temporary)
+      return !__reference_binds_to_temporary(_Hp, _Tp);
+#else
+      return true;
+#endif
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX14
+    __tuple_leaf& operator=(const __tuple_leaf&);
+public:
+    _LIBCPP_INLINE_VISIBILITY constexpr __tuple_leaf()
+             _NOEXCEPT_(is_nothrow_default_constructible<_Hp>::value) : __value_()
+       {static_assert(!is_reference<_Hp>::value,
+              "Attempted to default construct a reference element in a tuple");}
+
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY constexpr
+        __tuple_leaf(integral_constant<int, 0>, const _Alloc&)
+            : __value_()
+        {static_assert(!is_reference<_Hp>::value,
+              "Attempted to default construct a reference element in a tuple");}
+
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY constexpr
+        __tuple_leaf(integral_constant<int, 1>, const _Alloc& __a)
+            : __value_(allocator_arg_t(), __a)
+        {static_assert(!is_reference<_Hp>::value,
+              "Attempted to default construct a reference element in a tuple");}
+
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY constexpr
+        __tuple_leaf(integral_constant<int, 2>, const _Alloc& __a)
+            : __value_(__a)
+        {static_assert(!is_reference<_Hp>::value,
+              "Attempted to default construct a reference element in a tuple");}
+
+    template <class _Tp,
+              class = __enable_if_t<
+                  _And<
+                      _IsNotSame<__remove_cvref_t<_Tp>, __tuple_leaf>,
+                      is_constructible<_Hp, _Tp>
+                    >::value
+                >
+            >
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+        explicit __tuple_leaf(_Tp&& __t) _NOEXCEPT_((is_nothrow_constructible<_Hp, _Tp>::value))
+            : __value_(_VSTD::forward<_Tp>(__t))
+        {static_assert(__can_bind_reference<_Tp&&>(),
+       "Attempted construction of reference element binds to a temporary whose lifetime has ended");}
+
+    template <class _Tp, class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+        explicit __tuple_leaf(integral_constant<int, 0>, const _Alloc&, _Tp&& __t)
+            : __value_(_VSTD::forward<_Tp>(__t))
+        {static_assert(__can_bind_reference<_Tp&&>(),
+       "Attempted construction of reference element binds to a temporary whose lifetime has ended");}
+
+    template <class _Tp, class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+        explicit __tuple_leaf(integral_constant<int, 1>, const _Alloc& __a, _Tp&& __t)
+            : __value_(allocator_arg_t(), __a, _VSTD::forward<_Tp>(__t))
+        {static_assert(!is_reference<_Hp>::value,
+            "Attempted to uses-allocator construct a reference element in a tuple");}
+
+    template <class _Tp, class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+        explicit __tuple_leaf(integral_constant<int, 2>, const _Alloc& __a, _Tp&& __t)
+            : __value_(_VSTD::forward<_Tp>(__t), __a)
+        {static_assert(!is_reference<_Hp>::value,
+           "Attempted to uses-allocator construct a reference element in a tuple");}
+
+    __tuple_leaf(const __tuple_leaf& __t) = default;
+    __tuple_leaf(__tuple_leaf&& __t) = default;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    int swap(__tuple_leaf& __t) _NOEXCEPT_(__is_nothrow_swappable<__tuple_leaf>::value)
+    {
+        _VSTD::swap(*this, __t);
+        return 0;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    int swap(const __tuple_leaf& __t) const _NOEXCEPT_(__is_nothrow_swappable<const __tuple_leaf>::value) {
+        _VSTD::swap(*this, __t);
+        return 0;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14       _Hp& get()       _NOEXCEPT {return __value_;}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14 const _Hp& get() const _NOEXCEPT {return __value_;}
+};
+
+template <size_t _Ip, class _Hp>
+class __tuple_leaf<_Ip, _Hp, true>
+    : private _Hp
+{
+    _LIBCPP_CONSTEXPR_SINCE_CXX14
+    __tuple_leaf& operator=(const __tuple_leaf&);
+public:
+    _LIBCPP_INLINE_VISIBILITY constexpr __tuple_leaf()
+             _NOEXCEPT_(is_nothrow_default_constructible<_Hp>::value) {}
+
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY constexpr
+        __tuple_leaf(integral_constant<int, 0>, const _Alloc&) {}
+
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY constexpr
+        __tuple_leaf(integral_constant<int, 1>, const _Alloc& __a)
+            : _Hp(allocator_arg_t(), __a) {}
+
+    template <class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY constexpr
+        __tuple_leaf(integral_constant<int, 2>, const _Alloc& __a)
+            : _Hp(__a) {}
+
+    template <class _Tp,
+              class = __enable_if_t<
+                  _And<
+                    _IsNotSame<__remove_cvref_t<_Tp>, __tuple_leaf>,
+                    is_constructible<_Hp, _Tp>
+                  >::value
+                >
+            >
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+        explicit __tuple_leaf(_Tp&& __t) _NOEXCEPT_((is_nothrow_constructible<_Hp, _Tp>::value))
+            : _Hp(_VSTD::forward<_Tp>(__t)) {}
+
+    template <class _Tp, class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY constexpr
+        explicit __tuple_leaf(integral_constant<int, 0>, const _Alloc&, _Tp&& __t)
+            : _Hp(_VSTD::forward<_Tp>(__t)) {}
+
+    template <class _Tp, class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY constexpr
+        explicit __tuple_leaf(integral_constant<int, 1>, const _Alloc& __a, _Tp&& __t)
+            : _Hp(allocator_arg_t(), __a, _VSTD::forward<_Tp>(__t)) {}
+
+    template <class _Tp, class _Alloc>
+        _LIBCPP_INLINE_VISIBILITY constexpr
+        explicit __tuple_leaf(integral_constant<int, 2>, const _Alloc& __a, _Tp&& __t)
+            : _Hp(_VSTD::forward<_Tp>(__t), __a) {}
+
+    __tuple_leaf(__tuple_leaf const &) = default;
+    __tuple_leaf(__tuple_leaf &&) = default;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    int
+    swap(__tuple_leaf& __t) _NOEXCEPT_(__is_nothrow_swappable<__tuple_leaf>::value)
+    {
+        _VSTD::swap(*this, __t);
+        return 0;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    int swap(const __tuple_leaf& __rhs) const _NOEXCEPT_(__is_nothrow_swappable<const __tuple_leaf>::value) {
+        _VSTD::swap(*this, __rhs);
+        return 0;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14       _Hp& get()       _NOEXCEPT {return static_cast<_Hp&>(*this);}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14 const _Hp& get() const _NOEXCEPT {return static_cast<const _Hp&>(*this);}
+};
+
+template <class ..._Tp>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+void __swallow(_Tp&&...) _NOEXCEPT {}
+
+template <class _Tp>
+struct __all_default_constructible;
+
+template <class ..._Tp>
+struct __all_default_constructible<__tuple_types<_Tp...>>
+    : __all<is_default_constructible<_Tp>::value...>
+{ };
+
+// __tuple_impl
+
+template<class _Indx, class ..._Tp> struct __tuple_impl;
+
+template<size_t ..._Indx, class ..._Tp>
+struct _LIBCPP_DECLSPEC_EMPTY_BASES __tuple_impl<__tuple_indices<_Indx...>, _Tp...>
+    : public __tuple_leaf<_Indx, _Tp>...
+{
+    _LIBCPP_INLINE_VISIBILITY
+    constexpr __tuple_impl()
+        _NOEXCEPT_(__all<is_nothrow_default_constructible<_Tp>::value...>::value) {}
+
+    template <size_t ..._Uf, class ..._Tf,
+              size_t ..._Ul, class ..._Tl, class ..._Up>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+        explicit
+        __tuple_impl(__tuple_indices<_Uf...>, __tuple_types<_Tf...>,
+                     __tuple_indices<_Ul...>, __tuple_types<_Tl...>,
+                     _Up&&... __u)
+                     _NOEXCEPT_((__all<is_nothrow_constructible<_Tf, _Up>::value...>::value &&
+                                 __all<is_nothrow_default_constructible<_Tl>::value...>::value)) :
+            __tuple_leaf<_Uf, _Tf>(_VSTD::forward<_Up>(__u))...,
+            __tuple_leaf<_Ul, _Tl>()...
+            {}
+
+    template <class _Alloc, size_t ..._Uf, class ..._Tf,
+              size_t ..._Ul, class ..._Tl, class ..._Up>
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+        explicit
+        __tuple_impl(allocator_arg_t, const _Alloc& __a,
+                     __tuple_indices<_Uf...>, __tuple_types<_Tf...>,
+                     __tuple_indices<_Ul...>, __tuple_types<_Tl...>,
+                     _Up&&... __u) :
+            __tuple_leaf<_Uf, _Tf>(__uses_alloc_ctor<_Tf, _Alloc, _Up>(), __a,
+            _VSTD::forward<_Up>(__u))...,
+            __tuple_leaf<_Ul, _Tl>(__uses_alloc_ctor<_Tl, _Alloc>(), __a)...
+            {}
+
+    template <class _Tuple,
+              class = __enable_if_t<__tuple_constructible<_Tuple, tuple<_Tp...> >::value>
+             >
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+        __tuple_impl(_Tuple&& __t) _NOEXCEPT_((__all<is_nothrow_constructible<_Tp, typename tuple_element<_Indx,
+                                       typename __make_tuple_types<_Tuple>::type>::type>::value...>::value))
+            : __tuple_leaf<_Indx, _Tp>(_VSTD::forward<typename tuple_element<_Indx,
+                                       typename __make_tuple_types<_Tuple>::type>::type>(_VSTD::get<_Indx>(__t)))...
+            {}
+
+    template <class _Alloc, class _Tuple,
+              class = __enable_if_t<__tuple_constructible<_Tuple, tuple<_Tp...> >::value>
+             >
+        _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+        __tuple_impl(allocator_arg_t, const _Alloc& __a, _Tuple&& __t)
+            : __tuple_leaf<_Indx, _Tp>(__uses_alloc_ctor<_Tp, _Alloc, typename tuple_element<_Indx,
+                                       typename __make_tuple_types<_Tuple>::type>::type>(), __a,
+                                       _VSTD::forward<typename tuple_element<_Indx,
+                                       typename __make_tuple_types<_Tuple>::type>::type>(_VSTD::get<_Indx>(__t)))...
+            {}
+
+    __tuple_impl(const __tuple_impl&) = default;
+    __tuple_impl(__tuple_impl&&) = default;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    void swap(__tuple_impl& __t)
+        _NOEXCEPT_(__all<__is_nothrow_swappable<_Tp>::value...>::value)
+    {
+        _VSTD::__swallow(__tuple_leaf<_Indx, _Tp>::swap(static_cast<__tuple_leaf<_Indx, _Tp>&>(__t))...);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    void swap(const __tuple_impl& __t) const
+        _NOEXCEPT_(__all<__is_nothrow_swappable<const _Tp>::value...>::value)
+    {
+        _VSTD::__swallow(__tuple_leaf<_Indx, _Tp>::swap(static_cast<const __tuple_leaf<_Indx, _Tp>&>(__t))...);
+    }
+};
+
+template<class _Dest, class _Source, size_t ..._Np>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+void __memberwise_copy_assign(_Dest& __dest, _Source const& __source, __tuple_indices<_Np...>) {
+    _VSTD::__swallow(((_VSTD::get<_Np>(__dest) = _VSTD::get<_Np>(__source)), void(), 0)...);
+}
+
+template<class _Dest, class _Source, class ..._Up, size_t ..._Np>
+_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+void __memberwise_forward_assign(_Dest& __dest, _Source&& __source, __tuple_types<_Up...>, __tuple_indices<_Np...>) {
+    _VSTD::__swallow(((
+        _VSTD::get<_Np>(__dest) = _VSTD::forward<_Up>(_VSTD::get<_Np>(__source))
+    ), void(), 0)...);
+}
+
+template <class ..._Tp>
+class _LIBCPP_TEMPLATE_VIS tuple
+{
+    typedef __tuple_impl<typename __make_tuple_indices<sizeof...(_Tp)>::type, _Tp...> _BaseT;
+
+    _BaseT __base_;
+
+    template <size_t _Jp, class ..._Up> friend _LIBCPP_CONSTEXPR_SINCE_CXX14
+        typename tuple_element<_Jp, tuple<_Up...> >::type& get(tuple<_Up...>&) _NOEXCEPT;
+    template <size_t _Jp, class ..._Up> friend _LIBCPP_CONSTEXPR_SINCE_CXX14
+        const typename tuple_element<_Jp, tuple<_Up...> >::type& get(const tuple<_Up...>&) _NOEXCEPT;
+    template <size_t _Jp, class ..._Up> friend _LIBCPP_CONSTEXPR_SINCE_CXX14
+        typename tuple_element<_Jp, tuple<_Up...> >::type&& get(tuple<_Up...>&&) _NOEXCEPT;
+    template <size_t _Jp, class ..._Up> friend _LIBCPP_CONSTEXPR_SINCE_CXX14
+        const typename tuple_element<_Jp, tuple<_Up...> >::type&& get(const tuple<_Up...>&&) _NOEXCEPT;
+public:
+    // [tuple.cnstr]
+
+    // tuple() constructors (including allocator_arg_t variants)
+    template <template<class...> class _IsImpDefault = __is_implicitly_default_constructible, __enable_if_t<
+        _And<
+            _IsImpDefault<_Tp>... // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    tuple()
+        _NOEXCEPT_(_And<is_nothrow_default_constructible<_Tp>...>::value)
+    { }
+
+    template <template<class...> class _IsImpDefault = __is_implicitly_default_constructible,
+              template<class...> class _IsDefault = is_default_constructible, __enable_if_t<
+        _And<
+            _IsDefault<_Tp>...,
+            _Not<_Lazy<_And, _IsImpDefault<_Tp>...> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
+    explicit tuple()
+        _NOEXCEPT_(_And<is_nothrow_default_constructible<_Tp>...>::value)
+    { }
+
+    template <class _Alloc, template<class...> class _IsImpDefault = __is_implicitly_default_constructible, __enable_if_t<
+        _And<
+            _IsImpDefault<_Tp>... // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple(allocator_arg_t, _Alloc const& __a)
+      : __base_(allocator_arg_t(), __a,
+                    __tuple_indices<>(), __tuple_types<>(),
+                    typename __make_tuple_indices<sizeof...(_Tp), 0>::type(),
+                    __tuple_types<_Tp...>()) {}
+
+    template <class _Alloc,
+              template<class...> class _IsImpDefault = __is_implicitly_default_constructible,
+              template<class...> class _IsDefault = is_default_constructible, __enable_if_t<
+        _And<
+            _IsDefault<_Tp>...,
+            _Not<_Lazy<_And, _IsImpDefault<_Tp>...> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    explicit tuple(allocator_arg_t, _Alloc const& __a)
+      : __base_(allocator_arg_t(), __a,
+                    __tuple_indices<>(), __tuple_types<>(),
+                    typename __make_tuple_indices<sizeof...(_Tp), 0>::type(),
+                    __tuple_types<_Tp...>()) {}
+
+    // tuple(const T&...) constructors (including allocator_arg_t variants)
+    template <template<class...> class _And = _And, __enable_if_t<
+        _And<
+            _BoolConstant<sizeof...(_Tp) >= 1>,
+            is_copy_constructible<_Tp>...,
+            is_convertible<const _Tp&, _Tp>... // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    tuple(const _Tp& ... __t)
+        _NOEXCEPT_(_And<is_nothrow_copy_constructible<_Tp>...>::value)
+        : __base_(typename __make_tuple_indices<sizeof...(_Tp)>::type(),
+                typename __make_tuple_types<tuple, sizeof...(_Tp)>::type(),
+                typename __make_tuple_indices<0>::type(),
+                typename __make_tuple_types<tuple, 0>::type(),
+                __t...
+               ) {}
+
+    template <template<class...> class _And = _And, __enable_if_t<
+        _And<
+            _BoolConstant<sizeof...(_Tp) >= 1>,
+            is_copy_constructible<_Tp>...,
+            _Not<_Lazy<_And, is_convertible<const _Tp&, _Tp>...> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    explicit tuple(const _Tp& ... __t)
+        _NOEXCEPT_(_And<is_nothrow_copy_constructible<_Tp>...>::value)
+        : __base_(typename __make_tuple_indices<sizeof...(_Tp)>::type(),
+                typename __make_tuple_types<tuple, sizeof...(_Tp)>::type(),
+                typename __make_tuple_indices<0>::type(),
+                typename __make_tuple_types<tuple, 0>::type(),
+                __t...
+               ) {}
+
+    template <class _Alloc, template<class...> class _And = _And, __enable_if_t<
+        _And<
+            _BoolConstant<sizeof...(_Tp) >= 1>,
+            is_copy_constructible<_Tp>...,
+            is_convertible<const _Tp&, _Tp>... // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple(allocator_arg_t, const _Alloc& __a, const _Tp& ... __t)
+        : __base_(allocator_arg_t(), __a,
+                typename __make_tuple_indices<sizeof...(_Tp)>::type(),
+                typename __make_tuple_types<tuple, sizeof...(_Tp)>::type(),
+                typename __make_tuple_indices<0>::type(),
+                typename __make_tuple_types<tuple, 0>::type(),
+                __t...
+               ) {}
+
+    template <class _Alloc, template<class...> class _And = _And, __enable_if_t<
+        _And<
+            _BoolConstant<sizeof...(_Tp) >= 1>,
+            is_copy_constructible<_Tp>...,
+            _Not<_Lazy<_And, is_convertible<const _Tp&, _Tp>...> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    explicit tuple(allocator_arg_t, const _Alloc& __a, const _Tp& ... __t)
+        : __base_(allocator_arg_t(), __a,
+                typename __make_tuple_indices<sizeof...(_Tp)>::type(),
+                typename __make_tuple_types<tuple, sizeof...(_Tp)>::type(),
+                typename __make_tuple_indices<0>::type(),
+                typename __make_tuple_types<tuple, 0>::type(),
+                __t...
+               ) {}
+
+    // tuple(U&& ...) constructors (including allocator_arg_t variants)
+    template <class ..._Up> struct _IsThisTuple : false_type { };
+    template <class _Up> struct _IsThisTuple<_Up> : is_same<__remove_cvref_t<_Up>, tuple> { };
+
+    template <class ..._Up>
+    struct _EnableUTypesCtor : _And<
+        _BoolConstant<sizeof...(_Tp) >= 1>,
+        _Not<_IsThisTuple<_Up...> >, // extension to allow mis-behaved user constructors
+        is_constructible<_Tp, _Up>...
+    > { };
+
+    template <class ..._Up, __enable_if_t<
+        _And<
+            _BoolConstant<sizeof...(_Up) == sizeof...(_Tp)>,
+            _EnableUTypesCtor<_Up...>,
+            is_convertible<_Up, _Tp>... // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    tuple(_Up&&... __u)
+        _NOEXCEPT_((_And<is_nothrow_constructible<_Tp, _Up>...>::value))
+        : __base_(typename __make_tuple_indices<sizeof...(_Up)>::type(),
+                    typename __make_tuple_types<tuple, sizeof...(_Up)>::type(),
+                    typename __make_tuple_indices<sizeof...(_Tp), sizeof...(_Up)>::type(),
+                    typename __make_tuple_types<tuple, sizeof...(_Tp), sizeof...(_Up)>::type(),
+                    _VSTD::forward<_Up>(__u)...) {}
+
+    template <class ..._Up, __enable_if_t<
+        _And<
+            _BoolConstant<sizeof...(_Up) == sizeof...(_Tp)>,
+            _EnableUTypesCtor<_Up...>,
+            _Not<_Lazy<_And, is_convertible<_Up, _Tp>...> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    explicit tuple(_Up&&... __u)
+        _NOEXCEPT_((_And<is_nothrow_constructible<_Tp, _Up>...>::value))
+        : __base_(typename __make_tuple_indices<sizeof...(_Up)>::type(),
+                    typename __make_tuple_types<tuple, sizeof...(_Up)>::type(),
+                    typename __make_tuple_indices<sizeof...(_Tp), sizeof...(_Up)>::type(),
+                    typename __make_tuple_types<tuple, sizeof...(_Tp), sizeof...(_Up)>::type(),
+                    _VSTD::forward<_Up>(__u)...) {}
+
+    template <class _Alloc, class ..._Up, __enable_if_t<
+        _And<
+            _BoolConstant<sizeof...(_Up) == sizeof...(_Tp)>,
+            _EnableUTypesCtor<_Up...>,
+            is_convertible<_Up, _Tp>... // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple(allocator_arg_t, const _Alloc& __a, _Up&&... __u)
+        : __base_(allocator_arg_t(), __a,
+                    typename __make_tuple_indices<sizeof...(_Up)>::type(),
+                    typename __make_tuple_types<tuple, sizeof...(_Up)>::type(),
+                    typename __make_tuple_indices<sizeof...(_Tp), sizeof...(_Up)>::type(),
+                    typename __make_tuple_types<tuple, sizeof...(_Tp), sizeof...(_Up)>::type(),
+                    _VSTD::forward<_Up>(__u)...) {}
+
+    template <class _Alloc, class ..._Up, __enable_if_t<
+        _And<
+            _BoolConstant<sizeof...(_Up) == sizeof...(_Tp)>,
+            _EnableUTypesCtor<_Up...>,
+            _Not<_Lazy<_And, is_convertible<_Up, _Tp>...> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    explicit tuple(allocator_arg_t, const _Alloc& __a, _Up&&... __u)
+        : __base_(allocator_arg_t(), __a,
+                    typename __make_tuple_indices<sizeof...(_Up)>::type(),
+                    typename __make_tuple_types<tuple, sizeof...(_Up)>::type(),
+                    typename __make_tuple_indices<sizeof...(_Tp), sizeof...(_Up)>::type(),
+                    typename __make_tuple_types<tuple, sizeof...(_Tp), sizeof...(_Up)>::type(),
+                    _VSTD::forward<_Up>(__u)...) {}
+
+    // Copy and move constructors (including the allocator_arg_t variants)
+    tuple(const tuple&) = default;
+    tuple(tuple&&) = default;
+
+    template <class _Alloc, template<class...> class _And = _And, __enable_if_t<
+        _And<is_copy_constructible<_Tp>...>::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple(allocator_arg_t, const _Alloc& __alloc, const tuple& __t)
+        : __base_(allocator_arg_t(), __alloc, __t)
+    { }
+
+    template <class _Alloc, template<class...> class _And = _And, __enable_if_t<
+        _And<is_move_constructible<_Tp>...>::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple(allocator_arg_t, const _Alloc& __alloc, tuple&& __t)
+        : __base_(allocator_arg_t(), __alloc, _VSTD::move(__t))
+    { }
+
+    // tuple(const tuple<U...>&) constructors (including allocator_arg_t variants)
+
+    template <class _OtherTuple, class _DecayedOtherTuple = __remove_cvref_t<_OtherTuple>, class = void>
+    struct _EnableCtorFromUTypesTuple : false_type {};
+
+    template <class _OtherTuple, class... _Up>
+    struct _EnableCtorFromUTypesTuple<_OtherTuple, tuple<_Up...>,
+              // the length of the packs needs to checked first otherwise the 2 packs cannot be expanded simultaneously below
+               __enable_if_t<sizeof...(_Up) == sizeof...(_Tp)>> : _And<
+        // the two conditions below are not in spec. The purpose is to disable the UTypes Ctor when copy/move Ctor can work.
+        // Otherwise, is_constructible can trigger hard error in those cases https://godbolt.org/z/M94cGdKcE
+        _Not<is_same<_OtherTuple, const tuple&> >,
+        _Not<is_same<_OtherTuple, tuple&&> >,
+        is_constructible<_Tp, __copy_cvref_t<_OtherTuple, _Up> >...,
+        _Lazy<_Or, _BoolConstant<sizeof...(_Tp) != 1>,
+            // _Tp and _Up are 1-element packs - the pack expansions look
+            // weird to avoid tripping up the type traits in degenerate cases
+            _Lazy<_And,
+                _Not<is_same<_Tp, _Up> >...,
+                _Not<is_convertible<_OtherTuple, _Tp> >...,
+                _Not<is_constructible<_Tp, _OtherTuple> >...
+            >
+        >
+    > {};
+
+    template <class ..._Up, __enable_if_t<
+        _And<
+            _EnableCtorFromUTypesTuple<const tuple<_Up...>&>,
+            is_convertible<const _Up&, _Tp>... // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    tuple(const tuple<_Up...>& __t)
+        _NOEXCEPT_((_And<is_nothrow_constructible<_Tp, const _Up&>...>::value))
+        : __base_(__t)
+    { }
+
+    template <class ..._Up, __enable_if_t<
+        _And<
+            _EnableCtorFromUTypesTuple<const tuple<_Up...>&>,
+            _Not<_Lazy<_And, is_convertible<const _Up&, _Tp>...> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    explicit tuple(const tuple<_Up...>& __t)
+        _NOEXCEPT_((_And<is_nothrow_constructible<_Tp, const _Up&>...>::value))
+        : __base_(__t)
+    { }
+
+    template <class ..._Up, class _Alloc, __enable_if_t<
+        _And<
+            _EnableCtorFromUTypesTuple<const tuple<_Up...>&>,
+            is_convertible<const _Up&, _Tp>... // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple(allocator_arg_t, const _Alloc& __a, const tuple<_Up...>& __t)
+        : __base_(allocator_arg_t(), __a, __t)
+    { }
+
+    template <class ..._Up, class _Alloc, __enable_if_t<
+        _And<
+            _EnableCtorFromUTypesTuple<const tuple<_Up...>&>,
+            _Not<_Lazy<_And, is_convertible<const _Up&, _Tp>...> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    explicit tuple(allocator_arg_t, const _Alloc& __a, const tuple<_Up...>& __t)
+        : __base_(allocator_arg_t(), __a, __t)
+    { }
+
+#if _LIBCPP_STD_VER > 20
+    // tuple(tuple<U...>&) constructors (including allocator_arg_t variants)
+
+    template <class... _Up, enable_if_t<
+        _EnableCtorFromUTypesTuple<tuple<_Up...>&>::value>* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+        explicit(!(is_convertible_v<_Up&, _Tp> && ...))
+    tuple(tuple<_Up...>& __t) : __base_(__t) {}
+
+    template <class _Alloc, class... _Up, enable_if_t<
+        _EnableCtorFromUTypesTuple<tuple<_Up...>&>::value>* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+        explicit(!(is_convertible_v<_Up&, _Tp> && ...))
+    tuple(allocator_arg_t, const _Alloc& __alloc, tuple<_Up...>& __t) : __base_(allocator_arg_t(), __alloc, __t) {}
+#endif // _LIBCPP_STD_VER > 20
+
+    // tuple(tuple<U...>&&) constructors (including allocator_arg_t variants)
+
+    template <class ..._Up, __enable_if_t<
+        _And<
+            _EnableCtorFromUTypesTuple<tuple<_Up...>&&>,
+            is_convertible<_Up, _Tp>... // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    tuple(tuple<_Up...>&& __t)
+        _NOEXCEPT_((_And<is_nothrow_constructible<_Tp, _Up>...>::value))
+        : __base_(_VSTD::move(__t))
+    { }
+
+    template <class ..._Up, __enable_if_t<
+        _And<
+            _EnableCtorFromUTypesTuple<tuple<_Up...>&&>,
+            _Not<_Lazy<_And, is_convertible<_Up, _Tp>...> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    explicit tuple(tuple<_Up...>&& __t)
+        _NOEXCEPT_((_And<is_nothrow_constructible<_Tp, _Up>...>::value))
+        : __base_(_VSTD::move(__t))
+    { }
+
+    template <class _Alloc, class ..._Up, __enable_if_t<
+        _And<
+            _EnableCtorFromUTypesTuple<tuple<_Up...>&&>,
+            is_convertible<_Up, _Tp>... // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple(allocator_arg_t, const _Alloc& __a, tuple<_Up...>&& __t)
+        : __base_(allocator_arg_t(), __a, _VSTD::move(__t))
+    { }
+
+    template <class _Alloc, class ..._Up, __enable_if_t<
+        _And<
+            _EnableCtorFromUTypesTuple<tuple<_Up...>&&>,
+            _Not<_Lazy<_And, is_convertible<_Up, _Tp>...> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    explicit tuple(allocator_arg_t, const _Alloc& __a, tuple<_Up...>&& __t)
+        : __base_(allocator_arg_t(), __a, _VSTD::move(__t))
+    { }
+
+#if _LIBCPP_STD_VER > 20
+    // tuple(const tuple<U...>&&) constructors (including allocator_arg_t variants)
+
+    template <class... _Up, enable_if_t<
+        _EnableCtorFromUTypesTuple<const tuple<_Up...>&&>::value>* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+        explicit(!(is_convertible_v<const _Up&&, _Tp> && ...))
+    tuple(const tuple<_Up...>&& __t) : __base_(std::move(__t)) {}
+
+    template <class _Alloc, class... _Up, enable_if_t<
+        _EnableCtorFromUTypesTuple<const tuple<_Up...>&&>::value>* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+        explicit(!(is_convertible_v<const _Up&&, _Tp> && ...))
+    tuple(allocator_arg_t, const _Alloc& __alloc, const tuple<_Up...>&& __t)
+        : __base_(allocator_arg_t(), __alloc, std::move(__t)) {}
+#endif // _LIBCPP_STD_VER > 20
+
+    // tuple(const pair<U1, U2>&) constructors (including allocator_arg_t variants)
+
+    template <template <class...> class Pred, class _Pair, class _DecayedPair = __remove_cvref_t<_Pair>, class _Tuple = tuple>
+    struct _CtorPredicateFromPair : false_type{};
+
+    template <template <class...> class Pred, class _Pair, class _Up1, class _Up2, class _Tp1, class _Tp2>
+    struct _CtorPredicateFromPair<Pred, _Pair, pair<_Up1, _Up2>, tuple<_Tp1, _Tp2> > : _And<
+        Pred<_Tp1, __copy_cvref_t<_Pair, _Up1> >,
+        Pred<_Tp2, __copy_cvref_t<_Pair, _Up2> >
+    > {};
+
+    template <class _Pair>
+    struct _EnableCtorFromPair : _CtorPredicateFromPair<is_constructible, _Pair>{};
+
+    template <class _Pair>
+    struct _NothrowConstructibleFromPair : _CtorPredicateFromPair<is_nothrow_constructible, _Pair>{};
+
+    template <class _Pair, class _DecayedPair = __remove_cvref_t<_Pair>, class _Tuple = tuple>
+    struct _BothImplicitlyConvertible : false_type{};
+
+    template <class _Pair, class _Up1, class _Up2, class _Tp1, class _Tp2>
+    struct _BothImplicitlyConvertible<_Pair, pair<_Up1, _Up2>, tuple<_Tp1, _Tp2> > : _And<
+        is_convertible<__copy_cvref_t<_Pair, _Up1>, _Tp1>,
+        is_convertible<__copy_cvref_t<_Pair, _Up2>, _Tp2>
+    > {};
+
+    template <class _Up1, class _Up2, template<class...> class _And = _And, __enable_if_t<
+        _And<
+            _EnableCtorFromPair<const pair<_Up1, _Up2>&>,
+            _BothImplicitlyConvertible<const pair<_Up1, _Up2>&> // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    tuple(const pair<_Up1, _Up2>& __p)
+        _NOEXCEPT_((_NothrowConstructibleFromPair<const pair<_Up1, _Up2>&>::value))
+        : __base_(__p)
+    { }
+
+    template <class _Up1, class _Up2, template<class...> class _And = _And, __enable_if_t<
+        _And<
+            _EnableCtorFromPair<const pair<_Up1, _Up2>&>,
+            _Not<_BothImplicitlyConvertible<const pair<_Up1, _Up2>&> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    explicit tuple(const pair<_Up1, _Up2>& __p)
+        _NOEXCEPT_((_NothrowConstructibleFromPair<const pair<_Up1, _Up2>&>::value))
+        : __base_(__p)
+    { }
+
+    template <class _Alloc, class _Up1, class _Up2, template<class...> class _And = _And, __enable_if_t<
+        _And<
+            _EnableCtorFromPair<const pair<_Up1, _Up2>&>,
+            _BothImplicitlyConvertible<const pair<_Up1, _Up2>&> // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple(allocator_arg_t, const _Alloc& __a, const pair<_Up1, _Up2>& __p)
+        : __base_(allocator_arg_t(), __a, __p)
+    { }
+
+    template <class _Alloc, class _Up1, class _Up2, template<class...> class _And = _And, __enable_if_t<
+        _And<
+            _EnableCtorFromPair<const pair<_Up1, _Up2>&>,
+            _Not<_BothImplicitlyConvertible<const pair<_Up1, _Up2>&> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    explicit tuple(allocator_arg_t, const _Alloc& __a, const pair<_Up1, _Up2>& __p)
+        : __base_(allocator_arg_t(), __a, __p)
+    { }
+
+#if _LIBCPP_STD_VER > 20
+    // tuple(pair<U1, U2>&) constructors (including allocator_arg_t variants)
+
+    template <class _U1, class _U2, enable_if_t<
+        _EnableCtorFromPair<pair<_U1, _U2>&>::value>* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+        explicit(!_BothImplicitlyConvertible<pair<_U1, _U2>&>::value)
+    tuple(pair<_U1, _U2>& __p) : __base_(__p) {}
+
+    template <class _Alloc, class _U1, class _U2, enable_if_t<
+        _EnableCtorFromPair<std::pair<_U1, _U2>&>::value>* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+        explicit(!_BothImplicitlyConvertible<pair<_U1, _U2>&>::value)
+    tuple(allocator_arg_t, const _Alloc& __alloc, pair<_U1, _U2>& __p) : __base_(allocator_arg_t(), __alloc, __p) {}
+#endif
+
+    // tuple(pair<U1, U2>&&) constructors (including allocator_arg_t variants)
+
+    template <class _Up1, class _Up2, template<class...> class _And = _And, __enable_if_t<
+        _And<
+            _EnableCtorFromPair<pair<_Up1, _Up2>&&>,
+            _BothImplicitlyConvertible<pair<_Up1, _Up2>&&> // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    tuple(pair<_Up1, _Up2>&& __p)
+        _NOEXCEPT_((_NothrowConstructibleFromPair<pair<_Up1, _Up2>&&>::value))
+        : __base_(_VSTD::move(__p))
+    { }
+
+    template <class _Up1, class _Up2, template<class...> class _And = _And, __enable_if_t<
+        _And<
+            _EnableCtorFromPair<pair<_Up1, _Up2>&&>,
+            _Not<_BothImplicitlyConvertible<pair<_Up1, _Up2>&&> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    explicit tuple(pair<_Up1, _Up2>&& __p)
+        _NOEXCEPT_((_NothrowConstructibleFromPair<pair<_Up1, _Up2>&&>::value))
+        : __base_(_VSTD::move(__p))
+    { }
+
+    template <class _Alloc, class _Up1, class _Up2, template<class...> class _And = _And, __enable_if_t<
+        _And<
+            _EnableCtorFromPair<pair<_Up1, _Up2>&&>,
+            _BothImplicitlyConvertible<pair<_Up1, _Up2>&&> // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple(allocator_arg_t, const _Alloc& __a, pair<_Up1, _Up2>&& __p)
+        : __base_(allocator_arg_t(), __a, _VSTD::move(__p))
+    { }
+
+    template <class _Alloc, class _Up1, class _Up2, template<class...> class _And = _And, __enable_if_t<
+        _And<
+            _EnableCtorFromPair<pair<_Up1, _Up2>&&>,
+            _Not<_BothImplicitlyConvertible<pair<_Up1, _Up2>&&> > // explicit check
+        >::value
+    , int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    explicit tuple(allocator_arg_t, const _Alloc& __a, pair<_Up1, _Up2>&& __p)
+        : __base_(allocator_arg_t(), __a, _VSTD::move(__p))
+    { }
+
+#if _LIBCPP_STD_VER > 20
+    // tuple(const pair<U1, U2>&&) constructors (including allocator_arg_t variants)
+
+    template <class _U1, class _U2, enable_if_t<
+        _EnableCtorFromPair<const pair<_U1, _U2>&&>::value>* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+        explicit(!_BothImplicitlyConvertible<const pair<_U1, _U2>&&>::value)
+    tuple(const pair<_U1, _U2>&& __p) : __base_(std::move(__p)) {}
+
+    template <class _Alloc, class _U1, class _U2, enable_if_t<
+        _EnableCtorFromPair<const pair<_U1, _U2>&&>::value>* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+        explicit(!_BothImplicitlyConvertible<const pair<_U1, _U2>&&>::value)
+    tuple(allocator_arg_t, const _Alloc& __alloc, const pair<_U1, _U2>&& __p)
+        : __base_(allocator_arg_t(), __alloc, std::move(__p)) {}
+#endif // _LIBCPP_STD_VER > 20
+
+    // [tuple.assign]
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple& operator=(_If<_And<is_copy_assignable<_Tp>...>::value, tuple, __nat> const& __tuple)
+        _NOEXCEPT_((_And<is_nothrow_copy_assignable<_Tp>...>::value))
+    {
+        _VSTD::__memberwise_copy_assign(*this, __tuple,
+            typename __make_tuple_indices<sizeof...(_Tp)>::type());
+        return *this;
+    }
+
+#if _LIBCPP_STD_VER > 20
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    const tuple& operator=(tuple const& __tuple) const
+      requires (_And<is_copy_assignable<const _Tp>...>::value) {
+        std::__memberwise_copy_assign(*this, __tuple, typename __make_tuple_indices<sizeof...(_Tp)>::type());
+        return *this;
+    }
+
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    const tuple& operator=(tuple&& __tuple) const
+      requires (_And<is_assignable<const _Tp&, _Tp>...>::value) {
+        std::__memberwise_forward_assign(*this,
+                                         std::move(__tuple),
+                                         __tuple_types<_Tp...>(),
+                                         typename __make_tuple_indices<sizeof...(_Tp)>::type());
+        return *this;
+    }
+#endif // _LIBCPP_STD_VER > 20
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple& operator=(_If<_And<is_move_assignable<_Tp>...>::value, tuple, __nat>&& __tuple)
+        _NOEXCEPT_((_And<is_nothrow_move_assignable<_Tp>...>::value))
+    {
+        _VSTD::__memberwise_forward_assign(*this, _VSTD::move(__tuple),
+            __tuple_types<_Tp...>(),
+            typename __make_tuple_indices<sizeof...(_Tp)>::type());
+        return *this;
+    }
+
+    template<class... _Up, __enable_if_t<
+        _And<
+            _BoolConstant<sizeof...(_Tp) == sizeof...(_Up)>,
+            is_assignable<_Tp&, _Up const&>...
+        >::value
+    ,int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple& operator=(tuple<_Up...> const& __tuple)
+        _NOEXCEPT_((_And<is_nothrow_assignable<_Tp&, _Up const&>...>::value))
+    {
+        _VSTD::__memberwise_copy_assign(*this, __tuple,
+            typename __make_tuple_indices<sizeof...(_Tp)>::type());
+        return *this;
+    }
+
+    template<class... _Up, __enable_if_t<
+        _And<
+            _BoolConstant<sizeof...(_Tp) == sizeof...(_Up)>,
+            is_assignable<_Tp&, _Up>...
+        >::value
+    ,int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple& operator=(tuple<_Up...>&& __tuple)
+        _NOEXCEPT_((_And<is_nothrow_assignable<_Tp&, _Up>...>::value))
+    {
+        _VSTD::__memberwise_forward_assign(*this, _VSTD::move(__tuple),
+            __tuple_types<_Up...>(),
+            typename __make_tuple_indices<sizeof...(_Tp)>::type());
+        return *this;
+    }
+
+
+#if _LIBCPP_STD_VER > 20
+    template <class... _UTypes, enable_if_t<
+        _And<_BoolConstant<sizeof...(_Tp) == sizeof...(_UTypes)>,
+             is_assignable<const _Tp&, const _UTypes&>...>::value>* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    const tuple& operator=(const tuple<_UTypes...>& __u) const {
+        std::__memberwise_copy_assign(*this,
+                                      __u,
+                                      typename __make_tuple_indices<sizeof...(_Tp)>::type());
+        return *this;
+    }
+
+    template <class... _UTypes, enable_if_t<
+        _And<_BoolConstant<sizeof...(_Tp) == sizeof...(_UTypes)>,
+             is_assignable<const _Tp&, _UTypes>...>::value>* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    const tuple& operator=(tuple<_UTypes...>&& __u) const {
+        std::__memberwise_forward_assign(*this,
+                                         __u,
+                                         __tuple_types<_UTypes...>(),
+                                         typename __make_tuple_indices<sizeof...(_Tp)>::type());
+        return *this;
+    }
+#endif // _LIBCPP_STD_VER > 20
+
+    template <template<class...> class Pred, bool _Const,
+              class _Pair, class _DecayedPair = __remove_cvref_t<_Pair>, class _Tuple = tuple>
+    struct _AssignPredicateFromPair : false_type {};
+
+    template <template<class...> class Pred, bool _Const,
+              class _Pair, class _Up1, class _Up2, class _Tp1, class _Tp2>
+    struct _AssignPredicateFromPair<Pred, _Const, _Pair, pair<_Up1, _Up2>, tuple<_Tp1, _Tp2> > :
+        _And<Pred<__maybe_const<_Const, _Tp1>&, __copy_cvref_t<_Pair, _Up1> >,
+             Pred<__maybe_const<_Const, _Tp2>&, __copy_cvref_t<_Pair, _Up2> >
+            > {};
+
+    template <bool _Const, class _Pair>
+    struct _EnableAssignFromPair : _AssignPredicateFromPair<is_assignable, _Const, _Pair> {};
+
+    template <bool _Const, class _Pair>
+    struct _NothrowAssignFromPair : _AssignPredicateFromPair<is_nothrow_assignable, _Const, _Pair> {};
+
+#if _LIBCPP_STD_VER > 20
+    template <class _U1, class _U2, enable_if_t<
+        _EnableAssignFromPair<true, const pair<_U1, _U2>&>::value>* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    const tuple& operator=(const pair<_U1, _U2>& __pair) const
+      noexcept(_NothrowAssignFromPair<true, const pair<_U1, _U2>&>::value) {
+        std::get<0>(*this) = __pair.first;
+        std::get<1>(*this) = __pair.second;
+        return *this;
+    }
+
+    template <class _U1, class _U2, enable_if_t<
+        _EnableAssignFromPair<true, pair<_U1, _U2>&&>::value>* = nullptr>
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    const tuple& operator=(pair<_U1, _U2>&& __pair) const
+      noexcept(_NothrowAssignFromPair<true, pair<_U1, _U2>&&>::value) {
+        std::get<0>(*this) = std::move(__pair.first);
+        std::get<1>(*this) = std::move(__pair.second);
+        return *this;
+    }
+#endif // _LIBCPP_STD_VER > 20
+
+    template<class _Up1, class _Up2, __enable_if_t<
+        _EnableAssignFromPair<false, pair<_Up1, _Up2> const&>::value
+    ,int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple& operator=(pair<_Up1, _Up2> const& __pair)
+        _NOEXCEPT_((_NothrowAssignFromPair<false, pair<_Up1, _Up2> const&>::value))
+    {
+        _VSTD::get<0>(*this) = __pair.first;
+        _VSTD::get<1>(*this) = __pair.second;
+        return *this;
+    }
+
+    template<class _Up1, class _Up2, __enable_if_t<
+        _EnableAssignFromPair<false, pair<_Up1, _Up2>&&>::value
+    ,int> = 0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple& operator=(pair<_Up1, _Up2>&& __pair)
+        _NOEXCEPT_((_NothrowAssignFromPair<false, pair<_Up1, _Up2>&&>::value))
+    {
+        _VSTD::get<0>(*this) = _VSTD::forward<_Up1>(__pair.first);
+        _VSTD::get<1>(*this) = _VSTD::forward<_Up2>(__pair.second);
+        return *this;
+    }
+
+    // EXTENSION
+    template<class _Up, size_t _Np, class = __enable_if_t<
+        _And<
+            _BoolConstant<_Np == sizeof...(_Tp)>,
+            is_assignable<_Tp&, _Up const&>...
+        >::value
+    > >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple& operator=(array<_Up, _Np> const& __array)
+        _NOEXCEPT_((_And<is_nothrow_assignable<_Tp&, _Up const&>...>::value))
+    {
+        _VSTD::__memberwise_copy_assign(*this, __array,
+            typename __make_tuple_indices<sizeof...(_Tp)>::type());
+        return *this;
+    }
+
+    // EXTENSION
+    template<class _Up, size_t _Np, class = void, class = __enable_if_t<
+        _And<
+            _BoolConstant<_Np == sizeof...(_Tp)>,
+            is_assignable<_Tp&, _Up>...
+        >::value
+    > >
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    tuple& operator=(array<_Up, _Np>&& __array)
+        _NOEXCEPT_((_And<is_nothrow_assignable<_Tp&, _Up>...>::value))
+    {
+        _VSTD::__memberwise_forward_assign(*this, _VSTD::move(__array),
+            __tuple_types<_If<true, _Up, _Tp>...>(),
+            typename __make_tuple_indices<sizeof...(_Tp)>::type());
+        return *this;
+    }
+
+    // [tuple.swap]
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void swap(tuple& __t) _NOEXCEPT_(__all<__is_nothrow_swappable<_Tp>::value...>::value)
+        {__base_.swap(__t.__base_);}
+
+#if _LIBCPP_STD_VER > 20
+    _LIBCPP_HIDE_FROM_ABI constexpr
+    void swap(const tuple& __t) const noexcept(__all<is_nothrow_swappable_v<const _Tp&>...>::value) {
+        __base_.swap(__t.__base_);
+    }
+#endif // _LIBCPP_STD_VER > 20
+};
+
+template <>
+class _LIBCPP_TEMPLATE_VIS tuple<>
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY constexpr
+        tuple() _NOEXCEPT = default;
+    template <class _Alloc>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+        tuple(allocator_arg_t, const _Alloc&) _NOEXCEPT {}
+    template <class _Alloc>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+        tuple(allocator_arg_t, const _Alloc&, const tuple&) _NOEXCEPT {}
+    template <class _Up>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+        tuple(array<_Up, 0>) _NOEXCEPT {}
+    template <class _Alloc, class _Up>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+        tuple(allocator_arg_t, const _Alloc&, array<_Up, 0>) _NOEXCEPT {}
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void swap(tuple&) _NOEXCEPT {}
+#if _LIBCPP_STD_VER > 20
+    _LIBCPP_HIDE_FROM_ABI constexpr void swap(const tuple&) const noexcept {}
+#endif
+};
+
+#if _LIBCPP_STD_VER > 20
+template <class... _TTypes, class... _UTypes, template<class> class _TQual, template<class> class _UQual>
+    requires requires { typename tuple<common_reference_t<_TQual<_TTypes>, _UQual<_UTypes>>...>; }
+struct basic_common_reference<tuple<_TTypes...>, tuple<_UTypes...>, _TQual, _UQual> {
+    using type = tuple<common_reference_t<_TQual<_TTypes>, _UQual<_UTypes>>...>;
+};
+
+template <class... _TTypes, class... _UTypes>
+    requires requires { typename tuple<common_type_t<_TTypes, _UTypes>...>; }
+struct common_type<tuple<_TTypes...>, tuple<_UTypes...>> {
+    using type = tuple<common_type_t<_TTypes, _UTypes>...>;
+};
+#endif // _LIBCPP_STD_VER > 20
+
+#if _LIBCPP_STD_VER > 14
+template <class ..._Tp>
+tuple(_Tp...) -> tuple<_Tp...>;
+template <class _Tp1, class _Tp2>
+tuple(pair<_Tp1, _Tp2>) -> tuple<_Tp1, _Tp2>;
+template <class _Alloc, class ..._Tp>
+tuple(allocator_arg_t, _Alloc, _Tp...) -> tuple<_Tp...>;
+template <class _Alloc, class _Tp1, class _Tp2>
+tuple(allocator_arg_t, _Alloc, pair<_Tp1, _Tp2>) -> tuple<_Tp1, _Tp2>;
+template <class _Alloc, class ..._Tp>
+tuple(allocator_arg_t, _Alloc, tuple<_Tp...>) -> tuple<_Tp...>;
+#endif
+
+template <class ..._Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+__enable_if_t<__all<__is_swappable<_Tp>::value...>::value, void>
+swap(tuple<_Tp...>& __t, tuple<_Tp...>& __u)
+                 _NOEXCEPT_(__all<__is_nothrow_swappable<_Tp>::value...>::value)
+    {__t.swap(__u);}
+
+#if _LIBCPP_STD_VER > 20
+template <class... _Tp>
+_LIBCPP_HIDE_FROM_ABI constexpr
+enable_if_t<__all<is_swappable_v<const _Tp>...>::value, void>
+swap(const tuple<_Tp...>& __lhs, const tuple<_Tp...>& __rhs)
+        noexcept(__all<is_nothrow_swappable_v<const _Tp>...>::value) {
+    __lhs.swap(__rhs);
+}
+#endif
+
+// get
+
+template <size_t _Ip, class ..._Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+typename tuple_element<_Ip, tuple<_Tp...> >::type&
+get(tuple<_Tp...>& __t) _NOEXCEPT
+{
+    typedef _LIBCPP_NODEBUG typename tuple_element<_Ip, tuple<_Tp...> >::type type;
+    return static_cast<__tuple_leaf<_Ip, type>&>(__t.__base_).get();
+}
+
+template <size_t _Ip, class ..._Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const typename tuple_element<_Ip, tuple<_Tp...> >::type&
+get(const tuple<_Tp...>& __t) _NOEXCEPT
+{
+    typedef _LIBCPP_NODEBUG typename tuple_element<_Ip, tuple<_Tp...> >::type type;
+    return static_cast<const __tuple_leaf<_Ip, type>&>(__t.__base_).get();
+}
+
+template <size_t _Ip, class ..._Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+typename tuple_element<_Ip, tuple<_Tp...> >::type&&
+get(tuple<_Tp...>&& __t) _NOEXCEPT
+{
+    typedef _LIBCPP_NODEBUG typename tuple_element<_Ip, tuple<_Tp...> >::type type;
+    return static_cast<type&&>(
+             static_cast<__tuple_leaf<_Ip, type>&&>(__t.__base_).get());
+}
+
+template <size_t _Ip, class ..._Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+const typename tuple_element<_Ip, tuple<_Tp...> >::type&&
+get(const tuple<_Tp...>&& __t) _NOEXCEPT
+{
+    typedef _LIBCPP_NODEBUG typename tuple_element<_Ip, tuple<_Tp...> >::type type;
+    return static_cast<const type&&>(
+             static_cast<const __tuple_leaf<_Ip, type>&&>(__t.__base_).get());
+}
+
+#if _LIBCPP_STD_VER > 11
+
+namespace __find_detail {
+
+static constexpr size_t __not_found = static_cast<size_t>(-1);
+static constexpr size_t __ambiguous = __not_found - 1;
+
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr size_t __find_idx_return(size_t __curr_i, size_t __res, bool __matches) {
+    return !__matches ? __res :
+        (__res == __not_found ? __curr_i : __ambiguous);
+}
+
+template <size_t _Nx>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr size_t __find_idx(size_t __i, const bool (&__matches)[_Nx]) {
+  return __i == _Nx ? __not_found :
+      __find_detail::__find_idx_return(__i, __find_detail::__find_idx(__i + 1, __matches), __matches[__i]);
+}
+
+template <class _T1, class ..._Args>
+struct __find_exactly_one_checked {
+    static constexpr bool __matches[sizeof...(_Args)] = {is_same<_T1, _Args>::value...};
+    static constexpr size_t value = __find_detail::__find_idx(0, __matches);
+    static_assert(value != __not_found, "type not found in type list" );
+    static_assert(value != __ambiguous, "type occurs more than once in type list");
+};
+
+template <class _T1>
+struct __find_exactly_one_checked<_T1> {
+    static_assert(!is_same<_T1, _T1>::value, "type not in empty type list");
+};
+
+} // namespace __find_detail
+
+template <typename _T1, typename... _Args>
+struct __find_exactly_one_t
+    : public __find_detail::__find_exactly_one_checked<_T1, _Args...> {
+};
+
+template <class _T1, class... _Args>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _T1& get(tuple<_Args...>& __tup) noexcept
+{
+    return _VSTD::get<__find_exactly_one_t<_T1, _Args...>::value>(__tup);
+}
+
+template <class _T1, class... _Args>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _T1 const& get(tuple<_Args...> const& __tup) noexcept
+{
+    return _VSTD::get<__find_exactly_one_t<_T1, _Args...>::value>(__tup);
+}
+
+template <class _T1, class... _Args>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _T1&& get(tuple<_Args...>&& __tup) noexcept
+{
+    return _VSTD::get<__find_exactly_one_t<_T1, _Args...>::value>(_VSTD::move(__tup));
+}
+
+template <class _T1, class... _Args>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _T1 const&& get(tuple<_Args...> const&& __tup) noexcept
+{
+    return _VSTD::get<__find_exactly_one_t<_T1, _Args...>::value>(_VSTD::move(__tup));
+}
+
+#endif
+
+// tie
+
+template <class ..._Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+tuple<_Tp&...>
+tie(_Tp&... __t) _NOEXCEPT
+{
+    return tuple<_Tp&...>(__t...);
+}
+
+template <class _Up>
+struct __ignore_t
+{
+    template <class _Tp>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    const __ignore_t& operator=(_Tp&&) const {return *this;}
+};
+
+namespace {
+  constexpr __ignore_t<unsigned char> ignore = __ignore_t<unsigned char>();
+} // namespace
+
+template <class... _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+tuple<typename __unwrap_ref_decay<_Tp>::type...>
+make_tuple(_Tp&&... __t)
+{
+    return tuple<typename __unwrap_ref_decay<_Tp>::type...>(_VSTD::forward<_Tp>(__t)...);
+}
+
+template <class... _Tp>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+tuple<_Tp&&...>
+forward_as_tuple(_Tp&&... __t) _NOEXCEPT
+{
+    return tuple<_Tp&&...>(_VSTD::forward<_Tp>(__t)...);
+}
+
+template <size_t _Ip>
+struct __tuple_equal
+{
+    template <class _Tp, class _Up>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(const _Tp& __x, const _Up& __y)
+    {
+        return __tuple_equal<_Ip - 1>()(__x, __y) && _VSTD::get<_Ip-1>(__x) == _VSTD::get<_Ip-1>(__y);
+    }
+};
+
+template <>
+struct __tuple_equal<0>
+{
+    template <class _Tp, class _Up>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(const _Tp&, const _Up&)
+    {
+        return true;
+    }
+};
+
+template <class ..._Tp, class ..._Up>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator==(const tuple<_Tp...>& __x, const tuple<_Up...>& __y)
+{
+    static_assert (sizeof...(_Tp) == sizeof...(_Up), "Can't compare tuples of different sizes");
+    return __tuple_equal<sizeof...(_Tp)>()(__x, __y);
+}
+
+#if _LIBCPP_STD_VER > 17
+
+// operator<=>
+
+template <class ..._Tp, class ..._Up, size_t ..._Is>
+_LIBCPP_HIDE_FROM_ABI constexpr
+auto
+__tuple_compare_three_way(const tuple<_Tp...>& __x, const tuple<_Up...>& __y, index_sequence<_Is...>) {
+    common_comparison_category_t<__synth_three_way_result<_Tp, _Up>...> __result = strong_ordering::equal;
+    static_cast<void>(((__result = _VSTD::__synth_three_way(_VSTD::get<_Is>(__x), _VSTD::get<_Is>(__y)), __result != 0) || ...));
+    return __result;
+}
+
+template <class ..._Tp, class ..._Up>
+requires (sizeof...(_Tp) == sizeof...(_Up))
+_LIBCPP_HIDE_FROM_ABI constexpr
+common_comparison_category_t<__synth_three_way_result<_Tp, _Up>...>
+operator<=>(const tuple<_Tp...>& __x, const tuple<_Up...>& __y)
+{
+    return _VSTD::__tuple_compare_three_way(__x, __y, index_sequence_for<_Tp...>{});
+}
+
+#else // _LIBCPP_STD_VER > 17
+
+template <class ..._Tp, class ..._Up>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator!=(const tuple<_Tp...>& __x, const tuple<_Up...>& __y)
+{
+    return !(__x == __y);
+}
+
+template <size_t _Ip>
+struct __tuple_less
+{
+    template <class _Tp, class _Up>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(const _Tp& __x, const _Up& __y)
+    {
+        const size_t __idx = tuple_size<_Tp>::value - _Ip;
+        if (_VSTD::get<__idx>(__x) < _VSTD::get<__idx>(__y))
+            return true;
+        if (_VSTD::get<__idx>(__y) < _VSTD::get<__idx>(__x))
+            return false;
+        return __tuple_less<_Ip-1>()(__x, __y);
+    }
+};
+
+template <>
+struct __tuple_less<0>
+{
+    template <class _Tp, class _Up>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    bool operator()(const _Tp&, const _Up&)
+    {
+        return false;
+    }
+};
+
+template <class ..._Tp, class ..._Up>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator<(const tuple<_Tp...>& __x, const tuple<_Up...>& __y)
+{
+    static_assert (sizeof...(_Tp) == sizeof...(_Up), "Can't compare tuples of different sizes");
+    return __tuple_less<sizeof...(_Tp)>()(__x, __y);
+}
+
+template <class ..._Tp, class ..._Up>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator>(const tuple<_Tp...>& __x, const tuple<_Up...>& __y)
+{
+    return __y < __x;
+}
+
+template <class ..._Tp, class ..._Up>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator>=(const tuple<_Tp...>& __x, const tuple<_Up...>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class ..._Tp, class ..._Up>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+bool
+operator<=(const tuple<_Tp...>& __x, const tuple<_Up...>& __y)
+{
+    return !(__y < __x);
+}
+
+#endif // _LIBCPP_STD_VER > 17
+
+// tuple_cat
+
+template <class _Tp, class _Up> struct __tuple_cat_type;
+
+template <class ..._Ttypes, class ..._Utypes>
+struct __tuple_cat_type<tuple<_Ttypes...>, __tuple_types<_Utypes...> >
+{
+    typedef _LIBCPP_NODEBUG tuple<_Ttypes..., _Utypes...> type;
+};
+
+template <class _ResultTuple, bool _Is_Tuple0TupleLike, class ..._Tuples>
+struct __tuple_cat_return_1
+{
+};
+
+template <class ..._Types, class _Tuple0>
+struct __tuple_cat_return_1<tuple<_Types...>, true, _Tuple0>
+{
+  using type _LIBCPP_NODEBUG = typename __tuple_cat_type<
+      tuple<_Types...>,
+      typename __make_tuple_types<__remove_cvref_t<_Tuple0> >::type
+    >::type;
+};
+
+template <class ..._Types, class _Tuple0, class _Tuple1, class ..._Tuples>
+struct __tuple_cat_return_1<tuple<_Types...>, true, _Tuple0, _Tuple1, _Tuples...>
+    : public __tuple_cat_return_1<
+                 typename __tuple_cat_type<
+                     tuple<_Types...>,
+                     typename __make_tuple_types<__remove_cvref_t<_Tuple0> >::type
+                 >::type,
+                 __tuple_like_ext<__libcpp_remove_reference_t<_Tuple1> >::value,
+                 _Tuple1, _Tuples...>
+{
+};
+
+template <class ..._Tuples> struct __tuple_cat_return;
+
+template <class _Tuple0, class ..._Tuples>
+struct __tuple_cat_return<_Tuple0, _Tuples...>
+    : public __tuple_cat_return_1<tuple<>,
+         __tuple_like_ext<__libcpp_remove_reference_t<_Tuple0> >::value, _Tuple0,
+                                                                     _Tuples...>
+{
+};
+
+template <>
+struct __tuple_cat_return<>
+{
+    typedef _LIBCPP_NODEBUG tuple<> type;
+};
+
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+tuple<>
+tuple_cat()
+{
+    return tuple<>();
+}
+
+template <class _Rp, class _Indices, class _Tuple0, class ..._Tuples>
+struct __tuple_cat_return_ref_imp;
+
+template <class ..._Types, size_t ..._I0, class _Tuple0>
+struct __tuple_cat_return_ref_imp<tuple<_Types...>, __tuple_indices<_I0...>, _Tuple0>
+{
+    typedef _LIBCPP_NODEBUG __libcpp_remove_reference_t<_Tuple0> _T0;
+    typedef tuple<_Types..., typename __apply_cv<_Tuple0,
+                          typename tuple_element<_I0, _T0>::type>::type&&...> type;
+};
+
+template <class ..._Types, size_t ..._I0, class _Tuple0, class _Tuple1, class ..._Tuples>
+struct __tuple_cat_return_ref_imp<tuple<_Types...>, __tuple_indices<_I0...>,
+                                  _Tuple0, _Tuple1, _Tuples...>
+    : public __tuple_cat_return_ref_imp<
+         tuple<_Types..., typename __apply_cv<_Tuple0,
+               typename tuple_element<_I0,
+                  __libcpp_remove_reference_t<_Tuple0> >::type>::type&&...>,
+         typename __make_tuple_indices<tuple_size<__libcpp_remove_reference_t<_Tuple1> >::value>::type,
+         _Tuple1, _Tuples...>
+{
+};
+
+template <class _Tuple0, class ..._Tuples>
+struct __tuple_cat_return_ref
+    : public __tuple_cat_return_ref_imp<tuple<>,
+               typename __make_tuple_indices<
+                        tuple_size<__libcpp_remove_reference_t<_Tuple0> >::value
+               >::type, _Tuple0, _Tuples...>
+{
+};
+
+template <class _Types, class _I0, class _J0>
+struct __tuple_cat;
+
+template <class ..._Types, size_t ..._I0, size_t ..._J0>
+struct __tuple_cat<tuple<_Types...>, __tuple_indices<_I0...>, __tuple_indices<_J0...> >
+{
+    template <class _Tuple0>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    typename __tuple_cat_return_ref<tuple<_Types...>&&, _Tuple0&&>::type
+    operator()(tuple<_Types...> __t, _Tuple0&& __t0)
+    {
+        (void)__t; // avoid unused parameter warning on GCC when _I0 is empty
+        return _VSTD::forward_as_tuple(
+            _VSTD::forward<_Types>(_VSTD::get<_I0>(__t))...,
+            _VSTD::get<_J0>(_VSTD::forward<_Tuple0>(__t0))...);
+    }
+
+    template <class _Tuple0, class _Tuple1, class ..._Tuples>
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+    typename __tuple_cat_return_ref<tuple<_Types...>&&, _Tuple0&&, _Tuple1&&, _Tuples&&...>::type
+    operator()(tuple<_Types...> __t, _Tuple0&& __t0, _Tuple1&& __t1, _Tuples&& ...__tpls)
+    {
+        (void)__t; // avoid unused parameter warning on GCC when _I0 is empty
+        typedef _LIBCPP_NODEBUG __libcpp_remove_reference_t<_Tuple0> _T0;
+        typedef _LIBCPP_NODEBUG __libcpp_remove_reference_t<_Tuple1> _T1;
+        return __tuple_cat<
+            tuple<_Types...,
+                  typename __apply_cv<_Tuple0, typename tuple_element<
+                                                   _J0, _T0>::type>::type&&...>,
+            typename __make_tuple_indices<sizeof...(_Types) +
+                                          tuple_size<_T0>::value>::type,
+            typename __make_tuple_indices<tuple_size<_T1>::value>::type>()(
+            _VSTD::forward_as_tuple(
+                _VSTD::forward<_Types>(_VSTD::get<_I0>(__t))...,
+                _VSTD::get<_J0>(_VSTD::forward<_Tuple0>(__t0))...),
+            _VSTD::forward<_Tuple1>(__t1), _VSTD::forward<_Tuples>(__tpls)...);
+    }
+};
+
+template <class _Tuple0, class... _Tuples>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX14
+typename __tuple_cat_return<_Tuple0, _Tuples...>::type
+tuple_cat(_Tuple0&& __t0, _Tuples&&... __tpls)
+{
+    typedef _LIBCPP_NODEBUG __libcpp_remove_reference_t<_Tuple0> _T0;
+    return __tuple_cat<tuple<>, __tuple_indices<>,
+                  typename __make_tuple_indices<tuple_size<_T0>::value>::type>()
+                  (tuple<>(), _VSTD::forward<_Tuple0>(__t0),
+                                            _VSTD::forward<_Tuples>(__tpls)...);
+}
+
+template <class ..._Tp, class _Alloc>
+struct _LIBCPP_TEMPLATE_VIS uses_allocator<tuple<_Tp...>, _Alloc>
+    : true_type {};
+
+template <class _T1, class _T2>
+template <class... _Args1, class... _Args2, size_t ..._I1, size_t ..._I2>
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
+pair<_T1, _T2>::pair(piecewise_construct_t,
+                     tuple<_Args1...>& __first_args, tuple<_Args2...>& __second_args,
+                     __tuple_indices<_I1...>, __tuple_indices<_I2...>)
+    :  first(_VSTD::forward<_Args1>(_VSTD::get<_I1>( __first_args))...),
+      second(_VSTD::forward<_Args2>(_VSTD::get<_I2>(__second_args))...)
+{
+}
+
+#if _LIBCPP_STD_VER > 14
+template <class _Tp>
+inline constexpr size_t tuple_size_v = tuple_size<_Tp>::value;
+
+#define _LIBCPP_NOEXCEPT_RETURN(...) noexcept(noexcept(__VA_ARGS__)) { return __VA_ARGS__; }
+
+template <class _Fn, class _Tuple, size_t ..._Id>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr decltype(auto) __apply_tuple_impl(_Fn && __f, _Tuple && __t,
+                                            __tuple_indices<_Id...>)
+_LIBCPP_NOEXCEPT_RETURN(
+    _VSTD::__invoke(
+        _VSTD::forward<_Fn>(__f),
+        _VSTD::get<_Id>(_VSTD::forward<_Tuple>(__t))...)
+)
+
+template <class _Fn, class _Tuple>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr decltype(auto) apply(_Fn && __f, _Tuple && __t)
+_LIBCPP_NOEXCEPT_RETURN(
+    _VSTD::__apply_tuple_impl(
+        _VSTD::forward<_Fn>(__f), _VSTD::forward<_Tuple>(__t),
+        typename __make_tuple_indices<tuple_size_v<remove_reference_t<_Tuple>>>::type{})
+)
+
+template <class _Tp, class _Tuple, size_t... _Idx>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _Tp __make_from_tuple_impl(_Tuple&& __t, __tuple_indices<_Idx...>)
+_LIBCPP_NOEXCEPT_RETURN(
+    _Tp(_VSTD::get<_Idx>(_VSTD::forward<_Tuple>(__t))...)
+)
+
+template <class _Tp, class _Tuple>
+inline _LIBCPP_INLINE_VISIBILITY
+constexpr _Tp make_from_tuple(_Tuple&& __t)
+_LIBCPP_NOEXCEPT_RETURN(
+    _VSTD::__make_from_tuple_impl<_Tp>(_VSTD::forward<_Tuple>(__t),
+        typename __make_tuple_indices<tuple_size_v<remove_reference_t<_Tuple>>>::type{})
+)
+
+#undef _LIBCPP_NOEXCEPT_RETURN
+
+#endif // _LIBCPP_STD_VER > 14
+
+#endif // !defined(_LIBCPP_CXX03_LANG)
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <exception>
+#  include <iosfwd>
+#  include <new>
+#  include <type_traits>
+#  include <typeinfo>
+#  include <utility>
+#endif
+
+#endif // _LIBCPP_TUPLE
diff --git a/app/src/main/cpp/libcxx/include/type_traits b/app/src/main/cpp/libcxx/include/type_traits
new file mode 100644
index 0000000..7646f58
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/type_traits
@@ -0,0 +1,545 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_TYPE_TRAITS
+#define _LIBCPP_TYPE_TRAITS
+
+/*
+    type_traits synopsis
+
+namespace std
+{
+
+    // helper class:
+    template <class T, T v> struct integral_constant;
+    typedef integral_constant<bool, true>  true_type;   // C++11
+    typedef integral_constant<bool, false> false_type;  // C++11
+
+    template <bool B>                                   // C++14
+    using bool_constant = integral_constant<bool, B>;   // C++14
+    typedef bool_constant<true> true_type;              // C++14
+    typedef bool_constant<false> false_type;            // C++14
+
+    // helper traits
+    template <bool, class T = void> struct enable_if;
+    template <bool, class T, class F> struct conditional;
+
+    // Primary classification traits:
+    template <class T> struct is_void;
+    template <class T> struct is_null_pointer;  // C++14
+    template <class T> struct is_integral;
+    template <class T> struct is_floating_point;
+    template <class T> struct is_array;
+    template <class T> struct is_pointer;
+    template <class T> struct is_lvalue_reference;
+    template <class T> struct is_rvalue_reference;
+    template <class T> struct is_member_object_pointer;
+    template <class T> struct is_member_function_pointer;
+    template <class T> struct is_enum;
+    template <class T> struct is_union;
+    template <class T> struct is_class;
+    template <class T> struct is_function;
+
+    // Secondary classification traits:
+    template <class T> struct is_reference;
+    template <class T> struct is_arithmetic;
+    template <class T> struct is_fundamental;
+    template <class T> struct is_member_pointer;
+    template <class T> struct is_scoped_enum; // C++2b
+    template <class T> struct is_scalar;
+    template <class T> struct is_object;
+    template <class T> struct is_compound;
+
+    // Const-volatile properties and transformations:
+    template <class T> struct is_const;
+    template <class T> struct is_volatile;
+    template <class T> struct remove_const;
+    template <class T> struct remove_volatile;
+    template <class T> struct remove_cv;
+    template <class T> struct add_const;
+    template <class T> struct add_volatile;
+    template <class T> struct add_cv;
+
+    // Reference transformations:
+    template <class T> struct remove_reference;
+    template <class T> struct add_lvalue_reference;
+    template <class T> struct add_rvalue_reference;
+
+    // Pointer transformations:
+    template <class T> struct remove_pointer;
+    template <class T> struct add_pointer;
+
+    template<class T> struct type_identity;                     // C++20
+    template<class T>
+      using type_identity_t = typename type_identity<T>::type;  // C++20
+
+    // Integral properties:
+    template <class T> struct is_signed;
+    template <class T> struct is_unsigned;
+    template <class T> struct make_signed;
+    template <class T> struct make_unsigned;
+
+    // Array properties and transformations:
+    template <class T> struct rank;
+    template <class T, unsigned I = 0> struct extent;
+    template <class T> struct remove_extent;
+    template <class T> struct remove_all_extents;
+
+    template <class T> struct is_bounded_array;                 // C++20
+    template <class T> struct is_unbounded_array;               // C++20
+
+    // Member introspection:
+    template <class T> struct is_pod;
+    template <class T> struct is_trivial;
+    template <class T> struct is_trivially_copyable;
+    template <class T> struct is_standard_layout;
+    template <class T> struct is_literal_type; // Deprecated in C++17; removed in C++20
+    template <class T> struct is_empty;
+    template <class T> struct is_polymorphic;
+    template <class T> struct is_abstract;
+    template <class T> struct is_final; // C++14
+    template <class T> struct is_aggregate; // C++17
+
+    template <class T, class... Args> struct is_constructible;
+    template <class T>                struct is_default_constructible;
+    template <class T>                struct is_copy_constructible;
+    template <class T>                struct is_move_constructible;
+    template <class T, class U>       struct is_assignable;
+    template <class T>                struct is_copy_assignable;
+    template <class T>                struct is_move_assignable;
+    template <class T, class U>       struct is_swappable_with;       // C++17
+    template <class T>                struct is_swappable;            // C++17
+    template <class T>                struct is_destructible;
+
+    template <class T, class... Args> struct is_trivially_constructible;
+    template <class T>                struct is_trivially_default_constructible;
+    template <class T>                struct is_trivially_copy_constructible;
+    template <class T>                struct is_trivially_move_constructible;
+    template <class T, class U>       struct is_trivially_assignable;
+    template <class T>                struct is_trivially_copy_assignable;
+    template <class T>                struct is_trivially_move_assignable;
+    template <class T>                struct is_trivially_destructible;
+
+    template <class T, class... Args> struct is_nothrow_constructible;
+    template <class T>                struct is_nothrow_default_constructible;
+    template <class T>                struct is_nothrow_copy_constructible;
+    template <class T>                struct is_nothrow_move_constructible;
+    template <class T, class U>       struct is_nothrow_assignable;
+    template <class T>                struct is_nothrow_copy_assignable;
+    template <class T>                struct is_nothrow_move_assignable;
+    template <class T, class U>       struct is_nothrow_swappable_with; // C++17
+    template <class T>                struct is_nothrow_swappable;      // C++17
+    template <class T>                struct is_nothrow_destructible;
+
+    template <class T> struct has_virtual_destructor;
+
+    template<class T> struct has_unique_object_representations;         // C++17
+
+    // Relationships between types:
+    template <class T, class U> struct is_same;
+    template <class Base, class Derived> struct is_base_of;
+
+    template <class From, class To> struct is_convertible;
+    template <typename From, typename To> struct is_nothrow_convertible;                  // C++20
+    template <typename From, typename To> inline constexpr bool is_nothrow_convertible_v; // C++20
+
+    template <class Fn, class... ArgTypes> struct is_invocable;
+    template <class R, class Fn, class... ArgTypes> struct is_invocable_r;
+
+    template <class Fn, class... ArgTypes> struct is_nothrow_invocable;
+    template <class R, class Fn, class... ArgTypes> struct is_nothrow_invocable_r;
+
+    // Alignment properties and transformations:
+    template <class T> struct alignment_of;
+    template <size_t Len, size_t Align = most_stringent_alignment_requirement>
+        struct aligned_storage;                                 // deprecated in C++23
+    template <size_t Len, class... Types> struct aligned_union; // deprecated in C++23
+    template <class T> struct remove_cvref; // C++20
+
+    template <class T> struct decay;
+    template <class... T> struct common_type;
+    template <class T> struct underlying_type;
+    template <class> class result_of; // undefined; deprecated in C++17; removed in C++20
+    template <class Fn, class... ArgTypes> class result_of<Fn(ArgTypes...)>; // deprecated in C++17; removed in C++20
+    template <class Fn, class... ArgTypes> struct invoke_result;  // C++17
+
+    // const-volatile modifications:
+    template <class T>
+      using remove_const_t    = typename remove_const<T>::type;  // C++14
+    template <class T>
+      using remove_volatile_t = typename remove_volatile<T>::type;  // C++14
+    template <class T>
+      using remove_cv_t       = typename remove_cv<T>::type;  // C++14
+    template <class T>
+      using add_const_t       = typename add_const<T>::type;  // C++14
+    template <class T>
+      using add_volatile_t    = typename add_volatile<T>::type;  // C++14
+    template <class T>
+      using add_cv_t          = typename add_cv<T>::type;  // C++14
+
+    // reference modifications:
+    template <class T>
+      using remove_reference_t     = typename remove_reference<T>::type;  // C++14
+    template <class T>
+      using add_lvalue_reference_t = typename add_lvalue_reference<T>::type;  // C++14
+    template <class T>
+      using add_rvalue_reference_t = typename add_rvalue_reference<T>::type;  // C++14
+
+    // sign modifications:
+    template <class T>
+      using make_signed_t   = typename make_signed<T>::type;  // C++14
+    template <class T>
+      using make_unsigned_t = typename make_unsigned<T>::type;  // C++14
+
+    // array modifications:
+    template <class T>
+      using remove_extent_t      = typename remove_extent<T>::type;  // C++14
+    template <class T>
+      using remove_all_extents_t = typename remove_all_extents<T>::type;  // C++14
+
+    template <class T>
+      inline constexpr bool is_bounded_array_v
+        = is_bounded_array<T>::value;                                     // C++20
+      inline constexpr bool is_unbounded_array_v
+        = is_unbounded_array<T>::value;                                   // C++20
+
+    // pointer modifications:
+    template <class T>
+      using remove_pointer_t = typename remove_pointer<T>::type;  // C++14
+    template <class T>
+      using add_pointer_t    = typename add_pointer<T>::type;  // C++14
+
+    // other transformations:
+    template <size_t Len, size_t Align=default-alignment>
+      using aligned_storage_t = typename aligned_storage<Len,Align>::type;  // C++14
+    template <size_t Len, class... Types>
+      using aligned_union_t   = typename aligned_union<Len,Types...>::type;  // C++14
+    template <class T>
+      using remove_cvref_t    = typename remove_cvref<T>::type;  // C++20
+    template <class T>
+      using decay_t           = typename decay<T>::type;  // C++14
+    template <bool b, class T=void>
+      using enable_if_t       = typename enable_if<b,T>::type;  // C++14
+    template <bool b, class T, class F>
+      using conditional_t     = typename conditional<b,T,F>::type;  // C++14
+    template <class... T>
+      using common_type_t     = typename common_type<T...>::type;  // C++14
+    template <class T>
+      using underlying_type_t = typename underlying_type<T>::type;  // C++14
+    template <class T>
+      using result_of_t       = typename result_of<T>::type;  // C++14; deprecated in C++17; removed in C++20
+    template <class Fn, class... ArgTypes>
+      using invoke_result_t   = typename invoke_result<Fn, ArgTypes...>::type;  // C++17
+
+    template <class...>
+      using void_t = void;   // C++17
+
+      // See C++14 20.10.4.1, primary type categories
+      template <class T> inline constexpr bool is_void_v
+        = is_void<T>::value;                                             // C++17
+      template <class T> inline constexpr bool is_null_pointer_v
+        = is_null_pointer<T>::value;                                     // C++17
+      template <class T> inline constexpr bool is_integral_v
+        = is_integral<T>::value;                                         // C++17
+      template <class T> inline constexpr bool is_floating_point_v
+        = is_floating_point<T>::value;                                   // C++17
+      template <class T> inline constexpr bool is_array_v
+        = is_array<T>::value;                                            // C++17
+      template <class T> inline constexpr bool is_pointer_v
+        = is_pointer<T>::value;                                          // C++17
+      template <class T> inline constexpr bool is_lvalue_reference_v
+        = is_lvalue_reference<T>::value;                                 // C++17
+      template <class T> inline constexpr bool is_rvalue_reference_v
+        = is_rvalue_reference<T>::value;                                 // C++17
+      template <class T> inline constexpr bool is_member_object_pointer_v
+        = is_member_object_pointer<T>::value;                            // C++17
+      template <class T> inline constexpr bool is_member_function_pointer_v
+        = is_member_function_pointer<T>::value;                          // C++17
+      template <class T> inline constexpr bool is_enum_v
+        = is_enum<T>::value;                                             // C++17
+      template <class T> inline constexpr bool is_union_v
+        = is_union<T>::value;                                            // C++17
+      template <class T> inline constexpr bool is_class_v
+        = is_class<T>::value;                                            // C++17
+      template <class T> inline constexpr bool is_function_v
+        = is_function<T>::value;                                         // C++17
+
+      // See C++14 20.10.4.2, composite type categories
+      template <class T> inline constexpr bool is_reference_v
+        = is_reference<T>::value;                                        // C++17
+      template <class T> inline constexpr bool is_arithmetic_v
+        = is_arithmetic<T>::value;                                       // C++17
+      template <class T> inline constexpr bool is_fundamental_v
+        = is_fundamental<T>::value;                                      // C++17
+      template <class T> inline constexpr bool is_object_v
+        = is_object<T>::value;                                           // C++17
+      template <class T> inline constexpr bool is_scalar_v
+        = is_scalar<T>::value;                                           // C++17
+      template <class T> inline constexpr bool is_compound_v
+        = is_compound<T>::value;                                         // C++17
+      template <class T> inline constexpr bool is_member_pointer_v
+        = is_member_pointer<T>::value;                                   // C++17
+      template <class T> inline constexpr bool is_scoped_enum_v
+        = is_scoped_enum<T>::value;                                      // C++2b
+
+      // See C++14 20.10.4.3, type properties
+      template <class T> inline constexpr bool is_const_v
+        = is_const<T>::value;                                            // C++17
+      template <class T> inline constexpr bool is_volatile_v
+        = is_volatile<T>::value;                                         // C++17
+      template <class T> inline constexpr bool is_trivial_v
+        = is_trivial<T>::value;                                          // C++17
+      template <class T> inline constexpr bool is_trivially_copyable_v
+        = is_trivially_copyable<T>::value;                               // C++17
+      template <class T> inline constexpr bool is_standard_layout_v
+        = is_standard_layout<T>::value;                                  // C++17
+      template <class T> inline constexpr bool is_pod_v
+        = is_pod<T>::value;                                              // C++17
+      template <class T> inline constexpr bool is_literal_type_v
+        = is_literal_type<T>::value;                                     // C++17; deprecated in C++17; removed in C++20
+      template <class T> inline constexpr bool is_empty_v
+        = is_empty<T>::value;                                            // C++17
+      template <class T> inline constexpr bool is_polymorphic_v
+        = is_polymorphic<T>::value;                                      // C++17
+      template <class T> inline constexpr bool is_abstract_v
+        = is_abstract<T>::value;                                         // C++17
+      template <class T> inline constexpr bool is_final_v
+        = is_final<T>::value;                                            // C++17
+      template <class T> inline constexpr bool is_aggregate_v
+        = is_aggregate<T>::value;                                        // C++17
+      template <class T> inline constexpr bool is_signed_v
+        = is_signed<T>::value;                                           // C++17
+      template <class T> inline constexpr bool is_unsigned_v
+        = is_unsigned<T>::value;                                         // C++17
+      template <class T, class... Args> inline constexpr bool is_constructible_v
+        = is_constructible<T, Args...>::value;                           // C++17
+      template <class T> inline constexpr bool is_default_constructible_v
+        = is_default_constructible<T>::value;                            // C++17
+      template <class T> inline constexpr bool is_copy_constructible_v
+        = is_copy_constructible<T>::value;                               // C++17
+      template <class T> inline constexpr bool is_move_constructible_v
+        = is_move_constructible<T>::value;                               // C++17
+      template <class T, class U> inline constexpr bool is_assignable_v
+        = is_assignable<T, U>::value;                                    // C++17
+      template <class T> inline constexpr bool is_copy_assignable_v
+        = is_copy_assignable<T>::value;                                  // C++17
+      template <class T> inline constexpr bool is_move_assignable_v
+        = is_move_assignable<T>::value;                                  // C++17
+      template <class T, class U> inline constexpr bool is_swappable_with_v
+        = is_swappable_with<T, U>::value;                                // C++17
+      template <class T> inline constexpr bool is_swappable_v
+        = is_swappable<T>::value;                                        // C++17
+      template <class T> inline constexpr bool is_destructible_v
+        = is_destructible<T>::value;                                     // C++17
+      template <class T, class... Args> inline constexpr bool is_trivially_constructible_v
+        = is_trivially_constructible<T, Args...>::value;                 // C++17
+      template <class T> inline constexpr bool is_trivially_default_constructible_v
+        = is_trivially_default_constructible<T>::value;                  // C++17
+      template <class T> inline constexpr bool is_trivially_copy_constructible_v
+        = is_trivially_copy_constructible<T>::value;                     // C++17
+      template <class T> inline constexpr bool is_trivially_move_constructible_v
+        = is_trivially_move_constructible<T>::value;                     // C++17
+      template <class T, class U> inline constexpr bool is_trivially_assignable_v
+        = is_trivially_assignable<T, U>::value;                          // C++17
+      template <class T> inline constexpr bool is_trivially_copy_assignable_v
+        = is_trivially_copy_assignable<T>::value;                        // C++17
+      template <class T> inline constexpr bool is_trivially_move_assignable_v
+        = is_trivially_move_assignable<T>::value;                        // C++17
+      template <class T> inline constexpr bool is_trivially_destructible_v
+        = is_trivially_destructible<T>::value;                           // C++17
+      template <class T, class... Args> inline constexpr bool is_nothrow_constructible_v
+        = is_nothrow_constructible<T, Args...>::value;                   // C++17
+      template <class T> inline constexpr bool is_nothrow_default_constructible_v
+        = is_nothrow_default_constructible<T>::value;                    // C++17
+      template <class T> inline constexpr bool is_nothrow_copy_constructible_v
+        = is_nothrow_copy_constructible<T>::value;                       // C++17
+      template <class T> inline constexpr bool is_nothrow_move_constructible_v
+        = is_nothrow_move_constructible<T>::value;                       // C++17
+      template <class T, class U> inline constexpr bool is_nothrow_assignable_v
+        = is_nothrow_assignable<T, U>::value;                            // C++17
+      template <class T> inline constexpr bool is_nothrow_copy_assignable_v
+        = is_nothrow_copy_assignable<T>::value;                          // C++17
+      template <class T> inline constexpr bool is_nothrow_move_assignable_v
+        = is_nothrow_move_assignable<T>::value;                          // C++17
+      template <class T, class U> inline constexpr bool is_nothrow_swappable_with_v
+        = is_nothrow_swappable_with<T, U>::value;                       // C++17
+      template <class T> inline constexpr bool is_nothrow_swappable_v
+        = is_nothrow_swappable<T>::value;                               // C++17
+      template <class T> inline constexpr bool is_nothrow_destructible_v
+        = is_nothrow_destructible<T>::value;                             // C++17
+      template <class T> inline constexpr bool has_virtual_destructor_v
+        = has_virtual_destructor<T>::value;                              // C++17
+      template<class T> inline constexpr bool has_unique_object_representations_v // C++17
+        = has_unique_object_representations<T>::value;
+
+      // See C++14 20.10.5, type property queries
+      template <class T> inline constexpr size_t alignment_of_v
+        = alignment_of<T>::value;                                        // C++17
+      template <class T> inline constexpr size_t rank_v
+        = rank<T>::value;                                                // C++17
+      template <class T, unsigned I = 0> inline constexpr size_t extent_v
+        = extent<T, I>::value;                                           // C++17
+
+      // See C++14 20.10.6, type relations
+      template <class T, class U> inline constexpr bool is_same_v
+        = is_same<T, U>::value;                                          // C++17
+      template <class Base, class Derived> inline constexpr bool is_base_of_v
+        = is_base_of<Base, Derived>::value;                              // C++17
+      template <class From, class To> inline constexpr bool is_convertible_v
+        = is_convertible<From, To>::value;                               // C++17
+      template <class Fn, class... ArgTypes> inline constexpr bool is_invocable_v
+        = is_invocable<Fn, ArgTypes...>::value;                          // C++17
+      template <class R, class Fn, class... ArgTypes> inline constexpr bool is_invocable_r_v
+        = is_invocable_r<R, Fn, ArgTypes...>::value;                     // C++17
+      template <class Fn, class... ArgTypes> inline constexpr bool is_nothrow_invocable_v
+        = is_nothrow_invocable<Fn, ArgTypes...>::value;                  // C++17
+      template <class R, class Fn, class... ArgTypes> inline constexpr bool is_nothrow_invocable_r_v
+        = is_nothrow_invocable_r<R, Fn, ArgTypes...>::value;             // C++17
+
+      // [meta.logical], logical operator traits:
+      template<class... B> struct conjunction;                           // C++17
+      template<class... B>
+        inline constexpr bool conjunction_v = conjunction<B...>::value;  // C++17
+      template<class... B> struct disjunction;                           // C++17
+      template<class... B>
+        inline constexpr bool disjunction_v = disjunction<B...>::value;  // C++17
+      template<class B> struct negation;                                 // C++17
+      template<class B>
+        inline constexpr bool negation_v = negation<B>::value;           // C++17
+
+}
+
+*/
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__functional/invoke.h>
+#include <__fwd/hash.h> // This is https://llvm.org/PR56938
+#include <__type_traits/add_const.h>
+#include <__type_traits/add_cv.h>
+#include <__type_traits/add_lvalue_reference.h>
+#include <__type_traits/add_pointer.h>
+#include <__type_traits/add_rvalue_reference.h>
+#include <__type_traits/add_volatile.h>
+#include <__type_traits/aligned_storage.h>
+#include <__type_traits/aligned_union.h>
+#include <__type_traits/alignment_of.h>
+#include <__type_traits/apply_cv.h>
+#include <__type_traits/can_extract_key.h>
+#include <__type_traits/common_reference.h>
+#include <__type_traits/common_type.h>
+#include <__type_traits/conditional.h>
+#include <__type_traits/conjunction.h>
+#include <__type_traits/decay.h>
+#include <__type_traits/dependent_type.h>
+#include <__type_traits/disjunction.h>
+#include <__type_traits/enable_if.h>
+#include <__type_traits/extent.h>
+#include <__type_traits/has_unique_object_representation.h>
+#include <__type_traits/has_virtual_destructor.h>
+#include <__type_traits/integral_constant.h>
+#include <__type_traits/is_abstract.h>
+#include <__type_traits/is_aggregate.h>
+#include <__type_traits/is_arithmetic.h>
+#include <__type_traits/is_array.h>
+#include <__type_traits/is_assignable.h>
+#include <__type_traits/is_base_of.h>
+#include <__type_traits/is_bounded_array.h>
+#include <__type_traits/is_callable.h>
+#include <__type_traits/is_char_like_type.h>
+#include <__type_traits/is_class.h>
+#include <__type_traits/is_compound.h>
+#include <__type_traits/is_const.h>
+#include <__type_traits/is_constant_evaluated.h>
+#include <__type_traits/is_constructible.h>
+#include <__type_traits/is_convertible.h>
+#include <__type_traits/is_copy_assignable.h>
+#include <__type_traits/is_copy_constructible.h>
+#include <__type_traits/is_default_constructible.h>
+#include <__type_traits/is_destructible.h>
+#include <__type_traits/is_empty.h>
+#include <__type_traits/is_enum.h>
+#include <__type_traits/is_final.h>
+#include <__type_traits/is_floating_point.h>
+#include <__type_traits/is_function.h>
+#include <__type_traits/is_fundamental.h>
+#include <__type_traits/is_implicitly_default_constructible.h>
+#include <__type_traits/is_integral.h>
+#include <__type_traits/is_literal_type.h>
+#include <__type_traits/is_member_function_pointer.h>
+#include <__type_traits/is_member_object_pointer.h>
+#include <__type_traits/is_member_pointer.h>
+#include <__type_traits/is_move_assignable.h>
+#include <__type_traits/is_move_constructible.h>
+#include <__type_traits/is_nothrow_assignable.h>
+#include <__type_traits/is_nothrow_constructible.h>
+#include <__type_traits/is_nothrow_convertible.h>
+#include <__type_traits/is_nothrow_copy_assignable.h>
+#include <__type_traits/is_nothrow_copy_constructible.h>
+#include <__type_traits/is_nothrow_default_constructible.h>
+#include <__type_traits/is_nothrow_destructible.h>
+#include <__type_traits/is_nothrow_move_assignable.h>
+#include <__type_traits/is_nothrow_move_constructible.h>
+#include <__type_traits/is_null_pointer.h>
+#include <__type_traits/is_object.h>
+#include <__type_traits/is_pod.h>
+#include <__type_traits/is_pointer.h>
+#include <__type_traits/is_polymorphic.h>
+#include <__type_traits/is_reference.h>
+#include <__type_traits/is_reference_wrapper.h>
+#include <__type_traits/is_referenceable.h>
+#include <__type_traits/is_same.h>
+#include <__type_traits/is_scalar.h>
+#include <__type_traits/is_scoped_enum.h>
+#include <__type_traits/is_signed.h>
+#include <__type_traits/is_specialization.h>
+#include <__type_traits/is_standard_layout.h>
+#include <__type_traits/is_swappable.h>
+#include <__type_traits/is_trivial.h>
+#include <__type_traits/is_trivially_assignable.h>
+#include <__type_traits/is_trivially_constructible.h>
+#include <__type_traits/is_trivially_copy_assignable.h>
+#include <__type_traits/is_trivially_copy_constructible.h>
+#include <__type_traits/is_trivially_copyable.h>
+#include <__type_traits/is_trivially_default_constructible.h>
+#include <__type_traits/is_trivially_destructible.h>
+#include <__type_traits/is_trivially_move_assignable.h>
+#include <__type_traits/is_trivially_move_constructible.h>
+#include <__type_traits/is_unbounded_array.h>
+#include <__type_traits/is_union.h>
+#include <__type_traits/is_unsigned.h>
+#include <__type_traits/is_void.h>
+#include <__type_traits/is_volatile.h>
+#include <__type_traits/make_const_lvalue_ref.h>
+#include <__type_traits/make_signed.h>
+#include <__type_traits/make_unsigned.h>
+#include <__type_traits/maybe_const.h>
+#include <__type_traits/negation.h>
+#include <__type_traits/rank.h>
+#include <__type_traits/remove_all_extents.h>
+#include <__type_traits/remove_const.h>
+#include <__type_traits/remove_const_ref.h>
+#include <__type_traits/remove_cv.h>
+#include <__type_traits/remove_extent.h>
+#include <__type_traits/remove_pointer.h>
+#include <__type_traits/remove_reference.h>
+#include <__type_traits/remove_volatile.h>
+#include <__type_traits/result_of.h>
+#include <__type_traits/type_identity.h>
+#include <__type_traits/underlying_type.h>
+#include <__type_traits/void_t.h>
+#include <__utility/declval.h>
+#include <cstddef>
+#include <cstdint>
+#include <version>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#endif // _LIBCPP_TYPE_TRAITS
diff --git a/app/src/main/cpp/libcxx/include/typeindex b/app/src/main/cpp/libcxx/include/typeindex
new file mode 100644
index 0000000..e3132c8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/typeindex
@@ -0,0 +1,126 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_TYPEINDEX
+#define _LIBCPP_TYPEINDEX
+
+/*
+
+    typeindex synopsis
+
+namespace std
+{
+
+class type_index
+{
+public:
+    type_index(const type_info& rhs) noexcept;
+
+    bool operator==(const type_index& rhs) const noexcept;
+    bool operator!=(const type_index& rhs) const noexcept; // removed in C++20
+    bool operator< (const type_index& rhs) const noexcept;
+    bool operator<=(const type_index& rhs) const noexcept;
+    bool operator> (const type_index& rhs) const noexcept;
+    bool operator>=(const type_index& rhs) const noexcept;
+    strong_ordering operator<=>(const type_index& rhs) const noexcept; // C++20
+
+    size_t hash_code() const noexcept;
+    const char* name() const noexcept;
+};
+
+template <>
+struct hash<type_index>
+    : public unary_function<type_index, size_t>
+{
+    size_t operator()(type_index index) const noexcept;
+};
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__functional/unary_function.h>
+#include <typeinfo>
+#include <version>
+
+// standard-mandated includes
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+class _LIBCPP_TEMPLATE_VIS type_index
+{
+    const type_info* __t_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    type_index(const type_info& __y) _NOEXCEPT : __t_(&__y) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const type_index& __y) const _NOEXCEPT
+        {return *__t_ == *__y.__t_;}
+    _LIBCPP_INLINE_VISIBILITY
+#if _LIBCPP_STD_VER <= 17
+    bool operator!=(const type_index& __y) const _NOEXCEPT
+        {return *__t_ != *__y.__t_;}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator< (const type_index& __y) const _NOEXCEPT
+        {return  __t_->before(*__y.__t_);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator<=(const type_index& __y) const _NOEXCEPT
+        {return !__y.__t_->before(*__t_);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator> (const type_index& __y) const _NOEXCEPT
+        {return  __y.__t_->before(*__t_);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator>=(const type_index& __y) const _NOEXCEPT
+        {return !__t_->before(*__y.__t_);}
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_HIDE_FROM_ABI
+    strong_ordering operator<=>(const type_index& __y) const noexcept {
+      if (*__t_ == *__y.__t_)
+        return strong_ordering::equal;
+      if (__t_->before(*__y.__t_))
+        return strong_ordering::less;
+      return strong_ordering::greater;
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t hash_code() const _NOEXCEPT {return __t_->hash_code();}
+    _LIBCPP_INLINE_VISIBILITY
+    const char* name() const _NOEXCEPT {return __t_->name();}
+};
+
+template <class _Tp> struct _LIBCPP_TEMPLATE_VIS hash;
+
+template <>
+struct _LIBCPP_TEMPLATE_VIS hash<type_index>
+    : public __unary_function<type_index, size_t>
+{
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(type_index __index) const _NOEXCEPT
+        {return __index.hash_code();}
+};
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <iosfwd>
+#  include <new>
+#  include <utility>
+#endif
+
+#endif // _LIBCPP_TYPEINDEX
diff --git a/app/src/main/cpp/libcxx/include/typeinfo b/app/src/main/cpp/libcxx/include/typeinfo
new file mode 100644
index 0000000..4431039
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/typeinfo
@@ -0,0 +1,406 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef __LIBCPP_TYPEINFO
+#define __LIBCPP_TYPEINFO
+
+/*
+
+    typeinfo synopsis
+
+namespace std {
+
+class type_info
+{
+public:
+    virtual ~type_info();
+
+    bool operator==(const type_info& rhs) const noexcept;
+    bool operator!=(const type_info& rhs) const noexcept; // removed in C++20
+
+    bool before(const type_info& rhs) const noexcept;
+    size_t hash_code() const noexcept;
+    const char* name() const noexcept;
+
+    type_info(const type_info& rhs) = delete;
+    type_info& operator=(const type_info& rhs) = delete;
+};
+
+class bad_cast
+    : public exception
+{
+public:
+    bad_cast() noexcept;
+    bad_cast(const bad_cast&) noexcept;
+    bad_cast& operator=(const bad_cast&) noexcept;
+    virtual const char* what() const noexcept;
+};
+
+class bad_typeid
+    : public exception
+{
+public:
+    bad_typeid() noexcept;
+    bad_typeid(const bad_typeid&) noexcept;
+    bad_typeid& operator=(const bad_typeid&) noexcept;
+    virtual const char* what() const noexcept;
+};
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__config>
+#include <cstddef>
+#include <cstdint>
+#include <cstdlib>
+#include <exception>
+#include <type_traits>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if defined(_LIBCPP_ABI_VCRUNTIME)
+#include <vcruntime_typeinfo.h>
+#else
+
+namespace std  // purposefully not using versioning namespace
+{
+
+
+#if defined(_LIBCPP_ABI_MICROSOFT)
+
+class _LIBCPP_EXCEPTION_ABI type_info
+{
+    type_info& operator=(const type_info&);
+    type_info(const type_info&);
+
+    mutable struct {
+      const char *__undecorated_name;
+      const char __decorated_name[1];
+    } __data;
+
+    int __compare(const type_info &__rhs) const _NOEXCEPT;
+
+public:
+    _LIBCPP_AVAILABILITY_TYPEINFO_VTABLE
+    virtual ~type_info();
+
+    const char *name() const _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool before(const type_info& __arg) const _NOEXCEPT {
+      return __compare(__arg) < 0;
+    }
+
+    size_t hash_code() const _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const type_info& __arg) const _NOEXCEPT {
+      return __compare(__arg) == 0;
+    }
+
+#if _LIBCPP_STD_VER <= 17
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const type_info& __arg) const _NOEXCEPT
+    { return !operator==(__arg); }
+#endif
+};
+
+#else // !defined(_LIBCPP_ABI_MICROSOFT)
+
+// ========================================================================== //
+//                           Implementations
+// ========================================================================== //
+// ------------------------------------------------------------------------- //
+//                               Unique
+//               (_LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION = 1)
+// ------------------------------------------------------------------------- //
+// This implementation of type_info assumes a unique copy of the RTTI for a
+// given type inside a program. This is a valid assumption when abiding to the
+// Itanium ABI (http://itanium-cxx-abi.github.io/cxx-abi/abi.html#vtable-components).
+// Under this assumption, we can always compare the addresses of the type names
+// to implement equality-comparison of type_infos instead of having to perform
+// a deep string comparison.
+// -------------------------------------------------------------------------- //
+//                             NonUnique
+//               (_LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION = 2)
+// -------------------------------------------------------------------------- //
+// This implementation of type_info does not assume there is always a unique
+// copy of the RTTI for a given type inside a program. For various reasons
+// the linker may have failed to merge every copy of a types RTTI
+// (For example: -Bsymbolic or llvm.org/PR37398). Under this assumption, two
+// type_infos are equal if their addresses are equal or if a deep string
+// comparison is equal.
+// -------------------------------------------------------------------------- //
+//                          NonUniqueARMRTTIBit
+//               (_LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION = 3)
+// -------------------------------------------------------------------------- //
+// This implementation is specific to ARM64 on Apple platforms.
+//
+// This implementation of type_info does not assume always a unique copy of
+// the RTTI for a given type inside a program. When constructing the type_info,
+// the compiler packs the pointer to the type name into a uintptr_t and reserves
+// the high bit of that pointer, which is assumed to be free for use under that
+// ABI. If that high bit is set, that specific copy of the RTTI can't be assumed
+// to be unique within the program. If the high bit is unset, then the RTTI can
+// be assumed to be unique within the program.
+//
+// When comparing type_infos, if both RTTIs can be assumed to be unique, it
+// suffices to compare their addresses. If both the RTTIs can't be assumed to
+// be unique, we must perform a deep string comparison of the type names.
+// However, if one of the RTTIs is guaranteed unique and the other one isn't,
+// then both RTTIs are necessarily not to be considered equal.
+//
+// The intent of this design is to remove the need for weak symbols. Specifically,
+// if a type would normally have a default-visibility RTTI emitted as a weak
+// symbol, it is given hidden visibility instead and the non-unique bit is set.
+// Otherwise, types declared with hidden visibility are always considered to have
+// a unique RTTI: the RTTI is emitted with linkonce_odr linkage and is assumed
+// to be deduplicated by the linker within the linked image. Across linked image
+// boundaries, such types are thus considered different types.
+
+// This value can be overriden in the __config_site. When it's not overriden,
+// we pick a default implementation based on the platform here.
+#ifndef _LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION
+
+  // Windows and AIX binaries can't merge typeinfos, so use the NonUnique implementation.
+# if defined(_LIBCPP_OBJECT_FORMAT_COFF) || defined(_LIBCPP_OBJECT_FORMAT_XCOFF)
+#   define _LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION 2
+
+  // On arm64 on Apple platforms, use the special NonUniqueARMRTTIBit implementation.
+# elif defined(__APPLE__) && defined(__LP64__) && !defined(__x86_64__)
+#   define _LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION 3
+
+  // On all other platforms, assume the Itanium C++ ABI and use the Unique implementation.
+# else
+#   define _LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION 1
+# endif
+#endif
+
+struct __type_info_implementations {
+  struct __string_impl_base {
+    typedef const char* __type_name_t;
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    _LIBCPP_CONSTEXPR static const char* __type_name_to_string(__type_name_t __v) _NOEXCEPT {
+      return __v;
+    }
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    _LIBCPP_CONSTEXPR static __type_name_t __string_to_type_name(const char* __v) _NOEXCEPT {
+      return __v;
+    }
+  };
+
+  struct __unique_impl : __string_impl_base {
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    static size_t __hash(__type_name_t __v) _NOEXCEPT {
+      return reinterpret_cast<size_t>(__v);
+    }
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    static bool __eq(__type_name_t __lhs, __type_name_t __rhs) _NOEXCEPT {
+      return __lhs == __rhs;
+    }
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    static bool __lt(__type_name_t __lhs, __type_name_t __rhs) _NOEXCEPT {
+      return __lhs < __rhs;
+    }
+  };
+
+  struct __non_unique_impl : __string_impl_base {
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    static size_t __hash(__type_name_t __ptr) _NOEXCEPT {
+      size_t __hash = 5381;
+      while (unsigned char __c = static_cast<unsigned char>(*__ptr++))
+        __hash = (__hash * 33) ^ __c;
+      return __hash;
+    }
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    static bool __eq(__type_name_t __lhs, __type_name_t __rhs) _NOEXCEPT {
+      return __lhs == __rhs || __builtin_strcmp(__lhs, __rhs) == 0;
+    }
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    static bool __lt(__type_name_t __lhs, __type_name_t __rhs) _NOEXCEPT {
+      return __builtin_strcmp(__lhs, __rhs) < 0;
+    }
+  };
+
+  struct __non_unique_arm_rtti_bit_impl {
+    typedef uintptr_t __type_name_t;
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    static const char* __type_name_to_string(__type_name_t __v) _NOEXCEPT {
+      return reinterpret_cast<const char*>(__v &
+          ~__non_unique_rtti_bit::value);
+    }
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    static __type_name_t __string_to_type_name(const char* __v) _NOEXCEPT {
+      return reinterpret_cast<__type_name_t>(__v);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    static size_t __hash(__type_name_t __v) _NOEXCEPT {
+      if (__is_type_name_unique(__v))
+        return __v;
+      return __non_unique_impl::__hash(__type_name_to_string(__v));
+    }
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    static bool __eq(__type_name_t __lhs, __type_name_t __rhs) _NOEXCEPT {
+      if (__lhs == __rhs)
+        return true;
+      if (__is_type_name_unique(__lhs) || __is_type_name_unique(__rhs))
+        // Either both are unique and have a different address, or one of them
+        // is unique and the other one isn't. In both cases they are unequal.
+        return false;
+      return __builtin_strcmp(__type_name_to_string(__lhs), __type_name_to_string(__rhs)) == 0;
+    }
+    _LIBCPP_INLINE_VISIBILITY _LIBCPP_ALWAYS_INLINE
+    static bool __lt(__type_name_t __lhs, __type_name_t __rhs) _NOEXCEPT {
+      if (__is_type_name_unique(__lhs) || __is_type_name_unique(__rhs))
+        return __lhs < __rhs;
+      return __builtin_strcmp(__type_name_to_string(__lhs), __type_name_to_string(__rhs)) < 0;
+    }
+
+   private:
+    // The unique bit is the top bit. It is expected that __type_name_t is 64 bits when
+    // this implementation is actually used.
+    typedef integral_constant<__type_name_t,
+      (1ULL << ((__CHAR_BIT__ * sizeof(__type_name_t)) - 1))> __non_unique_rtti_bit;
+
+    _LIBCPP_INLINE_VISIBILITY
+    static bool __is_type_name_unique(__type_name_t __lhs) _NOEXCEPT {
+      return !(__lhs & __non_unique_rtti_bit::value);
+    }
+  };
+
+  typedef
+#if _LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION == 1
+    __unique_impl
+#elif _LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION == 2
+    __non_unique_impl
+#elif _LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION == 3
+    __non_unique_arm_rtti_bit_impl
+#else
+#   error invalid configuration for _LIBCPP_TYPEINFO_COMPARISON_IMPLEMENTATION
+#endif
+     __impl;
+};
+
+class _LIBCPP_EXCEPTION_ABI type_info
+{
+  type_info& operator=(const type_info&);
+  type_info(const type_info&);
+
+ protected:
+    typedef __type_info_implementations::__impl __impl;
+
+    __impl::__type_name_t __type_name;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit type_info(const char* __n)
+      : __type_name(__impl::__string_to_type_name(__n)) {}
+
+public:
+    _LIBCPP_AVAILABILITY_TYPEINFO_VTABLE
+    virtual ~type_info();
+
+    _LIBCPP_INLINE_VISIBILITY
+    const char* name() const _NOEXCEPT
+    {
+      return __impl::__type_name_to_string(__type_name);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool before(const type_info& __arg) const _NOEXCEPT
+    {
+      return __impl::__lt(__type_name, __arg.__type_name);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t hash_code() const _NOEXCEPT
+    {
+      return __impl::__hash(__type_name);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator==(const type_info& __arg) const _NOEXCEPT
+    {
+      return __impl::__eq(__type_name, __arg.__type_name);
+    }
+
+#if _LIBCPP_STD_VER <= 17
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator!=(const type_info& __arg) const _NOEXCEPT
+    { return !operator==(__arg); }
+#endif
+};
+#endif // defined(_LIBCPP_ABI_MICROSOFT)
+
+class _LIBCPP_EXCEPTION_ABI bad_cast
+    : public exception
+{
+ public:
+  bad_cast() _NOEXCEPT;
+  bad_cast(const bad_cast&) _NOEXCEPT = default;
+  ~bad_cast() _NOEXCEPT override;
+  const char* what() const _NOEXCEPT override;
+};
+
+class _LIBCPP_EXCEPTION_ABI bad_typeid
+    : public exception
+{
+ public:
+  bad_typeid() _NOEXCEPT;
+  ~bad_typeid() _NOEXCEPT override;
+  const char* what() const _NOEXCEPT override;
+};
+
+} // namespace std
+
+#endif // defined(_LIBCPP_ABI_VCRUNTIME)
+
+#if defined(_LIBCPP_ABI_VCRUNTIME) && _HAS_EXCEPTIONS == 0
+
+namespace std {
+
+class bad_cast : public exception {
+public:
+  bad_cast() _NOEXCEPT : exception("bad cast") {}
+
+private:
+  bad_cast(const char* const __message) _NOEXCEPT : exception(__message) {}
+};
+
+class bad_typeid : public exception {
+public:
+  bad_typeid() _NOEXCEPT : exception("bad typeid") {}
+
+private:
+  bad_typeid(const char* const __message) _NOEXCEPT : exception(__message) {}
+};
+
+} // namespace std
+
+#endif // defined(_LIBCPP_ABI_VCRUNTIME) && _HAS_EXCEPTIONS == 0
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+_LIBCPP_NORETURN inline _LIBCPP_INLINE_VISIBILITY
+void __throw_bad_cast()
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    throw bad_cast();
+#else
+    _VSTD::abort();
+#endif
+}
+_LIBCPP_END_NAMESPACE_STD
+
+#endif // __LIBCPP_TYPEINFO
diff --git a/app/src/main/cpp/libcxx/include/uchar.h b/app/src/main/cpp/libcxx/include/uchar.h
new file mode 100644
index 0000000..3a51bb7
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/uchar.h
@@ -0,0 +1,54 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_UCHAR_H
+#define _LIBCPP_UCHAR_H
+
+/*
+    uchar.h synopsis // since C++11
+
+Macros:
+
+    __STDC_UTF_16__
+    __STDC_UTF_32__
+
+Types:
+
+  mbstate_t
+  size_t
+
+size_t mbrtoc8(char8_t* pc8, const char* s, size_t n, mbstate_t* ps);     // since C++20
+size_t c8rtomb(char* s, char8_t c8, mbstate_t* ps);                       // since C++20
+size_t mbrtoc16(char16_t* pc16, const char* s, size_t n, mbstate_t* ps);
+size_t c16rtomb(char* s, char16_t c16, mbstate_t* ps);
+size_t mbrtoc32(char32_t* pc32, const char* s, size_t n, mbstate_t* ps);
+size_t c32rtomb(char* s, char32_t c32, mbstate_t* ps);
+
+*/
+
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if !defined(_LIBCPP_CXX03_LANG)
+
+// Some platforms don't implement <uchar.h> and we don't want to give a hard
+// error on those platforms. When the platform doesn't provide <uchar.h>, at
+// least include <stddef.h> so we get the declaration for size_t.
+#if __has_include_next(<uchar.h>)
+# include_next <uchar.h>
+#else
+# include <stddef.h>
+#endif
+
+#endif // _LIBCPP_CXX03_LANG
+
+#endif // _LIBCPP_UCHAR_H
diff --git a/app/src/main/cpp/libcxx/include/unordered_map b/app/src/main/cpp/libcxx/include/unordered_map
new file mode 100644
index 0000000..14f93ba
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/unordered_map
@@ -0,0 +1,2653 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_UNORDERED_MAP
+#define _LIBCPP_UNORDERED_MAP
+
+/*
+
+    unordered_map synopsis
+
+#include <initializer_list>
+
+namespace std
+{
+
+template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
+          class Alloc = allocator<pair<const Key, T>>>
+class unordered_map
+{
+public:
+    // types
+    typedef Key                                                        key_type;
+    typedef T                                                          mapped_type;
+    typedef Hash                                                       hasher;
+    typedef Pred                                                       key_equal;
+    typedef Alloc                                                      allocator_type;
+    typedef pair<const key_type, mapped_type>                          value_type;
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+    typedef typename allocator_traits<allocator_type>::pointer         pointer;
+    typedef typename allocator_traits<allocator_type>::const_pointer   const_pointer;
+    typedef typename allocator_traits<allocator_type>::size_type       size_type;
+    typedef typename allocator_traits<allocator_type>::difference_type difference_type;
+
+    typedef /unspecified/ iterator;
+    typedef /unspecified/ const_iterator;
+    typedef /unspecified/ local_iterator;
+    typedef /unspecified/ const_local_iterator;
+
+    typedef unspecified                             node_type;            // C++17
+    typedef INSERT_RETURN_TYPE<iterator, node_type> insert_return_type;   // C++17
+
+    unordered_map()
+        noexcept(
+            is_nothrow_default_constructible<hasher>::value &&
+            is_nothrow_default_constructible<key_equal>::value &&
+            is_nothrow_default_constructible<allocator_type>::value);
+    explicit unordered_map(size_type n, const hasher& hf = hasher(),
+                           const key_equal& eql = key_equal(),
+                           const allocator_type& a = allocator_type());
+    template <class InputIterator>
+        unordered_map(InputIterator f, InputIterator l,
+                      size_type n = 0, const hasher& hf = hasher(),
+                      const key_equal& eql = key_equal(),
+                      const allocator_type& a = allocator_type());
+    explicit unordered_map(const allocator_type&);
+    unordered_map(const unordered_map&);
+    unordered_map(const unordered_map&, const Allocator&);
+    unordered_map(unordered_map&&)
+        noexcept(
+            is_nothrow_move_constructible<hasher>::value &&
+            is_nothrow_move_constructible<key_equal>::value &&
+            is_nothrow_move_constructible<allocator_type>::value);
+    unordered_map(unordered_map&&, const Allocator&);
+    unordered_map(initializer_list<value_type>, size_type n = 0,
+                  const hasher& hf = hasher(), const key_equal& eql = key_equal(),
+                  const allocator_type& a = allocator_type());
+    unordered_map(size_type n, const allocator_type& a)
+      : unordered_map(n, hasher(), key_equal(), a) {}  // C++14
+    unordered_map(size_type n, const hasher& hf, const allocator_type& a)
+      : unordered_map(n, hf, key_equal(), a) {}  // C++14
+    template <class InputIterator>
+      unordered_map(InputIterator f, InputIterator l, size_type n, const allocator_type& a)
+      : unordered_map(f, l, n, hasher(), key_equal(), a) {}  // C++14
+    template <class InputIterator>
+      unordered_map(InputIterator f, InputIterator l, size_type n, const hasher& hf,
+        const allocator_type& a)
+      : unordered_map(f, l, n, hf, key_equal(), a) {}  // C++14
+    unordered_map(initializer_list<value_type> il, size_type n, const allocator_type& a)
+      : unordered_map(il, n, hasher(), key_equal(), a) {}  // C++14
+    unordered_map(initializer_list<value_type> il, size_type n, const hasher& hf,
+      const allocator_type& a)
+      : unordered_map(il, n, hf, key_equal(), a) {}  // C++14
+    ~unordered_map();
+    unordered_map& operator=(const unordered_map&);
+    unordered_map& operator=(unordered_map&&)
+        noexcept(
+            allocator_type::propagate_on_container_move_assignment::value &&
+            is_nothrow_move_assignable<allocator_type>::value &&
+            is_nothrow_move_assignable<hasher>::value &&
+            is_nothrow_move_assignable<key_equal>::value);
+    unordered_map& operator=(initializer_list<value_type>);
+
+    allocator_type get_allocator() const noexcept;
+
+    bool      empty() const noexcept;
+    size_type size() const noexcept;
+    size_type max_size() const noexcept;
+
+    iterator       begin() noexcept;
+    iterator       end() noexcept;
+    const_iterator begin()  const noexcept;
+    const_iterator end()    const noexcept;
+    const_iterator cbegin() const noexcept;
+    const_iterator cend()   const noexcept;
+
+    template <class... Args>
+        pair<iterator, bool> emplace(Args&&... args);
+    template <class... Args>
+        iterator emplace_hint(const_iterator position, Args&&... args);
+    pair<iterator, bool> insert(const value_type& obj);
+    template <class P>
+        pair<iterator, bool> insert(P&& obj);
+    iterator insert(const_iterator hint, const value_type& obj);
+    template <class P>
+        iterator insert(const_iterator hint, P&& obj);
+    template <class InputIterator>
+        void insert(InputIterator first, InputIterator last);
+    void insert(initializer_list<value_type>);
+
+    node_type extract(const_iterator position);                                       // C++17
+    node_type extract(const key_type& x);                                             // C++17
+    insert_return_type insert(node_type&& nh);                                        // C++17
+    iterator           insert(const_iterator hint, node_type&& nh);                   // C++17
+
+    template <class... Args>
+        pair<iterator, bool> try_emplace(const key_type& k, Args&&... args);          // C++17
+    template <class... Args>
+        pair<iterator, bool> try_emplace(key_type&& k, Args&&... args);               // C++17
+    template <class... Args>
+        iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args); // C++17
+    template <class... Args>
+        iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args);      // C++17
+    template <class M>
+        pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj);            // C++17
+    template <class M>
+        pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj);                 // C++17
+    template <class M>
+        iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj);   // C++17
+    template <class M>
+        iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj);        // C++17
+
+    iterator erase(const_iterator position);
+    iterator erase(iterator position);  // C++14
+    size_type erase(const key_type& k);
+    iterator erase(const_iterator first, const_iterator last);
+    void clear() noexcept;
+
+    template<class H2, class P2>
+      void merge(unordered_map<Key, T, H2, P2, Allocator>& source);         // C++17
+    template<class H2, class P2>
+      void merge(unordered_map<Key, T, H2, P2, Allocator>&& source);        // C++17
+    template<class H2, class P2>
+      void merge(unordered_multimap<Key, T, H2, P2, Allocator>& source);    // C++17
+    template<class H2, class P2>
+      void merge(unordered_multimap<Key, T, H2, P2, Allocator>&& source);   // C++17
+
+    void swap(unordered_map&)
+        noexcept(
+            (!allocator_type::propagate_on_container_swap::value ||
+             __is_nothrow_swappable<allocator_type>::value) &&
+            __is_nothrow_swappable<hasher>::value &&
+            __is_nothrow_swappable<key_equal>::value);
+
+    hasher hash_function() const;
+    key_equal key_eq() const;
+
+    iterator       find(const key_type& k);
+    const_iterator find(const key_type& k) const;
+    template<typename K>
+        iterator find(const K& x);              // C++20
+    template<typename K>
+        const_iterator find(const K& x) const;  // C++20
+    size_type count(const key_type& k) const;
+    template<typename K>
+        size_type count(const K& k) const; // C++20
+    bool contains(const key_type& k) const; // C++20
+    template<typename K>
+        bool contains(const K& k) const; // C++20
+    pair<iterator, iterator>             equal_range(const key_type& k);
+    pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
+    template<typename K>
+        pair<iterator, iterator>             equal_range(const K& k); // C++20
+    template<typename K>
+        pair<const_iterator, const_iterator> equal_range(const K& k) const; // C++20
+
+    mapped_type& operator[](const key_type& k);
+    mapped_type& operator[](key_type&& k);
+
+    mapped_type&       at(const key_type& k);
+    const mapped_type& at(const key_type& k) const;
+
+    size_type bucket_count() const noexcept;
+    size_type max_bucket_count() const noexcept;
+
+    size_type bucket_size(size_type n) const;
+    size_type bucket(const key_type& k) const;
+
+    local_iterator       begin(size_type n);
+    local_iterator       end(size_type n);
+    const_local_iterator begin(size_type n) const;
+    const_local_iterator end(size_type n) const;
+    const_local_iterator cbegin(size_type n) const;
+    const_local_iterator cend(size_type n) const;
+
+    float load_factor() const noexcept;
+    float max_load_factor() const noexcept;
+    void max_load_factor(float z);
+    void rehash(size_type n);
+    void reserve(size_type n);
+};
+
+template<class InputIterator,
+    class Hash = hash<iter_key_t<InputIterator>>, class Pred = equal_to<iter_key_t<InputIterator>>,
+    class Allocator = allocator<iter_to_alloc_t<InputIterator>>>
+unordered_map(InputIterator, InputIterator, typename see below::size_type = see below,
+    Hash = Hash(), Pred = Pred(), Allocator = Allocator())
+  -> unordered_map<iter_key_t<InputIterator>, iter_value_t<InputIterator>, Hash, Pred,
+    Allocator>; // C++17
+
+template<class Key, class T, class Hash = hash<Key>,
+    class Pred = equal_to<Key>, class Allocator = allocator<pair<const Key, T>>>
+unordered_map(initializer_list<pair<const Key, T>>, typename see below::size_type = see below,
+    Hash = Hash(), Pred = Pred(), Allocator = Allocator())
+  -> unordered_map<Key, T, Hash, Pred, Allocator>; // C++17
+
+template<class InputIterator, class Allocator>
+unordered_map(InputIterator, InputIterator, typename see below::size_type, Allocator)
+  -> unordered_map<iter_key_t<InputIterator>, iter_val_t<InputIterator>,
+        hash<iter_key_t<InputIterator>>, equal_to<iter_key_t<InputIterator>>, Allocator>; // C++17
+
+template<class InputIterator, class Allocator>
+unordered_map(InputIterator, InputIterator, Allocator)
+  -> unordered_map<iter_key_t<InputIterator>, iter_val_t<InputIterator>,
+        hash<iter_key_t<InputIterator>>, equal_to<iter_key_t<InputIterator>>, Allocator>; // C++17
+
+template<class InputIterator, class Hash, class Allocator>
+unordered_map(InputIterator, InputIterator, typename see below::size_type, Hash, Allocator)
+  -> unordered_map<iter_key_t<InputIterator>, iter_val_t<InputIterator>, Hash,
+          equal_to<iter_key_t<InputIterator>>, Allocator>; // C++17
+
+template<class Key, class T, typename Allocator>
+unordered_map(initializer_list<pair<const Key, T>>, typename see below::size_type, Allocator)
+  -> unordered_map<Key, T, hash<Key>, equal_to<Key>, Allocator>; // C++17
+
+template<class Key, class T, typename Allocator>
+unordered_map(initializer_list<pair<const Key, T>>, Allocator)
+  -> unordered_map<Key, T, hash<Key>, equal_to<Key>, Allocator>; // C++17
+
+template<class Key, class T, class Hash, class Allocator>
+unordered_map(initializer_list<pair<const Key, T>>, typename see below::size_type, Hash, Allocator)
+  -> unordered_map<Key, T, Hash, equal_to<Key>, Allocator>; // C++17
+
+template <class Key, class T, class Hash, class Pred, class Alloc>
+    void swap(unordered_map<Key, T, Hash, Pred, Alloc>& x,
+              unordered_map<Key, T, Hash, Pred, Alloc>& y)
+              noexcept(noexcept(x.swap(y)));
+
+template <class Key, class T, class Hash, class Pred, class Alloc>
+    bool
+    operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
+               const unordered_map<Key, T, Hash, Pred, Alloc>& y);
+
+template <class Key, class T, class Hash, class Pred, class Alloc>
+    bool
+    operator!=(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
+               const unordered_map<Key, T, Hash, Pred, Alloc>& y);
+
+template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
+          class Alloc = allocator<pair<const Key, T>>>
+class unordered_multimap
+{
+public:
+    // types
+    typedef Key                                                        key_type;
+    typedef T                                                          mapped_type;
+    typedef Hash                                                       hasher;
+    typedef Pred                                                       key_equal;
+    typedef Alloc                                                      allocator_type;
+    typedef pair<const key_type, mapped_type>                          value_type;
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+    typedef typename allocator_traits<allocator_type>::pointer         pointer;
+    typedef typename allocator_traits<allocator_type>::const_pointer   const_pointer;
+    typedef typename allocator_traits<allocator_type>::size_type       size_type;
+    typedef typename allocator_traits<allocator_type>::difference_type difference_type;
+
+    typedef /unspecified/ iterator;
+    typedef /unspecified/ const_iterator;
+    typedef /unspecified/ local_iterator;
+    typedef /unspecified/ const_local_iterator;
+
+    typedef unspecified node_type;    // C++17
+
+    unordered_multimap()
+        noexcept(
+            is_nothrow_default_constructible<hasher>::value &&
+            is_nothrow_default_constructible<key_equal>::value &&
+            is_nothrow_default_constructible<allocator_type>::value);
+    explicit unordered_multimap(size_type n, const hasher& hf = hasher(),
+                           const key_equal& eql = key_equal(),
+                           const allocator_type& a = allocator_type());
+    template <class InputIterator>
+        unordered_multimap(InputIterator f, InputIterator l,
+                      size_type n = 0, const hasher& hf = hasher(),
+                      const key_equal& eql = key_equal(),
+                      const allocator_type& a = allocator_type());
+    explicit unordered_multimap(const allocator_type&);
+    unordered_multimap(const unordered_multimap&);
+    unordered_multimap(const unordered_multimap&, const Allocator&);
+    unordered_multimap(unordered_multimap&&)
+        noexcept(
+            is_nothrow_move_constructible<hasher>::value &&
+            is_nothrow_move_constructible<key_equal>::value &&
+            is_nothrow_move_constructible<allocator_type>::value);
+    unordered_multimap(unordered_multimap&&, const Allocator&);
+    unordered_multimap(initializer_list<value_type>, size_type n = 0,
+                  const hasher& hf = hasher(), const key_equal& eql = key_equal(),
+                  const allocator_type& a = allocator_type());
+    unordered_multimap(size_type n, const allocator_type& a)
+      : unordered_multimap(n, hasher(), key_equal(), a) {}  // C++14
+    unordered_multimap(size_type n, const hasher& hf, const allocator_type& a)
+      : unordered_multimap(n, hf, key_equal(), a) {}  // C++14
+    template <class InputIterator>
+      unordered_multimap(InputIterator f, InputIterator l, size_type n, const allocator_type& a)
+      : unordered_multimap(f, l, n, hasher(), key_equal(), a) {}  // C++14
+    template <class InputIterator>
+      unordered_multimap(InputIterator f, InputIterator l, size_type n, const hasher& hf,
+        const allocator_type& a)
+      : unordered_multimap(f, l, n, hf, key_equal(), a) {}  // C++14
+    unordered_multimap(initializer_list<value_type> il, size_type n, const allocator_type& a)
+      : unordered_multimap(il, n, hasher(), key_equal(), a) {}  // C++14
+    unordered_multimap(initializer_list<value_type> il, size_type n, const hasher& hf,
+      const allocator_type& a)
+      : unordered_multimap(il, n, hf, key_equal(), a) {}  // C++14
+    ~unordered_multimap();
+    unordered_multimap& operator=(const unordered_multimap&);
+    unordered_multimap& operator=(unordered_multimap&&)
+        noexcept(
+            allocator_type::propagate_on_container_move_assignment::value &&
+            is_nothrow_move_assignable<allocator_type>::value &&
+            is_nothrow_move_assignable<hasher>::value &&
+            is_nothrow_move_assignable<key_equal>::value);
+    unordered_multimap& operator=(initializer_list<value_type>);
+
+    allocator_type get_allocator() const noexcept;
+
+    bool      empty() const noexcept;
+    size_type size() const noexcept;
+    size_type max_size() const noexcept;
+
+    iterator       begin() noexcept;
+    iterator       end() noexcept;
+    const_iterator begin()  const noexcept;
+    const_iterator end()    const noexcept;
+    const_iterator cbegin() const noexcept;
+    const_iterator cend()   const noexcept;
+
+    template <class... Args>
+        iterator emplace(Args&&... args);
+    template <class... Args>
+        iterator emplace_hint(const_iterator position, Args&&... args);
+    iterator insert(const value_type& obj);
+    template <class P>
+        iterator insert(P&& obj);
+    iterator insert(const_iterator hint, const value_type& obj);
+    template <class P>
+        iterator insert(const_iterator hint, P&& obj);
+    template <class InputIterator>
+        void insert(InputIterator first, InputIterator last);
+    void insert(initializer_list<value_type>);
+
+    node_type extract(const_iterator position);                // C++17
+    node_type extract(const key_type& x);                      // C++17
+    iterator insert(node_type&& nh);                           // C++17
+    iterator insert(const_iterator hint, node_type&& nh);      // C++17
+
+    iterator erase(const_iterator position);
+    iterator erase(iterator position);  // C++14
+    size_type erase(const key_type& k);
+    iterator erase(const_iterator first, const_iterator last);
+    void clear() noexcept;
+
+    template<class H2, class P2>
+      void merge(unordered_multimap<Key, T, H2, P2, Allocator>& source);    // C++17
+    template<class H2, class P2>
+      void merge(unordered_multimap<Key, T, H2, P2, Allocator>&& source);   // C++17
+    template<class H2, class P2>
+      void merge(unordered_map<Key, T, H2, P2, Allocator>& source);         // C++17
+    template<class H2, class P2>
+      void merge(unordered_map<Key, T, H2, P2, Allocator>&& source);        // C++17
+
+    void swap(unordered_multimap&)
+        noexcept(
+            (!allocator_type::propagate_on_container_swap::value ||
+             __is_nothrow_swappable<allocator_type>::value) &&
+            __is_nothrow_swappable<hasher>::value &&
+            __is_nothrow_swappable<key_equal>::value);
+
+    hasher hash_function() const;
+    key_equal key_eq() const;
+
+    iterator       find(const key_type& k);
+    const_iterator find(const key_type& k) const;
+    template<typename K>
+        iterator find(const K& x);              // C++20
+    template<typename K>
+        const_iterator find(const K& x) const;  // C++20
+    size_type count(const key_type& k) const;
+    template<typename K>
+        size_type count(const K& k) const; // C++20
+    bool contains(const key_type& k) const; // C++20
+    template<typename K>
+        bool contains(const K& k) const; // C++20
+    pair<iterator, iterator>             equal_range(const key_type& k);
+    pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
+    template<typename K>
+        pair<iterator, iterator>             equal_range(const K& k); // C++20
+    template<typename K>
+        pair<const_iterator, const_iterator> equal_range(const K& k) const; // C++20
+
+    size_type bucket_count() const noexcept;
+    size_type max_bucket_count() const noexcept;
+
+    size_type bucket_size(size_type n) const;
+    size_type bucket(const key_type& k) const;
+
+    local_iterator       begin(size_type n);
+    local_iterator       end(size_type n);
+    const_local_iterator begin(size_type n) const;
+    const_local_iterator end(size_type n) const;
+    const_local_iterator cbegin(size_type n) const;
+    const_local_iterator cend(size_type n) const;
+
+    float load_factor() const noexcept;
+    float max_load_factor() const noexcept;
+    void max_load_factor(float z);
+    void rehash(size_type n);
+    void reserve(size_type n);
+};
+
+template<class InputIterator,
+    class Hash = hash<iter_key_t<InputIterator>>, class Pred = equal_to<iter_key_t<InputIterator>>,
+    class Allocator = allocator<iter_to_alloc_t<InputIterator>>>
+unordered_multimap(InputIterator, InputIterator, typename see below::size_type = see below,
+    Hash = Hash(), Pred = Pred(), Allocator = Allocator())
+  -> unordered_multimap<iter_key_t<InputIterator>, iter_value_t<InputIterator>, Hash, Pred,
+    Allocator>; // C++17
+
+template<class Key, class T, class Hash = hash<Key>,
+    class Pred = equal_to<Key>, class Allocator = allocator<pair<const Key, T>>>
+unordered_multimap(initializer_list<pair<const Key, T>>, typename see below::size_type = see below,
+    Hash = Hash(), Pred = Pred(), Allocator = Allocator())
+  -> unordered_multimap<Key, T, Hash, Pred, Allocator>; // C++17
+
+template<class InputIterator, class Allocator>
+unordered_multimap(InputIterator, InputIterator, typename see below::size_type, Allocator)
+  -> unordered_multimap<iter_key_t<InputIterator>, iter_val_t<InputIterator>,
+        hash<iter_key_t<InputIterator>>, equal_to<iter_key_t<InputIterator>>, Allocator>; // C++17
+
+template<class InputIterator, class Allocator>
+unordered_multimap(InputIterator, InputIterator, Allocator)
+  -> unordered_multimap<iter_key_t<InputIterator>, iter_val_t<InputIterator>,
+        hash<iter_key_t<InputIterator>>, equal_to<iter_key_t<InputIterator>>, Allocator>; // C++17
+
+template<class InputIterator, class Hash, class Allocator>
+unordered_multimap(InputIterator, InputIterator, typename see below::size_type, Hash, Allocator)
+  -> unordered_multimap<iter_key_t<InputIterator>, iter_val_t<InputIterator>, Hash,
+          equal_to<iter_key_t<InputIterator>>, Allocator>; // C++17
+
+template<class Key, class T, typename Allocator>
+unordered_multimap(initializer_list<pair<const Key, T>>, typename see below::size_type, Allocator)
+  -> unordered_multimap<Key, T, hash<Key>, equal_to<Key>, Allocator>; // C++17
+
+template<class Key, class T, typename Allocator>
+unordered_multimap(initializer_list<pair<const Key, T>>, Allocator)
+  -> unordered_multimap<Key, T, hash<Key>, equal_to<Key>, Allocator>; // C++17
+
+template<class Key, class T, class Hash, class Allocator>
+unordered_multimap(initializer_list<pair<const Key, T>>, typename see below::size_type, Hash,
+    Allocator)
+  -> unordered_multimap<Key, T, Hash, equal_to<Key>, Allocator>; // C++17
+
+template <class Key, class T, class Hash, class Pred, class Alloc>
+    void swap(unordered_multimap<Key, T, Hash, Pred, Alloc>& x,
+              unordered_multimap<Key, T, Hash, Pred, Alloc>& y)
+              noexcept(noexcept(x.swap(y)));
+
+template <class K, class T, class H, class P, class A, class Predicate>
+    typename unordered_map<K, T, H, P, A>::size_type
+    erase_if(unordered_map<K, T, H, P, A>& c, Predicate pred);       // C++20
+
+template <class K, class T, class H, class P, class A, class Predicate>
+    typename unordered_multimap<K, T, H, P, A>::size_type
+    erase_if(unordered_multimap<K, T, H, P, A>& c, Predicate pred);  // C++20
+
+template <class Key, class T, class Hash, class Pred, class Alloc>
+    bool
+    operator==(const unordered_multimap<Key, T, Hash, Pred, Alloc>& x,
+               const unordered_multimap<Key, T, Hash, Pred, Alloc>& y);
+
+template <class Key, class T, class Hash, class Pred, class Alloc>
+    bool
+    operator!=(const unordered_multimap<Key, T, Hash, Pred, Alloc>& x,
+               const unordered_multimap<Key, T, Hash, Pred, Alloc>& y);
+
+}  // std
+
+*/
+
+#include <__algorithm/is_permutation.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__debug>
+#include <__functional/is_transparent.h>
+#include <__functional/operations.h>
+#include <__hash_table>
+#include <__iterator/distance.h>
+#include <__iterator/erase_if_container.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__memory/allocator.h>
+#include <__memory_resource/polymorphic_allocator.h>
+#include <__node_handle>
+#include <__type_traits/is_allocator.h>
+#include <__utility/forward.h>
+#include <stdexcept>
+#include <tuple>
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+// [unord.map.syn]
+#include <compare>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Key, class _Cp, class _Hash, class _Pred,
+          bool = is_empty<_Hash>::value && !__libcpp_is_final<_Hash>::value>
+class __unordered_map_hasher
+    : private _Hash
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __unordered_map_hasher()
+        _NOEXCEPT_(is_nothrow_default_constructible<_Hash>::value)
+        : _Hash() {}
+    _LIBCPP_INLINE_VISIBILITY
+    __unordered_map_hasher(const _Hash& __h)
+        _NOEXCEPT_(is_nothrow_copy_constructible<_Hash>::value)
+        : _Hash(__h) {}
+    _LIBCPP_INLINE_VISIBILITY
+    const _Hash& hash_function() const _NOEXCEPT {return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const _Cp& __x) const
+        {return static_cast<const _Hash&>(*this)(__x.__get_value().first);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const _Key& __x) const
+        {return static_cast<const _Hash&>(*this)(__x);}
+#if _LIBCPP_STD_VER > 17
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const _K2& __x) const
+        {return static_cast<const _Hash&>(*this)(__x);}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(__unordered_map_hasher& __y)
+        _NOEXCEPT_(__is_nothrow_swappable<_Hash>::value)
+    {
+        using _VSTD::swap;
+        swap(static_cast<_Hash&>(*this), static_cast<_Hash&>(__y));
+    }
+};
+
+template <class _Key, class _Cp, class _Hash, class _Pred>
+class __unordered_map_hasher<_Key, _Cp, _Hash, _Pred, false>
+{
+    _Hash __hash_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __unordered_map_hasher()
+        _NOEXCEPT_(is_nothrow_default_constructible<_Hash>::value)
+        : __hash_() {}
+    _LIBCPP_INLINE_VISIBILITY
+    __unordered_map_hasher(const _Hash& __h)
+        _NOEXCEPT_(is_nothrow_copy_constructible<_Hash>::value)
+        : __hash_(__h) {}
+    _LIBCPP_INLINE_VISIBILITY
+    const _Hash& hash_function() const _NOEXCEPT {return __hash_;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const _Cp& __x) const
+        {return __hash_(__x.__get_value().first);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const _Key& __x) const
+        {return __hash_(__x);}
+#if _LIBCPP_STD_VER > 17
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    size_t operator()(const _K2& __x) const
+        {return __hash_(__x);}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(__unordered_map_hasher& __y)
+        _NOEXCEPT_(__is_nothrow_swappable<_Hash>::value)
+    {
+        using _VSTD::swap;
+        swap(__hash_, __y.__hash_);
+    }
+};
+
+template <class _Key, class _Cp, class _Hash, class _Pred, bool __b>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(__unordered_map_hasher<_Key, _Cp, _Hash, _Pred, __b>& __x,
+     __unordered_map_hasher<_Key, _Cp, _Hash, _Pred, __b>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+template <class _Key, class _Cp, class _Pred, class _Hash,
+          bool = is_empty<_Pred>::value && !__libcpp_is_final<_Pred>::value>
+class __unordered_map_equal
+    : private _Pred
+{
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __unordered_map_equal()
+        _NOEXCEPT_(is_nothrow_default_constructible<_Pred>::value)
+        : _Pred() {}
+    _LIBCPP_INLINE_VISIBILITY
+    __unordered_map_equal(const _Pred& __p)
+        _NOEXCEPT_(is_nothrow_copy_constructible<_Pred>::value)
+        : _Pred(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    const _Pred& key_eq() const _NOEXCEPT {return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Cp& __x, const _Cp& __y) const
+        {return static_cast<const _Pred&>(*this)(__x.__get_value().first, __y.__get_value().first);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Cp& __x, const _Key& __y) const
+        {return static_cast<const _Pred&>(*this)(__x.__get_value().first, __y);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Key& __x, const _Cp& __y) const
+        {return static_cast<const _Pred&>(*this)(__x, __y.__get_value().first);}
+#if _LIBCPP_STD_VER > 17
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Cp& __x, const _K2& __y) const
+        {return static_cast<const _Pred&>(*this)(__x.__get_value().first, __y);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _K2& __x, const _Cp& __y) const
+        {return static_cast<const _Pred&>(*this)(__x, __y.__get_value().first);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Key& __x, const _K2& __y) const
+        {return static_cast<const _Pred&>(*this)(__x, __y);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _K2& __x, const _Key& __y) const
+        {return static_cast<const _Pred&>(*this)(__x, __y);}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(__unordered_map_equal& __y)
+        _NOEXCEPT_(__is_nothrow_swappable<_Pred>::value)
+    {
+        using _VSTD::swap;
+        swap(static_cast<_Pred&>(*this), static_cast<_Pred&>(__y));
+    }
+};
+
+template <class _Key, class _Cp, class _Pred, class _Hash>
+class __unordered_map_equal<_Key, _Cp, _Pred, _Hash, false>
+{
+    _Pred __pred_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __unordered_map_equal()
+        _NOEXCEPT_(is_nothrow_default_constructible<_Pred>::value)
+        : __pred_() {}
+    _LIBCPP_INLINE_VISIBILITY
+    __unordered_map_equal(const _Pred& __p)
+        _NOEXCEPT_(is_nothrow_copy_constructible<_Pred>::value)
+        : __pred_(__p) {}
+    _LIBCPP_INLINE_VISIBILITY
+    const _Pred& key_eq() const _NOEXCEPT {return __pred_;}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Cp& __x, const _Cp& __y) const
+        {return __pred_(__x.__get_value().first, __y.__get_value().first);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Cp& __x, const _Key& __y) const
+        {return __pred_(__x.__get_value().first, __y);}
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Key& __x, const _Cp& __y) const
+        {return __pred_(__x, __y.__get_value().first);}
+#if _LIBCPP_STD_VER > 17
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Cp& __x, const _K2& __y) const
+        {return __pred_(__x.__get_value().first, __y);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _K2& __x, const _Cp& __y) const
+        {return __pred_(__x, __y.__get_value().first);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _Key& __x, const _K2& __y) const
+        {return __pred_(__x, __y);}
+    template <typename _K2>
+    _LIBCPP_INLINE_VISIBILITY
+    bool operator()(const _K2& __x, const _Key& __y) const
+        {return __pred_(__x, __y);}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(__unordered_map_equal& __y)
+        _NOEXCEPT_(__is_nothrow_swappable<_Pred>::value)
+    {
+        using _VSTD::swap;
+        swap(__pred_, __y.__pred_);
+    }
+};
+
+template <class _Key, class _Cp, class _Pred, class _Hash, bool __b>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(__unordered_map_equal<_Key, _Cp, _Pred, _Hash, __b>& __x,
+     __unordered_map_equal<_Key, _Cp, _Pred, _Hash, __b>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+template <class _Alloc>
+class __hash_map_node_destructor
+{
+    typedef _Alloc                              allocator_type;
+    typedef allocator_traits<allocator_type>    __alloc_traits;
+
+public:
+
+    typedef typename __alloc_traits::pointer       pointer;
+private:
+
+    allocator_type& __na_;
+
+    __hash_map_node_destructor& operator=(const __hash_map_node_destructor&);
+
+public:
+    bool __first_constructed;
+    bool __second_constructed;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __hash_map_node_destructor(allocator_type& __na) _NOEXCEPT
+        : __na_(__na),
+          __first_constructed(false),
+          __second_constructed(false)
+        {}
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_node_destructor(__hash_node_destructor<allocator_type>&& __x)
+        _NOEXCEPT
+        : __na_(__x.__na_),
+          __first_constructed(__x.__value_constructed),
+          __second_constructed(__x.__value_constructed)
+        {
+            __x.__value_constructed = false;
+        }
+#else  // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_node_destructor(const __hash_node_destructor<allocator_type>& __x)
+        : __na_(__x.__na_),
+          __first_constructed(__x.__value_constructed),
+          __second_constructed(__x.__value_constructed)
+        {
+            const_cast<bool&>(__x.__value_constructed) = false;
+        }
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator()(pointer __p) _NOEXCEPT
+    {
+        if (__second_constructed)
+            __alloc_traits::destroy(__na_, _VSTD::addressof(__p->__value_.__get_value().second));
+        if (__first_constructed)
+            __alloc_traits::destroy(__na_, _VSTD::addressof(__p->__value_.__get_value().first));
+        if (__p)
+            __alloc_traits::deallocate(__na_, __p, 1);
+    }
+};
+
+#ifndef _LIBCPP_CXX03_LANG
+template <class _Key, class _Tp>
+struct _LIBCPP_STANDALONE_DEBUG __hash_value_type
+{
+    typedef _Key                                     key_type;
+    typedef _Tp                                      mapped_type;
+    typedef pair<const key_type, mapped_type>        value_type;
+    typedef pair<key_type&, mapped_type&>            __nc_ref_pair_type;
+    typedef pair<key_type&&, mapped_type&&>          __nc_rref_pair_type;
+
+private:
+    value_type __cc_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    value_type& __get_value()
+    {
+#if _LIBCPP_STD_VER > 14
+        return *_VSTD::launder(_VSTD::addressof(__cc_));
+#else
+        return __cc_;
+#endif
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    const value_type& __get_value() const
+    {
+#if _LIBCPP_STD_VER > 14
+        return *_VSTD::launder(_VSTD::addressof(__cc_));
+#else
+        return __cc_;
+#endif
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __nc_ref_pair_type __ref()
+    {
+        value_type& __v = __get_value();
+        return __nc_ref_pair_type(const_cast<key_type&>(__v.first), __v.second);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __nc_rref_pair_type __move()
+    {
+        value_type& __v = __get_value();
+        return __nc_rref_pair_type(
+            _VSTD::move(const_cast<key_type&>(__v.first)),
+            _VSTD::move(__v.second));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_value_type& operator=(const __hash_value_type& __v)
+    {
+        __ref() = __v.__get_value();
+        return *this;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_value_type& operator=(__hash_value_type&& __v)
+    {
+        __ref() = __v.__move();
+        return *this;
+    }
+
+    template <class _ValueTp,
+              class = __enable_if_t<__is_same_uncvref<_ValueTp, value_type>::value>
+             >
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_value_type& operator=(_ValueTp&& __v)
+    {
+        __ref() = _VSTD::forward<_ValueTp>(__v);
+        return *this;
+    }
+
+private:
+    __hash_value_type(const __hash_value_type& __v) = delete;
+    __hash_value_type(__hash_value_type&& __v) = delete;
+    template <class ..._Args>
+    explicit __hash_value_type(_Args&& ...__args) = delete;
+
+    ~__hash_value_type() = delete;
+};
+
+#else
+
+template <class _Key, class _Tp>
+struct __hash_value_type
+{
+    typedef _Key                                     key_type;
+    typedef _Tp                                      mapped_type;
+    typedef pair<const key_type, mapped_type>        value_type;
+
+private:
+    value_type __cc_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    value_type& __get_value() { return __cc_; }
+    _LIBCPP_INLINE_VISIBILITY
+    const value_type& __get_value() const { return __cc_; }
+
+private:
+   ~__hash_value_type();
+};
+
+#endif
+
+template <class _HashIterator>
+class _LIBCPP_TEMPLATE_VIS __hash_map_iterator
+{
+    _HashIterator __i_;
+
+    typedef  __hash_node_types_from_iterator<_HashIterator> _NodeTypes;
+
+public:
+    typedef forward_iterator_tag                                 iterator_category;
+    typedef typename _NodeTypes::__map_value_type                value_type;
+    typedef typename _NodeTypes::difference_type                 difference_type;
+    typedef value_type&                                          reference;
+    typedef typename _NodeTypes::__map_value_type_pointer       pointer;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_iterator() _NOEXCEPT {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_iterator(_HashIterator __i) _NOEXCEPT : __i_(__i) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const {return __i_->__get_value();}
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const {return pointer_traits<pointer>::pointer_to(__i_->__get_value());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_iterator& operator++() {++__i_; return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_iterator operator++(int)
+    {
+        __hash_map_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const __hash_map_iterator& __x, const __hash_map_iterator& __y)
+        {return __x.__i_ == __y.__i_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const __hash_map_iterator& __x, const __hash_map_iterator& __y)
+        {return __x.__i_ != __y.__i_;}
+
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_map;
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_multimap;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_const_iterator;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator;
+};
+
+template <class _HashIterator>
+class _LIBCPP_TEMPLATE_VIS __hash_map_const_iterator
+{
+    _HashIterator __i_;
+
+    typedef  __hash_node_types_from_iterator<_HashIterator> _NodeTypes;
+
+public:
+    typedef forward_iterator_tag                                 iterator_category;
+    typedef typename _NodeTypes::__map_value_type                value_type;
+    typedef typename _NodeTypes::difference_type                 difference_type;
+    typedef const value_type&                                    reference;
+    typedef typename _NodeTypes::__const_map_value_type_pointer  pointer;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_const_iterator() _NOEXCEPT {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_const_iterator(_HashIterator __i) _NOEXCEPT : __i_(__i) {}
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_const_iterator(
+            __hash_map_iterator<typename _HashIterator::__non_const_iterator> __i)
+                 _NOEXCEPT
+                : __i_(__i.__i_) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    reference operator*() const {return __i_->__get_value();}
+    _LIBCPP_INLINE_VISIBILITY
+    pointer operator->() const {return pointer_traits<pointer>::pointer_to(__i_->__get_value());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_const_iterator& operator++() {++__i_; return *this;}
+    _LIBCPP_INLINE_VISIBILITY
+    __hash_map_const_iterator operator++(int)
+    {
+        __hash_map_const_iterator __t(*this);
+        ++(*this);
+        return __t;
+    }
+
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator==(const __hash_map_const_iterator& __x, const __hash_map_const_iterator& __y)
+        {return __x.__i_ == __y.__i_;}
+    friend _LIBCPP_INLINE_VISIBILITY
+        bool operator!=(const __hash_map_const_iterator& __x, const __hash_map_const_iterator& __y)
+        {return __x.__i_ != __y.__i_;}
+
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_map;
+    template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_multimap;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_const_iterator;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS __hash_const_local_iterator;
+};
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+class unordered_multimap;
+
+template <class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = equal_to<_Key>,
+          class _Alloc = allocator<pair<const _Key, _Tp> > >
+class _LIBCPP_TEMPLATE_VIS unordered_map
+{
+public:
+    // types
+    typedef _Key                                           key_type;
+    typedef _Tp                                            mapped_type;
+    typedef __type_identity_t<_Hash>                       hasher;
+    typedef __type_identity_t<_Pred>                       key_equal;
+    typedef __type_identity_t<_Alloc>                      allocator_type;
+    typedef pair<const key_type, mapped_type>              value_type;
+    typedef value_type&                                    reference;
+    typedef const value_type&                              const_reference;
+    static_assert((is_same<value_type, typename allocator_type::value_type>::value),
+                  "Invalid allocator::value_type");
+
+private:
+    typedef __hash_value_type<key_type, mapped_type>                          __value_type;
+    typedef __unordered_map_hasher<key_type, __value_type, hasher, key_equal> __hasher;
+    typedef __unordered_map_equal<key_type, __value_type, key_equal, hasher>  __key_equal;
+    typedef __rebind_alloc<allocator_traits<allocator_type>, __value_type>    __allocator_type;
+
+    typedef __hash_table<__value_type, __hasher,
+                         __key_equal,  __allocator_type>   __table;
+
+    __table __table_;
+
+    typedef typename __table::_NodeTypes                   _NodeTypes;
+    typedef typename __table::__node_pointer               __node_pointer;
+    typedef typename __table::__node_const_pointer         __node_const_pointer;
+    typedef typename __table::__node_traits                __node_traits;
+    typedef typename __table::__node_allocator             __node_allocator;
+    typedef typename __table::__node                       __node;
+    typedef __hash_map_node_destructor<__node_allocator>   _Dp;
+    typedef unique_ptr<__node, _Dp>                         __node_holder;
+    typedef allocator_traits<allocator_type>               __alloc_traits;
+
+    static_assert(is_same<allocator_type, __rebind_alloc<__alloc_traits, value_type> >::value,
+                  "[allocator.requirements] states that rebinding an allocator to the same type should result in the "
+                  "original allocator");
+
+    static_assert((is_same<typename __table::__container_value_type, value_type>::value), "");
+    static_assert((is_same<typename __table::__node_value_type, __value_type>::value), "");
+public:
+    typedef typename __alloc_traits::pointer         pointer;
+    typedef typename __alloc_traits::const_pointer   const_pointer;
+    typedef typename __table::size_type              size_type;
+    typedef typename __table::difference_type        difference_type;
+
+    typedef __hash_map_iterator<typename __table::iterator>       iterator;
+    typedef __hash_map_const_iterator<typename __table::const_iterator> const_iterator;
+    typedef __hash_map_iterator<typename __table::local_iterator> local_iterator;
+    typedef __hash_map_const_iterator<typename __table::const_local_iterator> const_local_iterator;
+
+#if _LIBCPP_STD_VER > 14
+    typedef __map_node_handle<__node, allocator_type> node_type;
+    typedef __insert_return_type<iterator, node_type> insert_return_type;
+#endif
+
+    template <class _Key2, class _Tp2, class _Hash2, class _Pred2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS unordered_map;
+    template <class _Key2, class _Tp2, class _Hash2, class _Pred2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS unordered_multimap;
+
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_map()
+        _NOEXCEPT_(is_nothrow_default_constructible<__table>::value)
+    {
+        _VSTD::__debug_db_insert_c(this);
+    }
+    explicit unordered_map(size_type __n, const hasher& __hf = hasher(),
+                           const key_equal& __eql = key_equal());
+    unordered_map(size_type __n, const hasher& __hf,
+                  const key_equal& __eql,
+                  const allocator_type& __a);
+    template <class _InputIterator>
+        unordered_map(_InputIterator __first, _InputIterator __last);
+    template <class _InputIterator>
+        unordered_map(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf = hasher(),
+                      const key_equal& __eql = key_equal());
+    template <class _InputIterator>
+        unordered_map(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf,
+                      const key_equal& __eql,
+                      const allocator_type& __a);
+    _LIBCPP_INLINE_VISIBILITY
+    explicit unordered_map(const allocator_type& __a);
+    unordered_map(const unordered_map& __u);
+    unordered_map(const unordered_map& __u, const allocator_type& __a);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_map(unordered_map&& __u)
+        _NOEXCEPT_(is_nothrow_move_constructible<__table>::value);
+    unordered_map(unordered_map&& __u, const allocator_type& __a);
+    unordered_map(initializer_list<value_type> __il);
+    unordered_map(initializer_list<value_type> __il, size_type __n,
+                  const hasher& __hf = hasher(), const key_equal& __eql = key_equal());
+    unordered_map(initializer_list<value_type> __il, size_type __n,
+                  const hasher& __hf, const key_equal& __eql,
+                  const allocator_type& __a);
+#endif // _LIBCPP_CXX03_LANG
+#if _LIBCPP_STD_VER > 11
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_map(size_type __n, const allocator_type& __a)
+      : unordered_map(__n, hasher(), key_equal(), __a) {}
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_map(size_type __n, const hasher& __hf, const allocator_type& __a)
+      : unordered_map(__n, __hf, key_equal(), __a) {}
+    template <class _InputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+      unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& __a)
+      : unordered_map(__first, __last, __n, hasher(), key_equal(), __a) {}
+    template <class _InputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+      unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf,
+        const allocator_type& __a)
+      : unordered_map(__first, __last, __n, __hf, key_equal(), __a) {}
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_map(initializer_list<value_type> __il, size_type __n, const allocator_type& __a)
+      : unordered_map(__il, __n, hasher(), key_equal(), __a) {}
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_map(initializer_list<value_type> __il, size_type __n, const hasher& __hf,
+      const allocator_type& __a)
+      : unordered_map(__il, __n, __hf, key_equal(), __a) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    ~unordered_map() {
+        static_assert(sizeof(std::__diagnose_unordered_container_requirements<_Key, _Hash, _Pred>(0)), "");
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_map& operator=(const unordered_map& __u)
+    {
+#ifndef _LIBCPP_CXX03_LANG
+        __table_ = __u.__table_;
+#else
+        if (this != _VSTD::addressof(__u)) {
+            __table_.clear();
+            __table_.hash_function() = __u.__table_.hash_function();
+            __table_.key_eq() = __u.__table_.key_eq();
+            __table_.max_load_factor() = __u.__table_.max_load_factor();
+            __table_.__copy_assign_alloc(__u.__table_);
+            insert(__u.begin(), __u.end());
+        }
+#endif
+        return *this;
+    }
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_map& operator=(unordered_map&& __u)
+        _NOEXCEPT_(is_nothrow_move_assignable<__table>::value);
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_map& operator=(initializer_list<value_type> __il);
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const _NOEXCEPT
+        {return allocator_type(__table_.__node_alloc());}
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool      empty() const _NOEXCEPT {return __table_.size() == 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const _NOEXCEPT  {return __table_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT {return __table_.max_size();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       begin() _NOEXCEPT        {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       end() _NOEXCEPT          {return __table_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin()  const _NOEXCEPT {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end()    const _NOEXCEPT {return __table_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbegin() const _NOEXCEPT {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cend()   const _NOEXCEPT {return __table_.end();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> insert(const value_type& __x)
+        {return __table_.__insert_unique(__x);}
+
+    iterator insert(const_iterator __p, const value_type& __x) {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                             "unordered_map::insert(const_iterator, const value_type&) called with an iterator not "
+                             "referring to this unordered_map");
+        ((void)__p);
+        return insert(__x).first;
+    }
+
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        void insert(_InputIterator __first, _InputIterator __last);
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    void insert(initializer_list<value_type> __il)
+        {insert(__il.begin(), __il.end());}
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> insert(value_type&& __x)
+        {return __table_.__insert_unique(_VSTD::move(__x));}
+
+    iterator insert(const_iterator __p, value_type&& __x) {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                             "unordered_map::insert(const_iterator, const value_type&) called with an iterator not"
+                             " referring to this unordered_map");
+        ((void)__p);
+        return __table_.__insert_unique(_VSTD::move(__x)).first;
+    }
+
+    template <class _Pp,
+              class = __enable_if_t<is_constructible<value_type, _Pp>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        pair<iterator, bool> insert(_Pp&& __x)
+            {return __table_.__insert_unique(_VSTD::forward<_Pp>(__x));}
+
+    template <class _Pp,
+              class = __enable_if_t<is_constructible<value_type, _Pp>::value> >
+        _LIBCPP_INLINE_VISIBILITY
+        iterator insert(const_iterator __p, _Pp&& __x)
+        {
+            _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                                 "unordered_map::insert(const_iterator, value_type&&) called with an iterator not"
+                                 " referring to this unordered_map");
+          ((void)__p);
+            return insert(_VSTD::forward<_Pp>(__x)).first;
+        }
+
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> emplace(_Args&&... __args) {
+        return __table_.__emplace_unique(_VSTD::forward<_Args>(__args)...);
+    }
+
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator emplace_hint(const_iterator __p, _Args&&... __args) {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__p)) == this,
+                             "unordered_map::emplace_hint(const_iterator, args...) called with an iterator not"
+                             " referring to this unordered_map");
+          ((void)__p);
+        return __table_.__emplace_unique(_VSTD::forward<_Args>(__args)...).first;
+    }
+
+#endif // _LIBCPP_CXX03_LANG
+
+#if _LIBCPP_STD_VER > 14
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        pair<iterator, bool> try_emplace(const key_type& __k, _Args&&... __args)
+    {
+        return __table_.__emplace_unique_key_args(__k, piecewise_construct,
+            _VSTD::forward_as_tuple(__k),
+            _VSTD::forward_as_tuple(_VSTD::forward<_Args>(__args)...));
+    }
+
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        pair<iterator, bool> try_emplace(key_type&& __k, _Args&&... __args)
+    {
+        return __table_.__emplace_unique_key_args(__k, piecewise_construct,
+            _VSTD::forward_as_tuple(_VSTD::move(__k)),
+            _VSTD::forward_as_tuple(_VSTD::forward<_Args>(__args)...));
+    }
+
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__h)) == this,
+                             "unordered_map::try_emplace(const_iterator, key, args...) called with an iterator not"
+                             " referring to this unordered_map");
+        ((void)__h);
+        return try_emplace(__k, _VSTD::forward<_Args>(__args)...).first;
+    }
+
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args)
+    {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(_VSTD::addressof(__h)) == this,
+                             "unordered_map::try_emplace(const_iterator, key, args...) called with an iterator not"
+                             " referring to this unordered_map");
+        ((void)__h);
+        return try_emplace(_VSTD::move(__k), _VSTD::forward<_Args>(__args)...).first;
+    }
+
+    template <class _Vp>
+        _LIBCPP_INLINE_VISIBILITY
+        pair<iterator, bool> insert_or_assign(const key_type& __k, _Vp&& __v)
+    {
+        pair<iterator, bool> __res = __table_.__emplace_unique_key_args(__k,
+            __k, _VSTD::forward<_Vp>(__v));
+        if (!__res.second) {
+            __res.first->second = _VSTD::forward<_Vp>(__v);
+        }
+        return __res;
+    }
+
+    template <class _Vp>
+        _LIBCPP_INLINE_VISIBILITY
+        pair<iterator, bool> insert_or_assign(key_type&& __k, _Vp&& __v)
+    {
+        pair<iterator, bool> __res = __table_.__emplace_unique_key_args(__k,
+            _VSTD::move(__k), _VSTD::forward<_Vp>(__v));
+        if (!__res.second) {
+            __res.first->second = _VSTD::forward<_Vp>(__v);
+        }
+        return __res;
+    }
+
+    template <class _Vp>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator insert_or_assign(const_iterator, const key_type& __k, _Vp&& __v)
+     {
+          // FIXME: Add debug mode checking for the iterator input
+          return insert_or_assign(__k, _VSTD::forward<_Vp>(__v)).first;
+     }
+
+    template <class _Vp>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator insert_or_assign(const_iterator, key_type&& __k, _Vp&& __v)
+     {
+        // FIXME: Add debug mode checking for the iterator input
+        return insert_or_assign(_VSTD::move(__k), _VSTD::forward<_Vp>(__v)).first;
+     }
+#endif // _LIBCPP_STD_VER > 14
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(const_iterator __p) {return __table_.erase(__p.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(iterator __p)       {return __table_.erase(__p.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(const_iterator __first, const_iterator __last)
+        {return __table_.erase(__first.__i_, __last.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+        void clear() _NOEXCEPT {__table_.clear();}
+
+#if _LIBCPP_STD_VER > 14
+    _LIBCPP_INLINE_VISIBILITY
+    insert_return_type insert(node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to unordered_map::insert()");
+        return __table_.template __node_handle_insert_unique<
+            node_type, insert_return_type>(_VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __hint, node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to unordered_map::insert()");
+        return __table_.template __node_handle_insert_unique<node_type>(
+            __hint.__i_, _VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(key_type const& __key)
+    {
+        return __table_.template __node_handle_extract<node_type>(__key);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(const_iterator __it)
+    {
+        return __table_.template __node_handle_extract<node_type>(
+            __it.__i_);
+    }
+
+    template <class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __table_.__node_handle_merge_unique(__source.__table_);
+    }
+    template <class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __table_.__node_handle_merge_unique(__source.__table_);
+    }
+    template <class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_multimap<key_type, mapped_type, _H2, _P2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __table_.__node_handle_merge_unique(__source.__table_);
+    }
+    template <class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_multimap<key_type, mapped_type, _H2, _P2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __table_.__node_handle_merge_unique(__source.__table_);
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(unordered_map& __u)
+        _NOEXCEPT_(__is_nothrow_swappable<__table>::value)
+        { __table_.swap(__u.__table_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    hasher hash_function() const
+        {return __table_.hash_function().hash_function();}
+    _LIBCPP_INLINE_VISIBILITY
+    key_equal key_eq() const
+        {return __table_.key_eq().key_eq();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       find(const key_type& __k)       {return __table_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const key_type& __k) const {return __table_.find(__k);}
+#if _LIBCPP_STD_VER > 17
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       find(const _K2& __k)            {return __table_.find(__k);}
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const _K2& __k) const      {return __table_.find(__k);}
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
+#if _LIBCPP_STD_VER > 17
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    size_type count(const _K2& __k) const      {return __table_.__count_unique(__k);}
+#endif // _LIBCPP_STD_VER > 17
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY
+    bool contains(const key_type& __k) const {return find(__k) != end();}
+
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    bool contains(const _K2& __k) const      {return find(__k) != end();}
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, iterator>             equal_range(const key_type& __k)
+        {return __table_.__equal_range_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
+        {return __table_.__equal_range_unique(__k);}
+#if _LIBCPP_STD_VER > 17
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, iterator>             equal_range(const _K2& __k)
+        {return __table_.__equal_range_unique(__k);}
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<const_iterator, const_iterator> equal_range(const _K2& __k) const
+        {return __table_.__equal_range_unique(__k);}
+#endif // _LIBCPP_STD_VER > 17
+
+    mapped_type& operator[](const key_type& __k);
+#ifndef _LIBCPP_CXX03_LANG
+    mapped_type& operator[](key_type&& __k);
+#endif
+
+    mapped_type&       at(const key_type& __k);
+    const mapped_type& at(const key_type& __k) const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_count() const _NOEXCEPT {return __table_.bucket_count();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_bucket_count() const _NOEXCEPT {return __table_.max_bucket_count();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_size(size_type __n) const
+        {return __table_.bucket_size(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket(const key_type& __k) const {return __table_.bucket(__k);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    local_iterator       begin(size_type __n)        {return __table_.begin(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    local_iterator       end(size_type __n)          {return __table_.end(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator begin(size_type __n) const  {return __table_.cbegin(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator end(size_type __n) const    {return __table_.cend(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator cbegin(size_type __n) const {return __table_.cbegin(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator cend(size_type __n) const   {return __table_.cend(__n);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    float load_factor() const _NOEXCEPT {return __table_.load_factor();}
+    _LIBCPP_INLINE_VISIBILITY
+    float max_load_factor() const _NOEXCEPT {return __table_.max_load_factor();}
+    _LIBCPP_INLINE_VISIBILITY
+    void max_load_factor(float __mlf) {__table_.max_load_factor(__mlf);}
+    _LIBCPP_INLINE_VISIBILITY
+    void rehash(size_type __n) {__table_.__rehash_unique(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    void reserve(size_type __n) {__table_.__reserve_unique(__n);}
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+    bool __dereferenceable(const const_iterator* __i) const
+        {return __table_.__dereferenceable(_VSTD::addressof(__i->__i_));}
+    bool __decrementable(const const_iterator* __i) const
+        {return __table_.__decrementable(_VSTD::addressof(__i->__i_));}
+    bool __addable(const const_iterator* __i, ptrdiff_t __n) const
+        {return __table_.__addable(_VSTD::addressof(__i->__i_), __n);}
+    bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const
+        {return __table_.__addable(_VSTD::addressof(__i->__i_), __n);}
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+private:
+
+#ifdef _LIBCPP_CXX03_LANG
+    __node_holder __construct_node_with_key(const key_type& __k);
+#endif
+};
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator,
+         class _Hash = hash<__iter_key_type<_InputIterator>>,
+         class _Pred = equal_to<__iter_key_type<_InputIterator>>,
+         class _Allocator = allocator<__iter_to_alloc_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<!__is_allocator<_Pred>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_map(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type = 0,
+              _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
+  -> unordered_map<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>, _Hash, _Pred, _Allocator>;
+
+template<class _Key, class _Tp, class _Hash = hash<remove_const_t<_Key>>,
+         class _Pred = equal_to<remove_const_t<_Key>>,
+         class _Allocator = allocator<pair<const _Key, _Tp>>,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<!__is_allocator<_Pred>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_map(initializer_list<pair<_Key, _Tp>>, typename allocator_traits<_Allocator>::size_type = 0,
+              _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
+  -> unordered_map<remove_const_t<_Key>, _Tp, _Hash, _Pred, _Allocator>;
+
+template<class _InputIterator, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_map(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type, _Allocator)
+  -> unordered_map<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>,
+                   hash<__iter_key_type<_InputIterator>>, equal_to<__iter_key_type<_InputIterator>>, _Allocator>;
+
+template<class _InputIterator, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_map(_InputIterator, _InputIterator, _Allocator)
+  -> unordered_map<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>,
+                   hash<__iter_key_type<_InputIterator>>, equal_to<__iter_key_type<_InputIterator>>, _Allocator>;
+
+template<class _InputIterator, class _Hash, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_map(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type, _Hash, _Allocator)
+  -> unordered_map<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>,
+                   _Hash, equal_to<__iter_key_type<_InputIterator>>, _Allocator>;
+
+template<class _Key, class _Tp, class _Allocator,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_map(initializer_list<pair<_Key, _Tp>>, typename allocator_traits<_Allocator>::size_type, _Allocator)
+  -> unordered_map<remove_const_t<_Key>, _Tp,
+                   hash<remove_const_t<_Key>>,
+                   equal_to<remove_const_t<_Key>>, _Allocator>;
+
+template<class _Key, class _Tp, class _Allocator,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_map(initializer_list<pair<_Key, _Tp>>, _Allocator)
+  -> unordered_map<remove_const_t<_Key>, _Tp,
+                   hash<remove_const_t<_Key>>,
+                   equal_to<remove_const_t<_Key>>, _Allocator>;
+
+template<class _Key, class _Tp, class _Hash, class _Allocator,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_map(initializer_list<pair<_Key, _Tp>>, typename allocator_traits<_Allocator>::size_type, _Hash, _Allocator)
+  -> unordered_map<remove_const_t<_Key>, _Tp, _Hash,
+                   equal_to<remove_const_t<_Key>>, _Allocator>;
+#endif
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        size_type __n, const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__n);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        size_type __n, const hasher& __hf, const key_equal& __eql,
+        const allocator_type& __a)
+    : __table_(__hf, __eql, typename __table::allocator_type(__a))
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__n);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        const allocator_type& __a)
+    : __table_(typename __table::allocator_type(__a))
+{
+    _VSTD::__debug_db_insert_c(this);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        _InputIterator __first, _InputIterator __last)
+{
+    _VSTD::__debug_db_insert_c(this);
+    insert(__first, __last);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__n);
+    insert(__first, __last);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, typename __table::allocator_type(__a))
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__n);
+    insert(__first, __last);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        const unordered_map& __u)
+    : __table_(__u.__table_)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__u.bucket_count());
+    insert(__u.begin(), __u.end());
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        const unordered_map& __u, const allocator_type& __a)
+    : __table_(__u.__table_, typename __table::allocator_type(__a))
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__u.bucket_count());
+    insert(__u.begin(), __u.end());
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        unordered_map&& __u)
+    _NOEXCEPT_(is_nothrow_move_constructible<__table>::value)
+    : __table_(_VSTD::move(__u.__table_))
+{
+    _VSTD::__debug_db_insert_c(this);
+    std::__debug_db_swap(this, std::addressof(__u));
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        unordered_map&& __u, const allocator_type& __a)
+    : __table_(_VSTD::move(__u.__table_), typename __table::allocator_type(__a))
+{
+    _VSTD::__debug_db_insert_c(this);
+    if (__a != __u.get_allocator())
+    {
+        iterator __i = __u.begin();
+        while (__u.size() != 0) {
+            __table_.__emplace_unique(
+                __u.__table_.remove((__i++).__i_)->__value_.__move());
+        }
+    }
+    else
+        std::__debug_db_swap(this, std::addressof(__u));
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        initializer_list<value_type> __il)
+{
+    _VSTD::__debug_db_insert_c(this);
+    insert(__il.begin(), __il.end());
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        initializer_list<value_type> __il, size_type __n, const hasher& __hf,
+        const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__n);
+    insert(__il.begin(), __il.end());
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
+        initializer_list<value_type> __il, size_type __n, const hasher& __hf,
+        const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, typename __table::allocator_type(__a))
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__n);
+    insert(__il.begin(), __il.end());
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=(unordered_map&& __u)
+    _NOEXCEPT_(is_nothrow_move_assignable<__table>::value)
+{
+    __table_ = _VSTD::move(__u.__table_);
+    return *this;
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=(
+        initializer_list<value_type> __il)
+{
+    __table_.__assign_unique(__il.begin(), __il.end());
+    return *this;
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+inline
+void
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
+                                                       _InputIterator __last)
+{
+    for (; __first != __last; ++__first)
+        __table_.__insert_unique(*__first);
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+_Tp&
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k)
+{
+    return __table_.__emplace_unique_key_args(__k,
+        piecewise_construct, _VSTD::forward_as_tuple(__k),
+                             _VSTD::forward_as_tuple()).first->__get_value().second;
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+_Tp&
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](key_type&& __k)
+{
+    return __table_.__emplace_unique_key_args(__k,
+        piecewise_construct, _VSTD::forward_as_tuple(_VSTD::move(__k)),
+                             _VSTD::forward_as_tuple()).first->__get_value().second;
+}
+#else // _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__node_holder
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__construct_node_with_key(const key_type& __k)
+{
+    __node_allocator& __na = __table_.__node_alloc();
+    __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
+    __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__get_value().first), __k);
+    __h.get_deleter().__first_constructed = true;
+    __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__get_value().second));
+    __h.get_deleter().__second_constructed = true;
+    return __h;
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+_Tp&
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k)
+{
+    iterator __i = find(__k);
+    if (__i != end())
+        return __i->second;
+    __node_holder __h = __construct_node_with_key(__k);
+    pair<iterator, bool> __r = __table_.__node_insert_unique(__h.get());
+    __h.release();
+    return __r.first->second;
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+_Tp&
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::at(const key_type& __k)
+{
+    iterator __i = find(__k);
+    if (__i == end())
+        __throw_out_of_range("unordered_map::at: key not found");
+    return __i->second;
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+const _Tp&
+unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::at(const key_type& __k) const
+{
+    const_iterator __i = find(__k);
+    if (__i == end())
+        __throw_out_of_range("unordered_map::at: key not found");
+    return __i->second;
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
+     unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc,
+          class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY
+    typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::size_type
+    erase_if(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __c,
+             _Predicate __pred) {
+  return _VSTD::__libcpp_erase_if_container(__c, __pred);
+}
+#endif
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
+           const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
+{
+    if (__x.size() != __y.size())
+        return false;
+    typedef typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator
+                                                                 const_iterator;
+    for (const_iterator __i = __x.begin(), __ex = __x.end(), __ey = __y.end();
+            __i != __ex; ++__i)
+    {
+        const_iterator __j = __y.find(__i->first);
+        if (__j == __ey || !(*__i == *__j))
+            return false;
+    }
+    return true;
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
+           const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = equal_to<_Key>,
+          class _Alloc = allocator<pair<const _Key, _Tp> > >
+class _LIBCPP_TEMPLATE_VIS unordered_multimap
+{
+public:
+    // types
+    typedef _Key                                           key_type;
+    typedef _Tp                                            mapped_type;
+    typedef __type_identity_t<_Hash>                       hasher;
+    typedef __type_identity_t<_Pred>                       key_equal;
+    typedef __type_identity_t<_Alloc>                      allocator_type;
+    typedef pair<const key_type, mapped_type>              value_type;
+    typedef value_type&                                    reference;
+    typedef const value_type&                              const_reference;
+    static_assert((is_same<value_type, typename allocator_type::value_type>::value),
+                  "Invalid allocator::value_type");
+
+private:
+    typedef __hash_value_type<key_type, mapped_type>                          __value_type;
+    typedef __unordered_map_hasher<key_type, __value_type, hasher, key_equal> __hasher;
+    typedef __unordered_map_equal<key_type, __value_type, key_equal, hasher>  __key_equal;
+    typedef __rebind_alloc<allocator_traits<allocator_type>, __value_type>    __allocator_type;
+
+    typedef __hash_table<__value_type, __hasher,
+                         __key_equal,  __allocator_type>   __table;
+
+    __table __table_;
+
+    typedef typename __table::_NodeTypes                   _NodeTypes;
+    typedef typename __table::__node_traits                __node_traits;
+    typedef typename __table::__node_allocator             __node_allocator;
+    typedef typename __table::__node                       __node;
+    typedef __hash_map_node_destructor<__node_allocator>   _Dp;
+    typedef unique_ptr<__node, _Dp>                         __node_holder;
+    typedef allocator_traits<allocator_type>               __alloc_traits;
+    static_assert((is_same<typename __node_traits::size_type,
+                          typename __alloc_traits::size_type>::value),
+                 "Allocator uses different size_type for different types");
+
+    static_assert(is_same<allocator_type, __rebind_alloc<__alloc_traits, value_type> >::value,
+                  "[allocator.requirements] states that rebinding an allocator to the same type should result in the "
+                  "original allocator");
+
+  public:
+    typedef typename __alloc_traits::pointer         pointer;
+    typedef typename __alloc_traits::const_pointer   const_pointer;
+    typedef typename __table::size_type              size_type;
+    typedef typename __table::difference_type        difference_type;
+
+    typedef __hash_map_iterator<typename __table::iterator>       iterator;
+    typedef __hash_map_const_iterator<typename __table::const_iterator> const_iterator;
+    typedef __hash_map_iterator<typename __table::local_iterator> local_iterator;
+    typedef __hash_map_const_iterator<typename __table::const_local_iterator> const_local_iterator;
+
+#if _LIBCPP_STD_VER > 14
+    typedef __map_node_handle<__node, allocator_type> node_type;
+#endif
+
+    template <class _Key2, class _Tp2, class _Hash2, class _Pred2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS unordered_map;
+    template <class _Key2, class _Tp2, class _Hash2, class _Pred2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS unordered_multimap;
+
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multimap()
+        _NOEXCEPT_(is_nothrow_default_constructible<__table>::value)
+    {
+        _VSTD::__debug_db_insert_c(this);
+    }
+    explicit unordered_multimap(size_type __n, const hasher& __hf = hasher(),
+                                const key_equal& __eql = key_equal());
+    unordered_multimap(size_type __n, const hasher& __hf,
+                                const key_equal& __eql,
+                                const allocator_type& __a);
+    template <class _InputIterator>
+        unordered_multimap(_InputIterator __first, _InputIterator __last);
+    template <class _InputIterator>
+        unordered_multimap(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf = hasher(),
+                      const key_equal& __eql = key_equal());
+    template <class _InputIterator>
+        unordered_multimap(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf,
+                      const key_equal& __eql,
+                      const allocator_type& __a);
+    _LIBCPP_INLINE_VISIBILITY
+    explicit unordered_multimap(const allocator_type& __a);
+    unordered_multimap(const unordered_multimap& __u);
+    unordered_multimap(const unordered_multimap& __u, const allocator_type& __a);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multimap(unordered_multimap&& __u)
+        _NOEXCEPT_(is_nothrow_move_constructible<__table>::value);
+    unordered_multimap(unordered_multimap&& __u, const allocator_type& __a);
+    unordered_multimap(initializer_list<value_type> __il);
+    unordered_multimap(initializer_list<value_type> __il, size_type __n,
+                       const hasher& __hf = hasher(),
+                       const key_equal& __eql = key_equal());
+    unordered_multimap(initializer_list<value_type> __il, size_type __n,
+                       const hasher& __hf, const key_equal& __eql,
+                       const allocator_type& __a);
+#endif // _LIBCPP_CXX03_LANG
+#if _LIBCPP_STD_VER > 11
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multimap(size_type __n, const allocator_type& __a)
+      : unordered_multimap(__n, hasher(), key_equal(), __a) {}
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multimap(size_type __n, const hasher& __hf, const allocator_type& __a)
+      : unordered_multimap(__n, __hf, key_equal(), __a) {}
+    template <class _InputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+      unordered_multimap(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& __a)
+      : unordered_multimap(__first, __last, __n, hasher(), key_equal(), __a) {}
+    template <class _InputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+      unordered_multimap(_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf,
+        const allocator_type& __a)
+      : unordered_multimap(__first, __last, __n, __hf, key_equal(), __a) {}
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multimap(initializer_list<value_type> __il, size_type __n, const allocator_type& __a)
+      : unordered_multimap(__il, __n, hasher(), key_equal(), __a) {}
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multimap(initializer_list<value_type> __il, size_type __n, const hasher& __hf,
+      const allocator_type& __a)
+      : unordered_multimap(__il, __n, __hf, key_equal(), __a) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    ~unordered_multimap() {
+        static_assert(sizeof(std::__diagnose_unordered_container_requirements<_Key, _Hash, _Pred>(0)), "");
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multimap& operator=(const unordered_multimap& __u)
+    {
+#ifndef _LIBCPP_CXX03_LANG
+        __table_ = __u.__table_;
+#else
+        if (this != _VSTD::addressof(__u)) {
+            __table_.clear();
+            __table_.hash_function() = __u.__table_.hash_function();
+            __table_.key_eq() = __u.__table_.key_eq();
+            __table_.max_load_factor() = __u.__table_.max_load_factor();
+            __table_.__copy_assign_alloc(__u.__table_);
+            insert(__u.begin(), __u.end());
+        }
+#endif
+        return *this;
+    }
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multimap& operator=(unordered_multimap&& __u)
+        _NOEXCEPT_(is_nothrow_move_assignable<__table>::value);
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multimap& operator=(initializer_list<value_type> __il);
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const _NOEXCEPT
+        {return allocator_type(__table_.__node_alloc());}
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool      empty() const _NOEXCEPT {return __table_.size() == 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const _NOEXCEPT  {return __table_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT {return __table_.max_size();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       begin() _NOEXCEPT        {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       end() _NOEXCEPT          {return __table_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin()  const _NOEXCEPT {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end()    const _NOEXCEPT {return __table_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbegin() const _NOEXCEPT {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cend()   const _NOEXCEPT {return __table_.end();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const value_type& __x) {return __table_.__insert_multi(__x);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, const value_type& __x)
+        {return __table_.__insert_multi(__p.__i_, __x);}
+
+    template <class _InputIterator>
+    _LIBCPP_INLINE_VISIBILITY
+    void insert(_InputIterator __first, _InputIterator __last);
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    void insert(initializer_list<value_type> __il)
+        {insert(__il.begin(), __il.end());}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(value_type&& __x) {return __table_.__insert_multi(_VSTD::move(__x));}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, value_type&& __x)
+        {return __table_.__insert_multi(__p.__i_, _VSTD::move(__x));}
+
+    template <class _Pp,
+              class = __enable_if_t<is_constructible<value_type, _Pp>::value> >
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(_Pp&& __x)
+        {return __table_.__insert_multi(_VSTD::forward<_Pp>(__x));}
+
+    template <class _Pp,
+              class = __enable_if_t<is_constructible<value_type, _Pp>::value> >
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, _Pp&& __x)
+        {return __table_.__insert_multi(__p.__i_, _VSTD::forward<_Pp>(__x));}
+
+    template <class... _Args>
+    iterator emplace(_Args&&... __args) {
+        return __table_.__emplace_multi(_VSTD::forward<_Args>(__args)...);
+    }
+
+    template <class... _Args>
+    iterator emplace_hint(const_iterator __p, _Args&&... __args) {
+        return __table_.__emplace_hint_multi(__p.__i_, _VSTD::forward<_Args>(__args)...);
+    }
+#endif // _LIBCPP_CXX03_LANG
+
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(const_iterator __p) {return __table_.erase(__p.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(iterator __p)       {return __table_.erase(__p.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(const_iterator __first, const_iterator __last)
+        {return __table_.erase(__first.__i_, __last.__i_);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() _NOEXCEPT {__table_.clear();}
+
+#if _LIBCPP_STD_VER > 14
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to unordered_multimap::insert()");
+        return __table_.template __node_handle_insert_multi<node_type>(
+            _VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __hint, node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to unordered_multimap::insert()");
+        return __table_.template __node_handle_insert_multi<node_type>(
+            __hint.__i_, _VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(key_type const& __key)
+    {
+        return __table_.template __node_handle_extract<node_type>(__key);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(const_iterator __it)
+    {
+        return __table_.template __node_handle_extract<node_type>(
+            __it.__i_);
+    }
+
+    template <class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_multimap<key_type, mapped_type, _H2, _P2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __table_.__node_handle_merge_multi(__source.__table_);
+    }
+    template <class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_multimap<key_type, mapped_type, _H2, _P2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __table_.__node_handle_merge_multi(__source.__table_);
+    }
+    template <class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __table_.__node_handle_merge_multi(__source.__table_);
+    }
+    template <class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __table_.__node_handle_merge_multi(__source.__table_);
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(unordered_multimap& __u)
+        _NOEXCEPT_(__is_nothrow_swappable<__table>::value)
+        {__table_.swap(__u.__table_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    hasher hash_function() const
+        {return __table_.hash_function().hash_function();}
+    _LIBCPP_INLINE_VISIBILITY
+    key_equal key_eq() const
+        {return __table_.key_eq().key_eq();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       find(const key_type& __k)       {return __table_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const key_type& __k) const {return __table_.find(__k);}
+#if _LIBCPP_STD_VER > 17
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       find(const _K2& __k)            {return __table_.find(__k);}
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const _K2& __k) const      {return __table_.find(__k);}
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type count(const key_type& __k) const {return __table_.__count_multi(__k);}
+#if _LIBCPP_STD_VER > 17
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    size_type count(const _K2& __k) const      {return __table_.__count_multi(__k);}
+#endif // _LIBCPP_STD_VER > 17
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY
+    bool contains(const key_type& __k) const {return find(__k) != end();}
+
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    bool contains(const _K2& __k) const      {return find(__k) != end();}
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, iterator>             equal_range(const key_type& __k)
+        {return __table_.__equal_range_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
+        {return __table_.__equal_range_multi(__k);}
+#if _LIBCPP_STD_VER > 17
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, iterator>             equal_range(const _K2& __k)
+        {return __table_.__equal_range_multi(__k);}
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<const_iterator, const_iterator> equal_range(const _K2& __k) const
+        {return __table_.__equal_range_multi(__k);}
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_count() const _NOEXCEPT {return __table_.bucket_count();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_bucket_count() const _NOEXCEPT
+        {return __table_.max_bucket_count();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_size(size_type __n) const
+        {return __table_.bucket_size(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket(const key_type& __k) const {return __table_.bucket(__k);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    local_iterator       begin(size_type __n)        {return __table_.begin(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    local_iterator       end(size_type __n)          {return __table_.end(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator begin(size_type __n) const  {return __table_.cbegin(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator end(size_type __n) const    {return __table_.cend(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator cbegin(size_type __n) const {return __table_.cbegin(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator cend(size_type __n) const   {return __table_.cend(__n);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    float load_factor() const _NOEXCEPT {return __table_.load_factor();}
+    _LIBCPP_INLINE_VISIBILITY
+    float max_load_factor() const _NOEXCEPT {return __table_.max_load_factor();}
+    _LIBCPP_INLINE_VISIBILITY
+    void max_load_factor(float __mlf) {__table_.max_load_factor(__mlf);}
+    _LIBCPP_INLINE_VISIBILITY
+    void rehash(size_type __n) {__table_.__rehash_multi(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    void reserve(size_type __n) {__table_.__reserve_multi(__n);}
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+    bool __dereferenceable(const const_iterator* __i) const
+        {return __table_.__dereferenceable(_VSTD::addressof(__i->__i_));}
+    bool __decrementable(const const_iterator* __i) const
+        {return __table_.__decrementable(_VSTD::addressof(__i->__i_));}
+    bool __addable(const const_iterator* __i, ptrdiff_t __n) const
+        {return __table_.__addable(_VSTD::addressof(__i->__i_), __n);}
+    bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const
+        {return __table_.__addable(_VSTD::addressof(__i->__i_), __n);}
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+
+};
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator,
+         class _Hash = hash<__iter_key_type<_InputIterator>>,
+         class _Pred = equal_to<__iter_key_type<_InputIterator>>,
+         class _Allocator = allocator<__iter_to_alloc_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<!__is_allocator<_Pred>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multimap(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type = 0,
+                   _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
+  -> unordered_multimap<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>, _Hash, _Pred, _Allocator>;
+
+template<class _Key, class _Tp, class _Hash = hash<remove_const_t<_Key>>,
+         class _Pred = equal_to<remove_const_t<_Key>>,
+         class _Allocator = allocator<pair<const _Key, _Tp>>,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<!__is_allocator<_Pred>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multimap(initializer_list<pair<_Key, _Tp>>, typename allocator_traits<_Allocator>::size_type = 0,
+                   _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
+  -> unordered_multimap<remove_const_t<_Key>, _Tp, _Hash, _Pred, _Allocator>;
+
+template<class _InputIterator, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multimap(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type, _Allocator)
+  -> unordered_multimap<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>,
+                        hash<__iter_key_type<_InputIterator>>, equal_to<__iter_key_type<_InputIterator>>, _Allocator>;
+
+template<class _InputIterator, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multimap(_InputIterator, _InputIterator, _Allocator)
+  -> unordered_multimap<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>,
+                        hash<__iter_key_type<_InputIterator>>, equal_to<__iter_key_type<_InputIterator>>, _Allocator>;
+
+template<class _InputIterator, class _Hash, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multimap(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type, _Hash, _Allocator)
+  -> unordered_multimap<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>,
+                        _Hash, equal_to<__iter_key_type<_InputIterator>>, _Allocator>;
+
+template<class _Key, class _Tp, class _Allocator,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multimap(initializer_list<pair<_Key, _Tp>>, typename allocator_traits<_Allocator>::size_type, _Allocator)
+  -> unordered_multimap<remove_const_t<_Key>, _Tp,
+                        hash<remove_const_t<_Key>>,
+                        equal_to<remove_const_t<_Key>>, _Allocator>;
+
+template<class _Key, class _Tp, class _Allocator,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multimap(initializer_list<pair<_Key, _Tp>>, _Allocator)
+  -> unordered_multimap<remove_const_t<_Key>, _Tp,
+                        hash<remove_const_t<_Key>>,
+                        equal_to<remove_const_t<_Key>>, _Allocator>;
+
+template<class _Key, class _Tp, class _Hash, class _Allocator,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multimap(initializer_list<pair<_Key, _Tp>>, typename allocator_traits<_Allocator>::size_type, _Hash, _Allocator)
+  -> unordered_multimap<remove_const_t<_Key>, _Tp, _Hash,
+                        equal_to<remove_const_t<_Key>>, _Allocator>;
+#endif
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        size_type __n, const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__n);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        size_type __n, const hasher& __hf, const key_equal& __eql,
+        const allocator_type& __a)
+    : __table_(__hf, __eql, typename __table::allocator_type(__a))
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__n);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        _InputIterator __first, _InputIterator __last)
+{
+    _VSTD::__debug_db_insert_c(this);
+    insert(__first, __last);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__n);
+    insert(__first, __last);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, typename __table::allocator_type(__a))
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__n);
+    insert(__first, __last);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        const allocator_type& __a)
+    : __table_(typename __table::allocator_type(__a))
+{
+    _VSTD::__debug_db_insert_c(this);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        const unordered_multimap& __u)
+    : __table_(__u.__table_)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__u.bucket_count());
+    insert(__u.begin(), __u.end());
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        const unordered_multimap& __u, const allocator_type& __a)
+    : __table_(__u.__table_, typename __table::allocator_type(__a))
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__u.bucket_count());
+    insert(__u.begin(), __u.end());
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        unordered_multimap&& __u)
+    _NOEXCEPT_(is_nothrow_move_constructible<__table>::value)
+    : __table_(_VSTD::move(__u.__table_))
+{
+    _VSTD::__debug_db_insert_c(this);
+    std::__debug_db_swap(this, std::addressof(__u));
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        unordered_multimap&& __u, const allocator_type& __a)
+    : __table_(_VSTD::move(__u.__table_), typename __table::allocator_type(__a))
+{
+    _VSTD::__debug_db_insert_c(this);
+    if (__a != __u.get_allocator())
+    {
+        iterator __i = __u.begin();
+        while (__u.size() != 0)
+        {
+            __table_.__insert_multi(
+                __u.__table_.remove((__i++).__i_)->__value_.__move());
+        }
+    }
+    else
+        std::__debug_db_swap(this, std::addressof(__u));
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        initializer_list<value_type> __il)
+{
+    _VSTD::__debug_db_insert_c(this);
+    insert(__il.begin(), __il.end());
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        initializer_list<value_type> __il, size_type __n, const hasher& __hf,
+        const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__n);
+    insert(__il.begin(), __il.end());
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap(
+        initializer_list<value_type> __il, size_type __n, const hasher& __hf,
+        const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, typename __table::allocator_type(__a))
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__n);
+    insert(__il.begin(), __il.end());
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>&
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=(unordered_multimap&& __u)
+    _NOEXCEPT_(is_nothrow_move_assignable<__table>::value)
+{
+    __table_ = _VSTD::move(__u.__table_);
+    return *this;
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>&
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=(
+        initializer_list<value_type> __il)
+{
+    __table_.__assign_multi(__il.begin(), __il.end());
+    return *this;
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+inline
+void
+unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
+                                                            _InputIterator __last)
+{
+    for (; __first != __last; ++__first)
+        __table_.__insert_multi(*__first);
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
+     unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc,
+          class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY
+    typename unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::size_type
+    erase_if(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __c,
+             _Predicate __pred) {
+  return _VSTD::__libcpp_erase_if_container(__c, __pred);
+}
+#endif
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
+           const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
+{
+    if (__x.size() != __y.size())
+        return false;
+    typedef typename unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator
+                                                                 const_iterator;
+    typedef pair<const_iterator, const_iterator> _EqRng;
+    for (const_iterator __i = __x.begin(), __ex = __x.end(); __i != __ex;)
+    {
+        _EqRng __xeq = __x.equal_range(__i->first);
+        _EqRng __yeq = __y.equal_range(__i->first);
+        if (_VSTD::distance(__xeq.first, __xeq.second) !=
+            _VSTD::distance(__yeq.first, __yeq.second) ||
+                  !_VSTD::is_permutation(__xeq.first, __xeq.second, __yeq.first))
+            return false;
+        __i = __xeq.second;
+    }
+    return true;
+}
+
+template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
+           const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
+{
+    return !(__x == __y);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+_LIBCPP_BEGIN_NAMESPACE_STD
+namespace pmr {
+template <class _KeyT, class _ValueT, class _HashT = std::hash<_KeyT>, class _PredT = std::equal_to<_KeyT>>
+using unordered_map =
+    std::unordered_map<_KeyT, _ValueT, _HashT, _PredT, polymorphic_allocator<std::pair<const _KeyT, _ValueT>>>;
+
+template <class _KeyT, class _ValueT, class _HashT = std::hash<_KeyT>, class _PredT = std::equal_to<_KeyT>>
+using unordered_multimap =
+    std::unordered_multimap<_KeyT, _ValueT, _HashT, _PredT, polymorphic_allocator<std::pair<const _KeyT, _ValueT>>>;
+} // namespace pmr
+_LIBCPP_END_NAMESPACE_STD
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <algorithm>
+#  include <bit>
+#  include <concepts>
+#  include <iterator>
+#endif
+
+#endif // _LIBCPP_UNORDERED_MAP
diff --git a/app/src/main/cpp/libcxx/include/unordered_set b/app/src/main/cpp/libcxx/include/unordered_set
new file mode 100644
index 0000000..b4203c0
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/unordered_set
@@ -0,0 +1,1824 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_UNORDERED_SET
+#define _LIBCPP_UNORDERED_SET
+
+/*
+
+    unordered_set synopsis
+
+#include <initializer_list>
+
+namespace std
+{
+
+template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
+          class Alloc = allocator<Value>>
+class unordered_set
+{
+public:
+    // types
+    typedef Value                                                      key_type;
+    typedef key_type                                                   value_type;
+    typedef Hash                                                       hasher;
+    typedef Pred                                                       key_equal;
+    typedef Alloc                                                      allocator_type;
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+    typedef typename allocator_traits<allocator_type>::pointer         pointer;
+    typedef typename allocator_traits<allocator_type>::const_pointer   const_pointer;
+    typedef typename allocator_traits<allocator_type>::size_type       size_type;
+    typedef typename allocator_traits<allocator_type>::difference_type difference_type;
+
+    typedef /unspecified/ iterator;
+    typedef /unspecified/ const_iterator;
+    typedef /unspecified/ local_iterator;
+    typedef /unspecified/ const_local_iterator;
+
+    typedef unspecified node_type unspecified;                            // C++17
+    typedef INSERT_RETURN_TYPE<iterator, node_type> insert_return_type;   // C++17
+
+    unordered_set()
+        noexcept(
+            is_nothrow_default_constructible<hasher>::value &&
+            is_nothrow_default_constructible<key_equal>::value &&
+            is_nothrow_default_constructible<allocator_type>::value);
+    explicit unordered_set(size_type n, const hasher& hf = hasher(),
+                           const key_equal& eql = key_equal(),
+                           const allocator_type& a = allocator_type());
+    template <class InputIterator>
+        unordered_set(InputIterator f, InputIterator l,
+                      size_type n = 0, const hasher& hf = hasher(),
+                      const key_equal& eql = key_equal(),
+                      const allocator_type& a = allocator_type());
+    explicit unordered_set(const allocator_type&);
+    unordered_set(const unordered_set&);
+    unordered_set(const unordered_set&, const Allocator&);
+    unordered_set(unordered_set&&)
+        noexcept(
+            is_nothrow_move_constructible<hasher>::value &&
+            is_nothrow_move_constructible<key_equal>::value &&
+            is_nothrow_move_constructible<allocator_type>::value);
+    unordered_set(unordered_set&&, const Allocator&);
+    unordered_set(initializer_list<value_type>, size_type n = 0,
+                  const hasher& hf = hasher(), const key_equal& eql = key_equal(),
+                  const allocator_type& a = allocator_type());
+    unordered_set(size_type n, const allocator_type& a); // C++14
+    unordered_set(size_type n, const hasher& hf, const allocator_type& a); // C++14
+    template <class InputIterator>
+      unordered_set(InputIterator f, InputIterator l, size_type n, const allocator_type& a); // C++14
+    template <class InputIterator>
+      unordered_set(InputIterator f, InputIterator l, size_type n,
+                    const hasher& hf,  const allocator_type& a); // C++14
+    unordered_set(initializer_list<value_type> il, size_type n, const allocator_type& a); // C++14
+    unordered_set(initializer_list<value_type> il, size_type n,
+                  const hasher& hf,  const allocator_type& a); // C++14
+    ~unordered_set();
+    unordered_set& operator=(const unordered_set&);
+    unordered_set& operator=(unordered_set&&)
+        noexcept(
+            allocator_type::propagate_on_container_move_assignment::value &&
+            is_nothrow_move_assignable<allocator_type>::value &&
+            is_nothrow_move_assignable<hasher>::value &&
+            is_nothrow_move_assignable<key_equal>::value);
+    unordered_set& operator=(initializer_list<value_type>);
+
+    allocator_type get_allocator() const noexcept;
+
+    bool      empty() const noexcept;
+    size_type size() const noexcept;
+    size_type max_size() const noexcept;
+
+    iterator       begin() noexcept;
+    iterator       end() noexcept;
+    const_iterator begin()  const noexcept;
+    const_iterator end()    const noexcept;
+    const_iterator cbegin() const noexcept;
+    const_iterator cend()   const noexcept;
+
+    template <class... Args>
+        pair<iterator, bool> emplace(Args&&... args);
+    template <class... Args>
+        iterator emplace_hint(const_iterator position, Args&&... args);
+    pair<iterator, bool> insert(const value_type& obj);
+    pair<iterator, bool> insert(value_type&& obj);
+    iterator insert(const_iterator hint, const value_type& obj);
+    iterator insert(const_iterator hint, value_type&& obj);
+    template <class InputIterator>
+        void insert(InputIterator first, InputIterator last);
+    void insert(initializer_list<value_type>);
+
+    node_type extract(const_iterator position);                       // C++17
+    node_type extract(const key_type& x);                             // C++17
+    insert_return_type insert(node_type&& nh);                        // C++17
+    iterator           insert(const_iterator hint, node_type&& nh);   // C++17
+
+    iterator erase(const_iterator position);
+    iterator erase(iterator position);  // C++14
+    size_type erase(const key_type& k);
+    iterator erase(const_iterator first, const_iterator last);
+    void clear() noexcept;
+
+    template<class H2, class P2>
+      void merge(unordered_set<Key, H2, P2, Allocator>& source);         // C++17
+    template<class H2, class P2>
+      void merge(unordered_set<Key, H2, P2, Allocator>&& source);        // C++17
+    template<class H2, class P2>
+      void merge(unordered_multiset<Key, H2, P2, Allocator>& source);    // C++17
+    template<class H2, class P2>
+      void merge(unordered_multiset<Key, H2, P2, Allocator>&& source);   // C++17
+
+    void swap(unordered_set&)
+       noexcept(allocator_traits<Allocator>::is_always_equal::value &&
+                 noexcept(swap(declval<hasher&>(), declval<hasher&>())) &&
+                 noexcept(swap(declval<key_equal&>(), declval<key_equal&>()))); // C++17
+
+    hasher hash_function() const;
+    key_equal key_eq() const;
+
+    iterator       find(const key_type& k);
+    const_iterator find(const key_type& k) const;
+    template<typename K>
+        iterator find(const K& x);              // C++20
+    template<typename K>
+        const_iterator find(const K& x) const;  // C++20
+    size_type count(const key_type& k) const;
+    template<typename K>
+        size_type count(const K& k) const; // C++20
+    bool contains(const key_type& k) const; // C++20
+    template<typename K>
+        bool contains(const K& k) const; // C++20
+    pair<iterator, iterator>             equal_range(const key_type& k);
+    pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
+    template<typename K>
+        pair<iterator, iterator>             equal_range(const K& k); // C++20
+    template<typename K>
+        pair<const_iterator, const_iterator> equal_range(const K& k) const; // C++20
+
+    size_type bucket_count() const noexcept;
+    size_type max_bucket_count() const noexcept;
+
+    size_type bucket_size(size_type n) const;
+    size_type bucket(const key_type& k) const;
+
+    local_iterator       begin(size_type n);
+    local_iterator       end(size_type n);
+    const_local_iterator begin(size_type n) const;
+    const_local_iterator end(size_type n) const;
+    const_local_iterator cbegin(size_type n) const;
+    const_local_iterator cend(size_type n) const;
+
+    float load_factor() const noexcept;
+    float max_load_factor() const noexcept;
+    void max_load_factor(float z);
+    void rehash(size_type n);
+    void reserve(size_type n);
+};
+
+template<class InputIterator,
+    class Hash = hash<typename iterator_traits<InputIterator>::value_type>,
+    class Pred = equal_to<typename iterator_traits<InputIterator>::value_type>,
+    class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
+unordered_set(InputIterator, InputIterator, typename see below::size_type = see below,
+    Hash = Hash(), Pred = Pred(), Allocator = Allocator())
+  -> unordered_set<typename iterator_traits<InputIterator>::value_type,
+        Hash, Pred, Allocator>; // C++17
+
+template<class T, class Hash = hash<T>,
+          class Pred = equal_to<T>, class Allocator = allocator<T>>
+unordered_set(initializer_list<T>, typename see below::size_type = see below,
+    Hash = Hash(), Pred = Pred(), Allocator = Allocator())
+  -> unordered_set<T, Hash, Pred, Allocator>; // C++17
+
+template<class InputIterator,  class Allocator>
+unordered_set(InputIterator, InputIterator, typename see below::size_type, Allocator)
+  -> unordered_set<typename iterator_traits<InputIterator>::value_type,
+        hash<typename iterator_traits<InputIterator>::value_type>,
+        equal_to<typename iterator_traits<InputIterator>::value_type>,
+        Allocator>; // C++17
+
+template<class InputIterator, class Hash, class Allocator>
+unordered_set(InputIterator, InputIterator, typename see below::size_type,
+    Hash, Allocator)
+  -> unordered_set<typename iterator_traits<InputIterator>::value_type, Hash,
+        equal_to<typename iterator_traits<InputIterator>::value_type>,
+        Allocator>; // C++17
+
+template<class T, class Allocator>
+unordered_set(initializer_list<T>, typename see below::size_type, Allocator)
+  -> unordered_set<T, hash<T>, equal_to<T>, Allocator>; // C++17
+
+template<class T, class Hash, class Allocator>
+unordered_set(initializer_list<T>, typename see below::size_type, Hash, Allocator)
+  -> unordered_set<T, Hash, equal_to<T>, Allocator>; // C++17
+
+template <class Value, class Hash, class Pred, class Alloc>
+    void swap(unordered_set<Value, Hash, Pred, Alloc>& x,
+              unordered_set<Value, Hash, Pred, Alloc>& y)
+              noexcept(noexcept(x.swap(y)));
+
+template <class Value, class Hash, class Pred, class Alloc>
+    bool
+    operator==(const unordered_set<Value, Hash, Pred, Alloc>& x,
+               const unordered_set<Value, Hash, Pred, Alloc>& y);
+
+template <class Value, class Hash, class Pred, class Alloc>
+    bool
+    operator!=(const unordered_set<Value, Hash, Pred, Alloc>& x,
+               const unordered_set<Value, Hash, Pred, Alloc>& y);
+
+template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
+          class Alloc = allocator<Value>>
+class unordered_multiset
+{
+public:
+    // types
+    typedef Value                                                      key_type;
+    typedef key_type                                                   value_type;
+    typedef Hash                                                       hasher;
+    typedef Pred                                                       key_equal;
+    typedef Alloc                                                      allocator_type;
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+    typedef typename allocator_traits<allocator_type>::pointer         pointer;
+    typedef typename allocator_traits<allocator_type>::const_pointer   const_pointer;
+    typedef typename allocator_traits<allocator_type>::size_type       size_type;
+    typedef typename allocator_traits<allocator_type>::difference_type difference_type;
+
+    typedef /unspecified/ iterator;
+    typedef /unspecified/ const_iterator;
+    typedef /unspecified/ local_iterator;
+    typedef /unspecified/ const_local_iterator;
+
+    typedef unspecified node_type unspecified;   // C++17
+
+    unordered_multiset()
+        noexcept(
+            is_nothrow_default_constructible<hasher>::value &&
+            is_nothrow_default_constructible<key_equal>::value &&
+            is_nothrow_default_constructible<allocator_type>::value);
+    explicit unordered_multiset(size_type n, const hasher& hf = hasher(),
+                           const key_equal& eql = key_equal(),
+                           const allocator_type& a = allocator_type());
+    template <class InputIterator>
+        unordered_multiset(InputIterator f, InputIterator l,
+                      size_type n = 0, const hasher& hf = hasher(),
+                      const key_equal& eql = key_equal(),
+                      const allocator_type& a = allocator_type());
+    explicit unordered_multiset(const allocator_type&);
+    unordered_multiset(const unordered_multiset&);
+    unordered_multiset(const unordered_multiset&, const Allocator&);
+    unordered_multiset(unordered_multiset&&)
+        noexcept(
+            is_nothrow_move_constructible<hasher>::value &&
+            is_nothrow_move_constructible<key_equal>::value &&
+            is_nothrow_move_constructible<allocator_type>::value);
+    unordered_multiset(unordered_multiset&&, const Allocator&);
+    unordered_multiset(initializer_list<value_type>, size_type n = /see below/,
+                  const hasher& hf = hasher(), const key_equal& eql = key_equal(),
+                  const allocator_type& a = allocator_type());
+    unordered_multiset(size_type n, const allocator_type& a); // C++14
+    unordered_multiset(size_type n, const hasher& hf, const allocator_type& a); // C++14
+    template <class InputIterator>
+      unordered_multiset(InputIterator f, InputIterator l, size_type n, const allocator_type& a); // C++14
+    template <class InputIterator>
+      unordered_multiset(InputIterator f, InputIterator l, size_type n,
+                         const hasher& hf, const allocator_type& a); // C++14
+    unordered_multiset(initializer_list<value_type> il, size_type n, const allocator_type& a); // C++14
+    unordered_multiset(initializer_list<value_type> il, size_type n,
+                       const hasher& hf,  const allocator_type& a); // C++14
+    ~unordered_multiset();
+    unordered_multiset& operator=(const unordered_multiset&);
+    unordered_multiset& operator=(unordered_multiset&&)
+        noexcept(
+            allocator_type::propagate_on_container_move_assignment::value &&
+            is_nothrow_move_assignable<allocator_type>::value &&
+            is_nothrow_move_assignable<hasher>::value &&
+            is_nothrow_move_assignable<key_equal>::value);
+    unordered_multiset& operator=(initializer_list<value_type>);
+
+    allocator_type get_allocator() const noexcept;
+
+    bool      empty() const noexcept;
+    size_type size() const noexcept;
+    size_type max_size() const noexcept;
+
+    iterator       begin() noexcept;
+    iterator       end() noexcept;
+    const_iterator begin()  const noexcept;
+    const_iterator end()    const noexcept;
+    const_iterator cbegin() const noexcept;
+    const_iterator cend()   const noexcept;
+
+    template <class... Args>
+        iterator emplace(Args&&... args);
+    template <class... Args>
+        iterator emplace_hint(const_iterator position, Args&&... args);
+    iterator insert(const value_type& obj);
+    iterator insert(value_type&& obj);
+    iterator insert(const_iterator hint, const value_type& obj);
+    iterator insert(const_iterator hint, value_type&& obj);
+    template <class InputIterator>
+        void insert(InputIterator first, InputIterator last);
+    void insert(initializer_list<value_type>);
+
+    node_type extract(const_iterator position);             // C++17
+    node_type extract(const key_type& x);                   // C++17
+    iterator insert(node_type&& nh);                        // C++17
+    iterator insert(const_iterator hint, node_type&& nh);   // C++17
+
+    iterator erase(const_iterator position);
+    iterator erase(iterator position);  // C++14
+    size_type erase(const key_type& k);
+    iterator erase(const_iterator first, const_iterator last);
+    void clear() noexcept;
+
+    template<class H2, class P2>
+      void merge(unordered_multiset<Key, H2, P2, Allocator>& source);    // C++17
+    template<class H2, class P2>
+      void merge(unordered_multiset<Key, H2, P2, Allocator>&& source);   // C++17
+    template<class H2, class P2>
+      void merge(unordered_set<Key, H2, P2, Allocator>& source);         // C++17
+    template<class H2, class P2>
+      void merge(unordered_set<Key, H2, P2, Allocator>&& source);        // C++17
+
+    void swap(unordered_multiset&)
+       noexcept(allocator_traits<Allocator>::is_always_equal::value &&
+                 noexcept(swap(declval<hasher&>(), declval<hasher&>())) &&
+                 noexcept(swap(declval<key_equal&>(), declval<key_equal&>()))); // C++17
+
+    hasher hash_function() const;
+    key_equal key_eq() const;
+
+    iterator       find(const key_type& k);
+    const_iterator find(const key_type& k) const;
+    template<typename K>
+        iterator find(const K& x);              // C++20
+    template<typename K>
+        const_iterator find(const K& x) const;  // C++20
+    size_type count(const key_type& k) const;
+    template<typename K>
+        size_type count(const K& k) const; // C++20
+    bool contains(const key_type& k) const; // C++20
+    template<typename K>
+        bool contains(const K& k) const; // C++20
+    pair<iterator, iterator>             equal_range(const key_type& k);
+    pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
+    template<typename K>
+        pair<iterator, iterator>             equal_range(const K& k); // C++20
+    template<typename K>
+        pair<const_iterator, const_iterator> equal_range(const K& k) const; // C++20
+
+    size_type bucket_count() const noexcept;
+    size_type max_bucket_count() const noexcept;
+
+    size_type bucket_size(size_type n) const;
+    size_type bucket(const key_type& k) const;
+
+    local_iterator       begin(size_type n);
+    local_iterator       end(size_type n);
+    const_local_iterator begin(size_type n) const;
+    const_local_iterator end(size_type n) const;
+    const_local_iterator cbegin(size_type n) const;
+    const_local_iterator cend(size_type n) const;
+
+    float load_factor() const noexcept;
+    float max_load_factor() const noexcept;
+    void max_load_factor(float z);
+    void rehash(size_type n);
+    void reserve(size_type n);
+};
+
+template<class InputIterator,
+    class Hash = hash<typename iterator_traits<InputIterator>::value_type>,
+    class Pred = equal_to<typename iterator_traits<InputIterator>::value_type>,
+    class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
+unordered_multiset(InputIterator, InputIterator, see below::size_type = see below,
+    Hash = Hash(), Pred = Pred(), Allocator = Allocator())
+  -> unordered_multiset<typename iterator_traits<InputIterator>::value_type,
+        Hash, Pred, Allocator>; // C++17
+
+template<class T, class Hash = hash<T>,
+          class Pred = equal_to<T>, class Allocator = allocator<T>>
+unordered_multiset(initializer_list<T>, typename see below::size_type = see below,
+    Hash = Hash(), Pred = Pred(), Allocator = Allocator())
+  -> unordered_multiset<T, Hash, Pred, Allocator>; // C++17
+
+template<class InputIterator,  class Allocator>
+unordered_multiset(InputIterator, InputIterator, typename see below::size_type, Allocator)
+  -> unordered_multiset<typename iterator_traits<InputIterator>::value_type,
+        hash<typename iterator_traits<InputIterator>::value_type>,
+        equal_to<typename iterator_traits<InputIterator>::value_type>,
+        Allocator>; // C++17
+
+template<class InputIterator,  class Hash, class Allocator>
+unordered_multiset(InputIterator, InputIterator, typename see below::size_type,
+    Hash, Allocator)
+  -> unordered_multiset<typename iterator_traits<InputIterator>::value_type, Hash,
+        equal_to<typename iterator_traits<InputIterator>::value_type>, Allocator>; // C++17
+
+template<class T, class Allocator>
+unordered_multiset(initializer_list<T>, typename see below::size_type, Allocator)
+  -> unordered_multiset<T, hash<T>, equal_to<T>, Allocator>; // C++17
+
+template<class T, class Hash, class Allocator>
+unordered_multiset(initializer_list<T>, typename see below::size_type, Hash, Allocator)
+  -> unordered_multiset<T, Hash, equal_to<T>, Allocator>; // C++17
+
+template <class Value, class Hash, class Pred, class Alloc>
+    void swap(unordered_multiset<Value, Hash, Pred, Alloc>& x,
+              unordered_multiset<Value, Hash, Pred, Alloc>& y)
+              noexcept(noexcept(x.swap(y)));
+
+template <class K, class T, class H, class P, class A, class Predicate>
+    typename unordered_set<K, T, H, P, A>::size_type
+    erase_if(unordered_set<K, T, H, P, A>& c, Predicate pred);       // C++20
+
+template <class K, class T, class H, class P, class A, class Predicate>
+    typename unordered_multiset<K, T, H, P, A>::size_type
+    erase_if(unordered_multiset<K, T, H, P, A>& c, Predicate pred);  // C++20
+
+
+template <class Value, class Hash, class Pred, class Alloc>
+    bool
+    operator==(const unordered_multiset<Value, Hash, Pred, Alloc>& x,
+               const unordered_multiset<Value, Hash, Pred, Alloc>& y);
+
+template <class Value, class Hash, class Pred, class Alloc>
+    bool
+    operator!=(const unordered_multiset<Value, Hash, Pred, Alloc>& x,
+               const unordered_multiset<Value, Hash, Pred, Alloc>& y);
+}  // std
+
+*/
+
+#include <__algorithm/is_permutation.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__debug>
+#include <__functional/is_transparent.h>
+#include <__functional/operations.h>
+#include <__hash_table>
+#include <__iterator/distance.h>
+#include <__iterator/erase_if_container.h>
+#include <__iterator/iterator_traits.h>
+#include <__memory/addressof.h>
+#include <__memory/allocator.h>
+#include <__memory_resource/polymorphic_allocator.h>
+#include <__node_handle>
+#include <__type_traits/is_allocator.h>
+#include <__utility/forward.h>
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+// [unord.set.syn]
+#include <compare>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+class unordered_multiset;
+
+template <class _Value, class _Hash = hash<_Value>, class _Pred = equal_to<_Value>,
+          class _Alloc = allocator<_Value> >
+class _LIBCPP_TEMPLATE_VIS unordered_set
+{
+public:
+    // types
+    typedef _Value                                                     key_type;
+    typedef key_type                                                   value_type;
+    typedef __type_identity_t<_Hash>                                   hasher;
+    typedef __type_identity_t<_Pred>                                   key_equal;
+    typedef __type_identity_t<_Alloc>                                  allocator_type;
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+    static_assert((is_same<value_type, typename allocator_type::value_type>::value),
+                  "Invalid allocator::value_type");
+
+    static_assert(is_same<allocator_type, __rebind_alloc<allocator_traits<allocator_type>, value_type> >::value,
+                  "[allocator.requirements] states that rebinding an allocator to the same type should result in the "
+                  "original allocator");
+
+  private:
+    typedef __hash_table<value_type, hasher, key_equal, allocator_type> __table;
+
+    __table __table_;
+
+public:
+    typedef typename __table::pointer         pointer;
+    typedef typename __table::const_pointer   const_pointer;
+    typedef typename __table::size_type       size_type;
+    typedef typename __table::difference_type difference_type;
+
+    typedef typename __table::const_iterator       iterator;
+    typedef typename __table::const_iterator       const_iterator;
+    typedef typename __table::const_local_iterator local_iterator;
+    typedef typename __table::const_local_iterator const_local_iterator;
+
+#if _LIBCPP_STD_VER > 14
+    typedef __set_node_handle<typename __table::__node, allocator_type> node_type;
+    typedef __insert_return_type<iterator, node_type> insert_return_type;
+#endif
+
+    template <class _Value2, class _Hash2, class _Pred2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS unordered_set;
+    template <class _Value2, class _Hash2, class _Pred2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS unordered_multiset;
+
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_set()
+        _NOEXCEPT_(is_nothrow_default_constructible<__table>::value)
+    {
+        _VSTD::__debug_db_insert_c(this);
+    }
+    explicit unordered_set(size_type __n, const hasher& __hf = hasher(),
+                           const key_equal& __eql = key_equal());
+#if _LIBCPP_STD_VER > 11
+    inline _LIBCPP_INLINE_VISIBILITY
+    unordered_set(size_type __n, const allocator_type& __a)
+        : unordered_set(__n, hasher(), key_equal(), __a) {}
+    inline _LIBCPP_INLINE_VISIBILITY
+    unordered_set(size_type __n, const hasher& __hf, const allocator_type& __a)
+        : unordered_set(__n, __hf, key_equal(), __a) {}
+#endif
+    unordered_set(size_type __n, const hasher& __hf, const key_equal& __eql,
+                  const allocator_type& __a);
+    template <class _InputIterator>
+        unordered_set(_InputIterator __first, _InputIterator __last);
+    template <class _InputIterator>
+        unordered_set(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf = hasher(),
+                      const key_equal& __eql = key_equal());
+    template <class _InputIterator>
+        unordered_set(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf, const key_equal& __eql,
+                      const allocator_type& __a);
+#if _LIBCPP_STD_VER > 11
+    template <class _InputIterator>
+    inline _LIBCPP_INLINE_VISIBILITY
+        unordered_set(_InputIterator __first, _InputIterator __last,
+                    size_type __n, const allocator_type& __a)
+            : unordered_set(__first, __last, __n, hasher(), key_equal(), __a) {}
+    template <class _InputIterator>
+        unordered_set(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf, const allocator_type& __a)
+            : unordered_set(__first, __last, __n, __hf, key_equal(), __a) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit unordered_set(const allocator_type& __a);
+    unordered_set(const unordered_set& __u);
+    unordered_set(const unordered_set& __u, const allocator_type& __a);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_set(unordered_set&& __u)
+        _NOEXCEPT_(is_nothrow_move_constructible<__table>::value);
+    unordered_set(unordered_set&& __u, const allocator_type& __a);
+    unordered_set(initializer_list<value_type> __il);
+    unordered_set(initializer_list<value_type> __il, size_type __n,
+                  const hasher& __hf = hasher(),
+                  const key_equal& __eql = key_equal());
+    unordered_set(initializer_list<value_type> __il, size_type __n,
+                  const hasher& __hf, const key_equal& __eql,
+                  const allocator_type& __a);
+#if _LIBCPP_STD_VER > 11
+    inline _LIBCPP_INLINE_VISIBILITY
+    unordered_set(initializer_list<value_type> __il, size_type __n,
+                                                      const allocator_type& __a)
+        : unordered_set(__il, __n, hasher(), key_equal(), __a) {}
+    inline _LIBCPP_INLINE_VISIBILITY
+    unordered_set(initializer_list<value_type> __il, size_type __n,
+                                  const hasher& __hf, const allocator_type& __a)
+        : unordered_set(__il, __n, __hf, key_equal(), __a) {}
+#endif
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    ~unordered_set() {
+        static_assert(sizeof(std::__diagnose_unordered_container_requirements<_Value, _Hash, _Pred>(0)), "");
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_set& operator=(const unordered_set& __u)
+    {
+        __table_ = __u.__table_;
+        return *this;
+    }
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_set& operator=(unordered_set&& __u)
+        _NOEXCEPT_(is_nothrow_move_assignable<__table>::value);
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_set& operator=(initializer_list<value_type> __il);
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const _NOEXCEPT
+        {return allocator_type(__table_.__node_alloc());}
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool      empty() const _NOEXCEPT {return __table_.size() == 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const _NOEXCEPT  {return __table_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT {return __table_.max_size();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       begin() _NOEXCEPT        {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       end() _NOEXCEPT          {return __table_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin()  const _NOEXCEPT {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end()    const _NOEXCEPT {return __table_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbegin() const _NOEXCEPT {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cend()   const _NOEXCEPT {return __table_.end();}
+
+#ifndef _LIBCPP_CXX03_LANG
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        pair<iterator, bool> emplace(_Args&&... __args)
+            {return __table_.__emplace_unique(_VSTD::forward<_Args>(__args)...);}
+    template <class... _Args>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator emplace_hint(const_iterator __p, _Args&&... __args) {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(std::addressof(__p)) == this,
+            "unordered_set::emplace_hint(const_iterator, args...) called with an iterator not"
+            " referring to this unordered_set");
+        (void)__p;
+        return __table_.__emplace_unique(std::forward<_Args>(__args)...).first;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> insert(value_type&& __x)
+        {return __table_.__insert_unique(_VSTD::move(__x));}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, value_type&& __x) {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(std::addressof(__p)) == this,
+            "unordered_set::insert(const_iterator, value_type&&) called with an iterator not"
+            " referring to this unordered_set");
+        (void)__p;
+        return insert(std::move(__x)).first;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void insert(initializer_list<value_type> __il)
+        {insert(__il.begin(), __il.end());}
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, bool> insert(const value_type& __x)
+        {return __table_.__insert_unique(__x);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, const value_type& __x) {
+        _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(std::addressof(__p)) == this,
+            "unordered_set::insert(const_iterator, const value_type&) called with an iterator not"
+            " referring to this unordered_set");
+        (void)__p;
+        return insert(__x).first;
+    }
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        void insert(_InputIterator __first, _InputIterator __last);
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(const_iterator __p) {return __table_.erase(__p);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(const_iterator __first, const_iterator __last)
+        {return __table_.erase(__first, __last);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() _NOEXCEPT {__table_.clear();}
+
+#if _LIBCPP_STD_VER > 14
+    _LIBCPP_INLINE_VISIBILITY
+    insert_return_type insert(node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to unordered_set::insert()");
+        return __table_.template __node_handle_insert_unique<
+            node_type, insert_return_type>(_VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __h, node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to unordered_set::insert()");
+        return __table_.template __node_handle_insert_unique<node_type>(
+            __h, _VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(key_type const& __key)
+    {
+        return __table_.template __node_handle_extract<node_type>(__key);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(const_iterator __it)
+    {
+        return __table_.template __node_handle_extract<node_type>(__it);
+    }
+
+    template<class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_set<key_type, _H2, _P2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __table_.__node_handle_merge_unique(__source.__table_);
+    }
+    template<class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_set<key_type, _H2, _P2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __table_.__node_handle_merge_unique(__source.__table_);
+    }
+    template<class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_multiset<key_type, _H2, _P2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __table_.__node_handle_merge_unique(__source.__table_);
+    }
+    template<class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_multiset<key_type, _H2, _P2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        __table_.__node_handle_merge_unique(__source.__table_);
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(unordered_set& __u)
+        _NOEXCEPT_(__is_nothrow_swappable<__table>::value)
+        {__table_.swap(__u.__table_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    hasher hash_function() const {return __table_.hash_function();}
+    _LIBCPP_INLINE_VISIBILITY
+    key_equal key_eq() const {return __table_.key_eq();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       find(const key_type& __k)       {return __table_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const key_type& __k) const {return __table_.find(__k);}
+#if _LIBCPP_STD_VER > 17
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       find(const _K2& __k)            {return __table_.find(__k);}
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const _K2& __k) const      {return __table_.find(__k);}
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
+#if _LIBCPP_STD_VER > 17
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    size_type count(const _K2& __k) const      {return __table_.__count_unique(__k);}
+#endif // _LIBCPP_STD_VER > 17
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY
+    bool contains(const key_type& __k) const {return find(__k) != end();}
+
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    bool contains(const _K2& __k) const      {return find(__k) != end();}
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, iterator>             equal_range(const key_type& __k)
+        {return __table_.__equal_range_unique(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
+        {return __table_.__equal_range_unique(__k);}
+#if _LIBCPP_STD_VER > 17
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, iterator>             equal_range(const _K2& __k)
+        {return __table_.__equal_range_unique(__k);}
+    template <class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<const_iterator, const_iterator> equal_range(const _K2& __k) const
+        {return __table_.__equal_range_unique(__k);}
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_count() const _NOEXCEPT {return __table_.bucket_count();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_bucket_count() const _NOEXCEPT {return __table_.max_bucket_count();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_size(size_type __n) const {return __table_.bucket_size(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket(const key_type& __k) const {return __table_.bucket(__k);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    local_iterator       begin(size_type __n)        {return __table_.begin(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    local_iterator       end(size_type __n)          {return __table_.end(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator begin(size_type __n) const  {return __table_.cbegin(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator end(size_type __n) const    {return __table_.cend(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator cbegin(size_type __n) const {return __table_.cbegin(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator cend(size_type __n) const   {return __table_.cend(__n);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    float load_factor() const _NOEXCEPT {return __table_.load_factor();}
+    _LIBCPP_INLINE_VISIBILITY
+    float max_load_factor() const _NOEXCEPT {return __table_.max_load_factor();}
+    _LIBCPP_INLINE_VISIBILITY
+    void max_load_factor(float __mlf) {__table_.max_load_factor(__mlf);}
+    _LIBCPP_INLINE_VISIBILITY
+    void rehash(size_type __n) {__table_.__rehash_unique(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    void reserve(size_type __n) {__table_.__reserve_unique(__n);}
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+    bool __dereferenceable(const const_iterator* __i) const
+        {return __table_.__dereferenceable(__i);}
+    bool __decrementable(const const_iterator* __i) const
+        {return __table_.__decrementable(__i);}
+    bool __addable(const const_iterator* __i, ptrdiff_t __n) const
+        {return __table_.__addable(__i, __n);}
+    bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const
+        {return __table_.__addable(__i, __n);}
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+};
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator,
+         class _Hash = hash<__iter_value_type<_InputIterator>>,
+         class _Pred = equal_to<__iter_value_type<_InputIterator>>,
+         class _Allocator = allocator<__iter_value_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<!__is_allocator<_Pred>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_set(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type = 0,
+              _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
+  -> unordered_set<__iter_value_type<_InputIterator>, _Hash, _Pred, _Allocator>;
+
+template<class _Tp, class _Hash = hash<_Tp>,
+         class _Pred = equal_to<_Tp>,
+         class _Allocator = allocator<_Tp>,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<!__is_allocator<_Pred>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_set(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type = 0,
+              _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
+  -> unordered_set<_Tp, _Hash, _Pred, _Allocator>;
+
+template<class _InputIterator, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_set(_InputIterator, _InputIterator,
+              typename allocator_traits<_Allocator>::size_type, _Allocator)
+  -> unordered_set<__iter_value_type<_InputIterator>,
+                   hash<__iter_value_type<_InputIterator>>,
+                   equal_to<__iter_value_type<_InputIterator>>,
+                   _Allocator>;
+
+template<class _InputIterator, class _Hash, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_set(_InputIterator, _InputIterator,
+              typename allocator_traits<_Allocator>::size_type, _Hash, _Allocator)
+  -> unordered_set<__iter_value_type<_InputIterator>, _Hash,
+                   equal_to<__iter_value_type<_InputIterator>>,
+                   _Allocator>;
+
+template<class _Tp, class _Allocator,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_set(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type, _Allocator)
+  -> unordered_set<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
+
+template<class _Tp, class _Hash, class _Allocator,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_set(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type, _Hash, _Allocator)
+  -> unordered_set<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
+#endif
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n,
+        const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__n);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n,
+        const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__n);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
+        _InputIterator __first, _InputIterator __last)
+{
+    _VSTD::__debug_db_insert_c(this);
+    insert(__first, __last);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__n);
+    insert(__first, __last);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__n);
+    insert(__first, __last);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
+        const allocator_type& __a)
+    : __table_(__a)
+{
+    _VSTD::__debug_db_insert_c(this);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
+        const unordered_set& __u)
+    : __table_(__u.__table_)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__u.bucket_count());
+    insert(__u.begin(), __u.end());
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
+        const unordered_set& __u, const allocator_type& __a)
+    : __table_(__u.__table_, __a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__u.bucket_count());
+    insert(__u.begin(), __u.end());
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
+        unordered_set&& __u)
+    _NOEXCEPT_(is_nothrow_move_constructible<__table>::value)
+    : __table_(_VSTD::move(__u.__table_))
+{
+    _VSTD::__debug_db_insert_c(this);
+    std::__debug_db_swap(this, std::addressof(__u));
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
+        unordered_set&& __u, const allocator_type& __a)
+    : __table_(_VSTD::move(__u.__table_), __a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    if (__a != __u.get_allocator())
+    {
+        iterator __i = __u.begin();
+        while (__u.size() != 0)
+            __table_.__insert_unique(_VSTD::move(__u.__table_.remove(__i++)->__value_));
+    }
+    else
+        std::__debug_db_swap(this, std::addressof(__u));
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
+        initializer_list<value_type> __il)
+{
+    _VSTD::__debug_db_insert_c(this);
+    insert(__il.begin(), __il.end());
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
+        initializer_list<value_type> __il, size_type __n, const hasher& __hf,
+        const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__n);
+    insert(__il.begin(), __il.end());
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
+        initializer_list<value_type> __il, size_type __n, const hasher& __hf,
+        const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_unique(__n);
+    insert(__il.begin(), __il.end());
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_set<_Value, _Hash, _Pred, _Alloc>&
+unordered_set<_Value, _Hash, _Pred, _Alloc>::operator=(unordered_set&& __u)
+    _NOEXCEPT_(is_nothrow_move_assignable<__table>::value)
+{
+    __table_ = _VSTD::move(__u.__table_);
+    return *this;
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_set<_Value, _Hash, _Pred, _Alloc>&
+unordered_set<_Value, _Hash, _Pred, _Alloc>::operator=(
+        initializer_list<value_type> __il)
+{
+    __table_.__assign_unique(__il.begin(), __il.end());
+    return *this;
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+inline
+void
+unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
+                                                    _InputIterator __last)
+{
+    for (; __first != __last; ++__first)
+        __table_.__insert_unique(*__first);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
+     unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Value, class _Hash, class _Pred, class _Alloc,
+          class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY
+    typename unordered_set<_Value, _Hash, _Pred, _Alloc>::size_type
+    erase_if(unordered_set<_Value, _Hash, _Pred, _Alloc>& __c,
+             _Predicate __pred) {
+  return _VSTD::__libcpp_erase_if_container(__c, __pred);
+}
+#endif
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
+           const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
+{
+    if (__x.size() != __y.size())
+        return false;
+    typedef typename unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator
+                                                                 const_iterator;
+    for (const_iterator __i = __x.begin(), __ex = __x.end(), __ey = __y.end();
+            __i != __ex; ++__i)
+    {
+        const_iterator __j = __y.find(*__i);
+        if (__j == __ey || !(*__i == *__j))
+            return false;
+    }
+    return true;
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
+           const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Value, class _Hash = hash<_Value>, class _Pred = equal_to<_Value>,
+          class _Alloc = allocator<_Value> >
+class _LIBCPP_TEMPLATE_VIS unordered_multiset
+{
+public:
+    // types
+    typedef _Value                                                     key_type;
+    typedef key_type                                                   value_type;
+    typedef __type_identity_t<_Hash>                                   hasher;
+    typedef __type_identity_t<_Pred>                                   key_equal;
+    typedef __type_identity_t<_Alloc>                                  allocator_type;
+    typedef value_type&                                                reference;
+    typedef const value_type&                                          const_reference;
+    static_assert((is_same<value_type, typename allocator_type::value_type>::value),
+                  "Invalid allocator::value_type");
+
+private:
+    typedef __hash_table<value_type, hasher, key_equal, allocator_type> __table;
+
+    __table __table_;
+
+public:
+    typedef typename __table::pointer         pointer;
+    typedef typename __table::const_pointer   const_pointer;
+    typedef typename __table::size_type       size_type;
+    typedef typename __table::difference_type difference_type;
+
+    typedef typename __table::const_iterator       iterator;
+    typedef typename __table::const_iterator       const_iterator;
+    typedef typename __table::const_local_iterator local_iterator;
+    typedef typename __table::const_local_iterator const_local_iterator;
+
+#if _LIBCPP_STD_VER > 14
+    typedef __set_node_handle<typename __table::__node, allocator_type> node_type;
+#endif
+
+    template <class _Value2, class _Hash2, class _Pred2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS unordered_set;
+    template <class _Value2, class _Hash2, class _Pred2, class _Alloc2>
+        friend class _LIBCPP_TEMPLATE_VIS unordered_multiset;
+
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multiset()
+        _NOEXCEPT_(is_nothrow_default_constructible<__table>::value)
+    {
+        _VSTD::__debug_db_insert_c(this);
+    }
+    explicit unordered_multiset(size_type __n, const hasher& __hf = hasher(),
+                                const key_equal& __eql = key_equal());
+    unordered_multiset(size_type __n, const hasher& __hf,
+                       const key_equal& __eql, const allocator_type& __a);
+#if _LIBCPP_STD_VER > 11
+    inline _LIBCPP_INLINE_VISIBILITY
+    unordered_multiset(size_type __n, const allocator_type& __a)
+        : unordered_multiset(__n, hasher(), key_equal(), __a) {}
+    inline _LIBCPP_INLINE_VISIBILITY
+    unordered_multiset(size_type __n, const hasher& __hf, const allocator_type& __a)
+        : unordered_multiset(__n, __hf, key_equal(), __a) {}
+#endif
+    template <class _InputIterator>
+        unordered_multiset(_InputIterator __first, _InputIterator __last);
+    template <class _InputIterator>
+        unordered_multiset(_InputIterator __first, _InputIterator __last,
+                      size_type __n, const hasher& __hf = hasher(),
+                      const key_equal& __eql = key_equal());
+    template <class _InputIterator>
+        unordered_multiset(_InputIterator __first, _InputIterator __last,
+                      size_type __n , const hasher& __hf,
+                      const key_equal& __eql, const allocator_type& __a);
+#if _LIBCPP_STD_VER > 11
+    template <class _InputIterator>
+    inline _LIBCPP_INLINE_VISIBILITY
+    unordered_multiset(_InputIterator __first, _InputIterator __last,
+                       size_type __n, const allocator_type& __a)
+        : unordered_multiset(__first, __last, __n, hasher(), key_equal(), __a) {}
+    template <class _InputIterator>
+    inline _LIBCPP_INLINE_VISIBILITY
+    unordered_multiset(_InputIterator __first, _InputIterator __last,
+                       size_type __n, const hasher& __hf, const allocator_type& __a)
+        : unordered_multiset(__first, __last, __n, __hf, key_equal(), __a) {}
+#endif
+    _LIBCPP_INLINE_VISIBILITY
+    explicit unordered_multiset(const allocator_type& __a);
+    unordered_multiset(const unordered_multiset& __u);
+    unordered_multiset(const unordered_multiset& __u, const allocator_type& __a);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multiset(unordered_multiset&& __u)
+        _NOEXCEPT_(is_nothrow_move_constructible<__table>::value);
+    unordered_multiset(unordered_multiset&& __u, const allocator_type& __a);
+    unordered_multiset(initializer_list<value_type> __il);
+    unordered_multiset(initializer_list<value_type> __il, size_type __n,
+                       const hasher& __hf = hasher(),
+                       const key_equal& __eql = key_equal());
+    unordered_multiset(initializer_list<value_type> __il, size_type __n,
+                       const hasher& __hf, const key_equal& __eql,
+                       const allocator_type& __a);
+#if _LIBCPP_STD_VER > 11
+    inline _LIBCPP_INLINE_VISIBILITY
+    unordered_multiset(initializer_list<value_type> __il, size_type __n, const allocator_type& __a)
+      : unordered_multiset(__il, __n, hasher(), key_equal(), __a) {}
+    inline _LIBCPP_INLINE_VISIBILITY
+    unordered_multiset(initializer_list<value_type> __il, size_type __n, const hasher& __hf, const allocator_type& __a)
+      : unordered_multiset(__il, __n, __hf, key_equal(), __a) {}
+#endif
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    ~unordered_multiset() {
+        static_assert(sizeof(std::__diagnose_unordered_container_requirements<_Value, _Hash, _Pred>(0)), "");
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multiset& operator=(const unordered_multiset& __u)
+    {
+        __table_ = __u.__table_;
+        return *this;
+    }
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    unordered_multiset& operator=(unordered_multiset&& __u)
+        _NOEXCEPT_(is_nothrow_move_assignable<__table>::value);
+    unordered_multiset& operator=(initializer_list<value_type> __il);
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    allocator_type get_allocator() const _NOEXCEPT
+        {return allocator_type(__table_.__node_alloc());}
+
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
+    bool      empty() const _NOEXCEPT {return __table_.size() == 0;}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type size() const _NOEXCEPT  {return __table_.size();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_size() const _NOEXCEPT {return __table_.max_size();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       begin() _NOEXCEPT        {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       end() _NOEXCEPT          {return __table_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator begin()  const _NOEXCEPT {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator end()    const _NOEXCEPT {return __table_.end();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cbegin() const _NOEXCEPT {return __table_.begin();}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator cend()   const _NOEXCEPT {return __table_.end();}
+
+#ifndef _LIBCPP_CXX03_LANG
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator emplace(_Args&&... __args)
+            {return __table_.__emplace_multi(_VSTD::forward<_Args>(__args)...);}
+    template <class... _Args>
+        _LIBCPP_INLINE_VISIBILITY
+        iterator emplace_hint(const_iterator __p, _Args&&... __args)
+            {return __table_.__emplace_hint_multi(__p, _VSTD::forward<_Args>(__args)...);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(value_type&& __x) {return __table_.__insert_multi(_VSTD::move(__x));}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, value_type&& __x)
+        {return __table_.__insert_multi(__p, _VSTD::move(__x));}
+    _LIBCPP_INLINE_VISIBILITY
+    void insert(initializer_list<value_type> __il)
+        {insert(__il.begin(), __il.end());}
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const value_type& __x) {return __table_.__insert_multi(__x);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __p, const value_type& __x)
+        {return __table_.__insert_multi(__p, __x);}
+
+    template <class _InputIterator>
+        _LIBCPP_INLINE_VISIBILITY
+        void insert(_InputIterator __first, _InputIterator __last);
+
+#if _LIBCPP_STD_VER > 14
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to unordered_multiset::insert()");
+        return __table_.template __node_handle_insert_multi<node_type>(
+            _VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    iterator insert(const_iterator __hint, node_type&& __nh)
+    {
+        _LIBCPP_ASSERT(__nh.empty() || __nh.get_allocator() == get_allocator(),
+            "node_type with incompatible allocator passed to unordered_multiset::insert()");
+        return __table_.template __node_handle_insert_multi<node_type>(
+            __hint, _VSTD::move(__nh));
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(const_iterator __position)
+    {
+        return __table_.template __node_handle_extract<node_type>(
+            __position);
+    }
+    _LIBCPP_INLINE_VISIBILITY
+    node_type extract(key_type const& __key)
+    {
+        return __table_.template __node_handle_extract<node_type>(__key);
+    }
+
+    template <class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_multiset<key_type, _H2, _P2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __table_.__node_handle_merge_multi(__source.__table_);
+    }
+    template <class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_multiset<key_type, _H2, _P2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __table_.__node_handle_merge_multi(__source.__table_);
+    }
+    template <class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_set<key_type, _H2, _P2, allocator_type>& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __table_.__node_handle_merge_multi(__source.__table_);
+    }
+    template <class _H2, class _P2>
+    _LIBCPP_INLINE_VISIBILITY
+    void merge(unordered_set<key_type, _H2, _P2, allocator_type>&& __source)
+    {
+        _LIBCPP_ASSERT(__source.get_allocator() == get_allocator(),
+                       "merging container with incompatible allocator");
+        return __table_.__node_handle_merge_multi(__source.__table_);
+    }
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(const_iterator __p) {return __table_.erase(__p);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    iterator erase(const_iterator __first, const_iterator __last)
+        {return __table_.erase(__first, __last);}
+    _LIBCPP_INLINE_VISIBILITY
+    void clear() _NOEXCEPT {__table_.clear();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(unordered_multiset& __u)
+        _NOEXCEPT_(__is_nothrow_swappable<__table>::value)
+        {__table_.swap(__u.__table_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    hasher hash_function() const {return __table_.hash_function();}
+    _LIBCPP_INLINE_VISIBILITY
+    key_equal key_eq() const {return __table_.key_eq();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       find(const key_type& __k)       {return __table_.find(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const key_type& __k) const {return __table_.find(__k);}
+#if _LIBCPP_STD_VER > 17
+    template<class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    iterator       find(const _K2& __k)            {return __table_.find(__k);}
+    template<class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    const_iterator find(const _K2& __k) const      {return __table_.find(__k);}
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type count(const key_type& __k) const {return __table_.__count_multi(__k);}
+#if _LIBCPP_STD_VER > 17
+    template<class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    size_type count(const _K2& __k) const      {return __table_.__count_multi(__k);}
+#endif // _LIBCPP_STD_VER > 17
+
+#if _LIBCPP_STD_VER > 17
+    _LIBCPP_INLINE_VISIBILITY
+    bool contains(const key_type& __k) const {return find(__k) != end();}
+
+    template<class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    bool contains(const _K2& __k) const      {return find(__k) != end();}
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, iterator>             equal_range(const key_type& __k)
+        {return __table_.__equal_range_multi(__k);}
+    _LIBCPP_INLINE_VISIBILITY
+    pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
+        {return __table_.__equal_range_multi(__k);}
+#if _LIBCPP_STD_VER > 17
+    template<class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<iterator, iterator>             equal_range(const _K2& __k)
+        {return __table_.__equal_range_multi(__k);}
+    template<class _K2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* = nullptr>
+    _LIBCPP_INLINE_VISIBILITY
+    pair<const_iterator, const_iterator> equal_range(const _K2& __k) const
+        {return __table_.__equal_range_multi(__k);}
+#endif // _LIBCPP_STD_VER > 17
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_count() const _NOEXCEPT {return __table_.bucket_count();}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type max_bucket_count() const _NOEXCEPT {return __table_.max_bucket_count();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket_size(size_type __n) const {return __table_.bucket_size(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    size_type bucket(const key_type& __k) const {return __table_.bucket(__k);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    local_iterator       begin(size_type __n)        {return __table_.begin(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    local_iterator       end(size_type __n)          {return __table_.end(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator begin(size_type __n) const  {return __table_.cbegin(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator end(size_type __n) const    {return __table_.cend(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator cbegin(size_type __n) const {return __table_.cbegin(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    const_local_iterator cend(size_type __n) const   {return __table_.cend(__n);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    float load_factor() const _NOEXCEPT {return __table_.load_factor();}
+    _LIBCPP_INLINE_VISIBILITY
+    float max_load_factor() const _NOEXCEPT {return __table_.max_load_factor();}
+    _LIBCPP_INLINE_VISIBILITY
+    void max_load_factor(float __mlf) {__table_.max_load_factor(__mlf);}
+    _LIBCPP_INLINE_VISIBILITY
+    void rehash(size_type __n) {__table_.__rehash_multi(__n);}
+    _LIBCPP_INLINE_VISIBILITY
+    void reserve(size_type __n) {__table_.__reserve_multi(__n);}
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+    bool __dereferenceable(const const_iterator* __i) const
+        {return __table_.__dereferenceable(__i);}
+    bool __decrementable(const const_iterator* __i) const
+        {return __table_.__decrementable(__i);}
+    bool __addable(const const_iterator* __i, ptrdiff_t __n) const
+        {return __table_.__addable(__i, __n);}
+    bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const
+        {return __table_.__addable(__i, __n);}
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+};
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator,
+         class _Hash = hash<__iter_value_type<_InputIterator>>,
+         class _Pred = equal_to<__iter_value_type<_InputIterator>>,
+         class _Allocator = allocator<__iter_value_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<!__is_allocator<_Pred>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multiset(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type = 0,
+              _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
+  -> unordered_multiset<__iter_value_type<_InputIterator>, _Hash, _Pred, _Allocator>;
+
+template<class _Tp, class _Hash = hash<_Tp>,
+         class _Pred = equal_to<_Tp>, class _Allocator = allocator<_Tp>,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<!__is_allocator<_Pred>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multiset(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type = 0,
+              _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
+  -> unordered_multiset<_Tp, _Hash, _Pred, _Allocator>;
+
+template<class _InputIterator, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multiset(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type, _Allocator)
+  -> unordered_multiset<__iter_value_type<_InputIterator>,
+                   hash<__iter_value_type<_InputIterator>>,
+                   equal_to<__iter_value_type<_InputIterator>>,
+                   _Allocator>;
+
+template<class _InputIterator, class _Hash, class _Allocator,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multiset(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type,
+              _Hash, _Allocator)
+  -> unordered_multiset<__iter_value_type<_InputIterator>, _Hash,
+                   equal_to<__iter_value_type<_InputIterator>>,
+                   _Allocator>;
+
+template<class _Tp, class _Allocator,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multiset(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type, _Allocator)
+  -> unordered_multiset<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
+
+template<class _Tp, class _Hash, class _Allocator,
+         class = enable_if_t<!__is_allocator<_Hash>::value>,
+         class = enable_if_t<!is_integral<_Hash>::value>,
+         class = enable_if_t<__is_allocator<_Allocator>::value>>
+unordered_multiset(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type, _Hash, _Allocator)
+  -> unordered_multiset<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
+#endif
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        size_type __n, const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__n);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        size_type __n, const hasher& __hf, const key_equal& __eql,
+        const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__n);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        _InputIterator __first, _InputIterator __last)
+{
+    _VSTD::__debug_db_insert_c(this);
+    insert(__first, __last);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__n);
+    insert(__first, __last);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        _InputIterator __first, _InputIterator __last, size_type __n,
+        const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__n);
+    insert(__first, __last);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        const allocator_type& __a)
+    : __table_(__a)
+{
+    _VSTD::__debug_db_insert_c(this);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        const unordered_multiset& __u)
+    : __table_(__u.__table_)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__u.bucket_count());
+    insert(__u.begin(), __u.end());
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        const unordered_multiset& __u, const allocator_type& __a)
+    : __table_(__u.__table_, __a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__u.bucket_count());
+    insert(__u.begin(), __u.end());
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        unordered_multiset&& __u)
+    _NOEXCEPT_(is_nothrow_move_constructible<__table>::value)
+    : __table_(_VSTD::move(__u.__table_))
+{
+    _VSTD::__debug_db_insert_c(this);
+    std::__debug_db_swap(this, std::addressof(__u));
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        unordered_multiset&& __u, const allocator_type& __a)
+    : __table_(_VSTD::move(__u.__table_), __a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    if (__a != __u.get_allocator())
+    {
+        iterator __i = __u.begin();
+        while (__u.size() != 0)
+            __table_.__insert_multi(_VSTD::move(__u.__table_.remove(__i++)->__value_));
+    }
+    else
+        std::__debug_db_swap(this, std::addressof(__u));
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        initializer_list<value_type> __il)
+{
+    _VSTD::__debug_db_insert_c(this);
+    insert(__il.begin(), __il.end());
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        initializer_list<value_type> __il, size_type __n, const hasher& __hf,
+        const key_equal& __eql)
+    : __table_(__hf, __eql)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__n);
+    insert(__il.begin(), __il.end());
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset(
+        initializer_list<value_type> __il, size_type __n, const hasher& __hf,
+        const key_equal& __eql, const allocator_type& __a)
+    : __table_(__hf, __eql, __a)
+{
+    _VSTD::__debug_db_insert_c(this);
+    __table_.__rehash_multi(__n);
+    insert(__il.begin(), __il.end());
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>&
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::operator=(
+        unordered_multiset&& __u)
+    _NOEXCEPT_(is_nothrow_move_assignable<__table>::value)
+{
+    __table_ = _VSTD::move(__u.__table_);
+    return *this;
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>&
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::operator=(
+        initializer_list<value_type> __il)
+{
+    __table_.__assign_multi(__il.begin(), __il.end());
+    return *this;
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+template <class _InputIterator>
+inline
+void
+unordered_multiset<_Value, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
+                                                         _InputIterator __last)
+{
+    for (; __first != __last; ++__first)
+        __table_.__insert_multi(*__first);
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
+     unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Value, class _Hash, class _Pred, class _Alloc,
+          class _Predicate>
+inline _LIBCPP_INLINE_VISIBILITY
+    typename unordered_multiset<_Value, _Hash, _Pred, _Alloc>::size_type
+    erase_if(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __c,
+             _Predicate __pred) {
+  return _VSTD::__libcpp_erase_if_container(__c, __pred);
+}
+#endif
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+_LIBCPP_HIDE_FROM_ABI bool
+operator==(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
+           const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
+{
+    if (__x.size() != __y.size())
+        return false;
+    typedef typename unordered_multiset<_Value, _Hash, _Pred, _Alloc>::const_iterator
+                                                                 const_iterator;
+    typedef pair<const_iterator, const_iterator> _EqRng;
+    for (const_iterator __i = __x.begin(), __ex = __x.end(); __i != __ex;)
+    {
+        _EqRng __xeq = __x.equal_range(*__i);
+        _EqRng __yeq = __y.equal_range(*__i);
+        if (_VSTD::distance(__xeq.first, __xeq.second) !=
+            _VSTD::distance(__yeq.first, __yeq.second) ||
+                  !_VSTD::is_permutation(__xeq.first, __xeq.second, __yeq.first))
+            return false;
+        __i = __xeq.second;
+    }
+    return true;
+}
+
+template <class _Value, class _Hash, class _Pred, class _Alloc>
+inline _LIBCPP_INLINE_VISIBILITY
+bool
+operator!=(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
+           const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
+{
+    return !(__x == __y);
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+_LIBCPP_BEGIN_NAMESPACE_STD
+namespace pmr {
+template <class _KeyT, class _HashT = std::hash<_KeyT>, class _PredT = std::equal_to<_KeyT>>
+using unordered_set = std::unordered_set<_KeyT, _HashT, _PredT, polymorphic_allocator<_KeyT>>;
+
+template <class _KeyT, class _HashT = std::hash<_KeyT>, class _PredT = std::equal_to<_KeyT>>
+using unordered_multiset = std::unordered_multiset<_KeyT, _HashT, _PredT, polymorphic_allocator<_KeyT>>;
+} // namespace pmr
+_LIBCPP_END_NAMESPACE_STD
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <concepts>
+#  include <functional>
+#  include <iterator>
+#endif
+
+#endif // _LIBCPP_UNORDERED_SET
diff --git a/app/src/main/cpp/libcxx/include/utility b/app/src/main/cpp/libcxx/include/utility
new file mode 100644
index 0000000..a4d8cf8
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/utility
@@ -0,0 +1,282 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_UTILITY
+#define _LIBCPP_UTILITY
+
+/*
+    utility synopsis
+
+#include <initializer_list>
+
+namespace std
+{
+
+template <class T>
+    void
+    swap(T& a, T& b);
+
+namespace rel_ops
+{
+    template<class T> bool operator!=(const T&, const T&);
+    template<class T> bool operator> (const T&, const T&);
+    template<class T> bool operator<=(const T&, const T&);
+    template<class T> bool operator>=(const T&, const T&);
+}
+
+template<class T>
+void
+swap(T& a, T& b) noexcept(is_nothrow_move_constructible<T>::value &&
+                          is_nothrow_move_assignable<T>::value);
+
+template <class T, size_t N>
+void
+swap(T (&a)[N], T (&b)[N]) noexcept(noexcept(swap(*a, *b)));
+
+template <class T> T&& forward(typename remove_reference<T>::type& t) noexcept;  // constexpr in C++14
+template <class T> T&& forward(typename remove_reference<T>::type&& t) noexcept; // constexpr in C++14
+
+template <typename T>
+[[nodiscard]] constexpr
+auto forward_like(auto&& x) noexcept -> see below;                               // since C++23
+
+template <class T> typename remove_reference<T>::type&& move(T&&) noexcept;      // constexpr in C++14
+
+template <class T>
+    typename conditional
+    <
+        !is_nothrow_move_constructible<T>::value && is_copy_constructible<T>::value,
+        const T&,
+        T&&
+    >::type
+    move_if_noexcept(T& x) noexcept; // constexpr in C++14
+
+template <class T> constexpr add_const_t<T>& as_const(T& t) noexcept;      // C++17
+template <class T>                      void as_const(const T&&) = delete; // C++17
+
+template <class T> typename add_rvalue_reference<T>::type declval() noexcept;
+
+template<class T, class U> constexpr bool cmp_equal(T t, U u) noexcept;         // C++20
+template<class T, class U> constexpr bool cmp_not_equal(T t, U u) noexcept;     // C++20
+template<class T, class U> constexpr bool cmp_less(T t, U u) noexcept;          // C++20
+template<class T, class U> constexpr bool cmp_greater(T t, U u) noexcept;       // C++20
+template<class T, class U> constexpr bool cmp_less_equal(T t, U u) noexcept;    // C++20
+template<class T, class U> constexpr bool cmp_greater_equal(T t, U u) noexcept; // C++20
+template<class R, class T> constexpr bool in_range(T t) noexcept;               // C++20
+
+template <class T1, class T2>
+struct pair
+{
+    typedef T1 first_type;
+    typedef T2 second_type;
+
+    T1 first;
+    T2 second;
+
+    pair(const pair&) = default;
+    pair(pair&&) = default;
+    explicit(see-below) constexpr pair();
+    explicit(see-below) pair(const T1& x, const T2& y);                          // constexpr in C++14
+    template <class U = T1, class V = T2> explicit(see-below) pair(U&&, V&&);    // constexpr in C++14
+    template <class U, class V> constexpr explicit(see below) pair(pair<U, V>&); // since C++23
+    template <class U, class V> explicit(see-below) pair(const pair<U, V>& p);   // constexpr in C++14
+    template <class U, class V> explicit(see-below) pair(pair<U, V>&& p);        // constexpr in C++14
+    template <class U, class V>
+    constexpr explicit(see below) pair(const pair<U, V>&&);                      // since C++23
+    template <class... Args1, class... Args2>
+        pair(piecewise_construct_t, tuple<Args1...> first_args,
+             tuple<Args2...> second_args);                                       // constexpr in C++20
+
+    constexpr const pair& operator=(const pair& p) const;                        // since C++23
+    template <class U, class V> pair& operator=(const pair<U, V>& p);            // constexpr in C++20
+    template <class U, class V>
+    constexpr const pair& operator=(const pair<U, V>& p) const;                  // since C++23
+    pair& operator=(pair&& p) noexcept(is_nothrow_move_assignable<T1>::value &&
+                                       is_nothrow_move_assignable<T2>::value);   // constexpr in C++20
+    constexpr const pair& operator=(pair&& p) const;                             // since C++23
+    template <class U, class V> pair& operator=(pair<U, V>&& p);                 // constexpr in C++20
+    template <class U, class V>
+    constexpr const pair& operator=(pair<U, V>&& p) const;                       // since C++23
+
+    void swap(pair& p) noexcept(is_nothrow_swappable_v<T1> &&
+                                is_nothrow_swappable_v<T2>);                     // constexpr in C++20
+    constexpr void swap(const pair& p) const noexcept(see below);                // since C++23
+};
+
+template<class T1, class T2, class U1, class U2, template<class> class TQual, template<class> class UQual>
+struct basic_common_reference<pair<T1, T2>, pair<U1, U2>, TQual, UQual>;         // since C++23
+
+template<class T1, class T2, class U1, class U2>
+struct common_type<pair<T1, T2>, pair<U1, U2>>;                                  // since C++23
+
+template<class T1, class T2> pair(T1, T2) -> pair<T1, T2>;
+
+template <class T1, class T2> bool operator==(const pair<T1,T2>&, const pair<T1,T2>&); // constexpr in C++14
+template <class T1, class T2> bool operator!=(const pair<T1,T2>&, const pair<T1,T2>&); // constexpr in C++14, removed in C++20
+template <class T1, class T2> bool operator< (const pair<T1,T2>&, const pair<T1,T2>&); // constexpr in C++14, removed in C++20
+template <class T1, class T2> bool operator> (const pair<T1,T2>&, const pair<T1,T2>&); // constexpr in C++14, removed in C++20
+template <class T1, class T2> bool operator>=(const pair<T1,T2>&, const pair<T1,T2>&); // constexpr in C++14, removed in C++20
+template <class T1, class T2> bool operator<=(const pair<T1,T2>&, const pair<T1,T2>&); // constexpr in C++14, removed in C++20
+template <class T1, class T2>
+  constexpr common_comparison_type_t<synth-three-way-result<T1>,
+                                     synth-three-way-result<T2>>
+    operator<=>(const pair<T1,T2>&, const pair<T1,T2>&);                               // C++20
+
+template <class T1, class T2> pair<V1, V2> make_pair(T1&&, T2&&);                // constexpr in C++14
+template <class T1, class T2>
+void
+swap(pair<T1, T2>& x, pair<T1, T2>& y) noexcept(noexcept(x.swap(y)));            // constexpr in C++20
+
+template<class T1, class T2>
+constexpr void swap(const pair<T1, T2>& x, const pair<T1, T2>& y) noexcept(noexcept(x.swap(y)));    // since C++23
+
+struct piecewise_construct_t { explicit piecewise_construct_t() = default; };
+inline constexpr piecewise_construct_t piecewise_construct = piecewise_construct_t();
+
+template <class T> struct tuple_size;
+template <size_t I, class T> struct tuple_element;
+
+template <class T1, class T2> struct tuple_size<pair<T1, T2> >;
+template <class T1, class T2> struct tuple_element<0, pair<T1, T2> >;
+template <class T1, class T2> struct tuple_element<1, pair<T1, T2> >;
+
+template<size_t I, class T1, class T2>
+    typename tuple_element<I, pair<T1, T2> >::type&
+    get(pair<T1, T2>&) noexcept; // constexpr in C++14
+
+template<size_t I, class T1, class T2>
+    const typename tuple_element<I, pair<T1, T2> >::type&
+    get(const pair<T1, T2>&) noexcept; // constexpr in C++14
+
+template<size_t I, class T1, class T2>
+    typename tuple_element<I, pair<T1, T2> >::type&&
+    get(pair<T1, T2>&&) noexcept; // constexpr in C++14
+
+template<size_t I, class T1, class T2>
+    const typename tuple_element<I, pair<T1, T2> >::type&&
+    get(const pair<T1, T2>&&) noexcept; // constexpr in C++14
+
+template<class T1, class T2>
+    constexpr T1& get(pair<T1, T2>&) noexcept; // C++14
+
+template<class T1, class T2>
+    constexpr const T1& get(const pair<T1, T2>&) noexcept; // C++14
+
+template<class T1, class T2>
+    constexpr T1&& get(pair<T1, T2>&&) noexcept; // C++14
+
+template<class T1, class T2>
+    constexpr const T1&& get(const pair<T1, T2>&&) noexcept; // C++14
+
+template<class T1, class T2>
+    constexpr T1& get(pair<T2, T1>&) noexcept; // C++14
+
+template<class T1, class T2>
+    constexpr const T1& get(const pair<T2, T1>&) noexcept; // C++14
+
+template<class T1, class T2>
+    constexpr T1&& get(pair<T2, T1>&&) noexcept; // C++14
+
+template<class T1, class T2>
+    constexpr const T1&& get(const pair<T2, T1>&&) noexcept; // C++14
+
+// C++14
+
+template<class T, T... I>
+struct integer_sequence
+{
+    typedef T value_type;
+
+    static constexpr size_t size() noexcept;
+};
+
+template<size_t... I>
+  using index_sequence = integer_sequence<size_t, I...>;
+
+template<class T, T N>
+  using make_integer_sequence = integer_sequence<T, 0, 1, ..., N-1>;
+template<size_t N>
+  using make_index_sequence = make_integer_sequence<size_t, N>;
+
+template<class... T>
+  using index_sequence_for = make_index_sequence<sizeof...(T)>;
+
+template<class T, class U=T>
+    constexpr T exchange(T& obj, U&& new_value)
+      noexcept(is_nothrow_move_constructible<T>::value && is_nothrow_assignable<T&, U>::value); // constexpr in C++17, noexcept in C++23
+
+// 20.2.7, in-place construction // C++17
+struct in_place_t {
+  explicit in_place_t() = default;
+};
+inline constexpr in_place_t in_place{};
+template <class T>
+  struct in_place_type_t {
+    explicit in_place_type_t() = default;
+  };
+template <class T>
+  inline constexpr in_place_type_t<T> in_place_type{};
+template <size_t I>
+  struct in_place_index_t {
+    explicit in_place_index_t() = default;
+  };
+template <size_t I>
+  inline constexpr in_place_index_t<I> in_place_index{};
+
+// [utility.underlying], to_underlying
+template <class T>
+    constexpr underlying_type_t<T> to_underlying( T value ) noexcept; // C++2b
+
+}  // std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__utility/as_const.h>
+#include <__utility/auto_cast.h>
+#include <__utility/cmp.h>
+#include <__utility/declval.h>
+#include <__utility/exception_guard.h>
+#include <__utility/exchange.h>
+#include <__utility/forward.h>
+#include <__utility/forward_like.h>
+#include <__utility/in_place.h>
+#include <__utility/integer_sequence.h>
+#include <__utility/move.h>
+#include <__utility/pair.h>
+#include <__utility/piecewise_construct.h>
+#include <__utility/priority_tag.h>
+#include <__utility/rel_ops.h>
+#include <__utility/swap.h>
+#include <__utility/to_underlying.h>
+#include <__utility/unreachable.h>
+#include <version>
+
+// standard-mandated includes
+
+// [utility.syn]
+#include <compare>
+#include <initializer_list>
+
+// [tuple.helper]
+#include <__tuple_dir/tuple_element.h>
+#include <__tuple_dir/tuple_size.h>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <cstdlib>
+#  include <iosfwd>
+#  include <type_traits>
+#endif
+
+#endif // _LIBCPP_UTILITY
diff --git a/app/src/main/cpp/libcxx/include/valarray b/app/src/main/cpp/libcxx/include/valarray
new file mode 100644
index 0000000..92521ed
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/valarray
@@ -0,0 +1,4940 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_VALARRAY
+#define _LIBCPP_VALARRAY
+
+/*
+    valarray synopsis
+
+namespace std
+{
+
+template<class T>
+class valarray
+{
+public:
+    typedef T value_type;
+
+    // construct/destroy:
+    valarray();
+    explicit valarray(size_t n);
+    valarray(const value_type& x, size_t n);
+    valarray(const value_type* px, size_t n);
+    valarray(const valarray& v);
+    valarray(valarray&& v) noexcept;
+    valarray(const slice_array<value_type>& sa);
+    valarray(const gslice_array<value_type>& ga);
+    valarray(const mask_array<value_type>& ma);
+    valarray(const indirect_array<value_type>& ia);
+    valarray(initializer_list<value_type> il);
+    ~valarray();
+
+    // assignment:
+    valarray& operator=(const valarray& v);
+    valarray& operator=(valarray&& v) noexcept;
+    valarray& operator=(initializer_list<value_type> il);
+    valarray& operator=(const value_type& x);
+    valarray& operator=(const slice_array<value_type>& sa);
+    valarray& operator=(const gslice_array<value_type>& ga);
+    valarray& operator=(const mask_array<value_type>& ma);
+    valarray& operator=(const indirect_array<value_type>& ia);
+
+    // element access:
+    const value_type& operator[](size_t i) const;
+    value_type&       operator[](size_t i);
+
+    // subset operations:
+    valarray                   operator[](slice s) const;
+    slice_array<value_type>    operator[](slice s);
+    valarray                   operator[](const gslice& gs) const;
+    gslice_array<value_type>   operator[](const gslice& gs);
+    valarray                   operator[](const valarray<bool>& vb) const;
+    mask_array<value_type>     operator[](const valarray<bool>& vb);
+    valarray                   operator[](const valarray<size_t>& vs) const;
+    indirect_array<value_type> operator[](const valarray<size_t>& vs);
+
+    // unary operators:
+    valarray       operator+() const;
+    valarray       operator-() const;
+    valarray       operator~() const;
+    valarray<bool> operator!() const;
+
+    // computed assignment:
+    valarray& operator*= (const value_type& x);
+    valarray& operator/= (const value_type& x);
+    valarray& operator%= (const value_type& x);
+    valarray& operator+= (const value_type& x);
+    valarray& operator-= (const value_type& x);
+    valarray& operator^= (const value_type& x);
+    valarray& operator&= (const value_type& x);
+    valarray& operator|= (const value_type& x);
+    valarray& operator<<=(const value_type& x);
+    valarray& operator>>=(const value_type& x);
+
+    valarray& operator*= (const valarray& v);
+    valarray& operator/= (const valarray& v);
+    valarray& operator%= (const valarray& v);
+    valarray& operator+= (const valarray& v);
+    valarray& operator-= (const valarray& v);
+    valarray& operator^= (const valarray& v);
+    valarray& operator|= (const valarray& v);
+    valarray& operator&= (const valarray& v);
+    valarray& operator<<=(const valarray& v);
+    valarray& operator>>=(const valarray& v);
+
+    // member functions:
+    void swap(valarray& v) noexcept;
+
+    size_t size() const;
+
+    value_type sum() const;
+    value_type min() const;
+    value_type max() const;
+
+    valarray shift (int i) const;
+    valarray cshift(int i) const;
+    valarray apply(value_type f(value_type)) const;
+    valarray apply(value_type f(const value_type&)) const;
+    void resize(size_t n, value_type x = value_type());
+};
+
+template<class T, size_t cnt> valarray(const T(&)[cnt], size_t) -> valarray<T>;
+
+class slice
+{
+public:
+    slice();
+    slice(size_t start, size_t size, size_t stride);
+
+    size_t start()  const;
+    size_t size()   const;
+    size_t stride() const;
+};
+
+template <class T>
+class slice_array
+{
+public:
+    typedef T value_type;
+
+    const slice_array& operator=(const slice_array& sa) const;
+    void operator=  (const valarray<value_type>& v) const;
+    void operator*= (const valarray<value_type>& v) const;
+    void operator/= (const valarray<value_type>& v) const;
+    void operator%= (const valarray<value_type>& v) const;
+    void operator+= (const valarray<value_type>& v) const;
+    void operator-= (const valarray<value_type>& v) const;
+    void operator^= (const valarray<value_type>& v) const;
+    void operator&= (const valarray<value_type>& v) const;
+    void operator|= (const valarray<value_type>& v) const;
+    void operator<<=(const valarray<value_type>& v) const;
+    void operator>>=(const valarray<value_type>& v) const;
+
+    void operator=(const value_type& x) const;
+    void operator=(const valarray<T>& val_arr) const;
+
+    slice_array() = delete;
+};
+
+class gslice
+{
+public:
+    gslice();
+    gslice(size_t start, const valarray<size_t>& size,
+                         const valarray<size_t>& stride);
+
+    size_t           start()  const;
+    valarray<size_t> size()   const;
+    valarray<size_t> stride() const;
+};
+
+template <class T>
+class gslice_array
+{
+public:
+    typedef T value_type;
+
+    void operator=  (const valarray<value_type>& v) const;
+    void operator*= (const valarray<value_type>& v) const;
+    void operator/= (const valarray<value_type>& v) const;
+    void operator%= (const valarray<value_type>& v) const;
+    void operator+= (const valarray<value_type>& v) const;
+    void operator-= (const valarray<value_type>& v) const;
+    void operator^= (const valarray<value_type>& v) const;
+    void operator&= (const valarray<value_type>& v) const;
+    void operator|= (const valarray<value_type>& v) const;
+    void operator<<=(const valarray<value_type>& v) const;
+    void operator>>=(const valarray<value_type>& v) const;
+
+    gslice_array(const gslice_array& ga);
+    ~gslice_array();
+    const gslice_array& operator=(const gslice_array& ga) const;
+    void operator=(const value_type& x) const;
+
+    gslice_array() = delete;
+};
+
+template <class T>
+class mask_array
+{
+public:
+    typedef T value_type;
+
+    void operator=  (const valarray<value_type>& v) const;
+    void operator*= (const valarray<value_type>& v) const;
+    void operator/= (const valarray<value_type>& v) const;
+    void operator%= (const valarray<value_type>& v) const;
+    void operator+= (const valarray<value_type>& v) const;
+    void operator-= (const valarray<value_type>& v) const;
+    void operator^= (const valarray<value_type>& v) const;
+    void operator&= (const valarray<value_type>& v) const;
+    void operator|= (const valarray<value_type>& v) const;
+    void operator<<=(const valarray<value_type>& v) const;
+    void operator>>=(const valarray<value_type>& v) const;
+
+    mask_array(const mask_array& ma);
+    ~mask_array();
+    const mask_array& operator=(const mask_array& ma) const;
+    void operator=(const value_type& x) const;
+
+    mask_array() = delete;
+};
+
+template <class T>
+class indirect_array
+{
+public:
+    typedef T value_type;
+
+    void operator=  (const valarray<value_type>& v) const;
+    void operator*= (const valarray<value_type>& v) const;
+    void operator/= (const valarray<value_type>& v) const;
+    void operator%= (const valarray<value_type>& v) const;
+    void operator+= (const valarray<value_type>& v) const;
+    void operator-= (const valarray<value_type>& v) const;
+    void operator^= (const valarray<value_type>& v) const;
+    void operator&= (const valarray<value_type>& v) const;
+    void operator|= (const valarray<value_type>& v) const;
+    void operator<<=(const valarray<value_type>& v) const;
+    void operator>>=(const valarray<value_type>& v) const;
+
+    indirect_array(const indirect_array& ia);
+    ~indirect_array();
+    const indirect_array& operator=(const indirect_array& ia) const;
+    void operator=(const value_type& x) const;
+
+    indirect_array() = delete;
+};
+
+template<class T> void swap(valarray<T>& x, valarray<T>& y) noexcept;
+
+template<class T> valarray<T> operator* (const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<T> operator* (const valarray<T>& x, const T& y);
+template<class T> valarray<T> operator* (const T& x, const valarray<T>& y);
+
+template<class T> valarray<T> operator/ (const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<T> operator/ (const valarray<T>& x, const T& y);
+template<class T> valarray<T> operator/ (const T& x, const valarray<T>& y);
+
+template<class T> valarray<T> operator% (const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<T> operator% (const valarray<T>& x, const T& y);
+template<class T> valarray<T> operator% (const T& x, const valarray<T>& y);
+
+template<class T> valarray<T> operator+ (const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<T> operator+ (const valarray<T>& x, const T& y);
+template<class T> valarray<T> operator+ (const T& x, const valarray<T>& y);
+
+template<class T> valarray<T> operator- (const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<T> operator- (const valarray<T>& x, const T& y);
+template<class T> valarray<T> operator- (const T& x, const valarray<T>& y);
+
+template<class T> valarray<T> operator^ (const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<T> operator^ (const valarray<T>& x, const T& y);
+template<class T> valarray<T> operator^ (const T& x, const valarray<T>& y);
+
+template<class T> valarray<T> operator& (const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<T> operator& (const valarray<T>& x, const T& y);
+template<class T> valarray<T> operator& (const T& x, const valarray<T>& y);
+
+template<class T> valarray<T> operator| (const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<T> operator| (const valarray<T>& x, const T& y);
+template<class T> valarray<T> operator| (const T& x, const valarray<T>& y);
+
+template<class T> valarray<T> operator<<(const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<T> operator<<(const valarray<T>& x, const T& y);
+template<class T> valarray<T> operator<<(const T& x, const valarray<T>& y);
+
+template<class T> valarray<T> operator>>(const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<T> operator>>(const valarray<T>& x, const T& y);
+template<class T> valarray<T> operator>>(const T& x, const valarray<T>& y);
+
+template<class T> valarray<bool> operator&&(const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<bool> operator&&(const valarray<T>& x, const T& y);
+template<class T> valarray<bool> operator&&(const T& x, const valarray<T>& y);
+
+template<class T> valarray<bool> operator||(const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<bool> operator||(const valarray<T>& x, const T& y);
+template<class T> valarray<bool> operator||(const T& x, const valarray<T>& y);
+
+template<class T> valarray<bool> operator==(const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<bool> operator==(const valarray<T>& x, const T& y);
+template<class T> valarray<bool> operator==(const T& x, const valarray<T>& y);
+
+template<class T> valarray<bool> operator!=(const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<bool> operator!=(const valarray<T>& x, const T& y);
+template<class T> valarray<bool> operator!=(const T& x, const valarray<T>& y);
+
+template<class T> valarray<bool> operator< (const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<bool> operator< (const valarray<T>& x, const T& y);
+template<class T> valarray<bool> operator< (const T& x, const valarray<T>& y);
+
+template<class T> valarray<bool> operator> (const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<bool> operator> (const valarray<T>& x, const T& y);
+template<class T> valarray<bool> operator> (const T& x, const valarray<T>& y);
+
+template<class T> valarray<bool> operator<=(const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<bool> operator<=(const valarray<T>& x, const T& y);
+template<class T> valarray<bool> operator<=(const T& x, const valarray<T>& y);
+
+template<class T> valarray<bool> operator>=(const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<bool> operator>=(const valarray<T>& x, const T& y);
+template<class T> valarray<bool> operator>=(const T& x, const valarray<T>& y);
+
+template<class T> valarray<T> abs (const valarray<T>& x);
+template<class T> valarray<T> acos (const valarray<T>& x);
+template<class T> valarray<T> asin (const valarray<T>& x);
+template<class T> valarray<T> atan (const valarray<T>& x);
+
+template<class T> valarray<T> atan2(const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<T> atan2(const valarray<T>& x, const T& y);
+template<class T> valarray<T> atan2(const T& x, const valarray<T>& y);
+
+template<class T> valarray<T> cos (const valarray<T>& x);
+template<class T> valarray<T> cosh (const valarray<T>& x);
+template<class T> valarray<T> exp (const valarray<T>& x);
+template<class T> valarray<T> log (const valarray<T>& x);
+template<class T> valarray<T> log10(const valarray<T>& x);
+
+template<class T> valarray<T> pow(const valarray<T>& x, const valarray<T>& y);
+template<class T> valarray<T> pow(const valarray<T>& x, const T& y);
+template<class T> valarray<T> pow(const T& x, const valarray<T>& y);
+
+template<class T> valarray<T> sin (const valarray<T>& x);
+template<class T> valarray<T> sinh (const valarray<T>& x);
+template<class T> valarray<T> sqrt (const valarray<T>& x);
+template<class T> valarray<T> tan (const valarray<T>& x);
+template<class T> valarray<T> tanh (const valarray<T>& x);
+
+template <class T> unspecified1 begin(valarray<T>& v);
+template <class T> unspecified2 begin(const valarray<T>& v);
+template <class T> unspecified1 end(valarray<T>& v);
+template <class T> unspecified2 end(const valarray<T>& v);
+
+}  // std
+
+*/
+
+#include <__algorithm/copy.h>
+#include <__algorithm/count.h>
+#include <__algorithm/fill.h>
+#include <__algorithm/max_element.h>
+#include <__algorithm/min.h>
+#include <__algorithm/min_element.h>
+#include <__algorithm/unwrap_iter.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+#include <__functional/operations.h>
+#include <__memory/allocator.h>
+#include <__memory/uninitialized_algorithms.h>
+#include <__type_traits/remove_reference.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <cmath>
+#include <cstddef>
+#include <new>
+#include <version>
+
+// standard-mandated includes
+
+// [valarray.syn]
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template<class _Tp> class _LIBCPP_TEMPLATE_VIS valarray;
+
+class _LIBCPP_TEMPLATE_VIS slice
+{
+    size_t __start_;
+    size_t __size_;
+    size_t __stride_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    slice()
+        : __start_(0),
+          __size_(0),
+          __stride_(0)
+          {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    slice(size_t __start, size_t __size, size_t __stride)
+        : __start_(__start),
+          __size_(__size),
+          __stride_(__stride)
+          {}
+
+    _LIBCPP_INLINE_VISIBILITY size_t start()  const {return __start_;}
+    _LIBCPP_INLINE_VISIBILITY size_t size()   const {return __size_;}
+    _LIBCPP_INLINE_VISIBILITY size_t stride() const {return __stride_;}
+};
+
+template <class _Tp> class _LIBCPP_TEMPLATE_VIS slice_array;
+class _LIBCPP_TYPE_VIS gslice;
+template <class _Tp> class _LIBCPP_TEMPLATE_VIS gslice_array;
+template <class _Tp> class _LIBCPP_TEMPLATE_VIS mask_array;
+template <class _Tp> class _LIBCPP_TEMPLATE_VIS indirect_array;
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp*
+begin(valarray<_Tp>& __v);
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+const _Tp*
+begin(const valarray<_Tp>& __v);
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+_Tp*
+end(valarray<_Tp>& __v);
+
+template <class _Tp>
+_LIBCPP_INLINE_VISIBILITY
+const _Tp*
+end(const valarray<_Tp>& __v);
+
+template <class _Op, class _A0>
+struct _UnaryOp
+{
+    typedef typename _Op::__result_type __result_type;
+    typedef typename decay<__result_type>::type value_type;
+
+    _Op __op_;
+    _A0 __a0_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _UnaryOp(const _Op& __op, const _A0& __a0) : __op_(__op), __a0_(__a0) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t __i) const {return __op_(__a0_[__i]);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __a0_.size();}
+};
+
+template <class _Op, class _A0, class _A1>
+struct _BinaryOp
+{
+    typedef typename _Op::__result_type __result_type;
+    typedef typename decay<__result_type>::type value_type;
+
+    _Op __op_;
+    _A0 __a0_;
+    _A1 __a1_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _BinaryOp(const _Op& __op, const _A0& __a0, const _A1& __a1)
+        : __op_(__op), __a0_(__a0), __a1_(__a1) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t __i) const {return __op_(__a0_[__i], __a1_[__i]);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __a0_.size();}
+};
+
+template <class _Tp>
+class __scalar_expr
+{
+public:
+    typedef _Tp        value_type;
+    typedef const _Tp& __result_type;
+private:
+    const value_type& __t_;
+    size_t __s_;
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __scalar_expr(const value_type& __t, size_t __s) : __t_(__t), __s_(__s) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t) const {return __t_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __s_;}
+};
+
+template <class _Tp>
+struct __unary_plus
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return +__x;}
+};
+
+template <class _Tp>
+struct __bit_not
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return ~__x;}
+};
+
+template <class _Tp>
+struct __bit_shift_left
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x << __y;}
+};
+
+template <class _Tp>
+struct __bit_shift_right
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x, const _Tp& __y) const
+        {return __x >> __y;}
+};
+
+template <class _Tp, class _Fp>
+struct __apply_expr
+{
+private:
+    _Fp __f_;
+public:
+    typedef _Tp __result_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __apply_expr(_Fp __f) : __f_(__f) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return __f_(__x);}
+};
+
+template <class _Tp>
+struct __abs_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::abs(__x);}
+};
+
+template <class _Tp>
+struct __acos_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::acos(__x);}
+};
+
+template <class _Tp>
+struct __asin_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::asin(__x);}
+};
+
+template <class _Tp>
+struct __atan_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::atan(__x);}
+};
+
+template <class _Tp>
+struct __atan2_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x, const _Tp& __y) const
+        {return std::atan2(__x, __y);}
+};
+
+template <class _Tp>
+struct __cos_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::cos(__x);}
+};
+
+template <class _Tp>
+struct __cosh_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::cosh(__x);}
+};
+
+template <class _Tp>
+struct __exp_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::exp(__x);}
+};
+
+template <class _Tp>
+struct __log_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::log(__x);}
+};
+
+template <class _Tp>
+struct __log10_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::log10(__x);}
+};
+
+template <class _Tp>
+struct __pow_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x, const _Tp& __y) const
+        {return std::pow(__x, __y);}
+};
+
+template <class _Tp>
+struct __sin_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::sin(__x);}
+};
+
+template <class _Tp>
+struct __sinh_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::sinh(__x);}
+};
+
+template <class _Tp>
+struct __sqrt_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::sqrt(__x);}
+};
+
+template <class _Tp>
+struct __tan_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::tan(__x);}
+};
+
+template <class _Tp>
+struct __tanh_expr
+{
+    typedef _Tp __result_type;
+    _LIBCPP_INLINE_VISIBILITY
+    _Tp operator()(const _Tp& __x) const
+        {return std::tanh(__x);}
+};
+
+template <class _ValExpr>
+class __slice_expr
+{
+    typedef __libcpp_remove_reference_t<_ValExpr>  _RmExpr;
+public:
+    typedef typename _RmExpr::value_type value_type;
+    typedef value_type __result_type;
+
+private:
+    _ValExpr __expr_;
+    size_t __start_;
+    size_t __size_;
+    size_t __stride_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __slice_expr(const slice& __sl, const _RmExpr& __e)
+        : __expr_(__e),
+          __start_(__sl.start()),
+          __size_(__sl.size()),
+          __stride_(__sl.stride())
+        {}
+public:
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t __i) const
+        {return __expr_[__start_ + __i * __stride_];}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __size_;}
+
+    template <class> friend class __val_expr;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS valarray;
+};
+
+template <class _ValExpr>
+class __mask_expr;
+
+template <class _ValExpr>
+class __indirect_expr;
+
+template <class _ValExpr>
+class __shift_expr
+{
+    typedef __libcpp_remove_reference_t<_ValExpr>  _RmExpr;
+public:
+    typedef typename _RmExpr::value_type value_type;
+    typedef value_type __result_type;
+
+private:
+    _ValExpr __expr_;
+    size_t __size_;
+    ptrdiff_t __ul_;
+    ptrdiff_t __sn_;
+    ptrdiff_t __n_;
+    static const ptrdiff_t _Np = static_cast<ptrdiff_t>(
+                                    sizeof(ptrdiff_t) * __CHAR_BIT__ - 1);
+
+    _LIBCPP_INLINE_VISIBILITY
+    __shift_expr(int __n, const _RmExpr& __e)
+        : __expr_(__e),
+          __size_(__e.size()),
+          __n_(__n)
+        {
+            ptrdiff_t __neg_n = static_cast<ptrdiff_t>(__n_ >> _Np);
+            __sn_ = __neg_n | static_cast<ptrdiff_t>(static_cast<size_t>(-__n_) >> _Np);
+            __ul_ = ((__size_ - __n_) & ~__neg_n) | ((__n_ + 1) & __neg_n);
+        }
+public:
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t __j) const
+        {
+            ptrdiff_t __i = static_cast<ptrdiff_t>(__j);
+            ptrdiff_t __m = (__sn_ * __i - __ul_) >> _Np;
+            return (__expr_[(__i + __n_) & __m] & __m) | (value_type() & ~__m);
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __size_;}
+
+    template <class> friend class __val_expr;
+};
+
+template <class _ValExpr>
+class __cshift_expr
+{
+    typedef __libcpp_remove_reference_t<_ValExpr>  _RmExpr;
+public:
+    typedef typename _RmExpr::value_type value_type;
+    typedef value_type __result_type;
+
+private:
+    _ValExpr __expr_;
+    size_t __size_;
+    size_t __m_;
+    size_t __o1_;
+    size_t __o2_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __cshift_expr(int __n, const _RmExpr& __e)
+        : __expr_(__e),
+          __size_(__e.size())
+        {
+            __n %= static_cast<int>(__size_);
+            if (__n >= 0)
+            {
+                __m_ = __size_ - __n;
+                __o1_ = __n;
+                __o2_ = __n - __size_;
+            }
+            else
+            {
+                __m_ = -__n;
+                __o1_ = __n + __size_;
+                __o2_ = __n;
+            }
+        }
+public:
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t __i) const
+        {
+            if (__i < __m_)
+                return __expr_[__i + __o1_];
+            return __expr_[__i + __o2_];
+        }
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __size_;}
+
+    template <class> friend class __val_expr;
+};
+
+template<class _ValExpr>
+class __val_expr;
+
+template<class _ValExpr>
+struct __is_val_expr : false_type {};
+
+template<class _ValExpr>
+struct __is_val_expr<__val_expr<_ValExpr> > : true_type {};
+
+template<class _Tp>
+struct __is_val_expr<valarray<_Tp> > : true_type {};
+
+template<class _Tp>
+class _LIBCPP_TEMPLATE_VIS valarray
+{
+public:
+    typedef _Tp value_type;
+    typedef _Tp __result_type;
+
+private:
+    value_type* __begin_;
+    value_type* __end_;
+
+public:
+    // construct/destroy:
+    _LIBCPP_INLINE_VISIBILITY
+    valarray() : __begin_(nullptr), __end_(nullptr) {}
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    explicit valarray(size_t __n);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray(const value_type& __x, size_t __n);
+    valarray(const value_type* __p, size_t __n);
+    valarray(const valarray& __v);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    valarray(valarray&& __v) _NOEXCEPT;
+    valarray(initializer_list<value_type> __il);
+#endif // _LIBCPP_CXX03_LANG
+    valarray(const slice_array<value_type>& __sa);
+    valarray(const gslice_array<value_type>& __ga);
+    valarray(const mask_array<value_type>& __ma);
+    valarray(const indirect_array<value_type>& __ia);
+    inline _LIBCPP_HIDE_FROM_ABI_AFTER_V1
+    ~valarray();
+
+    // assignment:
+    valarray& operator=(const valarray& __v);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator=(valarray&& __v) _NOEXCEPT;
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator=(initializer_list<value_type>);
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator=(const value_type& __x);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator=(const slice_array<value_type>& __sa);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator=(const gslice_array<value_type>& __ga);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator=(const mask_array<value_type>& __ma);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator=(const indirect_array<value_type>& __ia);
+    template <class _ValExpr>
+        _LIBCPP_INLINE_VISIBILITY
+        valarray& operator=(const __val_expr<_ValExpr>& __v);
+
+    // element access:
+    _LIBCPP_INLINE_VISIBILITY
+    const value_type& operator[](size_t __i) const {return __begin_[__i];}
+
+    _LIBCPP_INLINE_VISIBILITY
+    value_type&       operator[](size_t __i)       {return __begin_[__i];}
+
+    // subset operations:
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__slice_expr<const valarray&> >    operator[](slice __s) const;
+    _LIBCPP_INLINE_VISIBILITY
+    slice_array<value_type>                       operator[](slice __s);
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__indirect_expr<const valarray&> > operator[](const gslice& __gs) const;
+    _LIBCPP_INLINE_VISIBILITY
+    gslice_array<value_type>   operator[](const gslice& __gs);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__indirect_expr<const valarray&> > operator[](gslice&& __gs) const;
+    _LIBCPP_INLINE_VISIBILITY
+    gslice_array<value_type>                      operator[](gslice&& __gs);
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__mask_expr<const valarray&> >     operator[](const valarray<bool>& __vb) const;
+    _LIBCPP_INLINE_VISIBILITY
+    mask_array<value_type>                        operator[](const valarray<bool>& __vb);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__mask_expr<const valarray&> >     operator[](valarray<bool>&& __vb) const;
+    _LIBCPP_INLINE_VISIBILITY
+    mask_array<value_type>                        operator[](valarray<bool>&& __vb);
+#endif // _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__indirect_expr<const valarray&> > operator[](const valarray<size_t>& __vs) const;
+    _LIBCPP_INLINE_VISIBILITY
+    indirect_array<value_type>                    operator[](const valarray<size_t>& __vs);
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__indirect_expr<const valarray&> > operator[](valarray<size_t>&& __vs) const;
+    _LIBCPP_INLINE_VISIBILITY
+    indirect_array<value_type>                    operator[](valarray<size_t>&& __vs);
+#endif // _LIBCPP_CXX03_LANG
+
+    // unary operators:
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<_UnaryOp<__unary_plus<_Tp>, const valarray&> >   operator+() const;
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<_UnaryOp<negate<_Tp>, const valarray&> >         operator-() const;
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<_UnaryOp<__bit_not<_Tp>, const valarray&> >      operator~() const;
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<_UnaryOp<logical_not<_Tp>, const valarray&> >    operator!() const;
+
+    // computed assignment:
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator*= (const value_type& __x);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator/= (const value_type& __x);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator%= (const value_type& __x);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator+= (const value_type& __x);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator-= (const value_type& __x);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator^= (const value_type& __x);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator&= (const value_type& __x);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator|= (const value_type& __x);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator<<=(const value_type& __x);
+    _LIBCPP_INLINE_VISIBILITY
+    valarray& operator>>=(const value_type& __x);
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        valarray&
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator*= (const _Expr& __v);
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        valarray&
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator/= (const _Expr& __v);
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        valarray&
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator%= (const _Expr& __v);
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        valarray&
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator+= (const _Expr& __v);
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        valarray&
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator-= (const _Expr& __v);
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        valarray&
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator^= (const _Expr& __v);
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        valarray&
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator|= (const _Expr& __v);
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        valarray&
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator&= (const _Expr& __v);
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        valarray&
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator<<= (const _Expr& __v);
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        valarray&
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator>>= (const _Expr& __v);
+
+    // member functions:
+    _LIBCPP_INLINE_VISIBILITY
+    void swap(valarray& __v) _NOEXCEPT;
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return static_cast<size_t>(__end_ - __begin_);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    value_type sum() const;
+    _LIBCPP_INLINE_VISIBILITY
+    value_type min() const;
+    _LIBCPP_INLINE_VISIBILITY
+    value_type max() const;
+
+    valarray shift (int __i) const;
+    valarray cshift(int __i) const;
+    valarray apply(value_type __f(value_type)) const;
+    valarray apply(value_type __f(const value_type&)) const;
+    void     resize(size_t __n, value_type __x = value_type());
+
+private:
+    template <class> friend class _LIBCPP_TEMPLATE_VIS valarray;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS slice_array;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS gslice_array;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS mask_array;
+    template <class> friend class __mask_expr;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS indirect_array;
+    template <class> friend class __indirect_expr;
+    template <class> friend class __val_expr;
+
+    template <class _Up>
+    friend
+    _Up*
+    begin(valarray<_Up>& __v);
+
+    template <class _Up>
+    friend
+    const _Up*
+    begin(const valarray<_Up>& __v);
+
+    template <class _Up>
+    friend
+    _Up*
+    end(valarray<_Up>& __v);
+
+    template <class _Up>
+    friend
+    const _Up*
+    end(const valarray<_Up>& __v);
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __clear(size_t __capacity);
+    valarray& __assign_range(const value_type* __f, const value_type* __l);
+};
+
+#if _LIBCPP_STD_VER > 14
+template<class _Tp, size_t _Size>
+valarray(const _Tp(&)[_Size], size_t) -> valarray<_Tp>;
+#endif
+
+extern template _LIBCPP_FUNC_VIS void valarray<size_t>::resize(size_t, size_t);
+
+template <class _Op, class _Tp>
+struct _UnaryOp<_Op, valarray<_Tp> >
+{
+    typedef typename _Op::__result_type __result_type;
+    typedef typename decay<__result_type>::type value_type;
+
+    _Op __op_;
+    const valarray<_Tp>& __a0_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _UnaryOp(const _Op& __op, const valarray<_Tp>& __a0) : __op_(__op), __a0_(__a0) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t __i) const {return __op_(__a0_[__i]);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __a0_.size();}
+};
+
+template <class _Op, class _Tp, class _A1>
+struct _BinaryOp<_Op, valarray<_Tp>, _A1>
+{
+    typedef typename _Op::__result_type __result_type;
+    typedef typename decay<__result_type>::type value_type;
+
+    _Op __op_;
+    const valarray<_Tp>& __a0_;
+    _A1 __a1_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _BinaryOp(const _Op& __op, const valarray<_Tp>& __a0, const _A1& __a1)
+        : __op_(__op), __a0_(__a0), __a1_(__a1) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t __i) const {return __op_(__a0_[__i], __a1_[__i]);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __a0_.size();}
+};
+
+template <class _Op, class _A0, class _Tp>
+struct _BinaryOp<_Op, _A0, valarray<_Tp> >
+{
+    typedef typename _Op::__result_type __result_type;
+    typedef typename decay<__result_type>::type value_type;
+
+    _Op __op_;
+    _A0 __a0_;
+    const valarray<_Tp>& __a1_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _BinaryOp(const _Op& __op, const _A0& __a0, const valarray<_Tp>& __a1)
+        : __op_(__op), __a0_(__a0), __a1_(__a1) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t __i) const {return __op_(__a0_[__i], __a1_[__i]);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __a0_.size();}
+};
+
+template <class _Op, class _Tp>
+struct _BinaryOp<_Op, valarray<_Tp>, valarray<_Tp> >
+{
+    typedef typename _Op::__result_type __result_type;
+    typedef typename decay<__result_type>::type value_type;
+
+    _Op __op_;
+    const valarray<_Tp>& __a0_;
+    const valarray<_Tp>& __a1_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    _BinaryOp(const _Op& __op, const valarray<_Tp>& __a0, const valarray<_Tp>& __a1)
+        : __op_(__op), __a0_(__a0), __a1_(__a1) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t __i) const {return __op_(__a0_[__i], __a1_[__i]);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __a0_.size();}
+};
+
+// slice_array
+
+template <class _Tp>
+class _LIBCPP_TEMPLATE_VIS slice_array
+{
+public:
+    typedef _Tp value_type;
+
+private:
+    value_type* __vp_;
+    size_t __size_;
+    size_t __stride_;
+
+public:
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator*=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator/=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator%=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator+=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator-=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator^=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator&=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator|=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator<<=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator>>=(const _Expr& __v) const;
+
+    slice_array(slice_array const&) = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    const slice_array& operator=(const slice_array& __sa) const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator=(const value_type& __x) const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator=(const valarray<value_type>& __va) const;
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    slice_array(const slice& __sl, const valarray<value_type>& __v)
+        : __vp_(const_cast<value_type*>(__v.__begin_ + __sl.start())),
+          __size_(__sl.size()),
+          __stride_(__sl.stride())
+        {}
+
+    template <class> friend class valarray;
+    template <class> friend class sliceExpr;
+};
+
+template <class _Tp>
+inline
+const slice_array<_Tp>&
+slice_array<_Tp>::operator=(const slice_array& __sa) const
+{
+    value_type* __t = __vp_;
+    const value_type* __s = __sa.__vp_;
+    for (size_t __n = __size_; __n; --__n, __t += __stride_, __s += __sa.__stride_)
+        *__t = *__s;
+    return *this;
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+slice_array<_Tp>::operator=(const _Expr& __v) const
+{
+    value_type* __t = __vp_;
+    for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
+        *__t = __v[__i];
+}
+
+template <class _Tp>
+inline void
+slice_array<_Tp>::operator=(const valarray<value_type>& __va) const
+{
+    value_type* __t = __vp_;
+    for (size_t __i = 0; __i < __va.size(); ++__i, __t += __stride_)
+        *__t = __va[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+slice_array<_Tp>::operator*=(const _Expr& __v) const
+{
+    value_type* __t = __vp_;
+    for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
+        *__t *= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+slice_array<_Tp>::operator/=(const _Expr& __v) const
+{
+    value_type* __t = __vp_;
+    for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
+        *__t /= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+slice_array<_Tp>::operator%=(const _Expr& __v) const
+{
+    value_type* __t = __vp_;
+    for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
+        *__t %= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+slice_array<_Tp>::operator+=(const _Expr& __v) const
+{
+    value_type* __t = __vp_;
+    for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
+        *__t += __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+slice_array<_Tp>::operator-=(const _Expr& __v) const
+{
+    value_type* __t = __vp_;
+    for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
+        *__t -= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+slice_array<_Tp>::operator^=(const _Expr& __v) const
+{
+    value_type* __t = __vp_;
+    for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
+        *__t ^= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+slice_array<_Tp>::operator&=(const _Expr& __v) const
+{
+    value_type* __t = __vp_;
+    for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
+        *__t &= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+slice_array<_Tp>::operator|=(const _Expr& __v) const
+{
+    value_type* __t = __vp_;
+    for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
+        *__t |= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+slice_array<_Tp>::operator<<=(const _Expr& __v) const
+{
+    value_type* __t = __vp_;
+    for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
+        *__t <<= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+slice_array<_Tp>::operator>>=(const _Expr& __v) const
+{
+    value_type* __t = __vp_;
+    for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
+        *__t >>= __v[__i];
+}
+
+template <class _Tp>
+inline
+void
+slice_array<_Tp>::operator=(const value_type& __x) const
+{
+    value_type* __t = __vp_;
+    for (size_t __n = __size_; __n; --__n, __t += __stride_)
+        *__t = __x;
+}
+
+// gslice
+
+class _LIBCPP_TYPE_VIS gslice
+{
+    valarray<size_t> __size_;
+    valarray<size_t> __stride_;
+    valarray<size_t> __1d_;
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    gslice() {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    gslice(size_t __start, const valarray<size_t>& __size,
+                           const valarray<size_t>& __stride)
+        : __size_(__size),
+          __stride_(__stride)
+        {__init(__start);}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    gslice(size_t __start, const valarray<size_t>&  __size,
+                                 valarray<size_t>&& __stride)
+        : __size_(__size),
+          __stride_(std::move(__stride))
+        {__init(__start);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    gslice(size_t __start,       valarray<size_t>&& __size,
+                           const valarray<size_t>&  __stride)
+        : __size_(std::move(__size)),
+          __stride_(__stride)
+        {__init(__start);}
+
+    _LIBCPP_INLINE_VISIBILITY
+    gslice(size_t __start,       valarray<size_t>&& __size,
+                                 valarray<size_t>&& __stride)
+        : __size_(std::move(__size)),
+          __stride_(std::move(__stride))
+        {__init(__start);}
+
+#endif // _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t           start()  const {return __1d_.size() ? __1d_[0] : 0;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    valarray<size_t> size()   const {return __size_;}
+
+    _LIBCPP_INLINE_VISIBILITY
+    valarray<size_t> stride() const {return __stride_;}
+
+private:
+    void __init(size_t __start);
+
+    template <class> friend class gslice_array;
+    template <class> friend class valarray;
+    template <class> friend class __val_expr;
+};
+
+// gslice_array
+
+template <class _Tp>
+class _LIBCPP_TEMPLATE_VIS gslice_array
+{
+public:
+    typedef _Tp value_type;
+
+private:
+    value_type*      __vp_;
+    valarray<size_t> __1d_;
+
+public:
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator*=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator/=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator%=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator+=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator-=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator^=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator&=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator|=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator<<=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator>>=(const _Expr& __v) const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    const gslice_array& operator=(const gslice_array& __ga) const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator=(const value_type& __x) const;
+
+    gslice_array(const gslice_array&)            = default;
+
+private:
+    gslice_array(const gslice& __gs, const valarray<value_type>& __v)
+        : __vp_(const_cast<value_type*>(__v.__begin_)),
+          __1d_(__gs.__1d_)
+        {}
+
+#ifndef _LIBCPP_CXX03_LANG
+    gslice_array(gslice&& __gs, const valarray<value_type>& __v)
+        : __vp_(const_cast<value_type*>(__v.__begin_)),
+          __1d_(std::move(__gs.__1d_))
+        {}
+#endif // _LIBCPP_CXX03_LANG
+
+    template <class> friend class valarray;
+};
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+gslice_array<_Tp>::operator=(const _Expr& __v) const
+{
+    typedef const size_t* _Ip;
+    size_t __j = 0;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
+        __vp_[*__i] = __v[__j];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+gslice_array<_Tp>::operator*=(const _Expr& __v) const
+{
+    typedef const size_t* _Ip;
+    size_t __j = 0;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
+        __vp_[*__i] *= __v[__j];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+gslice_array<_Tp>::operator/=(const _Expr& __v) const
+{
+    typedef const size_t* _Ip;
+    size_t __j = 0;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
+        __vp_[*__i] /= __v[__j];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+gslice_array<_Tp>::operator%=(const _Expr& __v) const
+{
+    typedef const size_t* _Ip;
+    size_t __j = 0;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
+        __vp_[*__i] %= __v[__j];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+gslice_array<_Tp>::operator+=(const _Expr& __v) const
+{
+    typedef const size_t* _Ip;
+    size_t __j = 0;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
+        __vp_[*__i] += __v[__j];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+gslice_array<_Tp>::operator-=(const _Expr& __v) const
+{
+    typedef const size_t* _Ip;
+    size_t __j = 0;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
+        __vp_[*__i] -= __v[__j];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+gslice_array<_Tp>::operator^=(const _Expr& __v) const
+{
+    typedef const size_t* _Ip;
+    size_t __j = 0;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
+        __vp_[*__i] ^= __v[__j];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+gslice_array<_Tp>::operator&=(const _Expr& __v) const
+{
+    typedef const size_t* _Ip;
+    size_t __j = 0;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
+        __vp_[*__i] &= __v[__j];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+gslice_array<_Tp>::operator|=(const _Expr& __v) const
+{
+    typedef const size_t* _Ip;
+    size_t __j = 0;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
+        __vp_[*__i] |= __v[__j];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+gslice_array<_Tp>::operator<<=(const _Expr& __v) const
+{
+    typedef const size_t* _Ip;
+    size_t __j = 0;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
+        __vp_[*__i] <<= __v[__j];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+gslice_array<_Tp>::operator>>=(const _Expr& __v) const
+{
+    typedef const size_t* _Ip;
+    size_t __j = 0;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
+        __vp_[*__i] >>= __v[__j];
+}
+
+template <class _Tp>
+inline
+const gslice_array<_Tp>&
+gslice_array<_Tp>::operator=(const gslice_array& __ga) const
+{
+    typedef const size_t* _Ip;
+    const value_type* __s = __ga.__vp_;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_, __j = __ga.__1d_.__begin_;
+            __i != __e; ++__i, ++__j)
+        __vp_[*__i] = __s[*__j];
+    return *this;
+}
+
+template <class _Tp>
+inline
+void
+gslice_array<_Tp>::operator=(const value_type& __x) const
+{
+    typedef const size_t* _Ip;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i)
+        __vp_[*__i] = __x;
+}
+
+// mask_array
+
+template <class _Tp>
+class _LIBCPP_TEMPLATE_VIS mask_array
+{
+public:
+    typedef _Tp value_type;
+
+private:
+    value_type*      __vp_;
+    valarray<size_t> __1d_;
+
+public:
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator*=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator/=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator%=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator+=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator-=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator^=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator&=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator|=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator<<=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator>>=(const _Expr& __v) const;
+
+    mask_array(const mask_array&) = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    const mask_array& operator=(const mask_array& __ma) const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator=(const value_type& __x) const;
+
+private:
+    _LIBCPP_INLINE_VISIBILITY
+    mask_array(const valarray<bool>& __vb, const valarray<value_type>& __v)
+        : __vp_(const_cast<value_type*>(__v.__begin_)),
+          __1d_(static_cast<size_t>(count(__vb.__begin_, __vb.__end_, true)))
+          {
+              size_t __j = 0;
+              for (size_t __i = 0; __i < __vb.size(); ++__i)
+                  if (__vb[__i])
+                      __1d_[__j++] = __i;
+          }
+
+    template <class> friend class valarray;
+};
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+mask_array<_Tp>::operator=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] = __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+mask_array<_Tp>::operator*=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] *= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+mask_array<_Tp>::operator/=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] /= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+mask_array<_Tp>::operator%=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] %= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+mask_array<_Tp>::operator+=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] += __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+mask_array<_Tp>::operator-=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] -= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+mask_array<_Tp>::operator^=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] ^= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+mask_array<_Tp>::operator&=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] &= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+mask_array<_Tp>::operator|=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] |= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+mask_array<_Tp>::operator<<=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] <<= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+mask_array<_Tp>::operator>>=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] >>= __v[__i];
+}
+
+template <class _Tp>
+inline
+const mask_array<_Tp>&
+mask_array<_Tp>::operator=(const mask_array& __ma) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] = __ma.__vp_[__1d_[__i]];
+    return *this;
+}
+
+template <class _Tp>
+inline
+void
+mask_array<_Tp>::operator=(const value_type& __x) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] = __x;
+}
+
+template <class _ValExpr>
+class __mask_expr
+{
+    typedef __libcpp_remove_reference_t<_ValExpr>  _RmExpr;
+public:
+    typedef typename _RmExpr::value_type value_type;
+    typedef value_type __result_type;
+
+private:
+    _ValExpr __expr_;
+    valarray<size_t> __1d_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __mask_expr(const valarray<bool>& __vb, const _RmExpr& __e)
+        : __expr_(__e),
+          __1d_(static_cast<size_t>(count(__vb.__begin_, __vb.__end_, true)))
+          {
+              size_t __j = 0;
+              for (size_t __i = 0; __i < __vb.size(); ++__i)
+                  if (__vb[__i])
+                      __1d_[__j++] = __i;
+          }
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t __i) const
+        {return __expr_[__1d_[__i]];}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __1d_.size();}
+
+    template <class> friend class __val_expr;
+    template <class> friend class valarray;
+};
+
+// indirect_array
+
+template <class _Tp>
+class _LIBCPP_TEMPLATE_VIS indirect_array
+{
+public:
+    typedef _Tp value_type;
+
+private:
+    value_type*      __vp_;
+    valarray<size_t> __1d_;
+
+public:
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator*=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator/=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator%=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator+=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator-=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator^=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator&=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator|=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator<<=(const _Expr& __v) const;
+
+    template <class _Expr>
+    typename enable_if
+    <
+        __is_val_expr<_Expr>::value,
+        void
+    >::type
+    _LIBCPP_INLINE_VISIBILITY
+    operator>>=(const _Expr& __v) const;
+
+    indirect_array(const indirect_array&) = default;
+
+    _LIBCPP_INLINE_VISIBILITY
+    const indirect_array& operator=(const indirect_array& __ia) const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    void operator=(const value_type& __x) const;
+
+private:
+     _LIBCPP_INLINE_VISIBILITY
+   indirect_array(const valarray<size_t>& __ia, const valarray<value_type>& __v)
+        : __vp_(const_cast<value_type*>(__v.__begin_)),
+          __1d_(__ia)
+        {}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    indirect_array(valarray<size_t>&& __ia, const valarray<value_type>& __v)
+        : __vp_(const_cast<value_type*>(__v.__begin_)),
+          __1d_(std::move(__ia))
+        {}
+
+#endif // _LIBCPP_CXX03_LANG
+
+    template <class> friend class valarray;
+};
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+indirect_array<_Tp>::operator=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] = __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+indirect_array<_Tp>::operator*=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] *= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+indirect_array<_Tp>::operator/=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] /= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+indirect_array<_Tp>::operator%=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] %= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+indirect_array<_Tp>::operator+=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] += __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+indirect_array<_Tp>::operator-=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] -= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+indirect_array<_Tp>::operator^=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] ^= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+indirect_array<_Tp>::operator&=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] &= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+indirect_array<_Tp>::operator|=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] |= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+indirect_array<_Tp>::operator<<=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] <<= __v[__i];
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    void
+>::type
+indirect_array<_Tp>::operator>>=(const _Expr& __v) const
+{
+    size_t __n = __1d_.size();
+    for (size_t __i = 0; __i < __n; ++__i)
+        __vp_[__1d_[__i]] >>= __v[__i];
+}
+
+template <class _Tp>
+inline
+const indirect_array<_Tp>&
+indirect_array<_Tp>::operator=(const indirect_array& __ia) const
+{
+    typedef const size_t* _Ip;
+    const value_type* __s = __ia.__vp_;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_, __j = __ia.__1d_.__begin_;
+            __i != __e; ++__i, ++__j)
+        __vp_[*__i] = __s[*__j];
+    return *this;
+}
+
+template <class _Tp>
+inline
+void
+indirect_array<_Tp>::operator=(const value_type& __x) const
+{
+    typedef const size_t* _Ip;
+    for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i)
+        __vp_[*__i] = __x;
+}
+
+template <class _ValExpr>
+class __indirect_expr
+{
+    typedef __libcpp_remove_reference_t<_ValExpr>  _RmExpr;
+public:
+    typedef typename _RmExpr::value_type value_type;
+    typedef value_type __result_type;
+
+private:
+    _ValExpr __expr_;
+    valarray<size_t> __1d_;
+
+    _LIBCPP_INLINE_VISIBILITY
+    __indirect_expr(const valarray<size_t>& __ia, const _RmExpr& __e)
+        : __expr_(__e),
+          __1d_(__ia)
+          {}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+    _LIBCPP_INLINE_VISIBILITY
+    __indirect_expr(valarray<size_t>&& __ia, const _RmExpr& __e)
+        : __expr_(__e),
+          __1d_(std::move(__ia))
+          {}
+
+#endif // _LIBCPP_CXX03_LANG
+
+public:
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t __i) const
+        {return __expr_[__1d_[__i]];}
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __1d_.size();}
+
+    template <class> friend class __val_expr;
+    template <class> friend class _LIBCPP_TEMPLATE_VIS valarray;
+};
+
+template<class _ValExpr>
+class __val_expr
+{
+    typedef __libcpp_remove_reference_t<_ValExpr>  _RmExpr;
+
+    _ValExpr __expr_;
+public:
+    typedef typename _RmExpr::value_type value_type;
+    typedef typename _RmExpr::__result_type __result_type;
+
+    _LIBCPP_INLINE_VISIBILITY
+    explicit __val_expr(const _RmExpr& __e) : __expr_(__e) {}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type operator[](size_t __i) const
+        {return __expr_[__i];}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__slice_expr<_ValExpr> > operator[](slice __s) const
+    {
+        typedef __slice_expr<_ValExpr> _NewExpr;
+        return __val_expr< _NewExpr >(_NewExpr(__s, __expr_));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__indirect_expr<_ValExpr> > operator[](const gslice& __gs) const
+    {
+        typedef __indirect_expr<_ValExpr> _NewExpr;
+        return __val_expr<_NewExpr >(_NewExpr(__gs.__1d_, __expr_));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__mask_expr<_ValExpr> > operator[](const valarray<bool>& __vb) const
+    {
+        typedef __mask_expr<_ValExpr> _NewExpr;
+        return __val_expr< _NewExpr >( _NewExpr(__vb, __expr_));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__indirect_expr<_ValExpr> > operator[](const valarray<size_t>& __vs) const
+    {
+        typedef __indirect_expr<_ValExpr> _NewExpr;
+        return __val_expr< _NewExpr >(_NewExpr(__vs, __expr_));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<_UnaryOp<__unary_plus<value_type>, _ValExpr> >
+    operator+() const
+    {
+        typedef _UnaryOp<__unary_plus<value_type>, _ValExpr> _NewExpr;
+        return __val_expr<_NewExpr>(_NewExpr(__unary_plus<value_type>(), __expr_));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<_UnaryOp<negate<value_type>, _ValExpr> >
+    operator-() const
+    {
+        typedef _UnaryOp<negate<value_type>, _ValExpr> _NewExpr;
+        return __val_expr<_NewExpr>(_NewExpr(negate<value_type>(), __expr_));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<_UnaryOp<__bit_not<value_type>, _ValExpr> >
+    operator~() const
+    {
+        typedef _UnaryOp<__bit_not<value_type>, _ValExpr> _NewExpr;
+        return __val_expr<_NewExpr>(_NewExpr(__bit_not<value_type>(), __expr_));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<_UnaryOp<logical_not<value_type>, _ValExpr> >
+    operator!() const
+    {
+        typedef _UnaryOp<logical_not<value_type>, _ValExpr> _NewExpr;
+        return __val_expr<_NewExpr>(_NewExpr(logical_not<value_type>(), __expr_));
+    }
+
+    operator valarray<__result_type>() const;
+
+    _LIBCPP_INLINE_VISIBILITY
+    size_t size() const {return __expr_.size();}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type sum() const
+    {
+        size_t __n = __expr_.size();
+        __result_type __r = __n ? __expr_[0] : __result_type();
+        for (size_t __i = 1; __i < __n; ++__i)
+            __r += __expr_[__i];
+        return __r;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type min() const
+    {
+        size_t __n = size();
+        __result_type __r = __n ? (*this)[0] : __result_type();
+        for (size_t __i = 1; __i < __n; ++__i)
+        {
+            __result_type __x = __expr_[__i];
+            if (__x < __r)
+                __r = __x;
+        }
+        return __r;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __result_type max() const
+    {
+        size_t __n = size();
+        __result_type __r = __n ? (*this)[0] : __result_type();
+        for (size_t __i = 1; __i < __n; ++__i)
+        {
+            __result_type __x = __expr_[__i];
+            if (__r < __x)
+                __r = __x;
+        }
+        return __r;
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__shift_expr<_ValExpr> > shift (int __i) const
+        {return __val_expr<__shift_expr<_ValExpr> >(__shift_expr<_ValExpr>(__i, __expr_));}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<__cshift_expr<_ValExpr> > cshift(int __i) const
+        {return __val_expr<__cshift_expr<_ValExpr> >(__cshift_expr<_ValExpr>(__i, __expr_));}
+
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<_UnaryOp<__apply_expr<value_type, value_type(*)(value_type)>, _ValExpr> >
+    apply(value_type __f(value_type)) const
+    {
+        typedef __apply_expr<value_type, value_type(*)(value_type)> _Op;
+        typedef _UnaryOp<_Op, _ValExpr> _NewExpr;
+        return __val_expr<_NewExpr>(_NewExpr(_Op(__f), __expr_));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    __val_expr<_UnaryOp<__apply_expr<value_type, value_type(*)(const value_type&)>, _ValExpr> >
+    apply(value_type __f(const value_type&)) const
+    {
+        typedef __apply_expr<value_type, value_type(*)(const value_type&)> _Op;
+        typedef _UnaryOp<_Op, _ValExpr> _NewExpr;
+        return __val_expr<_NewExpr>(_NewExpr(_Op(__f), __expr_));
+    }
+};
+
+template<class _ValExpr>
+__val_expr<_ValExpr>::operator valarray<__val_expr::__result_type>() const
+{
+    valarray<__result_type> __r;
+    size_t __n = __expr_.size();
+    if (__n)
+    {
+        __r.__begin_ =
+            __r.__end_ = allocator<__result_type>().allocate(__n);
+        for (size_t __i = 0; __i != __n; ++__r.__end_, ++__i)
+            ::new ((void*)__r.__end_) __result_type(__expr_[__i]);
+    }
+    return __r;
+}
+
+// valarray
+
+template <class _Tp>
+inline
+valarray<_Tp>::valarray(size_t __n)
+    : __begin_(nullptr),
+      __end_(nullptr)
+{
+    if (__n)
+    {
+        __begin_ = __end_ = allocator<value_type>().allocate(__n);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (size_t __n_left = __n; __n_left; --__n_left, ++__end_)
+                ::new ((void*)__end_) value_type();
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __clear(__n);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>::valarray(const value_type& __x, size_t __n)
+    : __begin_(nullptr),
+      __end_(nullptr)
+{
+    resize(__n, __x);
+}
+
+template <class _Tp>
+valarray<_Tp>::valarray(const value_type* __p, size_t __n)
+    : __begin_(nullptr),
+      __end_(nullptr)
+{
+    if (__n)
+    {
+        __begin_ = __end_ = allocator<value_type>().allocate(__n);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (size_t __n_left = __n; __n_left; ++__end_, ++__p, --__n_left)
+                ::new ((void*)__end_) value_type(*__p);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __clear(__n);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+template <class _Tp>
+valarray<_Tp>::valarray(const valarray& __v)
+    : __begin_(nullptr),
+      __end_(nullptr)
+{
+    if (__v.size())
+    {
+        __begin_ = __end_ = allocator<value_type>().allocate(__v.size());
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (value_type* __p = __v.__begin_; __p != __v.__end_; ++__end_, ++__p)
+                ::new ((void*)__end_) value_type(*__p);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __clear(__v.size());
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp>
+inline
+valarray<_Tp>::valarray(valarray&& __v) _NOEXCEPT
+    : __begin_(__v.__begin_),
+      __end_(__v.__end_)
+{
+    __v.__begin_ = __v.__end_ = nullptr;
+}
+
+template <class _Tp>
+valarray<_Tp>::valarray(initializer_list<value_type> __il)
+    : __begin_(nullptr),
+      __end_(nullptr)
+{
+    const size_t __n = __il.size();
+    if (__n)
+    {
+        __begin_ = __end_ = allocator<value_type>().allocate(__n);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            size_t __n_left = __n;
+            for (const value_type* __p = __il.begin(); __n_left; ++__end_, ++__p, --__n_left)
+                ::new ((void*)__end_) value_type(*__p);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __clear(__n);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp>
+valarray<_Tp>::valarray(const slice_array<value_type>& __sa)
+    : __begin_(nullptr),
+      __end_(nullptr)
+{
+    const size_t __n = __sa.__size_;
+    if (__n)
+    {
+        __begin_ = __end_ = allocator<value_type>().allocate(__n);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            size_t __n_left = __n;
+            for (const value_type* __p = __sa.__vp_; __n_left; ++__end_, __p += __sa.__stride_, --__n_left)
+                ::new ((void*)__end_) value_type(*__p);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __clear(__n);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+template <class _Tp>
+valarray<_Tp>::valarray(const gslice_array<value_type>& __ga)
+    : __begin_(nullptr),
+      __end_(nullptr)
+{
+    const size_t __n = __ga.__1d_.size();
+    if (__n)
+    {
+        __begin_ = __end_ = allocator<value_type>().allocate(__n);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            typedef const size_t* _Ip;
+            const value_type* __s = __ga.__vp_;
+            for (_Ip __i = __ga.__1d_.__begin_, __e = __ga.__1d_.__end_;
+                    __i != __e; ++__i, ++__end_)
+                ::new ((void*)__end_) value_type(__s[*__i]);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __clear(__n);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+template <class _Tp>
+valarray<_Tp>::valarray(const mask_array<value_type>& __ma)
+    : __begin_(nullptr),
+      __end_(nullptr)
+{
+    const size_t __n = __ma.__1d_.size();
+    if (__n)
+    {
+        __begin_ = __end_ = allocator<value_type>().allocate(__n);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            typedef const size_t* _Ip;
+            const value_type* __s = __ma.__vp_;
+            for (_Ip __i = __ma.__1d_.__begin_, __e = __ma.__1d_.__end_;
+                    __i != __e; ++__i, ++__end_)
+                ::new ((void*)__end_) value_type(__s[*__i]);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __clear(__n);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+template <class _Tp>
+valarray<_Tp>::valarray(const indirect_array<value_type>& __ia)
+    : __begin_(nullptr),
+      __end_(nullptr)
+{
+    const size_t __n = __ia.__1d_.size();
+    if (__n)
+    {
+        __begin_ = __end_ = allocator<value_type>().allocate(__n);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            typedef const size_t* _Ip;
+            const value_type* __s = __ia.__vp_;
+            for (_Ip __i = __ia.__1d_.__begin_, __e = __ia.__1d_.__end_;
+                    __i != __e; ++__i, ++__end_)
+                ::new ((void*)__end_) value_type(__s[*__i]);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __clear(__n);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>::~valarray()
+{
+    __clear(size());
+}
+
+template <class _Tp>
+valarray<_Tp>&
+valarray<_Tp>::__assign_range(const value_type* __f, const value_type* __l)
+{
+    size_t __n = __l - __f;
+    if (size() != __n)
+    {
+        __clear(size());
+        __begin_ = allocator<value_type>().allocate(__n);
+        __end_ = __begin_ + __n;
+        _VSTD::uninitialized_copy(__f, __l, __begin_);
+    } else {
+        _VSTD::copy(__f, __l, __begin_);
+    }
+    return *this;
+}
+
+template <class _Tp>
+valarray<_Tp>&
+valarray<_Tp>::operator=(const valarray& __v)
+{
+    if (this != _VSTD::addressof(__v))
+        return __assign_range(__v.__begin_, __v.__end_);
+    return *this;
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator=(valarray&& __v) _NOEXCEPT
+{
+    __clear(size());
+    __begin_ = __v.__begin_;
+    __end_ = __v.__end_;
+    __v.__begin_ = nullptr;
+    __v.__end_ = nullptr;
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator=(initializer_list<value_type> __il)
+{
+    return __assign_range(__il.begin(), __il.end());
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator=(const value_type& __x)
+{
+    _VSTD::fill(__begin_, __end_, __x);
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator=(const slice_array<value_type>& __sa)
+{
+    value_type* __t = __begin_;
+    const value_type* __s = __sa.__vp_;
+    for (size_t __n = __sa.__size_; __n; --__n, __s += __sa.__stride_, ++__t)
+        *__t = *__s;
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator=(const gslice_array<value_type>& __ga)
+{
+    typedef const size_t* _Ip;
+    value_type* __t = __begin_;
+    const value_type* __s = __ga.__vp_;
+    for (_Ip __i = __ga.__1d_.__begin_, __e = __ga.__1d_.__end_;
+                    __i != __e; ++__i, ++__t)
+        *__t = __s[*__i];
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator=(const mask_array<value_type>& __ma)
+{
+    typedef const size_t* _Ip;
+    value_type* __t = __begin_;
+    const value_type* __s = __ma.__vp_;
+    for (_Ip __i = __ma.__1d_.__begin_, __e = __ma.__1d_.__end_;
+                    __i != __e; ++__i, ++__t)
+        *__t = __s[*__i];
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator=(const indirect_array<value_type>& __ia)
+{
+    typedef const size_t* _Ip;
+    value_type* __t = __begin_;
+    const value_type* __s = __ia.__vp_;
+    for (_Ip __i = __ia.__1d_.__begin_, __e = __ia.__1d_.__end_;
+                    __i != __e; ++__i, ++__t)
+        *__t = __s[*__i];
+    return *this;
+}
+
+template <class _Tp>
+template <class _ValExpr>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator=(const __val_expr<_ValExpr>& __v)
+{
+    size_t __n = __v.size();
+    if (size() != __n)
+        resize(__n);
+    value_type* __t = __begin_;
+    for (size_t __i = 0; __i != __n; ++__t, ++__i)
+        *__t = __result_type(__v[__i]);
+    return *this;
+}
+
+template <class _Tp>
+inline
+__val_expr<__slice_expr<const valarray<_Tp>&> >
+valarray<_Tp>::operator[](slice __s) const
+{
+    return __val_expr<__slice_expr<const valarray&> >(__slice_expr<const valarray&>(__s, *this));
+}
+
+template <class _Tp>
+inline
+slice_array<_Tp>
+valarray<_Tp>::operator[](slice __s)
+{
+    return slice_array<value_type>(__s, *this);
+}
+
+template <class _Tp>
+inline
+__val_expr<__indirect_expr<const valarray<_Tp>&> >
+valarray<_Tp>::operator[](const gslice& __gs) const
+{
+    return __val_expr<__indirect_expr<const valarray&> >(__indirect_expr<const valarray&>(__gs.__1d_, *this));
+}
+
+template <class _Tp>
+inline
+gslice_array<_Tp>
+valarray<_Tp>::operator[](const gslice& __gs)
+{
+    return gslice_array<value_type>(__gs, *this);
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp>
+inline
+__val_expr<__indirect_expr<const valarray<_Tp>&> >
+valarray<_Tp>::operator[](gslice&& __gs) const
+{
+    return __val_expr<__indirect_expr<const valarray&> >(__indirect_expr<const valarray&>(std::move(__gs.__1d_), *this));
+}
+
+template <class _Tp>
+inline
+gslice_array<_Tp>
+valarray<_Tp>::operator[](gslice&& __gs)
+{
+    return gslice_array<value_type>(std::move(__gs), *this);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp>
+inline
+__val_expr<__mask_expr<const valarray<_Tp>&> >
+valarray<_Tp>::operator[](const valarray<bool>& __vb) const
+{
+    return __val_expr<__mask_expr<const valarray&> >(__mask_expr<const valarray&>(__vb, *this));
+}
+
+template <class _Tp>
+inline
+mask_array<_Tp>
+valarray<_Tp>::operator[](const valarray<bool>& __vb)
+{
+    return mask_array<value_type>(__vb, *this);
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp>
+inline
+__val_expr<__mask_expr<const valarray<_Tp>&> >
+valarray<_Tp>::operator[](valarray<bool>&& __vb) const
+{
+    return __val_expr<__mask_expr<const valarray&> >(__mask_expr<const valarray&>(std::move(__vb), *this));
+}
+
+template <class _Tp>
+inline
+mask_array<_Tp>
+valarray<_Tp>::operator[](valarray<bool>&& __vb)
+{
+    return mask_array<value_type>(std::move(__vb), *this);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp>
+inline
+__val_expr<__indirect_expr<const valarray<_Tp>&> >
+valarray<_Tp>::operator[](const valarray<size_t>& __vs) const
+{
+    return __val_expr<__indirect_expr<const valarray&> >(__indirect_expr<const valarray&>(__vs, *this));
+}
+
+template <class _Tp>
+inline
+indirect_array<_Tp>
+valarray<_Tp>::operator[](const valarray<size_t>& __vs)
+{
+    return indirect_array<value_type>(__vs, *this);
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp>
+inline
+__val_expr<__indirect_expr<const valarray<_Tp>&> >
+valarray<_Tp>::operator[](valarray<size_t>&& __vs) const
+{
+    return __val_expr<__indirect_expr<const valarray&> >(__indirect_expr<const valarray&>(std::move(__vs), *this));
+}
+
+template <class _Tp>
+inline
+indirect_array<_Tp>
+valarray<_Tp>::operator[](valarray<size_t>&& __vs)
+{
+    return indirect_array<value_type>(std::move(__vs), *this);
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp>
+inline
+__val_expr<_UnaryOp<__unary_plus<_Tp>, const valarray<_Tp>&> >
+valarray<_Tp>::operator+() const
+{
+    using _Op = _UnaryOp<__unary_plus<_Tp>, const valarray<_Tp>&>;
+    return __val_expr<_Op>(_Op(__unary_plus<_Tp>(), *this));
+}
+
+template <class _Tp>
+inline
+__val_expr<_UnaryOp<negate<_Tp>, const valarray<_Tp>&> >
+valarray<_Tp>::operator-() const
+{
+    using _Op = _UnaryOp<negate<_Tp>, const valarray<_Tp>&>;
+    return __val_expr<_Op>(_Op(negate<_Tp>(), *this));
+}
+
+template <class _Tp>
+inline
+__val_expr<_UnaryOp<__bit_not<_Tp>, const valarray<_Tp>&> >
+valarray<_Tp>::operator~() const
+{
+    using _Op = _UnaryOp<__bit_not<_Tp>, const valarray<_Tp>&>;
+    return __val_expr<_Op>(_Op(__bit_not<_Tp>(), *this));
+}
+
+template <class _Tp>
+inline
+__val_expr<_UnaryOp<logical_not<_Tp>, const valarray<_Tp>&> >
+valarray<_Tp>::operator!() const
+{
+    using _Op = _UnaryOp<logical_not<_Tp>, const valarray<_Tp>&>;
+    return __val_expr<_Op>(_Op(logical_not<_Tp>(), *this));
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator*=(const value_type& __x)
+{
+    for (value_type* __p = __begin_; __p != __end_; ++__p)
+        *__p *= __x;
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator/=(const value_type& __x)
+{
+    for (value_type* __p = __begin_; __p != __end_; ++__p)
+        *__p /= __x;
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator%=(const value_type& __x)
+{
+    for (value_type* __p = __begin_; __p != __end_; ++__p)
+        *__p %= __x;
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator+=(const value_type& __x)
+{
+    for (value_type* __p = __begin_; __p != __end_; ++__p)
+        *__p += __x;
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator-=(const value_type& __x)
+{
+    for (value_type* __p = __begin_; __p != __end_; ++__p)
+        *__p -= __x;
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator^=(const value_type& __x)
+{
+    for (value_type* __p = __begin_; __p != __end_; ++__p)
+        *__p ^= __x;
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator&=(const value_type& __x)
+{
+    for (value_type* __p = __begin_; __p != __end_; ++__p)
+        *__p &= __x;
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator|=(const value_type& __x)
+{
+    for (value_type* __p = __begin_; __p != __end_; ++__p)
+        *__p |= __x;
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator<<=(const value_type& __x)
+{
+    for (value_type* __p = __begin_; __p != __end_; ++__p)
+        *__p <<= __x;
+    return *this;
+}
+
+template <class _Tp>
+inline
+valarray<_Tp>&
+valarray<_Tp>::operator>>=(const value_type& __x)
+{
+    for (value_type* __p = __begin_; __p != __end_; ++__p)
+        *__p >>= __x;
+    return *this;
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    valarray<_Tp>&
+>::type
+valarray<_Tp>::operator*=(const _Expr& __v)
+{
+    size_t __i = 0;
+    for (value_type* __t = __begin_; __t != __end_ ; ++__t, ++__i)
+        *__t *= __v[__i];
+    return *this;
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    valarray<_Tp>&
+>::type
+valarray<_Tp>::operator/=(const _Expr& __v)
+{
+    size_t __i = 0;
+    for (value_type* __t = __begin_; __t != __end_ ; ++__t, ++__i)
+        *__t /= __v[__i];
+    return *this;
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    valarray<_Tp>&
+>::type
+valarray<_Tp>::operator%=(const _Expr& __v)
+{
+    size_t __i = 0;
+    for (value_type* __t = __begin_; __t != __end_ ; ++__t, ++__i)
+        *__t %= __v[__i];
+    return *this;
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    valarray<_Tp>&
+>::type
+valarray<_Tp>::operator+=(const _Expr& __v)
+{
+    size_t __i = 0;
+    for (value_type* __t = __begin_; __t != __end_ ; ++__t, ++__i)
+        *__t += __v[__i];
+    return *this;
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    valarray<_Tp>&
+>::type
+valarray<_Tp>::operator-=(const _Expr& __v)
+{
+    size_t __i = 0;
+    for (value_type* __t = __begin_; __t != __end_ ; ++__t, ++__i)
+        *__t -= __v[__i];
+    return *this;
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    valarray<_Tp>&
+>::type
+valarray<_Tp>::operator^=(const _Expr& __v)
+{
+    size_t __i = 0;
+    for (value_type* __t = __begin_; __t != __end_ ; ++__t, ++__i)
+        *__t ^= __v[__i];
+    return *this;
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    valarray<_Tp>&
+>::type
+valarray<_Tp>::operator|=(const _Expr& __v)
+{
+    size_t __i = 0;
+    for (value_type* __t = __begin_; __t != __end_ ; ++__t, ++__i)
+        *__t |= __v[__i];
+    return *this;
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    valarray<_Tp>&
+>::type
+valarray<_Tp>::operator&=(const _Expr& __v)
+{
+    size_t __i = 0;
+    for (value_type* __t = __begin_; __t != __end_ ; ++__t, ++__i)
+        *__t &= __v[__i];
+    return *this;
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    valarray<_Tp>&
+>::type
+valarray<_Tp>::operator<<=(const _Expr& __v)
+{
+    size_t __i = 0;
+    for (value_type* __t = __begin_; __t != __end_ ; ++__t, ++__i)
+        *__t <<= __v[__i];
+    return *this;
+}
+
+template <class _Tp>
+template <class _Expr>
+inline
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    valarray<_Tp>&
+>::type
+valarray<_Tp>::operator>>=(const _Expr& __v)
+{
+    size_t __i = 0;
+    for (value_type* __t = __begin_; __t != __end_ ; ++__t, ++__i)
+        *__t >>= __v[__i];
+    return *this;
+}
+
+template <class _Tp>
+inline
+void
+valarray<_Tp>::swap(valarray& __v) _NOEXCEPT
+{
+    _VSTD::swap(__begin_, __v.__begin_);
+    _VSTD::swap(__end_, __v.__end_);
+}
+
+template <class _Tp>
+inline
+_Tp
+valarray<_Tp>::sum() const
+{
+    if (__begin_ == __end_)
+        return value_type();
+    const value_type* __p = __begin_;
+    _Tp __r = *__p;
+    for (++__p; __p != __end_; ++__p)
+        __r += *__p;
+    return __r;
+}
+
+template <class _Tp>
+inline
+_Tp
+valarray<_Tp>::min() const
+{
+    if (__begin_ == __end_)
+        return value_type();
+    return *_VSTD::min_element(__begin_, __end_);
+}
+
+template <class _Tp>
+inline
+_Tp
+valarray<_Tp>::max() const
+{
+    if (__begin_ == __end_)
+        return value_type();
+    return *_VSTD::max_element(__begin_, __end_);
+}
+
+template <class _Tp>
+valarray<_Tp>
+valarray<_Tp>::shift(int __i) const
+{
+    valarray<value_type> __r;
+    size_t __n = size();
+    if (__n)
+    {
+        __r.__begin_ = __r.__end_ = allocator<value_type>().allocate(__n);
+        const value_type* __sb;
+        value_type* __tb;
+        value_type* __te;
+        if (__i >= 0)
+        {
+            __i = _VSTD::min(__i, static_cast<int>(__n));
+            __sb = __begin_ + __i;
+            __tb = __r.__begin_;
+            __te = __r.__begin_ + (__n - __i);
+        }
+        else
+        {
+            __i = _VSTD::min(-__i, static_cast<int>(__n));
+            __sb = __begin_;
+            __tb = __r.__begin_ + __i;
+            __te = __r.__begin_ + __n;
+        }
+        for (; __r.__end_ != __tb; ++__r.__end_)
+            ::new ((void*)__r.__end_) value_type();
+        for (; __r.__end_ != __te; ++__r.__end_, ++__sb)
+            ::new ((void*)__r.__end_) value_type(*__sb);
+        for (__te = __r.__begin_ + __n; __r.__end_ != __te; ++__r.__end_)
+            ::new ((void*)__r.__end_) value_type();
+    }
+    return __r;
+}
+
+template <class _Tp>
+valarray<_Tp>
+valarray<_Tp>::cshift(int __i) const
+{
+    valarray<value_type> __r;
+    size_t __n = size();
+    if (__n)
+    {
+        __r.__begin_ = __r.__end_ = allocator<value_type>().allocate(__n);
+        __i %= static_cast<int>(__n);
+        const value_type* __m = __i >= 0 ? __begin_ + __i : __end_ + __i;
+        for (const value_type* __s = __m; __s != __end_; ++__r.__end_, ++__s)
+            ::new ((void*)__r.__end_) value_type(*__s);
+        for (const value_type* __s = __begin_; __s != __m; ++__r.__end_, ++__s)
+            ::new ((void*)__r.__end_) value_type(*__s);
+    }
+    return __r;
+}
+
+template <class _Tp>
+valarray<_Tp>
+valarray<_Tp>::apply(value_type __f(value_type)) const
+{
+    valarray<value_type> __r;
+    size_t __n = size();
+    if (__n)
+    {
+        __r.__begin_ = __r.__end_ = allocator<value_type>().allocate(__n);
+        for (const value_type* __p = __begin_; __n; ++__r.__end_, ++__p, --__n)
+            ::new ((void*)__r.__end_) value_type(__f(*__p));
+    }
+    return __r;
+}
+
+template <class _Tp>
+valarray<_Tp>
+valarray<_Tp>::apply(value_type __f(const value_type&)) const
+{
+    valarray<value_type> __r;
+    size_t __n = size();
+    if (__n)
+    {
+        __r.__begin_ = __r.__end_ = allocator<value_type>().allocate(__n);
+        for (const value_type* __p = __begin_; __n; ++__r.__end_, ++__p, --__n)
+            ::new ((void*)__r.__end_) value_type(__f(*__p));
+    }
+    return __r;
+}
+
+template <class _Tp>
+inline
+void valarray<_Tp>::__clear(size_t __capacity)
+{
+  if (__begin_ != nullptr)
+  {
+    while (__end_ != __begin_)
+      (--__end_)->~value_type();
+    allocator<value_type>().deallocate(__begin_, __capacity);
+    __begin_ = __end_ = nullptr;
+  }
+}
+
+template <class _Tp>
+void
+valarray<_Tp>::resize(size_t __n, value_type __x)
+{
+    __clear(size());
+    if (__n)
+    {
+        __begin_ = __end_ = allocator<value_type>().allocate(__n);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            for (size_t __n_left = __n; __n_left; --__n_left, ++__end_)
+                ::new ((void*)__end_) value_type(__x);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            __clear(__n);
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+template<class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+void
+swap(valarray<_Tp>& __x, valarray<_Tp>& __y) _NOEXCEPT
+{
+    __x.swap(__y);
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<multiplies<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator*(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<multiplies<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(multiplies<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<multiplies<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator*(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<multiplies<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(multiplies<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<multiplies<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator*(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<multiplies<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(multiplies<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<divides<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator/(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<divides<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(divides<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<divides<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator/(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<divides<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(divides<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<divides<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator/(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<divides<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(divides<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<modulus<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator%(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<modulus<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(modulus<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<modulus<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator%(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<modulus<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(modulus<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<modulus<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator%(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<modulus<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(modulus<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<plus<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator+(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<plus<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(plus<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<plus<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator+(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<plus<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(plus<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<plus<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator+(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<plus<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(plus<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<minus<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator-(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<minus<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(minus<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<minus<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator-(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<minus<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(minus<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<minus<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator-(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<minus<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(minus<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<bit_xor<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator^(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<bit_xor<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(bit_xor<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<bit_xor<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator^(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<bit_xor<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(bit_xor<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<bit_xor<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator^(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<bit_xor<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(bit_xor<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<bit_and<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator&(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<bit_and<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(bit_and<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<bit_and<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator&(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<bit_and<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(bit_and<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<bit_and<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator&(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<bit_and<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(bit_and<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<bit_or<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator|(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<bit_or<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(bit_or<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<bit_or<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator|(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<bit_or<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(bit_or<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<bit_or<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator|(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<bit_or<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(bit_or<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<__bit_shift_left<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator<<(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<__bit_shift_left<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(__bit_shift_left<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<__bit_shift_left<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator<<(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<__bit_shift_left<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(__bit_shift_left<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<__bit_shift_left<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator<<(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<__bit_shift_left<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__bit_shift_left<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<__bit_shift_right<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator>>(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<__bit_shift_right<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(__bit_shift_right<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<__bit_shift_right<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator>>(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<__bit_shift_right<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(__bit_shift_right<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<__bit_shift_right<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator>>(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<__bit_shift_right<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__bit_shift_right<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<logical_and<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator&&(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<logical_and<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(logical_and<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<logical_and<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator&&(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<logical_and<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(logical_and<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<logical_and<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator&&(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<logical_and<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(logical_and<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<logical_or<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator||(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<logical_or<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(logical_or<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<logical_or<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator||(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<logical_or<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(logical_or<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<logical_or<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator||(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<logical_or<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(logical_or<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<equal_to<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator==(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<equal_to<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(equal_to<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<equal_to<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator==(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<equal_to<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(equal_to<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<equal_to<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator==(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<equal_to<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(equal_to<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<not_equal_to<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator!=(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<not_equal_to<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(not_equal_to<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<not_equal_to<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator!=(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<not_equal_to<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(not_equal_to<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<not_equal_to<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator!=(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<not_equal_to<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(not_equal_to<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<less<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator<(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<less<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(less<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<less<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator<(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<less<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(less<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<less<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator<(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<less<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(less<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<greater<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator>(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<greater<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(greater<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<greater<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator>(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<greater<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(greater<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<greater<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator>(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<greater<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(greater<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<less_equal<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator<=(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<less_equal<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(less_equal<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<less_equal<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator<=(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<less_equal<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(less_equal<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<less_equal<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator<=(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<less_equal<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(less_equal<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<greater_equal<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+operator>=(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<greater_equal<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(greater_equal<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<greater_equal<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+operator>=(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<greater_equal<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(greater_equal<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<greater_equal<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+operator>=(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<greater_equal<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(greater_equal<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__abs_expr<typename _Expr::value_type>, _Expr> >
+>::type
+abs(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__abs_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__abs_expr<value_type>(), __x));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__acos_expr<typename _Expr::value_type>, _Expr> >
+>::type
+acos(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__acos_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__acos_expr<value_type>(), __x));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__asin_expr<typename _Expr::value_type>, _Expr> >
+>::type
+asin(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__asin_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__asin_expr<value_type>(), __x));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__atan_expr<typename _Expr::value_type>, _Expr> >
+>::type
+atan(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__atan_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__atan_expr<value_type>(), __x));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<__atan2_expr<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+atan2(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<__atan2_expr<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(__atan2_expr<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<__atan2_expr<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+atan2(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<__atan2_expr<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(__atan2_expr<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<__atan2_expr<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+atan2(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<__atan2_expr<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__atan2_expr<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__cos_expr<typename _Expr::value_type>, _Expr> >
+>::type
+cos(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__cos_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__cos_expr<value_type>(), __x));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__cosh_expr<typename _Expr::value_type>, _Expr> >
+>::type
+cosh(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__cosh_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__cosh_expr<value_type>(), __x));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__exp_expr<typename _Expr::value_type>, _Expr> >
+>::type
+exp(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__exp_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__exp_expr<value_type>(), __x));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__log_expr<typename _Expr::value_type>, _Expr> >
+>::type
+log(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__log_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__log_expr<value_type>(), __x));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__log10_expr<typename _Expr::value_type>, _Expr> >
+>::type
+log10(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__log10_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__log10_expr<value_type>(), __x));
+}
+
+template<class _Expr1, class _Expr2>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr1>::value && __is_val_expr<_Expr2>::value,
+    __val_expr<_BinaryOp<__pow_expr<typename _Expr1::value_type>, _Expr1, _Expr2> >
+>::type
+pow(const _Expr1& __x, const _Expr2& __y)
+{
+    typedef typename _Expr1::value_type value_type;
+    typedef _BinaryOp<__pow_expr<value_type>, _Expr1, _Expr2> _Op;
+    return __val_expr<_Op>(_Op(__pow_expr<value_type>(), __x, __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<__pow_expr<typename _Expr::value_type>,
+               _Expr, __scalar_expr<typename _Expr::value_type> > >
+>::type
+pow(const _Expr& __x, const typename _Expr::value_type& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<__pow_expr<value_type>, _Expr, __scalar_expr<value_type> > _Op;
+    return __val_expr<_Op>(_Op(__pow_expr<value_type>(),
+                           __x, __scalar_expr<value_type>(__y, __x.size())));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_BinaryOp<__pow_expr<typename _Expr::value_type>,
+               __scalar_expr<typename _Expr::value_type>, _Expr> >
+>::type
+pow(const typename _Expr::value_type& __x, const _Expr& __y)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _BinaryOp<__pow_expr<value_type>, __scalar_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__pow_expr<value_type>(),
+                           __scalar_expr<value_type>(__x, __y.size()), __y));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__sin_expr<typename _Expr::value_type>, _Expr> >
+>::type
+sin(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__sin_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__sin_expr<value_type>(), __x));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__sinh_expr<typename _Expr::value_type>, _Expr> >
+>::type
+sinh(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__sinh_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__sinh_expr<value_type>(), __x));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__sqrt_expr<typename _Expr::value_type>, _Expr> >
+>::type
+sqrt(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__sqrt_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__sqrt_expr<value_type>(), __x));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__tan_expr<typename _Expr::value_type>, _Expr> >
+>::type
+tan(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__tan_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__tan_expr<value_type>(), __x));
+}
+
+template<class _Expr>
+inline _LIBCPP_INLINE_VISIBILITY
+typename enable_if
+<
+    __is_val_expr<_Expr>::value,
+    __val_expr<_UnaryOp<__tanh_expr<typename _Expr::value_type>, _Expr> >
+>::type
+tanh(const _Expr& __x)
+{
+    typedef typename _Expr::value_type value_type;
+    typedef _UnaryOp<__tanh_expr<value_type>, _Expr> _Op;
+    return __val_expr<_Op>(_Op(__tanh_expr<value_type>(), __x));
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+_Tp*
+begin(valarray<_Tp>& __v)
+{
+    return __v.__begin_;
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+const _Tp*
+begin(const valarray<_Tp>& __v)
+{
+    return __v.__begin_;
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+_Tp*
+end(valarray<_Tp>& __v)
+{
+    return __v.__end_;
+}
+
+template <class _Tp>
+inline _LIBCPP_INLINE_VISIBILITY
+const _Tp*
+end(const valarray<_Tp>& __v)
+{
+    return __v.__end_;
+}
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <algorithm>
+#  include <concepts>
+#  include <cstring>
+#  include <functional>
+#endif
+
+#endif // _LIBCPP_VALARRAY
diff --git a/app/src/main/cpp/libcxx/include/variant b/app/src/main/cpp/libcxx/include/variant
new file mode 100644
index 0000000..13c8982
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/variant
@@ -0,0 +1,1839 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_VARIANT
+#define _LIBCPP_VARIANT
+
+/*
+   variant synopsis
+
+namespace std {
+
+  // 20.7.2, class template variant
+  template <class... Types>
+  class variant {
+  public:
+
+    // 20.7.2.1, constructors
+    constexpr variant() noexcept(see below);
+    constexpr variant(const variant&);
+    constexpr variant(variant&&) noexcept(see below);
+
+    template <class T> constexpr variant(T&&) noexcept(see below);
+
+    template <class T, class... Args>
+    constexpr explicit variant(in_place_type_t<T>, Args&&...);
+
+    template <class T, class U, class... Args>
+    constexpr explicit variant(
+        in_place_type_t<T>, initializer_list<U>, Args&&...);
+
+    template <size_t I, class... Args>
+    constexpr explicit variant(in_place_index_t<I>, Args&&...);
+
+    template <size_t I, class U, class... Args>
+    constexpr explicit variant(
+        in_place_index_t<I>, initializer_list<U>, Args&&...);
+
+    // 20.7.2.2, destructor
+    ~variant();
+
+    // 20.7.2.3, assignment
+    constexpr variant& operator=(const variant&);
+    constexpr variant& operator=(variant&&) noexcept(see below);
+
+    template <class T> variant& operator=(T&&) noexcept(see below);
+
+    // 20.7.2.4, modifiers
+    template <class T, class... Args>
+    T& emplace(Args&&...);
+
+    template <class T, class U, class... Args>
+    T& emplace(initializer_list<U>, Args&&...);
+
+    template <size_t I, class... Args>
+    variant_alternative_t<I, variant>& emplace(Args&&...);
+
+    template <size_t I, class U, class...  Args>
+    variant_alternative_t<I, variant>& emplace(initializer_list<U>, Args&&...);
+
+    // 20.7.2.5, value status
+    constexpr bool valueless_by_exception() const noexcept;
+    constexpr size_t index() const noexcept;
+
+    // 20.7.2.6, swap
+    void swap(variant&) noexcept(see below);
+  };
+
+  // 20.7.3, variant helper classes
+  template <class T> struct variant_size; // undefined
+
+  template <class T>
+  inline constexpr size_t variant_size_v = variant_size<T>::value;
+
+  template <class T> struct variant_size<const T>;
+  template <class T> struct variant_size<volatile T>;
+  template <class T> struct variant_size<const volatile T>;
+
+  template <class... Types>
+  struct variant_size<variant<Types...>>;
+
+  template <size_t I, class T> struct variant_alternative; // undefined
+
+  template <size_t I, class T>
+  using variant_alternative_t = typename variant_alternative<I, T>::type;
+
+  template <size_t I, class T> struct variant_alternative<I, const T>;
+  template <size_t I, class T> struct variant_alternative<I, volatile T>;
+  template <size_t I, class T> struct variant_alternative<I, const volatile T>;
+
+  template <size_t I, class... Types>
+  struct variant_alternative<I, variant<Types...>>;
+
+  inline constexpr size_t variant_npos = -1;
+
+  // 20.7.4, value access
+  template <class T, class... Types>
+  constexpr bool holds_alternative(const variant<Types...>&) noexcept;
+
+  template <size_t I, class... Types>
+  constexpr variant_alternative_t<I, variant<Types...>>&
+  get(variant<Types...>&);
+
+  template <size_t I, class... Types>
+  constexpr variant_alternative_t<I, variant<Types...>>&&
+  get(variant<Types...>&&);
+
+  template <size_t I, class... Types>
+  constexpr variant_alternative_t<I, variant<Types...>> const&
+  get(const variant<Types...>&);
+
+  template <size_t I, class... Types>
+  constexpr variant_alternative_t<I, variant<Types...>> const&&
+  get(const variant<Types...>&&);
+
+  template <class T, class...  Types>
+  constexpr T& get(variant<Types...>&);
+
+  template <class T, class... Types>
+  constexpr T&& get(variant<Types...>&&);
+
+  template <class T, class... Types>
+  constexpr const T& get(const variant<Types...>&);
+
+  template <class T, class... Types>
+  constexpr const T&& get(const variant<Types...>&&);
+
+  template <size_t I, class... Types>
+  constexpr add_pointer_t<variant_alternative_t<I, variant<Types...>>>
+  get_if(variant<Types...>*) noexcept;
+
+  template <size_t I, class... Types>
+  constexpr add_pointer_t<const variant_alternative_t<I, variant<Types...>>>
+  get_if(const variant<Types...>*) noexcept;
+
+  template <class T, class... Types>
+  constexpr add_pointer_t<T>
+  get_if(variant<Types...>*) noexcept;
+
+  template <class T, class... Types>
+  constexpr add_pointer_t<const T>
+  get_if(const variant<Types...>*) noexcept;
+
+  // 20.7.5, relational operators
+  template <class... Types>
+  constexpr bool operator==(const variant<Types...>&, const variant<Types...>&);
+
+  template <class... Types>
+  constexpr bool operator!=(const variant<Types...>&, const variant<Types...>&);
+
+  template <class... Types>
+  constexpr bool operator<(const variant<Types...>&, const variant<Types...>&);
+
+  template <class... Types>
+  constexpr bool operator>(const variant<Types...>&, const variant<Types...>&);
+
+  template <class... Types>
+  constexpr bool operator<=(const variant<Types...>&, const variant<Types...>&);
+
+  template <class... Types>
+  constexpr bool operator>=(const variant<Types...>&, const variant<Types...>&);
+
+  template <class... Types> requires (three_way_comparable<Types> && ...)
+  constexpr common_comparison_category_t<compare_three_way_result_t<Types>...>
+    operator<=>(const variant<Types...>&, const variant<Types...>&);           // since C++20
+
+  // 20.7.6, visitation
+  template <class Visitor, class... Variants>
+  constexpr see below visit(Visitor&&, Variants&&...);
+
+  template <class R, class Visitor, class... Variants>
+  constexpr R visit(Visitor&&, Variants&&...); // since C++20
+
+  // 20.7.7, class monostate
+  struct monostate;
+
+  // 20.7.8, monostate relational operators
+  constexpr bool operator==(monostate, monostate) noexcept;
+  constexpr bool operator!=(monostate, monostate) noexcept;             // until C++20
+  constexpr bool operator<(monostate, monostate) noexcept;              // until C++20
+  constexpr bool operator>(monostate, monostate) noexcept;              // until C++20
+  constexpr bool operator<=(monostate, monostate) noexcept;             // until C++20
+  constexpr bool operator>=(monostate, monostate) noexcept;             // until C++20
+  constexpr strong_ordering operator<=>(monostate, monostate) noexcept; // since C++20
+
+  // 20.7.9, specialized algorithms
+  template <class... Types>
+  void swap(variant<Types...>&, variant<Types...>&) noexcept(see below);
+
+  // 20.7.10, class bad_variant_access
+  class bad_variant_access;
+
+  // 20.7.11, hash support
+  template <class T> struct hash;
+  template <class... Types> struct hash<variant<Types...>>;
+  template <> struct hash<monostate>;
+
+} // namespace std
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__availability>
+#include <__compare/common_comparison_category.h>
+#include <__compare/compare_three_way_result.h>
+#include <__compare/three_way_comparable.h>
+#include <__config>
+#include <__functional/hash.h>
+#include <__functional/invoke.h>
+#include <__functional/operations.h>
+#include <__functional/unary_function.h>
+#include <__type_traits/add_const.h>
+#include <__type_traits/add_cv.h>
+#include <__type_traits/add_pointer.h>
+#include <__type_traits/add_volatile.h>
+#include <__type_traits/dependent_type.h>
+#include <__type_traits/is_array.h>
+#include <__type_traits/is_destructible.h>
+#include <__type_traits/is_nothrow_move_constructible.h>
+#include <__type_traits/is_trivially_copy_assignable.h>
+#include <__type_traits/is_trivially_copy_constructible.h>
+#include <__type_traits/is_trivially_destructible.h>
+#include <__type_traits/is_trivially_move_assignable.h>
+#include <__type_traits/is_trivially_move_constructible.h>
+#include <__type_traits/is_void.h>
+#include <__type_traits/remove_const.h>
+#include <__type_traits/type_identity.h>
+#include <__type_traits/void_t.h>
+#include <__utility/forward.h>
+#include <__utility/in_place.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <__variant/monostate.h>
+#include <exception>
+#include <initializer_list>
+#include <limits>
+#include <new>
+#include <tuple>
+#include <version>
+
+// standard-mandated includes
+
+// [variant.syn]
+#include <compare>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+namespace std { // explicitly not using versioning namespace
+
+class _LIBCPP_EXCEPTION_ABI _LIBCPP_AVAILABILITY_BAD_VARIANT_ACCESS bad_variant_access : public exception {
+public:
+   const char* what() const _NOEXCEPT override;
+};
+
+} // namespace std
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+
+// Light N-dimensional array of function pointers. Used in place of std::array to avoid
+// adding a dependency.
+template<class _Tp, size_t _Size>
+struct __farray {
+  static_assert(_Size > 0, "N-dimensional array should never be empty in std::visit");
+  _Tp __buf_[_Size] = {};
+
+  _LIBCPP_INLINE_VISIBILITY constexpr
+  const _Tp &operator[](size_t __n) const noexcept {
+      return __buf_[__n];
+  }
+};
+
+_LIBCPP_NORETURN
+inline _LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+void __throw_bad_variant_access() {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        throw bad_variant_access();
+#else
+        _VSTD::abort();
+#endif
+}
+
+template <class... _Types>
+class _LIBCPP_TEMPLATE_VIS variant;
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS variant_size;
+
+template <class _Tp>
+inline constexpr size_t variant_size_v = variant_size<_Tp>::value;
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS variant_size<const _Tp> : variant_size<_Tp> {};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS variant_size<volatile _Tp> : variant_size<_Tp> {};
+
+template <class _Tp>
+struct _LIBCPP_TEMPLATE_VIS variant_size<const volatile _Tp>
+    : variant_size<_Tp> {};
+
+template <class... _Types>
+struct _LIBCPP_TEMPLATE_VIS variant_size<variant<_Types...>>
+    : integral_constant<size_t, sizeof...(_Types)> {};
+
+template <size_t _Ip, class _Tp>
+struct _LIBCPP_TEMPLATE_VIS variant_alternative;
+
+template <size_t _Ip, class _Tp>
+using variant_alternative_t = typename variant_alternative<_Ip, _Tp>::type;
+
+template <size_t _Ip, class _Tp>
+struct _LIBCPP_TEMPLATE_VIS variant_alternative<_Ip, const _Tp>
+    : add_const<variant_alternative_t<_Ip, _Tp>> {};
+
+template <size_t _Ip, class _Tp>
+struct _LIBCPP_TEMPLATE_VIS variant_alternative<_Ip, volatile _Tp>
+    : add_volatile<variant_alternative_t<_Ip, _Tp>> {};
+
+template <size_t _Ip, class _Tp>
+struct _LIBCPP_TEMPLATE_VIS variant_alternative<_Ip, const volatile _Tp>
+    : add_cv<variant_alternative_t<_Ip, _Tp>> {};
+
+template <size_t _Ip, class... _Types>
+struct _LIBCPP_TEMPLATE_VIS variant_alternative<_Ip, variant<_Types...>> {
+  static_assert(_Ip < sizeof...(_Types), "Index out of bounds in std::variant_alternative<>");
+  using type = __type_pack_element<_Ip, _Types...>;
+};
+
+inline constexpr size_t variant_npos = static_cast<size_t>(-1);
+
+_LIBCPP_HIDE_FROM_ABI constexpr int __choose_index_type(unsigned int __num_elem) {
+  if (__num_elem < numeric_limits<unsigned char>::max())
+    return 0;
+  if (__num_elem < numeric_limits<unsigned short>::max())
+    return 1;
+  return 2;
+}
+
+template <size_t _NumAlts>
+using __variant_index_t =
+#ifndef _LIBCPP_ABI_VARIANT_INDEX_TYPE_OPTIMIZATION
+  unsigned int;
+#else
+  std::tuple_element_t<
+      __choose_index_type(_NumAlts),
+      std::tuple<unsigned char, unsigned short, unsigned int>
+  >;
+#endif
+
+template <class _IndexType>
+constexpr _IndexType __variant_npos = static_cast<_IndexType>(-1);
+
+template <class... _Types>
+class _LIBCPP_TEMPLATE_VIS variant;
+
+template <class... _Types>
+_LIBCPP_INLINE_VISIBILITY constexpr variant<_Types...>&
+__as_variant(variant<_Types...>& __vs) noexcept {
+  return __vs;
+}
+
+template <class... _Types>
+_LIBCPP_INLINE_VISIBILITY constexpr const variant<_Types...>&
+__as_variant(const variant<_Types...>& __vs) noexcept {
+  return __vs;
+}
+
+template <class... _Types>
+_LIBCPP_INLINE_VISIBILITY constexpr variant<_Types...>&&
+__as_variant(variant<_Types...>&& __vs) noexcept {
+  return _VSTD::move(__vs);
+}
+
+template <class... _Types>
+_LIBCPP_INLINE_VISIBILITY constexpr const variant<_Types...>&&
+__as_variant(const variant<_Types...>&& __vs) noexcept {
+  return _VSTD::move(__vs);
+}
+
+namespace __find_detail {
+
+template <class _Tp, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr size_t __find_index() {
+  constexpr bool __matches[] = {is_same_v<_Tp, _Types>...};
+  size_t __result = __not_found;
+  for (size_t __i = 0; __i < sizeof...(_Types); ++__i) {
+    if (__matches[__i]) {
+      if (__result != __not_found) {
+        return __ambiguous;
+      }
+      __result = __i;
+    }
+  }
+  return __result;
+}
+
+template <size_t _Index>
+struct __find_unambiguous_index_sfinae_impl
+    : integral_constant<size_t, _Index> {};
+
+template <>
+struct __find_unambiguous_index_sfinae_impl<__not_found> {};
+
+template <>
+struct __find_unambiguous_index_sfinae_impl<__ambiguous> {};
+
+template <class _Tp, class... _Types>
+struct __find_unambiguous_index_sfinae
+    : __find_unambiguous_index_sfinae_impl<__find_index<_Tp, _Types...>()> {};
+
+} // namespace __find_detail
+
+namespace __variant_detail {
+
+struct __valueless_t {};
+
+enum class _Trait { _TriviallyAvailable, _Available, _Unavailable };
+
+template <typename _Tp,
+          template <typename> class _IsTriviallyAvailable,
+          template <typename> class _IsAvailable>
+constexpr _Trait __trait =
+    _IsTriviallyAvailable<_Tp>::value
+        ? _Trait::_TriviallyAvailable
+        : _IsAvailable<_Tp>::value ? _Trait::_Available : _Trait::_Unavailable;
+
+_LIBCPP_HIDE_FROM_ABI
+constexpr _Trait __common_trait(initializer_list<_Trait> __traits) {
+  _Trait __result = _Trait::_TriviallyAvailable;
+  for (_Trait __t : __traits) {
+    if (static_cast<int>(__t) > static_cast<int>(__result)) {
+      __result = __t;
+    }
+  }
+  return __result;
+}
+
+template <typename... _Types>
+struct __traits {
+  static constexpr _Trait __copy_constructible_trait =
+      __variant_detail::__common_trait({__trait<_Types,
+                              is_trivially_copy_constructible,
+                              is_copy_constructible>...});
+
+  static constexpr _Trait __move_constructible_trait =
+      __variant_detail::__common_trait({__trait<_Types,
+                              is_trivially_move_constructible,
+                              is_move_constructible>...});
+
+  static constexpr _Trait __copy_assignable_trait = __variant_detail::__common_trait(
+      {__copy_constructible_trait,
+       __trait<_Types, is_trivially_copy_assignable, is_copy_assignable>...});
+
+  static constexpr _Trait __move_assignable_trait = __variant_detail::__common_trait(
+      {__move_constructible_trait,
+       __trait<_Types, is_trivially_move_assignable, is_move_assignable>...});
+
+  static constexpr _Trait __destructible_trait = __variant_detail::__common_trait(
+      {__trait<_Types, is_trivially_destructible, is_destructible>...});
+};
+
+namespace __access {
+
+struct __union {
+  template <class _Vp>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto&& __get_alt(_Vp&& __v, in_place_index_t<0>) {
+    return _VSTD::forward<_Vp>(__v).__head;
+  }
+
+  template <class _Vp, size_t _Ip>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto&& __get_alt(_Vp&& __v, in_place_index_t<_Ip>) {
+    return __get_alt(_VSTD::forward<_Vp>(__v).__tail, in_place_index<_Ip - 1>);
+  }
+};
+
+struct __base {
+  template <size_t _Ip, class _Vp>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto&& __get_alt(_Vp&& __v) {
+    return __union::__get_alt(_VSTD::forward<_Vp>(__v).__data,
+                              in_place_index<_Ip>);
+  }
+};
+
+struct __variant {
+  template <size_t _Ip, class _Vp>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto&& __get_alt(_Vp&& __v) {
+    return __base::__get_alt<_Ip>(_VSTD::forward<_Vp>(__v).__impl_);
+  }
+};
+
+} // namespace __access
+
+namespace __visitation {
+
+struct __base {
+  template <class _Visitor, class... _Vs>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr decltype(auto)
+  __visit_alt_at(size_t __index, _Visitor&& __visitor, _Vs&&... __vs) {
+    constexpr auto __fdiagonal =
+        __make_fdiagonal<_Visitor&&,
+                         decltype(_VSTD::forward<_Vs>(__vs).__as_base())...>();
+    return __fdiagonal[__index](_VSTD::forward<_Visitor>(__visitor),
+                                _VSTD::forward<_Vs>(__vs).__as_base()...);
+  }
+
+  template <class _Visitor, class... _Vs>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr decltype(auto) __visit_alt(_Visitor&& __visitor,
+                                              _Vs&&... __vs) {
+    constexpr auto __fmatrix =
+        __make_fmatrix<_Visitor&&,
+                       decltype(_VSTD::forward<_Vs>(__vs).__as_base())...>();
+    return __at(__fmatrix, __vs.index()...)(
+        _VSTD::forward<_Visitor>(__visitor),
+        _VSTD::forward<_Vs>(__vs).__as_base()...);
+  }
+
+private:
+  template <class _Tp>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr const _Tp& __at(const _Tp& __elem) { return __elem; }
+
+  template <class _Tp, size_t _Np, typename... _Indices>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto&& __at(const __farray<_Tp, _Np>& __elems,
+                               size_t __index, _Indices... __indices) {
+    return __at(__elems[__index], __indices...);
+  }
+
+  template <class _Fp, class... _Fs>
+  static constexpr void __std_visit_visitor_return_type_check() {
+    static_assert(
+        __all<is_same_v<_Fp, _Fs>...>::value,
+        "`std::visit` requires the visitor to have a single return type.");
+  }
+
+  template <class... _Fs>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto __make_farray(_Fs&&... __fs) {
+    __std_visit_visitor_return_type_check<__remove_cvref_t<_Fs>...>();
+    using __result = __farray<common_type_t<__remove_cvref_t<_Fs>...>, sizeof...(_Fs)>;
+    return __result{{_VSTD::forward<_Fs>(__fs)...}};
+  }
+
+  template <size_t... _Is>
+  struct __dispatcher {
+    template <class _Fp, class... _Vs>
+    _LIBCPP_HIDE_FROM_ABI
+    static constexpr decltype(auto) __dispatch(_Fp __f, _Vs... __vs) {
+        return _VSTD::__invoke(
+            static_cast<_Fp>(__f),
+            __access::__base::__get_alt<_Is>(static_cast<_Vs>(__vs))...);
+    }
+  };
+
+  template <class _Fp, class... _Vs, size_t... _Is>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto __make_dispatch(index_sequence<_Is...>) {
+    return __dispatcher<_Is...>::template __dispatch<_Fp, _Vs...>;
+  }
+
+  template <size_t _Ip, class _Fp, class... _Vs>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto __make_fdiagonal_impl() {
+    return __make_dispatch<_Fp, _Vs...>(
+        index_sequence<((void)__type_identity<_Vs>{}, _Ip)...>{});
+  }
+
+  template <class _Fp, class... _Vs, size_t... _Is>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto __make_fdiagonal_impl(index_sequence<_Is...>) {
+    return __base::__make_farray(__make_fdiagonal_impl<_Is, _Fp, _Vs...>()...);
+  }
+
+  template <class _Fp, class _Vp, class... _Vs>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto __make_fdiagonal() {
+    constexpr size_t _Np = __remove_cvref_t<_Vp>::__size();
+    static_assert(__all<(_Np == __remove_cvref_t<_Vs>::__size())...>::value);
+    return __make_fdiagonal_impl<_Fp, _Vp, _Vs...>(make_index_sequence<_Np>{});
+  }
+
+  template <class _Fp, class... _Vs, size_t... _Is>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto __make_fmatrix_impl(index_sequence<_Is...> __is) {
+    return __make_dispatch<_Fp, _Vs...>(__is);
+  }
+
+  template <class _Fp, class... _Vs, size_t... _Is, size_t... _Js, class... _Ls>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto __make_fmatrix_impl(index_sequence<_Is...>,
+                                            index_sequence<_Js...>,
+                                            _Ls... __ls) {
+    return __base::__make_farray(__make_fmatrix_impl<_Fp, _Vs...>(
+        index_sequence<_Is..., _Js>{}, __ls...)...);
+  }
+
+  template <class _Fp, class... _Vs>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto __make_fmatrix() {
+    return __make_fmatrix_impl<_Fp, _Vs...>(
+        index_sequence<>{}, make_index_sequence<__remove_cvref_t<_Vs>::__size()>{}...);
+  }
+};
+
+struct __variant {
+  template <class _Visitor, class... _Vs>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr decltype(auto)
+  __visit_alt_at(size_t __index, _Visitor&& __visitor, _Vs&&... __vs) {
+    return __base::__visit_alt_at(__index,
+                                  _VSTD::forward<_Visitor>(__visitor),
+                                  _VSTD::forward<_Vs>(__vs).__impl_...);
+  }
+
+  template <class _Visitor, class... _Vs>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr decltype(auto) __visit_alt(_Visitor&& __visitor,
+                                              _Vs&&... __vs) {
+    return __base::__visit_alt(
+        _VSTD::forward<_Visitor>(__visitor),
+        _VSTD::__as_variant(_VSTD::forward<_Vs>(__vs)).__impl_...);
+  }
+
+  template <class _Visitor, class... _Vs>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr decltype(auto)
+  __visit_value_at(size_t __index, _Visitor&& __visitor, _Vs&&... __vs) {
+    return __visit_alt_at(
+        __index,
+        __make_value_visitor(_VSTD::forward<_Visitor>(__visitor)),
+        _VSTD::forward<_Vs>(__vs)...);
+  }
+
+  template <class _Visitor, class... _Vs>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr decltype(auto) __visit_value(_Visitor&& __visitor,
+                                                _Vs&&... __vs) {
+    return __visit_alt(
+        __make_value_visitor(_VSTD::forward<_Visitor>(__visitor)),
+        _VSTD::forward<_Vs>(__vs)...);
+  }
+
+#if _LIBCPP_STD_VER > 17
+  template <class _Rp, class _Visitor, class... _Vs>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr _Rp __visit_value(_Visitor&& __visitor,
+                                     _Vs&&... __vs) {
+    return __visit_alt(
+        __make_value_visitor<_Rp>(_VSTD::forward<_Visitor>(__visitor)),
+        _VSTD::forward<_Vs>(__vs)...);
+  }
+#endif
+
+private:
+  template <class _Visitor, class... _Values>
+  static constexpr void __std_visit_exhaustive_visitor_check() {
+    static_assert(is_invocable_v<_Visitor, _Values...>,
+                  "`std::visit` requires the visitor to be exhaustive.");
+  }
+
+  template <class _Visitor>
+  struct __value_visitor {
+    template <class... _Alts>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr decltype(auto) operator()(_Alts&&... __alts) const {
+      __std_visit_exhaustive_visitor_check<
+          _Visitor,
+          decltype((_VSTD::forward<_Alts>(__alts).__value))...>();
+      return _VSTD::__invoke(_VSTD::forward<_Visitor>(__visitor),
+                             _VSTD::forward<_Alts>(__alts).__value...);
+    }
+    _Visitor&& __visitor;
+  };
+
+#if _LIBCPP_STD_VER > 17
+  template <class _Rp, class _Visitor>
+  struct __value_visitor_return_type {
+    template <class... _Alts>
+    _LIBCPP_HIDE_FROM_ABI
+    constexpr _Rp operator()(_Alts&&... __alts) const {
+      __std_visit_exhaustive_visitor_check<
+          _Visitor,
+          decltype((_VSTD::forward<_Alts>(__alts).__value))...>();
+      if constexpr (is_void_v<_Rp>) {
+        _VSTD::__invoke(_VSTD::forward<_Visitor>(__visitor),
+                        _VSTD::forward<_Alts>(__alts).__value...);
+      }
+      else {
+        return _VSTD::__invoke(_VSTD::forward<_Visitor>(__visitor),
+                               _VSTD::forward<_Alts>(__alts).__value...);
+      }
+    }
+
+    _Visitor&& __visitor;
+  };
+#endif
+
+  template <class _Visitor>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto __make_value_visitor(_Visitor&& __visitor) {
+    return __value_visitor<_Visitor>{_VSTD::forward<_Visitor>(__visitor)};
+  }
+
+#if _LIBCPP_STD_VER > 17
+  template <class _Rp, class _Visitor>
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr auto __make_value_visitor(_Visitor&& __visitor) {
+    return __value_visitor_return_type<_Rp, _Visitor>{_VSTD::forward<_Visitor>(__visitor)};
+  }
+#endif
+};
+
+} // namespace __visitation
+
+template <size_t _Index, class _Tp>
+struct _LIBCPP_TEMPLATE_VIS __alt {
+  using __value_type = _Tp;
+
+  template <class... _Args>
+  _LIBCPP_HIDE_FROM_ABI
+  explicit constexpr __alt(in_place_t, _Args&&... __args)
+      : __value(_VSTD::forward<_Args>(__args)...) {}
+
+  __value_type __value;
+};
+
+template <_Trait _DestructibleTrait, size_t _Index, class... _Types>
+union _LIBCPP_TEMPLATE_VIS __union;
+
+template <_Trait _DestructibleTrait, size_t _Index>
+union _LIBCPP_TEMPLATE_VIS __union<_DestructibleTrait, _Index> {};
+
+#define _LIBCPP_VARIANT_UNION(destructible_trait, destructor)                  \
+  template <size_t _Index, class _Tp, class... _Types>                         \
+  union _LIBCPP_TEMPLATE_VIS __union<destructible_trait,                       \
+                                      _Index,                                  \
+                                      _Tp,                                     \
+                                      _Types...> {                             \
+  public:                                                                      \
+    _LIBCPP_HIDE_FROM_ABI                                                      \
+    explicit constexpr __union(__valueless_t) noexcept : __dummy{} {}          \
+                                                                               \
+    template <class... _Args>                                                  \
+    _LIBCPP_HIDE_FROM_ABI                                                      \
+    explicit constexpr __union(in_place_index_t<0>, _Args&&... __args)         \
+        : __head(in_place, _VSTD::forward<_Args>(__args)...) {}                \
+                                                                               \
+    template <size_t _Ip, class... _Args>                                      \
+    _LIBCPP_HIDE_FROM_ABI                                                      \
+    explicit constexpr __union(in_place_index_t<_Ip>, _Args&&... __args)       \
+        : __tail(in_place_index<_Ip - 1>, _VSTD::forward<_Args>(__args)...) {} \
+                                                                               \
+    __union(const __union&) = default;                                         \
+    __union(__union&&) = default;                                              \
+                                                                               \
+    destructor                                                                 \
+                                                                               \
+    __union& operator=(const __union&) = default;                              \
+    __union& operator=(__union&&) = default;                                   \
+                                                                               \
+  private:                                                                     \
+    char __dummy;                                                              \
+    __alt<_Index, _Tp> __head;                                                 \
+    __union<destructible_trait, _Index + 1, _Types...> __tail;                 \
+                                                                               \
+    friend struct __access::__union;                                           \
+  }
+
+_LIBCPP_VARIANT_UNION(_Trait::_TriviallyAvailable, ~__union() = default;);
+_LIBCPP_VARIANT_UNION(_Trait::_Available, ~__union() {});
+_LIBCPP_VARIANT_UNION(_Trait::_Unavailable, ~__union() = delete;);
+
+#undef _LIBCPP_VARIANT_UNION
+
+template <_Trait _DestructibleTrait, class... _Types>
+class _LIBCPP_TEMPLATE_VIS __base {
+public:
+  using __index_t = __variant_index_t<sizeof...(_Types)>;
+
+  _LIBCPP_HIDE_FROM_ABI
+  explicit constexpr __base(__valueless_t __tag) noexcept
+      : __data(__tag), __index(__variant_npos<__index_t>) {}
+
+  template <size_t _Ip, class... _Args>
+  _LIBCPP_HIDE_FROM_ABI
+  explicit constexpr __base(in_place_index_t<_Ip>, _Args&&... __args)
+      :
+        __data(in_place_index<_Ip>, _VSTD::forward<_Args>(__args)...),
+        __index(_Ip) {}
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr bool valueless_by_exception() const noexcept {
+    return index() == variant_npos;
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr size_t index() const noexcept {
+    return __index == __variant_npos<__index_t> ? variant_npos : __index;
+  }
+
+protected:
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto&& __as_base() & { return *this; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto&& __as_base() && { return _VSTD::move(*this); }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto&& __as_base() const & { return *this; }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr auto&& __as_base() const && { return _VSTD::move(*this); }
+
+  _LIBCPP_HIDE_FROM_ABI
+  static constexpr size_t __size() { return sizeof...(_Types); }
+
+  __union<_DestructibleTrait, 0, _Types...> __data;
+  __index_t __index;
+
+  friend struct __access::__base;
+  friend struct __visitation::__base;
+};
+
+template <class _Traits, _Trait = _Traits::__destructible_trait>
+class _LIBCPP_TEMPLATE_VIS __dtor;
+
+#define _LIBCPP_VARIANT_DESTRUCTOR(destructible_trait, destructor, destroy)    \
+  template <class... _Types>                                                   \
+  class _LIBCPP_TEMPLATE_VIS __dtor<__traits<_Types...>,                       \
+                                    destructible_trait>                        \
+      : public __base<destructible_trait, _Types...> {                         \
+    using __base_type = __base<destructible_trait, _Types...>;                 \
+    using __index_t = typename __base_type::__index_t;                         \
+                                                                               \
+  public:                                                                      \
+    using __base_type::__base_type;                                            \
+    using __base_type::operator=;                                              \
+                                                                               \
+    __dtor(const __dtor&) = default;                                           \
+    __dtor(__dtor&&) = default;                                                \
+    destructor                                                                 \
+    __dtor& operator=(const __dtor&) = default;                                \
+    __dtor& operator=(__dtor&&) = default;                                     \
+                                                                               \
+  protected:                                                                   \
+    inline _LIBCPP_HIDE_FROM_ABI                                               \
+    destroy                                                                    \
+  }
+
+_LIBCPP_VARIANT_DESTRUCTOR(
+    _Trait::_TriviallyAvailable,
+    ~__dtor() = default;,
+    void __destroy() noexcept { this->__index = __variant_npos<__index_t>; });
+
+_LIBCPP_VARIANT_DESTRUCTOR(
+    _Trait::_Available,
+    ~__dtor() { __destroy(); },
+    void __destroy() noexcept {
+      if (!this->valueless_by_exception()) {
+        __visitation::__base::__visit_alt(
+            [](auto& __alt) noexcept {
+              using __alt_type = __remove_cvref_t<decltype(__alt)>;
+              __alt.~__alt_type();
+            },
+            *this);
+      }
+      this->__index = __variant_npos<__index_t>;
+    });
+
+_LIBCPP_VARIANT_DESTRUCTOR(
+    _Trait::_Unavailable,
+    ~__dtor() = delete;,
+    void __destroy() noexcept = delete;);
+
+#undef _LIBCPP_VARIANT_DESTRUCTOR
+
+template <class _Traits>
+class _LIBCPP_TEMPLATE_VIS __ctor : public __dtor<_Traits> {
+  using __base_type = __dtor<_Traits>;
+
+public:
+  using __base_type::__base_type;
+  using __base_type::operator=;
+
+protected:
+  template <size_t _Ip, class _Tp, class... _Args>
+  _LIBCPP_HIDE_FROM_ABI
+  static _Tp& __construct_alt(__alt<_Ip, _Tp>& __a, _Args&&... __args) {
+    ::new ((void*)_VSTD::addressof(__a))
+        __alt<_Ip, _Tp>(in_place, _VSTD::forward<_Args>(__args)...);
+    return __a.__value;
+  }
+
+  template <class _Rhs>
+  _LIBCPP_HIDE_FROM_ABI
+  static void __generic_construct(__ctor& __lhs, _Rhs&& __rhs) {
+    __lhs.__destroy();
+    if (!__rhs.valueless_by_exception()) {
+      __visitation::__base::__visit_alt_at(
+          __rhs.index(),
+          [](auto& __lhs_alt, auto&& __rhs_alt) {
+            __construct_alt(
+                __lhs_alt,
+                _VSTD::forward<decltype(__rhs_alt)>(__rhs_alt).__value);
+          },
+          __lhs, _VSTD::forward<_Rhs>(__rhs));
+      __lhs.__index = __rhs.index();
+    }
+  }
+};
+
+template <class _Traits, _Trait = _Traits::__move_constructible_trait>
+class _LIBCPP_TEMPLATE_VIS __move_constructor;
+
+#define _LIBCPP_VARIANT_MOVE_CONSTRUCTOR(move_constructible_trait,             \
+                                         move_constructor)                     \
+  template <class... _Types>                                                   \
+  class _LIBCPP_TEMPLATE_VIS __move_constructor<__traits<_Types...>,           \
+                                                move_constructible_trait>      \
+      : public __ctor<__traits<_Types...>> {                                   \
+    using __base_type = __ctor<__traits<_Types...>>;                           \
+                                                                               \
+  public:                                                                      \
+    using __base_type::__base_type;                                            \
+    using __base_type::operator=;                                              \
+                                                                               \
+    __move_constructor(const __move_constructor&) = default;                   \
+    move_constructor                                                           \
+    ~__move_constructor() = default;                                           \
+    __move_constructor& operator=(const __move_constructor&) = default;        \
+    __move_constructor& operator=(__move_constructor&&) = default;             \
+  }
+
+_LIBCPP_VARIANT_MOVE_CONSTRUCTOR(
+    _Trait::_TriviallyAvailable,
+    __move_constructor(__move_constructor&& __that) = default;);
+
+_LIBCPP_VARIANT_MOVE_CONSTRUCTOR(
+    _Trait::_Available,
+    __move_constructor(__move_constructor&& __that) noexcept(
+        __all<is_nothrow_move_constructible_v<_Types>...>::value)
+        : __move_constructor(__valueless_t{}) {
+      this->__generic_construct(*this, _VSTD::move(__that));
+    });
+
+_LIBCPP_VARIANT_MOVE_CONSTRUCTOR(
+    _Trait::_Unavailable,
+    __move_constructor(__move_constructor&&) = delete;);
+
+#undef _LIBCPP_VARIANT_MOVE_CONSTRUCTOR
+
+template <class _Traits, _Trait = _Traits::__copy_constructible_trait>
+class _LIBCPP_TEMPLATE_VIS __copy_constructor;
+
+#define _LIBCPP_VARIANT_COPY_CONSTRUCTOR(copy_constructible_trait,             \
+                                         copy_constructor)                     \
+  template <class... _Types>                                                   \
+  class _LIBCPP_TEMPLATE_VIS __copy_constructor<__traits<_Types...>,           \
+                                                 copy_constructible_trait>     \
+      : public __move_constructor<__traits<_Types...>> {                       \
+    using __base_type = __move_constructor<__traits<_Types...>>;               \
+                                                                               \
+  public:                                                                      \
+    using __base_type::__base_type;                                            \
+    using __base_type::operator=;                                              \
+                                                                               \
+    copy_constructor                                                           \
+    __copy_constructor(__copy_constructor&&) = default;                        \
+    ~__copy_constructor() = default;                                           \
+    __copy_constructor& operator=(const __copy_constructor&) = default;        \
+    __copy_constructor& operator=(__copy_constructor&&) = default;             \
+  }
+
+_LIBCPP_VARIANT_COPY_CONSTRUCTOR(
+    _Trait::_TriviallyAvailable,
+    __copy_constructor(const __copy_constructor& __that) = default;);
+
+_LIBCPP_VARIANT_COPY_CONSTRUCTOR(
+    _Trait::_Available,
+    __copy_constructor(const __copy_constructor& __that)
+        : __copy_constructor(__valueless_t{}) {
+      this->__generic_construct(*this, __that);
+    });
+
+_LIBCPP_VARIANT_COPY_CONSTRUCTOR(
+    _Trait::_Unavailable,
+    __copy_constructor(const __copy_constructor&) = delete;);
+
+#undef _LIBCPP_VARIANT_COPY_CONSTRUCTOR
+
+template <class _Traits>
+class _LIBCPP_TEMPLATE_VIS __assignment : public __copy_constructor<_Traits> {
+  using __base_type = __copy_constructor<_Traits>;
+
+public:
+  using __base_type::__base_type;
+  using __base_type::operator=;
+
+  template <size_t _Ip, class... _Args>
+  _LIBCPP_HIDE_FROM_ABI
+  auto& __emplace(_Args&&... __args) {
+    this->__destroy();
+    auto& __res = this->__construct_alt(__access::__base::__get_alt<_Ip>(*this),
+                          _VSTD::forward<_Args>(__args)...);
+    this->__index = _Ip;
+    return __res;
+  }
+
+protected:
+  template <size_t _Ip, class _Tp, class _Arg>
+  _LIBCPP_HIDE_FROM_ABI
+  void __assign_alt(__alt<_Ip, _Tp>& __a, _Arg&& __arg) {
+    if (this->index() == _Ip) {
+      __a.__value = _VSTD::forward<_Arg>(__arg);
+    } else {
+      struct {
+        void operator()(true_type) const {
+          __this->__emplace<_Ip>(_VSTD::forward<_Arg>(__arg));
+        }
+        void operator()(false_type) const {
+          __this->__emplace<_Ip>(_Tp(_VSTD::forward<_Arg>(__arg)));
+        }
+        __assignment* __this;
+        _Arg&& __arg;
+      } __impl{this, _VSTD::forward<_Arg>(__arg)};
+      __impl(bool_constant<is_nothrow_constructible_v<_Tp, _Arg> ||
+                           !is_nothrow_move_constructible_v<_Tp>>{});
+    }
+  }
+
+  template <class _That>
+  _LIBCPP_HIDE_FROM_ABI
+  void __generic_assign(_That&& __that) {
+    if (this->valueless_by_exception() && __that.valueless_by_exception()) {
+      // do nothing.
+    } else if (__that.valueless_by_exception()) {
+      this->__destroy();
+    } else {
+      __visitation::__base::__visit_alt_at(
+          __that.index(),
+          [this](auto& __this_alt, auto&& __that_alt) {
+            this->__assign_alt(
+                __this_alt,
+                _VSTD::forward<decltype(__that_alt)>(__that_alt).__value);
+          },
+          *this, _VSTD::forward<_That>(__that));
+    }
+  }
+};
+
+template <class _Traits, _Trait = _Traits::__move_assignable_trait>
+class _LIBCPP_TEMPLATE_VIS __move_assignment;
+
+#define _LIBCPP_VARIANT_MOVE_ASSIGNMENT(move_assignable_trait,                 \
+                                        move_assignment)                       \
+  template <class... _Types>                                                   \
+  class _LIBCPP_TEMPLATE_VIS __move_assignment<__traits<_Types...>,            \
+                                                move_assignable_trait>         \
+      : public __assignment<__traits<_Types...>> {                             \
+    using __base_type = __assignment<__traits<_Types...>>;                     \
+                                                                               \
+  public:                                                                      \
+    using __base_type::__base_type;                                            \
+    using __base_type::operator=;                                              \
+                                                                               \
+    __move_assignment(const __move_assignment&) = default;                     \
+    __move_assignment(__move_assignment&&) = default;                          \
+    ~__move_assignment() = default;                                            \
+    __move_assignment& operator=(const __move_assignment&) = default;          \
+    move_assignment                                                            \
+  }
+
+_LIBCPP_VARIANT_MOVE_ASSIGNMENT(
+    _Trait::_TriviallyAvailable,
+    __move_assignment& operator=(__move_assignment&& __that) = default;);
+
+_LIBCPP_VARIANT_MOVE_ASSIGNMENT(
+    _Trait::_Available,
+    __move_assignment& operator=(__move_assignment&& __that) noexcept(
+        __all<(is_nothrow_move_constructible_v<_Types> &&
+               is_nothrow_move_assignable_v<_Types>)...>::value) {
+      this->__generic_assign(_VSTD::move(__that));
+      return *this;
+    });
+
+_LIBCPP_VARIANT_MOVE_ASSIGNMENT(
+    _Trait::_Unavailable,
+    __move_assignment& operator=(__move_assignment&&) = delete;);
+
+#undef _LIBCPP_VARIANT_MOVE_ASSIGNMENT
+
+template <class _Traits, _Trait = _Traits::__copy_assignable_trait>
+class _LIBCPP_TEMPLATE_VIS __copy_assignment;
+
+#define _LIBCPP_VARIANT_COPY_ASSIGNMENT(copy_assignable_trait,                 \
+                                        copy_assignment)                       \
+  template <class... _Types>                                                   \
+  class _LIBCPP_TEMPLATE_VIS __copy_assignment<__traits<_Types...>,            \
+                                                copy_assignable_trait>         \
+      : public __move_assignment<__traits<_Types...>> {                        \
+    using __base_type = __move_assignment<__traits<_Types...>>;                \
+                                                                               \
+  public:                                                                      \
+    using __base_type::__base_type;                                            \
+    using __base_type::operator=;                                              \
+                                                                               \
+    __copy_assignment(const __copy_assignment&) = default;                     \
+    __copy_assignment(__copy_assignment&&) = default;                          \
+    ~__copy_assignment() = default;                                            \
+    copy_assignment                                                            \
+    __copy_assignment& operator=(__copy_assignment&&) = default;               \
+  }
+
+_LIBCPP_VARIANT_COPY_ASSIGNMENT(
+    _Trait::_TriviallyAvailable,
+    __copy_assignment& operator=(const __copy_assignment& __that) = default;);
+
+_LIBCPP_VARIANT_COPY_ASSIGNMENT(
+    _Trait::_Available,
+    __copy_assignment& operator=(const __copy_assignment& __that) {
+      this->__generic_assign(__that);
+      return *this;
+    });
+
+_LIBCPP_VARIANT_COPY_ASSIGNMENT(
+    _Trait::_Unavailable,
+    __copy_assignment& operator=(const __copy_assignment&) = delete;);
+
+#undef _LIBCPP_VARIANT_COPY_ASSIGNMENT
+
+template <class... _Types>
+class _LIBCPP_TEMPLATE_VIS __impl
+    : public __copy_assignment<__traits<_Types...>> {
+  using __base_type = __copy_assignment<__traits<_Types...>>;
+
+public:
+  using __base_type::__base_type; // get in_place_index_t constructor & friends
+  __impl(__impl const&) = default;
+  __impl(__impl&&) = default;
+  __impl& operator=(__impl const&) = default;
+  __impl& operator=(__impl&&) = default;
+
+  template <size_t _Ip, class _Arg>
+  _LIBCPP_HIDE_FROM_ABI
+  void __assign(_Arg&& __arg) {
+    this->__assign_alt(__access::__base::__get_alt<_Ip>(*this),
+                       _VSTD::forward<_Arg>(__arg));
+  }
+
+  inline _LIBCPP_HIDE_FROM_ABI
+  void __swap(__impl& __that)  {
+    if (this->valueless_by_exception() && __that.valueless_by_exception()) {
+      // do nothing.
+    } else if (this->index() == __that.index()) {
+      __visitation::__base::__visit_alt_at(
+          this->index(),
+          [](auto& __this_alt, auto& __that_alt) {
+            using _VSTD::swap;
+            swap(__this_alt.__value, __that_alt.__value);
+          },
+          *this,
+          __that);
+    } else {
+      __impl* __lhs = this;
+      __impl* __rhs = _VSTD::addressof(__that);
+      if (__lhs->__move_nothrow() && !__rhs->__move_nothrow()) {
+        _VSTD::swap(__lhs, __rhs);
+      }
+      __impl __tmp(_VSTD::move(*__rhs));
+#ifndef _LIBCPP_NO_EXCEPTIONS
+      if constexpr (__all<is_nothrow_move_constructible_v<_Types>...>::value) {
+        this->__generic_construct(*__rhs, _VSTD::move(*__lhs));
+      } else {
+        // EXTENSION: When the move construction of `__lhs` into `__rhs` throws
+        // and `__tmp` is nothrow move constructible then we move `__tmp` back
+        // into `__rhs` and provide the strong exception safety guarantee.
+        try {
+          this->__generic_construct(*__rhs, _VSTD::move(*__lhs));
+        } catch (...) {
+          if (__tmp.__move_nothrow()) {
+            this->__generic_construct(*__rhs, _VSTD::move(__tmp));
+          }
+          throw;
+        }
+      }
+#else
+      // this isn't consolidated with the `if constexpr` branch above due to
+      // `throw` being ill-formed with exceptions disabled even when discarded.
+      this->__generic_construct(*__rhs, _VSTD::move(*__lhs));
+#endif
+      this->__generic_construct(*__lhs, _VSTD::move(__tmp));
+    }
+  }
+
+private:
+  inline _LIBCPP_HIDE_FROM_ABI
+  bool __move_nothrow() const {
+    constexpr bool __results[] = {is_nothrow_move_constructible_v<_Types>...};
+    return this->valueless_by_exception() || __results[this->index()];
+  }
+};
+
+struct __no_narrowing_check {
+  template <class _Dest, class _Source>
+  using _Apply = __type_identity<_Dest>;
+};
+
+struct __narrowing_check {
+  template <class _Dest>
+  static auto __test_impl(_Dest (&&)[1]) -> __type_identity<_Dest>;
+  template <class _Dest, class _Source>
+  using _Apply _LIBCPP_NODEBUG = decltype(__test_impl<_Dest>({std::declval<_Source>()}));
+};
+
+template <class _Dest, class _Source>
+using __check_for_narrowing _LIBCPP_NODEBUG =
+  typename _If<
+#ifdef _LIBCPP_ENABLE_NARROWING_CONVERSIONS_IN_VARIANT
+    false &&
+#endif
+    is_arithmetic<_Dest>::value,
+    __narrowing_check,
+    __no_narrowing_check
+  >::template _Apply<_Dest, _Source>;
+
+template <class _Tp, size_t _Idx>
+struct __overload {
+  template <class _Up>
+  auto operator()(_Tp, _Up&&) const -> __check_for_narrowing<_Tp, _Up>;
+};
+
+template <class _Tp, size_t>
+struct __overload_bool  {
+  template <class _Up, class _Ap = __remove_cvref_t<_Up>>
+  auto operator()(bool, _Up&&) const
+      -> enable_if_t<is_same_v<_Ap, bool>, __type_identity<_Tp>>;
+};
+
+template <size_t _Idx>
+struct __overload<bool, _Idx> : __overload_bool<bool, _Idx> {};
+template <size_t _Idx>
+struct __overload<bool const, _Idx> : __overload_bool<bool const, _Idx> {};
+template <size_t _Idx>
+struct __overload<bool volatile, _Idx> : __overload_bool<bool volatile, _Idx> {};
+template <size_t _Idx>
+struct __overload<bool const volatile, _Idx> : __overload_bool<bool const volatile, _Idx> {};
+
+template <class ..._Bases>
+struct __all_overloads : _Bases... {
+  void operator()() const;
+  using _Bases::operator()...;
+};
+
+template <class IdxSeq>
+struct __make_overloads_imp;
+
+template <size_t ..._Idx>
+struct __make_overloads_imp<__tuple_indices<_Idx...> > {
+  template <class ..._Types>
+  using _Apply _LIBCPP_NODEBUG = __all_overloads<__overload<_Types, _Idx>...>;
+};
+
+template <class ..._Types>
+using _MakeOverloads _LIBCPP_NODEBUG = typename __make_overloads_imp<
+    __make_indices_imp<sizeof...(_Types), 0> >::template _Apply<_Types...>;
+
+template <class _Tp, class... _Types>
+using __best_match_t =
+    typename invoke_result_t<_MakeOverloads<_Types...>, _Tp, _Tp>::type;
+
+} // namespace __variant_detail
+
+template <class... _Types>
+class _LIBCPP_TEMPLATE_VIS variant
+    : private __sfinae_ctor_base<
+          __all<is_copy_constructible_v<_Types>...>::value,
+          __all<is_move_constructible_v<_Types>...>::value>,
+      private __sfinae_assign_base<
+          __all<(is_copy_constructible_v<_Types> &&
+                 is_copy_assignable_v<_Types>)...>::value,
+          __all<(is_move_constructible_v<_Types> &&
+                 is_move_assignable_v<_Types>)...>::value> {
+  static_assert(0 < sizeof...(_Types),
+                "variant must consist of at least one alternative.");
+
+  static_assert(__all<!is_array_v<_Types>...>::value,
+                "variant can not have an array type as an alternative.");
+
+  static_assert(__all<!is_reference_v<_Types>...>::value,
+                "variant can not have a reference type as an alternative.");
+
+  static_assert(__all<!is_void_v<_Types>...>::value,
+                "variant can not have a void type as an alternative.");
+
+  using __first_type = variant_alternative_t<0, variant>;
+
+public:
+  template <bool _Dummy = true,
+            enable_if_t<__dependent_type<is_default_constructible<__first_type>,
+                                         _Dummy>::value,
+                        int> = 0>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr variant() noexcept(is_nothrow_default_constructible_v<__first_type>)
+      : __impl_(in_place_index<0>) {}
+
+  constexpr variant(const variant&) = default;
+  constexpr variant(variant&&) = default;
+
+  template <
+      class _Arg,
+      enable_if_t<!is_same_v<__remove_cvref_t<_Arg>, variant>, int> = 0,
+      enable_if_t<!__is_inplace_type<__remove_cvref_t<_Arg>>::value, int> = 0,
+      enable_if_t<!__is_inplace_index<__remove_cvref_t<_Arg>>::value, int> = 0,
+      class _Tp = __variant_detail::__best_match_t<_Arg, _Types...>,
+      size_t _Ip =
+          __find_detail::__find_unambiguous_index_sfinae<_Tp, _Types...>::value,
+      enable_if_t<is_constructible_v<_Tp, _Arg>, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr variant(_Arg&& __arg) noexcept(
+      is_nothrow_constructible_v<_Tp, _Arg>)
+      : __impl_(in_place_index<_Ip>, _VSTD::forward<_Arg>(__arg)) {}
+
+  template <size_t _Ip, class... _Args,
+            class = enable_if_t<(_Ip < sizeof...(_Types)), int>,
+            class _Tp = variant_alternative_t<_Ip, variant<_Types...>>,
+            enable_if_t<is_constructible_v<_Tp, _Args...>, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI
+  explicit constexpr variant(
+      in_place_index_t<_Ip>,
+      _Args&&... __args) noexcept(is_nothrow_constructible_v<_Tp, _Args...>)
+      : __impl_(in_place_index<_Ip>, _VSTD::forward<_Args>(__args)...) {}
+
+  template <
+      size_t _Ip,
+      class _Up,
+      class... _Args,
+      enable_if_t<(_Ip < sizeof...(_Types)), int> = 0,
+      class _Tp = variant_alternative_t<_Ip, variant<_Types...>>,
+      enable_if_t<is_constructible_v<_Tp, initializer_list<_Up>&, _Args...>,
+                  int> = 0>
+  _LIBCPP_HIDE_FROM_ABI
+  explicit constexpr variant(
+      in_place_index_t<_Ip>,
+      initializer_list<_Up> __il,
+      _Args&&... __args) noexcept(
+      is_nothrow_constructible_v<_Tp, initializer_list<_Up>&, _Args...>)
+      : __impl_(in_place_index<_Ip>, __il, _VSTD::forward<_Args>(__args)...) {}
+
+  template <
+      class _Tp,
+      class... _Args,
+      size_t _Ip =
+          __find_detail::__find_unambiguous_index_sfinae<_Tp, _Types...>::value,
+      enable_if_t<is_constructible_v<_Tp, _Args...>, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI
+  explicit constexpr variant(in_place_type_t<_Tp>, _Args&&... __args) noexcept(
+      is_nothrow_constructible_v<_Tp, _Args...>)
+      : __impl_(in_place_index<_Ip>, _VSTD::forward<_Args>(__args)...) {}
+
+  template <
+      class _Tp,
+      class _Up,
+      class... _Args,
+      size_t _Ip =
+          __find_detail::__find_unambiguous_index_sfinae<_Tp, _Types...>::value,
+      enable_if_t<is_constructible_v<_Tp, initializer_list<_Up>&, _Args...>,
+                  int> = 0>
+  _LIBCPP_HIDE_FROM_ABI
+  explicit constexpr variant(
+      in_place_type_t<_Tp>,
+      initializer_list<_Up> __il,
+      _Args&&... __args) noexcept(
+      is_nothrow_constructible_v<_Tp, initializer_list< _Up>&, _Args...>)
+      : __impl_(in_place_index<_Ip>, __il, _VSTD::forward<_Args>(__args)...) {}
+
+  ~variant() = default;
+
+  constexpr variant& operator=(const variant&) = default;
+  constexpr variant& operator=(variant&&) = default;
+
+  template <
+      class _Arg,
+      enable_if_t<!is_same_v<__remove_cvref_t<_Arg>, variant>, int> = 0,
+      class _Tp = __variant_detail::__best_match_t<_Arg, _Types...>,
+      size_t _Ip =
+          __find_detail::__find_unambiguous_index_sfinae<_Tp, _Types...>::value,
+      enable_if_t<is_assignable_v<_Tp&, _Arg> && is_constructible_v<_Tp, _Arg>,
+                  int> = 0>
+  _LIBCPP_HIDE_FROM_ABI
+  variant& operator=(_Arg&& __arg) noexcept(
+      is_nothrow_assignable_v<_Tp&, _Arg> &&
+      is_nothrow_constructible_v<_Tp, _Arg>) {
+    __impl_.template __assign<_Ip>(_VSTD::forward<_Arg>(__arg));
+    return *this;
+  }
+
+  template <
+      size_t _Ip,
+      class... _Args,
+      enable_if_t<(_Ip < sizeof...(_Types)), int> = 0,
+      class _Tp = variant_alternative_t<_Ip, variant<_Types...>>,
+      enable_if_t<is_constructible_v<_Tp, _Args...>, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI
+  _Tp& emplace(_Args&&... __args) {
+    return __impl_.template __emplace<_Ip>(_VSTD::forward<_Args>(__args)...);
+  }
+
+  template <
+      size_t _Ip,
+      class _Up,
+      class... _Args,
+      enable_if_t<(_Ip < sizeof...(_Types)), int> = 0,
+      class _Tp = variant_alternative_t<_Ip, variant<_Types...>>,
+      enable_if_t<is_constructible_v<_Tp, initializer_list<_Up>&, _Args...>,
+                  int> = 0>
+  _LIBCPP_HIDE_FROM_ABI
+  _Tp& emplace(initializer_list<_Up> __il, _Args&&... __args) {
+    return __impl_.template __emplace<_Ip>(__il, _VSTD::forward<_Args>(__args)...);
+  }
+
+  template <
+      class _Tp,
+      class... _Args,
+      size_t _Ip =
+          __find_detail::__find_unambiguous_index_sfinae<_Tp, _Types...>::value,
+      enable_if_t<is_constructible_v<_Tp, _Args...>, int> = 0>
+  _LIBCPP_HIDE_FROM_ABI
+  _Tp& emplace(_Args&&... __args) {
+    return __impl_.template __emplace<_Ip>(_VSTD::forward<_Args>(__args)...);
+  }
+
+  template <
+      class _Tp,
+      class _Up,
+      class... _Args,
+      size_t _Ip =
+          __find_detail::__find_unambiguous_index_sfinae<_Tp, _Types...>::value,
+      enable_if_t<is_constructible_v<_Tp, initializer_list<_Up>&, _Args...>,
+                  int> = 0>
+  _LIBCPP_HIDE_FROM_ABI
+  _Tp& emplace(initializer_list<_Up> __il, _Args&&... __args) {
+    return __impl_.template __emplace<_Ip>(__il, _VSTD::forward<_Args>(__args)...);
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr bool valueless_by_exception() const noexcept {
+    return __impl_.valueless_by_exception();
+  }
+
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr size_t index() const noexcept { return __impl_.index(); }
+
+  template <
+      bool _Dummy = true,
+      enable_if_t<
+          __all<(
+              __dependent_type<is_move_constructible<_Types>, _Dummy>::value &&
+              __dependent_type<is_swappable<_Types>, _Dummy>::value)...>::value,
+          int> = 0>
+  _LIBCPP_HIDE_FROM_ABI
+  void swap(variant& __that) noexcept(
+      __all<(is_nothrow_move_constructible_v<_Types> &&
+             is_nothrow_swappable_v<_Types>)...>::value) {
+    __impl_.__swap(__that.__impl_);
+  }
+
+private:
+  __variant_detail::__impl<_Types...> __impl_;
+
+  friend struct __variant_detail::__access::__variant;
+  friend struct __variant_detail::__visitation::__variant;
+};
+
+template <size_t _Ip, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr bool __holds_alternative(const variant<_Types...>& __v) noexcept {
+  return __v.index() == _Ip;
+}
+
+template <class _Tp, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr bool holds_alternative(const variant<_Types...>& __v) noexcept {
+  return std::__holds_alternative<__find_exactly_one_t<_Tp, _Types...>::value>(__v);
+}
+
+template <size_t _Ip, class _Vp>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+constexpr auto&& __generic_get(_Vp&& __v) {
+  using __variant_detail::__access::__variant;
+  if (!std::__holds_alternative<_Ip>(__v)) {
+    __throw_bad_variant_access();
+  }
+  return __variant::__get_alt<_Ip>(_VSTD::forward<_Vp>(__v)).__value;
+}
+
+template <size_t _Ip, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+constexpr variant_alternative_t<_Ip, variant<_Types...>>& get(
+    variant<_Types...>& __v) {
+  static_assert(_Ip < sizeof...(_Types));
+  static_assert(!is_void_v<variant_alternative_t<_Ip, variant<_Types...>>>);
+  return std::__generic_get<_Ip>(__v);
+}
+
+template <size_t _Ip, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+constexpr variant_alternative_t<_Ip, variant<_Types...>>&& get(
+    variant<_Types...>&& __v) {
+  static_assert(_Ip < sizeof...(_Types));
+  static_assert(!is_void_v<variant_alternative_t<_Ip, variant<_Types...>>>);
+  return std::__generic_get<_Ip>(_VSTD::move(__v));
+}
+
+template <size_t _Ip, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+constexpr const variant_alternative_t<_Ip, variant<_Types...>>& get(
+    const variant<_Types...>& __v) {
+  static_assert(_Ip < sizeof...(_Types));
+  static_assert(!is_void_v<variant_alternative_t<_Ip, variant<_Types...>>>);
+  return std::__generic_get<_Ip>(__v);
+}
+
+template <size_t _Ip, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+constexpr const variant_alternative_t<_Ip, variant<_Types...>>&& get(
+    const variant<_Types...>&& __v) {
+  static_assert(_Ip < sizeof...(_Types));
+  static_assert(!is_void_v<variant_alternative_t<_Ip, variant<_Types...>>>);
+  return std::__generic_get<_Ip>(_VSTD::move(__v));
+}
+
+template <class _Tp, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+constexpr _Tp& get(variant<_Types...>& __v) {
+  static_assert(!is_void_v<_Tp>);
+  return _VSTD::get<__find_exactly_one_t<_Tp, _Types...>::value>(__v);
+}
+
+template <class _Tp, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+constexpr _Tp&& get(variant<_Types...>&& __v) {
+  static_assert(!is_void_v<_Tp>);
+  return _VSTD::get<__find_exactly_one_t<_Tp, _Types...>::value>(
+      _VSTD::move(__v));
+}
+
+template <class _Tp, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+constexpr const _Tp& get(const variant<_Types...>& __v) {
+  static_assert(!is_void_v<_Tp>);
+  return _VSTD::get<__find_exactly_one_t<_Tp, _Types...>::value>(__v);
+}
+
+template <class _Tp, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+constexpr const _Tp&& get(const variant<_Types...>&& __v) {
+  static_assert(!is_void_v<_Tp>);
+  return _VSTD::get<__find_exactly_one_t<_Tp, _Types...>::value>(
+      _VSTD::move(__v));
+}
+
+template <size_t _Ip, class _Vp>
+_LIBCPP_HIDE_FROM_ABI
+constexpr auto* __generic_get_if(_Vp* __v) noexcept {
+  using __variant_detail::__access::__variant;
+  return __v && std::__holds_alternative<_Ip>(*__v)
+             ? _VSTD::addressof(__variant::__get_alt<_Ip>(*__v).__value)
+             : nullptr;
+}
+
+template <size_t _Ip, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr add_pointer_t<variant_alternative_t<_Ip, variant<_Types...>>>
+get_if(variant<_Types...>* __v) noexcept {
+  static_assert(_Ip < sizeof...(_Types));
+  static_assert(!is_void_v<variant_alternative_t<_Ip, variant<_Types...>>>);
+  return std::__generic_get_if<_Ip>(__v);
+}
+
+template <size_t _Ip, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr add_pointer_t<const variant_alternative_t<_Ip, variant<_Types...>>>
+get_if(const variant<_Types...>* __v) noexcept {
+  static_assert(_Ip < sizeof...(_Types));
+  static_assert(!is_void_v<variant_alternative_t<_Ip, variant<_Types...>>>);
+  return std::__generic_get_if<_Ip>(__v);
+}
+
+template <class _Tp, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr add_pointer_t<_Tp>
+get_if(variant<_Types...>* __v) noexcept {
+  static_assert(!is_void_v<_Tp>);
+  return _VSTD::get_if<__find_exactly_one_t<_Tp, _Types...>::value>(__v);
+}
+
+template <class _Tp, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr add_pointer_t<const _Tp>
+get_if(const variant<_Types...>* __v) noexcept {
+  static_assert(!is_void_v<_Tp>);
+  return _VSTD::get_if<__find_exactly_one_t<_Tp, _Types...>::value>(__v);
+}
+
+template <class _Operator>
+struct __convert_to_bool {
+  template <class _T1, class _T2>
+  _LIBCPP_HIDE_FROM_ABI
+  constexpr bool operator()(_T1 && __t1, _T2&& __t2) const {
+    static_assert(is_convertible<decltype(_Operator{}(_VSTD::forward<_T1>(__t1), _VSTD::forward<_T2>(__t2))), bool>::value,
+        "the relational operator does not return a type which is implicitly convertible to bool");
+    return _Operator{}(_VSTD::forward<_T1>(__t1), _VSTD::forward<_T2>(__t2));
+  }
+};
+
+template <class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr bool operator==(const variant<_Types...>& __lhs,
+                          const variant<_Types...>& __rhs) {
+  using __variant_detail::__visitation::__variant;
+  if (__lhs.index() != __rhs.index()) return false;
+  if (__lhs.valueless_by_exception()) return true;
+  return __variant::__visit_value_at(__lhs.index(), __convert_to_bool<equal_to<>>{}, __lhs, __rhs);
+}
+
+#  if _LIBCPP_STD_VER > 17
+
+template <class... _Types> requires (three_way_comparable<_Types> && ...)
+_LIBCPP_HIDE_FROM_ABI constexpr common_comparison_category_t<compare_three_way_result_t<_Types>...>
+operator<=>(const variant<_Types...>& __lhs, const variant<_Types...>& __rhs) {
+  using __variant_detail::__visitation::__variant;
+  using __result_t = common_comparison_category_t<compare_three_way_result_t<_Types>...>;
+  if (__lhs.valueless_by_exception() && __rhs.valueless_by_exception())
+    return strong_ordering::equal;
+  if (__lhs.valueless_by_exception())
+    return strong_ordering::less;
+  if (__rhs.valueless_by_exception())
+    return strong_ordering::greater;
+  if (auto __c = __lhs.index() <=> __rhs.index(); __c != 0)
+    return __c;
+  auto __three_way = []<class _Type>(const _Type& __v, const _Type& __w) -> __result_t { return __v <=> __w; };
+  return __variant::__visit_value_at(__lhs.index(), __three_way, __lhs, __rhs);
+}
+
+#  endif // _LIBCPP_STD_VER > 17
+
+template <class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr bool operator!=(const variant<_Types...>& __lhs,
+                          const variant<_Types...>& __rhs) {
+  using __variant_detail::__visitation::__variant;
+  if (__lhs.index() != __rhs.index()) return true;
+  if (__lhs.valueless_by_exception()) return false;
+  return __variant::__visit_value_at(
+      __lhs.index(), __convert_to_bool<not_equal_to<>>{}, __lhs, __rhs);
+}
+
+template <class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr bool operator<(const variant<_Types...>& __lhs,
+                         const variant<_Types...>& __rhs) {
+  using __variant_detail::__visitation::__variant;
+  if (__rhs.valueless_by_exception()) return false;
+  if (__lhs.valueless_by_exception()) return true;
+  if (__lhs.index() < __rhs.index()) return true;
+  if (__lhs.index() > __rhs.index()) return false;
+  return __variant::__visit_value_at(__lhs.index(), __convert_to_bool<less<>>{}, __lhs, __rhs);
+}
+
+template <class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr bool operator>(const variant<_Types...>& __lhs,
+                         const variant<_Types...>& __rhs) {
+  using __variant_detail::__visitation::__variant;
+  if (__lhs.valueless_by_exception()) return false;
+  if (__rhs.valueless_by_exception()) return true;
+  if (__lhs.index() > __rhs.index()) return true;
+  if (__lhs.index() < __rhs.index()) return false;
+  return __variant::__visit_value_at(__lhs.index(), __convert_to_bool<greater<>>{}, __lhs, __rhs);
+}
+
+template <class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr bool operator<=(const variant<_Types...>& __lhs,
+                          const variant<_Types...>& __rhs) {
+  using __variant_detail::__visitation::__variant;
+  if (__lhs.valueless_by_exception()) return true;
+  if (__rhs.valueless_by_exception()) return false;
+  if (__lhs.index() < __rhs.index()) return true;
+  if (__lhs.index() > __rhs.index()) return false;
+  return __variant::__visit_value_at(
+      __lhs.index(), __convert_to_bool<less_equal<>>{}, __lhs, __rhs);
+}
+
+template <class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr bool operator>=(const variant<_Types...>& __lhs,
+                          const variant<_Types...>& __rhs) {
+  using __variant_detail::__visitation::__variant;
+  if (__rhs.valueless_by_exception()) return true;
+  if (__lhs.valueless_by_exception()) return false;
+  if (__lhs.index() > __rhs.index()) return true;
+  if (__lhs.index() < __rhs.index()) return false;
+  return __variant::__visit_value_at(
+      __lhs.index(), __convert_to_bool<greater_equal<>>{}, __lhs, __rhs);
+}
+
+template <class... _Vs>
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+constexpr void __throw_if_valueless(_Vs&&... __vs) {
+  const bool __valueless =
+      (... || _VSTD::__as_variant(__vs).valueless_by_exception());
+  if (__valueless) {
+    __throw_bad_variant_access();
+  }
+}
+
+template <
+    class _Visitor, class... _Vs,
+    typename = void_t<decltype(_VSTD::__as_variant(std::declval<_Vs>()))...> >
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+constexpr decltype(auto) visit(_Visitor&& __visitor, _Vs&&... __vs) {
+  using __variant_detail::__visitation::__variant;
+  _VSTD::__throw_if_valueless(_VSTD::forward<_Vs>(__vs)...);
+  return __variant::__visit_value(_VSTD::forward<_Visitor>(__visitor),
+                                  _VSTD::forward<_Vs>(__vs)...);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <
+    class _Rp, class _Visitor, class... _Vs,
+    typename = void_t<decltype(_VSTD::__as_variant(std::declval<_Vs>()))...> >
+_LIBCPP_HIDE_FROM_ABI
+_LIBCPP_AVAILABILITY_THROW_BAD_VARIANT_ACCESS
+constexpr _Rp visit(_Visitor&& __visitor, _Vs&&... __vs) {
+  using __variant_detail::__visitation::__variant;
+  _VSTD::__throw_if_valueless(_VSTD::forward<_Vs>(__vs)...);
+  return __variant::__visit_value<_Rp>(_VSTD::forward<_Visitor>(__visitor),
+                                       _VSTD::forward<_Vs>(__vs)...);
+}
+#endif
+
+template <class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+auto swap(variant<_Types...>& __lhs, variant<_Types...>& __rhs)
+  noexcept(noexcept(__lhs.swap(__rhs)))
+  -> decltype(      __lhs.swap(__rhs))
+  { return          __lhs.swap(__rhs); }
+
+template <class... _Types>
+struct _LIBCPP_TEMPLATE_VIS hash<
+    __enable_hash_helper<variant<_Types...>, remove_const_t<_Types>...>> {
+  using argument_type = variant<_Types...>;
+  using result_type = size_t;
+
+  _LIBCPP_HIDE_FROM_ABI
+  result_type operator()(const argument_type& __v) const {
+    using __variant_detail::__visitation::__variant;
+    size_t __res =
+        __v.valueless_by_exception()
+               ? 299792458 // Random value chosen by the universe upon creation
+               : __variant::__visit_alt(
+                     [](const auto& __alt) {
+                       using __alt_type = __remove_cvref_t<decltype(__alt)>;
+                       using __value_type = remove_const_t<
+                         typename __alt_type::__value_type>;
+                       return hash<__value_type>{}(__alt.__value);
+                     },
+                     __v);
+    return std::__hash_combine(__res, hash<size_t>{}(__v.index()));
+  }
+};
+
+// __unchecked_get is the same as std::get, except, it is UB to use it with the wrong
+// type whereas std::get will throw or returning nullptr. This makes it faster than
+// std::get.
+template <size_t _Ip, class _Vp>
+_LIBCPP_HIDE_FROM_ABI
+constexpr auto&& __unchecked_get(_Vp&& __v) noexcept {
+  using __variant_detail::__access::__variant;
+  return __variant::__get_alt<_Ip>(_VSTD::forward<_Vp>(__v)).__value;
+}
+
+template <class _Tp, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr auto&& __unchecked_get(const variant<_Types...>& __v) noexcept {
+  return std::__unchecked_get<__find_exactly_one_t<_Tp, _Types...>::value>(__v);
+}
+
+template <class _Tp, class... _Types>
+_LIBCPP_HIDE_FROM_ABI
+constexpr auto&& __unchecked_get(variant<_Types...>& __v) noexcept {
+  return std::__unchecked_get<__find_exactly_one_t<_Tp, _Types...>::value>(__v);
+}
+
+#endif // _LIBCPP_STD_VER > 14
+
+_LIBCPP_END_NAMESPACE_STD
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <type_traits>
+#  include <typeinfo>
+#  include <utility>
+#endif
+
+#endif // _LIBCPP_VARIANT
diff --git a/app/src/main/cpp/libcxx/include/vector b/app/src/main/cpp/libcxx/include/vector
new file mode 100644
index 0000000..4b7ae13
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/vector
@@ -0,0 +1,3366 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_VECTOR
+#define _LIBCPP_VECTOR
+
+/*
+    vector synopsis
+
+namespace std
+{
+
+template <class T, class Allocator = allocator<T> >
+class vector
+{
+public:
+    typedef T                                        value_type;
+    typedef Allocator                                allocator_type;
+    typedef typename allocator_type::reference       reference;
+    typedef typename allocator_type::const_reference const_reference;
+    typedef implementation-defined                   iterator;
+    typedef implementation-defined                   const_iterator;
+    typedef typename allocator_type::size_type       size_type;
+    typedef typename allocator_type::difference_type difference_type;
+    typedef typename allocator_type::pointer         pointer;
+    typedef typename allocator_type::const_pointer   const_pointer;
+    typedef std::reverse_iterator<iterator>          reverse_iterator;
+    typedef std::reverse_iterator<const_iterator>    const_reverse_iterator;
+
+    vector()
+        noexcept(is_nothrow_default_constructible<allocator_type>::value);
+    explicit vector(const allocator_type&);
+    explicit vector(size_type n);
+    explicit vector(size_type n, const allocator_type&); // C++14
+    vector(size_type n, const value_type& value, const allocator_type& = allocator_type());
+    template <class InputIterator>
+        vector(InputIterator first, InputIterator last, const allocator_type& = allocator_type());
+    vector(const vector& x);
+    vector(vector&& x)
+        noexcept(is_nothrow_move_constructible<allocator_type>::value);
+    vector(initializer_list<value_type> il);
+    vector(initializer_list<value_type> il, const allocator_type& a);
+    ~vector();
+    vector& operator=(const vector& x);
+    vector& operator=(vector&& x)
+        noexcept(
+             allocator_type::propagate_on_container_move_assignment::value ||
+             allocator_type::is_always_equal::value); // C++17
+    vector& operator=(initializer_list<value_type> il);
+    template <class InputIterator>
+        void assign(InputIterator first, InputIterator last);
+    void assign(size_type n, const value_type& u);
+    void assign(initializer_list<value_type> il);
+
+    allocator_type get_allocator() const noexcept;
+
+    iterator               begin() noexcept;
+    const_iterator         begin()   const noexcept;
+    iterator               end() noexcept;
+    const_iterator         end()     const noexcept;
+
+    reverse_iterator       rbegin() noexcept;
+    const_reverse_iterator rbegin()  const noexcept;
+    reverse_iterator       rend() noexcept;
+    const_reverse_iterator rend()    const noexcept;
+
+    const_iterator         cbegin()  const noexcept;
+    const_iterator         cend()    const noexcept;
+    const_reverse_iterator crbegin() const noexcept;
+    const_reverse_iterator crend()   const noexcept;
+
+    size_type size() const noexcept;
+    size_type max_size() const noexcept;
+    size_type capacity() const noexcept;
+    bool empty() const noexcept;
+    void reserve(size_type n);
+    void shrink_to_fit() noexcept;
+
+    reference       operator[](size_type n);
+    const_reference operator[](size_type n) const;
+    reference       at(size_type n);
+    const_reference at(size_type n) const;
+
+    reference       front();
+    const_reference front() const;
+    reference       back();
+    const_reference back() const;
+
+    value_type*       data() noexcept;
+    const value_type* data() const noexcept;
+
+    void push_back(const value_type& x);
+    void push_back(value_type&& x);
+    template <class... Args>
+        reference emplace_back(Args&&... args); // reference in C++17
+    void pop_back();
+
+    template <class... Args> iterator emplace(const_iterator position, Args&&... args);
+    iterator insert(const_iterator position, const value_type& x);
+    iterator insert(const_iterator position, value_type&& x);
+    iterator insert(const_iterator position, size_type n, const value_type& x);
+    template <class InputIterator>
+        iterator insert(const_iterator position, InputIterator first, InputIterator last);
+    iterator insert(const_iterator position, initializer_list<value_type> il);
+
+    iterator erase(const_iterator position);
+    iterator erase(const_iterator first, const_iterator last);
+
+    void clear() noexcept;
+
+    void resize(size_type sz);
+    void resize(size_type sz, const value_type& c);
+
+    void swap(vector&)
+        noexcept(allocator_traits<allocator_type>::propagate_on_container_swap::value ||
+                 allocator_traits<allocator_type>::is_always_equal::value);  // C++17
+
+    bool __invariants() const;
+};
+
+template <class Allocator = allocator<T> >
+class vector<bool, Allocator>
+{
+public:
+    typedef bool                                     value_type;
+    typedef Allocator                                allocator_type;
+    typedef implementation-defined                   iterator;
+    typedef implementation-defined                   const_iterator;
+    typedef typename allocator_type::size_type       size_type;
+    typedef typename allocator_type::difference_type difference_type;
+    typedef iterator                                 pointer;
+    typedef const_iterator                           const_pointer;
+    typedef std::reverse_iterator<iterator>          reverse_iterator;
+    typedef std::reverse_iterator<const_iterator>    const_reverse_iterator;
+
+    class reference
+    {
+    public:
+        reference(const reference&) noexcept;
+        operator bool() const noexcept;
+        reference& operator=(bool x) noexcept;
+        reference& operator=(const reference& x) noexcept;
+        iterator operator&() const noexcept;
+        void flip() noexcept;
+    };
+
+    class const_reference
+    {
+    public:
+        const_reference(const reference&) noexcept;
+        operator bool() const noexcept;
+        const_iterator operator&() const noexcept;
+    };
+
+    vector()
+        noexcept(is_nothrow_default_constructible<allocator_type>::value);
+    explicit vector(const allocator_type&);
+    explicit vector(size_type n, const allocator_type& a = allocator_type()); // C++14
+    vector(size_type n, const value_type& value, const allocator_type& = allocator_type());
+    template <class InputIterator>
+        vector(InputIterator first, InputIterator last, const allocator_type& = allocator_type());
+    vector(const vector& x);
+    vector(vector&& x)
+        noexcept(is_nothrow_move_constructible<allocator_type>::value);
+    vector(initializer_list<value_type> il);
+    vector(initializer_list<value_type> il, const allocator_type& a);
+    ~vector();
+    vector& operator=(const vector& x);
+    vector& operator=(vector&& x)
+        noexcept(
+             allocator_type::propagate_on_container_move_assignment::value ||
+             allocator_type::is_always_equal::value); // C++17
+    vector& operator=(initializer_list<value_type> il);
+    template <class InputIterator>
+        void assign(InputIterator first, InputIterator last);
+    void assign(size_type n, const value_type& u);
+    void assign(initializer_list<value_type> il);
+
+    allocator_type get_allocator() const noexcept;
+
+    iterator               begin() noexcept;
+    const_iterator         begin()   const noexcept;
+    iterator               end() noexcept;
+    const_iterator         end()     const noexcept;
+
+    reverse_iterator       rbegin() noexcept;
+    const_reverse_iterator rbegin()  const noexcept;
+    reverse_iterator       rend() noexcept;
+    const_reverse_iterator rend()    const noexcept;
+
+    const_iterator         cbegin()  const noexcept;
+    const_iterator         cend()    const noexcept;
+    const_reverse_iterator crbegin() const noexcept;
+    const_reverse_iterator crend()   const noexcept;
+
+    size_type size() const noexcept;
+    size_type max_size() const noexcept;
+    size_type capacity() const noexcept;
+    bool empty() const noexcept;
+    void reserve(size_type n);
+    void shrink_to_fit() noexcept;
+
+    reference       operator[](size_type n);
+    const_reference operator[](size_type n) const;
+    reference       at(size_type n);
+    const_reference at(size_type n) const;
+
+    reference       front();
+    const_reference front() const;
+    reference       back();
+    const_reference back() const;
+
+    void push_back(const value_type& x);
+    template <class... Args> reference emplace_back(Args&&... args);  // C++14; reference in C++17
+    void pop_back();
+
+    template <class... Args> iterator emplace(const_iterator position, Args&&... args);  // C++14
+    iterator insert(const_iterator position, const value_type& x);
+    iterator insert(const_iterator position, size_type n, const value_type& x);
+    template <class InputIterator>
+        iterator insert(const_iterator position, InputIterator first, InputIterator last);
+    iterator insert(const_iterator position, initializer_list<value_type> il);
+
+    iterator erase(const_iterator position);
+    iterator erase(const_iterator first, const_iterator last);
+
+    void clear() noexcept;
+
+    void resize(size_type sz);
+    void resize(size_type sz, value_type x);
+
+    void swap(vector&)
+        noexcept(allocator_traits<allocator_type>::propagate_on_container_swap::value ||
+                 allocator_traits<allocator_type>::is_always_equal::value);  // C++17
+    void flip() noexcept;
+
+    bool __invariants() const;
+};
+
+template <class InputIterator, class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>>
+   vector(InputIterator, InputIterator, Allocator = Allocator())
+   -> vector<typename iterator_traits<InputIterator>::value_type, Allocator>; // C++17
+
+template <class Allocator> struct hash<std::vector<bool, Allocator>>;
+
+template <class T, class Allocator> bool operator==(const vector<T,Allocator>& x, const vector<T,Allocator>& y);
+template <class T, class Allocator> bool operator< (const vector<T,Allocator>& x, const vector<T,Allocator>& y);
+template <class T, class Allocator> bool operator!=(const vector<T,Allocator>& x, const vector<T,Allocator>& y);
+template <class T, class Allocator> bool operator> (const vector<T,Allocator>& x, const vector<T,Allocator>& y);
+template <class T, class Allocator> bool operator>=(const vector<T,Allocator>& x, const vector<T,Allocator>& y);
+template <class T, class Allocator> bool operator<=(const vector<T,Allocator>& x, const vector<T,Allocator>& y);
+
+template <class T, class Allocator>
+void swap(vector<T,Allocator>& x, vector<T,Allocator>& y)
+    noexcept(noexcept(x.swap(y)));
+
+template <class T, class Allocator, class U>
+typename vector<T, Allocator>::size_type
+erase(vector<T, Allocator>& c, const U& value);       // C++20
+template <class T, class Allocator, class Predicate>
+typename vector<T, Allocator>::size_type
+erase_if(vector<T, Allocator>& c, Predicate pred);    // C++20
+
+
+template<class T>
+ inline constexpr bool is-vector-bool-reference = see below;        // exposition only, since C++23
+
+template<class T, class charT> requires is-vector-bool-reference<T> // Since C++23
+ struct formatter<T, charT>;
+
+}  // std
+
+*/
+
+#include <__algorithm/copy.h>
+#include <__algorithm/equal.h>
+#include <__algorithm/fill_n.h>
+#include <__algorithm/lexicographical_compare.h>
+#include <__algorithm/remove.h>
+#include <__algorithm/remove_if.h>
+#include <__algorithm/rotate.h>
+#include <__algorithm/unwrap_iter.h>
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__bit_reference>
+#include <__concepts/same_as.h>
+#include <__config>
+#include <__debug>
+#include <__format/enable_insertable.h>
+#include <__format/formatter.h>
+#include <__functional/hash.h>
+#include <__functional/unary_function.h>
+#include <__iterator/advance.h>
+#include <__iterator/iterator_traits.h>
+#include <__iterator/reverse_iterator.h>
+#include <__iterator/wrap_iter.h>
+#include <__memory/allocate_at_least.h>
+#include <__memory/pointer_traits.h>
+#include <__memory/swap_allocator.h>
+#include <__memory/temp_value.h>
+#include <__memory/uninitialized_algorithms.h>
+#include <__memory_resource/polymorphic_allocator.h>
+#include <__split_buffer>
+#include <__type_traits/is_allocator.h>
+#include <__type_traits/noexcept_move_assign_container.h>
+#include <__utility/exception_guard.h>
+#include <__utility/forward.h>
+#include <__utility/move.h>
+#include <__utility/swap.h>
+#include <climits>
+#include <cstdlib>
+#include <cstring>
+#include <iosfwd> // for forward declaration of vector
+#include <limits>
+#include <stdexcept>
+#include <type_traits>
+#include <version>
+
+// standard-mandated includes
+
+// [iterator.range]
+#include <__iterator/access.h>
+#include <__iterator/data.h>
+#include <__iterator/empty.h>
+#include <__iterator/reverse_access.h>
+#include <__iterator/size.h>
+
+// [vector.syn]
+#include <compare>
+#include <initializer_list>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+_LIBCPP_PUSH_MACROS
+#include <__undef_macros>
+
+
+_LIBCPP_BEGIN_NAMESPACE_STD
+
+template <class _Tp, class _Allocator /* = allocator<_Tp> */>
+class _LIBCPP_TEMPLATE_VIS vector
+{
+private:
+    typedef allocator<_Tp>                                  __default_allocator_type;
+public:
+    typedef vector                                          __self;
+    typedef _Tp                                             value_type;
+    typedef _Allocator                                      allocator_type;
+    typedef allocator_traits<allocator_type>                __alloc_traits;
+    typedef value_type&                                     reference;
+    typedef const value_type&                               const_reference;
+    typedef typename __alloc_traits::size_type              size_type;
+    typedef typename __alloc_traits::difference_type        difference_type;
+    typedef typename __alloc_traits::pointer                pointer;
+    typedef typename __alloc_traits::const_pointer          const_pointer;
+    // TODO: Implement iterator bounds checking without requiring the global database.
+    typedef __wrap_iter<pointer>                            iterator;
+    typedef __wrap_iter<const_pointer>                      const_iterator;
+    typedef std::reverse_iterator<iterator>               reverse_iterator;
+    typedef std::reverse_iterator<const_iterator>         const_reverse_iterator;
+
+    static_assert((is_same<typename allocator_type::value_type, value_type>::value),
+                  "Allocator::value_type must be same type as value_type");
+
+    static_assert(is_same<allocator_type, __rebind_alloc<__alloc_traits, value_type> >::value,
+                  "[allocator.requirements] states that rebinding an allocator to the same type should result in the "
+                  "original allocator");
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    vector() _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
+    {
+        std::__debug_db_insert_c(this);
+    }
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI explicit vector(const allocator_type& __a)
+#if _LIBCPP_STD_VER <= 14
+        _NOEXCEPT_(is_nothrow_copy_constructible<allocator_type>::value)
+#else
+        _NOEXCEPT
+#endif
+        : __end_cap_(nullptr, __a)
+    {
+        std::__debug_db_insert_c(this);
+    }
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI explicit vector(size_type __n);
+#if _LIBCPP_STD_VER > 11
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI explicit vector(size_type __n, const allocator_type& __a);
+#endif
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(size_type __n, const value_type& __x);
+
+    template <class = __enable_if_t<__is_allocator<_Allocator>::value> >
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    vector(size_type __n, const value_type& __x, const allocator_type& __a)
+        : __end_cap_(nullptr, __a)
+    {
+      std::__debug_db_insert_c(this);
+      if (__n > 0)
+      {
+          __vallocate(__n);
+          __construct_at_end(__n, __x);
+      }
+    }
+
+  template <class _InputIterator,
+            __enable_if_t<__is_exactly_cpp17_input_iterator<_InputIterator>::value &&
+                              is_constructible<value_type, typename iterator_traits<_InputIterator>::reference>::value,
+                          int> = 0>
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(_InputIterator __first, _InputIterator __last);
+  template <class _InputIterator,
+            __enable_if_t<__is_exactly_cpp17_input_iterator<_InputIterator>::value &&
+                              is_constructible<value_type, typename iterator_traits<_InputIterator>::reference>::value,
+                          int> = 0>
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a);
+
+  template <
+      class _ForwardIterator,
+      __enable_if_t<__is_cpp17_forward_iterator<_ForwardIterator>::value &&
+                        is_constructible<value_type, typename iterator_traits<_ForwardIterator>::reference>::value,
+                    int> = 0>
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(_ForwardIterator __first, _ForwardIterator __last);
+
+  template <class _ForwardIterator,
+      __enable_if_t<__is_cpp17_forward_iterator<_ForwardIterator>::value &&
+                        is_constructible<value_type, typename iterator_traits<_ForwardIterator>::reference>::value,
+                    int> = 0>
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a);
+
+private:
+  class __destroy_vector {
+    public:
+      _LIBCPP_CONSTEXPR __destroy_vector(vector& __vec) : __vec_(__vec) {}
+
+      _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void operator()() {
+          __vec_.__annotate_delete();
+          std::__debug_db_erase_c(std::addressof(__vec_));
+
+          if (__vec_.__begin_ != nullptr) {
+            __vec_.__clear();
+            __alloc_traits::deallocate(__vec_.__alloc(), __vec_.__begin_, __vec_.capacity());
+          }
+      }
+
+    private:
+      vector& __vec_;
+  };
+
+public:
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI ~vector() { __destroy_vector(*this)(); }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(const vector& __x);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(const vector& __x, const __type_identity_t<allocator_type>& __a);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    vector& operator=(const vector& __x);
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    vector(initializer_list<value_type> __il);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    vector(initializer_list<value_type> __il, const allocator_type& __a);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    vector& operator=(initializer_list<value_type> __il)
+        {assign(__il.begin(), __il.end()); return *this;}
+#endif // !_LIBCPP_CXX03_LANG
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    vector(vector&& __x)
+#if _LIBCPP_STD_VER > 14
+        noexcept;
+#else
+        _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value);
+#endif
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    vector(vector&& __x, const __type_identity_t<allocator_type>& __a);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    vector& operator=(vector&& __x)
+        _NOEXCEPT_((__noexcept_move_assign_container<_Allocator, __alloc_traits>::value));
+
+  template <class _InputIterator,
+            __enable_if_t<__is_exactly_cpp17_input_iterator<_InputIterator>::value &&
+                              is_constructible<value_type, typename iterator_traits<_InputIterator>::reference>::value,
+                          int> = 0>
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void assign(_InputIterator __first, _InputIterator __last);
+  template <
+      class _ForwardIterator,
+      __enable_if_t<__is_cpp17_forward_iterator<_ForwardIterator>::value &&
+                        is_constructible<value_type, typename iterator_traits<_ForwardIterator>::reference>::value,
+                    int> = 0>
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void assign(_ForwardIterator __first, _ForwardIterator __last);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void assign(size_type __n, const_reference __u);
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void assign(initializer_list<value_type> __il)
+        {assign(__il.begin(), __il.end());}
+#endif
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    allocator_type get_allocator() const _NOEXCEPT
+        {return this->__alloc();}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator               begin() _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator         begin()   const _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator               end() _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator         end()     const _NOEXCEPT;
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    reverse_iterator       rbegin() _NOEXCEPT
+        {return       reverse_iterator(end());}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    const_reverse_iterator rbegin()  const _NOEXCEPT
+        {return const_reverse_iterator(end());}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    reverse_iterator       rend() _NOEXCEPT
+        {return       reverse_iterator(begin());}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    const_reverse_iterator rend()    const _NOEXCEPT
+        {return const_reverse_iterator(begin());}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    const_iterator         cbegin()  const _NOEXCEPT
+        {return begin();}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    const_iterator         cend()    const _NOEXCEPT
+        {return end();}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    const_reverse_iterator crbegin() const _NOEXCEPT
+        {return rbegin();}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    const_reverse_iterator crend()   const _NOEXCEPT
+        {return rend();}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    size_type size() const _NOEXCEPT
+        {return static_cast<size_type>(this->__end_ - this->__begin_);}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    size_type capacity() const _NOEXCEPT
+        {return static_cast<size_type>(__end_cap() - this->__begin_);}
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    bool empty() const _NOEXCEPT
+        {return this->__begin_ == this->__end_;}
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type max_size() const _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void reserve(size_type __n);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void shrink_to_fit() _NOEXCEPT;
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reference       operator[](size_type __n) _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference operator[](size_type __n) const _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reference       at(size_type __n);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference at(size_type __n) const;
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reference       front() _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(!empty(), "front() called on an empty vector");
+        return *this->__begin_;
+    }
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference front() const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(!empty(), "front() called on an empty vector");
+        return *this->__begin_;
+    }
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reference       back() _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(!empty(), "back() called on an empty vector");
+        return *(this->__end_ - 1);
+    }
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference back()  const _NOEXCEPT
+    {
+        _LIBCPP_ASSERT(!empty(), "back() called on an empty vector");
+        return *(this->__end_ - 1);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    value_type*       data() _NOEXCEPT
+        {return std::__to_address(this->__begin_);}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    const value_type* data() const _NOEXCEPT
+        {return std::__to_address(this->__begin_);}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void push_back(const_reference __x);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void push_back(value_type&& __x);
+
+    template <class... _Args>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+#if _LIBCPP_STD_VER > 14
+        reference emplace_back(_Args&&... __args);
+#else
+        void      emplace_back(_Args&&... __args);
+#endif
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void pop_back();
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, const_reference __x);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, value_type&& __x);
+    template <class... _Args>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator emplace(const_iterator __position, _Args&&... __args);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    iterator insert(const_iterator __position, size_type __n, const_reference __x);
+
+  template <class _InputIterator,
+            __enable_if_t<__is_exactly_cpp17_input_iterator<_InputIterator>::value &&
+                              is_constructible< value_type, typename iterator_traits<_InputIterator>::reference>::value,
+                          int> = 0>
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator
+  insert(const_iterator __position, _InputIterator __first, _InputIterator __last);
+
+  template <
+      class _ForwardIterator,
+      __enable_if_t<__is_cpp17_forward_iterator<_ForwardIterator>::value &&
+                        is_constructible< value_type, typename iterator_traits<_ForwardIterator>::reference>::value,
+                    int> = 0>
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator
+  insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last);
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    iterator insert(const_iterator __position, initializer_list<value_type> __il)
+        {return insert(__position, __il.begin(), __il.end());}
+#endif
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __position);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __first, const_iterator __last);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void clear() _NOEXCEPT
+    {
+        size_type __old_size = size();
+        __clear();
+        __annotate_shrink(__old_size);
+        std::__debug_db_invalidate_all(this);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void resize(size_type __sz);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void resize(size_type __sz, const_reference __x);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void swap(vector&)
+#if _LIBCPP_STD_VER >= 14
+        _NOEXCEPT;
+#else
+        _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
+                    __is_nothrow_swappable<allocator_type>::value);
+#endif
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI bool __invariants() const;
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+    bool __dereferenceable(const const_iterator* __i) const;
+    bool __decrementable(const const_iterator* __i) const;
+    bool __addable(const const_iterator* __i, ptrdiff_t __n) const;
+    bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const;
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+private:
+    pointer __begin_ = nullptr;
+    pointer __end_ = nullptr;
+    __compressed_pair<pointer, allocator_type> __end_cap_ =
+        __compressed_pair<pointer, allocator_type>(nullptr, __default_init_tag());
+
+    _LIBCPP_HIDE_FROM_ABI void __invalidate_iterators_past(pointer __new_last);
+
+    //  Allocate space for __n objects
+    //  throws length_error if __n > max_size()
+    //  throws (probably bad_alloc) if memory run out
+    //  Precondition:  __begin_ == __end_ == __end_cap() == 0
+    //  Precondition:  __n > 0
+    //  Postcondition:  capacity() >= __n
+    //  Postcondition:  size() == 0
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __vallocate(size_type __n) {
+        if (__n > max_size())
+            __throw_length_error();
+        auto __allocation = std::__allocate_at_least(__alloc(), __n);
+        __begin_ = __allocation.ptr;
+        __end_ = __allocation.ptr;
+        __end_cap() = __begin_ + __allocation.count;
+        __annotate_new(0);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __vdeallocate() _NOEXCEPT;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type __recommend(size_type __new_size) const;
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __construct_at_end(size_type __n);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void __construct_at_end(size_type __n, const_reference __x);
+
+  template <class _ForwardIterator, __enable_if_t<__is_cpp17_forward_iterator<_ForwardIterator>::value, int> = 0>
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void
+  __construct_at_end(_ForwardIterator __first, _ForwardIterator __last, size_type __n);
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __append(size_type __n);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __append(size_type __n, const_reference __x);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    iterator       __make_iter(pointer __p) _NOEXCEPT { return iterator(this, __p); }
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    const_iterator __make_iter(const_pointer __p) const _NOEXCEPT { return const_iterator(this, __p); }
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI pointer __swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v, pointer __p);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_range(pointer __from_s, pointer __from_e, pointer __to);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_assign(vector& __c, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_assign(vector& __c, false_type)
+        _NOEXCEPT_(__alloc_traits::is_always_equal::value);
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void __destruct_at_end(pointer __new_last) _NOEXCEPT
+    {
+        if (!__libcpp_is_constant_evaluated())
+            __invalidate_iterators_past(__new_last);
+        size_type __old_size = size();
+        __base_destruct_at_end(__new_last);
+        __annotate_shrink(__old_size);
+    }
+
+    template <class _Up>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    inline void __push_back_slow_path(_Up&& __x);
+
+    template <class... _Args>
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    inline void __emplace_back_slow_path(_Args&&... __args);
+
+    // The following functions are no-ops outside of AddressSanitizer mode.
+    // We call annotatations only for the default Allocator because other allocators
+    // may not meet the AddressSanitizer alignment constraints.
+    // See the documentation for __sanitizer_annotate_contiguous_container for more details.
+#ifndef _LIBCPP_HAS_NO_ASAN
+    _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __annotate_contiguous_container(const void *__beg, const void *__end,
+                                         const void *__old_mid,
+                                         const void *__new_mid) const
+    {
+
+      if (!__libcpp_is_constant_evaluated() && __beg && is_same<allocator_type, __default_allocator_type>::value)
+        __sanitizer_annotate_contiguous_container(__beg, __end, __old_mid, __new_mid);
+    }
+#else
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void __annotate_contiguous_container(const void*, const void*, const void*,
+                                         const void*) const _NOEXCEPT {}
+#endif
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void __annotate_new(size_type __current_size) const _NOEXCEPT {
+      __annotate_contiguous_container(data(), data() + capacity(),
+                                      data() + capacity(), data() + __current_size);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void __annotate_delete() const _NOEXCEPT {
+      __annotate_contiguous_container(data(), data() + capacity(),
+                                      data() + size(), data() + capacity());
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void __annotate_increase(size_type __n) const _NOEXCEPT
+    {
+      __annotate_contiguous_container(data(), data() + capacity(),
+                                      data() + size(), data() + size() + __n);
+    }
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    void __annotate_shrink(size_type __old_size) const _NOEXCEPT
+    {
+      __annotate_contiguous_container(data(), data() + capacity(),
+                                      data() + __old_size, data() + size());
+    }
+
+  struct _ConstructTransaction {
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+    explicit _ConstructTransaction(vector &__v, size_type __n)
+      : __v_(__v), __pos_(__v.__end_), __new_end_(__v.__end_ + __n) {
+#ifndef _LIBCPP_HAS_NO_ASAN
+      __v_.__annotate_increase(__n);
+#endif
+    }
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI ~_ConstructTransaction() {
+      __v_.__end_ = __pos_;
+#ifndef _LIBCPP_HAS_NO_ASAN
+      if (__pos_ != __new_end_) {
+        __v_.__annotate_shrink(__new_end_ - __v_.__begin_);
+      }
+#endif
+    }
+
+    vector &__v_;
+    pointer __pos_;
+    const_pointer const __new_end_;
+
+  private:
+    _ConstructTransaction(_ConstructTransaction const&) = delete;
+    _ConstructTransaction& operator=(_ConstructTransaction const&) = delete;
+  };
+
+  template <class ..._Args>
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  void __construct_one_at_end(_Args&& ...__args) {
+    _ConstructTransaction __tx(*this, 1);
+    __alloc_traits::construct(this->__alloc(), std::__to_address(__tx.__pos_),
+        std::forward<_Args>(__args)...);
+    ++__tx.__pos_;
+  }
+
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  allocator_type& __alloc() _NOEXCEPT
+      {return this->__end_cap_.second();}
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  const allocator_type& __alloc() const _NOEXCEPT
+      {return this->__end_cap_.second();}
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  pointer& __end_cap() _NOEXCEPT
+      {return this->__end_cap_.first();}
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  const pointer& __end_cap() const _NOEXCEPT
+      {return this->__end_cap_.first();}
+
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  void __clear() _NOEXCEPT {__base_destruct_at_end(this->__begin_);}
+
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  void __base_destruct_at_end(pointer __new_last) _NOEXCEPT {
+    pointer __soon_to_be_end = this->__end_;
+    while (__new_last != __soon_to_be_end)
+        __alloc_traits::destroy(__alloc(), std::__to_address(--__soon_to_be_end));
+    this->__end_ = __new_last;
+  }
+
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  void __copy_assign_alloc(const vector& __c)
+      {__copy_assign_alloc(__c, integral_constant<bool,
+                    __alloc_traits::propagate_on_container_copy_assignment::value>());}
+
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  void __move_assign_alloc(vector& __c)
+      _NOEXCEPT_(
+          !__alloc_traits::propagate_on_container_move_assignment::value ||
+          is_nothrow_move_assignable<allocator_type>::value)
+      {__move_assign_alloc(__c, integral_constant<bool,
+                    __alloc_traits::propagate_on_container_move_assignment::value>());}
+
+  _LIBCPP_NORETURN _LIBCPP_HIDE_FROM_ABI
+  void __throw_length_error() const {
+      std::__throw_length_error("vector");
+  }
+
+  _LIBCPP_NORETURN _LIBCPP_HIDE_FROM_ABI
+  void __throw_out_of_range() const {
+      std::__throw_out_of_range("vector");
+  }
+
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  void __copy_assign_alloc(const vector& __c, true_type)
+  {
+    if (__alloc() != __c.__alloc())
+    {
+      __clear();
+      __alloc_traits::deallocate(__alloc(), this->__begin_, capacity());
+      this->__begin_ = this->__end_ = __end_cap() = nullptr;
+    }
+    __alloc() = __c.__alloc();
+  }
+
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  void __copy_assign_alloc(const vector&, false_type)
+  {}
+
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  void __move_assign_alloc(vector& __c, true_type)
+      _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
+  {
+    __alloc() = std::move(__c.__alloc());
+  }
+
+  _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI
+  void __move_assign_alloc(vector&, false_type)
+      _NOEXCEPT
+  {}
+};
+
+#if _LIBCPP_STD_VER >= 17
+template<class _InputIterator,
+         class _Alloc = allocator<__iter_value_type<_InputIterator>>,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Alloc>::value>
+         >
+vector(_InputIterator, _InputIterator)
+  -> vector<__iter_value_type<_InputIterator>, _Alloc>;
+
+template<class _InputIterator,
+         class _Alloc,
+         class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
+         class = enable_if_t<__is_allocator<_Alloc>::value>
+         >
+vector(_InputIterator, _InputIterator, _Alloc)
+  -> vector<__iter_value_type<_InputIterator>, _Alloc>;
+#endif
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::__swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v)
+{
+    __annotate_delete();
+    using _RevIter = std::reverse_iterator<pointer>;
+    __v.__begin_   = std::__uninitialized_allocator_move_if_noexcept(
+                       __alloc(), _RevIter(__end_), _RevIter(__begin_), _RevIter(__v.__begin_))
+                       .base();
+    std::swap(this->__begin_, __v.__begin_);
+    std::swap(this->__end_, __v.__end_);
+    std::swap(this->__end_cap(), __v.__end_cap());
+    __v.__first_ = __v.__begin_;
+    __annotate_new(size());
+    std::__debug_db_invalidate_all(this);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<_Tp, _Allocator>::pointer
+vector<_Tp, _Allocator>::__swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v, pointer __p)
+{
+    __annotate_delete();
+    pointer __r = __v.__begin_;
+    using _RevIter = std::reverse_iterator<pointer>;
+    __v.__begin_   = std::__uninitialized_allocator_move_if_noexcept(
+                       __alloc(), _RevIter(__p), _RevIter(__begin_), _RevIter(__v.__begin_))
+                       .base();
+    __v.__end_ = std::__uninitialized_allocator_move_if_noexcept(__alloc(), __p, __end_, __v.__end_);
+    std::swap(this->__begin_, __v.__begin_);
+    std::swap(this->__end_, __v.__end_);
+    std::swap(this->__end_cap(), __v.__end_cap());
+    __v.__first_ = __v.__begin_;
+    __annotate_new(size());
+    std::__debug_db_invalidate_all(this);
+    return __r;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::__vdeallocate() _NOEXCEPT
+{
+    if (this->__begin_ != nullptr)
+    {
+        clear();
+        __alloc_traits::deallocate(this->__alloc(), this->__begin_, capacity());
+        this->__begin_ = this->__end_ = this->__end_cap() = nullptr;
+    }
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<_Tp, _Allocator>::size_type
+vector<_Tp, _Allocator>::max_size() const _NOEXCEPT
+{
+    return std::min<size_type>(__alloc_traits::max_size(this->__alloc()),
+                                 numeric_limits<difference_type>::max());
+}
+
+//  Precondition:  __new_size > capacity()
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+typename vector<_Tp, _Allocator>::size_type
+vector<_Tp, _Allocator>::__recommend(size_type __new_size) const
+{
+    const size_type __ms = max_size();
+    if (__new_size > __ms)
+        this->__throw_length_error();
+    const size_type __cap = capacity();
+    if (__cap >= __ms / 2)
+        return __ms;
+    return std::max<size_type>(2 * __cap, __new_size);
+}
+
+//  Default constructs __n objects starting at __end_
+//  throws if construction throws
+//  Precondition:  __n > 0
+//  Precondition:  size() + __n <= capacity()
+//  Postcondition:  size() == size() + __n
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::__construct_at_end(size_type __n)
+{
+    _ConstructTransaction __tx(*this, __n);
+    const_pointer __new_end = __tx.__new_end_;
+    for (pointer __pos = __tx.__pos_; __pos != __new_end; __tx.__pos_ = ++__pos) {
+        __alloc_traits::construct(this->__alloc(), std::__to_address(__pos));
+    }
+}
+
+//  Copy constructs __n objects starting at __end_ from __x
+//  throws if construction throws
+//  Precondition:  __n > 0
+//  Precondition:  size() + __n <= capacity()
+//  Postcondition:  size() == old size() + __n
+//  Postcondition:  [i] == __x for all i in [size() - __n, __n)
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline
+void
+vector<_Tp, _Allocator>::__construct_at_end(size_type __n, const_reference __x)
+{
+    _ConstructTransaction __tx(*this, __n);
+    const_pointer __new_end = __tx.__new_end_;
+    for (pointer __pos = __tx.__pos_; __pos != __new_end; __tx.__pos_ = ++__pos) {
+        __alloc_traits::construct(this->__alloc(), std::__to_address(__pos), __x);
+    }
+}
+
+template <class _Tp, class _Allocator>
+template <class _ForwardIterator, __enable_if_t<__is_cpp17_forward_iterator<_ForwardIterator>::value, int> >
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<_Tp, _Allocator>::__construct_at_end(_ForwardIterator __first, _ForwardIterator __last, size_type __n)
+{
+  _ConstructTransaction __tx(*this, __n);
+  __tx.__pos_ = std::__uninitialized_allocator_copy(__alloc(), __first, __last, __tx.__pos_);
+}
+
+//  Default constructs __n objects starting at __end_
+//  throws if construction throws
+//  Postcondition:  size() == size() + __n
+//  Exception safety: strong.
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::__append(size_type __n)
+{
+    if (static_cast<size_type>(this->__end_cap() - this->__end_) >= __n)
+        this->__construct_at_end(__n);
+    else
+    {
+        allocator_type& __a = this->__alloc();
+        __split_buffer<value_type, allocator_type&> __v(__recommend(size() + __n), size(), __a);
+        __v.__construct_at_end(__n);
+        __swap_out_circular_buffer(__v);
+    }
+}
+
+//  Default constructs __n objects starting at __end_
+//  throws if construction throws
+//  Postcondition:  size() == size() + __n
+//  Exception safety: strong.
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::__append(size_type __n, const_reference __x)
+{
+    if (static_cast<size_type>(this->__end_cap() - this->__end_) >= __n)
+        this->__construct_at_end(__n, __x);
+    else
+    {
+        allocator_type& __a = this->__alloc();
+        __split_buffer<value_type, allocator_type&> __v(__recommend(size() + __n), size(), __a);
+        __v.__construct_at_end(__n, __x);
+        __swap_out_circular_buffer(__v);
+    }
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<_Tp, _Allocator>::vector(size_type __n)
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    std::__debug_db_insert_c(this);
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__n);
+    }
+    __guard.__complete();
+}
+
+#if _LIBCPP_STD_VER > 11
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<_Tp, _Allocator>::vector(size_type __n, const allocator_type& __a)
+    : __end_cap_(nullptr, __a)
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    std::__debug_db_insert_c(this);
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__n);
+    }
+    __guard.__complete();
+}
+#endif
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<_Tp, _Allocator>::vector(size_type __n, const value_type& __x)
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    std::__debug_db_insert_c(this);
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__n, __x);
+    }
+    __guard.__complete();
+}
+
+template <class _Tp, class _Allocator>
+template <class _InputIterator, __enable_if_t<__is_exactly_cpp17_input_iterator<_InputIterator>::value &&
+                              is_constructible<_Tp, typename iterator_traits<_InputIterator>::reference>::value,
+                          int> >
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<_Tp, _Allocator>::vector(_InputIterator __first, _InputIterator __last)
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    std::__debug_db_insert_c(this);
+    for (; __first != __last; ++__first)
+        emplace_back(*__first);
+    __guard.__complete();
+}
+
+template <class _Tp, class _Allocator>
+template <class _InputIterator, __enable_if_t<__is_exactly_cpp17_input_iterator<_InputIterator>::value &&
+                              is_constructible<_Tp, typename iterator_traits<_InputIterator>::reference>::value,
+                          int> >
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<_Tp, _Allocator>::vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a)
+    : __end_cap_(nullptr, __a)
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    std::__debug_db_insert_c(this);
+    for (; __first != __last; ++__first)
+        emplace_back(*__first);
+    __guard.__complete();
+}
+
+template <class _Tp, class _Allocator>
+template <class _ForwardIterator, __enable_if_t<__is_cpp17_forward_iterator<_ForwardIterator>::value &&
+                        is_constructible<_Tp, typename iterator_traits<_ForwardIterator>::reference>::value,
+                    int> >
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<_Tp, _Allocator>::vector(_ForwardIterator __first, _ForwardIterator __last)
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    std::__debug_db_insert_c(this);
+    size_type __n = static_cast<size_type>(std::distance(__first, __last));
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__first, __last, __n);
+    }
+    __guard.__complete();
+}
+
+template <class _Tp, class _Allocator>
+template <class _ForwardIterator, __enable_if_t<__is_cpp17_forward_iterator<_ForwardIterator>::value &&
+                        is_constructible<_Tp, typename iterator_traits<_ForwardIterator>::reference>::value,
+                    int> >
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<_Tp, _Allocator>::vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a)
+    : __end_cap_(nullptr, __a)
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    std::__debug_db_insert_c(this);
+    size_type __n = static_cast<size_type>(std::distance(__first, __last));
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__first, __last, __n);
+    }
+    __guard.__complete();
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<_Tp, _Allocator>::vector(const vector& __x)
+    : __end_cap_(nullptr, __alloc_traits::select_on_container_copy_construction(__x.__alloc()))
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    std::__debug_db_insert_c(this);
+    size_type __n = __x.size();
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__x.__begin_, __x.__end_, __n);
+    }
+    __guard.__complete();
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<_Tp, _Allocator>::vector(const vector& __x, const __type_identity_t<allocator_type>& __a)
+    : __end_cap_(nullptr, __a)
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    std::__debug_db_insert_c(this);
+    size_type __n = __x.size();
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__x.__begin_, __x.__end_, __n);
+    }
+    __guard.__complete();
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+vector<_Tp, _Allocator>::vector(vector&& __x)
+#if _LIBCPP_STD_VER > 14
+        noexcept
+#else
+        _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value)
+#endif
+    : __end_cap_(nullptr, std::move(__x.__alloc()))
+{
+    std::__debug_db_insert_c(this);
+    std::__debug_db_swap(this, std::addressof(__x));
+    this->__begin_ = __x.__begin_;
+    this->__end_ = __x.__end_;
+    this->__end_cap() = __x.__end_cap();
+    __x.__begin_ = __x.__end_ = __x.__end_cap() = nullptr;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+vector<_Tp, _Allocator>::vector(vector&& __x, const __type_identity_t<allocator_type>& __a)
+    : __end_cap_(nullptr, __a)
+{
+    std::__debug_db_insert_c(this);
+    if (__a == __x.__alloc())
+    {
+        this->__begin_ = __x.__begin_;
+        this->__end_ = __x.__end_;
+        this->__end_cap() = __x.__end_cap();
+        __x.__begin_ = __x.__end_ = __x.__end_cap() = nullptr;
+        std::__debug_db_swap(this, std::addressof(__x));
+    }
+    else
+    {
+        typedef move_iterator<iterator> _Ip;
+        auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+        assign(_Ip(__x.begin()), _Ip(__x.end()));
+        __guard.__complete();
+    }
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+vector<_Tp, _Allocator>::vector(initializer_list<value_type> __il)
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    std::__debug_db_insert_c(this);
+    if (__il.size() > 0)
+    {
+        __vallocate(__il.size());
+        __construct_at_end(__il.begin(), __il.end(), __il.size());
+    }
+    __guard.__complete();
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+vector<_Tp, _Allocator>::vector(initializer_list<value_type> __il, const allocator_type& __a)
+    : __end_cap_(nullptr, __a)
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    std::__debug_db_insert_c(this);
+    if (__il.size() > 0)
+    {
+        __vallocate(__il.size());
+        __construct_at_end(__il.begin(), __il.end(), __il.size());
+    }
+    __guard.__complete();
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+vector<_Tp, _Allocator>&
+vector<_Tp, _Allocator>::operator=(vector&& __x)
+    _NOEXCEPT_((__noexcept_move_assign_container<_Allocator, __alloc_traits>::value))
+{
+    __move_assign(__x, integral_constant<bool,
+          __alloc_traits::propagate_on_container_move_assignment::value>());
+    return *this;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::__move_assign(vector& __c, false_type)
+    _NOEXCEPT_(__alloc_traits::is_always_equal::value)
+{
+    if (__alloc() != __c.__alloc())
+    {
+        typedef move_iterator<iterator> _Ip;
+        assign(_Ip(__c.begin()), _Ip(__c.end()));
+    }
+    else
+        __move_assign(__c, true_type());
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::__move_assign(vector& __c, true_type)
+    _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
+{
+    __vdeallocate();
+    __move_assign_alloc(__c); // this can throw
+    this->__begin_ = __c.__begin_;
+    this->__end_ = __c.__end_;
+    this->__end_cap() = __c.__end_cap();
+    __c.__begin_ = __c.__end_ = __c.__end_cap() = nullptr;
+    std::__debug_db_swap(this, std::addressof(__c));
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+vector<_Tp, _Allocator>&
+vector<_Tp, _Allocator>::operator=(const vector& __x)
+{
+    if (this != std::addressof(__x))
+    {
+        __copy_assign_alloc(__x);
+        assign(__x.__begin_, __x.__end_);
+    }
+    return *this;
+}
+
+template <class _Tp, class _Allocator>
+template <class _InputIterator, __enable_if_t<__is_exactly_cpp17_input_iterator<_InputIterator>::value &&
+                              is_constructible<_Tp, typename iterator_traits<_InputIterator>::reference>::value,
+                          int> >
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<_Tp, _Allocator>::assign(_InputIterator __first, _InputIterator __last)
+{
+    clear();
+    for (; __first != __last; ++__first)
+        emplace_back(*__first);
+}
+
+template <class _Tp, class _Allocator>
+template <class _ForwardIterator, __enable_if_t<__is_cpp17_forward_iterator<_ForwardIterator>::value &&
+                        is_constructible<_Tp, typename iterator_traits<_ForwardIterator>::reference>::value,
+                    int> >
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<_Tp, _Allocator>::assign(_ForwardIterator __first, _ForwardIterator __last)
+{
+    size_type __new_size = static_cast<size_type>(std::distance(__first, __last));
+    if (__new_size <= capacity())
+    {
+        _ForwardIterator __mid = __last;
+        bool __growing = false;
+        if (__new_size > size())
+        {
+            __growing = true;
+            __mid =  __first;
+            std::advance(__mid, size());
+        }
+        pointer __m = std::copy(__first, __mid, this->__begin_);
+        if (__growing)
+            __construct_at_end(__mid, __last, __new_size - size());
+        else
+            this->__destruct_at_end(__m);
+    }
+    else
+    {
+        __vdeallocate();
+        __vallocate(__recommend(__new_size));
+        __construct_at_end(__first, __last, __new_size);
+    }
+    std::__debug_db_invalidate_all(this);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::assign(size_type __n, const_reference __u)
+{
+    if (__n <= capacity())
+    {
+        size_type __s = size();
+        std::fill_n(this->__begin_, std::min(__n, __s), __u);
+        if (__n > __s)
+            __construct_at_end(__n - __s, __u);
+        else
+            this->__destruct_at_end(this->__begin_ + __n);
+    }
+    else
+    {
+        __vdeallocate();
+        __vallocate(__recommend(static_cast<size_type>(__n)));
+        __construct_at_end(__n, __u);
+    }
+    std::__debug_db_invalidate_all(this);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+typename vector<_Tp, _Allocator>::iterator
+vector<_Tp, _Allocator>::begin() _NOEXCEPT
+{
+    return __make_iter(this->__begin_);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+typename vector<_Tp, _Allocator>::const_iterator
+vector<_Tp, _Allocator>::begin() const _NOEXCEPT
+{
+    return __make_iter(this->__begin_);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+typename vector<_Tp, _Allocator>::iterator
+vector<_Tp, _Allocator>::end() _NOEXCEPT
+{
+    return __make_iter(this->__end_);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+typename vector<_Tp, _Allocator>::const_iterator
+vector<_Tp, _Allocator>::end() const _NOEXCEPT
+{
+    return __make_iter(this->__end_);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+typename vector<_Tp, _Allocator>::reference
+vector<_Tp, _Allocator>::operator[](size_type __n) _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__n < size(), "vector[] index out of bounds");
+    return this->__begin_[__n];
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+typename vector<_Tp, _Allocator>::const_reference
+vector<_Tp, _Allocator>::operator[](size_type __n) const _NOEXCEPT
+{
+    _LIBCPP_ASSERT(__n < size(), "vector[] index out of bounds");
+    return this->__begin_[__n];
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<_Tp, _Allocator>::reference
+vector<_Tp, _Allocator>::at(size_type __n)
+{
+    if (__n >= size())
+        this->__throw_out_of_range();
+    return this->__begin_[__n];
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<_Tp, _Allocator>::const_reference
+vector<_Tp, _Allocator>::at(size_type __n) const
+{
+    if (__n >= size())
+        this->__throw_out_of_range();
+    return this->__begin_[__n];
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::reserve(size_type __n)
+{
+    if (__n > capacity())
+    {
+        if (__n > max_size())
+            this->__throw_length_error();
+        allocator_type& __a = this->__alloc();
+        __split_buffer<value_type, allocator_type&> __v(__n, size(), __a);
+        __swap_out_circular_buffer(__v);
+    }
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::shrink_to_fit() _NOEXCEPT
+{
+    if (capacity() > size())
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            allocator_type& __a = this->__alloc();
+            __split_buffer<value_type, allocator_type&> __v(size(), size(), __a);
+            __swap_out_circular_buffer(__v);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+template <class _Tp, class _Allocator>
+template <class _Up>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::__push_back_slow_path(_Up&& __x)
+{
+    allocator_type& __a = this->__alloc();
+    __split_buffer<value_type, allocator_type&> __v(__recommend(size() + 1), size(), __a);
+    // __v.push_back(std::forward<_Up>(__x));
+    __alloc_traits::construct(__a, std::__to_address(__v.__end_), std::forward<_Up>(__x));
+    __v.__end_++;
+    __swap_out_circular_buffer(__v);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+void
+vector<_Tp, _Allocator>::push_back(const_reference __x)
+{
+    if (this->__end_ != this->__end_cap())
+    {
+        __construct_one_at_end(__x);
+    }
+    else
+        __push_back_slow_path(__x);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+void
+vector<_Tp, _Allocator>::push_back(value_type&& __x)
+{
+    if (this->__end_ < this->__end_cap())
+    {
+        __construct_one_at_end(std::move(__x));
+    }
+    else
+        __push_back_slow_path(std::move(__x));
+}
+
+template <class _Tp, class _Allocator>
+template <class... _Args>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::__emplace_back_slow_path(_Args&&... __args)
+{
+    allocator_type& __a = this->__alloc();
+    __split_buffer<value_type, allocator_type&> __v(__recommend(size() + 1), size(), __a);
+//    __v.emplace_back(std::forward<_Args>(__args)...);
+    __alloc_traits::construct(__a, std::__to_address(__v.__end_), std::forward<_Args>(__args)...);
+    __v.__end_++;
+    __swap_out_circular_buffer(__v);
+}
+
+template <class _Tp, class _Allocator>
+template <class... _Args>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline
+#if _LIBCPP_STD_VER > 14
+typename vector<_Tp, _Allocator>::reference
+#else
+void
+#endif
+vector<_Tp, _Allocator>::emplace_back(_Args&&... __args)
+{
+    if (this->__end_ < this->__end_cap())
+    {
+        __construct_one_at_end(std::forward<_Args>(__args)...);
+    }
+    else
+        __emplace_back_slow_path(std::forward<_Args>(__args)...);
+#if _LIBCPP_STD_VER > 14
+    return this->back();
+#endif
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline
+void
+vector<_Tp, _Allocator>::pop_back()
+{
+    _LIBCPP_ASSERT(!empty(), "vector::pop_back called on an empty vector");
+    this->__destruct_at_end(this->__end_ - 1);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+typename vector<_Tp, _Allocator>::iterator
+vector<_Tp, _Allocator>::erase(const_iterator __position)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(std::addressof(__position)) == this,
+                         "vector::erase(iterator) called with an iterator not referring to this vector");
+    _LIBCPP_ASSERT(__position != end(),
+        "vector::erase(iterator) called with a non-dereferenceable iterator");
+    difference_type __ps = __position - cbegin();
+    pointer __p = this->__begin_ + __ps;
+    this->__destruct_at_end(std::move(__p + 1, this->__end_, __p));
+    if (!__libcpp_is_constant_evaluated())
+        this->__invalidate_iterators_past(__p - 1);
+    return __make_iter(__p);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<_Tp, _Allocator>::iterator
+vector<_Tp, _Allocator>::erase(const_iterator __first, const_iterator __last)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(std::addressof(__first)) == this,
+                         "vector::erase(iterator, iterator) called with an iterator not referring to this vector");
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(std::addressof(__last)) == this,
+                         "vector::erase(iterator, iterator) called with an iterator not referring to this vector");
+
+    _LIBCPP_ASSERT(__first <= __last, "vector::erase(first, last) called with invalid range");
+    pointer __p = this->__begin_ + (__first - begin());
+    if (__first != __last) {
+        this->__destruct_at_end(std::move(__p + (__last - __first), this->__end_, __p));
+        if (!__libcpp_is_constant_evaluated())
+            this->__invalidate_iterators_past(__p - 1);
+    }
+    return __make_iter(__p);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::__move_range(pointer __from_s, pointer __from_e, pointer __to)
+{
+    pointer __old_last = this->__end_;
+    difference_type __n = __old_last - __to;
+    {
+      pointer __i = __from_s + __n;
+      _ConstructTransaction __tx(*this, __from_e - __i);
+      for (pointer __pos = __tx.__pos_; __i < __from_e;
+           ++__i, (void) ++__pos, __tx.__pos_ = __pos) {
+          __alloc_traits::construct(this->__alloc(),
+                                    std::__to_address(__pos),
+                                    std::move(*__i));
+      }
+    }
+    std::move_backward(__from_s, __from_s + __n, __old_last);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<_Tp, _Allocator>::iterator
+vector<_Tp, _Allocator>::insert(const_iterator __position, const_reference __x)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(std::addressof(__position)) == this,
+                         "vector::insert(iterator, x) called with an iterator not referring to this vector");
+    pointer __p = this->__begin_ + (__position - begin());
+    // We can't compare unrelated pointers inside constant expressions
+    if (!__libcpp_is_constant_evaluated() && this->__end_ < this->__end_cap())
+    {
+        if (__p == this->__end_)
+        {
+            __construct_one_at_end(__x);
+        }
+        else
+        {
+            __move_range(__p, this->__end_, __p + 1);
+            const_pointer __xr = pointer_traits<const_pointer>::pointer_to(__x);
+            if (__p <= __xr && __xr < this->__end_)
+                ++__xr;
+            *__p = *__xr;
+        }
+    }
+    else
+    {
+        allocator_type& __a = this->__alloc();
+        __split_buffer<value_type, allocator_type&> __v(__recommend(size() + 1), __p - this->__begin_, __a);
+        __v.push_back(__x);
+        __p = __swap_out_circular_buffer(__v, __p);
+    }
+    return __make_iter(__p);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<_Tp, _Allocator>::iterator
+vector<_Tp, _Allocator>::insert(const_iterator __position, value_type&& __x)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(std::addressof(__position)) == this,
+                         "vector::insert(iterator, x) called with an iterator not referring to this vector");
+    pointer __p = this->__begin_ + (__position - begin());
+    if (this->__end_ < this->__end_cap())
+    {
+        if (__p == this->__end_)
+        {
+            __construct_one_at_end(std::move(__x));
+        }
+        else
+        {
+            __move_range(__p, this->__end_, __p + 1);
+            *__p = std::move(__x);
+        }
+    }
+    else
+    {
+        allocator_type& __a = this->__alloc();
+        __split_buffer<value_type, allocator_type&> __v(__recommend(size() + 1), __p - this->__begin_, __a);
+        __v.push_back(std::move(__x));
+        __p = __swap_out_circular_buffer(__v, __p);
+    }
+    return __make_iter(__p);
+}
+
+template <class _Tp, class _Allocator>
+template <class... _Args>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<_Tp, _Allocator>::iterator
+vector<_Tp, _Allocator>::emplace(const_iterator __position, _Args&&... __args)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(std::addressof(__position)) == this,
+                         "vector::emplace(iterator, x) called with an iterator not referring to this vector");
+    pointer __p = this->__begin_ + (__position - begin());
+    if (this->__end_ < this->__end_cap())
+    {
+        if (__p == this->__end_)
+        {
+            __construct_one_at_end(std::forward<_Args>(__args)...);
+        }
+        else
+        {
+            __temp_value<value_type, _Allocator> __tmp(this->__alloc(), std::forward<_Args>(__args)...);
+            __move_range(__p, this->__end_, __p + 1);
+            *__p = std::move(__tmp.get());
+        }
+    }
+    else
+    {
+        allocator_type& __a = this->__alloc();
+        __split_buffer<value_type, allocator_type&> __v(__recommend(size() + 1), __p - this->__begin_, __a);
+        __v.emplace_back(std::forward<_Args>(__args)...);
+        __p = __swap_out_circular_buffer(__v, __p);
+    }
+    return __make_iter(__p);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<_Tp, _Allocator>::iterator
+vector<_Tp, _Allocator>::insert(const_iterator __position, size_type __n, const_reference __x)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(std::addressof(__position)) == this,
+                         "vector::insert(iterator, n, x) called with an iterator not referring to this vector");
+    pointer __p = this->__begin_ + (__position - begin());
+    if (__n > 0)
+    {
+        // We can't compare unrelated pointers inside constant expressions
+        if (!__libcpp_is_constant_evaluated() && __n <= static_cast<size_type>(this->__end_cap() - this->__end_))
+        {
+            size_type __old_n = __n;
+            pointer __old_last = this->__end_;
+            if (__n > static_cast<size_type>(this->__end_ - __p))
+            {
+                size_type __cx = __n - (this->__end_ - __p);
+                __construct_at_end(__cx, __x);
+                __n -= __cx;
+            }
+            if (__n > 0)
+            {
+                __move_range(__p, __old_last, __p + __old_n);
+                const_pointer __xr = pointer_traits<const_pointer>::pointer_to(__x);
+                if (__p <= __xr && __xr < this->__end_)
+                    __xr += __old_n;
+                std::fill_n(__p, __n, *__xr);
+            }
+        }
+        else
+        {
+            allocator_type& __a = this->__alloc();
+            __split_buffer<value_type, allocator_type&> __v(__recommend(size() + __n), __p - this->__begin_, __a);
+            __v.__construct_at_end(__n, __x);
+            __p = __swap_out_circular_buffer(__v, __p);
+        }
+    }
+    return __make_iter(__p);
+}
+
+template <class _Tp, class _Allocator>
+template <class _InputIterator, __enable_if_t<__is_exactly_cpp17_input_iterator<_InputIterator>::value &&
+                              is_constructible<_Tp, typename iterator_traits<_InputIterator>::reference>::value,
+                          int> >
+_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator
+vector<_Tp, _Allocator>::insert(const_iterator __position, _InputIterator __first, _InputIterator __last)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(std::addressof(__position)) == this,
+                         "vector::insert(iterator, range) called with an iterator not referring to this vector");
+    difference_type __off = __position - begin();
+    pointer __p = this->__begin_ + __off;
+    allocator_type& __a = this->__alloc();
+    pointer __old_last = this->__end_;
+    for (; this->__end_ != this->__end_cap() && __first != __last; ++__first)
+    {
+        __construct_one_at_end(*__first);
+    }
+    __split_buffer<value_type, allocator_type&> __v(__a);
+    if (__first != __last)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            __v.__construct_at_end(__first, __last);
+            difference_type __old_size = __old_last - this->__begin_;
+            difference_type __old_p = __p - this->__begin_;
+            reserve(__recommend(size() + __v.size()));
+            __p = this->__begin_ + __old_p;
+            __old_last = this->__begin_ + __old_size;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            erase(__make_iter(__old_last), end());
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+    __p = std::rotate(__p, __old_last, this->__end_);
+    insert(__make_iter(__p), std::make_move_iterator(__v.begin()),
+                             std::make_move_iterator(__v.end()));
+    return begin() + __off;
+}
+
+template <class _Tp, class _Allocator>
+template <class _ForwardIterator, __enable_if_t<__is_cpp17_forward_iterator<_ForwardIterator>::value &&
+                        is_constructible<_Tp, typename iterator_traits<_ForwardIterator>::reference>::value,
+                    int> >
+_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator
+vector<_Tp, _Allocator>::insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last)
+{
+    _LIBCPP_DEBUG_ASSERT(__get_const_db()->__find_c_from_i(std::addressof(__position)) == this,
+                         "vector::insert(iterator, range) called with an iterator not referring to this vector");
+    pointer __p = this->__begin_ + (__position - begin());
+    difference_type __n = std::distance(__first, __last);
+    if (__n > 0)
+    {
+        if (__n <= this->__end_cap() - this->__end_)
+        {
+            size_type __old_n = __n;
+            pointer __old_last = this->__end_;
+            _ForwardIterator __m = __last;
+            difference_type __dx = this->__end_ - __p;
+            if (__n > __dx)
+            {
+                __m = __first;
+                difference_type __diff = this->__end_ - __p;
+                std::advance(__m, __diff);
+                __construct_at_end(__m, __last, __n - __diff);
+                __n = __dx;
+            }
+            if (__n > 0)
+            {
+                __move_range(__p, __old_last, __p + __old_n);
+                std::copy(__first, __m, __p);
+            }
+        }
+        else
+        {
+            allocator_type& __a = this->__alloc();
+            __split_buffer<value_type, allocator_type&> __v(__recommend(size() + __n), __p - this->__begin_, __a);
+            __v.__construct_at_end(__first, __last);
+            __p = __swap_out_circular_buffer(__v, __p);
+        }
+    }
+    return __make_iter(__p);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::resize(size_type __sz)
+{
+    size_type __cs = size();
+    if (__cs < __sz)
+        this->__append(__sz - __cs);
+    else if (__cs > __sz)
+        this->__destruct_at_end(this->__begin_ + __sz);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::resize(size_type __sz, const_reference __x)
+{
+    size_type __cs = size();
+    if (__cs < __sz)
+        this->__append(__sz - __cs, __x);
+    else if (__cs > __sz)
+        this->__destruct_at_end(this->__begin_ + __sz);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<_Tp, _Allocator>::swap(vector& __x)
+#if _LIBCPP_STD_VER >= 14
+    _NOEXCEPT
+#else
+    _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
+                __is_nothrow_swappable<allocator_type>::value)
+#endif
+{
+    _LIBCPP_ASSERT(__alloc_traits::propagate_on_container_swap::value ||
+                   this->__alloc() == __x.__alloc(),
+                   "vector::swap: Either propagate_on_container_swap must be true"
+                   " or the allocators must compare equal");
+    std::swap(this->__begin_, __x.__begin_);
+    std::swap(this->__end_, __x.__end_);
+    std::swap(this->__end_cap(), __x.__end_cap());
+    std::__swap_allocator(this->__alloc(), __x.__alloc(),
+        integral_constant<bool,__alloc_traits::propagate_on_container_swap::value>());
+    std::__debug_db_swap(this, std::addressof(__x));
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+bool
+vector<_Tp, _Allocator>::__invariants() const
+{
+    if (this->__begin_ == nullptr)
+    {
+        if (this->__end_ != nullptr || this->__end_cap() != nullptr)
+            return false;
+    }
+    else
+    {
+        if (this->__begin_ > this->__end_)
+            return false;
+        if (this->__begin_ == this->__end_cap())
+            return false;
+        if (this->__end_ > this->__end_cap())
+            return false;
+    }
+    return true;
+}
+
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+
+template <class _Tp, class _Allocator>
+bool
+vector<_Tp, _Allocator>::__dereferenceable(const const_iterator* __i) const
+{
+    return this->__begin_ <= __i->base() && __i->base() < this->__end_;
+}
+
+template <class _Tp, class _Allocator>
+bool
+vector<_Tp, _Allocator>::__decrementable(const const_iterator* __i) const
+{
+    return this->__begin_ < __i->base() && __i->base() <= this->__end_;
+}
+
+template <class _Tp, class _Allocator>
+bool
+vector<_Tp, _Allocator>::__addable(const const_iterator* __i, ptrdiff_t __n) const
+{
+    const_pointer __p = __i->base() + __n;
+    return this->__begin_ <= __p && __p <= this->__end_;
+}
+
+template <class _Tp, class _Allocator>
+bool
+vector<_Tp, _Allocator>::__subscriptable(const const_iterator* __i, ptrdiff_t __n) const
+{
+    const_pointer __p = __i->base() + __n;
+    return this->__begin_ <= __p && __p < this->__end_;
+}
+
+#endif // _LIBCPP_ENABLE_DEBUG_MODE
+
+template <class _Tp, class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI
+void
+vector<_Tp, _Allocator>::__invalidate_iterators_past(pointer __new_last) {
+#ifdef _LIBCPP_ENABLE_DEBUG_MODE
+  __c_node* __c = __get_db()->__find_c_and_lock(this);
+  for (__i_node** __p = __c->end_; __p != __c->beg_; ) {
+    --__p;
+    const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
+    if (__i->base() > __new_last) {
+      (*__p)->__c_ = nullptr;
+      if (--__c->end_ != __p)
+        std::memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
+    }
+  }
+  __get_db()->unlock();
+#else
+  ((void)__new_last);
+#endif
+}
+
+// vector<bool>
+
+template <class _Allocator> class vector<bool, _Allocator>;
+
+template <class _Allocator> struct hash<vector<bool, _Allocator> >;
+
+template <class _Allocator>
+struct __has_storage_type<vector<bool, _Allocator> >
+{
+    static const bool value = true;
+};
+
+template <class _Allocator>
+class _LIBCPP_TEMPLATE_VIS vector<bool, _Allocator>
+{
+public:
+    typedef vector                                   __self;
+    typedef bool                                     value_type;
+    typedef _Allocator                               allocator_type;
+    typedef allocator_traits<allocator_type>         __alloc_traits;
+    typedef typename __alloc_traits::size_type       size_type;
+    typedef typename __alloc_traits::difference_type difference_type;
+    typedef size_type __storage_type;
+    typedef __bit_iterator<vector, false>            pointer;
+    typedef __bit_iterator<vector, true>             const_pointer;
+    typedef pointer                                  iterator;
+    typedef const_pointer                            const_iterator;
+    typedef std::reverse_iterator<iterator>         reverse_iterator;
+    typedef std::reverse_iterator<const_iterator>   const_reverse_iterator;
+
+private:
+    typedef __rebind_alloc<__alloc_traits, __storage_type> __storage_allocator;
+    typedef allocator_traits<__storage_allocator>    __storage_traits;
+    typedef typename __storage_traits::pointer       __storage_pointer;
+    typedef typename __storage_traits::const_pointer __const_storage_pointer;
+
+    __storage_pointer                                      __begin_;
+    size_type                                              __size_;
+    __compressed_pair<size_type, __storage_allocator> __cap_alloc_;
+public:
+    typedef __bit_reference<vector>                  reference;
+#ifdef _LIBCPP_ABI_BITSET_VECTOR_BOOL_CONST_SUBSCRIPT_RETURN_BOOL
+    using const_reference = bool;
+#else
+    typedef __bit_const_reference<vector>            const_reference;
+#endif
+private:
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type& __cap() _NOEXCEPT
+        {return __cap_alloc_.first();}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const size_type& __cap() const _NOEXCEPT
+        {return __cap_alloc_.first();}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    __storage_allocator& __alloc() _NOEXCEPT
+        {return __cap_alloc_.second();}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const __storage_allocator& __alloc() const _NOEXCEPT
+        {return __cap_alloc_.second();}
+
+    static const unsigned __bits_per_word = static_cast<unsigned>(sizeof(__storage_type) * CHAR_BIT);
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static size_type __internal_cap_to_external(size_type __n) _NOEXCEPT
+        {return __n * __bits_per_word;}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static size_type __external_cap_to_internal(size_type __n) _NOEXCEPT
+        {return (__n - 1) / __bits_per_word + 1;}
+
+public:
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    vector() _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value);
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit vector(const allocator_type& __a)
+#if _LIBCPP_STD_VER <= 14
+        _NOEXCEPT_(is_nothrow_copy_constructible<allocator_type>::value);
+#else
+        _NOEXCEPT;
+#endif
+
+private:
+  class __destroy_vector {
+    public:
+      _LIBCPP_CONSTEXPR __destroy_vector(vector& __vec) : __vec_(__vec) {}
+
+      _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void operator()() {
+        if (__vec_.__begin_ != nullptr)
+            __storage_traits::deallocate(__vec_.__alloc(), __vec_.__begin_, __vec_.__cap());
+        std::__debug_db_invalidate_all(this);
+      }
+
+    private:
+      vector& __vec_;
+  };
+
+public:
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 ~vector() { __destroy_vector(*this)(); }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit vector(size_type __n);
+#if _LIBCPP_STD_VER > 11
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit vector(size_type __n, const allocator_type& __a);
+#endif
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(size_type __n, const value_type& __v);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(size_type __n, const value_type& __v, const allocator_type& __a);
+    template <class _InputIterator>
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(_InputIterator __first, _InputIterator __last,
+               typename enable_if<__is_exactly_cpp17_input_iterator<_InputIterator>::value>::type* = 0);
+    template <class _InputIterator>
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a,
+               typename enable_if<__is_exactly_cpp17_input_iterator<_InputIterator>::value>::type* = 0);
+    template <class _ForwardIterator>
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(_ForwardIterator __first, _ForwardIterator __last,
+               typename enable_if<__is_cpp17_forward_iterator<_ForwardIterator>::value>::type* = 0);
+    template <class _ForwardIterator>
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a,
+               typename enable_if<__is_cpp17_forward_iterator<_ForwardIterator>::value>::type* = 0);
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(const vector& __v);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(const vector& __v, const allocator_type& __a);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector& operator=(const vector& __v);
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(initializer_list<value_type> __il);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(initializer_list<value_type> __il, const allocator_type& __a);
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    vector& operator=(initializer_list<value_type> __il)
+        {assign(__il.begin(), __il.end()); return *this;}
+
+#endif // !_LIBCPP_CXX03_LANG
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    vector(vector&& __v)
+#if _LIBCPP_STD_VER > 14
+        noexcept;
+#else
+        _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value);
+#endif
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(vector&& __v, const __type_identity_t<allocator_type>& __a);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    vector& operator=(vector&& __v)
+        _NOEXCEPT_((__noexcept_move_assign_container<_Allocator, __alloc_traits>::value));
+
+    template <class _InputIterator>
+        typename enable_if <__is_exactly_cpp17_input_iterator<_InputIterator>::value,
+           void
+        >::type
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 assign(_InputIterator __first, _InputIterator __last);
+    template <class _ForwardIterator>
+        typename enable_if
+        <
+            __is_cpp17_forward_iterator<_ForwardIterator>::value,
+           void
+        >::type
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 assign(_ForwardIterator __first, _ForwardIterator __last);
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void assign(size_type __n, const value_type& __x);
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void assign(initializer_list<value_type> __il)
+        {assign(__il.begin(), __il.end());}
+#endif
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 allocator_type get_allocator() const _NOEXCEPT
+        {return allocator_type(this->__alloc());}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type max_size() const _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type capacity() const _NOEXCEPT
+        {return __internal_cap_to_external(__cap());}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_type size() const _NOEXCEPT
+        {return __size_;}
+    _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    bool empty() const _NOEXCEPT
+        {return __size_ == 0;}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void reserve(size_type __n);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void shrink_to_fit() _NOEXCEPT;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    iterator begin() _NOEXCEPT
+        {return __make_iter(0);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_iterator begin() const _NOEXCEPT
+        {return __make_iter(0);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    iterator end() _NOEXCEPT
+        {return __make_iter(__size_);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_iterator end()   const _NOEXCEPT
+        {return __make_iter(__size_);}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    reverse_iterator rbegin() _NOEXCEPT
+        {return       reverse_iterator(end());}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_reverse_iterator rbegin() const _NOEXCEPT
+        {return const_reverse_iterator(end());}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    reverse_iterator rend() _NOEXCEPT
+        {return       reverse_iterator(begin());}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_reverse_iterator rend()   const _NOEXCEPT
+        {return const_reverse_iterator(begin());}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_iterator         cbegin()  const _NOEXCEPT
+        {return __make_iter(0);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_iterator         cend()    const _NOEXCEPT
+        {return __make_iter(__size_);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_reverse_iterator crbegin() const _NOEXCEPT
+        {return rbegin();}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_reverse_iterator crend()   const _NOEXCEPT
+        {return rend();}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference       operator[](size_type __n)       {return __make_ref(__n);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference operator[](size_type __n) const {return __make_ref(__n);}
+    _LIBCPP_HIDE_FROM_ABI reference       at(size_type __n);
+    _LIBCPP_HIDE_FROM_ABI const_reference at(size_type __n) const;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference       front()       {return __make_ref(0);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference front() const {return __make_ref(0);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference       back()        {return __make_ref(__size_ - 1);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference back()  const {return __make_ref(__size_ - 1);}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void push_back(const value_type& __x);
+#if _LIBCPP_STD_VER > 11
+    template <class... _Args>
+#if _LIBCPP_STD_VER > 14
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference emplace_back(_Args&&... __args)
+#else
+    _LIBCPP_HIDE_FROM_ABI void      emplace_back(_Args&&... __args)
+#endif
+    {
+        push_back ( value_type ( std::forward<_Args>(__args)... ));
+#if _LIBCPP_STD_VER > 14
+        return this->back();
+#endif
+    }
+#endif
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void pop_back() {--__size_;}
+
+#if _LIBCPP_STD_VER > 11
+    template <class... _Args>
+   _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator emplace(const_iterator __position, _Args&&... __args)
+        { return insert ( __position, value_type ( std::forward<_Args>(__args)... )); }
+#endif
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator insert(const_iterator __position, const value_type& __x);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator insert(const_iterator __position, size_type __n, const value_type& __x);
+    template <class _InputIterator>
+        typename enable_if <__is_exactly_cpp17_input_iterator<_InputIterator>::value,
+            iterator
+        >::type
+        _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 insert(const_iterator __position, _InputIterator __first, _InputIterator __last);
+    template <class _ForwardIterator>
+        typename enable_if
+        <
+            __is_cpp17_forward_iterator<_ForwardIterator>::value,
+            iterator
+        >::type
+        _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last);
+
+#ifndef _LIBCPP_CXX03_LANG
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    iterator insert(const_iterator __position, initializer_list<value_type> __il)
+        {return insert(__position, __il.begin(), __il.end());}
+#endif
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator erase(const_iterator __position);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator erase(const_iterator __first, const_iterator __last);
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void clear() _NOEXCEPT {__size_ = 0;}
+
+    _LIBCPP_CONSTEXPR_SINCE_CXX20 void swap(vector&)
+#if _LIBCPP_STD_VER >= 14
+        _NOEXCEPT;
+#else
+        _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
+                    __is_nothrow_swappable<allocator_type>::value);
+#endif
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 static void swap(reference __x, reference __y) _NOEXCEPT { std::swap(__x, __y); }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void resize(size_type __sz, value_type __x = false);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void flip() _NOEXCEPT;
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool __invariants() const;
+
+private:
+    _LIBCPP_NORETURN _LIBCPP_HIDE_FROM_ABI
+    void __throw_length_error() const {
+        std::__throw_length_error("vector");
+    }
+
+    _LIBCPP_NORETURN _LIBCPP_HIDE_FROM_ABI
+    void __throw_out_of_range() const {
+        std::__throw_out_of_range("vector");
+    }
+
+    //  Allocate space for __n objects
+    //  throws length_error if __n > max_size()
+    //  throws (probably bad_alloc) if memory run out
+    //  Precondition:  __begin_ == __end_ == __cap() == 0
+    //  Precondition:  __n > 0
+    //  Postcondition:  capacity() >= __n
+    //  Postcondition:  size() == 0
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __vallocate(size_type __n) {
+        if (__n > max_size())
+            __throw_length_error();
+        auto __allocation = std::__allocate_at_least(__alloc(), __external_cap_to_internal(__n));
+        __begin_ = __allocation.ptr;
+        __size_ = 0;
+        __cap() = __allocation.count;
+        if (__libcpp_is_constant_evaluated()) {
+            for (size_type __i = 0; __i != __cap(); ++__i)
+                std::__construct_at(std::__to_address(__begin_) + __i);
+        }
+    }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __vdeallocate() _NOEXCEPT;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    static size_type __align_it(size_type __new_size) _NOEXCEPT
+        {return (__new_size + (__bits_per_word-1)) & ~((size_type)__bits_per_word-1);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20  size_type __recommend(size_type __new_size) const;
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __construct_at_end(size_type __n, bool __x);
+    template <class _ForwardIterator>
+        typename enable_if
+        <
+            __is_cpp17_forward_iterator<_ForwardIterator>::value,
+            void
+        >::type
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 __construct_at_end(_ForwardIterator __first, _ForwardIterator __last);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __append(size_type __n, const_reference __x);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    reference __make_ref(size_type __pos) _NOEXCEPT
+        {return reference(__begin_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word);}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_reference __make_ref(size_type __pos) const _NOEXCEPT {
+        return __bit_const_reference<vector>(__begin_ + __pos / __bits_per_word,
+                                             __storage_type(1) << __pos % __bits_per_word);
+    }
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    iterator __make_iter(size_type __pos) _NOEXCEPT
+        {return iterator(__begin_ + __pos / __bits_per_word, static_cast<unsigned>(__pos % __bits_per_word));}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    const_iterator __make_iter(size_type __pos) const _NOEXCEPT
+        {return const_iterator(__begin_ + __pos / __bits_per_word, static_cast<unsigned>(__pos % __bits_per_word));}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    iterator __const_iterator_cast(const_iterator __p) _NOEXCEPT
+        {return begin() + (__p - cbegin());}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __copy_assign_alloc(const vector& __v)
+        {__copy_assign_alloc(__v, integral_constant<bool,
+                      __storage_traits::propagate_on_container_copy_assignment::value>());}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __copy_assign_alloc(const vector& __c, true_type)
+        {
+            if (__alloc() != __c.__alloc())
+                __vdeallocate();
+            __alloc() = __c.__alloc();
+        }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __copy_assign_alloc(const vector&, false_type)
+        {}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __move_assign(vector& __c, false_type);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __move_assign(vector& __c, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value);
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __move_assign_alloc(vector& __c)
+        _NOEXCEPT_(
+            !__storage_traits::propagate_on_container_move_assignment::value ||
+            is_nothrow_move_assignable<allocator_type>::value)
+        {__move_assign_alloc(__c, integral_constant<bool,
+                      __storage_traits::propagate_on_container_move_assignment::value>());}
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __move_assign_alloc(vector& __c, true_type)
+        _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
+        {
+            __alloc() = std::move(__c.__alloc());
+        }
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    void __move_assign_alloc(vector&, false_type)
+        _NOEXCEPT
+        {}
+
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_t __hash_code() const _NOEXCEPT;
+
+    friend class __bit_reference<vector>;
+    friend class __bit_const_reference<vector>;
+    friend class __bit_iterator<vector, false>;
+    friend class __bit_iterator<vector, true>;
+    friend struct __bit_array<vector>;
+    friend struct _LIBCPP_TEMPLATE_VIS hash<vector>;
+};
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<bool, _Allocator>::__vdeallocate() _NOEXCEPT
+{
+    if (this->__begin_ != nullptr)
+    {
+        __storage_traits::deallocate(this->__alloc(), this->__begin_, __cap());
+        std::__debug_db_invalidate_all(this);
+        this->__begin_ = nullptr;
+        this->__size_ = this->__cap() = 0;
+    }
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<bool, _Allocator>::size_type
+vector<bool, _Allocator>::max_size() const _NOEXCEPT
+{
+    size_type __amax = __storage_traits::max_size(__alloc());
+    size_type __nmax = numeric_limits<size_type>::max() / 2;  // end() >= begin(), always
+    if (__nmax / __bits_per_word <= __amax)
+        return __nmax;
+    return __internal_cap_to_external(__amax);
+}
+
+//  Precondition:  __new_size > capacity()
+template <class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<bool, _Allocator>::size_type
+vector<bool, _Allocator>::__recommend(size_type __new_size) const
+{
+    const size_type __ms = max_size();
+    if (__new_size > __ms)
+        this->__throw_length_error();
+    const size_type __cap = capacity();
+    if (__cap >= __ms / 2)
+        return __ms;
+    return std::max(2 * __cap, __align_it(__new_size));
+}
+
+//  Default constructs __n objects starting at __end_
+//  Precondition:  __n > 0
+//  Precondition:  size() + __n <= capacity()
+//  Postcondition:  size() == size() + __n
+template <class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+void
+vector<bool, _Allocator>::__construct_at_end(size_type __n, bool __x)
+{
+    size_type __old_size = this->__size_;
+    this->__size_ += __n;
+    if (__old_size == 0 || ((__old_size - 1) / __bits_per_word) != ((this->__size_ - 1) / __bits_per_word))
+    {
+        if (this->__size_ <= __bits_per_word)
+            this->__begin_[0] = __storage_type(0);
+        else
+            this->__begin_[(this->__size_ - 1) / __bits_per_word] = __storage_type(0);
+    }
+    std::fill_n(__make_iter(__old_size), __n, __x);
+}
+
+template <class _Allocator>
+template <class _ForwardIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename enable_if
+<
+    __is_cpp17_forward_iterator<_ForwardIterator>::value,
+    void
+>::type
+vector<bool, _Allocator>::__construct_at_end(_ForwardIterator __first, _ForwardIterator __last)
+{
+    size_type __old_size = this->__size_;
+    this->__size_ += std::distance(__first, __last);
+    if (__old_size == 0 || ((__old_size - 1) / __bits_per_word) != ((this->__size_ - 1) / __bits_per_word))
+    {
+        if (this->__size_ <= __bits_per_word)
+            this->__begin_[0] = __storage_type(0);
+        else
+            this->__begin_[(this->__size_ - 1) / __bits_per_word] = __storage_type(0);
+    }
+    std::copy(__first, __last, __make_iter(__old_size));
+}
+
+template <class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector()
+    _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, __default_init_tag())
+{
+}
+
+template <class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(const allocator_type& __a)
+#if _LIBCPP_STD_VER <= 14
+        _NOEXCEPT_(is_nothrow_copy_constructible<allocator_type>::value)
+#else
+        _NOEXCEPT
+#endif
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, static_cast<__storage_allocator>(__a))
+{
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(size_type __n)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, __default_init_tag())
+{
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__n, false);
+    }
+}
+
+#if _LIBCPP_STD_VER > 11
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(size_type __n, const allocator_type& __a)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, static_cast<__storage_allocator>(__a))
+{
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__n, false);
+    }
+}
+#endif
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(size_type __n, const value_type& __x)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, __default_init_tag())
+{
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__n, __x);
+    }
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(size_type __n, const value_type& __x, const allocator_type& __a)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, static_cast<__storage_allocator>(__a))
+{
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__n, __x);
+    }
+}
+
+template <class _Allocator>
+template <class _InputIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(_InputIterator __first, _InputIterator __last,
+       typename enable_if<__is_exactly_cpp17_input_iterator<_InputIterator>::value>::type*)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, __default_init_tag())
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        for (; __first != __last; ++__first)
+            push_back(*__first);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        if (__begin_ != nullptr)
+            __storage_traits::deallocate(__alloc(), __begin_, __cap());
+        std::__debug_db_invalidate_all(this);
+        throw;
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+}
+
+template <class _Allocator>
+template <class _InputIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a,
+       typename enable_if<__is_exactly_cpp17_input_iterator<_InputIterator>::value>::type*)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, static_cast<__storage_allocator>(__a))
+{
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    try
+    {
+#endif // _LIBCPP_NO_EXCEPTIONS
+        for (; __first != __last; ++__first)
+            push_back(*__first);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+    }
+    catch (...)
+    {
+        if (__begin_ != nullptr)
+            __storage_traits::deallocate(__alloc(), __begin_, __cap());
+        std::__debug_db_invalidate_all(this);
+        throw;
+    }
+#endif // _LIBCPP_NO_EXCEPTIONS
+}
+
+template <class _Allocator>
+template <class _ForwardIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(_ForwardIterator __first, _ForwardIterator __last,
+                                typename enable_if<__is_cpp17_forward_iterator<_ForwardIterator>::value>::type*)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, __default_init_tag())
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    size_type __n = static_cast<size_type>(std::distance(__first, __last));
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__first, __last);
+    }
+    __guard.__complete();
+}
+
+template <class _Allocator>
+template <class _ForwardIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a,
+                                typename enable_if<__is_cpp17_forward_iterator<_ForwardIterator>::value>::type*)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, static_cast<__storage_allocator>(__a))
+{
+    auto __guard = std::__make_exception_guard(__destroy_vector(*this));
+    size_type __n = static_cast<size_type>(std::distance(__first, __last));
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__first, __last);
+    }
+    __guard.__complete();
+}
+
+#ifndef _LIBCPP_CXX03_LANG
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(initializer_list<value_type> __il)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, __default_init_tag())
+{
+    size_type __n = static_cast<size_type>(__il.size());
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__il.begin(), __il.end());
+    }
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(initializer_list<value_type> __il, const allocator_type& __a)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, static_cast<__storage_allocator>(__a))
+{
+    size_type __n = static_cast<size_type>(__il.size());
+    if (__n > 0)
+    {
+        __vallocate(__n);
+        __construct_at_end(__il.begin(), __il.end());
+    }
+}
+
+#endif // _LIBCPP_CXX03_LANG
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(const vector& __v)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, __storage_traits::select_on_container_copy_construction(__v.__alloc()))
+{
+    if (__v.size() > 0)
+    {
+        __vallocate(__v.size());
+        __construct_at_end(__v.begin(), __v.end());
+    }
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(const vector& __v, const allocator_type& __a)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, __a)
+{
+    if (__v.size() > 0)
+    {
+        __vallocate(__v.size());
+        __construct_at_end(__v.begin(), __v.end());
+    }
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>&
+vector<bool, _Allocator>::operator=(const vector& __v)
+{
+    if (this != std::addressof(__v))
+    {
+        __copy_assign_alloc(__v);
+        if (__v.__size_)
+        {
+            if (__v.__size_ > capacity())
+            {
+                __vdeallocate();
+                __vallocate(__v.__size_);
+            }
+            std::copy(__v.__begin_, __v.__begin_ + __external_cap_to_internal(__v.__size_), __begin_);
+        }
+        __size_ = __v.__size_;
+    }
+    return *this;
+}
+
+template <class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector<bool, _Allocator>::vector(vector&& __v)
+#if _LIBCPP_STD_VER > 14
+    _NOEXCEPT
+#else
+    _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value)
+#endif
+    : __begin_(__v.__begin_),
+      __size_(__v.__size_),
+      __cap_alloc_(std::move(__v.__cap_alloc_)) {
+    __v.__begin_ = nullptr;
+    __v.__size_ = 0;
+    __v.__cap() = 0;
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>::vector(vector&& __v, const __type_identity_t<allocator_type>& __a)
+    : __begin_(nullptr),
+      __size_(0),
+      __cap_alloc_(0, __a)
+{
+    if (__a == allocator_type(__v.__alloc()))
+    {
+        this->__begin_ = __v.__begin_;
+        this->__size_ = __v.__size_;
+        this->__cap() = __v.__cap();
+        __v.__begin_ = nullptr;
+        __v.__cap() = __v.__size_ = 0;
+    }
+    else if (__v.size() > 0)
+    {
+        __vallocate(__v.size());
+        __construct_at_end(__v.begin(), __v.end());
+    }
+}
+
+template <class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+vector<bool, _Allocator>&
+vector<bool, _Allocator>::operator=(vector&& __v)
+    _NOEXCEPT_((__noexcept_move_assign_container<_Allocator, __alloc_traits>::value))
+{
+    __move_assign(__v, integral_constant<bool,
+          __storage_traits::propagate_on_container_move_assignment::value>());
+    return *this;
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<bool, _Allocator>::__move_assign(vector& __c, false_type)
+{
+    if (__alloc() != __c.__alloc())
+        assign(__c.begin(), __c.end());
+    else
+        __move_assign(__c, true_type());
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<bool, _Allocator>::__move_assign(vector& __c, true_type)
+    _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
+{
+    __vdeallocate();
+    __move_assign_alloc(__c);
+    this->__begin_ = __c.__begin_;
+    this->__size_ = __c.__size_;
+    this->__cap() = __c.__cap();
+    __c.__begin_ = nullptr;
+    __c.__cap() = __c.__size_ = 0;
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<bool, _Allocator>::assign(size_type __n, const value_type& __x)
+{
+    __size_ = 0;
+    if (__n > 0)
+    {
+        size_type __c = capacity();
+        if (__n <= __c)
+            __size_ = __n;
+        else
+        {
+            vector __v(get_allocator());
+            __v.reserve(__recommend(__n));
+            __v.__size_ = __n;
+            swap(__v);
+        }
+        std::fill_n(begin(), __n, __x);
+    }
+    std::__debug_db_invalidate_all(this);
+}
+
+template <class _Allocator>
+template <class _InputIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 typename enable_if <__is_exactly_cpp17_input_iterator<_InputIterator>::value,
+   void
+>::type
+vector<bool, _Allocator>::assign(_InputIterator __first, _InputIterator __last)
+{
+    clear();
+    for (; __first != __last; ++__first)
+        push_back(*__first);
+}
+
+template <class _Allocator>
+template <class _ForwardIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename enable_if
+<
+    __is_cpp17_forward_iterator<_ForwardIterator>::value,
+   void
+>::type
+vector<bool, _Allocator>::assign(_ForwardIterator __first, _ForwardIterator __last)
+{
+    clear();
+    difference_type __ns = std::distance(__first, __last);
+    _LIBCPP_ASSERT(__ns >= 0, "invalid range specified");
+    const size_t __n = static_cast<size_type>(__ns);
+    if (__n)
+    {
+        if (__n > capacity())
+        {
+            __vdeallocate();
+            __vallocate(__n);
+        }
+        __construct_at_end(__first, __last);
+    }
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<bool, _Allocator>::reserve(size_type __n)
+{
+    if (__n > capacity())
+    {
+        if (__n > max_size())
+            this->__throw_length_error();
+        vector __v(this->get_allocator());
+        __v.__vallocate(__n);
+        __v.__construct_at_end(this->begin(), this->end());
+        swap(__v);
+        std::__debug_db_invalidate_all(this);
+    }
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<bool, _Allocator>::shrink_to_fit() _NOEXCEPT
+{
+    if (__external_cap_to_internal(size()) > __cap())
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            vector(*this, allocator_type(__alloc())).swap(*this);
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+}
+
+template <class _Allocator>
+typename vector<bool, _Allocator>::reference
+vector<bool, _Allocator>::at(size_type __n)
+{
+    if (__n >= size())
+        this->__throw_out_of_range();
+    return (*this)[__n];
+}
+
+template <class _Allocator>
+typename vector<bool, _Allocator>::const_reference
+vector<bool, _Allocator>::at(size_type __n) const
+{
+    if (__n >= size())
+        this->__throw_out_of_range();
+    return (*this)[__n];
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<bool, _Allocator>::push_back(const value_type& __x)
+{
+    if (this->__size_ == this->capacity())
+        reserve(__recommend(this->__size_ + 1));
+    ++this->__size_;
+    back() = __x;
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<bool, _Allocator>::iterator
+vector<bool, _Allocator>::insert(const_iterator __position, const value_type& __x)
+{
+    iterator __r;
+    if (size() < capacity())
+    {
+        const_iterator __old_end = end();
+        ++__size_;
+        std::copy_backward(__position, __old_end, end());
+        __r = __const_iterator_cast(__position);
+    }
+    else
+    {
+        vector __v(get_allocator());
+        __v.reserve(__recommend(__size_ + 1));
+        __v.__size_ = __size_ + 1;
+        __r = std::copy(cbegin(), __position, __v.begin());
+        std::copy_backward(__position, cend(), __v.end());
+        swap(__v);
+    }
+    *__r = __x;
+    return __r;
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<bool, _Allocator>::iterator
+vector<bool, _Allocator>::insert(const_iterator __position, size_type __n, const value_type& __x)
+{
+    iterator __r;
+    size_type __c = capacity();
+    if (__n <= __c && size() <= __c - __n)
+    {
+        const_iterator __old_end = end();
+        __size_ += __n;
+        std::copy_backward(__position, __old_end, end());
+        __r = __const_iterator_cast(__position);
+    }
+    else
+    {
+        vector __v(get_allocator());
+        __v.reserve(__recommend(__size_ + __n));
+        __v.__size_ = __size_ + __n;
+        __r = std::copy(cbegin(), __position, __v.begin());
+        std::copy_backward(__position, cend(), __v.end());
+        swap(__v);
+    }
+    std::fill_n(__r, __n, __x);
+    return __r;
+}
+
+template <class _Allocator>
+template <class _InputIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 typename enable_if <__is_exactly_cpp17_input_iterator<_InputIterator>::value,
+    typename vector<bool, _Allocator>::iterator
+>::type
+vector<bool, _Allocator>::insert(const_iterator __position, _InputIterator __first, _InputIterator __last)
+{
+    difference_type __off = __position - begin();
+    iterator __p = __const_iterator_cast(__position);
+    iterator __old_end = end();
+    for (; size() != capacity() && __first != __last; ++__first)
+    {
+        ++this->__size_;
+        back() = *__first;
+    }
+    vector __v(get_allocator());
+    if (__first != __last)
+    {
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        try
+        {
+#endif // _LIBCPP_NO_EXCEPTIONS
+            __v.assign(__first, __last);
+            difference_type __old_size = static_cast<difference_type>(__old_end - begin());
+            difference_type __old_p = __p - begin();
+            reserve(__recommend(size() + __v.size()));
+            __p = begin() + __old_p;
+            __old_end = begin() + __old_size;
+#ifndef _LIBCPP_NO_EXCEPTIONS
+        }
+        catch (...)
+        {
+            erase(__old_end, end());
+            throw;
+        }
+#endif // _LIBCPP_NO_EXCEPTIONS
+    }
+    __p = std::rotate(__p, __old_end, end());
+    insert(__p, __v.begin(), __v.end());
+    return begin() + __off;
+}
+
+template <class _Allocator>
+template <class _ForwardIterator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename enable_if
+<
+    __is_cpp17_forward_iterator<_ForwardIterator>::value,
+    typename vector<bool, _Allocator>::iterator
+>::type
+vector<bool, _Allocator>::insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last)
+{
+    const difference_type __n_signed = std::distance(__first, __last);
+    _LIBCPP_ASSERT(__n_signed >= 0, "invalid range specified");
+    const size_type __n = static_cast<size_type>(__n_signed);
+    iterator __r;
+    size_type __c = capacity();
+    if (__n <= __c && size() <= __c - __n)
+    {
+        const_iterator __old_end = end();
+        __size_ += __n;
+        std::copy_backward(__position, __old_end, end());
+        __r = __const_iterator_cast(__position);
+    }
+    else
+    {
+        vector __v(get_allocator());
+        __v.reserve(__recommend(__size_ + __n));
+        __v.__size_ = __size_ + __n;
+        __r = std::copy(cbegin(), __position, __v.begin());
+        std::copy_backward(__position, cend(), __v.end());
+        swap(__v);
+    }
+    std::copy(__first, __last, __r);
+    return __r;
+}
+
+template <class _Allocator>
+inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<bool, _Allocator>::iterator
+vector<bool, _Allocator>::erase(const_iterator __position)
+{
+    iterator __r = __const_iterator_cast(__position);
+    std::copy(__position + 1, this->cend(), __r);
+    --__size_;
+    return __r;
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+typename vector<bool, _Allocator>::iterator
+vector<bool, _Allocator>::erase(const_iterator __first, const_iterator __last)
+{
+    iterator __r = __const_iterator_cast(__first);
+    difference_type __d = __last - __first;
+    std::copy(__last, this->cend(), __r);
+    __size_ -= __d;
+    return __r;
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<bool, _Allocator>::swap(vector& __x)
+#if _LIBCPP_STD_VER >= 14
+    _NOEXCEPT
+#else
+    _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
+                __is_nothrow_swappable<allocator_type>::value)
+#endif
+{
+    std::swap(this->__begin_, __x.__begin_);
+    std::swap(this->__size_, __x.__size_);
+    std::swap(this->__cap(), __x.__cap());
+    std::__swap_allocator(this->__alloc(), __x.__alloc(),
+        integral_constant<bool, __alloc_traits::propagate_on_container_swap::value>());
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<bool, _Allocator>::resize(size_type __sz, value_type __x)
+{
+    size_type __cs = size();
+    if (__cs < __sz)
+    {
+        iterator __r;
+        size_type __c = capacity();
+        size_type __n = __sz - __cs;
+        if (__n <= __c && __cs <= __c - __n)
+        {
+            __r = end();
+            __size_ += __n;
+        }
+        else
+        {
+            vector __v(get_allocator());
+            __v.reserve(__recommend(__size_ + __n));
+            __v.__size_ = __size_ + __n;
+            __r = std::copy(cbegin(), cend(), __v.begin());
+            swap(__v);
+        }
+        std::fill_n(__r, __n, __x);
+    }
+    else
+        __size_ = __sz;
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 void
+vector<bool, _Allocator>::flip() _NOEXCEPT
+{
+    // do middle whole words
+    size_type __n = __size_;
+    __storage_pointer __p = __begin_;
+    for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word)
+        *__p = ~*__p;
+    // do last partial word
+    if (__n > 0)
+    {
+        __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+        __storage_type __b = *__p & __m;
+        *__p &= ~__m;
+        *__p |= ~__b & __m;
+    }
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 bool
+vector<bool, _Allocator>::__invariants() const
+{
+    if (this->__begin_ == nullptr)
+    {
+        if (this->__size_ != 0 || this->__cap() != 0)
+            return false;
+    }
+    else
+    {
+        if (this->__cap() == 0)
+            return false;
+        if (this->__size_ > this->capacity())
+            return false;
+    }
+    return true;
+}
+
+template <class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20 size_t
+vector<bool, _Allocator>::__hash_code() const _NOEXCEPT
+{
+    size_t __h = 0;
+    // do middle whole words
+    size_type __n = __size_;
+    __storage_pointer __p = __begin_;
+    for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word)
+        __h ^= *__p;
+    // do last partial word
+    if (__n > 0)
+    {
+        const __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
+        __h ^= *__p & __m;
+    }
+    return __h;
+}
+
+template <class _Allocator>
+struct _LIBCPP_TEMPLATE_VIS hash<vector<bool, _Allocator> >
+    : public __unary_function<vector<bool, _Allocator>, size_t>
+{
+    _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
+    size_t operator()(const vector<bool, _Allocator>& __vec) const _NOEXCEPT
+        {return __vec.__hash_code();}
+};
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator==(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y)
+{
+    const typename vector<_Tp, _Allocator>::size_type __sz = __x.size();
+    return __sz == __y.size() && std::equal(__x.begin(), __x.end(), __y.begin());
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator!=(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y)
+{
+    return !(__x == __y);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator< (const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y)
+{
+    return std::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator> (const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y)
+{
+    return __y < __x;
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator>=(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y)
+{
+    return !(__x < __y);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+bool
+operator<=(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y)
+{
+    return !(__y < __x);
+}
+
+template <class _Tp, class _Allocator>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI
+void
+swap(vector<_Tp, _Allocator>& __x, vector<_Tp, _Allocator>& __y)
+    _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
+{
+    __x.swap(__y);
+}
+
+#if _LIBCPP_STD_VER > 17
+template <class _Tp, class _Allocator, class _Up>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::size_type
+erase(vector<_Tp, _Allocator>& __c, const _Up& __v) {
+  auto __old_size = __c.size();
+  __c.erase(std::remove(__c.begin(), __c.end(), __v), __c.end());
+  return __old_size - __c.size();
+}
+
+template <class _Tp, class _Allocator, class _Predicate>
+_LIBCPP_CONSTEXPR_SINCE_CXX20
+inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::size_type
+erase_if(vector<_Tp, _Allocator>& __c, _Predicate __pred) {
+  auto __old_size = __c.size();
+  __c.erase(std::remove_if(__c.begin(), __c.end(), __pred), __c.end());
+  return __old_size - __c.size();
+}
+
+template <>
+inline constexpr bool __format::__enable_insertable<vector<char>> = true;
+#ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
+template <>
+inline constexpr bool __format::__enable_insertable<vector<wchar_t>> = true;
+#endif
+
+#endif // _LIBCPP_STD_VER > 17
+
+#if _LIBCPP_STD_VER > 20
+template <class _Tp, class CharT>
+// Since is-vector-bool-reference is only used once it's inlined here.
+  requires same_as<typename _Tp::__container, vector<bool, typename _Tp::__container::allocator_type>>
+struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<_Tp, CharT> {
+private:
+  formatter<bool, CharT> __underlying_;
+
+public:
+  template <class _ParseContext>
+  _LIBCPP_HIDE_FROM_ABI constexpr typename _ParseContext::iterator parse(_ParseContext& __ctx) {
+        return __underlying_.parse(__ctx);
+  }
+
+  template <class _FormatContext>
+  _LIBCPP_HIDE_FROM_ABI typename _FormatContext::iterator format(const _Tp& __ref, _FormatContext& __ctx) const {
+        return __underlying_.format(__ref, __ctx);
+  }
+};
+#endif // _LIBCPP_STD_VER > 20
+
+_LIBCPP_END_NAMESPACE_STD
+
+#if _LIBCPP_STD_VER > 14
+_LIBCPP_BEGIN_NAMESPACE_STD
+namespace pmr {
+template <class _ValueT>
+using vector = std::vector<_ValueT, polymorphic_allocator<_ValueT>>;
+} // namespace pmr
+_LIBCPP_END_NAMESPACE_STD
+#endif
+
+_LIBCPP_POP_MACROS
+
+#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
+#  include <algorithm>
+#  include <atomic>
+#  include <concepts>
+#  include <typeinfo>
+#  include <utility>
+#endif
+
+#endif // _LIBCPP_VECTOR
diff --git a/app/src/main/cpp/libcxx/include/version b/app/src/main/cpp/libcxx/include/version
new file mode 100644
index 0000000..9705229
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/version
@@ -0,0 +1,424 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_VERSIONH
+#define _LIBCPP_VERSIONH
+
+/*
+  version synopsis
+
+Macro name                                              Value   Headers
+__cpp_lib_adaptor_iterator_pair_constructor             202106L <queue> <stack>
+__cpp_lib_addressof_constexpr                           201603L <memory>
+__cpp_lib_allocate_at_least                             202106L <memory>
+__cpp_lib_allocator_traits_is_always_equal              201411L <deque> <forward_list> <list>
+                                                                <map> <memory> <scoped_allocator>
+                                                                <set> <string> <unordered_map>
+                                                                <unordered_set> <vector>
+__cpp_lib_any                                           201606L <any>
+__cpp_lib_apply                                         201603L <tuple>
+__cpp_lib_array_constexpr                               201811L <array> <iterator>
+                                                        201603L // C++17
+__cpp_lib_as_const                                      201510L <utility>
+__cpp_lib_associative_heterogeneous_erasure             202110L <map> <set> <unordered_map>
+                                                                <unordered_set>
+__cpp_lib_assume_aligned                                201811L <memory>
+__cpp_lib_atomic_flag_test                              201907L <atomic>
+__cpp_lib_atomic_float                                  201711L <atomic>
+__cpp_lib_atomic_is_always_lock_free                    201603L <atomic>
+__cpp_lib_atomic_lock_free_type_aliases                 201907L <atomic>
+__cpp_lib_atomic_ref                                    201806L <atomic>
+__cpp_lib_atomic_shared_ptr                             201711L <atomic>
+__cpp_lib_atomic_value_initialization                   201911L <atomic> <memory>
+__cpp_lib_atomic_wait                                   201907L <atomic>
+__cpp_lib_barrier                                       201907L <barrier>
+__cpp_lib_bind_back                                     202202L <functional>
+__cpp_lib_bind_front                                    201907L <functional>
+__cpp_lib_bit_cast                                      201806L <bit>
+__cpp_lib_bitops                                        201907L <bit>
+__cpp_lib_bool_constant                                 201505L <type_traits>
+__cpp_lib_bounded_array_traits                          201902L <type_traits>
+__cpp_lib_boyer_moore_searcher                          201603L <functional>
+__cpp_lib_byte                                          201603L <cstddef>
+__cpp_lib_byteswap                                      202110L <bit>
+__cpp_lib_char8_t                                       201907L <atomic> <filesystem> <istream>
+                                                                <limits> <locale> <ostream>
+                                                                <string> <string_view>
+__cpp_lib_chrono                                        201611L <chrono>
+__cpp_lib_chrono_udls                                   201304L <chrono>
+__cpp_lib_clamp                                         201603L <algorithm>
+__cpp_lib_complex_udls                                  201309L <complex>
+__cpp_lib_concepts                                      202002L <concepts>
+__cpp_lib_constexpr_algorithms                          201806L <algorithm> <utility>
+__cpp_lib_constexpr_bitset                              202207L <bitset>
+__cpp_lib_constexpr_charconv                            202207L <charconv>
+__cpp_lib_constexpr_cmath                               202202L <cmath> <cstdlib>
+__cpp_lib_constexpr_complex                             201711L <complex>
+__cpp_lib_constexpr_dynamic_alloc                       201907L <memory>
+__cpp_lib_constexpr_functional                          201907L <functional>
+__cpp_lib_constexpr_iterator                            201811L <iterator>
+__cpp_lib_constexpr_memory                              202202L <memory>
+                                                        201811L // C++20
+__cpp_lib_constexpr_numeric                             201911L <numeric>
+__cpp_lib_constexpr_string                              201907L <string>
+__cpp_lib_constexpr_string_view                         201811L <string_view>
+__cpp_lib_constexpr_tuple                               201811L <tuple>
+__cpp_lib_constexpr_typeinfo                            202106L <typeinfo>
+__cpp_lib_constexpr_utility                             201811L <utility>
+__cpp_lib_constexpr_vector                              201907L <vector>
+__cpp_lib_coroutine                                     201902L <coroutine>
+__cpp_lib_destroying_delete                             201806L <new>
+__cpp_lib_enable_shared_from_this                       201603L <memory>
+__cpp_lib_endian                                        201907L <bit>
+__cpp_lib_erase_if                                      202002L <deque> <forward_list> <list>
+                                                                <map> <set> <string>
+                                                                <unordered_map> <unordered_set> <vector>
+__cpp_lib_exchange_function                             201304L <utility>
+__cpp_lib_execution                                     201902L <execution>
+                                                        201603L // C++17
+__cpp_lib_expected                                      202202L <expected>
+__cpp_lib_filesystem                                    201703L <filesystem>
+__cpp_lib_format                                        202106L <format>
+__cpp_lib_forward_like                                  202207L <utility>
+__cpp_lib_gcd_lcm                                       201606L <numeric>
+__cpp_lib_generic_associative_lookup                    201304L <map> <set>
+__cpp_lib_generic_unordered_lookup                      201811L <unordered_map> <unordered_set>
+__cpp_lib_hardware_interference_size                    201703L <new>
+__cpp_lib_has_unique_object_representations             201606L <type_traits>
+__cpp_lib_hypot                                         201603L <cmath>
+__cpp_lib_incomplete_container_elements                 201505L <forward_list> <list> <vector>
+__cpp_lib_int_pow2                                      202002L <bit>
+__cpp_lib_integer_comparison_functions                  202002L <utility>
+__cpp_lib_integer_sequence                              201304L <utility>
+__cpp_lib_integral_constant_callable                    201304L <type_traits>
+__cpp_lib_interpolate                                   201902L <cmath> <numeric>
+__cpp_lib_invoke                                        201411L <functional>
+__cpp_lib_invoke_r                                      202106L <functional>
+__cpp_lib_is_aggregate                                  201703L <type_traits>
+__cpp_lib_is_constant_evaluated                         201811L <type_traits>
+__cpp_lib_is_final                                      201402L <type_traits>
+__cpp_lib_is_invocable                                  201703L <type_traits>
+__cpp_lib_is_layout_compatible                          201907L <type_traits>
+__cpp_lib_is_nothrow_convertible                        201806L <type_traits>
+__cpp_lib_is_null_pointer                               201309L <type_traits>
+__cpp_lib_is_pointer_interconvertible                   201907L <type_traits>
+__cpp_lib_is_scoped_enum                                202011L <type_traits>
+__cpp_lib_is_swappable                                  201603L <type_traits>
+__cpp_lib_jthread                                       201911L <stop_token> <thread>
+__cpp_lib_latch                                         201907L <latch>
+__cpp_lib_launder                                       201606L <new>
+__cpp_lib_list_remove_return_type                       201806L <forward_list> <list>
+__cpp_lib_logical_traits                                201510L <type_traits>
+__cpp_lib_make_from_tuple                               201606L <tuple>
+__cpp_lib_make_reverse_iterator                         201402L <iterator>
+__cpp_lib_make_unique                                   201304L <memory>
+__cpp_lib_map_try_emplace                               201411L <map>
+__cpp_lib_math_constants                                201907L <numbers>
+__cpp_lib_math_special_functions                        201603L <cmath>
+__cpp_lib_memory_resource                               201603L <memory_resource>
+__cpp_lib_move_only_function                            202110L <functional>
+__cpp_lib_node_extract                                  201606L <map> <set> <unordered_map>
+                                                                <unordered_set>
+__cpp_lib_nonmember_container_access                    201411L <array> <deque> <forward_list>
+                                                                <iterator> <list> <map>
+                                                                <regex> <set> <string>
+                                                                <unordered_map> <unordered_set> <vector>
+__cpp_lib_not_fn                                        201603L <functional>
+__cpp_lib_null_iterators                                201304L <iterator>
+__cpp_lib_optional                                      202110L <optional>
+                                                        201606L // C++17
+__cpp_lib_out_ptr                                       202106L <memory>
+__cpp_lib_parallel_algorithm                            201603L <algorithm> <numeric>
+__cpp_lib_polymorphic_allocator                         201902L <memory_resource>
+__cpp_lib_quoted_string_io                              201304L <iomanip>
+__cpp_lib_ranges                                        202106L <algorithm> <functional> <iterator>
+                                                                <memory> <ranges>
+__cpp_lib_ranges_chunk                                  202202L <ranges>
+__cpp_lib_ranges_chunk_by                               202202L <ranges>
+__cpp_lib_ranges_iota                                   202202L <numeric>
+__cpp_lib_ranges_join_with                              202202L <ranges>
+__cpp_lib_ranges_slide                                  202202L <ranges>
+__cpp_lib_ranges_starts_ends_with                       202106L <algorithm>
+__cpp_lib_ranges_to_container                           202202L <deque> <forward_list> <list>
+                                                                <map> <priority_queue> <queue>
+                                                                <set> <stack> <string>
+                                                                <unordered_map> <unordered_set> <vector>
+__cpp_lib_ranges_zip                                    202110L <ranges> <tuple> <utility>
+__cpp_lib_raw_memory_algorithms                         201606L <memory>
+__cpp_lib_reference_from_temporary                      202202L <type_traits>
+__cpp_lib_remove_cvref                                  201711L <type_traits>
+__cpp_lib_result_of_sfinae                              201210L <functional> <type_traits>
+__cpp_lib_robust_nonmodifying_seq_ops                   201304L <algorithm>
+__cpp_lib_sample                                        201603L <algorithm>
+__cpp_lib_scoped_lock                                   201703L <mutex>
+__cpp_lib_semaphore                                     201907L <semaphore>
+__cpp_lib_shared_mutex                                  201505L <shared_mutex>
+__cpp_lib_shared_ptr_arrays                             201707L <memory>
+                                                        201611L // C++17
+__cpp_lib_shared_ptr_weak_type                          201606L <memory>
+__cpp_lib_shared_timed_mutex                            201402L <shared_mutex>
+__cpp_lib_shift                                         201806L <algorithm>
+__cpp_lib_smart_ptr_for_overwrite                       202002L <memory>
+__cpp_lib_source_location                               201907L <source_location>
+__cpp_lib_span                                          202002L <span>
+__cpp_lib_spanstream                                    202106L <spanstream>
+__cpp_lib_ssize                                         201902L <iterator>
+__cpp_lib_stacktrace                                    202011L <stacktrace>
+__cpp_lib_starts_ends_with                              201711L <string> <string_view>
+__cpp_lib_stdatomic_h                                   202011L <stdatomic.h>
+__cpp_lib_string_contains                               202011L <string> <string_view>
+__cpp_lib_string_resize_and_overwrite                   202110L <string>
+__cpp_lib_string_udls                                   201304L <string>
+__cpp_lib_string_view                                   201803L <string> <string_view>
+                                                        201606L // C++17
+__cpp_lib_syncbuf                                       201803L <syncstream>
+__cpp_lib_three_way_comparison                          201907L <compare>
+__cpp_lib_to_address                                    201711L <memory>
+__cpp_lib_to_array                                      201907L <array>
+__cpp_lib_to_chars                                      201611L <charconv>
+__cpp_lib_to_underlying                                 202102L <utility>
+__cpp_lib_transformation_trait_aliases                  201304L <type_traits>
+__cpp_lib_transparent_operators                         201510L <functional> <memory>
+                                                        201210L // C++14
+__cpp_lib_tuple_element_t                               201402L <tuple>
+__cpp_lib_tuples_by_type                                201304L <tuple> <utility>
+__cpp_lib_type_identity                                 201806L <type_traits>
+__cpp_lib_type_trait_variable_templates                 201510L <type_traits>
+__cpp_lib_uncaught_exceptions                           201411L <exception>
+__cpp_lib_unordered_map_try_emplace                     201411L <unordered_map>
+__cpp_lib_unreachable                                   202202L <utility>
+__cpp_lib_unwrap_ref                                    201811L <functional>
+__cpp_lib_variant                                       202102L <variant>
+__cpp_lib_void_t                                        201411L <type_traits>
+
+*/
+
+#include <__assert> // all public C++ headers provide the assertion handler
+#include <__config>
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+// clang-format off
+
+#if _LIBCPP_STD_VER > 11
+# define __cpp_lib_chrono_udls                          201304L
+# define __cpp_lib_complex_udls                         201309L
+# define __cpp_lib_exchange_function                    201304L
+# define __cpp_lib_generic_associative_lookup           201304L
+# define __cpp_lib_integer_sequence                     201304L
+# define __cpp_lib_integral_constant_callable           201304L
+# define __cpp_lib_is_final                             201402L
+# define __cpp_lib_is_null_pointer                      201309L
+# define __cpp_lib_make_reverse_iterator                201402L
+# define __cpp_lib_make_unique                          201304L
+# define __cpp_lib_null_iterators                       201304L
+# define __cpp_lib_quoted_string_io                     201304L
+# define __cpp_lib_result_of_sfinae                     201210L
+# define __cpp_lib_robust_nonmodifying_seq_ops          201304L
+# if !defined(_LIBCPP_HAS_NO_THREADS) && !defined(_LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_shared_timed_mutex)
+#   define __cpp_lib_shared_timed_mutex                 201402L
+# endif
+# define __cpp_lib_string_udls                          201304L
+# define __cpp_lib_transformation_trait_aliases         201304L
+# define __cpp_lib_transparent_operators                201210L
+# define __cpp_lib_tuple_element_t                      201402L
+# define __cpp_lib_tuples_by_type                       201304L
+#endif
+
+#if _LIBCPP_STD_VER > 14
+# define __cpp_lib_addressof_constexpr                  201603L
+# define __cpp_lib_allocator_traits_is_always_equal     201411L
+# define __cpp_lib_any                                  201606L
+# define __cpp_lib_apply                                201603L
+# define __cpp_lib_array_constexpr                      201603L
+# define __cpp_lib_as_const                             201510L
+# define __cpp_lib_atomic_is_always_lock_free           201603L
+# define __cpp_lib_bool_constant                        201505L
+# define __cpp_lib_boyer_moore_searcher                 201603L
+# define __cpp_lib_byte                                 201603L
+# define __cpp_lib_chrono                               201611L
+# define __cpp_lib_clamp                                201603L
+# define __cpp_lib_enable_shared_from_this              201603L
+// # define __cpp_lib_execution                            201603L
+# if !defined(_LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_filesystem)
+#   define __cpp_lib_filesystem                         201703L
+# endif
+# define __cpp_lib_gcd_lcm                              201606L
+# if defined(__GCC_DESTRUCTIVE_SIZE) && defined(__GCC_CONSTRUCTIVE_SIZE)
+#   define __cpp_lib_hardware_interference_size         201703L
+# endif
+# define __cpp_lib_has_unique_object_representations    201606L
+# define __cpp_lib_hypot                                201603L
+# define __cpp_lib_incomplete_container_elements        201505L
+# define __cpp_lib_invoke                               201411L
+# define __cpp_lib_is_aggregate                         201703L
+# define __cpp_lib_is_invocable                         201703L
+# define __cpp_lib_is_swappable                         201603L
+# define __cpp_lib_launder                              201606L
+# define __cpp_lib_logical_traits                       201510L
+# define __cpp_lib_make_from_tuple                      201606L
+# define __cpp_lib_map_try_emplace                      201411L
+// # define __cpp_lib_math_special_functions               201603L
+# define __cpp_lib_memory_resource                      201603L
+# define __cpp_lib_node_extract                         201606L
+# define __cpp_lib_nonmember_container_access           201411L
+# define __cpp_lib_not_fn                               201603L
+# define __cpp_lib_optional                             201606L
+// # define __cpp_lib_parallel_algorithm                   201603L
+# define __cpp_lib_raw_memory_algorithms                201606L
+# define __cpp_lib_sample                               201603L
+# define __cpp_lib_scoped_lock                          201703L
+# if !defined(_LIBCPP_HAS_NO_THREADS) && !defined(_LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_shared_mutex)
+#   define __cpp_lib_shared_mutex                       201505L
+# endif
+# define __cpp_lib_shared_ptr_arrays                    201611L
+# define __cpp_lib_shared_ptr_weak_type                 201606L
+# define __cpp_lib_string_view                          201606L
+// # define __cpp_lib_to_chars                             201611L
+# undef  __cpp_lib_transparent_operators
+# define __cpp_lib_transparent_operators                201510L
+# define __cpp_lib_type_trait_variable_templates        201510L
+# define __cpp_lib_uncaught_exceptions                  201411L
+# define __cpp_lib_unordered_map_try_emplace            201411L
+# define __cpp_lib_variant                              202102L
+# define __cpp_lib_void_t                               201411L
+#endif
+
+#if _LIBCPP_STD_VER > 17
+# undef  __cpp_lib_array_constexpr
+# define __cpp_lib_array_constexpr                      201811L
+# define __cpp_lib_assume_aligned                       201811L
+# define __cpp_lib_atomic_flag_test                     201907L
+// # define __cpp_lib_atomic_float                         201711L
+# define __cpp_lib_atomic_lock_free_type_aliases        201907L
+// # define __cpp_lib_atomic_ref                           201806L
+// # define __cpp_lib_atomic_shared_ptr                    201711L
+# define __cpp_lib_atomic_value_initialization          201911L
+# if !defined(_LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_atomic_wait)
+#   define __cpp_lib_atomic_wait                        201907L
+# endif
+# if !defined(_LIBCPP_HAS_NO_THREADS) && !defined(_LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_barrier)
+#   define __cpp_lib_barrier                            201907L
+# endif
+# define __cpp_lib_bind_front                           201907L
+# define __cpp_lib_bit_cast                             201806L
+// # define __cpp_lib_bitops                               201907L
+# define __cpp_lib_bounded_array_traits                 201902L
+# if !defined(_LIBCPP_HAS_NO_CHAR8_T)
+#   define __cpp_lib_char8_t                            201907L
+# endif
+# define __cpp_lib_concepts                             202002L
+# define __cpp_lib_constexpr_algorithms                 201806L
+# define __cpp_lib_constexpr_complex                    201711L
+# define __cpp_lib_constexpr_dynamic_alloc              201907L
+# define __cpp_lib_constexpr_functional                 201907L
+# define __cpp_lib_constexpr_iterator                   201811L
+# define __cpp_lib_constexpr_memory                     201811L
+# define __cpp_lib_constexpr_numeric                    201911L
+# define __cpp_lib_constexpr_string                     201907L
+# define __cpp_lib_constexpr_string_view                201811L
+# define __cpp_lib_constexpr_tuple                      201811L
+# define __cpp_lib_constexpr_utility                    201811L
+# define __cpp_lib_constexpr_vector                     201907L
+# define __cpp_lib_coroutine                            201902L
+# if _LIBCPP_STD_VER > 17 && defined(__cpp_impl_destroying_delete) && __cpp_impl_destroying_delete >= 201806L
+#   define __cpp_lib_destroying_delete                  201806L
+# endif
+# define __cpp_lib_endian                               201907L
+# define __cpp_lib_erase_if                             202002L
+# undef  __cpp_lib_execution
+// # define __cpp_lib_execution                            201902L
+# if !defined(_LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_format) && !defined(_LIBCPP_HAS_NO_INCOMPLETE_FORMAT)
+// #   define __cpp_lib_format                             202106L
+# endif
+# define __cpp_lib_generic_unordered_lookup             201811L
+# define __cpp_lib_int_pow2                             202002L
+# define __cpp_lib_integer_comparison_functions         202002L
+# define __cpp_lib_interpolate                          201902L
+# define __cpp_lib_is_constant_evaluated                201811L
+// # define __cpp_lib_is_layout_compatible                 201907L
+# define __cpp_lib_is_nothrow_convertible               201806L
+// # define __cpp_lib_is_pointer_interconvertible          201907L
+# if !defined(_LIBCPP_HAS_NO_THREADS)
+// #   define __cpp_lib_jthread                            201911L
+# endif
+# if !defined(_LIBCPP_HAS_NO_THREADS) && !defined(_LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_latch)
+#   define __cpp_lib_latch                              201907L
+# endif
+# define __cpp_lib_list_remove_return_type              201806L
+# define __cpp_lib_math_constants                       201907L
+# define __cpp_lib_polymorphic_allocator                201902L
+# define __cpp_lib_ranges                               202106L
+# define __cpp_lib_remove_cvref                         201711L
+# if !defined(_LIBCPP_HAS_NO_THREADS) && !defined(_LIBCPP_AVAILABILITY_DISABLE_FTM___cpp_lib_semaphore)
+#   define __cpp_lib_semaphore                          201907L
+# endif
+# undef  __cpp_lib_shared_ptr_arrays
+# define __cpp_lib_shared_ptr_arrays                    201707L
+# define __cpp_lib_shift                                201806L
+// # define __cpp_lib_smart_ptr_for_overwrite              202002L
+# if __has_builtin(__builtin_source_location)
+#   define __cpp_lib_source_location                    201907L
+# endif
+# define __cpp_lib_span                                 202002L
+# define __cpp_lib_ssize                                201902L
+# define __cpp_lib_starts_ends_with                     201711L
+# undef  __cpp_lib_string_view
+# define __cpp_lib_string_view                          201803L
+// # define __cpp_lib_syncbuf                              201803L
+// # define __cpp_lib_three_way_comparison                 201907L
+# define __cpp_lib_to_address                           201711L
+# define __cpp_lib_to_array                             201907L
+# define __cpp_lib_type_identity                        201806L
+# define __cpp_lib_unwrap_ref                           201811L
+#endif
+
+#if _LIBCPP_STD_VER > 20
+# define __cpp_lib_adaptor_iterator_pair_constructor    202106L
+# define __cpp_lib_allocate_at_least                    202106L
+// # define __cpp_lib_associative_heterogeneous_erasure    202110L
+// # define __cpp_lib_bind_back                            202202L
+# define __cpp_lib_byteswap                             202110L
+# define __cpp_lib_constexpr_bitset                     202207L
+# define __cpp_lib_constexpr_charconv                   202207L
+// # define __cpp_lib_constexpr_cmath                      202202L
+# undef  __cpp_lib_constexpr_memory
+# define __cpp_lib_constexpr_memory                     202202L
+// # define __cpp_lib_constexpr_typeinfo                   202106L
+# define __cpp_lib_expected                             202202L
+# define __cpp_lib_forward_like                         202207L
+// # define __cpp_lib_invoke_r                             202106L
+# define __cpp_lib_is_scoped_enum                       202011L
+// # define __cpp_lib_move_only_function                   202110L
+# undef  __cpp_lib_optional
+# define __cpp_lib_optional                             202110L
+// # define __cpp_lib_out_ptr                              202106L
+// # define __cpp_lib_ranges_chunk                         202202L
+// # define __cpp_lib_ranges_chunk_by                      202202L
+// # define __cpp_lib_ranges_iota                          202202L
+// # define __cpp_lib_ranges_join_with                     202202L
+// # define __cpp_lib_ranges_slide                         202202L
+// # define __cpp_lib_ranges_starts_ends_with              202106L
+// # define __cpp_lib_ranges_to_container                  202202L
+// # define __cpp_lib_ranges_zip                           202110L
+// # define __cpp_lib_reference_from_temporary             202202L
+// # define __cpp_lib_spanstream                           202106L
+// # define __cpp_lib_stacktrace                           202011L
+# define __cpp_lib_stdatomic_h                          202011L
+# define __cpp_lib_string_contains                      202011L
+# define __cpp_lib_string_resize_and_overwrite          202110L
+# define __cpp_lib_to_underlying                        202102L
+# define __cpp_lib_unreachable                          202202L
+#endif
+
+// clang-format on
+
+#endif // _LIBCPP_VERSIONH
diff --git a/app/src/main/cpp/libcxx/include/wchar.h b/app/src/main/cpp/libcxx/include/wchar.h
new file mode 100644
index 0000000..c684508
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/wchar.h
@@ -0,0 +1,188 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#if defined(__need_wint_t) || defined(__need_mbstate_t)
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#include_next <wchar.h>
+
+#elif !defined(_LIBCPP_WCHAR_H)
+#define _LIBCPP_WCHAR_H
+
+/*
+    wchar.h synopsis
+
+Macros:
+
+    NULL
+    WCHAR_MAX
+    WCHAR_MIN
+    WEOF
+
+Types:
+
+    mbstate_t
+    size_t
+    tm
+    wint_t
+
+int fwprintf(FILE* restrict stream, const wchar_t* restrict format, ...);
+int fwscanf(FILE* restrict stream, const wchar_t* restrict format, ...);
+int swprintf(wchar_t* restrict s, size_t n, const wchar_t* restrict format, ...);
+int swscanf(const wchar_t* restrict s, const wchar_t* restrict format, ...);
+int vfwprintf(FILE* restrict stream, const wchar_t* restrict format, va_list arg);
+int vfwscanf(FILE* restrict stream, const wchar_t* restrict format, va_list arg);  // C99
+int vswprintf(wchar_t* restrict s, size_t n, const wchar_t* restrict format, va_list arg);
+int vswscanf(const wchar_t* restrict s, const wchar_t* restrict format, va_list arg);  // C99
+int vwprintf(const wchar_t* restrict format, va_list arg);
+int vwscanf(const wchar_t* restrict format, va_list arg);  // C99
+int wprintf(const wchar_t* restrict format, ...);
+int wscanf(const wchar_t* restrict format, ...);
+wint_t fgetwc(FILE* stream);
+wchar_t* fgetws(wchar_t* restrict s, int n, FILE* restrict stream);
+wint_t fputwc(wchar_t c, FILE* stream);
+int fputws(const wchar_t* restrict s, FILE* restrict stream);
+int fwide(FILE* stream, int mode);
+wint_t getwc(FILE* stream);
+wint_t getwchar();
+wint_t putwc(wchar_t c, FILE* stream);
+wint_t putwchar(wchar_t c);
+wint_t ungetwc(wint_t c, FILE* stream);
+double wcstod(const wchar_t* restrict nptr, wchar_t** restrict endptr);
+float wcstof(const wchar_t* restrict nptr, wchar_t** restrict endptr);         // C99
+long double wcstold(const wchar_t* restrict nptr, wchar_t** restrict endptr);  // C99
+long wcstol(const wchar_t* restrict nptr, wchar_t** restrict endptr, int base);
+long long wcstoll(const wchar_t* restrict nptr, wchar_t** restrict endptr, int base);  // C99
+unsigned long wcstoul(const wchar_t* restrict nptr, wchar_t** restrict endptr, int base);
+unsigned long long wcstoull(const wchar_t* restrict nptr, wchar_t** restrict endptr, int base);  // C99
+wchar_t* wcscpy(wchar_t* restrict s1, const wchar_t* restrict s2);
+wchar_t* wcsncpy(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
+wchar_t* wcscat(wchar_t* restrict s1, const wchar_t* restrict s2);
+wchar_t* wcsncat(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
+int wcscmp(const wchar_t* s1, const wchar_t* s2);
+int wcscoll(const wchar_t* s1, const wchar_t* s2);
+int wcsncmp(const wchar_t* s1, const wchar_t* s2, size_t n);
+size_t wcsxfrm(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
+const wchar_t* wcschr(const wchar_t* s, wchar_t c);
+      wchar_t* wcschr(      wchar_t* s, wchar_t c);
+size_t wcscspn(const wchar_t* s1, const wchar_t* s2);
+size_t wcslen(const wchar_t* s);
+const wchar_t* wcspbrk(const wchar_t* s1, const wchar_t* s2);
+      wchar_t* wcspbrk(      wchar_t* s1, const wchar_t* s2);
+const wchar_t* wcsrchr(const wchar_t* s, wchar_t c);
+      wchar_t* wcsrchr(      wchar_t* s, wchar_t c);
+size_t wcsspn(const wchar_t* s1, const wchar_t* s2);
+const wchar_t* wcsstr(const wchar_t* s1, const wchar_t* s2);
+      wchar_t* wcsstr(      wchar_t* s1, const wchar_t* s2);
+wchar_t* wcstok(wchar_t* restrict s1, const wchar_t* restrict s2, wchar_t** restrict ptr);
+const wchar_t* wmemchr(const wchar_t* s, wchar_t c, size_t n);
+      wchar_t* wmemchr(      wchar_t* s, wchar_t c, size_t n);
+int wmemcmp(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
+wchar_t* wmemcpy(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
+wchar_t* wmemmove(wchar_t* s1, const wchar_t* s2, size_t n);
+wchar_t* wmemset(wchar_t* s, wchar_t c, size_t n);
+size_t wcsftime(wchar_t* restrict s, size_t maxsize, const wchar_t* restrict format,
+                const tm* restrict timeptr);
+wint_t btowc(int c);
+int wctob(wint_t c);
+int mbsinit(const mbstate_t* ps);
+size_t mbrlen(const char* restrict s, size_t n, mbstate_t* restrict ps);
+size_t mbrtowc(wchar_t* restrict pwc, const char* restrict s, size_t n, mbstate_t* restrict ps);
+size_t wcrtomb(char* restrict s, wchar_t wc, mbstate_t* restrict ps);
+size_t mbsrtowcs(wchar_t* restrict dst, const char** restrict src, size_t len,
+                 mbstate_t* restrict ps);
+size_t wcsrtombs(char* restrict dst, const wchar_t** restrict src, size_t len,
+                 mbstate_t* restrict ps);
+
+*/
+
+#include <__config>
+#include <stddef.h>
+
+#if defined(_LIBCPP_HAS_NO_WIDE_CHARACTERS)
+#   error "The <wchar.h> header is not supported since libc++ has been configured with LIBCXX_ENABLE_WIDE_CHARACTERS disabled"
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+#ifdef __cplusplus
+#define __CORRECT_ISO_CPP_WCHAR_H_PROTO
+#endif
+
+#  if __has_include_next(<wchar.h>)
+#    include_next <wchar.h>
+#  endif
+
+// Determine whether we have const-correct overloads for wcschr and friends.
+#if defined(_WCHAR_H_CPLUSPLUS_98_CONFORMANCE_)
+#  define _LIBCPP_WCHAR_H_HAS_CONST_OVERLOADS 1
+#elif defined(__GLIBC_PREREQ)
+#  if __GLIBC_PREREQ(2, 10)
+#    define _LIBCPP_WCHAR_H_HAS_CONST_OVERLOADS 1
+#  endif
+#elif defined(_LIBCPP_MSVCRT)
+#  if defined(_CRT_CONST_CORRECT_OVERLOADS)
+#    define _LIBCPP_WCHAR_H_HAS_CONST_OVERLOADS 1
+#  endif
+#endif
+
+#if defined(__cplusplus) && !defined(_LIBCPP_WCHAR_H_HAS_CONST_OVERLOADS) && defined(_LIBCPP_PREFERRED_OVERLOAD)
+extern "C++" {
+inline _LIBCPP_INLINE_VISIBILITY
+wchar_t* __libcpp_wcschr(const wchar_t* __s, wchar_t __c) {return (wchar_t*)wcschr(__s, __c);}
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_PREFERRED_OVERLOAD
+const wchar_t* wcschr(const wchar_t* __s, wchar_t __c) {return __libcpp_wcschr(__s, __c);}
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_PREFERRED_OVERLOAD
+      wchar_t* wcschr(      wchar_t* __s, wchar_t __c) {return __libcpp_wcschr(__s, __c);}
+
+inline _LIBCPP_INLINE_VISIBILITY
+wchar_t* __libcpp_wcspbrk(const wchar_t* __s1, const wchar_t* __s2) {return (wchar_t*)wcspbrk(__s1, __s2);}
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_PREFERRED_OVERLOAD
+const wchar_t* wcspbrk(const wchar_t* __s1, const wchar_t* __s2) {return __libcpp_wcspbrk(__s1, __s2);}
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_PREFERRED_OVERLOAD
+      wchar_t* wcspbrk(      wchar_t* __s1, const wchar_t* __s2) {return __libcpp_wcspbrk(__s1, __s2);}
+
+inline _LIBCPP_INLINE_VISIBILITY
+wchar_t* __libcpp_wcsrchr(const wchar_t* __s, wchar_t __c) {return (wchar_t*)wcsrchr(__s, __c);}
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_PREFERRED_OVERLOAD
+const wchar_t* wcsrchr(const wchar_t* __s, wchar_t __c) {return __libcpp_wcsrchr(__s, __c);}
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_PREFERRED_OVERLOAD
+      wchar_t* wcsrchr(      wchar_t* __s, wchar_t __c) {return __libcpp_wcsrchr(__s, __c);}
+
+inline _LIBCPP_INLINE_VISIBILITY
+wchar_t* __libcpp_wcsstr(const wchar_t* __s1, const wchar_t* __s2) {return (wchar_t*)wcsstr(__s1, __s2);}
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_PREFERRED_OVERLOAD
+const wchar_t* wcsstr(const wchar_t* __s1, const wchar_t* __s2) {return __libcpp_wcsstr(__s1, __s2);}
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_PREFERRED_OVERLOAD
+      wchar_t* wcsstr(      wchar_t* __s1, const wchar_t* __s2) {return __libcpp_wcsstr(__s1, __s2);}
+
+inline _LIBCPP_INLINE_VISIBILITY
+wchar_t* __libcpp_wmemchr(const wchar_t* __s, wchar_t __c, size_t __n) {return (wchar_t*)wmemchr(__s, __c, __n);}
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_PREFERRED_OVERLOAD
+const wchar_t* wmemchr(const wchar_t* __s, wchar_t __c, size_t __n) {return __libcpp_wmemchr(__s, __c, __n);}
+inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_PREFERRED_OVERLOAD
+      wchar_t* wmemchr(      wchar_t* __s, wchar_t __c, size_t __n) {return __libcpp_wmemchr(__s, __c, __n);}
+}
+#endif
+
+#if defined(__cplusplus) && (defined(_LIBCPP_MSVCRT_LIKE) || defined(__MVS__))
+extern "C" {
+size_t mbsnrtowcs(wchar_t *__restrict __dst, const char **__restrict __src,
+                  size_t __nmc, size_t __len, mbstate_t *__restrict __ps);
+size_t wcsnrtombs(char *__restrict __dst, const wchar_t **__restrict __src,
+                  size_t __nwc, size_t __len, mbstate_t *__restrict __ps);
+}  // extern "C"
+#endif  // __cplusplus && (_LIBCPP_MSVCRT || __MVS__)
+
+#endif // _LIBCPP_WCHAR_H
diff --git a/app/src/main/cpp/libcxx/include/wctype.h b/app/src/main/cpp/libcxx/include/wctype.h
new file mode 100644
index 0000000..e4dc61a
--- /dev/null
+++ b/app/src/main/cpp/libcxx/include/wctype.h
@@ -0,0 +1,94 @@
+// -*- C++ -*-
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef _LIBCPP_WCTYPE_H
+#define _LIBCPP_WCTYPE_H
+
+/*
+    wctype.h synopsis
+
+Macros:
+
+    WEOF
+
+Types:
+
+    wint_t
+    wctrans_t
+    wctype_t
+
+int iswalnum(wint_t wc);
+int iswalpha(wint_t wc);
+int iswblank(wint_t wc);  // C99
+int iswcntrl(wint_t wc);
+int iswdigit(wint_t wc);
+int iswgraph(wint_t wc);
+int iswlower(wint_t wc);
+int iswprint(wint_t wc);
+int iswpunct(wint_t wc);
+int iswspace(wint_t wc);
+int iswupper(wint_t wc);
+int iswxdigit(wint_t wc);
+int iswctype(wint_t wc, wctype_t desc);
+wctype_t wctype(const char* property);
+wint_t towlower(wint_t wc);
+wint_t towupper(wint_t wc);
+wint_t towctrans(wint_t wc, wctrans_t desc);
+wctrans_t wctrans(const char* property);
+
+*/
+
+#include <__config>
+
+#if defined(_LIBCPP_HAS_NO_WIDE_CHARACTERS)
+#   error "The <wctype.h> header is not supported since libc++ has been configured with LIBCXX_ENABLE_WIDE_CHARACTERS disabled"
+#endif
+
+#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
+#  pragma GCC system_header
+#endif
+
+// TODO:
+// In the future, we should unconditionally include_next <wctype.h> here and instead
+// have a mode under which the library does not need libc++'s <wctype.h> or <cwctype>
+// at all (i.e. a mode without wchar_t). As it stands, we need to do that to completely
+// bypass the using declarations in <cwctype> when we did not include <wctype.h>.
+// Otherwise, a using declaration like `using ::wint_t` in <cwctype> will refer to
+// nothing (with using_if_exists), and if we include another header that defines one
+// of these declarations (e.g. <wchar.h>), the second `using ::wint_t` with using_if_exists
+// will fail because it does not refer to the same declaration.
+#if __has_include_next(<wctype.h>)
+#   include_next <wctype.h>
+#   define _LIBCPP_INCLUDED_C_LIBRARY_WCTYPE_H
+#endif
+
+#ifdef __cplusplus
+
+#undef iswalnum
+#undef iswalpha
+#undef iswblank
+#undef iswcntrl
+#undef iswdigit
+#undef iswgraph
+#undef iswlower
+#undef iswprint
+#undef iswpunct
+#undef iswspace
+#undef iswupper
+#undef iswxdigit
+#undef iswctype
+#undef wctype
+#undef towlower
+#undef towupper
+#undef towctrans
+#undef wctrans
+
+#endif // __cplusplus
+
+#endif // _LIBCPP_WCTYPE_H
diff --git a/app/src/main/cpp/libcxx/x86.a b/app/src/main/cpp/libcxx/x86.a
new file mode 100644
index 0000000000000000000000000000000000000000..45196213a96527a665d0df62df318ac59d4d7b07
GIT binary patch
literal 1524412
zcmeFa4RBo7btVW<kOWz<8d@<FX>%+&#>Vna%0}bAO-CaVY|=0(5F!{-jvc==8n1z-
z8r`jajX#-CVncTD*hWU1IIgXo+0AZMwsxl~RWp^H6*ILnyP}k}898f-@r*2MQ?|E~
zT^ojz)n9B#V#xi@egEC>y?fsuz{Ftjk-&TRo^$TG=iYPfx#yny!B6CB`Pm2G^RfG#
ze|l}dYCqfmz5o97$lyqS9~JtI_q4U$ajb36D;>L!AP+kJ=#@6t=b1lm>+pN7{GhGF
zc&`3sTZhQ=%Ad4#Z1Z#L;3wN$pNIas?bhb!)K=TA^ql$X&Og8NM{T!8dH&$7wp(w)
z=eGasVB7A~%7fbno^5kHhrZf&`_2A5`Doki>jOW3&r6+cx9>i?JlK_iT^ZPwfu9>0
zc+VgFW!pcP=iQ#R_t>60JAbRq@!U1rcIWQ1%Y$7R*p-1@8Q7J9T^ZPwfn6Ecm4RIu
z*p-1@8Q7J9ZIFR`hW@%O_GkQH+dcn~pWpqHwtKeox%6z?J@owhhmv{z(<j>Q;XOb2
zO4~iW=Wl!4?s0qG*=oB-;Msd{Z(F2i@Dpu&!#vs9w!OR0E)QamfnWI7zt#5h@a((w
z6KyyBbNE`@zPO%3SKGeXE$dnMmu>ruXXUeP`{?=NOKtnqj<$XO9N&!R_n&Ip=l1-;
zSK9W`^FN@T@%(Xj+di-7Km2mrKHl?<KWf|ea*x>a!#{7^N6+7&PJ++9Z4b4@`rP|k
z+r2mA)Aw)N?v4IPzcxNu?@LQ3$Bv9nOh|{1j7j5%AI?rr93IUMNs>~j)yGbcPfGZ?
zBrD2TKA+7_;8{4+D@_hcXQVbi2<fyW70dNng~0)s^sqEq$|*`Qf4DR=Q7IMk%h^`&
zC#TX`LXnmxha@1Pii5?vT+7ufHK|_973<0vK4sH`)5StTuF2)REY+8*a(2p}o)Jl!
zLS?xwRdcm^v0ki{j|?xQhkNm7%!9s(d^3gFEQ$_PbH&;isGG`WCx<2c1--u5`-X`d
ziVVb+GGi@%%~$5CCAluUa(POO%Na>)POhXw1xRkQnj1BdM}KCs8q<mIebOnQ_id4z
zge)#XLhvLcAsYCbOhOjz%p?jEmk@)?+a)0yzIY@gmxF}hNk~F8@Hd%+<m?hc6ecbq
z2A8)>LNt8wNXYCgBm_@F5~6{>$s}afE+Ir=;u2zTdAlS;!xxW)C<-J5PeKx+fxpQl
zM6pW<QJA=d7+l^i3DNMyBO&!VBm_@F5~6{>$t0w1mk^>baS1WFyj>Ea;fqH?ibY5W
zo`fVs1AmiANYO4KL}B6*VsLr8Bt*j(kA$2*4++7Okc4R9Z!!rvZ<i3FFmVYnxV&8w
zqT!22LP{k_2%dx_L<4`5Nl3{qAw*%~5@K+9yCg)z7mtL@%|Sx&BqSjk_?t{Z=Ijze
z6ecbq2A8)>LNt8wNXXI>Bm_@F5~6`WIn|3^NWiBm?$tEfDb`1DmXg<a(BT+0K%Cbc
zqu{^xm*<C$>><?<$J5`-%jj=B3H7%I{wC;eqn#1@+W@ic{jDL6r@spY^f#V_`db5k
zlWBm0T>}t>iE99Z%VN@&jyxl1_~Ma}>1jv^o`fVs1Ai0D2u3@_`p8uS7$CNNM$iz)
z)8Dd;{>GC~e{0}xg8nwz8KJ)o5Zm708e-4>J~3HO_f6%drCfPg%IB2&z~XGKo?W2*
zQua+=s>-$EoLsKwO6kGEe0e&j{h~+<Y0s+7P>=R%AnAPoh<dd%XPe=HyfbI9<sS%I
z)^`)QuV0e#OG^?q=jV!fsa&ZS3(HcaEN3Uqo?!g&j4*Jon#1x-sA{P=m9JI}#B-H$
z5%B>6ReKT4;HbKYhyqrx7`~-i^njfcMQp>574g2W&%vRooFYrwN79QSQ0g2?4yBVl
zHqIu5(z8cG<MZ#y{sHtzrL5Fz^ZB|om8;c?a!tyWW-7H}eRd9S6ghjE0|UV=RB=J}
z0x&^+4@@5LXMKCVA3`%NgTl(P7XS`?U-0R^YAKhOXDg*?xu*0<X@5CvF5VZccz>|s
z1Hp<91}i=ktoU%S;v>O|XMz;(m(sod<q?sCNic^vr}_Rq{E$6Ak@uAYy+Rt3IGdN!
zy;ReT9zw9!d7=7%GhLiPY?T2<n9iXAqH~!;=SaOG<!5s>1r$y8N(En{nhH+`DJ%ym
zT%h@>kI^L+Dz!OS0KV1JBhs-_C08$&XC$LRCa=d%(tI)8T0*KU$Td`(&Ze_iN)gUM
zqqbC&mH861SAMeJh?R2^#GS=jD3WI7B}tiu_XYEhMV=4pK3*hXbB}C0-==qtZ$7Al
z@=XrNw<fl`h^xPJM3vXR_~muTWqi!YWdw(oq-ssh7ZpcPCr4=gn-3lAJ~-k=)YMPY
zt=;TTX!L&a5z=t;O2B^d!B2z4zxhG>DH5WlesUR({)8IZc1Rk9E`tTSpleNkwP93)
znOv<bLPhs;?61B->3H*)km|W9#Bh%lvWUVyRhurBbG2pZQSG%qeh#=HX|jrehXEKF
z8dO}I!~tAD;)e3GwMw~??o*bPx;!W4OO^a%{pHG{u@3hNmUpX{ftIer2O!n6r%#N-
zY)SXBU#k^F#g9#<5!v1=jZDuYupN`u*b;{QAp3dj<Wf3|hvL$EY2$|e_*xdObf?pW
zT4l~4p(F^PF6XA<(}>jYq9TEPfFnw^4QWQOa(V;<XqpA_OAEPLk;FUQYx6(&J0E<j
z(+WFy^#SHcAlG*~Jzp+9J}*neMLJn9I5%IHvB~Gp4_BH7VOnc)G%X1r05U@u?9w(4
zSC&(%VMq=NNS~kp_6_Qs2kYRHk?ONG^uHu8!L`CT;?i5pl#P#5NBctb+0ito64p{P
zI509j#VMD@N}mcczXHEFz!u>wo0hp$qa?Z2%#zH3=P?bLW&P#MEN1x^Jpj@X9^D%>
zJvGW@u)Va=Ft|fSfTtnng<^Rcjb*b|F*{*+Qv+2u4hm%_INnD`)3l>XbT~&U=7Bj_
zW%FbYR^Qq&C7pQBrkg#0R_Cy{K)xKj(?r6*^PF_UCeRKQNsR1cIv`DAvd}T~w_geX
z5?f<v1NkV08v)8|@*I|_;oCtrPI)0$Do*F>GF)-+0SD@Sbb&5CImi%AyTJgU30nPN
z)rRKF3>QaP*vEy*U+OSlo$TysNQxm{m}IKUsI5z>=m-Ok;O&$36LX|5jX@#`fpn3a
zM_<#vM)3M*I)vS*$ZX{Rn3ee{C0{F6P0T?6kQ1JcFhViq%HZD|P5>H&O!oPob93~=
zfU=mYg7+9#0XokbrXr(C*9-!xN!JX#l8zRP1}d#9NbDJn%$M`I`I*@|w0d5ylFdr;
zi!YhhFN!YO>3*}YRIS$xrGQG#56~^APfY48ZTgm*w0|2a!!0F~X`vILt0lJE)$&mz
za5z6-!!gk&%4s94rGkyZ)^GZD9E7&DVtSw^!|JIlN*aO8UO>TN<F!d}OXD>`YHGD*
znKXSs|Jhj8LZsEbtu$INJ#;FJn1Yh-Efg_U*a|2;GF^mQ1v_iY=Jdn*Y8(RqhhXco
zY|c;j%C#C!=jLIjz^qH-sIOJ8!em7u9pq=c^kI-FSQn#jAt{oK{WEM)koDY37441`
zYglB!%A6xRG6R)S$<qnpF;aItOPd3+sfAt*Vur1~<yuF2@RoLcarBvph68vk5318?
zavmFJnsKn&*%G|Sj#}RMv7==K4xI4!=-bc!3Zh_kxRbau<V?n4;B5BPWJa1effK>L
zZENMHi`>vGgd@+I`e+rKfCwBSFr1rS$l(~cw$@0vONMgQs$8D7T;u2yt?T46=@hA0
z7<*KyvCv3G!X7o88rU9K%+;pNF*J4tyd8wWGY^_6%wT{WV4plJ;cqZbuu(XD)+C2!
z2cAZA_O_s$pcxXK-k&LB@`a&W&cRAM!Py}SC-oRYw6#%uLWaRn$YF~El2f#HBeHB;
z%G-DllSk}&*$g7i0<Q&R-v}ng`I<soz}94E*l2=N2-)k7$rF7a(<JFnUmD{_pKTG0
z&@}N(4)CYY!D$&Dj<C}+Mc}~}#CBo+F$B<5bNOO@Io=+Cv0AObRCD35ch-w&tr`JB
z)}(k_!g!_4Z?3HgFb@2MV%SjC%zBFrESOq_p%5=n+Otk<^v0^H{CQ4}k2<U?eKM((
zT_qNt1T0ZC`;x_-)oQtASelDi)s$!Iv*zrt+ua^ENW3<dWh-wFIx`w>ThL+e0C8;6
z6LPJh&y<`|9WQf91v=47i*oL<_-NpWC0{?p+5ORpiBUKr6BAf;qN$z1d`ZsLZX(GD
zC%fcASE{8VLh|M*uhSSQyB4#H3>WXUA2VDs)p=!B)5E7=%J`bou^~<OGOTc3m+M$H
zC4rXKoA!k+Ypeq=On(mIR(`sy)R>DQ+zQ{@v}(cZKg^nF@LGer8bqFc_ZAv3QjeL=
zj#2XE3hef}K(Ra~@SejHqR)+frn~?Yf498=0PY5l01Ps;uxKa0JPUI7k8x-P2)9md
zN~x5v1B#`ok5u`N(^j~6W4QI){ZPT+g;++n(gdBI&y^91p2ylad}G5cns?SO5sv16
zpzbZ0hHMYU-o==C*(B9RUnFBC<vKqFSXnW#9HHr@j1wfLna@%7Es{CCU{!4*I@mCw
zl@V(ok>n8Z0PPPnKO2*evOHHRmLF@z>B`^$2xuCi4oe6;R&Dy^2~RI}CKG6Zg~D`0
z2{9?C6e98ro1~f`29-azeT1WyYdbJF^co8=aqG2+5<$y2y~_-K7G=f3QCAFs*$KUh
zT}axNV*1N}<=!%)5%k$iCbFr<r(fmAeP@iIt%VOu+jXV=A#4xX_d=wFqP*z7A;O86
zYT-&B&CHsyVsu_&Lz`v}eP5AvV2sSCMGoAnMQjj2J{;YOY1UQz0!(?B!f6~!<X?Bd
zjtUqX1m-M<?w)TVJt}w%n1Ui9J`j6@@D|6(Z%~fR#C2&AC%_P}iKxx(1dkEn9<+yz
z)RqMb#!s-oy%^Yz!>n^fZ2jQSoP#f9@C?#N1yq69KKj|;_7Rs;OmKQwQJg)Ek)=Up
zQAROBX5^BQ=HO5a!xdt$?}fG4T+0#r7Gkep@5M=SM3~@%QqR@rostp}D0$R$U7rAS
z@>e0;yK39Vi(^SiDw=$@B|0N6yebT;S<^!$gxO-j2{dIog{H+WW1Inf<Q;<+4a*iJ
z6xG7QGuTdWnI;BEy}s=nv;i5~O=d7GizDb>kwz7|u~w<nB{mAffq<Mb5T^B@nWjP8
zM7uf+4#|;J%jpLQLV=M>I3R#cX3I(p3Wf#`<U3?jz*Vz{LV_5vM6{+i$C4Lujgao0
z&B3#)hfUaQU0TBiWy;``JX0)(YfwMpKeU?S#A_>gBR;^n!x+%^Zv|zBWd@~+E>SQ7
zykKh9mYILO0*zCE(h0t4n;s%1r5~SRu25TQ3{Pf-a~|Dv0V$sCOCl;OaG+4DDJgo^
z#zP5Ya1avvG!(I?$P`dZ2{;0}lUl@u8>2{T$7u;ERr2g64N`pEok+Jj+J>Q@hu)=@
zfAd@_7|rpXohS`TVZJ_JleMh_*a~$SsVJ5QMAVpP?cq6uJLhKPtiQjWlG8BU23F1l
zlJ2w9iYO;q%{K+y`SR3JpTkZ^S$-!wi}N;w_1U9>h|KvZW>m^#WjgoVdEC%K;_NUo
zbia(Iq5Nlc7yNw#X65EXRDofo`w5mAbe#2wI`#;qa3gNS0kE0C$nZ(=%;g@Fp?c`#
zVBiK1FpqrTYUI@<0T4J_=R38za7;T87?>is%H$=47Gl55zwVGW6vq}2C9FjawTh$v
z2(ut?N0(K!ALraSlnqyL^0cVP8fnxD-#H;D**5T8x@~3Cy>voPW14saga@=8Q>4LX
z0~C5ju)~OT;P&fLqo(X}djK<$7S?Z8(N1*mPSCVU1s|159iATW)SzY>HSd@P&$|A@
zu1Sfe-IS;|QfF<$!0@y^t$~Y>3g(7sWs*O+76dLbo7h<gQ9N{vtt=OAs|@k0K%bPc
za7A7aa_4d)#wj4VSkVrY1hc?gYl>Q5!!0;D6VnJPup~>vg<P=&qfrkuhws(CrQ*Ju
z0$a@%KSak%n6EOB0oOu+zwERWCslPKPkz@HwB91$0);yhwASFw17;1f0%=vj{-FSM
za&GrZgYp9H#rPTlCXB)2+|<10R+Wb6WD+*ZsiyZbz^pn1C50NIaxk>Sjy{PNhnO$n
zm^D&73AbdiQk&+iB23~3t3gVW8*!!x*Az~Up%ujI?8LDJ8@Eq`@kLSOx={F;8YZEF
zt>*?%nE>@5O#ggoX6XSs&cZtYY?dA-)3z{28-d`5m;?^61KGqs!Sd{2t9bc-EL&+o
zfW<g2)kGpx9NowEP!Tctu;7{BSyU$b;a?z7G^0g@l^#@<%Xw)Li5#(}n=V#(mx8*@
z`vRKZb=DUYs?1cSQp%O8vpK;E{c!II79A`Um*i=|!u?3~CRlU?Icu~dUxMOPk_)1f
zWq&0vT6C~h#0g|Un$x{XzKA)ySU^$-F|tRH_->I>AqtkyP<fWnN3g=MR)L*{70`D>
z%45aqqG;)1q@AfFcv_H_%sdV<){wqfw6*DUZu<PZQZE$clBkSjh?_ww;P^2mNeohD
zNSlNNn>{2~3YcaDOEWtwK=GMMg(gHn=>0fLDqIu}0Wm2anquj_1WWf}7eowhe`Q{@
zVS`AnTNWL4rY%cH+sQDD(Uuh$WH$71n5Mk^3Z`1;E@5cw;KVpges_C5%Qb`f5O`)W
z7lPe5>GwA_(u3w21?ToLQTaE^&yW)Z<uBQyP`GBGD4>z*{8ZqjfhcgXm4hfWoT8b6
zRYvM$BG21I5bIYus{)wvV-?(=LHX{?p)gEuu@k8+(>;9|qO_ZcsufziNdpD^FqWB{
zqR13V$QKiyVQLTTO^&52N;ZrvDYpPCI3{>Q3OPXHqHai;nxCu21#M8lIyY8eI5``W
zoMx2je4SRK`K*7o4bhGrR_4pGHW&28McW`X7Q8zV6Z7EU@!z%(Wf}lsy&IEC(Ok|k
z0n?H|osNsP!5JD@9506`*JulIh7y7gNcih(*NK80tj0_qvN8~T@et>sP9y7(p_r8)
zQ*lWvK87S=r8f|x#$)T}IozTXmnIlmBE1r$D!|n}at$j|UJ790!89KuuuPS-6#30!
znmxe2c(uU@-Cn?2%rPPR^|g++1>><WfJ$IHSgq>_#GYn3w!Rn!eUHo=gYT+D2uB=r
za#wz7AyV`u=$VCHsf+*&@5OQ;aFM}ii_+Mr;;nJT8Yimtg%}U*LeZ9F<G_rV@>hjA
z#ES3O7%Y^K_JC)52@yy4tQ;e{prqpvRt+B3VRmN%8?i_%7b^mDL7AnbYC>Ga{u3gO
z<~(K`BAq-^-t$3JVF!lOoc>23f3b{t88=SR1yyprm^VY^$EIA<w_#_O$ZqOxBdg!!
zuypzi$Np-n>W+noSA5yr??Sw`JyV{a!yS2foQa*o%|TX!6n9kH*Pyy@gXmO;cW=~p
zns|RT8@xA)JKZ4v9aaC{IKR`x``^0YPkd>oiJyxw4(4{6_@xNMFYPq(%MplQ-f80f
zZ)fwD`NB>U?|)mIKk?H$O}rdIY~-CLo|g^ZSM5$Lgdu+<CM!rFBD&cUb0?PpI?eGp
z3mIk%64xId2vlrjG0QYLgIZ&vkI^1SLxw3zuSnM%^W5e_Jhp?2gS;VRX|B|8_{ZNI
z6qCw<DmLe0Sy&=RKJKxMhh<2=oSRlE2<?pr9`^Fso)2%!N2oss*?vzvJQH!ZiV;<p
zOQo4uh#I8*+8Ot)RevQUMyUqgeT!HKzQ3;|4nHCXLo9woe;i`|4SyKIenbu!E$Btu
zV<!Y|+<Oy87b6aspngOla8aoW=tuOY$>~RoVQA<8W0H$fU{9idb2WI8Jc)t`LU<Cn
zkU4HXA(;jT{2gwFPUlj?adU}MBW7W6so}VJM5*C8TtvZeTpyxfI8F#rFdTP)C>YMd
zToepvi7X0+vse`c!@a6c7?973A%=OiALgZ?Y3V;!23d|Wfp{IEh7XcWSQWGhIfRkX
z#;y`+4Y!Mdfz0HrdV~%7!yho?X#KW&A{m8(DEL<4=(xAhBZef~i+$Xdt)INHL+-nO
zEr=lwcJnO^F=C7@?Ah{&-~M$lVEp~?K=2~>sc|AHo<<6r#e$9G?yrl%5j2c#o5+hK
z=#ER&7ICJPD_ML9ycTgGM2d>{ZI<u&ZSktPgW{|l1)+q9igza`rl@##;9;ZU-J#i|
z;ukrluOJ)EVD<Qd1Knvi5yciD=#D3JRJ=R5@KN#Z@WMvLdqE2q74Hr$WK_HlFoZ(J
zB&W8h_(gvMKv3{QN5y+J7bbQ-8xL(}RD4X#gK-%&D&D=76fqVeD&8Gf$f$UCV1nwq
zHI&L7T*#<+cVK!{{9>r6cz2K?qvG9x5q*e?C;DO;T3-1lyw?_jW7dp{k7-=Q92M`*
z-FTzo-EoAAig$+<Au8S-pcxe(Q?KF1@32wv?gS2oi;8y#W{ZmFcojv3-i(TmiGNm9
zJcmHthhxO3y0_QUaj|Hu`F+-(Vi>&q7A6MYRf!M|&YDCB26yFWILG}NYPb~mUH~zw
zcqhUIsS;kci&4c}<BCxws`Z6va_(jY+b(e*8=<1&-9c$l>|vtf{opzGvb6COI4Yil
zAjDpl{{ZofiZ|zjs54IFsCajl#2rNLjwO+(cz0CW*C5Vzp>KFzeW!`{_tb=lir?u5
zaqI@)-Z;P0#B(-jeTgsaH1V9RVPE3scA9w3hO{s7OFK<GXB*s?_~o4@p0oMxOMGFc
ziRWzj`w~CB)5LQE4Sb20cbfQ!QSo8O4;~fojwM7?ybqw$9KWv6`a+9}=Plv`fr^bR
z_o(>T3~HaKcnwD!4Y9)5W8twKTpZ+?QSlt>Nk{;~M8&(yw;mNA3(IU#@v*=&qvGS>
zf2gQ<51xgHig$;^BA|js#e0B?D=OX>d<;?X?(pOABUbd&^d1;u@gw@<5c4DY!w~i(
za=?U*ig)K8H(#XTvExt`)Q>0xZrpooNuN&r!36Xp`U7+N5&d`6gs2M}74P1W;iKaH
z;6?Hz`t#EayAR<><U)?a%^Nr>-jk6WH<ysKfEs^?lh{B77%@YI%VLhhMYK^I*M}$=
zjuS!@496WH3Wl>V7X`yvB8!6IELKIq1dWRK91iZuZvw1J{AH6x#fzDi{(#J=ctNX|
z11(HcygLu|uyst%5u@UL!H2O4t<CRZ85t-&k};E3VK<D>?T%w~XAI25Q^>9at?Ik!
z8x}mrehUj0p-wv0<KC7^Sm1{7!nopd$%`%aDHzZDVOEO=kcEKlns*)H1C#+Qp&khn
zL=voJwm=Y$J`UUQRv<@02%^PDjhK14!8pG>XRV`LXuRlQ@HCkwihy>blR;pdOepwq
zCp%E7$}B~)m_0^UAbU=z!oY%%<~4j<`;})>>R2oBFeC`H_}ZXbN&ejcHO9S|QV0-d
zdK7}ebSf`9wGbp>*M&cKgu)qx2*Sl!72GhxiGCIW#XoQ&1jf+TvG7}5i{V;1b}bfN
znT7k#l)9PnFc#*}jq;QdMVhNj$HQ)M^(n-5VO=Q%jjju3Ct>4juNm7cn9|381Vz)_
zLOh5R*DQn~N*sAGTa7<&g|*T6vqo6Rk@z3MHZ$T=&-yH7B7o;8v<Q#|kFiF<pu5~T
z2W6vR5O$wOK_a|!5CsW00yv6&FCwH-;B%xj3TQ)2`SIV8un6~YBrKwx9BPdfpp!$v
z7whCupaXYuI4nUsIUE*lCyOm6MY>ZA5~t(DfQWaIAUxsD5QHbncFt-#0NXi`#MsUO
z5}55gctP3DgQv0m%o!i^N4IWiG<hfYCvJ&AA^%ncD26ZzfQcdd3uQquv%i=qjgw#^
z%{7?jzT*&-X+BVV>{ngod0&0W$PfeILxG<NMX;<GaejRn1-6#nr$wmD9!?f-^T0|R
zZ3KCaVmEQSFcNS_il$(L)EF6IT;igQ3T1@w@=p1UHA9;Hz0O?n1;IGDZ_IX9f-C_-
zIT}ioP#zcup)F!E?zxd^$cXpF!J10;hG5&N^uMY%E<mF(0uo4&(L9Zj&U7S_qMdFd
zj11RO$8<@P6Jnsiw7egQx&`UopEikbSBG2(trC$ipb!$_P7weFmk4)I&i;!da?J@b
zkVN>B7^FXgd1}E<ek6sEcbVVAqF_#8d<yZ--)GNdTIOhF?9}8~xmXw3KJ1kwr9NFO
zv%O$W7)5`+SY~R&$EKw%9ssN$Q9Xt0a3BukQIJ4-&k6&1xmM#9DOF~;gxOn)6ny?j
z7Xvqy2Xb(c-&U02HWp>{)_U{I5&`a(g&8e7V3Qbc$j;(i=xICC^I3h>?hU@FeDJLu
zCqD6w&!&2kL|0+Y=4x5a{OPPGmLkSkM|=mfX=L%4*;FAoH=6(mZMZkp5x=dqsiN>!
zteu^U0Yz*v8=NUleBnfFF`Ee`VxU(j3sDn|))l;*;2=jIh%mFMLU3+20SGQ)i&;y=
zc!9M|$Se`#umzo^)N{2uX*N9MXjA+Zh&2Oq4G60!SG7B5UoK>4aRd4Z&m~zJ?JO0i
z^3|#|jo`2u+#y-03@py(>YV70KC5DGsscV~)eH0Ge7#sH!?dM^fmO(Y?$5=(VUr*v
zpKFFXacsc{Fb8tK3Au?@U%MbZJT2!-xtdI2EYJ^AC0y;p2^-27Rmv5qS}B(6GNq=;
z`-@y(n$nkPsDjm#B&(({kw^txD&^`j3^uM#x0ls77raHvRyf@|U6JyYxhmL4so^P0
z5&KIV7lY6T2=!X7tQ0D>IUR;@?O{}&&EfiC4YzMUn`C1S<YmRQmlfy7Vz!ANi$VDT
z2+jN;7=rv*%-Z-NP!BiZl1-#tL7dSYQZVtQBIH?%yLVmu!$SeSqh?miYe`4Q&3P$%
z`aI`e;lX@;xk_T$SDf}A(L<$5K39@a4nb^1tbRCi)(Bcur3p#|czOUDAfGEskIBo6
zmD;o!7B|KwwgBvyU{hhAJ?MFih63O;onfGxtIX!Z(}RnVaUt?#R+>CYe@~w{la@}O
z=h&ybfIgpbmspRplU|7+P7g|wCT)^}+vVixu~Jr-J4j!P=y9%>hQ2a+kWE7s!3LO-
z`ygC(salh(EU%R%%M*Fdt%!c`N|j1An=b+eHY-k_&$|X1ldLs60A1u};{0h6kv@NK
zLmzmhH&164HB6qV<w}-xgMDWtZN5Bxo*f@Zq~ADG1UrnE2;x?OS&ASqLM#P>n}DV4
z2x&4b#X!-=;Cxvhh4m;*1w2De4S+6^3KTof*2xi``ZXsM8q0yyC`~}kd_A8$Ux8xh
z`Ffh2>fJVRolBmrKyeeWl^svsHnuJ&&sLzg3E0YxYbV0iJ}g`HNuW@w<m%WJ(bkk>
zg$T@b8YcKnH*^>ZFH=W5UhD13^#`iiJEx~k=gH(5kn)i&o-E8J0P<bdk-9f@32U5X
z>41Nh<Z#wd;U{s9p~DX7Z?oV`M-Utzegf>y^HWZ&BfSTroD4q!cIWxYb9G^rYz!|f
zaAk}(rIz<!wv$<-`y3ToVHczlIcO$mCrDe-OZCaL^n~xY#wr(^VtH-FFED=CuC%N5
z<-T7Xj}v2&@5Hd25(0%oI3+xq=jN0kpOABLN%xl7oD%F;AE(4l^n<8tA-Djvt`uW(
zEx?V3A;57hEOJsy+LUbzJf><FP1nL=bl1WJ%Z9QO{VVDTh@*c6JOMkw0@0Ow2o|`k
zFa=ibJHQ0-b#^>l5LjpL02hQ;#qlsfU{$;mOb}he#=``GHSA6>L3G6#oC)5BZcHmq
z=qr&GCp2Jy6{ibOO$}Nr&c(=zkXD>KrwT>aig9+iz*=!9q+fKI7bhzOmU%nD3T=hP
z!Hhd7^?lrm7R(~Nk4qQCx9p_l*&gIJ;}o&<!?ja)w4<`iHiK#OJ2w;aY;EqlMzw{%
zDCH_rMb+6-H-Fx-)Wy=*f2pfm`mAZ$J_Ix^7N_O1lq*k5GquWmm1stE33mUqzqFr-
zl^iqr^(}JFf*gzKDpIr%L<Hvok>w<FkME~7VLIa`N@paj58)3P!X6^T24)-nIytAi
z?6z5YMAi`rNRPRsaPq*Co^57>$hJxXY%nd!n}iJ_CS(F^Fm1`3gbgAVML0I-MkFdr
z&TR{8YB5a<FJ_2DE#?$!Vx4gM5CcxE*k@^;SQ+IaQ|mSlViD^nv2HWXAg^xQW@d1c
z3hORv5=C-Rr|D`PDA0PbuuN(XCt+r&j}cl$fm&8{kHAg>F<CP)-E<-Q;)vd14pbH%
zhnlTs)uO0b6(>$nvnn{wFlN;v->kCPLvWdM?4gN8IwVO3EOl;VbI7Ahx5pd`-UGDx
z=q_oZ=1_2)zP;{Y4q3e}FnI(g$(s$L=1_2)zHIO?hjxq&qUKP{Z16CLc8m?8=1_1p
zgg1vQW_X%I&Iyrg$9PYP+dTM0&6q^k?P11P?A~T(Xl4xh80LwUkTqAU<(8$gyeO6A
z@=Sf!w4T`s6mJqo>cu%ZWb{6}la1Eyt?|<nef2qt4IbqLJw`#F?uXKv#>o^3QTMW*
zUp|?Zrqg<46>-bsv;sBR-x7?}Sc3v;@Xk;$pz~l+mLHqWE$<8w*oVY{5lN?^oI`h<
zE>e^j3E_EWyIBV#66_8=S_|2G%k^1ChW9{7kPL*;5IZa?c7z#*Y%a?<746RlPu<jq
zpdM-p+?4f-RF<ZTGsU`MPGcbs7iEj5;bO$jkW((s!0X64t`KRU>g`~>*oofok0Yd6
zDxXhKB8>q$i^E@%QqAQtK(~K*!nPq{s>-!I7VtYj0Zc6-fab}a5CRI3BmA?K`P$A9
zp!WdsobMbBu#oglkZ3qk0OHOt1HK0$giX^sLjlswGYX33dDss-B9b~2a&uC3hq^&$
zf+FWD<>{Saf<7z^8)_#zf`-IE3|!DwU2f-G*%ueTCU@bm7+~QL9DV48LkLucX%y4K
zAp!+4EgV8n5dXp<1QCW^qAgzh77lv0CXtn72s)BjID{ZWbm5RJGmO!Z<ia61bK+Py
z1jlNaY<>%eM0+F7g+qwu8v~TLa7dH~X_19Pq7?8K4vC^Sq|nc3PnH0&g+sD51XwsE
zONhwAAz2E977odhAhK{smI9%LL$V}@EgX`iLGK9Pg@Ygk6cE8e23>;#J%S0d?7n64
z^g7}%@)IWlZ8wC&P3qBgi(Es`bE?tA%Jy0S1JjERj7~VG5dkUel_T0U<r*ZA#GP-8
zI^RTBTj6kf@=Ze@l5dFC5ae6B7j74MS<mNma;i6*O%qK>p;nyBm9#VRyyKx>K<dzw
z3c_I(NkP&d&R&}v5M}{Wa4rQGg{V(!tNeVeCMnBvQ<YK}5UhhLO0iyCfX5cOk-`Eg
z%QHwj5CI4^rcle}b?1K=I%rR@T2Um*0%znV^j^ui^$0;gOF}|O$01z?kVw)+K%z(&
z)sHA$Mmx|U;iby}5=pv@#zc@V0ufER3<x2mYcY<w%LXL8bm>4sOP5|higel95nj4%
zK*CFxtubMxO9v4_x@-`_OP4Xy!fQs5VE~CFT?8bGbW#0?(q*(Gl5`nBB1xCgm<ZBE
zAfic^0U>~N4O@1XG__0~*Rg!qDa;>MFj@146-eZ~!332&Z%DySGk;jY<j@-ywJ?Y{
zdP52*mHvPt3#Tz&gUx{ML>aK+5Ke*>gK!d<c!bkvT(H^EpHXoLr_sXb!by-~5l#b8
zG~v`0eDH;<3(sw^A`7PuE2?nnU}6wXTjL@NrwvwQ;k30dqHyYvq6?=DP-NjWCWOc{
zCx|j&#UY#oD+b{tF!2bd(YQE-(|{F+a2hR)E}R4@7U47ii3?|jnVb~q6e3=f=2q0y
z16Ze=K4!#_vQr42@v8`QBd2b;QlDk#1pRM*h(xI7J|<H2$jT|lnYHtjIln0qni`Yt
zoi7(3pO>X-y*8G|4H**)NZNK9CmJ8-q{f8b-^N(<E`rH&^;x-wi~@y9)`?z2rIn{+
zl*83r9rpm>rjNXS!av=V;+|-8L<!+)FuZHdc|Unf(*B-i;k%waK_~sRgAuiP9Nxt7
z23(v~sZr`c|G3vkox+nIYGhNpTe9fUrHz~n3{4=!ST~fbR^_toW`YTw!*ZFfDUphW
zu}75}-KbJjBwX==BWduTF6L^}))fvEHa)nIE6r0p@1T?&pvxDslNkwriLIX9(d=Wz
zsODbS&|C*Tdww0t^f)W$AJdXu&>&=kpqcApEXz)uCuwCjv3UEBZ4wha;(;eI{_{;F
z)InzuZ0fblAdA)vvKVXzK?bIfGst4J83b*}NVI)+82{27Gs^x)7Lrd%_^Zt;JJj2)
z^Mgm0P5;5>oFAA_I;K|EZ2Q!T7unYNK`*xL^Mhvn@yEJ-Pfs&rjXK=!qg~A4JI^#&
zQIm{=Cd(l2KThe=OHCOv#I2&gt=f~LI-7~bJfUx-X}6C+W1XjCeK=D?r{t}ZR$3$U
zX`5wFFx7sv^xcyuCH&=_*U{&~*n8Ghe|T$cA<+xIdG9THi$O%sW!4oHy#%M-Kmxg#
zwFx9509g7e2qdNdvkN3<FCT%7mfer=WSJ5<rYn(88cO7m0CF0u7`Vx)kM{7E(~&t@
zQE-uwf{U-{4zLQ$#z<Baqs*R6LkzcJ8WoF0x3;;42Vp*HUNQKa`}W3;ps`33uE^Y@
zfhLEvThexhL%7%y1k(!8gF}LfpDi{-x&$N7$suoZANMxH3ABJ5I{KbZJ~KCk9M(7v
zSm)oEm-er&U!o_DebEK`8J|0<abq8&e#}vk@hL3Qz%(CKT!{8rU^TO>seW+$#fbQw
z^@HPAj?PDtnWIerf>Th8N<k9<9tHXoiBlQHx$0<Nme!qqV(KVQ(&<;&yoHi?<+=mv
zaIuV0TPo2thIR<q?7{@Q9Zv`)RI%@Zg^!XJC?Y5=V>BE>t9}r4q1&gU6K$P2FXioH
zGdyp#NzMt(Y`6DZ<JVno^QH-sBP?27=foAYaZS(ylH!=dB9r2T7LXL@Y!;c8CU60X
zaZYTJiD?2SM2vM4O6UpA0U{vM&_murDm?1LUndo|XChz};^VM^KwAL?IW`=%Ng*(b
zHz}O+Axe`%Vhq-#;Oo?=O$vcgs7Wq+3L!~#gA|GcY=y)`0znE+g627mg9IH?C=z1g
zg629F<AQDTL~{kZO+&6;24ZtK`!X6%A<o)RgqZ6hH!B3rAk7Ln-$iOxNSr~N6=Ked
z+^i5dg_;#5c~;1w6$xd)Muiaaa9w3JDg;WQMj4B_0+MvqiS>SqG>x2);~@$MLZTGn
zfYqoFqakXeLZB3Dl<A@lzdW*o2#7TN^2kJLUmkh;BEkiBjP_YM1&@}qMpTfebJynj
zGPamK%MLBb`Ff=`HUXEJb8z7W-4dxN6$vi2N<K%$u#<T5d_Q7avb3+I#pp24pLd&0
zY6R{8b$1zY8(~&+c)-Q0Io&P+>N$KQ0qQyZ838IfeGmMK#>zFg$tVsx_*^drJKQWP
z4m<c{#)WOOW)tAJ4SE7R*P$oGbsO{q_-+{<39#J)o&eV^b*@of32=oOR~#+iN$}j%
zeR+PQqqT7@pal#)Wb7<O*-vNDkO^qNp`1c_2gW8yBNj;^E}YThO8rby+AA)VXk*#f
zY7V<LcY`Ek_Ow(CZT+}G5+k86PocQcdC&qU4EpfxccQnOfIJysn@48*W7r>~zVHDm
z#+POo4s$BxLbru5C(v+&ISsbBC~JZmk~D`+7#nF$s3A#nnw_!H)&w>raZb}VHsYGV
ziV-&myP0L*F^4E;nohgaKyZJtT*UR2+93{aB}9v>lB@+%*h3iHfRdu&$1=3m<V|vJ
zH4<om@EqxK22?wV?=Ki>&w2w9`@$2jV2`-h=WZl;Gzj&QX^{A?j7x(=HfP)#q}5BH
zL4o#o+#3|ChqR5IWE$k?A#b+}T?NQak|E?$QsBEmj4VQA5vUc#oaT63(}N~T!@eaq
zQf3?Ws$xNHPObs@y14Cp4ZalhpEw<BE~gS|?$QvbO}_ft#hUQI0by!gCOkow#L*fV
z4Ry#y249-T*2oa31siGj2F#x1*iSy<=K?Au5j-0x01<XO#(S=)mMq6TbMH9Lwdn_1
zE$2F3uv5fMy9Dgo@iS>0X2rGRL((bU=~cZM!}${VDDqlLLNV);X$NGf6yGN@YD7^g
z{%4~dy<(t)*Cj+PY;yEUgWBF9yBb!EE5>w~4O#zaUywdHss~<spK)+-Br~tbQs5?~
z`{r_w$v8g}SVYokR&%CQnab(8J9%7$B@(1K`q)1cf!=;i7J7w*RkRColQ54UBq9R<
z_yw1Cj8f8N&ZDlPQ-UBdjBrpSG%yV2B|dHqL^%1zITERN>j1mxLP!GAxc*uX`Il%H
zQ|r6HqjX4@PP6B^LoYL%L%voPgMb6ty%N_GueS~5v|B8Ad1CeQw!!Vd!zECDTwIQ|
z3DKB#c!OChorZ6qQkI^OYZXbE&DG>-u`vq<(2cJ0QXTh{``a-s-etCUfqeVB^xdmP
z5%a+KxRZ?wjRyO@d)B2=x|dG4RpzSb0Gf-S6}7)KV+4cL2T1i=uB_1EX&sjDywgGs
zTLT5}p2$n5fZekwcA(F(NrO6ErR>6wrtYERt)aRH$Do_LhhX`3k9k&yPq|ri5He6y
zvU7_fkn>0jpqmd;ol>&!rnF`>bOyR#n&4bOYt~}SRPwnpBT=jDFXmQN%BIDtBGpkA
zm;4&s^By8rT^eF_Bs<5wj9JE*pp_<&G(KR(Qe`nXHmy<+Y;-<$u{e$M(wr<qCO51a
z+H5l++OP~zm2u&7Wih)bip*9=>$3a=tLmwtbTV~4F*oHuGnl2h)3sHSI}4aanYbEq
zBi3S!D7&yt;F5-b6*UnERVfHIOA16$Sv7RI5v^#G0p6_(ChKi=G;BP%Njvv(1?>!%
zN(ovS&Di+UdP}Pu(#7cj|H=Zw;sroRMExt9*gYqLruu@GiIc@i+a=A|0(a<Q)}gPx
z)lv&L^m^K)%2U8CwSz0-RuI7zaw`n`T**;G{*?t(rWXJqMeScX40dZe4K|Fmlo*=I
z7gOLZwA&_Eo+9_FE2hxRxL(JhZ~jPeuSfYuD#(YWUBkmNLLmtca!C$Lr}6k3lkOnd
zNJ6?9cCk+^5ZUOOFDtXff=+3kE|0<!hCY@@RxTqnNZ_s>_a?H7hjOLG+_Hj9p}2*3
zfoJHu!y&;b$>o{)tc_jFLi3)v+##_{t#i301DwCB$b{jDJAzlr-#YZHhH(?7W&oje
z5b6|KmNhDb&^kc63+-aCVc>umS!kWmNIL`;S|<o%TR5S0z=<TZ4oD$|))|r(K!}_b
zol<mEq2yyB#K;NMU5)@e(0uBI8CjB=z=aZ}CK%ym$q6WuFgZbmmL_M8AntP3oCTZG
z6M4zg(fOdA?;yw_QGlgOX>gHpKy8&NfDWWnn_3@Et2P6PB36#}wa69YoTzGTCX3Rb
z2Uo5~9r39_<|#+TCb=pa5)jZvb5i4wD$__iS_~+v4nkXHDxjI>Br&8!IZ28jP!2#X
z@<con7AFU&u=A8NXg82JIfjOpJO!SooCG-}$~I307AXg@tuhsOo^p~IR;rv-MG-3p
zq!zgfHcvIR&266YUP;hSv2j3RzFrtXE^Sjbth{}+Dh*^Axqvlf!w%J)bi|Bo7pP9z
zu)!9acHAHaF^$~n2bK#LAa;?kHHxKc=FB)Q&|GJm05Wk@aTki9_Hqkp0PHIkf(DKo
z+_(h;qz0NcTxp6f8XzN1*`QWMoG^|SJ%l5mk<!YrB1bsHw2B+t*oC7QRX6}32H_~i
zD;yvypl~3F$EHovLu1-OgIH9G2W;O7L{P7IfQ~9AUSI=h7%w2f#l-_sl=;L1WE^6H
z;~a^J4PYlFHUOQ3*bvyrVnaaU5gR~?TWpB9sI$#cg<VSPDmQ_Rl@{67q5DdXsKw$1
zJa*a9iH;~d29y}2M+X(F_!#8HAwQ7A1my?Nlan7BLbUs9Zj;%T4ub0;SGgp((Iy}2
zAc7K;`~Xz!@<ZfBmY<@}{1en3ZtV&Uy1)Dg8pU3~<Ch<e=&16eLy1FvG*I!%k4|13
z@&h?^pMPSJA3#q|erO2AKL3EV1UKURqeF>Fen3#{@<WXbCO>_>j@8zP1P2~1x!mO^
zpa;(rxUcw#t+za3N0c6KxIv`H8%kj5@dOn?dOTsqBR%j4xlca<_r^WQ1bANo611Pa
zp(i6k<R^<kh6qetLIhaxOA!$m%On(+SJ11Y<M9o8Lr+MI0{RJk=!;E^BKZt`2y_!8
z@4#dno70X#;7keWv5~Qp=hH)3^L$aTn*DtuHE~BW3;C1^waQ#Dq^?zkuv!;~uyA_+
zkU6U`i@FvqoaZ0qvLK_d9`54FW2>;hAu&f`ZXk_S8mBx+rje_yIF~C))k?8k=S5Un
zwQ&?ILTw#)eYP^M<jT{Eq{!94xI@+kZqh6>HJqgq2u5`@Ib1~@W4$(yJAvo8=hIp+
zIxBigP1B)nmQ%x#=K;AQaQ54F(IX{~XwB)&iD9?ML%ZlWU?Ephf;Y^irgzI+lA0lK
zmKy=v#1X+`?zq8S(voUQI36t5%1AH3N99gpf(LP25OOCLx8!O<jBG)c^r;jVg#6Ya
zwnEP{&8|^SW4%U6r>1hao0RTgA1PK8?Kj_prL==da99=|)J^vpS2^R5Kho&Yc{t9Q
zz7`Mwsoe%G6-t$y4ulg~K+4|Cd6c*1&LV9n%a19%DboW0ZeNWCAWu2haWQv&HarPY
zA>fi-3{!N{Tof)u0g%u3OVUzk>=7z6%#TLF9JVsUtY`A^4ruX|JG41$Wrn#HrOkR}
zZ!KdRZrY^iKT9}^N15q`@o-NFdnDUKs*4=d*zyx{HqQt(&#3ZJU*O&aI_mzIyu4Vc
zO<P%{FbRgwBZHb20om-CUg<P)R*y=PN9gbA6UZ@j`uvnXSKP7+E@r(N%FDP#^R-7q
z7hM`EXj_rFr8ku2>58qPc|GZ7puTkHn3fyT4v5PuXYwFHUYL2x0Um70z+yzM2B}yW
zdsM0QVJ<H!QodS+@dZ7(n5#`oMc7{Ku8%XwI5xPDE6qcTBP=pIKsmd!$UeqPK;|(T
z%)#xS1kk2@>+)O`IV(AX#d(reU{UBwpK(YS;vbAYe!n@Aom)#w?}^-%K$!j5&7!3v
zrH{v~fD{qz=vzQISVFqP;m^>p%*;;o&U#1oAG4pd;>pj@z{8)Roufx^O)`j~pvdO*
zOCu<qh7niGRoOThgGtI2PuRglG9znP_Kpb-TLHv8xiio1IL@K*8HFj?7TZRV(n2c$
zM;-WALsTjXRBGAK)gtfs*xV{&FDgVuJqjaa&5$^?o!2lpwJkwzO%E5RK<|6hgljx3
zQW5bnFXd%JIZ%dSE?Ii^H9avJFCC#t2^-t4l(>$1c!9W-FxZ&i#<W%jNrfv8Tcg_z
zc4)e-J99#G50BxIfODO|#?oJ#s)Kc>IOPe*N*o!m`Rc*VoF$vfQj-4X@nfNq>u-+(
z3)>+KU~I*Z`&`sP6i4%fJwb6G6LlKJflI{O5fdK11s;P?h<L1GYLDihIx|}yk^J&U
z#?UB-q;Cg8r?_tiMu*IA2SQWuw+Wdh{o900^Z0HPGTl$>y&`TI0U`7`&scEv0+9P4
zys8aBWe8Op97|+X8yux$0tz(Q1;^!_dlE+Gn06AzWzIOs;|ZZ^gLhOoRT~OVSXCPw
znM2ZpPoTjOI>miEFgj#@I}n<JzfH)(s@mY4XAXgFY8g+}T6frnaDnhtY$V`fo&<8<
zXuS}tgGD#^0o}Y}hn&+HHzbU4j*ujF(+uDHWU(hi3wXS5Z9xbmygo?xB3?pXW_LM`
zX%`4`{bJ2^ggmx(Jfbe?raD4+TrR28o5kg~cU3MI-K!G8A+d&StIpamSVeoqrLCwM
zwyk<q9*1pLyN7U?27n%1A#lfw?P~WBQ?wxM2~DHcz2qYC!Nyf&LVIF^Mrm_`=1;ik
zmP!KqFSMO&IISgp%beS3t(8PD*=H<m+Cdycy~Np|Z>oi%6ttE$c0<$>!)4w)1YP0Z
z7QH0)R@nt1LWQ+Z6rrLcq^;_?+Okk-+8mN=xZ%w=WXEV6iHJ~1b4&=8?#KOg{sq&$
zdH@8r(g&3)ZcPeMzKUJ*dVuoza=jLW9_?ZeUj{np*D`*Km(P`|v$+8DPZwu!Wwbba
zX4#0BA6g2EV5*cWKPHY~Fjs<91}Hy+Sc+Ny@@CLlx|iKFBPm5h)PYC7fjVACZ9-L~
zGcVkVw9uyOR9X(&gsUlpvo%_Si>$c{cH4v3De~*MMO^d>u+gm^=5a2KE%o$3jc^si
zVbsDjLSWRQG<X#~LM^mVAivSzQ4uj3AyMi=Gw$gkH&i6z_l~BuKsA0@*dV;Jbk7zJ
zPc2yM-n^CmBSdv)bW~vM&b-XQsdwgq4N+fl<k$=Wz?oN*3&4ntLFDLMbu`UMqu*RQ
zN-&`RvA|YL!S1n5(}jr$fIdNPlu*HfS)q$JF-vKTW9V=LT8LVKZ@AQuiuNsf)jx(q
z=QYZiS7v&SZM|#&+=!|4wSVl`!*`Z23S93AiiCQ}U`XOZWFRswRpoJCk7VQZYs(#m
zIJ=t`IE05O*>PVYs}_X`{zKh`Os;sf)Iq#=n5MC6+t@S#jc6Wq;5y^1k~~Q;O>V{{
z@vHQBaGUM~5|ppz2!AI2;fFp)x|*@^Wy@JZP_kSqB`8<T*tm@{!^fR>FY!FD9@Thq
zVODdPW9Vo9zVfVw89Pi(ajrDkeZp*Mswd2srfV9wL*3*|b478Cj!gam5IXAxz~{7N
z#aSBAf~C8w-IH+eP<q$owbHdFOQaDBC#%WD>FJN)b|#(0cXwrQM~Hh>v8K9W6>6(J
zI|6ssunM!O+JB<33JWY`t-=C&yEQ9-pgL?hq@T3C<${neLT;6~BHL0)P?@^dOHiM>
zAPm705h*cF(;=k-GsgTEN9N%>t#}j;_^y!bc=&SyB7)2vDy3ej<z{5~g+!X;Su?qo
zxuG<~(4QxsHIpOOkPhsRim=mJd|SxkO9#9y)5xrmdrYd<Yy45<EUxb#`y7IGlpk1}
zMH&!)_XazaKAWq_(>Mt^UlurAO2^pk6?mK4X&ji>E3kHJXhPK@Vrz0q#^xI1A+K$2
zm<LLg{9{^0A3nO(Oe0*3a=lE00-PHse^5O`=fsh+rBLx5Ef_3HRhpZx+pv53G0eh4
z^JR-z&*GFihRD(oz=Pr6;n=h)&Xlv~&!3)HIPGr^q-npilBWamQm!_`^PV@061Th?
zlev`~5>BPP-SXtxv<)_{LT;99ZUwgn@W-@kEgr7^>RgQ?Cgv)&WsCu(GGEKf+{g!3
zD^r#ib)hwDaz+l->+3Dgmr7C-N}-C{C@JLTOZ8wF6*jz@Dl!jnOWXaso;6?uNz<3h
z`Po{fj7`*O<e#gQOnPY8<fdmUdG?ydwlT9{V$N<CPNX={$C&Je^Su8c4ct=r$0@Ob
z%)>jepkel&B?VApmBY9`MH88}m(9G(QGoWL=Sr2CzW5=NOfYhb<!N~dbENO|!f!qj
zNRZjli%k{=wo<JZD`my2r-99HUz3lIjfp6%9X2TR*CBjLhV{WDGF|u&Q_6>EifZH@
z(GK6(WM53khkWJ{A`ppX<j3cc#82<;=80NhvKmA<RHcrYDlbjV7YcICoT+F(yI3yP
zi%6k4Ei3t2u?mgchjCnoE--kb1!Cl9=Mljo!X|Hgq{kT?q{*qk&`A(e;Li1?TGzYW
z0ptxKQYQ(i;y!QWAqCS1U`%r9J36_>4u7UF7#C&QV%b(>7=u2;TvWV#KnTc}Pi=!w
zp6dX{Y99cMNycm;G)4FUqg2p#8$zE)eW~k*dbQc2O_n8v3J5il4<>L^1weW<*k5b~
z;KnmdTg+pzkx9D)E=Im^SM>P+2;2$2z(TR#7osTRc^ZY^$29PHQ2a<0sox?1{Mn|Z
z3fFtZpUvTy3uy6rFW(2@FOio-JSJMn5i*Aa941<6LFdX~P0r8Pl;VO+?i+atCcVFH
zoNlhc9f>V9M4H@EDP(&@nU+qIQ+ryJ3HH)_2G~mrHQrt!R13to)t9z<KS=XE>Twz2
zQBQ;=9#ut|<569VO_U}u56eQTlyTnS^x3(Ig^6PelYNr^9EAHgWLoF2A?v%+hVWr%
z;}!{lqP@9kEMi4UHV;(HT|tL7w}xF%`S9(fxs$O+mvOOp)Z^mQrcJI4>%}zAOx9_O
zybcfCB9fv{Yl~H4a(R(_EBKc=(XsGlMe6h}$G+rRzf6}Vs4D%}Qj1<vz3H4*2LH8|
z!Al)0=t?s`xP+Xq5<|OqzUgI4eNfg^L?gH9WlKGxt*MOOjHb7)HC=F0Bb%z~O>cVJ
z3XoXPR0vfk>%)2%;1?+5bcQ-h^96xFxqMz$6szamKU<qquHPM-QRzN;sfy!Vb8@+!
zE4h}pp%W;qAwP50gLX8F8DIi<^*PI(CUd+C0OAfP@;25KtfH8|n{QY+ij$9qH@`Y6
zFkd8Gky;P;rKOW&M@A<mq{BzXr18TKXD25PkK(coJ4sd-2o=wlIP)hqw$NT|4sgmj
zso+j%EyW@B!P;qdt5-YwYq&xN7Ya?w3&p&wyLH2c&inU(6BWM;oaK!^@LratofU>L
z0&A7(GOtUVwa_QY?Wa3Y@rMzNv>ACxl54d}4P8UAvQX{xDi3FSJy)(P>0b6#Vp+Y7
z$-t|#?eI7jjJ+tos~n|y8{p*irF}Fl+#K5mh~vYdR^EXDI_u1;m2kg|QG?~V_ZEph
zY<|t<>iJn@@Lz`axlUf1Qn5^ND_G#mOLCswZ30yecGl@N<4YKbxXIEDA}_&n+Ri&j
zpGYTruPhzV_yT5a*s>)cyWWLAUAxs1vE*&>5*9j9JKnXjpcU^%a5}AR+_8WU-W=fy
zV9;2V>p>u)fb?sT5P~2^^l+0POSZI2C86GOsVCf7E_DU_%B5zYu5zm%w5Qx)1nVd_
zf#Iur7ra&_;=&B}&<t%rYO3xv(<45_maZNNJ+M>ToI8kK+U_%B*@QF=-i*qenwvks
z9?{J%$CunBl&JZozlP{57{uE`c?&X&_LfhcG&<>b@Le+xwuSHPV3S*iumgJr-<w*M
zEPXA=Jh^M9QCLXbWVBgCvHxBzQTB=R=YgD7y+MY72nLW#7aU?;k3Hz}G<K^Egy-=`
zZ?U(95boINV6A}A40cK{i8jGBp^f&$;A?BJLEajyc~%nX4rhla(BB5_m<|S51LE%6
z^bqx}1iKaXXQeJx3W@cDVXDX8gkjc%La~;78-|KyMXuE`z&SzkElN&AoS>QY!3_lT
zCjp6q{z!s!`yeK&<L=}>#8fB24zojz2|I4W)BQH-OmKABrlLe-Q@`em%?=5OC3&oa
z-_06olz~$i!wb;T3AAG<SFOsrvP=ZLqEH|?^ueH{%@1)4ERNd4F*T7-WcD%i83N&x
z(r5$BSV_eCGA6lX2AH8*60+jbeU_$Aa30E3=apGFYjE5n5j~@iFRcsWmVMpQO-6XM
z=`EXx@MyQW@#4$Eng7O=mf)O&v*dGC9ET$9l7#hO!nYP?af^-<MFLZQViu4tmkF_6
zn~ur4V(K<Qw%g=0fb&VjF4uf6iL4-v!KHIQX2NYoVRGCtOlaC2XuY~J5hVZ%juJE`
zGL;(5Aq&N@u|&It<vw=!GO@)1zSvxuc#*Yr%fty5lOgOU62!ps6D?wbLZj$7u@xp#
ztL2tisBlRx&(vqlOJG=hj_|-0q|kIKEe10*1;HDp8u2%foi7OAFl2*F^n#$B(vbiH
zgLVjbK&O&m3tXK_$@D{Dr;=zBT%AhEw85Nl&eO1rdn$<JR1)MC6l4;l+XpdmChj>X
zut_Dz4zojz**$K;Tb)YDNTzKnN<=m-r&1zX5afsO^oVw{>FG&?c7ruGD<p0y(mg%N
zh>oFT!gzWFdq7)SB*T4uPbwLyw>&*;){MJfTRc6<^svp-lgQ+6czP1yk#2q_BRqzu
zCkeKM^7IG}C}T02;GAQ+NuU~&Q0XRo^7LrE8~5;XqDa7EOUx`WJw1uA-thG3vrU3*
zx5;PBEAud(o`8c(7yOtBw^?e*amTQ0T|7N-Ya}t-4H=%EM1UK5ScGHM(wOTlcTVpP
z3sfWaICmz`NN0MbGifOc2lwO<Qov7UIME#Bz_CZ9AR>7VxhlrkJz*53tody;PmLD6
zrp0)A4?97S6+|Le3KC-PXJk&;=m0Y96(hx@Pn`Epdrla%{2t9L73~ZjhCyJMPaXxX
zFp3hp&uhgHYelj+s4of;Tj8rM3Bh!d2&k`1iDK{`5rSGG%j;?H5fK*#pAiu!3Xc&H
z7Ye@-5f={c5h0Et<cNp~fzODD2}1@4h?P3-SexP9UV<fey^^D}uhq&T{zF=3U*?c^
zkSgFD4K$@Jp~`%}?dp1ju=v)uQC1Qyxa3>VpvY{((12JIP?6o5rWh^puV$lMxQTPV
zl-nRK`xe9nX%%Tvs6!n^{W<I?>d#|GQUBIEiu$+TQPiIUHdYmUS!F9YEm~0aE$E=q
zAGxEbKYB+|4gpTHR?r3;C|4_rzeG3L%Yt)HaKM5Tvy+zC{q^sSP|PquV-28fzKJdb
z1xe>0tcygp&7CVsxL{`*j0wW?fS?2OTo8Uxo(qCCI3mV#%*psG=jM>e5YBg6SNWws
zO840-@J6S-EPziOLq-GqyMX)5f>bp(^zudC-Dytx2xpi&ylb^uvE)Kfb|UA$ifzR*
z8wSg45G=;VxX&oHcPcjroU;uB%3`jXJ<UJyZ^toIsL3+IcG$saLAv?@faln7k~UOj
zxz0JR3um2?%7R=g;O1S9jq0qGsZyA0Ay+H~t2U23w;DE1<{QTl9ad!du}YzkU4nmU
zq*&2xMfP^OSmOq>+dG0)BApCK0|oprX1m~$2dTGcg5t}Vy|9+=!FNuw6{l(C%o(3x
zh~}~jy;2!TDa2~<XKWjIeQcZwhJlxAAl+LD!bn?T5k^|Y`HXBTE6_}<h5#dNh4q9n
z!7%U`nGt8Bttg*~R$(3sn@Y}>M|{N4Dy;L4FIO#9#yw|GTTz|a!qkX%PAiI0Z+g<U
zag^-^TcmWq=GUfa1lEeXS6#a_*cYxPR!+F|K0I8jaXQoio!Xee#=-;}u_SROYx%T}
zdkT<K#lZv(VsxN*SksWI2Db3nG4!AW2Db1BOE3!$H3D0Bge91T$4#I#pyl7eT_W-f
zZm=+HJnt={bW@GKemzf?w!=iJeWsBTy;9bsLL3lM0X;rnMA|nbKFSugoe)GaAa{@r
zCawHJg47`D`G)BFZZ3hyxrJoPb4am<tD=VW|9Q3gkN|8(E+dDUp6db`7&YDwu&h6v
zNNMltP6E6K=a7Njz{|6ZDa(+utkmT>qYDEO>{Z)IuXm?;qUT7KHwOmw);Jm9UA{@8
z4U^TI<aD!Knr-Fuu95DF#LrpBo4P)G-x#aoR$->OJ(SyqyEwOr2G-bw$3BRnY+3UC
z4>sHp>ExfDvGdubp)~af_7ZCA6IhdIMcTQHg@C|p@MuT?VvO-5$UH*@c^0=q8|*!n
zE%KXYpU?SdJSTE~Rj)Zwuj#kI^;Q6EiE-9j20bTIUd3jW&MogyjGS@VGy?dGLC1Ut
zlP~58$D4mJYi-kw3ueB6aR3AuG(hh$@*+;S0ow0DKwvg_zzM(&uG9=6)=ADybEg`;
z+`#!tvCMJ*=|zX8<$5kZD^|F#7y0<67jaCPY*yr_ugT>+H-%@qK8rh2v=(HPk}Owo
z!4F+y2+<#6x1?1@rsr!pvZ}|(wKvFq9y_^|&f@7c{@~c4mjBUn>ZB}$8Xn5SP1hFX
z>N!r+C?-s=qg3U5u>ivsH?fV;xTLF&7~^UGem-B%W}*80J(j`1(UsM?x`9Mqq8w2E
z@NG@hXkvF}@ThXF)i;QAN5ulW%Bh74YW|41*g?ALS}`|OVwc59TB>c%#AtPeMQ0yU
zoXq7OlaaJ5Hx0Z^Ehn5>5)|Byr_4`jSwA^=n)`^`LoL0^9aSwglI2`;ixS|PF`sbP
z&u+cQovm8<h1s4X)y-|@<H%Hta$a66BJ72w+hya^cg`Kb;yXtte8<jb&8S+6pTK+)
z;25yy>@zf@l#r#_Si`W$3@ozJBb3yf4WM#e&uQ*VO72p?w4~hYQ#-xaZ)8C($a%Ux
zm4yYx5I8FYF+kibyGyY+m9JJoX>F>4Ud&BZkX8)Z_lY+4qv4roL&ou?99n{#f{~-m
z_A6yoE+VpneaA#?B>QhV#m#y+JwSJS&X+0wd%iADW9N1OGYhL~y_IH>Qm`b~v?~2n
zr7qXzie<PA>^01n&I*H6fo_`8!Pu+VUh8NnUGhw+GL<VSt#71))z+DLXkADS{6{s}
zD9YaHw;ej(G3M!QCKOidXbeK0VBT8qbQ0-(uk}_h*-!P&w(2iQUpDaswKL{Bz1Set
zwKW>A8MBM!d`+hO`^fK{m)XUXPzMFJW2qOJmbpbV+oLX3k;^}aJ335QI*6LA$%EJT
z`EoutKQn71La*5R0iE+};}nyZUs}pd6&KQ^OwqWkLH;PEyoTUHcl~O4k#Y%|pWLcK
zM$GSeRhOD90?Uq-42z<2YQEN7*&VMjCZK4cXUVeA8;FU4y2bfhpY2zgH*CM6Y`^W-
zeADM?XX!jH$u7@VZ56azt6N^!F=|B&EY*3KmkY&O9rs%5)wBYbM2)xPs>sMj2UrT+
z_D<h3!z^jNbWXe2fS9%f$5{2!jP3m5sKsumV7J-nh6dgJV7;UcxBqT~Y87$-?CT{m
zm|n7Fp0ELTFQ6fE|7Jt#Uce%NQExI5K-pCm&i3nVGD}&yxrtF$KQw<Z^}odg%O<ei
zSpaPB%)0JvvEaCWw_tjF*WmA74C8WL45G#A8T%zU?7ABakfuv)V!s#$W5|)RTJJ<A
zoc4sznrJ$US_9wl-jaC&?o5?z2k-o%BXGX7jjtv^P9%M}x+7OCYugS+B_PKkGMJ)8
z8uc^tqzY}{`t0YK?C<TymF<0+ol<H+F<^xAw0s#fV{aUv7;7B_8<Rl`wZ;brspd;N
zoyJQ$k;c0w3XRvz<l%jbFqkt!6ZdTslcOcp6p(hlw*a*?(pIPSn^n)j16v*Eds}%s
zd+g;M@2&E7&e@7PUR$M`cxtQA{Kcx%%y3(!mQQA_44K}@SzV}D#cl8OAvjrQD;u)f
zZTif7r**CQs|Cq=WsPO?opXpW<*BU$Y$(#U*SY}N-dKq2<%}^!`rlUALdR64*=`N2
zt<5HHOiC@yWWKUVs11iz(2kjv{n*Fu5A<gs-KUrTjrX*AZ$4W2n9Ezb+?%<#Dm5yA
zP&&4DT*lcF8J;-pZLy4n!w4>EDVFLuG)e^#fcH`SNEh7{ne&dlEy**v{4!up&CeL?
zAS$iDufj74u#%E1$n|CV&~zOydqp>1Hj$;@grv;klJb&FrD#={n_rUj3k-}`#(urN
z24h4~QPX~bTd7jRmbX!%TrocxuXL}UW;oMJr9NFMPFXN)?`Vyq8K}0GD6avvy<=jE
zAw#cnC4?gs>$7wCg*vR)*2~(@+P^~s1MCYH9ho8a>Nno=o7t1c+S}XPj6dydx3pQm
zwY4q%EA6)dR^WlQy|%LS>Q~kOXY%aoU%&Pv`sFiUc>Wgr*T{A@9_~_K_{ejq|L_;9
zZ`{|8e;!Q#G;=wXePi_}UFX}+-k9%xWa3BHZrr%B`lt7=%UhrO%&$LB05o{#2;k~Z
zdKt{mec|g2=EHj%zuqPP_j^%BJ=*g?W2H0oOm;th+^g1my4271bZp-F^wUqT?NMKB
zob1{Ek#|?$y*2gaWz=1L_uka+{Hy~%Y_zAo*mElYpn&@7)gP~S-P<_Y(~)}Sp&MU#
z_X~hryFc~Jfr}p=`Ky)wkylofwc8tYz`X#t#-EEHPCaw?$bVe<*vJnWz?oYAUr=qW
zedAgDH}VP<Uzu2IU;EsR)HCe>^n;ZnYqzg`aPt#J@pE7&-sJK9c7pU$YW*m^YG1o|
z;}HFD-`WQW%Ee<hQ2AE8FWgw~`1mK$(9Vm~AHQ+&czf!Z&s`t+)0Ovv%3ocR+8K$3
zk-uWNb7)#O+TXc$0RMKc6|SR!;8feinRZ6Z@ph2ix%Q#W;k6I0-J5!5^ahb|nHq8X
z+T@LmOZ3wW0qtD7jS*5HWOrz_){b2VF%Mm=f4u$Txji7{??+x<xntzbl@F~+dp3LV
zL;u=-s<pQ8_o-*PFD~vGd1K}NwR3ycdN&WOE$&(CW*`?>wY6SW@+?Z;jh{L%4yB&i
zkMes*zI~x*ZQoj2{npy6BX3^VzxKxF{*iC5>|Hys)~#Mydt>Cy)cOyI&JV2hf{knU
zu2G{pehOJ=PkrhC#236BIesJc6>8VVM{legP~XuzaQ##5A3xHrzOeGs%@5M6^>gh;
z*RucBtC?4o+t(jy|9Jb#o9e5X?<)7I-?NoiKYQcj$8M-EU-)U}s&eGw2UE|y543lg
zB|zgZn!n(Oi@Em0VEmTxF7?c>-T2hVD;Iv2xmx@7=B-at<@HByWZq%Y^wh8X{f!$J
ze{t=@8w2=3eRboXV2G%%;9FN?zWeONx%HzxzibSgF7)vIzjdLfr>*|$t3T;D`^Y(x
zYkgF8uN{RTpzj}|Pd8|YVAL2@yPtZt-i@l=ZPc&zv5j_&6XSP++gX1P5!ATQb8z#Y
z0?gi?c8uKAGtW){)B}X-MPv9L{{}vT&jhN2nuF^5Hy*>_Zanqh();$;=*x{Ckg%nm
zNsU}dt^e*GCT}NhY^>p@)H5X1CvJ>fQC~=%d?|J6%G!w=Yv<Uz)HC;vTvcC6oxGen
zbrk}ddgfF+AUtz#>fx)9-|@?9$J;kX84!#o`ewp7g)s%tx43|2?^4g4+tUpD7J?1Q
z25|gK&{6ahD4D#0qA#aTzHX3l4j=9tc~$*x>f{Tl@oxjso{`I`hhJH{FExHeeQo49
z_081DS5xCJubsPP<eRC7iO|&ecQH;jzKU_qhX1KOc5?R+xh5`qlT#y?)#p+tucl5B
z6jls_kC9|AhSuB4?EwcjJ_1zela9>KQeS;;{djxkwbWNHcV1;fW&WY3{w(#S+fhP&
z`)60%Utd3a{im1P=O0!tt6Q4|niw<RXgu7Vdg`yW&h2_+V&a@3UK=msCDs21{<qgp
zed)L94Pb2iPx#^D$1Z}bjg@=U=h+Zg`==KlyMAJ1<HAqZ?p!~$C-Y9~sV|`z1{`Fq
zWAnZ1huc>#?^%6rPv-4<g(l;Xk#{kCzh#V{wFfUQ-B7>&$&q(2ytVdd`^67lJWLbY
z74>DU#M&=iEL<NS`2pbHw)w{f_7D88Xl2{lFW<NNZhQT`7fbgs68^vTcQ^N_@9Koi
z@71)+A&isx3+wV*pOc`KK-lIz>h-nTOu`PG?CGfgM}xFqvPjd~_h4qL{$3Dx@yQ#Y
z@wJD5VQX!_LFd0yziqTc`+r@zvG$?N_4>cOn7^*R3A+Dw^Y<`Zx)`59^M%{A=l{Y0
zeGAWzpvN+Jj6eSR_wqY?0;*tw=g_~8e&Jc5C7s*V$nM2|`x`6WPE|Z_s$vKYsp9U<
zdyH19d(>~yTU1iN`;phx7eLbLJJ8H3psv0xrGDqHNHdpu_Cq&+47wRw`4eAjj9&Y~
z+wB<DDukl;{>DFR+?9E8<rA5$)cR9I%xxRLi~k4*lz(SqUn7-y0iRz2mel&c$EU`b
zo(`ZsaSg)Xx$)1@`<bnkY0OL=YP<URYmIgQys|Q>-bP}sc5aTbx>Pu|o}&?Qn>u-|
zaT`@=+>ybIbrLUipm%NjGb-_*Ru!ZI(j6qd>g_<d-to27XRndEZk+tuwZ^fI#^<*(
zmsjop{m0cOJ2oH159d&|Qyo!HY&F^%;~l7<RZ);$c5Z&0!6il6souq)r`Es48V%?h
ze@Z`%chD5Awl_{N(7@fPrqt0bhP$J2=4%~|@y^EQ-vU$a$b4tz1L~8Vn;*sxzXY6<
zZ#6m_XFD@jSN5ypooe^y-RfDOZA?<>Th(s$#9OS@cN2=nfktQM)s+uqu3i{qSng#!
zc%OO(7+=VI_riVZtD7InTm|1(?qe)S0m2sP&D8o2sUI}bn9SU!?jy(`8xo=`>ldiZ
zZJA@&QeXMs@#CS<Yb*ameZvqQ{J;LGjzdQ}Z2J0ahwUr+U)R?ihb(>leOrn3bJq?X
zzoveN>FbBko{!r;;zu>3zR&)q@#&7$%N?0lR(`6zZ9H*p^|@=AEvjGpi}gpYW!@n2
zQ%`*e3cB%e^}&tzk*0oO<9(*4J~wgJLroW;i_blB7HWF0F^@t`cT$J1KHEVbp<T(Q
zbtvk+P|Tf7yQZG{7f`DkJs23qJJPlt_4g7@keGuTPmtbi*4KpdTZX<~{d$K@V|Q<S
z5;fGzji;Ul|J&NH-1q@xjz$Ltk~R<^b$?9K4+%X1SvT}6q)|OfuNwO@riP|bLjv8{
z2NkOBg9e3QZzxp#Huk}+J>CIvIM&q)l3p<ZHMBm1*#($qI{~!uWCsM60cMq7RIj8?
zej|12MH=j9yBZH>-cjFXI{7<|&vil$AAVPTFg5<o%ya5DQYYU@jlZOx?aI6eg$&A4
z<8NbZY<!!f@K`5WZR$@Ds~+nFi5TAIOBI~CE%TCkHFfez>eNf90uEr1Hn9bqvI^1Y
z8t>RtGT$Q&4BmV<_0?xPU(z)2r(uWf-8^R#Kvtrj#guleL;Y6frIo)`U$=dJTD`mR
z$kyuRYnhiWyrs5pzLfc1eZOWPo|~9BYe>~*2LZO}vr~pX`xDX~>KmK)>Oj@k)dLt~
z5I^X(?)slMKHm5>47bd?D;w%%lu<u%*Xr9H^;a4f?qX=)z3?~fuWx?SR8fD9DVv^K
z0QY@(-p2E3!lD21*G~bJ6JWOJr``48?)q?deYm?m++82;t`DKFcGrhN)`$OK^{)c|
ztm5OJRSf^^YKwnXarkEyr+;>})jzxH?VnYA{Id%Dvr4mnR`K`Gf*4o-?CND$K7RgL
z#m7IZz(1=P{#m8fKdZR=XO%lV{Id%Dvo)K4wx;`M6}x|S^#?>T&p-P`Y8U*oN~?cX
z;rnM5KmTkkkbhQb_RrRSuKlyCKK|JwFQtyV_-Bt?P91mpXGh6Dd(728tHEgT&sw0J
z{@LSKQ%5dqzF)&XJ9?EsV_%`kKYQeLgAB_*d*p@GF~dJQO8(hnhJW_RtEpqUe|D7l
zXOFr1XLWL${j(NXnt%4l)zonp|Ez;Ew3Ix4Id$af+VPvpKdUtRXKMlcvlzZE{@I$%
zKdZF(X93^x&nm9|*;)+#S;gN!TWj*qDqR0;Emr^R)pvqw;Fk5TvFD2Y(QKF6(PP^p
zwfwToCwn(7`3uY;OWq>v(lkEN^O2va?_7O{d1UX$vVHZ&$5OxZ0@m}`D{UO?NqzBt
z_@CK!=}W6WxZeI+>e7kpU${Ygz_tJU>W@>G_NOjASb(!&ppg0Q%I6E}T^nnd(g~6N
z2j5edx(jeV_7^g5r`G=tp9^Z|#w`Frb@KS7(bZE>KYcxQsgpr_du1Ge3hKz_F;?ZL
zRFqzP9!2hA(5_+wkiG3JsQWhl6Z`Q4r~yc+OJmnjZRI@%;N|P<U1wJ>Uq>stQkO2A
zy$+XgN9xkT9#;6%*9w`Rt-P;5eq?IMBKgxm&7Q_U&&Gd6#Ae>bkMuUR{$DcUv13N=
z4|M>zsFvD~0tNNSYjAb~!+ohs%X<h^fq_BEf_iB4)1VHtrY?<wI_$W9kkNcwL7lw5
z@eBA_L%X~OPCTNLz&;4DsY{;&f$tK5pY8bop{0*#>LI<*lh@V{KC=4!p46o?kKms%
zwCu@u3UKA77|+RFTTq|q*nEh7{b#6GP|v=Tx^yRfNL@PJQGg@(0U$-GaXj~IzMtH<
z1@#=BJ5!g=GFZ3c1HPkPH?<LaUYG6zJJDTt6yP2{2p|OFLZ+bJTTu6_-%wvb-(L7H
z;2iGNzpZ?j`h&IWUIv4l-LIllYW@3+t0`~*jXr=b2A`<#!5-a7{C}W8>e6k6%(3gK
zulxy>J~VoL<rkQrc>Pm*3WtvDfrI$(*oN-<**%8nvHzKWxO4pxlxkmjL*LM~If&QK
zT`wFuejN_tzr%*^;nXD%V0RH0R5Z%wAx>TT^d4+b72qL$ix8wPJ#l^YIrQn)g}2}#
zerf%Y>zOxFPyIfessMye+_*^o)fYB;4F7O9oaN`><L&Tt6HmFiiMup6@gChx+zAkS
z?fbdpChj6PF>U*HU{7~da}(?D$W44lqoW5M)w%i0JQwjE(?#6TgGmK_vw!1T@6wj;
z?}7hq?XO_!z>e;v<1{1-<ShOLU@NE)=u_7>?!eEfOUEFOr@$H0V@%&5e(ZJX(mqIr
z;o^n70nj+udWAl~%}Zlt{Bl7(wr7L(?$G`C4r#RkBYDMu8V5XdVlyyMW%_Lij8+yh
z?^2c!+Y1Bm**zPhCSIb;a9m>?Xt0ifBDdzT*BCi8w3^xn5k~v)g*EUj+|SfPYMFZ*
z&f?R91<Rq0*#J<<r47M?PrG0_wLvkUlUth_3%@odq>hc>LSLb$GS`{!8GEWW-*X-=
z;{BUB$7sQR%Q)@4o<J{92ddw~WVNzsb3qr>yHl4QxrX@^UoN~}fDii5;e&o3^Fenb
zuE);{ebV$oLqNz2efQHUK)?aLXZ6`Vhq`*|e}O@hy7X%p&ot}(P(^FV0llaG9n5!k
zX=vZQ@ME~3uaKlOe|Os-Lr2lG4h8nF@KCHz1v-rW`1_y#vFKlg^snNpe-);GSDW;&
z;--HUhyGo4)xWD8{i_7gzly1U6+ivE8c6>te)@McnEoXKgXv#|^smzI(7%ei{#AJT
zSMk@silKjNPW@Z6>tDrF|E>nozh5-;uhOJ{6~6ve{Pb@vsQy)&^l$CwTK}&4>tD8n
zb=ALYdD^UhN16UT=AnOeU@rQXEr~T?y8dO0Vpsj!gxFjeqp*kmHSo6TUwiYK^skMi
zaZCR){{eI+Fg5F68(lX2OHKsnAWi>{GW~l@*S|;JNgaF1(7&Ua{yi3>{#88nZ!KB<
zt9a<&T5S4vH$I8X@!j~O-T0*4_@v$Vq}}+WUw{7Qick7SrJodvpIv<li(=RKS$t;k
zv#Vb5vr2RPtl}C!yXqD{yXqf5i~URg_*n(<vx*TvtF*+=D*o}atA6pb47XSOEbx9u
zG2&+xNBpeP8b7PJ$ImK=pRKvZ&(^H?S*1CCb~RZ1>=*U;S;akm*4$6^j-NI6Q*G{1
zoR87sXW4#gfcROZDSnpf|D46ou6oALvgJy1{485{*y3kLDSq~tOZ==>yD5Iw0%?z*
zWs4ts{487dP;4urQW1PRd5!rfP1I)mEL-kq@w1~8KYL7zpJhuOEq->C#m^pdiJxUl
zzUKH@w&`ib&mOswI^GgLYqY_LpFRFk>d2Ld@w19&{A?}R_*umxezq28{Oms}{j__&
zWA}W=)9c>)$vltgrk{4#PrK`<-SyM%`YFNlhr8=1SN*iRexiH<IDfdiev0?};qLm$
zcK&d8{iL5ijCuWZOTYlkmiSBSeEdP}e0&eZVN&vqY$qb8^dvR+BiIlwE}V`2$QAXu
z%kSKRh)Wg0ieDb<Y-{@!a^0kU=U?A}uuDqkk$URHd)PtvgI61iTaDkm_ABj(Xh8r%
zSM4_tXY>BXLmfcSi9_sT^uu0!>Bu~fc$iN0l>-RH`VzVL5V3U#F?s6Nfmc%N_fdpl
zSC5)jm+6=}9TncMR_Sp3UbVWlL5CjnIH1Pejl&&{I~$+rz!~q3%nRzP>hlM_om&5j
z2D6jFeD}cfsrA1nm~`I1S6yO2)ro5q!>4|73!!@(6isRn0Mx1VHvqvZUk5KfM-h`9
z>XTcI{f%k|nzP)YHAQ{%z`I&f8Z@dyJ)l0`p?;m!UFuMKSzZYS`ke#M0aa@K-y)ZQ
z+OK||j>UJYhp(Y%hkAGm&6w0OlHAr<=s<+mcMkk4wf@^E%pwp|2y#@F4)vCeI=w;%
zQMGpU)6|+S6xmM=`z%;QDQ&tN$F>>^bg&<%!&U6s9k{;oi>x4VxtI3wR5Sw2RhO=*
zj~WLG8uhDNjSE+=H4b++K2375H}iEIkpFDY{sXV9AHBLo@F<e0G5T8LGjHL2=Sok8
z5~g$#3;vRLcCbesr8DB4>L{J|?%sGWIIn&arNHe2Z_}&PI!ogL=qT3#>WJdKpo+u<
zk$)=slvuO;7T)Yv55Gpm8oh=f0sQ9;+FoNVK?g9-{u}D{(N0xi(TBtj2A4&~0%8|_
z?SNDPJg5Y-5#XsF0`Tqzq@a2&^S1ih0YtmrgLp6XPB5E3K~B`At&JNbKd7a2s-I`j
z0SiJ&F!myn7vwe$zXtYnHV(gq{~pKyHmX0Me&fK;R#=oOqjXq3PEgS(YTI6FTm9RJ
zH2rp0W3;>R8Om5eEPq9X&;s51nQwPe_JYPEKWdEqWaWX(8|pU?yt|S^tgU*sTOHra
z_;mOu8mu2tM{F#C2`G2vz!v?wQc~|xPv|}U6SevyP0SD@e5|{%uvZhamE#DzQ%`lP
z=k_uY+Z?9h_c(fBFTqepwPqe-%>*fr{{&HfuOGO)k^*qBi8|}>Pt@fffsT$hQ<b(t
zs(R&D3#ljn49~Ol%MJYSBK`2U_~Bb<<$fkuNG)*S3Md-wSh*|ny87IKcUF!9<NnQ}
z{@Wr#lDgFQs7H_|0)#w4(zieJUG+KQ`+;}Z%RW|yK7a25vM{ON*gOnO&yE{K-+u;z
zhUwwW)Nk(5i{h|4&eyO1K02DdXb3dv+pB)E14HOw&l{=kTQEowFOBi_M(Xai8z*~u
z5Vd-LTYZ1y7Bry)WaGcC%?He=L`p^gW*^FYehclQSp!n1V%pHAr1Z1@4ihNFI2!ZU
z!Bpc+3g_8zTD|iS%^okmA0gEjey9@LuYct0#M;#@jLDv^Ix;n_e|n2poWX2y_}YOj
z^}8#7v-x=w`_oV3W4G<sr!!wyCe|O_0+fynMEs#^@24s7m6acEW)D5NrCw3rct4U^
ztXFA>QaUgzGn58p{n5@tOP%WL@Bbv#dVOP_3TmlwSb@y<FnafD+cfA#a0}gIBS5_i
zah){MXg;_Ft#GEpc$yM_Aiu%e>Ptk}`a<W0zX8WOiDL{3Qie1>e~oh3s9UVWXSP;0
zGvBNIkE>tbqA3tMiirz5EPxvHn%;HwWGIhIN4*ohcpEyeo#jsHLa<H-Q)KN^2unuA
z`y1Kr36^fkNJW4I7hUVeI`J97q36_Z*g}?5Um8a1S=h4rHepG9=`Xi#+(<vmWFqzZ
z&m!d%U_L-Orv^});2yNx9G!?!z8{_6roO)Mhp4wc+WGX;nU|FN)aO^9?L2gdxDQ63
z=vetNlAL@G2=;C)P}UB5|2)Y<=G)lYdCA6I$iu|ep`|VApKB`OTZzp8S-@QRXa{m5
ze5#4vPa~rWq#G#{`T!rD-Kcgp9_`A|wD|Uc@2)@8x$-xVXb`6VX*{vj_|!GbWz>UR
z2d=E2-ny`<VX6Jk>T{4=V)Yf`24i&_v6`d}0r4dHKz4QGnV%t~9Akm8F7?!ZhhH~7
z3Vn+b2OCdOl%$r(L!XDCmoYopbs*UjG(nLHM5S)^@oUhR8$TvJ*wN!T-@IVXH<)X_
zbKpgyvLTU$l3M@Y(3P1t)$0ddPOU#qaQ617@5A)6(V$-jdLRSq<K63L_fw_SZ)~mp
zgicZPkWid{#LQfA|3-m|A0!%XA#BE+_Z<D=obxg-Ly@xi4m}Sh_pFb0<3CIydmAUT
zc><hIt$%?iL!V=GlYoNt7!3#2tKj-x$id60uRMbiY=T1`6l(r&wq?#hx1sidE9w<6
zs0VoNXSH5dpHF?|%P7CG2U8sdR6mD_Mh~pk<o2mme17WL)R+DRO8g0%o(6h0KcWc$
zFp#B?q24F833}JZJ4s&A4XLMQNm0JhSm<gz(b;%k<8(*n`{?Md123!JTKNusqIPyL
zDs_2M4?>-FcC5bLS^vYvXFFeOoauaP_3~Ec`y}NDUcT`C_RE{=An&QWXlDLw&p|Mp
z8a_dTO3N~}`lsC+uMv;lgs})^{nz*zY)~KVRF{~+p+0g=eSFK13eq=MjIOzy!H?Rn
z)H#24;BspH4^f|SQ|INz@8Jb>?tW4XT1TYT|CGk<yXcG_w2A^?yVPM~IJ7xN6IlL$
z`W}?upLrSI9>DKVYv>9nQN1Tp>ncFt16gYKtL*rQdWvcu1Ygy=H|G%F{(+5qf!i2+
z^gn3@#_8)+`x8Bl<6Vt&osHqfZ+1Y%KY!p|wX0|4RjY<(GC%%WW0|p)6}j+Z^=|6B
zuAa?*LzIK9G&o_eY&FKNWnNQXJn;S0`hP<RNZ4*CvdHdv^csw9{Nxy57*kJv-4JfZ
zS7Pv=L0f<Qz{@M2(HJ>ELWu-5`^b*H$}FJ6+V};#&ULDbU7KmG<X$RCr--^6XUSg0
z34xy-cyZ+(D$NRlsom<QuBk`1j9~n>Z+5k@=Z_$(|2G~P3y~o_^v6Gb9t)X&eCwyx
zmi5zW<n_~P%lc_G;QDDb==zBr8i#1|*H5cK)=#VPt)G-c)=!GHep(e?KdmOSep-!Z
z{j?hQ`bmjt{iNvYCndo8NfB8;DIwQSN_^`lMPENDj`b4`sGNbW5?(*m0<E7`w{iW%
zrX<nzQ%!jNq=Z^ODbDrNs@VET*@pE~jk|tQ{;{v0l(6fkS`6zag}Z*LZTtFZHU9O}
zs%`zWdQ+{RR=Mk^F9uvceQ`(DPfD2eQ!V)VX*J^dX;ozXv>JW=w3^uZN#U%YY9i~W
z)i~Bqis$-C3ABDv5?en-&d+S*|Il+YKaBJO_G=Q%93b6respc#@g{lhzK*os*ok_L
zcA~Uw%yh@X>K3vwZ`_I>v~0{HI8se_Bz*17RQGZ0LBWAgyB|N_jpwe^M_*XzOMUdE
z)R&*cDiKg`+i2j2r}1qco;&FKF#Apk!U^lfEBFC#79OMD@SMAbg7|@eU0L{5f`R9b
z%@eHJe~pE^{)!dEH-dU4_2u8vz7UAJSZZ1P0GxNDZJ?82u~y>EDI~}E+UoO!2f3K>
zFEYM<^fLZGx3$nk6rM(*vmKjL^z#&czK1Ho)6snko^ceuvTy>gj&<OlJ2xM~zi9m3
zci|&Ll=|{pdgJl-)U}QOSNm<8iW7uWTR_LCxf5@W>-m}S;pEp)r2AN>PR&~yH6KNx
zvz?m{5;YIv=WaZw-a<hzqI(>LuPl5Rua0%%pU%yL_;;Lsq_3ymGBDAb<5Y<_dnfAP
zzwU*DsgFLl*oRLb>u%~C^_!^&o?E;>^}yxL58>Ow2k@TSh8}tW8Fe4Hoci*Qwbl?%
z0JIye);b7l$}VK)=*C?Olms51ZcBX>PVe8oto?S1^}#;%HS(h1>nAC@ED`_a=7*49
z!0AC%uVmg<x=^Zf{gbTF->PqCws5%kZOsRRFJn0NPaqfH%v@2>2i-)C;hzRk#HKs6
z(oOg@{FJQ#^<Sd;wHMbvc`fsL>Z!Mol>=Z%QtsOLA!X}$;JJ-`$k9O#>~mfToXh0p
zMgf+?xyR<>zLR`vS`KIC=59*i{C;=_?<DtI*Z<Gn+rU><oQeM@H&?ikE9Zi#223^3
z)P|N~q7jME8Uo=(kpy2rT{WN(#iF4k1a*TVH_#j}*V5K)`|H})?Y7&l?Y3;!g0))n
zVnYZm5U{+qsI9fcYb!5X2;heQ_nDb<@5v<rta0)4-&{C(&diy4o|$K!d4J{^Y95P1
z>2_@mG}{kRrxKr7<f@V#wM+uF-_CbgHR^Klf}x#c%Q*z!Es2vOaa;=>Ctf3elSS&K
ze%UL(04-C5i0VViMTOuy1(vhrkbOtnA-fE5L6Z41Q-9&}1xN#58~I8IU2Ulw5~Z<C
zr0in*rrq|<ZT8G<e5NKUB-8!vawM70BCjGnAq-yR>;ltHf`CyAGJ+?SDW{bW5HEww
zAeCyV@ECf|A@m)@GD!K_V+?9{mwc$&G1K23rNNM0i$nGWEqV3AjIXhU_JAz5Z740b
z7ah2SKd)axWV?CG>-J3z_RX#K%oh86N%SNU&h9y+znEm6%%Y%&MRx|gJemndbbbVd
zG#8;+u;3&Vcgp8WB?x?Yg*Y(yj^EiiF*wg%HaGprzPa6=`8GVE=_sQ{3uku|hN2mC
zC-ix5+(p19`{rHtOui1f6JllXnx-T6ps@?$PuK+sr7XUab<<Gnc2l9m9`(_x>7+q1
zgKa*k$?dvwtNNuHhbbKxy_Y)r4ydiz25vMMD&jt4)+}w58b>Az%_kYA{+zoC=^p&L
z*saMLItM_QqAgUDkYACIb9uxhyd>mJWu)2@h0sA|vAUU1)0EDLBx@fQL)NPLN>%w4
z9h*EO*#()#vxa93{hs_j!1d0oeL^6iFJkUfNT<V&c)IBt7Rq^?qx!Z4r76O8lD+Z;
zlKI$Ctt;{c>85E%&=ontE8TSFc0_z~2iGPLY*7x5^LYlAOJ_2czx33PL!RxVerosL
z@Qg4Q@C;DluGZnU=y0j+f8a&Dsw;?=$}_8ju)HX|E!DROHl6{o={n|1s-`JF6_k$(
zHO-HVY7Lfw?O)RlC=VJykjWiHr`tB)OFE*#?QCN3W!iT6J1M~T23}_EuRf30*6N!H
zN>^E~9P@At;wjlrkQAQj627JSdi*8@_>&eZ;xGIdG?1^Fn!R#xBC#bM?SAc=F5v}7
z$$p`!(j@7cyg%yS&NdBSrfrwMlS1;Hms$I&2dQL?ll={X-VlmiuRNyV2=SEcBbeG2
z2VN`jTB>tR;35eShz&E&YsD#zRmna<ugF7f&}2a&j8Bu;z)*D-Z;eaF@R8&WQU&Pj
zDwke8o4*aQOXYiY7T+Y}QjV?8PWfW5yqSg>KjB$`{)R+{V2mzG_T<HqRLH7I$Gczb
zqn^setN4LxQir|rM@UEB2DQPJ2*dYaKgteP5v*a!JI;PIo{oi&c2uQHsOYs))<qpo
zYxRG}*nf{-%w$lo+4`s_%znE38gLF0n_?1#WM0T~t_d#bDG7wvYhqj+f%}GzaH9}u
ztUg$<W6>t|8Vimr{%mZb1XY4&uY8`QYYcd@{no4n=AgR93zK0jiz0?V^g&{)omd;P
z!lnLvE!Ml;=y)+$U?WW%BBFg`w|hWziP`PuLsr}*zibG~_)vBC_KG2N)oP<VWW_hS
zGh|Or?TAXu_(u17+2~e%ywlnKI!3tIN_Dfp+G%FAbRM}Fh%cFLss4-8QP9Z%N^2nT
zMcQVS?<EJ(UMQ5XJRvv#gQOP55%R^u55><?6Mu`uU$iNT9+YT5v?#6wh%EKPYM)HX
zMEu&HVUJx8YNXk!{S^M~5hRXSLC@|qlqO5%mL`h!VZN40X-=q(|Dar=XrL>zs%XfZ
z+-F4iR(s_|I{XFgpW-FHxg6hEPCsd5IS>yA(k_T+hU}H+7{ty&Y+lik+F!8oF}3ns
zktPyW6mS~d&-*FM_M`kUov3FIm?EvsCAJj#mw~E^m^&Ao1K^=QlPzD_mR-bm(sM2k
z*x3xE1Yh@bYJ`^lEKt=<h-m}&Q?(?_l0Va-{S4Bzd6G<eTFI~JYmvkDp?GUXg%kx^
zOU2nPdAC;{A_Mq~Tu%zL{|T2wszz03khD{h=`>iv24&8!>cP0=p#jL*7{iKLPAlki
zb1Iyok=N*?K`N25<t3z~(q1X64R{wxGNhFY2~%6D7vuDaS0HvD1CI-1bK|0|Uf3L`
z+b<!!2rU<GP&!20=MF%K3dYcs{jQAv6(1|s!e5;!KB`*ZPz{e6_3(#@n7Q4_vcB41
zKSSw7$MQVEQ_kc5`o;tH%D(Y{2vOg7050^62l~bXedB??@xcG-@qpZq_%6DsYCiAY
zKgA^e`hat6MC+Oq&UP#rmip{hWejoR&ByQI(o(Jrwxbs_0_E1-Str`ld9&A!=U&kn
zzA;<mUeW#BC&rb*TpQY?t_|H%H^b)~9J9^7zS*9>murA;O+l?v27KEY&qZ(b<(+t*
zHG3=e>8|4?XJcLJ<nW1rUHcs2oI}w`DMe26*y5mF`%OITwf!Fd824qq>E1(Gmpw%8
z#B6zd?hx+8e68l4l#Q_$b<$>WHL$bIp0<;uk!VuDC8y+N$e5kZZgo%V&bl((T)^3g
zFL$3h&2>Z8aLeiTx)~|$G6E(?WHH5qXGTih5Tan<|0MLv&t7}0k6TrD+S3~ClHCgb
zj8v{D#@oJrcO8GHH`YmXVV*)E%tMFJuT!aU4-yrBm$B1H-9y~-2|IT)Oyv@}9d(18
zL-zDnuNG}l8Mt!k>~!8iOb}k|>znEzFn!ya6v`oXug-@QmCKJAKFP-n5>a*{DZPW-
zLM$PrD!W+bJ~<d{F@-JRe6V*-iaRcyG<I<iQ@ycwtUHkuc`m1{|HLE4SV!@=KleOR
zTpn+GtWo5G8#<j`pSnKKaMXuD9zAEt$5Nk^^&jiRAF%qtdJ~u3wc1e|)XoKRvE(_t
zajABse*~4_B>|Kn56CTgCCvHc?%D13^!*Ortymbgr?;WhILjYh66999T3PgomIU%n
zJck~k70d4;kV?lh;G8cqNt&>XO=yR^W@S^r*<P^Qu6-0AG#k?}TK*<FwgIP!bht>I
zAa}O<tDcKYyQG7ioPt*FpF1A=p`?^^A4wPQi8eF00A7fSq`9hBY@d|)QC*k&f}IOR
zI1e~W{7NlU=a#Q=+s-IzIv0vY=t+2$QI%QTn(10}R*2<N!ddE4!X=`HDVGuwnHvKQ
z%SxKX;>nU=#AZ&ui7l6Dd!ZkBG*EEdzJ9YqgjZ2w<~G4i_Vk0!!l0OT-sY70okmIM
zMu$n!=cTAVxT^`*q{!uj!8Iu{7D4=SM`67ygO+szA|cNe6zdV5*C{Buqul#DN&foU
z!@l;gYx{k6+ru-L$8dN3Grf`Yc16-jPu?j#bQ8^C(KdV1PL?F)n(q#KLbLQs+$2M1
zA-%LT-nE;lD4uTmQq!QFS^r$wQ~%7JD9QbE(N0V$o!mc*F{Q5k^8~klCZ*l<&l=B3
z{c{3+*Zz4jOlj=eKTqH~okm!Z+&>rT{#m6mxqmL&Pn@Lwd4lerCnfr4GBc@5|2#qU
z&y%|ApG`iJ`{zV@wLEh7&*X0U=OXUsF~bhsKToE#cYkpGbK6nfJ?F%`XM5d^ow6S!
z_bSjsUq=J1F2uO5v;7*~M|1Ch+!x@zV8C97z42By=h$<Yj`3#s*lb_lLa$x!*yYX=
zUvx=7>8y{5SeE$dtl0pwVmZ2h=6;WO2mJ>^NCzz@`E>`~jE}kyfZIM=m;SL!A6>3G
zXkXPjd)>54-VHZ#EkG;w`H#nbK=;c15G3?E{Ni0~xr5W0rM&HR7s?$8rmL2#P$XyN
z1)Jo9x*|b$*phs88-rqtx-Ov$M$d%|-Ov&v&ewrC=|Tn}<}nB@H%@piWZ>$9gKo-U
zDx>ojNjbg$x*Nd9RWYJLF>N=@w%0ufv!z4l(h_>~a(C!7eY>;1+$rt1CPm%Za7eNt
zmo_lUh&>q33UNKm@z~V95w^vL8=5&i-f7WI*lzE%NQ^MU%|6xJ$NtJr2x29Vj4_Y#
zWbl4HWiG#y`uC*q<>}-%d|LTc#^>Vl%SPR#Hj&*4FnpHZp48j&TX}l<#lCfS@+&Q>
zl7f@uSKT_6EWctyUF3Jtfga`8VC+VIJ+zYL*BCTUlHVkQ=3V8NMpmahNq*)2v$*_D
zQ1Uy;$gdax>>|GtwESZ9yj%Hovy!-z#g$1<dV919?}jzD*Hzxkoh-`mg=-VO_vN>5
ze$+QVa<BH08|0I&Ztwm1QBwPPYWWMFJU?IJkCX(MOt#oX&CF^iZ&E!dEzqP^X*IVv
zB>@^u=R#(=y*@u@SbEy|IrdpjnxCu2LF}D+=jW=?^vut(cdDDqZs+G3Mbi8{f!8}f
zj~hKLG4pfPHX`P708-D-<+2H7rZj1OUbL6yTF=iX$ozbgo}U+OvL~7O`GolVd{Q^_
z^IkW7dY0v{Z+%Ew$N2cHZ++<fuMhRLe`bBMul@5o1KpKYw<UM`U)S_=ueE>s!*6T-
zOZU8lQo0l+%Z8(=dJ2A3WR)CYuu^uNcs)|m5t;RFq@Q!hV>#*^G%K-Ugz=T@gT`XU
zLDt$ajDSXrHdTQ|o=4)QDq6(%uX37Swj=1L8|glSLykr7#14j7AqqK1uox7Xh5e>d
z=3C4uF#&{8i(U4rdvFsSn>)n;F-S2M49<SB*dj{d5~7$8?KkkpOCJTIM;e5zSYwFO
z--OWw88aNka=?xV7H=NHV8^RMQ4Dr8+tK5)uz<ZXW$_C0WpPVh?Ssf*l6F-W%_>;;
za#s6ai0@5C7b`^@T{djSctx;ay%;G2C5})OlSwnvg*#&OLacYB+tF`J!aAMxWHc~j
zr=v{uFxg(!h`*O5Xvqc(I#s9^c5#$h3kfGDN80~gkhEg^VExiO0*2Ip2(wGh01qe0
z@zJG&osc%%W$bYToD?SK7%CZiGs}2`$eF8t2MlH)AhD0TyA#-Zxn9``Q6^`?d`Cl!
zJ05FyLq2k@WDFY~kyPyXU>9l|hNd=)u2v%YYR7-EQ**IDd^}K<9hrFX{z%Qm{~d1X
zAoTVjvJ6zSH|0>w6Tvy8B@pHn3J1d-0g_;^SRzLkV3??twa`kp-zE$=gb^Ana;VD}
zZVouNVeg4;N-}B;didO;QKBNYR=P9jA@;@;<HfW@`w2LJJc%_Am;F1Jenv@UE-HT5
ze-mpL>CP>FXAHX=Vm>7U(@i&v@vhL)p%}`kBG4kggcFN4fmlDPftb)(926UC)88#X
zJ9Nlyj7dQWD(PHVe61gAabhVB9Ihb}Nv_B{%4tdR?pn{7rN!kAsX^E{J3mtCTF>|l
zTtpad6w7AZQL8GN3YN+yRb)a(q*B?kqw7C1WXDpQwJc|{nAu>w>Ri{6n1))jXcOeQ
zinRWb=RSBfk;nbH>nFX?{)9ik_9vXw{wzOj`?LIgwm)G{`xE{!wLjq=+MnfT*#0a}
zYJVzE-TqYmueLvx@3s9|)C=v8zWn9yZhyk3Z+|M!wEd}k5A9F*{kA`qJ+?oU@2UN%
z?1lE{U8Stz4!#-u(D!vZ4I`QxIz>UC^PD9kQlI>(v|1<rz{weP0!tsad_(o^>cl4J
z#<t^fHW7luf}vaG<kEP~CT%o_x0=+EqcS<NCFi(q)yKEg5u|PE2oeX91`Xi^QVVdZ
zKiq(&I=gl`IHPx>K=8aM5IFn2IxS8UA&o}M457U-`gwo2(eE5kyKGmh#Kq4#R=?)z
zwYXg@v4a_+L9mvjPRkG-0#Tpdm(mpbH%Yuc<<|Awm^%M9Lw_O6pl(iPanE|<{M!)k
z*)I5Ea@YP0{Qx?X9FgPP*;dHfUt?_e0DabJ&Yj6g*75puS$8SZUkEb;{+@JbY^wL%
z871I3n>T}wP$y1MOqCpVd+zL3`8-U5obKG&2oNTnJG-^pb7vwd>fG7XK>L>|Wsr|2
zHF5wmG$ZL;pnMQ1>Hb_G>{J=|o(q($^c-V+(z(E?f`5iTb{=XEY2gO{SO!pDy@yXS
z=9MR(bY@b9Uq{H~(6RhH{dq`LDbIX@Ds_x1CFXspQYe9qj6A8YOW%Fs4+w%f?w}6v
z*ek`*8>;A9Q@;H+k?fY}t)b`)6x5a4{EUFszYk62bi#Hh<7{)9omcHIyoQUoDA5lp
zlu(Qn#d`zZ?Z4)aBWn4gdOuZt<z*H}CoUxi1m@^Olafny{AY4U`(9j-jbfa%Bl=K=
zSk8Pqz!;xXus6(5hfwqwUyMBHaLL$bki!2Fy3Bq!WONASK+aDni%OeGqvTi)5{wTx
zJKT?QwzypmAMmZMdMIB-JO6xK4dii0wW#Tf{(k@HlnjceYF^&qm(<XElv}Y4beag2
zIw{<V#@hf=Nc%8D&I37Z4Bx9pnWW0;sFvzKI>$L5q}l^>o+4vEV{Q4yd5Wgk&(@^0
zi>^B!aH*L$LQ8=p4l`(u+AIHEf0UCi;{)ygY$B<16N8B^*&XO?cDBX!B<0W&1`XYF
z6P)=YY3AHp8Q=7|7yRU8is+ZNR8LXJ`7>3HODMUi&c`V-Gc^z!0nqgMYK}O3M1A7V
z<PMSSKv&6r7AcdbfaJ<a4KaZylI8vN$@k}l+g)l;pL`=BQYrp_B;W5wmZnEAg~{~&
zW@@-9a8>Pizo7afQirRHsYr6(X`ramTCv;m>Xr8`c*)U8si{=J&|vkMPi@uX@s@^+
z&!K+LQPr#%O^`a^Bq95`AzP}YJ&=k#P=%slXix{L8Y6dP5YPr&L-jTCou|J<<<U*R
z$K06sh?wfeLOKH<Pg=M>HP){%mWuWUALYoXAZw|<O(Rn0Z3Uq^c2`}1uQWXzZuF42
z6d#p1d=n(3aWN$Pu>pl>4A%REPHIA9P`4z)t>mBUmkfnR^0+^y(w02#FU67=bjIq@
zzAg@Nx$iDa#^(*AW9z?e_+*$I|GlQirIC!+b)O!;iy;BsxZ>l!yD%A_H;nha$MDOn
zuKzqV&M1CTc$~|;k4x8u?>oK!%k+}VKi)q+_O_e=O*+zlI|qVgId1Kst4mKTwHc#C
zKc8~-j1=d<(!;Sq<8eEi3L3aCW_rri7c4!*aomfN#xv0ePY~7Vs5u<-iGm?VdCx;>
z-(G9i4Xo>rHovTqqV8V9Qu2e*C1M6TV?=Yf^U=DSvTb|SXQ(OmTA5|+EVpOxVZ}0w
zRLZ>zx7#^&@>*_JtTFIu16OO9vrNMgwb^<UR1qt;$5=lQ-@L7Pd-7OQu6Ry|dGz+|
z+2!`5HQ9ysh*jBw0N0PQ1v4+tX4mVNC$pF7m+xjj%}cC!bzZ%5fHa5Fu$)}q@LE3>
z{?b#L^6FU%%t~wHD75&Ir<CS!bG>8^vqkA6_7W@<?tH|4;ywh(+3V~~>#$d(BUI(~
ztopnS#89WpSFg6$`Dxi6;ILlB@p5}^Cy-oJZ!NdqImY`_CS_wRzE<c|mD_vX<?~_Y
z6$kL#QEngFZs+h?xjl>bP8va?&g@WrozG@3BPaH{i33?YeP9a_egz#ku4n+qSWRGj
z8H`)OxSaqL#i89Ux@OQ3ph7Wl=6a?d<#y*P#qsdbLVLwn7II}llYN62tFn)5!qFg0
zo$Ku!m(%ftSGWwWaCu)rkx<%MX<O_SGWS4CSl*mf|6HM@I_H3_#-gg1@)C*PAc<wn
zULl<MExBkT;jfVJ4I~`86(su5E<1<U$~Iv|8);`qJCj@rn}imLKNzm>T>O1+nkh>+
z)pD%>36Si%>38;1c(sQ(C64TywAQ|XQ_{+kc_y={0~B~BMbBdI3s~}a;Y4_S){4V+
zu`B>*g&R(UZ_3U+G3>xF0AKg>YzsGLt*Ez)x3dbLCEqi}(0j&+?IL0J+VruHkFLuf
zE2*iwfJNoZVFde_Y{6_o6jv;U>+Q2iL*5Cu&WOk(fQ8P^0R(l9rnRLtEWQx_6;h|2
z{SEsrNog4G>~A|dq9t~Tc!wJrB*h||irc?XEMGAXDP6JQk*x616qPwbQio?R9-enN
z?*yXD0(W~mh2!or<ehLfIt}e|$RqrEr$~0xKTwwX?X?rL>B}Fer)Kj!Ix#yJZcwjP
z{k3Op$V192o(7c#RMi$JRnlVtoBDA9I1ounkAj&?J*WoTJ4}PdSk!|(|AS)>0zlzc
ztf$arO$Pzkmc{#V1fav7xjEd3@ON%6Xj}XfDQJ;ZcAeBpe7%y@0&+>tLW>7WWv2)V
z;m~a1d+Zh|=6I_IOG4P>S$li7J!Yu=&HB8p_V*gMy>_@E%P!vX3rV|O+>}N!3%0c8
zqVa-x@rGoqQm$-D7|~aP^i=jTiM>MBsik;UY_Ojw5T+jWRSxwOvNRqUDgo`U5&@n&
zEl1GwragsGa$+cBM5~mXG^n^>xGZ2;FkD#n4S8q$wp_yz$O?@6j&@Z%BQS4kJiDtE
zv2|4!P{$uQEb+1QKzP$u#T%l7hWX8Q4zG!ZNSF`je;aP>EZDO6r(WhO!V4Aq8-+<K
zOOVT~nv@{F8pdVj)sMN@eyZNt-aWIovlmAw6+aEE(>2e3g|Lb3s$8kPa<)xjmHJ3q
zQ@a9>ME!-|R4h}6XHz>_rP6hH!v|1@XH)Xhp{%H&7U%6z#9PujBDLAeNEPyvLZ7J<
z%HKjfD5VUCAa?CfB;B1NT(N<YA<Um-I9t;8SN(%?#MxrMxIKLE68puL@PSLh4XOod
z4IjAXdFY(j_6LOYm-1#8A2gD>?a20Fokz9~YfQz83WbnS^%IT^I6L43B6dE<&W_ck
z#{QX9WJn_*iAtX$8**$KR-I$7_0^@|^<cro>>5?u>wL0K8?wJr=r@DxM!$6Cu)L}%
zZ%^#J)hFUvtNJOWmSw+40!eXmc>g8g`m7aO?cxTfVcCIeUXqk<`!i|&xxCrMo9*J`
zN7{z9Iju)_3_C*EWf5PlzsX2x3D-9iG*|try;jV_q(45YE~jo_>`7P^U;pB~8TVbu
zna6?#yY?WxGG<=b{|tBd>{WjvAgK&Sr*yWpOW`=1V#cnMy%yUcb%Hh!opfTwVW-)C
zVlBbB7a&yg7jhd-mp;HB9XEP%^!9}*$Sb#{M1!Nl4L%I_2bW%KujL@Zjhrduz+bd7
zMb1=BI~sEh!oX$04Rt@MuY=gtU|agB*q3xA=n{JZu{mkD*}-JL1hZG&0c+}L!nvR$
zWUng0<upfw*Nm5hWj;6|g?`94mVM`%br6cJXBo%o7`rqSxg&rGv0Z$CtVD}C+xEeW
zP;`PCtwksJaAD9Xc8L_KpF$-pjFv-g<HuqU?hY2O{*#!G4|_ay%*#t-93=T86zej=
z$9y%vcXrl^6?ei@`{>I0|AJP`!oHSt<!jUO_Kaz<pK7w#)^q;Mo`&hD35v;MWal+d
z^DXALvBatwM+DZ|oa0Ox(_oi0z}Y46pwphV(b*`cA?;PS3I}}7F>ZB%1J~h-1}{?i
zA9u^-ls(}lAGhkL{P&M-l;Q5uAgQ!hb&w_z>DVVUqs?E*aR8}?L6lx}#tE8V`w6iL
ziNw*RrD8EB;Bw5*=n&S#E=!<bC@p6_IbmAT80EO-v{uFFX`OYcbdw#Fh5yluqQQ*u
z(Q($~Xuc(S?b~ZMQ0rp97c8(WR3e)UmE;88)p24|Qq-S~={o`=b`~muoy|u^F>U)E
z&rf}P&={^TnJyX6PhDM?=Nwp3Uv=J;wtYDHJZ5`MtZq>ID87^XnA+?1On~F_gYet4
zlO_i_dU6mc82jM6OV2l1l$#^D_N-0j2aE+*JFRMdaIJsr)yxkXPo5u4d6(!;i<%#>
z@QaSawCs`CC-uSKk&!fR%>X(n(MA3!yZp%Ai2a{Aioi$(hq<@dtCmq&>3!(i7q*nr
zTw<$`-ews^f;XdzLR_o0tK#b#E<E}QJ!U{0j9D0FJUUH{>i!&?ohT~xrds^~<#==e
z<*ml}QZ=$u8r8_3ZT_@fYLqYXkde~xSc3&8$ph{2h%KM#kdz*BwyQ#Z;tg?ih)ASu
zadt@~x_AkL*}pJg$YEqA1P|Gdj9W>98Ge*Yj_Mh|zRLLY9kK2xqkqQGhc??eyjJd@
zr#-ZuAq;^lR0d}5V-17;^ia5?aPhN5|CJ177|=hWaLG`HW{l8qd;knsTrK2v1FBO1
zHh;u!t|v|fJ##ta_OvqIhB|r)6-S}S#DUk!EkeD8@C2)1pf$5y5pL)VAAM=@b6(n_
zz@z$cC=!;GIvr3C(iUdhwcqH3Un(_r?Gy4Y{cPgAEbkPx+%iVf1RIr}5xwtbp5ro#
zuD6SisySFDBjt1%DF;t57)~EX48q80dv~}=^>sV-NIP(%;g3GVBxA%*DauIZ^O0O9
z|9S58g4oC8&LIeXjP^n&v+5$c)}1sosy}Yu&!{>fB+jPxS7n&Z;5s2u4IR=#l1s+V
znM7?vb^>V)lHbK*87((@ZHm((BksncwqqmOq)S13GDRX{dHl@{H;LX<n-&!rNf#oj
zz(Ro%)Y&b8?G>Lzq*iQwgqBrC<GG73&6BZYx=3~VuL!Hg|FR7!H`b^jY`fZ4Xk%O$
z^*<pk9Cb&JwOUG%vwG5(V}^vXKv-c0gn9@l@;OrElj&sn-ze9=ihMF7Rntuw<uTko
z)ae=J{S^s$M}$yI<|_pai+@49_<RuQ(euGZN+h?Sg%LI-NV-&FC9APJU}FY#h>6c?
zk%hdi1kEZ)wZBOvw7<7Sja=;FMlmJG@MuSx+^v|Kb`w%V=x~#NJZPI;l(0uSE5&TO
z)@;G3<xd!Bub8Acnhi%6kAs`9!uCwT?3OS0pwadyV}i`{p`yw+Xip@~QU6NlgxZ6&
zNsi`mRN^|jM>K*y6zBD8rHoUUhrn;ztHfGHmxd~j5%t11UP(xsvR}5~zuvW*{~{Ii
zzjYz(IY=d@f>Hr1XcrFskDbG7<!_~e{tfmYf&J9j&W+*b&VqxBU+}UYMz{q)?G)K8
zXqD`ds!-KuS>FNXZ7mpMKh-_2C2X3+Bpe*i6bzWo9AD77_+`aq;m;OA1=FN9WZ1Rq
zgdHsuCbqBAcG|W7fjf~ym?Zaq1~6~1h4=xghScI#=NNz0tT|raL%P0i)wP|ScvaV_
z^*z^iiaV0|OR1HS3@7uKDiJ$Ka;6ia-iM?xsrNw!%pFw&-C94N20eBzL%x3T&Y+Fa
zxfC}k%#QjW6DF|=uoF=VR)r+CT`TidsiLtV^4HlifCdlsJA?~X<u<(L8_^_OiCvh;
zyS%ZVuc+U}9_TSdHDJHEo}sV(;wCd>XQa#M{hH@U)Co1Od`aGzg*bcN>7{ds5%3PD
z@yJ#d1XRgH{dF?_jRdGg=c6BZ&>0Z>Cn|=syFDz$ae$nMVj)G}&!vC6o#SxebKEki
zR4wfnH$vUnrl${PVWQ1xV;HU`4BOsh815V}De3$rD5-~=NX7aiZ7^2SkP-E-KF3c|
z3!19F0V7dgBOwEv1F=;?Jlyy$^M-=fDu2X>!s5j2kxUwH0cJVf%^8G(`nls1J$_gF
zAB#~9wQKvaa_F><IOuHAt#LqZsD+Td>J1`-nB{&wuJv;tB$gZXFT#ynGA<29C!bhx
z0;Nrf@`Ma#!^Z-P-ja*%YTk(YuaQA?G;<|9#6i<G7KGfNdIdMM7Hqdmwnr<m!m(FQ
zMNVt+>N`fxkNSTp-Ay*%#-?Z2d`*PLy-khrU3VCcI!6g=uPTFmFl{F@F-EpCa7EM8
zqT|vgE3@GKlnr`P5vcij<a`FRi-XR7%qR;tV##@C6dlFrtdt9O`edA&74c`oYxEi!
z!P7=+euxzX;(tfte>UPPSkL``{hX_@)fx)a{K4TCE@@6{P@lX+Z3b0cNZj<uz`Xi`
zjm*jI>AOJ3h`cb8pIvZB@Gc!0d&cE9`MoMqCUzQ1_C}Y$F-Gn!gv5&WA$!&5B)dZy
zx~qY_Ol24lM}yXQ)EA@U)`i#mQ|b-tYt}_Bi8a%#pmQnGbnF~^l~_O}XTgTIeC})w
zdazDiJ&0<89=q=%Yf>CyD}>;Fckmvd?FUsXH<4K0BHRSaHNtjDYqXT~HY)j;wwId+
z*E_qINdzAKXw?5jY=J~G(<Vgo)6Doi5{Ugy;URP3X6{tOQX=_@3{+`BaolOZxCsMh
zOq=LgTSL1q+`x2G3S`{lkx;=7J6bGJ?qKHTTJxlR9^>p>v7st7m5^{H^NW#jUo6;B
zv(E{&Unrr;zh^X`nD6fITkmJo-?!e+kfCqAzi+*tX0dO*zi++2+#aE(f_>}#ee3;w
z>-~M}{eA2G|7X|xAA7r=iBZy$e;0kAO0Pap<;nU$m8a4NTJ-nn1DzMw2in5+^;VYT
zvPh*&=h?<yCa*T?KC+0$z}77G=g3lwxSuv~nTC(nW{VFW)`*9z67(o5@$`cWltR#V
zvzPHHc71#f_<r?$lxDoq_jw!CtiNx_+hFHBs}e19=Qt_#V)TE|W~g8lb?;l{b`@}p
z#gc0US{JO&@AGU9{D~F6KYKO@-eL9cZCRREew{C<+}K9f=QU9L8l0`*1dg#bf{pe5
zcivzv@y~o@-Tn}IKYE`5&G!%=XZ}WO_&lq4r!;(IhfUTHPu7|Mhh`uza8*`wM33ib
z^3AFT+8VPq7(JdJsqB+u2BL9&9_Wv;WY>Y*?>$B;feGCXR1Egi2nXJg%?Yy{T0y!G
zy=Ld&)Eg9HwV%z2iZ^u<$N&q@oo|bZ&y(Int6`7PHefj;S1a`lWIv*7d6+!Z{x^&M
zk_VOu&YFJDLfLpYEBZZh@dtG;1Yn2Z@6zv4g3r#ITTA1$Q`Ocu(~W+Q$Un>2d#glh
zs(2e?aV%pG3*c&F4B@CiP!6F}#;X?CBb5Ap%6pSm?)fdsJzexm2(Qa~y=a%nI!-sr
zJ^vtO98U}{vLuwy@A=9Hpx<+|ED;<1o~gW_Lcix7*q@}|BMVXq{hoTY0h)!MtK}nX
zhgr*|<kUwhP}k8uZgp->Yx&S3Q6IH_4;&j~sYXZDNLK!n>m)Tz>03#S6s5XXDU+St
zq2jHL)LT^tw`-lBZ}n6QyXyQDnL=>T<Wc%QU+&ZQ>C^XlzxqCEzu=AlOVzchvR}|L
zVkb+$0i{DBy)&(Se48LWmWd2%eV>7%{~?<`4O2u7uYsT}Qm5Cv6Ah-yj+Ij02u>Iu
zO}A)$l!XRDFTLDen@0nJCJ!pqhcJddc{{q7cF`umWf!rx5F6}mY!tmgR6#VbFRnvr
zMwEIWUHQq_3KLFS@)qr($y=hB_%6bZ)~n8|O8aNI==;=NfQmL-oc5~mxT2ZYOc33l
z;Dh5`-Jd|sFHlNhyFhe*WV>K9%>@cPhsl(?7M`wEf6xGORe!P*sy|8-#!YrN`ahLD
z>Ho;S0V*?b{U6yLTsr{mA5?!PHP}VR)rMAh8!9fW+AIB^;G$FL|4cUeKSiB(k*oi+
z{3hXn*8hPAlY|E+>;D8q|Ea6~j~wPh7DC<V{{&tApMblE&?te0$x8nx=(0`g{{*_%
z|Cy}xe~Lu^Ctw%72mPP)ll6asr_=ulpF;m<QC$Cr>~`5KAXo1G8ulJ~(EqX56_k&C
zuyd)F+~^En`B<#ew=MmfC;<7C{!bu!ExuPTJ$SML5Gr*N8wH@haX=uU0Cb_fPH6zy
z>(a`#4p6x$0r{fiJ1G@W0#YY5>4T_HC;>&-a2F+@gQyl*XQ%}9x^>82`0mZ_zJ8J>
z(2Yu@<6FK7{h$7n*va}o{bl5u(hzP~MgyRgf8G_Th%5gbp)c>M{9~{9M?%medlZ1k
z!?;QGoQ!?vDV-fjqbSe(ok~DIp?f`z5|F*3)+EEL2xKZW>G59&Q$-<2DI<wi&^#sr
zdzdz;kvF4)Ggb@wPj6~Ytrisas0A%as0AtA0BRbW>b<BBlp<PVMjgmrm-(>0F1Ost
zf4ICyl_1f!RVqOXXi(aJ&p_Pp3w@x?GA!?+57gFy%>J*a1Buy_p45RhQp(+^1ASEF
zQmd*=Cz<J5MMc#kDPe^D6zV{$2|ZHe6@8$2N*_q%^)Di??@=jeEu!&Wl!E4qHi=OR
zayuWOw8C0HsQk<ognXhP^eZy2rU48wPpKd@Q}g(=3PPeg+l_+IB<O_NvuLjr*U=1W
zRr>g$IOAVKap4SggM`~}-0aCeNETFb#Al%>2rc}}D-;crBq^FbXlK3i9@K<><}Hv@
zstHZ;(3i}iQ2AaJhB`%IsEH<26o`@(hGZ1rRTvUwj5tMF|6bP@inj)+3(*=pQZ5QZ
z_PUI6C-V`lGGwn~+FyPurJ=dB3#U{X8ZVqmRvP*~SyM_wqKX(-8oC&PqkYOvsW&=9
zuCgs$z(Tpw7b@>%eW58zUw$15L-xA!$*FU&9G#&rp)QTi(3hk{w9b%>iM>Aw;OY<E
z-^=<#rQ!PJXb(MwD&{(Du}iW@6dFX2BQ$6bb!rVF?3w!*EWok24pDiJN<{AX2K}Lt
zMxS|UpkT9Id$Y_3IQWGQ(J^O>YQa&mOhw)@?N!I6oaixJ6(Z4B3@I~eoJFGvMXLjK
zk}5F>CuaiqND4FUCz^-{68Tc~21f*fHG8A}(VPZAmuNDq!=V*gGL~Lyue$=%`B;tC
z>O?+uFrX#oUKDSb4jU95{}OxMm~v_T$_tJ`94(u$1nCybQD*d1o1>U^w^v<@q)Gvc
zR#DJiCFk{wRuLLX(af17%T+AOs96KOSOW(ooMxFSw4i4t!pWKg>~DKZYGZVk50Dd`
z<p*Rt&9P6g;E2+((_eU^bc;eJ@c_|}LBHsE7^6(`_b)GKT>4hI(+^|gC>dq?Ykpr2
z9?=yR9_HBVhH5>dA!M7{iK0<?7fqw>g_5~oxl%R?Exj`K%>*&t>~)vh>u!UqO66z~
zT*X{}i;Cj35XoL8Bjs}E5@(0Z=<HS3D1K<QBlwX%lL?)xcBJ?*G}gc%k>aIb?Nt{@
zZwhnU-ilo!ghd|6yUdX?^=tty*iXpp!d}<E9MOo+7BZB=QD*E4Z-VW0A$#2v(yLXD
zNUyB$WFidQgJ5)yG9Dcg^_L(xU389qMJ0*Jajz`3&;k>)?ArUujlJ$%vFxuCcCJx8
z@`aC*`k8!gYe(<M*&P0JC#pv@e^--)@`7!4v_O4KP26Q9>12rHbfADVWU8~N?XPmc
z5B;QZ1Bge(Bw7vW47GR40B-+DhYMhWTmR5UdKzcae#01DCCwB=HXP#fi^`Md7nP@)
zUo7&@FUD1x`Ng>S{9>GUevzJ-Uu43#1@@|6B<2_U^!#E>e8XX4_CmT@v)d3~$5fjN
z_|p%+!x))^2&L|Jg_&tAkc|co7cV2@v72<MtNBKjId2e9=M7}Oksm*AkY&yr$b2K+
zoo}GP%wYr1d;<}?P(~PX*dSmI8>HJS<j52A4Q^_-bEZkE-#P3RHYrd0fpi(qk?LJ6
z+byhj=O2s7!yXR$s#CxmtgT?*;m})l4zHD4vv|iwj9P_Pxthrx%W@Fm*K!cyhu~Q+
zy8}#Uyay2iV9~i(`qx?ZisdGKW+I}JXyzZUYc^KglwHbrW(z1A-K3pKvSzY^OltJ$
zglD`7@=Qa>Mg_@NYX1RhalT!<z@3Ird1kxQkgNpL7#d{J>dKMOfI6Qb^HI@QKKXn?
z2Kve&IiC;^jpY#M6R_LV-T8#96KVvKu8t?<pEMuILZdcAmQIwavYey{RCS$?yx3(v
z@{`1TBn$pB2T;8k*_0tP(-=9Pkfn|%<g4Qeg(n|RkO8rbNz&Evgu=w}1cVEz4i<tJ
zSSnD0s^bX=T-W(Xp*fxqQpXdv5mwDd0=&ragi-`O*q$^W38`Umrc6PlpP|;N)2dyL
zCOjhukdHT%{N{`NQrx@Hg<p6?gyb;uk#|`3Ud$|I5Bmo3J%dfiEr)5k>=_Uy_NJEJ
z-*Q;t#~^uGgqNMLgz(B?g+g;!LDXke(k0`uIWRR{%}YWeB_bPYK9VW(k*{>GM6V7k
z6s9qVkz%F8b>|}rErO^H7YY06^zsFzt}yV76ZYNBM>2#XZgZm!EM&IF=OZC~AVoCT
zOQU|7j|97!k8n(gb0Na`o!<Ef1t8n2u)Cs8pq=xy0wd<CgTHF`M$Ro%NQK=c?MaoI
zj~o^^QxQ2DJg-a1>`_OCPg^FmKb#X*Cm5vu#^;JK9j7uWz$P9dQm9TaWKu%Gs?SK~
z^nB#Y-SZxfXQoL+0#X8E2DXr4ojV^9HyZtf3aA4N>2_^=K9Z#mFeJ}MLaI&B=NGaV
zLP{;~?)*Yfw+HI{LTFgx{6e7X`2|mFAT5%akFY7@&PTGG9Wo!mDTf%8{xdB@pz9%q
zr1^;SFy;_LDPo%+^~-z&eQ}xtvRY*hF_`&CdQ8=Qb%=qLVKW~oH1m-_>=g464)DIe
z^9!nAqW&|Rj|9~keWG=i`O(Sq5z_Sj&NE1wuwrn^`AD#v`N%kilnaQ<)Ul^S4eog8
zLp>j1+oIBEbGby(8P7*5Po9q?uz2Sq%m2>#NW<9TkX;*)*$6FyQk|#nrAJGAfE=y}
z1ITP-r0toFFsbkg3-8QF7;_dh>vKxXFJzR?5!OGeDT%G8B)iK&=ADxK9I{qb29%kS
za6MKN*XeN~$Iqo@47a6dk_AmNQ>(lp_Rk)gp83e+y{vEBMcZv|4U#F0(;)Ma<<l5;
z>-h-T!6FV$nV<R73T1w#=OgCeM|?igK&$1Mj}Y+#n2${62n6ZX^O2(e_4!En@0yP+
zO3X)EPB|axalfPQymQ}q=f3mKUG_Kn&O0Zp+Vq`wmQJtlymQ}q=f3mKednE5_nmj{
zJMa7<IqxjXR!RE{_j*hiRjR3=Yrja&GbGtB;ygpo_KVbc23LJ)fw5n-z}PQZ;IUs6
zO4u*Tbe_zXH8gwGf0*3`S=Z7gjP7NnY#HBJXJhAJA+G1N>mBrO;(HBhCC**ui|a2H
z#%_zxFuUw0B<vTBJ83^bmKZ}G`$a4<o@Bo$-Q7}f?H7gY6%mz2SA|Iu`bVBu-2@nW
zM(?od*VU$x7!*CdO`}4Tg^f+4gR+&d1`hS4&Lkv$=k6qY(IhLb(zH;gh)oJ*-{^IF
z7P}GHB7%Y#Ia=6&s)X7|aE*oj(au4ASr(EH9rf4@WxGIPfd^%CMN*Q;+T=mAx$sSI
z61|%Xaid4$?Am#rZG~IC+X`ksp_Ij5t=}a33F$rVCzQtR9hLTM?<mXII|``{g>hZ%
z9l4tcr7RhycWdvcKCzhq3(;>nc|Spq|JewXweKz)3ggs<LdMA(3Sv4%l(<4_Lm?xv
zp@3*1(1nGRA8?^S392>}5Vr?dX-OzJWta_xpxRJ~5w?qh(?VIyZ67OJvI%=fW?h?7
z+F6PW))VGl@20}zV3ArkO*Wd|*+p@GNBd~wm#$zNh<xX-BwUq*mbLA2wYH5gy~<+u
z=@+#V8x39bZK&i4t4J9ht4JzK!jRZKFgv6+8a&sj$$mqr-fuX~c0&e>-K8vRmwN0Y
zDdcQ7$Zn4+92Ts`3C8$#0~V*sbqRD)e@Yh)x$ThIZtxLKsXvt_>?1AI_K^zPM@ma_
zvV9~fqwG1TvhnCZQ9kcw&%s+n)YB@lmvop4Z+0KzC3Gem5B5yYzJr_}@$5UKyM?6p
z9Wvtk4uw?{-88VOUa0IRoqqd4Hh|KRMzl)e_LIb2>am~15@+0glG%PZ$$nC4(*8qF
z_LB<Pf1v$P`wyj_{f8v`N#522anSaY(p~#WY(9|0bhY(RD2Y{@lBcqt<k@;yh@6en
z_LB;eRiR`fNwp7RKZ)&#0c=mi?I&fNvHhf8*?+*S*Xivi74~R9saN(JLZ`H!RCtp8
zqy+`FYH%Uj4L$BQB=j#%vY&L0=s$VvCt(%S*iZVClnkZeDnI!he|Fq}5+xcy+hts~
zwx8tBMkW#ll<;5lrm~^*TK6`Tu!rheK$7hNKbs6<Ly3I`V-b)`55cWWD9N@cHk8;;
zul!WZt#94N7W+vAvzOn=;(5Y=QmI)=Kgobnu;w`oD79(>N=ripopA$7@k|Hg6vY(T
zRLF=<5i4csvEj~D5lpA%XS-<;DE5;&32WCrEo>VYvDi#_%jt)g6VO(aen)J-g9Rel
zeH^N{5-w0Ja7yw<0&MrQjgX(c==-P<v70e0a(U!7v7aQH2XJdUEj9oXxw3Vj3@C{v
z6NRF!3b{K6DCwksg=@!L&8}e0+Q`t@1~eEv29%@)r)<x}ev*_$vH_)_F`#srmmjYE
zB-uP5q1t{@QNn&w@O1W*pkxdveV*d$!GO~3eCo!4Qh1_7>0&^sd;3X?;`WpL*<DXW
zxchTGpNHt%AL!d3=-VIY+aKTvEE@NH_D~rC_t``3vxjQN^L_SE`|P3i*+cEKhx#G3
zhuXJ4(6>LZx^I7=Z+{@M2Hm$m(6>Ku>OGvk{eiyy0lD_0Z-1a~f55vb(zie0+D20M
zEBv3^A7DRioG2IFtgaMnvunqk!)6NS7oBY*Haa^SI#Oj_EPOnT&DtD$m7Hlud_ww$
z!4`IevSMl<3C|2p&dVm=WVxFySD74ROEkxRB21+4@zA2TIaZWa^QN;tr9L|CniRR(
zBfl}+Eca&Rx>mkIOXo%UK{61TDd+MtB6kKwStD|1pkSx7<sv!i{uD&mg9;Svc6Qp6
z8*Oe3&8+3V#m%)_qca0s3aK;$INL58Rag!v;gFd<ai?r<l^k^K60lc&u?ko1N4X$3
zn%=>EE+CEEpe`FJXyR@{@DADHbl9tMWjls5pK`iRXLogED262#NlxX6Yo>%B(jnjN
zRR=^*<`QR#Uu|e**{fc|gL5$4vN1{WoZc9247eLwAu=CW`ky2vpDnT?f8^mHbc2!G
z0tI_vgSz!;NC&qX;Uu@swObea*>lUU-OAUIi`Dgqu{7+F5(%`VKrXk;F6iK<5~tIi
zczgCpyJUa6SQis(2>SHVze*{hM&+J9%H%r9=nT2BEI-^3qEK_$vb)GBklZ=r{d#|p
zmO`C3nk|t(8@ba@q)19+s=r{pvwKME(%*C6%5=Z%7vAD`#;|3W6RO!j*>M3QsmhP^
zkIeF`8x+ZFHZ(}Q<lWgED`7J*H!`rG#o1_2-bs`o*a2BwuC(JKF`e})H?BxvDSNpr
zE34p`UD9Gtlw*WqUSawUxiwY3jGVxoEZj(T5gVS`j2g*|jTC#W>6ptXX|^YFrQv3Y
z1<OWKL|dFz2}}TrDgd9H6laF;IKWkm*wFZ!6ek~}{)?jN7ZnMsf|$<=xOXxNzXD6I
zQKgm_dB`7`5sZuv6f`?W@k$@kW<SN9o=zh+^lCRycI2*h1Lw6NgkD1+(0&(hl%H_Y
z+2$N;musAy2B|sJI(yaAuv@s*5KC2tJIp2}MH6IqRwQJSKRV$=__)t$vY)7y!YK}L
zfs(LB?fYg&uhX}IX0gu+R(&ZYnGZlC1A_@A$ge%I(=OQtSLA?r4x5doerNw!a{Xv|
zG{1#9%7$!_lG%b?OD9OiA{U4VJQ7r8DDfT%6daS{zUX!-rzRYogv+!iAFSP@WH!Ba
zPgR|qB@M(LTOIkV(?%7KJ(<YQm~eduoSMkl>DrIN1g5ywL3>a?iXz*YA|(=Z0?z(V
z6=UiU(}(azu4!@(Htb7PTl^xA`3;ep27lySDH8}#nc3ENTE|Mej=(#|hisG#+R+V^
zsuX2rgHC{Rx$`jBOmXF8CRa|1*~EPAy=wAHOy?*95{hOv)$D@d0kjmzghO2gQ~NRz
z4}C;yq-P7(-G4o)eXY{%Yd*G=xbaC^SIo7fk<5|ysy$MA;-PMQYT{dZEJvqLk(Bl|
zAnohzT<106#ELymlL)c>#CM1oJ{IEMCu#xrJ_RpAS_>(SY-w=DwT9PA_OsnaCu8Zt
z$c0Km)N#X5WJxem65vY9ZJ-McIcR@b=<F`oNEjjJw<qrg8S*KOZ9p1Z#E<577R~K3
zBtRYJrKz2~QR*bY4<_Fi7O_>ZC4Lg5l0R-YNx+h1<WW^d1#MjRMGYTv%w9f>VkL|;
zxBl2wCjXcP!7Xufk=e<cgb>2DO$9{$3Jy5iha8hA_VUeACbqP|uWI8czr=$JnYflo
zwZNIJ;if>`IEtiVX$h@Tj#A2q{G;?Z!N_%7&qcB1@;QrCeYp|mW_xm{YJs^6j}}-e
zPOa2mq&gUAzlAp=&Z{E>xM7QHt)ym<?Djh(Pw@u$zoei&$3L;}X&T^c-2jiF0nTyg
zL@DtgO)z+jAQ%Ev$+3&kvbsw!o!lB%zRIm^N$v4S-5!h5Ty|tgWW02A=`Rsq48i0`
zU8P0df&`?;u7%zhd5iR;XIpPiJ}zYwdBiWga@vL*6&%<DRW})icch@TLZLUwNqsRV
zlw(iA1L35nCcbprL3{aBVL=srcX1&0X+BB+94Me++$-HwE?qeunOv>9&1sYv1feXC
zNLgk`d(@&Y2YypL<o+uzH%q_9(;k~Uf-_Y6loiP%htd|`s(VuD-O`6_vA<kTPr94d
zSjx7xo|cL7t*y6f?~`(Dh_}azK|7p-?V_9_=76YZR8)J_58)W~BB$Z4)YzqNaj%xF
zI;s54awbSqHPRhcE|UT>Epn!Ak+Y)L>K0jB(is^WioWWB$k<3F9jCL<@9d=I&9J{H
zmRh2jEy$`29dzs4w)D4@RxavA1V)D@QYq3Ji2Nh1FI7SO(uW+fzwEZZLFyuYA=3uu
z0!3po5c^0x>FP!NAVe-j*3zXeQ?2cZ*l+-YWWHT4>y1Yur}@%eOCyE(k^iAkOnaS5
z?z41zok@GW)6-tRL8xw8>+>VmNgKe0baJ8Jkd1cu7gEO3DaTvrQ?$>1)jns?J};8?
z*{|B?4BF@RDnX;$<{VGk3|qbSe3s!<`u1gytw)*6lEN-V88L)Oj?mP1?NKe&Sx$32
z=lX?D)BPw-$=5@%k8zP&*8om)K})3|85o_U0{yjMQ>Et)MTI)tAlR22l0uWu5}aqy
zA$!mTJZVIgI?CrUaATalSQulzpJFic*ipG%Snk0oRqfEKucE4Y$R6C1ci7JP0@+aC
zX4^S((>i*>6=EX+m?L_bq5~Tcn71bnoA{5;RaXgM-y){1iLPFa-G$xI^mBpall2X+
zNxPe#(uD5;N-B`n7T2BWs*6vk5prR$|FNTTrLg_PKvAIGiAjoG_KFuFsI2;MkHGKc
zCgIr$o>6e=2vB;R-Pm@H-MsY``=)K?I$t~IEp*%Wd2aLFLdf5u&b|X!Qx{NQI$yRM
zxs$H>1Tj%>Ru_#DN9^qX$!peIjO?rI&OD}X2q4$$dVq%!Zxm(Y27ux!@#x=^)+{?G
zMte>*;WE$_a#^ad$Ie0VItTMCvkt49F72F~vS(8PLZocmW2EMFyYYC6PSyYD{50xB
zy_RHdJdrM}#&^EL5Fp&4?<Z~+t1f8wCa!(Lyiv{pJ7*(=T(QH>Czp9n5`o7yhFv>O
z*C0RLK!>wgIy7|iH;`np^3f7*$XdZ&oH9sad_(W$SNgRy?!&}ljD+bxsxpAI0%3i7
zG462liSV`)!<t2Tw&Ble95kXsYt|yS{>S+fLU7X`mz42hwTnFul->^~1WpDL4M%+l
z#eNL(i@92T<#6HRi=)?>>xP>c#kU<Ffk}2z{w9geuGmO)@1=QiwvaMTEvg$CUMi#@
zJfRq&=&Ob|JVL3;wJ=$WKk01D+dwOyo>xyQ)E&d^a!5tpgshw}sG+^TwCfwiG8m#5
z9al$P+KLf+T$y%`G{u(Gtf%D#5fU{48LPS1U{K!qYwX5@NZ?^4@V|9gH>vw9<R)s0
zOkeb{pO8ny+JCdyo%(&jfyJCKNnA=%kHg$S9mHOo<bUx%=T-QbrTEYky9)+p@E&xU
z64hrl<tQD2KW~pc>O%Xg)KvR>JGcGua6^_|++;2~-7B%un$rj-Rg`-v$D?tXvA9Vh
z!yq*WQdDHlC84-?(CMI@q&r$MS}|zFhDR=dvjht*&SyrkUrM+A_izIxdg5>s>n`F2
z)41$f#sgyMCOw+ITq3mp85HV5XQ@Ayb7aJN$`WZCywzzrvQxM%L#mu_%U3(cv{)6Y
z1<Tvx$*sCyxawP4U%v4m73|EIE*!@aWx>wHFL{|x4cAO>CI=aY?NSe_id~|lvk++t
z2!BKN*Shl8T<H9&@Jrc93Z%U%n3RJ2M)-ROWPYb%fQ*A`pO&n5!dI&4S9uq1trnRk
zP!Lh1>cD)dgB<aBVT)X2OI>Yq4(NJ%liV9#Lrs;?`w6j0)zW~}(!<;_?x~}JcpViQ
z$Pfo~LjEuD2ke7_ybKZ<CS}~BJ6JUwD=Mk5+#uX3F(er@`5V(@yvG_!qBIHHQk5<Z
zyIs3g@}tKM+(IhlOy~^#ZH4*P@ValrrY`n(n%{MHr5&xh3)u^?Q1Rl9@Ih`57JE0Q
zacbrE;O9xq33YAuOY+8KL!B<Oi??uR?-3z&Wb3fqOk2oAG+0-#sp|V=E`^7FbWj>k
zKkg51_B#hf@4Prz&{##zLq3ynv2!zq_rVO%oRIyMLcbX$H2N)7rtWGH`q7Py=E?Iq
z$tmj;FE*&#j<=I)DWDA`N!>G?xbIk>=qhfpi@98Q*sdd6hV91~rL3Kq3x=gJBSGII
zK{C=fmxM^M_+npyX`cBb1LlyZJ6|6tIAGWQh7NVaCTG8UTW}}$u)Zu(gmAi=?!nmk
zDu*0MP}4*vh=d4t2Arlve`Sgotl4L#h-!NHI4uE19b$RI+ybzaRy;JBaZCT|ete9j
zu67z_5G#TFU+0@GiMB^IR1Y?GE1g#H#b?P1$%oTXfSlT^7E@}`af745!Q+*|#b3x}
zxLaK+5~l<z+?FF$UR0+2$1Y`BBNw-H$r03z8atDJH7GhBW1Kq(W1T@s7N>(`eX7Z>
z{UK4on+m@GX)-|j0|5u{q`-oj-%3`Wry;Ty%hEzdY$$}JVkqNf_NcV#wCCZmI?bgK
z$YM-r$v06PPt0l^>|hD<2Kx)u<Pqeyvsvf4T=E<o9L*f8uP~@%oRP?LGx4U9=d|h<
z@Q?jGECtvBJu($+_^Z#50HK9Z)^MlKX||tuMZVKg!UdvR(do<|^0vk@+}4TtgQQ2q
z$1Z4n^m1oCLZ&YF9XvsiE;zXK_XL;%;Xw5^zQnd9;>sJ<ofhQXf{rT6Pl{K`V*f7J
z{mPn^M_Zk6LFw^D4(ye3heI^|aTlu~aJEn{YA@%5-1;l3{1J&05h;1KeJK8LzU#HW
z<Wv88l>fbP`IohmK)91BSu=6ENK5Q|7LL@h93%hVB}BM0)V=)6@<_7$(@Rgr?jsf8
z9KK@mKOz4+`DXJl3{Vx|Dao_bD!$^gq!!xo3Q#3%@l=50U`q(Y1|pRR8N2$ILgp8V
z8X(tNbjg#d0kW<~w-Pcn;1iH?Yk<pn4P`E;>w}!Tf{fG$KpMnas$VDG03IqtsOFXA
z3UQHC2*RogL3nSCFer4D_=Z#oJ&|;FyI<@t+(Vv09<LCyga@7q!SK_=gI^JGs_-DK
z`guOY)~O;rLaKF*NL3WT=cy0Bm9M%!5WD;Ozy~s%s1I9cIHXR->jMF%2;D&SRzAfx
zcVVEe4;@k;2uE=b5@c?D2!xL!cDg>Ks#SCvQo;pA3Y1*fE7eUF>8%E<AUL@`Y?L@$
zXNJ`5Z69)~3ei^|`szbpeLx1x&r=_Q4D4i8IV19*KjP!q*|p4ihqOj+4zZ(lgMX>4
zoyd@Z<7dtmR&t{<nWHsy@?>F^#U8p5d6UV@koEp-85*?zls_tbhaDBOt!!ekdYj8S
zBzR@3U??ZV3jG}HWA(LKuZzlZ<}sGBn}=*SXd+9~?dWn%j?t<i2_n$QFkjke(mlmb
zco}oVZY3kmQ1HvJM$*M%e-#0*l5`G{&9*~M>yXB!pJ0QrL=sQJojenpJ6sxK={Ue7
z7rL~?`X|y6xiGTC&z9-_AuW;OjHTsJ=7b@Ojcfs2LS7a!ehNkc@Q{6gLqm=)y;6NP
zxjk2h;OLyqg1rfmL7(oN@30X0AXy3fvr}VfCpcs2=ha8np`)YOoY!+>+0kW^Iw2jo
zIYT&kE>z*i9U;8}%G9RdsIz0pk)>rA&1VsvfSOmbq#n5=7)fRAv!Fo*DN;d%51;pA
zN?(PbNcvGECPa=LK(rmKypzt<h(B8fKSO}Abp8~^1}ZOKte=9Z?lR$-%U5Nxe1+em
ze1+eie1$&%`Ko-s@>O|S`Kmmvd{zE^@)bT)`Kmm<d{v%SzAE3Zd`Uf7tnPPHBZw46
z1m`j!XaQbO{Sn?8tBV;t4CWcAZWM^!CN`z<z6GyAJpBlo#xq!b=2Khsc)ZWmpF{ng
zQ!UFVoIV~2+0PBxQhgy_&;+-HVqLKz=I3u?<c<sissU~FHS(ROzeMHHW5|!WG4Y9~
zx|)SgO(tBQ8tYdWV`~<wp;R70)>3_&MkK?}kRTkWeA#c1d<>Ftb%MmD_^8C;n;`KK
zd{s`QCJ!i#G41sUop{}~#y>E3QN{eZSvh&RS6+E}?&V`fX5BTXa^BpmiU+b5<&U}Q
zs{E_wj>x)u!JG%~$*P{WsB%93c~_0f9d&tD&b?Jt3oEa_?6Nr;$EbTMD(+b@ud-tC
zqPypfy1U~3%c?3W7TkUBocRx2wqQZ^{hwaAsN%kPcUNW2EhryTP@X?GZ}jNVSIoUK
zH}CR!SKgglkY8|R`4x9vkvs41c~{K6{EE?+kFYFdg#vD;JbZ(dQWHqIDCqas(d%U4
zm&qf)Yvs@Qfq@miqVvuvUg-~~`o<H?%E7x(zVSP+KY!dXQ&*nz1wy5U`w?t>@En%+
zv-rG#M}F7KA2+PVH_^qXY*z3&x1T4Bi*MUGUGTjic=(+veXpqyXO_O8^tSv?g)i5H
zIg|X}Zo*Czq+Rnn!OgF1$;t2h?)dlfuKfGa8Q|OU9`L<u!k(%;<jy7eok@92Ght7K
zZ{d5u_tY8StA7vp-aZ3-A=!01!~BjjVSCE2jD2RCFxzBt-<1JZo|}Ur238iI>dpYy
zkIoR+E2qIF^|r%=8Q-1U{kp5%Ws^qvohqMGOqg$Vhwn@M<M~{82DqL)16-1a7fiSc
zDc5A)-s+3D71?~=XTr)|;wOc@Ucy?cJqw`{Bfrz(6#C=dL)d#w*za^lKaxnR;C=E8
z!%DvDP1sZAOXdFz!-b^X<##%KW6m(#Y!j|b_@7)xH~1CbC4F^g7;cRTce%)~i*J(Y
zZ*o%O_;#9bFLcN6pXl-yx|YZ*zte@wG2v93o=o?Kl(_tqnsDz1K<b8@X43ch0O2O6
z{!nPwn6Mx9=EZFrLW#V5*M$3;7pEJpPH<Y5;QO@+_o?piU99nmeEs)(NMn}J<aeqx
z3eG7e-0uV?=X*xid{>#UIo+l6qC~!*>JF!y@82Zy{jv%7aCi9bPvCpogbSv1lg48S
zeChI?-|6s;GvQ8GE^|$|Q<aO9-zpPssK8_%2GZi?{HzK0$?o#|(L{cKXTqH>eg1PL
zx0ZFf^o=y(PM5x$Ot{mfuf~MCL)s=czi#=K%2-d!^><CU|JPl(RXSV_D1L3ieN)QW
z#pl*NyQ>U#n6L-CYajlUXdki$fQz48bsfj)rtxqh+>|p6x6p)}-5uQ<6ZpP<hT-Z>
zxKp)DGR%XOmatFWrTPntL_CBI;wQtC^US*q4Dk%&8EpJyp70U#ejzY}X9&+w<0o^4
zkDB*OfLT1lc!u)`ev$8woA*xurMyP)eA4)h1b*7QUk1$O$>X`)_~iqyH1Agd$M6*J
zTy6Zu0Y78juK^bFjOQuh5&9E(ip~3E;1r&zJl7gO8KcYiM#7fxl=95rxq(OgZsNJw
zyw3vO!gDLnZN~3*;2q|@3^<!-4$oaY5`QkwJoA1J@LrzzJog#D1;G2wdj)VI&*ym-
z8NVvvV)MQP_#n?iJP#Yc8sJi%M|d7Jevbi{^MrY7jo(V(7kKJ;9OD-OuHuREJYoD+
z1HZ)cWggiBmOT6uk0=Rzjpyq;;`a@nf983L=bJp@_idi1dH#jxJ3Qj|U7qjp{2R~r
zdBpGEd7k0<A<vI^#P7#EKjB%!^PfE8_g_5E^8AcvEsyv;$MbWZ=XvCEA@O^WN7PGR
z;;H8mzeb)Wo|k!k#Up;}4QvH&H1EGLa5Hd=dEaW_E5P5H_Z<fA0`4~NzcX+z@Ky8v
zx`BTLzG2?qG;klV-Mq&P{0s1}=6%0`2Z4vo``-*a0_-sF#|(Vez)k}tlPU7xPBrix
z14Xk){L>5^VBmS;d5T}EYC#eKQr&@*@k&*#iT8Uj;ovRRvXk6{lHBP@?hBLLLz3K?
zN$yLM+{2RG*-7qCB)LZ<xko0sFH3UgCAssH+*c*J3zFR9lHAuMxyL8DCnmWkC%LC4
zxu+$$OOo6(lH4~Xxo0K0Z%uOFp5!h|a?eR}&rNdQljNSC<X({Eu1Io!KFM8`<X)2G
zekjRZljN3`Gx1Bc9!ofQOI59C!YkF1mNfB8RV}L5Ev;(em#SJ<uUlH!#4lB~v|hKg
zwuxV=YIVJCX?YXBRMi4|-QP|)cuQ5Sal$KAwa8w#w9JWLs%o9RZfT_xzf{#yd)?Av
zCw{4_)%Loj^-la!RSWKQOG}>krK;B4>wYQW;4M|P><O<_)xvw->#cp4C)}3RVm*vI
z6!&Veg1ECh?w?Ynb3N{5xC=e*yKt9!-0@dlQZ4CC62DaIH`XiQpB?vVvC45T^td~~
zx6I>?zw(l5ZT32GZ?&?o;1ch+Z;Q1Sd{2AaQ*f{GxOaoU-s64}_ZE-48ux1+cl?!?
zRO=P56ZZ})1pWPS-xljT&{Lg>@@uj3afede04-KC__I9j$8o#sr&1mZa2I;MyD<f(
zTD!bX+`qHl1%Ih0{1domd)!&L7kb=Y1gVzv&WT^D^}4l}@XI{m7vf&+ar<yT?Q#Er
z^se!^6WAoZ($gn?sn(lTEAi_+;cv&i#pC`f_+In46R`!Kj1m&RR4Zl;75;m|{|J1R
z&kfUJeHM4f<K6=PERWj_DKOQN5l7;eO3C&Ef37F|*TGllaeoqbsmGm&E%*+4ow)yI
z9VGm0PxxBg?)tBk{{^_0dA`3udRKegUWBRE5w8>cGWtpUQmuCr4&G9&POBdLPkZp)
zfP0O{{RZ^vJ??Me-r{k45vF=1UHntk$SM&c)shib;>Y+X$t@$U#4pv7kyqlEYMqzz
z%L}#pTEK9h-+J?7iSHp^4-U|7*?So7>u+t!(Qa958t!YgT83-4tX&TG)mXRXYPYQ2
z4EO!U`h<3>zk=`KbnS6HV7M=6x%(fo)<4{5Tm8(CN!AaB`!-vXhU)OLHaOh(n6>+p
z+AZq_!+l$=b2GGCr$61wIZwNFdM~tQnjw}>?<>|5CVx7;E3MsK(!0ZY;sP(eOlxJD
z7vCk;FHMGI&1txAm$l{+{axdWShtPRZdqp<?)#lJ_#@gaBctKIZ0kY%<tKYD!+oEy
zF8H{1YkYgHtruyxtl19tt+sZ5O1ouUXt?intJ&~R;~Qxe5l(&@-(}VlhJUi&G~D+`
zE7%3!KUueR!S|+BWb&)aBi|||U-HxCag{aN<X4x+KI^TE^><w!->`OnTDx_5#H_<6
zzZ%~-Ybg1YpT>8M_2WymTh?=i`~G5Ocft2<>o$W=)^UdW_FK<%!8g%*;~X7d<C|<<
zYVhgw9klNJsQ#|g_g!oENbT0?`<r!V7ktyKAN#%dN~~|0^3dr!VtqZ+i|^m9+YCOP
zzGK#?F7kYn^`x!C%ihay-z;m{5bc(==;6K}Tl)rUx3p2ieQ7DT8F`lVsNueMtv{Tv
zzia;8ZrwT1i?7Uj-pISg_g~gmyWks;vfIeJtXmEDby~Z-l<!>Yg>yAN*@GGGyT_W8
zqusK8HQZ;VRA*_otaT6fJ!kDU@+@ms!+ohKi%ff=)3-n`)(}PZV21lDEZ=Y)U)HvV
z`(CtGnf%CF(Qw~+DZ4Mz-(_uUxbK{lOS|B!vRb8);HU8|vBnM4ZjG<ey1EO#_10}&
z@byoT=;!`F_DO&~hO1IM;{G`Fd@LFi34Dq^!oVL2B;00T8qdGLHy?`%Y2?TMEloR(
zyoi_xl<Fan;#E-SiCgFhbm?D%+xK*W{xqTUFRZ@^{0{3N2JR6^xZ}Vy+Q65D{=Zt*
zNZ#Z0@l*7Hiat=$2P*nNMc=sN`Tt&mzRLf<nf!m><R7T=PdJr->ZHp54@gUY4}FL#
z`angWKZ-t3(FZE}#vP~sOcH&D^NRmJGW3CpKH(I7kShBBkwl+9NYMvE!b$@w`ane=
zsOTHF(EqIP|0fCh+l0?+7|RI!PvU`4;GF^qw;Y&evt9(>eLv;&jW_?)K}8>^=mQmf
zprQ{{^o=`C|Jfw^KQr`MP*U`Piay~Ked@BJzb=XXAVVLh=mQmfprQ{{^o?8SEBX6*
zg1(Z!=Z*Zac%|eIsN|1uO8#gYmHfSsB!3`R`3EZcKt&&@=mYt0r5Sge{x6g0Go4cM
zUvKCG6@9`f`m}9|enS#{+6YA-sOSR~eW0QbRP>EIPQNLM{>z5`uMB;lqE9$QpT1Jj
zZ%(4m7(~$rD*8Z0AE@X96@BB5({D+lzroONHS~dsKH(Joiw*saN%ZN{6n&tg4^;Gl
ziat=$H|{w7-z4aN5_$G*vaAUPE*Hr6?}9LmHuhHPKEo|*^SQt+6ehp4EJGKl=mHg8
zprQ*@bd5VscWV;eZH6vT(dE0Mn{DX6V(9+XQopp18M;747pUk06<wgBYus_VI}&v7
zPbD8aSzi{oi?v<@`@={d;j)2gpJ0tw>icfi@!?0jy}i`X2P*nNMIWf>0~LMaj?@2L
zg8n|C_j?|p2OKMq?}N{Q?kC{`(6^VlNk8DLCg1ek1hdkBiY`#m1uD8gMc26FbYD-R
z`v-6eJ)ok?cSZNphVCB?-8T%~k%lf%(FH2HKt&g*=o%<=d9~6mGx0~6_&^mO7?kfo
z6(6YL8z}Kfij|gU;^&(9KouXT;sZkx4yfWA7^i=QiGR6?4^;7iDn3xf2del6#^YaU
z;^&+AKouXT;saHDV7jEkz<B(tO#IO%K2XI6s`x+^AE@FR7>{3I;*T-$fhs;w#RsbR
zKo#FWiLdxK*2KTs#0RSQKouXT;saHD1LN^OW8#l9@qsEnP{jwT_&^okz<7M=Wca0h
z*2D*@_&^mOsNw@vd;{b0$D8<tCO%Nb2del$6(6YL8z}Kb^wK6+mW(T<-I8Bgk--C0
zcz_BIP~ib8JO;+`6dOFR7(5dV9-zVlRCs_24^ZI&(&ei0C8BMmO*Zi-nfO2zAE@F3
zReYd|Z=j?@szTaS#s@%Y7vz^V#oz%dJV1p9sPF(49s}cet}}S3=L*lY1`jYGc!3HJ
zP~ib8JV3fom7f<S-1U0@Ds8&O$|CL(y(g7cYFRXCR@w}`S0vwM?<egB_UrsQ-ggAz
z|BOK5{Zt_F`t{S_2Mgr;P=UnD5lA?h*GV`@kL2fhp>wmW+yH0lwZybpmUWc&Rs2&0
zFa84r;y+*7SNuOO5dVh+;@>4-x0!tXgUQ$JCSP}$eBEjC#dnpjGLtXjseIwD@<lwA
zFXE|u@m=MM?<!x!Q~4sC$`|3fq~k6_|87HnuAx8Avi>CbEw`-00`FlTSMo>rN`Zv`
zM}dS73ncvSB%gfWCy?-m1rn}PAmLQ{<|X+0lHk41(EpsFzX16VeE1I*i2qQ5_^%K=
z_(uie|4#z(ck}a0!B?U8Hq#bb7G1rS_IbuP0vB0UzTn~eX9e<ol0d%yOz`0UqCmpE
zERgSQ0{PxW4i+0Zs5Wx2#K-~uN)GT>a)7^*1N@a7;IHHWe>c4^O1d64>HSBGm1f*E
zdM`C?DS85uKE7WeknhC;`F_1XzHgB9@m-~p?>oiK_df~bdzW-CGwFWJq<gtZH~uQ!
z_^Wi|uhNabN;m#0-S~G&_X?Bll_uR^FzK!{>E^piH{Vsd`L5E<ca?6wt90{SrJL_6
z-F$cHyej;Naw13I6Q(|Vk#VZHS0m5D2fh~w<okGmeE*i@AOG(O#Q#48;-5u4xu<HP
zKp*1|fy8-IAYtkS_SgH?z5wkKVSVQ!Hv$JRUle#AIt2m;>NRm+$g*A$_aKSP|MMBw
z355Bj0xz(vDuHB5)?|G{kS~ElX&(h<QckoZzK>c~p}<SfnGl$TZi2w!&=L4C_$2V-
zmi4Z{OR3kS-Irro(*!aes}lGrbQA=RBtHU2S=QSEbD={XWo^GuU_N^30!I^GApN??
zz3*zm3mixIen9%maRLiTm%t*@C2*n{w@#woi+c*~JG}E<%eYM7G;~J<-e_6N1m0v>
zKM;5e@+a_C_VWeKhF|d7H-~%(ycZo0f%D;)!26L~fe*khftBdsqyekQhrkEXDG~S(
zYv=+WK}SO1qwFyV4AY)ahQ3<lMWBNYi@?W8m%s?=61a+V3H%cL75HV+MVb4)Lb?P#
z34aCt6FMIPzY4zue$BG1QC0IEtg_@}!u|6e;AO%52R=7%(WfgGR&lDK(i(NoqKd@}
zt+KMpsyTOmuI%o6KUY>hXZ`|f)B_b&^F~dce)Ff*2W!-#c?(9(ySJ=-(VY9|S)(ee
z7FEr;3;59e3d&a@G^*^j={Htgo>w+)YSDz!(z5YIQ_H50zrOg!((x0D^YY5d=08xi
zsG_oBQPtGxH<smHRW@P4oXX1icaL9iPie)1`FB55d;|WY%gQ)XQ8{(VlH%ghCDZQ8
zD=sdszA3Nl#?fUr<(5grE9Y0uTQsMtVo_PuqB--cDyQ<PIPc22^UKTUEt>bh-Sf(-
z9$GlBm=sFN7FEohQ#I$qnYP~NT2&QXtNL(qt+&$F`&_H6glm-_POkM<+IpXB_umiK
z?*DLdt+&$F`&?VF0In_gaB{7;($@Q2yYD`@cHf7SYrU1W-sjr<`EYIihm&i)mA2mJ
z+P(L}wR=CDT<fj0^*-0i%i&u2hm&i)mA2mJ+TC}<wYxu@T<fj0^*-0;%z<ljKAc?Z
zt+e$%*B*KZu01sEuG|mdjH<WN*85z0@Ikot;D?iIy_L4!=i0n^aBbd)lWV<|w%+I3
z+_`XV?uV0Wy^*%la_lPBqF5iga;kSFNVg5e#rLuPbK{kX|2LKC1+G)B?R1M#*PGtN
zsAZ}*F=~EykMWFF+*n9cYi-@JvRboJIQVzta+%m0xb$M5EcB@&eqZU*%S^q4OE13k
z4lcbU(L1>GM7?)#>FI0l;L?-2-od4(I=zESPXKxcms{0)Lss2N-W#~|aJ_f(s0Xp{
z9oOYFxAPyUoVQ3e7*z9vlkJCv3+7eL>$Xw9t80xvgVp-?P2;q^(3w+k+rSSp7d_DE
z#ay_p?+2NS9%%GpF5GtigUm$_G<q=?ZjbXp=As80y_gHPulpc#(F2WM%!S*_evrB7
zfkrRp!tLKb$XxV5qZf1Gjx0XNT=YPr7jxl`X+FqY^gyE*bK#DrKFD13K%*CP;f~`z
z$XxV5qZf1GjvznCT=YPr7jxl`T|dZN^gyE*bK#DfKge91Orvb_w34Fn)5=OFO}er8
zrm~yH7fmZZ(|LW~n6k3FP@$PuRkm;rgLWCV7hP4IcU3OGp0spImw1;HWMEfZj9yOu
z!a4I7O=UQLS8?%;SC#P}t(`MmU-<jdQRPjC49(6`Ix4;CkipeiO2_@)bja}NETv<C
zHytv-IZNrd&zlYzqMW64%=e~41{r559rt?EA;W~Tl#X(5I;5jNOX;}Vn-1w7&Qdz&
zc+(*b{HfA$+Wso9piDRBa~7Bt7?xj7+o*e!pcmX(YA-I<ikG5$d3jk0ZTlIlxW9k;
zdd1`H(bsDgXOF&KWjK5E_4>fsqpxT7XOF&~lb=2MdNzIb=<9j#*`u##uxF3Ho_n4>
z`g+!Q_UP;R-r1wCXKH7UzMf<CK;P_8++A6fH`*FCZ9?hP{Ly7s>bEN|kH6)*Z+y*<
ze|6t-UBA&|%C0b9N4sytFn*)+-8V41e!1@3mGL*QTyC($-}2*cSB`eSg4u)vvl}D+
zHv00oU;J%!Zrm^a2DQ96HS-2F*Kf4@1~uacHTP@$4Qj4m{0(ZZU;GVfxp8Xd4Qj66
zX!i|j#t&-l*Z3RMT)+4m)LcJ#JM-U6f^yU;{+m*rVvV{Y?zA{|rG5hC;TV$oakQz+
zkK<43m&IQ>rse)#n~|c<pq@|Uuj47<<av&>S_&WMv*cIEbFI9XA4k5_?^(ie#E3&c
z+I`F16m^zW@VU4+vSelPc<H_k-E{mU+&6%3*iz0DdFig^o4RiUC_k63oJaD~y%)NL
zd>4EisZ#ia?pp?*oOP4m(|pX(uj;SRmEW65_<jIBDJQ`vbR=AN`LJ$C@bB9uoP@0+
zbKZQ^L-%_8-JhF}g@p6wW2c9IK?3(gHwayqe@~lm681hGFWnG{mNT#J&!t<AhnMa?
z5C3ewxpe&?6MQcJ3OV!F9seYd7hlf21plPmU3^)*d*vX@!@uvEa1z!J5pO<bL$^Em
zlf-!G-U408qm-NQrzg52J^cHghwe(4?xnj1y4}g&a>9A(-V5DALzgO%pvzfF!RPX?
z{v+M<FOzUyd_VB;kK>XFe7t-4SLos2zngH9=Q_?@dh_ubbi3nUE#bU$cY658vCJOn
zPV?~Z84ukzkT);gT<~|tzt;%orMu6=KaPLK={`arFaHWTBifz(Jxn++zMS%e{0;Nq
z%i`V3zu6xC{n&&P{srNeHy^X1I}LyL=hmYD;k<Njfvzim*#z!M{uX%n_Y)IN!fvOX
z^3q)cU3EW@A?(uKN;ogwd!buM7?Jx=0A0EZ={y9VD}OJOsP6c;fN)-XKk)Exga=<1
z?_T~b^YHJ#OgN!kpVa=n2Ho!X_d;^}=i%Q-gRi@Gca?{K&wA)SO=i9P%l&xw{CkQ(
z-u&+K@b5AY-K$M`xcr+)qPpYX=%n(<xhElic^-UOynFfgw1<DsnQ+3taY^-eHgvn|
zKgJ~0-&>&T%3r?0*B$?U<l*1XJ#>FeKjr1$8t8V{e>_7tFaPd^ZXtL?{;u-SmAgR%
zpUc13ID6e4|0X822S4!eufT&Zi+3;o>OK5>(S#HJ?N6$|7GtLF`1f{F{oU!|AIHDr
z^(c#XFWp~z_$M|Ogr+<X(${+VR|?(k_*X?ZFaP#=_;-!L_5ZQ=CU8+!`~Ua=qoR%u
zDj6!}s8mocGwkC!tfHdgj;12A2#SC(D4Gj2kW3?2E6Wxu+iu-fTdt{D0d@hG4797Z
zx@0Bc%{9R#=Kubj=Q%TH#zCojzu)iuy<Y#L59c}Oe9mV(pR+z^&Y^PaE|&+_UlEky
zN`GCQ%ELdyZhsL1J`LVQIgShZtCHbJj+dSEw*_=v>2HgZ{t`i#+h4Sd&z1e15%jlP
zpc{$b-HZA=2fD8GHxh87{xU$<06b)WqXoKj9tYv$`qKc&mHycI3xMO}*w+O8jX^Z&
z#FZS1DfaPSjSNSyiB9@67+mXbs+0bX3i^we@wuX_0$ntnOx{`<j_9iJN7Ua2gKPb<
z^F;v9<vlIvZz7_(ynmJPas5@qy4D{%k43=epJ}(hNdi6%-bMS<2>RPE!x3$N2q(&M
z9CTgTpC8~vJ4ggwZhuo{e6I92P|)A!0^JK3?}>D^FeY|?8(_%s{`XhFiF7kSHyr6b
zka-4tuD^8{OcOq?KP8xQWq)OW6Y*^k^fyz$r@_0ZKZBsZdKr#rf7`=R4h`tK(%(_Q
ziFE4({mqu~xzb;}pud9x-CbQA>E?p2EB$Q;oJjY$puZ%6?sU04xc;J(UF&bMQ+fC-
zwA&xD*vdnLcTs=y1pOVB;Yfd9I`_Xo;!1yYPW^8j=yLl@mGQaKUzVW1BLdytogDSI
z6?Ey0Snjy}^#q)#zeLbA0H}wXLa_iox4#c$d|ZE*GF<C#s}sH_1^s0T_%wJI^;ab5
z?;9D8XlG#(1XdL7-SG#`3rJk)F9UF*9JPY}vXGC<p~1UIcb%ZWZ)G@woeLn5?mW<C
z_YxwF9M|70z=?E^f-bMWIe_DIn`L}le{?aAtNMG%37^*@yZs@H4W9<@0JXU-g8q&p
zmgv%>anhd#NL=a9*GYc{(B<}LlySMTzc&T_oe=2yBeST#T+nr;KR>{U`bz*^uD@jh
z-6|O$*PqvN*ZTX!3169@KV)fDe-(lpn*}-M_IH#+3nc7bN5GH+Ip$^oPLyN2pud%X
z;C4_U<KuE{!C6zT>|mD@zFI*J9Lr<Fr@^~u2VV+uyePvF?QeTI%25Hjbfz|UT#loF
z6Xj?Y<R}I(mt!Q(T%z*ja`=KNS8@ymoQTge%Wlsm0iOo%q8z6MIbN0Fh_>GVM>!0j
z>#967fD`G4gD%O~157_8<0E^1NXEzI*jnUTjt8Ca#R+nh3HUU47v;Dv$nmBOM{>ks
zaYC#gbw#e_hy<J{N1-5xMaD;Rye8x0au`gm<#^c%Uzs3BxqwfDcTo<nsrGT=yD}Wf
zk<rIdj(MQ_q6@o91)M0yc0rB}GCq=HuZ)k&p+sT1va4z*e6@lcIBv>jry9JAa`*{y
zY?I+gju&Nn=KYKYbY02uoRd8_3vxUz<0CngPI7z(BXK2%!buL##rFEKNx-MUyC_Gv
zAjd~C9LZ61r(<~>2VGb7d?nz-@(2fAUO%3e@sS)SWqiCmhQsJw$??4tzBoY+-kuUZ
z4IWXBctMT|q>&8t?8JJNSU={0t}8jV0Zx>oP>|z!85hy@b&_KjjNO$SK2CC!339w3
z;M3q;lw+PC$3J8^lH-!Eqa4RU*OeUS04K_^U6A8t86U|pUDk`OJWzRD$uZeUFSUXk
ze--d)@Gi<>6y(?|!;u_=o#dDYx~}B7*GZ0ML5{!4_(+ZoGCnTHE>v1qa;$U0=b3G<
zA8!cwG<X-~C==v3Aj6RyJ)Qc&<Dkp#6-F94ssrS@JN1L%piBHw|M50_!bNfv%J{e(
z22@&Cau}WPB?xkC74T{BF3Pc4kmHaHN3;__#G!tGt}8j>0Vmp3ks!zWGCq>yJsBUD
zqv9FYa=h(??@2+9zYF*@co*f^D#-Db3`cUP04U0F9CX>e%t#~0%fnOSC`T>mQW}-V
zcKEzJvH?f<xE$VS1i-S*5gfUN8b^Fb1vz#io#O+TgB+g;a(pMl5$u!w9Ocl0F1rsJ
zY2>&Z8v!Slhi8u6u094Fr+Zb#$K^Qlf@?W0JK@s+pB8vXFP{qdG<X-w<ES9VNg0l4
z9|Rz>+UHvsM7omW0N_M95(GJ_ke|yD4E_iomt+6SuI11IPQ;fX$nlwg4`dzWI0HGz
zeo5XRWH_Q7jP(ej%lq?lpv&&JMI1R^9#eG^Tz4s2k$}eWxYPKBU^RF|{apfG72=34
zOqR(@bZh+`>1zLmGcbuk*>Sp`0Zx?nNyu9U7{bTfUCO4xBhpn&v&;J|(ugKKQ&H&1
zYLi#{o_yan;>dBj8oZ16Jb{nP@dDB~KDumI#Fv1|O?UEe$MIcv8W(GF-PrwhB*zyr
zK38&h3v#?9!x8N-?{%bm4wd3Q4^FjpIeY~<c>hND5&|6YX)0ZpM?B!f^2mi8yga^?
z`Ew<QzaYnJG8~h`sXR0&RCfQlEDG1324S&0w1OPGe<OU`?{SpF@Hysm#E|Sbz7GH=
z%FzrtiU339!P{L|ats&bcnk1Elb)%A9qDSYxW(>VM;bX!SA%y^j%Y!Stw`heyzX+u
zmjI?*$)N(AC`aKEyIp-R<8viPf*=Q~fQ{~#_c_wlqS0e_vjc`)YjPwCa`66*WGVA=
z#JBZF^ks};hR%ks1aP7pwUA>TK&U)^fKRww$&o6^@u3Vyuv4AnsQ9&Qa%2f|@cxbP
zX`Surg6n!d(8;d+^X%nuTISD{9EE}$y97DD9OS6K<5$~O&x-^(c>hLnymq%EKCc#>
zb?%}(UIv_49)*x21No^u{&f>M)(LW;39;GLR3|yK9o!Ujml$`g+0{ltj?V;q8YemC
zb#imr?)o~(aa<@56k)4&wMCGlTA=&oKu7(NLfX>qz9z`AN5J=_Q$5%AbaPoA8=dO8
zHs4+zO*fI_13`{`0^O-jawPO^TY2mf@YRX<ocg1p{%#7o+l{-{%J(w?-#-O>Uj{hp
z`S?9<il^FuZ@-}DqXIsIzaze)L2e4V`;9x!-*CW*cK;;woCqMYd+O+^4pBA@9<d!i
zD#-CQ(g=>8FP-~^P&WnLDaReBt3iZ_@3?^P7}9L`hB(Th(Yq<=PC4#c!*^Q1cS^uF
z)d`<=c-!!u6Y%lz3-NfeyCZ*wQE128AaApPkB=h=-v%dqTO!(qPchv-{^R{1;d{tw
zysL<Ib2;86J-WqPbKn)>QOu4Z1F$<D>VPPE*UCu*hbfKCQ5rqrvd<H)wSq5RhT|%`
z4!BdDc`nHgC=`c>?9_mV+&QvSWFkB5hKFP&JDrP%<HD=L6M9MLD)ICr!URXMCTA}n
zoHImYb6VS*MkBpTe?x<VSxR7Vc(?>IuhW{C_*geLl2UT8ASN>pH_P=lm__(wo@s}r
zsA=XOO{cD(rq{&c3Nq&MA_|z#%-KzT8`7stH=R0XI^)HV++Vz#kXQ;l&B1=BuUoBF
z?w6-E&%IwlN{D3#{C_O}{Nz*(6sAc@&Np%-ZSf<rQ}c2%Q#JlNZAeI<HZXjkW`1&h
zTB;@|Tay<Y9u^iHmKvZ*$x6;%pjn!hmyciUYII?PwSxmS{uxGNZvN0ALy{#NgBRrF
zEWly<IR$wsX><#~5MxeGR!T;4X7-S*tfh+w<>uuqOiM9pQuXQK`t;ybU1(@%P-=))
z7nl~3qSXiML(+rh2Wit%(t=V0gF*w*-g?V2xUHD1a9io=)<>mOmZ7Myw8S1trgud|
zSI<)S$S&;?0U*Z>r+7G5=^Dh(rbIX${o(oJ9#Wb-(ijpAqKoj5YYm31hHRSbp5Cci
z(46dM4tEDD2FvEw1%Pe}`fGQ%OV}R3n+Ky{kHX!-_5e%oqCk_x9Ld_<-9v#-nKnmt
ziRwBzDZQQT9&wVZKQ8&mXQ|R3*3O7wRMz+8umlhKGJYzbZny;G5r?ps0@Yd335ua~
zx{K2}j3$qz-w9s{bQlsTa0RiVwRqC88{kN{Zk?p|!3_<aLp;>Tct>Gq2p@PdkdK--
zk9-(L3HhYnq*<w12}>P+FFtOHQ5T4cl!S_uL=`D`Sw^xk#uZdrVQyMpCS7xpoTUp%
zFUU^CT@@6_Pg<&Tjf7oS5l-j{b#$OJUT5ObT2~N%fUtyse!wY-$u6dl?x?^ShEu0I
z6THdI9r1Jv2fx7MkKNaClk)<c8NziQXbRe{*%-(rUAF=5bc0zPMbWm!&4O)EgUp=<
zwsBatVT$9g4f1<?88BG(xrc1bF}uVYhcn=vwL2`;K1bzk1*MZK0uyAjx8osx2p_=&
z;vpV5zIk|eg%3kHhdy_MfRD_a;|l?@ZU}RifjUV%6J1m%21l?D<6(4>POb=#s8`~Z
z+(US%&Ep;U7SQ!Uknj=zt<j}BfH+-h^$3ohH}QycD-d=?_cg?ebhit1sa523Yk-XK
zksisN$0N3~lt#}**(cpIhe+P%P?+$MJBx?t8t{;-6X;Ug#_5(IKjG#0yj#Ingm@7j
z-BHQ)M>^*C?j(G|n9rY(3yueGBRIrs<urnGHRi)mn!#}tq$knwV1f)Mn}MPh;Vl9n
z*GoL&MLCFZ4dBQQZo|Xnm=8FP3(<-q3Lp;uZNJqaxpB|V;>;BLu<ur5zTlA1HjnwX
z$Oa(QVSjwSCF*upj8_cI*6<itVKIkuI*r-bkWYJ>P{>2R%oxwd8|v>jS5`Lo=qfWS
zDG)OCucLD)rVEdufLd3n-d0(8y!|<A3Ef4eu+Ys{xbJO`@jkbs?I=d=Z=x7=w`f04
zbF`nbCfbjzMp2{mI|q*qEX&ibOXJD^LVlda)S2TY-R!OW#YeX{b1&(p_&ie%qPp-X
zGXiSeUiG%Ul_%O;N@(AzZ6Hq4%Z`tkMeSQ+RDYDnh034Wm#cz`D~Sw>B8bqN&M3<t
zqnCyFH#s4r2(ObeY&ti6ra5O_#~|(FdDr^4#CT@bGK=^_Qm>=djZDGs57_`^;_knY
zAJ_x*VUbGHW%-R)k;3Yj!VXvd>Z3cHd6=2W1!g9Q>Vl}tEd2tR$p!T`DnZu;H;ENo
z!YvApE9?*Yw)XA+(K(d{^71i8ImyoFM59d}?hi`yDuOZKA=erV;Yei=s3YWaJnrLd
z^Qsa#-2q1o&Ar@92uOo;>g&l-J8Q#1yezfzvY*o6T7w~8sFspb(;v>uI6Dq6H%gGk
zG`4h!msJv!l+OPypoYQbcuy}yc%a9ld*rDv<1ze=d=J}*j;DHx$w=>{n1=isTdXsF
z6}#t9+iE(EM(oZ*;Dlm597cf@?qLUJ>E4RR<rpfP?wB+!wHdY~*MqXY2#n-Rpcgm^
zzP)XBN@d?2bIX@ycqzS;VxKHhF-un|COCw<D(Yo=R9@Y2vE<Kkej0Oj#|4u#*X;zt
z<KcJgg6}G_pCtR~<Rgy>zOozgz`rFtc;N7Ct_u8PWPBte<xh~qiL#$eK7g0OCpr(x
z@tod7IXsJe%vCv@%XAE)csi#?`Xl*Re$dH9nCLtp$7|rzxA|!DVKW)zW6)nlJ|+${
zrl$Kl>&V9-{}TD=Mrce*b8W}TZ>v`+1_t4Z#LW3Axw%Qw=qzb*PIe~lLySq7KF(=w
zd{ZPTg@qggZhXv4U!IhVqfh>ABstk>G7@>J%Wq)3$@P%&L3W{XvyzSJIeCkdmf?2C
zB%C9ioSK@4D<KJ~ba7;oz<DN4HyV?P_`tv<F`gF9lB7gBP$@G8$08ZAK#)^_*>`I<
zV&*T;Pk|0x-++0`la~Uu&ILmfFkNJ}wQO5O@#iI%NVj@_XDjOg^Yim>da*)$V2DlH
zl$>lM7F+1dZ`=r)m4<bITPw?6;5S<FpBA>QY6fw^h8(T`|Ax3+YyKVLQauw+CJEsO
zT-eUR(D9f*a^gig+BCUKKqG}YE!xIhv~S$W-2rRY=p9WRbJDy{4#4AC=$>nWqjr~^
zL4N3+9JROftj8nbD?*t1Eba(~oCS|K=RJ+KU5mKhc!(xF)T@uhBjTfRhAVurfD`fg
zAT!5DvT=O0o+IMhf&ldq+;RR0M#M+Izoj(dkND#Fo&%tWk0$7@_<I^aBECd{KfZQE
zc>jSy6Y*^TzGB34$N8%SoQSUsnKb|+{-|5x{KYxp(;(~$U$hgx*93gjmvemkz>mlu
z-6ze)gn%K(`8xq15v~Go4@n>naNhw)l%p1O{Q*I8pqsYQT?e{Ive|SIF=W6aJA>?F
zdk&)uaOMb(@^MGm$YHyH!<tYTPmq!s4tmAU>Daqgjwd)*YeEmpa59+U9x^n+A(^?^
zvi>-K{(#f+L_lyh=$oIY7rL+7fOOIetyT~m$(0Q_jtfCWB8+{5%nOwZ!BLsaPtMEB
zOv|$^3f*c=C@?Ts2D$ZjzznKjaC}WjZPT6<Pjk{4u0Q0N&Zri8vK1H8XI@y0@ic2K
zp|R$s%Aebrey%9SCKiR~cC05^)sZ!(GoA|#2{zzLQ;U0E53DK7Sg4p}J|KM$JP$M$
zLKCMfPrEcXi7ny?^fjl6CH^6iX3ZAuRySZ$KllR@)Z1cI=E|1JvUtDFO82s8zfRI>
z&;+;oE4qVC=gsw4ETZbAFdO}R%46NYvUmOI@&v1Ss-IV*{|4sFby$CLt0rXXZBzX^
zSyuX~&Z)P0hZ)l%%ttMNH1F0|ZYMPA=vtb)=PLE}1s%b-kLkEu!KYZOIoaOrFd=w2
z)vvRh-!IH)2tQu13mH5Tl<IBKew~rp$zo*K{dyL>X#T#jBRDXBZ;AKws&BA@SJO&A
zZx8j_@lfGbw?=neg<UN~pE<r}aN~E@(#yuXEwRd)SZ0=`6-F<!(hn+78jw-axcnuS
zuh{&TPup$l($3#P{U8vZx34Cx@Hy_7huW>B8TArr7E5r^lnzJh#m;aZo^A|KgQP4x
z<i^n-j*opCUE^v>Oi(sQ-#0~f<M+%Cisdo@@k`$;CkgEc)%i>TffpJHv2Uj^tuJ#&
z@HKLP<m!$|(A`e>mdIg}r@MOx1$}qqj_?WK3JQB8u@l<2e(-57HGzEe^Xc%FXuNp(
z2nwSUq**k<hZ7uXnSp%F-8AF_c^vt`n@c{ahkt*R<}7@IusCfo4#%d%<b<X88m3Fm
z%3P40v=nEnQfzkeLg&cAS((|3(((r7<kEOJ|AwgqGA&!!#$jquFovl>V$3T@F(%2)
zE+%OUa`G~b8H*8<pB6K@t#gYYT~ZRY+)LA1LzRHhXCP>{LMcO$Ys|<?!w1v+w5;?$
zH?3&Xbz?!8%B7}3?40GT@p21RQJ`&e5wHcZc07sJsSa`6@mJ~}>0R!g9PFQ9k&U^0
z{1xF02(vbTrP{|dIS7k=aySrZ5J%%9;)n1N%}P8Xz6yj{TLGUO)irYTdj}C;A`nm-
z;iKUL$A_PwI^a8wFl$o)LyqHHfOrvK1`yC#f$*W)+3=0QyZAlqKGZ4E5%1(EAH8cS
z07r1H#y&HV#`6%|-d6C10f^vu@_xLmqYSbmdC3I<NR*>Ukb^p3u9q=@<G3haA`0O+
ze4;@x^pI}mXJ)6`20j|T?+GuqcWJ1@_dw}F^`TPgt;asivLW)ZPd5imDE`~KLukjz
z$qFSMc0(h(hhE^Muu}1;L%5ydeur>-g`Y#X1KU$<&+n<A-<;aR9TogTp@hE^Yvb+d
zofTmY{GjyNDn;w7K{xEHK#PR+4aMO6<%^l$hTF<?fmqH;Nz2H|O2uZaz$CqWj|AI)
z5~xdx9}^jskdPD+IVNdB#Q2yg2@z2-&e_8MT(+=3mo4<qWefRp*@FLEwxB<kE%47}
z)BTxjK}kAojAWy2`Aco1*cZ{<Yk|-x$<=|?A9}x4U(^gBg5xNtUEw(JYJ0DAf(sGS
zL^wV#<@iEdft%ulFRT?fUne*ktGVLuM>(F;)wcrowiDdYR^Vt|pXhLW!&-qeIKd5X
z1#SosiTG#?>PimkKg7OrB*LQOd8mJ-civYLoU6W4Bg4UC?mPY>`y3w|0}E-#@xB!g
zrPIUvHtY<|!*Fvc@89G}JL|rrcgMaBTS9}R&h6HH+x3Yc1jqZfi4GcK`*)?i8V=iY
zF-^A?;J=E`)E)Lx&^my$B{-?LhANI_jtU!ki?5A}R4bMZD!!(^2eaa}B&z9JihAvP
z5Y}|9qk3&`02l4nmfg9X#BYc|u=tww_;2mhYa0-;!}NWhDD%;#6XyELhVI4J);#ef
z(7X#+^U<A@)^xJ+m+qNW29OEZy>mx-dn7cSEUMI&bya^@G6N_S>E>9s%qlN15U@LQ
z_XC)oRG#jk{&3xBDRF|wqKedj-RckVzeJ9UZMVGxQXAfbIqjHv`-k<Mg)YU{o`1*<
zENqlmpfs5rHf7w5ikk~69@}X=*bq-t%)@?~#;Npz3idobOucr6M1|5w&|aBUiW9%J
zgP`>fq<Go{CEchqE1h%zX;?v%_<|}tZpLIg7fg28PJ_0FSHTK&RC(GxvqI8gw?(z7
z#n*mDiK*A7Ayug@Yag)BQIBr42~E*JTW&dncD~x%R14h+EV|!}MWqWC+i$1wd4rNs
zkqTO%;>5L3^6oBhDYsKw-mo2iGAm_m%SL!oK+5cqi)6DqJ3y?vAdvEA0=0L+gy(iz
zJZ=mHjwHOmgxhbYCbH3w6kLI5*-+a%s@r`#H6U))=5xY&P^;@?1uDxb&(g~U-l*F%
ztOZ`YW;dvzNb@=M%gsH_=PMgJjkx0exWe?6B5y7&lMx>a-81krhpE$N@GP`ohP5&u
zU`h}$A=+z)^@q+=Bd`dj!V;Oc`kg97s?2pwCp@P5snqYp`}w%l2h{XB(AdEeLu-Xz
z3-PrURxTi~%&cG~QNyadxw(l-f=!jMO6CRSpbbFG6mUkh9rnZOLd_1=9yB+d5E6M=
z)MVD!n}R4Q=LA+3HR=!XzeJ9U^)yv?YMVY|Jk!<LG2WJGUY1p=boJ`W(mjRk&2{Fz
zjXm{8jH}Ic)g1<nHt#JyNjvEPT4g@mbhxP+4d9xBd(4N6f1(X`#+cGQ%jeJ%sX<XN
z?GrNWatpC%hNc=90xhYJ)<ReMDW%^`pj4<olUDAqa%w);xbhRKcS1&;IlRW8B%L+R
zYpNpT(w;2|L>;}C(C?(0&T^`wFPN(WuIewW@-kOqWzy`)bN9y*sV7R)2Rtav!=)c=
zxHS<BQ2+vkY<pEKAoVBmI<dp<KV-S6UJZSXhq4Yw`)Obw8ZsjIex(NsmF6Rj1BQ+F
zQkSd;(rULs5#}SsKg+rU1JK|X>FW8F<`zkd=hhSiLJD7V3u#iVz-p;a$MeQGRAo;^
z>A~eQbk!ZPyjw6)QmTnqZJftQt59a3?1}73X(<%F1XNxv**8<^5=o^}wg9_AW|r1S
zN-Sqd>gdWHf*Q{g=6Wpk`UYIlpI_CL^yI~Lc_-<z&3Yt`$O-lN|JUb#NT1SY49Cw1
z1)kU;X&LWzQSC*Q+K0XcT%_%#Dwv5>Y{9f@&P>H_DAJNSH-5+RawO1td(m5eL|w84
zd2iZg+-qwy7NE^oBexmLoZ5^AGw@i(`<SjM3;MWfJ{aqbcR(nwR+InxS``Q-JNtJI
zNA>dZyC9XHFUrsRf{XI=Av|p>zc$r3U%CCF*2D*G*gdQb`xHc28^$7qcFfmBI~F3e
zVZLa?3gtFTZKgJcwPU^o4+!m;T*$su$o=FdZM+xRDYb&|sacbov&I1kd*1>`D)4`^
z&GY$>w0ZxF<?GsjcmrTr<%>?2#yL#0)Nsq~f&8_MDb1<(b7-%f@k`@{7-77i#Av}s
zU!yK5C3|UoyfDC4_a~$7XUcUyS*ZJsOD*Gl(QKKndZ<fY0yfiCcXi1Q_Tq+tgSzw+
zyqE4#mo>pJzM|Os^sxN#4QCM$1`mx|^GJLrq=7@jZ}{VK?BHtL(2d3>?RnOn$jUl9
zvPAo!0U(4OiHe3z1cEk5R;j}XM{1%9O7{S1;oUN?FEsWec*i!2|8%r5ZU>FyFREu%
zkhRP8UPfvI8qfxy8wyqEf1S%y>M(eNV_Btvy->g54IWsJA@k8zdy(3knZ>j%L}42*
zP2=OG*%&je#8}B%r~(mR5b-fzZ44MT4Pz$y6&FQRyAO(FiC1mo&fPG(y=>$pk3TVT
z8Z6n9T4DYQ?M<@O-dLAsqOG}DkiyK$G8^B<*%+tMXc@1u#Q2(;VOp<)HB&Q8>i~Ok
z!`KjJ=cO+F0bw#P`rarNnc7r|xQ5<{U?wJD>|a{NLTsqp%18<#S}-2H5>StkR5$AR
z`IxrhU%+b{OnLj6k1&gI9F{iJ5|F*=W3vq!%KB1GmWI;A1Iya*1mj*7rf`HL043)Q
zbr^FjwPS>uSs^>2YMj8VjPkYyE7|wm46Zd88*9!6`M+q7UZ<fI+dhj`7$A9BreTca
zjdCubbusg7)b9h8zus=DE{4h!MT(sd(l(E%!=xO*>Z{ZxPZQv7R6_F?)DNy9>j0$s
z(aNIpy7D}?vQDK|<8Xa7`cb8ErKLbs9qTsORPF9&-9ck5bMv9o`tOY?>TM-77gdzC
zXIn`Q9gl6QGgV&iS5xqv`Ky5QrYr84-mV&FKDvXoUYKVo%#{K4=ptE!dff+zsd3ll
z-lsKHDRq0ybqy~POq~Qz1^@&sU_RQgmV#7^YnzVJk8b)Z4i;72hZafYr;e*NtNgG9
z1j1Lh&n=to24+DDEOcCBKzVus$h5~z{qY{t`Qw>;>e1j8SDt?k3sDU!%4G5O8@7>I
zK7}yTju?hajPjc9wD5*$!gOXMx;@wlWA0#{s5Cd<(9wWHayQt6{40G}ISPzMvK{NF
z;O3~*C9F!+S2lQ;zw3ry-k0wA)E%BWrbWM7U2+h}sL@bUHQvYyC(5m?Gm5)oy}INh
zqz;QgOM@c{6lmwXQ2)HEqfk=2-FMJ>DfX+Z@}_+&*VJzvGS?kCeYsMjj@~`20C`3t
z&qpu}>!BZzRb_6%MBWnxN^Q2n+=5n3Rn|Th8Khl8F}q<tKGcaQ)G=SfE_|Bm`c*X@
z>URtUZf@>aSMYRWI5hs%r&QD^Vas?=^*R!+#)FmbZl%tOLZr`B@LnZP=Ga_K%MPrt
z+>whRP_LuCekcns^H)t@nZLG`_BZB>VANY3cOIbC9=T;x+#s#F3TCeg_}X-};~K5`
z{7p*QbJz#0n5l^M^}w;_9u%+n3nDcgr7X2Q<|{fYin*~fIAi<((ClVjt~A%$%N%h$
zx$z{pwL4q+7oXXRScfWGATLp@qI#S50;^6Xey;%x-6+;8jKeH3KBX0f6O2=K(i+ML
zwtm~y)ZAg|Xoy*DYWC0T@X0-ZH`kR1zh6w1N?u85jL=_Imo%YZtKGGc=AOJ?--{Tw
zrq<Ywt?^=4Re5eF^*e`)PhycnQSLpZxQby3e$Z6yZ9byEVC-!^B5k>1fA#A8j;0!=
zzNz3hb5p<(^Oedg?&XuN>Fd<bSCv}T&sS>>ml^&1idx(XW(L%nDwL+?yFR%KDAn=j
z$|d1SFSDjqJ>~!n2<(G_@@T&xYW(5*n=wE}=fJ8NYhqE-{<=LnD>T)(*wmc6BbVW<
zEuUoNX!l4hHr6fF6ZblyHUhQLC2Cl=zrF=%jb7z|DjJz)>=3JODY$HIF`q||qba2^
zi)M9CNeSw0vDOKuX07qEsd=!`EtZ%LsK&&U^@Cl|+n~GMPKMt&Tj&FsAXr;*J70t`
zg2LF*yjNEN;Ks1~R$|<MWr@0gT75HOSl*R1R-xWdLkgkxEZ$FA+@a}=+f`kKxu-c+
zDcQ_0Nv#F9+ZM(!-?a@C8^30>sZhz;?9p^a8ZX(~BQIucpHi(?k7>3{^RyIro6i@Y
zpiTkSUGCelxP{)AsY>^J!a9=Z^NlKWFU9+i1<h=+`Fzv&;M5aU5`24`EAJbx3b?YW
z6RS53ebGVa4w_n0)sI%0E_j$)Ix!PeM^%}uZl<FO7>mAgRTmJJ;LpNVp#sm!(|r{c
z%KJ>#cGPGtGnOl9Q-=ZppK@g%c&c*mK4Uw6{jSfw7-BJ;hmH@xdS<^mbCuiI*eQ70
zN2P`G%iPShu+fsAkh|L8HkeYpO~=(#;nCdDuuf4H;f`@57*dxWLeNy<(Lg`ZF(0)f
zsg6KagjrThKWtrJggZrh0i!+2gQ8RpQA&#Pbckw4QA&rX_NE_zW^-?1syxE8Y-R`Z
z6;tI^V-QT$RMi1ZunH9etb0#dsFikXBA`K21)ZtfnoSkg8Yde_w8n8#yG8xwp~lf9
zwalX|u?Lgby`UXRpz%&hml>ARl`P$(V5zC1oefpBBDXBg%~XMQ+AE-vI@f{b3#Ps3
zR}Y#l9M3$+`qe7dul}MM_Q7K$hv{oYq<$|7cuh~Vv^wi_neS<y)RDqsz`D2D-Mm7H
z22I*pN~R2kWOd05wPOq^ZM+nCnkw2iEJP1h`HRwYQccP+SCJlU#Twb3lvdXe10Z6B
zJ6nAyK9d0KPVF<BJlI-h+UL!hD=o$zTGYf~b1g{up$Eq*bBxM33zO1PEBYTzVVZGa
z`D1lhdn~q6tF2y3J+#THUYb~J4S_+a*S>=Yu&62bZZ59!N1*&kVyf7>8GrL;n7`M5
ztuB2S?+stzkG{^BU9Hd>*eniVMZ+9aCstV-+kFazit=SvbF--ijd_!~rue58h{@3V
zZY|zT8Opt{nX3Hthm0EY_x1)IJ5Tjp`$YTs<!70yJ@tnRer<F&A2J_qoWnW|YRDQc
z0{y4d0ijXyXE>=VQv_V7yy}5AZlL)H%*?N`6Ja%9#c;7#{aH(Ni&C#@>2);!U**9q
zK;3l2?MUMZYHa~LFyMQ9%(&uF9&ruR>*p&<FQfa=RFy%QMOWPlQUks~A7ipcei8{f
z>iDMe5<gPDz2|V~HKJfT)N6#BrCx*TfkV#`uKR}d9HkZN_0;9F`9!hR3Jq?jKkE1z
z>Im0KL@HPZiGuZ4Pppy&q3)n}h+=(6JP4shCUX@CL9%eEAMqhbu3?A%<RX;kUs|!c
zH&5NL!9{-()k=So4#V;n`V<>=SN)0}sr~`STIpHX%s}Nw7+m)(lw#{$Nc9COv3Id|
zDYp7!IwQ@G?fnUcM82gJJFvMF{Yfq8(A>nb%7-tfRi5=W?=@9f&F5~TVXdjk%~Yr8
zc>W_A^wP=*Hg11aYAs(+V_|j7SL*0#Y_&%nU2Q(rbc{q$$6d1&c<mtTH(5L7`RqVh
z;w?3=Yq9k-nBGB)85rK(SD?buupb#S1XBfkzp{(zni~>Kl}i1ARejLAVRB*afa38p
zk9HW%!{jxn?aIoAzKT6XmG?mmrRiE1wTV81V7N-{|I3HnP%OUXzRw~~QLgF^Aa7Hp
z6`l_|(0Z$NlmZs>Zm|DXtfuNNt6yn3^fOrT>3FE4(hnnRbxe~aa?F(hKs5l<v9AUI
zOTQ~%%xy1>(W~1zI(xypXpa_?u(GZg+G1Qz@^}{bMl@`J5}eX03AsNZ<@T#)z1BH2
z{kA3%Jsn!eICTk~wE=VXXT$q`(SBYKSXCa;f;ivuh~MG)=qlJO0>?K{OQo~g3>f;M
zYT)%L+EweJpUoE_3@B2GHK}8on~wB5)^xbvVT;nQJWgr8s($N&`J6oYsDkonnn8s|
za$qu~DvR#zp`Y#Nt1fvHk@BPjD0fIG_hBgnb`f*5=}=RBzXSb_fxMRmlfJi_%oh&*
zLW+z&0;zy@ofm<kRuX$KMO9gRI2h2c^z$(;0z2kPQ$@4+h^fZitn@QAH%pjH2Z9jv
zTdo|5uHUT%n(z;}f{xbK$wKc^7aP!AuF{$+-5c*RReCfIpi1}^><JntbHZ$y=r(pY
zSC*^1OqK2I@zrj*Ws}^H6Cd^V(ljLugIf&@r1jZ~<4gteuAlh3)rvk8W<8MP#B{}f
zlGNsX=G730M6Fh<(*|mTw87dCZKyU(8?M#sv^t#mqzlpo>q2y)x-eb1PLHG1bb*0^
zL4m=6A%UTRVS(X+`XFtPE+{Z4C@4561bbP+g2IFJ!P;P5aA0syaBy%)aA<H?a5#=Z
z(}w6m0z-mAf<r<=LPNqr!b9|-+E86+AU41Rhlb$Tw6M_dP<@y-Ocxdy7KAg}Lc&7B
z!otGC^x@iYU3g%4P<U{7NO)*?Sa^82UJn-aAWtW(>5)y3sLbqiMRszwKlYaf&<hLX
z<0U|W^VouLu1Z+AK6!phYFhe&jLe0LvKD9O<Sxm}Hx?{iR=9ixDThAar{bX|fi@&;
z!KM-F&Wf;qg+67|V(YG<HQ|doE+6{CD}9E~USBmLC@6oF)p~oxtFPCEzqatfp;Ouo
z82)PYz7dnQuO1Z?)HlLvt&SYExjy_=H`CB=RRe}U{@(r(!;Y;PRod7$BK@bDNb9lX
z(HS4qhgW);hMxa&!0<tP_m9|dea)zgzxR#E{k<k~|Mlh3))Bt32e;LSM|C$1{qpdD
z;pYAON4#lWGisl;Z^S3on#i}U%cJ*?@{Rp;;_lI2AJ&I21f257fZ^4EYXaO=z+C}c
z6X31_?h4?V1{lZm1Z*~7I|6n;U@>TiEW|VT0<0CVR=`>TyXFa>ao9G);5)SuzVEJ2
z;_q3MJ)znCwuBF(c20Wb%Zw>Mmvoz^`RVV||CW@JxTjCoS-W0*_x?ql=gt{W(<!O3
z@U3}wA4!~F_)v$`o*92j>r*vl!K9hW%vW+=S-5`Rge?6ix9kq<U&z^WVa$@1IoI>v
z`p2`zUSTmykCj|r*15;i%MWZaJW%!Vxs^{XePT6aSwm&|tm-e1&iL79)IZkimJRAR
zanv_gRxjLTG>w|H{m#<HN!v%IGxsaxCfDCE>B!gDrry?j)T7lIcT5|fFe<FMD)sew
zC8J`tUHtva!X2ZIyp%hl(~+}MzMlpdShiz{h9??p&#VpVJ!<4*zh4ZVmoTbJ^L1@x
zVacd&p~F9({KSq?k4IUue!g~g6f(b*`}+U`^u2%o^+YNEu=R$8JC7^NLwk>U(5M>V
zGe2R}OOJeU-*YQUMs;4gdt1y?J4XFwiqUVA_3SA92enH-u?{edKC#04ZEK?8DRQIM
zGd!QJ-EHVKvFFsUfhXsDxiJoS_AP$*k*|Sg<eoc1A0a%$UNQX!JmE2;^R58T+MZt>
zXaXL881rwyL+Gvm56RV(*=(2-9il!7d^^V$j~Neqna`eh<~Z=}R(@UeB=B7--Egr5
z__j|OnrH>SS5L<cwgO*W|8K6e0AJN_{<E#XhejgE3Veijb;;m}al7yQC*kcnH0U3M
z_fgNH&=bJ>VJA(=Q^1?n#s5bu@Fscc&l28cV>>hwUhg~h{AdN<LGL|#mhe(B5?&PJ
zPiue|=+A!9JtgA$#D>#^|M&Vw>Iwg<*vm15-}h+#Cc;19Kmr=Sv!f0dO~zz(fT450
zpAk+pOlX+*JK?W?WOfVTr*bF!RBD7DbXo{M==^RvvMJ)#rXPMGI<+ef93(mq^m-6Q
zQ!?tS=jTI{J4V%w{)ku_byD?D_yY{R6ZXPSH1s>Q3*G&C!^W<Mtwd+&qx-Bxhf0^|
zz)q}02UcPwI#%na*3{2Gk7)N|&qksbb=R+q-p058#^~vLZ)EgpHCGtDRUceq^fte6
zmC^GUi+IqBJb-x6J6MT$&?74#dN58#Z}f?)j2^6j(X(2w^-bF19;tr652M>K@jRpZ
z!%J^5y5FkEVs?!3P5>Fmsd|+B0fzNU$xk!{O@#-#TQ<T6-P+~wL6@wB=)$NO-G8k_
zKLt5qEsX9{PgxmV>l*9NOXI>KcL)12`d7C|^us&8&FDX5k?3dq3cR52_8a*F3=tQ|
zPc+n1Jm^PJJm_zvc+e-SBKoKdjQ%Oa6Ma|}qhIx#L_g@FMBjSW`ohNEiz7dZkodUm
zZxSD~dPsceo|O0)0c#>YFt36eVA#U^L_-|;;NxH9gOAt92Ong8#0M%7<6|p);se&l
z__)#{@v*%{;v>C9;=|f9>c`F67b81FN&K9W`I+l2@l!zTpj-}u4Ds^=^9LBdWqzXJ
zOY*_bDe}S3cjSW~vQpv)m5=fBJ$&K^R?7H6JS&%DR*9b@R*9dVtP(%Rtn2UmY}esP
zf0?f<GGEJNz8;tPf)&D@9fe8<H^6Y6`H2P=558DD_+s(ki{gndif8p3KJi8IR4)+E
z_yRn$7sRvjLS<%px-Ro|%^Gy~Z;Mn>17-fM$^4-;W%k6_duqohpoKd-ih1Bq^5ym#
z{IM|jV?OvJpZFtRZXXzb6ej-QN%k!BhcM$0g~0f;%KTYn{;X?`hb`Y75oLY;Xz7gL
zrBT+J2@4iiz7b^|{>Z#ji6^2)t^0f79q-&0J@M?x!>4+Wi+<#v<J*66t|<EQ*b_DG
zgZ>`<!Lwg2k1G5ndV{<Fz<Vv4m|%~<4==qnHO8%^<<yd|%rV8?`wsc}o{E@$M}E3`
zTz4s^Vciz}%#i`Hep@}u&Xy;|_RMbg_rGs{EOzsr*#1BKwKmpc<<VcBscVUSaC}W(
za%9lxlbYpUT<M-Mx=-eesO`5uH~QTddft2Jz`@aXjNN=`?SmcSUY@=Cd_c;GxSx9U
z4!b%hFK*tJ<DV7&_Sd+=TA#~@-}^Rh+^R2TR-f%Q=DFEX=RRB%JEl5l>X}#CuN-s#
zmJi;)r{vu+d9^QW(f#=2nDs;Vdaj<^XY5m{tN+op&!n*xzkj#%U~=hL?W)JUNAKJ@
zc4YQ<Sy>;P8~gbl@3OTg{Kgrs_gdJ{Yu32eMkJinC2Sbief+6eBU3*cH)Gzj=f|(Q
zGH&s9W%di-4vCMxSas@DLrVN@TQA-*_tcZ|y*KB+QgFu?@f(uU*JkE<jK6ecRD;LF
z@bP)g>woxce)jm$*YsUK`u)Z6y;juL2Yh^F{PRx^jWxd6WkSmHr{1WwL{1o9^WEW{
zgO^R{tbcr6=G8YRyc+dgQ?c*K36E_2vf#y+dQSZNjxjwf@$nP8d3QZ?_?_a3w>{PE
z)%|_8O}yXw&$>@vY@GPyr==%9jOmxKX2?C?+_h<1!rW`;CY`<ha6+GFLm#{C`-+75
z(aPqhZ~HA_#k6+Y-0r`3Qr5KH-A)wFn^bde@bq4rHcna|Qu)TQU3(^FRVME1+*2{R
z=KSDK{?aFSvi|Lzi}U(tPOh05&{4hU`N_UVcceAEcxdu~3I3nHWbvHxX7Yu%*S$S*
zO6OHG{&oAH{3#P=zjb;}^Q%+lzkhUo!R7C!+>u)|r{m7<Q}2q`|J{-?dg|ck*S`36
z<f^GFcW=DwtugOSoqg#_w$HaeP0e4j{oy+w^PTo{?E5`0eluy>3qJF{Jv;fKX?yQ1
zJoLuTA59zC<G$2=x#y>KJsL8iW&d5%yG=0dA7QwE`aZ9N&)@C&$n@VgR*%+>{m1kX
zL$}Y|wfXAwbiW?ke|teYW6i&AzdL_#>WpKjpFOMo{izw2cdLF27+E*t*EvD?AB<Nf
zE(}p@=$EWd{70nXQs$1F#E$}s!cQK0De>OmE!AJw9!(66h%4-Nt?SGR|3Qtv%#NCQ
zKCk(eyMha6zO{a-dPv0EGxzs;J@ez!Cufe@;{Dl~7jK_6v9{N5uUf{>(%qrG61VKZ
zS*!h4hV{Aa!&%P`y1(80ug}bS@Oom@D$oA+zcg&f#?22;zu(en*p8?{>+aw5(`Qr0
zZmzt4gl606*&dhgkALll{=p^p%^ou5z~fs2lV?BhO~glWYaX9HYjXErdLP?6yD)#;
z!Q6d{InxuqZ$G{zcuv--$K#HVSU6|*+j9oJnZ9L?vG?D@XB2%or+f0r_KUZ4ocqSg
z@qW=t!`#E)%o{YVopJ8I?mG%!Z~wQst7rV&b6VW7x$iuYFgT>VN7Afar<OmM8<(`C
zagNVR>sBY-^ZwAYKi>X+(z&FLi;jKwbJCd)_r=Wk=N<DdO@7`o{guh{-o0n-;5R3%
zMeXn(I-~!`^V~PhELj?IVP4hsoV&iPx;y#ewS9xl`LmM?SB?5Or1p{I!?V{9j2c><
z+&TFDrbD&YlGiHgR+P-q&HtOC<f$J&NSl91@uT(5{?E)W(VR`1@>|{fS5E&D_F7=O
zlmjpR7&Cdz(3Hy3cNRUiJ~u_T;F;LM_g_x=-4K~L{rFcY&t(KOg$(pct**Lgj0%fR
zUG~0qvUkk#)M>|erO$lgozxIj=<%kHe@Km5A9b|gEuXX=`BNtxIyxckOwA>)lF_EL
zpRed{OY5~gExB;@tWWy>nl`-i`sTxj`lqW7yti$C*^Kn{#Yv~E3(M25Z2johWAm%h
z!=7FE%cg6W(@Ue<{kUr9zy*iK4tVD;my#Eh-En5tdrO{J@QdH8=kM&ge?j+Uo-+=W
zxn&&LxObpuV@O7qp}&XiO<R-^7u_=dxxO!C%=+iY*Gd=sGh^%6w^l5u?3DTTgg4(j
zzTJ>HYyOcVK0g~X&kg;&%Q4OCnTMmdWLTyi&s0sXjeI-Pd*S*;D-QK48M832{meMc
zk82iocsXoP@Y(klb}TOqcWXSoF#g<MAF8~o@1h~o{VzSaY|5gK76t0oOe<UTdiyoM
zf4}gPMfaxW%-!dHaZ$*K&Y`P!-;?#A>My(Jd@v`gz9#(Xof{s_`p1=OLql*)R@nCD
z4FlYN&+4E5%+Trm0v9(<jNJ3a-_jTV^uwbc^_;qSan6BZA%FRxesSljhpXQ0*FO6%
zd4q!Pe0^B<Qwy#in>=<&_L|~rn||K>O7^kjtE>7czsbID)vjMRp7hFDx_QyPL;J+!
zY&5n1yXX8BIm5gAEs0sRHD_PX#h*X1`Bcv8*|kNxcK6EtLcgkRTJMD1$g<7Rjhd3&
zDX;Io?e2gbxu-V<Ka-PxHn-b%ipslQ8?a=WcZ6=pqlrrv&3xqdo!kDh<m8bR-v<Zo
zUh++Oubx#cO-m-9fBu=gmO*)kE=Rr4;nVqfWtTRZ_hfI%dtG<6@qw|Q=XFY2nO{D^
zJ^%Bi_t$AphUOPd%~O8-bXI<yv8MmF<1geZCog~Fhs4AArGK6AgzwqT#vZkozgtoe
zVf0yHoOa+~f$_N~>whU8{f05cS{3-N>V$FFr}=BXn|ND6r*{&LefiSZg7n3Yc24_i
zQ9*_0vI#9;d{A(1ulLE{J$@-T+!FuR>PXE}%g8N>cTSnQbnt}QUw>R+Ub-`R#lmBi
zpDy)YweH3HzPh+{=H?-mrC<0j%QamaG}R+%+1-I3Z}y)5*s^z4pV|G?(As79KlgL6
zVNA=iD^*_oYX22j_~FH=0Ym?`pzsy#>+hF6_H5yTxnpxfRvs*LyF7b;WS<Vpi-U}7
zdYl}-T)XA9A@N=EmXD}?blCG7{<=JV#j;K{!QU>=dGq1)>sz|5u*?`#G^}InitM+-
z=RItBU`1NifR&+P@2*%qdSD-A>5nVs&TQ%z^Hc8!zTPx6r16V{2kJ+d-GA~ZeITa%
zKGU)2oezu)zxHnDMdu!v+kVA!2TJ``US8`H8~N(Yl~<;IvB>PXVP*KeyQ|;m^x4Yl
zOZnTUce%2%`TU0THxq`e8n&r-#iB=3R&^ZFZ)^KyPp*nz7cjea<AGK0G(DyN-PdFF
zGX;vW;itk@yFaFQecX48SD(1wFm~eWFRuP7ug>>}sYh0CSg$<Q=iV-Bc7F9>_N1Ya
zYy3A1*!yGc(ltTGH;4Cq;LSD9*EW`3+<#&X#!+x**ZjBtx|i)Y#(ISFSr>H91wZRz
z5G`2nvng;c<b0e=;fE;t-5j}Ru`XpxkCo2C@OaFFonJw4w01>qJS}u{Jo1?t9tP<w
z41!xnKydfDg7dY*(N-IBQLf;E?Qq{pU^j)+0ET|*LoSj2aQ@gC9PVRD2;z;O2R+FZ
z%}D!s9tmy0Wt3r-xx$rU$F;c)xGH3rnIiA}JQBt|?t@0!X&LT-E1I9$bw+1$kh>MW
za2bw%BWcqaFH?=Xt?cKu5nq`M_o6HQ9+UW^rTeWi9DUQff$kB4i&C}ol+K6xR)%G`
zdAY{R_L)vR+F?D(hT)W=EpvHZc7zR<VTXyZ9IqeQy&dm78TKg=mX}Yx4V3+Al6Ee1
zz(b<-z(aMD-hJ@&lHdEn*U0ZwuCz6UU;^;mE5Fl<I@MW<AA(0KzX!q(lHcjK!2EZ<
z;ds}}@%%TlBjvC`_9JCKTJ~dQKMwxQ+>K|{kd$_J<DDCw6zx?g2Y}EoU)<2j43@zu
zj>4BZOXq&kx;TY@N0`3S@pKuSc^>SfGkc5&JF!9xv+pdnh#Svoz0H<JFCMHk>`@-<
zv@J2rTTLm>LqR2GcOHs<_5j{ISnae&d9WKg#4wet-FYb3_Yzx#2P<J)5csH+?ao6%
zC2e;ewi`;MI1lJAgp3Z3Y=+JVqI2iCBkg=62dJIzk3)LihrY?x;_2r;OmS5%QflAn
z9NJ&xbb_J$qvdpJ*Sq6@)DNBTlbv!$@VjMrYTvu#ke^4$5M)Q`>m1U%Dhg$M)PB=B
zw)tcTaMV`!ckiJnlI5eerN4WCVzP`+g1=4iMmq_f+T;H2K8o`)Jhd_X-3KZ<I>7f<
zT#?%qY9qV5`znseb)4GP{_cGhPr@fh?M{F9A&R@?FtsiH-2)Z08I(JcXATd*r*OH9
zPr~0%p_cihwzj{!pW;E8KD9sn-9r>=IZSO#fA?@jltccz6(?l={eZil`$)wKxqSRt
z*r3o*MS|Okr=NSY;(#2!&cczf5W6G(Znp;+zsqEJ+Ah-1Jx<{#<M%;1^>dGv&IP_h
zq0k_o`<-&#MR+s99Z@}Y$o}WDkL&1Ie30xvBm4BLVS@im_K(W`ZIGYhgJgfK?9&+w
z6#sziKPCI`%YKdQ|0?@x=#Aj}$bPu&$IE__>@Ssl+Hpnj)J}JTJomyU`KUaV{S*qL
z9Hy<N6g~={;D3?*4l@6A9ty>W%Ra}KPjD#vrz!sc>73z?(CHqEhmF#{nvSr2`h_hG
z$auad<$NDgzPn{O<U1wjWAu^lo_{kR^-&~uEPPZe8~tTO2YkOk@lZ+yeBz(B02BXb
z$p`=R6A<E`_7f5R4*1Z_ae1~79PsUj?~X?5JbaSN1NjJ_5Bb1%C;7lf=gr&<Uo7F#
z+VOKeGdl#ne-b_5qjrz*(K*h9FB-nPPN7&rKAPDlC_V_E`N<Eq<74>IxpMxWBRt^$
z9QnZCBIBoVC*hB!{J>uf-#rX+k{^z9q$wWwePN$B!_Vr`P@GE*_>Snn%P2qWkkcnS
z=!o>^<@Ar`bgIWxev2s`m7M7T{`(Xjp-_wh9MPw9Nr}EE@c};Rhyn6x=Yw*joerJ*
zL3C!wKK)Ri!mDJT&OM><OR`TVFHo53v2qm7k^(*o50?Gq<U^hf@JXIe<@k%T&-tH2
z{2COBwX$C>`#+H%p-_Yo9i)FnbRbV8@{>Fj<U@}3sK?}okuS)zjq-t?XqnzKvi~p2
z2YxdFPyA7PP5fy<kItY2DRu^32Kh+aK)w=twa7;sd7S)C&?jK&obZ9<W6U#^{4NSb
zA^A91YYX{msl7wDrZ_`k9C+#t`tIE^|02H!=2zsSu-B1~;mQZ(_XHjCp(GXY=Y#fz
z{9b@3zc-k`DR?Ql%bkx)lF!Dw;lMkGyQz|r@{P$Ui;_|@7A2)8XWn?U_DxSg3dcEc
zbOBY;{DSoKw7j&`r0kf4lquSz)P*>G57$$*a(oh<#GM+Lo>_<-F0u}8(<yYJNl7?W
zJz0mdqS;~MI&D%xP+(-(Qe7A}ooK;Go6qqJOp49QNj7F?FGw=xKo`k*`AHdRg-N-2
zX(^d>g`W-UnDm$!Is-by28W~13$k#Ec*>N(q^U`5KI|{l1<3_z*=cz=y6}IH>>rRc
z_5ViF{}9=5UO<vTrc<E>N+nB&*W;SHwicBWrnLVUrqn-=Nf&;j`PgkV9*6_OZiGn6
z!HtwK^wgNZn48#fP|{Rw(*GTAy8mL{0%LAsp8w~1`=8^@sSez5xM-UiY$qgXZ9HYw
zDO+kAv&r29x~PKCVDu9)%M()mc-Ejm%DRxU-f+5LTGp+vQNW?DuDh1}jGR0p&QP`2
z+MCo!>RH;z`yU{96LVn%lSao+jEsm+niv~9C1z^U)QHIVn6|RvRA?@m-<u8)bSS;_
z!2BBq2d?n6ZM5LTkc(EljS6-`<f0M3rDUltBy)v_-`07vp%fnlg(gMG$HOJ1W-iDy
z=C|!YMBEZG+IiF=T@sRyp^h#rX<}Y#W_EJk@}xxD-63r_R`X_PQ~zhsg4@ufDY+Q1
zVFdM`WcE*D<pqPGZf?#p3{HdEc(f(Y2wy5mKD>=lpe;+yT$-90q!`Rb@q=wIfjmYB
zGyaozyryHWj46f9eH(?jIOa3lVcNnRrn(Ax#}t@3Ou-x+rbx^U0X`AVfLKiXZ4Of*
z=I#R=rc(-o6jVfG?nY@7@DM+Qk7&{gDBTmmU4~w||AOE!ZDVi*OY?q47xN}^xp>&O
zEf$h+(`!8*qN|YMrh;xAf`pG`<8&_}Aj;u|1ojOKFyy!#=Kv?l;fJ|p0@4W|@z3!^
zIN_UzH3jyq3^3$4z7bCNjKGKG1cndOP8+_Do$zfyn0-?tWN;iG{VrAH?@a+86*K4W
zAt!vtQ9iElJ?Mn*lz^|RfG-cii~6JcX%dMs*>V1|0Vne3Ymj&+{Sgf3&)E))f*l0N
za0I&;e?&Xj0OahuAJWKix|x6@y4(&18YEjJx|o*R=*9y`l;a!<!Id0wfFpcB!(0|#
zh!)|)wBCl#S&kw>j)5{9$?*#8LzE){YYpt1BhtumIbHyqD91{JT@EZ8*ywsV$x(;G
zcO{3_sXTT8AD4rc9f&uwYg)$<^`gbv$4ta?$N4)8I8iVA4R(CK0Ot6d^|DUTi&lms
z*m^V$qFy$DF8eNuG;*Bo=YSLS@~y#MFZ%+H(_PE)QD(S#ShH~@he^g~U{F~1iLlGj
z4{;oyvm8$fa?m$Bf}@Al6h%2IK$m@wMH)FSM?0tT9S*t)NGH4U!^7#0aFXL38ckPn
z=$+(PC&+QPfX`WumjyYnENqiw1#j==_A~)&TkJb9V90SfmdfotuWy?{SA%qtBLEMV
z!<p_@fiCqU1V>M!6J1&`W#5&NMvl|{*@^BhfiACaWY5lYcL{WLNau9ve02O*w3p>o
zV6BdS|3<Wp?q2}pV1J++hjfy62%gsDtrh5Enc7B|zN?6IH=uH}@7;hQ$K~zgMAt78
zYm!JOx*VS?dA}6sVj0^;cO~Q$>2B$R!#-d`+;O^vfD`5247$|55M9!3Yw{i!=!VO1
z1l!Sx?(sVn3icfyY2-NFc20CJfiB@8x*VS?dC!0@#S<KF4~Xs?XlF@Yx`%|^^8V7d
zQYj>*(YqS$C&7_U$wdsnw<qb9{iQT|obBq8Ko`r?Ha&j@<%x7>1D_wmB>kZ@a?bd!
z3;3{{ZNr!6Bu5eO`7;dCACi@vGd?Al;(Ebn1RK6;^m`(IuL0k6hC%w%8a|bP51%J&
z_<Wr3y$oTuwgI2FfG<M8=j$YI;$8T*gs}>DBojGjd3^<Z2Bec5^yE14mwO+^iOj%}
z2*>fkEFI1dHxL2A@p9{mIC|I0X$1GY6C9<F$HVhb^08L%70Tl^*-RD30axZhIV8u+
z!{{_#8yF?&ne09u55bWv*=Q#@E(8^R(2E9%#0&4Ism`Tj<mF`N@YBd|eb+{yUKglg
zZeFJ~G4Zi(Zg%P1Fw(b&P+qc9rMZPa#!X_X!}%c&=TFIpB;cpF_*E)?i|?7RP(H@-
zGq2K$g4pec#?SX^%EDnLhv@(v9O=-vvIQ4-ZKoe%HVyQ{b!67QZs)pP#o0QO_`xPX
zQ_x>LXGi{3zo&G@>m;j|MX*1lFgW@>I=kE6fjb-$hJ%cWlr>i==fcl;ZKtM7dFA{#
zJYC{yF@CV_32wkrt@+Fxc8aL*dv^y4F64KUxMlK(&<Q~}fMz@W*7QFju3Ji04!$2P
zNHfyyt^QH*6Qjl@O^%6(pE_oIOn`>IDW#<<Tmg-rIAP+{i4(>|*`WT*H(6p>!JP9R
zOMk>ty&(4#{o#Am`2MgQ`~EP3iz65~e8RNDVn1dEz$iU~;^C-0vEfQYB7#J#jN;*#
z?@Vj1ofg#?G=;3@U}$_(NBg^8mLbqwA`i7vcIWC&GJ7h`(>)b*>;dJavEz;TyR!C-
z@{o>be-eKFY;)9}^mhusXG@j(_>oTOJDt+Ca-&6hr8~{|9zy~n{50PuM|!0@%}6)o
zNRPDNsX@k1UO#-$ec2)0MfwhpcAt$s(I>0{oDxVVKaEi~P#9x@$H|AnyTk7Uc+!Uw
zV|ub53iJHg6p#GN;M0Brh7b8mC?5GW@aa1=waxVXIg5N4!8-CW7ii;xWvJ9n>jLwQ
zxEpMF603_r**VK%+Ikta9m8_qSnP<w@j|v+eQi$5%gfHeI+pWS=Ud)K?2-qaE<G=2
zF}pW9$ry9v$7_dXM^cyVp5>b@s?zsqT&0$?ED1MGlf+;f_jhL|jJxqWKx?by{8sJO
zzk=IE5(-A2nGfYqLA7lG*N#Le8%HE<`A*>)4ZfjLs}9{x#?{_hT$jUwxjC8H#xYZL
z_(-Tt3QsM_!>99{>@kJ-W*EZW$HW)vV(`#+czlVM97^4B@$%nTs#GjRy%2^tifGh_
zdSTEaS6xLZstLWLdNC)BC*%M;YE#LL#v{TR5N2&Td~(!&ki(G4VGZL0AkZR?>NfF1
z_&o943tmKg#}UWcd-&uyzPkZOLrDWg!kq#FN+Wz!#W}uxco*?$5MccS;>mG*lt+X!
zAi(+w24#mM7?JKJK@Q@d(|rT)SU#{h+H*qb#2>Y91V_&aAS9f8u2d_B5yc#(k#okE
zCE(+0ZG?~Z%!~NwZZeL8@bLF4S<ig#MF$IxBLLYE96cM!kGJN)E5f6oy@sOW_$-K|
zcPdkI1m|jO-W@<Z55du19ntZ$U>S}l6Wmq-kYpvN1)NwOeke!{;zd1^-d6*T<3dnj
zg#HXN4PI_!3q!QhNSpr^gVMY7m*0aI6t0y)Zap^N-kB&XY<C5DJ80r2V_%$b!^Wac
z<K0%r%6|}ERaB@{7<*&jZ`I;jB4OBjyF`(u1SaA<VWB)IMg*0(Vv=+M9KE(ax4?Nk
z_ThEWYS3C)jw5z(Kw-GWpxj{%N&8HHWe0waeMhg#mHp_(5)85vr0Y-sMQ6(?{W2>Q
zp=qDFH8-koh!K8Tv}QZq>Vvb5lsMf76BcEHHFUC_bz?hIb9TX965U}m5ebk_q}zQ<
zX&9E9$+Jq*5sr^ia8+ZDbPpIKvt-%LH9W=A9)}#!u|hn8rQ37j)FewM+KP)q4I^<{
z9v$<C3>=zsjSH+&GpW14C9Qdx$@8<)h7MhpoM{}YSzLfYfF?V~sG%7JO&V?h)exj@
zPH{u>(4o{lr820t;bZVgBG&&$=O8q1;B%0Bs0{eL0P~93^1Na=#lyKu*C2j2CBn_3
zKSKU&<d49war_ZoL}_rJ(;p7Q=Q&TyfJpMg^CrQ-mD3+**doAE{7u}Azd51a&F(xD
z9TbUZ`^epg#|^(8nF^%z-d7I8vpEm6u;Y+E7BRGrOYpE%#RGW1OAf=cIS<<mL5lJq
z{BkPkkmfKxLSszrZm!G^fl*j)Dw)n{PGY45*-`pm<@}^`nv;Y&<*#!JuSR=Mj`ZIh
zn^5(F5(yuz4Rc4~B&TpYIX{(2cg%4f<G}C<ewP#cMllRtYn<R;6Vs7Kdw#hid~6P+
zQYf%J**+)YVa$nmI@y*I1C5dJJ3^*d3L|kMg;DI&<uLV!osd6)!U#}vuDng&Q{Mso
zunhMxeA<)!nH=6jKGx@XeyS@<A89_V>?N%a(_Y$0ipS#Z6!HO-D8tPsA8^IwLl_Nw
zagXpk3PZOg<YTb8m3->Z+qOGJ7k*=7r_-V>%uHX73#GH#JXO0XqMYnBAiCMaN2g~K
zAG$*tjW9M+q$V4aZ<Qy+mIqs;a1(Zvj@V`MLVh7NNtZM~4_gmYlJkxBD_tGZSz}CX
zvF#pfmW{=<GOxU0BI$rIA9sN#-#9B2uK2di26;Z*CZ11wNYXP?Y+PV%%NBPt<^B7!
z#+zZ+IjcD^#BLu+$wr#6Qn{rSW@0xoZQpcZQ!F8b^|Um-Y|G5h6`EiwlbFdwL|2fV
zxuhVC%w^FSngB}3W7>-TW>PQ$uB7-+5OyUO={QxI^QN*<!7XG2AAI60&WtBa3BhJ#
zdFg<yL152#NE>F#H<>K|2Y33=??2>j01Xt@m(Xrz3H=Cf(yt(m-fuN`rtb$LoB?6#
zAGxD`fE@L^;v6R)h$)TceZ&v3Kyw)C<wbnC2)n{ZFe1L$0zSgQ@oj;;BEBt1V`Cin
z<T!tu0Vm?i0zNI$i9e{whOZFJiufqN#zTN1$MMnJOvJYt_zXxVd=$_5qoaRCeAMT&
zF%w|OaeUXD`1=<4;*d`GXq>_E&A|)d<8xv<p?M3!+))}marh(7iGK&2=m>^fPlAI_
zx*$hzuI9ugGMog3IlO3Oh~)U5li@fyf~(`1;FBEW==VyZ{`^n~G)^FSX-$I5>jgv{
z7owRhAD3xxy^s!v1j?VE<Vo?Z=EOLow9Rwk*JK8Qi2-og*(NQEX#IPTeSUQP{yDq<
z%V!_b_=zNP{suzhDSF7Uy2{7<^87<eas8LZ`5HNi^3u5ahyY4uhvKw33Qv<m9G;CM
zVMlD73B%AJoyKRjPMi%TQnBGWF9*Mr`qMpMbl|N<LoWKOX#0R@a7xbN#cA0X0%c`p
zFG|ZBl#@%7;e5pnm)R4Gw&98M=5yDJ&azJ0;?)31te)GUtA7a@xxODp9KEBdVNSAd
zIRKB>RScaS;0y>eJAhA)%8VR_;0|?q3y@P9KBqYJ0krliwoMBV79Hnr10v~ND<=}1
ztG4NHGMo&iXwMPI5j;rq272f13H`Q@_KtAJ<=ue@v2EH4IO@Ad4)S^1^ab8IF1)g}
zx_R(94T2;2Q`6=bEU<q{*W9vg3J#Y)rr&zKZru<Nfa7gbB%?0H(O+7BlkU27_>`>P
zW}?)R3S$>()l9m?a(DUr6m6ETD=V!qo>0%IP<La%H71&1k*hJ0SmZclBk7FXe+fOh
zBPCV|{(JB?7(xCj%X%|@k-ywTWo>S6iB<88mRL`q>~5iDGHW-4c!C`x<j1#tHD4Ma
zeISgz0ZfmI8Uxc|je#i;AN+SSF6@6ufAZbA4h2R6jig($=rV<x0(Ikk((&kYPfm@|
z*P_N%J{K)+IN{ssW$D2A0&wGZmXT)p0zS)X6;KSb#CidRs_|Z+kn-Ol<wtI5;ZH!|
z)%Y#4aSVK=&&F`8{H~IhW3l>aQ<G(x%Cg35J7w0l7^mPk^UTV}8|v>jS5^MvqpQlS
zqCm*hzmCqKm@bGp$da*>L#?X|!1fJy-NB|Ni}w?{iqeC|?%-eF$=J~{Sy_6p;5S?<
zQD-rrggzkxMh{D_(jpMI-7Vmta`4ZtvPTJ7a#fZ>FEEz)?=p6W?dW>quM6j|y{>|I
zBx6b91uy8&`EEg}VnTmDw&EOVS&D0s)FoFTAnru@L)vSpY$5GkwhZ4y7u0-6C}LFl
ziAp01#k15}aH-)X#L;Rs-FGK1=VSeNwAZlF-UVwcGgP=WtG@mUE(-A0*HNc}Q}QbT
zkCW_65wNW@BMSR*j9GMffO}p)6oSgF!gTyP4!Wm%5tZ=0U}^x9)~EsC&FRr)2j&?n
zfT+y1rsFN;%E)rn!{&+JbhQ6OFSFLX+7s|Lm2iV}u^#TIPn2(*cLbHO!7JdLxdyhR
zzoLF<KlrY1HgNK6NgM~>v-L|{|KP>&;!cl}ZjcwsAT)#ma(F`kAAO}Um-uh&A(c7a
zRk-2?tNA|08KfJFPw6+t2Ae@-dbHi(nXN}DEvhHX<CJFKC(OICg8xb5W}*j%=}H8t
zx?%^>5){HG<_NFM7!@OcYaD!Zm6Cx-H3~6Z5VMCR*HVqDB?7ouMfn6ViZ26Ldy~Hm
zC_g~~-i3N#ru$@7<~U`Ifto{Dou@Uzn`_<10wpnb6MIIpGc4A-V6kPo-H?3rb)QOx
zbcJ8JBpV*+PsjCRR`<N#<;qc#^+@;H;@%3ua%`4>uQ2936|Sctqlqn7ePTXr9!qzP
zmnSIA)4j}|oM~<<&iramQ_TIvyFK8s4uHa-rGc^~MNjaIu#7~b8qjR6Ms?DkS3k55
zFroof16VL1>4G;hAi4z8Ttf!ri7!g9AG(Fo5B9SJ<>@QfkH2I;e#S%q_&eKAl=2T5
z&}B;$E+gDz9_MNH-NX#&<Hl!*AlO9dN$k-UG<~`9Lvw`kkJ`^=?6n)d3ATgvR>^iy
zaG_|M@O_A`e?((J{jRm1KBaXsE8n$7QvJ25loyJP7t*=lTD2#kf3ceY>tFOO>XL0h
z@uyqy;ZLBKT&7nWZ^vCj&6YJv1T*yNf{Pa1!WgG)Y;VE+Ey^b>GjI!sr!~$ST~UN3
zQe_$IrLQ&i)`uH=q6Fm{4->|fV<QWiOcmGZ>cX+O$jaD*Op?B#Ny=fi#d}yN$0iR~
zj%$55jt`(-&cf~Zn5owqy@(5Q4bcyCq~8tn>AsQ4(w9-TOYzd&B$}fN`gX)m10v#s
z>K+PIst?p31+*B~{6SUoo=CX~#u9038|g(Kr$mQNy?DW;#(Su(P4Lq1HQr&Wy3XLt
z30{`KnpoBrmFHd8?=@d2XoSveJUQv?Psua=-;t-+4f5P3%OkR>t8ijeE@SX3jYr0-
zP-El{zPj>PA6<23HPw8nF-J@n#9U@=0dCw;>&{sMEi06^F;cnr6O0dwdwGH<lv;4v
zVc21_DALc3ds*e8mWx^Zq~EGOh5BeK3riR(PXNX%&w<__)u}wzW0f(PhAHeuE2@te
ztQaRErr?5QqNh2|lPV-=K0#yT(JISCFEpyYsBEMFj2SH5Y9b|jnRH!WX|6A5<o3(!
zoOObyST<tG2=d<0KYT=5<Tx-*uuMP$pf2&loX}j2_RkLk2p?QvjEh$@celOO4#2Ht
zG*UZ{j(I1MKqavmmEOnL8Qlk}$8WlW7)@584e`yaX*+g?SoH*^3wP-*Luy|KbKRiV
z8~rR}l%;zLexoM2aTxuzKo$uYbVC~G_kxxsG!^Q^QycrzU0Kq&(bkkxHtP9$5PX~`
zddm`;a-#+D1^MZg2$f}$7cQL}0vR+I`1$I+jD2y-6?K3VWaY=&&z`LP!scdw#B0zN
zm?wD!RG}Tkpb!^4(V&u-DP@$)8#lg{Y@#B{!(@=g9_rE}3KAMjX(|J*)L+pze*%^;
zkUd|n{5xL6L97N6E;O~c=iOPZ48;h9?UBGeo$}b#CMQh5_73v?7%^$gV{w@o8;V4f
ztKOA{B2Wi$M@&!fGJA2$;pS$;L2Pg**q`HgR%nlH{RO15EcMbi8CU(m$`)Xo9Iz%C
z{T_FEPvh;fy`ecq--NLZo5D8U#acDYhG{I!`uNFo8Mb#LT^Pkc2;5dIh~t8C*~tHY
zN<P*9mVEhty8OI1VKfqq+ri`l6z9ixSSEWSwWlQza!8fN+s}%j@gFF)KUZG=tMbsi
ztj$&^$kXb0$KJN^`Zf1YmydE2Y6t6$(75<xyyI!SQ?6e;p|P8;LbnGkg|cBaY6z88
zW{ekW;oCZ^yKG_gxGy2WSR8FPM&ryPKo7$a)_*j1rDQ1$JxR504_lc*=jws}wDdB(
z37+WCHexz#_LfF`>TL*!^;poKWBY_|4_DmrAtTLKsW)W9Mrj~JHwoT)ipr)9mRZVx
zeU;a!Q@n`A#;aWU2ydS(p18PHzXao(KiCP<J(*tRbX~cFlg3Mhz-O7H!fF8~*5(B2
zr!2W%<|SS<{G8-%$@Mlb@ir%T6U-7XTwra(V;O3m=!x6q^%n{*$)neLqkOM35whsa
zv7U4#WIfVhr_hV7-52%B+eksbj`q1q<+xVMIwxV>Mqa{og_GlU@FTKQ^Kvp%HU2tn
zNC+<M3m>SVlh;x;IoX=L;P5cqtCt#}Ny$piUZBBAQ*>~eMi(|%J2+6|pJ6oS<_{e*
zBw4~SctK9if~>UsoPxZRH2Nqq#F&$lh4Z;Gvxj75EnPe)H!o*lT8dGVs!tEsrw6C%
zaEV_~Y6$MyOAATS(#?G7LGy#OX(?$zsewVEfdQ?5oAQGY{M%F}3B<omv9rNbY@5~y
zE}GKeZU(18dKLk}(eErB@zIZc6bcQZH&7bfc>3c&(>;QKXgd4>rNOc4&S4NHe(NX!
zt{?s3X>+7~bHwX8iidlZ{_u2hFCL-^&WA=XaEz8S+^Z5k4blxV+zJBba4`=l*Lt`w
zAt--Dr^+xc&ww9B=XTRhLFqf~1{s!}RlxDd{COlh!t#A*uZgs|EKk_bG9FILcpo9(
z8Sevjyd*oFu}H3+3t0DNNp^yxGZ@Jw(H|$A?vw3sbVeh&J@m&JZkHX7&Tu66BK>iO
zdt8FkAc^lAPZr@MowHwjksTbBaosDz;Ja!P&=Bv<a{3uDo$KzHM2pH!LyJ~$MuK<Z
z$zv{^jV_fP;f$AIzoZOKu<kVyPJ*L74&-hH$M*v4C17WKAKUSLCgZym+!+~exQlZ2
z`2W~@8~CWIGk^TfWC#-+yaP@(*0c^dYN7}UL`Wp!fO*3r21P){h6q7GgqX|-TBX68
zv|NYTrMqs|-E~`b*LL0AwoAJ%V%xO|vI*ENf_Cwx{VBSxWp>yWUlsyo$^ZL3FL&-t
zGJv-Bzx(_A4ouFy_dNG`p7WgNJm)zt_nb-80jc{T#0=b%GnZ~bgM<qssYbyy;yM@Z
z3z9vi3>(g7ovQmqu0wT)q3cXJ$eIaUcj^uW1{O}bLP6FS8k|SvY<MOVh*gj7d(OgU
z!bjf={j-^uag~|9myZjK@j2<2<lJAHbMKxhCcd(q^ec1jugbYs6P)U4fmq#}0V&A(
z@`m`Y&LrZhz?hbEUzKw|-S~Z_A8Z%6K4BGXoDQ6)`_V{!C+BnjF6Vwh*83xjUUkp*
zgX@0Z%7OncmCm+<>wLefR3?o3G2Uu}dk8U*4X)$8lM9{@#^J}k*2~oWUyJ+E#vJND
z0^5MG*o=0(!p~>qe}}41`u=TYQ`i=a#b&i%SNC#n__1P*HDPJn$70jkcXRkx<Om}0
zyTm2#f1wu?sPzBLdB0WV_bH^0#U{A#sC(M{vEE|ij}!sg^|4sE`&T*de@4O6o^x;a
zIAVr9_>ILTzheFm*MBMQ!^U|ke=XvEyzxsV58B+Z-b;)FiXLt3Sns9Ad<9QiI@Wu+
z!M(&8Xa~n)6YU9E_g5M#6@RpAW3l=5XS41n8ILLf(VmUP=G1Sfd)lqB-YG_rqTeXq
zzuMT9Bfo?yZ>>-NsP47?j8^dD#QOo`%^dyUnyOJq{50YsRPP95ET-W)dEQqe_Kla{
z$?-YyGG3_SrA)s>uFd*w;<*%fA#Sn0gL{Q*KG`l7m8$(>@O&2OBMu=Z{TtN%Z7SY~
zn0ONE{?Amb;gJ=Cd$*VIIn2v98BfgM%T0d*>D)t{KAMjU?L3I5U_Ua(;DhDJ_h&P%
z%-~`9_+WnKF`g=YIKs~&9Po7Hz}G4Ks~7|S{fq(sBx4ueT>j=T9dzzu3_2d-#d~uV
zorf5Mzhn-*Ts;5I_pgy_gZTb&-n-<|q|)=r@t<<wbMZf>(#86%aqv}f&vFQ#;XT%4
z^0QyX2lK$A$VGWpA)hR-Z!^Eh&wnw7yu+x!l<Ne>z}L(e`D<f*8u{+ZLr?3^nbN<1
zhWF2uekJ*Ll|vZ#D7SLrh5mAFr#oHCUCRSm6Y{7bJn+!mcrKUw>3NU|wh5luQg0cv
zTo|+7F%Bc<`a0SpFJ#rm7&edP>Gi2S(nm;p$nPOO<a5}(61;;??d2Z)MRKou?<l;-
z=U5Tb!x-+5*du*3=mNL*T=Y#C!|hqY7|d;9JO*?aLwSDA7{=iw;}Gl@c;O!EO^o60
zaLq3FP~XZJnc2<wLexLTp9UT9?7awd7&DV<Pxa>8Z;4?SO!YPRU07d_uQApxJ=-tm
zD=M0sSFgNlX<J+Kvb%_9<(iJx_82xU$41{Vd{W-@@i1|Z$Tj!3tX_%lGg`$5BDsh@
zmv{5^Av`U|nfA>~o6$2DtN1@IPxxkD=WYm!v*iZs?-e)V!~T^+5S?AF@D&T>+tJ$m
z8zWdMIMBNjoMkq!=djGh$7G+MA!rS0Ub?pJ0pMx++{e=tD4;GC=0%|Sh}j`KB0rj^
zx*^P*rC`MO6|GC#Te$?5-+q34OsGrCaN+<@9ayup)xmYTFKFbaDO2NX_^k>*QF5;W
zKFb_r-aa#>%HinbSK!KK?xKV8UeghSwa8^K?~BkjzW34ISlPU0?Xp&}nmJ1hr=zm;
zqrQ`6X(TPJdU@$&y>tDUR$C+QDkofGeYzq6q~iZfkXamvrQ4^&n+2Wu@@?Yj-pTM%
z&Qca%%H>}eepg2au$|^Kjf%;7Ie7Ej=87r!0ITl)x{7<T-^SAQEzNE5_SWY6SGLFE
z!+r{ve|r+3ZC=y5K8E8c@KtqP&S4s7SzlP=JK}eBENx%e=G6F{lNZhs6^wezvSqra
zuVf2-FAg+N*}Oa6(!Q)2HM$jcKkHe`();2o+goLIcUIIdZ*Ofi?iG!>fe#%~RgH;f
zl(eg=)lFV@mwuyR!D&io$U8av$m_B@%`WR_DWJ(HFbt`8z*%Wo13PkWTT8nZ7Y--M
zws&V&0V_M!wX~txz+NwB`MRUqxPYBU0f}!8aVIP4*?t%3;DG|6*oQ^Jk5h&9YF~>Q
zGJipSU3RdYE%~f!jm^7tBP!a^dVXG+K?&jT|CHuB_>E^7Zif#H*V75};h0Z@AFKo1
zU=i+t@62mNBG7Ml2e_*u*tl@RMe%f{OcH<T&ogub4sN#*<qbk@So-iYaZP@Rk9~or
z9DLjGY&d*#a`0^qXYj%Ockuln2VWS>vM;QI=I@ytd_N7#z6bf^kO`6nf4|DXw*>fZ
zM4Ap7Upfch;jm%gzd?MIgT^;KN6z|t4uFWD@hwEAK*}kP9^8ymFpM<ZB{^_M0Qc9!
zz+DVDcX<SWtQ>GN@k95=;g4sF;lD$7EBZN4<6Z|%m*WU-d^O`T`Q@mw&M*5*ZhT8n
z_z!Aih&4W*wdaOA2sn-b>Y(BN2ykw?i$Rxt!<qQ8Z?EZIifcE%a^!!wy{z$i7QQF(
zK+6T)I|pAgh`RA@LpeT$bR9H*cL2`K-%o+B6hJfaL-)|Z_eKuBB~Uss&!iA)e6Q!=
zI|+O`zw9gP{Qf?e!+)pT$b^`S%E6Zakek2S@tORhd+Ol3AcwyoYzD_Tb<q5sm&0ES
z_?R{mKXz|5e`|5==C2L-_TZTg8s9y5;O4Ij_`-Nbe4Gu?_;%phjW3Em{a@ml4jLbI
z*NyK<7rrpkG``W^Y<x$6uSFw6tnnR!Ub^Wn!5G37!@#`*I5*v0pv&@NJ}$ve)7=MT
zZhTufCNT`Ye*usi-_L=sT;ZdxYkYHa^3jRPE#~1APMr^N<|Up*)$;(DYQi=7yBt4_
zuPrCP6vR)}JB&2G)j9d)UczCd6JHsA8sB9(_zvd5H$Dg7LoR$*y6`PUy@6;Pz3;(T
z%?r5KLG#xPIJf+saN)ZOz?#3}9DG|~REEPB%E9+T7e3AsX?$J&Z2p#D?1*EwI%xhn
z0q5rL=PrC0PIU0SnuBjEjFgyjR0uV`pXT5@>B5I$NC#g5cyY^*MygRWhgjnq#I>8h
zl1Rp`Vffd<_aWp0(vHv32z=Cg9Vi!u%K(%M$9o+#+>;<m{t8qA@r5-IVhy(yaBlu;
z!CyJjXW}R36c7{tqp;g<x+{QB<3O@={UF<E*FJ89a|iOoaGz?=NsEDSUzeBSFX8xm
zMZxK$kr*R%2aWF)rGKc#BKQHf*u|i}d^tz|V#x17yfG8M>+mBS^LZEkXk558mSODi
zAQDM0j341x#;xm@wu&!=)wiML;Y^U%@~_^<t#ZoLN(pi1??T^!EoG<_e@o%V=-i42
zV%_D?b>Cun7MARO9jnvDC+iXzf4L4R4}31DcxQNce*NOCu+4feKRgz~7ukNSxfRUm
zmrk=Tip#)9Ru{(3$J#3SnL?p+HPSB3`yHV8PWBMFcYg!K0<{YT9=je(-v&O<&m@FA
z_+4!dyo3`p2)L6)EkfS>B@=>z_$FwW_4e-fhxv|Ie5NE>bba8ezshyE&01%hy^ajR
z+Tg?YJ0v8y$CrR3#D&%8!%}HqGKRIHYBiaT^XWrY`3fYOe<%K5y3UM#6@Ltu@sD2T
zg0(t#U=0b=YWN&s9RIk|7pU~be2!4YKdy9c>&*8b;&TK{*<_`26<ZjOp5SwYTK>`R
ztF=Ju6ig4(5VCM!&5>2m3J7U`-jN{Ld<YnFBJ;_G`V5#x%g{nz?^bk5ReFs(U97ol
zb8zT&33J^rieI)*s}+t?cRFbBHedMdug76eEECSW{szv3D-?)Re=-jWaPs;s>Xv%K
z^(6CLIilV7xf%!FD^o4>hWp6Dyof+O;rfx?N=|%8_zM+2mND0ld?P2FXZA2qPq=<0
zpwcD$XyY$cI&qD`MA>~g{FL)$1WDgC-j%mP7r0);QutW*V=*!Juu5md{aSuc-Lu@s
zVxsO|b<c=2OBFqq`&dle&C8*$bxY^}>YV)EnUkNH>Ylnv{@5oSg<@rM?>iUI^4wp{
zboj11J;HkwFWfuvKKbK4@e+=_6ECI~jUwd}`9MTJr%v-;<3qDA-~=ALPtD=`CF(iz
zN4yn?IX|iCQg8TN__UbZoyBw@y@4@0WE#KVAAbbjfb%2W1Ln}3F+Av4h6xYZL>WWI
zOBh3zos4~Q-yo=)*hi1^xQF;0J`VN83uF@*7om^Bc$D1#kn^}%qlK74t&Xo*+7iEe
zMGX6sDUYTjdj^K{tV`qVn9gy*3<0SciihL=x5TP3qk1n+DvY)Ae%b0_=0hu{uEG8<
zIC9!yp`x<ARqpdGQ-;pDR7`Pzo7-aT!%dhBMSFHonaPb@BF+rOFsM(HCTAbqlUk7J
zkUZCB<{ab%!OAsiLM|g0jNC3?x;Bn&Y9z=qJ!dx@NZy$X`R>pH!)7-wCRy&f6dYOO
zVYc8EBN~uX5<HaBc|oOX1sa+zNahY04=10GxD$^%D;R&yVY}rP?3{kfkg@X|C}@I!
z5_3kmX%#AM*uz*+(atWshPtgxq<G;W)ZM#X4^VwY_&P3ljjAq!>>H>XL@)^=+=#z!
zxG3&vlXRfHW0;K}%!9Bmyf1<6U|JYIk|#deB$${id~LWNho24_A8ESrO>p5O4vp`h
zaP8)AEAGqi(?R2V77yI`YFzkm>EJsL%)0UILmJyk9W*`@aBh6uTaRgB{P<k+_n#;a
zH$L9fB3%cKF9kR^zQw@DHYAK6&8)`9{fylBXpe{EkG9^8FXqCBX2-#I1+LxrI&o8m
zXF6#9Smthgn_c;Jk2fC#oEzUZ+_25mLF4;59=P#6;o=X?ox|V5c;Aih2yTR*sSs*>
z58$~Q-_yVs1`K~}Yqk6~;ToWh-j_q}^i6co_`2}Gjqj(xSBht0{IJ}}!8bmqd^>SZ
zI2|;;&*qfxNmqV_Z-N(CKRCWl{&bb)esdZJaWWqaU&+B2!pnpU<42!F=l4S(bC08N
z9hEzf7DJkFh|9&DTyOPtb<K!r{QW@j$7c)+HKX!Y!0_@#1*gd^0vz`Z)IsOt#{h84
zncu@L0#Fz~_jvPLfYZ2$<L5vS#RH<Gk3)RS|D>z04!gsd#!)6$T|Gta7I@}yl-kdO
z0D>MzS>xnZK6i~nlpo?FXY3$|T{Yy^?)ZYQv|q@ff2NRu^I2RmcHluDn>&Go@%dkb
z2=L+Ex&6XK%fW<tA5w%m$a{P=hVJ?tK+5~R{-{8zHfYh?RwXwCu;V<x?F^XP>-bG1
zcB|kAtUmqSvDoz^@qo|1j~iT!+kp-12alM&4L*G2eIE9Zs)-CX`CY*HsFa_4zi$SC
z_kDAWk?>emM!a5TEpeYu<qjG6tVYH?xZ*)<FJCE;sbK_c3=}l5^Vpn7aT5Feh<r#<
zVc(omeA(P8ccTyqlu0J!lXphaiJ71oD*>BcGU>wGrt#W)o&EKbU`1`?Z|$PQN(QGc
z)Z1bNjzVglm}wmj45E|-JJzmXMUS;1V3>b|$nUXU9kd3#u~F85Cq7C*<owC-&Z~U<
zCms%9EGLtTjEdmHz7l9am~T5eG6)@kHPJfIFjPmFLwtXY69+WgT|H*^H}FcL5FaLT
z`w@sJ>Vu51VNH~F2)mOhO=9gbq!My;s9rpVl3b$8RVc})5+fm*h0qdfmrovr0O`oW
zz2c}Z;)xaF6GwlVM;~}7Xn7t3ioCdK-a_Xf1OcgJ9Ma6XifvS8#7?A=x7^S<IA|FB
zso>nZ<Q>hfp8*_q;K;j5U`|}e>e4T8WLH654Y-}bkC1Nnr{{_9Mp>_%vT~{xz`73u
zjN@Tdkb%O9FJgyBYxi@j0dsr9SgZfMQ@d-<S$DblT#vbZv#_)%tB|?9OJ1YyrNvGd
z^0QTF1iOvY3}GWQqtHpSs~I(#dbzUmx`}4jTHJ|UyVAFjr9?R@>S&p7?DJHC&41(#
zMg*M!Q)@tv21>>&dRh~sNpSj{NR`>$0IQ}em1t$~U9?qg#J3|m-vdkR>5?^iHH^cI
zJp&XPzgMM#IzzJ$`;RvGJn{3B4L)oZfjpN(KMklSOhUSao9(O%SSLoUI~Q-2+53(C
zo8};48q6miA2F@%KyANby=W#IJV0t65V^762eERi-wS%BfSrI+PvDhVV&4c1Z)*C<
zbwR-nzi$Rb{rG612ODlQWY`2Ye8KyHxdA}S%>#wYk*!k0SZ?0m^MU!rh7z;XVkXTo
z4HFV5lT8gZh(enhu7xcr_F%6y*XBptJgIM=8XOdiia##<u<`H`2sc}0wZ3*m7E$oR
zss}Lc3u#{l$wOWqm&ub*X7@=~A%QyE0Dm92C<N!@R;~#fi5aZMf&mLQa84xBv~Zrf
z4a%~pa>}AyRgWx-!Q)Ltw()Z1DsNNH+l|iK(c#_(Q`|XXK7LIw6N{P#<G~edXEjej
zaGIs%xECsQEo=O`F(i*VqPb2_vHKfn|Iof<Sb_Y5(jpZLi!=r%eLg5T);`FO+k;Pe
zu&W7PWT~YK_a6chfq#CawrQSYv$UmTQNwHs>nRAtuSXR1#BWAa?uoY`3Og-Gr55UN
zEy!Hf)VUHuv^R3{!rB!S7-Qd&t<ZdpLlB64T|TXKJq>%}Thf0n9%TLqM)3#sQ0_;W
zFsz>7&<!XZd%5v&C&07y54)*p6|9Y{&vI${X8Jvj9V|s_#=3?&SB|0*zSFR7O&BDU
z8&eyJpx%X{1N2wuw`dblWvh7+v@BsG)_@WzMH>>9Sr*TxAgRhQyOy)coP?c2>1AHa
z*f2aL#S~8)RIg0ICH$#U&4?~pS*Ch+CfOJe8+b+o=9nn<^zqwfVx7-MGk8X42b&;a
z>rvQ3?51G9P`0!8ZQl*d;imfHib0ss60`P|M180Ln{w{Nh72X~bM-7sVu6o4Fzk<o
z5*tDV8-n&g@1a8L7uWUvqOhRm5s}4__*-i?u<F-FYEb!wCm=dY5PU5&i#W;{kWF?&
zv4BK{9MiyB)x;FUjVh*FX%N?ZGdL%*3{WNJn44(HVs=9f0EPSp>qF4KMrqBOY*jpX
zR3jhN>PJp1zCNE*=jfYtIGm+y!XJ{2&e4&c_<6~CpWN*UrgtO^uaRDf?by&PSjR_k
zPl$D6ll3D|af8O5O>@N-lV}^@X;{b6Hta#J?A_LG6Xg(!YVHVaW7{U|XKC&9+6%BP
zj~_S1GwB@RU8im6ub0-RUNo`&^}_Zn@2`iPmEEt;*!}tm;5Rk`+f=1J4Z1nD3t^+j
zB!tEG>GDlqC3Ur2Mh}PVY0#*nbwO|JJnPixc#eyw8(IO)a$<1FFMD23$PX@C4w6jM
zo+z}|hm2T=4YB4(laO-Ha{b=Pa{UhE_7Bp#hVXM*e=B1vXegjq<$ND;9%GTX4ryV+
zi0q>rBZ-C(gn9?&C&SVg;$NW?LC?NM?jT!e9lWmhU}1spD<I;OCjH>cqyY#U@jG=9
z33TxviEIi>6R(H+Cfh4)C9CWL_moP33oQ*czGn9;c#_-6N$uprhEQWcLy#K>lAlE2
zE0U$ed=Ixq6t&Sq9~>=Df33%lS0DtBbi->s!Vk}IvEJbV<*GTLD;^t-%7@nNGpMM=
z>5Fm;M<mAo4fb^m1ee*B#ZR$hc{>6NeH6#xajJ0DuvOUAo|xOC#X}ktS9&5EYCLUv
zV<^$&!``Z%-HqHF2GV*|O3Sm`X{$b}zISf$%VXmfE)a@i?Fx4F#6OLSF~Yjeh>z*3
zM;Gp}Ka-m2Y_Kfc^{Z{DeRBE_D;#|;MtwSq{u(=BBD-xt&)&KAd(3Xlqt?6EQHq;T
zNKkiSZ3Nf7?-tT>!9kfuKQiEnho0riLG!PAJL&~Q>RxmYp5>?)pRG>%ra@%NFG6EE
zVP2E=UC_Lu0Ywp`H*a=7f;UoSs146X<h!Qz6fVU3HB=VTtU1+F<1xSdeI)4G7ZUD%
z>U+b(u9JOw@+{!e=Q!_G^x$a_rWcrt*q!<oP{5TBbnP*_c*0{=#)(0*%FjDHxuvk#
zwGr>6zJQ^iv&?6_B;A;ggV;n;=9sFcOl|};B_;O!(kxs-7LI$(?m=8g+Hi>yMdtR|
zVkG0{c}=KJm3sVuec@8LB|iYW><X4kPXHSQI-WqqV0CY{0}zOhg-_>b>lvMZQkzad
zrFH@)2qyqfqPnq%?=BnrDA-^owR<4iayIt0Z0zT&hJG0udbay$<k3Ij{xZ<GD#wSN
zBP4@rgr^gnr&0Y>Nvi7&kg^6w$FF3*4JviSi=D3G0UFR=@{u*fmHG}IC2FS?qrlnk
ztDVLXCiJZOYo{sCf0}H30RvEqbEs*~7)8-1qERgM#KwcC@^l#O9mFaJD;((xi1-^Q
zv@&OKB8V0R{f3*ff%GU)jn1jNE4*S@+eki7W3L?JA&#@hDjUZL1)w)Lff8dP{)HG7
zl8mJ5aEoj=X}%;B(qrc$Wz{789Q~M)=*3_!Odp+)f`<KvU<jHV>_Nw*`{P5#R>*Ij
zbzaPlJ3q30|NO>24oqYXrhtLO#dh!hl>NH(_Ng0Crje&SJ1~QceHM2n7W&M(7dWPY
zoyo4m$OF7Ev+M6rnb8^rk~evdKJNkFFr#54!8<<A?QD;&yTE>Jf6996i%2$W_j^uM
zzi(RXA_K74?xhn~wjVwFAhwyb9s{XlU^3n9=YECmz>oN+tiSpd^N~d$bnUx1n{!>U
zrw4Vfq1W!U_LwuRfpebYq>Fj|d+>&^Czmt<*s&Ryv1?v22MnM|)KF)fhiOnDjC9dT
zvCVW|WD-itUhlW|dhBv?mJTp$$d_4*HX`Y}z&aJ~7=ey^`n+V|0_+l6_L_A(Y+C;S
zHtg3pP;qO}e%U@yw%2~)*h`+*t#?OeHUd>HkGcKAO~uifbK^&?6C*(!yRHSzN4^UT
z62RO(W)l=*o@Y~&2a$JElNV9JrltZ!zD-R&L?bpejX+emsi_dr$W2Wntsd-Ah7CL8
zJ@B$oKEjE<9KwdPy>5fO+t`gJsuX?oGJ7v`oZ3Q`4<OG$>+OS{eaXOio>Nv|uwu{*
z`liFWOb?<q&p2X^3Cyti!__C^zaX#GFUw4t-Je4F^w9!DLY`OY?~gWmHjRYP0;#VM
zHB_0`-Mrpw?KPA29OH3>jcwae$E`juRH&4qMmzz(+#&Bi-!#}Fu>O?Cena&0%RzF2
z>gSiSU&nqY_p_{t*dK_hE{({!fGY<{_0Xw8Rq+ygK)cNjKhA{$2iqzPU%#Lzx~B;m
zf~;ETNchvQ`?GV_=D8OAfoA^qIffk@Cuq5jxNr^l)eG<QXnhGs!0IEKv7_~HH1WXk
z5VHv8&7Xc<FW_{^Bj0%!55s}Uj7v2w9E{64iN=ScQgb<g%>lx~;Rcl)KW?XRrrq*a
z^s@V#@qiYjHE^WkHdvI0{no&!bwxtkM>eEOU5W<{Q9GyO!fx<W^QOT}+3@rGktiH%
zs?c5`U#gwf5%EBClVwlk{87f9n%hl#_x?jidp(I}n9S#~n|k%WjulYraM@0{_;1)h
zhUt3i)NE|5SPIKxfAE|%vG39J!csz)Lr=k2zGlBy_FDD+jwk>lp4VZ>O6>h*?|okw
z#rLaUFdz9pU<i61@<4IJv5DCJF+Blvq1*e6eVax$*aN9=10=D|?|B{eAe6Fs*WgbH
zLyPfN7(YBO*+G;WPbu?y6sEZ0J^MXjUQeAPj+QpB=ZO*A_D~1{Cn~^vq5~r*sI+-i
zDlMyC5FpC5hUH7^cql>0+T+0}3^IcOUodOd^~L>ST-Zz(*b9B0eK06m>dcpTm-?AU
z-^}fWiF552*kZxDp$T<btXqQ^(1Pqgi{|8)Y)Sg6515Zo>sUB9`eQQ^v;FC7>;c@O
z=f44sZgK;<6~3FDsihzWlH;SfFFuWDq36Z)2F#~nMX{$p9TNi%qM?#4(?y;hKn~wH
zxqQO_M=$Mu$J>OsF!GQ)lVYC$F3*c>i!f2cwg{V3H~RWU8cr2?KBJU*>+dIMpYoJP
z5(n?l8f#TKlGqST+#kaB##gJxkNth;s2ZMRb1eQVZWuZ%n7AQ?O~6N&q2pM9otr(o
z?OAN0;fg}n9F$r+P>?$0&A(<Nzx~RwCp>_N!*{)A7so~t*k|`Z?=K56MIlD;P>n+c
zHQV666)Xse6zlEldfzTA2=STK7Xm<#Lj-VIx;7C3R6bd`NgouUL@*uRPi!%|vayRr
zA-d#|8TK5>+#PKYb~`hb!RZ#xZ3J}Itp2DyaAo1OoK%m06Qe&?pD+D2a3gb)_9qvF
z(j$3~c3z$aUe;?JFKWNsRUU@MCSS68d{A<N`PcnhZ^~;O#}J`)+#5G{M8Q;g#Evi`
zyFNHfSs=mfZ#Iek_o9tG^f#dy+#uiap&L=?)<CrV3ah8bM)|k<5;$n$+~fwI{h-f&
ze)_C{+<csFg#Bjf2pWY1wgvYlZt&U1=x3I_NRJbz!X$1Ez&iHY+;Fz~&5o(?GrKC`
z`f!ar1S1eg&j37>qvueL*nMP9>Q9LLPQUeh0Q-yY6jN?IC}(jbdM!AQ!fhQPGJt(-
z>CjMO8Ha&513TEj;8zLMArw3yH{r4rzZ%7dC~cH}(Cq#aZ~!RWy$2F8fA2vs3pctq
zb+PBg2G5}N3m&{vTy~uJ;C+^)_5dI;)*dL^heu)aOJB$Py#wB4Bi~6@`s?@qviDst
z(vR4$iPz*|?{B*KBt1|oJ7z!VFKhSNZ>0Vl#lp%53Z$1>>XMn`O}ixqYpq?EBREGQ
zu}GEIdf)U#D6M}Xmvs6rhdAw5%l7RbKy@gE7~wZQi$ruLc5gh67!o}fFiBq$H(HvM
zpsW$7L&?Av+)uFHK1qSHRwV;LYO%c!N4fmC>;xVKDZH+)p?kos-k<mUIDv5roZ5jm
zpjkC|KVm*|FOr!%q=h`Y%Lc3g`0FRgDUwq+u@eLE{l}+cxq#kSe&Z?0<0=R!v&p=>
z#7mNaZPvRdJ$-n&9QD2u#7glKQ-_ec$cOzNrTd_dYKz$fW`rEtp5#nUFI3^+s!Ae-
zS6-f}k5=DFAk1`FZuL)Z_r+6*2mQ;<wV;+Bzua822S1=&Zr;_4E6~Q@eYo4d++4lW
zK9%q~d|{d;aYFzTonEpBQ+#e2{QLqke+qP}x_ek;X4h9C5-_gZ-_(~WA<SP0jSJr2
zcoy1*m)~?`1nCCRfI-{V`^(y(ZT7EITxp(Bi(Hj}nuJX280ZdB3+V`;^ut+d!46(H
zS;C>Ikd30XUoSgucC7&h>cdWSzj{wv$7|?Anbuw^+G}DSiE7mQA6`x<qw_O>GKml`
z{gRqL#$5;i#h!f_j;nZS%a#uy^{@Kycg|Ns5M%9@BlsKGV(s)-<Bj-1yiih&VntcU
z#-JEs&pp^KnvL6QIPU^lMwGVKhTXcIiZH>R1%rl*QYm|YgyBs&vgf@}986hRv;01%
z=hA3)zlB_Ay9-%UtHYjGg;sYIl2&>NOg6ofko{xp-&EcnhX|0juM?VYd0u7Se#V@A
zP2}urB4>|_oIP$m@2>{Dle3UK$3ttVD}VcuKL{7)4ARB;<ZF=+9t*A~*jTUfGQ?Qg
z{Sws+kAlczNUIm``PL%8eU26N`%=a5(Hz~$?t;1ezwG%54CCGBpMGD!?7o-EItGVe
zKnwQWUjtpWUr@HO#^132SG~W$A#Tu*_saG|GFcNv@CD0G+4uR&9`L0&#enom`-n1K
zRn-U7SyuxaId2WK^(nw)&b@+MCy1&p8-Q|HZnjCuk}8`eUs?8o{bt!-d727M*(;tm
zQN68G9H%Y8%f%f&`}Op_$ay#!DlU7$IuS-OLi^IU_5RXZkNR0^f52j-{R{o6y_dS2
z4EzaSP=&Y!{q?V*zy3A$*B@tpT@_#?{_iO72voB)YYYNM4tlZOId?Qaf%4-tClv_?
zN_p(teD(uW(Q<oc09FJx3eMM9TeNmEqZ~ZFkDYXU6<BD^^gCP23o$@O?)G2ykM#OF
zjE*eyO}`*E(%zqXge8VfK|`RruOnJ^#4#_P-BEG!90XMCIZ}22EgHXOlT&+kpR%j=
zIv<!T_Mksg#X^Ja#^E41>8^TTwhhON0n_5=DarZ*;6$_hk7N>Af+$NRI@Wk7r1jQG
zlz!0D3we~-uU<)i1w%r~%J11PTnRI6c72m?qBAGW%L~@?Co!1v5LUDNx~6?S7z#nx
zgPtRN1Z~@krl!56H|@P1q=3*mH~{>SWaUN>prc%ztg*yff~wVvWooEoC{GLJX|X&v
zvOG6pYzL)SEXuPOS8S~#u}`TAiTYRww~zMb0LoJ=mI)KBJ(8W<g?<}nY#}cwNz)c3
zDYMOaH&Ki;Pg)JWliI2{<w!9xxa!~kE6@MC$}^ZXKL%d~U9KB^iJODTn&3@h?Lwk*
zqwM@xH8YIZ#H4Qq^wv28()DR@W)up#rUv?t*3Li&2Ff?17>Xwp3y;u+;UlLHLyc|l
zi}}{F7r4}-;%N2m#7!Zy?)~JvL3?4S;HF^N-ujKFI-!j1W+Hl0BeNR(j@mB6o>EJ(
zh2sOxR(;o8GxS;M#EBEjjG@o3xn^yf+ye5-D@)6amRPub?b=v){G}b^4d9LA@PzwY
zn}@!4+QcD9W3Bh%<8hqEpitsGhLvk#YbBY96AiBHx+aWVe(Zp6#^gVb;Vm42YabS6
z6&NG`rypc4CXA5l+;hxJ@l32pM0^*Fc<wi}1x?xK3p4_Rfs>rMu<P-aD|gf<&Nika
zTt6JniVRM|J|Q3t<2&$Pb8!~jnGL&J!E(yNft~ZE5nsmFyxyA>14v??K2)&$Hqe2c
zD?Y^)-zJ2}8^Ybg;3~K|b3Oohj4D_*h7K<E-EP5U**vaRu#XaX&Ns>4*%=;*_i+XL
zAH(5&HG`M=*`;7PqwU~jo^i|ccg~Qmzp)kH$!NY-$@e38pNF(D+`~UQU7xEUKZ6!>
zo1@^Sl5h@OLB!`|kojA$VE=wNoPX|sif??LRIvO;)WM5ypNXeO)8s%$F3n(pgNSlC
ztY9bM+JOb0Wq=CfQGhrQs`*Fb65nax3kbsq<8irySv3U4D<nZW^A*hHZWz#63@ntV
zJ}aWtov!7{58&~fdDCY_aLmHtN5jPcCy%KRu-wO&p=~&QxjmyV#QULwy=XYtq6{qa
z5+*YU`D7MV>G@>F{4P^4VgN_WRp*1o0WhSsS;6I#+qYEuyy5u90w5w{{(h?9W*6cn
zhhD+r5su&pYmDF@!}!*4IR7*w3&KuNu%f=@;{9GW?4q-TjR0?#f;~V+a`1ZhNcoUG
zPPuZPiPx;_wB5WOhu?U0O?;QCYs!&)6Xpv1u2k1oA!c3Y^K$$u)b$j^mFjvb;%Vxd
zWqXafu0hO^Ilg-xeo=Kj3-R^px(;!@x^6@~TU~z+@f>wM7x7K%dLH7N)%ASDx2o%f
zh!?5r+Y#TPuJ1(5PmRb!3x0R0>t%>r@jG4Mo(SJ8k`NORd9rp5<9B5vj3TU>*o8FT
zu<0X>e?mIn9jDT3aepJON2~icaGwc^n0ml7PR1g=7x%1&L+Ot;eu4DedDBgWNk#=2
zXPpjs%I7oq5#PV!9;2@+<kA<dgiZtx{8}#)xF^G8yuS{Qq`ov~5^+@^zMjiGDi9|n
zxbKCPb{-TsUW9y9fUnldfd4OXdog}P^G~T}LV@^V-+eEvgY%#uYj-p9NA1pp0_Tf8
z`E2MJDAe>!D3I3Qc~Fq`H6`&=>ocK1>^R`Qr}k$;LDp_ne4n)-6AH4vu4FoELnag$
ztPz<|AWoWa-?QX1p}=76$b^C+`n^1ph^qqQZbPmXl71fd;P^I;j0)5vuJ_V`_qTHD
zR0WPK{@DfchBkbhx5c=6jJ&5$G#-0iqyeJ?->-DPkNa28k*RFw#^X$v1S=8(>+*Q-
zRHIwm$v>p`WtU15-+u{5PWqJG10<~O={JtYCJaB#fqyRN{wF#2SLN{6nUnv2%z^)j
zlGjvJ=<zrMMNHl*p2=TIRoTDC^?2_%V_y#b@2LFq6~ecwbhgjqz1JDlDxGcncyEo-
zHiD3HZwsDb!#&#==&z2&p#Z1Om-n(fmKk4_w+7q8@!omHw{!S!XG4PUD1O|7q+6BO
z0o;%G-f09BKKi2EgX9?{50V{=JyF)uP$J0tPa6TnAKRF**sP;dmB&5ezQj1F=+RH)
z88qK^nIPu>rks1fqK70QAJ4hGl7aBM6n#G7{fr#_ov-ps%QW5_F*XoT1;YP$q`aAg
zXuS6d<3q?v2d4kbFYnk6j>nlbah1MG+?N~wuKX!lrtvtVrZNlPETcB-{W@c>k`MKI
zyth%D?SM;ze$9CAT%$S*-{*{9sQl7L8SkBMELZpRL&kd-VqHDomi>V7-rJ3z=albv
znF$2;<5<7n$<Y@U$EZr#-WQ?lX+d~q%DpOn7%{4$@rQ_u;1oQ=`zrJ+m=2*-059V@
z#6WL+p7(GVG~PLU4`sBF?@foEGKM1|@LntTqw~#BXSpE$8{$R$9mXy^SKz(~vZsY4
ze=RDGA@)X5PKe3JAmSpFL4f?A?u=s$I@jg!RYv%k(uX0w&+&d1zEj})sDtgizuqwZ
zm@(4-Ql<AGE~+q$e_=dX_9uO{l8&zqz7^>JemdiNDHlHH-b3C7oXx=)^1KwX_Q65o
znS0*Z@QoOQPwt0V1fAiYv%LQXV#?!h8ABcyfG*4H3y4XV_11R-zC9;D(EZ)&-Xwiw
zDoT1Ngj*Qji1}*ud@EzT_a>i%jz`hqUZcFfM8(xA=ANA7gHv~m=QDQkgGWXYba5H!
zBmXQH#*ZVWzI=-@^y7K;{6)r)&ufe!pZ{h$<T3{Q6g8<cdQhI5$R7%Qnu`zew^Y&B
zdbVD@{};puxr*|E?*AL_Z^rq6Opi+aV7V6pFX=`YgHO&}GhZ5?&<{KZO9rZ)+*9aQ
z`0Kc*o@ux%a9@NQt(Qxgj`zOK_o9ZeoiW}Q^zhzSNC)vZ5mQgUkC=M;6UNBbyG(cK
zz2<|yH>$Vr^}OICAN@xFNBU2ym~!ylA?3>aRueyBaV8VszQB9LPcvQ&d#LV@t60b#
z<@X@vk4$n85b{~3;w6ar{;Q0UufvFoK8^BZI`Va%Pr^?|?9LbMt?y3RSMYsa`u)CU
zWp|cf;(+PU&%a{~d9WFw-c$eG<#ZVL)SFS{7v+8_V)FL~<QLDsPd&NIFn-Ax_zK7u
z(#Mlul=qb?p3K-q=OW;xy}Ok3mdW;w^x3ZR`DN<)M8w2Lv&!^wd=7a`U=01H{!rd?
z5fcts6tT|FXVkqe&r1kjEBj{TS3kd4Jx7%m`MQty$nPVJU3&X#m42a;N4b&*$DiDA
z?dttL1^=(Shn&*92cH)xc+IDf2kPap^1$<4d1$`*+<T8KXX1T8;n#R`^S_yVKz?6k
z4Eb$k4Ea5SnD5iRF+N}AOVfFr&mru;XN<;6>&2%Dhv$zmKakf8>i#XpYv3<HFPQ#@
ziVL9!#Q!<QYtdIz_g?BR-oF(w;jbMb;lhP7p24^U_8zfY&rxN?dw-$$dz5s6|0%|R
z*ZiXj2)J)6xF;1{&&Py=3JE#h%ouV+)fRHp@~521N1uxQh&@Zy7(=V_wU$f%JZ*Bn
z9S<6B0k=ZItyFNUa^O}QMwocP`y9rQVT>_kwv};_w9m8;!Y+>ne&+LB?Ek}fjM_sD
zO7aBnQMq<A{uI8eVSGOLV0pn9aF0BmW!1#^LhKF67|P1MVR(ksF2<k18CQ%y3w~Li
zs7#fN!x&>=JWidBH6Hx&{u1!VI0F6{Uy62u<$f9XV|+RG(q&wV)#Hp|q_;7?0(Ow`
zm5?>^>Yadk%=jwEpD~QZCdM>=S$k&XKimQb;w<l|C||x3hgv*<joa>>x~w(UvT}9y
zc_$T<>)PAbwm0JVs@1LSv+u8)+TPl>wmpVzvv5j7MR_YzaT>-l9yYY}!OX#4L-&Zw
zdnU%!%UbV?x6TH>Aw2Pv6im}J<5Z8<mV4^}QY}ss;ptwpc_u_%U4=Zkr1`FvrS~*1
zZE0&+x-#|vwwl9sUmqd!m2EAt6%{!6ixWkenIVZMFXt6kOVNRDto3fpR-Flc>fNnt
zTH9AHb-y4^sNsn=AA#M;Ri~TAnzmMKYTN;CvXmijK7O+jxOyp$g=zmC5vyuj+a}8T
zOrnNbbgXD;$A*OKT3etQ+;Fb~3Z@RR5l_#W=gByuL}9}|h0U1wTivpBc$GbU(NLik
zqLufy<tlU~6?!rb6<fQe`N7uqwHlN;_#}8ei|Tb6ZuDtWzcsyu8n(q&$b$U{NM+qc
z3DK6VX~Ahq>e#2>YNe`}l65B9$D~nFHFVZ_7|gC69P=N$^Se|^n#OFU{QpTGhh^k+
z$APhZ7-9&9+d~wZK4<o<>zkUIXU>}4Ja^`eb+<IlyuR*tDdkUwt+S}*pA6yO*c8g$
zRDau*;cVm~wsCb4M$?HSspM|9;+)d<_Lc{5fZIBp3AX0$*os-x?ys0uj-X7B(Q+5O
zBqQ(ctrO==gim8&naUa%1Y_yywH>XzfSa?7@x;5^*T&m~J9TdxwqJ#xwPx+<eVSnv
zowh}sUx=gIu!k>qJH=+c547R%&Na)|8sGu^1Aj+MxKAtYX<iN=aL6vL&9|>vmvcm2
zUT30W@?9+*aB+Yei(_UlrJq=_6isn+ti5GrtYh}lx}0_o59)Y)YfDGR%DdNK+gWhB
zre!rf%2mwsZ<*B8mNtrAqCYza>Eq>zZD)IH$I1t>)~I!POMEqsrd_i#=IBb@D&zi+
zHP}seO>DVy;GST}IY{r5WbgXP4kxo~*VIuSpMbQh+u|K7q{oIs0HG8(s1Wf3_cA_<
z<M}?B!q4O!xt96}*8yjyHm_Vhdr?RGWS%D6(Tt;op_t3pwy)#)hx&xp+4JG2U5x{R
z<E?c!-*R<xT_tN&-7Pbl@&7Dc?zYt#7S6JYu-4=#;{4|M<<0Xez|Kv#R5v$$?v|;|
zpFk0|h<%o?KHIF(%kF4fy)xE(SA02+ke$r~{XSyXPI$r<<wAFGSn-+|GFbULXTYVq
zpEUWKbNaSJ1pw21))E*ZZQ&y?Tj1y%8-lYwv~mcx;k;O}&GuXz)hI}b6D6~T2bfeb
zE#v*_KI&=p_3S8f6Yq~h`Rt7AP#&@dC35neFPkjiEP0%zoj3#aX)Vj{Z^04Gb;IFb
zD|Td`IHzOX%GlBs6U7O!>=WfRslN%a*455H#@XXPgNG=N*H-)I57nrTEy3aXV4n=B
z)93FjRfpy?TXjBC8J>ZM?8=i*eTVY!F)PpMxxsO?7~lEr74_+<@%ZEzmY6&1w}&D8
zkwneTDLk9iE7#mZk2)6bIK5^1Xtoa>kh4PiiIj{OWtFDp47%_UMs9x7A!lg;a?hQ}
zZ{L2GeR*{j@+ZRFS@d8*UUV@hR_lvtkd|x_mUiIe68-pUeNm||rs#{w&KtjrHe_N&
zg(i#(#VYy>6%+aV`li{_n#<+I6mh}6#Kekn%y^u2`11hQre#7?ongF(IUXG_1th{o
z%p>u-P~BImSVx$O5uqZO4Hv~z@m+&VcGgQ?1vsEIn9lI(bh!o<(}{u~;^X|+ddxq$
z>2AZ#_wZZ?pb;SkI5)oX8hL&t@nITBtT83NUtylhjjs)JRoC-@3L0M;aBh6-fv*WL
z#D}E>4!(;ZE4~hJ5qcoZu)1bMeEjtR8K&Bt@X!=FuSa}Q{Fq<<z6~J3ANXQ82z=tZ
z40-Fw?{5G{{tN}T8~pX)miRE$=kUk83w($fwx9sTw;S@-!ABT(em7yhatodj-)Q`F
zd8`6LH@+hfs?IyW9DKK99?=aK1ak462Z0bM6NUwVbJH!x{CX#zlP+O2-CX%?a>=hs
z!4Y;+j{G_y4Drnf(ik+|D|6)cIOsMZopiyHLw7YMjota^L4A1?={jh9D*)%t$06Xu
zl%>FjsZ<AFVU9jGLAYG+r-R1Fc~>{S;B|(v1VH2uQ?U-d@8VrIe^FEN4-gSFzLgM;
z8*WJ+xWb(B?F1aAQk|gjJ(yFEwgK)Q2Pz}y`*Z418}bnb9P@!GV<#W4=g2t>LgM=t
zz%XdK2Xf@R1^9L#o%k^2?BL7Qm&aWCGF!n>U;Yhz3%RIzv;_G79?x~qbl(IV%R|?<
z#whd(x1>7`zkGVS)kU{O!4Y;Ykh$pwp(I@Qp@XJ-1K`|rJEKw-q#MC6AKh=c=r$-g
z!uCUd-E_-Am+NVD&~%>%oSW{JXvRKcN<J^$9WJ^{6&&gQGmNI2ZX4|8Bs|wa)9nSE
zo9>~gTo1wgV#+@+-CZuatqP8G{}uMhO?NBkV(F9<G~NAxbJI0u8b%mUq<a;9`Q*IM
zMR&P^BkWq(SvTE-pt}msb<lM00i2s|7<9`4M7oUg(fzrL?%fKGuy3L)-E^C<PJ`v8
zgQoj4z`5x*fiBZX7pU{nJ>;T`CP%=LZujVHx}BiQa?nB3-3T~0-6fz4(FnRz5$DVA
zhc3Es6&$)R!M?lmdjxd9q=_QdboT<zO?N%$YWqxm$VZnS>YyqJ{%%xogq@N@w-f8|
zxNckrO?Ofb-K{RVT7FQyA^t(YMRyL;Nt3_kQ91dA(GcI4A&o)Py#sLW{O$(ba-_3-
zVKVdPx7bB@g@Pm9i8=K*h;=^0)!!>}>hA#P>hhg+8oJzLTg!Q+i|z~vhhi;M_Bjf=
zEH52&ey;(XJHJ5?3j>Jxt;3Ib7*5XRF1oCrTF$$5JE-V(f^Ij`b<lKo0nSag+(ow$
z!1?Ibxah7{aD<(bQ-6bK)P}3SlXB}X=#nSq_j3y0aQSU?(Y;5(k?vUJGfU2(JC6@k
z(D^+VaPIsr0o^LVknUXk^5u8Fi|#xHN7ya+x#@1b80%$W6LrvZH{*eu?&F~QIG&NN
z#y4Dkm$>K>mNfZ$3+vz9bdOxBzD-0LgQoj`0OzJ#etpJn%m-Y){H}J<U8CR#yCjG1
zRunG3FVI2LU7SOAk&Es^0OzB--bHt<f)jM%zqs?;R+fh@;N1D`bkP;-D}i%3Id{3}
zYPpc^7jyOMO2asS=Q`;8a^q|_-KRiT>(!kAcJd2j!hB3t2+p5?b<`ReVy5wz>;G+W
z@iz_W#K+(7!I>s}0q8Tl1AO#Lbs!AGqkwbschDu57Nk4;0SH|SCp_Vz+oa$K`=06t
zXu5PVhNJtRsvn^JPJeAi|CT9yERQ1PkE?7LCBPTJa~+sRh8vaqG+b#OxUV7~?(_O8
z0p|`HUy^W0C|8Mu`??E|Y5dixc1tI{oCn{ob0oax@27x!3N}^;%8sE2a4e4~ZxG5M
zmoNz3i|c#vBOK-O4G2Nw!maTX%A;JhW!lf74o;djE$j~Et{ZtR|4yx}6e(9vlc)8C
z!)HFPkKa8ofHXoW#t-n|fB2d6f>rk)F_m$e)f;Qp##$#f%)Rw0v2J3>w6+`7>8`0q
z1ulSha2<8sD^Uua;<aunq--;QT2ENES$doS5my=?R6^i%^ceTU>2X-WArj$beW7BF
zkG9LLcR$6w-~};Z$RF?Jt}H9puIZS#b`mt}OnNu1a*EQxGwa=!K@dRDdiSQFET8eO
zYu}@+eR5j=B7{_KgM&TXv6-a5X_X=Nwy|~vadhI<+#w75_w6uV_|xgfCPeIGy@MBf
zj*K~h?X~7*_Hy&b$J@Kro=e#8SRw$v1WC^uln2aY?ZuRjAMEa_Pmsi+LpUbGIm%HS
z`4`0gP+8|f+G-0&z2OrHGW@pj=hAWE&)#=6`y9n$*LJx<YtS1TYYlqhmn7x}k9s_@
ztGI1%nYyV?%<~_eiK8{Dt=`e;Y1qBjIT0X$(*V-u%;X<3XV_oSkJB{t*<^wAWyyIS
zz8LFI%npHG@&^Q)hrNGMo)Nt}Z%G1soVFDojp7hE?AIR{Y?J#CqMWhE5q1LRZq_J&
z?q@BP0%u_spY~h<xi5Hj_OUtZtpV&Ttd8l!7GXS$ggWLNZ-IL>OhV~+_)8EQAldJ!
z{gklbSo~avd`ax0H1``U&K&wz5<gFGn8fXa2R?ttom%0D(+RHfiQ2D#jp9R0)4R9b
z7;qH7s(Vjtj66$BFoFH>aTKAs{Q{ojw;yK+95}kugL9s^qoO=M0JSBIJM8JiV+10|
zPbqODhC=~&1Ut@oa7dVxFSmOyukpsu&3RIQ?aJa6_7QB5-Te)`<z%{w88*AW0?Q!}
zoI<&bM5!1lertsK0rHevSjz#LB2NjdcQzIVic(#oVU{R}VaK%bI4>1v^u!{?{q@3V
z%0n>v>)Co5sZ;pFZK5j@^>Pcunbe6wdoM6}QnYH^K@MjiVoSK<b(7`Z-1a~;eNzG_
zUM)~3VTIPMA_eS_kB!|zI1TGu#;Gp6F3w5(4le8i&K~+w=D@4BF~`=~nc~J7kDCB5
zPD=!u63E-9^KB2L?_{CiaDa{$*XHOFBe!szDK<v0z_xbWK@vOyddT5g*y7MRe=1W5
z@lek0)B>yc1AemXOH-C+J&dh0Gs@KnrC`^e%E4xWag?!hUQa3LPe3-xaq34Ew&SaW
z%^Tx7TNT)F`ha2*IwUuh#a7#>$2{INEDjUAka~f0RG}KgF8D-&uebY$E9u59TRPW!
zjAYakKStB<76Htwcw187UVDzB;StVZ;iD*M2`EQkjq&M@z;uO7$Wu*$oyX~gR9(ku
zK&6@bUhIiKk^W{zuH>G<Re!Vg>2s=WX=0WSIjqLsqEOPDqju$<#Ogd?S-1OV3MF@%
zspp}CXrU|;gGv3Q58-w4v+-~g)i_IK;vsDBt}@mI5xcabk=v%nB6A?WCdhIAu%{SC
znFk?4fYtJxz_KpvsEG}V5eHRFe}MN#0L%EGiuW;orY`u@w%BK(K1*=x;93UiM-5Nx
zl0?*>zBpg%g-rcal+xTBc@?kElWk6V?9gXuZLqgqY&t6B66nz~GQ7h8PnSrJP`{%i
zj3a}C-}PT>^nf#KGZ6M3!eLFDg{zqUqJ2zcH6fh}2xke92t>G!es|D1<&E8HoeE*c
z&xZrCCa0pcLI0uvjZvgLKC(9Q5O6y+(h;C^gjS%gt<Rj^S+OTQLSV$vI8h-maej0o
zv^ko33$nEX5hZ!BEhM~6#amUpMa7*Wu8p)kwKaATxG2ZHBl1cf-WTQp2rP}ENySXU
z8MWBmpXZCN*Rmcn<dG8fOo+N1qUKiKj;P5(uBa0s>?{0LB)FuV`Vs+i1<nn}1-gvD
zZ_@$?me_np=1Y{!mqB+|AU~^tE}y`wkewAu;4sud@DHK;h0uYOhh!yiSgpO!ce3Wc
z+ZWlp5&ycqsq=(4KB5!5y4NSVB5b3k@T^EQ6N$}{eY~9$X)Ef55Pb1F0kNBpx^OHL
z8nexjf8pI`oFjz}ri7^$Y5-Q3T!u7cbQ#!UDK8NT%HGLZYIbvEU3;FWnxAqVDn*K5
z8=KE}p76x3Ft_it1`5pX?*Xf*ZsGVpbRHixyZC`7$#Ebd^$VREjsFpj3EY&z{ojb1
z+wBFMIQolUR!bGFf^)9Q-`YjzoxE1gTi9gx3udid0g^JG=~=+TOXNnE5G(BX66c(T
zm;&X~a*x^dY3yB0_b?Wz6)CBIN7sgEx_Z`MzZ@19`09ezK|ij|uEQu1WFz(fkJX}k
z3NA`l84Ey7JDx#nhGBN|yK$jS%qu5Jv&5Qu5_sUpEO6LNt-%Y~PZke(!p##118UkG
z4$?vjit~UnbuV%wSz2Ydc>)(<FyU0Yh&m}P4Jk8!quHTDvrr1*K?wrs5-IZ1%z+x}
z4ekVw%P{iz7re}z7{f--=eqavY_?@uEZjwUu{hUgGhTy7wTK6a1|sXuRmU5#?zE(@
z(2fld$yf0n>jsdokOvMeNx)gbVX2UWyX=DrU!>1B5(m`4tzQBct`@sg<0ZU^{gDIc
zf5gvA%%myg;mSO?848eIo|xxDuS6VlEgU>N1S1vc8Q@L$Z*N0vII=)_aAeEIe$GNy
zP;HAPYgLl9awJuv1_vUuz#UGf)5<2LS<K^>Yn-B60Hq5q<R1+tbW)!vBK1+~FLq*8
z=Zr`{1W&t<it_5Zg{lOV>$(9K>Ca?qfBMr(@4}J<dQ0x}@=_%@yjP@T{!mTM${(3Y
zf23rnGZJspCIV&oJ9IfD<La;De^`fuI2DLbRbR;QsQig*M6TfhLMeRq+saE*HV=Mc
z-riuAd~!O3+!{U88$^fLhjI$QBFPfig%kO37Um2i&f_9cm7NopXp#I*IhQE#%;|CY
zJEzE;E5F(N+{m+Z;4M4ZE_PZg9=yeKql0LzLPL6mLG%h`KkI%!PY5e&NEg+!wLXT^
z;!v)c^X<5M@Mi_P+DWMt5{2sd?YBjOBh!4D_`in#jfXp7-`on9co-+|xr(4Gg1$(m
zLllPeBPfYdl*ELg2M7!C!F-D$1aSjpEn&foK(`eKABmIM0N~@8umGUPxzc_b$^^^R
zh0{yXNAHS=8QlJ^NDQ}w7(Ihl7DM&f4NE>IVdba<tb4H$zrFK^;uTMvCjn<WX6Rkh
zP5uHM;dO$fE_if=$sWj%DjK7~^cW`x&CpY(LNCJbFr*Ew*praJ<eJ+`t24ap_ms{^
zahcsOqlL=!W}?Z>k*A2y)j<XZv+Gejgk3I2v%zCMN@%Q~6(0BI$PT381d~p*dELJv
z++#RZ1Rl|2k#F&Cv*<j)KO*9y{bo1a5x~$P0n7?SfbsEeb7VCl!u&H}AfPJxGb&@U
z8<-l8+#|aoDIlkBsJ+P&lzTCU$cn7NklFn--rq5kNbneB!oUyy#pnl%X%0>TxmBIV
z#sV_CUd&K*M2X(Fkit`F3*53y{V^Wsf~ZmjQKR`ywIkJh=Efk8_3B=Qo1?uxv%82a
zAOkxP<K!(I!@3Mva<DMR=^c(WsS*l>_6^#Bx1tbAEg&eIY~4i*L>V}P5ahx>k^1F-
zqaA}G8jQ6=BUm8tY-=G2mIl1qXi=|}5>g-Mqb^Y}0C<9TvS0|a1-H;>b_A8+1k3O*
zyMKbLfn1fNeSEkB4+*$gR01T)qWZ1}iCuq&#MC$N2YRpw7(wm`@Z%7-&9lI;BObH6
zkwBXxA2M}wWHDgP-@6zfsYys+72=c*h*R~;1xKmRAw^te+3&3JYFKVr+u}KA@THp*
zjlKj<7!${_`__$-15iFS0Od>57eVTgj(PTr){Ca-FJ)Y+5dD^Vzt!)xXULHv|4cem
zH@jUHoOk9Nayn$R1G#Ypm;KHfzX0=@#;}y`0ETp&ZYG_=kZ=l<z{R}IhqEVg6mT5F
zVkp*y$c{RPQg~pm2(jU)HPmqCgy&I)r4Lrjp&>qIZgitdPcYzkhd2ftLxddZsaNeH
z#(qoVV}|5W6%KfF^0)CY&A}mNT@S8e2rM2z-$XUBU6BDKI`u-du3)Gb_Pr#JeHV1H
zY`T<G)a60axcvl(<?ummr14rKN<;Q0p26ivws~Na?IRc@!_h2JzxfRMaln$n!2U}W
zd56z8n5eP_$C%xdaIbn#P*FdtG$bj_3?77WpXoCIG0lEKqD@SmbVarz)j1xQ107};
z$5bg<6bu_R4qoc<4%TDEa}CI*xJ8fRMMSWNr64|m4B*;N+c*NYF<y%1gf%{dALSwm
zXDL!Jbrgw8<`NoO<F|h(j04)jtw;u%ClN6)vy3HS5F}o@{+nf{=7|Jo7N`VaoY>XF
z>CBAeD?bz*p>?J4ArLGMc}%ZPOp_2eX#_bDju0kOI7%}cg9fo$M=?t6gUl|Zil`hM
zRpNbd>=`1>7&=sBtP~{5ooXYvf*FxL+|0qqn}y~L>$OsUhdb94y3*!@N9s&F@g!&1
znnLi5vzzf(aFTWADA{!CgLOEozB_JaY2yF&57dMa=3}yYAQ@AErcsX8vJVa|P-k=C
zG#~ihBR!}E0l0Y>0V@#Z+lRg)4xv<5T-ZH&P32G_%ygj21?+R}4Zgnm6-IykYC3uG
zT9`}dPKo`#W7yNO^}!K9E`l(;etQhaqVfjp!fY%q?|sMt)>H-rmp){-Uk}3);i$mF
z{-(kEd_tGVcOUs4?Hcw^pD)tfOwsu<F&AK+8Z;m4(S1ruE{mRhz-^8}3S%EGTK$q%
zA>R~4^3XaLV^<dZpdqyQqC0<VSltw9=MoQ8>La#9yl@rGAZ8sY&=8{RtY1)eEdFzx
zo#K)Ja+=Qa6`>|}HA;l}|D(M5-*~t@h<uSp-5#O(y2jT_k?hzU4zAO<24QY!P7Mwp
zxkm9I0(S96@E~(f1N*MA$dxNRK(WASN-54#@O~{Hx8EQ#26V-r13IV_8eR@EL|~sn
z>G85urN)7_=pDEKfW|&9H8UOUtMy%O^f!nZ9VwXp24SUv?y@ZDy5@7hV^fAVr_aD#
z<9uL!RJ5L=VU|U3%5&r49z4jFUjS@5jrk5FJMxpK1>#gbWLV5|4V9nBvG^k;scJ7O
z;Ud)_ibP8B0^OFc5ba`oZADKiif+zuLW5*^!geVek`ZV~;&-ALIWO91tGOvi0w!RN
zaHkT$f-2o8eW{T7<&DUN8faUDGQBOuc1zGfP8O+le=%Dbl-r{8Y$wN!fM(Zp4#+hD
zc0S%?^I6JRARuSpLmbrZ=7-4a_XP;@#om*4M8PrYEZq=s&{_xw<YLH<z9@zTsS+3}
z#7`a^rdl9Yqds4u9Nt?bM(>L8Yzf{Bo7>@D@hsp`cv6D)YgBp(k8;NN)FQANC9Aqy
zi9Q7<q1|(d!xc?EFhwEGTJS-Sq%^0f)*z?!R-BU_#qelsjgnxg$X)tQ5oJ2ZQM^%$
zpHq@WC`q%M%SJ?LvVy4mcJ;*OvuLnJ&Pe-t#rmoXNJ$kVMwk}m5sG0u5YY#$9ntg2
zvd3$7Kf*U#Km2_29d|x2duQx?DR7QtPeM^}Nb1|EOK~-{>{aoew)~m5EPa&apL$<+
zas<!dL<H79>zyMx-a}Sz0mbTPq59d;!AL_v6pIt6XK2ox7AYJbkJe9&`O>RrfvD;L
zcbAs@B=Vd^IYVEZgS_$ZHas~^{eKF{jzq$!2@w=kDGFo)F%7N%$#ot!-ACXj<Dl}x
z{uP7Je5diH6V5$HkrCC{(-DuyaqoED#i}~WAwW<nCnb>yfK{S`(6SWZ1U~5;Hf8zX
zu_#nm4}b8O@1R!QMaui`2DTJCToUC&Fd?;(IVdi6O&inq;r&2HXZ3i6I3Rf#H?|7O
zLEohYVsUr+VSqISR9(p_=e(j>ZY)X4(F;)Zi!#e-FGWABH=ETSFUc-E_LnnV&PB-^
zIav@=bMsiZfq~A?h<4S{p+%TJN0B%+1ng35Sl3co2<eycWUs^w3=!xe5DN%|0Z_V@
zXr#@GLJeV`poCTZ%)HSb^~*>!X^s-HmQ+Daft%Zp%3_cxnj933!=ZqTxO_-0jM9rE
zxa6i7CT$e$06<F8h5HXd(ib8Z<SVOI_D5y=O2#yU!i>bDh#EcdIf$w}@kNMA<?4rW
zkQ7<3=&?2g3^*g!2EWI8b<i5{#_FsAPrObfgLGJf3S6<L@u<o52+Jv+!lS6`QE6sD
zgg_$xWR-6?t9<{rk7vjA$_JF0qY=U_gF1*hgE)_C#!6(d+*XZn42s<s<%oz7n+4Ch
zA3zJ7TeN^PFdouB%<?C@cecx?>U;p}V`gK042MlJ_9Q(~mTb9**l5tm3m)vZP<8!S
zsR#Uelt|?bqbbF4E(LUa#vvmsj{k-EnXK}~7!U@_Z&lMC)Zk>Da4j&5j;uM;D8b?K
z<Wy-td_OFg6HVR_-;WY>(a-9?=1i89Iz?0r^Hu`uA4c&+h+*hZjvT<bAD(l)ZpGo{
z#m8ldkkc(FU{udy$S)|;9JWjISUVTL8xM12I7?(0f6AU;D5f=&g+wof3$9}D#V{g1
zlxbuq%<Kq8a8vBufXx!M#Dha#c^A`QaZL|iVmg~r##>dqMa7*W#u5;-3@#i0(3J?_
zsWTFTd!ha2_ClC4KTorVBn#^IAM(IU@IhXIrUlNh44|v{wp2?rKCm}_>C^?q0<j|2
z73u$EM!;mZ^EOzZDws-f#5gh;mhY<hRcGFf-L9_Nk@0+-Lg?mp519P|hB~;i^?q5<
z&Pab1kn^lyIt*csW_=Z-S+TD;B@;zE5Jq|}VvYfE@!T9GldwB?5oQKv6GCXrw4SM2
z_-ZpDpWW;O%>zKlsrP3mA9P7_gkyF+3BoP`@!a#`yaI|{o7gN0J<%0;8ZTm)z6qoD
z^AnGW`JcqoVn}_;({c=7PO}v4E!tW1K76xuSnFI=O-R%tgQchyQIX&t*P=$7-BfAa
zO6QTao>eis8tBtvW~FO}+oh$<X-<ZddA8~gFZ1`bH_P&I1;?IjJiHZ;v+HNp<lo~+
zc2qzP4#Vw7ft3*5&<d)B6lSux0sE0N4i?Ails7<=9ndadBaDDwEI7leCoa$ti&&nc
z{H=kJW;dBb=`TayaYbsoCYV{+NOctmq0(Z2wv{UF8q<V$smj9OAWxM*;Z$+Wyc%rH
z8Pk+Z0Id-(OMm(~u9-of3U?Q!1Fp2u5=%^w;m}r)&5(Gw0|h<!eg4U~kj&6<M%5{=
zoF0fY#mK?`mhsE~G5S`KfR%&pIO@?2`?(q7&r?R}2SlNrMz@}$ZawSNmC}!|TVTzf
z!hq-?_?uJl(wWsG;~)Hwk#9o+&WDz-oY6*efQH?_v6m}Ids6}H_&Mg6{}>|QR*={%
zzD4o8Hu%=ILUi%Fzlq1Gm+(hQT{(1_Ns0h5Z4;|WALKkme5l-WXDU$DfzPo?!&mEy
z9`Nn&J{m7gFWkmBoW5zB2XS$_VcQ7A!Sr?8Mk4m7r)~41J6(~bFYZQwb=mBuRnm>X
zHcVZ_U##)OO3m#(=#9j$f{v8JhDKKzTw3R}ht_pQtfrzT9i?$Q2dl!^{(M7-0#>S2
zwLcRS>C&{d3OgEPAwZwsz)Q%?1df<2hcZ1&Q**@ZWuMaQo=^4SmnIAB{=s>EYnM-Y
z#r6Q)^3+tM3Uc87$N06PLAw>dxQcm>5AW|(@j4aXi<rT&R~rx0smf|!vd4QjA$jPi
zgwCq)vBV8*TqtXVk_{e)>@pq!hbX6_>TvRuJz_B{$6EcEAYpdVEfhm9;wzf(<7sEb
zp44vgC+8R?A+;V}W1uJWEUWg@j*1nls$C*SryL&}Wiy<L6@$-k#t{;=n@bahW*eNh
zp&g8M_dF0r$G^nh+k5I_`^Am@#?;nb)`7w3v*JUql--*SeqUVv2j-Fw*e~>+xY%=i
z%==V%zun|~p|Lqa@y44oT?>p76myi|LXHy9Q5AkS7%W+3W?0PI>(<NqCJ0eMQ$#HO
zfKVnl<!>EsI>g6%u>avu(mnYMFVc~!v$6>6$-$~Y4EB%Y+p=I9<g5getN0Lc4cwdS
z5;Nd^Q$6g(k-#cr1?7_IciH%o;8}|A*jr_<uiVQk&wjWA#h!ul_}R&ey}!B`FP3=T
zghdHj2Mqhyz3Gc9UMl*)d~D|rP)c8{{`HR#4PJQ6{DbFFm$rXkHXgvDVXRli_bT0c
z*8A-P)VlO#8;SMR_a|>$EPBM94^6jr4l>DlWpD(!vi9TC8vA_|R>g_<XF)G&@8r!3
zn9GNchZz)pb~c^P`LqNwBeIQbmaDmnN-7fk2WbtRZdhY{s<tpQ`5LsdYL(G6Z`Bh5
z0ZNJex_#otHBgrRws=BOy6fv!+-4P7JY;Sc!x+lhQ1jKg!^Q=K$O>y*#w|P=8|#{;
z;rp1Xu}^J$chKb8oO5GWBU{;Z<!D{dkFmmd1yaJ`!7<bkR{N=(R;<M8D>0ggg)XSe
znDt5VfTLkwSj-o0cb45}FHMLq1jkaFG6Kmsi)aDhm!Vx^`(k$eDVX8Fch^^Nk@^Gt
z$%8gF3l&(eCE%(eE)Z$7_iucQE4pO6x6O|wT|I`;aSmEQb9>i0Kxb@xn{p8gu+N?`
zIj>R(6Yopk<kX^!+wqWVmOfY5vbW%NX+?&iDxv|z_jNZ0g*zJ?1)UQ<Yx;JqsfwS2
zrB*Tju><1{q`gH4D)!VAn2+_!V(op41HEQ<D=KBfyafxh)h~BgLG(5iZrKG@`YhEe
z#|d`XlTUK|L-e@gm&uxfk#2A7)8ZQTV(2i4oaoff8M=ZwJhNbR_$2s;+GjV9sP`Oh
zef9}hD>ajaG7K8A3n1sr@XgSE$57r~{6@1^12{d7s^l!sQLl%F7lZq=IQxZ(T#WJi
zR&d|D%%B{MkJ<Gg>L~~QoNpiS`LfyduXqaCa-hnur-RUN%duo2%eMY_AAk`(dM7aa
zkQn+aj`oXV=8g0Xa*#0LqhId>3e-r2ZwN9hPmlw}P<u3^N6_;6>_CJr!%DK-f1Z0x
zkfX=N96g@81BpiGbrWNMlD<NXNwOss9&FRR%phX#4i1;Y+3MnV4zTW4H5|fg@HX>4
z88M1bv~-9|sVa!e8G8meMzRoVf+{sSPL`Hp1=+*+mg4iMVc^+w#O^x}->}S&_%P&A
zimyXV&;ifLSdGwI0HuBnV9Hl2GKC_W4|^J>@Wn$?C#R6ughYcc!7{`&>VyS@)0zh7
z1%afiC;k}-a)L+#_6ZA-z%_YXbC@RMS<Q4h>=vA$p@?#kKm`^FR2;2%DMbglqNidH
z$NZtUEU82}oFY@cfr(YJm@bf|=ucEe(&uIstXO{s9fWA8gEvU!Lsqh#!ckVA$AXZI
z^!b8@0b-H_CLzU=4Iwf|7htqA-_GL`*Ta;J9-fu6a}*gzz1<?q64we)8ctmCo3zNo
zEOERaaYQ~p61mwea!MqkMIO;2uQ*E2)u7}TqPVjq4@vOTb-YM{-~-#kK6nBsF}YL&
zB}OkfQ1Q}p)Zx_m)JwNYq-H={1c#)N2`+mOKE%h`pZniFzk$W>c|JD4VkT6Z%*vA?
z&M2IJ*AO~d)GU+tn|)&7lJ}A<dAmDLm}GaFefF%g);tXDTr4+#)$@V*Md;;n{tb)2
zLD{Dg>t`Sd=@%4d+-IswBPvAb19Jl$yyfQF-OJ6p_AEEoytLeGd#QH0`Qd&b#)JEN
zmz&F(h&a6yiWs(cAA7rE&^qq9aIok^QGa@ptaQ$RGe_PyB*yReq<Q)g^l=cVdc?4p
zy&-5X0O2oYc05>=XQITB7rtkJc4mppSzIK)D$Q;)hjb}1#E_YfqTeh>*u_dO>5wC9
z0hlb|5YSRWI52Bme5`GC<|CN(@zHRPGu<y;wf-0L+mkC_XNs^(e6irDq*#0eL+NzZ
z@ZvCCeFd*fGFHP}H{{7xL!Mle{lxC=?vYQ-x?YeJGhT?pB#F3`ak6pHnL%{s4>`aL
zHRPOg*j7A<LK1(_tcE>kg~!<gF&_*i9p)j+qU!W$wOST+2LVx+vUYgL$CRKDUzT1Y
z>xOEY*)v3k5I?#`#m*wCyMab5tP!t)C9Xk+iwEu(0hqHc<;)GKtA#nxPzlV90ZMfi
z9bbC~1S2<ba9TJ_Kq~37cg{6FFfBqpavp3xg$YKA84I?_CjiKE*5rLIm%7U+2JeR9
zHFXoJzrg6!59@Gtdjp5gy?aS<@<uMO32C2(ek6<v&6ph6pi_Dy9ioyZffy~|a7*@-
zJdmm3SK&GQ46~lzZIW{q(=USP7NdZcKwQfxuAx@h+&&U>a(BWBz~uL0z|A2X;zkuW
zsaUMv!*gAoqI|9-&gB^*d%%{w36p$~Noi~YHYfq!^m;BWi$96=<XlC^pjN1>%dLzN
zoKhDx!akOKTCN&bnuL6?qo1o>vcCrBb4CHW<Z?1Kbp@{XAF?+`I)N9<&bttS=q5xA
zxZEtS_^H<xToxu3tZUeV4wixMx|r_y5pT@y0eE*1LX3Ba+f=-su^9W%Iwos%EYhYc
z0`vyb5;;gpp0&_q6=~$kG`ar68GBLL!FyckBHt1#W*V0}B7~B+$ye6{q4O#~j1P7X
z@;-MIs~YZD{2|hES&2sA<-pvq#h>~X+%>+?Cvq)d99zbV<c5Jn{Xk;wNl&lKqBUkS
zG##HSVWJVJtPLlP*hP4wvuaZOJmdfiX|^s0btql>ABYc^Lbn`AIT?erEcu;+5!=M2
zjEz|J7N5ukj6cB6at7MN*)^kLH+H^ts<YR-NjC4ZQ~!*l49jRk8<C$m)?25Nw+&Xm
zYIc7W>0Arig$*XS7PRR{zk)H?`0IBu0=KRtdA%nYxTt!!*|1xz%51>g!43|cn6n1Z
z|0%@?UeK;_Nxv7^MR_AGWlkWL5<8&$eze|LY8nfPL|37KtsrRgE4(J_MJ{M>Oc#<F
zyEi$LUEMkM?&bYHoMfDO6ppf%k~Ft&2?22k_1SN$dI=Hd?#&{kF1BlNmK-@&d4M_V
zzRribqx&7O$|#>85)AZqfu2|C3MEo}74><a)#pd0mG#JBM%N$vl-cz>hPh!4We1^D
zbPy7oMNKS_BgJLCf>FL44^SUqY|>*v12TyAdC7q=Ls?qp7$0GQ#2<kL(y11$W)wU<
z4sKBd?B_{4j6s2J?no)_GP7zcAmr8fRYLaV9DtFZ8?q;j!7^bAP)LE~v&??Q&%S>b
zBJ;0ywwHXL0>PDOjbdH-p|CZHCq(Y1!;d!~d6gaE#c0m>0qZef36;Hw!QNjNK)J5P
z%VE>{9>^f8!Lk?Z{k<t~b+1{!d*g`#s2~STE;g^<-Mxo{#mLEo*yR|=6K{3nt)%ZK
zxM9!Ik-WVVmnCU$#Y@nJi0ykl8F(F6n9hIQ2RkaJDa!g{6Rf@g+(tH@Y6RmQ4{^YF
z3#?7UfYm<$qcC&8>K&-=j~}-C(mo9K1wovOJ0a=Y2|)#uHLqL!n5i<mJj`HahJn-(
ze9s3HMyuOdwK%zv97@TVwF5r@HA70~Iez!|7TzX$vhy++3fu3O?X=z=pvaQG=~mBx
z{e0QW)z7cH4p3qHNZG#XBh28s&q89wo>v5GN6H4QfpA9!<O>x|T@9%*KfEDSD&l^C
zm&HSlS^y%_d#HdeM8rCHGFd}=!Lgxm*>U^Wm57s}*R7pLkRG<5KlZbVo{TZU6*f`m
zJ7@;y^c^wB1a@Lg<IW>i&&lfN<L?4-xEe?W3yPxI{RA?b`a9-WwhGWy4oLcvj=hsw
zDx4>@40N8HY6_8VC38bt1*ftdGrJZX2Z;gvp+Y!KYa1LYI>s?YaeaSgpPO=KS<nUQ
zN&v7j(4lIxRjonk!n`h`y^$Y3r~dHQl7Os6y76>$P&@`!?Z2F~4wu-w50TL4H};{C
zHWFjZ?X!c)+y2}7bwS67#Cm`FoY~fKZ~N7W^*+xl_VKd)u`7_YZVGq_*!ymPX$;vX
zZYp^CYeX{mE=n-aH!JAHqWFDje_u4{!Pw3oyUlMm2K1~1Ud3iHo!3ozj_*K}0keBL
z)X#poV$YSZ+}8d<YmWz*Lb^~rFIK-|cD)Q}ycK(|Vo&ue639L!Ks<Y^513saFnz|P
z_<Q#86i1<e?<nAj$n5%SJivR;XT9g(7w<o!-%meW@iTir*(~c7JYufR+Ux0jaBxz5
z3UXYWtU3QCq9yOdQT<A6aoGo;m8_W-dmp(T0rf8~d&7P$<$*Ta``y5R_Z-6;(*Pg;
zuk>Vq7l_*OTI#2)vIn?&KY*t``?a$7QayO4K~n!ffL9urh>CD3^;f(<j#tE!_hzR4
z01pg<`vGsj?_K=HL9)8Mu@)_R{>`<sUL%%++5P)}^^^yjikNjL(24D)fegpSVKlXq
z<%4P~^|22YJ><c5URb$@*{Q3!EnY9w$MKsRv4;#BZtO0216*{JzO(OF>JBE{7?_#-
zl0wQ)Ez422E1~>oVT4a3+7--BMm=~~%7>^W#pyA!#O(9&iPxsN*f1`DWZCwOgVai|
ztRDcErB>gE5>Wl!CdQ@FTPsIZ2<ys$CHf%HnCKEtqUY7YgD_4tn1A1g;u6FC4d3-*
z2S~G<pUZb%Gcoo|=QWcsjb7TDzBUU#NLSIM3Pf^!vst_EM|jIXqZNPFe8zk2#EEE-
z9_uysNH^$Wb9*nkpr~7Pnl3gU@dH|{X=1O(8o(Fqb7%-LRA2pGY`nR>{-n+-MxE71
z4+CDN!_@N?<l74a9x)&J2@C5;+3wx}@5+I{``f?$TTD=0yWrMaKV@3)qm=9y@D|63
zi_7-+9`~-?BS1n$)jQ3Gog0q>e$=zK68idH_15?BR_{S?(kBeEt;|m{@I{$dJG3bo
z+SFgW$%m#7J1TDS`{2}qFMgm4i5Dj}oU|W2nSAg=G-UN3qIA%Z&HB(jQT;~zofJQH
z&yptU2RgDcD`TP0a2hWbcIF7mrMPS#v$dN%+q>EF!WC0&2Epb>&Dtwqd1%&vWkRxK
zw*AoK9B2>OfyYHDZJP7AKN)%)tQE(~kWj4n&YQoz@psaN_A3PS)Z(kM%EzIyc7Tnt
zR6|{+Q2*l89sDN$6$(rOZz6C>B)wm?7lr-xQo{9qcz1!6!3G^KRv(L<*9mVP)yf~c
zt#iXkFBgd1jJx4B)k|6sI4iU26yu8X94Y!67{uiF(I-ZkU*;YFVoxEDy*rxf#$81Z
zEdbW4pcqO$JE36%EQ%f$g=gn*q<|I$=Mxn!U4>a8c35V?kIgCZ#K^==zKj=Xhm=>?
zA3)ZYTVM1Uv693{_D(*99RxYV5BbIaetAC%FTE4~C@hR@8_S`bj&RX80XQbTDvj6^
zKnh{|CV{pCzzaa69zy+*0)#YU4Qx=+vqe*zi%#MSqT$uJMBbeCT(E&u@ib!%NyqH&
z1Zi7+hmpP&6tFwzk&YGiD{_Ma#d+r2GBU@HX~jMV)%JaK_d=No#>V($vC}45)m3un
z=%U~x=a0di&`MFFOYmcC;Kye=xY~>C@fP>sxEve~qKU{X*~b(%^a>*w{FV)ym||U2
zwfK^4in;xK?97U9Gw1r!KJL_7)@wcjbujQWeh&A6dBJ#L)A{IM)%&rfL!Zyj*2COB
ziap8Bw>*j4efFF1Q(>N$+6QKJ?ZE<TY-|PXGHXw8_H80ddofDQVlGyBny>&$<lEZC
zF(0&UiQ9aM`}}q<u<bvD9qMW!IJ53~^<L8g6uUE-hz8E@iE+jcIK_aG#^sc1aeS=P
z9eX}eBFkLIT9Pu(D^K^wKKSH-OPGSrx*P5<5s(&^vxf9wP}{L9h8OE@j(g(8$aeg^
z)bHcD`OHY!z;tcIo##b+@3A*3UUIBz^?}%`<SeN81%ngqo$({dkY|>4!YgKu+Hb}k
zb_Dq{yWDo~vDd^Wn7>Cf{pc0nKh554?KWAx#HSkiOT_meR`KOy5GC!idc1((=Q@G(
z*ov3n@x7wH*Yv}~ErN*WEnHx~C}ap7#k+mJ8JX2rwA#V{kG*#Ruc|oL$7f#%iAED*
zlvq)>5Hu*4><}P9)Bs5ciV!X;-nt3N2BIN}J3B-aZ8TuBjj`CG)z(_5)?-^*@lv(c
zT7ni3Z3VT}s#R-k72~mJDdMH@f8SX%Yt35Ofq-((dH&CDp6q;UX1;mnn{Tdb)?6?~
za0+)$bGB!i+$qD>cqZ9-#-=(4CE0+-imk*%{grRex&h`&D4qjsl^HY!IsWE!xjZbB
zQ!(8~SPNLt0z)&-Kxa_%;VcB6lZ~0*2e&^^s&L=3$^D`@Tu>fTY>6wKpx4$<1I+`d
z%huvcng?2+pu3N@zMrc_T-_O#b0QTEton}5LtL?d9fv))ob+0LjgKig*3>1Z7`gvC
zFlF0&RJV0J8B&x=y@95aLfe_X#9w8evdO@A$UuAy*Fa8W!w~>`M|y4mGX%w(<7cqp
zFH+pvd)RJFa+C+VPlrP)#$L@stcu@#k}IRSkCS;Qm-r#+vTaDPAC*a$$EnNxKKtHq
zW2E1^-o$DSP^z$qlT){5`q8O#(uqrdvXSx}rGY_81NfGJtWr9_2QuVd%Q2`fnJd-n
z9J3X!!Pq~MxA;iQaIK%F;Pn&Zpun=+^kFY2_9QYBjrIyZF5NiHQ*jWeSNV<cKji0j
zkbWIkuz}vV?L%~on4eCA+dvNTk78$Qci-FB;+dy2Ti?FWG3_sbc=4VPXgM06PmsP(
z?VJxy2*!3yNNGNj8H*?r{zNR;JrfO`-09C=G8uA;t-4}%*+<(}zzjn1$r-l0I~d-J
z<x7AZpP1x)!Oz2#{#K8Qdex8pF-zv}k=)SRuj70wXv?<uktr))h+`cT9j%R1oR7g9
zFh{G&q&72rKl(Tg=&p+E)YH6-6$xnHNduI`R=C%4<|vDGEo8p&Sd9VVN~Ct*CaX#g
zENJmW_sxLJLCu044TD_H(w*XIJhpQsvCK>H8AR%jTE+drq_p!#W9ZjCo-iA1)&IHA
zSK|CDhDkh%9|yChtazdMsP6LC;*rhi-DhPy>XV&bd<@HBXYjC!#LJ(&8Qz8W@lWE%
zcTV5iIw5~#;t$Oq!K(yqODxT|4ISO&ZLuNjS!JS))v*|(H)l9Xm8r6l_9f((t59_x
z9<PH+G1ctHp{MA-v%{~o7L9B^qWj{ENAs`S!xzN(bl>L0mQP*{zZQ1BP9i;@#Yc3u
zp#LsH|NRO2?+M{4;TPo10eHWR9oLy1F5c2I+PCAAHxe5X|LQ(0`~qG(p2cM2YfNQk
zVy@9b<TM}Uq>`f>nMnJ=lV9`X?2umHVSe1gN5-U09^Vmz_?4mtR1ghRexg95U&$I!
zA|uRrL{_I%o<?u&mD`SToTr+U;Rqxrz(5NLg1|)#oTma~uU5t*cui+VcqWe(E{1NW
zp)D`WSn(l>AEw)<V%WjOE=BmwX-AW(g5s%-_hsPtJ1}<RGK}0kMcd-XOu*vKhv1Uf
z#*Y<vF<<^;*l-&_76Nl<rUi#Bu{C#(x+g$O1YuacDvP$pkD(`)*&}%C+j}6LwHFWl
zK^~-}a`uzH{ncon{l*dOJ{;d?v|jL_I}}b~eC9(-l$x=87Zlj`SxUz8|HgxC1LPdS
z5XjfI8_r+DL(zte6<MI2u{|BjAEL_Tj0my;m8B4~)=xad0h8}dyoCh!zH5&y`G7>_
zbN)j%5|(HgrCmI1m-FX2t>Z7Tsz9g2%_#l&ae8$R)ga+#Jot$nd*4MoIS4(dcw6%|
z9RCjFBnJkP&Uy^4o8#0+_oZm%)qADxrQ~p<yH+JO1*>DRR&NYOBx(ewM+uS-u-03#
zm4eEdYV*U#C@0-Rk-8AFtdd9bW^(&yNqDc!X*Q%G>I73q_G<yxq<H%mXmA=9@Q(u$
z4mH7s53~WzIIUR7_N)1X8Qp{E)l-FNAL70#M$v;9W~}(4cwTBoJI|`LHZ~;FLT4L$
zZlplH8{rA}kZ9eLBK@c%srY5vZ$Oy*`#65u47`-g!i(^<O7&ja_H;U4f=fmGS@>Kw
z%4YBWHC2)t-eswfLUJyTs(EZa9-xBMjJr3-COl?+nc3Xb-+GxoEt$xe97~3jjI~GJ
z&9d4vy!d0eBUc|I>U<QYLX2iYt;M67kH-W;bAM~{V6tmc0!zwwp#kEtWh&7xOE5dp
z*dc>N+Y5W-5q?1*4hjyQKhugAk=nJ9c>|>sB}<B~GIB&}=`5pkvs{M<88ep8MV4-F
z#J|IkdHMK}@=k1iUOGq7PSBs=y}c5@CPlvmN;lqD_y@eKRAai8^b7pxMq~8H?)hNz
z@Lx;_Cp*DJ?!-o`+;gTD>9!WEa25$m{P~F$LkRGO7%6BjDO&P8w&c1wM!U*JoS$Th
zkWCZVtmmQ4jGuyLHyx9InU;FOd%I7jI`h!9uGj`3tDy<+A`9|3gfU|-z|;L`J+q5H
zNqn3!>17Piu<_nJ%sR0V(-KF8cVXO^9Y5Tn$L_-PKCv?=_*({Jh?;NKj+N$kwPZpd
zwxgX50oc>QJ_PJ~9#Dre#<zKj9|tFMIG>rZ;$yUZd{O(FmDw2R2I51uzYbTxro$)x
zk0+7uoRCV#7T2dNc6{{4ry>=B@qPf^;r)Orko+xKV9QbdaLEhCKDPA4T2IwxVzWxd
z@?xNBY4N>`=iQ?pV23~{(LRBPy+Yfka2~*i_2?Gbn18BU;0H2}IwxRFU)P?FRUNW-
zcoi9uzV~ehT0Svr*|>d&;Vp48N;eQdE}q^m0+t2$hy=webMM<a-@8vSqogZdfmM96
zSIQ{eBIo0aHzhV^OxlFu!O<uel{3-i*_-B3FwQUD)69+BRzWsODZY49aVxf=L6ItI
z{Vb(9-O4Dwl69Y8Whb7q!@IgOi}%RaHCeK{@j1-yA1a!Ao<cVf^_X>=bRB+M@Ow+q
z&q0m)>VE$;>nmR1lGRuFff#kK=i6s^FJCshuVDUH`nuju4R6bMM1(ijZoYN<wu=*+
zyWTqjmi5xo)wMk%+*P|tS~hgOpA+6tyMdN5_f7lO8@10!_bqhaQoDr~D_nSU0wIq;
z$S%pTsq3E^;Z1h&b-j#)pTP$h$cZ*!P}?3}qLUsQ+j;&MyEX)yzg}A;!++YfJtzEW
z?WZz^Kk$F})3)_NoNxbGu&HGG4JckL2Z@goA9pWvN(5nhcCK=KvONt|E%6b;$IeN7
ztb(Z6_H=!i6W&w1OU5RX82+fXF(@VZr0btK;ZJHmG5y-sr?zd_-S%0a<w?G+<l()A
z8s@uf#`4=yaNw1(g5T_*aDUg^nc;2QuY*l9ZNCN<yP)7r-aY|N9Rl?MDk6_{E>Sd&
zXSx~Xqr^2{$ND(q6&B-D>v)RkJfWhyU*~j8grXjCbi)blJixJ;9!`pu)VLTc*($k2
z3mOzumG&9TGmdPB11L2yB|FiQsT$`Oemfsn8FxP)tFb%&$r#n)8^ex_w(r3Y9~+jO
z-L@rz@6Fglf*IFJs{^-&>GE*g9AKwgbBuhy&h8%CdZu@@DTkE&>@2pjc}A-|fDQlo
z7uW+A%sGy;<{Y_6?PI*-qMgWbO*<APe*=Vm+ur#CfjE(j8+!)e>>>HpaZ`z$MBG@C
zlY$T2i4Qn;24m!h)xXZYZauqRsK>RyyrN@zddJt%l?>qAc&c@qLw8^z<`%BShn8|K
zX0&c)xC9Fl@Np6;<2f4qjA?y}Wd@YAPv=0n2uhlO7;+Nj*@^Qr6MyQF1&dr+kR!9;
zQI!SLtt=RXEJ(;tDC#sv<buosX73;?3wWJcZuc-`0o<}X+nM6dR{qDJ-<=I1WWz~(
z2SJz2!{#Wr$`57+hT~i_pTRkQGg1^q*K%3APE_DRIlTnxDO(Bl17)E3fBIL|;D1T~
zRxXHEu0`O_&W|ML5!mgMwbo|ArgAhtT=b8X{^jY|VIT(`v{?N#+NTilWh23ctMghP
z3K5oM2T+VUr*lG5uK2~OY3Egu8yC#&m~v!_>R*xAa^2f<JLU#?48i;9ZJ*&7f-Xd`
z&eyR@4p@Az?tOb*%61<6Y_&|*-~dHhHk^>by(~L@9XHpbrRJAyjsjZk5m+8xrLf`)
zdx5Uu^kzO1BWE{2W&f-br7y5yUAMmnWiHq>1-jWZC6DNvreO7yr72XybSOw9T0)zq
z$l2xX9LcRq-Ojps-CwzzlzY=FtZ!6SBCJ~w0$AdMcN%A}0u*Hp_<AY_dsRQ%`&%Je
z4)1y&E&uYP0It!S)7#63C#L6ZEFTe=u($ct?LUIwx_;e<t?S>Nvd-V_Ul&wzG^c~7
zpT#|4Z~Pj0_5tpZlsigln3M$>f8wg3X=ukbl{;#&#9p4;3gnKPa+ibH8{?nHMW=~B
zT(?nfjDI=l#`ul+BqcY-e>C7Tsf<C1%8<2<1<erR)Z0p|a+tB=XNbUVZ1gt~XJxt0
zdwH^;%x|?ncn3TBJ!t3A>A%a~T^3+uIy0Z&1BRpIm^m-I5S{bttU+@xZrjtydDM#F
zrgE9{oWw|haH<NF2e(hc7)AoXaRYvzAorKx$HN;*d6zY5KSi%m?w^CwIQ?5mro3~s
zUq?x(JJ7cNSafMmS@k#B_ck1NcAj%0+@Q`fCNBp~Im)f|WeWM&%Wb8}znt0f%vR@H
z%8L+O2T)s`0alT7#SEu6IkAEGD$&mbXD#BlZ0Dpc>vNrJvgZuc8qvbR0k3$<RNJ(=
zPfKjVk-^5UE!QDM_?V10h2RC&*aSJEx+F`ABtv>DA?m-~{^|32^lCetFa1aczi{It
zLPvyOqoL5^tymO*#%0(B+@JeK;@LzO)<sXnclNwpPx%u6dXmekGs-?nbZy(-_SbJ9
z`Po>1Rr=?|N5lSHysfDOjJdv7p^QO^ZNol#oa?5CeT;eU>;HmqyTC11PsB%ZNBnRu
z)*d7~i~ds*ySM)wEI66d$Je;*?fl9BuI;Npv4n_u3->{f$)(tP<WlS$->%}1GNycl
z5%e<|6WjKvW!RIuC>9EWRjfCn806xWi>Csl;+ajLeS-!>%ClC?v*e&J4_Sd)c&%wR
zRstq6I1LB^AZ$k2MtoG<CbqR_bO&(xsBbIQ5UA;F4hXEUhQ2dh<KbrLJEh~u#Fn<V
z_neKv6u#I!W~p-nPVGaZ4BekFY{QcuQfV8psPKAzgJI@iWzCuV3^qQo8&-Vqxfb6z
z(e-eQ>Fkd~nZXt>%zbPYo7+=-&v#$T6{YyvxT!lX?=pRox;sOv?l|9iaAHyMlrH2j
zwYU55Cl5z-8IwQ4C|J*|;mGvN3lf{`f(Lcs00ed3o4t<{Gg0Se`krTXz^xj8@Fnsw
z6s`zv?C&&T#zC^wkNiIE(vEIHjQ$$?ZF-#lZk%qIgXtA6?Bk8M{*M00;f%K3*_><j
zH;><#vbXzcP6d@@Cc4Zs4<5vs2dW?8nFp(wX3>7kP<B)Nq<bz>VNLm<E9XXXe%Nw$
zUcP`ESJ95?&KSzZDdX~pxlE^eZcM=;@<Dcx_Si9}_gZR{7ti+&eUdglc664p_-5nH
z3F#byHvuG^7qK}p{J*1EQMG;lw~k_EL6PH6_Fta1z?!E_^7h3_?Q9z7;kMIR%y~R+
zivB2@N?^69!dL=AS7*GN<b2R;GL7Bv>AdRE`T&PMrEd}GV?kw1)<2{Cy1%dDTZCGS
z*0y^`(}jsHY@To1eOODHY@qs2>CV#^)1c`^ZL{WN(eCEx3!X8INz4f16_8cYdWlm@
zfcOHZTVAK>kOCR<<hyn5j219mm4XQfxj8Kz@4nWYgkMfba2V0259rn+m`oWxCuBoR
z-v_A^0?lb^NZUP`7pvRb{rK@BTkuYGa~|J4FM{)jp#i)@V0zG=>bIMbB-1ixep~Y|
zPXDe(E0_Sq$I^}y*=Z+UW$%L|<{G`v1?c>FK{+-LXP$;j%{f)P{AXzAp!9TX;zQSu
zWi@zb2*GPmM(L->nBq@b1}6S2M*;B8DBb4!toY-Mws{x<fiVZUjk%Ix+b}tkiB7sr
zcH`*<i7n{h*bT`oRl_!6Y5nzc5s}p^<@nYo?~+iE(7#$`HL;1vX#8{dZf|$!YHcI^
z&`ag|<c=!UsjIKd@M0f@mk#z(l&m|QNkh6aN|&LR4-RbG6T;4ebJM$z>P#QlacTN6
ztVqLV9DX`X{F#S8oR^6mDSsOF2Ye`h!S`z0Kl;ayb*B2{Q^q65w&#>goZh^v?X&)n
z8dn@)$Ik;muozM0+cE1h)7M^!Y5$r2_DZb6o*8Jb41fgND{<h>%zo{a{XkOMD^o!F
zw^#P(^j=qL@kh<;yK7NE@F5>lSf@bQSSHtUty=GvhZ&DyxWgQ(+P;z^{|V~IY<v4H
z-`39bqkMbXHfG}MVP^1jY)?5o6I)Zx<Q|nX+ct%YKWl!MvKGH+B{E~h(a0nWZ=m07
z-z(Uf-h6~u-`*ceOW)43hj1E(d|tt4b-$D~g3`H!GL~=ME0sr8qbTv+gJ+Dx$3Fa@
z6<K~*L0x=9p2MAwD2J<axQ9U+aC2cALnQtsE1NZF<D#8>M5!F@I#Pr&rM|p^qcWBG
z`a!WnY-MzNf&D1y9brs^p<jJuX=dk?Jy;jkl-e;dJuoq~`>@W)=ZPI{pZjC=#apqU
zF|wD>4Q+ezm4xR8w(Z5D`7iJg-isdkRIVBu8h)*KYuk%^+n&YV2B(nt-sFCg-+@)`
zC!ysrSa{S6FT96i#tN>kz}-o!K{igzOu;9J7q;I43qLwv0~+27<d^qiUmznoJMokQ
zztZ=4@r&_uT2CJp|9AJ<;a!lX5=`-PoG^)v2K!3i9<0zD$h|B7?mih_(%#>)ACve~
zcUIy>e7rmias-Awm3XxqUl{Nl9JUeD+*lZf=YGRBV4-kgroG7q34d8791C<4pPSLG
z48REz_J@ScSS><y>$Dh&`gvkE;#h|?YNPW9`$zII9^}g%z0|4@yNS!&G)dmuvuV;I
zdUwWB<z(rkRIK*T!7mTLBK#`wn~N!r9xuM<?`;Xn;)TwTGd4AHMUp*R+ky{U-hrf8
zZy%mz4J578r%*64)Zdb5sY}dQgavX5V{IwcPsvle)SVJCLg&3c6CV#a%<GT;Y5^!(
zERORY-1{U4lvoe@sh{ry-{)BOHv9FSlePSe&$<;t>g31HO=uqMkt#1nvPP<&GXPPv
z&Ou$5l91ofcVkjbFS72Z3PC@9*AR43#tMF|)BSSd54L!`$TbfY*h+4StkS%L1=qo7
zSM+!`yS^o$0@d5f5-hJqyMcFmb}gUc+qQH@N0W*UwgPxuFhAE|M;q~fY&2M1*HC?V
zWMMQOuU#C?n>=mC<Z~jk$|g>mGxglEVW9<8wRO=NQC(HvP+wbJRVS(&8kfp{kp=J(
z)v;(*JQ}H~jYX^D4YAs2lh<jfh%btUni`|kwF_#aHKD3_JXSluIUWr)R>c>EYMVl}
z^-HSiY7vPWYiXou>EgQD`pdP)qN-R;#B{Lzn`5zPeLO-yF%rVo)rH~>A*89grA8+q
zdPQ?B;sKwa<dLS@tD?e&j8r!?!>6_>5?$OFUn=UVn&Od`SS`{<y@<wWY;kQ<Q*A?i
zlYp2twrsKJ;)W$rxRFE<Gal=!5F!?343?If8mp?KA`WO<Q%fyr=bT$vI(3!+5p&Aa
zKRS%6sft&PLe^B(jfyXBWCqkX#6wlp)zPLVOLK#VHVqb1hkT+UB}Yi-#Zu7{t-8E!
zX~fAqf%SAueACh<2os9NVhyqJp`lGl9YYrr_tJg&X_m%@rrIkbP4Oz|Ru&klza|=|
z((0p5mN$hKG{i#g@*p#fM{SM|iA%&NR`nicR7$^8e`+w*ml{azFDBO4#2RXALV4l*
zF=Gny3yOw^=2tbLXf@P_VueNH#ubjM85XLptEyiZS`v*h(?a2KBlAZVgz^@}<Bd(@
zM~$koFh(wHXjlk+G&IMmqa&*u7LSTIG}Kius;aFYRaduU@rcG)!(}Mhp_<|aMa2sW
zYr<p4jvZYyCO=#d9aEiOTv$A2!RYy;^P|<#(KQ95#}*8ecN#JQzN=;l-?CKSap}Qe
zJDQ(7xXF2F&~`FRJTi5Kf6@{Crryx+o58k#|Lb6!oZc@LUTh{S$OAK%|Gd2CfEUi>
zYotHSJpS|Y&9?X$_wDqD;kvgTeD8p7q7(Pi<bjb>{Tj3421?ngr6lGDk_(+4=N>el
zN>AV{zYR)W9{5f(o7Bsj>C>=MPrOKy=6U|}@cPfQVI^;);(ffo!8^^;Y2bx`%}ib0
zsdyhuf_tUnq^wUXzBx(w{F7`*8UGH&D`&L5vR>il9VF*yc;hFGm-k*bZ^Z%d#ue|G
zEEF17>tG&rYh^Cewp#Hf(}Djku&Odh-scqWYk0PCb$Q+3=H;;?G>?;dW%#jE7DDjO
z4d5S4Isa*1S-!3Us4D-8Cz+gPUNtJdzU0-NiuXM;UY(vl*=myYYO~_4O~!kP6jSo;
zP<+v3d~+SX9OexSCy?zl>$sO$eAIb~;v2_urFEn8GUTo&b&B^&%HZYQ?&v%h-nT2>
z7@lq3DX7u&opdw)^@>lfLh@qX?Ji3nDBd?rS#_GGyK!^+G2*_J{ZhpnN`f0mck7^0
z@iq}$%d2IGKn9~c->G=-O~$**E$?Q<drLCi`kZ!!I@_sue`d<7^XxW9XUvCC3L_U{
zf91MD@m-V*v&_L{{Bgy5VY0es#82MUiuYg1aKGu+?Q@FPl`f^*z~yckb}L@lzUX|=
zI_Pl9B4x;BTMhFt|7l*GXFqc1L#5)C?_OSBwpXg(BJMK9>u0(2@CJ@_=h=OVw=Zq+
zONy7DKfSpAJKQpeR5A%M+|;kuS&m!3!xb+-G1<6EXa3uOYn0u&2f({r@pAo~7dP-1
zw+!nPZ>K4P&WojP8D3YszaiE7)p^_$w3+kZotj2KA(FNYo_?`V@n*0LX<V(dcl)_;
z=PBMv$@DwaT_$f*ywj8M<~w>|y?jjZ{(wSj8LTnSjamTmy`}gzntW_WAJ$yfSTB{|
z&|r4*pT^UAeap>TsCa*qjQ1yQ-g%0*FKy#Zig$97^!wMjapgBZ#4nd<dgcAGoA(`s
zE60Cc-e=vsnetPX5I3=n^za5IuufWqoMmQ$;=S2yb9Fgb=B~es6mNgCjBDP1yUT$!
z3xY9n5<LW_IOTxj^YsdM1fFeq7eY)}DdStp|H@=o7rNt3PbY{Fec>%qytQW9b=`W1
z?Wd(D%2=a#PawF~=|z@|EThYn|3cH>D$8>;5Yw_&@pYMey8T%TPNQvoMe)k<wvJQl
z`yzL`gGUfhh~tv!D9z!`0Z+c>WdMzf`b7DrDZh73KV66Z=$7wF#rx+Zar&n^ydhxS
zqj)bjam(cU%{*{g<3Gg{HF<R0=ab7S4?7g!4axZ8PP|Odpd-m7#E1N+)2cCFck@;#
z-mzwR(E84F*M+#^y){YN1LcmsDZ^^T%kx`$$gtIsf#v8q#d|>#UJhAVJm@tTzajYX
zc_@A-tLIZePgBolfS#$IuLb>vdj6TB{1U-25ivL}_@#R0VodhYbZ6W2TlL%px<NfZ
z4f;Fvya{x(dfo#1ta^Sy(U(E@Wdb4~@>HHOEk5z0i#;IvdF*O%pj-nYP5f@85PUD>
zl~)YE3U;nDV%?>EG3+P7Zt2X6f4B!<31j1Dh)*$1LfP01_mppdSPg&fiD4P->3@{i
z41fH|l+gdUd?8A~&zO7iGZl^rh=Gm;PXTeP$9|lsLHd}78Tj?YJ6?3a|8DpVNa}y0
zXoGNt@JpV)!SHcRKx)FYpCSe${7g6{$7iW@Oh62GEO-iF2GKMD0p%DbAPNi{`6;Pm
z0%ELV!BapKiHiWq!|a)pJ@qkOOohCx8%HJeXU%a;K%C`R@Dvae#l;ApK>o3*ApS>)
zZ$6$`-+RV4Sv&~;8{x;C>*-%6ijm}};HTyNC-AqzjwmGmld!Ws9i!|Zwh4$S_A?&>
zVyee}j#!HD@4+>Bc{^8}1^<7+KY9Mo@Zil9IpF^fTr=_OnV#9=U8MI2=$}Kkp8n@~
z@GcPdfuDP}ljB|J;lEg12mX`6&n~hj{-t6R^m!Ki*;4fMkBGlR{&M&y*GHA$2|fP}
zf1SUk00B`g9)|zSUh$)%0seF0pIp9$VhsFi;LqWAPx)%i=pe)89{XZ(B*I^Y@YyQ-
z^U%k&hCFw{&eM`~d(;AZ0(Q2fjIR>*n_*8?_My<%ZLn+ozXtq!Vdr?Er+f|Kr|{=i
zqvMnMUm>FKe+~Y+Jva?^?h(PC#QO~K--N=g%lEG-k6{O!Z33dne&$0!G<)nV9{W;{
z{c4Y$y`f_QqSdkBDIl)**q3|ka^zvV1+3X+!_J!Sn1Hy+vEV5nZuZz$dhFl!*jIV%
zw|VThd+glN;+TNA)3M+wAnx+mS9|PhJodZA0F)2M{MdQKQ$XD7vES#h|IA}w>#_gB
zV}HP7f7oN^2*oi0@hiuIr-1mi*oN{p1LcW5L(lTdQH^5)qRX-1DIlKq*g3*+Oh9aL
zEO-it=REe`d+g79?B4OmEB2n)c5r6-1LEy0CkX507a4AQjWI-_|0q^8WoXx9b2`y}
z2OD;nx%g%I`-!Jnv0>PL4Di2X&*RXI{C`pW+I|rmN|<^0W%>JyMXb2WWa7C|$+rt`
zS^hLJ#2B&>?<aW{^LM2G;bOBH9&S$#w){hAAhP^r;-_Z%!21_Z`e&*k(T4~&*uP2q
znGLNnjPEfHh++8cBg>y5x;)|iM_K+H>ksyC5qS)x3?KE}I-O|0Lg|+^f3W{)aV8Z9
z6UA?^ze{`=q78HL=y0+C{+>ske|qenD}8dFf3Sb3xLXbR9+dXMqUt1~VT^(XJj;Kg
zc+VIDQl9N6NN+h#&+;E9T9v&G&RPCr#hepO|Kr6tHq<cuR*>aCMYM&aRsJL1=W33H
z4z$-PJLfU7{5OhomHg%K8|*(-9Cr#ih2WfdmcK|O%>07;tseV#M@e@1kNCSh`BCiQ
zuk+Xo8AusEe&7jzqR0OhPxxzxT7fxlpXDDfws2qoW0kjd@y-y-&N=uj|5;*}%8wYF
z2m8+ue;Z->bDkv2f19|%gFp00%b))#%Hgj3nJixN$h+L+N1lxE$lm}rZCJmqQ~G90
zo8_M>&ho^6kIG-pooD&a5$`H~&Ld~}&lS^iEi}$;XZdG}Z>aQg{yNJ)TO2;j^5-0N
zmj43rg0frTFBG#p`M1+ko?ku53eUOdEdRx#zem2aRsCm6p5?z({N1CE_f`I^ll~EL
zlPA7W9=z!u`=uWH9*=xw9{(;^{iqf>9{q3Qiz5tst}K64{I^HmxY7^joU{B3MaYAH
zqDs%tW%ye0sM5b>zg%28nCRAi>n#6bQ3bteLs6!y_KWkrS^g`;jb?d)f1xVBoWITT
zw}^XHdXIzOVE?1yWlw)Fl`jr3oWsrXUoGxa?GNW^2m7ye&BbQ<TScpqXCuO7`L7pk
zC|5K)@yqfr7so;_n&04;<-bAP0Xb;cvu62k7H9X9R{6a;%fC{5s^aIIWS0NiqJ}R*
zFq})w@_$c!SMkr2^4%rQQ~l2f@MQT{i<eaVoY%|puMsz*U8J$>cZ=UCc{rDs<-b?F
zru<nA2m5~}ws`XIag|@3FB|NCSbU`P%el6}{s+WGp8Qy^`isjY-jm{C)&5fk=GTXw
z^7aGOUIPyE4ljtyRDWyPUl!>~|GGaW++pY(ncm<kA?itQ#SS6RG|2J|+Hb==Bk6ao
zew+NP_Gx!uE`jbC_Dv)G{{H>vfY1K}hfl`)Lu}+D9`bStDau$I`C5elt4M>6Ss!Ts
z9Vr|?2Bkby59OIjcjO)ArT@2-|JRiNSlZX%-Gu&~LLjK5?~?w=I;)G}ehNkT?-t@s
z(BM57|0w&(&;{)Up#C2VaW3um3NcI33rG$9Oag8i@+Jz(c=;wk`H)l*yibTf(*6^S
zFKGWM=8$Md`~k)X%Km}*zy-EJBz_{@QFdm~Zp2fIaA_z*afV-O<&*#CLU1HboF_mj
zXP2TI6@8WzI0HeczkJX%6sTErUt`TFkp4p1pHuXor1x8L2G=3~Ay3*Z&<7~xokI$F
zuckZNg1c#7BLq(yKy{UKVYE-6zCgL2gn0F&z~iL@#Cwu<;Qfvic>kn3@Ul_Q7>;+U
z5bvk7!~ZGTv+(Y${4Wl|{s7uJ(g%_6qz?)4eNyP<mx}HL4L&Ty*ZRR7g=skHFERch
zeFSIAkUk21kUoa>JfP&iofL9BON!Tk|0aDLa}$alo&x?~<6WQhZj5U{S$_Vi>{#3+
z?Z<<%JdGlSvdc&z-^GfykwWfolOlaTBt@pK1!cZIpy(r{M!8^pWVyHil;vU}Dayq)
zq`;Tu5aA(`#6eM%ROUBuj)9%!;uN|=zvDm|e<kfkJcV@s4f3B9daEV{KI@^$Hv;xF
zfKo2%t(g>!_VuL5=L9L@K@%e5fr@*EM_c9!|J(hC9|#<#V>D<Q8iQHHMf?{jO1;qD
zPP!gjT0qf_h`%fM&q*Pl-v<i$1}QoQ)E`pizDtN!x}*FaiE`>c34EXoH-r@7_}=0l
z3_enXyMyis_hVA{cPq;CPFT)|1mL~~dIx1Wzl(H;5D$^&;!Gpbp{Tbgzl?7@sHtzZ
z3oLgXlpmQa+XIv{nZL;QY`E)s&vJT&;zyG%`ClLf-^--PZ<ij?xq0;%As^(uiWGW~
z?al^#SD+nwc!Lz_l<f!jzEJ#9pWx@575O5h;JX9VKU|3a0;N7)q5B#kKB7DHak$dg
z2t}tUy<I^&_`V5BzVDKTgm{GRNXJo#m+3y8@k1$E4=h(-d3`~=y1uX*X1qm=7xGDc
zJtf2{*je80qC3(r>mkzr4(*Uv%O~sM(`YwU_{oZYIw|;deH}vk@0@tfQhaACJ}t*2
z+Bf3j3sT6lNbxl&KAqqBu%{vN*@`btib~R<_@um$8(Apj_yZ{WsZ8b*JV%3?<wxQT
zbMP)^IK)3sQMOMkKUyCsvJ&@sQ2#TSw<I3YI~bJZVhZgD&vL{3=G>$|gz*FE-9r2v
zl;wXX=^D%{vK#=P{Wo5}<@lHUte@0B-+zez1NuLUZ^Wc0p&pQ;T}ugoZWiJMP#Hg{
zjGyj^zk&99(I1l{|IlR0e5aoMs0{U>J@j#cqYu`@;09})LV55f<pHFO=OIP6k|G^i
zA48Zv$UPa9axJ2LjWst*xj5(Q58+!4-HmcJnm7ozg!K2;w}K!t@t3ftq0xqupnWgx
zBQbAFoa=;O`$zXHXop@_(hecH?vnQV72TldR^`u2j>-2bsUZiV5^4FK_WjBIx9?{C
zNGrhm3*}v7weM+2+<e-hEb7(24ec-OXx!G*j`E2jAoCqwQV(x{rWLC3*cg@G7gf7&
z$jkP_|1IP<!x`?UGCbrsm+p|Gn)HuCEG9)}%K8I+CtzoP`Xjm{{6J8<pF$%si|z<7
z<p-7VfJ*&C?i`=xe<mr)!R4UT`@OUy9$D@Y&+lPpdDunwHTW*z2Or8q9w~5&K<O^W
zVZf1d<G}e7-4UMSE|!}tmS^A|OA7aipv1k5c7$&QC2l9}MtYE?B5k}=zIA<<?G3_x
zlj%gfe<lU~Tcp4jJ_~;+DDh7RB|g(hfA+V2WCHsKQ~zJK9oP9F<vwHoaz6}FDF>Qd
zDL<;Xl<xyj>WAA=C_l&Xl>dAsuPYuj(z6*3e7))CDdLsj+Xnfdr?*L=ham7659b3I
zeiA6-Sxy?l_i?&I$bXQ6pYL?Emy@FZJC79kMU!?Wo)t}1G+oh5MY9!UKSKUNiiQ-;
zRWwi0;fm_?7Q;?CCn~DztE?X=2l$iedz2LNz6{FrvHfAVqmd4#FCUb4&J(3g!n`Z(
zXpi0oWj%PG_Ipu&Ns&Iv&H5$V8Sqysyt#_Dk-o0_6T~}@IH;fP4F4Cj!=%tV+c(Ok
z%biYFA;PDXIpfN!6)u8EIX5c$cTyyB7b!gdLkheJ#Jyj=H{F8wR}~+>jnV%pQ0n15
z+SdrN2b6k{@11Yrn;!EKc$brcUyd^&|DCiO>6h)(6i@r~SJl2Cyp$W^S3)k9ADJKC
z@Kc@emr{Pn6DR-K);OB=VJ+PePLE5V8WH@Pz`hUAcT|6a_->{h;qM}aa%B02{e5Lm
z_rd-5R)3Rr4z}si{tvWMplrXW7v}d%bO)Y%Z-@NbX$Kw0^sm8t6=@gbCI#OdQuy=M
zJ<<)N@1p!D`!3S=P`(3}|0Rk(KnlDUNx}cIa^FL0=t-8db3OeT5_LV(h4>Ssi1+)T
zEN2hXZiJWlG{e!eY%kHMG^_B-RCwx-;r}aH_?b?48SjT`JdgO<&oTagsqlH!7vdiX
zJL^f9{z#{+Cny9mpAk;VfpF~%w?d6qdkcs1+}ChYU*{oTRJ;tAcD|ZF`PeF-X%|@Y
zQbE|SqdzLI)FbQ=S)^TP>689Hru`z615lO|BweP5>1DdInO>x;niT2cxRLsJ1k{g0
z`Wz|B72h{l@4m+Jutv@Qpx#Y^J?&!j&!GM>c)zDV^pFjF-H#Km6!tVE21%3S1u3tg
zuYCGPoc8}7*n>NTK+zIu^YD*yK>njhk;(O>)vDct|8JE)*TT`C^XQa&B;^8??fe?>
z(GHycD5reiTT6O3#y_AOAODSZ@DB@u{u}KPDeN;8ov-L4q}4*4)DIMRCxcQirzv_a
zDfG%~&Zt+;n@|tD4~^-`PeC}u`v58MH-e^BLEohFA%B0kBORRcqyHpO>i=?3#?wak
z8}QyldIZK#biWt+pdF3s!^-|EQs`N?KP*>iHTXvg`H>7s!6vEf=isjM?;N;O&I})D
zr;zh;X$yp?g`M&?kV0P0|B;X5C$>)`0+#(YQpmpnl<pabkmJ!~6>SA&K0gFXJ^qUn
z`I1e2eS&m@(te4uQ;*bNjPBsSnH2c<lOq1VgEAjKp&feof_CV|mtxTrML91;z0jmZ
z@vNxS1ME@{pqa{@`XHay3z8uGpIY<nOwTj0v)}z(QQ1F3uCdS$<Co)8#HYivyfa;A
zfHFM@D&<cjKjbe_;mQ;}n-t-X0w3$urQ}C`+yP4WEai@>FWu`DZ3ksO{g4#-v;ma-
zS`N+sO~sEQC;7K1{v95E9dDE3|CPu8TICKAr5vx2R$KL$RL*l4@z*Q9Hbwug_|bHU
zGz|8?Ae|>fF4E6*aD2yfoCRv<A3$XOfy(>?mH7uM^AA+!pQ6;C*8eYo&-{6u)R0U2
zPgL<^Xd(ID^YG1so%w*Qw$sag`B=zD_fd-StTo#20cCoAsq9?CLw7&x4U{@i(PGjn
zq?2^M)lbvT?;^Cfkb-|TDC7G#?W0lt6b%G`iTZIGDEX#=GJVTv2hR1R^U;2QGX6ER
zgKsM->glVB{)hg+83+ZlybcFtz2tXsrh_M|F<iT{uT=I2NFmRoivAXqIO+W?9JZUp
z8Am(ZCzC>s*`UN_yGh(SQpn5tPI+n4VhF3K%x~CbeuK*V29@~@D#z!bgA{*A(OgCI
z6dkT8^PTvGiWVt4LD3RLOBJn9bef{NUR?}3)1&Lv1N5I~t<xn%*CO+c^Frif|4S;z
zaiD)w_8p+)m*t_^dQV9MUCMl}vc_%H%XevqJJ%PGZdd;Ddjb42k&i4V+=s|`Wcv(y
zBi&IhXwu?Jub@(|pi-}(Qm>%dicjhlcBxn8&U*C%{E5%{lGY-`RLT!IXOKdU0OYdc
zTcY9vmGObf_&{ZRpfWy1iT`zle=G6lsWqB+qrImc@%)Dr@q`c`+flCLX8pc|6zL=$
zaTb75&UW(8L;p)Va6Y6RI6FxV9QodjN-p2KffrAPSN-Mj1|nX{cP8UsX6=b)e}5kA
zq*s$-JjwPd4UO#<+M$eXq(4I%AQ#68r&2!fvmfC&;YMZumZEHjI6iq9l;4?n<~aHF
zIB6s8!2LZbaQA`|m*t0i<3Wi#SJ|Va&@WBeHF#E3<}2(nUqNNQg35damE{OjmLt%R
z3McC)?0L#QT+yRIsh_c+oPVnZWxU5K_er#;`s6&3ADyY}j}G(66?k<2jpEnk;B(lS
z?`*GGUid!E@kAZ%$Y;%mCPDgdRQ!LW{cxY?rXBnP6@M1&l#lty@Jt`==*py?my<$|
z>}RP*G^tXLf1@4g(D7YC`|s8K=O3*1PtHSbraSDPfu^Bx2~ghaEV=1UxhYQvDC7UG
zvj0@k-zfU5@^{TgB7Wu%<sGNu(eezT9rEOR+)q^Q=rW`prQFct^>jD%7ok7u8~sVy
zE(VYAS@Zr-0=fX%A3R5jbi7Y$=;H&}nNP?{nGc)~V>-W$a!Gf#d(4jyNfBQ5fAAk1
zfE{wMA0#ax1@6~?$8=uGc-E+S$s>K@KG<0w-k>|m|KCYb{!c)B%(sb*AN&`BvivWi
z-H`KKhCfn`&(`8l8rb>05mi~vBd=6;=0Ef8x1{MlnO>$xj{hL19zXJZl<vCyVSCDS
zaNP*$Y*NI}dgi;`s%O4Ct$g(L_lXek!845%X^)czF&{#TK9%JO%LT3P?uS|9Gymae
zcMyi}6>R6Qd{3+<Md98|dX)7Y!H>cbqW+HtKIuTL2O&jeyodBSw9lld++UC$kNON5
zu$)egNBkk+(|!{0NeAQohja+=Npm3&Waan0Qqq&vckDdKPy4Ajw}A9C$WJ;P{7933
z6yzrj1D|vZ@JZ2VJV!bX>kCPX(VnG%o(_3PCqRBuG`{zcPK5lVlOaE8Ddg`DT8{A;
zX@wB2q-R^-q5V+uE3{8Xo*+Z~m8dVIv(W#L&PM-0I>&lH<NNhnw0|A>hCJZ-xQH~0
zc`VX}n13Q&gzt!?wfG)JdKvhUSN_YvPg)0l(#7B>tp`78Bj(9SQR%Xgr+zeIC8Q_>
zb)@K5ZzsJHdL&&6eA25>e$qj&#``bnH7Mt#-+=t2t!R%(uM^^R((6(FP*(hH7&nnF
z$9xIt3Y2@&8-%!zv>o~<O(1_sZ$$Y)UGaB7|D-oT|D>JJKk3cTKk2tnNJqw^btB`^
zE8`<07fqiXF9=7bO`SBkvNAGp($vWGiRYHhuADfztS}N;&=k&hPJ9`QGg)vxOSm91
zW!j8M6Q@NY(<9;VXdKG2xGIkGTVl2K3(G3cslLh`!8u<xhJrGlG*f{?SL&j%sY}Yn
z#-fc4v3S|6bEeOZg!AP&G&q5$CVJ>2pFTSrDdd?mW&fK}%y&m#2n|&K@1@;{esOeh
zH4b>f(Mi$zB_eWBO<koVRUocHcK~HVsyjS35{Wf5#GM0>$_U(h;SG<mPAS6iMe*pu
zhS<{m@sC{?t&hfPtIYr|k^5eXA#AyQOwwc?kTtr#p#=iC@D5l7W0VS5{35Zc9)Nup
zP^z>Dr&GnMaOze#9EsG{<M^z_INgd;9(c>(ZW6{eR>hj4v2cDRB(0Rs#jXeruKDRH
zbxkyh)CZu~@K~pDi^yiAuw_vdb%3G;obc!vj`hL;UT)7XmyOUiTHa_q50?6}Wn#?y
z=)&3_D19#o`^~q-i?xWc2A(N)U>(K*!0R%10J$g21KI^1My91aSeWqGy6BZWp$-S0
z)w4gV(}+&G4^*_InEPzAijf$cDHpAY@a#3~P`NO=Vbqr>jwq9^TCRgm>F5Z~j<XNE
z`_gc1m7;Z3@mic;Cp$(@Gj{-mag2TTTm&sqY$=LQq^1Gz3ve3VA}y(tAzwN4LF+Uh
zLnXBMJh`u@m<L>LlAs;5WN2+<zo|sC+O@t8_`*d_j@Z2g%1=!cd4gYkwM_283O71h
zU!&EfF%BS4do<pq1wh+p1uIa40@>E@m%YaTxMzP+8vaTXkncr1(6Uo(cP*2~EeVgy
zhxxLQMY?47ig*BdmZU(H7W4)T+@eS%z9`nv5}A)fGpk~;Dm2g0mI$ia!uTRPoEo!;
zs`+>=5Il&HLm5$L9VsdQH?teBZ^99i&GkG4lxIy=FIvn_O^l>NG&Z84F)mN&WPl|L
zn#9OyBk@ur7SuE}qNLWw#Nx~Ozj~4UU)O*`BVpxvo}?oe#u}O%1&6>maTA?<ELPtj
z7*qfS62lG1I4!k$(d7{ybSd-+q=b+sla9n0oY9d}rk^)La-uNTw_N5PHukFQZ~>07
z#Q4>E51U%eccU=QqKrl2v8vj5)70v+GPo6^kHfj3828bkEIcj}slv&m3+v^mBvy}}
z53g{S?WZ0cOjKj58mUJOUte`7A{mFSA{tu~EjzSoLko(2NgmN!6J1c%To=a>x;Ac?
z$UaBkhc+gR7FQi^D@UibEOK@1YsHeL`bNBU#}~+xT&o-E7qI*pN6Lx?aSUPk4kU0=
zZ<GA*oY!lWtmvZ1f|zyYtUP+Q37Nz?FVO8q`7VcJa8+gLV^QppsN^#TMXs5HNbTZA
zS@tTc-O(IC8<;#E_xyqJ3Lg$zGYMAINv9Ja%)WY*0`%2Z17-FsWwoe6?nHdW)poMe
zXihDyFJqnBr<@1ZI21QFH!VWbTYY&Ml7ogNUNs+d>0(I_?kz5P78RDGz?DXus$;c{
zd?hW?1-=&Vx@?b|o2H&!dl?$6*@clx%=_qRm|5N_pwh-U5uqojW|WuDE}IjXGjY<i
zvdAIL5Y@QZ4Zu|7h}GU=R5%|8M%ONwI=3lSfaVsbL{~R9qTxmHZ{eZTdT2FuPNb}C
z3{IJDj+V`uJtk6C7+=~LEt@?tg1<gW-&p5}(8n%-y@IEFKxO%nIbn!1V|MZXa_p7o
z%pQvz-Pc^tLG^r9voV1PE%#BeeQncJ!DR!g3T|1CGRl_5F2Ls$vV2#fTpz3?HB0O~
zmvf>T`b$7YulUL#t$953&y96B&fJ&-K`s<{(tZF<z6D$4yuRzVQRc43b>11jYUBfd
zZ;=AmoNwyalJj6DSbEGf7Nd2+gh*A*(z1QlnI6SC*}LB40#|ve^tQDu#o=)n{L0h&
zmqye8x(o&RAQEHcWO1W>x8x*9Qxp>w9H|lzUo7MV6dz&@n1`Bke($rtJyX}?Wl>=s
zc>aa+7geEGRL!(elPw_+CguBqJa8G4cd`Z6LHpKwkIdQ8k+7%dg|lprdbC*w+c+f`
zWsDL<k4}4&rtT2SQOFA^<lK!K15TfvL?`Ga4z(Pf@lT<e^y;+>v8&j~X-zG)@#;k*
zF(#{v9@zYB^1Shsh;UzIIjHZ6?&;z180QuYD>G_c{iL_?IoJZp*D2$64Oa`dv_}(n
z(6M0VLJbA%_R$p;$FW~ok}y%~Tu^ezqA9>+yEjexCX+)JDd)dsB~_Cphb|%~b%#7E
zr*PO;$Q-hCAuj7qnL`%CG*&50)K|@KYN*52Jg$f;F}Uej(DyZ*@7Z}LnKg8OwCovy
z>l<CKFW)_)Vi`b>;7S2%svPJP$YQ9+IA2+mOo`nK{f|bBTr(~vaz)JqkD+H1-VQOy
zE8w#|zWd73&S|tH_ZpRbWf92M!?@q+D@2C&7Bul?US9d+(q1p(AJowBz@s_v;bPcn
zkCJy*y(H)$V#54~-Q-yxIQycxgNTS9hOG<0>@k!vR{zQp1kG8~Q->xQoL}^Gxws_l
z(8R^ht<Dha5XAv~dG8fFL@}{h)%VUFqA1XPn76qdx>%~sCd?cae`V#Ey^u9$g=^;y
zO+w^Agx@9(4SX0?CHV;CD;s8`@$%g4cW9D=c;uabhX$RW{PvX$sB3IBKDyR7g!AR%
zr^W_+Vwx()0X^oMFgzF&DXMA4JPp2`PQ4O=$H?cY)2<Ac;m1$V(qQhMW<MqN0OseC
zzrDIY_AGU;lyof?b-&tu#S!momFgjl*t0hDe=fx=A94zBUrS>TY0^D9x7MW|(ilC;
z{*p0D?O_cV)-P~{mi#U=&iv9ISyCHqN&aQOOwDIHW6T36&|fxUxlUqaL9tpfF*0mF
z*$<<Ov}b|+6t<u2htcC~Hv1`TKiLn3V>R1o`>6m=D)rS(@v!agJlRf#W9;DeQ-S>y
zwx8^W(S<rdf&CP=p9-<Eqo#IAP3>sSRcJqrwx0^@r?CAr8X>tt1k2|O)FU3ObtfYW
z?WfW9Q-S>ywx8^W!mtiH+I}jqpTf?Qttfob4UeSz<jSez3L^PBe4+g`+I}jqpTgX@
z)JHQG`&_X7#5U8O$Np3!Jhs3{^CI>>@EKb}q$yNX6KqM5hI=hdz7n`%D}-$_)zdKW
zVS9%tQTDYzv-VqYFB0V;9=3~!?_f`diMJJQbMezg<9!Q!Cf@773xSDv*#2VU&B2}z
z6OVh~=D}YZjaLai6YmS)<$;NK*!E)MU55QaCf-U|c4;tBjkf@NCSLAZYriA$=&sXy
zHzIN2VJ{K3ZrMiT{SbU6ULEj4;36JGxABgLqluRf<?`GDZ8YAo;4|@V0$wASh==Vf
zHr|6LyYW^+x!jkfjmG;0_)NSnfVT)t#DgkqygjG6@phnqp$OVW<9!A`6R+myj{dM!
z&Bl8#<i=Z%%#wG<DnyO<4){#GwZP;4K+1<LUp8L4N4{1F|DeJm(RisI`Ig=9$cHUs
zHeTy+w|pf4z!oXnXuM_MGv#|4cp-36K5RX+@vb_-jkg*AZSdDd<1GQ7iT4ihbb01}
zQeFQ3=E2K{av#%Rpc?N@4_^8@t1iC*9&ClP@up+{n_2#L^n!Ob_)Phx8F<)AXX9Ob
zk{fRw+An!8E_i6Pd>4Sv#JdT2JK#_G5S5L0J_<L>k2bH|VeKm<AM=@d;qM2?M41j%
zcXk|;yd2yCKE^8)-?9fBJr7n`si59?-!bAv5If#~AMTEK9Wwtl_-mun`w{rec<%v7
zKA4z}q4??i4MUk`eyq%~_LF+?Mu5-M-%G&Ttnf}T@Vx2RVWi^;#mBg(q`T8mi9%8i
zcWrb!CWFsR$DPOo`Y|1+;-}NG!c#9-120*<yv|cE*Mg}+;h~Dzcpt-J>Sf-b<n{7H
z@R@qq3A~WP8)@L3o#n<`54`u_uZ>P`IrvPx?1!+=5ll=k^G~PuepFIZzIDi-S`7xO
z@qPwA6K@*u^59Rr0{k@Icx(zb@j@q9=PrRo8jUv=d?sGpz~dM|<8AQZtpr{|VUcLO
zCp~y~8hF^UYU3S^LgtbWm3AB*l+kztz-P+$H1I0H!}L;*TD~h$2~50sA?&~8Ktmag
z7YCn-m;EsI&w__|<MGpY-g5tiQSP5reB|BXX*b>)g7ZD#u8ofO15dk={!42=J>xwC
zKOOHI2=7Wqu5}Kc7w=W@nd!&{UMrZ0cNTscuNGh?UI_j68+1@c%NK>4iFXh1+QCD-
ziTG)}ekZu`Soj`OSR@+H2R;*T_#;mLG1<U-42`BK-+JJMlF0Wk_)NSy;57n=@|78Q
zf5Wqh_tr3L-#VP7(ek|sn~C>2@N(cryeatU^j_^Lr}NNA-3xzhG+v9RobEKzI~B|t
z?=DaKoQd{J-chXpHQx6;?Q`Ly7{7pr@||Pg{naDiIy6#0OQOHOc;pKr(;5}txdz^M
zkUmp?^YW9oyWawzslPbzDiq!f1Fs_2jTZ{z+@B=!m4eU2djfci6y8h&FUwOuTG8lT
zsQO~C+2!v@Z~gd{b^amsH`~B#QFt2Sbu@ZNvTc}eG)*47hk-W_?!-F}Kb^n*hPl(5
zImSA_4J^`RD(VBDncnQjg=mEz@h-qm<2~oa8<#wPH+%3_0dKCtyU@UU=_I#&>x*!n
zfKEL4w0v8^XUg{h@a|K17aMq`sIRW_a=LZyAy}l*cqQO7@mBrXX%8+1r%vxXo_0Jm
z!8$KQ!P)Y?<!Q%X0v?hg^%pVl&O^U!%C{AGJTpQYE#FM=newGS;fyD%47^{XpEB{@
zDoNh{JqkV(?+f68RmxXw;600YO}y0;k-zZQM$5O!Bj1GIICxPoYyH&^bK_M`vd$Uv
z;#~$lQ@&*e-a-TKSWkYmPR2RJ8Vpp+ceE!zo&cWCk6Huofn2wI`K8J6ehxlUzMTf%
z<p$mbgWY&<0Z-nWu4L5m%?6)|H~dMbJzZ?z@vKoZKPso-{9}bhqVZk>lZp2Q@KD5M
z{x*OH@k_<80{yLt_ZINv{p;|f(RiicGx2hNYn{i!_TUQqG~Ubo+<2=i5ho*1M&rE*
zJ`?Yz^;TTOYr;?C6{c8teigoTmLn6L$VbC79!<PE*9#GXJMo(F(|E5cJP>JC0#Dux
zuk2dBKY8$;SZ|G=iPwUk#v9(>E#GQ1YB>svM9assOicOi>2ltWmKu1Ik8$g7J@6(a
z(cf9%Gx1&mUI}n0-_-`5cbu5|J?H)MQ^iLae{{HtS1CI4BJ126cuAx6au@g*uTXs1
z8=QErg|pVngJ7cATF>(?w$ANiP#TT*3-Fogm;*fOkLhT|Pvc#M_)I(=>bnvC+GxBb
z;4|^+fR_&@;$4rQ#=9oq#@h<Kof-^O<1GcBiFc=gx7@%x3YE!}Z|kMjeNh@x<7I%)
z#Cr~SAuv(C8}QTeJ*~=>*5AsngO3p?qwzSuWa52b$kz^Djh6!^Q@(ZRgeE7!%Lbo`
zH|Qy6+;pRX$1`&n+^^)>IWKv+pXb4=0iMo}n+&|~AfcvwnN`+#p9<d2k8gp`ly4RA
zLSUl)aD<JW-cnCHv=w+Cz+W4!zY<S7^f2)9z(l;2_-Xy!;jNeRaUL|nYNPRP_0-GP
zfp;YmM!aw1r|~{gcv^qc7Fq9&8jpN5|Lwt>^E-@(;7+_%_-VYF5pMmh1|IM4(?-iT
z4}7Nnb^`A)FcI%I{50Nc3Qx<IUuWrA<7xR`_Ta7E=(Gp78+eBw>z1z)c>Ogv__Tce
z!Dq_%0r2wSPx;Vv+45bY@HE8S`sC$rt_N?>CI|0M1Me2(C9=tGuNr|jj}FRc`8vU8
z$~O&o72u(Kcj2e?H{&oj-d1$FP?c>o9`DpK<K;^a%ZoOek7p*E@vcI=m0)7LYw*+Y
zF2{q3*NV<L8D1;+OuTmtyt@s&KjVFkcv<*KgU(sYL_44Pt4Vdon+ZPNPp6FzGY@=b
zyoH;ESPv$q<6iu9IyeSlygGlEEwS<qPSTK%hG#CDcsqeN5AMXf4?m6P?FX|_m=IL*
z;pjHWN8Uf;pVXg<cpc(B0q)x9bf6fx^t=^(3pEp{<|CFV-<)Th{%tM%w0vhFfQ(mR
zlwgq2rJhMN-syNS@#=t=4}Yfj7x-yBZ+ZtA{k}ZcPw{pi=}vFvl^CB=5M^|{?}Cr<
z>I}IP@#ewGcpt#8w|Mi6c;$I}iud6o-0`+9#k_rzc-Mi?jQ43Hy_g#7HQqua-d&21
zGOkW{$GiF}>w5vbq|xcU6MSa8I}tDanBGV6)9F3xXm`G?2j069$@-`9GQdZ?66F`%
z;^f<};HL2w;Mpt(>oAz(IqTYJy!mi2@d|<03OCA!S4|twTMkMLz2GQB$;Y@KKgz9_
zmDk|>Rk&-T<9!5trd}RKyjm|$f?21-8}BqD-k&Qz@)l*g<K-cuQ5`9$j<*neX1q@$
zUOi6iQh2P--gxI4@#^}<crPE|j<*r<-T-%Pbi50}XU6+F;??E;X)yPe-Wns`A1glc
zo-@!LFE6e8P)7=?<DCLNGv45{PQQw#y4QFcjd*{e_!#dOXuxH;QtjFf#LN4jwbAkJ
z2A>&kDdL?ACYCEC-H!J}fJ!_Ckl$wASE8(TI?g`M&9`;Ab#AJcuN-`gw?ui|iFhmV
z%y@r~AJf46y%&O-@s=RdE}(-lIvqd4gNgS6@LIt`yyx-Lc;51|4Ekd{<jVjq`S`n4
z<r~iqr}^$TEjcWk^X$*Jo(q)6?ciIf!qADL^7kkTFR9Lgyc@0aXyGIc<D_{Ad}cc8
zo^#6mOYrY49m|b$WE$z1uj19|n1FaGhc^28cPihs=x2ZrO`>fyUnbk}X?r=P&`Qs#
z;4_WpdlP~A4E0Duz8|V*68iD?J>t<pnfH3ZI}-UzJ}n>lcA$^aM(gh|PdQi){qa6_
z=I`tHY5kpva<8$7aTD|xQf<Vy6(69)0-Tn?m5fz&BO6AALZN*8w6UJ8|6>aarE_>}
zQIX|8@33!_O)K~LoYeV{`;HA|UkP1E0no~1xO_2>oA~?ews&^4eUSMc87{u=DVCm&
zveZN{_q{Ln?%mrN{o>+FpQ4{M<Uc=2facUhp%p;W&gky1n;|uVq7&<DVhy!5p}cVZ
zm@x(U1x3R{Sauez2{qJ*VueNH#ubjM85XLptEyiZS`v-%<hoFJ+{pZq1);n}@pxm?
z_)(*9IwvtkE^KI6SQl+-XpU7!c@od4ctb-Sj-jcoA5~YkWbuf`Si@!5E*z>UUQkrL
zps*%9cI?>EHDmI_1<^6p`Nf6BV-}2_KRQ2J9UWa$FnVmkFsI)5u9_u$%Tj&Er3ZuU
zQ0yRx&mYYx{5SE))D`|oNA#Q07PtgFAvjH-J4~4Ww1347!L~pY9CYm61nk;t@dQLa
zd6qbBj4um^0EdkXX88%>rw#4vl!ftU;gDd1UGOgSxyk|EpBUipFWV*+M7FUpWzq4W
z7>mOo_wk@X3{ufuOZy4ReljRvB#sZohjrSQV)Z*dG&CXlBhC_1RtWo$P9AuO<D;sh
z@)RWFAVkwyo|)CRy;Wf>U95@d`h>Okb#?naaVuGvzMrs_EVMlSirYt=W1+mqJ$VmZ
zlF73V#ql0{vX7%h`o2FsiKJ!7i$0o@kbk;gVUUNBk36GX8~ykW9Qcgvm&R&$lm$c=
z{~|n_d?m2U`UFbDa!kYUW?xl<c<IMxneq^ied|y0Gw~W>m-P>nM&sR!XA>_DJak_Y
z4@KL?I|pFI(`mj3&#W)n=yXg0lZnTB2Q?n5gpKzvJez&mV;V?N#zpf!etgcS1%`ad
z`ZS&!ufvef9Iw!>{RS#Nh$Ri{{w3;}M5p5@xSQ$V`QKX4tj}7{!@#Gp82(|{*MWlA
z`N41tn&Zu}sMVjbui9^)HZFg30U1O4@6&SdeUZj0TY2JqJGGWO`lz;dzL5Rd-0Rje
z2RmEollZ{u$a?R?I?6KJb_ZJ;I+nLFfbW&PZ*2<Z&cmbZ3lrt3n^LM^+f*K$3({FJ
z_v4Jrwn{vHoH3xJ63-=g#$yQ{^R35xJcg{t5FV)<Fl6EpPh$IK{6ice5GRh4=vW?P
z1KU|~0$5qx5$Z@Cio*wlV$4pcnRF}<R)BO?R8X=KJW{egi_<*;s1)2mWi0~gNRZBo
zkpQJsz@%87#AFN*8+{_N!|M7s1bY>6q6C`=1jYrheJhE$B_$)fe`L*fZ9<sieb!xP
zBk<fyer7x(HN1R%{D@BZq(&s24<U@u!;}^4<A1fh6Q#MS_EWG!2GOG+&E5S=72gHc
zASfhDnHn{9o}1p$oElxjb^>5IiD|jP&Skl&i3!%osO^JbVp(obW9>qGzIb{^X>O*D
zrjyr#i9||gSvs<hSy!&`P6u9dYG-uk*CQBI$=m^_WtjdXL$X6QhU+!H4vrf4&I~3Q
zGbYnl$2EqsI;W&VXX#oKyQXCOn$O+@-7t+EEvcP`npW&;9@RP{yI<R;Os!jJ(GF|n
zfYjI#E{!R*QT~IH=c3-_IScamBz}j`X^@$%hSC2c@?Fxqd=op$(mQ9QLdC&Ex>Xz@
zaqyrtc+mP=)VqA=_LT1{(x%lusQh-n<y@26*^;iSqemUuSr;Hx*GP=?=bQE4to(VM
z*QO)?LmNwTbA5IpEziC$*gW~Z)aKmIYcp4BgQ6Xh8Kc^XUFF%q`1{?*wY~L8qC8s%
zCX(n#fn0kl)1gR?GDOF<tQa}E#I4xdd`jyw@X2N+q@C>wk=Hy#r>AXWY9fyIDUR01
z^XBGmU0mt)>aSx8Q&iE>oQ_1D*f}K=>5#Z6@AfMs>N3+anCY34-Fj_M#7{s%RL$6k
zE66(fBb7*&7S3sg(H)_sx4I)Hn8wh*tNk_gpJVAi6I#pm=zlmwErb4<beRRzgVr+M
ze0P;V+-|5b+ft+5I@@Z@iJvNU<j$aul#Y`0XvYz3{!gEV=K3|})mEJ*DZ2be`Fpn4
zj@FIzdGwvm7xN;c&{F^Y=CAG8J0;k**$?gNywtHesQZf_&>aH3;W59$TmRl28C?~@
z70)!Msx}>6k3A1S`I5~603e@zv(vdgrl87$E7k+bD!hPl&kXd2*PM#nXEB$F*i<6N
zs+}FOi%iY9U_HhSspu;`Xjb{?sow)jU()uXEWM*>#oqYX<hhXBGZ(<9G6I7knTp=>
zBWZtBma2*qMiMzP>Y78-O=h`@i&s#iJi6<fTfY1iyW*##8D~?5VUOK4n`0hb&77*#
zoV1IUrAYr{{JrPrk-8zVN@x-V|KFCsZ}lx{dAx?>&5r)4w80&FOM)FKy;onfuqhmv
zTjNKqS&Q~w|LpN-x!nkMmfPd3&T_kncbXk{)s_)_h4@M1=^bCQYpU7`>*Z9;SriT7
z9O{PZTAWo}6T&Rv;@YNY2uJOO=0~ITp_(Z6DmGVJezgs;P`n`&cZcCQ98qv%(h(OC
zg?KW<(vcF_ibH}`)k${?G#163MbRaQZvo<ycsgRl(1>$ys}|xM!gy8F<ra_?MZ*FY
zD`j-SHbvtj#SEO7BlpCIaHe-ip0g9D^q4xWst+~Hmy@74xouHHbDS<l;$<u&aZq_v
zW3;+<K`rHzukbumygDRL9y|=*wO2GpBfMT_{CFH{PAcQ#Q?v%T&BpmFH~&AFE0%M{
zdM<dbH4U5#Md`WX$2rQ;{&KE3aET9Wlhga9l8?HjS<HVfzG`qy1ef&<@h1Aie3Sn)
z-_#rWeG{|K{$`t1&S7(IiRKjk)4aw!_A7LUk@INU-<Zc{n!b=6$uaWa$NPe5ZstFY
zq2+0D<RLHbtfRS$|Gd24bo26FJDSz}=jBbfc~>jmwaIvIb$CPYe@^krsZkH^m0+cu
zI~32~li@w);K}r>$+Grjy!;$sWu0IiS18^`lJWioym04mNU!z9=QJnn$Twne{*i`r
zL0-LlLq*4Y<NPhn>HMeD35-VYgy8g&@}FY*%e=o@3PPUUipQlZ$+J}QFrGmH0wj-z
z`kA2otH`9~(B-27FsuOZBJU!_i_d61d9MYp(j|FUDc&oR@m}QchTt!!2tf->Ug%=J
zVk6!=eZ*s$Gnr8^$#ly+%2)og$mC6P86t&q2*0_>_@sXQ<>VsIGR1Qdo^33PXS(KD
zt$2E?$1Kig;&&E)e4dEkB=uYhD)Se#H^XmMk1&&9`s3$w?SkaIa6d6?faQ0g@*fHN
z*AUr>%03nLd3c_x>?N@O1ka<CeH`p;k1V;$@#L6*jMcPrCfhLqxqIBS<Abna0&@4Z
z;}CG|o~8W!;^mltz``5D1mx~z#~~nZvo-CqrrHhx`6bP^0{=uY6zMC5K0<KrslSsP
zW;_MN5RZMR$1YoR+btl5+0T3kh|@fF&Z0UdAhmAV!;S?{0WsQRR}=EeH6U-FbyxzT
z*s<U#VATxUEnt7)w44I61lr!<XDM_{phx+Vt(46Wz;3ahtNP0N$Zw_tj4bDr;>g1-
zcJ{mcM%sRu9bA4R<u^|n_P1HMV0Ah_f+)lAjiw##;2KrO$U^@+RDIC)@g_eUmuJw&
z>Zh~(hl_3{FWngaasE?=j}X%~{D%9KN)IO+2H@h-g{J&)JEEV(&XSOYi(n@xJ6(x4
zP|3%f&B6t-!<76M{{V3};-F!_orMcy8<d@H41b&cz^Cj%kN;$k{YH;IUM3I>`}!<g
zK)cwZziT}DD&-dtWf(v2Q>9srUluN|{j-OEhl+2l^gq_#&r&As$I1J2@hI;H&cemE
zQGzPN$A5e9y!%(U285;^zbsscdy9wvYL#K^%d>Dn?kOsN*%D;og4_pHdS*)dP;sQv
zC;N;n|0&`L6`mzK%Rfv^R{oa!r->=5{BS%l02kJNU*)eAeuP-8;;WM3N6Gu-@hI0j
zXW?SqfvUV*A^k^-5h_0Rfmyh4_adcV%YU5M=E5%)VO9Rvhh^ac-b<A~?SpXv?;D=-
z(crPa;K}bwm0#?~2Ky(97yIJ@hUIgxzf>$$@#Vrkz&};o>?!XbDSw7x)-<U4t?k=Y
z`m}w6r~ciq<kR(Krzd}6N*<j*KTvj^A4j?TM~Jgr_G0;c`LN;EH{>+b4fZIs4+Tww
zuGxb6M_TLC(x975=nlG2(U_uGLMh!@?&yC9D8uoaRvPl)NkyMm?(fr%v~j&EsSkP}
z<vLALejg^4_i+Q~EZQOa*@~X0XbhC`+(bL_>br{mNYS4wifBX{${s|Ml-Wu<s|P9b
zhE%8jYqXz=dz?wpO)<Y|XO9ug$9@vp;drj{zX0?!6w(O&(G5{QL3{{iJ4k)vQ3S_Y
z;ez9^b`y4gk<uqX+vq<YWmfUaH7yeyc}}1|>?f;mnor|HBoQpJ<Oxm`Vjk_2u>Oz~
z!mc1K72-xx#M4_imh)h_^<Ed8g8qc|3hSP6;@qlmzPBHoYWkmT?Z2lS*V2yg-&Nu7
z>|^*v<bymcXOu_cKpvS6;N7k8?(^UcroF_<H^wjX4g5OYEZ6jBc@9oj`0&4tcIfZt
zq_Dq4Izz3Ws}$m|v>W<EmdNl@Z{Ux^o^}lSQM%9S8Q)yRPd+<efcG6`*ZDe-cI20q
z_Y~SothGuE$8tx1&9BSt$#D0>Q`@Nr){jx3X%{;D8g~S7O04rih%4m-?xl1$;zyB{
zd~-;lA6dSk*CyH#?k2^5i=tAGhMw3yQIE(%fo4+RQR2w_MLdgX2ft3w5b~iBgXk_f
zTsY_KA4jKC>thh`s0UPO5v*4AvPPZLfOJv5VARoHU-_9H)@L1$tgi)5eTBF1A+f2X
zaA&*YgAy}IG3=$BzFO-&+IN|?md|&&8h0a;WH=;VhC4%rL*<t4^OgGo<$k8ZLuQ45
zYp-z&So`?>hgti*FuW5_&>x_$lOBP8KF}i(jx<AvX`~R6`)d3HaDO@}GKuFmVfZC>
zl0x{9AM|MOlcMl){gOY&S`X|$7VCv*{~F$vNRPw(3@MZwf=n3Zh!RpLt&S8gU$>Kn
zgm{|tBz$Ti9gK7ZL5CpUNOMttNrwv2N{YgN59ujLhg!?m$Mtz*)TAPBhf_CX_c0_6
z5S7!Fk*4PP^7!MZyhp=((`2v5uB%H28*o{n2H@eti>oe=$^&(IS@%JUQc#HbSL=F~
z2+q~R?QEC`#&tur@^0%sU0OCy%>v`D`L6&iNoosQa3f=%6FJt(C`dCJxA7quPS3|;
z&2YG`VIeMj^j=)uyV{FzLtsrUmp4N{v07dj63)l;bnSwr5iHNNkb4b2W--q8zjCZK
z)!ZlELQX~ZIhjfHRBUHupHYmwJBZN9WZ-?>(Q4jn(AQFF$Pms)mSGhvSKxWW_kKcW
z0Z)Cmr~DgY_NDZNeYwZiJo9zj;%HM7zG8Ue?lqT_XaM)wM^I$0ipCn${nS9)*9{I~
z9Ac{K9ZEn|U4$!R_ZNnTry42U|5{<3zO8P{u5Q3J?FX_nxxiGe6O*e(9SB~}2Jrww
z8>Qs{LWM`G#M_O-0R(nhlmiH4$cc-=_FV$3wnE;HEDK6_w7s%C(io399=%*e9d_ps
z*MRS{z$Izf_8W(hp8fJB(f0miGIYE@Rzs4>eP8b0Ya>zG<Id;aYr9*|2M{nxk$2YG
zdoE(ek;Ye6p)+PD+~c-ob<1+(BJ^mu9niW>)h;b?bQhg3F)%1%Z(<{R2L}fmlaYA^
zhbD$(P4Z}0TFSlx;Zej*^(2F|Zn%~=UYOTddpA&6w^mz&l-}yMr?oE_t*=p5y?`F5
zl-0U3{2=;Fy9-oMeK{h#*SckZ9Z&+%CtuNAi%<8sm|Py~A2EArol3cbBy!Qd?mF!`
zYA@qpL5!T=)P&pLrksB;fvpO<u$i~fVuT#U<}Vya%}Q&zRaHaySk%f2dut3%y>4p2
zbuRTaxGcI+b@&+WsAUWLzL9vJHz#|p8cx=QSl73zi(x%&1R7CX{`n=Z0q)ViS}}&z
zRi%C3?9*#mI^b(9-Myl`;IsGo5cX6tR|%9?>qWw2ytQrLz3do!SZ6K9;cdpwOPjYr
zl{Y=~>?Znp@ut&%VzkjK*1kps212-Z1o@)b_uNd<822?r?(9RVdR$Dhuhe)#hkJ%T
z=vQW5ox(S9`Bo}#x(pkui*WNt#2U}x`i^}UkR-z}>s7Zepsvw3w8MLD;=T1BJ+6Gt
zkA%b6W*UpcV|cf2nksMK&W{x1y%w(^xI~sNyd}Z9tiZlXz&_*OKF;4ho!>rKA1CCi
zPD34-kGYmUnrAT2glQbxti?ReWtdaa22)AWEXSl4pHq~*P*F`V#Usss0nFqpfh*_h
zwBg(u&E4Qj11+Hi<|Q!E?>zh{5AisU_8R8JOuTt;lk1;AX*Ax;;4|^w0p2U{Ctg4N
zG~UUWUn3r-x}+I|2hQ_pqth`Md?wx#m=DVX6Y=`vr}5<6AM9E$`M~46sWw_Zrp3g2
z2Y8imBOcu~-nE$DGt;{oc;AG-HX83L@R@jpn5WAJ6Y(Irjn^NEH}QD>J*VQd(Rcyy
znRqq8qaX1&1*zp5;3)_5fQL^mw$XS;fX~E>0}oS=5)Y!=ctZee%D1`~`FP%giFXt5
zs8h<v;;QBQ0rX|!Z3W)V@YhDmcL(@Pyj8%%RI$Y4e6hychG!FR9z5>SV4xcB_joq(
zo&#P5+$i7C_-VXHz+~dFaIS{GHX4uT*O_?Pn13w+6Y=DC2vDZ~ef%@=Rs(M>+_lko
z{{WwfHwSo?U?Lu-f^GR&)=a!g6znp%X`}Jl;9%n21H2I2h=-|U8?PMCCf;h`{T*)F
zXuL^qF!7!Sp4K0#ij5aU026N|Dr36_1J!tZF!9nuPW=V6jn@n?6E6fkJ(2|P3NV>?
zg}}=PAJcmhemZ|oLU}Xs-U1%=p^cXBc<`BcH6f?I4FR*pTZ?&r6OVyrYA{fZcOUpn
zyg2aiC*>Oos_{~xe-m#W0^t*eZ8TmGd?wzikW=5-erUW$0A}K?MxZG+nj_zXU^4OU
z1Rmp}{)XYF@y_tbw*!HamA_(-d~1QH+n3V}yj%OZ<tsryku1GDf6bKdY2YF2q<kX`
zyoH|pZ3SKx{I${gtM=sYb0MevjRLby@83M_)ehi&PlJJKyf;1V)lT4*z@PeK`>XK=
zAiS9$E72KT0e@{Y-Vxw4(_46wQ=UhIS>v4oFcU8m9UeZF*+%0H0h5VW13aA{V+_1G
zU^4M4ftO6aO7NL@%Yc^;9Hv)(_XK7BJnPBdt-wo`zneVyyB2sle~W>m(|g(xZuxk=
z%q;k8qtkl|+)eo&Ht-m~#+wH{572=@8;`cW3o;$^6(4yo(CI)v(=_%H?`)M0J%D+_
z(94+!*IT^HjCdC)KJuOoCHO#7RJ>ae??td{qtjasKBia4`vKzB{pCbB_ZDxv5${69
zN8aC~-8SRRNBhNctc{NM8St6$<_>nsRVkQtyca{s#M5Q73V0XNK^Z>s*M<5(is~uN
z6BvvTLmU148}OO=I|1?P^1}8_$6E(|nRx4gm#e`PAFYc#<)svOT7Od&AMyW#cuBQ<
z?*NZ>ZM1xkc;Y2rvT^K#o_LoT`kMw&osRJcZ>D26?5w}q=y=D%-PFq};Dx}%@;n_s
zjdw4EHqWrg)ENpM8pcJll6;`~(uVd9d_PprB=qC&O4Y8>jpqJd@D`x{lix47aNY#?
z)@$M6rXS~n&rApJPuLBAren6^qu#fHPh-I<R-rtXsIq&S;-e_oWV6UQ!D9bsSd1R0
z4ruDb85Xxg1{&*~D-YvwrqD6H?pbS2y>8Eo;A<KEt9+2oHilWbGO;1?{I-84KL6xJ
z-?PPqk9C$l7R;FZX2#?Vi9fG+t@*DVV*8UwVcVWBGTMHFhs2I;@BQir>(lQ1<gZ=t
zrzGa&rq^zG0YHgO!!|xf+{7ihnVsLUu(?S#u`RJ-+xv+Zf&Wx-;Vqq|w*ddu#D<K?
z+Y+xJhBrH=A;5JEFl<BDXa3IXSkkZ+FdN`GfhTUE&y%Opt&4aa7k-i09e&}He-*!y
zas5e<DC7R8iZ^8}e+OfLj$<9K6vyisc(rw<wr$+g-1Y0bp)San+WAmE_LxfkUBx>x
zuICxs8TW52-oy>a8Ov{lwX=P^X8EXX<6-1lC%L*b7Z)dXwofp){N%dP%{5hWl^9$>
za@DxGhDfeS2A9M-)6MlCH2IzF<p!6;%5ih?;PcM*X$DscWBeG-8TZ@LKOniL8(cER
z=iFQ!l538^C9&>xb44ZBT!Tx>)#~OtOLARgaLE`ia&sLkxxQ|2NvuLQ*S}DEJKJjv
zE-BZMZm!=;uFJe!@4?y7#D7VyI)h8fg}t{X*L9LBW^l<E?{srrEV-5#TvGZaZmuzs
z>q>)5##rg*%8*>w8eB5QQ{7zK(LZ!nTrbNq3aX5*znf*FWNFtd5`{Zc3>|P1rn6$D
zW=Um%>2kBQN|sfcMMiX&o8?l;a+_w6iMra&GG4NLPqRprxo(z$lI2d#B2mV;S$3i!
z?yOj?StLr9n`N71xlgmm6#Wx!MxuWqS$?5eq+XtLvvf$72Q`a~=qGNLMUv$)%_325
zaI=(2md7=VOi{I)Ww2y<QnSd2O57}a(Rg)MJgr$|M8~^XUY9HzHH(bsGq@Rv{*`2T
zPP0gqm)$J4NtPE}EDyU`nk37gG>a7X7B@?!WO+riNLlLLEL=X`S@F7NktjSu%Mh0*
z1b0@vty!eFd2W_>(LHolyrWrUME%?>PfM2fHH$=f8*WBKYb48unnlX;TQ|$Kl4XZx
zkrCZ#vcw~u6+5-JM7YM~UD8>xOM4@9Y`zu$oZQs-(8TV<i|pBCUlXf9$9COQ>|4>j
zt(f}h-o5PpR(7CQoD^Q)_E~<$s`bBuugECfhCVdi*M-gg>9wCS1p8F<W7*pu+s!^s
z@7^}IxTDm_aV46||Bt<Ifp4q0(!a7rq7V^@AV7ctQB<%S7wq7GO<XDmM{<JkBLq7H
zNCHWKq=CF75@-@al~CWksHH94($|*m(rx<M(r!0}KJ7r`K-m%=%cHO@^hs89H$eU&
z0UH0mZ|<3^D_Qa*z(U#FpRUf_J7><!oH_G4Gjp!eVPdGMbbFki9EF>DCF)wJA9+9S
zD%>37oQZo1Zq92yg!_El3EUjFw&Uh_=@Q&m;9iXTYTO^eeJ$>lxNpLp#%<!ZaDNu}
z=Wu@+_dntOI_~e_{#V@phMNV@hx-?}`*A;p8zrmsni$Ti`PAE)-Ww1{VVXaQcg52E
z4ZL@!{l|DNO#dTzXZ($xORhxHwf_DT4u}iRAeIMwa`KUxEPWNTRq4hqhXy?+FBlKc
zVNq7}#WD6+{Q$^k&UX%nFmt5Ha}u`@qCfbdz-{uL{O9`<L6>^12%fqB);L2MUM$!Q
zG9vSf42ae2p%#GV&%X{x^H;1|a_!>jOAD5!M{2ckxvaPk8BwCOeOgoN{P}HIVw$}A
zTC6D9v99LA-)JeEvjkf(7cNHF5nmq#CfMs-YsaGvA%Er4PD0)&0(IH*8F>J}_(fgV
za-N45!?Th-<(t!qosH*lxMT9Z9`SNc&FK=;LwXe1ui|FB5D|6pTLHb|CeZQz9&R^Y
z6vTUpAeY9&QG&d=?H`y3*F_q<*jCZaITA18eZ_XFfBNx0O`v*-zcl8$?n~2STS~Xi
z$0p!4yAXByuEjeyUsixG<OBIa(!}F)8n>ner?CT`D*zb>ad@+yEm^+WJ++ODz&>N0
zZFG2e`;7ZUVWa1^i&X50R4&YIM`WMz1>$Rq#4vP1<BXo<aUU9hzT&2du%_2Bkn(q_
z-Y|W?Kl`Edi~glG@)%UM8f!rSwhK=MC~B>+KXx)VfNqbS>b6=~!k)<6YEQ6;IYHz%
zXa1)`>;b|G-eP575a#VFQXho59hiWDAKt@SAg#O65S|$Ha?H2bCX)2HA(y`bb3Sil
zd`0c|<Xi4xX{#%jzI^jnBegNj@I~$AK!!F{!hlni8iF~0Ry<<0MIlcE$$Q`Ef=ms}
zzUPhf{lWIsAN7z+C(TJ;QTprsnKc#Z7k!}N6FKw^q=H&RgVvf#*ho6wN<^%7JHGF|
z(Y@3&F#B#s*OvNIp1mk1PR)-&^}(O+Wpo`*1TNE?PH5=Aa`o+!n>iOW?qPEP6JIwI
zOPfWdTU{mjcd_5P(3iQ<V>Q)dFnh~4f$iyS*cXWR-;BBKz{x+u--iR!c4xdC@)<}P
zq%qhru+piOn|lMBZiSb1vCo`VW6i9ijm(CZpj~=-{Va%sg&(cbdGAj5dNKU<mHVR&
zI|7Lv@OX8nXGezLki{r=hvkoE{NGDI_XhCT5-c@3%_kJk&6hD`4kDposo7a?A<>|i
z9b+}sSS#xq4g?Yh%p2-5-rIE90@Z2?rgwPErr_qLP-<d78&P%H+O_O|=$d1{Ey*8L
zM(}5?XX*{jfm=8N2BU^&kPi%M6mbcXLAM~JxecVurbeqN1|DJtvc3&w>U=hHzE9@(
zqn<|;Ys{T_oXPmVpU;-r(V(J^uwhI)G;3Biv+=N5)7faPj0tOE8Slpqnl*|+CHaH;
z7q7J1sxuv)h6k@->3N{xkwE;xn_r{s{M?qE{Tc61NyL$z>mxbVq$XHx!Sn+jvn{x}
zEtI;@j7NYs06TsI*NchO`@z8iv`J<>YHp}z)E5RR4jUq7=;Kyb)bxLBAYQ5Ss-jVU
zL!@7~sCGMYn%#uh?T6KR?;DV2W&IF#>zE0)Bkif@GVu!C(g8K+jOLs*IcKAG>VzqK
zhsEsejix;;+Wyu)kX{=$0=M^#ztC^C1UI*YQZT1SJAaA~%mOd+qeysIyM;BvmT>K(
zn;!_=zRm0i_QyDUH(;rcN7?#gO2^$F<N7q_^%b_sz6j0z_Q#rS%ou?w7D>g%po{-@
z2PIaVQ4xF=VqNdEIxDp)(R)bXXZ&mEu3lZ&_q#Il2{RP6pc_`1Kp;OW)fpHSnbI%v
z`FK2&SQ6bOENEIybq$I7)hG2mR|ft&p@9KkRV#Ud-0F<g_BM1kuRfmfxMBewiT(mO
zzz?BAZt|i(PI#>*znSo75*6vb3bu6x#H~d2)TYYSXQ4~b#cr;NSc#lyAc-{anTT3V
zm1d$^8~&`_+n=apuG2SE8p(5Od!614x&?%p5wZL?Tip@JxO$ALM~XZj6O}PDQHhvW
zJ!U29r#980ZSk)@-AYgn-I+(+K{HVU?wE;s&GP<)8rh|9s58t1=EKSNS@UbGwwl^U
zB@O0otL`&q-KWg$)69;#soiy}{$j<OrzT>EAx`nm#Q+O-Tq1}!T8Wq$Z$=DCf<OTY
z>W{@#4sVJX$<xe!Cyy#ajVeQp$Pls;!>g%Hu~mO0wavYxpLA@~F%K||=Y9^mpV1{d
zAFt4L&PgE?;F8Du0SN>#<qrhoURBaC)tU(PC%Eompvq_3Ro~pHq!4`(WFj7+Oho$Q
z5#sd6RU^Uom3&{>A6F&XAFrmj6|Vv3`{Qb+L8Lk&)%C{}^ZVnR6#=QyOf>e#8~H$_
z7?EQA@fct9$5k!Unc^#6uKeT=08^}6_V7~G35ai-*KGHiaj%u|S#3TO7KGzIE8(}=
z{ARn~j6;-yXp_x$jJJa@MryT%%yyJ#2)T#2``Pr-5-crYQ<QSnkd-N76iv>WApOzR
z;hj@dd0{YWYKxfd5w!ZKAQ-Wk?NK!C5N4~b(rm9Z(ZDCF(Y=`M)n>dJ!VIA_+iT2t
zjg_dg+Um^qIx}7efw$V~&GvdTUT-BDt+qz9z0sCHt1V`>Lk?qBqS<O|Hrtyalg@B^
zDEr%(&!92f*b?*%8cpf(m+kK@>90n2GCm7zz1SDnszzr$pJI{ag<|=Qsz1PFFNqVW
z*XEh`(=VNKei5}X8<F`K<3V0%0M-1{3rISgYesO#aBsxzOm>SP+zs!UxV<3arZZG9
z`nfO9yId)!nl~hPsPD=s-JI6RiLJm0!l+6PxDmIbvzyNE$|%czYLCJK`r)F!z`;@W
zz;bp1qwwmXKd!-eW&DhdvZO{lmI<$+@R;7G6jpINfD!oZ6MxRg^V4O26NhnWTY=O)
zJ2=`FoU(Xk@55-OaNxR{f0|Dk&&980f;YvDr}(v$rqPrR^ftkviol^YUwNy&!FP*4
z?W8#VI<DVoPTBjwxMss^VlmwR%*XX%_`$1}e}#FVtv{Dtz&gRDzIqVu$LzF5;B}ec
zmEtjRHVTgFJ#@UVb$5+KNgRIrgV%EYxp2xB*>P3kHNSVoOW7OLIKr3m>&u)Buw1#u
z$7=`w3UJGQoTI621@fCJg?QytXbsb53gxYZ(^y<b@=w#e(56NIYliXf5&zTO;aNrS
z9KpRs{7dnYNu-+VEZjp~)RF%;iQ=OE&LcZM)C>I4Hr{S5e9(`)8tgw-qbgXgFmtc|
z7Hr$)Qp^0F;(o;QsRhsPFL+iZ<h&cbExR+EuyhQzZ70e~!73kAKC1O_XbiSx$5pc2
zRi3xgj`3Y?%%`y6qFizfg!{Yo#r|<U=SR3U;-)RSAIUS{(f>18578HGzb%vpw#gIA
z#v1%ixW0%##r+I?ztlhC(Emb_NBunD5;6MU%s*T<{c*<iT$q!KUdy0=<;A}2$g*>d
zRqpiRT~_?<@Z*gxcY5IeO-T<+mbU3WRFJ+gl0Mcw+NOg!6X#<7&xG!q7yF5cFqZOl
ziSKIle3bDURwlWaUhccs7oWLzh!;ziw&(s+o+*j6B{yC2%VZo`Hpkc~{9zw35k^+p
z3i30zfS>0TJhw=A_6rkXlqD+V+pFR`(ct&xd3_Q$ZOKiR{4lLYmR)MpOIt)7zMEDM
z|D)n>^XnAjpQJq4#?#i^BnHH_9QQ;RaamA6Z-elMZ8>evB?{;ZdlU`E-z@k$6um0r
zaCv6CJ+W+(@fU?@x6KpFK4^R~@A(YldqUqX|1*tGyVC!@vdP8?T+qN3#eHO1&h{MN
zF@Ez1y6lV3y9??|y(_`=59F0+qw(xSJFH#4A2QC#dp^&xEob|G*f<9JPI=kSG2`!)
zUPC`O89&Q=o@QK}_k6zb)jaym#!GqhrW<=Czc&52!F|ZN_!7oTdGuP0w!H8&jC=B)
zXBr<@ouW?P1;&BA=T_ssyypvzlk@1e8Q+)sWv8dz_-Nj9hw(z*bEh#cFTJyj&3Wm$
z$e5FtzuCqg^6)P<`ttm{jAeQJ>b3<547nCJZE@DJP;uGM<Bc&QKejv_VLV$<pO~D(
zPqo`Ct|>D(pU(vJqPyW9YuYrL14x^C3k6bah{yJ4+)1`Pjyuub)6C}vyr)6v^XXq@
z+X|yUQfy56fY_)*<-3}A)nc;>^e*P}8Ccq4I3!{TpKA*IClB@~TbLe1p={pi^dTwg
z8CfvOuz<>TS?8CK@4ZMYNGjW3I{)xe?=^o;!1K5d<-*UV|A%olk1z(>s8{1oMt>rZ
z-;AS;G991F7x4d8@c#-pE`l|F;sZ`7!0#X)@Ye|B8b9g%M4+b2{EnM$^OZL0uB3m$
zE`P$c@|+gv=1W<#*aib%H2>;|hj{e!Vm@Dx%f}2pUnsWO06#9z-xc@=LM&*%Mu_-*
z%opG$fqxQs0c4HuFBSL^folZz5Vqyw1uIl}=zMRG=TA#~|19wPgy6&Zj0bX~%kMb6
zA9sqq*N4!}2QTFDH270KczIA*Y=%8}&+6})ZPyFW`|R|1y6nB;9tbnXEgn>k2w_yh
zoh9MWiBg_C7zQbN;J2dJV&l7QqAda*hBwNFUD+7eAm{T~v5AJjZ}1s?Nd)<#?X(s`
zv^6UTLG*UQBM^=dnSPEifcU^iDxB*H(Y7rhMB#2C1QWIpf~gM?9&Ot#FFOYDl;inW
z*is`5V_ZWBCf-VjO8;#_Rtnorh&qVAe9e4*VpN^*rG1!1%Q{ACp{X7k7X)6txNgaH
zu*5auaJA<QQq{mTjoRlj<aQM&zO!hxh!&x)ShDQOCCT|Po-iL)xmGV(w0IRvFDUCL
zqofG)52OfI3_%ckX=pO+tW~g-gbg$KM#J(Bjt^l`0A`&AWnWvQ8X*mb5og0t1Wsl%
zuOqU_mJ7I675H!#feNf2C_6_(Zzx)Q!|LSXYi-Vq!Yq=Lu!9M64&?x*!G=v<E|%ep
z2|1V!?cqY4t&DUn9@Yqw;ElpW5e<P2l9*ALCvx&~FkzhhkIXL7wTrJsH5zQ5h|)O%
zyDY^ThUvAdM`o9$WME~iK+_mvJDkI)DJ#}2U$toZlIgZ-k5L6(QV?`h=6*(5i>EAv
zm6=u8w`Vs@rOZ4O)Z!7F2`Xtg!eJC`O<lbNHJ--xmMyyyAN!f!5x>6eqMG?r@JS$A
z>49^Jw#=h9B#yFm9I?3|n7>@Ke7+d#8*!)t_T-s(q4|uWMuv1&hUbwMrqMRhQ$&)C
z5mcO9flOI_!*vVi^OH!hDY|IM^66JjudQ3LYVq|;mZw(RW=8Xj5*?(WqN`RdUTkm^
z=kkRH7Ge|}dB;%1YD>oj3ys44rlYJ4wS)6+4Dq4yk(XfI>NQuaP?9{_GOW9H`Sptr
zD&#o}m#?_ts%vTH3N>g*gE7*h*p`(>hHKk)0<L25DD3tW>xxFUf!7hyv#(ro-4&~D
z7-gulu35Zxv_bGuuu%qSSbfd%H7k}cLBloLqNaUMwt-GVxEi*FoMsTzhTr4tut;^f
z7>ABB^=B_$e%0thopbf_<s9^mHZpstJjzg0RxP>un$bp8w`}oMqYZP`@`a-fa`x(v
zELpK;g!|ERWo3)ZXoH<~#flYgi|w&d3EJc(*Nw6O>rporue$DvWupvt4s2m1uS{Jv
z%3x=~-sLERG^AGGLxBr1EgfaRdX^-ovka%lt8}bdj%n%auF}UF9AP;4kb0ag6h_`T
zO<8j7l_~Tw9H>Z7Flrh)a`emShX;>&hU|Wv%sW(IC$1=!QTFE!J===e{Mte0%8FSl
z8)U5PEy#{d;w_7QR8_RL_KHPIQ>&Bsg5|PBEZI@?BegYGEn9xYK?QAKML3u^r(CsU
z?c&iUbP7I8dfmcN=Wg}FC75I2<DR1p3PY)*4bpJs^5x5}ShnJtE09dvOy~$21dNx~
z;;ho*weyED`Zw9FI6*xuoOZk!5!B}T4%!0W=b+1k>d?7%LqYGOQdcghE!9=;h29h{
zs6y3MCr|@;tBW>I+;}m(rA}5~)W7ml-|7L3@d4M}&|%VVA#SFJ^r)j<g9zR97U11R
z-1^e=Rs#>}SchIO=vCsG^q|Id=v@xCo8EJH=Gu(DG(D(@^XR<*dL4L2dQby9^gfCJ
zZhAa_T#Vit;JMRR4_$3U=<&VI?;oKfcGK%ELGO9sx#`Vu(c_YrrpNs;ZhEv2csl&`
zrSp3y-n;3o1wHyPzffa4^yqNYqyD;969d%r-asL`>Ggmf)Ygg~lJ3x}LSo(Yn2w8z
z(0f1d-1P1QJ<12u$0b6Y->(+%kHU0y5qe)P;NKQk`nVRM>3tcAbEj_w=wTVbxpaO%
z4<vW`dR_d38sDMEL+@^ScZ1%k4z(Qr9xI@?(?t)<01mwyA&hQ%&w-xW|0Oha`mP6_
zJAKcAUJY;-;^tb6&hNAWdaOKZk5~b{^9tw%QOPwukap;uR8W5-c<vQi1Uh}k7u4Sv
z=;`{)H8q{S6_Ag-{36^Zi_lwEAkWu;UOn)bUn~nc^d17g-1Jr;U&Z8k2k_kdyA$-Z
zJfGsC_hs<QP48~dW4!v(`Tacb-1P1NJ^C?yr{dQ6eLvi8db>eyIo|0@(_<Rk^me%D
zk%p$X7D#S-3s8x;mqK5fUJ`h2dQXAgS|Blfr{mW2&MTlt`*AxoF+ff4+yZ(XC{&%_
zDi=L(0li+-d$q?-Xli;)9DYVj-Y)>X8n~IhNw{_T{tUM}zqF^u_CjBp-e>W`jaO3w
z?_1!P8?OU+<cGdAy{`k$oxa<UJ}ob20$Hc;Baj1kdc0_SxF*Sb%oaT2a-C1bD`mA2
z@fMR)?iFObhTv^+#XDK(A!){b#6x;~$Lo8b_d(mK{^`d%g~$m(R$b2lkLl5ucCUoP
zo!?%>%XpX%wwJ`?^90C;n;!R9MDbo<n%?2SbJN=adaOsJcMfh%?|X2Nu1=p1Yps0N
zm!>x#?Y%o*;<<)7PM$6Wo;zLx;~`yc=Ypt?cdYPFSDgyb({V9w?S33<yNp-kMM~hE
zS%4QUfp?4WPt&U`fj0r~-SJkJ!21}4&5cJpcslLwd~7Yit1E$bVF6x!3B1o2<hQW|
z-Y&d%r!Q6l@5KVX@Efef@^Lcc%}uYR1m3QKe6*Ipi{rhUUPlSMy9@AUm%zITje(oq
zoDz6@3-B&0f%oGAyagrjjxEUVq7r!Dl<}IDziUe1tuDY@Rs!$20=yL^@VW}hEm;C@
zJ>I+dx3&acM}fSoD}ncHLA)DF;N4q5Z&L}pMFn!-QvxrB_Ql<<-C6>#2K~oK@cthv
z!$|PnU(il6Ufrj;+k;aI+Q~55N#e16z7#j>9^?BLj8|A5x_$l<=<!)!+I<BAxa~E5
z8F=nX<24fx9yQ`gysx+r>Bl<_zUVOYZbW+Bm-d^4MAEJ0nRp!Q>5KW`bvp3e{X!-3
zy94i;-z#wI{C)*^nigIgL6qa2!h`n-9{F@;!`Tt{HLOjG`nt)rD#-9QEjCu!DX{10
zmB#5jq~yAICacI9Ssaj+BX4rHRR<aM87>`Apz91@!I?xFglIUBOyFenQbSt?@O5h!
zPU*Fn@fIu5YQ|fMQ|9vF$vvK^zCLHOfF=d@%$tuh!Feetncs|s(lSgRj;NQ&x}sA$
z|N4k^Chic>=XNu;9SagDoqwLmw8k(Ou)HwPK{Eg_ribUQZaIpXXOqD(t3@k;xl5<-
z1-^3IAc4&V5*vZdh2rvH`Dkb&6@;0Ij)6`;Qdb}ub{cg2=@$!*X!-)d=|P^{_tD&k
zIz<Wg40HxT)@A;|#h*d~*7ORVpgq!BA2!#~YzPSA)Tm7?qz);A;4BD&BB%;KpE*b(
z=@*rEixNN387|0G34EAd==8(-Lc_Mz-m0BhpXI?>@PUqsg3xw+#m_uiIE303Y}k=J
z0w*{9fE9tQM)ovo4B66Ancg>$3~8LyALMm3d)PfNI56NyREhLW_gO9esV%|e_)MqA
z?C=M+dXPvvi?AHPqw=}(D$Wl({9*2pQFqAU!sp3LWGHzV96!#H@{m6A(9q&bPN?r3
zNR69ewy10b16v=oAT_?uj)7U#g>;AF2Wj~;odb#=O#|5plxg460m$<pI(F`I<>#(X
zfvpfjq^=`8wWA_=L}r!8ToLX$Jg~Jdi^M(PB(6>+Zr?nI*+a{pyMEOa=BqG0=@;{x
z&y=r7`=bmO#C`p7OxO*as^;Xya72d>rQ0KQrdnu@%_O{;HZ~uf9r{=}&TOM5CuqYb
z9_Ha~)SMFSZBd&uu&DvFGn#IPbKE=-On`2jbQ7c-59hVyEMK9Q-#(y7+-JZ+8Hcj{
znUw^2XSiW9fM>M_o!@pE>t@$^Z=4>7B+gU^$fv0T<TKR)@@eV-`Al_ye408yJ~PAv
z<kLb{B5chJo9$t9TG&cdSTie394VhxG5m3CT^{O8HZ8JvV1waBT~U><DlarAIJ6xS
zqaZM*(d9F7tUb;Kd0qiJ%hyFOT#TObhjkS{joTpU$jP({jcAA0Pbz+e?~_-WzOP>;
z5JofDJi(F%0dNW%;Df`j?bRu;!{<F~dC0F2>w}vI0-v}EsbUFU=&RkEZGfGJsy++m
zXsTXqcsOw3e$=?`j#-}9VCp%f<Qk@{U}+|V%18F!;P)J8*lzZ(Z&oI3P#V9oW}wAh
z^&<rEvaj}|qpk!t8|xDg(%Vxu&D{5M4zWOhF=c;(h`n^>iLsQX=BH}YRTh!I5@+Of
z55Tx4pkv6iz@7|RM5C}vaA?zE^DCczvHF-^A2c?sB&*hwRWWUr1N>Sabg^qz2Y3<A
znJmHsxi#JASsV7e<~cAm6$FL#RjdZ>72ws+0$a<h07o9(=92@RY!jISUm|Y4mVKml
zZvk6InqHO^nh=f$%wwz>UTfAK(|-(XrZLmj1nY)98UJ~V)oEDzo6l>ZCm=0TqYEw4
zT&ebu{k6Njw~du$+I*SMU}kKX$7DVeA?!lSs^ZI!C*A>1w6?Tao$ILi4ws!jEzRn=
z_;@7UTXYCc`54?^vN!TsGxm6Pln7==ZpU9jzA|wqLZ>OrjaxMV#$RkaBMHdV`SQ{*
zh!VpWlRtC@Xnw3|UJGVBW_nGS@F=rZ?6JmLYxiWllTpwfR99F3V_ojEn$K#X#I~N>
zVz!>uVm6=Kf>*70ZpCveo?8bMvMc`l{v*XkB4<NnyT`D`SS^Tqg4H@9xcPzP`xjeB
zQ%g7%7H|WbXQGa$AMmPCr_7Xgoq=~48w9Ob3+%Kw9SmP>dLXd*6$A#&*q*)3V-5=j
zHvJyYp53Z@!f@7X6iZMqdaX3MO%MH&U72<(64tsg;mrf7<8~2M*HuComGQ$;+;Z4D
znVJZuj<Cie+(1W^b#AWxGC3ZN#-`pIg4sIQ+!6mxy=zYkZ0&{VGT7kp?e*U5Ngg9K
zzAZSgK$qH*JzCyY>X4wEIzc5W;~!%+kAX$9F)Hn197%bl*Nq7pkkY{I#?T#MDfvQO
zXK`4~6JP@;u<1+4c6!}}ppj}q@wA|Lj?~7OZ2mNl3F{Gkkpy~*B`|CxTU0tzO)Q~E
z@?6y?Z0b$bj+&;P(cH)U6s@nEZCvahG@u?b|FJ!g7Zom#ezE$f_*DYGX#Gp+#!Tgv
zMLBy+aPy<dK>9&1yF0LV*E8U{HG|v^=W$zcEwH(d-s>TLsmQ%-7kB+5{@lU|H!Le*
z-h^^Q`PegzBRIo2TBAv!DS4e~wTGv+SJ-oy?r;y$D5C+X8thFV)*l#vnV$)oXor7l
zM=*7Vp6jUGWN*8NT99m6ZEvQ<o8I6x0@HUWpYg3@g5arb;7S$u;Qpvc`JpAExkblX
zVs0+%YF}b`eMl<TxX>U~6zPGnIF3xCP<J@P>W%B75hJka%kWhR^z24l8NBS!S^#Mt
zoaZ3&K4VWNGy$dLLuCjfH#LZ%k}-e{sL_ZA6}uV(lsY6E)T+B-d@j^Es{_$jcVIMJ
zJ<y@1^hk}96h{zHr^mx1ua|RbaeeCW9Lp338Lx8{m;bk&f4@coM$5m_yi0<2>!Nj;
z)@Y;?f7P9{y1L!03t~{ig3PfFMovF8aMQrRO-F;d(ew_^LZaxzuIl#~8?&dv^&w-U
zVXT|z@`m5QP1&(mnI696=tc^5eDeg(cROY&_9Ct!nEwv(`yG&1jyv<2&c0RppuaVF
z-Et7}I->f{rlY$=jV~&;5KRc+L9_Dzj{H@;m*npqsK0}y@1TXw>1|5Qr{4Dd<{jXl
zQmN*3I*0f-n(+>`JnxzQ;~kK{=pp{Ssqr@ThKJ<u;O8r9$>vb|chK`awZwFYe+SJ!
zwYvAV@UN(TX1%XJp_I)~iE^4V)|x$*`k7;L`WZDn<hKk4vRB(`n&TWb4Ff5!^t!Ro
znkB5}v04G+ED_gc16pljZl`8t5~Ac<MlEzMO2-fw-yBfJj$uQ*KwEMTHeVZd<c}7N
z$BOHxv}%|U9fny)kH=AJ6@(Xl<m+qQi+zeEo_!eQWw0LMY;n+<lH5iSwcdL;)_Xa4
z?`e)=UBdYgOEB;=yuhbfxWz#$TlAMjrnW|ln^AV@d-Bug)~7jYWNODAfJ)6#9PiqN
zyxRKWu&Iqqa~vlswTJ0Fop#*SQdSG>S~v6sGB@HiGz#HtNH!i+T5)dzI-YRDj`hp9
z^yC2ztJ$N=7*?4**&vi`ZvEQSelc5q?(|Ud?4Gf<$|3HJ(QfvPJ=BL_m&4S~VDj_R
z%uavyAMT+5W>2f_%}!)c>eRUM(8Bf9khu*zOkh!e`nK(3jRNh3QrL;esO)Sg2U1RN
z1VVC^<mX#n-hP(%QT!CohzlEObfqtUz0qCXwi;rv{!|sV(w|OoDrP}pXHU?YP#fwB
zsb=I{?8qrjLoCyi^U<C11u84noZ5kNrw5Z=SdyMPvjR%;C%GR)=~9nVA*oM2T#85Z
zsa1pZsew&Nv?`*z-Iap-=PZ0`QnAn;nBMPJRk;g$P!YTMmtSAr^74Jt^*O(Mu|DN4
zV!KMu#>&v6STzt8xl~|$9+9i5O2qq6*WC)|OlS;s&PwAvs13Cnf@53_LCYQxQ|lbx
zM!mrj7gm&ybr(4+W`YG~uZ@UKeH=yONaDHc`)t<pO0*KbhBoi|MpSsUq~cWb)c2j%
zWK8y(w#4PcEz*PyIEZQ2i70;666`vfE(*e~@o;HTCC>f>0|Tl?yUIJCpM#lcFSEHD
zN3~+67SoD0j!z>7eoGlE)L5eZ5R!0Hs)b)b$e!r1$l3mcRN;$1n?8;(1vyJSqf?F=
zlX~(;YN=q6YH8PBl*3gE3(1qsSIh(Wl#sdBZ@y~&28-L-h!dISH`6fCskU%^4|JML
zwA%ZUW0A;)zIETBZ|$SmF}07<r6PdVay*&~S!XHeSrs4kUrBzBZhWv{nDIf(YQ^}#
zZv4jvwoa~nAbXSuN7US|`deTGYadM?7{E7FJdcih(9@5VM&@9s<d44nJQkG;9s4Y2
z9bYXiWoOzMI1wGV<D*!qyzOPY(<m5fA&?tA(9omfr`81BTkWF_`|jn4CD8n!T>^H!
zL`<EIntf2?1^klyA1u#y<8V$v<DhCzspb;BxL&cg+k)fr+5#2UZVrAby|cXs(O0#T
zpAX7@UCO8e>(5`LG>^3xzCKA#T<AvyXx*2S=peRHs!v=Xl7U$fvgLt>eQF>VXztt9
zjS4kXenAM04jQNQpZ}^iUZ@qvb?S35N(^k?I*W;Qni;Y-oPHSFXw-0a%y_I2BRyPa
zED#{Oq(j<61+WXam!*rWPEz{??ahMYxmj=wHw$L(Qac4@agTci!I0b14|}qfu1!Oh
z=es9=r^-f1J6qpT%@qb<YL6B7E+SudFkhb;B0u=%Oa8>+go3hgZ^f}$evHF%hOFId
zPaU4-)IkmO!TE=z=?o(c$)7thG>=uYgzP^#jOH}L=RDc_?78<{U#0wA^(}wAfaS6E
z{(e?rY_+jBoy8SHoJ833qj8c=-D2eAh?%mpbdH)0`2v+{<AvT*?8OYl-k<D{lzeHv
zI1NN@mzyiSHKo>nE49pH7Y8ekTkIV#d-Ukf6;gIh>56cLYUY9&Y=@e`8ci2AP<ov0
z(OhR{AIf1ni^1L|ZDE=6)aGc!+|N<UzJb8>hwb<W4^o^Z$I9W?dyCH3T<hOqCzE#m
z(dc&PH{!YN2Zw_Js`<|@w6h-`)Z*K1L91@*eHnZ!ZYkF1L$X_a77OwI3S`!g%mzzj
zHm~J(avL5xw?ovoqWja(?vHX~8s(|fel&04el&8*wc#z^YS)eqG~{|C8t7sF=7{#6
zImZ~>n^c&dqWf8#{bxmkF(K;G`6;r0dB}4U!-db^f99k?D;b<k&y2sQeg#u2HEqV8
zvof{ktTy96mqL+S)IXRVXQlFsgAgg-_Av&h+T6L9Ugv{a<|wP#$Gv0DPQ2}7JWkSw
z;UC5hni6(0wb=v{dz*dO$rMvvDt0oRqp=WC-Ug|Yv_~d{eRV$dSxIg{lR1i$h?3>c
zF~mE&pJ|x(Rx~O>^fXrM7`0_=P*b9J+f+KcYqSo@(Gg$@h7%?^oq^q!HI4zzFq)uN
zcE;V1n{KqY)g5Sy^>-jOCG}pF2Zo~d34}<#Mk<G4Avmy<X3E6LCp_X+2zy@9#vu~y
z=&3aK2ez(<GNZS<qjMIv^;9Ex9ryIqs69Ou>2=Ytk*aXoT(v{*u)LN+`GG%>n+xsM
zG;Z&J`>>XqvlWVNVmXlJ_6z2<fUqZzu+xr~>@{5VF~9s=`T%S-)LnI8^AuHnV+WU?
z9^EvL^`@Vj$(b^e0)1d*r`G@J641{aqp&QUXWh?(&)8KumOH61ff%dG^dhnwo2I&Q
zrIWs2Q*^%@T&80YM;->tb1aUrfu1jYz!&)8#s0w0AH-B7eIUjO2?`el9AR|UF>o;_
zENT=o4!tC!6|<NMRmhbC9qin6A?KKY8eCAw!bH1}sRTwLk459)DrBPAV<99tuaNTy
z4^hbb^!!ChPG0|*U%syKfIS|P`bh&L@8bH2y>za!bk$FMF0+*d$vTPwogW*<LfEMY
z31Z>3s=}M43a^t*gRY^dMo!_m*6#-uo~Q}`*K26W`dO;{%HNjq^N+FXWUh^!1-5b%
zV>cNt&8e=APGdc&c^!}9vwdAfHy(A%Z%(tDS5<7e`lhr7tZ{as*+WTP+unr*cBs72
zZn?|rU0%Tsl~+M|xqGui^$W_%qT|hXPkZ=Yt6yW@8~v9TeOeUbMSWu5-6Ue?+q-tm
zG3xg4|3G<Rv%=p(d3BW1ced#HWzYz0J}y_kjxgOv#BdA;3I}Xek6|6j9?+FI3RkBQ
z^qdw$z-ssW`(n&~t4WP3QaBA$nwq0Zk3hSEZ6VkbGRdKikesPaLRG59@bDEFobbOA
znA;1IF$?EGuqkFXQj7T+DjK50Tv0^})hn!0gs9fVNWY$%5v)7C=*6(H-Y7gPcbH12
zn-TUz{4G0*=FGucis>?4^=)M3cl6(E`Hi61P{4mfWk-eJq4INAyW-`ClWXtFx>rzs
zBh!z(*XP&R7X7a6?DFedFt5LpJ$LDK9`<s71}cxVW0kTQx@MO~U-em@-7rqE>F<fO
zB8)XTF3I8Z!`we&pU18oz%HF)XSkQi8SZ0ohI{kgR7Lhm_wExXe01~PBsL3%r?yql
z<c-Jd;_=yIZd2!HC#Wumi<|2F>~TVJ6VHw_-s~;+qLDYU$DqUV8L5->enQU<wYg$^
zi@kkGZ&ySfbK0r5tlM(dR_`NkoXgeT<?}z63TQU36b)kj2!lfeY`;7+uobH>o#CmS
z70JW7mFI?VPgxdkd!bk7paGVgW|1?6UG@LUsqq4%6eG%Sa^Blp0`@+dJTZoi0gHAq
zctllgML80~9owoG*;m88R##)$Q4i5j4V*P48SLyzz@PcE_XiJJ-UoHAj9~>Ucv$k7
zVoUwmlkH`!k_-0~BHCX%nDu!`3(Y=^-P?Cq>Z93{M51zgA}I63q5q{^dFM`}pml=}
zjG%F{;*0Ox^N_#zUPRE8&7!=)@!K^fEV(YDD_pL83agtvu0(}_)jDB?X4kdZ_X)d>
zhrTs`X<xH!hF(nKdcAKcHeC;1ulHiT-dALiDSw^YCHrsF>Xkn=PD|2#vaaFgPto;c
zv`3JMCa*aLTQa~O6Puu>2lYOwk?aHDZr^FJ>*TX$!lcL^vvrKmDg(KhAt5&{3{Sn@
zA_>yvmDe|+Cc!>fo4;_sfWNr?8rqu1rkXiw+dx{Gycv^8(}E-n)n(EV<v_&wmd)@M
z7vdl3{sPB9%82$Cl(5Ul{0_Yzp=dOAV(s)6wPyo<#hs9Yb`dzi)%d&E`G)Df%!+-k
zG?yZw%d2odME-t;(kWs1qVo5@Xiujo|1s-TRmEMnL-Jd5NW+ryRWiSa?1vt*AL^<P
zg9jAvO8cQ>t9JJ7E6bKJAzG?^K=%^&PmKqY$HAfv?7&$D`pM*R@-l20S!~QeRkAIK
zrv9ufz#$U*9SnI&<4yWS>#v+7I6TworOBQW=0jEcH&l49D`XM#p+khnriYxp*-_dL
z<;WBhvQB?Pr!RR#!?ZV2zVx;?c!uc+>qso_c61go9jY4jq4+`jp*Sq}hB9IFMz*N=
zP+eYy{V!7^GmceWb7j~pb0tL`CA3SVbo_bzsKM@=f|k|plXU!r{mCKwpzkgFpd4NH
zJzwT&DKHU=^2cyw^!7m=dIcszK~Ir;kJ<+{QES*(Tuh^v7eJL#)z`PbOzd4+{%9t2
zFZKJG&`(*t;KbC!J4^Q1DhsT%(+$19*8`KVn61EK=&#I&*Po5y4+ifTxx)nJx2!Tu
zgJ$JSg@!@d^q4T#=r#A-)<Q4#W$$<Iz_)9&9#7}n?<_Xnr20cO_sVkG5z0QO-7n;u
z2er#HpI))?BTujeK5-k_gJ}p3w|JGsvh2nA>L#0C&<{*%j4G3=8NbabSX2Y2U||eA
z3#)-3)=IEeZ1XA}&V+vCX^dLl=+x=K^=Db}u+>Iup?BLOn8{tR723gOk-b_d-R~Xn
zM$Oldj_gB{5(F)n`Y4u-G=G?jQ8{<We&~JWEMu8&<k{{VZU6Fr+kU9pKkn#6!n7Y+
zrtF6vZnYjh*na3TXjpT{z*Pm=#qR|UVLw#ujD*1QX!qV`4^4>jj3v~}o_*9?Vy|mZ
zPo7ZsTvkNu<VY2CH5x%}b+y)wwXKML9(3%A%_b=h6OMsRn@L+)5ltSB;p7C{Ut9ge
zX&}_hGV?%kfs8p11JbzLbSs3~?pFtkeP)QKPLv%1d^ccIFYJn{k!$L9JwS!Q$iL5O
zEwmS8a8wD4u(s7wsGq^wGUPeqFSDA<2ALNXjwr?Z@D@hVK9rd6LydIEz9<&q-$DDL
zPf_Gb+ZX+rE$tAO_u2ME`LUOR{wTdoO;_?PjE=WF5Z2U@*{=Na(21OVQ7_KKo1W~%
z+eTts^o#nuu+ltcKYP%|MUi~U<KX!d_qHCgFA7`B*gjEg*8&(P*E__&L-s}UmIL04
z^2)&~w(q!%y1KTbj)#ZRBdDGmn9eSncc;8=L3L5Bl|JG0R@oCiWM6dfp@X-^9`hml
zqL_G>w#huKJ!@<vfA7@acfh{mA^W0lPX4gV`jGs+iTZoUzUZ5izeDy#-yHuA*%y6t
z{8LL*@0IcMJJA2CMZvd)f5r6u_-NN??2E3j)ifpTi*~3}<n{+%!m@;13tM5y;~kTt
zuw6+r7qF8CW1|NKQh!p0r-nB)s%QQ-EUnMenojB|X<rlzF0vcYy`z-ji}J(uF(})b
zCUoQKODy=1nN0cykNkO1e<|&YvhhH+^kHK>b=fDeT;GgYY#pJ#CxsoiSe=!xktx!y
zEV|NHxSv7qC8OR_K2tT=zUUrK{7Re9Q+f>Bz9@`G8MH6jkE1J00949hn5#Q+*R6PP
zv~1L`;p?ycUZ`fm>sP8drP|47mvzuqwH=dfmk?6MYE{ayH#(K}M$NI<JX*xqXzELj
z6~ed|$~9$k^hBnLhWU^{sFp*SX|}1+etb?DFI^u>p(Y$EXT?X`)aV!+srZIs7k~3K
z8rVMIDD&Tn^2e6~^Avg`Dtu(EWcu9p=1SQc<t7BXq87C``YU*k#@?u1wkKv+Int2R
zr;5GN?%Dw?=p`?9+Zz?#DmI_vDl|4aiMA{AKi(ABv<5p59YyZ0>+y83=0;2N?=3Fh
zx4eE2VQ=&TZ4@lu-l&%Ix6I_|H^k&<$YoCxHQ&6E#x25d(Xgc~n#gt`r~bEyjJWH6
z9qWAqYA~!Rht{`apL7_Fz!<Azk2U+4uyvz<>W#tFKVXk*h})Ln(Z>3(?2DcN87ORP
z!s$M*m?V7-=0<Ikq%Xsz`xP1@eNG!9g{<=$QGIgS(*k47eIPJIWBPS^ulL`~eX}>E
z&cmvBu8(6c^nPW7G`XZOBhTnPR$Qfc#<o8iZ`j~n|6$Y@wYNHFg*D*D4P+nHc_sZ{
zfMF~W)<AE={&n}k!l>vhM`&Gi2>y(2d@z5Q@xg~(_C?27Z=HG3k(IBzy*y-J)b1)d
ziYRGcbiCT5s7#FB<uWmP2L)D4jNW=MCPw**RMyJeHAMY{EWhLSM(q<sXK>4qy}58A
zHy0jZZ!RP^?#v$PIz^;Rb7p9ovq!S{F3+EBPxXUhZ#3v^c4XGRhHrmz#Ezku+w$lq
zm_6>JQdi0Ry+ig#UFj(tKclHGcBn`j0h8}59I_v(PIX}=?2!G?L-s@YJ=>9<?{SQ9
zx;K)sJ`UdR;NE{$G?;E)RR3Ol|6}Hm{m?`9L)G_|i_3=^3K!kqB>JD4ygmD+?AwjU
zCOtXah?4{bha2_k`l#)PDtk^r&<(>TbZdHGAVqtVFk}{1-|mFzii)9?PBbB^lurFf
z6dLPl+iWeY+;JV*YR1;UwYGsfC{oaktFHpvb_us$?4QN&0Y^GJ5KtK=v_A*@Za#;v
z8w6MXKC<%rz)<C9e?8W1KXe`JhnCd$LDy8o7HrNo7q}eM<#~Z!o*`A92UV7KIr>qK
z(17{UufcBUbl45u5oq3#ehqd*cc@Z^Id8y_MGK--M*<f)P$u!5;w>;5>e|=xuCY6L
z(B=EK*3a3c>gVi(t)B>(tDk`%LQPG>uetzXZ8TSa5%sxlT|eLDcGnKN{5(U|&o|e;
z!lv(_^0VtBD(VPqh!$^OxlaNG#(GIIcG<DqVDl9^Usd&_WgVFHF1K!&r~esQd-~ok
zuXlYd8+HHp-Y&00^~*l?;jB>(Z$C7Dy!pS}9=`YL7Z19;P4k2Q)&9$i{wpdU!{q4E
z>B6wD?Oi-E7<GI2o-eO=v-Qxt@kXrF{JUOF-R1iL$L8u+zI89herSz0;F*62PK=6T
z&KA`OdUXurwhH&yunU8@3T`C8WR28v!^6B|bwbfmibpW$#Vp+H$27Xe)aKFbF<}LU
zhi(I+HJF!0ajXqCMnPTKjN)7!Zf$`QXN@x$LYgqA)gjhHE8juup(V~Wxa!-;%I~PZ
z-SR`>3|VYB>yv*QWyd+%q4LXByW-`Cb3U{l`Yx<{1?6{WzBVxHU2Z)zuf7HI`n!Dl
zq2t&}!ahN9<DuBih!1UV+6e)$*5>SoPUQY7G5VwIhtdF@e`-@OISz-ak5D^u^haFn
z^V{WC%AZWi0q&4x;Arjf*^kK99UEV)O2FRZMRHuWf?H5{T$YQ%k?a&V`k?c($J)dL
zn-*fJ-#%QvYXP0gwCMW_Op9g@Q<g{HK?|d<_AtMEXkY_}(A6j;wNOU*`6CbxA+Tep
zM(qwz#(wanb}!6}nq_3w8F^a+-X#V`N0i?~_C-s47*y{lK4f2XN1kz9=QQjg`=WV^
zD<wXhHZuF79eMplD$kx(OD63@Z(xqiBxpR=nSBJhdjm%%e7M8-QhJ@n>Q7X1@L<Jj
z%tTEle#+i>gyn~+OS0VBP-(?|_o9s+_!0kp%s+0wCWIyHiB<cod48)aSoM0<Ygnxa
zncHaN2jnZTqq7oA`I$M9%!Y{76+);eLn(7Zn;%WWh;Fp9>Or7Jta)K8UQzW+xTE+C
zdZcQH`H0n3tyVv}eda|zSkN5{Tm0o$^~WPf>E*t?=SMu)$p6vGY<cFRr(pUNPQNyg
zoZ?{`!g#Fkyaqxc&+EuY2&uqm9g{jFtc9xh3K(rO=TK1}0<HA^f#i{%{ji&ILC8G6
zq8zFY^8ylym^&vmM=NU|NWbR!5m|KHqvN)Do<vN6=KbbJtH~(Ps0N$jm1aDARp7eb
zs{$)}jaLFU!TwFW!i-m^w|mW`GRIPnGYCjioxQ`3Jv=>3&ggvDLR$lV@e2_#Jy%q|
zGONscF9uwkYSmKmz<{egx8-Hd&Aqhn1Exf<;mO(4-jbPr%H9M@{Wr+Uno29-Lt$02
zuvDR|;@8Ee3VpZL?zg&wRWDV&42DNh=&kqy2J)0(F^3rvu!3-NFG@9(j8^To=7)hC
zw7M&*UctLC3rK~p0I#W<tVEWBnKcnB!S8j{WNwJ;Z9*}>&uXd!Qz#hVQMLJ`;vft_
z;ej+5FW8-+l#GFtjK!B!x0f3#>|qEC5otQb{1wW*&eMkgQO|v~11Q8yC>Usd((LjD
znjePI#6a_J&3RaLk5)n;%$Ji#E945#eHIqpJ-;$nh0TYv<NBwCDG9aD;BC;nF=WoI
zP=&X@>ZRIe(gPlvB{7cMJMLFlojL$HxzC(dO~X=6HRiM$CJ6!)0+*4craXaZ@|jH)
zW>YoyF~eRK?DvSk*lSTZk^?(96d2mV@p0$%!OP2d*2^MiOdNT+`9&K0QccVyH}@%{
zP>#54iuS-SldvV`KICP7rPb|2jXu8W*C=2-_^mZT<*upv4bohl<*>9yq@r4&k}s<}
z<OGabYr+%`2B}cNBPyV3HMBSZMo2&j(3<MnM}ZtlAMhOaD57owmonXU!k$o~3^}R;
zJ1>JsD=Aj(*Uu#djf9ZrqamC4obN~d)}_I!SCw!!n)e}w4)Az3B4|cs$s{5m)=JK;
zh*)zd=k-D-rszDA<mXtMtA5F%N`$SOD$tApsp?@+iGhOoG*U8$<v)r0=h*l_a+@gY
zVe66_bBDR#x~axoTVq~QV{P!6KZ$MxqeZBjqiYee)mrN_H&D>={>U-b4-|^If^UF<
zcLr!G$uGA$D;d|gX0Qd#i|0v*ezoVZ+FnR*C1f*GH#yL}+gu6p-)G(c@qfy^BnZDK
zPi7tMd4l!L^B71}K$+GQHg`k#o3!xbKtd9nZ3-dFEuIH!dr@Zs%{vjfc}a!YS<TkO
zZcAFDvpp|?R-@+?RPzp1?~VZ~wkR-4H1F+xb3WVRIT#lMF_sK?b_2OJTJPyI+r!!M
z{RunT-r8r(L<m&Es$p(+H_Ybz3bf5nsJ8hfb4_(-jot2oE2e5YF0<R+=|0Xoz!%(X
zZm)r_?K2h%wrg1R>>7q*r~eA=5AEMIta7F_zivN-$hGP~T&oc6mL1|Lq!wsW1!QvX
zg^aZ9c10`MxI;Fa`kH<*e?KcE5Sx-)YWDU8Qzz~1^QA8BPw?oJVV{2LPjGx-?D`6h
zQ&=5gYelvB5)$cecw+ToW=AzT-xVQn0_}Tx|L#C~6VTH84@U(HuZbBC^aRX(v8ibO
zQcHLJ2dAbhVA7oJchKBc^>X?(gy?37*A5SS{7m?pJB^(^V-aT8Og=rFewbfE4P_D@
z%@7tTMW+evTAA6v3IqhR-OE@4n^rIq=t3JFF&_&gp00W&{d#28OtX*4i>zv5|C0Xw
za~VJE2%c0s;F^I3g5L82!PfJFfg`>3fg@Y%gX#WA!|SO(H?Z4S?@Nu_^?4?#&wLqz
z7q+l)-|$o*@s#<Sswd2yukQ3bmHyM%<WUaAz}Dk?j+@rhmV&*rv8VvSz{f5@c$a@!
zk0-Eony06Upsc5<44}NHsT{!D)8qv>tf%QPfH6HyV*tkXG>uJf^QHTI4KJs9cX7Xp
z`6L)*GY1^^+k!;{YIzJYyS+$qu;Dk!i_@<~R?XGi=wul4vC;E`BS=zA9kq+b-ps!3
z5ReVZWxkxx5ULi`HHaUpF4SJ)|K|7syLqPmhA?JTiWTaQ(u->d`A2ijJyt0{>$>yR
z_WndQ!&!-%Exu$lu(dt1x6hOGS>2UZdo+6(`i@6-c^)y_tJyAf`_1;?7RcW#2m&Ds
zny&@6&W~8_5sI&sh=O$3eCm-G($625vG+dDj}Hf4VEWUUn@)jjgagyJTQe(x>SulD
z7^5Eo7V_*jXI7hikL*f6f72FEVEV7jUspYNeFc{%Ae2iDeziNKGRdtZv!mW@<rYtB
zqWQG(G=lqjxCO{-?u5Z%jB4jZ`9!(h?hR8%6xbS%Y+;VNFm8`#%N}{bvlE|tF}p$-
zj_!@ulqah;53Kd3PRgEgb3cS_W9DP%ylzTwJFs~`X<Gs<`vWs}dY&{lg!Kr49J4R*
zTiKIkw-vTJs~fhVy+8-HO^xaIHr4oG&u?W=H6xut^9gH)zu~3T5Pp2O{*8H;>;0H-
zK$HszSS$UCM#D<q>T2t9fBN--<Ov`cOdVD~Zy<GCCO%*``OVH?&%6QisqDBmb0wc@
zdmY==OkqiRxY&=5A$cm5Xt0jGAv~!KL&l1R{^YUj2H4bD@#<Z#f<$fau6FRn&QQDt
zr5|IR1O`gcZ^c!=0b~;vN8=PR^S4Vmp3cdb)rEOO`ndxwoF3e3%fybo+dQb4Axv4i
zAZL&KSNeB1nXj8Ws&=Z9H(y_B@I$q^a)*_}#%T7`y%d;~ACofkLF2)mu1Izary6Zh
znn7%gZuj~O6u!3#0#Ma&mp%F-6n~p4{=+hDr$7RBm~ATAoRRE6R@l1w(YIpM8@9aB
za)?!?-P6z)IKL0s!lVU);!93a^FTC<Nc21oqUUj*74-btoaZyU{0L~qgG>idrb5D#
zhl5-XK1H-G8^oVA0nF*>;%9|m`a}kswir48y1d@NHdX8L3ierR*&8(+fLyJuHV>qK
zAEpK^oZjb21#)wd^y}f|skM*(n1nX(#qc^gMU8nXtr?Zs({gyIBK;~dvjc|%^^g}W
zNxJV8^OdS!V(eFy-dC2a&IMsiJ5brZ*7S-kzSPO)K9HZ(6w02&m$kjw6U<-ty>>Dm
zAcqsw&>sFia~s~4PY)h-amaj3kqh*!Mb$#L>NB^qkW3g8KDlAHxf_jxkKvDdS`A49
zw_Z%VzVR4(B+s-itU!OAoCw0{8~lcivFR*eD4$^R2=$6KIZx6reJF+G1Z$=bWjYi6
zM1{EuAEF6D3}%M-Dr{~;iF<ebrQrCZyT0V>H;a8Qq6Hrvf#{62R^Wj7;TiuqDBn(}
zWrfjXWD=59)&ex_7dQv7tcCHKaN|8U#PK~~S*v15^Es{Qet!m^HF*NGx*b}@4`-tw
zwY=;uG-z(8mnK%<mNa^C!h9rY9439!yjHu{oar?aUS$sUZAq&yGtD=Ww6b0>z1$zK
zCVH3NEY^Q%3pvx~OYfkO`3`iUxo`GNC||j!_5mFI!*SeT`T<yV_H}mY&ML1dR@JUF
zKVV@yeN)Upn*lQn_E)Z8Ks){XUuUHEPhIn08Kq*iZna3p^Yp;;_KR$rz_`Hk1fDJM
z41uQ!JW1d&0w)N>7i>tGEfn&nGhilSn|lMBmZ*9aG}}A&_LU{i027v$p?%g^Xf*gC
zqk%Os{iZ(=Beh+e;hG0_RRI{rOuRYOb<c9SSHV5k^?W1TSGu0>gxei{DW2WoKZa*_
z_`k!mJG?vIgK^&pdhT$H-~IgQg6A*bnOAXnf<bjHQV;s}8r0jxd|6KnjMc`|In)`Y
zY?Y4Bj?A0h5qvA;cX0i1^5acE7<|j~Gwk^jQQMBmY~V~)$)Hl~#-Z4SDRo=*JElKg
zNe<yv9q#7-csC#W;};QdK#KWm1iifq?^uUc!vwbvK7o6b`+4KK=ut+pK@nJo(XXEP
zVw{3Okdq)Y-t2hAo7J8eeor?(SFK1wb>cJd?K40%DIMq#RV2)aR36-XSAEk;vW~M~
znReAQIdwJ=q}n@9HAx~2ElG|~Rw9yVuWs0ZmM9*1C9ok8%}&Z-co*k5-|CK5JqYzy
z)h{#tlhS?FQ1CvG@gHNm`mPFG*_Ubep%wRE6?h^Z&2-mcjEBiYo!M1qwbz?%_164G
zb6z83jWO0(rn|+O-(t?gf2%pKl^z}R=)lBcPS3nK0GIU4y98iv&%C+T{LtoSKr);>
zoqDlfPn};MXzufDgR0rYK(wpE>JCrp4&g-?)z!XiGtxr+h~GMX^D}&toD4-RUZUgS
zXBvZ57<Qmb4pu!4S}9H(LKbAf(~n^SRHz&LW?K-#g!lfykugl0js94K5)(KQ=C(1X
zInubQKZc^yjW+#qSIPDsg(`((ZHQs@_)M)u(NfYMkC9AHJn-NWkBuAV7|DPYkD&4O
zX{p_~;S%+--u+U?L%qA!)Hs7rSNaC&OV-5jmCW<R);P6uVI979?|5dt`BiD>6^@eO
z{6uEU3cuN)+rz@)O3J5cYdE;?Bs*N`jpg;xP$;j@nWU+=*LgyjmDFspW;;thR6U{K
zLYimFj};Yb5z_GqI!2_`c4Lsh^Z{BqEMV}XqnI#JLl^g3i6A<COo=({hZ+uZigwH@
zF%ib+8p2T2K`gCA1wP$iwqxa^f;FqVIy0}@YKt`NOrGBGbn;Xab7$17MAT}Fn(dfC
zM6E<6CM#w;)=w&TJ%KzU9aOY}RFpF&OwFN+mDL-L*r_zU3`+$&t9C$=D>gqGXx;|=
zD5krZra%MrAaQn@PgU*M{0#K(Knl~uNK!2zK=D(NI-BpzHmYlphX`t6yc)GIQJtNP
z$qZjtAhF15#GJ<`v=~7T*6V>z7w$IVk7LcPMl<1g(Cm(4mW8Y!b67w?ZNd}{>qvA|
zq9TGxbyi!Q*<NSH>#Rh*)mCq!fr!^ziAJlf(QI!t<Be7#X0^r4_Lv!uS&3$=t=VjE
zMoVfXTCBDfv%STPw^)f*tF6^+Z#CnsR-(gd>%cI@jCWXx*;d<ZvwgN1pB>nmKts|t
zr>A{RPaLiU+LN|RdfG4PiNlqci>J9g?Q_u@H_Z1XKin`slscA$*j`cfRMpc^e{_Q@
z70??b!VO)%<hc!9p;W8=QI4veRgZX{Hs^)RwhGTvDDdoA6p{9z3b~VEu@FPO2|}i}
zW4i}LMg@9`!5~s>VVsq#`dniV#@pgYx!0FV{%i8&-+dl4y#eFMcH|!OCP;=aHM2ji
z^u_)05DE3iD+n@O^_h8%Sc=@ZVXl!uuh{&Wbu8t>poT=HERHWS&h`N}d$^kaXBQy@
z_#ox!81No}YEtRo)ed0Elk>FW%txS0Fn`&XJ=yciM_y0A?)^Etw7|62A@b+pv%JWc
z4~pf}8`^xSqx<8ejui1TiU4Rx4I^j#sWPznW+)qU+gh~`;}?YYcXte2@6&@#CO=t^
z1uxG&^0sf_`dH^ukJHm}0Q(xKq6%k14a^$qF6QIjhFvQ;uAPUfS7|;7)x)ooR63bY
zF@{-)L7#a-Ek|XlMD;=q>1u>rqidU2-SG5}nRqDm=hdMs+bXMGtLkfbByj$NR#%JJ
z)yj+xN=tGTq?o&t?nKZ`7i)Al19U9Vmd8>3E3GbHrs7-_Td=&V(K-%}5DB5e`@ywH
zC$(W=+)*YFunsquHR=XBaJnOs-dCPF&cgCClp-4xpR>oQqT98JrhhQRDc|60*vA4$
zPGt8+R*Yo~yFLO0g{qz|Cpum$E~`Hz*lB-lh1G261Da$Bq`%3QttMNxI_onl8?j!w
z@dn7&C0e$AW1Z!B!tC@>SG6+O-=t(~i!X3Hv{nUQ_GN5#e1p%!JIPV$;Rl#5^r@7m
zZ-C^VVcQ;AeVS;^!h4%Ks5P5AkUA<ejasvwxm1~rnF&*E)R(<+>E-v?(K-3UeA=#G
zdVLrxCKu=Wm&){wF(a_)H;_%JCH7969Za3sKg|~9X|^a&Q=)85tE+uRt$?QYjazl%
z#v383M_6+s(38v!S*t3t$6Isjt!a&!x^SC0H*C%gnX4-LK@aJ%riHog3Z;7TG}N~c
z%B&J~?sO9$Hk}qSXYzA>P=4MR0%8m=vt{OQ&FvhBRvidzsz=%w9R$dqoMcr*2Uf+p
zmU<v9L0K=x6vOOOY-@NauxSrs+{JIGKuI|(0(pd}H*bCv9f>cn>3i_Zpv6UdpQp~g
zjWuFJo#$a#rD6|N5k&%FJH3-_1NC>5RNmFIAbRx})<Q(F^PvIa9@xb1Q<yJ7Vw0Ca
z$rSkbCz<JWh`2LS^(0fgGS<D+Gt1nr%G-Pivv8!jVP9%VdcP-iJ}9DZ<-o+t!5_DY
zw^gV_2R1Ka&90EK{K|0E6E-<8V3s0AI=fS+P{WUr9ols+qcwvy=&mn>P;l{XdY^n7
z%GDmZnrESoG`lXe&q^OW-M2Rep=j-o*+LPsg@OY`<Z(q^?E^oeD}7+xs_@3O5Q=eD
zOC%GTFf$8Bz17j^d2puLg3TErv!kLPq=0N|j2SF<x%z{AeH9en+}jfONn<ZPK+$0%
z^bBg`c$5|A$dO-DH6ONlzMreKZFTAW<5nFFZR%W%RBQ2#nh%;ABHQD0j4ag9)fm6@
z$Lp9+z9JSdPVbL5GMTjl*;>;d#jI((O)(w`Y{dgmJ)3${PgBRSf80F`9k>uf?ncBg
zv9{OTP>;SjrwT!m?BM-(d$PYHVf!kbe`uzg+4L*Zq#Pj+bcR*OcmY-&QbB8aXx#3k
zck{r8sVH#S_8CSst5(X@^3_qko)HUt_tn}*p<8T!f;9ov!i(Ifq<~YWqTS(|0eY?`
zA0%#|ze$<?F?UFF2E{4{l~z2a)327SynXvl#>$=*Z^1WJ9#h05JMQ+Uusl%`N<s7i
zYb=y4-2)x`0s|6!d}cbQ^-GO`6<(JL2FZ&Qv)|+J6lu#`2!nJc22;@1s;MA9$~`9g
ztWHg?y+?bPKR<AdH*B`Xgx^19o5-O@Fm<k;uV7pd*mR8Ypw1K0HW#hu4-t*EAvkG+
zf7fGVq0D`E{e|!2;i>UZ@>un~v!w%F&ezTYo3IM!;AX%=6icp6;&8LA+3KqEY_n=<
z>H$;oZuI3e-!RaHvsn?8eiGBc=~$tSRBcCjpp`+h;0zZUcB7d|EyBi?<oDA9Wy!hJ
zY+dhYw!rX~Y?}o|pdThBSOgp#Y^bby7{d06G?U&IoP@nI-`(MPSWk&w{VfZ~)15~r
z=~#+#Mt|YJW<`Nh7U>V6Uho;ou@>7V40hv~EmUIoQFPpdu^Qqxvfs5g6(={MF`R@c
z%VZ|D6ImWu5m62EtbwkGYD_U0h?d7ARj5_u<F1P!!%7~tP?oM=KFFi&rVcyW61TcT
z4XRtC<6XLrdQ|+traO?vqKy-W=x935-SohqnJros4A$qMf#T!<^9Hs#s)6Z`*E7@G
z<ChrOCWOR}YWOzl3Wpg5ygb>{z`9Hu)f&I$v;#zxhoNgT2(n4iY$r)x%s=&AgXgPy
zTFo_~<aiFZq>0iVdGl@kE$}x%Z$t)sH2oKtc&)$28Xwk?XzgMkRe^RQ6~@=(xe&$U
zz-$kgIy488-=g+@v5m<7)cM%VnwWg;JOM`pfw0j`GM(`6O;nQ|iMj%IBw!RbsC65;
zIey`wZwPsl_@U*~@k4uL$B)mv+sc%<e{WpH4;jcW4oq9(LH(|DI!eax<Ug@5v!-4%
z01m}~u{!_Wy@{yGKbJ#QC31Yy{l3!if{W@Z89xRd@qMhL!iM<1%m$r|xK0L?`0Pl{
zxOZ<{B}1*sx|0$2rnl!*Eje8!J4hQZe;i&iJ!n6D){H%w&v0O4hJ2aN)X_297t4Gm
zV!QB8rDnFzpK0{%ZT3}rGD%<TO-M&xf0W-pjxs%UlAd)cJqIf-L!`%%7t|MBJP9}y
zM-m4uCMC;*`b1R}s2@5$%Ehqqkb#y{%6@q9EImFM%zu%BdPfSpwiHAu1@)AIgQz1V
z^FN~aRjDKXbt?WMm1A_wfS8v|kGuREbu$TvUH-nkiAvQ>IBH492kXB>ltan*+~u$1
zi|hE}zP)i3U%W6rw46{ty`AOX=#;<DF8@lFe<RDkFfj>ib{i`5L-D(0`Mcv+<&XH+
zsrcVCGbBC5#s}CFYpLppy|IfjmZ}Rai_*Qhy5^|j_0Ry+hL9(B`7YAk-lBt&*W&3d
zXwH+qMNUJ$DDS(sxz0N;<tq85>w_+zI`j%omk~iAbQy~v80r3kSfp>t#a1{}P!X~|
z6wgnN{|hw#7jUDimi0Hm{{@==3*2L}5hb{EdI#};fy4g=<o|Ffe-r#)p!i=9%ZRdL
zM>@)XHi3oLK1@7#yWdkxBDmGS)a?QH8^Go5ey#Bd3op_rq`wE@dAo5L)=ejZXAW!#
z-|Y2v=ljj3@2w7BtQ?B*e5B=Dn7&xy3p{f!SXj=zC}ZAkbY0G+%37Cs%pFMFBaNe2
z*kWl>^VfoSb|AgH-LFTAr}Gv;VBRAQr>4`ucVG7-4ZPj&3h9qD+#)v-aeoQ4dAq#|
z>5nwr0yhzH-wE2h-Cl+CM;dO;V&jU%#wz?KEjHHRzJl;dK-{Z%Pr~0C{$0U8qv^Uu
ztClZW6sfGOnKET^&E)#($dy;DUc4x>{JO}hy83g@sXJ#;Rb=6^E3Ugba{b~}tC!$?
z?Kx-EoH034c}+68V)eOao_U2$<BY49FTZ-(;?>Jjs}?RkW8v~^&rB{~zHH$&S1h^i
z%w@~2zxIPGRxMw;cwsWKsNt&mhO6op)t-I!*=H@9Qd2v5@sx!%4RsAut~%?=vuYME
zTzuA|$!DECxymp?!W7SqvkcEVpXUU>*V_XnT?O9r=5;#%nkM)*mrXn3utd82GT=n;
zN|$-9+rQ-&Z@PRjFbpG#_Y3HUYc>BgjTyHb_Hkg9U8T@eJU#TsHJN`J4{=>Bac$vy
zTq;iOui{$a#PyJkVq8q9adcd9JFW=4_Rt^K6#i+v=}h-hg~WV^!2@1-c|&@b<Otq#
zWrbIaf0~9$&nhQ9mkAE{s5v+~J?Go$VO*O8uNa@{f0y{@r59;oY9sK!U;O96?Zl(f
zQZ|dRkj4vwbFLc)G?oK_{=PDL*!`SC1O7|Izf$~*@q^)8#D4~fXnr941_^(S_%{{!
zUl0EX-t~xo!tJlhgcNL9{PqxOAdQELr9tswy`n*R+$}h2!<SB{E)$Uv;)TochwDQA
z72?GdIinI@F~NJZ7+x>%n*4{c&nJ(T3GPvD+;*E5{cjcj_qqL>Zz-P(6#9RAnD7sY
zKXIKj&&kn$QTz{g`%9h~#t%O8I)Z;ro^#==#s5^d|K&OV)?xgYi9g$3hki>g{H;Uy
zM-k-P;{OA8cwKg1&(V2Y@B(hU3vB-g-t7_pJXut7l2S<IMfflVhK`zlnioQYX{i_g
zFS`A8T0W6W%YtF(Y!v@1i_y6_m*y>kr}iuA^r-q#)<!I*`60n6RlYBZ{|DT0p^nZ6
z0agBE=ux`Os}_HbiyWRPzFngd8o}!h!8vabPOe={3eFlgj^>@+1gpCBCBge5+b*4F
z!7DdCh|{iI5qR$q+?{Tkb{lxV=Ff|Q^L{rD^3VE38ve2LFpL`h>G%|lMNa-|hQXn1
z%odzU#nOEe(`~m0>jdwE?)Z?ND}lkb<xApUUW88BOF(k9Ejxyx^@8~G*p8Do&C4@#
zyrdk2*kIu*l`gf+3;&U%Yr!zIHj4j*BIzo7BR`Md9){LK;y;pf?Hh(xc${Lvi1OGh
zxTW~DXcV+=8-~{1qoDQdFtpwn1+7ZesFaq87V#em?~}vOx_uP1dWWI)+$d=I$J=FI
zsvN7uf4DqWg3KJj{RK(twnVpa-_FT(1m2qjH*b8W+8vI*4AmBH5gc`<ppafqjvm{e
z#|1ZDq)wGL*zFI~_=ezp4(>r|+?-FdQgzyf(NK(Lb&h6-;0>2f#=lN*FDOE@jKg|q
z-<YQ@f_r`u-14*S_=&eu@V*cCpges|u~W@U_6gqBVtC)M@tDTQ5kxSI|KVRD-#HPI
zG!nN}aJgT15H1J0F5I<(%kN7Lh08qMCAi!gRfv0okR{$jg7=Lgcx7M6<!O)Ly;2PC
z`TTT7CJ@Omp66d-{vXcaGX7S<y|fsv8l~8}h@{|kxbf_<OoFLoA9RP{sOqcZb&XZ;
z5&sXkX}HERPl<oA`AP&~_KE*cW0?vy_%n>5#xgO%S>jHIuIH2wyk~sZ2;K}go~q;a
z+=Mu{3eJW>IAv<^M84cDIHkrgJH>yfG0dJ}a45^+AQNF2>h!bbzaB4qo%PKYX5uyr
zE_Xr}%1HS``M4_t_s7L>zmbpoCBgl6G2AcY<L(#*?w(QLMvf#GF!vZi8d?SSyTx$7
zoS)vcqrkmOaJj2$5P!dwPj{!_j-=e)7zJ+SM8$?-`M`Eyw&1QVmfowFURyV`PVoLr
z(giYB_G`QDP`>UGyyuGHt#w4vh`@iR;O5mwdmeBpDU#kE!8xT^`T{wAGA|J|SvL%B
zTyxT>=#?L)F^ShAcqZHqo^A)$*?Eb;YlYygbmQ4=pPEFmj^8dgrP{t9h<~ZJ@9|;$
z_lSS3I}K<%wQegEqDO%)NaZ;<&#M=lbBL(RPT_n+Wj2D>mkG{L?dL|p8EP&_o@^1k
z)8TgFLz>ydM(}Ef_~+$Gr6;G0d{J;#yJ_e$V&?IlafOa1LTO!Oo%lBrDKGCiUF00W
zx!8@P<C1<X0>6!dH^q&o<RPbvyi0KM^5!b9`^7)zrlInln{&S)IJ4Y1Iz293Wbhaw
z6xaEZH#Op~))REzk(O(v96H2*9*Jmwm6n_?GATF>ZXD3K4m23Y?c#q{fj^~>{yz}^
zV*H^0<Ko|35T0Wt`tK3{Sb;yaKM}kO9ZQb_-L5K=HNdcCq+W1}r6Gc_bHu+?f6q2!
zo#0#qx5F!4CL$xmyG!scEQaUOMLr~Wj~2r#&_(VOT*V4qPD)#B=Pw*45yL2@i>w#_
zQsL)_Kl$zC&83T6EB>Y0xI4sO4OMmeW+?WnI(m=zm(oQ(HH`m0@mJFTO}`~aKYSb$
zZm$D7=@);NNxk^rLnIwum)*B=bQTDn8ggkomo9Rn_{ZFIRDDT0vUb-HG?<qA#s7Xc
z4V{)B=F;-wFm(LKlYo6@eo&rVy2v`g>n5_!lii0oy2v?#Q>uK|ihrp-><;lSRln{L
z|2lUX6yI`v)U$#!RR3d~KmvxbhJQLQns+W;WToH@HwKG<%xuBk>85G7fsQV6t>Baz
z$KN6THG^p6bdf(928XiooZwWt$1jq<@)PW_80)A{Rn*e@ol5Z^PWM5y*~8FEihrzF
znhJE0cMe0VSNunkt`~=)<v)?kHjI(zBI^bBgAAbM27Q>;-OdsJk)&(WFtqL(1+AUK
z(Aqr;S`{ZTbERdXQT#`e$7_b6)iVlOKNyDA<D;NuoIG?MBjP`jJhl!)YuPAh-7yTU
zdqzl$ZNMJ{cN?>+WmUIv|7Q0O5qSCehbwO^s@kob9<nB)P>jzK6w*qAmP==Mnc&VY
zR?ic5+r#<TCc*nO+=FOt%%^#`;Hvfag80iP<!C-7c*CWW@q16fAFf43(pk1TKmHoQ
zJ+cUHxz~=LJf9<Y-y`9Ibe7#^^PG4a1#fFHJeMAFi{QOn46i^B`MBUdT@1HC4`~nZ
z4CAR`aGBO>H5fFEPZq&->mg?g-ZzTix%H6i1n-q%c+cnf&NA8}xX%~EEzm<gF1VK#
z!*%H)-w?bGH=aF?arBT8HNZ5CQsbDI_?H^TED--v<Cu-&Kh!wpF2Om^olaFRbMw0$
zf|IBB&~@CUhukfArRF6O#1Ud)<J!PKExY#k#nD673r?x=%N+3^YW%Wp7#x=Sor3cN
zk1H*D{PK^iZ#g~WLxTHQG2Fg<+<l{<8&#P!jBggBdq+Oqj#1#Q8wKu`QQ$r<xZf$3
z-Y@2-*Eo%ZY#1ZKtrpyo=x*l-?hlKl;cNM6*fa{<y9IZ+vS9H(E4ZI6mWCdt!PY~1
zl~PFzduw^ub>|tot)?ti3*K{ZJM}{273d-72yR||wCj+ghg>H(Bhf={5!|8lkWAxF
z!8@&Na2m@)WqI}G4Z*D{hI?#2ZY7E1`loXIX&$xO`}oQ~QJzP4w&3nBM)x_=Jzs5#
zVi|1|+^dR}(Is{naoD~^@M3T~@ndfk*&e~G9pXRN?Qgf`oj_4*elH5nSBu4UyB!x%
zLRBP!J&Q%~$~Y&qldovT1ox{9p!uR@;&#St%h)x7S9Cnmlf%1h1oR@Hd5_>-47U@n
zo!?fS-)9BqH8+l=Z2^$jaz^0iRh^e%T;ayEX(^2jaViC;RD8r~9fl5hyFzgIi909V
zlBRM`u3eyPd`WOWT?}_~uKwOHc>jPfg*3}PmE-M;g14*~9ydYZeFS%C5)lgaL8-cH
z>ynv|dcoOKOvZncUw0M>?z$ql?tMJW^KF8gR~B*EFWYUWk*ceE1W!%xwcKI;8G+y9
z;x_|shab(@Z`)*tXZrUE&g3F#DnBuo{s?fR)%e48CI56>sC#AHIE7cF*CIH3-8i})
zunm=Y0dbRpyQ3KHXMij9i@0|R?k&Y|S!OQWhXnVp#pETKFI)QrcV98OSvy}5_(jwN
zzhEDz-Ht165~o>k^6G|-qcoPpxkhk41h>OORmXB;xLXD1dN+>dp*;mtZO#t_FK>LN
z@mAVtrz|}?LVDga7$Ht!@lThprYCDxq*pC?n~LGts&SRR*@Aa#F}#~{>02jw*A~NL
z1BLgD_b$Op6~nXDeG2a(!Mm{-9v3Kt-X6jGSTQ^<0tjBknM5#*;nLSEc*CV{ncxkV
zzS{+FsPsjUuAc~A3lpi!P05{IXyn~<f>U(eXS$u&2=IJrpl;h!&8JnSRw78NT5$5(
zCM_qkbF^j)-cadUTP!|J%ayJ>i{aUI%SqS$BS;sLug;Ji1~>-ySlnzT#^F93H!nZ#
zBXCc^9l%ZhBXLg@H<u5O7B`nq*bWotc-(A<>85(^BymRoPZ2k#UF0EgI4tGRi|#7i
z?3U<elf)`ZH;awgqI)uKu7%M(1^3zFt_N%o_f)_}+`P`i{bA*TSO8AL&9Ke5r;9rQ
z$nxR)nF3n{wh8PINZBFYY=K<@=LnoD@G^n(0OyPQ3V{m&7m52Sf!6>o5%)&~vaVex
z?iGM5#l2b}>loWdre`hg8^rxlz;)tgyLgkhZw6HL2yheb&GP=^fIZ^=J3vd^8Ng47
z`!>K&iTg8vw~PDl0Y4}1&jWrz++PCxvbetjc&E7k5%8bH{WZXU7WWpwZ;1O_fZrDP
zzW{z$+}{KIzPNt?_;2F=A>cjY{t@7h#r;#jpNYE{uut6g0p2g}?STE_egN=6aX$q3
z@8W(KaHqH*1$<20{{i@fxSs-~j)`UQ4DM&e{TsmFiu-xM---JVfPWPCp8;PG_kRIq
z#r+q+{}%Udz?a1R3g8}b?*)8S-1`Av6Zac{e--xtAQQ&4mEn*2Te=U!-xzWG0QnJ7
z{0x3##4m2@{{!NtF*J@<@iUIbALn0m^L)^8;ywYeLfj_-o-A(8>+my9#a~q1rvaWW
z?kd0!h`So_gW~4bVQO&mnhbcBxTgS~jhm0ue>RAFDqy3y&jb9hxSIf{iMttay0{a7
zE#l_4XSn|oKjT9DwTZg}uv6R@0aAyHpV5WCZgF1%I9J>}>vXxe=L0Sf_mzMP#l0Ai
z^E~{FYw)*3+#dm4ChqG1my3HP;3{z^0aM~$1GrY)Hv)cC-0J~1h<l^Jj{&B|y&3Qp
zarXe4;<f;97566qKPm1{0dnqvpK&|>lpX=@&%u2M?$6`?0&e__FX8XYbm005;GMWR
z&-_Q+_^C5oUlaG&0k?>odW>(0n>v_(5%=AI-xK%00#g5lpRpBx)Tz*YFaCZc?w<hu
zRNOxY>=pMm!287g3&8E--U0Z4xPJ-wkhp&Z_%Lo>j{rU@?#BWD12-R^#NSim{x#q;
z;{H#8zZLkrz~2k}qrg84+$At8@Gk=YN8n3<FN=GRz`cO4ihIAn*8$%U_W^-M8Pdud
z=`9EJihGPeAK*A~j|cRNdjeoU+(!aV6n6;lXxzMx1q{pk;{i_)_lbZfi8}&#invb&
zjEb9jnbXBhy~_v0T@Cm_ai0lTBW}*m&Jy<&z_Z0&57;2?sep~*J`eE2;%)+*Chlgy
z>EccR^1L2-GZXLvabF17ChiWvPH|rZI9uFZfc%UV!(IY7SKOBYUM}wWfD6QZCE!AF
zF9y6y+&mAsMBE<%Tqf@80GEq<CEzM?CjnF9UIVyR+&2P#RNU(UH;8*9;LYMr18x%c
zEr1^vw+Z-n;=UCyBkoTE-X`u(1Aa!_p9TDTao+*>d2xRc@Jr(U2S9#5jQsg3;6IA{
zF2Jve`|E&P#QjacZ;AUmfd3-yy8*u^?tc~dZ-86HeGlNh;{Gw<PsIH*z@Lk|4{#f9
zUiSn3Lfrj;J8(0N4+8#D-2V>vD{=1xd_>%j0X{D7Cjg%m_tSvC7WcD&|0(X@0zN11
z-vRz!+<yf8lek|1+$HWT;EUq^Z@~W%_e+2;i+c~?{}cDCfcwP#8sO{V{wv@CaU12x
zA8+Kb9MCK7F@R&mJr3}2+`RmNN67mCU{Kr>0gn>*(SXN@o99E16ZZ)MPZW4EU_{*S
z6Bq@2zqn5atQ7YL04It2gMep<y9Tfp_hj5>$-60lXN$WYutD5Y0UL4iIuG!};%)+*
zChlgy>9}X$o{5`$NdUHpyA|+4akm3@h<ld6*?<>|yIbHTfOExtnZS8~^TmAy;FaQD
z1h`n-R|8%n?xlbq5%;x#*NJ-t;7W0?226_kdcZZ}z5(z?ajyehFYcQFH;VgXfN61W
z2E0YwJ%FaTEx=pF{RzNNiu+T5pBDG+fS(oj=K${z_ZI-aDDE!<{)4#h1pKPFsWZPz
z-2V*tb#Z?K@SEcPHsE)}{awJj#r=K2e--z?0d5udJ%IO$`^SJk5%<pke=hDmz-{8b
zAMh9A?g!i<?gs&XDeiv<{FS(O0zM+{#{eG}_Y;6miu-B6UyJ)$!2cBYZvmeZ_wN9I
zFYZ4A{z=>~0PYfZ7Vt%J|2N?Oi2EhLm&LsY@c)VXRlt4!pS^Q|ucEl(|Lks5&?phn
zqM(LrR8-Ue0fHb68W1!>govor5J-4PAdv(CMGX=a1T0#7qoShqff^Mbt<++Rk6N^;
zQl*L(Ev>X-jf!t9|KFLNxqEh)ySevrssI1y^Pdml+_Q7`eCNz-XJ_w2z5WjJd-eJU
z$p5O>bhGc!ANsimNt-(KdQZr`)a$m8d#l&kko&6F?I3g1>-LZbsMiNV9;9A(ggjWi
z?gZIcy*>=`aQvC+`-Auq6p|%R?o0#+Jh?-`^|s<<+Hi=ced4d^g(r6|f<vC%!QlG-
zfg<fY7<$M#{2gNC)2>F4JdqnHc;$&B44rm3g5=3v4zANqN02<Z+rf3(@d%RVzau4n
zz%#zh#1s9*K^^1ScyTgUP`&};%zA#Ph%3k+Xz0a;PP-*R^5l*Q*J<Y@NS+uLD0t<G
zQbVU5l^}U?XNBvd0tK%;G1}12GxRZrPCGC`@<c_T;FTxF8#?XC1j!S$GZQ3FObHac
z^86jq_%Tn^#$VG5&;PcM_%Tn=u1%0UxpTvH+Pw*q=fCqHe!vrR#XIN3RlJzT74RAj
zopyJE<O$m036dvhmnTS`SQ03B<q6vD36dvn3KYEZ1nv3+$rH5m6C_X2?oW_BaZjM&
zl_zKyC`g{5ouD9jf_8&~<O$jl3X&&iS13rHpq-&0dE%Ks!7ESD4pERiLAyjj^2C}z
z!7ESv-q2~sC`g{5U85j*f_9FA<O$k63X&&i2PsINpk1UOdH%bP;s-prn-o`39@<d~
zk|#b06uk1pW<#glr675Nc9??X3EE`}k|$`VDM+56-KHSnN7DlZuRKA!PC@bn?K}m^
z6LR+{e!!DEP;nLK@8JX*`D<h7`xyFu&gZxAGjfdl_J)3-p?5U&PKHjqRzdOv?OX*3
z^ShzbE>@5*zZ*L3W(5iJyK`V@is)|S_i$pN>tlhD-^<Vo4ZWYC(=J$$Fuxl*?S=)(
z6SN~1B+T!IPCH{k!hCM%v_lpoPwtX&op#EC<O$j>3z8>j$1F&m7-#5JhCa#Arx^M)
z=Ogr&oVZJ~zg%S4*BkmwL#JJ~AbEmz+JfYX21CEn(62J|`G&sG&}kPgNS?Uf(3d*3
zq5g7{k$<zH(@tHGFkd@QgwDUy$fq5=AbD~pkLxRpeA>|qlIOouEPlZA-(AIY+T9D1
zCuoN+NS@r~<2vp11<4b%+ZQBH(2ie_JVCpDLGr|lhEBVGLGr{O4gGcJwa}8V*~tI1
zBSPz`H;sJSEew(;cMQ2syM{sX1nnFK$rH4L7$nU1hE6+*LGr{u44rlugX9U?X$+Dl
zJ~njPc?^;#Xa_P#p7_krX*V)RxIP#<?Mw#A6SPAaBu~&TWsp2Pq6jp)9(abnr=hno
z^nDC{KSST&&^x&EL+h!7jQpP%`XPpXsG;W?`VoeHl%dnkXOKKWyPrYA^}^6;7c@w?
zA29SnL+@wk0}P#ZMuX%D+8qrNt_OxryQD$#1nrat3D*NdrybKE;d)@`v~wCHTn`ML
zc2I+a>w%$H8TuqcpJM3K4E-WQr`^>cd4hIWgX9U?WepPMe?zC;)*yL;c3gwx3EFiH
zk|${AHAtSI-Pa&_f_7ko<O$k^4U#8lCpJi)pxxLYd4hIigX9U?l?@W+b9XzgkGb(f
z=Jk<wYlGwo+OZ81=66G<o!cOJf_86%g!$djX(u;Go}k^_AbEmzbc5sx+SLt`Cth&Z
z)&x49@EG}P-Sr3Z{FjV;+5rxdCwGClPCLOt@&xS$2gwt(BOD}8(5`ThJV86dLGlFc
z4hISIyP?xAagZ>d8#?V42MP1Hq0_E$kT72xI_(|@$rH4L93)TBE^?4OK|9Go!u;%Q
zM1RSTA2R!k2a_OS|HjbUddFWF<l||xk)Lho?F_xWp&w}I9Syycp&x4KhZ}m#(DMxa
zXhT2N(2qCtd~dC~U!e>~<Yqk%onC8wJoJO1(^eVf&x208R9gQf^y8rKq4KMtQ<v8H
zcS7G2y7qS-blRoT`8Psu%k;f)%iaaL_O}T6`?CCBLqCe;<7GT~au+_Xg4v6(@r3;-
zL+|I6cZ_G_#mPqg0Pp#Wcz%(QKhV26wEjBP$S*eZ(+r(<`Ge$%5<?$u=pzih%+Sv<
zblUk360To{PEP@Xg#9N&uQc?DhE7iff`t7hL#L+$LBf8Mq0>`>AbEnG6a>i=^t2#I
zo}ecNLGlDWH3*U?=*dBlJV8$ng5(K$f)FH6&{KpU;r_+Y>1jfcJV8$sg5(K$st_bk
z++pa;4gFq2r>6`-@&r9;2$C27CQ<*GC+LYokUT+89fITudh!q??Ehx{UTqN{jl(fF
zOYF(E4C%ge6b){b<b5a&W~A=;i@AG>i)kRLl!MuJ&pKZr5p&y$J1^F`{(WqFLw{mG
zIREQTzD_&GF*jTMcB!uyL3DAS_4MaU=_r-w`xEGu|DL&+yPx=Omam@;5p(w!(+%EW
zL+^QjZ{JJWcMu(h__`n8PsFwTeZ5HLA0nRosjt({Z_GVZ{6n4Z*I%yKw2z<f`#VDT
zzZ@w9?c~PXqr`~ze*Q^PKSq2eE7kvwmYCa3Ja?L(@AFR-&yMo-q0+vGxO;zJA1L)+
zqC(}<X)(7@%sbuB_s{PqMyM@+|NH^M?ds>#|FZtn{ohFFF?XPNk{S-_O#H>%VsV&S
zpU}=<%sovE>_fSJqVpH1Epn=cn0vZdRqf}+q+TNaPL7cL{9$4bmERf1Vs5E;Znn&p
z@7;{KBg9ly|1_t^+%i$A9swL7^-*GBk#FzoqlNwsmu#7Tp7?n?Ki}8KhzeDow6hv>
zFA#ms^7H9`Du3HHzD}pb+zL^?m#_QvJ6>#5@%i}^L|0Y6w@dp;;xA|L^QVYY7W?`*
znLkw=OBXklh<D9(zCyQcF}GGceuJ-5vvhHv^X^yue{Y#zCqAHxL^>9KF?WWTuXMkC
zXNeKV%WV0(1~K<i@ohI>r(qRyFBdOQ^YxihpDR9`;p_B2mFI@hzJ9wy_Kl(sRXkEN
z{$lPmV!7(Cbd2nWuq}SlAH9Tf{6zW~J|958vcb<g5+deaD}HyGujfmBvDkh&*O!Rv
z7y9~fvOK>Ko6q%i3Nz;3B(9(6>z>TNRa`yC*Xe)ae^ub?zWp+B(Rg1klJ<9r<vn@+
zJ>qj}C?wzCec~F`p8oj{h`CjM{(kcOhsA3&aFP7{M}@2M{qr9ekE-$E=dTj;Dt&uD
z{~2*kZ(sNGe=V{?`M(kOf<wvAUnA;5<@>$(nV+rlUlQ9Y`~$xKKZr9+eceBQo#-%u
z=l@A~BYFNCqJ5}7|014I<HJ9HgZM@0{CC9%s(t<Z_r>V*x&IGDj5;pTi};JVn?)8)
z#7O>p_>ss~<MB2ei@E<6Wo0s343_o#i8w;F|IISLMI1l_1*xyh|3Vy26B&|!{#W85
zb^aML|6B3YU_bv<sc#q8(L{js1pZ>~4)KOM|7oea&Mc*WD)l{_hgEssl6o8GlD2q(
z^g8}x?mo`u4pNn$oyPUX`CwmPe^BPPcm8;#uYV!+1D#{l_2>hscXZxb<mXeh#oSI#
zCp8~Xv&G!Q94|B<yx^T1nh&}-ebo5(=Yu1h_q+K1{Q2N0=K(eTX&A)ZW1Qik`JkIq
ztLB5rGXF&9kG1~!R1Gn=htoz~?`c@Z++I%axqkkUQZICl4~^G;&e|*d{Ct@|z`5o;
zU#Fc;Tu+>1jq!Oabp)jMWqz@9DisvzIjNuKoO-6Ouax@f&P)Bcex`F)A=gWt@6>qm
z?MFI;T|fUZdHyH|HzhLp`ngVv8Xxo?%a}XHxnGS3zr5wnc_Vy#Umxc@wWqK9{;QlH
zRR64#=TCA*tN!v4%wp~o=e^T?`%O}x=5*i3*Zumw$oY1zuXmB>*E^$VVn#Yh>NB0m
zs(&oNv6y>_^XOukE#E&Mb1!pxQU;QLz4(VW@_JvVWl9(KWpAHQe`#<Qb@B84{&J=B
zZZ6laa(bwIzyHj4emKt0_xsO6r$p&At;O8yoO_k-Utg|wI)<(<OPy;~|2bOP-|Xyr
zjPK9)f2-3p-Ph}6{xYZb5MS>h^}C!0miT%RL>Kop?-43E62%vD?{=1k)^{tMciPKr
zHNX7Q*?Ow4`@DyopU{a&Mfi)kk2nKE>$fIn(E*g}e~u&OKIvSo+Kakb%zfJVw^~nJ
zAoX84-|bJ<n2+!mb5}dJ<w#Y2t|R9D*7-$<|2t<H-N+&p<1gmE=nPTk7fJmUXOPPG
z^*=hEn!o(=zwYel3`3-$_=~xJc2?9&RZzE$x$B)VRFOzDY+~-)&TpqmRX(YWx$ii=
zhxz(JGXFj2{AypPX(Z<U%~_(xo1g!I^Vk$WpRh6a@6MRnzP`8A|KSXxK#=yuU(Ef;
z`Bv4hzaIOS)1`=V@m_iS#oUjb>pDnPzOyCfe&Q6W`plO3pE`Y2eLXAn&zvXr^6mZg
z);6b&(u-vNSI$4F<01L^-#QNr^7XY4G533?lbSF5{Qo+WuJZH8$$a4!UG3|1S&6xx
z``yod-5*cQ-r=f0`tk1R?l|1f_s35g_kN}O?X!<NM)gmByzJ+CO83Xd{_Z5z9yH8j
zZU?vbXy2bd|NO-LkSYSH8GkYN5ci`?q$>ZTuGO`{*ZukTP<QJbU(bh#xw-Bwmvj9H
zH?PsxyUO|GDEEeQef@Z8e~de$!q@%vLO1vIOMRXGC*BGQ1j)BQ(LGx&IQ;cf4|iBk
zp5M!TYmBe^{tDe*XYl-fZdJLj`|GCx?xiR3{DJO2X<#Aw=NG$UXre*#`KP%PL;0t>
zd#L%|&p*@MqRQu=U+SKPxP$XYy61$-H_BDRTlqiN-Eh8d@1H-${eCz<zuf&smEX@F
z=RU5k4?e%j{c0>ff0A2u7C(QAJ2R9&&Ao09o_~?M;XHnRz5A!OzWzIim^;(eJ3@5X
z#Pz`4e2Slcqtq{RZ+3mXOtyD}`}90tzd`2DbH7&e3q5I%xmUY)sqyQdzrg)OonI;Q
z7rD>V#D}!M)PL@tr26OMI2Lnna7U=|_O#S*biYylK9~9}F1_!M(qHixb8mN#RPk((
z`kn3oH6PHh!+h>8+7~a79>ibFUEz+qQmXQu8!`8n?iw06NFU%Y=04<ZSN)rs4fDCX
zUXAZksW-VLq4E5d_r}4<K=Q})lkVA}@%)s#{V+e@AJ5OaPaNax{&;@QJy+=ia5&~Z
z@9sa<&z~&y7u?!fUmq&<wQf^KU%y=HFS{EXeBB?vue#@i?tfl$$6n#*`{TLU?XCL5
zDp~(;y3>vEIfOa_5<RJnxo^3jtMTaD|JD7x#LuVCqr}{e?u>q1$9}zPUqAmt_dzwD
zeElEpmpG5oBl7$$?qj~H^pD-UsG^bl_1b^jv*|*F^o+Fs%x$a2hp%sQ$Eo#`@BeFe
ziE6(arTusA?W(_QfsdH`gZnde{o5pU?AKGnA^G*~c}wQ{y1#zf)7yHnulwt#w%*bU
zef=o(YwRC+&Mm%P1kuIa=rxlgBzkfgbK7}GP4acxd5gL2y%~!4t;|2rdsNjIS<(Jh
zFIC@C$A1NCyiJhtbo7R)>!;5DMAeVhf7OOw>Gen_Z@!vusM)cf<XxlM?{4YuaPOP5
zrMdhs2mkk{j)>&1KV#km70=x`7IX8wB`O|&d>`$7uXI2ESZ``ydAj^<t(befcbJ-w
zzmw<Zdta*lMOMVSg~tzlu$td=e&s3j%Ky#@+%I?shWr<Ln+Njze%^hD`uYJfz5!lG
zDkxGB{<^q-^Y%CT`;1E{*H2WQ_S5~>H^}n`dZ%~x^*bT3U*%nUps)WR^Cx<jsri<U
zQv3DZ&(E)hz<!oD>_lJp$Nx}oW{t1Ylctzk;#I2lnj`h$-rcHylNFWc%O1XcCkX6U
zd7G5~3aO9qdaCyI=ZAB=6IJ`tlkk{(uJ==;KCe;dkCW$*@m?O{`~OPn7kE=td(lyf
z=gpJ-{8wath4&w${XR1EZ;O0;S_Z}3O7GvQd~}rJIZV~}H!}Z1?{-zcXG(plcfE@D
zY^m3JRRi$?iHZ?(>%9AD;g3YaGUi_F9euM@<@&t~t`5hl^Zog8w)g5$e!g!%#~V%!
zfwTaBG4~3uxAI5RM$Em^drsvqlKNHNwKTCJ(X<?M=X*6bN>$w-{ou9B_w^Yvf1!7X
zvZpX{KjYn{+W$(aU+;}m<?;P3_0G7-KffzP7kAIBk3#-#_C62!yUm-a@_m1Ic>4Rb
zs2OAKa<AP|?yp_egD3bpb*q?rulN2DT)*ENuJZl<^q{v$<@^3tdgZ_1{yJv;a6CW%
zF|S9+-xJ=wD&P0_l-EX`-v+03ai90jyTL!-*VlRvU+?SG4Z66mdi}5Q^{!Ii;+?g`
z*M0jpy?cMo^}l+KIzLC+f9QR8ouBXPAA3tx|M2~N<~>Or6RAJ`y13iCd#;tLYR|8|
z$3pz?y!TXl`~F1ML-V=4m-Q>vetv%2tb;@Tva=?t_VDxDXWdU756LgjfmzR}`tkES
zW%UX9KP>C#xzb#I4*)$sX~^?+>gM$PqK+IP`Qv|pxRE*{5?vN(zrFXlQWbjtb?QaF
z?%VfpPCCrj{qfSvX;L~3i<o<}GdS1J_jz|Y$A)-+c7}v_>z&P`eS3ZX(K*Ch>uy!^
zv(J0k{mi(Yu2%l_{5@v6?@!Oie^Bw?iNiD>w};%j#_^x&);jVz0O=G)7IYeJ?sP}~
zekC10hK|=e@_ssNh9mE5NvHWR>taWKhXdKseA{-GBiku!cHo!#DIJ%7aJ)No?!Pzr
znd694NM7d1Igk9&FrnkRyazz1<Fs5QsgG-^^R?cZr2fPG=<`G6T^#UoVNY@NfTVKi
zavV!K%B}SQDu0+deu0wIY*a6=le|8#Kb`bDg8I^asK3#1t)EId-X5vTP0QxC_dBwm
zlkBJRb=<k6qdm1w{gZSZXBVYYyHI=R<HxDvJ=Jl|m+gZ^sMgORJG6fd**)gS?`Ozr
za^!a~9QU{*_jj|NaO8I;P~6iT-=5w<O7UwR)fb&le#jq9M_Erg@}2U$e`$Lybvfwr
zP3Iq~{Ofpg>G-dL^3pQMebf<SAgP>HkjLRe-n8zZa;_zba(+M(<=8<I<qY}5+e0<C
zHGjWV{ti>+>aXGs`FlQje@T^ZP4fO;QsvvK;@#U;KD^yE*?5yG-`WiOdnv>I@b=w|
z#`|i9{jJNezt=PDuQ|j1-q>}2x;<$<OyhbaB+VBOD_zegbp3PR40!Uogn8npI8O7~
zV6w+NQArZ>#B8#E%aNa8;`8}%Iu8FQsBy3Pt@*o{&fDO~Pe^fpdVZtluT=hI{mJs-
z?cg_2c`=Xa^NL7^A3fjF@`=i;^EHn?8NzvH{jE@b^m+371HWf0fA<;r`uy|M@p@%v
zp0D$1nM8cL9`N#MPHT3uzH$Cp#`&X^PVu+JMc`IQ9w)7HNuQ|f)+_x}lB^z2GVJ7h
zkMrI$?4&>Qx{bHd)AhJ5WC7VDpI;X;dEJ)&aoyJaoa&G2Q|q*yK-b$kk|@6}htAhh
zw-c=c=zLlK7$4)IAGggBa(#pGaS8ds_>lbr`HxUO#?P~K9Qp64`~j+ejU@@bTo-`<
z6zQy<HE#l)2Y=LV#G~;-{;pR3q<`eUK>6UUQ~Cc<`QsIjJ~2Z)T*_s<^oa=@Z&%}^
z{duZS`ot0OZdE$%!==OfCB=dGnpAwxsQCV(;_I&bk5s&CmHxp0=UMyb|84bIpxSGc
zYCqh1$o}*2Zfd_|c>~eEXuQ*HD)qk#NE&~%A4B7ht}`^=?^pScQ9j1sb1MIBm4CX5
zXEI5QhdY)2E0S!y4}^Utc!QPyDw5#crgU?D`Cs$&eAe3hlBxbl*Ila5{Z#z<sy<}B
zV1Cl`dQW9{6}1<R%lRAi_E)8AJ9!_7<1^LqrRqG{&NxqBFNWZFTP!a0d4rVQqw2iZ
zNWzb+$|djL&=2(a+J2d`e_q*tsr2@A9_u&7blkkowsrmMETmjFAb$kx+V1Vj>laD7
zev#DIy<GBB8(arXovz!-+(+jryKa!~^dPR*?yq$@4mCKmJ|*r^%Ac;+l=f%v@iW>k
zqVcNhxij>(IR5|C{){fKxj%#BJt)2m?$5}1&$2%w*CVa%&*0;6)L+^{>i(zOH<!xE
z`dPC5s<r;3`^7orALEhMOYUG-+)H|sBfkstID8CGugBKXar6g$z0vcr?jLf02IrF>
z@|V{B49-79jdLEqi;w&1^7f^24syf$GsE1}_Ge0y_m|ZE%!uUu>3aM?)zc1=n4d!N
zmL>1+B|0DNvQ_!B?$6-kj~T7M(HZu4UWWbQ<D40d_ks-j8=GN&_;_kY<E_lFzX`kU
zPsgYC2S%d5(|ol`^?N-J$^Ds$0Z-oFV?LAnGnmf?lReg><49uM)RUhJUHLu3e4Q|y
zj>CUnH6LkyYyRl5j9cyc^B-Gx$o&%dJ2pjsvV8dX@by$)=C6o!%(K&#TnI_!)#cPY
zdjAvI>EmYo$@!k;%j*wxxjzGc_bLD8`Ep$fJ6S%))#vN{(EdyscCx;~k^3|3{81`i
zy56+?u9f{6oVQ-Z@hM4Gk0+_)6CtVoQre%nR9&|r3&_v^dVdDx)&0JZ_*f^`sd)7D
zMCWU%+fm+M;C$Im7$0(fX1=@A{*2uJME)xHrS-sb<R9bbU6L3-dVHKu{S5pYRDZ)M
zp?cOlxgJ6$wcByvU99|Ft^7Sh68UQ&iT5(;;C)0AywS@4C5rdB(*Klz_rH#BS9vF@
zc+OJs%~v`e-C67N|MUF*lBj?Fuj{jiYOgZYehZcU;BIQaWO)NIerSFR?ayHRnfo&j
z(Ky5SdlHhypPUad{@zpLZ-|O#B1w$*WlA^qD>KC_R{rI_EO@sl9WO)U;eXB3^V$Du
z{GFuQFJHw!f+Q;88l~%by{EF1^C_;I^7;+Ccc}fKYdb1GogdntLI1Gs&tTI<pC|WQ
zV3*SV4D6HLpE(xgqW4e8bp&oUOG#hm%I{65`*r#zA(CH`ybK=`av^bDz}AhFF_P^1
zz5(aczRJt$yw=V?Ql0-3oJa5bc%O9ezEP6C>4EgFB*8Br34VVi$E*Arm4B%^K2OQJ
zNV4+L{h+(tmEWL5vV}PK;%fS?Ws<tysa~?~b^Uh4*Q4m;m(%eFT=6@S?07Nhk2vz1
z72P`md$~@)@kZqH<EFiS|A>6w$D^(|jr_6xL+#TRo$(Zs{T)H;&9>bg`AwQ_F)589
zy{G>iv@JG~t4YVh!g`Xu9r;@!ZTtA;Xj|xrMRXjCiKQe@!n{JVpCiASG3znce?Lr<
zD>mVH*5jxgq_&vcvy^P3WVVu2e#)nMBH2+%xsL@sSLu05(ta1&byG55$pR&*-YCDn
zl0`~Vz0vU@N|q=o`z?-_DSfn(vR-g}tkNr$oTOy6lC?_KD>+NaIZ8Gt*{I}vB^N2V
zM9HN}-lF6(C6_C?Ldge|T&ZM}lB<+_R>{>$u2FKWlCLPaPRV8^*DJX}$&E^GQgXAB
zTa?_YWDX>azh00o`rk-M>VNvU*)R2R)4qf9b2KE)D+S~S^9s#lZJ%~!f28qz3H0Nh
zQTJ{5I-onr4&(YMlE{CNB(8%L7aea$^9dWrxj4?>_jM-e@UQu_PfPj<kS@MnNZ!|=
zAJg+tceN{jFNfq+WQTIz07)Eueh<=Nuh;SNKKIw|PW!wA$PVQlMiTQ=g_3k%O8(^h
z!pglb#c>DvJ;@iaf2Z_km0pLT=Kju=-}g`P>iY_sANl-5?U(hE>p!1`Y{vO?-e&Rx
z{RH^o^)(Ro6z};;K0@*juH45WspFQ{r$4%KKQe2bE8l-bes%t-#6`Z=KPDYKxexZb
zE97+&`FIp1%kwRjhsEC&_SEhLbROE5#uJt6HzZMxe<-Qzy)$&W9-T<Xr~Cbr+Kc8v
zs^4VoPFLsaeyhtb`^kEL|Gh0_cj7_P^`E%ZuEZ@P9o%t{#HD^j`^1^@GhJ~^e>Co>
zJk%f4DOa94FJDR8&m}+9A1J=FAt^rU7Zl%QNQzJPU&MEr%Gc$JksZ#b{ce&p{z=k)
z5BVDdN&cvw$X_ia`J?%i*VnH4X@EcC=yJ(+d{?z2q-;l&hvpr!I|Gu+b1o#6r-G!}
zercRf^~K8}<ANVqKajG1P>vDGZZss7L*AF89Mg<)q<cQy*Yk47`q-rE12V1pNaK8K
zeZY^b56HCYBaQQQeT3!*e9fA?E<sW`T+HVu8}%>i4f!-rwS}bX2HDAZ9{pu7>F7_|
zZx>}p*BP>>aX|KR{l@y&k%pb@m$0Mj7WKok={)9F&U^n><%NtaFY;x1A(JXE>|}W%
zBg@O|5|y_N%I(Z_<mZ+hY!cD@>fGdyOXp^P9q8QR2#UwK)n5lXw>kcA1LDp6RBmUP
zzYcWp<^!6i9DE&Z0m<c#{1~2t4|(+`{T{`^n`b2FA>|J@`!vrv^rj4w*u2S7GMglB
zLZto2%KqQVeyg&_`@N(+q_od=efxH<$ffi5b$$Oi{&maQ&;NL!v%ia6<nQhJ=i{bG
z)(52Y^O^DkN%IuhbyQN?9i;3!D!Y7T*In7+!%wo_da801sB+-zKxMu4cIEon>ErtK
zR;bF?SC#K1*RQvJic_RGrzn2|mA_L}9C#io>j6@hA76VZ>+K3<f4Q=6Q1+K9dq^2i
zvpVn3>O8X_JgDM%L-|Y85AIX(=zeg&ibwZ@Un(BPk1Xf&iuWf~f3K+edsXr9^^Unz
z@6W07oBeK$!CPzaUR1nks()P6dOwuqis*N;z7A03@1P{UW>VJoUsQSDQssSHwd)2|
zF7<Vj4z9bhy}nlE`$qYJlz#BxOxf=sWxs=+>`#!gK5%{>)eEF7Zwmch+DDAT*5a4>
z@2GNaRONY3mFIoczur~xeXrt!l;`1iQvUHVURe(xDE}WS|9@Bhab1!1hp)es?ExwM
z;<%Kp#kX1c|EKc*k@CMq`N#D@`ro1aLrT9mo|ON8DgXHTPuX5um4EeNbO-aZ^zYys
z^{E{prC%JEGNS*HKNrO;B8fecN|JE4h~%FBZ*#hP`QNwT!udCJysiJckM7?1+?fM?
zA0dDD5Fg(X^GV;=|D8X4y_|T3^mh228<J=QbS;6enUmjq?Bb@Tgmhd)t4X4hE+Tm#
zeg}x;LEw@^r`<;K5O7gOw-de}gd{pKeIp{iR!%G-iJP+~l856wlDR^(knDobY9b~#
zCPY5TBk(&<B=c}SNnDhdkUR?Klf>d+1Iez4m*g?v?g4o$;w6biOeM)~_<c2!$D^J|
z;$qrN5;rL=B=f;V9lBU_<&(tXy^Lf}{Eiz*T-=tE#Kn3Y$v!xbWFgK&ox5117m&nF
z$Y_$-{AnPGi{NsSShTDoiABj)lDLR>L>sw9_?=9W15r+rr=Xl9Peptri&0LJgM`>l
zaxmgUo8s&0#1N80@H<r`hvN4iN#dqy70EM%*hI2KV3Pn6i<WLAhoK!w4o6%hOYu2q
zl4s%f*GOW~yP4!j#D%`%mZ3gKVzD!Z<S6tTlINfvNsdPSlcYsD`jmSfI3#g%QbuwN
z>Vf3XU{CS_{7w_ea>PS&tPpwVgKh=dndCV9MlQ+m=$9lb5kJWZXkU^OVUND*PJ%tj
z$%upGh4_6tl2h<IQzWbLTdyRif<tne5V`2vZVmb)$y)SdlGD+jNY<m?NX|g{NL~yc
zN!(m_##nG?p}tAZ#_xQQyaeq^@=~-b$vLnmc^S%wF@vwC6Qv}tKs+QH5D&?@@K5qe
z)ECB-I}i0mvJw4;<W;CIl2^l?<TbD-xd8r2UJL&igYH7KBgsW556Q)7N0Qg!H+M<?
z9PL7K3C<&VJ^CBQta}5-1<7Av9w50C{f*>}XdjX{BOa2spnsFR73X1$ySJmCl3a#<
zK=KZpNAgaTljL2PKS(Y||0a1i-mi!`!Mz9Lg5<sE4<uKhy-41N@{+tC<t6z`l$YcK
zC@;we!Tky3LntrFhruQJ2<nIAW8ji(LjNH7INF)y6KJoFkWb<~lB;kY$*0f`B%ek<
zA^8mY3CU;CPe}d>=ac+3&OaFPIh;>&HO3{$-ymL+&x1?yw}_YI8q^cX7cgE9f&3ln
ziRACWCAk({k}rZw@+ELdzKron@)g`mbb|Z?`T@y5q92f4hx16jhVw|iF2ov=f5P}A
z*^J@V8S>9KkK`LTkK~)EUy|$beK#ckf^kjqEtHew+bHLukQ)#m$-knUB;UcfCiyPn
zBe@a%j^ulo&q=<I@pBmD-*EjQxe4Qk<OjG8ko*wsNb>J!N0OTn*Wr-=Kz}9qPmBkW
zA7LIRxdm~N{1@tj<iGJ-%OpQW`Ent*qTi7G1pSoce^5S>pJJSnY(cw`{0zSf-v#n>
z*pvJM@sQkx_9FQu`ZdX~P%e^Rqg*k_Z!oWs{1){_@_Y0vlG|ZV@(0+H{I8H-_=K<5
z6M08K7mg?<>0sZUq>KG9k{<TqNoL{m5+wI<#5R(9;eIL)vMuh1NMh4%49R^Q`FUzL
z8}AP$9h;2JB=P3r?If{z+Vx1t9PDF}+#mKN+v9zQBoA=J29h0cA9NJtfw&JNc@X@Q
z{D~vxlkAB1C6GMW5t~RJ;)pg!Lw15a$<DARc^LeYJRJT><~m|M$(SQQFzz0K`@OEv
z^YH!xl1CzLl1IUw<k5(mWLNB;k~{`+9|L(T>Wk!Yc)mdro2W}k9*@tBki>_(Hjz9L
z<vJGfWN=90LoKBwe~RZJBnLWTImuHU@e0X7;E)^)&T){Zp?*mYal|B&L%|_=IyfZH
zKz)%cLH&|E6ZP8-au}Y=kQ|QvE|R5a50Yo0JxGp#J;{-{|2!TN53PrgJR9+l9EImc
zB+tR;a!8IwJS5LWJSRY&hk7P?KI)C+7}PV#pP|2yyZ{`M<#>KZa;zhAPlT)hhvYcy
z$B`V5=ei^-@xBj|RgTz9asuva@*yXJLvj*0Bq!tf5y=Y?56LO0H<Hz8&l9FsRi98_
zHLL!F^7Dp`tnbmiykzJpr<RtM4?JaP`LKa!4jNfH@YF%wdycE9n>@aJa$WuOs*0&Y
zXAT=#-o5+yNfpz}>!(*tuCE(9bI_nc)9VI}n4PA_@jH1OpQgu}$TC*f4NA3$+M&IO
zX*g`X7H4I=7E|@8gSNLcf=<_A!dgt#VRS9_oLE&qsC4G!nQ7LfJ?=j6T0MDMRpvd*
z@{UNgw9&29vvx-Ppj2H(S8E@*99J=ZO7d=d`7?(<D96p1kYMiURR_=GGw!x8xupW9
z;5w<f&TlW8v~~_~WRLPeh@||yk@ejRXG|MkF=OJS`tqt-<Ev`xC)Z577&(>IrBYNt
zWO@ot+ogSI(yT5EJ1pVlp>T3dT{+shs$lZ8$ryI2#uVL+G1-)!k*-U7OsTotxrKMS
zSkdLL*Nh3(H8Te#UDBQ0+RGZaZT&L6lS}(F)_2CV%BtzQv}w4tmo)4)rG>?W$<<Xf
zIV9samGVxWHZh@FG-BV1>gt;D74<dKhthIm7XpZ$HhayOM%SaHyM{3Z*=uDNo!YyG
zoYyj2PMga!63!)TK25Fhdg2n3at%k%JiY3xs;g_$cAB8sQgoW+m@b?=t-RvmipkZ<
z7k4Mm_5!Ej+33Iau2xW6RW&8~(i%SPWlhg#E4^Ss^^CenDHl{bwHLHkdQMxJW~ggT
zOu3}mX@Zib=QMgo?=`-<rml)g+WKs+8a~=#_a5ctGpA3kuPUEfQ<+i6-OI~y&s&*-
z-<`&lz5n;En^ZG%YQ?nK<CCk0o!r{nE9^G8tME>)?IrGAHw`-lvbbsbwHJBU{o2dh
zs}5J)%olf;-P%jrr%tXCGGE>dIJTF#cip%dQ)@F{;J`07r4la{;<p{W>9)LPr*b4d
zlPxl^ot5~mGy{$k^mu!TlUWr-78v*E<LYKl+o>v2aBMGd>W+=;wY>)w=)$&s8Ax)D
zihE3MhB8WN4?gZQjZ(JaF{M&QUjlV0liA4CixYdR^scL#RzH1qaW7n$Qt@VwHCb<c
z)gE&Vc9X3)*sYf*$v)DmBUTi9Os#s@d4@^XQBupFG|FSI<5OF0^PTG09$4#+k_t?^
zNo|KLxxU>a<z=$=YmZm=a`GEBX5tsE;^a%fx}&|-d|$24PO8dvBpGq0?;fI@B{$3M
z)U$TkC961lt0h};1@XDbe*m^?-i&6*h%?;`QO?qAhFy1=)KE`hK(N_0wN0Y*7?De^
zQ<ERZtk}w>y=qf&nN-zEhf%YVe!v?&Gw3<4dn<FC>CGNxvfg^r7HxG^acfjI*b__~
z<bhvH$}Y|?pN5@-VTqT=#!yYtamF1cUs62}WUQn~IE?IB$<FF2G_Sos$qo`~-bvF6
zquMsfNj;5Tlcwj0Zj+|R<ok^t`AODoL{W_)lcdAsOR76$l8#$1X^IY$D5+|#nhEN?
zD7#+NG(9F?*2x(!Ycd{Fn>iw?G15^|*T|ixkJhga>XJia2kVfi#@_j1<4(MYj+#+U
z5`98nO8-Z3(E!}_`YUT?x-X2s6D0$z*84^#aS>f(S20loN3Fb0ZSB&$^Sai)`bfi(
zeaN@&D5)VY-S8Dd;(FF2BJt)_{_a{_nvN3}(p-1jTcOx=n8bvjs#9MnlXTpANi*j#
z*=42~eBv^)Cb##(oh!1H87Rp`oLR&q+9yrViG%N+rpF}8n%w%(tb~Z7rspvElIl*H
zWG`sFq$xT~qNGVK4^ybrG(9F?*4CDXsh2f_9(S5eGS>Fd&v160Qd(bV?9$>eg<8%i
zCy9Qd=ijszhpER!gEIAnp~=~ui_o1|t@n*xSsj|Vh<WXQgb79^8Y+eNb?!8(B0}k1
zUS2<Gdd*C{pSiMpd_`UTDSa;P-X|Z4)_3%XMO2KdnO-kW7+*7WDxQ;ub`&EVC$)s4
zH(RIc(LP0`<FN)q0UOi_9>e0z)2S9wJG2+kcZknbOsSfFe2sjMd|k$CHC>PPB2%rV
z>QPsMeesM+NY|mgh`z&#(`#nbiV5@{z8W#14)3^xsHv@*mhlRnnx;p4>8XNK_1J0!
zr|ZyOL{#upQC?nGkB^s>kDoN9d;;Emn`R~0`vg@&x*qLiPRC=b)tYJ%wL^OmQLWW}
zPZcLjtEsO#;k03AA1^Bz&(){RyfC9R+<WrGX*JWU22D=dZF1}40vclY*vj}+{kF1(
zP2I1$>_jg+O}Eo)Dl6(MlKMz!(vH!16-n1d(ih8gJ=*&o4G(y1{f!jCN+j~xaAD2G
z>T@=!mQ#-r`^11TlCDF0;HfxFGWPEI^j<`|;7ph>XcqRr<L`XwLq{toPftFEosjk@
zl0#;!b!8lp(WQa1N7gzjx%YM?H5;@JOC_$<mg=ptqxP%gJq#Z&sH%|tE0vN)4&}bJ
z^f6Mp#P344wU6d_x2>(I8-#&UFaa-y_MJKoS3P{7p?=UV5bfP5DPqQ|PPS=OY-y0}
zakWay^eBmnDmhj#wWTpob{(I}a%RLC^tRj{{4v_l@%XUw&d)ZJ@34xW)Us!H@RM3-
z$WJih%LI~LdIoJ8Ii>WTMW0W>GBM+x<tJ2jhvUBTnqH5+7r)eLj9mL1h&O`;UXvR+
zNi`k+#)f2@FDb``^r5i2nyK=;ATsK?fIRPpPJ!-*FGHZalHJhXQueGWIeMMjOMav;
zr4k#BXTMIwZ~KxS(n-1X=ZW!2JKbrXNKjfmPh{M)o+mQyn9mdBJdJrGL0#y1BKab#
zri;E&jn6+R`;C5>7tB8ycFg9V40~4dPx4-q@5XAD$hd3y?J;t{CF!we%s=+t7N38T
zFR?LE*spf9&yZ?Kqx+fin6Ysd>|CT;&ggNLhToujrM5y&17&myd*flRB-J|6S2=qx
z^BtzqboTP~s-;imQW?{5X)oa}xlB+>JiyCzDKqbq-SsC`pGjS7Qgxc{00?m=$S<78
z=t7m|oC#@qwD+@gJnFG!?`9ZVsTNT?v=>o2oLV(?Dz<jT1i3yH6Xds9_%%^AseHop
zim6p;){8v~s+V*<+QUf4qplcx8BsB*7EwF27g0K#KsQ4fugi2j+6zi`nW{$}dcwL)
z*P*?LsLRU8kENR1I<(Uh`hrh<Ki1CsJiRMw@tmu2(1qjEY$AJU^?g)kz4E1aW<AUD
zj!4y~?g9zw0Bhwzsk)3_BgVhHar|!R3b^B|n}j#b;JYD{E_HBWQ~PB0s!-nznQ6D|
zyCIWyZLIF?<@LJ*ji8+al-~^r9NuA5Uoj4H_EeHlPc`(rx^?5)rwsLJN_<{^#K@lI
zsd==AVR}sNjq<6LwudThdcLE}t$k;%Zo6l^Zneks;<xt%x*VZrrL~D_uhDco>e<a+
zMqH0lEuwa4FJdYV3(LzVPs8+DUV$$Rn>4kme)9PEoBW2BUTiP%pb<2njqzWWUtZQ7
zU-mk(uzW;Wd9roh3f~^!|B635o$&i)Ec{tNF1~(u<9k{fzkDXTVfnNfQ>&)qJJzcw
zPsJCi2OY9*cNeL<rAPsO>W_=B{&Dda?rwbQ{bBO%E>d)VnDFD`tA1R3<&TRW_v7Mc
zr*mn_;I-k$#n<m{eCl&S-R>?@^jt9Y$HiCwxcCcqH$L_LFnM<uDY`#Q_;K-7KQ6xV
z$Hk9JA76f2$?#JKmXr@4Jb2`wvhuQlr<4pz`feuJ<4EoCTtVH;idx)I_ez?yD<43t
z7&&No>L}WBK~(DFP}U0Gc~dk+)GmB>E=5whEu}G$8!72J$A(oZ4U;yehmYAkF?3JD
zx$(Y9+D&MEgB?{r;tbhu(|DF^Un~~j9W=Fgd)deW47@bFT1UYk<#l|zUK5vfqF>f@
z9Vad>98+<n<CHeb^iEWwGW+vd&!p!yV^b+pZiAr``7TsF4<}z<{hnQ24~eQc&3f2P
zZuRzgrb@e0^=8U(Qtu&Ptrj_@DQCJ)?R_h})1TDC2<^}wwBazdy=d(^x~%^0ezIGx
zMm0p2TDi_#z52WS8LZb797ew#OJ04GANfgjO?=tta6E!aD%@5|N7vP)OQ*jtBH>pw
z^%-ANJA1;^db*^h<JI14((=0VlR<lL_pkp+7j|d2_A<xaM)vWYW;lBp>5-$X(A1pS
zOBQ#Q<eZUg88N0)X!K<35nVl<&=b@nMs?=uF&Ss^&&%nnNq+RGjob4+-^w}aJLLQx
zmz*uWmJJorifz0s-SLeb_<rDO`5(RifIdT)U*4<gVthHrpfoQK_7>_zA6%_X@L|?8
zN%mooNs?apM8q^PGcjpWL`=I%N^-mx;&V!q@xv}v=t;QKQk^jA-mnwJ9#KL{8n;ym
zTE`kh8t&}@^s>57>1HVU3T_49I+6INc~n#Nom5eWFVq;1Uroe=_x$o6lPd?&ilX%s
zXVg{MPE7a}-@V4y&#tY)4_IqNLQBkgl~v;}t{*ynJo|8NtEVZz_#^;$23(FeCiq{x
z(^oBo@nO4i{IJ<{`7@RFZZarI-}tzp@~wty27ObxWiPXq+ur|DDYx(2R_;jONv<Q*
z%2v-{_G-raU`hwm`#|_oQ@*2XWbg8%Cl}*h#E!!ISu%&xQQ0fX78QN07jJ7xKPo%Q
z7FF6P9hJQT<59&I3WKnZmTDtuhCQ6jFrx2w<5jjxacG7;j?6H0T}8DA?z^zxwmVuO
zJ<qyc>}B@rW!F4M)%dP?wwGD095G4l{52B0V~LsxP;}3c5lyszF-D3JX^_29G64!!
zj;TEjlfPb^=nD>L$fP@F?7bx7Ey^?H)SqU>+G#XTqMz)1SDhBC^)dUuV&V2bgK_E3
zX|Kb~vZCt{H{k!fxRPPXZzH4IlIb=0QnIpBhb3I2ci)A_se|(At4wzO=4&<}QYc7r
zPe}&RFVw`}SFD@GUlaLbFa_kU#Gc7=B=@B<s=AHkaGIg-%6kJcT9720-S29~T}PU+
zYh?5<xP+tBlTDgPeFK!v`y(=1kX`BWt+qky`z&Sy(pWa1>JN&z*z)Sn5G~=wHZ4|s
zMzTgm3uMX&Rz3QITx`y4JucmWqhSfJfV&~E%(CKx&02{WVkKFLi7vOhqY^X9YNZmB
zVHuawQHhrkdVWjzEKx1TllQ1UI;8u!eU)c-Tb8(>yW%z?e(hFQdWK7zj@zix?lk|T
zQr-y1tQ**G8SU*A;c@5HrFBlQ`;F=c$qj$I->CAM%d-p>cNg3yQCi)<QfaiP%1!Dr
zpL*S@Hf!Z)0_}dIin}X*qiR?8u~rtE*87$u%G=79K-%jes=PZ*3#s&nD95TlL_hmV
zy}Y}06O(eSXPy>SWqK-2>y9Da*k~R|`Tg6ex7)7Vgrpo=#$i#d7L1_Owlh(OCG;H!
zC-l`X3iXRVh}i#n`SEr2-Fxf9@fW@Hkplgqr+(4Bhkg}*(Y?Dqgcr&$xZO{n<ENGm
z?a{kWdA|R$dyn|bzP<Fp9zFe+vasFrMG9%wIYM~MzIurx_P;ea;HZ};_7s9%@2T{H
zz(l^vQu?M|LhR4-vT_{J0s2uep!3O&{(f_a^5;T9D#G8<^g^W^C4U9Gw)9%rtvbsQ
zlt=!wuQt%XJ2vdE7RS2dPbcl~E7);=YvHdWjL09wMn1`(8AnINk*)0N5Qt`rx-hp1
zHaHYdn!9~^n7a|&uCO95l_wE5kJaBE%8qP5>lEhZqf9+;Tqn)_1a>^$tPw%H6p!Y9
zc|zD<E&TP@&LFkF&tS*>b%wuO<Wn5`L27?y{S~tMyOh=6wpn3r6Y|c6ADuL}1$La<
zpT$A_EfKevaW7}w;|~aPbI`xgb>m5MkAWTMmVrxo6fgDbMBGxwy@GM~8xrQ0f@|xi
zd&7=%E5W6HN!*`AaK|ui1LHQLF`<e*)i_!LSp;1t9d85dIJcT{F%%QVJBe}UGVUWk
z4Rf2p9igF+n)@K^IJcg04~^i~Gwzj)`!}O~^D)WU=9hPk_MOAHxe?q3#+}Ew@9Yzf
zcPzNJe)SgYc)X2_dqf0x5#u&8ZhurH)Oh<Y2loQ#I_Y{Y#0$<{#JESnI8lGTg>kQ9
z+>-WTE;%?!Lm@SH2<$j_DdQd!!Ck?)S2OO%M!ZGf@@tajeq_YEjB&d~aGMzS8peI<
zv~au);M&IT<FMoLu3+2~Be<&>cRu4jF)GYm1MX1x(MiYqDC{_QCF9cd0jF87Z?7=!
z0>-@^lPlDCzskWyXrP8dYVOUj<J?t@OZ`6)cRk}?%edzo@s0%-RT@v4dyWzBYQ`;$
z;BI2vg^YXI>EU>rz_qpSY}oO5*D`Lu2<}$K)$=&jO$jDBUe7Jy+S+#r>^OHFxO)9E
zAcFf1;~uQ+i2G%Im|KKJ&`2EDN!Rmdu;bj#j7$9?QTt}?AFP{x&g%J*x-fS+xMyl8
zq~<;dJI>t>F6Gg6usDL7!?;Trw_{D1+XC(z7H$XFac=fVN8~Fm^}|H*b_Q2pr*B}~
zdBeio=Dmc#r6-<ryym(okNNur^Y>_V*k23$#p2$A`ZN7?WB!&hfA694p~lB~E`ms=
zd<D$kjm+PUDPey_@Ygws^7Uu_ZesqPnjQ8x7XJ25!e24-cQf-haY)!-E&T19gufEz
z?-u6of|JAk8sLwv<2og3-!kU!R_5=jqOiZFB>jzH{%&LbPB<{^Zxj5{`d_C+<*Q`=
zZfE`$v<v%dNzz|6{1KPN?=t4^d<-h6@%~4HZ<Q__q%Pk%u;b&hKgK2Hkw04RBpR2q
zSR8jUu7`4S?ix5pXz`@E<~V9#aoolHor`hE{WZhiz__;{j<aFM<0wHKD2j|@JY=Fc
z7O^;%Gwxf){E~~okxU#*SsZsWe=*}am=AxqTjDqjc07(U)*h20;#kh&xQB87bcRuX
zNyhO2i{oDAum9q(zfJHr&Jsr<?06iNERLxWajat8`xtlbbzyEP*8A9Mi6`B!E`uHC
z)`Oc1E9%d+kcs-i8diV5WZdP(zCaVW2sxfK*X+-)us9xI{@%q!1!{a;u7ST}<KBY)
z{5I@(97|dK&47KPIMy@ngN%En!EFK8whp`8;I3d?Y#AivZerYr7`Np3aJ>1LtZerc
zLtw|_T?MXQhg}-M-O9KRGwv7N!rWSLX+5WtZnsZi$GPhm_i`8~s^@PQcO~P#FfGh&
z0(Yi{LTc`BV8^+eSv}8<;AXWC=6ih~KxJGsI?T=A7xN3srIY5)haKl`19u3FXnZt6
zCW<$QaUWyxb_a(rdLN{DKOvem6jF1KhaKnkFAMhTu8H7wX53YbJEtMcU5?55NDFrs
z>^Qd)Tzy@*HiFxgai3z`)t802&EV!+xX;3lbE_G5aRj%3ai3<~uh1EJJyXTnxSzw0
zbL$y*Nd&iuai3w_g$u*nd~lDWf~W*lrfXowxpTnP<M$V^NYt-N824GmegE7rcP#FQ
zk5?=bn)?pyICm+ylt=yfCdfqG(Tw{m#$7lu%v}PmXNwnhoVx<tBE`Kmf?LVB&oOQb
zCPl*NakL!!JGOYY!j5w{vv`+9aBCTNHRDdf;)rvb!7ZW#D(QNj2s_T*#^SvTwu$O_
z4&(lYac}Dx=H_&;$9og(IJe;JpndO&;Lc~<=NWhFxG=W}TwD8YfgR@-gIfe1^{e|L
zxJw!Lw~RaYj4-zp_Yb!Ay$p7o+sNX5AcDJ`an~^JrBz{W1GxJkUnkwZGhxTMOIf@R
zM{rj%?hB0jGBzy<qx<ucgY5DC9(J6&p2hoU1ov6S{T<_OuMBh7fNN{tZ(zr{n_0Y%
zM{w6N?(Z4*fj(hwGd81a?YjbYoSQc)=+CPnxXp~amT@mL;-yK~7Vm5$-U4uoz@z^B
zOayl$<G#qaXY~%pn{%)|-ZNpx<E>}${yKuYg>heE-2WQ$RS~$hc)v5|t40>@Zz8zc
z824qyy#ufDFW#R^53$Efdk#F_wJhE>5nORVu&#TBai<#dRRg%Tcqbe4)p{21?<2U`
zjQa=1JqPFTc$eTl$kv}n!j8w=;hdm9zZAjk$hfaE?td!6+%@3Z;{7-5I5!X6BJij`
z{~>~#$GCrF+|x?K+-7X9+2TDFcAQ(u;$0WP&1c+ojJw~2FjpLEk9Tj_ac(_}_fHYr
z{*3z?<Nh!r%*{E>9`CoX<J?s&-Zvt+Lm2mU#?3a?S4H63+P96dzFN!T{YwP5jB)?O
zxR0L|j<@u1d%Tapj>nrdI_S?EBDiB2x0!Jl8|~Wwt}WgLM*DUEw+KAy&+kTXs~Pvt
zjQj2$;dqzi+T(p2c0ArP7VrBJ+*yqK2IG!6Kg?YNt}WhSu;biH7VifU+(yQIlW{v^
zQwC~$es1m}#EZ~%((9a#u;bhn;O4@J>UlFHguFjA_j8so?s~@kZ&{eTJZ67B{T=K$
zcP*>uk0Q9s822xXyXR?P?j~?=gCCuAye{lGcRjd;Frs+>4Vft32N?G)#vNwF+i-*s
zgORV3=ALfEn|*F@Kln)mcNOEl&A5l+{*o|yJ=vTm#LXHCsksNkj>nq^u8y}Qg1d%s
zH!$wLxDaw~?U6$Cr2{HyZd=%K?id#D7qCrK&+8cXuZ(-}&@i{@D0}-J2s_TLXYqa&
z!QH^P?=bEPqkT({7UB#`yvvRDT?uY3c+{`Hjo@x(+;<uGvBBYZmv<H7R15cE*ztJR
zv3lMf!EIsOjf^`V`*VcR{i@{{A)bJ)lWyNe*m3S=7Vi!iCu-mAjQbwrt{WQWHXSR(
z(;5n?xv#*EbF<D1>e*HPXg|xGuiA77)|2lu?sS7&dz=uTTDa2;ZXV<A5y9=ixPN2Z
z`_2x>JGPq;Z&|o^!;Z&W3@*BY>{o3fxVenGiE-=U3~Ic6i?FDB-NLPf9p_dv?miLR
zZjAc@<G$Y^%*{DLh@V@y@4$|8mx7C1I2kY9r|W(-;}+jvd*x#}{1qAgsLz=FppcdC
zLsq_b_YIeC6Z}1B_#^dg*zxkMWc>iQO7ZfU++xQ4JLA51Wth9<L?LK?)JgaI7huP^
z>sWgn7{M)N+|7)eH_PDW3-N)5LTYX<>^OHD<93YTj$zz?FmCgrFt?$*5Lo)eljg32
z9p`pFKUjBmir`LS+<!9ef!Bq(o4_rNQ-gT-haKm312-3TG>;z^!L0|E<{h%z!nh+l
zg}M1Xl6zh@hsE(P=C3=}HBf``3xAj@<4M=w@v!4@l(70cA|j6YjQelK-Owe>tpyiV
z7*CqJ9(J5NhH;OI;4Wp{j~VwK%!^Rt@iu{55T^$1b|>sOw;EhMZyXcBUCy{$8F#3`
zZ2@<Hg*(XLHZpFv2<}S8{e*EZoEDBZAN#$NE!+vP<MA$I^?YIk_gTih2!3fkrN0+z
z!`$WI4z+M!fF0+qWZWJR+_j8b$G9%`t8iMpeOti2+`|1Y8k2KZvwH3o!EI*T7G+2A
z=FbgtYtgB&l#M6dpS!`1bJv5b$9Z7{cO&C|#<)i#IH>V>mxG%hrw0A`2-tD%M#k+I
z!QH~RpEK_BSA@CE3An$89p`Rl+yN2XZH)T`<IX)V%oV+a_!aVX()D~9>^OHTxaewf
zJ{=gr6}b3iE4wcl_ZQ$0Mz3SnVBeM2eL89G&tb>8W5xvB;s|aw<9@}sC!=0DcX^=@
z&sn&AVaK`a827XYZb!!bnsd(#bH|<}1U-k>Nypn4cAVS)XF<HDM{x5P_Z!At(=W`;
z>2K$*h8^dwWZW|&xcQ9xE#sbndW9Oa@5y%VX|Utm&KCsnmPT;<GwyecyAAz_b8CNU
z=eEF(a~Co0$O!Hb#{Hggi`+0bcc2jTz5|_f`}T(&=Wb_QY=I|SpO!K1cE<e<0K({T
z)O?Da`xR_Bx4Jy2XWSYl<c?+B9~k%FrD1MEF+S5p1yM=I`%l<$?ncJNkV?p{X59ZW
z?(&ggZV~RUZS&PK*l}*j*dSgMAt84b<L+SGvJqh}y$Qv}ErlKDu4deE5!^<`73d@S
zy8qaoVeXot_Wt}Z>^QeuMG$XQ1a}GJI*j|Zv42&220qsYKRW65{leJ4S_ZDZ|D6=U
zUB<XB<Bq`nG+}gqZYdFh_8WE5++nce@vdduDG}TU7}sOmw@(jqH(?&$q@j?S`zGu-
zcPrygi{P$e+$_dDZl5rB%`p3V@@Uv`ZU=NGDiht$Tol1w!?=4e?iX{z-2CA}bb%k8
zbiAL!j&t+C%~#y|2<|$@rMA@lxpZcjJGNAagDl(<*l}(d<IarWZeZNK7<c@lFt_0>
zAr|OhA$7dvu;biDR?nA2a5pn<8^(QLahRKf`GMB;I%)0-*m3SsaB*pr?R!}Sw*_3i
z-ra|B_b~2jmw>yshC*ttxexLUizA!)yShs_j^*%YyRW?xc07)Ctp2Wyh$9P~K(7<`
zW!%5yhPllNxPOKn=Wb-&t0K5LjJqG>b~ECo55?H-r@I>QZe`s05!}v<+m3O+J}w+@
z5x7{2#*=QhFJQ;x-41R?SkZj2FoN5aadQ}Vu)%Erw@;iJ^p{f%Zin#!_qqsf0psq^
zxOW)bHQ?Ir<8L*%-5B@!2yPMMwrAY-#(lgfv%l|kKjS{W7+h)ts^_H<+!Am*D7%{=
z_59ap+)p=vi$@mmq}#UvcD#Md824tz-Rqcee`$h0TR-(+$Ng2Z`n#3+Gv|Y`to{yU
z_4m;9Ft-KVx_A^pf4LuaoI3|xy*^kL!L4TXcN_fb`n&LuFt--#fF2g^1lV!z3Ks8O
zjQdMWVo>AjjVAcREmAz`_P7^z+}~>W%Y_y7gS(kOv;G=b{T<Be@48uGZVR~h7f+gd
zE$ldVBa3521a}eR9>Tcm+lRTOqwLRr>3x-)yA533?|&J=y@hc*G44N44Re=(YwM>U
z!j5yZDue5rexE*F@638$!ML3ncYib{iW_g=W^jw*wH)-*ePPGB*^K*0M7&Lmdnn`f
z!+j^`=HPkj2n)9l>^Qdr<2FTbS2ONmjC=I~VQwwBw)y2s*l})W#(gq^`wHV8&bSTx
zgt^PXrS*$Wx<Ai>9p~mT?$Z(6^^BX#xSQLBxtqYfKtmxlcN6S5w;SWqeH_g%wtlsV
zal0_?w*AB0qS1KHZsE4Tj&lnbcXb4JE91r(cPRqGY4QHt0B%nUcM0q`w?E_lHiG*N
z;~v4di;eNS23*_tU0{sgV#fVl1UKs^!TK+cac@Gy@OZ_!{^x#m$hv)RfE|ywgmGVt
z;N~#yk&Jta(Y~eN7HKG?<_<90w~TRLiQsl-+@l!xr$)R>5^(z&@s45KKSpr7GValg
z`@^7cJvW1EYu|5S$LqP0arOJ=Y~!eaaaW@LP<;9KZRapI=REs!jW1!xxz*rygb%v@
z{y8GvBF24`aqp}TbH{=^68Spm_Pq^uoZHB_>m#@&jC(Ar=TUWG?iz5h)eujbI|6o`
zy9`{)qj=wr;Erb8;~4i>Q^VYx^X;E|e+qV-yAs@d#eFA&TL~_;JC&~+<K|;O1E<C3
zs}^t%g07Q}*SwxrGk?c3e`i;R{pE~F?sM<;%-;#j-?gZGUcMsuOQw8tn7<R5zXzv;
z{f&h`blrGL6mKK*m(To-njQAn0DsBc$1h_3x-)-2Ee`uz0)P9)OBc**W_v7U{(3Nf
zU-S?ATMmCmB;juv^VgI4>r@o>*PNuk70h1&^Ebak*q``Wa-Vx&$^7+V{(2bejhrO?
zt%5(jztNld>uFq9bK&n<OZ}Z_Tvs=;`9MFvw9UI~SR8#AcjaE;df5anLW`$F{qz+U
zM<Mg)8va_~uPE*<=vV(W_Nlib4n1#t6*0f8XL0mp+)dal;Nv$Ri@#*z*vR5IiTS(7
zxDFP<-&#u?cN*8hZLB@?b0J%MY+-TqW84Gr{Ef$vQ=VKLEi4XtwuI?d{*AjT>@OGo
z##!RH0Cs%7&%(n3YI~Z;h4N>MV>{!X%(y3A9p)|p7fbSZ(*3G8>^QdrxVf+*uHKio
zaogZcO}fAQlyMKn{XVb17I2f9Cv)IWkIN$F@7u$}{=``Oe&?64<8c(Q`qTTswm3R7
z?m)&}ZgBI#wXMUJ8QfyV)%(CUZdb-Vg>gq2`yjR87N9+J((N|F*as;CSFgkL{;7>y
zz__O}?hnU=>$z#HegE%U*ztO<W?a3WXyX<!ZZYGIGuA^b;Lg;+Lh5)gFxEqjte!h4
ze>QFj<Gu=idR*q?zKQqK+6wz~({8Zi@h$~-2>j6a_(=qJG~*6t@oq#X=iL19_Rqa<
zfF0*<1h=c=>U|_zyp@bQgmGgHVXmmOzmMlI*l}*wgkYTOeH9zGmT`wN?my>*x%uGc
zBMzN(`+f*J&dp}r+=zOf!?>q2?hTiRxnmP>uY(=uc3@n6-))O`KI5LjxQ8`{xl6$9
zN)4`(j`tAQac*aD_4w8Ip*HSP#w}soMYvDo{c25>{c}6>VaK@z;8K~WKOYlO&&wJ2
zOvbIjxZ&Iua6L=BQ((ur#o!hxuD(yP#k-PmhcoV-m=rlzOti;)8|*l@k;SX;7i`>T
z8Ml;ihhsg(x%uE0S>indcAUGE#jDrtHtt%+J&SRN^bB)rC)wjIh8^dwXYuOwvyI!#
zxFZ;s*8M!*<>1=dcOC3FcQcDuuTO2<jf^{zaZfxW%x#)%kM}s(ac<tkpg-$%osGMN
zamyIDygba^1TMXwUMD?%&xal77Jyp>BN|5ols_AH8{?kMxHC=)b6YO7$9oa%IJcg~
ztJg0!t~fYYUyWkiO;}g+_RYn8v#otM!j5wrS-kpsZsTS%?m3J*s!y1kUu}<f1nf9>
zEsOWGh<fhGxT6`j!iaY)xVCtIX2iRm#jCF~ws`Xx_gu!^(JLHpE!H!~>rMr!`_=cb
z<MDQw6!d33@7lQejC&sAerU{B%fYq9`@S(><$<gFv!4HK-2RMvKI5K&PR09G6Q1AN
z;yn#UJl;wcubvNV+#!rRhH=j_=BrKM+TuOan6K(tyn1}txMhs{GsfKmZOG$osj<gP
zHay-{EMDDTY}~PodjaFVfqgvA&8@Y^`#S76cP)!o*Po4B&A8=^`{nR3H~%7gyr032
zbF(G~{aO37ac42^SjPR_n4iajYir;C81r)naCLtkr~KKtjf`8txDVr@A+P7!>GpVk
z2|FHd8H=|ng1dxqb@^~95p+Mqxy!+|#k&=DoLkA_ofN@c#<=5Iyya(wxlMKUc+ZC&
z=dNJ!PKn??z_^u+dyx_ECU9->PBr3P#p0b7!Cl3;x;?0#=VJi#dTyz=$J+=y9`805
z??n;ZHH<rf#rwv2VQ%gWd%Um1j&rjv4El3@1a}?dPGsCaz!{G>|6(D2hkDRSUyojd
z9p@H<n+qda=gf@YZeU#9|EQh^dSNcz?BkLbPnvr&>^Qd)T*@QvB@x`sj60dd`~E3m
zZV|XQ#;L*e_Z`@AZauh#ihEfEw}o*pWZdiVn%DCtaLed`N;=-fu;bj7;OhIqh6wI<
z#?|AE>bYrNm|KMB7dL1qq~@-K9p|oP@y?6jwmBqNPgW~C;(mtzLh*uIXo>d|*m3T5
z7Vp&&+zyO8m2qz^4s&xawYTq$u;bhgQ-bzg5W&r5Ts^-a1o08h;qk5k7hBNrr0e<b
zu;bhkaC2cr{drLYw;SWuC_Cali%!Y8`Iq7MUM$>Iu;binaCN`>c?7qRacdd3z}UYk
zy<CXL<Ix8FioUOta~oN_H$-rY8CTDz6mQ9(aJ)HJ*gy9^1a_Ref^lz*;FdD(bQbUD
z#bItUxSw0%{SWLocP-=I62TqAxOI%X#h53X8-)0)g}d39CpUxJ6?W9GZjazjVqAUw
zpn5(WLGXUnG*^fX7H%il@p!YV1MZy>+<L~H!Qw6K5auqq(*C*k0@!hG0l2z9-yOki
zVBCut_v(Ga++56u4_e~A5_X(h0&XtssGe6ua2GMIzFty2k3oFAo}0n_!onR5JI<|U
z_58~S?k$WvOW6_k*SP+KxQ+JDvp)?x&Rxp54@GcSFz#%|{R$k;U2~QF^X#9)j&oOo
ztFQZyL~xrJSFaB!-q*q5+*~~GDz((}tFYtTb*z1xBDkx;rTYl#2Xk1w>kbZcYr);y
z!Zn}ouVr!Q^#;W;{P3{92Kd7xpm@^PnKNL=<JijT@2QA5ni=<U7ROhIg}F`Oc8^no
z`Tld*aqf1;eKvx-k#VnJ+?B_Kxh>!pShx?sj&rl82J^vl5!@||tJhal&m#?P{x$aJ
zV8ab=9^*bA!QIBVb6LFmU|)v!(^_yRTjJddc0Atx;Og=5LIhWI3f60T0z|RW--Wed
z?j~@DTDTKn$GIhpyEcNG&A4qC_aRK$Jl_2I_Rq854?E5s!|M6v2yRElZDjTQRzsNE
z1n!ZRc;A2>=hlO($N8%f+&sp;igC}v`i#fB3EX@O_e|Jv?i|K_ErOfRxO)9e?Ry^9
zE1a9Nz|I{7JI-xn+~x>wf5yFr#hY*3*A{`hiVC6<^;t^YjQiR};G(O^`Si^Q?hwY+
z>voFw6x>Ymc*Q~?-n4KBz>deeopIla;FdA&wJhGPJ;U5hi|p}kfgR^o<HL$N-oHk0
z$1?6h&MgUZmtQBuLzZ~Az>ae_GVaC*ZZ+fT`xL6@ntow!=@L743hX$yq$Y^>ZxP&C
zj7#^%#H7FP`h>Z3Q)`R&E7)=FYR3IAg4@Wr*D>zBy~Et5U)Z^K!H#pg)dunYBZ9kx
zarJ!}#rrARlK1Da*tB@W(!L+#80Riy+$|B@WsJLo#rq)GoSSpAoqHebI5+#EAl{E7
zxDPNc?UCsAy|pyVU2}{5dm(Ow9p}zr-2X&yS23=>4<+{SkzsDbZTNm;OFf?fJI>w8
zxSvIE*D&rcSiIhdFt=!#ox8)>XB{&=sON1F+;xn*lyS%G8Rm*R?frQ)?0CHE829T4
z?gqxy_uW*_*EWW^O?P3R#!}B$!;W+N<3sOVaXziHzl-2*X55=tyf+&6)1`Og`={Vf
zryTX-dgFe&l5u~C;I=UC&5V1_;BdS}_t-zrJ`#33-bIW{KMYKDN9zyseqlS~>U{>X
zeG4}meEjC#YhO>k0XxoJ1uoSE)w37DZPPhePu|Mny>@Pxy9C@Ww)TY`=dJ}eUvc-0
z;C5i#+Zgws*uUoSu32IKJo|^R<J@hG+ctum%eWK|)iM2DcVU>j2@~Q`D3?yUUtJ43
z&dsZL<b5dBb9Mx`8{^)=;(c{;n49x}|Nb45`x5Lpw;tRg7!kK!1h<fJ^?nY;n>#7Y
zEqX|Zd*MeX9dBpYaqcQ`$HIuX?IXCwjC&W0w+8)`w{OcM_`Xm}Jx_rh=XRJ8%o_(r
za7!8Y9>zUkp22Mr0&i`JCmrvxu;bkR;Oc#;juG53;L^CJdby8rpTt2P@7O2sKBG7_
zxbHUSgG%P_e&+8=<9Y3J_`}jWo^%|hziL)5dcTSK!CYhADW3E{f2$p8f0r5S&N5an
zhey=QEEdOuERNm-!u8U$%Km*QW*iMH4!wUxag3cD_Lu)O;?O}r>Nv*0j<;_$iz6>0
zjzx_7FpJ|_V;pS)*Y-T>YGWKVGVak4+*=rTCF6c+a2uYn$NQPVUB<Y_MsQa!uHLVs
zdY;(VsOM+xpR*nhJ6_ML829)HZWFlJ8kXbeQ5NrS4ek<fzq7ROa|U-Exbu}i`ps&J
zp$+~HI?0d21%uL}U*Q?O|5E->c9hz~j>l1Uu_HENK+`zy!Tg#1bS<mDCs-U8oD#0T
zhF=R&;iKgLx}Tm0JI*bb70g4uBDl?r`y}JGGwQDe+_Np*eT@1mVcfz9?ncI4#klVe
z498pgoIT!mV8`RFWZZrc+%1e-gm$5JqrbZj4RhCkdjRrv()D~h>^OH0xMN{N?K>cX
zyNz*AVchKLVeY2YcwTGawt*ezZUi@1ap~DQ#X$Yk>{sH@V0;uaZgJ-@x8Zp~w*v8`
z<1K<6=WYkL2v!ttaRj#mxY^3?H>`d0_X~4#e=9_FoEpr#-C)PL{bvX3)6*Dt$cbTp
zOW@D8PhAW<?ym&?^mTeD^JmsyE{o&0ERKt6!rW$X>3&QnU4K(y$GMf@=EI2UuOx!o
zjd9m7?geOM>K=P4R`c)t=MN_LJlJvWQg90ucX$N15M1g<RKDLc?mI@imA+^nmuCGH
zu{eIm{C(OZ9LE~?>!gE#)b;l<?06jOSU)I>h@*tXq4%k2j2u5a%-sa;Pz%?Lqm0Gz
zB8%e~V?C7r66Sg2>!jm2(pV2|Wc}dWh&aZwIP|_Z#WB}tkJ?x4pD#1xn8f0Eg~jp0
z5Tjn;?<*Yyq>ke^u;cBKeMzv+z91rwddAiJ=oH6mCmY;92my3FY3?6j$GHXI=E92l
zX+;FLfpPUdI&r@!3UixY72;|f*GY3fEednXz@<FmRz`3aF|K|dMcl>%!`z}j3h@IC
zXq7aVes_(>TM2GHY=}ECf_n?&{)x43$4d<EYeIaZp^%!}0d}0blyNVN;I3d?{oH`!
zz0tVN6uoZ$y#4jYb!IKNT~)kOBe+eB`)3yKLSuee0<LZSa*Z*+Y-RD*MsQa%?i-9-
zJ}_L*E#RW-#*?n+^I^y9x$~vLyjvH+eT8xLa}uiOyN(WX^Zz6SwmjlVb8m+o=jMTn
zAuapW#Sz@~jQbZBZ=O-lP2gT0rw08h*Qn=ea7z_;b_915<Lc)#6z|%jjCh;v@vea#
zk9ReTcTNO%E91V+;vI^`1r1ky{cQqwfhFESu;bjUIYGQvL~y@h+zpJIZ?tdGpZ(w8
z)o9(m-Hi4v16Q~2l@Z*m!-DmiejY{j{FD)IGq{U16jE~^H{xB!;=L+@o5Q&8uy`Af
z4A=A6H-x|=@OaYP2H5d>-U@CJtZ1H`AHnU+xcWI5#oIPN%xwmDMw}YNy9ewzx7%ew
zJui&lc4gf6SiBvKcuU{J`&}*E93$R(aEo9^@m?3fEnwXD8TZx`jd;Pm(!#wFc0Ary
zEMD3>r@Cu{KXbiN#JKvoAK8vE#_!nm_VyiZjNk1n-lY-T62|?2#ruKTzTn#0_dTP1
z`(GZk@68e1(TuB~H&VP?&G!9^y?wVB?b`@$5zeRfy)A-U$++~MQ)1HJMP|I<+S+%j
z5${?S?;R1`TE^YXxIOa1{c7x6Le4`dl1w>Do&Y=Eud=TQuKUX)xN{iypNxC&31My%
zxFZycgy!A_JI*Zt7gZqZnfA4*?ri;eKI4AGxEqcLb93IdbJxR;b1PZA_eXG-GOm8E
zOJy8t#9Iq)1&-^a;~iwgyNJd6U<7wL<Nk}qd$keoCUEIGqm$-dX~esl#k(?syOMGB
z^JI$m>*K@qoWH?d&tJff*Yjo;?_&|%XBl@Zi?^E*?~(-Eu135a8iM}(L<Dy&<9@=p
zcNp=ufNN{tTa9@8gRA@VQxV)|#>Li7eBO9ssb9|?%0j8^ui@tq)E1N;g&nWwYH(|D
zoaU=%Be)wG_kPA*aYLB96x^<o<o~C+%VEd48^O(0+~*>=TNqcrUx0jmZ*W(GOXFWB
z&HdWoZU>k8I>q~Z1a}+be#GMa>iTfJYZJu#IqZ16*>i(<Ux?s}!-I9*r>tL{X~erV
zLA*nac)NkC<6RrU&1T%a8F#P|?>2Dz>q>^y^?ZsEZ+~!ge||ZF+mUfw823(toBvMu
zd%-mKHiKIYZlP-5S0lK2jQbPDy?sfzeM`VCvc!8c?0EaG0Jm0gUyI=8GwuM!{p9Ci
z?jmq)<LF<o<J=BcI`MJT9Kr3+xSum_u@UboaBbtL$cVQ9+#D6}n-Sb0jC(2L{?v$f
zb%J>N8Sxggc;AZPmND)ZjC+&8-JBra8w_qGi}$Y)+_8+ijB&T!9B$vO;M)3C3+#CN
z)`P42)y4>JHRC?bxcl4~=5~A6&fN=koV%HE{}#cW#kl(YO*A&Q8U3mnT<R}6>G9hF
zJI*be7xb$SBe;!>+m^+9)PiulbHKHYqZsTsw-Vf36ppS7|A^o&VO;$_GK%HIYr@<W
z3Ao3>j&mCsmp)5GzG(cJ_hri%_e&P<C)b6!>k`!SzhK9?D_A{$9Kn5nao02MAx3}R
z2(InAaFEfTSAm<a>iItr+*OSG72{rGa64|ax9>cIyBXY4#r-UTyM}S~`{t-k?!P)*
z&qd(c;=KoUyq*ghgLt<^aMv;JH!R*8uMKnOB#8HV*l}(pxVb9cuOqk{7?<9sL$T7|
zJ!XGSz`fJ#&y4$B1a~vzzRS4djQMI^0`3LIe6@mce~93=Fs^=oBE{QmaJPYLo3GXx
z+_j8L6-T~o<99pbe$V2)V}7`Ov);4!=UZXN+jleLdJ)_<xxspJ6XOoJDa`GbfO`_`
zI5+F6pkM77!R^4f+ZlJI!7T&VR?iO@+&so@8^O(GT>U;!YLjeZ991TWw~aB5iWxUM
zg4>O8_4~((>l*iEixP1E`-^ZrS2Aw92yP+c{+HGBc?Ne?f_ffh+z&P~Zu<ysG2`xF
z+*=of`_<Y6@!kkK-mg|L?tu~9QpWu^<BmZ6;WkZv7bb+*nt(gZsOPne+cAPWhH>@#
zd|@sgGPoVyxA*7!4en;f?G(YC#JG-{*NA(pF>mC7+m!-WiEJnxWy~8{R|n(wFvflD
z7Qg;__@{{y_@nEzPE@z_cWnV=$&MPlY`~wG13R9`hEl(tzP<KAc6bYUJZXP-;$}^s
zLz$ia7B`VEblzEK`F3b>nL5L6i*}A9I^Hv3NBycuS_zSdc!%umuj}$yybb5buWMCS
zLe!(4i@N&^eB?&@qj_m^O<n!;s*0&6)SQ@0DPR8Y|L4E<|L<K;AP@HF*)zXTz8bst
z6@y9!JC2Tke0!l-x1Z+YQKd*-@%$jLr6XrA_{Yd|M$OyYGH+|q7CLbL+~1=Mh^o6g
z;Qs~1d4-Fgq{9me^0sW>v17;Ld2L9WN5>Y*|6!A}U|uft#lAj|`pC=ksN!(Kj+f?1
z_TqU|eK5{iJSQ)IL4V(!axo__3xFM^ZNkSF56NDD&uqc-klY0e3H-A3LWdR>F3#$=
z2fbQQkF&FUe=j%o8$!pB@DlH@kVQ}hE6(ez?Nk`Wd0kZ~2x8uvG8C_yjwPbF#d*0D
zh%W4cm*TIU%mb3w!@@mfV4dgB>xLXZTneisuY(Fr1_(Wmf-K4FxL_fX5nf|INU^X4
zr7lT5!iAyO_ILoUP-cXii&v~M>d_dgZE=bpm(mx!w73|#s%jUs7F#_+l6?h!Ixdh6
zl~N3T<t!}Pwy@FbNX7M?#j9j-cE7nV;JEBW3$mjcJaAQ(m$zW4M}0ya8?tTgqJ5}_
zMJ|pNZBw}sz5M^7{@p=0R=j`b#rt=19lP7EcWew*s@}!AV|VmBcFxWnyF&^cJ02Q(
zR}fTd{n-yE-Ts^#@6VXwsLurbIf<eNozUpdswUFx&mEKM&;I<~5A*koHjAsaT~L1h
z&wei_aB3QsX#SV8f6f*<s%C#RgQ=09f>yO19OhnLU;N8U2+;0nd97$%Q@_{Zs&6j9
zN#Ox_)tdT`)b)nEp;NYrPvTkO^61&?<EP0I@yy%2eZf{;3X0FdUpS+UK2J+k4sya$
z;`0{{%3i3uc>MaaU~t~THW-9E&g!^eaJPkVt@HfBz2;rst?gy;aQ$ngs^I`=Z;yFf
z+gvDi%xEL4WZv4G#qoMhZ0{trSJ(So-r@^qWG}p|P5i3gvE9?B70mnZj&_ZUQMSf4
z?HX@`#KHXe#d-TIJPlDUF3Zavf&V(we;w(+oVa@Uh#fP#mhLz!d*0gI#Y1+?`_`R4
zaNalGjQy2|99&rTN26vh!D!B2T#}d5_mzwL!4eZfcDv_`b|By#GjmIIyz{=<G2<`K
z(`w@5&Qdh4nQ_3vnfX-08&50vc&`OB^Itlxz=`+zjx+XN&|>TNR9`Co{80R72Eli2
zm|Y<14_!Dgzu~fM(XKHcOQx3x=F7#*zyk5FT<8l2cANK&`&+yc?autB`&Ua;nzuE3
z;h;7<YI9l9+co|RX7h^+atHVQdd7R`dkvTO67`p~dm0y9)aT*to*tBqp>O~lIDEn2
z{C_<Ud*9(zJKA0MqOAJj{)Z2zYPmREE${z}-g=|)OBN39iWNhf1#RZ-XjA`x*n1!N
zsH!t>{7y2!00Vcx5eAJq>ZplC$UwjuK@Bm1pr8rzuPOzEARzw?cLe%^KqqOry-s!C
z(%tU9+pYWG?e=Zex~yf}GyyjO+gCt;Ra@I?yWQ$IZi}=FL0$6ue$PGU&Yj651WH?X
zoBR39oO|v)_dMr3=Q+=L&hwn}oCHdP^sb^9_wT8h9-c+QytC9AWzI*x3QkWR2;<Ig
z1@Iq0Lk8K95&m6g-*p?262vO!HPoZQD!S_fXxL<z$9Nn_Fh-(j_2vn{PkIvmo+F|f
ztq~L;r_G6!CUn&hqJEj5iSpnjuipEY>X$0)y?@H~%waIr4nOcLrLU09igSiGch@Xe
z1<a9$bNWZNXE>-9Hw410fN3B|bc0ffvxnIOf<TnnVQmMMLyjoxwC4J{9||v8>v3q?
zY!?WNpH5tzJmWFGnmkivjO#&0W_z^l)c41=W$_v+$k<)<or{k|z?$o~7Wj63qFggZ
zbvK0<uJtr1%E(M<Ir+#9q+)%aH);(7oz<JK&g*Wd1hYZsGcKBG)du3nk%jqw;&rnl
zQxrX!?O=9OI_+7Izs&V#QJ6g4ZA?K~_RNXsqC8O`M@N~~dU_%zdD;W8#*p;a03dqU
zJe2-B+z^{$RM;NT-7R8OlQkI;-$MMA@Gr!_0RO@Z7j-u&wiL&l!??%n0PPx+f%q+V
zqLF-LMP*0q9*jnE5ESo9Ou&0D5~AG3pJqaK8Wwnw!Xi2Zs9~-@y|`yDDBM~XhW-nW
zZ-0Q}lQpY?G;!A9sif!dRL$XObdTZb4|{xS#rOn-mZ<RwyuXCQ6ZW;J5yu&yT7NI&
zlNh8T^M14OX{2KRtY7Be-NVzs_!Rj4jZa>O{bnX(d>YU3$tt1@RQWVVr}~1U(~tTX
zoq8YNA^*C@r!(EgB=C7?mi%ITnt<WPZ;wyj{DB+e69%VeI5=TQO#egf;N*7?PPqU5
zk537IdckizKK<6_Z@}JpUx^Ky6Pq?|Y%&^GhSzOev3y-)c-6+H@MdHAhLy{kR)*JX
z*px8NJNJ*+hch;;Y}&YHWw<n2F=fi6ib=8Z@cqj-qvjhogqtd3H{Muz<I1w|ign93
zJP>}kv1#)fJdfTup<=?MaOrBp*tGeki4%br<}u-cjT;|W*SL9OqG?6rgcTdtPc$}e
zT(@HN@--VKu3Pu;`WrSiZCu;9!U(U7uZqQ2Rj!OqojP^$$|)7mNsUuhRKzReQ&vsB
ze{x0RipI$+CrzF@sZ105uZc0wC+2CM?LN<?ey?{AW=o}bRw7aP9@V!qM*3Qcsz(f(
z{i#8p_9lyq-x!3HGyH>mLP6)OADz!{RN7g|;-c9|hDQ<n*6|%K5vnwGpF(a+oV*Bg
zuSg|*FRFAi?R>&`_pE#m6@3<#$fr>xBCOYBnpHj06wOh<MEy83#6_*IyWGo>i0?Uv
z<W=ZBaa1MWpJpOeR*9pcw-h8BpKz}zE|Xzi+Tu+fCvh0BzaZ20RmX42G<P!By!?u0
zAUix}8Gk0z?Jtz>Ne8TGqkuH3BnqWnoy{{Q)0Gyg%b47{tdwc{s>>dk=4|ctluTEs
zJ=k8{zs9T3d*XuY3VHRXy-JGhwCoT0_|0#xI+?bwI<Avx&emSs8^NnT?bRmJZsrI1
zG_We$UR+Pa>ul}Cz7r(j;9AE&m1kZ*B}#_l=f{utBk|Ma{V0T^<$Vz0#qxeELK+O1
z{u2BymG_q+yj<Rg5nd_puSUr7F#WaoT_^9swuB#5K4&{)`Lswg5h1Nvd`{ctWO+XY
z;Z%7K6Qek5oM~vcnJ%B-g78*(KLcU4ystr6EAMHdtCRP)BfLZ2lV%@~_iGV8DDT%J
z+#v5aA$$nGzOG^#lU-M_ChTU;lVWX%bI+S%+iLDSD;6!{MDc#4cFRyZPW*Ya)!CQ0
zE7sUj*{j$Y4eV#d8e1%T6^mAL$Juh(t5^$XBe*Np*n-)sShS)$&X&wx#dfcC9u#YA
z(d<<$TGbtA%Vw`)vD()i7nV8aL9xbG&R)eDTRM9cYi#Z8RjjeavsbakR?l9=+MH|z
zcf~oUbuzv<@BPQ};`ijm@6C(fmlt1>7yo!(d}&^MSzdg3Ui|*N_=>#v%Dnh$?RiO(
zlnF)`6>D$NFfK3NJ~UXx?6nVzB?(pG@s&lZv@#dTG5vq#eIIm@IA48?3`1Uw&mcp=
zMa+&Wx-(~eGT)EQfwxw>a|~147vKMw%t&60UzC@>pNtFFeEdcg)oZmEiKvXv)BZ@p
zx8Kj#O7rUbs)SdC&#o+5ul+w)7b3jpWqx+~@6!G_C;cXEY+iXko%j8t5`Q-Q2JK&S
z%6qrAI;VUKw2#aF&sq@vAusRj`i(9cq|v{Jy7;~+FMe9KH^+j}IH>sF$>in5^h5Y3
zFUk&&`Bcn?cPuacX$c?8Fp%F+tzM>&B7RlTaP1)%%VXA_Y<3#+{|niE<hfTBjnpo6
z!^blvH*s9Js%Vt<HTj-0*HuNAIQyIJ_d)F@Sw6}GR~3!bf_eFk$%|i{Q{Kz8yJdMe
zre9SQ)=o$k&awNdqN}wR^6GyuFCOH;i7SEMRYlioPs%vQ>8py$wAW>Su<=u_mFD4R
zXbwImY6~U8?D|d8*30r!hPkR}npQ<%xa{{+w0~zq;Iiu<)1JtIcZ=34>B+9&4DH#R
z`qgM}`t9#2e_T~GOEV?C+2y}otCaM~VvQ<VsO=wNr{_P5_OOJn;xAFCkQd)KNqXTU
z#_4ZEU5u~I%Wtm4AJg#tn|bjo^XR*q3FRf=<+abJWc`?g??>g8cSBxzxn^8lOz+Dp
z@6^2f#^sg2J+HqWmF>wqncp+Kkr(5a<-wmW+fVW5{gOYCU$DPFAm6VOar9^TUiC*d
z_plpmxoaqf_j1I&6Kr{E=tP_ggE*gaBpqL2%R`KlK89Xy^A*N9vN2pKL&`*q|1X4I
z5c6&s{~Y6!H0@6jj-QOR#(Z9>Y5yq0r)5Z0CZB%?p?8X=y(Hs5lHpqnudvT!V0lT;
zL#JX42LAXwD8ox+cs)XvgEqtQH`?<!FDiFCpQAkWG9CNV&@lEq%lKLuZbCRdu4&lP
ztPQ<M)3BsmgnMQ9MH$lXFU$L^jMEay^oJQ<scGLs$nw4+<0oX;B|{(RmE{aEMER~|
zi1L*q<oEPfGxRF7i;T~dVLd~LKljLRxeOmd$ntEJ@uUn>GNd0=e)mO&5RU0Tkl|A@
z{3b$vPya%E{-O+DV~F<QeqM&$f608fUZ0^C{ea;xhF60Y5qfV%y%+~ET`r%O%5Vb1
zh^AG__)RjT-zt88hYasUNc_-`44(`C8^90!QjEV9`=$B33U*)_3SY5^e@Vvw5h3ft
z{hdtrEg5p3+R$s@hn(+GPVVy=Iz!X`O+Nn*8U9L!#pw4e2iGHyuhz72jHA7-W{C2X
zA!L3N8D5L?vt;}>8O}yH{x(fp$aoFtO@`}b_^=E=g^=Y<$@mv!_*V?C!=6sQM|q!<
z@dGmCxX<^m@jc4<Hba!}Btw+%L-`&oLK|8NzQqvf$H*|uuom+!8AfF|10l;(C*ya^
zaES~bkl}iUGjaZy40p-!QH1>db29!HGJKLD+GC##zsayx(>i4M|H<$_5PD~Uo-~_p
zg%GlTg%NsZ+w(@!DY}@5gER$x@ksODZqM^rF5HSZ#WV81OPKC@w22JCnl$emd%jo%
zridoihR%f_FotDlH->eZMv2@DX1I#sU63ykGC#0J%{$L7Pto1k=U`2O{}2w_;~s=V
zhuHq0ybH4RV!EP5J>x+<XZ~N~_xSif83G^b`C7*B1>W565yz5ak*>G$sqaAwqI|>~
z%cq_{$oNuC`y+<S>~o#ma4}Sf_bPpjj31SuC?~#;6e`EcUho8@_X|%C<lzZ%RgQDT
z6Sh|L#FMLhDqn#ol&_NY`yJrvLeZxW<@JCr{R|sy8N)N*#+PT4)Ym*@>w-N^cE9p$
zmU<b()-QSzww&NWCxA$xc^2Dv@O;dc7d#J3J<Aq*Ka2zKJ_&EhS>T~lMVN0sysZ-6
zHVN+&65etN?|umn?Ir5BLc(j5@cx&q-*#EQ9kPCpNO(JC{dURvp;L?ct(NfCNO-#?
zyiexAL+1;y+~_PphP}aC*9*L)gx4(LwMcmDCA<yDl=+s}<t_rPk{=ZnX=0x!rsvuh
z824)0a}2>Nf5>n!XcTFS(D>|sn1*RJ42R)6hQl@O&lv(~Z45_XykIyI^+4W5I^Z)z
z<yJEsWuJ#v1Sb3}<6tV>A6SG+|C-^&C?CpFGzR5kh&e6&a}|Y9K8E8kFJ=g$ewX2;
zXcv^Z2=&sI-m`LD{lf_EyxW)*T{>rW^=<X_OJ`KiUV7(@xwUuK&$z8NhK2b{X;i6P
zvtf-<i_{aE8rMxQ8n+q~`uZ+fv2^KXW96C+_a|1(-cmayv1;AMEw$(M^@{A*eL|dq
zVy;;MsN6>&z}|WH(r6SmoTjBl)ABXOW)!6Md^20oBeNCm%+3od@x+FejZMD^W^!`4
z5ZL(*GAxXt{%1JZZa=vZWcHRG2p6rlYF%RUY7kPNmCehlaLK0hE31A|Reba6ja$|)
z->_}P*~-=<!@{M@$*`Z)6%~DMW5TdIUFGI&8(5t4`FcgI`npd<_oz(aRy)7E3L{44
z)xTQBYc|fl>+ad$T{V-4inB7VEW>j?x)2x;(9bQS!qvB{(JvmHt@~}F?)~~GxBlY8
zb1QaX3OJ993fKRv8D(o-6Fo~`%&qHLlTWo5RGc+kwgk7GTM0z+{?T<budmls^uMF$
z4$bHCWe(64wdeAw8>sq{ol)ari}j5g3~lMs6<e1tU5<xq@O0gp4G%Up-LP?!fmIuu
zwF&oc-VA}GUy=$tE>T$<ol2o)sj<3IN(D|nvljm5In9{>QNzVtvBsv!NNmz3JkYce
z0eSKA6%Q_5vHHQKtCp`>r%l+f(P*47>&^u?h!?Ie`|MyjINwqm+lZAcLS$Im_ZZku
z)_kG!yK!@4<AWPlt*YIM@!RQO;_1pYO||D*=)z3ktU&tNiQGiFr8d6lel!@{>YR&N
znCV^c3`M;+ZQNW7+*Yo_&FuL4`$0`c<5HvcoD1CtZZ8;&!ibr=b@Ky_#)jJZEo&|a
z5l`LRNSR0E*UzTU>sBZc7RI4OcU-6<oqvXf+r`1zigU$TFZn5)A;0s%*^1gM&Ms7u
z9GsnZnX>Hc!eGgrUq7+rW-2S(Oy$Cq$i-CFXsg5=Mq9O|X^qh+N6-fnSm?PF!d~O@
z&AHE(uXrf2rm4|x?#9(iS2ZnP&lD>+Z(O<>3nAAvYKaZ#m@E41l+YAlNNw7<Woc7l
zgRy3P<I={arj1SLIx92|iN^B#5pG*A!hXq|dCG$L(xof}=Iyn}>D+Sw(%m^Moi*pK
z>KSvE-ZgXP-L><V&Yw{|r*>(dHI#xLWQcip++BgROE=F{5=if=k~y*U_b=VD0@JVB
zek8teX}{A>>3^muL4OM{74la9%39gabWxyP2toK?sU)uc;KD{6sHi`Q1>*Xb7KrO#
z!Z|k*as5n7#Pu&}Wk1si@LN`_+0dW*1AIS|R`xU9oT;pR|DaDn<@=R#a{rQ{iPmj=
zpda<Fl<E4%4)R9#DQln*Y(#H{+$1|UK=v;yH#>(S^Eb#Tr%=#p{svjO3)M?bm{i=+
zt6EngA)eUWh{?%{Mx%D#o#1qn)~u}UlQZ79V&lrj6%QM;x2$kUp8fx9MUT%!E38~@
zEEhLT8!^e7zp!^En?LWB&3FzOxKRg<qD=<p@O@q@o_hxF0ziiheD_)5JY8mCfx5rB
ztg*G@y(m}vn~PG>78We~n~N$-Z@Elp+9;X@MUGC0+U+Ff^UIr>mT#L7t)RWAzt`Qc
zr@;K-Trn6?55PvEE|_4%wF`C|-ouO|u1XoI0HzahwZh)xPFIDeTo<G++NOBz$1|9K
zv?@k$JsE+$2${gFCd$M7XeZ=af}H$Nfcbc?E|p&^(z)|nR%WjgVtxd#^7~a@`JO<2
zFoijn%I}x?<wJh;NX7hy;OFF*SH1vV!ldO~D!)Z2986Zubrg0dn7TxMFoBBvnCI;Z
z&#+<f3M0R$eJlP|elwAd_0?p$E|ibW#`3|G=9DiV?hjpXiATcZ?+dV(2|UaEmI3Z6
zJXe>3yBF!)a0A!d_DaHqsjgSJZ@b`f-GYM4v+LY&j{<JF0*X+<{VWo>;l==$?+BN8
zWqzcW{QCad1$VJb$Fy7VbHnAwh2R=U=Z0J7f*X|i6@tr+2C98OCesmaCG41PxE1*L
zG@h$V)wcra+;A5Iu4-SHGJCDB-vt*-Hyk|w12WEmi_FEIAPHE({af6);cjxZFHqSl
z+>i_IeJ;2<>gR^rHmoo`4@WvT+%LH5ds!cFBQCfw={xnEn@7*=6j&nTT&lja^XU00
z7u+yX_eNJ0F1TX-jZ8~hvb(<ZfV<y;nx*Hrk<MM;Lx4+or01*g>kaO77u@AC9n+3P
z=X1jifcO%4t}a#IVMynO`!?Y69pPS!UvF^hTyXD~>6rGf^58xWxLk*;E(P~5^5Av>
zZYdHGZW(^P!JY4dyF#X8+V6o+xa-@7^#X<X<T0dk*Ec*q+mG1adxN{o1-H=!w>Y1!
zP_IIKvK!374L1h3s=gRvdxg8s1(*4<eEe~3sJp(K0GH)gm%{TLByz)D2DqwyCn0ff
z_1)@%yIQ7W+MDom!+oL`xKokN4R@0Z?i86Hx_A%%-0Xt8My4a&H-_cHJqoym_~h$I
z=Z3q>)xNPl;6Cnx`+y7X13;F$zDL1__wa$d6rNY$#truiuJ)aVw7uc^&s}iW%5+To
zXL<Cz41-!Bdj8`)dTw*o_m)23KIww{pbPGEpi_5!p8(uD@m^i3zR%{-^J^}+GmyBq
z`abJ|yH2KK+OOvE$>V@qh);ewk53*4+%Uc;->AW_H@IysxLCR*(lPB1z@OapeG2P`
zu(Zs%RDEATI(Pd9(AoHoaA)Dy8{F@@;BJuVm^O*b+;A(fUa1hD+=+B<xM9FmeB*W(
z+}SEWJma+t?X%9l75}OpwKBgd`K}K6)#IM^n1i3H$8>zp{t0x8>$`|kUQ!p+@%lE(
z-Jf(rfY<zV^X)9ezsm2^X!ri4t11AuP=0Owg!^cL`WDJ>ML*L`EC847tuA#xx<G#9
zQ|eN9d8<Hu)jOtD`Tei}{wh>v2-P=F6-cMvx%0cY0Ng_Pr3=)zP=0$0<X5P^s|%zn
zl;6Dt>QShC6AGj&l;7S0^(d6z0|n9*%I_;6=6rfqZRN)EuM4E(cj{7k=g((ebMY4?
zM=<Rjm=q9>I)91%w@PJ(P~|rZ>D>I~3*ZNv@SglY$r~)kmqK=alW@<=54nf(p}Gi*
zzx?w3%vC<h1cb}qu)OkBBEKp;SC=Z^;JotrZpfBTjh8H6KHTFjxN00^o-bhiryDOu
zFK|1M&W)F?F1Tv^C<OOI7u*?ur|N6w!F{$DxGi~b-*&-eyD&e(eFp6T5y;`szeauv
zXL#(~e--Iik19UIwRnR4J=?blKb7B~BU85@?Jnf!zKAnkpJF<Ms!uT8m&6<UkMH=~
z2%zd4zWEc>%YCVL{{?x9_eJvM7mzOIs))KhjdbpMEJHnB!#AwQ7W`B_?hRz~VwOIv
z-+e-s8Kf=JA&E9I8nxYG3*Xph_oF>|@>J<+`|N(S>mh^ksucgF*cYN|D;@|xQPS^S
zjvsBfgKKnLX<JeF^;?*A7k6Aw{s7s)@n*7X*p{JYyVkx(pOu*+JX&`oU({1~dhkU9
zd~gNSSLSK6)12W;b`+UW3!bknZ^WFz|Kz*g`h|<k4wbOOd!q(lNpyY(S8&~%yb7@2
z_MZw*duuiIEMV37;CnNCLJw#s^igo&+$rkSSw+IsI;%vR0fhZ6+~k$49bNDEXR^Pp
zaK0{8UyILVCiMPT`lQDg1_zZDaJ5yQ8GP(*<W$D`qwo!mBfXPI=+RqR02#L--0rn+
zeI7#xLg?;GRg-S+Hqrf}s)`?2kS|qDht;bmM1{4<UpRTdZYkk3_ja>OdIf`a(grzQ
zfwariybfNJ>^J4EH$Ig1V|bHZfj{wF{Pp7J(rzFhT(vsIKk1EljKRQ<FXM&VDG-3y
zcBQ=kNg$#4bNJKh8|F!nPOI7k!k6L#Jov$VoA--%w^8DQ=Sg!9<4<|$9``2grm(Z>
z{qDPK=gkjar(GB33ZTZ76T;dxn<d5Li~j+>hQee<%IApkHS{9=$=oJ<4RK3A9e%tX
z;Gaq>{FB)GI9BsHt}FSc-qXbp<9%H8zi~*uXE8kBdb7|ZyoX36;<q49_B>q15jYq9
zbxgtgFrE+=zjt4S{C7Z<5f|%Ce+m~7n7qg<kEjSj#!tE9Nc$fy_Qv<hClHe{{$IS2
z7voFv(z~K!fBiqG#0Z)GmAp9jnerm;xu3W!ue|^6%8=i4UZXC?dA<*?EAgX0fj^UR
z;%gK(pg>g8hJm8RcmX8ek2v?CSO~o%H0^I0V(|ScLZ0>Y4aPA(y~8+gPyBcRXeP?R
zun8ger-*%A$nP=voPGkhSMx7r{Ob(yzE#Fq4}RAzLvb!38mj~_y&wkC1Iu|eLhhfr
zmGB4K`v|F*n#XcrJiV78<fs)4@jZ$zzQZGJ=s5i0@}SaTgwFmQ*gMuSJ_LVq|4WV`
zxObZ=mp80ibN`A>o0hI@yg%{4(lr}aZLHj~dbx3yWyaA-&d!uI8y=Wl(B1{ZbbR?b
zE-*GWHqGYNlI(hQZTbCh=$2h5+hc94y%H66vUQCc&c5z+={*~^oMjp2c@-FoZ8tYI
z8MSM%5a_p(|ME?n8aJ%uI-|a`j~g4g`UJSH#R{oSxG`2~>l@dv$I@BbjOeU=%3rV4
z%UU6^{-<Bd1tw*QM6{YDl~suiE4Yx^UV>1NlH7*mz7_;enw&?5PTu`o(J%=sXe1qD
z31EH!>t{YJmPr&YBMK>qZNg-AGfCahLYrf-MF;EO#km~Vi*p@EUtj8a05&16zs5iB
z@mgHA94aFS)EESomXoduaWVEG<V9Y|%ZHy^_I?w*;YmCLYZB#QeoR9@0B*R;5EtVk
z-tkiTO~7+^etS^R7~V5KWG%|a{Jxi$-%-S`#B+72{Ep@2*M|J~j`@*&sq)nWS1jKo
z{CM%a#E5+>{`ro-y%MfME&T&1oH3!ge>@NFQNU%n36}zqg8Llq-E%AD(+!WsMVP$4
zh9B=M7{SGKh2~ao;hp-1>3CkT`%>>t<A(PrrntU|bj|XffvU%UB9Xg2UPC=FZ4~vu
zu;$cbI5JXs@%t)d@PvfH@0lO*J~3K3DeSt=c1BUOa*9lU_PN#H$hz7zU8;@9!G!SH
znt!H4KjLuEEslZsXbZ2DOL*n`$)r5WA1~6KBX3H7m3%jy&vEtk{yzJ4ukW|Z_Yi-w
z`Aff=@>Rj0r$0GGb$0Te{^bS>JwD&EtdvLJv6ITUSNlp%e30nle8jSi#>V0>Ldr2!
z3_-BV7=mtgF(ml2?{4GTU2ZysPt>MHtPx(0Rkru9YZUu>&$=}(dSmY&_930*Z+kf_
zoJrAa5jSjHx@jW@aCmR6tzWUWA61OTRVjOX%MrZSp&$6`=QROsAiJyhf<8EJ!83KK
z+bwv&d$1jG^)_BnkLONTg}9(+@l|$w`B`4N`d-rgU0%9ny`&>dH{4B#i++HR7kM79
zPvPh0^VrItb1@HIe9rp{MsP7+h|m8qo~v(|uEZU2z2p9QzEZrI>At`Z<fVFC7|-2&
zz6KwJk%n>r@yK)>zosIc$_r89H|TMMc<hYNth2q%Pn|?}b{*Q3$(2*$g43U!&sV)|
zQ-k93nvc-47j+~(&mtlpR|gR}$KHsKdeNzz)7d`M*?njwLe`F;wZI=gWlS=ERrZ1B
zWpO4)p6~8y3j)Sf`o3YGnHWoNAGdRK^(-9c@{aj~XdB+>pKr?ydX5!R-sIgn!Q8Vr
z<^oor>{#;j@y(l1+T`hBTLR`G?a-dVsYg8176cPhGPBJWssEcv{a?L#L}+{Pk$D;i
za+saO$yT8QtYB^L^x`993^YXz^A<sk7m~`MKrxQA=oq3oCv`xVC0^M$C;sgE*Ya?X
zc)M}2d7$hC^TkuIcsddzq9;!t@FW&z)<xSgtIb!EKR**~%fU$dn_j&&?&&nU+TRW(
z-#i}e5>K{y@aTix{{|q(&DZd1=xfogWP4Gv<4oeaW=H$ay~x)XqqllI9p-zxe<IQy
zV!A_7=gc0K@FPJFS7#}K?SHj(iKWNCv;ESY!Q=sNveOF^c&irzQ252!in;Ay8#Ft{
zCj$DO&!U#lewruR-!Dp@8M0-h_R^lQsYTv+Z6I-TX1V!l@<?&Y`z>~2K?gWtMm4Q@
zfJ9L5OLi8SF{?I+Y{bDockyH6+GNLv$)A6in(3uxwL1}*hogP$Z!O$_h&(4y{!YOX
z+^S9&c@Y0LdCU#4Z@gek%${>ZLO@FvPcl#KrtErL5W&!{=y7CgcEn#u`~+vjwDHiM
zrS7x1q>g;q+xSMEHfHT8adhO1t+}C-GrXSEf?x_rSP8%Uoi&jv=u*3Juog}evW8Jl
zZH+{|P?HE$;N{Sg*3>WRPK4$y>`w5Uo%uL;Cy;!;1WMExkWvK~{dzMc;+DfauV-#p
zZ=pZ54v&`p6+$XuanePD^6c-&NiQK=(GAUel{}fuh}57Ybu71i?iWw7DTV&J3I&QG
zj3KOWw6#1gsbQYVGGHayh^hK+>n@+Q(_eO^y}Ky>s{W}I;9E7jKWu5!n|I?L0R1R-
z=o_r@alO6H+j1C3b5X&KO8L-mJpUjOLV+VH^StuHdT_x?y2W4iV*8n*_$&IS*q<!}
zB|WJ(zsmbQOKA-zR<}p$aOO@u=#9-XhppyYh<cRp0ce)h<yl~h*_t>Kb1e=nD}i=D
zRKKVpl?W)EcsSl=)rR%Gnl+g0ZZH(^a~w;+GSwsSw8~>#XRGArtEZVUXzvb>2OnmJ
zBJ3Q(hA;;^y8gw9Q9byh-3y%lyZhZI@J$ZME(l7JZH{nQHjj?44YYR^t!ewmFMs*V
zpc5fKB)b~T`y&3PFibXb2(uQT@1xeGEp3Uh7G4TaW+%)vmH4a_d1*Xq=_p#U#E7Y!
zGFPF$S@quN;g*;5z3pX3JUFQ6O#7aZGm~vN)hQT1YWVei0W$3GAA2YBS_)<k4If9C
zAHaq13z{E*umhRF=C8W(1|{=>g;?6t9-Ov!vsLGxRu?daM-OMBlFN&e>{!O`h6oRV
z8jj@2m<IS6-gYu?e9bDIF^?p-M}nGh2go95Rr%SP(`E!1Gln3~n~|s4jt2KfM2__l
zd=@>-gWaw|VePz7V9rt1*)oWV=@CG%oaP6y@7UcKpnRI%{0{q$UF@K~&y%@amRkkx
z^0SaU&F0ju9bqkTg|#4L73r<uB<QqWGbjs1R5BTg2;86*^yXt{y1PxF%{)eSQw=s+
zVZMNpm9wB2iP21%F*d}G!P*_kPXA2w>*go$cGoSQ#4k?{!B~fnXZbQgRWKQv$5OLA
z%oT@j1z0X)g!w`Y;1mCpxgKdm3!$LH^wu_%$|+`pUzBe_P^2~WeM4YX8)VJ$W{Qrz
z{j>))Du)fLLT}j!9?~(m=ngb@Abmd~xdlLnDfcACktj$I>39AsH--6Qfp>}G!86P{
ze@1s9wG`Om$L6n6-Wzccoc_tbK@Jjcf67~!2{R!FD3XI(XArB~@OD?cDDg|1XpJCf
zdm2z{yq+25q(AnKcytJS`mW3YQ86D#^%A>4BqL(qxB{)=V{2q?25i6#saIf~Q!@96
z5=#=+6$uleU<eKwvnuw-Er*TktQme1F9x8CEDuPwTaYV=6_1ReyGVYC>oY^djd7(_
zTe8bngjb3XWDR!RQe@y%VGzX8#IHmmv=GK^(fbWQSc3VA-ThBUZe%kPoLzWS36VA@
zV(n~ssK8lY&e(~Q2gR9akOq*q!{Gc03W?;fpdp~g-<=4P%_c(i4Hz#KlPw_^<WZcC
zkm%xn0dzIN|D-XI<Y?7~<Y{!~qY;YoR-HHbliQ8Ulc%d-rakRTT#l9rkP~J~c*jP{
zjOHC{lkxG6bClGM0EW*yQhOu6V9daveP0BkY`rQPMF7#?5DE^7u!4DTw8g8n+S*}i
zFbsgIOFej6X0XCM5X_HXgyRoFGQu!EFX89bSPnw5mY0kgHknoJkDi=X9WVxiVNFFG
zXAQBd*}@ZOASn*R1OG$TIAYE`kqOAA7Qxe==u0i#;1E90^DO_gSplQOJkxwQQIkFn
z^gJFt*?icDrGL(QUg)SnYlwt_VUqbrPlC$yy=_L3c?R7(2=?I9o4<}vl=*xpx?Fi?
z2*2+<_Di;>=X4y$N9!$YpqB1OO4-z4U~9ESsC1=+m`nwMx~`P})+arQkz(cnq!DKs
zpTHS7NQc*_0eGo-H2LP4I)T)0u(9--c8c#8nJ?pQd1kaLKl9~d?<9Y^(`+w0_VCqC
zAsTWD!TMy%?2k?!By=u%fLzCg0Duk=3N2L5WF1})&Hwq0iOI!w$bHp*wiE_Ejl`0<
z2w7&^%f==7`yG%tz&=xZBPUUKp3GRzzx((%XI=xvHvZK#K<cQ#FQ(8{fdTq97DGZB
zU1e7LGbOI-+VF4;RVk8Dq&81saBkTL)|P$`f94sMjLjAUf2Ku$IvI3J8;15ExCV!#
zb{3=T*zVKR73>^=>X)SIy&$2m=|gD(wm4Kykw|a?K!G@8dO&_*ecyeMIe)P0rz&%=
z`P#9!&G*KG113)o(jRRlJwUG9hcNZXhp6V9_!0e2+T!mSl{jv+0<i1NGuawh)gM}y
zoA-QZ4#w;uRqc(RFb_1nlLgcK64q`Qk*fHSEyFUi(NE*?BM;BO)4@Q%^vs~68GYZ&
zo)Zp|%%f$;qpx#d_~Jp&kCW}*`033!VsEf{@XU91eXwK88*vZ#J)VFB&m5Y*V@tpq
zQWrne1g>1tDKr<rhY$RCoaDzqCpeig4*i$<4J|VPYZ-7)JX5~A!t$UuHAK6~uZab_
zzt$W<hZ5;<v?)6KX1hrf7Yl-!XC6UvF|nqQvk*+(uO$ZCOx+wQC{V3BaW4UhITGj`
z)ie$lCpS!7>=rBST)&+8s*9nMzYg$oHsk<5AK>SI$o#y)+fSDMFX${}>0d{f$I_!<
z={MxC^Z|Z8z|X}g+ynBt5ON0O^8xw%cOsv!>L)k<mgMID)RUV}1~;FW!_7HA9gxol
z<a5x<06!n#=fJ>#zGXn)GN5nKrZo%g^MJl(Kz}}<KOfMa59rSa^yie3X%`r<hdw`G
z4;`?F!bVBk^8Z|W=z#uwz#e*G*0<cd`yjVB^jO;hyE5$OTs3fa>e<Mzsj%CQRRi-D
zI<5t{#HFuADqPLg&xI;=7`((fG__Erqb72x2Y;8;VhuQ!s>6s~ePPzC&~z@>tc2y7
zl~S>0r9RDV(AmWSxRdKwxMWs5$NCjm?17oWYgYnd^#qqdG`IC@{mKu4RjgkLVd+SZ
zwJQ-o{BONpg-aCdH7h=>S;>q=eR9^Tpdo^iN6*q*=SOC8)yg*`T+_1%q!#91DgWm4
zuWpf8yHdqvE9D@}TeyhjHfIGh7q8T~7Oz|^7Oz|_S}ptMhM&8J<*&Gg<wy9lc5p4E
zH!}!}S$1H>NujkY0izVF8!pvcOIqrBS<-@*EwG~H`&XQ0IZIG1XZbeC1Gdk9X6F;j
zS?bhsmMPGdN6|OuxR<m1LFmf^1M69Sc6|4{&icdw{%s8KZ`YznGQkV7-f)0_V@YCR
z{{5o?{(au-5eN7;c6<)-Z*VDNK>ijpq~Fqd@d5rlz`wN%zn=V~#=ph>+J5j;Xcnep
z9>tZ{F&S1d<gQKZiEvyya*I`kvlq6`_C$z@{~UZ+&kwSDVJG0jIxJ1$lr?1sNEn99
zV1I@AS)|~O*gJjJ!`XeN+$gJd#BSlePfmkVpX1>a_HNuoP`q?Egt;98dwhD|EQ?Z#
zEszMq_?Xod8;Dpayeg!V33Kz%l|ln^0Q-En1qK__@Qhj+DtW{fMQlz+!MJ-UyY0~4
zeZc)7_TB?*)bX1quzz8Uy??>DJo<WOW_JGlb&tKzNIi+31f+n-1(WVT1F#peHMe3<
z&_TKD=slDv0G$o?Mi?bhXH$tiG5+S)6D!lND(%eUkE5(YE!h0JF(-X6`&_{@e=OkT
z??5{2>_9pV7=H7;SUVxI@953jr6wngEiF1K7|D!K*@^u~DgRB_j8q{Kw}=fW-H(g|
zwoxIuA*o#LunA<Y%+=_GiFmOCsT6=CVh7TF*a`ER+<_GKI6IIIa?cCsDKo_UL3UAN
z77zy!7oaQLTaCh?Q-Z;!BeW>Mh;2q__W6-3S#G=0J+A_#6|&(jR@;oiPGxc9YN=Pa
zh2#YHo7mfp9*rCawNWWk%D=_@o71pXLr}^4`Udlrd20g-71Y;^BWxR<-uyIlFIDCY
zfBHFYBs#%Y886!ybY}{>W6OxmT4hJ|eduN<+Z9T@<_pK(q1MLiD0}7M5+EObUUTq)
zJuP8RqBJuBA2~a)dP9prD8v-@*e2PBnxTW?W^kJ;U^8KTH<zPpP(_8+PMBnu$H<x?
z*;y)DP8!!(GyTz*rp*i_F5~`i|3a}-hgid&x0+MjrE?%t^o&Pr4aZK;guT-f8+9=A
zfE$cgv5V7u-%f8VZhlGa(!nlHv%>5U)lyq^DpgVN^sHNTmb<s=Am1l5U$H-j)>qU`
z?L-Vv0ac8hv}7Ox8*8=t)!)7XyCXm3Q)~hgPgyzjB>ghB5Q_-0<hs=UO508A$9H!W
z<E2$wZY>F6JF32KuFtw@+Kzy6k+mfJne`?5zKgi?ZoGB3H&gn|_*h-Y81l>wvAS`I
zH>^Yeu0pK2LDREmOeeF^(tnMfdhDH88o4DZpd~7|7SMUZi{lfKXxr{H+;FBpwhM`@
z$*FB#^CmMYKU{}r=7AVG`_;IM)p-)WRJ|uXMnsAjDM}9&kzz)Q(;p(MSe=&<Z~B)a
zGKi5u>7R<oU`7U~zb7I?7#Wg2BqBaWd};1#h}8{cWN4ZmIAe9g7#WuSOA#5)$nf-D
z5%DwPPk&lOMkEHM>PKXD#Og-!Ze(V2tWM{ho>>#C3-B(GSsJSw#k*0N1+lu(yc?al
zBUX12?=H&Bh}8vo7tGuktGk$Y7iWOgF}xd-xjI%imUm+_<A8A9g)(}o{*u&U#K-A1
zF9W@02ZWE1<ojcHPKF;9?0hwbB~N27Jsi6vhR0vnJ|uH#^8GP8F4y-p!*wTm&Rt^D
z{IESkx{K)}<JTWwdhe2h=IQZs1IByF(?vVq-L<p3BJp#(L3)0bd4ajO{mX<o=sNy1
z5_EH{_U2*`Nr5o1*VL3g2(WA2wlDbTXqufzz36D^Hhkvvh@e(y191o&k{!n^E<)~Q
z|C+-lj1iXT4EDC-gVK*irJXyv_fH(T!i%BG#~O5cBTi?sdy*;BXTI*P?|}c10skTY
z&Haa1JEXsHQ@Ic+>vDS#5j)iBL4<wvKH){g<wL~Y$sQ4M173<=i7~zssYB>YLg-B;
z{P9<fS%`|f%+rw9LYZ<$gt2CLv0=SU-+Q188)H55BPHh1Gi`f@%u2QkpCZSM;c%;g
zE#j{ndpq+z>lS1bW+%mH1A!zcY*<cal!suUf+LAAIEtlx-Sf}%E3%lbL8J!>-SRkl
zgZZ7yl|<z0<cJUhP{>-Jaj|eS(wVu~o&DpslaPP*n5R$za4KC2zhf;eGX*K5-I?j`
z53C_zWqaVD0>Y4=<$#d(8TzX@Epo5{>U$49$4con@G*mO$KKGJe}d7i<*?rTeS{FY
zN}U>vKn+~}EXX*SH^dTT2Gk2L9*N80!^omzj{xLruc<tql*lyZX}HsAJ_4ZtY&cwn
z&nkdfVLBEK<N$!@uGz^B|12hd97Wu9EB%QKrazIFt(gV<iM$MdPXHUXypIcaA|uTo
z#8IfkzDz0c!ZCo3Plf?x)|p5N+Y&_+DIdl5Y~f5~rf??mbq^>{IumK4Gm#-hv(dsO
z=|(yefn-(gVWUGpOVEW#IPF2LoF)+Ph*RmXBM~rs*acqDjR?ztj6H|2UA*bu_$$UD
z^Ee6?a+3fXO!yBmrqXxFucYsgkn$b!hC4Az;qo8SO;04>W=%yg?}1ePb&_XDlIAs#
z<*`|?5+oo<?;yzQW0JfkSQ_3XYBF_&2sZIud}C8)OLyYCnX7H8!~9K9Mm?On@LmwN
zF&I;^!I@$FxA&LFUqP)yhV4aRSB(BbI{a1fS6u!=P9O#Pxe+jJVmrIf5CV1$)1+>3
z^)g=nF8qh^XgeXIDE}d-i`#uj9o`poAL0+7=)!%7p8|q#A7Za{q5BYj)_utI)ZWOO
zNCCG56;=rq4N3r~_mIAn0QrkD?3ti5^)CTiWhbR;6|z?0lE~6IN2zcz1JGNt&5J1;
z6eeEtea!j;a`G4g`_RaC#eBcQ=^oDf(Qh7U0H@$wAHA1e3xs1Na3**G;T+tDxzlLO
zoiKAUu18+C*?FKa(2rn3_PQ}Q{X8(3&05@vIo2LYi3>4%vWYP$rcml*kT%_ocqt0T
z4(3kqN1`r~j9+DIb{zXf%0CJ7d-4pQZqM&es`-77X(s3QQ(YcLF4X)UfG)uN{uO%I
zQuBN8sFH|qvZX4EP|fdg0E>HmpR#pZoW@7&xjgQK1CjZ-so<mO4d$!!FdufDuW*8Y
zJ&`6S_$^1dxI%cV$m)yI?R<!G6q)aHsYL}i@i6rMN__0gjHl}m;~G<N4B<GWDrc2N
z&|df)GU1m7pyB0*p41}hpb*DzNQexnBI`G#5{d=oHzXhyTF_qz=eeAT*$XY;^27EU
zQjUcdrBIaAaG^!-`w{KzrN5Av<1ZxY@)uJ1Tl5zaw6P3S(p^XZuEUOGLeF^Yc;+%2
z??N2N_O%0g&1sDFR13l7o-t8U#t6aujWFsG&P41l_dr?_eF-5l;NbA4@PcCdfx=Wq
zxTp&|4no|zhzjRvjo{J9z;PQwE|~B;b1laa6FWJs0sdW3i95i*2l)3N2>+JroX^g}
z4}x8gg;TSZ$HL=a;Zqa~ca3%f{CwX4KUeNT2ITPpc^o#P{@L3G<nhq?$>X-4kh61h
z`UfF5|Gz!C`FL>i>m)ZHkjDq)acU>924jGK5Ag2+{ym^ixiJ1$2lOe>y*uXc3*k?D
zKp#G!504D!!w2-?4=exK1N!g*efWSqbHJX-HKdvIS+D$uXwMwbhY#2{BNsv*-=x;3
z6xu(&8ZWV+8+QFU(6rU39RDBF^ZkGHwamoCiu`_<D!I$V?_O#Gw;vbL_s8g33+M19
zg4tuFey{6IzH@=rn<SAB7dvo6$-sIOao&)7y@_kFNr)>;!u*@hKjHghK9+dghe(VI
zP7qGzn`t?IKysFy94@r%WPe}FP9}+EC*|<)agmm@`XtxKhkNx2_D1wrd{P_!eh90H
z`qFh{;XDql`G(YWKkewc9WNgfq3a%x9;m#04CuQru)dp&?xVT>WPm?&nclgq2OQwf
z>S(dvHnxG2xcB>=pZxqkhd=*lfIo}%f*;}afdl+G@1Vy5OSK2&=YjRwuJzgj{5dip
zKX?C*)^GQNKTH1{j{UEYzM&3cIJRe0Vg}@#jEK1K(_#DPsL1ipQR?iYt#bTx6gUB%
z{yD0!Hsnpttn2`LOXzLW@y}7x5C0qwLr1IpbFAe({d0&sd-&(5fG!jJ7fSo|&ms0E
zqI$xu2Es6kClB^5fzG6d&(sk8bBq&O65BsV7<*@Ucr7>S1d#!E3~5>a99YbMpS{dg
zF6sA~FJcc3PI6WII|Am5+<z0W_um9iXlMV;wdQ--T_NuM8caps9*Hk=R}Z{#_#-*{
z5i0=_{!(8zZcRIqxbT&V{Wv`LJ+MgZDdAp>OD*_O70x4a4*$hooIjGfkq~qvqp{Jh
zB=@{wp8sq6+bFgCIRE$GQ12e+|3;LLiNIOT{|ynX!utl#L@$xvH$sm0jZn^Nz>Ba`
zsU)k45(sv?;>bP!*Hs94_AfthJLL$0I0>C6vSS~hbjpFYo*x;9%8A`rVd0ab6q`52
z@!Y_-efICA0=la`UHqT@CA(ioXiw^?BdM{Sag_7EuBS7OFksqH^yWd>(`c*O(!;oE
z6M8(j9XWv%<{9OV!>k~k+pai5$`wZmcGkcZN1hvwEG|xh=zF-~=nWCV4F_?9Baf4$
zaJu23vxNd~IGnSB3%lX)%dKSCnVAVZ<H?M*opFHtv!svhFz+ch924axN$h^bUKfX#
z3ZER<3lqThR~>7o*(LJ#!Z?mOLe93Aa<%OR)j#WIn0tF{hM^+1r%R4gY@>5<$<c}Q
zJ+??X{x|?bY*th*IpzwN9N6%;11Ot@Bj7JZJNT^Hu(bqUIRf;`F%g?k<8K%fGE1Ks
zAK$i&o;l*%RwiC8<eB4J=+?*HiNBGU47VH;d%ER-O9}n4KSQE?&m5n^v*=6lxZXSg
zcl+_v;@iA>bC@xBYeo!SJ4Q2BEMk7W8QyKQ{WPn^w*~ZO9)i7pkcb8KW>#|lU=a)H
z%|Bplh=`Tw&EI8=TQ1|<!g@13`RpGmViCRhDaN?<GQO=;Z~iOBhKpFa-b^PQ`?*6i
zzO6!U{uE;)M6A--zJH{+iy2M(b#XV{SiPU@I=-#S`1t-&;;zP+zkjs2t21ujf04MG
zV^r<u%EtJ%dSmMTi^bi1qkKQTX~efJHm=$~R@~iZg!XeBVGE4hKTh1O)LS0IO)B_D
zWiLoS9rx|L)mq{=kF}pJN`63R9UstH#|L!Q@qIY!xGMSn;vLt(?FNghL2Kzt-6<V*
zVB2n}Tg&?F02lO)Ul1^UnS8%!=R1t;`UE_8yoqG?p5Vf{WWJSZSe;&nP1J;-E=7OG
zlkZjt`g4Q>mopEXW<U>JK9>YAJ>m!eKIvow`~TEPn03&_GuD0J?No@6$M<9CzsqOs
z^p_ox&L&Qyq-yB@58nGyp9>>Qahr+Ooe0cZq`Y#u%Y==V7pyc}l%ueRH(J|we~4|`
z55Oj(ypa3Bg7yr?ra$$7JPEt;_jvfgw`gH^J$CH*EpMcEk;GZ&Rhk&pgZt$04AovA
zDt@taxA53vEvT>(V2Mk>B0_KobJLQN#Fe|^nz6dWqrv%#ma6lZdWSXvC!ceyxYxSV
zn^}C*lCa*=0zBGV@V8nsz1Z)$h2K?R)8~?MYq<Hs_ywhK-t)fgyr&yo9)sbS)I(l#
zvN@`geOF7T@l?=x`VHJ2OIth2qiytNaFoekv2>A(%Hv<~(9YpTb5#2O@(XM;O_)|~
zC42yZD|`a{Beq!j09r31(g)Bo5s^NC?iLa018Am*NFP9P5s^NC%0)!_0J=g%qz@o+
zt=MAe189(lNFP95s8wvS^Z}F+5$OZy$09O<4uM9bkBP`gMn<Ne7ZIHiJxzz<vBd#K
z0_iV{$S6ierN1a5qZt{Ueq2N@V&tMUhuGL+=@@8RY_W6<v@y0=ItFTtEtZaf?u{*$
zj)59ti^tJL(74R3*y2lgcS+{v*y2lhcWGvFY;g(iN-|}!#h3B!vdk5+#h3H$^327l
z`f#f53Uo_fZ1EL(4Oj_C$8jxmh5lFoNYVHGIXRtXzM6dNOtO27u_)OcN<2u16GNxX
z4H`G<tqt9&rZ3_Bsc`blCHige<HP{Hbu^wq^7NT6Cx2x>|3Ul>3ZK};{T%X3%>aW7
znMHfXMcdMUj|Vt9r$ei!w}>KA>##i`y!b3$Fc-b`gVfS5nO(`_;p7K^(FtEBdg~SO
z*AnxRZQs`SeX#30;bhk(`o4qqyFEil#Zy83x$Y%E-&fM#m1ee&pIf^7G|76WZq2Q*
zhNd=oLAd6P@Nt$1S%X=Ik@R!s+vAJ2CEvez=O85O_9)*;_%O#G(nphjlBp~H`9t1=
ze+r+5zYqTTamhayy7(vArNcijG`n>BZ~ADqPyfcZ3XUnizwym1Fuviu;os%>wglrF
z+{tllgY%PVwIzvb(ZTiRf5h;CPA*vn1~{u0!=R62To~RxGM7!O#Td5>ly83DT7p-?
zp<N{%+C`70?NMqS2c(fXW7Nm^=pyqJ$2pEtvpGt=)AEw}9TdQ*6rd}zpJfNgaPEiF
zzuhoCT~HZ4886bCKMAJVik}v*h9GS)hS!KekY2@@5TvUiNH1ng2-4LMq;F?T2-4LM
zq^C0`1nFuFnH0`jg&<uGL7KvOs}Q8CAxLwWYZZcYH3Vr2=dD7Ju7)5@;k;D{($x^8
z$t+rhAYBbXn!<Uj5TvUsZQ;CC2-DRuTR3kO0(JFtTR3kOLUnbOEu6Os!MeJ}7S3CR
za9v$z3+Jsuz^<NSY;P3;c6Ghc)G7q*>iNd%Rv}<lFE&2jDg^B6`;7UmLcp$GX58K?
z1nlaSMpY}hSiE|*F}3wlaktJWZ>3@<UcJe<s`WB)XBeT@%f;PRV`S?U;%>X%QUM&K
zDxWEP#TL%bY~Q)gJkkDsku%htO1||$vU{<yB-y<zu|YU6;!rnLZ+)mc^$3Tx;pVS6
ztaW23`mr4DKJg{<mE=kL*$I3ThqoXkgrCG29($O}3=#m<2vTUk%lwp?>#Z-Rklj&^
zb_8)CZ?t>aHQF7phq^d>!CVkHyk{AM;AbmSB$iS1I@;BX(QYh8J7>h@Xg6Gpc4y}6
zk1fDlL5z6mJ8+kJW*5+xK7?5;LUk#5^dmce=->GFJL0dsjeib*{cVnaRYZlRoFT!F
zk5wDYI&6%kb_7mVc|D0a<gjC@o3ut*^Foc*6n4^SMkJ=U`~v+3a}2DgNx;XekFLY?
z*6+~w)53=OMcoNMra=q4UrIh-VjfRFgT(g4QMjd&lSk?yIUV8*SLl?W)(AN&WcoS|
zvzXZ#WCdo9A&969D-dEbnpGZ`BRii`Amg6CQ7n3M)>8G|R<4t0&I2q1^S6^WgM{|X
zmop^`3YV`eAZC<4mD^xAMJ?I&o=4wzn6-hcvxW1z=kI~bBxuF3;}4n`u96sx8d3T7
z%CTP{<FIur!F-wpfs&DFYTC_?jGrn@v)ywn{-UuS6Ui`yQ|qqKw7W`-Yf=p!a}lPE
znVY0;kpcY6jdw*K*Y~wqI#Cat1LF;qsIbr+3%5;2W{M)Q0Cuqwj~#o51<0hVxjr)v
zZ_V%)>=#v3Dlup78B2`D$SQf0@&kjUUiSo){e2;hPe{HS5acA)1$HLX6w322om~Bi
z8$lHMzFN-wp=$M~KF9XONmKK%V5`165o`e6D8E^t8{2cIg74xl^=^RhJL|x#1JTql
zQ-oF5AcR(VhV_v5REOr%G$Ulbm;A}?^pH9-dAiCNinrBR+c;yqwIGZn7<vtFhjw+9
zzHeCbVPhN)Idffme0*Nrd^qu+GMg%64Dw1`j8CgjkG<_}KN+;^@Z!wir#EJbo?dAs
zO7@_-g0!hF9VdE$A3*1zA#Po0z9?N6uN~1Kn;@K;?oD>Wjcd@F4ejl&pFU-7k9c>z
zA2x2?{S)fF;Mg@WiM)Ao^7IYHpycWCiNQFKt1@#1JlAax?K)kNxQOc+E0c#X2ihuL
zPJu_KQzTe)FG$-9l}et9oDxzoUIgp$S5n_Vw^5-*xW7xK3WJ0KIi16A`$I;@0L9VL
zp-~^nHbtZBt#d;S3z170KdO8x8tTakWCcqcYN$&rbn7>$SQYb-MT#1^<^2EkOR?&F
zlK!GgvHBa(Cx{bsBcNLnXZW1xbN9Qu@MUi#x)r2pFl&UHB#A!MCy6$JL>~f)MtYLy
z7#E42JALAGwLB8NL^A4{$W}DnvPCW$4dv44;#?Z_7oyR{IW+pQd>Z|ji$?Fs(kKd*
zOQZDoHBpc!{z`2c#esA{qnk!UXQxpxJkn^;q0w^CXeIk%FEqL}u_T{Hoq<Zh7CyNt
z3UM$JZ+rF0&Az3mJN<bVsgfM}?O)63LBB12x**&qOSNegyb{a>yffo)(W`B?Ia<=>
zxzb}IpBM-DC8Q^(wf~^_<${Qt1beW|ToQapkf7j_k_2^<;JMS^06+Yw@k6m*CC?t^
z2z#ZrfEjkWNNIwi#tA)83%e+7A8;(}$IK)QA<Ab<7q}~dzzKmRfC+>ja~tmoeH6w7
zQ#yJF7k9IK!L9{+&gu_$ze`E1@c7;wc@pnBn<IZ?f5h7-aLa+-+U7mgNjWqzD%BkM
zOFTgo6O_cb%%ynnS9s82KOb+uu!T_!{N|b6Kc}*0_Zj{hzEz#tgzJ-SP*PA%9c43I
z7rhG<>^`G0@wns}Z=w_#R%J!hndv{ap}U^dray^iHiX23x#?%@@ui-P@I8!aH7=3%
zZ;DYZG3W^_2C&%S38o@y>4>s20x8E!wTnIObzO!=*|`G`!+55pX<W$#H4C7=X@kNE
z$1YHFiWDfe>ufZ$Xf`Zf$p<>U2hc|*+V#ShiKuzRmFrzjt^#KwQ-5ZvDj+_{EOI4(
zz)23Tx-0`o&8|7CoGpkCwdWB(HKuf$PCvKJyHQ(+mNiHlhNp3$GBtg$OVBT;5Oq^l
z(7yo|I!A;WlzPOIxr|c&7)tr0^nG`Fl83{|(_3M|d8CN)6NtMMWnepDQhBMTO+iO#
zO7Nq<_KQVBplGxC5cP~8HS8@xQR3~9m?_U+pg4n5n(#P?unHj;Q<WoBC$jKFm=K;Z
zYrpD0h{tjyF`sZ-jmd(VDR8Yy70@sp6W|JVK)n^VA55R=pd3E%fE_wJ_RE|(ZHbu*
zjY5Enp_fBXA}WLfBa~ly5EV>1PF%7DyGQCRRGGSawxe<=Q5lHV<gDZK*pcMC_5w%f
zv*^@44u?Pqaz9Sr%P+sq)CwQW@Bj2OKlM#|tveg@h-fnNG_%@yj#-(f({uQVm|Cf(
zbt*aor^fWBqB$R?hvO?3Uu120x#s6N_LTvCJ;1LA`1Jt49^lt~3?+*7|33J20ew}X
z#M+V7s%~{jKu=;ArLIm0eNdfj!byl?z*`&4Du^n*$&QuQBCmOD*H4~;$QaypI&93?
z{ZpaAd|zrXS3082V4RxJn7Pue!JHFml)?>PuF81vzY;kK$-vfSmM&5%7@82m&Nvox
zObF94bXRd`%9;?Uk&HpYC~QJd<^$+8dovyUHM5hZgFoRtq>dbUCr3Mqr6Yg`{ng3_
z3&Il4jqI)uGk3~3hxokgX#8{vJL`v{P$4|VK7W5KRpX7pN<eiLj0AdXBD9d&aq4L2
z)XyuZPTiWg-!0wP;<johh*KejETONu>D={ILkj7u<oqnh008x!Gvq_)3jsLnOEfk(
zMKC)t(e$EDI3~bn7xnpo$>YELNam<>or#^V&=FveH<Ca5P%HunVEL<gH1gE+uyHvI
z7g<6ZjrFm~_o*m<e|%zS6@=tN=DSM{mbK%Uv+e)6>-~zvaeZH%lB0iyDOKhT5)3bw
zJQL2D?A7|RwlXNx{WR~4MYpgPlyD_fZJ?~(`UFlIEIXp#`94G^%C)bSbz*J&IBO)@
zbW#1n?uH7U$?|+4-lew?qUD8fu7CFLa0??7RQJO-k2VizZF?YmqSc2IiJ6IJXYz=i
zn&okD3GxVt^gtg{;1@`C7IC@@NgBBH>igQ~)r0f`4pITB!#hMfiHvz<BfdcA0t8Vs
zq?E-IWlKC@Cxe;Ej}|LYO@*?fre()k4nGp)>TNGPQSd;63j3>3I9;Z*N}Q8|)-WqF
zIEzspQX?@p4aA<9kTozl?`?SBcf-RwWSjZde38@DKDqWFw=J_Sm9TA@Ge{_7fR%8b
zEwfH<xeT+qtR1rybQ!8&)WB}044Cf<u1AAO7@I<ZGzeymn6&?~cRL)Y)Zswo;6N25
zrYr{{=ivdPRS2sP#(+L&2h4QZ;}jRdeF<uw<wUv5Veco&iAAV-^FrREljm?E$A}q{
zMof|0kbEO%#iFbclSMmn?3Y+FgHu@mzucNirmNR}02W(;eJ0@LdNWt(fn>^=tmb&;
z7TZWht5hlHbo>q^h_i&e=Aol+BbAuey$W_$uGipfkv6^dU~2lO0V00JSVHQg{nJwB
z&udd~tg|R&dNMb-%x^qTHXu-mIb!CovEM=(KZB0(vs=uv4X#x{p6Lh0q6HuOh&ig6
z)$u3Bg0gTE0yW#Gg(5<<IIO0wkm*y99_j5I?VXcALug*KjNfiz7&uEnU0~)gclK`T
zWHqz=XZO2LAezI19FwPgcpH>Vd-(}2+&+##7?zqNe}vntZRv8y{28SAQ%^NV{x=eI
z*y#!zL4%Hk$)#U9Kl|q-(TV(k`saWOMFkheyDUsOR?yv@lrV&<$1#KoBhwvO{m3o)
zzDFZW=13AlQ{Rj<<3Z*c3KN%8Q8Er|;Keg(ZDNuZCUK0SJq%6}P%5`{m2kktVYxJl
z!r;^#`4YZUgBb0ix&19?<X74bWphHS(<)kuA2~p*pvB2<&HflhpY7KG?lApybN=Xk
zUiK!^Gpg-#h?$1b^Pp!cCVQi2ssusAzed0dx5p7kdVUYLebVy@Bmg}#U15vqZ$i&K
z?E{kqN&7$=EH+5`O$5DKO?P*`hS&X|X(r2|>F?t~K27tPi>A3m?|f*Qi2m);G*Q!E
zL+aQ1Mc3#=Swrgfo}>+c=S|<g6@KkDsrJRPvxcpqpeb^19QT{UrKN>yMD=;txAKhr
z1N?Y^A5);&{caC_?6$w!ysa=x&ZSp!T|uudF8rI&>j1yC*H)dQ4Doy9x94iFodbbF
zSR=$%wZi6FPHHhvIwxDL;{Vd$!LmN&4KAz)anDD<3%B%+KzSqAUfY1Dwpmu%Yv<ts
zL=8UwXxeMZ-!WmUb7}7i*lSr^fnLaU&_ZICbsqLw0cv{=s6OqrIY57(_F7pGWv{I>
zm7$ULS{hQJlB)xHY<q3pZ^d3q<iTEB(*9<#0uP$+VX&RUhiIO@4YoAY(qLP|Zev|A
zgKZ7)P{qkTrt)6w5<u`<v)8gm4%ll!d!{tSe{}4%1N>U7{}v5$!PnOe@ayKYuCE#3
z*Wl^>SYR{2uM4c#QAXDP=Id*AzxyTzhaCNx+g{roq58-r^gWO96l!m2vVAmi6t4?g
zZFhG(k9RJ^t)GV5`m8-oXk3}brJZ^<@~?Q1x!$dDeN;S?7Tlq!XCoa<G6XmL7(%HK
zxNJLaILD5gwW3rwR+LIeJu!UevZ9EcC6LP)(wY)>TTvp)f&#^U)_Rh=1&odulpXgk
zc;BZsSJ-hYQhP=5Y03=<Q!edY5R7~<<=U^@)?B{vrsh0ak*aB~aICpOTU{z_xitlC
zxpw=V#he>ZDm!7$y}Z9#vw*VTr88I+mTOUS+0$~?Z^7-5W6v$cg4&js^ybfiq_A9H
znLFXh#(KmbJy~{yb|3w&Q?wI7&uP9`*3ohjvZDWyaQiQctYK)Sh4u4j{lpqhn6`nx
z_;J1ER%QpewWSU27WB_j9dYyV?(SRl<O8JLuA<F;VG5;_u#(JFvm^Op@ov<aDa5+I
z&Xo6`ylBOlpmPT^kbuL<7d<FT2*oO~V92s|!2N`8v)4S3nP#5GuBf-VQo-kvKOeG6
z-_X8F-_)i>4=bC~uk@YXJ@~8H6G*oE;zts{h@*1I!5ASDnbSWrBmQEd3(Xwt^zH$4
z8dXCcR6*EP!@{mwf@=Cj#X&WpMWXVobys48NNq^ls^gbRq@Nosd$Hx@Bjbp)A|eeo
zi24c#V+pr~b%)O!3k&NGpY4Igv1FAdZZx}GCRUZe2K$<AVs*e~It4Xk|FZU{<hxZl
z%x11!aSi;&tf*u43}shXqrZlU569|hmP8DiJ^I|e2`jSQcCg6>`sli2i%BiJKjaLD
zYa)j*4sTc$*`lz$dlcfrmEiMS20S18N6{5b-lL6d<1lQK^BQb7Kiq~#*Lk$Dmv9HR
zHJ7Vu;F8N)-~*+XMD*sLfxOMQzON|Rb%S}t7=m5nUE>p_sU{EFIzY04w-Z_}eI%R`
zg&3V1M90Fd(2juFRd$@5_rYDaR3ujE`(}EiP2e8Ty;smY4D{S2>RVfZ)hFz7=0O(4
zldAWaqxNtGFP7j|d6Ec=xC%fdu7_ie5*Nsk1UUxzdG~l=wY@Git2=)D;V@iNss5tx
zYv}$=#h!<{_XO&YINoj^Ys#Q=_?6>Awkg&#3}?aOXY?ekfLJXt-d?y6jGjb`iA4k0
z>3SRNyFgnVzmK;kj|mk;wA(JLmp#G8jz9}(Wl4!OoJG87k7w4*IM|O-B?uiHV;tP~
zfgqWc-s-hcZ~RldGx0Q6Y}gKF<aT%2W{Kpnw=+rL%sU=lly(GD!7H$&!P4RfjK!(C
z?)WjR`amN-+>r84tIF2DzWX!LJ)64sjG7J9#t)fCQGb4xxfZYkmS@pI(nc6xvJsA#
z9rbjfA>chD;m^RW2D3EZD?8>nGA$9%Yr3ElGh?C>#znT-nu{=;9_w`USYm{7BOtmj
zC@Yt<vn#sn$;o%^^%D2&K7gL1Sxd70xeh+xsP)j$w@Op{#ohKub``^C_#}C{8!X*t
zOqOGB&PoQ60`^m`Wbiv3dPx{9hIJAF>yu>DJ$Gb3I0yx?`*aEW^u3Hv#z($vdC;kQ
zmPB;w9_uLzm!j_?yp58nPW?mP3!zGNZLVqvpxWiCdz-glA2nPopy#6BzQ}%CmfFUC
zTjJ`s0f#`5o85=ZGw8T;vHYv-xOo704x;<&kCuWHpbP6QbW4@(#(IlR7Qvwl>u<Q$
zhP^Z3bY*KtiREyE8tjGGTExCAx-pj-m6#t8>kjZeo@sEFl%(GgWEk`y<7CGfu4yq}
zQ-mx-6b=0)25{L;%*J&nfW6+&u`RQ?V$2WetL{u3O4H?*BX1%X>2eYokpi$p|6eGq
zB}q#8TP4v?eCBSxu?ap1g13oTex2TqQ9u5oC{*$(qyyBT=Qzt6%`Ron3Xx%=&aRN&
zS_$!0faR&xPDRw#WR|RP7RGok@9~jyCcc|lYY&q-Wk9+EsKHtdg)3eC?JLyg7U218
z#m|`LsZ1&J_MFO;m~WUr&XA|t5VuGC@CrZ~Lp~ulDwQKhx$VOPeZa3bQ(giSzRG68
zm)cCYH~t$@j%KmFzFzWRffn*$AqE3^<3T$>Vkmkt`a0O}bf8Qubi!lsOd)v)ss?JZ
zB%RN5LwFlB?g7gxrI*|?!FMb4ecn)W+aphb;eI8T;fA?A-mc<kv}1W@q$E8N9DBPi
zelYp6#&Sfv(+_bq57_AVx$tWjG+*$v+bp@A11hirMR)wr!&gAC^c<VP3<}~SeyXV~
z&2=Zp3PT{u(>-a?LULu0CdX1RWDgi}Abx7|gJoxCxeBE3o7Fvif)VYthr7{nXX2>6
zJI$You+0E2ryb}j(A_I#aY%R=cBf)sUqmX%DH+a2d5^VUQc_%u6?mQ((10~Z&0>xd
z0fBTiPO#fd7h?dxIO9Ye_MJ8U`r}LQU2>2VZjTk}CTD#3Xvuq{DBsy*0|sxs*~9qn
zRNi~cCGREk<UPL{5TxwjlJ~%Mu~2dcTtF&$Zx1@IImQ_^j@Z(k7&UyZQA0?3bZElv
z%3;H6j)9mU28}LCd&_p+T9LRH6zP%D-d&&;pBf%)Nw1s~tt36KIm(2C7Nqa&A>$PS
z6hC4_K)`kJu7^ufcL^D<V1EMLdfoCJct`->#XI$6D|#78zpM)n(Ssq~aqQQkCo{F|
zR_O6UzVj;i&Ko_6XOz)m9QXx3IDE1ql<zJ|-R?Dqn?*APlQvd^<ZW-<j(i6>HY?wC
zIP#s>9ENfROu=m+k|&xW-ZkTq&+^QJuNoive+7VyhlAa@!IbwK*j%>6pP6rsMEhli
zun|!Yvuk{<FXjDY{19FmHzwOZjJH2r(f(Eu7O1AYEv#BuCs>oG3+|d(zxofYsJZDw
za}<)M;GdTQ;XCN8)0PAhLnwg{%?zb{36TCjHGQHwst2Ekr01HyfAr+Lzs-~HKL5Ly
z@2(<9IcXci`wJ%D2?Di6EOyj0=&JU_%xov=3;8aDo-gD(%5!e{t{ZeySiTe4+VY*(
z9E(iRw^H?P`3_Fp?cM<q5J?CXlQTVO0R~7m=z%bi>^y_)gQk#?^j6BT1?4%H7^FA<
zP_SIcb9X_WdkvA_t~_@}6iUc*0u@=A?qqgO@7#s$L7C{#Tc<<5NV4xiri0h_p2DfI
zLQDq<0rK2~h2^=9^OfgPD6b#$JCw!K!F#iVkkAsDQRMuP^fEp^x6v+y9oz99J}KvD
zR)n^KOD)JRc;c_ar21UtInY>`-^M%iBpuWeg_v7Vn(Kx%cQRuy;dRM#<gfND1;rBb
zTtOZy<T<^W>QOMK0y5oK;vI=6rA%it*|5!IDYfdXVP?49SoqJ8=S~WFj$Y~XmNU@g
zN%@E3n0W#f2oiH*x=h9lxd;5a{U=3$RXofb7C+N;fBL&97DYfGIJAvv^Efy(xOFP{
z$@mLKEH&f9_|b=>?LWt7zEtq@NUxQ>g7=;i$phZUt)>sHnE8nh&5C5(hp8rS{D64^
z{8?n>kDuARvFy}Lr|`Hzr|nh#>w&(zApfB^V%W%BCz`*I{D;0hmSdW377;Alq=<CV
zV9S0~`LXhpN~P@A{-!`dQTz;c*`)lR)oTvnTgZPLJxV=l^yp3g8}G<}z;OC*sDRN%
zl>51ZDwwY31HjLh42ifL`7md{g`*s<L-&K&UkVMk(!u8L%<6Mrgwo{aXcH^~rZz!o
z5`d51H2QzfIlC<;`q{Dmgz+5_vUzlnoShLlE44f6Ia8aqqf~GH5jY(eZdZu22Y?r^
z+2xP`6xrU0QD&cB0PgBFZjK(duy3b3u{ixTWZ|T=Z=xrk_AnXV$HbH)?|qMB50IB}
zYc>(~MBHc1@=u!;NQ|=`io?zk<S8KtfCp@LFs=rL`I=dZL{)kWOFuWz35G%`>uC=l
zw`M}9ODCUbP@j1t+591o`S`f`u-@`Igj!_fH9PfI43eM+s_HR2hxo-~8Kz&8SeDx2
znU*MJjciw|dh6gqDQgW3FNcy?dB4!|N0RMD)8+!Rp8x>8btpeD0aqxs*J{*iGkdc#
zk^vvrn-6atfyVM%RlbwZGbRih*?Kd5aq0WCG<V#oayz@`P;iLYerqUo2JA%88R)GT
z{-8RANBBe-N)kwUA#A=&(EHkaY=;5Va-=IoYvb??Zv;EPtR1E4b`G3=xQqi@MY&0U
z`o2-kFX?+8#cj7YGUKH8aZlo>X)exnHz7Xpi!CXD${i_w)C<~9A2KISxmiU$j^Qy>
z_%r>}X2PCOY6Ppynf}ZrU}nM}h?cHoF`(=5Lt$Hre2_;~`Wim0Ed>#_oJ?GjS!Viq
zGb*!4HYqb{Ice0%<2B$55ba-`xmLBf$}kdzS4L6~9M-{A;0f~;q`M^A4NoHV>93$x
z@`I;6(UYLTpW8HO1mO6tB26U7_n=0va&+%Hx}(i@KZrVdjpec|L9|_S+qTOx^{Oxk
zo${bG&23w!(4Qf-#k0}&yFJD=vh7<UocOztf$erJAv{api$BqRpl~xr@&z)1s(6<%
z7UFf1K7nV!R{^)5NzAfy$55$jP^suk>{^%ERfwLnDUoQYIfI=^un-kJ14RIKFa|9R
zDxX^W7!veFZ0YgWLlqbR8G+scHa3k&^GgXF&``3=S7hGenskqK@5@A*A7<VZ3|9OB
zo$7-8j{S_!p`&Qrqv*E3gx&U+M(g4r(})#VR7rBkGlN{Y7o2<3HFqNnTvK<`HLz5H
zbHdjmnJ~R+1fj1jnb&}>z&#t#@B7@FkjkARhYBCU>Y88Vlm}hU83ID789p>15!Bs4
zCdD}`b>FZBV!9>0G5g?+8C^V6Ty-ohYcmZcO-w<NJnby-d<XzA;WV)K+QsEO&Dk(j
z?nbG?qpN(m`iok4E*&9ICU)D=P!n>UUjaeG5iR?4KgtoRcLP>GMySJRHjYpnoxa5;
zB&$PfWyhuz4wKm7$GJ{9Ba}7On&nG&60M86Np5B*WQx$BCy@u(G<r=5l#ysvJjBLD
zY<X0|e7LOZX71M8Ik~;7Xw9L2{PLH-y#I5N+5g)-bP6-ku;&Fhjd`X07gxaHvFAjp
z@_R_Cm7Orp;6;51(_ie~RGVF~Wiyu0v-ZRuH0;8Ez)i2nB#VDEy)W4Y`IvNB-#v<z
z>7YK(8%cdCTOSNPB-486zY@x39WFa=*JVPXy7*D#o;AV4tp1BfJxKkRq8Zj#U9R$f
zMCs=MimK>mAMVeKe(Jqh0t#bDIXeN-B4M7|S!N}|S<Hi!t|t|lN88`N;@CT$1MNR8
zN_pp%wVQVaEd87aM>c>9|NW+)22mM@fU@=JjeuB}ouv?``%{yV4ofUVI<E3o<kGu~
z-;`1&2Iq6}n@ab2IYPh%YxI+A6A_Nd+#tL0;Z+!67$JI0cB62Aj>_Y1MYY6*0u;oc
z)B?&9S$+dfbCDd+UWJP$^L?ZNc_{Ih9EStPTJOR|_0Vg)I!|<*<n!T^gS`p(=nJPF
zKRN_b=TqzOpX^$x&xJ9%R-bcXcgNnY?r!s;U=La-?Tv{Lp9S{ULYv4lIOdjQ$2}NI
z=_yK-4kN`{Z^J^lazK{sYK%!|DOuEMTYqAR?P&O5E?02cclWzoF_qKAD9vAr5v4hD
z2=8o>n@w$do64C1JsWufN#qdI9C?lryV)O&e3KtHN7@kZ$~OLusYgXh9GFNe7h(($
zlRVPSA+<L`fvq1y&%dL66fJxo_xipC5zBT>mqQH!$G0z2fD~xtY(0={dp+4TU;p&y
z(0wpKS<OP_;(4w6O+_kx*AOLH3@FEM$_js4bxpg@Vz^q^bF31^&&M9cjI1C169br8
z7f62`sSB0D9w>7PA(3bGU5LL2O7+Kv<P<^;nix>X@Hk!`NO|q?@_^?B7NtIvei>>-
zyC`<G*?pSDnz6M-3pop^caP05+}3v|-@jb{^c;L=zL5N>S8tg?&E(v$Im4fBadNAP
zthRfifhi1jC1ZeJB;A6gzXgF&NS$6hPS3|TAgFJn3U`OE*@Rn?m=Fu?B3(24rfZPU
z8jQhXnL^uQ<~}E~5^~o%knj<FlKu+vJ(s#9yQb-n(cikP$W~6jSrKpgo48HQ@>zGW
z$3ifq8CcEU!YQl-6V6X;;ZSd$$q$8qn7)M{QvQ}?<ie-7Cq7RO0siXo$sqC`0Xvwk
zLR?~D<-}{Y;g%inn)MSU7Mde_5LZBU;hsPqjc}r4?G@YV(>x4MrQp}DViauFWY<{z
zvoGMI^kz)Su}4U>fdUQDTs1(wooh{`j#<u$%tr&<hX$aam>!P|3bdc=^D6au%>KLv
zpU+9Zi;vyd=0w!S_M?$6@SQ;Tqry#q!ueYyA{*yCw(DFfTbJw_u7CP7_)0eXPUgji
z52Oz|dDUQ=get=1(}RM|)8N|a|AVBmw(D=WW~D;b$8K<twN=%2lU>{GXr5-)r#bRn
z1oa5Xi?dUPhIxx@IT$<))BSYJDa|?bPSowIXb4%izs9Yon=kzqZqEfz$*$@8V=J;*
zahD6T@}$2ga<aGjIhv<Z&P%;GD|QZ?aLkWXIujw*3Jc8Og5mj+^qSra(OU<Z$WQi&
zQTuUc)IKUk?PI$Sh@L}c7EBNBJ@4Y4ozK#5=J9O$W4q7>0$Yh~0#hYvPIXk<<qQ*I
z8B`~915bMF36V9+D~?O+1+Sh$V3S>gcj8bvFi-d<AlZd7cO?%)shX+7^b$;0%_t+7
z2A5~XxgYKoo+zwmg|}8Q+05#RvXiKC&=2^fM@kGfndvRmMPcEuJ)=0_#mRO0zPtQ9
zZD^2nR{+a3(w;+!;SOugd;`?)jEA!*&Gj`7;Y0%Kc3)XnVpQ_9KjH7J_5qwGwC2e!
zzuvMM%8%sf;re4sdDHGUZ}+9=<2E}jn}wl(M<V^MeqTZJUyC2%y#T()ut}C-B)IVR
z^2$>z)40o5hjdqC;B7|eetsv?e!4(<cNztsqs@(g&7XR&$_2+q&a)4Yu0^JqE1!Qu
z#?^Cv|G)5VJ<9YXe(tL`c@@GcMAp9K)grgN3iG~@0=D4PDH1U(!+yBF8AKY+PCyC>
zsTT}BhO3?D3LJ>IVDLr#hyM=iU!047!MM&H0~f6R96`^y_7@QUklfC__Br;T-1$0`
zS1^BiXP9+<YcQ-3ZAPU$!r3o$(${AUs)40n;0Wy)3zN6-{1lgV`0>Y~rkx{o&q3&(
zX9|tGD+R{JA?EZ5^tST6bg6kZ--}^Qm_KoGW`%9q5r&X|!udJKr5;|U>ipB{0!9F<
zaG;aEICHbiQ<Vq0=<BJAhATIzioR5Rq_<oL7Aq5$rY~p2uHn@(SD&cixXhg@H`Z>7
zT{~3hMrqI)C5mpoh{9taN0Q4?HYksSP#!BCm8<ZF@%E>gpS!tFANVhzZ-c}Hxm%34
z9b&x27&TKI3#RW|=;sO2gRF%dv))0qJx3FRb`AAr=D^yT!h-c%f#uXAV!(n@pH`bi
z*ghona@Y_8@y!}mc04hHBbBccER${^FiItcVT9T_h@;amXS!WTl_Dy3!TJ*<t@EYl
zLi&fZ^K(xwKcPf&0r}~9=s$*G3=xwcM`(fQk+0?;z6<$p#OYsLi$3@n_S`Z_*WTz$
znakWX?GrS8Amg*i6sD3}LEqO)`o@vSAQ~)B0ezo9ZY1%M-{1fW14uA^5I50o8P{8$
zMbw0iJ7i%JB0A?Fbk2<O93HVo+AjOOrtnW7Bq7*dzJUQ;n|=-ZdP4P3V=&oHW~Az)
z)?idZognXvz64X(by(QtGrbWS0Z}Z!T@kz(nVF_4gQ`r-?W%TF_`w(o39QE;^w*(|
zN?AR9C&RO;ak=oDqaRF>KjMgJ;umW&LdFd)9AD`!nlE`PxFT^35k%8~V<fjmwj4I5
zSTp?7W&~i`^qBq#ADb_luL9fR7Fs-PBw$%bpqN<GD=?jz6FuDgk}*_7uqxzc>K3gb
zZj3|w1H>>7nzj(&Qz98GQO7n2ecw@QC#-XSQk8&)H!#%am|+e=BWDd$tt4zws+CL}
zScuw6Fn06&|LnaBd|cIa@2`=^(%1|>V-PTa0!lJTB`}Eu3TTi*WJj_EH6T02CMg7x
z5MM5(jj?BJC&6HQMxc{n5~r8krfqIZ?mxFp@9l%UT#}|nGKpl!t+AoynGi^G3Dcp8
z?X<>rT<ib+?S0OfGkO@C07<FlW9z*4W9_xqUVE+IUVE;|XAocQ*pg=LQ`RU91JD6y
z+dd{dP34o3$!f?kg%ngVGrUs&wa8Z$N{~pI?Bu1pmRa78?KC9<=}n09F^JPP26-~`
z+MX^47>;n=M4R&sb%)C5`|>{^CCNZa-qCJuQ5;c<{;(ldPTF?3H$qY6g>U*=1Ow`4
z8Gc4~73w>#!R?&?3gyTVhaX7)pK@9$rfC_fkvYu{JgL$Ko`=S>aQXByME{_B1Yf!q
z4XuFepX$zBPOgo`xJ$C&{(X9z02)5MxoKXC_EE}4Ht6;SJZIql2xntCzq#~3bwP1T
z9h`_2m1U-rZ4E3@>)IZ150=mM-ZwqvM6CL`4sj$;bTLW=sNzA(m{9&)k1gjKwloas
z9uloj@_L7p{|*?FlK%L22EM90`eRb7{0a4+>tE3A@f*xxwKAInR9RaUUN5J&sr@lU
z0`AAW-VZ%7!Bouai;uyix|^Qi$KU*}&atQ(tVwH?Mb!x`s=OdmOmBlg8fG%#j&xoH
zIN|^^8+R8D?1n;`7^Mf@5wQjI?6dTwbjb|%fpSxbUA9=*E&ZWU{houh^UxXMsy}4U
zp6X#iguPAbreR%HaN<5pWZqj?5bs=&$h@6x+4VXbz3<xyilHWZVd+we6wZuuVK(CK
zV;*Ef$?s}=q;0?X0*}1vAasXTS^`i}>ChGEJjt<(z}L1@I#47ZD6WfwB60FRLx}Q_
zfx^5ucHs)|o!$(aDGER041AFila`iW8Zd_0EuILTq&wEOf*`_6m8$Ae{v_q|a~-?r
zrU*I8?gc2YFE=VQF3)?LfhFg)6T)P#@>+f<`&4f9u<#@$S<1|3!5=<K+V*hrdFHu=
znv%<bWhY+vX07XpQ<^45Uu)8op^7C#eA!MLHoFI%ZT#~<DZSeAFsay*-4>T}Lq8UR
zJ~Lzrox)xmLN|1fDr<CNL<W}~61LWIhepP$OUjKw;Z#2;iGSDtMtItEZ=`JufXKqO
z{bn5(r1+hZ43Yjfo^Bn3uM)cFe=jDj)~G?1d<!T`+(UEJ@dYb2d`yOU{}K2B)P%*8
zfc=PPmK`m9sKR(bOZMLs0b=Ae)!FtFC*LNU#!%E<6dxFK2HwY2=^gxW_Zfnity2;P
zisD1hRR&Q7S~XPGK5<hrPz8;t^~Tz;oS8Mp+(p|68kFM1GiNKu`Eg{Pj}{T-^++$4
z8ET;~e5C<Nac-56ZJP>zjbzyMvQa`Z|8DKAk!^5KEuU@=v*g@|GJwnd48%EUbPcRx
z!g*y*gtDi&``GWVAyPgw+#v2guSt01^c(~zQK${6XDlwH0WxRM85?RcXOz$Kg^mcr
zlkD^MiL$Q7r(B(#8;s%@u`1>x=`T~^QL6mo6~9~uyC2IhXYnXbA}5cg)6$b_;+#`+
zt`*eaQd-qF=r2&@SaB&GljBm9uzsQOqA5IH&>KBx9YXN9@F_Flh-!q&g#rY{2W`JT
zPKZjVd{y*A^{L<^u;fqUQ>O7L)t=}H{QYanKietjG(IJaZ<@xZXpo#@7w&0%3VyMv
zkTb`HPuWAqs~++y_!Qj_<5TY8x@yMsb?X&212lei12^&UDYDFXu2{~-;Zs70l%fTu
zfKR!H*U;+%e9D)&K8DFuB1Y=owklE1J$#C^@T%F=E5@fpC&i~k{R)ThDXR0)@hN}9
z<n7q;DK2mO?$2;30(?rP5MQ>$!!LNWLi`zTIiESdsu0J9PdS1M&iAdV^`ysGbi&c`
zDYx*Q=K){Isd2N$OZNt;0VPpVJ*k@~c=t;`&_qvKr@^P(&NnE7jjF<2>$nf}M2mw8
zR7H;!J*>*rJ_-Ak)8f=MXy7*#^C_`+>AU1{JoPeIl`k-7_bT;SP2Vk6<!MgC=!q~^
zCFx^T@Eydo`9=OZeQ0qL@7ISOR%IM*r*g%Aj8DQ?6{U78)X1kcQfr?e>qU^e3={%H
zgm5b*Ar_`6%hZ6CXZWZjC+oNtp#Kk%=;g}NYm7cW?{3=|i)oByG{!Dvu2>MqQVZE<
z487PQ#U`U2A$v-SA{}mlFn(o=o_Y9{LC*blFxCXy4yEJd1&d$N3U7}Y@|+rGNR)O4
zX|ZBMWn{84fx|6+<xhF_*lNAXul0?#)){JjE5!Rg^%00=NXII;htUQ-5X&V&k!=4^
z8ZX<0rv$P5%W*TxR3H{1W3;+L1`1Zy2(!h!&scX1h(#8vc~!LvKrA1dx)4+KoOkJy
zV*#<mr%wC$Kr9c?Dt@)XQoO$k#G<zZVyQr0CbZJAf>^GyAeJl498}O<f7)r*H<cU5
z-M3IRpe$dY2*(a(k@$RNP?liS@}VqK4q3lEl%?jsFl_i(j@RSpV@Z_PV~9i@f6pt!
z*+}U_<I3ZB?}W>y0ilmUTH{Rk{s(yXzfJOf_#Hq0@AK_cSe6!?LjE^rQl0_IsO#0<
zeHqww?cdk=Jv{q8%JldAmp$T@`8%iaD<QnOhu=AV1jj3<|1^H3ivGVmex=%82);d=
zDA(nNqe8G4KW*j|&n<S2HMCma;dTt;=X*x+`Iv66@J;LH=)2CoD${Isr}Z6Tkl)$1
zU+`=^$eDMR?&QS#3W#BQ3ZLkicmU)RJ+sa1XJ(A*FS$oLwzE|lMe{wWn0(6(;SBx!
zh|XS^&EOkzjUQG!#@AqC$NrB+*;a!nW0=zeU!Yb~;wbEm7w|F5x$0H+ZML%K@x=Q5
zFjfDiXR7`U<1)%#SiacL*Vgk<ULIBTYVbikTE=VZc2(6%cIrCnURR#2ztxx*^P%@A
zWG}787fs_^rtvMuhi|Fs-&OdQc^<1fmeo)5P%WoaGj++jYYoKZ0<Qy{VtuA5AJuY>
znYc{G?%D5$ur7kCS7Tj>pA?3=&~vMCF6|YZi!)H<bKj$%iCGaf4(;*|uSzG|DxDtS
zTh1(B>Q_q==_etuORHC@lWe8l>^bK%Z!V`Mt<ewt7pgHZ;qE)7KPHTS$xNWXMZ8R)
zKY9xl7xX1<eXuO?Ha_cfK)AfCZU22JG&LoK_^{A}oe0u|CrAk&qWV5&;V<S*;4e4h
zkp<|41KOk4#CB*fQq*9MqTM8IrRY59kE@x_tJ<l*9i)q&)>&T5{01dMg=0RMm=y{9
zY!8@bpo9$`{H4LdUkF&RuOidEwrU0gqgcs_Lj6}F-;j7d-z)GO80YlL2w>g^bFn0)
zWqdKJ{FO-N90PLs?!Y6Nd4o6OzcwC!d~^x++pH;vqCsrgVh1R4cqID|puNs2)G~lT
z!oU}-g~kc@A$Rywq+}s4e{VxG0C;Ht@S+*HEt_({6Q0b>E~Kq@8Go?{x^hQF^*X%l
z{(dutw*4BRev27)vKZY6;gjZ-aU{0jmSnNLF9a%b^1H#XSc;2SrJY<F+-aLfsS}}8
z5^rO&v|g|m6=Xc2&NPG?hETm8EW&p1Y^vPu4c(7q{~xg%MU_DaVVFzc1i@R(s(k`!
z<WDC3lK%L21|qtnKcVrgU(>D$coq;SUi_4X*D`(zn6v0qCixFDNAS(C%XJQ>g<ZIq
z$yZrn?V3>#LkXcueOyZ-{kW6A3U$NTX3$&>a6qEMpU$>=yT>pQW{508a8fy^!Gx@3
zN8`@kl#|yQL0X;&aCCKy$Yc<H^Gb!&@S=<KW<Ok9SKFE8E3H#;wq0Vnh#&>_D>k(?
z=_|0W3BaU}5&h*0{1VApk)XXl>})-|a9OhRvc}Af?k>d;?oYbg2Tw0w+V-Hv3X!Yc
zFr*YDvLTM%gU+@Lae8D60>43sf`+BSa4b&sSm24Gem4`4OEEzpLZLUc2<*wgLGi*f
zG`+L+0TbSi#7!s(K3^g%i<pUM6*88@%Kw)VT2+ef`0YZX^d-LZN=<khlT5u=@^jqB
z${+S?bi1?FyYD_mkWgy0Jn8Nu>MT_$pC@cHbW$AIc>hwq>#n{-N!)#2S(ecBz;SB4
zT;i3q%4hgrDMpO_!b*ys-CF&fsO<FImp!erN`|UDt8!SImVZKBD&xh({pdfHO?`^>
zFujc!AS=G|^?3GyN+jNfB%M2$Nu9*S$u;@?nHU#yxp@-CF`x#GMG$;rw-8kErW^dI
zwM~UN;xwe`Wo`T2hs&pI*`m6wNDfBagA3h<i69-%yz`qX7fSC>iS5|lP`EPLd1Yhv
zaaG(8=b}b4)z0oH?-;l0eSLOzrQQ=gx*>T`rQhQEXk?FOb{6+S7f?_FCa9{>w;_3E
zQnNZP>M^UwP@!X7&*XkxVNT0ITjRu7t5|YLP}|4>x9;T-*rD?Ls^wE`D*1F-NIuCD
zI+<{?E+Tl0J(dmRoo>;&0YUMb5-$LR%FBt{glJLcp0s1fZO1nIG*8v9ZIIsH6tFR&
z%05Th!Wl{W#PJ?o1k%WZysax<8ST8B{2zgtLhqnJSVWR}Pr@zkLEn0vfe$bxE3S(f
z0rw4k=Y!k4^e^-vbrNsFoGH{$ymSs<`QmL$ASsq>uICGi)7(cDEAV|u_bFEsQ)l2J
z9+%(Ziv*&<F?fT^ZAS(P;$+@AS;eVHqtXl|nJCGF8)T!cq=Rf0B3CZ-9%Vl1-$opD
zDR+q@;u+Eg5_t0wG8m3M8FNwP1?HBXpi-$GE59{#>B}4v$li}oIn6vf23d4+rBA8=
zz8tbAR3Z2U{ek_rY2EOU?QCNY1TPHF-Ko#>v}g~Ij@{AXx$P{P&!+5n9!LBn6v(8p
ze?<^KfhtGo;4aaMMzimf;Ar&)CaZKwFneRAoVH1cF+LjY>`G;JV|I88B)uZpc|{{(
zA}m28<#U6kHz(-0JHvMZTwEZtGJoOjEq~dUOriR2ga}pj^+i%|!$%A6YTzj>x8BO$
z#a7fB*$X<#6G(FrNJjh$uPpI<VgHhl^aYQa5TQ{50n8DT39CWN=<t{zrehbH62W@z
zND;1PR81^V9ItqAe-sMDdDRbdlgN#YWeCw9FGlZE#36sFW>0GUxY+o9WyzcRf^WO`
zb`xxA%4?ctRBOobgX>StXm?BpJ_0RQ^|R@{4)3oVt*Je4q`P)pA#DC_L)G<Bd1`8B
z)I=wgxKiGuJ)fq}(dl;|lF+h{rRVtT*MT37mp?~pYWd_mn74|VUmN}zPml4}|Jmt7
z{hh7dF~8G>Budafc|L3M=aa7A5;nLuzP~#j$)21WiW6|ly+WJp*6efU)|KC1=uZ^-
z8ghqbuRForRkLfb&fU{p7Cb$cJG5ubLih39!wwTNq^n}wH5h@3D$pQ#ypSkl1h;dS
z%M=h>fV#7Ei9c0kLzBvg6%w;Sji}F2%bPUi#r8bDyp4svreDMIrc8NL6U*CN=$rRz
zSl(7s-qwlbWp!@Huco|=zwm#dyG!gH@Vk~zT-xobPlU(V>gPREKcDVTrvFd(r`J|q
z{io?qgzBvBpWSiq`l#|eVdM>i&3Jj<Q0PnkYUIsP%iCzm%V1Mg-dh-a3M>Xa7+H6s
zyQ5}@#!H|#<(^FkwL{^WYZ)XJr7!9}oO^i2CbU6rUS5p;on{A%G>QhZ7Dms9BWxR`
zm#>J*#8+g(!fTA9A&BgRanu`3UvB(tHsxpV8DIW+1>%VR`j@}ml%K(9eEB;H{awEv
z<@d*{?&|)a@#-k!kr~hWrXH`R``2{;^0e#MQa=1A>|a*iZ+bB?&VJ{u2h68pGTr4(
z_%C^Qf|cWq)^wMY(aw|K#*q`e&}0`lAovw`yIGT*O7PBhOjb>-g)q_f?18I6E9rxk
z5khK*#Qsz!@8?4%@25D&J&^Q)s4=W=j)o7$6x=l1i{DNO@VWwvTjL61y>d*ga35ce
z6XdNJve|jEacp&ztJbCcfpefWPdMtk`3#`947wL}q;)DBY5Th_yogiPqqXh)3!v2h
z<P^l)w{6r!jGkPxsV&aDCRiAMmp1N5+D%D6;@q`_WC^WbH4JW7`0F#M2}@F)noM-0
z_Phn@BalDp<OCr1ZI;f~y0!;9Y<xy1|7o6llhkUs<8pBFx9Seb=#KV#%>3>*K~?HX
zt5-7D8`uO_qH|{HH$h11nE(`-9s}CoN~vZp{HD+aTxnmpO!GHo;NwbI^UN9FoW+6q
z%DT->Mg7mR_?cg^E52z|jS5+GXd#l_U0ou`;OvD9*wUrJ+1!CTFjA`)vYZ2Bq{gzT
zAQ~{%^@uYdE-X<0fgxNH#<1x#9S#bE$a=5m$UXy0_eHc{Q`?ZCo-?pbF2%p&&$t!8
zfJ4Ry4`J!5aM>ciC}fjl8MKh?{n|>%#A*?qSyuTE1FQg@)x>gPyd>JhHWa6PLWFWU
zj~`<IpV|pZaSXsWX?boZ+t;$^gtZ%rV~wh0^||sNn2t8?59RcKcK)Z4*WL;Ap-nIL
z!v-(tt`{N#tbEYL`*>C$a0tcn<G?7G&0Bpqg6c|?J}<IGS*Ny8UyT&y@D;hza|3c&
zWQvC#;9Fe&JY;`}e4}3KZH1A$3)y*WML^H_l2>?6@2Q-AxpI1U<y8EppV#5M)4aK7
z?ryA{ir@5u<{9s}$~&(2jyHJ6>%HTRIyzf1wzJ>Z-6@d;)wLgHx`tzl<0_6#JW@e8
zO>%mVJ=F()Wls~FYO@nwh;zEpo;FGYE_y+VF%97&b)(*<nO710#jT^0+{e3t*jz@@
zJGh}LEY=aawe!CZc*4B$x&BjM7;wZ}qeu#i=es+|ZE@~k)X8TYXkKfu9vC)E=pZ6+
zSzL?Xz}jw?Hjd>kR){fz=}2bOe8se`_JZ(ZawREdm!jUx^Wt)OAI>89)|*PR$q9b2
ztYJ!}cw)}LzB!bDDmdHn(R)cZcOdHAxrA;{QRfx%o0L~%$Jnz#WERg*;?BU{I8dc;
z@f{nosIqfyCB5=CldV@JKQPcts`TanKXbJDz^%AcS~C~0=E9JJ1v?(>#{299cMoAM
z&Me&z6@vP>dntly^XKX;wH_ts*g!R>mfK7LLkSU@=1nes@I5qGSK;!M36%DgZs^cu
zqd6f74eux#=4pkyOh52(K(@B*2UTLYXdM7Fa{;*$=plbD$BXlZ)0}~`R229DI`*e`
zI0O43<hcaWAj-rxO`6!oZ$`0wmMG|r$`5Zk2;FZtNEPS3d(-Un;^ZaoaaL&u=yum*
zNxJmF0QXB{iOO(8e2{rKAs45*(>pTw+vk<O%PRy8Dbx_u{vlXrTZ9|bNco;*^0mt(
zm!-Nl9a7HU;?J1#-hG9un$wp>Gs~23CC}`#(r3sIkgt((k}J1!9U09%udU46BO`?z
z8K@&Ha}V%szc>LBxgAV6)iv0dwI}>}H=mOiJ3!fjTqZrBJ2LDNGH9Ob%s8J!x=Ezi
z7jYdPbq$*I7Wpmg<Od16qc}^YPjLc^61ZYO_!Mz#t+V-2PNDb4Z>PSdk~yCneyKNE
zL&IcaO*@?Y3PN0b>MxAE*#F%K6k_>_#y_&{D%!Eq>Dg0K_z^M0Mm>6H<BwQ3r@+}P
zTas{7W5_dJx`uR3FLCn!;{+aiZ0O|wo~N*)D2}S)>f6${ZMSRhge*?}7SMkK>T%sp
z{-c~jwSG48<;j&KD&lgdj|5sv@8a>xms#bgaq@qLLP16DB}YD9yz$l<V-e@h&vG~a
z;NZ=v9%sO;ZoJEeiGD(P?J#?q<v#<j$h28gSQYPFl^~=EH_&KG3-mx;Qq^I|rFp2-
z;EN~f@sQt_HbJ8&x#bffWA--hN5?z8Jlhu(?gR4vUoVdQ4dr|PY|4oo|4`TL%%vNj
zJF;=O7BB4eD1jd$m(tBK(&M_&le!`I+>zqP$I=J5?+lzlk#Yz3IQf55j>}RvZu=R0
zylL!tSbAL}zJOx<J@mjuJMcj7bQTiR?>^e6##yk3L7)qHEv8g;3||Y^CtlNt0OhZy
zs{Z}f+}P|)g8aL@`kMzd&DDH#V{T^z#<`v%kyeil?-C+Z6$cf+p4vnaa5mS&a~cgV
zuFIZPMR2WTT<EUS#(VQhT5qHMSy#E+;XmT6WKtPzo>Wq#ZFgk%PuWz+Y{{Zfzq1Or
z#5-?E2pBe}oTYd-Qjb>Z)LPmP4S{)*q?I`>kHhseK(YNjM%{FJ_fnO9V+I;0h&ECL
z>KAnzEImr=xZ#Iyn+KZE9j=tHm`UA2<)V~x{l#;rS*2J`elL8s(7nah><|||X()(_
z1_i+f*cG8j$);TdCLRJgd-lMPhTxjaS)~m$;I5Lh^+EROdzJ>tpwK-hiS$PY#>R*R
z*4yOVT~qor7lSY8^BwL!5;(sY6>6$g05xoa`+P}mkIvRJ@=vdyvp@RzNG7)6((KP*
zrB-)Wiv|fc_hOB(*~<Ew)D7jR`@rt<r|3Xwy5zd~ViP?5AKK3`LZu0JpWc@_C-TI(
zeA)J(myNTvF?Mm|ob0UmX__Lthp1Io#gs^y-H>A{r-abfA*VNQ`eX4fqpd@cE~n?o
z$P?^U*zbuiC;!(kA*r`oC125}->q(Gr)tP0X=SAgxD~Ep_2bBJdS~WdZ=l9#Wps~;
z@lDkpwwFr>nQwIvn<}b@7vGeLnF*Ij>@vn}eE~P@rR`g(n7%s=737@Kd+3$E^1|YZ
z2g)Y~1GrMO`p6l)6i5x^MdaeTOk*jkyP?iRx);|u1OK9VgFoCm8VJhCpvs~5rIRcS
zk!xTNAMSp^qj0I}N`z4zkiGkbg=PK}PRZw0GZ4UMBc>P6@&<$QOmXF~sdg=V&_Na(
zX^e6@)Ki)({e*S8BasL_Me~ykUyId4UoTFra^9;=SUXC?|HdMhVC<!Ytxo<#6^{NI
z9)sDmvLJz?(0v-g%_z*s!ezI6HV_;-cpte*S#4*WxCRi~Jm=H@%opP{(Wo@hP~9c#
zr_@ASfwWv`*Afv#PD_EvP@A=i845bJA4?lemNa7x8ozD7RJT9nR?wDn)$n<vsAt|>
zD(KO;*0&FxfschhJ5elP>U8_nY)oJIL=0f>catqU<`Jd3xzk7+XW+m5EA4zP=>)7}
zPQon)y{<v5Tot=*$RpBxugjcHz})@Wi&Tfq$4k#KI{T@FviB(G<hN+3GI~7m@%CpP
z^cG(!K5$p*OQDZRgiwYeqesF3#a`>~C06D^VgxhL&~o|T;j@5npjsnD1wN;=qB=3s
z8&@8U+KRyt9<@<F&gK?e)5^X#C|~KlET-bBv<3F?E9M=oYB|CHazC~56w9s)RbFqF
zL;{=WXn|sR$Wtumz=DBdS&q3~zDB96oP3KaG>KY>g6qa+T+GMaVDL4|DD=lW`x6<W
zt=4*rNDQ^mO4v|1;+_U%n1)jz$!qKgv?SiSB;n-WOsN*QOX8(wP6Cm{zI-=xU25eI
zbu7l~2OH~0=0~JE%`@T3v^0g8T`SeCAqI2S_Ku2tv~#o}e~xCN6|y6OnT2P(buANS
zG$&#SX+>Fkb}u-_hM-s2y8{n#H)vhSLs~ak`nv9ly(=2n7r7N~O9q8chrbOpu*zzk
zW(dQ`=ILPPj@Q91pP++5h}P1NArBpTq8{c#6{CmU&iv+h^{{Fk>>!QY#V&D7#c9DF
z${F>!gl>#}C@rjq`m1St^(>@;u^`E+JzXj?rR^%tSJcxR+#RJ9<tGuvxLd7JlYQYJ
zD`R_GVSbdouGh4eKEVB;A!Hl*@lUC9uY!R1&0qRs6qnsEXm9Mz+UbPybQD)bOjl6<
z!4NZF$lBZ-J**|t>QLt0p3Im@Sl71k{jnlhA1F6ip8T5Gx8Cn|J|A6VQ$fm#0o-Rq
z0@%R)xq6S}90TsG{L|UfO7EkHK{dAIpJsO+?gZSV`SIlArR0_9vOf}W_oAY5$`twH
zXxbSVGu81b5;sFG*mM0t@<rlyQ9xKM29SLB3s7V8J~0n-9wxW#nKLyc-viftMdUx%
z3>e;A`|V$e=#nODSN+heuE)^$CuClFj1SDSVP@dVQhn#LyGZWPOugpZB`c4n<bTRh
z4|CfOQ;zoZL++z%FD}lHy1Q**Ro+SWx7YZ74<Dn8W==&n|1#(028#Di|Khyj*Hd4#
z$+x>tq#s?|$h%JdFLle7zV!cb?!CpF$sIoO;KqX+*3B)PaA|tjlr#5jB^wP@?K|9{
zmaC}cE}iC68#!?GeS0MV%vIT5-J>gZsJ7d6!3K6F0<~bXdaf~EE(<J|vXx=!;TuTb
z>Y<z-V1JLjtQ>f=PZ0ND%igx3+`(Gse+)%N*kL;Tl#_cm;yYA@r_;5W$5ra;&S0A-
z-z6;#<<~Edtxvwy-d-Qv_Uo26TccX*bLgS1YW@^`W{vluho<JvKrIhTasJqfQ=%zO
z%<Y=Lf&%|A6MqH&|C0aPxt9Gk_v1ae7pqn;*!Lk-cs<9xT)v=t)ggQ>^@~<OH3hyE
z4>!%Knkwf@#XIxb?j!wAbP_+V@8g_nEe4iqTrJ(ie5FUl`Ja%}MX@-y?k%$Fr)W1~
zTgvRaRe$C!T>;>`iCsX(Zi(_j$CBm!py7S9zHzzS0X+)Y)c(3icFszz#bm_luF0NS
zerI7}Yy`uoHp24mYUwsEshiFtzAK=7(B(t@0r=TIYPF9Nbk`<&ZgX+<SbFc826yL6
zk3}9UcC~Hkh-B;LUy(gPyc*&5a6_23!bEQtLKqAA94naY>Y}zsNQ<@bF$o0Oe7)$-
zjVvrB5^50L-SZeY`OUmD!E2DLS~*s|uPN)w7!R8G3^P#RH4r{M=zEeM*{j1|gYk}z
zw^>Jr%38V-jt+ShoPk@!=d1Z+*YN43uSQDEKI2!oHN>yE7rPC!esI$WQ*_jO-<iM=
zrIl4@yGTy=soal_Tm~nkz8twvh8L%IdtpV?>3s;<+5iasT()rmxo-E$W<-k@uZ-+}
zAVL6j#^xp-HJUiC@$^gUPII5!UCKRoJCB{7-H}7-eNOIrIFA>T?l6tn(6XDsDUsgm
z<TN!c#?N;jYT0hgH22F^(=y7^yUkbADc^03Hp$3Pde~Vs><;H1bmr#{oUqLpY~H)q
zHTtjx(xU^CG7I36m~o^gC<1$+Cg>URCl$#kXl)V+g4nVj>Jg?EcYRDIn^u*q99Pw-
zm(zpmu^2rqccf{}On?vNlZ)}w3fIP4p3EI=a&j^wx=(8DCXr$vbsuZl=|1$*Bax?a
z&(~){OIeLb#nv^L?1p3a=ML4AIg51@&gQR>f|a;z%RNXSt|gJdey06PY6tskIm{UB
zpTQwI*dOIEbFd%fc1hh}e;tSV!T$Q(5UZwR>Al&Z@_&UJ5>mKwzX7px2WPLl%^-Xf
z!06Ugi<yeYjpmN2VHvOf=-J4wV*KRDk=#h4ZOlnTJDtSh&V)0!=aN0n-1sHA(WdmF
z>`zqI^rN<t&Va-)y;;H{^2Gl7NcO~<p}~5H7B?H3xQk@uVY5F`M)tMh!bq6dC~=HA
zxsh5}NCBp`tacv%h4Bry*GTjtW8rH4a>RXxWw)9!GL<dYF->2bYN0f|ZGlQ`%<yx=
z__S|xBr}KiTFKJ8>GeE#J=^FW@CUm}<NI9Ty-u;cU*M1P`%ks7Cqar_KwoCn+EC{G
zfw(`aG(U&JH`7^yO;7^|k_nT`lVBob9q8p1uTjG6QdGDiR#+Qv**ScqHvO1$hXS4X
zi)H8OypDE>!aB|9+GG9m>=4mx7Npo`=6;jzU*3#v2<hib2Q`hsEz=P5h1I5EKx;=r
zUx7&AtJK7=Qj>kvPX2KmeN5mq2Ob0SeK|`TL+Le`^cp9o*Em^vvRkT7W)qkVO|UUO
z(?ylCi-Q(b3SQ5|+RHfQ)`vLiM4z8bmBZ4vB7YCFdyqJVjYqeh?mi`Z?aacZQH+L2
zN%u(0Nbbl?=Pt<sjZ1&dv3TWS_Iz(m54#VqomcFS5<&k6`spVQ7tV4&aM-;hH*&c6
ziD-JCdua7Pqgi99G|6HhxLoU%u=mE&qw8jsdy2P2(xYqN&Apk0B~i>tWoPT7k$rZR
zy}KLz?rEdnJrH>YmrVM=nv<NZXSq*W_4J47WajDe$suizjgV1TSF@lOKeq;RzxJlb
z1pQ^xi`OH$C)JN6(u;P(IlAwwr6LKR(hMR+iek|oxRPxcrU>vUQn8N#pYn5x==Xx3
za302|Bv6`8^YAICO2Vhe%OiYB%EPD3^YAI>R^d}R#^Y1|fc}MJT!C{ue2R+a;Zsy{
z51+D~Q-e=2b-UYC%HmU6(JBfyM0}I*DeqSBe&??1_&fYU?W7=;w@_A;veUvKm3RPB
zDF9DNTMM$2{|xyWcnWtkL_2xy?qT35+>ui(^DzTY;pz*z`jGJ#aCMKa-e=$`TzyGb
zy#}7bm6V^%MFyV2)nDkU#lTazl1`mD(}$;s1l;^Ohpc1A$70uAn?^%T-10E%>zJN(
z>D|HExsj+qDvi$O3p7GigH(vrHy)%S3>Bh*CDT)ZR2F)(S}$x+n+HI7C;D)+!K<9c
zEb41aU`t=sEY`qIn0OO6$RJL#4|_UVfK$nIcqtOUL9_BEI%Z4xJp1LKS*2<sC3(wK
zv(JW9KSdS_VOM@hEmZw5duCV*tq8En8FUT(j?%vs0wn}dQR*H<#gFZAlCAL>=vg-O
z67ee}ZY{l7^ZGnbMon&Ji=zb|rOvY7orfBJLG>K7^p7W#i_(B{t)!zEQ>~CS`=|{B
z!zX`l@hg26ydr+nkA5dc)Q?l~oqn8(k@e$L9IhXy_m~rNdROIiuyQJ%)DPAFR`0mp
z9P_D-I`ZSu&ED}w@3>0G3Vua2LvIy+<pz$zudL_TRJ52hPK94lxj7YnMO@FR@GBA>
zoC?39VsYx@SB7*s4!?q_d!8Hdq;Q~qETf3syse`4=!kso;(xoruSl0QNbeqtR_QTl
zmCp*TBB!vKYk77k@DYZ&S-$Ew^_xrwu5Rz=D(!s<o}){=fIVl}C^#)N-n&X|q;LDa
z{u-Z>X=@u#%(V66wyp6MJ>m>RR33^i?8*>TFxZtvNQ2P+-dOs2W;g@C$M99!jnkd#
zwyL^8e6(M_KH8$|5|4k+u*6V(E+~DAHV)Ot<J}IAcRR$pUVT)XyVQ$}%iTKT974}{
zrZtm@PfzAOAXXwwu3~On=*?(1^+8`U5z-6@1jAQ)my;K(7p|IDIv>%uWs8h$;wNlb
z4cJxGI|hcbCzl$$Qd-A<9aqpy2I*h$S?9M6<2eIAwc@iK#oWMI&gA-B?5f8JXOV!H
zmPxb8iEd<%5ELp+>01d=K!BC)f~!d5z_d0IuF^LtT;&v{TS+r}O6exjLwocy$$voU
zk9REeMewA|b7zBMA@3QjptCZmJ|tYRFY3;AJH}v`a&I`9la=g2w&gXrm#!+@i#}$5
zb47S=b%~@ORhRO4F4Vftzy=U2UXwPL)>`;VHv^3NxtJEavP_B=zVZNPA^3_j(8tUk
z2+Ke>N0RT>^U`AQEV5r3p<sb3f5?3rTY^kvR?wBw)ezQpi~Rk}tHY%-Fx5h&By~Vd
z1U#kP$?qZ)!xP5e^ndGkhU7|PcXjgfNsO!ZlD3ys=8~k=Ir@dvJvx7;XeBLB8s$nA
zh0-eBj_=Y(o5)UKi{YV7R_aDwX}u2Ku%S>slZFL!@|)uR=eFm}R!9Nn4->E^H;SF!
zq+AUasw<Ld3Va+lB7tvad1)qfBQ?J{_xzD7(tEO((4LyIDn>;VOW%z!81zn3G10xj
zI|>0?gXA<0Ps49aI9rL61}ahLrN!(^AK&aYZsztp*ke>=^9pT*sUNb?kIx7-f{=yh
zd$RHpB3}LGIC&C`r#tz=j;FZRcUt*)F{rNcJN+*vlc#W(i4lV-r(?U5pT!3ub^yvy
zaTehdn6d$O16&J#_v_gJbm^cCyap(J0!_~6T9~6Sk!RJahM!^MA+;Ic9uG*RP;Bmw
zT`%MxF|B=#%xea|A;p4@zqt4Xqhr8N9Zt^!-09FMFE1`eKM$Vct)(TN@THN!4PfiA
zUlgOc^oRu(60L0#!jlG0AN+x#4ksM^ei#wW*sDkW5tTmkzmNbbl1VlDSEcXs5?#4O
zScNLTdX?-be%(k7R8~Qhw(xmp9Ts6TKzY4XSTHj4K}w6c6trP|1*CMV0V$1$93DtX
zU^?rIwIHPr6y}tFH_%GjjpU~xKqv-)BxH>h_&zcc;o1&{W|@<(hkWXp^h#gK56qBs
z`4}e6kOSWXC)tt#PP)~r)<#upjtt!aYzl|ES1k{rlrhz^QdKNsd$2($NvuwRQ2H0}
z1Yv~Itv*8O&p?#~2&F&d!U#Cqo*+X)(p$qw7+|8@Jb(#qM>wgwXx}dVD^F<SdpN*k
zt(G5)zSw=j-2)peZh3+|AH;)dqZ=`^fmSlOlbhK$_XQksV$9aHvygy`OV7a?yl_1t
z?`F(w9;|5<6RySVfvATWeCoj6itYD`r-z?4Nw<t}|LV3O$sC?uU1+RRa-EHUb?)FR
zSsi#g`%lV>C)ZdJ@9kU(R0In645aFZ;W4**@EE`Di&N_@Hm1AuzA9{tlfNYfJz$&2
zcE)JN=K_S0UTp9%{^&d#7Z<8?JJsxBV7j5k`SfmB$8flj$**KCb0MgXP7l>VOd!qr
z-ij`Ge(6cPPR699mLAj$CZyH=An?+HBS97X3%wjt1&Nj0X@lg0efx|aYEZO1lk%Q8
z18c{9byChm05)~IJzXln$D!|<?fo~Gc5~mfSEv<e(i_khKK%`S6KKf(AmvYxdEyOH
z`*EHxjCU?f5Z<z;e3_C9`-3${M%jIs54<sIfA(QjHS@005F?>|-$%QIsZ$Mm(HONw
z3P*@Gv4ZK6Wjr$#nv55j-L$`ne(B`<^}Pdk^rd$@19=`)RL=W(<^x%(5z^Hvrw?Q~
z1tmNrdr&!Fq7AS#`obvx6Sc`?DyOh4xt|<1aF#w)dQ&3{XQ?aH3Ts|fAMh+u_cUTo
z(J;cZ++Zb^hi943C?;-Rf_20B%x`i9L%FT)h*-qKIynR9?Zb3&m1I6$QXOzt31-_m
zEWn`|9_}&+z=q!N(@*Og)BzcGl$%W}RsIyLqdXW}Hfh9an3Q4K?X0M~!Z2f*)t*+<
zXM4$S(MvvB5;oe;AzXjUKSLG%8N>h4>c44^!SaVN|A_7W7m8X33A0{-OtN9-If0H<
zmpP?;JxPS~W2n14{NBm7E0s?RWf^+EnNd*FE9t(VF$bQb1q{4UWG(4RWW<f?#ykXP
zh7fuF`<cdSQkG9qvmvHRpJa)4kWMiQg}o<E{(2sj21V^<sqO(FD(~YQ92B#=6AKFr
zjwMlg5BEHbN;{{;)zSMou(`Ra!CS(oXd-8-Y9J~Xd-GV&e)ATdm@fVR`$vZQ*ViJ-
zR>XaVH*B9aoWfN23NMMXZKGcZ6y?38r^q%$JCncC8`L;JZOxom=U%c8k(y0buoaOp
z+#J$N6XEjcv;DOKtIQ}|7VC_DGkbIR{RXf3s`neM)JNN4b}us2a|VQOvS5|}$C<@&
z(e2t9xVkd)LbK@eXtuu)Ih$33@zyFHXk^i&(hgl%xJvuEV9o=$%3t$9UVuO2NEzC5
z2CmWtT!o9Z=_<g=)OZ!m>d{OLUgciS4PND4Xl>@=g5uXx@-mQqm#N1tmB~Y`7<7`Y
zMoE#@y>~-S04=;|FU-Ob;N+6nR?r4+jAU=(us)JqyWgTW;Q0X+!m>11ciStK%;Hp3
z6x!R)jiAe9I2GB%oB>TpC})6E;e3_<rO7q(DP+#ZP<lZj@}D%uAET`XpZI0U-)tY=
zQ~jkWqBHP*9+p1B9}gDOxMcz!rjs^tSb0!|h<Or3%s-aKn7^B<nLjl(n4@ccfaqVv
z|E>IgjO&m+^;szW0>zksCwW3m06YrLd9|D+&Bj>*_?KfhIuJW_`aTjE;ustx?~zip
zY|~*08Lf1hfG3fSBaA2cc1jZrIZ0YqutO|IoFos!(aEKhVc7&=i67<Dpi1^a73(Jq
zX2~NFcKF59Xyt)7bAu~m25@3w8}1RLjQ}RZmDH+DiWEl)aJJ5-W8etZ@)8PF!<4^~
z5K-Hs-n`!_pI^9G^71D~u1p`uo&j-gV)wKaD{hK-!463!_Z>Vg?&F1}W+l><QT7@D
zhvCLIkM?Yq#vlwKYKZc0_44OV6CDl|%VAI~M&70)*?QzqdhhCgBbO=wi?>RaSXTyy
zKO6DZKnl_F+a`D!bURoZTNij7Sl!U!1r|Ti4yeAffnvp%FeEm33a0{LNpQb*&IU2@
zl)LhZT=p0Ahun)*@mle4T8}Gj*oRCmoNw?dxO!xh`EsPN)I+JX-lrCI!4o*WBidSm
zc$9lv4z?WOR)dp&5nhGqnziNa^62ovT9{u*^u~?PMOatl;0@=Fz$2hO9!ei%j+9vU
zW^|**-9ODee>=?ONM<%WJ&zURpY6OH&)I<T8|IbPmc5-y4W0&>utw`TQ<1$b!!#_y
zwLvVjeEE`opR=0;yIB!SMTm0h*o3c9u8$U@U*%JVr^C5}U29HIq>XH%^i^fU?PC0^
zREwav2b<QU*)<y22~Q<jk%<kcdV^<E$J_w{G*eW%-MLd@w&p>q*MS)6DrsSwG8it^
z&M&rqLl50wxQ{Dw?G|>R7zO71-#kFbxbYc$$lrnw`CH*bwh14yEjJnyJ_N&GgUUh`
zC{M<>Q5WXA3Fdc(#k2ctXQiC2GkQ{~3T^}<mzL6Qt`?IfN{e)=$TMEV8JLy(js5OU
zJ5rE`?akea+y-iwYIe~84fw>F+ZC^fLUJSu3&2Os7rZ^%bCKzl&Q>fk;Cc)~q#JJ1
zhR0py`0ld%Ls7@vQ47LB6tvMajB$cGJ$vCZKnzZgJR&q~`k;!t=557zN6TKF5;nVG
z1!2JZ6>B$$!rF?cC|`|#V;Lh=BWNg?OM;I`pz+Pc25qY)cd|B3Z(L%^OKkt|Bq9f4
zdi0lU%m8?5%UTZ7<i_}$9E}d@E9FU=9jr(7Xha%|!$b;T3VlG#dt<(@-n?S|D4EbN
z)c-7AY#Q$(x5Td$@4^JHf_E_&GHwaE^6QIt*|X`zd+EhteFg+jZ<8m)aXRs|m{0Yn
ztIM+fViVY)9?a^-lpehSo;3VP-^m@gVf8v^Yffw`bLLZ;t(q(I6{(s}<AK3YsIVxB
z%Qi-Om2_B+trgfvYqI1ekUs{`XnUQNDf$>OnoX5{Zp)^Wo>fXf%|h0FW9_#QRaRAP
zJ<A${0Ijt?DATPtkvEcxewCmq(!<sxc(3MoHAi+!sOVvfC)LBQj1_K=8`uNz$U7dS
zI=&wEcRHtH2(&07sc=5RAhtvSFI$(6Etkj~7`x4EXu7fEJdFJ1+O{Dobd8F{@oMjQ
zy?0#f9s9gvzjy5Nj%N1Ecip;%5HfRbB@Dwd?0>BAM8oTny4RyWSFaF&__n3RyHjeo
zrOP={>nw$+eL>(58UNa;L9}JhZGa#duQY)<g|Vuu%;GNu9TV9kFLad~cC(}obItzk
zy0a{`m^&}%lRkZN5}zzC&)NOY#puGwj>xX=@+>s?J&_$k#2ol2!$srjH_`S!blGTz
z6eU5spJLdBp<q2Xw6G_k`iZ8LE*5#o*|se8Uz}|{sg<-96c&iDdx_Cu`E%ov{-yAX
z>ekQ0ZvOYJSY9CN`dWF4uJ7m1js2w7=c@tT3Mek-Y9>AEHjg;mjZ63>#<v|xV?}_9
z7L1KDR!37Y0|1s(vgEXndDiFbDfU?+`o~G)X0Hn*`2NPDLYLwE>eTrnIsTqEsMt<y
zr*&ZziOtgvLol5!RQ|V_M%gFV_@&{=)fD$?&9XksAA6te4a~y)01A#ylaJ%YRNpY&
zo)PxO`_B#pM8friK_zr{>HEL%l7kfCpT@Vz_6Nk$c6r>7el8TnRR%z;{%s1gbomnW
zw;OzhAyE2>a`U0@#k2Lrj~@8oZ(aL<DSkLJ&O_sAQ&<?HBLN4jZ2O>Hc#Q()i7SkM
zh#|N_+k8YBxn2Lk2#Q3oIxZOAliArp6NC#A%D-wn7htuLdk1jNLfabyz^WC_K6FnI
z=#3lVHJNiPNEAsl9>&^GHJ~<Owy6fZdc6__p!!V%UER=p44_fF@YO(9En3w;S3yfx
zXJp6nris|qCODzhodQ8?v8z(0Uw!PVSUJQ$t%iTE+cY|Z`-N)(-y-sRQ|<`}ei$`X
z=<O<G;iPu<>SN4drrj_fmToLwAy;=(H}50~<PJh5G^b!F?iCa|>THX$NR2QvUncoN
z{!V2cIWYEYVFn%3jg%Ch!aK(SWaicGFK%jLX5C0x5Hkg{mhohA9gLJd!rPduv<P0-
z<HFkLOWPIV!;8uh5szHnWmfnBY0(>(Mlrb!9Okt2c4dX^*Bpg@cvT}MkEeI7`3)Rz
zga|-*$AcO;Tb=xa>rdPt9qi83FG@eY`lpx#X7E9CZbLWDqbxaf@_}>55J_KI$aV*x
zniI_dZNUd4?!GJZYVr25wKH>vBH4dh)b`+gd{x7RGmztiB7Wu%IF{y;temH|R+)Aj
zOj^*`#P|qA5QJf@(5c}BT>Ek_CYq&E<R!P03b0h6fyOFz8f|EIN#@3PN_}ANYt!f=
z4d@dTu5_XvXS;pkYwBSP8y@-Hy#o*4wt+>+59OYpk-3B>WeXYTP_>&Q_T`g{A7IZg
z#GiW>o(N69u1yTq&QI^m{+RJK;qGgBh}qA<=;}7(Fe3k3BJKsCyr(|NZ9kklbY%5E
z6lMrj0XtqkZ!jiG!iyQ8`K%*!@*<mU<h+5uz?in8ip}Y4ljF0YG^m$+?$R1cuZm)?
zIa)k?Dnz3!F#imcj^;G3C)uU|R*9(29qJ+r!Y%A<y=+WDg%X1+#s*`3#T8(&h1b^l
zlc>HaeVb2Y%MkmmWDrE-XyBlu(L4z2)mll>*(SsQD^<{st{f{Qi)&b{GI+w33ru~p
z9qiuDw-_ZGvQKM_v8AS;wo+``WPahQcIyzBS@?k9=ftdNdxU1=S^CK}e?}VwbXldT
zCi%qc{&tK)ZajE<W~2MP(#OfbXCdLt)N2RY8K3<g#X^l+qPZiHbtja&#H5_Ay#Qj@
zYheIFKuk8j&{<rl5nU|mhwZa0T8v)Qhaupq26tEL-Y!fDn|>q%M($7(!(g`769WEB
zmM5F|U*!Ma@?S261N`@Yf&AL^;<MZf55d7y<Ov>FMgGQdiv0C~BEKq7<TEtPdL>`2
z#jk>b{V0I_9J{5d822(tZ_hDk@einPdDhgw(fI}$halO^!j)<y!yd@g#>^~k&SH^5
zxxQ_vd^TZh*vAU{5zF4G!A<8aH7n^79o#{|r=-hNQjWgzezkYq;~l%bW1n|y_l~XJ
zu|vly<^F1v`&A62?b7RwhR+T#)N`%=e9~z4dA^Zm-yPEI3BIy5Cf$5yVU?=1bN5eS
zqIvF~mIF{MX7&A6U*B)H`hF|5mA>EZ>-*ilzTe~P``!BF&9GEY`AyRI7a4sYC4bEs
zlxJ1j5RYQzX4L-!zWTrV`6|_aJHQLxaq>d0Kx9n@w0B{lTQ+Qlu_jyWrLl5kLF6&1
z{?|F%7N<T)E3a^0f*c*o`LkGmuE)Mt%%?;EssC1emtm(1z5i+{|JV1^#TNUzZJ_)&
zsVnrPQbzfQ3;Co~2`uktBH+I*^?!nbjuK7K?&Tc1BiWB~=nvHX8+=8Z@2;O(?GMy>
zb%bnBphps?-YV=pemW+T%pcji%R+biBiXwq#5yFkivB>n(r9)6tF{Nkcnamd#Mlef
zGcRWkxIJVK_?E_N4UZHTQ^3^r02xW$arS_Ax*LN$p_7VHS#ninU(08zMI=PMz+i$N
zuC;{H$rI(X#TgV=Fj?K8hiN*Xo|d$UXw$>><HX4-Pn=jwfG1IGNF%HR8hrGt$dz-8
zHc$*5<P{qTJ}+_Ni53GUhPZS*P;b^ikO&L}t+~KJka^7w1Yb{Wq^iCI32X#+o7*xI
zh#E$isL>`j6U1LjGl6UbNRiczfSAH8;f}bYSPAAB<}ZHRl(%g^9ZatLM6qEL9hr{X
zMDus6zb~^hes0}5_H`o|U>nsbFb^zU!ZJ3ks1D2nQ<?^}Goz6WR<K}i54;JDsDM?w
zN6}ZY3ws8D>d83Vp7ftoPsaVbVS~Y{sU-*1o*<9Lmm`oa>fzbn3RYhtU913^biP0D
zIOqF^k22q1VJH04^WVvqaaPZ2U+ejA#gy&-2c7?3y=jQyMnXTPX~6h7@P;l;zx+9H
z0xj0efi330sklfgMUoI&>2Y&eGuO~;cAiy&HSdbLn$1EorpNQmTARPtNY~r!&6U^v
zGXsO7W5z-uSxvg-hYFX2=rj|b?^0Uy@zO9yqf|Qi*(f?FmYQ*#z-jr9?TnS)ELUiv
z7~h0vo|DeY8`rckSR^X*4{vs4)b_E9ZtAAQamEcyN9>{$?cC6~`UiI6`}btWoFw7g
z@jVp)Qk{?+Jv?Fl%T(|*cP{QhO??x^+YdAKJrK#hKw|C*CXTdL9h9^ZSyKs-!kfwG
zOJFV(;ZWEM?pMuyi_vfJ8DsgR^NYVR(~H7}uF@Cz)|-6gKWEd?{C7qHE4!Kd(gqkG
zx<s&R6D1*YCYu8XjYfGsy-^t-iLHsc50&S;KhOQs0d}7KQN2te#fCqi{To&~zdN+j
zSv6GCHuQ7n_UI=5^lZXS8cRQr{b~9c5sSBw((z2YTbnylyZUX!_gWCeVL1Qaa|ix?
z-I?xcoPxP$>lA5dK#08D_INo4f}uQvZ5rL(!U)Y!XsihHJyACE7CY<PP`HeC&)f#V
zG|v+-%1(ac<<<VoH<<VO)jGL&8LdG?R;H~mIK~YkXXZbu<tf95fdJj{0iCj}Wjpw>
z!^9Ps>n=acMx4Wk@v*0On)z<&Lf)~Y&H|B0DNKu*>q4y>=D2UOJVtzi>*T;?g3I0#
zXSol+G@9EcocwK?cb>r1HlBU5cuUk}DPXG`VI>aAI&<2joVskx616}!k7c#Iy6q8g
z;SFp4RCU%%Gh`m&GiJ7tU}jtEe$URW<E2lKk-J)sp?Gfi7rBG~zD~G{xVsvNL^PYo
zZEq<3A-s~?o+$mE_-8e)dff5<&fa6Ilez7UrCZI@WGTbZ&f{hm)_F7H9)CvM3Hj@_
z+}xWH(+8LnN58?qH`ToOZ*oJ2k7H)6)#UHz|9$-5$^Ym1ADRy*&<rP?565_5=fl6e
zW9t=9i6=O=CQgZw5d#luRxF!h=B@5QD5?drYTk5ZLM-GDn8v{0wG1-6`cq>0yT(t6
z*GrMzNN!dBuJEi_l{!sx+L<s2v*O2$h+|eP$=<Sq$~C-7Gh@VfG(0;_Vyjq>4WVUs
z2|H&rm>a(^Uf&(oB&b{RSABrFj=RrJj!`fhBG`Jcmt88*Obme)D|Y>Ngf27hd1$<f
zX3-(n*kb*;ehIfSQiO|l83&oJts+YtAx)2$l0u(9*_|*o4wT=?C&rWc#g1iSd=!6J
zMRlb|yvh?}xI#brWA4X?@1xI;nN0wK{y8oJ6;=SSr2A_k*z~IR5@PSeD7Rjxy{Bw>
ztM)7SCCkrVRMA3z?AKr~q)K~K)o+q`U?G28@uP=v{h7A(zMs^;2#Cj9bLt;Gr(y7=
zJqfjcQ&>0)ua=AP4x3iohGE{AJJ7n`+9|7N4bGp16&InGlW!sojF<{|WaeBrbVq}`
zie9LcYeu7~z^iIqs*IAsH|5Xio#QRvxko8qg%bbz!RsJmP@*7D%6Wfq_gKp*Q*iK8
zc_+qmdu`iqI=@%1Kd2$!!T)()i%L))?V8s%hX3Erb@+cxG#2-gvIiu44TIZ84&D53
z;=kN3>JZo~YUDIL+VgN(^!m$Pck<3f{6CHVXY>CA{(q7Gb^O1Xa=hI0qx3)U1byy8
zAQDzg6hFO%G>Z$9BX{T|!oHF26$xj>kTZATdj8+Y|Eu}m$NvugH}gL^dWVoJ`i<T(
zXisWZj^6QkPHW#ga)&%;HSWUrXwJ}v3)?%31(T<7d7vUh{hs}5yf>0F4dz)(ZAPzh
z7E=}3RLV%&K;Sz00jlopX<;Z`kx#E?t*0uI8sN30_R3LHsdvm9&8ZvcH)<QeoEalG
zXW`;G&6Y%S4O2{Hh|!$?)o9Kb$H#sDYA{K-Jk#mDcAfFnrgO2-A#OOXUVRMT{H>vY
z(TqYp_ax-&#Gd=|y~!P)Q1TTfG_h~I5_$$|ohg<ZT37l}jNlb<G__jie^Y7?e-P5T
zocupvx;U1k!Wv@fPxR4*Qay5vNd={nQ4X#!zp2N&xG!#V2llLaKRBWd;D=_fn`OZA
z^^3~Qp}>>OPLoFQ#g3CCrk^5DUR21&U6$>bc;W)tk-xXVKw&3+Dx1&z(p2fc77yib
z&X$dPcmk|r0pVf+YM=rnHG^dC;8;f3U(K6?D3F>so2N{l8^fr9ztw2FXN<9Z1t5!9
z@s=1!io&JwmSGmKq<61-i+iZ$p|x|d*(~*E&xt}^`GhsIit+ncMBrWq>i53GXwzpL
z#g|hjpw;604tuj+>cO1jqgFK!s1Rz8>H3Q;rrZC48IXa_G|m6gbCBrM{og2rP-0sC
z*(nj0Q$}N>P*>0$)AE0M{F@&Cr}dv{{SO|HhCZ$TPV4{E^B;7`>G|LE{C9f(AE2-c
z)AkR9!nFNo+Ws|d|C_ddPTPN{?cdY(|7rinwEt(?|26IZ`xW{>tJafgZ#SafU7o1K
zkm<M-_p*mBaEhNXXsi{<kvlCKYemex(xR~zC7rp8Kwm8ag|!GY)*?_@i*Drq`q4WB
zG}fJiOab(BuZ$OeUwACAz=DTcJn&`OrmluCSheNf5gvGz!2_REyi;Kh+}$<12S1~4
z%J0F^oyZ+xcgX((M1q)?4?C<O2Nvo+W?Z~ryDyKqo9^LVh1UC~K4LA<SH8fpz^4ny
z(nO^3k)$Db#lL}Jv+xS`tvkKQ3Yz{{p<9sg7+*!*xW%5b<e_k7JUyIwE2}=@3*4P8
zBied!-<p#P?ORwp_%E91*q6%B0ZA45%a(0qv^y&NUx08kwcCHE3aR)F3DEy{-opjw
zlY>PU#sp^nLkj9S{7u3~&BRL{oWrpu|DlP=%Q0A8hmr2Mhn)kL=U3>s@-mB)&zzXo
z)bu*8<PD{MG;;!_gsibt^BTiqcTC7NAHh*gP(NF(LSomzSm8dk(da_cmMq;kT2tLg
z0etGH$>?LDOpdWEzmnIIKAl{jZC8$V$H3Kf8#mx6?Jp{H8*H3kMW0mTn9WDJjAPoy
zN)`bIuRH1`Iohof1jIYOl=~_vkLz<5KN<%s+Q|QTzZS_Zewoq|t8`%#|67l*w69UJ
zO(2S^Wr5%NMS`l+-;f6jwU}J-z@omKt-Q0$zB7&&UYk@W%91HaI4Rc5N?UC{<ClJ1
zp{GoqRYkra*HTDD<T#p?P<YlUviK$YekIIX2b*(|jY{H6ARioMBgFZgR3ps49S8y8
zppAm4dyQ`3afmSwBW95j-hz$N-|-#wHF4hp5Sao4H2ZvjkIXR7>;IM{H4#pdem!YR
zzY<jNwJxKnwD|)iL%$FnE%Acxdw8rsFCosaq489Wm3cNmEKbr;leJR$uO`ob8V?tu
z|1=(K8V~oyX*`@6FsAW<(|ABcBdWtR9&#EFDNdNigHGdNnbt^On#Kc*3e)Rhrq=^a
z<Kd_A@Y8tsX*~Qi9)21RKfNAcdOgH{wDlm>@tUq;_kq~x{IJ71Qdkf_cR`E|*K-HX
zzW*%LUgy0BM(4{#Q8PMU&JYe}QZTYfAc2}qS_a?k<o+1<L2m3U_9Be0n_IjkX&*=K
zThHTiGn?e;Wy}lgx2cWtk`_75StDi0eJ5cyT1dFJ5S?wC`*H2c+0Ryl){k(NdEpcB
z!nN`JxzCeMB>S%7W}PU(V!@or8MUjhB!*Wi;hIAOcmuPc0GNYFNiP)&1|*QXhx6RQ
z+4_22vbfm*5WdImgP$@fJxQtJ<@e<d?$L>p+o6nh<aRi`pX~O_&ji^63s46t5P%Zc
zbb$zqweDw4j=&$>&zf8*;C!m3h;m--^%cJ6YvbuB-0hi^`($xJj5o+NF?LIQ?3S2E
zBvb#w>R90u@$^fXcM=gVS&4SKWlOg<eAO!Z9pDq<cMv)ge8T*w{h<7u?^T$}JrRzV
zRgD+fP}$G2V{}oNP3k?Y$f5u%LXgN;iWONoYTyyI=ZxHGg7*}zil-mXytN1j<FZ&`
zY24sBLVm^oo$)r%8FRL5c^Q00p||17M9%*vtyt~!ALlj(7*m`dVQ(9nxq$$jW+RBB
zx%6&49$*8(LP5jGWolx3%5QoUhvfO=l2#qqAmjx)8Fe^DsK)VB$RIVIn+T<t=>GJb
zn4}J^<l{RQTK%7iNgt!zGgN|!G;Hu88b>GR(s2+C-#ZE|kFgZ5|7&V;BFbuabc)#r
z_nHnIKsEe!7>9P4ywO7r(ZDqvPL;1-F5&TwJw=j>{en)NWCiOmj(=XAB>g>Hw0(`d
z)Ip@LuxDS?t#$JES)q{h3mp*Q7=SRxMd<(sW61LIP?%$&jH(cI@*lAba*W^#+Bqai
zeI6?2eksJp@g*8`=qe65F3GF?ll`)XTNRcLQV*JPqSQE=<lQ_)(xP@#c5V=OrXzDh
z>64c9zocxa!f!N_q~TdFWRgF4E7r7pGrpH<axlZ|{F2wdjuUb5suj|QT7>Ww)%r_l
zKkkmv1!4WAwzyf^Yw@z=h&hS4m&M!#7VEkItm^`>t_#4rE&%Jg0Icf*u&xW%k8Zw;
zkMtYeJZMj9+y(KKqed4+f7xvHmu$TFiJ10dDSjf(A(7sfc?){o*xLBmT16mERw5vw
zffi~CbJ9C9??9QEYt*_0?nui{i#I*J(Eix~Z))GgFH@LRep>v9R`ZXBT~!v?BN>Ep
z5-zI|{h~=vs?GOF9<>tIsg<KP4h+IM&6}{Cv&imUS0xGyq=dC>A3ju@e#p6F?-`_+
zAyN}z?f)O=1`4a92?Z4|)OathYe6gBy_N}5%xJu(v83>tm;AU-+R144F~of`AGzcj
zbO7zp^%~algitNVPJg{?sm4X!OV>-xsR>`N#%-Xge&fbo_i9(_`r0<`I~ec%TE2zz
zHzo`B5x>>1Wf$jf%vyf<)JiRvbN<Gx<*lbwYPpK@H)bvWI}=-<V?V|D8?%=8o?NNr
zmpFf8*7Bi~Dz)6k`RiLt4WLY(U;hF0(Ycjsk8=L{R{QlDK>q~`u-{Ri<NS?T%lc3)
zf8o4QYx!ns=C|c3Z`fLP&Z*S$ot(chIrgd(E493o^EYNKKZcFR=h%;M{>H4OdqSm_
z8#sS`YpDSg`{?f&!};qu1O2_(m1^I?`RiNl*J}X%i&>Rg-oyDDvz8-RM*WWZEzaMV
zwR{#UjbF=u;QWnQ%R_i1{aXH%^EYNK8$z{=z3#P?(8Z(k#Tl=++3!t=dB1Vza{k6_
z+>5j;j%T?(m-9DfEtkMOel2@Be`D72w^^a?*YY~fU*B4)qc%DDM_za5ONJc%YTwBD
z>s#&DOFR0soK{{(-OTyxTg!@zH+!P*eyzezh5U`xc)H8uY=P(@QhfJxVSfDF`NGq6
z1E~9^1=Q^rT_~S1@kQjV=76E0rpE4pR<r3K=K$)iqIq)%&jL&rY>)P>^*kz{UhFd4
z2LfWjg=hDSaS!1!NxCoPMq+FoQ;ZMl34kmEor<QkYFt^EYT$ume;K@%<4{+<i9KW8
zY-$`&kGi9oQ!UDhbZpoZZ~1?Ky^_1~B#S~@;6B_kIy_dJKC~uTxTMha`vYT{@}99p
zQ8sI_o4}O6U)VtEx)Tly$6n3s4AZ>8eZ1x2wFxcW_Yole&M;fNonba;m-0e%3){n-
zUbQ{U2?cE_IR@U3=XGw^7V<vTY*o6)8D10}7-CP-dMGv4KXIQJQAEE9?OEABy@562
zhWoCK72X>wywAEpsZ8-VwG1GcKD6$g#dQ()rIyFnCRG7>cc}yrz6ML|x^iqyU9sU_
z_kA!2@s|>X=zWuIazicjk!nKw6l&b|`+VjLm9Hv(KzP5+D`JI(alFV2+Q!@+<u`@l
zfm;@_?`Gi&FA~|qYtFVMC{@w%X`hbe-TTc}dXdcB!X5WO9SUY^qEH!`Bs=RBuSk;9
zZ2v(yI?}zK^4iz@LW{88Pvu`e$%d21v)||>pA*gMDi0yp@{pX<+t;30h;E{gb#}v3
zQ*6qh{3m|zKef+Qz86$pFE)ermj0TqZ;AxYde_{rLNL5D>QwDhiSKZhb-}wfa(GVZ
z3Zd!KYJ6~x%&y~(_wdI`)B8<9?@Dn_^utXY_@K5lHP!Ol5Ar={NaG26Q&|6Dc|=)+
z>RT=UvY}018*CnKorFqI(QzAZWuB@O>h0bKCPNEK(5IGWK47o>=an(Y=RZpPo#1W*
zcdKG#6a-SSY1*oozuXPB5-Z=~6Rtu(_6rs=7x^{Ijj5?ByX{WJPkO(ms!zrIJ~hey
zyDO?XL}5d`P_No<dO#zBHd3yeJSl`(ox8`Ur!8=(J*wk-YzW177#MT%-{E~AQeWm^
zniy0;gHKs@D06ap;tp$zvN>jpGN{Cs;is417T%}qVf*btb|nK~qHW3~^T3;EtYG-y
z?)ZJmL~ZVxwlM8uhCh=IJ9H-_8TS5Se+6ICP%NRTBcez!8aHQ8@~dq=to#Ypzgj+S
zhy&KXF{m!+6L$o}%S|;aDsj7eV{WS?yq`7{2&FfUzZ1d!QAxpH{(+Y#<S?o*dj`YB
zqd;~T^8UFYFBA_`I0l7hmFM{s=A(YsC$UN_Dkm(JV}-2Xd(<krWcdnjBRJkMd%=MY
z8_PEIgD#I3_#fm9fn$-3L%KX_G*sggxYgD>pl|XO(6?bi?MGIO5$&%xKGqr(Ajrxm
zafrU-+H11(K)#K&zD$bHHT0V@eeF+9+w9-?dESm>PnoIXxUI^sD{L`n{lR;9_WEpC
zK4p1P7LY)_F?5=iiIk?bSA^)od$eo0w$L`7p+o6c%LnKY77>9gcJfCw&#>~+2yiQ%
z?42nElX>4K?wbs8y@-$W@j|!s$R=ki=jBy}K||y%hR6qJuS-bGAaWiQd%MHsi&0z?
zEWmJbBb3DN8wiM?YlNjw+?PNsy-3WL7&5^eJqRVDCGKwD_0R6emjzdEGFc5fJr6ru
zA8~rw#xQp%l8tRlpX1!Uy<FS&h`V?HFcL|bJ!ZO#yD$F;BH0<(C3dN*<=c)@%P&VV
zpHzP3kB_gdgzFI0h!2VwmAd|r^nb~^(xjyO<w$mbXji98=pyhjWLbefiLed&e{=T6
zU|`uEt>Df?2tx)14SV6=$HoFS$#flU$W}T0PfPdmT}5D<vtY<h_-`?g|5b4J*a!09
z`_k_ac$2D5&F|_=9^4i#X)biYI2BB7CEi0_?ts?1BRR#h9Gf_rwO*$6K~FaJFR2JP
zMvwln0>MPr#Vv62v9+^vw{ALI<9u!ijvA^Ud?(wk(v;V#1LKC9%JQ2=G_Zg)0erb&
z%K3KpS(T1bYLL~+Df=d+Y^W|}r5ugfSf8iDn#O=?mEW%e{oYjQ*`&=tPpOo-d5Y<H
zxV<d_Kd@>045}kx&wMjoh}|2Zxs&OKGary#akiS^w8cO91731>?=G=ut-;-?x$^$)
z(nbE{9)0~c5>dG$5v}LS&fM5}PUZ})ZgaN&p@xn94@5Ezg>UJd^pVU-ZA1R(=KgT^
z&(cS-Kh+Dd!nf|>g>r1uc9YlRq@_Hv7YyuYkZ#C4<Q}@TZLDgxwq=X6HG0X#(TknC
zhqC{>cwHoY(EVYyT>cYqz<)&JYL>Wsg%**SmP6*#G4CEK-D;Vi?9_f$>g6VH`^%WG
z$NR_dEQSxgpT3_sU!v=H`YgKAVdf3~>&g#(`2}5jGiL=mtYHE^sC#@k-|Y)&&`0Ah
z;uH50pZG-3UkX9f+~+RxcZ;t#s@w7#??2m<W>g(x2Tals5@Hwl?VuSP*z4shJTk?D
zUeUOse~Ew79L*mU)&4@|tJY7<c*#KQCz<G9aZ?TYj+a=XT9p_zsS!|BN7kC@5SFmI
zHos7Q;{<?-*BqutGE9&Cb&<?W=Jw?o#f1?=oc^N{Cz*X)g*X)<5nq0EavX)90wdQ#
zSz!zrCSfhrZ*qP-%J-9`GYP%A4cGbm+k#cUyfWqKaCfvkWa3C)D^uDbO=@=4>|)Gq
zX2n7albT6FOS>b;&{oBjzLkKM%Tn_SmnRDw8W1I&y@|}3k`cThJC!7fsWETN$fOb@
zbv5ooEr(2odnu|iJju&2NrtDVAI`Rw-#b~Rq+s%GviT}QQg1|F>8O<iCd0=~c9A2}
zp_-{i0)0kU{+?6|U8TY49i|M<RwUiv;*^6DQ@GV^+<dyz`>;$UOQjacY!yUobw|($
z9ORTg3*<6kXJZ<FO@3_;GS&Iqu(7E*mkw9tamSPs2EU=a<COdjU9SpFskC6g=zRTZ
zFSNpwyh&&b^36&g%D$`I>ppD5fzu27y$KL$xO*iF)N~0;LKIsq4v41@Wlo}JELpnT
zQyh6Oas)1cQq(mTfq1hrnwYZUHg;1DYmQB&dCkn&zDE@_AwFS^DGO8_tSx>bGVoyb
zyz(W!s%FYkHDyEOx$Dgi-mNH(?iEp$foZ2#VpH6as3XznZ1oDlERcdAv1rw+;+Ye8
zhCC^BN6Tz_9h<-Vh3>J{vHlgl<Vu+0Png#Qk}#P)jTF58jy`9qRrwQcqEP#cn;%S&
zKfh{uJS`u6x#%A!8Nx&D*?$!I*eA2QGx%4UU>(qc|FL@Xo8-E9%@D$+qj*iKt9$_l
zlbti@S53v}H#CCzQbFs2*oyrD9(7yeL<gNnYI0YhH<{kegmv_A?k9(fi=sy0JmWT|
zco;)_@pifIO-7F7Mxy0f_nA>mP-@)Kb2l_NgKt%N4ziq`^5|{K^C0p}k(cI`Th-@g
zRLVlyO@^u6VY20_)fT21MXL#EH;?X@?rq4tBPb1i0`4o)zh9i7Q}S-)U~V{CmX4K_
zl<j~JP4vfQscr;C7ayja-tD85khlm4+GYxNwiUEmQZ-M4cKPH|_H0clyJX|H^{4wb
zMKW3rm4c?h?J1>gU-ndg@HQ0=z6efKDDw-oe|3MsMZ)F}e#q0LZGRIn+H3!H3DfqH
zxAFAu?7Pb={PvG}G?%Qi`J2R$laSFjPnj4FQEu>YrZFHn!Y?!rF|BS}+?T*{D}iCC
z@k03Bd&b7z<K&*9UI@Y5f!Z~WyS--n;N0TJ<=c5r`6_aYnnG?mf&$FDf5W?8VHXCa
zRXImxQ=A{m?Tol>kUi>R)g2ywuGW{$BbJf&@a|~zPEnE&*v{5^TgqiAm69=^X+4`m
z#0ra|<(b7RqsV3aI;`vKUwZ7K`Aqk~l#<z$Lb(S&wddselP?7P<0Qg>RQP_JehwSt
z4&J^tN+gLB8EgjbHi|m4Rb%F!_<nJt3gg?reg3j4|NA!$o5>ae0oUQKOj{w_P#vGb
zy(BjjrK|Jsq(ZW7Ecc7s*Od$3){Lm8{3Cal&)2%vkMw08AD28jSb`MJgWBbWsu>fh
zo1{B(W4Eu{H}LguDv?YH$wJZxK6qVds-h=HPybxfuS$K(mV!z6BtPL<CckVcNZqH$
zp4^M$<_q!Mk=xh3tzs}qc?J`!L7J8>UhypRx8A+M%;15*_hX(jy?JQj%pappFb%Ta
z4PS#Rf5GVMo`0db|Mw=STzbUG|97ZRSt}ZxCCl?v^-v*w6WW~O$5qUpgIb4tiP~}`
zv$SxD2)-w%UUr0T73hr=d@I++@Q+8v&VnWsJN!lY4pg{tz74Ov-dF7}@h7y$MBk?W
z81z*!e`WNgw>jHz-Mpy2;`8%i#Ao4J)2*Ly@^MBzY1L1)Y|kA^u0A>a3+ImC7azrc
zKRxW+aTllVAsX<9EibuyUfLCTBKMQ}OhWwRY@6fGUYOe+y)yf+xdZji=KFcKZAg#I
z&)F8QbK{$xZHw!$(`=6Fq?VJIPG)ct*9m&W=7dgWa?+raI!=;0spq7z7_Z9>$8tll
z^pn}YEMI4)I*;c5=|HjJPm1lywg>&(wrpAH{BAV1(z$+UrSl>F|L)>gl&c51;{WPr
zll*xu`E%#?=x6w|_%jKTO@A-@VEP)=munNw!08M$?h_TM1-+mj(l2-5_O&zALkt<k
zy5<+Ar_slJk?GMkv($a2Wh6Ip*x7njL+;4p)s5~;!#}IdJ%2dD-DqbvxwfN_MO|8$
z9$EVi&fL*TWjHI;ld-dC`(RyeG`cYT!|YEhrCY@0F_!zu0rR~klEtq3sPcAIf1k5z
zsAi?}F;}JJ_*w601apXBKX*RXKFFV&2NS&Y{7UC%&#iP;{%EE1+dp3Ee1!iUH9zOU
zftAkFhgUj3<b{v@8!zqUrG31#pO^UGQBz*&lz-yAc!U>usr*vmTIhXS>ID8|PKb)s
z%ulm-X@E{kUlhU5gy5y-uzjmCK6n-<#&)PD`38?(>3%#~yiXFxO%qXSa7lb%e|DBP
zh|OnGR6QuDeI_4YL-q;8*_@5H#cP-=Pi^TC0d4>JCDNNPnEU+0_);a$oo$!L2OeC1
zc_4r@i_w6SA@S{PXJu>x=q|~P+n=RhBnO5hn4PWiK_ty-&#*b=Yj=mw*a0pe@VP*P
zKR%|h$isrT2TQ+At4&pYfngYrjyU;0g=#^<4Z&Hme4ZFRRG|iIlW?}qaUY^Gh)jGq
zJ-Y`_U5F9(L(aBS2Oe3!FQ7;EyHrjC5|#FBHJnh3zf`5AIUd`<B(<-!R=xhn%ZyLI
zbo*%1@`h<24Qam~?W6H+>(R%zGsELsZ1sDvMh)i<Hm$y}?dja1rqvg_3?|PSspur4
zF(<J&MjWH4<IG*`FhVpjLi{BCRCW&Hza&4Q#=`Ra{o9k7HZv6M&OOIa<P_UuTX2d-
zlf<Npo}GI@qt(w4c@lKlliVjtck^xJiO3K2J@?!vTTl%(oVq{EJy)MOk^bOpJ!|lc
zg$pjt?q@VzeM4v@Rd3Prc->&UmR?^M8C+Z&(Mc^Q=FSXGX6R0olc-K+axzmVb)3}c
zq@I)d%6NJ(`<KCdMOJ_MvmNj9Lm!`HxU1G5ylH`xUncrqn{;=JtTAVE4cCaP7&R1~
zoy|WZ>9z-*tyl#!j9EvxwUJvG%bt6dA#0Q&h4HzgX1Hy?t*8H&p()<VpJlC#Pd|Hl
zrE|lR92u8xV2t|M3k*w)JU`@K`3GF@;QIe^&9m}z4DgK?@aKjLn8P-u_h!GQw#Zzk
zIbSk!jSAxK%l+s;vHfHfq1Z(Z-oWYSzGchLo!jE*6F+-|9Cwq$6Xfs|IdEQnbfxoH
z!wDMJ9?CwR#{7!mBpY{kmHQ$)BHweL!HvDU<)C|j7T%S6PL`Hf=B==5Lpc#-FnH>s
zg_mYdbhe)DZqGlxevkW9`NbT=`iwOg2@}4!ZlkYV-k_<`;5BtKiVgKBT+CEDuS#T|
zbhb9syWh({vcA@Rbg+>&URECouCJ+sLzdOohHk(q%j##C8((!Ft=de;w!g2BACtXs
zWKpn>AlTHL8J8z_=14Zb%FdkX@>a=bqbyYWn~Z;D((=B%v!%N5uhiM%mG|ZJhrsE5
zOe)F*m4aL<KaI~5{e6;`vbnq%8@nZ8Z9Z5=#<~7XBBAlUdj9K;?-?_z4A>d@R7a|$
z9Zq<#jv+kz<H<(Y{|M#t=BLNhACB4uUR!_WG4a1&zL#hD>cYNKmRI|}9KTP{x{t!r
zQ}Sch;Hfsmu-Im2wGHhbuFalR?iGixi&-=WCP<hZwdHeqD%6#ECgs>zWBiBs-D0s}
z4PShLGD(ur?C<U$1|+08@%~|EEkov{$r&h_lWu3=B!;~FgU(<l$CrjR06GIV*mIV!
zWZr%ZxsjDG@Q>kbzib2w`>&|4$MFThGrEuOizX+3+VOqS?c{%o(e{{21?k-H9?u6J
zjq_hP&W~seXW(OeRNBIyK%bdl-wSk`UK){kXSvY`xx!r*QSHd=If`x4$-hM}v|<fh
z`y&nUqbw7}#fcE?jg77Hc+c=wX2wPbU;g9|FjY_f0RQ6T4<x=P%>$Uw<PVyrdO+ag
z$-me*>4WITD<hLuM7;$i$jLtgZ41t}8mK*MZ)qo26HUP))713OCOWeXPX0NFi+0u<
zU+Eb%49p%SOsZZ^DOlxfEmn`U4`Gqu{zp(HA0KvyH$GRptArOPqSNS52|YPgtMk}U
z2~{~YL+6R16528z1J0X<N+`^!nL6(tDxou{>eQq|FVy2Ks#iQ>W3!=L3)SeCU>Cw=
za7I9+06c<}8F;&1;f30%UYN-X8*fe3*JP(i;m1^u7wV>bK^i+R%$)Lt|7l-{PWi$n
z`@)Qx?5UI0B6|bL*G~0t5f39%Jv_(wR-A!{X#B~NcJlY~q&x$cLTKWB6!~uW;Yn!r
zYr_vI_`&Zup{CEA;&X{2etKMz{YT3SlaqNTl!Ol^fA|$1!UK~(yqkwpxBnWXHZM%w
z{!8r(wEq-5*k)gV2c~!-VPAj`rg-6JG_&D_?Aeo1%NdY(7|#c=rTI;+A0qZh3h6qQ
zjr(J_)n2FMpDFZJl}O5JZ0tfmA-7IGkmJ%<f3@ZD^wTQ++}Xym6Hq1~vwf51i0?*n
zM}Zqw@PfX(Qo`gY@;Kg^O=PasNO)>R-QVKYFJu_hqxU%5BrI8ESe2_r1i8e#Qb@TX
zi2V-hqmLSz>v?&r);~;i5KY;h7=x=b8uhhCcLYp*fO^Uu0o2@^aC%34-O4hS_cxUO
zc>P(Gx}mTETWW6u6|?mQJnZyvF<1|iEYd5Nur#rU5UJIrvBuY6CP%fCRD0M~+p|~l
zRr#;SRa@nmTwe~V7c9mzE4->|W7?0;aageRLP|gmJPN0}k^5%w9zEoPllV)I_kEK*
z+IG@Qw#p+y`FXAw&eo-DufgbgZWDVg;9YOSxj21yIPV?ypQ$R7eDB*Ms`wi`2lBMf
z1)gn<4j4X+I*=b?aiclYM&=*=*AHH&WpLxyru`tWLm$OV?Dv=QU#n#HNBR8n{0Ey4
z`qr7c!fm0YeCKu=(f~=D2=nwgE})_%tIX?OZ^oo^|FKY#9v*yCHVd35p=WoM|Lm$%
z0A|5K)*y4~57R%-ob6&P4auL}dulSXq=>(i{a5!T_W>B+trc7-nf^IbxJLIWCx16u
zXyNjv!nKWM2c*cEoTv9W`3>Aof6vKhISL#FKbf^%t=K6*7_~e`nC6xzNu)XG+u(8R
zDl2+?ib^$eL=I_LTtdqYl(9r$sJit06cXt{B$DT`(dx3Br5N<4B%Ja$aXzEfZB?;$
zqB?Ww{+ueOUvlz)37sa%UF*=uC<bt89&LfA!yu52G@U5^@?SH#H6ansjQ|n2^M7*<
zNd4NBlh<D2?w;JUGcrrG(5CH?5N&me$+%%&p;POiFBo(dq<3Zir5J6<4b3a?w!61w
zclqq9FQ7mn;l5P*BgS-7y1lt0QF2<{$Ko4=AolA-kQ|A#iOU7W+ahk~;2d4mR$a{q
zuAn0Ou0+8tZ8JG=?k3n02Ho)`wdHS+ohe7IqlURER|0bE$?l;jCvas1Qt9_ZP5Hsp
zP@FV%GI{=zZc-Ur4a(S5&@LgcgEx*<8hw-+wTkYhfz{CPgWpRg&^_}$TG%u!X#zbX
z&(2u(kIUVr1{A$*h@yXPNQs1zxAXk|b{~vcQ~t3jd-(@?4fLAI2baa{!%@@ZyypKV
z$fwGBch;yk27L;i7C_e>O>fVf<~|;@;YRvX{i5_}cE2!HDbQ5N`MK%skXXIw+NSg~
zPQFn+X0Q1MdI>;nI!=>&K+d?9T_PWDZ^bzm%)s<5X={Oo)x*Lp)+}b@%USC%Z!DYS
z(CR&HGDx#VM2l8<2F6L#RkYF2@bmO<L)XqMq+l*~i`bhHWo~*jb9+^W>c>H*qvUr}
zM2jne)jg)olubo@->)PG+DwwET!g3wB)q_qKr?;!aflF*Ym4ZW@aR>p-?9a&K_kd@
zfTB{)0!|=j;4xUR^t^Wmiunwf=oDx&?&QCrXDk}AAe~C`TiiVn(2ptX3nNiPgjmRa
zAz2LZ6YhbQ9iq4DZ43@UebG|%Dm?rDv-dUdQB`N&Gsyr04%`8w#x{kiO>82liJ}sS
zk|2bS3Is(!>jy}Jz@lK75okdt-U;M7PNl8wy4~%reRsF*cH7_D))#4OF#~P_+7-~Q
zqU~D&U1d79BHEY$P2T_ieB8M+Op-y+ek}L*o4Mzn^PJ~A=Q+<g=XuU&fICNvGI9<X
zE&!7;Sm3y`3F8z(+|W7zchEGuyMx!0_06;-9D-LYggAMQ<*jI)FtdQ0q0W&aImFry
zuN&#b<WrJe8Y<9|EfIm6uH>%-y>Q9r1o_qL|3igN+4Wlk?fNMYfbVvb$VHdwP2zTF
zgj}I%$z}GKf4c>%UT3%k#b#HY@xWFjADvkcySZodFu?)z44eKLo)xXlzcM0RHeqgO
zzknXaJeZG(KS(uZ46%~bR~)?tTY0RJErV(>6ZE@SmCtM!t3Jz~t7ye!PEr2qp~;)E
zVWn7nG|om-h}fc(u^;HX=&;yLjE<?A$>+J#zVgz(^3@mkTG--dd-!5#TQ6JC03$_T
z@>Tyk_?xaz>DEqivyGGI>{B!!u_%ow6tA83gV;RK+!MM|76?S@v*5o1RM?yfIat!|
z#-^s^0KsQ15{f|32mP@^E>?t}gWfd#99T9KqN(Tl7ODpu{Om5jh_8y)pHi??9YTpw
zc`q#M&X5<OvWrd>{hobqj=ZT1d9ckUvE2#Pfjt6n1&73D<w0T^&$ixm@0@UB;p!po
z-IGLb9r|iUUO<JD{w(}PLZh-V%dl0?0o$0Flwm}EoT7c8_16q~bRUF91tzh+N(M`+
zVIpJAFgINJmb;er^!Q!#dP0FZ-DC#PQh1^_7UHf4)Px(0ts$u@?+w{1xR8VtKe+zP
zdXWdaU^@i|+N~iSQ;PC}S6VNjTPk~2$cA||-*||pLE-K$>xeb5&HYYvU~HP(8rJ6e
zneBR-B|EP2HNz|isH5$q(|FRDFtgCubUuQXU|sB*k<mPv#P;SFjEBQuZo=b;*3{L5
z@!K_}Hk5fZ&v@t{8~$hGza1EUwl%iaZC%siPgaYR0RJ-JKktAC%|BA`zVNgA6}+`G
zerRCvL|-_1E;g9}Ltgm6#PF^#vQg)@&TYY5w8#hdxG*yhOhSX3xDAMq#IG=Dz3B)A
z0ZZFoEjy~X<1rqZ$&|2o&3JM?=6{=BcO6HBW3FFwl)D6B(3{b$jXvKz2H*fafZ@5O
z*IV-uZ(n@>kobWi#*@1S$E`gjJ@9kKo8tI)iI!1tE{SA86w7H`JUQ@M)F>2pK{SsA
zF~oWW<Er6Zhg-by*FEOz<xy;&IvhWgXYMx!?~4wJt#e!Bec={&{7sMfW;q%q4^lle
zkimx?!8SI@loob!-b9j`8w!W#Chd2*8W&?u{W&TwXsZ2OS&+Z}bJi>IgfF~nKe)&h
zjOT%oOh9mYW<hjtY>wMH5A?RU!>>;aKNnUhwG>+KC8EHOWzs&`arM?7{khbaBB&l{
z>9E-gJ>3v=fUGf|;04qG%+CDv=Z7ob2^ECbxqlWK7G9V4bjWMQv4jKFtFp^5gWzLy
zBvuI)CQBT3WQlcljev=cG<W1#BcZPVcq)K}j7`82J#!Mij4i{_*cqED;EueoZfE%D
zcH;qz47<WdUt4o+*>1B3)r6JI*n%SOH21e&9Y(<!&71--4~~i-9B95Zaq!Dht}v*w
z>1_z(5^I7P&r6^N0na;YE+!sSpS=h&w$z|MT$g9Hg^&I&xT5JO1i%$qS-ijMvEb?i
zEtv4p_l-^8f`hRj-G47)-Qz}kj*YzQu+HJ0e83>fn2-n~w(;cArk=xeG(UiUv|GM#
zd{wxsJW7xU=$DuSBuFD1G!h)*FK(?08_iX4IrB6I-|>S!^UaCzHwO-Wi5dIAcv9t!
zT=D}z<Siel3sGu`M<Hq=!2^fGUE$#Q2^zc7qZJ;4f@YpMVs)7ZTARAUa2m}!=z%pd
zw#Sd)LD_%B?D8O=1;#`F3Lo>}AZt&2{|MqU4@`_7@S#3;gEs4frng#g?)Tu`2r593
zwG+*I!QkDx7~t(+(-1%C1p&VJTX|MzNh=Tz-ebO1HMl*V@L=6a%u_j_b)w5P)U}Vf
z%5Qp;jR!i!0{7toY-wVj%R?5eVN0xQ*-S(sciik&nD}R$41oGIK%|zXb3{tAzsFJ+
z+8J_~$~hdQ!qfDD6ZC@<*EfJgqT|AGFrvePg(3PMsJ9u59JGFc{;0@$sqA^&1=^jz
z{<9pF+iAY(34RKd%Gwz^m(>dIVHK^cT2NnNo@)0_O#hh_R%|BW89Z%pR&)rJ10|6>
z2lcF)Al!z96%dB`uW%S!3Mbs^GdBGl+>u|c`%U;5YSKga2p@ZGO%)elqb98vfan-r
zHs5M(>Is8WM)RHUG+!STe|?~NaN^)sC)@}uyh6}y%}ZP<5WKVIQX)VV;xx3er4CgH
z>w@-%kNqyVwCUJ>pb6a-KCnOB^;qzp#MvSaD$y`F7!Q>wA5QCN*%4ClKnIiEf@U64
zf;VbZU4Ho3`^aEnu)gUSt5Rq=7f^<`uL>V6Z(N>eg_pn|4h~OnrZjwj;%zj42ktb{
z<~D`+>ptVj=a3n+4uhW+?Zbo(zBTumt@#w?WWB(B@NoEOI5;eMr~GQgSLpNBv*y9p
zrlVnC3C*IgSw~YISDUX7ioZUB@B+DS@T;O)3>>_diR?xq#J}eJT8t6^3hJX5<@CS;
zR8nDL`^xN<vPi)BNO|2#)mX^sUyD9=ICFo?l#fjx%watFBdz}&uRiVNc|3Y!QS??}
zmq0P?g1BIKFX`LNp-Om&)_>5|RHlth|3hJFYkJew+0)b1%~sZk?1djz{;wHjJzw?`
zMhw5y4v&_+Ny%-F&Kph!UoBMD60;i($7945k0%C(ceS<*L7G&AS|-6*%uAYpN0Lxi
zFJ&XQmT**^T879NLLY6J;kIMtncMRdGoXiJ3~&8(0*#=mC%}D5Q=5U=btb1G=h>0-
zVV@?3icy1NH0~80$r0P23%HWfq~V|jn*2%(<2h%2?Dm+d4s=&-9SjrJK?Qc8?3T(e
z^#n{l3)7%4!@!js?c^9HYhEjBM`Qh^gP=v~=9~eHy3rI^ZnoC{iGZjaUlR)OHnMbg
z(_5l=dSvl@4}RQb_qc5@2)sfIqDg8!2UR)zoH7;)k&|S-AVa2)SS*Hfq3x`{m9W0>
zbIMRCOkN0WX8lz9jtD<@SdxgP`|(3Qq15WJhLk}eeUL`WAZ=45E&$_2*9#V5;zv${
zz^VEBC#>&6pBDR%P{ceF#Ag}MX0KA(?4Gj2Qk%Vo+U$Koo4rqHvu#3~Ew6mZFrPuT
zXb2RdFY+cUQziT~^DByteXVsC4+QXH6qB&#4v$qBtw4kCC5|uvQcCU@@rA7ikzMPa
z3U{GLUV`s%*K2Dg%D(WS&x`PRvPTvQjqa9f5Mmw}6+a-l<-Jc+$U(uq4<tS-aIjNG
ze+qd$PvEFUr+i<YwLRSRyWovYUHbtZx;cDsfB5KQ!P^qQ$7i?;oibYm#zUw48l1)!
z8PC`<FCXEw!f>zn=bO4jFMO-&fp1N4KwltZ5Bx3h!5-6S{u<nlPSR+OzyqoxtUq)A
z#Q6S!gLkrXY`2a+4fW2Iygn>D-XY1`!UsjCJI@h4G#za8q`KVkSil}XFhXGR2~6>~
z1`ckQKobWaeOk1zd!^n96?x+#_O)23m!TcX{`Jp9AKaax5q3(AaN;{wCp5zQp%Hcp
zjqrY3BkW`Y@=FTD1}|FiXW^0qI2?w8ijDEYLM-zxv-VoATF0cY-srP%^=1=56JNn!
zN|xyo+Mx+=Xopbv3vCT?CH#ynt1vEN7lP4zGdzh{8C-8p9Q=|L$B-{^u0Zn6n#+`i
zc!@wj4RIAT#HM4vL!k$6QcB`&N=dvUL4^=HpRuVM;Yvw-4^F9Eu7XZD4cquI4h<#q
z{oq2S6)Jh8S<`rH;%UI!S|Lpstrc=_P?~*1A<fVVMJ6bb6R<hB4nmpCm-0yDp*tP<
z58dn((3w&RRQAv-%2<1zGX8<pCFF4e)=*-IT4;de?YVB0-)fvVQab^S2F74!QApu}
zQi#GUOIs-cittEzJ)=K3RDeGV{ozm8zx~<iv)R@MaW2q4iOU}E#o^W%*%OPaFx-nN
zJAcnAA5Q%Y%oDRn%7#9f5#L_*jgK$=kE}cdqdbyHy^S#F{tQbls{O^D)<bA8Id)*~
zl!vBi{s?^tD|T)T&~ONG_PL|lmnTow#ED1#U{TqNQu93qP2z1dJxkj2-uYSEq`ar0
zrDMho=c}0i4ew|u;5ecIUl_a<f&YL&<H=Fn>TEo~2`y`1i3`(|S4)+46H)T`h9c{5
z*&Zxl{nC2)w0t7n<bb_i_L5S1KLd+n{mo*y)z^ygY%#vta<i~CHmPomhQ?JwdG+mY
z$#b?68eA9|H_}c(_Ctlx2u27kLCp_IU+WrcxI>EtVd_caA9j~v;0GqdQ63JKzy8zF
zI-hya6LgM@R=gkwaJI(^u6OUnd<AL(hdf84pNnn?aFk{so#IGS5Blrj#*?pNch$Mz
zo5y(IeWWXjA+a4U)jv}|<2WeR0~eHGEEaYcSJfC>F!sDBH5AG@M(6kq6eu~zDDxY{
z5U8=~s{m4HV4}%U&^dV+z`-n*H|SUWvrmkJ`jShF_b2l>NEx~<l~U+>bfFlZ^D4b=
zABT&!8&7VZfF%oSt`KX%w3Y!Ib%}MZJC37uDqmTBA+rC#V3dW>Op=CpVX`)Pj!+}W
zEqq{!H{Upo-fLZ!wtG<bho`2$vAq)Y0c{btb$H8;V2KLK^Rv-8KDbb#p9){|j&&GH
z80-VQIV=YoK@H0t#%vTOcOs%3v5w}jVICt_r}KO?@6S-WDJ9F;;*IQDd%nmhw+9*~
z*BB(8(=fsopcid{an=!PKq%gShYvL%>m~Ee)~4<-KbtwEl`;gLm6{jrlZJ5DJ8Qlu
zBj>Mg)T)#9GEIOH$^<Z!31B4Wz@?R(&}65AbCuH9-<nA6dN*{M!QDbzpMVKE<Qhiv
znzNzA99}&%_BnUui`H|-1D`-~Vx?Wy+LJ0Twog81`_!6mk8hnq|KY=`k3VJqaXQlf
z$omfxnM?nXRzA7(A6QOREvC5He-zsN2jrJy9Oyr~doV7f`VKj@5J;Y{n+EZAA89G%
z0^bb<tJg+HO+eqV<_n_V=;;ytMsNjAV%*boOpIrYK-0JWj@Tr3%Xm4|6W?rhde+x*
zj&6vxv!rzpE67C7F>*pd%qoO`v9IL<3_7)Rg%9M1cl|mxDZga~N0GMCViYHzo=nG(
z)*qn#Kz|VOvNy<Ee|~fxhJ!u9;bAQ9_OTyu_uyFQm~ReO%idTpqjIld?n0u`dwJ-z
z$9hQ&F35d9nkm*e_g*e7d)F}k5ug*M1Pqf#3;GGnq8M9la>uGZ(R5Hu!yaYF8vIn#
zQBINsm;F=>3}7+-y+2LfqVXYJQs-H}64O<Atn0^{jsn~js*Jxi1cOd40|pVMXkQ$B
z6q8!{=9~HPH@$<qV^x<mVMx&J`YG8o0a&qo$ZKr81-0F3lO4(st4%J>`AVytpXYim
z-3|bV4PlbQ430<ZE2lCaW4GU!f90}!FE>GB&BXdoMQ35Xl6k-rJUcwG8^*H_?e_gF
z1*k+*<$?~*1!Bf}I-6>&4mOcV7cMx#r$<=Q$xmw5iFa(48)v9k&&%R~bsc{lrBLUN
z`OdZ{!&wTSm6PJZFHQiWH6cuypfmI~wkDUSq1%l9uxtk=%hz8oW=@WouODwZCd%U)
z%#=4B5an?Y<?+JcXKDJHZ{^3|@($h|^Np7i=K}u-&MR#2GYR8?n@}X!-mt;nyZs2A
z#i<{<TR9kc;(0xp`eE<&n-(|fcTab!et%yuHXvrDQh8Q&`(9PI*QV9&<&L_2F6;Kf
zCDtc6lAJnlhxL1g^_%$bhggSY{eE*|%vbKH;9?Y-wfqiu%guS=xAMcgf8Fv0jt(au
zIGLIa^6}(Wzp>I!)bH-oSik4EMFqzVO&_{`=l5H`aWK$dOa1P#>o-c_wAJqgZc)Mg
zr=@=9W2CI_`knW&)^BP2onZNmwDy(lLG{}(R8E@6c5t!oztLJ&?p{5v>_ygU<H<oh
zTB#9-dvZbvOJ~G{Qt&h8vAp#qOX98GB^E5MJQ#)Mj_%6cjn7M*IZn@{*FTKkOMB~x
z?qQ|9m8FN>P&BLZ-PJY9o)!I*XoMzg2&^7$JbC_-_ztXLdXcASG=2vCCn=Zx=Q&HP
zQCK7bf-B!`+>`3iXe?U8tns=-v)hML*4IS;#rY>}pV{E$B6rwUqWhYS(>-MOHNM;0
zBf76IsP1bLyRYE2v!Hul6TRQIGK?)48O8B1O<m}PT*1$XHe{N6@ZO3SV0C_dd(2a}
zW*FiOfxbQgC#XEv_+M$ty6%tD^mFzPd0G00laim?b^jpcXKcFsT$&+2qbNV0&XAoK
zPEK}CXutcApUf6q%1>2R`MJ<|a<~wj60rh~qH|2BUJ#x0Y|;7e{zOLzkmmO(>p%U;
z4>m+A`H{_Iukr&U(;+|?2m$hbH1d<FU!;vcov|OH^TcRUmewuPe(;{LA5LLCS6}vn
z@59*-;$-~4cKg8|AIQ~y=)HdbFSQ?Z{m$%tPDlMdV?UhG|7RH=NY(F?vLAA;-+#&W
zLtpj#g!#^oZ+<OpJx}_2tx7CePv6aPI|jk9n*+mMRvx!=$Xx{7&Y@jT<Gy3Dq2p!4
z{4}7kR00zv$(eG@0&D!EgNRd(!=FWf_pBpwYlhXWHe0Br{%UK5*vdH$BOTaSvD+|z
z!Rehr#*_P?ZyTGo;|piZW8SMcg&VU6UwRw?+?sKobp*RTo|4IL#z-dyF^!Eu4C=tm
zy&n@&@x&^hHHfHIbTK-28gNU5+>&q}Xq4MO67wYrvA5%O)D7M+BWL)IdX0y;pf@_-
zlewpZYj)H2ba3si^{(~a$!zI(6{&$8oGBAqIz$Gzox{l7&cP8-?7XpebXeU{gL^uz
z5qmlgVgV5MbjU3i+|#iKJJfWr+Mr{-qW5$puM>73l=J=A%&|bSO>g9wtXM`W(phGR
zEgbg#jX{FY7Vh8mBrd=L4a^w!zJo)L7yTL3k5k*fF$0n=_HX!;ICjQ<oZB}%di%ym
zzzRtc+c)H{47q*7ix6zz*d?}a9E0d^+Hw*%P+(HvFupUlZ@dh@tlKwsQ0~O;4KX|B
z*uC*@0*!O`#tmxs#yl}=d2`|cK#1KN>)=qkH&%;S_lP|o#+K<^Q{=PW1r+ywh&68a
z$jus!p~NJ>s!bYK(J3}*Tnv|Ulg6j;ZEw=Rsvi#79vOU8h@jZY;%0=ixkm;IiD0fJ
zehgs>%l#R{6Td+n39H5HFR*qx_hrQ4!4>3=of%wrhtUx3%%Jwq3&XKH<D2kx?9M1u
ztC8Z|>zlSe!>lj%P0Yt4BT3%|innjgB3OH%uJDAN8QgslKjgu_eRrqX+A6kY=$#oc
zPlei+;X$r2L~<=_y55!HPyC{<T^Xmt{_Sl)2B^S&9H(c!#D}cUr(-@a`+l(8`rFfy
z{wa@d^;bTpV?Ods`JDd!OuGJ@YWbY%{^7sy_^3bPq?y$10=On;hBe0%3wznnyO*@r
zcrO{#UgO7?tG$M|w&TTHEA4A?=oXJ`FMGkaS>PLPl!ggw46pIF*A&tz$8PDOev+M^
z`dp)qTA!Q8^VpZK=mSTxUI=sw__E^71s`q|1by}aKUwiGuY67cUsk-pC)z`fk9$*W
zm5IspWH?8TF{A2)AKW**xG{zFW?%opjSE<!=MJ51w))a<2Tk4-t;2<(1s~59<91%@
z=#O5%pf}?-Q_@=yomTj#p;wkqo6Fl??G84E8rrG{u!7)TLzSQG^#dnT1OOmUn5gx(
z4;+lI_F5048GaN0sBy0LYEg^1$B4(JNu&%@kAq)n=S$%Ha4m1*p0d@ea0}fA+*0OV
zbC$Tdau5ut<Q33TvG@Sj*2x>nR?pVAli8;_Ocj@sT?KWn(3<VRF(p8}Grm8M%lX78
zF-|3UUSy)(^CXGV^I5`A{ApVGw&l0YH3a-xvS`KXCGFJ%8Z^h4pOfR)0ANkyR|7oS
zt7UU{0^5i`i~b;v6Ng#OX0(syGxk;4BH~C1`(9eCOmo~g>?jX;9+-Xpi{tXw)RAMl
zjIdla@*U7kj`HXdI9<+rv>5*P42Rxq7md0UF6}f#tX7H5@<z|&u5oDI1(v!cD>iE|
zbZ&pN&ORzce6CHMGuS2%6TwOxO_V&a28%$(h2{d<PB^KuB0}u>OOlRrHVSoYe5bB2
z_h9{XsU{psbavrD274(VY;=GL!1Ad>`BbxelNF=AT6S-;yjA)5JKVf|c)B;~u0c`F
zu@7NND=P9hr}n&;{!3>xtsirgf7<zasl$JaEqM`?CKuRZ0p%Cm*k-etZXQGx@}lqq
z_;TrTLxHC_+QwDv@ZsWE9@Hjo--Tb1=4|@Om}XD+>iH0YBJj?JNS&e?$0;~$B<wpT
z&90u{FrY4I@h0<H+>g7HpKR*66y(q^=xyqG41|RSw7CMw*Lyj&CtH2*uf7?js<E@x
zi$1EEgTHk`Yspf-re&{R(`hgFQNONc_+)YArO1XQ4<~ExfoDJ*za+fDi~zU&m4~l!
z1s9{d#(^s?EewDy0tAn6Qb<rf<KW9OE5chen$FsgdG6XDfqcy%K$qeIal8W2Ri2L_
zDbk0e>|<5UcE6@p%OW7`eA#Wov`}UXP-^ocvjrGuDX#S10_0HtZF#9ik1N#Clc@H@
zpS^!c>8riygF0K8^<C>{7|oaw9By`2<4m$nZ)n6;_S{Lo7~W%pjtv1rC@E<duz?<s
za~x|J#1&yvydT6}0LGbi&zo<~FuT3Mp=Nh=&>MLn=xK9}=6#-kz$h3$KU4kSm649%
zIkon1+UAyW_|--_aQ>Y{P#ruMSVHF@Ry8`xN8+sq284GlNS^(}l}RJ=!cXf#(oaJ8
zGp0P-g42#Nj#yRv!gg>jWdC5hAkNd~9$f=BR27in{!9&(f;}Z3RG_Q*7xXS^cVBW5
zmM-8rpvbSB1h$-C1HanHuR?#g8mm8Dpsv#sx&X)ob=zAH4hTP6n;e(!F(vs~iFkOr
z|J0<B?olJaaC94PVHFC~4&==F^iuw*!&isO!&g;o`<^jTnQ`3J0pU;$jA*yCSR~t+
zPJj4~$jd0a4iVEGGTMa07vl~|$V$6O?QbA{QE@6Px;oFIb?vSjLU-4<RpVN4lf9jY
zM+f2!#f$MMYcd`cA02PzN*#~&M8u<GSj;>hFUBjv8xsOZFM$8{>ipI9OmJ?fVRc*e
zAS74}ZxNA>5izp_FGeiIn;L7>9D{$**?^esuK5l1ce8_Dhp6QU5K-yy$IJ@67<DY(
ztPoKgb}6E&G?#`N+p4{YSOsqpkq%_?YP=Y+8gH4&$#CgR);2Cv%$WvX5swZeI2|v>
zyAE%eU>#hbwNYg9hDE`UOmHr|MMOFV#>^Y>V#Eb_=i?VOZ^6GP2avZAZUIdPpcmmq
z=z6>*^isImUEn^TSHLZx=>YUycoBLP-V!<pmtZ-d*TOBJ=>YUPya>G>ZwVcSOYj-c
z5x5039e{4ei_k52OX!E-0`8?DKyQXyK+^$e-l<6FNAQ-=kHXdN0z(1)4{!@;Isna~
zU_w8Jw}k!|xWJP|LFoMAEa%MHVnoiySgqX~YjrU5bVGF@bmGn9@;<&S?el4^pV{nT
zI|1DLf%>3MVBT&X?4F@2t2jsxjilK%aP^27w>i0RcS1o_RN3TkxG#~FHaTYRA#?xz
z+bF4J&&#8m=Pw^vx7<}XZ_f3i{V<;iBrl1Hn7D9FR9@V<R_%A#F?LI!`nag5`j(=|
z2i)!qis&aP^24PmDxf=OiWsw3iWtaD*%TGxLsLYzgQ7v?5&a}ZMQ~|~0(2{i*z}}$
zG$@ltV`8F#0$Z3laLDK65Rno=do^7svts;fdgyl0Gnn+yPtsEgm!@Y7-HINzXeoLI
zXVP<dOtgEd$TCW-I>5@BY8l(BnI6b0$G;|vZU<Rjl0`pB)>ybSS>xzdWU=u|k>$-K
z3v6P{>}1)^ZF_Y9K%l1z|C%1U9rOs%rk|vz8ZJ%GWV&+}B*yGjkQkUINYmh<DWcm!
zk>C*hBt_T3r75bTJ7*3tW-lCK5Ls+<Xf8f9J#;(h$!CetPtvmhE=|uZbSrw;LZ(VA
zKeNO}$3)+Pj`D5*qDP_zhPIUdcCVvs+o-t^-kKb`Gs&T!B&QxOP0mufb0&u|Q{=4V
zmun{f?QYE`X9c`9Ido@|LqAE*D!4Q`LArA$hcQ8p9LrJMA=gv=rcKUTcx!U#&LoF^
zlAQH$X>!7J=S&V`f*i>tkD$smpMG}7Y?Bj#w<d?~OmgTa$!UR0lk*VWIg`VfAV&yI
zwTA_bKA!(}&u^2n8Qz*4x--e4pCsoIxHLJB(w#Foj0tj<iI=C5FIO%9ZPmgi=O5s$
z$)P)w9QsLe9)nAh^DlJgOb%m$oS=AlsGaGW#Sqp^MUEb-#96LVb+HfD=6GA@2fX+P
z_cI^@Zlte<-i~TKM|I#H8#b{UfP~@GpZ*{G$nA@tdrq(~pzpgu8?`qCDt+Gz7xewm
zqDJWZGZx(qRhas|58guUqXRm$)4*Vqs97K)dSt}fhC7tfUZ^9|F(lo>7$71B@Q+4i
zQ6si~P--)b3&be_1gR{=TgDk9;?%5aT*f#n5T_hIf<QW;mpZKqsh5ruab_-}4N|3{
z>3{<2G$qK3s5x0c&j{V!&{pk1jA=Rs9f;vHB4ms@6=TIZ8Dp-FK?lqgr}e;YPFfG7
ze|50kRTH`stfnou5Md%GbilN7+7VPlqUKWkBU-~<cQinR8&(B@#M_9dD-a-}(t+Z2
z8Wqx<lhU8R@{WeacGv91!IiRj*XoFL_+wvn+817UMZX%x|5hZ}_>;*EiyLA;95Uo=
zmvveDBoF=CCec2N07Rrt2aq)5#bRs0TOxS~E}Zc?$s;4Mkr5H-=)>}W7y`X$7ib&P
z(TC*$*#q=<HEucp{cm`YnD65)<>7I-gxmr83AhC%bO8GQ;zj7KcuVM~;6f>_BAZ*`
z7SMD6I*u2ipTS!~?}UrEDQmxgTR_tR=>Nit(0lNf(7%KWl`X_v?t@!E(*fvL@FMiD
z@s`m0;UYAp{tdVVG#!BcAG`>C2yY4fHe5ow0DTy40Zj*>-^Gj2@8d0@JK+){1?b~&
z3urn3{YShA&G8ut%|RU@MS%9gEuiTD^kBRQ?ZaC_^Yqwu*Q}NI0=fWh0Zj*>&%uk(
zg?LNoBDmUJkhR{e$cwQ(+i69HJ&>;6tVoyG%Z)6E=i_LP`>`jNpb72Mo)oqcsg)fc
zGG}*uUb<Ds*T1dAm{4(jd}Y{53`(<=2&6k=x*Z*{P`T+R>G8v*JK_Sm6+NUarQ&8Y
zN*J>jm776CV5{7P_|Wvw?Vx8sZnh*lj1)ZsGF9$U+m-~Jnp#~7mmC9QWHo8nryVJ1
zDF(3QO(|TOH)H5lyy>47#sqKhuV`5TSE}c;X(@-d<_p~pz6eu<ev+24aA{h`(Verx
z#F*$<g!zgAM}8^YpCPQKw*FRy4^0l;4stv!Ci+Qos^QY)Or~3rLrF{(lP9y7J{>a|
z)4>|?%~)#6FDkldO~f<=WD-F?NyK$<X(H<A&Y1|tbP~buG$Q80LlZ%_g9u?o(@zqy
z04`0$Ep#g)s2ij>k!^s8F?+S58JK28FNBAth;9c(V)%o8lA?OJG(}74Ruoa|NKuq+
z_=7RCSLy12Q2d3tNIdrN2L)S`MYn@2(elwxlC=shO;(U@MOObUA7g?nA72?QAA{0b
zzP0es^w8~~N3?wOlk}{IOVbmkThZf%JH@7KEgxfMXOl1(iNJ38BKXks(49#S{Ukjt
zaA|rTqC01L7_%387?eiOW_W0N=yuQ}S{(XGdLDsG)AK0ZiXOHYDgI;|{9sJ9IBM`i
zwm38B_b0U&?+{ce^IjUTkHIUg0sJmJG<WFE<PQBLcfJpo=Fa1E=gb|(6pB7yY3(sX
z(#UxN9-17wGs&T!BxfsJnw+QT&Y2v>Op&vSU#=Sd+gh{TJ+#7GlS6kVIrNj{JOh^|
zXD8h`lf#(Vdn<;dapxEC(B#maNe=xaIeXyJ<ouHEoXKI#lqkz_JSoZyNh4<;JTy6U
zXOcrdNzSj~(&X%?J7;nj6XdKAFEwx`$zezuId8y2lS6kVIrNj{9D+-e^ETZ%lf#%G
z=T7lb<Ve|JNE$hZ;i1W)JChvxNpjwYOOw+{ch2N6CdgSOUaF$YL05*Pk#ig#njE?_
z$)TSlhjx-Chn7<A<S-`42?7-=`eMFZv-xk^UUto*wWY}sCRl3rN3_cHljP74)8x<;
z%bgs?1UdIga^x8BEJ2Po?rd^s&S`Rljh8_V{UkZG^fWoN^>QbNF+q-C3kE?1cP0yR
zwDqXS>3bY6d?algZ@;IvalH8e{5b5zKIb==WvmUr_#@aLY-SM7l^-xBz4%{(MtEi$
zMkO=G>=3~@W+x*Q$Ov^JLNBwm!Dgq8T@4eaR~vf)w*CPlo{xiH{n*zWuGlsce^1xo
zPg>fFiNSNNxOt!(ho1z+MfYlgwlEe2B<1r$HGTUTIT>rM!X8UGNJ_pz_z0IAB_?#`
zobUC^^JuaxcQ1GAq2Pd=n^om-Vwz-r5^4JIMw(?&G2xrMFect+yP=ZxBm88N?OW^<
z*bU|wzTS-T%szbG3P7YRAC_mI{0?HYk)S&9%sKzyep`w>>DLz9{$kmp8WGXU<kT8~
z<o{80=+_x~#C(Ij$mk4z)Uwwz@`L5pTtsXy75;0hUuo;7vBD7RVpFTA(XuUf&0G5P
zD7AwEH)C0Yus*NAUYJ@Mx?HzWya5vH;pgcqA2CNm#>H^I_I!ICzfV*&@y9^*INF~8
zHC9(@y|I&?!j6GlabD|9=ErK?g1EZAh${@0q=?f~jMy<duOD(mf17Rpf)_U!tF|<4
zk-JTQ)7yJMeOeYaVAByV8q+%yBE>raf)&jRm{Gjv@~xNKmf`Mbhr1f#bx;F(+9nq-
zcHwVPNy~M`cW^3oa&Z+{dlxnXtm?U}ZqD+0JyjZLpGqCZ)z0x4SNl}ayK<`aVk#SP
z9ID{nZ?@KR-7(5LR_lSQIJWWo0EWvS+xQEpLU1vOdUqU4=8Lc|#T(oBhV(CtP36_s
z1q?>&rO8>FQS{48u&!Q{faSPm&s^&R<D0Dritis_?yRY^1Eai;ocChiSity14lfVR
z@r*nO${A#AaYb6!4v)_8c6gfHgfN=l0)d1>_!zLIl(~}vdOa>J4n%{+<L1o)QPcEB
zgn-pv_CZt6cK~O6iRWwT*di8^F2@z61-$ea%lC`t6G>Y1vd*hVA<M?YKL7@+JxeB=
zdNvbzDwmT|xeRacuSE`x<|wp{cu(H4_J9B0_r8Zi-Eoa+N2H1Db{mn|NFW+%dIDdG
z&%rI%7&EDWtVckBS{I$<1rt0qY6&uq5A_DiahfcS9KW&$JgMpMZ02zpq5nzz0Ez~Z
zFt#+Y9H9w)I@+`cuH+|?eXfo7Bpw6^ij@VBxDW2VhfvFKy~q}89{@Yz?w~jN;IA1c
zZ*KxX?w!GfX}p_9j+cVt0bb4R;F_Q|P<EK*YIdG?f0<yKZV|l8SEXf2$wA^M)-P)O
zvgAj}lCKW^O;t%~L<W+Q<RJJM+gjD_vLaDG*^qdgD<M5i16X1LlhHz>N?|i1RKajJ
zCU%E>7tDX1Uo*VXNglD0KRN`00klv&ukV>t47THgchgKVTlY`~dBjNNv%!!!bQlLy
z*bBm0HpZ60I3v71Iv*nYV0G~GF;5uG4n#pKknX~ohWR~p8Y#;Xm;*T254c$tqDXOV
zFmBPxvz}k`1Ez<g#&JL_@6|00jR;>?T$)G7<RIl2n|9Rfx(esXM}(s7-q*7~gHvk~
zgOGa^FSfn3O?LO(1y+I4vi5E8CN^L#=+!F#Vnp5nFRmVnwjy*+29le^A@+=htw^{@
z6uCCGq2_t*%YFR}tY*C=MCbrgNn8lj8HlDO*Jt>IlFKuErY9F<_}rDO&G1>59Gl@Y
zGkHOV&kad`hEKhgLSFiq*o67Z41ncM*-R_}fa>LBi;czi`ev8y9=V|qodJem(W<_V
zxBgAQ_sk4G9hU8VUO%v3>nA)L&Xe)GCj-B!zHi4{KaT$GG58&#zwV-MRLX!ADSi~*
z)*hTp8Sl(n*2?A%?KJH&TvFG-%gh^#taeLvpeO}w%4rP^$I&qI-c73=l0Fu<_(70x
zH$dec>?0})UZZg&OH=i&&Qq}q$L~B6FWc>gY<I_7hT)b*A8=Og38L-ucWifuUfKKG
z<Ua0bE61fkM&x<OxxRnXItHu(Qic<kA<tWeg*OCTp;0^?KhOFN>MLuSRUj^C@2T@y
z?~z;{$Wc`JvJrWc5rKd*UkXgc#DtFdY;|sO+d$Xn%ywTbVIN0O_!@WUosL0nSgm`b
zQ@zPl%OSI5?M0u;_5c^X`$<V~sP$~}B0Im}T{%e`f(8jm+Jw#F%|r;nwiYBlE*{!w
zY#C&|ibj7xbgBof_n{xV5w{rC5-mvEKwSR(Ikb~Fv$P-~&H(4#+KKDYHQGrDM+dUx
z4wdm-Zkv5yK|T;SfQ#;%e}PUT(F6|_O+eLJ<={zydmj#=Ma;%sl`jYX)9SQd1K;Kr
z7bQQDN~0~$)q`R)<Gx7~W)=i53XjhV9Wl1JL3ly5#zS(02a~VZ5%wMuUb~ZREQVvi
zp1_T*J*01D5eheyA0C`n`7)a!7Ev($G<Mv-aZO$jM?0}VLhpqKd!WMlA%~Pa>m_OW
z9kDArr8qRg+M`uR>nNmjZ}K%;PUU!vu-}{B4x@K>)(4^NZAdA5YY`3!Sqh|l*YoXE
z@Eq<sgfB$4dfFnzLUqQQOfG48sQ3ZArPg;{?4jZqzG6=l2Y|chs&w6Na`9ROatmG+
z;CrqTxuf1r)eeEs8LMJX6-NM5x4eFi-6-03+WQbqYfyd&kKgRZrM3ToYK&6G_$jfs
z^G^@l;NHndPy`pmd`~pRi5l3Z_+r=wJGXdDY_m`;=N6a7HVf4fay~%mlI6fD!F*<`
z7c>^2-W5d$qR#}o3wo|v?w*J02l^we!AbxdTfERujOOn#k)3-FiPIXZ(3gK39^nJs
z;dmbUcbp~;H9xTpenN(@Pj?)cI~LzkWdtXx>ZrSn!><~@vGAFzvmL-uS#6_(#bcVf
zh4T3DFA&d>_(f<*n7FtPgo$4WkIckt;HL#RS{|*&&F0-W_c!z@mAB<Cm{#+czmQiI
zQouUQo*LJY<C=2ZPi>uxqj}mrO#vj|KDkM--fZ`5-i(v{i=fPm099F71&~N<=vQX@
zaU7Bcc2+)XH2)iG?DL3V^8;iocL_esLH^5;UKJUV!H6AY?=>BhS}+?j2NQma&om~m
zQOsn*05Bmsj+uX}dv;}KTIT1^U+%`OAF0fDrZSHsj(8ut7nv_{WFC5(*?q(PwNT!g
z-)H*qy$K-!;VzT{RhZ&#PhLwN8UkNp2-C*x$6Fqdim(ykv_bR%D#M9mfF+jm@nOaH
zIIwU`-Pp3rfoKe)IWqBSu+I7o<&$NYmJRDY^O=B^Q%0JOJq#L*hm(qu9jMIAj}R)6
zAKs2ZGNA6YaI2~>@fv)hmqlktS$a40$xK<YH@;Z!B0@pbg;UX_B*h9^+C42bNG!Pw
z3SkIc#)C@RHzK@~Mr!=-oksJQ@RcAlPbsNIL;&%fB*Ydyz_^4LDg~L&8{x_HR8~j9
zM=?E>+pFQZHv!{g3G1(&RlDwrdV7M%jz%9v)1v~2j4g&}E&hWEI$Mi>hliBa7DF@@
z&kzEsIO|ijYI>sQMTa4E?kC@eOrcFHx_&tV=g4-+hzvty5plT-<iIAX8!L>5ov4Xs
ze2=*01jSKQ*=|J613S>h6{0yRCTFapsFBg};FO*8d?2@8(#@U`*#J01FO(KVA$GCi
z9$MDk`Eztit!A4C`2ff?+7kd475{nbNYIb+FOJm;y8>yh`Kq<M@>#+PvQXOjC~Xse
z%U#zaPo%u6#AvRi(5Kqls!R@!vpJY*Z|lg1@f1(i_O4LB6{RaBq_W1t*b#C%37kpJ
zI6b)T04^nkw8@QT&TGYw<t^KBqCp-Utc>xbmu94B@?bKd7Zk=}Px<m{n1;ICcLOsN
zE}D{C;Ec}pLhDNW5YCES@?x6N<j5!o9~+Q%nj|iQM`o+pMBZNoT&l}Bp_=Pn`@|08
zga(rpAat1{$>3#9!B5T-)}asG%kjII2iDVDPbvLXK%;vrfsThye&`-BBSSVTL-o!)
z)n~9UdA~Ek64VxGGDW({PV08zIgX8XX4h*KH6^Q^SWc?r&LA5NfvD(8Az*Ds$85dK
zu6Y<XHY6@T3v$su82ztxG*)xe?7RxiOyQbpfcYVkV5!T!6D?ZLe%+>h7oz20ff4x^
zcsPqT@pE`Ib<w<MQy7^pK81;2sgYcRHDqZ>#=|2G$qj@!!uBFjPn8?zEF@>zZE;5T
z2R;(O>O#2}L`U$D&-X<4a}D}S3^9#;uzfOz_@IU1>KZ@-t`L{uMv_oZq8QLRk9ONA
zYj3I>41P6yusgh6bb{vr+?V_b&`*p`*Nx00iMv6U&d|V2uH<EM<&*Hx(AQ-`Ps@Z}
z<beK4CiIswp}*sR-j@me%S`CsIiN?P0ZuE3PrxIsATEc8rn^29dSNE?ItTRkGNHen
z3C-K#H15Nh&~Il#4?qcO=z9ib(0vy?(&*j@kJH(h8O_@>DcqJx;mhziy=i_kGtIxt
zO!G&lJ<YY5X$CXXjGgv0Z^%q@c4nGOPkWk|WTtshW}4TY_B01)ra2%pP1eZMD?@K&
zwg~$(TZArnoZd8fy<}Ru^0Uk|*({yjG{2FV=GQaRq(1&3(`1i<&UFp?5Upe+e$a{D
z<HPAo3Y}O`s4VQnZKsTGx|2HNl+jT!voqTYb>Y-9JI#sio>N9w??iXODWjX|ME7FH
zsb*HJJJcl`Ic0QW_l8Dy#fL|ip&#n*l%{uDb$t*XY2E2R!{b91f7UcZcRA7v-j$Zt
z#t)yCs#iAwgDtrO|8S~>x!j5F$@d*IG#q9PoeS$gjoM<0hE|&xShF3j^+Q~)uRzm2
zinso?;`{d*emX4MyU3S{n=O1sKjGQpoQ&Vv4E*0#-@n9LKc_NZ<0le1UsKTAd`*EI
zGtV+#Qz+(Z1diV4Yy3IQ*KlBu^EF%Wwz@E0Qbfuy=8y4`kz%?A_px%i23KxdVy33R
zdcLQw2t!|(B-p{Z7aq?JgQO^Jo(8uQ;IMSWDo>uL?6I~%uIXl*Z))XBM&vQX2~XsF
z4Hlc6YrV+jCMV3-yohBJ5b>g@XEQ0mfKDJd#CkOukO;+G4eT3DSI-<Sp}?i>97-s!
z+!6Ycv1OpOSIpDYig}tJxnb|gd75+D25|s0Fb%UUe(PB)o>&9}$KsexATbZl&71p}
zpDAkIWi<af+x!fMh{Ozy-_6U%IYZNq8JZoKq1i2FXbO{siXEHf{EYuY&d+r9Ge1*!
z67w?!CpAAK<uYx4rWM8MoS(t@YHEE`q<AaBjQOp`aLfi6Wn6iKzd&r=f{IqTb`|C7
zi_I;bYkzqqheXlBe8p4=nw*|;3`v&Pap-S({q>4q^O*vB!AorR_hB*PTp~5j&y)63
zk&04FckC#>I<<@nf>40_K%enfWBSVM92APMjoVs<I#JQ8i)*u@r<^lHCNhOP2E08L
znCdB?gGnAeC~RZ*#~xk<IZCG~OGKRkJ7RBS`HbduK!`e83c|!h)sF=kc0T8kGcT+B
z7wGXTo_5z1=kPpfnXmcdC!(PeQHoVSq2pyB;5c?V0u+cJ*E20&%tc9hS_ikn$F_0e
zsY5Jf!d#;&zsKK(r=pE(847VGBsK&B2hNKcL_Cf2fU(F%6x()Kpy9s*O=o{-)@GtP
zF3|AbfyRTrtWRoiDT;S~IzdnJ&W?^v{C8mTXJV>N<!hil;mK-%18p1LzwP$V-?~Gj
z%))a#j{byWylM3*l&Vi0Jvp&Hp)l)+D^|O}@)SF&mIuoPQ&r1nOY>&RGbaOCzk06J
zm8)=heJoP!LK?ap0ygSMv6@iCst-ib+_QL=YaOZpUWKXUD&hcF&U0!3_hb4Uhc+7<
zH)Cic=6T9&og4KPn{iQXLFFyBXyURAZ;B+;_m7;UJewqnxFCi@YBuSRS8p{sFKcWu
z+6RzlH2)mUe{3V$hzy2n7AyX;y+~!|<KXXj7}Yj^o8r0^N@uZZi3Fon6ZVmF`P&dH
zNmveC_6aUO2`)QZyeNfSu@fCf0hVO;Pj*qJykb~b$*f~;o`+AT$*YMG&&UTTV8u*S
z-!JKAG>w_grZiR51s{quyDAm;Rh0y3oYhdIVM^y=-9RH}x7cfMWdohrj*0ep6aU>f
z<`we!<Oz+lvk?=Gb0!YaIB$}Tv&3;i%bba0Z6*%UGH;SCv&3;ivz&=zK_(7on=EnU
z)*!PT4PBVlAd42Q*FU>`Hs6-(xo>Z3M@^#|pp+eSsL|op9&>;9G#uM4=FE*Lhq20P
z^c0`91M9WWQj{IW45;VcOJnOiaQL8*dNCXy%#W_)UXp?d8+_KQYbv0IatTK8Y&d+;
z!AU=YqalBS$I|ajm<R5Mc8!G~4^O}vRC77X@h9)}^h_*!w=!-#0KF1dO~2LCGYWbz
z7l-&)PmOu5L|co{sc~#0+Ld1e<#a3HT*kF=o+DIkn2+L<O;*g)3=gUox(D!MS#GyG
zbbj(ec%m{EFs<cJ+3i0T?fR&fX%8^O0=dYU`K;R-4!UU^#%esss4=;-5{vwhPVffn
z6*GR^>?&%!0h9T+`pU4TDbQFGPvq60X8U>QZ)eQ+WUS!FQVBEs9@Fq&XZnrdo=wK^
z>o)nZnx(QW^j2jM(>Ec1Xk_vtt1Ee-)dd@21m-VpboO?zXYwq!8Ta6}`^qDsBkf=s
z$__Vt<4~8uV2*1S&I+f4gj+)zqC>IV#)TE5rAG6EtZAz2#)`O>d+==@9Yp@FF`}Mg
zS8EIUKC}r%$%-hti0AXw<pboR(#Wi%P%yDF56Z9EmWQQ7g@}kR9BB>>%~u%@USMuN
zZXP@yo8&?B2;4ZBf4;5g`rRL3ev7L$Fx1bf0VD|1W@r@nAXbovqU2e74`F#9P|^dm
zMTd}y-LpFK+&^V@jVUj|5a}*^>E59fu4|#;L}z=F*Rrdl$3T=^^d2v8_>>HIxNIf0
z;#{!{(`VLR*Iw|eTnZzm%*GaDiIi*3yz904h!q;Jpb9Z<`$M$hNpXvoRoU+0dLfqz
z`CEj5MHCODGe!sy(g33p>k-5}q^hI+Wjlx|^*HKhb-MDDw%>wl9J1}VFe2N5D~9>t
zw>?YQgkXiTmS_k)6a*Ld2KZdE=S0cz3at|`L7(L|fNv3(*xZP+z#3RAy7bzcHgFc1
z7vUm=HK$0YWBW&e9qZ@L4x@>1iC)R31^lwr5~W>2i3{DP<&%l6$Etf>4yhd?p3EI0
z5;TwnbWA3wppYy`J>++m{h#Qz_4(t`S}p(-QBz*b*Rb$?$X4nkf3;;U{hVt@d1mgP
zNwv4J``j2pusYFz*2?lo->ky6$jt)z1qeqIlzZWFWFkL$pF}!8eFuyx<gXEDswib4
zrxshC{$ef-O-dDWYOjqabFU3@DW#PAf-(bjQ9Ahh;pz*AO?#~`VxX+o3KCqe_$F!*
z8JF79q}e8doYf<BPGRqIpOY|uIJwV7-un`12ft5)JU`NxJPYRcE5N~3Cl<nq(wj>$
z^dgrhh+a-|iHwOy^XoWTJkg%t*3>5SEiO6xC!sp-;3k?)v{sWIYabTb{4Mpz=2mJ|
z!I80t|A=0%V}~0@U01xYIb1coBzV@O$~~b!Slg3%6)!Zkt8i*t#^l}BZe!bZL!cvk
z$LtCio8}{O{u7)maP_=tZqKXSzB+BmbGYiflHd@5FEJXhmD`QTXYdA+@ouxL-iT0J
zGrR6GntkvV7z}d<{G^4*_(p_7IK=U8;w?gpWUdeZ0{=x4|8sU&>VgCjew7UWcZ4(j
zf5tn!e!LrLK59o<lS(i6Hv&F+U*-1T7YJA%S}oID3jQEJi)8q1(sQ)7W%(B2=gaVG
z5P$qumWD)fN%9i-lx}4&Dbf!WC5zy5F4oMCcZcKOsc7wpzh*qrnjBcUJv0R46H1%P
z40pFC-vEvne!l|Ka`|zMYJYJ49C2wpOds;c<>&H-IxTxMA$v`fJ?LJ;qD>UNs70Ym
zVvLPndk<B-fF91+yxFY!a!GKI;Fq;My8g=^v;8|}4+Lu=qUS#$^dK!*XM?{2Udhwd
z0AYDvfp;{BsNE2!ogm8WM$vMquo9<V!cP?v;~Npm7t?$<(M52FJPG_tp8lU5HeJP5
z>5mumCVq}^rq44aO^}X6zo(-ZrU|El|DuE^zX(sYk?{3K^A|My>XkAHk^W)<pIn$l
zzC^f^uWHCnm5?uiEmWQ?htEYqz63o`_D8}8S|yl6@%kYC8U{zTgbk*Ib>4RStvgNx
zfQY@m1jPLuT+HS7Ob)R7bAWNC#q@Ric39h!db7`&{lVZ)8h--m`n)%KjeW^M@Dmfn
z*74ww=s;W9RE>+RsoNJKqGs-~eY0LqW>L5~pJm5M{v&<T=*iTVY<)DFaY60#`)C=^
zjnVkC6?t_jlejdA<4#&(=XRjjT5oh7N6sx=WR<e4vEv}WZP5J!U~qI^VXpx9amdR?
z2xAkY2e?fQ$v9^Kh-XzHZH?$!j_K+MzPkA|4LK_U<7A#CZ)by5W^Ab~tJqa_zcFQ}
zu`O;*tqR|Fi7ObwWS_thaNzLAW);J(r26cba|qvesVjI_^gftGc50lTFyj~|bpoPG
z=GAARmC+gwQkP?<z>RqVj<8@$WgCj4V=8t}4Q`u?vje7<B!{$5Ed`HV(Wzr_noMaK
zPm^I{p|2v79o6LotuFVNtrY;R9xFhr$1xQfoHwm~S(wB{(fI+hYY0Xmylc1vyNn6~
z#s@GKKv!}C^b4Qab=WYu)z#W<?lw5Ktw&4%QwU~}Y_mNNqdKL)G=`WFtp@p=bG<DD
zvDwwew%UtmP2xQoZy(;5U_Pvrb6qrx{mbo%3bTDOLb<b)&=)J{OT|)9e-?O{*`@BF
z0m^`<N?V!o(;lvIDAVI~w|uf1vbHI}4*PMmZ*|s7)^2AVHnvQ`o{^c}hUhsQWdT2@
zMRo;;Vv8WhAqGchd6EMwb|t+SUg+{*2O@5iDtIu&t-_c=2#!IOYUUDC@U<wi%MeR<
zG1-egxg2I7*y4%Sdd$xJ(51;`#<uOam&w?aWLFvywVRuG+Xv<6xjf0giOq5YiwDQz
zbmj-EP;{PHftwMUIi6~4smaICPQLM^dkMMz;G(>iJ9>;K;ap-(`XfhS@>|@X>_Kb~
z6bS)Ck+JDMnHck?67#t7jBVJ8X+)MH48w0m<aXh}R*gD15+(T<Ul^3vHZ>nRncD=w
zg={r2V-hKWgL(ce0GG5+b?3Vh7r@yz$OG_v4L(SLH-87o63msC*bP64)duTP$wmql
z*1a0slc1H{HYndo#1st<d?X_B4ZtM6X#+A_g4&}Rkb@`K&9{LhcwEUZW{}yX;S33P
zW8!>4B=ce;8xAj#_3;v@T;wM|c}WI!%&LI<H#m?euIrlW&T}OPwhzk7cX@2to@O++
zfWcb6A#jDUx<8sn^F#Ns%pa_Ha87>9@Rob>&DP_pI3uGu1cg9j%XByDzBnA<!8x9m
zIc}CVHiPm4JRcf4Ps=P1$It{Je^C4EA6%OE;IsiP)ACxD4oK{WCn<C1CAi*45-FJY
z6Hp~JIBTc1_wPRFYJMT~hvr?HhVLkBu>y_<V?70%WFOiTztMar7-{WEd<QSZo!NZn
zyOSj%0XM70QDg#^pb@zWj6~%~T!uG;JtFv52$r=Dw*`R`)SJX_6@@Mj5H$Y;5KcDM
zuw;02f;|eA_%=X@(#;5w7M<dMgD|GJM-d2FxHd)DA`QlIa)R;LwaBiJu{?kisa!U8
z#(*GSrqaj<3^q66%SqJt5jP`V!mnbu^GVeaFjDY=wT{W%j5k+hO#@#;ek<<c_U1Ov
zKv$xjJfG#YYCUZpw=1y~pRq~c(#<_B7?g$PimPL}skPgB+1N6o<y`AGW!-4nJ!MDC
zZjUkZWpjHzjGX<(7FeMz=K-{U!hsQ5zuD!s)$Pr?h@at+;A??@S`VZwKemcphL<U%
zVCll3>jx;RmLb+FW$#kz%ARNAIP(LuEq?-f+R$$(lld)1tgai#x+${N*2{zxh%heR
zj^i3y+=$<09WL7`Vz-;E`7jp_vMIw3IBQSk5hulBEey_qLF0$s-GhF<7}q_C?`ruy
zIXO~(vj<1`*yJ$zT`IrFa5HRbS%xpM6o(e*{(`F2JP4G9!q|%6<@lY2-vRsv!~YWe
z?tq(*qdz%m{fk@C(Csl7cGvsorGGg!z+UyQXl-eR`Ze|>)vqf)PW9`GzYz7SoLxH<
zstUZRevM66zudOsB-F3V6!hf^`ie~T%ZC4W)i1k#;Cv)h8K=61BZy>ciSr|NA`CS%
zbK-(M`@0yv;SoHJnLnxeH+L}4LD~qiT}C~piW^;3fcsq88wFQkj$|CGsSP7lV5eMT
z`U~3hI5Y?Wp{&|#wfrX<L1y<K*YFsX07vj^ylg%3<xP&zF8H_CcwzJ3A6-?*TV<Di
z1Qak$UXg1}<)yOTB<~dV;=6sSPo_*e%kHXTv%w+95;U$0C?`)utZG^WVkv@S#s?gk
zTU^dzdUED^92SsjpW2#x#MF;A%j6*eYpBL}o-kX-fsWX0AjE=|$;H)mP-6@2#a*1l
zG`37iv(~D^U$_LLNhqw4P1vM>BFfH$D5G+@oTr$WC-+CuZ_&6qC}O)WDN0d;M3b|k
zQ%gIh!XEjAeUhc0yE=bF22Cwb`~dIR>{2N4I9Fp#azKA4Rib+fue;P`M5v3}8LBBh
z^$d+n&kzp6$;?o4b!_Sw=!QJ2p^VA9O8Gx^3}Wgd8w7F9iy<e`sbf2)j>T-go$<lQ
z<?QIxs^rYr?6ES(<8sNdk2dku(k3poZQ?-UF(ezCN_*CqLD4t|MYM2tz_yL9DK?L~
z*9=497K@2oRLJD#nvNdEyuM+Upn-sXTwuLy?#^!l`Sj#vCovB%WO7YSYan1@n!DX-
z0s;`Z0>mq(So*$3Nbqfry)e)pn>`uA$99(HF3cri?iS)rb62zoMKDu~oaXK{gwot4
z^u@-ud!?z1v*pqO(a;8LJ9n(zTnn?;o?KP>qHF;}*J)Egn!2S~CPAyRPJ#;T+5YVI
z*L=IKH*5C_VeJOBwL3&wyE8JaU1{c4(d7F-Y?HZ^dM=hkV0$fUc>(oV?v+Ecf+3kg
z%y0xR$9>n)1s?NQe(1_X6T*ybQwoILy9fwQuzM2^u@zb6*_%WRBT~mN-#?niVD@sq
zb+pz8;Tjm7=e6b>$FNJy`_{n3XaLy;>J(fI4HGuP&V&{!Pxd9b?*WJ!J1o@S+wd?w
z6@0yhzgNNUQ1C8Kf*TBN>rTNxPbnh)|AGU9cNZnTk_GC!8j98+sklpF&2uHVlP*^9
zO>AT6F^^&i?Lz>G)%xPE=b1YWTd#=KCRl}dAfKZE6)%{_e2o{G#l^=fUNHQw=z{m7
zYdfRUj^ieV_pP-aYns<u;KK?Mv(;Z&P#pR-RAmp&>WR>ljrqQgS*Fwz9sA{I)n=>e
z%huS<lPX^fy^}~F)51>5OV$fR$dz1!WPS0Yc|QZ0dLUn+u=ZIm{@n-1gguBPXyU}G
z{xKG1h2*4`nBlQH6E7pCFp~0<WrFqY<UqcqfwvTt8C!&)U5PW;l2-^&VcE?@kkg2&
z2Mxlq(`%Xi30mJYl47fRXeOO&y^CS6Az(oJ<Ohx;T~~t3uW-DZ)d;U9>GcOtYWa#|
zQ;$byA17PQcCWQ#v-K(t6`E*`=O|d&tJYqyo?BvFWxLIzLt{7iVpZFWnMW(zLod<j
zw$6(Bia&^p)<+!g1iM!ZpxF$Ltv!yCA^z9`uT@nHd+fF7C#{jzOJ&{Gd+}tRFs;j8
zF}sJx)^Lr9H&zriX8vYEQE})+k%SRr;dX*n?vy@eW0nr<6>A5MqI6q(%Jx}tP)h;D
zWe{fP(AejMIuP?bZp@71#Fbx0v6LrY97*D>+-)>-FM+CnNVf<%_CsyKWCa?sO?!X^
z6*6;dXo^@j@)HD#n)SGFpp?G_N8&25)E-7rb>rI-A~Z*oXkOxM0mHEyjG`zQc8#L`
z{0AHu9+@u$!<D=-6WQNtKsAnXNrDrT5-NpG%mJ}FvXRiEEw21*qb=uw8r{S)(L4+{
z1b>5-NJfNMaMohtU-4!ThYf-|M9@E}AdWF9QYYH69}^&~z>K{K@6>RCEwY5haKSw&
z0XpSy0XyN8q=)X4Lj`u6#0?5s4i#L1FC-Pb0?8yV$8s!mKmqh+Xl`lzitlRqP2*R5
zJB(lPoo4)AuN5I*;uQ=^h|a_1V)=3D9?!y=jNcphz6y<X1iv5P_ac4^@zampzkF!@
z{xGne(eG{b02an+)$cjHaO(Q~y=Y||+H@cKeRNXVXaLmvv43sq{S|-C>OF`%qu$%b
zVM@K{a0(T64yRDP=WvQcy|;%)%yz2x98Mwh<xubCP>NRXZNNVZ_1-!Dm^mM<)=>?_
za>3NZ^k>w>^jR2fwlXdU&^@C)7j4frL&<HoeW6of;t@}~r`SFpJj)C<7b2cCeWUxJ
z&$3r!%Kb_<MNT@OwtaJ@lgmWxhy7Xh^`km<{Z3yOsu7%y`09R$oXYdhfnR@V^!};K
z_fMVvnexK%ggBB)E&|u@kFGvvy-z?lzG=4!$oBG2Egz?v{>Po)k2}5W{K5E*F4I0l
zs`vgOOZ+T&7(Z)%aR#<d-YHUm$7)e5H^ShM_4chh<o8x?{LP=@rH}5p<XeSvnMq&a
zhx-ZVV${CkbAYC=@PfX>MScYJie3&(^o5UePkn_S>L>jDe!{uPwlDm?KEiv^H?qh>
zmL>}M&prMbdFn;p|GMO<m;U`vY6s|6hVq&VeSa#w_6&Vk2-5?5??c*Ax$^JhwnP7t
z<S)B^p&M`g&e9nmlfCx`I-Y+2rN!6786CA)H$A4K77MMf>ZmPrhbDE@`rJVbXcTA#
zC?ku}+HpFB(Sp08n7&nGAH)#c7Of4WJbdoZkCRU+f%)k8`PZADv7&rRMfnto^6`uE
zv4?3+D4(hn_puZM<x`&WC=%sUobvF0+~xDvksr-;{r*d<|C(<7K0|-!Z8)?^cWjRK
z>O}icP421wLFr%qw8eNE{G)NoM^!QItHXH?xc_02*NT_D8}G`i+<ot8-t=-1(J`YQ
zo8+%-Ga^657nhmYr?g>ZU4rwpxCEf=T~2_@s6ku@gD-Eass*!?SRvz0U6jX!8gV3=
zpVuSY4HJti7xHiQS#h51he>jt#8K5~ScgYr_XG~&FihT>hXdO~el;&1H7qahT4?oD
zeh@lh;Xb#KfRHJ9a72u~f-L6QCKl~^5`P4dZMAE0Gk_e$o+PF-+hL*cWHqy@*k!cL
zU^2Lpqq57W-F-DwqWiZ&Et+Uddbg<?U^toNVkXl)a?Ls6pSCb2?o*uPZ+n1lck(=(
zv_VfUN^+jG5e19$KxEAKxP{y2LjKARf^}F@ppG1w&NKhYy0Fo=@fz!;`0w*-A?!SG
zq~J-$I9AcK8Rw1s4CjsfjOUGP#d#xJ{aD9P*^To?#uoFq5hM9YE1o<L%d+EwL*jf9
zEDec^^F?6iSkpXuoZmW(;!M7)&NlIw2RdU_4`bay%=0Cj{lUe0v7#@VJNy+dSnn!!
zBmK!=J#6@WUq$*~NBUp)o7=HbD!_#&uOlbo;yM&7w#76r#I$l^nVwsgGU(6`GxnQf
zZy7eoQ0VqTa=@v|uGPyR2ma`=vS+#U3ky=L7vb=^k2W0zb5RJ-p%7xXaS2j!*-lYj
zdyU#>MR{$N<rT-iYfOL!r<t82Azl78Q^VV2d0o@CQ4|)|KNKf##Hz+m#XLU+tS|mn
z9^_{}F2&H3vRoWu&GRJYBDsoPM3XGOT2gR5De$O+Nz@Wm00g+sG#&-E*w`kB9`Kgh
zc;{gu7PV}`aETh%Synw9z115%D|&+mD?6UWqC6a(!jo5yUblLf)t=y73XX&P7rwAd
z1nV{m@)6bAUe<|fvD#z3oD3ng!uX-QYNS<Y?(f8_Kv7oKX1!e2PHIS6%ww9Zhv6#t
z;8)<Bui{s_aPda@eq%ob>>G!T;l4+)x9!ox=8n!vfQ8-wf`UpQ2c<!Mer9y)ao#pm
zd)#b0Ub#DT7+C=2*5!aLwXXG8U-UNb3XZ~oHN`<(=E(Gm^tuCoa!{Ko%0deyLj8g>
zQdW>z=loH6dxg`^whW98vz|2%cF(|WDBQ)dbqFFDQ?^HM^izEHtR7jmecSKB=(08(
z@A*JGLa|;5tw8Xa=yY##JkEl_zODhVi*c*$eQp%`^{L~nuq`7rG&<97?R4#I8R*`f
zybtXZc3-&LlR+K@<lTk?hkCAl6HUXKPr6$HX&+={)R>)TZNtH`ILPQ-wvno|eLW%n
ze5>7_oWu+wE{0PZ;p7396p5q2<=)MzTIV&NcU$FF8!9ahD#am&C!EyB`gCG@-(mg(
zQpY+SuH5M`H_H#f05c*#{#%5sl^?H*j}`LcUGcF{esC{ghdEb%427_FnA7CPC&fpV
z{3sJ2<?@5;f;!A%`N5r99cH2YxIujQ<Ofd*)Az^^lQ+j(`e2rZ<LKI=rjU27sjF;6
zD#7=t`6!TR@D7!!$Y>G7#W<-TnZ?MbL{K;_NM<-<h@fCv&_aA+RghZ*ElmrO%!s^)
zhAnE|k`^Rc6ZszzRF@Vc85Mb11Wis0l5C6Y5<%nAf+Q0oKNCS?(t;#QBjVCmGmsV}
z865d15sOQ@Qry4?<sycl#Mkk6Mt)GjXXGc4CL|{*KiTxj*pG`)y`SC>5liwM3H_LD
z@8dYz;E0Y|Y?(ch+8v*KQ@3pzQobGfLR$NOI`L;~KLrbLn1)ypnNfY{?R79r&bOrK
zJw5o40G{mi6P-iU6~)a|SUj6Q!;7{01Ea&Ell?u=-g<C-C0ox_{OsdNdi>#J&%^q#
z_E##s6BeHIfwH&q7x!GddCk!Fy}!kVjVbHA#*{fYqt%afw$NOyy=Ct<E;PQj-PrO1
zzCC7FUgId}ah|fhG0#=*?da?s8{T1~U=t!W-q8U0t~+#=wa2vwX|!P3G7XqI9^BmK
zInU+pw#t>HZr67KOHQZwomL+fG_~d<2qGjB!3JNC^~&A^)=Fb>JSj6KA2Fs(!y$V9
zvLjS+p<0yfZCqh|t<~59&HwA9ytJ$f%4z%n6;milo;h{bBdXMuK(!xggTxM9(p%OA
z<ROEK3pQHb=xfQdjv^O4liZ73w0p$qL6$$2jcAda3J0AIey6WL!A15PQb$S_;z-Eg
za-rAY!cP};O@I49a=>0`q)x7b%Ge_ggvNdADdj3U3|isk*Z_u85(`3=X4eIwo1pcy
zV`nx_jYNxle?`X!`_6x9eHj&)aPk5fBF^jcTf=xVAyzF1OQ4dqyBMcpm%Wm<&}jZU
z_*gr2gCg)%#`)?wfA4y5N=1^m+o;Kh%~xH{5R#DmJ}jy4LVvSY6cyU48#kr}0EF_8
zp*WW>{WLZcSZV*k;+1zCql^;2LvxtYZ3%G_{KkF;MChC6T%wE(G`;ftI?eOz$@7~l
zIs{kDxcg}m)ATa)O~%_i`YC;|eVFD{k8#~jYiF`JdtnT<<5aX(ypTGnvM_X$E{WcG
zIStrPl9%ToN;)r@g}(TCW7?66g*XC#E$;BEx;QjoD%>kzM4Z((cex(DFYZ=o?p_7%
z25-exfIZNkE8EWB+gNACKX?TPC!TdNjw$I)o<E&pp+lZS!IUgRR^2YhYUATJ=n@oR
za&Paf{oKj3wlKxoljG;@4u0OyKR>xzzAt_jYJQHSw2n{C$S!%kux&$%ZP>0dEUf@=
zIk;{Fkk_8%&ffX=`IF~g=^6f!Y0rqwBOfRK?sdrD^8V$I7n}DYe>f9&Z*(B$K}Vwp
zt;Fb4sKV^LAT-OC8_^)Lb?k98i0B3_>I)bpDF|L*!)7*!ck2cbBWs;#Zl6^RL%T6$
zZ}O$yMX`=tJ-Hr-X0NlAbkyhc@wfE;y_Eg?TxV-on9;unH-K~8*6P8au>gDpV@vPx
z?u39~+^3ECyJSaQ9Qv$Likn9+2#!jY$tsMy0+J)4k`!742_`sJ9K@9xs#Y4Mal1n=
z4J~?)hb$Gnf}iG`-6z|Ve(aK$A-8r&-|K(vc!{x27CHD+eF);=(&wM0^Jm-%{3*)D
zpRrE<{J&d@xjPmEV;TGz+dF@X9Q+yE3xCFi7KuZs0{;)JKY>5?q}xgI$Bx%4fBKc5
z+nw^`%is^TX@a|yW-vsmh$;OLtSS_&D$HP2AEM-Qu&Q@aS}a)Q2dlLHyTe)E3eq&Z
z+j6aM_TXKDBT&86w>0||3s5^Yaupl~W4O1uV<VT$;e&^bbZq4MI(*cKk2mB8r#?D1
za%CPuZWSND;0MgnjlYCLTd7a;FoooBX^)!i?>F^)7n}|jbWFYmHuvwNo@+E@@<7MN
z#}Ed5oX+Uj_=x<NAU;~;$8>(wt_KXy9_^@I1y_S`)x)()xE8?mMd7**u8qP~4cC{2
zYb;#<AY7$z@noQm+9J4qBwT*DcnV<$##T9tZ!cp^4Gw6bj&9^BPMUhnvdDiytB!8u
zd6%gm$-v0dBB&GSQ$doQ;sEgI#<$agBy%JGEMo0X3lgkGju4dih6pEDQ&=VIBL69Z
zIQp6jl8lV-)`;jvj>XzRWNYN#gg<LT${$RQ{5}0^*QPwd@5pB1xgzBW)<>F!=fadH
zN+I$E;W;<ui2{kN6rR&ko+z70z3@z%gEt~K3D2~7cq1}Pc&5$88<A^;r`=w#9F69&
z@Jx)yAF}0q9PR6w`cQkOKKyU259Jk?T|V}TE3X<?x#*6?^$kmECS5yuO6}SOqc2`n
zw`}^|vs@*sTq|5FR=8Z(xk|2E;!450N-imf$F;7DT#Hw(Sg|PBaQhwW?p}0PL)GG?
ziyE&PKR(?zuw>D)6%F-);L5<_m3OZWHii}l14~vm1~Ox>Vf5RBCm<+Yz3dAOw+91_
z4NF#+^?@z8Zq*5tIQ(*q>7XLF$Sdm`7T+7xEKt$M1elpIfxGTl9VCNfuAGp)lLHPl
zxRxwhvAV%^cj&HFp}QB`*cF2_yn9EL0a%sFTt-OmC`#_Sw50yhl69_<Y2!;~jxV{v
zRkA2haz~(~KA?R9B{#WBrpwR(#3s1xu7=z1Y|vEqfx8CCTqToSC3nb3t3v%px@+a#
z4eOj-=^g(Kp}XrBt#i#>DPD6!4XgP%zoGta>8fp9Mh}1y#svTdy5=qoxe(;KVNuXE
zW6|BAMUB9*sB!U9SIw%%Wh>xb=c)<a8Co55-O#Wq*l^b!4UMkZi-RlqMg&)F!ySx3
zaMuhVpAlNY2!tk_Yu3tpU6UIYJDDbUS%OaLF8nUVkM4Shd!6#T3Ga)Qo3PqVSjL%#
z-+1Mo>2Tkm{H8nnGQ$H3W|ewp;(|9ue&nOyUghV<8_JIu2o2yp5x<Y(VY)gUrp<H%
z_*LT<#!nCkfQ4}G$Im91?vr>tfbH)$0O<?>ob%UToLs|k2CM4<;Qp|`NnlhizrOHa
z1RPm^pzEU3`0I^^%aDH7AJV?;H2yNvXBnM&&T!y=BL{-WbR&Kt{2CMkmf*bzKPZE)
z)%a=u61dq1_10e@sNX(G!w`Q!!QbI<*E`&q{gLkH*tZ4nBR%XN`OuwfUq|>-{L1LS
zLwwBt-S{zm(#HOm5BtoO_+<;53xCZw@+mX!eE5-f^k;m!v%wM1Qv8UEWswc0R)sCY
zJ2M^9Pnubl8b>x5okxJB<%{3WyztveyAIbh^4m!dznwJjdj@`_iTP%_bTe<7uZ&NA
zu<W(`Wx|m6+HW!3OrK8;e$-hQkNlvV^3m`*4bq_V%(VDuKgQ8;#7DS0)tme$FZnQE
zjLY=sM>p#L>86`B@R^MtX(SBgB{O`M^1m1F-f&D-VZ_rLjFYbb6XifyrpHI~K-1;q
z6~lG@SuT9^x8|Xf7YujipWn`W^4pm&emnEPZ{j0OeCqJiZsBp}?+gddaNrCF&T!zb
zo&%kjqdMK0{3vktMdM$4dVS^nOxPI?oZ-M34xADPYVNLYT)C`1P+C!b#TA#8Up8(`
z;EqMBF<G?o?m*+%aaUb6_Nw}_z~U8)?!Gf{Z$sniW$>@K>XPzHE(??{4F*@O9)Ibj
zizJRq?p(R@&J_)-SB4rFH(auK<z1HsSFT)v36o`aU%Fz&y?0%_s&VD=224HGS1uV>
zxnyj8#g$iHd3pU6nAd8!VsUxp*vc!GTz<#p<qeA)F0a4r@+&XHU_gP&ocjycyWH!&
z?oawWo))*uRRn+j_<WXsHN(8kd6R|?m}=(V0+;~2xYdSF1^;yTw2dA!zX1>~S24U7
zG7Qh{{L?VC8wYFxRNjpOOpHskFdPpT*4l8>72HO^UF#d*MG$d5K^Q!o{kLH?&aX(E
zr2W?n$I~1A$7OJz^asETKD6UbNUJtQ|1<^n6DORe|6fz|2M``qu(U&MoKrS>Hs$Bl
z5MwF4A5}2_k>`L>`0~G=XCox+GYZxM&ux6yN#5lLJ%Ftd%p>o(UV{(qbsJWcSssg3
zaG5xHJs6*x2jEYao5neQfCd%iF<HU(hjYbA;CwVkoUJE;^X(jQ7UYYp=alzq1>0ZV
zc@jOJT=@A&jyRt>37m&=#ObFD;hB-G+%HNm_bLV3U*79a0_Wx&af-`ebD)#5{D#8$
zt!#O^B9$k?`U!()0%b+Zy=q(X2e97Bx<uG21^Wd?(6GABFSS8M9a*YiPvq5N8<03R
zE4W<h{Zk6IiTTs%>pHqLz1|<{HU0E@?;ps_V2+jWnK&y_yedX;m4ZDnPw6=872JYs
zIBU{zZq5<s){~&~jT~|M1~KQk<$auj?Jw^OPXgydIpTam!R5lw{W;?FdS%{Avz5{C
z^fDT&VEfDaEhmAqB}bf(=ZLcu+4;4CeI#3+E=lEyu-?Hk|3PQH*Zu8<>GgiBg8eT0
zQe8(h?8EM~zHy;~jk5jCguO2xuyS6eMZx`THk|jRaFW(1a!jAF`xWfJW=ns6dcJ%^
z5CKmvG>lWQ)3fnwOiDjtJ5jG-IiFzjK<XT~YG#qvhZNk!*>LVo@qjqR83cIuhjYKe
zDQ-g2{MT*do^+f(9wm?i&anz^Xf`_kBOT|$9C5ZNIH7lC()oA_rzn2~`yh$cu)5#5
zS94U#)qVv#B3m8!Ipt3(*2L@c5uwYK3*K=GHW$403N~vQJeQug%?fq{3CYac-+)}%
z{kj4OeoDbEaKf%h!3g<RFkj17uWn6G+c%VmAXC}Ob$+@`k5jOJ!w8yADbouyQ<?rk
z1;=|XZ8$A|e@LZInSLlooKGmYMcHt6rQ_V6BTnxy5P;{(Y&icr9p_jD+h5*qQE<F8
z_Jq8@lEO(owJ6w)Btr93%XFjWsFdj^6l^ZCxBn#Y`V1!Sa^-?|oPwR7EpNX~&s)8M
z<vmfEdCPaSLFB_`1sl)SUVn%6HKl((rC>)=zscZPeh>S%6zm}d`?G9#zm<-+zz=+Q
z7G%RaYG4}PY6W|vvwhKh;gzXAmiG7x1uIC=^nMQL5XQVeq{3rxXXYnw9pKa$0AaT(
z*l%WowbEhVP_XN=wE+v$%gR5T2wkop@=w#K<?x^EtP6Up6l`NQyf>xeU8-QepAGLf
z((yi`U}t5+dqoN_+l*EPyUB@HwnOX*gaD9VhZJ0^7auxbx*ZznwHZd71tW;e<yy}_
z4J&clEimD#6r5O7kPc^CKZL8#5#K`!?u#d;yIkjm_?}R3X?B;SZ<!PB*E!Hf-gwSt
zf>_s(jo&wr->G_3u3+04LFZY^$N#lKh0S-1g6)q#ksRT^ui)->rY-YLJ<2ZYUn)3W
za-B(I{-pH$=mEfrEbT(xevMVu&oOGS@cwLdeMx#<U!Y)ntLtl3_}83y(R^$|x{kX3
zFADatY_Jcd!|qYAxzzRJ3igND@MhHY(sKyZi;QH{^|=Z*m%1KSu({Or?<?5;>iRDg
zTryi-pPpXVUFXVt^;g$R6<mL^T$dxhwF<7ky8f7g>#wfw%#pss3ht3?bz>9jhLrWf
z^CVw#sppdwY=692kt5tA3a+nu&UWxA1-Cj|UY4Zt@`i%*XQ|`)!_wOWKaab@Q<M$%
zgOm=;cC$*szRn1`EmVC<-Y?SY<x&M}Ibn5u&(PT)QLvtDG`yZpL#u-QofEI7VJ&Ew
zF6RwM@7oIYx7lF#09H2hV&0?hd;-BH;-AjjG$9@$d|W@_3sm@LoblO8<D0tB+J3?x
z?I(Pz3Kv<@^j)9AzfXntMt`RY7fpqZKRXq_@Dn85<?1bboC@y^|AKzP*Q)T|`15E#
z;amF&->1TR<4>mw?~VS#Pxh1le!>^1@NE5`DF1%KA64PK@n>s4;rsdt?^NLdW>c5{
z&5rUXk$8IJ&o~v{n|v(jCw#36?~Ol?_7lEUh4;pvef@-Y_7h(CDVhHOUs?DwPKEcz
zp9LzsH~y^cC;U+rF4T6N{>)VQZ0#eQZQVW<{w*i{y1k77k3+xmj3kiDl?!b7Nx<Hc
zBP@%eMZpSFP3QNzRDQp!!bMl6!{?;JclHy0NQL*tPwyzf0@wd%?``0%8p5~X*|XN(
zyF;nAB2-ShqzILikL09Oh>9YFQu?4Micl&_A*AmpeIi65<Rd~7LR5qhLKH$2!h2ma
z_d08>X`jwHkN^8Tzu)^l^E>-obFKSc_uO;OteLfDt+jV9IpbMJ<Rytw$5QAHFNN-c
z66!LZ>qWPyc<vN=QSq#jZ{tyv{8*6}Wxw+t<c#NFk(VT%^F;SW>{oa!27USdcwb&!
z3f)~L)MY&D)WAQaqUzg5<VD4+cQNuY#n_*}2RY-pQslGgWN>^0F>;Rg?V?+fc;;tm
zP^psWwk@G9<2hJ#i;Cw|krx%uC3}#Y@lWKhc_=K1N3h;8E?oDfFTR;Xlrpyp0^P{7
z9koP$IS2DV9@y$%2_4X$IPzShz37_hHPFQ~GxVvi$R5%;?6iuX*G?7P#$H5M+S98L
zU$0v(x=o^X1KoVuwf^y%VVme~LB6mq!Lu`8*zuIUR-rP|`_b})Ixh(0N8Og9dwj0=
z3=ZQ%-TtDR%w_kxcnqeC?trLnP_OgjF<2?O#l?U=Y!}_TeUPAyg1Y?@){ScUhu|Ml
zH~tHB?V3ybAh5LAM)a<a>IKJN;cA$@wj3zBN9Ss<s`2)kCAzbtz6LRv$b0<O=1S2U
z5{*?*rz65Tnfi<FfT+ztcW>GZ?+NACW`&e0iLY%%_xY&Zz}Lq@Uk8fbs9e4_4t?dZ
zIZJeNohPy`%S1kdP6q80#67YOOj}z;H`j4adD%m01mCU6e}S#Y`gA>!KNpn;Wz8-O
zo4LO0EV@ONHCW^Zg0dpd)=d?8gJ@Z%-(6bR<}ZlO^r%kYPiv^j^(^DGS#;;+(&cqu
z<l46qcR(u2w?-l_$~VTcb1^msm%zsKVr;xn0vj8Pu@SrwSyWxPd#$>R24a}Pzo4yx
ze*F*EJ#Fx)+g@~U;SP?j9$2Vq?jH;h-CenKzmMzAFNN;fQs|nO+);i>e5iLA9W9w|
z=Thj7EQRi(Qs{0dg>IR{OJ27|rO@qK3f-}#&|Ojr-A$#?tx&JzacEi!-QK0pomdLp
zWu?&FS_<7NN0dAcElZ)>zZAODOQE~66uR3>p__kX$>Y$r6uN^;p*v4>Z_0x&&Y0?@
zc|RjOzg;c5gXp%S+e0)tPVX#5`L&Lsv678@?MtCMq!haIOQE~A6uPQ@$?I0H6uO;D
zp*yk^x{FGoyP*`iWy}dc$=bM4DRjG*LU(K_beEJucT*{JD>N*5e`s0?-QK0pomdLp
zWujX#*R|B2@q1faMR#c#)X^Cmyea9zafIVTm7{GO`tfAe)jg+bOt+=zn)fhV-6ujH
zYQa>0(Va!}j;@{nv)D|%siOB(F1`6yFCVgHqGy^ouot;bpw1@IIT887GI6cZPinz+
zi!zNURLWhq$j7!?B0GT!K^b^o<z|l$W?6sRh|Z{}j+`S0r@f~BqSqy=XZ-Ch-bnpL
z@4cv=*bDq-(<~Fc*nOUkHa?VZ6nT@V9n`%qRPwp)82+>02~k)#DQ75j*cWPvj!J+8
z^%otzsnBiHZtX?)3>tNH3#?zXIau^6<g&RvZgZaKw$Ej=g|*4pt`fboa_OBCmc3o{
z9?PZ2XOZOI0Bz<srjk+@@t<2CS$}7J+KAo{xsF5g{B*dcFi><K$z^j|yza9^_vWas
zU4LQcGZR0{UnzPEqIy9aO$s#aTFG|N-78n@M})fhu$6B*PSNkUv5&PBom|(;l=l$1
zxf}^%*c0VIM&Cz@d@}O8#rV9?AGXIL(e0H>mrtHzJ8iBPy-B(BShig6=R@uvOC{XT
z=fA)|6XX8IU_Lh25uKL1>F_4IEwioY%+3*4Z&WxA(!ar?oAWu0Yp5IcmwBRFTzqJE
zwdj_l-n&G1Pxa0}jup1w@e+?sSnrmivm;l%*Tn1HUvyv1r8_IEcRtFTF1kgH?d)62
zM8}-+1#QQt^dO^rqsW;r^k4c(Ep9uW|FB-ef5HC2dhnUnPCi6+L@zeB*mo9Br51JC
zicV~tvN~LiGX1i@=-dVU!t#RS^kisBzoc)|MR!Fm-Dj<DZ1d%%u(_=SHW{lbX0lUi
zpJ>^q*)r+du_8Y*S3A~VJKFen6}`$)JCSj7xXAfKsJq4E$}k@J5HAqj)=^s~zBiik
zsIyvhT19otv3z}@&UVo`b2lB$7BKBpr74BzU;G#Ji=dqfpT@LvbxYCxAeZhNrdVUM
zZz*g}ErHFdC~ukQ71d4~MSfzA_<Hrjb}C~|j^uslpuSw;M;Yv6bwvJtE<1hV$9PB4
zotrBjk+GL{hl}o<T)J1I{Kz=HKy<rBb?sbe-lS$cR*Q}~)eY)_^POHW#eTa@<gw#D
zXjfV5rkyIyScv@&%EI=K*g00@d$Pm&brrpmjNM~Jw<Kft647l*Cxd#LScK#92GMDk
z<D5i)9LAP$DRUAH;d|(EwQo<`PpDU4^m0DSuX*pr9uu8KFP)=o&s>+-@nN{=nM>86
z9*8qn`B~m9k?$$aY_FBY*x6hHJNd9vp#cAo+VWrEkMxgW;!~pn3Y8koe~yl}!;F3Y
zxqu4x`_y*Rll!Zz<H!PPDRn3Rx%Nhwkg9x$78Kwg(w^qS)dfaHWeI_;mbZB4!wloJ
zt$+emq`X3NE8m|G?0>fPf&14NdHJY3a@@2RdD*Bu^4ws5kynYzBiAeA_F$i}S|svY
zqWeqx@D&LT7d-CPi(W~NJO5-FQ)(Xn1$7R_gvh-i+O03Tr$q1FiLO_k_wMX~Mcpo<
z`;6Y*t~V{b&q>`eqI*^%hi=nwd}Rz4i|#b!ck`FegJUz>YJ=$IY75%gCGw|`-_4F(
zV^gnI3o1C@0TIMUuD|jjZ!3C5^-tEbzv$eE{BC9PqBMH`Bf7EY1%g;lw_^=$E-!`6
zZKC_W-o1S9HEWZxtI`txkcv7Ejum;X*mD2Q#mEPX++3yveNL{+YhnMXBCnCl&q|@6
z%S12N@t6-g8%4gSHt|n^B2sZ}!dTZYp)O<4MRbdb;SiA*6~pPp$X^h7t{9sBFY=;d
zvrFVf#fI&WZ%!nYik&|N--mE?I4`ylJ^o%!VZRRa%sVvpJgUFw6&GukJzaG3bM=9J
z!#=QF^ook}CXp8vXWyJq7yYbjEs^JnGyQBS^4hulJRtP5ujm!k9%Dtmr}kJRI(upl
z_S5yES6rOgPy9Cchg4MjYKgq4__ZuX-b3WM;>Yqwiab|b>OekE<in9K>|4S3dqp^A
zQg?L;by@B%(JiXpRZnGsMfZ!Q#mKve++2c3#yGmn@`s50U=|X{FR=5M>Hi|<PgNDl
zgYmz1c<e0~z1wr?nePs;^Wj#}E2_R_PopD6*SFpt<n*_#$oYfwyZPJE`pbF`6un&a
zW*bfv`EcZ2JKAaQWhK;Qxm!iI$oiko0{2k=V&rW_UQ~Pc6?v|DGk#+O`#IvL|F!*s
z@mVZ-4Rh#uRl{>7)_J4o7FB0^qF;2K^V`A*Qm$j4J{O3*b}nBI2;023=vAk&ps(|!
z9F%s(h&+|Uj{YO8`y$aRN!>SyZc%mLCGxUSpCae#Rm~!P(RFVs^5W{=L-dNO`$&;5
zi24zXZ+s6?VzfZ??#ZRcXMC}pZN66YimLZ^kr!3(N@iiG=z2F2dF*;ESTh_M`q4%7
zimLYzk<ZUnpL@f4&lA0z>jGoK@>YpnQT5&`@}lZpwjCWQy599fekYZJKAfZ89YwFG
zdJhcB$<@~*$N6;8D@k8pDY`|~eREJ|)b~hVFJl&Mi>`Yekr&t3+lyXNb?-0o;*RsF
zqF0i-FBjdS>b^<jMYX%%fk7#{?zKc-T;1D>Uaq=x-0my#;VdlZKf!Sxnb$ZTP8HpI
zbDdM(Y0oKXb6F{DZWZ16xoqAWo~Kqiiw+ijKG;a)Ma8pYG4g>TFKV8gDDqtMq?!Lj
zKAcYOA&%7DSVCQnn`O_Y!J_M3Pvk|_yKOP@z9KKG-eW~xRJ|97d^nvfrrzsIsLOi$
z9ci%Wde;(pQT1+FjJ$`)i>miXk>{#+KKz;|@&<G=sJB_`wa-FRXJrX=ww6GrLMIlo
z=QYMgqGOg)0)MzTiv1YRjv_a=ngTh$jRUfLd<KgAWaQ)Zu}ajLDmvzrHLzjo9Nz1B
zp#*j|7GuY>|2cF-<$U*z@>(LVK&8N!$h&zhi`l=&9`@%kI#T4bqxOSw(Rp`iQ3-YF
z_Xg3e7PWhB*bciyZia}UUiN-UOKQ=#{ByZ;5o@FLP1fsJUR%+P^<&<@hb$kTz9K&l
z`NBBb^2`b{b;jk=!Md0})7mlPpXfBmb^h=}=o9U26x|-k7nVtT5x;zMbHRBACeqhf
zW*yP-bCvl^yv&ZGYo^^Gt}HY149Z~9S(C$_XTC$v1~wmM&lBAXkdM_t?$1$YrRWrO
zys&+?icVwX3+>oPm`wYWH4UTGq^KPC4z!$G=VN<)(Rn$lW1fZ5OV~oSu)U+`bcyPi
zc*dV`8X|h;J7j}689nc3&c=)Y?aeEJJ+{#*(d%3WB(N8(7nCVe*hsXwvjjG&mw!I~
zA=OUeUtrVv_@N*1v5n~Msm}DVzv!(l7qJ)kIJ{iU$LS@oNgtPs-kZqBebgM4O-G{M
z))LsGkCjYE!*3(y>YMwA*VnXJAi5)vFDzT?(<2g}-X+u<S3<odCDhwkLcKDk;gl+_
z9`#G8*SQ3GjP-EQ8<it|n%5^XzEXFA=#I>#%RAtrTNU#4qFXnri!taTsL|F=k?)B1
z>);)@jY(*Q&mYygkVfz<h=+f{F%anf5FDv?eY?HrK2te|?u5!QyF*0xpXm8`VE5Cw
z-T9*1JeLpk;`iOwitemjb?e8v*+4N4_Q5`-#z*Z2$D{N7Y`u%P1Acca$8n+mEHta~
zq0?D(%`g+h%#0iQ3}~9Ub%^N1?imDSR}7Cc`Z-^8`CFZZZ6Lb(m3Y}}MYkzb3w2G|
z_IWnb{-Se8E_)w^_NZIyVj5EFj~u$*`p{2~2kk|7LsZv1qvI_NG--3N=#`}3&lBC^
z`aR2EExNZMUs!jE(;%sqslVve$kpzj$NOHbt~91pjTHU`Z5g!FU2)y^U8#wABbVLJ
z;<`h+8dWtsS3f;8-cRR??vc5CC>PgVE4s1oDGQFP+Hqa`Vz2XC0ztoW-l445&H6i!
z;KV^k?vv+3+*x$@bj>oP7#+6LtP++<-Bl&jrGGn%DVsV~FTp>gJ=LM01Ufy6(V_2S
zM5iRNU0jU4eAruG0-asO=x`p%?~Z>+hw@+0=9ou<-@qsk`JQ6bqXar*iqWAj3ySe&
zRS9ftE5=5J9<1n|+q{wJG@@b<6EnW{=FqP4vAMJ86g393K0`$3FyssEAhs973gy#9
zUetBx3nI@%_m}G=?!TcJ`L1H*RWGGsd><_T1@(;BZ(5AJOEK~xA}^|b(~H^vg<|9z
zijnUsMqafiE53*N??IlA{kn*JPyJ-L=<KPV%oClW`pI&U7Zt}%A}^{P{a&nP(e<oV
zjJ#zr@*c&=M;0TWC-S1|x4fABHx(oIdlysxV&pB0k@whxycUWcDe{SQBRI}v4h}Bh
z>OizW^rq*~)6QJIz7)EC9~vzF9Du&o7v17~?OZ~e`LH=sboVre%rAk?suJjID@KQP
ztaKUvA>GP<L3`M9_rfc(e2AKgUQvG2R@V~R8dCyW3rc8fZ3%4cETOIZ%TWoWqUx9r
zS<4dW^e%zU*b?Y0DuK@066owKflk%FtofenUQmoq73|+bbPl4ipg&=r=P^B8WW#hs
z7F=8W8(cBjYwHD~dw4G03h`@;^+B159Cq_UyX>QWKm0=~h}wmJ`n~Wvkb3o?N1fvI
zIzn%_uT*SZIk=`c#hfCUb;2Rg+gOYq&tvAX+@!NU3;#GaQobB={%+7|$VcNF$TvaG
zbUgn>;?LJh^0CRkf`Xjiab(^r$cL<s=(MC_V8e_F;q&%wMQ3hQC#d&bC`{ffWV;U*
z-KDv7ABgMD6Wv_vae4)GBWpyfMYlzcc6YzedY9<t`tD`@e%x-IE9t0G&2rg&Hm=*T
z6uQGj_tac=BmIvtTOhhsbLl=G_hEf0bp8IOYN~E7yH0%Ti*CZhK0!YSj@N?lxT3#Z
zN~p`yaTq9cVU@xsjSpSP6WkkER`UA*nRqT#5g(q@?TZifx#ULNA0Li8%pWMo<D{D8
z4+iE-J`1cV`9pxUB~SnBO8#(QJ;@&lJWBGM6B<gM=eWm6z6tPH$@7>yLGmX8n@PR^
z*j(~0fIP0~Z!3ISOa4?Kk7;gii_aO7ZwG8Id5$r>)k~dD`0$n%^Ssr;wKwLu1l&dP
zT=wG954U&6r-$Tuip<kQZtsH+r$^>FjB@y3o?VJf%KTOMTrK%Qz-uHw7<irJZvYOF
z{Efh2k{<!QN%A9sqa;5XI7aff0dJT59l$#!KMr`e<R<`m9!7sA<1<C_(}4F#emZc5
z<YxkBNq!D+uH^3rJ|Ow|z=tIN2ylVq9|JCw{NunUB)=H=l;ocQE|L6mz~?2;G44gl
zF9W_T`B#C<CBFjry5!#gzA5=tz_%s;E^xKv-v_Rd{5s$Vl3x$}Nb;WmH%R_7;OCP6
z0{ErmzXpCI`OU!ZB)<i?Rq{Uqf0F#qz+WW49r&B%cK~-v{!idvlK&g{kL1}<34Xvm
z{Nueu=J_m8TJm{7zL$+ZRTlrsNxnRg@5<v(W$<rb$yWyMC;2MC10;VCkmDr&RCWA2
zSn@T1S;^ND<a0fTN}gjN*O>9A>fzrJl0OPqU-En=iO=NXPaT7QjU|69@Hokz0BkCG
z&KW1+Q-Du%*~a;)rQ}-yTT7nv0N(}0pK6PLXGp#su)XBZ0-i1TPQY^{-x+wG<Szhr
zk^Du#izUxzbGd$xKh*>OE|omz*4~o840yTZ`w3nN>@WGNfLBX?5bzqw4+dT*`5S;k
zB!44tnB+$QZ<72-;3&zD2J&}jZ^h>}*)|q<hve@9j+6X&-~`D}0#26vRNyqp-wT{B
z`TKw~B|jTDNAmN4_e=gkAb-ydf9hfUdqnb&0w0t7BH-hae-gM@@=pVwk^J+(7bO28
z@FmH=D)^e<>w<3xz9sm!;JbqF39b=bC-|Y@M}nUSek%C6;1_~l34Sg3t>AZpTLga)
z{7LX<!CwV`6Xd(@_%ruJh<^$HTkv1OgtmH~U{a9pMRLD9!Mz3fn`+$7_bV$%J_FoW
z@|A)6NuIxzc7Ws$609b8upr+bqP?1ehXDDW2DjA#)|EW3De6i7NZ?VDZy?C;zvMp0
z2=aSI$&VA{?}av%d^6xll5Y+?S@Qgy+*2gqTJTiC(*@5E<U6ah-vM}*<U0a8N&Z}5
zXUU%ryg>373SKPOO|Uz#hva(!d*jmwpUY(16~HScKLB`@<oSDugCsu~c%9^L01m-t
zC_XpJw&B1LlD`=^Qu4O|M@#-z;BAt>6L^>8?*@*S{6yd+d?w>FMYc@?-Xr<xz!{RC
z37jSQIl#I2%){q?+4dli&pR@f4+|~;J}UWzf{zP630y4sr-4jMfY0Ld96ry>wxz%q
z@p%cKWwPxR;H&s7$LBTK_BwDSK5yXjrfgdUd>fy4@Of9Zy$5_BpEdZb#fScW1pHX?
z8-Slm{&V0)$$ts_O7dR=zmfcA;CGVW0_1NW)8>!BpCtb?@E6H%2mU7c9l)KE{}cF^
z<o^cpUN!9~56BO*K>k(-^C@6j@_E3$BwrR-PV(h}{4EmdXMp=kzA|t>$yWg$Ao+uU
z{5=xtR|g&}dEUFsO1>8G5Xm13tRwlufQL)|2;h;DuMgyJ9?|B}z($fk9(aP}PXsoT
zJfG2NF8LO~mXdD;Y%Tdyfu~8nE$|G<w*$79{8_-WCEp2nj^sN7&y)NGz%G)%2zasN
zy8$ned=KEIlJ5oN?@O~TmjN%Ad_Uk7lJ5`X_b5~6YT!W0Ujw{W^49^cm;6}Z9g=?m
zxK#4INK5boJ7)mTlzc}Ze*=!&F93Ft{B6M7C4UF-PRVn<;%>=L0P;6lx$k7)6v<Bm
z-Xr<xz!{RC37jSQIl#G+zaRL3<mUq)lKdmU1(JUZxKQ#>0vAjEY2Y)Ge-`+h<oO%R
zOC|pjaGB&^0lq5v*MKV|zY_R{<lh3WlKeZscP0Ox;2Obof*%TgB>0Kor-Gjgej)gk
z;MaoR3VtWJMeqmUkCNX8{8{q90=G;4cfp;4e+upr{6~-%=xiq~=nJL<%LwizSXOW!
zLH@op_s;<Lm3(F3ev+>OJV5dX0jo-$zj1i5<oO&zR`Rughe-ZVU>(UH20UEyM*#WU
z0L!fpY#{lgfsG{J7}!Me#{rL*Jb&Z*M9H57ERg)kz!s7}1=vdRZGfjr{&Zkl$)5>q
zC;1M*vn1aU*h%u|0{NSZ^z(e+1(LrIc#-700=r4RJFti3djfk&z7Oy+$@d2iko?ua
zfs(%lc&+5G170urA;6)M9|jyQ`I~?@OMVpa7RiqR-YWUqfnz0qC-5%G-whlu`H8?u
zlAi*cD*1bW_ey?-;7q~Ug7*tPDEN@zBZ3PB7YjZuxJ2+d!50Ky6kI0wir{j=6@n`T
z-xORW_>SOe!S@9(N@L8%hwa!6c!}hD056q%FJN!UUk1Ef^8J8UNWMRCfaI?R4wU>g
zz-uLc9q@X|4*?F9{4n5f$=?LLS@NTRw@7{r@K(v+4&?8T)8{*ZcS-(k;CRVT1WuCt
z6yQ|J-vhi?@-u+<Nq!b^w&dpm=Sltn;DeHX2>7t%7XTlX{6gR&$v**nQu0p$pO*X*
z;Ioo{9{7UfUj)7+`ImvONPao+HOapYTq*hAfWJ$AC-4t^+;lM)+zJyW!$|VX>SegW
zQ|Jhh<e8PsaD%7z4heD|zGdpkGozczM+xK=9G-D_Wry$Y@B<xQ)!_#_JnQg79M09z
zFnQ|mkRa!&BOT6_(lB|7tEFM`RFjY(=LKI%CR;tlmD4bJsvsoDd8&oOTRHqxhqrZj
zJBOd;@J<fztOju55{W$_q2{KxUY}6;$m8_ba6n=5%nEEF#Xc8>1UXN2b$EA&_jGt4
zhxc{(l@7nk;e#B`RogImiYvEa^6WQb6mIa;h{8NGo|0h5R?mJjP@#@ze^ETbxuP2;
zPjOW@OrGM(ZkRl?x*O$O;SH0gxXK$QPjRI;OrDw(668E}zr(re8zxV2<u^>8;_7dh
zJp1dwg&RD@Rp2mriYvik^3-!`5f;JNS913ct`LXGQ_Iv{LlZpJHv6!Dg;H*NHA=x(
zIGiiUVe%ALk;CMvcSC}lr`}f+u~=6Id5-_Pm$%N*U#}WLKMz}T*M}?5Ve%ALpTp#-
zFG7Nxr@nId*AC~(beKHF)#)&KiYwG%@)TF8!{jNhRENn^T&)h1r?_GrCQotII!tIc
zhNUohX7##|!hfz{hY91o!?}_jCQp@jc*fzC9bU!Z2RXdD!)rLamczN?9VXA-`77Mu
znU(KCiuxVp=r?ruF%Cc0;U_q}nZpYl&eicSd5SCKVe-_e4(CdFm^{_a;b%F#lfyeZ
z`~rtx<nV3|@8R%X4(Ez`m^{_b;a4X9#qm@Cm3({>YLRoiU*+fza`<3}-{5czK9Pj+
z+u<V}K02{^tlc3WK!5&05zGf1*}~+RRr^AU{=${}FnQ`OhmUvoB!^FR_`MFl&*8Hj
zKF{F~I-D!~Ve%AL`NQNXuJnh=Q(Wy2lc%`iA0|&NarpBNf6?K~9L~D~Ve%C35`@W9
zuREM~4Z`Fp-aQDDr+613Oc?JS&bta>@)YkbgvnFu9L~E9Ve%C3I)uqnpE#U%A;RP-
z-i-(o#(#(N?nIb8#k&+?^3=Bu=Ut01VLos;?_z|>Q$IPJcQwM~Dc;=(lc#=jIPZ3Z
z$+K^Q6mIa$-H$?w{?EH0Ve%C3hJ?ve2~L}Z3G<1=lMYWiJkR00dlDv3@h(c3FyA;l
z<M7H3uj2579A3@g2Rpom!)rSH5Qo=sIPb=U3D*-2Z{Tp=oe7g??$Sg#@79FLGk0yG
z`~*kNJ2+wTRC9;7ba-orpXzYl-3gPYc$X(kn6Dh(!QmYp&bvQh^3?ebztG_qJG`62
zyX)I9|M05R$7lERze^qcUJmc$@XH;3g~JCpe4xXxaX9Zhg$dUu4j=09;SRsq;k+Xi
zCd^-YBc@DVC3E84z5cg5`gc0~Zii2FIPYYI$y2<W6((H2IDDqVd1ot3p1H#n<qtY?
z-suXHr+CLJOrBck@W&m_yI^6$e5dnc>mScJa^4{e6Rvl3x7a213yyrL!(Y;~V)`#T
za^6`BlZQKO8)Nz_9Qo@Ge?xyBTVHw0k@JpRm^|E>%a7S#?a1GA_!|9P>=bLABmcnR
zyt5Z3Px0<vm@r>DoOk)cg!$3oyxSKh%!dx=UB58l`pDtD`xho$A32<N0mFp(&Ec5x
zA_?=E!+BRQOt?OBIPVUI3G<c1d6zIup5mRtFnNl13&Z3o-Z2c5XYLwCIqw{X$y2<0
z7$#5g4q})*#k+`M@)YkRhRIXBn;0e!cN9NEe+XCY-2QNk_Z`lsYhjmW_;9?rY*<2F
zf;_t^xrhB1A%DE^?=e1qk33hxC?5oVD9$RlQbqnR#;+^UDs_be3KQ1X9RGNiGfY@t
zb9jNndB-zMxE^yj?|g>IQ@r~bCd_XR=Uvb+d5U*J!{jO64Gk04&m7LXqG9qB?~I1Y
zQ@lGGCQtDWX_!27mo&<Gr!-8S;@#3PdFGC3l=H4>m^{Thr(weU<n4v_%rD&Jw*OE^
zf0)BZIQ(XZk8=2Ehu`XO-pvh@r|xw4IERmS_(X?KcK8&BPjmRa4xi!hnGT=r@VO4Z
z-{B8B{2_-w;_ycuzR=;1JN!w9KjrXe9R94sc?UgAo_f*Y%N+iS!<RdJg~L}m{7r|i
za`-zAU+wVs9lqA#A2@uy!#{TT28Vy<@Qn`t(&3vN{*A*oJN!F`fA6iqcv`=(3D)VU
zSYIuO@EI6S!&4mhc-`XI`@!KqIs9jb|LXAH9KOThe>nUvhwpOu-wyxB;r}{3!PET0
zg!$UxNr$H$p6Bqr9bV4i<sDwp;rlwgvY(IfvumM;>-4i|ul^BUm_^1@`}^C`zQYSQ
zuG4d&KQ6)xv&eYr0H?fz9A3@g2Rpom!)rSH5QiV?@VX8^+~G$!{78o%<?#9rZ{YBT
z4nNxAjU3+C;m11sc!xK2cr%9=IQ(RXw{Z9=4sY%7QyqS~!`nLiOoz8~czcI;aQImc
z@96MO4nN1?ogIF@!@D^ALWf`E@QWSZ&Ec0gyobXtb$CyQ_jY(6hhOIK%N^d=;a52P
zN{9D%_*D+S+Tnv7evQMgb@*V1U+?f696r?H!yG=`;UgS=lfy?ke3Zj)arkJ5k8${|
z4!_Oew>x~S!|!zXIEUZu@bM0x;P6QfpX~4{4xj4qX%4@~;rBXxy2EEU{62@zboeZX
z&vy76htGBRJcr-!@CO|Jpu^`o{2_-w?C?h%zQEy+I{Yz*FLd}Khd=J{CmjBy!xuaJ
zDThDp@Mj#p#Np36{5gj|@9-BKzSQ9_I{YPvFLU@S4u93*uQ_~$!(Vs!N{7GU@V6Yk
z%Hi)ge6_>hbNKrXU*qs~4*$U6>mB~F!#{EO28Vy@@XsB-(cxb@e3Qe!arkC`CC=|=
z6`sVo=jY!$`dc0Tqr<m3{1=CBcld7(|J~s`9KO@xe>!}Z!~gc*!ukzUC43TUpV$*<
zIC<xzAce_O+TmXESG;(|eXHQJ`~FEsKb?F8`n>B~VD#PROY$83y&YaIc{t9`7hzwU
z-1aE%=vPdx#d_Crl-B|~nDr{O=Q7z_DR=*Uo&762e1C^marglaKhWV-9bVnx`N=tG
z4<G*WNjb)IF`w^>@O6k^Q}BF|PXX@&&L`uj|0e3o_|_8M9P#4&Wr4kSaecyg1oHW~
z{@e^+LG;^#?~L%@;7=K>?*;Oy;Jiy0@Q2|a@1h0#E%<Y6gx>+)Cc;rnVe(Ygsedhp
zn{WS&=+{Zsg@2u4FCSZ3-|ykiVDO+mzr!Ei)d>1y8Supsz6}0w)jja{SHz2};6eW%
zh<I&_@N(!cJ`RK+e%n!gK6nuCVc>1R1AnT6^PPympLOt$t6%~D0{$!l56b@={w#~|
zr@*-?639P;e;XtGV)_^1JJFuX5A{Ds`4uAkGWr|g`-0bx@MZ9?Ai`I|zxEMc7<^=~
z9__SGJ%=CZ@cPNG;9pnRD=Y2wCd%&{;c@#7lbuk%G~&-^ym-9E<&Ba*!d^XWtYzfx
zc-1($j`c5c|6`L~A#Y#g{>LZtAU^>6^U2oT%Ws-|8u1zkS;w5^H%q>V`0=i>t*`5U
zLGnAa?@H`jKj;1@Cuc)`JoeAMp5D@lZ>wZu#A`Kd*|bhCM|?I0bhq)XjkEu04nHGV
znf)uW|6}Z5__N6!FWWi$cW^l0&IyyJ&PkpQ``uALbYT<Uk6^!Ngg=4!^R8|nKL@;T
zgooCs)7i1lH-N(AsS6!`vBSGLyt~6Mb$Bm__i^~;4)5piD;++-;a59+ki)M{E<pdA
zig@tJ=iU3~b&mcG4j=09Vad<Y-}wG~aD0Z*V|+(A`Zqg#l*30moNr-;$y0n2D@=I)
z*5MNz&bP9{g!|VH=i6Cf!t=Kd=UZA~!t=Kd=i6Fg!t=Kd=UZE0!t+@Uf70Q6n=4G7
zde-55t1C>N;+tJz@)Y0h3KO2kayZ}e3KO2cayZ}i3X`Y!##fl|yp_ZG23VLp#W%si
zgy*ds&Nsut<SD)(7AD+3b~xV{3lpBVb@<l~=bL0<@)X}F3lr`yJDhKrg~?NV%PdTI
zzRKZz+bm3;;#+57!t=Ne=UZrD@)X}j3lqjDXMWNS=UZxF!t=TgFXM2&y%r`<@h!G6
z;e8E<S8zDrZVMCcS3A6l!}+FLm~g+^;WZr2x8A~p`_&HT+izjQ{c4BTcR1gK3zMh#
zHe8tSyp+TFR$Q1o#W&-^<SD)#7bZ{f4Y@FRif_q<$y0n&E=-={+j3#@6yKN&lc)IB
zT$nt?H|N5H=b;?VH|WCTsjd$1?(m)t=Noll^3>%H@8|IT4(FS9Ve%B;z6%rXA3L0H
z;f2Xld=oEBp5ohhVe%B;$P1IF_*Pz+JjFNj!i4+34(A(sVe%B;(hHNP_@-W%JjJ*5
z!sP9Ce)zZ}f5PEw9KP1!pF4b`!@qF&mk$5R;hP-(m&4uj*L|Jq?@A7@?C|{@zQ4n(
zIQ#&IAL#Id9A4Go)f`^k;RicB-{CbJo^^Olhu3oWAr7zY@IxJ5$KiDyewf1#cX&OA
zAK~yL9sY*H-*os}4qxT)w;leD!{2rIYKOn)@b?|Q#^GxnzRuwvIQ&D0uXp%I4*%HU
zpE!Jj!#{QSXAb||;Ts+Pg~Pve_*V|!<nXT@{*A-Gb@*n7f9LS;9lpikTOIy`!+&)6
zPY&Pa@Sh$2i^G3S_u&_{AsvcOR{Lt+-h~%;X3gOhUK~rR0E~X8XBMY7&3K_8iPzab
z9BKEz7~8TsPYpZ5@_P*5Th*HwXk(26`uq;0AkqG4ercN|@_oe~->l2(eN;JlCDQs^
zLH*jpD)Y_Gtj?$oqEEN8y0Utxo-N>6!}nJwia)0rexSNiUg_eKs99ZAH8~XmNi2U!
zf!)6h@)h-t)W8F*@Gw9|KjWoahZUfH&6s|fbjPo)KJS!e^}*_TdByP{Y|iSj-oJNQ
zIsbG21Kx@A$M`U`B+4)6Vu2*`qsCiuB_OM_s-e7sc0SHbv-%LV<$Wuk0ynez5p|1W
z|Bj=q|9tX1t1nQuKVtQJ8T}!tx8XOFwO>a)!H55lto_5)bq`z4H>I+ASZdexmRtQJ
z)rKvWTm1%Vjp(0g^lwW2RneAj^&6=!KSlMMsISGJW=4NhYWST|`^T#?KScFUR7b`1
z$E3K{$7Jmns4?GJZvAPYs);{*lPjxlPaU<w%B_AYb>}wAxiXT~r>dP<>o3<(v-*B@
zZcWQ?$H{+I&sQsFS^cU;erKv8zcdfY+H0%+`NeW;ubt{S+j6UacdE==mRtR^)Czfp
z(CT+m`-^^EV}D}mV>$k28~-}1p7M%X4VbB@=cM>udrWMWtiDLS`nsX!AN$YAPJdeH
z$j@=)_q-P0e}Eh>^f#lss;%Ezxjmk`t6SJ`NcQ;oJ@xa6QJ$9`zsc&4Fvmwvwcu{c
zZT<VG`=oujQkB(xRd7XN`}1NIoIwmU{dbN!E!JPJRMn-wa%Cv1uTs~=`sX0kO8Td@
zKUiHG>yJ066>>aT`HkxDJEH!LP*-iW+{#C)2C@D&TK%%w%5C|#sRa^0TfaNhFF#p%
z9pm3P)ga%-$M&zs)JQo)<dcS3{kXbwRkZvG>JsTscK^w0)SFTHG<BHtA1j}(&XNAY
z@43n9nd%~GFTN>~)z7E{$Jzb+1G4%#<;yFyM;Q6i!fy;1YUE$2OOCbvzHI!focR7Q
z%lRf<R)4L6Clsx{W$Mk3tbN`S$m&<sFo~y?uTZ@{wsO8Xl+|w(zVT+|tJD#)e-$Ht
zS5=UB+-CfFU$xv|_s^L6tux;@$}P74->Kgge|cq_)m0LIN&mL{uUE6BzIOjlRAwJ*
z&-(kBx>eebTPxr*sj;nZXXG>bD^*VVS0GPG|L$-6-K=iEixQ0E_+<4Kb=rr9s&kC|
zM>V#IwfDS<=Rt`M63_BRo=F5xP}}`~Ru%Y#n@D_<Cabrr6(cRT@*V0?kvBH-Kb1_6
zQvToSYI&u)xsj{H?QhxrZvkYrm$+@c<u)Fv#P8x?XA{5biKAt_u=;t4Z>2s~zieWB
zIlDjK6w2!IiH_G<Zs)(Qsr$!S&i{<(^A2AluPk>m?O7wSrH<7v56J3TiR!mn&Tf>|
zwG*i^md`M}Zeq<S%dxBpdA&r1i*0-#H}azrC$Qm>_-1QXH%!bC`2uXq>SGc=vSLVf
zzB)FscCqFB&aSNPl{lk|wKp1@v-*U@t*fnkSsC(Xi4VJ3xwYRZak}vHO?f>Mk1&HY
z1fQ&Kk!W;*<qT6+w@SPu+{#Z)te5g`F!HvE9T!@C+rQf-ZoVkG|5=I4Mb2i*>duLV
zU8C{~64j)9Ti!*9mqdPr(eIX6F6V>8O#ClP{Cy|{NH+fc65}P_ldvtTuS{IeKp@S+
z2jgv`Wi0-K63?Dt%eV0#oOoE;&&KD5#OVw)l8yh3iA!SfACWjo;$OkUe^KK1)2zOY
z|H#C(@0#7!78C!`iQ(<7d?FyL?@MfNXZh8JKbq*si66<vcWmNQ;Wi$3C3=f}D<7X2
zak|yF@t>5KC9izj_)ksLlls~H?@d$^xsCtq#3xceE1#EG(Z<@d{J}(T@z2Kp;Y62m
zR$kTA_sPWM_iX*X0%Y~miEHn+od0?J^px{GhBc#?B+iiIhxaVA`uRjf+5ZQ~v--uv
zL8AY?(O;JMVi+=#Xm3pwOE_&{yiSZcGRj{|%x-RZO(TCj@zJqS{zjrqgD8J1G4^Q7
zX*R3hPV~&T+}eLPF`oki67RQV^?M1wx}n0?B&O|exz%5nIP-`o|1fcNf#uepj}kMR
zMENI)6-Pz+r-{=VT5kRMJkjW2%dPz{64xJSx%KC(#0OQQ{Od$xiH|)VzD;Zqe=Pql
zu~#fUTM|uU@%bUqtG=~o{rxGiMf}Of=B)lX@pjCgUlSE$@%b&$uUgcf9f@80S#Hb!
zBk_2>DE}+5;Uvp#d4DH#EI$7x4vEDlp&yd=%g1h*5A?m#9yUHn{nY{1o{djhpA?Hv
zo~|zPie~@4^&06vmY368BtEl^yu5yp2Z|*2zuL!HV&xfquJ~hlW&MftC(Enoh51&W
z`)2h)dYi<H-6pH6>9*p(<p=9c%ph5RYUpXwewNqNOACxxS^J0Rtr9QG>*&hTewH7u
zr%C%+exx2M?PvXIpkI;xWXnHVSC{s){1`n#`jgdfq8m%REI&?nY##OJ1bwUYrx&pq
z^NoI5{IR^bK3?Kuc}u-tzTMy2Ypu_V#phK0RLq~#b!$3?WcAO`yQDu^-cHvpFk*>M
z2i>lT<+i+zdZ6?t%g@z2rTr{FUvH{z^{u@N_2IGjT&zb+f3orErvH7z>c8f(zTNft
z<t*O|kkOaw9eX9rhRe|*F+b~jU$b)lXBp=`VR;jCJ~B|}zhgQ7Q-1GfmNP6FeYqan
z)7pE;=wG3a_{z%ppZcrHTX|#S&j9_@q_}*^DOQf@NY&6Uqz;qoGs~BxPM>A<w*WHw
z8hxGAk8i$Y^<X_Z&+dP`sm~31=_0Fd{l7&wjIO6Zw4{gCPn!LQ>+<3szjHIIZ`K|2
z?Ed^u|A)o=Tb}wk#+Rk8UupIEByLvUsxwbo&Ntn&`fgoqq2;rUe4;Mv_%qCj|M6T{
zKpJBFnWmpuVfP<k_MfiDK5n_SKU0r<)N(#~nbmW2&r9w8qs;yf>LtfnZpXWa_19wG
zp8w%}V>w@7|H$fvx^YbZaa~c`_c<efQoknkv-(f#?>gD?4>j^7`hz}}vm4|3NMG8~
z^67>z)rWPm{?rGrsCBxl#E)8xccb3S;XCN?$?BK%H?qIA|B8M|<ktRj-8)wP>-zLq
z`ETe>XB%^}ez!^=*voRe|2z7lnEX9GKPF$Jubpr8H>cSDKG63bZT+u=%@y^hsm<qE
zo)2C_Uz8s6m(|||$m$LHZaIIk@^0yZ?NRyXdQf+}e<N(JsQ*ZP9NYg(UHvR8Z)xNW
z(&J<Mf33HjW92rUN2l}ujN0F<KiCoFTlBJ6{Etab-5Hhts5{5(9hdI%M^yf^{{8G|
zc}>!%{T`KX*W)@y<tL;o#LC~H>q@-pV7H2Tuk@EOfB)3)%X*=emrdXEYt;VVx*t!3
zkqYpsp?jpy;=_MPHr~qn?TV<pSNbp&m3!Xf{Viv_Yv{|;&2&_r@{a2lmG?{U_m43z
z_Vc{9c)pB@(@G6JCcST&=>BEB4%bBGx2I>MqVn?I#+dxhbmw$bp7FjO7~TKw^q0w~
zyt4Q20LwY-*U+=l?|4yp6>qfE-^%BvANZHv2Jtz_Ya#Ww@(0q-C8GOR_ulFowf|6h
z{NK_2Yj__?{5xWE4c$MzHWvR{Ubidl{#Jf<dO<AyhkC;rT6rbxUr`^Gt|s;2v|d9G
zNiU1F$6?<6(jHbmEIl>W9!GdRW5?fu^f9sHr@mJ{cKj_&{}Ag>M|+>je8$VDto}$p
zHWC?09FIm9SbxhPUqjDGJvG}34>#j`&s3+#`dtk@GxhCBp?*cJ(hXufk?t4ce){1U
zPo<xV*sG|M>0e_!oqnNZXupP@o$7ybl;5A4+#<>!Or6#|${$Ld7u$bjs$6XUH&aK)
z_Ft9yHdg<4Qq^Mf-y^B_V*4*l?TGEaIQ2-Z{HIf$V)j<2YDVf;L%*M@F~`RDCd|Vb
zeT?^|T;B~d@$Q~Fu7|BpKGZ7eZ&Dk1;3E;T`gre4887p}E9%XuslOqEWaTG%LuG#+
z{}uJF)bX+YUEtN0@y(96|D=A2?cc&{a;`0(<82MSBt0}Xezo!jM8?+|`uX(HvGMg(
zuS{fot)X8`{~nXK^=8H7FQ=c2jlb=@lOp454ZS@5P;C4?%ljxMe?5I=Z2axyE$nXn
zx8rO1^bwyjI{2<-Y|iL(@~~JuJA0iao>sqN`r8dwe~r<vnEZ0P<u<+-c;jN@<HU3a
zIlgM(d?cf<P4<h8mlt`HV&mbI^iuIB-{=ob?ud<_-Mm`YTK|tlu{HEP>9p7%o}~R@
z$tPmtX%DaNps4<g^wnaY>oplYD%mt<zn6F9WmccdLK)pH+3IS``<wEvNuL`Vk1z8c
z?_=eM82w(!cVzst`q!n8ijA-RyxU^q-A(Bhp55QZufLa(@!O7fqtXY(#_y}W?b3ev
z#-AtBqhjrKjW;9G|7+-{(kI6H?{(h46>NFf-JEaTDx9Z1S^a|d^{JHLw<Pe%=qBDF
z^{qa}GVmL`K2I63T8aTNqlbE*%K2@-s^r7GU&mYdaubgc-l_?f&jMuh&0gOQmeUO4
z@9opWa-NT6^l0x1+5betZ}n!2KPMP|r+2+v?~XEjoVQeX7sJPU^O-?<51)*l=rv)-
zMq)fOda^f9%5P%$6fY_A(+r>Hz4SRUOve9vy_V9xXJAuC&+wWrFjDgyM;SfS>+rPY
z?Tvi4clIL7&oX?jcT*e7A2a-Z?*@s-MTS4<y(#hi!Nm6=ukA{!&;J$h=`Z(#9zi~%
zAMqYLfD(L9G(H*qsQ0AE=~hNB^d^WsUgl-=<K9$fKKr0M_qM+knbA*re~5oPzs~5V
zyhdWr2d}8VPW7BZZTq`j8U3s`d7|a~PydF_vwRXDqhIvOoNIYg!<Tt4^tHUD;jehd
z9c9~Nw()PdcgfvW&i}Oc`Vm$>(a2YLM>_JZldV1>qgQ$r=2~vcf76@8z$4l6S9zaY
zYPl`{9dE{w*8UD-f3?@yvHx>DD}U9<-}h=c^15QL0nBFfTCY9E5hh;7<NCl`BJr$h
z_<GN~i&FbLZyEiux4+o8{bPf7^WnC<_Rz`b&%BkqutMT)8NJb4J<d?`kMUVu#&TX3
zX7rcdH;(+|*#4Wm3XcCL$M*lm8}_BOw~w*6*;|~poMFo7@4T6BTVC17zxPgAV>y?7
zGkS~Hdz$5~jr<31<~f$PGW;j+l(LrdKc8pVOZvl^M*g$+_ZL>a%<x~muh&}sf#JV-
z*T&>KymMpnKfJ$U{{Q7w5;?nZM(^?-ec#%vWbFOztr7p<H}ZeH2c>_r8)fvr-VW){
za|}=Te~Q1|4EOw|QeH#Dlm3BDeCw=(0I4%Rm{0wu#eb`x=Wlb`>mKpf>hJB(j`i<y
z{%x`TUEV*Sr!lW=f3E1?CjGA+Vw=(X`ZqcL-076p*O4FV@IM{>DUN)RBY(}|(;VJH
z`ah@9jIQi=k^ay7bs4?C|AzE`zQdBy2l(l|ZT;$-_#NaYo$~j^c_EXHS2cfx^mnU&
zu>Xlu{wV41R=<Y-ytH3i*vROb{sigYv{?b49n$|t8~Gvrry@Vw@I(FUHz6a5`nO4c
zx)b?~uIo?gV}%V2KinU3Fe;9eHT(#FU5p>;|54Y<_c!vR{N`*}r1JP=bbUXyuc79B
zgN$zA|25O{Dn{PW&*MOcWc82sznO12uV*s4k-st4pBnqW_Ofzz^Nc>$Kjk1>{wW^$
z@&50_tepQ@zu``O)0M3LGp4<o`db|R+njj*RmbY{v?QaO`8`@#`y4hhy1*ar=-2hF
zoc~$=ff>s=jAZo5enRU1l;JJ>r$$;i|5Lv<PZW^a<CD>+_(OXeYJL|wqg(q8t66_;
zH1bpZa{EVlTfbebJ=*z?iodq}_I~e}KOOu|;!hJ}?<{|SlyBRklmDR{ueLv&<9C<%
z+44L4H7ZBTKi~hkrscLjbn)Lj+4^tGztF$FVw7Lx?|+Zww)~6zF~?hO%kSpr#roqV
zehuk=c6{vNUvNOQ{GR^2SpEC>J7V>}%zq|U|I7V{WA*RrFOAjzO8-*nZ?^vZ{bf>r
zTmDu4<+1o*?YF5Ft^Xjua;*Go{5NCuzt+DZR{z2Nx>)_M_n(#e4M$jT{^}3QSo@X_
z^=HP)8|EJyi}!H<Gj=K@8~+jhYf>IhJ2Uzw{}*PE4#p>=NBZ~4@pLqb!TGH}RND7;
z!*B6B@j?N~w(n^Fww8v9{V{&W*zta=f9<_i-p%ZPo8M86cU#`={@v1_heIu+$NFzc
zJT1S|FIPKS-Z;PdDb}8?&)xnnvGT_IM@_eKTfYhZ)>wIy{Lc@x_R1Q6Ci`>twY;I>
zQ~b{kwcOTksy~S*0!X&JY5q+-ktpQ%_}gY!PB%09UcX;6%c}!2db&SU%Hw4k&cFTU
zvGVToUyIdmrvF5&ezW{>ocNJ!`Lq46q<*%%IsQmqXdv10=K62)K{KQU_+<1v|AGB1
zXR~MY{r(9up4s|6;BSo8??M0lSpDYvr`|_v_IGhJ`XT?hSp6RMdrEm6wsC&%w~+EC
z8NR^J#^U*?|97l@kNF#8^;_sSm3Z3uXp#S3tbULCORL-Z*!FwE-(JOX+kQ{_(_-~o
z?AL2e?}PX~<=5OV%AfY<O8sm+pYh9_WaT!VOZ@YsJllTH`gh05d(IyotKakfsj+yz
z;5UfHbE!W$)?Z%q501t2CI3L_FT>$RMlbU}j~(x?`a5FB`wIWY*zx|lUpF?stn{nN
z@n?^RH~iyee6h#hTYf^?&z85!|6GoD%ir-IiyiN){r6(W`+NSZ*zxzizdBal8h=LY
z_*>_1j~(wH_(w=QZF%ecp0VTMWB<}vfBD337V9q?{4ufP{Zs!K=`Xf^pZhDWMj(;w
z_`T6@H!#Y-^!JMKP5y)!|HeP`A*;_}Jfk=J3+4QTVa(|7{f6gQIh!G)xB7=(Zn?c4
z|Iz=TLsY)aZ`C6z|HWS-{gKU<(cArj!Z~bb^lyH@dRE`cfA{MOxAGnS4C$}4js8ym
z{22e!e_r~3H6!2U4-tNr;eY$@%lYU$@T^wJ2S*|!iDfivV~LHYPW~hNpNGvE?ImkX
zv2x3k$-ABX=gRpowP^1&4h%?~X0p0ZO0!_39{6N*Ub0zVL(T7zXY}65>XR*RZ{+2Z
zljc}{f#LfmFTB)p8}G`=){X6W(AdcLPrf<L%I$bmCAn*&<u4og0m<iUSl-3(1Cw9B
zZaM$+de1yqD4Xbi|CoOD<b+yQX!p-1TgQ0q<adpt^23t%#rToQk9gsVGy<QDZkT-c
zTtm%2mNz~oZ<HMD$QQS@`gZ@u$$l|@Y_bOfgJk8$C#%JH(`2o~qVi_RPwPf`LGqT*
zEguEI`D^n1-U+i|q~R@-f3snbxLZcIO1^T5mG4NBw@E(tjS;JTJht~4$;&%f`7;<7
zGrC=JKaunIKC`-G@*r6sY!3a5J}0?c^k*4+os$>rWB2DbhvIqmWRs27K8wxh3zKu@
zehR}}L;sd;CGoQT^Wx;MQlG<&e)nYCHr8HCqrWq~kp~76hb=sBkX(4Eq2`<TGrCVQ
zPxuD2f4}4zvG@!~c8$g7>f|Je&uzxupk$qQtUdl``_Ala%b$yUR$r59=^QW7H-xF*
zrnS{yYV@y5)#`{05{E&oKPEf%G*s?C-<CZ1GRrysW%V7&xiLO2S?}7Y{)FTOgQ9$L
z@=B50{ih}G6S?KnlTXIvGm~G&<a3e}V*cEp{4!Sl{NzP3{z&q+tD^osmTc6)a)v#l
z7bQ==GAe&E`Az>Qe>!<zzbJn;xt0x&#Qm{8oZJ?(|59=aFRYQQ{FUVVnElt1C!BBP
z>`z&}GMRUs<q6aOrlii5`Gx%@tKUj?mE-3y!{13>Qq$_Q?eM%?vRQ4*Gls88j^jXu
zWcj+}U#Ca;hsoy;kMfU_{b>lv>VJ|v{mdx;G`S^fxh?PW<cdS0@-LDH#LD|BIVM)#
z*U2`q^1e;}%?mLkTi$oc^=Cx+mgGMYKO3JPk}nRnavPs}Qst$6Y<#vQuc~9^Ha@>5
zuZ#Knd-Cj<zdMr;9uqC^&*XtIe|IH6rXeKj-#^K_V*aYsWifws3a`+ZWaHzfK9TX-
z?w?B4kCj&@_26k%-^%w&^@^2OHdQrN-ae@vGX7fq3aNh5|0co=-d{?!9boP8c*Xlm
zDgTNnuabH)CO;@uU*c=`ub#R*re7nqBX<1NO4Yu`+Ox;!p{a*r{IJyefl>JpsqS4Y
zzZH<x^;5@4``P`EPJP6Q7RkyRr+UQf9ha&e+rMe*+nD^M)Wq2SC#Uv{jSr`!vR7IA
zw!Ai}kEMQ=pPsr=`j6#jrW(hN?+&SpE|2ctF*USDl%Ja#D(4e+|MOGRFOAACOihyg
zyJ2%y_fIXB{W%|G_0_4FBdtFFv(KD)cbvCy_=MNu@_*lo^E({<R~p&zod0X+=Tfa=
z{KeGB7=I;ICdOB!YB#a_``EvtUYDvQ=RcNzkoq;oKTJ(&5Y=Cwn$s%EKT36u+50%P
zl^0e>*4`(nV~>gQ4XJ;dM)~)tw`2CVq*P3QYwCP1EEL-NA(f5sA5$O3{P`)>ELQ%u
z)Z!TbIhBm@Us8Qy<^7sk9kahZH9IE%E%i~1?@T>^we_z)e5|NXOt&8x<tL?+G2T3V
zPmH%n_dYwSe@gn6bECX<dOw-(t^HHeS6&;HpPn8#D9X=BFNw+9rI*I!9nyMmRR8RB
z`kE;3lwJ_?=iKxKvGUJLzZLWEg7h2RO!LTm=&MgIjPeTV!kB!C-f^*&+wp9vzM^YX
z{}ugBjK8jvqHpKhReD&Azo$DsWcLrASG)9n%Y)}B&UNnRu7AqPgZsJrF0wqhpWASP
z<;xM4j2_{2millv-oKsK-OArHe4^J~`fnA(CwsSueiOr|c<*jRhRN8w*Bfv-GDw_e
zcz<=k0z(V$uRiy*<?W4pws*7mcb4IEy~85$<@wDoQ?34FBY)Pr>p{yW8UCWz@e<3M
z8otb{6w_bn6+95tf79!EQB;4GcN_~wV*FWNTI2zrJk5wzYa{=``%T)rmEk{mbw$qe
zRo-v<SNxk}c)}ke{&CvN=!=u5$NVejFN*nB-oGd2-=)d<ov<TP;7@HSKi~_cf7}8c
z-X9nqv)|ZX7U_>XAD-9Im@Bl`xNDqe&W`g{PCRNm{ygUFKiS#8Rir;NzO&@~G4TI6
ziBG^Q%lsJdqoh9u{9|YT?auz~oc;Sa`+p<xYJqBU{o*F!!TQB?iSNlqzSVzB`lIFB
z{O2UTwmp-{>JQp@^)UK*$v4iiJlOwW@h{*TrdYY{|K*eK%JEFMalbFwUHW5CUIU4L
zz-Mi=`;RjECnxjdcpGUru0Q4cqpsntl1G1G^@Hod)_oIZ!-W7o5A(-HD-W*!){4F0
z`IiAAx8)5;&c4j<Z_B$nxmwD*4Q4WWP%;DD3qK1{4d~DJ)V{*23$G2-4}0eO2C2u>
zLp=6ie)-ma%>Lr6kDrAotsRD)cE+<D*m;TwJC%SeXAU`jE@B}tZwbDciin?!;OPkY
zcf^zN3v@vLIegQRY(ERt<$f0f^YD@)ryJq~BJ^ic4*mJEozHROu^aOpjjShsfs6P6
zaVfrG3+Ur#DE5ba`o(_WzvQW&#ATkk6ekw`%lKv)BJ_gzb%tEOif_Q7US$89xqZ2<
zmyeeOR?;6Jf9Z_4gXQ99EAH}uuOl8wApAK@@EqW7<-GA9%Xzbe<>2Qr{!@M4E@3(E
z{>O6gg_I?V8(w1gPxV<-!gALA$8zv9A|<L1eqO|_50^jnN1htYeu(}xPx@Om>2GV<
z-|#aeBiP?Q!7sE+KRZycRj&T_>3=Nevl5oG@jsUHMbYI1$1|57I9_l(=eTky5#!9Y
z!tW(w+~Bmqaf7En)cb<?6@GD3ke3mRFW<u<W)M%}V#XE6bC%-+cz0mlIiBMCBzak-
zZXkBTFM|X1Cj6q8#QhM#Gl>|7&INKmenX`HHTEa3snm_+-{6<T$zf+4`L~{$LBzOI
z5&m)9`VIckUp_ZY493|;ko%i4{t)qVFpLBFHN?nxb|5&*uSG;T4TK*@J^0gt9R8U7
z;ZHZw>q9yG3Cf#89*pZ-opBvJ=eUmTv2h(gD`UoWV9s$J+s(NCW68($j`R!TIxn|5
zuAhhY;J7}N7>R=!*YSn6?r}B(`)T}~&7<5O?fi%IhfAbCB-sysK|2v&_tf5KACBua
z1o=&=yOp#3KbC`W{UEX5K(J%3a(@4h<zQSdQGIs)$8s>Pm#CaS|6@5A*Gp6meqQK5
z^@9&e*gpU4UXB^p@pDDNxc-Lpw}#T+HUKqNJ$kUeVO-zB@df=YA^o6Mu705X-Re`S
zay~0zIsShv2jhBC^~pJ|WBj-j$7SKT4xV#d$M!F%mt$NXEOF&8I`a6QEyr^n#|LnJ
zuM5Y=&cv)zmk=>dUJm5AUPj{1Z%}7DG$&$QKMlzJ_#7+8(H`VAl^NeTu3t|MJ2z8~
zany|O7>|PSl)q3+e>)2X+v{^2!Z^$8Y|dA$r2ZVg$T_}qUb_j%dF^)D&hv2EdtPug
z5$Dg}2>R$}+^+)r8}{SlJ(Tmjn)NZ~7ZLxi{Xgv2o#Geg368Hh<AZjO#RoiRe6T%d
zd@$db_yBXp2iuE^&rN%Z&;JI$ii*!2Xm9qP`=s6H6LDVjobdHT^n=Yn_5)sru^$|S
z`mldDC89r^0*uaUEva`3-g5@(GQOQ}Bkf|Y^Kd+TKt1&P&!~rk>~yvt{29RZ+{;%l
z5%>1hS3n*=-%*a^=WlWxKYOuU96$R4X{RbVj-R@YKh0SV207zTxzL|r9C?9q*#B7k
z`BMC8$MWD0&qL_Xt3>$oEs**@Qx1QUEFb>xIHf;~5B)im9R4&SqW-~kV=O-9Lw|yP
zJ5Bs~TKsuY{5hQE!JiKF1OAx)27l-m{W0?c{P~m|{(Mh;`130{{MkhgfASoEnzNiB
zJ{3cMg7{1qe@wrComa#kzGgswIsxg=Tq68=9Y}xPqa6NxO%8v4A%{PIk;4w3N2WiO
z#Gj!49avsFd>;<W+1FRM02#l)A3j$_`+N+Ec1{Aa|8N<a+egXv#j^cv+5U-aXB?=<
z{=@x`1L{h?dWL@B{BR`^=Z9N}s9)BDyt1!`6H&kEK%O@)5PT0vd!Le{zBqL>^+ne=
z_1y=^at<U%eGemtenWET7m(M)^VZ~u4}al|`aQ{^Z>}St&+7>4-%dI7=aNJJA#&(H
zP7Zzk;t%cfmwBlF5jpgKCWk(Mp@sVYl0$zV&O4Fg)5QNQiU0opH~#;-;ve+yBiaAa
zekT#LN}WzbdvO_;{d_r){qj9-$2|WD5##m`!uMwX#<;ydkmGhfIrLrxvj2WY#JK&x
zI*tX$X(Rfv*;A(y5AX}GE3YGu^ru<iTnFTNhJTQ+DzSXbA0q|t21fO7q8{ou0hot*
zbp{djGwX!lZ<C{bpHdI?`(E@;#_>wKy@;qEf1`nRgK@WjdYG3w0(Es?^#W2J#QhD*
z5%;Y`#CtpS5byr<5B^M}zX$tfJk$BUDhvD6H{(8zv)bf1&UjtQ<Bano?U?xy$Jtrj
z9`WZymV<HE_=Cj**Pm75&o=RAr})F$dGu$7_``XT{_t5a`g0)5fj|7s5BkIJ)ucZy
z$>C3Xa`<y0G2%}F%L(FBYj=Mhq8#>(U$C=Q{An-#Tqpj#CjM*%Qs0dG@F&Ic;Sc9)
z`osB}{v1LMe;N`a{>0)_dv|{ph(G516?S;O!uIMY{tOj=I4?3j+r*zgDThD%uzdK#
z`I`RJB8Q#&<nZT2BK)ZYyTQ6J=Oy0$*L8e*UJZHBfBxT^mzK~E%u8<&F)wW;qWx=n
z@T0EGOQ_%f*XO17Y;Vj<CjN*2-}wLUo|l64z?0byS*6T*0*)7RUX9~!1GckYn)N+g
z*ZfL7jN3^bci=UN7`M%NBgXAxW&6iK9-lm~=eTXg35**Y&v=}g;}XXyzt@z<DSwNI
z$7w5a9H(a!Bgg5RD3|liaN5IsutP9GJ=}kyeSL(l_ICEGOMfv>9xZ-jC^Wn$5q|S}
zk@L;XvVAcT*F!9i$m=BPah#@}sW-My<8cZ<o+6@t_>1{lRJoiFXzyCFH<}#&Jxhe$
zcLmM7552!dZ!grB@@A+X$KTV5h*t;J_eft|CEJIPBfjIvYbrH^9Pxda9Qx0ZBfgu+
zVdqC8^wRL3yb=+52Lk=0eASEydtHdI(?{gjk;Bf<IL~ApDyD244g^Nq&BOuyBo=@0
zobktY6Mvi!nD_&8#vj`!pnR5#rZ@3N7cEh_IpdFVP5fck#2=V5{@8BjU&M*?FXP1T
zH)Z^}Ud;HJ^Ap5txWx4i$`QAF$f3`6VBFS|L;p)+O{M-4UIz7`9-mug{EsBUURxsU
zoF{U&1MQf&BMzra{5v}F=XocO-xJuc(9cZ&$MJiv@IgfMvk}xo|GrJOw`IGcQ+EJH
z+p`bkc)ij*mlxeWO14j<oyc)ppB&|zc^~Ds2Iu&}@rC~IIAHlVQxD~jmF;}on)i2k
zo<=`-y&koDKJ+Mml>7Y;lviHL>m%h|;golQlsCVK@=Cj2_dD$!=c`ksywjw-=y@&W
zCN8L7a6VGN@)1unZz6sdf-|0`9l>XkBc6{@5Al449NYOiQ62_6K32fE{Umrk`W?%e
zLu~4++UQs0=u!q7;ChnWtbYQz&Z$rI)e0i|0e{(u@>cABz_$eX3mN4133_F${<TDu
z{|piB`T~&c$CQUkpg4orY_P0g1wo#-QLl<%Rl$70T7q>1>j|<Sa=%7`#|oNu!}bE<
zEd|>MwiPt-hF(YEodvrHb`|U)*juo#V1L1Zf`bKz2o4t<DL6)Otl&7oiGouFrwh&!
zoF_P6aDm_=!Nr101YZzbCb(R1rQj;T)q-mU*9&eC+$gw7aI@f6!EJ)u1$PSW66AAj
zru_xW2%7V6#Jz%WUT2#27py91u7{ylOL!f@dV=)@8wr~86zKE*FYOfwwiIk5*jBK;
zpnH4{hX3rp?sk~WxxFZTj)S@EnDdi8*sp~BcpVeqP2fDfUM<32QGOM*{W7r=*mp5D
zzhE9c1^OJ1&Lx7=?r!r7wqL_>1IIsqIWRhYoAZRx%C3_D2Vj5Q##eU(qk23(xSjn!
zy1hPmFyEk@*5HNn4LIYx+kAuVX1>9F=RM9hkneH6DMfi^zJa|x&Nq<rIL=kSrmP3b
zYbEvTES&v?^<zKa_;2nHLC?%L9g3N6AitUW6*b?$PHesb&pF><yP0qBkeHcoP!BWT
z0L^@Za?E_w(N`~E-pM-~&xZ+qEZC6q5A>cE{0NvgPN~g;C;L|31(??neh|@L9usWF
z{)PQV5<B^75-<;)XrAB}Zb$#A#`y|*mkVwaY@4>*UllyEjMbk*L_NMFqW^viWW1R2
z?m}J=n+-23SV54-5A~`DRu#+_tR+}Su%00MHTP>Ic&wo52iRU9yrp0p!M1|!1v?6w
z{(}9w2=6M`L$J4CU%~!@0|f^Q4iOwKI8tzo;8?+Nf)fR&3QiZCB{)xTzTg7EMS_b3
zmk7QfxJ+=l;7Y+&f~y7B3a%I2Ah=O*li+5-t%BPGw+rqR+$Ct{FT~U5JOMQG7tqXK
zKr?><&HM$dB6?>20ypy)(9B;zGk*ci`~@`g7tqXKKr?><&HM#4^B2&}UqCZ|0nPjc
zH1iiQHcz474~GBjzwY*&^T8hUbIxDT&pCf#dtkp3%HM7N!twQLDg6rUx%DX3{Dt%6
zQ`nxt`~~jLUw2ZD?d5UE^Z2g<jE<MR=r<lB_+0!C>UXJZALVQ>?fhxV$M|ZVH%0l%
zDgPYU*SN{_os_dbkns)5=X}8R{kg<mzI}cd{0nkiOn*Z}e+c|$eYoy&E4Sa}n|1r>
z^S=LomtQCGnJw{oiikM!zAD$Ff;j$9>lGLG|LO9IvlsNUV^HtBCwzPV2<Kt!k33$w
z5^-Gd{xA77BF<Ad&htFwaoL{5xTv4>)i@y6$IUv{PfFc~^8$aduU;hLKJ63e_dNbk
zgo!s!c@@{uA&MQ3=Kl3lxDO0_^y>khU;Kh`*|)qg(0>}|3Bn&1{yY)ouLT|sqkjr7
zm$ZCB+8!5=0C`+2C&xwe@G{o!^FZ2dQr6n(0;HW!_px%Xyp@+DqMTYl%J;8m?H&!J
z-P6cn_e^vo;%9=t31%wW?MDf=1~LxqiRg#t3BN>mFJf@M@-y;`I}q*~gqsE{2xfpB
zKiIys7qoLj$`Q|2+>S;#n;h*LoF85({0<`8neEMXo+H~UOFQ#@3IADn&fqy;%|iRI
zUGHZ*N5&z}!yJdW4$8P3!u=7C@zlrm=cxafUC;E<cpm!)<XPz-hYRw&GHSO0{dvK+
z>tpDjX9(|2gx^De^!p~+Zq~<^`f4IM^dBICzf6SwIw1AU{ab85LHryb__AQIe$Dkn
z*4Nx$M16z!9z%QXafETdE4K&75qQqy2;0qZv<&CHD3ASX63WT@3C|ZWPB@NUC8EDU
zWXfMI@xdzzrvJP{jQH~^{eIb39|GwYkHfq_aUT*Lh}^tSf&M;0IGWV-|2K&!<WnH~
zcSRgO<n`n@I-bYRE50(v3$Wi_*4`o@kDn*y_*o^#PYTBg%c}>Z{6r$`wFlDvIdWX^
z`-|BA4+y?0xKWVbkHh1narAij1KSv1pgA6Z=6C>_;{h17PtN|2xX1cGc+UQh?ff1R
ze9eye9WvIR&&%lLzS>1Ze@ICD;jTIUz6Me+pK|nfbKe>L{cUjnHD77!<G45l$a?oC
z$MM?Fv19r>9wIU8!9jlq&)MIx-Sqd@o&FB~GUMd-cWnP(?e9G9G)|(s&@R@+FC$_d
z{6^xx_&qerEBT7&{cP{Qh!}Uwc{awK4ErVOb0`s<>#FpR&sFhwJYTjqVf^0k)gs0X
zc9s*-59%>)=&YTIc%Gs!<A(k;l^pSWQ}}0soIkj|wqP?N+O0K^{+|Klx_vkDnz+A7
zj`jO%$x*N2<XFGIgNWlSIB#tv^=;1jz2%$!6dkW9=lL7s<*y2#&j`-5gZ^UrC&sm=
zw1>EyNd)KmJ>xQz`y(zl%XYI)fboiPrv8IO@K=b?{{Tq+4YIv2;>r3i73A}1<cBf7
zh{I8gE9w>aa~=1?#nB4rv7h!~y@5=5Ucw%CKy%yy&2a}b#~m;@?o9pB?#;O$+Sxou
z1AonN2Yv&$!{5<B`a4eaM$kXByLm1E?LLiuqP<@yqP;(%zi97&$x)BiXlLSuf>#hx
zud9LVFN2AZ@v)@+_Zj+y@=+zzf6a9v#)E3$jQcS}@N<Z$hnXKy556wQ?Pt=zcYXCH
z{e>N_m(ZUk^l!DVx)bw#>nG}SD>>>hR}e)Qz6Hqo{w0V<XH5ML1+xF*)YbIg=HxZ;
z{R8Cazvq&p|8^xu|LsSNw6p1V7&l`54m@YS!*<i}FmA;99r!EKj<J4+?WOH^57ACu
z!ahfd{x*XC2K^3$2dK&entlf~{SIjQ9WZCVLpucht}FKkH{%rAi{mBx-2~Y_8tumR
z;&H+Dng?V%ttO(KHgP-Jp^UUkd%>Q9*Amh1h5*^lBZ!fBcSkv#4@R+E)N2|M<9=}5
z4HEebkv}f-r@0-CoB{Iut{S(`567YE!fR6x{U@+Ty}VC+^Sw*#Cr6W`KNJA{4Zdna
zgq?G^9r8=aF%I@6uc_2Xa`YoJuVBB)<mgAGwcj55(XWeW7v*riU^xTHQO;O$lrx?j
z<=jV(a!Oj?|5JKF9BR?;Z+$g}I9lofoJzhK_tj+k!$AEV<}>m!@|-tt8Tt3PPbb^o
z2kI@pd7df{gTj~G4%|%K>Z>1xZx`hJnuozJ!EpzA{5c8zgRk}_zfHy~U`_HL(H~?x
z$1nYpJrBskj~APH7|7?q^S1eBKIZldsrNI+D{dc)afFC|b+z#8iD=g`M6@5Dcc<P&
z!C6543$EwL@4)+gf=?5F#k#Wal|X#GoqC7-PTY4F<nxkwzv1{3z742<_to#@ci|wz
zaY^KJC3$$b);t#oUIkq5#QjiiALpq$g66q^KYa6CIJXy24;PKCD8Ji2pGV~HvF82d
zt1hy=yWr)5g9Q1z9n`-IsCW5lGC6|H=Q;AmV>}n+dy9F0`)Z-^rvzUTd>5$y@zpwV
zJT&pS;MYVvEWAaySx-_)^*8xMJjaa?5X%wq^3lG+4`yg|QXN7*3G=+*F+?w^P7vN2
zsQsimgM2dP4MEPQdC8=ir?~w}>ZOuu5Vue9)G)zO#B@@jtC;N&;k|>Tnn8|}vIhk*
z^kIBYswahGh{bd3N%b1}G(68CxQ@7YQhg%)Tc9qRR6mg4gY`7QzlpfW_b@SVdwHP7
z!_;_GT;<*CDLg7_@DL(i`aE2C6QHh;R40;8m-9g28RWR=Ia{`0Og;RFEw7jIP?;+Q
z2NCy8+V@JaeKhs(^6(wpexIkN2+kl@PMYV$xqTt^_Dd=(aj3kRxSkWlC4tJ@KdEpE
zX|}&7{6pbi0d<w6!qB1eX5qOmL3Cl2cR<oSN6zhND#H;vqX&~p<0a#2<g;<UO~lKJ
zM+k33#BqBvv6H9T$acODOMSk_m{&Dve&?OMC%A^OzT7^?-WMbeC5N5ciLi6G$fpSM
zJ=r`wlrUHLLZChvaUjRZ&P#%?5%UoT;U5AuUf%qad>-!K2>w9KCe^RP{{`xrNmVX|
z?eL>Akn>AT@|w8rCCB{IoE-k0N{&v&=WnRrl^pt4kVF3#a_EmGhyGM@=+7mG{v+hj
zf0i8j?~z0QLvrYUP7eKGemEH8vyYdJc^<;~e*pPi^8Dn&Q14KV<F%9ay<eRCwGiHo
zi1U?x+z;m~*U0ucK#fM_{f+2(hOvVm`!?5)fgSLicCdYqc5t2^vjd*f4z};n4$iw`
zcEEGm!S+4csq54WJf|IO-=iIT*+a}9@SJwAeUEkyckF=Yw1e$?w1Y*Km_Oh-?O^*J
z?cm^!*#XaK2ix~(=Sas6cuqUmzDGOHJM9jh(+;-p(GCXxSiQh=+WCLj`w}oYiZbk;
z$<Bu5zV9PIxFPK9ZZ1GfNCpTAVc7%-2ux;YC)r7Mcb47RY{DVo6c7*)<djR00Fg5y
zC@LT#A|e8EMnw(*1w>Im<oMsW`s<$Vp6;3Mp59IV|M^40J5^ov)>mI$U)R;}ugJ5v
zBVTa4^1#0$PoskeZdV@oSL8`Lc;I&BfqzAwCI=7Pt~~Is$b)$Vo1Woz<$-@i9?W0Z
zc;I&Bfqz9Fyhqx2;CAJKe?=a=zuI`<cIAP8MV@Adp5b=ofqz9F48Asb;CAJKe?^|L
z4j#B&dEj4>XPkovZdV@oSL7M*;DOtf2mTd#COCNDcIAP8MV^Tc9=Kh3;9rqv9|sTI
zt~~Is$g{752X0p$_*dlF&%pz?D-Zm=c$#QOyoLER+7Ylz){g0RiF$858uw<v-GG;Y
z{ef|8(itQo+}ZU1YC?MeNW150`cFz|E9Lp$`5cGu`ToV{oL`K?$mBk3#^<~k-&c<!
zPDyBI0vYaVKA)P<ZXqJveSDruXs^rjPw9VPLaQI4KUeQL2PL%a>4x#Tm-u%8$u|IO
zn3mAarvD)c4X<K~7pAw?Fg>9m2`xSY`4Iod=znNJdyZ}x!LN${d-Ojnq2}M>tqE-;
z?QulL6t~uJctYJf6K_jsW5i$GPcSQ?EukAm^jX9s657S`{3>7rHh*Ag1omV?dzSu3
zCA2>i=Opxd7r@VT%!Z>A`n^=gBs4TV4cA#Kd!6YcX|3VdgmxPJkHh;1@%V&xB@xe;
z@p(F-y-4@mg!Tq8lh8hp=d_y}+7sH|uvg<*ln=2Zp&dj-{3C&UFF9VYNdH_yJCSa@
z44f`_G5zP`eUFHE%jv&GLR%sD1pPY`+S7FBA&=l&^j`owo``tdhs<)D0Bl&8&<+H~
zyAoO(5zo()=U4N2cS5_B{ylh)kmrxkzkqb;?nQkR|99wrLPA>u6NmA>gtjTL0rh)Z
zAno`)>Ao4~1^N81bsE1P#(F<p@NnWBtj_{z*LTr<U`#ui?tau?BJB7}=zma5<GwTc
z-zNU|)BoU@_PF@-`(_OPC;Cr|Y43~wN8(@K069h{wDo}v*la$E?qWjQ707tw=#NR7
z1L;OOGsXW{@$VA<qWCWn{5sJxAGsCVKlHE@5&2W|gK+N)H}#UDKlE}0kb3zV-Ox)$
za6S?73P9`o&Mx%-|L-xL{jSmv-cM}fKio>M&i6d{-w1trzUSfn#Kr@+D-ZlD^5Ff%
z#sjx25Bw|g;QhqL1Gg&={44U{{lvxtw<{0)EArs|#Kr@+D-ZlD@~m#}G5_CAuUuZR
zFKy)xw`;k>zhb$=zO?bc?aBlHiaf9{Z9H(h^1#0$&;NsVsOk@4hhENp4&(fT98b2w
zcoWmzYF`ZI%eYQJJ9LdWo?{$bN6?sO8^du2Jj=<0aQ_lMwJrjCm7iUueF4);qrKWH
z{AnQVRjyy~xw_W{_A1vWD9^9?9QNunMA)leNVrXqKJC@*i3rySq`i7H<pNJH{b8^2
zoF|{3%jd9HFQ*&!D%S<*{{oQV-{$ja3GE~LACge}MEHC?+Mm-gk4t-WMnc<7?9y@c
zKQy6DrF$mwBmNLo*{cibhP^r{{%6u3Mx(NWVXxjQ{+PN`b|y?4Ee<>LLn7?VFXj0L
zv_oNM?nC<&cIJUZ*qLoa$k)N=uroRTO*`{SBJ9kY<@t~J9Cqd#bi>ZX(vq?>M~WSq
zq#X)-nf5I0Wh9~O<-9x};PZ}{vTtcG-$MVRu#P~SlhB@!a4#|3W(n;tf*;Wz_UdPJ
z!(OeU-3i=?_9pDr?ZoaJL;o#cUkj@9nXp$6ryD{XE!YX9y{hbB<og!5S#J09`ND+u
z7@v0~v}cHT9v`Vc-v~&1b$cM~)f5rWY1h(Tol7_D)h_X0LVwt+SI`Z6^#^pr-ux+$
z_TDdvsQ=H<ANJ;J;{P}C=l4BnZ;lkZay_vtw+7PQq`ga?7V$qANPDx5&tY%2(+zub
zfjs9qK-!z%pd0bNCH~il|8ntPA^r~#Eq12SE>}pqjI$lVKIHo*_fc^F8{LzLuzzL%
zInRBB_;cNm_Rsrt@2a<d;?8U@2(Rv~KzP1i(*Jz6AB0!yXQ<ro&>!i1Nrap2i1FBt
zm=5<D(*F$Bcf|V*-I#}l39L}9FCqMTsJ9HiIqNf?b6*U@-%U5{G_`&MRO>Vdk0nbL
z9!q-aIbI=E_{&)zVMpC9_&XxPzXBxx8{$8f^$7f@uztZ_x?J#wM1+4B$nbo>;`6Og
z?hK!0`NJ+cMNqvjA^a_HGyGlRA454Y{4`(#?4PXQX+(s-0Lbv)5r3YaVfelA9?<}M
za+=_LBEt9c{Q}`n7XRM@8Gh87cn*7IcOuGRlDLm2BHjWZ<MoUGqd>-6do4W2{NT=l
z{O%FMw*nddXz{-d$ngK7`&U^1#l{fg?nHzi2W0rKivLAGhJTT6%=i6EaQ$`k@LK~J
zekZ!|d=Zf0e@1sR;t7641b=*8J^WfgK0g-7@Hf%jf_Q=}i3tBTko^A?{{yfelHtz-
zHejCaCc#ID2>%q2;a?E{U9sVX;rX4P222W^C%BA=@GF1}|5Nc_cLP0q2FQB}77|eo
zr-}PIBI4Z+WV{vP&x^~M&Y?iw12kXoEF!{R3}pDL#Q*O=hHu6OxrV(FPjDd-;Rk^X
zzf}Bx4`lc)Fn~8SBA(#kM1(&M$nf*T|3^TE|B`MD8e43l<9H&%PXRLg4DtUikm28?
zy9x0Gx7kz=zZ;O@o9M>#Gk^^LJl(JhUnN3MABlToY%pRvqkxRJ8{G(ZB9QSOp&NGK
zO2JQw2w%Us9)3L_pU(v{{4%;>?>!>;DiPt|1(N?i;(y>4diV>04Y2=~2|h+d_-B9&
z|BCqUxuqWdRA2+<5zi$eAJ>Wdr$og2HIVV15&s=AAwann0vj-Ic$VPzhzNftkm2ta
z|Awvg@EydTqCW&$`~6+e-_suZme^rG0n)DfM8*NyT}<yGAjdNltJ>c*htJ_}xYa%;
z@SIM6>?68b@K&I6A5{D#j0^G{)lu<Hq#N=XZWN1356we8huYLU$My_|d5+!b#ym%(
zpdkmcU79b!^F8Q3M%JZ(Q{?${Am>kxp!;V1JP&yn(v5g02o4hGU>^mL^CxHyN*)vk
z>@A!#Abw5w;buO_djK$gYC`SbV)`>B+>v~4S$F2XF!Jn5M7aILJ(c0Wa~R!6%l!_J
zD=p!2f(0Vdr<~-aoDBa>x)J{}x{*JY1M_z;-QamZ@aIJ2?>9ikH}uc)w4Ngy3peed
z$qctsLO(|g_my;G-!%E+UrDHYuUP*7qCe`($AX^`E%pZWMn1)hct-h+6aPaQ9_gGZ
z?%U`_I=`ZO5c>^?NQZU`(-|qK=Eq&qnIQ3ubd2=(q5tAi`bD}S*LQ$i|5xc+>irmb
zuF7{wDc&CNXF0O`S&q{M^MbzvlJ|c=^75P^<v$F_@IRp&&);G`@SOXk>MlV431qnO
zK=MzaKgyN+)mhGJ-xJESoo?`S3ic6EFTM_Bxt>ErKGgjwz)R?co~~dx@Ngd`dGDYb
z_2m&D>&ugLgZ~*pb<Yawi`r*tsmDp?^8wj6jDCpuW<PWb5$PE1W;Y2pi->Tn&kV<U
zYpow%eBVPj_7lq-;r~nbC3tTDvfi>?vEOm_GZ@a*bJb5=Rw}<H_;bBPwL88S!cBX7
z3H@Q$pG7z9?F)d^<0V8(J=>9P)K~J<!FV+4nZbKF{lU8!NIuqU+Ue&L!FMsyq9=6I
zN*?Nq`#`A=Yd`Asob`|O#Ymt14eOQa572(t&guS?d~ib)t?rtHb`<L$;;HlHz;DwZ
za$O<#U7{twUlX2lgy&A;wF&hd0P=HxBgYZeZ~Ete<UgBk@P1S9BBF&?=?m}quH}ID
zsA}b4#JA}i@qFnU=~mRY%X6o`=Zao#5WRdL?k46F`aYj{Q$o7|NPXNd_!s&^FMkvK
zkZ93MMtCk4-babwPiX4i1L%7q!$aTP=ShF+mHc<n4c;FL{+RxI>GuX(>zlK^80};<
z(&4;{;by&}djlZb*}>vA#_7opH~UwHH|itX3HN91MZ`WV>aXq&yvK|G(R8C9%F>O%
zC((^|a~j<Ue=gmYen*X);8W#}@CQh^nGAPVLO&mg=cm&R-W!SFWB)<E6?9wpT;;oG
zh~xurALR%j-wh0p#&|37+L(UM6O&<v{*^t4{m0ZR^=|Zss=t7LGyLN}#yTRftUqyi
zK84{?kDTSl{)qbf3VERCC3GVnXV48je~WG?Q}zGQ_Ydes_#g7QMc>uRub=V2`whke
z@9jkJ-A#Y+{giGCpHY4``Jm?^kq^8<<)eMWa``F|^OUUj%+D!6jyGr1AM-+&(2eot
zDn3X1y^d(<51c&5^Er6fKQjKsbYpzEl8E@%5)t24ACSJ$-|fwKDE|Y2tRJfVVEk0$
z2g-j#__Mw5M4rb><J<n?wmtui<GID%gz%hyb?x6V@8zq1M|?wXYCJ_eU;R7c8Tn=X
zVEt!1vDWYL^#47^L*g@-$0I(A`Bvg{*r$#Dv+fW2c*%b2T)Ll6DEqDMg@pDl-7o6%
z&2^aUG}=uw;<Mbd<N^Q5MDWu-C+{6Z@cxPj-dBm>{Vx%`Jda1-J&54tIRMIK@GHGy
zFkyK#VAIFbjE8joNklp-KGJDsJft(5h;#;sNas65q;oG3={!wDI{zd((}A(7(!pf^
zPb8i9B%L)G9_j2tL^_<uXF44JnT{I&k<Kl2Bb~>INar0Q(lP20+i~5WO8MJQ+_vX`
zaXh!UY4`D5UnB92gp!wTLtiuG`LXi6SKP*PRnHNg?V|22>_c}vpCxWpo_IbeZlir|
zOE>D5VSgIDYCL_VP9Oi!ud%+dA5-Hf+^vj<e(o6hLkWF!qg|_dj&Muqw)A(Z+`;GC
zo-j{btvzkSbP%8Ig8i(jr$}cK(}CSdxtI^i#ddN$kl_~4A95DyhMdZdg`AhrjriB{
zxkb)<>3&=8qyA4q`-ixbEO+?NBz}Z>IdLzG>;8`s;m_}LG2G-4KubTU(t-bj<og8k
z`og=B@ThwD--K=-A>0Vz;d)RV{5c;@-g}7_-WK6e{S4C2h+D~N3AcmzPa<LwL-m{B
z%ZtCNSDz=;c{ZkF)Pvdbd?8V**Uyhyo*VU-c2XVUtMMAotJN>o>-ftt?L@}2$f^8S
zmi#xwbN1()M~TDuT&29Y%*v40CfC1x%2gr0p>LK;{5|Xka_B|*BfjBpq`xP_BmGF@
z?;khQvGL+?lWY1Y7h5=#s}auTk8(BqZSp(ghe+S6UPR@;F7#}?uk#$2&HZ_u`rc~;
z7Hf_4wnlh{W53M)NR8LaO6|hyIqfZmxAB0#B9F^+gU8VSeDdP`>s%n`ZN5u{y;beG
zAqV>p#-|<9fJ^y}c-xWZ+<J9>pU;*33;wHx|9T+b<6L=g_|2#XlMs&UwyOQlE{&JF
z&>#JFGqCQ0dUf9j#~J2_{ZtR}!g{@4!F?&*@e|_eeh#9t<1ydyIQ_p>uf59f7%%G4
z@6wK4AK1_nSNCwKeR1rMp%=BjkABH1AMGu!D;xQ#R*r_Am@m$|%ppQf)sLWGKS$ix
z2!5Z4ar!=SYm~<#2m9LwOq!|j_{fBsC+7OKk&a(|eO>rfx{zzRxSt|Iu9e~*$@KAj
zGa}?x@9%hikhqn-gy)Olrhd<)KlHndZs_+OU;_>}K0<d9>+5_D{r-;V%-5n)zGfnQ
z=F6t%3iaFww<Y2=%$51>w9I$I&3a2a-~jTT64&jRlVrXd;rRYQJHW<svdniQ9PRK1
z-~_=*f`<ss736rza2!vG${qrqF77J?ZxCE2c$eUh1%EI2vfy6?-x2&!kn_k)XA{A#
z1xE{x5u_c?aI_1EYCRmt^SE@+7d%Cf_AmV}5WGx~`&sC(&f5ZiF7C$!pAvjg@C`u>
zX(}FuDutg3a{icn8wzeExPu_i&+|FIyF}#qTH-XpR>3)f?Sg31D%_wT=a(7pY{82J
zuMxaiaJk?L!Ji58-UY^gR#4qn3HNK_epgWK3qZXYN&64=Z4+R_mG#<oL>Ps8)Bmb^
zb#FsieQTF`o00kkx2@iuD)sghskaDc)LWzdZ^e4?b*v{65svE?#A$-F1k-~3#HDe4
z-U)|CFA#se@6rDTL9Q>5hwo9uUkSb<_@*G=<M=$m@;wdX1d#XCY)3czY3I_P?{~!g
z#Q#viqXoMKc}{@w&JetucslxbAbIZ=f6h<R{}+N!ivJ%4`QApJ&jm-ayx`tQa2Mhk
zacvxsypzTMVDX<Nm=*t`AXKDyE)~31@HRnJf6k1X_w}fC38bs`lfeIP3<vyB!q>5$
z;Q9K3qXowZ?jtypcvf89Q$l$=#lKhlQ3ciWv&8>9f;S4@C-{)ylY%^_(11qr4<LCz
z75`YB?!UI6Iu{K&ccvTIBzT};tKhMMy~J<CwNruQJx}~^5>)4y!Sk@V{~*Y74CKcZ
z1`59<Vv%UwgwC@Ckk6Y1rwX<Tb_n(eo+x-B5u50~3#2^D#QzaNyy7d~KMQ^+h*uot
z-%zh3?~!ddFRtwgB+q#9SNpvnSG%~?d0@EJIR~IR4-DjaV9Kw~Ieas&{X}@U|BL>w
z3jR~@bHNQp>d(1Phv9hMfw(Ubo0bj%Ql2BkzaY3&@O;7R1#c6)Pw)vM7U5n3lIIQa
z|3YxfHSiq$%qSrHIqv^rKerDN{oEA#qo12WbdIYX($8h3pM%@h&*AcegV~RqD*YV7
z8U37Xd|oQ!Gs3Cy8K}l*;3SE!#%H)Q;$9$lg5VOtGX$>^{GOod_YnUcaX%<XJBjkW
zAowT2zY2aJ$aP<aTT77hTXb(JsK#ly8^ulgiqF;lH6W%)mAg%_U2vgbpWumtw7(et
zQo-*E-XyqOP>tURr}|0YAH*N8Xez!Mx8eW3xK)1%_xkLofSU<!C%BuS8lUl8jn6<e
zJ_FVG3{>MY5M7tzxlr&jL3Pgsp5G#Fb#4pppNpIGEKL6?LDiqa{f4;T6a2T}XM*+Y
z#}IBq!L0;$5Zqm`MR1bfG(ql%Wqd3tE5y*Out#uE5KTh)pDlQi;5C9b3oaL2AqZ1g
z#d|{VS;3bDUlYVuK^5*3LDerqt~J;%0@oMZQc(5J@ZVe9;{<tc8N=f$Y=yH0j}z<=
z>=Ilgc)H*>1uqd)=g`2X`g7o2;{Sl)LxPVBJ|p-h5$*UrAo~%#GOK<h!G0F~$R<Gc
zBij(2{m4A&M{?5s;kNZ77fU~Kn)D+GXY?aBd+Btsmk>_bOF(5W0hPT3RQ3{3*-O}z
za5~yI`$c6h!T(aWclci?xQqz@2Lyj9_>$o3f}CGuxDjk;-^Tkeki6T_4S&@?z<+Of
zK0*Akl%Sp~J09Wk;_eqbRq)$H7$-LZ$@>HGUm^aFid(gR@Nj*X>HbIXOTo3+j^MA_
zI~wa4xXCwB{8hV$ziRIYml6MNL6~|fK884jmkZub{7ziI#}j<N6n|wOf#(Bpt9A^x
zvWtLQvi<{i7F2c-NZDQ~*KG0s8WH{&VpRA6K}1#V%LK0zyj}3;#4F<3Q$X^)B>u`i
zg8w_>R`wCd>RE3om*8l@M!~7XE92@u81fx2{`17YPw*u1KVR?)!R3Ou`ckFyh~V?Y
ztK!<5K=OVd{vV5fob3qDHzY#79R;zaQn|6TrVv~I6&@{!E#|oI2J?MD@_s}7mE8pY
zE9Lo(;(xE;&jpqJg!KL>?so*0{e+jUwPDAQcQe{E2)8W}{<{e_iT@PA!vwQ}-GWO5
zF*Sts=D2nZki6VaPu@Gk{{g{A#Q#}A-mk)NJU2>I_7$*!b`EeGB8>Vyf#e-8{)Y>;
z3-$<}E~xA)#OJ<y@+>D_2m204p2x)hRl$D>elEBH>?X$BN^lp!eTmn@z5|ly2=Oln
zE)_gq@OnX>A0^*?f=>`{fPDuf&l}?Zh2VM(lD?qYr;Yd%#hns7nuzw>2_z5qZ8Mz<
z1g{mmP4H)ej|)C0_%`vzxb`uSJn=Pko~;G<5}YV_sNhk8S;0Z#_u|^wK=NEH{<jN0
zDEPSGO2NMh{!6faE%4kF*ERu?XB6GY*FJ*N1&<P3C^#T^n&4$bOfK96B+s4V|7*dQ
z1^+7esbJmOdV1>%jwXH|@6AB+>@WUv1oMIeg69f;TktwT-mBXH<LVJ0d44PYZwY=P
zShtRz{^o)^2#ygvfQZGf!-3>ER{XiYoqD>2h;j7_KF7GeoNl}y+(Vp<c?9}nTz{14
z9M|zOJDTI-d>Pl_wvFp}xjvZB&yaB);f!(J_I_}t@F3h?623)nKfwb9j}SawFelh8
zI4F1l5xkrqVZPLOk9^%qf8>kfJ@fT2(V4FWB2QlO1-C6<n0!+CI!p3}a7Mmt_6m&4
zW~PU5j8AM8oFmvSxIl0~P|5#;xW4X*a=S(Re<1j%;FE&S3##`Ur1P%0>u49;f%XAp
z`R_(I<f5HIy-cASdQo-?^uqTS>V@a<s25v)y5!tA4w<QZ!M!iiAy10w-4)mO7vs5_
zf5*J?ar6iOLf{@Z)GND;{3kJ<lOIO<P7L2I{BYa&?-71HSN!MH+xc->7wtYzeoVS3
z{(|tsZR1}d{CFNp{yyP9LHOae@#7`wFy;@>L&;wh{(j+y+s1#t@Z)(X`4<U4j4xHb
zaNGEQEc|#LO8&*dkC!mT54Vl~LE*>qQ1YKB{7Zx%ZW}))`IP?gJgEHakGP)2_Y1C<
zbg~>DimUw!TrWA9&+nA)G~y-EXg8B3-h2tK>SsUh5tQ&ti3o43Uu{P>)@3#Wavf8(
zt6!l1hP&a>xV~=JUZ>x)kC!&i)AD})i-2($QCzPf{zLrNfnCn$M+qii5A*r<w3p$(
zr{Fw6s7(2vM!OU*@fQIZj`MuP{|auK(A_w~qx=sL#FCqG&l6lMc%C4(2CL_{2>w(M
zTfme*=kKTw{%OEV29i?<b4MYDJ%#HFQqK&xx!~4<qXb6_?kc#aV51<*mGRYl6i|&f
zz)9jiRZ#W!@Sh=W)sMqHTimKYhx=G@&lT(tRP_bVyTsiqSQK0=$a+M1mI|IJc#h!t
zf)@#1DtLw9HG<a*-Xyq8aJk@Jf-3~?7kp6gA;Cul9~XR5@M*#41YZ<fDQMK+R=9bu
zGRHaIkNhXr!-w&m2-Y){vk~q9#(O-jpKJMbT;0#i@AOb!u4gh`eh=q0algcRepkKz
zeO<g{y#`*oXOb6g&U+KD7OZEzg8MQc!|f0Io$m7lPhUfK$7$EXf0iKaU%J<Xy-7TQ
zcIR)fUIP1%?!(s6@fU*Q*VWy(3vRcb?*6vm$n|yiNrL|n%x<9j-y;}9hd};T!RrLy
z7yQab`t$PzUlH7WW8ME+!8JG0-Re6d;Jb}(^i%f|jdu2gv@;;opfv#37KC`p4LXIJ
z3vMkqN^rE`u7Z0CHVU=~P7vHraFXCu!Gi^72(}8&7Mvq^tl(V14#7^rF2P>GqTph|
zlLeOwo+)^a;Q4|V30^9Ah2S-U*9+bxxJ+=l;9Y_%1n(DoQ1BtaM+F}jd{Xdf!RG{D
z6kI82w4YYEt?i8Su54$Y5-sg)D&yf{8xfZepUQac`aRa%KX4`7+#hg{`2U0m|Hs7t
zb6~^MakU?V@wVVNgXep(JtE#XV8ib*ze9gKSN0^HA1BYx<ntXg?MivB=DYCx0eOxs
zNh;p!MEHLy{_C@S|DawQOS}!|*Tj9Yxbdp3o@1y~&;KUwb<iI${8t?Pjj{uv2W6i^
z4;M>*?<S(ZVL7nB;krKEw4>wq)~k6w=4&eDgTJzq5svGibYCXnc)pQ(Qu|#IegnwE
z=erUSejjnqr<~yJ1yXP4(I4S&ljjc;5&l_m{}0IUJ0m~TBTRM`K0^dQOez)rJaKd0
zn&DT{4c^bhf1^4*+)hNqI}FHh2%^RBtk+H_LT}#}_haJ5mF4RBn(RmMd<+rcXNvpl
zK=v<Z2%aN|qi4$h62Z#_l|6v^xiR!id*?$S_a|*YJpy+iBAtDiZ@3pz4|j}E-(lhY
zsNI+!yw_mqNrmJ5KGWyAD)%$tRY<unBwEsGVY$Mdn@!xRPXC_Car$=x=>Ki_H{j6y
zO_b;Edi}fsCgIp_X`lU)&)==nUgdM_Z-1Bm%S3M2hicsj_TkQyANC>lcTg^_qtkv=
z`#i8{bhtb}TAm+Igq-Nkl|Hrxa$o;$<VU)D(~WfbK5X4rZ|HA-hJ*YWBJwrJ@W>bQ
zLx0sjAzy6Q%-5rQ4*qBP9Q>+Z0sqH*j(l;xoB7%iNPAbkH^P1$Pk-b`t$!gOGw6o@
zZ1Gq5si5xy(}O%qfepA!;}WKKPrcfY#{K-a^Eu>MK}7m5@j3MN8jy0lPdD`X5uZa2
z)jsij9m<K$XA2;oZ!hw&9Ln^HbPT;F$%Ayf^mrzpL*C1Pl=oI3<z+ufc^~0($om^2
zc>Yd*$Voj?FJBTN=NclP+HV2>twla1r$t}iVEk85*@-X9_zYY_+-nQ2FG#r=ZgW9Z
zZ{Qv!?$Ls~3hpV`DA*!6L2y68NrF=a4;Gvu$Z?11&K8^_c&y-D!4APr!7jmG!J^<|
z!IK4-3NoMUALi2iN72hl(F;)N1*r4_WcUW4(hE@O1*r4_93{_{Uf@=G0V=%!8|Asu
z3*1UCK&2PpBzdm%0=Lo&Q0WEOD$kW(;8uD8D!l;b%5$X`xRqXjN-w}(d9L&Vx6%tx
z=>@n{o-=>c3*}_}w7s8Bj|F=_MfiU5pk6xPPmOd&;W_u~?@l}d_iQjc>b=qf{F!gg
z2OY!bJC>g}IFrxcDz!7!?jZLx`oFEO<8hy8ySSNO?hoZYSmM3(hh4ySMtkE8aepT6
zUD=-S{3}2{H|&pj;@$~WhvUdhAjglB>3%(~aX%UH5hBJL48<y6AJL6|<x5}#UNY9g
zIKqBqBOu%J=7QT0(SBLaSRUU2Hej)v{U?#@!hC<8R0sTdy|!3zeXM81AHupRkn#Da
z0dnB6LRGKfR`nXVzWB2|7>?-?w-y{FI9kvsx2W~3<{hACHJ(Aw9LK2loalKp^#(m3
zN<Bi)C(#W#xsFJrT|+&?L{fVG58cr77eMNHO{ju;<~{)Gc{9PSiO`c__l`$CS?>=e
zqW&C3MEzlVqWgRz<hn-OKO|yb?61VVuE@PD5#iOihUdzDh5ICVe!k@E4hi>bBJ8qP
z#9dGMVLwe`eh}|#L_FuZD&5?7#^)~p8{Uemd%tM6Y{2~BxtfPT`2EG512X)tfeimL
z{SltuDWhJmWc`6&dH+!S?YM?ds3<h-vMp#|p<PY}Qm=;qsaI@8R(d_2&!N|>V5cD0
z6Y1Y4I0&R2rPddr_f4TU*6(Y94e!L&dH%YG>-BvLaN~*!ytme?d%B3M*YRJ}Yr9+P
zH{^x5_)d=W+dx&nfvSE3Rs9C4`VCa|8#qehjTT&8>%mv0+>armT)V`LEdr`sp9ivB
z@mG~A*UMQC_8=m>dS8K?>*1^ij{_N=>)Wgc-7Ig^1Fk!>9^g}Hs{Hw#5Y~qVmK)mF
z<}44?16+Nl>cKQ1>%kFpqkSF6=P2)X!TEx?(oFfEAh-y~dVs4|RQogfm2FrKuT($p
zbtJ=Kd}s%9d{E=uj;sEAQyW1Z*5_?0*Rs<2IxqjA`Q~`YayT9s=A4^f{f14)E1yyM
z50}28l6OO?57ayB!*KHkO@DjVuUG2z_ZW-3PJfR7tcM2wD7t@KZ{|;hf6s%*;_u3X
z&9Fu}lZW+u4<hWt2|(5V5Fy`8c~1L~{XhrZ=m$=w8{_!tbR*t{bX)AiYP__+nZL08
z%>V2BtDD}VYFE{Gl-+Q2LYpl0L%nC99)3;S9EVtMP7$>7#n%{Vp0_sq72mNT`PTH{
zONZoJ+k+2-d8quZTh8ZqTr~8vx`a3SIogM`Z;bwFwv_YP^oQN_FTsHr>H+MjMYP8d
zp6@Hxcy}-y=F?sUG92e|=uRLU>(34neiyo7CmHGW3IAgf?+<ii{*v=UjJFwike(s0
zvUhP_X(v4AIi@DTuL{l(JX&y`V87r}!3zY{K6&umBJLG}4+}ma_zaNp{7Kw@75BU1
z{;yz+dP2C7K+4B?EF$Nzlpe&*c|!X0eTx2kAEz5v2q@%xIsNB|o9~T$&UtkDtNpQX
zFBSiD#Q#EZUoH4O@xN8v#(B4&iT|VG|9iog#Q)FYepm3{;?MO4$}tk<NL)|KcN1~5
zoaw*2_&18X4M;n34&A5V{y)J!!BYis<U>8j7E^`a7ra*xQ-;d_w}O~jQ*OQ|kXP-O
z2gdk509;d$@5$8Lw&LDd+<dQOxQT*XFJQQX#I5$<;`y=S-!A?ILC&W$Jc1~m^8_yu
z|0~3Ovmly=3V*M-vE-}bJud!FiTf47*Tw%GaepNEh4|OueTMR@`>26i@cjnzY$yJE
z3bu$p@2h6`g9Hx~|0BfB^$k8>ApX7Lz7)vvGxo<nD$n^|P5)0B?lkNR<9iU&Zv(3G
z26BH}MldhW3*zSf2R>ga{x<>{Pn}~r3-=E3Iq(5_uJ+}^&HWJce_H&F{=w*H)i~s1
zU4Zrw<+a62mCt)mlyFAB#d$>bkJk|`{b!H(Kj82mL-&>=wJAW_e@75u$0;5he%h4n
z3jU*jwEJ4<-Vy6pbi?jb{Q|-tN%vcrmmp%k!H|djAo&jxe%1dWe3t&;|CjiGMmPA?
zd2#S_e?Iv+|4(_Eg#W7!{z;4nekC{LoKHT4KY{*RkJLV=8~*I~$iEf&z^~>T!JniX
z;n~koe&)w2|0MEM;D1l}KV~@at8+-;-<&+)=lTHoxz0-deO5F6PelGW<%0aGydnRN
zbVL3<fs~);A}BxCzpVOk)*m&GhfUpTe1hJe7rnf}bik|18N5u7ylNf~yh>k|dgIEw
zZS=fzC>P{V^?kdM`gfcm_iG~eM<VwK<{NUaEpjV)A@@!WeQ<q@?e<DRV;oiO1@k#a
zAv~Y=30@$$Oz;<iuM2)5xCO=$#!CtwD9HIr`g0wcc$VN*f_Dl&D)^G%`+`P0{l86a
z&acNXskJr{lboD?j9rTR=80E||5YV_<}-FRzH>(WF4pgecflSc-XP)8$s0T>{P!gM
z%@Y2H5+0qtO7|y@@DECOY>rd>KTBw%$dAEcH1Q#P7mE0BLakTD9!aS6s@N|??)&O>
z-p3rgzY^YG3-1%c`=n3a2ZR@w*W2=kK}zZ4W#N5AcvlMVA4T3ji@dLjyszPV1kA_l
z2{lg;dlTykbpJJ>O(MQ6`FT{*{m_x_za`y|CEZUY-Tz6tUr4%NO1iOny_`-KzEkS$
z`B+-7=i~HxUGHbs>w3q>ftB9RllWhk_@_GJpC<9okoadw{BKD7Z#vSy*bzTy`j<N5
z`%NDot5Egs+a-Of`fK=ObEd6)VXUa~y-oCdyXbkj==let=Q~BuFlriEe)mfGu8{Km
zp_K1^QocWu@-@<Z$C2*eB;CJDy6;N5?@7AvOS=D%bU$$L#U1(?A?1UQf~a<tkn*XQ
z@)=pLx2rYk^>&5B<2Jpl>EK&S_;5%{@vS3#>k8j`!iPn^J*kfk9DEx(_%;&0jfHO$
z;oDUBa0pAa`^|-K3kTnp4!*5~Z)@ShV$3MYfkRxXKI3C3if@$gZSUY)<lw7Se}fLb
zTJyWu!B?w%OB{S*<um%LUpn}9kn-43%44*Y$4*inJ4<=&BIU8GqdXpS@Zk`iYL{4C
zQ}u5T;oDRA_7c7^!ne1B?^h1KM&U~eUz6}P3tx-yjTJt8JV&(;BfpP3_;AUBl5c|W
zO%%R;gl}Kr+fVqu;^6zWgKvM~`>OCw628g8cYyFs5x%L8{668}O9|hB!grAH9V~p)
zgzpgH!$*Q_{lRY>d^3daP~n>?e1{2NtMDBzd~FWCCmnpVgm1R+9U**23g1z}H%Iu6
zcJTey!FP=CeNFg|6~5zy?|9)$3*TJfGs^cV2VX|`+J!GGd>z7<6TW%EH{T)O?;Lyu
z;p-K?6NIl%`1*yfD0~ABzNa00ox+zFz6HX!Q24rpuUq(fgzx*X&)HAjiuXt&>_KJ6
z-LCKNh%Lu_7yS*p?`{cyk0U%LK~(+6CQKFHu=}2o@%Q%*dGC|(k4Sh-nv7yPztPX5
z#V~oI`s?50eTx3i>GzSwUeNdd#8&F-EwMlA-+hQ-(}}IVKI=&D?~>j>B)tzMz5hsh
zA4_`wmGu56>3uHg#p-msZ3MnQKzR~%_Vk`}q*q_3>tke{u8+0r^!%+`r;kVL*XjA&
z5a&|Jw`rYjN8sa2wtW1-!MnBaZX>+g3-6A?yOZ$lBD}i`FD8!^@AFa~FF1IU!rLUg
z&BBYxCN+MJ6W$5JyRYcuih5li*I+*g^Kosx+8-7Be!bc!7F&k<R_K3yz1lAoyGiQZ
ziz3HM4mqZY9EXS;(?yOMBF9XTqgCXXC30LXa(q|hxK8A_MdY|u<hW7fxLM?QS>#yh
zkmHZio&xAY*@1tm*X{g2*X#A=Rgvp2BG+po*XttJ8}({GVeHL%wQnx=SN-0?*jx45
zT<Y!ZdaZ-_j=s+)_P2VqpCI;kk^fzh|9yx2{}A~D=uyf4fyn<)k^f&J|A!*~zeWE4
zi2NUk{2z<_pNRbb75P6E`Tr;Ke<t#OF7kgN@_*@&KO^-uK2q<Ww2}7yDJRd3_%X+G
zXZ#V4=SF;^f2wml@05CokD#gk43ns%SPl!N9(GAR#O4&$ez93e>90_ymp>+3ZS6SW
z;6Fk5amj+>?-%}}@DB+8BH<qter%>w?~zL!{Phn06NUdI;XhgUPZ9pF3qLNuQt~eq
z{?mm2bO--P2mcwuf2Q!CCH!X#|2KsH9N|A#_|Fr5T-KuWgLTKXsaITXU>kqV7yb)`
z|3cxvNcb-n{!4`a+rp2@ZKa>fgdgjWihnH!|96D{a^c73B2~WFY^M4<OpfnLxvm!e
zYlQ#1!hfysV_j15ujAmqPWZ1E{u_k<M&bXS@ZTi-Hw*vwh5r`e$2z6rU(dn6O!#jV
z{@aBAcHv(x{67%>JB0sE;lE4xjrza7ga2;fzuyrKmwegE>E{ye7mjcnI>O<S9c3T<
z))5XLkF@bUCE<SW2)D5#+%ppHS;_x%j_{i}!v8_SKQG~5aD?B~5xyG#W{&V){4e5r
zeXK_>)!FkI_I>|l;rpY5FYNr#pM>wv4!#jGe$<IQnGk!jUhK({Vo$Ci_GE+f=dTLi
zUmScJ3E#%Tw~6p=Dtwy>-{!)%h48&5e6KtB))Kz8g>N0<TUYqj6TbC@Zv)|bL-^iw
z@NFf0TMOSd!ndvPZ6|!AgwL2ixKGBf%^me2s`<w)9K1s~|H%F?jydj0#1WcCyCYtw
z-%lUM+T8tg*K7K|0M&WJ-Jq#+V!Rt=Mhxz?H2vOPRQhY^##zzFiR)^bT6bPg)3!z$
zaWwjai5qD8JUkZtuAv)?cWT}pFCib$y$RNZAWM8xP5%xsHaT?Bjn0JYvGFZ5jq9%Q
zEj8_3;#QirF=UQoP@P1?<~9uFS{$1-Ff?fK?KJH{;wVjfo47r~bKP+?!V`A_KXGS-
zC+-4%A_fCY$!YQ35FR>+<50jPA~t{F)k}--iSWd|z)!?t3`{pIzPF~KYt`b7nzkPi
zo60(fSme8i*bKcAF=)L(9II(-L$~p9nl^zrUeo3hC!idN6E%(Bp^fi@av<)D@F;^g
zUP>kqzXE>Z{s>R}D)@<$z)zeEc~DmI10WA^3gjnFg*?OqAwTgTgeOizc$8`U5bzVH
zgP%A9{KP}SPn?PH#8!ky*~bqDKXDfLiL;>}A{HGVA|8qGL@a*syQJ|s2v5XfX9p3R
z<}M;)^V0pqV-cQs9P*306h9vF5U~g~mpB*l5Hko*Y)5!v7W}Al@ec44bC8EP5AqP_
zLmpx$%9of&eM8-hFF<`GE=2t#c0nFuH}pg7LHQC3s1K;a@m|yi;t8lf#6HwdVn6CL
zu?T+R0QgbY<AVrKTnu@LOTbS&5%LpHLirL;*0eRyCgP`PS_|>($S?6!O*@CURMYMv
zo~CIp5>LmP8`@6%3{7h!o~dca63@cEL*m(*wv2d=raebISJO1KvG{qKwkPqMnl^`c
zKK3gUF91LBLhuv61%9-}__q<Bc&Vn%CSC@9;&(LdCgSCq_9XENw0q)}X!n}|uR^;g
zUJbnxuYsP3-$gkPuZ3QT*FmqF1Fwgkh&Mp5#2XQw_&w;AcoX^w;?3aS0{DHDGw~MW
zo45>e5pPBRLc9&-N4#CrRuY$EeU<nF#NQHl2jUa&M1101h)=v5@rm~!KJi|}C$2zz
z;tvsjE8u;IPy7+$6YocS;sc0J{4wGae}eeL2N9q6Q^emI_%p;O{v7d%4<SDBVZ<js
zg80N=AU^R?#3%j|@wWj!hWNx^AwKbO#3%k5@rh3$KJhn*Pka*fYg^!NQNM^!p?(p6
zhxSB#TGN&je~<DcK7)Epd=~9+JK%Gu2gE<1-VmQhy&=AUdP95>=@4InoWz$Q=P2MS
zkdwF)auWXtIf;Kl{UrVw^^^FjrfJ&)|AKUguVI`azK;4pd;@Y4--MjRzd}ypTblL>
z@okJxI{@F&v{vHZkPh+h&<F8d=!5tk<Rrciee4MQ0Q((?|3v*Jeu(-?{5Rqe|ATRj
z_z~(i@nhs`H1HGDZ{mM7tw{Wzrd?0`3~~`ahg`%jAlFVn4d+RTv6!})h(-RJh$CX!
zlf*<!`-E5@(?;(M#HNf^;u;7~Tod7m*hKLt5sU2~5ZA$X&2|A|vp^$py_j|^5t~I$
zCT<wht|4v|(;gz?(xi8Z*vzo`u0Sl-PaxuO>9Is?0y&w8&2QHeafs+4;&w6Z4dV7O
zt!_8q4l!+4;^>$*o48X<TT0wHrY$G#64PEJVlzqI?!et3A8~i2L);^#okPSXiWS7Y
zV%n?3F)?lJJ%HG3H-U)DX*-D6jB*hXn_V6xHpjHLiP&_r@t(l3F>MlYTukdCVspV2
zL~PD@lsFOkB4U%t)_Vc>jcErHaoDR!#3q;PiTk5Gh}cZ?32_q2V+?RI%7b_S^h2By
z)0PoaG3_}bjH1tohe9uV17|`n#KWK$Vk`7Q#G$emiEYqJBXAb<LYxh~5RZUfh}bl=
zf{0BKuM+1#FG=9h&<pVx=!N(-=!JMJ^g=uidLbSUy)*&S&<k-c^g_%)FT{4}g_wn2
zh&kw`88{DmA<l<hh@GfE#5}?i7l5C*5c0GDyO3XEH|jUB2l0pn#3S}19`OX!A0jq)
z)QtsVGvuzsBJ@PWX4R94i=bEHAimE<T#RxcE<rhr1D=R<h$o?45Kl(CAfAG9BYqv>
ziKim`c;Hgxhj>~{>m;5I{SwcBeu-zsw3WoOV%i!LfM>_FJ&E5yc@xipT*PxB7x6rl
zH}RV>jTfNB&qq4M3y==+Lgb(LEz~FCMaVz#V&tEA3G%-W@Y_g-cq!5$UWRzY?;sxW
z@|gBG@rs!CZ{n3GpM8N>#kBp1SEKxi*WkNu#Oq_)UBnw8AMr-$f%rYd+YfjX<Rji3
z(|U>DNBIzMfqcYekdKH>r)z%&cpKy+-X7ED5SJqz;t!Ax@eZUzyc6;f??O8J1Mh}>
z#Csqg@m|zV;tJGH;tx@uiT5F$uL6G*(^`l>M*S!L6zLFuhH@qT9OX)U2>llEVbtqM
zz(>#yh`)$wbBT|lT#3Jge8k5fAMsa^kN7y^O$PoN=@Fkmy(9hxdM7>^(=H|c7WIPo
z6zT=>cc>Q!0G~!Y;_s0j@tK%*KJnR@c0chs<cs)+n8po*@#j&$i7%jhi7z4@;!7xB
z;>##s;wzAkxDxuC3j8DVNBk4?LHsl7AMsU`7x6DBFXC$`FXHQvF9m!9@)6&Je8j(^
z-yyz*^oVbxA1A&8If;LRoCgB`j`~Y{7wwAp9^@pxk9fp?Ku+QZX!pc_BE5rv|3dzV
zAEI6n|BZS@{13{T_!0C-{1|#9eu8)h1OJP7#7_~A_&>Bu;%6v7;^$~*#4k{O#4jP|
zG$8&PMU2I@NkqKB&LxhBYfFiBaqW6yBCb77tdDCS5V7fb{X>9j;QTwW0q59>YvTMl
zajm#^1##`T_9zjTi+w;`7xAV8v01v2xIW?$H^4b|;)b|KjJQ!;yPvpmTzi9vP1SWX
zfSbm((ZtQ-+En7^I0sL}X0`K)TgJ5&#I54mt3<vm9}3(C`6O<Od=j_AIeOx#xONV4
z`?z)&afi6}B5}vK_6cz`&Xvvt?u2vw#GRoZ;x5n+ao4!EjJR7|dzy&N-X9S6Kt2xx
z?umR7_rke;;uz?MxHt4l#HR2kiP&WKF0l#cTU&w6xL<(Sg8LGPxXh+V9EbaGiQ`co
z#0fYbOq_`Gv4;cq!TkipeW6$4e$XrND~LzjALT*Bq0<kDlaRkQ;AG^FcmU)iPJx`n
zsVGNc3gtmO5amHU2>F`@#3V!`aT?Mi9)k3U(@~DZ8PF^7(73jeI1_Tt1|9}EiLJN~
zfp|E|gNV)X=MZN>uf*BV5Ag`dOFR<ieUAX*lDY{*Y@(k-JO=U-u{rS?;<0h<A>wh6
zmv}tVJrbBky2QCimzY7i#CD`h%%c7fJ5Ya!In<w{fb&rAh@HqMF^_x_7sRzoiCxeS
zu^Z_T3rKGcuovY>JOOeN`*AM=v55Q;2a!MGV&spw1bRIhcw$^@A)bVI#FJ6qh^HVP
z@$0B>L>w0QjCdjBI|leI+$%x62=#?{G3pudR@4{bZAgcR!}Xhg4Y(Zbh<GR35%F&1
zhj?#Xdyx1;<cIhp)XQUm4?r&BPjEj4@uzX^OybW`&cugN&csI`7x9<S_i?~qp&k>T
zKt701;vNO!Z_(a}&!BxD4}2E&iTE7&iGM(N;`0bkd;#H!FM^-=68O`=m%&e53H=iP
z1U(V|9M_&BzKZa~zaacv;Ohuad=vb{zk;9mHu#BugFG4F-ysk2UC2Xx58;XL$F-Y?
z|3EnqKL9`RpXg`Wf&YSDi65eV5&w<;iTEGX6XHkE6Y=A?#*OLmPf&iu{~{joQ^X_w
z5AlefLBGV$ksk32oZ}~ciT2O|)UcjUjNyC+F+M_DN*pmlyPjA#LVJjq!1qUp^&>Pb
z2OK#<8%11Wgf@xTFhZM4TyuoBl(^Oi?Rw(ch)-Mx@rmmq{ygA%h)=|!^hrcqQZSc@
zLndbuH^TV^;>I|qK-^@6_BL@->^GPX+zk5$h?t~2n7G9Vt&_Or2<;r=R)|l;We$%M
zw?TX&4zH}y3EU3xiK7soxIN+%cR+mNj`(f?ar6jnC2=Rj%L8}Dz69bf&=+x6geUHX
zdyR>^<2(g%51gYR?uq>m3xInepTsdZk4oGd_eKyKkq$9ALVJ<egnOrm&DbBY5ZD6w
zh+}b{oj7iUb`fzrz5`C2fOte4zWI!}5A@mv+;@aFmAD`BMf?i%O57jm5x<Ij5ho#E
z-N4D%cOf`OaH-%j!N&#PCLVxzJ-{j0w?UkWds&Dn+>1p#5c($`G(vlhcrePn0Gx*K
z#6xh7i8vi{5obUy;-Qd>I1~K6z{8+#Vk_zg@o?~r>C1JEDdrXz$E1&$Ijh)|OwX8h
zz?9b3^yCAkrDsk)G&QSr@|09^VmjTGZ_oDjru%z(`|>@-dFifHYj#0vvJp=T*-Te1
zU2L76Jux_8roTkknypMYV}g-<Yxaob_})x^f4b1VAeSws`|~H}k_&=}Fus(h{%od4
z<!HKHfLY13BS+Icbu_+bpgY|=P@Fb6b5=SzvCv=a%VoOT2j->o#av&eSm@KAB(t5F
zzI3rKlP~s98%*)fxQ+s2re?LI+Yos|zR;g;&-CX~gG;pTTz9s2iCwKegvfddp`O@;
z$W|628!YwtIYR~cfGR*ts-R2@Z426hi=ZpOO@vAch)jg2E5hPcS_2kq>2$WZq&Js_
zg3{gX>FhvXx;qn0s3EBs!9|F?V)zzetWqJ`{8+U2e1EEY&~Kq8n{@5BFX_p2=WGlW
zyX_|QBKd3@?J(an-@W@mKQS@W#V%a+Q0$HJJ^i`9VrszxhkTx0A4UgueyV^|N%X7z
z#mxL%QySw$y0<Uao3i(6t%Gghn30Y!&+95=iWqnby{W;r_O@(mwhi6J;9%Qy_Ivhh
zyS8_Gwp9<<x}a@VD&4lAHJotvZ0n-sDOVFXYZh#3nqnCPwf6vE*0BkwV}tpQTu%yP
z;;d#B-8$BLQ<PP<@KmNW$wr7%EOZqHbA74S!Pe;x9S4vmJe5<Lf!^Mzq_I*(-y&g^
zrRVn*2Gi|J(wUx)G@4XbCYwVG<)1QTdbU$X!%&8b%@Tk)Vs99<Po^{-Fn&>Td?Wr$
zo7$5?eezv+PL1p3?>l-~O|+H0ZyKi*dSUsF?j?mm6McD4>>cRugaw#gm>Se{>pENL
zS)`?pnN?)>TI^JnA=8moJ@+E}FydYOhzd)+D_!Wx=Fl-07B4B4EXsXsaiF&=H|>za
zR3Dl?XvSd&OrDWW&rBzisDSe_3v=oAd{2k67E_B_DNje24jF*$Rl>VLD?52eY=ICm
zL~aaF2BVkuE{LXd8vS8Uq1cIWITcXus7=e(>A}j5>FauPd&hAdZD~~?!>;c**#PM`
z;cc^+@7B#w+BJnf7#gsLn$zjUDc{-fpvjsvQi8KPdnTl3dROJ-SW_6oGGo)3==Rp(
z+Sx)chU7-28P?Q-XE1n!sU?F$npz8b!$L<cyQr8RD9)RJT9jlZ&2$ZBmh_`>vdd+i
zs$MdzPgW}OCCAl3I9}MMP3@mLFtNKGR&Nm#ETIJ~@#UlC8_Y&3U4OK6`AF%qQLrVQ
zwQg#E=u-8lb~P}TOP7yay6}w2v9@N$7B-_jnF=joIp5U&s0s5C6C%frQRg^XLgcsx
z!U>p2=pE?EVh&L+S9H+%?o3y@w}9CMf8BA3BO96{+1Op^$t@94N`)9goaFct72e?V
z8JyY}t-@t%qjC|hMn<b}mg*Xv=8WnUhS4e<@>vU&yXHI@t&=aFZwBM^x4ou($G9}6
z&+@9q2aJhc60cYOnu=RBZ>FVQ=ugip^mS+a^0+8NI_FSyj$&dbABx9CEUDe0=&WK%
z)egnuB33PQR<Wc~M<rG*bXKt}m7ym$Kgzlln9eGer7{HOaVf-F=&WK{Dnk@v)k0?#
z%TgJl5UUnCt5{OETF`IJ>&s-*9r^iKTlLuix|Cu~d{)7vIz%Q|O?+0tq(Vd{SWSFZ
z!K6w=CYU#$uR(Q2GRZ+03ro4&LRF)DMr+igxyACH;PIH28cbo{)>VMOR9PF<FwSyW
zb5MOgC5m}9mlTI%w#y~iKof|;XS}Q_`mCKzdhNt(NwG6Xt=1cZd$hoHaWFL@osNhr
zYv&rqifzlo@YHO#B!{DFyQMqCb=#JtwQ_scwj|=1v+|_{0?zfoKIq^)YN4+K>%OvD
z&{u$8hP&UQ<MdGv+@!>8MdVU?a8{Raf}up&&lY4&L%pk&tGarkQFQz+iC0g!l-uAP
zuuFnIt7_Tu(J&_NX>4G<#%vtb73V>tmeLfBPz3Lw^lg+us+}Qub*ZDMXO7f@XE1nS
zJCdx_V?|K4{HIo$aFt2hVrOBXA3Ih0)BV`}<!cSC#37TmAvoM-v$&)ehRXZBFf60v
zJ;zwMh)6hjH;h6!d7BGM<*qqnUNlU09h$3!%0)PNM+}=?t8g-NKq}0j=8O47Ic!Xy
z-(wgXK6)k>0V}ckV6+NosU;B#Scx^DfR?%!p@5ZG0}5!VEfES>i8Y{rmfC_zx=i$S
zu#7dJfR@@)M&;9Ra%m)$SOW@ZsVxx-Scx^DfR@@4p@4o_Jr}Rc*|H1{!gM?Pyb96u
z*)rEy-Y;bymZzF6i-t<gmYGyiM#1g8;D#)wbezcsvh^ZKF?dFU8??1%bjVY*j-Ar6
za&8*OU;5JhOS;<&UCwImU12Ni190IC-X+kWbRnv_OLgH4D4cYCE=1vl^X3dFoOFAU
z3g?g0vqzL&0GJHQclRcf-Q0OSzpK!mDXVSOC@{@bis(Zz&fRHvpW{k0j(VlLay|2l
zo&H|t*f+axhz!G4+P&!54OttRV=H7inZL?uN@w2-Sx#47{U+5^`$ovxxa_+iYvQtR
zfeb@czQYjvAHxuNR55OT3`18g7xpQJA@Y(dBwhI)MHz;|$W~5fY<P@_O?Ep*!zMj^
zG-S*u=M5ralTD80Z2tO;(qtDp*d#hwobDRv<yjElXBbKpm@jiuRPSosrplZw{_;}6
ztZ@<s6bqv$Z5k&_c(FVP1BxZ}GCHw52m^{GHb-<~c@X*#%f*VISh*h91X9VXvv_o*
z(qMvdSq4`7`G??Qm8cx{gOkc%H8tt%)`OF*y1GmvhwV@clihNtfyr(+1ScvVoiWS@
zr}3y#v>AevmCJ-7J~)k+Orgli2Y9g-g3DD-W!MUlaEYZ51(&7!4Av{SXOUJy6k<&k
z8^OutuU{w)@6zEF`v!76I^gdGtQ1|W18ejU5;URvo|ozB4=X}he19^?i*SpPaceBk
zS6?~qjf^*EyKqAgF2E>e+PjqId=VJ0-}7+BzL>;D{6bIq#9Ut?-H)4lavdmvin~S3
z>wCsw8$R~)J8e2o!I4rnP<Z{YfJ_rKsc8bqvHvu6j`1Gxyl1o6Zy8%e(vG9JWmyhP
zqxKId8X5V5&qfBH1jT~4HOV2Ka&@E@JcGd}KOIR1%3%1^tZgoEMNmh(=Qyi#U>a4Q
z6wUC~Cu@>{)E%n!T2mXQ`eaQqPzFQQC#F{Ex(yh?U0vAXhr@$Y$5siOY%yji<xHOA
ztaS(i`x`-U0^2)4@aT5SKSX?+y&pWj&C0JD-7KrDURJj2Lp;Yw-Z!X*9o!``wW(?m
z<H9I4W@9#bphu4oFddBHDjk2(Y^FnqcxuK!c)S2HN|qto2o>lrV`gbdtV*rWyl+SG
zR|=UNYaI7A55@)&icMIx_i(YDm#S42*Yb{Sn??wr$Ev+fwK`pr!O`3JFUxWnLQ|R2
z*t@P8WGN@ARDsO&9erO70=O{wlfd44)*?YUlP?ME{cjBdge5BVE$Gwzr;kF^N9{nd
z%-6iC&9=Ok36xM-FB2@by_b==mC7^REp64c5b9RM0L7^9p$~UERp4a8T_6@9nJBi1
z2S~1@Jl!x3a<x|AWT?F0_IH3}%9R%~xr*%s^Cdl*K3;`aEa+D_%~+5em(shQiZOX+
zj(20?yl|mASX8$}o0~!>YDV>EhIucx1t}fR?UOZ<=rgf3lIY7$0Z7E=p27jAVyRnS
z9g=<n)Bdj(*lzXv4XxYyK0{ZPp)~fwLa#<@j<`O;maO?|tmWgZ5Bjpv)lVGznCc^j
z#ZI(a?p5<tZI+-KK`CX2kzFlfRV%$3ftj-1q^=gNEZtzy%~TzBbl_wI#xJF7x1NKi
z8!Wz=uH9%3oNTb@rPdCEvRYaY(X_9tg)Ldt)k2oHb|0dYwRS&o?5*8T47WjASq4=z
z<!u>Mjp~-D8s4kMbWPM(RAcO868<a*`&iW&IG#Rg`HxqsspzHyMC;D=_v3C?ej+14
zG%o3yt5U^WcW<!hW=jc_XlaD>pTF|f6DY~#SVKRSsjmR3yG)z~h;46>!2~bg8x){;
zJvK`OlECb+o%8(x6j045@K05e#$g`#rzjh+r-r67rLm9sHOLZ{$dtrk2Gk%*Xr_`Z
zcGI91S;8`zve@l~8bk?CWZ&bDyNZMK)E-Sa7>U~+tlGPisreuoDGhM2O#GL_1fv6=
z7ARWz02e4as*h<3`j@q26#9=-KEMSMw0wXI7Tr0(1&eJT-~z>+s4jaA`5~|X^{0l<
zjRi=hG%cxbNN}5$R8O3r5y8#&0g{pVLd+eT=8U>Xe~6NkG733|?7t1v@TrRc$}8Pn
z6MWN1fMm+&bcZxKOFIfNBOb7fxM(q?sg&B$kS0^!j)pWjOFPojal5TYJ+XBU`u7F{
zR6VmD4QVQ+b~L2Pl((ayP0npvLd}KvZzKHXkjHvS01`Jr)Fej$4p%{fl9V6n4p0{>
ztiS}w2c{{E-DmQx5Ovlmh#X}UvOm8z4t-yK5Du$0^#fKxVtX$|1<<Bd1X+U$5ZgtB
z;3Q?G5dnpqSq!4iGBM;7LJ$tCHf1rcHf;tcL03`w##uJgUo^i{=6k-<;~vPVrH|Rw
zMunFGPb%zQ<o%ANue9~`WtOCSa)WY+-pq~MjHYGU3w=dxOt#S7o$JAm_Wpj{NLk^7
z%utYiR3J63FV{cNWyU$^$Uw0`vpAE+j@iZeB0n|Up97P1!?x!}%o)v%+0I;cVXi|y
zFUm!D^=V^%H;La5#aB5UpHsF|dvD@4$NS(GCa>OtUGMcBVMp$Kh!A{mt}a4XzGq>s
zZ?8gcF<<EE_fg#D%{p=obZV^nVZ^Lh=vCrYs4g>-wri||C0Z$JrMp%=&y{fK*YDGI
z5yZP7gY$)u&U&wQ6w+1Tt5{x+i=9*B^!t^4){`o+E2eC}8aiOYl_Q5J58K_+Zo-79
zFX+*Y+p3+6AtbcjSncFvdk!q2J0rdw*H<hIX8Se#>XDyt@+W+Znh_#B<D-kIq{$LW
zZWo>q(iq=vtW_Epo)FTgJoTj()hdk(PY7vLo+6OOg(rkGDo;3P7m04{JRzh}d9t&F
zs>LomA*4~d!6BzebYtfUA&ttDoh7_(44xTd@HKjiA&5^~_Tjt3+8A{OiiU^T?p~Ur
zgmgOB*Vj|f&|%^FDLy20w=1yOsovdX4HM<+9@hb7OxnL-KiF-_0rnhvr(T*=3U14)
z+uUHxD!Zp6v&6%wZEY%s5GS}@JEY=-&<+pQQ#(s?nZ8x6njw>=2EFhC{?$b<k;_tp
zUbsJKb<s=YvV_o!yszrkt-5JpR!bUx?Ok5mf??}tf(cZ0uEcx+mOE8bW7QAC^yQG|
zJ<DNy0LndX#hA8RZG$CRDQczBrqau<dk#Vk=+--S9T^KDo%Nbs2U{rVT=`~j!o8=z
zSouRQwT#x4r+wIXve_}|^gQ2VwQ0EML$%vlxO(EUw&rQLWP_z1ZiT$ECfb6F5ZqRY
zN(6Ij=U5mU`TkVv^ubxp=~mxaNZNOj45mWzm~}z#-`(nhdSa^!gV=<TN_p0W!7kX>
zFu$`4F>kvN*ZbtV{93i9I8j#3E-l|b*xQHCJg3#q#p*kb>bK?RV9B@iYfycsS&!CL
z7|iwICuTj2pZR{{SFvFHLRtg8y+%mmXTIO~Rm6pi`eVF&ES}fb4NAO!$S=gs_TX(q
z_e9t(^QZcSINWKaKbBvJ)83WoS*Ux?Q`?kPM*Dkl(U8H^)q!6Kn(6B8%;0B`x11qq
zuE9l!yt(=o!PwlcHmOe>=+B{6;|`~kgTQmRx5dYSvbO27lIhl&vl`Q54WddX%<R#V
zZqaSUSxpXZZ_H!R%Ah7?i-kTCHag@9M2O`<+$cR>I8%<Cr5E-0sP;FH9fCHdr%=p|
zIcVk)d#O$WXX|<f7gRoBXFp=>+9P3K*F@x}kj)@N*qxtBO~f75JjB_)B(*^O36h5E
z2xw1(+fBwH%UqLMfF-E~+8E<HMb84D=5aLzxACRhGyOTb_3vS)=XDkERqR$SZh^_y
zTAAZSw@;b5>w?#p&F@L)78i4UJ-Gf`C0eNphD&N(27O&mhfeP^PcBz?pv45yigS<V
zU@9Pib8rn7-P}rT+oK+g!)=#qKnAB4vbAZU6un|KaVx!~kLu-=7G>rqT3Jc?h~!Z|
zK4Q9-il2DS+(DUsqS<p-isY{)nY*i1#p!OZ+{czeQ!<7Q(VI1yy&0@6y)Pq?wKMac
z(lpD(ae!tbOl0{;KpTh6=~D-0jZKH3wI5%pk+$rJz+lSCI1!6rMSc{th@LBmxE|*h
zs<InHkGFoyB*vMDp%ghP`f|DRLo0VxdLOzj+c1TFTex(*ioU}T%l5pXVAeP74FR*h
ziERjoWoz3|FzeUuR$&g<)7dNpE4Aw90`(h~-ZNY3d~6l27E;@}GA~K1S6@>~+v%`s
zeBS0X_p5QYSm{FtZPR(e!~VkH(=bl8E|@hT-R2lsyc0(or!CL5B4xar+wZ2$OQmLG
zpvq!SCknb;v~(RI=*BI|@lA0WUhUGx>!|+fN_9gM{r!b>>HP~CpRu4BS6-+11$B7~
z@T*vZU%gbqc&VjG{ia!N+NrmOVM*F)9S&d0b^~+x(k**SP;VEjMA^favR&B`q+97l
z%-)7LWfZ<!to-8O+H!_8L6`P2r0LlUPQ959r#jVp-w-C~ROe8qXIEzgsoCByJ%?+1
zi)c#u9T`gJuvP!)H=1eb*lawEW_}4u>8h@xawD{7E{Q}cbq*zJRhcUX_Q;6;G*k)u
z&2<wdCk>-&pof!`I0%5rgxvhTOjpUkT4FU}^7a`9&l=EVG1xqr7l&f@Cv|ZMxw}Jg
z`_V{OC}w{eSrCR>D!Z}_xo$B%o3B{ijqqyWM8f;)Gm=TQIXkyRKX*@CR-dg;wGOt;
zYD&Y*#mxU8=66*8Y_962+V%cgKk}qz`p5TXikxgu4Gz}QmosiEJq=4B2jc&!)XZ52
zD@>(k9iEnk&{x2=s0?=`cs7OqJ2PgyU;50J+PQ9&SGH7Me6O~a7Z!3Vlvg%eOL@(j
zk;dP!1+&`aplS)&2O?SNL^JW#LeU#x84*+CYJF72^4Cs{7Ov83OrvG`N>5Ko!uw09
z)Ns_IIKBmhRmM!Q6AS+No_PhSNFq;)TixV~i1tpPZICk!;Z1Txov3<&$<hl<F?xYR
z(z6apxA`3sOW9HPE0<?SZy2jIKOr*1vf+1{!j(<7wz5Ibtp5!mxVkW+TyVdo5Q*dz
z+i2(Bs|lrhhHxkfD>OJZ+Mi1WjEerv8r3>`>e<J0frL|T1HC*M+LKnhb^1%Dp}v#J
z?Zyb#eFL1L%D2r%CxAg=fpu7zoyHTtrezhOf^S`kKq%L~xR$}pSEp+4#A{2=U!Uyg
z{cB6IlGS7+B!*;d3HdmTt$#xeMyK(u^;B}cukFPmsC&!`W}&UdI6e@cYHlBxXQb|%
z!}0Yvza+_~^g%NYJ76-l*Un5QTlfjOX&5cdMe5WcQ+wL+@{nqqou1l@)>|X7E#s*}
zB4oC{Ye!3LUi607fG8!#3%`DsTg1Gjx1)%q?Z{;p6>&|V?FR0sRU(Pl_Ye$CBDNW$
zp-IAiXXOy3VOujCnlx<7h><2yYPWbjjIzR(45x^R&2}3xujR%x-L?v{OFUB5ncKrx
zu^gpa*H*D0mW$GKNdlR@QPyfzH0qU@FSQd_nH;s8w28E?T3U^6{JXUp*Nq8$BZ<6d
z!rep|sT`$Nvx*gBX*D6<%OWotHCf@=YKEnXlv>RyR)|cNsbe?O^euCd)<GM;eyiNj
z@$0+XhK^sq|ICelQKnx%aG{w;FL=nPSeOTo{%ocPFLKt&7Vl}E8v6ArXXS#65WH?i
zC4!|h4?f~s4$8IL&pr?40u_UrqE#J*+gPFm3v^B|$Llb<3yX3%ugB}!<_~20I?|{Y
zxlF&^FOxlCAm1m_<~s3tvrIQbbYRn0XQrp4i;s*|rwVfe=KFiHSw0M(E@s-ha=e)Y
z(+l~oV!lWB(QvDsKK-HL?l}2{gIDrvUSH1o)2|vW<)~LCH${5&xZdTM4PK5lC2y}q
z{!_OMe8J5{ds}kUWXzoU)`3NeT3d7tQVd<k=35b_2(_xgULS&#g%Tm^ex*YnYdZY4
zN>hj^8%40x!@arKn?zYD1Q#LliqOGJjd)KRP=Sw?9dn+J+p_f!VWvRf(_kn&nQmw4
zR(piCzMPJgX4}JU;x<oYF348g6cUo%*vjl%A0^Ye)-Kmszx1mg^l~u=-yym(s&Y-Y
zO5$VX(D;znw5Y4QRgPd98A?g~Y9#7zxOKX^8^mwJt>yLHVj9_NDNZv75+Z5&mMT`S
z&;da!YO@s&{zXBBeLxnf>Sbe^td@Q(>uCL+Yt=Y{E}I#-9RXY7a3*km4!cuu7e#Mh
zu2*dknUF8^tKA_uFxlo{_I@#Q>!tNuM6#{ENh)>L7P4?!($BvrX#x;%LxB1w01pjg
z3y}ZJm?f2L1c%(np&vr^+Xfu^K$(T6a!R9a{fI`I5LBj#75w#;)mCqZ?)z}vF7+Bz
zr=R?4eW--PR^HWDIPBM5eTBo8-&HDH6LxM%ol__4@;&p@y#@4|rENaB)n7!Mvx`uR
z!C#KTwA^gCmK(8f9xZqE5YD6Jt{%d9wA^76E_};foka9#xo#qQ+J0{5;&5C!-;;+y
zJKbTT1z^dhLa?}hiv|}Gv;>vMg-KsWiGoRAF^PgnUmFR^)P(aM`sY>p271(MD(;EK
z{a69YE7ZyJDWy-oOq<%13X-1Xg$V~@0tjkE#MD=yh{h(!K#Ad9&Uov`J5ZqyZ$UV{
z5-45Q5AUd>am;kZi6kSdc$d`g-SHQkno-yER19wDqk2f!9H<j`Rde8`KXtCItiY?j
zF*;sq937E&^vdr>zG>Xwi+o4-l0ttc0*&uiO?}(C{;C-^c?XB@wDo=OM%oqYZm9lb
zV(&nIC*~Bg3scBi)tii^3XhjHIj+W;(JEeJ>>e?|%5v0mUhTNjzgXb^)ptnjZ=l|T
zEN<cBs(5-~ZpmPwucP#q;khltW3{!_<(NHhb_I{)c0!!oGqyAHvceShFk>$>&i2ik
z%D-*XXD4wUp?&CbpiFk#dNKA5a_C{69ks432P$YO2g*5AIcOc^r6UfJT=kD&{<J(L
zJ?jAejZDk9wy|7BR}I@`tf0rrGJ5yZ=4?vvcQWs3T+~DEAIT7xbSn(d%7<ii&CxWf
zD1;*D3US+-=vq=}43(EX+JcJ^d<{rm;vs+9I1fJ!r{DF71^nMW-;TB4*=c*9F(ir^
z4yi)u3TKZnZA4w^=liFb6A7zMQ$sFO2tDajy0$uny9rjqIu*54(df#Y0a|sn%B2LO
zmMVm<%Idl~9kuE-HRLjd(34B);mFx)*#4rHD!8s>LXmxyeJOyK?5$#r4WDdL>Mge#
z>n&>8qSTu?DZI-1GVl5pNH)*+V0oQKk7>EhpXY8%hvC$_>Y`Sskr{&0dVDpNih|NS
z02i5%<|Yfg3q&EI+nPXR)P_Rw!2^D6OML?&8mXN(#6_lG$826?yyl%{&O^Zw6(ba)
z&I22&9-3rIxp1619;#dnNit?G?8lmiC=WxCh?xV&sp%og!jPm=%7gt>_E6<vC{i)=
zU_bReL|GV$L`vhRn)r)iNU<F!k46>Hvwi_YWI~#YK9LP}*jA~3n@a|}$V5$!b&jLa
zQ9H-c=$M^%sz#(|%Xul?l6E^UrJmRp64W>j5hAfZ%=zq9CP8Uu^ePh}IaV#7W4X*Q
zIaZk{mg8Hx3~m$Z>d6q-2}}v_9?YP(4MbBbYdO{tQNxfr!I=@m;$KzTu=EqbSDhkK
zhuKf8G6_ok#3~b^yq{QQqFDL~T?V&)LOrqd6KYJ1bnIY1vC1SU^%JX1gz|o3)rq2C
zh-|ywA)5X;>9Q|T?vIEl0jub8b3{bUE}}=9fK_z4lw#;ak2V3T==z?{h=vQd3KJ#)
zOE(wX7}1Zop@T}b=}Q^*i(VICIbZiFO+<3NKiN3YlRse~m+md%Q>U#5E^1u_t+cfc
z&N@^U|4XMIJ!fWDPr;2XbbiDR-i-y-HwL3JeP>Jh&W6<Y>LIvs!{%WJ9ykl1tC~Ie
zfEg*@dq+y+TJT!m%nGm9cjxXEp5W!d!zlp;3Ac~18PO<+U5Y_<&@_w`;Vg}+>d1yt
zhhE9tUf9(W7o*Ev9r_Vo>@zNt!n2Kr|5(^K{lmo5TCwABMxNgfTZB!K6CJg|GvRQX
z1kFS-Z-L%*Vy=gG(xmhArp@W^;|EFd{poCPFZMj)V*-P`BPWk9IjHYU^N#4Ti!xmU
zIrQLT)2Wu?lHObj0uQ~+>dVTdovN*?gYd33iz+RB8IJb7d=}awJbZ^=^Szc2%J`I=
zQaUObdd|i)HtTZh?5uI=!&vf_c69f4>2D*>23W49>WSey3C_0RW4mAQ9=q~BNL-gc
z3|kH(lcDT;vV*Cy*fp5%Nwt+eoXP$U7sBHotg7+&G2V9`J-^`VGZn)G@-9h!Z_!wR
z94O99j+3kMhBg88#y%79xiwg_FwM4RXCz^MtTa>^m`g>Dm04Dz0tS8gkaWLM#`vVP
zQOMQRUm~|Jm^#SwF603<<B;B_8}$`zrJSk#0faBB{rF6?!RuQ6E$sfJ_o)8?(y3kq
z<t;!ygX}jeVUwuV2m))XRGIp%-|aQ>VQ&UCu-mJujowm|@@7r)SJvgVDPN^F1x>-L
zHu+B{R8i}nzBbh4-Y`m837bUK+EhxyUwM>jlWhUs$cLjg1!XTQ?Ll=yLUpKC6{!!R
zap=qjtWF+<?LV0?1))z9nw@u*jD$=9CG9tbfF*4kJ<T*!NxPJT5Aksr&SG3lz=svw
zMMq~O7E(mT93&wh`6x4zWQZ_zWG!j8%!EzDtE}D92w2$my+LM9RB4B&FKgFR^BzTR
z+B8uWd4PmM6^GuBn~Jg(xl3lkrr}xSq0;c^#m!vk#a$b<ZF`fQ*?jXU6>@dGm@?al
z-3Oi$ueJJn&gxihQ5#Gp;gVa_)Oi5cd(;N;eZ8@c7dB7&8N76k*I=aaiB9gCU8K+X
zb{Bf^;m>y5g=~JiQ$4Vsjh)T2y-C~4Jd)O@GfJ}_$_t;F%x0-v{cYLD9Q~>i%_wf4
zI>YSE>Z-Hh6RoPwEY%oyF!-s)xDL>)Ej7}26$-tnELM|nA0OA6YWu2b>w-3%RBu}V
zB0o1Sn0<reeOBGBhf}Sc`FZk6j#m*(#|NghzueSFTQ(Y^)8RFMrl6KVBpX0nPvbTc
z_A;qqO+`ZNA$C;s<#OkTR_=)C%V!|;_lQVzUQRBy>rk=lX3`L`>pKF5h@6Un^)*!N
zP>erzt0m(-b8Gg5wzoFB@U-rN^eZN({pBDkQrkpAM5Hzwu@a|MtDeS45*MQNW;)XN
z5Ctc9v8Y>GSyF2qHtS4nPNvN^(QR#1t>)l><TzY6jJ_R98}c#W(k;DebgEe}*99kK
zHby6ycRe)slO&TE+0@-PJ%wUQt-Uup3}<havg2Ddv6W=vXscw(_t!2`4P<Cp#+NXY
zO^~VBm+9%}2j#KU$6I~;u6iY%8~<TZxbqoSp0~~|GL45wotgg5fYO)@utJ?u@W$oP
zx$@)-kgIIUk}F-B0I|hV%NDwOGkrPH3$j#8t}1c{kWKDgE6K*()hL^9PS3v6{!)Uy
z4wf6r^>>CmUl^KT>}PBF-Z9@8aIsaBqjq`9Wjl(Ddjhf2ovggBZjYfp(To^Azgi)Y
zb0;vNMn|-2LXMNqGlz(pnPnts)TC;O>AHZ3mG&4&c5r*4A(QcOrkU0FCve)MnCV-R
zg6^uvN;YP><wZ@Cj8)$p3m$LWV)YI8;1S1~@p4^bIx@wKD($|)nDjBTkF1*0vGX!n
zY(xu@&4He*&v;T0<{`ZhsdW_wbA2J=={F+k4IsE~)D-|BQq6SXWS-x6YKG0a865Yu
z7P~^k*0)QCjjg|*gpI9l8V(fO(qytd#Xg@omb%o8Sw+7pvLw{rmFZa+BHsMIOmC;Z
zc;+e3WTX138!q8GG3PI;<jpWm5UFZ^$cY2_xQ6O|IE#x7nCiFVyBY!5)CoIG`SPyT
zd`AwK0MA>(mx~TuL65IDU=UKHVCikZSN9>=(-jm*BP~7Xj)TSENkPUypIB9iGW@IU
zvnk$wtnMULZ&LI73Io0T<O8$a#G$)&u#NT#Cg^xaq~s}FO1R(OnUb2#k36kx)m+iG
zVg8zH%@&fXnk~=7jFR#;{LL{0OBA$`3%xn)SaZ9rvur^^c2|~`BjACZ?e<a(B7ttD
z50wO-Cd!PaMr?PRfN#5`)wZ{ESFUG%k?%j9XqXGSneirL?YbLRbf9t?+43e$PBclg
z{Vfr3Hk+K>pC=NkU1vqsH2e!ItvB<68kw6+nV|=($h8tvWK7cN#Wn%VMfRik*V<X5
z$Ysn6qGE0uU}Y$Y?2kC8#oXTu8x*xvzoNOS$=a0fV2_<!T*Tny=y|<+4(X{UVy+;q
z+q_uEY)peJFa^HAT24_-_|mNxgDE}Hsxgc^7|_@Gi(yy}z9X2kO}_cnjX&58Gj*V}
z0OVgfiEUr03YfNS(l}sT`{Z!Y$hJw~fRSyJz5e2sY77QdRZacZ7{4*h8sj&DY2Nyi
z$Z{rL-*E3X-Rv<v?K9Knk@ulWpmd^rs8Xou6r#U^P+H>AEIkiy$IxplhFZ?T`OAW(
zE~#|`*QE=O6@{R6X{Zt?)uo|I!BUs>B;1NR0xg9*=I5`ZOLb|evXHbMsn*x5{fTCa
zsL!~Bh^SAtgovomv*;21m|2eL0qh3t@5|EQsXnP`%tl~(A=j7p8Ob&in(6B8%%m#L
z(I)Y>oy99zy3hj?u<gk1)<rm3j2A?QQReyL;y8!q+K1td$a40MOP^zLa<M;WE|97-
zW_<6*G><ygI1Ni%DG|Z{v|(w$4inj8?FCMmTP4g-3l($Sz1+bUbk@_f1<bg{YooVS
zU23Vp$CV@|3OH9an9D8f$Sg^<<>mZ84*c`2+%!%dbzx|v!7BxYS@nV#Q+S<)fxcC&
z6QhKZP3hG^8kyT%lFO`e#b9DoYD=2pa1M4=mlgUiij?V2_pUCoU}*yrQ>(UJqwXrb
zbmw~piWp*6X(z)khFH2h-cY=%CBn!-iBwUo4)REG_2;sMo{m+m9BET*;w`IM78xyj
zbA4H?$QXC!tdg<Ptj3+V10t<Y-}xK6z3n*ksHO!|`Zyv+<xEeeYYCRn^qm(@qritD
z>+!|Gs?>({6I5obg5v9@t|p9sThf_N|1n*!R}X3nmR|sC8ifHQDc|uG*eEUAT^F3e
zd6X|iPCT}MhhTz{?K*`TB3s59kKB9dn3D}mSdz>>JsX&a8~s!sjT<?q)<|edW}Eu0
zU9Q^bOsVXX%C(DCBVS1_+kABda@EFX%4M4huU)KK>B<lK2A0XAd%)?Cz*KH0K?0L_
z$&)wasXnyX&-b~`7uu&)xSH-`S_Q#^jzy(ul`xUbX_XL>%coUBkf7e17s=~cH?;3(
zA|v<&sPWQXWm?6|$<RtueOhIh1o1PiGF+mFDPLt;Ww@mAF|9IOq6C;$87`6hOsfpD
zEET6!hD#P-(<;LyjQ?qs;gZPjw90VF<7--FxP<XDtukD)_?cE2E?JCfTy0vVOrBs<
z6xo#5+=odVc3Q;;wP9}rmAQOc#gx|nl!Uo`C9oA*KCKcW`SNL%FeJ`tl`tG--^%f8
znp*Z31Yh#w6)Tu+mV1xe?N<(CDpT!U#bqP;ERJCHVYm4-o-nk(XkgOCc!w~mlD8pk
z*)yU`8)W|xrNyRjO6w4H&~3|cjiOq&HXC}%=ku;9QBThEytQiyB@^Ns5r(YLQn{jB
z%amvS?9!qJhbmM3?Z~Z6UEf%dh<BN~pX{qm)KZydRm!aU9%bq(a8)gNccQTBjjtuC
z({ijbp<e2xr!?AH^%RlG;Ym?;s0>eH9;*neF!5}v*2F8Fp5*(oS%G+jvW5!eD;-vw
zAxy`pEJK)tR}~rVBvCPHOj4bj@^4kuG|C3H#A?{^8#t}fe$C+KL*T@cQGDMn=<I4u
z_FUjB*02pZa9XwOO$(fulpQ)TW7R9TbsRWROS=nh2?b8gY<I(uR;k?$Lt^FaZWt1^
zv^zbuAp5k#l^rT)2>U*8TBUY33>hnLcf*k=?po@}^z{`6jk9snW-Pz~N8=sF|H#Rm
zH2N9fd3}X$9_XA9n#xV6=BCJm3P)AG&pvQ{a{EY`zGXi+6{cm4%?au_rhGFZ0wTGa
zE(#|79=hO6R$c2y6M}Pie}*rpVPQKdp&xjNM4YfxZbgq<?SjixMkKfIMZu)sv=^Mo
zQS_nm<zDnU)r>Kij~g>?qBchV)nxukCQCm{zZ&_IZLO!jh>K`ude6|6MvLGElYQ#R
zIh)AOsAaQb(&>5KV@%1$PcX7D&ivJE{%SIRC6lF}jpons<IULSuNL!Hv-zvZ{FO|W
zem3H#Osof1PViC9zj90o$B#3!XZ~t7e<hpnQ{>O~7n7w2mY*fh#!~3jDz~PD<Hwr0
zHGj33znaZo$tLq>=~psodRl%pnx5lZ4DuH9SF`ym*;M+OEd6XWf8vK|8ttxSjOjnV
z*`zgpHJiVZP3F(iuVm8nEd8R_l-6m@<0qt>494;1uNM3&6?C)dpDg_>{Yo~O&r83O
zNqVkE9e|QYbz&4uvYym`wlp@U<>xr;$uND*pW`qYMqd?wy!ore{FQ7rf0lkFn@rEr
zuVfOQVLO4L>>(+ap23oUsC&sV^oPF2j-8lp)PJ(p$j_#U<ISJr#u`7VPzf-0LX+{c
zxyk%VHA{e&M)T*`35|v?HO>IK#?4<X=C5Y+SF*|cS^AYs!gIA$bED?_&oggn+6YVN
zT{{!nW=mtHkMZlYC7Q<H_41^}459z16Zd&%YT5>tXDk0bLfaVbFGuR}8IJ$5M+#qD
z4?GF5i~dvne|`C#Mz{w4mT-+{)M<Q1K7(rwxSv{R=j(-E690@p2Hz71XXTp&zReMc
ze9Rj;$>+?+2gnEg8SZu{%t-sKF)>{)BHvvIlg2;ekCCpE?-TH?jX>mEZsA+9mz{5Y
zDE%sf3~2BTAe=QHbC8cw!nYRCD<5_LDdpoXOS<bg^MQ1)0gv&=NY|N<wZUhUFS26l
zWn`PZJX)cjT?{gy!8Zcotoc}MDPM*$^6_4Woo^}l+{*VIgtPLUV=3PaEqu;=jI!wE
zUW;C)JM{7p(rtCghm&tt@EPU1!ov5xJsstXXAijWU59Yid|YoS-_0uIqs5YsA6n8K
z@2FQ#<JloD={obVpCupnS@`mA+sk7V3hGX21Ee*|H-~W6d_07FT!H7T_ge#v@^z+r
zuqE9GE$PmD)1L0rXtd{&ME)4*9)fVzbmyE|r|pU`Om{n=SGuz;={{mfcehLI>CQzX
z`#;qE51f?a{>P8sJG*7drYReXFePjx6O~=URJ*n4&y>m{HL0{w8ntN=CR?<&7=(3%
zLFdTPVb8&_oG_)MIAN1Ni?9ewaVGy-iN3FE=DucL*X5eqoX_L;_<bMW>+zVqXXbw2
zujloCU+?SBea}6!b0id7$vql&%ngGp$CsWC+#qpZB5t2=Rc;fw7qm-*CASE6%&iAE
z05jq5(GJ{M#N9;PjR;U;ytmubhe6%s?@O>_ZY%jK;+-kZ)x>>;xNE*vxlwRU{;q}{
zbFC$5e~)+IE++1Oi2KvkD%V0MGx_@+?3fz>SGI3o2X2J8n~D3*4wV}M*W~Y;uw!l|
z`76f3OmSXG+}DZwV;6NCYC>l;`MV2t%xxrp#Tp<JcQtX}Ant_!s{Z;9H~TvlcFb)e
ze@}7XK1JLu#J&0!l^aE8H2Hfa?3nAlG2OnWI&fpeeUrGZZ&a@5D6_x6?NqtN;L84c
zx&wDJao-~D<LI~Ce?#buCV&45JN9=e`RjM!HWT-4;@<F;%54GHl+V|}j=53tcc=q*
zJ8|D7Zts^>t{<Jz<nPh2V{V-M9p=D|6StYTOXDiH0o=0<<MU$JG1q-lx_!@b;O-^v
zHsbF8n##4%8BPA~2Rr6gfGfwV5e{7UPwDl`hs16BPUVKcHTnAk?3f!Oe@8oT3yAwM
zab5pWxv>(nzrVeza%1H0SO>0`xGltu?NYfu3<4&9*TRndZ6<%mJ8=6D_fz7&g~cQH
z-|(51^`IfInqbG=qNRCOD|lkwuW;ZN6Zd7}-gKfmFZjwV>oj`}0J+pUrv`S+^<WVu
z^XfteZYgoM6ZbtF!~TYbTNb9;RPor)-o}=>Mc|5chVXY1wsJnY>?~W)J}wSDQ~#I&
zJE7;d?E=s%$8(_<#8&F*>(c=Fv4i~h;!D+!AjC}T;!k16e$<0oZ*!+Qa3>P?TjDO;
zu5vx+Sk@v@dArE?ErlI(eK)7$cL{7W`CCcc{}T5vx2fDHI=3m#55bPP72wKznd!i-
zB5s_x_4>RTu&i=J|5yP#=7zw9X`+2+IdH?o{hqj`2oUFK5S`oPuOD{Ijgh~?K2w~R
z5f_&T5_ZD2P+J!_fm>nlw?JDLH<Q0}9k}(x#gvoc&O;|;e|_lOCV%I^j{PmFOSkWQ
z2kt83;%SQO*Ve^Ra82zyNLv^C!IkY>?Z9my?r!2<p{<MKL9@TJwRLfX{JqA3yOy|Z
z#EpHc#yL2}?C)CGahz9^zt=f%Hxc(|;_hCqavLxRnA-Py*fF<_{9WY0eT%qzh&yYi
z%Jt4L`&$V+=6aT;+jp@8w}rUB5cha}U5r7%<nOWCx;O}~9ItM2;O->uUgGY=q|E)O
z1zc1AZG|2CTTTAn?7(d!?ytoC%fD5wAA^9&--lqw+)d;!nm*%rm50ugkNsl4{EfIf
z|EqEvz%4S2SFNyPZVUMvao~E0n}Y#TjFIB8bhFBBSzz{eG3=P@Tb^#;I~=&(iR&Wn
z#P3vY0E3Uo-wN0<w;WtKUft!uEh26%aj(aEm-8xot=ZpeV8`5g^7kGGZhzwD5x1AN
zE{=n1^4F`aiyO#aaeY~|nHvv%edQ-^JK_eAZ0xVM#<Erz@@fR^*k9|G^t$)~2kr>s
zen<Iy81kFBv89$(Wmp#<3_Iqwf-A?3ha9*S#C?yr-}O}2<Ni9!S}iJK7mvOD7Iw_F
zZq2h$#YDgSGq#!HJdL>T6L-u}DmT8&vg)v37Ren6JLWD0SL_qx!D?(XaYMx2K-|yY
zRO1|uSk~PJe?Ng8bL+|9#~io|iMx-u$9q+Oy|<g=d@Ssk>y4!2{I~;mDRD(mL|nw<
zy7sESO&EOsY>4yKuw(9OaAlnT?!a9^++E~vFO3_%+Z<=F#%&~jpK{<viQAt1t@u*)
z*NegDEJHsU2RruHe_LMSd{*SuGY;G}#NCg$1;``rzoC0AD+C=`L@Y(|z>c}~;Ck`C
z;68_~XfxAz)ks`7aesSX<+gx(g2CTCuw!l`xT1c7`@92p199_-`vlsW{q@{$_E&tC
z$=ssb)BeUBxJ|_EMBEKHk!Nlg++u^jG1xJ;99-$|OAg#^#65txS840mSk&zAd~F@u
zNdCU;z-=XNXW~xL+Sm7>Wpy(6dy&?@&E)SZ4%{Dz>mlyn5M++C|6#MgkHSca^Bw8-
z#S$oEK3h0B!4#Uvzb?c*R%_n|a0?Co9;LN!CAhME-*DjO6SpgIJEF4eZxbdpu^yJi
zV?SvRJNCDk{Kb@!(cePi9!T6XwyE6UUo5MuVZCuG?3mjIZV(j~{a0MGf~0ZW=tbOv
zi2LIvl^e#SX7YCz?3i0|XS#ix9k@Q?9!%VOKTx@zHD-VBh8=UO!Il1ES4Mva5x0=I
z`3I<6A0{=^xZ#E!bDQtVORO_QoIi5lmJ_!FaYa*dUWJ~tEG%VHMdp>TVQ%>D^mVgO
zun&@n_PuqWy^gRI;?S$GpNoyu)7QJ>sDArX{k9*cu1f-#bng_Ev5VAefgRUxHR|Vs
zjfl(V*vk6p+#qqg6W7|V#wGqV#ur0B-}{*wmu7H<zk=K9z@0_h!->1(R+SrUw5-dZ
zBa8HR5$xDsUwu07cfdH4ztzM&g1Dvcs@x`UCm8(o!;ZNDa6{k;e{pFhBX==zdl0u@
zuFCcO%k1w7uw!nF{KY9&Ms9?-J&D`#9hDmecZ$K^_ON4a3;Fwl19v5Hk0NetvC8$l
zVD@({?3f$4C*8ig9k{EB+l#o5X#R%59cb|PVa?wVxUzlsIB=gL?$N|8LSGf#wY|-X
z#mxTpf)V@MLjL~hz>N|27~;;xq{Cd_I?Ebt@OLKcm}~th?XM7kq;cNbOx$CMyW~GA
zH~f-i-3Sd?QvDZp%ngC-g^}n-xenZB;uaBiakI+xY%tGTVc0P@0&WmI!ENur-A>%&
zh<n0DmFs)O>~C+_F*km1+TRWi+&FQMC+;WOcohTJv@ZEj8?QVo)Bff=aQ70o4{?`u
zQvGdt-LlRz<keExvA?1F((`m@2d*0zr{%iSOWbp`dC<SbvN{{M!?k&^@culj*v_l2
z4%`Cbb|mh^Vr~B2YFX<r7Rw^@xdL|VZvfnCo7>HS>m_bC;%?NqUbN#8?Ikt6j(ADq
zZUWa0p2+7y2W}tY9!cCAPf`8#e`s0%GWdG~?AYI?2h#o?=D;l`Zg1koHLmpu)=dU~
zcWT`7XxiT+9Jr;#^%3_qbOIcf8lQt-TGn{O`u-KzvA=-_)7Nc#IB)~tit7cUJ^B&%
z^CGn$#dac})6JW4omfGBoJ4wswW?kd^l+-1Dl$(CV8?z$;YT5?ME#C&@M9WrPbRLo
z$f(5c8_T*cMNQ}F-kVfzBXN5>a6`oHPu$m*s9dr5x=K{UF4EsuV8{M8fm;C^;V*8n
z%{ad;B<=v>cATu{OZdN*C9c28BDw8h$K0Za(s9PE6B)Tni93+E190*u+>`4Ff84U>
z8vN}CJLdYqmHwXOz+FMyQ;54#^H<ytgHys(k^a_e{??Pf101+f;uaIP6^jP;H}sul
zjWYPV9d_(*1Nn=gF=L$95cgE#4xgyDZ|r-^Lh7c9^mi!inCpHx-M*(ea2vrbfSSm^
z(}?@?8>+tnEUsf>;IND2{s=qfdckdhjnF%TxQm*SdM<m8^k5M=j^YP&qFf6**0WY&
zp2jgk&rf>#dE;h^-x=h`pD$437y8Yz7TPSak$yY~JLazbOFDi-9k|WJJ(IY7FI2g4
zaIZ3OkAod^W5gZiz}-$<KXIScxS@S!f1lR4&BQ&+fg308VB)^1<!Kz;YYhIruH|W*
zxFa06dx<-QxVtV=;~YXSz1qP226h~0_ao`{9qqt%<0b*Q{u@f%YbUAPIJl<vy$W{B
z^%8fi1Gj*<gNVCjipmY;<QT`@*I>uoVsPcWKi+}sC2lEkr)zPJyK=0JhB!~r;_N4X
zD;&6eh+9V7K0(#r7*57aaV~-#`&&U=q<Y42x0txYh<mU$Zus-e+yk|7BSc&@eMW96
zafcK4S>0c7FE_;bY0clI#6{C*<OYa)I&sUiyz;fnvEW*&$Z>M8mRC`5WnN8l;7%lN
z32|S?^+SP?>xc+Wdc`#;StR#W*m3)=ChiOeZY6QciTlF-YF;(rr1yHmI{P`;F}DHS
z04gWuqe~sQRp83FoJHK-$EyAYaPpbWI(s4caW?5KTdL{>p?9YY9=0-mOJT=;SgX_5
zi|07_v6Q&y5Vz_km22UPfl&iD1Uu#yfh*VdV!a5-M4a^bd<Ahw5cdpiogD?&w9Y<N
zTW9;hmFv#=4%{elM-unRk!rqpyXF|z*-yZZ{jDc|s~xy&h&zh7t7_Faw}30+CW~y}
zDD0TqK>l9iz-=V%XyTS(aVs#gUj_?ujO*;duw$<K(RBM>=fK@S+yHSWYU^wdE>@V<
z*%jJ4+Y7F2-$f4GCgP4IZv1S`--B|D>+GGdV}Gm3-^C8xZQ#mv_PNCU64$FZ&T(*e
zh=Ic{vVA{;9dje#`f#8ahi)S79DCg^*V)^S%rUOBFVoiTvA?F**|nsn_sclNZvy!-
z3X4Ye!`CCnxXwNscI-#x-_rTA%z?X?xaSe~U5(oSu4#R+RpW+<d#eN2jhi*)`mchx
z7i;<A!~IUC^NLAYzSI-<b_Z?&anC32HRq^tZUEP`&RzgJj&lQX?{wgLiF*NY|AfUk
z4oi&(KHO(zT4&z{JLYa8ZoLDy4{<Lf?lIc9+W@YqeS2!-ZVPemb>J2gcN}rA4ru=N
z%CT060N6$L%PV2W{<eWD=l%N~xTVCMNZbRoI5!<_UT1gI;%q&h?ne(ga0A4>h`4WS
z<9!qt-%N4dqK)^3#9igUok-kC#Eq4!arPc-=B|Yu$Js~RM;y47#GOpsi$|;6D7dC|
z_9WObx16|tb>LPJcRX>w)wmvfAU6*>vdFypTH^-6m3j3y2X2_SV~AU#ud{pSSRTVV
zdw{mit|V@Q19us5gT$TCNsDuz9ILy5I~H~v=McC71VzkmPdaexi93b35qusa!YbD<
zu@iHw&t#CXm2qAMJLblyeg8?^Aa2%4=-C<#n0#vudJ|zM^!)a|X3}dUy_*-Sze}=;
z{Fp|549{2N=kJ$e<r(5P6n5-KoZ|N{2W|s#rxSO7Eq;OiITkLZr;3c<ep>wePo&48
z7l_+Ui=Tf$j`ej)E!`enwD?s(uNZbB4`QUJ$8RnCko}{Q{CEu~8#pYL2fl$hiTPZj
zr60Q92GW~JdN=e{_54}tZ6>`-N$=jls$KwkN6E@zo2h<pk=|vbw-v!+f5TboZ6m!|
zr043V>NRAkx1IE6lirOdt9mWaLldP+CVzL5-sPkh^s0ImK93XYHCZz0{XlwiNbjM;
zR6P&$x=Ar?GwJOmy%6dBcDSnN%Tg~7U)GWNd<E&<aj>cv$kN|@(wj?q<tM0m!7TL(
zNN*nL&GxH$A?Rh3&)rF{iuCR|Mb(RDsn?72=96CRL{+aTOT9j%cO~hSo}}to#o6U^
zf6`k(dVP;n^}Nu_CZ7k9UNz}e9jfa2pqEWPmy+I9q$hrtgU6RZmU<&d?`qQXY2$MU
zdY!ZAZ{tYs8q)h*%ja;GdJ{=+A?f95<8uUh+2r#y(z}-Q@C%$u{9;+^%_6<)NN<Wy
z)r)7TS4Dc)liufAK6^`YEN>R=v5@q_q_<JaXFv3^$>+tSw}|xi*T&}n^s>q4Wu$il
z>CMo_=TMe<D@d<~^nN->ZI1}_vdQO_q_>##9_yp(MYGgfMS4p}@0~MMy$0xIlh12N
z??%$wJ5beY$x`nr(z}WDj?~6y&#BqfZ!PI9CB28W^@|^R+2r#E(yJxCJC9KP4MH!Q
zeBMlYH<R9nhp2iX=w*}7Z;@Ud>6K{Xb0kZ>ZKSu1^a{25H9)UR7URKo(pye?uW9S&
zrY!Y#LQlk5oCn-OdY^0Ka~ygP8tV56?D+gBg7XTI2SQKWw+G3@dP_eKXd`ZfxZV=A
z-J++Nx!qyM+y>%yb>QaVOViTd+lV_x%jdu#Gj}BHnA=3$ZVp@zac?K?+uFL_I^E3O
z0z2l$i7URBlPS*K!IkS>d{rf3Cu|=@BjsQ#&*K}wm1}UkoqDdfTQAaEL3&?n^G6JN
zSW>5o)YkR-klvl7H%uE3TC&vZPkMKe-bdQ{Ufe{JO@A9idicsiDt>op>mhHJdZo~l
z`BzVR&-m5$@I%kk-=2gW=Ygjo-QSLO$b$fJam#tik1w?IfOrP(r?6wLkGMq++=;}+
zE!Zh;XKj5IJ=5&({;*?ifVko}9w2EPUn+@<Td-5yJG6CJz;EW>3OnY8h}+kJTLrG{
zZ@2|J#a*DS*Q~+W^|ytjhg+*tdTX`w4-fRR>2Hfk54RAf^a{20nlDSeWu%8&gHw9f
zXy+e+Ed5<UdQsBzY4ck!OTCrQll=|1gr@2@3iB3^e<A3Z`rFyC<2;B^9*Ez|f}}D3
zRudPuDyFzK+Ifn1NRIUaG-Q$E<n^#)ZUeYQFcS0X84ld1h>KeWQ``ovzqMrGuF?8i
zGjYZDN;3HyBQ9<&OmX{b^ILSN*<YVFzgd4z`&;V3-3+emZ+|AP$E&t)ur#~=_7>^k
z7P^!l=W6p?2zuG{w{4_{TU=6lPiXxulBM2u(!;F?DZRm{4Cix0mj3P}J$&??()+28
zsu#;r?+56~{)UgfQ+i&%s@DWPQ-A9YJI?ze<N=y8k@sU9@<9A3jpRN?+_Nxmaa_V>
z=KL#z9dpYm|He6R^NG8LxR-0^TYlVhYU<~g!j8Ei;)?IvK+-tA6cQI7ji%!K9oDDp
zuQlAv{T6o2ttajU4%}Yg%Kr8^aX-@5YcX);SOynT&wsc6BRwo>Q+^z+&2LT6%cj5e
zCp`>ZDZNG7`CB|oy+IUbgeax=^DAncJ@_2;-?_rmWRbrA2s@5*3?dPjh;e)>#d%yO
zThBhe1@{?rw4aNO)YIcvj{3>_U!J7;6?arW--<);GCBd4di`O?^$Yw1{S65u>NkVx
z_g`C2-v2UjN=||+s|a+W?9lW=sFa+yW|H2WAF2L^pobwgRb>5cgPo|K-`-OXJ+V*J
z?=sTU<1&%jt&!q#<0WcbBH%s>9a$vz2H0_2R)ZU|xtBX|D~bCYabNDNa{beCtbvAn
zSr0qr7Cx1}|LO_{ZWVE#ChocaQ1diABgZ<$;O}VIF*gKmz3s2~{Ug!7qTiQA)pm=`
z#C=tGUltiZy*<KIzZa=~^IlQw*Klc$C4N^~7O6J}c3eL<oQ%Lo<UuvnPv<TJSN4w>
zaW}cu_J~}bW1VW~9~)rD+<I_ZZSFP1y}m<IPxg<^HRk?t4eVGi{Lgg%xR&&EKcW=B
zm&lKQAdh&wZvnTRA%2g;j=8JBmH8ZY;I1L=2I6+m@;QEEj&+5B+fL8tXVSmBTI0ZN
zB<?!mKGUG)OXy~EK0gUN_BRNw%;y^&xEqMOiMUmpRBpqv9P2jhm&Id03BiuJZQvq>
z5_wun+(%%aXgB+~z->9!6e)(S)O#4ug`OXeM0pnDGoFaNuOmG@Uz*5|0`g-5j!kfJ
ztSB*XP4}CP#Xk1K3vLnK6Wm)IxZ8;P3UTwFRJnfKq<6Ai2T>2{uN!vEEeAJZb8mCt
zwt_4B`K!bo|G3Hx<7P8)9w>|Cj)5I>n<>sKh}-Rnq@L{Oz3wsh^DeMsy*7&9U8JYC
z+g^&_Yvf0NjN9C9esC8W`kN1S%=Katl6ilR1J{ioNt5g6*NMC4Wi@`WmFVY&_^pN=
za~r{xdB4(uTR_}5h<oGTRj&U*bH3aFJLbmzmClz39JpR^Wxg~K_s?roZusFG3zDfK
z^W{O<F*mR_-7g;^?!v#R`7&s=IbW(_$9f^?$^N#A^z?k`Px0GAegvnh`4Rwki6LJm
z!j8H1;L3b?#DVJv*Nv!%@!(D3{sW&=ah|q3mfh!c<>bd!()(D;`#ALOOSMLN-1tDt
zd*Acv_E_WK$2juiE#mIc#;eGh?AGHGN$+ja^J#I3La(#I550Y-QC!|3z5TUyYy<S3
zGwAK7tz!d-i_EJh9pVxqKi(zoi&|VlxM?z*^OS1n$^M3)R8E~oeKua}Z_qo|;K#?X
z<2<c~AEGac{A(mXnr5nc4ba1>ZmP)syBT(@w-kDXw%&83r?<y4@&jMpNck~&oXU-Z
zyD~*h=jny8V{R1Opv`@rxP2>Cy~yJ^)+&SEaj;`O>xDcEZzbaLBI)UVM9GhX$&VJz
z5C0S9_SmNRQ3<YWkM+cTR`VkSJyUx;t@%+6J=q=`NKg0UDe~h`^5bGHuNpG=F-gm-
z2>G#*xMj!}$frIpYsuipVAyecM9Gg=NKf};6ZvsC`7!!jmFvaL!lwRl4(yoQNPcW4
zZov#yF91DLdw5{SdYj0P*GW(JV;lM5B|o-menc|(@rLF{3;D5yxDRQ5#4`ACzvf4r
z{Mbr*Tdz*eTU})z`#Y{*i3Yce$ZhesVznJV`Tjq0tk(AS3)@D#nhiS<Kfic^;>Jm@
z7j|O2dWX1r{Njk8T!;0-_a-s)CLZs~>m@igQJ&2){@&77`+A9G+ZFvgJ>I|Pz}-vS
zuV}o#;TJVuBH-?|s~|RVJiQKfoG$@z%dubhyUl^?hIi869mGBL2aWrjnL7}6%&jNx
z#}3>A;(kNiw{(ATlefv=Ce7a#;(qGD^%D2L#9gNQyVlHIs`*>=ayrhRJ8=6DcNcLF
z-J`|%c{BGQ*m0ag#BFup78Cb7;x_HpxG$Kwn_<V?M&j;p;Fc2i2jbq|rg2|1b8mqi
zbFGc(IDhNF4G{My;!gNk<HpR~v9M!qIdOM6a3>PCjku*hY20;Yt{-;HjS%+-2W};C
z_Yk+E-oES2-1b`gHWPQZ1GkE}dx^VE&*zuS+-5DGy|~yT$E!UK+%R!}BkqdtwK#7u
zb0e_hI9C$)R|oDg;#xE>jL1{Zw<7;GbIW1J+y>%`e+&#)jGr^r6W2xDURVwBdMNU;
znd^lWbK8iU>%d(_+&tnIyEN`bGq*qNnCr*IDA~U49k>m|ZBJa!Z(93qGIR4`$K0jF
z?cl&&OI$Z`JK-XV66aUU+zzl~ZWD3y9k`o_+mX0;x7WC@nz?ttj=6=n_$K4r*@62O
zar22gc0Y~#A2W9p?3f!QZdV6x3vmx1?zVOsce9z>3_IqoCT=$e?oQ%*h`T9Q<GyC*
zZh#$g<HRj=;I<K0{BES^=i(9Fr{(kOX6{PZF}L_X>GnO$ft#0;Ue^^6_o*Ds-#5(M
z2G}t-Oxz<JxE|sjMBHV+YW_Bvxl3Wk+)c#o;lS-q+(P2Mu8+@K%-mPC@!7LE9p_#S
z+#=#0O5DHb<MW$l?nB!6TtVDp9k~68dpL2Q)5qtnX6`?=@i|J|;~cnt;vPxd+x7AJ
zEi?BPZG3JeuK4ZcO!MFf;`Si!iTe4%+h*?Z+WCSH7x(2j>2u&#5ceqJeyOiF-Z67O
z)7Bf+#66j~hdpHX4~z|>MBdG@Zb)>5<ZF4JcQEY4+y3O+R?Pm8LY(IfAia;zQuVx_
z<XH3VW5h=4eE>T}4;Qg3uwUq%LVEgn@-&KzpW^a9PS$w7jDl-Ae|raS3a&g)F2qG_
z*&e4la6`l$LfqSb)VQCTxwpWMxk2Kd?!aA0+*0E9*T%KzXJ)QX8`oA7*YChxO59<@
z-KqP#-OO#({EZWLr~`Keam$IjKwIBOKR0vdY3uu9e5fGXcbEe=N?h^(U*&vxf_B~*
z{ld)ct(`Z9iF=j<cMWkz5I3%Kzch1qYTQl49pS)jB<?8UKBb+nMqAC?2JL*+gAY+;
zoJTuwHxM^K+=sRE)#z7d?gQHSY6Wq}I&hnaJC?XJwe!{J*Jkc??R+&#-0=?FZNwG7
zJ1q06mp)$YFmt`yc-2bW3I}d0amD{3l-zCF^`_`fGq+j0-sHoFTC#mFbm0C#+zW|2
zLpz^|eq-iN)y`+Ci95-GYq`?v&Pl}GrJc`2zcq8e(avXL#GT^6%_r^@;;zxoXQKZ#
zb60EUGj4p?C*wTLfm=x2X~Z3<`x`fNPtyDi5O;<Hw-<3|5O<7r9u?hX=8n|Pqw0x!
zsRP$X+)IhuTRX3aerM($t({l25O=l%cMx%B5%+ZM{4M&unOmZrzZKy_RoT8F2W~lW
zFDGs{?ffnJgPGe!JAVricb)@x9C1U$y<Q)$el&Bh(Z;Jr;$G>%4H9=QaZl0L8$X%3
zCu{2st2rI#tB8A~&pr<oYe1CfZhRjM*WYB3>(j$v$LrH_(z}NArarB%cVj>2SkJqq
zT6(=Z8Fs7}fnGgy#CrEy(tFpw&q#i>6vholv%CLZZ>xQuk>B1`v@OqSL)?Vk^`!UB
z?P~qvN4TsF+UHwB;w#v3{k)&1e<x-U>Aif1su%ORtf*ZFv61mx4?EVYfS%YV>Q_U0
zmyA*Mf<0UoLX|2~?_$`oUM2L3Y&~&*i#&gGPgC{0Jzd7nIrCu0dJ*Uq+IlyU-Wn}_
zLFk>Hs$JUO)mr>klfSj3r=QQva;4|3=WRRTOI5Y)hn<^Ia1S$ZL$DKm$n%*-;w~fZ
zy=SR$i9zo)gWlb+<G5^so{aM?q*qm<>RCs*tR)7$5bRhl4!ug)i9Cpq-ZPqB1bPz<
zdQWP46`!U1`R%0l5Dre9584`W=xs6R-48piUle-vcKue6UcY|oxY5+hW&E9;`?Y+I
z!|oIV_fJ|r7jIAh9@*W*-KULLK785pY=hn}+IZzBy?aRS*^kw@gvFOf4dcPnu;aLt
zLoZ;*<zCV|W2PFH@G&lHq@jMN!jARop(p#>eWZ7qybsUTXo8-{P`^{``|$j>T?5tc
z0n$6?pQ^tt_{ZPE4_V~+G8}eXKkM^!{T?K}kqxSz4_|^EE5)#tdS}6o^$JPvVbWVz
zuIfdghg(upMe0?<j`e)d^TJB>qd$}0d~JO8_jXy6Qfle?U7?N70jl34q_;uKzbN#+
zG0c}SE&nQ^C-O?v?@`jb6yN6-%_--%NFSH=n4x}`z>fW`{31OLiT`OT#z;3Fs}E7*
z=f^)^tug4Wf*tEcNbhf?_cyJ6P0&NCrHX8iN45GjLeB>);jj4Ltg?Q~wfKemx~z_d
ze6H2v*9tws5_*3py{4(EzmXHo^V??FvA=E5ll|>U()(V^zb5D%oANfDFaOo@&+}z^
zyn34SF4x+_^0}<z40@Mp?NJCl>F+b77ra~b*9X1340;n`$Nm;U&ks8hzh_BLpMR@q
z{;i^QXN||sQ#;q2z@1^>UJpCLmGf^UxH8UbiMwEx>W9Cd%lNzE^I*q*grQe#`|$$l
zxz1DdTA(+`P`}?MsCtdi^V)hb();HuRnL2p%PKYK{R4Jfzh>wa*?Q|q@8lEJejb9}
zgND365q7L+wWhBFZy>#OC#ZVf{x0M1$371`)~g`Bmr3seBoU88u>t11ngBc2Yk;2L
z_IDHMb$nRW3*w&--f4(md)TpF9D1^SUnRYjm{hoa;>%m6_N|8<>lNW9F0Wm`&7}AC
zbXCs}JyZK`fgS6WLr=Ev>!f#gU$s3V(8H-zs>pHj4%o3?2znKE{hCN`M;}eE#AUr?
z(EAd0thWhzL0eCJe=HBr-FO_O`5VNS_WR*|S!Df=)ch^_I^BQYB0X_UnA;-?y%VJv
zwo*@AE9d(8p(n?+cS!Fa7*AQR33}ZPdXK}7^#Y{VOnSfGqUyz=C*mxNtl!VDW4$2h
zy-#{wwDt%LGOu$wY3&gry=|m-?eS{+Hb5^RD~GMD-&L^V`h`jFBhp)so6k9Z*6A+m
zR)gLPuw%Ul^aNMT3oWGgDw2lvBG7x;p!YKDSg(cjJ|(?DTK$6f@di`<inaRrcBJdK
zo%OW(#i3`aU$IudFzJ0kdRKj_`WrjbWgTGf_i@CD<I)5>bm>%)?RL*=s-5^}q}@_h
z>GnNyt7_+k-Ps1c(_qJOZh{|P=!tgQL4I6(kE$0M;<APtxRYSVdU5C#+IruR-aVKv
z+20uSh8gtk)aF(9&UF3$OL}?Qyy_Y1vPK#7ENxybf?knbzg?ua`xCW(LFmN{df&s2
z{S81*=Kc4i_wie*p10Ixy<^b(0CubwCA}X>?+UGcR++hev$gugNpCmljnV2CgPy5=
zBenYZadWTq7ys%iH81?A<$ZLRIqwh9xDBwwl0Q{s-aqoD8o&5(SK|9F(oovHrsch-
z+-2d`j8u_!4{Gb(_*pLN;gnUnAKj;|cO&q(9Co6A;Fj)`zq_!W6qxq5M)Yi#^^igD
z8`yFCHbc)3JE4b<bW(ahX!#sC$7M}1=*6{sF8nsV&dDXcfm(aSpm&l%?<Cl9{Q}Sv
zF%$J`M|wTqR{ga`nCHPGV8?nv(%X;p8a`3=g3vS7Zw>5NFGPABNN<IfSJ4dhi)i^A
zCcXVh@7}xA`dK5*>)5+t$MuUq&u_=C6X`8RvMKojJ<~ci3_I3qf}UK*b|$?8FH!aU
zqs;5h&ah)WH*S)b<6jrjTdb|aBG4P{N+*o$M`3Lp=7XMGcOFQ3r(;rPe_H}B<NpsR
zfgRUxDfEJN{JN3e1Z~|E9P2XvALFswx~Ua<mA2l&r1z4xZVHWaS^F9MeNkIC1>$MF
zLr5=Yf7Rdc1Xtp^g^Zw#->=%bq!D_uza2(;oe&g`Ujy_^>&_0a<M?eNy~9cG8g1R=
zInP|b1zP=@N$*I~yWXwV&ksFQ{jPx>*RPfIdXV1J7>C&3DD+0i;9)D{_jlN_UK{kh
z*e}MbqeyR;7+>+e9G~ORy9uvlk$T_2j`a%hWezWlgx=Al_pY`M3s<<TbEO!zQg18l
zSg)A$jwQXt+Pu{QJ)A<Miqs2h>$M8f>rHyM&Q$#koo_xbtAicauNr!VpbCGFC%r52
z|Cl&_4bbbEs$JUOH#EDJ40hl5R`opiQKW+ndZ(4De)wS5*<fcKsM`5qmv6B9@d4E?
z06XEYEHciyxCp@hhB9zlR;zYl*xe|_u$6k-V8?NeAkG2o7jf=SaeiN$XFM00=b3l3
zd8P$=ep_!K>3uUptzQH5R>4jdS--Df$My4mmmb%ON$<?V)OHI_bXjFs2gxG!PJ<om
zErp&K4}`y`l3otJ<jZkxnC!BiaY?mw{C+)9)oUTWL8SL%k*XKE80XUhU>8}xU9jW&
z6@Q<e2hSkANki56HBEI{IK@d7sdoYFST6{@Vps`({iIjWRn-ekGw10q_p5ec*gc)1
zrsJ|3cFe5@*K2c!64#3lAvw<e>E`PK-C@UijigsbdJ8I5y$JM7*L~)}j`f<MC&!oJ
zq}S(gwcVPacb&oCBG|EBob=8jy|3}R#_Vt45|{CJsP;QpwX<fLxw)`ouKS0yA0vqS
zA%4f1xnbzNX~^fZwDB)E%RK%)qUB#0cBXOdVlA&C8SF-D<6jhZrx@aV4(!-pFZ>m`
zF7kOS`P*Ofw*`8*wIEew|F}%cKhGTVIKD+&$9iFB%B$D3b*zutV*=IhB5iyLLeG>}
z=fjTuEhoJS(mSl1+P*Cr^bUp{>jg>g0@B-Yl&TjDne$-75VgOBVQ0#NsxGQsB!gX-
zKdE+6*qQR66YSWJYRZGj<i`!Cs(LNZGtJYvGgZ4d>`d*uPa8LuQv5C^?qS+`!*_-G
z`oaD9y>afBp}8*WBJqY@WS)*cM73+0XU>-~u;aKyseYGG{ch98p(>Y!TX|ANa_`s1
zgV2@cJlLg;2NBqr^5E~<co5BCw@Moi8enJ2gQzwhG*TYSB7bYO@gNSpV+{U2qm2jN
ztIYW_8S4^mHy`Xw`EnubxIH#edxWTd&uQa92zsXLP1Ch`q2X$C9!$~Zg%;w@Bkqu1
zYF_!SF}H7Lt$hQqGqvvqt)B-o*i~x%JOn#a`%csPc^kEFHTm&|*3TQDXX@uqYW*k%
zyKpM&)9aTfw0`9NF+HzdL)@#ns`2wLH0#ZW9p{0U^sXhnd$jh5LGNHg{Z7)x-4@uH
z+M^jAne#NB!R|$^J*;b8R*8Z8FReX_;fEM2#Qb{$`LPoRGuIEjBMo}>`nnx<CmY7U
z1={=;z0PIT8SF+Mt+t0RY>waJQnh{o*qP!tN;`iGX0W^BUR5syyD5hHjndBFS{9k(
zQm3sutsBgFb(6O4ET_C$M(y!$ZQKZF&|9aC8$r^$h4l72Mvb#oV~%rSnHm=_>`Zaq
zsm0ls!LIj8RnHGQQ=T3TJMM4Ql&5!)A75zg5r&>APv1LK^*1W&XK3G*I3E;m%j-D}
zi*dc!VAp)CY8PK(j^C}rRDV4;n&Y>yn`-CHVE6TXs+|vZXv$QP^Ztx8RJ-6!F6)St
zReGFUpv5H&JAAbuRixf&T3jMa&2f2A%d4hZb6nPFc@>A9DX(rWQ2nrOHrsuu<&_6^
zrnp>(n}4}|{rE9XQ(QK5SKBuTyEUn(q~jMoNVW4Ub6FT-Q$@yafOh?$0d}T&;e9P%
znqX&&%VsTKS~A!Ty<hb=4m;EJzo)c(2`@LtC8)(E3OihaN)_qv=~`R@x0pYN=&tu8
z*qP$8Tgw;Et>(DAujPw3gWW*AAHmKPm;Y$_5`&#7U!FNa&4U)fHT0uz3st*##N3bW
z(DKE1yE!h$3|HGX06SB@9Da~$7tCOHpO!Bn*qQo~>r7QIdWShK=W20@!Ok?k)M;^P
zT49dM)mpxI?lQ+^sMe2surtNwc&#7#GuTD6d<nqL6qiHvess4vE(O}S8--ms)r->O
ziwAZ*4=$zoJVx_isdgUft#?`X8qSa2)7HDOKbg62YwO)8abF_tDcX6cAJEkX?k;Uz
z9KX-pZq?el*mJ+R-Hy`EQ@k1M4%XInKG>Po8wbLU<J?H=jaSIu{@Qs;2zsXV#xL5s
zI08FU`|gGvb2m|(Hxu_gZT;+dz^wPSc73RY^j;^u)!I5c0zK2X`=3&^pEtnH)Q|q8
zt^Z;f>|WK{qX~AV_IO!qk2Y$Lt>nku+WOBEHMhsN+IrjvJ5zgnt*yu1Kc&wb-y!a?
z+IZEFLGLKoar=5n4__fm-Io!>V8ZJX--G7%n5@l%0oa+^qga~<gBk2@(AG^M*qPen
zI@qxv#qdMS_2RtoL-ON9ZN6-Po~eJt=Batr1Uu99m$k5CZaKxTg}7%`sd}D=%z9<8
zW4$2heM)+HnqDA-o~7wklODd(l4{@OnqDM>Uah7VAw7HrAf?yiQPtlj=;0Dis>pTN
z;jm+WS3^&>8*W`r={<@?9Os|+VV8xWE>)!7pJB&(jZ{C}N}1B@GeOl0LJvcGsz|*e
z*s)#{^t`YVd9{=DdR(UJH9+s|lv;YeJREkc7l&Svt%qA&QuS*Zqv~0!%=Oz0JJu`Q
zovt5l2}tSrr>S}Y=$Yy_2zIPj3_V#teDs*o`-iq(i$V`mUaH9WU9Q>1U?=wpWBGhW
zAGLl>8T5|Q?BW^p?$*|S)}QhHfK=_$+&f^${st+2ZRGDbO|Kz?UO>|elb-w?LpSR2
zw6-n|{>5b-Zm8dtnq3%nV-0q5VaI+%!Ihsk{z`t_yx3COX|XH){m`Yjr~uQ%V>84O
z{mou0wSc?Iz}*Bp!L@9=MsR(2Df)-iE}bvM<!bvz9x;!*ZJNIgusdJq+ePNf51PNN
z<Zmu<kGNaqda(F2=^Y9?j-Q3bm+@;yddGgK>V=?(uWqJ_tlv?vW4%J?Erpec%YLM{
z_hD79;Zc`0Ev1&u(>B<#UX<$Bf%J-Jse0bOn)`Ww*s)$C^khHZpY#f^R`o*A%QN^}
z06W%efgYMX;cq9_yGzvzKW6?sz5sTtSM+mwT<c7FpKMe0nxMDUP`?jh$9m<^Yqaav
zh4gNHNY!ijo6EY;&>nTLV?7I<+iU9`NP6c@SM@xPo7>}D*s-1$da^ybk>22e>N+e4
zy@7`MZMa9}MqziS!S1IOs-6D{m$lAd_jC`{&eLH2{`B8r$9|N<519w@cjVmA@2}~F
zpeKGWN*39Ve41VadLfK8q91jqxLm5~H9Tpq-zA!!g~3tQ?+DWS)vNjY6z=O26}OA5
z-_KsnU+6_Kh>H4oNpE>CRWG#GT)$e_ar|0y+NJ8(lk_@jdQH$f2K!}^^=q%``RpHC
z74_>ydV@7RYrVOCr|Ww7F;f{o!OuelM3~+@O7%Agy{1mGcIk2Lb=a}L)zFKeZlZog
zr1x2WRnOOCuHVP7V?8&1j8oR{IMTaV(~Cgw)pYez>yk;DUI2O#*ope}A-#G{FSx~A
zzZIHZ3)QbL=^d}>#h^DMCtX3=zQ<~MMHn2L?E3jgZ|ebC{I<HRMQOQ|zi+^f<JShg
zpsjZj=`GXrVj1+7YI+r(v|fMGdwhgizrb7O`u!DlT)#%r8%TOHG`*G#dQ&yMLQDqI
z-(u36gvGK5KbA;|5_;QQzYAc;^{XbmQ%Ub&O;7xIzo|VA)byH3ZxHDnahzJeNCv$_
zVaN3=?wa=Z4AOhIx2orT*Id7?uw%V?(({vE_+wSC0eVa9Sc;9z=Y_Ciy*B6-W54Kc
z@^=x%__DcDod^BRE^Dz6vWwK)1UuIAVRH7tM(CAN{dNb``ZYlhuBD39`yO_z7lfYJ
zC-jDq-js{g`dRPc`>WV5i`2UacB~f?iw7i{(38JUDExiS*0Yz{R@+A|t3`@oE5=<>
z{;BKXM{;Afp8VZGp{Jh*MCd%=aXJrp>I*wAHn`<ue4i;dflB<5el);N_#w{&eE5;v
zBD@rSjHI}99HYi1{weNz#WikOq+Wa2aa<~(7q<NvO?p#pJsFqPZRWU4*7TYWPRC^o
z>FIG<NpWeQxOlX<M1FQzzsX9#8R<v97MJ=%(s3C_+-_6VxJ354tigsjcYz(pB?djW
z9hV8D_ktGZmVNjgCG3|)*6%qjE}O7OtGD&!@A{eYWi`d+Ns7z(18hI+ScKc<TH<$e
zWRcu4u;Y9QVlh_<Batuicl`vnUyIr=z4)<nq<E@Gy%S)^aoGgD)vywJ7g1dN=c#&;
zj=9G3!9lQNy%2tk*k|iaCcUCd)pm<R?;=C}dcltMqR^|i_2lpR34g!Q#>oJFWc@gU
z-dEZ<S&YSN#MYZi^?M%|3&i1QqC^RI$~At^{~g$I{Wd|*iz7t*rjy=d_?;cri$M>U
z>QhCw$0M*~y;kUjZ9VzBe!}1J$Ex*<V{rM|pf?6~tXGL2X%;L|znN6OM{GUW6?b}a
zm3cvqlMicp)zFju=rYoK;uy7lp)R@BHbea$gB{l|jK#mK-)z#$(dswiKy&?m)$}6J
zll7ZJdc(DRX@cGo#6=d_9z(T!smG5^%X#$*(z^ijCAV*|K&_wDn*clZw+VVaKt+4Z
zBfVP#YW(8RyIEEaTd7wEJJz#svV*r0dh<!|oR3t!aJO8mhhcmf4m;KhK(E=>TR?g*
z^ich6D1@HuEL6YeV8?nz_|a^?t#=jao!2v|C-d(u{HS~p>|~MocP{K$uM&FF-)l(k
z8SQ$Lb!4vPHTe6acD<<)deYx(NiRo>pSNeO6~=y9WPALo=|ym|SdGLG?R!1x-RxE4
z7sZde_cg@tM%b~xZk#Oo0Tp_SNbe}SJ!JfvPB6#sNUc4}p(o>4Lwd9I`1Q?A)L-{^
zrsi)w^rXK_NbiVoTK=7!Yy5wFhr*8i_26VSX#0B;>FMi@r)XaNH{vMrMLb4dVsq`l
zc>CuXug9JPJHeIfun@SFcq!t1vjaCq+?R=a$fYW`30%|XVBKKH+-7hKZSHah?q=d{
zB<_70*E7J(y+`B5i5qd?HWPOfagSM``Wpaum58TZWdG<1JNDPzJ00gc9Jt$w`wDT#
z&sVwPpSYX2V_?VJ5OMEv;KqsjDsg9O{x*PXYTxOazs=yv_Pxh}yO+5CA#T0qZ#)Bc
zh30RZxGNpF?%ed}8k>pxH_cxk{uzMD-$yln-MDxp{e8fJTR_~`h`UYmH<W?ftoiFD
z?n4e-FL7Td?($32ylMc~lvlN|<Gd;cSB@KhcHs6Q?i<A2ruE-ou{qAoTK|obzpEX%
z#l&qQZiU8;X5fy~xQ)bp%z;}<+%3diJXei#O9pNjb{yv>;yzB?zGG}Xd))Ds<QjiB
z?>N{AJ-=<&3OzAKiSfRH^z?ZqKz?i`KL*WF{Rn_->L10hV?Wx+k0%|t6N&p4aa%$v
zH<E$74R*}+9G~u&|8(G168CN5*3VYCO&Pc=V8`4d;y&xZts?F_#C;tfLMGPP_I&Qa
zKL<J1ZbPw=^USNTW3C@u*}iKXxMAYHOWd!uJoSTXYTqxkJPnY)FFJ6S5x1GRw^gYA
zhBNrP9Cqw)CHcGFfm=`9_lWzDmd_0t{Jmex=W6oz-wxbW#C@N*11?bgjf0Cz^{FD;
zw;$}--w1IxIdB_@yN$SG<b6waUinTlpYM;f?^}}V#MR(>Q9Chi{KtX2mbf1h_k!N4
zzaemsOL?2l=LxW5e>Z_E^Z9iL?j~@>^#W19kBB?*D3u!pSH@Q0<#T=fYa+dmNw4@A
zRj&bhT@8Nddd;NQLV7pj!&&a<O<C%-klrVx_v1OLUOY>^R?_>F^qxLm)$<I>&fhrc
zeMWkhBH-+=FH5~P(%VjYWusKRK$dz|UOHbsC%w;ms(K;l$sBRY7dPpBL3**HRlRVQ
z_4AP4m!x-~mM_sP^$JN({NHGC&L|!?X!#P$QqN0zUy<GrEnix))GH#ruSsurXElD-
z>DlF<kMwqs-kT#;J#UtJ#n8(~yu|pjll0oOdCLzy(>VTvHg7f4IR1^pxK>KsZ;9I>
zr1}vCcaTU>yU3hv2Rj~5<1~)P9k>DF{+GD3aIuQ}Zwy@1I9>@m=6dj9xTuqe-}esO
ziPUa!;?C3hWgJ}Tqi|V1*T>yyq_>OoMr!@iIwQNhnnilwk=}y?)VO%F)T<)B?@6yf
z>zDp4^%j!e52W`N8j0I2n5Eug()*G0YPEhD&Qfm~>HS1{)3kmW%~Ed#>Fp-Hy**Ta
zW6+a1;*>8dNw1Cc-tML9HDy`9RiyVb=^dx#OFT=xHKezP^d3B0t)J)2?DF|3())$<
zrfB)%%TjMG>Fp)GgS31JWU04-^nNA1UGn}7dmS6fQg1W#<T(Bt>CMp2w<6G6Ari$d
zGIyqG=UZNkYZ%%S<62i+Ppm`raj2QN`-nU23boyQxXEp$gkmeXLtw|_X*IY(>=)x{
zHwW%^;##nk^Zsx8d2I&n9__rgnYe`x+&FP_i2FCq-w-~;Hu?Lg=5O%{X@3uM;O-@^
zi@3*W^R#D(xqXk(=IMHHW&0lCz;(Av=T$Cor(dqNZv(g{f2Y8X+c!@BiqD%wyP5K;
zfVg?Y-KAZ}4B($$_Jf8jGOxbTu44vplUX5*L|*lB;ChMMj=0_{RevKHxZPpL{#FwA
zSO;z&;<hL5!y30K1NQ-q8z$~?4%}km?nm4=t5knIrRF%l4m<X@p13DCa7&5nChkQO
zRc-*>TG_bR%Jw}UcFb)6x7co9p942Q+z!M&v0CM}WbpTR*fF=2{5{!$JCV2@iMtgy
zS@ZhETW0q64cIZ)Ix+3<KnHFmarY<gBrUHRz%})w3$(l{23Pi@5(jP-ar22=sI_lA
zgTDn@`v%D0K@Qw7aXS(B6V2Z+{%Nhr-w!o^my*9{I&hZ}_W<JFqP1@fTvI;ZthH~H
z{2k)JttW10;(D~tT>`_+{^o0+yEK!(We(g`#PtxjyLO#5l7U;OU1yCGx7>l-K-@0G
zeM_5<nlf;kwE4*GOXu@B4&1fG?MmG0klKGe<>ok7!H)Z{m$;)GxSNQ3AaQ-#Iwz2U
z+ecgH6ccxh1NSZB77(}MGS%Nm2JSf6vA+T0j&tC)5Vsp~7fe&RO&PfJV8`4_;-2Tg
z-AUYom^(}5dhk!DP2<Kq*fBRu+zTAIZNxp8xOYugxq%Ga+hNDtdg5N>z|Cu)Ue}#~
zMVMHJiN~m`RBi;^!|=W=a{fIVcFb)6SL_q(tDpndLtJ^^wcu{+WZzF?pZ7F?d%gW!
zuqC${cFc`|E9d>G4&3g<J=VTXBe+jIsQT-}KleV~z<msM%xxp?B@Wyo;@)c832y0~
zDmOR^aTW^!yGVciuw$;TU;2KtnZ#YV*w(X;50B2Z-iM#ENWE&<2|d5PBM3b&DkR$N
zGSd6c{;FPZe6I0(#~WeCdf@@MUk}<sZ#L=a=Z*a-E`^l$w`$`{6x=CxUByQFQKyYB
zOTm?S5OU!9iF*ifAD^bShi5{rRche=6?WVnF>rB7FyZe!2kr>s#%w!;-MXhj&HEs@
z4;#35!j8GE;L3H_l@8nr;=V-OA;VR!=e%6&c?0(h*fG}{nC4#Pz@0|ijk)RZWyxb|
zoSVQkeZOZB?3h~!ZV>eod9~1i8zQd!zh5HG^Zu%G{paUeLk<0H4(ym)P2B4pxC@E<
z8u|O0#*JK%YmG8+U(vYD#J$0RyOg-{|9%O7Ki1;ha$&A@hJpKm7U$wq(s5qmz+FMy
zt>kZSjqAP0%spD;))RNB12;<CcZhqi7U$rkT<a`@zXxh@ZX<4;19uH^KOpY<sG3&|
zlXETn6j!Rq@#+QGab8v6OI8)I68U_K1Gka59}zeBpvr9unz<8U$J_?u-sZsFK-^D=
z+ePEXr{r4rDce+${&v#1?viv~t#IHr5%&YzPULg0wl48b&9!n+FIgmaU$yFQCAf_+
z5^=uUfxC^k-w?MEdcwW-_L{(ViJAM9#`WS$Z<6~b2W~64a=yf^x2bj54gQ?O`?)r^
z|IFOPYw53ui75KK8Yey65}MKrpz{mP|EkwUdN@T(={-}Lo!+Ej$$3UDse~Ur5;af$
zk*V|SbxFIE?0w^5hbB%HVJ9BCzZU+fkc=OeWU2aHHbkvo<E-rB=O#TYjZ%8IVY1-(
zWvk~QJ^4LS(RO8n|8IJQq=%s^RlmZr?DTT3QQJfKv41Mc$ry{52VSk(y#zbpQbo3#
z-X316pZp%F@OQJ;9-A_>$J&KSuDtg|*acJ6q`zLgzW#c(enqo$tv;Hacv)!YmCV0!
zuq!aw>3$TE9~eSXasE!rgG%U$ypSbRzx0uw{64I({fm|d+3FRO-t!O=TH<ju`WxqI
zwt9Zj^J1)&de8N@<7@{|=*hMhKFjBN{K`phE!FQyEl+1<8NUGO^`QElq18|5$vQdJ
zuY&Y8QvG&n^$TTLzaZ)Lr1~w?>L>KFsb3}Oy-fAHTB~1Gmh}sf-ceLPORJyI%cg$S
zq<1p)k8#?(P@QG{!lWm^A1`vyt&JPm>MbQboGPXAxv$oLv(<}`9+u`Qy-)pWf6G>{
zp7c&5y}<ubFG_lYNbd-3-p^FOyRg1Wj2oiUpa?q=e_7=7R}FTi@$ZOJ)bTl!UcUXi
zE^>Tcn1Q=PvkPaiyS1OnU7W%0PujX<X$HH1=Et%OcH8k|)S}-=KO!0Id;?Uw6&dVq
z!H=~IJ-Gy`hn;cWf}L33`|%K^8IwyPwqm_2?^6}+^WHOR`>x5rUG`aab}t$1OnGo;
zmfWMVw7bw?XX2iCy4^2DP*5`Y+h>{@XJO|}9FhDZ^S%gn9OpRV?1PDjv%D`-)Z^{3
zs@~=ddRt(}dR`0yQcvE;DD-yQzaJ~}YG;Oa`?r?&@eFota=cHvXZ?`DZmgYulG~QS
z?oiEcZw9+JwEkvYZXRC-YW*lLgWVd<&Yi*TS1m628SJKL{nC@cZj<J3K?b{fG`+$M
zc8lcrY_~^u*qQSANjWe4f!!93EA(Uzi$mq}%BgCedSTb!)@HkDu;V-pAWth`Ao5<`
z_a*B4-NxivQ0B`x=%rxTFS#MDzm1z~=FZak+iK#<`>zD|kaJZ(mO`%-@5>^&-C)Ol
zSePVn%AW8;-Y+HeK0Q+%H#S4h)E<4Zv^#vfT0fyD`nfE!euu!0>sO8X1z;rNEbsRb
z^{CXido$FpLCdR5c7M)N@7pZ(j?nTn6L+UJK4-G)e!dz%VOJ!BhpmiXA?!GQn-D)g
z_KWz*`z=KL{%v3Pmh)<_d1k$J_H}QeA&UF-w4S`5LFk=spRda679*fnEh~ln;;DE%
zr1iHA3(Va6wf<I4T>1IF;GUz+GdnZr4cF$GrKBf6KNotPu2tv#f@<@)aiPIZ950J>
zea^z{^qx1^ne@)QK0Ccz4R$8I`>xAQ?;C@iN$>1s+3D3A>`Z!V>ax?@W3V&n-5UPA
zUcPKJY-PK>ZLl-x<rwTtdczHNCcV#Uva4V3#lN>R>5b1)?_PtQNpIr~zvr6#?Ubcn
zNtSxo8|+N=du&m5_1k5zGwB^}urv8P)nI4Rn`^Jva*=DIi1EdAK65$jlyMy6l{}w0
z5o5W?Q=#8Q8~=)+S1N?<BJ;VEHvY9hPtN=ONbj==>O3<GdZu~$W7u*1DsU5noTpDF
zy(hJKe`N-}C$xEgHR%l?y|1)&&gKkypKI%!HqtwV^v==z-J3ygxaM#9nQ4DZNUvs`
z8oxeQnd5go>^Oe)q<0$WJw8v>o0viGudrjiR?<72^oCZcddo8Coe4YEEB2@TJ(Kj>
zwEC^hp!b7Tzon!%nDmxw_1l?2uU4yHGwBT_y$jD({q26WxjoK<9s64}IPGs4>0Nc6
zsy8Bo-h9}xUNz|rC%q2#eGhUxSeQYtoqgYf-|p9&NbfAtyLf?Gzcm^3Cc%#DS2!f?
z?>VG5W4@}lErZ@v*s)$E>5U}4$F%z8Ut?~MN3{AilHO?2YtZU9D1+V_t$yyIX@AF%
z-j7=SW@XUZrPZ&3^v)%{JzD)%X3+adtKVwU8&7%<X!*Q3gWkPbKDUwHd89W=%fG!D
z^v>4uuN*&~DaZTsN$-X8)O_i)(A>Vy!H)B#p7bsxJ^k~P)wsSZ=3j9>BmX~ynBzW>
z=SQw&2bl=2H~BR2SI&d)+UG~|0%a?>Vtx~PlN`8D5m){n38A^T-1gVzF3i9U!%p}s
zxrJqE?i2@ZjJW#%6io35&Q-Z9!S&;PS%i%!6Jf{Pa&SX<U-&!CfxDTwIdmPp^>UTF
zEdzHu?3mj~+!+qsX5!`&cU4H`cE8qqy(9`d<`xZ0U#Gd$fxDf!?TFiFw#p4;;1<D-
zxnbhYcHqW|doXb~Ywf!j+;NE(P5zPXyGd)`W^k9<?Hh97?j`Oa#2q(B^|v_#Hvl{K
zH#j`ao#()HyVL#m65^K3Q@MSv%T45|bXod40Cvo61vh5<d!+-nfVeY>yH4|WWd`o^
zn!l^d)7+~ZxL)FRC$8rT)!+Q<a}(=(-QRrJvA>mPwM&d^qW>;*;PxTz5yY+6^0`+A
z?g}lRmlF4S2W~NOFC*@?n!kfGaIez*T}|8@9Jr;#olV?!+ITfC12;z-uQm~Pi32x4
z-2I4qX0_VBv%oEujf<_!=hI-v?b`}&5c@^@E_L8eByI=dmR_lHS7qS(VaMF^v(wx<
z2W};C_b2XFjk_%a_YIA^nz*+(aI1*hiMY-3e8HZ73&Q3&zh$2<$obcOPTJqw9JpcP
zo=@Bwt$jyi;9jq_ZzXY8IB=H{cOr3@YH?nifxB3X^Csfn?ZB-k?quQ~EZ4<$oY!XH
z9%!$NWt@vfq~rW22kt83UQFEXa{X*`f5^ZswAas)yOg;1IdB_@+nKoEY2#I&MYylj
z(0{+x#;aCvi|qazb>OZgZWrQSt&LaZ8Ms$!<CSM*n)|Q=cN1|BB<?_MeKjou_atq7
zRZQH!IB?%0Za3n-FiRb;!Wp>F!H&nPAaNgc;I<IgOWgCd^M#e*dJXM6UOQh{3a&g~
zSmVImN!*^qb!q1dYcp_vvp;u{`P@j{CmgtK#GOOjFXiVhc0bydf%}>Lxr^ks689et
z+`JCyb=?)jjf_>>cW(ynGT3qZ7LH2C`Dq8Phqzb@rp}L!ljotfzuj*zpNAe}pNC3+
z%fXfBwT%wk?!?8Eo#IX#ulhS812+ge_P3t6|8n3K5f?*xiu;SkU6_HpTjRD8_XP)T
zf8rt~QrtTxsQ#|Wz`YfA>~Hbtbez{YaQ(!^At~-j<5cdp4BWo3WA0MoZgAj^Anq9A
zZq~T@HRin9q;Z>xyOFrRT%&$oF$j9A4dYOM?ejrlC$9g?BG;2kvebLgU}w@hTKn8j
zaJ@N_nrsj8Drm4X={=@>ZkkE&OM{(BuUPxsPw0uyNo0|6xx!#)(p!J?@7u$qx7T22
z(mU;WRnM=rn>?oG+3f6&X#BmMM>>nG)cYVyy<^t?UQcQWS^4~z=YDTz;!gV4@9m@p
z>#fhyuAhNx(z`25yIO<4+`dwKiy_Wl;ecJF-M8zr^SANE?Cj26mz~|=FJxzT<iE4C
zo4g@AyBD*x+xJp-degFuU*9a__ev}~?j2e7%PS3jnDX9l;F|0{Fto49?$3tyHQ9Y?
z$Y+_GB30${<FXtN78vq=wGgt4)YGraSI~U<G<|REE^VDH#y`{jb+>El?4m&Wy6ulN
zU+Uax#BC(*nc6zL3fxlZ1h#TsI8D1Q9|pG?`^EK_Hsa35e3>(1-yG};<6$*IkBgiV
zm*c*0@!V(c6m}1gq1Y!L-B%>Ha@To_&3YefOxoGYSgQhdi$n6Lv>)%nPONkM_O3Sg
z;X63#$FJna`(LI$f=F0~5WkpR=f9u|A}%7&W>23zXYN&f=bY$G7N5Npo8<H4-+}%6
zC-w{|E>1r220LC~Hey&#j*N(?zxrK@wRR#W^PmXl%V}FtsqwX+pIfs%UbEBFDqdc=
z=p_-Gx-xfdUa!`@`}XZyK7H?n7ri9*C5o`0U^rmDyS9Jw0J&X0y=@X7nL55^``!er
zVo^-6mWRcj+MP)V^s!&QO4JXpJMS-SL`m*fUYqM*SMFZ&O4R|+!i9bD&g;ah`R+R5
z*1j>Gv{TT7JA3QKyX%JJ^?M~!)3&cFe|ab;-udry^XBiW-BP;=#*<PJNb>u|WDW5;
z1K%=6@c&?+ir37M?mNHQa^a#_M+Bnw)pcJN_Iq{atBJREjr+^+IpVEO@-6YAbH7(>
zK0R`IUIdG3JH&#2Uc%$Df;tcU*n0d$`E!q{8|kS-cseW}binA{ANBaHc6aYLN<Ln2
zKwX)q*4KMaU0Fe`r#8NP`VW&Pi#EM@%CyM~rcb$Sa;OTwsUwQWWieif&kIG$72qM}
z`tEpm@#uv|5gvW;@Zllyu^5j*c=+)s#iJaL5qJdf7>7p%9ux5h;xP@6N<3!a5yGPi
z4>5Ku#N+=bW$@+G=FXWp&0EyZH(<a?zLSdkcrTtZZ~8RvoXfp)`xl>bO8--)_4ZDk
zHRbXd-Yciioi`Kj_dBJpukT6TqROhO(7aPmJaI}=qwkD4b7st%K5x$axl^b2ojPas
ziB)sv%$iy`W#;84&YE@Q>=QzB=Uh5{YL$0d$tA@lm-L_3Z{WazCr=yT>vz)h0aJY?
z{YwU1a`MF|`=(Ewe)6=FP9Att?_@lMpE*~LwQ?4^a}LYT%Ug=BEaEF3q8uy!3_ifU
z#5JT-yWust6Jg`UTZ6>=D2d;Yk^9SU%&W<r4vXaR!GwjaC2cAayA%3hd%sA%6k}L&
zzi8*EcppXNKx#jpihXOvdno!oQSau&9=nc`i@IL{X|cb}-j5KZbxUu|onr4Vw1+d1
zcPVapy57b1e&u-RPqL4%_=Ekpq?{<DS>JU|0^r4a_4fWU-aqWdb~hoq*CeYU_83bp
z#%eC=w_U~eaQ3sr?+u9336C7*Y)kC#kk}{x<XVZ=kuR}7HEbr{%T4so)NbrQApHW*
zaxMI@C>8ZrUd4X-4cVlTdN-Zee-IrlUW?XGmt5<R^b0%_zw+~)9Y2w~U0u1>>&Qo0
z#5mGJPR4jHUgIa25=G>4S64e_HuJ#toaF9A&UVF3?9bTxA~IcF9js3F@gf(yx;k3;
zSHFppe7(PQifu3YOjlRF^+R%Z;{TI&bsb=RW*;x|t*fiEwNBaZu_kKuU#jfyY7N)+
z%ZQ5n>gp=6me~76K6P~+WPRK&DIluV#dWYHzPBez0Uljk-L3wb-jDWc(RaGIj<6Og
z_FikH?XQgYW%g?sAAD6iQRM3Z+I~^rjt5%S;n?P(5_p<;eT4n`7;I7PL}m#)QBN#;
z5}6}j%j1s}_V}Z`?t$N5#rwi;xHwKUI7&{J<oqJGqMgK6#9wTMiP#E`*our3Tj9Uh
zdhKm5ds}30``BBbz3p#ri|wswe{sCu-j>?ia(g?%-UjULID1=RZztN@puL@DZ!7KX
zEPETWw^jDG+TJd-w+VmYRKj0$pM<{%vhx0+>Gu<HK;z&LD@WQP$cf_-+{E!%t9r5D
zg|_yKE!tSr58cmNEVjs*Rbq=ZeoSol!*6AYEueeF7Q>GCy%BUD3tttpTo`61iY*}c
zYJ%m$V6{?g#qcuuf@!k?S6Y4NPM_7cYI=25-^mw@I=AYiev?O>HDqWYFnREhvnG!k
zJhJTEz~G@}{Z5)ZdB*gr$@4;!XV0%H3!I}Jc#gx7ye8?tpmIu8nRal-V~Z!-z=88G
zpEYOdW&itu{pDeQ>|qIDl~d+Uw--=T=ghynDs^~vK{847>pyuij-HMsOJZdP9~=X1
z(kMMic>c#O0A;(7sD1LV?5chew^HK3L@i6ES5KWDs=}Ho{a&UNG1k1_ANi}-`410J
zYbwmMh>WprzU+?GYnV9f{}R;{&k}3T+0!qtO7^~KQ>vz*_x(@ZudF}%;XJGFteKZz
zHhu01a}sTY*CYDQ!^%Gu5r=+h3Q50{lihq861Hmk+_JGazNG4^(DcbOFTZ4tHF@&X
z>M4^$^XE>VeC5o!Rr9CJvO-mrbEo5^1GSl6JvrG;wKqi<wEA8?r)qlN;iJZ%Ft2Kg
zc>RajJYdSKnKLdgyY$krfh)&envB%+%E_0^oicm6CA_Sfaxu17%@*6q!$*uBGI+$~
z(ZhzFTQ+X;xWPk4luf4SisqU-2SFY;!C{ayg{16%R?+h1e-}_P9EV>#Z=U1eJfaxU
zpL{XGDp+&ubaL?X<SDbzC{wED%$+=C?u_(72x`B+{V+FVSzgE!YsGYlV%`zITP_Qx
znnc0Z(Gu%Hxl7FHTp*JuJ8^(GM%wxDT&#y=5p$#{tuPWRY`=Jc62kl^_6b{2AE77a
z;UO9~g!kAzsdonKSTBr&#XK$a#4=6lmEk$puK};S;~|UG8;mztub%3MDLbY2cZjiG
z6ZVPqoh(vsKh2L87zqDlk#_&VdV%%gFfiHm)41ZGK~fA`sdob2XFpa$Oz4TYh;@sM
z%eQ#WTt8m)#(T0zy$>}%a2rKJN4LYrB8px(gC4&Auhg#rl@lycKe3hdy8+L+ehnG)
z@bR6Z7b88f9+rBEH5*>bJZ*tq;ye`Zi6Z?KvEukOk)Bu&O1<mxgzM)+JBnPBMe4na
zWE6JTohb9|_O@Rp_KD~DsF<)j$=-1#?8JGhEMlK{+-$c8Hi@zrc47Ou*ogXxaw81b
zj~3w=1Vo(0nWOaMuc)8cCH3;~B#hUxNWH$cA8aS$A&ay-4t5F`FJ!+I{Z4XQ@kIC|
z^$PKX`=!*|jwh_wh8IORPWX{HPr_Eze~wl^{JY=8c?@<XiqyMItDhI0SJux9OJOJU
zUdHi!-CUk4V^^Yxx{HF_j1zwNk}nhI)TZm^b092_5vE__I4*MEQ?{MVmsZ#{%AGhs
z`q6+V9G7DFQHlK`E=SvT2|r*bweYqTh5t=>LrBX0A#(M^egjWQToAYaB(IVuUnHL=
z|H|v;{Z1L+OI|qt<Ll<`lLa|>ol>;k93>LQ>(Hs|w3)AKw+hMBb#D<Dx{j<JUl$g}
zhW+O+S|=I;m#mk(xqOi@>Rh(|ro<CzoxH9uuJfj@?Az4Z(q3*{-LJEj#Ht3=P3+~4
zBukyIt~{@HeeYLm*5}t<n_qY4zL0zDn0@o}_nnsy`<e~74qO{w^3(ixQWt>*IaTC!
z<rFXVNkV?z$by=m+r22f?L747y7``(mvd{r*t>jGex0XgXWn^Z0{g}afVc+Vu{PgV
zTk6ZJUFdT!&-c}=%dc7YLv6?3Gc)rN7qSm18Jt(uvG(=44!G?9{f=X5-{`%uW@CO`
zm)ddge|&yj*L_#G&kG3u#^wt)!cyCwFwjSPbpGea{P4QmL^5w}Nk><<e_dIAO)OWu
z5Bucj2p$n#zvl&!thMX5eo?c>y`WFs$o!Jm=N?_MrStGDXZMTYy}5<!zRtzv_bqn(
zw|wQV*^^WI>Vlt=A2--~iG)ctxM&H)Z+WfgCAIF_P~Jwrcxr9*i@Cz8o13@fr>aAr
z74Oyj=APSa(QkO>e^&hIJmmEq?eNTF)pcF+X4OG8dpa-Zu+d*2I?|4UMSF6vXRdfd
znC!@{4HP^lT&VfE!`wq(5Q26^?M=>4L*UWRwE^*23O*i5#!J+1WPaTkd|J@?pJ#c(
z>s$$ut)JEg@(`u<A_tNM_KD9SkT2d=@s`XNd<rqljpQ6&H!81oM6W!XS63|Za|Bw+
z&Qa{D>sMRVD_<n)zN%iHF=)f?`vUp+97AO5b?(}>CHv-YtQ(fUB-VNH8X)Sf^DNod
z`IejTwBIYW3wwEXbW1rkxDKyNke%+TX?4T$&`t8{Cgg7{eKk?#y1Z9Wr4PU_L;@Ay
zsQ;lp<9hX~8_}ysRBF(xiAt^C5ka+39r(EJ%iOvym*$-p7?aGzjl&X6NvSBJllYv@
z?$611T_9pz?y*yI(R$I2s9S#BMd$$eHNUtQ99I&bdrZkkwauM}zg*sLUrn2P?t$xC
zbNlV9T_1^T`FeOwTTX4$f}cv>m_H_=l~?nN?4`fhT@;n<f-Z`2!jq_=?51bCjs5g&
zx2(4KFlj>mk~eW={``Rm=(<mG6TSV?JlWlA*VjURm<NIFwyq@?n82mh*u-a!qC-x|
zuPfb?hn?a>yAgZxcC4z)+k=<+$b;SQ<!q{n<?nEz1ED#VkIvoNid`LQ*RT89m9u_F
z*G4htY;CP+>++n4OXs0YjoA3Nw$@F`tGlwG<mJvoUM^|sJaql(BHLdOe>x9|%WhuU
z%d_>1<->AoTJ|Cj3PGxUzixj!4wt$EWA}|o1On)~{5^27ur|N2wzM#BV`-sVbd}}#
zh4#pmzvnchX6GBX|F&;m-NZe4wY#90UpKCorw;F@vM&;;?d}t?%GsI|&-t$Ru9Da1
ze*>$6TEqZ(o&VLt5P)*3Q2$AOa$6xnKFO2lZ?*4j{d7@GOqI#uz5tyP&A*_y?pjaD
zp1J)>Hg+Dq(M}0(DkZ2kN`8Die=HiXZi2hy?7XUjY^&OL62nLt-oyBsTl2EJ_TAoZ
zh#~gS+KK2pg|*##!6Em)xo!;baKVGFDcThstG4})P9p!uwdK`zsU6XlC$lEy9gVN2
zmAN~wNPXOzvXK7otsCjC8<W>BhB2*Y?Yqa9oOW&g+(R%(CO+82N0}d0?caM($#)Cd
z)n1WDpJ1kszbG-P22lUwtD#f!@!Z42;ahsYhofJwIv{bhm@{ib?zDhB{&({o=1w%k
zDDmO*v9+%rKOqkRKce>a-oN3a)ZNWJ;$nn3p!b%Nbqn0J!`xqe4v*?ad0;&fZq!|Y
zQLA>hn525YTe5L(_uB7{$7Gc_vI&R%R`N0q8|?n-adB9gr>3plbIEzN>3EEdHS0WL
z?w;@7ak#p(ZdCs9qw;Fj<<@+%7e>p6i`=e>d6p0AP_yx~nlJa(Z1j|D>O8!yZdgH`
z8<{@#yg=<ccAAfO*PZRD9Z?)#o?l$EE?!$&`~zOK)m9bn1+5nQUhTaef!j0pu-fly
zf5TL}d-n%DeyQq&XYb-e<aV{^yK9@ZHqIEok?!R+q7T*P)LfNkRkg1hoDYZVuENk=
zRhCZCx>M>#C*}t+bOj1(+j?U}@L>IbFzj29AHa-|KNiVWC}xD@`X%J4-HipzzqOhq
zQ|kY(^%<F%p{}s&Q?oOFj2!k-bwhoy{z$JllCR;(X=VAD`U9=@<ZN2zUS5}orhY$%
z@Ryf|@__j={O#p^9CEAP&mrrR@6bP;^_LHmbsLqcT+PdQW?W+a```7JV<xxnW6^Yl
z|H}H90&rbk?V#knELe(QWW&u7BCRlpVk0WJ52MA)(k4A7Bs1v`^66Ul@&$Ql@(HrZ
z>xR2)HoEuCFW5KVgZ1cniE%P7wL6s&te#vC7~5O=o4&;*aiH)wVXv;XaN7r#uvp_A
zkZ{e8)s9qyq*O8;Uy%Lr$Y&U5&KEu3&G*&(k$=j4Oo<pv|8;%G`l!)%ekD4Xc>KRo
z{y%!(inx9uubm`fC-42R-!Ha<nXr-j=zf%nKiFUW2m9;o{l|%|)W0No!$vQ>)oAa(
znD?KRysyJGK5f@x+g)O^J3npb7AI3E7l}WTC-nkJJK?L(wku@2aq0a5d%sxLrgTOm
z_j~b{xYj93K>U#$+%My@?}_o^?G?67gKo1r&5_q{irD7j<bDyKW?Q33Y$eC`C-<<N
zgkj=X`$A5h*lKpJhhR21zny4*q1nf_eH+hzXS*p~w{f-|ZWBn`jZW_O;;kxs|Czks
zz9(ls%!Ez7ZR0oCTnQUdpS8A4iOI)4NgsvXcH6FowPf20F}yGA^6l$qx0>v3NZN@U
z5Z3`kNnE3sF|+Tr68p#5`%V6f{Z;n<6NQL89``&=vwdG-?=Ru~iTlB3Cn_N{8XXv3
z>~FUBm;X*<VM0UL?6qx_Tug9WrNT(W#4Cb>GEV%Fb(OIjo{&n|mD_e>Om+#i<aiRY
z?Zh?3l%9ProbW4R@5hOsvVSg6V!yaXDN3gOP4@mwv5(vPGqs%u*D^&h)lc+!pS}Mu
zVI<>$`ir{Z>#m8CNqd&P-&8k|!oBb~8V~VY@J0U=&&3!hwtehvUu;G0i1)<jSmOG=
zc;4UM4#f5p`?<)WQ|;%2uoZC=wxaL(?dL<V9cn)>!*-bcT;$GK_H%LHmN;${9;5B&
zqOHf;&qaQS{S)kM1-9qg&o9JwA|6iV_xIY_4P_scoBEU``G)$9FLBL35%m<}kME^R
zjL>8+PRG+FH*x0_zs7|(D!GX}q0(>UTDWP4%J1*3!%aX`)NfFW`ioB<(k0hAGW`P2
z@J%!Abr0>e$ewh`O=fWFjod^QrCvf$WK+82S|Y2`Mg5P4f-kZwU2-jvW$BV@B}S{%
z8@b9SiQ@RgXixh^)}>3X@=2GlPmEkCgWS}egUPpY6L%t~cEes|X1e5BiIFJvhWd*!
zLSJNRy5uHj{?r@z4`kLpdwg``U2*T@UqynWh`!#{m1q4aaV0SE7A{bs|0?_2r~Zdo
z(%x;2?wqt0{W)=O;{nOn7bjllTj$ufgNn6^xR<eMzvO<gCh6+(SmOWci6X|KuCA_D
zPn$2;U0nxS0Z~yDF`kQi6?fPl_BAA4ce4uZ6c_dB;+mYwkfOx?gRL#tiXzqwU0sFN
zy>^!pYlE(?L#<=%@k`hUruZLyqKNfCSKRA(ZkNQ%M9=ApdmA6I>mypetLsSXaPi?1
ziXV@zF0WN)>x=ojtE-1q1db>*c=UAjvNqXz$@)&Q&a{VwTNC?_wYW!#drM!y=bfSm
z*`BWBtm{N2QN(!L)78hCYwL@#v!|;sz5pQhT8Yf<>FQ^Fso3|oUbOAYVbjw!(7H^C
z-*k~gsUi-2$JPrZ>`Sa4Z2!dA*wZ!0x-Vs&jNcX7>-ly($0Y2}wEki1i@BhuYlziq
z$4`vmJzZrMe#R_Sg#UZA*Hi3xB<;(s6SVyYDE^+4xSv7@ifVUtjj(1Y{883zHebwr
zJzZlG<GrvKMM$+*;y=z>W#@Y`{u8Y6c0P*s?BS}g@|4#XT5ITa7uQrve9kS4&_C9$
zkF4MMcK>O>zOJrr$$MH)u<vQ@ZQtXX>Gg5x{fFTA4zTYjws>ER^d0Tvcq`lyuf<5+
zp*U^V!+!rOZ1V<L)=~CrUFUFd+|cxK@^u*RqdAlJ+CpE%SLpvg?7a<qRMnY3eus=O
zz~}^w8g0}Oqmm++2?&g!hL`Z7fB|`HD~6B^BpQ;Knc>BP1_zY8<LuI|+uGf3OLyBY
zyX${{w05nwu1(NQkoFJ6_JdTrind$D>Awx=N}&G8@B2OXoIB^<%;ZJe->3Wk?D-_~
z+<VV+pYxpOygtu)&bim|IR<aakLglwe15%r&K{fZIpP;ta|hy;Nj#Rnck$ryKvK|E
z{8KL8N^4%=Mdeh_nNL2SO^D}g9^{kx((?n+8pBo?#$-Zty9!S{UoD?&`FFq1k=47#
z(&0UywR}Z9cUyJNv)tmxv&!lhJ(zT`+p+O5`C#4g+#~Vsm3UQn$meT8o3L8GhsMrs
z)w58(H$%P$Ar|ua9TE?j7I<?d-YkhXPvXsY@i9T-)kr)*K@U*yiwTyXhha?cdzZvp
zCh=}V;!Gbx3j)$N7*$R91|w_2H+UN%GV@i!3#@$|^b!6Q@6osT@eX~2rx1?BoSqPk
zDMpB~<w-&?@jT&$@F^xl8)N?uS9*i~C>Vx})r4cPzlRWoNuPBLKSmoND#yEo^kvQi
zycGM02vLZu36be7glKe65~34-o)DG(7lcJ%7I_$kN>EIQ#<qwM)1eq)5c)CUHHJaI
zhGF9j<7b4|8pa2N#gH5FKI}T=lMsys+y9JV=tP?d$Af;=XYY=Mrd3tJX|ZWDJmzYv
zgeM$baxG_Q<&~J*Z*p?;#+I__@y6)Z#u`v*tbY(5!_C-61TSA}W6?C}j5&bk>&?Pt
zGUM6YpI5MjJ2Y?PK`<))lIaFJD1TN#va~VY&`@P<jkNPTL=to*uZ^s)jyJ?U9*I!6
zF|rvX=%(tRpb9XjPdW1ty4l745Im)Y3~t`o1b<c(eofW7`1<vc7Mq8mQtG!R4VBo`
z+?8@b_id|+%^k@7I=lFU7xv(*(A27`Y?Y|0eq;08!FyMemC4wbpw$Fdv1SN<%xW<-
zX3F}h7DJ@ef3+AQvHq%sAVuk9e9|GrXe1`PMD&*-;fP(esk)(xPa8Mi=YH773!PPA
zV6S!-;G(jdtL(18ReTleDwo_{TGgkuR#e~}^tQ&N4J}Ra=4@{1Zg+FR_8^?jMeFXT
zdWI&~Hi2E~KOL#4+;pFGO&?SZ8@Re=Phe2Q`>B4}sSduu_FEl4De-=)=O-oIKi}v(
zs%z_-YQ*pzVm)-0ZT8A%6}c*rPcl*9rYbRWsBf%|Y{5>4!B)`R{Y+VD6}D>B$Li5o
zYa`K`milIR`Lm71TDDq~oobAj>sy*OR@KzS8}I*vq{=-`f?C!3CT#N<FulQ7y#AVE
z2*qVL#6NU1{P@KCYlfeIYX4RF6A<pN`F#Si{qyT=df0WOmt~G#UvD3usM$dQ5Y28K
zcP3RuF@vwD&osSHLb?q3YG~R}mW@6u{m0(F)Sq%7retMm2UOLPs?c-{j-neF^4_C?
z#=nn6aNtqzW0CDUFBpm%({KHpQ--Z?qWdosHAQK3Icg?mMY(rd36b`nT4-pg4MAD!
zH(icD+5m`Fh&n1Zs^avJid=aeLh7ZMN7|D+r5@)dJjgM1pfRC7S`~Q!dlQvV-O3&+
z+u%|fxZZ}?LH@zg8))SC!zI*zwfMtkYM}9D5V>O4DbxvG47iO`G`QSTq>t6t^l$O`
zcqID~Oa*LJgA9KLyB*ADcDN^K82?N|s|+yZiNNnF@ET@85vE9}08D5ioCPr*uN+Tl
zr&NJ9N``L&Nyn?iGn(*JP<VTR1e2ptE+eJ@iE)kiXPW#c{i|H`n(-_fy(?Vw=4$kq
zH$|`7MQ=|IdTU(tmTUCLm!h{2c2J<&^4pJVEE(8=d19ylo}S-Y(4)PV`Gv{VruSpm
zS9N+P5VsEhDkyrLz|-k%13mIZdbArW{wiR{)#=e6X}ux_sOZfCo=$J4Mh{8Z^bWyp
ztkY}54NUQNQ1m*0r_*~}qemRYU%QLHAZ*2yiwcTf5i+HxTMj%GM_hG%2ZW&GRRXV4
z5!3Mg6ZUK!Z!hrnXTf_5czQmbKt7lj<qVUyosVm9t<$SSdl`>sDk%Pbj0ZYiEAjY1
z28Gv&dp+H6YVxCel>Gh*l}D#Xe;DDr<)Zfm;OX?9((=J|Q$=sAyL{1jxSp$m;_o6?
z`981lhfAB@Vyp}3{PEm(u1~3;=zYUgZf(HRJp>fqWypk1kCnb$5d&0sx4Yz04m{x(
zCUF(s43}J9((-W)aFtw+qMt-o?9h#M4Yo7ZgW32e9{<Oo9tr*c8Ct<_!nzc{D&4CP
z&+;%N-cPjhD8}Pl>3*c8J6GZnH;f-W-F)QhFYsIimF~^J)6@M0(pCM?4L~L>h{|y1
z*N4i^=gjXs{1cD=JXcarcQ4Y#pB+@XZhH9|z4^da^tRvyo!)*B%T{09^a?>wmB#{&
zUW2PVj)LAzHg}o&Qs*j<4>Y+<lJv64rC3XMp_Xm}8PfB?qrG&G7$q0(@z%@3k9Dpf
z=uplfNiSQvrJDTika(2gTQ2#PBi+HsZ@QL`J2iUGx#YJN^eA5yR6hRICBGYykMTfa
zKIj=l-m>Lmu9of+iAP-e?dkH{k8~^XTm_ZxPk^V(Z#mK}1rpPxymO^nsik|D#3Sx+
zQ9tx_S*e!exe6-X_kgFTyA$cEb~F>nxzfEyOBYMIcD-*xf2XIr7U?cki2|y0?+2cq
z?pL*R*<a>Lw@yp<ZY|xX)VvPm$Iym!*$=3o(%lC<J>BmiUB*$)v+<uR-I$gx<w!jK
zzYSt~e!G$Gt$412O7{)m>FK_t<(JdpT<NxI>B1GjPWN-J{;Cw?d$x2}0Z&i&7h1Zk
z|GCnA9O<&2Q!a2lu+#M+LwbIjk#4qj`8JRQ9^Pfx13XkUJ1Duh`@bi&{KCb-PPf`s
zzI#D0TlubWmG1}0uPR^FF0-}Yy;{2WXz3<h<$DzAVoBc)Dj$!z%GZnaeU&cje=a#c
zrO6pC9Cm&=5!dD1JxKX|Poqay5T?ujuVLP<)1y;SwsLcq$Mc$8)@t+?fFIJ!lkKel
z^f1)efoU?#1)g623Luy9c+PsY8vnWEa!^aRTH+D+4BD5TZfTBm-v^$a?o2IRRj*hN
zzNhHnnqd*>@wo~rANwV}av4#pmG2rnQ~4MT-Bj==@s{V{Zv^njU%AAKY5b{jBOgD+
zWKE~noP*x?fv3~^szy)AkMzE-%1x&Gcn*4hBg?H^;=QENtHCps-+Nv8-Is&jXI=UI
zjYcn`(W5W9p5K>1Pn7{#QP*|A)AL(!b*8`CpwU}RdfJ)Z2SHB{OpD=4nQp0dYY^}2
z@|u8n{C`j4@fpJgv@1O*dabfv$>w3y0dF_nRYB!ro2y<GAs^)+(g?%`{3|(s5qOFg
zY5WZBW3B8XCP+N?H^S>CbEJ20ptDKBQ_3XDz-N>EOg8W-WB{#rvXF?l5kEQh>SfOK
z-qjYzSr<IlJC)=c`rbd>+V4B|(s2j0+#iSo6`p9bw+0T3pFy?xbDU)$_g+T60cC_+
z)(cbHu=QQ;!348+;<^(X$62UiOCO%iAV1r%9aHV^v^Qj8kMA_I6DY+N!5JVJpQiRv
znjPuOGn+TD5j~SF^L#2n2El>74K=fakTF&mP(E4mn`Q51CgD$79=XyReEEsJkiJfl
zzs_>eC_2i0^7I+zH~ZdOwW$^v7^kjt@43xd*^ngZXR8m`+MlTssH6EEbBhZ+rr+9|
zi!|>+;k9n@8L^vETf8azKn0u%lG(v)VZ_s|s8R;<<cSYY=MyGzCV{FvT1B}+Rg}Km
zs=A=@>y&Wj5PY0QfwKhCm$yFTGtgGd&bYT@p3kFXWcH|3DDgqb_bR+^3|+R8zE!?~
zRc(PW_K`x25@As3|1rupu9dG4uGxvQlf^7QCxE_Y*Arlq=eYF7u7F^#2zSOW<<9J$
z-oQ@wU*$MRA$>Pu-b+B-vD?ut__325ok+eoFhFz@k{oJG0yRd~2h_06Sz>D@Y6H$0
z@W=h>OFL0eplUvZ6G*aFky2H7eXB^O1L^b@L&dbZD^+oD&ychJZ1-7G$aG~^HJXk+
z;>cc6@-Bbq6`b%h3dcnhh7ZSvr^n)Wql@^>f|2Fse4n}5|6LFIO7oaSCv#xGm9YFB
zRC$;7F7e?6B`LP_74lpf^`P%g{l3CbiRR2N4;vs7PbpDN(L9wLj+1HP*QI{QC>9`!
z!6*7;<m|AOGYcv9pUD_by$Bl`qqlZ?MCnZ_HjfBg>^TSR-WB<Z_0AFeCWN|^9LP~b
zl`K*gBY2Q&_rdkm^$n3)qa{)k$HD)bBGxga!J4K<9Az1=f$K{yl<cp^>NmohS4*Iw
zeq((sh!ak0>X44{-*iuR5K>dRhtPqw{fld{zmi*h8DEZnh8y{#;ixnH*YY`n&?~ig
ze$QY$p0_d*;XC|M@oLX#vrGt4OzSD)AY`Kz#Pgpp5}`kSyDgNgG?+#{D;z?u{FKUg
zOtmxoeinS<wiy3hLt((ygG{{GC(FIG)&^<jdyB;Te{?*RZ_`FKf{5q38N(v}xMcJ&
zP?_#Qi6eHZDIAgR7MmFJ*Ddjco~rQVerwX<-XMm7_@6HEhLfJ6qxk=courUSt;B61
zVK=Vz*$RR8xWuc|@vJ?@cPNVF@p}^QX&q0c{cT|Kc|U>sM_<G|p8+ZqX560^*Xk$R
zw;NO(A-~md2NWf~doBL^zR%Gj6Y_A9<}Bdfj7KbkzW7dsC(p5(!1Q#h0`EDu&V+%#
z)xcGpOz69x6b2nFa6jpE@Jky@3I6-?dyR%oekg@Z$P>Gf^n15_CuAaV#r>r{vP{`_
zxqp)1#8rVh*l^eVy{>zYe4p)>-;#J;mM>}WePlue_8t6|#3@(&HL}vMAL6$q{>&9W
z)s^06S3LI}slfDPa^ey154rH~&$F;CenuN%NB%D~W?0dppW?SErb>cV{>B(zmi)3G
z;(pGPk{;VF_jB&l^kSyJ#&!R1GClS`{5HieX~>X)_y=Tq>~pxk^F<lQ{)PKH$I0~g
znE0QO{II5Sf9F3q__<Q-{~<2>3-0eMamjP5Opkp8_jhh1G6MU8vDmQll;n?Xek?ZZ
ze8VMA+GJHAKNS+6WXE7b&t}K{c;jNneTng$l#eR^f0y}D<#Vm1ujGA`#8>i8%X^jo
zGxB{a{z_{f8yY`bnioG40Y{<?#5x3svM(8>;)AaHan}AW#<L}{!@rI2I;)L(ug8&#
zya%(7Nyuq72iUIyjs)-fc#m{g-d;3nM|!|>+$;Xj2V~_B{5bG~mfe&5Q9jI{;1hW4
z^Sq_jnCuN1#vQn4zFCjR4|_7cSH^q1C+wG#4dWr+<NYTAiT_RB1OFch!M}PBrX9l@
zl=1*R<*)OBBn>YXnM6JiKM(h$w~Wt0&y7D+z9D+UdyAwG{&({p{I?S#z1IPm-aEWU
zdjB8q!TkT0_uQMO=Lez?^aS0Y^(_z5ar1c-@$kG{!aE6(Ps)$!)$$(cDLH{PW8~#l
ze@;11=lvDd84cdstae6v5Ar?0Bq8v=BJXLpBmO_|{&vF%0+RQ+glOwbkNXLC5~3~a
zCmeybIzk`z+YyceKX`}x2gSZZzuZ@Nq5Ree?1TFlkKynqglNbg5RSon$P@Pu&Lo5|
zxF*YegL?=s#ac5VJ7MS71>n#gYiZi*d|Dlgwb0dF#0<_iF?6#_VaRO48ytbMP=<h}
zG7ObWDD(+lc5fdX9Or$qKArmls0<By2VaiN51o)B`$K=-62Q>k>m!1pZL7?Y{h<+Y
zWPNC_I=6!M=Xe~N4n4RQdqJ8Sv3aYdzIt6lBvguhi}mZbRy8$723_KPBsPS7i8;hI
z1PTsW4dp#|D~D6}V7?WTgX2NI?ci3t({B;Ec^q*6We)BJe9ytxfY^iF44SQm4M@9B
zZJIOCp3@w89`HR!o&~mW{I<srHjk=xElt(6HPumV1Eh1*;dUzf6=50@LyqIIptQLf
zh<&y~S|8-Whne`<8|;$0zlugHCqZt`Vjt{!I{2^YD2}6%hV@P&f>*fV^CLdi_6U0q
zN`DoT`^c<K^3ko)SY%^Wq@|^)rJ}y_&YHn~duPC})|Az3g5&gnXp<pxI#>_lyEdiO
zwb-d)4QGRV1G~_%ds_^EgL@;y0W;QQzXFeRwVNR4p7T%$`{S@x4ZUtnq+;31jg^}!
z=WV*Xtg52log>+r*A&*Wie*dgt_p?Xjr9-2BZ8BKcwjZ!iV6rzRJuu%)kT@Q2-$fY
z>Zg8;FJb<tsfk82=56bsQ>cKcod`>zpYR$$geej#fN7-&r!mLV@yhY^Rx3*UV!9~8
zZ-K{T%B@?2{xv~dQ^z1bq=zY~@p}-{>9yh+^=lOry)!`4>5WGO<4BKcpQ3jT*E+rZ
zxW57aDkyp%;(<<Yx<(Hov*~>bgmro+5J&w~1x4>N;OX=hAfggT<d4r4e-UI}r?(e3
z+4!ShkWTMOjXzA?ZF-Yk<#81BvX#e8uJYIidO^@3f0+8)^r$Q9{LvPfjX&yiI)4W>
z{%A>4`K7H^r&kVo*~<4uAnEjuYxJOc*z~^ODvxH+gNkJbye0y_E2^hU9p$q&mb6FV
z{!N#h-vt5cWt0o`HkFU><9(f8H}0v&tDw?-8qf871i`$b2NlVt$1_`WdV9eK?K~<d
zdOSB&r?(pP3V}ra2o-<-hHIT(H|VXzGZhrQ=kP$M*9>~4ct(0qEp2*tyX0Jnd+NU`
zD0<&;$+;PL+2s7UE;;Yj<N_7fPM2qX>G`0asjzR$gjKqYE;%0uy-MIPAHp61$o?e?
zVmiGO=qy_BTm?n12}rtJ#*a0OAdpD!8vKI|L2nbFPLIASb$F(NqQ^9JdJ8~L)q`sh
zr|5kfOzQNGg5J}L7@(r}cfix>wSwMi#FM}4@UQ6ID(OKyA|%k6k-iG*y2*vNGY8&i
z7v8QMcz1(2(k4F)j{@&O>r(tOj{m>JbCAr8Nw^{JDyZw{2Z{GI$1TkdN)T7X09Ae)
ziHG}A6^C?bPf<bfceyKnUnjF#Q1q5dJSFG7z&oyPfUojV2|T^rj-%Y3L_Fn0UR1e#
z4S3q?#ujw)dl1R=J|*#37j6nopK5)P$@(404=Pj|F0(KP_JdMuKi1ek-WY954+$f1
z-FYx)r2mO8w~Bt9`5EfB-}z3i!1b(aWaJHiTt9hULuT2jy2Ho3U%(3lg^#LXj6y#t
z`a_g`5cjn2IaPxpTFs<RNF};I%|TNgEp03FtyA~6O5L9X{TMssk*7h1r+^2M*n#8W
zEB0MRrcHQ8QK6ZOkZb<Rwxr{g<DT+Yf#t$LGp62d_u?hS!F($CQSJ62-0S_%2Hfj`
zX)(m{&+Ag&AP_HG|MTZ~uHGS@KKAim#r>VUR(%FtY&gECK>irMhJQUD`+>(Ujrkx{
z`S>2L6)ju}U(L0EOpnir$Nb~eCd~^oIG`Wq)X9@&e>HIbvsVgV^*>YW+#+Fw?EQ~$
zO0na!`PEgx*++aoEKt!c9GK*fa#?}rTR>2ums#)8^gAIqWA@w&cTPdp{>h%c=I}UF
zzrp{(AJllF3gF|&KkGM1D)0?GUnF@+0Vwm^K)YU+)#DUC03<)G*Fy(cri`!mq~I{M
za@C$nQAy-Smr!Yfs?uE2dsM?-xeECC>8?;)BzYl|n1PR-z%?uK!M#<eQ_lL@cRWq}
z1|Ki+_r@*XHKb<OlI;2aW8)9Cet#@}@THbNmHZ0+v+?t%KCQ_)uPH<w<eDY}$3NTu
z2j}1iajV9SWqO?D^CP~Jz<2Lq9D*1tmH&|T9e{0Cbk6v%4iNwR0P(*VApWBP;)~?K
znT!9K1H|9cPyBeKy-mjd4f#;=QT|YxFIf?yxxUIUkv|F-vgGGL7_a=ua>c(p!23Qq
zkmt(lcp0CI{(=GGx$eu5>;2sW#P91T-lClSx9>LxX!*;8JYz)W23PbE(?cFK8a>b_
zOb>YmEmxT^un!m(zqQc!n*vzu*Fv6ShaLIjOg|I)ena4zOeC%b_VE%WZoiY~_?kE0
zpCG<7K?L>#)KRX}CfA&PZDFJgyl<Cf#lB%2oC+>-;nSw20`Ygrx=BvP!TI37<onkB
zNaODv@uO{9krjWTG15i<3zE1MA27Nc^u`$XJK`_4&xo+_FEM`Uz`x8;K5A^I<8Y|)
zV=|s($p4pI_Y<_XHV%g#uaoht`{Quv@oGo>)keD`f7cjCNEpGwzt#vk-oMUx%klmV
z!Y3tzUt-L1;7_n?G+!GtY@+1@1Z9Q#iWeO{ZFHk>!#T7U2EAJeQP@Ja#B<g-p5@%{
zJ&^QxZ_s(qvz_($0q?JM;p3k3BJ#P6{GqVc5rWSz6QV;^^n<wPnb7^-!(m9pGk-e2
z;(ZvLRs5jtZ*t+|Uc3jP&jkHpD3i5>sH?4nm?!QfM0eCi2qp9c;RyWT9s1q`3DF&u
z6GHh~ONj2MmCz5rYC?2J!siA)IKSaNx+6c*q7TlEgs^cgB1C2y2vOLN6GE6z5wbhV
zthn7Bn+8>#M`lCw$Jwtp^Y~_-x?5M>SlbY3aULI?<AiP9KgBw0o9ez?I;*X&luPqQ
z^}41OZ7tUQ+A<u^7na=MI9f+Ei1ZiTP`Sx<aBY9sAU1gHzGve0L%OlreSmI%$eZu$
zFSfeBSc=(|hdu)9FTQWCoUentJ10&A$gp38zLMy(e%{;^t>41a#>FATIO^B6j_y9_
zSFaG@-^mXdc0M78jwfKry0@3f*SAC>29n1b@gSGJ(Rc<IE<wA;pB-w^Zf9r@&~!y;
z!7r}|vPp$pc;&d~_^blQB?gWmx-Dlp`VYoU#y^v%x=NeQ578Is>8{1IW%yS?(c_wy
zPOld9s4I{jx-y&I!yu;9YeO8zR}~b!&jU%Pw@u@ZU7_OdcP{?A5tof#+Qr}F8a<|?
z=>4sWzaZ|j(ff*vzprZaaB0(9j%%RW<yM)4UL|n!{63}8LzS@UC0+DdbI^OtMeliy
z9)<#&-j7}KqfIYcemh<A`-w&mLy1i<;^OZ_4tmut{(hm+<Ge$a$3MB~<yu4jwu|0x
zG<qD$6utj&<+mL7+4B2ySAIXz=wYg1({uYAa1ELBK^0VecKaOoF-`}8#P-3Nz2fgW
z$P0gVec^XB*j80g^sWJtUSDnmJ;sq9+q<H7k2}9P=&g3;ccw;9%!5Fa{lPL9f6Y1Q
zEphR;NTa8(ss7MKZ!hR&E06EH=-s2yyGG0J%eV%rEx)5V`1^O@=<;jO=v}MPyTT<u
z3N~ALT<Ve^&n!^oah*o*byt2%bI^O$mEXrTdX$eU-!r(@^Sd?&z4w8q=l81`y%LSy
z3|D@+ZkR2<(_Hy|N~1SHqetHO4|Ea!4fJ@gg1X+!bhWkD7nngUC_J%7g6E|&j(FMD
zKK?=GLy^$;%kY_^*DLW9e`_&Vy`*k{r`Y&Cp6T*?9{Jsec(yl=xx{1pxDxeEd)+9;
z!%{qBddg>m^};$%xVk|tfDE+uS~h*~Yad)sW}x22Gbjq}+=>S|);{{T&1PE*$!w`t
zs~=gHI+z~zxWCK9SMO+pFpN|yZ`2pmv)iKofc)?)KT6<L)ipJdXq4#>I{b-SYpMS-
z40R1Uh<B)iGO!NY_CsN>wKj6nhPak-2)wp&wC_E)@;QR&w>29i_XG#=d@uePa;0I#
zX8#?Go$jZyF;fnnK6W^^+Dyo1w^Kew<ezpdpVolcRy#AVi#|Oh(_?<PH&OK^MC1H~
z_5lXUi+d9j;?9x}_ag3>_XMQ>SqHt*#y@EJ8H0~-(cg}N`5OZT{$_D!{qX(Q<-Own
zoa26^Wv_r3#5fLn!NrIlg?swCd2xR|AngV)6^Q3dXCyi_=7V_RJxm%M@8Mp($9~U)
zACNFSa-QVDq*XizQSls%l2;Fi1Oe%bP)>-v)e@px*hz@~_nU-NbkrxgG&8{xDF2~w
zmIgg#b6s`Ja!epf2xsu)(@er=Sw-oJAr5QLN+#Rxf>2pxOLL?J2Lm+5svB~@CVV0s
zDGO@iaX7N2CeqA}7@23;DcP>@gGn~aSC_I=&GNmV!O+k0Z6F~<_fgzAq}fN8x7?DA
ztSY;$Zcl<|a;$nCRPC)B3DtKE?wU96?uzAA%V*7AR8eKA=x#n(tOJ);#+Q7^KF~d=
zw;aJ#co*&DKG{C`Og3HPF<kJP)tF(51?*qECc<+3>Uib27yYP+wb~3XEAh{stQ`Lg
zoHw#PQ5PXUq{sF~8?#QY8P7z&3&_BC7;XTPPOlsUsIQYAnxIWjv|Ze*eC)@y7zY3u
z6g{S`(_5|aHv(~rzwNlz`8$gHZ28^lqF1NUV>*i7a#wyyJX?OLckBFZ0Rfd?bXhjN
z&!H^IUm5-x*w?c^RDp5)|7-jZs=BZMH##2qWB3xD>*;bnt<q(GtMV~UrmN_2jW8QM
zb(U~Bi6iXO=&>vmy%+JmKA&#Jy&lwUig<`9m662DHlKb?;wc&dt<LiqX)yd&;;Cqk
zhixLp`XPS|?*UJjOB*7_<2mb}uCH@4t!VMRqqtcs(_oz=J?8tSvQp_A6ck~g`Sj!|
zlLzg~c$ADHOcB51!K2Epc#va0?L54uGeKOwXS-lnFXOlG{J6K3k^Rq)dy~Y8U*t@u
zFLle;DVy&~;2FWx&bGkLgCLcBx(yjk&GWRs>wWH1-<);DnYY^C8&-dSCXF-4Q~u$z
zaL$+SSzxwayYp!#o_t>LV4mIa*7@Gvhex)j9%X&P`#%uxzpcIR>Arw*T_-0$E>car
z<2m!@j(6VN@B2#Vi21xlFF_8HI|V`#iJ3`0Fx%Ttjt;e(2is4KxUO~Ojei?Dh(~V)
zcD!X69lsM1?~V-}R8BEcAlkV_IHzjoRXA73Duf46zv%jByuhnelGW%3tYhYx_TOC<
zI#YipVvcC=99v>O@X?NQ%zf+{8I@}G)c1<m^PX4DaH4HkqTQD`Ff9F2r(hjK3~?fo
zJhJHIKFCGXkL>!Bv+Oc;#Kh@PbQ(KgHJAS%=pUl(Xu3hY^iP;cks;*LE$*?Rt^Qbh
ze*@lUf3Z!*)2?jmCdyahZ6H}k^cX=z?~}N<5-M6k*J%QxjLZQBqlf6P4(u<$-aixi
z`U~V6|4T+wcGOE&u#(EaK2Pt{d4FM^70IlO!2)1h;#0QNQ@G!Nfnyu>lFw0QGVpyN
z7eLCAddjt~^z=TT_#8JG_}*A7Kwc>6DSnl2hD!epft^WT=oipGI3Ds$iy)vEM6c()
z(nk<qAnzUch$lYZV?FRfA0gf-;M4v&60N#~5R;D;60$Dw{tFU*OTvGa@VgQ|FX1Ud
z(D~nh-Z988^2hhDmT<j<n*hCFPUuHSpZO(U#e5I>`84k(zq;PD7SHu{-=}!b$(Kt}
zDGOCCS~z=7Wo6Z@*$b<d%vxM=cjc@(71Qytrf3xwVh6vA8((|EEAq3uH4Pv0#cVoK
z4j%b^sZ5FkZ-#cD54?}qfv#=u&FOHicFBrOyj6qWT`Tvf_VbM|XHF^G3VfxC1*A5(
z&R_ZQUdP7KE!9;U;?*s+>g!zcd#Bd3>Y4}Q^(_(Cn&l9bsDU@HI_1nSqv4~h{q6y9
ziUUPsy)y7#U#nJI8-54c80<`hU!cTx+QEkk^l!4u6ff;To4rkYfMzWM{rPx}Xc5@I
z=|K%0|A>b=UODb{T=tm^qTc~5=MBOZwD}+)?ZZr-^w8}XP2f+b*NSKCTU1c=?gt*G
zNjAMFL632yhfAAYGp==ddvRZee-#wH20YN|?bG-}_h-|ahHIVP3EYcu7?45Hn~ZCn
z-a*i7#WV89=PJMCRj0QW`BGyNqHKD^(djKf!36P)^f)FddOiq~a#TgS7xWmXg1UYk
z&j*9|mq^%+_YxVALD4&!1&{Bkpz!Vlp01;jKRqB?gxSQyRjIruUN#*qA@L-dal6X6
ze4yy5H6E2*Iq(jumjD%i?lqn|$ay^CDQAwg#ACh|gOH+yTf>J4&P|w}Dqq%x7WfJ^
zZB#2B1Ml~kToxL%j`oBs2dll|JTQ?uxv>J*7_y#Y9QP-;Ye(IFINTGv00-En^PmX9
zefvJc_S82=>}uOm5cvkPF3zo<tuzkdhM$~H@BRdnOD!t)udG}uUHttYLKX4EhC?yP
zPt*T@B<NPI60x=ef6g_Kq=6Gs1)4*()AHju=h$M8hqmH~U9VV0OJ9sVDuP1NNc4E)
zx8s!BargDET!j^u-ck{PodG<k_BCu;36*qsI&n<*8(`O~Z#pPZxdr#ud9q8TXmBsG
zU3uTFf|~fT#4dl!%kBIH-{muTsyH~1N$?11$`4>^ow3Z@n&E6cjz)&$uL47Uz)KT7
z!A+x12l7Rl=@E!M9r$#cT`u|Yi%ti|c#HqTTWm>8uw&IdOno-h*F@xru)$bUu&FuH
z7?d?r#cpVd1uO2Fm*r`7V=&%GV{lC@QX3S;WoQzOwJlBcwZZYB(wlECD=nLTV{lz{
z6!A@s!Iml0r%jtOt+pgs(@@>GA-E}mLu&CnG;LDpq_W`nx>&3^ddp2Wp=FT9qzz3?
z8yX_frg%$Dgp-(?VogmAHFeeXjW;zkY}z=nxuxkoBp$2{ub&=XKczM_b?Vf~wKtc-
z=y`KZX?RNb=Jk`;O)ibpL?+jkO`cj-LSeJQGPu`=*p}6J@>L=zok;0Vl^OkscngSw
zAc!hl_?q7<b+I}t+V}>cidVE6Gqj2k{e;AAB~-YeHB37rR-$AD)W<H69U9j$JYtn0
zgPQHk&m#15>>sX|`1DuiyX?>S{;jyr1lgg;2YHS!vv5rD8>O<-qwJ`k{hj28udu(n
zSfj^#zbjrCA&88?c(o3s?yqp+KgtLM%Afk&JXic85o-wfQ@>OG#(Yfr92*&0@jn)h
zqddD!1;+o4D?iW3NR=Mz(I^m^3Fw7Bb1xy*dFlaqMqQluP;38^5c=4YgdhynNW3Tf
zK5(Px&`!(u?;ym(R=|;%1U$xjyuXL{7;^+2-2W|~YxG!_UKHMP;$dR4O~wZSsb^6h
z)UP<7p<gZO(0|scU*-PTb7-=o*O-RopO&WPt%KK^obL}s-*Ud0Su)C{X1VaivJj{B
zMovvguEbPviL9~7sBfx?HT3nZga#AA;yKPN>a%83)6f)kD;@pq3jXBh3H3+4xnW_A
zI1vY(WeW~d!Vx*qg*6owcovplh;M4)1Mw(Sh8`NrgINBlZ``mDYf7b6%R^Na6_t11
zJ+%s|N?5Kh4XheDB@YdkUyZJEB`{dl`d6u3Nm-wa{@6(==kA(lY&r^_17VeYN|1fg
z=eVFri{?}=oLp6kW;EFFMYKh&D>N3NP0!OFsBY-jAjoS(i@^4+2Q*<3K8?Oc$1BHE
z_Q5KkixA;@;IS7kw{FE5y3=vZ{)oww9=n59{Oj~i;GTV+3W^^47oFbo=&Kk<demJM
zy?MCS>E+|*8+fLIqBk24bb3Dlk#amEJzdWl4rWP@&lxywkZ%=u&42PhJSD$2+_d6e
z1(hyw^mP4rA&6(B5A&6sk4ZA!GCX4_hdh<91n)_Q|Nlj(`ELC+@bo|&hTq_y*QLBc
zAYL{-hG!$IcZe6(>I&~wT&2WQ$;|}bvqX@A<-xEBczS+s)bdN2sB+_)o}$I~J^;Nv
zG7Tjc;<rRLM7CtqnBYKbP1C1@<l5B0`_@Z~n6fobp|*9Eom=a9u6ch_=rO5zy@{Uu
z%_EaLpZ*Bz9qHlL#5|*Ka0_sPb;TTEZnn1(TcpLWJx_ON6@NfqEG;cw=E~2rO^8fc
zt3r$YnVt6LX?%smhmQnxcKr_7TG~71oYG*-vuC<Ir*^eLPw=H;J-)!gBY}n8=D}Sr
zCl~wU9Z>T+=Zh-Q$;M@L&KGScmDqw}4tK<gK(2SHQrhydCwo-jnR(uh5yN)R_t+nW
zkt;GJAVN<5F<&vP&tzbKxW@lEeDTDGZ>e;2{nq0Dw9Wr1@PAhFzpWem9}X<+vH17J
zJHRMNhC5?p$>=nV(by;+GGOfp4}AYF@3UK44P(byw*5dwd+b-O+x<rD4f9~)VDQ8C
z!ob}2bQdUD0sM>a&-jxId@~mKV;2Tq7?U`6VeEp$xl!>^oyOIuN1>O~`N<Xd0@0PY
znPo2UCGYT>3&xA(NxYAxt&i{_4@uy%<e1cVkH6X5n>atLWt2^7j3R{>p_bjd=0%%g
zq8-#oGyO}&l@nfvQk#WGHvrBCECHMYI00}j;6%U*z?%Ts_l5xH15O590Lbs)E(Dwg
z$hjuJpL-|Z3_#8iZv|Wocst+{z*&F{6@YgEver}rE(BZ(cqia8z{P-f1KtJ5Ip|VA
zt~KzytCfH&09OI70$dHqGu1x>_&GrKqiX=G0jmI6B_n{>12zHP0Qex_rvdqW*>!-s
z0Pg|(3qaQ0uK?Bn{tY0e(Z)Xma!&q?ga-j{!Tn*t8v%a?SPu9$U@hRU0E+>;0V9B?
z0XaVQ0MhQ}#ei}R;3a_T0r~y-n*oae{eag4a*Un;I0^7(zzu-Y0M`P}1-uP#C14#O
zzcV)xuu4LH$F3gtjez$7HUr)d*aFx97z6w~;KLGr5pX>2{~qvjfZqq43D^Nx1$YE-
zBVZR`Bj8T~*>ArN7zR86crD;>0NK6#7LYo~X~1T{4*;(N^k95oetduv0LKD809XKc
zJK#9LaeyJf7Qo4XESEWe+X3&Aum-RM_i?~AfcyqQ6!3At8Gv5`qz(0}fKvhY0^S7p
zZ3+JcFo^r_0mcBI0pvLL1Hj3EZGaB}b^vmW<~IqbgZ%`M@^}?+6X4GQw*kHb2=&eQ
z0B|$lhk)!;dI0Hfa}Mx9z>fe+0X?XcYXL_91_3Vw<N$dwAgYL{N9BM#=Zf%Zz!QMi
z0dkz200?v=1lS75{CfbIFT!bf&U#FKh;S?J8L_-B5`>YZ1#Y^umEdI67z`jVsKESE
z-?$0ez-sZZp`kj4$$K!;5TRpUu(5h$WYXZ?g^ExO3r-7-GSTP|-i$<Rs+++Gl?*}Q
z#vr~gR2`(gfuoJUj6fJ18|!cyEWRs*!$%`H6SSXqHr7WsR>%1Hq2T8rgWBMl!6A<q
z$R&eA{=7im-Vd@Sedxs-A}9-F{qx(kvKrjmw)BF6&W*unyrwQ#9SweN-NfoOB)hRG
z8Vf=yO|=keR8Vb+1UCbvzA+kKzrMbvo<)v5flV!2X~shxfoUxkj5(`LeIw$kgX?)x
zZzPC)gZSNu4>_SWO)~Ckj0Bt32S0uLgwG4o*isrqrK^e5LeT5B;ytUXVY(M@sBY<#
zO_=AJ8zNikV_QiE(!oKyk&Vr?3~pp`1*<op+9D&>C}lSZP^*cEl&YENM4ZnXY=~^a
zeppuF{xe$}LEYVmJOnq_MUdkbk?kyL)HKB#6f=}e6o$+C_4RrM4n`w5KvvYhS((-)
zX1Ku(E!7)0BI9+C`??71q%Fk7S-`cEVDt<!uUnb5$d+I|S`oxYO?xxQqX?N^<z06#
zT&>7hb)&huB?^XX(S-Q|$}Jk-7_rK&F@|N#EV7zptZ2Nyv1v1s<PpR{aggyWOa<m(
z_^-f_KOe*VLJaM9VmM!nA$-Y-MaEqivX^3*z8gdH3Jk}qFa&=F!)~=vjs40oqk1D;
zdZTDfMm08=(y&t(F>nSn{CuPLW4LAOjG}v}v#y$}Ya$qIYpPptiu#7g#Fj`b-qL8)
z)VI{cH?BuD&@Lx(i$P<|Kp)ivlqLvK{6<=8>Z=<jR>v^<*0TR<nHa6#(1@`&Qoo@t
zW<a{t4N>`Q3;HHhBXochQ3m&80A7!;n;GkyS~gBxkD7z4c#E+<-q0{H8f$9Cz>DJA
z6j5n!fZYapnHa+cZHr=^QMVO&Y?NRkDo{L%@%KKAxeZ1`WPNPnI&^9g>k?m6YuG9t
z+#iWqk5F{TRb3=nAGIDt!7r*V-?EURQ7t{xgo)@Av2hlIF}8|}>qb6kjBi{A)<oW$
z3>-s`(HDh5nOP6%Y~56AG&jVhG#)TS#j}O+K)eZU*}iQtTF`V*u_i{FFgPGvEflEC
zk9F<Lko8Q@k@dutrKk~&Y^=A+F^VJ_4Qxd=tZJc>ii)ZcGw7*|9rBTg5vy;g#qZ`O
zjK=ZCS}<1Ag!TDN2D_;G8dL!x3;T|5ZpKKw6{GKik(MUZP>2Y>&2`nrI;<PqZ`8o_
z*kIJwZ@~HDDCg!ngAJ|4Xomd?N0Y}JYhp&c8FDkWSV$O2#oUPF|BLuPga2ZTtxNI$
z5dNRX|5yyp8}R@4_~$;T&3W*>$NyLi?#BWD)K@kNz#@ZtU85M!ibRYxAGg;R)LO&>
z%iW7Ob0yvlgxWfU+PhLK<2g^X<F)-UOl!Bqd0NL&X?@d5i}Tj~67T!j@DiEz5%Tp5
ziOcz>o$lu?T0uPeh|dwIuh{W(AI)pYkYP;Lz_pXO*DB|Wf#DGzw;9xIYbTjl+Riu&
z&4g@wYBI6JzevBu{TSChxyXdPKKxv2l(0S`P`~0@%gd<0DsZk@?YiHI`pm#OGG<sn
z%&U3Na^~6z=i@5y{eO`+EN8BrXynA6o=?jMEMxk{{a)e|@cl<+Jj<58aMwb<3@pE~
z@WuPF<e%j=7JGU)?^S{Cv+Xgc{IT6KD1MobQ4k~b3Hp+ePp-L8kKkI#T;7AwSU}=k
z$>+GCWO;v;yuTiB7>Fr)SL1#pij(hiEhQoEzbNk=cu=Mk9`&=4xc|JwV}3j+R_cY^
z<HJ08uD}l=lnxOOD4qir%I84|**=I@Dk1ey-j_?bK*CB1S4+57!a50?C8S=%_gf|0
zE#V#spOkQ~g!?4iFX6Kiwn=zU!lM!%m+*vy?@HJ$VUL8YNFx6d(iY77LJ5Nsj+d}h
z!s!y0OUV5Nd{5Xs0awfWwG!4z*eu}|30o!HE#V#spOkQ~g!?4iFX6Kiwn=zU!lM!%
zm+*vy?@HJ$VUL7V07d>K%$KlG!k~oXCFGha@uy2zF5v<RD<$N9b>gj+uuj5e3Aaet
zD&cMk_el7pgnK32C*ghxpOvsp!h;eXmGHQPCnS7V!fpwBBt&Ot<zGVX=O^EV5(Xt4
zFQM2g%>2vyatRkmSSjIZ3D-(kCt<UMsD4(u66Q--C}B{-@e-CwI9<YW2^UCMDdB1f
z*GgC?VY7q)B3-Y9J_$v?fP5)F*slmVNXRjd_dyAZB~<*~DDM@YQ{=tkcc#2AmoNy(
zHDL13HDK~N3`{*v2s_XB2w`_PK{x_Gz!hu5a?c^w8o7;da!VXq$;L>(8wqnQ%Hk7Y
z(2cBDGfTKGnwf|}k;$^*Z&2@L+sKDm=>3?7TRWpM)s3~(Y;5kc&MTaeGkf#&y_h+_
zcEYt@o)9IiH2C@ytut6%t+7@(T{6I`srahQplF9~mb7WRQDoN*@?4%Qn-{TVFqZ_&
z)Xu}ICHU4#nU$Le(~NQpA(VCJ{=-3&DxE{-m*gb0d}TkR^lBy97<idle+lB|5;Z<N
z#p+2FJXYNpi-t;tdR;~JI!pE@EsAcghgoA1)Rl(Fr2ZD;Lqkq&@YF(s;a$liw{J(;
z<f<yD*EMxj)s0)L*2TqXW>m`-Zl>RMWJ{z*d}3#sIBqJ&$B@Y<p<9!kE?g4qPxDMg
zrLw+pG~|7$&!PW9H)n^vml?*NvlEs9(IQZ<;5ALI4D3hspkDb`j$epSc;&d}+*Aej
z;|$*c9<_mT-XKiJoRfVv=bz+<^nCc|yj7>S7x$dos-Wo6{;tzo3wn$rJ#^bPy?waW
z=^e#A=fo-~df&tYonABOaSS9qcKeDy>c%>~eB5xZuY#f%#B-hAZY{rjuIRP8=yBd8
z^gc;Y(c@XKI=%fGJq(97y(>W&sCId99wT%^7rlSy_^;t{zCxWt1(mKiZv_ukoeAQC
zW3md&2Se0VzWnBdk{{F#o4;QoQKqZtO~J($btCZrj5mR#=eHa5h{y7P`e4(WgmiU!
zPoW}iApsc_fAj^>>D57pAs*>b_fh5Xu#{h!e7_ilKbI9i2ByV-?xE7tt%L3~S0Mqa
zbVmYDPxl1U-Hmvri%UD*G_G~uh^IhL4@`^UZT$1Pls5>(`?_^0ei_Gq&S?l$xRZsT
z1r>Lx#DjQ5SOmNx6^SP*A7k-M&qp2ljp>MIK0YP!*nZoAr)c5Us6#~(x&W@Z_DFiH
zTT!fxL~5(V{u;VS4CEUzb@FtHGO%w%j0K8d^;zSwmZxP1&(&JC4=%xhG4}RZ@eY5q
zwR)!)a$Iu&hkHSO$K2uqk2=#PInTeVZEFc!AW~brDa6`~`9SrWGcD(AL?_FExaB>w
zeaFj4tQG6q<{fwvD;2N8B|&>t&~UwfrrZyojfdm!wr(pfFk*iAG31-l_dD_pHcsJn
zZhLL?akFOrvhOo><Rw0$a~`MTt-IO+Ps}Y2sK~%GxY1AW8JM0$2z!RTicv*Or-QUa
z_}KElmAi{Kh22Hqk{{$R5I4V5E+h!Q3v-q~J~DlAxpg^IfexJi<PyJm@H&>-u9pK}
zX}^_MfxkKsJhXdxaiH~_C+;mb=lPXP+yWj7{RQ0YY_yJSH<$RgSow?>K<;U5N{Ek6
z&GQYS0Fa(=)%c(G;dE}woMR>0`hVB<F(dVm*Y2Bm!B0nECrGA`nkO5`udN1xsu>%b
zM7NZ7RMVV&%~0y=pKN=W^{2gCL(Re5YZ|nV@Si~pgKDkfuFU!ZZ6FLk<By70>ktPr
z3j;w!*AWNdPW~udv99s3AQ;4B+DaJa@W+9(S>TMv<Nb_7_!fT@j!N?{ooQ0{V7P}r
z3Rk2#j5|$?AfL-2y_VNb9C6|pWx%;QLoPYYmGOg-L$k!~PYzE=oc`oMdnv<S{wThc
z9RA!XhhItD{^a13ldW8GU^2Nv-?IwTY|nZl&(<Q;J!g2CkZrF^CYE!2=Oi{y%=|JK
zLto#)q*Dud;zZQU1AgmZo6G{soa;ZdFEg-=$HK7pc`Ao8a31=SjOQcXf58>MlMym7
zex@tFLcY&>F&2ixA4pu*fw3?YYUBm|bI=DEzJ-78t>HIU8Cb?+akyHCR-Rn{32BpQ
zrmuVst^DO1k2~@=#^@z61dE@Gg&!mDEq*RB_RIA4;@Q|?m)U!dtn@E89(1JtDdQcN
zJiqI>&$rfxppa2t;yTi5LNNEFgw$oZXXhy4C32k!_-dU=tV<!D`5C1>FC~7VrDO1Y
z{E2vXI=hL7$Zrs4p}$DRyXi0Gb955)v+R%lA3GnEJLQ#-e0-Jg6XYX^_o@4p6QV2|
z2vO#H2vK(5BSalOK?q&h3tZZ@#}lG?FCc`X7bC>F-IIi)Ek6KMPlM|>Sf;eT5y0l%
zuSIS;jE1%Kbik<ER1Jq17z9J5@aL&tzqJZJK!e{QHC^h9w6ROAajJDH18DTeg7uBT
z4DR5L%m{^H&eJs1DsI#qGLbAyPv<AW#V5p_Uqa}|jGK*>k3l92GgBlZ1Itfgegf$!
z68$BX?JMSXeS!baC#o-@$ySAt1v_|J*$Uue6U$Nzp_^5u_`|UF@yTUl4hLk`-2aDR
z%uPyJ$#XBPWMK%467u^W{Vy$KD>d<M{}r%rKO>Hd>G!3qNeyCa<>0<hky%oMv7atr
z{U3MPFQ-}h<0+f51yU?wghKJgdic+Y{%IjreyqL|J0a1{4>sJ7u|-ZX#4C?utoSva
zses`_ge&ok*J|BhihQnsoMsrCaG~Rs1A$|?3Y-%$oCcDPw-(QS#t0b{9?u=r?U?+&
z1Lqp!@Xs{)&spy6E_&s-=bTCfMQ?_S9>1S}X^Wu8yeWDdcY$i>cMopn;9dnqZ$BRB
z{QV5{f_O&$$d{tWJ!d+-6S(;n;#E-ex`C(D`vCOD1Bvvw=Rwi?oQodU4LCPZLD5^~
zqF01Dfyyr~ZF+5ZU+0hh4z-FHprZFYp6mQg0g)i$$KjvT3&kJz;OO+$f{$$Vfc{lF
zUMujj)q_WXq^G+a>6XfLF%7lTJ&S9d-dgaHtseXr@N{}RHMx*am5;eDdixPE2hUVc
zaw*3HogUBO58@f+g6W}6@1KxAoj)#q?M1u_ir%+@r_<xP^r{|Et5W=_bq&=n_kv!w
zdf;By_?4F5%Qbp2l&^z75Uy3s0V@8QUG?B2Ex-Eu!j0fZUni+mj7pkJi{V=00kTXP
zh?i}hWU<7vu+VpDYdw6X=v7NRuqlF<b7pmeCzKxpzaOB>xd{DVGoFvbe-Qsl&QaiL
zuNybwrL}m#^wfG8WfP6nS|>uweWU}elT0Zc{5pvbGG?&)-to|;Rc@{4wBuzx3ugtt
zWt&V8E79gNJs%F^VK~ctY0qqY+P2Uvu+}=vjzrsqw!OL2EH#_Go#pJsj6|n@9?bGS
znA!^+rpF4OiPaOiNs*XZ(D-p0X5IV@g@FqHP|}B8{9SS+zfXV-qgcL4w(=1rF)TUD
zYtHs|_m+R84rOJO41MgP$+(Xc=6RC~z2*|UHtVAuFLG6|yLZ7yTSq6_KCq=H5Bhvj
z(IV93;asP3%j18_2h#e#R6hSr?Z(BBP!TH?!VdnpZIdx!$`$)S=Q1AQ0sgr0YArm{
zYG6D<h(8K%qZJ>-qsRFiLC{n2!p^%zAd#p20%KsFj!V3Ocv4+lE}nw23(UonOeQPn
zYfnWduZ2Ixw_-VNGO)~O@BF#eg>(E+Wknp`ujYjeyl+xBfcbL#QI8n^U3o*f(jVTG
z^eI33zjL0<z;x*EE_!$I#G-dr#_tgEqs4w%87=rp$s3FQg+`5oe!#fgL4S;~0P`3I
zi(a1bYwK3jMe_F}$NM7;p4rD>;g2?cY~4!y3+->iTKNfBc1BE$gTR}Bx$;avFUHA*
zfV6v2US3R03jleBY!Hxm6Zsr?+(%8kD&7N+b6Dch#hrN9%lm17!(cCU(80~1(gWV0
z(gU75y&%(tj1~|=HqC^P=^jFF#y<E9-eb<>1upG_#e^(e?4_(}-U^$W^<_@#@VO5U
zs`~8mm3_Qp@veBPe|m#Xr486N<^JG9)o1N5GiLN)r~Buid_)~z+khD$r-x}si_#f{
z6+pP2x^!@tLCnQV_1!$qw9gSi4rX%UI6aEN@_>{Sj<5i@II#{^l}E8U(zj#gFS={?
ztVLB>KAw@W)3~Wxrx@k-i*=lygu{(W;U3%P;HA<&Coee<-a-X(l*At^(VTMY$2jXe
zA8H6Wv=VdV%Q~m&4=+qK+Q9{`9m(!hys#YY{b}t1x&RTVpYR&pg9uY3Q~=$G2>jlO
zj#rMSJFF=2%khO_J@9m$X$o~KJf~fO$&((to~Q7y(>scLjvFc{di(G|r+1G=k0Y|8
zmjE%HUL|fg4yd5$J&fl%y`7-PIP!-}n_k#Ok2apUiWs1xce9J$6B<3HqxgH@MehXe
zcVwaWI~TogYWc;GW7B&K*Fd$)jdO==@=E|m&+kt(dKlVldTT&Tr`HX7+2r>b7k?jU
z`DI;F`MuahuM~x!O@09vJufPUDvvQ5J+3k8wt|>emk}j+C!{@v`6%TL0`aoh3OJ?{
zPlb!gxE53#&&c34#34cf@XA#ro~YO2xYp%dfP9qW8S9nq8#)5-Dq4s#mZK7%z%!Cm
z^@aJz*o0#cG6zl#WGe`lO_d)D9N4GQJITs`)z-)3{ATN({4i*`Xz9Cr@Yx*)C~lrN
zRpARfQ~2SFv=J=uroHCRyH3JPP+%Srhcp$JoC!R_ZBog2e)x=e&OC$2{J`vU$x>Jd
z{E1(mUt-=<JRa{qOM_*gqQg92a@f<6TvM1_Q2^Xv_zj#2TNIt1Twd(={2b>d<(Hf-
zX@B9j@UkoE2p<kSk^uD&4|u4m-&0%wmI6D!N#2(EPW~+*&fWEUVm@l)OML0!fT<-w
zE;N51el-~{NP=K|B$+yS5}BT{JwNd1EL@bliPMZc2g5%NJW4Atc<|$7S|nd!zKL`S
zm#wTcJJg{~$%;Zxx92<%dSk@}E3Ff8lZy*+&{oOWJg^Vupr!|Q@vu(wpmA{bu#>mp
zQW#Wz^gCqb)?dSEaPt+Oc28TlJutuBY)`x#n3d=m{Uf&Vz?`#*-}tS=f<bfFhp=k+
zW0xSkl}Ios)0<mdgh)>Z*@zeR#tT;3{2_bH&QW|$rKqGmR-6|v<Y7(7hv&HG0AAqb
z(q${n!{Qb56bM0Z<2|v<kT4>HNT*njrMOXmW{WRz#ADt93FJ{;u#b2;PQC`7QLOnV
zzl4i$cQitNVGSyRK)W}s!j<2199MIYaz>=9n3+PBwqSz1qMVqeZN<f&W2i5|l5;Gt
z(Cg`o%{#nIKizB|EjjM#U?fun>0)qkIOWgx9GCf8Rk_rBRp!e)2YPrhXdy}r7Urue
zcV~ey0Vfb=$_=i8qRi5HNY!%~C+(O=l@$xJDX`d87s#^KUYxd@3LK&3e@@ihE|l{l
zK2!o&+dlNL`7DHqjbGQnS=5Eku~O_fCu+r&o}(%M*zm!?yiB!t)~XhGkc<aWM0l;(
zJ`Bt}u&Wmm&lfdh6|3Yji^b)|L1fPCNp3GnE-t_c&{wnO9)%QE_Qs24HL55?99kPu
zJv}AuAYBkEMr{_wcF@!5IpjHwS6Eo99E20w{i9+RgBwQaDWa1wD}5-?!o<rS(}&uZ
z2c}>!?C_T1Q%KgKW#R=0Pm|wAtbCAJ9DU5CXya(cE4|50IG1}~*L&duf!PPlu9EiT
z_5x2&_-tU_fmFe8vujsxtl7i~aIyPP#nCsJ-Da1=BXZB4>4mWo<>908Gill>y~v^O
zIh2H<(87xgVnwN$zVNHDEC1~F)K(9Am0M<BWS))vCo<tn4};k8Uiyc;<CS@^<W%_R
zvnaD(9JZF&USQyWHI*?(eQ??~w-+ROyQ8a<i&-y_%|!30%_Bu+8$K_6UE)X}HQxgn
z$daMuFP{ZC&zI;NX5I#?BCN2#@v`9_5#mE+hxfKVBGu}nGkx>{ao>lAC!UXk+sq|C
z9H?#J-0b1$&m=3oc!cxcz|T?R=x*>cm2yg)>yFMfU(K+_&R&&ufzI4YFh}{!28YX*
z+I^9didNiudvWpyz96DZ*XON7ClUAe#(groK}Al~8};+wHoxp2P}fI&*zSSrKf1VO
zKFHUX9>I~q*L4!oNL6~!bIj|yLseG5#JS$s4dyY_{Oi$3eSsIer4ah6N{C8Ti`2?q
z_=q1%U+@AeDL*Y`wK^d($}91!?!<4L(yw6Eh>cE`+kWNp^!c3f-JYYZik4AwZqq!^
z88(jCEogT7d5FgXFN|Q95--qsMjO6xzIpnN_?zPWG@F{Q<cxg`<BM6!+u7f4hcE*a
z<^{>koSYo)`t1x%5FXi$)}Gj&Zv=MI6)Jg|dC=@iymfvddd<RpYAS-xwdB+cG|k2N
zV7DMTK7}q|Td}{SQ}oUy?dWqJnS=K^`@oV(+#jo8Cq9e!xVa#?ieC^|<w2PglynDn
z{=eWi<u5}<E0^Xi&R>c$l|vmatfqbPAA!R`AYYpn6nWavko*Hr4AAjArv`;~|IDd@
z#YgOF6DMRMef079q9?ChW(^&9Kr{^eg&x(9XBZ>_(T{V$pKf-7;lMK$oTK?Y$B?JM
zGi^&N)eM5j7&knpJ{;kZ!{-PLpLcmVh;(31pD9F9L-pREpZ?MsKRGs*i1G6Pq}6Bq
z^d{qlLV9xi{8X0lGuyPvY{!UrIdZ~zh<_;xK@MUZx0v}NPd6r|;iIu}B?rudo^A|c
z-n@8GUIj*AFXs^2>`5OB^YsYI5FIOJsM?@2^T-m~7uKQz&tUmTv_Z^SD?J^?u=J>8
zrLVJ`W;<i|sE*klxxFc8d&F>YwmZ5?4lZZ4!Q}??NTv@L3=rw#4KJeq=AI*=8>p{3
z2<8LN<a6A<Alc03cdYBT;lrB>tS9A|?v#7*!9ITD?nQ?TwES4@S+2;TdHQgIYv7p?
z`|Ku-BUD9`ev=J(O+hkX9!k7@{tnK6?3R4MJWz5v{95#Sw&PU6Rjjim2b2zREbz!b
zvlXM8xGMRuFMY+X*8@B0YJew!oyS<k=KD@|0nUHHo~vWt=i8jMVZLBZ%}!z1vIjlP
z7b>s|3{}c2CS{eYWQ#)^K@4gaI+nuJObqtkWCc6Hd~3Fk6+~7&b|431m*;ISz^t^8
zNcR-`E0@|D0h(;S)nqvzMfJ7TX!+`PF2j1w`M$(qk2#I~2wLIEze8>?w}6zq=4mcd
zuE{sMOAb;#aliQ*b0=mvi}>p~1;+gzNKiOHL&|~qKgAp2pFamOMqqxI=ck-}E568X
zWgfC&)hkRTt!#igXb}s#iR^R8Vy=$D>p9o~MWRQw6LMvdR2NJhLDd&AUxZG#7*%8p
zYnd;(6w9yZg=clWC&m!8@Hxrt`QdY$W<u_sBgmM~b13l4)uETQ@${A=U(7!%d^rB$
z{P3&sx1bxGodCq}t7?X)II@zr)5i#E)z{DLXczi1m18ylCWA(>g^l3VuHT{l6`JQK
za3p$3RNMUU8-dwx;43c&Sa(GS{G6o^A2MGnIp;YvV?_b=VU#-crRWW2N6LFy$?=kd
zKM<YaAxwrJq1TIfn%S<Sc7_%ES~L?Mx)99dp!s6&;sR*CDC+`>;QXetFzCf@WS3mh
zVIJ{xr3x<hw98Ulxzrjv%(KMDTNOT()vnjgHv+pj@SZ$@AEd*XNxo<oJI+ca_Mqow
zXe;v%^047RdE)G7*(4wy>XI3~6obeL|E^bJnBsYt34KEKM64EI3u+uI6YBo;=2=fy
z9uyPQGtX;zXuztrsljUnTZ%PyT`Cg-NjZLrNMyl0Yi<!Op%irx!&jl_5a?j&0$qHq
zXPKNwBhw<g6Jo`Fsw$WVnWxb(4x3#@*KVJA3S(I%w3jjVR6A$gWEElk>^r|g!f5A?
z>1@6=!BX|P&y0+U(D39%Ru{K>ZZY~nX*W5LT!FUk4<C(Q<>=Wukv#e_G>O=4YzeoR
zJ=T2aA<j)6Vu!O#eujwR8}5l;$oUTS-Qk`i>4%_xne)7!&UB2k5?`hR-25rbN*3ok
zCnZ_>K1|m0SDBqwUtpEc2v0145<=-%nggDi=RnJIge6pIl@Ct$UVwAAjm%UvGel_e
zvD#bJj!vt+`4c_efkYu26%0OCnLp>O4!Qb))tb7{P7<dnk{3PfvCt-0V)vx^TGxAt
zw;v84;J^@=f53b(@#8?~6_{UM5bw=-Kk&r^q1VHw0#Ce%-YTC1L&Z;bzQT@X*WZI2
zFr#IuS)Swr)N=hoRP60cZ?XA%!M8a@ZV^VUHXu0PZcn;l9-gZBcB>B;&9zcC*Gf(u
z{pB3?z!|4n)Kv>jzk17h=OVU|Oj79RDaTTB0vQ4nV#cAmESVmd&V)Yl%#63zgkG<6
zqqRD>hN6HFAEFSC;4t=g9>!36F8rGL8fVJUari*)IY)h@#Y5J|t5_ee*!4<a=Si?a
zneO~HE|L%VPJRQBLM+hgTOmwioq_qCwrNaNHV&OugD=VqxSf<76bKs0D%lUn@l+bg
zdhEuhSIp6N#SDr<L&c;dWsd=MmJUs#HB3X(VG8VyFt~Y0Z<+iQ76i^|G-lXrPL}Ox
zI690aUe6Inh33m59ZmjD4Gj7eZ5TdF%9R{G4t2d(a;{|}x-aXYm_~(92WFoZOsvG*
zK`F=RP5PKtM4{(S53><;F@4j!iS}D2q9tmlXDgZ6+A0&wncfOyZrDCfLpVIn_NIq*
zy*r^IA7dHbLKef_f!W<?B#HCg(amhp5Bd@_i$`r9mGl-HZ8S=hqV&DVnZ<o4v+Px*
zp#(-lZxW4$_LA9XGd@pX?zz0}oUp(chR9WwcFpNyKgo1ELU#S;N9w;9SyDpRBFal?
zzab1bek%$#EDx07zzc1xIGGOEZ0A%p)Rs8wxx8(pZDq7mwk~qY6SGCk_wS`8>Fns}
zh0>C=>*e_M>0A3w_{H2($w&wX3{ogkm9uP0CJmw;aCgX6oBAo=?XWL_U}hp*xpGyO
z`k6aFsEi&=Vn!#o`e-<ak4{&>94BlDGcn=`HDH#gHmMd*_-J5WH>Yu!<y{qcVeYhE
z<i%xESb{#`M0P7kM#vgJPJ4nf&cv@U4|ctaBxjBa?D{9Xh|WI$M;t5CrO8pK$QX7~
zTYJMjfn7WB5QP%h$wjB+Y#-{noG$f>=~5A<;VJ*^*(XeD)IcTYz><$H(F+3X?5$CS
zU0?4g=P?nS{1Ioi7)Z<5X(d}Y_k;C1?Q4DOd~5r#-T17<V*hUc@Q%5|J$*{HPyXe2
z0A&JtEvzQX(2KLt!n%^Y+I&q+THEcZ2nN^Pi;6Esi@uBF0#<|)Z*g2W1gl8+w0Syu
zz2^|evyuZsO)u#TzZ!UCBuO5|tDLIb$f1F&LZC696BVJVVE)BvR?0huGT`ub^3Neu
z4itrq=wmV|aL!J0DgB_Pt)|$TnY4vmY%hXj6f4=qb8wKlyqL<82{s`x<o6u58q%^%
z*Fsx}AFmdOb~z$FLR@FFiI9-i@1Q*Bs{0Y=8=^h<;fe|o!J;=ZJ$Y8wyQtJRVoo1;
zW`#es*@J3lwF9NnpgmlOufj}U9_lqa;-}IVh#rZWchwrs<@=Pk(&0JZyeK)`QcF;#
zm!bDkiV3Ff;jZYFC5OZqU2-@KJ(|S!arOarFfffr`@90<`L0*uoAzP(>n{;)S(8sD
zafvY$G54f@#TgD4q;xf+FqaZxw~0>l<d@M-%28Q12<LFk;RU4u(<yp1q>(uUfic6u
z($0;vhOWd^{<5qyO>l{z$;UZ9XBjM++60h)gbVWM{UG}-iSxbjiy^vrVQLFCFiVR_
zujW`VHo3)zFRN^!voL0Bm~+nok{D|@T~%_LT53<qU&>)ZeQHz8N-#>pUgs;}h#VhH
zsalgtDkh#+G0%V~a`o6b^E24_2G(0R830qCaK7QA9+0t8n+M#s9h$ZmgpZkBf!T+5
zy&St9lLh1&-2x0Xp7~&4DPFhjAoy+$V&j3(%czZCZnxC+Ird77YEn7#ua&1TSixSL
z*k0HhTaH32Io7gR=*@xI=V4(Cp9#!9gTlRrg?IsLJFHnpDG`o1A|;HQXrcL`muGA*
z?1!6v>KFQ3%EwldY-{!^IkiBg_VJ^wD^X8M4z%2*rfC!dL@@gpv}?(s5SXWv6$unI
zk;TV=!x-8~PJvNge<b^!vpr#kw;hVTU7&uf_b5@S%G_Ujgna-@Ml3~Pb{x%BtSvrs
zW^sCWIl2fe8lIMQq624>?BsV-!lzpvOnQqw9i9VNO70FH+_oA#1YWqEV=n3%Pg5y5
zSRR{=`IDte<l8Kv+l3_tk1?r{i*%yQW2N&@0A4|_$2`0JM`^FP?=p`eDJ&cuv$&|R
zYo>XM2<f-L5JI2&nbF65$u;OHV7lmI-wHgFC(J!_yvfgD$ehEOw7+Eqt87nTcF%+r
zg)K{y@gmW1!{<#r>j3{(nXl!o@aMr-K^YY-vyWAG1EIF?nb=7FUfz~C=uu^0k5Bf6
z#kl<K!@oVA(2Rsh{Z4*Gn`^oT`b1c);z2lPU?|1<<8Z7$8YiQOrzNXYF8EGJF7YN;
zVpcn9b7QKR$8wp+%tOY@yM3vd`RoRk38Q`bDl7~qeWt${6R>dCrXZI!E4`_iV+6`l
z>9S#VBYP+PoN++vC5L8P^N=H)htTz9;fJUYu?N_wH<|^-saazZJy!%CO(T1WvzNR8
z&s(@;oJt%Hh|fd&D>2^NO%xLW3^XbK2s}jV70Rd2Zf$aW>KG=}bA0lO>bbAOW1QRp
zqO7CBpeIdfMV^;Q%sDswfn{GtSK|lwa%ms=F*_5`WQ-WI3We9V(oU3p2n<=OAz3^y
zU9lRE3-Td!Q&qkKRs4t&&0U_Ku)Wd^1$Ei2Z=P<M3>O8xW9<%~gVPXu2HM6QHZyw(
zI4i%UVof5`ehM)M<(%eH4kNC4D`qNIn)kAI{c%@1wbFx99FK?Q*}z;(U%3!i%+khm
z=Qys5%%2B#F$HuMP`!Q^*tv=oml`JM3lnBw?g4bteo?Hf5?0Zo-4t%Vnq>g1k$a}&
zEa4mN1}O{>#W??sUQ0!ypoMpb-5-%2ToK^k;g8*b4y7pNzf_n}5aAb=&PtkDE#n5B
zaajw@j<;9)91C9N`}jH_>R%8I-y8vQ`RSP=Yfzq%N_VV;`APYwF{`P9X<X<>zKSZP
z<(LWJE#Y$Vd-kbVElfgYyS<Y;=8pDof-(!1cg*tRqtTKBycm@pjpYeW{PVDS>N#yH
z8^!^zL77=)oOL{cFN1COzbyHHH{8)8x|S02fN@~=m|5nbG&&8eKy^glE$IfYffrWf
zFS9?;o{z<~r8p}NQ^8?Sh{U3lsQmcJUH@S(!K}M){hbIOp1$>0tjK54e={}LN>NMC
zz5eCRI0#&je311NW;e43U47t@06gJ10qEwe0EUy~Fu9(9Njs_~yz35`r@5K{?>d_3
zq7%4?fMp*@mU=S0#^_xEe<>IcRHX`<-6#JAZ)4CwadVvts|UVR6+Hc@eZzio7iJnT
zrWRrrT2PGUb&{X%G|!;s_-4>~$G_>mlAhF*@1WBTzX}@MljqxXZ_4{u%&k>vd}!9J
z92rXiJd;x1M^pY6P=$Q$Zw~{WngGKq40Q)}x8xia0%)9%H_0jWMvV0*p8;7Ik1*82
z_w0V~QIPWP2zQf{jd+;yK8q!d@bOJ6Qr>@)ELclkqIE#a6y<>-8QPlVfOa0;RLZ*t
zj3doZZ~A)HZF3BpRj2n0q;c}kM52Dw-=oNFQG({>l=nL+{~oZ!Br%<6e}~zCw0-nR
zJ7XRb34uxxoF&gALwLbFlJe_<S&9Z*SSeA>(?FU~P|R#Y1kAZl=6txtQm6OJWJh)6
zELnH$>Zd+i>+A4OyWLt}4~c@$_^0LZGmZXY4wtu!)%B}4-{4$b&zqI#8TKPoL^>_*
zpwoGIAn`i@_^H|AwjG+-0b$ww6$sWFyE;=NXtDL#ia3^^tOfW2;Q2V`PI<qO^8YKS
zvid*+P`+#EnH6r4=V%GAV`aqk?oaxQQ~oa`SD;J$0&7&NKndBdRrbrUad=`}L$XIr
z$krxotNfm0SQ_$i+pG6GWJSqb$lD=w)t<3FS;UG7G25OgqhKV#5-eut7bH5pT_<6(
znB8t3Dmmck##C)yd#d0u__Tc(*vV>U;>)0cokFujcZUWdWWZ`^_Gn&i;lkL+M4J~L
zZvT~D!+GqF=#`9aT7E+{ybVhqljtQmJ=}#k)=0F<f)w~*kG(>eC}#L?ftdWLwT0%X
z*kR%F2F^h%{Vg;GUYMt_Msu*_Z2Q?^8Q(W>s(ZdsF8$QE?FBn}yHS^-8?pRDt7Wfe
z^JvRzndtDQZ%Q1=+d+S&+oMZSd6)^z^)fSU+AiTpaT`~xXxmMBQ%nwZ0^NyUbBgQq
zzQBlFC8Wv+qk>Z($>|^Wfbx$czrsI`{Lb5PPUPlu5Twu@=qRUhaA&_cpt_(u=Fkq9
zRc0fH-<+d%^&?*>L;rXD=l+|>gZ&$n!#@6XBNGR_XdX@vJM_c+elqmG#MzHx<IThH
zue%b3LjUFb-YKQ1Vxk<-hozQ$1Wo^V`}tv6P0Orbeb;}j4tz-db$Z9)L&uTnHiTPW
zxP8;A)Rf1Bd3+(;efwL(+D{BCX;+3o356=l0e`BN2PlJMP>EsgZ~rL%AA(+bB-?q(
zdE_gzw1b+dwHK#-Jcn=2O&CTjce_t<YQQx!X*I@LBA#Goa)8|rmOf^zKoJRlJ9b9V
zPh$pK(hi|xAS+mQ9~=(+%T_Lx>m_1*&QH7)Ojh~Qi-GUw#Bl^H#^@1g7UXV#lJ59$
zyzEck$o?$l|1Na!6_~Dm0fLcq)r8f2Ur~e&p&;ddI&sd|GRu6^{AuEsu)%#L@%D)I
zfyTD=f#x<b;ZM!{exfr!^x>ZO0}s#rem8!--%oV-!tcj_J7bOTyg|D7F7t<`_dD~#
zr{g^wMz}1f`NRzen}w#Y(@TS>=Ii2U;hMZ%{S$=cr#GS;uYV63m<8MZ<YK&remB$s
z`&rV#(ZXteq;<ImU=TB6*NW-cF7nK7iUZ{`G$7mSTa4F>i|Aesm;cx;B^~00N0N&%
z3)szJ9I}9`Q(?-#1CDk0ZT~fkV<o3M1^R49493!_JYSDM^P#UmA4fWe<jA0?uflq+
zxzl-F?sVp;&e`mAg-2aZc`wf2aaQ#34PuGSF<6Drs_f4Gk2+k5_SeTAr|Ul#K>vYi
zAhexLm(h?SwimEEU@F|l<xb15)t;6A5<5$*&*JSC(u1!ZTbb~;<J69xL8B~ZluSd0
z!HEr7C>Ym^=F8@{3XPXz^3qC|Zt=fBXV)tzOl#XtYPA>rgIL?nORn~r-7t&8FAZG=
z)a^pql&7cs$yCA9p%267G><g6<IX>pn)&5a!B_0Iov+%q<$=bY8}*M>J2QP;Wm{{}
zLlk;oa_=*-E)aA5d^y)w(+K8E)HWqQ;eWQm@;|$reUUHu8R36+0R-Qb7Dhi9WEW9M
zdw){}bYiGQDeqU<9-!hRuL`w^9(qR62>3){0(T((0lH)wXX9@}JMuw&JJfz|7#~Or
z;sM1B>#holAIxXm`Xifww2qE|S0X&phGWf{K50Ev?Svk=fwO*THcVb_zQJ8us6#)n
zdg^2FTtgd$&u_bT2Bw7Z0**AO7x~c;``lDfY02+PehSwc(QD_gT!mhBCCUMFUS*OB
zLb*rfNv}5#K}?7c>OQo^P4mOZ8+?s0AL2B<1gjdHgu<Zq7gRfozJscOP9xKMqlD3A
zNaq@=MT>;R0glk`gB#(M9TWY`cN4!CbF!${d@X$^eEMGN+pF6>x^uwn+rJ~%;rEdO
zIM@4kt6!sMwYTKOJl12;)gL#G?;e3E^yQu2zh)UZTpFz^q>4^Jt^Az*J?!HsF6Gl?
zl}8sF+}ZHC=twlwTX5b?`WBo4&N9J$9&B39S+Obt;hb^<XU@XcD}7zpyNMGIqlqpp
z>8iZXKzZ2~04z^2V?f0?^%o)o-HvLf@$0s?6`_(_bNoPpTWHbx;g)qgapL>}c*jVy
z#6dLO1UHDX&0GLeuf1v<K8uP~9GHI=(~_6-;F8rl>;;kSIj887^)hV9PqgE$Kt-2y
z$NCB7%Q~{uOKswEER*i1gGpg0ELp-y3??e`So&_5vI->w&{&pu!reP~9#}bAHR1z_
zCrAjDNs7-@D~#wPTHp4>hGU$CyBD^~0mlPP2+tuVsQSBvvIU9Z?eX~c!tf!w34D+M
zLnkLD;}tdJ2Mv;SHaZHw#k6Rr{U)Cj!zgPu+iQ4aOHj!^zNxdEtom~Ajt-GkkS>(V
z^M*&9o)M@xhv|<c=W@#VxF~lMdn&_SW>++59`dx8oHgG^O+c4j2`6K{-KN*?dYP5J
zDz!>XnAuKAYy@VasB&Iu{q{ba@+(!$e4k5nRv!z$N-SwvzEQ48kPn%L6`<3*TU0RH
z>6dp}{c^U4#V{(;KjZ@V`C@!J(DmMg74RN<3GYDhL0uDZbO1(YB}~ZBy)goc3CKm*
z8FpCoZAPYV>nVA4(}j4E#=AwViHo2yq*}b@89vE_0}|dvZ=|L^?0jrrZDtK~ulOW(
z075PFNPA3ryl{d5vafRKea6yNTI&ih-{$a6FZFu(KxC%cs;G13A9++R0T~g%J#0Eh
z7_QLj`A>PD(?&gN$bvq2cBhy#J+V)%ugg}+!N4QJy=8lWSZh)Zeh<q54IZ8-y&iLB
zF+~S`xreS>)R%A0Oqe$Is~t<<Ep$Pc??P7-W@w5H)^(2Ou(0`+DG!@aRK9Ym{YtPD
zI6}_+_V3R%8H=u#k(XN%ks(+sG3aSFWy_rlBX<8DT{+WV;kPUbfyC2b6QWF<8x|dF
z8yw(0F<lrQH9JEf!G@=#srs3WrNl2RCFUVC1Q>8$rHV5RLdDfPJ>*~0aYC=lVUU{5
z*Ek4%EkE(1FZ?F-8>}#l2~js@Ful*s51)g6vjXN&?)lAWX<=M{^8SSWVq(6Ux&s@%
z#Msy3`w^{2LLaU`w}*$`q=!z1sRxC(SPv|+;2(<pH7Gc0#If5x(i%ph6MB8@M0+pv
zdO<2Pa$7mEesh+evhu}?=r1Nlu9==#k@Ud|z~E<|O;1ctOV0PQBMNuNvESNzA3n#v
za^-y<dj$_Rcv#s}l^$~y?EikVU`OZN9YR}i48t}{Ir%{a68>Ai0xFik#GW?{!%_!t
zH@i5pS?;`+)7BBx;F-lG=(hdgv(a%$EQb1T5ehk(Tn5{zYHUF)=i+UC1qkhO=PT$d
z=lLM>Bn+=byA!?aH+?O$(Y>8byafY!GVu<z=>tNWPEFaL=*X9|-#tQ~epKkwkK$mr
za69T7W`XEP{Kc`+z%mOG<>AhFPu^m`?qW+_+AD?;%u}pk#5qq<0#fp^9I6~E>0+iX
z_lmp{`!sgBVD_5&yeIrxVBR^awut(YpIY@%I2QiMd^LUw?K`s}oM|ZfeeH=pEKZC4
zNif}86Pb$BDADjS47~6@;40zm(4DZGV+yB3aNLJ4)nqP2hw$Mkj<D7+1b3k|e(Y1)
z^))1iM}b|mv70|Pe!kmx@;zKadtf>2IR8#>@72-yDeqKFq-}RNVWsESZDFNvzZC#R
z`hz5ZGQtD~SBBklbSBPwsC&dONnhRREq)#iihf$Ri$2sE?-eeXRnF2feQ?Qn<2fi1
zzxTD20l<<{@b$#6S@!Ls>`|WVUmj!s@>o90`^ETg(X)nMG+&HeDC&gif22Izf&NAL
z=LB|+0UMYkc{!)%(9>^^le0X8f1A~XD`#EIXe|G&y&#II^{(E)PT{OJ5A(_1_$9!O
z-)kNKgJ!$YzWbt-_mOlRMGYa4(r{FJT*}FYf78`Cvj9y1TDSjM=Q0)sUamw_%Q;7?
zms<ULx&XcqBtMV3dYaQkubH3Zy44=;=0MTdwOWp2TK=5&IL?nm^}YZOgP0&4mG0HA
zio9`x1ig;RH5$E|CDB;~Q*_Iz)9xD%SX0JLoHD)vuc%)?jJ6FuOsM+jqF1L1ZYw!}
zIcomWRqVW$In@00TC;msFH(!GO2NntEsfOj;LriV72@6xDW(e42o5p@+N#WW2+DKT
z-Ovj}L&tdIYUr+^T?kB*k8}Pg{i`w)p{)LAcVzs}#_RrPdFa2<T@T#@Ehj&!exo=X
z{%7353IDT7YUSsh{%4}n3IDS^v^mrfa5PjGw4D45+W+h`sIc%qTc+lntkuf@Omc`7
zE($E=eGDAZ1<f|Qz;r&K3z{fL^+SIDNcJyh{lIwX@K01*uTUA4HYJ)q_PlHoiwZNT
zGR&0vH@gEW;B3K`MT(PdhXP(AGzD%dyC{8wr6S;X1N6335|-J{Z^1Ozn(6TAHOEMm
zBGU`x9&a#T<`hI&0DVbJ9@H}9d*MUU5zacTVkhkq;X{E(z6h9_@)sENQw3k<kksBY
z460PPXIq4p7_Jm5uQ)OF6F((A<*|7vRoa0a-f<I!cO2e#JIGDNY+2;SN+H~{{f90e
zIj$;ZbCdHH^S$&NsxA=rslQ79g^G^Ns?S_Z3#c!7xA2U+An~HN>pe?v^jUt?SbBwh
zPWa2Mfte9bO&OoLyZidgjYDe`i^+wlg1<zz(O>!19(wdusLr|k=FIm+_k<U8_imkk
zXa6nMAHyAior^IWpxF)^ilo1s<GhZO6FFNzChz3BBxVZ>?DfgOV_fLAre(182ycOl
zQZv7VrYMIau{}!g1?D?PP@pIO13&0a;7oUs<w<uF>M<55GrkE}gh9t`nI!NY>Nxsh
zp~0Tqi<hw_46_xe6(vU&&aYgC=mJ`mR@n=h!SuG&BV!Ds?N<J5+KP%rPi-n9wiUfz
zsWFa4U;0xC?|*A00juE3)WDp`BM&T=3T(Xx>|sC!8--cNQ0J(Tvp$LbP}oM4yiC+b
zwF6>=vS-n#i7tG8#=Zg#m23L2(v36!4}0GNUqyB8J?ET&2Mi>{s6kK<G1f#8@_s1R
z@JIkfhyo&34IvK*1`?AK9*PJCgkwylt!?eCZL!y0ZELTzTE%KDs0Dmf@lmVQDzvnf
z!fmNiM6vSy|9jRxv(GR|4uSalzWcF%Ia#x3uf6_jt^J%mGkZSq;Z+DF1Vd#7Dh>ul
zdlt>dJ3_l>VW^xQ4A10s3}!g?P<e@(KSyLHp+`ztTZ!HlK_|gGFXm|J$D6;LK?E^_
z(1YbR*JZ<D_C}xA<X%ATC6=rYnhWrFUhLAsPmkmQy~FUF=kst+2y>Powg<yoUtD+I
z6kVIa?Ev<u@)|YYHr&YBFdo4hw-w_~)=RieS@H?q@WmvyHPddF!FfJRM=qb|yBu;W
zqHp)|o*|xdxG}i9h>v<EjeC<1v_;+vpG^-ZKGu=?7*-jgcM-5=BO7U;lCowYFLu62
zcx=nKJJn?vCZ?k!FW5JhTa&D}*PMnmYiip%VD~^CM$V+_Tt0&Ih+fpgLv1P;{)lb=
zoS$OB_my3EsbX0|QrXKuM$d^pD!Js9q_#gJch>VsD+i$U^YUn*YC!7x!nq&AHwN)?
z>+&6Z=?&AhPcB3&Lm!%mNn7Hn(QCOGGh(jg27(_AI2Cm#dF6BV#T-Txoasp2zz&bA
z>1a*OU&PWUmUA(yzqRd8&aA#;)Km7oQ4SEC+8g&r_qP7Mgg0n0A2jCo&&d5z-p1|g
zgMw+TS+X{L&I7*IB+ibp+O>x7T_)qsH2U_@!N}#D@*swDaBITtcI%G2eq;R%lknIj
zMAYw*czn;Re#iL$-(lq`?<b=hiySnT7w|x*$K!(?3AySm<|k0PC{Vslgk~5-p{KST
z=)dTUEhufv+A>;Io-Lz;j9D8a&#dv~Y}}n2Ifw^=Urs{VBzBmaM_tCnNp2fef~&Fj
zBBQxmUSecsLgY2nsnO_UlFGKKcb1?bdr|x8E96n@<lIIenF9;jXL2dpR^%Y-Ld<)U
zMaC;9sM*Gg#`MSG&p$YQZanFn@9EoFx_g?=>m-z5ZF>Qq$%co9;;YTcK`iwTY6&;i
zBXTm=@Of?4fu^evBb#9ncFTx)Zz%e?)1j^XII)V|lZ5*90Kef_;>))hO5bN`YX=zL
ztS$yvT7OtR7?!uz;o$TJ3;#37j|PQ)Q@wPG@4*g6<q%(N!JZQwxz(tTVnu2u9<YwC
z>Lj-(v8#xj+V*jJcpMHhvOWk;!AubE;`k$j?7AU$=ZBk5*VncWV3AxnDWf=PRR&fX
zbd%)wkNH)IM6|ELs6#_{5B4~Pgv3|=(J^HpUY%@~rwZg$5>MsYMY)v?;%Zo#Nh?8z
z3st*);sX7-$X2|zmYK7EcP)0KIM6?7^>&-F+YGztXy_Si+sek2ib`)h1;JOrafjBA
zluT4RzH86hJ;NXH!Gl@MmNafJyrZ_B#EmDMNrrp*xOSReF~jZTFJ2I8Y~3>MiwWUS
zBZ};c!BBJ60v;sJsogy8iv#&6c_yc><1(@-lqJ*#y{yL{z`uZcW&|R!6^x#b*na7K
zwHGu}?GQczNVON%Hn)JD*n*D%Lhqy=>aCQAVMhOH*LQP%aI^EB_Lw@~;I8x7W<p*Q
z({&zQp8Yf|I$pcpt6h$bdLO+wYd-@;niv__b}&7Bsr}%6)&aZ+CN<w@*L>L>GZ|$t
zT<<Z-9VVmQ2`Ya%D!+5B=26$pQ>UvI!T(P64@K41r&SXujGk6CJI-cMFU?>N+#FB4
z*>wPns_Hq-0Km!7i+AOl9yA3A2_A#yKruaN61{1{5jTx^Z2+HLeUGSpB%+v&F@b~9
zna;p)ypd!aK2{uWBx<<(f4h;O-_qf*_M+!c?y-b3N4AwZG?LT1Xe9Q6u^L5iRV{-^
z5W~!HXDg4lu!{X*QZm;n`nKZ+_Q19S>EY=Z$ulsJ%yJDRL%7a}LFB`vL3(bc@+P|m
zlM67I*gS86&poH&;|_y?V9cp_>P&Tt|AVi*AHjkJX2TQI%<2p^;>ISJ^Q)J+A#LaL
ztB;NORTUn8Jk;I%%E+*5CrXDmv|Ky4z+fyI;yPt1W>yDeZpDQVXKsbN{+wF{?THcR
zR%$aa$clX(?uh4CT+R0yOmO`lJHP6EwU1~JiC1rr`Bep{xzXzhqdiPO6UbzH$U=Ll
zLF9b4hkSD5p*CY?#o4a?_N&aQf@Xsl<ur&tU>k9~;EUNX8U*Ld(H4>KZV{OCN{bkU
z*MV`tpfp#RxxN*hUQI|^^+mJ@o97SUGh0L^6yq&_wus^ORfaw_Or7HYWV8rWB{l(R
z6Y_SXE6KA}6w@2<3cu?^T1pzxmAn{N9j;c<ZH72nMX_oXrSKqI#VB>fQ34yJRp822
zUoLQ4Jx&?fDx9sc;%gPfwwO{1J|?Z=n5f--tLTB=x>d07>|l%+UAGTjZ?k=<Ymf75
zj<*oGE{~2I-B$SHEhIYJ{lC*f*gkr&9(H^^4&6oUdYpP{u;(js<7Gwe3VS-)hfg9M
zUzEd`b$n6om@mrd!4cFLACJNMoO&um+CX%PL*|l+dM+7Vnf6?vo2*u$cwsd|w}b<J
ze7YDj!sza8#~102e7%}0Q^yzS)Ve!e;dO23UVD$$;GVXZ_}1%=HyZdi<_6F4MZ5ns
zi*|>NFFjnZGa5;cSM09B(f|jR>ca<?<BN7Nw?vOG+I7D?frTx-Iuq}*%Hhis=KQPc
z^@(oQ@1%Vk<q95K2v_jjE#&wjUgt~O$K+bS+eZg_uo%|$iu^HAyZcts1HEHfi7|e3
z-9EZqzdPPSuw-$35s&)-;l6{aWd93Vh|xam=S|J$YswPk*)7~%NW)We13K{9`l^jf
zPQ>v*+y@$P{zq@(qaM$<ebVoi9NemV$(QuY{cZcV*YAG?Pb99`{7<}+w(0NuGDgCM
zEBV^0)%LDcj?eAB5&7g6e2zmsc<9_vi##3K(h<%Wko5sREt%AI2dDK*x!ZvH_~an_
zEo$ufuQtIb-aReyMs(j*KqTYCt*TV`fFz&1iEP26jcwRpHHSj+cqsFQ&)}U9T)<s%
zB_CQ(i|+7;3;}>)x9sRGrL@+QBU|M*lD+Aq{mg}VU3c7nc1!r@(fcnu_WmQ^wzP|a
zi+HGUsU6cYGFKg1G6=^fqxPkqpR@6!cLyIpId99t6MZM$!VmQ&U>k<#P!E6C_Q9D+
zzkIIkpJ%o`7s8u+WzYYj6csA#`TFNsIXCS}yzr41aKegwGUTooaK@tewzsU&C7XCd
zE$Pm)@Nn%ayqtu3dS&#cZ{+D+*ss)nlJr2*eS1%de7tE_|BF8Mf89df=4;VM25}qG
zn&+Qu?L2W>^tGL27{N_?@#r5mxWq%-%5AKrxU2T~p+B8CZ8UE@@(IhNhxl4UFtY8V
z9oXD4nDh`HSM|M;wR!N%^Q^hnj(_zrgl?+e$TL}+f6?~tkg<`yAN?`uv6Yw7EZpr&
zsEeGi>2E1GGnHrRBIEt_PnV8Kva&Wm{&)vIUA*_B9Y$h8{nN?kz(bqsH{XN@HaES0
zQqp60jJ0!4>3jXgnyk%9kKu2noWpnIw)BsDf=3-v`R!dii`jAu_jJI<%=X58C*T7F
zyYuicK=k9aa6oFb#lcqfl~_FajI9&ZcWjH1ADg~XB)+YPeHRn>9Z3|u_7=ahh>tEu
zn`mb1py+$pXrhWu{iE6phqX_A{TS1?p-|9Aoa{X7%6A!6C&U+ESsFA9U%)*HFUoU|
zKbnRIT7#`c+&{)J@C}6?`2cnFbe68$xETq|rcA?^aM=SHrUgyY(z-M4|2O+$`v<&E
zZuSq@{{Z`z^SPTL^3ipAf77lr*jTrzhWd)xQ0GVk#rKkpGC)_7nn5v>GKN&3*wdVL
zA8n?Q10U_McQt(oH`INfBt4Xv;d=$UD4^45+tfdjn1QB>c8lsA+?@o4PLJRrn{gQ@
zv8783j&AvptecqKT$6Njeq5UKjtI0)so!L`+FwYkjW%*N>7#1F?Rdw9s^Ntse$IIr
zUc_KEmyIm(RSvXYXO!jc=E>2ATVXJtNy2;IXutR{mfFc2o6zFbFo-PKsy?`d4;r!8
zi&pYc8RiJf=BwXe_H4dp`;9Gsv;AgbUXr<L<Kn((#Ha5*5&zG?_;9*CJ3%|{cS|0g
z9^&2APG%_P?BwH;H}H;o@-3=o*8BBf?*mRvPS5(Mz3W?2+dxz-yqnebF<+WaT{HyS
z_4Mx;lTh+mcm{UR`Dfe5!Impf|DI(3u@u;tL9r*4EkKjnUPFR@rwtVZa|*kYgG_#|
z=Vf2y0ysF0AGb&LlFwRy7}>OYnJNIh)r0*x)^_BlwrxH=x-*CU4kq5EA2;;$x};gy
zo3IMM1(SvjL+m-k@N3?lhJQQK_?G?M_&4cpwTs8^Tep^=koc<EP+Ls&f6`NZBffHO
zne$oehxY3xM(2B4bh86pdX631Ak|Gp{~7)9@$&rNT%NA}S+&qt(Lynp?{>}LwqfFb
zK+WLLloD>KM<q{Gvp6)`Aokz-<*PAsx&0n<IdryaR)66=&$Fsw7iCD2c^x8<!xPcj
zU1HLm=WurSYU@z+_DI5RgsO{T^;Lb^t`j(LyzDh}%%mvq;bR;cI%aSp(|O)4vc;a_
zJ;A9V=6T6U554)(4&U!Nw@dWB!l43##`8+BJ;##~LhIA{JnwUu<DuhAWuK<IzCg6=
zTQpd`mgl!SzNxy?dyGYZiz%bSW0@wky@Uka>6tIl#CCd#cBdCam-7>JdP|h37r0qU
zwA)M78xFC*8<lGIccak7dG&W2*xzlydv8JPPqek<HFT@klqMKHE!x-dpzHn)`*Jwf
zgQ~*lT4P@s#>_Xn=-)UM;Bev$FOGNnu;SrsxExwy{X2#Jos2<6{A&&<@Na6Ye=(@o
z%Eb&QskU#^;M<?Vw>QJLY0Mkr-P5&q*RECmjTuiybuyl~{ENvwY=D!~!fA$wd*okb
z2dWN2eB;M)|9X$toz&lW{EPnlX5)Gs8}(xmB|7JJHcpLf-j&K4j5+rKY%68Xxo7B3
zGy33$+AERWC1#A~ydBNs30@QPiuO;Bv(rp^=p}rd`yuqyKD?!xj2=CqZFB#uErWl*
zJCQ9(Pq5Kp2K6L63KN}VW0a_i^p{EY7JHJ7>AX3~-eOO(4;WX{nAq1vMjI3D(fU$(
zOZ^ttr7{Piy2vH!a(PSAWBAjT%VUBV15b*4n00W)L2ewJ)W(Gbw)2B*=iC@n^`jq!
zXW)hEmMhWDe+9!a1}0#yq?ZCKKEul6#qc`%(cdEhJN|Rk0-J59FKI{L!h*!;_a4C<
zxjKQ)D)~rFAa7RUu%VCYNk^r&Z8-^>RvUrsJ^v)LKg~bYyFXpe{&amZce(yR^`}4q
z_F?_$2@!mp4fDs3Jm!yQnEfe>PIsrS1K26SX#e(lrCiTPSBki~XCj%o5+gL3l#ebW
z37eJmkNS%5+wrxCz9_atd)G+3Yf+Z?Vbawb@gzB}+xX_Swfn57had%;ok5VZXN?k~
zuK2m_D!<~C+%d+77nJQM+|?85{8l?(lIJHgWQzuDJb+7<q>{Z0TOv>IK2Z=lQVYju
ztxkfd#NC6U*gW740FgKFrvK_@R0q5ae+Ir6!W9V^0<HS(HalDJbFu*rycoJUAsPFI
zfNj?m$eHvgmLa$ifi@jm14Oo9$4h=Cd7d>R#=_m)vY>UK+T{w_Fo)~6oBNWgMXk*V
z_<j$Lc@?NW+XV>NY&oy}rnUBWjhb|-9eTYyr38nG7mu*~$`ZRSK73(kVHm|HU(;B-
z_IUZNc!vAU9<%m%y!@U`{(RbB%zQOke%L)Fao#M|FZ03(uk4^>O&g3N1|7;5`;%sD
zOd3>LieEN<A^eij{I`@=u!Y;b?ojl)r^fWU+*6}32Bx9*Uh-zIiyo^(z0S^ShTX%Z
z;R@*(RmgAr**%ne>j!$VV@r#ChMtL=(XbB=sSonmeQ>tjh|$Rp$K{#shs7rL!as~`
zDcQT|eh<NvWb|xlu{~SnVLe;-{h8aJ$sDM}pNVn$lcQLyKkZQr-MsD3r~?yrpBLl6
z82`D)F#3<1G1y~Rxr|}D4}|+NyxsRB<-P}^?sMcG@xXB0e=#F(kNnr&{wlJ6NH#XU
z$JExm>*ln2R7%!GYrjAGf}d(HUJqlZVILc3t)rd$SSChJ;Wi=XLjTmPkFgj1bbR?4
z+l2IYW(Ao^t43jFuV2%{L<Jw4=e-uzK)#Qcz>N>jh&?}4pC63ABk`5LcT6_71(8$c
z3wml>kSp0`(HeGHLPMm{r$*E8CATVj^Msq?Vcx~9H=wI*3BrAFj4eU<-A`;^$}K_C
zF!2k)3)~U}T@wnITdrVBkOTW+sV`iq3@TN9((Wsdg~XdoiOq-LN3=`zNz~}|(3XTE
zd$*Ay*=?jq?>17Tb{i>DyN%#^c|M>PQc8Kh4eNg5xpOo==~E<|gcQjpAw{xDNRiqk
zqz7=SMzS28VDukHR=@dpPY-JN`BK9#vTJxB>{WQYk{_?+sO-H{$#wnyRCU|3nHaZL
zZVj$DcrotnFFJq4!6e+qPg=bmt)lH<b<*meVV$AvV85i*r(tHk{F&@EXQ*Aica27L
z#lb_{|J5gH^)4{m>mgW}R_h@v4&L&OyCLSMT+Mk?JzwzAAMrSWJVNk{y-xDxM}J(t
zDSOR8taHp@E3Au@`{X%-XX>AE7DvY0iIW3-j^LT3$MCmO&XxDsZ~{_y{S2eQ<1<fv
z?3IY9Fkr>O@7?Bu3U}EmFiqe#{cS*3C_WFAz=l3VnM9Pxg@2i@Q3k^W&;7@RNvm(P
zQJ6+U2iHHX9<6xh7q8q@9R#;+D1DP8H)I_jz?vzxh2=iO6@jjl?Bk*22^;!R$@`%S
ze6;C(fBi<=hl8%)TC?KdUr}O7t80;(kiDjF)(f$I^ld=0wQC-dwStabeWR|0?+g|3
zNQips!?Uy!JXGwvfy*kpaMceKJF9`>(i$soy5#*HvJy6M!;D=U@UMQ8cw621hPMr&
z=K7qc&$%|ItDjz*^E61U%ekswa6^CK?=FOlN*tgH_f`9$@6MouH{!II&^OlI{taAz
z^KFja!F~o&EUl=3H^J*Iz7EcRt?GY+94k`C^EHa2#yY#sI(t%`bwOxBBe&7w7FyUn
z%R0NIKh8C_az`-k1~#YGvd*T0_%ZN!5`H?)b2Oy}zxPoUSUBs@fcWsha<pYS*n0jy
zF3ir(&dJWr&dbivF32v-F3K*>F3HKx$;rvh$;-*lDaa|zDat9%Dap;w&B@Kp&CAWt
zEyyj*Ey^v<Ey>Hy%gM{l%gf8pE66L%E6OX*E6LB!&&kit&&$uxFUT*<FUl{@FDb|_
z$SKGz$ScS%C@3f_C@Lr}C@IV?%qh$*%qz?<EGR52EGjH6EGfz^$|=e%$}7q*Dkv%}
zDk>^2Dk;t`&MD3<&MVF@E+{T6E-EfAE-8VEC4eu1=n`Zr!719S1MOy@?F_V^fj(fM
z9~kHh2IUVP&?gM=i=udFi|ftS`wJ(WN}BwG*Hu@$u6c4A+h*yF$sb+~x_t9}%Q^_M
zsqur`&H}yt+Qntn0I9kE;YYU*fPhHCSzB(mMlYyoZmh2fW#(iT6u_g!!$Y&HT54-T
zjSE7}`Nc&rye2DD-GJf^Nx_G5ibiCQ$PH!A4TqarE*Lqo%9b%=PGjSohT4|K*5>Nk
z5!H?JM}`|48>;74)h`&?(6Dg+`AyA@^J=TZp_-Dq;*z@jnjCmJucjb7C%3ksI-9Pm
z%bT5-U0Yq7SCgApn44u;YLXA_eK%fV`IZKKLlP4b*1(EPoKsU}(DP~L=z+mi{xJjk
zOuVhn>V&pHU|;~8qZ9j}Ga&B-{1`5vo87#bz9?@7lEY*~;N3tsuYVI*ahfvkVLHOi
z{O6MCzdkBb@ops#!ngR(&AZy+4Iz0Sc@W0(pNn@PSc#oxSC?+((VlU_s}?O>^8Cwe
zd+5ss;TwtLDDL>SKn++Z=MG6<W2TG0{WsZisM{mLryj>};RV(^z9#Q>;Z-)fc>RBb
zOuGnGStqKBZ&@Qu{CN)Ua7kZkrfdDkC$ebERl+;L<Sn}mHRr}CBlTM@d|9L}{Q~{{
zQC`Y?P<WS^GBtjKqvz|wce0nv{f>WB{bt=pP&<EVe3VHo#8E%>oiI>-t@JSc`Z==5
zJ4s}X_2L~F%ez>3mwWNfi{-sfc+veIrh|WK)J3WtY!lu&UcA#|c|R52r@eT8?C{d}
znF(aFtQ+`G`$_wr6&R=Kg9_nm^WwX~kr_hzQsFK2;B5hG2F|Y&o)sQE{;-3)Rrvnx
z#kbqRrH=cA_jWJehaKOCz#Fnh2kTl>F6!~>fPWg%DQ}$coa`kp;K(Cylkoo9l&Agp
zaIBv92yd+yudCd*3a{G#++9BGJEUzY`-RuDzgiN@8{z~FfghJStlaN#cv)7Hgm;3;
z>uU2Mq=kj=B9l*i&;*gx@owSaozBB>f9>Fs_gUdpZy303zblq^ukgO$RaTEUWfg+l
zp(o%ULRWg03eWXqbYstq#cmMZ_q?#T5PPf|PeTxOxA4w2<tktLE5WGh-IKx-PyKjb
zc&B>xi5EHjEd7}pB&cQ0_0scl$44ylQsF(o3~u|`?r@qi=L#P`E^!!NTdbe%65dC>
zc)#cHhLFBdc*lD1>al!hobqT-GUs>*eEH-sJ#Vq?;kZ#Oe4UNuS4sMJyyUEP{IXp5
zJbito<LgYwc~E$By~<^X!%O|%6yBI|%@`vONV?~I=~l<b^ht(Ht}iuhQFZa=C?oZo
zBz&b_`km|ON12O-ccm#)_k)WZ|Ev?fhrMKeCsyW*!uw+{ncsC}?i0RdFPSr9Wrj|q
zFw1&}|J?QaWk==&;rq82pKJUH3vZ(r@3m2vs&=zZc>m(X`@F+TpS~!(End8Jj;{NJ
zZ>JaEZycE+q=(eA6lmujyn2itCp=x1CG~3%zFR$H`CD!M$ak0U@iVY)p9lJ~d{8Hm
z^rY}zW6CSHuTT6}IQH%oK6MG`D#JjdQ{Jq@$+&W3P#=|X@%mqMd_&$*!aK-APyeA<
z-nqhiCxyG^I?YIx`CY>MWiQ^Pv2r&G@4a5UcRIZE*B;@$)Z}%wWAddAB!gw~@uS0Z
z{TXE9w6b6LJg+U@aj?ldS9l-yl6g-o?_I*X+QYAbCa1ip>qg<-<t3Lo;5_l)7rq8B
zzN;O4Wq%TxEQ`-)9cKThwoLMk626%pe1S=JJtcOH@YUh?FnOFs8gsL?!kg$J)4w0Q
z_7uV5?W`w-cZew$*Dg$Zvy(LHy-(7Xn)xR1+RVACCg0FxGGLz0f4a`P_-Nla;rkzt
zxrP5%vGz3yuez?%GIhWIQY`O1!h1HaQ{23-#qw?y-T`s&?i1dVym)^bD>sBs5;2_Y
z#rr#lm;Rb0yj}T=eBn6w=+}FM?*lKtKI>qUcdPKm<Ewqbd#;yFZ^p_Er9e1BN*uhC
zgg4EL_xG`K7Yi?MNgP(TuD;_w;l0SCO$3Iro!O0oe%N*dyq^lMTB~r?ufWBe6FYJ<
zPoftri?8h*rtdGJtg5e>b_Bf3h4&*b+un_}?Lpyv+Kcy|Sl%~}fHxtPMp@QCkFp5t
ziS<La@Luhu!>Cvtt~mnUHNyK1kGdXch}Gc{;oa<|!_Q)M*e<+}dhvcgmN)Ta+Yj;Z
z77K5Mmt2=0YJ~S<FW&QFbyyoGuj>DW*WLfK9lR-NuX^~?Z(O&NH{lf9?%#Rwe#L3G
z?7Oms_d8}?kvUi3Yg`k?S~6wg$7Kc{^U^aY$DDfe9H(S59kDnZu}kK8Hc6?v7EK@=
z&(q$)_%YDlq4@Fq8Tg$k$HPF=<(RsjEyw2w%>q4Fj)#MuFUKQ6v*kEfXg+9x92bEW
z%kc%Eyiq`Gt_yroj!QvD%kfyyadKP^IvziUiTGWDAM;Ma?=m@_0$L%*SAb5H<LRJR
z%JEg8Gv)Y8px4OpbwX!>R>^TSXpJ0m&M`-h>p|zqG3P<^<+u^FNsgOATjaPEbfFwC
z23;b@H-U1DqaDleyG4#yfZi&{D?wMu@oLaDa(p{zyBv3bep!y!f__DgzXp1j9DhUT
z-JsvXkKx<+-Gd+Tzl-1Z@ME|azwhJ6^Y`KR1N<27$L|6Bc>YKD{aB8F0{Y)_ydLzY
za{RE+pMyRs#~VN&m*XcupOoXLgl+`gB*)KyJ}bwYLAS{9bD+=5@r$6pk>i&^x8cX|
zDt@owM_qr5-y3rLCg@vo{5I%2a{Mmndvd%3^pA496ZFq={8yp7K>sGkdqDq3j{gC=
zSB^gb{ZNko1-f634}g9w#|J?_mE+Gq56Q6)O8fDn?z}zBH<@_MSLuRs+#i(lYW!LJ
zRvllX<#96p@j8mfyzb*WBs@L^|4x<T!JwzfaSbT%gX7P-9{+f6g~tnoHVF+2T_|)h
zXjdVidM<|}pn5Me-rtGfD1e@9C_9U2kP8io2UPDCO$2|6^;oeJckaO1=K`wNbJ7Fo
z`R-=t84agJk9ZJJy`gg|pn60zKFo<I{tQ?A99KNc6(8=3k95UzUGW%aKtJ}LP6$}+
zL7fn=S68Da0#<4Cm<Iv-E?x9oz$&+97Dl5um|#Z0KhYJR<cd#m#jkM1r@P`;x#C}P
z#jkV4XSw3+jhzsPxm!>B>YYR!1*`^FywMeJcEwv=@x`wAO|JMdSA2ylzS0$6?TX*-
zinAAYLcn5A?u3BF-rNZR>l;o4M*-_@Yg3+iO05t_PXttNAB}?lyVi`D_Os4O#8E(v
z0?w%bMuO2X?dQLoM8$u<EB+%_oTG#j0v1OKCj_jAod}Ks*3Vt>4X*eTuJ}`~_(oTp
zqlps&7Dp5(1gz(r2#x~Qi>~;~)<*^AsaMPh_+NF!f9s0B>59MYioffM?{LLA5;-AY
zaWry5z}n?Ra1^lixZ)h0oDi@+a3VMgSpRax54hq7UGdLcagJI}K>zQGbM$gTz~Ttz
zgn$~w%s59fCj``JX2v<9IU!(iRC5CQb65OySNu#@e3&bKmTxsCrsE(o0Y9I0gDd@P
zSNt4TJj)e7&lTtQrJWG4M!MoTu6Uj+Uf_xsx#A_R_=T>xS_OzI5U|u$l@TB9;#YU$
zjr1~C`gm7-qAPx>D}I?PKE)Nk+!dedicfdNXZV((yv~P)0sIaxFSWX8=>H|(Z@{08
zGv4KUt?v<Dm>?wL=d;vZ4i)FWfK}<juk!r}{Nzo>?{I$3w48wP%N195uA&S9H5-dY
zf#<G&&Av~E+Ub0*DBYi6)#p0=)Zv%s#>PWbPC~MuIy!;;%TF-kNWaIJqA@*dgq_Z3
zlhXYsSl69m$6o?T_xHEXO||1Ut9YXI7n#EFdL!MRWSt~ap0O&PV!iK@-(F(pxA{-D
z_MB|Td7YE)PqUtJ@n7A~PN&#({}8KH_}8fT8P?gu?er~5-(l8|UHSF;(mutXVcnKv
z^V7_9|2fvHr`z$RDxPKSKg*7Drj+g<Zq1c+K68`qA8D->`<JNnT<eMRY<@mJlkU&A
zE<D4IXRGug>pqFIr%Lx<U}f?`8-Xn?-G7la_)I&#T*XVR0-3Vb;&i%yto8IscKRF@
zFSl}JiukmOPqh9l`EOA1NmhsWqfN!9Sj(h5N>%&{D<J+`q2kl6Vd9T}tN2yc(`;M_
zeBLA7|0Qdg$iEin(*4(2`$RsU-$?h*vfdk_*sWiy^lEE>#BKfStSNK^0%tzy{(9?G
zSNYs2_1iB02J3#Qf8SO7jn-W;<<V^YRqVM)rMFsJrGEZi#TQ%mss|A*HPcA<-(=Ov
zeCY+H?=tIg(Z|le!djk&j0o4`m+oI_{Z;(&p5k9^eM$T=SEb)>T{D>6xSql<-QQt-
zN7@^o6-f85wJHKCSv?Ps?*E!qFZR+c>HZquNhx+ZN8WV*H>~%P>^Ns~>HfQ|71Ev_
zRq=0I7qH_(7>i%J|GU->m;Z)Id$RfOweB6H*wsDxbpL(U(=PsxWqxP3r~9pQh5tKB
z{*SClu$zHBRl5Ht)?Y+l-bYXOueW~E*G{+V_rq4p06T8C=bu|SQeKzhbh>|o)lbq(
zRsJWevSgcorAmKFU4!$?!zz8F^^WlWSfxK>ZOUM(rF!Oc|7NRfpdEh)B;Eg<^_-N)
zzg7H2YmxY~QN>@jeqCtu|3$@LwFXIgi;Dj?`h4I{6@SzEf%v;r#ox9z#OV93H9_pZ
zRi*E+cA?xEcpaYZ-)a3w^t%S<(*1w6hDbW^r>6UNSxcmSysOgpSocbMAEeU%VJ+-K
zX_j>-e(C-XtXEv+mo4?}%PRd})=N^~?p5&v*30QQK(PIP&>AT6euZ=C{?DwNr9AEa
z(C5pM_VTz&Pw@Gqy{uOHoZ#Co`8o4M|L+?l?WIA*2lxiccyglRPxjp^_Hran_n+kZ
zhw#@a{!@Gr8NYbXF5N%a_Z7)cx1{)o`2HRfKiyZIg#-ll&nf;hecwD$Mb$qR&CpCc
zZl@3PJ#>y8=l!)5|5?7bT>h(c<?lPn=I4LPyZGGL_<oTef}d0TXZ!AS<zFM|yqA>X
zKgYMsmEJMTmdAT-DgG?qWS9H{lFs{UDgN_(W6q1kua@%UJ+&17`M$AYpKb3*-=}BW
z{B}IYcc;X8A1uY6=bPcu=Z!De{I<RYzSXYuxsuNNT`B$|U#lzq(vY2>_qbC0CBE@4
zdmfc^-q%X;U+BBgWzR6Nm-n(#{1^EWBtK`WDgKLn1KBYn(5=J#VPDx$6}7mAp6<Wi
z_gB%!<{#~Q$WB(z(5Cpu`hF|rxlZL@>{}=D$j0&=FY&D^eWCBm(!achc#6NwH$vpw
z@$tU#IM2X)PAUG0zL%vw^1f1v|5D%2gx`)|=DX2mSNDff{8M~0MLzEVrT8!Recaz>
zu;WvG(i|<`%SrK1_uVD_;Qg8u{|sND%fD;HpS<sq;-BeDiHU#7S1J6w*OKDD)_1-u
z|5V}Ul|YKW()R~Rx8qg51!51iq`&64;$iVGyUAhx1-_GF;!VDL3YgPgf98Df(hJP^
z$yTtx9Ulq8`P{!;^O@0-UypygUE|wNW9EbRTVIp>e^K&YRnO@6$6z!V_9b9Y<rNm`
z8c_eYvF<JL$4T$Oa~=}!5C8kWgJ*U@$^Wd-_l2_kCty;NC6v=Z;w%QG+^>N$-v(03
zm3SZGLT({(kYDE;Bl&8DZwaZ9UM1<PB>n5I^s^Yh&$2jOz_cMMx4V4ow-fG1*@IGl
zb{Eu7>orT#b^J-jVHdCbY3ESdfjH-{q}TF1@_(7}A6wQ_q_E=|p;}HOaghIZk@pLs
zY-h~BmvO`X(L4|S8sVd#na(;%y~jyh%YPnm^8cCVp;uqxqa4m9MSL76ah{X-Uxf~3
z`9kj5Lbbd%MGor^<?_mwayU;X{SMDV-ftL(-Q38Sas~<2{$)A&A94KKEOIyVJmmhC
zap<|5ameHPz3B(`Z^U~{(qAS;KGrLq=NdorvHhC)UJyRE3-WzN3LM@mApa$jf2k|q
z<;(|ttH=*~v_E*Ba;jbD7my$N{6Nwlm-MGxd{Y@mz0>l>AkKXCJP-ff;^No!JBNJh
zoqVc37;-v9j>i85<FM~zm%N?AcZla<$LZn+_LIct{LHlXr^2tw3G)7j`M}3{n#rf@
z^CqUd{N+a{R^>XM&iH+nHJkL;cw5w!uKbJht6k@HzE;Tx6BJ%&?Lqr*1o+JQw}ScL
zzi)~hT^`E+!2K_gtLmL$52}vx+rL0rZk+G3KJgwB<LqA<|0d(`7so^TgV*JzUt;uv
ze>DCK%0)jmNAUIeZG!hto`=y~!6W5L7jbTt_}hY`{V|#OFzMBDSbtfMswl^>>o%T8
zC-iTghg@E#ldcf@H=(?~=lLn5M*cSDhy4#o{?|$22USnN&lN!GSxGs_#}y(!m}2xo
z{u?F#S4hG44N#M>g>mpfl+xoT!uK;5pYrcpGA_L8;KZAM9_7B%`S`&0&UCH6vVXgM
zAC~^1eWrg_Qa|X8rla)!P$=jB^b1!|$v?v7mkP<ZMEKW|f{)`M{i4fxyqwqiuzzKF
zzQ^;>hvOFMD8bQuP|5Od$Mb!{_mC_7Iyt|Fe2}N}z0Wu@pCxiRuG5Zs$*<bO>kfal
z<o|)l({jEq@i!#h-Cxa=^y^7sx6ZeM{J`HN>1v!p`X7Yvk4!i4ui$y3yl5Bmzb*XR
z88`TK{mJ2ZbebA>Hu()XS2KOPldi@ABhL9XaX9{v?jwbtZWceW-I};xMLNsr_oRls
z-(o)a|96r;K=Nz7(s}+ZnI{~upO-N6*D)RERX=UW)%g}nI#g4*oz*MN&v^{>gh?^=
z;!d82e^fsJJguMV#}R)}<o{f#PG|d|yeEbJ9hCNdf&KvqSIpU;EEBuic>Z-qeg^Zw
z{;=eGSmbE=SMfahfw??y*nbnxZ@1JPIO1!5`pGO;)*sdbRsKf)VK~omjCNDc&5T1&
zHBLfaQ1nf~dCu2PWjgY^<0nb_L{Kc3S=W)GFjTqp^Qq^Xn7^}ht@m`wN2fwRB%qS~
zNaU#YPrXGSu4_`?ZHz<Dfqu*Chsrw`G%(O-Wq>9m`7FM_Nqt9yl7BVh;NJ{N{#QWB
z{|?WCe<vyUxgL}Ny|rG~ie5`eF(_;hy|g~(iC#Ytz5XG3<v<Q`xa|*d##1hE^!PIu
zaq7j5AgI^BK*^7r2#WtiQ1WwKfqD%kHT0S-daWSEVE#+dOI<gCKU?(rk?6Hg^ePk_
z`h|K;0woS#1SigXQ0ny<<Iw99Q0mo3^hy@JxIRGsVJ^L<ie5A&0gKE(6}{BB4E}u4
z>jBYgujn;Ga7sX_*Er%sFQp&yRU%Hk?&o>v^%qd;^-oapf6DXVPY}KOb)uJQ|Cpq+
zow1&tDf;k!3GMlB(QCixl`l9K3(h5ia|J2*YeA{kPZ)<@dqAnzN1)WpPd%Vlf6*(+
zrI)VvH_%_ui~S4rQu8Fp*W=!L(d&Td)m=Hx5xpJ~z5XtGeJpw@KS8fV(QA<C71N&Y
z>ZUz=r0aIW`5@c#LQ-6GJ|uRj>pIw_>*<|h*KftHlSI!mL{Hwgq5s&P=<jk+`uh&X
z;qMnf>F+l{>F*sp4}R5-!B4x*c2g;OEhEJTGyZRBH#MSH8)?XAJq^lwz;Alc?gF6?
ziN8J;e_aUsXg~cz`!A=xuzw~g@->6fUr#a)e;ooPKkFm;xh_fm(@DYq1yZA*(e<;5
zdZqi+GlJ9$Dk}aGp+6D5{v~?l3C<Tmi8GP-z)|`Erv`EA^&rnfuic>3Yd<LYeWI6Y
z$KdDl+Fp98c9Y@s%Q#ee>Fa6UmmtnT(Tn{HaoE2QNA<_hYX;)9e;z3Lb-&F1h5YPa
z$bW+9rP?w0Q(b!Ldf!5SL787jIdVQg`J;vYT=e?4=+#|0Hi%x2fYM(die8_IUdm6f
zL$zbzoZ`}p^U!|h_|$W%{!E|sGWCL;0pera*W-mMPow;Mnr|8LFgSAlMEXPG0r!uf
z3B!HXClW6rKH}3s`{811j?k4t?-fdaF`e~`dS}uP&|8nEYWy<v&KCL2q~QNg;)4Hq
zQuv4VoAv2P`3or*_NeP!=)XeZn93=8Fy&JEa(#z-v;0ZN3Y{VJ>!8$cD=78*J1O-0
zkkqiJp7KzBZGyvj8uL9U{PYj!m1_O&807mZ@lbBx6Z(SSs{R}Ha@?f-Um`x@ye^=9
z?Lr?A`fH(Y3FSCSz14UPJK4^uw;CS}y>kWc%cS6+g#7f&<)GxhlJTS9zd+>c@>?eH
zmq2L`%aQh=NhwNu8RvLRI!)*kpwy3hdr-d!?Sp<_W!%tjJmq6OgZ)*%i2cqr<7(br
z?6Ve74&rLv#Uo#}<Xb9oI8R7GzUw64&p^HKRK7dx`)`!rUA|1phduL2(K*}=+7E@W
zQR1J1Ccp`UiHmeqE{4AD{4iDJUoZK0Oa7qbztE+(Xa28P>PbZ6b(Y_KU2+<5c-=9I
zc!{W|q!<+5Bt<zXIiS~457_&V(9ft3`qxn?Klb~ax3k|@^F36Ct68qd$NrdnKNh}6
zg>MtjgYP*~@V!I||7d-_DEeGWTI#d@Ao}bTI$QL3L}-Bdfy4Pa^_c`pebjgb9L|f0
zbA#}$7e0P{g?yWN9(+m<@V&-3^ce&^`UhQ(s?U!L{f$sv-}9gc>-)Eb-Y@i7p>GQ1
z`WpGvxDU#CGUJ?wlHMfrTS6Zex<#m(pMsC$D*1;9Ef&iCW_Z3*=t7|@g@&NFAG%B;
zg-l+5a_+s3Gy(66llHZ&1EeQd>OP3SAD*a29y}IhHIXJ-)>_g5xDP}+(6V-tCSkn_
zGX2RICrRPFYe-S)R+3`UOuze6@h%eS$?!3-{iopFZBkr3^SKf{9%U^h9gKAbQdEl9
zNrylw=;%M)vWAnMVOi5i&qTjM8p1msq{CnbX*%p6Jqz;tfM&oB(zCISK>7vPO?nRa
zNztedkY<4&KJcFleMrxPpGb$J9*~}oafoyT)_X`tVx9+I`7t<-Bh7)INYOdpLz;(v
zfixf2J){MAcPR*p!EqdE5!wl9G4}W%y#V*+NH4@Y%A^-z{)95{qfv|^Ernl6N5ikA
zW8hcPv3LiBbR5PF(lU(yC^LUK>>wQvzmiUXpGYTSeSq{5*iCvV>^>0`m17d=Ww4uc
zGWba=z)yNP_(`t-Kk9;iD*Q@14R(`GhaIF>!fsMb_TDGG3U;8*_-A780Me^rHz_)u
zyGgHs-K1#rdr7Z@pHR2_mEb3x1%A>h@RQC4KWR1mN?HSc)IonO_(|(5YcA;=%esqn
zF7zR-ho4C2!4A^vQGTei{s!1VIv@3ev=Q}#v<dZt^ak*gHp6bzZ9gWj6{KPKiL@2`
zqzl1Mx(NKFi@}dJ;9mlM(i>3@q&J~{lP*R5CcW9h4F}L=sNbZwV9zYl<tS&;6)0!Y
zTcJN`8`huDmhd>2l~20LvSyLqhH;a0HQFcX8njQ++tEJJ=KSrbN2DF_59yuo59wO?
zhxDtEPx>{;N89w@1^J|3hko;G=T|o^u|_o4HjD_@E)I{Vyn6D~aBfcJq={q3R#a4u
z9y76W^61OTrdEs|Tb7d@Zme9?5^k<vFsCfuOeM&3gjr&67RRZaffH|*oLubFS6?ma
zO<Xj2YGqCiHrs2i3^!NRhg&8tDl5aelB$M=#_FnYV>3^b6*bp3HB?pCmd%?tZ&94e
z^$e-7enCrZa~MFqj8j=zzn~sCy$n;;(o#QXL9fF!*S6H(h~nvOYnqyB7u57N44Pu)
zoaV+wm9v*rVw1>9qw=BtRb1*a^3u*5Z_g?__MmL4YG!3W4C`1!Ii~eCRJ39BI*?TP
z!*F`7oDM@e#-&tPWmo&&#wlrPZJAp+yQ=#7GF0*Iho&CY?y9L29^cs4BLH2|)W}j<
zxv06Ssj@y?+dL8OD+6}r)in(j3u9I2ylSv7Fh{IPG|u^r3nosQol{npn_XEMp39!1
zp?1NX@Z8GU=H|xcvSTeAdlgqU)>W##iXptq=|YcOHm=~v#8w|RYFE2QZJa1mVtccw
z$K|?x9dFBv*8&3cg1>W)Ol-W`QmpB3c%xX?(AiZrl~v8nRZA)t)av>=rf6YK5%#Ul
zMm9Egt7>**bJ*f0$n$F#ggH}fsYSe@e!=y%&F42Zg|UHli?xU|*tyNt2n>>~O?GsC
zlU2#;zo5}tRNaE+fK9lYNlbm>oaWAtGm|m>oKIBQ61-Va73Zelh&Jd{iML|Ya64Ty
zG(h{7FnYeq>bcif)>YLv#HmBfygA-XhT_PwpfOxKV*KRk=PLzJ-4-mG7mMC`_tdjV
zZc)q(!vz*^6FTy#J38Rr#nN3r=S{tgB-8ia2XbaJy=;*)$pDZZ{Ev0bD`>8(#{}M8
zI>#C&|MNkqZfsgoR<USaFPDr_*LtyNa`Nc3%DVdI7EU+HShZb-9qVGs$yJaIRi7VX
zkzph{-p|X>LdVcp)Lw3ApF<(qZOsGd7!M>R(Tj4f0wKhXk@2F%IhX1NE$)^OCtSYW
zl~nh#RfW;6L?In<<%`pr!@H8h3_I2iJgh6}eMHZ$r1xRHx{_WkO&PN*F70*ObXU@I
zpm-;x&II_1OQ#l8x|`jxuARn&+Y>L|&MRK?oMpYEf{U}c8>{n21sA7v(OLdcfyHUt
zu>p(MGMVguE`}Wothnv67cf5`yN&@?oOTt|HshmHn2z-7ROCoeILL<^t8((x%4Kb3
zPIhH$UT$=)r>vsdrEf3xb{sT%)j3Ar)9YB#zM%J!jCoqGy00+0ywJ<#lv7k$X=7Dl
zp|Q4kK~)2;Fnbx)xp6|E-kR;o{K##~v2IoN<j9TE>C7P?%b|5;S6s@a`X1dBD65FK
z<r1pq^MNV=RKw?l)wu`boI4x~4<2)<E<AY5v3geVa;xxIL~O4YcUy{c;P!y%v>~~S
zh|@_P2yq+HbBNB3FdrjwIk(eH#%+ptv$&iUXK`Q<$3r&@F_Vfd_D(f(!NlpXBZgsH
zX>B;lo~=Gko7mlaURZ_7u+Ixkbvd6G7~NR^ITcwK^&`$Ii6P?X>&LOj>Z*Pmd$ca<
z$FT?NynY;eteBg_@s_jE>*8D2i<<D{XBgkLULXf`Le>3ie(xIhx9j5UVq)}(H<O`H
z9iIr8-?*^W#;cuMS=U@OUt)TC-Fc^NjzRHeGSF-7d-nXiH*BuyiOun5GEn2q(&Hg1
z`e18yycWey=i{ul(Tmr4y^JH5uDuN-7p}bxqaSSTWv9u__g=Q9y9ZlcMjq=4tFa1>
zOaET2?Xk;3y$Tg=SiNnNu~rjnP_LC!?^~oFZ0+6JU_96gpza5%9(AyIu(fxs&=t+&
z!B#wN32cswRkJ~t%qOiJKWWOC(UU5tl$TE}n^rk(^q5Iym9aIa)3Lg#VPc%)3g6an
zjeWq%uAG)rS%ww9sfCqT^)HDR*Ci>=>qod=-CBs#I2TBqhDJe-{qvw>3q=1T5FMx1
zQPFWehZ$S-<MjX7+|R-PQII2WQoQ=-^q&8FAUa;HrPj=whsvK{c_hy%A7SOu2%kqC
zIx4Jq?UMScv3jpY^#CDW8>C|O0O1JhS8vxYTmI)!w~hiS-cpg8b;Lf4w@jqek63=Z
z`p3wRw@ma*qjEA{<}9je!K;no+Bvn&m2+zwn(*dL!{Kv;IQ1#3C~v?lw4$QA9xs$k
z<6NQ$|1iJ6!WpI*agX>tP%+LTu~l4DQL#v?IC*MrC8tk$_|NxZ3KT8F7~|-T*A2>{
zd}B>jxT@<HfO|9|=Pzh#Y$@vrK%5101OWPZ1iUQO)VK&wBNXPxr`cf{^Ky?YBLvjc
z&%s;8e1(e-LLmDjPLoHJ=!2YssFQF$e?&fB1Zl0QUszM07iGzf9_5(KIU^9Y#pPt<
zz3w=}%v|i3Vek&$i#;o`KY<QDIrs+l6X0=QiRWtup$S5t2OnOMkA|8J_IHPtA@kih
zOFsVg4;6WSo3#{#-wM(JujQ-o0r;@>0bW+O<Bz<8cieGEd0JKwaW`(0f%`qAYu>X)
z#NsvqlY8LlpmEOxpNTv4Rr~v}#Ko2mN}d<)QsDAD`PK;^v9H4W_JrvxcC5$Amk`%M
z<GSrwY1nZun6(`lc>mv&x4aMbDAmG1wY(7cOgpB*ju6tRAGUDl)Q+_VE<{Ihx1-=q
zTvmv0AzcTJ`wsX_+^~U*EgCw-y~n`)PvN7@14hQ;t^@8^4GOAp`+?8Iy$iT$NT<Ci
zpp@lRZVwo^OxJ#1RT7K4w-b9;fX~Ez(6AR<FLa9gh=KcG2JT;w$@KGDR61<)5DnVi
zKZ4K1eG#}!qrJ4dGkZ50xY+t5YVR}%GjT(323#5q8n*&`Chj{1u59b#>E{;>+#eda
zjV^mDfV(D&>Xh&GE_?SFxY$0XQ+wYuaDQaro;f_$-tEBMLI+6D_6`A`Y44}Nod6#C
zc^GJCe%@)|J}7+Tos9iHOh2zjzqt?Rb<nt%fX~Do_Zs%%0TXdEKs&?T3tX6@_<kaM
z<XxWQ!bRbutBVGW>+XjR7<T+OxG9Uj7f+9sw;l4Z{Yf-vd0W9}+7X5wA#l--EYQyE
zNO;^CKOPc3^6ot=7IzjpGnR)A8g~!)Ox(MG%QWJmNIS(%HgMMqA8}{9>|GDsEa}sc
z9PNj$bJ=?za4V2bT(+mq>>UbRU2Z=WKJwm<ejHh&<Hz=a_P4rmN(F7NyWBDiJAMXE
z%Hr?m=f%pKm1J4m%Ss0=@2B81{kIQx=z5PXzEeB04cv!?kGKVBq^2FqF<Hpgpr9Hz
z2Ye>(sMnox!}dy@;*K(K9}zy{e%FP&9=JoOhy;!MA1>TUz@>gHH*Dk7DeeRV_vgY#
z-1M_!?cJ7wamxeu4DgxuE(LC};9k@P?lc4UQ3LlR?4f1)ne%|<9=J*1GjSg=a7(+u
zon_!YX5fxIEf#kj`s-Sx>!AI79{5b$J-|%^6aCC_oxWo`aM$Ms0~cMA;v?^qC&l6>
zW4?uLqM||LZUCQ&oA6r)w;bG^;Vw3CF(r-So`=e4`gu8UpN^tB_4yp|nYcrNn+ZPJ
zJFyGgl?LuF4BYoz<y&#8y~m=4*7m;bD&KLyWg2lOb%DFqz<t8NU5!rDw09eD+cYSs
z#%%+iY40@PhLBF&DWIMC`5puJN#P^!Vsx4&?krT6Qk>U8<A%X!;)ad#y#mag;XYvC
z{!;kJ`){-x6L%eOS7=aBjr%e9Ox!yRKTj8VUiJAA1NSN6BkmB_IGsJ%{?-SQRM5Dm
zg3rXg2e`UkT?Nk0?A>VK{z~}B`{ent_GY7<a_@N^H0}oQnYhmaHycbWUu^%@DejBF
zr60(*QTT|v*j1l5ViI{R&g-CY-TlGqh8>&0Oj-Q>-BnLRXtXDL*zq@4J>6&cZ<fgN
zD!1(hF5A1teG7UMMqlTZVjl2o#C6bi{1$ws|AxNd^h4EPraUj)JqGSG!bjc{T)4>?
z$GrO8fD1R@z^&^7_ke->tbscbg>Krr9JttqE*iAGW#BXIodnzvxL6PBK|8ZI0i9l=
z@NE`8@<vdeCT=q7Pdm=*pmA4$&%|vo>}>#ZXSm4*?iS%A@4c8To4D(M`&|tRs&T&q
zJ`;DPVQ-_z^D5t=2JTkjBkq^aip4DrdCzxm2cL<1A8@G?{oE|_yl^uO+~<UkxI0|^
z?%I%LaXzAhw)YRNe)kc>&#hqY%+L7-?(@P&-ltEAwRc;{{>BQDRM5CjfzPz}MFV#+
zI6K2FHE>@LKJtDW<C$5$>xbFj<W->fr*XdtJ`;B*a6?F^pKk)~40n=&`=aoXcUE33
zZc{q;_@^QgH10LvGjS7s=gh~Kfwwc<s|?)V2p@SL&W^<`&G0VYhrnmzP6955LS^rY
zE^uoM+?Nd88<Cmj>3(uKaIZ&P2W{^{@R_(Z2JT8Q(+02l++^UsEPUkM;Tl)>0{1-+
zKmWlst}X>`G4iu~SBpF^+@%KYHUoFMYh2y-1$!M6EGlSwFL#Zrj{uix#JwG~Gkez<
zxUUEwd9NHC>*vyQyvKzrz-RjTS;Nol&pX4t%fNlr!2KpVZL@sW19z$)3=*`xUjv_s
z`wnnR!9#o3f_8?x&cJ<5_{e)nAQm_IT=<!aNYJ?D;4^WDzUkn84ZNM<J_uZvJN3g<
zLGh7y0Iusydza(7`2f!ApmE*vmq!dc(1k?hy_MvWH{7!RLkk1d@_q|G(~fIkM<&v#
z-`yh5tDbH&a7%=bcHER7iyK0Hd=%$((721hXX36jaK8=a&iwbHfr~6rd-IXO^xt;i
zj@6)`8aEq!Chmg}l7@8J%W=3f+&2x}QNl;wAu!&=&BnOxW$&rrGjX3a?7g=O+?@vQ
z+Xn8p2gTy<1@0Y4*FoF+P4Jnxdw|O{+It^pXZG$ja4!}<@_vZQVA{JJ<2L@HLF4`d
zd?xOv2JZdf?hN-+1NU9wBQN(?HgVSj^gB^hr+h;$dlTPs?EO&}xWOl!dE$EpZaF|r
z+=^`P{$LE4OnZj{Hv~EK^G~|KO*L@03m@&>?&=RV=2#ZLMX!VQ^E==(aYq5S7)-=n
z589cZL%?ObCf^R>Bk%ovW9_vtUx3NcpmE*(P^MwWAHhvo{LLQ_D=!=Jz7>_`lv_Rc
zOgqA`BNKeo@8=?m`nqxR4ctEoA92q+D;9Sfa4*Gq9kd<ifX~Fe2e?cl?gmiG^1>}O
zaCZtHc>^wcL+Iy9Axj61d&o6zJ!seq(VgN>LZU9WKMNmmFNR>k==spB0_+ivxDFcE
z?Z0V;9e)8cW%2h8ex|&=kjHNV>7eDIS;zSAb=VQYIr?uSC}ny1Z<c}kSK%Y?8!rE?
zFS5U(i6j*??yIi)vJbdv;2`cZpq=417`X2XA9<h1h_!bX8d0-{y^n#<tS^bbch)U7
zcY(Xuz};owUOX@scYBHLd$6dW?Y$6uChjQUYI~mpXJ_`VG;seWeB^y*a4hb|3%u8d
zeg!@gcN%a*$WK4NDDu3@cddcDTlk231LhlatFEUTFSM*i#C6d2&Ig}~8#e5H8O)v8
zdyj!TMfk}3tHM~^Yz*S8?>cDQC%|Xo-T~ZfFwtH;KlQTr0R#7cz)wv6PJ|t%y&+uu
zw&1)D8utX3y-xy{X~fm@L@(S&4BWqiU*rBa@|n2nfV)$Jf@)lT=g_qGMWcM#wkgjG
zccX#(58)&4_wdieUHe7vb=Gf#&&1thl<(VJ;J#?!?lo|K27^r8ZNOcLbRD$4|BV9^
zHvwQwqo4JB!^_?`4cvc%pSJQhrf)3nEKHVe#d#ex?iayl;-(t7JHSj?Ubs6A+z*70
zynn*AkZJE;;GV=25;X36;4^VE4BVaI?F@G>aH$Xd@}cmN_dZvDl{^~X9>IAXG_HG`
zIbhha56qOsAMY8Ob~HiWZ9E}C%NyjfBOi8TgNOR<0`1I>geRSO-M@s7ye&gwae1-8
z^4CG*HiFOeUkz||zq<#_o#7@Mxch~Vyx%@87I!;v`ORz{H10RSXW}jeZU{`YSGPB>
z`ZCnO{RsTT<gckuEUr~%sc+aKNd=AD06r7<9s^g`KQG)&1NUP{)VSwjo<s9=f4>&E
zU$!A*aKGT14?Su4S(lp^ZoYy0iGjN{5Q`fs$J(n0?z7-C?S0*__khUr!Yws$4;r}7
zrN`oK1FqM+^Vi@rarXh2Wx(>)^1N^-8MvPsxItI>hQ?#eL%I&Sd=p&d%WpS_z(m~7
zKv`~HxK|mt{}w*-F2eN(vPR2yJ8;>)b<nsi;4|&b0IqIFJ_zUxx5mKL`jPj%Q(d?d
zEbDO%3aW9>0iTIG%CI+~3*06H_YmX}lfQ$xvAF9dVm*%zkf3ot0-uR{4RA}rLqDI;
z1@2M<myXrAzju{yHY(LF4GOAp-*A=hJ%+vgyTDyz;Og=q_K7GYWQ&$>XcE4;<bitv
z_)L4B1g<XM0bStUW#IBVWZK@~39-0qfqNnqk)Z8O0H2Bbx`CVA1@1Zn7oW$A;x5HF
zLm1s(t-H*!W_sW*2A_$$2e{OU<;!uHc6ha;2Mt_Z|H!+`<!9dHuETj9w7q|J`T0}B
z-c!23-C*GM5kBI!x$1KhaPir{XwbN~xaxE2ADr=*-!#<rw(D{e3Ck<6Mi!Ok)YH{c
zZl#ho4)V1B_*{*a_r6Qsx=!Tnbjh1$$UEJTcWsuGui$Qkyrmxc%>*CIw^Y(<ATNYt
zmM_2Yr}aA}Gge;d<=*mAz-P)^X~-L9$ot_rvGO)T-v6Mk=|CSb`~ZBWy!#;UZk(rn
zXBqPLy7XH=4R&D6(?QGI<I-;wCPP}@*@nDZUGlcgu&lE^<Slc_d)<(Cjv;ULuvmL}
z^M8Pcyf*Ne_BOod=$B>4`@khH`8u>m4|#ug$xGPo$iwGbqvd;TdaQogRhYAS$eRg1
zQ@?u*dHDQdRNh6d@~x=xt}i97^3C7j)W4C2y!~g#>bI>Ec^`n!)Nh(0FUOD<amlNw
zwX6?3>fb7tyfEbH`jThJ<9#Yb`Ixr~6?47o%ZuPM^-KJtBd@@aH`^s|`Sq4{u19%X
z=aP4yAy0if8QKK#D+|Tyw|)Vh^Y)N88hoaHqyFURS7PY5-X(9_4HySK<UQz;_qriZ
zecRQt^&2uQR=>Sr%R0?N-l^a-^=sJa=y#E!-)C8|@{$+hel5~<(EY(D;4|eV{MlJo
z#^+$8^?ApMvGOXGc+2|(_)K}D40)psc|U|AR7cmBwKwA32ao#q1Mryg!jQKd=h*-8
z`N#wuvwYWN#LC-?&i*x=*FoF65`3n-eUO(8Cdw-_<Yl_--FCCLJbpLRl$Y@rN8Wft
z-e_PT8nt)*GRyjiCnRY7E<)UtHx2TdaE|&-#82D%T$W4Ta!Y+1S;R%>iN6M)Deqax
zD;9Z|8uA`=*}ME!Z+Q>6?ETb`cbOp%)i=i8ik0>^>fQR$HdDX+zdGeR#gI4ERlc)U
zTh`S`*FpPlimQAdfxK)m(SQ6lw)WqL{bTjpxW-%FKfq_|x6_a})sTnF+8BF7w_DaX
zJnA#+swpq^eW!e<8}hz<ZmhhGci>ytNY_Ezdpr0{c`G4LmoLAeuI;_`yjXc_adG~r
zhrDIrGvz&L$m9H2%S&|0t61wTFX)oD&ye>eL*7i6y~$t2bMPMeO?TNle3x^*#cx$>
z{VsFqH|uM-cj6&$qD#L9LtdpJ?{_Z!*4^bT?=_cx4;u2S40-N#vuBNY`|BuV+QDCS
ze<?SqOWVKhJ<qNLAIr@WzCFNY9bvt%F>oKcAhsS@-@tmeM?L*9_$aRwKZZ{s4@Iox
z)fw`xxG+}Uc1#X_=OJ%0_)K|s{LPWa=Pq=)x&5-u@Jpufk@w=Ev3}Y3ZQLjJ7%wjb
zA91x`hVI6<jKz-YyTE-1xIy95;}&rnM%lRhhBm{j@7cQBG3VHA$4)~Y?;%qbe<!-+
z)pR27DGUtAX5sQog}LCvlsp=k#@|<5d>g?xG|J`Ry7k**=%?rH)UU6|)Aqgtd6_PG
zjJoCRGvw)cG38zCl9#X!-_)i63ABO1E$>r9o}RZ;-fu?5mdCbr_WP8S!N4+P_!-;L
zq(hB3T+VpYz5MS4jr)CRZ`qPWKA0R0<l`?H9lp-P#H8=@zY}!YbLWbFl9UX-X{R`R
zw1MH*;4|CD9@NuPB(nW3#gBZnr3w|mXkJ#rFLD1r)y6>6Q+#aqcr6%zwN>*+G>!}*
zWb>Z{``G?pn4hoC=H?U^7ptRL{ckCoRPOU>3n)7fW9x=803hV6|CxAx*x}`=>5)HA
zopEK`&b@7WlHccvFRgfnO|!i<vHj*?WK_ocpB_4NsH2VcL{8W;K1Aapi!!#1&%}YX
zW&CiGj@o_KRetH(XS$Ggb7FgIFp?i5ukV&}C2vc420OsWvds3f<Vg8&M_lLn-JIHf
zSu(U-^;|f4#mCU`mJR%uG-lK8C`|ih!BvOC1AGS}OVT1sQX`{>?oROSjckeB5RBZA
z7+I2R0MQH`SSS)y`5AF_+K3-%dZ+$|J&u21nz+1gQf3=5lLnQCU}}1-sj%)$Shp-K
zvMe=HKD7O^#NDT~mnB9LY&Wku)Vc%bd|P4i<X~iSVq}@y<j(bhbEA&*Qsz+jq!sXZ
z)bCq}KA`>PL|thj9|PEiEsw%>j(6OC$KU_E%ipuR3F<o5ULIVvF+8k&a;R-bzqXHk
zt*5k49*(Mi0&4Z4SJ1ena!31;+5^|Au17UZ)~{nL-y27P;a{iqxiyHU(6%Qy<4V<o
zwmqBNULI<n5{gU?MaGBP%QM=iWJD%sM8;>dmuI$5$&5_SjEv80FCX4MWq4%r@W^<x
z7u0A9uWje2?PbCC38DR)62b%8c6^ld==8*n#8)B{LXkb}gUtZ_V)*;EJr@LHduh<-
zmGsMk?W5Dq8=ZQX0K>je%=l22*mmGh_~iEK!S?2~3!8_A2d?RRXiQqtqX%}+$~m<A
zn)WfFw(W_(Vh_=FAfa{As{O5j_U7dFF~RmrG9r^Q5+nbNjLS&P+Jxg|-*fHbG7?L+
zCXL^^>bVUZ3zEt<MK-mM$y~J&>1p9pBZ(P@wjo2}s*SCuL=NbV8>f|fnQ~z`BNby-
zcu4#BU^|2&V-V*PC|Xw<CQV7SLE9H4XKikul6KydRIsM*A0P5XJ_(1~FJW!#ha8dL
zp}q}7Wn}iq?`)t?AUY8ulhL_d5{!&V^u2^w8e+}Kk>=FMn4tma5ou0aeo4rOzIfN4
zKRa~DDG}|@PwBWz5;<laD!C*W9^QU!;>5Ot7_Ih?3He(GMlMNQGkA9@NY2LHNl8!T
zBt3Po<fGO;I1zbMTMx02hw3iUF1#eUH3`LGOZ{g{U+9$dsIQ~;)9ZA-h~l^H8QNYp
zwEfz&$kT0q3`RD!?V!Vw(TTSm^oRSk9rT5RtKM!M@<7_|l*qPC?*}3;(W#quC6sK9
z{4?q68+ZG2Hn!i8xN1L&JaQls&PYrex4Hd>w8*rK)K#x0joY$nf8^<;ac{IO%}BPA
z#%){qYSPLdLgV)7sqIUW+eZ&wwUJD3qY5ANw<A+)|Hw1DlXBk9d2aWqt6puth63M(
zKIhF0M&8==@tMdNxHfsvD~szQOEc2irzf^w5d>Ib*0#vgn?5<S<ju&tPtcu%pZ^sJ
z+Q`z0kelfH04k(f9GO0hyb(^qxwMiulE%IfS(F%=k*xF!4{V>2ij!mBh|EZhEJ};K
zynBEWrbTU0MHsm%A+k6q?thw7p;&(g+ouoR|8!as-|)1c`u?Yb;Z!A}ZAqf_6xB*v
zc|X$jKb;&+NYe?t2j9_}+`bI6mc=)=FHE3Q+iw`UYJdC8VEaT>K1t*L8M!7SE$iLL
z$B_>=9Xu12-fm>9!h>H>5KAYtvneb^X0ZAWLJQ~;J_%=%OAaQDJs6qE$qyN*$7$`C
zr<S~yH0HI)<*AXGX}kL?g_R_+dT~OeDaL9jDnZ+S*!)q=_u5a0^hJAXFWnbO?Avjr
z?&HgY?d8d6S6S_oGo_P110@-3pPcW}(WAVAkyN{#w{1y4;U_qKvYvN#uMfbv@Dn+q
zV|+2X1w=!PjxX+5r1e7QFrIo1Lw_6{e5QEm6jh*2&4<y;=vfasgXj=tw9{_&LywL!
z-q(>I?BM$oRwNY%O2cWv;*PJW`S-M7umdr=s$*2JZA-9yT+r4x>PHNgp87^7@=<+d
zD&A9lTeUy?c9fg`EHCa@rv0hQ8H2gw&!f;U>h<X5MzsAMR{#EQ@aK`}>(yQoWKL9`
z&|Z##kL@KRw!LJ3F6|}XY%lp8i?m+j6WYg9FSHk}*D38&ymX3s;&W*)`O)^0fcBCf
zZ7-M#1Z{nzenflm)VEjLi|Nnu{ElVXpSqmUUL1cOg?>@5A7y*_y!?42`Wo#8vssQW
z?c*~d<-v|C6LqUeY%fo>Tg~v;R#V*bR@3=-r~5;UFQe@C!Znx3_)&VG33e>fs*O)<
zA5YcLaI|V@I9_T+T@q)*=~Tb6V8`ME9qnppnQ)+ELO!R*9qmfT3HcrEYN){pHPB2*
z=x9o4pTNbHVeJ(eZGY_7_6aY<O0%K#37B*r+J*};J@<|->O{vDX+7PHEpX2f_TNg|
zX~9v^kr890jEsqB>7$}89W(Tx?cm9dgC~1B_{ds%r~Wm^L$mzLb@`)eF4N^-E>#l^
z{g|j1ttC!Fr*jdgugB_MS+H&6frwm5<N6?a0o^HodoVD1pH~hWrzih;@5>#wVv5Y4
zd7gEazmWXwwM;~e@FMc?XPi=b%zRjWJ}gky0aw0f5$Dfj);ef;nlgU~KTYGcDP9|n
zMrW_QUbe-ni#2*dO><*?O(-)byPzO9JGXdvh}&M)gc=uwn)8c`it>wUvO?7jRSV{X
z7S=Ym)Z=_k(TMC3xuMLt;c!#S1tUjR*)m4VX>6R+P}|bj+FV^b0v}5r8E$NBsGeI@
zzhGoT!@~LJH#IlTtE~=)YD(&gOX~7#ataFz^J)sRb8>47s<TV-OA6}pX6I$sR@dg$
z<mMITW?5FM6qxVED=gpApl?WGLc$s>cW2=IP)VCiI(lGmm4D2DJ`->2vpS(I;2#Y}
zoF?BmrX%1H!^8PX9li#pBh>MqTi#5E?=GezMEK9mx76W#lIaLd{O9JYcKCKO9icmU
z`gy_b<mJolfbQg7BYa)S3qh}y!Z(vjYC9&}MlWARE6DSJ@KhbnGo3svhZlvX+T_vY
zb*1eOmgzp>OE>whbJA1Q0=;FOVWwa0q~}ZeNoM*KJ3SNUrb&7^akM>JkFSDnbYdTl
zK-77;@W#}ga;alu9n1%W54VvVnd5E?%mxePY?buM9+-iPeM%7d_6pxVQ;yc{&o&<U
z^s`R4dGRfA_(}t0uq@oRcJ$Kn);N4~g^$ns9Ojd|9lo`~_Z=_3wGQ6~;rodf-#UkH
zyYO{qM=*hcy0?SxoilW2$5q1DogK@CuRA*)5WYJI?ygg}IQDK6zVCYReZ}EBAbj_F
z@!jR{h5C@evL50;H}3Zxz6rwjUtWCQviaEd`2Gq*Og$do7N`UZ)7MJ+a58B;q*vJ@
zc-Auna1YZA0ZRnQ$pCiiEyp_qPUz<x;wWJCw=P0DmXRg6(-W<Hq=$5}{nSA;7O)1Y
zcNwyyXWaRdt#srs?KC~b8jSRcPSf>BWitdU<0dms1=Lge(aeaS=0sFFz3YU4b-EM5
zQNZr)qUQqEnbBh&1gv4Mc)BZomMfm&il6O@pW}*Wx#D<m#|Q!Id?QAEM!MoTu6Uj+
zUf_xsx#A_RI38#*LLg?hBjR6dq%uC*6(8%0mswv<vQKe7k>U?n<DAN->fIir3Nz_b
zHNe<)W{`ip)ge`YV?~O;k9GDSTOQ{VDgG0zft+AUVE(z19>H;nzrR&5&`xYp@kHzQ
zG3f)X|BOjbwjLJ!?EER#8zSG%pK4trV+qIY6#prfn5RIJk@lZ1dmfS|QKk6PqR(zH
z1NkSVsH|4CN<YoITJTjmc_hx7m*O94?O*}|$LSRR>6Yqya7?$Q_|LEgi9#HQQ~YOI
zXPf>39!^ICMPDZTwtt7I{m96`zAD9^ZskaRj<G5Jv#eVs&apJbpJDA4fgEd6{AXL&
zxa{92eJ;n!6#qF^qLeS^41@d=t%(w+E`$7+TJ6wL2cG-6<o^MVQ~X)hi=0FtaEwXu
zpJ#PQoMTCf|9tE57=1<__PqPD7=3cAuZsU|eJ-<Jmbk6Y6zk#`{5<Q*82ke3)EN9C
z>m1Sl4y8|t^&6Kx-<K|$V^xa(LhClMe-z?_{FhssV*E4JI#2lTRs0uOwGw|w#V@vQ
zl={Vbkm4V01te~l-&pG+i4RxlW!AYymr5INAAo-n7_S!p@f71JuJ{EmezQj=|L<Mt
zlZ3(c?{w==CsVThywxE83@cUQw*51$pU3cj$yyr2f33Co1Uo<f6OYgC>cIFSSNcp>
zdbTS)#g)FJua;)Zf2MzI{9CT{n_TIiO8GDs^?6tPuj3P4`OkCZ|E07?-Cu5X^?&!o
z^k4n0IWhfLqBT(JZv=oT{(;tSW73nYzfvg#J3Yk;N_jQmT#7%{`i<zX`!~Y(KOcMf
zf+mcx%Z>ZYcXys6OG579d>rAJKc5tBtG*LH))(^Skius(I^m0vhqf4(Jor2=dFbon
zk_R7ad2GJ)7iS*SzZ}$$=T0Y6e+;kPrC&+@iyXgYFdv3p?eG6&`Z(;5$Ma?O`)-u4
z)3b4&xRvC?`RmCC+#5+Rb@(_F>UWvF4>&2;W0;TQkeTlWo`>=`gEBwsO~MpM&e=>y
zepC%bwVW2jDd#5g1Ahh6A*X|J$oUqjA?IlI`3mHjemh#d*x#D+y7cQb#~;cL6e9cE
zexTYPo_<B8QGP{!Pro9+@~a`o)31=D{0cdqemx3(JpFnUdb#~tNI#+8)zaUnFRX8@
zFUv`<aryN+@hfNn())pqCPn@RQ05OapVaq$Xau)04mn>XHR@XkapqU$3d;V<l-Gzj
z<t+lGJeCvXsd9q6uk*YiPt`ZbQRM}y${lnJ^Fcr6r@U3n2YKy04|(5Y9P-$%O?j#w
zA-}3epgpzsKOmR&n8O15r4Zw@ojCh-#yO4g!3pT{EZ-=5?DC;dQW>wa--q^1u=_RN
zL|cw;j=i4an`@5?zIt0<-+0@vzIk>(??Wd@fB3GqEQq#zV+CiD;9M^9Dn#BDU?Ly-
z6$}xU4~47r16BIryrR=3|4hk$mE^x#Ww(5&rz-z^$q%aX;k=^PN`BZMBF-$ykH(tM
zc$Mf~g9zg&2PJQT$U`MjazK-r-X#74O=BE<LxqM&kv~JI%7@CX@-+)S8n;SEC06OJ
zlD<&VQ5jYGVo6^j={HLHO_IJ;^hc#reqSd1M}bHE{XToYRX#Tl6D?fMsrM#vS!Qiy
z9CNGpN&7)B@cK^#KIs6<nnjv~ciKo{^n;{>@ZJI`D(3-G4324#jcJHgOnS2Y{v0l|
ztd)$PihQJS?u(>@v93va8vG1h{6nxVO$w(skfIUYMS2GI_9i_O`v{SS;13j}e;E8k
znvQ*7NY4TeX$Eje(WqZ1{Q|B_NzZ|QVXHqA*KMR(=x<2R1rF(XFdpA!uWnj`Pe9f*
zR4gQ^Qe<+cA9&3vz`cR`>Pq|3_Svm<-rsvID`>52Xk1jbFs{$$Mjw@jypq-hHMPy|
z%w2t|*vwtnRNdIRAlw7oJcvQIE<foQr|l&za~l`UuUfFA`WOk!Z&|W{vf})%UUp;D
zCF63BAX|M;vX%5CQ%-I)7m8dd*_Go<>^fK9*wRUD>sCTeepG~dC!@!5@@zTuFkbCA
zS~2wa(TIt&LU!+-I0fNby0Nuz+QRJ01v$BuU33^`ZOn0H?_suhP>srbB&c0vn>Ker
zaTkUf4Z#iAy}n&!?%YSNOkK4gSA(O1l~;FTP`qtMgmqsN;%tMqyw1%&=6c1~rn^<^
zNW^qsBXUGsH(f-$TE!v899`nj&urJ(J!{wQZ1JEP4b+{ziz<`dMYe95fzis`fZglc
zMdr@6?NKII3#Y2btc8oPW7fiLd7V2T-WDFWUhy@}Zq+&xG2PdVI9qtUT6NRHDP}~t
zc5&F^b2;;C7vP|we!=y%&F42Zh4D;J3*T66s9j)<SkM@*9Wj3L^z&Q7Rn^y{8ZD@r
zcf|AfqL$j)>l^Fp$`<1z&c&Fzsc-43vo-b2Wjz$guM<OFejN@bmdu|G4a2pS;WEl=
zu5C~TcJo<ebLNTpOvR;h>${%y$IMm7=ERXB&e>Gq;+8qJ;RR**NOjj5#4E3*HjL@?
zv6HvBrKy$rT?z$z?B4E-JKViTgI3jzD-TCQj-J?7+=yr4)MYC2vt1oQwJT|wjfPcM
zRo_t7GjP<~BeYX+YUftgHCN5AwfHsbaMf(kCG!<MLK6z>nrmxstSy^u=`W;DDKDRj
zFRf1-J!Vo_<uR$x`7Mj8n#!)g_t1M(LTub~>!;#l@A1!!*}UyMJ*gA?@c4rIFdHCY
zdm@5L+qsWS>7zre>Vcc=JUy{dmut4TNPWwmy?1jX8qu^XyO<allTLop9eG@tryWh^
zE|HxXWDk(L%iIOBGaEc&-0re=ff_rVEbF=n#W_9|)X$&YT3dF-r5M2r8yc&t8fwL)
zBkX+GNXjb~&cpwOXlUJNcUYGnlhvydjqSV=87|GnVnAh_Q&sPxiw}p34wZVc*x2QY
z(GkPsm<`G{D6UCv4}gp&5Chcpy!D8I4lAIzuA>RlsJfEsmT*p?HDc1(iiyRQ+4ez^
zJ}A@&1^OUgALQX6?(hljEnsOs8s_3g+!Wj|&;hp>RQLz(N$|L@#Ce~`3|Qt@VGZP&
ze5E)$*-ldbdEbU%CHQc=!zyJ2q4;e3-cJpVsSoAx-qmW{(=g?&#W~!@iUuvO4Sc4&
z3PT=lF+}B^iF+reyzNM<i%PTa3o$wbe5Sm)kVh=)hubw#c_+eGl*jvo4BV$|mO8Tk
zF%N&UUAXJP7jf}1dYub*F>rC)MB(z07wwmk17qzd#r>Qn3XnidhV#H@+Of`%$9rX3
z-s^7tAkRy`Z7%(`8u9=YmG>RDekfEg{l4YWZ?7SbHfa5Rf{0me>mkoezaN6nv^Nd+
zptS#3Mq1uB7;nleMS_=pFM`jMS8B*Zm5a)|68<vft%p3^UX2FY!f*xnOnGx5FNE_o
z_~CY4RNfE4WXenKgZ-Y6u7j5M1Mr#h))@NnUaGdY9LAgSmP1~(76z*2jRBu2Z$0EO
zjr!qsVN_m!oHXU_g}ij6>!9VmjT0tcsIR;$A&i=Dor|v&e7LO{4Vo|dZ52tG1wQre
zgv2$U{<cb~oZkpLLO7-!xSbibW4x=sT93x<)xXeJrXB2@aQiYEH12t>dX)`6^`3=r
zYQCi|zU6TGzNj>(JpKky6L&c}f!jRz{sJbm+_uABUGLGPqW1nB6~dI4jDG#=9`gPM
zK2u&0_i!hGkN(49RNg}_dFvtX2Ojc%?2=bu$jdV1ZHB*0{bs>W-|>+5H26&Y?uNVy
z@KHbBP6nJkez@dWxTpRTr0Jl`gBy^U^4>S(oeyR$?_nrs>bD;9yvpMtFq!g-GoA7n
zX~<g)!KS=Y^oL&M5eA<rZx-ZDfSelqatwJTE_vG_&#OENT=E_;<mDOiDuS{4twnqB
zDvwFvGxg&h<hncx40(fG^0H9?Uga^sC9gEgkym8M8|LbFw?p0?NY_D^@9D07cP->W
zMdiN|P`E?YmwV8UndQ-h@$S1?7^s$aH~36@HyHZiF{P-yvt9C%(ZAm7A#a#VUJ#v2
z1^8IL7a8&@UGg?U-a{Vp{!e?~10Gd%=6#cl5->U;jfxfPfKh`WWRd`hq8*d~+JI3J
zsG=bx0|Y}7lL>#UR%~F)bj-JD>uzalTl&>@?bdxtw{90}w+(0k|5VZ1YFk_B)^F8?
zZBy$iT57)E@0|1Ad*;raWB|L5KF_{SCg<OKe&;>^&pr2?_uk;cTWaBb*uqO76KVOy
zp!<ygyiV}h`MnQ#OTkC^W?OiF@zrkxlO$MOlJa}YSHJAE3?ts<_(^@t^vTx%yeTf4
zS07bA`HC&PIt%X)$RG2I<%6QzfEP1%8cdgT5PWuiBf#r~KjoW;pU5|4=2gM_0r1$a
zgaq%;zInADco8rW?+W|`Z<bHKmw+c_1~yl|8lQYSEWD3ccw2n(y`DwBJALx)x9}EN
zc)NXg<8js~NWLHX@CGfst1P^YzWh!B9?!Z7N%{5o@>`5XPyr^E-_`g@`90vnTMfLR
z`q<&aivh2};9YCseHe=}yS?;h!MhlIc6;duUc}&CXW{)E@ol`FS@52Lzm2!U!dqhD
zjq>3gfIF!C3Ve9`t@7hKRm$%^Uw+5K9aMhz`tr*wR}tW_K5nq^I(+iY$%1#YPd<J_
zSnzJN@ZLEI<!9+`Z3CW7EL+lllMg1_2#I`O(N^`JVf>w1q)iFp^PEkBH;8$Uc1$CR
ziokb2##kYiAL$VI?0SnKAJkRMa#?|&lyg2hjbJg}PMp2lgfWq6plTE!Se)*S-HG_x
z#&}m(M;Fz%j-<OaI=#BKGDqF54@^S>plbEM+`+AOWs`r<)d1CRVU(mM?WS(P1x2ar
zij&33`5`FuQ+mqCLER3)x?YQ+s1C|f<Ec|I{5VP#*Vx`ep+2bEYPfpI&^1N9k5K1b
zs0tctipr`^8NDlf_dq;#GPy5?9uX+NFq$Wnk~}5`5_yWC*(w&Qsw=EoP^@AaErYH+
zcOHtM++SfFqkcC2RVB#gvT+Qc3fkn}lmoRYrG1IAanOqvqNdnT*<NVdVqGW}=q5Q0
zN(p=NQ=@thpBCQoP2lx?m#CXAb$UL)7|`3N06gVarO8pEJ)`&VV0U+NHwvQn@R;={
zCHFh~x90V2%sV&*36>^*-uq;@Z*Cq^b#(zksJcREgzMdtpR7ocsUgJDqkvEdmi)Pr
zYfosVqce1|&QQ<kh~{aLQ%v4J3am(%pDLE6cMfm{>)XTtQPRlr3)XdstX{%l|F%o^
zhRWE*6gsry>^+f-(Y<p+6Jdmld)b7;V`Igz!Un6ea&Iis(X}Tw(K#5V8XLE84uz6~
zeM;A+G^i};hrg$=HV-6D?o&1$>tS6Lf``ibt=JDf$HYy0Ij;QHX3Osc<}O=)yGG8d
zkuOXCL63tHVpZZF@UnkF-$RUcaIEJwU3(=@Nq$@vr&3>s^3(;T${Wq=DP3J}nfT*}
z3q?782VK+EIR{A&ZfCN(zX!ArPnu(@A8CCazTI)5G?-(_{7{Mm$WX=Ai-)cmhtb2|
zc5L~MC%zfae7Z@Yd$kw}BFzW|O-JKWl~7c<`IAUC{JroSyYdpFQ&)wyJla!uaKh8C
zLe0^c9PU(WU6bFi#B|)`YgF4hBXy<DO&=7AF21@!XDIwV6#9L6i80iQi3%t>c;eHq
z^wpP*1`x(fRfCBA2DtJP;od_<Ly5BS;>$7mD(GP?d@Wo&>NWJbz4JKnID1E_|MLoI
zc;oB1o-w}Bg5maf9!o33x>7IaHE%e182jcIq7))X&Ovg}S9<WKR6{7$S=jsbnDwV1
zV`n6vcAnmff;w2u!LIl1!Ei5!&g65wPlfyDsZmdlX35vkOe4K}^QnasyyH3UUFME@
zqEiS{5M~9Wq#AX787Gr+QId!<veh`EkjnECoM9?3x~f8g*EsDJ5id~?+*em*@-es2
z46Ad>YI;sin}QUGDkblqJKyvkN-wVkrDnbXj%c;QWDxFsnkBG{v%x9Jea^nE5DL@B
z83)fzKIIk5lPWE!v)yACOnupSYS>EEmBN<_D^0K76S~xqVnI$A2*`373RyC0c5^%Q
z(G(7*u4JB9KC|DQ^667`=@rpR%(~dSlw2U2fAz|h+45n#UbEI`T`877&<$_(0u*Wl
zZM4kl4ddM2Q0(swV@+=;R=uG}^@azs_l9x0Hx#qypf?m{^akA(xcp$3h^R_G+U`)S
zyTdqtcc8v^DB7gr{G#EzL)P+wMqa3$U0|X^x*84^$W586ca^>2nT+1R#njkgdV^aq
zP)<8sZ%8khW9SaWd8lqRg80fu^$6(uXZg%N*7CuJ2B2;DcGH_w`7A>D)R&d9D_{+U
zN*yT+GV}#^=PZ>wij@nkv=DxtEqq{iQ1d~ct~a;ISc=|Ims!?tmfn9EmCOnbacpAz
z%=Ek-ig5q)NdP}r&@yRc%9n|s1HXSY;Ee;teGA5+-irD@%Zyxo&1yb8G$@fVS-ah*
zxaUNz6i<b$inqtRTAQ7o_U_JjbL+}hXgo81jm<b!xT>RTV?;dxn#aL3PV<E5W4tJW
z@^8Pny<>g5jv6_)g(9h$pOz6QSH2NojxYFqst=Cu-S9ZCNR^}LCNlmtCXDaXT)jn$
zw9=w-cyV8q)XIMnSM+2p0iV$c#xypQ2Xq$y39r!)N34744?3NX_7YxibcVeFtjo22
zF=Fi}BS^_Eyi2uQ5%>=>5cDzrlW?tjZ7sRV;9Y9A5I&N@LnU)saN^H0eA&_xeQ@hD
zaPnK37W1~rVEm)aBjr>NE|WLP#e0*ak>q;T@Qop}<Z&)jbesr&q7QB+>~44+_0P2_
zCi3tuCMg>aWuIku{!B(mM`VB5lbyV)4etcX=Ho3GLw#+!T*-U4;T;>moBy`Us>*M`
z@Nyr+kDLFwblyXTw;}+y;EZ$`L?2uvh<9{4FYld_cJiMuZ~5QwWMDh#G`x5<=kY?{
z*D|n0;3fLtxCP;2srDHMhdy8OfWbJ^<^cx#?0yqgXotbhv_;=iP}&UVy;xFEINRS8
z6R!HU<P+)U&-e1k;;O`tW;K4(jh*eN2EXAbQ>U3p&_oK-ac1KcU}jj1y~`!=Wcqo|
z#da{>myB^vHT#_`pUm(g=T^jL*g1jWcoAt)0X8#k0smz9@u4&muf$o6aF)l!z;JHh
zc{H+)GhBMMs37eN)qEdxmeYvz7J-M&AX6Tm8t^Dn#~E|&QGs)==YXw1w+z>>z?tOQ
zX(>=8;dza$!;B^4QGwaT6`uk<`iK+wwMu6d+uvCHGV|xJ?^$kKS_+()&pq4cu5)g*
z`VV!M)tsnVIM0>jhn(qVCz<mab&|D>_8_=Xc!{;2PWMf07$DAV)LAysxH*@V<QF<q
zef;Bn?ioJ!Ew&ru+4l?{(_nfK(IvY14QvwoH+7=@+~ntD%3Y*%QZSrz3UvlO<HP%*
z&;4sMgEU^TlQMYg;a7so{0EGDoX@CJNX=ESYy8ukgGL_CO(nR@-)`I-A4+hk|2t{!
zGo2>W<^HU~&vMq=`G?;{_z6*`TJy=;#d(H0(0F!0h~@DYH7ROc4P*1?I=@r{CEAnX
zpWsvpGfeV7ZR(rz3w59^!Mhd`=Md^Vi<$Tl<v!n;VDNW>hdRs7gG{9J@uSYN>x`Rz
z#NTGx8^?R<Fnh<8_nFE)&H0Jd9w+8kDqRN%Qg{>dtDWa9{E7K9o%{XuW!fjl@3Hxp
zI-gB*U+#R5V1_8q4~+bpf4;NOSKgmD<)Oo`blOe&QlG!}mH(M0Jt^O?DL*OC=Y8e5
z)mNS?edYNTE59sHj-b?S5{F40Ri_*GB)U<k^)xZetb|EjQc#DXbUoZfe^mAl=*C3#
z65W`rMx!1>Gw^L+V}5`paM_HQ4$~VA89!j$Q(!Xw<@ATF3ys-I{|b+f<Hu+;0+!q8
z^NemQxYfB0G~zn=Q#VXnIw;G)bTG!NbYL>yOh?Lr`5ujbY{#R^^?OvNJC|;x%lD8B
zzZqr->2@1FjtAsR8vjqz4gRmv4Y@=Pl@G*M`2arKE%E&MU|V8&i7E13Lw>x+q#U6+
z`Wz0;@4}srLU@z@Q@#9j(I4fzjsB<~w%2?V_K)eF=Qz*Pjd%x*`A3+e=VP5@>hCO5
zf08~#RrSvI#l*dn?kgQ<JKezjXS#t)eBuiJZ{Q|wp}{@bhs*kBeCChw<0k$FW3t^b
z{?{39<!=+iA;&l9kNl~0f%7cgz<HVBkmGG*V$xGM>YJu$r&D}#a2#d3UPXT3{w>|e
z-?!-o?k>84OMK$~r!fa%Qa;X0Z2#kZxXc&hH^F55go*b_WA?#h{0A70{FT6D{d3+6
zHF)jkL&lA!rP3EZ_FJYaZpNd0+1!A3Mxzm;2|J<1dd<UhNqI~38ZIwpbl)t}?Jy68
zQ_AqkdL5mI&dYf$Z<^yoXx88#&85Eh*O~aUO#Dl;#J|MEyUL_{wTXwuR!H2K@xQ?M
z-!Ota2v3W5ZI1CObbhF_2O>Mv*|Ush0d(-t3_*7y%@a&J7^Tl`Qg;vgO+Lo>7|kL_
z>+U%P&**fcGxN+hb@x0^6O|*nd&VOT>h6irJQZgZXrfZL(H!SEkI+0r>*Ka{_RNP&
z)Y+4uiAoopJ=AwiojuRej36G(3CKTWr_LVgrKZlFv}<AYHQnu<U9Ihjl?~0;MQ3(4
zb$2&*te}eg#_rZz<Iy#^dwHu*OHYnhuBQ98sB*ueKf}KbrtXq2gbto)RTs4Dw62Zo
zqY>5XS2rnLJNDJv?5cVys~Q{alNIhZTXj3GB>LqW2B*5QQAAW5bjJ!5oo=Fcw70bK
z4)n~m@$T-XRYxI9v_c?S;&$wjZ!}e>i+(hkdMfQw^pv~!YR3zxj5gL^aoOb!4UMxe
zyP|R7>;-k#Hq5@fF6tLyL}e1`36njy#+bF{=csGxcJs-qd8#sNt!t2@FY(;d#%(z3
zL{P5jRW>%ZbTpbK<wbIuR&;a?a}D3Sk=A(q_1SNtMKe2iU9{Vox}v)qw<zZ=K8C37
zeahhz4j3PDPB~lLdR|DT1_IqHx}2%2x;lC~okor{?H!_<00Rhh5;QiizPXY2rxD(~
zp{cR6rz_sLuC*)C)6^EEzhM2E;V&>&x=PJj+gAlEb;2FI+NL(%T1<3wUC~@uS2v@n
zvoqe_!t3!q?E}LMUD<}f%Bq(5%BG&SgdSNNn`KDi4RLAO*>U|{d005RyJd&W+GpKi
z&Ubfx7^tjW_vo>pY|83YcKo9+B@EuT^t7(SJyfWSQ`b`M;T$EuPG)CL!E15j-?X<?
zJxyILjVQ->Q+K*wQ!@~|;(A>4Zrj^Mo_&O?XlzWZ?&?^dHcQsEqJiZ&&Zdu3xF*}G
zbLAW8*<?rP5cYV7OYy_t<Te9jNX9#@*4%mYA_W2XwHgHLCh!JWR?CQ&&a-xe;Jc~A
zT&m7Kg&8Pm!daV0Mloion0KXib))lLupcIS{z2%d%O^c|zB0)^y!g{i>(-`#{42d<
zkj)-<e6r<UU;b8mbQP5m`xrZ4mR6$&i({G$N4$e?t)H@wC&wkgF_wkDOpi;35tMeM
z7s9)m^0DMz^p)r=+oLf>JDzsndlbP;#55Aw9z-&ds%VTx@!7bp#za?BYXWLN>!9|j
z!oLDTFI4Nssl2eyv484xu~dttN-ULPiDF#Scl{9~I+go@xzaN1H{h|}rAP$2y2GxM
zTV0BdfQj}Kjl0^IVqhyk(GnkD48Ghy5yJL`qDlbSc-Wpw`+AV@O~XEj&DROORt=&4
z3*Th$AuCSIghjAP$}nvIIM`z0@fjt@QtY$Xcn9FmeJ&xv8}H*|Bz5+|Fbdx|@Y(5B
zAYE)-sdSldN%w5Tx6_SaF9usKE(zY5V6ySHTKO1b;qCX8ANPE?e=H<;Pk_(H+XlRH
zFtJ>)wdBfo2kf?d1Hk(T{DcILY1nuJz^i~C@vueZ;ynkujaQ6z5tQGbg3rbqwDQX|
zrTn(|@>>DC^#~Ud`R?@Pm#=3fzud<ZykDYG*z)ZF-aiT$Ou_p(_-y&gfwvst%rEyb
z1+NZv8*e!Rg350;_-wqbz?1Sj&BFVC0JHI^2Y~f2B=W8H@eP0vTdXb#Ukmu`bax_M
zwom2*TY_#rzU9MX=Ly352Or*mg$JvPcLN#)Slw|W2E0GREhO?S0iP}3K7dHMuzyN9
z-*~bQ5B06ivlu|Z`zZKqyu-k201xxaH}Hb@EDFJvuM_=Qoq6%$?FXNYHy@2z`uPM4
z?{VLF)sJ}JG*~o5zP-NjYCG_15Kj5d!B6D78lBXZF9sph*%|PV1aATOZ26uCp5*sj
z@Cn{U{`{g*MVNpg!JFaBZ#gPK@_Rmb1@BD6x8>_czIF;2Ou;)He71a>fG7E#WZ`jK
zwDB5{FQz9Xc--r@@pb}_VJyGN_=$X<LBF=~HUTdxU@!&m|A5cN+XuXH2qzxja|qsH
zv=19^0C;TgLW1`?_-wobmV9{C;o_Z-{xDV|!{mKZ6un9puNo8|)7~rjK)y)_kS_Uz
zBwat=PT+x6;VptmEdEaO;SGW*sGLhoxi}`>K`S3z14y~}(|yEB7q4#Ibf1y>HFy#9
z)1Y*pL^#V&(&Y!&q<%RbNxCS$wEAcO9^0vqlnd+3u8(5iMc~K!t;J99da?E)ZzX=D
z`+(P~t?EC+`1>*<&_wYlD#iFk3?Z?90Tw&m3ZyIbI}6O@qkBJ?Y`k&6D-$roN9PmZ
zv+-(xC;jMB!$-Vd0GOu8Hw$=l3o%{Nxv<#jl25`IF7^qq*y(m!`Iv3^i2pafe8jTk
z;}gDoY_RfixrNt=bnSe!WXZ>%8HXgl<m3D-B>6bx8;5ovUFqj@!Aw4;_iZ2EhAjE`
zmJe^Am5=!r-d$#15c%%Og16N-FL1Jw`n}S^8w)}0`^y8svx#*|;x}e#uTU<>A>UVw
zod(1BYeGkoIP~WkHk%~uKh5}Oy05bwd<{~#h#=Pg@Qr^p$j2)PXMelO@Ufg*&<+F(
zPG>*HjRv#UyTI_V4`UZG-qgaI%bF^TNkiN9{~6WQDx_w5wP9I4=8n4hxp{e#1Lm_J
zEw78P<|J`E<7)B3v`~HjAn<&DZ;g|70AI!T?kh0Aa#5J~4Nt@!$g_J76|V74@^2aF
zDcOtc;%bJvvik5&E&{>Rm!jv@`p7@67G=K=p^`X5t|<hAYh+w52nk>C{RrGpZ9<~z
zW<m7PEd$|&yYyXytoJeMa4}n5wdT!*R0Zx*_r8;dYiYl5Zd?7}(De8twSRnYsO2YT
zow2Ly%r(wx=dmwb+^|^gG_>w>X2c)K`{The4-P&0g^PFMD)k)@P|5ip{b_{aS?tE+
zMd~pcq$ZSj$-Np;)HBKysS31;&%TdXY}b)@;q;VLFC)lJy^I^d2lS0sxhs==h}?1s
z<=}3*EDA1PR<cT^VW_82N&!`7ZgdRO28b7UKOVO=JBv~qifi9VoNtv_>O`sO)LggH
zd-oL9zSHv(Z+O<EIztCf_9FD|4b{GxC`*lUqm6nH)iE>}-Zh_hQD02)Cd|;)g$IAe
zW<9qE?fRtTT;6k6`B1G89&TDvj;2g3`77-5=ViFtdA~n(OL1y;Y3-iw;^d{t#UY5A
zyruZn+t7nkR}>}Rob(hfWft!mDoDN!OKIPdygT0pbR^u{1eQtrl6!akA;0#y@Z7gA
zIgD1srgV1rvb|ddlFQ1*Cq9(i(--<NMG<+Ee@b0fn7Xnk)m3~jlzcckkXi)PS^N9O
zKaUvYsT+%u<M*d-EKV-lAHt=oNZ<JVy$=^6s4O`+X<y<4y#t4P4=+sty!*`LYp;F@
z&~yN$9JlPsP{gl(i^<_OVhR_q3V5^bwMn~s-;Q*LlCK@?gy*<juN1_{(0kwrjN-oW
zO2SDmg7KFCD+N!aFZ6uxz#v@3Z~h9Ymqvf3>nvP6=Qjt!#r3}#438~(9@l1{AMAbj
zNG&)}zW}Rc!p!;yH9zhXUUs;5_hH<yop-o*@8R0VdJeH2%r6p=lN*YXoyEz9QrtK$
zl$)kfi^KINeWS@}0bosD9lH4H!UXj;B=dWBhmu!^UR{AoVjfeYlh2_l-`Vv}esU0(
z_zI!4;1ZNmEZj>?XUTV-{(bG9@Z3S(z`b(_x)tvD5o+?o;mh9HGL$&0FZ6HVWgW6W
zbh|?>j!9h;I+%|tTn4=AZGE$LBKkNqtK_V0edD+FJ{)4nF=1SG-g~5XsJ{F3<a4in
z9#AX-RD25juYQBjw_y}pRu;;880;_h4zaeLJJ^NrBDAl04DNmTFs17ouVk6@8#1bt
zL)&ysg;Y%yN=>=-^##_~7g%50P+!|nUx!g&g{r<nsIMZaE5=C8I|5OYbC2}yIa2#n
z&maXYq?i;pSwUS68wycVMW`vSFzSj1hhibAG}j*)WB&`dZ;!r=F`tVeRhr=?1HAAZ
zQ>&=GF}09RVsJWq(+xL13?`4V;X%xbEpH@>WndK3kHPrC^DA!V_Y@EH6b)4<k$N8~
zHdBz7IBdhjFAR!I{=o6Grx4<PD0L~?SFt;`&(edMC%n>y@UUKxTy)Wzj@I@FU);xA
z%p&EYi(2A%rN3Hy)hkdeUK+dgt-R*O&O}!Pufwrf+tbWLI>O0Zy-)9|MIbu1928CB
zf9q}vuaWU)Q5n2r3<Gf;=<=w0Pu=bX7V@oTIH-aD1WVn);T19O{#QT4LDTq8_;4Sl
z1zg10L4VK#{3qf1uG!ZFh<wj89Mr^r!e{PL5sN8C7>1FFRL6h9hxFDM9%7Xlo(F9n
zxs!E27~x-zU%labgr;B_zJh;Fzu&aM@cvT}@8>+;2%zpYyqCl7;;KBaSBaBnpW#t^
zdy=-|xmoeBE)N+V^(-tr$m=R_Fucet+=I%VX-qNUX=P>dw*eT0=di;4585Z-Hxa+#
zDD!^O369oDVa{=?-7^oN0Jnk?g*uE&>%5F`Jb+kK;NStwq5>*<w21eOZU!EoP58^i
z<1VvD1!+&Ad>*G19u=skPup!CMvPa1+pDxkf%@{i&CgQvs30SMY>^&i-X}WG`I@OG
z_FLY!$yW~~Iu7fHbt6Q#e3P7gnD=j9W`j1w@Q<A!E?vL>YycYI&HFcJ`of<u>}*FR
zH~@QrFZ>NWOOn`!OK>o@3FR-u^se)z|Dw<Ry3hTpk*5i9OYm{bkNVOZTcFYFU`)h;
z+d5ykv{4;C!Kw6xH=FWg|L1+2ORNH<yj;i%(ftW=z@(e~L5TNhzF_Ku;{@;X$o)C;
zFudHCzs;t+I98P4<DEY<@^C!heV_A<n|;3o2Z1LVeD?Da90Wei#MkxlA!nZ{4{0CV
zQzc3McrKVE_{)u3@Yy5AU|n%8%+MJ+k93#Ojm^`!Fh?WK0=hA<U<*L;t8nb6#2Ah;
zt~cR=hae{u@%R_gJ<)t~_#DUiEZqRvK@*8{CBt;NU(5RslxH-~Nmm*7#V|wX>#=<_
zm?;mxHF~Y#yMf^-1W8}vU=UDpPS)q(dH-ZK`H&AuZwB2L8vm*IL@C`U+<Rd1-pD^0
zQ~2+q8<jyFu?!!8$@>HnzS)F-+Jt}8gnt13%pZzC#TPf_%b%k4!4Xg7Xa4h}o?FGM
z_R?W}Gagu!9JR)b&_tSZXy)UbIn5BxjnhP1dVnU{&<ixtS2@u0Tzff946h9|i*!Fg
z_jB%}8~ajE&<x|8In83-w)4>$Dv$=xx#MKXwTaq9ylZW1JJcDdue<Uiuelu*z?*uW
zMe{GjuHeCd>0XdplhxHlagv}ZAraym_zjd1zNI=7F}k}u@Fm%v6+G0Li1TFM+NPW1
zI9J!yvN7kg#WS>+l@&NH(6YV>2SKq|Z0_mminli(HA*!Xs7QL)a~w79;mpQ$O<k=`
zE861G3VbxHb>+rJ91$HM`t-FuIOa8@ryXZWZ$8>w&d`hHoTEi+-MUgA+-T%!uH0k$
zYx-yose38wm3w3B+RmehZ>seuVq~;SoI3gIG<O9&Y!k^SxDk)m2Nu^zv80ej;>#==
zb#|Y}4M#kUu1{v0<Jj#@?H%21@pz}4Gav4hxtAro?bYE3v>Sc+W9q{J$ieVVGfJ`J
z;&iU>czD3K>~I!b;^@vq^)BeqD_!rK;~N{BF$g8nkM`z%+;_O9Q90ZpU-Xo;k8<g=
z{Kr<t*}lw`+xVZ+Vk)P5BV5K<&sia0RIF=2fFAF1J}~Lkxi@V5Po?eewUwBpycsDl
z*O}AU@#XZdnqoAuy0zQP(zU7^H?HjHG9P4W#>w;cj+&O9t|soXT*2=)PFMCT>NiB|
z@T(BQ<%c>P_-yQHX<gUS>YlK3EysMq?z<;=?_jZlarR+7bC>n}f~Ah4iC90;ZkFOc
zEeu#g8NM%JEoAe>;LmlM5SC4fJ`X-Dxty4GI-9VrVi=Zl>YXt0C`J*$Y`jkRU5%fR
z;1z<&#-slJ2$+b6EV}Pa@Au*DM_2=XLW0LNpN+S}!sFwI$hQY}u)5_Efn%D0!4$mR
zu-kb1t^Cqo@CE^H<8dv@^{SBI9Ri<?cK~>J6j1r)4uRnP4)JX~K94mC7)-%?5ll8-
zAp+(bJS>4-yoCTp6LD!962nqirOWi0E`KNCc}b;<^hldv)@iHyFX@f~AJcUVUjqUp
zALNmI+=y^HAN%3v^PQ03eH8w7J~kkr0!(ZNT%rr!-Dt=*UO(jE^Q(~H^@GpGyAJ^o
zFcGg5Kf(LBuiloU(W$*K@Q?)WR$smCv+%g{B6v^v@>`5}mn$UwPw*c1<@Xf?FpToy
zQOm`f;KN%EJhiu`;avIr-;X#9Fyau8J3k`dcwhN#2Ob^?T@v}m`O2>tjYs6eBdCkV
z{Mq$!0PdiER0My!J|Y&Ldfo<RA%6aLdau<^xi7|i@JAU`x+ot~F(L=GQ<j0<PAiaZ
z1b!@+3HV95+>ZFfld`xD?nQ75F^s>5(LN|Anw_Hi;UI>P*!|~Avhne}j~|b2A;Fso
zi+wJGcs5Zs(p2)ntWYlK6$4+;xr`H#4~aw8kElX2kzhy|b<)soirJ|LU%fcsFY>Jg
zpIyHVDCZ3bXE{r~QRIifXGM4TJ)Zq2Or~)<e#B!tOKj|nx3;hBkdqna&_#r#?fSo*
z%a}e>Yn6{gMn0EOW-?cebU12_V(Rbl_ajPF`=7e%nEeaY{^h*?zLyO(oSp4R+B*4O
z!Y@XPAybs9{%FUrp-7jlalnvv!n(EFv7b-yFkC21X~*OXYR3`72Sd?M#bQjstAX2Y
zchADDWPwQ@X?Hz|*0$EfMrn4Yt*K@g*zRW3)abw*+Fhp+M(4R4{hl80uZA}t5|b$T
zSnTPK^riHX+M!%98SX(aTHDzgZ;r2T?N&Qh`e~<5iILMke;a-su|8(SG}WT=MEgi>
zI0hc_Nqb^_3I?pM-QU)yGteT5<8SNa%cZTe4cjDmL2W$(MuzhzZ5`Kno4UH1+{QlA
z7+Y0cWd_-i$JlMyuO>-bFL6sn`)7YwPDR71Q8@ZD85-(qcO}Bf-IE^c-CfZ8??>_;
zOD=H_|D>sm$NTjScfJGYSoenHAhbF6g|;vu9OKYOI2IHoNA<o{h@%#}4_=;py!Us9
zdw)BsuXNkWaQmK>;m!dkI;0O#nE!tY-x1o0e{*&g_wFsM{d3RnFTRnIB~H-{$x56$
zxuWMV1d^i=Dj}Ua{a?yE$h7j``3l+1*%lmNspdJ18hk<^xo^_p<dc)$Nvy<awc_yB
z2!M7S&Ib$CrQ_s9wMr6h>Z<11DQII>1Fg<8{PPA8S`&Sy76+Tcf43XD`pbLY%HK(e
z!k6!gKH7V@uzMm7XuSFp_#k!!22D00C;ALSegGQ|+x_-1it4d&c`rl$6fWMiGTf1(
zU2*mQDcn)|Is9ApxndOOzyJ5j@ay|ouCR1I^9o##z;XbVj@>K6E9m$sd42)QqvZJ&
zc^-r1Y4SV{9@KeZ?bAKqfZu*{{DS<y#BU!QyM7M~MCg3{A7KGIeLw!#!Bbc&ukOaU
z6#jPU-_EYx*Yjp-VR33M4jeHgF)jIA?LIWA$8bzaH>usp#ieo*Y46-p=4kI+_FN}A
zkbHZ~GvUo20h&4ph66;aVehN{I|ic)pio_(5HjCEp#t<msKK9=Q4wg5pG?jztvwvx
zd?FxtY-toKqb9j;G73HQq10lWD#}On`o8J{81n%g>syq61ZGQLX#q}E!L~ZNd)M3f
zy}J&hJ=ClWuN%N2p^CnFg{b4@sI*y1EFK@j39*CrNxlAlez*l3sX1k_)SUh!NV}pS
z^qu6K?}SnbcthQJYR;#R;HcQAk6b+Gvq!p~f)L}Pze2!#B(@0g>Jh&o`iAKrdB5y^
zJ1@LBhA}YtBF+od?483S>B!pnFI=7+|NXhW14nvy9qC&#1YwGM5%mcEEjj|$)fbQd
zK93E-THgJyKwpNmmcliTdgEu&8^JA*t2kBkU4&Dod<DG5L7LKnqA&ZslJ#E>^`e3E
zbX-|@^JJXnf{ov!8P`|+-QGR?q5!|rfYWc4IHfh^&ENFCQyl)p8?3}c*&OgL2QoRv
z^^N~-@=1Krr#}1{9B!+9KKz+S;F=%)%m9v2Een5U*XEY8ap5fwA!=lwN^Z+{nd$nn
zrM<sBf>J8Z+n=`&B{c>1IXHBOP6MGIWQUvd7Ff_*5-85w${I{T8bkWe_`hEne&=~K
z?BAK@u6jo2Gju%*Z}z1X=ml>-j`0WGV=w%kMrU~EX;>b+4wlD|z<6|qQ*hjCjw;OC
z%BF-jpZd<w5PTubL7qM<BNxP&l6-p7Tll^OKMC@oRMA6MAVw_w?V|6Sn5F7aWGT)|
z?ycP&-u%>GRN0pHBgbW_(1Y^<1NP7lCq0Y|k5A$t;)9|2;cw6RVMu)NZGhUhd!AyN
zul6H)bO^m*%iB12hdPTmIK#*BOC7h<<5}Q%8hjQ@54rF46_grO&;aso#TTq@E6h6+
zXH>SLMU=yj&#|QE`A^Qm$eEr!VAMyF6tAqk%1_ATEjaB2mw6n56T}1YU9yXdGd669
z?5BjFozpZP!G@&*#F$5Bmrispg<Fl1%1>5Int^9yY@%-7&lnHpb0S{qe$c{G>m(}z
z_qsmeb8`=f#QaQzuG6QK3uTCm@a)GT<EBBpI-i?$Fa}~>3X|`SZ>EU{)@Ny=5F~t_
z@o$6~Dsr6f!yFBH_Rz%0{b|U}_>a*<{8wO-?{vsP|1z4uqr6N{J=0<%E&?~-ZP(L8
z1#F-RUc5hT@xN=v?e7}(G7|btR^WV}TBJ3$$JaMP{mQDu>dR)Xi_YW@Gv3(+y_kXq
zmhL#zCbhM;-yH9{u%nZ^)X;aN^#u7><c-(2<3&$y?>cH^$#}(@x*1(@DqgEwlWXJ|
ztGe4-o8xko-bC{>zxZD1WYb8J@$va+BX-gG75eB=d{}-A>H^j2(tOk<_iTm4`eAs`
zE-k!T7>udrJlNTuu;t;>PSib`h4N!u^6_^UehLq5iWI|7^?f=((x<k<&ixd5$k>6l
z6@im!2o}85olW9N|A@d5fm?`p{5^^v`6M4PIMg@-Ka!;TW7wH)3_lX@r#8T3y2z4B
zo9X)V`-qiajwvD|%Rr@T^4kdk)R+W+lB7#aJHHV)7{+u3k32WvXYU_~j$(K#Vp^n+
z;75A}9U$@rJyUfdOyZF50%p=8Hw+fqO*Wh<;A341F~6iE_}S%G0SCup<^x;(Zu#-7
zn_$7)*$=z}Fqww57v^6bn`lquydM#rF~e*~jQouDg6ROdO_xJPrtT5uTztRe6?z=y
z_xF<K`+{Pcli3{1Ookepnwz0P&`Zp=y~ihX&J`s8e9pOC=5uArd~SWCVwQ@DhYOk#
zuFl8mZvaUB`<kJN<rzG$`jBz*JXW6CMYhAGr)xjz&zCWRvhh6Tn;yIBYu6YzWt)ft
zSN2%PwrIBw&e8pbpXD(YlOc{;Ib)D4-JCNi7u{-qAD#C+xH)ICALrqp8XJ&Ng^jr|
z!f+%Kqsg`zFgGgQnl+gXNfd0VeWcp>hUU1M^@0w?L<6E*ItQmVcdT6tHD|#(ouJt>
zAbRFpn|2n&Kjo^)_82EV%#uf=iREP!qdm_JpkAo|S4ga#@St5<ja~QTmGR9T&*=$@
z;U{gLZq_A<b!?A=ok*8q{81j_k!Lr492<omfDlZBeCz`<kJQ7i<O2?AIew}S(E*Zl
z=flo)WpLdDevZEkXWk@T>UbtzC4Qt&<Hz<Y#4!GPjVWb#FWhY3Lc}B8fuEgU>c*9H
z=`ZPi3wC?{+6lK!Op~+@KiVtk0Ff_f{(2Pt5{G<CY=;&0YhyRX=PU)^GDa{Y`S=Cg
zc0P6>0?Up+_HW6@A7B?OSk+n59Wa?Zm$l?$oOMvptG^6v@1fiF^!GT?s;U_}bmaM~
z!c>ZGtK~RRpPu>Qo*5xpmis;L?`KN3Iq8pToh5S&p8XhB!;FLcVcIwNf6(2ClME|y
zIG6CehY;)iN8*4<_bTJo{3qz=BQz5Ae1rzWxoM2$j=;^iU=~d_w6q75>>BQPXiT>`
zJUXfO1<*#>entI?XkDFmpiDnUX$7MGlaI%X-O-b1>{!{@)zq%FBL_X9WjvbU#8`al
zyoJ|Ys7~eS%pT<gfilXGj(|_bGe+Tkn~7HaiIwLxXdh`#V1KvyVsNYW1(U@3Cy~b<
zTV8+%!#Lhk9vNGjV7Kv>!ySZoBm8Z=Ll&NlL7Zcr#LpgcKL)o=OpEkm{AjPB14O={
zG50s{mpJ6J_cG{~u-A-T#!1e*4P-FH{E~i;pPi2*;FEH(pMBJMcNIhbYXe^=tV~bJ
zkMY*UyH<3d?JMoccybu&y-sv`WzNqG{2n<;#@r$|x7y!&uaR~K9&Zx*a9Q@YvO;{}
zb?1FxF6d>9C5yEx0$jo5jaLNXTaqEqH-ygy7pWl`A5k_RD0VzW2gVCbp@ud2hEMOw
zD@R-Fiss3aopbS^@!o!@kTu0{&lG>l0+aFF>=Du{8*$uTV*<IB%EQb&1e12Q7rJfY
zH@IY6XIc|6uD@h4ux;@|yb#@A69-JXKksvM|4fMCTg3sB?mK<%exIAq@j~QhIq{id
z3d{mzgzYedPJSg#bfU#H(P<iC@)@L+Ze*&9Ze;r7bYsBz8=BacOVPx_CIXZ5P5L~O
zRS#n&ZeXx&b#`L5v3eVo^WGY~E0;0mn@0rS(2pb5Z5^we4k*l~+1!SnOv}2aZvFWK
zXWdF;Nq>xJYH#W4XvJ;dctZDl(WmbC&wd2&tl>oX+~ZgL_$-Q$ZObJ%Z2g8TVp1J`
zv>(gdqWS?rKx`8vV%cNpcGUe+_^~}x9+_Ks-juwu?tcn)j<G@v<L`Q!^+O#nHsR-R
zU2GG1NLS-Wdj%aJ@&(Nqx4>WGkWcR2(oT}F9mXzm2Ki*oMm{tAI`_kF=l3uoaIRy1
z=`Z<x0d~QHRej@Q5GK=;Ig(|l<_c*sxy%_ea-TD9GeWbk@~ua%bH<O<H1QB4>5+fQ
zn!Gh9x${L|PZ3_<aXwiLO(*ij`NAb@jM^5=D3}(^j6xQP`L4_<O)FY2ia2_Hf&G0j
z#kkL{!_6_@W@#Vg9CIGyfVht1obsx%vtQAD0Oo1<u^$G_IbVf8iD~m$g6l9Lw#{FO
z118<8eQu8RLJU`VFdlSYCxI~OzTM}Z<8xo)bJzRaoIiz#r{*Mho(+2eI^nr6Irmh+
z<eW5*CJN&kn&_ZwXri$AjL$jf4w#&ql5}G(`V8IZGhe1VY`!0bguX@hSjUOL)N@r%
z&lbl$&#YYE)ruQFIZrpP3jef0#aY?elYn~uoL=+TlaYH_0(yy$RUNVOFDNs%KcNk9
z<Z%!*BvzXIjWjQP(Z?5q+u!cs<$Ml5j>j?l6d~PCSp4(SYw%;bGB5oB_A~Gk61muq
z?0JdvnN8wEvr>3$gCz0=%}W;|OyZD_`d4idCl=6(Pv(;Q5D+vkb%4*#Zzu8_G%x)d
z_ymjT9ROYgKc>gB=ahja?@X(#)QZ>irqGDzF{9Pfb3UWC$TSF<m%=J_Bx>k*_KyfL
zT>SU;(}=gn>7OgcAz#O`zr=WpSSX+~`A_B;>`T#^je_=`Y+jx<m|#4JTY_HBwk5<i
z#5N^F_dUj;`A=|~)7+!<UKAEbYHtdSu>|2`hH*y_ZtqnsrJK3(-zzs~w%zejf0BnU
zGn$*ahx^Wv?-{|`3sWEU!NtxjM+JO?wm%}1RwwOSavYbDsodzFz-CwMCUo|nT2ZA=
zFrB%5p24~=dW>f2sM?H-4GfLpr`i!6Al561b!Lx0HAt6Xm{yfM#N&AM_xRa(%i#{f
zQ*$xGV)&8fTX<*^?mGKM*loN`a0lUi6#lk+OD#OED@49p*zIxti*VZ{<yQeu+G&!=
z7c|aa0e^`@zKd*!6}HvbA(o<9;A=B>8d4vdVYl<aZ@{yUvz)mOlzedB6)aelPKJJ%
zOrAXav3{miR#%xJUKu0pSyfK2$a&A|B~}zj#`!bSN+R1htsgmXFipP@&=BhXaN{}|
z5H9b{KYHgb_5$bu-11D{oeT`u?M@|W`D9-5kXCs1F7V^Tun&|;fJCbWzSe~?S8owS
z%A*z2r&m@~)=Y_Tle{GYRbgG#H8W>c&up0#X>P;Tbp+cQ-BckKojJ8)YGtH+bt2K(
zebKaOW}9K^s*a9TZSn4op04INUztuzbab@gLlmv;)7skBt-Y|btAihBjI`9Qtf^gD
z-GYM&GpbsqS41o0)0-=5t81sPtXff3fph&;EtOR>DktSO=aey1*4)81S3^IL>TgyU
z=P8+UrjS9xR^zA~oD5IUACxWpZXK-W7>R$Qj&Fhj4bEFB6T<$Gr)Ck4b>#2evv+xv
zsXwa3xxnhf>_chqV9@E7dC^rL`;6gdUU_EjXC|CwF&3v&I?}>NtMB%bMTej4Txr55
zz>oTpxV9zf@UeQH#Nf(0;qy-fCg1m~`4j$XKE-no$A~d-bA8L_o{2Cgqma`4k(Tm@
zr}#7eWM&kUXJpAk{0Q9c{0sL|x*^mCn&|u6XmU|$O@G(dSJt$|*P^B4l-#OD=_c{U
z)o9>t@vd}r81<F47IRN~d;?VOCE_g}cb2K%Jxky}i)S9nl-dF{hx2%!Nn6XQz9ywt
z2pQ64aAb;<@o_)j;~T%MDEmD*PX2cB;T*(t?lf9rH_TnPF8xYBKZ8mpSN=ejYO;74
z5T0ZE@C@I@aKsg&4y%VuTcMv=+l+mr=R8gwj3az8*vs$}GR;x(u*b$sz*Y#se!w5)
zVIM)0SI>7gUMKv5)(KPLZ{uwT2-6~-z3#XRU^ZSq!r8xtM82(Hvhj9U^4aT-Rv+E~
zfP(PiK0NC3lKe6q$?qH=-XOvz;3p*V#e8@Nto-s>S@5{71gl%erEoAzNbKK)hn?R+
z;IaHEBcF{0?<v@Aym49Z9tWR|ci6%UTX<YAG93gf;yXW)i5_CVAO1|YQgLA}f&)XK
zOAO=hV>GRO=yG~mB+f4Q(OzM~$QQH@{Jr5bY|dT*FdpLMcuG5laYg&!*kSB6Bp>g<
zZkG!K%HhXy=3WK)SRNA*U$EeGHo#GA(qK6G*cPT$&X}ndfac#w>%eGr?)%U!rcz`b
zc#6s)5;YXOu1jAB+InJ-hF|h1X}w?9Vq7!vN4kLjWKD$U_(m*?7&eRkprCLa68t}x
zXZ__SDzW*j|EdMW_7nBF`Fu&z{N~&V22i$7u00|!L)J6C-=E>^3o)8(z`@V(t1yMF
zYU^0h)Ygr!?b^@s(7psUX7DCUQ%eg@&EqJ(e>vdW60qQ$sb(QyVAkQ2#n&&4;+RYG
zh7EY}ur3O1aP#V~x@>lRW8=a`sxdQy)UB(-_Z?S@bA$y!Zu_z*fZXU8V3RSBF<MY|
zLsnE2sUn*E$^5GOrVitO8E4e{IEya^yJ}xBNvwO)V*Kp!s0``Km`{0RJmQ>Ur`rj4
z5FY178*i3{XV1ej{z{(jK|GNORyQAWVYkQg`x$7FlncjD+AB;L`GUsthYX)#b3P&f
z#zUMk&#?)U>JhM1Th)IlXa7962oabM&YAW+{9CvMivafmZxc+WM=bsrkKdeD-vBlz
z*hd=AtD?0z@890XiUG-Z&O62&lZ_5;tuy|HJ0E79Kxh1?@}fhV2f|xe6v?Oj-(CoB
z*+qZc5=_4Hsd;(#<@bz>4$Z<9$9{N2fB69zYA4{}hOKkT!l{pkY|q-g;muzM$EOzJ
zCS88d=;+X<xAJ-x9$bv8fTd;z!G%KHmMh-$XbAU+w_cUUx0AU0Hcqw}K6RCf`=W}A
z^D+o4O`Q4$63Y*7z7>}m@#TX(bMx|}L-P>ieiZ?qb{L;LESKiov_jf;a9oDZiN?q5
zY*;1cKe4mt#JuzmQXs9GPtDCk0h|O$@<f+8ysIGRNufkZIyM5PWR+}UhGfNlA1NBj
z7@%3+Uxz)jadmocOts}t&ClCfUl!gI%X2@V0ck2(oIzqvHdhq<5*$1VDfPpe{^GTK
z-8#T80%dyY=`qq3hxX0x)^+hnYkO;=wW+Q3R;5u4FO!Yx_DG^5VxS^Q8)kZtQM6}*
z?6gcsI{S*Qj;0p1)oin>w{)1u-_x5zrRZEF|N97zld>ME<lrOg5xGP8C-+)p+8xS!
z3Fha$!Q(AMaDqIbZ}6Y+Y8~%4d7KOkCa!1NO%UbJ!wAZKkt<>6Gaua?MB|pb1a9)q
zkZ_nn+%tO9jI)CGd${ig1NTN0o-o7YyAgix@msK$1csXd)WqREO`Evq^ata?vgLYf
z8cZRM@1GF|OuBn~?s}j5cAtB!jfcGNGvTbC66BZjuMqKNeaAW}K`6^%3?9HH!yJv`
ztb!Q=<4rWN_~Uy^n%wUnjR&lMr5lC8=b+FB^xBSf!o9Q6m?-!>N%x0nVjww>CMNo+
zF!Pa^q!%F`(qsE$dLK4;4fIDkoLfV909r#gGLfJO{M(HCZ)gJl{}}f+nuU(D9VXL(
zXewW7j|}NdfSc)DMiYV8!elx((2aE3=tlLeqlt8Q&W-M^G?7lfaesj(()qtInNEZz
z@>WmtM6+kcW}(-)qW_b6d>g&t!`lgha^BXP<82$KW{xQCMVd5__4rD0=K5D}hf%#K
z)B?NeMb(Ihts(0F^?53<z<V`36EQVVEEy9=lD_$tp4P66^A5+dVWzc`4zpU1R?bsT
z4c9`gb89nnM)Pyd_3B{Z0xCbQtE*{k$C>c<<~X+2jtQ<x!(EOVT-?-^4ycO#f9#vk
z{8llVrc1Y>UtEB`CWK%`H2FhwR8(zDG0>b99l(D-pPB=7unME~1^nzad>Mc{;m2n~
z%0oPK38k0N##;%;z3>-e7>Vz+Y&_~DTn#_sVW@ENCc<vxjX_?&0Y4$Z`w%>AydxGK
z$3Ky;4iPA)lp*itNLdh5?04tLcP8RfhDt^T5zl^i&M^KsmfFuOYefL~lgLB596#DC
z=m3!~=$Yl~2$MMED-yx!07=*=SZIe>ipa-tQb?jvsexU7Ehw~cU}Ak>YH-W%eDDbt
zG42JxCX>b~h7UumdS)?O@!foE8R?m&a%PP=qcZZHr3fn&q}y~k<YW##!b(@(9m?0P
zHZe5i=(mMj31@!OXy`ig%{N&vyMV#``ZILE%y_%`-cH|pOCaw`BA!><Ml7fkJzeem
zVv;EHAA#>ZzUs~XPLyk2S@&}MaM!2TV`T~_+y5;3gU;taS-+ZlU`y!-I*<RXFk&X?
z2g-(fw+;@(-C@FlaGx+?LAWL;&<NTW{GQ>Q1T#<dbT4YA{t=E29&ug!cj$JETaI65
zeC~F5RG>x?+dWpT+3CZ)@XRXDNeFQad08AV>Au~Bvo82;8?G;fiZLi{F%Fg+-_1@j
zZjC?M)ptT~;w?+VJ4xv~V3>}7GM_9I>G<Kaah>rw-i;~J?Q1f!%jW~S`CP*F<2f+-
z%?$Bpdm`UN`Xh2$d@u>0ijOfaFg}=6e5_y7;$!_9AujS1qlxlZMiUKr15He-+i0F>
zz5#+sa6jFwR&O!KSFq9P+&Z;hN~XWZ<qJtNxWj`#*!~KL54oBVz0t-WGg^@rrcUO%
zE8vX%UcKJcYi3JYXbR_snJb=*UdG=`!3_vp0=qW{(+}Y0w#DnqHotBngQ>iljkl?%
z1MEbjKyeeslgn`Eb>%TDH%GNjL0dpGbg2_<z}Cxbn!h@OKs%a-qHJr$MuggYF}T$@
zq+;nlMJu1D*sNmsk?unqWPjoFHRa*h$~D+}fZ2G<;itw~m?Xv_b%V*q+X(>nCE_7V
zF5Vrm+j#wOvo8w?-pAl!<L$Tb(Cu72#<lSV;10?!`=gEbij`mbOMVvv%*H!_u%P^2
z111~quq7YIB*CkL-Nxg)z@Yrj2A_>rj6#$0<0vh7EK3_N21ihS$z$VD2aeRQy;l4(
z7|C0SAL%AIuGUudpJDucgQoR<_S^KdNSt4SAMF(;jC?_BV=_q`vM$6}Xp@9-pMrJ?
zZh++#i;?9*V!7J+twDZk;LrAVDt=Oa)!-8>csn&{?42eJsW+C>v`X2Z*Dq*CTpJ(7
zJt02#kYsIqYFbHTJEzwR)!p)O<Mg9?!E4`P`LXtf+DGqPUcg%WsN(zalso#2yOxJr
zQj>FoCjIyJcC6Y5V_o_8V<YgBb*UO3thMD5vuR467=EN|Jj7^G9Ohhv;LO+S+X%uo
zoABW<?i&V!Y3v&zT>2E(EABe^N-YE97qSzA)Xu5MIM)l8^BP!MdGSpi=#`Cv*1R@v
z<{G!q4#r%iBy#;S&krhztZ@ID_Y`M^31#_m?^nLdNpFq?m(gN~?!Ps5&3}S(rYRey
z#J$@8P75z|W~YUZah^8en*Stcxd~_4m*B&0qf9t+#_ubB)sBxvsak_#u;SX2_p3&7
zN5IE5=Ny_C{8rP%xVM!i2FCkoV!V8UCdQ^iG$91{imB_5YZSc(ReO$5J(TuZ9&h4t
zvaL>35nbMfuejAUL}xZ$*S@|L+o^8I#vCsSw6^10OH@tN=;}AZ7vNSlcl3z1A}xnn
zL$<_+W6pXm(L(5HZ*J;Ywc1Jz2N!$?74X2V?jGPq^4g}Zjh<k7|Jdvb>u<~@8i(h~
zOiw^E3l?i}xA;uKek7n|g8}%(zSi!mdb)Ch2)caXuCQ}kQ={SJNJr47xXu)M9_?@<
z+NKbK6<ve>w3{i@%$Yij{}D~mGW@ssVsNv63bEgkmf~lx6P5#jVWs#{9^!F?N#bYY
zb;2Elw*~$-UZ;hJF6H8#3NRaQJHpU)T@v~J03Vxg2i!sF9)!Q0?j|c;$}jo2*q81B
zgaxJhIQ;E&2ea^9@55sxHD`dIB>5ngjmPzwJyHwb7vXR7Mc@dM?;+w@>rakJHi`3}
z$%kKs2_#?8`tvvNmpEj7+;+e%&esf|G|eaA=2=f6mNSX(C++&^N5Fjevt4m~mih<*
zNU-4T6r<5Km^4^E<YU=PtBOYT$}_k1XO(;)B!}-aEHV`#>(8KjB7xs`UqH?9y{rms
zo{dY@730)LA+%J7<bcGhn-CKIUN0Fo4<v5yQ#RRs-BjZws&JZw^{ZB}P=3DvYQ$@(
zCVXxvojFyQTv(W_hz=Z_mfWNFar;ulRq2`i+~lsEI4?4^<<XuoIKy%9Ys%#w#Q3ga
zH!2#p41_nY1+PljBn9bRn=g6M==f?a;t<CocfFl<@+KP+PGg*?PgAC6&;ul1P<f~G
zr)stgCC*On>F-ZL6Z(m%c_EbR(CJe2sY|yE_58o|D0`q#ApZJIjW_7~H<IH2M0(wc
zmWwWOb%*d=p#FYh`6M~<(b^s{yFmJ*viP_nz7ktLN%uXgi>W>#{Y>)kUf<AWzbE;h
z8_MCw^)yMH36Qn4oa6Yud3Zp01V4@;q`CYjyx7}bYuL)*-NrCb3;zj^;PGJu-sHQR
z;h^F8G)M6NptbsFQ&ATqN?zJb!1)x5NQ(;82<dqo%Ua!wO?>WTc*JkZ+f;y&_hI9~
zvgX>J-wzWa_j0SDMc{r(0%0<o<G&EyZ~5FieC}s#H`01eBEw|-d+czylRh`Ub0@_8
z^8d2k2w=M!g9$eRvjEwj0h78DE`!PQ7xgqTzAvIb5{%Qt3&M@`$1}s7#-DA0=Og5t
z#5d@ViRw}M1BcHjJb&>Un0#hnx$v9bzo&`C*kPI>{DXWUY_Rb8kmoZv*HJ$1UGY50
zM4CwF0+=Ce##}@<<~+)q4<^aa2k8&_$WOUv)5M{W1@uRLt~35e%g?zc5C0-C-SZ#F
zPbb}we;Z9M)T|Z1ZyBC`?6|9^y|D$V9`T5izBQiyP?Q!aS~-U?7Bsatt%`SL>S|4U
zoEj#k`pU35nC(8<_?}eE$8Ys$YWCAzM=nRS^_IOkgK<62S*xvjdyuZ1i3?@SiX7Fz
zM|($L3_#)MpW8A{Ys(>;<NxGtV@r33d4G_u_QzS-6^}b>aRR5K**$K9N7!y$c57YP
znyc=Pk&mg=s)o{tteE>^nMd4*X*JVzGegVNSH#>C_6fX@$R*xUr5259VR1Nf9nat#
zqXv?b(YMgOU8=@da<=7xVM5VA;y>*eN)%NaQw$C*B%af-`C@RZc@rjyV=C!E{OtAj
z3+U6^;m2`^$rBI5kb389<1L3n&8-L{2_DA>8}Bv<S^+=eakvmXj%PL==Ytmb2?-v@
zX&di;3y-s;;1S!#i=aG%@W^B1y<p+dU+{{-$b3r`Yz7|V3W<GY03YKC5sy@b_<lSI
zW4PG)Ttn<idV-iP*9bxk<L{?N9+7VVZYeYJ3SQjDw?7MC6a4LRDMH~=Ue+6NiAVPr
z4IT_d2Vjx3=ppvEV7H$;Uy=wamRFWL$cJBr@h4x<bLU1dkx$646-2^#4~=$7ZZisK
zr$mA&@;w43JHMsKZv^4YFQ#KRzo!C7u;A^?0>E~YhP+>5`Eababs3NJ-lMvDhG7}`
zOi&vqW03Ca<&YBsSd{I#1a}0IgKx%*I<HOLUYvKht6m-`@j!H9GEs9R?=T)jL-;n@
zd8q~X0#@Q|eDEjK-%qV+csxozIrMb$k9fw!t%Sn7y$gF@PJvq<jI38FBc>luEhx_0
z*L73!snmk;eENDCPq1@6DImc`sq0F&Jd>!RK*_!7-#!v~em?X}@-+%maC_0ho>wW&
z!TjhzhD2HAsVhagXQgg0Lei(9bWAdMW*xe&w4kT>s-D*c%qm{{&WQg8gf8FrO#a3p
ze^ar)0OR~r4|g4yMea8A9x7bCWav74f2nL7bg81g^PbFmYJSh}0y3Pf{CaOMbrRE1
ze0mdNC~*#w>RUe){`TOT&ohw%U8JTwQBha*{OKt0Q@59*Vy36AD?&?PHu}0;?2y4$
z`B{Yai8^}@-=Hciz%7|8dk)#jWRo8?j+S;MfZu$+FLWZCT6cxY)CH-JACXLb2ra(v
zDkQv5XDaW>wEVEup$Y5lkbq4BG@PvI-(HCP%{S?fN=tveN&gLeWee#qw9<bHeUa@G
zx^Wlw{K=$`s&un#rI)s|g6c<l>rxBUmebplcB5I`m|A}X{i!tk?Vh5%J+Kw20*LV|
zY${JF1frD6Q47iasszUM&4o0(^W0wP$}^7g03C4=tq7g*4IqY+rRd?Vbh<n;&m^XA
zx#)E+Mo=Ekk*yA1ZsB4R>+lFZTGY{nr?L0xd(U#T3)#Q8m4l0azkxbO0>0&SR}k;5
z9&ZHU3G#sE@ShKNJy@CcHim&l!Yc#MBZ^Z$JNohR&AUnR9m<i9XAwwz*N}mCmAB6#
zXXI`P;%o8vS`1!C5Z?-q?=Hi~vlSWX_G>=Q_YW98=E>!I7xa!1PH5yk9RK@O{~irC
zBP=RN`x*t;sXVRWQ2|bHY%xyOe_oolK=PmAo&jWg<Q~r&Qx1&AHO*PJ8;hVH88_Py
z@7_F0M$jDm`2O}&Y2l+?eTUqGC_!p}PiByIpX|J@o$5c+`*-7JJ1M~))rAI+?V$u`
zII*qa68CtXH{omtB`A-t88_>@1m#h0+>Av2Qkc98bRo=qB)E<y_D;lqtIs`>|3vU}
z??(8<oN4^y#Dma&e{o-7_|)DH<YHUoot+5dVX#mp@=#AV<ljIO>)Cr~hV<D4?!gSw
zjprEZrr`VM7|lYwucnDbZa+=z1?{AX{MvgqYLmhYyZoL`Q|`Mnl{2#ImE%Vf_^NoA
z50IPv65loqMd1T=pp4D@R!DG2)_}HnQ+rRRdqA?;_sTkB9|fPgYfAfKom)aJ@itt{
z)XBT=caQS~r3;Q(4|+_43PYtD9EM2LdFmdwbkVe^3_CV0InZy7wj$4#XfaMF+K;`5
zi(o}7@t<}yKSkBX6a&pvk^lKT246J~>R|WTm00$3*=ji0FV4n~@(>SA+j$U-cDe)b
z<G3Wm@r3j*V6yQx!ND-%Q6|BA7<L=40ggHF6B4{1!NbPuhlBDE&)$#NjQBR*b~u9M
z+XR0bZ<{3_{YAcS!fxYLU_9VBDkSoK9Ue9w@4$<E?D~S&54(-mp9POH+ju+Rkn)q~
zU*f;u!y5!1$8jN%?|FFGcmtMvobg0H-o>%yYe40zb%6mCymP>0<L!e(+6!k)!Q=Y{
z8*e}GIBy6E-jhDO1HhB~Vq4$E`;reYhJ@5Q!vG52=Y4pC79MA8k*^GPTfPGbpr4T7
zMc`rQmxlu+zdW-kc>ihSlYOKR8hg2b!DL$e_0Y7>2e4CEL>^KbezaH60h$87uV}0K
zFL?6ZED3r%3*Kdjz&L0oik<);&j<)HAEZm+XXkeu^1BrN>~Ck`C;43gKEZ;wvkjeb
zKl}*Ea~9-d8LEAn)~-ZPQ=8H_G15Lww7NRyyITnkP#`@9mLpxJ?h&8UMtTnNxY56J
z;BV;ZibvMz3`JJrh!nr&8sRP3c*_K5j+#7LvNOEbAE(sXiDlw{AIvt7C6b~t{+H(-
zbAPEu2kAa!g&FTagYRi0CWL3h^D^GUp5S~B{tTNC7(U9qe@>aWrrr)yi0$ta;(*CD
z=|bby{6_x}+Aj0w>PW-@tJa9(kH#E9IM;Z}%roD?V*5L`WmhMfQKM-_87m6Cn!u+y
zbu-IYGN~2F@vVrC`$9-RvTnK`Y`D9LvVBt7^gk4lBAWb-v|gF)<BP$q+8Im|>ymUn
ze)jm(f^=DToEs?*s!Gkj^I_WQcETNmHwXSU-fb2hhf=}gI)r#KzTXY|hw&4Vd{Rz(
zeE+F17?XS?G%bZ!p<G%QbI|zSV)zW3(<K1LL!287AH-LbKtO}B(_lVG3H<E*-i-*9
zndN7%SGK_|Sg<<Wzuyj%>9H<}$9U7Ks*HZ1+|GYh&#0ZDIY-`yj};*Skc{u=tJJk0
z|6{!NpVto<@1cUm+dn*FA2HJLUm;Z1@9AdFAIF6UdF}L|1*vZnMim^d@U9(D9!0_P
z(fc!fb<WB?ChaIEwVele>G$0X^nYkw3g+E3->3VVoQq{X#uCk&kFC27vrIX0%(Un0
zW!Q>i++`+Q;mDkAzKu-3+e~=2`1gzu{|6>~0!_g;x|)gqf(g%tf5e27*Ntz<H=ctL
zC>y@)Z)U?^X5t6oYvkbnndi%7bk+O?7$N)2;K^sKJT*gkSp4?0O}rbz_p9XPGfyVJ
z83;|Jf{gQP#m=pWKM~=<>2WpVQGvV4(|!eb1A7bNN8#i%QfB(&oB_?M&PMZoHT5Eq
zShgkD9J_&&uOZG0rf8K9*Il(HjAdPd&9grk1|8r3E$lJw{cYAQ@0wg>@Jrzyi%q`k
z)6zdhor7l*8o$^nG59)uiSv%(*YVGED$?SYs(Yqh{L`E#()iDEzMkej+o4`w68j#@
z<EzT$xw)S~lJKXEdjkBJpVw8W7tZHflJI{gjlaZsRtLM`a(`X;)p`|;htFu#BgAL0
zF>o`#JpVRq_$ZH`&$OelhdL}j77Bu|_>t(a{AiSH@p;%FU`x*Xpk6!Vo$2$(LSMBV
zJZz@%16=u|ai;lWFIf3QhzM|bZZ1X>b+w!(+RP@JSjcUsiG|AmO@JJr$%PQ&aIZE(
z6T-!4VllLwCNr7so99(&vzL7C+}a$xo}WhdzI>jIqp~7srpv}%tC;zYPB_#D)}!gt
z=#zW;>d^HIZ7EcUiV~cz7w)B`(Y#$xA_m9S=l;?;JscGpC~g$n*DAm(t~st>a8h2l
zmw@LN9OrTu(~G10(rS%53DW9Te~aFiD|g)z6dIg-5T_?d;1}=xYH6)Ke06A!LUncE
znBAhq8Di_l%1kz|jDsI6Gh+m2N8`JXp{fis<9Zp)RjIvxG{pwIwqR5Jcpp|jf^oo1
zAL!6{Rz?5+qUC|EuBaX32JL*lAysR`{V%ip_u*sn#o*>REW|O1#QT{xUjzI&-w6p{
zA^7ZPvU-fi3_A}$rpX`2y(;`{yiIVcwF^v=;7x<w##?6LF>iwRD!^>K?Fb8!k2(u&
zyfzDuatWRq+u@e-+Yft?e2in`QSX@Km*psUGko$5B5VSFLXzJ~pL};&c$7)-s5=*|
zu6z+Vg7VwotB-puJWdIM*9*Ii$2mVJzjuJo&hPye9`hi0MTl?Xb;2<L;X;yMo?*A~
zeqiBo9u_?6a<lQa!x5C<^L+Vz!ouVFLGZ4F-Nxg7Z%}@(2A?h83l<)xY!~k?^g-fP
z;zv3J$6Rey{~5;Lg@#YMY&GPiTtbwOGzkoLx`&W1_lDSy_%2)W@kdiGg2!)21>yad
zuUz<DW5L7H#l`!P4{uo(yoY>v<1IXUZ+)8&uQLlC_ipU`R$F*jLb>wYPCV<K!)CZ`
zVi}VX<bzqET>30*(4N$<4WD6i&XIyN9)id7)U-=-WpHnhK=@0&oe6(CAN9z`QiQYK
z$_yX8oNK`+Sa3S`0APoaMczHJk4&qQZw~66rjgz`%&4fy`JKZPe82+fxuG1-Ojd^A
z&pn#}&B)la*)s4$vWDvhd8SSXXWjHcxPhLqu_Qu6`wza%bC!p1vbU?4Y?gNv!|n+k
z?Vi~G@;mQtc?R8?<T2j`h4Iv>9C&aTuyD(xrg{9a_wWfnV%G>?et0hqKeE>KN0V`)
zv|qlNT+DNcxUw0MMsw=Wev5nYl0K*;KlpTXAf7szNnBiCR@hT0hXhq50%vJYIK4X5
zQ-n`6D@L4Obw9HayeIkB=0Do{I3{_D-#htL@(0NC-rlT~In@8|FoJd_>x66A=wvTY
z>+V)NmJE+E45Zd5!h`pVvR}Deg=P=mG(!0H5yA&X2tP1FxJ(7v<d2xCB3pQDnDBC>
zz1)O<k#b1+$o<(QHg(N;R+i;mhWA377iG!gnhd{xgzzUu2<KXjlr1l!n<iWOQ_Mu3
zExdk&@U{`c?;0jtOCJ0`b8nY#0X;hUyTaH^vMBQ|Fjp=f<#Nu{<K}ZMSGFD%q<y`N
z;apjIRG?0B*zO6Q1GWOCt;h2!P+w2C-Kxf2j{<1z>@{W0zC96}ZZ8`*nYbR??{k}`
z!(bIY&uU8(v03-8hMy@-!~x5ATKH(S&&{|x{3PdbAO5ur1nKaTozJG>h1GMk7e3bM
zQryD-0e7!g$3NA1*rd;XH!=To=L%nX{AR2W^ZQ@M!L~gSd(~woT)WS7_)R>LcAw?+
zrseN!=hHgagimn(J&pey_uQ?Hf3EYRH2(9Qg0%D|Y2EdB@Zy@4cbhMvi3gbym}B72
z7Lt#>)nVP(v$exRh-ABYe)g!`5g$L?oIfbfH84Y1_^+S|IX_49T#r8jcm6pexKVkw
zJhr?l{v<CvC-)Q|Kin!F>Shk*L7BJE#52lfnj!2n(Zula2u*B?yhL*p@`5<rgD#_q
z2cJ1KvGLJD6MO6ZG_i59gXYQlTow1C2kFN1M={dkdFl$97(N<kBD0+|vFG1UlZBas
z2G*7~-vMNOBH4GA*xLMLglo974K++k)fCPg+rc={JX|nhW2Z8T+q<jU8`m|pH717R
z23YRg?d#VZ1#{EUFt1-TjFdRPJWMFd%O_Swfeja)nXB~ZfcNJlodIPyECa;PNZ+^b
z+}Y9Hx&a?2#Z`1v8_ss)3kc0OH#V=n86Q_`&Ac0LHweg|E)NAx_o0MoKJJNdcX!#o
z3IA@Z_;Q{@e?hl(=?V0`zrarj-A>U(_)j~!vLcSBHlfQaQu{5i3119$j%h-iBS;&O
zhQ06cEXDxtFIC`2d5Fh-kJ(7nPIo)}I5!Ci-X&nN@eToxVZ`GqM)1CabZxx-2n)jd
zC!c&rEIbTjE?%QgK7t3~-Qbh22xFbdN4Z5lu1{_GDzf0QtnB=bxA0(f@fP^-mS@4c
z!iP7-!ox7^;_=<SEg#40p!_C%<u}X1<2I7ym-D!dH;@Hyl25*R3s3gH*k0Ovc$_za
z<Xi2-TV~;58gb?OiZ8zrxP$O`SKY3UHVcpE3M9Y(26^oKa{f}!G~gkzO^|r!z{a}`
zcoF!sJ@dV@;JpmHjW-B9mZ^~7{SF>B-aVFl_WtmP5Z}g&pfd*HebATR`z<_sf0+02
zY&@Q=55g-3lP%v5EIh8!B)@$3Z{uwOUQm5(^x-{W;o1AcDPY@pJF>|4NniQBVBt-$
z<a+^NHr|0Oc)U+$=l76>caDYkB_Ccf3L>cd{Ad4<Sa?`Iy5;vE?6!QdEO`F{K3l#b
z%nLGJvAm@|{^FC5x)p=ud&`&K@fO}B3$K>#&)Tp55)-nBvXf%?(a!!rB45yceXD8D
znhR%_IT=_ac)JWA3`OL-PaN<OG5!sHcDYPJKDHyAa!fUR9EV;6pB3GCX%yD5@L+l}
z9<V&8Rn4r@JM}s4*UuE4*CU@H?dL-PNYB;fc=nUrYX5Be_1G)zWgeiwZf<CBX#SCn
zC-n}zE(b|v*FJNL{`l}Rae;?3quBpU#X>wHdVKirH+cigBk=u7ZuRxQc*oa%{`%#o
zd*%D=|9g8|-hH<{+`fDri(K}U)xP{jbzwgO?-+ih1^k!BlRukGT(7q<48-x=<*8Q?
zP6S??=?@w%o%=M)u<1Nuc(SE)XatN1!nw{OWy?<lVbwYCEX{%Ewj6l2=fLyG2t3SB
zHahw}ZO(iiW$LcSgl|!Sx;^4~{5AHt$C~`J{qVf)87Fw@u`PVZEKa!XH8%guv{}9w
zYmRagpRve49cxk&+W^1+6jd%A#_v5nXWTlyLMNVvf0n~DBqSYwjC&%R*gW6MXJ?WQ
zKiRo7%^h~0N^_5O7N^Pc0jD(0eX9CiyN7qWvo$UL8O|AL@}2E$G4XYIOmIG&7JiQN
zdYb!O=dLvO`Odzy_>-K$H1}lZ1e3nh$IsI0r_jBdE8$;H3omf$Rq5#Qfc3e^7tXae
zN#gUF(RRz(ehDA%lV?z~oA`xF@3j}dP<>m#c6X-X7doHt#TQ*0I=w=@r;dksj(ww1
z>6I|K7t1{&>L=y%Gj(5N3%|_pr}1I$dsv)+@IagZdEQfex#r_t;NwV^hrM%-Sa~RH
z_Rl<Y3gwT75ao}}1m%wnr8ItQ3Z(H14&H?X`s1NL&>xK;&0o^RL%s5sbj4rJ!TbI3
z&@TKD<b&tk=g`d0{;iDt497;~AWb}faW8`J9%^XfA&z%o`0im7O*}8(OB02%kLJmU
zB<J7dG&#2Zqg7BYn`m7dZ;W?!b#%!|bomAu&%H;ZZ5^vxo6{Ne+3y*x?b!Ek<?XIj
zJ^Xrxcji1=-LWp-wX&^ay^d&wOz&xL$r4oA(y_LwwLK$BWm~*`RbsW}Z|_Uv5W6oQ
zR%+3%ruJ1PdqKzF)3WEq^Nv<~e$mQ~o<w8E%0>lg`Dd1cdptd(9K4W>a`1xE%fa$b
zD+kX%y%xR0^U<{2d;E5lTHNXRBfGztGjm!Iz~!&|AfAle2Qj6WLm)?5i3D-@$|i^<
zt&{>8tS%6A_TSes6oh{7#`kHNN9m&(<v5JCpDYl*Le^Ckkd(imvofX?c6Khiz_W6t
z7kXAUyWq1kS%n{b&%u4Sq?&6$8KgDr9B(gRz|4)PbKEScRD|UiYp20a2*a<Ub}-Q{
z?~?RBmI;JmmTk^SV6ypQ2;*8si1P-C-*C3~?lxfTkHDYn4$4D3&Vkc>>Gs2qYgr+|
zn+!f1ZyWH+!9+Y}NAM=YZp(K7Zoz=nwLcBJ%{K^lP(FSFe>>d)D<70!(mjZ|(Z-9x
z5tI*}S+VgBSowg}#Ur+j*AGWfKK{X%?)EI{e$AI|A?9EyKQsw9-5MX>U=}={jkohr
zVd2^DoF4Vz#o!JqmmmA^mRflBJ14%=NGq2tc=f*avdO};-#MM)!#j`#Z;TJ`J_`@a
zDYyJ?LVR1k3d9S_FYlGw<+tC$v)?&=!iUFqFhO`9_u(D3@a%U^_oBg4KENp24-22&
zgxH=*+hMWgi(swB_n_==_B*GgKD?K*;4Sju)mV7;J12hY-Inig7Q8|qUW0{azjNAv
z_%<H#gYruqKX!gsTX++YXGBxuRi#h9NEW=Q@VD_cS$OAIcrW|#s<Ytz&WE?n!aLW(
zyTgY!KMUT+e0V!7Jo}x~L%#A`mId!$edV{$!kc8t_d6dR-(dyS$BRC^0~X$73-2F@
zXT8JP3_P1y_oOeIbSt#eAz#ottRKT);*j+mPA(Qn*e?tpx}Bmj@Vz8~@DVY728-Pe
z4kI6{5zc-@S;)t+ek|e(7MxBYo}oI8%y=ABd>sF$Rn;EVJFM!8-1S`fzk_v7T1lug
z{O__Jly_Y(NtSmu@;*V#%=c3)bNvqN6<U|xIe@}<`Zm!aDpNAU-(T`GFE+W#QJR~&
z6P~J+#Kz8eYm3b|oc(?JPJ;Vo{E@isa^EE!gI<#fc6>|k$ZhloaXfYL%{_w%yzZet
zNbL!yz3+&t7aEjrfD9ldtMFL5Ne-yc?7B&$3uludV#ciDWSC=kf@Cns2O63017uXx
z?9^XkQ;@!r^zb6*4I>N3#7zAm^z|s{`&V8l*FdGtCo$+U7RT01ym9KgNQ}ca!u{h<
znDkkm)JJlQHE3%La%<xIfZfJE0Veg4{KUlPoHsWAG-rtk*La2Q`zv}APtK&XeoC-`
zR>A-f>w^3LFDjR={}LSDmG6dY{4<>YYr-{tvHHdZy)<5ldq!R3l{%-G{4j04-{2i!
zlH{Lvph=RS|JF{`#!Il_SC<xkiZkB0C4I_22H;%taUYvyPdC@Rqp>iz!}%R8wQr4Z
z>gJ>SJYPKKli%k`!@+|0m~b#Rb1vq-Ev!x+_Jvsvc@R$dV?S2;%l<10P5C2n<&OuS
z2>7$=2SM}S&T!22kI+Q(e~BhQLMSKhla|p$Vb7<DHN3koYMp)N#%B#xM{wMBcSU^+
zQKj!gkL7_p7KYw>l$}?cxn{J+*7lVh-aevl&(Xj4W~HXlY;mllf>d|dqI$|Z+#Gs)
zfR<d|cA=fJ>+44LbaAAm60m*fMhV(Ovr-P)g0p29aevKCXqauaVHI$A!W`p{lO=AB
z`%TBK8-w2=;)+V>0rXj(_Y^{NSM)ttXqTCx+W3nhGsqfv*nBa#IYtSw-;(%V+~#Y5
zAIBmg;p2UAd!4=+0x)bMeoT`;_Vpj&XX9;xdjft!g0~YMHs0M99`h!6SHo`O?SMN-
zK0fo?c=uX(luPjZXQU4xjAOl!$mc&J{Q&Uze9!!{90gB}Yj9I$QUt<st`HJD%3#a)
zge4y_1n(EH+xd;bF+sp!3f|9PxAFKrFNRS*j`f0f59~G`->(Lh-!|~sc!w-J;tJju
z5Z}hz4o6V={XP6`yd%Jq^5fhico+KQJAimW<u}PEAHQ2A`Q;oZcms%!KesO(frH^f
z<Rkq6{<eH&z!Ui}t+{yp=!3+oWF!#RESzhF7{=dh!zX>X0`8!6FM+?E?kp=^dmk##
zhc^dqse7g^`QVvX8*h<SF7`gue}K>42Ur9=o0tdEugM3qLb>o=Q1Auq1DtK-Gi=VE
zvf%OiZ^V<}*I`*MiNRm;F%AB9K3b5E282(<FJk!Ehj@k-e=c#~jAczoY4<Fr{}1Uy
B;}HM=

literal 0
HcmV?d00001

diff --git a/app/src/main/cpp/libcxx/x86_64.a b/app/src/main/cpp/libcxx/x86_64.a
new file mode 100644
index 0000000000000000000000000000000000000000..443a46c7e9e751193a7f92b802f1c2587511f15f
GIT binary patch
literal 1911100
zcmeFa4Rl<`btVW<v;>*7n~V~TY{{{bFbTD`Wi<YXwj75b&{V?!DVU%XZye>N(ft}|
zs?pu**FY0CIf<9D7d=>dz3c2bbIxY7XU=AJ=j>*4GCxPm&K_q)CRP|FvB~kov9lh>
z&ff?@;!r<{X-6jayH)SM-+NW>51=>TVUykO)%~ekx9Z-yb*t)!-d}8$mOk+2_de|W
zGidwCzuW(P_~Gn$Zg6m%3jN%h`}*!J_wD)f+U`eE277Pb?DP7(>F&LKfuFbk^S(D3
zpCA3DzBkEy9zEOlrtSLt_wVj|lh@~ee!1^W?$5uO>U$G?E`5E+KX>2t)xKDtx2^Zx
zeJ6hY*I((o`~Mu+{rJdWVDzCr$LA+r=o`4xKc6Z04g9O6e|(>Rc)f36_p>X5T^-of
zfn6Q=N23G#FU<9Q&wOtGyT1Ll&sz@8^*KHd{C3}4c0ao^*wuku9oW@@T^-offn6Qg
z)q!0d*wuku9oW@@T^;!Uu@3x`f4JF~^yh&G-{1E={b?NTdtf_1zx>;M576gVj;8au
z^3}cvM4#&)?t4J=`O|ZK4|siEeW33FiO<`9>{t6@eU3le_qHgXpPub|+wNyq1_|iE
zgAf0D-#?1ar{CZA;GO>YlexYJ6Z$;#=3no7=&k3h&pX%q9x^_Mf2Qvt`n>l*-$O_K
zyziljCF@i8YTrX%pC`ZG_Yi%aez*0hkM}*~_c{0ezK2AgZeQO+zw|3|pMP_s?;-m9
z`_t)u{=<j+9!m1_w^Mx&-GQHXeE+}dOW>pY^vU`5P*$0pJ~lZwr%W81R!&Zw$j{GB
zOy<WFMQgO$)2B|(EBIbhHEp_7%ID|sSv@_d%#SLkmA)Vh*{q^e>+M#9;Q^ZL5oNMg
z)U;}8qP95Ks8vgA`Cjz13)wu8$SU(=3J4M4Xtk}jitR>AX}5~iwl<Ad`Rr)9TB)cl
zwO&${_F7ZTF9h>5t|$utR@+Lm*lJhX)kgi;k=5*xLHwEa;cu?w<}jZ}(UE4c+L{J;
z3;F!~5e0w2Zy@!dBP0z?1>r`Wi55Rgjpb%dZL6MAUXYV=PT|!l)^w~uDXf;eQgbD=
zXFkt`PI4boo&fp48hL3*rvnYaCnXKx=<hHM>DYxy9Hy=zhLpEULpZ%;G^ALBhTxNu
zhH&(En1&SX8bTbVt|5k$w@X7fy<{|GX$cyFPf8lX(cfVjvSil~;xKg$F{Hd*8p7!%
zqam6G4Z$ZR4dLkTFb&b{8bTbVt|5k$w@X7fy<{|`-G+wXlahvT^mmwswCx%~9Hy=z
zhLpEULpZ%;G^AREhTxNuhH&(En1)pC8bTbVt|5k$w@X7fy<{}x%o%71J}GGkM}LQD
z$Qiqa5QnL2h#}?e(hyEB84an`pdt9Aq#+#r9i|~QyM_>lscVQK<?YfCPA?e^Szd;Q
z;FFSuaP)VWhAi7Pgg8uHLkuZzmxge9$!N&gv(ONHQqmBP{tnZSvvv(34pY|<L(1Ew
zA)H<^8nU(q4Z$ZR4dLkTFb!F=YY1_ex`r51-YyN{^peq#N(CB%Pf8lX(cfVjQn70Y
zahSS>7*gIY4dL{X(U5W(8iG$s8p6@vVH#4lYY1_ex`r51-YyN{^peq##YJccJ}GGk
zM?bqTh*n5pZC8GE)u^Xj8)4CwR<B1L3$zA`Gkk#-^5=g=>*29iYB^!w_MVw<XNMMw
zWu;hOQ%XgxJ<?e!w)3mBip$=qXPauPx~$gQ#aec>vQjS>`43H5&H946u}%$gl=M6V
zMjh<*Q*L}<@AOkhL<of~AGkC<G^{A4vu72g3@lemO1;spR@Rh8UCqxuHN)iLoA=-i
zTEwJK3ba;TC^ee~;pIlXimU|*&_SeFI6yndb6{}Q=r!dz4R%RXksL5x#q*&dhlCc2
znyT=ZG)_h!sY@t5l1}m1B%2aR-xi5XFSsR#N6;dTy4G&3l-kNdvDK=oEu~mnY_zKF
zrDZ(P)cmPhVABjE<%R%PRX+rC)b^m{gMTR)J(Q-bg2Tp|9|8gXK=j$6X02FKmm0OQ
z+R}!UY_J}>iw}h>J{+$2NVwvo;fjxiD}E$g@$qoQb76`PE7`%|^2igyAXr59)ynV?
zzU0r$l>+rZ2gqU&XX8?KkRZ*RCZwR9k%9-Fa&-|IUj`a!KF3Cg&t(Ch<L!o0S}L|Q
za5O)tR05fD6)uM<ycni%g~q2L#+OoQw3guk1cGDCI9_WM+tvD_VpK?3QqL;d5<DOD
zc2n@vm}L?2QL|V})mCaSQ>FPKQ8u8v{^@ZEPd_Ox7ejLCs-#C#1lxe@cyC)+;-3XK
zaCCcHtFfxK(1hjuP(GlEhK+1Wr*Z^yG(6@(Z&9ry9kZr1TWYDQInpQt=#z>Fhz)rV
zBUMbAkgJ`_z0DlVX#92xP||H_rvUoNwo@!Zu6FY1j=}9@SduYi65}+yt5w}11P_S@
z7+k<+qXY9ZEbuLcMwQ3ieL`s$7mziLK@)k;PqfO_da<>pe3(BDrY}G@rp!0d@z4Qd
zV=E`i9MFYiZmhJ_YSbIqA#F`-tIJBM)+jwQTyJ!YIi_EFx))pyhN+GDt<uh)nmGxR
zoE>C8n+@clPtRwOOFpQKmsgNVjzMesEV}(D`#wEe%jWT+Oz=SpQP7`2tLe#iHd|>m
zmJJqyU3CjVTP>C`UyoJss-{4Ez$44Gjc861I6ICGRAy=O%4)GyCH2k@+UC~56YD^5
znmvXGA7PVZ3iD;NEA{HLE2=_Lq+I^d<(0NdD@%c`=*iP4+(xcPWkrGjh#75Z*S3=g
z(>S#nUdgD0_DL$>(5NnXhz{WfrM=Wb`zz{MgbkQPJX(wSMafBOYA8aRO=Sf@m?tb^
zi$-}tP%evEEEQyPW^r+#ts)RqR)t)nB!!I3k}NpoGYpw!gZ0cTX2s5Y5Yna@J<?HL
zm=p@wUfQS_LVYsGv(WQOwO&SL*{D^`&l!=zP~gVaocx?1vgW87-yB5SVU%hKl*0j=
zducGU<Qs!@=6$Pfwg75fMBJR>6nMr}BDnFKe8VT;+jtbl_Hi8%*O)wP4E-HeLZC!g
z7<Hidn{*|>c}rb}+aJ9i<m1#=i?wRG*j5o{LVPn+^P>rL?I}WsXxI&h09D}d;lRdL
z>Wr4aSlIi8DPL-^U~^yxqyAxN7Y3Q;8lZJ8mF;1W5h7WtzDJGhrO`=bF_0}%OK59~
z*@uTm)uHSLAah7UP}Wu!v{I|uG%1HcKmlgjGzh~~tV4dw*mGwvf@pz!JB(<ZViU4Q
zzmf-n&u(;6nO>z^1_{%oTLw`{$Cxo0s<dt(u^uwMQZE%(7MI$v>Ls;FJ}c=j-sF1U
zXu4`=ht0xDv)wX`0)U(^U|UYj%<Cd`y(`Y!-;LD~1X9Vh(3#N95?jgXdC3_(Qd((Y
zW2TF9TIA^guyNS?PG4$*()I#oM_MYpo<>LE3^IQK1&<hyO@@0a&lSm4Ys)iny+Hff
zMAgHj)x5ntS~z`dDx8>#mL05A(O1|EC_7%RBCLW{qcwB*VQqC19RS--+e>WB&km}s
z7WTuI;HSW?%VKk_1=nD@qLB>>a$bheNi@uh(YDYOMa9|>!tdlg_i{y%|7r`940xH#
z<VWUUG8!e?lRHi3PUL9|FuH2!S0U!u+H1}m(nq$mqKVDM#597N(<N}7%~D|0*hP%3
z%+8wNL4MMTG*3^}u_!(h9IdwRwv{Bo{BS38rztpx?YH^-6Z1J`ZU%dB1MAi+PY=D}
zPL^&ydetT*0f!14DVA4@*m%w78Ywr)Sh3ku>t!nviZ<a*r`E})DAmgJhqV?<0?-t!
zzarv-(08ZUDw}<1`ZQ!a3WsL}Jkt{T2-`9~KcV1nI7yUOO-@*x!RVLsBf*HG=_Bf*
z(5CstI!0i4yY(VmwVBd#AkWcAp&!Ao)T$p<;dNAs2<^j&R;>kqJR|DwLC7g3mUV1i
zkzkhBgK}sbqvJ|Tqcu)z#4{W<$#I07cE<<`VJ0+E2J@FiC(?&pthT#GALx&8933sI
z2y;XoqqE#0#Clli8Dxkwi=}FNE!h@;$J%VbU-OW#|6vpHYBdgmtV+q&gvp8za-Ovb
z(GP-^;)r3dnG2T~S_riXZy{Nvv?!Ze?@iQR1<RafcWt;>`e4$idulAg37DsHCzB;s
zwOYkBxSJhJZR(5dCDRV*&bN;vlB}a;In3Kb&P?~(7IIiXK%$oNQMJ|3M@m7jPFA>N
z0-fZQj#_*sIUWRRDYg$uHh+9(5>$@Z%!F2*cxGp`R8xzsJ4iF4=`O|5wPvk~oU;`=
zPHCEqU60#Ej*I^UkU1{7=8Cq&?eG&qS2!u6*+E7X5$t*!QzwxJ9)&DTI_<MvR#^vK
zL<a<fd*$gdU1M>EXw!Uu*Q$qda5r=D;5QNXaEO%Ul^XJFM*`<1J=~zr9yenjlN8#O
zSp4<CVg*nTOh;fuA0>mFdI>DSQG5vm!u1{r9OQCg4o_ivmd_oW^3aPAQJ&(0)~I1Y
z)G=N4Xv2W>;Ck`mi4o=V4oij81Qy#WKV`a96mt{AiF<j1^)40b$ht0JmP|PS#@swy
zWur}>cQ#BBjpy&tXcwGBwj^V3VvNCTxEi82iZQ1O*YLd>MOseyw6*10wf>AlsX);a
zeTXR>)B155z3SMDVJUy`grbMds3EByL^K6s^(B_vl}$msm|p2)n;Fb;Q}q<F??P{H
zjYwDc@EN8JLlCg)fY>tDLeo+cTGTQ$Mc{V!O2Nb5n6e_>q0xZ=%Qx{7Y0L(r37tzP
zs;cJD3Qr1QdmY(TEK1TU6|-L<yBu;r-E87G)5s>Lr^VD~t<k`aR(CbS))vt$z6eXp
zMOZDeFO4XxRkh>2J|ak<>fw6G>TPC+4mEa$=yxFQa6s%*^3;$JxG~*9ptXwi0_caM
zS^Wn65XdpcQa@HG((b?=muoB)m_rbnd&R|iT=eKL6-`09AeIUdH%?OC;2cK-x0Mby
zJ0X7)Nu1k>9zDW4hY#zjJrfl4AA25O9l%~$q*fkZ0%FI$&E+Z<fv`W!As4d9qx4b(
zS73ICz9;4TV1U!JjFN0=^em2*B^@P*nXyY=ltV%ZbXTaozADz^6fMVWTd2K;RTwAB
zF>yi;TD#a@acW9Tq!e4zZG8&ZDRPDE@1|`<FNrB7nP`gM)@VDl^sF$fWzCM&kadd*
zC&<)k!xc|uhCKlJ*lPzp7M9HzD9MFoYp^xpIt>iadVRhewgNd?S7taYk0b1=5$6ic
z*lIM|3hRZ@P(aTZ3e$Vwu4&jh(fSU<LwcmNiu!(nNNCg=_6uOS+42&@qM^<M{f<}_
zNY!kih$zM_6>aI&vGgT`=Q6ldM2uI@qOke8fuSDi-ODR2{2fv#WeID}gl2kqc6n?h
zpD$59!)n;n0;X`I3+iIE9!)00$SC2E^7ZGlbtBopxm+1?`p}EYO!N%P6<vg2q>RB^
zZLP6jeFH|T0=pG{1vooKc23`r!=kCSgCu-~6)paB$7Q$p)-R1buh6MSz22zo?j0XH
zlEc<YEc#Fmpr%raE*)19*qeJ0^{R_7>yf6PWd#S2l-O+;WIKh+nqDw`^)V>O?*SED
zJr4k*I{u?R9U4+uX|J?YzWM-nqpjlLhP4qHOXv%IWElz6#YHtA9P+25To`SGs$c-g
z4%vA{$`l0zTq%5kGIhWU#OWw2Ze(Y1(dx23dNh#Zxw63gQk5K4=K{V+8a%(wjw45R
z#Bd`QJgR%p9~v=%-P^K4<H`;bE;Efe?~}(2`|5Rrj~8>}4uoz7W8){ovs`>eh3TQa
zh@mSy!h-st!6-0F3LvptFK}q{kQm=$7@8wQ+tjnjQ^b;6FzgubiqoseJLV}!z3Ld;
z!z>KK-enaX#?CnbXGfaY%Uab`&KlJsa7+lxwhg_IZ(G^yAnp0%LX)q6bceQ6iq-jS
zh$4>&b{vUz++jTh)zm#<3t%MT8wE@dzDGo~C#P2{#H2i6M0UW}f|`ep`6o#D!UlIc
zml4f+8Bu?tPH4ly@bx{dj*I*Z7Rl)qQZTy~1|cz<+F4s$d~A%ZtPpRn4v9fvPwJTa
z;s6ke2n*(jl-*oy@GUCgJTOm4S?}ve4^6?qG!6iEB+-#dv08)EsAsJsd~08o@m`RD
zuVza|q75r7+!@M&>tP^RcY2DGshTNK=(dNfzsmPu5sn1C5TbFwgdi`FW)<uo%66yt
z_@FYXuF`T&pc7!?7_BZZtnkRJGDdryupmy5{?h;xbPPrc5VCqOc9w0Xk}VE3KZ}jq
zI2T8{CY?sBESN=@%#Sw1l%`1JVinOX1a?phl68LW_^M6Xry%&MEOA{af?N%gQOVj1
zbFfT=dPZmP>0)N-5!xFg+EQ$mK0>Z-Wtr9zArCnX9AR6$Nq&;$*;ZNk^23<6(u4q$
zaa@dvV?%Km09Kf)NbrXT&qCL-IysE60HLB0EiSI?sJ2!wDIFYph&f%k+7Mmr={4?4
zSbon@Us9=Z3ynstSZgj7B>{#J-jggkTB)8@%aVnMaXyx0(Q%xD!}pI#s#8s^$PSjn
zjgoB9(N-0Enk9M84r-+;#_VbZ$3)1nJ&uFxI&^TLWceJGXGa7{0vzE0Y=5nUy&Kb>
zsWv;ZrH|ksn>I4BC3(rMU~6OxhyBXdHk&P$&#Y+eN>#1N>R67X83q6wn(0WvFd$=m
z5R$C+nA)gdn2{{a{Hzeg7aI*45GAn>V|S`_Q3M3!w0LZR9T+BAdI+l^a(IUuE3y?E
z#Zk0%*<NS*vb0&A9K!^CS&2?&BcFt8Dmt;jH0#1C4D}uCL5Iul?a$|hZm<}G$SoFP
zusbKi!Oli@)SRQ>BmfLl!PN?K<YZ9=Yql&Fp&KZRXuP?y5PE7Li(GEzAd3xKau(o~
zkvW+w1)oPJi;_0J0H^v)1NT$V33_H%I6_ac5}6P7pF<OBHfZvuj8yPtI=8$)$t`rm
zUqW<_P<`NU3Orp|w&7$c#Z`F03E>;lC;*ZacVpVZ%5pO)Y@-_HxrrjfHr#~tG^aIJ
z+B6$2<%7@fkZsr_+Dbjq>Vm(dcpIh4LUuC=2@e6D;AIP0p#c%*y9t>T9&%0y89!F)
zR8qW+E>g!5L^))oMoWl`bgK4<g1>=&oh-`HX2Sg8hzH^?8RmS<sc$@7w$@__8$V{^
z(l&gINXkZUBteVE=FiKxb0#TEFm{&gN`j^U7u~2W%t%Ft3d^e1=t_dfa!s;Q6gNv~
z^nm!1wFcvKzC5e3AP;3&pX=}?7@vs&OafcM>YYa*eKjxe_2nq&Yh?Zu0%s*sG?L&`
zIP=R&v7%2wPp=LtbzJS@KUofiE;brIDNT$k(HvK<a<W!mO7O5Qlx;~q4%~=^U{k1L
zYy|d=(Mk<xD2RM7Ddy-_lH<e|jC2yp%JE?yW)CK?9*d*u5+z_xDD!koo0L?s{)CL9
zWuFm;Sf_}T|9B8r*+Joyp#8BIpjyYcjQg4BIw!SVEt%Q&(+i#l2V!NH*mgCyaZcd;
z5#`irf&b+K^`=71Yk^`O_F$eb&(v3zaid%bdtR4u&yH0g&70KrRj3_UA=((?-x}?m
zW<J==hHs7PPFF|}5ejULGds<^AZ`}Od~K(h7aS8A$o%q7Gk-QlCqBE=%&)~@er>0j
z55CJRc=)XBH1olCs|7P(-f8B8?|KVnesQOn7oD#kINZ#wMqz(EAumWGBiikWd9%w9
zof5>Hr5rPcNf-|gg(@+&m}i=vL(PR4;It=Ekt39)SEWmVMPYL(8Qak%!QL2-d~USV
zd@a}=l+((QCKl%snONe~ecUvdjL2}7bFr*7klLFJKCI=jH6PKEk5qe(vh|*1WF`}C
zm1C-{)@qB1Ff~f+wTs?MtHHjD9H$(;_Y$!b{@_?i5^+QUg+$_r!8GLJ8^JiF<A?$@
zJn2O~Vkd>}r2it0u0{ehVdIEW=;Cq}GL9I`lQWK(K-bU_CZrd&(2>O8>T-OsB8id&
zB195}m<3@zDV>G{f&*@bO&4+_2y@ADBj;fVxe<hUWVsOpTx8J*LLahd1VIQ{G=gw|
zEE>VYTo#RBiY$vpFj<vFBfR`i8d1QEA%Ssq81AK{YZ=^EM%giE68Sn(6(1#^uqo*i
z3K%1&jonMqn{JnY0GZ3#^hp~G#y?`_(FQH`#BvHHNr=6|$&>z0j~tQwAl7kvmVQdc
z3VGoAwIqck#4YwP<d`v*u$SuCxEEV^1~&16cqs1T^QF783Dr{CF_x?)#}~VnlCH6B
z8M#BM?zot(gI%pc-4bIE)kugTR$hEywE}x^Ph8C#m0<2Di6uf_yf-@u<;8m=kD3?n
zjm@4H-x0W*l449DFW#GXlTczQg5Go@=f!)Yi=G$njW23mydSn`dGX%ZBId;hAVV@_
zLV9Y;i|+)x0FsIyIWOL?x^S{f`DA!A^WqZ{9^A{YdGX%0q@1w`dGX%JBId<=Ba<}W
zy~$MG=pyFDdn42H;yaP@;=NHu%!~I%M*JZ!p7=|oYx$i(;Xk{O?6YQGd_w&q;k<Zn
z=_Z>O?@c3GUc5K17<uvD2+h3sgjx-^h)2zf_hv9+Uc5IlTVA{%t|+VYW?p<k^0V^d
z1q|v@93xBByS~1mi;gkt515+CQSgggm=pqMB~mm5a}p^W!kM2D9uF3%d>BBEE76{C
zNv@=)?Q&d+=D2cP$y$9Wo}BAh;TBB1`$nX^cyClZk3C9Wd=Nh8Y8LNLq4VMe1R|_v
z1$PkNym)gwh&$rM&WraJNz!TL-c(Y_i}xnAeH9Wc7zQTjwRf8N;AP4PdGR}4A%Wiz
z*cxYcnt4IoERgxyPBSl991diDd8e5dEJ+74e|D#t7c7JaGQYOd%nO#^1DUVvH1mQ*
z|3K!;JI%Zx)gX}h#hqq8W?p<0_QU7JdsB&!7axG=lpwAvHNW6_@uEq5C{&5D<((Iw
zm_r?q7td)VQ4uSVJrNn((Ivs2nHMkco}?5YN?yFTe(QPhiHOXW7oP||GcP^~`A5o&
z_mNqIym)U+EC(uVUc3*gr1Ihe(I=1>?~Ol+IATNJPwzt^kvL*74Y@dCFb?TBq5w_Q
zym)Wv>0!x}{);&Jz$M@+Y#dPvU0kk0#u0;ga>fyZSJb3r7Bw&4yCI|J#RuVw6-f-1
zr<r&kA(AM>oJ5#6bY8r#AO&GADQy8a!2u^Dv@Vp5oTDN{BM7+2R!R{1kVPX1Ldc>K
zgac&J2qxyTXarMaSu}#lsw|qYdGWs8!Tb1|5VMkC-DG+3a;{}CA~P>u((4sqi;@@b
zEkiwV9fNbsy!b%$QG7yc@w-~b8I(T9F_TqccZ|^ej?;8&4BW&gaJ~|(YT%-8RP+M>
zEh<{1I_X@W^!J~lA~&2DCY69|UTnEf;bcAxw^}}dECO!Nlh=_xKxcrZ)FM%mNW#_3
zmIxxS$59*JO5{k1K)n2@ar4A=2rlTPv)*1V)nD{9cp6MoB|xju=@2k>I8=h9lOJg`
zRdz_SoIggFAo~ue(#XQF=GT3D+f{V-xlXl_j6lL*ORf&OmlWI#Fk`~2DWwnzhDRwJ
z%%+OYr<TGb9l8jXj#N6M6hpWgtARUa1liA0sKgsiq|g}FIuUuxTQOWL$1cXAOS5p}
znbtNBJxoM6bf-KWilQtx%E^dZ-h4`lUD{SkVWSI!*<RS>>TBjUOCIVI+=Jp-ZYdeW
z%4?RQ5GRj3oUbMxx1#!J;!z_i=2-HN;hP!xsZRw=Wn!Qg7_=Ce^`<y2+Q%A)gdTHG
zlZ12tJ%M_Nw<5<OBFq7f<KfGwX&n3lJ&l9fP*kz>V^NV_ABsgqwvi*vvO+X+B>ZxX
z90_&kMvg`$Y$HdbB5Y*2>7-0^%3%^ToE#GQCX&P_-58SiWW_F+Plph@0F#{91xP}R
zU4$>J*hTob*iWAhaDa6GmU@%_0skZ|87vgxih;#YCJ8hNoB+d4LNSkkF=-l`!DQ-d
zNX>iEA*|E_umrfUy3O;y|B|sGhaiB1ARUU~S~2E=8Z!=Ve#TFaR+%lFE?sxeN}X&R
zg^uGn3EMCha>qeU;d-gjHKK&YWh)iQ4H2C_71Y@bbq<a^3)z=M<B+~F+*!wDNiZs~
zQL>DR&^Q?FQInIti<yRw_+KB)jj}%m+iGR-g}q53noJOp#332(aSV$k&cmc=wcAJ~
z!{yWoUDf2o7%Dlf6vU$LL;AO;O(VSRp%6o_Mx=}=f<}0A1VrIA!W)&d{gTLDb7Bmo
z5rHg*Y0q%cT8LAeO(7Lw7Pqi0nkUddrDPWzw-*X6H`SPaVt%?_ZOben4l0V)E?4Vp
zJy?)RF<h$Fnb`<%YH67V2pc%Ao>F!M7)MGdNGSbBg^`llYKe-}8jC{4>@~$Pe8EIJ
zp{puFIoc7|6=j5#MH#)e{xY*vK)7sSX3UP*G{zsZv$zm@)-Lo?UZ1!7qj!}Lzr5q5
zC%^dVf>RW_5PPZE$_vI%C!E|dF-{oyRZLgU5)0D>5MG)t1X7FcE*SYcTU~(C%dvKG
zc0#IHCm&uYPI}Q)tdq}0QZeu=bwjU<N9!V9L4uH@4P=Dr0thcn7lQCA*2!BcCQ7b#
z5wlcGAQm*1)-JZ%WZCecP@5KPK&%m1=s;LSg{Iv(`U){SiyPQye5Yht)U#GyC^ef(
z83|&GxJk0o80jn(+ky;`Aq%j$(14sccx9ztYF8U|xVAJgunJk&gQYlh#AFBu(7CbB
z9bXMVEWkW$Vs`Nw=oe&<l+{wL*itE#1@>W~h6{cKsY5vfq~1`PjcUEE((yE<;LQp{
zSvtaulL`l?C>EqNlQ<5zRx7quIBY_jZZE4ZFZipJt#Ed*+)zr5<tD^O2gK7!MeHw0
zTn@t!Ftl66x>jklmUSG`&_@8gRKz93oOWP4n`~nY6rGG|FDoyPPTnPtPFQ&WgIgYi
zLsA}{yiFbwaJUbbd?J1kaZV3N!Npgq&}W`|?>YHLgaUF0WS*aGN!!THaVdZ5jNo?R
z(NcS@NoqM%EeH4Lv09^4tf?r6M7AnsKY}r995rgv040MwI|2((D%O=})U{5dRW?)O
zrrE$2LL75!C>*jUK2K9u03O#q2D-n>tUe+=xE>kTBG2cQ`6>E)YUXrSIdw+hpNf+D
z0{UHQEzWj(r9wD6swiCB6b*OGspaWfUe`NlUyteuE}4eCGG&m@!W6*=SX76gTy3S<
zQk(2-D@&K>N`ku)gYeZFjb^@71rDrMoH|qTOg1K6bDSoR>9vR6%$+$!Dl!xtZ5V>A
z^y=xtqKc`Dtzym6Ziw%+!pF-~XV?~kRN752M6eBcsSxf}n6ohyMoOe0a0iH#Z6i%b
zr06JmA6%*Hy|5iesK96Fse#Z#Q$b?q#X3JOGQZ}4LVY=u8KnWpE!Q*Y%M~PcUaqH@
zv%GEUx}3gPLE;V&E8C*HZDL(ZU#uW;2Z)tz*-k~QLzuSegFvO$D7LXG!snFJl^DWx
zIwts~J35SnpR2>S*!qWZgOPH7=hVWf61hAhN-4I-lZV>`M1j*fGWUipVU@Ey9mvnp
z9Kjqa`XDZFbl4{SZC0Fe48;kMC(!P^JlSal+bqw;bmR%NJ1<XBs0*`XqkCb3tD?7Q
zty1u`o!lBd=BUvOyQ0)6Kr=@xL3~E9wCA(RM+5scX1Q1tEAbh>M0>MUX;1IVd%ZfD
zAVx<V#IS-A5``lKC48#q6_lWukaKcLcbD0M66|L{P+}+AK{m7yUIBV%iV1}l5XM6n
z5QG*wg5xD^#<m9^GqoKvw9ttkT9{)eqU=Qb%0>c`XkUp)z)pxjcIF;I1RgU?iJAKj
z2tj_Hos1MD=Gi+S1?gFFGD47;74L))WaqHS2ti^FyAwi?opFX2Lh3V4*ejVCCoEuy
z8K(zQZU(IxXD7BHq#5VVnL^pQVv<cRF<0CP?U$YAB`FGtY2HqVg3r(dlyMKGzK+}A
z$t=?AxO7c?&q`W}twC-xO&L!=T0QkZJAgfw8BC|&xtLgDbMwGCsxAFRt2c36RGUq8
zOUsU_E~dW0Q(fKDXI0A&A)%>LEvt2<ST8G!t;R}|ct&;!R{!{4T2I7Gjye7M61iYP
zj>&Wr$FvYeB<F&V6(sY{@25FoHs_^ErxnZ(5f2%|8Y0vNZX5nOC8vk%wpn{*<`F4q
zk2$4q%D~c|Z5D&fvPueKFg?jTL<}-6WC~(1eaSmS3^E=?G%@H-B!Cs?vV}FYn68DN
zFl4e8i<&jC&N*X<AqQ5hv$zLV#<|SUy3L(f#`{UF*-SUcui3U)7{Y^v^$<0wB88~4
zbiED?XuDcjBeRE{FpJd2NUfqoEi1c6Vo8XE%w0?`TgcuxvUgYjm8Hi4ve&KZ$huWY
z(v)?p!qbf6R&~T~mCYYQ$XwtL&2?y#Bss9uxUt<KpC;WNcPM-d(Bh-FrpdZP;b{i8
zx{o_#wYtRM5uPP~G03_@;b{hn!N(oiF)_%xLkWw)#~s=+G03_@;l&W$9kPVs>kc^w
zM4=z!KO}B*=aY3~QW3Y08)J!kn}xyM7_>3m6YEgcVyjhLQ|f9*sj2nF_LAv6vmGe@
zERMIU%WA~zeReM!&E0$Rr{{*+%aj{DDM)&ZLq0nUqgBSv6a`uLs(!|NIyKE^^~@@g
zmd|bls&cR=7^|`d2UOvm;b26UK}S`eDHqpvh6$`gV#A1{^H49MIZjn6ON^B84D;Qr
zjS(p}hn}s46MXCKCB}w-M@W$kq|uN#EG~9L7=~`Hsn``AEC*lPG=!ucstUrC?S@iU
z%GJecTQi5T2%C%Y)l&#DVr9sw7pD<*6l_<B)lv0&Fj?$GYXs*J(kN9brKpic2VKJE
zFGXt>OX#56-#y{mkTNyZRtXdM9pC`27BN8M<W497rN|NerN&BYXBg010B4==91rl2
z^hQvqJ5mDT&Ikjs2V#T`(>ucfj+|#4RO>77A9h3~bs-d&mF5mLgDwP3Ej8-poe_fG
zEes!OCmVvg#7F{C;Il5TeXi_{M_f}lap;7YID{u3dEyX(l;IjBG;xT*K|&LU2pl9o
zafrZ#;g|5qOVGqYKdnh-CK-W`G$sxa*pQt#q$>=gcceLS2rrx@CJy1L8ZKMV#39wz
zNOIy3q54J#6-^vcl|fc!;*cr_;)z45<P9wha@x~nKyKoYE)O9l4(T!?GjT|l1F4Ba
zx-7^{9Ma`LYT}SC3vv^Oba~JlB5>j$$pIxqu#`d1<UpTf!aTcknIgT8{EO1uOsM6C
zXtc>ZdM=T3@}i&`4XkXf1voIg=*Vb?a~2tp(os3$og3FMi6q`~>*#Wmooz*<?JGA<
zKBC-^tsyD5>>$D}>Y9F@)9k`vKA$C?aD-ZQxme?S<VD*<{gAX_CpDzQYKn$Ke*|l7
zUPzb+Ov$;FToeJG=2oSZR!h;=mKPeeC@5G1HMDBGx{8P`&PIxgq^>UF*nt>Gs4|sS
zv7`t8qwqm%g3X4e&?#`n*@XTxIj<HW45&#&4A~^K%RmxKy9h}f?IQS?+GW%O4H8|u
z3?#9%%cx8Y?IINMw9CK{QM)=xj9oS)(X~rQ5?Q-+_&C~St4DP0vLT7CUAD?Z)h-=H
z4DGUEh^}2mPm69D!G?h(mUa=6INC+<F}2I6M=b3!ki^n1qcSnHi%`VVE(1dd?K)!l
zUCP25MO>##QHQW#T;X)hA6F=q^G6d_^ZYS|cg=!vh0{ZSTvWp_>gbOtq*ewaimjYR
ze+@SRdNXC<N<ujaR|3jOXp&J*qjKR!$6!Gvp`1ny<0~g&N<=vgMDdhUH}K&nt{yVC
z;fk%CI<C0NsiR3iIc=4Tt(-Pov6a(S!<fpcV~VewHbk+N(-;t9kDOr2z?Fn@60QW4
zlh7oioJQr6P)-9^63S`RFurmUrbLv}KqRl6Ip%Uwrc;D`Q5stTsVA^5IAhGnA!WM|
zeDhb4=te=^dZWF>_6Y{x{1A&#9zG^k^~}lz$DXw_baK8c6PhZM9bBnbpIuRvX1g_A
z!VMX7t2ngn6m~S85FCw(xW7%XXk8?e728W{3nvOx8hIyqPKuYOZInlv#WwB%z)c?|
zeTRS6b;LdK=ExHAKD&JWxWfOQV(GiSEkQf|_{NCV3N~+Idjl@cYP9I+z~H>sSdAjm
z9;&3P-aV)2(WQ-o6Bt}5<U}`CY&O-p?Ph{GUBYUet|?KfmFW*_ExJ*qswueQ1zXY(
zKkXD-W$OwDN}C>CE!I{jpLbNrkI>}{`T3lJza&=Q=5WVY(W`|QHn?FBvlqkANsmiv
z=^1|51$9E!3EWbb6Ip)l3~4L7{Kr3jY}1(V84n_j2_A1^kq$e8U{SAU1nF2KNGIF~
zf)kh`jv$?QBM9n{Q)u~Y0{_x^m6Pm$oI>(J1%LUtvO}%iJ3jcFvKidjoZ|yiO2^R3
zs%^hc1P}7P<AYvo+s6m){fYa!eNB(Mu?CE=`Dhh0{K_+RRzQ+-;PMPg!Tppjz2wG_
z5$;v}ZMB{P)9Gdw<AlDD#%~{i#X3XV`mm>lcF9{it#~E$VVj+vV4D4S$9K=qD)=kd
zucMEJiMOn${qVQiQmPkz@!ntcI$>1LW7L&Zy%dMtPzu?}+Y}NR0POfGC?p;KXIDs!
zUI7Xj?{q(+lV?WcxNbxWh7tKt2t7?y4ZQR;z<T)W>G-m$X}HKp!^Ky02Ur7cV=OO<
zab`bELyorL8r7;*uey1r2Vp#N-;x#V?%OLnj>_Vga81n%PC2oF_$_HWBOzRD35IC~
z=p!LX!_OugGEIV>=ai7YyN`RD5d>Pr89Mr!Pbs&&fHSPI9k4CFF)teou3w@jPrc(o
z{dB+`)wr>baX;+<6imw8JUd{;ck#Nxr!)_y114Ak_|P(&s>Y=6gbz<&n_7vbGgB@E
z;W?<r<-mnN#DP9UVpm3Wxj8wMr;`MN)YMU)v@@u%c?%_G{eiOw2i7CiI(lubM%NhH
zG34{BbL@6JDUvY7F-g({MTVs1j7B49!G|Fixqdo1+1i=oQpw&oqsx{La!zDsz5U0U
zAPw;vH%*iRW#O>SfiG_5T-ZXg;uynXv*N@Sk`?D@7Mm9rx{%B`2e#PExX?*4W8H)j
zc|dcZ2uU<@m$!&Y_xkA9Nkwg$7!;-Cc*G#UXFy@L4acog1d8%iiWYo`Q>BO$!&NE#
zJT-2WB2bj7lE<1tL{_~pMPdO<AqlZSn8LHbBd1BQpks=}LPApDp<_8I*cMNCDA;Ql
z@{BT&n4|fZ@n}j()<z=2SQoom5om^~R>bixR<$D13|p-TV_xiPMW88FtvH8gMeJI!
zNQSIb1SOBwR92-Tkd&&FF`292kghg~K4_B0*@@U6;z%GONht|fm5R_C;#MjGNx4ed
zg7{H8lpRG#qS2>ECQ<wJ$UhblEwN*A$U0MSs-8Epf_x*&w$PWc#OzykY*j6_8?EU%
zgv^|s3lHd)NKI=f2&pwnMJk4s#M$Lx<hJB#U5n@Fu*jc(olR~e?f~@;83`+4f;pnt
z@?g%eO9(hej3fk{GoBFw&>4FW0~#~e@Ghe~?(k#19PVhNs66iQgP9Pw&6`a@;x_Cl
z$Xv&slGJV3Q;@smc%&e93wa7sx6C=`yb<CGGod<K$kULyY5PjzOh@|~w2*DX4jC&;
zan{q>`PL~|zp<i5=MGHIkwvVML0mnp=amMzq_kFCtI@);vD6%OZtjIi%I)a^jO_h*
zVUlBEs6?r_@nz71CkpxK^>>oDyMQ7cV2ej){S#OpqqYb@Dkm2=4u?Ax(J${|%!xD_
zV@`)HDb8G2BeLf32@_+@i8Uf?PPa2L-dt!SGUs${6JySWR*tz*_|5F}9kYuHhUu&a
z1d{u!^(wBf<eNDBjSx+)YAR2pu%|G1Atgg2&SmI@6b*7-5GhnZdW`hg1Il;e2P;O_
z7j7hGTlgZDY!PpG;X;B>g#edMh2&RdJSrr!IOA0z4wpiOLap(5S13{o@r9jqD&%M(
z|F8>P1;}=iA>~rh5W7K+EK+2Vs1?VZ7DQaLqb5nizojrzZX4FB5+Q94t|8^x*><^x
zpNa+#oQ^q{(+IhnGy-W;u7Q3rR~`f)OsmV3C(M*MUM1s^j#$a?Q}e_s8G*E9C5_mC
z*^&bPDM0-^P(@@y<O79Z!tTfTj}^_D6}V^N9ml>leM74iT*m|2;pg6T%dQ<ioyBHW
zTsuCdJR#b>s#oJksYWr15<ikq&iiE60jE^TuM-&%ag0jv-e^aw7~~Lj2?3QI(i4Mm
z0#IYwBRlxiOsGl+;NyxB8=oVyHz{lh@n){J^rYg(X4FL8I~7k5ch6ipLEOD_;RKQQ
z&SjHB-V>IIjoK&YEOETLL!2yLYvzzR-lX`oEeC~P^`Kd6?3&p)h~^X~#X+=1t0ZMW
z97J=cV#~nF(Pj=r{ARTfCS@_AFGDBNMsX6jljtXm{toJ>Nq?s_)R;m>IN~S~1&FhR
zn;-)_r~+}8f|HSeF^@wKDq)0?Mk!+^fyAdlWt8U=vW?VoGbJNLl8*>KH56uEW^Bmy
z-}mg8CFNE$RS8|C?9g)Y85MiVLr)vCSq8aSYb+G?^ZZ3pM07GtakN(O>12BSd8-ae
zO<-l4pg50^DU?KJQVjZ%%RP+K-pRgfm_U*l#yB{Vnk*Z_OMNbH5W;B~f@4zjW*uRd
z-$`jec7&GQ*fwB=G8=i@h3=(ex^|i^FYJ1`r6TTdV0p<nv}sV0O>;pxezTqE?g(8L
zw$AOKBV<s0R$h<!fM^UmqRz}qXR%(`s4E{;TMb29Dz?<JT%UyiaD!M~J=<2Q<>1(6
zPsRyb(13mir}=n;#ZmLn^n`<r2aksM{ae-pC_6}}UNn}QXaE|E5Gmt-X~YPJX$Y9w
ztzuoH1C?}Kf#XgOJ8WGfeDlO!P6^pO9l1k39En?i(N9PSAygb_<ZK=~@+MOA0F%3U
z2v=b9nEUs|oSQ{Qp#xPdzub|*T*6Udy8EEC>6k{*kme>s=OPU&bFBIN#cDz^VQQsf
zow3M)gVo#ur4x1;D2_kPFNcGrHf-YpB;3`WXM&OC)c~5qMN%OFYmH8LY8)sGH99k=
zQ!V2RCBey~rX(#0KHAL5RxAfn^&-wW?c_VM#B4CU$x3q!)Yn4kZ0dGmc_DaYFiQ)E
zYpbMi6flc2bv0B#uEyw5c4eEx#cd%0xe7!A3Pa7(0$EZPgswNTfHoZv-Na^!-Uh>|
ziS#Dx%<Yu)GdzG&^fKJk#KU?|tsL4VXn<f~31#s^Af=+gz$SIyfxrbX>6ti1oVH)$
zrWU$EJ9&q__BTsC($L}fpei!JJ<#C|aW9JS2Dul9eXJCip<rMMlj(;*%1{RbN1<*F
zr{TIWKPHcxd^rQ&!@F&86&dm%SUH1kE)hFcpT#}J8;;H-Y~YMsel;gMB^C#B;(Yld
z$|-z;ok?$$tS8|JN_N?2A{bfkTB&PG)r!t(i7u4ICklV;ZV9!H?E(__cY0TmT}E20
zb&6{mZVxCm>Z>A0-y07pPED;ZwwG+;5;*_fnAq(N%f+(>y5LZeiNmqzji^+xcjya-
zeiH>Ugwi?~bt)}8Nj8GgI#7BmZ6{neaA1tBv`%bf9YQOu69tJan$kM(#8O%Zrie=G
z%#8`5L{31b7ENh%AaMjWaw7HCBOnhoo;q>H)+86YNUG$*5nY#@h+-*|6IEnwa-JJ1
zoX(n~pzFv|KYf~73ETJ%h8!9NT)LKqS1AY9UY!E!P&U<7`)F3xjU<j*IqKJ=S4?uU
zrq#_BU5ympxVp~d4WU?$1U;8tRSgXY>7zNhacGt4q)k;rs;Yz0UY!c*ra4)Rs8LRq
zVkndYQI9^6%%s)Hfhy`a<xGAIWA>boe)<%8oN}UdXq0W73awI(e%z~5p~opFn^CpO
z$yFS+a$xGwt8n9#t8QN7R6q;_E5*j9>6Lb69QW&(x?!E=O|#Nao)IlTyU-fCVaI9?
zI&x072Ue$U*l^1YJ6;&WxJF*^q4mN8iCraZm10-82u2(aY@VY{2%VVHyp<xXzudzb
z5C^J-q=VyyH)+KHtD%MsPoCnd2G~eaH>g%I2aKtzk8*@`QhEhe6)1<CRq?``xN=nE
zDhCiGpd8g?l><zLR1PHZ*oOV=*fiflkcdg~!5uh&NZJ)2)N$3s4{az5<A)@?y7*v<
zGoJXMOhRq2LnJk|0q(Ta2B_0e8$ugfZ3sy+Y6DD3s|_(1ceI((W*2Y_m8af>c2;_H
zTgM)#IkFy$AM(U?M`t>w@)%eW&>kICqUvL?mxTU64^z}1U{6nfs0-2RuenTSn>t9&
zhdlL?@WvZ_sDTJeLiz(#iR%xs7h8X-0pm|tf4H|PIQC%uk#vgvkSDJ{oawmwqhm=z
ze>kdS^+#tf3H^Z{dXGPe=nt@`r$5w%5+8pcTEZK1{L!%_q(5LNas8o6hSQ&+LC0)s
zTtNVjrd;0o6EcG5i#$+$<mOwxxMOOMKi)9f<Buh@_V}WTp*_AhlhGbTguI8JkZa>U
zYyy3t0!jMM{@Bw|A&QeFphJWvDJ24~<h6(xOk@yBDk|vL(8<IG{jsN{Mj_*b0sJMV
zMzLas0StPnk$++`w$1Tv5ZF^fc5Hllb~!tiH}@BXgB%``fjpw{T^{T}q;Nz%L8Yi#
z=Sr}2`rwo~t1!#DmMvToZ{@Nuqp+Tp;45RRu*4=YM`2;UgH;;4JV>W;esguXSW}vf
zYP~JWsI;K56)Xm{PP@I-Ska30vZiQiGc@gp(4bA0WwC|5R1(Rkjw(k3)G4-GE2_1n
z*nc^&hoTeES8H7Nys%?89B04b$O7#Bwq5>CXBhO}^CHM$x7b6yXggq~SkuB+%mdQD
zW*!F}BXL%k0qc^8<Tm##1{;3RzJl$+YO9Xp1;nJhSxj*wjt4>Ez~Xh_vXmfuh^4(N
z#e<-@c1VKI5B*UVikh0me2osGrSExcTUW-b4UPW_+*nF0n1lx>r*J$&ibA`Qi`XlU
zF_LZjSvV681yJfJDz!#YN5XLU4+LcFjYDjdlI=WQvWBYqj3yc~eGqi=F%gvL9;W3+
zy}cBjg}4|>REZ)QX*rG*;vgvHhZW^)Wa=@18RZYhp&S*MQPxlQ46V2w5?EAVM!6NI
z&N{Ham9cd<J}3rvacA*3BfT^o;SOP+1GsV2MG<Cf?W1bG#27XAsEUrhz+G&#)%_WD
zt<z|gt&?Rj2u43g29Op5`TXfY<rMC*nN;SF(ce=uICu8cnT24fc%3xf$@^6lo=z}2
zjL$w5?RZpF(zhaaORp$9E-JB#mh^-8L$#&1#Q1sfc0@v14Z)yR$sV=fKl1|!#eSxF
zcM;G-EID|LIIBUaR;E9!wT3X3S2d;7Y{L11o$M4_Wu*$=i{1Zs8mADCt`=)6u;NII
z%#YALK6#u-EIO3fr#G0LJNRI5oAGU{%S}2$ELew}J82~*g`WHwn}k6t9Dm|=b6kLA
zO)dQga!&@~_G2}RrjB%_6h;Lc5y7^;g~Wp?q&FV%2o2B7Y()Q)u*v^p{u3{r{s;{^
z;t|@}dnD&1qv#5nY7W2b!0s%(z*e!z`pGmVC_?p&(rqOOi}cRiyW`l0CKeQiWLs_<
zWlBrU030xguSNi>N&xjN=<>`vF*PqhtVKlt)Uz-mLPn&?S6-vg<V%7=NS_d=MC<!N
zA~YVAsEqoU=e&kL4_U~Talj%w;Z4|MOiuWTt6uk?cseeK0tq=WPjlt940An(JZ{dn
z7w*V>TZgblXdcn|kFk&ogTThrUq9kGRCCI6o`S9<aVw5c*?nA-DeKy5?v(gD6A4@!
zWT<w4=aT>xwn7-f*-C(<Y=9_<rk0KbB|%I!Xp{sknP^8sbi^Kb0!kqhu}Y{uJU(@L
zsgCnKgAR~PpjHl5-xi8ah2IvE4z=GFil*{!7d74mwu>5%`)(ICJzN{YmPIh@BA>z2
z;!+gBnwAEifYUoRMBq}m!kq+_*cLZ@#T>&>s39*rE$0A~GBL-{lQJ!H&`F<81dAKK
zp`uybNOU4w-0;*Ksvcno4NuXj@Y_Ptq4wKC(NzBJq88cWhHpT#BWzdQL>AY&+9X0i
zL}Y1WA(x9QAXFXU>L_ErD{@4D-Moa8mI-rSF&!p2$HEc2q(vNyvc$s`$qPAq<3Nru
zH3hmvve(@QTMZ%*5w(HGEp=ki4kF`1U1K-IPvcs0sraoOMm9k0f{~)*ag8;<IbAGo
ze^8+my+Mg#VJrKCMxm;UHVReQR`FmMpi%3pgNo{EyK65(_%sCe@D@SXUv%DSpo=g>
zOY)x5Fgk9#w@O%1tFXixNp{pgZ4S`l0k;=Oic;?ay09*^B5cIH6}IXwL&-j3@nHv9
z4egp>x!whZt`ruE_uU9ka<t5Qh%oL4*F`Uhl~#6Lh*V*om?BkloGeef*jke+O-n^;
z3wJ;VW=j~Aqt=!xX{xzY>0#V(9b7OwsHa0<VSQ9<;tr({<(o)-X@@9Zs<&HV_~F-l
z1Pai>KR^FlzI?IPTq=g(zg%6chN&;}QsnWEoefK1p;oLvBTrzoSc6uED8GozilyN4
zW(r$&klj0@XjSCbiPCobHr_-6q#ZCqK$>pT<tjbfZlXa-(d^CL5E65PVC_9TOjQiy
zm4AUVOoX(&;4qGdhttzGq5(#u$dfiAP~<rqB0!(S3!WGhl*Hx(h>VShBz2`Z={rF+
zOeC`Trm}(+VzVrK5K&pWg$!G%R;_t&$vO-q0=P3*Dl~QHDb3-zcb*Cx0p58feFOx~
zQ#OSNj7%BikuEnUvw}nQ-KFEC1_o~u?4^V&8UpRKCqx_urLN(`=*9)dZU)DFXc3@7
z-*?H0%C;?9HF$kVmmJEO7ijv91A5sIw2@&c({7A9#k?ZrdD5`wKX|z+2#%y$$q-2D
zN@Nf+u2>aGU%&8E)UG`@JYpwrR$@yYhGfU>i3}``5Q4k92b)6m>VZM_ca*9zux+fG
zghezrJ_v(xR!Na2m@YRHlKjPbBD}5}f+Y3Jo$t@oKYG^}XqTIsSht)IlA7fKl%ig_
zsR=7(CX+jFViHAOeZWL|VS+i_F|>1VTls<sw-I|o%1g!N_eqPz1t%>R*QE`@u5Q-P
z4Jc31ajt&|f=;*)^c-i$hau<$6j7v`ti6xq5VfK|WF(sGSdB<D8KjV=Z#+UMTiTiL
z9m){)5N}Yqs(MnDs;m911mUP*6=p+q@DO7amYB#|g(d8E?->D-=CEhWe%k()2SKq4
zc>xJkwg*Vkn0mvdXiq%|Mi7aNmKb~MaKHj{#)2nD=2kpjJdOkcXGnHB;xPefLFQtU
z)^4<liz?zmGS%^gOs{5MBn>qTmWeN9ddwQyf%Q=taXO1{3tM9Czy!XGb2f_4D9v_D
z+>4yW_4VU`jUkTmBb_B23KAUNpkqn2rD97hV_)P-U1F=L8$h(EoyGQfodT;jCld*Z
zm~E*w6^m<3hN8N8Q68x^O3!e>06BU=W|1#OC%=@z0d|p7JgA+cUE?^wrP2uOE$A#-
zQ(0bV+o=1-G0ehaD|L%m-{M&uBtvX*0*GJ)H#iops*Cmf^75&<)l<RlK$g}!8ztH<
zuM}I0qUgC>m4xNJge(MdXn1gBi=t(=&L%X-Zp{_~cvV2$r#+!Ww1%6@Ey|c!ZnW0W
z2eigYtE37u9~e}wu6A^#H6aB(hv0?=>npXI;vy*p$a_hpxKe9}qo}d&<pN|8;GVh%
zH$AJsIF3+XtCyBqjXD-l%Q%g$Q8W3WZc{8THA?I;^=)Hh!N8o~E}A&-K<{I!AI;_9
zP8zzVh>z1T3#y3j+$yK+KT1lF#w>?PeSrotzLw3R%W;qnq2+3g#i8UelTI*ptM#&a
z7Gq@Kpf0XHj*}p_V-RtBhPKgcR~vQBucbjPXkAlGkM)T-qCH}87;HntoE*_Rlgw}t
z+)e3pL{n8`w+P>ZW7B;(B_9hIM~FcjGowDcf+PL(=5`O%5`)z!(xDn{j8r9MVWm=0
zTjoeb>)F+MwOz%5nq^fhwW>{6<RSFqHf(_*8=i<!T3SH{i;S53>5(00cyMS=1CCCL
zltMSIKi9h56?Pzh46zzX$`lXz6OX8v0SFV)%fQ|#bauoeg(0{&!xlSxHGw`D(9LDl
zD*%Oreg!}qa`K%AFi{5}U_vrR3#lO@2pJs=ZTBJcaWs&-VVGB&FY59vDOEtKl43NW
zt15xgr^3N%D}gteZrbA>%k@lJ9q@4SrJG_X072+R2t*c1{DBx{1uwEF;x?v^FTxVU
zstkOO0*FVO9uQ&lN<5k)E*H|{^-oM0MZ82kD-$u{CCAAfk_eda(vrcI(Uw|TX=&9}
zmBKgbS-AAUzH!zKA?%4g5HeNn0g6~3S)paK6x1%u3c+4lEC73Hsmj{{BGo`nT0>c@
z^}|%(2TmvmA2=D2_<+g^#|K<aOj#TnSb}GvH0s#zaO$b$xz)MjtMfxj@EC;KIaHeG
zur3=o(}wb)YvWD{iK2tWGA6MyCEXnrV^`R&ErhTusu;h$v~V!?X)+-dA2=aBK5Png
zSTDvUGvB5q@-`xH9UOXI=95(ta=k;b75vMB=$QDjB5itBWN(VSZ_2ef0;T_Ypy(mN
zm5aO#{_8D+hdNd8m1S{o1t-8NjBIDw^{@vXoVki{c3ls9;D|R@8NC{=r=E}=G^vs<
zP`&D|r@aVC1g=5=oo^q}n*cvxkh3{zEFKGje2S%#s%cisd%w08r##;~7NfF5>e(i?
zb1kd&cCqGJ-bPNMFeiTcDIeZZE#`np(ACE*Z=THlE`dncp(xte(lCo+@ouqW;V4cq
z8qxUb0AR65gd%wh4`r3v>0^^~bIQcAY31a^iTwQB#3ZiXu(M<}fmHEQO)!39VGH%e
z;((x>lMCU1)>9m6AFiHev-;I@xP=R48p~*_)oMxA!@8+tV`rVD#7*EVZ?u8`wA4l5
z2zp?v(OeTXiIWW4B)#=?Cn<3^f|ItWo>kOVtI<N!P_8UYJ3T5P*xoMI+gf&zy;ay5
z-^O6z*VuM^0uRPsRNPdK(xL@$iu%$z8c#RJvH|k=u&GtFVSx5JGq4(Nn=v5RsrUXW
zF@(i0+(S}Y!g>B{h(5O|N>i)WDQ^W6eD$naVmF<@ltY|tdd%b!1tadY^uj1Q?m26h
z9kfrTk^N_u4s2otvleXG6p&rtA|9^2pkzFGTfT%vPS%h21eWyTy%^4B`NAE`5D|?L
zo(M*bS-GAB5(&vL&xDXfF|MbZgqgBsJ%FTI%L7iju{>ZU+sXqnR8x7uhixe@9N`+u
zOJT(3-h-|ML{eD98k%7Z$V|2UMtbCj*zTObfgV_?bsX=5fsP*9ZZ~763F%(4i<CJu
z_wq2WyIqbq#d#P}^UZJz*;jCgw}tZ_VixZ`uY7rQ^6wA^cMrBj?rdX|SA(z(dxqRy
zwMv)29%8=Iweu*gq+UAeR#B|KH*0kI#PTwT)2ug4H;|zKcImo9%<HiRT`yy`+90@$
zKYES*J%ngG8An?cq-L;PdTG=Nt_dx)r-q-;!A3=MF!!h=(;UtQPocdH-Z31EunHvI
zw%IXiTLpeA{Le;PX;e~c2g6lQyb4EH6)M$M`gItq)-|=&Mh6!p$@dsJ8FhkX);l){
z(4Q1E3icxn*6p2`xK6r}hmcd9hB(XyH3saY8P5*ev@^xtWgCi8(M|o*FE%=)pq3P|
z4u4Z?q+SL|p%1UZN~chdv0}5S>c%n^^qNMA<gf>$3LhVmR#<GcM__8Ml*;I1*fS);
zr)AMbn6r|K_hk%n>2xr|w4~(4Wrr+FpW--_Yp!TZ2-aY`M=Ewk?_azLlGc6Q(@jTt
z`0$obMS1w$Zle6MXzsr;q@_6KU@!S{6WgK4x}@PfnE0)US<<TGB$2|<pPC1x>t#x!
z=fg31SIpd|D0Z8Eh6p~%_~kt2lFAIy=v=z=6K34z6s9K~!-b~Rf!>QOQ!xVY;OKzH
zREAQcI^>}kK9+2=cpg;_x!6LPbauI|S>|R~PKI=xNRommPSn8wg-X$OVk=Fg)he#B
zRN<OhUu-X#cfqjy9O;fL$)Ook>V$JNCD9wM8p$`5pD&5uaAd;_^pdEZ+K~bQgLf!+
z$e@yB4LpNN>9j-WpptAAJcCN<)WIBamZ@7NJru+WDoIKU1~LuS?VXq;lk^xA+NF{d
zhuNUU=$<s=y+NgPG}AT|rJ|cwP$?BF2=*gHdSn~fjP#_!yCE8z7m~CV>5-mvRL3wf
zQ6fE(Ex@N1=}2E+lS)VHtw;|WHIr`Fo=8tREo_VQq%!y$k)Bj!q`RN#D31~8Nkc4=
zB0Z8F%9xC%IOdpP5}3v`OuC7mB0aoylkQ$l5-E6WsktR)q$d^88<8G;v`JCyHvLR^
zW*#Nd6S8yZik~p!Hcu@*=@@>kN2CW~jWkBPF(cBG3Ub2^%SfzQ<9AQ>W~$kvJ1kL+
z#N%9<JguA_R8D7=JObSFV+!cy1lb%Ez_DkfAR~DhXH`tId%`G7na6E-q=sj&@f=V8
zZYPPdflTB^MM3WUqAExm9l=R^)mS;{bIZZUo)ZOrzK2_+o>vY!Lv5@vL=;9rVI_SM
zxWXt-?!KrNW2_eG(xA4e#H>Z2wIl-NGzm~!*HWe6-y<ZgL|)X={yico3IRPLNfJIi
zA}JC<Jt8R@{yjpTLc|`C5P^Umkr0I(HV|uV+_AQp4<70%*w=0p>Dbq1ql5o&EOVf6
z3;^t-fu&RxfUFGLZm^##oe6}uaaIc~Xb>_v8yk`141nx1G|gZz7|h1d*+7PD1*NMP
zya-~$xE4qn7o;_mj#Ps>iUv#AQ8c*jj-tV}cN7h-zoTfd1Z<+J1d7U5uq<0}F|eS6
z%V6S;qQT@HMFk8v-C9W>Y^2_7Xu+!Q@|PvYp74kzIc7U8vHBa_8j*xypvD}4FTTl6
z1SMG)Z>)>Owk@11%eZ7?8iENU^N^@R%UlwFSeZ+rH6$V@bBxLOs}`4WkRgKaG~fmu
zf0P}v1BiO3y)2N=9mk0V_;(dIpoIY?OUkx-lxm{8)13Sf%_uN4C4u2_NP(ynBXBlT
z3`=Dx3YDcWRE&l3fL>~ERN)zL&h{A5I>l!Glz7L#oyJ(DrK(8VVH=|*`5FcSQDDQ#
z+E|mFbuI{9IAO*ct7@x)n|B31suL>Lq%_w`v04iUwt{nRIW@t_HxA`IqN(aLjY=hd
z7EzAzYJ)qK>}k2$$_refUQ}e0foY_IFVnUQE=8CIt7e;ub<AFvpZ5?rCfSP9uyXoz
zKr)28?CPLW9~x2QAjBiK4ZYqsPKTo)I%*(0*a#y?TVWYNTE)eJbd{B;rUfA(NLyk3
zz?g6pM1su8i_un8EJUlYNQADEOLbi1bkcW#vr6m26Dw8^h!l2R+VbqkHjj-R9c0p<
zp{%VZ<p&`bB|FR`+cc2CU-6Es^J{|x@mh-I#7obk<FzWMV;#}CO&Dz=La;H*bk3Bm
znAwxQ3hK0S@Iu4*9Vi~vJ0#H1P9EEd9+tt-P99MS=i~t*w3A0v!Z~@uGn7X75j?m~
zL|w!s7KWSWze<#KK@1J+M`iIvCOX}xj8oAYb?)=XBf@Dw&#qK)@*B=R%2)Yf2$C6a
ze2@(%P5vUH<QVlMhv)`xA%i$}3+E{><CHbr7Ij4bUjzjg14sSTag3UN+yxF{<gy)M
z2mc6?rTxL34ET4>F@w56SL7bkK||V_)>fB|CJe=}AGDKS|3>pAFVHN135@EsaSFh{
zyi21EuhpOBtXnV5x(Zs?IPr?q&k5tt-H^R)j0tkDGLzkm6uA-3&uyxK2{6&IccM6}
zmf{eEjdn~v#T#hsa`vbw4Ly>r1ZaH#bE#IW#mht(2rUMmiiBXs=ueWuGfa?gaVxvQ
z-eUQxxN7$CTujDyAQyxBjfpyB&>Yv_0I*rcQ~o;WJCKS1-6maF-eDL8{nFI~#PdPN
zcn6m+;Q_~AesF7T!;J@Jv4RN@gy=LN@6+>Q4!9xe@54Z7G5FvKAq}C{j3M1gEtZ8t
zjb3i#Oru&CL;&@oV`a5nEG@|u9vZ}veB};yDwEHOBkEgfy(B!vGuvLmH7UFXIjyFu
zP2BNAHyJ|p$Jj+_jq&nIt4Ln;G)4DD+4t$$S~ic*pz#Mg2l)|@zC$M+M9AsTQQUNM
zQL$YVRE^TYbQrCvmZ}vvwz!OKn))T(cEkivOZY3Lc0Lc&7aX(<hmP*MF18IK>RCDl
zDj2`5ikv5QZH9;|PpF|$oOo2Nu-lw^xS;Bfo0A=!Sly}?7i#RjIEA0KEf^TBrm*-N
z!YL=q#b;EU+f^)suB+xmlb?fv3-Yv;1%B|SfR4M3ge}z5s={8?1Cg%e+%-x;YQ}gX
zoIiWDqHwh8krzgLfmXZgET)lbR@IW)sUq`*ow&>TXW*DSj>&hCHu+93=gq`g%8S5w
z5@IK?@8~nOsMT;#voVKZ85fvjWyk4UbJl_CZT(nt=egt_1x!!M8=mUvKYt?+a#bzS
z4XP|ND1qErDU2afXW4a%)rC^C2~JxJ4YXo$p@EadV0}N@$G#eoi9Q@Uezu63;Id#G
z(`Nfg2P;>R+`-;spf=9?cWvZmEu0;pYd%-%bOd~<t(LKPyNZ#8fm%<MC7dc)Q(GKl
zm_XWUYq?rS$iNO^K6C<%5&&H`rK7Qf*dFU->BQv4T4SMD(|VsM6|1g`E3mrI9K?@W
zs!^0Z(=R-9JY&Ms>r5o9+EE{bKEb`Up6M*o^FiyWUUHb=&ARFj$zHl-0_dFiOfNP{
zu(nF$F%x#RUTUdy1V4^=E~)HpN|=KRTeQ@RlvQC7?t8SACXVwj;+hT<myV*Pa((c7
zzfvz1R~DCSOz42UFVHwYeUj4hN@vd&7pkjSGN!0p-e7-{PQ8ZW!gf7b@6d6A<|{8y
z=!p4V2laqtqlcX;ITlsziItWc*qg4=Ctzq{XUVhBD~N%Cn#K8R$o7-Q4ckwY9k%@}
zxn7r@rAxRcyS~!20q~2fdmh*+@*)P6<_g@))oQDat1WdfUI2rr@svUpIn`(Y%YfUS
z>C0vqC9Q|fVHYb9WlM34Suc&)&NmJyc1Z=h&`x(W==uliAvL)Dw+*XR$boQZkl0{$
z$#(dJ4Y_v#PRRS6ji`44ivh;HDM%n?w^=yruh+>eW!YwzpsaRqzcB5;B?QYSu%1~6
zY|l(s@48rcyx&_mecp5YyLZEQ+!%v|v3AaWPY%2B1|7t8k4@rt!=Mj2POa7(ktwJB
z%xA8e&Z1VwcRaUro{&3FOSYqTzR?LdAKLnt3z3t^5N_`%R_lD(!2kkr>?4CKTBTmU
zxI(7T_HM|&rOE!>?p)cPXW2%j9ugx)Mo-V1Q8WF<@rsGo!LTtH^l)puaIk7VwDV~^
zv@>Zub8%=qcC&})J<4E?2rlW{1|~;MtRW!ld~PA?siY02_nigjkbw=x`P^3CE*^V%
z$8)Q^U2?YKj>lGMmrQK{?l%^UTi`aJo>wMRj$Ci#GFBQ^aoaP!3(mLM%!a&nn>{n1
z@uoF@T9~XyR$n%sIlCA$o_ro)BayW|))mP1#3E!bXY?tu|F*&wIc6%&dULe4I-9aF
zIkha4`N*cBHX2qzJ7re3@4fGRIMkn!?2umm=ib~KzIn9qUXQ1A!8eO<HCj{v>2z%J
zxP}cWDnfDmX|;}-!#FN#sn*)qI7$VPg!d@E(q%VQ7QJInYwBXLv<93DD~rZNh)V0v
zn+Qz;t)dkxYI}`dxUS@7kLcD*7hC#mNZJxEDzB+jil&9dm9vU|iGlIRSg_Y8VT>s%
zYC158D>YhJ^ELqL4fB=pNDupQ&zT--?Q*TUVBxSmqe%|;P;C!Uo+GtAV|t1{Lyw9z
z<RetuOUw8{4K`?NW&WN2J2o=H-eiZzhK{hN{kb>)e17)$p8ozm<4=Fz2l}jE#?!vO
z1E05^9%YY@_Pq^oh3<{QBR30~&%RK&aN{Qn{q)~I&Hip7cdL-eU!C|3g4(pu^gTK8
zQxi{3JUMZCzHs5M4^MTc4(*@rexcAkedxe+_x0)ScMBV}LkDKNTeIE2oPFe*g$uXd
zl=<W@+|}2IZ~r9osULh(U*CyO+|E3A3SSD{R}0tws&H}deG{4IXAj*jeEinOL8|p&
z=K1l=^TS8SzjgjyN5{W?{+acCTOZB5^B0H>JkLCT;OO|5&Odr|{FThbU&XWafz5x9
z|ETDP*9Run&mFp*d47Olc;)=@^?gUz2e*Ebl`f+?>-#3w+f-s75RG5YTzrBa4y@m|
zc^qGku0Mw2oF9OkzlRW_c;Vvyw-;{zZsz%OZwIK>pU*r$b?6qcxNl<o=K05`)+hV7
zo}#Z$O|AD654SSUXEV=#tpDivt@Fo@u50~A*K=DrAYZ5IP93^Eel2tHi^Tq26YHlB
z-QN5is>3<}*0U%81cZG6P{hEk!o?9V@FFqLpLu?M4`blFN5}t&Gw|bJV9(YlF)%u{
zem61j-OTg%gMmFq$G>y_ht}u!99{pw*4sc}&-(ogKLZB-4-k12K9G4nH<fw*ZYuw_
ziScXa-o1YC==yk}dwHsR1&Gf*)cwxZ58}o7w@t10t>0hhzS#W^o@Xwehu~0apn_D_
z?^_?3zWs$?ICp4&-^%{X^LLF;-p*Y7A5pnN_fMb|g$?M+%lO$h-F@-zuk^P+G}}FQ
z=;1>5XAV8UO8ot7_s>prUoUk3ij|t^{?3Vu_5RuJ-%fYGTIhbwc>dfAnNREo;rw&A
zXEzAJ1`uRE@$v88zMap$z{pQz{)ZPhN=9_H`)yA5_KUv*y(Jb-bpLMi2|!G|4-Il2
zOnjxn{yds_=X3PFZ}wuf|9umnzIp!jtwV*2GyTr@)7?Lq&3!|A^Yq0N{S)uY_nrUd
zZ1)={a(|(H-)#3!Gw<vxT>Rke_Z_=k=)QFB_37LnXh$LXC!xhzU7sh`SNhfuR!n;I
zx_|oi=OE?RGw(c#lF#0T-W?sk!Qfk80HNE3+*jIf$~=D%qVC`P^c%Ntqk%R*e(Uya
zh|LhkEc)RCnde$~yZHe1zl-Q`_^-78*9-lZZ+`=XP-V2&_|?qCZ|&h~h)%e<h3}c?
zC;L$VKgX|jU&_p0%RF&)VjVx%=jpit=y*ji<5#F#ow&NbFLUx5%5MHLLv~l@`I$Wy
zruCUU>-YJRAdR`!y`Gu9nt6h70N3-Adpx;eByDB)tk3jszRM)pZztK$NZ#d%XMLWY
zvs&5tWHknjyQo?-d#GOcmnudTB0-?rj$iLy%gkQRJaL`%V!Xi1`|$Kjnb}t|Ctu<{
z@K)x;AAy0B-x|N%y^@)|o;e9zcO4ynHFM%cj2xMhUqT1nY(kx9bAOik#Vdu2ll`-~
zuV;So^1yYb%I%ZS{ch$HG*orJ@~!Jr{ok0rc>2(-zrWnS@)SB~q5I{{M|I%m{tJBJ
zT@5N&*qA+Zpm5>04}WChXC|JW_}K~NX*Qe_HZmJ-Y)3h^t)Iy}{}@#ggKFmD7oa%5
ziNYA3-am|iyg&2YCH%rzG<>UY`|~Js?k@`cU)%hb>>&ndf_vrs_ZPaqb9DVk=J^gv
zeF0C-y|SJ`7ur+E{c+~G3n*N;_@Vx-cc4d^`d_#>(O<Z5c~9ZOl|ATK?Vn?#=r|3c
zZ=dd7{q)2-OvBmR)7=*ex3A*qxo;j_Z}zi76Ciry{BIVze`LdFr+)+V@7emFFovwZ
zRcB)*<CM*BF^({_{mJ@0ZdU%#V&&anrILB)R9_$XDdfJ~{sGPqRO0My;_BtX?H9K0
zLbG7Jw=wst)7@*X@#Esz+Y{@9h1{RC{~4g0x2C%{sk8s*&5zx_eH$VY{L$_A<(qrt
zY`D;VTc#V<`SN$r5Z{3XpW+r=$$aX!_Uab={ba$J`TooVl<W;y?|yW>);l)FH->ZH
zI{)t6x6iBHeOpbcu-U#F!y5;3Upjv{2iyJ6QMc~E=C9yCls(ZMn1CU8V`Bi|ublrt
zcVBmKYn;k`fb?|VM7NEX`v4A`{VsYm(7kW-hv~~>-9g3z!0sU|C<uG~8R*d)8|Oar
z#)h^xzcF>_CYahck-K^R=u~%d@74$D>j$U0{Y3TVMt0+4dvmwW=epY7Zf<L+JJ`K%
z0zhx%V5L7xjNUZ?C+CgLe@)*%wzr#|fYBk8_jGea@g@v3D89HC6!&h-4-m!Ib7Y-C
z=0`wrVCy~f^*vMFyNTlK8~1N~Y#{fY^AC0B2f82F`ho7p2D<kXQi8gt`vD^N`o@8c
z+|<V1DE7ca?%KH@?;h+L203^0+yl%Y=g1&;`?|V8290}AE1<j!W?^Gr_r9)WkN0id
zm79DcbMco^3qD3z=D5)P9GT;JhdC~Ezd7Cgn-gTVe+C0d_m2&mJbQ6@FKjXybp0V2
zWExTo3#1$5|D)F+1F6Fx7cP8muVIlvZSyQy<i{ZV^FOFtWK(}&kM}+{0m_Cw-s|d5
zmOb7(@tCJQe&exYZ<zM@Cnq+Z?AyqqGjn@C(Ov25+U@bilY6JZ9)!&7@y4@nkXq$#
zoclYN^VT((<2T40@7*{ELHBQd7WQ_!``3mHbSwP7krf_A@35@!r@0j-72DXCgAKkP
zuSv<!l{Vju?;DeQxl&senBH~g@mL2k?JvDR`5c-XR;o+Z7v(m83$3v+IRO0J>YyWJ
zp12HEG<5sL?&Zwv=QB^dH~~lg4d{kR3t-)uy;KgUt;dW#qGVcK(%zZ9n;#}pcWun<
zwaPO1jmiC9D7y1_OeALpEC2)f#?1cQOB>oi=EN&q{Cn~`EA7R{evAhiVfaF3_Gaef
z<=nS2Cq7Trzhy9Z@=AAdf9~5bzYs{~<QKX#1DiBwFwE@CURasTFTOBvjhWfZa~pU`
zn*3km|KGq^hi>x6TMwH00e$Rd3l~4Qw{YPF0&OpByl<nm7y5+3<3GcAGIg}ZyYBn<
z6)t>xZ~J#P&h5L&H0Rd2twR4-w*D`0(Ed@eoqhp@9OnDC9OEhM7-QrA-MA0UQt193
z6m<(s8v5KlxbY!Q_u9GFy8T;Z%7gyw&IfnrgXGBW&IfnrgKYk@J0CP{;_iHKcRpyF
zn%>Ft!8<gbt5G~x^Ni<eES`J88PC;v;<=hVo_oP7o_irEo~sGtxf;cDH7lO0dBk%y
zzj*EiQ9M@@$8$LYRy<epi05j4@m#|15zo~qp4)Q8b6Z9{S98U4FNov07rqzbx!S`)
z@mx(Ro~!xBb6X+fxtc4U%iz<A=Ux!RbB|riJnj?EwO+B{DvRe%Qaty#XFQh`_loB}
zel>IKnr<+8Jonhu%;TQ%To*~2Sw4O(bL=W2qF(V_on&u3*TT~q&$Y8-#&ajHQmqh-
z?uq9fyPSEvH=cX!mCSK7o;ykL+~Yi+d+d7VxDn5tWbxeNcXB-Uf;gVr@`&eZJ@MRD
zoOrJ08P9FG;<;K-JQws6iRWsfcy7x(o~ud6b6X+fxz}ZvWW&XCuYZS!bN_c9&V6s@
zQ!9w#vIW^26wd8lD_r>ctwR5oCo-32vF3=7F5)_^w<FG*xip@+G+aTz^Kb>x+GYiz
z-Jh>~8qYG94pb1*9jZ{QmO`Z!1a<#_{zth5{HRd8^H%2407LM~`ICUHAh>&+L3{=j
z=m7;$QD`4ShY;__*z<u3g1odYQt3Vh7|s{q&fm)svz5{PSd6|5*mLvvN5j(SC4`oU
z)wfhA<oZMf;nzJ|PqQCS<3~T^=#9*!Z06F(_EZqLdA!oq_EZq~{Q!u7B<Nsyw?e_+
z*I1420tgmdHvfYC0uTbgAjrvpmmK3CVdoL>^5P!i1^>+NWxRZ+f{-rf<=w=~-mUjB
zUfzcvcQanTleu(1c-dP)r1ww-p{fevw+~hjXs#eAOoSK?5c&XP1mzE8E@8R$(%l5|
z5YSya_h<!?OCvr^1lWr0d+6Qy9|tMOkjID_@q3vdKxRL}#AbX84S?!Hw&oJ<TQZmK
zs^lhbB@{H?BNa40E)_K1V-FhN2apOyjc=WQ8w-H_0-B1}Z}(Iln*i0#^RKZ5+&zx?
znZACz4{_W*fJVUhZ)^*=l}{tocdPQ)v0Di6oqJ7Rz`cY8+)ETPo`PCZz!-8j;%#WF
zC-)#=46V9${#EK9&)y>CtRP}c@U72-(k+S@-<`RH)`F<}H$UtdG(JW_;|pFvW2T(c
zQWQ5XqC}-j`iUO9IgekNOSE1}9T)|S7%_hj)uLAr5(js_CBRDV3cW%Y8J!YwWP;fI
zE;=C8AaiL38fu|LgcmgkAjee43>6b9LV5|2ZEyBC19kuqnAx*Q4k@P({_OODkLcg+
zgAWwx6|1h3btWx>Wc9^6R^b_hh^fYCn;DW5dVD2kF7UFR2f@wY^?mf*SmI?JmzH>m
zo0H$F=;3xO@`8I%pjF-qh9E5S0{Py}Un9lT*Li1XnbRJCzKE9;fbQb|-#}~f0JNcB
z<k7MKG#2JwU@N5M%%%5bF17YRLun-Ya~6X(*Gnoq0KKREA_kFtw040S(fTAp(9cVU
zpnupMf;REfIx2<1zXp*|>mdS7n*TEEfz&_HH7<Qfr+e+(4XFFp@1atDfAskC9c=$J
zvVU3=itMm|8nb^FT=q{}=(T^E!~R|Hv40nW?Vl!N|1@TEG`s!NJnf(6Z~rcc?H}<X
zw0}A;cKfG!+CS|O^$}0|M})lWpT_K8tH=Ja87{MbT95q$E^-7y*uM*jESheE{nNbd
zpC)DhG++DI3Tyu~r~PB_iQB&mV*AG?hQ9XC_LiF;ZvQ5k{X6bs|2UAh{bO@YPR_J{
zZ1M}e_OgFH445-u-Vwa)pF!Wt{@L&WL67}&uxGP>Y&Hygg|63Y|Ja1s!~XFpv2On+
znf*Ji+dnobHtgRdw|~b|w||<H{lk1NRr{y;*uR#n{oBpwVR;9;`8?mD3G8k@59QbH
z=JV|4^JI4Oc_QWW+<EpyLw=~{mmjK8e&_{9eyHZm57n&v&<nl!p%?t}L$%=iP^`V>
zZfaJ3sOHWO)x7dU*`&`eKNJ*$@<TaAD?e0o=Z9)u`Jq7S$`92jKeXk{4{aIwp;+Lv
z=Z9)Sdy>plC;j|TEg(NsU*8kthkC5<>G`32eNR3=l&|lZ`Jt_Z^FuEL=7%z$pXE<t
z?rhHwwO$zcp_7y!dfX#F^w@RE4}IL7ANu%<nPZ=~=Z7+sz4@U|O6DBKGe4A-?adFh
zP`L9$`T8ACbKQ?L*O`F~o3Ef!$mn$BhgwLGdrGOb-Op!^-N+ojOzGCQGLv7R>VJ#n
zhhkQCoaKkUl9~Jx1eZDf`84xGHM#uIR?7LInooXcD@1<i<(qe<v)|w@zChKb1*(tV
z`hO56%zUbDtWo_ntx>Tp2Vb1V{NN_7Pa#DY>r)%!g^l3?R(#%7z@pQ$1q#lw_&hz{
zI8ea)RJK6tQ~wqi3s|4JLjR-a&*H~4Z2%~23@{Y0oSy-70n1a944{qBGagKLDaC(d
zA47)Ksi)cFfdW>iPO-0#0faM!#VI@oR<<c%{}&N+1?0Ie;va3`1hSrQ5TpC1;n+{l
z(!PM7qOU(S+wCVtZWK1M1*j@^V4j~WApg05RjKy@IY><d_-26?rM||hao04~q;76r
zXFmYa%}!(g07Fk;#K8@$NP&YFQMq$p#6R-~h=Z34v@?Oo9tH;ow#Mk|*lhQ1;^5`N
z#{J*`Li^77A1-v~k@b&_gM}`hbnhnu3>pMJK;%*SKw%>{yKy&_e{dS>Q132u4;I)u
z)NJ<(FrRy{fQ<@2idW|!p6x=Kv<ihsM05bvCj9rHDD8J65qIw+@flkP-%{APtB{+-
zHp4{XZy+eKX`v#u{xo1;e;NkJG?t%ko_{+Fem{p+Ve3x=g~uj9mDZnr1mW@luk|OI
z-waIK_bc3I?jO8ac<k6sMECXer)g|hfR5<<2dA<81aX_|cX&I1<tM1mwezph{=<!D
zDg7H-V_Sd1FRVWmHqc5Cb^qpB&-JGTT7UXquma)Uw7}I64ModO{}mPJLKD#+H&^Hf
zOoQGLu7c|Vb`KV?eUKG^HsKv9F@x@T4bVdF3cbW~40S^+#}LfsLmV+Q4OFq+?F!Id
zr~U-g_&EvHG<pX#>oVSc9&cWp#<m8~g8tZ90f#6*0}TcY4I_@XoKeOJXkQ1at3X9;
zFrdx<j=DQg!Uj13b(FyVfG^taJl-*$X3)RvOj%?%W*#WyUP9##Knky52*Cd*uY<ln
zT972k5C|dt0+>bu!O6=QXn^DMT#{IIv?_G+3Zw=)-^TktA`zoFwsFrKU>lsw#i;?;
z;?$?1(zH1B-{Ak>7{EWYJK_gz`@5j}7={WLKRAH(DS~d73mfk%Y_uTlmuO6L#peoq
zeQKcnA_k~^H@K=MyFSIZ_*!A(KGICAPf^!+*;t>Vp=#qpI$f+!p*zT|Pu;2ZPb2%M
zJ&Oi++dqxjzY8w=r}f%D&0+s8c-y}Vf%cD#mcagLWPLQt{%IcePxG~Z7ew}tI1t!B
z&VgnBG!Ofy`Px4s&};uRvVSeN{cD-_PjlNpErk6`W>S{E{nLExAJ(75_RpM;_1Zsu
z{Yl#XX)gO`tv@Ab|1OB_-!a&~$NlY}{k6^hO<rZA_Hi;ip7!sUZvP(lw11DkSirQ+
zZT~neKl|6i2{#vyga2dT#^3(wXt_!4v43{7UiR;C*w<s%4EqP01P1`t5fi)u=Ba$p
z#&5U%v!m7RAK5<G{bM%(c$vGfIL2fWb`74y@oyRS50$~ZkK4aj@cv6AVmyMKOx^yu
z*QdPgU!v<%9`?^#pK{v2*7v&o+nxXI&i}f960~VOefzgN|J$Aa`AsXm?4NypOb)>A
z{BL*u7d8I5JOAVMZ+HIZcW6uc_HTFo=d^$Ji3%nf?)azu_3r$SVv@V_zwd$hU!v!Y
zePi~KO^Oej=Z(Du%X&CB2j`7V-mPy?yNoaTd1J3lWDa15SK;H|W+#rl>$S{*1NiLA
zJo?h=Ph=jwmiZ)YqIfNH@UG2Y!WS&KnEMq_>^^)3sA!HA{X<@~Z<9{8!jo0RjSlvK
z#6cYQg`&Vin6IvWgb?C0u=ODZ_*pCjut#Q5yd}(6GoSny{2jgDxA}|w2k0Ig&{-#Z
z`|z95!O2F(ab-X-`x&A-xi|CZWh#sXzSaH2?T1l(e(%;9`d-8LgTx|MFHpE2A8cI#
z&Uw6;+>3wi-74T;Naf%@i)7}L_u6;{+0AeB%Fhr;KNSQ*5N5pHO9W`GLO<Ay@rHs2
zCQ(P7x7Rsug8-i&*g8hMP2v0foVV9e_-^8jgtCfeIygCif8M(FF#esPuXl5ruNySq
z%4rfH$^Bly;lKM=-;sIrN{6VRst2j@u*j1+e5Lb_%;C#h@50N~AHxf(?%nL=i+H~J
zX8b&e&s(?dMOnUI3)o2RtR2lI#<$|>U71I5Fxn>*S!47_eEA^=-Z&IYKNxL~)EcAX
zV6-n_NsdeG4U*`OOn3hittQ&_8*O-komfT%UfKFFoFs`97*qeJyPw0kl3Iqaoamdr
zm}hFUIotg@9a{QM{O`h-IZ(jvofn8+=hf-l=d`076e2r-^+js0CrQl*bon~ze;UQ+
zbogrwzV!zniX+p$+(!E!ARS=+VDt5V@H#l{Yk0c(ipLrxF@YffD5!5{KKTbI!`hW~
ziZ?bt%YLI9Q9)>W=J2)GGEZNBEu&l|mhl9o=h<5WjYkRUhKFBzEpz26b+HFCr@xYU
z@@nR(-{V{>SMdMj-pvo`w5UR;%mE~l9R3QZeHqj)QxU4=gF43y-_uv|>IyN!iPOL_
zKae>Lh^GMw9??IjPX<B}b5^bN9yPyr^D=bpRmRHw=p@%OSFVBk@4G@@U%dW}N@o1~
zuV?O~QE+m9pmf+<&LDcQjg%okAh3z&BLjB%Q1|8n+7C*o4B7z$D*7er2*D}Wsrr0~
zou?uXQZbPEGrap#l=))j@LxgloBf&7|0(n2X6C6a$m3mj`4VGA`Hv{`bv&8}5BPrN
zItpINJb69y6l6k8n^ArrUvS<V9ocBEXu8jPbF65>>aZ2fcbMzxSSJLMek^F3C%&m*
z6hq5_V>oW@CF*5=N`sMpejp0(=O?~>4n=19nQzp0{*rba{5$C#cMrRE+!^?hK)}v>
zL(Q44u`}O@2^_=tW$KS)W6)=@=+FD?H}Rxz>nbYd`NupzG|_w>%bx4`Jdct+|M<6g
zKF@Q8NxyBH^e?{3`ZF?mzRfav4nuzrkPcVKq&$XyVbni`8oWwIod#(={{dz0!v~`e
z%DtbLqs2j#>)U)4U+B?lhkk+t^z9}}v)+LhS66?Q@ZmGCb(+I|ne`n!GYjK2Lytk`
z|K=|V`M%9x<3B+C;DF9OL%9zR7%j>yxX9CgfMWKGM0t`Jy-dYVAG)#n7W{Z=^&<d)
z@vO5S4g5Gr#AgrPK>2=rkTF86K8ZJz1Ni6Otq<Z~Nax@_8{Nz&-(h1Nv^U?vf6ow1
zKa~VZqP|KT-b*wn6-iGIVjQC6fyo0@hKeJ%N9S+|0P_d7@{Ggd_;Ei$&mMXi<?kjA
z3FhkRyYXg{_<HNs58>Y#`g%7f{IW^-t(-7{QZw93kof=p)gQvQE1faGpweVcn31oL
zmB%ZX`4K9x`Y2v9#Js?Z^lJ6Zcz6(>w{B$!z-I4&nySm%*tGW<JiQC>NGeLk;CoD}
zJq-RgV7*;OlY5+m>PRa3HGpsl-UPo_SASTy_@+Ilm&hDK#t(acgBkpR9(#X)l_Pu4
z%f0L}_!d5W>|o?NuP}qpVIi{vl~3b4>^&q3JhcDaO&_J^XzU^QYYe{i`=E*yR~US}
z#0P3io%4&H2LH2U@DEb<pLt$6KPi<6!5IY#8WYeN{~A`8wJcM`o10%{ztO{}B=jGO
zaP3u?{8wR4iEBJU@p+@Kazq|QSRXz7(yL_jQ3ywWp8iS&X1@ZvU&-7D=9MczG&!(&
zMyCjMBqf6d2hFd5=9f|CGL<1keNg8d?|}4aC_CW653dZ3F7xO<hXM06V8JWdEFl~X
zBsS*t-iDRpKSZyuFn+#|mAPIa`~NEJKLGIK#q0g>0Db`94${Cm`9QF^*lW%z^>Q0Y
zL!>}~=cc?qf>I8F(J;Uz_5kRiYHVns=7ETwhA5TmBo00@&rliSi_jeYQ@s2J3cZBy
zn`n?Nuzvav(HL83jK4x-ybA@;IEP87zmI}nC*cu0_;Ka;sPtu&MzcMI=DUx?s(cki
zK61dh1>c?J<k*65WI4T!=aY8PNX#EF6Pzkw7X#3NV@L@Br|6~MU=G1A!1|DeGJjy8
z{W%nw<rz*?sDl%BzOwair5%EI_BaF#KP41WmKDUrbdY5@F(&>34gvZrSts;qWH_-t
zdA0L5c+|H=mrcn0G5v$R5%PTtbU(;Q0jYsU>4p%TT>V<1``zg-&eZxla5wwNjp^>^
zrZ0aN^Of)7kn#WW9(4Pk_<1OB=2QO+VlP}ccj#ze=DA1j#a$8C|7QB~U+kUk{_TnW
zzs($;yixdxeiX?(viDGHW+HR=p3LDB_%(ItK<1IzLl3`9b^F8%YxT_Gy@xV~aR$Er
zB-4E>;ispM<oh<?O})iFf65%r_W@m|7u7%QMfFQMs)@`a_iWMu`MpK{Blw`FR3vkl
zu{U|c;+NR4Gxsm`;=~*)&QSli##2W{-h)xnsECQ$;@^$>7Dg)<ClJ8P>?z}mC_;3g
zm>~g^XbmwQv;#hzd1Ug&?8QUxxq%bvPxSvaYBTko8<0OlZzl>QU;o4lB*=%?-kCYP
z-@umX{tH$gJV!MTY%-_N{+it_09g?$K*-u^^6MZ&KipJ6q5DZgK0s$kZSSG2mhl~u
zN5wLaKtr4r%XD8hT1^)?tK8;)u$}@T8VH>12l2_T+oke-x>SfQ-m+hxy*Too1K{RF
z|2LUf0DS@|U1GUrh~)vBSk|5*EGV3Rcx%P}{8{!K9Nevo;u=unyBjgo{Wvd?f7qz`
z-CM)fBVLcUq8iui)i4?tD0wXi|2_Di#tzPjtid?~FJ^<To#v2C$cMlG&{o_260Klr
z73&9}bD0U1X%_=M(Y*!J0^C&e>?jP?7ORS`0Gx4XCFElV!fcY-_3(96{UB>1lG4_`
z3^DO0V8r=5=+Bu)o<yI1<etK93`98Qd!(<8dFF|}t#`8bH|RUHuQ^2gYu5bx4^8|g
zwPim0=k%8QJIBDpC`yy03<=Pe=?lMoWBS622R`w_*{@=NJMqY0{(tPf3w%|@wLhMh
z5D>G2MZrfUT5O?J3>Y9mTS>^{9D7cnm5OcEfI<X|kdgq>g2e(h=Z09?daJj$58GPp
z!+UF61+7{Wf)GFv5D`TMM6L0tyxIy#$^ZMEJ+sd``^+X$qj-OR_9r`gpYNWTwPwwl
znYGtEb~v^@yzuazy7QCT7s#*z0at^lCdeD`|606&^WPCGDSWi(NbMPck#;WS^KavM
zcYMhv8auoc`9y|UkhselfZqela$z2#Zc3KH=Buhd!*jd^kb6~8{an#2q{Ke+ZX~iN
zT=dqgQ~ALT&tAl*d5G5aAR)+wttaXk*qT`s;!OLuBMp-V6k;;FlCJug&n$c&>K%NA
z!+@Mn9D&H;A9EJ(JZOyM0wl%n_b?HDE})R#G8v_kVTLgGz5u0zPx!pub}u411HTBN
zCfck|q8O@~|4QV46-q1d=#BWfp++<$O5W=+8NT)ughR#9LBfrdD9E|HScF9{)t-&3
zdH+VZF}nP`^lp5ErSMHAfwM1@@%#sn2KMhli)y|v;PK<N`wS0iUU}&By>85Xe&eek
zqN<HEaNK~rnRmyt_#oU^j`bd|*P)5aRt?;sw6>ogXm7`7JSfgZ-^YF1)`UHM>9xIn
ztG+y-T0*7xvT<T-%FW@Jbo}$GVnBbAn*qku&43eoL{}BB?tEUwb{jHR5!qd|eMPY_
zD>u~ml|0BkKeVs~bItHcr>zl`Y9Wl9knamMkw)lA<9t+aY_~-wRD*}6z~u%qfYs@d
zy+!dMRXh}fSM!i=A)3K({qI#6W|x|Z@>lI0n-G<Z3L1&+Rk2irxrorl9wJoqqWUOL
z8Rpk-H6P_EfN8=FX!$9f+2}^y)&dqv{8Negfp0;miWqLJP-@8di$V+yBLgSU*lM?K
zCR(7m8}T70x4mIOl;HWfX=qGbj_dw_MksRb4zI~#?L~#&98P~zWhvfBeiyw=#$&tH
zC$pYs-LXm8tMDxO`w&Cbc1TE77#3YZ2`JqJlTPer9ULgzoU8$DBR#~lZcO%W)KbM5
zB!R{s?W!^{lH{&RYabI~jQJ`Cz7ysQ>g^2b8K1UjP2I_Dy_um#w+t3#DN^jw0mL3p
z5#bh8fB3_gBFRG3l{?%5H(5ZdK(W2(u@?W84!{l_8TYlAPK>@n6B-qcn&cXDNIfUH
zlAuCQc0*8-N^8+ytNMl?T5ac|AhkLwRfN>z7bGAz7NV0EueF(bl1aDiXYdXr*PIq`
zc+?{l+Z!5m@IHKF>EH=-&<dWy(D*3We}vLEw(oS7RpOIieG9R`tqFL&Q-67Ti?eJD
zKCm=Cqi|z!Y(uI0tt)4lQ@FM`wgx}fVsT3S_>8i`=3*?`DdU%|oYML+aG8$5x|_Xq
z--<Mj&ls|)_(8M)Y4M@#-9-NpjvXqi@7ca$;h}72(MFVMIJP#@7{({inj*0^VZ<Ma
zZ_@R^*X~X)D|~ML&M5XOl<~{!&+HpscqqMYS-G?9%DzX!?Q0Qk-s|D?L-D&c>zCsr
zT?y8arPBHe<Va^V=?U{%j4z@s>+3`}*7q&N8X5*hLJmZbo|Mk`^wRq7h=A{X*(d-e
zg=D#bIAbUh<MBl?N=_3&c%<koD{n6?Tv5sov#c$3#;ho<FJ~%vIs%^yD~|1f$X8$^
zIfNVop|?Wld-0Jg$i2C6Eta}Q_Nns7EG=Bc@<2fpJC%Dz)z8UjaWj!rjwG)#0ePfk
z0^v&w`SCxjwE`<j67_va*BW?Cx<7PA{rL2jP&<|(?Zpmv9qK0Z0}U4SGt_)AL+dD(
z3?%DlL*?OyzWfH%-w-_J#4bPF(%>|V&nj)G$Sy5fQHIYIYS9&QtH5HcKT{Hp@iBfz
z*FYc}5pjGLRJ0dWbPiNBn<~n00><;Deo;STMn9K%`iVDIeE!8%P<)`NM_I$^Wkt`;
ze_5+%qWv$ADgDfXel}d$_ds~zio*zK^s`}1R>S3oi-dL}JEgITES<@OZURSO<fws~
z8FMug0o}YOr2tXHx;KpJWlgykQy!n46hS53FuoUd5GZXJlU?dW*Otb3t%M#{SkhtQ
zeH-SeRG=A=HTce5G0Hf)MKQL%v`A|WB;6Vt(+hGhbE3d1u<;{gKR&w!bWn<DLRzWM
zAd4>(ttC;gUU|5<XpJhljm6HGH8F7PNQMy?g~yO7vO_u^aiy{-b%brfy0WZJY2oqq
z@p$_vs^iDBeeAgZUf6`D%-Vmet=tm*cgb3(e52~TvCTWWaqeXPq4nRjo$SA7+WT+C
zx>Y~T6Le0d{~oRS?{ZuJ?S{7X-zFV&`pNw__Jc2VN}7HB_h^9S%}PlaKDqxcLH}K0
z>%U7@IOU@M9_{wu<!=97vJd4^Ki=)XQ6%iY%WeI)&O}Q8Ejcy)cM15cu=n34$CRAg
ze>13q81)tJzyIE7Ow57)?%P>ji7j;dV*6aDk)FTmm{T3Q{78$l9A?Gx@z`HjR6l3A
zQ_W7o*qPO6%d5+ZJWG?2(N$%jBgggwd+WZ5jy#JUIR=)~;sas-qyMf>bl``*4jg+l
zWBXjU1HTB{Xv4x>ematVZvJ-m;huk^T6f?Xbq|y~%dhNv7(MtAhMV^)P0U|wzAxuK
z!HM3QIRax9$dSoy@<ZkpyKuKs66nvX-40zvL5dCpfsKxn5(I!A5AnJ=%LAz4390#H
zNM0DtC5MNK9{NvMj3kIyv_Y4bgX1D$c;Z<(Q^WHS*uq#^p3BFu6qM;%9aE+!O3B!s
zD5GvjX%(%{YLpGl&+6EmES<090#*g;<_og2<ck`R)T1jIL0-sGRzM7hHYEynwH%*8
zGXNi-?X)opCDQh2r}TN@(ezo>GojC_-F0=DTaAv#PVwcqcDX*+c2b{b2I#ZmJ4m0s
zhe`T8+STWBrCxaLNY-Z^$F9#_f?6}BKI?`pRiE8fSgVpnpWTMorq8-1_Vju5UZv0A
zT<NoFi;=F@XO<K7x!kJHCSO?~#Cj_9If-*mpWQ||NS{4PDABt5tXpPA`GER-{QXM3
zL?#;L<L_4qS$z2KSDkskUnt)1@tW+tvz9cMHaM(NMR-eH<CNf)z8pWA%dlV^Z<hGg
zT8g*(G2Yw#+@!aA*8%1A?@90X9QSekPxklw+Rnb;8~Zis{a)2*%lo~-z4!ak>ir&;
ztN;Dp4Vn6WZ&E-6`F^jP9i`fMxo?FG9k;CnDTqo1_g<k*BI@N{ecV88?yNilMeB<Z
zGu9Wv-K)FS61<z2^X0y1U#T;C6?uhK>wmQ`abN8#QeN#V;DssKC|~UreT(WP_|mWT
z#y)+oulDH8z5cxUV5WYDN-<DF4VBn3sBee{>cc9A6N+7ape5Acgdo94Lq%?+Xhk&E
z9D$oD0uNnS?c)=MpD6;9DiY)KwPE;~!tiy3Vu(FH8wM&Cw(PCD0lJt=1GOJgj(@s(
zDfBPu`Ip}D^ba$-uzQa7FGU)9L>o?zTK!9vu74@JZdoP#OBk72aR330e<=ich8ix%
z?5mCV@;n&E&PZdx)8z-iCZ3p_`W`YGa|J2DSPaGb>WpO@A^6jSSYq7~3%d{n5W^D^
z8;=1LKPxVi<NIOjlt{yv+z8xHkr=O)E5Kzyk}k2np@unbiW`x+HQ2*wEnLQ68e2M$
z>GhE!6o}d^3Wb5)A;$DW*+k)sV*cIo8J~+>jls@RDDt)8SSu1*0Y0!H#2BnH03Xa*
z<$-X~8cgp&DQ^tJCl!h@H;ykeOa_ImV%X%soF+Je?kH_x6k4X(PO4+e)bo#aMt>J3
z>o0X7Q2-^)5o7>u1SA4Y!?qd7T{(U=N4fPzY<w<$wnnJGh}b3iYiU32`fJ)xS2Yr%
zEP?)31nF<$A)^`n9qsCGxhiqL{+cLO{WT9&W%22+k{kR1tV*B;-9>GIY|%<a)ZQZy
z86@b}-$as(6jH5BD7FQ%htig>h1#L*SRY0z&|ipuuhEtgXkEF|-%!!M2-;g!f6?HQ
zieG<AwEkAu^tS@d61I*>)?dw+U4N69*7_TPj{sb61RF}_KOFr%-u@nMe~-7n$J<}G
z8I|_K@%HzFw!db4^*q0W7ORKKxvtJpv+VgDN30;~j<fP`3t-&kj=|!pT)a%ERc_C7
zEf=O>b7dBmWO4D;7(C*txpi2Q)r|Sqn0^h^K?nryUFE%*)kYe}B*tAo>(0kI$aP`q
zdPcy7m?;yEt%)>#NxzY83>WRIy9ngfYE`Zeoec*UW_g?SS0$Km?SvN|%&NP8e~AMt
z5@W8-YW3nP;q-&?Uoj6A<i9d$O(3%e-p2EZ&c0ai<~~I{H(zQsV1K#Vjd|m0Kn%!Y
zwl#j8+RWv4)|GdC$pKfq**V}7#Q~)#m-mrDL=-GkC9Sv{gN0u%6HG#t(d9|&?VR41
zGl}th+@C=};HazZE?}7|CcM>l<E^XhC^og)ZcMh4FF2tPa>qkpawTL19`q*Zaxg}1
zfnF$<Rfefr)GE0OlGzB3!2*#Yq6koiogeNs{@uj;;Q9XgfbuLqz(RGGoxF$&ff@AO
zaaJB+VdD;x#J}-evcTmZ&tsVZ)>o)i30(5A0b$4RAs0!ctV+OQq$<SdUF8|s^HD7l
zFNqf>&36gM4sx}GsUMen^+Ufgs`_y;xKS&<)at6)FQI~%`mxW{kL<epagX|ecgAL{
z#=we%U92F#WS%ORpGvOL0PlJU4f6{&$Mca9NXlcx)cI74XZrirf-tXG@zJ{?y9H}h
z@atq1{wQly`jQ(i3JKtbj}$jbz<zEKRkBm%Uz;)}*D%C%R4HE0Tqjnhpw1xIxnua8
zyfBH5*QH#5Wc}+>#*h{3x)jn?>r$$6mGHq7WrMna7;-&P1)lWok0<41lB(6J`Bx&K
zCMqS|iYI0*5feX393_7#Hi`s=+*yM@>HEWl;n+Lj7`~OdCp73lsQEzFUog+?zzK5-
zLyae)+F+hp*3F^x*7hBo__)V5Y0io5!Za~XaBEwJ2+_vsyl~^yxeSW)a^95ZnF*kn
z8Mi{N_HbeqaG<E!ah!3dCfTX^oG)|s=QZjX<}kXm5Hb4@H<d_3&#c2rUrb1D8-ZY&
zTsfv6a(bRg3vfkZ=Ia`jo|rZM7V08r2QuAmW}0Bd9<`b+9NQRfoShqPyd3$d%;yAf
z%z=)^4k#wu-bPg9H5ap~5j#1rYSv{R%t-X*_17jp-V{!i*Ei&hSFQwS2Fa1mt(qc>
z%*!dSJ0mefQ&V2Qj~H#Y>u74?qM55$paeT8Q-Mf~>mf`!pp1>6G3OC;^eM4)B?o6v
z1~QZ%E&8{!=r)w*khdPr$0a^o%>TngS0k#d0qu`3{5PfnZUOmd>`g2i%*8ZeOpwKv
z1qbTB0>N;0Ip&Y1O!kCJ=><}*UOE~@_GwO)t^3Vr@b_soOIA_P8OD@pce?B|(e!`B
z7yc!^?VBpMq97+Iz%5AVfGa;&UqPN);hzaRSjW)1r37A{+t$~>UJ*e=m{sj6Aq3^l
zh2<nxBT04VDlG{k{HdJp4Vr2qEEY8=+N1zwOr4^77X)kwxRY{GREl>`c2cF0KGvFO
zeo31-s8l+b(0c?Ls{?s@U7j1iIDzSSte#{lF;^7}T#PW@z+_d<+ow9*))L!_iK~T)
zDc_x%9EiLnw>MENAB#N^j$sG${b+d9vKTDga&zdaI9TeA>dzvZJ4lwpTq7pr$!!cA
z?&y-%=B~lg`Y_}z&PV>9k*Y)eS2@D`-%O;9X}_vKO!=uK5CtVWw@Oe@6XF@ci4T`@
zLt}O#S@eXa6PSAzLn(5GIkXXJT-yR+bM8N<QL7+|zNfx(YYbI2Lm9=XbOk?7G=lM_
zAAiB4fiw^@ktd&yoR(l&QOjKTcxJqN`{QxkU_dlcFO%arv0p2}DS_dUR(z$2iYu?I
zJeH<vN?^t1DVTdbc^U=M0ryIj$eydbkm<t5v*NwLeKxpf7BXY6cchKf3?BX~3x$Wd
zat8?>=9;czpifKVnK=CEnBOKHb2aIht4YCx_g_ssb2ahIwX69t^bKF;YH<J6@MW%s
zFLON}-<5!oo0i7{b2YfR8abM)k)yflcqw}Oe&ZWH%+;i0u7(eDHGG(BSMy`&nyaB}
zu7<9;Ci)LdpzmHfvb=phcISsVt^Eg~#<A(8BS)o&V)%Ya{G3o@MS9Zv7e75xw5PU5
zsIdg$GUo4wKfd;~#C)+xV`V#2jl|Z^+aJegQD7Ktzz9oiuCoj+<+2|2J&WtHHlidw
z-1yCQE{GlkQ~TZTI7=3RWdy)N_33bDOlT?_vZ>mcq3q^rXEyIYN#WsouD+hHufyDH
z;m`wRL$<{)N#b|Nn&{$fSg{mp-q{VNH-Bz&{!{;4j}HSic|6?Y+}aI1Abj0v47F${
z(q-($_dvSw2h@7O>N02dnjvedOPv{bryP}riDPGG1DyUep{=-^^gQl%Kaab@p#--*
zjoX^7Z{z=rm+^1^F8<qqe<O1?@4+R$5&sai)Y<$3lDjfH1HY%QV|qJqH)$u+W6Z*#
zPcXf8xUJcx(rd%*{x|uL;K-aOReEbV+ndQfj#VzBoW)mQoigJzGfup@I_lii!VE6%
z?>^Yw<Ys6M<_m&>aXAb<eG^hBOxuG0Gq&Tm%GS1ROlPB_t+Jsq^c=vEIWH*Ml)#LQ
zB)(ZC^>6&1{<2EyH72zhzbCE4-L@9o)x4~ddL6fJHdf$nWX|I%sTQX4B=Um&vkqd3
z<V2l~R+WubW@9ajXHmZ+SpBH=R~1}$01>{<JiR~aJhDIBzK+*JSQ`^Q`+1aiWYD`M
z&a(6JQ3Wn4ufI5dRQ>0|XRn*p(zaf0Nwy8D$LKva&N?m9`0eya3=1;aE(xWt3$?d|
zHohAkv>o4rTG-ND{Maa{Nb%qJUnxo$iV|A9?WRvarL$^JfjSOZ6OOHF%LR@fZJ*+E
zd?9Ax&cj$KosCsJTdRwm>2L;2Xo6y^g&x&VFoaF$`|P)HuXTLJ=Rpc}VD~F}{~yY9
z1qIbo;w(R}AMU0<iMwh2FbB|?{tO>0rF;%|yI+KK3x`s(wypP`D0Ow8P+e=DS4Fau
zMY4+_sR8@fs&aXP<&vz*#ZG(;gKkg(pw9qa4liuMG|SD;Mv9(u7JrS!=EQeaJ2flc
z#?8v=F!V2eDwY+O72>VzXDh=`zY^`SE8M<HEtOd}>(wyV#=fgmG~`Oux%Cp>P^u@P
zbSTw#-1Ts-G%;%>{Lb@y{T}ob8j;u0h`b7+z5>bV7GyUX6#mpQHjPQ)&^K+;_1Z&<
z3G?`z%_}I?Pq*XN74WD3&07k%Fiq7}if|IeyzM0gss`anf@|?RxzgwY*e_~M&4z^B
zU#1jUKlZmOu|n<uAi>Q~;pOdcwCH7L@wKj4cO;2*g%&GTum98)>&w{m$B30JTZpZr
zeE(d$sjdLZ9*sTAI)YMAb>$7zmFU@rAkgTb-K;Bl(A5jd>(9$8uD^hFWwmNpBTm`g
zNctX>RLCiNE;Q&RkeJmc9!>NIq4xD8TN8~vA9fyH7hc^0zT3l3?+U;3boA_}u@pB{
zw7%{+)WqJ-va{+>E3H2@zE1ELYHvd7b;F~vrxAZ`c=ZZ5{>$NaHbu`yiSG{&S{K3Q
zI$KceCpyde71y6ppB--vL7U))X>SeT)%gTxS$4gHUdZ_o=A);{x2{Bgh<*y6i*gpd
zt?H;+g|+ZthO=ZRDqN`XOGmKxCZ>tR&rX(Kas6r0#!!27aZ@zb>fCxi0%LZ}ym)0}
zukK?S3(}y~m5qHW!tE=**mx!sxCQfX*UcXkZTuGIwJ-ZDr1~{XJAV;tbzY1*k!Laa
zVn6n9O2`iZPDjAgiVL^R|6KgGrP0P~Y!Npj@)7JJfMCv&DG*T^_=;gN!#-!pSMhU9
z<Hf_n?W@7c9Iz5i{}&d2W`v8@&-)_@#2*jE_JxX8Ig98d(3y>(>xUy2lf<!eP&l?P
zo?BLb<^aSF7p-s>J%WIY>MZL|)?P2JKfSabd$b(PnD+ws?N|I5#F#d#XEe5|v~b(J
z*7!iKb3TAagUW`qk1C8qLsvV?wmFqAA_%zO3-%cD=i%7l_z<uDg&U`*gATl3%dW=C
zhUc&#>NyDMpNO$L8rzK+&XP&UU@>@uFC|iR$XPN@W%#^H!tIY&HWqvbMG#HLtM_VT
z_^EmSi<HiaucRFVX6N@uu?u}z3iSvz7GqWE!3=C-bJI>*Ns-3zk?_VgOjUw;F)X?K
zBaJtvJIe+-%dSWtRrn%G5i?{~gSnR=kZ=qWc(z50)_rHtrHxsifGS5C&padC-h#IO
z3{wDqgRtVTZjAlaj`jF^oJDoW18C=z)@PU2<FkZK;XwzmCN#Y8092AqYItE2n0g(n
zKKpb>!0fWZwGJ3>Z?9}TvwK2+O6xIzycOzM*C*WGiU@qHA|b-Ook+f|7b2mo+{3L8
z<1Q<0=w5nJ`QiEa!0Z9pUW6LQW|dwv3S0jf`%ryg)|*c#>_ddJ+J}dkaEg7H(~wcz
z&?DBfI7aI*3)bObZJFKt?m_61vt$H}Gqi)#(NoqmjqS8~SU7AC&B8B0#HH}TCG5fM
zWP1=l*N1Lil?G{egb$GLtt;`Ljo7D@aq%()g<r5o0LTBR)FB~nwAad<a%LP<^!ArJ
zH}$GV2QY&@WHl|L-J5V%IE=jlY&mod&#IQ6eZhWq#`~Yb-N>AE$_Q!&FymSL+q{`c
zp}YvNORuKI=-QdXXezk|mD_vMZglNT*PvRd(rQ+Ap|knl&~BK8%AP8AY7V^3-sJ$h
zWw*~g3nGAt(H>gej5~IDv~?FL1yT9A70K7Ed7KZnkQ3(0HFK41HiO2m>f5wg@U-f`
z4k6U$mEhqB=sz~=0sO34{Wku`SJReTL7^_X5~iEfHzo3lBzx}Z{SoJpZQ<r!8R6K!
zqJv&4X*h3bS;JXasIoND_|^7E<7MqI^NM4G*-t&z))SGT0MM6E^Sfxxj&9d|%3{~m
z<&cZTw?Y5fd={QE?`YX|gEH`XI<5%|uiofu>sScXGw~1*Mu&c#nN6$2Z{EFS<PGs?
z`)+?ZH0cihA9sgR0xC?kvg=;JUE#2VU8kNXyUu;`{_MJDmZG%l-bk|Ru2EVNhpAQb
zIPJQ}UAwL??Yg3F!meAmDoa}+uL#4goPzR9<^IZ|Lm9Q53|v*xuv5A|)R<M@)+$BX
zr;%!??2>1VaJP<i%|9(-W$+~#dxgU&Z{O=8P3TcDrDq(3U3G|ZExr3NFOj?dft=Sg
zDgEZlTlEH%!nS7!HY<=XTh*+Y?kkn6@2rm7p2WZXe4iVc1EqHr94|zwZqw9{(^gMZ
zaBbDC_pG`bT%r1{I#;ODs$01Fun{VorV67kG?qpt>^b!UwB4;M|A-EH!L2K24ltD^
z+Bm))c3yGpyaB8&%}J7HT9rtB*0u3dO#0YHElbtO@30xP8)bOcM%6Ti*^|W$CpPpe
zj-3(9jyIFnPzY5Qwqm>&-Z$|Eewg5SK?Y)DuX<XD&z3gyZa6E354poWL?m=T+|msj
zDIciIYRHZm>n^6OyQ_<<u5vx<srFqa9Fck!so8P;;0ex>H<6!6V+s3I3>U{w*Y8)w
zvHsD<FTuWB19Qr`brnLP^~#=!EpJ-qy*j3`PY+mmJzOjAcFaD`f|=LDHS?aHe-6w%
ze2x6GWes1$-0fr|4@1-JkFapQvhm{Y7dP}TF4{JKMEr-o{v_IXeQFBNz`%Gd8hZ^<
zTw|aNT*jV_!f;sfMQ9M%8a}3R04%<hu=o^Pp2@dm-o2n1Zw^C#wD|s>$TzILEUp!Z
zV6VD8C_rWT#ZNDeojE`mZ>%qD0>VWt&Z2t}uejlih6{?~^WP|reJ)1hFMHnh;)X%m
z_UjRituK0U-ji{}MuKGxLt*)q7X6c!9~Q;EjmOBxKG=N-bq~$H&s4*{y*#U|A*Z-u
zIu`r4!P;wM7@V~Bu&c|G>Bt||6~<n)=zz22YL(xDOU5)BgKs%Zt1Qprdv@Nv#SMd*
z-zG4Kf~G4Fuk#u4zRXVyJMwtuo^$Ii<f@@>lEF8GCF0pPu=lbW1~y!g1zv=)7Zb+b
zdEv&apRk@-ti7fN8hau=>c2AhYLSo9hMdw^Ha`!&A~fhw2->8+2CgjlQ1crZK=>L`
z+R*3r(uV9Zyw5a#0ntF`c2hq~W3=}|sJXB=*CH?<G6F)+dl{)Kb1xEW5=Jlb>>Y{v
zLd*BKe{j`t|DbEo!VWp^A3W|KJnkQa$+#OPyM7;nId|MYc-%jD+&_5SKluM6|KL}O
z;UU!aVQtX(F}`=+;rMawQO1vFzPIt?0=Q@3+qI7$`-gq}W5~1r1)mJQu&`A42Rkud
zybA9Ue0z1ri+8|^#xG~_b%4cqF^5-;KhPU5rVl|4l)gk4OC5a%g+rB3Pz@J#&L{YE
zV!W8cMQRZFB{~P|_^)uN@(a=hs7LjV?ib`ZEBt~SFMz8e)i0RG2k;9%GzuAYJHDlA
zkoPfAm`=6}(>UOjlr8uu=_B;=2438eF75AxkI5b6g1-~)kb_8NGbi63nROR#Qyqj~
zhdWQaKPg{CvVZVBjQ8evzQK<Cg7)!V&bLiCu@d9G++&^IKz;-x;SKC)yf<K8!|rV&
zzfhz@@K+u7MtdJmjP@$o(^uuH6!ofbC>>7Q9`~1uDUg~?%J)odQNCx_f#o`lTa*JU
zNfA*%bbBQ^u%6Ri!7XaE_e!NBaZLWMX`xrJ#W&jfqoa=Ye#4cgb1Nq+`$l^U60)?6
z_CB6EgigPz_OY7kKKoz5J`e3x>U)B^ady8Y<qLa`n!I^kV!YQK<lU?QHR}5!0u-jv
zw~84Z5I3t;9q)F(hP%R{n{m7CSw7|ny8D=S`tb|6)iWR7Kp@O~K=AGOx1S>eBXgdi
zx4velDw((&0D|WbydE%qQB{>V>dWR0p6js0m3&*0KUNF~|Ij`lT%jCJo_~WrzvJV<
z?BC3I@LNjnKJxM43XBJrU_7`aa6GuyJ|3(hVm!FSj0b=B1B?gLJ9w1w;QmX^craJm
zC&q(oQ^$k3QMNZ8JX4MbV=$Nl!R78iaLL|cjxEE{xETZE+h$@sxc#W(!4((}F2Q(k
z$(xun&+*{zy5qs{h`tlSOo=65LB)V~5JT4-4!%we2fu=9gW=#O=KWC(2V?x(9S+V*
z9uBVdj|cCd)sy5NJo<QW1;&F*FdkfTOvZy3zQ^(4nMWB9c9wUq#=z~7`Jd#7u-9H-
zJU9dRD2$eGn7>aMd>KjpO?SRvPmJj@T*myj-3f!{{TcHGvF{qv<$&-$IbrZ*XE`Pe
zF7Htt>sjp%3TI$Y7>jGvl);<d{Wp}vS#qu!6yAps8}zxG(7@{%KS!H0SXiJ2g@;Rf
zuY2-%Fn)4=-~x}}VG_Lcuh3(fe5WeQ;~8Me<QoS#{^#nYXrz<If6=N>?-jy-HU2v}
zG5%YiY`ym~{>!9FL!8*B#(yU##(xXCcKr8q+Rn3$|El~{?nD2C@n8ODU#CWaRo>q7
zDDWQ<J=Msorje({N0gMu<0lO?cRrsx{u@o-riXtq?`<r0FFcD|6^@N0Mu4F;Y6$p|
zw!WU3huM1_S$anq0saL?fc1<tGsn*x0p^D6wE0fMHDU9G&`D2kf^xRfZ`1_sR1?rT
zF#_!7pVD1{f16vX%b`hE@c+0gloHT@o}3u}El3{!otzl|E%+$MfBSLd)jt57p~oum
zMG0?a-<K&T%K$Jx<0pq9Lv7C|B<jxa!z4c=)~(#I3RC}r$9@X}#(v%T3@8va{!6)*
zRv+OdQhkW}jqzXpSNhFS;K}YNFdtzQ*n7nHxXB;NSg@L(;l%x8!CJt{gTY6PfY~%f
zg*{7q?(<N2J-^Q#4_0+Y4F~JGbLIfA^5_v^R33Lo_-{#N!Q|AC@Pzous(xaeD?`=M
zg=`4}#)H!_UDFH)V<)ZUCpydffxsEn7!v*)ISz-?w{b+c=Tfw|M~LJHj|Yd`@nC0p
zZ&v!)Y1j_%)c9&dL?6U4;UgRq#;%>&*iF)%^M??=VPP=q9*OZTWAA+_X?%DihT#ro
zI!pE=xELNj)AV1+M$!QBI)r14I@<v8cnlC{$N}QBF+j{t4)Xw)e+~VkZ;ZHG^-^xj
ziUHy=2-F`tm~NY27+)&;SBwu^6EH)>jN>f1oGrQ-BraDbksKsetcgM5dq_C`H#17y
z9aT_gU(E@`HnYj2!~-A*Jxt6O3eP^k%OUJ6j2EwfV33J3oaGl(W61dL2>-ciHE5hQ
z?|D2hqsEvqxV{<#!mHw+afgka<s3JLY%BxE4EQrOVbGKZ#*eXw^K#4=Tt1yU%=(9r
z5yM$Bmg10u$d@R2$U)>eoS!EKk?%o*gDDS=B10brvQ669hEJWS!^>~AZ$O!&&Di8N
z$z;Teb}u}}lQW#<1D)kpV8dHEqzwMVnDRi3DSwT1%`&F^2x?P&gPyOz`jZ$>h9IE(
zs0fK6Weg%80{`QYV}4B@Bg)~}rtrd-kCbC21Gd#iwJ9rF=QIv?17MTir1C^^{UVqt
zi*}$t2bg0|hc?DTh#qO|!`Nr`#X?x7Fb{9d7;WCIy6&LSX0x7=-b8I*)&|>`wVkjp
zYmZ`I&U_#C<uIRp$<9REmq9+o*>AxNjbG&U-)ucMx$94ieYwqDe-dC{u7$#|m4$tY
z>2Ob@)-Zv^{LqfFFX4Yv?!>*GeK0*Mgg$5n`=G)v(3dug{|XB@ZG9VUhnn@ul|X+G
z<|e_-unKo0b5_v5gSmIGFt{3EGd>eJeV%Jya>8NZ7uey=;w-De0{EP^9YQQlV@G%{
z2!X$-*x7#&|3>D#s~i&e?kU!tIGg|B`Vrm!tL7cLf!?7TXdkn*_<Sf9dh34~>yjOC
zqCOz?=~>FYY~m7x<XpjnLLZmR+Ec!)aeax(8ayU@z{|Vde8b<sF>-{w9Pws4F1ng_
zW|Dp@sk{C}Z0@y<bK*Dg-?l(|^Gle2@pa5N+=dzpdvooqN7}gl1UdjCPuZIrBR!rA
zUP)rHH#c#{Aw;!2*xuaK=GvQ^I%{w8#mIQWQf9&l`MdtbcWDS^jaBB*SZsF9*B7b;
z-PE&`W3hmmm2fQTN6L+@UTxmHXR!$hCV3Wjay}Kx5T3=2&SE{^Fu)w@R_tikB37Tk
z65vNy*3I(lO$hUPw%955=C-zBz*Q~P6AnXdZ!n};SHcw~!rp9xy}2&@4w`}8bn0tk
zUbq_V(>YODwY`~S&qu0{s8^|-6!bXP?%bsGo_2lV7wDIrm1^RnIB4DL=O5V6Pg%h8
z288~s>sZ|7EDoy*8&7sDw!{;5sP-)G!W4U9hi<AX!~8zzG40Qd(b#rhU9#Grm}%Eo
zg&B$Os_vP!N!g#9OxZ9w*q@tbCEK59DP8+BV37&z&wb%RYa>M)>S%xVbnVa6wf(s%
z#s1tx`_sDMB-Gf;vp-Ms?9a2h(Ecnw#`dRhJX-9}+K%l{l>qF|5>8Q6_UCs$u>HyD
z)g9WO{naeR<o4XNKbw>6&svN9>3Jw=f6kQlr)zwcyE7I`_9YyY3<&!Z4oXwME%s*x
zrZARZ3ZrsR(#ZR+wm&a`hca5U!&x#4H4M{82PC|d+WgdR%FXkBtIW^GJo8gI8DM_)
z`GEFj!asS8?ahTB)ZU!=9_`KJ>svxMzk7Ur3;Q;7$;a2X9ADoOKfb=@`1%&k+vf}S
zqT}mZj<0VyzP`mQW|qFl{|DB$c<Y;MkFvg5&tE+1`exhwMYFy+dH!O@>zgZ#s}YVW
zu5a$Nt8ujOp9z1XS>LSvjlt`iH{<1sE=R0y#*6e0<8tJ_fT`=7ef~$T2hOUegGl)w
zFQMykw(>s?d(ZyI{mxDE-1W`M|9A;qPP3K&aab4nAN4H80RN-P&#lNrjqpF3Tp9nP
z$l3?<KUUiPk0X@RJlX#ku-@78K5FOVV{M1j9yZGPsMb5bZ|~!S^gi0xJ8#nKoi}xM
zz4Ot%k3xUpQ{()`cexNZYbpOnmS$7El>hM(`WI&_|Kl*9|IvM<{EupB{YT}0^wv8I
z_hXh>nrnu;kK%qDj#?(&kM(V@1MwyhoY{!#=&pC(4p+P0{NR20Ak}y+Uv?<D%`Hl{
zcORyzui42T<J@)6!vA;){g1N~{ztRK-1r~e=L!Ggu=h97;Qjd@y*1Io{V3K%Z>k&3
z^__GWVm)-S|1oGiwC8<v2fx?4>!FSFvEFk&rmTlXv+3H4cK@SV4{aQfSP$Kk>!D9~
z*F$fzt%u&k_0U27N3$OKG<QApS^tOELknMH4|hB(X+3mp$Lpb!oQ)jo{w_C15kuYY
zbv^WJsBQ^QqkTQJ>u6N<$y*Qo2gK9%Vy%BYwCh=P*F(<~>!H<{w#BUouOik%x7*f3
zCpi=8OLW&md#=Q)6j$PMcR94@O8g%#hhE_=hfZf}!{yNZRDOKJ*SnCbPOpbfI1`h`
zu0Kk9ap4z`|IV(5p4o}@(8c46FE8eF;7CLF$VKG`-06>r@iNSR%#K_%3ST=i`{86K
zjVE$qsopOU;jH`N9ALUB`{Ce&Tp8hp9-&yzu-XwP8<QUocykf=VvxXDasn;Ju<jH}
zlO{jf2d80F#><lUW7nhiN9>V2{}DgcemJm2JhFR8_SV~=GHeUo{cyM?0@GML1hCCs
zd`pg3?{{WgOiOVFNBas#aP)cm3U_2y+mILn<PbFi&TGv@|1&bDc@GfmFM?QRpn3+j
z9Vr~KyV}|Q271MsgKAWo^Yr)AUfkb?e<O3=P@~e=+E$KAe;Wz{djI4|@IN^cykCv4
zk5usPw-Te$dsTfPzv~gcy^`b&)5T8hhD&T*8-6kR3=TK%_eP(WC(%?R;foePw93~o
zN7;MH^Bd7eVfRe#Z&TTD@rG!_S@=@e1~I!a8vBB~zs*QQM!BN&vA<1bN3$F4>sSV`
z5%9)F6YE&sK-nVgwj;QDCP_i7(Ye-AGX%=%ckUZY@FEu1{?O}JU~tUH+RFctt+^Df
zvfM_{%G=Iz#G+aZ^pD^>M9o??#;-RO!gFeZUMk^kvf>)yY7xtGD0z326?Y~87O?=>
znzTmcMpf4Fttb+?Mui4N)VFg@w%?M&RE+aoVL7)dsU>eo_)jUQK2PG8*{jB@re?mP
zsiEBMk>kfc!R_8=<h2iq^bdT?WyZYMUZ=oHUpoNV)HGFkYN_70MzkWQwHq&?@Qj{1
zHHVb!)T|HI45}@J=Wge?784{mB|=-*s_I}jN7g>2$Cw~O*@65s-YS!6uI!T6_pFG!
zvP+(mc)-YxZAH1BpTze}+x|4rbq)wuHk=1tKXZUlc0C(0D)*;x_Zmd?aQ7SJ9)#Fl
zZO^Qe;^ozxKX`!j>VoGFwyODqk%r!(2E6^B7QyU64CR~s*YMp*@_12@{nfk^teVM;
z8^aAJh8p^XV^{;39mle@Rp<yf2N7SK#2my>1Agi`h!J-R;#I}io2G?&;U1~;4?lr6
zR_;%eiP<zg0{5p0Cr>}r`_trF_ou;-{)%il{gC_9WJep$i8g#KJ6iNY)ER?QZ$hZ;
zF?@Iv(+{5tH}nq&?N5^(Zul%yh!nkuPdaiNLo@jhQQZA$qDR}GMzJNP9^MO@iT!B~
zKu!sJESujCO`ds(S#npU$^B{Y=|jvnd=&A*4QE6eMnsDC&&QrV7lzbq!`yi<L>q<_
zdxO1Cg^OOAw<dnBnrs+t7^xb8BiuhT>Qv$j6;B~Q*g1A3gZ(NT`*%F~do)l`NYIHk
z%z*^=LV`FE-if>!#uprlUUHUPg&Gr$&BEl^f2+aXD1LLW_lsDP65^7Si{HV-iR@^)
zXQBNe+At#C<XUJbd2Y@J3oVly)<83oH>`P?4}BJzZ+;;@*_sz>xB_B%0iW)~>26RM
zmOeesFMJ+)3;Cw(Q1}QmJiak8zYw~O4GOtmO{5_w5`&5-W*25-b|F~i5>jkf1JzX<
z)<hcmJR50%fD#+lJgd`-SoW(y*gn|I2>aC_^|q5pC~&_TzkTLTAGF$M+Mjn+`^@Ig
zGxk}sKd&?P+2iObOkde#x6gLN`0?gtsV;yvTCvw2y&wCGYf;z+eu53zjmkD-zZCxq
z^amZa#U68ZAClb$`dDm9th)wUYuYALy#lN;S~sw4GT1S3uHUSO5IWhSnpICqN!HW?
z@PKcrdG?f#XlHFIP}DmJ{w0a3Yg0V|YX}CeH@{ZdSIa+$ef6y_u&+i1*jM&l1CMH7
znK^vgT-f~t^k*0)i|gmzD;BhR`Dd|u{+=1Vl*KhpSzL&TXIw;5ID#&o?cBC_w_5H%
zhfLuJwGQ1~AFTKKMj#sCnE6SwTy6N>@wUZn+V*mHgVy!~jN_DD1C{ONtq*2b>Q3U5
zy9QPo+pCN>$+p+2gv{pJ@6Gn|3w32es9YT^^a&4)e-eh6vd1E>J+`J2QlV7_DJsz_
zH|2<pw7NFY>e|h1&*3JgY+0#lRwV3N?hWYLZb^nMw#S5Vme@UzMUpf{5|i>aZ}E(?
zDm0aNtpO;6D~vO53Gl+zNyb??p)benvySYuPaQ-1tOE9#UKDJz&+PuPB>ODMUq<^(
z`O7|lea2VAj_kAK{R3V5j5e@mpVg+=XX-ORv#=P1_SsBfpGAv~M4fWiFe^D!OfwH_
zg`Y`hFxY2@JFw3xV4s!1J}Y@E9D9rQ*>_$0tN<GdVq^8!oh7u-qOrH5>2F`!cpl&N
z(jw_^C9Jf!@C_%dXnAJdZ)m0c)w9xiu=SyprZx!o+TRaquT{Waa~BXF8+*+-)H-9Y
z&3qsB+Hrr{aevxsc7Fdy{b`of8{71L(X%*ydLf&IglElLExZTq3O#FF#o-w($)2@<
z)xxR!7zf!WADw?~ht0p1yi%h@`-r+F?F?<R@jjm<vc%5NY+=>wkX{VX+SVk6cXW%-
zzgolMZCijMp%s1H-*za;-?q)jo3`OtyiWS|gQmaCS#&dm*D0UblSw|a$M~Yk9ii#X
zbJzbW|J~sC=D+K-=k2(^t<Q0P+i`yzYI0(K=>KQ^ZI&5yHh<eDpTAA7*EQpzdj4GS
zc&O`dgGAYu!QX~4qL0+yM$gwr?{8D%ri)VjZI}z=`rA_Gui3^kz4>cuJaa9+*Wvox
z^!zo9XTI<GYrmrXr9K;$Vt;LF<7Pe>GF4w@>xBKa33h?sNo4oDCHvbpaKLWd299uk
zg#I?QY8L)BteUm@+l)&HwwRc;mST%xO#f=DEw-)gv)UFjbE8_@UXixgnTe6l?Fk2X
z2ea192q^qyo=em9zWtx@zhR}U)&FJ;Ukr|lnQFrShUKTy|7M@BW*r~(=Bv5(ns2^Z
zE1M(OYnxK-HPlhpUJIJ926EnfwQxgEHO6^5$2eiHxii+1?6pmGu-Ag-tC{iE)6975
zS@AU=z+OA<e@hx4J??*V$H$NR-_~~8|2FQj{Z4LooRx>2!L73~dEt<m{{Zk(e05|+
z79Z@3pNkIwa{+|#XR7&ZCm|g7^i#p&+|sWPhAi<t8<i+(Hxr(-PwlCMXAF(qMNX}D
zZaR6t(>sSTBaP*Uqp_Copq8-t!W+Nyw%<9q)t$+93g5?_fxd3nb$^r%SrfmQ^LyzK
zSmW-mV%9t8@B3zl(_6zgH>D|et|sHIcfA8-5KGTr<8G5oBXItjyWa}D0?gmOQYSa7
zzSLRKd_t+yr>WE#$G!Kk!%CSmkOMxJ4OaF!xq4Xx2hTP?;jF-CX!;y*#=Xk{qm6Hu
zIs=cspUOYg80%t;>Lm73*{jUVQZ?Ws_fk>2^@#Gq_7dQ?%vsfhPZ_RgPM1tSmCUq%
z>lADUtp{5F3et(KQw~vDixy&7RPFD8cYk;O8orS9^!~8($aCTLHQeg~U-rQ_M4t~g
zzm|b=jt<%n4Jfz+zP{<$8|S8rd3V!=;j`Dwdbn-48e_#os7+zDW?_x`_HMMX7T@08
z3$OYm;q-O*Zen=jyO<9bKL_5XX7{VR507$7PrKYAH2F?Z#fy*dhSf)ShpY+3TA(j&
zn-G*&HN)2(Ck!>7Sr3KV;EZ2m3_OIut#S`J15*Z8m!bq`u*5g7+*j`8_NwRqarj1~
zvtlh3q7@3U9zQnm2Pd=DY@?95rN{nVc&0w4%Pr$Z=9rJ^;_=Jsaj|oG>P+~sJ9%+?
zq-f2og?eo7NzPq-l5-c=(5cq$49+Zee!M#T^xvaB4&vKWSr|ACWA~F+`1Q${JHK&g
zl2G7Oi^f*b{{1(EqUun{DP5;Nx7Li1m__J*quBl28p1{gZDGwclh^PKLv0XqZ>|pH
z#f=F!Ke4aE$t`{GAH0lv@GvxT(@vw78>yBXC>~EoJ<++c!LwC>_H!dX{n_lA=O|gd
zqd8_IaPQ>(oHaNy2cJ9S6a|cpZpW)WhII}(i#cBfV#C%ZH3|8x<t`@e#m-<@!neBu
zJcQ}eTt+|v?qVx3Hfj8q=Fb-*F^F#qb^M^#b$n(Qy1p;m{0ej(!g>w!^>TYXNM%2@
zy2QDu&x8Am(e6>(A59WB)B7^W%$gDJ&GyV&e|kF=JGRmC(c88Bz8bz!79O-FQq)@a
zBvQ`BXyEi*R;b=+UbEv5k?||I%pp2xD>jKpwBPt_D89G0rmi50Z4;eG*M!|~Jcgg%
z8GdJD^z4n;-=sc_RG&qY-Gl7sqOSHP^O)a;$k_G`JD|DWUCTxooV^{i|M;>l?#wQG
zi3x6MeokUD<u+7MIk^qHk@1^c{OqhAMC8ZU&Pwo$L^I_F*#3r)h$BD1re?IYx0o-T
zjll=l&_G~}?&<kwQ#K`8DBz6Qr*Jo+_{l6yDUaB;OB>JpKEw4yb~2s8&9l#pH+u7L
zP=C}j;Li7EK!?E4iP(rVTC~+!Qib36*4i1E&V|pq@<YG3lL)tp(hM{)@}*>;=j{6x
z1Aj7G>TOQs8C&Y9g$9^d7(W9sdUyBe)3L7Rv;7LenOG*cbl5q+%77<=o$i#!ye$u-
z-loku0o&)rPi4TKAj%~Nv$G$D(4k9Ph~^+8bAHdo1@8Whk=QN|Ud$97Y)TSl=J*9#
zeyBFmH~^W$hvW*Db0q<HYE)k_etLcjV^%VAIkVNX`2F6p0=6q^S%JGjo@YN$Ns_*}
zMlm2u-SsZh*j$)>`)S4=iN>B&S_aN~hKn|S=K_3G7qdO<Sx;0+x3@&Gy(A_hg^SkA
z--xgw*d*Dru^(hpR(vJrgYx@ob>G9291y3zcH^Xc`F*u-Agkj0Y6#lvcKl0Yq2E%e
z<k0JOxBq7nkytDCzjGGlGn)R$nu^ftc1rh!w!VzwPFYKyO@JjLTu(6WGS~#&aaJCv
zP8eVdAc-`9mtqp#ifr{@uQI?eW6hJFUQdvNaJ0YNU~eb`%(YLLC^D@Qp0n2&U<{7s
zl`z1zoV?F9z%bRX{D5bGxeE%o^lV?U0akq!3v8tOy$o%C8Go6!zj|o<3thWM#a%y8
zulgcme{tt<v`Efkek{SZejv&ILMM=$#o043!0_K#UugD&%&%&gUsy<he%m#_s%d{!
zd)5~objtj?#bSPyp`0<zO)Mql9(m-CJzKislK)*U)hu<v<$JTYekAOz@8MqcK>_ww
zrfYAZzzepbj@|@&Ys<x)VzfouTjkQ;f{*R}+FMuA-a1zmXR5um69r3q>tDEPg97$e
zEA(qawcX%?uBBL9zV@2s=-OY{GA*}PEB}vE#R~(BqGln({K9{jUQ`R$_TnRp@x=hH
zg#qbwV16yKm|rv>P*aobFFMkc`5^2sjswFVqm9yF`>VAr+5S?FG}r!O#XPG0WffmS
zUNF2O2VSqH{dIsV2v%)M=l?ZIPd6$(rG!=}KnqXHM$0wH{Mss|YwRy-zA|kAv~|Y*
zI*kHE57I5k0Hb$|5`3Aa${5*ScW8e>_i2Caqy2S&%1`@iOP>S#(1WDfU+|Ho*kA5=
z=F#mhQ1R?9q@3FWb&dAdmfmPxh5eOjvA;0Bc~twWRoP!?v3rnx*k4E#%)9m%Iv?6!
zYJEXA!r(Oa7w$T=zuxfKUwUx?*ZJ7(FC>~|e>EW_><ziVAYp&0k;NqYi?Tr{g#yl)
z-G|E$;=NUc_WHB1vcH~UxSq&PCMpvRuqBE9f4_Q0-1#0CJAxz60J|E$lMOJ%f-t}y
zW9&;62R&#1S#j`3y9K6}7SIAa4N-b`*Yne1f4TG3?n1_yRwlS~ROkE(!<`6rXn^I;
zdqx;weHpSRvz=^#5zb*&=BV|Zxz$Tye<i?Mn4)KZ&7u{NWPrT`0}Ngc&j4G&sFf;n
zIkO+&!}y=Q327YR@Ft{r@}`m`*<a5vUq`jSl$L=pX@9js2eU2q7s7^UlVs0c#Sm&q
z4A%?PeGgAywDhLFChRX*I$SQG?Ju)j06}{_i+`AmK?95v@*<7BFawSLmmvF#5qdqV
zWV@~HR7SBHU}F4#;hQ%q^XMIC(a<c&DpopRN+?!0AcUnzq1e0u+2KKlBe5N!<^%ZH
zbm@Tn@WR8roh2Ok2sPj*c5cSUqIX9SGB19%(N||+>434$pt7`ZV+9uXwTEM?om<%h
zB6i-)HzGv{J#SYe_U};ht65A3<@q??A1=ZBLj<3;Xx;@2yG4D>81oDx7fl<GKmQD8
zV5T$hi@AJDN?Y7C_e2=rx$$fzk7(?l>S;918B{tT*BKNUFxG_2Z<_--B-b|;9$^@X
z5p-Cmel&uTc_dK=S-co2nl>QMS#lm=nEq-WB&I|f7BjCLfE6ohE~LxjJw6_9S3KSp
zYPfPhD1;9ZUv%YwDUpV01G1e(Uo;YghTwC?uT!{Vqm8q2!;NKm{4pVdQmBc4n(X8i
zJA=BZh>-?>u;*K_@`5GBMLuar3WSTDfo}fun17R}xlil-KzMFKC>4~#yobHXrSCWc
zBPhMkAOS4a0%d1lwvq^5f)+QahjV*A%Gakz!@L0#5UhK$)NX)yFj*A5>h)uh*jp-E
zYS6((z|2uJhF!X+p%|8^cLhDsG@SkxzH%LI{(Dv=6Z#iQe=7tf2q`7Fn<?TP<7MwQ
z_%?FmKXBEuhC+qx^1{t;X2l13?~g_VN`&FY(gE!VkFT?@bZ#v~6eL*YYEHDVZUFQd
zB^*bW%(X@fsBYodZY5wSMYQOh?~DpVGhzoq%{!>3EDS7Tx&+IZ^j7K7qQB37!lw$4
zC{@4`5!PQyIfR18$H!a9Z^&81#X`<NaG}Zx`Uj%h6~ECzyP3!E!gf@=OAsvFygLgB
z>m4Kr&tleSWN;XC;6zXT^NmW!xN-<O%L?GNf1W((7i+KkY`Fa?Rf$!Wpy&f3k<t@%
zWrA{;)NWkGnE7C`Z5fPbW+N}OaOI8iGup+|C(WEObyD8IA^F3G4b2}~cwXK$6Kf|=
z%9}AgZ)QQ^h!F)NCJoBFcG|@0*X7NgJhOHx@F61x=MNs5H*iW_T}|!C3oe-GrZM=s
z88fb%Ho11jteMwN9(?VL8!o7uF=N`bQzlNGe!;Y9vu`-RX6B6RCtq8aH>s$)u&BCV
z(vac9hhI2pSpJZqlZRcKUsO;utop)hF3g{N?c@t54ZU#q&_OIr9DUqNTKc!XoR)rL
zZu%L$x@RwiBIE);Q$I6dC*gO##-?}2O>s_cNlw3#oV=2pfh9Tl#W{tgITIFkU(&7d
zgj=(|pLt70<{wVTDJ;&(SI-d&VRMUfvdeNNWS*36ds3V;!KHnNrgOf&0#4&6=6R%d
z!@rJc|0sxd$VRy`X9Dw_i@fuYdFHxa9v^m|msn`u`4Q31W}}AVJol0|0oOA%_CV+4
zUEa+mSCq9?-d}X(y}&~EwvT}B0Zl{dS1+vO;PGMVSB<72=`Q*R=)P{Ddst&1X8BHl
zCB;MLw@zapCf%(Tx^I32bjO~Mn%_wp`!Ms{YN7jr#_BuQR`=`vUg~eyt-qt#HsFxu
zJ5FP3I!E`b?}={6rTd_d?mY1DgvJ(}h#$88VL^IQ=X8FyJ;MvqGsjzdr?MP8dffVm
zeMf}(#W7E}EyN~h>>7d9S;DC@^2PnB4);3|_dW}@(n4da#^{mbL0;a}*sleamaQJA
zNvw|r8)(5U*4SQ=-dK$d&}~Zy$xqT)nDx(AE;UKTlAmQO7DQ!Q_vy5*Bh8M}s>}#T
zYZRg%)@eDEOKMt4OugGJ#fnKQMYK^p@DE3K=C`9X(o@nX$tg@r!(UpxPG=o;Sf&H(
zX<@e|#-4h(8!fGbC6zV`!B^_IO6D@IYm+7ABR4aJ2bD&4Pb7rngUBMH)A%5=7zG|~
z)9GyY%fgbMbphqF^*!)%D79Qhn{vrxTY_VgpO@rvSz#-eD|OtNozRV|E#*SJxKpRG
z@96Yjw$Xn<$GxT#^eY4C=k-$APkTRld8Ll~e)Ur2U#Icz(eod-=D!Q*=bhx{|8mmD
z+l%+UqszZB>(<QgXJnR2`XxEps!m<0;}&#6{&@lNzw-moe?iAB?F9Y&0Qz}3ZvGb>
zJ^$0K`PXqjQ2uoqHAkm^wT=D@I_~?;e?GFF=eYU5E{T3|&cKByEOCqetKCd{%yMU(
zaXL;G<?iW>jPtJyf1LXFLFW-2=Y&8y?<CP-|G7uU`Fc=ad|$GSR1(k`^R<*o(8T0D
zyHIwg?26d*5@YqF3i6(0X@m5}c`{C7^gVD=AMg9(?1%F-oTuX?M*qVn^?iR_^KhPx
z^BkOfJ^<&r`u;Px4#YVK=Vvu`9<Jx>`wMVo*$lxsRAU9Wa(t0#jljwFrU>UqoWw51
z`FVYR39h4X7UL|z$>;3<%k+H(u9R;W=cO8p;2PEUV{jdd^Gi6ttg&&pensDp$Mp)F
zU&Z+~ja`ZBRr<aP*9kZ$;=BeY=}*ErS>IoW>lB<*abB;nX}I2??`PmzgY%m>XKJht
z*ID|04z4%ioQv~Y8lz1;ALmUtzoW66as4jNg*X>!>=s<VhqE4MOk)kWF2UJ|^Hz;5
z#q|d`e~9x(8v9RNe~j~XoOfvKC%FDM&Y$A^nZ|yB>zz1%iSt)Dng6?R{s!mWIPbwp
z>~}bSkMj>W@5M>%e{ud1=Y2T;gp=4`aNdve0i4Tl5_=HmLpcA6ld}+rJ&Kcaj2^?;
zgp=3`oGmz4;(Qz@vDG+R_5C_rpV0T~^>qWT8}&Uu;>S48;M}6`x9aQjxNg(;FY4=d
zTzBaEm-Y1(Twm4qf7jPGT;I_5Z|dvYxbD{Xd-ZicuK&>Y9Eu<>2XG$L_wVZKzj5Vs
zaz5ujUNi77Q{SJUulyKjw!ZJFuf1?RN#8sA+8fuCadvcMs+J`+RHkZWY<Q1U5J;wK
zfl?o3s@BMc_f7>>I(-80z5)1Y0r;5#c>e(W>;QZ~0REW(d{6*>UI2bU06ruDF9^U#
z1mHyh_{9PEB>{MG0A3n^R|MeU06Y?aj|srP6o8Klz{dyRUk$*o48W@b@QDHVqyYT7
z0DNiyJ}m&B5rBU)0Iv(c=LFz$1MqnPID4?vBQx#hR1ip}>fKTwWu~#GOFc4G&u7Eg
z3#J~Ks#mn(>>*Q+Ox0uBaQ2?5N2cmcZ8&?@)FV^%v^M+~sUVO{)eEOS%2YkF4QCIX
zdSt5J+J>|DPCYVJPj186v!@=Js+YIn?DbQROl1Msa9RYZN2an4Z1`iTAdpODIix<y
zRF;GdU!4MeNj0@=Qt-zwB(z4^*z#eK#`7eI``^$AM)-Um{zZ+C^5OiMnMTVd^~g-4
zm6Lp2sQDb545!_r`I+Fu&(L^{5C5L#XMqpr&&;$97L@qYDfllnKTCa2PSN<CK0K!R
zxzC6HQ}fg0!>4N8#!;rS^n4NUGc%1=U-Gd~^RpuvPJ2i5v&V;jL*uTImU#HA=Esa@
znkQ8n&r3H*;+mO8>ofJpOrs^5d`#AS=KIolPV+O$hetI&)`vf&`I+FuNi8#Ndooe|
zD>IE&aPm>1`Kj@x^RTA7z=vO;@ufcezcoL1`fyUqOrzDEdSs^kJp~-3`MJ-R&d)U6
zCLi8g;~RYVe9g}eA5MaqX>BQVU7Xf`@^QQ7XOAzP6E&WeksSUznx9-B9yj{q!x=j>
zjc*&NM`qgI6mYJlo9|2KElqcn51**<u|E7sqdz{J1T)k2r_gnAzV##@U)TK9_|kbw
z(_P@hM{9hk5C5alA0Pe|jo;_P$wj7m`%31=#rY<de0*N>+2l*-Pnw?%KKxvb@9^P2
z(ERN2;iQ(C#y7vz18ydt_N1ltH~NEz^7xUao9n~7Ydp_~*J^(9eR#3PNBMBl%2aQo
zlB#>3nZ`HM<fBpZIo6j>y2dB?@L8HqGhS~}+o}0k;0w>^ct1^{>*9PXPCjO6x=VfO
z?9z1a^x@+*exDC-(fl;|aF;IM!cz~t{|4ZELr*^1PKCcMBg+E^>ARmh#JhXAnj3>(
z_aMMI83{W<jVA%mJ%@P0J~v~eMR=t=CnI4$sIeo2|H&ta_wv%GACJd$<nx>i5Z8yA
ztAYFI0OE<>SB+NyzY(wE=VaV$f~T2r*!w?6{Amv#pyf9luk`0+^zm?$-z~Ys@lYQo
zzxkgfPEU?|nEY;4`AxhpnEXDZ@|)=QO@1FZh3TAWlJVvr{p&>H{XN{!?KO~iqQ6#S
zWeBzBEaDAbctf|~0^*5&+|VsRR?o?R@bqz>zP@w<@y{4IP0d}vuc~v2C;DYIE(SdN
z4B|_@@Mg^Vek6EK#>*bA#=`LH@2Y$awZy!myP<05WPn+H7`j_j`MzS{G&LTEU!zWE
z_{4jVp<AHnCi-PH28Qrcl$=%NQ)wB!`dd$?Gr~*X=+#1q;GB#^KWp@Appx@Xyzri0
z4QBW^J>2Nk8H(=39&YH~(u3hI@o+=;(5Hzf`cpOjg-{bdN&FXHcr(6Vpy($0SwnZd
zD&JBsyrEl}&2%a}+{pQxitc_7SL0szbq7@QoQ%6X+{_oa9|@k5k?2p=SPw$otmsC(
z@P_WG-5Gw2ha0-DE4`u@(mf2_4N9+mXJBuhLV=>2=pRdU{f#QU8s~*Kbcds#J11kj
zha0*pKSeyz->Gpfgu1UE@&EP0oBS52b|cXbn*63Ix>tJP4PE+A&&jCra6|VZMVH=G
z_fX?oxP4u<KYuZ>m*4wUJCo?wOn%3x_IZ*Q-q0O<66s#&;bwlxf2wvP(NC#yEreQ-
z$M6q&;mw?mqI}|s{wqt%`KOBRG%viNTb;x3Gdx_)0m84d(2$}%_wsA#hR!Dbs2ASo
z?L&%gqMuS@TnLq+=+=4R4c(lRna&&!S95^ys~!C#n(mb2!Tt=t!o$_v6#V*~N@ul)
zt9d5)^^j^m6aAwaKLZZ6RYw;7{}$(A%rWK>g1+$}PVF`Lbb<d~;I{<e#?JGn|A;OJ
zM&qqXe<j*&9t{5noCYVxgW-8@?8aYiI9?6@jK<MCsKekJHN9Rwe4oaRj7|8_WB>=6
z0d*MsuNsFssDnTM2dCk)F9YHr&e~`25`q6w;Nt`E9|&Bg|6L(BX4RyBuaMh)0>`a7
zm>h%LFT(MG!5`GPlpCSjEpj8i%py19=@z*WuhICqxaYy2f5vI}m-@!m!{Aci?iaY!
zH;Fe1xykgUzV#64NPT-i;J8%>lcP**`bONQZz{Y+Zp3Z+M%<=v#Erg5xh)57<Rj(A
z*3aNlZVw4u%1z=@ZZdr-H`X1KzLeWv1&&*FP;M~&ta2l6lbZ@}ksEQF+=$!cM%>74
zAntik-yXqf_&0VXakkzDzeniL-vs_h0RAt5%k=-Q^TEfCNT*7)TaO7Gx9VVcbU|sR
zf6>)O)l=f%u(WT)&0J{Nz7fyU3CQ-1__s7J+c)AzG%n@V%=F!Ep<T*tg}|lUS_CfT
zCUGe@nZA@8x-yThl-o*y<5nG%TW_2;xe>R?jkry2#BFjTZj&2vBRAPEtYZ3FZn9rs
z?`&|{FSH6=_6ri1{enzi_6so8z4T?jutwmxRR`rp9kBHa#BKcoaa+GY+}1A;xAhCe
zO}`-Jwhp+FkCfXJ0+(`oQs7c<5|?t5=}Wo6WcKJvxvdvCZq-4#!PK?Njkry2#BFjT
zZj&2vo7{-o<hB90k=vDI5C^OCMw|x!p1?N={HFo<7J<w3SBv%yuQ*=%vYtLIaNMec
z$>EjPT2G1F>M8LTG(FkA5kI1F*}f4s_APachoSq1Zr`N7J%i^)K2mO51TN+FtiYw*
zBrfG9)0c9?E4W8j%5AH_ajOpUk5^}_+=$!cM%*Sh;x@Svx5<sTO>WNvx5;grz@^+?
z5V(|^#HHM1`ciIq<?`rCxxFZG+^U0e%fo5w7l_;BM%*Sh;x@Svx5<sTO>WzP+vK)G
z;8Jco1uo?#aVa;MzLeVlk&cwx%L2!(Iw-eK;k3z(xJ_=vZE_=SlN)iH+=$!c_6l$#
zH)*fFD)2ZN$H8j;8cq{ly<}SOk(mHBF4O-a6TrdbK7-SwGo(9FH~qikYH$VOAH#nd
zXORfUX9oYg#<L0HF!%&bPquGNr(WZ-eItHA<Fb7tzJxDZIAr_QhTn$Iog|2Z(ci#n
zaI<!hcwFFT3;9U=>jIbQPt$yn3|u~5`ZI+*-V``))xq%O`CB3!9~k^5i`*FgW=&7Z
zjri|1F6Bl%Ps>Njjrc<rxxEeC$fq9nJecfmoCg01K^%UZeIE}$PF>~U$2tGdhK~rq
zuMNO|7=S+&fOi-AAoKOf0Q}+r{DuJhw*mO80r*)$uOvUlPwAIiBq02p0Q}wnd}{#y
zb^v}N8NuP_=llTtngIOK0DMmXK3MB1A4~aM8-V{h0GIFYGMzKJscfly?ZK_l^ZWq(
z8iC9DvQXeM{htTm%>nq^0r&-?osj8|3Bb)-M5^8SB3};&gx?;39}K|Db%V}w*(=ho
z5xC^@mH>Qt0DegiB#Ogd?ll4Uy#n8dc%~d55V+*$l>od~PenF`?gat(cLVTy0`O-7
z@T?Q<bUzb-o3(0w`M9aL{m6Ov@l6q*&!`W?XK7rE-^2f;%Ukv@4F8<QW&c9_YdQhh
zzYx#YIDG{?NcRGqrd){eAU+u9Tl|58`Qc%3>J|^lC&PbQq3)U$-kR`-G%opM_+AWv
zL-I+So7wQ74}k}R4Z&&SGatB(PvSN{iGLO+4=GRLHa>}Shie{^PvT`7m-4(2xQ)-D
zz-@dIxA95bCQsrvK8f4pN!-X&@;MB+jn4w$Ha>~l_#|%Qlempf;x;~s8$SEso(Ic)
z1Wp^D!-4O?$wTTV@qZ{ZSwD#n(zq;l;{VoouD+5k@y}WGllXXxJ`@4B@mUDm#wT$b
zpTuo^61VY5+{Pzy!>6oA7Xi2NITE<7+=<)Dow%(Y5kG{Jhm<FATRkFf>XGF0^T2I<
zUJTsECvh8}#BF>MxA94QzomSM+xWZ$xQ)**0Jrf;+{Pzy8=u5&d=fv`qMyVs)BH<$
z76Z5OISROqPvSN{iQD)jZsU`<jZfk>K1Tz$@mT`g#wT$bpTuo^61VY5+{Pzy8=qys
zZG4sjxA95b#wT$bpTuo^61VY5+{R}Ga2ucHz|*y!WZ|Ai22SE;hJ@_jiQD)jo}<%|
z^_}=kCWu3}=fr1Q^fL_H#%Bn)S??zKB+ieM^N@TJxA955zlBfYcUt%)-l)Ty_L#xG
zh|};%o_UZjX~*88&{X`V0r;u_{Ph5wYX^Dw=@tu|x@P#CDR9Xr_l)M@Pv@@z_^tpv
zL(9*f&UXUvKLp@U1mH&k@XrOj7YDtM*9U}uH~`-ffcIlYEpl^Fw;o-JAB7?upD`Q6
zFV=WAK^z8W+s#ATCk($+p~?Lz@vrIfkoAlBMH)X}$McuV=m30L03M{b^mX&_r+-F(
zo|FgRGXn5?0`TVo@T>qmIX?jZlgqx6e-!tozC0@MN`XHv@G$~^Qs83+{*1uCB=DbW
zy&_wZ?*9l}rvH$@B|psqmvr}Q{qm=uq5Uw#W%@k@F8S;$a7nknz$M-LM1IGK{5~S^
zuLyjlz%Lj069OME@QEV7GW}@+m+9Ona7lN8z-9U?h1_KNPYGP6|AN3}`mYFFrZ4sF
zYa(A#-@Y#J$AuiO6u8v4s{}6f?P`HbeUo&hzRC2ZzDa(hzDc@L-(>ny-(>ny-z1+>
z-y~hBZ<4N*=R}cT&MD$SJ--I0sn^W}aS*>2r@_|{#6f%#PJ?eGh=cfKoCdEH`XlLH
zC2*PkWPwY5ZV<Sn`%9reGX47mF4KQd;F3?N&ywzwBK#zguLp3?gZZ6;)8tpmZK}Yf
z+^!e6l-oB1ewoOxO#f<u%XF?6xTI_5zmrdyzLbwl|6!3|nSQIlW%?TgF4LFtnJ)4r
z>+cMK%lca*a9Mx9De!AWer5Vxufc=)mFdhDxTJfNz-9VPB40B7bpn^^KPzyV{&s=O
z^kw^B2VRZ-$o7Ahz*pj)2lF)>rwK3H|2YDe?Y~T4w*N96+5Stqvi+Co%labIm+iky
zU$*};ecArY^rd{hCGzzk?s-rS-^OX=(1d#)#OL8Ocq>61#OLEQ_%}tl%k<|7T&A-~
z;F9hVfy?wai*lFgOMQ^($3=LVzU(h#`hRAoa4=sBaGHGm756-d-;C4XD+uBs{#~2~
zUrP`N@r5`I&aa&EAie;n!G{W5rentC8D7#Y5#eR}SBm_~^uHl+nSQOnWjaz0e3vwQ
zN;!N_;O702eAWwmJ??oBkKr`w>>_}J7n%M(fy?lR1TN`z6LOGra|He$pke5m_aQ&s
z3LytccZ|R#T{B;U>B#h@+!_U4DYsh%z5@3=n9lcc8a}1|EEV_=kuRD4#R8Y<lnPwZ
zHSedSE7QM8<X5I26Sz$O2LhMrNICpS@Gs?Xo4}?1{HMUB{`^?rW?c*Um+2oSfP)tq
zK1;|!(#;jPq}xy6w<9f6E|-e@O1fVWxTJfPz$M+O0+;FEOXhKq|DWJAbpJvS2l4;L
zY4C>$;voK0oCa?ph=cgga2ouRB40B7fdZH5Tp(~scZ9%Y`caWDnf?_5m+4mtT&91W
zz-9XX!%X2|zV5_n^7R1jc@Y04PJ=&65C`#J;WW6ki+(L|*>2n^@Y6(oWjbdIT+$sR
zaGAc8k4#_6N2WhP$U&w*Mc^`hlV3jGE%<*G_dNW#SqbIGC#KuOzZ!sliUP*rPp2XP
zH-1@v_>}?SjeX@0|B9BgALo}}Z2aW8u+j&e6@?TCT(h7M>M9RnI!X0g+EFJc#QoPt
zC(7{M1wK&V*#bBFRxo@|f!`&<pD1uMZprW`2|SMg4qkH9o%?T*z;gwDhroLaT(+N|
z5V&k7`v|;F==rGvH-1i%=_~LzMflSMZiLJ5rwe?N7CP}W1%9KzKPhl&5BC?inMcHQ
z@&rCk7as9*1U^OJpAz^J0zX&aI|Tk|ftPl3e=z-l0>47wg9QGFz&|JO4FW$;;A6Ft
zG5x^;pCs^nf!`?bp#onba8nof_)dWj7vb+0ILCR-(JJtf2E_FRfnO}}JpwnrXFkr-
zm4x{kML-|@1YTl5T+b7DslZ1Gyj<Yp1RfIj6oFqV@cRWG5xCkY6~D>nmjzzh!~H@0
zGJ!7<_!R<g75G;LZsr{^ohpHk)r|%52?D=E;MD?uLEzU3e1L9Tn9ekTPZ0PG0>4Y(
zGX=gw;I#rD(98Y7^ludS1cA>L_+0|ON#HvK{vCl2(2XF|UnKAe0$(ify9C}K@ErnQ
zBJcsaF=hHc5cmXv|4`s}3H%O$?-2NZ34DO#{$Tn)7x)zd|AoMp2>dRAHwpYV0{@4=
z?-qF4;JV2-)}`?iL^n*Hj+<#yr+;Je%=2f|)Zz0*wP}N|n>k}vP1@k;GwLP}uBiOV
z`L%Tuul+{a;F*)BO&mOVN>%mDi8oA68(dpAvu@%wxX!&nUDaczJh<v>m6z2G9a0qu
zmy8}ewyL-!Tvb^dExT-N@#wN4L#nE#POqCeqjtv3x^U%XRYOKpjh;5Kwsz{Z#nY}E
zJ7e0^Yv-1I8Tjz3Dts)dHavH3S=rdRk!yyOm6gpNH>B#a;Z@`Es~B<E)Vj$tC)UlF
zSyeZ4;?%m@Fdmf+88&HZb@k+#lc!%hxvFk%&Ezt$s92jhW75RBi62wux?XNK-Uzwf
z_%W4RmoeA%a+@;;a+~upm0OoF*Y$F%tApI?KBjW(GUmEoZnd?LTkXeGZe7M)*URmO
z8z8qEKBjW(GUmEoZquegZqq)da_chYx?XPAUk|xm|1p(YmoeA%a+^98a+~@wm0OoF
z*Y$FnG6iy*@-dZLmoeA%a;vU}+^RpOa_chYx?XORCP8kKKBjW(GUmEoZr5H5xn27)
zm0OoF*Y$FnI1zH2_%W4RmoeA%a=Y$2$nCnwHTfS$e@K@x*P+}-R8`S~G%PHAMK1ZW
zvg_d?x@=hDZ(No30d<%xyiUq7B~x`hQ1m{jR6kf^uIHnR5_8=FU6h#nj@(6wxi5}g
zl$iTA)kTT9uNYmFm}_@;QDUw!+C_=E7Fri2X6jX!)Bx88>LSiu!=Q^2b9>7!O3dv-
z-bZ3X(X>sSUORavz459w!cX|>Yo<-Eo1E0#nTF{aU&GW1Pxl8W(qU8Dc@m~g{7~}|
zM5GJzVVdI)H6KAlx-cK6C-_kF5k#a5^I<xn4>cb_M7l5^rvLj;^ASX(3-e*R-VZe&
zK}5PRAEwv;Q1cN)qzm(542};qA3;RAFdxR&`B3u_M5GJzVa%)#H6KAlx-cKc!uwG3
z5k#a5^I?q34>cb_M7l5^#;*NP^ASX(3-e)2>JK#^K}0&t$B@FRs%tO}WpZ6r%|saQ
zG~Y``%pNi#A4kwkm$7sGo`$kA%xx*CnK*T37-s!7Wo4I*sKOs+zI4`y@%|XOQ8Gef
z`B*VBM>0Zd_gFDfCmEr+daM|!m5k8dJXVa{AQ_>-c&r$iCK;i{cdQt>UNS<H?N~7~
zRWd@G>sT=|MKVI8=~yvREg7M;aI6@aBpG3Mf2<g}Rx-l=`dBeCQ8K~~_h^iC-0>Dw
zxjpX0Y1&-|Us;DeuVle>q+!IMtjwKZ%1Nd}tHz)Mb|=doeb(p)rtkWujvam1r*!P-
zyS|`fN8k0~96S21@8#IhcYP+uj=t;bICk`1AH}hw@A?)3=y!5n{ReJ@T*p8F6CXh%
z?7q++JNoX6__3q!zCa&4`tFNw0DV2AbZu?jkl|^ABcsQLhZj~AxOWA^&E4<<b2n_L
zcb9MO5aU8O#xU=$z`Gkh+<WTXA!Qu{DVw<7-H4$E8}8kKt`0XM-`oxN?uPLW>q_eC
zs)u^H(0AZT-+?Fdbhx=2=G}oO^R&R+4fF26lX>dhfhUcDC-c<115XAktQz9UN8f=L
zeFyoNr`{cSF;5H39eB|gcrj1CJMdzj=9@dnM`Pf{#3-!F_ju8F;6>ko7xUD+125)j
zfw==O8Urupsdoon%+q{x2VOJ=UgY9Mxqj(A-gE7rUV54obHabQ3vK@(7d;|`UViI^
z<!_$dJjA^j<@;@Z>gB2CXIdWa<T_jPV2a)_Q7>;x>jxtD;Gv0cuDh_fR?+7|F>#F2
z_i_y>A-UF<zh6Rpm6k7l&6P|wEv=vWk1KvMoL=te;d#Jp{MTvz&6;4w|1H8AzRmSr
ztbeodUxTnb%=eJpU#a~63-N9I*K7Wl>WHMzC8d7;e~fi-q;K|#G<0_8^`|EP1~+`0
z-#<Wn8~uJ)F;#aD4PHr~OF8}Y^MKjpS8pl*dlA;qH`m*+7@L&3`O41_Iv>yE;V=L1
zBfgFQ-)jC%{>eXev9tW&W-0&wL43ovxvm4>HvY|i@aeva<>!AD;@kLdvdEuH9{v1R
zqw<r!zx)gIx=fRQ1W||K+x+IfPd55vuV$*r<<D~V)6WBDEC1hG%KuLYYv`M6J{Hm2
z<TqCH-%<Vl9OB#f-=X<8`DgjFE_asy`z_`FXAA!qqCjo@FVOsVRR0GfzK#C_7Ws3(
z0YCriHGO~i?>Pm5ahUwOzY_8{zt;rNudhlif9`AGr=JJRR{pJ)@?VCqrrgc-kKofL
zzg)EIJUS}>-y^<Fe*Gr6{G0r<{JGCUXZhc3DgWh&Z}>LX%dkG&#{VeIe@EqCiTF1D
z^ELlVDFhtkpZh-e`F~r}_m}^Ddh-aAf0YRS8NSW$wgCD~7W!vf=;r~mmH+FO^5>pD
zhQ7HDMy0gLZ-eIlJj9U))HUfCg!nf3jh)C;6Z%j24Zv@|{PKX=`2UBc{2xJB!?(F!
zg#9sW{HL9Tz&OnJ)ZJgH{r_;pxA8wk^DoQ)Gf2eG{}xT(U;Ym=vp6~`|BV6k4_N54
zF8b-`0kg?3yTp~hwEvnA*2v9VcLwzT8#MnNmH!I?{eS&6spZeKI?I0_&A+t&nl1ci
zA|uxFKNo><bX5LF0{Y)OHUF~wFF<;J{(r9Nr<DKa6!{Lz|Gy9)f9^&fZWQ%DUw?p1
z(jS5+e)@U9Y~?@DQvQ!4tfD2Z*95fx8#MnN*?(6BwEs<-f204b{{^7iS^f(w<-bbs
zZSrvj_8+m9zgFCi?7veH-zNX97Wt2`@V`vc_m_XxPz1(d^6&mi$lv__Qvm%blbEYy
z`>zPUJ1f7CrTo_-zLA@`o)S?0d7A%@%0D-t{10gUP5xQ_+@Ghj{ExGg|2hl*yO5x*
z{KsnkJ1YN|5Z_k*xsy}ne~E?voA6S`kpA)?R|pV?$-nz6A%F9GF5=th-)W&=j7Xi8
z-xN#vKZW?F+|9K$p#QJY{C8CTEdl+1ezhw<lYf?f>3iV6&QksxEd2ig@7bi}e}BDG
z^WRbXe>dXW<R8-f%l5az!au)DNBaKqzk<qw!{p!nm5{&rT^yi)TP^g%h}7BgueX%{
zX2dt;Zm!=BDu2y?N98{|p!}y?ms<Xj_rU*cmhykb!hbE^@2%yp`R}Owrz5_t{1<5c
zW%-Y>@SmggFQxp;5g12D<=-Pf|8l3e@{{zxg!DRF{=c=9|8t0M%H3Qm0_?vU&3{Mb
zUlL&d-KqIE`Dgtf_a6Aa-%|e1TloJG(zTYq=D(xzzZH>f<^P~X{^KqD57z#tl=6=v
zFb<P{_g6yx=J%ig|5IoxbCulxe-*zwTmG$<@_z~OO}U%vp_A?MtI_;-RQ~@&e4G5X
zYW_|BS^ihP2mUu(%743s|E~kHmcQn|qw>Gpq=|Bn#~zFPs}R61|9=4^{gm>jvg0uM
zcYh`1Z+`E^jZJ<Fu1_uhi3sbbp9jol|G#c2|6PWbxQ5{;vB|GS^WRbVmm<E6|J-l5
z{G0r<{3n5KXZin!rTkwJd@Gvx-O$U<|DBrudbF?d$dx~Ee+%N<_#deGm+kL$2=C|r
z(<j->e;}0|hsnSDE4BR3MtmFn2QBocA`w6RJYcr+&mQf{AK6m}<^MYFjNHui#{uO(
zO7q`Q`TroG{6o`H%YPc^cb5M?n*Tm7`^x{;X5qg@%inMR)oA|LbWr|(3y}W=&A%-F
z85aJphM$=^_1FK4C%KGwRQ_K@d|UbNvC#jfg?=6|Tlo*Pl>b`@Ys%eR4+p&eP0;*z
zRQ~S-y#Fn@A+`ML-UI&ymhykw!v8mrc~bJ1|5DBW0{B<u;jjPIh_7VfYya=i{67f)
z91qr?Ik@`ux0~)i{pFuqqoQ?K|I-8d&#|?x{G|TPwb0K4W-I@YMSj0WSX1ui`kS-u
z^2^u!&-2N}FTXnx-zL8unt!AJl;1oH|Jmo*>(9M25g3Pw@BT{gZ+>SYzK#9?i~P9n
ztH1p6fZ61CrA2;!L|7v?b3N%ayZkn2{;%mke%Xj`<G;SnEq{}L%I{_i|23MvU;heb
zAutXT-~E-~-~9eY0R1~PeW`y75vjBCtFg%Me#AF&GuIn*`TOhdSj~S&`Zpz@{PSm}
z%I_8n{~I)Yzx<wHWyjHx{MH4~4{7>Re)UMNv+`SHk>5jzZ{%jKi!si@ociUrNAus2
z{1za-N-G12h-0foehql;=l^w0-!H#u-*OY{NPfEl=<l(}uhBw3516g~-eHm7-w@Ww
z&0K$mP2p|wTdMj0olh?Q_U{hFx5;mT{t&FmKkF}b!7snGGwki(#q$vuhl%h0O7L%f
zzZ*dR4ozR`-wzSVPd^WsO@8-U<ky0*MsDW%jBbDY`Zq!I-;w+_1hhW`=cLx(|FrO5
zsLRi<f4vqUFpiGocVU41Mrry|ezzmN&dRUJBEMF|H*z!AM={Q7)4%)$2#n*J4)pIq
z#8+wg!fmj~?<Ytvh5vy1d)s#v`3~iGMnL_2-6FrA+UNtb>EC9H{GLQuBR6yX=b3i-
z-KY7#$|o0p{oRB3Hu>FnW2*lB!ovR*y8Qh5m%A8&adf1Amj#sHQcYj#-!G9~O8Eh^
z$?tWG{5B!1k(;@mA0WSc&Ht}Ekl(-n`Q^<`mET<!{+DX{e)(<w9s=X&NPZ0g^b0k8
zDZjgsUT5WZ*do7Y5#PwoTqo=H+u#1}(foHLzX^!1((=i<)gr&&S@>@a=s#}z4+O^1
zk^EW$=<l$|?+-|?v+~O=b<1DAzrTR^MsDU>1_l|@FTeXV{~gJ16yn?DSM#k@{rg`F
z|G(Ar{rWeK#s-d#<oD|U`t_Q=)W7?XUT5Vuz#_k$h;QU(uJila<yWKm??`?(BEC(2
z{l1+lzrR@c-=XRI<=01Nyd(K-3!tB`=}Y-NV4<G}%+~%DTIBZ{!Wy}m>nTXUrhoaG
zu=ySwqN*d;+?d~acKJ0~<o6)r_{;xB#3y~f{0968AdZgYSDR<2zttkYzal+9eMGm)
zFJh5j9AS;z%=JYiV3Xe{&Hn(*uaSpeep?Y=rR8h?rp!y#zekafpZ`&3+vPXu$1c^5
z<aZI`+vqRQ^rikiW}y%Et@4{-k>4JKHF7i8Xn(u>7HIy%CLrSS@XIfR_%{A?=ezP7
zsO8G{j}?gTm*0JwzF+^Ips|RfBl-OyfPUe3T>4UeE0La`ejYGe{jJmTlm6?y2y4V)
zuD?FnF26mR|Lc5u<(J>j5#J`iR?UB&n+@gvTW#V0!l5pGB=i4q_a^X772D%@nieRF
zO<BYODgmmt3MJ_t7MpZ|8%Uw-Wiym65GZYF(^3#9wXG0K1r@g^D(crK&lR5=ph!!F
zmPJ+tTtQ@MsmP|ZtoffacP5$K+|Yu)-}in0^Jz2po;h>QnKNh3EO+i5moV*R@pi8V
z`)6{f0Zp#_OJvHA{XZ)=i(d<tFTdtBk-w^$_3zb?U#|RhOT>aFapm6$BwJd4%c=Yh
ze4vBl2PQX*!?g19>(`3%xACAqF;$^Z!-bswR>|lO`+vrl#X|$-`6r>U5O%f}WA@AH
zjorsWenLxPXVH&|isS8PFJyA)gA!0fEGPdO8U3vTTqZY*-+xG6e)Yda2F>|jPyE-)
z=nwmU#+StpJ}A#W2|H^D&Dr05ke|?!=r6fM)E{qu-vYgs>hEJ2{h>%qZWe#!!TzRw
zfzrb}KeuUrU&!bW`+vrl#jS(n^_R1muvZ*u#{Rq@KcOYj-`Y}l{e2H4TdKcW8U5k-
zfyvF{kpA-WCv6kuzg_+9mC+ye|BNq-C*CK|f7*7D|Ndt5Hx}{}S`z&=mASXyBS5mH
z`ukBve^{kVZWh1aS6+TSItvK7w`qUJW%RcN=rO)5#(mycQtAAw@&IyIC@wUkznzeu
z(30pcV5z(Qjsv}x>hGM4{=S0zgclcwc+g)Z8assPx2eA-8U11ZFXg}J0eSstekSaj
z?LP`3KcOknU-U9}{nZ1>mg>(ZLCo*Khg)nCQu*Hxk(Xa_LX`h@`;QKkKR<rkCBy%Z
z`{ns->O}rmo3X#MkY7%J$u@WW;qzmMK1A{gHN<lLZ-9*cb_1?de<2?9r#UM!xLy6J
zW%RdChW~62`kQt^<UhU{{bhL2U*Qwfe#D53e=h>bmg=vsjQ-H2NcH!AKl%EvY!c-U
zzs>d=E~CGLGW?Hu=sy(KME=d`?<Wua$C7eUanYRqut+V{pI%0Phh^js@u0tHN|AB=
zZR$^u(ccd;{J-oYUw`XbiTsx|V}BbUzg+uWzg*1k%jxg>E$DBojQ)O-kw3)4_*v6I
zWPH2!H$_H&M`id&c+g*tO5~r@jQ%tp^jBFS=I8AXO`@gtH&aG`$7JMx-^2L-=$#_}
z+qJ(O8U10GB=sLFg5>Q_(@o?*qZ$1@0r}<ZuL(B>L*VCcZEit-3uW|oN=E)LjlBG8
zdW!sgyonf&AAiS{c%g<!uKy~P(cfvnmFh15=Ksh^I{sVNTjbxI{yIZ`IsFCD1L%4E
zVUud9{jHSI-)}PVf8;@b>R?g+R=26Y7i9E@U8+=nA9<MnX!?r$C$kKY7lX9^-iQ2h
z`ip)_%+Kquqm2HLo|nm<4bc+#cZ70{nBM`Q7gA^&fFlgl=n`1|S6!eYE`k^x7`{5L
zdDI8B41<Td;|>z@=SYUX3JuL4Em0V=A4W9_E>M4Z2B2~B(;|OgEFc72|Lh9?EPsFq
zR*ZmH${Ul`()zE3{jC^~+FS51&7YDrKP0=q+7UF4E45m@7Jnnd!%0e5Xf#Ec)~+bQ
zG(_no$|>@ASXP&NIUlA+L?~?lU<wtj@TMAnFi7vm2)3(rB*AuMGEN>O!99I?N}3u<
zq)tuAvr3Tvj$1=kT5h%_O&z4wL_~yYLZkbtr>Eqlr>V2E)Vbl&QBmPhX~F8$%#^Gd
z>Vov#Jow15S{oIj2?<pP&9qu`@&@$ppCZx-nUS461J3Zy&d*Iv$J569TeGt>Q)i}F
zvifIc7R>3Flbby&J=LmC(`7{KGQ!iek&%&MX%QN2XnI7dMi;J&$OxMrrb$mt4@(OT
ziwp%n#-3GrEf}rvD)jg2(V>kmx-m4tyJ`7Z{UeOE83sd}il=yFJ=oyqU!pYmVLGNw
z^N@xXfH-a8AFtcPKbtqfrEKt)`RY&@WcE_r;lOuZ;WvtitvJ%yg}1|^8AOb|i4?9d
zyz}Phv((OT(Mjoav`ilZ2;9k+!Jh$mZza2fyp&Kr#FFMtQcx%UGL7_8fcI9Sw#2~b
zw1NyBm3|DY2%=ZGB->Hx<iOxea%6%3*X&~O1ZO2eztfJxXB-iZQZYKWiq9m(awB~f
zn9o8u+6oJ5dVz52?g*qMba*@C={Rdgp<r;-4f0?ioL(TD=?Xyt2S;77kVY>MpXr2v
z%#+eGlL{oCARj))stpB)WCn+1Mu!wWZ)S=$K^85&Feg3NGABLDnv$uF$jHx1OA&AK
z%mrF`D&|Qe##p0~KGKd4bt5cgAFq)`xdqlD1^n6}EoxedH6;W-!5EU84IhCWJ6_6C
zfsPFeq6o>fWX(>`?U$W{Uw+Snucw9NS#uR3Gjg-@a}*(2+1B)sp(Doi%d@7W&ZgAU
zXPPr|K@SQ<wWdsmc>Wv`ldnEXnS(mOH?~}n3BV?s5CQVq5Lie5t6>@#7jH+5o-Z|)
z8s7LIQF5y|Lt$KZNl56)ulo;go0y9J5@~wM&$kK0XYC8GF<?5<)Wbg?meE47_6u7c
zNI4lj2FLa!$3KY@WB81=ls^n5W%;j>;g2e1^cepEz+7%F;foCx0`nCpKl&f0KNeR2
zjL1*%;g*DHG-m#p-n!{;86*%|lKktb{2H1O`J?PDmA{LO{8$zyH;dN+OiunK0LRdr
z{O<scocwh%@?-xXm47`jNB*Jk&xfb!4d0(52yrp6xQSj<b|ejd*3hdU8ncM;XZN_i
zhw|$gfW`q-K?1!;{bOIp@-zFvE!!xIlz%PF7er$gvHa{l2Qtg?pC-c}ZJ*_5{QDq(
znYqw8#y}FItbFK>`2oP}jHR*s&CP`jG(XG7;uTUxG(id;FXnff3(={xqL2}!F)Kd<
zkAnPi`ddr&H;p1<{oM)wEI-p9zVa+-dL)OM0_iK!L`OKzkmgUZX3w#tI;TT)qC@6A
z;<fn8=0Y$9h$e~Zmd}L_bB#bxq|+<9gG5QTCZX!ATBz{Zied@cCSil6Uvz`-=_4--
zst>9JZH-V>*B{|{XR8vb>icV}W>;BMpH>Q0M_UUOgz`CiysuAr7vHk|)`x_Oa9^Qh
zn@^2TAadHg1AaCZ!_Nj79~LEOD-*QawUu?4mRya$T=;L3=WkL^IcSFz)i8cclI^@Z
z)s39ex40;Mi(uO#RGsdx-7<R%DE+Wd^=oTWMFi?>SVedkD*9Zk-6xD{+aykIMWrtR
zB&V_gtpnhH<vZE%2-AC#V7nopICW~<d7+}i*P<0v3A{i%1Z^$WyP&NCE7&2};I6K}
zwsv-<#0tuNe9J1WecUS^S_lXtQ}O?g_<J<G@-|EpARz>?emJFE5GuNSD=KA+u$il+
zLxOfM){CIs0!ld~*x(M7vX>}@ucg0GJEBZC`*rg>|3}vfa1DX26`-q7z#4$E$j=wy
zY`(<9u^%%b9t0Mnx0!|j2sZqQ_47CQ1sMF)CEiaemBo1JA1l&ahUpL%;1BXD6ya;|
z9s&<XUh4_e*+(O<T@<zyV^>~9j2A_bjpWuM5Yh9R13yc3lJs_&)$(xX9N!5=`dnwg
zC3q`T+@15%+ik=trg^)K>=+zZHeACCaLccCkh%m|8F&WNuQZGXKqsYhw#)Ew{MkwA
z)B~&gwLqtn(mA^)^$)n4yb<oy1F2Vl#}K$v4-8%f4XTsUsRuwK;Wt9xDJiLQNQtNE
z*bb39Tf2Ca!hIk{nHl_6@#82RDSe{{cp3-i*I3vXNGi`T4xg9bO5uMMf20Tc(>XXV
zXMqR4Y7QT&!V#i5IO>RnBzl1`R)+}U^@C+&VL81(e5chZ6#v7)`T6Y^9NcM*3dLRy
zj=hE>;Ce+$NV7*agoeSV@Ga9*b8^h$u+TgwJIi9t&P_-fKU}(oGsYUKHJgmFaY;#L
zL#)v}!jPCSCdm+&fK*Zo3mFMm=CEYUH>bdnB7dDqc2+v2LRVzO#SHT#Tp02ok15Pq
ztenggYeshN9P_*si`5LLX{V&6<)*`FFCZG6vZsZUwmH!)aBPs#0`SmK7dWneo5e&t
zsmPK5M{QVPB`Z507JWRe{^ZTiO9dr(SodkZZZy)m!6Fc4SR{*Z9yJl_k;d(pz1elE
z>3MlKJuJx-8sR8eYIc?tR?hI4b6E4rOo!#F<`v_tU3a6s?Q*qPr8hJ7|0V9Uk=#Ca
zhu^r(i%f82yx(JF)}oV#py8b#-19ya(+^M>@AD9@#~+y>A*aB#7o_Paf3bvyvu70(
zDj-6ddhyoryM#Jh4TZpK(4?Hq*9K5Hjtk`YGymKi|Dljyj{iCt{&H)ASZ+D~(+~)O
zja$S!_c0Kn$?=z-kAUSzk)-8+9SF$rUq|`d7-Jes_5U*9$?<QZ<rio^<c}sL<^LHN
zpB#TZcCZlGcuTx<FaN(GzZ`!(WyIIN+?t@y1OLhv^2hy4a{O~-_~R&2TK><0k8JsY
zE(RKjH}EUf|4GO!mp_SST<XXvUP$x*0-5FHUqb~IXnw3e%qx{2zkh)+shor;=GEhm
zGw7X{<mx;4Mfs_^ovA1k1gX4?znH2}kTp@6HA#P(pW(3>dGR3=00`6YK)7c4n_H8_
zZD3NGNa}+Y@}Dl&zuTJRI-38SL@sIh@%?*5)l2Z|C}JgrWBsvpeFQQ8XNCOm=N8t`
z!R=96IE>`l&-9esTuXYcV^OlXHObJZNQ%<(HA%L|1clV&5B#b?>xK!2@rJQul8m++
zo6%0{FiEggn{1lI^81bUuS~Y1u+}m#(RR{Ub+VPQ<YcARE;Jq%y4g)_8^6@EEJj<6
zvE-UE_YRZIuDxWkT_A)^wnu#h+hK7XY>MF#gSi^%bAj+52NDS7ZA|6rkGznI>aksb
zVz6B@+U$gmvBDJSCG5M5%X4jaz)FzX+D5xyXguHGqut+l-cT{Z%TQ6E1j%fB6K%gF
zR>TK-CEC6+?)%MHF*eZN5SXFrSxUH)rK6**jb7F9wsYrVRqMigT1Ob|TTHgSCf!lP
zMnp2H680vRn|+PC{rSG}w%U@TUimeNwr`D9Ct4?ZHPDP5dRiZduFbDb^v?FR)e=(u
z^FJ}!_6z$?3wF>(lecPVCM<?ED78P>4o@~rF-&#WfKX<)2H_?bp}fdfsEH#chro7D
z-3n}LOts>_e8tK0{uEqSVrx!wQOU4|6YCcc>!&vO1sVJ_C9RhGJn6kcsZ7CJHA%wt
zBb;-NMSKYO?8lieR?OFWd8-OB=P!OiK+cg<Y@aJJ4}=i>8G?IVru+FONUabPo#F3T
zE1Cu5_%#?(W`IqEf4O}ks2@2v`WtMQ(y$!>{F)8X4ZwoH$;jd3Q7!yh4$%kT!>3VX
z`J%6qlZQQfMSqFzO}f^Ca2$^@_$0W-fN&hnFnDhSLO?i<X&77$*BB6vzLLR%5eNa{
z9pInA)o_gg{V&SQLNdKTIR3M+ie4bhrN3qSJH&}Lo7K)qp9AOFD<Cl?sQ@+~Xj3vR
zGqTJDaMCV9vr^_rfzn+NfHZGTOQ%<1;V|)ry%W~l{8X!%_6x9<Fe5wHVx2h$AbIHt
zqi=gs9i}y#v9Bpe_e47hW>KLaga_6$6*<<Kx#_SWB`-ZQquIG|%a&onV6`DF9m<?N
z-xJ?v#A22E7h-&s%EcZiErIsoU-HHUX_8wqenXh2Iha&5v|~P`!OhL`GylQzNZYs>
z5|E~zA<#I7G7{)LJ`=}sl70qaHikiuD967N;24;H5%1i6%$JZL$A3NL&-fsJxjEcK
zU@prafe@I#67Sskj|DtA{(C8Z4b6!B<>qikfXh9X|DEz@d|507BVB|sJ`9iLZ*C0y
zKF!bavABYFUJNLMi~C~W&ut96lICB_<;6=@{|p=fndS7y7HE0<LI2D0vwAf_emPO2
zX`^EAcmNvVBh5eEl9lEd0K)_KX2-y{@mziywFNA*9)IAsBdIlVgFpZE<12@xau-km
z9l1TOsA~+{;i99`S$GD=?dKi2=ROQRnZTW%jKKp5oGwZLT?Rh`*B!aNvJ8%UUpsQo
zi5R?y!0}0h7#JLFtRwgQh{2;sxzOswz~JI)splnVw=IWmdkoofy64q&Z78gvr>4)$
z&P;>N-l1llb4wxFo#|l_UYafX_OeCYUbe{F%NB8a*}`uxTiESo3%$K;+S|z%X4YyF
znAP2WjD3RK*rJIVvh@2e4*RAo@gD!3EmBO-i;>%}v!#nk$OrR7Gja)fdWUIzklt5$
z$Zw#Tr1;W%d`%Z&QvR_m%s<9M{<s$AzuQCp_!j0r0eEuqGt<B{K1lCb-!3ix5SmGf
zFTI}!cnFi`AKJqFdJp+opDyJmz3&f<<@n>634;`0dXHmOxv>>{9!`jGKhpfz;~-2r
zwqp648(XPqeu!K`y~~~RM#?`LlBBvv>~l1WFU^1v{!7O;@WxLr%<2l*_@>#hO+<L4
z_$F4%*Y~1FQDGp`lS{qA2-3iIGh3r=o1>_(|E%~%Osq;VFQoW}>H+xp&C+)Oz2ru!
zYUyeazT`$*)zV8)TK$r38vQcO1}u=^Ra<SlP<+FF^v_nRrAH8A*-`Ryk2u(<7Fv9x
z=(!hw%qxJoq)M~QmrJv3*8{8I-E`xkU^%#<qO}6o?^K@+8kJ!y^s?;t2O)wFS`OkV
zPgSQo(**C?`_qCCsy>6i4uB}M+JII-1UbKX;$5HZ6Kp%kR<Nqm{fckA`nVTJfS(gv
zvPHAZ9}@O}X#FhP3Gv;Q-Gq33XQ2Z3lq!J7Fl0V^ds^^r)o1Y60qzCw4LCDF9#90^
zz?0*Eh7L--{T~BWOL1c<D;`U;Y*+m9XDhyV`yNg8#f@st;t>TLbT7HLr;@jll)TM`
zwp1#Rw5ncd*)A5Q<LrHD#Wzkt$D&$_2LTh|P-UQPT1rwXuMODuV5uzoL}6^(T`+uY
zRHLd7F2nxRexQv7pbe#Ek3@S^Z9WpUwcdaRPZ;bFbJ+H|GLQ&P=_n<1d^TVQCkjgR
zdJw8u-0`aVtP2={zwLrx*)Q7N=}@X-rDeY-75jKnachZ+eK+7>6glI*Oip>e8?fDD
z0xDLbHmBhzH(-~GXk<?#uI7r{Jo7tZ>-(AR10{_Rm&2>-+6jX%E1y;5MhY7?e|u)r
z?i(k6z=XzMjJAWus^5D-ws_m6I-m-R@!N#;isS9aq9{hy2it_;YSx}MUf-Qk+Hu~l
zcSz=AV0qnDpZS2QS__sfs6)iHREt(w2Ugj|kYO9Iv{Vw6VUpM$>!3Z7Bp*v9slsYY
zHL<cfXpbbJ_3X;D;A+)p@aF?GhTx{-c7pAkWQ!{;|2a@WhH7zD+4e#o+m4321YNZ?
zWt(?D!Cr0KQG5({h-Rp=w%86f9&FqOrdyPMpY34rNdPOX50-78KdATyy0QFl!<WRi
z#4WfDCRhmvb!hh!#WYMad`V23riN@B4jO70+PDStG8Ku5f-3$zX-8rf6Wrqd>frB4
z9+U3;!p=b3@z}!aB0ODS&n+DLcd<5b&ngxh$|pbp1t?)Fa77LGU=bIIMHDtd0WlN_
zy><Xv7Hlg%C^Q}vHX{Y-H;RO^8~LHamm-!*A@n+E4P~jm3LrXPC+KcSi*Ix-{#4iE
zKO`1EUMRcrA1XV_j?Zi0am7V=UPLMZwNNRPRiYNE8hRUbKdVZM5pP@Ten$H?0k@%J
z0990>Dqvgt4xw?sfa^sNP!$(I6;xxWiXGMnmWryVoIgm=UC56zY<95(ldVy({Y)(Z
zo>w(YHEiaM!Kn>s(dgE}Ajm#$u!M8#(W8p^U<uGe9ySG^qn6OLurts$*{+b{C3@Y^
z?l;*k0t#&8hR0W8{iAVLLZN-2%wXIXt+T0dR~7$)g$3iTvh8U+)L27}n;1P9cQ}-1
zNbwb7+z&J3CgL@WhuST<;*;M-H11X;0&8zbW%VrLQ8ORbSmk2oVi{HORc>Z}o;UNZ
zq76wb{b!k$j5=fXPK@1I&Ap(=s?w#9ObuS9miGvahm7k94X9;PS&g)o2k{19IX_O&
zUCEcI1Po1HC61Oas)SbdP@(Ly!}R|{`WQzVK$7j-X4(Mmsrf5yz~I^j1Z)Fwu5BP$
zYy&0N9X8X(cA8qv|AY2GJ-@*`wOXuY^6MCAQW)niRg1TkU4kal*w6!<rK<EvK%vd1
zvG^2iHZ=xYlc901p|O&-oXgmvpyiA$yEH$u_%dlZX{_at7TvJ0<chbd^aUVSaz&{s
zeT7_jsmj*EMcH=MGH8Sf(z=T;ld;_6p97#Cp{!+zbixS|H1&EM5@XxF^=`xpCM#)N
zha1ddqqFT0n|2a(8uxMn6?APF?1~XWhC&xrlPX=|UFG3iCwvqAgQwmmKn;MWZft-i
z3{~(Jl#@2$%}@atz)?4%qpmU9nv9KmjT-<3!nvZvvRY`uw56k?zHFT$kmuz%;{n3+
zErM=ezNBvEle&2pD3H2&iCjS4ya^XrH<b``s!%=tF#zgu$FFPMXdQL42GWGGLym^d
zym~YJd!}5)OmI~%_U4j`iEzcZUmT;7VF;_vPVO*gg)o1y6SfaH_cOpI36t%T?X>MX
zXDbqG4hI*Yd2#ThD#fJ>+wQ90?<(0=jK;r2Vc75()Ka`EZa2}0QCF!d#gB#<Y&#4%
zvMN%Dc&ewXmYmlbD+;{~%X|~yRk1OGu0~b*BWiY=-YdjdQmIVv+P?v2T?$jhJ@BhA
z*=klM*!CI^)DhGV0W?(gsZT)svNneGXd8wDM`33JG|!T%YYDx!<ii*V#!#1qlFLff
z^2Y#uTbrDC+xEuq5^S}Gs=A&Dib}(h%7+r5qJ{JE%Z7RhB{fP%p0-8N2HQD9Nv&6c
zYEz}5<lNB&OXWToNgIkQ&qE^y3LQ-1_&;u7c(I}6u)<)kH0i1qb|>vfyT1X3*HxzA
zD$zDdF8eG}POLW6C^R__X`p<tH^gMCoXEQ;1=FulwRlTn*?v`NFVLL{CM;F;;T0cx
z!DD4G0>cI+T*RvqI344+nuN`$1-o6PF!s6vg<8d_7>HRX5WO7*ML1Nv0T(Se{U$o~
zi=CrwyP@Q$ifP$cQ;Fn_M9t9nK+TDu=A90e{r9Vx*t>yj=qdgUT`~+5(}Z%L`-0$F
zu$2a`gjgIsStHB9fUJSOg+r~T4LBnyzCu<e{7bI1DTpb#5~O+zUyH`sBx&RuAAr0K
z2BYqhsuaH?0{yE7#+ceO(3a|Pv*kvdKsL162$zbAVfKpLcB&7~@B6*vWRb&Lgnww;
zXRz%ZRx#*tFvczdOeu9YtPhT;@F~NV0QVUfLfC#GoigtZp=65>nA5fV3xe&65PSiq
zS;~sotGX(^>eX!}P1jT}SL@Xmmt6JA9~iu^q{^q{@_n1`17a#uy-@LSU>RJNoguQR
zjNcNcUa>IHpV+X`wlzU(PtYE3$St{?vp$F9s;Zc2cVw&-Gmaz~O%<7e{wCX5nzzQN
z+iHz8Rip*_3+13lRZoRs$)Lb=RVnVDg3Virx@-Ao5^dKKZP&}r6!mF{+=Nr4`cn8w
zwEaf%l$}|u=E`eOeVSl5+P^Mo(pWE+G=*5bjrOeq?5FZK25$x51OsJ4!=$TQs23`%
zC=QI4#c@ZX*YBl2<Oe1OpCY71bd#=WVON55k{eY+m1)m74P&5a82Mq4$97sM{t8XU
zv1Mv%b)xM=*%{S}N1%1oXTcA(i2D9F?BWhFKqtXzf6&r#mQuEVJz9mzxFy4&TD&#h
zRxb`HD!Q~a6kkVwInNJT{3g+>#@9Fa8LH0QRlEc8co|Bz7AM%w8XAuzsD$f+?K@NO
zdD}Kpej)h0YPlT@O?$~uVo%enp57*uT=ItNcAL@s1XbLPk|uC?M-*UZK7#JDYWZGB
z0OH^l&lr|$eW;|V)jUf@IGTr|Vo;~}3ZG5}d#$1E-VX!xLFdVag99fGy_({CZSy*4
zJ6}~Fuw=W&u*|OvJpNY5W7sytE5vr8>U5WqV=8Lks!zMLGb|gg1lD37Yb@F3U2g|$
z+dc;YG2_9i-@BBYbY=|qGb}4m+5qeiVAZGO-W%^bIPZP%-q(5G3h#ZK_pLz`)u$am
zh7oOmwQot~6;<gH6xIei2^+s8-q3c8*l(iO$%dKGej8G;5dI`5k>0zcNtxdovimeZ
zd#pO$!I|U(yXr_%tA>7<<m*goRnp``l3F)(Vlw$anT8;xHsC9A5|(Ab_QGw@1L1s6
zC~0b2q=~m(F4^v-+O)mo{87tx?0t%>u=A;^??6|A;s*|TqU1Y;y-Lv4E<|gOr&C{;
zb!yK5EwESeo-f_s=Q12tIPFm={w)Y*s8WBZ1{j+}Tc<IPILDexO<eSes->TR5=*YA
z3e3e<@L9cT>AwH~%L-x#39o^lhZUKi;w!5GoI8zyZF>aWZdKVL0Fpr!_)cq@i{Cs9
z#60*-Sdb|KOJ*E8oJV#dA3=BC3eI!SN<r5qF9R&xSI{-)Uuf_aU<D0^mt#ang9m(U
zM9<EMz*=e54M5t%{40(!ZRd^q>Jx1{jE(z^UKfVxeD(~hSh&YGQ5Cn(sETVc*$zVI
zn*Xg342!yFy(@-Z)ooF|S|vJO^-lD=QNdThN0(fQ-4qKYRhdqs`@9o0>-4*VjL%Ig
zzG8<CW<CC>Ok1eiCHWj~SI*@IJ6$gIw>V&R^S7NF?&rL0cU8}LXb1mm{uK=^{{iM-
z(G+juUr7UnGI92c{uG=kZomg;3TBK}3-7Muhy{m4f^9dfW07&x1{_DhE9fvOFl@r1
zRDvqL4#rhN#n`T1FswQYi!cY{ZD$&PGN^<z<Pk&3^>(@4$ZBiJ^|V}7@pb$liMXr^
zjSrT3Ou?6IHHOXDe+j`iRLk{{P8=+xLZ6FfzPvBMTpVnNdGn})6~M!?$x93j$b3c_
z!O?~@M=KmSY3j92=ygNzI*29=qd}*$#bdUJ&&1I})oBg*9BR)l?iRO4fP3+-9|`6p
zh(k(|2+a)2`CS9P(vewoxwtr3^?P5Z6NUDHkRT_-M}!1AAux$U9JLeD8eQ?-)Ni-J
zn*e8`FW#fOr|E6+p7ZnV@SgMY?eU)T^BwS>^YeEQzf1hQACy^DQV9z}6HrgGe!hMX
z>c+mUJ{)3Ei+!D*oA~>-K*p!Oiz7YAnNFNOrnjp91FN6ZLZCC9cz#T8UH^?EUF}S7
z4Lxl>rnjm87}Bxd06meercFsxYm($!{~}EaaAx!^X=+2dl(r3vF&B2UG-KP6CSQ`&
z&aL}u2OSGZYVX#4wJ&LEN0K_YbzdDyn%a}3J0#uL9U!=$hwdxHR^LqTHL$O1=Vkky
zG;Qd+VB86vS3HbpJ@;Pl%vGb&YC<((ns7~oCQ=iniPq?}8ZCUVOdF;R*G6a~wNct=
ztq#7Fs0|Gb4GRqqjR=hljS7tp)rD!ov|*uPVPWB65n+*GQDM<xx^PXnHas*uEId3M
zpK?ZpN5fYRH4)l~(1@^z@Q8?r$cU(j=m=e;CQ=(28W|QD9vJ~&MU0A!j?_hIqO?(=
zQDN{2#)zoMsHmvuC|$HBS{of29TpuP9T6QF9TgoNt<!;sI$)0<P}D&-9e^xZ8H%iw
ztRUEC7K|6<CJ!!xq1w3s-(Cz0kBE$l)}>5OO-s+1G1D?@cIKR{?3}r|dDi@bd4=;A
zaOmU`A0DN_Ke{Y@da?$dMq;P81fGlHLm0)5e+*=Kz8FvwJ-hAv0l&W4W6+cpTLy=P
z<;B?TcNyM#dvEmGS&t1E)2h#)x3=vZJZk;on6R*(2D^P*Y|QF?(QkQ`4CuI}&!A`j
zy=(BmBSkS~4LuDRCu?HuN9M=R{CHn<m4C^A^WXFt)NjYG!5gj>#az7J(~xt$CU)1g
z`SJF_cMsYB>AvW=P9+1rIoM~AZP%{B@7jxEcG`OyzO>iGzHgr&zboeMA)7~55B2|S
zU-T@%^EuRK&^Ewp1iUMNcNy>+0q+XnT?V|yK2~E_z|8{Owt%|}aA7bFWkH!iF2J<|
zt{rggfLruj0J?4kJh>%#+O;rG&o90-Juo|KM3eH)q|f3uj(YQ(nPX0sb{wZZ`N{Zy
znNyRu_wbwa#p@qVp56YDseNkNnHvh<n|A-9<mrWvw@K?d^Iz#bwv3rEYNC(j&FnX4
zt=KstQy1fv)n>(O+1oD|=Pt~?miyk;m#y8R5(<u#UYggw^FQYAeqR6RmQCjtzF6?w
zVkl41%N?G4dcvuIn5`?c^ZNA~8S}&C#k0P!mc)!&e{WgCsP!>qwwUodlp8~D{is9V
zUmbgA_n4=*&Aew^Vp2?0)0VWir<KMee0uTvH-#Hw4!w~xxZR<%V!o4o^d#GnWc_mu
zwZAP5>mKv)GuJPMPfLoqqv@I^wy-p&W8|Psqo3Ol^K4vs=BcY^V<7VzIoJE>LEpP}
zT}u}84_u+2wehG=MP&Dw$E+Rt1WZqgdE==)552OWG^Tw)^`{9hZisnuj5Y9i``H-X
z$F&7t+WY8-{<5IU`}So0ix^^75IUQeR_nWs>^k;)pp$*R!YTlropU~X>U*H`@b-Hm
zpF%nV-z@nP=tL(B&AkkCmUjJacO%dV0%QIY=pebvKnKg!Xlc?<jgL?r19}^W6&n+Q
zp5^6VUOEc&s(rrS@&eHNqip5H8$fUUm;uRlp!Zgt5Ml><dwc(I`3BJ2@@LQ#JJ16!
z5@rW_NOy5*h+%m3z272TzX4%ek?zyJOCo;(x}UXEm%a#e)9(m6VF$WqU)@=xJ8xK<
z2Bh2Np6w^>K)2t&Up|X;u^N#s)Z@t_pbO;B?&*|jxHhuB4(VUt_tZY5zi7y%1f+lW
z;k@UOexKb*FnK&1b8yLMn1c4vx9@cd?vwQ+>Ze^t`um=mas%mOy(4|BHKY%GZXkW&
zbG_uy^M<z?e?5(SY8UL@k9;2O_83%6Y0P)8P6thHh}k>za}+7&Sch*R?xXLXv;*Q~
zeXrwR*pbgFzk_z<GvMi+cI1P#i+sRN?8pbK#EyLI_RaRRufI05dcA7{@{7CgcfxPg
z`~M>Rblq1Gezoe$gx{i%uM&Q%U%Nv1c@G0P@Qd9IaNxJU3gEyGtpNFfaT0z*f4M^V
zffW#bcKg+y<~7P#)ki%D-};f~3EyAec#rV?u>)GnhL|o%zy`|M;c1Nf=vNeAoU9KU
z3lZ>LvkGG1TRR_O;EUFRe8H#*-!lvCgfCbN;rrr?cEZ<QWIt6PM8#Hz-%a>mStIg~
zZu>sr|9H8`f9CH%7x;VqiE$sj;R43V`h5ro{&5Hg{;LoU{L!kAKQsoy|2V)=&tO%A
z|CT>R{$UqI{`Rx>*H(3(6Z^SAl;h5SiE>QpEXtvML6l=KSQE-|lEi)VYe<}|7cd4n
z&R`63ti>4QK<h&}pb-%{)<KMNfb|hMF5eL4Sbsy5BjbiBhy6y(iPf6dW81`u@*Jn~
zJkmv!Cm+Rudf5+bP@Z2&+(-W-iIer;U<~pc#~9@K31g54trX>f#z*A&8Df+Ntdz(D
za8fTv?4mq}?4mp;?V>zK>?`j5>WhQ1K~%2GRIYhcu4k!SV1*FQ#z3Qk&_{ob#L0RB
z2e}9w<RWm83*jgi!b$sv80A7ZwhMq0xd5No3&2TzL1QL*x<=)?Y7e{r&)FT~SbyG^
z%6XN_30{@h6%q5r4KY9-!r2%Sft+GY{Wi!+?m<oxgPa(noETF-LFB}HloKM+uBn`G
zPvnHkAadHNoOUXwz36Dv{Axp-{nf)|6T%DP>@_21%&B@O&OYd=X~&a)iHlkON#Q*o
z+!;Ue?6HH#yAO|l>f6NDd(JJ1zclQZ8fCvv;y-@*yZLd2r{h;DgZe&Lu1*N|4*l$p
z_u%A;(i_L;erHQ4?$opYsRt?(dL24><*4?Lg!<)cbQ2#A9um0DciGtr^N_Attv>l=
z{WC*WZy(b8*MHUy@m_fN^h<kh40$ZECO0KEZ0Ird{5_XD%^cdpG9hmLU9SxN@U^ZF
z9@xEq=sm+$|FQJ3Hp2f*sXiZ^I#@W_t$Wm!sky?mHAlZH{PUkeVQs*rga7_f7`|xF
z#BFCg8ef?bckZ*<LyX(P#{TwZ>xIV2Yd-$yfzl6+xwWsY(VjSATrpsW@8U;#40|zc
z@m9YcqlQ&p|EXYqO4%^YqG!7d-MDes!&yINW`2Bb*w@>;EL-|Z;Bfu5ZnNsUO&Y#-
zaMCet(#qkT5|2-MIPI(96Q;d<K5^0I;d9peWWDxde^dO$Eys`7r<(3uck!M_j=x~)
zzB=d4{CoD8R;FYuwd8sy{&6{`-g{(pVs6ulU%#53l?aO$exF}|J+a$@+I_*B4kf<&
z!hj*xckdXH`s(p_YRh9s466C*;Kq=7BiiepU2eJZ?ufVIerhbf``C!5R(+HI`WszG
zezL*Xx!hzL*|Ce?ZwEgp9(m`B9pBp3<I|Co?ceU*{CdO47dDq2`z)bXQc?d0ez@=X
zaY>I{JvZv?wI`B#yd3$=oj+G5O^^3!`p2DrCM_7(>Qk@D501(lSKaZK!fB&w9t<Df
z?fF%s=0{Y$bL5NdqcW?Kced}U7+rHd<jW^}gpby}zj01(Z_DVKiNS4EvtJ#3_u&oc
z^{*co-DgD5<~PcH$Gn?z;r-?BKRl-Wq6ug2>X$cW#FY2yrZ&AbX8K2mr{`b#Y0N!2
zHB;Me>@@a1lkSu9nM22hyt?%D_hT20U0A*9zW0p(9y{fa%UJ<Go*bJucl{IhK6CfD
zQ$s%Ldhv%*<6aAx_T$;nkB{4NZ{dM=PJKS^;m!}G?aVnp&hK!<;2XQ{8{ct6$*#fr
z$>VqW?|=1v->1f3U$t$hX4uy8g9ogi_{Hig<1+#~umAHk&4i*ecio@2BW=Qwx|h$Y
zuD>{;{KGAO20y%a!tYbV@;*-VNuCv<SlKH@m%KGr@rPwYcJk-JOQMe*cq942@HN}M
zuRWX`ZV(DPUiF(;8Pu=g^pv=X=X0Chyf3_P;(IF!RQ(O_Pu$h*ZOf**V-sW6bouJH
z*YBD%vbNiwZ<Qxb(%z%FEX;ds(&E5{Q9bVbY|_j9CbydY{cn>VyOtcc$hY_8HwN}!
zwfc$ilgrx;+z{7q`Q+zMel=#;>Z-|u)t}Z)@xC<KwD#BD;iV5v>2KWq?3&P&DUbeO
z_*^J@cFLsDolbW@vSUhN-thf7I~7yMC;i+y@kaR6%;V1rM+eWETK)die(z?inQHC+
zN%Vvz-%Rb4a;){7HEkbxXJKMsypR5ogFj5`H?EcSk)5436u#a1Uym%FaH{J#;m9K&
zJeL#_QPJ5v>5Jp@AIlNUa~q}xys><-`GJoHoIP>ZN9J?pwzH4?bjtkOXFC%ne0$Hd
zKSsY=KK{+o(>{D)X~?@HmO|?Y8Ze>vrfJIOCzcjOT$r}yTK0Y4Y`H(>;?<oYw!A4R
zg^OY~Mbti(a&XFuzHtM#rL+(KsPRDU)s&@*y$edGYN!88QTpPEkJG0gP@J&e+xw;I
zrRuZhF@Nrz{$}0jsI{T3Qg^?8B4KpVfYhq84`x5JA}3Wl<E0^mAN^12b$x8|_@m#Y
zzA`hoF`}=3+O{nht#MKDY4bkPjP8;!KW*I6FES=R_d!}jhsdLin|@7;TM>6S|Gj|p
z&Us@;95_58{kNJw{7Z+Hq@TL1y)(Vr`t+2-#go45`Fr}H_A8nW9_XFXVfVj3-L-5&
z#)@L|ar>-_jLYjj|NY4HEg4ZS&pQ45)k_&=@vTlQ+Sqr-fnj|<c=C^w8O!eZZPLHz
zJ~!iZ;9KYK_1iV0(>&h^2bOuwJhW;@U*Cp^nRg7h9<?KV_DmuE#`ITuzBY5xx0|k(
z&G>fax?%4vm{HZv^8Sc--#xlsZ<#dx(4l}+R?E2oU*B;={kG*`{F<5NV~<)ojIWJ-
z-_m8)irEVebSpK^%56PSP@gE8)#iVq`h}nUXja>bvS_b{x>=@k|9rgazMixDj}Q9e
zg?VFUe?B`@TQqLj?6+GNUH^I3m$M&C%YJ01^5X1>!R;d#S3i*XScfO8r+z#&b6-vL
zKQ^v>I&<sgZTkA~n#`#6O)L8-uV?noduhP<UZHauM#gS`=U*9fPX7Az=UvCHo|C<M
zV8oLj@0-(p%M)8Z?A1E!$=rTn_r5(a>%|$@j*K2QH>;@l>hq^oznOI;<;tR7K0jnV
zwCIc9R~_@uE?7PL!2vxIvR9R~{=|3sg6u(^0_P?yT9>`E>zuEjTYWrx@s!#nUsQL?
z*`r&ucU<?RoY-Zn;~UhaIb+_gzVrUz4LNnI!e7eHJDbz-Cq>nLYx~R{*Ttai|8(-)
z*%P0-zVXv1=N>z>;OFqr>bXBubnCk1M&sPk=U;s(_eQ_m1DE1nYqNQJ?y^5t*|ujr
zpZm7<O2ebWzRqoDUYJ)gLYen<!Q{P~W084F#^(BL`bTEoUTaP7PmjKq=QDc#JHI9$
z%q#ongy-%)+uqu__R>#t^9|O31=ex9_vc$*d12q_;-T+YQ|((qKkV>}b>QZ_qMt_I
zncwb%q$A(FF)Tl0&eQGF|G6Z;(s$m78+$&^KewaHvFqNa^AFxIy|*}4T~Pk;n&f-O
zj4cQmQTzLe8McCrDGO#DsoGr7Wzq82ANuZM!Nk@5%M11d&C4md+Hb74dEWh@n^t$3
z{>;1&7XMcL;(*$DlV3R%t~cJ8cX^9{ui7)Ag`Zs<8$94&GYa3-y#3L#XI?Ix@yM{8
zh=uzLy)I4J72BiD{NgZcQRicW=4;lh?QgmxcmCkorw6{e@}Kif3+A<}3IB0^_PbAH
zTwBv|LHUG!O9r+bvLNfd=xI-sKe`}2v(LiFs1Fw`9@@8uPuYnDk4$Xrm2k5Aqu)P2
zAfjPU(xdwZ+mt80%N|Xrc&Ow^{KiLzM_>K0{p@p(KGJ%@E4#}A7hYN#FeLV^i3=}}
z-80+fyK-UlgVo#KY4_E_ZGYsgAAiT?g-z#IX1tr!f6>6_yI0PBI(1Ro!M)bCp7+8c
z)AHacwX1e7`k?Ve-SxY@7r&IRST^W*)MDi`inoXVG-vTIll8+!zWw^*?{fFv{p;96
zi&w7jIo{*JJBl`b_gL1b0kK6vEBov?QCm<HW_@>1&qv=adbPHp?BcFpieMZC;cU@=
z`x}7xkQ&3y&i`O<%J~BxK5)ZehP5dScn^;uNNB=emv3o~W1rGY@KY-fu$w?YD<nA-
zif`TWD8J_M)=<3j?s)YKF9_0VDIR%YLi`p4emhkBlEWqZFa&=6L7_n2xaf=F82-4(
ztNfnPL_FLqg8|PFli*!pc+rqVkIhuviFo8QrTlj&p7dGa{kYP*jTiSJ3IjPG1@*av
z@@NIu7_cm>C~S@!U+;7;#u)H0f2B<RZzycBd;S7Ge>mh<z_SGm_#J&uvQL#rem9^-
z(|lu*2b9@c@8#zU@hB)6rYF;MeD{;24|S%S08~iRN$k)We1jv_Ph;?l9_qK(tEA2H
z))lR&`UWcfqT#b11VJr+lLM4!05n*@2YR)XUMa@z^bCG_7jjv$<RB}`)`i;k7xJ`*
z`W<cULabbtm;um4dTEs21&o`Q?MH99qC!>-s7~B}(1u=jgSb1rz8B)2^tunkXv2tq
zKm6lX7re&h=?Cd`Ux@qBYpj24%ZP*D;t!+OxKRdSXy+IYpz$CYKTKmijbkBhE_nVP
z3YN@0cs{QOSIS+(UI2M1A{9Oq+?K{65F?xgmi{5d??@9E#Tp97$CDTsK3;n}PKCfb
zXYeK`1UT>6)vbSnmw9DIL5#f>U0nh6&Rc<2;2yjcJ=}o+@g`qsaZmDAsNI1CAFatf
zcoWN#gG(NQP!w+kTAX|E7QK&Kg16hL5F&~<SC1^y9bh{A_i;MVgdZX9t#sNI>$es_
z{q|ClZD0hG^&k7d5qIL=Jtut{V2mbkW*xNO0{Av)i0Fr<0o#fk{6#{CNvBYdehqMw
zp>LAI?@sXjoaB)(gpDAI9R5;}rxSPH(=icUF%eYITj{Jv;<q8K8}RL<>_o9>Uk7(P
z3I6>KIPv3fH<-|O+9&Dr06q+STPLN{K0#~}jsm>5(rKThPlJ?~pd7uGPCH@!!2<;D
zv=idb0slGpmn-j75AbJ+JWl&(@+^Xe+*^sBQVgVzgv+Ji>w7CnFGv!I?}w|-1dbk2
z48(`SC2sNPq*PNV?LXmeE$FkC61}Au0%>d@_J-b53_&zLMexy!ieVj%p9RO&ONm}q
z4A*Fk5IH?~`mWQ%gib8Y4c|D1dkhT(t|!;{6F{2?h(iMUJJg=I4hm1-L@*gH+|9wg
zs6B!@NWahUlRdysd4RV?0uZEhW_f`B+XFlh>RpbG-UFO$RE7-F@{SP6xWO$HE|oKx
zgQKl6J<Q<fVBgH(1sp!Ap23%MaA;}{_%j?F>xki3Q8>!4=HU2_HwKiGm*;T;70cTj
zt{I(YDID>6dDe1pUY-v)I4{pn6fTvAc|3#%!aw8t7)OVf^C^xFFXtN^J}>8|9GsVP
z69?zzY~bjt;hM=aj>G5WN#pSE=kRB9aK3&Qaddb&`FiB#{0E26%ej-IuZC+TXCa5r
z%ej=p5908j<lwwM*HE~$-aq2tyqp_3I4`FseKKDqt@p<{I=uWZP&nfA^1sHxdHH!c
zc|C9A==1V_&B1y3uX6O&aLx2g-4*cz4{>la#YesI^1sEwd3mZiI4{o*4$jNdMB%6h
zHT*Mq=n>gO9_%F<TuTK-d>qp=xRHb77?{CRI5_rt3{Js>zLtYO3fCB<<>kx8m-j~z
zo#6B3{gs3B<?YDHqXrx%4}O0T1C|SWVFn+@!NWNCBOIJBZ!QPt%gaVSNI#IHgLRDo
z;k+LBc88-!CQm0yAN3Q-!Ero;0qOAlsV6%4S_lRyoe&Rnl0|fa9|hM;9^RisbMS{a
zI=p^naByBfmpQnaqtgoogn;Ez!$0H8_t(5U_)S|3h_8cxhR@m^CiD6Xr+lUGw>Wul
zG{xwQp!6}~_0PVABh~+4z{7y}1L1!c9T%k{5CVfU`U^y`8+<DV$FUj1Z^y}x^ckF;
zi-z*>`rpBoi`T!AmP@MVxgOx_IXJIpJm(DqCi8m6J(d`x@EDE`ujenko%p<-4^X&N
z&uS5!(5I{jgseTm6|$kM2wWh)B8-wGkcAu^d9d(5^a5$nDkP9y9Nal;Qz)7^czb${
zk($#38>=8(;NWa60O6$^+z$aXyuiU#3<&X89Gvxun2g)yF`)b%$(8uyLzRLN^HG>G
zh=X?)QOWNV4(^<tDHIDi_?;a7E)L$6g9mW+i*pJVW^(WV2E-V?XquWcU;61Z`khnh
z$4gz0a5bCB(XHmxnX}CqDHiw7klyr*XwmSMPdvNTJUu@nBRw}g&775xlsZOZPMZZ^
zQuX`=Hax{6Ei}VY2svc3w(zW%NV6GEc1h8~`4!|i6RpOa9~K%LRiKT6Ev_1nWLAqm
z(i&<Wl9`=iwPejOTeCqMDY<#(ndyb*oZR$O3mypWAZyG>NWgO`A{=;d`bvH#oMVzY
zCe%FE+~T85!XjmO&PdNn&rQkvkMg~RvZnnnmG$r98_g<7G|L%SaiL=E;u$({u5*j4
zOF}B+?<1A=7f5NN-Hpg;swSWu8s&~*&W2;|!QRsnLKALc&SB=U8uS0Ea5u4ozbc%h
zK4-MlRY>x=e=)gbUr3gaNoy&4>h!?#=0}Eu_e+?QlzJO^!$L9dEX?cn1<e*6v<2Ut
zmiL%>GqZE8@abo#72d?c&|$Vz`di?56SKJ$j*>c(@g6OeT|!C5dEB(W)IzOigyy;R
zm2z}i*m+7MlJP;!N|YueksKX%Ui-~P1gtNQG{?~|>zUImGc4A;mVM(B4&WLp?K#Es
zxALIBhBMJd=B8P)QgY{;lO4x$(NpAaCe_Wzru}Egg0zw5F*z{mfKkBTDeP@hWfcP>
zww&yFFvJRL;n!MOMu^3lWP>!QQ4>0ykT3<DIhUKCm1@mM%Lrvq$AuOem-sPXK-Pxf
z3cz0r55wXJKc8XLl7@&^b^Ig+Ky+Hb(8xC+5r%6le9-eZ+%-Q(LU0?%c(eTcoCopw
zISSt6BQ&I`#~UuFadHTO%?WV+hULVy9SjVPb54GKLlWVq5*KeEF#eby*GZWCEItS@
zB0rtCz%2<$G-l8B=&hUl`yhePlH`x3@*k!dkw5BKD*sMc<df6iI$EhsG(U@^`r8Ki
z<@D!|ivtjlF9wW}x0Juh6Mw3pZ!t3$r2L0^;GazSucUdAKboSH|1%!=uLL-T^J3)q
zmGXbm1OGZ1{%8wQ{#`urXAJ@?hYM2vDi8b%anT0CS}`K}$N9XJe=#g#%GLi$T-=0k
zOpF}AQvM48Pp<yebRml8k9np1I|D$D{}PHw_9!{HySHE5a3sgSR)#;WH%R$Mc`83$
zbYahdnF!MIhk7V~4t?}lNizx%<NAe^e>}7^x$>{0ev_IZrQ%-x7|1VIeoc&+h50Gu
zkLw{){+|5TE*bxYYsa)%I^yq{{1X3DN#$qH#YJh{<^Pt-@3L41$O4t0_h0z5T`K<y
z#-A~uv4%R{=JfZ32mPt_A|YOX=)a}>J?ZbTjQ+5<mFjOE07(5y^rxrtv*-AtH17J#
zh5Ur3B!9GC%)#pqcLzx2zYO{0?5~n83gVhAAEfsG2joZodL9X`{S6{OL*W9%YWSD(
z_oTn$GWxq8@{_W1@fh%va{4<*<!AdrAPWgn`A0y0IsNIW{3tgDjQhZUOXWW&BYzO&
zm&(7@gZxQ!k(KRFfvhA*<*)Q0|1uf*?*|GkmH(QI{Cy$6RQ_i{`EvSSM+Ig3UqtEM
z?RO<)mec=UDt{%-i24tP|CY+{OBdp4Ga~he&kv>Y_wpdWrnAVH?b8wO+~vo;v~u#V
zj1_Yf(u^oS>aV5pcaf1FpA$;uFJ|o*Vm?&fDc-UDJ}gaYKe&!AC%<o;nByGHi1MQ^
zXsP^a8Trwqr1Ib4LH;Gw@v?nMR1CNAudfIBo2dM}{!xD|mA@~QpW$Qq@0O827y3Cc
z0fkbc|0ReFp;n9>zf%2wNAsg>d=Tyt@37C|1M<SaVo&}vTt<GxmFj;D6i`n79LhhC
zaC81h<@dyYkPLr(t|sNL^Ps;qlz)(uHMwdj|9Bbx(K7riV4Npc{=Jm{wcF%xlHrff
zjiu#3;z9p==~ljVx5<C341b&wNcsQjq5Mm5(+>o;e@?t}_kW)1e~Ju$oDxa-M|$AD
z=01@l+t=rbKdMRY%#0lAz=aZE?S|3AIT6A%3_xR+|5XW`<!5msq_b-tRV5`z6Q#JN
zFhB*E+j(UEG(Ve%GumJ-E};nWqfYfMP#_pD0*+FK0^AOPf0m!RSH%z*KS*2`$vBhN
z-+DTLMl#)H@~6(s&CbeZCw4S{9vOZ#MomJ?&+J&jga-b4_{ZNapf#c7w*cp-5pD48
zMZtDbD}Lv&tTJCOtl!f(=GQl0`bsS{W(L9myL$yohd}(|4CLw}era>y*g*gMU_39k
z>U4}y)zn7t+6xC1z_)$^s_T$dc{KgN9JwPu2*x0+{~`R-LyzJ49*zCUfw^@+;z}nV
zQBBe<HOP!ylY2RN$yX2wSrECmVDSmW&)^8&@qxY|Wd|yy38W0TxlmrInc1nc%`?)i
zR?D39pg7aWxZ&o}2?o<xV`4(E8XrWbrzzx+5=V|0Id<d-W1Is^@qglcw=Squ2-0`F
z(6(v!E545v4{vEr#<yzJWc+~r00xHR57#CFacv*dC~PXmNJB5uz_x(XTa4NG5-w$f
z+&dxv1WYdlouI%qb#)}aH`#UPPRiSDg;d1xCU4BR;=c$D8tF5-IPPb`o8!x1BjJL7
z$DoiV;D_2!H`4Gi0Oa5X5BOhr!0!ff@@Mn1`Zxgiow#=!e5nAaYyNCrQZE2I2z+}f
zu|~vz^@8Ck0(aIBgEQZUeiOPM#~!8>%me}9NR91nnuS0JATIf5@N5DV@o~=$gIhT`
za%XThmXq>Dzl=f37wZKB@&z~TpfeVM5D=f|JCQ&|IL}v2;Yf$+06~K|xHrAVD2an3
z4;Iqs1=6A2f(U8h<FQDwv(Sd-S>b5h`DWsa!m_gGB^0#unV*xyd>}H%m4xe&#Lex|
zNzcvA%7&*U(!DxJCFEuguw-S>YBO@P=a|v;nym@$TYg;pE-h{POmjwV%AE9@J`}`l
zJ#dzA_B?Z*SY(hpJ2%0SG+gd6bMpr^I;H0-L1)PWJz%A@?9rf;2v-d*L~c)uI@nr5
zRXBS12-x$a)sWkqY)h8aI7SN_Cp6~hwESGyRg|4&EQEa&5#-uv%G4&nKkiY2T}onL
zPrv^5hhDTD%!kIrw;Kvp)Y8WBAvP2)@NEylOW_}3*tYqg=Wn=czAYly2>&<B&-^$e
zA@$kukbpGx41vallo891OCeZJ=7*X8#CM3~_*YUo%%9U+w?5-*NRZ2alxAT3Jmp8d
z$>l#sGqC=_Q+~`VSN?M{<%eZ{xAMOSFu7-cY_BSlAN7a2r(_-RZV&)vkggphA`k+N
z#2cA=Py8#X-SPZUPAPwz2mT{k$p3X(|I)RKku?8shveb~D-VmG!!nud*o`g`F~r}0
zFa#b5*HUl=g=r*sEPr!zw=O_XN)t)xsQx5m-EgDC{BCnMJ<ZSB52M5CgWZQheykHc
z1JHOT^&ivdJ=zb}AIs0$UoqsD6P3L)zK#|SBg`w!-(Mrn#Mm!?D_)Dgk>TM41-?T{
zQCdECQ{MrMY0#5coV(RCAdRK>NlO;{Dy)7&d1M`8z}%>FG92fI%MA+Wl!*dtH3SLM
zSa6>k5`wdZ4F+V@f96C%2L~gXb_g3kT6OULy7nP(Mn<jBc-lFS>n?b~fn;3*@rby{
z^sjJM2y;wd5J{k4W-qI>!Z&rZ^6z)fLI=VuG(V8c)S8jjRb)Ia$uM?I5*&U4XQq)f
zqphYqnq0x@UioTrt`|-CN}xqHl*gECCkd4N&<w`%uErYDt-vRh;m{dd4SX4zeZLlt
z=OWsMqc+nl*pHeEQgSUR(=*ct449W<u?|qr$%pP+ot14><CGF-jc%xF#B@w5-I50k
zz<xW8V6}`M!8h|%|4&RpJ<UPU-?RRYjg=9`d=-OXTaJf+4B_|#-%%JtzBnQ7F`0%i
z2yfvJ&OsN8b5O)xh%g9w_#=KBB-T%Dz^__pN?I)!zY${QK5{|66oSa|L2j;!n4agP
z*ekk*N#Jbwxh+03#xM{Z9m3f?U0x(<-Y#!A5Rf92;tvyV$-7E;8BF1iQuuu|#>kt@
zhByGdl$-O8hctf9%j%;L<i~oF2667mu$=QBFAw;uz%lc4RZ_P=G};6H0T1vj7<hH!
z&W0y;0CakJz{mHU<mAWaw4Jy!<B81xooC@+4j+B296SZ#GM&zL4|Lw~K&J=LkfRUi
zBtSKjwG}pZ=Ha+z%iuWw#en!okHJ|ViK1c}gZGAO3<$$MmBE7%2m$f2mKj`wKnPO&
z6cJ3|*grG;$0;1?VC!J;l@u<e^E`*|%i+J`0sjpSj=qP{S8;IM=fU8(X95HA#rIwq
zJP3gh5RSTH@Gt~IKse@Q@P`oy0pYj~%;0edgn)3KFKf35=lSw$Cb%BL=&0cu1L}>{
zHQuv!gK+$3L7*21!?_6yY4if&{Jd%j2X9NSNz}r%3vIM}AE?zp7ir0uZ%)a~Z21z#
zO(|t(r30m#tv+aVWIX`p>SpMiVLxkHiZ!LVJQ0pOu<bKH)f%TodC7W74lFJpF)W^W
zdM>=bkeZTbRfMEw&zX~+WmUMOlTI4@Xjd?Scvx>SPs*A%$9<W_g>0T>MplaZnu%C7
zj#UztB`@8YhkJQ5EU6ALVAb0JyP5WGWi{nybhJ{9hDJDT!JJ~nB^%UgdZ7hgV#3!w
zWbB6|M3BK2F1xho6#+Rq;i&(F(a1%cpJkbwpN^(6+lZ?pBK3q8)4y3c2nV@x{4Jd2
zN``7q6PJY2$k?!%Qi33CX^LMs8ZjmUUQwd!XJjP~-ZqP9!9tSzT2dHWRQk_tsU~iz
zJvcDluQ8WZi=707G3Z#i!23)DUxj~!@jejYdi;?I5^`h>_-6T?BO#HPv@gfGKho5T
z$&TM-DiG_RvG2rk(qcLGRU?`l|0GJOIsTYej(?5}f21Yl|0L*Nj{h{upY==h)@>|f
zgZy&*mr?$OG$WQD#|cvY_+F|U|1~rp8wb)`H~y)RUyeU}T*SsB$RGPdDgWO+ls^fD
zf{-Uhj$dj0*Lx^G+gDskb0U8n!%6wagYd{oy0%nJ`LBUAK2R{pgK+$gg526tD##@l
zSbmlkfcfD@!vHj9`I}o?T2AvzvMZEwjT(@o{9hCEyR9wx(){Zrgqi*rcs1mgtN$d5
z$lIUX+7hnq%BgBS<-dj|qTF)z*FQ8=&4=dJmb76}x4bWa$$(|n;}86{2Tj(K>;L{o
z*f@U2Aboy~aOv6sLA=S2+}ynv;LFW%vCgFJ6-j%V6C*wbv?r|o=Em%fQ5hLironrQ
zx!Le0{p}BM;zOGo;L40j;+<n$$6(fNj0%Ic^pK$=#`Pml0j1C7q_1(J68?s;9cak8
zfl8|A?<72!{u#I&E)Yh$5(cJiz;Wxiz<T2Y&bw}wzq!5@=Xr9z1^4n|V0}A2L&tJ5
z-^Aem0GOO_P5`)Eke2@`Kth<*H?#cB`R2E2ekrfxQUJY|^4~1xck|746kjSAD?cN@
z5iaEPw^l}fn3v^e`r8LE>V6qX5@Vl*f%$g4MLcQ#wDjruGn`wt)Xn;4I3i5+<}F|M
z*AGNV#GogUUJ(nmmZbWWm{)0~wXIM=E+@je{$NC@!yi~vKc$*bsp?45Tq7Q@p$f78
zc6wuA^<5}0@)gSLRuvIQD1X#<GU-w#SHrj)(?z)jTN}U(U`YNXi%{Oi4u=ds>hH`#
z<YYf8>@2xJiaJ!S>NwP2)v-;r!Z3ae93XksR34RBcFC$2%Hw>Ex^4L#8~SCCb1~tN
zI|NvJ7|S0<hGz*wxS?Xi`8ND$Di4F>R|&vWo)>_G1_2>85(;P-j7M=f&TVG&`Y?JV
z8%Iyw@T2(P;E`%1288J??PZC)cz`fpImYr40mkwIH6DLD2Tsous_N9X?}dsk-}*w?
z1??7Lv!!2jgYW4hFAJ&<4hh=5u>Gz-!toCF=~dOi-Cnq>5yYcVwRY`(q45%&ki8F{
zhFE)Q?V>&eU4T_3l<T3wD&bt!Hd;HLty&|L4~6=uw6+$?lYJYM+8=o7P#|)a-y_uu
zQ~A&Us726ClQka>{Unl}7b-e@ElLUpcXE>M5VW;$<|W8h1+wkHCq_ilTDaR{3a$~V
z?B3e#C~2dy+-EOJaJP0luWv!8v37FE3k0gQ+wqr~1bGgG$ATMepa^%p`hi;E4B7Ll
z(vHx)O|~W!7!N1>E4oF^n#u$BC6*mmm2Lo0oc58ZTNvnTRV9|g+1Zesf0ms8h*n_x
znV1TkkZ3HA4^$iB$yZQ*b|Rdw9Y9W-hr>ZHD^0p{hE3>)Osa%>I86KumQ&0Jy2*e?
zT*i{?%G|q#Rdm6p*|4Sa7@T8khf}W!5;NmO+rmIFy*i=f=nZ3q&(h%)9nKnUrobSf
zLh!{4wP1tvRDW8{juTsnkrGl!9fI?mVfv`exXDq!o0{O$_Ba^>>j@I<l_qH2Xd9+r
zyU}*dSar?Yq&up59NjNev{JCw5Xwf|S6})fj6RctT340c4~2%(fhPbG!=WMUQI#$w
zNH-d~aP1EcBZlhSZOt;3w@w6=oW<73r5nrr6Uzm%cNHpHs5<5?^n!DgxA;P1F{(cJ
z*4cE(oulc%-B#^>W8)uShlh+dy>Ft;=TM@pHnD7b{yPmes@+EehFAEU5^Qm5lW6+G
zDmwfLQYwUA^>A7&FsTAUUpuXy+&Qe?$;9?eVtL;~o3V!?q=(ypEEK1=$)+*cX8H;>
zdNSe^>~TTtIpkCWJc*nt?y^OmBslD!8h`mvwJ>mKP=01&`C`$oE{k^6bQ8N83soX#
zSEo$$NNO-KB4(m3gEOmAFst8;wh`2-MxaqSEQ!j=*$+M&Hey4#DmZM&_@%>!xIPV>
zuRpP;hp;m-1%vH6&FKdyceCa+h?vt>p?n}%6BrCw({jvbyV20q#a@^_&Gl$cNxooE
zuu~eHEHNlkuM5<mz>9GPMeZC11$WG#;=cvc*83;g;DVae+J?ueNj)^I!si55rOB%f
z49l0gC@`$+1lkME-zJ6y1UbVZcMijHGDE}4{8q6U$5ey^T9p=>8dRmpcG?b)=gZp<
zv-$i2mc?4XtAV+?0JJagt&N^LELG`Al>YDYtU~$S&}aRiDt!{^>IPcx=h`>+Mdg#B
z_xiz_3u*b#pF{oH1m6bOXb=Zi(BFae80}z{Q1T%{c_BEIBycE)tbGJsPwTySsJPQ#
z3%1MRDdXMp|A31osM#jL2Kd2OaKJUsS5%_yh!~4TIvHD{*q;kfZsPVt7QiRU+5;)7
zdM*L+!Qv==tq1yqjH5fF;~7u=SnzID>6?V=Um7C7QRyzDgK?ZbbjiNf_R!(ta3KGD
z!vLXNpbFe!?T6aI=ELEmuF6A&njxaUs>p4^jUu)S`6p=K;xhbcwtRni_#-XbJra4b
ze0Mp@#}9MhTyZwa!I~4pUmM~G<uKNQ!7-jN4<j8M=fF^DAFsc1FX)r~1znDB{zWhY
zDv)SgAOdZFxXFc=6&kTno(F`%AhrS;?T+H%2<zJ#*f6b`$_K%y#%{GH>gM@c@6A{V
z?K-i%2!=9t>okPr|86WF3EoifZ}2tZpb;9J5gGtogY7q29~4R|!9<+nWgEcDp+7TF
z`w+lBpoP`upP&v<>{$f+aORG<)+LtTAdc_8fxSLPo1Iq!$O4?_0cRNCodKWk948ys
zvz|p>H!U1S|KQS40<}L7b8?o?1mja|E_6H%W9e#>?I?B?Fhmpmdao_c?&79H_XO=3
z7j7K^VA83rogMVS?d9KB?*j!jmCuA0`a}L*+~^N@6TgY`a&&?wU7f1*5Z-_%gc*&~
z6Lv#S*o8Pg=AUlv|7zk$^(B^_QI(bvdz<ZVEKh(@Yyuf;z{@taDpRmy4EqI$h-27a
zU<^yN;OL9YWDI*v9K*f|Sf0nQi(ssAlpDgHGTIX9SR)a~8q^XTLk`!T3rU0hG&kQ;
zl`a9azh%yqpuOZ$fBjTF6*%AG>;pVcA=H~4cj~o)DS<u7-(cI;;0;-MyN-v^rMoWz
zIsg016L5>=!SRJ)JJ3wqUI9gyZ^ySfF^1#mT`FmyYyTi=&)r#lb%gqYS(ae?-kzj3
z*lMuKTwGDSt%*1;XIGBZCHn9GW919_yUS;tZ(Pr2jm8Z(^~*3t+Uqh$+v{B3fV4{a
z<&8dCI~{Lf{W;eQ8ro?q>z{yXAUitAm<jsFpRi&~y>?Ky+#JgUZKaFFbO!(|rj#NT
z(!THE{IeYg7ek@HthC-~gn2_lN29G08hn1ewi1B(4X}Knt5vOXS;Mm(c9;$~pQCNU
z_=Q7t&Iva+S#mTBeia7Fw991{x(m8oy7mHTUm44zpx1`+LnAjZ@i~~W68q{319Tm8
zVLU>;qEltuO!^y_TKdMNmcBxL!APgeL7=A;Dw1G)lZ^DrN5NP!2l|S+@Sg<NqhN55
z1HODN{Nq4!R1n+;!9DyZ!8PJTn(l(ND_y@TA0XIZ0D?1m-G%&f&f)1kYiIPg<uKV9
z0_iYk((QwEHe#P*AoFL(z>3tKqkZCl+a#j0xh}V610a_{3C;VLqW|*8ZJwUB;fe)&
z);1g!AlZK#O_d@|!#rbY8hKS8@|7sZ`}rpL`Qs^gm~N%%T8v4$#gUG~k5x3Ct>q(Z
zErqfDd>Xj_g2Fz)*!5h$RqWV2c(-*pyAA}jb2JY=tB~aRjNu_a_RL@z#UBK5UmWZ}
zn251sUojj}hx>|KFK<;rb{2a-3@87=eq-^_I@nsA;0MAAkR_Ame;#8fH^BfrdIp~K
z%({hMa_7PU7Rs`o(jw1vJj$Y6<|+yZ3VBhMCYqlN;F_1^Wm#Dg{PaOUE1p(VPoycz
z0%{k}V)X6^ClC^tFL}1g9u5r!R18=r>{~KFBLHv>SP|+H?<bYY{j5$9?_J7=j3!<2
zUS@b$ci&LFETjhkVRaOS`;{@E+}9|KEWk+QR-Sc;P2L9$@+R37k(fusC3P&R`yNVH
zg_F8R*>T?rhARAVm3;$~9r0GS01stn`wjL}dSFWqohxgdvLo(sO0y-n{ys=hp&;*C
zNp#{J=d4R?|AQ!Qy0hNpbTU%X9*FMQyL4n9i-b>_Q+y(erysdz`-poh`|?Hnwz4cd
z@0({<<eE)xKfOqwc`Ye^M^^y7^L9A_z=`5bzLe*@XIGxj2}CdM9=yp;WjQ!{XZLXH
z=Lhz7Cjt;}@})5MByYzX`L1c+<P=L+7~Xl4FJ8&PA94p0{C*zb{XM`*&*YZoO-{*l
z1A{!|^((goZ$*?F3<2KcbWQgpZ*nq;EBs|>WBgtf(%%Bges~^(eoY#_^Z-vKbXqyk
z8J)cZ4w+~meKuVG>48owAi=+P!8G+TG@*`49V4UA)2q?28H0bng1THq7NO&8N34Ym
zAaLi)ainhtTBE?nbW$=bc-M{64*~h*^iT~xPY&Jy0(4S3+ubrsXDxwuqIa~9hr7P;
z-$}_vNeTt&y8(8^gMQEz%JKE}0DlSeBZuz=8RXzIK+pWSi=_Vt+I0l(Z11FB2RNR)
z*hz_RCWwLb(Qx^x2l?+Mbew)*D9twy;!fN-ilnawSQUY*;a3cA(zrX(XKw~pu)g>T
z)JrGsTuNpEKM^_abKsLc8SbVKIuAJDr2mDxVnQd_0Y^D7L=w2u4>0&dC~qgF(+`lo
z5b*CHaHk(&a2x2qlag6C?GFL}X95pHRwR(V53cSY@;m(i>DK`M4A7UW$JNBnA&~~w
z?(n<8a_#G0(vFz66bjZ7&Jld~_5#g<1W+G2{gv%aWBCw%5BxJYvm7Zt;$T2}z2KkW
zGYvC3%wkx%8JtPXJOhI>I(ndqLCQBl1QWi!;hN$9|FvBB?iL0tUm*Om^0InC_<bCl
zSq|#$0r+Qn#(l#Wr1-49r0@YEx*I<0AEfw?arl97&E&+z7YtJTcSNuooLMZ&-xK~B
zolYEnUk=XbNb%Qk_}ID`ojWO9iqAYD%E{AzkE5gE=$zo-=nWWscHS4#L7QiAb}pP$
z53%4MFi7QL`^FKUmwz0^M>u*LMt>w+V?cN~{4=;2fe;XmUWmbcIXb-kq;hb+T+eWD
zp6_5J4gu-&_|pkgg!6is#ld;LFL7|5KGp>WseYITM!tM~JwmYE^}zZWsUCW8<>KX8
z#KHM;t)XzKJRfoRe0{O`IP&Go#oD!$PG?SjzFh3P-be?1CaXu@-gx<Ow-W{_eZIWB
zoUtN0sYjmv9TYC5<EcIF_JIFAN1x|=tMs4tK>v9U^r71)K`K9vyD*?Wd3kQNUVbE0
zL^{0wk9&ZhrEsY{mpOc1o?G=-{5hGtzj}<bPriP)b8z0yf9K$Q`@O`$`SSL}0zr_L
zs~?3+^&HB<`F3%u_VAv_){XDKDO}3;KTW@*2YGN0I0lr5Z`YLwgdo-1RuSxGpZ{(2
zaibLmsr&}cPI!A}BXcQ!h)BjwKVv-5Pw_zCQ~UL#|6UwlzP<4B@bddpd}Mz=y~c=*
z#}FRG!PWE{;Q|L|I8r#ufI$k67Qt?CHHD)-F%Jua=mo;@pM_+4fiUJ95md;*(MDN#
zfnFefD+Yx4T@DUY5J#w_SBTHXq6qqfgEQZYpu4Hih!0atN6>Kab`B_fr<H@Z=iqE!
zi*!10@M|1CYx|fiAR+{en9bn5m4mZ65yF>oaApGtU&p~&+eG+b4$k^Yg#X6DSznKE
zRvDP=TvY&HK`RO2tS><HOb*U$8{w-s_+1E~fj_S`fB_+{<M6w2@GjH{kS`k>W3rxu
z_u%jsa&R{1Bgyn!Q1hfQRyYESewuGOyy^`f0mx2m@rMkxTC+LRGCegX$DB4D30bo8
z(sQkF_$C}xX@w8`CEX?|JR&NqASKfR-vvk~UnX#)G<=LTRBJXFW8;#N%!XK_d4wS`
zVN8-CF2PNz3=4b}Ak~}#zxYb|ZA%3oF=PdFr_oY*;AL<s5Bb)j#hp^i3I<<L043+8
zoBuk6R3ZcW*kKC`0_O~h<+$Af;A`>BP~gK2IrD)~((v0f7%)UuHCP%#=N1cu@{kfS
zp%UDsX`yb&8~^F4x#{@v3H&D2UmyjoDh&?M#Y1$nQqvv8ZuVUV@p}o8`B}u;r5bHv
z8JyXhXB95X$g>@XoAC?J__dBaD|in4j7Q7fs|2INjJKG@V$RA=ODFGNwwzDuEoXA^
zJ0dq`f}T~ud(gP%-VlZ2)3V@ep*O1+z@!Ce4%1cYTf%mJfaRv2nsv&eaeT1F<IAi!
zE0i|WY|erY+rk;h@LjfqIf{_!d3nJ4Cg({*mZ7GRu?CabJi@FEgAa)$6eMUNr;EL{
zut{LE&dZ;kmzrzIaWrfA;>+#O0{5Mgmd2WMCVX2awJ^n;lb@SzF0kZU^JTsy1D*C9
zIG&fH&d5*6O)~@Qbm#<JU@56{^DVjQ()WNfa?{flb4UlTNEM^z^~W{1gwV9<Oyfhx
z-$dtbdEnJ)P#2shJAV#|Z%1FDQ1_YXd3i8aNy!4wF()S_muU}9*OpX5%i3Fb-n^6?
z=q=!rye-Y|uw}Ra_YT!TzJCLEV#93lCu$soz^1?u<f-6Sk<hx}xJxkevEx0To9-aj
zVgX#*J)GXj`cKk*4#BVeIB9}{@Gs1qzzr_{!etgrHs}!7l?pC)Kp4nRF5sR{7f2fZ
zEQHAo!uUB3!u9wg6Zp9kCO;2=o8@Qg>5LRVw?Np_kRNI4@rDa4dy6-RDa-&dmXpn`
z*cgAR2mUK*zUKHRd*DB_k4S*$kMlz*{~aFqAEo@+^DTPo_DpQ62mbm%F$bG3WBGBu
zDdlhXz@Jq#H3P=pjsF!7{BtOOf#yX1IDeJ$H+ixjGzthfzv6?m{_)$kh$^)|_I!Y!
zqaqz?{%{ZZr&0bN@XTfM_lNwTg8z@bw*il<xbDVxCD|5Wd}S~o5<V7KKmub+V2lI?
z?_$Zm8?QjY4spVVBy0)07+bM+u?Y~%tkihBDDl&h|3lNft=o{d^lj46LR~}nko+Y>
z60k`L6w+Ww0#=p}2NGjG_5c0O%<RtIy=x0d(zkuyv9<T!b7$t9IdkUBnU6cCNd7kK
z@~_e9S$>YMz2%<|Jbv_7>4KZ}dYw%X{d1An4}ab1Dn+|aNc`l57yqw-#}EH5jeosP
zZ!TW`nKPTc{BPGvMfUue#JGCX|1aS2qkn^@-)=vgC-BmL24H^l4>D5(v+qDX72`hz
zFZ}Q?WyT10{c+yGi@yUx?T5czGsNsOkj(JoE&tU>?}vYn#^0_JMsejlh8O=!CGeZc
zB{T1%vnj&=pC#}|xHyVn^S>I;Ui>+KeG)tWGpHk)eG}%5xBMHxJiqc+*QgX5bV8P&
z^DJKc)g{Wm2XKaY>XQ5Q;y=1X`R~#AS!M>}=e&&<|Cazm5sLIro$fcyeh);E;Kjcj
zP`~mIYW(dgnc!z%;Kly~!2Ix6>B+zE==A2|#lHzJ{P2frRf=|<kmV2I&x?Ob3H>ps
z@vqS7&BcrVx6l)Q^c#Px_FN_N@TPwQ>HX;M)%4eC#H62HvX}m6fZPv%L?br)X>>M4
z_@6>zKm7M<{2MI%RB2xPSC-&kL{G+=eLJP_f3}4FjGU!X?6dH*Nqh0%QiA`zy5k%&
zi1pRW|C>tizwT_6pk1en;!2iy@z<5W->MNE3jf(9@Ne+JPmmY?0vJW8!lL#Y(v#Is
z;hi14<-ZK+{px?84}Pwbc=1mtf!}OpJrw@368KxEDyrKx@#Oz>{CV-G0PrjS9z7{9
z`<Znfym-rxQ}unzf3FXI+LB)U&z8VnrziQ%J~2ar7ynO6;IAUH5!&Tf>2I#1dht&{
z;r+_LQ7<N(tJ9l{7eDtM_|<>64}R`1@#3!pfG~)0L3mc<uPcD&(;M)Ghe&VmnfTu4
zzduZszZCw6NvN;h^nZu+e&ye#%fCUVi{i?4b(7xot2<#Q5$45Ttru--bb50kE<0q9
z-tX)$lirTYd)BobZfAM`ynHt4z4n_)Z?6Aaw_iI?-v67u=w!V#=?o~V(woma3^=e^
zr{Cx)u;HJH_;QK%->w&EH==)Fh~jTH{!Dtq|C<2NQ5Y>37U{*S2IS8`x<mN$rte&{
zxU-v1AN2WOhdTS~{22`m>Kw<hpZ!&LBoONmk!u8dDslGLUOwP-oWB|T!dBdk$h-WH
zo0(kzax>$3##VY*L)Ev>IG*bg7pG_(i%)DNLmY}C*BGPYgZ13uPK9T6skk_igvWSE
z;Cl^avK-t{RB+B$WdUiq^o4PBZZD|Azcjt^%<4+*l@dpBCC8~qsjWD;=;eZs^3;)C
z20P9+14AUT{N&*!@BW*9gU7DJtg(vd;5)7P_=b+UdxkFTIDI9|)%TSa>}q{)*1p4d
z?$$8T6$RfSEj6Da$v%g>bUaxvmhbdF5A13W#Qpl6m>2Tya(PEOcIkI!-J5Onml_u0
zRpNh9;!F9oGMUMD1@x$XI;7uA8IYFIN`?QrZ-T7GZ4p<V+o^2<aa%5477Af}Di0X0
z6}~Gk*cFg}S1w)z^3S}x5`XqLBZjhxP>_Di;}F62H)&*Qr@*!1#J!QLU8oPge9l1U
zXYXA%GWWd_@kc?A{cT7ca4;N=_(zo)s+GS5!ukE*<g)zkg%E)VUoKHD+C26*Bia-W
zyee?>1boZ{AtQLrlj<i3@5P^)$KtaIe~z1@%JRE4M1BG5#-AU5>ZQE--5Q2JUo1iY
zbfKr1|Cg5F^O6#La|K>pUZ9o0u9@66drc8tf)~zb23}b{6W>g&6Has6zzrw8aI>Gp
zn~y0e=^|GtmkfFcCwOU2nEZ{LG9Mcb_DDEbJ~sWO@Y?j-@r_O<Ue4thdQ5$K%Vlg7
z!kN~@*F#$=7i-7Bjjhi3_BR@Kc{zt-;@kYU^EWcc`ZP4)Hg`{WzBT3LoqRJg!1xXP
zK_HxeCdBm(VTR`fwetsoaF)S@guWr%l!c&gS#X%Kxv<%Sn>r%s-z~V&Nd)b+;D_mZ
zUU-fU1MwPO@tJ;n83;c@?(|Q=@+<Z;H6~Xq?nqw0Gy%UA+Dz>6Y%t)ir^U%t*im6c
zDvr}ooD)~w7bF_7zv;$hE3h|-&r6p3ZBDA6xdLZKchY-?rlNkvs!rtuRlV`q_E3Lb
zE_PdYVwLZfh2o6I7%jiOz>6lg>hF{HLEfqL|AN(AaJH!2P5EViwaUG0h29#I=M5H9
zyB4oZ!c~ikvc&A3@rzP=^MEX(7uQ-(;qor4-&948-vAaeUsGZta?e4>s+;rl==VmB
zir*{2^seFhaVRkDqaER0Ao5rg_E6rjp!tgV3yRmYJ<%W!5>2*Tc;D5lcXmVjc=x|V
zgSGXI$z_*r^w)Y`+PaK!{~iFsY+XZmgg-vP)?s|ziob)U&s#1kGoy#qQy?%OH_S6)
z0Q$OF6J&IC2yhm~=r{vsG(Y^Li^0~deD>mJT0i`|eDE_bFa9ln`QdK|oWaCbPsR8j
z#tT3EdwuXz@0<Kg`9oleAO3EQ(DcKl@P8WV{qUQ$rW_t*K#}s|e+TmChrd@NtkYL>
z@$#QO=lt+j>rT$34<Q5gOJ4l^*3=LGy&9q2rxWDG&u_x~@Vh?vDa&5`QvvhCzl+Ea
z@|LE0_ToPiU_bn8G=7`^ervriBfTH~eF|O9p4X2><$tjRe&d6sPA3fE%CdON-w)(|
z_^Sv+2+42$$6Nkh#Pcivpf10wlQJLLpkDlU0Op6kPUAP@5JZ#U#s5`6{qS=Rm!VyL
zRXJ#fd-0!LLjJoo{zJ9DGfK$+QjN&wKSxVm{C}hIQ#aayd}Rp9Z~n)mH;`|Zz<-wy
zezql(-pD1tHSn9O-Kg;!Jm%^Jzs2-;Y07Ehne>O6tKF{4Z_=6TY{3137yolAebHQP
zM5i}$Wb!iQH_uNao}c{e)Dg`$ry(TpTkGYw5gL`rQm);)LS20&-5diN{D%M2&p%&H
zz3SgX&DEYavu>vH)I9dN+V(HyNsGvB1ZNm{IjQQA&{BW-T-06uoNRbvZb<()mj0<a
zD?9Hh8P1gJ#Qnj9+$1WTC%fr|JU~8yBi)B_qC9hR`=3fwMU_9}y#&P4b1R1{!n~Dd
z@yq<^2J?v1za?KBVyZkf#L^YvmVxErP{i5vw3~i0o_-^L68PD1p2?kFT*)(GPjiO{
zaR~hAzL+yKPtHJ{9OFTWqd3^o9Hd5n3YAV(ML6nAhJS%_H`NeGHUlI4BUCz*%lY2U
zXRgU-JZ5_(A2rdNniUQtj&uiZWuae|g5;Tl)AZ|-4i3$1$Q=h-a8x=^nFM3=3CK;H
z)JI&2QvsfMI(g?_6bF<0sR^B`@y=u%PRbmw-74qro)0jX$ysQ{$IQ_r2gj7Enf3h@
z;b7u$Hv<ag{aen;IaOWG8;^B44YfPFoSSfN;2T3-PWR5&yPW669PD!5#fz`(OdTjo
z9G*H5Odc*NJwKQl75W!}jDjMxTB1-#DQJ+IYzjwQaP=rm`Fq6xt_N5OML(E;L-sCm
z2OvHI=^J$V{{pXBO+5G+t^%r@sz{|%TM;%gG8~Zx_fc!_Rv=ECB`ks;5agR3=MKcf
zIR02>%E-t%A*6m#Nbxc=UvAWOYw`%SaIuJ$Bk@_Pd?;*B;DeWQb&?2&(Z(~U4NE$2
zi;1USkvNbLr*8;R&`z@R%{i0lSG2!!H@!uoAy)ry5DWQ5ho#3Zl_Bz>)O{)HY-$Q0
z6-#Y9`oo>Gj#xd_bsiaX2ShBKO;gbr<+h3U^nt*TJ6E~>H69LZD1`Jleap}eU5Zdu
zw0Bl`n$x!m0Qvqrnz|&ASe!jNnwj4JT4JJ*8%<B6T2Lj_D?+IQqh`5fSafauptof_
zff9OJ*=Fi&qDcM=i}k(uz%8Np0Gc+u(m-semc-JC2lu#XxD<HVaLlwF;~swhoKO&l
zu4ishb>qTKMola|uL{kmDO~+l)LA>B3z<RsR8v|zC*lszX$AIxyP3ZTy*NXEk-K?x
zG!Wn)p4yw%->@{Y{)S~<fx0(1auPTs9MI>qu6wl|g`w1=O{1m6=`#bacg}Tcp)R_d
zwefJosa+Uub!x8;w>z~<!re~ocf-9v?9|>LrbcyY9|~{8H7~B|zVIT+6~*rhvlDd(
z`og^e>I?IOZFe(UR2}{pBSeVSOlK)Al+WxUm6_AOoaxtXBfaYIQ1lp(@g05PoyceW
za9{W_T$il~K_KDtUKP_Fct~DDo98M)oEzK`-iO#u70B-k@8K<73I%d*C<a9JF*#p8
z2&7tr=+sr9S*K=~=SiK>#YW*;`L;$ClDHx)EV5lB*E{6-5oQrjzbQ2%Qq&i|7Z_a>
zY7kcjck!-u@1lYOtB+%Hc|CByWFyJ4bK(PEhHlZX(mxgGewC3Z>4zjQxD7y@e`byY
zcL?jnQG&+3=}yUc|CS&RmAzk5xS2b{l(y^<?(Sc^z^M{H6eiU<lJmSXIFp^YW1L`e
z74G&Ri(qms?soDH9b4w1@Uys;EIwk-v53unk)&icgC-k;G4VBmSxFMdpiitLm^E*}
zJ8>U$`n%CCM%I|dAur_zZ*}1D)v3YIR`V?9)-GJ&u6y+!fOwuWT}I^P7FE9yFGMgV
z?3h=Ds^Js@1YT?yG&rvf^H}2OSo%l9pjnd_L)2n3#@X}}cYs|7&6E#?N--4X5}Gp<
z1azL8Ld1a6_m_qdZUz9A#!`J~>O?xS3eilGF5ExbYDke{&|DG??WS?(Ry&g;{HwuV
z0~(IYJYwldaKwU@>$zh$mohWyvnZCqDYoe$SI$(Y>i~ELT7NBi$cc~PZvb^O>N?Fh
zd;hYUSUFs;G(Mh$#ii_$T>8d+iSu(Y9{l<*8otK=JPP>jm*7DP9dN}rNG7g0S$W94
zVW`_JulOk(Kn=2s22<fxBOZ2f-hZ`I)dcHeGHd~=2HaDzOCcGh9Z~9>nmARX8=|^w
z<@<K#?$k6vPuAQK?v;l-wVsSb5Eao|+Zj_>9vhuovmZ&d71b_P13-fYxB|#a6|~_-
z<O#!X-L`vhL)#CoIeZL)ygktBrhk}zTDvq+9rgb4!Q^qVfw^G1@@;^=X61ypoV9^$
zTTAA8IDlDM6-&K;?CMFefv+4kX8@+``ni?a^V7@26@c$^Qf~rzJpC&-^<&2!xGgAT
zVj~9Xz1mG}FN>vDz@boARfY*hx5d-1$I~xKBp8H)UFg~7hGN5Wg$G^H;kipuCAmHf
znY2rX$7m5mqZnE}9^NmC?w=4$jHjoDY<X-H&R&$hkEO@6OFmw0n?S!^nYWHdn2XTR
zlu>P<DSaOL%gV_9?PZB$qNxv$OghR8(8Ym!m4X~>HgoTWva)D+7L7j4o)g-YsWmkL
zsMGWdJWpMnaxb(%t}L7KC~IUPBZ7p+el7fG<wpi~1}u;XMjxeK{p2<?{KG*&L(E!p
zf`&<EZVh>ROY9-juHw)*A#ES3CWv+!9CAnLu`KrXFMV6wJ7{sUeri+~?QbqWK~aSQ
z$!qfsT976G!5toA%U7@G7I4hz%Yr~J*PQ;R0kt_MMHqQhpm35i`WV%RcuC6>nW^|G
zTxa3r?kP{XwY%LL9_w~93oD_b7jihzRGA+S;2y2FlJ*M>jof&yxb}_|^Xnw)imL1h
zMFjC}@}*BQAeabIz-XX^0ziM|Y>L$7`YSwVA~mBqM{?}XGA>UahsKMTYV%W>KD-I;
zEa(f#i$k=B-dm~yiBG9EAQjR#nEVt6!sEq|c6Q7`4=F7~OI&V~7Bff4>oeWu77cNf
zYAoz#;cHH7?@)<m3SSjbaN$ef!e?Q{&w?kVC*2$y=;cZE9P!LlEg}_9#cGG0P0Q-+
z8HSb{M!RK}VGhPP7cYZK2_~mJz(sNA+e1BPD;cD3=m$8FN!Tg#2WCu%H?ENG&6Rr0
zE_r~{7L3q*`9OGjEVXT^WV!Ui!CAr8M@vRPjGO`w^Cvq=lTrVg=3G;_vf0@b4)?#7
z3}@&0V!;q=Nw_XE6>$=$H}}D*Upd;KT^=cmL~#0F0h(y<`(;l5-yv2m!%VresTKXR
zvPBefZEvhc3ODm<@z_JxW`*6lw@Zgds~WeQKJd_`LkLt>^!CHFjr-h3jlyyI=7EA-
ze0J-v_$nFIt&i~VuS0jQs+i(dDD}aS$y(@aHl1);;v`6@)AwDL-!rW+!t=N0XPPdq
zBc~#Bpd>C9D}Xarb6_r99GX9jw}^FcH8BbF)ddqLQ%^*)Cl>1ozD~YKMNx0f9Dq+R
zn|TAtKxSbg!n%S%>>c5aAR&31WiV*JdIvLkEDHzLiBlU1u^D|tBL}YhFyy3ZEo6}u
z`H=JbpoVd@NUB^h0p~#DVkW9QyD$z*GM?#zDKdKO>WS{aEkT$fv)7krrvd^ag!_(K
z(jUZNgv2Z(1bsS^Y%hza&yJ^WsTA`7Q&{f`6{d%QoN?Ola5I&aReMAUI}-06;of>l
zfJuvEIUYJZmbns!(M?s^@v+ez910bvtDK#ojf7TDnJxW=X}MS$&Ygajx9cE7b<QRT
z0o-SO9@g^<vE6UD=_lOO%OAR<Pwd|sj62Qm$`)eSz&l#fFSgW<z^sP?fXlYv{-K~t
ziw#zm)3m>(@%7awM$<c^yZ1&@d)DG*%xT&c555_1{I!$f_j?!$$7|n>H$Lv9{sF~=
zS3}25Kkn9Ui470FK|6bRhg@oRxQ#z`ZeIvAoEU(!IgT(Me3?D+=;&Ivao6fo-Qb|x
z2xq7BhS<tek2&rrE(eZ_Zsv+b+?g{JPgjKF#`R@-J7-ZRxtw6#Z|Vf)OJIi8%rVL^
zW+kKnb1A8v=oTi#(Ksrz6If2C>2)~xgkF3nv}$r}VB++6Ej&@a6LL~_6JL6yDg81$
z!lF2DKNSzY1P)F}90NZYP<g?o^#OQUB!Qz(Bwu$^?@n-T=NhbYawOnvn!LWs+4R}q
z`qm&WW$RnZa4BEk3SIEoiuJ7(xQtuhIu4id>s!a;GGToyhlH@whAQKYFD4((CO{R$
zvKB0c-!42HyZSar>|yIMhvN=h9X?*PMjW)IUfSaZcfsf3SuxcMRME$ZJ>Nx*GA@AM
z__(S|p-;x|!|%lLF^oauja!m?VvW0<{wh?%4xY*TB+TLD5zT?oruDN&ZWl(Zt<2uq
zl71qVdIF8(E5UgBha!=&^ncK876h&au6@x)&_%LxLn6*F(;r77iFxUciu1r0%(hef
zC%SOlijHz&IK(N0MEH0#0b_PUhgItlOO2$(i@b2lRP_mT94K?k+A)cqt(NHW1FEf%
z>&GXEt?couED1od+DFY~vX?ux7E`Vv^)hpdy0Pc@=7bn^|C~rLS-F2sO)xq6s;!uQ
zQ*D(1x=X&LA)hOwtDvYbPv{T|{Wztc5v+RLp=U^8V4+c74t*BDQosbUL~>J1FfG(P
zmdaDx?`BM48bj*9zMd=TCpLB9*wsfU_2-Um&7Rf*522|ap=xgpo6#4w-Zs?eY1DdB
z$sBQ*MuzIVh%=coA}Ss;=Jivn@~nymGo2oFp+#WKz}0PK%xNA*cihwN)^2UdoDomI
z=%!wTetL`%jB*-kO24>!B=zFj=>BccT21djEyQczaU1`mXLdaJo(u8AxO;euQZQT4
z=R3FW0Sg#CaW2O0RoOb`mppNx;?vRf)U|N<Gjb22#4;<YkcG%MXA4HYPT;_0&=3>D
zvEgl!<pX)`v{P%Rt<X-8_yX<pkk(F^L(!AoN;5$bLIh?&VX5wdq;QIMR#@s6<61EJ
zN5Pi#85lkXNi-Dl_GIP2L=ZbETM<iNTj>U$MWZyV_Vr?G+q0;0z4Qf^pUEyj6a*Oi
zIP*7*-2zw1J)rAN=xHeE*U|J{t)MxJ2HlvL4a=x1dogdv$1{tovK8@x#c27MgN83u
zHO05TJeZsWIhwh?ye0VCkv~P!c)F(&_u1Rrf%%%3+x>Y72jMYi-VP5hAJ)7a!LpfZ
zd+F_%3$Tz%<=R|)75LmVT<WEM4EoSb_f$rAV8Jf;aYmt%0FfV6ALQE;9FMnQB&W<u
zOiqPbGF>$-jjtqT+4?r7Kc$Gll__2(-++W+l!yUi;}8b#wH)z4-S0Wz26x8N7@cAj
z35|)a?I!9$n5YOdAoJ4~;@1&#)^w2>r_<KP15V#BSh!42DE5G{a^ZqA_V$ZzdN(|Y
zbH-`_G1QEeRDS%1ce~@|v!29~1I%Xpspv(sTRY-6yo`w9XHXocuNQg52c|xmJwo}F
zA_F>Nso8<VNlLPH`Sa>BrWbYg&*Lfuyl1INlj#0=mFih}wg<zyq03@tHwWB{2eC~h
zd3Q_Zwn`XamDz8KJ7biTlGsxdQ$}>G_CPFkVDhSSZ2p^1SxgG$s}a_lM6O!>LTqSn
zIg(-G7{6u7DmjoLJ8m;KTEpTC<qa?Z?DmCaP|W8QE+a;;-VlOL4X^4!z5a~p-OLTB
zlpCtznNBb&345fcGJeqw)lPp4*7)Inlzzu*cRGI>rv){1pd3@6LDbM}3>s-;!eWaJ
zy;6=I0Peuyc{pDCrm-zsYCniW*yFXg;3FYqhIs>6H&}4I0h45J$7<i8GKcqYH?shO
zx|<3TwjW%S#u|UybJn9|YP|7Hr;p!m>INnj1-fn{*CYR2PO9E1a~rqh9bdZxa}Wd5
ziB#l6doOnS&jI>EH|uy^4MSv)EPe6^mH>v3@Y1{&zD~n@s1p(db4%l^$%|mZIbT~#
zD@WEd$%7#LD-XFtFP5Q8I1r~Z_*m_a;^`$=Qo<Y{7&|LGvI!}2PZDS3+XNvNxV@Kc
zZ0JClDD%c2M<2y2del4s;Zn4J2}Kl6y;_DMe85^3nn*oY>}%hK3(^B%T}$onoW2z_
zj#IDT`9n7dGiW=6?t`UH>RIILrk@<S2=7ZUv$QB&%1m>j@YUaaFp8=kBl-V=v|}g#
z`y|tc{8u&kaZ<wi!L+G_lVfl>A8UL)`Un}<;xxYvZS8z@7UF?hzsqqemfn8Zz^r|-
z)XVQ*HW2P+{lWlbMZvnS;{t(MBV~J_pjN<(IsQ=Buqv=V=%)7qPvT-u|5Y2mfG{Re
zQ{aZ$84$myr!tvkZCA6V*}9Mu634j$!KReC2#TL03SeK1j4|Qprr{G8bIee#^8vjD
zvdcO7#_jM3Te~-}fFYPLU!i)Pz6XsEjNFSm6m$>7z)g*Ydd8uWvtNh}y@vVW?XjU>
zmbZZH)SmYdXXx^Q89Q1ACSopo2!{7lwEr)Kz5R40e&bJ9bNs%0AATq9j-|F#v^4HY
z?r8xPCt2&!Eu51@hcFCHw*#*C-cG(I9~aI?QNXnHf@%!#Xg7dNa-cGCm`EE{OiQ{G
zbvvi3vcN`;IQ@5`4CqzdoG!a&Yf+J|98;0TP#mXkJ_N_qpHF#4&c=HoT7D=&`C!?L
zY9=m@5or9PmC%>m_QXb#S&U}A2hIAXOAe+lUorafB`lQ-CR<<fJd7gc@GwOjh8F}u
z>opz=A4@|6zkx~IS+9{!$qKpwVhP=V-3wC?9lGIHaFSlsuvQ%jMjv1_%FYtVPD^@^
z-9NQtP#EmDVSQuFchLH_sv7e-v2?SlZI4BmtH)O$nj^8)ixkbrE+44)QOm%T2@pJp
z=JPqfn-~dJ{EWlFpH)#jpA+$XE|%H~@%)eEi!F^mcKR2gzDBxCrI82uVAYok!A!qL
zi#~qQ>;$@?_eVOxK1wEL+^S=Z+k583(cTLBxEbi<cEpBWE`#DYfSJi@sHB$KSB-J`
zYvDFqay-~mHF69^AUzemhZz6pm*R~FlxBiT{|(!}bVpKc11rkiq1UL>^I9rC5Z=pG
zquLKqgZr>}1awZ{H&Gsp=%Lf!#MquX9U=p*L(RVG#yGmHmf9TXKxow$HILn)Uzz5Q
z>C0{N2WAb&2PW3!ntxM(BkhW3$lqs#zn<m~{%%j4Y|BHOyS~O_{ubl^VaUTzrTr^a
zwgByael>bY7gLLgiDs0{2H|F!A*W4YjD_b^azJb?P}$2%)_iyC|EsV62K8me8)Dwi
zLl3qZb$$6k)>Yz}8My@oSbXst-szs7nuUE!VYIGGq&daVeaMY%l&fuxbM`k~0<-+^
z`I%cUQFb{YFw6y_EOVJY=iGW`0Xn4}ZY}VASPn1Fjk}->;eUI|H=rxHs{XD!@YzxH
zS!x=-_DOdX6Aq*9Dmd+4b3iCyca;-Y&K@kmF_?>S4)x8sgN84>uozY|ZQ8WjKr#Hn
z3s-ilbF9xkyQVhKkqE6?xiS$t_4J-o1IRbIs%P0voo&VG4*Iev(?sWuILctf^&y?*
z$`zqyD-tUenrYKyv(Sa1ypH^1-j$VM>o5NW17+jK;aY*aa(sF5-}D=O7tAx?gMN|S
zGrmvv_;qcX)Sa4e$M}J9U#s|f`Ja}R&+_%98lBW#gXBwfWjw;G`WC)vQY(F-Ce63`
z(Mi}Cz_>J<7)~W#6Stdj%a4MmPNAd{`I5##{4q?2T|5RFuP8<13?!dOd<gvBn|PJ)
z(Rq`4$0?t$W%o`B!H2870sdZY0II@YlTKHOdxlx~<9;xPzaU*IFZd9RPO6zVX;&~c
z?hfTrcMaUC!o8_57U+=aE~INmlDl;J61<O2irBm_`@qkoF5KAm_`#7_Xf(bB`hZXK
z8N`s!s|}Z%CxtrAJ>IpNdr8l+2t$Rpj7^hz^JRP$Zc+=&*o(4}Z@237hHr#z(6Gap
zF#=(CYZ$t931R%orcGSGK!}nNO?%mA4UuuY+N0BMVVxGs@VrTTf;J<|XO{bOY!7H=
zz4AOPh8Osgt5>hDWO%AAaFwk56SFMlTY&LQ4|*uWeLBxm{b}^Jvv<q<N$h6+yL4Wd
zW01g&4aQHdv}fQHztw=tbA^g`1uyb$HN~)MAx^Piej)vyvd&P0zZn|#83Gg!$a@j#
zvWRIQ>ig<;9d~s;u4)JLEv=hD*>zqCsSA)V-_mJm&HB`xrwx>UrbOG8oost`UgwN0
zFX)*DP>6aJ&%bQ*@bV3e<O$CtWw3edYM7VDEXNZ4u9t~&G6P*;^I%CK58z<A5P+n_
zeXq_-U*sG1ZTjH`mMxdRS0>B9;PqF`_F+C2y@Gk5-ivfRTC%O=zhB|c7`ADawN(T=
z5a8AVpZvUaHnkL=rT%qZ|1h?^zIL#@%r}^yG%xlOGh}zX_PL(px2Hb$6jmRLz;7NW
z;*a;-HZn!upMvYD`aX>7>H7XmTx;|_&r~>D-=Bl)G<{!(YrVcd4_DI1{Q0fi1^T`b
z*9-MMb=bxFem1TVeSaygbM$>Pu5<N0>mjD^=i^G5Vg8rl?{a<rSzM_<2w#Z5&*}Tm
z<GM)Se-YQK^!+usUaRjraJ^37FTu4Fe}@X?oOJbs`_N$o18q6zRDHKkc6OCZ+sVDu
zH|0k7trwq0eCD%F!)#3Dxi7Zz37*vP4Zc(Kt1C6UML!>zPXe=$l291<RRHl0X|Pt~
zfmZ<M*U}*kw=aHvx!=+G?9>rWK71^FW)C$>VQA6$u-+I>R2TXEeVpafr1O`40l8AP
zO(-uoy~99B|EKZ~)?InPoV;QIaa*3VV7+jDy;m46()9eD2A^!bF2`wRexY1Enijt)
z?cbZNxHy!H2R}bJTX%6N?XTPWg{(?jE+_l><wI>y9LnV+IzKqIL~$q&P-7H_a_JHL
z;M63=p<J|zADkMdIFyUF@q<(I6o>MFk><j8<pFA>;!tks6Z>s>pv!*D-IoWh&)u7w
zOVG5AD$8pTvFGvfilFMxO+0gr;vg5lGnu}39Q+iQb(m<mvuiG%jJ~6cy@?7Y|2N9~
z^Zyo9PjPF<#{z(#YWX=g?Q%U7*QsTBxe}WXsQwgxestamJ?xi1JG`UHDm9hJ6Xj>9
z#d_bVWk9ZjjN@?sVu^fySOWfB3HXKNr^(#9-d=+LTT0~f7&`7#%h)5UAhtSge+?t>
z)Us0ySd9zt^l%Bh50~Ko6^MUo8GB?E#7@QSnNlzLb}F_o;5UsUKaB;N|CV^U@Ht;%
z8Gj<aBl5FEWsctleRmhGr<Ud0m)L=T4VR$v!4mvg3uDGUGptYNpN1TsT9$8L`!xL1
z$1*;M(m}?MxPJika+Gxznvs|!nvm`99b`y2O8Ai1|4kbHXOOF-%ETHMh>R0)_qx!T
z*Z(pu1pEib_{+&PCE%Rt&U0BK#pOe^7e6@tNch1ohg|u=J5az=%fh*gwJ97}3y5F*
zr(u(xT6R`0zLAXgk<c&xD`4!Ymfv{8soN0$)Uvu<J~A%EQx=BAsb#b<RRG&1Tr7C=
z{er=Jx#XYk7fk+7BjKrKu1*~Y^y<4$i=5D^R6)ivxV=R1&NtxP889zTVm`DsRgm!p
zZkGuB^9CFcdmm3-(oXaG-@r#o$n$0}%};OdE786T$50GR{^idwGjfOOFYs%<49^T+
z_!<Qk`1!auXQ8DvoOx3lLu@46t*^}I0{ofy&scD_bpto&{WHD|KNs@MKsf(Q{3|Uu
z#}NiT7xxULhq7ScMw2j)3oUpD?imQb2!AI2mk2~4oLbJn?<5d``O}6q@P8x_f$=ZK
zpMl>?Ac7bEuL@iQf6#*4<uaOtcp=)k{3BNU85Z0wuMJ;p#iv#`bUtjsZT|nKh7&J!
zo{9gu6`yr(;2&CWn{OwTsISwk_z^1~)&&FkX45}Upb8$vy}{e1;iMB?Rt~;G!<o;e
z7W@tiZs&iO1-JA6frc~xdi)u@J1qFQ7JNj*iFb|#KhfetlLfD};5I$=7Mxnk;JwI#
z+xcv?;A{&f{=F8QJT!3G{(@)HY1fzWJMD$@EE)#FZTWmjpbBo6_jeYY+STAaMbpFV
zI0iNF^DH{;`1BXTK)f;hnfO1l;GePJFIjMEX%m04MZcYo@mtIMZM+#PzRjP1(r{j2
zlH~H|SuqUE$JPT+S#Ud_krHrGE;=7Oeswu>FV6qO5^!S=dh3fa#z6GwQgZaS5s1L}
zwj6c~v>3kLg4=rjuPiw8GW`D+3vTECkOjBp+_W#|(PZWGYb(CpA05zemg_S7nf{3W
zju@Dat>4lX{BpcAbbh`>y(}#O|GEXY+r>&EMIc_A&N~IF;H|hfc;B?()ZqrsGkO`A
zkFB?>EqDa)O#F}qxA}I71-JQc_ouep9)~;`h}VvPnm`qN0qzZ6(#F8}3-M>*y|`x}
z+~)tu0#$N21@|UCX=d=^U8KN8@cS&d&7a3DxJ@TN*<$e0^W73~+3kk-tmaDm89JY|
z;@kb;3l`jNzmkE*Ys*O~K2Jql2GaQj{29E|bqs{td_G&C#r$MjVDR$OZl`wrKB}S@
z#s7r`r`2lcF=tRQ|0WA=&V2RajamG;%8GC7Yj6C&wc^`)hWiv57~gKcbFKDh^S@NP
z{;Cz<<^#_TWMKZb+)mK?majjBKf{M(Ej?_@!<iP`rsok0Zp#Dfl!16{y^#>8g4=rI
zRttVL?hQS6Snz8s_+MCX&Uu^o-?89r7W^>_ZugJRTX0)%XtoLc1#qjr>~h(9%r4jI
zR(zXpeOA5L`Ivs0eCx32{|_s^P5-YgxSjtLt6psSk1qi~$%5PUsKL_g?eP(91_si(
z7=MQUwCx#4mK`6%L<!#b)fU{QpR&im__jPBBTxmm`&pxh8NUgChMr5T_;&ubKC$7t
zx&*HcKg!Byj+KANg4^{{Dn9FifppsSevLpC+?Jmn3vSor`xe~J$L?qCe9XKc@!I9;
zu;kOuzf?PYwgg^#ykN`i0V}?Z*B&p}cx`#J?Vqv8n;rk7%G=QvoqvLRBR`Zq1~1=i
z{@CRzB|qO%*%Zn1-4@)I=YO)`O}IDoY`5Sx-lt2z?f%P-zut;(%gKLOa9ggj7JNDG
z4Lx@LcKijFT-oqfO2B!>Cj<Fx$8WIUH{zYa`@b!?9sd|DK;C>Vw%|4&=m(C0@mJu_
z<o~J#x8vW*hzPvc@Ypy33%nh-CZEeJxUE+gspt~l=Kr@XxLq!Le#yrB*A_o*yd73P
zcK-ip!R`FlTKU-df5(FVG4m(Q4CJ$||Gywm1-IMFVhi4cd&B?REVx~+ua|(^_JAF~
zO2;QVuG9CtnEs3KB^ErS?+Nd;;58O}r3J6E;ASp}ARF)XR(u=pQVSl^_r$x*f{z97
z4OaY+zGpLIUM8^ZGZ4<YG2t$KL-=?D#C4kmKg@#j%rOSWH+?;yT?;;m03EKj;6}Ie
z)weA8WD}WJW~?u!FXnT^f*YMrc&`ONh5#MzwBT4;$%T6?xEcHK<wF+S)DhvowBW}R
zpu-HUXZZTl28e6If}dc)*IV!tE%?7%@cb$azV5K##ztbY3SD``8zMl5umwNG0C8=w
z;HO&fB^LZN3%=2Uhb{Q47W{Mz-k|j)={duK$1V7o7M%XC85rNlHlOde;I#zku+xH{
zWq`O=XkleOXIt=v7JRA&-)O<lvEZ*-@M#v@_>p7&(=B+RJBZ8XFG!qQ-xiNuI;XX@
zEqZCJ?XqY~^McmsoaPyAZCyR}bzRGrclO*2Zyq<!T+*57Shl?W+_rh~%P)<_+uAN`
ztFJ$|dDW_wtK5ziOO|)8irv&ab5&>e%2f%tP`GSCTYX(8-?lAYxumnXb^hWn2X5@V
zadG#}{+>fhl5+l%&Mzf9W5}?GC{V*~=xsfTRh=C-HX}-7$MWSX7k6Omdu+jZZOzTi
z^^I+99ZQz9UDvVrhPK5W-5raUC2ocT68L`j2&JFV-H}*YKeMfk8{zXi-&H;(DX%|Y
z@eX(so!4VG{-NT}yuNcq=c;9k?F7>joof=)J{q~_HXLl5{sk+=g<y}58<rB%@X4y+
z{Kd;VJ68R%ur+kA?3UU-6tf{1Jxe=Q!BNfX&JM^1ov_qH#NgJYv!ka|pkpWc+`3$L
z@L$u0ZyT0(EcTb$gVzpaTGO@c#%`}n&!9}BmfBXXX!~;Ks+A@xi|_{_b_`AIAmses
zWfzjzomi@>_9M4nR1p>0ijEsQ$*bQxarNgx9d*K?5B^px{<t{m8;ZZI@yXfaeW*ms
z{bPzH^<$w}{#Qw)FD2sbrv#hWOB5*sU++>SGWcWi`42?b7+U%t2=gaah|1B{@4ZEg
zg(KqP%f<|AprNfzxjVbAV@X@bs#P5~x2@=0-3HBbePZdQ7u-~TK^=nDK!J|yU@-+s
zy7rnDp9b?LfG_e^KraLqFJIZy$s1TaOL(1j{i>D8ZZWNH?1pPD*jy`C9^Aa~m3FF_
z>pNlGp!<WDH+sQ>ySJOWJKL76=vo;74WJ+Su2_Ae$BHa%|D1bWM-QwSq{VlBvBk6r
z>ldTXZA+}`SeEFCEpGPoZvZscUjU1(r)SyqE8ubrl&t7jPV4bTmg)D5YGy|_*{ZVl
z`W7qE((6A~p^zC2i=Jg)#&?sQT^-5g39xlpA}0*ZC?5DEM(WZV+PYwB7x_lJsb>Xz
zt*uCOv9fPmc~hsZht8#KU8~Ti{b8$R&bc{aV@)fX$+JH|jWl*AdzLEmZE=8tpXj&_
z*PCyYtKH82K(df8Bnqg+69&U|%h3$FVvBlKoeSw)*3-7QyBl)awQ|+!j#W!?AKAth
z!aO_wrjF&w&gLr?oZr?wgAJ&8L9`A3$67tz%kwmhvB|I%dE|0o+rqlGh4rB4@&%1;
zt@9VmZ2JRLSBE&<JAce&qkY}ey?j}s?Yd+a%%oWBM<3RS30z+%g3`5W<%$GKIOC5`
zfhDPbaQs(zMz+N)fVLhx4~oXoOK!@EoDALT+hoAo{7LfkGh@Z^;$;g=_N@GZNdmsA
zzaVe^nt|#;CAX+FzL@FO@#A0~W3Nz5M8VXAr{JZ^$$Bne$XIp8A<$pYvE-%>j!66v
ztQ1F`)8aj=mn9Z2od!j_yp!_{CHvY>f~<3SM{e9Tb_9no5Ye|TGoDqOi-hXq^U!Y~
z_6Nds@Dh$ue2R<yk*e_!G!(X=QX*VT!^dqw2PfzJwl+-k{2puj;OOdsFM;DUa%WZe
zVE#zV<`5NT&GKa{ZlK+lNcJ3DL47n8h!Mz`GX2BUjZC>Jg>xuz_y}`2pL7OV>jAG@
z;?jEVk2$7q{zFnXhH)(L%Q$mdqq(^N6sfLZaSwc38}Rw&W`?;r&)l4wOYz6(Os3V>
z8^pNLq+-BOKaKD?t+5$xb?T;GZaA2jR&N$O?KP2)asN+PJk(2E1*sP;Qjg{KVjDnu
zxiA;^Ygm*dOfTQ$;E~*2;f-Ft$^p;8A|KP+Ym9su;SWMYe)B(OJ=a_taN~!+S0^#w
z9hw|WI`e!U0Hi5m0Q%ZHTixu_&)hq~c$NCutWB=RqNX4IJp>{=qAs~#Fa8wL`{D17
zs3gzol*CUSd-1;u#`)pj$OSV5vu{Z~<=4Z_^Y4(}55F5#F>L(A?Zy8S)PKRcvCeqo
zdFsZjO_P4Il(-nobrTW`{hD6&Hh*4-`R>xdz5M%Uq?f!r=|h*Q6gzc25dRVQ^U_bA
z`ti>Qw4Ax4vXWmfex~)~-`+VYk@@a|_>aV&7k@X_RsHbS>BW8%U*%R@e_dFF_e&qq
z>CJbRrP6mGy&wH|HLDa$nK=UKXW0!sM*d6H|95@rpZj)Ay_@R=CF*|<D+}RJ?f2Xg
z^&j9zE(nA2tLR5ji|D_3N(uh4vJm>zCHL#C{{+(e@o!M$Z`UcwKkke0^6!`u`eT>I
zZ@xd(+2r=K<ep3DkC3Zkn0?vA&wUnN{P&@L{p4ql-Xvn;=kS>ueO-yd`=#Hf(`zxz
zrSkG`VhQ;-1#QZuR5#xAeI@i?tBz>)JDF^}>DQLfe>E|cLbFlipZiD*KaBkEEg?Vm
zYDDHc-ctB~Q9^#YHGW%vabJoTf2sDj*{A(cBq^&5=K4$2lhmI_fA)edh8NT&_v_`~
z3rH_{dD1t`S4jqSO3L3U_!}$z+kEJ6M|wlIxn2bU^P|6AZ$k3gC0_ckM0!8^4`}*L
zJ(K?MN1%U~5B+m}=--MC(vSXbO~3hm3rQt->3;<2{phcXtN8nLI?~VmKV#+p&wS{=
z4(Scw&GpF%{`7CujMHjBQ&HT1J&yE#^aom0k~*D|^mE_QSn1#EL;n(_H*}lpi^$NA
z|MzP8?Y(0p#moPnA-x~{b((&ci4aKtIrtkZ{lE30zZ2;V-R8O)0`5ouE=~UxNMi>t
z{i~4PkN!29{xv!=>1SPxm44ZDiuktu*M(<8x4HfbgAYIY>-4w--9tg}(!U4k{pjDP
z>DO!!{*$F+rGMfKh1RD3B7h9t=6d^){`5yQ{pLF@QwT5pw;{bB{gs!g6y!Mr`9BkX
zW2L{^hkkzdZs<1GU%<}t<NpRt|7xVMgO~oFBfTH}4VwOTotX4D;%}_<hkfX$N;Y(x
z>nSDZui{5p2<BW8^;Fz`PbfkET|V@4Kl51Wuk)dwvS8>o*ZAT7{O{G9S<QJXrRblB
z^pcmS|2?4Tx7#nrUt^_zmJj{c`_O+u3H^VsR-A{@|L2y_|J|3X65H~B=|`a7^`U>M
z5B)JP#83VQHT{Ru|4m5m$N!C*epeMk+AoJxh%UkCrBe3WLLd5<A*GQUbA8g-&z}0<
zqY3X-=yJc__WL-}`_aGGhkll2tn|10(0>Ec8@kQ4p@jZ#*PF8srT@<>q5tbzRgn#!
zseh<H#!CNkANv2qhyG*0cR%^**7Te2Srs+K`iEy#`SIV?^l#7!Nk5zPSm|HmLqDt3
z@ZDVh956rn_vlUV=G-Mjli-z~0YLree^%4q%ghl-|7Y<xR{HyV=wFWXhHi7+Gs&O+
zNEne3%=tU&shI!IBfTH}i?rd?t`m~}h4>pQ{TqDfXC8)bbG^0%{rgT=i2p(JPdydW
z|Ai9tZ}y@8^B;l!Z~4%_!iWBL$DjWj&m0^5S0TM0|Em|M^zG^*^26`V$IAbEeCTJE
zhVSN@D$#yhYZc;s8o#-C<^L-s+V2`o{|23qb$<>1y!1Z{1;r{pSI0A#$XV*{hX$ap
zMjXtwRR3|mPx)y-nsS@#MobDZuX2>b4pnEXrv@8{dqckg{}s|pUY_)o3ssCYIwH&8
zfj^Vp=;c!M5Bku58PXfN&6P*B`O)u=k^T?#{8_+5f3FYyOMK`*>L`WZlRVI?@tg4j
zl1ec3W}e%0{d?2jF~;=Y=KM!|bS3iZHF@%SmrifPc<;skO{NFD&J)q3{~Hh7q&L^^
z9Z{SolUy*>lTbgJbmr~9tMuL8@;B)8OJN_{!N`w+J&E*`g@^&@>j7PV?XV9RD1SHL
z&!ji<w+R*G#m)G;wEW!*`<j7t`;8x`UvNRl4t3Upx>vt5XUvc{_2*wOQ$=Y%d~I`l
zZdowTkznAGqWU53rMe8fkMIY-M<8Z_ubm&p($B=wzm26oj1Eg2ce7j|7jF7DZvBvZ
z*gMJU`avFK2sdx<xW_;1-2Oe>k9;3LZvC_I!wy*Qe-l4`k8}F~-+!G6;9zO!!0dSX
zS8o0Gmh|sp_1j~$+uh^gfbr+>_A#6OHtXSU=UulRjw9c6kN*vP<-o_<8*b`_z^$$D
zfs2PH<zWsT^}6-@+`|TwN4t;EH3-65cX*iB>_pcrnf2ByuTb&Ez3%b9j>A7#&jgfB
z=!YY~w_k2?zW;ta_-@Sk{?Faua~>x*f&a@LT!5)l@W&AR@)d#LnyTQZCr+r`fa1jg
zGvf|9FRb|dbMJZO6MWAYm)sBjQ|`0+%YOE#vb@llGs~#|y!{_@{{?>#*bbS>d^;S%
zJp<cUUdr(x8>bGkQGCV9MCY`5mwoOW*+;B56y!GtA7nFa+l|TPD-+9RU=MO~$+DXg
z%h+Z=Y2dgy&y9R;2ejg#U1W!Xvf>4w`G={tf)FWq%0G~gcAzRdSb9@GCXKg_F2@T$
z9l2A}Z*(D59n0y}k<8DpkGaNMP{d>Kf~mp@^Y$?&{h|7pkWZcf1&p5%-rK>8|9rdz
ztf-GMihrq{826_9228sB__xQ0e@tuA8@|p1Oh+|Y%GI1D)~=zXoAJEql@Ft3D_8VP
zTR9z_$07Tey1Mh~&t)$&_C97&Yo2Qnp(hgfIk*O|rqy}(f$%5>pJOj;#oRxbtfR9<
zczvQ9(b<~=kAL$b_ieai3+{9$zlmfMPp?5<?nUu%Rk9iix?1@j%QUzHtQ6%tZ?B-!
zKhY}}z!BMdc{jZA%<7t!{{4y5+~GlX5c^`z&|LV#9ZXJ!(>u699c``3`E*aepn8F8
zM@*idG(RB@-cP;xn*2Yv0350jPj>}u3Q0orfr%-p4}!_F;A%3oKNw6jx|vv2b|&2N
zhNAle!9-IG&by=gBh|rV6FmMMpS@JG#)a2QFm_A*pyZT|(DA9_n)lV|F}R48JQ5GJ
zWFj^G(cq>l<PI#V+aIYDSJP`Es%#nhcumiN_wc50r8BuaUko@@4<+Gya$C(++KW2<
zpQm1h1I^uDPq)?dI$n#8eHbD_=D6vXB>(*t;b8Kpf=sIuCuC2f2hgfQaB`BODE%yO
zhOR2`Q<vknI6(VcbRh|8h^2olX3u^%Ju95g3}Ra6_CJ=G935_!gpw~DBvwY9O()T#
zHtm(&Bm1`o;iS0=4#&5_>31bOl>L}4Kf!hgthiAJZ+5^3Xi!)#xj38fJgY3}ctPdK
z^O2v^Pi>Ybg-+?|+SKV^hXzK!<8B%i?o^F;CI?0q0w(#u2chI1-9JG&J+4x$VCBTp
z^Hk-~xqD0hYl%=absJ7NI35(n;rS0>IQtuJ7PgPP4)n|=d0s3t4_=0+!mDaC5l)bJ
zBU|y_O?_}I{KAD-PakMHCjjr~^d~<$oQ=0+uCHv#tcAbq_Yq-gcy&i?;I<&#c!#6w
zn*-Tfk#L`rqSff8vu^5#V8SiNE&MRtRad#Gt!1(FN$_7@=ybFW<!7qV?eL`Nri~lN
zec8_e)xMs^@$@f>vuoDbT?2o%o$w2}O<a8|v7)n0?E|)u*~t^=#xu38!E$aYyv+ZA
zkX#TOnzFPe=N>(uA7r6h<hm)`O2KYtvYcvS&88QI8{Bjv9B~I22MJua|EWY(RJouQ
zoZw3(E4kVoSQu`VGW<qf>__DW6BF1HYO?UaeQWsmdgay@>doo<3XsLpJ46o4-QhX9
zS#5#C_O5BhpK9-yp`!<`2qw`4UN9Un`cNS_To4$Ht?=DPK)V3)Wrd)2CofTs(brrR
zh3`Gx<})=CGY$93EMJv7kU+sv6g(<t=Yl5rm)XCSh~!Z|uvhscfBBr$oi{J<`%n6O
zsQkU}(Z5g;<@pE}p}|WJl{n9-Dnm2Rzoa&B`u`k6O07<Chv(^9rPD)*?6q6n^jlhg
z$LMqPZQ-e#Ia(yhR4|pQsz#+J-f~vXsp@jxc&y85sNLD++%$-Xp)RL;=j&b0^GA{?
zUCz6B@s*u$YMwY8{>_tzOU|AjYfR~`dvz~L>!yF0ei}Z8W9iX+InsUMJ$yGH)AKGK
zdx64D-w|Ff*N4Iz<a&SjE?%LEonf({RcX?5D$$y{@hYGJP2n}57*wzA3-3bCax-Xd
zxQR|68_f-eNdoCLH{Ir@-Q2X|CbEC~y@~K}Uw9*tA!vMk;d}5P+V(8CoUh8(95hac
z#A%BStVK_7f0#K-MsS#!xC+cy`EL&F3j|K<3v<sLh(ig-1@?`OM(?k@I53DRPdy8q
z=|Q-po#+lor8GI4!j&UK0Q+T~{Ei@L$|%p9P3ilk7-To8&nT=AxNh9u&Agk!2^aT#
z%eJ~EdjDuN^<i1!I{Z#aTy53YAfrHMbu+h}c!;MT3hyEij3Av1#g)`t|4Vn^q3|GH
zk`Wtm)douHR#a%>D8B6llv<*D<V={exq6K#w)BPT%uUGLRGFKAxdA6t1@AF8Bu<G1
zZcwiq<8b_&I2kmy0$?h(DZD7UzZr(r>9NdhRoT-@y}njnU(N1~1sOCsutpc5Mv<$j
zPIAMp&VM!4`8Zy9t8;4Q$bA6&<(s_6Q=JLbV=O`^-zv4(6ke#R5T#J{_phq{7EAqI
zW7XeAAj#FA)OQBP7wYm}zCayr#+AXZ4qsy}ZNy8~Qmd}O=DydQzKcH`9c}LWWg^z>
zZ2E0<-G`%yl$aHTpu9ipgH`86dp{UWOo<LO^Xc?x@B3xR@qh&r$9J(2uw8UH@AU~g
zp^A<hOkOEv){W~7qSVrx7ZfE%5-+b|E>arC>3<t~!(F$Hs>tfm-Tvo`R0_y}eNB0H
z`i6iBcjd|NK~h4=zZb$M!us2ep0)o-WCm}^E=(Xd{hVOV_8}r%qkkDgj0iZf{%Pd!
z_IApn(_e;P<WT1H^BC9oz!G-jub?NFr1638hBqQMOcLe@C(;6T{_SaTRR20`O#$pz
z?KPM<(#<?1^`yY4{h-qq1Y$SWFOR&5iU1vJnz~@{O-k=g?WyddQScn#QW%=DC`|G;
zI)4W#rXb*q)Av=7le!3$|0AMj+cf*Rr7U~0r{E*&5k*J9URsERX~0&!j4VbZZ^Fv~
zV?CV6t|_8OsDDh#B)G$9{MpIoW&Kn79R#utc=8Rl!G-RK1f0INz~*&7<`6gzxr{jf
zwjHfuV)l4ir!+bwYZG|~A|qWL3duDx(^JOMurPI}nI6_D-i6Wn9Yk`|+hgf}$7JNO
ztB;{kyI$2u97X<H@@7U$`sG;a2`4u26=l`N(!-`r#Zo)U;#va>dGYk!qG-t$co5gM
zK4(Y8nSor7AZi2N&ULdyaY7grhcOUL9^+=B7z@CtMC_nMY|XaEGac~fyi5%6)sD~z
z@gNUBn?0YVvXgodlzQoONhh*WM50Z{(@VmOgiM&t7I|^xgqNe_r!pPHkp3{UFg!6Q
zrxeKKWLR}o!Q`h=!^zr_n_1U6>6BNAUl9;eET+(X4slrVeR14mYnA+~Hl`ZD$cdO4
z%*$7<Mkzj$&B*)jjjB0cd6XZDiWN%OTk|+0kT@0kBR}N;ON;G54Yl&-73LOX?%}`0
zyb8#C0mj?!<y9Rjt|~K43M;PcWdMpnk}|II@nAew$#A?nKO7Gze$=?>pTyD_0(_W{
zF2V-ZR!YunsN+yON!agz!H_fx1C>dC-mFaJ&pV$5Fou$FJdX(gSf-K>hu^e#Bd}Ak
z){u`2bePrA_Ml8DEQGM9F|^_M2*dHG5=UXIK8)6_+djs%mC^m<gNaEknVYKimj{za
zx}#gO6Jw)0@Q`@R&0JN*rl0<~V5W0&<)%EN=uBUo8<EK1Dxr&-rwQ~oBo7Du5gE|<
zO(^_ND~}$}u6vaSzowrqswG%ocu`nUaaL4<6$O1tV;vRs<S_K5RZ&s}!^$bV5-3!-
zs=o2D%vY+i6;zs!aPHF7R^oc<%k{_yUH%4KcJzg7SpDd2rs6sZ<ATEI(g0($82i+B
zRq|QkK=KQ{4@rVx@)C3!4LN$K>LL`8wQlB?s_bo&!U)9)=+Z$Ma1bSD46~CZ0*G%z
z7V?&8(Fk9b7xm9)FkV6A)aYnpoPaD5QVetY|BU>67M2JZtH;Nj{UGuC45y;$9cD-X
zf}zwaV29x?1_hNsaB-lQ=EN36mo9?Nw8dUx24XKc{X1}r(z>cI)`IN{RU=oRG;)_8
zlVkP)%zy>ikgf>hG7FCtE^g33!3Iu19+vuGiqpRl`92WEPZN71AXcnTzm#iVV7b%x
z1Y&r(gDwNCar&NyURQ+t(A<$y!&T{~Fv*b!yCdI51Q=A94*P3$SK;)(MhbwK#yd=@
zgei<EZT3M+EZsPS5fds`!xBb>b|ecFiC_KmT7DAY25rR(?Zz@2ISt5R2973L#XcpQ
z!T5N15x9=wF$`3v{~G|Z5?L9BCsN8jy!;I^&_E?D1pZ8b4~fi5am`%keL=kLdl;`r
zh8YK(-p5=scVJ2!*T$XB9bfxkbX2(D^smx!TIF3|_yDfX*KS0Fk<a55irs+Kd0ib~
zYlC9`pWvO`;awm%9g68I^eRxN(D0eLuq-&Ei%G`vY->F8mC88hIa8y@uEx;w7S8C+
zUSFQA0c2l~+mikumijTQp4)PBc}yNlZHL8kc07Fx=H7-eZ)X~(HPeLoqMTLkr(W~)
zq0fMpDeU&p1huJ_qKTG5d0=s|Bs9?`fy$ZdE5fw5gW1!$>TFXPOT(~1m#D~`3L6+5
zfHKSD={JQzFvez}|Htg><Z`wN;fmF^(M=_fRa0IePcaOGbNZCxAziFp1f^swu|*LV
z8bu0v8cK9~k~`|Rl~pJYEDA=h=nXA(O5y63*U&0X-%dnkG0-ef7Nc0!1A1{FLdCKN
zxAB3VAao--&II(pEmaxlR)8fJ4j|$vhdg9zQXfoq`sYZwl%))cszmP~f7QnVf}AZH
zUFzM6c%}z-#Qk9okBqr3B+{)47ZM^|3osN`1E?wN!R^Rx_)#R}I&vwJ83<RQj2sA0
zVPO}su+^#e%3!{{Hzj!n6g#nU?OZkgkRe2CfRPYh=c+`-rr8Ty;vvz(?3Jn*2U(Fc
z29}&xAxkha^M?c#YrzbXsS83m^|A>m?hDEW3Q3s$u1bLZj_O__8|p@GN91T`x{A15
z>1R>YX;IuwD5fZGm*_=tV++NUL{qLPQt^BE7CgB++)ll?ltdTlMIwea#u&=dir|y6
z`Rkvz8iA7GWR-Molycp<387f;$+W??ejYPBdi~9HhUSR1U3S%0H&YH}fE76WUL|X8
z|Ia>8ZL{rjwMR!*tE!sP+oS0p`L8on78u5JVOe1z2&w>6ld!DT2Ak3^r+=+$GrgTg
z#yQc{C1`vXrEjR*k=iJ7km4jD&8p-@Zu%8;>_!o0&z9P3%7o<FoIZn#5+xE_vH?Lv
zcOvU?RaB7qRRQ8-_#7)d{gcev%FIo=H4Ak|TJybGHPXz_W1ffZ1rk2$+&KtgyJoA(
z%F6F8<foTHRAE1EcGi40R1C&QZ^zQ_$1^J<X8j}zOwkN_j{2wK=@H=$)?8dN_^6iJ
z-z8tL%c0gMjq!ChOA&*0;e2BdV~omN4`LT6*MGRsFFyT81mIi?=M0{#tDvE>byt%m
zCAtvRS8(K%Eysw7jl1r_AaXPMSjupmdof|FW=hGBWoSOK)D>b1vYhrmRyAP|b6p1y
zYUr75+|g8l2^OsEqW?4tP>3<zcm0VJn532r^@Ul+<YbD`x@}~GtzcC9koDYkuTmTP
z@JN((erO3K>{($SM#v;rF=>DCqMMXie%NV^m%&1XvDtf(Oy04oKV`bAy8xB0D!Hcq
z`4QUu631`~TN|jHGZkT6Lg<|;a1B$7R|*GdZjXc3PTpV`0ZRs!&0EL__6o+ov}~NO
z{vFVW4W<@OID@zjppgd*QRtd_aj!b#KIy@!)a%%r@P$wX3inDklN)unbIJ$(QzE>S
zT|_tevj)-GzlC^}bV91?JlnaOV^Bevzgb`!`8qO=r$2CEak<7W#M~NZ!!{rv7q+2`
z?yeX2>{r*z6-%-?BXQ1-ri*C{sDjAW0GPv)7CfuM%Ezp5bpLQLF;TG(Q<+C*uZyP-
zxV!gqF6Z+gxfQwQNrriZ=(1c|rIt%&@YQSLup(nLK3bhx6t}2Ko&F4>vZ3T8921D4
zK;lNtTD%ZWjO4O3^}bx$T*g3Q&C@`Unim5Fwv-uY{SA?b_La=~1`}V>wTZ39f$TBq
zt+FNJ%<OaxrYYlBx!y&-f;PoAp$2u*tk`la{R8}_Cb4(M>6?JD7Q2h&Ka9N3K}WtZ
z6-dk;O2$}(20XMaqMX=}WT!s{Y$KPM;hk^+MO2~H*>vpwEi&J9C1yIIy~exHUc1$f
z02ruu4t}AqKfr_&cYCaRl|?R`a_ZA&R!;t*!bAz(3jF~2i4doY%|l0F9>iLar{ZqG
zbOm)NCPNbyoWXcx6!{CW>8&)BPce^TC?{`3`<1uIx7rxVN?rhQiAi3Qg{`8TD_W2%
z#cd66$U91CGbPlu&11F+Z65zMZb$AhSz*b24I5l902B~x>_KKD941AvIYY8U99K|6
zB;B-Fl5tQ_!A6B14~mJBS!78<Xr;2-m99Vux{<5DCAo-bT}w*{9jdd(yziZZ5KJ@c
zdWX~qY=(8)SY5?7gV+n}UX9=-MuXgFQ%!oIv*O_zw3Tz&cIz;666Y9VA=@%cU8i;l
zc4E{jedE;LFM7nORf|~pb^%^BNX94|=52U8&=+nO5aynE-ON6<4u6cnk%FFi#r`Z9
zwT~rg)3t6oYHwaqc{=?&nS9+gQZ7adX0vu8pYdqLkKwv(MJN!@oR{l;F?ir>nP}Z2
zRpnx*7njKQ0qj%-oLVe#@s`~y1|#exNw7>#bL_#F52EAHa-~yC!&j*TAf;sLdnL0w
zrHq2!*>tBYI<fT~<!02Hr<=J`RtmF6pb4^b`DaO{20kiT0eM)%V#dK_C+>(pm|TUs
zJpx;cJC<3ma6OA#$pTX@A7yvKBJNIDBq`m@L*YS_jlr1s8o}g)#4+d->j)-u4R|N+
zp^mz#j@A^YBZ+~xYX0PZ(tNhIH?bwfJJ|x;A*UxHhl#Lk*_({ECmIrVm!%=qo+WhP
zIKhgkgkf9_8(3pj#&%%Q$&7^AVNdngiD_<B+EB1R$xZK&jI!s*#q_S)s?vKRsBJ(W
z<|SXyIw#-2F`-|VJT}+HWMINwGr7%57_Y8-br%Rm=?nBqz33IE_G7A*osy-fl|kM@
zt?UtyT4;AShwxOVA#5RxAy+P7U}o-dH$5bUF65F`G}U&JScapW%rac%Goz-**N3iL
z+Q%Vwf;GrVb%MoJtnK2fFowX=i?LbJO(joJHKd1hdQzR85UNJagj%GtR=7+g8<->^
zaZ1RIe>S7N`m9FWOK@H=BOCysLzB7R1SUHCmyJ*?GFyoy9zwYXc6l|qEhih1JNgne
z#UVGn2GVVA+RaU?xrvyYI&%{;H&x~)U~cvSwdB0V+_35dGH7n@H8&g0%?5Q-k>4+i
z<$Prr#WGi74<-#G4(oRRIv#ve7DllCt~LjvyzNM?3eWN`6-%+mFecGb88kbhP{K%O
zjAC|^pb=~w$1O^c+@6;2Amf5PEzTxvY2hb8l2v{TpTGnZal_7N$F&aECAiLTaf87}
zQ@A0bH?Mq7Hm_W6)p9p?uGBFSOe4MB0Nv<%mI|Sub|tHN>{!A6BC3XVtrWc0aRgga
zoW8{<S48dd==;2sQ8txXe0DY+t?kbRus<RBus^r5^9w$wR)o!Z$XMCTs?4!DQpo0e
z@J`qq5;oswb`EU>+{5J)Do6gz<YW}%@<JYS*g+nLb3CrOZ<OZULQWJGF*u|dtVWES
z?X(yi0<OFS)u_?nK^ffp-e_WivkA6wvPsGd26daYpEazX2<u19SJxLBh4-Q=um^tK
zHfjN_uVqC>H7x8HQVoI&GItJUExo7hMK-rWormQTl)w_IYW8U;Gwoy}K_z-NLw-X6
z6J$xTV3q*GXo)Hfh<1B}X+OP4NgH0O75n*82g;qkmjL_$Ig&as!Rh}RZny$;7p{4m
zK3}!ypfN&0m6l$)D>B=m8TT+*>me4#SQ}VY%`b~7varIJJW@)Owlq2zr!=~r;e}$)
zoAYFH@_5u7Ye4MY9~{FHGOI1w`y?|w=fZ#c`Ck@b-K+og@-|iEjWR}FJAK~-i&?GS
z+8X&&ypU@6NTT(Bs4~7|HJ^_yS|eA(w5CQ{Q!F?WZNU*DbM}C=Uhf_ftd~kLJ%(zr
zE#uuzEP0z&FAvgh_${cl%WF32i^$?S)ucgwu07{_!@mMG9zBiTu-|aJDbpaCH9_e}
zch&$l)TLz<J_F6Pf^3m?UMZd7Xjvj2O^r@T%(WOF(QO(l-k4RP>RN>Si-+Q>4-_3+
zr~5!kMq(zVB4?G=zlK_<IK2irxY$EUb~^o!;ujx9tlLJWYxRr%GMK1kUx^*z$>~ae
zW1VMi{cAF2eJ;P1FX?7yxhb`$8@=nD+p~Wq#RjPn(*Z!+kP4`r$Vd+a0(s<i{HZN_
zOz38=hF;=ku`4Mwo)smhKO&-(UsDn^BWD3Bcc5PP2YYbqV@*CwFy?zoiAOcw=X*VT
zfmOWTs<v8CJZ4Zls`D+7leR)TeF-}?YE}6`=7`W+KPamQLTA1uqP4<0g%ngPsW`z%
z1v)A{H}iLFiT}$Ih#D;rm{sFEH@Qp<zN>s{Dn^UL$U?FYb?7ZVyP=K9f*TR;;kAG8
z=335nV9H3o+;c|<A5<Uj!4BfLd+xZv%+76Y>Z#G}F*;6Rgo3tCwkM%Bx9!1=bQ1h%
zYCI^f<+Mm{P6J)@gASqylL}`punVn5??O{;O5(^566AyIcaY_@Mg9wEtvOD@=)<H^
zC6$N0n(|oU=vewk1>2iY6M`vkH-Pj8Oq9-+LSy=l;;go|VjRZ--S8G+(AzJ$wU4{Y
zK9q;xGx6Yo_+%_G9f%F>ogEAAjHU4%{O*98lag5Du9o!UvD9;csPpGrVn0BIF|2KA
z+!|A@q2>6Ucs1D4{}{Gl5906fX2;zb?R_T*4)>4V9FDCU4PN&zGh)a8^wueEYG~9=
z{d5%7#ZNC&&jhj+^@H`JvGmSZa2MVLk|&V~5jVJnZ@HM)6qYsos2IPONV!p3Sr_6<
zNZ%`L#vyrQDHB*7$qO;aTcjuTw$g6KVo=?q-$DssH5-M2(c?}@Y_?=w9S&vh76{uf
z=X3RX57kln>9KSIm?rdg0>0bS*8O4>0)`DnlM?3_H5h;^ljotZb(AL|h$U_iH4u?q
zY?stO#wVvQg*MJnm~2+?PvZ1(Sj1#vxpV&;8P_fuLxDJb?3$&Ip%Q7r2Fo=~=>w;8
zLzvi&=EIPlqYC;M`6wj1?iH3qH2jf9!;hQ>s?_eOZO9sT71(ZsySIPRbjo}B!vilB
zvZY;UYSMbC36sW$=&quVav51ZAHlZwz9ecm3O(iY-N3po7_W;#dZ^Azz8lda1k-zs
zoQ%Ah4tozQ?|r}AxpPQW-q4G(t<dSe4Gj=OU=c60KfO^Oj4j#*+RkcRn(Kj74OpV9
z`oZK;xgPN9=r#7F5jbdq^e?i#)!ygBUOZoDh~ijB8vYY3>8&h9tyBtE7s?VR%021@
z>I$o4EQ;);Q+g@&9@m&Hl^e&t*2DC^*4(GLQiR{{{7_L7!n~Ym?n=yQflM*-DWKv}
zM7;F$kgX3=uP(w8Jq|007JO<3y%Qhk3d&N=%iPoSB`7iIgQoN-)antc9ZPd-MC-r~
zOtbBui#Tb3<dc9USaL*1P@zZ!k1L0TU)J(ISB0<}Ud3Qyp52ByPsnbz(d-v!3BFIG
z?%=68QOXQ>cw;Oze6(5r!ROpql`l(t3ah}u<kSc88sC-7o|gD-_GIVeUJ`_;y1NuQ
zWd0wMs~P#CVm~5aM$GBsR!a7twVXzQc8cIRfTK{{0cqJ-hgF}ZG;#J3AD}$9_f9sZ
z^f0>FI%v0<Y{k$=5kWF?CLZMuTOW+=BD)&|NbSdE2+@^TM6b-8=Vm5|>K|<l^$jLJ
z#jG0e2?0KQoPdsCv=u8kPTyvvvDlkE7Su?F@>76^EbgL?AZszl)C?PLqC{&-%VrTE
zK+VI9;y3e$xtWM`WZ3D5x#9-{piUw~3KHY+!9y178_1{tg{fJzq6%#uL$aLy-Q*lb
z)w*M|^#Thni?a}y2ET%T-ml=vsL+DMp&HG#nu5e3i)%IDTBv|)+;M7gjY63#IQHGO
zLyTdKyj=g3V2M6N8KU&}pN2||W~PmN2N}pay!fBDzVUJP>$4uoixQK`Y7~&$NrTk|
zGX+R3t(IByri`zGE)c4NesYi-|K0<FeD=C*B%S%L24cRDrVslY6oUd)su;OR?+u6}
z^UuBN2Gevh2iY#a*a?kk--!Iyd5TW+1)~ntN=2ovBR(`Th(E2!^iKEfmz@n;+;lmI
z4;6h+VL!%jIV2D2B+iNZTm<eBR52>Cb*R!rX|<zN*-@$(#bTryvLxnaKPS>`8gp*3
z$Qtw(rAnT{Z=m0D*2=ae!7ZyQWV#;zN~YQ#<%|zs`Hd(P8ATnTcYhvPr?$CKXr}m*
z%<WY;SOUu|*h$@z-Y1cYY1ccYNKhfI0I2@*zZ<>z{TtpnT(wO$H{FB52P9BNhE%!S
zxlz1m<qpWYq;L=2Y;v|2FwG0V7m8LA4B+|)O&fEXhjd3OW5f`7><+Y!n*Kh&eyR5m
zW2Cb~Q0ITpsa6HK^J+5MPGTH8g%IUojYNSwBrY-Y#%!Bvf7xPc^$^s1l~aTC*kM;h
zhvb`Fo=r$TrU8s;!-s4_>w?Bu!wyU`N{ox6Aq!!cHCV{4B`-h-&2kFMpuPeN3AzHg
zWHmYc9PX&qNiKus_I4OnqL;*&{FnUnu$^CTETzWkMjHRAi-K(>g%lpiMC2gk0d3_a
z51CH?=g_1_zK9<om9b5*=7*Ga{e7+ibDl#cXK+XXZwJ&K2yP|W$>)Mq;6Xq#X9<Dn
z@9MQ+y;?lLDRd;iUx5ei2s5%#ydwU&{gwswAQLT)s)Id9B6BSTJSZ4n--T+*9SfMx
z2;^?Sn_Rv1g?o{go4!-+GsO0IiYXV2?!uLUJtxjInZSENC*STln`YoUtR2{s7lUL~
zVhwrs>mZ)Zwwb1BdrkoO6yZ~=<c86WvOKZqSrLvwDF*Mskv#EmD6u$(exxc!^DX;D
zZjq6hc#uMoQ;9Y6zNPotzkul&p-FYz<|7qs3t>_iyT5{ZaWfA|4kJI|!|uJ5Pi#Dr
zod$Qvc?Yb-JwPDb?~`61JA4iRGTt3{NTLW9e3M2X_LclCF3t7(o9kbbmaEtMLFyo0
zFu1Co;{$g~J>%OHLn?D5bui>ySb%Dk9c`dpH$k<C#%Vhin}&BccTzHmFt!U=_<*LZ
zH{@XT305$RIS8mwI<gB8PzM?@r%R>8rdgAn)zy{XzuS^NqXmcc;KN~@6@=kuJcB6y
z1@1cr4KB)cR}3#;XQR$xfZwU6?91;Imf`G26eAK$9!KR9!G6b+fz854t=GB(l;X7u
zN&{~2O%5NGJP6(LBf0QJR4G(U>#5I8<SlKJ{=WqS<jELk-wJPJhN#GUaMg33;9VVV
z_3;>3p3WbS(ZH`t4#QU^_%^Mam4Wg*n^dJga2>L6zC9G>^a?(zIh~i>X_d~ZlOCXA
zMFb~B8seF|rTp>CcZDCZ#@C(OH^LHcfi($<u8h?_85<hKR{nWGw{f5IRURnk*8bRi
z;1yaYJpVE^bQlgsa)*9h?lx|5ow>W*Mw~|VwCl`y-NhLI$GMHabH4fn=;W!IL$6dw
z(X(asgE2gOX5fSdcj#9Ym!-oEm!+3CV9bE8d}ECtCeDx=?K1rt4uYDy54F9|nLKA7
zPHWnSILTjU(KoQ(gWE3~n9)FCz*M9D7BZIpPZ6Gxm+@g5*+;~^4ObhUC}TD5H0_B#
zOp%nLe}^Bj@#{+?>D1<tk0tB52G{ouem;&BglfMz?iR48@2^1sKNoA4y3C$WY3tU~
zwiL7lHpB+5-51N;gug2fK=jZig^w|OE76#B`kIhIEcKNGfy5cH%-nsw4bzh+O1n(n
zPl0ZSKtEg{&n5$E$ZtEF;^FrFL&0Ptt=!#vqmOdSFA3_Hb!=iu?~5Py4wbD(9FEgF
zRC^<}asmvhs0oz|VQDAXOWo9qAI1l69*s91aQg2+K5pureNNwQ77>-z9UI>M1{u8B
zNKmYCxaSNC*!+Qsv+=E=>&(Lh^pEAExzX)NecWaomK=yXmqPvNX%6n_wm<FTCxQvg
zf+()IXc65=j|Pve2zh$55HG&Lw|bOkG_j@FxD5u43rr7;{3XPm)r|zu5T;kd!DY!A
z*$bscSV)+`Q89hmoykE_pkS{H9*f1mkNwh5@USxwqi7Y4pe&SDsWYh;1yK4j-@{?$
zi#?pve-8_s-iL`l_J#HiX*0%B`jgfhMn3n;W=MB{y%p5RAh`}zyAxLiP*=yRpjXo&
zP~`UlLhZB>S8Yx4u@{eQh2Q`-@TmD16v*j68?`nv4L_2N=f}kc_{?l)lN)Lph<*^o
zzJeZXNpP#OlSUs)y;HX8B0N;O!FOWm$6~ebB&IUP>eJnU)nNH&N8_r;xqNZO?JdDw
z(a}9SA|dS4UjrK4>aBPXPEU?hZSB2qy3@~-cAM)5-P(6zsa>P7)Xw0BI2H;T-*o!k
z!7Ic`yixxcp54@LtTQ}@s(wb)dA|Q}gHO7RZzpc)ojpDI7S12Yeo1oX*=6-ljcim1
z6tM<J@6DsrlNYqW$gY2C!({^}OpZ0a<@9|6QRB5+T7p}my%$YSyyDjG2EF5WTArJ3
zt=?+p$ArGbJYY$_m7Rk%#{Jkoj+hlZc6byc({2@?<!a28E2sZd`4SUUdaN`ukxGs;
z4f!FPViex2$v=#2hD?LN;$YcZn7_mU%x?OFyd0usv|>7cS{$e4?aoH=L3BKGQzgzD
z{5e(F$&d25RS^I*CB9{Y3ndy_(7vm(GYCoEn$HcpA2DI|=dfUCAAveK*N^Lv&4Ceq
zi-@VOmh^|Qbvu}^boSgQk{eH9QO?B@1y<n%XZ;}cl{@;F*5t9p6Yq!zUxdX#>!|9!
z;OL7jlwW+}bgZ03G81P2vh%@7fwchc>-kI^hn0Cw0VGvC1<*}j0}_(<PHG|lC+PSv
zs}B>xe4OT{_h!clMV?7G>WT*RG{#UJIFbB!ou+5AXHWq}&@VcD{~sDQdxeI`rZN|E
z=}zA?LU`)tNzSJ7S<{je@Qvo(fX$kY%|(b6so9}=s^Duajc@lH8%v)YORubqu3wF^
z4p-x|nwt=tI<Fd^MpM~VwbcG9HuOQc`@lc`9~I)x_eWv_%|Z7;4LICw+~s^V3&uy*
zC&Erk?aQ&D56cnlH&Dkj-NqrP<01Ef&#5pj*7yW^cC<Al`e%0PLwm~O12ZB<U4CX@
z%8e{-Jcw=C6L-ae*lv5mF386&m?+2}NOobFU@8{*wpX__;&YEz)OwVzOw-@T2bS%{
zL68TaZ4aRDpSKqpd#^J&x))!&LFnAZ1IeFdmpK1c{xFQiz{S(1QEUE!8XOF+iZ_0c
zFLJ)9=x7lc#{0Yj_0MCsHoh-7fG_&f0JfaH66VG5-ur^t8ThM12c#*&7Bkos6O`yZ
zPwrO5aEK$&RNMApPCR+graQV5Qi*StUrawsd6XWdrSU_jk8}MvG_!Az8HAiZo}?M=
zT?;bq+&U7&13wFA?Vg~eCzhTN8=hCmQbu>otEw28j6%lo2|{hw9eS_ab-w=}?!X)v
zXQ+^~5Gz*u`j{(lpAi>tEwb7Mrd-7uG>hQr8N1NS?Gi$EH0`RYh!2E!#Zud<!Ry2Y
z(qY*4@|fzc5?q#)K0I#0r$FSfu7#1mLb1`^3fl@!4mAYoK}-6Lk!Qdw<d~CrBr8aP
zK0jW&59h*@dqd8qAG*OO+#s5^>abhVzs;T#%QRQP0K@U5mB<bDS7t^yh9M97Fc@Dd
zB1_-W_<mw`4Bul_1`?l+Wh%lny^fNj+>$@&Qs=m4w{&eVX=rcVhlfX|BUh2B?A?9O
zC#Kr(k1Tj^Mq^N5dceqIg+qnvHF<$)fH*~TWI2u_^1MHe@P)<46bT6|;UR*VzYZ16
z{Wfu)mmlp)RvZ}LV}BfXcs8oPjBC_eSYa2;uf+CM9LBqQ#H}52ZoePMvAH#Q1SNT3
z%3<q|rlmFqJ;nUW9Tk;qv539}yIsRU97T(%Y$&0oH#uOxoZmzB4Z<`=?6+f1(<s-a
z&eTF7D^+HDIC43bsTnuDD;z|2Na!@Zjq`KShrS^6d$;Enu(29Tv9fnRBomxlC57T(
zetW>d&WoVt(gqxt!+4-3mek4;lVxG;IIgKBCu7{3{YupNH)q{DRBMShV!>xP79O<Q
z7r7T4;^tX*G}?RXgwbg*-IF8kz>LFTS0MUkR;Y_Z<yM{R4pczPZ*gw_8-QS*#@_xp
zyFn*)C!d2)N=Mm-R*{`hKZvh#(?6X9)xUnCI>7=oLrGix-dIkjxHQKny=1+0Ovhkk
zzmaFD;wwwRP<&XavuOeZ4d*}2gRJ0lbL@v6rli3JfPlcxpmC1RM7#$f_ri`S!{-X<
zq^miw3(3}#r%=%oPp=^+ocdjt9EU!=K~?bY89$Aen%;LjCouz7kG)I?z3-GKPZsLL
zgwS(}FrGk~(=;R^eF$O^mEQ){70y~Wg==y=<KkRy4>@?Ix7BKvRl(v4!KhQCDH0q?
zy;Gi;rzwOzpZuZ=g-9wfmBN*tfr({qIVRKG#@{3^>1~|Op`;#+$@}t!h*|p_#3Cz&
zs~ThBYLeqo6Lm$Olo)+fTt?Wfv*nB1!{b=<%@s4Y8~XDEoVEh-C|yi2|Nm$2P2j7l
zuD0=$djmwpB&61+j#rEbRYPu=f&(T%;6`sS3U#Q|BqTQw2}w+D7#yR4mNZ7OwXJXM
zKxwOVQaU-k4hirAYPC32=_p!T#aK%xrPf#e&$EYf*FE<f0hRatzW?vrzucUCp0oB^
zYp=cbaQ5EkoMjkS{R!>0UQJS&@BUYI#~W_(3{U2&jK{Ok3FG0DU#FGESoPwr645}g
z<kb6Q-m6S<@oJJBH0)hR>{<tMENE9f^@e%|_6s<LqodVyA9rCkVC#TvpzO{JFT>FA
z6)`@sOZgm~M9$3a_{*8YlNH(^9!_X!O~Fl_UzCse8*|DrOko^loL@EW_d~;?zd<8|
zoTnD0$EsH@V05esjQdnX{Ru8F?UNs2VO3+G^-<&%3-ie9$I$Yi)Btu3VRP8iYPLZ=
z?z3OT2m|~nb-(wX<%y@>eOS7NP(EPV?da1FFF=9hee21NN%!fgv~8WLG0_#_K)su9
zdCPDX2+&gns&l|?$=g}UV=!{)Iswi8&?ocm&Cy*$*QonBE*zSnUd+^8R*cv5_qXqj
zKH9V<HubUO(|GlM_nAjxS!wCsF6^dwE;jDT7<YT2@95bZ>KMs8<h<#B!`77!+^{}&
zi6}24-#pccLCZ&#F4(z;9UvcvsIDWTj}FbJJ{P(ABwvqZZI3=0eG~HW%7Co5sL!=~
zyRR-`_k{Vncz^ckReJ}bkMa&4L)|^0j*p}1I33z{6vndl#NNWJ_`k4Hh513e=x=vQ
zDRIAg{p+ilxc51{6(hZcTUpeND`)`5RJ^$veS>{1JReDdE4|LjU!z_zX{t^g8oG9M
zYpL^#ZHvXcdu7tr)YD8=PvO=Qt2!L~2i=v@N!s)7!73Nq_KDc09O^1&+qfup#ymU|
zyy`d<6-R$(a>R?NGAvH3E)E-RR)uhF=)~S_MemlE?MfbbCT<4*g0Xq;E>6Au3uiCl
z3@`6Lly|{e)!tW&-nFmu*Z0LrIO}(NdD*MULSD{WxgH72yZ`tu^}%L*HQ+}FNF$`@
zgv*40_2f>xm+yn+w6g9)b%!9|JlTI5ER88bbr>3j_R^-*?IsGLu_#v2^9~j=UH~Ox
z!|^6I#8eA}o3Ff;&*7|R58x+AP_{X5)n-O8i}h}-A-)Pz?7Q~9NNZsgA116K7SGy+
z2@>s=dtXe|Z??$#o?ES$VtHRLo$3)F`zh7oOo9N17gdB$^*BRg@{TWeEOUD|(fbyr
zXa*==trl>sFm+?s$tb|Qm0a<+MYoch2!`@ZriLe%^0x8{Y7^lg1j`?o=g7yjAs^wa
z<0426)?HXgd$+~47F7+|pNVJf-n&y7+kXMA8;au9t7<a<y<f}-DoxUp+Dw@BI{R9b
zA9DV35%(^XQ^7h+t!5>Q@jujcTHd|-Cc5jyy-y6Cpf3CN&}?Kvn3Z+?(B#F<1g17t
zPk>F5*QD!YG8@;$GIWA>K2CiFz%GJe{`9!LSVhoda@HEO3onR!rtKKaZ#FC|qkH#m
zvk&1mWM7Y+;Cpx8$5wh~-nZ~Eu${PbR82Kc(N>$c_CBg_D8(yc_QjJuU>VmG%Gpt!
zSkXOgd{+cJCA&s6ap%(zs{0JyG;-evq&q{$LN%F*!_zWRorUHL%fxTmT&JeEXw=wy
zWiRFKYG7!Mn>TZJ#UpfT>Xx^%4&|`xD*U51A8rusvEKiP`@+;{0G^K*W(1DU$Fgdq
zH$SPov+d#ZUwYePM<Hle@Q7GN_uf#~Xwx*zFDeI$EdmwYcx621lvUm4*1Rz(Ja5&P
zU;xu7U~+)fnlogD759YVQ~!X)dh~?P(9;f66{?r-s2+tW#i@Tt9;yx>|1%a8D0ms}
zF6ZN6T?Y4i7PgpO{lXouQ=er=#d`mccRc1FwJ*CG;W{VPH=?w_G~AW1ruL8|oIGmR
z4}d;|a>K3NyLdqFYldhUHiSSj+bh9O+ap`a3ok<>A?4w2Cz9RqS2K%Z+UuB}k%U~d
z!g*lcv<ANai=Ka>Emmu_93-kH`YjkuHPLS{GWaf<$$qxMrd?K*p=SWib#_lIYX?Sz
zSQ$n`hWw(bDeIn!Inea>Si5Itk`#iQO;j7p$`llao<pBVvv)v~Uhy!p<6r`fs~36G
zpJ$04qDmCyc_Hww%9N{RI2BgM|ITKC`G<9ecO9lm0b}LEhK^PRglIwZ&qKLUPQfad
z7z*|NSIYA_*WEQreaS^Va3J?(Lb3f0az3Fv#UAyhETCdlJ=}a+*-*}FFMLfuIRaAm
zO$iw0l&E1&zA{DhH_Ty)X^W#zvnx7@s-YFfq~%UEmHzJDovIsC-GILR)HMrtp}SSL
zI)s~V?#w~wJQl01w5#6tjY*08*x+DERrCpb>+p?ubXV2jpU2xXtSJl*jgLo%)CUlw
zco+kd^-3?L71c3%a0#~;dZh9X^OosXa`o`#$aZo;rG8J_N_*D$%wfea#l-0Ze(4A+
zs5wI;s`}?(iU{|{xcg;$HP(!UN?^=#Wz2|HnnNVF*N*pg7BU;<t7nwxM<_<kh!{h|
zr|t55M~hvD@0_l>6+I#I9pr&^s)SQAOYwqJ-&cng>Q{$ic&2uO44uYuDoK@-5r?Ji
zJ-Rxm7m{LU3RiRw@tw@UMP>qgFqt<a{rgri`>xR%kHMwYvHqv*GaEa?W=HVBr!BKf
za09ihaFZ^UH2bHI+R@cv5(iex!4fnlbg)o}jnbUZ8Ndu-UjB?o-aT`1qp!wPm?+__
zPRVMF2<bVd5Z<@R`PGa61(Wju3+xBKN;|%5c)Co+$ISMp0REqS-E}!NKlx$XSB!V?
zeIfWvx)19;SXB>dXLq`rw$6^BIYsZGUu+rgZNt`Oe%|Q1*%5p_NiE06dl%|kK&;P4
zm{L_J)z*05h8yp{D#E=9`reOQGiRtbHbm5Z=zNardmp?0B|f5c{YJhSWAL?+J#QbD
z_gTK;X#-j-H71HR9PuTrU+jHp!|+|FqMuaqQu{M?Glw=Hf~v-s*%slbUS_KXY=wN_
zM{Up?xnb}9%-OC#gS(y325kv<AmlRxWgNkkb6W(=pf(`n^XO&}6NY^B7&(fVtp`n8
zXMi-`yI9+)BJVov(4JxJ)KIqT80fnpXK4BLFY@`a-gC<pFZGXQZC>pQ3)z_-?zLKZ
z6jEgxXG6~QZ#x5y(>bblyZ)-tN2wjwF7h?|U3`h!hG9d8ZWu8%d_!m`v>{tx*fOJP
z*y<Trmzc>XMOLds17~r3oxBzUCahp!qfs|bv24dmU5D0G-<>N>d38Om@`2V3Jbv&8
zS|I>U<J_`7tV^n?SkYOUoq?;=2Y>h+HI;B1@r>`JiSk#Eg0uLunG03?>V<5o_>WVC
zzhSR71WXc!G1S0m*HVmG(;Py-_rdE9*+oz!<qbLd8SzYi$lf|*CLK*1uXm$*^iG{H
z{ecAZFcI|yNo;d2FW(gF8Hk#mNps=WbW|QzYd*RFCysNYCF+8G!`laZ6BD&IdvJF$
z+OKy)a=XqBp5Mm`LU$*!T~Rz}cJ<t<&b1BTK-&}%Uz4u4<)Y(GD{~Us*D*0m8FS~r
z^!v@#>j}rg)%_>aBDfOko31J}q=oo2sOoZKy)Qn@`viOAntrDrYuJAM+pH4H@>B)4
zw<<%Y#`_mw^3mP+%6f}w?W^#r;22)+j#~#XjQ8q~45np?n&`E+>o-$h`f&REa;kl<
z(a+c8Mr%CQJTZdP+gGmR_7&_K*xgx&S^Mg~G4b9Pxm6AONJwzskx&>5frB%9Uwmp;
z&x_Y_1`#7DOhyjI$Neid^;ex|bHX3r-yAoHr>NBywsF`8@fao;XirW!mU8qsgr`%m
z|K-^J?4$98O0{KVw|b8XKGm5I7V3rC7-HtDw-c#RX79+Ns;!$9%lrSt+dl5AoVsn<
z=vWpu18u?%3@kGYVk1)?Kc?EV=VKKQ>K$=2Uc_ilJ4Ww+aZ&<%tj))q^!F&#WG2QL
zXR6(gDCbse75RA<cF$JfYob&ddH%1ioc@teHW#mK?!62v+&egl(UbOOU?l|kv_aV0
zbsm`f<X9h6cr4cQ5)Ato`CG$ojKlPpRK#c2H^#PZc>{TjjoT8N`dr=(^nVWh&c?!U
z{?J*B4v+UWz%Ana4R8y&_z0ir(l6K#S7-f0y+i~<?i|F2u8H-Z3-_We^$x=fTUJfo
zQk6G*i^rA^8C&jh*Wk_WLU%-=3Rhb3b;yhLE`}|+#}J<y=*+3uf<{fRddfE{Tf6Cw
z+geZ8KeZlI%?}4)t~>p)U3@xtAc;?9<qyZsg%K5f!*QC|v*!r(zj*7#SzE$;hpz3b
zDC`}){zcX253<kyF_s1PK7x8Ts`t^@;4XYI!E|d!j9UGXlT^1kBYUV?w9mMKz`d7#
zR?7}T=tdcP=2`7Qj74abp)Fx&>x^u+%%Ym2pTL)J)cSbliiUnYO^hu{M$7s^-<?^m
zxb9@bS;8oq);a~P#Jd@Ap7HKXwPp;9j@92-5_wpOTRZL~dW`At)@K~Bl84&&Z{OEu
zy1Oo7{r~T^nQ(699RDZ3Hq)(ub5W#u_k{Egg6X*7yg=P>Vvh;#_%SbwS08RvxzTSw
zJs16-gN|19beP~ZFFnOqM8y3qc=Bsj_~Iy5zf@w3MX@nPva0GmkE~d$(|KY0g<dn(
zDysXrd2`KF1ys_?^z7N)c_DX^^z1ou*<t!~C|D95I<dO<9W?Ct7RuE{S(;RR31u_B
zgmNOkgc9q86U)iw>07eTa2xsbzLXlI+IQ}}$XIE^SRYGeF-(zE^}d0XYAi8fi)gF*
zTnnE{Mk~zC3f!!hH}gr}5kLd3g81*r;Eaji$El(6nc=QOF$tvdG&Eah4Rd-Y;!<io
z0PA*Bs{7ioVz&^_8UK^oP^p!FMh{+8RGnA(PnCI$FZ2giM2$yI?5-ZX1~Tvk3toFX
zi%-j@xFCP92R1h3#riJ7uC^D{Zi6RdJ%2(s_#{5B9nY(L+xCQ8s(W9o9=9uR<$rKR
zuzy(=I=on48+H}G0d?Q3p8CeJV=H>MRbb@Ov-3J!gbBCfZHn=!ujTbz!iK4LV|?7(
zaST0rzKf#5K26o<j@wwZbwCXwwr<hG6WzVegBT8CQ37o2A4rWbwwn=#-s71*!Z3U8
zXP^x6DVyG{#;MdOBNw9#v2KC<al5;5QA}T<M`^>&2u6$8njPyM5$}Wap%Khy-pn_u
z`m@JZ_53T+F{-M6<oNiwU08vN<f(5!z+dpe2&__L2=Ug_@vN6%!4b)iVm=vTi>#Te
z@geR34uSSQiS_KBw@2jN@DL2Z`S84ZMy<}zyXX9@)%YmoJ?Dp3*Mx8gudWH>kiEJl
z8;4=5Ylh)4e09xm97e3J!8hUu@cz%iocPoiyB-?Cc2GR2&@&DuMjgh<k;|?@6+2`#
zXT>n_{_$O3hP1dE-t5Fm_c{F|KT*{`aeS<2OFp)3r>zIfz)a3C2mj;4@~30MYWQya
zA340LXCM;CLgLP<sZZst;zA;ZTGd&<;D^r-t916xTz$40AI5vH%Ne@58hf?OXC33c
zkE;@>!T^+28TG|}G!eHcYKjuI8=rH042cvaD)<DL1)FpD-bidw;A4rHs*PZ89qzk7
z&R2ArMcX%#K{fM+C18~n7gElxUS4|)H~9DL@7KxUqkSKX^__>Y<WqU~EQ|EddY4ZG
zaI;onEId1Z=<u2SvoM(6UcoH@mtd@$oCgH&YQgD+`2K0~x}JCO>8&DqJKsn#2*YD%
zW!|bGMAR1fZFXBeb_>8i;@Gh|^~t=Ie<0yB?El}j2C*%(Bg0jbGdq8i;`0@N*ja#w
zO!)Spo+q=oU2}R>??6=+o+#RuOjH0!{%t4$>SR0Pi_^$a^_ukaE_nP4TP#l2`|)GM
z)5@QZhvB-}uRj(JJ#->DJ=ry32=caZT_PXqg{#I5#Cq|;``+1wo1#wx!2<z!8elf+
z&_zI)1lt3#)A3L)H+~FzHLy40QP2(JjfkQ<uW(Z(A9sMWJO#IX6m9bEYP`e=`N?5^
zy8bqVHc5#bpnxiDe(hbRMZz8`i1tl=>>;x3QtT1Q&-?5c7D3P6L-KC;N0?2|zu-gD
z_QbG}BlgU;SYK`|Iv7i>JmlT|WGuQ3gU|8Ac?P+Iui^}k_1wKB7TvyU9oh8kEzkR`
z8l>TlDc(1yP<`HH{<PiktQTVUog97q%k#H=2RA-<?}>${&FRlZ1NU|;d@Zu^HlEx#
zCmbKM^PIl<WA?<e9>?zU!|>fdVy{*W4vdTqZalhbaO2df!7U@J2DctvmGv~66Cm-d
zU&XQ>$HK%3sBzd-i3M2he$3h%8{7(LV?68m*!|~~uNi;F<u85(JK+Bn!wp~F-8<BM
z->>n68?y0h0NZ1DV~LtM0<ayx;I1dwl;79+x7!|WyXW&i1vEUxsR}mByE_h};SIU5
zM{MTK$-DdNTolBX*tq9ngIhjYb>Bsauh(pSzUtAc=yqh})OgmmIPU+(!GMFf6NEN@
zrBNSnmwEE;ek{${cvrJ9_QqZO;$PK+u2TQ$CWI0DW=`9Ig@<Xou~0W{8ye_o+hOKt
zb^kF_<0#-)tE11r0@&{Ud_4L>71nF2qW>mP-TOPP<y1$1hqIx0-~1y{b)Lave1-8W
ztm|w#C7$&t?93-;1_zJ87S(E;Wc`YSJFBzs;idUU?y1iDL%jdY!s;wA-g-)P*59hL
zeqD|2JcC<~s6s63_gEO(919Px&f-lZ?j=z}<`wPcV)`RCH+(Wh*=J7Q{AoFJ`WmO<
z-g-xDaNuZo{yE4&3DfMs+r(hXBVm7RV#U*mcR!D}>QqPnc}`!;w6WM<qF*=`&w2)`
zAJ2Oi66W3g3vwu&6COFOI_ohw5Hzlar}h4-YH$-W^_0rgmg=m{bHd4K5fYc-j<720
z+3Kv<;CrW34Q@uho{EKAir}JnB<wYM;oyHEe{WQ0;ak01%i~k8F4~>9Y9hLTc=W0C
zDpVDPzwW{k*;CL*b%x6K9>dvladgw_+F+IIZ?G3!Wfv8T{uSy!Ssi_{3Pk3NJr)?m
z!4(YnN;Sh+i?L_YdA5k55GreS$E3dD@R4`$RKV64lF1tX92uk(Ox28`dt&$5>cnR#
zzMppwMh<VI<H@_{h$FFNKLs`KrJUFyk6{nkz0hrY>|t96a0YM3DEzOwG5ITi!Cg(T
zRz`cJ#-}LPjGO3^Dvl1+ho$1ZcdbP<-ruB$ptG<{H4DpBvr6zQ$FByzI{e!6Mt!Cm
zlsK>h$$WnXze#A`JIiVK4sP(_Xuh(qb?nUES5M;Y_%Pm$S3H;l24|^x=3KmL*X&S<
z_Z1CRT>nSjjaLo+F;acVAFGXSy{Dx2xn|3Px}nY(n%Y_WQ?XY9gX=03&&Z;R-aL%7
zvMYMe%jWt!TFditDjuZ8ICXz3U)XrF-6+G+IPd<k-iJv}&eV?uo#TC2o-a4TJq3Cr
z`@NlA{7i}(C6L~R)cVu)uXh7XWd-b)+Z%4?aHPA-dU@WeW6`_ln{eE1Go9;qo48RO
zT@mJE_2LB=FEP|H(_MWZiSwONn6j~@VV{!#Sxn6ty`hw>>iwf4awl_`ojNtwsK4F9
z9sgaIU<ee;>T1BDB&%yl#(?Mm?`hBGTEN*#J~yf8MLs10Z_EU6vAU#$CBHzR+yaGJ
zUA;rMsI$~Rr=g{-VR7xkL^9dDBr$eI{Ja_G)?QFq5uaC8T{$k&RNvf^XmlFtTiaTj
z8|qt}hPL(<>R)XWt~d=HiTY%swz0V*(U5HGXiju`p%qSYQ6kdWo@i)pYECpp>XXTi
z<^^5JM5MhwxhT@y8EI}^THn$PA?dtU)OM~|($d_z*j`vv-_ckr0rz@WM@OPHSxbga
zF_dj-i6q-1$Wz0zMw^Ai6<y7c13HJA*LF5vnQ&Z|wGC}uxYFENn^@AGT;a6TcP49>
zbu=Syw2RZ8=vdO++1cFI+UY>eMpw6v#FDn931B?bLNcPQ^+?f?pagBD&i49-gp&ko
z*HSCAw)3iMW>#I`;NZ-wH2(;UZ>&$&k4Mqew~S9NX=eenwk0F=4GoFTPHnl-Cv}c?
zlnoi9Ar(c$mc<HZS)zV%%Zl1m;W>EdgPHGK(FtWDiH?r8j?*J2b^3ylOUd`s?{&?R
zw6}FOFR$%P*2A{SVQBuwM3P2pO{9vvGt$)75lQz4RcL%A>gf?@KAx4{|1f^|u$)j%
zc1~7KIESy{7;cgdGshfr#85>Adyc0q)6UUOq@80BnRc#T@j;}bwXvhExiK;}S~6);
zX-R3>sgVWso$%?l)=0<1vMEz0PH7w$X=tf$T^L!K=%BYmqEm`Xic2G77bTPJou`i<
zU$1!-FKlaDh=OSA>S#z5H?%DopKNPuX;@U>+&aFcW$BXB+B@1VN0o{+PHifi+BC5-
zI(hQs35}CVqNRyR4JA`2PMy>=VZnrwL_=aiW9fv+rQ`JXKdENcl@~Z!%k#629yub1
zk9-#bJBAk!7V+QA+(_u$+?<Nsh{MIQGGYjE{+phgUy)mgOFiM6LZNa-^QY(Lkgkr`
z5$5q<I$g}tjm4$aypF(qT@I3i-^|?dp73Wvp`D7Zg0jn<2rl#SEQTxi541CLOL{_~
z1QUU##EAjs96rNL7Nk<AaC&ZJdhXcixg{03WixZzdq&(iynonD**8N*_?S>`8Ir2&
zpaQLC)_x|E^RAEK0v=sn6}e+)=B~}^u`EVr<&K33MB=reXWkl3`d^TVw!zHY8fB|l
z)&>>1HOiK>J;N<I_~*)U^`4!(Haku6zHEQR*TP{bd#B;2Hn^wB?vkPv?MUPF)l>ko
zRT-4946aKRL5b$eu{=XN|5?5$FO+{>igCGGL2NX%8x1W?1Vhctt?S9YDSUG%bXRT!
zqQC?`Q;}Pz(%g1{X;@A_H)&pHWpr(aa+;mHGuthvOESu7Cv3&^BTXf~C8ekK8F)s|
z@EeEqYjv-r6Pa>W8p9+`Ieu}IUXAipc8t#<JqtX=;;VE*50@IH!y3b5FY}U~hk>x0
zhd+h9zBYh#tgqWmdg{dVJ)!wDYJPQYjw<8b=KB8l!!fW6!@m5X95gXQtLmMrH~d!R
zy_|X1RW0;zdfrXFrmx;;cvK>8^3FB|R{u=s8e1oEiM00_+L=DIR|{HRf7#G3P0`A>
z0L_Z5Qt)4&rhxu&s_7&mtW$0tm4EGyxMedU!@qV%bUWE%(!atoaMO#ry*(rq37;PJ
z)1)Go?<3-)J`WmxCm~LL4Jc#g_gRDgJWWqs7PE5)LaD+C-<{=C8Ux@z5qyp@onv3h
z7f~LlOd(w+p$BZmRfV{dWc0gvCf!EF**5H}zOye`ZPKXQDc3fzEt?7JI=j4HU#I$_
z%_i+Ll!vs?Fbf^RX48hNCXhb!x}m$1bhgdX?eLdVZI-Twg{A{PgT5p60rONn9G>mf
zXeY{+w!7G*=lc>&dS$z{#&+QwveJyV7RIBFYfQR*)lbTJ(9qTe$v8Jt2L1RSCf!-7
zaz%Ymehl?&f7X@Z$JCK>C+6TE!rwh|yKUaSoG!N;=_t3wq*Gg>-S$zHaX0$W8&&ff
zUM}UT_O%;wIL`QiNq=ja-lG0&NUuMg0iF5=q^F<0WBBoFv8ggL{SpQqcczt4ohqM_
zLrCm6cko}j4}D4c5cQpJXfO4z?=y4PWTn;jYXkJ<n1K5J!0_8>Wbdn9G0jes=4SzE
zzG?Gl`d*gP5r>l4ac)YLul0}Zsqs#xe{2Um)6X;MzegtNbtjcRbc?s@Fu6*9>jy}$
z+CP(CjXPZVzU|-R@7ewx#tb;l9{$sOD%k#6KM(!E8c(%<baUmW^Gvz{)-x$zk3DDS
zZV#uG`^XUi?L7P@A1uCY_}xweA<(z(GuYv5(=ugb_|}Xpe;L-daz>J~<M5jtvdu2n
zW3=#aw@NEVDK7`vnI;WC5N6Woe$_kP2_Nb)v*J-xh-BS{$5n{q9-};Tg&ybg+E>lB
z_4eA=^|c7j?=#o<%pUX4n}ty5G1KIitNQX=L-T#oh<>QXj61(<i%+Yg(&QgbV#oP6
z|M{eO#V5^7lZKl+eA0xENVlEJ_i~d)<s15kl4_Wy?z?U^*Va%6UhCD@;yB%4u1#Yf
zpIPqc-qYKZcLUm#0q9D8PA>nUP2bNp>d1gG3H_)Xd}<882`O6$pJ-2wfx{p3^NDuW
z-&+k2t}SQ!6}k#{ARR9AW5WJ|_2##R&rygokoRtbeQMvlrv~vRpRzo1bes>uhxYF_
zeAKw#uRPHs%Ny1E1Im+qGxNON@H>LaAr#^FvcX;=02!(U3x%FBl|{8%Y_~^}0m9?_
zC;Ml#SQr=R{yDTkwA-rUa5$>&x#K2%g0{`fi)Wl2J}00_Dvu%gZH5<L{l6c)3W9i%
z&C7<D8va4A5@34__8Q_obvE>zr=Fh*vQtNq*l})PhIQYs2E)AR-H_`1ck(jZula`l
z9K@LiG*B@N(bYI&xxD7KGp1p}42pt4TZW|HHnhvgN0v(k?n`a4EbtbKo(I`!(hl>t
zqh}r@^ooBk(XPt()B-BtIHQBwiu5^^w*y?You*%Ic&(>i2&_{#8ti-7ILY*%w0bZi
z+h?{0#-i^$Yxu0(zdXMbl;?8rihKnB5I#*_uI=quVuNUlmZ#rIsj9Idi^)#JkM)r8
zG5DQq;-}z9zal;jzq3vJ8XT`R@jK1&hdAD4;u~=Mk%{whp`V&KU)S=VCeAqs-b0Z0
z0Dglez6r<8CcXv7ttS4MIc_({U*fp05a#RgJmIa8l=+m4s(Vv&7REx9UkE!KC}oDQ
zV+OC{(!BAS|88asLG38T@kE0UW936QMjxDaiZ%TS24`8=5XM(e{6g3<ovi0#*f9;M
zz*m=O{x+Xx=;>?)?l`9M33^7uj&V?dk2ic)89iAAYzV8neS4;l7a4kFTLo*`mkqAw
zJ#oe6aIMiN-_XlL*x_dL%n(+sm>+I?)bwj%*Xk+!@5cW0Q3h$juydRS#s8yBIeyDv
z(t=?pA}DpVz~q<rr3}{ojE7atV=O&{RV_@%cotSIb2|PbqtE#UPS=MuI6XXM>>Npl
z)mhj%%?G7iTZ-wI!%j3EFlS+BLI6G~0G|?oPtCx0ner+%^-I=-uyaNR{SIRvwqFdU
zxm5A6YSmOU?O)g_Pdn$yPmJBv!E-h2O!pv;^O}*{YwC+_iMkEGz@!)}QifG8BLGAz
z4E^T}{BdzP?938pIvPTeuzlNPu2}nAYy5D#!Hrr@wZWe@xU6Ym)mxbh;t+Pu5of7r
zSdZ9K0Ae|Y|EmVI^_{0-XO2NrhbK*b|85{#U$%n}+pC%ssT&LXqU3*pOJgH<8vg%n
zfP8xa$FN=n5{Tn0HS~uYf0HeK*tsx`mM2pT{gH+~o&Uud^aR4rr!w$-!-w0+7|?CG
zA&fOeZ`cF-u-wl!^s>haJC}LMour|kW$4q(r7na13r3$m8+z-{Bn&&&n^VbV82;z`
z>eHAaG_iLL|BDTMdVZTS=r<dByLL5PP=xi0pg?pq>|CCK5ePdi8Ti)>|I3X&_I~9u
zgJ0{(*J%b{WpLX+4mUVIP{v^U!52(BrslAKV<@e{8^&&Y+bu)BJ~)>f{0@V2{BA?o
zX|+-JIMvXrxlEwPx>uOrc5$Yo|1f&~#_+fO$O8s{-QecnoMZ5tOhaPZlU{@0=)ox^
z>~v(v)p#-hUmAcf55TVsz&T>g3}NTGOb|%exjq2z3BXqc;GYe^djs&k0K7i{zc~QE
zB>?|I0RF`Qocp&kL)iI`Ob|%exjg{?S^)m_0DNr#zAga&b^v~70KPr||6Tz8!vK6k
z0REEz{AU^XuTf9gulaEbJNIVL*MXkx{CTE+O%@bkhj&<+A?!Sq2?7Z_0|B@lJ)~a_
zJ6qBLa~5{C1>lbb;E!kE-!*pFo^geGKH-BBe<}cfE&zW%13w)dSwSe(n=LXF<In)+
zXHYxN1PrMB@a6#eIeGr{4H(!IglunM<~kwoMhx&qh3sfd&&5!Uest)5a_<BmKl~(g
z=mnwFC}5t+%M$oazVRIcsY4(1EC{7WH*c7Wr$I$O{-=#2eQMNjg`t0v{3T-(zx_ng
z&vLJ*byS?qragW1IW)kYh3NQ3hf@Bj=8eE-Jq8SZa;Kb3xyYOeYL5)!zYQptakxPk
z9ZLDRno9!xg#r4!8<5{0fPQpnz(~b2rY5!!1Bub0RDC?h;9F0io_3UB_SfLry#e`p
zH~^n_Jo%*Vf7=cJZ78bIp)uwRZ_6^V#F4~NI40a;j%SP}pNNGWwPyuqIk+V*2#s}d
zwGRYm4=cHLR>N^N8j4RuNRLD&Sp063qhEPl3Oo4Wo8g*%_(b3Zp<c`0QEMDHI~w*G
z9XiFuOHAx`<qxU*%7_`z)CTy&;sAUM82agRVt}9I1hgAx1mFt-_<TG7uMWT$2I&9x
zNwiz)ep&7LfQ^2OCZizqS=Vm=HnI6d#LHb=?cKoH{mOr)xj5LW(1G!7K`1reQ0q6i
zQXY`sk-7f%{JrwGnTBi1ud)L2yO?}XC%xg)0Qw|o{pji91tD8I9p_HNFgHN|rAp7Z
zD^~5xz*)26Gsnf%ehZv!RrXBXpVk>ad{ecPwzbB7c$1eks=d9?<)ijC;Ovr5P|u59
z+>ZBO9Pe+>O#$u3&qk9^>ONHMVF1_X0_dMm`AXe~-fuK02(a@)G(82O%UnJ0FtMWp
z>e0Iaa*qwL|EU4^69IgV2%x_$LOmC_dTunaSpoU_=CP!2bm{E~@2CL!w^cbdx%Bq_
z?=Jy*enr*OMK1mKOf0JK%QNt)%70p1-0p2`f*<*{S3g(f((cl$JpnkoBA`B2s`g>2
zORv`Van=R>M~715-r<I#puk`5;UA;jQuk|WT_0(Zs-L>X<*(N6ady3G=TrA<R~d@W
zAYTQc>s|WwCe{}w-s9rWnb@g0#8<ia_f2d)6fOw$xwz&3$zjC%U3`s+J)-o#*~Qg*
zH_nRD^%jJ_?BZ&j8E13hZ=*wxxwu+G!r8YJ|Jz+$ttsQ|xI@Y3Yc6hk^xvs`eci>?
z`Yz6H%_jZY4E)zBzw2Dw?%(_)=tqZatCrel{T7_W&riOo^xxp}QR|*K`xX3Tbm)gJ
zuGUs@RvX}Nud4CY11|kJCiXiFef;D;6i_c3F@889wB6-nnolQ+@$(6xUuNLXDSN`$
zCdADVY*c_b)Lkt;J*UF?0{;r)7XOsNkv)e$i`N>Qd{~+mZxr}f1rBvoAP<%%vZ;a{
znUK#n@Uwhk`m#fOt-ueIPelNq8iB79{H@<n?zaX0NkdQlS=X(ejRq(E4FYdBIO)-Z
zxb(J0d+BWrB0XH#rN0Al1~0uG&k|pUpVj9z5+e|o_CHOb8mA2{y(~w`XNjPfe5MGT
zx>-K91*6<G0%x4Ti~mN$3TLgfe5C$TpIeQ?lh1lVzfIuZ75E<nF6pyrU<C4!^mzjR
z9<Et^CJUTxr^U|*z{>?L?KTN%8F-n#Z}~|3OM5OSF#`3J<@I@mYMiZ*<@1!l?-Ka0
z1b(-`gY5ioLBCGWA1CZ7+lP|`zCqBJ3mi?RtLGenOZ!}8<kCJE!n^bf3{E@zNZ=g;
z|FOVt5V+L;I|e8J!v+0=f?k&IU;w@)0DoNIGG8SIr(6t?+<es;ocWUFenkNOVgPRE
z1H61bA?*B9q_uux=l7}4mju2_&~r>@>2DUeEcY)9T$cMzgOfjoLN1>p2_Sg&oFwpG
zT(@!`5V*9@uLAIQ1TOPC72^j6UY7ZtXK?Bx^Lv@VWqz9kF7vxq@R#}hwV;>!zbSB;
z-wUV+0uPe^l>*0*!L`p%1TOjiL*Vxa`tfEcz{~dve3roP6Zk~}zhB_30$(Tao&fwI
zfj=PV|19wT6nMdKoFGuokK$+jVT{08XDvQm;OrAEepvv%Sm1XE`mYK6VSzs=@J9r`
zH30vGzy}2Vp&SGtFkiAiI#b}XKl-u2CH-#%F6sX)aM^$D6*%u!tbI<%p*C6{S&pRv
z_{9R3{?I0H>7OeEJ_tEhZjZoad%HRS?-#giS7#~hb-kAT#rX!Oon?PfFL2pk$o5v+
z;a0&PLwHwz>dZj?Qh(N21~1OGg~5xnE-(<6`8rCW8kg;W9KT6BR|$H_r%2!%5x4fA
zCU9Br&J(z_LyN#A|A@guIP#vt@}F&R=IaiDFBSMEfp-gBwzr=ZxU|DJ1TO8sI?Ld-
zXGEdePiWf%(Q~t)?>2nM|6u4j&hV!_kHOFCSz~aoJueBs69M>2f&UlcmOsmaf&4#@
zpT&0~&ft~%PYo+v+Tk66%kr}OLdZwr<Hh*lL|n6Srwe?Gz^@dz?5}qSyhzZ$Byg$c
zE`dvZ<T(E%!Ka!9f<XPHp7jEkdM*~Y<bQVnK45Sj<oMxbK`-l(9Ov{RjkVh$VVod%
z^_(s6F}QB&=L`H~fv*twSb_gu;L^^o3S71iHAu@qeb(b=<+c+<ATIl_s}!nn*?;v5
zT(-BP1wMed<$s~TrQ8()mvVn9aLJ#290T=~`J$~DSUeH@tlT+>Gmu`Em%Xp?;*E+r
zlfFmb($60i_*TTN+~)+I=H~*Jekkwnq@FpVUPye5z@<KR-j4Z_a_zi6aVhsM!KVb*
zto{!e-0S~#Ke5+thlzS2{l8G)Ckp=K1TOWtAON@feR)~d#~%oKX`hV(m-;*<aH-F~
z1up&SRLEmse%Z%a`^+MUz+?w|oHH6Stla+-#yQe%RWt$u?IZ0*Ut;k3NsWdTz727k
zuNwp|`#Y8$1NlgQzD1!Lm;Uptz@<K%>tG<CNAa_ABZxD2^|bAYSMGRCuIQy)&RsB&
z{xSS4|KkZFc=?afu)<}&iUltDOSzAO#`2E|dg=di+$j0Wc3ASa`K3R9LhzU4cFA9k
z8-Fh7WqC>dw+TI^K62bB>3Pq~K)cC#s=q5#<98u$?ZD4WFpyrB`zZ?5^^|ql($6!v
zw_H9QfG-HZuNAm#ht~;Q=J&e-m-+pzz@J3i>iH3oFG*h}a9JN`1+?4kf?k&6X9Ui&
zvvR*6aLM03heW%{e*Bk$o_Vx<PNYL2c<nq};L>ha3j7yHXZfrVxYXw>0+)9Frog4$
zekbtlg8xUu)KcqNgrk*vvcT5~{L=z|Lg32{PBF5d`i`KN_J2s=(*BPL{6xWDj`!ra
z=nsNk`u|Z#%Ru`-g`dsW7=j4YGlHMRgX()bXc)*xj&rV4sK%xJZxXn)|5|}dJNz&J
ze^lVoPxc60@|W#^#LqMS=`EL~!f&NMHws*qi+#47c97*F*E^*BZw=7%Wr079xV8UV
z0)Ix}Ckp+e0-q%Gl=St2zEsf5{Pqa^hXH)#cu)HOM`%a{9@sZo{Xb!F+DH256oIc3
z^m796L;!w`z$Jh6tSR_<<$hMs%W{c;mVuWi;%D`rO%Q>6q(8|1ZWFFq`fkJ-NH6{W
zvkKL?^h4R-9RV84CupAJIKzi}P8Ret4DQu)j-a0+=r0!ZzZ7_*z@HO%hrpi~_%{VE
z`(O423|>3jtzm^rJJ|d(UuF1NJ8T#9Qw9F2z;_5--Z#ne{hFX>9kl$}r!Y`YNq@9L
zwLeHZ&oa2z&UFI+HR6{4<pP)faD~979X=y)=?~u$xYSdQ)6N8qm21o0t7om?BmG&<
zA4=S|ljI}IcfM#JBz?EQW&5l?x(OaE-!I{3^?Y2=OZz+{aA}{z$pC=|*`M0|Xx{vO
z($Eu^?RHRma*v>w`Q0RNncr6gF7tb0m|AA$H)?R|BlBA(aGBp$!AIuz>w;eDbC1Af
ze(|Lj6)1Nde%Aia3tY<myTDHr^i#+Hfd}b_qZO+2I}LHmzuMrWmwH|pfHwr-*9%<Q
znfDqD<S*^XzK?;p%-3+^S1dMZPrGl(tLF^ihti&N1upq75_maeSUap0xU}0W&@fP+
zJp3%Z9C!Ul;Pr?zP|qLZXX#~oBFmR;9RvBFji04wU&%l|vfpH07`!-b&fvu#(6GW~
zzD66Ia;M{G<sNK*ppP+7&vN{%+<OscATIsH_B+I7IsTQz2-IKtNuel5>CeRimwqDK
zNogP1ZqI}atLJ$Xia>oNf7xG4e1FyvWPSNh#a-u1w!@Da+-skw1TO7!sL8L_K2c!@
zsb`hIgX|;Q89Dxx>&0?hE%lM(Qb|9a3L-FH9BWxSPZhW<mtqnlc<s-z6N49@so@M<
zwqw%%-xT!H59N4C=Ib|x-fQQOu&1=M^iOH$p!V%v!-xE5;b-l$MevvR5q}i;Izj)M
zz-4>#7lBJVbM1z~D>umhgVxcm(QK6cUqsyMZ=dgFc}aUN7W&BX)z=07lHeofH)MI;
zE$AhGJ5NrzGQXT_Vqku&@UwbeL=eI2SDhNp!21Gl*^Wtncv;X(KeYRrsgG<2?7k!F
z^Hcn+p36mkr5)sWPugLtp(lUYe!e02NIgf85P@=~-^y_v^J4Xp^F>l0dH*Q&;XZQ)
z@|Wc<=aFQ29iymqd7X>6E7#!UBlWKr_@4y*5`jxS<vN$t^A<rb+e6v^N<HO$3j0>8
z=PbcT>KQcdS}f>!?_l{{EAVoGuM@b`XNJIek7oHuxw`}|$1T!6@_t$B{{_MSHNl5#
z<qY0(k^PsXrw$CHe;Pllr(Fl9yRa>?_|d{|hXii-xs#8)Uy${Jwz7OaC-}(x%6+ra
zAHE^zCH^OYOZ&)vaEp-pPeCu`z9VqS{}@qUBwi)(*9Cv>t7o7cBt4(&WFY=${Hz`9
zd#b(kzZCS6&oN<g$t>S91TOWtNZ`^xBZ`Zz*XJW{^_gvO>LcyBRN#LR^xXoN_LP1r
z^*_*go`~U3bIirh>dCf<!K-Jph86x-#4Ww-N2H!t3VNyM=LIg?$sY+^+Eb2WKPlv1
zAn2t%8E2sWf5*@2Dd#Pvo@WO5r|jRQp0a*PJ;zfhg4b?r>lld3{!xy%r9N{0MA}V`
zL+ArGUoyW3s*mh{54JvIXaofM8^>B!{~&*}?K$Z`CFn0joPqXy3qQ+eAwdMvlg8pL
z1QERS%QdX%=Ob?ErJW^zju{xp|I_$c`kM$Mc=_M1VMTu#;+Fn7gOgsi=f4rS^yi%c
z_`3p^el<(@v-GQKflI%#&t+1dI{d7jKNIxp1aA8U+Ch%H?7SKINd4t{9BpX%+kIB#
zL!Y<!xdaf%N6yFA30(U5Es9#x%Y5Bwa3-tA&+>mn(BCTXe+XRiFE%*&Gzfae8NB)Z
zo`x0vFT}0fmkmxnjRL2SF_4e+2f3gB2e@YWsP`QjdiuP@Z#L!S<-bmpqvUVz%P3d!
zm-oNx1b;bxmbe@bOMT?NeJS@5Du_V2(oZ%A;4cYW`uT2wOFw^0;L;y1G5s|!OZyKQ
zociz{+1hgs0R$e_;b-wB1}7iRjaWP>@FszOOYo6){;9wv|Gx@c+GoNrFh$^HY0sp<
z2XM{m^NHa&K_I=%*BJu;F0NVnDuGLVz9{gw1^sgZm-Md$;Clk_Q$~O(0_`c=lO}^x
z|2y!rdfp&#*`9nw;JJeShXVh;z~#RBe+&HH0DAjQf9fOKhYFlCQ2#~vSv`p{5MPL&
zoOh78?VoZ8B3Syz^r`!Nq{V-4@EPXlE#G?uz6Not&sKwz&*cI?RJ0G$Pwe~D$Un_b
z1iiH9LW7fkli=Sfa9LmGkr2VFzkUARtLGR|f2IDVqW-P}KbzkR1upGi_eGGuy#G3i
ziXeFPIo04^`Y#E3Dfb70Uh4UTz^6ct)$>^o{@>;~+>eQRE&Gvjf$vW{@EJk>j*xq+
zzy}0=hrlKM4-HN`Gz$9r1ijSfmjajed0XJJ-t85*^s8*qZb<wPfy?>`)l{IK&G^~%
zEn{X?zldLL{8H9C;`Y6IBN1n?d{!Fzd=0yJo$)i?BQRL{8w_5gVdYmGv)OY0vB60%
z{XvdTo)Ppf8+ztL;&R-wPSD$V2GUEr$$188x6y+CfZ%hg!Kr7Xz+W*q`OEe}&I8N#
zM9$AkedZXudi9j+UsBImLawaW%LKkZ^t`8Fpj^r4N`>ljl<nB{0#6`r%kkR=Cm$(y
zw!kI-&jjFi8k}~Pa#^Psh)cOoD^%+*<<1efl-n49Te)8SDT{%)<g-$tnfToTUx>K1
z&%*)uTLPE*AE?~>1Rp7Pv%$T7`%i&OJHI1vY3Cy0pHffqWuScq@U!`qeklDsi2e|y
zW$@~GqlOiK$!CGUWx0GU0GIchL!hyG9xn1F`Pg}TZ@J5Pdr99Hz~}P@XTCVcW##^d
z2e<94ybqQ9e-OamzPre4w^Ilp@F2@~qQGVO#sn_u&lk9)x6k$PawC2=U$+=~+D+Q|
zdBKNvI0iq4qs90{`c;X+nN0QzQ#`mGC!8(#$o|(pze7GUU)_R_%-0tMA8G&1f?kf7
z9{1qynsLi(f{)Z^kH80@leOESG#CO8tb-Q+n8B%kqrguTIPEzRKZeBum-Nd7F6kdK
zI1dB(S-HOuxYTE-z-7K(6S%b7n+EslZ(n^#T<UYwFaQYN@;X7_vb;34rtiYZzeGK;
ze25p3A%Yy|5YIBWt$#cv-eT~4#2GBU+~9JYL;4DX7b@x$eYe4_zgs>x89d^l|E}?m
zA`f0=@Ub3zslny=g!-Is@DdOGHw<q5#p+}CLzj8z|7P?&(}S-z<y!8+?Rb5r2VZ08
zV;=lbgU3DiaHHpi1}B;Ht7HIf+kdLvh@bW6`whJp|E=I7+p8mlA4$0r18_So_Uakb
zp8weJ@#=HGz&ST-^&jxy)?W{_o$oW{$%AYU<^86tUw0XL=1baVP~g%&j|SkjJtv>9
zihLoe0+VsfVCy647%c8re@TCck!S5;>E|0fUvWwCS!8fof5~U1!Dam=-fnPNe~Ew3
z;FlQw-g4&{jDcj0_}OyoAc#PmV{D7lh781IxqMln8kgl_{h4w{z&9)(u1PU?^%-yc
zhj@_vSKyi)50MY`A^ts{AjtNUc)vnZ@2|4-_P$QqpY)pyy|h2^6O4XA^}XAqBY$bn
zL4z}2>+!R8c-7!ud;Ue>(w?%u%lo(*VYlxK{+|@MwCAOUzt{eDebB4_PX)cy->!pr
z^?xZqfBFCe<x2gJ68Jh?v-XkedNN-Z3i_aY$@`1{+w*k^jfOzG-GQIA59=U<7w^@u
z!dZ5fe$e17uWo@qXK?cQioky-@C^b#*4UqX3Isk|l#A3;u7glFtB-t+Ow!*Lz~?T3
z|4i`NDfIc0z~z1+$$vT(NATM1If19yLEzF3#isxF+ToK1_wrvNaA}9@1TOWwQQ*?g
zwf4H*yACH$8i4W`s1NbCj9p}VNW9<RvOgkj*NtR*Nc@Y2UbctC?Q=e|KO+7$Lw^k7
z3|60GjU6KjP2t}$^hF;0hXx-TfS>BY?fT`n3{HFW;Aj2K&c_p%_N)^0xsYk;+XS8`
z@NR+U3*3(D$Y1i=D(I!$cLXlm)sL8blh1eYv-*q{_&R~x=ebBP+sP!(8N7UUXjtJ=
z?k<6k68YLAa4C13&_~KO#jN;CT#h$nJ-ycOXFA!Q+$rSBdhvk3Wj*?nz@?pSKSet{
zji0sW8-iZW)7t)s`a}i&sUp9U{$hiZ{&RwUiJ+H$D9789&ntp{o#1mQ86)tp8b7Q5
z2?qC;d$GXR3Hr(a+>S%ZN75$+y)4HS0r<57m-asid>P1J=9gv7;4PPkLieBkEI}{*
z`O^ZI^{7+eGGAN+VxT^2@UwQlh9H6$m-`u5XD$70nq1KjAZ~FxJ|!R4eT)AZaR%bj
zKI+4V2AB4f`@Lm;<$iCO-;)CT%HB^<uH+-{r(`=I-{U9sd`*=5I`FdjIzsec(#{_b
zz>gES%&%;RWjoLfSq#*lV`D3qV*>`N#d{Nr)8-7Mm;HNK*hlv7cE1_<$abkt&`W*f
z^Ru#DlKVepzAmFO2;`rKpVf0QK?LggBm69G+ezX-7WgW}8OTSrS6@`9<|FB;GXwd^
zcIh64YP>+$Q?{S$Kx6fJ*U(e$7X<!MVINuUa=u#fDG~G%uL!`;6S(9*F94VCy^;2}
z;~XZleK)gY$1}vgNx+1NITE+`poAj)hd?{<nhj@~2yx@u3TYHL%fN;kO@#ErEQsTM
z0zX9HzZLkQ0v~IXAfLkozDVG?0>4$@)+W6CvcT=wkGP!A|0n?y&ZIyD9*$Ho{m;&4
z5dWCKzbfcIF7WLFKU(1V#)!OptiWpoew@H>75MQ2e^%fp2>c%cKT+TjQ%ICsB=ESv
zZ6C+Wb{>)RV+8$!g8pQIzbf#t0xvO6KtAIH-Y)P{1U?|}(*(Xl;Kc%u4A&>*Un1~}
z1wKLGHwt``z_$r}s=#*({B(gIGeVzG?im7~FYvPjeyhOC1#Z6sKt2@$-y`T}2)ryu
zpOC&%;OzpRE$|Hjj|tp<QkQ(r5jel|!azK(V)|d5z~=~jgTQM9{<6R?5O|@f<m5k3
z;1>)0LV@2V@QVb#L*N$+JYpIP@~;#4#R6X-@bv;;DDVdb-YoEu=7y8}7Yn>x;4K1Q
zDexr%Un}rdfj=m4J7(bJodRzc^!&aC1NFH=#q__Jz&iwfwZJ<Cew)DUJr^(kRN!5L
zKHD_Dl)Fse^90WMMjLJu_*E9fai_qq7Wh8|ZpW^?d?p7O2$XBb5<FiiaNfV$@T|bE
zw;+zM3j79v=bO%h{CfmmBk+|1|Ej=O3H()oe@5W%2>i1GFBzpzD7RPObpr1b_|*cx
zQQ+$Z-Y@W%1%8vjOA7P}<=!mts|CJB;A;eai@<jX{PO}Y`iMRu|62v_6n7+A>Wh<!
z<;mjOPtBQ|EREL2tESJWsj01)UR67%qPlW!O~s7LiM6#&ozaq}=9Wa~iq2$W$>hdF
zvc9<`T3S0he%|zocx~;R+Gun_Q(MQ9`ebcqvZJ|mVP(y^4Oe<3oclpVlvZ|hv~|Sl
zTN_&v9aT#!CwC;;+d7h!7o0n1Zf&$A!K<|mZH<Zl0qJw*Mr$Xw*C!WM{;#UBAYJ-I
z*r4HmG513LlEjjR_7%>;L^9F3)T#YcV@r)X)Z>uuc?aMZ%Hq+<wY42>ZOPik=8i-|
zvaMr9B{>IsaCDM(+}eivWMbid&`(~NXiao9H^>C(I`6+LL)%$y)tS-K*06X&Yuhqt
zoX+rojWEd=fj(H<QJ=|i|5a30Eo)9DI_hD~XtcJrxwWAqu_V!&q@D-fLZmkhliTY%
zIujkyk{YO5qvBK31ia67C{yjmgpb+>VA<&8R4Z4jnv;pk7S+=Ta4+zQPUz@rO*St{
zq+k4iB?)_@4NkOnHn+8YV858OAhEDHlg<7+!#>My$r4w|j<&}7Wc`8l9tXnTdfovP
zp>hf|5bUU2J>M^%=;W5f^5%y6mX;N@t?b@fT$ZV<AE<J^Oy9Hlnu_c!s_#fN)-Frb
zFGddsCyb(7M!iYYcP13-D)zqfI-#}}6%}<J2Xt#6N&|%fMzVQn!k^;-_~azFsjr2C
z9V_5OwT*2sKvPGeGo@>)P(FO#@7t~=7(bx{Xsut8_~1rGTcNr>!%a6!`#W%pmZi+-
zw)QCY#smzBUu%QX@crg=LZY=XBZmi25E+f{%u=v>&zezcI(F4o?~^=ZB%9gZ&y0S!
zIVj0scc9J1RJU)KK4ociN(sUT=2>PPGMME7l$(!N%`6S%48~=(waG;tZOdvG)Hl}F
zcXZUFbxka*MIBj~T;wJ+BM+y30mk@FaYNe@4oIAq&SZVkX;S~Y*cZ2U;=HT1rMY!6
zFElJ#!d}TKCXnbjt*t$YezntKf~8HJPI0^#w<u0iV_Q4?wYkGtvY7uH7ODR&ZJh~5
zIuiAbJQgqPXzOZsIGA11?x3UY=xA+om=p{<pfUWjb=i{r7$l*R)-LJlz+Y)CZ&R9+
zD;CvvE~;7*Uov@OWo1JPhV4tiX#WO7(b5I=ofx3%yRE7Q-T*}#&`H!LJL;R0omCB$
zmB6N=>uSTOx2=OfWpqkyZGC5F^TJj&;^=5ahlU%qCHtsk??=?+`gYpavPXM$5QI!Y
z>!0XYny5U;c4OH=RP&Vyw3SWuT`ftBkeidPt3p0U9Q6(8oEI&wZNlBL)45^^Jy3a)
ziWIlDB@@N7=X~-sMY+Evy&sKM6m2*LzPP!mRm0V03T<I8{=S9y-{Y61-Q(9bFKJi)
zQ$q!o*4MT)cP49-^$R^x51_^K7n^?HFYdgfQ9T2oHSwJW$k1(RXKOoVD3VPM4b;%q
z+Qizuq-|*eR#S(jBu4qXRdgEI9PmF17B{kNZA{)0i)x!X(4!*_yJDvkzRpI~!GI*e
zo8E?HjixPnPron4=s>rHvL~x-My>Q%F|a{?e@(%RR0~}-v$c}-^gR`Qe^RElcXcj8
zGvBbd68S-6m8@TY<BBEfxPMJuMg{P9l8Lim{+Wr+hK}ZT-o=*L8qtjVV>bR>omJ;F
zUyfFA?!?*}%oy4En+v>?M>E^!)gD~qo5s;?KdNAT-Co0+7PKU4o13aG?(8T<bKTro
z+tA*Qh8tCHS$#)itsS^k&8w}foV2vQr7KZ+!Q4r;l@pUI+7p#?D{Aq#zv{QQq;%NN
zK7`$h#~J3;&MT>%7ll6O&7JzcExzX5xsz)Tf-Be0#XKYIyuYU1Pq(#h%ErUEX=R2-
zvSoAK_1uZ{<{Ef0RM9u!#qrK%&B=yE#i&*-i37VI_pePKP_6ejvD~=S^+q+PYqPAg
z`u=z(uK4hI>RCt(KH6LA8!#8-PTs&lO1%zp0KK2)Tb7!0U<1kfXL_E?ICYczp|iGk
zet~^WhEpq*8!wbL)|$SbnW2oC(y3_uFp*Q=xT5ksYjlQMes{VvO4FRG#@p<(ibbbj
z(68r|Yt4;ArCZD1>rOO716`I=+tr;lr*1kEm|fvWoDAv9YU&IzRASWFc^3xHUuQ7S
zyl=Hk54;4UCA<y6@J)3jqM<Qrrrd4+y<%TH4_r(CR;skUt+RP~t-j||r8}WE>KO<C
zRt;uGqiXW^Vd*l-=wb(tLF%*|Y(*wEw6(8LQ%+`BJZG+tRnU_ibVWQPvWaH8F0h+(
zYubn3pLv`jx<9(SzYZsTemgoz-&EA%MqC$1b6RKaZG_&pQ}Pzf+@f+Qk=E2L$!P1|
zzZlHjn1Qw1Ql`n`;QGVM6sCC-S9CR_apGE(wA_a(rxXhY-dxq18~B4Kl~eett{!|z
zsr(&$St$>}bW|fI1zHy$JR3roz5_paBI2xCSZt_Y(An0~l}xW%H5lz=`uhQm6#T|2
z>1(i=0`_y3Fk|3AKS1x`HI^Fslqz4eqn-~>CiCKUN&mBwQE=^vjwQ{Q^28Kynrvoy
z5-)b*h86?AQpVje--nlbP90(?vOTp~K`(}VcoI}I($$e#x%&`V!+=eloP$6PlId>q
zAxcTL82)|AhbRg&DsHQ!7gE!_;zN|gHE2Br?2dQD;QGT81mo%1t%H;i&QN;##^ywN
zUHb4c!*$)%faxIRC<>EtAsvhQ4fU;Utz6(gSfbeW9c&qB<+)sC-R)pyg`*YO%*fH$
zhv)&Yn4Sy6YRf^&iW)R<s{bJIkD|)>j}|_>kue&wmU=9=EbG98a4lCR4pL?ysIwi@
zTnC9gmn7dSBe2-y1}ql0wna<S&a3t|EZ$V9K09N+2wnN4+Oozj%(I}wuWCi&Nh)3y
zZ;4jo$JKKcunfSkFTXv28Mc5Kipu@nvg)}d`;a9sN#7@$wpsSzO7`qf{U4M}A5qhA
z@3lqu;AY;lM_F%=J-8x0_WqzEl>xB<4cjlcJ4~(qOpzM`YL_-Amicc$sI;?^sX4?0
zaO)2$S?%*EE}d$2d=y9Bm>Zc;W-peyv8Wq!BNL{$WNs|##@xun$(C$_8!JW3<i4RZ
z8Fleg%!MXSa+ABUQa2WLV{T-^M4O=0jYZwqL~KcDY+jmdo?xjay0HmvtkjJ~-Pi=A
z<PH~X<}Wo-MD)Iy;)!l-f*UJ!V^KHeMkYpW(g|*?)Qv?`G1pL7CXN;ppHWjawYEe@
z%G_9~8;iQJDVA))WE(3hQ86w$7f&P;6`SD3O5IqrL_QVqzT;Qm`HQem>X><8b!0UC
zqIoRR1=r#EB4XxoHy1B=W9bp|xStD7gz)!DzsRN35%U;~i;hQn@+@}|9VvTAAD0{a
zcQ`Vi=CL;SIoD6)c`!fu8%(;mIog9)KA%7HlfS{px6jT|J|9K&%0C{@i}}e{An4_@
zZq&gm|0tyQlfTEvuVW$v%IBkjUiqu=Jd>aNI)Vsq=!5&;E594*{p4T#uuihWq@;X4
z+UJ#j@;HC_HGJ>~;R=0l|9j<+MtVQ_C6DMN(*7`2hWvj<{N>x{aAz7ltO8#7yOG{c
z{&FL~%-E6n=Oc06{6|mrmme|DtzKZ#2gyGb>HXwy7|<yqLOvf|^U7Z|UduO+VOcRw
zx2e!OT|`H0{_U~%RDb>J=xhkT&<FRwO=p3XNbjfr_CZY{{f9bw^&dRJUw(-pyu~Ik
z0=@DdM0!8@>o@8I7n^cm`5oaS|L9Zv<!?8FOf@jlGwbh>Nbe`#*`|}o{PVeTo1H?#
zapY<K^4E;g1l5Ml9=!P<f%JazcNqCGlaTqROt1Voc(|M{=57CX8u{%ey*+s4S0TNh
z{K%s^MV(1V`A6aBm49D={2JrXrWg&EO#A;NKz_H8zh1~c#z%fp#6SNL^Zeqz<R6dp
ze)%8!m=-MMALk=~(rADAyN&$UJ)OJP{v}B7Cx5$<Z`(oIAF5{9|0FbOrl@f>70TA>
zIEDu*F#Ub_Q5J(e*21Zk|AaJd|L-&}OSr`X=IGV`Q%J9PdD5?aLMNy*=_vn1{Jj1X
zr2kAG{qIG3tG7LFM5p4Xf48Zi4;lIP;MM;jr1#U`zSwNJNl5+2;OEsp1gG$;f92+-
z5_>&%@yh@2W3~KpBgY<=KdECEoAi`F7C*22Ap6z$*l!T&t=;VLqi_&E`<1h@A(ZHY
z``@d7KGOTyZ~Jzg#1w-X|DdVO&_56TkDvY8jr@JJ--jYS<(F%5?*CVf{2d0N{m|5A
z$iEJtpZpS(3q!R&xc|NRzY^*F<PSWhlf+C)%12k9A^$UIC;jAi8~Ij$!zN?=c|Fqm
z$<KLOr&wbWQhpRaum4<$M%_<-9UD7@N_}wud-LCg^nUVhGxF<9O3I&rpI82Hykx~s
z{stp|rb%xPUin!_?<aqck9@v2#4G>i0QnC3C5EN?;Qsf@|6G9li=WX+>P$-Je+qtH
z`Ckkee|8)B5gJDXulzLu<InqyeCt1y&-bHv<^SU(fBUbEXrZs{qyPE~()-ze&9gea
zy}70QGw}1u4{E>W`?O!%k)E;`?C~c7{nwfzO$YVTg4cd`1@vEQp4Z7_`!x-aSN{tk
z$IpKUjQpSPqx{YXT{ifZYjN)X^+vvZZxZcC8n1l5=g&|68g^C)_I=j+EOY!t{(kcF
zf2C8{_n}h$bo{*Xcc7m7$&cW^kYS@fxc|NOe+KFO<gfp=PO{#lr2LuqdF6i*g9<<S
zyN&$4CcQm)<*z|{KlwGk(JAEp<18Qfe*)$!{}VdBsfPLl|Gn~G1m-7y^>1~O5|fho
zkKyOd|2qNg$98tM2zTm(``;`7t)TY9$d~p%2VA`J+XKqK8~rlF8O)prUipgy%D;{o
zMpzxvN1n#<^U7}+>u>)7V>tW1OU)(I{+A)WpZ#BbL8p-AKgUP@7hz|=@^3HI=^wU&
z&C#3xHAwF#KSIYqknML3&b|2`Eb^CM!p;_<j>?JPmH!~p`^n#9<VQ?;+W!Llyz+Mk
z)W0<owNU#WWUGQ#{!l>uEBu2_A={sMKJq_@dQKIGTLI>{eX@@HeINN>h4g;;-|(_d
zFWcV>0eSO37xmm%ewj}H@IK_vL3%&=g=|<5cI$&0KVOWvSN`3j{pGJYT_?2PEih~{
z+Mn+sy`TJ?S9FREMt_$7r||R2-#XS`e#u!n{r&pj{`Z#uMx^(Xf8VP*$$FEL^5^51
zW6o{ATtCKN{%#}x4nuDbUitHp-cNqrE}deHNl5vZ;pdfKbgaMpwbOLMOT&hNIe6tC
zkMw@>cN_U@Mf+C=9$xvMkNC@1oi*q;;wOVwet*PY{+icyDrx@(fV}c=56J)a={o(-
z^uhh_mH(xH{FnV%Cz0|S0eR*BBcT4TnW59)w2%7tmw@`e(?@=jkNjH$#?O&TE&qG^
z;QsgK|K@=4^J+8kzs98e9gd6e^XC7Q0QuYZQ~sC$`GtScf~EY+edJF-`|a2Mb<fi2
z8;$?!v&{at80r1|f4z|}=RaC}<nukDe)4z6w8TADusM3|{{j;G$#?#y6V#b>w0|pp
zUi)uB`{66UN+%o`VHlW$SN>p7`(xxss2l?2x8vuP|MD<@`5Vq>D#y8<%8B5W{{qtc
z<-hw)oyfMcl;44$SN`<jTE3^4o%mdx-Yd^!M_<JMvyk3T{%uBnouQ=sBz|7`uNnC`
zq=h;o|8UO*uRebakiW;~-?ZP9zZ5^O{IgKLG_g1T?U!hEto`(v&Z~{{Scdd|`Okk_
zQ>`(?l)oH5ulx}o^DqB3M!tRTv0;<Z|A&y?PySjXf4z`@rH}le`}albbi$D${kw?U
z^0&v<!;JnO18(481L2~5_-`}PD_)-Tv489IQvYiJdF^-AA^!Hu=U@ZjDt&POd;MoA
z()-zOw~=3BQnLK6!_O<f8+!Y-A8U+!tG`viEB`8__mdxaN2j3AFi`&W_<7~8f`9wT
zFaI=CInHzX;Qsf@??!q*`M3GV?*SLD{4oIh<VQHzLioNuxc|NKPe6J<`T75?lf+C)
z=6@A_Uir_N`s-;Xob5)wDMrI3v;TT3p#ENL<V*X1)<=GEfd6f;)gs5zI3jrSKQ6%k
zwj25DO<Lx^7e8<Q*CFG6_IK)a!hQMw*8<wl<*e)oCHkQJuMcsr{PP0(uWloMjY)40
z-u#~v(0{Er@?%1NzmNRO0@}~~1v=q0@Rz|W|B`_AbGMP7L+3=G{cpz4oBw-_d{6V`
z)GTBw$Enc=_rGE1p8q&N{vPw8hMmTLD4%P2Uip8+`h{QluQl?yKS%~|{{M{he)Vrh
zwiYbqf5Auo<;7aQH~-Iau!#^+|5N|G`A;CdpZxoVYxx5vDf9nD{Ji;p_T&Efw=apF
zpxGEMnf3n{Nbe_qx%uGOfJsUDU&hZXf6P(-`Jc$aF2cUX4<{hKpZu~Mt@s+vM)}`=
zAnuj_wSf9pW8~ZK7Z^4f<A>V<>fbgae?Z8;-A8`mq5k&YutX<B_R@ma|DF%%zqXt7
zpV~+HJsr@0tv*C2++n1%{JxH#*M2v__@wmqA0=%%;lAYeBE4Vv)g78Cf31)F<xt2^
z{+f0zf6YGXZzt0G$uB!h%g;9zllfogBmZe5-&=np9IPXh=!5&8vSfH7Kz_`8<RYTg
zQ2zUEBm}t%wq68{Ka*4z!O~NIvb6H;@dZSb{X7|{G5Q~&xTOAh{g36Y(x*sNtlgx4
z$%A{-Gc9!~_s}ikN4yZM{iy$X{A_+~{$I=UmtSXI`u;eXh~Sm~N2K?Yf18oN+@z&^
z&SiMz2igB>V}CjR=l9C2-R<$2Tz~tQ@Ma4kq0OLA@ZYQdlSr?4dCD)JA5BB3Q~!1U
z`$NR{SO3*M`je&A+a7N}++Y8-%e3Ir_M!imkls)KcB8+v|Aqt5|5hLUIhM70+hZFF
zh$;^E*l)WL>}}V)_P-qI{q%p;=x_a${__(b{m=TSzyIzu@?S$58NBk#ke>3(B@yFv
zHUw$EpW)nF{)>RA{F7LO?JM-j4IaCA<u`!LPyTWvzuS~Q^M5aXUim@wXRS~9@w-U2
z-0bnCkNB5g-PKzEbM(Re@74czNUwN#^0|i}-$Ib(_W;iKSN|XQ=>KD+w|d)SJsMbL
ze~<hP`>FqYr1#T5pT<HcQU7)Qe+cpY)&D*p{eOh?R&RT}W0b%C&NW)FX$FiIneEp%
zk={@La-)BpNlE`1z;A!`-|VA5+i$D4Jr<yV{p{au^dF|ph?F{b{pWC`_tSr^(SN;3
zNBuY9x4-&t_tF0@q_=w8<B0+Ozvfykc=SHTKgR|5f6ROcbGK%r#vfaJ^dAdFl>H2y
zJq%p0W9#=}zo7d6Ta$llFWQf{6gJ=XSRK&+wD)NF-?M~9F>m=59^<cnWVKGPav%DC
z1nDWF-0-)DGV{Uc9R{HO9E;fe*mk833Q>f&pV`343IzN8UVWBXe=bFOKl%CQLvY<j
zf69LXKd<~C`@igCf3mdZw8#0T{)9qSLw!7)lN|^i^JSdhQle=}HM#pg*Q8(L;cNNX
z<8|i#)#K*Q+J4PytjkeHZ2m2LWx)OGnj^J@m?5P7p2p9nx8)aPzt?^2N0!!Z_BhVy
z@3r4Hqrc6k)z^Ez$&4R7W^x`i>FxM4DE$|V|9jK#FzM@TLUXkFx9|%bKgIX*Zm-*7
zJeJ)g&r)%({&$)27u+B%*!15>LsR}_`LvtyzlY3uem~`(sr#??jQpGQb!Z=D@aBJt
z>A%V)5#l?H|Jd)F(SLq}pG|N5XGKBg+6h_hG5%9-CIFb<+kDbD;ibELY`eatxNUqS
z5-GvY1|8S`Cr_NH;L_-%QhmMd(CaGWvqD+clC<r#jQUAk)>~&qyqp03=YevUil_d~
zjrIQfRi4IrU%1qJF+~;}t7vWPXlrhajE$B|np9d+T6Ss#56vbTBW<mbj)`Scrc9jD
zI4;uAQs25TvNX}b_tQk8Q;JK9OCw_!C6n!)r;i_x?;Mdw@xr#Yh4}VTTUSRzg0Ddz
zpKNPu!MnbjTgSJwEM0P1dq>;lcxPdxacWc9)TW7z(aDo1PiUM}5-m+kYABgHaq6U|
z2@58aBpMPE8cQckE*+<zzoGJ3S6<*`VSsz|$PqbfU_La#4yus~cDj`1Yke9;jF05y
z=J$l+xwiZjvCqG--7xC87Eb#rrM`GJ4h5l9%V%XrfKw-L_%VQjkfqY!RV58Qz|M2<
z+=f}WFe-!zeiO!;BlF<LzZ1BhKGwtNM*P`tm|9J|crIudh_hd`^j0SMrE;AbqZ7A0
z5p^Q`hd^A~JwgzHb)MI3m}nxz`E!H&9VULx2A>vaNT}E2i_hFhSbb4pKi@SK#Z%#p
zwYC!DttTxl`}`n-Uz!8>0E1t0^>GBg(=qkM0PmLo{9nZGzR}zNHP!q7woV_dDqZ`3
zz(^4aS^A4*H`ahFq!Zwx=hXR=!MtO%a?8kbq~FRg6({5wlwSHQ(^)@foPmBxp5^$-
zV888Z`x4e0X36@x#eV?IPkxPIrrIYH=fNxgPGElWyG<o2F=;8EdGX4h3gMLRErUfS
z-B@$92b<oWPefur`5TP<m?5NmwpKR1&Hq1v`HfN5m~`F)b(P_DoDj45wAXC<eT`9g
z59#Ge9^?H$;9mGBojzlXQep^g{;gg%|MuLD+siFrj(dE{55utx`<)6ohBS@CawC7Y
zL3!%ue@$J<u8xErpK$E4?=ec*WIbBh|1rwgij->QDq8NG4@<`SRqfhjuX2pi^LF;K
z6}{VI{f85cHDq5O%i6Yg=OcAEdsRWbGxB3w!}Ywnbw<v`Jod*fjy<q2!gofkD30~k
z)a2zW&UvHC%Tv*kR5X%`=9}oQUx3pi5&V;4P9S@TIgZEv*m0?Jxi%eF&K{}pq&wfF
zWAP(hEcO6in4GNdTuk-$Tc@FEkI=8BLQ%uGSTin8DI|2WdCD8*Y=N13cU-zDP(zjt
zG^|K5dT%?CXL)(?&>cv(k5H3$k1B?h1Ia^7Szod#)_)e0sXVP3NWK#5Q|Gb%NrYql
zxM#9C7L-Ge0Ij%iZmj3^GI&X2tS|edv83;vSya-SEQ-W>=M{~O_a}>TV)z${_r7JU
z_Cmb(O%;7}W>HR7^3Yh{)kTH+ns&cfZ#XZ1W>F+>)QtQT-!s6sD<{^ox$M%4%Qh+c
z10GYy`bO-n%VB<WsJKYyAit{j-IOHc06NzeVqmVsRJ=K>J*z7o+nQa(WYvAw=Er(p
zQJ1P$?d_US(LJYqSXIxKa*;=MHN_Ij=XB*k`Fto}QLEKgG)9vH*XN=jeWp>LEXBO9
zOdVpqTdmD)p7u{Q+NWY3%eb(r_bsoH@-vO}>DX4}R9mSD*RL+hQ5saQdbz8js{h*j
zc<;LkppM!5v{`=FDA=s<(u(>1Ry$z*8s0;{*-}5H<bIkjSW9?U4Jt>xe_5gRjqY>X
zvtvD*%56aaM;3G77C!fY);~+UH4GJtER#irTToH5Ec3n@?d!9<V(W9dK+stphy4qi
znwpC9j$f%940N^t-ki~%o&3wtF+Drq>YdSU8IYS3>kC7>y)}h2Rz4HP`#M!&=9|KN
zv+I=Zt3fF%Z<<Gq?HYqzm1t*2cJoz304cHF-zy$gpgK{y@t?|X-)v^$q^jOGk!xh-
zgn0i|<xP3V&x9Vmd#xjD{j~s{hl=iNbDZSSRejSG(~2##a!ghf)!w>7)1*C;1yP#D
z)PFQq=`C1c+}Jk<7RmS6HwvZBxAx6>Py513`Nm4RBBWWVu<I;XDIzmr?ZPtXD=!53
zNZqWS5ict2%0;=jDfaG6Hy$!o<3Y6l{XNz@CEmZ(bwPSbsOzZRvAr{LdbWjh@k=Lk
zxy1U;j;-38EQoC#*o&|`mNz&%Cx%WUYm;h9m2<G*Oqd(%J3h8m-2+?y7D;EQq@hcZ
zmJW95-nz{6z5jk>IhZL8Vq42|$k+}&dUNtF8o&r5A3t;s<t1t~F{-=<$GWZM?TWTH
ze5pHpLGd4${>uO2ebdmaC#SID_MTlW>TU&HGt@PDch%n6v|L5+Y`5mHPtRziZ2cA8
znCe_$rB%O4E`SfYg#v%h>N?l9>G8g+()yTEG#kS_&4#j3nm^@q9f4xZ=wjUBH2pQb
zDqDLMw8>|gL7OsLMYZjF-EP{tWGWSUv;3~ZAqp+C>58?C8e{O`7pulBC74BnpnKbc
zC;x!U8||}hXJUQB>DR+hDavzVeP__^(f*~oeb;b$eNBE9h<o9}J4~f<9ggE=Gp>sD
zj)?VaE!W2Ezse49uF_2?-QTCZKaljcm?R&jPsjD$gfnkZB7(2-wKX*3n`4a;Oy}W^
z)rkl`%Mn?SNVG;86L^PNSA)LR+}06EwndWZY4`@<1gJ4Ph>x$Ep}k_PWhiF#Eo#WG
znRX=bo%Y01$ZLW;#m@?c1ibKbas5I&2v>}>h_<FQQtFt-wlk3|cFx1QwAC9pBlzT9
zM7@DKN$oMmS>GCITcBnu@xh`+ZCyzsBJ)a0F+S(m*`8=<Zfd4}>Yj^VUTlb{uaq2$
z%gtAGC2ILyw$o3?ryqG#vKUJ=YJdK}=Kuc>=8AKSu{n2KV&ZqPCs%XD;ZJ4d<{+l$
zH*3uGY94{kHP^=Cw8dPzj>qY_`4zc^GjnTt!Z(FNZMlUYo=)N#HLr7<p;b3ch;xpF
z^Fs{Yd1{Duwy7(rxhv}VTZ8rR2zk>fBr-F%q$m5P@Xevn<+%~4pe{geiOQSV4&vMt
zkfzI%rVMm5X$yq^;6E*AI?2Y)%q{O3cB2+{b?#UQhYD6+xx=*GCas#A2}*lIW?J44
zJ!sOF8o9^}M9`j1)|@I&FB`g744t(@jj_YMX?dzq^LT}3BBebojZUy6m5E5bjnBx9
zl!La$q}!a9j)u@?xF$_jd5bumo(l#nOZzOWnumm2(0A4wzGoV~sk|<>d9BQi==9GT
z+7n2NK)-#}V4O41ew$F9IU6e-^sSsQFF4L@{)5b(P^glNAk?SGT(kVBPnp5ykY1M?
zZLczUrL_qV`eCD?RZGP#ZORXq2qVxB$^SN!rq=LBewl!E<s6$~(o*-$h8A0Fl<rlz
zIhCxB<g;@>`7oa&v&q15Y(D8@5rf5e0lKH`9xAtbP=}bIQ@*I|*P_;tc&*V~JDoh#
zwWNEk+g$V3X}T=uqnU<rmOCd$7(W}oa{Trc{MM-M%OQ^nH>nyin=`+)s~FZzNpI;c
zF|<Vn=bR_Q@%rGLZSXpCUS*Dx4gOtoKHeNpGx!d3KHVI72)j}RsPIG50dp314hz85
z1Y*XuFjhzXLfH3BWz<KNQbv-ndgEUP4EiH8K_Fpww_5t;uzGV{I>xiGyK0$!E$nbA
zGCdq^?8&)&hKTyF|Ao`eQWwI`=+udbg`FaCmWqbe8^%)SHWqeHw$Zd>*cq30ZcoC_
zDK?sR3_GW$o!gVJ!<o*^5O#az^lM>9)y8xXXJOUCXTZQGXM&1;N&wCpni;~Xw))|$
zxtSp>>Z80GwhzZk5b>}x%Y!)1{b=Xpnl7rj3X@SK<XW;Cx8TZ>L(#UIKEaTx1GiBW
zgi`fOjbngaG*b5kl9uuBqWxmq=?zzs-iQC~P|S~hMgad6sG<d-RK32=2zm?o_2aVv
zpdZfa;HS^e&@_w+sa{WU9&7k_(mp0G4@Y7^RuD?HCw6>RiHIM4A@W-gO0_e#1&P9L
z1tC;c6YQGf_hGYwkfm~*9&>#ua6kTEL_$COumJjV0`MCH%7uGj3PP%9Rhp=AA!1zt
z<^I`#a-5v&uje3Ktss<YC)F4d{QnTZ=kLm%>{WI6hB>amu^?nN;UI2nKF22oA&!7_
zc*PvKAJ5NjdjsS?5?~)PDd5W$O=vgA+XMJq4@WErMJ&0q*~Fr%{*HEW>kr?7-3mfQ
zF0RIZI2#Fqg3uTjKf%N{DgLQ;IBIY{|6UMEwZqoq&wy)=3RSs$N=)pV%Fk2nv*o{B
z>3OP4Px~_b4SrP+D%L0X-)CaSq8=55ELX>=HF&Ag)0R?d&(3AaAM6f~6#X+wpH%y7
z^*I4mu^^OcpJRsqLeP&6rP^mJ>36ULiYz0v2H?LA@be4c52Hi2H1s%)OrIG+Jk`$I
zntZuxXJ)!`t)90Av@?GIy`P@T&=mUNyJ1g1{N8}}^DgBNneEss0seLc^5y4mUsZUf
zUlk}k(|@KZJhL3(Rw}@a)Ec(kO9XXX9IoN+F|y^4;!*F*wDi@QT=C#FTS6CmaO=Sh
z9^AGRtsWfJS%noI+{#^TaIZdh2zt1rgW^`<N9M@<61RK?4DRLgy1_}0qH{+`Z+UR5
zzj>@y*@5&{fAhGSi(9!LhyO5m<xVj;<)Y}^5$bdgZuwVxaLa!|0RL`5k1FNntIvbm
ze0|A-Te;u#;8reJszCkeV@K;#l}|=3{;<KR1B1nnHhirdi!U;`t#cN)9#1<m5dQ>z
zRv$YOAkJE2aoeML>5l~s1Nn`|&(e=2h(O*Y{~vpA10Pj&=8w-L0fJy=P}Hckjv8%J
z6=!&nq|kPTyxl7^VH66fZwZ7zs7TUe0&zizPSD(5$I`9ab*=r?ZvA!XzwXwy{-|1O
z10q4TD$@G0t!-J?YSK|l)dIC@{@>@k+&OdSPG*AGqU-r&a_@c4d0x&r&v`%RIrvF9
zg&}9BFH0Q3sZEgK=TKlcqEB_CgwG=&oL!!J4rbwJ;9Z87e2EUN-b*+e^WvM}B!h&{
z$2&QKQ|&F`mk|(-_*UX4(|tVw;V3-S>N32@1_r0NNH~=#aui;L%lgF5_iPrLho{<G
z(qS7C1f8G)Ux;^dL??uw41Way;RsG?DB=G=KsbU|<0s*p2na`THC|(tC(NjDI<<J0
z^i?_Q6!_Ijc*;{5euV;8<=?EpRr$Z9z*YG_p}^JjB-zMOe1rH&zKiirj^H|e626jv
za0FM=xt&2dT$OW+0$1hyCk6g~$f@SLn*PfazH0hktH9Ot?^fVyyuPNu)p&hffvfTI
zC~!6X&s5-QdQMZ|D&GqfxJqY<0;e`t=9d~TmCipZ;e$%}tqNQX|BM1}P{RLKfiF<t
z|D(XwbWrtBl~Yr~t9+LUcmbX#<0s>_S_yxt0v~Jo$bJRsv&vV^Ull%}@KxhQ@{uDt
zsy@j6Cc)MGqPm)#oiEj~<m_}*{h_)=ri1LiQ1}ZK_^Eg&M{-eLYchSnoz5SOzABIG
zvD@WQ>jyPnmnd{pxSGEzebQ}mL_dh1lz%ba$q`)Df3-eT)Bk!FIx~H4%mTkzfvfp-
zo&s0(S&q+09@0rEC*hJCO@1{U)cQx|i{S!uM5hKnNniF`2(Hq}M^4HMN#|(EIRP}u
z+4bi{4rb}F4DXV!><^OsEeiZxC45kUtM%J*1^#~Xr7}W}<W%`y%%B{u_J77HaJ64o
zqQKSg0*pC&mun?{GGFDB;6z6{+0P`nZ0pI-NB`gmF8i?bE&G`SZzF(kk|x1dNg$rG
zJ|XxQ6nId)6I|Ar1XAUceMN$+a?T}ya6a)QI@gGIdZ=`kDsYufs{;3lccLTvcmz`8
zEBj6a_t8H%(oe#XPR>*iyifx1TqNEJF6&GJbtrIIHVJg60+)3sf$mk{$BTD*{9J)c
z-5}6@1upAw0*Pa;On#YG1lL4lNX{t)5Kf+_CAe%;$ZJ3eFUuyuhZJ~fwh(KNL;#K+
zY&$ReLi#B1Qv{42w<~a&cLcvjfuBkM;ht0Aso6i5>lFnq+aN-jEHa6_WgS9rdB%j`
za?C~Wxk~tt6F|5&1%9Rk;(4b6_bKq*3j8bu{-OduTY-D2!hj=r&S7u-Uzq|gQ{Z6*
zF6%(@Zd2g0ZYOx30{;X7q!VYT@;w(dOKf0i!4{pB?VZ=vuC-kNx-f=I;=}s9>S(kn
zG*5482t{faMnl!LbT=;B8`IR)y^P)R-8!?Sz2m)6peweoU3yI`yEFQ|k(xde+kKkY
zo}4CJ78z?}*HE|itcv9y$Jt`nk-oO}XpnPCvUN+xBGAP=yCBbum8}$!rpxK9Tp+Nz
zedVea+J@BLnRZ+*Tjo`^w69sdicYj5i8@y;UADS4;KzojRV%J*!r?ehIcwg}y0#mq
z*e>RqoAL@flQuu)pYRSTRb^#o{$!N=I}&s!DVmyEds<r%{Ueeh;77LM93mam$smyZ
z`q}9-aPPRa)2zJ{2N-#Aow;Ty?$(xSkS(+QOfPUt?(){z*S2<bVe=d@r-O*opg>u(
z*&+Uci*fzxnx=nf?QC!AYQvqo%Q^S#G;lqyD0@(WrK_9htYR)4x))f9W$vSzxc;3>
zgGhF-iH+%K=yWw@Q>@a;)R+inR*W1yXL>8@nkPnJhKRORFXV}ssz}BXHATSc={Yiy
z*AX>zVwUMxV1{*|x2Yr6nexb{wdwg{(a9Fvp+?KeLy1q$untL`OC}|ea|Kl-siv@b
zw%=JRh8lL%xU+Tj(maZJdP<K4(?Qi!XPlQVYwuJ}I^&w|o~3AtsR?#v9D8OrAVX8o
zn9aua-?q;7b*O2@32*?@wI|>7aj3zjS5iY_k+$~@j+m8_gYOp$huA<X)!5V?4e|4!
zxw5mpy92qkX5F>8gd6*!TdrwpX}hLr#nM%)UG^jFypNKt+}i5;=`)tMu2|Z=8d=2K
z0NGEeU1iJkBWNzI)=$#P=kE8cWlW(qrYHvdtzYb3g`R2anpo{+^BWd60U{#1yw!>)
zJJjEF`DpEPX79b0dJ3*-%euPIvez#@5@cRZS9UM$T#jz|>Q-0=K^{}t<*=nKkiN53
z<c4LL02jJ<wKuiFF39RuSBGfw(c2Mw<y&|wkVOlo`&lmmWxngWu2}1}Jo9T;Md!D;
z>?RMKT9c&<k&p|U99tUHr_3*piZG)!<#Yp0BC`40S;(q1wPPj~NUNS}DUR7yKVU0P
zX}Y$GE88roY+?k!NM`TA&9XXh{G`WpRQjngn!Wyvk~(KL3o_a{`#`BS6FrQq#F!3b
z(ItgKAUg%#z~-N!?<G#@If!`Ki~Oi%!-gHm#Lly`;1GoX${h{g*(mff5-Xq_U(o^J
z-MHG?97^KQ`<j_I(X_5Ml84kZ>$Jmkm@2|h7rKbUM0!iZLO+Ct!J*EkSSQBPU3yC`
zQpn#_g<&iP9I^IJf<XRhtcx*iwtSf-UuMde8S-Vid<memwlgIGzrZv(+b<_u#{T>T
zCI`ioQ5y2@i}+`=I*A96n3l7`-c-zC<1Gk(3EIBpr<f*^pRON)Inm695AtbFooghI
z{{TMG4AO_<f?{$_&iO^*NAZ;OB>V+TraJMb@Z{wFR{oWm7na|@0lpLeM!`Qw6K-%s
zkLKd-{HI~kmiUWccoR+l)VWXcv8P`J@SXVI?&EZN_=EAMwFx_ange!<zfbUw2z>dl
zr$5ni;_p3+V;m5O6o1-pW#`|8No6Pg9fJQRfiE9+{%e5m#9wYfSL09f<97aJ%)^QQ
z0l}a0Om%ktlMuj(f6v(*OX?ZLpVHdS{{#S>_{&16&Xp5IJOAT>@5FzL;O{3SIO0$9
z_jdm01KEkcPgDx_a%t!Pf00g3_<n&OC+3Q?<KG2*C;112{96Pr$xmrvm;Y(NocIq2
z{<jKz`LOff3lAs$(Q`P)fIuYvR2J?0e*&d;;vXfVaR0&|)_*(yZNPWp?=9mfTLmWZ
zr~LzV{;vYy#Q%Wc|4o4}A9nsjz<1(*zu^CzKqUU8%Xa=>0?dj37Ey4f3w-&o^WO{)
zC;nT`<rtbkB>uD>W9Lu)PW<-@{x1uB`LOe^hKCdX=LG)&fk^ymeaFuKtt|D|fG9W}
z0$)Dt{QsP#{<{4<j?pX-i9a<dcK+)Td8hdMsj`RL$sg8#JO8ync8dRD!C$REeV}6J
ze?H2Y6Mq>nSN(Aw@SXT~h(#o|{-i3w&i|WOtaRe<6#><?UP=Ue{O<t16aRj}Un3+q
zO8+wa?EJ?gf=>LSBH&qstT;RWp90wlzgOVfdw6#I`+@8v|6YgmBamJGxmn~N5CQ8I
z+3D5Je>U))_zwyGet{pwvjRUm|F5H*I>p~hodvkF_`~{d=iiw{|AGR)!NTM(cKmCz
z=wE3$58o{CNq*XAV3(iPg`MQzBKVsEUq0;oU(VA0^$7l31tRgEhM%4PDOvijKETN}
z@rU)_&i{lg{Z}7l7MxoC{rI-?CmV52@$VJ<?fq9f|4#tfNq=q^{D~*ID1OwI*!edi
zot^mKm1q1H0^f=MZio2Kbm0GZ7X6h+N6!L|>g@499i2ia`Tf*ch12-M`ftZyfq2@6
zXe?}0Y^IQVKPdf{;zw~MC!b5D{Ln+y^$PyE+V3lY&uH23gP-KoRQ;j7UH1ITCjXTV
z^0xwC$}OK^5M=3R<3AweSN8ysME3Nn2fma1_Y3*A5E2}vAGIa<%HQT7{|ewsx#jcm
z3C{A%4Ug34Rh?b_-N1K}Upt>;`2{k`|5^O(@?Q$&q4cxo^9e$6K2M&Clb`ar2kA`j
zs7BLV2Mu=MBtQO@`TZ#HN&cV=Af7!!ezpCd2R}(q!mkqL$Iib;@Yif~CB6hVBAgR{
zx}TohR{mi5UxRmvFZqv0IuXpye<08JZ_OgV#4i{8<wNq9-`~z6e<d|ma2kIw`Kc|J
z_)`99qW@}_e@MtL^+%Ag@a1<!mi}w6;NL6)lK$!V+4*k;z{y5yDf(qjPU@ZX`$xjZ
zhh0vIZy*0ieEIA{{VCriO?v(~PyQXqf8fjM3X8=30{?baI4!Uhe+jt;_)hw_U!<S3
zvq9<CfS*16ehqwE)yGKpi27$Y;zy3+NGff|hfSikl!eyZHd<%Rm@dq?=5M35UumF%
zkbz43@sMbtcEiXo@U`xe`ziZ`akP|;Kh4;q8N0NnUNa~EKsOHPhxY330j=sUS|a?z
zqOhlWm*%P76E+4Sn+LjoVNTSH-7v@&AKB%JFGi|p4~%QrUqpYJaacR_-<t7^w*9s7
z+Nxdqh*`zp1H?4U4Rs2ed^>bwxBk>nojLi&h_ORIv`=^M30FNC@zm{YNYva2rgb~Q
z##52a`?~iDW21V-VSW4If-pBKJI|bav*z9&dJx@WSG9TNSKii*|J1i9eXu-d><;YH
z4!xmOJ=ZmLcma&i5rBPrZVcj6^L+mit!lfcFE)vAKlYUfY?+;|qMb2Zif}L>*azyk
z*EEIiQt@X3Uytu7(Bp6UJ)76UEA-&Ep#YJ@9exUD><&+SPTM{th0+hb5r$AF4L|rU
z7b?U6o*Vx^eCtxG-$Il0#2ugF6f{BMI4NIpJQqigKXM$Xd2YNG$X1lT#gXUcMlN8;
zeieB+M`mec>>iDC5kr3C9fk8JIP$!FId4;u|A5{h;#`*-nRC8QMgDh=9L|kAo{2qI
zMeg9p4Y`qdf{kD!yOr8AIP#+0$ei;I75N~l2*kNDH!_d&W)=AXj(mA;WG=R*B5&Zx
zSLa6NoF}QspXJEQb0hOOKk-*3!3sF?7xG2^ii-Rwx?o7K)wz**oENFc{T#V7H!>Id
z6cu?sN2U^vVwk&N{OT<w&LteVCpR(|`x`3qQ>fn%=Z(3Mx!BDr@@)+H@*DG#`8*Z#
za*o-b1C#T7<u6KXeH?R34$NX!5`U;-zJw8up1AzB9GF}sdsNJOIOf-KVDjYsjEdRG
zG4IHM$$1v3n3Wv!&K#JW=bpn#3cZVN2;zBH4ouE-i;B6EV{XlX$<ubRiuomu`5!qj
zd47IO#iaRlNc+Pam|WTy4k__GnPc9c1C#UIs$xEmPBM5tm;;li?HU#HUpeN(IWW1j
zGgVAF7XY3+b6|35-#Vzoa~j9ol>?JYJD_5|i4G-r{yYaJ=XsNg`5?#KmltMO#q8yn
z&*Z@5DRhF0S;sM-%Yn(``P`qC6q?L2pU;8GdHx?2b02zBNTC;UVDc1Nu43NKF<;Dq
z$))|Iig`81{6h{*&hx;VN<8Tv6iEA84on`;Z7Sv;(8~nofgG4z+6^k^y&Ut+9GINv
zycA~aAHWahvPW&rIKRmXRt+%16Zf)CE$@=*hh9%kpe||X(Cb#8^uOL<9oilG4LjH%
z0KM(aFM$lV$*qqJ1P1i@VZZ0Lfd{CA9ro00*WA0rkYV^tgd8Hc;-Ero?2l@f*|R{`
zo2~QGkcWm~bQX!u|D1{6x%gG!cRqd>;WrDvIr!0ev1<J4@ze2JfZsy=K9Ap0{95r_
ziQhH&U5nor@!N!796tj;6Tg4L@1ODe27ceh@89tIcl>^Y-~Yq!XZUT$?@{~)@uP7U
z)PhY@(op~XmiIdFu*>{qz?|g%F5s%{Kf$+M{-*$QeL!u&(mEpj$UT6Os<4lFnK13j
z;Mx8;*<hrwPPP^~933B<3*cL|?Z#vPYyy5>TUh#(bC9I#^h39sxtqxoPL=@)Cp{x)
zhd;@|46f4of0PDrXqeM%*Z2qsM`1}<Eys3Fx@_CIGj?$2yV<;{X$=mZG<9^Y!qJs$
zGj<E}&1}}TQv2>txgTq^9e_ARRv%t4FBEQSYQW~O>0Q@iFBoUoMH><Mj;{PE%wC0^
zk}a*kJu2>cP(f!Q!}SPdn3R_Iw!8oqdDG9XX+gl89Obj>s6HGGU+SmCvFqr0@F1E&
z89+RTJp83ce3P0{JTcf~PR@ZQ@J0Md&(a)KjBo?&f9ju|Kk2m-zMR9&g-`oBoaR7#
z^PGbuF^Rt)Kh;V6Z>m7NQ&@8HdA0J+JjA~<Mf#~QdY5<--o;@VbD%zfUnv8Mr%Znd
zUV|5>{A(5oE%S-;53@NL`L`LcjJyM^QSje_cXA{*@sa!`-Bs;f>J(@m_f*Z8Ug;y3
z{~YKRWg#jE8Aw}OAd&MuRqogcH@r0h@i(C}!>{g1emd)YP3M4G>WU@hf~LXXnY4|6
zSMVGcyQm4_j`qDtu+#r1nCdsDYvyJAUJ&cn0Cs&vF8^Ul3dLpG{Z~BkD(<z|q|wC|
z(~LK8lMk*fNzEDSW?iLjHU#IHiynBJ-TW|bWYOWn`pA>rFY;S0GU?%7Al#ksEWbV>
zoLJ!x8!xebUf6h9UNVELk~mA^mW>~~js@4cSS&H=EN)id*Z!biNB1hkcljB8nJJ1$
zw4cLuz_WcE!5(qBK1UG_eU3yV%$6s@iB)dRtZ&n+9`)Qry(i6>T&B4P!c{}Mr|wbh
z0ns>n^s2|TpNfw&HP5^u&0OCYPRxCkD9dQkO%d1Wm}EDq8^dNxvtISe^;Po|MK5Xb
zf#Qh!P`K)F*i(P_l0?z(32lC2?n`0gb?wl;u=_2oVuu!g;jk9pQ5@jcU}?rRZMf#8
zELn_eb{M@#)hiKC{VQSPnr1yw^aQ_U;>yrfbic?|kC@fI_-?mR?b}>kh6_IiS)_@N
z(4pj$ESU%*ojpBvg%fS=@SN}WB7o<nJMmvLipn&zx=l$FbA87s>Ee_o8+e*@AWeGS
zYnptIWWzlrJXsjYRI>CSS$4gLWMS$7<uHE1ueH+51)63qiE4?ETdUgZxrsVyntPvC
zwL`-yMk*P!s@?iSQa!?+c`xYZ#>z_)Gg&@!?ZmRml#tori$CTL84bSB=7zHF%XNba
z*v24&{$G$5_uDuHor$2qh_NDy@~DwKy1BSAY|Pz*XVCcAm*B0*m}k97Ox!zVRVow0
z<~kI_gR!&um<>5yshRVsy#L_s0H#5Ii^6vR<^7577q!HCQO?Zu;`%Uiy|~8&Wr0VM
zbVIqdDp&mz4Gd`UP30~O5horn>V2E*%eo61`7LOa9GbDN96>f8L;!dX)|U}<u)eqe
zjhQxB&)OV3z0_IK67_y|5m0@lXG*<>Un72P`1RnTGgdV!`i}ZZ$E{K33N2i<GTL?i
zC5gFdnH9TIGak{mzgU23OJ-n9(~X_UakYUL1HVSDp?q&@>pD@}{&FD;p&O5)2IwA_
zJgYYFD*U1AKkJ2HT_;;XG#+FE3m<qjWY!hqvY=wz=~w3sK~k@t*yPs}Yk5lRW_?tj
zQ>S%(LN_<@G}nzLD9k3F?h#{U5LGm!s*iG^2J1C2#Cp|6%@vy)7|5t!8<4+~x9jGT
zO4M{asBSkW-+<4cG5JPqWB`;j;@J5#c(>uLxvLcHc<x4w_C~O4MxZu|;b48UVAkx4
zT?ileE@%wwOSK=GIdiXO%zO$Anza$E2QF#W=PYjSd|5Yd?j<?r)b(_o1_m7>0oyx3
zrbjoJFJsXoSoFAJ)12bdA>z|P@!>J(A+nwSqiudQR;(F+WTYeX5w<>Fqz{>|zmA=Z
zet|4Jyf$U(k`6-qA@0pWGl`5tzEQSOu4!hSPlJL&70XFpYLjrw56?x9x4IH}TUW`H
zv%1pbosUZ#r!+uAt5LgDH=^h^;_Avq!h~ltc{and8J->R?0{#7@a!Sa9(eYMat5hV
z&T8IpGoM#u?Rn~UCc0tDtS>ejij4)uMqM%5JqX@_a0~FO!+U)xzDx0qUtOtL??ZKE
zEbtk1KC`~eY$!7plo@qpVW=pz>$>rKB&clr*cEI_L;o5}cA4VHRjODjbpr}$R6~X9
zf>hDqJBV+l#rTFMqjEE<HTXyIjgCY^6yK=ykVNKuBvnHrzL^^08>-mQjPGXnqph6Z
zhVM3fx8b`3-$=cN4tz7M!Z$Rlp$FeRx_MJCl1(#Bdg#Wj?8}JLBb8$8cE%DUG_KAP
z&1|Y}LP%Hd0-syW0DKpz-{M-$U_VVtp#zdxAELJ$gXxlM)2<zoK+6z>kDciw8h;;0
z-6$Fp$o@VJC4Be=@$1Ep4F<9VxEJ1+;8z49DxJ~L$Zs@<J1>suOYY@9&C%|-FBTD`
zHq0;Huc9Zv-{lIrgoOOU!Y?BH<ef$2*Czbf@hFCOrFC~nUlu>gySs$nIPoM}_lb8l
zKgDQ;8Le`__X@vx^tA4X;rGe($opjAMSD8mrZ8|c4i#bfeM7hq#=39l>hwE<h(Fy=
zO)kYh%J`GKQQ;?t@ETyt1&s8H(u`eR<eOJgKCi?dDya<NQlAO8j8BZawdl)*Hx(2N
z63EZI5s2<N3egN<knQQZSI}Z}Gr4I!k&RX*M0s1#dK&Lp<NuTN_|siEWe8qLWeBc=
z{-xh%vs}H;rdfnbr4`RBO2-YtkIji9E}s(<p_Go&epi&}!!_e4ZFhZ!@N&kz@T3B#
z$k&zxYn<R9N%8U);vd{?^e;VLx5#(};U(`aV)mQ4o<VnzX-FWtrD^;v;}Yx=qr$M8
zav6CI-_)g56vqvMm(*>7ZE=9zEns3=gO#=W1<anVl%+J!I~~7V&S_5hFGW=M&9G1>
zT5ryC&3`(PhnL|f4W;|&-W{G2W4U*SFbZ8hj%fRT^zPT8nljTBGArOt@C!15fD|&z
zt(jig@7E#C%yfl{zNx<1@7JN)E7KJ+i?L2{T2ae%g{~_zfMj1@T_Y(LAxw<h)cbE(
z`v<?>fK$1(yX#S?y`p|o{aW#HLIJI~aL3w8yq*I_PIRV#h7%k&13S`Rg7WJW-jjv?
zjR>sX(<6>AyVjvxJJI<9DxoRLeHi5;9!bE}`*kFpm09@y0P%9V|7Kp6_>vt%r~7Z{
zY@ky*pFfGhPZ83gDi?3xVREuslR;S9kGJ2T0&|M*53<1jjp>Q(J%N{?{{n;4%szLr
zA5e$%oKmnvf?5BRKDIy=PAH((kUQ2#z-v>MbfY`qoaCf?<DB427=215?&O+Ifax=9
zd6@_61K^F?WT$&*E@Jt9xuC-P)b#OLv_npO7iN+F*9foPTO-r$`zS9b6r63*my%J<
zquyH+6(Lq;;d?#uOTAx&^%a2Am_;6Bm!tgi7@cy#P4oxwHG#oDX~E_F4RI>(7Buzp
zN4%a;kg7isjJa<x_=Vz&uYc0VBal<Q{|3p<+#QJT*#)WkQ>NSLSQwd7AgusnoG8No
zCW}0qk9U^y-7NLkr;tES@$xc#rd<r&LH(Hf4FsE_+-D=<l?=`Xmn@uw-^%3wjKJpO
zHu^XL1!szK|BVcP(`14NDF|~C{vd;gB-konmom64{VDqY%H*le2>&YMTay8QlgU||
z0Y3-nIi;X31O6)GTb}{HgwdC|l#=H@2G=vf(;oUM1(#&NM;Ls527D)jhcn=(GkIid
zlj8dys3)fsG-QOQ`+=quEXaVr$l$URrs!PG(&5sK@Hen{U6uiFWa+su1HPZpS(E|a
z&cc5#1AZ;b$Hf_NH`2kWT?;^&o!Y76S-k}2!pU;_KUwNS1ZNK3Y`#J6fjCLPNiWOr
zlkl??__+#PmLQ@-ILIdEq((`&q(foI5uDms377Q*!Ou|OvSqP{r!eG*-Y4*rbYzY9
zNx<k`!Y{%*IXit>^ANlOKN()ei|7+A37>~|a&~!SNuluP<0r#IeV8Noh4@LhOlP7q
z4L_M~YIuJh;i>*7NA#!TC+W-lx5HKXYz{#zrJPDc;3)iT{3M++0>TlTdaV+UW`sF=
zcnPO?Q5wqdSMcDB4%MO({#^x5wWx%@Cg4QpO#HBimbt&!;4(a$@PZ%7^I7~Pyh(&7
zxXSn66}Zax&jL<-efUYflD>pX`V&M3*!jwylAZ63g1#O8a|N!-|5O$@suSi&9%==o
z{)9M~r9%zgrJR>2aB2l4T-IPDj|!I~3p;#u7CNfF%~R-S(>GbJiM|@&utHx~=#(k&
z`3jtLk{r=d;j*V^hhNV^XNLch0w)<{`g~7;tNQ=20$0=RKeNE8A3~1gQNw>d3;bXf
zcp+stoSlvwL)hWxX9*wRWEdT_ysygwzfpm!>5#|*|0e}rgLj#p)?6ZB)H+MJ+8&*y
zz*Rk0;i|r=^?Wvc14-s6S*dlFeM0#pxNJKppwv%-%Q8Z6AN_+P_}T1@|C6``|C|D+
zI-DHAQ>}dZ{SdOQpm0I@2S?%0VQ>7ODyPgl@=@iSp@jE|ccRm%z*Rc)6u3%9w%z3I
z6JZMQBwEr@+d+=tGVka+O8?*pF7t@KWxYXgbk!}_FWv}_p`PXL7H<SEwxBN8{R&*R
zH3a&l0+%|&KtgDuGf9M@N2LOvtiTs3@KkRK^ZyE5>KLKjr@&<&hLIzNaP*LAPTzAC
zIJ$V2Tdu&-CA3_x0zc7$;(i4MK2?F=tH5O+gS@ATOd{`-mGJ7l4yP#aUM0NL4f4KC
zfy+Jv!M7^#)M(x1dPsqvP64Ik7K){{(q&7Rlezr%7BX_Ze04N$!_Adg!E1sg!`7Lr
z*5Cqw{1F4QGuHmdTy##mnij(uWGkJF(8E;kvQ@Dr7;J^n^fg_pmbZ4o-Yc`bJVuJJ
zIZG6g7^4v6W=jJzI$@t3JAc#fDoD3rIf{8xSd-6)zchlMFA*y#E{1tp<X!&ewo{lr
zEZ2cK>MmlNF;-@3eN=?$s`=ZoSZ22*J0hgnqzt%{Ag6#SHn|L%TOlplxiBtf_XD)%
zG{i2#jm1oQz)5Y!Vj|s&%@HA4Nsymy^lMwMMRCeBk<K>Q=V2AvsfMTxbmeCiIx8|a
z&@L=Xk78HaN~&2M>)Jb)*RHDN_J$?<yiix!P{(9%JiQ*sYDqRFXbX&7ch-JkY?hVt
zH&mWm0y25Oaup0;)6E{MS1*G(_1b9NS~6oht930i6OPwamT7QV+mErL%-di&ZsA$p
z-XyLH$s5a7+ohSF&Ti&h#wB+uNre&?w8wxb)X6n1cj>XTA~37#x-~6L>sH0uU~G8#
zs`lDtwSk!(ovmwEwRd;%3y;$5q93WP^c9`0tu8vD(%$02Mj!UfzmagTChcT2eXM1|
zA@*ZV_L*JlmUh%$2F)Ei>b31_TaOHNHeEus;##t-Pn<_fNzsyUBk%cz<;LW#7>&Vx
zxKk69-(e(6B`;pKYRyvI(UsQ`CJSpuTWil)QQEs>V??RyYHMHD(Y^{-8jPhkO7{s-
zm1os^UCem5sP)DcQP#|&2RcT{FK%sLF?OukE8E+tyE|59ypudetXZ9_R<@0m)y&nc
zE5?d5qrGLUC>M8Kv#MiVp6BW;rJT*xWvpm3mUeW!FE=3Mb12Xfe)_64W6Z!xl#ABR
zHA`2I5pOoE@yC{RuNWiR4BWCaMwF`Vj*iyO7K}*8h*(KENh4Xpqx**PuM@2VeGjOz
zZ!JlTrB`t6vTigobODQK3C2!DvPUzFW;e5!Giv)|#owZW3o9I{jJ5f;2=dDmngSWO
zCOBQ1ka1_iQHT#Gan#t4shkD^OP7D4yDPS0RqN{Il()GL{#scQ@UK|izVwJttEe;_
z3C~$8R`uXQy|D>8D~1`BmN6m){9P@pFs@j&V%1ntaX-^oQL2`;x36Bhx}$9=#N<~K
zWxwFV$^mqkdT{W%wWle^-6Ls}CMbw>jfr}p(tA<C_w6DOF`r2G7{yehoMB|o-t+k9
zM0JuBATe!gg`J0m6N0I8)8rYXe-4h;SyXo=kVnH;=dcM+ofD?-B|s*cLHbag*hnPj
zV3)y<;wkA#_+|+1#9z+GU!~H-yPbb8@SXUV3jWOkpZL?fzMVg<vpVs=SKvj&Q$Fnc
zX}!*ge~;jQKp+x-S|_mc-vEM6{2378X|I9m?EKdO;KaY}436a&$i$!49qjynkI8>0
z{yqZ2<>J2|_)h$9ci>O!7<T^OD{$r?6#Uh-7?Q^x|L*|biT`fFU+NjfpVmd}{Eq{&
zQ~c$50(DKpiT^m@JMrJ|5Pw={vGYF{iQ>e+L&Sd`F;$#B{&!``zX5^2M!}_5JO0<R
z<eyh$ysAHx7Iyi+1wKyl`;jl?a;4v$Kz2&Mpy03OA612R{?BLO9~J!7H7}CK9{*>v
z@R#=qsr+gE$<F^vDAZ2zZx;OJzEa{%&dz@`@SWn{A>!Y|(Ok>$Bw6hIFU`WgLo_OK
z->D#z!9SdZ|BwTJS|79XKR-+T-Aj>zdzwG2|MvKwm!<x0K9i#~3rvbXRjGFVYmv^5
z=`Sjd4uLNpcK%-kzEk=S2>x3HBJrmrvGac#>FmT`-iMM)|MvpliGS3`8T<Kz<v)S!
z{J)EMI`Kas;xC#ZK_yfF?nXE#{=LKuPSyXj@ondS9$-%V*?DXDMe$ReJ^jyurxX9%
zeH=^WUj~q!|2i~kPW+ppSLEbAWd4;I|4!gL@xRx{F=RVH`A>1R^PiiA|6L;BZJdnt
z-yZ+jS@_FM8fyH@9r(Mm@R#>-$n}3IfSv!_kkcvtrIgulJ^aD+?~{19$A1_wr}V#9
zY-SK@D5zwn|37EJAIKB`rx3`A|6YMlZLaF<@xMPy{O$L7QT|WE&mRA^h@iS3Lh`y@
zFp_&T2%q-jP+F6dPuiEj<S*cG`G3EVKUe+nWl?{)Z20m%FTWs2`~&#e<$nvCGl>6m
z5l%i{7yK`j0P&=-<m9s#5uta8k>-42(~9ILJ?-D?flp}>lmW!^z}fso)&H3QNqh+}
zft*hK%LRYUMpxoX@I>G{@h?7yhuA6tQu@)JTZu3EKLlig+2h}lXZ)`c{kLrR<$}L_
zNdEGhY%V#;f3J{V69Gy7D*PnAl)qTye}N<@p0^A6iMHzO-%mq9DgEvEcjk%j&w_tf
zp7=M3{I~PJJ5T)M&_Q&Pe`}uj8&SZW@bAeJ|A$%d@68im&w_tnp7?iUN&oxv#Q%Mk
z^m`~z{8zH%-$0)D@;)DX{_o5a|MywaZ+D*f^RmSM=Xv7alLdcop7_0Je4O;}mwDnJ
z%7Xt~p7;-C!GAta{1daJ|NcDjzk_g2@u%}L<m~m8{kuI2{!pIy6i+AqujGk;873v1
z@DJpPe_a;+c{5M^XqNJKI8XfNvdI5-p7;-B;V%yc*z?Q&-I}HTDuQ0+lm8*Kf7B-0
z+u!0m@#mobHyXZdZ@Dz7_E&z>q~v?SKRZkRLCWv581WaoJZEI-KO7eQ2eto5bDa`j
z_8%S=^AGm)D;McUx~)3<_ch2+CtI8q0$;_YcRPLq;R7z^l;I`*HzhzkCBA&#hV+;3
zYS7(z@}G+Y0e*+Q{gL=IzE_=0KM9)+0O@p40>rbtjK4Gr!prd4jGx4p>3=T(cHV@!
zRg6CxMLDE6p6!5tQPsuFvZnkeE*oN>{GI>5c;-w7n?55j-OoVz+v05QPe~Yr3>4eH
z7P?(Dc2r%a?IYD!+SdB3R&^+L88aUFJIfB@?_dRTh(g0`Q$HS>5vNDUylD#_Mx6e`
zg4e?&2nz?hYGp=snc3x&20ty+kyk&0K;%+J@L;K{*e<QGEy?dQ(u@fdhLHxrD_CG=
zJ5wV|fn-QdGskPjA>4{I67}lwU9c`TB83hU{I?7_Y#g@CW(wPtlIn9;NWr*xuuU~V
zGlQig`_sOCw(oNFd!$(@D6m}!b6&7XR<*sWNUPZW2ndceR|;w(e$3?80)*Ken*!r$
zFpX78?>^5q7jAzt3lZCqXf%F!Bz6jnk%8WP3fsM(dtEWotldus;7E36K5S0CFE&|A
zXl^nh1|pnkl$cunMHXDMgkk;^-=Gp7m?NvI_r|6KD?3KICut+QVPcID4SKd6<jK=$
z1?TiB{PExq(}l!8I6?w|Y~#c1oZfzgA>{FEbLuN&ULmhP*zX7BU5}*5x24E~J`rlR
zAT0kf^@AIE^TR@$4?k}zS5vm*(lrmZ;<ygLP8`_)ghe@TwU1tWc=6K<Y{~5`hT^1Y
zh(Zq(Ed3mXO4vA{5XxyQ4tCy(Vdt%QjCS5&M{d3scGh51uG$MbY@{@$_=Zin>Qa3B
zNQv-`qFL?3cR9Yx@m-GZa(w&o4cl@Jeti4!U5RhYZrm7bvuQ26G<SWem1eLd36YjS
zj0HXda(}<-50>j7#*#_`S{_1YaPL_f2zDt4caT;IXy$iXa93a;{adj`scqi3@p|2O
zMmOF>RTB7hvdnWPtixV#0W+EV2Ud0HEsyGmj&8gXb|=GCZ(QG?o9mFCRKRz2ovl?I
zh!}s?D}Dn@wqZ|XNWTI1UyW?q@IZ*H)^1AvV2f@}K&2!~^OR73QJFrnGekEgyOQ?=
zer;8dmOWV!Z~0&aU5NtIe^e<^jjD$!ta@Mte?FDbD;}{b20_4%pVB|Xel?5zA>DWz
zvG=q4<FtyyX)%JK!LY&8BH~_M=8w4lC{iMzn;XiYDm7)5TGe3Zu8?QjY#kP2k$NN1
zHj>Vxj|^%fk09AL{32PvBAc@4mrcIK+(<B0>?rvSu$LGdf|1DyF!ESTIH(Z9X2($2
zP1Qcjqe}++X7mek^YBjX5^0E1>Vz*Iy#60V?SoDVs2PRUTeTM!9~louRvV1pF7O89
zcj1j_rYaWUrDP3*phobjts1YthBWt}-G>v9@^F^2l@rAASSSf3J~lxR$rh9$vHWF*
zmdUI%YFi{A5)rm1VO$dLNW2~-9<`idvl(yPc;tMu?=$@%aEW=#IrN-w+`_+&KK5M=
ze@fSR@TX@r{Mk4B>B-Yt8i)o!I$quuEhN*Jtbg&>RAoY@F?UTsj*e%UoR~Y_jE(of
zE^c`$3>ky;Y;Ht(i9b;UF3ct*8D3_IY&@-*KO=cHSkfNH5+>O9s%P_G0n&+V$57~C
z&BYVFo<8ynyU}TYIc$Cdie}CtDdi`O%v!HpqKLU+d^v1%cb_)=j|j-i2eZ~%3aF>=
zdH_)sl<H`IyGvwAX9crW!eb>UmVE=)O-+7^;aj2l26|BMhReL3Z3733w!336$SO#E
zT?UF0^KT@nzTr&HlRm_x8*r9#I#Mn~Nf&=&JWB%s55+f(_rc0<VR~|QAFrlkx@k>b
zK3JPOq?sEglp|q1eg6j$jc+LQxw@-0v#*dR_&{tb4E!>F8oDf0OwA32<xsJasGr0`
z--Uw{a|_K_A*6Gsg$BiPSFDy3{>;Ie!im1vY!;$#pnIA`&XcAgdU7K#K~}|y`ci||
zYwq8T;BKb$E?+KxYVWz;Disi;mMEHI#^#W^P9oKWtz(j1Gkg2#0h{Efr6o_#P<+E2
z<i_Sfc*FQ}x9?#ZqYU4Re~K-3ZDc!jq8JBr!yF_h`eW3;8xK87PTs<jm#NqlFeB{O
z=QLE}e$B+CZrxby?{_DCHrvCVZ3mzY=nRWG`2uaEx|pS{M)@@f48U#90$=xLMmh?=
z<PG;zpB`2AK%xVMZhf)KQ+t3R^$blyoRN||Ck<g4KGjE3>psxnw(e2*(f7cONa=;Y
zbg-t3ZN<_O8_Lj2_-$YxBioBFSL_RnVF$A9w_*5G-<~r~FSeRFNi#1U(h`$T)Xdn4
z<zdqsPJk{FKd>)i{3$eYS!oJ2O(7@6%BC`sY2~97<%7k`#|I581Vx3pqZU6;-*-VU
z702uqQ??j}6X7z{>WC)d=u5>BHKz9Ikxl4-oM<A3P)-An6`{fLuHNK1+NWK;FpXvR
zLT9CTMaV!6jHFAI+es+5V@jf<mOe)@|8W<BRGnif|9|v8=0Dw_01ZGVsA~77sfrqq
z7Pz1X=RQCW_-?TI5@K?~QP2d?hdUPa0S5e!J$*Qe`mWRk$Bw=q#rOq3<oQ?rA&;N-
zA&+15Lmt1z4|)8WKjiUiJBso99G|X9P0p}^pnH%8d>9&e(EDWlM|O)-@)~8hUdrI2
zugSdmNU&ZEBgMFf=9R^~c6su6K1MMfrRk+l&~yz=qy;c7Z8daOkJT7rlM+`w@-X#y
zIR9taT_Sua!q^j?!cadZn=(c+)O(S4SMm7^YuO<+UZ5!q$V3wjn)_Ydc+tAwM2=Ek
z7SW`h`omb5b&XtFX*?=}1w9Wxj@-bag=YMUg#_)%=awU!HV57NQOD{j`PkiB*7aX$
zBUKE`t=uR^ZVXe8%y?YMh*N}wED2d2cs4(VKs3j3>n-$>Sc&<f>SEkJ6Rz67;p4;o
z0D8{s#ebTP!{jFU>La`0dp)w4=LH|Qi(D+G(Q66jS6O&Aew_<)!OEf7rzrVp5QlLo
zTMI#g>gi+C*uRKjaq<o}XilCQ`YDZ22`7~3F2ZO#<f;90XxDf?phBE6=U{09BC@fF
zdCFW)&9<`nDVm+a3^mP|rDd%*m9?V}LG78#yO+q^r<G->w4C)~X(hh1lnpVjQs!W|
zJWf*%85#LHQXp*tj9+{s(qClcJ_JghqTUU}^UEQRrcxfAW}81q<=67szzF5nGHc%9
zL}lKgROo|!zF}sz`36tl7ioARr#pf}!)x#z`WeetnsNvw))gUF4@rGeb2L?4=?XSP
z(Q@j1<FQ*_7cDd%cP_4&m2p35#wJna8I+Z0V8BvgV;6vFQ!+MXrwJ}xo5Sv=QwsS>
zsY0#|1qR|9CSf-3yHv81A6M@J6d8iT%rnlKB@zYMLrQXzO`lkKZX)IQWVouO`1(s&
zk%o#{*bDd^)3;=GQJDOO%-6JfqKs7m;DuSL;c-xi``IMfJMZF+G-LP;ya^%{<OO_M
zc~386C_n#&;A!Q@sUoCdGGA?_fw5k-E9S$>7^=dN<mH|-gILd&t&@vnt{RH9J4LMf
zSuQlqi$2ShJgIa1C|b8Aw0Ogkem;@7C|vcY>p$s8=ShoB?0ym?`4~izAyGtXCSjho
z#(0-!x2*4&Hc;}o#@1f9DjJlny$*@?nrCrrf@fPr;ISko<51Di#cRAdFvEquz`^)C
zBSFt?yW9sSKB2iEk-G$}mKyT0^?h6eNEb!s>{Rf^K*uUpHaS@c-mf@YPEWHXt=C7Q
zLCvTx4m=jFI>34eo|-=?>1Z_`tUS@xek}R&lJ9(3ZW(t+qG-7I>|%bh|0I>hVsF7o
z*jqr8%%yB4;AFN5BY7K3^h&_HhXMzan-R6JC(LJVQB8=c^z88;jzY<KJmvq-VFEnF
zrfxx-3beV}<BR|PomA$qiFJctJf_4|bO0-4TErhOQhX<^F7!zps<5uU>JcRiPfS%-
zK}?$$qN*C;(qoyYoK1<-mIF@>ZBdvgwkRa;!U`m9P#B3eQZf5V{Bd{k7NPG)B)gT5
zqscBhnWIbpuqFLDmh_g~cSB~rQGyG88wvhpkpYVQY6sv%nXG|Vt<s~2pw#xkp}?y=
z2~kL};=($@v|KjGl8RPpVh<@fL;04xTV}tQzeiydYeH6ElIE3JHtB=Apfw{@BcdN@
zt;RXzAr|ZS0#V@LgVb+-pcwx~qF5RjWW|8@NyKUqqm7+AxT=+x6fTlgzhl{+RT3$=
zpi)pwsa2^FfzZTp5IC2F7fT6w84&`O8?OOZi{m!q+CM8vrPdKl4S1_-r5(Kpc|)|#
z;Qf`i#&}&O=zEZt?{7hNXRN;;*}A(}-!8UR*_HKnu?cIC?Ifeb;w$c?P1ZVlTIUWy
zXvd8@r<~GDyAKhx*8AmtFR_b^`*DAvK-T(t)}Rc@zP|pqUQb_03+Bc;jFH&VFI(Y_
z6=2sG714*r_e03kTKKL)x0R40%Ggg(4`lpdj1}Kdj1|~fc%X)zcCe-xE3lscC06#Z
z2zxpkl!?G50;j4BVo4)5;hC6QY{rUdiI;EF6Wma|kMepf@88pSm&R<ypY3aka>y3n
zFq;-zpQZFLA7cAMC|xGAsIfAfb7c|NC)*}UaLaOG*j!#%jzw_V^+3%`Z8))-7ALJM
zIjwC4{0dY`A&mTe2#%3|2pu9?%w%GOJP$t_GHxbH5woPmv+YsO!@DtH#MRwl<E_xh
zrKQx8XD*}jjSjLRLgjwcmeEtAU+lZ^cAvn<Ss0~S17;>T1ePv6Kb&)e+VBaK8;5{}
zEHfVxTL{wfgT^s43v0~Pg~g%x?=Kl`z@1;t)UlLCO)m1B?e<8eetO3A*OX02`FS43
zr^uR6{GDRYj~@?vezraAso9RtAU%;|w%qa^`?)3Ovp#g?r^fT+M>BK8f9&VTn99$e
zKd9x$7!J2!gX9Ok^o+UuJcArVeRs^aKOtl216h1{|2ib=Glxw^whlq=3|UUCxtz5Z
zI|TVB#wjTuHdqNK%FrQLo!%kPs6&7o(9w*iwLIb)^z?Q|?GIqS82y31GTtHZu;v9z
z1FwaR7b3<1^anlwElhfS_94%Y4_y25A<qx&R{dc0mp|nB!Db>q_~Vxjj9=Jjaz9%0
zH#}2n$}pArezxiJ#x$m+)nq=_<P8WLP`=^uLd-Wjmk&hD@#zB<One`^#U#D`a2`)u
z`SB~{$LpRcMP<i)cGxoEb&t2GEJRBX$8Js_ZQ;`Lquib!J~sVk<;QbC@Kof^4rN2O
z?FdFbGcK%jfJA;XE{>(cmK~mQmK)mNH8*^6x}|)S>6Y~Tz`3-HP4yq9{%-W|njv}3
zf2HPw<r0aQ>v|JqfwD)L>{90K*rFLuf$&oRVRKV?ZQ#XZ$qJko9M2AGMD>xM;}|B6
z{nSA*B$O8W<hdj6$IcgFcR=^l<QiH}wn73HyHYn7;E2eAN-PtyBO*)ah{zf0dOzE*
z!H+1m(Na*EWGeS(4Cn?pjr^Q#&v=-fTbvr%{GynaWbt6joRik^g97izw4}A&BlCb+
z+WHtv`tD_;O);_+C?w5=m<Q(vk>v(697HZpo`+M&n4rWOBBh4I-0S;#gh{L=QoSo3
zTMtLIE7mz!3}aWlPl;?TNz+<YhT=k9V>e08wzcGDEH!)jTCs8?1BhijdFX3chaVz^
zB|<DC2Zs*UOz@41O%jKB0|TGOasnMUGbhN!K`%mMaq#o$D?nm@K>BK$8J^(V{8((l
z!R_O^mn5;!pPFD!TM4C22oz?9ZJCd=DyJ1bhb-sIoHAZVbGqHOw}A4T*4vGzdA%-@
zN{!v(JYqLJ6}yARA080t_;-q2`tB@w9*k|Z(@Y#lWruvxW?}Z<e#n=fQx%7N=MVA&
zs+306c&9lMS}4RK6k5SLP=JjDP|=O>czhJ<2G+;sL!SsV8SgmNj$rCiGLe$!fl)tZ
zo(C?qp9j8+q0l<zR=hFxj%X678X^#=>DtWJGfUIfGe=wBObf{giuF~oImhYzaH0wJ
z2kd4vgfvd)i?fnqIH~sT*f?LTrX2}L>A`2+GSh<m<@)wV_D(1@XmXmW<D+Bmq?q<3
zZ9iOqs@$@9!q3-=&4XuPw;WE&&M!4-=`{8+D!kg9YG3SB(`NXj`$b{MfT~^O<Vdq7
z<rTChaas#Ni}Q<$_z3?(2^WYQUBuVH-if!W<89iLJMgv!dnd*LB8rqzOr50Y)8-?x
zw}PPHAADPe<-2(H3sy3Gs+)nhFYp_Fi#QCOa4sL&H=#Z7e7YP{?3nXrWmwK@pifE_
zJPZgN6ZTEE?=P@yoH*Gx;r`sl3H<+#_Dwvu-T^ISRz8G{lPcT(ZrD4y=aR(Ke<x*?
ziyJU{q9G3HhEEo&hEFPB_=HM&nyC<J{Nx^C{N!#v9^r!vX3gk?kOBKA@tsA&0LtCD
z4WQWVm+<<8ww6*20<Ay|VpS@c=1*L9{M38~2ABIbu48E<ETGJx^9dD)DPm!aAu4{O
zRXwV~s!KR=fk+>lEtJIE?`zyFjLjIz10mC93kBw>28(RQQ23rPYik9oFYNNl_9}Bf
z)?j@xVW0x}$Q}xk!MV9-`xmiU2s@FFjs8kX|7ib`)BKI2MU+pb@67RR{uj$4in2S0
zb%xTmwDTzkW)p>OImhgPY7^yLfM644^sP2ot)iSe{5bT_R-d2&Ez*rzZXkt9jkH}7
zJ4rP95#t?9L3qyWBkhGZuOFy5cfT0=DZyerx><{vk6K^MYkHHV>U;%!P*44lwwCW8
zYeQ^C0u|Rtw6t#^c8)~!Z0<t$+zL#FR6LvMz)A9BmOw?OD>*TZ|B)F~@pgMql9g;w
zj`MtEPsL_$h3Ydgx=mGJS?sC23th-<PvtiVMfOzAV$)E=yYQ*nQ;Bb<UYCPG6|Rrn
zrzU$;{X%sr+Loo(IVZBO0;OK;H{8iHZTha8C77=>c8y%hrq5<%J?^x*lZ{qEJ&Hc<
z@M?S=iIo-mc!$pqePmxH!+y+1_EpOMR`zv1vagadv-6RCm66LTZQG{lFfJX!_`BL$
zI*Rs3d>``o1wZ8REB}zkPy3L^?<4yvnpq@lMAVf1jqKGO#rm`PL$04~M=^e5JFgv6
z4q#?GuZ`gcJB2Cc$uYR0IeE-um*aGH?9`M|mE;L*FcgKgm3KzEUuK7-<tivzbnEn^
zbpRD3FK7EISc|hxqT3e0_<YFGwXf2cvaf=i;I>r^W}VZ8X_T>8S5fyrVc7bt!^l-V
zmCNj_yoOZBX<y|D1fn^KTW_V8bo(l241WngX<tQ*Ut!(8h|H_3kvWi-i4)n}O84<e
zJvDy)4D74GmcXZB$}fj`mF_!uMq@IyIQca;j81;c*}@959*9ACAuX(C7+IOXd%u{B
z6V`On=Qa^5zJKXx+FN0n&F!slTPwm^by`kmv$i7Tahj6I$k?N9Z-r-CY4RV``3h_P
zf$Xgy|5~hRh^fjn1kA0-`Lne7hgn(YANtt*gEbp+EZbW-`sFu2dn?uQNISQ;BDMLb
znq2t~Gr8ik=0COg4%EI&N~wGc10ago6j4VX$2FxS8QPL6-?N|`bI1fpxaz;J|2!+@
zD3#G6RPQHZ-vdnU&spN@{-!M2@PoCG+qo5$GuT`dFT`mT$>}tIt6>3@8DM!6)>XIx
zmRIm5D3RHfU*nTX^O(xd1k5(4O-?)6TX`8Y)9kHy`p5(o%0jrRtJstHK0eat>l|Wn
zn$@PUBf2LiznDsIDqn0d3Y)0r!{QXoEi;=dpNGwr4L?X;W}DyRk*2k#3x$0b>>P7o
z`D{ANUkDp7g=4eMg7h4dJvCHvmcfN=?R`+R_rgBQc=NrOXUWU{iDmSSHzofo?X#RJ
z_CjC>Yr2gVUV<$fEjNtWMoSoF7llB$W6wSdwx6N;pe+(7*U+8{uiR4+ioZM3{dLx>
ztT7J4N=wMt#b7s+!IK+#gp~c9W41N(e%Ncdz>3WYDB*I$2Q5~8Bk4uuz_)yG!!0Jo
z<0hFi8Szm&6d&1dN#DUqHVQwo-|~_Dmh{4dFR{Ndt5Fu%GhzFQwU6w#d>HMw{1Phg
zJ{<0<G4EjpTwu&&q&qa0({^aI6bml3#`kF>GPYHa^%l!?ON}v%{RqeY;T4FUz8}SY
zzKdEo8tIEOEr)?H+TjXjzhybuZ+Y<u?6=_hj>7V^oY7^@XvR$3E0t!*MeYquJ5HaT
zJDNGOOyp1~{x*!bzy!t524IF_0H0*UWdIq+GVLvvV;_Ly^|t&%X4vjj;W=iV$opWF
zAF|#evw}<?vE29o9IhX0`8oK3E<eT)H{$XEE<N`8E@%1q1#;}zZ+~FD<pWxLZ1tJb
zen{2?SryveoEdUt_FH&=fOQAPV!s7bm0HT4n{f}b-NN@2a>FggFif}L7~8Sh8Axyc
zKeXw8%r++fOVa<CwaoIrB>j(BODyT>pQATR_CDS}`zxs?;4^aEk=K|bWnm)3hl45G
zD{8AuW5N%Zy${@pk$z*N!|39Dv%hlGvLihcnCX>cHz(4{LoRzObh*d-WpBln{Q25j
zVQaVC8j&as>B&!~R<ObT@7f(2&C*I*`a7P_`B3ynk6Ftq?0h*h=a_Eu!n65gI=_^M
zL6!eTq2LBpUQL$3o{G4U90pY$m$pslyfH25`Xa`g-RBJd3l$@4KLxkH!p<Y@4?P4g
zS8P4qa*hK@HD$h7iAfuGx=&7CBkpq+^ffZLvcxjDathz9u>@yEXtAg?IU7sRH8fS|
z!JZ`RyvSK8%AP*DeSx2!B5os(57Sa#Wb>=tA7@L>DO)SaaqQUB`)qQ>GDD<p*;3Z$
z#I#`diqWP7+3o_QOu(|YGDWPE`wiM~)?J?TphOw3!Qu+vXqIU&?r&*xg`cNM*S(MI
zt=MiaP%V;tWN+n|wzpz$&v4Y)e#e=#Rs#FyO)$vvJ9hNmvjkVFO{w$KKOg<`3JWPP
ztU{kbeXx#MTnL%<%^{<%Sx?l5LI>-ExXoyLtO)gBG-59B3j03#-~g(!5shCJq74qx
zR|F<|rs@@s@q^`?d|Jg5TE&wQV|OHRbuf}>4@S(D<@(@u3abz9;3zK=%FjXCA2F9y
z5_ZKNvX5)7Y}CzbVIkleZ^+}VbwS2LTzOp|#Fo^9bwPJ*a>Tqks#9G&Ie8{Hgy=nX
zQpEjS7#EDYe;0vu7~NQlCV!)kY~{pG3cG(5asLYE{>mf9;>xgl4;=vnFRfxv;4wY^
zw)<gf9JEspY7?K)-EU~v-hefQ|B4t_H?oAFRH(<!!g|oH2i<xfet!JQ@vFqI5of}S
z`JI7spkZ~EMxwaJJVvI7acjtLS(YGcQZ^C}2?Gh-GI9Fp;L*;brs+eY!+cLvOKfB*
zrWx;24Aw@;`ht~#EH|{lM|q~~qz7$rnF@mdy1Aw_Vy-|w{#mbh6KViN<liGaC`S}Q
zkr&9n2ISuxdc~h~V<3`PgX~`17*4DY9;`-oEzpb&WtEz_9tVA6Wk~j#G923om*MQq
zqB3+wucQNixFC_IjET3f30T-9Uwrz)XtJ>l4!GF=R91<jz?2P^a!d&As&%<=)|zo6
z`#{lTk(Q_q>Bf_qd%Na-RCn(T?9=0jpQmOIet$sbzJSeQ;Cl@OXz?)x^62gX-Mu~H
zek5#M;ZK%e`?R0bqBby4i@T+aYDhi5GHg7hRs4y_y`^Xk?!ba+o_C4C4$Y`;44HM!
zMs+jSS0w#LD9=Vny^$#;o=~2RP@auYo{dnRUBz^An@;OskF!V!vX%m6V(QZc|K(*G
zGpND+*<u%8Mw7-K<X-hO6^cq*gpF1wKwMI&=+6zW+>VH5s1UbbttHk7EgB*%s)H86
zb_YuQ8CnIl+#!PifVwn5UD$WIUa>ui-RH<PRblY$W8dal%pn~l^j*5S*bnSVtpdrm
z2#UZdloC3-i-@Rr35#Az=_O*;HDW(BvdkSh^;In~KScSi8+&3!VG~>K%!R0`Sgm9!
ztoRZtzArX4T(K`~u7`HD_#ze0Mk;=(8^0h$#Br2GWkEf$I2cY`5d^t%V(XXuD;fXI
z`(mFaMGWc{Z;>)<VOXRhg+>K1teMxKC>$oZpY&GKD&EnI)n(9|$4Qxs!`OOWF#siP
z)DWiFtZuF~7dO`!3whORRzoTK%6gF<sQd~&6*XlYnmG@uQ|<M53#cyCOzy84^SqvN
z_<N=lFx4-@HppmX;-ge@e3vAOrm%veyLapE$C$!0^@Q&4z;6%K)C;99g;JxIgz5qd
zQ4W_yadN=@1mTtfSHsgw+HF+(acQe46M=&$6`Iji9(E5026XiPp!vH&t`fxxbtYBQ
z(3Le&Ju$gLcmGj$zoN(g!UK6~4uk)GvH%l7fruEWXHYhY>mR9<S8DFph^t?7AJ&aJ
ze{wP!C{_{!BY}fdZYcH9ydBmm_68mUuKPhG7pm`lsP!wgi90m+(^T(6q+#7y(})_0
z6|W9fyo5cPL<=r5T3yzxSa;_&wniOTR%5rZGG^JYfrqH6d5sOsjFPG)t}H{wDz!T-
z;E2U;(HuLJQeMtbP;b~t<<MSGDROYB@*35R!>C}kdb>-v7I$C48+eyK81z!O;VN9O
z7&bRT{}6ZMwMf-FU9ils5%2GY%@yS^h!U>&y%vAxfG6%lP`sVIZeh^%YN#K61Gu&^
zQuStc=Wq*|lrT4<B3?_Qt4PJ$Xeoj7CmOxQ-#*!M^UuJoIst>L{Vs`k$g`Ois)x@*
zAk9c>@&EK_iS_QVQB=kg&xF|+BZ!@Zj}+(zYQwf-aP#!hdMX5sc<SGYRJ@G3+Sgf!
zb|+l%-&*`HzRph}6}9+F`}M@snOb79KQOXl3(7~)T>J~q^}=v)rDsaG5@ZK`TGhMV
z|D#tO>Mj|+fTDnA-q;R%FrIA%{cde!2Q~_at6uLuFkHfX|3}IgF&<?iMz92D)Cvi&
zaz%_*h<FGC!uZ?1&MTQve_=wQws=VhHCqU!?q??XK1=d_)=|DUyH6gb{m>u?LkGij
z1_0~j_`;6Lif1%quXbo}m|B&WCd5u6`#YX(p9=O@@d#)mPjvqg1KSCmVQW7$i=SuP
zJa>P{jYmO$r~r?`{!k$vMg5^7JjV5h#^Eu(KQtbX3H_l7*tK4)#kXVY`Rm<3-Q{K(
z8Q+O34XpzoEK%4$h^V-f{kXq|6YGK~EG!VJh(-#9nr&-w>_X4B`N4zR-Ld0PF{5&x
zuO-nrT^Q1y8rIxTQDvbSsIZNNrFi#k^?Le>kSm^T)!6GiAHOb5H+Jezy@K9ENJD!b
zfB9W)<jJk>u&4GVqNp2tBc7VU`%eZ(%~LxVaqmYh)Mz~U)F0z7ZvtZg-_?v=TE)9-
zCqu-*J|<+c6kgqv5|dq_ew?~^3mpcdTH94rz*ujExM&|BZnc&y)Sem&yHTUBM<u@=
z^LW*j2dkS4V@+XWzqWno%vimixTOs2d$kA0;eir`Jl(AwLhte^5zXzxA1BcE{byn?
zvF;w!Z=fb=lU}h?zhNih+e_48iZymzjj<p8^eIgWSr=BaVYj)UQLEbCH9<q46S~4|
z3>~a*E+z|XOQ8CD$ZLU5GxlgEwux6g)rH)5vthpzJ{>M#G_<NE-mY`d48+a^IdAv)
zU}fhBYNW)x5wJq$Ebs;UJ4eXg*$A2r97zBqFpxH%U`_Z$iOxA}MLuk<L^Hd|A3lGj
z7Xno3Rf93qDAzO&??E~R28QV<0gpv>GjgByB_Y|7%$STpuyCS_G%FxGMbHUEE&c+u
zU=KBVGUIoUj-l_j5c*~8dFl`G7dEk6e`YNjIhpI4IkhZ#7UeulzReFMrn>qU29w3q
zY*O}<_b#ZPUV$e1Y0^Pb1m;VM0KJ_Ly~VA*yP>O05p?&HlvTR>aXqoX9j+P<d#Z=S
z#x;%5kYc1Hb$>}H)*)RO(%ru#ZAXt2t?o5GN{iD#${*^#D2PpGGRLptmk$CYt|)9n
zi<0g+vLD;G_J%Qb3Y+zfk*eKP!!JM$zdMBF;Ulb2{DsokBy^LyCx+s0m39{*yCUed
zPo|+=?BuZ76irU84eTSk<*4@E2d=A0J|9jrg(Aj|NX4%ZayWjtAXZ8gb{^bb+zp|3
zYv<ROQ_xeBKM13W!kZ`gZ^+nEcu+T?=MKGU$A*8Rfy8ORiJ^YkRO*WL9o+7XO~f$K
z)3+9yPd=C{S^^C8`<8%kJ*>HUVMMlNw^q0SX}iD=t3c`cCF>jBO$AS6TthK};s^7i
zWIT)88O2U8vl(TU8=<?z?3>dMt(tG%avnV|F>c}CMj!j02mdXASHqv4^We|E;ZIL=
z&S94fokiI(Po0RfiY9`gzqTZ_ShY`;MV|R4H-CDGdCNIWF5{NZaJl-}cQyQ(9PsCI
z+`_+&KK6~4vsh1TM5OsxGHjrY;1#yBJb(N2!UV&5Xt^k}+0skw2lmGI$f4gPt?=`>
z?Uq&)#+zNZf)KTG>Y7KIuZ(Z%am6O0>q#-b>Jj7V_zUj@21fS8-<q>7i6t&AaXe*(
zmiRP#v`qbH&HdKM3j&;MlrIb93vQNU7|Bn|7xXVU<b3&ZwtP8Nz951;4C(~VkjC~;
z3^Argbq`|T>01m%H@-(5y5PY_3t|<xI}iqusd-@GP(n_|pty%44OaIM^6*(e!kNqA
z)A1z0|6-@;$HDQe9$o82Ydo@xr<ggqwxsr($M<;i!jSvZ5&nqyvHrO@4{Kj*wI=4m
ziFL(jkeEQ|w|k~k`|<PPCuij}qYz&~bfcn_`FL-}4}-jTFZ+yBr7#%(CjOI?7T>Jm
zW~SZ4Kr7n(NG&YK#jrmbBPTWtk_~EFXw6_uB#LJKq!%nuwT?t9`{V!0-U}aed8vo<
zy8sUUl%~x!WIvk=OyxYeWuY0Z!ytN}yW}OB-a2%Zt7&GZj*<kkmEJl^AHRiBhzSS`
z&>PST+8rxFs~yA?f<|*&$#Ts3pie}Q1_s6Kp631)I=GlmTpOi1N%wETtP$wc<J2&I
z#rSk_Gklxzj_1ZU%~;=t?+$!-5ceK%@6i+6`VoPMc@sUtMqGSRPT-3k@S~EBFM8B^
zw%v3Wo;Ce(deG;$_$NK+lhP8t^uUBhIkn3d(KK45VtZsxT^ok3gP4m#Y|sw!i6=<s
z*U!h`*F6X!{mD;-%_$MgMN9`8W?$-jk&34x6?-Fd7PrMF0~fPdK=me%)7^j3-G_mL
zDtSJdF=!hpUI+;rLMn%l<Zf*+6oe=)&lJolOew&u@Nu3g<9WMswdmwY`;{qOHrMr#
zCHZrq3{0V=VncUXZKjzthZQ&&*auDN{mEU#0hwm5$L5KV*f@sM`x8nM4sJ_<QyEU}
z9jFLd6r*W$UM?&|m_c<vsi~h7o)@p$z`=<_m}z*!QJf^sa~?$7$u2A>33A(;ruJQ2
zPY3-WBa|uar@5SPViSHVFb(v3Y-yL{epcH4ZuW4YHN3c>Y+#-$s8u}~o32+4#4f}v
zc@Rp$O9~rjtwo7gh_bX810R$O17*fo7#+SFX@er6LC*kqU8{Htvv*L?XTk<%`QJsS
zPWROO36o`*2)iO0F`$Lpp_mw!?THw_id5`~Z2mPqenG5H0qgEE#@1-S@NRu0&3`7*
z6&{Ek&n2Rf-)EEPc2_~(#<1Z=XcS;X!~K_t(V*$>w=jth5urtHjF(Z4-5B9PV9cXI
z@MZ{(;=B;Wd2t)Q+whHIy%5EEaR<IT@ZEv$4t)3Ey9eJr`0mlouk|9Tn)xGo=*Bko
zWqg%=nO~za4?lXqk9`?mWnbpks0M%^J>bW_jIYuoWPXk61M^4pKV)p9hw)YRVSepS
z=0pGCLl5Jt?8CF|Yj@$xv+YOp2=#BHNB>vZ2mGkKz>gmAqeuT&*$4cnK7k)S;75=C
zuhM_Ls?Hl*g#YE;KExYyu9zspoNL7{O!Z+Vt{jPgc{jE$qE*fJ#v1Uyyc_Aa(2q1i
z*gdTN+(oq!5*uOBabM_9)`40nsA2AxQ$v+Y1ie^c!R!v;pw|6E(1G2?E`;KAFhxhC
zP>g8c-{ngcB&^IAcbA~F!@$3of)GYHMgN+Nt)_yb+<AGg5HmA>HE*T_#GKgYdE1KV
z+v-X{&>@`PhG~Zm4a3RapHPYbw7wZy{3p#U!Q(B>oDIn_8iPz-Os2s&5i7<oS;9uB
z!@J#-&0VF`ih588y0HKr!%79JR*8hsq7VGNs9dzFCt??Qwv8XYj?if6MDg9BZU4h(
zDfOOu3v-l3A$G7j?3wpEf_Fa!t@eg1P%phcL^29dWAhl?jhj3c`oN(FWsq$fV1Za?
z)5}Dg?}Y*Afac!I)3w?+&$F#4Fnk!KAh(8rb(AD92DOUUV^gRIaS9mT;sZ_OAUFgO
ztV44@i*lzSy&4~&B+#l}j}?J+Gn53xqv47JR1s9|&^*<9HIuc7=soa)Fux~Fy4YIT
zk${<$KI*uH6JS_~UxJk<XhIbAhnJWyNKBp{E?n3VHqXR*8m2fxi$a%$Mi6hPMEr1J
zcS+dnA`zouqsxmKX-p`F3%k5Hd>z9~4rLwn8@7#4j$@e?u3AsG|HL2hGL<NVMtC7X
zy7?F{ax%{CzS0<qB?|jTA*HjFE5ayY96VSrlxqQ$YYCKVU9k6OOu52|dZ}DA->#b&
z=_1{*ipr)=miPvlrc%moE%w~T=24<Hj(lE*jd*Z$nI>}<c)QM~sg;i(yqT&HHcRux
z5tNohh|SUj`@hI%XdVNr()7`@I)98JRGwCZkhmCFdHP<57O{ryAQR8q{YgZXEg549
z-bV?6?pHJB9Vd347V3SNMKyLVRtkg3PvC!f#9ULEoI?m$Ev#dSgQXg}59xGxqXw?)
zXh>Y(!-g2l`up+2dhD9Y(BMr}(kNTdb@RvnIue_P^`-8UwFH)ov_!ZJs?gx))l^+&
z|EZ{R$|)pfa>*lEh&f&?_F>+}(?^DoEzv%SP+S)^<5^7eu@r_*3C;M6XY)7&AO1Z!
zhm8x$sBcNDGG5($xEC;VM?8HL$w=biems~#iD`0w5!%BbB}dr3J8YhU<~|H@(E-5P
zWoThEG;&!fsVrKqa;*xzZcpEBAc2iBhYMqi<L|gVH?t{Ub2YI;>jp{nig#GS2@AtF
z;i{qTWeD0`O^Y+d6lGe&Mw}}Z37LIl7PAO-5gDBkL5IgUTy?nnw6J+WnVRZ>0VK4i
z_7PD|pbwLUAu_D!v32KBZ!dGXq>ilS#R02s^*+Q9H4Sv1ROBpC7-Hu^ebHF&)<$;o
znH`$psjp0yd#0pHQSvk(qQO~!x@WsK0u`?J<A;z7DtT!k1yLp(`FJa8*>d7ypjTUu
zUTwX%_h)yJG<o(nQHM8U)nQ`i$35G=$Fdw9+gchk1yQL4cd>rFD|wC_W1t#oE(Uqw
zA&@A1`L6i4h%pnVx-B{18cktn!h^dJuKPJ+_cNlQdm<>l>pQ3~eLT3e2?|Ls%T-ip
z0)noPu*QU1%6=VB`ufnjFelOr+DwJ}@j^Edy~(@Cnpnt>Z^UHE@i+xbGtXz#Zhm!B
zDH&(Mx|)GeQ`#B;Um8RA8Uf<(6s*JSVD~dn+nyTZHQn?5HvtB|?rAtAR2Tl+$X~?Z
zk%-AkQ1V+00C`YK<$M_zhqvPA@$A%%x4EpKbE1yrz8;h>F?Wxl(n-AUuE<H%cEq@^
zjG`Jg{+j%6S>JJcWNEcsao|-^-%Us9XCsGHTHObb$y$CauU&}Bx$k%iWb&pBv(lnX
z_Vj&^SfNi7KEJDUcsD-KDB*&T>T;TkFZ?McaFDCN6ILbKutmkww}Vi4o2MHuXV|Bq
zrdN!(si8%00JFLWBgWy8XgS6;W?30E+0+5hE8Z3*`~{YvuqW2tf|?@sAaW=6c?9Dr
z&y27m4eOJah`h%N41|vA6;EJ}>Q<A9jRoNI=a*s**z<j?PCUU3-K_7?5B(P0A4Ke}
z39E7zt5jlAXU((uCWK&?<5-uCsb+282qtsUG^0;IS%RcN%}TwGYK`}+02D<86-Tv?
zK9k=;kH0jGTVy<aJ(PN^FTxTeOnoODU^ZT&{oc2u!KeO1P_Nh(`muYs0fAXEuzy5~
z9E}g<+$W6;H90dPmv8xm3NP;b?D5E@VwxjZ`KYJw-#~<yVpJ-8j>faiybDm+r~ho<
zWA>`WvyGK}KITV^QJKx}K##H+u|~=N77(pkp#kWq@X!TC!DnJ4kSyj&$cpqzU~vqy
z9RDSQr9$uw;bci3cWM+%Ot@q7S=L~kP5Ms+Dc;S<7++tZjI76opI9&EZ<V=PqCoj&
z27Q|G495TaQQn!o_;)SNm^=MuFNKpb-kkP@<pk+bUwW{<(H(<@|BY=tt+)?%2avTb
zpB(W!P7{CwcbW4Si68gE%VLw0KT<D^KQe%p27FAWoI=>+Uw=SLG@;W-i-s=Es878j
zWhAipV7<m;-e`+?F=CFPhg9aw2@<MbQ2<831)L<o1L4HF6sH_aH`$ohgXtic^3tX-
zXP2?rG>D})(}AIIVrFWld@^3|oWN6FOrGD8{u!R&wdU2s6H0Nx;F09M!k?KGku&v^
zCxjFCr8CTn|9i`QNBwus{`w=!bQWJ)0ufn_XgcS#q>l)t<uBB^80yS>9ZKf%zQEPC
z?B(~bWy#+wCqTzU=7!VWi;<g0rqQG2XDp3}%3Jb#kC8<YCH|Q6OQkOgR*&^nue^E>
z)<=1vZMGF!+#R&5G)vMt<)1=Sc@^{#r8N4;Ka`vGrTJAyIr0zeto&2oy~w{Kh@412
z-X;uXl*iZvm52H+`Mt-;g8xD*uc+m@9}o+0Gy6i-#<R=TkRc>Fhy3~RC{(iKGN(oV
zQ}&KTLi37|le8*E_K7L~OyNc=5BE*TK_;hk_Vl_J5~tFOePQiptm!ohm7Ee~NiR;)
zN-y@w(#tN~=;@V%Oit-i`TDnh^XAF$0F6lC<TFn+HUpYZ*u$Lsh<xUQLt#qu3|K6}
z<&u9$$RVG3lK;R2`=ICd2PUEaPJ-rJ9;ANDXEt$Vxyj});j-Myr-YC7*_$UqhX|Le
zJok$7ET4Ijf6u{s^Q3UJ<B>04nI7_)O<XBoHh&4<BGOqtCEWfz+Vt%7?cYb6Uyq$Z
zmhXO%9`czbSWfWK=68Qijy!-S<d@Gp(K3P^ZGQJ=aBv1hh5YjA94a^TX!Bdw>RQ_B
z>crpqt*&+WEv4r&Jn`$K-}(5rj{YsBf3DD)<(=)Tmix*B{#mo8`=?i4;9It|t97}r
zeT}bkX65YJGiNWa@U^U7x@M(sZEI)OD!>D?r}?K%_m#KBVjW$dy6B>%oW``3?d>a9
zw|2F6ceb=nYiYmsqF8(T>Xx>ptJYk!diC0CFYM@S|3Yg^%(uL1MP=2BnacwgUwrY5
z<+J>O>8-O`{8clnX04d9Y=*zJrFF*g=`${#Ug2_06-ns+hs#{<9<TfK$rFmVVAj_Q
z_{W4Fn^M4gDSmzdJAs~|5^ua9TtaOO?ST&y3~m+un^)oum6V1`eDT6t3ksIft9M>W
zG0}~YKirA@!RYpjcON|&-OCx>a(vPr6mo1^C+N=Obc=2+{Bl88NhyPn3?$!P3J8~y
zFUsf;-&dHA%QaCv3Fe|1Za5V-)d5y6VB>jkmOgU@>=Xf`G>8gV1Ho84noElDTvk$C
zUE-~?Wa$y%WEzt!w+NWb6N23(V5)qyN<og&h8%^X-3jE*<qrmXUcf$~zz*2xQJUf4
z19OZXlX-=er*uY$Tn+t8%hL@qOIhA)BAm>lRNi-6;esI1A;LW;=pirXmH6hBl!r?E
zH6_9L_*=#$SjHASRN@bnlrv9}#i5cQi`RXE2IV<97JmU_LqP$1-XYuphj2xOjEqzT
zMz2)BintepT_9k`DX^deY>|M82g7Z%!6-d92-vrX9@5=Pi+L3FN<=q4;g<1<akmzI
zx$vff0+T>~B$bsWAzq$#3OZ6ZNvEC@FqZc$Pp@WrNE%4#b=Zbe3D{&2Sp)Bs*OokB
zt7ObNMFNy)p8lG^l`@op#FYZJP|!>1M8SNi6r_KBB3y{VF<CcR<>W5mC)Ae7exHD;
zWn#C0sddWp0!GJ!I9*;B5YNNH?<~vj3dVCLzNd-`FHU||IzSmI9md_l)w7E}p}0af
z8xb@t@cxa2Rr52Y+afD#({&s9SX&Y-oa4>_lghJtZL6UD5J>a56g()?ey8vgs?EYb
zCtxR8;TN*_QQY6m;z#A*D>9JPcWLFl(C3z!M&a<AE5ZtLtZj%2*dY8x+98>!Wb<VE
zQHc*~z!DYJVvy14bD(p(fE`C^$@3tM&Orw{KX;(B{|MxnI)Q|Dxzu=-3m9t~GUX|B
zxzh!r^tsZ3PKSUE5`#=S1y1R6w*#H~kATiA4s_%M&sgM{DJotyeKY|Z3!M!PbhaD;
zot+MJo;w0MlSPH1#>*#QV~N)y2Rdy>K<7>eI`@u|PC3-<MS(+i?oiz!>tVDh-(W==
z^$!XcYsbB!aXXvBLO*5LTMI6?N`DYul_K0%Dcq=a-F1$Yng+BDg2rd<^`&F`S6Jb8
zY5++V{B{dkw5K5@59(~HdSnaQt<>2p&OwG-G>MR0u9<0a$oigF*@fr1(~%KANI!vl
zr0FmhH2MUMg=zeGpNQIB(P&(yw7X1tKX57TI|csfY4|qzkI$6947jez^v~t`2K`Id
zjenN9K{`|}!rejPta?jS>RV)u?s8oK??oc)3r=C{WLVNT9==b6AE5ADm*7dXp`puI
zc%h-Z&wHN;|9}WDb(Du@kzo2va_<*m*JXrlmC<8@P}s?$^Y|qSYmZ~ElpA^i?@AH&
z+Z5K)|MWC3_@{K0A-s+wz@vQHD)8nLzqE2$P%R54we5RFxGD+<x#9)utiIGM!jII1
z9JNud68dKw{|K1cmns)9r@mB;@H>kLF`lWuRI~8wB0rv{=)THy5`C!_C7sZtr2gye
z0&hCuF`A26|Ml~T4f)?M{8w831v(3`g!hS`6aH$S=oJBT>Jt@vh>*)=_oI5MO!#e1
zD_^W5PW|+nlBn8GFI?$ZPlZaNM5{y4`gVS_HjhT@p`$1l8<<1BZ{;Ufd^EWhF~vf?
zmLIJZqtUuc&^j7v|H@IMRXGKT1$Q*$>N|?G_6k~TF2Smovg+!Z(bE27Y!b!gx+%YW
zY#WVMo1m3dCz{jBP&S=trZRM&p!HtUp4v`12^FI_W~rYFm#b|j8}hQg(p*tN{*ve*
zt(A7@3E8+@0I%gD+~X9^-ma{Y?Fw%XscySXgr7m-LAQ}rZ1|7Qa{TTS{?CxVo!-wS
zJsx(y2)mEMa(zg(t$SqK%EL~cN`au$^v_OreTpu%GnFFjQVI*Y@q&UT5|E16BH>3#
zN{(P{0w%hm47R}mwne~%*la9&w}3gdJp;mz&A~A_E@kONGCnW-&LSb0U#eX?Ed0hY
z#;17rSp$(88xo%y0b^>(_@w4Un}y#hk^yNdb;Ld=+AqSX@xD{Qe1yyBrshQN7k+ZS
z4HFR}Uo+=KUld_e@}=fPT`W;;?Y{%8+yORMz{C)n<!MyFPA8e+sPD2|z%C&Gi^nRa
z(TmvsdX`_5wzt@D33iu&$#fyueFCQH(ry7e2ma(J-17p)`ndvjK)`(XCP(3l#00LS
zM|oN*U{v0?%&9rinZmDz{L=C?eNOaB5l-e&D(}<hMEgXz=L9`<-Ywrb(cOZE=<f3P
z3z+EkG1viza77ehI5k|UfT?Bp0s$-H!5O`vfQjK3gDrA^wFy|Eg1f;6qx9S&U^^%r
zbj3;w$1!2SJx)VH%G2ir9jTjCuf8H+=Ly>Jf~%MY$~n==r;>-uC2>d|pMZUxJaWsk
zIh#CfHriz%w?V)b674iSN}nISTZ9WyI97gA^P>a8PtB)a3YgSqN{=A{ljVq#;%xzA
zMS{^y&5xFzM$B9;r@C{d@Ec3rxg4}s3%oy&u$gIT>qi&VI;CZ8NwlyhTSo(ADPF%6
zd>+C(Pp{Nm=>g%Vjth!JWyPvVmJX@8QePH7su$)8zt2#7((<qHVz(TW!Hd$rO@vkF
zmNp33Smu`Qb)d6Tz{WCHdf0)^WGW<ZW05B)aMXA$60ot%mG(Q(x$_9*+3P^(#Ur3o
zdInDmHC`78*jUo1*?~^%2<U8ep!3iX&^h2hr|9E6u49Q;rNB|sCwv5SdL8K8b_8^G
zJJ5N4jC80@_MXYp;vRaSE|6_D=9a!A`}7p9QiMC3!ljk{^m)=|5$-D#PObAY)`Zq&
zohQ9p(5QE=H*M>Lg#pLv5$r4RJ0NHoY4Tt`Mx7^B*S3^-(hGcqbY%0SZ9azTI?{BQ
z3-o&gjmz!nK<jd;dD7-=^Q5l`d_4_c&P9oNUM#|;7WNQ%@TL4NKMVih?xcU|dhs=>
z7t|(1MYuaC9P~o%mlxRPNjHeFFFA#Em?ynQgx^Eqxh|!~a?9jcj*lZrmghxy*_Tpu
z8KGGuta;L6rpPYWIzc-XHgleIrU;wQJZZBC`|Xs>%KV?0*>;#Gz5NLAD4+HUyj=67
zhefz5A(uK&I#moJ+~fyG?RU9=seP)s0;cw<q5|gBr&=xiShgVf;{~blXut65B8FUV
zlyu5IPdXs*rV}2cnLbatU-+-I{L|-2nR3Igfc)X8|1^~n63(eV<p2NK`xZE>s_Osi
zTt!sCQBm<djHsxn0}KdCI`Ys_K}SKw=gcq+4;^5HK|oPQKt)Bx!X#6}q(mbnAB9DU
zW=V!dN{VGV6&95l6{Wwj`mc4)TIYP{oVD*g=guYb^KXCPu6@6E?X|vp?Z???pMCE*
zKC34Ek@DF*4xHaVy`u_rV8PlarCk-{K!fa)E)`qLli9i{m#xi3<W+GPM<$c`VlrL}
za`Bogwr)sft09-Ibz<xKWVY&a+3N1yAZ0SeuvJ$?TPurb>qD_sjJ?g_NBDiBHCgP(
z<%<1cv2~rxR{MR@I)^Q9pY$!U)zNn3bwh8ypisJ-c?I)R_>9s&w3Vgj0^#u_-YMmw
zH(ttaVgue~$J?vor+csJb%^&#7m41>tQWm@8vCScM87}llilb(>09#o>z2L9K56G8
zSt*mrw@+G4I+dckD^HsF=ehSBZB#RoinofbDwnOrJG9#vFE6ntO+K^9_BM#UN3tfj
z)4FYFZ*O7Nwzq-oab3%fq8Cc@Y<|(T=QszwD(*u~V(W@_eMr||{xvRpF|NP-y>`C-
zu8^|44&=nx8o|!<kW8kI<Oac}vX6M%MERcJXq&2Yt+0?u_FH*0y-<4B7vA&WYQa9s
zSTH`?*RA9xSXxrmDoM3f%H5Q!+*R>%s|)bQ*Y>Sa?ilt*@tI#T(Ocv4Q0c;hkkX&{
zg+2?{fTMJndW%c8Ge~q#6y5nHGd(-}*%<jO>VrRPc9a`LpDmKl_HNg96hpi>`8UKu
z?oF8cIw|Y@Vg<!tx!+NeePRcXefZpFo9Nz3<+!av-ID86m2DpARe*jxnDzX=6t1`F
zsk>LSv%hAl7Ts`<-G2s9MMcNUXV>$X4ElyYcedN#%{FA)-vkn8>aoMA*b1@H!s9To
zp|O#%^ZpLqs)y2Z=5AH=Febc<@vZoMcdOXBl+1AA{=DO{Ue@3Dq<S*eL$G1~N0~7s
z`v^AFo(qO|YkzI3-J#p0Q@S-*cdMhbyyi-;&iB7S>|Q0lcw8(MY=>xH;Cnqi5%U+Q
zB=v=ADz`z(eT8lLZH8;m$oMZg)h1Tu-76n>92?1GF5?%BxyM1)<lYc3^R}t!W{;Yy
zB2z``W2Nke?fAEAbGhN9;{p|A#A7L4idb_0yH9NBcnt3)>B{-r_Wf_2=yL4*aXmE{
zkDKMQ@Lp$z_Zhdd9_a7Jc}je}?q1<#Ggq?kI=O$nre{|E%^=m2^@fO^*KY0gF4uA7
zUH?VzinzU6)#Lguir5S5duK_>r11G8+gvTW*T-$rR|33-_c*qR-h#N^Y}D)AmlgbL
zNTkkVP_IJt8d<r0oi9Yav7$F6u2+wGt)e$Qt~UYoRwU%NAtApH6Y?wbZY(pIT>N-m
zuNFN|Q26JUG<ki@Yk&Fd)L0#_)+&1Uor^^8WY+U+%n59)kk5D?ip0HIjWCZ5qUVVS
zkN4!Wd_1~)3(8C;%7go8g?yHa2UFy<BmLir{&%APJJWxj3U;CYyV8G7UFd&T`p;u;
zclytt??M0flzexRd=JhzKel7Zk8D`-_B~79&SlBldMta2JX9p#7BbGa0xWrX$dZ=<
zEctT4Ql^LucMA!Vx2_o=pC3<>uhFb~0{!RfKIcCrl4Hg1PZ7!24SqjD<Y^*L7s=OD
z{(O|kvqhdm@?6Ptj9KS=kz++(MDk+E^L31MYUzKS<j0Y0kUWo5{(K_+pCtLqN%CC8
zIFHY%l5Zw?rQ~@ZriK1<;`xpD#aMq1{l8lBb46Y!vQ^|flJg~hBS~J{aoL6R{}##L
zMsktl?;v@n<nJQ+X~{1kdAH>6A-PoYytnvy$=^@%0m&~T`Jm(<BDq}hUncpm<R2mV
zsN`3Y{Ho+1C%H=UPmp|4@=ufey5v`rd`9x$BDqHL-y!*|<eww?yyRaX`8~<MNOGOz
zUn2QK$-hkU70GWP`D4kyMslO%Unlv7<liLuQ^~(Y^5>F&hh&@Ne@XIJl7E-vuO+{Q
z<ZmVady?--{(X{vl>DDa{#o+dNd8swACUY|@_#4!56S<N<i8}(jm+y6`j^Sl3;i__
zFW-qI|D_Z9m)V70_&FWtyU+{&z8vRw7r6(?Jtfc2&v-3N|1$g1OApEKPm<62(!b0>
z^l~s~D3y`yDfvT5_M-p%_HdE>oeq9~l*m3LkCFUwBr7D(KaAI3@&iZ?l>8u)gC&0=
zN&fyD{mbz4Pd>xV`BUg+sN{!}93gprc2O<)Gf18(`B5a#l6(!xb0p7ap~p!6e3BPP
z{z8(x|4;uimx#QKWUb`uNsg2Jc#@5hpGb0&<S!T5L~@Gcr;%)y{B)8tBtMhnRg&lL
z?D5a}(!b0#^fFiSyjSDxu@HU(<>%4=`SgDQ{ilE4`MH}pL+KWhx6=RH=s%y)qkow@
z=;cny-$nA%l3yb7vm%#@yjSFXA|DXBOyn0uE*JS_kt;+#Dsm-BPLGj%T=HKd`2_vv
zw@=Z_(~|!N$<>nQdo22wStIg0BG-z1UgQfRzb|r~$d^Q}7x@awA4&elB3~2v6OnI_
z+$8y*ihPUY&n5p3$u`OVQsicm?@InRB)3TZcO-u=`9F|+U-DZ?{)zr``U}Zzg8z-=
z2a^9kk^d0+Pm%v7$(!h&Aeoi?P9!@?zB9>PB)=QUE|Tv?a(Bt^L2^&YcPF{G<o6}n
zL-PBRJV5dXkvv%PWh8q_{!o&=B!4)`BP4$$$)hCShvYGmKaOOD<ol8AFZlr^2TFbr
zN&fS4T*nhh4w3vxBu|$7DJ1#+kadQW93lDBNb+|?89#&MnUWtx@+`^MkUU57qe+gD
z{P`p=ko<)tFOvKvBrlbGEy+5`k0aS2`9_ixBtMDdWXWGavPtq&Nlugel_aN2p6|71
zN`4l}*^<AS<TaANmgIGkZzXwy<mZ!IAo-g}-YofBNZu;>MI!GYd8g#>BKc{_FClri
z<nJN5RPy(d{5<{VbU(=lB)^R0gY=(c{E)~miF{b(BP1V{{7RBvmHgu*S4sW}l21zh
zX_8-;{A!ZVNd8+S*GT?5B%hW1b0nXa{0k(%C;1miu9N&rB!4LRmr1@N`3)q0Ecw?+
zZj}7%B;Szyn<9TklE2@}b$y%UJM^E^FG&7U@XaLOmHcl=Zjt=&Nd8{(e<1n3<hP3a
zv&d~E|0?+pME)Pizf1ljlK+(aze#4YKA#ejS;_B2vJ?H^nf`YcY*&)INxmz|Zjvu0
zxd;8{v=_<llHZ5qzLMXM<o@*kVETUu{pb20Nb(@b_as>^`CcRsll&1Pk0g1N<oWx|
zT>e;+$4S1g$o?cNB|nhl@sb}*@&w5bA^9oEpG>k!@<T}ull%yhr%JwB<QXK-l>8`?
zXGy+><T;WbO_IMy&HT<Md4c3FBzckKFClrU<ZDURNq!v32FW*)oFIAr4)$cpUqP}-
z@>5Apll+w=r%S$t<V?xWA~{>~SChO(^4F5QPV%iJZ;<?ak_#k%6Umz;e+$W5CBKN|
z?UKKf<YLKxn&f9Be>cg`N`5KH&q@CCB=3{_10=s7`3FgUQS!@4eo68VlUyPBM@fD~
z@?RzSnB-TH{F>ySB>9x&zfSTSl7EKeHzmJ@<hLdNEXlQ!f1c!bCI3B=-<SM4l0T6A
z4@s_<{3|4XB>5kcd{y!rN&ZCgZ;<5gv~z#>DaoHn{^um$mV6t@Ur7E}BsWX`*Cc-<
z`QMWKo#fvm`3K4Wk>pm%|C!`p=zp&C#y<S1t(5id{Ntsw!O7D0pJjtzp9t~&_T~I;
zApp6oerXRd&Sv$?Trqr)2;#rZ2EYE%{^P8-+t424cUf=u!NL!SgP#6D4*U=Y-qV2}
z>c9_k;72&{BOUnB4*VDgeq0Ryv)5j-*%<jW>+Pzv2k-MX7i2T3{YMn%$_V1W&1Q~w
z;3qinPdV_D9r!5@e3%0t;lNLG;HNwAGadLS2Y$8#KgWTOap31WaNcQ(r)=h;I7mn~
zbEyNbb>QP1c%uWK=)id=E1t66u9k)K4p%&7GrZf?KJDs-U}k$z-etWVvG_+>Z+FbX
zd8aI%vKihvi>GX+H4YMz&CGM)H#%_Maf_#H=C(LUNH)Veaq*P(Pc6ni$Yz$rFb1-j
zdmQ+^4*Y%xzRZC?<iL5SFP^d)-t~*8Y=(CL<0+fr-N1OtW_V{Xp0XL<C5)$RhIb6(
zDVyQl!+6SOcqcKQvYF@NAR*Zd?=Z$w)<3}>`yiX)oyT~}W_TAep0dHONwxnho8jHb
zc*<sYr!t<h8Q!&wr)-9IFykqk;oZ!5%4U8U2MNgrClT6zob~@wKzq>B|9uQ&Ae-Tx
z(0I!FCjw$0WHZ}h7z5eN2M(NfPU9(?`DYv?gjQF)+>52Gx4RmHNxzdrpLbp3iPljL
ze0K-FhXe2K!1s0F`#W&n&2679^``7YVmNDMy&d27`v2OS-<Lb|c~>}|vfd7{h4*&o
zALYRNIPl{fIPWyaQ#Ql9&heDZ407PS8y!zsZ)e)Vd6zn#vYFuyoOiF|DVsUNf%C3*
zJY|Dlhim^?Hp9E!@s!Q*&UZXzGrS8PPg!qA+`@T>Jf5-{-Yt)(Y-YRz=Uw!8%4RNi
z;7tyEngi#Z_jt-?co#mNvYFWqoOkEriPjr2e57|D*BZmQbk^I=x9srlemrIUZ_2m(
z;119JLWe#-4TvXNpEz)SQV>tHK5^ju1R<WX8GfP=Pua{;2hL9%;whWqClK+J&F~Y6
zc*+L9X4w9-tbdxiJxK4endJ^U{6r(3vY8bQ{80zKGKN3m-N$`3hO@V<_oSq~-?Llz
z{VIq4*Bm%MS&64?hM%&;Q#Qj-T;eI~J%O=sej*c3+00r8&QEOOiPl#RoS*2#Q#SY&
z%J!epy33)z-huNIp?Jz>e(b>cX;D07GyL=@p0XK!niNmj3_n?lCt9aDaDM6(Pqa>R
z;F}#dKb?xFZ02_koS$07Q#Qj-u-d297x4Q($8bio-cv5lwNKd$Kk<sEY=)nH#ZxxJ
zPs8Gg)^!ftds-GNkj<3vE_y6wGdnr(&JKJx2j0zr@8Q6^JMeuS`2G(3AO~LN!1?K2
zJkdJMf%8+nc*<t@312*AGyJqKp0b&K4t#(E=O=>kl=YqtTKGv0{ZkzHa0h;x13$xo
z^HaunqV<>q=ckYHMC&mJ&QB%diPmEdoS#<4Q#Qj-F5@YiX>{QHL^GbU8GgDMPua{=
z2hLAD<0+eIap1EYI6oPUr)-9wlExG5^EhyRdKyo(zH;FFR5hNm8GgbVPqfeD!1?KG
zJkdUn1HZ?C^Ap<ksf%|XcV7%=t*rMHx4r%<?>_De4t;*o8&6s9sjr29$)W$S1Lvp2
z@kIMY4xFDJ#}n-rIdFce98a`g<iPo9b3D<0kpt(a(D6j;83+EN1Lr5z@kIMY4xFE0
z#}n-rIdFcm9Z$4h<iPo<cRXdiC*bYzCU0xF&7sdv$>S-T;V0(tl+FCcf%B8}c*<t@
zsd_xo`ow|r6Zd$c{Ury^Pvhf>)+Y{}pVY@wHsd|Dk9|Pv5ZZc*Ct8QZ@E)JzO{#4H
zu9=+#*Y_&Fx763)Pt5Nq@(scDNuA>V5L};7?IilI2<}Z2gsJ|Y1@9z!>UWLc2MMnF
zzZHC!2woxldkU_8+eE)>M8BKpA0E-?w^{G>gM0uYo7q+A0m}Ma9e8OBKd}cF-7|(W
zn)Oama4t-pr*nR9hyFe>e4KYb*dvCs6?z`(zz=lbd}<?}vKc<L5l`6+pWuk6Y=%#B
z#8WnNqyz8cz>js{eI0mz2R_h&4|d=~95|mMiKlF4r~@D2!1<&}Jkfrg10UtUYaIA!
z2Y$W-ztDkS;=uVdOFYr~(1ABPa6a)8PqaRC;CvD$p0XJ}6%$XiK6K!GS|*;d89q4^
zPqaRC;H?gvPuIi~tq&bIpSp=By1vBl<@?j_d5O-B;qUxa(u7?aH<9T?6LWcq&bIz{
zH&|^hO_-&|RcACkYAr9(*;f8m3hDpxD%*a81ApyQTmMZuicwzDC1ARj<o3Ip&xZ1e
zBR{o@oOZBnryCt{C@<+ITA56l<j$GHxL&2?Z?e#5-*xc3$ANbzV&x^>1N(bQu5Jk9
z-lXdx8mUKzGfs^lN%8e`)S$d1Jb$A2cRc%gwF`gKZPRY7AD%x^PlKs(%S-fXM`zN+
zPhTQdUUI0q4gMxho2P$RfNM>5^Z1A7Pn6GZ&SyJE2Kv1vw~#_vUZPj`@b9-Q@$|#<
zCu(uSNvt29KT-RGsH){9ePi}_AV*fe9XXTrD+7HBua`<_KeN2#_yGTu<Qk_jenNn6
zlH9NpZTpW=0Lx3XG@X4E{cTN*hv!dp9nsm-KP9lQ`XfC3VF9lCdtS|UMg;f{l6%IB
zKXnR8I+7QVYI(`&3J2f8T3*fgnK68KT3D5rj0$iaICt#M_}MZ1X^KO6$vFZ3pyVDs
z*N)F_RKfC+F@e6$AoV*lPK_@~+kFReSza<$;ov0M9IroI6yUc=?r&73@{&sfT<za{
zJLBQGl+mKmj})wa@}oOge_UWkTWF`x@O;9j7X4Hs@@8-TX;hfj#(vsZ&UPjSxc1wt
zJv=<eLc`Web;q#&lt6zU$#wGZ<^b<0xvpOSoDtyjCD;EdyIwC)D9cOeLrD({(f(Z-
zr%6uI8j;u2JYdCV*)=xa$$^jC$<}|OmHp0Dw;8>3bi0mmdXc2-{UO&g-m0+wTRrsd
z)!P`K7vTB?w+D5R@{$_^oM?FI7t|!>B?|-mMajKQRIK{$KY;bgi6pi2OatT8StRW$
z@m$-V@w*fb{-(-cPk%{(tKSt~zr82G)&9$kZ0Ftp*C+0O8Or$m0j~O^JpE+>uJ+%c
zsi(Z;p#WF?m&Y^y<p5Xx+XgcJNPw&UC{I5;Kco7OP`%4b9*^liGmh~m0$lZZB$k&v
z9pGwzu&2K|z*YY{G{uycd@I0J{}&S&|4x9be*e*oKNsMtUq6xY7Xn=MTWBDcm*~52
z{ZsGR56{o2#&5}BdCALx9ksvsV#YTFxauFdE90*PxJGL5d5pgv;N_C5J(2M@1N<|R
zyP2lW@{+d#{AB5G4PO6$C&0C*4!eN$e;MGFqCbT$QROA?2DsXP+q1tV!1W3JKhI$O
z-v{^sVrL;Oxyno44{+^~<=*`KrvTR;{G#V~TYxLGUwU!)Ai&p3?s}Rq%S-+q;Lk|z
z+3t-0Gr(s_?j3I)3#Q-9t%83rkM*;{n!YC@`1P|H56{mizW?ovhv#Q#czS7^cU|Zb
z*cmMNd7tL%0-sv<6Llvqop1o#3D4DN!QRx+w4T(r!Aa;>dNQt~JouUR%u{_B56{)?
zBla)y@bFv>75CE9Q&~SeS2IKKy{}}vEb!Y;@L%^}JUk~eQSi%dVEphvzeMnv-u$ey
ztp9y&{^%obem*MD-&^#*?ajk|0{lkF&2!AR&kkU};rW?|M8C0;@$meN+L<(p@$mf2
zgQEZbFvi34GYbTtTg7;Ien#z79MAYkq9uRlfa-7-RlK|;JU^rQJCbI3$?%wd!?}!y
z=Vum)#-`DXpAqQaB)R>(`7Jy@qdcGO#QHUXzWP0R5#u^K={wt^afdgK!t*m5CH_Zy
z^M81LMrW?RyRn^10{i_%|4?tdTo&LuLp?$Rt-K^WKl7^Suk`qg5A<&oe496p!t*or
zf={CbTh9{yR)wE*ygYOl<NPfTKhf~?(tG=}-^&C0nz^PY<4yWD7)LLbF&>_`(REju
zryriT*-Py2?2V)Fyp4{p(MPkL@Vw2wqQBC^!}B&|)=QUo<L<hE&wRlr@5gp-2yne#
zbUl*s`2oJC=zlbwaqS)9{c?>Lhw%K2^8ednjvIdq#!syxpE!!`gy(9?1pl2k?}g`T
zXj=BtH;DkPTVj0X4`O^tfNMNY9L{)nu14|8PGdYgSEKl3B24R<zz%h9FU|A%VR){F
zrcE!syF2SY5a`oo$V)%pgYjhnuKKr^GXBK?*Z3Uk@n0U`%ICoyS^vuceyG^*@7WK}
z)$|hlEKmQ@K)+1zdrx3HD+65Z^KUShmpm5Wy+wap3*+HA849D99-YDXQ-Qv=ONrO7
z!gDg4ME~NmSpS=Weiy+%-^BQu0PiaJ)80J!od8$;KVHH5YXe;MpPa*ZcuqzY-tyx4
zg1!y*;rAQC`ri-mUB&MS)r_x;;r#b8%1d4faP7dyd+okHhHvub=kT1&^J4$0o!L%!
zPDcAxHxCcb$s8{FJA3^zJSU_2!@PD3&&hmV^iLVa_J11iQT=;qqNDX#fR7gamYWz4
z&&ix3_^IAF<!`9@N$0(PdGkYfent)c?hv-KS>Fcp+hPw7&(CN-uk*(H?*e_D$2xg<
zcz&j*_<wW?+Yisr%olv(SjPVn*inl=rw&tI5}uP;Bl;&_W8XJj(#rbb`59e5R9(w>
zcz#CL32%Apitzl5;-eR^et3T7Bw_Zw3mFg3&*;4ROg-b_`I#4m=i!d^#*5y%B0N{4
zcJ8{A?S$uQb``%<`ZFG$t5N+uJpJ%ojru+BOx6$2)u{fLY8emD)#%D^*-*y!*Kh^*
zkB52s;kg>Mzu;unFN^7a=`zN{b2X|zXdvU^xf<njn5Q3}t5JPkQIwa2=W0~{u1gpX
z&()|t&nvV}i}BgR(+|(psQwk+`X@YBqxPSvV>>4Xc2vLZT*kw5HL5?@YxnS6jq3NL
zfkx}Jz)qm=**`77RsU{Mpmkb+tN!j6GajC+QT?CLgiq_VK!2t5w{vNv(>g7{%LSk3
z&12!Y8d~;viBC9`mxSkPbOpJY1}3f30z0>e{y)9zQFyMVQu^odgIPa3SEKg%337Q!
zc&_Fm(cfIfczCYnbiw<3<2^iAbD#Kq&$Az%tGQS3yF5HRSMzJZ|KY_UJXiCQ;759K
zn-$dSdBJ;l*M+MCoR*zlx`i%G<t5>{np*|GeIDbjf&N2+cc0C8c&<kAV{T+TJXb@*
z(@Q&h^Y$%)9jcC(K6@vxulO6pe$sjSYx}XC@Vt$LEpw7LKZoaSg7v_`tRJ4Y(Rur+
zBN-3R+vvP~k%!+C@aZZ3&-Lc*djoui;LkL(o%;j4pWwImV4QoGpC*dzd;{YT1-ND&
z_U7mC{EW`S_g&BW535?R|8~Vij6V|K^CS>2Ij##+2C#m3u0~g8dwKJ4c&<k6>@$k>
z!*exX6#MrLV>~=pqbuyAsu&N?)m$(7Z+r7zc&<kAkLYvSM+*2W{shH|_K{-v9^U*D
zo~zN7`c0!*|HVMRRs6o_%|GF}8ofifq7&<f=W5jNTJL%no~yZA?C|&5X&))Dze(Eh
zuim;PJXiCw;BC9Iet52iE?ZuD<_5;Yb2YCEei99|@{+d$`>zVV@p8t)^E11OM#EAb
z7yJ!+KedY7-O~@x)l`Xo{Uo;Yo521fQu11lXLzn=o@n%>_A;L*QbkI|7mE7%Y(G4Q
zbA`n14qD$@`iG3M@im><&enkE5OMO=vl$Q1?VKn0qazs)&+SYVzsH?#+rRWw*5}#S
zPw$FcKAG|GJkMtZU+={&JkLYZl$Qp1`r&yV)xY}`wo?+c%Q2!~J(TgC0{l;cAHZ>z
zJc{pD+4wWm|1JHwXR!V7e9MVqY>3AvJl~>x{&70%hv!>Vf6+mV?-lUeTjDw6ZtibS
z26(I3pX``tUcTDqdFgbvAD(;prr1B`K*q!KEw_sO2{ZwgmxSjxJ{0}=v@o#x=YVdk
zAD)NN>&v*~7!S|G>?!u2oyK^09_D(f;Y6<=hUa1Q3i=~Q{P&`9LC;%*_|Wv?rFT3&
z;rSU_rg~|t*Pp|4GQ$Kv$Lr7GIhmo-Q=f47y~(p5o}al&>~#MW^9j$->>zPFg8N(0
z`$d_=wh^o!o~!wa+Hv&Ht`2-JuV01daA;ZUrQK`n{%{rb6M8-y#7)P=^<IA%8sKz!
z^3r4dSbs!->pI~Y&u@4Rhr;5e<wvl7cn;@E!Ee5Y`}6aG9a^q<=~T~tcs@tt`TfJ$
zPIx|trZq23>dSa|K1cN{J-^}k9J+ja>2*&(JfB0C8!yd2jO~QybLs^Dp*QaMS4#Xu
zVf4~r6|5hg+i4VhPtVS{K!1whPkH^nF~Fw_eyLZl@Z3(F;E#Nk<HNsv;wSa{Z_jUd
zo=5$@=lKoK^QhlDJpJ%IkNQ2X7xNF#^HA8mG;s<0<zG|rlluMEv8*4S^Ep*M-*_nF
z;W;0=9rIG1ryrj4q05bzZt(QOb3W?#>Cdp=_hNp#dUnF|KkD~z&rW#$NBurQ6Kr`&
zc>YKIUh3KZbYQ<!_<Z%#?3aIO$4`oXbQj|f1o$BNeEQ9duL*FC&jX7Y=T%C3JMZ7g
z_*Y|ijc5Ps0bVBMhI#tW#_+#-<K=q+u70=N#P-((xQ?S=&;;JIgnxC%PpbbLkN+z%
z`~<JRZ4B@-DfjL|w!^>1<0rM#!{fuh#^a|lkr#M=+X7tm*LwYmf0@TmWg>rd3)}x~
zfUABtPoICK$4_M<uk`rvFZTFJ^{+1DcBh*{Njr(0<@IyAnUl1a$mzXVpC$uI^wvwi
zp2>KnyrbW=liZ{W8Q0l`eqUAQ^KV?qc>K9iPw##w{#@xE57*Ut_`J1m8QY2PZy)LL
zjPIj<&f^*1N8QKc8Q;H};PH&#AHC+SH{$n4eQAQV*1g~I_{7&I57WeAtt-}g@sF=7
zBz)ffDX&#O`nR97-MA$Y*Xs%6Q$U}VCthNlpL(dBG9UKrHv?V`IO@}FoR`?nm7uR3
zjW5|V2-lvpyRYuqZvp+C1&``$zhnETPnTIQMe9Y=d4SIX`xSum(;2PrE`Xzc5<UyT
zPFJxL<xkzjOUx7PW4(}1e~11_fTKPwAH2l&5kCiTjN3-Q7XkmH0bdIE@eZ6W%U)u?
zUjY5x1m`$BNO*U7ul-GNy+5MMxR;`KT>TmQ5B76xN5uC8``G`L7yCthY%kQucHyTy
z+J9XAU)K?A|54DV>EBC?e+BRd1V4%-KNV8@UlyG8zY6%*0LS*_G02JaaXjktaK^FS
z`?4}6#*t^OhsN#P065RC%JWIU(Qg&tXn#KkPk}u?Pl0_LzmEWZ7TCvlo+miR^J&n(
z6!bBkbUF1B#{uK{AmCW9?*fkTBv)QyJKq4mF8(#3kNhtXJjx&21^M3&c98#Oz>$9^
zA<8^m{GUm{|Gzo@-%7xLd&mEMNBm0@#Q)m~`2RP@|JhGC|K~p8{J;AN=l{J=IR6(v
z;rxH_3FrUAPdNXVKY{#vIj(oQ-sklOt^;ZN#7m6h`b6&|80XVFy3W)c2F7u{q|X7O
z>*ryfb$=a;>!phU$Mq7f+kXsxX?w{_>=)NdBLK&G>CQ&9Ubx;y{<=>V<zEH%k^fl0
zk^e-%`4p4Jjkd466y=ZimB_!G%5sYG|4+uBPg^N}SNt)a*ne=Hk2r1Hdx`6X^>xKz
z7e^d=fgQB(>gS6c`bRqO;eaDgT<4=-mz|+t2leX!NBi9WI7QnX`#IXV%vX=;&jK9n
z<NZF`IR*3)cimspHlCNF?TGtAXh+9aRR3VGgZet3MD?-%pnflhol$^e9PR>qd)PSw
z?7Q}7eo1{>_d#%fhH>r37$3Cr-?l$<DAX7CXK-9#{IMV6K1KuB!FIv^iFR-v#`#?D
z(|J7ok>aWI7|zc)pVKz5m$<*-eEtC7X#Y!sN3R!O1%0%?4sf)O`v6$q-o%*`^TGJ&
z`7g#%Uw7si$LpgjZsSOg6YFEWCVMFT?G2I`w<`r_eXQ49z_DH$pQ!znq92Xh*TD|j
ze-&`F-wWb{aX1xlj2rLGa$-KH&tr-c<4NN7zy9Vw@A&_%zq!_9!=e9Rf4d5B>~Hr2
z{{KUN+X?E6aX12SjGKPrDLPK|TwZjX;`$1&3-mbAORSIcTb&Qb=C?_Lvp&v0GXTf=
z=L>+NeSKaKo!=e<eYF2^T^IfrH-8>Wdp-SM-2N9goCmh|`VH^<aDKZ4<`bNMbp0G%
zztOP>FGc4!JsH9{*6WL)kM<uCJUYL94fJt-`vKr+zbnlDcwIOSaJ(+m1CIK927nXu
z$Lr~E5A|`38}2({y~c@tG;WuJ9jq7L|6;u!1bwu>0_?9O&U!zx3iQ#w>$<Qr)EDD$
zB;XjgivdUdd4OZwaK8@YhWh|muX?B#-Y@8VM6|!PKz%W8%K%6F4}*P-+vA{*aeEPP
zwEw?#h(B-tx2;2th4#Y!R;>A<m%~2Z@8h^w0{S?Pz7II+<9;maPjKkp3^>;J1;EjM
zKfqBR=O5I^^DW2+=V8>ZaM<4-@xlEoeZEja{&%DoYafhp-3P<{BD6D9__H1U_NdyS
z<M3Wme7wBZa~+DSeb;`P3oq6=s9l8@&y!csoUGS{y#SvAxYjSKpZ468O#j|>6aBjC
z+s(m8_br*vG~ihV`o%iOxF<DQnsbb(kMYFo!hygO<9rz4cy18K3!eAe#i75m;N0I_
ze0U9`?cUX)kL`<muwKZgzk|<7fTRBD4*VRzF>V_H$Mr)M;7g%ixUN9_IMBy&jq}4`
z3ZC|R?Qa}U#&!I<<_A}QF4p)}UL75emq8qGe#U)Q{+6`%llws**GtO<=XET92T1jG
z-<5gddg&Wr2ix}vnIKpn`TQDiZ1=uk2YKo~eALbjppVz7Cjm#lRe+;?yk9_lq3O+U
z)er|9zx*9Xjn7$NALDtR;2h7>K_8!QVmxmFI~dOg0Y{$S1svmv{LcixF8(!O2l?yu
zF3KO<1^MIiP2|5B>?41?|8?=_Z{KU2UHt!><9~Jn{@XkL?>pk3<Q(HU3Hbjv$De<V
z;gj5d&ijP(zu*(j|H4l=|BFB2{4f24^XFe{`6SOj^`Aigy&Ts&UGMXH64!zFJPy|<
zdLP01{OdZ}j+I~^*GqctD7t>e`xjg<;eIl%mvFzGf4xWj;`$2LOCx{}*6T1?2r_@H
z7p}LFzn-&-@~;B>$RE!$Apb_tp9uVK1RVL}eI@dDJvaYP#(y&Kcf}v$iE*xj`XYWU
z;8<T*9FBLiW7>XxC-_A^M>_D~fFn<gLlQef!4B%z0gm>$|8a`;TkPj($94ZZ%QxfM
zLHl^Wk9JN0eZ=wk1>(4miuQ3|2=#S*alKIgV259wPonxAImd{8?{fI<<-kV)p2W@(
zpzqqBxr)Y@?t|d|4C6XqV|>ugPGJ8E8Y4PSeq8%AhXNnhIYx{d_CwsqXaGCdf3Sa|
z9h`@8KG*wn9#8zMXd0i1U?1mm+_%U1d>QDY{f7mQUN0U8eYF1);AlVVnBVaFh4Hz-
zp|8KQ#p4C9FRr+a13p-<$%04Yb|vUzz2*Xr^?D3&wEr~N$9=YMgFf2d1UTBq_+URd
z4dR1wn*%uNF9SSD-2T_!{O6(nzx6l$We*--*ndVq|H1yo&l)&I^&bHI|A+oo0`<kX
z;W=cC8~^^Q6}M{v$G8pk)nn_NB<C3My0AUYG2;A&^C8Y}uJbAxs4vD1?+Y+)V;uVW
z%k9zY!vEst&tw0Kn;(b&^|!*#`E2jF;e8*jdoO``57$?^evYo+a9;)IpN^bk#QE)O
zzz6OB0B~HtZSV7V!@)1c4fmZeZn_?h#_e*jgZ0AuU#!=IppW+P93#eU73iaV*L7hB
z$2^bg6TB{*=g^-EI9^Y2zYgPu`v6$4df^|9o8Cw8bqDL!0`<kXEdw0wr@ha55$vG-
ze*=!!)1D9qjN53yQU7YdF>e36o)&gJJr3Fh`&$LX8RLI0;MiUZ07v~^4*NLoq5e|P
zNBb`Uj{3MCi~18B`ZoiP^?d<ww2$W)Q6J|Y)V~MpARnBEQ6JA0pncpALH#8T``-r~
z^$!!gge3l+9>xvNap^uA>+`R{>$x?a6FBjFg6Ftibl|T7j_0+03OLRWzjWZ8m<T2I
zi{t&r9_r&$sI2ZUp?&1}cd(B*pS|S7_K{~-z>(+P4txmU$Wwn|I~q6rh3Y7-zo;C=
zE3+QW7*GABXx2xb!$BYMI>0dw`U|&g2jegU^wG{W4*W}iV;r9I>3jS?PqEVW8V~J)
z_#BAmeV~7x1IP1(4}kt^@cRY8b$^oU%YT(X`8?pz$8(9ezd9fEmx7%`0Z08AfTMm|
z`#LU}KmRoZ<$omD$9dog!AUjK2gb{>fDZ!vB*2dW{4~Ii1zgV&v3)+<rhIfCfN{R2
zC_WDC^aWhk$*kWGa9y`B-XCy%p2c`2;5UK&0f6gsDApecxL$V{KOXRh#16;#QTkB%
z{}Ax60KN%u{;LzJFK~wKA5Hf0`3irgc&R9M7O8l5d9UrRcn`s~oZ@2y*K&%N39jW7
z?<KfCKT>>w;95@cDS~S`#r1mDTRvC3Qr`E8;P=aWEvNe0ep*iPD$ySlu`^uW>vJ2`
z*Y?nIieDr8T2ApA!K+0ouJIfh!M`H!wVdiN5nRhDUMKiik&2I(_j+Hc`0Ik#MfATa
z@3oxjHw!)~qTeF#n<Drh<-L|uJG!3Ga*DT#{_KdI1@eAw1YaocTO;@)d9UTv{$jzk
zoZ=c!EvNWW(bsZ{-zT`1Q+%1=T2Arhf@?X&R|u}<6kjR0mQ#F{;95@crv%q>imw)2
z%PGD_a4o0!TEVrP;x7oU<rE)Fa}B4p-fK9|te5v%PW3kkzAmD_QQm7g)#tg4la^Eb
zEg#NkImO!q-y~A;&GKH$DLzT;YdOW=6MZeG_*TKUh*W%=yw`Gy>+eDAFQ4y760fJn
z1CH0zE`X!H>-wA4zCL$mp15v52K?f>eVE{^|22A1e)B*d*L$}J&ie*WkiK50@VWex
zfPWtB;5tzIEyoS*f5Tz_S+Ilq60ZP`_V<wXXZyIG>?-<1v0Z!)0z1g(WYEX>?CQWZ
z{_OYb5QoFTK3?C?1^gSJKiPpd3m)aK*FE-&aX1j{pkF+Pz<-@e+p!zy<NXn?Gci88
z-ebSG{y!b;Abt+u$P@1iu)Xv;!}ga_n<~%l(7tPcKR$;-ef)k0>g!*QWBcC*JIx$m
zN{k~Pfju1WFLnez&w(Ajm*>QG5PutR^!qo!QU4?dAKYia{)6#He5J?6=fi&;OyjxP
zf$Ml@{@(}v&w@VxH8HjGFyL6PO2E;M&bQI{;Qss%!2U>x58C1HVsm0U=yx07*p7R7
z+Wzl8;XHPL;A{uy8C|zBj`7rW9OD?zpMxF5cNUzg)NY?-KhVc<R|fhxpI3lBj-z7P
z@8hsP0C41q^Wl%Ea@|Ew<H_}9e7xXCid1}vyw`rh_&xNZ*CV}u<T#_>v%n6<=Q6=r
zALE1Vcm?$h?YIAJ{4aL!ZvY(m<Gvrp$5k)wZyJAXmtJCDacvj8-^X@21^A%fYOsUt
zG8Xi)T_ysK_1YcmV87DqtnyU;u70K0FV;u?r-EPPKMMRJ|4Tt1`8NWN{9Wy`C)me&
z;l3-57aSLiYr9l|9jw=Rzz6Gf3Fu?Jnm`}xbq(NHum3jwlYuAlzY=id-wHU!2geKl
zwMw1GdWb&vAI3HQx?jgQ#($v0{-?kW#$WqebiUH|VjTH@Ts+T!dSRT;1sr+S1CDXV
z{)2HY7yW3QUGtCLzi@oezVc){7-xJQiu|$vApehx=LHZq<ca&w$a5;_V;r!b@LyB4
z`ZMGIP5t>l$y57Dbli2MKO_HgX&3H?80Y_n{`{ZhS*-rd?Zk=W*+wtgpZE6A5ZC^!
z*HbQs_qiH>#&I0sctQKPj%8f!A1!{P_I14xwLcW}ah&cZc(h))&OyKZzz){yM8L6L
zIFDhyG(PHA>opkcpnY8Lq5T@r$9i%7IkEkB>BVX<#?`O#iN-TYd!c=7FSNfs+6(<+
zd!gTsv=`df_-H&eZpCV^Qm?f#-tG5vx<AsS>mP<@0$wHx4BZ8IZ@@ndxZbxi^clbh
zf&LP}s{p?naJ|1^=(B)pKV;}0!1ca^q0a$cNAEc?bT8nOJk-ZO4|p@+_W?c|aQ)3&
zhA?gqfqoh2e+lp^z?TD#_5Cv7qVDm3kZ|?a8SF5wcJ*^Mu^H@?fxiCc2}4zYzYF@v
z=Qn_hy2pplW~e{p!?@bj&)LMz+^Hp%iDX>=mODdL{6dNG&Y+Kcb_0Bpr|s+S0ywr~
z7r;f`v%eGJ$`AST?{q0%3icVVlK1*K^L!8V%j9##tK@xez}c_zu882OkAC+ceNE_h
zFTl%0f&Cs0IQs1aIQl&X@IhebSiq|QKMwF}z$*Z+0lY8ZV*&36cpc#V0oOQjy($53
z2K@nm&jx%T;25_P0WSmnPXS&9_z=LczPe{Cs-9q;{5wwSuQS+Tyh`5d=d3>)?3c;s
zj9(3S72tXXh9Ts04d{!y*UzsaT>T**#;ZgT``Zt}j+SFS>j5v5a*U_FE-VK-gTT(q
zfL8%ttn0!uuwMuEUDt&NK_B~@>$>no(8qZ4`brbV^BKU)M1kY^65zc7|1RJafPW8g
zjORMQt3dzjfMfqjd!79j*r@~iu6RBR`bpxs7W6TmmvfLLVLY20`1ZIiqu=duoyGcg
zgE*ky-5vNVfR{;}I5ZmouLAtXfMb7n74S)*{~F-fjvE0Nb#MOR{Y>TE8SMNSaIEiN
z0M~NNpYbXwUnY|AZJ^&ff>+7=3c%T~)@M)zSACUipZTkPHRv<0ddTy?VV#3~K8gJw
z`TvCCtf@>g+%9hbUIq9jz_GpF1YFd;{`orL>aR1{`5WNaKN(klT8{a!9Sh$c^8@<*
zDf!h@CK=}Q7T{HY{~U0P&)a~Dx)&ebM^b+npAP}Y_%N>iv>fwcI~KmZ`{z64S5ui}
zn9nZ&uLAs+fMa}q1-Pht@o6Jm>xuFCJKz`}#?_yeV?J!h!nb#PHj`gXWs+e&zXrSt
z@ZSKA@!0~nsC)6@{SB=r#^)ozF+Pl|KP|_6*p7v7kMUJT{y33K@4xqkUMeNScveA@
zHGu1$7(=rG?<9E^ivZVW`V6fATw}%1M!<KGJd3S>>)s|qJ95A%F;Crl<o7)Q*JtmH
z_W`^s1Cpu$@1`KhF@WncT>e<Uzs7#GO&MPd`g<@SX*uA!hshtU23*f_Fuope-D_mL
z4RGBnW_%mq`!FC$_ZFC^_A&mb7Xy@7=-E7eKN4`=dt|%?@B<l;v>I?dd&VE>JrsYe
zdx?y<f&L*3NaD2(Cl+O#k<?i_ALBh0BzYj<<$zZJekkDjeGs<O3-Ga^uX~dGaTDNr
z=8f@Iz>i=+(mKF<D@gJ!!1b9vfBX^PM}dB+3@YZSd%XPdNWlAmejVV)0KO1#-E-!T
zmjiwr=&uI60`T>K_XWHSaNQH;k3RxjpB*sXV<&#~+gIlneqRH)K5J%tCE$7nmGO0e
z4`M*lTY&2xGJo_T;3udu$?h^qah&y81Aklvxb8_aJ_c}o_RaW0z)xa8(tUvI*-QRt
z1K?Gn%VIO&rvTnVCQar!6!1QP4+Fdo@Zo^B06qfn6@Z@#_!_`Z1AHss)qw9PlQ{D{
z9q>Vb>oZFJcqHIwf_^LDBLQCmxSlcKkJkZy7U;hP_}PG$%0-2F>a~nN?ghA>?PPo`
z;O8<RsR{7W3X)s~_!z*S0$k6u@W)#KKOgkF%SDcP>N7|FcnIKQLBAF73jtpbxSko{
zk2}l7lI>p%`ojUg1n`A`>)9dxcpc!Ef&Pwi(PjJkte-#b19%++lEwmFuOP{VfR6)w
zHQ)_^Zw7ok;H7f0XFiR94*`4v;4Oep1bijnlK|fc_+-Gh0)9E*JIW%1`CI{b55SuM
z?*sT0z^ehD3ix=yrvZK+;CiNrKVAd)4A6fI@D{+g0zMP)F0x4CdR+y0Z@^~(-U7I;
zA^GFAfX@N_F0$BS`&R=#7Vv8TUk><Oz_$W^E#O0B(Z=?#1AHOi*8{#0@K(UfWRb^q
zZUDRq@Ogl*27Er?JIbPv?JNMi3h)~Np9J_#fG-97X24eiz7X)ufZqamsVqjB&#izD
z0sJ<=#{#|x@Fu`-2fP*VI{;q-_?>{S0DLjvF93cQ;BA0^8t{(*{|w-jvdHH8-VJy)
z;GYG2JmB{Lz6kKo0lp0IdjVeq_~!xN0{DG^@3@cuhI!r(cn`oI0K5<2UjV!c@MVCH
z0sKM0CjtINz!wAl5a7!JUk><cz`q3edceO7cpKmk1HKLL6@Yi%*MGzDc?9qS0sji%
zg8=_3;B|mM2KYk29|wFr;Hv;{1N>`%Zv*@Zz&p#$8}ok>@B;yV3h)ZRp9Xw5;9m!P
zEa2Y&yb18tfVTqv4B$%u|0dvX0sbw(w*tNf@Y4PKH(cLu1Ktbp?*QHe__Khw0=^dT
z6@Whn_zQqP5BMg)zYF+#fWH8^-c&RH?*V?`{{9=rzYq8zz+VKs8Sozfz6tP`0N)1q
z4*~Cdfd7X5t_Qpq;4cGS1^6p~Hv#@5z*_;|0QggY{}}LffWHd(M}WTuc<F)u8|J?e
z@Zo^}1n{wdzYh2!z~2CT8Q_}$-w61dfNuf(r+^=LkpG5x{tWO6z~2IVJm5bEd^X^3
z1HKaQcK}}tcpKo`0RIKxoe%ckFwb8CJ_PVz0bT?6X22H!{x0B40sl4N>jD1_;BA0!
z0lfPm{u}1`Tfm0^{yV_O1O9u!R{;JV;M)NI1K<^9{u}oDKHyD&{}J$2fNuqSE8u?u
zyiZU64cq@S;9~&)3*fDQZv%W4;C}_Y4e-AK-lg1s!+t*id=TIt0zMw_{{#F!!2b^T
zM!^38_(y<$1bB}_{Wm2f{t0*=!2bn!72y8{d<@{;X1sjX4EPQ^gasA>UIO?Ffa~5e
zm)Z=t{_P~jckIQl{=Sy}rX0WT0eEMyUkUgwfY$)NE8zD5z8m0M0Pg~L<zejI=hGGN
zR=~Rfz8>)10q=2mXh;865hLRP*Y74Xz6$U?!Olm3?*(}E5nRgW*&XmDfbR`>8{qo@
z-lunHXJ5c40j|#iSaUJp`+@#i!1o8d4e$d1?{Z}5_dvi00e&#x3jjX^@Qr|%0p9DV
z(0)(An*lEed?nzA0=^dTUVv`|Tz|`&Jq|iL^m{nyj|BV(z!w1C8}K!N>)$wL%i91y
z3iM0+gno|(d<fu!0Urza34pf%ej?zD0sj=>>j6I*@DBk$1@N+CLY_kb9|`y{z$XDd
z9PpKZ>u)%F@d5l)(C>U~==U_h4+Oj#@Cv|B2YeymX8?X5;AaB95%7_KmmL@K83p(y
zfS(2UGQiIUd_CYbfNuf(9Kd(12>qT5cn`ow16~EVKFebZlK?*t^cMquKHzHrzX0&f
zfR6>dOW%;^g@9KAei7i80Ddvx3jn_a@RfjH3iw9AF9ZA|z-s~T)i2~(2lz<9>j9qx
z_&C591Kt4mO2Eehz7g<7z_$WE0q`FEL!J`>uLOJ&;F)8mH#XHD+tN6@<=EPb&Klj)
zuW#+h(}xbLsi{3>=;^g*oib{~=$cc8jp*BdT>Xs64YiYJv`lZTpK|)FvqsnU?b|S^
zetK=o^!mvyGftm1V#J8)Ge(>{r%;m(F_R62nw*xCWz&oisY$9un`9vt^G9-a@gteq
zq}JPRZ>o2}7M+nyZ83Kw`%i3a8BsH<X;z`pw5xtRnQfXpwQ)O`_86a=ns4r=>fb!G
zWkhP5xkGzA*&J8ja0T1VKZ6YLXApmAj+;5bF^3G8K~@`zYH~1}WTKwgVorE|Q}M(V
zuifZ=wIiq+wHJ+U={soV)Q0+*6DPIQHqLHnY;Ku6ZR%C@$@r!kPt=nr`b1o~O?zna
z<nGZu%XyU;G<n*LT59IT%E?nF)2K^btK5B<rkk2G3$|(3N^KUe|IVDyG;P)hqFI1R
zo8y3vn6#&_!850hZ=7CqrtQt98)*|JH#PFKV8@`n<usw4JawYeEREd3^-WFF8tPl7
zO+TI28}0q1t3mGBa=^@~d?`xZf7PlTmyTMsyN5Tg6`84N^GxSl0yAp57VJ+~m}J9G
z*0i}NodGS4O-;=O8FaK*3WM>hN^FtL>+V65r`FbARX@2Y8O@kgn`k?$#T*Hh&5ey$
z6nh{PXf#jbPiUGsV^VsmYSj+xfC8=ROkj^$ucJ;(&sD8DxN>hTz-sQ<d_Y6fv>A=b
zdaI1m+y?vhtF4_ieR4}<?UZTbi)y%UZ7tpLj!$7XHoWZi8a!jtv{_T?r_O0e7KfNw
zyTLka)@D0!##GuPC@$5G*|d2Mm_ZlW;?nGpNt@;IGrYw>ad~#osLgcXjBzukG#8g>
zXp^>_+$(_KZek$cYftkyw7U$si^Af8cB|Yso5iqf4@0n=X0e)+E!}UAn=xl<aT^1T
zwu`QNWtM0!u(AV8?XDPDER3ezPJz(^S}BjkbTo5c-;`#OJz8CS*ijrfqj74>^f|)^
z&{ZdmHM_D&tqqp#<7u=}Y%XE*^NC&m3N!>%>^c=drBFkO);0z3u|qQ~Z=1(rY*#G5
zp+pt)%%t4+O4hmirC$cCVY|lK&)IOUQ4?IVhNqwaJ<@JC-&p<`N}{e+DT*<@J;-G&
z;Y=6nT^+Xxp|cw<Y3M403Ce%K)iG<4hA4_LZHQdP3T=oY*i1Cy(~JsO!=>8*D$q&J
zrPr_&!x@N+O*_1)Y$gh?XEE3Gq>piP&k#D<_02QcMXlM@OloZ)Z^Je<4$tQmhP-3`
zU<>UoD`T#zsGZucvi7XJYuem_@wm0KTzrekx$1<FGz$5-Ca{>ZcO{+RQ#7&Nr{WDU
zX42HY19LTS!U?{RzEh~_91T*a$>hC9dwS9U=OCNxYF9{P#j^Ix;&DxDF+p6V$)-(^
z!zV=`Td2w8Y$q3=Z4#5|W|16`%xNgmHPe_%@?S0F8pLCW)+V_cJpP0+?l8yDDz2jh
z{X(y<|EZesKrBKC^G^SRg3~9(@Rq-a6xCmj4$@ISxdxD|$cE*+T*nu@_L8IkL-x?m
zZz$2w_sk?*&gr;tZ(vnyw^e7%a*qBGxfa_EF+655!ORf37ALiwpQ~Pri(oP70yI{C
zH%n-EyE7WWEYeyu#xg-GC0sbhOuGZnw@{M_*hYG5(g5cmTcE|{T(!3rk84_s3AiR)
zI2O<g@-1&;CX=(xw{VP^&e09D&*oX)rZE|tTZ-2MazFbqCYb!|j}9#y(}bnCjuP}1
zosbJ!I2KT|!d9p;N85FU8uymJhje7+81t87DE_DXgyS>ic5#}@46LnfnKXUcEIQ>p
zzP6!$M$6FSuj+ez1tnhn@e`U%{kUn<TQbKsOq()=p0u{#h|CeDM9V8agI%ymd%h~j
z<TSbEwU=ykraCoAwP=&{Ez<Wbu4tTo%rx)({EXs9wqTPsX^w1alNtwSWDB-vlcdO!
z#fj6W&1}w0;In?yG81Od@k|oanj5Fm!_KL*rtoY1l;Q`xV3T%TIN+&G<_&nk7HyIg
z@YEJ{g=lvQ?_f23!zpq5gfnH%XI=wm^I5v7{0*mqzRX~=^-j|j+vs3E8P(WA2fd2S
zmL6V(Ruev5O*E6^_s0@9Tq4VZ__*qfX;ZwfrWMz8C7bpmoG=#2yBd8(i+aVGMeb{0
zH6i234Wy$JduNS(y0x`4TIjoFwGET5sGUG(@CyyOJze;NyCJ#NSj26+!Qf`o`A?Q4
zw5o%<s77&c7u9euxKo5zx<~FiwhkE9sork2aMnmqIk#n)HHvLoW{nhP6ZSUh!!o|v
zb`d)<SS@VUuv>3{&KfB~k!Z^2g-`MsB4X0!T9C=SYpK*E)uK(3)>2LWay4`8)M+h^
z$DVf9dB=FOaiNp2J>3tSJaOu@>5U_rE>CPX*$!MKud(Se(vaG4p3SlX3@4h|Vs@ub
z8(-g2pXj$Ea?hDD%lXH1q$AsH#~nF&bR#D1ZYL)56O7GcHpM~Hu9ENKrY5T6!!}Ig
zqhO16)qRUat9joFZ{be2n-eCCm`%^hgY&b;^G)dZ$<w(41-P@>Z#Q>#_`N#(XKI$;
zRk{mV?y;KRTbd?Iw_TUlcdjSeLHD9BAU4()+PUo39^A}7F~N5L1@>9nY|v+$r_C5a
zBcyTyWlkSFWgK1S=<ALxBMS7EXM_~ln_V}rEsN~Qu2)`9MIRo;s#XD`BbV!h^-QyT
zIrmKdMo&LHU~_r{{rXA#=u?WTQL+bk{-R;K5J<EV2o{Eu6E6%ScI|<|D~y6o+9N<r
zrkR*?o?Z_ZEvbp-zPJ=(I9zC@8!m<Tk_ODX@=6^RwP?2=t-Q!$0nKOkumR2dz1{*%
z+6+5n(!r8`x~14Gi*FLH{E3=KdQk3Rkk)9SL!h0X3EnSL6n`$8Sg1+6r}12t+N2II
zyQk6cD%he;vJi{9M`v^7YELMBBvYHr8_9w#IwLtDGo^9L6uM8&Oz<|*G84RC5RqUs
zPO6<Sy?zRP$PXwAjgUL&1)H?%!|j;bWZs|`Y|$o3-FJM>uewH8e7p#3_luzPb6W8w
z;K2H3+VUDdVoF1y&1BQn=OjfoiyQ7mHtjJ!H?>ji2aYh%*7b<gHg(#uZ3aK{*svY?
z13lcCF^Nvo(62}m?E;oJHfQ-2$zqy>Uy&?wfc>7p<0rg`>)PA<6-n|(2X0#G$B~>f
zg=MZy4*goDwyHg^$=5RJJNW00?q8eEq8;<7#e^s8)6wlGbPF_|o4Fb<UUd5wJ-TYK
zzyR2tfv-r^xe{&;L~dd2m=<JGCpViVU6N9hREsvrR2B!-)=r*E^J{HA{m|H?DUB_Y
z8-mk+r`KF%a~^RnkLyUp##Gdf=}W&3J9<#<xnpV*$2|`LyNdrY0&@xp!12Wk!0eCN
zf6I3F-{0r}wX>)%)=r%{rExm_JbTmRDfC<HVXvIA-8uC&IEDVFe9ZovK4$-yZ+HLc
z`^4n!&M9}FnD{aKpYSpJAOA7?ANMi)pHs+ns+iY_kJ*3AcK4rtPMERXIpv-crhLr)
zn?7d$mv49f>HEaw?anE8pP2YD`=9VJ`yc-?`yaRc{fFBf=^oov&X`r-On24;lHWUZ
z<ZFucqeq-wfG^&Ep?b+zrOar?_eazE>cF?_(z+_NwbW0}U6n$O)BaVewkg<8Ki|*x
zsYKrd#v=zTcv~U=c00xX+%vttTfo+;y-=*Auf#Odmq12W(&#I|syPrwh}DKdt-85R
z^tl#l*iDxVGhNScx}7uKlyZ^wXSe>zXSc}yQqk;&qb27z#dJPS!C24tXeeA^E;JO|
z%dT#!7maT$#6`25=$HXCUCyaZjA>Zy9@hQ|K%$2fYS6BA#9+z|YPFr4tiS1>coQ}f
zh}^uzcJU(X@BSAtvMCJaKCj|kh*L}eiFzmfpy}E4bShDO^U&i<Y;t<~BNNV_dpf>h
zTJxL<Q(E})T98@0;}m8#{@l>+^8RWdIo-Hjn{{9}XGf3CbT&zTBI(66oiUqPU@Ym>
zk(4Bj>@*FZG?LWe3#q&#k~FxB7s({Xg7fuyS*gf9b_0Fv_j$_5uhRK_E}1U<&>ICJ
zk8Z$)en*ym+M}t-d*PD_eD1!Yc0l7*^m`s73cXO+O*DYN=F;r=>Pw-n?4eLpSGo+!
zQLBkXs+GFRQL7HSN;v8V(YKW*)1Q-Rr0zubU(yqkcZrxAyG~9w1>9{p8py0g0p{%r
z3^2{7yGP1>IX6Af1;hO(fuykpPpY3mU(;`(zr;vS<|}IZO&&jjmlyd9&YaO`6?Fcj
z_<)9%In9mqcd^xlQ<EmY@r?~vwVdA20N?A$TTC1@Byd2_himENg8#Qy2Ftpbel4Sx
z{$kp6?{8n){bWQ!+w?mjVp~RQ5p6SXubY{??GBiRw{P3xozr%Ltq)n^>I7zon9j-6
zoXUqpaLMVN`Wij3mZp~cgEDeQV!NS}F2!-9wXuU^)rP+dL}y(JtBvi(s!c&|v^I9o
zg4zUYgAufsmZnkEzFm!u+s}QA8-%G~{%YUm-*NjIpIq^$`zzXGD|Xb=Th&<DT>V%S
zZZ%hg1FPvSp}7gmdXQ$G_*Y7|%gVDTo^p2>uTB%~ugRvZlX|inrYN4m^<cW^U*4ZM
zc75xS$4c@gX`*XXjswcGyve=L*xEyhr$y>4@q6aNoaG({JZ}GE&gk~On9j6|+F>lR
zv)o~%TkQW}%@R5Dewc)2%wwldqu(bPGwdwq0=#bro}!MZ;4eDIe<T~nMG7X#o{Nm|
z{?<)!u2`GKUjoTsOyRU6)h{lSWZyfNm`4`Ah1R|!M+1t>Bw^$GJuWhH7g~GunfsTr
z+t*X)okD%;txh2aB#O(VBRxNVGbFxu3j)ehN%X1yh#Z&Sb}djOch1XiVa|fd$*i06
z@|)6`cH`XMoR`Fu-l8*)S+ycN%iTwc<t$+wT^Hc(635~?%M-^$&LY>=^W94eo$8zq
z5_PGb+@yY+NV~ed`g7PF<EGjnyE#Ijb~W(D=39{6TztdZvYe-091+f889IY~SDD^q
zeBo)%MGnKcdPB0Az+pH?5VSjJ_e~XvT!a%%%7ydQZdPo*1=-CNUun2Jf2qY0h+F~g
zkl_T3^Zce|;fxD2oQrX6ib&Nfa#@yMocr;YBNVypcIYn0zNO67SGI$@1hwO_l={fE
zBbW(lS4?-gYS)pwl=Mwkd~dnx7LKHJd!W>6Bl%YmjvcI-L7F*UGXpg<Kr@w^>93i-
z{WKS3`u0_bGV%kr<f-qmAzqOwPFit6CX+QxmHlxC4?W>??LYL<5F6D$lVPk=2zj}x
z$a{Ueqh>^Q8kouK5y8B-fAhia^4Z^sB>U0wDj(Qi{FjKLh$@jgwTCmMk@ugY@}8|o
z`HHjsn)VQV_Ro5q<-OvWqiz2+qPM3=6;c2HILh{4E&jEg*+0iP>faT=?h?N);+V@%
zr7CIMRF0Zq^KX`Nla;v0DF13IZ^du6@UN3{?0*-^C*@yev_H3{@>coU0XF|O@w=Bu
z6;b}LP<f00CL{hF%P9ZO$Jze9&Pw`a>R4pdf0oKy{yW$B{jXZeas0YbKI-4q{*^}i
zUuCranR9IZWxo5&r}FSWmC9TEYlMFV@aJ)!lz)}Me~!Vw8#ORf?Gzcmb;3X2_}hib
zTl`yvzm9W`KhH%;`HvL-s?X)GHuzsO#OB{B{CUh^iuNB@`;RgFUt{=RKHT=dxP$&L
zG5pUp{D1#6+yAl-`X6ujzt-@-+R=YjiT~(zEouCl4FA^|{$JhAuK!x`zb`gE<&*kv
zG5lX|`0q~!*;RD>w2A+-3iLnM@ZW0qKbi)p<-bD4^MM8WUtsvZ!SMf6NBwKWzpg)&
zM$-5%GW^do{O{x#|IOmR(DA>-@IT-1|BLhO__vDx-db^yN$Y=~;eUbQe;!>F2#)o?
zRpS4!0{t&H{NHH!zr#`gHt~N%f&Nz-{%<n;zjTsa|5CbMa4NL@pA!GL{^PmCyVim1
zcaZJBO#J6-|6{1Ub^TmwT>tx$U%ejcb=7tKT5Is%4|r=mPMvA<uMz%qd25%V{r40q
zZ}DGe@UJ9GN%^lg_}^-@|3@=y{>y}azV+7!RNmtMq43u@^ZMiX6#O?C{BJY(*G{wf
zw+a7E?V=yQeqBW6E&iqFkTXiNr9AULf$~Y?zghUJK9|4U;J<<{aO^31{afpi3jGO<
z#Mj^V4F7i+{@-u1{cjNeUDdJ3X#aJMpKXT!I}QIOj{3KCu>Kzz{udkmPj=LQYX|GU
z;|G4gu>J2c{CBz9j(<ir4yZ`Glr;Wb4F8`t{6Fcq{+Eh>2}8gkssHYV|IZlyuNz_4
zzfAn^8hG|IN&O#a_+Mi9f1uj-U(rGTy$t_%8~%6M+xA~2{$&~qqL8%yeGLDfHT*B!
z-S%J8LI0KFAFu!S82%qW(e_^_{vQl#ZnyuVRNm{OvR+d4g))ER_2(S=P{*U<uKBCV
zh~MW7{yULDf@AY{sob~~djD2!_`lcifAP+?|1xo0==!n7@c((k|34h_cTETDKi23!
z_Zj|YIM%Oq;{O)y5F(@FXDXGq`p+_>|6G)!|BN@{cfY}Z>zQ`@ZS7$EnvD28VEDh`
zcH4i3`W2_qz6f5U@taHKt@y1r;#W&nl8(RG2LELS{~z38^RE;Brv%LXOqBl%RNmsh
zLHN_<!Arb;8%MdM{1+JQ|3!oU4UYZeRl=W&v`bO`uK8<`5x<8F|F4wW@mnkY^WFdb
zfXZ9(>v68nT<2Mi-^3L0TWauMZt!n$@ZTW(X?v|*ipFo6gMWp=|MC?4mmB=QWbnV}
z7(4!3h5tV7*vIc*&ZF{H{Huk3g_P&`Pf5XlmBIhZ2LFtMf2j<Vo_YBHqmRvhw!yzS
z1^+b$|A!6!J3H<ltAzjjJp4->_m3-#{zJFQiRX`X2LAz6-fL@+-x+K7pAEvF>x?Pd
z|DU1qR{vQm{MSlh?mt&iKI#0o(cu565&vVl+WcE(;lBpSQ$EVSH<h>ew~qEJUMJ<5
zKRqf+%)d?eYkj%=;|Bkgtv3HE+E?dP;)~!l%HK7AZ!!F@GW>VG&h}p;{^|CjT}tYI
ztKt7^hW~-r+y0w7=>J2b|2$#%Uw@nJf3f)QO=U1e>;EE^xB5?;^q&eT%<Vsq^4cHt
zy5?%X9Y6F7;{DH)2LC;2QOOiz`#(}pZi9qHy#IHl@)rNnF@D9BC-c8C1^-fm|5FD4
zpV39#;=e)ozZfw0Gtv0JPUS8By@me@DbM^Drr>{|!T;+9|L!!YTKt#MyuvA8{CB7F
z7XJ-K{Hd!Y?mxW^{@*b8KiOdOUnTr^<;p>d#{V%YZ}Hz^#GjVRiTPI={8t<NzuDjB
zzqXrCI$!*srt%j5#pn4I?;&;P{&QCf{#6G5XAJ)R9r52F{PXqyV;%8dA^frbFG<0F
zq{0822LCUfX~%yV?F(_r7ytXIycPeN^W*WqhwLStKgSyUzh&@$vC-zgO89s8X?S(v
zmuUZgp2}PNCkcOy|Gg>rk2m<QG5G&ssLg+a5X~3=EmYp(UwT12{`aTg-)!*zw!!~2
zNBrA_f4=@d)Di#Q!XM+mECv6$2LJCE{C|A19sgDIT$oe7_^+q(R{S>@@qdWyCGGzU
z4gSv>{9hbz^It3c^Tq#pDsS=MV#NQ;Dfllj_^&ni-#F0bzgP}V<%@qSmACjW9!t(B
z_3&OZ8J_<ip?uQ#FEjW*XYfDG5&vbvKVSTZI^w@V_+$THnS%dHga7jef8G<~NJZD5
z&9ZTlFaE)vV&q1r=0djGKK_r>`=s$-ZSeoD!T-r|Hvd-PpD+H8QF*KXOcMSW|0h!L
zf5G7Yg2DenvT4P?Mh^bui~krZZ}Bg^C?5Z(Q}Ewl@c*8{zrQ2?b;3Vi{Ev0Szqjzm
z_^(dE|1E?6_YMB5>7kGn{|dQr&KLhDsk{~c4MzOGm4g2kga3;L|DR2;`Bw@5eDQys
z%3J)m81es33jW&+{_70>$Bef5m&(RxzWDd1@)rNa7jvt&pMRc9!9VkVUhxdxzyHAC
zfAK_{f0^*l7yt9Ayv2Wo@W=lDLJIy}4E`?}{HNB~{I@2I|70p}@vpfg9)FHS()quK
z!T*N_|BD^{KeMmjetF~X=>L<1KgR#16#RP`{MQ@&e?=XfBNe^=ZV>+Y`v2RcV8y@m
z(s=w|PQkyz;QzA0|JI9b{%r~4e<PK*`1cn682=3^_zyAozhdw|l=hje_^;|g&M5Jk
z1(V#?1kk}$-r~PO_*aW2uRmX-eA513ZSen*!N31`HvhW)e8=ShQ$G{se=L=^`1iPs
zqtbr<e4XAW<v+&Yzro;t;fXf?#lrtH9*giL%6|-%xA<2G|HV?2<Nsy~{&fcb9~=B{
zpamF5Dms2E_V*p1?1xcU#P=WOQhAI2TH#+IC7J(QlusJ}CWHU02LDTGQ_|w!e1Pwm
z_bf3*<3E-ZEdE=K_`gGjlJcKz@PEzV|EUXX{+R=P)|GkUKZwd({99}Nf*Ai_rr^K8
z;J?w}KamdDvZrYOsiJeuobvVmaa7*oze@OH|9_Y4C5``Lga1zq{+k^AzfJhdV-&A0
z{1WXyuQ~dERh=LIYAMP6e+%W4^1sjE|GL5dgEJiQKg4%@fKNkM#QFc3%3JYYDEzVi
z{5}Q$6$bw|4F2<Ifyxx4{im+Xr+mLJg4byLuch)9|J6qP-zO_c<NuVwf0M!gK*#y5
zOi!OO@3~@%^555Sek)VYQORVm|NM#GC*{A^;Qyw<|2Z0e>?s=mWx}853`|k}YaHXZ
z+Tg#93?=2i-r)aJga2EO^}}LWIIKnTl#lX%!?Au?Ed1-FJdfWGD4&%7CWHUa4E}TI
zfRYvennQiZ&xn5&QT{Dd-s=Bb4gP;m!GE*C|1E?6Gu>_erM-N{vy`~VDF3IZyv4s}
z97iRSsgQCU|9?_GY5cbu{C{rnf0LdwTJc{j{BITiDx&;1QhAGitMIP|{_H3z|Bnp*
zZyWsoG|%Q=c9`$@Atf#{%KtqoZ}DGe@Xw~;-<dlbCER~_$KXF_w#|P-LjEmO-r`@{
zK+Y&({5z%K-`(KfX7KNRyUoA#aL;|_OkV`A(fIF9<t_eWg}>a!dHesnq~Kp>@c)Iu
z{}OsAPH=4g-yr-42h9CUl>Y@(-s0bE#J@`l{(XeMju#&PzcTn&(mLPbUwVYkmp{W4
z<?lNGQfb6*v*Ev-t}~YZGV!19{OLhd-iqI9qy6_FM;Z_97cTx)2LE>r{_A?${40e2
zUKl*eN8|ThDsS=MVDRT>*-812H2DA8;Qv@3n}3b)mu<kH7E%6>P<f007U5qZCAt6Y
zn}YvXga2;~{$m{cn}vVRfVrQE@;}?bzsGoTMhW@vpMw8*gZ~zT|Kn5b_%9RwGkn^?
zYn1<^RNjhzweZ(|&hbAe1^;G)e>1W0e1Y8kN}GRKZ=Z6%fVrQE^52!pTm0(`{$(ln
z&o%f@2i{tbHVP1#jm_V6!hd2O{y(Gg7XR5s|2Z@T|AoR|$2+&*@2R}<Ryp<toBsyk
zUy_HvYyMko_<zsvKh1Iev`zf)U7-J^hW|ep{{MEpUH{CHzT-muFEjej`-cB-Tx9z%
z6aW03e@xN-{{)q{`p*jKKZB$^w|^hXYk$yj?P|Z32LG)F|7Ql+{8t_2vwkQK|EH+D
z#lNl5FNpk)OTmA&!T(PN|Jq8Me;v*1obtv0A}Vk3?=dmXzh4UeFBts)Z15j9%I3fI
z7@z-xJ`Mj3y+-@brBvSHUo$Dre?SWU8w~z`G5Bv8X7gWmoKJZ{9{#_g@)rMvljHok
zFD32&ZyEfz8T_xRviVo^_4()PKUY$Di~rio<NQxd!GDXv|E~uBqmH-vuaygLKK_SM
zd5iytSH$_Bl!E^@ga6+Q{?&AWVo%Zivl<$gobvG>M&&L36;tB;Pf5W)^AF#D7hiby
zj~^KP|3#l${M%?=<dly;Z&O(OC-INvQNsCicnbbq4E`S){4YJ%=HE>Hg3}_OhX00M
zqw~*LDsS;$HZ9Kov=sb%82taw;Q#7qn}0@byl=|G|79v~@!!-O=YK{D{=E$Te>eE=
zb&kz{@d<v&^Ua^#sJz9$bb6fss1*Dw4F3Nx_&?Lh=3hp?E5RvW|9^_gTl}kM#QE2x
z;6KFR|B=Ce@FJW4D%zLl)Z)|d-_UEc|5s9Zi+`&Wtdo+we&c6hNv~hk2LFE={1={Q
z^RJ+D$(%O&B6yARpHJm2{%r<-J`$gl{}_Y+zYP9|5l@0+^M7fTPx<A5xu1#hFQf7n
z|Eig6HIu3HUj6gGe55le|2pBX`rLm1HuxXCo6Wzi%6Hsf{Huuacdg$i8S&#U6MA(e
zV=51tXZtTZ#rMc(HZVo~_n`7t{FWK<<45`$k9_wZEe8J`4E_(%0}e79YyZqppY^Lq
zp7K%t4^VlFf95K-+P?kykxo+ntp@)Rga4Nu^GBQTztLk6zC`&y=$Jq1gulj_`ybyD
zCgs1#;GZ@4zkj<O|K?#n=lYPkmy7cMEtR+8KU?@Omh#M>Z>f^<Un=}npUd+aQTx5h
zU+-`8ZxjCHvR#Vuca6VgM*Ma*{Lk!Z``;@5^X*?ZQ+X?XooD&XvHhC}(s(HD;=j`1
z-`U{*T$#;3Gu#hbKK^T{yv4uF;Ll6Kr2JPK{C6?<?@#gLNJZ}-N`?Pkel>#EX#4L?
z<t_e$4F0^NO3MEQga57u{~h|+{40cizWw))j<)&N2>%MHIgcNn(v$MvVDR6~;6IA|
zTk)?E{`&@z_cPJ>S3CH(8vJLc;QyAvzl*{D%MSj{!oO!8{tr6%uQK>wlY;*igMU|p
z|M{-x2f}}T9{%Szo*%Rs{r|cY{I?1J?&6>O-xA92DDPD^>}U6%iV?ozPNJ_O+J7#i
z@}4b<4W<tb{x=x>ccy(>f@AYXmH6KijZ!}9zl6$L{!6*DQo`{!-|+96zdL{A6>s<a
zztm{|zfHIK*9rg0zM0@P%KuMP-r`>+{OhD7w;$h2C!IgK3x90?rDRLnUF8{$>-PrX
zpKtyiLFFy}%Z&KnV(?!{``p}8(d)-n@n0tOR}qch!&Kh#zd`(0OF@nw|9)xG`1Lm0
zzq`@?n`hhnOHcJ3%WbUEkM-YosJz9$#~hAI`~J(nADWbZrNMu1ga1=Bz^wS!2>*QJ
z?{QMF_*V;mT_<t;?@GbHO89Gix%@r`|7!=?{F{Y;zV(x9{8t<P_ci<v7;gJ-?V$e}
z!+#IM|Jc)P|BE~5f2`quKf`|mO%PW9StkBF1wG%-M8~fy{&j}`{SE(fceDMk68{Gj
z=zo&o{{X}PJM=pTR{b}K|1%2o-)#6l(D47p9=887>KB{}t^aJp|3QZTo2fyq`d5kn
zeAf?G`?nhY4>tVwc8vcz@n7ipUugJ0#PI)ln*6N#H;ey6{bmSWllK3`hW|3d|1pmC
zUnc&01)lv(QvXX0|2+-=)sFga5dUQb`d?=FFE{)zp?!KQ{#!fP{wu_P7vay>pGPTA
z)%B9fw-2=a>%q<5qOT$v|2L_;XN&5Fsm{3mKSmYR>!Ds(UE}8|ga1l$puAPS-(vHx
zsP@?mM^coJ^8YQBxA-qM_<t=0|Fs7H!;JP{KEvkUD*W@UzrH}_E&gkb^~+N!_^&tk
zA8zpfXo}5$t?=KJC;lH$d5ixh;Xhl-bN~HD3jUjfzxFpSe}uvRyt8cn%TD(l>-f=X
zMEj4c|F#+admH}mZnFKa68~M*vB;$Uw;2A9H2gn4%J#pugZ1BP_&>_<|Jy5U{~J13
z{|^oSM;rdXI>+|kCjP0*wM$9k?|oT<N@D-(WB7mFasA&a{=KmQ43hfq{7=6S`aj0-
zzZc!7avh`huNhhR?Fzm*o78`);s02}e<jTmmjBWY`tM=*KhE$!jy4!9|7GHzrj2$f
zY5mI#{}qP+zK->GMF;)&7XLbb@%-1<@c$~E)3EAaCH|jpSNnMTzf9$=`Mc(7w%Y#t
z->(p){W0J5ztV_bKZE~cJKOwA&-95GdjB@W@ZaC?-`U~6O#C12(+FOZ_MhQ~|4PIE
z4zy0R+OMXA^&e^Up8<ydPdV1Fb>jc?LCyV4wElyryw!gu8U5#t6#Zwc5x;>3{}YGV
z@ym?#`4-xL>WuguZ}?wwqwT*`{EyBPzdNbC6~9&^e*FExq~ov2;6KRVKlLV?f3xsE
zB@h3}RNmshRQS{7!Am@U@%Pt~@}F(A{|N^F4;{}B)(U@e*)B!<uWS9+YQ*nE!~f<(
z?D%aE|GTvF9-n{Tq4HMz+Kl$!oFaaU4E{q5{<k{#w+a7z`zJR#_<v~d=kM<%ZU3bP
z|4$kGFFMMOe}>k@obo+CJ&(#;@h|0vb(AW+SO5Ib?^5tzZty?J;Gc2uFBASf#lMPZ
z|NY02HvcMvKYxEBY5Z3i{7*LcFP~z^zef1aSK=b0{J%iut@t+!e_dzr{K4N}NXmbW
z!G9fb@O*)+A8Ye(6aL)hn4<hIq4F00g~ETW6lVT>em*Jxbq4=ajQGFN#pb`^Y~S%3
zBv1J$|5vHJ#lL#4U-3FA&;0+Eg8xS0ul42f!C7sxsqJuntIdCLjqjMM+%84=yXNn=
z4FAK8_?>XA?SGm0-@Bdnc>G-cHyi#(82(>(e1B?f2mQY%{;7Gr#PL7X@IPvSUH>-m
z&u9KIMdM#h<*oj+Li$gI6lVW?ep35`j%!!^J~a5BX7GRZLYsftxxV9_kUZt1{J%-%
zE&iK?zw%`MeEu&f{~h^@0hBQQ{9Omn7vU<Othf1B2>%y7E8$C&|6^3%;=fh+uaKh5
zf2S1uOAY>K82q2BwE62Fj>;GRHB{c>zw}za<6->y{94lZA87DD)8K#Gr8fUkS-9`&
z(+C<M8vmQ9yv2W&@W=S``KhG*dmH>m8vG~rxA~Wi@hRtv|2Qgd@gK{FeJEl4yQSb?
zY49Iq@ZZf5{|e!sum5*)#J^eiWBm6>!N1Djf0n`jY`Rb8NX7Qw=v+OgeDObn%3Ja8
zaeX}geEuV8{~2lUKilB{g<6|`sqpWfr~lte<t_dd!XM+$=NFRlA8YWhG5Fs*)aGAt
zezN%AP30~An~eDL^Z%s$#~b|5G58<ih<}yv&)5I=cf^0I5r2Muo|J#H!T(%?|8*zZ
z@h`m~S^Vcvc`N=)TjTwopFbz%KiA+t+Tj0%%WVE-!ara9@1^n<|5d_&g&zj*`-6w3
z;J?t|KgQtSZ=lV8Yr^;+L**_0WBIToC7l2H`C-!dFERL^XYfD75&z6sKXCctzrQ2?
z&B7n!&(F`2@?U1~Ki}Zb-$~<0Md$ww!av{qe<l^S;@@LlJpTOrDJlPz2LB5T{<mFX
z^KVNS|C^}1#lJ%MWBmE~O;Y}=4gO;d{=C0y#eWs8>pA6%KbN)mZ!+S~&o7elf5G5?
zp}~JQNBq|c|9t(wlOz6HjrjBae^UM%4E`4x{2N{0U%ki+f8O}lIljNTln+Z&!uf~y
zuaokB%iw>p!T-rRyZ<Z`{`unn7?rpB&nn@+f-6CZ@4tBeI4S=v2LDS8{y(MrM63Td
zU+nwM*Z+S)<t_eW<%`D{f8M`L%72@||5Ag0|9YE$tMJbk|6{4V#lKnjWBhslEGhrY
zzy0{({rhDG{{w1l{xvi%IpvH0K2+Y~-$TAQjq&IGtEBw982oDu{{8E0{&m7XZ~Upe
z#lJ%MWBhslCMo|O2LC#P|D6<ItN&NfeIciO@xPT6EdHB}`1AfpQvSUR{`Cg`U8tX1
z{Huh2zWDD*<t_eOjrjBZcT)Zp2LEve{~yr<E{lKZWq$lu`XYEO4RU_wB`R<6Un)P`
zP%ZjAfAalbQvO2>{tX8Ik!086zgGB{NBBnhpGM^^{%yh^$1mT1B;{Xi@E>pRpG)UA
zEdE=C|6O_b&!X}c{||-#Vu(Mlf0ObbWAJY@_}@#I#eZ?F@0fox1XDErcdJd3m=@mb
z7pxGF`wy?blJc)J_)kz@WYdco$+zd*{M+h$$G7+*c#ZOZlgeB1UoHGG{(SvU%D>6r
zKhfa-0Xetg-(2rguFMnvKT~;&fAzw6{Q3Hml>cml|0IKd-@!KjRpWgA`TBn!DsS<h
zE&MV5JpU!-zrf%>+2H>t!mRk$H2C~4$`k+h)Fw$xo%zddl&S^f{?FqtDgVU=|I5`E
z+4N#Y^6e^{|Elr6<J0r-f0N2v@vjm7IDWbPlk&gM;D3d|{}@`}S@F+I@cG~8i{Ldn
zetT1Si+`&TfA*i0{|bYDlfnPjj{d()_}?2a_cKxczi{;bbq4>bDfmBS@SkGvzs<qF
zYNF5g*LnEg<ltX=YrOwonS%dXgFn|_`@PD)(zvqvPsJpk_)B^CZ>929{~0U%>!du7
z-<A~o*Bkt&8T=1*tlu(|eaFw|;eW7W{kGcRKPv_QO$PsFga4l0?f7pH{<HG%?@HyZ
z`1jy1>r%q`=js&vHyix9|7pKbIlrsTzvgnE_^rMOUZdmpIx27RuNMB*Qj+`6wJG>-
zHTX|A_}@Iw=HDj#9}1ZJnJE8xRNmsh*x=uqg8xSb{}~4VZnJIvi?8tc=HtH$mACkB
zGWgF=!N0RNtF%8qz~f*0jmjf#wE0&x`TXS=Z_o<S_?J_8i+`E?@E_j4+?0ZUcZ2^-
zgZ~aU+58s^f12Lgr6~W89Q+3ff9(Iaq~KpB{PlXx<A>)jjl0UP>}T`eApHGVB&<S|
zzw7)<ZzF!Q4gZ4<vHiD+f0~}#rKtb@RNiX;R-^szND;qEgZ~_Z|Jw)K{I?4KeCJQ!
zr1BR3r3U}IQt+=b`1Aa)?XL2%BW?brQ~a>+(=Ph)^GA<Rd5ixl;a?%;x&JLm!GEN|
z{~Ck;7zh6f;omb4|Fa$Z+YJ8qq~Jf+;6K;kKazM_>#sWDKO+zS(@4*Xf9dW1$i?}O
z_bPNgP~0_s#~b{!WK#Q$$|sv`{%yj)UmpICQF)7hZ-f8+Dfl-V{C6_=-%Nq9;$KF;
zE5u2b@%|fnjm|&wsJz9$O88^{UzURZT;Z?n#pCCCqyLoLVDn!r{HaL06y@(~{{@DB
zUcYF&t9<ZU+y650U+DSMMTY+y4F8|K-uAz?gZ`I@|1J_ej{iKve<M9-v-(e)_?O3+
zK^sKlUq|Jw{?jb|XAm2w#Qq;4|Jon&jo)Pk{{;sBi34o@&CR~w<>KFe7w`Y$sJz90
z1^?I%CFH*{1^<->{~HbdT`O(=Wz&7e`QqQ1%3J)~?u_$)JO%&N27g|E>bOx^I?Cq1
zN+$j<=86AqRNms>gMTb268|Ss@PEPJf3v~=v%_rubu<0=%P|)J4ZTMD|6Nqx;$QRW
zIRB?p@ZVtYUuf{}Rb}(vdX-OEj-fgEA426V{tG`7=f64y|F;bOy#CjIqjHnu{8aPo
zWc*)qoS#~|B+ma^Dfn+O_}^;q=kH{&r%v=4rmb`QclqM~Cn{{k|HHfE{J)ce|2BjF
zZ3h39MAPEmd`&X`50je3zv7-a|L0Qh&+Oor$LrT3ga2-h^A}s^`uycFn*WAgqvN-e
z<NU>>rE&f*q~PDh;D5Wpzjd@7|JLh#%B?;PC;w}xycPdtpNsQ<F$Mn~27kW))N!lw
zxf+{)rq!n`$H1NZ*HC$j|E7E6{9j7Jzn8)PPJ@4AC!2rk4L;?3<F}5=Tl`D!i}Qau
z1^)_z|6+sxHy7CaGxL4^GL1On|1_1i_*dWW^RJVVynfq|g8vYMKi~g*zR0G^2gxpb
ziq4<Qh!>|#z6f5U<M%!)Z}DGY@P91@|7wH(rw#spJi+Gw|JeH$_^7ID{h1^{K+Fk<
z5EW&_(IyokLBx!p&OicZbfP1orWH#Nf}tWw!wjHBjh$d~I!>i;d)wQ3Z|%Lb|F)Oj
zTCTJf6Oo7Yh1OcCZAI&YIH+hVMn&@f)_%<FIkQh@2Jv2Nvwy#tbIv;Z@$I$OUVH85
z>A<)cxkvaV^>4@j3c~B~mwqps|4$Wwf4;yk?QJT*uW9f<JwlH^jB!D7XYxzx-;Up@
z|FuBFKN>%g<u0$kxJ94-dXfH9sg(JRJ^h~{ypDe@8vZ>~0RLJv_)}{g07c@j#RP{=
ze%rpt@jj6Q|CtD{!@pC5|1SmLk7)3p2%r+TygrI~0v-Nv7Y9B9X{yf7{|6CXhrjas
z6l=QvlKeea0R9dQ{yPv};+EIp4)~kC#8LZm;4g8&@4A!Y-@v0`{nr-?z<-+t|F<>x
zuWZrt|IXWZ!aoAvRA=Y^<p{6i{|14-lxKtCf4KnscWCg__?zUrysjRh#~)tLQPY@%
z>g@R25nhLX<G*p>O(HPK&npGsze|Ik#@{4vdA%~G$G_*RJmG5v|70HQ_%BCz9sY9B
z@vT<yzghtPjRJqE5}wB2ByM@#1P=t!-hPI^&I8UA;pN4S-${Spqe=hYH0l2*_POiQ
zUoX<XOeQR@`KI5kDZhW$q<>dPpZ<Q4{)!ys_kD!dm7iZzet$2Z{2tcu?=B7gE9U6&
zH+_>c?8U?6-;)~t{ZNzs_m=6?4}Xg%EMTNi*vs$R2(RN`n}&by6u`ed8vOsE!N1)>
zf9@Cfg&E<9zsEs;-l@TVumJq~H2D8hgMX?6|2yu;kN;;l@PC&Ee}4h^`!x7BXz<@2
z(94hK+Z_KHDbDj7yZn3!;dS!k`T?)F)gnCU|04XPKFl?KTvEitk5R(Y__NfT^19an
ze^}suBM1J!I^eGs_&YcZ*8UFB;P=ns{3`-B)z$qAf7-7SaW8R8@(hI6@o%FT_`Y)p
z_euO4rb*vP|5ph9spBs{)$niC1^V*$e}|_#Ljo07d-;D3;dS`KKjw^6%YQ@x_`MqZ
zKhxl!?oj?60)H;~t#K&-4h{aJ3&3Bk!B6A&vi#-st)QO&8}sBpos+5K|3(e|@&fSB
z)Zm|qB9*x1_0|*h`1cF^$8s@9Ns(QCZb5h*{yhS}M}#N&Kc)curUw6c8vIwZ>+zTW
zD~J569QfxUybizXCp@4ja!&Zi7Jz@gz_02*zXty&#_RF#`W{dCODWFt8$16eBD@a2
zDe!Ml@E=zI{uT}YY5qaVjl51N)8lXYK2JE;`m0YOybk|<fnT;W#Q*Uc{0pY&)88o4
zADx4LS0KDD{nDTE@>liWNt*PX^mjzVzh7zix4Bi1f0w|2GtyL@z5MS+cpd&)fq#t%
zO#C~!0Q?;q{4{?f%Uxa<!5|<`W%Yl4z!Ro5d#bbJUx4sB{2K-S^&&9g_ZEQvHh~|}
zGe_ZR{zl@K*FQSQ@2(&6a94@&@?yvDRQ_Mr@b5R8^pC~>pN@ak|G`rnDiao0d-|ma
zuj8Me4y%V#>rYhy{JT@bzxy=!=UuGF?-%%I3*7Qz$M3|y4I2J+Ytp~aq5rvFq(2K`
zRA*0rjzj;mQSeW#Ka&gK-`yJi-LJvl;UIr|gyLSMg2%lbzZ3uN)$nhtCjGK=_2t*}
zBc8D6hNMu~(;trTI{Dir_}3&tQvEx#0RHXN;NPaf|608sf7_3F!v8OYoZr~-_aeLw
zfAxRy`eQ2irx$?#Ne%v;8vI8)*pD6o{4+W5mpa&wYXp9^{`(5Rzej_AlLmj&v3mY@
z2>gAVjj3GN`F|zC>-fK3;8*M4%mVQ5)8ME1OO_VU$ZOjT4)}k{A?NCUUW@QL{G}Ut
z##Q|17l6M{ga087{_7p=$Bv(I{L@mL=Qno#M;z?O4uQW(gs1vDs{s5ZwAd3)?Y};(
z!M|aup8wqfzfYtuFLwMtKzJSh_h|TEUjY7cfnT*BX#QBrjl4!3>aXj+IAW;x3}?sh
zq`xaP{CiZB{`Wqi=U=%<|8p6sXSW~UMtB|n8tG#(aNX>muOGai0RDM3_-X!H@=ad-
z4&}dI;Lp|m&2T9HivQ;LcPscC3cz2j!T-1hfA?t){NKnEzE-3!FZS~PHNxxozhB_*
z76GaLg$uwxQ-l8r4gRZZ^!Pgj{#^XO3gLD5H~u1<|Cbhk-_+oz^#f9F<aM%x{JVb6
z8HeS)8P3lCDhK)Rx;tC`FE0T9d=365HTZWq@n7KY%s`)Ae;;z-zxm5-{(q_f{7oAC
zzt`Zu@l?J1l>ave-joCX8id!$k7pCdFU(*ze!HLm{L3}?|DeG?p<0i>P2g|Nf&X}f
z*WuqO@OO*wRDTy1fPak!|85Qbkq-RdBk*6B1OG4w{&&&Gs^C=qUtIwHP7VG)YViMT
zik|=BUvS{<{F3^&*WVu@ypI3X_hi@K<^u4q*WiCzgZ~N#{l81#Z%QHOH+KB<ob<oI
zukyd80Q}$8;Qx~b|2q!yUwt>nn@j%x?jZknY|iHYwFThcpuzuV4gQxL<o`~AKbQPJ
z=OF)$V&GWi|B3?e->tz<>xY=Eg0=G6<-q^)UvmEElK+?k|6RY%=Ktpkz~8OG|Evao
zl~-SX*9-hpc{Wo2<*7S<<3)JJ3&gFuZh^l^5J`VV3c&xc20yKTl6;rfUryHJ-zD(R
zQ9<F}j(;P<>+pN-<@{Isf2#|?zgvU<c@6$YPtoJ|Y~sMr&w>9zgxBG}L*Q=`;fen@
z6oCH)4gSAs@PFEY|4jn_{2cf%bKrlUhW|GffPcRRKdnELawD&w2mh#~?c?9w0)H;~
zUxn~G{<r;x%a6+cjsox>)Zl+fgMXL<|6TvX8J|o3iyZjBOW;@KKUM(#(h{D3b^L(V
z&q=<^tH*)=VSzuF{GZ^!e{)MV|8Fe-{}>Jay&C*K!34KXe%1^8x#a&p5nd-h8w7rp
z|5gF`JsSKg0aWr`UPpd|<1a?uRJT{)?@)=jFSR`nLwFs2&wZT#VSZuu|7``}pQOS6
zZyNl4U)AGpxrYM{+wj`){|(`F_}jWU@Fo$S^ylpb;IGx-@72gp_-lIn_Xzy<_R5a`
zLWI}h-zD%@EBL=!0RB1+{^vFPHy!xDGf)1{cHqCOC!7D@C;)$0gP+#FO1YQUJ00*>
zZ03y1#sBX(;BON6RsP>m0R9CU{6jSOzxfrt{8S43Qhx|B$g00zL3o|~tQYv#EAsQ5
z0`RwJ@Fz9+Uw6QNr@&t;fs3nM{$Fvx@427L&jtnm_X@xt(cmAg!QTr8QA&3Gxm)1x
z5b4W{9sdgmujBttfnU|1wAV+5uMiPBjX!s2@cT6QeGd2=f5j6BOW@)v)0gCF4)`k`
z$gaP46@dRX4SrhxE$gkke#HU*27$j^0(HQDn*;te0)Mp#NBaLi3&4Me2LCDze(QF<
z{M?f#|2q+0CqElB{Qq$Q`0vu-e@%n`IS2fuzvhg~#s5D!;4j_A<wxcJPYb}mQG=h(
zZ;^5%ub1DU=YNI3-yzChUhMLJ3Bv36Un}sd^><?d`0v%=|G5VLQV09(jy&-%a<JdJ
zwsZcg_<vCV{+$~9uWRtncF_M7_i~PVB;&=^&j0fq^#AT1+48fg0Q^sC@Rw-tUv25-
zr&iz(=fHmz!t3OxbZ55y+*|<uJsSM`H29mpsK?)xC;ldc*Wqu`;J>#3{QETc_iOM^
zchEn(^OT<&2mP~C;8*p}eFfm})8Kzhga3wa>G|I$@UO`sKT(9&@xM>tUoXN_`*nW-
z_)F-pBsjJI{)PtsUI+Ybzu^hzlK;Ot;O}~nr@x;^!}^cg3cz2k!T+WP|1-Dh`QI(@
z=i>iU2(RP+n%{E#D*tyDfPcIO|KBwDpTq)VO37}2)^5p<|BoTO4u9!G9DkF-|Az{|
zU#Y=Q`@dLPh*MslcG5q2;{Uyq{?Xunv;h3mH27)%xWp~5TO8Wo-Ff2Q?9l%1)Zl--
z0Q`Op{<k#v&-kWZek$+d1@95%FE94?w-VtQFA%rtDj&|4pC=2zAJX7IpuxYpOOM|a
z_;cx>-yysXf0qXT9}2+VsKHPB=cU}p>vtXae@CA9zvaOHy&C*a7l40>2LIa{{6{(H
z|Gjz2&rk>bZ$6SOKYuO&f13t>p9cR04*IjSn@e*p`Kfo%pBpsz_Y{DCtp@)d4gODm
zT`&KQdE&ne;dSy~`e-))|5^b4E)9O#zbfTkUVq_$e}lm9;l+^px9gvuIpA;6;D4zA
z{9o7Le^-P5DF^$1r@)^}ejazQ|95Ke_ZEQvP7VGSHTX9;j6YZOaF*x7{{x5d=gP;j
z<!4_3_<y3o|DFcF+d+O>1b$CSa`=s1ehxa|@6zCZy#W08Xz<hiXDRpcy2PRV>dKS<
z3mw|8y&C*)YVe=@ZLUA2+W53vq+e~L^HSwu=+#fA;Xc&girWr)mag=Ed6#*W;U)D`
zXY#o0>B#WkmmbAchL_g|{b?+!*Z<5j{cZDD_%;+xhT9;*Hv*sP?DEr%@Klz5)f4W`
zT^!-=llTkjfAwkjzwrv}%eIB3$DKlcT7vu~#r9eJ$@D8Y*|n^7Wu(1%(RGtsr+CO!
zvw!}_@A?1qY10_-%$l=n`CZe9o9jb!irkWu#E0`(UqVEkx@@>Abu04ecijM=mj$i}
zTpqYAF#l3Bwy$!D8811t5<X3<&g(G~CsH8OdUh|nCWi1weu=A3L2HMZ@p=b)+Yh&$
z-MP%fSrj^yh<GbP*4sQr8OO6B>p*|F+)huJ6{dAG4|Xa`J7M|-#pEflm+|Tg6Emlo
z)?Zkx7w+ght&8YzvvI#3R{}C%c7lm7Vib_&yWF&R)+FM!gt%WI=D84$LF)neCS(bO
zJS>kQ7%%aLte5-4wOyPnGMs2Z#xQG4{9wUCi8g=8;&I0-k()_MZcbHlb80#_=Tdl%
zDueZ=NMuMg#DWU4bbt&2z8Pof@|dixGDD`tOWziEF~lLAAD#)pS&@MY5;IR1rOo0D
z?&v&G<{*IkR1O5rxPPx1k5p8qIKna}A_FU?uvk#4=gL@6s^{urNpM-Q?kXjpk`Hln
z?=7L@N?jfz`S*sbyDHf0{H6Ot7HyVaa{$pkTM>ry6egUPV#2_Asq_Bh%k-ca>%};&
zvS&bLM-4OfK;@Nz1%ayqp9w6yYU^H75{e6(2~}?lc;DEo1QfSnV-wS4o!yb5#;s~(
z>$)SavD5@nr~or@ECp5HsPS&KC2^@~y~q7p&t9oXAMf|Wi_lr7wL^HGZJKfDxgGtN
zR9mwf&G_f>JdE_z>_xH9Hx9qC=*kSRsZ?tYWG2Fv>?kB^9;s=p4qAuOtcFspG&ap`
ziXG}VI)8}BtiN@38=e1+yMVE2&VsHw@3>(6CNmgc1%`*b6=nh<Lh*5-!~%Ml@5LP?
zI+R%J^)y)T1TGB+`sY=k?8*~nf9##2_E4;^I66^AhNigAdot<rilxj=HYRkkJeYCN
zLcYFLJ}8iW(?VLtmNorI*v~i<>+6p`^J{AUk{)*H?2e8L#6Pnj_FjL$_{N;3<nVy?
znFWFEbDG@g{6Ul|qa&@|091V?2~tXqGVKNHEtEw%81Q*IZf<f##>Zzb@OQpybe@7H
zXvgdYl>YYFO|IT!@Eo7r80#wvu*GS0M#J9vngdIf{CqwI+~|B3d7RZ%H?1PrzrDft
zR`j`!&o6RCE;cqH)5K$>5jmQk##yr$^lpOhdh0b}P%6HLbq9<u(>Q#v|Is>Yzp-g;
zNrf3-nMx!2m*kC93Mh&t-f>IUbIDm54#lTmkQh11jP=0#Fe<T%2CJ{ZdM;=^AD9=y
zvnMdGKkT6*i}ksqr<(EE;gD4wjJ;nPIUTX2Qiz<0985wEwk7`^`HqyKWQ|TAIMRDA
z{_Y{(fQ2Ku-8CbGN<7w9iCGSlPqP9=R#ca(zCe1zru8>SFRKsLsfxpGx}Y^DRdH$q
zU2__daw$qYRV_2h8%9fJX_u2Zhd=NyXuV)e@S}yLnzu5H)I!#~A?u9>Yfpc;(%Ke^
zPx3ZYy>G@Z^s_n!Gb3cZB5H3B<3h;S8$BWRzB}@(*!xA1Q7I-`JvH5L|M9r)3@(*3
zRaaqGb<CWdPkH`b&^i#b4tCt!=!$rP@sL-h`?hI4&9k|HM4MIi`kH=o-7`0N*3ULJ
zO*=1TwzZ)8M2-sf?+E$ci@p%FV5jyeLBXXA{@CniXotu-jQ3p&yyF;<X~FnKeiQr}
z$C$ttxM%RdjJ@NI4C^I{t$D`U-TMpN5PxBTg2`rLITVZaVp_gaS_VRDy~1=&gS8hb
zg+#QJOKK%aDpM||Z<06inSk{GWH2&45Ig8zjgndp>92a9kjaukR2-FWZ*+=@k|VE?
zuk~IFSxxz4;7#jw?h}>3=)BNDpq*Q#T=M%7)c4;&k#K$g@3;%Z=PZEU8<Q#st-2qR
zL*1WC>i!swy8q|Y?^~eXiK(RDN1}xrL+bs1z-^)4)ADcE?^_1a?_)k9`u$j&ey1EJ
zpJDYVSA7`N=ZZe3K^u%2IP3EX>u1NOZPBaq7j^19PknAhykj!;`Is#P=5X}+n2(h{
zKhpgJF!le`MOUnhwzajkN1B&-mbWfmw7l7~w6)!{GO}pJl11%HJj+(JMI-;G2nQ3-
z;6Px-lJ?eROFWe|)n}bGwR&ppB+u20R-*J;S9sc|)t-I!w6m8~c@{5UwBj1is^<2U
z%RsL=dvf*Ush-M~NThA$Ia8*fY$=Y(*R-}?v%Gm_YqWiF^W?>?*G-AEwk}`XvS`_g
zDa)6yy6%j&_SVlfFOGPY_?FiCmQGtzGkyB>GnbrIT{E@$ti{#7X}+_To_Y0|)y<2W
z&s;L~%;{6BT&^(!tow#}F87*p_X#71m9D38I?%_9cP~;8J5W|WtE^&HnP*m6<*c&m
zKv`{FSyOD-Z9@}7zFcy9@vTM0JBF0i2Fj}0d-#Ii@<3T>psb0~Xc2L-IRV7AysVVP
z-y!H1&=vF$g(zQ*w|rmSokWKNB<5(0`fhPQny&C2D?%vT(z{(mgPTi#?A`S&#&SIF
zBO2T=e&PG}M8qQmZ6>Z`1np?LA{WR@pv+TO7LJvCx%l>?qJ?FR$dy?ZF8WHDC%`f~
zixLUL`+WL|@VC$v7zXBBQD0fh+_JX0WlcqwJ1`K@P~ODxcP@Lry?7^<X1Qu{PnZD<
zm}A9XE^4DYU?^o}x?f=1Nd9!#!fKfoeN~Sr%;K6UCK*<UG<iM)WtEVE*pS;8vli2n
zkOp9=FRO0Nq#!KujJ~5pZbp7Q`)Z13H|h~KAui$>&2N*l^Niln+!;BYtW;oLg`6rY
zlLSqb6~CapPo6ch@|l#Zd_gNKw11CWM}GOvTUK_9c<uQnS^2womrGX0lL-NLBxI#U
z#C07-$oT|al1o-rXl3PY5!aEF71DJh*+`<xrPD=JJV%iq{OG<6KSSJ)!j<?;bkcP+
zz)1Jw@FO{+`{VIDLEN8+D^1}M-GkrB;{Fs|seFij8h)P;_fXTWPm23VxY9%o`I&-W
zwYZ;(D@`jBou*Hwi+d_#pSYiaE9p1#a~^)@i~9hsv&4NJuJz)c>IJm}<ezwQp}1d)
z>owy3v$)cEHspuOmUIE#x8e6W{04HxE+L3EPsJ`#5Lt9t8#7-NyM|{H#8WXVvFumH
ztn@PJ7a|IGs+HpWmp+PJRKnS=IMsS)zAI)WpGl*qVkQMTI!Q#fD|UIZiJ%m_NK&$0
zF_Rh{og^sR6}w29vRyHgEFGPsEZY?`iPO=UhRJ$S>>^3bcEwC8b@V_s5tL#VNo%$%
z<{CZgMKQ108hR*;MucJ)Cek&o*wv_^lK)RR&_C@!ztVxez=3|11N}1&^o0)eCI|W=
z2l~|x^u-SJB@T3H1*Ts=jH*7G4v`m**_yb&VQBWb3gl%Gl<LVvq=C5W5Z6zlik6Fe
z^>PSA9sNY85*__&C~O^l78LuaqKi^dZxDB6ck294U^q!Ta@QfQmyXr@|0@~|T|DC*
z@EnZ>XH-#G#OiY0DemSRL-cuB^sh4fWNC4Cr?}QQ@cA#md2$hJt(ngb;r}V*ONVnC
zOZQ^oD}6@LcUe4bDY}ejyaONBJH($r`Hm{OBo)t{;%+<R!=+jDWh}p!Wzqj_gdYE6
zB_xOGc1LQu9@vPw{L;QV9lZ$r99@)dr>NZ|_YRB&o&WJ5mLo2^`z{1a=l?~Ac&N!7
zU6gJIsSPG~72=s#M3xJ8U>9?1;9nO%h122r0pxRH5m`Ol%@x;b!Y_%+^}C2@Vo|!?
zlpNU(&l8Kt8sd)ik#O6A-^3ymns6v4<}N~hCl)~{gkya&+*diId%6StWX6YdJ1hBc
z1<RL5M$h|Cc%pSx6N}RA>_*|^FAn_wg9H64uzq6EX{q?hJ|g#PuySHix?N_rEa)$R
zQ4@>O?Xtu<#i6`LGW=6mob)Hl<x`CRQi{|4m>A=Ky8Z1Cf)YU3iA86n;*tDccr?+|
z?fCn`$B!9KvLd;YIJ;4V6N@M|?qo>XXEw1Y-Cj$6jzdBdizI4pLsH11kwllZNAwFp
zKMM(sD!QCUj(-8)MIw%@Wx3Z8kB%M!|8?{=&;vU9Rlu*K|2OdK=-+g}^EZcdPj%2I
zw3JR4|E&)4b}v+b&i|Jj_^=n{tMfm}fe#}c_^{j|-LM0H&T+u=q(gr1M#<`Me#-%W
zJ>*koS8QeaIa|-SG5`1zPD<Wu%zw6Cogn;?>L#snkfzPyJ|XB}AM2+{`eZ>T|8$S+
zGbd}DJs#?(k^3ZmRJ&z7vxx{N{Y!rhoXqIdx0L?pD|Esc63@~imGMY_OKkq7g}U5E
zr~Hw-o?qB{)oR?!bUOrH#xLn#QT*2^{_hZU$}edx>Hi0UPVrFxR?>g$K>wwUF8O?~
zjV>NtkBJ+~&oumG{I3Z*rAuWk=?4VeUcOQ<l7A{wnXcHf$;w5IXPi)6GJaW(C)wzd
z&!-DIJ*#}4D(J+w>G(;U=P3TqR_OH#UFCmB&?TNagdumSLigZV#{X%BPWh5@MeB*l
z$#|q(eNNB`C$$MOp0$d98mEx-m;?RGHoD}`zY01%tK}$;{9<@cR^snb{GXxF<v6On
z9L3W2tazRh@ld|hdb(H8DIQ8!mhbB}y2O7_(CJw%UwMX@y?l?Nh~db;TE1fyx>~*`
z3cAEo$3kPgNuf^!P4fSAg--Zo`JQ8=%km8<^mCMWOb7bKHoD})rxiM-EAcE8bn>T`
z?@fw-HQg^Obh372JoLR-a&%GY-?h;to*xRjJ>3Ts|EgZ1{n+H_qSEP{M{;ygalWt6
zPr*BhlfFwvj?yLBk#uT*$x*O#@soOnzN18r=xRL23%XrCPqz7&@>!|Sy@*SuJ4K<N
z0=krkvut!J4|J|QIf+NMBXezZ$>;fkPS2|RUup9%@hn&Tt8%_l&?&!Uol5^VDe;`I
z(APQ8*W2il&)>4q5fyWE4hlKKugd3xivLsbPU4|`x8%sbTE24Jp7`d+Pp12<Lp(_v
zU6v#5%OOYcP`Z-O{YttjpN9$$#J2!`5@(s9(?!)Y$0>A`{~ke?>DD0}xlbr`>J7>G
zCo6QqDdp-s8(qp(y`U4$SxP)%#s6%DeuV@5Y8zcVx;`gv=%SY6dc{B4coP3N6#r^D
zepm7Dhksd)KTzmuJpW~*%W~Xgql-t^R&hfYwHzN2bbC2Iq4-zJ@y`lfEyouGoyw7L
z*5OAksn9F&Ecx)JLMQ*S9Nogymhs4PELG?fw~WVdppUiDMRKl_6}rmL(*&LTspVL&
z_*c`tOrh5+cosO&7u)C(&vHSxr_1-2@cO9gpKmJhsPrEybQR}wO8j#aoHBjlvua1l
zo(sJ<760Y9CrAF(cJNq6<@!SPKVHzuzgoYjjV4F&2l12TNU}kW{MX|r>9QYW_pjn7
z*_HlB;hr4DqtY>a$Q*^c5I^akY*BJVpM;;Jlg=SW@yx|f(#iHCNAxQEB%Nf29MMUZ
zC7pOnj^d|2m!$h~PtJ~$%7`5KzX(6+Ulb#wU!u^<a8Hi>&%;mpA3;Po;(==C%W)U-
zuhwfhGDCQV;V0vvvLi?SsV+*oXcid#a)mw=_vFaGO23y;IsH?(m+=gD^B3e_mCt6y
zKlMGO{|6Pi8jsrFQT^ZO5PzZkJVvBz=jRCu9+jU>3jH&<m-ssr`a*^N6NRqwfowu@
z#2+=DI!4W=KkY!5{Yra0XXnA6#fVel&qv+@ivJHo-j*uytMaDOReq{+@{YnEmCr{?
z-emvOF3+mG<-<=^-c){mT;+}UMb54dKd$;*wx?A6NS{krA#R8smPA}V;-2W2ihH`q
zc9ZC>3Y}~`azt-qcl=L|uM_=q3f(X6iQcZzsZA$G^p)(6|4D2_k0|s;aZmKi6nc|F
zze1t6D0CT?ND?!}6BT~wvPRq!eU-SUOS!lwx)VQTpOU<K=nszkFJO24@5A8dRZ9FH
zgrBRGc$&mL;g>uilFHBPg&(@8{A^O_GAzZjNTI9zBz+}ag}5RAS4$$U9&u0fCE}hg
zDnD;f=+)w${C{4d*DCb23f-^JZ&c_iKW|d#Va5N=3cXRGOPx=oCWU^DxTlNCPkB#t
zm7g6%5KiUiEs}_9KKxv!`1go=;?HLl`iH^KYnAvv2tU7|#M31134ctXOCA!vQ=zN;
zT&~bneqN{0<t@b{`x->^&>tMNBlJ!>87I-{C!NGVv|>rb^)7Kw^b&=Bk3yGiI+31K
z=+Y)3(td?rD(>kb?J<gfxI(WGpouPRczWHa&@ok*avK%;$Q0G(5=U>bydJI4|E~C#
zwj90oQ-W}GG1wjdyG@}>8KyV%9Sd@Fk!>_12qqF;+I~c*?{1SLy0mTRxmux*A%bvq
z3SIUw=~bsfA1giM`X_}xPNCDhJUL3Yg5B{yk0?~4AE(flEA-<P`aKF=+F<m$TnGWh
zqspOc;is1@53j=IqDv!FYZiurvu20G3j?!)3oi;Z)MLN&?D|?9oU)J>_fK24Vp*gf
zz9+XgFJCk{(!3@zd7ywb)e9G{j4WBU;_B$q;OhFbqDz;zuC714;EU722TbxT0A02i
z$<j$LEZvJPU073t-309mBkhZpMOFey{ozKoI4iQnYGjAU7hiP6lIHdg#G8yLjs$-`
zK!kc8<sadhyadHzJ;BvkENA7nba`}T3uI})%-W*TBReavsPdF6-^!NO)z>XrasA?4
z*s>zjqsxdeU-_zG^{zD<;T3P%%IjAUp2G^hxLyVykkwh)(U;rd#ieJBj4RJ<`RZDO
z7hf8L3agt+%*d&}(t0ly=t!`DrCwM>`uy{3<fn?$nV-!vpI@j<4zQ4g0oMz`VML_o
zK+cHL*{-X}Q6V$)n$!DqzDqHuzchl`g&|<x^AznGTZONyE}*t&Hqr$J%}91}eL-Q>
zWMxpQk}lc-cwO^~h-=}(#cLKVTm<4WP?s-Tacy(^8Le#*Y$aUjntb)jl`uZ?GFzzn
z5<BZ_rjrG;Fw)X241`oXb1(nkF@+|>>QI#|cCWTaqHV6p*R;3dawMwG^ffE5X^yO@
z53gQ+Wa3-dOpOGK?=Xc8kgzuwkS;t@m@*<nNiAA@?ZU+^*DhSTXj!4T*6WQF7Z)F)
z_#_t*-(hiaaebPLM+#Gliv(&#YovMd+>0(dgK_ilK(4N@ZN*kzW~hGlh)Ca&j_>T1
z&CS=gE?ru`21a8_p)=}|W$pEag4PR9&P4K+096C7uJ^TF4LK(fFBqr3l|AASvW&O2
zuB-=hr!B=z(0AR{kf%uV!bp9=pa)>?0BPjQTU*PN7PMsr3a%ce8ehJU)Z$*O7Wa{X
zq!jlu*HYG}aV=flzAVx#8q#Z`I7ne348P_@D>G?}7Jn|fti4%ih31xpOWPM+M_!h!
zY+cxbUHZ$LUC|Y2cNP!GJPaS8X>D&^y|6vHBC_nd=7r7e?XB%-7#6#zX^bqo8rSQu
zW7qr)P}>NCZ{b2hfxdh_qB@Kyz;`u@fm&o?;K6Q~cj2Yg3&D+*bEMVbJXR8_z3%FT
zs~4l|RiB6Fvlr&=_pJOQ1%iA5Ooxq?AJ%Dk`l|thncai`CDO{uhZmf2keGZtGsflT
z7mUl#W9V#RT%LZ3art?jmZv|K{OZNaR^*d^B%i0(X?gk!O{d)Fm-<=Ad|p1!%+DK&
zXnE^3dE|SV@Rw)J&u9cN{<sVSg3YMTXum}5Mw)rXrE2dF7*z%=jB6e#SPoG^$zA9;
zwk!DHi>_>jdA+zfQa|q^XuGM)medcZ>(5@?x}<sWsz`A4V#Nr^KiJ}|V7wrfEQ&0m
zyUFdX=-th~+*#Aw`@FI!3y2}JOb;UhTS*>93@QW+C4=V!=Giu&sW<%cjb#}hBzG8L
z%{LY~POCSR@{L7eaf$`<zzP<SYbMu-TFW}~i`v^4T|c>|x>}h9IsDreOdg4;n2bnv
z*YU@P)yWx<#57gPZvvBNL{sP1=%t_jG)_#{q~2`DJk3Di<vwy5K%MI%S`WfgoPK&x
z+}=w5uwG2Q(VRQwQ_l6tY(0p;y7a3>hNdcU(ycxH2M}JD{+hFRz;1qF`>SY5%AWo~
zhy1sR^e+(M<;9-<+Yb4!oz6q-7Xc~%w0_W@{<{wO?-uFX%iErQGbTwh<{3qLyTv4(
zocpBo!}t-e$jR#!0L1uD6LpH)CDK>tD(SU7{dow_;<AOWq(y&l)%?QvPxG_({5#=)
zL4%*x_ek9G`mdM-)#2YS@Y5Pq)!Fgif$%!~jRJp@2u%E=dEtEV@7LhJ4B;hidHp89
z>+t(YSm4BkKj7bv|0@Wr!+(#!FY6iMCppO%|3MA@D-d4dme(6V)8P*b;ObmGyk_B#
z$~bNEvrB`Y=E3vDUn(Y}Rrzm}X(?9|llnURO#;8%CyyY^+4(;k;dT7qEAXrGKMpbE
zi+_v;Kdl><e3#d50Mg-a6A8(40XX_>{{I@`b@(f4d59(vkmQF%B47L-4gM<;UgDP5
z6A+;ezg*;zOaF{Tcpd&V0>8@t6AQpUNrRu(!%5uodWnPn@d&{eFc6YEusg$r9Q4ly
z4So+o=F9(D4Srg0CvnRw?QhcYze(WVn1ME1eqKd*7MHF5?iTn>5uW7d6#VkVU#G#}
zgzyr#yk3DuMTfs!ECyPEFsifje;)kl@OykbRD}pk_)o(xU;JSW{zV8cam(v3(WvO~
zcL@CQJPQFMOMh-ecpd&)fxk%vB>YwQ<%@rT2LIIvFLBH39_UFO{%)aobJgEx5MGD>
z4uM~-zmp2U-=e|4M1y~*L;c+&@XtjU)!F68?NEPrYWP0|5#`JOhz5T%!b`r(EA1=S
z@xNLuZWGN|Dhqb}7a_2Y|CQ(PAgcV6EuJs_4h{ZmH27zLro-<S_;cA0WM=E|`!)E_
zDggg&8vHFXE#>+t;MCy{3;gfHuj=glpAUaJ{EY&?D*vQX^X2~?8vIKUUdoNU-UvWi
z{ABFHb<j)2+3~LdL5IIf;BOLPN&iq;=ZpU?4Sre&EOE>0T@Y{`{#|0RW-k5neT3KH
z->cz2?FGvh|3(e|&uZ}h3P!CC|9*jAG@}T~ot^)`M0g$k3Su@~HNUX_R{;0<;=fme
z|5}8Xe3#c>IM@$#o)x)`{F3^&<Nuk1{a_0GrU*&$Q-@!^_;+gXFGqNZTV6*&!RYwE
zM*zJ}q%SXa{38*b#bvX9)(iZq{+wF?{wFo~35&!nuLof#=<tWdpg=DB;cW-|XM@1s
zBr;C?zW_fw|F6LK1501{lb7|P;!zmY+4(mQ;VCbE)f4VZXL7=RL8tUXL>JGJujfMk
zi3TysaC=1h8#1Wr@RHn(Mb{rBd@0fyDEyr=A#o+Ys_Q~IeUR{h9Qf~46T`hd{hkkq
zKaqp~xzb<q0mE14z)!NNI{Wi6Inr-Y1LNM#zr8v5Z})Fc|IazfzbQxhKhF_9SNdaf
z;Lnx*D>?X|EB$ZeNWUdV{+HzlpDX<ZIrx_=|5I{=&z1f+a_}!#`Yk!a=SqJwJdhtJ
z{b`ritY_%&fx_F<w?8|L|L)PWf0KbzwtMnAAA@Ryso2*3O8wt~cdE0ee=)+dxNPD3
zMEesK8K(A!>}MHXwm%ziLtdt;iQv8oa!HQH3{)riC$CQV->1nx^<QMZ<#n_}{<}o_
z9ctpZm-r?5XovipWbDGJ`Ts1QWq6r?C;WXH{O2OP#4WFnW3v+R!d`x*(97gH*nj#@
zrY|WEBRq@CR(^NTAs}!nezKor_+0o)#HJ-N48ZJXKf+7g@_M@i{;oXnf5`#=UP=s3
z#ovZ!JN|o-5$dYh>u)K>CCEwt{3-kSe-NJX;+G!8wRRT2k$fWgZ^uu@C+R-|LHCXE
za*@7>E_IP|F9~0x@OY?}1aXz&zi*?<@bdbyuzzjdT>q74`lDfxBCf1&jBga-D{0bD
zaWemsbTq>2_!k!Zli%YY{;kGOhL`+nLwK9$vZ%|2{OuM3Nco+l2|uN#rq-i4{zY+4
z;P?Dreq(&vv}wYB{@)nCQ&s|`@5hh+k71?89#Vf9-%M=5XBzFFm23*d&r5xVI@Y(}
zh|#B5@Ud+();D(b$k~Y!Z&z_BajiQ!F=V}H#vU=u#EtH~lt9qhW?Hk$&Dgdg(>gt5
zEiMgNuZOHdA?tbee)jgdQ*q)}d=>llDqf23dh@T;ZYK7DR&#)PHsdBfoE-928|5ye
zs?O^%uIM&Kxy&7Ylm^cC;U5U6&pCR2h4$5z5hyGI`7;9<o927{2kv)AM&hH_UVMFV
zzSm5anvdh#jS+7^erx?eo!9R+*4>IoaqGeDdVX8#j*Kwl_#Pxnt08_9KAJAFKwqak
zWLo!g6dc>HMi5T%0r!UZs`RJV$u}6!eWyR+iZ8!5Mdz68)2}Vc$2BR<FpHVv>1@N{
zt3<4p#8QB~8pPgf@W+Vk59!nQb3G=o;p4aXMlb*JD561LhEe`2l0)bNtHbZB2K&uo
zQvZ^-HQg){8HmSdTFlEv_ttY<=Xg?ELodCwe%^e~CtRQK&|>B0C6hg_Q&&>{Q|=%1
z+fX57KvZ+rt0bYi?+D%LRzD<E{2jOcJ3V(IJn59>f+-i%74g;K6GEh4NU*zz2A9D*
zPRjZ(PPKIDR}bRWt%R0(i}oZFT|Nub!!<+Dr7DK1PPyW&6)Uizgny6lCEHkfEKX@o
z@lsrh6+H3{r9ZkT9h&hLv|aeI3NAg0>mP_N!7J}x15b7S=?lj?`kyHtCA_>n*TFx?
z+H`;H5YKlV;-NFIN7I4%!m+Z){js3y@Vw*@PXof}{Qs84Un-+dah%$=QOcS4(npo>
zNhLtCCeKJ}ROloNlD<ZvQ&S`9w=49c75X;?9mzA9lm36G_$Ql4(jQX%lbs~#Pb>Zn
zg+74_29EHn^f?Nh_$1?*r_j~>HYs#9o@)f1@KYKxo`{404u!79FVFC`<78i}6mhFK
z<=MOBU!}jG#E<T53Qw;>r)E&%BtPUR9(4aw^lBo)eG)%1f2IGki3mseB`KA3(Zyi#
zkdBb_Ik+cB@xwe$(Jv$-9MM&rRHo!8e$s(59-@(>Y)G9%&mQ`NBmW|c?75BobGmBw
z-KNknU66L-EQ8D?z0PZ2X{q}1Wmhk5Yg@Ra`ReF33zw}}+B$7@%c4k*t)ewkQ-=&J
zTX9WLyJit<jD3ri(<aeKYkQDR2}ticb}hOZU%E_hbj;e@$afNAt>g0M6<89wV)b<c
zF2+4PJlG4lvbjA{e;xK`d?@iRYHMp=v4pmNAbR^YKKqWefwp4!BCWKO0KBfp)|NKh
zM3%a)YrgI}Y)7+iTCs05;oCOyTjV`8EfB1Pgjg(%u2@W)PWj4lt<+?!{2eGOQ_r-?
zTq^Q>SE5hF-UlJI*mY=!7@o6=t#8+(B$#|1?c$Y@n(3~|OwcBuDQ~9A8(LwTvEVjc
z$qxT+2r9VL4QecYQd)2eY%f(^K=1Fuk7((Zm8dS4pZ#b5kzP`r7x7bg(w(aFiwDxd
zs*}(1N^PDl{jdlm?HU<}3@4wdJtj<kNf6gYk)b^z!-S9g$@ZIcD7gvXpDukr=;SWu
zm(;&K{o~<Jmwv5CXuSwY=@TS-`gAt9F8%c)eQFC;XHWk=hxB)fgk(M`eInV@ZxH1-
zRZRr<|02@&+USCv3^Tp@g1~PRGgr3=FVmCJ*q?87z`sX$RPmENCBsYlX3%tFGdo54
zGF^F<_~r9P3Xfm4B#5gFpKEO9rwDA1lcKoB&JYo=-S2xmeAd`ZiwJ**2q!Nx|MK|&
z!t3O(Pk1ziM=F1k9T{Ho?`ZHz%PNW#u2H-s+@w<M;iuG0o2m@Wcyf)+)YKL}HY3k*
zB0PTj!~fCX`c`(I{>$}jT76qxAMt)P<wgvvy6oRsrt*`0X(>lUld`MQ>L?;OmDb2f
zOkTvT<Hh-Vn?f*bA)UX&X>VEh8VB`zI}#)HRn$JMq<@#u)7Gk_lbx#e2_-TQ=;TOr
zrC)lUMt^Wbr=N7Pju1_)whM#@qRY4$Dfclqv~8D8pu)Gh+ncdJcoFv3UcJ1To%5CR
zjGUUYodXVF;O2~XYE2r_iq?f~t+4s<74iBoY{}eNs_{uwSz)yYA*8lE+pR~z)x*C`
zL7}SUBxAZq6zchEq2s0Pk&RIk%`TaK8IkRpQTBL8eY%0d+tZ^us=6ofpbH-so^pk!
zu>oE9raZ$_SY7xw5#F9(JN{cKe5k(_mktqxT_Wm(a&OPijd(}2YQ+!T%J8|`+;RlA
z$4TLj(GfwnlTYR0v)WvF{$dM7ra0N=Ns<TQiAR1(5Lek&Hi>5%=OOz|hL>$Fox3eW
zRrutW4gqwxpwc60J$rb5O48)kDWc)c)#jdEbLO<^)5vrF^C4><m8r^n`d#x%-L77N
zO<pd={KsB;z%cif_Lm@sd_9qKL)H$n>M_&(_B|M0?_UZx*_hDDqA-0=MNX|VHkIKw
zs=oH|wG}syGyAuj{XGa7eGVh<HQn%Ie4~5oJ;V=t8=sz!2?wo5gH=xjV~6&yYz<lu
z2dzH<8y?559)($#>3r6u!S`~sDp?z{-WqV~Wo0QmMn=i`mp54!8{BUNw%1cucbl;X
zN|hM~_Bx#(ldMv5`%QqTdfT-2n{V$j-MgYk*F51ru)`f)n*4lC_g2$-*Ni=n94h?i
z*;5iSwhRrryF*sD*|WDcwr76`JmB;>ZoFu)dV(iE7_xTK>(KC>^g6b^$c){8D0&~J
zMa-V(ODL7dI1@3M?)%M?A2+#gbNEiPW|zW5dy(Z+o>jaUjR|$&1<LQ__<42l;dQ>p
z){eV*ERd9#v7QntzUQ;cE~C6230D2y=t_W5LF*|LR>*qQ?0LT^7<>Pi)ua5bSN&b5
zhZ2iRg1$$iXC^NWTCWFVj}>2#nE4y3eJEna_K@`)&8}hMEEwBS6tZTR*0rSw5;-Xt
z+jcM*d+}f}aal>odKq&@q8RrDV-J)Bc9eLjj0P%Amy6{fa(=o*NqSZJMY))Z&okXS
zf>vMf<ej3>Lc_bwnm)!0-&4`2(+p4N9}`P0A?u+AYkSao1j3r0$FeYwWm*w$#eqPn
zJL)%g)Oo9^;+XMap#*01Le{$>tGB`0-yik_QMKZDkJ&}H(fKB-h`FxYSVzP9+lyVj
z`-y-#KFqYe#<>+=;w?85%$PEfP_>yjgL7fIx0X`!vnT!u5=7b`nPeu&8~j$%T_xRl
z%!HWfV)Gs}{pVrPoBUfRW+L1ljEB7CLCh0Ym{pIOJ%@^^8sB;g0EOa9diomHy<l{%
zBzTyJD>rv^Qx5l=M$g<*<RCf}ne7h)X$JP?Htg1s2i*Y7(G19sf+L~$a)SJ-(b<is
z0U-zD^<epOVi_iHU+WKp#cRDLk=bLdi85@0@FDN4Y%s5hsn1s$tUV3Z8=Q;2y~fvz
zLo`*2sYX*wn>Mm{AXK{}ClCZbBP5OO#qQ(?`~`NfFEgbDiA{)(3t14v2h<5s7LNV7
z6nVU5-%cQEupSMuvbG+APzIqVt(o3*lvbygaRBP1YM0s5R~)?e|NWS|knvx8g0X|m
z?MU%u7CVUwE6q{-5#keOw3_bvn(m<Q*~l!+0Gkk$(&Xt&xju<sQCf4rT=#_E`1<x>
z)!&2e{nnd@?(Z6f7Qu||s4x-eXk*hj%tA+hhneT(6NI*cVuezVc>SobxQD!BVmo=v
z`Va{qy{Mp81=n&jUg9<5wf<ka1Do9Dy8g&aGd{P%oH5rE8C_p<0EHZ#l3bH&pGXW@
zJ-CDgjMcgVKnAe9{et(%g(%yK;EZ}tWK_+oNq>fZ;Klwrj{|wyb`N;$3K?~KljB%~
zJLuU3D3tJ~_4PHc3V?yy*Nje@&R{iVJF6)ir_nhSPsXOoj(fe#xQUJ;ai~O<@f%y-
z>JL|7Ap!DT4h|cg?;h&!522!%W@3)p1aGP-m)83vUZu&2Or53MpTPEEu3-PeP@NUQ
z{vAQzpCdO0I?i`TUke<lcex{|9QEbNvb6tTqTX$6DydFEIYvM+j4k{7FR5TS{I%Pn
z{}C`Y)w?#hBSR5IX|mXSd@u1IB3d2&3Q{dXs%AfmG8t3#Yv90kH!7dkWCa<mCe)tZ
z(~&1BFH}C(HkrQB`3BzgzK=g4Ppq_M5wqZt;buRiWNt;0YnkwciIUS$#zhRQ@r6g;
z@9$@<djL07dzgS8%j1i6Ly~$--)^Jxhj`uLD~cwKP35#I0$C52nlt8mt0TLU<pLiT
zM=;8Elwh#`(c~5g9;A-4<ELuOixeu+TN*i`=2en{+Ft4*FcLjh^=`u>(}yI8M(4k?
zN8}5_NFoJKM(4kQn3BWg{?1pUC4r8zBIJV#q&9LK#}nw7=`D)PLQ{$IeE@Hxufkgi
z)q^3dlBTQr3|`fvjnqQk@&G9Z#pDTD?;%k1q2!|(B5r)W+h4sc(wV$fk!}LGZXxtL
zU>WP0anrj5e=I%3sye$plA)h!A@(7xX(?s4-QUtsp_OR;MLbX%+j9Xagz`v5tj`}A
z8S5*Jj{XgGV3Os(DW%JBRM8>7A+wy+a@b6K-AnxmYT8;&>rvC{VX$c7OBG}@-6X<y
z^%k0{t9gR?V2U_|mair<gq0>~naU6}e;ZXd586^TSYxhxCVFggt}&qlVO>n}W><h1
znP$duGh?<VGNQibh2$rNycWZf=IR29=7Gql<fx4LaJReWnFf^B*dRnFNLp)redi0&
zX}#Y^E|#tj+()T^5}DZhB~XH}8LWODAIc_LTwl{4sC~fbY{N@q6LN?uIf7)ZHaXmw
z0ITYO;N$x)OpH9u^o6{Y#yXNcXrP<M61!k}yd<)ptYUcK)4RbPElZRP?;>`AjWtQE
z@_`{itB-28my|+uVYH9|8ryTo?BB^4_bcM0Y1G|+pocYY^O61tq;LK9@mFHc-)vgj
z&8nwXjbe$)6uo#4??`N<tBayUL&_2hQDSHSw&P^|tYT?!|2<?aA?+x*J<`|&X^`a+
z7yPa>wuHQ`#+E+owUG5DMUApV5t@lkCLoX$7(d~_Wpr)f%ZbpedSI)hqBho@2)$#9
zD8ndZW8FAXM|1E8#uLB8;5U{})p;Aq%o&k99f}ZlkyD7~f%t{0dd*wjp+4}<1{enb
z;S$rD@AX)vq@OB7*4rd*XyM+pdYL3L{bX8hdhMY#T4C!C{*IT~3MHfiEobebRIE2B
z?$|p+jN6_i?!!>*e2Q)oa}H95+f3iifblK#x88`HSKrwk@zK(z2+AU@@8dTdtcwq=
zvt}K%&VzZ2a5t2gzBkd6X@5aU+TYpF7l}0?&ebE6jbtKTg8Nk$(JQuesxdia*DJ=R
zCrtO7$x~%}$~#Q34$N48QNZ}u?vQ&sbtg<;&&p$rP3P4m=Jp3V`fgnPl+PD=A_-Di
z;*$Q3cW+#6#9jS6eLLHS2{VYQ*w|E|uO!vlA2oWvfDA(g^GdWPRf(c0jmZRvFI3|O
z76@Tsf;BOIr}Yk0B<Y>#e6Au%KPf6w3W8blAoMnAY6$!v2}T#C_SNLqZM74c)9747
z>T$JHkAwPfP#+HJ!$EyGs1LchIH(T?_2HmCJPdufbkIH=v=8GYr&f}|KiFR$>@WY5
z_m>M&hkK~fP<NTOQRuqM=Tmq2oK$ytu)oYZ(1ZQu!SO@Xn8EQwY;qnPKZGQ>2FDNa
zjbu!Xa64>p{175BIG;ilV{kqNmet^V%HVv;M`1pNO(8o>GG|X4(>&pd!sm`@kr3vN
zO{{Lf^yPAzZ;a5~F(&ck-0}80?+I@F9bZrL%9S*ge0(yb&If;Z^T|I$L1fM+e;X9r
zj8%F*`DVOyoKFrWMo#)io=;YbD(K#q|9moLmFIg`U{;ytKTn|k;qfLd-P@ZntxU@h
zFnJyhTu#@va9|#v*Nr_;ojJW+mNmUxO4G|{XG|~CWPW+Z9P?B$$Nb5TwcZn4>QwU^
z15P!w6>R+M5t^MY{Tm%1lE)<T8+?-a88mCG*Zc(CXeOC`)N7t5d(CV;!AI9VEEn_3
zrL=IA7NBNMFh}GBa}2Li6U^7ACYV>zl<$y0$4GC{|HcgS7b&@~=x3N|aydQ247iHR
zZ+>M^KThi%)Q{=)HiP<+>Blz*_2bU=LH+2((Og)9IA}i(+K*yA;-G$H`q8K=#C-e{
z%o1ik{*G=m=HoeJKAt7bN4~y!(0(Li?t_mo9<KeEv0l3peZmIokp`?Orp<Vn3$|$&
zrC4Rnwm5|eICZXT(UoTXA6n*$-7=}YN=?dr3r(!Fu^`G`rK!|^YNF|F+8056EOv!9
z_T;r==_2fJSe3E)XEZE*ETHe{!(w-%vjk5eYm%2bfLM(?EOm;a*ameQORqodXKU`A
zHZ_S{dngNR4=m-{V_RG9ag)+GIcU8~%geEyh!&OC(hxxt+s=ZpV_5bvCh*DR*wp%2
zW$|%zbl`4xatiJ6Nbk3ltDuL{n)74Vr`D)qg(|H#j~4NjvEx!5mlJ7u`B}Z+qvD$2
zQrDMvf#f(Iu!8(!y|YKIFR#p8U(Ut@YK?V0$V6&>$fK+;|Ae}}d?a6Aj`h)d`Ra14
zC&vnHxw;&5Wp%m7ow2$ctF7mIE0ZHxe46#;9=X1JqF7%(lCLjEq`j0FTfC07-(q#S
z$DJ;d20j*0n_6aEPHW4@Wbj+8*TNXU7TSjpvT#}^7RJ+{(U|(02c?j*ApnmU0%*)w
zUw)d5-soiO%W3lp+d^QhJA=CaV|n+VRBUaiYOk>=<n_?9dbY~Cl9qq}7CWV=HkF3r
zUN6>j)7tuDnbf5R-#zYVW%6`dU!N=ge9Wra*u-jPC#J>UK*r4YSxg@JX{2oE;5l&w
zCiW&q^vkkW%U(0>DNps9*QSK;dUaX0N36n59oy*_1kSAtrN^|(x;qFL+r2`nD6gg2
zos{C2lk07Q&6Z|IsN=j+F3lDig{dl98}J^AK`4a#?wgRB*Dx)v!1#_y=DT+nys|r-
zFN#vD48=zUeNRM=H{%Pu<=6>*Lg2twcjU}a{L0e0+Q%YOlgk3XINe{nrXn&t@QX8W
zb6oUEGcgO>x!iSK#|QWxvfh1EA0JO5MAX;7H<)1CfEgb_W0R+23mjI}-*Sj{78tkF
zZjnH|+Du%J%?0OJH6o5Hw+5{qe{HSN`Du7SLhk7BP{MTgUdSJd*ke)eO#WER9*cX=
z;EyHjv84AT{y2m^4(T=c<52cEw3k#eVjjjGhxL-|;IWiFmi9i+ABVHY;l0%M<LwCc
zIHLCf{&*C7JgWDX{Bb0E9NGIH{PAe^cy#Z#_+uG+EbHy!k4AJTa%3deBHD6xU!H8k
z{U~-nD!ByrquKrFWFzj6VfV)*L%1Kq?#CqkxIdQNADf(p`?2hPY_byf<JkSU<apdy
zu=|Q+IZ`}6lxRE-wBs6#x`%>QJ!}(oF!m1iOvetDMn=RAl}E~AhekvV>&>9=@wKHW
zi`YA3Z#+@7de}c#;tnR}q0mPKx{3n**qeOi)(|#MS3MQ^of$h+bn_#DjvM-`quWJc
z>H{Wsf)6PdxFT@*rRFXBc7bAAzYAhJCKM}nOhR+hR;x;wST$@Xlu?CkHbxb8ml#zG
zyiG>c5^tMP^%HLgLK;<fd)Kq;z1}-<O;<%U#gv|D?V(n=n{Lr6?`Nb=FKvc2@2S9l
zwV-Td*SA^a2trX|dlr#so2c~{Mzyv!tUC}v7mIsJCxyvWN(%g=?P|Mldu8A=frVRH
zC_FJ2PH8Rd0_2v%r?zI+<jBkU)#BuRh*7b32KRFh?&qd9^&`2T8}<_I=QgcrX#cVC
zH(hOHwH#<i_px$EHyu%qDT$G+PSKoHIJK2~F6t<bB}h)S*_(&GpW9D%uBq(j#@09N
zt4yAx+OuTU*!Op1rXpj5cfH(Yi<2r`uyZ4)Qlnc++h=Jnck<K>drj>3jy}UZrS@l=
z@sVD0-Gh-6&3FLYHUpl>DREcw49cw%p5T^vX)|Xh(>G=u+wx|5u>q69i)~<R54dU6
z?KCaK$*{z0*?#Z)&^EID-kWeEVH=$X5LZ0C-P@q<MK$^#bi6>Vy4m|xW`pp3-nH20
zojk>cj~!sbHh9wp;BD9d99bLaxY6atKHvkx+z|t&S9$Vibf!7}U}A1bykw)?UL74R
zk~XaE{g=S*#YRNmw&;)0I1S@_yXR)??XHb}lTu7??*5`358L03GK`)@d$VB)p@;|E
z-|ZqJYy|$8JukT@d6kX?D-dJdFm4>Td2g57ynn;Dd6V$s@clgYch_d^@2-t#_II0+
zG6^e!-HA!;(w_+t>W`k1L<dpG8POsz(u6>=U4q!&J0TTvJVKtt-*Z`{7@i|5^_b+b
zsc87V>x@0${>ZVIzeU-m_Ip!t=icu<A;*62jP`WE`6B8dI_=l)z`GB)Uwe7sbMATW
z*B+Z(E%ygA8R8qZ7t4NFWH`#COvs;YKTd!)XU|S`V5r>H{-CW}A?MGdp56o)g7Omk
zyQ9BJ^|Xz3t#~Ep*30-_?V|<0e}?_q@mlQjP3cp?Z)-;#dgjYN&~EJsq%D;J6Jy=+
zp!BZ6-$!b<_H$7GY$S9y-DpNa{WKCfBQ+ALv_~J^@lf4<ZRks}N&i^Xo8#qxKy)Ih
zyYrI)Sy)*+sw00%)wmLb9B!*-=)H5*Sm4w<DXHkOTpyA$Q$`Sk797-ngZl5o-j6t_
z{|5Enp#DR{XFIQF(Eh`C??1tLJs(5;SJ-asLHlpe{v*SGQ2)6jgZ*EAKHNWc|F@vs
z*EA)_y1##P=>7(%`#V$V{-)PE4EBHf)uF+`{%>CAH4cvdeU#2?{21DQg`L(oX#Wk`
ze}ncP7E5A^anSzzIM{!K`cHda?Z<5X;|@%ju=!u7{V?m{A-h{kOJiFKpW9V8S>(T;
z`h?_Kb^QikGw{DL-}|q~yTg31x|dq3?>^r9sRy$6uuh`IzLz>A&TtRR3t@w`mtU#_
z^8%OCb6a3uYBjZOJGGHD|2u-_e_Jx<e?KzYss9=F!{ktavp&cK@L_GfCJiNLfJvR%
zXMhKs{~gqSPWwZ!-epk#@uNSo&y)CP(SHSQmmbuA$wB?+#}F_x8MD8|GHCz(!+f7b
zEvkQB{a4s_=s%O-(>^o$IFxP?;0&4tnJ#BR#QM;W?)-=LJe_|y`%l^bbIZOpFc2O0
zJF^ci@vlmKg!eliEQWBU_B+3Zr+oH1H~j<bcgC{Nqn75g-x(e!ruILiR$=3NT7&zY
zv-dm0Rvniyej>l8W$ifJ?arT&i-3*Jlc<B9UV;CS+3(CwHp_p%a}KR`M3yxdvN@Vm
zQS?)MSu^P@d#5&YKcvw)3cGFc+Y{OQ5=u<nATrSY<{GxY+4oqaI(ZHDH~ZE!MM|-~
z*|%m%^r`IK%`XEe?QZtvvAg*@@T=Y3?5mBIV$(g_&K%ebUoPL85~Gv0GY2*ovBy%Q
zleRMlHbeK}?MO%=d&JQXcq}(MX*+XZGi~bjtr=r<(st&+=ArDdf^UTnY#zoQ#~Yor
zb|J92ls$TkPTI~K*gTv)dW}xn&K%fGA0zawsWduiJ9A+3QS5P&(Mj8x1Dok9;=VQ2
zMkj4&4s1S}Jx((^yVzqHd#uG*IyW2ac4nkKu(_Pw`Xko_HjiSrb&&;u&7;|^8M!2|
z`51N^ip&XYrc)$*Yr>Hkfz5P^g>TLLNOfQ{eV)&^rZIAAVDmV3yC8CWU^DI1rD8Gy
zn~!6+ON@22bN`~m$S!3|^MadC3|WtvJ^e*lJDW}4AH>e)#vAczJGM0*8=HqYZESv$
zZESv&Z*1O?xv@DjT=GF|vTo^(LRNuDI;DM%?W<)UTYfBPJ&BJ^D?1=Dvt-Io*2X7!
zm19OqL;Ul|wDS-jDaPkXDPpm4IQ@C#Qu_R0VV_4f;|=%}ZRVGTM?#d+jqf3rlI@HU
zeC-;?i?CxHIP)lFY=%D4@N{2qUe$`RQ1<2KNOLe=f>Tgl#<ykzUBgljo<J8q?}{&z
zTF>GnkN$8a+wtb`ZRd0Wu#dowBYhNmpw_O8RBa;mTVEQ&i5~bO>;fE|ioaUg1X@kU
z9(X&>b4A*=55=$(Ok@)$b(C&*O~&TLGCB`qQ80c{Y4S7vbFk0QSVx~7$D5&;Q@k-4
zpF`g%j;y8d)xr2tbYw==({x_KyZpR_bD#|Z@zG}Db0tCROzgnlLE6IAI}voYlfSnD
zcjn{02(#`%qjLnFQt_l>`8xusvGo2G1b#SYw3GJu;Uo6^_=US63OFo49>4HI{wR-M
z_$Ggp$1i-5Kg#15NTnmJJbqyrf0V~Bh=U#E@eAT$2YLL0IM_iRzaS2FkjF2GgB|4Y
z3*ul0dHjMn*g+n@AP#nr$1jj31S*4_#$d>U9m?5bxjfim6nh*c4|W*M9!JZA9gbm-
z$H;>n#<0gR@?ZyfAOjujAP;1qgB|3740N!AJdlA7b~uh5&Tt$%*x`6~e>^+b;RJSn
z0z24YJi8yy4t6+^-Ji$~b~uUMpTrJ!@Pra;CLq2EIN0GaMGH<aZpZgXA&2Z!=@7M<
zz6R^DVC>~X!C3#;$ffwNh%O1@5Dt8-ewwl6qW-!>@cRMlw}IH3o<QuK<Livsj~iP?
zBrXB*!9eT{PwZWyJy`Git+DP$U?+Nk5OJ5k>%5xo-aA0pUKCDCzQ3y$<XedC#+Jtt
z%f4^zjP3Wt-ap=$-GgX-JEP%P_kG5u-i`-7vA*MtO+Ci!ZCyoF1<pnl5_JRhc@E#w
zOBLj#AlY|4X4N0%!LcI)I9~*xC=FW2Sf#eaael?IHx~!`i`YR7S8W9pI&UIySz!L9
zW^A87Xg$jIq-W}49QlL|>a5z+Zs1Zy9pfC0QxOUJBunr?Z>VDrJ!Prma#D&o+l1+L
zrkL$ttFL6yXMC+b`@`=CS={pMr`On1mO6fisbc`nfcYWdyBKFvtya#aTGfQT&ZLd|
zBbUqVZe0HkW9s)1Q@;c(AN^Y!9n1BvKc#>9!5NwAH}kxUk4t+BPU2Xkk4k%LsqLxt
zf7hPE&}Qvvt5bX0#M;xVW*kOyIvvfU+7Qa-^d!)Eb2<ih>E?7Op0b<M{r2YcS$lIT
z?R{!L6?>oBPsQG+_EWL<sr?LWPTBj^ek%4pwV#T;Pwl5-@AIBSDRhNz4eWj1lStY7
zyeE;e_jykuW$*KzM9SW$_EWL<sr?LW7WTgENeG)?_9TSeFMATg_Ln^gVgJjXgy;jv
zo`mcNpeG^w0q9A{egJwBvLAq+gzN{PCn5R))RQ=#<+_D>5+|_R<<yfH&u-hOCvhUX
zjZjbGBzC)odJ+@Z?OJ0UozZ3MNvt()KMGXQn+WlybQYS@^LbPH9vaa`)|57V?3>d0
zYEv3YbajAl>?AQ<Q|{x~zEVT?QE6XEAAjiWD;Y<%bvV~0<H$@{GY4jsx}!BX^uvt%
ztI>a&CO#vC?vJtVr>H16J8qk?<w2a4#k*2C|LUrK9KH3jX+0$@DjWc$v~<e-k?r52
zZGgd&d6?!<s><;Q87&8l&OQk3K>fpDe5k+UEw|s;^a!&EL)L-*`8#p!V8~mF?i{u?
z@DmQp<q3y02wh>Wdm?fJ9rH09eu75bAslIzJT5h!OUF6FJbc%5|2F9RLnKUx_)mhV
z3yxk`ZO*u`HgdF?xCCdcU0U7cPL5e`Y}zl^oV4Kd9y%T~*uR5eV99YH(G6&-Le`tf
z4V~T5A&k+s-t94|-Ypf0*0f@EIFz6P9#?8vNyhlang(l!^$0tr?Lazy*t%_G3%8JI
zOh)gr_ywhJ_qfmqMUJz68+-nO*t?|>BlfNzN8;f1XYoOiWv9af8q3Jg?XFYs4H0l)
zROb_slY{*|?0}xsd7)k9;w|2EJ`vq7;`2wwBGTxwh{cbyNxt6G{oIg_2OE<^f8Lrb
z`uUQs($q0)M(5Eebu&(FiYt^@Lf^Uwd0Vzn6M_MR2CGjT5@{~p8A{9?8I0`+$1g0k
ze%tZ<#s=&Cj(0tgS+_h#XTZhYDUVJg&WB^~oDmrkd*}4%Fgk+jlH|#;zM{3qb-Ys@
z9Ye>YToT)f4$T_=c3!f$!FrJr#wZD@0Y5}8WRbzg_S1!M&>gr^5dy685S=ITE-OGP
zUPs%Rjufq6vV<>uKs@oy792<yw06s~A1P{P$lDgZ2z7By%B;T1cHErN`7DicC(a@U
z<vKX>ZrkuGI65dVgYv=!R&&tk5tkRPTA(?i=m|rQ;DB7IQce*{WIQPmd0x+9>5u53
z{`g1HAA|D1>fXnwJz-NaI{V|6eLK-YS&v}IE@-Lthd9@D2S3l1tdNueg7X3so!-qL
z!BRkv8lNvai73AUWjlXCmI&TROT>EUmcP=l=`HWke`NU59j?ir#2j!Dv`aZml#_z}
z-OBk^QoodgO!mnw?@=!r(;?&O^vFsqF~pZRBFDwvD~X<(X{^lY{Q`&OPa81x$<Oh0
zqo2<79O%OMUMD-_mc|xM#k@I<1}eCDV<zt9UJ|#lqiwfPFL$GxNl2{k#G9A)ekUu*
zxy~^cL(Phq>v1Y$j@WOSC7_?DfIEss!AuJ>cT74@_a0z)(<ldDQqcONb9(8(+?ofI
z=v*@ipkuv9rb7qf7X!cmF&Le<BLXssOgcfhoR-a-=HkAF#H5)B%ndqrfG3%Bv(qNs
zStwYXjF~d&8er17lM~6LJDyCsWAVPu>y|bhy)I%loh*<B>rl}5K%~NS^O<LpI!;?L
zS}l$#H4_VPOzEp3pvNKlIHUA{sIoJ?Wcc~X@T-Mw2-}a$I*)1nk$E5ku-a+xlzjRr
zx3w?;L*DV^xf0f8gSDRrCIqiWFfsUgDzb8%+!)E~9q`&?tg9k3nH^oc6O42)7kRnS
zDzLxe(8~ObMjod3zgYk_5Y7-$B+um?N$)02@ICnl|D`Q>IwRc&3(Uyv2*7dxHo^WK
zKws^K2d%y$SvR4th|?N<^&rTZ`s%l!Kwr^|4@qB5B7Id$Cv6`&b#*7;lDcYC>NHJQ
zD(Z@Pfx042WUH%x0X0(*3U$ST*<yBQtE&NGzbPQp)wv3|VQGa!%BGRj6(KV!GqqKH
z?_;1sTR}IZwAJu*V5zN~B1kK%#+0&Z)G4d#BdM&28~G@!Ca$df8f6tGWo4$771k}J
zl@*p1c4PHJ|9;cxnM?E8(V^^oSgbR^sqIWPGi5c2loh_Ra#+fWs*bVl)ReNKI_99P
zSgDbkc`0u_!GdUY&5L=*(fcc#t|?4i_TFO)p326yyfqci#y3<&1vZgW#&d4j*98I%
z>ELAUr%Y7;a%E7b)7yc!ig<4&mP<Q>b^2*gqiG9`+uH|HOlu_CHa3{j6u_bfHkuNm
zbH8=tDNX6dmm0}M_VJWOvhAg}S5w=I6Y|+P=b|M=Q(vJBBx2^3RZ3DlwKOv22Si}!
zL^^<b5_K9OyM->A(XC1`ZoP{*AXcUro!?|>(MX^}ZD6ZaU_~_1Ds)%`)bNwFg7Kl}
z@yQqV^_~)p4vj1^V?B7^hi|Gh_>krKCDk~z`*GBvho}Z&81XgP+@s)RkL@;Z2M|Or
z$2SP5e3iPf7mso|0J|r_tjd4z=MV&wg`;?cW8?jpO}}LyRYZ2kJBFbS9?9=Fu*Nd;
z`we7c)At<6lr-=0;J=!s-pM}JU|N4*FxmGTZWG^c0GAJ$*3<08K%a1+)S{!99VAtY
z`Vj~8ESNBp9OIzszO)^Arm?9sCCH^1wcKi2`?s1^+i3;a+GEL-EH^fp?if}(yt5{X
z!tE~Fs@6x0xhwUL<dZ)6Gz?h{S=)kGxxto=)xo$ONuL|4+8>OY74<c*npHg^<KkY_
z;b7GPjBMY8Q@QC-RE!7rhnqsa{l>cck*S7tuNq(e8g7EI_s6X)pPi^X!_~#c9V6c3
zlBf(=!WFV!HDiw$X5vQPX&?@=N)p>vL>@5Y$b2pLdW=mG??{X};(J1jr?a=0Om^XT
zp9=QfA9Q_^Lugp?IEm#IU_o@;2fk_qbCrc_@Vyp2t)c2=tRuK-jP(2x20<D2zUT;Z
zM|}lQyOJ3CPV<K?*&3Z1)Lsy{ioUfW2DZt&a7^C~JfAVyVLpS-!l(I+kLYB^2_zV)
z$qYWojpN-Nm5#$?2A%tkQhxlk4VclmpBia2*QC9S`Zr9PCb<oqr1^}I8?e@=A8U*b
z;S&p~@p()~#CDWe+x@$E1VO70UbbV><N(DGOibGt^t~OqfaW=V7odqFG0kxrra5pr
z{-xEHTg+=vHwzz5ptK1^@;{6TerRp1g?p9``={xT$RCq`L@zt54};1Q&2NTdfbr^E
z_LYLA_*fik4};d*X=#J1VJZhEdmq?wDt^@adk5FlP(x%wYOdp0n(IJ!wbT19e86re
zkNO#p34F#Q#ZNh&FzWE<J5EO~L_-}){KUHlX`8UH3AmW`c)h{eqt1GGM+R?sfcz<K
z^^2t8E=sF6l;~|Nu9S|$$m>tM&mmOu6VzFrKpGCKxH=h4G}+A0^W>)(x`k#-(8|4@
z?gG<d*LwxTjENAmZD<aeh9Hs1V<JRMg7l+F3<#q%qgA8=j9!9PkxE%<743`7d-87(
zziFQhp_<}2A2KLkgYpG~>mwpx>49_9QLdrz^^r`KC1+HQhcXiT`3_4zWzMGz>Zgx`
zej1b?n&ST_Y~NTfT0cKS3m0j;^C`RWL>s<nyt4&YGM-XK6Q7@<6^@zXou35-b`!n$
zkj6X5AK|GPKcG@yNu8QGy*Oowk(tB1z!D=aWRG<^PR;0IE@fklY)wmjd=B*XfU#?*
zX3EpUm8pppLZ+FTc?v~lo0=Jw4h^Fb0L0XcE(W9X8;F36dQ*&cE@x9S7bK=lNm-nx
z^%hy2{<Ot86@#k{Sal=T+6)aQu5%}`u%>8j1(}-1;B~#6mZ6uJm7)GCnlR#6(6@~S
zoGNKt%hO=J9XZbIdAXPyloq}+x;;HXL%o}D%`-Hd#fM`KF>f@ds!q_n4x5xs(1ffv
zQif?B6EtMMR>I`PQX~3g(0CS>0eFVyXP!;P<upITc5buznUJ*~2CQw%q-wyXr#1eP
z_jsk4pZTe6*pUW@{*-qly+79ke<uIn8*RbU8TobIqn;uoUs8uX2b`bjf}CjeRR>;>
zz9LR*^wsqsXX>jPK!LuZ7ax+onsj8RX2L*9>PnrO`9!9=VqT!GhzZ&1%5iE&7xU0;
zbu~cj+Nl|3E;uzcL&(@rw=$7j-}`&6t<<TRvTSX|re-t|q?MJNnpuu{pv8S3nzABB
z2xWyi5v-)mt*n~3vcd!njcR5nD>*?Ul@%0PT3O{WK|{(4lhIOHO)6MfQPtt|GhA6w
z9dqbyrzSS?p9ba=8#-O{0p@~9)8(%&dw*e5RjF*`Ka<R}v0hbF5L$8>^D{JLgYl>U
z_A*<)BiYFOZ0dfzRwihk1gGs2G(Yjuc($0M$sG1EEt;d5hM}MB<R`u6_3yfoAM%oF
zibsSJcX=NN#Xj;wG&%A^ex4vdn6KH#=4(s~Ul*4vU}@v*|IVZhh8!`Zxl-A>X59J%
z0K?`!S_%HDtnmX*+0<hUjWd&$bD&mH1;YqC=07n|ZN}MzO(&nQ*<;d#&EGL$)5#`m
zs7|4w|4S&2S>$@_9ag6@#-^ww*^CX9xKdlVX`p<$okX=F{{gC3A*w76M9ZBbU;6n5
z+KW_2jUr_3JwDH1_Vg9egidKgyp1Ltf>qlajEi40t@++^OiBc+{*F(^-gI2BXJ3&V
zz<-{N-tRHi)gn4J^T2kK-}5@n5BK+<4~1uZk(p_+_lK+;pPG!IdAadH?Al*hk8Pf`
zqJ1@_Cm4IU7}F&Nmf09zq)kf~Bxe4Q_D2Q#AK)wkx=Q$RvyGW-l@CSI{%dG5Gxky+
zCet?7S#QRkAGXw3v2Cf**6pg{-*5e!adXK%_^Z1IpI+TjYWfaE_XT|iBBN^#u<vVH
zlYVaYZ#R8!M&FvXqhtdyF?*5&t8e&(3!mh8Kr_j)kG4%<hBa9AHqCS#8|-;K#Vk41
zfzRsF2>1?v1tp`I?-=he-@$mm%Q>TbTSC?&4K#Q3FqIWV5YsXyjN<B0{BG}^NJAOn
zuJd9$9oELN?j2bMwPLpuS<z@X(6b>_S+l5UvtUI~xuLzp26ADInhDl9p+Q-3`srdG
zb0UmSUS?Ow24;KI_4H9BFoYrJwB?<ZXG0vPN-4OGIH2skBDCYD+PL+9U^ifDmYq3Z
zbp8lW>~sNicF;!B`2sX&QM<uS2LRyQ4!!~f^UVx@KLnLZw8FINX*ct*Sl=1+-T3!n
zeWyn~!Nfv*nVDvB<A$+iKl_+*1C$Ky{kY841xem-R^dQ`zM`P@?ArN(j`ORd7a^9p
zvde>0TS%QU$=gzmqQR$_aj1h5MZnmy+KuTMA!u3eSv_gM?9B9FVora^*SG47VB%so
zZNNy)M;Mzf={Gi2`@25ZPeXq@89-l;X+7Tl0-MODGZ;LWM;wNXAuc0!2cR&11grjn
zub9@?ya1JfWqlJm@B$18fj#{Xn!cTZ*pn{2nq_R6HbZa%-z2u@0pE!3-_hVZ6q$`$
zRqLkB8@>omu0&_D&e~&a8R^D1v40)#Jrdod=HA#e-#e^p6m8e2#U7dH7qLMm`9)T&
zs6?TvKHmPI8<-eVY{sG9eVF`0M=i1j2RHPazQ<|rw})k9RjZjOISDhm#ssvtVeq5I
z-__RNHHz|)2)mIN)7sVk0!5RY&5u(s*11Vd^8yBM4pCddnmlSSV7cul4DQ_|8!X-A
zh;)Lc^-iej9n<|#$oIBs)a?#hSCQ7Kbz=h!Vl-J*PuE?{g*HXUV3S9Sz3JdOf%q<6
zhJIL+Ivg7^3YGtR(hz>q5IEA}ZZ>hAP6hR{ts#zSyHrgy6%7$44be!cWN8SKs&or!
zh!(nQ%GMA~3}?n}cuW8WQK>Q-?aPodDiqfd9#+R@ft0BpOww0cG*tMteCfwwLCW4w
z_5j+T^c3tSJYmlm8wx?Y!?wS(+11Ka<;M^JRsPdt<@cm2Kep~r`+)h+GOh#0cDWm@
z*Bh#KV23GMUpDOy^=;ht7I+-!sKti6B;6UC{6Zrb>z)RIB-R5Mn3`u=A!KburGgUk
z;&g<Om~OiS)3{^2P%w#Wi;OKR-P|wy*j~>-l1A*Oq?eI;b;ymqt~(B)HKr6Q<^Brj
zm`UE05gIwg<fl@JRi~uJyAT7~>0tk3(I<M>P;?pgOym)^=SVCit$BirLiSdY<PRHs
zdyUvCWHD&HdU3)_pO;^{9@(1>2-ua!#1bbE;>+b{!ILWmA#y>me>+qYSRCDzoMTJ=
z@jR3N5e)I<Si})@W8K={X*LrI0?UlS43ex0Y6?tDqIb3my&q;0dL2Cx0~>sMBG9jO
zUTE6xRi^}TJPgw(1L;>PMVuLw(y)JP@V#Wjeu&&*4OFn|*_v0OK*5J(y(|w>jA5x?
ze-Hh70O}Ph9M*avYh1nBq$~jQ21?fVdL#@TV=@gJ<QlfI&f1H`(e6&#(0S9QfbY@h
z&nYTMDb|QkOEpf>vnK6DT=#jHchI%HYv_9V0xZA+o2p@eozATr9E{`ZVGLvZi=0D^
zif`wtsmzPm{+D0-)8O0JKBM=$;D*$>UxUu25`n0f$vlUw?U+es)c|T2wmC|0D1xqB
z+JN;_RWCs{mG%zx2_-ahGV}!JS*mfiv5krJqtVAuA(CSCHSxD1s}_^i2g8m^<H70{
z7>WS1H&nI9EJpJ~Yq_n*&C}6XneInIzE`02_nKC5(3--^gzNprY`xzWHEo;wfTsZw
zlSHNkw09vo0zvCf@(n8!_PV!Tb`f}6k<mW1V3RxSN3;zlR0cH;9%>vQ?|GSzr&2W}
z3+}@=AFn07BAW(UdTMkwf|S`bz-BwrSh6ig<5oHZB5gE2KA_QvL)U&R)CD&hH{c1S
z4lx`m%*DS^i*Zsg@fl_=Qq^PTVq=iiL7aOtjy`6G{wKE<*M6#FMs;+)v1zt66wx9w
zMTNB&L0Bm0x(ahKBMNE?%-Gf<;e`oDe>lU7Ib*yR^_9}1I=g$-WHWIgGZ*u#uW5S`
z3-MqHj1R>z!tVR45qpv9Fl%KPRO>~v>i1Ax!ge&3`l+`crwgrw3JApG%)|xYi(wT7
z$a>r!^1Wqrei2EaE;(3`&~Fjww@0EsPqP)Za=ewcAlH!viNC!hUF#Z!b%*kRb$5W}
zL@eKIf|dzY?T5{{jw*oZ-W#;A?g<(=`FX^i9Lsnssvv7Uyr^4G!-UKXMP?<1iqvCR
z;UKi;s+nfb^F<dVN`A@Wt-2pc(AK09g+KA|!FY|;cF-Ed0^wjJVV%Ad^1U1#g2Mxn
zWudCK5%M=FaP=R+xXjQOuqQF5gp&0KNo6o|vX(Rk?C6i4Ik{>`md>C)YNpO`HYbmu
zCCO|y<JK3MIVpRae_-Y$>KaY0$<yrU&^t0GxpKf#CsGclYLo++lheH1n#3}@u@<bp
zv^9x|F5|ZMApqQv{2Se=hUD`gh;}s7kZdGD7ltCL*cdN#PhvLKhGP6hH6~FDnXM`O
z1Zn0BUQ8cawQWZ1Y3OFImAF+IwDyVqVST1Oi5xIvt}bQG8J#~vU|~=`-updL{Fw&j
z!+BbCcLm9yq~jym(pFe>(yCPI6YPe$nf4{@C>tczz<eyrz}%H5oDF1Pj!GGrFmg#n
zNVAd}bdS+_e1>gVfhRI6(SH|a<s>pI^X<QrcBy9i3ta@X?0=zBWcqktnki^Hn63FX
zEKP1}hSc~Kdo#w&P3q1wdy_OH)G-&sv80kstBh3g_F(_E2H)#^4@{QHsal-BAdB;7
zW*o~}d1D8I6I!{FYh{hSDU|bGW(H1!pfW3v>*$mf2>tvV9U#~9Tv4#NENGP_Bdkq}
zmnKK2R5OexFdRI=B5vxbC&n;k9&*28`hFXkZ6*TH$h%gZWA?lRjXZ`c)2gR%JK2og
zUy|B?9&bMwueEMCXjMZ|A2bu~(8u?i)|>4w1!00NLdD=FsI=cx_9x6`ZfNt?-p)p0
ze(pleNuD4Jl9``W>(lHOv7n85$t0_@$>dgN&mN2l!D}(L=**|hIFHkagYT7KB9w5!
z`rK(+ctb;3R%tF1^emeR3QR$yV!hRSJ~un*39?*Hq)7wWn=~F#iF&}d_)^PJu>@uF
z|JnN%_^7Ho{|p&OkjNbbA-<yyHc`-|Qq2gKj7;E;&PZB(Zn0&nrM9(}!VIzNgXl~&
zx8t;Q*Y0-z+Xwx(|E;_0?z&r-(rO{$kpM0Tz8`&nRm=4PMy(+zlK=PnJNMqXGntV1
zYVGdi12c2)J@=g7`JLbSo!{&Hj>=^L>V)lpB#TlQn(azegm?}00*ssU7z@1T_XjU`
zP6v~QfDe;I`*T|Q6uG)DxQejI<QgIxJKW<B3cxe(3*L(#T6!+|82uxZQ7d!u6yo_4
zCm;o4b#&(3nnVL8A<W0gNmTgSSVQ=~d=QkFgzwyFW*$n-t4Sac|GwmvrUl7!rK8<5
zS8Q0jXVV(K6w@NTtY({&U3_1n)_e%X7o$8#WniF%<&oirJEvLvV7PIUmi~Jb(bgu>
zH=4T}9!0TPQ<FF7*=C<UGi~=IA%(zK$|1fv#lps>S<Q*Dpzckn{`%x!;FVFiS8jJ-
zamqIvdmqHjGQ5Xqa}PgeNJx6iO|XN_3H13l`;vd*BImEP)n(Rg4}vEO@}Y@UU^RIh
z|9?#h4LNt98$%KSei8p1!$mF5=vshIfPMoE$ngCdnlSaXfO!uYZ8na6-7Wn}+$tGr
zw2s?ZJxUF9_4#-BlD{>1!^JZ6Jj_@0V&D_ifIWvSCaP`RlswLb_C(kdqsH87)Mb7I
zjgcfkK4m6Zyi*@E`Az0n+|V<MP(TjJYU^TXWc)SWf+<yMA(_l@>plu(Vx1-a3#TS$
z{1X$bW4!px(a*6i{hUDhImi4Kpjnxtkdv*YuvZk&M-qcPfQ}_T?>2rkh9TYgwTaec
zjNf<LPj}ulhlYP`b!VR+$#BneUVx7XrUIv23wolpe-wAjzr+V>2eh8?*E5RF^w6fn
zvEkILAm+}~@S|Fl4g!gaW~cJR*oNmw=^wX_cUsUJwg_!+09n7vXQ!o~OHQ-S5yJ3P
zl6>%|&eZyii<+}gR-NOO<4a<G#rD}=kdfB{TY#$i4T)}Ri|{O^Y6HDUHb^SpAV1{;
znYZ#;UO-<nRli_r{DP?q$lj0!0R9o4D_7YP{-ol7pk6@Z?Ei`d1If_<rCKF<%2h4D
za`Jjh%y`(%M;$fZ(2cj@0fR%KIRMioHogSHed}Ryj%8Y~fHpD96=-ee%TXWJFNE+j
zK0jt0gbW%rp7ES<SM4!EgRDLIR^1knzu{00f9MtLv9$Gqxx+uK__|t&b9}wV!`EwR
zY^KWt^FlFxjHr^wu`Y1Y0+O2S)!;%YmvcuoDx~GyQBh>VjuvFX=6-8HVEcz3l9mYE
z5d1ufl`;^;I3OZp0IX!Ap6y^<hr{O4v1-|WwjLIkxE+x}<IjcjQECPBy8d$g=l}B0
z>QC4HeY5_HsnNd<@*jP$2VRDDsCVs|t?zu<w?6BCf_<u6@7rly0yYO1Q{MRN*b9@|
z*y4_ZA_PTrp7D<x+p+l*&OtH!zpgXI0|;OML$E0ye%Z1C`2o=P#%=#KeB3tlGv7V*
z;{a!+3nvrw{+ZHCPaeH+)#Um=GJ0vLR0PumRxmul%tomdjm1!Ilh2uX1Veg((ID&p
zWL=j*x9dA07Ib3-^aA!E1ml5!NP-dQ&wqE&4<;7C=j=aC?S+o4_}No=tOaZUZg;X4
zfa$OnhyWgT0><Ntk2Pd1wWxS7Yk`kU#7lnQ7lh72)>1#1wSXHB@?&+NcE>=NxJ^mu
zLogO$iOPEjttGsM5`r`m?i=Gzo|^60fs-DxD{sJOs{cAIz9ZG&ti^WTzW$#6fdOLy
zHdKN!<uQk*BrHQ4bxt~WU#rx}J_DauENH>1fGxC0{s@G{jP)@j|1M~_W|)S_e=x5<
zU9i6uLsS)%H3vKgi@@7OM#?>6!82e~guMe+>lv_m4p<{WAG8+Ka+t7g@B_av%!LD1
zT{vLHPDOYa!~qB><0Dq+m$=eae>d1BEfUBfhE7|%A=UX@s{b<Wu5qkEZ4A?|_1~`h
zHV^EAofRv_Caf5*40t&J1ORl^T`!<IVZHdG8gyVaAgczak@igv%Db9Mdd43#^nlrl
z3cPT5R<03&!Np7aX2TF*jA#K<pj4ZC#f}4(X}ih|Gc2N!BKFL9gpH)$JXyQzA5f0_
zEd5&hO1=U!lM${m#Z8G=6QUE6K7t;BIC<CnYZhBGHJX#5YC$pQEU1~fL?UuXALp9?
zN+Fx_#}MtO`e$n2WOit~@riEZezP9GquE<A(J4CB%i#fqb>&T5t^I8b;AqZK)qzRo
zUfckbUp{B*b>~d|n#mxi!YWY0p8J{css1V2H@}HHHaKa%F1V;Pe~8~mu{kYHPDa_$
z?dEi|n^fxxl;*v-%s~!O0vH@x@{6GXNPiBBcS9P0+-H8BbshnA1DjL*<FvbWqf0il
zPqKFcZNPk8dRlbkp5~)9Q?H&r^~=+zUdJh1>vpA{B5<u26hh|}iCNy!<Axqrp({W)
zCkGuv)*M`3F3=7Ada8ex_Dyclw|k~i_JbyUqQ?oijz@)LNt_W-NZ6)C#1-JJfK0gY
z;>fI4=1<Ec^S&a30J3xm=0f_RS1b}RarBZP|3vF+-r3*6=?~=%2a+^VpsloK6%H%v
zaBEEUk695=^^H~aRa<qbE&ebJYNx_Y0$o2AtcFiGfqe2%ysdILP{8_<wc)n${$dN$
z7oCO4-pdbL6joUeKZM3Hh#%^iNkMEU0$WUuPaVWjAUzjV0?IP$dr*0+lYf^wIBvyX
zr@E>Xqp7s+6s{m2ELQq^e=$J$0XB2U56IEyksn;<l^Lg4d25xTozY=qj5Qi`W7zT?
zga*&w2<ihbTrslBQ11xpQ!L><!spJt%s4gmMhM{u;1hm2Lhwe?Uo34S$Dh&%E?WR2
ztt5NlRzGV(&Rz){fo{MKnVH@6Uq0rW`#AK<YMo}uNwi(|B|mE2oM+F0lYqvlL`yU^
z8z;rwvnkKsLu<|@t~F;u6D(8nB#WVK|8%W7V$<oQJ*uw>hPKnd+j<}s!$E>J*Shxj
z@LJwuHCF>h7dE(AXtX-Pnj_{WPk-pd&|$nfQ*!?})~gdeFKg`;jCEnb7PDMzSx)EA
za2pt_I)A)%xfGNhf86OYJ9%M#C(GN$;nW(D(XZK1(8;FyO^IFBZcqO<utVFd?FIT8
zf;YM)_!pkooPJL}ze(|VB$IDehwFe_$AwwXf;prHY&tPBnvK^x`Y5F;hOHog%`snO
z#>MLPBu^mEo!momFGFfg#o;%R!(%r&8SqhLz@x!{o%!viYT+v*qt96*r_Z70kGpbZ
z#&O{q;cOhKK2#yHoPi*9TkVm)@uS#$(K8>nCr1(b_{$u9T<oQfs7oK39QMZ%pKCsj
zCS2;U4V#@bY^pMx2<H7PlbZ`ab6(fl{}xX$Up%y&7!AUJrBA4yK3rI{Vbg-C{}Z~L
zNCJERwche$?Fnze)5ZzFXPEUj3?_U}$L1C9*s*c~B0Dx}?6@NkzZ6US%KDYvD<G4T
z{Acd#T~-%*CVx5m1ud%)$b?mDMqqhDIvYJR`=`RDASBytN-V~G$>S^!z%mlrJsUVt
zFLnoFJdDAYz|<}XwU)W#fLn?iIo=aB8jTy0Cs}dNNUV0=MLi!o!Z@%P1w(M5@lkl|
zU_<Zi^S{=VJa%jxdo}ie>byqRf?<OjqUeCBL2jY%I{+WaK5K&H+fn>`U>j~%;k}>w
zY*Iytjg6ox#mdgKmcbv8qt^M(pdN{TH#}!G<vn+iCK%h`x~Ht;@(1@JCqAH|FPz%6
z1CTW}{u*Y1szf67_NZIF;zBoGaq?r$-@ysY^L7>g);b=;wavqK^!ax-sZ1PmvJ3we
zGboSHwY8m*>@<Whxa)(~{sP`s6mIUqPaztbB?5^$w`o6m2VX23<bpPq2m#Sp6}d4_
zVBxTRc|jr9G~9;gp+a*8KAb!4LEbqHANlC%tluC-v~)QOFv2{KzONVmschBxv+<x_
z2+DShVOsheT+!FH3glkYgDTOKNkzK>we0Aw6SW!3P{I1m8SC+%;%w#f^61a?e<jb&
zxw<}Ojz>*J{bw$L(&f6%^$S&^;-i(n>j?f+S~N0Akei%cN&o5fw*S<hbB6v63)Qm>
zc6kcxZMj~#Pmi|Ur&{~J5Ix!E%G_JOcHeT|i5Qj;i*CRMi3-d%ytFcNxir6)>mi*L
zE!7B_zF1FfV#q>-NO%2fTAJD72EV|<IA-Jtd>;aO)d{TT?@(6!gNnShbTgXB)SFR!
ztzm1Tk8@1vm_-i5#|j*?GO`GNDdw1^6%*MK+x=z?Rl(d$et(R$l>TZ4C}H8@K!4Vq
zT%Pez&p9LM|4xKCa1nRlGz{D%k33r7v~&EM$x}`4Wn8>6M=uY#^rE%%j83=hs!YI|
z=)`k4@WFY)A<e_PmcGsNo|dks7>RJcDBQw=*y*@oWph<@+mwS~eGF)hl6W23l$_*(
zFvY3Hf@sF2!<qt5s&$N06&Tbef8ls1#-?V%o4OU=R3bCysy+oc3aWaD_uo5y(PRx4
zt_!U>POXKW)x<6r&3;rdwg9*F8<KD=!p_iEIVxue7H?|(U~j6BhYN(({%PRGT#Ao;
zeZGi4wKi9|0aLJ6E5?4=PVfF^m>r%)jpw~4B)pjOs@8~CwYI>kn&ZDvdyn8xMRG`*
zLJ+s0D{pEAhY0d=EIX;A<WDU~7+mtFzB_O5U>8}*p9=0L=IJ3E@Fjn$lRA}%D*03Y
zocyUG?<1IvMxG)L)kP9j<8i3E!8M|}<T+7u9`N@!V|Foz>bNnKGaZNO+qOe>6{zos
zK@%Q_YV=(=RBKcK&L9VZ$D!Is?W0I2&ajacBF508`T%P1`c#T|RF4RU@~GZ81RNvu
zs6wPN^lGz~wb-6y$y70fOZ6$}I=1`jzwwh%l9lwS?%@S|s$iUjKGkh_qy>~5g#&J4
zt{jE1E6?wG`oG|Ij|3N*lAYuT(1?RImIEc61I2G%gNvM>vR=-LDeM}0Yx|}U8lknH
ziC1h7tMq4*S&cg$;2c0r$wzra$lz=JPv}=Rl751pHj*mM4Y=@BS`VLVQ(P$7?s>%I
zu3S$Mx80xOey&sEe1#c$C^3<vLRrxn49ENWZ8mlU=xy)oYtWl)_<v6oN)2+rlrw&c
z5Aq(AD*`tK=iI;|-_T`}4n@4~%Do9ly;3w4ziRXUu+<~L={RDkFWP{9JO^l{`4_{y
zFP_+{+{-@qWuM7okA)NmyJ7(=eX&xy0J;K#dIpFd&KJv>2WRZR6&Vu{pX)kR9-+@l
zH<O>T$Kpimue_YY<Bbg~Z|sGI=tHmEDrwZ7pelrpAr${k-Ld&Wgo_Z@T@cUeb;pv6
z6?exXGPS5b_PgQ^_*=RIz9s%xVN;b>I$wc9pGtop90rE+kARISS}OTxkK~RXiNET@
z=bt^s<IkkkA<sdJ6B=y8{^=P65e_6i;u!L21v<mEDSZqkoC|DwI*KKq$yv3N&$@2a
z#7C@UFtED$V_e%1Ucr76$3L66)MH&w90iNnc*p)o^LY_t87=1?d;ARA%EaSjHsB}y
z0m|Q;>&|JaJ7;*iGu7=5o?0JqjrGZAJ-vC3E~v@Ylmgh{c1`BFWjRYd_8-|SU-GxA
zcu{w4`cU~>M@k%LgE-C|f;e*S)0Z*+aNAj@yM$8A1FNOiqnw9$6aGxS1tXvkx?|E6
zXMpWtMQCHe8%K$;5Yx86&6*3YC`RnHF0r49{+u(oKepraY4H<~=ufcVE6EwmF=0XU
z@-)vS3+SA`9Q_~JzY6iz<}#<MX*t#Qj*-daW@SA9{a6mr=e)BLZqPN*9LwM`YiG<M
zQGbdHuH$s=!to<-NV&#`6N|lQA05fmS_oAm-o+^jb9@u(fg2>kt&#MEOt&rU5o5oM
z2r>odxQ@6=6CZKM;&ehpDRFFb5jU(f)B;C`WmV_+q4V-!2WyTt&r%pV$IG}H+_9Vv
z6n)f<XUXAer;RInP#+<Bj&uDZ^nbt?>AJ59oTy)+6ZMPk7>&(T)14Ke*eqlUG~}>l
zJS)h;*+k&H^RhS4fhry?<2Qmd_)q6%r(N&CoYwBo@oOJ`di<v&qzvhHuD5xVAx3|a
z#WK1@zlsl+EYz}7zd?#<=})pi3qCMv@|Q=y*T;=*^q$sA#!ZC354HdFGDeg?DS|7v
z$^UWopBBqCa#%DQ$CT2Gt61j8!Byy5QSYgiJ{3jcp%=BZ>^aod_Mp3ni1@8_3>-xC
z-*Im?9;Z+axt+Mzvl$MzS2(cT?D?5^HtAy)qBOHlG1pcgX8aB%5g(8%7&dxl&6n+-
zJ=l<t{6swaxlz&3uM{gpVeV1Rm9{R(%@26zwDea&A@FrJgRbV+M`zA&Oth%HRae$`
z_{^*EG-C7vUgTjChhi)<1(iNxR0T2JHmew6#7WdZ52|9)&D!w5C#$1IPuzGBNpQ?+
zRDci)#~pP&XvCQp{pMRB4k5Du@zDMZi3#XgPPgHe0+e+D_l5^}V{Sf_RXHdTO_AS1
z;&_xD<929*r|9wY%^mA4FY5@m-R4|Z;uo8O)8GoUvI6ai_I{qm)+VEaJbkb8M4nZ+
zLRFLOjntO~Z$f~0)znBwEO>NBBsd;d8p2BwV{vgb?~aejfxqY`vX};|)?SASq$MOj
zf$U~<6J&6RGMxXU(({FQ!qclby*Dx|;2!cMz2qTJ9X{(R;V0;&+C2>4H}IZVXRXWY
z<4s8zDW67?^ER}I9VFq;<U8EhI|T9|A8!5`&~OmjU2=LLeQHi`NgO5JjIf`2=G<5v
zlC|LMc=QU6V>N|+y~wqc2Sxy{Nr|fYbbj+5c@JQ?`~og^oXLhQlplJAu>tcMEQ=c(
zakkfg;Y!bZSLmZC!$=}0DHec$Re`jx@ENa+hJLN37vi<BxSuI22+s#=xGbK%)gKN0
zR!jF_>}0VFXU<ogSS_ZT$P{pp6!w5OCnI1AmBJK$gyLZ&Bk&ZprrYs8Jj6I1CbP)I
z>-CxO#zYJ=2P(|vI5^Bg3M~X98HXG$(4?*1c4RKV*a2_>bVc+ANf~Lp;+!ugY(Piu
zEh!KHpJ4kpvVH4JWi-e2r}N;Mor8x29hO7RY*@(<99R*7j^vznTQb4XkZDcy-bMw<
zbq)LSNO4he3UW3adDa7g_MbEV@5c~DjLk8FEC5{b?%)pG@$i6qf=o4~XYUEF;<x07
z#qQ4-H_>o*RASG3*yvOf1pKbjI*RcvJnyaB&wQNcbHewAk?_zt(ru#Zt$n0h;&JP7
z#$V-~-_~h$dOC+t6SVEjc!E4=#yk7_)M2G++9Pf+R|$@0YeU~L+bhA(BEhko?MLBq
zT$wxhaW4`)Dvs0!+3W1y2}gtEr<fY7wv|L+%m@Z!nbYHSe~5M+LMp7;@)#?Jj`SHY
ze*q~t@K7B~hRqUO0&q)(AVgD#1`>6bWc~k`&rB42$j^DZdmg9D)uehh?Ec-qVuSme
zKMJpL<fL|Gr#7KN@0k~1f&Aha$oKqwaZkml>D}{2N!1OV`3<ZYRbJ-z+$y{-gtzee
zeSmMc{=X;q*I>?jhoJEKj{tvn#V8D}f4U6rJH>w?yoJ{vcKDItIN%{KY_*&>!Fz4<
z1DJ^3>YH2bW7^wpXb^KDHOvWUfic>Ia%({>v%DsjxeXb?4^M6#KPT%yuY(Co^no6$
z4)=POH9>Mjx^OKDlfOFYROcL@!#(_?V#et)V_78=$4S~=#Udb-q|{z@clL7n<-t?0
z;HfVHPb1)I`eVbRD|qxG@U#G)tNz&VEK=|+Dgw{-fM>}c0iMjfo4n*ymYH`;{`FmL
zGVeIH{43Gp`#3*J^q9Bpp7ixj=@DvKKE2MHly{xSkN!;f<Bgd6;E&6}9|!!c8u;~W
z#jkO)uoc!lheq_Yege|I=QxPgxr2{_uo*cIg8(DHxsvJGXr+TdJ0vT21+hH*4MDGj
z7yNTM_~(ZU-XZua;RSzP4*vQlhqpxU<yMK_DQLY9^Yecoy?gA@x9?>p0*NZ`kyGmO
zl-_#L+L1n3&!&T&U~dv;<B933VYmpi({ABy*kY5HLM7j1&8Q_*0V9jVbkSLmXk^@0
zy$=1F8wlBoeB*kRT<7OfQ3=5nfAyx;Dwh9dbUAHMPI9dS2t8o!L39Xedqr7uW*&@h
zdlBt)8Dh_}3z4%AJ<(t{dV*a7<fs(P9BIc8W)xl!2F_H&sg3pNPA&ZdqGnBf!$;4Z
z@v-yHcY1*1{C)<&&u<Kg)#DfV&2S(+t1=VEvdV5Q@m0H#o?Xm6%t8iZ<14YcSM=1t
zwc6c_SvQVUkp^iPV5;$tqYG`f0QAI|?y~9J5t+FsxCAAmp?zBF1wq%{!GFg0N*IBY
zWlfC=UC9Xz111mB%h|uz;VpUoLwsxLTk*LLwacyli|@pZ>wrDE{1GodvyMv}EBrAp
zTh?&^dHMf%8D2++8882lmmgin9nrk}2`^7yS7~3~%gagY#^Nh#Y-WLf!q4Q<IA0;_
zpB25ma}_S*b-Q5ReZWsLXzHkkrvN>T$uSXkOoiIq&2f~}xH3%k0rRPT912j4Uga4}
zXt1lbJ@)flw^LB<ESxPz_zC&J%q)o2+J8jP&5s@9ytuQ{lKMY|nq=R&STuQxs_QEI
z0)3iv*>m$qE!!M2TaQ=}b<BfmR8Yn(to{Lb5OPxv`7Jr+kh)UL)0~<V=A2X&gS@7R
z4$EMDwXBbzwSNvc0zg{(m+-^<0zQO@3O-oe^Oq;w;eH-}pi>J+JVoHcnGrR%hm9wq
z&}$2<WA~$wyUlfmi|a{DjQB#bmTt4_kD)j91&_;HOMeFUTo>&NiKiKZhV-J`K$AWm
z&$w~19^bU{UZrE#SO9cM9)yW=cd(KdFf5nxo2-LC;9(7oH+AV?FS^15Hp_rU{_)-p
zeDmHe-oPL43CqE~PPwD*t;BDZTjk!11efqen|*_nb3-iq-Jq1r-Y2!hVCiHFn1F9H
zJ2@^%m3sE>;1qnv0OVx(zFU9;e`yIXxIC9)u?B97s6l>lU$91A<V>Rzx&fzSAkzuE
zhm2D<kmueKTx6Xl+y%H09L&VQAoooKN|F9Jb=a?^r%WKB+PjaV?y#JqhULOAa}EN@
ziLaP12f!el{ba5OR7;<PnQxC!j(=cG6L8i#W0labMQfV*&#H<Dn-ov2+M?=7@VdKk
z1Dt*+hWyRx8N^Jg->=;j2bB)WT$MUpuC@OIIE(p7ybxo4H9DJ*k^RGT7eF|^Pe{P+
zAWRUp`~PIs!C7txzi3`G4g-5injHqw(BF*pM@vrv%@pn5#)AIUnq{a##Sazsj{!$7
zuy4OUO7QK%F&TM|YLVy^IUmmT#4D-x5gvd?Hyuy9?w9$~6ae9DL&n)At({&1dewUI
zjbu4E{R5>4dwXZ{1oH+olp7EGynyr-xZ6yZ%Xo}h<bwNz*tGUCTrpg;Mh|V%+K(k&
z374unh_QJP577XUy<)?wVd*|gr#X**E0F)xPCTY-bDnmV{SZh{OMj2B7{3w5!u6@0
zH_YjnthC3c?a3+aHsN%D#L--?IAbLx5%R>dkWg)=QCE-vFhG*@>)8{>@;DF=99>>G
zoEPn6XCb{Z@i`AD$uF4y2)c(Y&IK<0ZQk&0(o?@X#3@v%`;a{bi@qa^a9TwSIHFUV
z{3Nq4x-lUyXzi~do3uK5*jwdAtTOX}>I3sw9}V!)>ZPb0`F&Mqb>mFE{A9XT&{|W>
zc$;3`ML7Hm2#3oMK4Zk@<RZ?}r=cl3*?~je=83$A1*p0V3ly5b)E=eX@%Q+J;cI&+
zcmnaJeY@)b7<3uvNNfKHK5I5>?Wf?op_3i1Hut<mfArnLri`s^&x2JMgcrypsmT!D
zg&*c^cnM9EYw2gI@~Bx$x8b?$eAkQ=i#BN};3RzjqD-`5{={x*2TJg;o_lcQnc}xP
zQuaU)+KC6c7Ws{=S3d;s=4&KSWFS?U)zgP?FApm}!VR=*{u{p4+<^qvv3@+S?zZPn
z)Jgh_BlPgV^FByV@I4=a?@mlqi_y)@QA+@zu$JU;s{IEi6FA6(U!65M5i|FK{c`3k
z(ZTF)(o?$+>)ESuZrjsZ`wqgAI@k-r3|QcJxAD~+&89l{M0+;zEJ{7JVHu7zn}bsf
zs!rfZ8QQ$fSRJCNZ5rj9)WIohrr_O}b`i(~r<Q})A^GDI5E6xenKYV);~Q}15{@`9
zo>gR>dTX*eu}2+!7&9Ia2v94!bVG0nLPi=XUg{=A3Wu8X5Y`T@eKr~E<q*_J62p#E
zIJ<nH?IB^<KJBguCUN>vtvv%m;RJXZu$%32LAIJlWE}7R!1MH@IE5T#JMsI1G0BrW
z!=t6IA(mB22=hAp)>hvmtE%y2Q`<|v#2KWY@8CtyXafFQ&vaR86UJ>E3?#1=0!sdh
zWS9OA-m|G2Ifk`%QqPW;wbffm>*{g)7MvvoDsR|g@`M~7AkxN$NT?VtOq`o|ke{>A
zWUI!6J7$dO4*O6P3ld;ai9O(UombuPoMa$6fvY1Tsod4^d`dB2=*KSWOFawEDzuXm
zeUgv3OI01#67vESFI;7uL?5z>9w!A{R3xfYMv94M86M>3$ZH39Rb-Alg9mx2e3Ap0
zn<wUWT-$T|r^tMQ*<A-xHZLbV%kr5&N)&Ovg)TLv`#92f2id<1d<7$Y6(_nq(u?rh
zp%o5T`+UgVJ4|hL7e`Bis929Z@anOS0ZX6EKDBS**!BWQ?Vd7o9Bvs~Ik-40_gTHY
z502yPECg5HBitdDxd^VCXI=RQtMXCs+un4{9A<Y<jME3!>jT@9n0;>|;!3ak4GLh=
zhXGbXVta0ig}Rp?ZN=lp=IG8nxM;nI>c>~51iJfBunpbSL(eA8jQM)>I-FzC=~?gR
z;(W7;xffKGC&xvh&4jv>``~02#zUytdr+m;e7DRcN{u#;TyITM^3L7CU2Fhd=4{h_
zU3%zYoNa+wj6n>qmh3Vf`3_4M<!)R4X~vj*(fkYwJMj)V`DZJtBN-xXLAQ$^QgEL9
zgBp^xW{uPkVVn8#oyb4o#%?XmeRdwQN+95<?1J*diRKG<;MT7Q=mH3M+X~Cu)RCV*
zUdkg){RRp|<W@KVul@H_(=g#dc*K^;Ywuz-i{$DCS`A|OkfOQZ<T3nDwe3FK)-|dF
zW6uzUubQKfreFyE|5dUV;s0}>(Y}BDALnF%|LX<JUzqtI&abkJ590g|zrstpByUpq
zb0(Xt{?6>_7T%2AJW33(M#~I@Y&^;_#+c6oyH1sA`AAdb5JB@8V!;(HRbomiz#`C5
zj=R?<!K)zdr#)*U&URG^Z42c}h<#c*jRrmPoYu}8=A&4xhG5X<XWz8BQcD3>vUx;z
znU9P~x=DtDZh}{=ce=Tf4Wbv-0B5u4S?14QLycZ>ZvmPgsRRjO?FO|%Xy5o0DstC}
z;+pY6Oaf}gpHTBc^pXlJvbp8Ks~IQ8LfbmS+$b|Ae;($o5I-uIT8I@ayC5xkXrkI|
z$5VS6s(V`d(t;Nz+H+BQvtqjWtydi+t2-x{D{v>Lk732T0W0e_zJR-Kk0Y)wbiC5Z
z8fgotKvV4TwMw7z^!vvksG|DVX3vUBeY4hFj|D`%Uz8tFANv7{c-hfpwMw33-pO~}
z{UfS<%9OGxcF=m+q@^#Hn&L95O|j6cS~~@BP8(Z?iPjyaHU;p(osd~X)R;2;=ioy8
zgD$n%OY_c)9v$Ww56veho6n=gJPO>&8(7h#K?CL{Tj994GV1G&Q+X*r9yy6c)9`d!
zBo&bln0%`Z@Yw^89DG>uc~a};I0~AhH?SEJ&kgeKe56yH4=c>6<gx>Z@0wqYvHhmx
zjOu_;>*chcMHzD{J}{(?5|TJQ$Ey_t&|vddG3!`)U|x#qJdE5~+|I{s^EWvuL}ZXR
zz>v+&_{a^pXFJ61`VA1w_YDlR#mkT<%Pi+4^5`eu!y|JEJ^&~s`f8B`KSLg7U~MUf
zo{d3x2FJd@HrzjI*)b+F_7XN+X?L8*3tKL%39sc)TT_Jo)jQ2N04CI{-8mjlfJ9{R
zp^5JzcLwlSdoIf#gW9jPb5ktmz#=Dqn9TcMqEdT3#u4(iy@KoU!(RI5*(tSV7uu0{
z*BmlfhuQ%3f*hvveFcgOf;aPCUpbC+gjFEn=aDHFUEpuf+HWi<f9w&~V_2C4XIlFq
z63Nazvf6s_9R=Z=8a^N;Q}0M%{<#(nq>YDMN*qEq!$VV64}=mTy`%B6e%57JMpAE%
z*6x0R6idPHIsQOCC_-HcTgGyD55kCiG>1NqkZWEqUZW(32p(k%v?gPqYuziTX6fLo
ztQ%(L%H>m77Ef*9PIaDwb>PhIwu85}UV(`-uqD*BY>ssap@lS-0kl@o884)y)$6(&
zptT<!)uer|NB1G1dOZ&1dU@H;p@U{`8)#}9xV81^&_@%GlMb(Hs|2~?1gs^#<gI;a
zQGOude4T(R^Q4dVlZS$xxFgyhZc`4j&xCJp!*ASTPw`$BUr??SND_7c_GM3MBG{K{
zB-PsQK@l-A)4J<1F*~BH(+F2a2;<8!hJ3UNm(HX6<&hYi%`e-}cX^&GVA9L%M>N99
ztD^RQ7I)3-@FBMfK2XV#|CGj?E2HeymoX&06L*L5X05?9D%Ul7HbPxm@_k_?;$1QW
zNc2OxvfjyQ06Oc}S!dJW(*T;Jv%?-kz8C0%JB=aKFKFrC;EHtk0APjtO3!m&)zf_i
z9~Mp|Z?fH2fVRMWby<P?Y87gVVMIAf;l2uAQd=A*r-UO!FT?3i^~kCffN&V?nOBJ-
z>V5*}8;QiRmT`kf2quX;?Z{O7NxgdF?vDT{7sCRweOaB3wduf4-M15}+4#Ktc#UI{
z(80QKqIB{PI>X^qm9$dU*!~-AEVFI9c4o+rm=B^QkK{lX7tLffIX?}TXxC5kd9R<Q
zW>`NBj#UADpaSq7<)`r+nS^;nVoF}B{4|~TeS}n^iLYB3)>eaJ%1iTkP`-F+IB`t6
zYI0KmWjy|u)ZWIZ@i<OS$~lQZSM}QJQ+Qfo=1Lsv^4sXnSIBWvFCB&!+qc0N)0*F0
zBZe%k8G^y?c%7+^RnxPrK5#cZ^A)5F*^jLseeux#)|0}<<}gyJr*^Ht!>AV75%ax<
z<Ds?G)g(Kd%~AJeEVNZi(Oq{*wo22Dt$N-1Xiq0r=mEW_TfXYL_0W^r9hZThFhOJ`
zw<!elU%Z4O_=EVfqxCf1*NGEmVg7<V(WR%hXp}6FSvzdozvgts4ANJRnj_4>H;@=F
ziOYDjn%qVI7!IvARd5usdVD3IgZlK;W|(X$nA)$>s$f60$o^>7k1cKoYnD!kW~<JL
z)tS)QYP8gk(Uq8CMvRy0wzE429*y~)2L>ykv7S-}_1_oi5K9FBgk@kqR-y{+4ld4I
z?{P|72h5G1@ZtO=e2wa88HKO%j+SzK`8!(t_!`~Og2na|V>(*K;H#peg}K<UqIFfq
zLc5c{v=V@-S4-6a#c-zKVsh)P2ukAS7;vJ6!Q;%o6BxJZspog;z8x25tImvOXPkpj
zR5(IlUGUf!=4gS)=rVl9Mh7m^CPc>c;<IW@G}T!X3$0J?iiUP-?c8X92_5%6!s$M)
zxojZPG26UD8d*_k-GY;vqN(kOR=o}4>%)R;IKOEM1HmE6wHq<3NH@a4t$|!BXLD`E
zOH%TpZvVMJ3w-H3&I{%+#tdLltic{sXwt{wNGWGlW0|X#9CdK1%DZ@wBX0Qq>XRoT
zfEa<Wjh=-`O6EQQwdXH?z5sfXk)$hnf;_GbMQI7WDc20=P%LvE$m?3it$|yB)m;u`
z{#UaR$43C!N*(_N+NKu{Oum-Cu$){d<#NY=)d-|ElShu<T(uue6FL%`6x+FXhO8pa
zMjSfaoIQ(Ih2dtzg}vzYAr^tl0P@LZRs<CE5KOS2Z5{%iftfIN1LPHN>}xJVaXoXZ
zr?_r3tK!-Osht7{&Lr%>XxP4MFy5+QhcB<HT1cX->E^te7-@}$5o?`S7;(=FVYff>
z8}tfyU`(7=^EXS7#1PUw1byK(%>RmJqbuCD+n0c2XI`a+El8b^aHGbf(Yn{7B9=Zz
z(x4@oCNw>J5sqqo5{c+Ty~{&-_6p?J>~!V#Nao^0&6z;N_~fBxqY~5dPz)#4Vrs^W
ztxKQxw8qUO<G|GesHSzCb+w+o5|VT8@)kY-B$%fa;T=5nqF?ttMS-&oje~*oN9%Sp
zH*ASQPYG+^>x%inHo75jb}u^?)sJe1<Qk^v`a~o&Cb0un#ns1TmqH3Xd~56YOxeKZ
z(2k{JdVEkYWj}^zKHa|eCgJGFI$0z>XbGNCqQYcwTs*?Q+*yRVaRj02ox}&N0&HwW
zz7Zd^L$32D-UD*iJNMMYC>9?yz;3zmL9enSsGS{pf8v84z+}sh4<f_}Ab1L2PJ9rv
zHaYP@d|VhGv}jO#(Cq^TD%S2^$?Cga88s+Or~y3~6edKWU&4f5LnC_j?%-y8=j<Qc
zW*4%fg(f0eh#@cD^+n=^P=KqZ$|oz~Lb!7;?j)8-v=FX%K1|}X5-fzP`+0Sl#0uex
zqHAKVgbLw`(o>>QB870pFoeXJ5-5bLPF|hp#0lZXM%+kF_N;fYtpA~0yil~Of0V=w
z5rd2wf)5vJs~t2{qn5p)f`;D4J3|HyA<wogbk0({<(nvAx`9B6*{*Pj=LjOkicp^m
zCc2eok=v*mJLdLer#Dz9*+q$T=oBFDPdpJRItia5x4UvG551<!ya77$<j>pp-iw#8
zWj%tGj`2U-6FVsUXBEmI{KuBnb4dn*3T==cX4_Kv3&{K;3k!pM5_S10Bc9F~50cM_
ze0&keoJNvUawZP1y$6XS;15C>dOVx-jBSnMqD+f*FTo<u;5TkI+JQm4&_~Ad^s=+~
zV-Qd$zIl&C#6R9!g>T*?CG(H>+VIVLEAh=gW-436VO_#2lE6Yn@3i59(Lt-^`yQ!Y
zTm2S&JC%T!bI?z?0Ub5t7_N7*C?bL`N3@}P=xPnw1N*XveV|c7`T|!nf}y0MWAPer
zWJd@=8ivNt&O%Dr#2_Kvx-cyEuzluFCdiV=Y6LYi#ePt&rO(F$&-`-ZhyG1@(v_1F
z_7i(HoTG;IT#tbo2SZa_kWp>IsLu8BkK6><<{9B_uFJFDya)~D_)%`Kl|3uZu6;a;
zO8gM<I86M|$6z8gO?-&x%D|2)vDfAD6BTyNOR;hm!wU&yIB~ni{6sSm-(trPCA}2;
zwA-I)CfAdp`{Tw7ZACGUsWveNDKU<6?14-R(p<K-Nyy?AJ0C^@PE99V2=qW%JhWL$
zZ$Tl)+iBhk!~p%d_Gxw7g%U7(!RnR{a;8IcNlrAQgmWb=oRnl{;!4~)AH|QE2&_Xz
zTKiO7u%$)`9};WnSx~XwL+sGY0xkVS-T<N(ao79?f+=`9c}vvTM^J@Mod}^{Qb17=
zLes|bgpD=SE%68S(&JIu<Gz@0UEePpjvb$Dp246EJHSHveyl`sJfIrP3+IXYHae({
z8K>!~7Z2&>XUB|Pv|850jC~C0(HZ(I5ot0{vpUR@M;X-!@4@+IUN;hFR1r54A~jr@
z$s35|Ar7s*nSnqgy%zH#J0>WA@gW~kF+pzvJt`(>9PZ`E1YL<cj0s}$PZbjsFekx~
zP7CQO6t-i6I0!@^7k1*M{df3bo(2+7F+txwDvx57Q8p7Wf5q|=TarGEo(L7afgd@-
z`K?^NXXoJOS&f%$c*DFBbDTZt1Q@P=ldPQjYgUO6Fb6Q^D7n<s;1^KtUm5xcP~t^&
zn)I0|GyC|yOm(IT!&F2$5GRh(L>3>deR3rlew$&1cEe&?u_aSBdyhyiX!cnK&<I$F
zq9NNt6b++ijO|T3_NO03bWfAEx(`0m2ShOAqClA^szv&(@vuiQa%MAuK^RbW#?SQ7
z>stC@RFj!l0G0!Zv;`Q`-$N-qwZYFJB|6fNCjV1g{i?omzn*<a8nOOWbuo_)h%yR$
zPT0=<_&sw>^5i@$k=mS0L#D6_#O<`<rX9C)G8^q+A;j%?6RRZ}!A134yv_?iT;djo
z>R>=fe$9!~!EMIq{2i#SVT*N>1FE+jE~RO-;zpjV#KlZs0kCu=xxl`N3#Y$mJDGOE
zP7-%<ZM0!drp4><3Il3XxXCWQhj5c$IWabHH+yCed%z+dpZdLk#p_eYN`k}(>K*eN
zgvlKk9bsPfn1EysfNLO*MDH3H1qCh^T$Bq&xjq)^X+7EsIKe1A%SR*qf^{LcGF&Ic
zM#o@!SpqUi)XvZP@6fw`KPp;>TsB*5eQ{o9Qsvy4lg1}|qNy(Ep^qf@$pX2<L|oVE
zEfR?$^p+#x^?KIdfk3w8S!Oe6ipxuGec}3nPLXC&>~<8>(x;#ljEta|K~f>|Z_$=A
z!z&ezP=5ID!SVy-#Kbi7OMU?5_+JX;2U%}%V4IenhhiQgju~$xj>(kGEKf|fzUt|Z
zO!}GS$!k1i6URC9V;w8qFDQ?I;thVTw4Fc$0#wp3iRiDw>p08`qY6FkyYbNRmEw>f
zFr?h8bc<HQ6A4lj7G}R|jVp%dmOf}1tqe|(m4WdOZ2&;c!5l^A;vY!e-uMTHB>5KN
zA7GjVjhYAF0M&aJt~ZLuKNMZKpd>AX(E5M~tJ*gV)CEKqidx=GkhZAh)eUOFB+gb7
z9@OH=1o=Yp8O9K##wgX`)WXrulNPT*DeoW#FxqJmy%7Y_gommH`<~W5y`VhoL@Jl1
z^l8QU=0ksQ7GZT~s`<~jQ!pQ7D1g|7SV6z>bv!T9eWc6dEI8XEM4#=EG-smw;XHpm
zvGAye{vRb4ZpG?H1*y(E9}6+!%A501+KY`b$cdSgH`OB71UhgRx%5f$267s~maEf@
z{9}>{DAE<o-pmPt67z6O)Of-xn5{1edr(Rl)@#(m(Cvb-2bxOr2=5l&K-h!4R}l7q
zG&^TYOgAGR;5J^U^gha9-fkA2zoW)Hni<brGErl)!RUvD68*4H-gBZK&gB#ai*&*t
zK89=a7l`Nq%E3F_3EVy#l9Wtavs1<UIJ%PXRT#uYBAj0h`My$3R7m&6e&Os~fu<{Q
zL<HPf{=^J75N(l8u5MjT0`tVH+yI>uFkcU86i%OQdT39wmfP8W0j>)kd<&j1RM<o!
zda!-Z$=(b_m&HLsJ!2@Bt-8ZF@ecH+Ck*C@u_yN_La)P2SEkPMWV6gAZpCzU6(fml
z{l3Hp9U*e*Ruw?xpb)7n18yqIB7#^tj`C&)h6bZTqe%csgS0e5H&jdq{A6xG$8_8!
z8<l{L8eU}QV0d9Lumd`9s1nF+PNfsfaR?}ZE&_xMTF1blID@Bo*RiuaQ<!4T$KCiS
zG&zub+%tcl5DUjcfWe-??)Vm+zp{RP1Esx`JsM3^*!n0`k%Ewpng0LK+CNqB$}tW{
zqiC7th@-z$Dh9`M^ppIJ{p>h&9E4mPP!Sxv@Q%_Y?-pH>5gZ9baEL@`M{vBR*S%RZ
zexn<P^25uKXM7%}UN4-&i&q{weuJ%1LWDI=nQU-upV5o<B`~}fPc0m*ln(C3uV|>>
z6Tq>D&m@3@&vF4AmxnWz62Nhhb+H}5VZ3Qgb>)X4;x}NhU-pY)@f%Hy-`EGo7WN8%
zxi1}TLu<ZdD}JrwFBQ8%8JYkwP@@xH!0EzZW%5Q`?&4+gX6Cx80Ph<VvqAe+@)pe8
z+c(l0=P}`NT$VVswy~Oop~K}x8Q8hKinq1)o1iCKDL$l7;XK^MhlzIHCMM-Jr%!tV
z#ZAV2$SwK6^WuMb{(?QAH;KU5ICwwtE<77~1O`ct%K_gJhnxGmo(8u@d1C9$G7<Hx
z?UK{^3mV2qBQWM8l)trFhcCG6a5??hcZPvyDE5rMz%H?KaYYg%{C4~W4Q%%QVJ83s
z7J#N912C=(U#5_oQu~LGCYmxo4%VRRaGyWuOCBFar-TKEyZu2s5+f*i{>fAVJ%aow
z3RUu#L~0-g96wc(NjoUxDq|D;Lsda8E2pYuCG4y#XGF1@_|@VP?x+e{(RgMWd~>KW
zij^cfuq}p_<P3KuLGCi~^P2I(bp%QA<dje>YzQEPImnoHM^EGq0pA9v9*_;RT$L9I
zg1Nta+0mgf$+5~mwSDR9Zhkb7vJ>r*GrT+YxV*>?+K`<CF2Mln)Ot?-`ZNin1`RXL
zLTt#x7}#qRXH(J0y?VhBVSG4TAP8w9dAu^PllDEcbEv7~nJ=lmS0TP5&oK?95<v`8
zRB%TRf;(amsMI=-$Wp|1AR1&X5e+@<jkxhryly|TqsHniE&Tw9DcW^-R4hB+-)uY<
zZu=c9yz{V+y%V;CE{ts}PN&_u(@gDN(VTt`?{B4Ahx^O0&!sn3*N^zcWiv0yPC8$&
zdripOI4JohaU?VL0Ov%BD5Ncp7rdwe=%=T!6}E<2ks7({lB|CX)S*Lq>aAJJ5UpXF
z6v`1hvc`_USau0-{+OKrv*|b)a7Q{82DKQh*VyDLCTyZU_0~k@%B`2E1MRMV#0$-3
zeUT3AZDPRFER!c~>s{6;Y!0|MJL8wQ0<(A)F%$jh*-8jE-{!5D4`(`dJE0RR886W;
z@e=J4FL9^DOWYYnfQH0N=%L3FCwk<q%mf3VKo1aYd3W*^H5KE&1Kv=I^Eso96_w`M
z_@Q!tl{<-Jgc2mhANW#K@_${2E@0JcQh36?#Owk;LLo5Uq%fGlDKeY1)eD1-jCw&-
z1(_OFjV4A_M1r&Qot98&3=iNJkHPQ{;jM-dFxcyMSx`$q`U^!Uk(VRJ)}1e>o?k%&
z0qhG~8Dm+u6<b!8ou+3e9jDj5jFley@-fCO3j_jpfU!toWoqV|F)h*^&Ccq;E8kPN
zMt~90(LW+@#6T@FV|>pLF%=AFsjw(LSB881-{1>aBpZDRNMx{?x~&9q^bZF@3v*F2
z{^P2lrc&Pg0TxT~9`>sBA&K`e3gSJC4|%+Yhn|oR1-z)4TP`u3kn8}awH$RC>0mt`
z>sf^2Vv_5I5~kK(2g;VSKJQnF%u@Z=Nf`dp&uObgXrV3kY)nNx^D&t=PN<N2U#rFP
z?!F3n<1p+&VPhkMmnf|1*Y>NqLMP4hV!ReJO^w)Utm9FX(n*VegsPN%zXq;oLb{nX
zfG?<MD~86%9Y?ZK;-@QU+1??KchqrBP{f)kQV=TyDpv6u?aDW<+vK`1B!hPq^tqHR
z3^>;_%km_y(d?IdU>g&*(0kb!0gnXdQ=uL4YyW^mTTT{ma=ZWnm*8x;4b>?NcU$9h
z7$mGw4V|{LcNL*}M^0QCQWtW0S){{*+lKcYPc8(jx0zfTc2R{xwPTM4doBs|;&$Vk
zB5pmh#$34|Y_rnT#+ul*Hv|_phxXov$U$fd&|k2`LxsmNzV<av3gPwX&`+_C11qIt
z%wtSlkT#GGRBoMw=d?Sw;evV*jxta-YnaP+zKkU=jt5-w7?_@&brdpEBCX8lmO&Bv
zuBaMRH*2By#C&`3+{X|S7FhaQ878EhrPG9@)(V26cdIs>nP168CJ^^^BXxsx7Wsbf
zQN4v2%pkw3XsT#|{t`D{4PVZn<R#$+#N2lPj{4OpzrvqvA=%J<-7=5}F1cKhM`~jW
zO%wQt1$ETUbk}IS3Em!vAF7P8fqNk!QT$%6MdhNwqESV?JGvJ<254yr{foNJW<0j-
zQbmQn8V3E2mNpnk?*^RaSOF}CWCdFL-?AzRuOR2}ELj9TUpK=xU?@~W=x0|^;aZfZ
zaM^){0tUxpEw<L%fh_CRodTE0qw+{Mlwzd95apKnHz+E<09_g4;-3~MU!^crBL}!6
z5qpE2vZmF=aGqWr5U<rO3@*~@t_v>F>h24+;SH_s0Z}EjIu-k$>prHta3;Dzl|IWM
z-Gz5}&F~(5O$|P&1n|!N_>L)-!&$;h;hJ_AP;u4NT9%!ujNV9%e)~oOU62|bcR);b
z{&@uf0#ab5fXMTHc5XA8(epdkE4Q4^RpYAOzQf+=c1SXJ>w`V;7Nj}HQ%SlVij3G)
zQWFZ=fuDo2Q|HCwARZhsw+P0A``dVffgx>p$1^S>2_FAHDX_KJVnOc`B;l@pst@T2
za>eYsbOud<(it}VK^_4BCe9!OEE3kSFmVmK-56#VE2Hd|F!a?M%ZfZaZs=<>*x+@@
z1%Mi1o?%35h4Z^6+=0MMPfNAK2FB(UuNUP%aa0uC!V~`*#YA<RhpiL~U<U@;X%%P7
zjL8kU1Wg|yqSYhcr1t8Z{>V+-jV~O^@f5<jC=<w(1vv@fVnMkVt;KMECBEsJlGd>x
z*XYIt+Uib99*xm#*vB6TSZ|gewXmkj4}_>=i#t|9s|MD9C`Q9;zed)JXzFd`C)$lQ
ze~z}+e-`3+TFpT@fYh7hmu-LoTK?J^d}H5<16a%k)cgu4fM<Eo@Ahjc`{hbl=c~$u
zMgJCe%xk0w_V{V((}Z3wsTALG5Eteb!FOZj)GBen0v4gBXz0mh4U{R`q_!sL&~Lc*
zL2Y%s4Cw<VFjEh+2W-+qPb`K0^h7jsN=oh0D$~C4pQtz%dPBRjmsJdGi@@5`iJyyC
zMvUiShi5I(3=$RG1`EpUj`5M~XR*~17MR}Uqf>AClFy*xhAkYIGF)oy|A8OoR(v3^
zOW(QA?Or;?dpI)SHj(lmSYX{$99PdQfo1Cy5G~ZbJt&6Q6Dw+9@5qq{-24l%{K{TD
z?!3E%mz1_pxu5e98ziFGe<Hg_r{K7hGo^r{9`htzIGyzlUOn3P3|_?8-M)qM3X%AV
z-fp`Q@r7GcFO?@wZ-7h9V-KGa%U<M*8x<X+26{q=llzUWb#JB)`j=ifuod=t0p+W}
z;`xj$2Ux@WPOU$bdh_s7Y$?VW9kgF*l&8J}@H$`scq1_$a-I)eT@lShE3Fkr=z{~f
z7a6QIv>|c5KCl^?Vsv{>EuYH#1u9-!TYU-QZUP+(20AKPDtif{ys^*X;iWG+BV#@d
zj}mvu>@;CtxhJ@aW7obV0T~f19ftw11+=weE#!~NA58OmcvbctH*_{U3bXb~oLI3P
zDFI1ca2~|6^N7l(j`IiBlRndzfcQgOlfRC_=#*VbG)6j(8R!HO8k+jLeF>1z*D9?*
zZalEo={s>+j~?n-{u2R6$|;amSNYcR<fFEOD-w4a+pRm469#!SknTKn*w;GVx&Vu0
zbmx9vEk7H5LG1q=xDdecl(CRWkxq$buK)s+OnPzFe=ZOeH7d~iDr0l-{#k*<l-qZc
zSz$j9<>s0s_6Z25f#pE=h+!x)+@FU(-oCdM(-x=fK?RgdcR4N#DW(R`s8X#$jTAYs
zwy6Ct90R$T)2axYN2?P43N@q?xB2JQsy;^9Ny?**Ha^6)d;=#?Lh@CrL~xOs%173x
zeh1bE5tK_LG|DG%g#oPqws}4fb~GsB0!>lFg5~KtvUX&dN*skUSdQkw>DJJR0}4Sd
z+Uja@-{}Ai6Bs+|?{Ty%fpW-jSPGa;G|9H$O~`+j1!pm_Mw6a}q)F9)uft~UC{?R)
zsY5)J#RoX}0j?=7exLUNW&ldn6<(#PSzG;)aNkCBDxPUYr(g~RVNunZ)f{@`R#CN@
z&>vB?bfs$X`c#sPE~=EHYF!pwL_G_p=gXjkO%WvvaW~Ykun@pgYE3_)dR0U9ii6m&
zuc&slOAQ)$x2;{xBQXJt%8Xv=^kGH7D#uwz5pYF++;^C|7I7fDmLS2_wHm2w)nj@<
zGji1}<PxOTb(7MyR^dHH5{s_23m4S2_}``;TivQ>-)ft+wf{|h1tjnrDteVRu+Rhd
zA)k*OC<%3|$(LL#T32$3qiiYn)=IRXUcz#{3Kv7ESGfrV6^auoIajGqoOqsjOK@7G
zMrkjxk~i}8spOs3x1>bw0}bcN%h<mHvrEL-goImR<MBdk&Jx;WFrmx%J*+k73m$9E
z=_9x1+|0RW^iYP|LBw3!&xkCAEUI;%;!Fjr$7HV+E=Y?GBK_2M6uF};I<<&kCbXMT
zi(@Ay=i#-7)$Gc@WJ5H7^x~U;Ue5Dg>^ZbvH+nWQ7n9Q^THTe?Ulx|+m~sv%Qw~LH
z(jY83i(tt?P;C_?gAc->a~*l9QkWcrj<)*X5cZsnz!X_eCozVe(w=h}Li5$Ir8d^+
zwC99FuZ+~5qmR^{6Ljr4u=Ke09NlZr!3mwrJK&mc;>KRF;2h@?7JLm+uo}cVE2Sca
zj_*QOU=s`j*~*$TKU;M_Bt>>Ll2LmU==8}Ma}WpgP7FCNa$v)83^|;&O(52|u`7ax
zs}%mI4||R^`oQcswIi|PkO^q*-;#lrZ8EqnU_|+R=N;H_3Qag$MsC9SzH7qq$R{QJ
zU)=M5YW?5v=>Oa-@aLxg*TjvDkY5pj1O5LEs9&9=eyA$S44~{+w7TDm`&_uVynD?6
zwNP1YGeDD`o$HtZE|OR(NGHwmBcNx)5aMBzLUKfvwwpV(DlH_EfUMqZ=Wl{$1WzyQ
z0WZQHfI~L@Co6lvwf;MGU+=&!yRcUes{uR=E>M-4v{aLA-Y;N6chl1Q@iUhBD$M|X
zWd_)bJLacR(y<hrE^oz^9bhUh%%xC;q8TKcfTR=82GfuyV>2NcFKfUrSN{)ZCVOFN
zLcOvlATf^T*2QMR2fOq+FxE~yzykk`1Ni1~rgt)F98^W>W#Y4S;yaCQIEp_CL;RtO
zGLerSGW`F6d@=9{&-KMZzh6E&9O_Lzr`PR_`ksWYiYqO>4K+nDUTh*-x5-rD*3_z;
z{w7*!a$HJ{su2<|)b_7Jkvj*A?tkGOtZ6E{C{!zT?ZfV7P_-ffXUNT;N>SGkz@u$t
zu~s$40~y;607{x-_{@*ux%)0tLOBXDyWbuXeCMn=^{5<!D9ZEKP{V8kdN5MtDsoE*
zLiErp%j=ky*JBUJG#|=nM*I-q1<HijLT|$=vh*bfeupmpFZRheXz~tOuI1+TecCtv
z3V?)DZ&xluB>h&aC7h+M3>V-5J@xzkaNXN*cmI5`b|ZFlFX@C-pfDCq?b-!zIqVOw
zU!<+@kL71%EDoLMs)>g-CtpUGTN3r{v`z`bLS*dB>CfmUA_>9++t8-3^;PEo$AYZX
z9?TeEq5{-IdxW8m!R-MiZJPwNH`pX>?TxGUDiot-0P*4lmVwcZ5uneSo*zGIyxE+Y
ziz99ji<kW?B0ge_8t9f2cW*{hFcO5e!~T@LlEWG?rid{h)YRAGOH7Ps!j;y<y!yER
zeCM8qzG$d(`9BI6Qq;8vtaI!Eql`yji+IGkUClrms;)s8)mt<QG*K@?Km)Fp&j5MB
zDA4RR3h+coTFWNUyn!$Yl>r3#J-(07j6=#a;4f+#sI^T4&Da4lBGZ6py}f;}K8p5$
z|Aq>|t*-}i>I-!BCOo4+E@J?G3V4-0fHW*O|1|c1V!0rmC#<eL;Bj1mqWm}<Gl9eo
zkO&=`0xf|>!yq80bEt%gaVRrRLeQ+S$|3-knnA3IV-dJ2wCO!r1Slb9p_n=r0c@1D
zrE-PCoI&8bAa+XSoEwzNtLbG8U*QqUVG)=X4EJr4ZgHtW>V|zVm&UG51ZRaq`$uFG
zK;(3+?p21+3~3WMi*$ay^%02Z$SiYdF<&beBgos<H1V~<YwY#4dL?zoBEXGkTzUdx
z5nvbMFa!iFe>AnxFI*y?t-24afoR~|7c>ku3G51AK|{a@>;YH79&o**(umZq>;Vw`
zZA(CaQoDaBsr`L62XH<)<^ayS0xA4mngbkD#0FqZ{ygVzh5LNI<b-G@jHx>Z>GuOZ
zIovT0!6Bac8kqS9ez+qbasjj9vrQ-N?P1})5wHSYEbxE&!?%j`$F%$9d@aDinl?rK
z_EUuqQ3y7^78G$!8VHAMg(+_|--qA&)YwdkqVeX8fej(WlQTap)#YnliAP4}G`D_Y
z12|0kbw%5EI&=g$VAB!6hjHFpH2Hb|3Q;s1{yuEwy?q(U?=}?j{x9=aB1wDhueYs@
zkKMn*>zR0RKK@U^|5NZEdvwcwi2vBzRdxe-Y~kN<<sEt$K(4S>m`8*Vbx5DtyOc*@
zetoz6f*Ld*jAWiVfo5L4RyPl!74r~TF%N+i^AJ~YR~s6~*Gl!ZN_}yqz|BtewL^XF
zQeVC5s|;|X2!m!8_uN&FuTgWl@A@ddu@GXvQjY+ID+nY)WG<NUKvCx~g&cRwaFund
zw(?sT>C5k_oQ-+;av6e_{u@|q9J8hq45N_XY+-z#dj6h(FET76t#7e{|LkdUF15mf
zr%NO4<(jiWAJc?n6bgCD_q(obq^*|96`hhJ9s567Ifu_F0vYKj4)<2fu>;9;@JwRv
zh$%jahpo~mtc%?8-PQG8hid5MUrS#-a^vsWQdAtj!n)}v`YlxRkx3Bd15z~q^}Qp1
zy$eOTl-Pfc{24X+D3&?NH&gw+%dX(2hE)IL)^YZUx&s@m)7A00c?X|+PCdUF{zL>j
zAcLfv)D!6=XHq$b0Jkulcl5bHV7Cw71kS~IJ^$=E#=AN60l%f^_xq5+F?Q`#0??}u
z%&ClKW5I!VwiQOSdH8=Nf|u9pU2kH$*j8jVWr}npeSUKJ(XM48GsZe<833w6+`|0o
zi!-<EqAMP0sE62Wgk*&m8w+<KbUfp?V<FMGWEJotnJ{yBDd8iZPD=PF;RDlDmpI7M
zd@1n{?q>&&F7Z>iwmOsWPnPg8Fle7gi9Wh;26l-)O7d7qK85rEc2JVnOZrPmpDXFN
zC4E0wBUY!9{e$Ko#>1BIA&5A(gbzeB)(qZ~Q=*R&eK04FY~U!-2V;I~OZZ@RNMZpV
zj}kuM;3?swS{Bg4q=hB=5VVx&BUqvjJKBJo!Lf0;gpdC%__#cb1AJ3^u?^s@oCh4s
zW}`lUWQAAeJo|sDusg){;gsE<G4!r)41$LB%v>C!Iu}`5#^7|sG1li|ncJ|9V=;qp
zC$~=2vkx|)sDwqN_>y%V9^lB&Z&z|d!Q0W)Hbh9=suITWWDg_Ngi<)Y3<qug3txyC
z4>t17Ku-+YknHnMJpnVbD{?_Dp{ElQ^z6+6X8h1IE!8UCk7*S$msI0)oWu;If~dCl
z8x5>i8IJ92x684)f5r|SyM<nY<zsH8WMjZ<)>G>^{iG^p1?y?5#Lf$Zpa@AasY^`t
zu}}JkV?z%ke{trg?1neQRdU%#Lb2x%fhmz6FG;1tRX^f-zgtjmZ4t1$o2sG7+n|%X
zIKTbD5wwGZV2Hqp7ql}BdPYz$a+Rar@dfn;9QboMKU!8u1Cj!AxpWUkpWPM+3+H}k
z{zXU${8L6u1_OI=?POcI@%VS3!-EI!(2Nj-KS{BA2R$CDT-?(Xu)`yp5Mt9r67cq|
z$XGa8<h<Q3R<-ViO{%O+S0Xja1Re<n{JzU(I*RnbGZ2XKR87cdt$a4hr!JpY$>;SW
z>{F>RLDzdlV-tdm_mHYQROcBp_a}Hu6nV#xj;>FNyAS+GQ}5wFjDWNG;0IWBF&0&X
zZi@5kHQ?kf%mCj5@)7DK1A5S11h6U$;yYg(y59HBP#`^2+3|BYv`%Y3lZ^@2L?m64
zyQQeeMiDLjuQ=H$rt<CBr+uj`iZMfCDQ#R7OSrg<XF@rV_t-TTGhUO?w@JW`{eC|l
z;M4#a2>UoYPn*bm{a)J4y-O<h{4H>W4sN*-68;p<H}i&<CVsDHPvR?rHo&L)ZOFZ$
z(PrJxcS`YlrT9INK`DN(6#rX_M=HgKm*VBQD3;=pO8Y5F`%6muZNLgj@kpik8!idD
zb8JW{9?4e6OYumIET}2PBbDMSz#dBe^OC<<S(wQcO8)cGesI!3X@C4cUO>VBK78cz
z8Mf#>^Sn-cCNaWMs`^=T1A13~IaZKU!oNHjqGn8+vq$ALDwA{6=7F2ctDz8zlVA0&
zJr`>2SHZ7>goudOz+o;Yw@!>@m(_QtYH-&VeyA5Et%;XrgZtDw>bx$T`w%mh1un@>
z!{Ov#f{)}t19Ct-Z~F?qR2}Y<%tkou<aWHKXC<y6n*AoDA@s~AkXorFpw;@cIvlL>
zR^m7YJmBD7$;Kdc;EV|bJbbB|hj^UJRE0>{8bOZHPL<G4?>dO>JzdLjym?hOb7nH$
zA&i&}^_KONlY-(JCZV`yLp<{n3BbtwOx)?ILwR8x!44JHae;2k2u4$fdY4@qH(ne`
zSjUf8D`GB!(SeOl_t7D({Var6n6vSb?}}05r@~|8Q02ifGJ}UT`%Ml7j@i!Trotc^
z^FP?!RLn)?<fl5*$xnrI!*Tc=gHu3enJaL>s|sLn0!`j^d`eT_rb;b+FKA`BP?9)K
z*$E?ThcPP1OS(Kz+~N5^K_EskFQ>;L${G_$OM08Cu9&Oy=KLA~F>(`c$H=U!1=upq
z9)I!?f>eg>feKLx=C?N-UPgcui$NkD&+iC5v|iNZ@Whx2Z%oQy-|)BpEMrnIu7Tui
ze2&uEe~Zz@FTd9Q_sC(1Uo~3$zH;v=ZAerB$MhKX)OJY=zggE&gd{xVHo~xwL6lM~
z(B=JUDvx~rM>M0RGrEGwEVI)?`ZB!fQ;{5LU44;}8ZHEBMB`Gd;&&2&l$&Zp_5q33
zKaafF>pW2>J-I+LaqlCYvP*Z!c9dN)IGV*<Kyakc^#RrD<t7fSgYa3Lr+-<NLAzVS
z2eIT3Xot-WW>GVStWhR=dLlAZuNxtoJVLR;K$a&#bHFrKPcPT7<5=Fu0FxoBaw1Rc
ziSa&1o}hR3-{nZSX>8M(Z~Jf&f%QWs*+jEEtR`Qwi83}gbE!n$UVzBklk@VW4-<du
zylg!Ma;i+8i%(xNiqC-7{zIS$zp%<2RKKvw%v9?QR+-P^7jocUvjLK|bM&a^Co4+)
z%yZ*?{V4#ZKLhFYeXZ70nRGl|@xHWxy1)lFftPz481^ULs?pMaU+gX7-A=sgiDyzN
z^Zt1Hr`W}DWE*n$UkVC@tX;QNc@fuZcisb%xioX#!G0W~tflY7Rc~|v@)$HXP%w|=
zUf?OutaebGx(l+}jaOMR{785=hgt0o4x82PQscV*!mM@^z{2vg+R0)IknmT+UtU(8
z68^kd6-)G2n!iK)yGr~I{L{&N`!4)JCH$4}S6YAbqfkrhZ)yG2LnZlnB>6l_>qlw*
zD6Jo*^#lB}WIrg`U*2*4qtg0OT0ctbM``^itsf=({kw^0F0CJ>^`o?Yl-7^Z`cYax
zO6$ko#!~!2W=zR`U$Wnq?Dr$f$NfJ-ejfRL7X&zQ%gb7O%S-Q2TV8tAmX~D={A5_-
z8#shiH>$Ah<1lu<AU?J}Y@Y!B%U%fJ*2Igm)84=jlzzpIBJPQ2KaYH&D*~5hXB>zd
ztu+leO!Z}Xh^y+wVf$3?Gf|Tq>n*$f<Dpj)h~rA)|K*6mwYSk^nsFUxbYTp;ND{LU
zVR+)=#b;}$q}gU!VSM3<QIx`dlP8(u^Lfef8MUjh9#hE$<V;f>BVO0VO)|02tF6Ik
z_6nS5{-j>FefjuY%l@E!O41H>YSgUWVGcF*2QM~GM4{&r$9PWKn!}UF5?aBA8$DCb
z0N0c{2v+UF8CVqXgoa7~7$3F(C&8+o7*EEsD-gSe-7Oin2YP5{>*<~z;8<3*sV17K
za5})fDi>#l?LY<LM|5BKGaICJ#HU@cpaolS+_YxcL&e5dU_g2jv1Sfzk9BHpJi-Ir
zdWPFy<^aL{+-MaG^)5dhZ66@=c6sokPGsAzPVBR~?M!_Myek>?6fLnXymx|b++3|^
z=hU;=3VCEzbl*h+lsI8Q<EQPIL>qMZ0`A^YH5tGCRFUT`gOK^^@^N~`k5TMQjJkS5
z;drzZ+*mMtF1SxQxFkTH{BkGi89URd`cm6jG0@@4K`G}RAHJC)nfk2nm9-4cXLt3W
ze0B;!&URV}ANQubv$}H_wdo;O>l7yf$0!HrO_hqGKV8_yGr2d;ao@08lJ2XQ4I350
zn*}WE2VPJxC|&lc+IG^y15zrcj>UG#bZ{TOuKJ*7#$Y3$G$zBMXJ!|YWWu+BG`Wc3
z>Nfqqj@RTJMrjXz!#Q>mb2@5_i5a~P63WVQ{22+KYx9C*v5BcqORq&EYHQ)T7O-6D
zjqDv%a~M1ud6d5|g*M`1a;t_k%fSu_WxXLd);c3*yr?6;vhL(pjvAY|6}DPOc4ghT
z0U@u(b-_T)cm=yWoE>;`x+7CDad6lVo*uAsR`#JzU*ae|gM^+oQqM)u?A*#6)Y!~Z
zlROT+t95frUZbXnydWRMTJF!`UqGC<e@Fq1f4{L?jvF6GL-TMXwukemI`Z(>n1e(%
z`?f!-rFWxT*!b_L@symG{kFFiu%Z(jW~dOk2Bmc(Xd(8D3pTTn>1Dtsn9IW8an^Ye
zAgd~F?2Q`x3br@m9B<^nRXM9~2v%eNV<dyJL~)JU6ymIL-Tt$H+sl|1^?;s91OpLc
zx1a_XuC_5;D>vdsl5xoeD6SV2OUSUjJ2QvfLKI8<F!PBU4@ZqBK}b>KkQW7;qM7r7
zYozEjp0S&p7DSWHa{jnf?`2QQo-|B-(adC2`3~y4OsyfAF@0^^-s($E)<>&-t~$19
zUV^mZW!i*t>*`qMer^|yW!9)osD~%Fjt8}$*C9*gK#x@iA*6R%Q{4DNH1*$khpvN~
zJm;=2tBej{`z`2QWhT{)r=69S6y`yqi$4fDT<6*!O?)J3YzH}cvA7Xp3FroBd^2Xe
zDz97E3;8+h5I!Bq#KdvuLmoB@=YJ6uwZ>(PT6#Y^?=nZlPLUc-amI|W#6n)>a2^!1
z`M-nWlN5@H+B)n6$}|DfNR$xKRtJODHAOHzPDdtR-@I(_Jgc5))>8KaoZ_fv-rv+l
zBySG}V+NQ=KDI&bJIrw3Mju&8AO<c2;i^BXMY^@sTXd~ChODlsgTAEJ)_7)<cF!gj
zO&(<(-LQ|p5~BsbP3e7F`-7aWDhsRAui7E|H7ywCrjIYll(W77DpJI>N)Zzh)gLu4
zJ8gEPV_MKUN9Ct~4D}c0rw8*DOsSbZ4IR9N9mLol@Z_dvQ^{|WgZkEC8>-^leg2?5
zy_Fo7V^_jBzpTj6%RBSeHZ6S^o7G%`NQ7Nt7|BX$cHw2gUG5{l{=~n(yM(_<Y(qgG
z`A2CqwYL$xHrF}w;uzTsD8XHU^OJIn0ka)Q$T3NS4}i&KHUb|N*!626G-q4vogGNp
zU$@;!;6F}J-O|-xrhU898r9GVAgbI1$n{A|AK;sx&dqQ_TaSsI2W_ox%yJS`bF3?Q
z{Dv&|Soj6fGjwAYpVTlA4D4MN2p3N5>dwKL2SROftUj<AP}F})!SE-?*J*kt(uI91
zor&r^Nb8eF=OIh*URKr;%Rr(#?|xr2^jhMIW^MJ?$*7~*uk(P1xUo69bB}I35;N9^
z`?`FI@zKmLWOil#TK4&;-t;9$x6M8?aXk3U-}23H-+Esn5X*dD=3?mCgx1h`^@cbU
z%biv%^lb7~DR8o$S<QN+(v!)ApA&d+V8A^nuHW9x=J_=FJfHqDI<UFnQSFqbGHtbg
z!Ug`xD3-ie&;Av_-k}?BCihtXN73tW^1n!Wm8vX1*PxxUUad<e+(4%>uQH#Z=f)Ef
zO&(Fz4?4Ufe~%`1&Dn$Cw<#9WCV7rC2vMGU;qGMfq}PTN;YqJ;50eY9Enh)T?-M;;
ziNl~zW}A3TH@f5nJ)=V(pU;IB`Qa;==3+t__Ld6G$Bh1*;HCP93G#Yj|7r&Hj~M}Q
z;QF$F<=3;ze8YFQCV48l3;sv-z}<QYhTzHNUC=>}pUYFAe6CQO6&+OC+|bWe$DMKx
z!t&%vJ#PS;qQ(=^x;K#F18d)npo6%vF={*lBZzLi!Bq^>$J>y6upG1o=Gby$tseSy
za;9}Lm%_MlC~mwGO+5n1WQ98H#9mAqqp2ROmbV0J<JfJT;i`E9lGTKMotPklzCY%e
zM|}Ik-D4nDycnx{TNg;Ew8pYG1hI|m?a8gj*zH1~x8kASC#PGpqQ?GcYCGDz%{gF2
zMAe#TsvB)W{G^CljlwuKg}Dt5J94V-v%1U6FjE0nxUUDx^+Fs$11X>mi}YK#e_b%Z
z6*&eOwkEDM?*}UZugtWdag~wXkhMEOB|^~6S`rvf#T^^AwC~ft-L(d*$AA{?%40uG
zBID|=*ff+HkvCoi`co8Qf8FCuN1~-J$9P4VFytvEW8v=P)=7@4qyv9rVP8sq%!<U2
z!X$3IRDd$2GdU<jo|G9FBlMp}DWJ`(JjHx3#(<=;-OV^12MCcw8>1<8Alb^LfrbHF
zt5F(97lw~nFH-$emQ4_N%469t`LHc9d8YNTnDIs-ETX?rmgVT3i@}W<*8;(><kH6|
z?M+)fQE6<WW7OElXQ8{%^s=DR!jAQuefrLq^?~(-$=TpPNX5%d0Fh8m94w*8xaK}S
zbo@``k^d$9>Z;suK_Y3<jVJWFH?)p_1MTb7{~i}>?JLo)fl=gFv%oPX#zejW>#1(l
zn#%?v9k&D<<DnP9v#t~^I0pWjdbnKA&iWn>{c!CM6nS(#wE-psG6ir35Ya8cCcK(B
z8K#9pdg{ePdiHX^h{cK<M15dH-TrV71!BnUkn?4V{z~fz2s{0~g6xJMa|lgrJ;sKo
zCT{H4Lk}lsSy$`EuZsa>*Cm2^y#p1*GD~<W-c6hWedJIy^}?Yj6mJ6M><N$iFx6e4
zwAD8R8?m!lc$!XLH!G?&9~NF$qj=pd!FuqzSIFydSd@p?Z4m7QQ&9=otR=_!!0VnH
zir2LWue)kkUPr9u@jHmw5UKM99kT2;z3vIE<2%Cel-=VkE&*MKM{&GcCpCjBb$}Uh
z(KwN7L~f{GFEZ4^`Dz`cqRTSW<oH-I3Wl0&P<TPq2lL1#Kl$K^`Y&H0haVW29qs{3
z#GlwXP&6T2vDRKTbPsC`?a}Uf4kZ<59PQzZesab}Yo20@NYk}Ri-z`Vcl{?yU!0xw
zUnEkfn+ghAa>y#Tg9o3h_~i3?*YjYUV3$&4PEX|j;f*o~ie#5CzX-dm9n3EMie0+E
zI$c$7iCIh;ZF1uQo>>o(MvMzbFxLnm0tD>8kZ0uDm0;`#_E+l770b&TIyV?Q^sKUl
zw$JE-vg1ghwk+gaV&3=ap(hhFZF$N%o!J*W{t-Ph3+sJIPj&kBR9B@Q+L5TrH0r5=
z70X{}7_eT@jU8@X1OeB2XlvpeJO8d#U05G03T;kks*=`M^!6EVCQL{io24H6{nPCC
zSK7snkz!Q>Mrd==bc&ZPFkVj`UeS7bPU(eNTtq`#h{#^D3tB+rVdG)r>0)MaDeDzI
zi`l{NbCIm(7xIf4uLEydx(!cYIJ5QQSavE)TGNnBP5GA`V3cbsGcNlD0mn4X!i@39
zLa!%2o;fS^_KMd1ZV!?VJ1he7{yICe%1e$=V2ox9P6_J=F#v*|g%_$kY$L!&&4&vg
z0?r4952H7aJZ*Z{(xZj_?TFTOMpOOOODBV9wL9+xW-rdpxLpr*Yj^$wE_n7IER{R!
z4#EJXAK0P$cIc_y6^Rqw@r`I}D<Z}ieV|9jDxnW-N$!KFR-xVTL%iP5xl&tORbf=!
zsjZDw_>9<{e*PGRAC>%3jvrP0;m3~ve~iYDN&GPeKdSko0zXdFvsJJwVEUyxF$H%f
z|H*2O8(q=V?tXx4fUQ+FQ=N^Jl`XzVYdqB-kgr(4|N2GR3jeqG8T%Ia-1^Em-hM6~
z+N`yo0ghWZd&|m<9hgqq+-?VJHh=g_@oplSPWK_&;8KTUOHYp)uSUB}EE+Ez(tUgc
za_(N<cu97KPlp!|zo*4$3+wUnlT1abe}y)$s{<CD9^eb*o=Uz<IHChxabs&V^?W~S
z2%t|Z7i%|mE!GxwzNRhNQP$k>++yu3CjqNv_?Br#{T*HV%CztBGx41O9&B2yHO}6!
zSX+)CU+P?}U5o!;+0L5}<0gK5X$x-Re`DERd<0(RuRov+T51fuws?+q+q7zaCaV3>
z)CS<|+2lU}X<GY5z?ZoI9|Xbu!-&H-3S*N@OSpz~qczZRWi{Q$@B=xw=LKwpl7G8*
zMIWVma$MWZ)n&HfGM}-JsQeKY1n`6Ob2oj&WiE*tha)K+OR>k*8?@EWXpyIjut=;U
zBVv)9JNPT)kK}@b`D491e;jBOf7Diw%YK3ka`nqv#BAy~OCQ)EJW^YGR{Or2JUkNS
zR3%1%M?N?VkNk%M9w~s@AH(B^{OLo59|7o(g`c7L=h<HVS*hL84t&}trKS$oEd3g|
zYR$6I%?(?u^A)Gs)zByQwt&B03&iRJ+5~@tHX+skH(Ga1H1ulnMRKJyE$ZRE&gw)%
z+*nU$00uV!%phQ&$9iez#L7#J6URou4dbD$$yef`9mxsickx=xw>jp+Y%I>Qt3h($
zkC4<WB49q?*Wf*1*Zaw?mwu)Je1gxl)m0T8Rb#Z(;MX0oF+Tnng&(8%qZ~iV`NNMN
ze*PGZAEWtW41UO475D+|xqx50jMmuEl<w1_E`P=RrU0g;vx3l_(K@j8gFxsu_J|pU
zz*!I1Xm|V)*8u(*JQc(~YJFC*%Uz4Z+KrDb)?Psm8q0Px^ySHKuWMha!faFQZ7Z%K
z^<a~Yf%UJ4wG~zM{KOqK2CpS|lGCNh;b1GRPRxxN59_Jl^+&Ta;NP5uz#HvG@K)i-
zo67`W;JmkCxj~Ix;F?eRWs!-69!tIy4LyT_`Kb)dj<|1!S_{I)jxgdnoYgd%+Etzi
zqF-C=@x{+6&FM#*HGOBKW3n2i=)mUW?=ei}ORsOhT-@SaPf*@p(VXs#XnI$q!#@Vs
zkqV!CBQnM(cSd>cjFLO$o;$Fp_$#6!;&%FB0Z#rC#!H1=3~#UKp64Exs~d=IaaewZ
zSE$6{$ILk@HuU$?d~5qtj%2?W622pwUyFeIF3hi@ujEhy`)iF_tQ;(ri^*y55;)Y7
z*3zV{hFiY1#^{kES380V=!}0(ya1J&Y2wiy$eRz^>X}G`tbl-9SeBRM%gzEZD14yo
zkKNwz^p?YB0fBum{((Om`&e;`5qV@m3j+}m+HjZ#=HyXy6!(lu9%r4&^v1TL*xuQs
zeH-@Zo>7U3dAFfGH&yb1KY1-aE0fFdiTr{F$*r#kxdgfT;8&B@{_ptJoF33R*7MeZ
zo-%NCt^Eo60x52b){QjbDaP@E{I1zhyzR=w*NZ<0Xz5l6rNtj20pE2)K5Wv`pD6y2
zJup6A{F&3KG!t+aYZaYFKehHrcy6AC4|G2Fm$Og7{HRpuT3PuXk;w{^;B*$YYV7sk
z;!I>81W0H<8z7JOR6-im(yyaLBy$$rDJz!$Cfb9u-63SEKp7=Rg46oLZJMvx%~8c}
zBG0wN+2p-mS?ngFNe7p#DR#4|*v+=Wo1?>R^L>SYYUwJ$ZpF`uOMUES^PuEWq^hq-
zWntJ3?P1?Ne>wU4F{-rblLWblM`2)(HGZXSb<om2Jjk2{s`Vu%2~2kMEu`IcP9;1U
zHTcPP^~68;$ph+1<=`juq@uRK;3sYBNe#nxfm9cQ<QF-c2Hm|3bosTyqO)y+98~%Y
zJ|HEgnM6Ck0WJLp;L|F1_`YpC0XT*DJ2nr0C$G$}CvmKcPrBI@K9kQ0?g{~Y0(bp`
zpj?N$m4oj76Yd5E-TfQftr?8Puc3Q*(lq$VXYhnL8#KUk`HJFBgWsyNACg-gm)~El
zopf0YZ|J@JwLqN3F$3=EJluMm;c~2evIdN`ViG&zdi(*`e>v8QH#~0Q4K`82QjD-{
z*EMN#>}xg*;%A9@@cAlUW=&YUGHjd!Ap@LCY<;!RW1|delEn(1I=A+C`@Y0uFgwcw
zYl|YxB2!)R{XXUa5guYsC4D)MLh5Zq0&UQmH(_15#+8x^;AI>OB&E;9jc&L;AsFvw
zbiBv@8>XQKtQX;MI7VVd<}5wKXt0}#_keyz=|RNUh4vF&#vbdJbjS?JwrJmwH}cIM
z4mrUKgvgqx0q0TWnsVHAJ7Sj@?m1q~dr#ssJeAz<^IV`#7?$<A9kEbnRGUMid0~06
z#|%KlZ1vcDa@Lij-H59>fkD>h-;L0e!l*Up??WgLV&V3fuwt0Lx&GJ1W{S0lho9f<
zhFUlSY)d&3MqdzF)-yuf{J=qs{hgy{1ZwGVV_VGd2N8ft&lke15Nn}l?hAIHbk6Mp
z*JKmpec`7#4d40no|;{jsN#H$hYloPjWcNP%b-FgLl4A4uW9KA!53qh9|zk|C%l<j
z`v0@{J@8Q#*Z%u2uwcwx6g4W<)rOk*k3>-ui6sjOxr@6P1r-&QKMA1nCrx$*D%Fj<
zk=!n;w6*WqUw!Y<Uv2CAJ>M&R^&tvs0+;}5#Xq%J|3y*Dx}ecw0Qr;O_sq=Qz4z|j
z`~_-Xb3dPK?wy%)=FFKhXU@!=nfZSdfb1|uQHGQ=XxR@Ar?|JkPree<^4#8nH)(mz
zU$9%O4vFSNiSp58u-^pU0$=)+54_3_#w_ytfS$;w$wBVV=qG3I-%@WBKGMbC{BSF=
zFGSw>(-L$dqYwn42p|u18nea3<np|+*nAO%m$ArDui#)?A(u|%=YuEP1r-)=$qUko
zG5Ch2k|KO|0%j|Q@3$1amfF98xsZ`#W%71~JBh6Pz|xch9|9~J1wWQ!j**za9_v%$
za>1*}z)^p3oaP6$`i83)7x*6k4<a1ya|A%C>yXhZY3*2eDEt5(EtOcatFV+cT_LRv
zxZrz|7G^UE!*ElVP7ZIxa@4Ev{h}I<Vj=|JiVMSks(HAujV9^P=)-WaC6I$sK%I94
zzeJ)0T=v_1QB(m52RYi4P&Dp^FJ*iczL)}uKZv)aAYozKEsw)(EWe;o)I@QLe^~G?
zj~1oX7lfo-fk)QY87nI=Eh!7i2Usg`uo8`P2LCg0l_(tf;kb&LiO`?wJs-=0=b>$C
zy=m4#hAfFcLnIk6v@Z+T%JN5)`smtUv5&VuI1?n>pG(*73dtb~?e286J2rph38B56
z0QXpL$@{@Cz1YzNg}+o*u;|O0oLur}DRLI_rX~DZx#VRj;-W8j6~M`+I?uSi=w)E6
zS)tcK+mj10^n2M`u*chS7!rZrMALg=b%HfMc#uKJ{7SpZUbMDUPs-cEYbdg}<zt3p
zsn3pf3mQR_x8!AN^r+5iv<|^)ltzl&3y5TnD6l}@`V7)R8fY<`FsKc%O_!;^u}f+^
zlVK!=ge|;6A)>Tp&Bgd)M>HuiB14Rq()mdYd{<DiRF1;o>}8BdVgAP3lA)a4zUYEH
zw{ILP7S7VAqM(pP%_w1fHPSNurtI=sU*MGlTv)>wbp^Npl<z@bK_XdZ?1NCt%v_*8
z1E1xXFORQ-V;_aC#H^*rjeDp#&cM&$jBq3{1;1Uv9|}^q44x@?oEXl(PXN}UW@3mz
zstbePf>di4)>S-I0g2a*vW&pg{snX=FgiAo1B$XwC&O?`feZ;pLfCNRDnlM4<Y1+?
zPt@fe5+H63d1KdD8Le<zw@LSJKt2fS@?G$4R%Tzx2hxh)AP}W!+$u$AIsrWp`i^aK
z_(OZ35OccfdNQ2t#yWgayFVsF|DE7zDrReFUj{$%#m0^$PZhb~3pl6S>uxG)hQ9Pb
zVV){S$8mjWhq^>a;8f^KV-N(}7zAyp2~u_C6W~V5Y1$ctI^66^I;W&ur%?(TPhkQH
z_CktZt<N|R4lg(EU||#jj4!$x_XICj=LNZ}pg&}_B`ceBG6Rl<4_e{9o5*6U)Y-a}
zKU^W`U-HrED;NmSh|EeTdYcRfKSsZi6-dl%_&3-HdMQ4O-uAHVVslr)+uvXCF-f>H
zsYf8l>;f71H%?2L_K;*6FK`JUaTw{1RbaJrzpXC69Ck6x1*|tPsy)w=Kw3BX#*NLZ
zKf!O^4RhOHawzy?W;W+0c?&Zh?5rYYl3{SR+PJi=kyKyGMAmx3s#@N+aX$29Z*zMS
zKEqoe{Ic>V>NARcC~hHYeI$20hFaxJ^C{VIgP%rjS|6}=mzFy%^SioS+zX7vg0*E?
z!H!6509JBzlH+3T_9&gk-JZ>7D_44zVQ`yq+X5v%?DHykg{uZgwY0L3w13QF^(xj@
z>*wC6RYprd`c}(&?Z@-J=owzj6@@#%1g2&A`i@6>YMfm1inQV#gwKT=%aU&ajMkb8
zHu|w2?4e&GJl;x?tbQ80x-h-8q&S(#8~)lRt^5@dc$BX_EuRkYgtj&NV$*@+^ztTG
zd^&-q`g6el37YePp$Nu1e3qmYpD_XZ(qHgrRxV(4NGl1hLV9Ydtz3D%VW;H~k{`6Z
zgXE30!<jVE1=u)u5GiTtP1)blK76$0kYr)WyX+_=mYW+;$yN(jH6<@fD_92sCp@2W
z1|W6~3AamK%^qcw2b&)}p%**6(bIkKy!I<a<xOX{v^&D>g&yUgrv<U$oswtRCM3d)
z6?i-yJVyC)TmIq*|D~{8+0L;I+n<g25?}0gDu2^ZPw2z(U<ij<3YZe`Br$_g)X-&V
zw^-`xw5+r*zm2mo8&K^jHZp4S#%G88(GmXG&4k?3WGf5(Wqeua6~gX|RUvRhSrdfw
z3@p@B5vjiKKNCG0t~1Q$eM3?!s9NA}E#F-KkpB<~xi5MW<h<AsI1kH!zJl$v$hG`T
zPw2|egQs{x-?y$0=HQ?0`5;!OHe$BwB<!k?!v7@9p+ayzak1V$om;M)?d{q~Nu%)E
zYO|pVkPCym4RB22d?jsC_$GW|e+IY)L8+vV$lJ@BJ)wgerTdHViMRKc_%TWAD|j7(
z2cbWYLZ!7gTa_K*_U5ZX5M!y41{)BTv%M`lhlF>I_YHeHC4Mw~m<xKs8*TABX;vw8
z@be|O15%(wYkmVMfO3MB@Y>)G9y+)uaF?gyASA^S{9ak;<My)9;njg)oVB>n!M)Oo
zp93a|1MOiIzEO}mjstJk*@0%S6rr&NP<1dm*=&7mQ7zCFO82isSo}HwiX1|Llj9Tl
zXERcSq{hqerMw&dxVhnQh#|;h**x_&3Yr~mA1}AG5AhA#fg;PpHkC_H@nSP((u_AR
zwmn`CaV%H9LN*<QH*jhkZ5oZ1LPSn4B0!hZGc3g)HF-ad5WmvqE$Bkmjw1gHOMzM#
z3NlWrQ1*Gke;My>`AfEUSer+A#}obtUmp$e4?E-ue>mPh><v~Y-jbJ=%tc+nVX32K
z7aF^LLd@|9%HaurBH?w7M|m4<-+?6da_f$)=J6KGiIyEyn4wSys9+>IIg7NCFLt91
z&2O$!X(Q>vs41>s#Dj*H#j;BJqZ#L4jQz3kn{^|9dYU>BY!a#{YG#uKD6V*}pGs~=
z%pVIY;r8X{V=37aZg&LE361|8@4?eU_gUA|3r0Gj`)tp{Ho(BMOt$WqOW^14gt%e{
z5Ei+qI*YJwyw>S0*($C0oW3Jlm!3s8`5@)}uOT4*7JhW&KTqfY+Q&u&<L&(=pyo^T
z9K2I_0-?ZHWvx(N2M?Pedm)f5HU5N>hd)3Y`2f783fbnx<ot?z5RS2=jpa8RAMraV
zW$3`?OG=W6(MqNwlp)5?bm}0Ggf)``?Z6+L7uwk#I=DJ;SNwbqjz;3fTM`8%h8(E9
z%4>c>>-}tDYVCAd9j~GV@#$zY2li6aJ3#FvSR1>GHI=&hIIUhGhlD+}vpIASO=B|x
z%9XcKLbZV8T<dB1AR8UnRw|&k<wFSHHZTEYeVsLmhmZti#ig<xb>ELS;7fTo*(!1p
z_3Vqah~T_(<&SFf2;N+-X&XTw*f<nyJc-&J8lrF5i)wz}VSi5LhXXC>yb|&??WjLZ
z(;p)k3;fdk4z$aH{kNnhMnMog>&Q4&I}5!2J=ja(-G4iK?P#~}zViS2skCv%P2<09
zQg|_>oSi=aj~C{U$7i!O_0I<}NLr4h<<XNo4PTS4kyg+uB(+=EUi;Bg!T5sWlOiJ!
z>{Sl>3m|7--?zl=hnxO`WL8x)jey5u;<v2(P1$>dj||2uysXQ73nD~VTN1DnUu>>u
zI$gDpDw?jf!ikA@jCy$VA4|#rkCy+lBs>hH7ux}!#I_TL){CKvrkku9ls2HW$4^6F
z3wX!!TY2h}pfXw#*`b}|(Xv|h3?V<B7t!e7#><uN7p-V)<MH_}|Ab}u;dpeTud&Z<
z_PJ7G3tsOfpDRavJsJ*E@nXaU0q`j~$%e%38W=S$Gvl3hS@p(vm!nK4hQCeeX*wWr
zxtQNb8jobGKR5*ODNB%`sL3lF_!IChT1@6;!-rI-jB3;muh?yfWdng0ypTKluY{?8
zQ8Ejz)&DQzO-=p8Qt50<GBKd3-o6DO`||IZ8nuZcGWC~F<B=!9;_c8|yxD0MZ;y6x
z{4le3H!-^odh2g*-_m%WY+E@x9Ac2~2w>*CLoV3DY}?!rHqo6NS_aGZ#LzM_Y%x`d
z$@1ZH$rlnv^1S)FVf802NsW)axbS<$hls3D&XBDwNR9+#bif2bHVpQ8L^CG%as5b`
zrr03Sr;|;)0oEY;?Ei}(yuH6<GC3X;z_E>N+8-fQT6>euq+LoW!zLyzsF;N~CP?u~
z9N*_lij(-zU_A_<#|oUPIeV*W&dxzQYiH){y!c2Cjh=cq-jW#5Q$vb~^zQ+M2VRFa
zF=IARFAUk>GLJA~>z2n~K~jN}4A^G=Da=ahlQmr@zYo)cJ`<hv+eQPH6-g#GhXBS_
z%o6jpcB_=A(HO14>B<X9^E7z1CY#`Q!8!EMJ5Pd92|M7EZ2z$LlDTzob6L%8$*D};
z!|aTo%fvWoJtkKyk9PkuQ2X&Csx7h~-=+#=0;jVNQFBf*BTrk8cr2Q1l^*yR-r{5%
z()=l`EXd-&5-{11S0`;W$YK*h0iSL^QnzNXA88c|=&@<xN<_x}9HGH(yh23?tSP(k
z7T9?0fDYa$?8aN-IUF3)=)hZ&CP?F6Bm^+oiNFBjxScphwG(Hnc4AF@E0XH$L^>=-
zZzuj5A(`#O^>#$VSiJkr_z&>L?Zd<njb(U;&KSG}y;({M{br`&PKe;nA>LtcbF=%;
z>&d(W+m@Uy`V-l@gG@vh&8NaJ#0do${c3E(L3;%D(ciH>^0)2}kGB3Y%A+VBT*29V
z?VA|+W}dReW>A{4Esx&rPEFflr|Tbl%B!BKUA25As$cWAXjbg`rqR<^{$sNOPV~zy
zk5;-d`^{Lh4X0ovXCb7umF_%8^Dgwv&6rjQZ*gb_i{JoT@4$#8--opTw=a6TtFtoK
z7QjN<pM1J`?7tu}4zjd<zTVU7u{}?AJN6)~V#64k5t5#|QaMP25jGLb#v(KeM5fUF
z|3<JhcYTgedEEz7h6W`+LZGLq1cMTcacqgTVn4%E@B5WE{RMw$ILO8&IJoGDZTWoV
zAVwq@ka(I-S0`0HP0QGTgrMVeVh^*wklen!M0vMmPj*@8<#ta~0RiqDkD-SLLk|rw
z8+tI{VgR!)UOz-&Zb*DRh<t3AJ@{?#nr3g#q$$r+*^DR6+hEEwId8L(26$M7WSpT<
z8{;f(R0z{_2Q7wZ#&_tV&VbRk^fVt<VDG0{5595}|Co4sHd%n^f5B943s%xnwK~5^
z8;aTVrgqwoJRS7LpiG$8Qt)%s3CEl06*HUCieKO@i4evhof!y%>R`&<jA@&%kZMoh
z6xAHeO`3zbi93^KTz29%yz_~WX<Eaok|rL7QH9Bs_h3r-hW(Xh9#Pb~0?%{Qd%~2O
zTcMopvwlfqOR%i|6yntVAJeD}%&-UxON`pIo?(c@)7SO_WB(7h^%@Qn*rsA%eqnS8
z7S*<gKcNY^D={Ir9TRex$EFu!#cpS-ZI@CVV&{*j%q1=|<Z1DRW^Wn$H1?FQ<PTDq
z+G6|=ep2=nt*EH>)VAb&92$+eJ@q^#*U!f>d&-B6IAN-^I8CquA?oxec=IX(De5$g
zZ?c1gMI`3pPF8IyN!V0U;#Q3<6s*$PLBR<<*g(FL_v+5#?U&gnTk3HN+BH^8+xwJP
zr2BV~eIoX!Kp*95^-;53uaEkvkFniHUDng|55l3VKkItn8hgHJ^z>EUdH>)-{{T5R
z?;mvaVb(wR(BWcIBiTjdc2;7k^DJ}`a=|{f6pa1#7!N!Rj?HZwa-<8}vus6s64}sS
zK5J(a#?0ikgh{M_MvACS*~BNU_?%T>nYUz9U4Ub|iWzTb5WeN}$tA1lJ6vn2{R3hg
z%cm%9EuRmk?xq=YS6E80zTePBv;Pg7=(i=|486Fc>8!G*d#%bQ`r2s^z4#8$*_&>&
zd7dMiIz9(V|5?(9i7ZwGFxIOSDZ30S@@)MJN<;Jjw&iD_r==d?q|lW|f+v#hw{|hz
zKXL*o{z6~u+Ad$oYf^YKaQonB1NW5sa(VZ13i;OxWe0~WB%+?tU-A~#$nb(@dI?6L
zPSWX6m7a!AXj#?MaD--n0;A~#OBsQ?IY*$@>wlNH!!VymXF0-qFMPzY{1#H>q{eY_
zNyA}4T7u&c^nH8F&f%y4ti?h*+bKi;up>U}U&U%H@YbCym^1}U;yu}qo0BS-Hhpm2
zynBH9*S6e^y-h;@o&tuF+ST&ZF@fpab)a32eXonw9m34b4lMONO^O!<%0)-x#D6TX
zVoIG#MoeS#p#e9&5Yv|WO8!(=FBUKAZcfZs=jU*aOac6zG5L5saL}j|3k8Q74l;gC
zK#1Mb^5Jlrl4A_p35M--Vu0qi{@L5Gk(RFsGnTsf+&u<n*INB0Eq(>P*zI7Ss`x-F
zJz9Ir+6*AQ`b)RRcw;+TZ;zp|wE-E~V_iq6=fpn4vqOZRH8WySRG4F3UFy`Zf>36T
zh48`+F);~<_IA*=yne1nDPi3(nro`PfipLe`8C|5ya$nFEe;d2*1z(`2Kj1ufm$6*
zvz9$h7+pI&O?Oyfo!MGG$LC+{SOI?rpLU?enH*Son+~>Qwzv2J;AZWuOUTBNqu1W*
zth~XUakSc-J-xlzzOn6%&Qs9wv{&s7t`)q&xsF161HTOI&30Vd8(WUaB@-QoHj2Ry
z&QR74er(Hcr-pU}OBB@5$Vi>yFW9DzR}90Rz<1Eb>dv9L_~qx$ZE16AS`~&I8;=0K
zZmZtkL#S3#1-kJD>uuP0BSUYKFM6B$YpADj)7XMFtkn7pI+yxOFvcLue1F4XGBE?^
zV<nOlCWL?3d%lu=b*IAyFQTCkl@R?>-PSavuP!|H)&9_$+f3c7=5|JPAGnpys3_S|
ze?4u?;nsDkJRsXyp<t!<!~IwqVa2%!>#M5%--aFhu!=p>Pg*9&9CF<VLX@2{M(dt0
z(4YUKwMR)G+YI`+SMqU-RuPkYOzuWL&L#PvWf$A>v&>}U<&3g{y6Z+h%(P>#<pVx4
z8UZN~0&>aURzA$tQ;+f?!=FJXAQuV&fxbHG@<Hv@Xdm+_lz&|NxI2wyZXa{4l^C>-
z$$uj?KhZmdDMifeW7prUeViPR_R2oyjqM-WK33bCSr0J4_Vy2GA8QO0^A4z|_V)K?
zA9vf{`Z@n~%+_nTeJmXA^UZvAF2<xz?|gR7kjdfxGn&xF^p=~gA4D-l^3?mx1CV?v
zJ>i4*EjcskG{ZdZS0g;W2|sK;SFBT9kxWCDowV|o1Z?VXe*<Dt_AKTnxWm1Z0Pw*)
z?)SjbW2@Rpk9()IlAMvsqf;GNMQ-?*IouznsST;I5E0lA?Y{v2I!CYuej%a4pp(so
zkjMS@(d2ONwQlli9PU{e=~M;UFD?IV9qw;tqZXR0X@|%CVl6N2%Wr`<8uKO-o>TDZ
z@6pXj>tu!54OT#^?fXY@zYU|iy*j*6{gJ*g>yt;r|9&O42uL{dzrTo07$)zNGq~S7
zH17A;1B}h{G57l_d?nrQze^u*RchhOQ)BRnxA&L$;24y2zo%W0<R-84RdP_EnXeL@
z`u9K>h4=kkm?EMzD!uppOC;F6^1lBUO3A$M$(K1v6&eRQt(bb>htTFAf!zC^j)zkn
zm!$h?#VkG<fXP*_ljGy~r*K}n2w$4TFR5`90?2tuxDsLUi`<yJ!!}{+kO@0$eg}b=
zY5<!h;!7c!m^?xjs^>k8Zh45vh35QpxzMVf)~Q5ld<-E;&wD5ha>y*F{SSTiyq`^u
zQN8oL4>vb6zkAi~-V<}2p}O6Z&zn+-Er8tX{>P?X_aIU{eVtzz==yg*`?taMCQ)C;
z{SX6PZyKzRJkx!K18X1sU;o2+wA=Gej&;0jJiBCWTczvb3)zh>Ski2(%qPyIChgMF
z%j+&if(!9SryZuj5&fwX>frlgWk-RiJHFHI(CjJwE+R*BHcU_HjdyhRl-`IR^Ox#T
zy_B;Bx0R-tfp5f*&;~>+M`}O${&9X^UFW1+YY-=1wBkGvT;79&<|Wq<x~FccFM2mz
zgYLy;fXDoXI(9$ZH;5kir?n1swpCgKb-|j}$}EkjF@E!S$;EbWNFyp8ZIvS_LS-^5
z58W>)u4zf$9UzM<WPByNmfVFSIpAL8SdxtkQ^w<%M;NS$OK`moZvDfu*$a}tWcQM*
zajNXEXzAM9wOL33T?OzGw$*>zr`&_B+ncbTpKb$y`1usRTYW;CV?B|R+>*_=yEAwS
zhp3`_!%@Duvli5&ZDrLYNoVmSkI%dDn#@vevkxP{wuw$Ebh7B|ex(|Up;MXhpFQFd
zCDT@$YIjL@HB}zz&NZB4fXsDA85D|BcT$HbOOc-=A90}a5%th{+7?es>vSxQINA$0
zFR&tj)wpqi&N|>1F3YidaPrv|>ZMco9Dx(Q5X~>4@?%Lw%?;Ip$pP>d>(m<=vJ`Rb
zYJ?l;9u9GW1I|Wdr7|SBR1=T=>N`0;&fL@$QOG946;Zw8CmofF4Gnj@7zsFWA<5vr
z>KFa_1F6C&*fArm9TEYff5jM0brrhTY6;wn!^G%*IVaV>$~roBLI^xvfq^q*aD^83
z$$*#YRZzx?!Oqbm^>oAsomHV$oj9JrgV8Py6aY9sRNI3yh5{#)H(i>rHQCo#6Q?yC
z9^=MJm$TvUYETi(YPGu)e=%I2=L*st)!NevST0DfdDKh5y6Z*E<XA<a<6mz@`Xme<
z%tZQhg!e+E{n7J0q0&4HP9s4*<Ps@KY1h^RE))3+)dF_oeWKoxh1$^{1rk1Vc*zi)
ztb*>qAD!ns7Klf7-^kSJPYEAuY?rGoNgOQMkH!SX^sRm~w=1>2``W&umCkVc<bW%@
zzbudw-tP=b>s-LK33l~5YC)UU4X0lfy=7mE1;K&Sl`Q~6`hY}`!y~T+hO`dF@$+p+
zfFU-0eH&k_i3U!G1`z%saK>Vx2#GWYzYu830;f{mrvkVPD*fT+=Ju@Y=}kj7tyzqp
z$ZJnmgMf8G{74lo2uYG-*|(9=qh`L*f*wlE9P>`JJ>x3+2@IRtHuU22X@|eGHYc(b
zCs7hjmL`eOlSA}u4SsPI?eisK9Kmyeni12|{6SV|>!d`nKA<9T9>+XFA6}V|^Z_20
z42SJBNt=%P{otwl#-+$1Fus!+0@k3bmAzyO-H<p*Zesy-Rg^e$Z*E(eW7e`Z%hcea
z>ejL${Q>naHU-Tw<_a%4HP^N>dwn%!J1tmK-&!`*nC(eM*kLJH`RN;Lsu$G&URInS
z-?_{PtsW<yEHBBhddA?>)8+^3D04u!mN|{Ez2ViQx;xBx)qS>8X9a?F8M7T?EU-OA
zGOHXTo!tYVO8N$XdgvPf>Y#4`V0+&Hz~#OHfWwyQIHd0?u#Q`bWPx=Y!i_CFOk9s7
z&QQ`OjBi6K0^?7rJ&^&!nhfqk)gcb3h8v4DyZ)$E#fJUx$+I4%$Y?Y^IeH>Rl0#>>
z{Rr-^6%Cd-h2k2>4tf17#4n>X;Uh!pPZ4?3?XS2fmH{VDrY{_N#|TJ_c{LvX;J#;A
z%P#m*NE41~@G4uY?i|8w3UpPj#Cal0V=*h!T^ha6R>u13o=N-$6E?ID9AjE3jblSo
z9J|=av9fFp^SDAKByDA*@Y{>J4IdfS2l|-iOQUaCioVOz=);hi2?eg3Z7Xv#DdJ=j
zuC}tg-jeC;1DQ<4rjhAPk(tg$4Vgmz2ni_eEq&kEhS444d}@oG%v)?vj1#IMaJAr(
zrejD{bXWE1JXOtt|7m67p>`qi(^J85va8S~%IHuR;Z;p5Ob9h?vP;#FAwTU0z~TYG
zPXnwb|C+w$e<J`0NYGDqVxQ=z{O70OiIhIUPXa()3jU71!V~{V;S2f$cr~7bEJfN5
z^rj>G1yUVT`|<#6YXft7u=Ikn>R{<jp0y}wV(E2nG)=0RT}R;Nw%TwZ{z;)Eu@=p%
z&ElU`H;1g-`9^ZP2lLd{-9carj9}e00m?1S3{}s%PLc=CrO2BcTvXFq<}l{c6VQTX
zCO|zIt@VL6izhe_{7*CRySKEb*3<@S7S65#|H;y>Gg8|_%`cu^Q`cs>W=>$SdChY}
zMje$fO(-m*b>%g4DC0UgwrcqBlhHCpw0hEvbqG&p6gcWI9isb6gp3+X*gXK`vu^+p
z%Dw?W9Qy`fB8c6W0fN}K93}_**ft<~eaiu2*Eax&Sl<AqEWW#M0FXzM!Np&(&%fuv
z#mnq805pE}IhNxKAB?=-81LV78@W3h$~fxj$%aZC1LHHR55_U;m(q-5endSRm7Q-i
z<X{H7m_@=3cS6us#@2LtQ@7pGX0$(hqD}Pmfl3qm(_=>V0?;bbYRFbihNlg-=X$ao
zx$T36RGQ35GcUU9615{8nzA%D>OR5thP6j^%u$raKl$l;6oL#uS&{oWEI+QJOJ?@=
zYjioNfT(#`Fi1}ysr5z@yHk+HM&6TxR2%uR9Ar*LVKsxCJ`XZ!kX3^}F-V$?S5>L>
zW{|2d^+Mv>7pSK_0H{sn+E;j<tBF#BO{O<p`GA^*$?J$$d_ZiK+dLTt<eA|W21Sav
z&t=sN!{_xCo`$iS8X~s!DgSE#Fb98{VQ`<|rvO$n4RLp0^DhU0hJGR?eHgyFvo|K+
z_mK+V;yK#(o(A8Y1`c6Go2ixLpcBhM>Y#HjMuGm;GMlkhdVr~7Fvgknzym!SzBA!K
zODxdPdsODrHTb@tUVeSM;N=(XidwUu7@}CwtcbL}fQOr<6rhnGQlt*0?U^S&q)M#^
zV10qtmr>9HSQP&j5h$EZ;G(gMeMZ^xhFHpwmG^k4W^E$zpPKcCLHvXKxs1upH%WfD
ze{C^5;&Hod%A*4AJcat}d50X6>z~E`3e)?ayS?Apgq;3d?+krBK2DXQJ{td=hTU|g
zvaG-%M(=kP$#WxuTt^Ecd8+^^w?*<+3k*^|Q~FXtIqo!4-y?Y;L?acYhSq^|L*8%k
zYQg{i#J|zFlBBfh;k^ICJKgDmqjiS(Vvpsmq3_tkEDd?))ILWO>Z<b&b6&;avomm=
zN!vshVsNx4)>*Bzu4!$Tvluw4(oMTP^05gDPJ!il)8*K|Pp6W_8XkeELqTPD-y+^|
zJqvuf=oEQG$aFc-d|zxqUbU<&$SX`-V>n;NN4G)3?drMF$elHC+{)H)_;GxdN&nK?
z@<~?s4<6Mmi!QvHFDvi*##Li`Rpcgc3fngvd6DL&CliTqH1)bV9W7Sez6%0<3X;QP
ziOOtgbL7!K@~EQ&vnk){<lm^o>2{Y~zY^!_MM=<gHU)=4#5Gh)58e!Rb4+>+be9wI
zEHi+=AQ!v~*zxGBq=){39O-f_c)z}HC?SbJvV;@VJ|VO`uXHJ6m(=(<P{=KZ?ee<+
z_<#J7rQhztVg3uLAhLBAtCh}33sr_yiadyayrQC!mihRINAY9eH=Pdddd>|5thl^p
zhyil6%mq(STzEzh$^AU?INHe;`3#kdtDvN{BO<R!P0O*h#0zn<b~?6OgYU!_;G1ea
zUs@X?k$BvSJL2eDj)qp_J7Je!1+}PuMxV4+S%Xko^k&tDWC|U*D_ge&hbI=xug38f
zm}km#Ftbc>zKU_)2Rf>G)fM1w;QeFnyEvWW#Qxf3nMsOR!Q;Qj?h%%aDn^$QfvOml
z@jI?dM+Zllqa>M4IHl)07*`n)#6ptx_;jG=wGnf)$XPd`Dx|d*_%}A4Ch94bO@us}
zShGQr$5EABZm1bWF?A3vbH?9AR_tVVIVvH;qSv~vm8IvJkzKfXJ8KVth0i*W$WY%X
zSau%H<DJ2-I+UZ=p?z#C3-}qX@>pp|jt-Tc`vUl?1U}qxu@pFob~kR!2n>(;yTXTU
z%F9cB&+=jQ7#tA-+i~{=8e$@g1;ymA!w0Tda<yvD%yIlswr=lgH)q`vkQ!I0*d!Ug
zJh`>p+O?23a1xYwF5Eb-T0mTj$oReLL?^~kXPYCtiI9~F9?tibwBt^2h$QW&l%6Y0
zRSvOuzR*mREcikE8Ya5N7E1C$!>71;1Ey#%MQ_26IZ4z;<Nuy9TBc|^Y0n&*4BNya
z^EeusC9X4%qtR&sSBIIEhqPeg4D+}<5y!-r%kHC?<xchG<9L4+gu4n!WW#3a){+k3
zw;C=y1E&AYkFI~G>i5&>v9NaN+)L$;)cLyULbco!|CC5xGZKn3-&*$Dy&F`8?vsAo
z?hPNRsXJBelVt_hJ~lQ7#ZiN}{<DgLaDEQ!W=r0sn^xt(<Ra`P-{p(ay{TU$#%T0)
zw91JdwDGkv>ETvy!Cu+APx<o5#-<T6or~I>E0^pDoGh(%b#Al<UzcC~H1S$d7onlL
zg+j8(@P&oGZ$lNstzC-HwQo2hCz3~wlogcgg1mff|A4Z(kRZPT?w`1sa5?Gtp&seE
zuez#olYkyvA6@b;uz?R=++0e9DMrtnjc-fhEDb(S>kw>6cnKFP=He1K00n;F34PZZ
z{H(LWVh!N5`wCY=(xjJT6;_<8<|wB8A)zdP(vV%(YO*hWA^2-)Z3T5qLx94`I;7uO
zVVY%Afs2C=AzvHi+XWF%G^F^6BmA?i!4lGNFsg`8D6fH8biq4r@FadU?uI^zD+o}}
zPviZGm1!N^Itb{=vF!8cBE%%lx~Hg||4pWd@@3+5eg7M7$z>PFz7_aU=t^7gb7^f+
zS!b&?fJ+U(=ak3ccDlgZiIZ`7RD^g5b@~|(Y;Co{8TpmObF4;*VmWwr$Z1QQp~Da6
z+Q8N%yMv#FoDQ%DW)NsCOWnVll4t0HX5<t+g>JQO*i4Nevo_GRmmRQZ*v*1p=?4pu
zyzPh)2Jvd(BZHWXPkIbSu;z0WVuj@_Y~oi405<W<_(wLe4>s{1@Gi{ZnaG9AVTzVx
zEAvA5ud|3L-)02TLw3PZAH==Pi#v0fb|lLXR`qto%CKvf5{_nkJVUxwZNb=@pu75z
z-=6vbT=7sqk2GS4w{4OO>G?&%zd-nu*o9Ac8(v^&QBN?YWf<DNyqR+B5pHNVaYNe&
zWe^LghW2!CY!WlbbMb;5_t+wV7nqu)rD22A`p`D>NnaFtq9gOX(V^@PM;Oy+nvv$f
zSl9+RFv6t9r$7y<r&o6|6Qa~1MJOor!I4ml&4U|^A;eC0an~y1N-bJ0%}A;?HNV@`
zPbY6L&zs4N>bLyLXVjN0NZHjm3|DJcKlB<9&<)OX$Yqieb{a0D#Iu2{nNn=@MIodJ
zT>@yJ=SBpr@<uQAM!|;g$8f%USuWWX%#($wFRq!zMiSh+8uu!@aF&;-MrLxL8Dq+(
z3XPIom3=DU8r;a!8{Uj*H1Ln?2kexBBlf8nXr!@_(n0CGi~omkb#DB144VXh_(*}S
zP*ys%)@pu=9hz|hV}bM#32%}Sr=oDYN>oPR=1nPbN;(_p{sVvXJH!QV_@g6GVz6u&
z*V0*mjTtcTL9EIOy4)I-YsLyPZb8lv3}$|V*ZZbEj%yH!D{O3qGr?h}bJ{`&ATYGY
zB=3j=;sOl|QH+;R34psyTFb_XWY^NAa&okR#sqOXRU(OU8a|Yk?OKEsB(2@5!?_e;
zX=Mdt`d?DUD5`l)anGilA0jIUG&g=qO2b&%T?o`sCZR}-vMH%r_@Gy0eL(C&1wf@-
zo07%Y$fh<&lLw4vcW0B8j7?6pC@XHoO%0$#>)>aY{!k2}q{d$o+%T0{N0p>mK;1Th
z+9tFr<|yKCq2$D;Gr$r<6;hC~3hAf^F~YlxD-(5C{TX$Luy#HrshLjd1Vg(8yu}uv
z_>es|zDwz?Erd&_EnvAI%%CWCBZy_Cw&5}&o~c1k^g<{`iME|Ri$IzSDSl2wE1$xK
zpqSGE5A6vE<ue*6%`cap+fS|E6K>ni4qsqe;-A43cE1MNSF%6$L}4~yLdF{%BJl20
zKJ_b`nF^L7cLJs|R{A`mF*701)3^@UC&fyaQVu{4j2MSa?833C%BCg%fqSL>CA(P8
zQsenR5kCt*Dt*_^FC8s4eh;;u)F%I$WK>eYQ;>mAn-FyLWq1Pknz-TU<DCt>LJ%=)
z;#(>;R-ni|PMDOb6DEP-vY01Hz>Sc`=raHx#pcbSssxBi+Jl@(6Osmd74P2Y6r`Hu
zjK72r*u?BkiuljLy^3gQUXtm*C35t=Dg|+-({Q}72_#U@N>?qWskL4ykDjzQ_3y!}
z^=%|DMPKiUyTusX*;d|gXd%kP8a8WikW@&T)VO{h%-XM{qfTZma*IEC5YtIVw;vbU
zoSQdfpBpNIg7jR7KaZevD!!w$CiwWGm-a-tQrZBHqGfWM0*#pU^o+4gamQC<w2+?X
zfGij)IcX2%#xjbRA`d8xVX)Z{=808)9o~Nhrva9td&yL>d@av$G+^GXixVlNn5GMG
z!!Vg(jlY4S*GrNV`8C1}eB6#8PeT`<x;ck`u*sW=T2oJp_<v4FNBkth42a*OWYp#O
zN}3reMpv*V?jXVpMjy9ye7IdbW$eHN<nXwyn-1ueqi~u19{OAi*Jb4jWz-Mb%74hJ
zi(jM1v%=1AwCrduIC3hDn$MAySGA^3AQJlUNN6Jr9}LNGX+YwsbX~V9K7(eFHKwk%
z{O!PRWbFG0Gn9WAikS(;7-E5;C%hP81{Bk~L2<7MiXWt-ASuX1#mgorUP?#N*$s+O
z;J>jTXCll{kO~B4qT((S6x7ceP(0iXif2qvJe`hWXE!K@Wu+H{4mdDSaS4L71(6y{
zh8Y1hvJxpqtO3Pr0$|n=HP*NnlXvNzNr8C-(X<Xy`tDwg2guf=-EC<$F%8(XHZgK+
zV$-}&VI#w_rbscPXoU$yY+85paiD0L8AaEbP~?Tij{gJ~bRKISooz<Zw@fG^8z62y
z4itUL6oz3WxeI|tIg*K@#V|sSHIM$sjH2J0P*hD6y$j!<V@*-Wj3QFjMjrWzqN|Ss
zMOT|q<Tas)mMY>;e|7A6bgCIeBTXox1(NuA$A}`P?6&PaHpOLnYvD0M&Qy@=7$Ilc
z<oAC)Hf&*v;f7;`oVD=-UmhFES#y2#7$IjZZ~QSr&Kl8&UmP2@(D+3Rwi~zMJ<ZJ6
zf<U9{V++7lW)!7tr{K{wfud%#DJHbh+G_mCj$^|uR`45-5pqWP*Pk2Kf@!HHc!m#m
zS~qN_1s&ts51X(<ng1~!-TD@Z=HPlT)`O#LIT+3cd^xyW`K+s|IBhk!8SF}54R-6-
zC;Pr0?3fUBtfS>%jK}$Mu+rLfttR`D7lMy>yBho>-D+?c1SS2Uj@o)~825X@xgQjo
zEC{cq1>xU`1>sz6{<tpwf6;m{1VC1>sIEJf539ilXRE<j3?)a%Li%yj;bT>ZvG`)o
zufe~HqK{~a5v!yNFmUCE-K{Fe`XnZ->|$B>bJZJ3xcB+Qfp6Z}^K@&NkEZhY(R&&g
ztipr!OpmGQF}JQs3$H70xGfi+8$*K+`eN&sLJgWxgY&3}o<a@o%=ENlo=%g82Br`6
zWCtGvmuTq<vkG<}_a!GE%$dGeb)H*r1<R6OV;xYGkROI8$JWy#Gh49a93ey}azx$3
zku#qLjuxu0F8$s!a~N<bTvQJ5tYW{Xwd>9>{aORra&-L;ys<c%n9KDllW>v<77uBe
zJc))j>S$23GZgg8QFQbI#Zo<r{R{>DauiOCfqSB2x*mlKAe~|Q<tW^lQRqA;NVJ0|
zQP+tVW7mlwU4KGyMIJ@qruN**NM0=>L<6a!w!vEoHISLWfyq$#xzUR+_8Z<(x=04F
zpbdFk4yRnTeZ-!~vj7#OT$M{KxfOC&Byqq60#l{qc&PG%aCX>79uV*|@a4^CF==iO
zaLmDSomG0E60DgV8~Fq-1grJNHstY!$IlZzzLac4jjNQvT|+(86uvu{F-LRm8Y(ru
zP0cX&OWve8+qC+Z_*Zs(sUD%Bn)t^R#ovN|bnt(-{LAM2gXk0s6{M9bu0>)`3Yimn
zCnaZCCROE(PNk&vZW1y$o<qo(*a=C)k&>NsSf@C~GkmB^ihP9(LEB>_WvVVCnO7^B
zXcF4Ygr*IGCVu>9s{N1$O^T*A135_w49AD!Tw_o)pHuXtpop|2!PoMJgwnxPM^%#0
zm>Lz=t(J7FTGFLzNrtB{S~3HQzG%q|DEgu$^(b^&lJr}!5L%L&p;1dR{$>0jwWoPB
z`jj03{3cETPGyA!utJ!nL*?k%vhtQ3{s2xyTRol4R<@*z<J(%ur?UX=YJ0pbhiyJ3
zE*G@iohQeZ;9`p}IyYGZ@K3tN<u5rPE2Vi$zC$6B9KGF{$nizzx#GV9C9fvJJMZ(x
zM*hrK^0gGc6G9=c$C!$q@#Gs+u#xUqy`L7D<flL35ohC?!SW__gg&@|xt0{k)@E<X
z3tp)bN36n)bE}<sbMDVtht&g%EKNk%CKp^gab~l$;%34WEBzPZg4$qUwmPk};ti?e
z@`sgbpEA!ShhKy@=Gk)WMhA%ZN)>PTOZEkBheO~YIed6j-Oaet(^s$`n%rGCMQ+(+
zle<8}XL9(H{a7^rZ*MI7DI86gvX3W9F2@S|_*S?kNFyBg<HvVDj+Jh9`bt`ZAIK$N
z1xF<=0Mf*F2(xm4tbL7r9UY;7CfLTf+|^g|Mey@BDu$(Vs5R)Uu<R*s8k2DNl*P_e
z9n#^gQsZLcs{%SV7i;7Nj(AcNZR6m*X!!8SOGYv*3vfs+45CpeY_KTd_rcvU{Gy$>
zhR!O<HFBlP2WxQx_6$1J7Ir3a=Pb^hj}OVQ>p=|qkt3YX*4?!7DucBiu^cI_1t3WU
zj2*&-6&iQKDZ{OIl>BOf7Ji&?=!Z*>9R3ipw+-b~PY#3)3gP(j?h|OA#3gd{8fT)2
zULkQy(C?09^-J4Xl-6X85}U@v9A`ESO<c&%BooI5P8BIg=Y%)AAPu?jWmt!<E^(Ty
z-0lRq|H|0RBmNB$Br4+6dXy)=5<v`!;fL@4ns2iIYi9cXFDdd2a`DFQbv{G(l6rb0
zRI`h6Z-tQ$$t9Uag@F`?0ZLLmhMQFf?NEA@Qlt`sp<tw{jdc;JQfQMSG?!dkv*9`7
zwgklS9b~t%;^~BIX7Fb4Y(DPs-b6-}%vi4O)#MxU2v9xXn<1cth2{wX&rbqRF_Oxw
zKKk>1aRIBFrAwB{E=TWi5$Pv{?#WG3t|adjp!4CU;<R)4QKjw3!)B~|t=JU@c@02H
z>s@9w^a3d9eGPTmnLysdQ2}vURXqrNN$R16j%8KJ!BSLJ6{^Z}I}Z6wRSud`irt!s
zLR|z)qE>|X&$&6>gqu}n+>3O_Jri+;6gCI$(eq~p6Xn!?;ADG%s({>bc@TR*b&^`e
zBz3wfscv%tEY=AiNoubW3g)EAr|3>p2~_2;%!Fgby^+6%y5nGX;>K9H@F=mem`PGu
znk2b(0;7>6eMCx<q_t1cIFq^TW5fIk3-n%Mh>Y1&+V}JjjXX&N@_n%t2Shp_%#Nbh
z#Qp)CkM0^BIH3zh!uBO!CTvBo$qj94N?9s@C01vZo*P>fZv9R8h+A6mEOmC`jNCb6
zpOSIS^e4E88PIosi~N~Gr6WcMPUh(Tii7n_I)WqOO{|Bc4=J)7?<&qC)$n~reT0uJ
zlp5zCf@6{%7>akeIF?%&J}I&fi8#*Bl{e$N354hAW%*6i<>!g#CQ;oz&(Qy~^w;Uq
zSFx!WnGq{R-T`vZ7b-0RP2@7I()0_w&s|0EQsk$2Pto&3e5v5nYjW^vsc{uPRPg0^
z$M~4#U!TlBahE8_7*QWA{@hgj860r{do<Re{s_K0a7m&>1Q#I~RZPJP17{}A6~Sk8
zZN$F35uujf6g79YypIFYad!i&3_A{LPm8oRZvu{Q#M1|PK4dD-;nG!U@~oy5@*Exe
zJ5`*UAt@Qe`79=X;nE+a%kvKjO2`YYke~`DoFvYN!9^y{a}loAy%X=EehFW9^33ux
z%JUgXTxs&m(i`RZQxKuj_a5FsU%2#lkZ1BPRf+lq-si63^kkOje@lWxo`0+XzZdV2
zXO@33C9ew&^338*<ax4?XT(<r#wNxI!M#+-GlCZezLmhtElF))RM*C6_K(6O&ih*4
z#~3C}qSK<kAu|1setrSU4^#1=FM37tVDo_6H;$Q3G?X0&gUX3+Fb;9T3FhqGcz*hJ
z(GO}3BC})E9|sEEcwEL{T)z_xQ<*v}WbD&cdJJrPx_HMQn+vb(CHWYTshu>|fU-QT
zj=cL2N4N06BsYnR&VxzB&wz*Fi(wuvFX1!b04wxI7sEdKob~8zte0Fdz$$g+wMAP?
z?~^LFNYAx+lu1iHq5E#I1a1XPnF<4xF!@tJq5E#M1nxizgmSD%F;knO(~)Nl2E7<B
zVqyn_TMvfRd29tF{wz4?>6|26gC}@eC&>=%_wpvPv7xLAJc9S~r0F;qD8GOX1_CKJ
zT7v(K)H8YNnUs1KOFdttu1%$;OaoDWbWyQ4dUqN2ter}O%;kCKOpKLZWWiK~J5fwa
zHHhhu!hb|=K4p&_ep!-ZKd>_9pne#+7#w4~jG;1(moef6OcyTe`IIF>S(jsT=rz|>
zNY7PH#m_Z2(15@#h7I2EXCaE7M$y+(^o=lLQ6nNA16Q}0#t^gAW_EB{@G3~Eteppl
z!KlWrZ46L2t*NnrTNM@-k@`Ui=}F0JRfY0OIrjFkaaH4MffJ>*cI+oTL5@yzCY%*T
zdlDy*O^2&SJkrB2Kp-&r9ms<KH?9M_D<XRW_i%{IebG6XP@jlRYy0iN%M#TnaT~y-
z6%Uc5^TWiF-q@bDA$FU^k(lj^&9U+f?13V0tQ1oufN9)<z6Y~6T@c1DRMSvj!H06e
zpTII!6lpDjJWUSlN)UNmkRcC;#a1Rg_X0II2}#2HZBk?idx5`aCo+i-MSo5UqmVqi
zozk*2cZoC+dZE&8L)y8Xwn<itBmM&3RS-uKWU>mfK!E(S3Szg!f6PG~`dsKF3-B|z
z5PS^QvYmaX&Z5qz-KZm0(!|Zkh(WP(Fxt*nGolxw?P4_}i#=Xon$fvDBPlXWfY6ny
zyg0UaC*F~ZooGuHhxS>~LI<;gDVHrsmN+jxVLQTELfVo_390jDxNVj=+oTYyIxL63
zwo8pIh=G2|rrjjd^6Z|bk$IjbUmk99Yd$1J#$YlA5jcQ@MLRrA)9{LTk_iwZ@%ZvQ
z8%vc%QSeVM&&!JM#jzABWhq9jP>Vp<%wqTXFh-Tbk{Al{v)L`cOPYU%N8F9XiMEnZ
ze;mIVFrpNRW$eXji$8(_FoW2z-&p>cybqJ5Td+eNSN6b@UfC!Q+a|Ys>JENX^xD2J
z5<BI_ty07fGQF{}*=&32S;zn*rueODMh<IY9LospVkm#HgBGdrdYB$`ID;Fx>q%z)
z7fWg<vZcuRWTmWSlWRB|15J1akF_MuWiM8SF=9uu#63I@o5;*TtyyZ^1uh#T(Iijq
z%uW}BU?<LqShl6<1i5Qds{^9`8z7LQS3}EBbhhFMkoZ3#fM@PtG(LcD8uDUCWxXqb
zO{w*mt9{=rlh`B_=7ug@wrKMzEt>gMuhQXFzV;S;NgE;x-o$0%4%}Ak@=E@W3LFX$
zZne`5tC*U7)6;~x!2`6#3EOd!``55R7MNu$gvr3XeU(r71Mv9^w)wG-wBS|3hY9pk
zeUkqV6-}7uZLw31C9ekG#J1s>d_-DXg?Y_pud;=Y7cpDuRStLyTHtB!E7;-<A0YS~
zS@O45G(jUa6Fg?W0e>o3=PUU@YFvssh>rtRsMWqcDgBK}vEJDm<!JeTQ+op@h^f61
zt*lBjH)ix`Zrpmj%#B-*nYr;cYJEWF#&ohLZX$bP1~WHUvt`|eYH{35DQ=+@w{nXk
zmE^b@9U6IU*iC(Vnu&}P3J{!TC1=r0QZKCJ=)8P>=iW40<t(K3q*}k&pbz!J*@9QL
zLP`Dr%pw-{o7r`K!^u>I`RhtxAz_jWt@S=!?N@lLvKh&;87Z>KWV=)8@~L#*XeDes
znt4u^Z8Mdvkj+HX+H$^jZTSV=ZJzw_hS#7G#JYDOjR^>n#uAKG=weNW0aAoa2Q3+8
z1~M3nP02t_=x$BKQXCeP$;ijT4>?j4(y)S&!D%34AA6q-8Oj69@FVJYQyI?GWJu!$
zsqrU_zha=`P7YLD@vjkK7^wL40~Pscs+|I&SaIUCaJ=v_3wA)EY7OI-YW=vy6qu0|
zSqNawFvh`$F(cJsj4N@yyiQ$y#hR+Lf}OpEkquWcWMN4%g?~Y$#Y+E^rth%m$@nbB
zIBpDl&=bQihQ>HJHfL-e#Dk?|$uf*`T)iLVxWp(&tp22ra<~=<PNM@@P)i!yOvYFT
zCWYBpr!d1<hY@Y~q58m+(ntLo|6D|7?#W;wvu94h2trzWDVq#0<)ff_^!Z2Z!SV3}
z5boq4<pU(lFc6CGMM8{)9CXqRK&8m@2*7v<eilbC9-{eSjE4?ID-WU3JM_aLC@P0X
zapc9Llv~<Z=11TpGoa~(D8C7GaNExjpQai9q>TSs6@<nu1o9mf1O^`4{hBsjXaI%C
zB~VMr_koba*{VgZ;tkBC1lLf4H<5smfHA_Wct?BuA8gcssrPkuutIM6#OB3nayBfv
z4jF!nEuUhAexveg_yb7tk!&e^E$AxhjNgraDw<6ofSZ}N_=m)<malExR?k`0OZ)t4
zp!3EYD_6muqcKTz3fu)+onEEcFrN>aqL+IVNZt_{<|k~!mR&YqY;v~e88FJ?hxbGH
z$cb0S#y$*_^b1&+WQ%T7hSTY6zl?vRQkv1?rz343?7gx0e}bgK;)g*EiyzA{bmk42
zxMZB4VtK9UWV$N5tvpPt9+vnlLe32IsZQD(&jNiE82<23Q75gZM3?TBT=2Cl+b@kM
z+v`)x9LiFv42+nX;gRuW@I8!Y0%ybj<4FRrL`(m>JnC3et~mZ%DP4nGN@X}Xe3}$|
zYJ_HjuNj@wp#yAmOVvoy+W33C#1G&HVq_RM(}AE!6TA)WFL<kAw8C0^qEdxQ4F?|(
zm?QLp;o$YW4dCW>HLW`S4^#<B4i@n=w!|1!m{a&79ADttJ`ODtH#4MmIwFi_6xf(7
z@Q1`iH7`E+W8<;lQ-;!+43jt#8e0Vv{kRIg*k<D@(A~!;r7z{a*>A(4BnR!c)ZDAq
zaKi5V0oiYVg5Jz*znKrKj=uSJ1J~Z>=G(2uz<m3ZG}ZAn-%yO>Y`zVrLYkOwv?M)1
z^UW}7bft!by&E-t6O1^qzLRu|7)st_simHC)TJKyCft*B<>0DQtodlpqlcryE4^In
zp(DfS=^_6D)BIV-l+?(kbifsttx@U5!3uYk(NLVADOT-6{wpf_TiB$aHWv5$_7ML~
zE6+ELo}T!3tmFUD_+b>`W6j^b=GWKsM8Ax^RhinTG2WPtV6}P5u}U`?%IYJ>R?v_w
z8H8_g%-4R?)*|gU`EO~zY15DPJ751@=}JZ-Q{bOz$Zxd)-*&?{oqv%;0eFiZ|B77g
zw~-%4oo0;xN9UK&567(+G|lfg_IiW)3;&kmWcB>5`AzNJ*v3`eNB@sUe9GADtc3GP
zUgtzOtX$MNvCta4ymMl%6*n10?-6?oRKH<_)H1p$ao}})P8Xkr*1$G=mWj_?Yp^A;
zC0V52lxL70unXq2v2Rf2;hV-ER@2?k`@cE9iWM#?-rD(huR@#GWI6%(b-4h$JKpiO
z9J2eOW8`S13;V)+1#!9MfE{;s+<hKakEF;3pz$dSvE`xyH+j4uMaVx?U0aUF@F6P~
z=E>28PG7+uTqhvY-2^3@@5ZvxCVwoi4N2iJg#&px!=sKoFT6FPveRF(SBl&Qv&LsV
zjNJrs!KYY~!rrT|=S$(KY&^at{(FiR2>9lU$uY;rR4|_vp6}Uk9rZZlzd|ZcYhwq6
zvklD^STU<$yMb`!LF3y}6V0pBrni>34bA{wY0^vbGdP)yp8Md{?%lxOyUzAW6F#8h
z>soeQB{kB_Ew<;MwdB;$vo5?_f+rFeS{v!ZnmBQCtd!9rL<zYn6;2$?-!3bDZ0Fk-
zxCIlzDAB><x*Hg455PCVT{l^7!P)p-@I`zNJKzpsRu|i#vpb4X{t~nX2HzZ)ugit)
zZ<rMJ?T1@Mn?o)+65J`5{56=9z*fVS1P)Na-9s&_<S3lwuu*y=)<IgZNAAlYYQpb~
zuLRAQp7tt}o$(NVmvIO(w&B%hAv|#-X8J+NMsmOfC8(~w*pK%G)<H0j+2-Q=zA)cB
z0sHCOI`Es_M*HzvXg^*H?Z<P#SHn$v^4`TPbzqcwe}I?O49>9LOwJfo)4|<dWdc5Q
z4nT}=22ll-+Vvv%TVO-~Ui3#Wwy<?Y$mka&qnPxrua%=GdkfygA?e<hE<08L&XW~H
z#!-8Jq&j~(S+TLZ+;YKoTAil-hb3Rh(xlIHLVz8RacuRY#W+{syI3qeYspoi^}OE4
zwuX6~m(#*-?lrN}PrNN3*|Er9)ag?`WM%LxM|?`XGfuwP<j8lrT=KHCf({_Z4ALGd
z7E6XL?sTNSb4sj~+{i6{>*rU;9PlVb!(b@8QYcXw43G&sd<5^o@-tRI{t%F{IIv%C
zI6@9mb&}r-&(N=Z1z)1^xWN*<V=+<VzavNMAch<FdzB?Pa=L9l_KF5^HN!aUf<!`}
zGL8s`0}<O3c8)v_JN$5|Qh0N2YDJI@hd39=DM}NwNpATJLIjVT4sW>q(3DvA3#?oP
zuP~yv`RH_FguaXehPwRLxL?`m-S_8;qPH25%>SO`>-~28`rhxDD2>Q|3qR#=0o|rU
z{*pfj+aY06;}rmpSK=pKY*O>(RjPhF2#28abh{!wotv%ea0WlNx>juTm2}jj;Lti7
z<+j$(fK@KQD$1ME{X39?c1Vt=HJij$^g4uA8Nn;~PBQ0R)HC0Ghw1-d&cvAG@+Q0A
zx;IV>9mGkzCw?HuuEy$acAmHG1zIUi?#hL}*|OwZwimY*dvRMyErqvAd@t^4o@Y-Z
zBoIYa#gfD-(4xsqsT^edl;#O}+Kv2V<u0_xmqFhJL;?9Lqvh`~YjD6{C2qNt8vlbz
zn}r|T{l#u@NPf`ZG5JATWRf4`NR#~di}vHM+7EKHN+vr2%^>+fcUL7pzODTjqx~4C
z{iwtTuGr+aU9y6!7$RO`uUW)ZnIeiZMU2iAaeAhR6Ej6vGevyG9QLjPcep}GmLr}i
z;@wOUuV#vPAydTDsfg*UNwfAhC=VGV=pR%bX#BYz?*DL+VDsaNk!(Red43hlnq7gB
z6FSQ;-DM4YIXSxg(*3MSCO+W`=eAAy^hX<?DzCI5KCK}IZAm@BMSSk6zNJSG5yfE+
zur_dG6K<=tFLS{~AD`ICQts^PYG>o$)Oe@&`>Pp~OvWT^eoft4j;!xXE~1!2(EeD@
z^`2>fqy5=9djbRw_ebw_`J;24iQ#^1(e^5vy|3=}6&!?pA{YF*ZnE^#7W9d6*a)_|
zk-maYVdb4YIW~3-%L4vqL;MB1AGZdFp+AG0_>cq+f1m4|*y=bBw)R2vB}rQ#{jN3*
zJqHCbKCA?x+XOMb*gZJsf)jH@ZaIPjFhJ0kb=L@j{4wk>C8ACRQLy0tOK$lPY51`$
z*zCZ`auQihb~?9Vj&ow0gDnl={6JHxQuYAZj~MBsb~s}V7#<b-0s-Y^uhQvN4zc2U
zl{OqVN1kuw-NE`p+-<Z(j-E&%%*PKszZk=Kq7u9@3VbCvE+BYe_`tcrF>Q8Cr>3mU
z`>-2Vj(M!IbWKa*qzYvWOB-<VWJS#&Cwp{0LEvIcS8$5apwg^8!FwkXq^_h_D^>By
zNXkk?bSIxdek57JUV7$-6p10FkdZF5n=ziy;fsP!x}goyQ!k`ubJRlqVX1>Ugy={S
zcCx2Ve7ch2lbr|oIfu(n0purey$n;uVp#$&`h9OvM%WCNI1P3){LHfRxbPGR;n|v!
zWgJ@K3Rc7Y$Y75{C0Z?YzvlpRF$7AyD7L>cvPq<7^<JbdPZz14`4{+pM&8Zrk#{S=
zdVSL~@Ggh*?o?`fS0<+Pj#2gLjAAna?%;`9wr}NZV*|&;1|#2Ude65jQ+(^0Us8nj
zmuKV|pVfpG%_wj8XXF_M7#_^JVA=gl&bDud_n#ZA;Kh{Nnn5NGa8aEaxv-rlgw3d_
zZZnD+c)D)~Nh}?6lz7$1t~-0ruJK5!YOX<k8GQ58eG=m7{DL_U-i<jteQ)Qa-foh<
zuS@UhX3KP`oA5=C4u!CsCEd8yS28v)c#f361rifDJ>lk3fho4cDIR5vNDvq%g7aH+
zs>vC|EX8IQb<j9T<yPZ<-v@iyqs`IC1!SB(Ts{WN%RSmqzy6-;_YOIF3bF3ESM!Qq
zRx@2~qc(rl-=}j0I~o&HKQt47eXeYlVj}yX^>s{H(6L<NC{U^K7WP3a@raqnJ|3YD
zc1Y;scw-rOo?C_21P;Vaj%U2#)?MC)BUJzioJ_--4r?GWIa+!t14y)YhRYBIq=gJ=
zKL4P*qH%gB|B%_oey|wHXwt7U+|EB}<sKyR54zB(GrWd>&_#ruVVc7OOoV-e_{S>x
zm^dH7kFvKaywNOo=fq;X{TF+4<LxQ-=H!cE!rj5J+djJ94cn9zL}g**SvCu>K6zp(
zXk|=`{EkO-sJv2H8~GKF*pZ6hY>xblM>MA*7|U_#IU?e#cq}niP{4T?*~}y8fJYI*
z`N)nFlR<MTg7Y-;1cz{@BH9_RB6R%~AZYeqpxVMC9_A4{QW2c*ktQC|oQmLe5TPsS
zf$H&8L<q0g%~;DLRwW~-ZX(qz^q!?W+li>8$Spi*rU*i9MXuvPvIs)8MZ7$yPy{(q
zlXSsWybM3cVo?4E<v%6n|A6veSaivyV=ue>isF)4v*%RT%=Ju|SY9z{>GTUOs;#=i
zyJ(7KbggB9Wx)bWP+3O%=2}weEu$|kM8HJL`Ib407c7_+sJVUivPH8N)|AefKdbJ$
zS6-<Pb<dr3$AX$_cVMx5&f-P&fx6(FfP3!ZI=2ye34z}pNJEfcf5-Q0ZV$NYYUb7#
zbb~FhtTv4jO;|4>HB|HtcyV>joVx=m3k3LuZYs=$?uE1K1H>R+Ds9Tl<bXppmbtSQ
z)Yn)R1sB!^7tKjx7YsH8XGUd6Seh!FAtp15(F@0nt{yXbnPs$m<!Jwvqo-O%&vK8R
z?H*n2RzuvQZ?cT`@>n;-CUD2Xn%n2qs8n}@+XG~l(Gx7AXLF$1V9!7c7cZ(=rsYaz
z{8NLAs%I^;_!qN((}Fei^m$`V^&<W@sqPL6Kr%{WK>~`jOq(CHAj&dzR=_fO)}r97
zI^dX9H)p=ZQ(Je(0=zG?c!KkS^#RM&n%Y3k!r3)-mTTq&7Sn$KSSHoXCICuqnGEEU
zg9`|NQd2t1l*M;j%4_COH>718<0lKGaQrRA-x%>;t$C+=T_~O|6}d>fQ(E<%(o(#P
zzbnPNU-Ldygn2b##(1|#Q;YxfnBn6w{1?hp_h`SJh@o#6{xIWBev%e9{>J0)@8wa;
zL-f-_WuS-3Mh}&Z9yj~NL4x9cNc?9Epm%{_rU-8r|C90R_c8vj(m&AuS)x2yg5FI3
z2b#~(hR0bw?73gieZ2oq5CV0y{`Z&u^93Ef{xA4-{x|f0U-@u}D1Wd2i*jG`4gKF!
z`PFtL$RGSS$bmr)402$Q1OLl85J36p>X9J+YD8J*;{PoCVUTaB$DbNL8t*io$Tapq
zl<9at9c$3|f*!&{_}$`tw&uNB^WNP!MTMoY4n2gkFXI-Xh044Lf0QTDL*plUXw0)1
ze`ayh5U%oycw>aU5n;qH3MY7aH%mu&=HriW5&zB7OcHT-;J+~+qMvA{`crY3rBTa>
zWV&+Ex3(<wt)*R!S81egEj{$DrGdUD<Bw>fa#OzaPGwX1O7O%Fs&7^1jA@AXY8Z`#
zDSvuA_@gl=!4W@5HtA8*t9cL&YMCi7dekt2QPUAVN;gmZC;k&J>7jBFEagXG^iFb5
zbkjT0K+iS!BN{0U$%`?5iU_|O|1;qz7jc9qQyMK_k&M*?rKSAnQF)-!rR5dHtL3M9
zp-25zd8p+D#cRt?-`aB0x3*mLtt|t64?cq&805ep2L?GX$bmr)402$Q1A`nG<iP(f
z4$zK5dcNtU`g@_XzkD1lUw=6_2sg-qK@JRZV2}fY92n%lAO{9H&@T>n7FE|RzN6Zm
zUsQP6WtS9QQhcF%_N;n1_AXxJt{Yo?#T8?(s4j5NSuktSJonu-b@g{3yy%LH3opLJ
zoj*SisI9+p%$Qjm$Hns&FP^ucrhaj-Zcfd`a~3Zg6Ii@>0i0X!STttAg1Z-9R9m<B
z&KkH0SC`B!E}1*Fy6E!DFTb?<GWa0ZTsEh$WNgW0b1$8JX<^NrnoFxMx%Bc&3M`h9
zqEOcFUuUr{by?5M9_l0)ck;^{CE~Kg|6Kep6z?a|e@~7pZ1d$f@k;4^6o%(o{*U=l
z&J^#o>6Fq>$jP0M<DQU{KOv{klT+-;DGLu>IV6_#pyMI?12$VN1r@SrBtlY`C&!6I
z4F3}X*RREY%ClL#YiWE#gqhLUA>!EHe7wu}qZ=~l`FHy1nZ^gZqmlNL&{N6(F`iV5
zFuMNE1b=zXYO9tB_60Wc999Dl@%TxBufbu8uQDfO)8YG;!yI1-^bijnL>C^Fhcoe>
zE5cY{I!`KdI`nxgv*ql!P09(`C*(BQC*`cNdy&HK%21LH8|Ay)B;QrXAz!*-gC1>p
zopv5}EX%t<<e|+sbR6>i$RuCdvBn-E<`~uQ43bYg+Va+luw%*RHw^jG8u=~}X6t2n
zYgKuk1bLnSd7hN>2>!3;a(!~Qay?BHSS>f@KVN(tkNn>-$$!^z%6}%xI&BDk@Qk56
z&19=xuR99tIlG`cI&2e!4)Nx++w50c&9zp$Egxvti97<-mXSx;W_yTw3YR@<W&dZh
zU&~lTe<afG!n*}s3OW`~jvFe>8g@Krf5>KgHOK8?oy`OS>LB$>ech;`1i<|VD37Te
zCDXyhBJODE^d^CCKFO&W&kQ>KsvdOu4uMZpyJaTO?iOL6Wy+)3uIo3J*mAZ&?zcnk
zci?|JWWU*NAD=<?o9(32tDN}3qs_NkgdNL#x0vMn&T+`MY*>1Er-`s*S>AOf`Mz`<
z@+};mUfyyMb}Y;LxFO&9AY+3F>&PU}+x7Ci&;~iKgdA7q?1D^p;QxNRCnx0aLdNZ$
z4064l$#wn-`f^kLr6TNj<o~!y{u_={{xeb5{A^zS(=+MxHF{p>+jG`IXEcM)T!(mb
z*4XXA3_5*{Js;>-iadfTogQN<*S>=5^jTa1%SgLUq-`T*ovts-b82;}?6C|P*A@cY
zaUy>3JWDoF5|<|@KP-kN_TSlQ%p!&(mNFzO7BFimf8M9?aSetql=+aASuxhR*neuJ
zkq*W?0t4$~YN-s%1&)E1f%>>D0@vn@Wq3kc1`s6nTIB#3Pk+ln<B@WK;|pC~AdB*x
znJNoy6La#>=_Z*tA!jD_)VeTF&P+BQd05~RRm}R^$3++$mn7>bIgTvPS)(6At<O;5
zYd|CQQ~OQw$d-r`V(fDi@|Yp;Y0FV7!uIQUmAM>0@1Y#cCV9MZl=H|VhT+kcqgaGJ
zno0K>?3H<Tb8Ai=gEpDu@u&#<X{J0@>Fvns40+I)lH_!^z*iyk3lm0&q?n7S%xTuk
zP<sa6H>2)Kfv<D~am8ZULqAC!0J&!)@T`^GxO`0`<gD#ek(mrG7x32*JRZ^st3=rK
zndC#S*RIGwVl9>T9f8ZPE3ctlmTAbtTnn|!)fw95g=|7aF9&5JY?3YyEl>4z^hpMS
zn*mSNv&tlo$BuFydrk6io{Y@#e5aS?XzigK(*-_ln^|y_^VndL$955xv0WPa=}hgC
z&QPKHaEl2-Z8^q@u#D}}FpkL7F6m?zlGBL5cVi~ruhGlUml=4!2JqB|-VpfS?_C>u
zDg!#!hTNwBAs)KpHDwzl<vVTet|NmEQs?e!1-`RsOxlY+W=od2-lTqvc-JiO750+8
z6Eln(Rr*|X3^ktdy`=A8H}p*ho|yvQ*S(~#&X)7Ibpm?xO3aGdD>K;StF0uP8w74K
zytlX!wq1l>i+30%?)gl+dvn~=$aZuyp6wNB7Ezk?Ixx;jPsx!zIaOY>df>kO<#aGM
zo`*=@lKlW=gxP{2tHu~yWM&M809Ovsl>*Pd60)A@YBHmU@Vp`Ltn8VdySk%i6itHQ
z`8oacOi!a3J;ea67I-G>=wba(ZCG@Z_KUQg4!4o>0J~bivOW^L#XJqFF>HU(W~-!E
zOy)ROBHb2|?$Jzgi)zp;G}zCx<}_KS=B%=Mb3#_zU78R3FdM!+h^nBdCVXK2kEOF`
zQWYUYr_d4I(@)0_9;y$Li4@(-RkAIVE+o=<($X!{rF*=W__m956VveBqr<nqm+9PR
z5F%7R{piY(qK|ALS)}_{s$;FJpbe1x^YtBj4Qe?#5`wvbSk9v+0skMAj~3p1o#>}#
zvPS&e-V1su-Tq#tbDv2BSuB^+kFNZSlKf=l7wPEWG#&l=@?T<Be(JND1bn-BA6TAK
zr4?V>pUuh-EoGSwTyF?m+2&*Qv_9)aoz6X!p*!R{w@@q!YISb82&4UR(7A<+a*8M9
zlzDRsna(X_I(NQEbF_5sI)QJXI@j_oBHCgZsLquIo`LGzRRYh?iKw32K}MasL*VI;
z&K-FcWzP4t>1AH8b4x|KcQff+!@6d^6@B|u^zB~s?Y0G)5Bp^#f*wRwP}EO^4M6Ga
z&t{ZIuLc9P>6ZjO<wU%$t?G5|UXiXloksXZolS^(*5TzMT~9i9K`+xiEYfvHUoq&~
zAkxvvjXGJ;>zo+|ox}R1{Q`EN`nJrCyzz8LEAeu^n^N_hZk3xQ>sH@V+1H75HQkr}
zdSls1*X|Xt>w2YY?bZweSVi`C**W;Z^I|4khBokcMvK<M)~Z$sd^-p!WLRCR0vbM@
z(4t$bBD39+kH0MfZi#?{y#Y<k?4)^WM@5}2(Y#lr{ZTJzUep84<>ykS7RxsJ(a?<P
zcTV%~bu@3su#e53EEjM)Q*f{iJT!lT**tarWRqrsg4u;M^kHMu4FaC<(L-Z`?IvL#
zi7+wjXX*Bvgk^u5p|NPwxkZ?mUS+UjMVK~US%j(mBGEF#B&^m1HewR?hzQft@`OoP
zvq{(+B1}v3E)izuMP%hTB*L^byQs0^(T3%jgcX~F`9zqO=9wm80h6#M5hkWC8GVn6
zFfGk%M3|Po%_d<xOu}}Xgt3DWP+l#~BS$k9=)&?%!b(M$mgXuErlq-BglTDBY7(|m
zgk|yU84p$)!btZ$DZ*&nBib8pH>CH~X0ycDYzi#|+c5yx3%^4dVw_4pyq)(t-}(K7
zrFQg~fOSy5cqnY0N!UvwOe}M=bnPNc%hSDvFyf2zJi^?+vXu`2HZ%a(4gG{A{_PjA
zTApT8M}kKi<`!W?c@*R6Sd(<JA&huBLxlB5ULFy!Pf)&@WbMc1GXBN@U|j{gpnc7k
zc<K|dTK>&62@8lYEl-<F(miSjBc84iVg2FhZUNiZvQfVI=l72<1Y6xtSmNnw0juTd
zlO|zXM3~Cc`G9>#gjoqVeJo}4VYGb>_oHgz!bmP(6SOX0nVd2^Y^+Vl7a$KjWSh`4
z6Mr*A*nKqLXqtbPc2IA>#hSA}YeG(Fh$p9M2nZMgAIdCyaHRQIzaxwI(=75Bf_KVe
zCjPx4!d|xVu;e-y`UmFql$?*TC35y#QDk^tHQ{d+{vN^KY8!I4+F?8w!Wz@h*T6eU
z2HN5a@q_1F>gdwTW?X;&I)e$x*1;nJm)}S)pZhW5IzJOG;>UJ@>o5_AhveWR5q8j=
zR#=<5dVn0P%c{<4MpbOV-*)`%z+Zb7To|(Kk7meyO%^*3r|Ke>t>rXYgGlEKyias_
z*%w-Kc4fim3>omchwodK{o)*iPDd#F+MHocp&gxC0NHF7d1j~!%%nTCa%TH9=W$1M
z&Kk#roOSqX#@`nFZHF7oYKQGHMBac%`mmpoVd%5kQH^{{FXm;v%ABv|m^Ibq`)JN1
z82+!eUW*9(YgT-D@HGWrwq@orzRF6n_L#_Lpz^U2xH<%`cQWb(9k1+@;0FrkgiuFK
zsH0V=kq(FLT?Af-z)A#8M&RU}M-aIhi5_QCQVt37K!RA}jpk+RaL^Q1Xbk7!M*0Wo
zu-g8IW<}dckBr6NY7xJS;x%Kd4s|?e;=4#Z+ach__pVKi${^LOedZNX<`&CgbDouB
znp|7Y_K!^0n7D1l9BzQ?MRS<}2lQ)w@PF6^jnrZDKslox;Dgw1v+YIT^$3Im7yd%_
z$-+t31C0&AwU_5Sj=wcL@sG{<-)<v$uoTgc#qx@I*`OPS>B<IqST_ufW|${u3;u5(
z2Bk0z)3NJ@O+jEK0w*JIa?TD!wj<FlB<L7cp0gkCq2VlXi#a`OhEct(67(F6dV5FU
z$|d7BT^FU*TUR&rmVXIx31j?B^%m0WwMVhO!rBXZ6xKAb&XQ&O3W3+5y;LF)Y6<P;
zaYU{`TUm#;(wtQejav?l%M$;{oKGRv@2wN`I5}BtZ1a)`Qz$Hx%@|0x8L8iJUdj=v
z{Wpb;5@Fgr3PsqzQ}RrCJY=570+T#KB1|2h<O1!(B8-hmQE%!Vn|#Er5pl~z{;74P
zpgPS{k>lobLhp#Q4QXkApi9fjPs#?5mX1*(%t!~NFE&Z<>n8ntll05GN&kpR`X@4^
zC%$YEabJ-kgnCKw#eU%sO=-y<-7C_nb7kB<f~BJ!KhI9DLxL^53_o}z5)^IyGha91
z^0UtfJCn)hf&sujJ^<K{1_0}33t#;!?~DP!J~9B<HwFOfx`I`2zv|aF0NADhz-}G@
zEECLr%5y0-h<?H@9RTc;1Ay%q0PKY&{V(tQ0l+>s0NC~cz>d1I|K*)N0N95I0K0tv
zu-W7KUtW0tu#o}4HV**yP(NYIz^39-&Z{2{!~bMIsQNr<{oikQ>SqzKhEtJKn+vez
z0>=zO#q1ou!-|^dBO<Op{p=e9fOTC(#PqMf^9=yDX#lXB2LNmNZvV?$Isn+E1Au*U
z0I(ecfW2^h|9Lfk0I-h@0JePqu%pWQU*72hfPHuXu-gX!o9*d;dF27XM*0aWgWP5T
zyTOW&^fA7{m(_l5h6%m0=>X53z{~#$4S2P<FfI~%nuHtQ>vp|PXP$hu_KO^8!BF+g
z#GEg1KbM-1B0o;}2RvZ2UujkMRw2wDNPd9~>I)tduvbzUlYI@wYnm~a{ae<wK^MWc
z4*+)5L?FP^pM0ke0QTVlz-}J^Y<7A7%PS86HZlO%<^jMS8USo@MgMsf7y#^=0l@Aa
z0BruG{+G9U0I;hE0Q=4WU~?<`U*2g0fL%2J*p~(X>!i*EPk(e>`2b);1AyHy0NDKl
zfF0}YKd);02|E*6J|STL*t@>|mznzd$z~Jl6LZS)k%wzCFWWNu$NO5*Pve}7#p)p$
z7PfbxRHXfHkv28wYWuZ1<(iAQYLU)3k4$kP5jUD}z~;D(Z}Dbp>W_-JAtH{_uQ8+#
z+vc$Irzq|v5w}>R58LK4Y!tUk#4(kCeAKf%sLYP53BY1`hJH}yR5@m;#Q+bu-%+7R
zn@wr)&|G-A2ph#hIB%wlFgD!K;k;YL$=1<BBHfn+tF^h*weOkQ<tN)Vv#O(g(^QU^
z1THr1Z>YOFQdP(D-7nIfVlGRDHFw({^L)8&SMK8lXWc2!m-!5^`Sj#Q_&SXz0p<Vz
zQjEXQ0AM!=*#AS>C-XJT<2M@3Lhc8*U%+0cgXQxVsr_0u?2b*kKQN+Yq#x@iAd6*d
z%9iEjHLWxIkPK_9GpWu(0@o9Skjn|}^`QMtkE((~`#Ri+enO-T;hkiq9EYdbYylEj
zEE$(E8Q3n;{1>Is<NKKr-yxB9o4^O>7vOO%5>1euf#aS+k-|R`k?L9$$$hDaW9<{)
z6jmj|PR2VuRK{u%)<^+*nx<%JqO_|-T2?*0PE-1aE!5DCFOGMENc(^mZyDp=ttq@^
ztQ@;US~sO-<+wSiHyqbcAjiq$X0te=!7bwcJySa|tbI3RP`V+&%fMGF@U6;(PuJe<
z^E04hva><p>J49aiL|}p)yOL12Fgx923{44II1fnuY4lz<4k4K`-5cM*+IM^UOg)C
zy_E@{elPqJ8F<C!8g~g?#y-e}d>q$OVJw!@`9CJdxgrdr#vV#{p$HSh29~Z&go!Cf
z7B)?UT_9ko|Cuks=1~~q=|a}bNC!ql+-ec0_18-6owKdd=pwXuenwSuH+bLaCtfOR
zE>nyai=Ak~!^$thPNMn{VPztWrh)09bkjuG$(nTYMcDZ)6{mf<2xEL=JgG^x$wx#S
z>&sMr0hW0Aq=>tdaIv`BBrms%xW`0X23|gF#>?!f1Z1(8;msFueZ@=ss1~qVUM>}3
z<1{>4DZ*4<Qdw7vut!B32;1!c#|kb{``aMm9>%*tuWIyP6-&EIr2VNjE!UL`jJk5<
zG)lzpQRDnYKL~jniLgQucM>H4@2dnYvIu9>Ee5^4RAYM(jz9(+D|?B9%Dzsd?TzmH
zNTltJ?sHvF1xxP>sGVLY;=-aX^nL^41k=Yf_6F;h3z;sPFJQ0L!NT4!-QQ{-XR6CU
z1JUuMz;%@o7x^zFeLLBX>ZI{P3WH!f1ngzq!;Z#mnhtg(mH!6(;31i&x}PHIzFdU&
zrtWJq;ArY4jyz=jq)1yR=uqwT2W)pTQKqtzj($g^TOiUUb%80*Z8w<NxFl<NHxdHQ
zdnz~Z2%F>q99XNK3dQ#cR*AGt1i;g3Z9~I+tgX&0Pips%2s~;#)7o86intM!2Og@A
zEhb^_h%i;3P`VBgrnT7|(+P`S*XN3`93I8>zX(%diB2|gjQ=&14&@DFFFhHN#J3qD
zeQ(-mlStb@c({#7Jcb>t_f;aB>`9R}ND4Kb$7z0T<1_frsy3P9Cd$-eX~|^I>+Ou6
zX0YdL%YdUw;Hsqd#q}Vse>R6+mKs{vFR<z-%VE|+I*4x%3mgHw8|4k#W|IO(_1P@a
zs(lN|{Tm|e`4qfX290~ke{Cj%)XqlTOb9F%woI(6lX|twVEu8qNN1E)YM(Pj+&zSd
z;}H82zn@cF!FGwyQIUZ~7B`YTEMRV;`rt4m2==KqcH9FygL+*b@fHKsZUF<AeU-1t
zy3y#(cAG)>5ufvK!4Dp7TPhV{D(@*>l}T8&2s@Qw;CA&=5q7Ph1v)HDOCf%gk@Oeg
zdQ_y*wzoAR%#7DBiMV?xpI-2q>c=vJek_*W!Vq0!1&o##vIx`iVundrtq4<jLHHsf
zOk2)JM3}LhZlr%w#Qjk8VJhz)u%>voL!`Nv(%_-8?iOLaEi1J}_pJntJ7H5Ylhpn8
z3ASWoq;mK~S}k8@iZCr-0w!TiB249r8~7d-VHX)>q(CDh%_5DKcW;O=Gv0NGxJ<kw
zK8?H$KX`h}Cn~!vV6<ib|LmO$*jB^W|9AK9EINr&Qcnjt7K)IR4vHugA%qY@5^^qy
z5IGbfltP4Z4n>Hcvyk&Cgq)8Nh5!1_z1HmSv*(`PT)1BE|N71K+|Qc(v)8?5&Fq=k
zd(WOddw?>|`_K~X9A%bw*qfxx@&&(cQ#M-S<?DB$>ssw)08^Hn;LZfUS^Ot|gS6K^
z2nm#L>#dY=UOJRueUvpSnsDuSkg~eUP_ITP+d%6upHrmkR`B%-y3<wnvQoMiWV-Nu
zq3ZH}SfY%5U!G(2<+n8k%0CIGYdUhRacTwai&_nIn-a?d%C>{DKeIoE{>k4UPt)}`
zoToX;I8V=&V2hRU{`gUu<ppJ2^<eoY;V1kno>TaCUijMY4);t(Th(ox?GHJQ$hhNZ
zTjpks3bfRvY$%?i4bk6mK1M3zd`!qO?3)?NmZ^U-@b`o48dtv-=r-5hWjpfohO$3Y
zpX*oQ=kocfcnFk|<j>}(gZ_^5(?=QSXHbqIKO>Zt%FhJdX8CdXS9TE`mHi|6zYzIH
zUKi-Lt94tsyk3^&6?N%b)n%V69*Q64&VNg=O_fb3s=Ko9q>O#-tL%K}6@5L=d>yLW
zR>#-Ls>{C4R+f?v3reszl(Da0Dl=bEcFCZkq1CDPo2u@gttW%@cbtzA$~Yh6at!-@
zin3DmWUg-G{47+qI`w{~>i*gMv~?Fd<&O_NlyQCr<QVcZR9UI~jMHtFAM~+Pl#Rx2
zDtAs-`k04(x=4TH&YyFAS-MAd&I0?%;rN#%t82f#=(g40d{U4vMf;`BqhBj^9z9fl
z%XQ%#Wn6ZXO0e6MabG@Pnf2w!(;{W7n<xCHsvDSH{c@-!zv-aA;k@)w#(5c3f{jqd
zc^RjS^D;%*pUKOjKlvNvrRre$CxP?QNEzp)O$pXj8Rw<HGRq6<{t#uZe!G6L`0gNV
z8@q~a(^s)=eq<Z+^p0-ZP~r$+-zsbENO3&5;*rHKEg_s=1JPX<?|<pG&Hc8)ep`oC
z{H}lGckp4jZmR^F62QhPtLR9PO)jA~JEw>CxIo!B{8su1IsO&TM=&1vKdc8*9PIw{
z>t4X;4sM{l{Mspflr?}a5<19dkg{t4ynn&H*0boc+YN@a5p|?9U4M@;NCecEIm(d#
z;yydc?HA}T(rtGC1!G1_l{Kg!U%U@;YDRMi3lGxRt$5IFt$}^Z6WnPp`qchtiAX^H
z5a3fUW%;_&L$(dpZQnzg`%JrMTz-AOMWx1Ma32`?yGLzp1zQqe|0!ixAb+LommkC0
zqvZH<=e35y{@QN9RM$O|@5oy#W%;~8zpHNJcGh3nxw0JrdP9`Wa-?W?q_XZ{;<wGq
zK$??n8#*A_mR3*Q*dn&gv27CP-wl+ni*(y@m5bZtT=7iTBzmq@t8j6N*hJ6dp1U+1
z=w;0RB3&+5L*fV0Z-0#ZlTga<zPhao8aVu}Qpx{rXykVzM0K2QyP{h0ckbqX=uhU^
zrRHtg$6W<F$0r%Y1cD$l{>SNh#ln=Nke{l@%0CIE^3z<m-3A58k4!m0F}UA#TE*`M
z=(hRxyK}PNjnHlGGE|I>E)@4Xe3`I{ZL?Rg?YUKKTe^yE6_101Nm9y}Cac)iA+oKN
z*y^v_PJm%MZ*%iH{91%)&hGl<9MyH>y{22dH@9mxHrmOxq1md7;}b$J`7BVjT<d$W
z|M&Nnf@kVquUxu!!P=v+xAst2mbK8e-39h?Yx`G<jjyY{L2B=3928_<2lg(h%#)nb
zml~Az?-I!${JZCG_OIgc$Ze9WAIop<Jp(HvHvsHC1AWzAXKnvMe#@^nk``iXXv^>W
zieJ;!-oVoS<>qRoAIJLkv}%R5M#wS*vgF3lO~vj?wcAyXi87Ar?ww%r(T7>Z!)+4R
z);Ap{5eXgf&$ZbR?wH#~zV^^<owMVsjGw@@;u3%>$}Isn)Ybdb^*3vA`a|9Po!heH
zhq|<9sBROVc5(g=(q5q3*2twjP}6>*T-pO&J6f*4>49q)3AN-?!!=f^W6IEun<!hI
zcHB#K|EG4`R_u;YUDxFo+dRgbr05T}tjlx!T`ex#igkas{_Ym|7`CP0-q!(<x{94T
zK}@&>WJFw4x~}H#SEfm%sdp;ODAi`=22bIz*oKn#Tjdw7jZbogm?U?sW<C#DMLyAI
zELD5w;{-b_H(5la{JJkKORj~1mqp1OH8IitMENJ-_tN(A<#uC9_aw9F&5_pHsjyq5
z;0`Ipk;muMr;AJb6y$M}Rpb$MztKs^VUnDJf92}viB>QDS`$4~cT}KT{{AhF@55EM
z4s=~Vl3fR064?fSZd=VXp!>#Z>cXFjC(AzxrTl5KiftWMv8{h(8+;qC+g7KnrbO((
z@42hk_C{nI`nex<8=5=<Y*iiMq9x0q`6{+`ifltV19TgwGjtXD<4WjHiRjlC`*U^M
zI&j_9Bg{rB=I0IF*4S_B@2?Mk)NMG;Mu4wXT_w-fKLKl`3^ozK+LT~jOR)YW*pL!z
zWC=DwnUx#Tol!z>ZV9%q1Y1&qEib`poQhmZSrmn<7fqCvD&r2ityCHJ*KJ(JLzHp8
zMk=#3k=F?&*o+cvZV9%q1Y1&qEmy|A)NnUEv;4!CCM8(g60AoFHlPF>nq#dbjdPT_
z)A(}z?9o9#J6m;K6E3Ig=VbUk`JF$ZTlMtfPG23nZB=)5{2jQOcF~^4scxx$c*ZKW
zEm+02#jDu1Qn$I`QrCYB!=R75zOR2qu{=uo(pI;X`dyz@{BFo9em8a%zni{_-_2je
z@7`I(w&knXw)UCvyti4!wqC2)Hh2}=&RNB_DUoexn{#y=E_>1c_YkpA+0@eKjrsGk
zQ6<mIL~EefYIK(TlhCTPt=v4S^t6&^a^2SIvumjnHo5wTzauq`&2a4^dB|NW=KZZx
zG7ZscBtL&nZLOjH7VdZBE$MDDY=!M#u3~$0*<NF${FAVg`^V2goofA%d+w|4NGPmY
z59tjU39TgA9RDP52RV0oxZ^OkpFR>BN^i&hojej-lVpRUaL1$BBa2^boJz*X+}vdJ
zAJ6HwR#0*6x%eDM2l={Gx1ED+(r@~5#u&MOMyYU2sWE8$zLh&!OOgv#{reM2{T};y
zu>L+Ry`OV+NuHl;FOIn(oF>lI;xj&d+*t2Df1|DBY-C8@Z?k%SJ+Ugkda13=SI^cR
ztFkpoZAIEezP#qI%GQ#<$yO&Rr#7QeT1oOT{&9Pi-G%3|{Pb&iT%(QLUT`-?Wf-=&
z|2id|<Y&YG1{-tK#+U!2A6J(218rob+E`hTFXhf9(j8?y+2u}-hfSc{$~7GM&Htba
zcX0WM^D6YqRpf)}fb&4eHRMx6<7<gTKwGaZ9~^7z$_IM&RIV!$Z5wPomFPRx*Esry
zCK@jj*-YatM7Gp8{NG69n~2<0<LH-KYkUilTWY+m$aWgvMr3=9Zzpnljqf0`qsBXl
z?5y!FBD-oFebmkx?<sN@jrS6{o5p*K?4$8LMee2Xej@kQcz==mYJ7i@12lf1$b&R~
zsK`MYKU^fvO;Bb>$_KZ;5Fa8Rj5i^UbGM-yA0`sRO5hkmz@;<dBjkh21jKPFdAi1N
zh{d4<e3X37);Oxj7>%DNa;(PDXI`lBi$q?m@k>Nrs`1N3PSE%jBCpi=RU)s}_+*jS
zYW#YUQ#5{q$Y~nCQRGb;pCR%Vjn5Q$o5t@DIZNYrio8qX_lUe#<M)f4qwxntKBVz^
zA|KZHe36f8{Be;BH2$Q>|7iSak<V!SIg!t6{6&!qHU6^5S2X^r$k#OfhR8QH{<g?>
zH2$8*_ci{3$PYFCvB*y}zEtFA8vjD%mm2?C<To1sPUQC*|54;JjsGlixyFALxkBT=
ziTqvT*!dOkk?%OBRn&N8kySKaO=NYA*ATg;#<8YXEsf(@GCU_He+iyNUPt5gMdDtq
z{3Q+LUn7lUt`6o*%3sn{{*`IGxyqIzH`Mq>A~)9frXq1Hk-wz1{A;7}Ek$mnaXb@)
z<DmQ{?d9LL8pktQ9W>ri<c{*`Bp-}*%U{w({$UIq@$T{ubN><VDgSoScrTH=X}q_{
zJ{sRs<X#%@r*a>W{WZRy$o(~bfXD+iK2YSr8b4Ge-i0K8$r18zu*Q#4IYi_!8b40t
zP>l~0d4k4I6nT=y@gBQVG=7>$%n6mh<V^W@mc~bkJX_=Eh#VuIbLDfMvhzh=pz(1c
zFVgsUk(X%vGLe^Se4@xJG(Jh>RT{rW<+UQO)A$sTQ#C$K<aCYSB=TmB-=cD+%G*WW
zq4C)w@6`CcBJb1q9FY%be4ffjR6eTmag|S~{Ey0~RX(fod6h4!d`aaiDqmIky2>|I
zzOC|ImG7(kK;=g&@tm#vC7-JNOyw6Uzf$>)%I{SEpmLeYpH=>%a)rv@RQ{o|LZO%*
z-X|?6sid-s%4#C3YrKZYH8oySWG#)?5m{H`^;E8_vVqEmD%V%JfygErFB92J<1Iwu
zea-L%*JvAQd=r(JH;-+tRc@hjE0yg;Zmse5BDdA}_98oIyrW30#SJ^1Rd!L?P36ui
zd#c=3B<>;MH@l1Mt#Lf-v8TrSitMLxy!RNon6C%9zsdtd9;oqyMIIubL*+9_*<g`J
zYW!%CLo|M@$m29VOymg~KT+gK@;O;PBb1#g@-&T~A@WR(j}$pd<D*5Mqw%pK&)4{c
zBFAa`Vv*zJgL|NtD!W|d1dU%I@=A?gCGu*GPZoKte6Ewv^~$D-yg}pBRo*1>W{uyX
za;D1LMdCgY%5Jtugu6uEEuVYjbFZ@dMdF=r56I_1WphQ&lh4EQc|_TxA|I2_<MLUc
z>`9UTk<U}|d0N@CBA=7b^YVE?K1lx+k&86`n#k8R{-(&cH2#jrcQyXL$i*7}P~=A%
z|5zmESHk8}k)LV&3z1)H{A-clX#6{o-)sCwk;^pxv&iKd|5fA)jsGU{ca7sA?+W-x
zTB*p28m}y}ipHyntgi7IBG=S-O_8-UUPokIjn@;oj>hYYY@qRmA{%MEvB(WH-c%&s
zUjZMQi)^9s4Mn!n_{JhP(fDQ}H`jPuk?l0TjmY*I-%jNA8pk^-I%>R=$j%z?BC@N-
zyNlde<2^<0qVZlLchh)pk$p72r^vlD-cRJ-8t*T1UybiCa)8DU6nT)w4;Fcd#s`T!
zOyft09IWx9L>{g2V?-XS@u4D**Z2t{him+Fk!NW9ERiEMezwTb8XqI_T#b(vdA`Ok
z6gf`g7mFOP@k>Qsrtt|PCu;mkk&`rjwa9BUeyzysG(JV-RE<v)IbGv7iM(0kw}`w|
z<F|>tUE{Mv&er%{BJbAty&~_^_#BZBX#63Ob2a|3$VW8(sL01OzCh#?8vl>Tr!@YI
zNW6~%b?<qRFKB$B$d@$!ipWJ8Uo7$ijjvfTN!F4Ne!EvCnXe%q#HWays_~me&d~TB
zB4=s*U6Jo;e6h$6H2#suB^v)k<fj_{OyuVp|5D^v8vjP*w;KOm<PREOCh{kZFBkcX
z##e}3sqx=M{-N;-m6N0(ANXHcWEG896Ios3HAJqd@tPuQX}pfex*D%1avhD=7ui7L
z4MjH6cw><pXuPS&GL1J^*-~XIl^d(vRORL>+o;@9Wm}b7t8A}wJCz+&c2wC(WM_?c
z5!qGa-9_%K@t!JoRk@qW-YWM{xtGd*D)&*jugd*Z9-#6dl?SUlROMkJ57+o$kw<F$
zXpuuSeym8$Z^XVjUgR*14;Oi&#!nVGLgS~3JWb<gh&)r{BSntV_-K*mX#8A}=V|<W
zkr!xuoXCqbK3*i|WWk5aL|(4(i6XDi_#}~6Y5W?Ict1PzuM>H_#;1zBLF3a!-l*}L
zMb6Opts-Y?{C1IdXneNFJ2if{$a^$?pUC?){(#5_H9lA5JdHml@^OtnA@WI$KPB>M
zjXx{$IgP&{@<olmB=TjAFB18x#$OlthQ{9#`L@RKj^y_=zF6c38vjV-5{-W%@>7j}
zCh~KQe<|`Sjen!^JC#4E{8{BMDp#odO=X2D+OAbrRasqS4V7!DtfjJ!%C%Llqq4rr
z^;9-e*;r*0m1QcMtDG(JPL1C!@*a)fC-Q!cKOpi!jn5T1Pveh>oUif6L_V(ZCqzD}
z@ux&St?_3?KBw^)M82r;mqfm-@kJtE)%fco-_ZD5BHz~dyCUDy_+pVCX#69QOEmt8
z$WJx?naIyI{-wyTH2#gqZ#DkC$R9MmOyo}*UoP?&jjs^7Qscji{6pgvs!BgCAGD*2
zA}eXUipZ)OuP$;8jjt&ZH(j7#OJr@0*A=<8#@7+KuEraPTu<XWi|nECT}19GpH+o<
z7|cxM;8-H0Ze%#zkS0<|ON7)vjZ%JN>PC^vGki;vwE|eXH&D%h1Eg-`Ioy=`H@}wO
zmby{t@(kb7WZe)tzFvekitr60yez_7M0l$R$LMz$(&8PuU_)vz$I5L<-BYkRC|}cL
zn-Ds_U4&y4Jq&5mDTG4Oq)UW%kMN!m-YddgWeK*W$({iNNRxgM-ap{mjzRld<}13j
zkcVY}47`c{LN3XCNR$12oFi#+Ab<7oG#TjQ97&Ty`Kyno$>BcEk<{HaU{Z{y?hZmJ
zeq0EJq{*-dKQY2bMEGeDerAM^ig4Va2t%5j7eXOv@osOhElqG2BMhmV8Cr_t?nW5W
z1a~^ZkS4h65r#Cu9gr}j3GRl3Ax&-wp^!AWF~Vm=IPRW=Ax&^6B@AhTyDDKw6Wn15
zLz>`jOBmAPimc@}e4y>c+E4lRg1a+eNR#;ioT_%@(#Hj}hc9XJcoF9Qr^%B!Qv8}G
zxXTlUG{GI8Fr>+gArz7(xD!-9yf1_3=pXE`i(|NjG{N1XFr*3Y9F-62sGVwx%a<GO
zE`=dYaHlB@Y4Sk`g`~+x5&m(6FO6{Au?j<);O<oz(gb(1!jLAos}+Vc!5ywJqzUeJ
zg&|FF=PL|SXLxsb1(_uu;guu2T7=h#@R|``C&KGRc>M@(7~zd0ylI5vu3Q+>q-BI}
z6ycjjc<Tt?GQ!(Mc>4(7KEgXjc&7;O65-t=yk~^>ityeMzGsB@i*Vd|3`3gWE@T+e
z<bVht7~zLTIPP4AA$4~$OYx&3`a=T#l-zWzkQAzPQZr4+T$&sg=wq{-w?z1f5k4Zq
zPm6HeMGZrmjEZpFT`eD4UX0GCAXkLN&_rczcU&t}vF|3aIdyku5i1|kL=FxmLYj<=
z@bM9TS%goF@JSJVO@v<?;Zq`fT7=^+aTwC%mI%ik<S?WO?kI;LO>lQP3~6##gx?$C
zb0Yk~2%i_>xPu*rG{GJ1Fv$5&gyW8P7}5lHz{4QtMG=lW<Y7n?+%XS>oG(Q<?x=?$
zO>l=j4065{;kW}IhBUz)`7or(+Y$b5gyRl=800)E!as^|-0=@X>Sh3x;-5wIF+(5>
zX@VI8VMvp2A{;Xc!jLAIVGxEiSr*}#fe?l?!Hk43q{)g1|1H8XgCPuQQh`r{y@H&-
zMR=tM#|(%t$oN%+*NE_%5nd<4>qYpw5#Aue8%Fs05xzl$mqmDs2yYePn?yKfbc7*w
zGdxOh%=idHnrs!}?IIkrL&A_I+ediE2=5%>T_U_&gk#1@7}BI?gzp;RyGJ-?s)Qj;
z`bPLZ5x#GP?;qg@1bhcMHNo}o8tRVRYV{#a4hr<KF-;DR@Ixc~um~R<;YUaKu@OEr
z!ZAB13~6#=gr6MYr$+c05sukCVMvqF0sl@;0a5-ol3kg8mL_8YeQZvXu@Qb@gkK!t
zm`xOhG{MZGFvxgXgkKfmn0*w6)XhdJ#ivH}F-s{7X@XfxVUY982%j0@nBf!#InNCE
zneP6}odL(M<@__kF-xj^c*G5b-xqLb$#`9aKM?TWot=jQUbKVRS7AuqY^?IUqs!O)
zi2kDy{&>K5aQ-|IaHJ;VdlCLrz|VAco(Xu-&a)AYnPOo`lZ6qE*<@iz6U;0NgPgBM
zIA)xMAx$v*EDULanP_21laC{OX@q|f;h4D=1{ueTaLi~6gN)-vIA*$qLB{bSTy}kl
zAm@P*UOB=sOD+s)f*EsRNE6JS3xnK$jPQC9UO&PcMtI{0ZyMpvBYeXM-#EfIi}2O~
zKXPpGxYJyVr=!Zd-FVKj%7^Ip-BoU<e71d8`GOw5KG*Md$8k;N8|syT-QjC>VKH6I
zpGDZHDBOR!9~$_H4RSv;!Z8~$3~7RyiD5_+%u)<PnskcrE)m{6!ZE8c3~7QHj$ufX
z-Vu(Ok71Dep%IQ5kztVgn-Pwgl3|eZx(LS%$}q_IVT5C5Wf;-~vn<1qCYW&<hBU$K
z%P`3KTZEq+;ip76W^{%jO)$GN3~7Ryo?(#lv<Sxx&@iM4W`l+yO)xVw3~7Q{qG3oA
z%oq(rnqc;57}5kYNyCsPm{l5vG?^0N(;^%*Ps1SRV-b!SsbNSH%uWr1oL@yaX03)H
zO)!Hs3~7SdtYMJzq6o(<*D$0BX1s<$#_J*+GhxFZ<8l#>8M0xJ@wW(nHNszy@HZp;
z?FfH2!WT#QhY`Lc!as@dr4jylgntp?Uq<*>5&lhte;46DMEJ4@|2e{ciSQK>{#%6q
z5#bg1GT&D)IUkGgN)cWq!mCDj^$5o-?=Z;uTZGq+@VXIRFT&T2@CFgyFv8c5@C_oo
zX@ob6@D>riVT5lK;hRMGW)a>x!ncU<ts=Z#gl`k!+eY|y5x#xE50vv&nUPv(ldD!M
z+%2~k3!QQtU(=*RV5i7CMtG+P-zmboMtJuK?-Aj<M0l?V-z~y-kMQ0R-Y3HMjPSk@
zzITN8kMR8>d_aUB7~umW{E!GA6yb+Q_}~aXD#C|E_^}Z_G{T2P`0xlnDZ)oY_^A<o
zdW4@D;b%qo$Os=5;b%wq=m<Y2!pB7Tc@gebw+wm?IiHW{UlifvBmB|`zdXVxMEDgE
zJ}JVlj_}D5er<$bAK_CXd}@T>5aH7z{Kg2sDZ+1#@LM8$W`y4!;dey%tO%bS;de#&
z-2p#Kk9TeuH&;W`<laEPcwD<b!skTzgAx8vgwKuec@h3_gwK!gM<e{PfDhO58JH`Z
zVmT}b^o#t-2!ATVpN{ZnBK+A1e?G!ri139G{&IxB65)#?{M875J;L9J@HZp;tq6ZR
z!rzJTcO(402!B7qKZx*;B78}Ne;nbTMEKGO|182kkMJ)d{L2XcD#E{x@NXjg+X(+I
z!oQF3A0qt62wxWAKSlV@5xzXae~Iv4BYZ`KuZ-~DBK-FV|0BW^n{HpOmy>xo5nhP!
zG{P%Jc%=xh9N|?WylRA3i}30ZzD9)Ci10Nde60wt8R4}eymo}wiSW7+UN6GeiSYUn
z-XOx)i|~dK-YCKwNB9O2-Za9SMR@ZFZxP`wBfM3FZxrF1MEGVAzIlYVj_@`SzGZ}O
z72)k7e47a0Ho~`$@Esz2#|ZBn;awuUTZHc%;XNX}XN2z(;k!ooZV}!)!utfgs=Mzw
z(9b7dn|kQft!zO+qjJA5u!Bu$vUk8&x_Mj!tC-#TWG+qm2l_=j`vrU}oeyR+;yabI
zGa%3}+Bq=72S)fI5k4s32kCw41$rO3OF4fI5A=)v436-lBK+tG9}?lmMEG$Letd+V
z5b)34^92K|EZ2P6lgzg&Ut7z;_)^{PZIn0B-)*40k8*orxt}Y~fmQ5@isq_6(cRx4
zSY>j~ek0{JQ{MFPGr12N_+R8FNBAibep<kH*7nj%=Ls}{VF~LiAEMm+c}mO2X0%!T
zudIBA>Ki{n%fV&_S-Y91`CX#=#=9!VT2Ba8{-3yc4$|)QPK%ZEy2?8!Z{mI>>z=9q
z1C*Qpb(D|Har`Vz&Irn<$j^%KQ4u~m!p8*s7MI^;m2Kv=J=a)F_q;&Ajh4@*P>^8x
zLR_AI3G^4}{E%8&p5^Ud80e>3o;JQw-u^{_{+6yhmsM_{_UpkB4QVny(EnZQ$#B)_
zYsw<!{(GQ*kJDdPd2_X2qn!Tbf&TZ}9-mS@zAup`69fH?v>)D1?U$b?b7i0pv+`VX
zz%P*fg8LvtHC+?6m5($)GEJ@t>|nFZ6NqrE##BBWsrILo$4O=7vvV9@<$3DBPLWTK
z@S7w2mVmdEbTQBNa4k=5X36!+ZRWD^U$p*MKV$qst+z+!>=gZ+8Khg}Sd}UaGQTv!
z?~3qyBK*DxpA+E^M)=$ae>lSDNBCnAz97P%jPR!-{F#9NsO@o*?iXH(L!J{4^o#rD
zg$Q35;V(z{q6mL2!rzGSw<7%A2wxoGA4T{l5&l_(V->V8$n#1O{(Xcmi}2+Uz9Pc0
znpzlSe1oUWdj*-#5aE?0yjq0Ui13;bUMIrqMR@%PZy4c?BfM#ZH;?d^5sp>i!jL9d
zB`yqUvT1~46}d2^309R0Lz-+E;aGJp3~7Q@=)#aD?IRqk)P+Ir`$u@k2=5f(T_U`D
zg!hbatb`YaG{MSvVUT&G5xz%+V<o*X$n|D~?-Suzc`pny?=->>h;Xdb7Y3P+8sUdV
zI9B!xLz-Zfzc8c;R{RS?nqc+6Fr;oJz)~Em0)`<?PL6P_78nLO&yVnt5k5M?&yDc&
zBYa$hkB@MyMi>S;kBxAwQWyp~&x~-aUKoZnnHu3()i4Zcf)x(KkS18|Fbwj%d4yvX
z#4w}@RzwU#nqYOrFr*1qN(@7qVAaGh$b8fYpC92^aWM>Og4GwpkS17(F$`&fRT;yO
zCRm{{3~7SZ8pDt#Sh+C_X@XT8!;mIe(J>5Zg4G?vkS2>G{G$l}B*L*8WEj!}D?^4s
zp0ked)Q|7+uVh`m2yYSLEhBu32;VZow~Fw#5#BDsw~p}LB0L-CEME?XMf4Ak@FOC8
zaD*Qj;YUUI(Gfl*!jFmYV<Y^y2p<~Z$4B_E2tOghhe!B{5q?sHpB&*MBK(vHKQ+Qn
zi}2GU{EP@cGs4e`@R1STuqxMAi>FDW2wy+K8%OvC5#A)in?`t9gg1-u<`Lc^!dpi8
zh7sN>!Z(WWjU#-M2;VfqH;eGiBfNElw~6pAB7DmT-zvh}MtHjj-#Ws#iSYIjzHNkW
z7vbASc!vnzA;LRG_>K|YDZ)EP_)ZbtCBnN#c(;Hr+FRC2FI2RqpV)vy(>-KuUr)2h
zu|uGroetE|P5op**v7UqZCO`aZq$?&ve9la>q5uY;I;}w@qJ#{FlJ0?J2%U)ZYh6y
zom!f|;_R<gOicdYq_Jb<!OXHkX36q9>@aZ4jlR2EepB1|pN*#5^PY#xO9{&g**d+q
zsQnd=+v*0g=DYI8K7)O`i&A{I2{v8Ov$X$<dsj$m7kc`B+dQ7oKzu7y^*gMt+Hbvg
zg_7m7tFyCTVCRNU;7_(b@F=y|;S})2HvF5|p8jNdX+O7lu{3{LcCGoWE;=#sxzfDB
z%}BS*tJ;1U{|$Hx&#i*iSp+`QbG&Z}VS2=$K3iaaW$WJ#*KyNox5G|$o}a26%-kz0
zv?>~v|K?A%FTrWFRX6-7u9OwB>jJa0K$e;<D{LOvY4;WQ7M@!Iy>A20t|PWqe=e#E
z|J!<f^XH*&p-<~1>xMxtU)gnsdxxg{`rE6azg=MG(67O*cFSh9bDQ%gyH43m{lQ8L
zWra?Gop<HI=(0i=&&|%2u6(lV8nd&{v(WGE^(|i;{QxeFLqoy*ktHC@3O5?|D}~i)
z0Y1a?d0K;iz7=+|>!y!YWAhildwG3J_s}1~dwXu_?(F=}uCvU}!iS)5PkZ}fOTLjM
zM9T{O0y{T5f3oW`sZK8ZPy_n?y?$$T=;D6p2Y$3>m^4+5k3^OgvUQu6D*sZ-vsAkq
z@?2^DMnr#PM1TG>rR_W+yQ)rMpn6e!A0@tYbp76;p5vWP2zTs;eDw(Wr3Q}gAMp33
zz{?7U7k@1O?a7mgH-R7Nx$VbaU40(nxy|g{R!Xw0aF6HKZ{UiutZ;+pwqi~{*AE=$
zx!E871@wn`ZuUF5_I{%0rhna+&>!Ks=~s2_T7IO#^qaeOovlZ0`a@j%9cAj)yprc!
ze{zoJrjM1T$_nRsZuYyoc6x#5rvHlU-?G9*o}2!-@4+we+-ANmZi;qyhv&9(-vn3A
zcY1D54&VAb>}2a#oBbzUd(YOdHv7F?`^wg@HvK(a`<m?SoBpviU_V>G+GhUEk_J*%
z$kv6nmFCculocNIcI4+SZ2u1UJkRTEy~Xyj!Uvv9vAb~I&M1d^6>LLYsW%8WYzqEy
z@r(SI=IjFACsbCLU;HBfE!{uf0)O0dOSh{OSy|yp&rSc@x51zGe7V|xKxA3rInPc1
zU}s+rk{V2Z6SrSpHthX5<6YQ!)pL7720c$%AzPQp`kx<MIn?*%fOqmBJn{ha-za{O
z|K`t|uAC(k8YXJFZMGKl-!q(a)AFAc>3{C;Rzdn7^oqq`J^0I~mhP|ilwDF*Ft6oa
zyxJc&9b6i>2J`bYalNb{or;F;=8r77TUKc3^V>%Kuj=-D9nWpW#!ha(OXbyI_IG?8
z_T}KC!R%i#2K;BkzTDn*`oDVKQvKP=?f2h2H~UlNC9txZp7+P}Z+s5i&Q`MhGVe|B
z%3k00`+9EwX6rWZsQdTfInb}>^)1~7&Q1-_ZU5f3CiH81ZY#buko{Fw$i|t~d~%Vr
z(^AK^X%T+FTG%hrIccz&>+5d>`*ISY!R-HZK6p#d_t5R{j0NAw^JA6YcrLi?WDVmr
zcJ#4Gx3%Zj>GpaTLVruo$7$?$r{B)=YgGR+>9WfT?LFT`V~g(vKg@Hy>knbt(MWfD
z&#nH?d<pv5`qFq`62fN3L*II%;(JiRZyXAKsJAmhW4|8>-o^8-P?j+EC~#>68ak_7
z+xgSebJK4<1p2)^@1pvBjscg86%EGUb$n0HJL~qxot<ob>6yyM9|t?x`qHL<ob&&H
zz|Q(EzXLtrTJ7{&6Lya9+-A~m-U{U@nbu(S=SWw7#3>E?sO;_Pk2s~l>Q6mae};KJ
zUSr=5K)NS-ZuMuh9IEB~!Sit%8!cHXE1c%J)t`2*{$%SyTm9+n>d#ECKS%3ND=D(F
z!YI$J{#>~b>DugAdC#O~_^yMXe~s6-oNw&-EuLFV9o--L=X-ATVa<KPEjRM+G%csA
z9Jf*_z5^Yb?s0xz=IvNLd3Ar-nHcaxTzO9N-0b&o`qz4H^=It^VP}fxrvIZ<wX(vr
zfZyQsZ}Qyg&!?{cx!rSH!R<jg#FiCidu~U>gKjF_zm0nZ=hb(4{gbtPUUT*HUe7Pp
z{n*yopX0e4E?wy4>}2aaf291Dk)_l9zCQe%=k27b|H$Uxj|BYt&ft%FUPtwtZVUc+
zz<1gL{E2`+vlaM%JeR|S3+FWff7)~N=jn#v&w8%aGilKn{P}>-Sr`08&&|%5&A?v@
z_+y>GU-8`X_3<{~uLk`0*5KLt&!&Iwmf&xCealxr8G<P*yzRO9bIp3-?|N?e`dNmM
z$_jQiA@5amr6cE+Zhw6c=$E<u^-;k0>kK;|dv1P?ZV&!xz^AkU|199G-2VE)^P1|<
z*DhaQd2adI((SKrJU9O@ULW@DtUSwCL$|+v2=te33jJjP-`MT1Z2f1;*UoN#{o?hF
z4{-ZyMZlN1`uUsZman<4Uj5;@<*TCGUlp_!X8sR!`^(NQGrmIu_+QEESJHB;?)<S?
z$k}+p4m&|VTmN~S>Mwk@bo)KdwYzLxXw$#U<ttkk+W2}hv?Sx7-XG%&n}BEQLhI>m
zQrqQgU9WHa7*{?v3t8UzseY!eerD@JTYeY1c9*RSZG6qnNH<#-+Wgtd)z55QXyd!P
z`q{$!WBfJO?pg)>I#)k8@!b6X$nD2$U1;Mwy87AL>s!92xO{Elx#=I{+FiCTwDB8V
zzOr?p&Ci!yzHqf(47aKL*5xZ(7uxs;*Y2`)p^b0T1m)J*+p%;{b?vT8z+ZFuva73X
ze;w}HUA8W?+1bkNuWVgt<0p1Py1RP&mamDf-R<tV`FWeG=X(Uat=nJOy3nRy$?Y$@
zN|5&yYWehX`)gls$M_6aKeKhAZGS!SApFeMg|47KI6*q(I)!ZgXKUaSYT&qku(yBK
zI>m$^ja-L*csJ}H>-BfjSjQJjx6`-ZN4kf3ed`auJ`w2-_S{x_9kHaeo&9S=|7fpY
zrXADy<4fx=?pq;gTEN>mi=mdvJ^O*<EuQ81Mz_Mxq29h-VRm%onXNl*D|VHw0e@^1
zP2L5$cF|tfyHGyadeK%sk6l#S&vl2xPPQJk<?Gs7;MscAJ7|87s#e<0%`U&|1o>*<
z@>?h1J3IhCNBjKR6Zn&5=&-DCq31hlZ0c<Ai#@j|oQK|0+MgRE_2=4?kgse#YP?4p
zp~D>5&(@=UQS0s6uD)I6(=~r8&w_ro9(8@~Sf6y|Io0di3VrYOK)Ttw(^ZSfCOuCE
zzsc*%WsVEmOTNkq*}Bu#UIsWjGrhjq8RqKq?Viiei^18M?YY_6b8pzs)|a;9!r-I8
zv-PFzIR0#3@cX@;Q`G#?gD}qA*YDqf$}f1X^nRH?7<L};c1EfGZvDWs^`*_9-Hrr*
z*z21=3!VO>o}2#LPXBSwO@Gc_u=Awnrhmf`;7@sO`a8J%KI^&ZZ|VHE-a^`}`v24o
zXuk`+zRl>Gw-d^zwJ)Dms=w`#=m+q2-D2pZvZ6HnvO>0AbWPo156ksY(*oYWTMV64
z&R7QhH+{OM|Ds&_)-LSo^~G%$_Hp*J^`%X}@4?U??e)j1{t9RR{lNY<heLmi*B_|*
zlUBf=Y&~kT-{TkXj{`fYT)@^YoEO-s@hkL~2Kv`J{R;#Am!19>f&Ny9!v6Vz{+yp-
z|LZ{iMW=sJpg(ds^t1J@Eng=OhW!CvzmJx~fR)hC*1<OYm3u?~z(7B7<@|Ht&k`9j
zXj-_>>yK3XA5=oWk*%9;_6Nz3MAHJ^$XpB~Ro+<v`q_Hgrr&%d^yhkgt0zyV(3eN3
zG?@PM)1i+yI~RlLU-bv_o2|cX`mdb_eY~By7>25xSq=8Hb-7J{(HQ9C4bJ8Dx2OvJ
zY`t#NKkQuSFAns-cKX>m-ll)347D^Z;7!ow?GLX4`!$37p6JT|d#^92kuD5y<)5wl
zZT6R)0sDAEbTOFzrmp<!1@`Yf3;KAAbb0-*uKcrg!p(j=SN?d@bb0-?UHLZ*?C)_l
z?Bng*#V|wVpvuT^wywC@f63J!yrH|ie%k`{v-QSJe@bW6=TTn2mHzHhSFi9E?_y}9
zvR6geX&(4l+m##M^j%)RQ3CyJ-EvF!UTJqt3wX<RF?3Qn+qJum1N+;#{u6KFE{0Aj
z`?_|Qt#fYn8!twE&erokS@lmIQ~J0zt2g|?+un<zmdf9+ft_rgwp}Tmu^aTi3-oJ>
zo!W&xeZI`jzPp3(74V6U?;Y@$9q%9TcO~80g?$3v(CP0R@Fjb}PrS9he7+{_0seEq
zAKnxEmw*rJ1CF=cm$x&@*<UY6x1F=!DB$}$`;7x$)7ftl@NVwB^tT}0U!464f&K>0
zpUMG$#o4bK@H5<gFAMmtZvQq9_|cPbp3vIY&r7Qn%i~z7cx8obp1++zUU35US9@=#
zla}AW-%+o!b?oKmE;Kv@`r8Hi72WY}8=tP}zwPYr?)9xdf5_R-*1b3VfzEy(uRm7(
zImp?!s|0z2yZUpMoF~Zjj&FAZRsSb<o`Ab`#bEk(%lTx}!kU5pP44_5TR-3Qd&&7g
z(?YF4|7dqUkgcn4`ky%cx`F-{&Yx_(ebYZf&Ig(n)(Q0MyYqo;9e&eq;QVh8=r4Bq
zy@UK#cjbSuFV8+&9)sUQJ;~P7XrSde!=1ln>-k%{;}6DuKQyq@)Y-|_!MH;0^!f?)
zr(fVt!?DQkC*ICb_2&|I9i2TVYgZ<ft5*;^+4};_p9b!@{8?b<SLaXmJnS8M#xu?x
zulEo9xz*YEGO*Ll`I9|AYb$B?bmtY>`v}aR8Sc3MO<-r1^Cx?L_F}#6d(oW_WbZF9
zJ6E29`{3Dg({lK8;SqP7eahQktmU@U9cKpx`D)<oWY0~@<-7|!y7Pf&13Pov@i%)v
zg8B1@JI*fh`fW7bh3+_eRFLjj?l}8;pg+YOXS4SynEgIdKbsaR`uf~S?N|IA^(TAJ
zg6Y31^{{E7N}xZ()wk^Z3#LE5PU(4-4TP5!*3`X`B)v4<?RP=D$lmKQK>5x)V!xc|
z^E+3|^Q8Nrf3oMFsAq@V37);j!LBe*-Wus<?{U~p?M&SgJbRCW@t2)`_8tf0E1iD!
z9tY$5wu7DQJr2e%Yzv;f$HDmbj%V+2Fy3z~=x6V7Fh0-m>^%;~TR1yc`f@P7q$BKP
z?{P5R*zs!v{ZWoj3HU=hz)toa2eY$o2k`7Y4#r<>51zfp!T1RhDJx{}aWKBgHsG^@
zbRTi$nZ3us^gr7I`u7I<)15!rdmK!Ez_!qTD9}%~2hZN)VES{MKiPX6jJI~>V6(B3
z#Q3Mqe)b**;}<&nHcFJ~cX8#Dy~n}y8@l?Iy~n|LH&@@X_c$1T|7O(lSAD)-)%yJ4
z4Di=IxAB}8_5jb`<8YU@uk#0izwPyH+~Znj|6R{psQynqp`X34!T5r0!Iyab<5a)u
zcHr6j8oDcQdH{I#zJ>>t@6!qG{c~@phH^|5ty9R}*U(6L3#XsGuc4#z^aJQ;?`!y8
z`OFcp|BbgVw*y>w^mgcH?`x>1<$2Kk;Mw~cx~l%0uAf=v?HGTf2lRjT{A$%7?Dk9c
zz6QyT3tzkbZH3o=T92D2MaJ2#>;?aS^ZK``ofjJ*-RwOMBbC4H^lh|W=8r1B&!wCC
zeprT8T{t*$9n{CwlS*FS>PatGAF}s5*a`W5l5Xw7HvV{IKkRfV{H$(Y6G_g6yDu(%
z{q@{+(68zB&sF^s_W{q|@6bf~e#d~@EW#vdrF=yjlv_P-=N8?+yWCVd-Sb*Qe_gMC
ziR!Nt(ck(Kq}#yjTfPQd3*OLk^FNhw%Q}ViJvaXkJRE!j&&~e>o&QZe|5*L$6!B-)
z=J3Cn*MC#>Yee*KISlEx@cOoYAF2eNy+1;#nF}@De&5LJS5-b-u8ZpwHu1cx@|QP*
zKbv{pL3szqTYJ8V@(-)SPWJwYBb3j%vGo4>SRANR*vi|PqWUjH^!Ic2+j)JnzdWMf
z&)MI`>zn<jKSH|OdTtF9BQ13b+j%ahJub|B0epMU^)fLzW)XM?&+DrG<ClYX^n7E@
z*BY+=ck<lIZGd!`rJg6caR}_}<n^uJ>+byT>iJP>zxHd;@9z0@<qv-d-ota#AN4Bu
zE}oly_a)%j`zEY>c5wQ;d3`xty70;?(BIv2E1#9Fe0qC6S@q9${Yf9sC#au0Uk^Kb
zdOlJ4Rjz;N>v?zO=elyp-Zx?OzYu9J{apF<_jYztJHNZ~+0S#c^G2jzJ>kk>fY&!W
zBV2!Spyy-M{_Czk8R+@B%C9{f`8~vQ>o<O?1U|^~(OPatMe=o0#LvDF{U#CqVZ_c^
z5&cOK{o5maRD|E_`k%vneq}hwh5D{Pw5K1EL{8^i814F>qrASHcDhiu2Ffja??$a6
zPQHqyyOC7XI)!7s9ovsryMAV<=Vs^eh@GokKQqkho1Mx_V1KyhZPcIH(w~@3MNU+6
zcCz<(Nb`4Lh3kJtcsn+Z{p81`?cD9!-Kk!GtlDWQ4Zlv|bkD7xZ`>69{F$EDR{hbA
zpB3;~n?Qf0=hogQbcOv<o>x{oE$V`w?YZ?Q>&l5%ox*6(*HZm{a-gYGILC9dv+XqS
zF`gf$`g1M;&)(}XM){e8!EH1mNk%FEyb=7r(A%*q)rUuxF3;y8<vdwVIO`NH@^<VF
z=-m-JH%IpSog2f>cyDKCt<U#&f&bZiLx!vWvm$nIBrR31wv`=Sr*OHqZ{^?cD)0%O
zKce=}lmaYeXV~`8zryRwR~M=u2|melt5<I}M!v50{4~{{Ss(n`fLC($YKrGpuad5?
zKh<;d|2&tk8v;Jm<!hSf>u9?3oc}j@ZuROwIgzMS$le=b{{Q0k?=4>6{GYcD{GS={
zn_7V1?z#Ej$nD2FJU9QZl7?2NFe~62%K@=YVYcVy|0~;p-{raaKgpH<-JYBOFE)Wc
z_j-PT)~nyv1E1r$<!e7z{ttO>{_oNi>CW}s{C~}r|Ga=d>B|3M&&~g8u3bOsx%vOK
zEC0tlH~;r{<-EXi^S^on`2VEm=KpW5{GamN{6E5#|I?nE|DU<?e<t8(yYhe5bMwE6
zt3S_sZvGEw2!CGie6-fLI%|V340zv`;4gb_eqJC4jyi=`JU2golg3!5uqfbfIX_?Z
z+^(;8aP{PM&!ziyq09P6_YKcC(E89|U2r@FTnv{fuf8GpTb`Sr?{<YhZ+mWjp5XfV
zcLIKqoXFKFyzBYtYJZBW5AS(yer_v{)hWF1xs~V9ZohvJ@W-5=A9-$m9^Vb=F7e#_
zti3jP_WlmzJ6{3*iPyLCY`+8eQqRrL(e60%ndd)g`EBj`jn6%oZqS9xH$uL?@Z9`d
z+8y?@_ji~-Q|p0$<@JqMn*{!~=gTzR2V@{c#z{Q4cGT4Q`K{-FsQ#<2erE6QFh5Ui
z1wX&{`sQaP=jRWen?JK$dHxvim99LOd2W6#bmjSz=jP{7cf9!7bD1XRLKk<uSnj!;
zHn{MuE6-m%H$S)98RhV+=jP{kt~^%+{18{3D?OKH<wE5hVdpo`&CeRn&)+>iU-cKe
zcJznm=I86KJpJRViTT;bm1l)Y`g1?Q;}2J!_B1xu&Mk(1SHhpv>zkkJyZv6#bMy0X
z*Z)`Y-0J5<*Z)`c-1htK?mVQ5=jP{Gt~{%HZvO1F4*aPW@VTx$t9x$yy{{|JH9R*z
z3(ik_>L^L9es1afT+{2DpY7a!&)(l*eol7fS<~yApMBhZuNClFt~|5%cbK0?yYj5#
z_07+RT|Zyf^U=CrPH^pLoq*rw`gwaQH}U&@q3h?@^ZMpz4|hCj81StoqMWn$aag}J
z#`W{r`#7v$y4m&f+50%m&(mG~Z0hYBKh*V~%{;gAY~Bs&Huv28e8lzhEdu_j^RuPr
z=I3XwpKs;4`FXAD=Qr}){CUCk^P2>`p=(E*d2W8r=>|Wu_i>n?2e@`*s|#f9XsYX%
z+ITzW=P1`NZRxrBdD3v$-^z2V4;4-XZx`@~oPPE`4%6@M^tTQ4Pn!li+k3vD)~gDR
z@8EfB<&*b@e)c|&mdYPK8oaaD-&}dSJ;A$pZu*Z60`KOz>A&vU_0FDK<Z{P**w@55
zy6Kz3PEXG*GSKl|?5o%R!u12YdOlA5yxH;H0$#HR?DzKE%5$OXm-={a<D8#K#V9N6
z<@q&gf9ROf*EN?r`~AGWR2vuea(r*k?YjFncfHx)a~sFoFJk{;8J8$^J=Iv|tIIsw
z%9>mv!x}F1apULN`#7ZexbT(?2-GPY=+m|R^@G@vaU{>TQvJn~!4LPmtMc~_10U?U
z**UTsj{8S>ZuM~SEzm#O^K;eC6^;+_e3qr#6#B<_-d%ak=cF78`h~<3r<N|C3C>RT
zehstpaC6u{F|dEU<EI3C({|85BjAhMf{zOLPiujX@%$k5b%*|?{k+5JpBLzVBICWK
z_Is_}VE_C;|EXT!7Y2OpF5njhe7NJ|1HSLZ(9hm$VE)&3{PIBm>BZ2W==lkn-}dgl
zTlPKz>DF90U=QeD<@Kv7UvC)d&o!Pe*P2~@DeCzY&s%B-ef>b_-{ASr+JF!H6#6%N
zZu-NW{aZX=U+w(j?9BAsdcdVJu|d}B@O+@^pYZ|wpY3^9ZFfHm#(asLEj!6z&DTA$
zALY8+>&xkZ3+<hq`#fJu?Tpw5c6RZ0#;X2Kd%?~euir%ZVrgh{eeHP<Z6oa+pYOT7
zFJ=5<=r8cx_SX|9qdcGV-1gUxeW3r8=Q5n`LiZO-*UvAHK)Ge>$DX752Sxg^J;idV
zdVc)gu#>Gfdx6?Hzc2iG%lmVR^0yAhet*~VQOfT+3VgBW*8jJc<6T+dqkw;QGWaK+
zo1NMxfqxe8%|?J{>*1UIeop@zuWx*q)Bir;S3CV>0dH^w>@WA+{2Af=U*Wmg|K8;{
zTMys(HnOA33Kg_fNf~PSOmyur_1p}8dK~mCdv5yUj|Z<7@Ewl@&(^~?{hjv%uj%#8
z{&miuI-Z+;m3^UK&vVn?eJFUg9=_?%a`v<J@Z~hah3BPW$o}$nR%*MbEEQYkOMBi}
z^)KHDys77M8sNhD&A_vD^39*4TY|Ur`qp4y-5NYwC*OEK>7UCA**f{gzuyErTPNT6
zcxe=}9$H}kmfgX#b@ENWw)1mKuWx>S-vat=JvaRWoS)e``Nluk75dpa`Nq$5er^}o
zY3TgS*2y>hcFxa^f&OuB|90}+_SY!4zp{0eZGYY8_InqvZ~JR{EBM*nbK76nmx1^6
z+{)oBR}R_w`R3;ra(pi<Wb5Y}Kf#qlZ*RwVEmsbE1pM}zu(Mad|0Bn1nV%W(4V|C+
zcy4}Hc7E>bxutu8^D|pN-}oQ9!2SV&{^X6pv-R^$e_QA0!GZo>&d);w{=VB^hj}jD
zf(t*nejr;vU%E{fZgTxVwtl|x1Bbz%Z2f%W*UNcPS>gD={#vg88Sc61-|za*lRdY7
z;Qf<e=hT1?k{`<Rj{zSi*HiL*Wx(Ga06yAt>3&`K$)$U)=az17r+>cZrr+45JI-^{
zpXl_*dv5yEoc?8=n|?K?Khbm3f7bb*t)FlDFARhK+4}j$&vfN^owsAWrQ45F1OA#E
z=;b-bfd6zfc(#7N+4*%4c(#7N@%5aYZ2f%WjSq)@wtl|x&E-0!tdOl&-(Aap%frB*
z@cy(?K6p&&^M|c(D$O^E@CTkLt>57J()`4Toh4mx{#K)kx|ir_T{775S^>Yw@wEfK
zvE%gv-lIF_S#9WfMNMdHx&EqMXch2!PJg3--`@%P8wdQEe&Cw~{8VRW(}1tJ6ZAI=
z_<nL?T)VJ&z+1R^VjVoUe(5Xc&kg}Eb9Oog{4|&DjsfrDc&C8>;quiv;0MaY@7jf(
z0{*JwT>{?1@vZ^C(D~Ud;NLrcx(EDmr@wQ+S2(^)z}t<6pW{6rsQdjn$1e@|NXIV^
z_`2u7&cuLEI|Tg7fWLS+_*DTvSkCin7p@8TPv?SP8}J`py4MH1(|ORJ8t{%|z^4WL
zLZ^RYz|VL3HwS#F%hxRdzuEaeGvM_czdhhP9fJPHT3fc>NZ$j&<s?Xh9miig7(9F~
zd+0#$@cHXc9S@(IKFHaz*#TL)XUc_nspp`VJ03poJYyQJo5JUs@4X&8e2(dq9dSKq
zvm26Ru6AS}-v|A09{!{|!NYm@jc0(rs#niR@~YZ-=>YI>e)9Tq94R$Vc(n8nrRE9$
z;p~L-gzJ3>JK=obw@!tfa6a&Nw?jXi5B${q;Ng7WYIlJz^ZDwk`+u7AC%m3|{xaxS
z_Z3JETQ0mm6}+bB=PG|*>RYM#uHRe=-oWddolB;GH}u@>yf5{$)V$NH_5=_89O?8!
z{@vx!@96Ez>7@(DIzKykE~m#XRCM}%JfEPv_YJVKr{@!uS2z?r94Be%%I!d}Z~0AJ
zxefH(@>^Hxf2nbjT6=?s`MUn#(mb6G9?loq-}w{H7ut3p^uuw9>itUFpXKyJe}?Z>
zTECmiSEzqc#QuhneEkx!|479C+WVLGXDheALVwPW=+B7g?;g=VCZhj%ME}Ex{&sFZ
zhWAHan}&Ra_ebiv`W)UL+0eC%@IJ^yS0BRh{9|4H49DTy?Sphf`;#K+-tXFbI6l9@
z6xa#J=O1_NI`s3_i2t8_06XFM?J(C*hU2#<x&AF2zdhwc*a^o)XP<`tHhj)*N2ec-
zf9~M)AGE`0vPOks2XVjiGaR?9?)(hLEqgjY!*NSB=k6!rX{MEb6oVy*4u$zz#pIp-
z4ASpHd?xY1#PRf#**}l??Zp2se`L7D1^CbYoJE}dxsf>gb2{;R$<MLM3nK3$Zv8s=
z{lw+=jthBxxy&lbUn1U_?7XcU`NGp)R-RIQTrm6Cj?i8U6yMo@Ijwd9`VWwu10(#b
z2$$1aZ-@P~=SA{<UP<~$*Zgb>M<n3;gXGT+#JRrh9^vN_$5U@sJ{J<7OI(I?TtK?>
zh;zNgQ*vf!O?4OoYjGPtgE-sQ?7DnCO8PSF>H>cD81XBJKTdq28iGD^Tk$W?ucG|o
zsXg<viNq10{{-=~03<+gIbRatHp2&-WBJ8XftK#SA-_+NKmSC2@wDT=DZkH>KmSC2
zpC|kOhW+~j`SVZY7f+}DoA&QZ<j+5mUp#gDZ_4i?^5>t(?`veg4?05$=-==(v6aIx
zM~j^MVHs|50s72;j_^s;Kfgitn@b!4b}$-X>5c-B0Kxt9Wf5*ODzQ1%KjW!qv;S|%
z?>pqrKat<}$o{_}zweVje^-8cppr<ye&_SOzK$jdsvV!N4kXU!t0xj?{mBtNjX0kN
z$}o}(@Q2S=?@@04Xf;m0BmM!E&+;5!N59K(vJ3b<w>w*zHqULOG0$y<9B@8gx?6le
z$m@Tt9RBwsKkdnM@V>+=!hi(uGWl4$vnRN*8LJ8yKV0=8xV@ho;hz%c^In_Tp7+yc
zp5td9QMv`a@PmFc`ItX8Lm2u?NWUKGbAD}xZ9ZL_F$+5%lbub}4mkH$Enz?c1lI>!
zaW~H=Iql;9`h@J?LHtwV^N6$l65{L+{6om+OKu~(0M6x5pE%c(^_9aOmwzkLZzgdo
z|F)#h<-a}YbGkbb=X7@_J6!&&bDfJ-Da@Y<WS{#DzRqQRzRqR-SFUqm$M(nST<3m4
z{_}M%bH2`H{#UMZVaNRB>s+kbVdeQxU+2m&p$qV1b*^(aQ->k=I(HCpZWr1OyL_T=
zw0sROChIuvG8q56u5+(MgOdQaz9svOC5`~j*SWWm|J<+IlXuw6+@3rFkLCA!O84K8
z->1l*e<Hs>lKp=}exD_O{)znlME3s;`Q_`}e<Huj|7H2*>)d}LzrX&=^1F!q`6u$b
zlI-(!5YAn#fBw6!bGd*1o$NQ0I0E`rzRtBLyYv0<BLEWe{7d4o{uw{AeEl2p`wo@E
zKapQd%lJ3tm#=gGuKcdfbuOQ04s^Arc;3$Et9+fy`h1<sd>YyLv)8$NzWTp)o!f)j
z9iK1#Z(ZkJPVJY^yQW9@OT_s)*Pg`BUzgdF^7t8FXIZ}i{bus9_F_*)L!Ym+{?K%x
z&(~R%>H3$iv(}*NS-#G)>t&eZ{;G+d$3pORZvP11RP+#F=U(bhwsEvr&w1RY3vsUh
z{fV=_Oh0!4$ul2W#P0f+>;DDH;SZ1VTuS<|qs5p!L7emZT#h%=@9z@l`;|XOxIE_W
z0{mzF4T!V<@))!WdH-eEITy^1`TsEKb3J^VIPc$kBm2?j4Z$w&$E}OWx^m|7--$Ty
zN0~<90+M0<5fN_p!J*IPaK7s2%i)ro9V>?g#CbnHo8vZK_ix*ex6}UO{dgB~-jA!(
z?)Z4II_-}2x!o}zN#)7=YjxTkA9wyryW{Z?Zg<SN-7)_w?GARVzWv#DH~TNNJ1+m#
zX?Lv8?T-0hX?MII|4O^#{qn!HAOCE-8=&<c^?>`yBdA?)KYs#o?kC3*XMG;GWImhp
zx!pae9RBd}?orZ*9jmubP=CVbIZKIi|ML}b?tjFj3#iuJ<YVV8Rg2iAS6LD@{*ZF$
z^Z5yn$MX5iCuFAz+1ZQy;qpI;cvaHBlXx}auPe{{^A73rdD<7G-%Nb7eDQr%K2Q6d
z^f_OZkf4Noy4977i{<V|tW7*t{<sD)f4KbDp#1)~{B=IzKT!U$`j0tUwqLHnPM471
z@3$7Q<6KXkRF3+<^<S2scLAL1zdV-hIoJP7iF5tGpXw*KM|++C_PPE)OZr^@tsOz1
z>;HSC&-wb8IH&u$a@gVPlpl%z+4_&!`~NNf^4E#~MEUoYeP-p%{SWRb8(%N7-|cz_
z?Skt`H`?!9|A$BH$YWJ5<n2t0*ooEuCnI(ilbt%0uVtjq^|>PTGn_Ab^DpW-+nJ^M
z;Cx@~5#l`m)81eReeMT-CjGkPXInjBL!bMBuEhEN+FlWUu5u*9`Mr?zx!;&V`px7w
zRv$3u83F!qzhUD)u+Qa&xwr`Vbm21s>~Oz<v3i8O{%fSqe&V;L-%KLrr#*R;_Y?Of
zOrQPygE*Iu&AZ6^Sqnfy-p_i<A=uC6q|bh~A$=}STPZzXp7z90KHV;4hs(1!rOWy1
zOZx2Rk)+Rlo=E!a=jo)+<!LJk=lvW@cG%BJ#AC+`c@)F%U+%9^=C<EuxiS~>>B@3t
zp0l4ej~&T#e{}-sbGe;OobBA8Ja6Yd(q}t%KA+#ecKn4M?q`08*eSq(guI;%l;`c-
zMx6UAdr}hm++W$7{=n~*He%&$Z}0@?{%Q+tN8sFF;o1iQocpUj5k6Wu+~sl`OZr@I
zCzF0N`HlIBYb6Av%k_2^>GOWX*cU=RU0hoszz)~j=OX&nk3paPTul1SWSjYkxf}?2
zKYt*7_7nFU5%PXoKbH3s*A%7ntsl$#xdG|3pPML$;PTv(^x4mCiSvH6ehizrJa>uc
zTR(=)T%L!LKKpr`atQX*R&+<Xv7h$*MZP@GCOhosrNp_v+EVNy<n44W;-H=48V~{c
zW%9B5Ade5afMmE|T1cGR<2%Y>hsST166bM@--xq*W9ny^w;;~r81kAI7vLw4V{A?O
zu%pG5yh8fiKm10V$1(VPjO$M|WK;s|a($?;9D?gZbJFMfunFmNeb|yXr@IZ=;rh^-
zIM;_sa8d&N<oSVjI$GrG%0}Do^NF+mXT;h5)x>8?Ih!3Dr$xGWy4kqxcW@p@viCfI
zvweQPiR;@SO&8hb@xY<PxxS4d&iXe+xXt^8eXei!t3LeX`u1?n4z?rkbuQ=k*GPT)
zgE*Ii6s-&JCpK=-ND{Sj=KB|1f8HWHT;EnIhu_@ZPa%J}{I4gzKBfC6@y5hgXZ(uW
zQ3I{d5ZsPhD2Jcijy5HI&evANxg6S)9d1WE5s#HW`b;ZlJ`Zd{`TcMC7st*1iSm!t
z|1v87nX-=%useCb+qgG4*AqK_p<Z$Q-<Rq$*Z;GKbNzpSIM@Hx89(9r|BKpzpIrZ~
z9p&qP4XwBNeAOk+<zUAt*x~xm;|zbc{^J_c+Qom%zgYkOiSmz)o3*6!uSfNV_j_~V
zT>oV`78g(-xc(nU`fTS+;%w)-h#k8hjq1pD9*x*}o9ys)=(nWLcI>#Bum9_7{YSpo
zj@?%U=j+h<q|eu(uM@wQ&U2O%-;m0`tsbyppZkHX#Q8e(zvE`b_VV9xvtl{e^(Lwp
z*Yp3M#?3aO_9CxMa3P=HX2iLl*^&AO?yrs|eJ-~%h_jt*BX;cmZ{DBz5j%X|%l*vP
zq|g4?^(O4IKkETVK)=CuZYR$D)jZ<dUo9fe{naw!++Xpy8TVJX_CbI@++Y27+^pD6
z|2uA0EQkN=<7QjAS{`06>_nW~X;0#161Vf-LzSbwaKH31ac+-1kDBLM**FQBE01H;
zq5g#R?fyRWnQuq>JdVNl9e5mLSJLPCT6X<{d~yF!6A4NH=W(-jltXa8*O2u2dS_$O
zZzjL7^4yyA`Fh`;H^gS%FI~wFr`wb4@b%7K#QA#XWwDEZeDS!Jymr6^a30Tji8!yn
z^cr!DU0c5R{Fc+*sc7C^xAOR>tp^2nxjtBZ184nnB6cn$&h=rUa^#Ea!(`Iuaa0~h
z;`wGjl0I|39%0^y>KpshlFE(!vG<}NzdSz;W0eT`{bDOLf^+?>2_ON2%fG9m#eRUx
zvk!4D|HFv0zO7%F-!B)DKIivJ<?x5|dmZU>`M*h=%kzf_Z$RbD`b~(lKl1u77xMmW
zLHb<&{gF`#5Zvw#CC=^iDCMxfsr<8cVe4Pz?eO|n+;3b%_PO7<f$Vd?aSQ3QKXyHs
zPuJ$X!%yxv-X=So-%p6M{jZe64xUZ6{8rL>n@_ho)o0G{dZf?!ZA$u_-&Um0{@4n!
z`E=Wo9nSB=mBeug@Spp=bt*gTIJYl*g9G%reRVFXyL!UMsojWk`#OX;>yM6bn@^5>
zaebbk`tXO_7tgQb<J}^%&-V+yj&OOsj0;GY_17WJ{#d)q`?DeG!w$A1q#A+X^2a$m
z0tA;o+7to=mwy*Wi|v%l6JtsU@Sn?nkfWjgm<S(7ob$`i%X9f(OZr^?ZxHA5{650#
z=E}|57tbGKe{38K<-`7LlCz`5nEcuP?PwIF1pJ=+xAT-kaKAB*^truHCjDme8_U-;
z(&zSmE9rB4zmqtpdmq{1_Wngg|0m*X|97&({o6WHhY_%u(`~36<-_^ig!DPTTarHK
zcU#hDe>xH8bi0uq&hK}T{>|Q~0zbKZZBP9kx33*U4*~l3N?NwR_<DiQ6J)tx7f?Rj
z?v5hP`h5Pz{4&z#dT!@$@Q3U9G}4D1Y)AM`BM_WldqXQY=eIR}BmsPL`DgjH{yeY0
zztax&+Y#q->#Q8*!}&G)`EolXqCYyq|H|=#%WYllH;`Y<Ika-HbyvW-JTD}DF3)c2
zXWq{L_42Xjs`B}=`M3G<85=2|?ve6oL!9eR2j%(t!}DIa-5n6oKQqGlILPg8Jo&@z
z&W?lT5Auy**G>42xtCUd<n<IT<jbc!ajrk>7u8*REN6!}mk+liZeKR<BHzA_RXgUt
z`DyvhbIvc9&lK{9%jf2teJh_DnqSyINj{ctPbvp)cMBt&=gDySoB_iUkluDw{*Mx8
z{WYbHBS4=ykBc&28PSIh0>t)|?l9uquU<u*?c4L?*vz~w9oLxKn=bSEuSE3i4OY<S
za=x67gWSK_n~b2(^;5pOfMPvSJ}saiL4`X{0Jk^8+58IAZ=~tfaK9>^S3tjs@>)4=
zZ+crh$L)=7^>f_b+}0?^?G0^Ba@^j;);!1UjccuP+}^Ba&*56W><wzxj~VZ(`D&Z9
z(?fat9Pg!^`#qFTALX5L`hAsm&GG)qxu1lc0m^&j^am>EaT4ecQr<VGZ*LmwpW{PR
ze?X28RX#As?TuoCa(sm956<z^l@G~rdvn;(9IuTXAz^q?`1*N~_AeuH+};p&dXD3o
z4Pm7FpViw5>d!ejzMx_ejLq@Msy{Bru~s$0B}L)=TwB}ogdCrtb|&TcZOSL-_-y4<
za=e$OJ3YtesQ!!`pR4?~9G|azc8)Jleov0uJm5JwewyZYZjRgi)cHBSNbN7k@i&w|
zmE-Rye=f)G(Q;Ur<4-AHl;ca)&Ko)YrSf-j{9EOVbNol;OLBa<@})VxQu&uTo>VD<
zZ*%-ot^Ysf_?pU>=lIoHZ&&7cD=mkFj^pSbHdS6R$L&pNRdc+N`pM@5uw(NAYvuHt
zt3KafhQ76TJ1@2V*4~K5<I>P?qjqfE#`LRbeY5cd<Ks17{M-lZ*qhQe&G~6>#^v=o
zpl@#`Yn#)@F&LqJj`vbOJLLGys^2Nc`>MX(4>JGzEANrhudG~N`{sh_@1pgpPmUj_
zJa%6Czr_zPy6?_A_<ZK?@@Ge~&*$5_Do45T_}f0j`Fdmsan`>m!nvR4^KHA2fab~P
z+c)OyX!A`{t=IU@=XF(y^Lbr8vU8rqYv}i;Id13e?UciQcll>rUT5S2INRrO1J-9d
zT+W@<PQIM^dWXyTkcj^12>&bN20YHm;|7>ZVCC>v#tqoc|Ml{*{u%Xw^YvH84cJZ_
z-M_HU^`}E*zxN={_2&TM+)jDifcY5G=XPq>(eQ`cDPKo({juXR^l^@3_2;jQ8?c?7
z)X#kR@cn4c*M5{QE}!Fwv;HL!Zudjcez|<6s(!wF_&k%#XH7aDVT{zuXBXwL!}a0i
z2)B6!(C6|Q1qUU7?<xPx{zb|m_LO#AA4(GJy*9?JpS&@rZ+2c*o=<lJJ)Y<JPRj8!
zl&#s{J;%-dkcgctNgs1lP2bKtV4wT>CrKaN^f!is67qf?PJAzko4$>Ez&_SqGyl(2
zedDG-lkD(u;br2yzv|HOi}}z9=lh<lUt7;>kPP!l#JOJCbq4hLc={&k^YKp9TtI%&
zC-A&aY%p$b9Ipx}!MMFy+{(|my+OQIQQhkws(!4U<3}jB`fGOVjo^)P`gXq8B*#xs
zJI!<4-u&Gv$4^uJO>_J#<<@VTKckhm&FP<~ynT*esGR$Gl(W6byHifz#<{xY_?2ph
zj|;GKjq+YO{p*$Y$?<8*`{ua4nY(|E&s6;ZIX+AIz#P9@`Jf!XU-{r1e@OX|9DhXl
z&>Xkt9ERuk#oC{a$Z@;gIX%bGHV{U-|5<&0MbkYe$A73;1Y>jjZPg!_<G9y|a7j`4
z`oEjD{|Pz%soI&8<6kJBoa5gppOWJTXu8vL{Abmlk>e|r-<IQlD4(6<sa}`eljA+K
zeCFi%y_(;-Ievob&(HC?YJWkFudDp29B-)nxg59S#KIhZOUq|bj@z5j-^g)$qxm~I
z-dfXLoa0+5Uy|e7C|{c6+bjPv$L$T}-{$z`=!hizSQNfqt)+Z<j{ir?d1a2<{cj#8
zL4RWNb$FZvd>{3b$4S8VSI*-k;PyTe9wz}mRP}kB1bm*>H#-lv{`P3q=W!C~AE%th
zNx<7_edBQw@XK|-^Ee6kX=;bZNx-Wq=W!D7(aL$81RQhX5qO*g{6f{|aT4&Es?Xyj
z;P&Qq9wz~}H>~qG3Al~h@Hh$h7%fj8CjqzqoW~#dyyAb0A1=Njpt|z;%-`kD4$gYf
zK3{+RUzsoQn6__}51-flhd7_t4WRrElpoo7to3`a!}@(9`nEn~UcV#hb9wHf9B%RT
z*WSeWdhKZ9tk1_&=9iN`U$0%O9Defk>~zxS>$R~|Zd{&rJ(bVz9%O%zY_#%xk~o*=
z!Nj@zM-u0C5A3=d=^jS*Z;I&KylCk2Jn;8PpZ)1e9DR@ZKb-hQl&+oU<n900PVqUE
z|CUd&9R6(mIfm*R*Fzke5K!N^9!_(#$hn@+AkNP_{9m{KceSto>*erI`@fUc9~=f|
zQ@_XM&&Rcaq|fu0h7jlD+9=|zKQqGbBF@LPN0g&o@NvzKJMf?92io~3^zWp6-9qDy
z{9LEaJA$2W<YUK$=K&<Z&Rt~ZBjWs=roHD8`g}aKb-lp3{Vvz@UvPe&^f%&s{Nm@K
z?k0c6X};hV@5htWPYBHAwtQiYAcVX=&tt!b?B5d6zh5~7>pxAL%lRwi8;d@do4x-L
zn^}Jwy^hK2U!d0$(C7Yh3UTf~XA|f7{O7GH1|;O|Tuq$q+)AA79KTl4PQE<PQx5xF
zK5Nu0>gV&@T6sRd$J8!u|1{-!`xg=C@|>YOZ~r>Ip$I#iuXLTvPv(syykms#8{tEU
zbNxS_IJcLRBK$Ps++K>_7wh?V@@2HP2jmk0U%@L?#<wJ?S`?mNt@W=)jxSMOE643Q
zC{4!IEB4>6zw-5@x7vYU+~3-LSm<;Ac?6}){q5<*S>LV;@^+?^KKHkGD2G4X-`-35
z+~3-BG|=b%b|m$;=qs%M;dSBW5MQ7L2Rqz<K24nWZ-MM{KVai0u*2=w*0lrY`g{)A
zXFGQgzm2XJ-X#72`Tsd_w!b#@=Ug8eM0jK3oZn93Hv*D*kkaktXpwV$IG8x=pB>@n
z6X*J1*PAFet`Ap}KI~&V!nC4rem+Eg&LYl!E+EeOA4m9?#M#fEl*149^Ec9meQZbI
zb?|t9alK{!4AnR0D<homV{(1w=c9T5?o@Qkl^Y+&SLb|;#|KvDe2n$^e2n>DIUnP3
z20kBqSPI|zf!S1Ue4Khs+Y!V!@-h7nm1F<$`53PY#OD=DsU30oe?^?zBi_x50Q-DA
z`k6TIuXD(MymQd}yhAzM<^5>Se}VrhAJgxL1SRD4k5LZ6=MT?D^xur=e?gqf+1^K%
zKOfjrk8k)H>z|}NuYa)~KlA=iR}MSu{~CHg&D(FSJa2zc<os$_<oxO!;_UzR%JcSL
z(ep0&GhhDMe%Y_C014pS-e*Vne<FNIgs+J3wbpjY2KBHmaju6&?PC4;MZP?a9U%dJ
zBj77|gA(UC;CJYL)#CU1%a!wa4)m=Z+Pu5`e&0iM5Rg8f&m7=r(I4(-jwH^<h1h(a
z>q(#O+(ev@3$vBOA3iSF`l9fk`zyOY0)6hUzM%F#Up87j;pbc)BhJTn?tfy(_lL<(
zw*LdA%jYLeXg~A$iJgbS|HsK6UZ;r9i>gxp#`U}{aqcJWIZ)W=de}+*hg+CaZ{^dA
zIPc$siL?IM5&l=sPhcPZB1|g^SI?gyKUe4cg!Mm;*!hw;*TdC0KY@Mo^WS!UvYY11
z`6qSK_V0m|-+oeOj2}aspBElZ{11tnK948Yq5U#l^^q?3=SzumKl8J4)I+`ws;un@
zoa<pz;;g@Wg!d!P`}Yv#@RR$QBT1jHn+|{@5}=QJ)K(7FsNHdXM-hLD^lv22>ujS;
z5MZCri_q60fOC7daiP3^O8^OZK7cseIXS||6X*VL0&za?x<)yQiR;xA(&y*dXOVt0
z`Hht)&iN4__<45p)d;Z9_0z_$^69=ncKCUAejbqf!wa1CqJ6IC*C~fNq-B0`|Ic=8
zJ`D8ve%T#l=NYmyk2vcuA<p)<RgV1fbz(Q-++KLzDeIp``pnNJ&h2HKa^#EK%jKlc
z*Oilr^L3)#2Z8_Wr<DUZ>%SMV!~Hq?iE9vqyr0&en|*9Y7()F3w+mjcm^r^!i}}_t
zECF`8y=+gM_v5WjyI9{acg5;e71HP9{ycRUg1MS;?IIOBXDG1z!5sKQ%6Z%j{A=ZW
zJ_&B?Qt|mDxV=B1Bc;RrxgB?qF89xNe;=Ip`^jo2uRk@yx&H8ex9eZzo9pKTIXhM^
zcS&9l@SXefBjAVxaPH5)CC>dhj~8)&-kkbv?$3J?=lXL^gyUQh0sgQ)d_w@|`t}%c
z?w{>BNa%AtwC8TX6Dbp`hrGYIKj--m+z$`K?<Js^xc@xY(W0Mxo?z$yNSDibb<Pv`
zI%0Ls6Ih?m6PW+m^Mqry{vf}w<H}Fse4g;UKr7EbsQz$%Yex3hsl;(CGdtH3=k*40
z&W`{;xW0Wzoa;|*bvUmNn+SQ{mpI!wF2c_v&h_(R<tPrWSC^AMpC{Zv`px7wRt|TN
zKA$JtOZr?t=Mv|1A0<0{o?zoP*v##PkH35!v^vLM*5~6d^Rp#A1e6c=Z>w|s<?ALs
z{_=GY_n+Jk^YNGU`S{EHuN;5*y6J!G_&e5>a<QDNQNQ<Ygx9C`%g0|^HyE4Q&g)dK
zSYOS%{foJ&cK)R5o-a_vs^ky!OC7JlZN4cVufaRY2Vr%N*W4d+|IhV=kJqd}wU~_a
zpE=hzuFtD;yykxO9?b{JiTl+fX}@s4%ExQ&KkHI|$o*$C;@p4sAkO{X)e(*{9|ZWx
z`shOtz_~wslsF%+Z9X{kx&PtuIv!s-9>yg=pX=KgM~j@tg^nW5cDSEmJ5xxX?c7M5
z=QZi>a{k;Td9;4J66rJ7;ohL!s;fSBGsevAJheV??$4VM=l*|l<tU%G<e&Mo19A4J
zE7@WDHvblO_&8<vec&g2F#7`~jsSf=PVs$V_VZY$UF?@Q-4m3<4j-rf>GIi{(&h5$
zMx5(;FXbo)_Mhu5mmBvpTyBHOK9}2ZWS`6JB;uT|9cT09_IK6K|6lFYrt<t)3eVb|
zowsBEo-6Iz!krp1ZuNf-@lVLkBgA3H^cN_{{`yq@8Gn}a&!co-%W>1^<M>iacS%J5
zOXW!SGfMXd(jQCd{+{EOZY8Y{D2LA}-5SJU$MoyucwM#2>vIkueIEaW9osJ(sU7%_
zdx&PAp9eXg{NJ9^1vmYjh<{1`_ax5xJnsD!rQ4tMFQ9Y}&2dZjDB@pJy2lfT9n(KW
zxu_=JP`WlB0OfxnrEBX7g7b0YGO`bSvwszF?oVbA=l*9FaoDl_a$k;{{fCvq|8L3v
zCrE!B`M)s7&5pfC5Bb6xm6q;%5&cgn-R~*guSowQN_TmVTe|#SAv|kn=~jj#5+Gp5
z^zC^sQB8iNbnB7+#guN795*`~5?@B?ZcZF_OrOW)uvVvWUMJtyq=DZ($PT#a_a^=`
zrMowA)<00Ws3yxP-NQ)#63Xw;9Jh2&CjJYhdnR$%G5s+)Zs!NKUJ*7!UvEz*lXCh^
zWIMui<?#Pk@_#1jUrPS-d<k&#XCCRVApdRt7&f#1tE3NZ_3Hf`H~)EEap*S@dkEjF
zKKx%v{{KRDE+hXdY8;!v&Hpus|3?1TA<p{iDMz}$Q@Tw_-=6Ig6~E3C(gnA4w<7&N
zDBbOdv%alwfOHc%$u>JS-U#~>^tVt!--Te@^!F!TLF`!hA3_{<O#dk5NVh=g9#8rc
zHIDR7&vCOenmE?jv2^X&0Y72K^ljfE-HMd%Rb=N1jU(OZIc|1l60bz*-bEaCO#eaU
zNEdT*jN5e_{Jc_iknVG22i){uA&#}OEWd9NXMG;W!&*aT=QGluq;aJCV~(5t3gXo$
z-GZw)#rgm{rqAz*s7~qH_#yIZWsY?5u2lr%W~UkPH7H$M2P3b)rRqb}pmet-J6BVF
zyXLs1yDRZEDcwDZ!;b0iryOD}O7~#WzlPEslH+E_o)<^HYErtVM)c2C4pEEJJ)iU^
zQ@VB^7WTm{-D^m{Hl@qssH}f0rHeH{%ns%TBf!3mIpaHzqk@}0=B^+>zb>Ww3~|<f
znbO5tjAjStW(crz9p!gPj+;KtbrGOnkJ81t4T9M*eH=rLLw`u|tLrn3BVB8cysp<e
z<R|v2>0eKNu9xGMZd2mxO5E(XA`UyI-<mk|&CjigL*MLlRF3S`m$=#KM*368&pyN(
zNZjn~Lmc{M=Ro3oK70&u98*kxIC0o9`?d}x_6yrToAgnJrhh(h*1uFa^4n12mhL3d
zpGx_imgA;>D{;=(1H?IB^NGX0`T3t5H~TLT$Fno0|0;3VG5vRyBVX%F+_*i*fO5Nm
z^7Reb0XO}hh&PtFrTZIk*0<*>knRSeV|Hp(79auXPNQ_!&2iIjOuPxD+k!akn0{O3
zNEdCy`1YjF`=t}<^Egs((r+fV%+CI#&*MmkkUsC<BZ+gm$C4c$e>*jzZ|m_OU+gE(
zzhytKCj0E?RI<;0+B&t^FYM>-WQYBHfb6jT!=%rCK2Q4WC$G!Iel8|`_S4ph$@^*R
zxuSg7&pPrQ0lXR22Og)zIh*a@1DtkIpU10typ+eQ%Tyo!G$;EuJ`B$HJGw;l2SqsF
zAMZ?lo~ZiB7tc>PJ!c2o5o|mS-&>HMYtZ%kT(ZykYDxO5lP}iid@=tk`GTFlBVRn9
zWOeez`kXK3e<feA^LOOybJ~xqlP}iid@=tk`GTFlBVQZ-$$H58oG<2oC10@fcjOD_
zY}Ws*&i-P3&KL8)k}uf#JMy*BpUfBQ|3CK52hQp#|Nny!vO)-9Xd)yt{hbIyGn7U~
zg^;~7%}mYI{4;ZFCPD}yw1ljdtk4qL)zXrc)vk86D`d4~g;-X|3hfHN^S<}I=RWV5
z`<eNC?!9B}_viDVJNJ3tpVxW6-=A~N=X}oRALAlVB`(oPM_fk)jEnY+i#(OML?<0_
z9T_k#+A}WlRN@kybi~ywU|h6kT;!?5B|7Pd>o)=WdD=5B@>Jpyopi+YVZgX(&$!4_
ziA!|S5!X=x>mltK7kMgiiB3A=>K!mH+A}WlRN@kybi^fdCPDVgv}au8sl+8Z>4+;k
zU|h6kT;!?5B|7Pdi`V)48As8cagnDIm*}J;t|yF0ka|da#zme=T%wbXxOn}ipY26^
z#zme=T%wbXxOn}opSWnxxX4q9OLWo^S5ClwgZ7MzJe9aaCmnJ12^bgc85emfafwbk
z;_4ePF4{9L@>Jpyopi({@7fE}AJU$2k*5-u=%gbqd3JA*xM<I~$Ww_+bkY%*oMQ?S
z7ws7rc`9*<PCDX}XOsnri}s9*Je9aaCmnI+28@gLjEg*#xI`x%aSaL>7ws7rc`9*<
zPCDW`CSY8&XI$i|#3ee(#?>=&wjz3d@LeOK=Na|-SkZkD^8-C`{(|Rgj>dI{V_>iM
zugH0sv%p6~XE5@47dXrPCG?Lo_Uh;Bu;=-#&ERrwUHgr1z^UI^95jo3oB;j4mP;O}
zUkIKDeZ8L0&07`p$083+;3uNoJD|^Umw=yya(@fXxK=}d2=qULJ@q>o-((U0^P#^t
zIQ4s2E^>0Mf^HYR{!MgFhR$&wI+MWZ&vfXY0)4&aQ}l;I|90rmPr1iI7V&c!bmSb6
zETVHNbe4lt=LP5tht3<YFNDrNz^U^EbWVd#2XVwK@-YHBKLV%D0hUW#r$a~X<&i}`
zilEaUoH}Ena|U!Sg8fM7Tm?P~d^R}sd417n=)Vp7God5bqRS#5XMxMLyRyg!^>;Eh
zvPd4zhQ8!P7O@`#opZs@0WSlm{uIkaU)I%nz6|!~nZLE4c@BIm_>17wf5&psKi~YV
z`iJBEzFfnj`n>KU1b#g1sju%z7X4!A-wOK@=;(C|lDBc-`aTCY|N1@+(ccUDD{)<c
z@GA4WEU%&5Qs}=0d)XG62ff}v^o1{osF-{}ryM%^K2O(AegCTH>;wJo_PMpn)zAKT
zp6z((>-$c{egbq(fsSzXQ{QJI{!~Dx1p3@w`W_FlXMd>A-Ia1HQSKwqnF#&gfK&e+
zaO!WdT=XYFe@A;GtN2p|{oTQ-pJ}=1R70mX>}#Nt3r?L=pi>K-DX_1D&c(3jIOKBJ
z^E#QIz<z=0leK-_3HuEuXyy09p5vKC9{f@8v!VY4IQ@Lua>+BVt9c&w@~#&3XD#e6
zKpx%z=k+ripi=;yPhn4;FTknuHFQpf&dxg-$IT-CQ)f4D>g;W~)RR-7(;fEI=?PAq
zT<}AXhZCSb6#9j*uZR5^;M5-j9l4iE^Ir~o`Z*DtIv058TmpOQTmep<nI8Ola9&>|
z+d~$~GwYju9Ak99iTcU=b7_A-L?ya?*^YWzF8XXod`~Oe(O}rK9S!l|r-HK`>3ykg
zTxVH(w;de<oh)p3Kl8@4FZ0kz<v33CbvylV{aEyUAKYFtR@ZjtXM53}+lxGv?Ik+t
z*j~Ku%THXiXI$i|#P!4VW6|x({*(2P*M0ffUbN@-B2Q&|iB3A|p<J&Oq<ztzagnDI
zm*}J;E?)QLXM53}agnDIm*}J;E?)QLCobAEF7j035}kC!#p}NO#6^3?MV?ArqLYre
zc-@zuxM<I~$Ww_+bkY&mhXMD?v}au8sl+8Z>4=NhrTE!iv}au8sl+8Z>4=NhrTB@9
z_Kb@>mAHPmz9qU{y~Z1IJxP%LGVQs&$Wz%~qGSGxEU6r)$ocLdanYV}k*5-u=%gbq
zo;UZ?zG%<5$Ww_+bkY$Q&zt*+i}s9*Je9aaCmnI|yt$vaXwSIFQ;AD-(h(QWoBN52
z_Kb@>mAFJF9dYrzxu3Xb&$!4_iA!{njcaerBk}zEm6nU{gBV}k4Zg4WQTxw#!FfJ?
zvYD%t#nqV)&hz+>f^)ucsRutQDj%6Yr2lIymvZS3pL4~y_&h6~-ye%|d7grC@%;X!
zu&4e{ESGsgp5NE^2Z^85e-1i4zt8IpsQ)SSd4B(EaGu{kP#iIfTkb$`p5NztPgw3K
zYcC%>zpu|Da`mr)e!i)<T7PZ^r@p@5M1JP^{l&27`TZxrsiV*TasAnB?d5~#_qQ{3
zUKX(*3O{!Rr+zofMQ50?*Yk!)!2VR|^aH2P5a<kt&Ka;TgpNLMNBpGDMCkDReiL+f
ze*bcC>c}&ZWRbXdeqWziA?5P?KHrN<9qph*=WN84F9K$fk1>erbntV)&jF|YB+Etr
zT<AXtd!8SE44mi3mxEJZpEn}<JU_mNDN7bvjpxS?0O$Gf!@#L8`zBdLpXbM?!k*{H
zXMpqk_*`)6KMnme%->o+*TJ6GSNsE<*H?TBPW>#LH|O;g$Km|=nPy#W??b`Q0v`)b
zeSLm{<YzBqul_foT;Y1&d?s{we*Z?;mqF)thcA$gVHSN(f^1)&-~Sc#>E{aQ>;wJ3
zI9&bwJ9Kz{|6SP2d3=rc6Njsx-$19r*lV6U;ygS3%m(LvrvT^QD^c!f*iVH1kHM*b
zIXLxigZ?Dw-v|3D=sy8Y{Xas7=l5TQJ<spI1x}q!(Bb+0199G&=l6Tyyfe>(_klgn
zpAH1)c;<NM@I3f%*i)wnoH}Pihv&h|U{9S&aO%`Shv&iddIqWg)Zz6E)VT@zJP&?5
z^m!iqKG^d-_=Dio{}pt29-P-L(9abfI=r5NIzg{zcpLhhKiNk*53@*r#c}CxBQ(0d
z;J8$LkVW#`i2Bd#RGYxdVK4g#ZSQs97lK~|F3(U>`>VjGf$Mlx{J9u>9_%jxzaRWk
zaK0yHIylF-mw~?ooy)=B0KWqKeQ?<)YFvDe-j(3I{`M;Hon%9qMdH00ybJhD@Wa8c
z0q+NXE%*uG*MXl3J`4Oz@aw^g!EXSc41Oc{bnw~W*Ma{8{8sRr!1cMElAoKwIo_TF
zeuyN~EFzZ$?&o-!_GJ;3mO7~%FN?m!A<L`LkI45P@G}SX>Pa&O)_SGyFOv1y-Wl(q
z(D4&5?HMn5D)EX=d&bM_8T`acd&WziO1!)-qCK`RuXFGdFYOsGc`EUWPJ3=&IcCxN
z?<Zc`GhXsk;uW3tj91S42Z@*VjF&u>ctxi@<CW_Hg2YRE#!H?`yrR>d@yc}qLE@!7
z<0VfeUeRgKc;)(mAo0?k@sg(!ujsUAymCEKka%g&c*#?VS9IDlUY_6g(?8Rm@sg(!
zFRv45kNq#t`}>KP_KcT2m3VpmKzqdddsBIW)Mwf=Uh-7p6&>?mWND9hd7Xft?Mr*c
zOP)%+qSK!7<^=4oXwP`bQ;An}+B4oh0pq1T<0VfeUeRgKc;z`5LE10v883M%@rq7+
z#w*Xq2of*t883M%@rq7+#>?v={q$F~XT0R8#LMd{+oON}5c45^;-x*~B~K+@(P_`^
zdsM*sOnb&lo=Uu;)1LA64j3=(883M%@rq7+#(Q+Ycxlgg$y13}blNlC?11sop7D~W
z60hjAXS{M<Wsv<5?HMn5D)EX=d&bM_HvRO^v}e5Jsl+Qf?HR9JhZ$u1(w^~>rxLH|
zv}e3>eP)n&Y0r4cQ;An}+B06cHYP~Cv}e5Jsl+Qf?HMnx3-!}}Y0r4cQ;An}(jBkY
zb*DGlc?Bu&L5wpOf%Cf4b>KXoeiqK(@x0!P;JmIN7do`p_aDl6%y*4bdL0hm3oOs}
z(fWBSbjTkD=X;P%Y9oupdmHNckHD#OFgVXkihr_*4&##VvdHfX;OFiU8nxeGjMRVL
zcYhY_53=^6Lr#6(r_cNPY0vF`4)pcDe$gjC66I1q+j1$N&jC0V_KbHZ>>2Oru&1AA
zd2oGSjQGjt0F=R=epXs8e)4%5%$r=psrhH#&IRXop}pqK&BLK6_YTx6UN6l&_k;f|
zm-%G5dC+HEY%jFm3;Ha#7dY*6pwI2g=Qc3Ur$C3>aRfNaJ=24ifHMyj;PkWFa(DYq
zfj#|Xzrnb!f<5c)&CqAP{VD7j@7*4JAvo*pBjEINiRErw+%D{&b-Rdtcht8U=+OQq
z@I|QS_k$k`ou%OH4>y3b-}}IWe+<s+H`pK2PxiO;XCQQFUjWWL%mAnTVsPf+kKmJ$
zhu6TFhaI<x{vi2h9`wE8F5eyY%)@@rr=Qwyhz|YnV?PD{kMq#K9Gv%qaDU3UGGR|Y
z`Mj4~P;L)vFa0*#FZ(_A55r+kuI*iP$p38ZB|r3M6FB4QkNk5x%C(@fxca<Lg!*fs
zL;VlHe}O#w8=U1HA_dxVnIC;$w#3E$Y5?rnZ|Hp@@-zD-z89N$<9o5m&x1bu;c?*f
zbAsjKC-+AefV2Kg@!%JMvt3+nxqL9*t6|Ul+yr~}=Xb%L{rP>cXWkz2;QAa+`I-Is
zldz|s%Pn{F)7`8ui~RgJ`eE)L`5wA)5$ou<aVhL||04R#n~qOh{nM<DaO$7yp+60r
z`swojUg$rGxE=s!xz~a}jP_;zj4YA|j`O|7^Y(FBk^KJ>Iz6n8<cIg8X@4d98{lWD
zwHMCot|wY9I=o)J5%%>cmw9G;xeWHqgV*~O4}txo(D#aK2<#abk6Y<~6YMX5{>9+*
z|8j8pZ!iCk<ez!o6ZWr}r0V#*8#uRbP@Vlfbh5zNKWiRj`?CMP1NIz0ya`VGj_Chs
ze=7J=<nvr``cvV-?*M21dA}$5y|CwY8Ry~ujo|eEaquVLKgWB_LuZuB`2^;HI_JTj
zdAJ;$ab4}fXMr<bwhP`Lno4`;eI@B??_PfTX}|QRJ=!nxmP-5eqZ73KUV!?^ddU4I
z>+`m#C$v8foc6qrV>#;ot*~dkUEslA1!sL;=fU3sXML{ni1!|F`u{fg@8JL8&}SYB
z!P$Oq0H+S0>&`s<0rrgdc@MrCT%K{Q`-NA)nFkX}WRZTG`wOq}z^>MQTk|<~yO_TD
zGqSjRmv-QMzcc6S_+Dlm*GXJ|!uIL|f2hObWsZ|if_-=Mx8`$%<)Y8=0LP{DXDoDB
zZV7aFT%gCTl26(n3?2H@7o6oD1N~LV!}+kMKIa3O2adZK?-kHtx!0jw#>M);a{X+_
zzrg?hpSL6P@ZZ{wv$5Uf*%#U_=7RqQob#^#G>t~jQ?Nd>KjC<l_6MR~{T21$FmU!`
zL3KDUO`W5m&;FTlu|DsGJg{AGe9rc$^FnTWXZvM)EPy`yfivJI+vynC)1MGH{V#(K
z+i!dKOC=uu=)9Knx6H$I_{n&$h7RN9_?&U2vK`qT|9{?&%)@_cJ06bh&i+J?Q>1<I
zIWt2%>Q6m5=PRZ{pZBxt`4Op~oUh=1kmEP)KgFKov7r8sgrBVc7kc=q?Lx}syu>W%
z(9fTM(@*xR%%|6J4f_rD=Q+@4e?ADD{jiS5#DDg~x<3)V0sDoX&>^S&KRoQodsrQ*
zKSPYYuCMhfQto!K{a`7|W&PoN*D2UPw#V@={q(BmlMomEX^-Py`r}nkf*!YWfBg}*
z<8jFU$Kbbve**p+@J-+^fqx4A2{?~0cs}c2u;+2&XW)81Me5IH@N!c(WD)*3c=rg6
z&WE#q8)v!LGY_m+%mdpy<GmX?jQ25c#``=t<6RHVcs~bcygPfun+eYC#qG;@&xStZ
z<@^TYW&g~0?}ZNIeHxtcz5>p8{|U}`w?kaqzFzUNA7i|upwD=D9LIPsg+1fF1)T9d
z2+nwa56*c14$gSL0%yEkkq2&H9gj(U{txQ^VbCF`{nsA$<g|Ye{dO1VXY3H`&$Zo&
zKeW$<JvsMN)ZzG?_ByZP>hA;n?cfjlJ?fkad-BoX)F}n0y-8tY5r6JOe!S*|l*|6{
zZ)PRkKX#4EM9yFE_(Jn3_8gyQd)Vu^TKwVoKM(ezsmGy(mWw^dMcQ86a?gbh{nX<l
z(c$qz57;x_RK^2*?hyO!dempm!*HB-ne|8f<Ty?1d8*r`H}rYFX#hCuNdY*=X}Vp+
zALg0ug4>t#X579N(C7B8wcOplQ@~m7MbP2)<#>SY;$_(Hj`sL2IPJ61zmdziLRn;c
z?ExJ=Pl@*HB_OkiJ^82L)Y-<gSy^2B3&2@VmPXB6*slif0zcP-)1RXd7dgi{dqL++
z5Bq}=7j^jjPwJfFVgD33<L%|)|B2wtC+jEu83O;Qul=8!{{x`k6?yRTX9(<B?r`vZ
zp>rNM?Tb8kDR?*NG=Nh_`*}Amoxc@Me-8D~F<n|@5&Qd0oz#At`s_DOf&C_vbG2tb
z$^6s)Uq0;jfc}@T|G(;|9%o7O*w*}``DEU90Qbr>^R^4@gXWF?{0KVf^5=AH-wx2{
zc$oEv_RNEqy^eFFJ~I#0`EQjg?_AdH>*YWF9OJ{D@v^;8hwao)xooFi_I}F!F5?Ya
z&%bZ>93TGMR9@Y0k$(lgqisi~ie%7!U$igw+lPR&pAV{Yu!qhO;4GK=^gk6p{pbYs
zlgDMeejtpvc-`zwaE|}erL&XOm+gBA`T>qx?!`FaZ1_X}Ij*MvH^H9%-v-X>7PKBp
zze@cqYcGDvwXfR09Rz-cX>3}b53^i!MjEd6hrqtO`CB>b)h`h5iO}J3$C=<9FP#tm
z0Cadhi}pOen~At)L5F-UIIrh_09@Wlt#SPsoX2rrf^)w58_OlnSHhoN%os@)$tRCb
zJA-rk?gh^Mtk?F^c>s5N<wi=4mdowP_U@-&Iv6_am$=>8pKu(`Jdc15x8rzl9;fJW
zsKiBkwrg^>7tY)K9Qw5X7@T?5`Y+pYG}^_{us;*+qKD;T&vtPX?Ab2z!PzdxfYZ-n
zaJGv&aN2X8mifQc!+sGs^S=z7`WwKh{|Pwlw?}=ZKI=K{d0b5W6QIL(D(7Nkk$S>*
z8U|-O)#oS6_L67kYI~mvd$!Z-!P!o40{2sY*dAGb@{Av{i2vklr|q#nmGWefJcMvu
zxm$!r`H#W7g43S+JI+TPYVD;QxrajYtnEU|y%733A1IvV9&2@6Kl3aXea=TQu8W|r
z$6s3RSJBr3f6L=3@ke=glq>veYv0S^_G`vKhwJ|IG>7kLzn|s7f9&wR?Dq){*X>d7
z@GSdX`$>)WNXviX*ek!?;kuoE?r`1TJmm1f_WKHl53%3>?7?4gc!B+{=SS54p_YH(
z*z0&sud`MA^Q@ije_g((ZNJKO{L#(f#a8DqhgVsCyu)=qNc$z#SAM!<KiTSxad?yE
zr4FBA`BaB%zpvM^Yq`p=b?mRVIyXCfw&iy^e4gdMcKAJ(|JH-+b-C)#z1IE($9|#Z
zuQ_~)<?lKCNy|U+;Bu@ji<bLT^lKD=FSlIgB4knfRne~*`#Ah%%QHQAPls#$&T;r!
zt25Z)8!YF2cGCZRX!#kAz4CJ${*krkeRiU=$?|H)eyinE9j@nJdEcDqD8JUR*ZsY|
z2TFbxd%a)fPRG8B-A)fUe1FRy_29fePV^73_A4BFJx~0C!+Tl#*B##1@(mt*qr>}K
z`_CPoYk7w8O&0lC{M7RqyMc2*)y47-#-97r?y%1@f9wAA2=HIy_$3EAkAdgHp5-0~
zd$0XziLudgIZh}B*Zq>jOM5@#ggIs<)j!ItFN^3*gFeRzESKX1mYXLcW|4e)#dR_C
zb^q*^+dZNZ^GC-C`3_hAiySWH%fkJ;#HHheaP;R$ytg0^ms>9DKWqL`{TpE~I=bjM
zU;L-e0&Adgsr_RP?_$6I!Qq;hHyp0^+%Jni-K?D+FKfA3mhWoYhwxj?KN^>|dpF*m
zuor!;XGeomNAIuEa@C&uU(xAh{Ru%w_>q=Rak$!ZKP&cHFK0XUIxe~o{5Hh9#Bw*@
zXJ9Y-I__EtE;=2ppD#OH^QrG!(LAUQ_nV@hZ*{(fj_@It?=1pmQ605E#NmZevy5zq
zkGA||@VVx1^>ei4ZXQZtFaGE_umW6kv>i1#T=i#wQ%CBIEb<|IY~-6c*XD2?PwIJ6
z*Zz-=eVNsH)!|i^e*}KJ`CI+`%5pak9gT0Y$j{<uv3xNL_amaCdDsv3)XxH^&H#sp
zqw*OiJ6y-H=Q~{OD;++~>NGlhhUM3T{}g$+!*VwdGS?)F=AkM2HRBO*>O2K5@v8j`
z4xeRp-gLN*pTBUp+HWfknnnGY6aAXe+2QjnKNS29#M{qu`CvbPJnY5)d#uh-hwJ!x
zl*5-;`>_t6ZFwoU_@niw#^G8&o4~~%)w#yu>gP=!{HG3A|9|ap9q0enga5(d%WYgQ
zcyO5`l0~=Is_55@&mFGg{BJz?4rUHe7S&lB{hG0x2j9=(8?1eQhwFG=-bE{m>MK9l
z;hUmnk#~C1UirC>{Z?x~+2J~#mv@0tNBLC_*YW&~9{i^c*Kz)@9j^QP-+J&rIJ|j0
z@4;VlxQ_Ebcesx8zwzKZm@zZ+pyT=7JotVN*KvL>ILDcMpC-rog|L@#ekZ8_W*G&}
zasIiMOEu*<zXbLycRcL9#>1tiTy5_h=Z^!|@szkndq3m+pP7|ZpX2;Xpx;k|HjC)9
zT#oZuZk`yMMe^Vk*QL<se4v!8<N5s~D$#PuyE{D5e4yCt!udeq+OO()5Q$5;j;qhM
zE4n=7aGejVaJX&{-9M{NmbJUqvDfkK%^v&?hwFA);P7nw{Sk)`w%?y|_z?U3Pagaw
zhZorIuRC1Ff$uqdwEe!t;pf@!+hBYv`B%P^!_T+&dpNw<a-DC`JXcw+_b({d?a{~4
zQGSfWbv|&2!<(%B2#3$G{KpR0amxe`UhDAdtxl7}b^m^a!*x8v`9sO)Jyu8GFR6J@
zuFoq_ey_EE$kEsFz*2|nc;+t-f70sca}QKs`J0aYQ`Y`{hcCDMGl%OqLHlFXf7#ma
zCBQ5$KfvKSA9$$4*G5;*;5?z^bA#oa4-~HB0nP`KpX2C%WOX<nDE2x|;C!HP9Vf^+
zGFjw9xQ+*8u0|G@&vUrW2j1&&9Y5&%-&IG)2|Uh{a&?^W2S-QwUmULOlgD48qvMCS
z9eW)oeC%)?Cw%F_zje6I2l9AL%GL41p5|}nO~(lbIefUSe?2{Tw!=@e_JbT=WO=^B
z$68+G@KVd=8E*7bxy-GRms|UZ4zI9$vctocU*_<OEWg%+-{kO%t-T&6%4U!}Pq+L&
z$9|UOzjC<tUr&1QXB~cv)mi26xt71`aP9BjarlGQexnE9>~QTLzjpXytJASV{B~Jp
zc^8L2Yxw~lyobYoZ|!?Ke5K`s9KOc#0*AkD`3Mhwmcw=4D&+9>R%fEaH(EZ$;o6U1
z>cOve_~%w<w!^nreuu;5T2)!@cetKUTI|7>I(%2F^NhngTfWNS-7H`0@a~qs<-tF2
zcn@p;FNf=Stgjv3&)RpwaTCYYyIU@+NuAemekSbYxTc%cm3M&3BC<TL=?xto*YJ3m
z<sJijukn95{NZs;8Muz4#UI-HIj)gsLTbD^UKX9{(C2Xt%RScE$>Nrq7on{m*GONg
z<?d<i-EzA-T#t8-ak%Q7>~OoeGIV^c`g&Y55%%-VkE)~NR#~6(T35ne@}tWvaM9^#
zzu)F?)xR5@I*&TMi~atr!!=*8Ib7{|d?EVXtlehEKFfaB`*S5fcOws7ZU5osp@-#S
zFZx>lbUdOun&*MAr~ZlH)EVXQUe-_DpKG~#Jb0mp{Z$U{XLaT{T#x%60RK7iu+(xl
z54xXGfAqL=m4}Y*A6$E$*N{BqTR(YTL--KOd0vC|Jg*_V(Ax97hVapr^Ss7Ah}Y}9
z#*f8uv#9@i9Ln<=qF)@b%E;h(4dGRmPjhtixcCZi`onR%=%_u%=fc&WhoM9Mn8Vf2
z7aiVU{d~=Xa~v-E+FyL=*en0S;WMoM*We4x-`YRyYBXh$pG9Afi}&{62RdAje-HEE
zeH^aG#T<uAZq=Vt9s30l?=mvZb@)A&>wSpozuL>3o-E22MZacT=kO(#-wiJ3w$vXz
zZ_>fov436$d&!#~k8?aso!33=KXUjo>kr4VqOZs49Ipyj`%H1rEE?~M=+_L6OT~Vb
z<@vC`AMuW~Ts{~t$C;wD-0F;XbUImnfx|VQmxEJhj>Fejodphm+43hHuJ+G4e4Vv_
z#o-$){}6m3@*vlK%OW4l1J7%S|7#;w85z4`oF+QDU+(H~&4XNXD~oO~)#>N(jZw3V
ze244&#(54``w0%;Y;|~EL;T-r`E{`W1@dsa<!&DCgT3hJJjp}gqNDXep0z8B#7q6(
zfm3IV!#mjhoIHC+7R}psmVf1Nwcl}vc>7M)Uaqy4MRjyu<w$V3=1RBMAj{o641vA)
zuk$UZIb7#e#yDKZF+3k3Iy(PT0ekUB^V#5V_48tI>fGRP_476lewV}5|0f)-^FPme
z@aG+#YxBRxgTLu;o&Wid!*%{=J9{CxZb#+2I9%s>x_Iz|9Io>}*$&rn;UEuwqQiBb
z=Tr}Vro(mqr_SLz|1;HtU*>R~=egE{-{SCDcDvl?aGn2o#DhQX@VQoJxd(sV;X42G
zp2Kzi=MxY9rNeceM>}4v56XA39kOzr|LNv%o&V|K!H;sd&hrfL;3qm<=YPgJT<3qv
zJ$SXlb)IL62fxhW8|`+P=Ww0>xz~d~<nS$4=P?idjKg*QXPv`!{^wl}{*l9Vp63e>
zzKy-%P`9tn|8#S>&j0lA;72)J=XnNr@Dm-b^FJYQ&Oek{F8dMA|1`ip&-DLQVqlgF
z!8!kP8FV=RGZXeK_j=fS&Hqd=<?4Qf^FQOkyGGrL>^EueXZ~lA**L1t`Jc<7-w*mM
zm-9a?H_zHjy1e4L0{Z$~2&pGhuFmu9V|854`wGQg&ujN|?CsZ#z7E&@^+^ubd6nTF
ze3ZlWy!Kd!>-L!7@GSd%Dme3SiRErRyax7C50}|`sK<GdAJ#*icM>z!!#knFa__NR
z?7g;^TqCFTg!QljT;mphXz!;U$}zj@vmVZXKI<XNWj$oMc|PL068fx%Qf{JpNX~jF
zTo=|ua@IrPS`SaND@xvkYdz%sR^+@MTe#+(^^KhOTM5sy<*{Bd4>#D~r9QAf{F&wA
zr_{rZVqlg9(T_;~!+Q9j<zmKq_$%16+{a<>RSzeba<!hY9?H2q<(d!illETqklTwo
zN5fA!=d1by;V19YJl=A-&-f`bHdgxr=rBLJ-QE0*hCTg1$8xdv%1<@&!2DE!Ge5NV
zlOO6ZKfm(G&jRFu`FR>VmHg0uKl!Oe9+;mRaOQ{he)2;d=4XjVe%ibK(0@Pqk-0mq
zx6Dr+IP*h$Klz~!^CNS!S}xmHd)FWO?<YSE$OH3J56=A1-cNq0!~87u$WMFMANubn
zKXUDaZb#-P49@(}-cNq0!~8tqk)QUiKlI;Ee&n8lMERKl&iv5cPkyMw{4DdxPkYxN
z`tK({Q;`SOpC)kThxUH*LmlSlw;uUv@A^akz4Fr?`~3~b1D{*S?KlSGhvkT?96Een
zgq{bNam7Q>uZ6vwThV&k2b}(>|E9<cmOCEy7nnI=)tLm&a_hiZuJ|X5eDb*&`4JkO
zH+~lJ7J;t-Uue1L6q|q4AH6SL_~YQ`*!dNg>wJ~)KVdxc73|3~B{61kb&mDm4|;HE
zQ>sJ#o51P+T^?M<kg7xbtsZ=Pv+ZONx8#~e&6{2)<Hl8O?Oo3E7cBR89`<i}aC!E!
zEUx}R9{hL@&ifJQ&lC^)n>_f#9{foUz8ReLJQ`Ir&%ZZ$-UIQ=Z<2rEdj6)PT|v3t
z_oBy_%CEILogModEbroQc}IdQ>~E#qovq*9qCYqLqxa8bI{Z$nljZQATh8Mz(bw}>
zy&U@otbMk_AGVzH1ETXQ%X1z3$1ET0@Fy(KbGY8;lke~|Z61a?{0~;A(Bbmzby?Ui
ziJyP5oX35_U$UJ2xo~-xhAf<S60Y|V6-R!J)sw$l`!a{WZ~d=u_<PpA%HjXCyw2et
zTOM}!zbtQZ_!pK>bNGKOpYCwI-)V-!x3&JybhzFJHOt{zZ)ZFFM^<N!!{r&lvdoQs
zG}rUJEuZJ`{VbpF@B=Mh;P68%U+C~dEnnpDBP?I+@ZOd$ad;ogmpXia<;xs?jOEK6
zuKnf;him_}(%~mtomCD$)$-L2A7S|#hiBUJNoyT`mbG8!@O*1O*76SK^C`10)BP03
zIll$h=U|Ba)8L0-Kgj;M0OhVU?N0SagUh|u${(;?^f})6BlvqL_hayKvy$q315SHA
zpCkIKOm5VEw(&t0;me_;*YmsfdR@9}f29DkxV)QfuP%SYgP&x#o7mIO^>(|tI=LMq
z#kMH-9Go{{Tp2qjwjblc*L(1hyCl}R&vHrY^Vq&KJ9*gK1DF<Zbxv&mCl5Y$_r&%e
zd+_OdB(~qfPAt3rEb!n1x+K<F>A`#06C$qu<sSS^4?cMB#O2=Z!N2g}qxMOxv)F_0
z+BLELFFg3M`zE%Z>%l(;=kd;G;Ou9j>e2o9pG<vw6!lVmlX@t;^R7`#+gzIY*|uKV
zk7j<J1-801^N{6s^EUHRt8dfL%pb74TeSFQKFR82I=t5MEQdE(-qYcYmiKb_MV4nf
z{8G#NIs6LCa~*!Q<%1o5o#lBBztQr1hwp1o91V5&ZPvcf;dfYG<nX&JAMNmaEFa_W
z`z_b~oz{m3EiZQLAF;g5;nS@D6%K#g+E+RJNz3aT{<P&`hd*n1lf$30e44|bw|u(8
zU$A_J!(X<1ro&&ge3rvsw|ut4-?V&=!{4!duEYOf`8<bzX!(4He`5Iphks`ILWh58
z`67pZW%*)<e{1;?hi_-w=~9R9X!$aS?_&9Khwo<j3WpzL_j4;9zK^wE<?#J2U+wUN
zEMMdBdaJ+I;fGoKbq;^Z+K;uogZXTaaiCsrF6~b4<<xOk1N@O^xGBE~{uCRhlwSeP
z=f~ax&gaKI2u__x!Kw2MICVa-T>M`RKlS=e;c{)f`ne0{wOH<+;4D|~6OsJ0++$%+
zogv`VIRl(Jb(V{thnWA>&+B1NeZ3D-{GtB+u&2J>-y!zY`7`XPqxWmO@#^(i!vBcz
zc^7fqEW#IJ{LlG7+Mn%VFVAw9#nqQ*3Mr@lGvL&J1Dy8zdK?F7eU{Z&&##OY8}WyE
zy91oZFTV!o@y_qTY5yVk3&`j8s1Iz9yJ36LAJ$Lmp8$LMb2>QfwH`|T>Ccn!hwaF#
zUg`CQqC<VXzf(B<*&f@A_D6!#p90I}gYErv*fT%n;MBhqoc`PhPJ6j_LKZhaFIz4j
zhnWAh{pxeZ#Gd|ahk8i;gTU#}(crW{6P)>xYuIFQ{gG?-WO4nu4V?PF1gAgGfYV;i
zp{PFn`3C%X)bsts5wpk#+v$nmv_Bu5_A|g~KOda-dLM`UO#62{><_{`0FQUFJow=r
zytfDM>%nt9_;KKI$609C51O27J=FUTBs}I}fUUQ}X<q@p2s-b9^L-f|v3+?z%L(8t
z_cU<kb0j$5uW>dw?Z<*M58X{XvPfJ!uXjR(M)|(xN6pV@%OyO~RIbMnuFl1<f6>%u
zJ6z4U5&C~dJ--$9d=K@#u;+QeMX=|4sGoy9-$VT(_<ivI-{3s2nt}d&xd~e1-4*qx
z-qbPW`Wzm~1M`0f?5WS^@SJRHRA&I}sn2l~_48oQ?Q5smBK;flX{Uc8+nxCg`d)9n
zFI(beKKmn|tXDjL&3ZN7+Pn4Y3J)C~m$6=P-j((0m(XV(mP4O;(E20(uwK0ld)BLs
z;LL;86VYM)*$>-`=f@8M=k`6+a?xQu(ffWR|J2d@d)#_>9Q0XFg7yPvBVKM_?FYn9
zxwlB$yY>U(&tK5qXILGvA7a{(+TU!s*mJvZJjpyi3wyS&KUwbP|5ezted%$fn>TJ>
z>VF1(d6vGmU+p(Uhx$5Rb@lareBs<KY`@HpSNrXTxR{@y?NP5E7Js;XwLQAqSKFi5
zbNk+9{c*SN!|;>a_c3t#uiMMrjvHXl`me{i;t$)=CTlM`++JUM=;-?zT%8>~+EF9)
zUpIv`*9UO9$9x9LlRw2D;r-<gvviDpH1k20Yx_|9<1Fv&*q>;57l-TdKv#zkv-Vnl
zRR1)~GaY+<o>!K`&$RYE9j?#$>gDh(o5yU2msp*C4%g$8T!&X$`@s&^=Y{1t`~qvA
z@9@c%4|Vud%L^TTvE@Y$ue5P-yd>NAN^3vHvA@Rhu@1l9@?wYo#PTwS-(orYVJY`^
z%c~swpIKh#@VhM!JN#bDn;iZN%cnW~A<L&bT<;5>0xokAiQ3CL!?oY(0DIvBtv=g}
zaGg(Kdl7zuwP$+~KE!gi7vcIIVzw9I!>v8ri*P-z&UE}7W$oEs#9rrj*j|L6XYJWu
zgePh*!b`0^+l%lCmb1MGpJX}Pi||^@^Bn*6xgKmUV&7=(*<OTSWI5Z5aGghBdl8<f
zy$HYB>ae{Czs_>D7vVY|QSA7Cv$bb?5&PRLXL}KThvjT9!sXdXvar1fzsGX67vb_u
z2U*x&gg<CG+l%l=ET0}(E4p70uJf~A<1~(|IX+?DhGBeCZuO--aeOinocqmMaE?#>
zTo=l6b(}Bda(_Ju`Yc!TEcPtdo(72QA7ySw`;D$vN76VN{BY=Vypaog>Kq4q-Veok
zF55!O9SwVqm(GJe{TT<&awkBC_xl_HPJO+<M)LC>;yoGm4`94~7C7xI!DpJ}X<S!&
z@SlQnKKvKp52D=PfYV-&v&4Vef8=4m6`b~*@1_2M7^l(xujI(vSKyqt*-t8zS;WtG
zke_2bxb7dsp7S}n9}v!ZcsX>~esx?RKg%<Sbi3RNd$wQgw?v=qXg=)8b$>4QY+vlh
zHlW-mjh!rF&-|>7&}e@p_PT$)7x{c0_2G{u=dy?nufIJ`fLY{&_CE(-2c3wq`A5Q&
z?Q)p~*1VbTB?e~c82xDG`&j=tP7s}wt-Zz}Uxkmf_FWvEckOrfKVrYu>U4AL^|_##
z4u9P0XF2?1%m07t2R7O~$o6Er{tBG!`bRcTuKfYvw10&h{lI^~S<k!K?J4@QeYHL6
zxYFfCuxCFo2AutXj(0?d{lE>@UOw0lu)VV%@YCMe56ClZWRY^&4`fGZlykq656=CF
zj`u`|`yCyp38#G%bhv%50H;0YfA&H@!1Lp@e-k>?|0g)@dAv`3&g;^i^R(12K>cBT
z3xQMTB5<BRx(=N74}<gk(R<*u-xk}K`g?%Wz7II{^?1eIj(U6`ocdQlhx+$`Q~#&f
zFYr7I&!e$Du7~|UjHb57NJTcjh(F}J3owg(uszCLv@G($_NdPR7S8r~rnQ$a*dE70
zhwX6!INO~*UqpT;*XOpmT%Q~4@{2t5r-So6(UstA?>bK_alMax{>gloMOI_}pA<v0
z2!8|ZQSM2UMRjyP`UbYw-(mkp_(T35aCs(G^Y)F(NAzX;UTeQw^JcE?ko$eHf5+N$
zzc0MrwjcFZ{1>j{NbdKA%QH1(;eKEEK<fzi`@(;1?K2~5Me`&46U(z4evsAqp&yRE
z*!X{?AAZ-PAKu1nYguHovY*@?oc&}DIQz-7z-eC(PW{WlY5#L@>fdhbqxi{wcsV%x
zfw#e>K5IMO-qv6FAm1CD{qTX{?1%MzVe&Kk;d8CMgu#B8{Vn_9@3OyTf6o4v{qVJj
zm;Lb0CLUQNuD=-@?Wfq!aNeMM#5!uvd4}GWOEJtR=Qr*%+fKJvK6I!*3_6?-(RmN?
zQ+!aJV%T%ssPh|QPd{s{y>OP>03FVUw0C|6pj_ss0G#z!$GxuqoR?$XbUf_lP3IwH
zdogc1|K{e6^XJUlMevh(+a8>8*~`Hr{SxB}YX8G_iSDO@ZkHeOmR#O~*3a*o{SVvy
z|HgK=!@WrV$$s_wR^QU)XS#HD!v5$>9N*d78C&Gj%YJw0F#mczo9s`$_G^Ddxzyju
zTzsSB89)BeJ{5mng+IDqcE=U=_QA;bkmIN<<bmV8zTnJ{Uccw+^ZHMYTTZn)?zn~L
zl{juWANKUK44mVZO8CifOS<yV3;N8%vEZyHCwcgJ3hbGmk+A1@_{Xqke#&9b{8WK6
zKNmpfhx|m3cYerE%j3TPR{i;*pNWoV{;&2k-?#BhP=CxWJ+jFD>uj@fC;R<K`{|Ao
z`hjzQ!TA&JFA8B#ex3)X|5+Gs=>E?2hyI`YJ@fz2fc~HVJ@db3K>v%sXZ|1I!++K{
z)@QH!_Je)2KTlVFq~DQ6+BN5g&y3J0XTNb3IOp4+^Weoe@4$Kcxwc@pT)qC+<-deJ
z@6%ZePJO+eS9EAU2mUawgFO7n0_Qw=809h#UjBRld)}9~1)TmI4nMhF%+z>f5w|Wh
zU-W((o*xvxzg_<T$6l}7Ji_66Kl4C`zihwfJN!xe{S1fSW54V1h5C7&<&zwHolkFa
zxbB~>bodba{U(R&{*w21NFMgIc8eT)eXjm8hv(b8J!84lA8r?|=Ngyh`4vY;-{16_
zht7J(UboA~4%hoXKl9Mh`vlb=-Hv)ci1Mv={Z6P?j7!gBs=aRaOlz-vgVpKbp>w2T
zuk~b*!&g}yKJS$N=yuR@wO);Mbe341vpxJd-?4A5hYp`-b$A~={h8v}YrUP}@EKO;
z8q3}KbE9Lg_55cJud+Hn_t07B*lW9Z%;9=I>`4!uXB>NNM=v;hu=PjZQ{=|=nq#l+
z?tO=6S)Gq8cXjl=L%Q9yo$7gN<(;g~jsnc$>g;K`d`vU_fcBG_4%ha3l*6?>>h-j$
zqwVVy$6njZXoqY4*ZYT5N9%KqW3Tn|B8O{zlWU=6Q5~&6dY_GQtq*!WUAb;wy{=!m
zZm(qmps)E~<#27EFIw*A|5e9c^Zc&EwV(W_ht4L)Ubo9P4%dEiJF~52asAoJa#>C4
zgKo!t9IpLjHxC_s9;52$cF%TnHblHI_s@Cg9P8L?JsIY3?I%Zg=*S$MEb7la(XScf
z9IpMOK3~GkPqky;Tn`<t{p57ZU7f2Od#$%~96rPP$?H1U-|F+CH7>2^G8U3Wx%QL4
z^6+P=V?QLidd43duKncm9y%{N_S%l#bh!4DGN&qwo1cF=_S){YI6N!5dWOF5)z#Tf
zfLSyT+D`R)Lgm^|?qls;onFwn#Q31+7e;&7PlLVG0kzlnvAX*5ObPY#a$~RY{@LMK
zQL~JfESC?~hqaEq#=F7c8n4_VFN>@58SH1kpRXOB6<s}JTYJFi>U6YR@+>;)PZx))
zKl^#;m_y{qB078yfaXcc<#`i5e<b#N4nR&sB^ocE1271j$JZx;GtcyAi1Atd_wr|d
z=ultt=jLq$?0MWY9h}EIJdZ<r9*5HYDCi6@!D#)=vt07V`T61CJl}Dy<>LQ9===`$
z)Oil}Jpb}n*mpO7t3PkUp66fmI8pqhKbxS#azBR-&%b;N&g-~-$WL_s#4A5TkT=#J
z-T%1tXCk%>x7SqY<f8uQ_HuRp1AEq=oiKi8{n-oSXV#x?u%|!W!C8NLLWlLI4>;=&
z&%-i5XCn{P9}iA{CL><vNAI(9^Ybs*Ge6rPF6Kv{b0Y1R`O$Hr+rD&s>Xxg=zoNtZ
z9O03l_O3r0Z5~`dKlR9uKKDcHnIFyrFh6@DpWI&hd>FS}J|Bkp;rtcr&ky;D_CH?v
zIUL)O?dw>N?XK59Nd1&|PwW0=p@;oL&}TbZ3VYU*6|iSLc^>wxCoh4sAJFHexb5gI
z=(C=rl80mdKhDF+$UnD>&eKZ%k41hSfjzgE9xsYL>&erwXFbvSAoi>$tPk|(Z_r`6
zf4AJNC+~x^o}2^DaqP7ooX?@6y*ztI7AcqG?NQ*gukzqmdhk0vxZYnY<x-#bfs*Te
zx30a{JXof5*k*C<_4z$6AL(JQ&*yOMXL#82JP!Tmb2!PL_0ajN2mio>|4<*I`<EZ;
zLo^S1UQC+bZT1*k+Cx|Q$1K9<f@caei}1zZ)cG|ybshuH6cMwyIz6K}!XJlyHu!JA
zbHN|p&VDf;^yewq(;t0jl&qC0|CpsUf1ZX8{doqQ{ygg8&nvK}Kd*vkM!ad=pS7^3
zKYs(KKl<(|k<Nqu>#!dRz7D(y{0;Ci;Q9_LLB-&2!k*jZr5&u1`CuO2hJ7Y<Sl?Jr
z-hn;y@Gdy>pzqES={)Ga5Bu*j53hLS;Y0Y72|vB^uo3pm!x!Mp!<XR9!xnJn;osn_
z4_|?^K5PXqhX4AmFhLdI-@?8Qd>iDa30&VTCTKc%2iSK8Uk~0Dd^hk+aIZXfhCTDV
zCph!0?;;cFJm~KOd*)f+Q6{F$^Zu}Bo(}+LymP@B@9p53@W(6Od9Y`^cY-tC`QUlb
z|2a70y$_uJ{}i15-vRE&|DVC0{@(>o|L+E;|M!5?|NFt|zgPYrg1sOAzi;_p9MJ#&
zR{lSRpR7On?lY;HUis&C^wN12{gszaPbtJKGOkzwd)7mJ7p2&-9zF;AJo(WqqO%g5
z_3)42MG@<${qx{s!2b+h4E_Rm1^8<4I`9|4o4{WJpAP;qxSu?4kL{QV9k2dM-z_Po
z%=3=WVV*mJ=RtobaOQbuaOQazaOSxaxSx0rgncIb@rqa9r7Nb4HxoLH_h9fm=<B;K
z1u@?4uxGqk;EcBixSx3SU7AvEru<_Tspnqt9tM5J+Y_Ae9uA%-;${*3BfuH&k>HHC
z7dYcR3fxb;y<wjz&X}dOc#noX<IM(VygA@`5%s9PzH3wv<LwK3#@i2^@%9Jz6R*C@
zRLaeif6UTayaS=ncyqxS?;!BJh<a3C-<2we@g56%#yc3C@g4{6C*GT2p9z1w>hu44
z`@K0}y#MR<c}~E1|JS$gEdk^GU)jE1$AfPLjQ4ohv%fk4oc&cEcpmzP6T#VE={tGF
zl>OBZ*t5UN2lvxoy$$<J_~X@I6~LbH>N}-Hg7KaL`#k6m1!ug&z!~qU;EZ=TxSx36
zfqf?Y@rt()_Kf#5aK<|VobjFx&UlN!8Sfe3jCUkB<Mpb~8({Az-chh;yraPx@0s9?
zSKk3HDQ3K9!=CYu0cX7DfcuH}UD*4H_gvUB-t)j2?^tlgdp<bh{V_P>4S_S>VsOUm
zbsYL0?ES=B0(-_g4xI6pf-~MSaK>8>&UnXzGu{c{e&YQH?ES=B0ei+<3C?&Yf-~Mp
z;EcBlobgtJGu|3-Kk>c~dq45k!k+QgfivC<z!`5nIOA;qXS`u>#yc6@PrM(%-cP(!
zV9$6P!5ME8IOClP&Uh~bXS^4IGu~<7jMuAw{wM7H#CtL98Sf?FjQ3J-#ycIH@m>bb
zcrOQMyjOrTUa$V@L)iO?_d3`!-dW&`_j+)~djmM*y%C)8&IV_^KLPg>??%}BiFXF<
z8Sj<gjQ1*V#(On5<DCi4c&`Cxyw`#=-g|L=vuj3lk>mRN!85_V##g_9J>z`<obh^{
z=Y0hB^k*@+AAj`SpyE3H(R(O_(;u(%yk7PHBjhtv#LUv#e8>{`Pk;2;p0Ymu(R(+9
z=gB{25q*7zzkFwXSOxte`Oz$5{{r}!2#xZWz>C3O0j~gm4ZIFqpDiq?34A^5JA-@W
z^OJ!2`~dpQ=SSeo=cnL#@aHpd=JRuK=JQK%=JVg+#nAr>oca6~ocY{FE<Umg^Qrg3
z$WMOqxhY^iJD^<VQ=cU(<uac;!#+=bG>g=?PT<VvkHDGF&fv^v7w}>cH;d@&Gi>F%
zpFDgTFc15oT;^eaaOOdu6)pbc$v<WhKM#gI^UxifdFTPoJoE%F7ICwP{t@8J!@m%3
z*NAo0{xk4QaIgOSXy`K!+2G7W4tO5)`+zeK{lJ-r0pQHTAn-cqFF{;Q;7h@$gFgX2
z6a07Jv%yz@&jnuwJ|BEJcxUj<;9bE#2hRle+AgOc581FE3Z4r-3_K6~RB&#WLhvHk
z>ofTUjR8Lc_I2QoBd#X!-+)gCe-fPA<yr9Au>U>yT=3t5&j)`7yfgS0;9bGDfM<ex
zZI^$;J{$JmhxSqofBpkME5N@3=XTr*&h7X$_;l!e1J3REEjYJhhPh5#mxa*T27EF2
zw%|*_w*y}e-T{0i`1atd!FK>(3%(<GXYh{TtUo)0XTsjA{_Fz#Y}kJv+I2Df=>$Jn
ze|810gZ+=dS$}o|pAP%Z;H*EpgU^Qj9^kA$dx9^9eHU=npS{4B!+vjY)}MXASHr$5
zIP1^8;GJQ=A2{pJ{@|Ig_o_c3^uyFY5IWTF2JT0{)I;CP{{sT*2lfA;fcjqkdmWEt
z2Gk#q{A6Q$={pew<$_nhJ`cPSd?@%t@FMU@;A6n`oeP4B!K-0k0bT>n`s0<Kg9GNL
z7W&Lj9XRu&@8S^`^WbMa?3teiaONir&iqUUFNVIp>qijt(+GP%`8gzDewv`q{7eOB
zel7&hga7(YB0<cLKGQ%r^K&tDn4e3)i)AIV$Z^M|;LOi-a6kF!9xy+bL7(}#9Gv;N
z0z6NgH;ec`1DyHMcZG-@^K%vKnV+k{i)AIVi2h7)=I0u4=0~1CsY_S;hv@VG&jk1C
z|F4BU^K%_I^D_%P5BfKNGe0+iGe5JznV+A47eoIhaOUS`aOOvzZ>bCOa~OE0HITe{
z<!27`nV(z0nV(z1^PqnlIP)_XocXyOocZ}Fcro<v0B3&Yfipky{7hY#pTog3twC$~
z`5E+?pF6>spS!^Gpg$j+`MDdM`O$ZbiUjj>5A2Jfug_o+#QfX~d*(-;&#4RZb0m1C
zHE1nA_d%cexgVVQSqPp7{a=7HKM#O2KM#U4Ka0SNq5lv#^Ybt`^W(LD?-ejVk3gUK
zc?{f7xkm*o_bKSJ+-Jc3l-oOCxqpB@%Y7c)Pq{}2EO!<3S?&wqe#*@bSng`*v)mWK
zS^xDJM^ZKY_>&XRpO;ZC{aFJ}e_jFi<4>P}{<L>~`UdnTUHSPd^41mo%&Xv;;9mRR
z9WejH?X@E~w^v8-Jm~KP&i->}@FLjn0zL-36FBRGK7&h48Sm=><LwN6#=9pt<J}uP
z4}R_g&Up6&XT1A^Gu{Kh8Sgs8#dzNU&xAi-+xH;oGu}*a#(OY0<2?kN@pcDiyjkFk
zw+A@m{X61fyl;a0iT7yeGu~`)#+w7qc>91e-oD_Bw;wp;?GMg)*CQ^*`xdyLcn^a<
z<LwE~cn=3>yhngD-Xp;oZ!d7hdlWe1eH(Ex-gm(L#5)lBj5imY@eTrKyvKku-ebWT
z?_hAodmK39eF>cL_6xYb_`iDpb^m~Q_~HKR=sZRT)GKW-+h#<c#c4hwOF#Q59G5dR
z&z}fKv&$%hJ#HV&SPYJ0Ggg3iw13OTTJW8~H-qmC-cb(h%p(5m68S6o&uDOc2BiE_
z0lq8jmxAlN3FPOFB5W4<*e&u`^q+3v+GgdK>EOG=eh&B^;9J1;8I|&LC!2KnxeM&;
z!1n^50lqi*`{4V4Zw1%BMSd=}8&%5P7xp^WDqNr8DL?C&O1M5tQ}{;cbQ55gF}8Au
zy*}GteyRdL(Avs}K0`z74+7V=EIbo@jICtC4+htB`ogoo_1azGJ;3!Gf$&4Y2irbJ
z_+j9)z<YwP1J`GQ$<Ld>kAVGX+ZaUuNbm~qUf`?1_1T#6^Lp^!u+O)RO7xEg9|N8Z
zz6@NS(JDW$2JZv=eztLneqZpR;M%vy&x^qO!+tsV0PtS6k&C{*>p_0b1J8y1BJe@r
z%fXKU?`1m+(bs3z$<MRF^%=>+mx1d$jD&Zzor~xkFTgH?!Sz{`^3!ziJZmc-tH4hL
z?_fJA(LV`%DEJWYx#0QWi@;9?-wJ*TcxT%QO1Z<pi@{F?4}%W}UjbeSz83s6@Se7l
zm2yXb4+bv+p9QYZj+39~gO7s!Ch*bVdA1Xma?b>x4zADmm7nK;>oY}#uLmC^z%JQ#
zXCV6e>@WE#A6%d1D|`;PKGRkBLh!Ky?6L*?e1+z-lik@!x%#dX`FSjONPu1Hz>5`{
z&*k7H;A_CgfoIvBnUq@!o(o<EJ`=ngd@cBR@GQGi6#WU{Veks@72uWNUF=R&bS8qA
zflmTo4qgSm2D}=43wRCqP`i_sa%;h7gV%wt1-}41)9%zoryjflya9Xxco=*Y_+;?0
zc5op2jo>rDo4^-=PX%8Cej)f)@Qc8+?BGMnod#YAelhqg@JqngfL{u}6?{5)mL1$k
zxtD<#f?p0k3;YW3wcs<r``JN~=wAsw6#OdiD)5=$%fPPz?_dX8qJJ%TA^3IRbHHbT
zuLHjxysI6wiT(}XdEhsKuLi#vd<*y-@Ju`S6a8Djhl1Y<UI%^~_+0S0;LE{p2j2?*
zQ}F!E=oj(l4)7}QdEj%ve+Iq`{7&#K;CF%N+d-|AJ0E-w_}$>Ez<&<D1^gcHp@&4j
zi2efb>EQQ*F9*L5d=2>h;O~Pk1m6n&3-Hd}qhGc)9}j?Mfj<bI3%&@v5d0zVV(^E-
z!{CpA&jeo#J`ent;ETb31-=6OQSi0kOTagR{~BBmW+Xq4fp^J@ei8mScu(-9;Df<`
z16~CF1b7+vli*F@%fM%WKLtJ?{I}psz@G+R3BDYB9r!cgo4|hu-l0eIi{$57@UGx1
zz<YuJ9y|~H58$K0p98M|UkN@9{Ey(X!T$ul0Q`CIrQoZ;H-rBfJp0h-7s<n4z^lMt
z0AC2c8hjb}i{PulUjp9%{xbL$@HOC_4vT&fKVJbK3jSB{8Q`yiF9%->z7_m$;GKI$
zzeu^SfoFlg4xS6X4!jWj4e(;{zk|;Me-nHy_<HazheyANpKpN|fxiu22L29s6Zi)3
zS>W%2&j)`Gd<pnJz&C-v58msD=oj(-1Mmv)e}XRn{}6mB_(t$m;2(jn2mctn@W|*F
z@n;iwG5Dw8E5JVkUkkn&d~mPm7t#M5d?xr8;A_CY1b-iV3;5`xqF+S+-{333zXH$e
z9kbsGz7YIt@Xg@gfX_HOrW3hn&i=LlT;F*iKdl4bb{lJKK6++H{}%uCooPbC;M>E#
zLr%<o2k<%I`c6r)To0~u$ijQ|k$<D}y*oo^8Tc;XtHJf16taG&zVdHWN8jZk-!s8~
z1f721yMfn%cLtvUuJ67S{kh=!E)3yI!1diL!q<cE4gF62<kzVGUBNTK_XQseuJ0m|
z^^3su-7dnbzz>AZbZ~t)huF^pKN$9l!4Cmn1+MRo5uGjIS+MWdUw)0otM3Mt?{(mZ
z!hR9>Vc_qB>$_=0Cu@NG8`al$XUO+raD69>@Oj|+PEz4(!S&sP!n+KVf1~<G!Ji`V
z-r%#qj|N`}o(<k1H>RHho(Hb)+!4!Z;QH=L;Y-2$L1!~~fAH)<vQ{*%0pL~O1Hl)9
z>$?(U{SDyyE?421$H>1?{bQgr7W`Q7x!{Ar*MJ`f-uc*=zP>9~NFn$Mu%8K@2fhOQ
zMDUEkG5wRk2ZIj*pALR1_&o68;A_DP!Mhw6EB7?;BJdI5v%pUWUkP3W-r@L|{u$tT
z;QB6Iv7833@4OJc6kN{<3f~NVCiJsUkYA(q;VkefaD7*=*ewJf1N#l&=YVJC$y!nU
zbHT^vMR4Ri<9Xn7!N-EH0oQi~i$doU<=?3Ok6~X39s-{UUJSkhyac@SNiqF#;8ozI
z;0wXaz&C)GgJ%wj>5m5=3qApSF1ViC6@@k6m9X!eAJd-*UI;!3d?vWQGes0ufLFsl
zqadbV13nnM7Q6{u-`y+<OTaIH{U-2w@Lng!%54Cz01tyN0G|xL9()RTw^L&Jjo@Rz
zo51IQPX%8Mej#|Lp)vi7z=wiQ1D^qYG5B)uOTf2+UkaW(ELQGx@G$sg;ETa82k&xf
zOy>&lJn$Ld72sEb&j7y)d_MTq;7h<~g0BX@27Dv<wcs6x$NawzydU^1@S)(>gO3Hj
z0elAdjo_=nXM=AA{|Wfe!kC{ofzJTH8GJeT9Pq8+w}9uK7Sq2Kd<OV!;ETcMg0BI;
z9b8XdZflD9DR|b1Sh;tA=Yh`y9}TYWUKfQ5@H=5Y2mCJZ<>2$dH-g^{-tqL9pFaoB
z0>1}5488z-IrzQc8^P}b?^+Zq_kQqx;0wWvz<&WgAN&FEjo=T0cRV9j?jrDR;17Xk
zgFg(O5B>=F81Tj5Rp7q_p9%ge@D<>Xg0BZ(0^V(8EUsUJXM;Zmo)7*w_!#gfz^lNY
z1fLGR416B=Q{YR%e+#|_{AuvcqhfI_2k!;`40r|j@4%;lKMOt^d<FOd@ZW<k2mb^3
zM)2pryN-_ezY@G3_#eRw!T$u_1pYkuZ17d!%fSB({yz9$z`L9o^YaDpZ1C0KRp2jz
zF9m-Id^7mV;Mr%z%3T9K6#NzNF!*1=XMw*8z7%{d_<Hcaf%iN+=Fe;3qrqPXp9j7U
zd@1-F;H$v@4!$1zP4La&>%lvYiTU{!csKC3!Lz~N0nZ2D0A39KF8D0)_rRBe{{y_^
zIWa%q2Okao0r*_-e}b<7{}6mF_(t%|b7SRx1U?k}WAHNYPr&DbZvtNi{weq-@PC2#
zIxptWXW)6@o54qee-2&&{ss6n@GrsVgKq&}0{(CC)!_dD?=Uvz|5xC-;9J29!M_GC
z2LA>;4E`<nOz_CTbkvQEdEnc~;L9#c!M6in2i^gE6ZrPvS?5Ou1?>P{1g`Hi6w5Mj
zy~bF06ZlThnFYQx_<ZnPz*m5G0$&ThEBI#c-N3v4SiFkPCv*lc1m7LJ7<>=#F!-L}
zGr_xn&ja5Jd@=am;2XgA0q+`$`QH`17x=#5dEonjj|Sf#yaHUW36~P5fgb?-h2RH*
zuK_;@{C)6D@U7qngLf{D#d`>NFYxZ*dEi;#VelT{3&9TsUj}{{_-gQ;;2XdX2j2pI
z1bC;CjL0JBNbp?nUf^}$M}f}(?+rc|{Aln+;Mw3S!E?aZf%gILI4<UYU+_Hee&D0Q
z`-4}24*;JAJ`j8^crN%NaDA7qc(@Y$7}#$HKNh@WX)Lb6;N8HF1J4FO9y}lX1n@E7
zdEjC26T#<$p9H=Hd<ghT@O<!f;055Dz)uG6P!`L>Dd5@QL%}P+hk;K6KNWm7_;BzA
z;DzAJ!A}EU13m&gqdeyS>EOBGMc{?tXMh)j>${jmISf7u_Oro9gD(I-6MQZBS>PSU
z$NWDVJQsWnco_T~@R{J}g3kj#4}3BBSnw6#=Yy{W|1o%{2{Hde;CbN1;G@Ayz$?JV
zflmW31)mLG2EG8i9DFVKc<@dYG5;rkXM$IN_XDp49|}GZd@T4R@H+4+@LAy1;0wWP
zz*m6Rg0Ba!1K$jO0eHvCSRU%Zv%nj`^T5O4W5FkbH-S$9p9S6sJ|DaZd<pne@Ri^f
zf_Io0i|ZorJn(7Yqroo*uK>Rkd?EOB@MYkafv*L>0(>L*4Di8|V*XzRUIczMcoq0e
z@TK6_fUg3-7QAa!tlU}Py}+*r9}0d0_*n28!Rx?hgU<l}3HW^Qo4}WW-weJMd=B{F
z>R4R!z{i093_J{eC-`jeyTCiu#PlBo?+LyLJRkfa@M7?X!KZ;g0zMb~m*7jl9|d0x
z{%i1!;E#iMtc}I>8}KafC&BZ;p8_8X{xtYZ@Mpl6fd3ABCHU{byVk}0d=9(<{7>LZ
z!B>HIydb9YXYeuLFM%%ve;HhFViB|kJi9)o{|a~^_+P=NgTD&C2z)L0O7OpdZv}r1
zymLd$pLO6_;C}}%0)G>H8u)tfCE#y?cL>MIeFuCV_`Bd6!QTTPJUOQG5AfCCAAo00
ziP`@Xyb%0D@Fwt$;B&w~0$&XNG59+0Pry4i#{Ag?o(29Xcpmt_z{i4r2Hpg|8GHfw
z=itl1zW`qc{w4Sp@Gan-nqqPN8@wm@f57v>zXC4?-wGZE{~CNY_&4ASz`q4w4$cP$
ztOMU>yJ#%(?-uZF!8=Wj#k(DNCU^(%e&E}K4+Y-=d@T5m;C0{~!DoQ)1U?shXYfVf
zyMQkT*L(aW(ly|_!v1~mAAxTL-wnL;g|WPK2G0WD9Xt<w5Ad<zdxF=2cLARPz8Cmh
z@V&tof$syp9K0*|8t{F=-v{3hd@K0=;GHju<)<5X7We_+x!?za7lI!IUJRZI9tJ-c
zd?xrI;7h=}gRckA0`D{}7FQ4OT<}A|%fJr<pAFs<d=dEJ;48t80N((9BzVTfF+Y2O
zcLP5PJQut-_-OE>!Rx@Y!DoTzfG-5^1HJ;hFZg=!e&Acd`-6AABo^-g@P6O}!Hd9i
z!K=UrfzJd#27CedvEa+W2ZOHxKMp+e(wP6pgU<jz0em%h9{47QceeYC&eLQ1VxQR|
z`aRd-`Yh>UhcCDG(;dFa^7-H=!k;DJCxNd99|FD+JRiK*Wf_r0!YKf+0zVmiDflVi
z9WIaQ3<WO&9|k@T{8aGw!H0wQyCSAv2;KyK8u&8s5#Sj!VmhaT_W~~h&*)uWURBaN
zT;3G!9XfZ!sBoX0P~otXh7=WrPCRK?XvB%96^tr6aY#YVpiro)a$IR$U8td^uD-G+
zJU&!aP*hr7l#^|KsVyz3Di4K=hL>KLgkniUOtGl64aLG-b)cy9%$$LBB@GRs+Hn)h
zOT(dt$_vYLsslMOFcwxrX-Q2asNwN0jLHeQK@IoJ)4-a^)uFn{;bDy<Mul<))i#9d
z%S)=qO&%Yr442oJglp@gzvPrwl+=g9^(B?zhGC5bvJ5Dzl{E`S^$U$OE9X|$HiX8N
zG?W)KPR*z;uP!x1pZJaC!;4Z+FCxFhc~RQB7o`D<pHQwzs0^3{v!*1WMIJ^@9GQd<
z(G(=|p|upG&xdqZhNk~+EojOJg-XLy>&inWMWO0(q0-6qq3V)=UbRc*NWzD-R}Pb&
z)_T!Cra@PhhD?K~teKFwConB`P)U{asFBV>I)=)chVuGwL3MSb?`_{dvW-m7(%<wd
zl??>}R?X=X-M-_d)|6D2w<6)$37UO{bc2zNT##eB*oJV)gz`Qiv)2gK)tA>5#P@GS
zjU(N_d`g>wtn~P*+LEx@57pKcG>#lMvb3mlr0G8z8%GY89xy)b3EO>q+9Q2o(ZrFX
z3PK|%7A5IjeBe>vD#furMl@y5@<Za6?zp}81<f@f*VKf@%ChpB0<(u4)i<(w+|J)y
zqeYcSL95xHoNVJzxVEacvAn*ZsIh3co8|!iq@d;cGr6uVZT?Uz{r!R&s)Z)h*EWX6
zO%0XQl!Z*oswychH~oYxE%WKwsGRl@8M?#`4a@)~zJ17uWk{cs22RNtm~EC}`85Tm
zR{7t6ZqlQb!2kL!Dr8&*@UP?g5#3<^*Z1;6b<)4l2h~k(s4(Ng(n$r48PRcfX>H9E
zv)dUJmaaBj5vdU+WueGUWJ;`y@ZS7pH8Xy%3f0z>mYWW`wrOf?%bM-pKRmgvs(jd~
zr$@Td&?$wdpLAkjC^RCJlVfV&_>xKGp>dTpWs%`y!IUELrK~FYQDQy<4O-h}V33Rx
zX&)Jg6WUvQZ;C#lkm(g`YQq&~fKU+B@pO+hi-rf>eBwYfbBT_867G0qfMY^Vc;r(W
z#DPBMKr~!g9UYj;7^}A4j5^HtrEe(IRNy}l51rCx9lI4rSJdPT2#siEFV(-<9UV(a
z3mTN@SR`SeYf_`WYt8viOG_fc;LRqL2-~%^ex_HfEh{gb5)MrckIyv~DMu=5NmXOX
z)CSW;rQ4Ni)%K>58bvA5%NdY@;6ST3EWaUt@}TN*W)K`U(=SOo7}KjvuU=zmTD@yX
zuUutX<x10`mgCmC{D!2rsz<d;L9wNGm1*}bdBvRmam`FxSmC&wf}}lcsh8i7Zo$el
z3z~?t(;abo1x>^$2<DoJg}TW#rDkq1x?N2NU0GdH6{@Q>vkU&Z<CsQi(i%D0)wMO{
zQ>`npjhKWxIRj%-=1?v=>5`fvohwaEDuHt;D$+Sr*Yssht5-6Lbk4+?id5pvc`C+D
z#dsbd42T}`^{Ffy5Hj;=m60kRbXC(&n&T{gjU`b<?<?c=+J?~h+WP7ezd8xhVY}y~
z<eUv9-F#9y3EZ;vJ1IH3Wh-}5ItkoLMUHOSYMm~(Qjw!us0=mb6Vh3?0?W}YREEGh
z2{vLXa&!xoAsud|B1gAS8PefaDspto)~$Y~-x^<EQW`3&oM6to`s@G`Y{iuH=$Nez
zX>%+kJvwG9MA{rnNso@%Dv>tFy!HI;RSR=+WH)S1HI<i7ic~4T>t#pROSqc%G>^yZ
zRAYge#7*o%V6D<Pt?zQSi!ro4t&)?5`LzTkekZeD3CayLlNfyFizWK4qJ5%O)Eu9L
zD+1N+Xq)g@FK~ryEXWOo(j`_JFZNwl@3<(woBExo$nT_rCn~s|Yj|9daaG*A#^som
znrG=_rwnB3#|#$AWLmYhzRa8u*7FDTwFZ{RwQ^|`^-&iR`Dvyv((k8-XxlF4Y98&i
zZ$VCTM2_7OWV`KB)3FmsP<q=1$HEQX7bhstZ+&gC&-*S*_Z)nflQ^*^(su4VbRwtN
zB05$giJmHY-DQxvr@puCb~@^sQ(6)c2H)ULnXUC)X{cWQON&j!+R5B-MeXDUb16$h
zsKHz%=Ih*AOv6s*CZUmNj!RDUB_rj1w3w`-bM&JpG}7dpJz`9UbM_c7S*gUC)A`b5
z!gVs2ic|vU?2%)#;nF!fpCD3ZUbQk@Ii=iO%s!!}dDP*fZ%W`{YqCBR=^?5~Iz4Pn
zHlT;7ed+YDHQ9h3qQa!p!`5U2dWZ^RrteDHp&qu74d@{%ObaQ$L#PBTr8U`r9-_je
z)5F$e1A2%GlTHtP%X*&NYMx6gG563^x9I#@SuZ-5mUuPq<1~+9Xk;!eO<Iw;v}P^4
zp^_N%1s~R$`5w32Km)(Dl$b=M!H2i0M%wNraz|>rSed^zch1y@8m3l{tF3BL*S#xk
zE0+r-5Dnfn$oMjWQ0kp)0?~lp**-9VPzv68iw5-0_J8U1&Znqn*J!U7Fw;bp)pa>J
z)pD`+gsR$cB`vF5TN-8tDz>JN+_+b=nPWUT=WOm33ssfZObA!_JHV4pI`PGm$*9Gy
zbabwqOij$WY_g@8&kEY?Ui^iVE%n;Yf3sA6{8f{wX~kbMnUYrg^^(a*wY(hBTr8Q4
zkVhSpD<zYWYw4G{s4*EKFTawMYk5JV-5Vw2TT3y$Ix<aa_R`4osM%gVJz^55OeUmB
z&0Z1NQq5<l5t{-tU2Kl&V$Drqlk4RE5j|<qc5e~WFw<zRM%$|=nn80_d`8pC_{LQX
z=$F}-%HYOTNx?4<#eja<x|v45JQM@^Wyc<A^vgrhhhGT>6XI8SjTsu)n%=gGM|Wyl
zO)xF&UgK|>2<}!)${9wuQa)>HvtIll!c}WKU(G_!5F!<&_yI%;O7X*o;6g2T(q?ZT
zT*jkL$<QIVSWBPGo<6vYmrqHFwcO9!K|^rAT1x4VAuU>Vz>p3tbfCeyg~TDsU?ClD
z<=dfxtL3v}i0$NUmlv*|TrT$;_&XAdt!~E%Ts;{V`j{Skd`VS9vOcs}-=`Dyptzrg
z9=Dq3VX(bd+{E6uw8}hn$UMg*Tr#dIE_t3S>v8yabAx`^+%{_NwGLfaUSAt(FwX%h
zFEbmU)hkMx9|knQT)1y;0cbI@^DfvNJqKGMdWV6XG3XPSF|hFlC^afF&}&8S=`HEI
z^g@!5a~E&RumkHvE-{Gc*xg?eGnBz+M$IX4mf6npuuf@7L>PQV)G0Gigvpl{*Kh;Z
zg~*-ZV_H<|z&epS718;Q>lDijl<}l$FiZQc>J-Zi6k$?zN=j?(i5+G<TvcT*2{iW}
z=J#*IHm9FXTH0IsoLjY%5QslI2rdwJI1qgG_=A8X){h(d2VXyKz~AQT&D*Lpx~<}$
zLgKl*l&2X+c0cBM6#0GH+{WhlQ<43*nW3Is6I~%_L1u>@Dahw~aRZ5DR*akph_0wd
zfS%c~g#{@lHb^v$L=xyTuIBA!S8J^uHb1o|Qb22#IsNs1;pRJQ19>H_IMU>kT-|+?
zTAL2zkUMT#AxJ9Q?0VX&*D)uYE+@eDZ0SVuTFw5%_h6}b(^9FmYSiq2(+8&FK>{g%
zF2r}EDY?*6%9jiAJ#i`?B&`(dW=#Jczyq@-qr326t2H0{wb_7M_Bg>xYSH5aTs^+W
zu`9Q>Rg-)8Tiba^>Y0l{Hf8hz{Nx^a6}+6}9!wUboOE1W9;Ccj{-T5BAW!THUXJ81
z_@F#UIW6;-WO=Q&7Bh8IQ&KO_*bCQ2p9@u3oim^y+6lF~rrdxhkKZ)6AlFt0TQyOk
zefuO`X!EK*$7bHA<N|FU&+9HzRf*2lrm7M>ITb|34v&Y({-@PV&x48_zs7Q4(3Wxh
z(STp;=plel>o$Fe?TXFNy)Dt^{jU$(*f75>)s{P5AM!2sw0_o!-@W=+14GC70ezb>
zwKajzmO!jzXXM@1ifs<v+Y)FlIewJg)@m)v4Yqo7sm{ncaIpc`kChugoDN=Yu=ShE
zjUPk@E;iWevDR+JmTi?~Tx=d~w`Cg}Vz*`4vbFngrA2G^vrc?#_p?T#J#}Pw&}LBH
z!-F<gO;l)PAK&Jh2@CbLs_y%w2%p1<_?=aD@D-!`tpF>=Dy!+KgRECw-q2tk9xJcr
z2(q4>{cS#Z6)vx?3%GuBdkI!-Y)2U&#+I!pSfM%nHA$Eo3sQc9skI=h$G6RZzPG%b
zD9C2^xV|Eo56#`Tdtx9+651Lg1kj54;|v!9Xtdaa=O?e#>`(kCAQf+tR%-Ue85*SG
zO!87OZ{i0GDS4B$RI@kn<A_w8NkJ+8UIFub<UswmN5c-NlISX~G;}Zdm4RZ3?fcBQ
zCBW9m)oy)Qu=QH*`+}`+>QVDpF@U?VVPk-mTJHOT`Py>d7jS)d-xqN8_<dinl?O$h
zHk;%-%7Rp+6kdfEq?p(=X7s9tMAMj&U)(pEn5XLpDaTGPn)&AD@lNDv{_Rzs-A+l)
zI|pbCk?qv}#l)VM6a4CvB({?YD1JKyc_d7b^3a}=m`4w~o#b>!`xX;xPwiVy%l6d1
z<)J-A3rbWWBEQ6S6w$XL2B{Fu?Wui>iM6NpEhjCfRRUCVxi~iQ8I~X-2`4rp6EQ(l
z61ftY9SI_m(3QX{E$<-@QYTwEgA*haGrgf#wb@sgL~f}H<Vgz+dk;X0BGHTg1Bo!D
z(L1>Ut?qp~D@aP|gguWHWc372B%#t`o1{a--X$3*r!5?@cRU0VVM^^uy%bZLgo^1p
zVy|K=Eolfhzf#Tryr;**Df445-b+!-965MvnX3Zjp_8%q$<^1FObykPH`?3xn**}X
zY0D@XS6d&>=v`V{U0q&d{utNLV4joN%Ii=~j-vM_6bz^@Z<t)wyv`|S1zO9<G?j$R
zg}F_YVR=<@L%C6kyEfeO3dh2}*`*cbrIX6b>`PhYw0`8>%<_6CdF!fqm#FhXXh+-o
zdhzCwK=2W-JPOPVVZGji?8fKAhv1`xwtc9oteI3^e^hN<xU#mU!N(SFe!`D^RCPiB
z$RE09tJ}Sebz7-1g*kE0+74D|Ypb^Q5LnL}S!6sAedu=rN4z&=aJ?kF<D<XR;aw|w
zt!^*p!P5l;qECPJSx?$nyVa88pIjZV;MP}8Vtd3r`8ts^Nz@n9sq3?}UBx6kjC-86
zt0(O_u!o5i%}eg;!?lg24H@RI8vCdDDt{WHH6w}g^aYUxIn63b`JF%~32*c@lc{=>
zKqm=rA~Dq$Oi9(71UgB06NxDe-XzdT!kb7;=C;1H<R)Gx32!1X#j7M$ixcQ1;Y}nr
z=60&I<R)Gx32!1X#j7Nr8`UZ7-4L$lP|&=Dv);TZIiq*v@hchT*V5`b8IH<FC{$iw
zUsIc5dMxwsEBR4As>ek>Lg&^rR#VDcOz7QhrZBG_dBE)C$f$CpnY?bktGFOQ@v(WQ
z;G^2egXLsqRt7+2B~v|yw?%!z{?ifjC-?}ref>!yKXPNg<Y#JmN&SC4Iqm063Yn3Y
z1blBYlYVDX$c$Wg^u5VU`khH4Gxh*BI^2ys>|s>DkohmZ?;APsyX$X)dDP|vO7kJH
zebQ?||HvOY7?z!!_soaBxGM3wt*#mOxZPldwzg_(d%e~Ue-lTL)GnUS{&fON!aF|w
z*HKH#yF_}e-gppy6IP@N#hu-1EGRJJfI%fy^1P04ZN0f(v7lg(dC;fa;4*G%L3L!w
z=v^oi|1}Na*57**+Z6|ItgTNrNeeA4?Hvk@uWtQLi}-*eBZ9bq&FQ@OfaUz&fXbQ%
znd+-HGkxyB!?XQ3_s#h%D#y(J$g^W6)P%~L!sYcf=0U8HQUh#8pG6HQsjDlmDT~Vc
zoDOYyVN7FzxxFP&UfgS2f-A&d-V%8I<}1?TuJ;QXMvFVgOH<B7aE16x#MW=MwzTlv
zWH84^ElaTB{Hzx5qrb8|Hj$s=T102E;%7ZKI-je>M;BWuzCrmoT8kc?B)VECVSAQt
z$s7!r>pf&l7e8Y0-$^xJ9T%zn)#F<4J!96AP_gzMr9CZdF1U=l%W04a!9MJH<fxob
z(eV7qqxy%E(T%^5I91&imuNN?P;!u&Q4Gtw-@>Nn3*@lJ6{Ky->!UclD^d%W%~h%G
z>T}xkTY6sE&Yria?<3tUPDPt@;^y(OZKOOIVS52YdniY*if9Mr=mi4pAZ)K1Xb<J+
z!xP(3jyrAa-5L|`z^EPR?t*n5&7$%52Bb|j?iznD)wXMJvzu|(>3iw<O{jTLk4$|f
z@$$&l4;@AZ*xRTN(S3E03k1{VL-V~{{mrhkvcc?!8%OmG75NV$Cw|1zSkStV=kd*e
zDdnYdL|9~wm*Vc+lLIKZ*uSBnHWWK>G)@*)_caeXEs*!?+CvZ5YwyDN&`C2^897`E
zN$Oy(z;~e@2Rq+Q+3s*Oa+LGk6zx`!|6aZ$2Q=SJ&~CoJ!=mH!orZ#2JNnb68o5{2
z92ljR-PTG<*nHZxKzAEPjy2mc!1xW<-lZizux-ci+;m0`ZricE_;jYBwD_Y_-#ZuI
zJBZjVbdlcK_j=6(BzFSJw?eGsNO#ftVY}PpTepr$M=Esd#vYO6n4N5ET|=yl$X0g4
zZe>_4Be3Ki>E$_F(pY8AzMI4O(n;pR&PnEh<CRtZ=QY%ybk5#XWmGma*40<mghP=(
zo60IDR7U^CpN%mZ`>U~Ta!sjSt*W-Myxu67tD^MJ$_D)_T&sVXvL>5}U~8#=RyOEg
zVe_t-=+EZbgr@QJ)ke}>o?!nnYnRrTixr~K*j6?F8TresBlm4af3|;_b;ebd)J%%P
z@sS52L;`K7GfzKPrK&RXmoY7=s;ek5f5tcFHmXRw94I8=L)s4%{QD5s>IY43C^t3R
zJX^lNRq)*{jvOwBtRqHchx)5hYi&HP{K!C~#p>~!v@J(un#i1p37cbzkQ{lKp^Nb)
z-l1TM<{-tq^=_aQEpVjTKG2Qb3T>{#G>2p6V)ce{NpO%=&E<?(H58iCP!nnU<E1ys
z=v`AAF7JKHh%=9h^iVNr&umGWY_Aj=SJF@}-^bV1SC@oC<Ev^*!UaWg!TQ8xl=?I)
znZ7BiGtQTgT*xn1(Z}9AmC7)pXyT~c&`48o+|+@0Ld<5i2ky}fG~bvoY(hc7Xfx?t
zY7S1*qBlOxdS%Jz^)aUqHQvcJaw^f>ykIt1`GoqCs#xq(sa@$enSGE<PwA%Qr2Y9F
zZcp**<i!0Xr7AgTe@U5`l(_ApBggmBl@2ehY<1YC_Hq!X_I?{-PUNcc@~P3$o6G@4
zJEel6#*w4?giH&ZC{tPeLy?}Ld6uhST(qZ%-m?|y&<56(gyqb5L1SYoy@;$^5R&P{
zlg+<!+J9)|v!Gzq86j;C^|j^_t`fPb!Ml6;-;7LmQ9k2}Ty(EntTeX8WCEL8%v>(f
z$`&gvO=XMyKjzK^K8hmy<D(#=B4$0KqDDoH7f!ego`Vn!EXoM1qJNcv5J;3`<c#;Y
zg5o{isHpK+H>}rq$9q)Nc+V<oblr8lqoR&?y#KGdUeEMY|B9}jnSlM#^km4Z-}k+G
zRb5?O-92vfMEbAbs`>M|;8_RxV<<80Nn<E#Dn`vzj&AIcmt|$xSnYOh2?i%p^E48a
zQvCOZQdQa3V-4Bq-AS~#XwuvUIv;7AIdv8%69d(V%iR1b$^5Qh>;f?)D11(sOov!~
z!BFlChS`0=sEOl7O&n_{oo9{Z{ISkb-Tuhdu|^###2ZmN;>}it)lOY;wL?9${I3vl
z>xmd{a?^S!3A*6+OdYW_fWka+UR2y;I&-3RRzD{<VDrCbuBLJ9cxsN+Lm%htqsLFI
zsVN1J|C8HQ1DOryVV_vcVa2F#%kNB!lQZlZm0q|w%~g$HY#|=j6(^MMoPL_d@mL(0
z*l6XG^)GqrGsXJTyp>Or^Ors?n5LY`=n1;yJ{fa)M*xbNJX8WuXHJj}KvDYn@%JI`
zc;Jrzt}Xw1x)KBG?#!d$!0_Lpl@6opo&{hYiY!C1fymDZSsk7?D{wbNXNJ?J&zel@
zp6TvDVwZNSyj5Y9ma8~*V>{WmS5;ZBvdn4^m^^Q)t!`X~@;b~K!$PY1Pds?^n1hDW
zGWtU&Rt*#&BWW<3U2j=4YWU2_bdFy$cKpQQQ97m<S#X}?HKR&ca_-6w_0%OTIQ!Vi
z5*JLDu;g<kOI&Vl3Zs-^$X;+$7Sfh9);W><Rkd9sl6MibYb5g5%XN`P-s-uo(a2j+
zS5k>wyQLYNQYLKf8cB%@&bHeUm+Kgp`5%~;G<4bV*&61Mw`~=6)xD$vaSYY`j~Giz
zk{v0nVUA+%s4Hne9IeLx*+fZ6vaMzfbL3jh8U}H+8vo<^(pQZ&lPG3thxl1PT~dx*
zt69SV;kj&U(auPD|42z4%`0C%!m{him$!U$UHS4Mi>Unhljg`J6M^jF39&?J?yRZw
z#hkiHGwDPwZ*tLNQpma#p-oY%%hyawk)`Gl3u6ml@SmOe^AWDo@TuZ)Gc#t*ucsAn
z;*p5c=1rPCWg>;9o)(JaeK)D@gn5m#>p5=q4fImNNi)QsOrcf%4U=Y0nJ)g#zB;;!
z^W*F}Y}J6e>Eh1jx`}fqO`cva&hF{#xN-X2#+mY)06jWVF7pr20~+}gty|(xQ)kyZ
zKl-cD!Uiw;C4*CBeogUD;s0QurKs~M-z8~X07J>sdWv{Zl6d$V?X6w*VvD|^XHU<?
zeM$0p(lu0oX+Pn*izdIA8P<(2f!XzPzpB~y!tP?pK9XQY-71%C6j-`_e~x)Ta>rEv
zL*iBUTJqTrTr=4&XB7{?T1_bS1wDO^<v>cE@<qg?OHoW?QtJLV{8#G%AjZvC){J#&
z*gDRmi%(Xd@{aQ~(~y7hDgOXV>ni<GR5{-JO4Hud5fPEKAWGZ{Uy`zDsg9#8@9N1O
zt{weZo!Sd%*9_5<VR+@CSS&zG*J#n|w0c@TLQC1Bv+JYQ0*>5M<-&Di)uQ!{33b@=
z=Eu6Qc`2*vw;iPw7AU!r)WY#mfLQ)(z4%!?f`gXn`0yrMTU9|SgxB=Tg}KH}L5T>}
zTj6D?Jl359CE_Whtn6HXJSL%5t{csZ?3E1?ubo9t3R_?;CN_?ISJBb(+dnZKEwTL*
z)6pv3HA~l@mRND#S<CesXHJ_KokbmJZXpn@TL05C(#rKxGRi><YQMUpbRq4xuE6$N
zVmeLx{gcpX+V7u)PSbu@A6?<?_fN&BX}^$BI~+uJfYYr&jWZi*l>1k8(B`9<x|%|Y
z!SBMMXZ8&AO$3UP)2k&ZO3tK~q$oLQ>bt1^v@Bb`*=6>;nbr-O^muBz<<3v774&qD
zVY&Csj2u3*#+RVuY>IAa@q=nx(hQkDOI}Fh&q(vyo)Q#d-3%@qU*&|8?Jb>b(vp4S
zKNrFA{&PDb-hZhJLxGmoo#gIH_dKCgPI%N_NpHXE6DRX>@JW-oy^cekFi|<i=c4j1
zR(UR3u)b1=vADbs))rr70vFV?42jO0(?EBP)E!?#zL~B@+?y|2h|3jOGn2)LilLv&
zPo<t5n@n#Nm^(}SwBCiHoS*6syL98QxOg`4`1%tU%$hwVcLL(~(pVTgtw}t!ipo(Q
zEi9fLm7VCJxi(trNJ}2+KD}|n#eZY}I=+f-W|-WCE@;jtkPBk6Cf@~Xf-vWT^=p^8
z5MCf2y`@a>!|9BCNNWjw4$}ISA%{&IcaZq6baAGe&E1eN#`%z|h@=OkzQfMWxA;F_
z(_e$5Tojj@CyD)uGpxOzw%#Sz<ka@z5fZ^5L*i#e#;Pycj4gn{|Aiwy$tMRU+IPB-
zr2E?C%me+*pP#37=;J3UT}PLMX0>1y5G`8hPE$)FTJqNYk=dDsH5jX|hbkaaa`HDX
zujsi0f5yBjIaX<+m7OJ8gP8>?vE*0<M9Y=%**U8<7^|*_Dj-sz0_j$jKVvH_IhOxu
z@x-I(v+^$-h^O4F>6ooXxKc)rp6B!Dja<p$N*THA{PCLW)ATv#4^Df6oOc(U{S+~A
z-(K!!8tde0e%LkaETBy1{ckljB`Gs|3r*=TohR=lVMNyuXkws5W!piecNvNIe_5|L
zDpA?$(^E?qV`ajxbOq<``^$ezN6F$%F_}_dH-D}jZuKU{64h(Y59R*F5|v-&@}p~X
zvVP>>BH2}5bcssV2jw2ju5zMlWO82Q-{sk5UUZ2}){Ff6NW033E>X!HTdgU=k{k!}
z?olmKG$_{cw(`<pW-k<#tUm^i6fa%b>an$Sfe`(#6<qr`Qo^Fuhme;l9*!F%<v1HH
zX0rYzZ^^NBa3_Y+3`(*y;A;*cxAJ<;F;oq*mNd|HHamgV9E;=bObLPJ;H`h@>b#(t
zg92WzQ>xU=-7B%?!oYbUrcmtj0desP-l*EuRpRI`{9mprRi$M6i#3Ok>o3+EgS)?2
zb1aVjLPDVa!uprI{=zy!mi9Oz`inJ(kn1nj9D}>RSc5F`3CVf4l9y=IPz6>y^3Cd{
zQgFiaed?tu8o-xW!3obd!FM5ii4~mia<OQs4jw3N3Q}-%dH%-+^1eFit7^u|sr>v0
zzaB@60^~QjnM<*1pei_TX5$I->L*6$(o4_7Bj$(aQ(VS|7mPc^UP6$&6;(T%`zIy0
z*W{US`|r{GMw|{!u87y=B3@T$#Q#j>cEt6|O>)OG|2aNDq_@m&b;XOgQCQs9ILyvk
zQ<B0KAr2rjL6VQLz`B{WAdJEW8J+>DD=Z)~rO=tX^)Fz=g##k*6sE<>ZVYXkEc|_&
zgT-Svrp+7~ruB-W8^tR)=hK?XA!<fwl?z*9m{p}I46(Maex`Wr$Hc~|BPYz6E#6Vm
zIA>yAG)ilw=(Pe1#B)d*>8%cv#4AO`1F8qjpEP}5J$2fHCe{p`dt$V{hKN@KG`;I;
zrempV_)kF(vr7au_kL9|z#l9h+mKtR8>Vm9K<uNA*UT8A3rr=?#!sYGskGi#+ypXi
z@We5q@>jJiJUU&Tj;O8B9Vc%wdeMTbedzmc>oi&PRQ|i}Rj;C?$L6n&^@^o~5HFju
zukp>BJGGiFs9LWVo>?<?$c)MKG=RDF6X%M4kDf_S|I=`4Z~CyextHQ0`A&g}q*685
zT*mwGCth9bP!NS%FLpQdqd)=bl???<R~NGnBlE86*&5bEAquaB?1d!d0<K7;Su_HW
z51kl3$FAn#^ZeFxP9gu&s-n<X3WfZO-FYD*aL!b6#!gj(Dps4p@HwllUPtMM^{Z(J
zK7<V1a5aVDbG+Mv!<RxOyjp`p!Z2L9e4102>xr_JlHVSRDLy}4b;;D2O(sKrSI0WM
zF$<sb$I-J6_bs8zD088Ls=Lu3qjJ6!D&d(?ISIoW$z@dDwfejo&-SqXYr|FH3u>}`
zpR>ZPSEh+WX`SDc($u%PP9b$6kEN!b6sSOzZK~k6vh$9nSrM!I05xI24~`VsVx9F&
zeG(suN>$Nxs4!MCa71^k=yDBRZ5I)-T-(k&T4Y_Z>br>YU5%T1^K9XHwVoZ|l&sc$
zC>2!evOhQWrce!Strs4#T&?Hz=vh}}t%LHteaIG_w<apT<m|yBSJj0Uj1NM&a`SpU
z?YxiUX>JQ@s^~X<nwxcd0eqg@0(uYMAoXNUTmESA{5$dJjfwO|PqFlNzMKc1F>5Bh
zCse$<IQyzk>mTxO`yMauy{*bS*(Yr|-;tXZvA&{rQr6Xp@bbyD!OZ;{W3#K=Flscx
z^QVp4YGm__nj@F#fe$9ROwT6FWlWLfPoFg_T2n_Cn&{bp;xbfm??DY8H<s>*AA1}X
zWb$x_Y~Q1ttXt3dquXX18mICZJDu&))V=Rw^G|t-EY@{sq^?IikT47CI6T(*z}1d+
zOH#Uvng&-TDOiJDs^Z<;ja|!KqT+RvbR~(oyKtWN=&I7?kg1DGm+J+(sBjS&8i{pP
z=@b~V((?v1tC*;VlcM?bVwC5nV{vq^&Y7iB6`D5`Em5I)gV0r#nHN^=h@^@h#ulA4
zWg@*5K+OKqCE(l@D9tiSF?1V(uA^EPedw;s!Sn!R>fPxA2){Zw_taqP_*6U@yf9@A
zA4^E4PsQwVld38@x>?WJnK^52jdihpfIU#PhaLK2T=#+%S6q%t9CIzI#yKT`DyB4Q
zVD=08s`?Yv+}V?6&JnMor|W{^DMH3q$XvG#(9i-G=pA<l)ZWC@FlkPMUz}_aG$2(m
z#G{1@_e)!#55MYa9DYe0AJ#l*tD7|=I%#%2M}~YV%B@uv>I06S_?Ckc?iCAXUZ}Po
z%|Az>6%vl8r^_>lMsfPkpN9T*#k{0hoIlXxwEC+VrUlEp(YdOB<4gjZKAm0(GiwIA
z-I*?)SCy=6`z|8BHMf*yXB(h(lg<267M<-!#bTRM7EH|69ke5rlew<b$v?a6GM&7M
z^)6F!-yPaDm6JDW>oRZh#&M-qQE#*?WuVj>E=yT<wpEK2QKfBs+^S1ou;XSQxr7J}
zjWt8*l6#rG>1WNO<Zk|1^DITJ<t}w57O~>2)F{O)TrM?>qa9hNckmQbbK=)^?P$%T
z<l51iXK}P63FG$$wvrw!vac($W+c`mO0FHP`LN`@H&ia!D0NfKlgQnWRm#fElaSM(
zUF`+URu(5g4}q5<Sk+4Byz?=7COZn6e#(fg>rW7NLBA(zgQrcOHF?r>+txnq_BwZ*
zG|sPuj0Eu+L_)^E^2L57>7iak)#5Vq+)1-ftf7e(Z>y?cowy6Zx-31&dfTjjyTMIU
z8mG~_FZ>H;?dqpb>NjQ5+)3g+m4w}I;!)!d_jGm8)Jb)8hme0+>uyprJI<=?$llB<
zFRIgLEvTPefSr8MJx`bU4-TzCm=P^NcG7e@c$nH*YZ{z4=h7=V=1wobT6UF%TFYLr
zP-}VjrY~zpqp6!YcebI&oJ<2~mdP|k4x!1@C(S&*0J~|kCq)~~?6PNqRYB`*#`Hkt
zlj_Y(**E(%m5e<5P;r%(2P#(oBi7B(?IzY|<&}y)O0yn+LW^v~dpH`W)YEHTrk*IS
z<4mDfj?p{&Xb#VsWXxT7G3r0qJsBWh5g9m>I%Izq;xR75LiCEBQRL}W>&C_!@q!!c
zT@%(-t7)@m&5Mfn{0YDNi>cA@g0W&on3h9`cNefz1xnEy-Bc-S303LE>OB1tv&X{2
z0Yy7TTAq$+)$GdBk5aM+5}NoGS0ZN7eR(v55X1ERbzs(LId2&l&Ck%EDfh-n+gwHZ
zA&}QXx{5$MP#N7nDDI)6_j<~^oF-1MpE+%=xX#o-jdR8fD;D;xN;7C)nDWzhOJ8W!
zkZhrKa|V{E%mLXl#qC&3Xx#-gSEL&KUns4<<l~Agxqp_K;^0IswqSuw*TiMDRa41x
zMPEw)hZ~ASc9ncwsY>oYPb5PQ*{oo{<K{V08i-Ps%D3-$j$8XTP7$4UebZbzK&hRt
zzU$ydK7=mHPLv~GT0R<_NTvBNW8R#4cNt#zxvBF7HB!~n!f~0)%)%Z&Q1@tNki8^j
z_UF0_O@6KOFCY1|&buh&(>DK7k6+`w3phTF^DfJn+2%5a4y#t4nrDouMK)th4YGq=
zGa|?2tN+=0Gl?QDO_&MfCQ7@?1;_NKlt6Qi*1zP9X{<}shN)4+#Q{H2D(r@LGX+O3
z`Jb^ilgQ>$R|({DsjCzmxg;e}E?NJQmrK_5OTW3)RRYCKdz)3XIt@%Od@aCG&bt&~
zD5qQsFqE?`($Hj}rA!jg{djX`*NG92_v9vzm_(DPpWSF^ls9)bX?nC_Qq3yoYOCm!
zyH2bdnl+OKfnyJ!5uQ&^d7@K9byTK3cTvv#U@w_}<|n$%LG)CaIrZ5ksn)|k#MwX1
z_E?Xc8A;0sYitJd>BHP1yC7@FfX~0SSfOq`!dA=z&8?pi6|19sPk?3z1UX~-^ie;!
z&b3$nhp#G{Fc8EG>g$i6GU>#cv5ovpHhKt~IJ3_VQEgwk7KhF)1kIm-#GcS=m^E+q
znvRNHNmczP{wZ*HuJgqDNozhdG*ikMGg0t}N!c}CUDTBcrb#m<M*lQ0bhU%#sn&4w
zrUbSkGox|lyt#D1S+kvucqgQz?-OsES>s4_6cI>PZT%^LxW?wx*Ug$aWsQf2Tb5|)
z16K*twTCIYLyp$ZuA{3o_H#_ZF|&&~><n(82lY*qQ+bBRZ~cglderPdW)403Z_+gJ
z5+*t_PntPt`iXQ+O|EozjSLJ1wVL<KdzWp8(JwV!7^RE*cqC&!u5`I-ZVKO(<$G9I
zHOL;DW}kvzz~B<xY-5k=d^nW<Hjdml)khKP16B$tL~|EzAw}utRSO7?>n&9I4>I##
zVva3;*4BSXo^QzVot0U(ygA_#kQG^8mMee0xddRv7MLT;o6If+S&;>1$?|5(O8{1M
zd3le1tfrf63h4PXokc-qq5Jdw$4N)jnDx&4kXO(}cY~=HnvC?_7v!d13bM8jZzBt_
zc2B(&QVO+z?AyWEeY*-wre6F{#@d5OkExfOFI|h{J@vA>NKB?)RvQb?k9kbJtTr5j
zsh8Ep;$!M%wK17Yy{vASRZhLEHW;I+m(@mNpSa3t=T*&gtTrUmsh8CTWHj}%+GtFs
zUM!fdJxtk0%~ejltPT!4gT1C++!f?+5~EH#^^z;O(5V-bvhC{hOYNR|$?=-c6=WB@
z_#cwGr(OyHa8JDyR0?=Ks_!wj@?e=9hh0VbajIikg8yrT;+dE<Db265nVkP38JhF7
z7QNE5Asg%H@ffpdsrpFq3>f!SU%Lv8ajkXXqI7uED7@B87ncPtSqfZ*bpcweTr8_|
zRkR(c>5Yw0O8Anu?t`YQN)RWioC03^XTwsQ+@XTiDjv#`k4rh2Jz4Zst@3mU-BYhy
z9HXyR{N$A)S##A|XJwRV0Geur#NKhzcc?VTx8H_q-Et?=rl6C3wZ(Z$lAEhZk{7tF
zCN<5Khc&5QS5vI|s&2y+C(+p?68EDPkwiv1B6GS>$4-|nl+fkK>XxL$C{j}1eq}z&
za;)u?!voYY>yEc}Cu1&`UFW$v#ByssSBF|vDc)o5dt_MD@UFo66N3&JQMAOhbjec8
z>Nfwbas82V*(<H0<Mj8w@j~lQjCcJHjQl&9ZGWpnEZ6>4hnl<ntqxU3`;&60Nm&1q
zH~P0m&)M;_&;C=izttg@Yk#Xl&E5W1iz+=Xcjlzovu7=^@3$K{dIsGzSwP*0MP>5V
zV(~0SahGUy;bkGL0sTvdRbW}p7gY13Xnc2h=vCAOmqk;z_D#3ejh_5|K>t0X_BrDv
zDM~(6ynv#d0hf0@6i|r%t?T|P&j}>&rYH?i!DXQg5KsQ`@0zP5exQ0uijq%HFQ6!A
zz~x;i1r&laK!#~_KbpJiS3M-qPktJh{WKu^sj5GH<hka4qeYve$IjC8ZVuH?Jm!ub
z{>O^>6IAN7qj-&WU0uJ46Q|DTSCvJ~eyFatJsFh!G%)+AKYjXBI+7*Keb_teNcPjf
z?5C>!;^UvGDza$V57mRS9%Mfa$bPEoPanB1>gLR?%Kk(4L-ioresK2FpzNoC*-upi
zav%F=KMo#fTMx>9sv3~{*q=TYnhO5MCO&dH$3-o3V81N!-~m~OvY!TKKUEE&kAF&k
zvWSEGXC26X8c3gVNiZP$eO2zG^=Vjm<iKF{#40L*J`Nt(Kld?ceYCo<A>!YyPlL0c
z24z1D%zmmGKp$C_f?U;4{0mD2a}xY<;E<|`_Q&d={c-R>`B4gsf0x49PlK|b24+81
z4G<syM9sE;Fi`Ba<EMc@H&94LXkF{u2^X%F_pkZC1p*^Z3IxP=J@Wo45C|#1+rM_V
zKk$CsqCns;%6H<|Xj)Qj%Kvs)PpM<u+xwRfXZ^MF3kmVB>*RkOC{uoaj_j?n6#FH2
zN`-R%d!aABp`Eqa-#1Lh`eFXNjd^eHRQ)=#NBRlYw`*AFix{i=y7(>R_}PCi?3YnU
zrB}IqOK>e&e~SN620qLN=e^3W(?6f}d)eiX{=a~J^<G#%#dha;=no)!6u&gbuhyZz
z0e!aPVb`CIe+h`+9f1EO4S$3i$}JxJI{jvl|Dr{z^*3!S&c8CQPp|x+O!g>#l?kb2
z$4TUmsCzYj)9bN*1?zj||1`2k`XSa2a{Pq8C`;AX#qVBFe|LfU+dz~5A?Dwo_3fQ$
z{yzfp|8Afk>4)<_#`?=_Vcx6y|3~&Heo>BJE!&CsZ9$(+<JSh_cMstIUc(=xzZKiT
za+m$7^6Tm^1>$!v(0_!EU)J%5<7ErQSpOpBdsY7dvPbc2<@lw!9gFz&p~6k$_YUBH
z2=Fic81t9$0rd>o3~jeu$FD2N9`P@^TN*~#Qt)r*gTDjtCjtK^|HS;w>q}v;{--zD
zBmPe2clJL!_~8Ez@IL|g&-n`TCzwB=IH2awLb6BvW%tPVw>#p$lMnvDdoqEY$IoW~
z|7#?J@;|YWS^Qrnd&J+t{Lc7S`rz*c_@4#*-Bx1$B=dX4|M$-^f8bts{CD@kUk>=6
z1N@Jjtl{T@tCBvh_WK~&qxiQozcc>*eDL=L{Lcgay}rQwDSP0pIH2bLZe)-6Ga&v|
zKKO%x|3$!m_9poFnc9-XXjAZA@&7y7BmTDgWd1ngKak2Z?f>@!{4W9i`!YEGY35fQ
zP~)E<d&Hk+erNx)w-5eW!2b&1|LkfF|F$Cf-tqs4>=A$K{qFehL*<#qe>~t%0sdpY
z#QYiN_lo}nvPb+W=6A+lj3rI^BY^)^z<)oDZ&3fA*-=E_JN|c(J>qY9z#ab(m1oL7
z9q_*f_}}~t^9TA0dfJo*tmgl#WRLih%<qi<Fe=WJzX|Za4)_myLBqeRMX%z!`k&Ec
zkNB6gy5m2>2meCA{|4aS@mtJa#{6r0#D80|NBjxqcgBCD5B@mde;e>uzKr=R#KDp_
z1>Y6_9myW?FMiM+|It*QY5pt){Qm*`$9#wRgUs(0{|RJ|_?wyE8UHap_*($~e*ypV
z4`cq&01<uf_&-hdh`;F}cl>Fp!Z`l-0{;I2{!hQg{9)$zivNdXkND%v?~MQ7eDEg$
zzc{6lQOWJUpc4et|3|7t^aFvtlm?*opB-e6_!}OUN+~{n7Uz!>s65mBe-ZF62mGU|
z@c1px6EAaF-*Se2sQfi#kNB$}ll(z86#W0^gTEc{zYqBTOJ$<?mxZKohumd<s{A59
z5Pt*nN7z#EA4{Lr_&-jas-@3=m)#AOpAN}>AwQ`450Sml4=I1w#`@0ujnLny`nvg>
z4?+As1@Wu?6vr>j{9f}n1IQl5ulaFV|7j5%+C=>7Xm84&0sJcg|63nn{`4?QHqan3
z<S+D7jsFU=NBprTq+x_D1^-m~Y|8&D;Qs>fUvvxR57$azrTcL4pG)?LKh6B*4*o_T
z{5?fuqm8;JYZLx|3HZPJ67xrx|4Wbfe?|6)zmxf$`9GaVOyj>P;Qt!%k0EiZ{VM%j
zm>aHF{6~>J;!izkeH(Dbf0hsa3c&vj;GaqJFNi<F{9f^IBzwf)!Tiqn&-TH;2jKq}
z@b5$OFNi-Z1{<__#eWdlBmU%5?)cB6@=Wum8t{Jy_?N82{1N8&ivOi#kNDe}-x>cV
zAN<1s|M!4@ZO!~m_y`ew@A&_=F+Tn$mb>FmRb?FiFyQ|I@Nb*Z#Gm=S;=d)?qxiQm
zzcc=)`QSeq@c#(-r)uVJ!bgkfd&hs0X8xx6X?Oh3pz=)fzX9-f0{&-c{t>m`2=jZz
z{|T~3@o!~*XZ#oX;GYZle**mdsozKZ;YlL;-tpg)>=A$b8F&28rt(bV9|Qb91OAX^
z{wBiwUh&^oGk?><{Lc8F>x2J%!2b*2f9ZKm{Ka64Hn0A_jqFkUW6!$de*u+e8viAL
z|5w0&);E|x!u%PDVfi9{sN>Hw$R6=8VSZ=)<39Lr2K;{j{+nOI{NdvzvRC}CCws&n
zZF9%}QXl*Yz%PVkskwcU=D$$;jWEAg{2wNJ#J`yNo$<fI2md30e=Wd2;$h4mj+(`P
zDA^<a$a6AM<+2#-{Oc+o{B3}LZNNWTGk+6dey{i+teL-QVt!}*m-^se0r<NC{sub1
zLHQFFgGJi5R2qQVe(T5{#XtPKjK6dK=6Wj6wEsy1{tRfpd#sE3qbFJTfqBY#jmp0Z
z*(3gnmn45s7GveljXwBS0{%Av|1Ev-{8Q!>Dg3Oc9LJ{e-$3?=Kg|3IwioBG|DbYA
z<KGGR+W~)%oiKk=3>Im7lx&=v%D)!bBmTfEGXBo?+d>7I@^}A03R8MooACchz~5^H
z&Y#%drQQ7=@n4th5q~-JJL7*V6=}*}2Kavi{BLiM;~!cm`MvVzb+SkNZ7CUlC;uHj
z`1=6<-vR%HJ#hTX&XW9M&epl9`Ew50BmSmWCBHL&?xKQB<6jB*zXJRNH2mpvB(+!m
z^waRinco@zdwuW^1pM78Br+<w{jv@m|K{@~|JNS*e>2&m_=i?VrJj!d=K&x5A;7;5
z;Q#ez4Zj%d(q^}R`I~$E`6Jm|q{?xk_I2yqfV2O9hzc>ypV5H72Nfwx&Fu%hgZUH8
zU#@Ve`5z>E#NWjHVMqKQ^}#;@@UIW}AEY)RBzh>Esf%R9z2cu;Q>oauy&)szjDOMx
z{}jN#0pS1XZOor$ey{j{NA@WGoy_ly|5HBrqkz8`;6H#)Dp33bmzc$W2-ze4+IH*P
zy!?O02mdL6e?!23<$o}L8S{5?{z`A$?e`M0NBm99?~MO*KKK^{{@#H99^ymsFT2bv
z{&$cu;%|G)`Zh2AFZ$rW4DfFR`2SCn{}s&d75~F^`Oo~$_`l+VzZvkC0sfsd=kFEb
zWR*6r{-;87{$BeZcl=+a@=W{x+W`Mx0RIBIfQ#}c$oxwshUJU+q4xi?$=>=CrT=VV
z{utYf@$c(C_*()0rhxy!2Qh!@YKiO>|9i<E@prx}!JYlTI2SgJ|8l^;8Q_0SbNo#+
z|K$=xIzvCz_`j?<{#K@?p)>x}RT=ZA0RQHIf0y1k{xNZ~O<RqU7b^b_WN(owf7kM%
z<hSqR5&82!D$g|j?*RUF0Y43YVg9FX5cGk-7jl>Vsq%}qgZNuNmi!U66#VbeXO;i1
z8a{vGzq5DA8|9}l_7}WY^>ynHI)MM{0soiofzRK{Zjyq36An5yRsTw|NB)<8;`aX|
zDo6ES$NwGR-wN=Lra}dxI{u5^ETOw8d8P6nO!kPsiTR!94;?=E10T}Bls3En5%s?{
z;Ga&Mh(C6VWuCQ{zq#B0G_pthu@39oyyN%hRETN(djbAFRHQ65x1UFyBI1uT{|Jxx
zN68-XCz#)P{HCP}#{A`ge>=dxkLLU#-C`F1L1d5k1E0xA1-arx{nJ#dF@ImcUjg`s
zyouwVVScap4<viUA7p-K{J-<T9|Zi{1OE6T%pVeyRkYddNB-u{|MSQm@y9;5zRk=3
zAE^-2{NE4o?*RDU)Wko`{5yN(|Erq#Cz#(E|DS#E*8=_>0so%Vcv1U}-7X{U75_>y
zM)41P;g0`rKKRE2{=R_!nl~_iocX=te+Ahi{vh)^<1Yebnm-Z1zZ2lU{zc56ywfcH
zSCc*BkMV_PXaCd92mf@yzcb)};4RFbVt%jlhr7uh@h6x+X8ogFzu3bEe-q%Z1pKY7
zm_I5eJ8ARE|9i+D@dv+^;LiB3=YxMC;NKPSZ=#8RjQPFJA9`!zA7OrH{CoM}j|2YQ
z0RJr;;`moQDC2*GNB?;P*`xTUf0Xfeo<D5lgMTUD-xlz%tr<VZ=(@1j-X%@vrj9><
z+Z~UeGe1fGCN>u12U_Z7-2b!y{+@vUjDzv`KO!b;Y1>3%$Y1EE%6|&kTYsX|Q^U{F
zFvk81{>^;w-wXH!i;ZLNztHf<o{-4fi4#1>rt)`a_&a`)3K2Psx30gI``}Lk{%rvN
zvJp7`&Cg2cpzSF8pz_~L_ST;$@vr?u8am^@wGaLm0sk(5e^X8TQ!hy113luuktY6a
zyz<By|80Hnw*&rufd7czIR0f~vW+%QWBCjHRO3IE>{0wHyRT!}WY|*VKV9lHZoeNg
zzdha%_Im;TEq2BIXBmwv#ioSc#jiX6UJ2qSa?$dY%C+|yy3R;$xz4{USpP5q;n>vp
zeNOgPSxWwvuOs6ZWLx3?&OYMT3HYl3{~L=je~kHOI@rZWmH*#lkN9huzudvUs}KI}
zAGzlb`UC#!&%*o}=D$c(j$>2#uO@rMA7Osy{0ANCjPth)@DBj|^)qq%i_y45Y}d(M
z_NU4pA$!E%&_m{rGye3bB4hqOfPWz1-{?FX{|dS;A-3~9;=exGBmNlkJLBKq2Y)5t
z9|ZV2HSte~$zs~Bk-O|qHU8gf;=g!Zcl-zW;2#M12Lt{`Xi={SaSx^c2-Cc{*hYE8
z{{gZ`@o#2+XZ)*u@P`0@HQ>MYc%1*ubX`SkUh}_8$R6>x^mNC6UmyIVnSWD>VU2%=
z0RFB1jpLtT{-w$RNX?(k$R6=0nSU|YtLXm^0Q@(x{@P0YpZ}o*AFtHErNusp-E|uM
z+6`p<I%$2L*o1xv=<AN35m5j8f%tVc;`&d2Bz1?&UG}FMzi-Lj@=5VOw28a^hxy>2
z4*2&6{C__V^9Mhc$V0Q_@`K8MD%m6c34ou5y2kx?6W~7p@b}iVzZmlm_uyYo)Bd7>
zf20rog@FG+z`yHs9RC#a5A)#fOZF)Kivj;=AN+B^9|HWNW?=q`Pb9b(e+}6q{${{G
z#s~jWz&{l5zp3GmGXGGI_`j;*Zw35geekz1KXqHyCi<^^0RJv0;P@w*|2ooiZfg70
z^?wNvzk`7OqniAUd@5CW8a<1k>bGk0HwEH%gpc?=0{Djk{&QyG_?6LpJ!12!|Ak~v
z#RdXO|J?!jkMhCa2Ka{q{zlF5Ct}DyMRWWKZ0bJ#9OHw31>mm%{98nE{1ePSSj5(`
zsrj=p*`xTE1OA8){xtJD+uy!`|9TC7hWVRF)48eqy7t!r^!En(Z{LT<Z_$-fHLc{O
zseT63-w2>TVnbYi;jg5AFPTQ!5UBb?$sW~Tkn1nQmZJZg=A-_81@Su=@K;vi_(jCU
zQreW^uWSB5SAX3<cAx*(0{uG8{7aPekB}JIpKAP$)y%(CY$gLAVM`G|>S~S0UuA%Q
zB;X&p7{@Qg{9f}f!^s}ie~kH^=l|5z8uRx7{G$N>MrUFE(DyQM7kRYb^~oObFJXS?
z`R8mO{FQ+JuYmuvqjCF7{UG_h=3hP{d&J+oxx4?L=YxMB;2#b6PdyjMKl-EOKi?z%
zO=OSwTbbV(f6*6HGq5&0uXOD<1o#g@{B%$hi0b@B;3ui$HUH8?_J}{Zg**Ny``{l9
z_zwmAd!3Er-^~18^Dn!RJ>qX?erNno^T9s>@P`5a4m7Aj@z03G7PNWIzidPHh(BHK
zj{g}x_@^+xbN=Npz~3W<;~)A(^8Z&k0IB`|T4ay-JDI;p9)_&>kA;B$BGy;uUn<rX
zQ4IvV=3ma$=tuj=_&Mia&I0<n_SXdJe>{lasS|Mh$HZa@+J;*{b3fGhHIY4vUqfGa
z{h#B5e<9%i8{l8}NX(yN{-HT^>yygAHrXTo7~mIuscHWg2mFTv{!2Cd72VC^f1!qd
z3E&sUVpIO5fd2@<e}|_3h%&#|{KYa&|B(Rvm-ygs0sIpH|11B8^CxM@|2)~F{AmOH
zm;2zq7w{hm_>b0%U&_{z`7_ib|Buj&U($eoi4XoH^V|6*#?NB`|7{a-{3FaS#@x<L
zZNIwyuMNcSD4>6krv6hsq_Efg%l?}B?*#F?)<^tS0RI02{JoFG@r$i1`G-1#N1xUB
ztw;7$tZV+IY$tdB-Ry%u4fu}+{9n?flps~de<?%$PstwfR|5W<eDJRX{Ko+PrJDFx
z@W9P${^d$d{6m2M79aeb%<pV};{bnOUHfDHdQmx!P0b%&`wM&`2To4?F+hK$X8t9$
zo)m5^aQ>wy>)Y!WMgMaw(0{Kt&cApsssDn9{ySt(#k$(h1g^gf$4=<q?xX%T1^g2M
z|Gl(MN06%RC$f>`Z)bgbr`F${WRLi3cb4rx=-^KP{<B_VeOrL{p)#qzK>1$PKZERr
zen|PdCZK;e(AVW(1&H5d5WkdW{w>M;7kkwI3!3@27Up->|9w9A_W=BLfWM!v{^_}T
zVtZbRs~Z1ZHTAz_7kB-)0{(q8^&i|+>VM#&KS)#mZLA+>d(nO#0{Xi8ujcqU`=6;G
zek*ArLy)TNr(!e7&!>M`FVy(y^g}>@8qj~RAJz{Rsb3598-V`Gp;$k}`Wt6Gmmf_1
z4+H&1puhDHtRE>-e*(}y4(RV!h4o`a>PLY7@j!q10Ic84`n0?|Z!?X51JIui^v|fk
z`U%!AH2<SOe+JNhYHO^YWPN4&#x;J`wZA5yKNIM0w=LFB6{#Ns`m=!k-CJP&bdm92
z4D_Qw|MWevex^wMIM6=<=syy|`hm@5|66GPvjphR2Kw*rjrA*v)Ncm*bAW#5URXa=
zq<#y~p9}P3{jq+8^$YEP5<q_*&>urDr9;QxDC-y6|Fi=A`9S~jt+0NK^$YEPl0bg}
z(Eqv*){hsd-v;!Xfc_ZG_@}u@{S?qY5$N~PjDHeE>bC>^lYsts&G;wD`i1sCX`p{H
z&_A^r*MGW5{SKgi3edkgi1h<o6xaV|fc~jKe+SL@r-Jo2${YQ-=dX0f|4yKP8qn|1
z^glt?FSP#&bVy6*`N!!%e-F+0C&c=N_CGy=ehla@-UioyxJdmnpnnF?-%K<9i4>_{
z4)p&H^xxkD`yVY*zXIr=3H1AF#y>IEFSP%u1o{hs{!q>Mr@2V|Akbd~^bgmJf09M&
zR|EaCfd2n9=YMI|FSP#&0sXUq{{5Qsj|}S<+W*u7{l!54_bqY$2g+stUugdm2Kwg!
z{i8JFpRywLCjk9(f&Sha|0`Hu&VuC*LZ;{65ukq_(C@Cv|6q~&4Xp2+|2`k+?|l%i
z{}Ah+pL5;%r25~V?5SAy{CA~{TrJy+`MdRKF4aCB(y-IobjR<xfd4|k->8{CN*VG`
zA$!E%4ETHb;Ew_Riva)mn*JxUrEGs*@jsjF5q}5Z-^d65`G7wT_%|Jh^Cx4-zY*CZ
z{@||e{MpzC{}Sf6^G)R6#eo0$3d|qdO2*$}<6IRxHUD+_+YIzC0s0$g`oDOQ`Yk~J
zQlLLgbNp#${dFC_`|&>k^e+SYziGyQ3Dz&P|7`{O;#nZ{pS9Wh=QZ<R$s+ZWtnci9
zuK@b%4#oMGVtudnzc$%hzEIn6ZcU*5Z0Do>ya@QO1pIqy&R-*2oAqCnWRLihfPV)c
z{Oy2$3E;2Qod0GF`G=7`;_tbeyZ_qB2mgnF|0=+r(#+q*`k2N41+qu{VZdMMgFnOk
z&i?mmz`sOu{#~|><hR%yiEY~db^`rtfc}3q^M4gZ>IcNjE@^Z6FP;Tu`(y8iXwJWb
ztY2vV+Y{(t3-qt1ftZN2di^t0r2l0=|2m*QO*8)&E>gdo^_~6i^+5mnq1gWj>wERT
zSChR}m((_#+Y-=z2Ki_|eF1+n;D15W|7Mu~HYXH)R@=`rn*KM<{1LVn<ELsL{6WBf
z1K|Hm)BiSaE8D*p|3{ksH?+I#f1UjM`rzLW@ZSjdXKUs!!`qqh&meo0Kh1#u03ZCd
z%<t@fZUX#O6*&I`6_Vd#;~Wq>HGg#D-!Ra>8R*Z|%zu^@sXqbe{{!f!H2rS{>lfPp
zMu7e;KtG}x{|1ZnzX9m~6X@@$8UKcg)Q_^hv;S=Y`m;hf|H7>A)&Cwx_EfBE{voi3
zd;IlRAMNK9z`qReU!<8oO*6k&|8*|eBmP?Ej|ksr6aDX@KKK^{{(k}fTQu`eaq+M&
z+PwI0AbZ5$0{9Q}!G9UxzZLNJ(~N&ZJDBnBsu}<G+|zyh81I9>nfaal?`?qp56$^^
zhWV}7S~VemnD)OdK>v22KSDG94eVH4|DOQ*cL4nxHS-^3tY2vV+Y0jMPN4tzL%9E`
zVEwg}3Q*(!5ZPOQLb>7G8aRK%npv@l_InJ-pBc2kLi~w3&mP=G8nU@nhWMfC>yE$6
z*?;H#b9Vv%S8TAB)K~aJtbh9ES!wHos{abvBmc|ylI<tR7chkXlYsx{(>iP6qk8{b
za)0T$&2LjE)e$(G?2&$Lf2rTZhC;s%=)e9hj(?i<)p}9=Pm#UQ57~gcPqIFpURj&a
zuLt_N`fCUIdp`-;{@eSGdAR;E%>NQ;IyaU71G2ZuQvR-;`NN!mg1^BB|A&CT74ZM<
zFPJ|WlEOPE7r<2hFxeyi%7L=}Gwi(JKi&s_2Jqhl_}{q)_aB*IlK&7Tt}6eVWRLjE
z2TA_4BmOf1|BnB{`5O`si=yo}_TS#A`nvr475M)s@V{Eqe})d0`r@6-&P~-Hpy@w5
z2TT8*{pW1pzmC7>XHwYiKScdM2KXnhkMl3|SINJHT>v|w@*hL?sQy~2CBO6eZQ@<1
zgkf!VzpxeeziR(Cf$qx@n<6i@tbdU|Hq-RK!F{E^v;SKF^mXy;!|`*D-=6^S`^#J$
zzbNy2wclQ3597!D&i>~lAN-Yo|4G1qWf|sgo-E_PzeoOFLiUKib3YmXB-fS5zf*ni
z4+Q*=1O5Z<#{Ey4Z`|_ge}<4f;&0tw@;m#Vm=FFC;C}}2@BJX=4>rj7zhlAW5?*b8
z{mCBjFF8>1JI5bq0)FZ~t?`HJI6p(`Kbe!ZKB@Zupl^kK$okjZkG6xPel33`>VFZ?
z*R{XVAbuNz_)Vbl1*tlJn`Zuw9Fp}(<sV1iqWF~!ll&337yP0xqn)+c{g;k^0^olZ
z@LzE+=1<XcRmFB7X*xHR|6;O7{88p_lf_u$@AG`{Phoz${}ukX0si(oF@G67S59od
zS#UWIRQ}h<9`RS#xbx>iz<*Uj>Z`|(viVZq=C=tHoWNydkMv`#?>v6QfxfQ(n?U`)
zKti^@y}yz;1*w|9LFRwKtN*3HL;Ri0@2vkzeef>?{4WCj!L7Ld11HJ&zhXPe6`<CC
z71<;H<iWE3o&DDpKKSE+|0TfRTQh!5ohJFc+TVJb@oQ$3<afsZDj)nyLHm0d@b7#F
zj(?eW*bHs_7#EJd`}}!(vPbc69WD8t`M(tK|IYeq`>PZWYoX1n{r#lT4<6#yzYgf@
z+Ft_HzsN<)SK_kwNzM2z#Qe{Dw7-XS<2UAa*8dGY_#a_@`*<Vz-xT0)uf_dG*|{?Q
zw!Kvu^h0fby7(;z@%uN>AGQGNSFk=kUM_D_^$#F>t1c)u&Mi7d)_*O3Dg3|1NBmMC
zey;-lLCbLaNie^RVvbDZ*Tt_L=)VT^57*RRvdH>NgZf(m^rvg)Pg1N;;mO-n|EFo@
zPg=SDB5W<{?{**cw-Utfb-@2~3$DM|d9vmTt-tSB-|oKzKTWk{`wc>|w$X=U{W$B(
zEapF^of^M`$=)hU$^Y`Ov@B;+p?^1s-{j-4elzQDoRhXbsrtu|J<<=de$b(RFVNTJ
zf6vd|^ADSX_&q%y^Cy}AL=XNX*(3f4^H*>Ji1<AK_#bM(`l0is;TazK_mMr)j~yoK
zuiByiAkf#vuMdcySQ2k(5tF??_-~j$#r$6RcM#bl{?@VX{CfoOAKZxb)2#26e+Q90
z(oeCzGyfg~`nvc9LHxv$LOX8u{&`LO0vE`N^NQcon)n6Ax#RZ);D22czcSYMieE|-
zzjD@h#_uVhuZ!Ps5I?b`#*Ul4zne~=MWkHkFNX2Eo$Rf$h|Rgxg7`fH_?J$@`XR&k
zT}k#xKLX;{2K06Dn*ib``XW1S_I__o{}(ZgUw=*i7YFeZ&+?&e(Aw<d${w2jFKQUS
zT{Qh)3y7b%7NhFFM&k^TKWd)GSwAUpvp?<Qm%V@TMy~(tU&s&P3q`4c!1v0;mTf2h
zDiC;->_uIK>@RrV&iqXbCXOE|z^|+S>0JNL`Qsg^OR($R-j}Cw{)R7?{0kH=m46em
zx5^?m=N6tS`=1DZDfnOW!QTY<KOrHT+ur~FE9OrzKR<>ki>C7bMD~b3!TjwG{x^K^
zF9iIb0{$Dn$NcFlWc<DOuO)lLzj&IAzmxwhAN+B^|2g14j4p5qQnmlhTxrHXn(PsO
zq`}Sqjt~B&fd31?|Gg&ufve2;Gn)8UH@f-X^}*i)_`d@Dm(X)|QT)rUHsim5>{0y7
zj&t+B?}Ptdz@Gv92mOTkE3Pr)-=FLee+S_I$OnHC@P7mNd;E;~gG<f$*CKnwpFG|j
z{|+DgF9QDW0RM{`{?N5%{LgCmmrQr_f9`|79q|7E`0xG^$3J|X8UO8MkK!Ml;pYF+
z2mgnFzZ3AE)QR~c*PHRrBYVVOJJZeowGaLb;Qtx$AFet6Mw`v}57QifD`vU*zw^QW
zE8zbX@c;ZBj(_Y1Gyd<%9>u>C@c-z8zvoIhf8iXz{SNs5L(l0Ir0VfEexn)x8)T38
zQ&D&PfA+z@Dc~2c)U~vT*WTZ{7Uplh$&CLNvPb+aC%E~4^TA&M_}2#fPj$omiJQ&%
zA0vCjADivw4^T>|=P$bP{~mz9JK(?c51jwWf0*%KNcM<-!W=h$Hy`}ffWHUe{|7y%
zR*<UspArx2rOj*n+)Va}KRDOT-@^z0aKPUa@bBIe^QZr5#=kS!BmSQA-2ChL;12`-
z^#Ol}hCkC{#{YqaKMnYM`QSeq@b?1zGuOrO5B$rFzme=w{9EU{<G+y){szF`8}J{l
z>Ho`aHRC@_)Bnd8xcN8s!9N%9mjV8rHT{3ZZD#!2Yx@6&CO7|PKKNsRe`COZfTsTs
z-fqS}MAQF=PIU8^``|wx@QYWHS-DF6qP_2}>HkA_nDMWt>Ho`5a`SKPgMSI&7q3LJ
zx$XV2J#hOC-)Y8wB-vYK(b&MbWdQ%SKKO42{9-MH&28`dt&RC3yztiR__Zt9BmTCN
z-SOYv2Y&+aZw>fI(0e*Wq}AhZ^e(gb4<&oV-+YRjzpoGeM*#mefPZtMNBlAIuyfkH
z;{O-2M*K~uy7_nU!QTe>w*&nD(wu+A?=j>5hvxh%e43koHy`{f0RQ%Y|4_~RTl2kU
z{3A8<Z<VLJ`S%3;^-FpDYt?q{N8&!IfAM;`@5Co{{y0MRqW(kTADvrF>UV4)zZCP|
zdjb7Hqp*JXajAc_vrPJ|>Ical>35tb^=WuzZ9=~a=<CiO(xCnh0QGm&@A&*7!TetB
z=Wk?>+E3<ucl{0Y!M_slhXDWYKVbf3(k%aeB74N&c7dCJZy)@ffL|<WwzQ~5?fre4
z_@|yQ<4<Vf-+ZB)e;*(G-M^qerp-BjF&yw8shPh^KWWB4UNe8!bdj51+)H43{#*w5
zM*#keX8t|%lo|i$n)&x|+|3{I!QTh)*8+a=o<u>a9=`)moAF<xnSZam*v&u82Y)5t
z7fV|0ytnuDn)&OpXUzB`n)&O%C2sx^KKKU$ezBz0=C=2{Yx1Y!Su_5fHTlyH_(%HS
z4*~u|0sqFD`Ribt8UKcw`Rl}`?)Z=P!9N=CizQih-0l6_8vf98X8f;f_!nR1<{#sO
ze*)kaO9E_edw-+m`fK=kGyZFJ*IzGp^N;nxKLzj~4){lCj=zx?%=m|Dj=$AcxcUF)
zgFg!Rj|BXI_3`;b^hGoNUo`WNWmmfSC-~q$1@IpY_|KvNq99fK|JX}r{AXz9?>Yeg
z|M}ow4EQGk{$ZN=-}uXB{0C^_pIqXO|FJ&!F9ZCO0snKF`N!s0%=njU<{y__<>sH{
zgTEQ@*8~3dHS;ftlo|hjHS;ggtKIxleDL1}_{EYEyWh0;cWdTflK(d2zg;u`QhSY?
zf0_^eR=_WoG}zqs{&~&(OX^iK{--tbFBMDO{Kxs=Uk>=ik^r0A-d|0<k04e1pY&^H
z{FjrpRhBY;*9rJ%_~1_gesM|N=C=30YmUE}6=wWDX^y|CYu)jW`rv;D@QX{jHn+XM
zQFHtaykW+Ft>*aKa-Exh4&WbpAlE<TfO9K*Q|dn=ciDeZ=Rfu%d*Mqc`xo*<?0Tu6
z<nP7&$2_1Py&uoNq}rwM$My*$m!s+*PxeSZ)GYOvtS=3P{sN$X^j%m#`JU7lYtEgU
zs(%F8BmMS&Nquq6SZqT7M4+#m|LFkvvw(`U^TytvFc`Pr*oTsTACLN*PWDz=il6Pb
zOa6?+xA;%-!T%lL7ng)=ZhL=Cf6Sl!$c+CAvPb-Fcewda_rV|dQdXRE{zP07vbpX3
zi<<ZcJ~88eRuli$JKg+$_rc!_@QX_-Hn+Y1K@<N_hZ+CZn)tUQ-297t@RtLAaY@DI
zw)f)(;rxkxYQ}#k*;{2P`M=~YH~(TE{CxqxxTIop+xtZWF@N$iGyWLaBmTvAyZO)a
z!5;+t;*yHZZSPlV_ya4=_&?F`H{Ijrzt9K&et=(GQn9)1{g?qb{-H0-_(zewRhE)J
z4fneFFZRJ-3;4w)6`R}MKcL}{eQCyjw}yYheQy5CeDIG4{Nj>~&28_u)8tR`D>MGB
zH2G6|znlL`AN&!(e+J<H-vKy(0$-c)zeV;|ER_7Ie!$ItwGaO3fdB7+zg)u~`o@fZ
z6Agc5tDFB?AN);#|4hJtvW7qQtr`D(4S)HAZvJK;{0jm9Lco6?J*Q5Ps^?$H@67lU
zWRLQv=R<D(n|$!c0skVv|CjwRf8Yl*{$6B{_&WjrEk5{{0{*iA|8sPME{cEXM>GEA
zWRLhe9(KonnGgOJz<)O2pFsnB#2@Q4<8L5)#NYmioBuW+{PzO>#ejdOy)l3CCo}#E
zvPb-FkGlEq^ueD5{O17v2Q}l*z%OR}_iDzUt&h3+@Akp}BH%w4@PAN+;~)CfjQ@XR
zkK*6*xSRhzAN=irUo5Gxw5Y$d_t$CqpV)6^{8wrEpCw5*f2$Av4*|beQeku3`@@Ie
z_$Pli<3Eh-t+JHy!{R60{15x!&j5b0q{8O5_djd;ANzsiUh@y%Yx<w2C*Ayy`QZN*
z@QWoCHn+XMThsr9){+7B;=f(f|1>=1=6}Kmf6uSzk7;wxKZqq2Hn+XsRWp8w@dKH>
z`1@+c4-=NV`Ir0P-xTnRB^5Tey?;-a|J}^u|BfdAYoB)WKkI|P0`Q9^6*jlMU$if7
zzkzkk_+w;mm8G=b>Sx^i&->ut1MrI_2{yOA-(NTW;Q^^v{#0wmKb6nA`CszEUk&)h
zk_4OE-fyOve~Yba7XLEM{9AdOn?L1)e>mV5OA>5udw-y2{w>+ljDH`^{9DiG-2ATr
z{<r>#=f4B%Oa0g7VaV!>#1D1;dj;7GUqa#^9a|^s$N4)k|NT19zqbYJr#F!LCpyX$
zA65N3$sXx1eqQ=t?$Cb|=(in)^&{eCm$co@_V!NIe~RppelzPw*iiWY7SKO)3f8aK
zQ0lAC#ZdK6BYUJDctQFfbm;#F=wGR+{}Ai%WIN7#RsRxA{Rdg!8UOzRecknsFlaww
z{33i6o4p@Q2_jNdJ%5fezw-DGSN>Fyy;YVBw^g?IQ49FffIl-5*I&#qexH*)s=o;9
zN0><D&-+0Cu_0JL!TPh<-rlM8_aNCL{UqyC_ik-M|3jd^_C8p@qPGm_2wRx<s{U^p
z{mvI<{<gE7(Ek|dZ+#5bkFx$l9{QV;J@P;GlGIN-{1>m(BMfWH=5>gV|B6mfylj>>
zd;Dhqv+Dn^n*Jxm_I+$a-mCW8Y4js(e}ISmZ)qIAX14#v!@iU3QT!6Gxa&_`5>(^&
zk0u<y<}w+-0Ur9zWRLV0r=)(6?M42GE=ARU_;&1nn)NsHIR4#F_DH{#^_}_qHPAou
z0jwVoFZ-o!IP=>(wf@JGJ<^Z=+wK3iK>szmer@%iwgB(LhWam)J<?AC{qKSPtF>6a
znf0$$xK#gNB73BtVSV~%YZLYVBha7Rg7rh2$oP--&_9Okk$&~7?)d)%^gA@`FPd5Z
zIf;>_Q2qZvv;Lxi^~F7lViW%V0`xB)joV*zb18hAG|&E2_0K1J<bUjS>3@VRh5m0q
z|G6!3{42JQ`mwCC{GjSDCwruy2Ks*h{ns`AH?uxHo;Yt)^-~)ELvKj`o7h_TFW#j@
zJ8QF#9|=wUhs&k^&-35gJ5~QyP5rmBzO5tly8-=CQ#A44QtEq+KWoUIiVcKpK;EZV
zKghoe{dIu;2+jB@#QI+2w+l7-6K4BO6fQM>=V<aL@TROkXZ(5s{(UaS@r$zlA`ksR
zWRK!k&iXBm_^l80b>ruw!T5PLxg@m2X74xISTldIm8}2K^3StB)%f)$d#fz@=h?qY
zGQYF_Hw668T!-TqX8p6WCCU$~{u5*`^h3(uWmrGX-;4a)2<Xo`0_&$)zd|Wj)jy8x
zk$$XQ=1;9d|1Us){0yug*jfg((nEg?*(3cn){i*!Hv#(J2XX%&Wc_6x<DU%KBmK&^
zr2iR*{$@b`jJ>dax{vff?xBAQ*(3e(x83?%0R12(2pa!Hx0U*fJmSAQ*(3d)|B?F6
z_PZs}Km1y(9}q9Ar_C$>4<mb|pJ08$vo?|cTLb;yXn=$KkF$OS+uOS``vdPg$sXy4
z-jV)0^M4zlKVd4?Pq4mM{*NPjq`#Q;Bg`rM-wx?(@;}Y`ybLkxwd(&kP5yVVe#W7{
zJ<wm)59fbsds+W)dF21iWRLuB|F4Wc-5z3X!v7tC{!R6o`0pt7y^jCakv-B+|4-@%
z9schG^u;nGlz%DKr^9pJrp8|^Ger7j?@E2=@p~7bzn*6NkzsubTi&MXch}6{R0927
zf&R>Eu>XO+GXBH!)ZO!+jbxAf4*~t%f&Pno;`|G<{(c_%&yqdTp8)jt1p0$D`f=9Z
z-9x`hqaOwOdjb7-Xni=!za;BV^U!~j?2-SAS>M_ItAPHylwe3dxRb2^W)J<h$sXx9
zrDguNv%P5l1AzW`jsGdu_ws*?#{ckpQs3$SAfP`+<9}#pGyg|v{13hF_J41n|I`OK
z{%O{yQ^veaZU2w2i|sRPPs8K9O|`%OWo%zoDg9qB&)VJor>(&D6>PtWhyG-;NBL9!
zfs9{}^+o>d2jchWrC2|-tK{F!gTIyRk$x@EKLF^jqZz+PS>LPw2x!LdO{`z*@IM6f
zub+<nZ)Sb3`OB-x9{HbS{fI;VAfO-8<uB_W=Mn#X$sXxfeCTe!!-4(=Z(#q!yUF^$
z*+ahv*(3e3kKFBd1ki7NAL|Epm-=4*-$V9Dzk~Ii{Z}o}Klyd6A7%ZUJ^Y_f_DH||
zW4HgKfPUyhtY5K*^xv!h+FQdPWP4hkkhiJ**GsQq{pg-j->d)nLDPT5*nX*p{wbRI
zmx{fl{$+Xe?*4OuX8tAdiHv`e?M43=2Js(yJ@!Az`j>m????8i{-YgIzr~?H7U*B9
znLmgGrT-&5^e@!RAC!M8_2Ulx@jySO>3<Te?{)rgvZnuOVSVTL{cxZ^M$`YKSpOgo
z|3_*1pCr(q0Q5WG$Ms)PCFAeq|F>jM#RftOXFJe83g|zsX}=-XKS(K8ZNCp``kxHY
zKN{%IrUVg9w1=V-XZ=OW_p1I3vPb^+{LG#I#{&I-YvxZX`pfvA<)QzgZvKSz3D4R@
z`;P$qD{1}#`JZ6@N)P=@$R7D0`ds=SVSAxJ8R%!|&yaqa_0RO^KZOj^Z)W|BLw^d;
zzf*Jm8XYL(f0&2<zclBs@s-kl=lsP~pue$h{$!BUr{#@#o0@+cYUWRtd?EFn{x<;q
zQ#I$WWqV6~THc+vsrpTt^Vh{+y7i9(`hDp6c0xjJf8lDWuj;A4Z$b7{Y#@|J83;6e
zCH0;C?{uKQBOTz8euVW8Qp#2Jw<UX|9|!s~f&OK5{)zMxhW=kf_DH`4=tqJ6rPMBw
ze$vqY3&|eoCxQNKpda`U>z56Y^&j+z|1X;3Z#(PPvc2ek<^uh08vjGAPp3C|n_B<B
z)A=*<ze03uv^n+X1O4wc=g$e&ug+6<kN+}ckMtXWeiP8YT{C{ou>N8X{T9vncLM02
z1oSKD1PA3`Y#&+wUgM9g$sYON$@+Hwi26ST==a?o&mT6k{$D)&KUHI&G_+r~JJwIL
zz1R82g~M_DGHkE*t7`skw+Xfn>?`B%b^i4iTHu1}uZ-<`d&F-HP0%9y3byy+A8-@4
z53+r|hkie@NBL9vwfp$B2;|S*ajf6W`ingDZzp@CU;d5MZ()0pzh?verUtAZ+)viu
z86Ns`$R6n@S>L&S@*JT5VIQ2oN!Az7OmS{%{=G}~NWb%2cl^%-`d82bH<Ul2kn~@?
zv(mY#`WKTu((m}rt$zW~zjZgPUp7n%A1vS;o2q{c*(3e-@1=f(ZAJZG1oZD3hU-5v
zT<XttXp4`k{%vHB^s9f6`f-Q;#Xx@mb<imOY1UV&-=)9VRoFhm_K$n;mytc<Z)5&i
z2mfV&fBL>yKT#v&NB^9+sqvdee}MGMew6WZ>R$o$yEkI}4C{Lx|NhXl-wCWAbojpn
z=)bnDCVxjr|4+{I-km=$lRff(G0?vn=$HK!>&IFDNQsf9P~-oPa%`WeHREq4d&J)g
z_^$>0-9};k=t!xb@!<bM(|<%pOGB^Y|IeECA7y*5_IHM+{l*OKkJGf@INNWYtvUHY
zt-pFr`|aTPJI~*40`Wg;B#wWA^$+ui{{x!#Up7V>dW}CO&;>@+|5dQPSNk1D_9*`X
zowEOMw%>mO|G(88|5)Fv{eG!A{sn>lGNAv!<~aUIL;btS9{C>u`nLl8=AE#9C~Ve#
zHrKSDFxz{zpG)Zk0o8xR(7rEC@FV*u+k3U2?Z_U*FV69Ewx0xu-%I;o{W$A;<^Ls`
z<5x4=d*%NHWRLh;K>gnX_@Ar5^`B(@b473+o7(>@Cwrvd4&rwo&|j`Oeuc-%{5#D<
z|HrK`e`=hx_iDf2kUiqhfcUin{s%P2ukd)OKT7Vh5me(hUUUB1e7H39I(`iwj`J_U
z_FnBTr8#~j4egVf<5!C9z1rWyn&Vf+PqP1Zw!g<f{O{BpzcQ@Pml3t`@1{F{=7Ez}
z`|Z#izk+P<)qX$F9KWjBf9LV*N#OtAG{=uH>wC4|u;%#D0OG$K=y%@|x4-mJX6^3}
z&G<0}{C@`M|EM{BMgGsM{Y=svzoKmK)qXzE9KT|Q_NQo$UvakgYCj7!$FBsazZXFK
zw$hB>60Gl)|A%jl>p#i%XJ%WT{Gj%Khmk#D1wzW-wSoG78SwYo6zhkNmi6zYzb@G$
z{Z62t0{VyUjP=v3@6~@VJP7yS8MgPzzaJ@}X#5j6M*8n%ze1CLWo++t|LH55{Hy%g
z-G9Fh;<vYE{1jw;nqJM@)co0h8yx>I+i&MFe%NFSY#%*V#_tjj`|i77`?83%_p1Ll
zhvWLIV0*9no1vM14jS5@O$$^|{)E{66c7Ke)*L^RlcfJ%^*4Yj2<fNU-mCrgBYV_-
zL!5uk<LA2||LQfzujpjS@1-9hd!!!)`tJe#M>P2ps58r-<7;sJm9f27{%o)*wy!X>
zA9@A053;>i|FIw0qxdz0{^Mg1zyAAU{V?l$<=?5A`S&Q>|B%=FxaaSJn)!q16j^^X
zy_dJC{nrJ%;{1=-o7MmOBe4I?Z0}Y7*KCIE6NdKPmSFoN+kc<uy*qyQ&;trk`%g}l
z{(Fs|x7O5On(hDa(0@fUen?L<tG~IGxc&l-X7%@nuKlvTSN$#1wO>Q~A9U@P?Y-*n
zc}@EZ9%oj6$7$xz!)$+nNB!-unZHi6z1Q;tKGU?n*zsodx97n)f8%WLRezsr+F!Gw
z{n48CmtcDup5<+7{}VV6^M|LK)n5-y{YBaSoIG`R`+r+A{tC>H`d;<-Z%zAaW_z#k
z*C<W@nP7Xb`uj=K{*s3FW3I&UPqDpM{cWM?Kch3v>Mv4(`>#0LdmaBS(#*fbXGwjp
z<6o`j`b{D#?Y-*nL{0lkvb|UR?YFrm{)YDVYuaC$?Y;WXLpAL$eS%s2{i+#12WCrq
zujAhyn)(aOF{{75H2r7AT(kPSLeu_&Z0}Wnqcr_z$k2Y7ru~K4-mCuVHSI4v&#eAh
zHS;G?wm;LO|GY;tf6@xhKQ^ILa#{vqZT7tCahmz}z<kN?b^UmTX8aUslJ;Kw4Vw9v
z4#2-T;6Fw)|DIv}k0nMnit6$27Tx^K$<olP|9So(+<#=)-Yb6((##(QPLcXv_IqBA
z^~>1a>-?*d?9usG`7ab~+Uz_L>u36a_@AzuzhQl^^RF9p^EYhol|M_#9`Og6-+BJO
z9pIm@8Gob=^-mysq#ptL;{EGt`#VN+{vSQnEdREx!Sx?wd$0U?P&0oNH?)6GlYh-@
z@0EY=X!0)(@^5DlzYlctPpt2ie^+XbpJ}%D%D+oA^G_|H{&xlZZMylV(`5a7=|82J
ze`*K%y952rG~?&M>1O$Nw<iC}*xoDuj?j#sD-7+g(Vf4ty;uHSLH4Nq_WYHCrSyM6
z5WkZ(=f7dr_sYNMT-<)6Z0|MyaXi^0{tD)I_J0Ea|1TQ-xS{?J8vQWP9|ZL8)95D*
z^%ENX7|`Dv=!fRv_@@l@_a%E2{{+w<0`%wIg!MD5zl)WHxgYBIB}(>4Kh65i<M+Nm
z|CbxFenm{S|Gje3)+bf}2eL={oj`wopnt{TSU=4AJA3F~O!i2>>^Bmlt(NV@_~k&L
z-+DaOkFkC~wzqex|M!qR(x1Tk5r_Uzpug8xte-ISe>bv6`mMnKVL<<pDOf*k=>G#`
zkMsk-%lJF}uL1i1-W=<fogwp2mSRWWJ%4n8#=e5>1)FnI>+iZfuzt``|0s=p$WZ?y
z&G~<r?az0@(`S`GP4+1M5stqz|Njc&e}hIpZK%Igqu&Db4*~k?5g?lXkN#cOzt{2a
zdCmM!ob9*th~Lv>kK&hMerNv~2K?g|1p?|lPC~K)Jb&@#9#TvEyPcOG&<UpHzjRmp
zleHz7{~G%X-mCThKeD&VQtW&FL9nznv7PAu#sU5dH1Q9gDGS_`?d_eae~89D%J$W^
zA@5cDTCzv+k1>Cc?F9effd9uh&YuM9@9v@h4cR081kj%V^e6uh>!(?thUa;k>i;oh
zkMz^5A7gvr|4~4H)OA=tut?S)ogU?Fs(uaGBmKx)l&rK-^;nzGKN{$-pc_0<`wg+a
z*YWcevPb$YtRHdc9}D#VcM{f*vi>)0Z|_w9-y(aY-*av0f6}2J0s3EDq|rZ1#(#h<
z%zIV8gY1!h8|w!h`jdhF)|&iFu>KVu`M0?y|2kQ}jQbT)|5Jee+e@+k;l<K$xQG9*
zlRfgk=Q{5En+o*X>#=?_>wD$jYh;h~!>k{1#J>UP*VW+bCn?tV8o$524D$!hk?}jr
zBYts>eVpy@^ss+>d#oQiSL%=Ouz#KGQT!4dzjjCbW`Ot|q0x`q`pN`?+J44r^cVM#
z`4e7O0*L&b1@te}=%+6*^Zy);e*1<}-|7DeKz}=pe(*x6KT8&qtp(Nptu*?H-qNs)
zp6?(w;r|?<-`W?~fAeK#{@+9PsQ!~%y8WLA^ap74GpsMpS)7~de?N`>lC3y!y`;79
ze*w@xUZWqn+RXo{I{ls9{+|f+f8G(tKhFAB(D=@|ss4XY_TA|ZLe4*;&(U3^ekBi1
zh5si5{hbG4{ou`J{%=qANPkJS+y7I6{!Ih1evI{RQ~Xl>zmDvYesqY`Ppl;i5dNPI
z^xxL#2mfK_|LYq4ihbSwp8@ob*XYMsKk4EBRE>To>pT5F6X<8?0RtjLk~Sw6x<&dw
zG53}ANsa&KWRK$CvcD{`!V&*PK)*$!-)yLVlSaSo0Jpw)e=engwUzUJ{X?+-fq$C$
zzYf_W|2qzJ>z@PkpB#<#BZm5ql0DMzIn=Fx9?-vk6xL4~>fc57NWbzRxBdk{f2Kyi
zqQxx!jT-&hVQ&44fd07Mu>Ubb{X@wf`QI?yt$#7l-$0|EHq`H-(O+ES*1r_!Kb6M*
zhnC6s&*64r@6`7H7}+ELTSiFzI2(%o_i~`$zX^|@ldM127UsRGzbDxv{py3Iev?E0
zN}zwlVH*GcCH=Si3mZe#A4~Q~Kf(HTKO_9V3h1|<fc+1%ey4Q9mUqqn-9z?Bzm4@%
z(hY0;cMZ_rc(&B%Kg;UW-X*_DXTOmjgqCyLknEBEl2H;oM4Dm~{$C69b@OL)!Tj0t
zRHUt+-FI;PDGmhhmS61basKefCtRjt-#$k2M=W~D-wgQokKp=?+$RhCQJH{L^QW5Z
zQT(dIQeQlCPHZB6Hv;`DSzo~qOn60pleVmLKkT^K-&~^6ZyxWizng)+uKr@6{$2$2
zH<99RjXx9zLY%l>^>>t}{?bRf>+hd{e<tU@{A)WZG=6?f0&U}wKaHCF4;{rNvc0Ik
zWkCO1u0K^j{)W^S*NmK-nm=D^>MwMREV0dzKeqyXUHzR8>hBdQ(#{`y|Ncgt|4RL(
z|0BPMc*O6&WN($F*!P?)`FlFXk9Pq61@CG4?{{T^!`a@Bp&Gy0WH0nX_8;)RtWN5u
z9r_8Ne~0Gz<MFiAKR_*4`F)w@`Qw=>Qr~&}x*O<Ud?N0DQmjAJ!~gTi9{Jx;FZG@0
z5BCE7{uDnUA^$q(T*dp+|K1+@dy+lUFP|n$T*CIE{oD`q_Zx@xgC9u!iX4*lNv;3A
z$sXw^8l-+L+Y9|xpudSG{$bYNz{CIEn)r9JeuKmRhk*W~U9kU=52gRLa+i&Q>VJ&v
zk^hn7r2o$G%OgO)o%I!&K+DJSn}u0r`9Wwox7RfKO}4(H|9lMS|95BXfAABj&yTUm
zN~-?1lRff3KEv&Q66gmt{-5%xng6?M{BN=K9sWNF^v_9S{{x>%eXsHRLb6BxC!^B;
zI7d$8|8k)J_yXMj#8}^J{QeNxBmM9RQs3GCJp=T=3~T)VT>4LsH_zMD`u~*dk$xNN
zXB_^ESHe>mtj%s0=e~>eqpZ)TF>K|&e!qz9k$&rJ=|A5_V2%I8E5%j)=#Du46<<pK
z#W}ZgQ~f`l?2&%uJgMKp#-jekE16aO_4`VFsg_epd@H}H%zb5j5?an}9kNIIDb{z!
z|7D>6o#y&in)UBcz*PUg(p>*a&UeQ@1@sTp)PMX3DJ-7(=-gEOeKhqSJW=Xr9PR&A
zpuf)!n)?4m>i_PcKZxv6{3}j%*Z&Hjzk>CZFb66E65Ol)U(x8dvA(nZ-vIi{H1!{5
z{R=((zgbiNt*5!;-wyQ89FN<7y1VrML}%sGXSM!MBYPD8mcL8=3diyPZJ@6kzb^sf
z_xGqsI~?|Y#Z=~3DloE+<UhlM{}r;g%2Mpx&XoMs4*vi8;J+F0zYq9tI}Y<_nBQyt
z&_Br@@dp-3{vi7=`oFXf{siFv0Py#>*B>hJE9)WS@5R3-uRjbZ_CdfeUMZyZ-@5#H
z1n_?d_&->H;~!*xul)HR*`xSJnBSQ{;*~h2{B3~$Bf!7Ge9WIT<nKZDh=0jhGJl->
zpZefm0r)=#{JYQqNi?w@O8tk|HOrqJ$R6>h&X)Yn{1>leFpYm2@P7jM$7tdoHRK<q
ziGN_Rn_oQA-jshO;O_wZ(>3vr8}d)n#6Jl5#UrIn`8xssr-1)5P5cvv{1<8B9|8R0
zk<6z2-Fe`{m+!6d?`MF2lW92rQ_Szx|MVt%l>c$&ceY>gNI+BmGQj^i;GeDO|06xk
z+V2ca|KD~FiP7e4zrXn4?*sT(0{)en<8RE6{}avew-fM-CAp^YuLS&G0RAdEK}P*&
zvmyT;WRLQv@?3ZP#gayq|02!xrzGo>%XynRemqxm{b>U0m$S7PzjOooy5s*q5WlZL
z{N9^|<Cijw-#cWF;ui(+>*0ex1o$(6|C|#rf5wo1A=xATX28Fm5B|}B|7*ZMWG3b>
zThFZj7)bVrKLz-E`QV=b_`d=CLyyAzLFV_$|NY1w@dwT$G1{E@zmX6ADS-c5z`sP(
ze}oL<f2pSbC})0W|Glvf{wU!84)CvaB#wW?F#f+z!11pI@!!k`|0#g~d%#~C#r#pj
z_zxp{ls^#=|8gJvivj-+fPa}L|KrTRIrrc8PVN71*5rR2@Neyd|1!WY)*@K3A{cug
zpb1`d{7f+awl+BLRsLTz`JZI|TDB9%uWfzsHv|5k0RIKMV*V8KE6Xok^EZph9_3HZ
z^GS?0XaBRk5B}Sj-ySar|9=MjXYPpk)6DPHf9j6^_X7Q2fPVeXSU<!1Ha}ORD}Flt
zM}YpXK>wA&SU<47JpL7`zZ~fQ2K2|+>-UuN@3JEGUj+KU1O1h|WB)6P)L#Mg{{Z^u
zP=iM8KUk#xJ3v3MZm!?4`=6T*#rmNl^*;pqYXSWYH0>|U`h~W?l|X-Opuch_?0=+4
z|GxwJ-GKfPn)VkhQvX+=-yP`x=dalRSdseOzs~PJME|=E&~MVTzj%@Qy?}lXpud@>
z{WTY<zbVjP7wGS$X@7|#_4}~CbN;6%&~Ma?Uz4owHGY~x_UQOs!N>0)AGk#Qhp7Lv
zk0<tVU3dJd1pMm*{zMe#Z<_hN#!t7BJ>m~Df31Umm=FGefPVwPe_bW!4{RXYkJtF=
zDzZoXOThR^EGagPe+cAnFTj7*4w%1;`3vp8Yk~fTK>tKd|6RfQw!ePIPhp_n8|Z&z
z-~XeGUxG#IPXPKG0sR@8{yS8pegx>30sZwg{dc%X{RW`_7oh*ojd1=&iqww+{f&YC
z6ZZWtO8rNR)Nca%n*jaoHSI6P`h~W?7|`Do=m#|IFJ7eoi-G=TK!1j&{WTY<9|!uI
z1O1;y;rvS!slNp1ZvphL*bVC^i_~uh`sF}>fTsPWiqvlb`db41Lp1F#U8H`3^_}CV
zt$_Ypn(<SH^=W!OZ=>O6-nK$BeoFB1+qr(b-pBF#5x~DS;Lm90?<2kB_=A=g<ZUYd
z=bHKZ)(Z%hwhD1_OPd(~HTd9f1N?mef3s%(K5fW<jb{G7{X#eY@jm!h0RC+N|Ag7N
z{YEx4i~l&XN8`WFi`@J(eekCN|F(etDw@AW^A~C6_sajvH1pr(7fXI;{);80_IS?g
z{9z^F-wyEiBtXO;?rj$TZe)+*UvY^${&RiscLM$jz<*a0=1(!d*ZQa1$R6>BE|vU2
z*?g_`yTAv3_itqUoc-tafd8%em_K94zk=)$e-!Ya<b%Hq@b3WlkJYT-D%(i<?-l<e
zHS4#U0l!$%X`26i0RN7F|Ezg9{y{_jGsqsrKLz+>KKLsEe_z1=`q7v_%>2_hf9;)m
z{7R8M;tyO#u(ZY5P#nL+l1$V14+Q)>0sf4p{U#0L|GB39#+l#Qe#MeHQ~nU(-x=_a
z)Wkn+82{m#_$NX9#gZ0N{?UMc7r<YxX}{qzv-Z1*ru~L5m-*w2zZlY)@=pN#m4N>u
zP5h(GKaKO(-l_S2t|tC5=6B}57*d$>PXYY90{&|?@lPAZe~BjkWmmZ4FAmA3{87Na
z8{qGziGScPGJm|{|NH;p{wKuz&iIQeG37r6@b3=zpVsvMQReqLekFDNKZySlAN-2}
z{~mz9jmE!d{1!Lle~Rp3|9_=Bf3ESte;MH46Yw`_#-9m8{yCcQXAtmT=Yzi)@b?4!
z6`J$Mlp+7tn)Am9;J?8K|80POFTkIo8{AO-WDNOVAbXTQaln7G5B^rb9|ZiF<1v5P
z#%9N_&&eL~CjtLIeef>_{8fPeyD6AIXvqH+*(3f8;QyBo{uJQv5BN9L<WJa;e<Mx)
zREW-!Hs|=^b|3uj0R91hzkDi=f7FnF6S7C~4+H*$5B?6ozdH$8S`-(1zsX6MKhFFl
znYXFqpWbAT_+!jp&emf5e~%CT?*RXPG#PJm+xrI1^B<a-{|4o{g34c~dH%x^=68-C
z?)SkT_*V8G&hz)30DmVvU>WtF;mxFdr3e4FWRK!sd6ld=C;x*!_<I5VTgl#zyS*>J
z2=m9bko<cJ=Ny|F|4qmq@wYNRot{~n$e%|5f6XG+cW8)@iE^pGEydiqsrn(Z7y2RR
zAJOOF)iQpm4dg!v{l|d*`}FTt{VDb-esIfn%J-_i?)rT>i2p#)|5Q%L@z1dS2oL=o
z$sWZ&aEtWcnLkeg|8@L*0skPtzehdh4{gi&@4>$d*(3fq^GDcT)Zf!S_=AA|9kREy
zs7!nR@ie~wS!t(H=3nT+{~p;R{tWX69sF%R`1b?+?*jhg56Aq0?PUDV_28dM_K3ei
z40dR9^1tANzZUR6O-Od!?R~e~asI@azne$@^ZRW$f5OaP!S*75UiQI19`LsT{x5IE
z{LK|I{$Bi_l0Axlv_;0>$^UO3{1L$a0^lD>@w56rCI1uKOa8$g@gJ^<e|(vne}xbJ
z>45)bz<;bJe=<8r{(c_(N0L2?e?knFX>-Q^O&|PCfdAis{}xUBEBZ=)ujB6xn)s*0
z!Cv8i+Xw$bz`p|UU#!Xh@J?p@=WFsmbDNw0zdrcmfd4JP|MkCc{>S*iaUWSx%>7W0
z|0~HJ<xklilHYm#F71PVDd2wx@DJ6*Ke~&IzZd_0n)sLB>E;*DAE0j3+U)ZJ-T0ve
z@V^WAZ_va)QYraY=0b0MQsci=6aNZvvPGM-{eJ9&|6aiVBiY->Eqnj$i8z14yGs6F
zm3~#_f0FD`{)Fz5{Lc3$eCmTg3Ha9o<F}J_{Ck-3&)4vW#mORVPX3iX_+MmxJKx0d
zyYD*g`2TCnT2@YWQ{o)nOY*Dnw#&2N=!Y(UR{(wS{z$vt?S0cBU8DaF(BBj2zdNot
z{j>fi$B#<*0(Shiw*$p{HJ)QGkoNtRzdM2BUni>}`>*!l*xu{n{~_?dAMpRu!?6GD
z{fn#rl|X+lp#R|5uF?Mv=m&xRjBwZJ{|fZQ`xouJxA&p(#p&;GKF&Y8{x-;Fj{IQf
zjs5l5^RWE~T>pfex2g8J{OkUm%pbeI5dF_!;Qx1;{Od5xzjpRtz0Q<j`$!&r?)gs@
z{Qbe_VE@AdB>x^7d;9Ct7GwJu+iz<BA@9}puZv$V5Wl@a{I=5cUrShD)wAov#?t9;
z3iPXi{>z&7Q>=a;p#Ly68oS-t`$MSz6+WrQuVVH40{#8K@&BD+T>r`ez}8pWi~74R
z{(AuZhk*b8(exk9Mb`g7pua!xKcey9)>r*if7kiHAJBgq_`j*9{#%Ole>l)T0Qi5M
z#(!I1^;i8}=l^J+za02~qo)27MfyJ;=pP9D-$CQQt*`p4{;u=?XrNyO`kzxY{a<U5
z{!an={egZ^bNnh+e>%_??~k_oJ$rw+X8csF{#>9x5a_S3>Hmw>KLzNE_cz;q+xsTX
z`Af0-3xWPVK!1eh{KZuN|LFRmb^Njq$h^1h)#J7L`$a|CheqJ>i>+_R*~U|U@5k@o
zQx1QDN4Wi|f3N<&p+-MxXn$u2^Dj5Fe^PV))@EowTf_gNq5V1sVg8h%{aAXyzUWic
z_^&XuPq4mnni*(k`%1gwd9UW*tz<9iG^G4p<UTonQOn<p@xNF<W82&FUw=G;^FJ^!
z|NOx&-nO@YfAhoQ?0bJyoc+T^@{cUi{){5+|2CS(&vroVJ;z^duj=pT%#r!0=8s)}
zA-g=@tM#{#>{0%-aQ?*EPUKHD$e-Smv3`j8z4X^3d!%127CX@9)ZYi_Z$t4z?Js7S
zzaMG(uf>M;TWQ*V+|Ygww|}+&SYl|uug1RF(EdkF|J!0{e>lBh1I0gKX#bMNzSYov
z8;yO^(EdzK{k0j|f2N6l%FzB{jefhK{W5#}W3`stk2KqR%|HCd9>3*Gtxu-*-)i`6
zd$qq&e}9tSKcx0w9n9aLaH;l>YTiH8#{Gx$`qf`S|Iz0~dHq9ef8jw)qzJ0<d|A`~
zhWD5DUi{B#`rp(8vj21P9}4)#QU590pBleb)?e%qzeC9$^}p?{QolhIPMhfe#k+*<
zaM<IA^)>kuIzSSs@v`k@se!=wL-Fy?)c)8h*nitTVhizJ)jyK#k^iBGr2iSV6aJ3}
z{>L@^&4&KBYuc}={YypaZ(gMR2u=N)@^4zC|Hn~+qWrh@!yfftPxh$(gAdF4Pde)V
zXi)!O@%kmT{bjiRz4Slh^-CdzGXwOG1^S=y^#k?#Rp>xTG+sF8*z8~J{coE7cgZkm
z@5SG#>3<Vqu_SFt>!<8LCISAxPr~)rVW@v9*`xZ4KI+!51NyI@iqAi)hfDv}{zCnI
z$J2_l-@8ctMMc`L8!L|gh$8LlPcKgYz9Q}WUQnF=>>};YI=?vm6-C+~amK3k?c+Q*
z<LvR@{{31Hd$ql&zdz@ZKVJG96{&yg!s7h@+QVM;SN(k(4|^~F>pbjLJ@xmC&MeOV
z*FEf2J@xmsJnX&vKiI=w)l+|;^Y`NXf6&8T)l+}}$RmHf{NKGu{Y&}$xtrafd2b*8
zDwXe5{tL;zJN->a`MaRFS%J1%{$7lq&j82YgX#Fa7X6K?AK~NgVz#$;s{TP_kMx^Z
z-+BIWCeYt)D%S5{{fI5hdsTlYvPb&q$EE+y^M^%1{|C+aOKpveh?oA?n)8=b(yf0s
z(BHWZ``==yzdhL_|C3L+_0IwN@p`P^bA*}y=aD_qPl%gEXmiH@JfQ!i#{ULG{YN$a
zH$UapzX0f0o{9Z$Gt}Ra?2-TR<!=3pfd1ne{mO&Q;{T9FKPGN=QR06w(4V8xUu>v9
zQ==b!#;t!T&|iNcj(>-t{yJoj;vad|t$#Vtzd|#AQ(J2m|BE&AH(_zJjuQVXf&P=4
z{;$PQ|4~i<7kbXEe-+Rl&-X7$Z!Ki&N6(RF{*U4NmqIyH>r?P~xBfLi|I@Q@{Wlou
ze@OPI{wu`IMzlHmpKF2sCz||gGt_@ylYeC|y7jLI`UB3!{#TANi+?||NB#$1a_ip!
z^s5$O{l$j*dyqZS&j9_Kfc|M3|2quzPt^FI7B_1t_5Tl`e~QNc+P|8`e}TsT)GKcN
ze**pgX!@TPL;W{2{ZBIG)?WtnubzhMzvpN(|1T$dRR0NavzZeATY-L0jedinem9MN
z^Q&(C+kw7r{nh#3N&kCUUdZ{gkI7NttJv)Q9*rEowdMEr&o<@{*<bKp9l!2E_EuSn
zef%}aA7?u;eoy$|Ujq0$0RLS_VE&$mNdLX~ZzFreUm<SRqs_^Gj}QKv0sn7+|IITn
ze=YOJEQ;I@HU6)XJ>pL=KP~UFHWB~(eefp${~v(=h|@5Cn<4*LvPb-ZH)Q;s{15uz
ze+2Na1=fFU5ySkohsykE$c5heq{e?^vPb-3akC_CJst6X#0P&H;O_?buRI0wCk**7
zA$!C>q20~@xDWmnfPXW<Km6~QzkH00e~T5x+z&PW2a-MFkGv)MmpJ18q!0cy;NJr9
zFW2OM(vbggP5yU^n^kFZ@;~i^e<k3b0{HLN#J?dd<Da%DazE7g->!*&Ts&-mwh$i|
zME}#~gTE8-PXqk@PsjOFdzcyjo@9^mC-px!{|i3&yMHhBoyXs;0RKWw|5G_u+6Qx?
zw?3)yKV8%Rl)WeUBWy3?|FRGMGQi&l@OM8I$A5w${~wzECkpug?SsD$;BN%{-)Q2$
z*pUAVP5e`Ue}xbJO2B_S;GeCDf2$$?46;Z09~3W(r!8Xrl;g)Yeee$i{ObVz=g!9Y
z)4}{v*0*<R{x2tc#2;t=3P=C{wh#Ug;9nQ;KWm?VDdXP><7E5w;(zl0*?SxKxT-pD
z{N{x=yx61xAt=hU1WARqnKW$^0hzQ7y#tdr(gNkp$uyZXv3YYcX;a~mXs9xVX!rTJ
z`{1f;pVeJi*Im1RS47vBltNQj#UhI6?rL#;X$dbC6apgo|Gww`eluszoST`n?C0Tm
zK6^gN+;hJ7_jZ2g<=%VlIp^~8mt*kn!(wv^y8Zt#2m2!y`%kslzeUC`4E=`+w0{$i
zUzqkE#>egr`;W}Q{w)^!Pq)~Aos54N_BU)U%>VD<@ekAf<M`OUVgG;5!Tt`5{nuOU
zUvQ_r{@+ue{ihPYt^Qa1HrM{&%)$Nvi~ToR>_5Y&{#0FCnE&Vd)Sud;x%MBMgZ;Nz
z?7zig|7U&dzq3I5@Ak336`K_p_2=n1*ng+R{x*yKpZ2N$(*@f97e4iW;Hg~upPPgI
zpS0NjCX4-DKF_~h*Ln4)L3uIrWA^{;KF_~<rab$HnHBdx&(FdBy%zh+E%qPvx&H1g
z(Ek7Qx&D@6vj_^h{ePH){a?1&ztCd;JwEr(PZVhX=Y8&<M=bVF&%yrtEcTyivA@RW
z`M2Ww!s^cjKKGx~7W@A=2m2qe*pI#ZR9{WyD#v^11v73@%=OPM+aIEHdNAw%=ZW9e
z{|`Ll)gOKQ>a{u8f7oJwz+(SWpYgXl3$(w+XZ+21HrM_l%Dm)X<~8_@fBw70{$7jy
zYi0hmasP0rK>Od#^RLbOhdmbiOXpz!QH%Zk7W)sy?DeN?i&y_cdgY<G_)p*i#BZxV
zf#-7lKYtGP|K4JMv&H^Ir`>*+?Qau9`DohTOZ+zb_p$xQnGgN{X>+jOdC~Kq{`|h)
zV*lTE*zLckK>PnU@!Ra*d))KCZvUI+VE-8w`@<IduZY|2FT26Ze?I@ei}-E!@A+M>
z{S|Ytzsh3&)fW4I>SKRbf%gB%$NrJ$bL~HK4)#}D>~FEyKhSRX|Dgiy-%k8C{|~&7
zYya7Eu)o$~|3-`bXZY0rni~tNKl6R+f7|bK?LXII|AE`=^Y8YsetCZ&-AIK*`1oob
zeo~ng%ydg0{(SmBnup)iXQrR=nLjT14;j}rGygR{^Ph#^)Mus#Pg4I^^6;Db%ygyC
z{AIDfHmme9`v(bpbsm0GpPBy5*zEN$pZ>@5@SFO~bnO1w^_%5wrvL6cC&$0;+q3fr
z#L;{-^%s42c7BuIOh@*g9RH$;+4=L?e@7mE(_S-u^d$MOKS}?6>m>QVlE?qGPIfT!
z|5Bd%laK$bL$jBksn1OR{DG6>-*xch_}3mdIsWE{PmX{0Lnp`o>yzZa@Fe*^HhFUP
zZ$8QLf9}DP)BlZ=?7u&gr~U`Bo1bIW|IR%2=i@KR<Ntj8|C*=%=i@IsN&mH;<n`~f
zdHSz>_kVul7nfP?zcD3E-Ro1C%JDZo<41D;(?zs;Fz+9p^cg>D{eyS^U8cQ1TTjfw
zpKtudwb+j-Nn*DgxBHAAP4oTxox1T97ySZv`iviKdC{|<vZn%`|F5Ed;TQWar~B`s
z$P9f&%Ng+~z2A|Wyyq7kL!8B>;cNK&Gv;+l_&=AX^diD9$C1Cwl?lr8Z!S##Dc@84
z1I31(0Q0xrk$pn)pGJuvWf4jPUStBBJyU3Ny)^u{k^Y5W{CDxO+`Wsyv4zV&^bL<6
z`TZNplF8p2@9j_QTGqcj;DuT~;^4)--&OVX>dfj!js)6HyS+JbWpR;s5`K7hPWeE)
z`)1Du{DxFC<Xl9QWO`QE<fi_36o{Mp#ZBf(z~l4)>^Rh8c_AI)bh)uvtC@Dk)>pW@
zCz5BnlM^!(j=SaiJ*4P>J2ro&Ex>~KK=fsuot?|d&-V(^9i5&@R=DGC5pn+0#<HPj
z-PH7f;0%7j5}e4k$Q`>PD;H)uHSO+yF5r%rK8R9rgVXLex|cRgl|A)~&${Jb+3yA?
z-Tg<G14k;g-`#&~d2s)D=|iJO&UeS(1eL_RKdqGPaK{?Msp;^N<AWt+O=Rq}tH$fg
z+?hw*m!5DJ9d}a)BTF8MG#=c6vu>)`UGkEfYCPa<jdetK#$(%~14;TG-+zZUm<O8r
zIuiZe9f6u)?aGyPwRH`b1h&Qo;~jzizCfbBVfE_z)g4O$?LD!+ZGj!}#9%k!!PU!Z
zm(>Mox{}F(!FMfR9`j@@+t%N|ttUR%Ka^;XFKh4bU7qak?`iLfb@wgr>Dke{bRg0H
zzIb~w(9zi0(AZhu5nQ!u)ryXlwZXdh%J$mE`o@)=E4Hqvjkm{Fbkwa_Rky@(WRKpW
z4_xCE4ObMs^^Eytd#GE$z0P^;O4V{Hj($t}YPIKZ(}If8;>ZHD0MJM1A3^#lU~K>>
zNKXSSsgO+H2kcG@_8G<&^AU9WIDUzSJ;3o24SRy)x-CyzFfq*KbMVJmY-}TA`3@yH
zD=0mV5=T6jEuqArmq|vz_a%y)bJD2lAvjgyoSMe<NQrZro=nF}9HTSkGbPR$X&OCJ
z;^^8kXG)v}nS>TAamuw+CR*Yw%p|l}iF2lw%0x>X?c$Pw$(tEJXfWY&<<wEEUwun9
zK&cm~3@eMJMmXt`SWFjt)FU%s$w_5#ro3cNZBzyM4uQ_oLW#=aOgTzD`?}JbDKD-{
z4nE0VS)3^^GDC$QQlzptQ(l6vR&p}swV3Ir=~!8uDKBXUzftlt<s~_PP|;_~OYGc3
zH!e0m(2yF*&y=Ik-|9n;lC3Pxl&`d-%Za|SI8(mTmJXAP7Z#sQTwW0WT&(c73hdNy
ztjkC5uLxgQ{I)cG1IO^5a$)iLX<X!dR{2@HlBo|p3ePRCTYbuLl@Gn-gUnL3{Z-tg
zP#|+uFmWj<;P8^ri-n{{-CGI{Is_cwPX9JMpy5|g9077r&O#3i0rqA}In!qgE`F0b
zB6zFf_O1oGoMFZTd=&b<oECY4A7Z@Lpg+!ODNmuVLWDv{{buYBG42|;JiCa!A_vzt
zge~47?T7mqZ!_>CjCUD$85~Ptz&oVn)G{vq5WQO%A2H}h7{AlN?_qq8fgfi4ZUdiY
ze6N8AxI*1y;Jm~%eLWRB2blgogZ^&DCk%Xo@k0iFl<~s`UcnXl2?K9n{D^_KF@Ds*
z?_~VAf$w8{+Q6S+yh6kEt4x)KOB_%@!!P7G4u!}$SECPb9Ddg2)M&WeZvm>+aGhS)
zE7vHHip`KO_jJGm_@Mwi)9Yq%R2!U=P|p$IT%{D!s^MI;3hB^r>FWRuYq<9`>;ZRa
zc;@QqID0j`jN>@`vxaASX<84V;hC$d<NUjZXRfN5wZO<z=Bi5lDQ6yd=Bi5m)Ntvm
zmFVb=9X+i(oMnl4Pi$E-KAc<@y>Y{)WL+>C39nh(+8S+I6OL|ZYH8lo+O)PgSQm|M
zizlOl1JT~0WOM7)Cg;_&u<B2C^*g&_$!3$=m$@OzDpw8l_4K!IKLO5q;me=NM$*<5
zOT_s>w7q|*FL{#e!TM;FTpXuICG~Vm8JN}2HWSv>A=~-QCsk~|vfN`Uw0!kKQk=@n
z#`ti1d>}~=a~aI9idan#=F6~YbY6zKEK5ONfNQL_)fUEUTBz7g$gOFG4xV~@<9$hP
ze;u)8jN0Fv8enrhwZuVZSx<N0_IP4xzbYk4N0trJ07}{?vouVbQ-UkJhTcJSHW^Pe
zUqk$j$z22SXm?*{e@3iti(MJ(>E71Y+}nFi>yB%BooKXuI2IikO2nf(x)aHvSdTN1
z>`KIGu!qc#4@bRrZGdR9&a%G#WPI8B4c9ImOvaE_K96@rI}@?qxPxpaV_WICt5+S>
zY2`_ZElc#1LpNVHOP6NLezRU6g^4k$#|cQts?o&1b#QRj&N$LQu8VFZpFmkZSDsmN
zx+2y?9*rgY6VX^=TZV}|7+e<QE6vFr?x*__{dy|W8u*dz4E^FsC-rMJXm=4aFoVnq
z;iM(-ZBY8mGsHX_zkW>zliYuZfTP3=nIQrA*vc1cxi5JK;mD_4+Xcr~Pd5E>zoFmb
zK(whJTW#9(cd`CjFj0Vh<i*s#o-mvK0m2c4-b>}`UqdHs`tP>nANM;VPxAjyq}--|
zgcahP9?blg`S@=SGvU5Q4<`Tjh`^?QFEi!i5Bk`@kNFqt$|-K@f1WU#{v*sM;~SjJ
z;XmS&{|a^-oz4oTewxBz)gNGfDK8OX@_&;~*vfyOrTo#PMV^%ZZXf-%1?nI1(SOLI
zAJ6-ye%$lg{2yZdE}hqdnSaQ$<^PC9KSqg6{i})DreB`ZW!y+?F!djzMh$+mo<79(
z^Fi1ZZ8|}bKQVuu4pRJKX4IbvKqB(wIL`IYtY=4rK#nZmwEs?GwE1tE{U;X(^k1km
zrvE-o_5;h&FAkyedNB24T?I_^<FC<~DK7d2K9~5d_VYuQ%Y?8WqkF<H_5UYa{-%EP
zYX}YAA^j`-0{oEpZTdr8aKlUp{TMA2e$n6Nlm8IwuMtIj6n=qk^2z^wtlwoq=*Os}
z@QeP3NRRCudY9=CmSa>W=XUVZxmrFi2jTym0DKgFIewn~Z;(0j;Z#cyJ~?%t$Di{K
zy^Q&53<k-+@PC!)KpGN2j{MNw!2IxEHT?^}`0rt2mZ~nSIO2P!2muJE05Q0iF!`4U
zSFKhr$N9&5W9}uqxc4jX(CdQrb>7?b!r!3}Xq{MyY(Q?i$)cQh+{Qa{^PRanrZROv
ziJ%{M_Y9M`<;|1sN3+j5PSf>G*KMMg<9Kg=nVWhcoO+F3iD%x4N5&f5v4Ju-b-%mh
zd3W^wDtFASaK}pM75+?XRZHsKk<@g{?wO&V+|=~mrsx5dmwL=i9Vb!l=*y=zeHZ?W
zl&^i+9X&AL9sSQ~cYKh<kj%+Q>Xn)I&>QzNs@&22_&*vRJKIg2RpqAERh30jw^dby
zQwvzM$`V=I>W-DWjqfQ-o?U)EO(pnOckEPm_e06$z=ociBGdlprVhDF4!ffhRgtlv
zI~J~pjLmaX^e+5y%19F#9!afmM;|C7$!Sk{9vk0KqK0|h$Bw8o<5!ksQH-q*d>8eE
z-qt_%TX*!8ik+9bjV~ouxs8vz<?A1JXC4kt5L}k1cK1I;Z{gk4qgnoRA3Zh$f+9Ed
z@XqHC$eaf^HQ!BLUsitoMEOFRvM{!x3|V^HeQ+H)u`F?p`=OU99=Z=dZuy%1Q>Re0
z!g0x8yMLH`+c(f@!yZt+f-~Pxr_0woJavkSrZ!f81D4Y)hf@=k--KlNujq#}``yO-
z6ECJV1}LZH_ihY~>@WVNqI~R^W9zH4vhQ4r3e$9L(`G6L@-xr4SP>Z;EGs{M9hI}K
zzJ$l-MN%&*x8GX973OhwjB3H|7t8PXG+DB4?AAc@?wJoJn}ffaI#a8E;h6_o8edIr
zhJwi0b}G0h-ThCNh9}oywT|P2$JV`xD)~h6@o>@ik)N@e-1?f<A5QgBjXCP>erD+L
zsV~3+D0atgEep5*#NGePQfdj`fLyZGom{Ir5U-xx+;j^n_$}GqaCCo!QNjM`wr>nb
z4N~=^DbhHdxGdcG6E}4@T)uwNojKGTe343_EU}2@f0Q7RI+&h=^60ZoGY9D`RgmL5
zf7jIb$j}DZN1{$``VLH^mh^mhbaH-p^taRD@txF?=0{S`&$L!tHGW2eG$VIxQ^i%O
zvl^~St!pUTkV-aGxT&ivj%}f0jf~w|g%(Tgn#7VXNr0*iZt4+|5>8FJskK#Z`=$UY
zRwcX=NzDXbJPLP%Io$pT*jmP`%fr-$s07NXwoW9=s7)Wky?VIl2Vt*ASxCJ_nfuaD
z-SM+12lrP^6$gLVG<vXPUFvu4V^2Z;8RQl6La|$Pc&h4~=;ry{=qn5FQ+2w0?fp$O
z3D61AiST33j9p!gmQdl)U3G<1zUI+z<B!QDPemG!M#|S5{WdDD67lQsW4~4<JARAS
z>&*Wqgi=1UJDqdVosK)XuBrkw;Z%9J@tGYp;j#K^OwLI?RepYmYES(Vcf7vBEjs2F
zJr!Q^Or-Idp{K&BGpg<NMD<tH8>Rj@w$bZ3RKGD@v2(TC_>)8(H9hJ#?x#u-{GqB7
z=b=teJT<A>ll$m%GxvMdVS4BDjSmkssbU*jTj4eil+jeD6isbX4Il)7`oB`@W~sEL
zzmAO6dR_K>uiKlV3WMT(*em+YWz-K-mz$)ctwVGhUn~ElHt)$D+o-yx)5EDlk&EYt
z8@-uG;nYLnCBJiD`dM%yvgqMtd1MK7Dv$0|of?&JrqvKXRWV{+UseDw<wN78LQ&Tj
zuk*pB3ewO~E~B~|zIaEO+xYXuVmI{zcgZhMuP`ZUI=Rp#%NqCZJT;uUvf|huQM6+l
zsB%A)bltJ{Q?1=a7GX|Rxbca^;&AHa@RFZ;+>u3xk_#hCCf&x#ou|5~rix>zh^i^d
zMeP+5KK1r&h{RWgFQzVhbU)R+C#UI1v%uC;{0PM-0+I3RQ>o=lhDU!jO~-)Scqmf7
z{z!Q2gVc9XWBv^;i>f^bh?Vf`0#~Ir2aZr<4jjEI6$u>Qkh(1}9Zpd$QV+XJ?spr1
zHdq>*n4+vd;x74l_@!S2C&G(fqQ;B#<B`VKc9Pg#=z67=s*5%JiR&r#THb91E<>ZY
zmpN$5R7p})%f{A{t0t0l<>!wOIduS3o#=jG?ADre9itA^MK`1>*kB-%I^MGT#i1Wt
z>(hUwzSJ*R<uO?5g-p%!(sZ%TuFvU=drX+4m~n>c^Ri|un(ZN*-W{E+O>?iU_1H%b
zP!p30j|I?=-&&TdSMsASzv|-qSUB}!I5iU)-$pk|zf~OJvGuidX{e?CI+CKR%Focx
zr4GnxH}!;B{9b#)<(zJ$!l}pU8Wv8y8X4~=na{Dzb=4&F0TTM#Na{7Z)VQgis*-;0
zrY62BYW~)u%4FPiQCFTI7d)=c83gM5%j*0i*7HXHW0t2O&S_Ofi?_7Nqzswmm!bUc
z*nf!!{vVjzD9?_#E2w2BmGKc6-S(=WV_Pg(4`cF<y@t{wjBUhm&4P+G3#ytH1V&3g
zUh;|J;^qZa3L?Rv{W8<uXrpb-&{os=Cz$pcrfu@%mVCUp_$ow6Q5kGk5508Yp%}WQ
z%FJz~n=uuD$uqjLlhVL0!@U-Tk9!A&wK68Nz2F;Kf~<m?O0HB>wgPJw)T~)h+q9se
zX+dao{$2CNPx*N1CrUn2Ts#G+R-Gmyc%W%PnM)GB%yP~}f#j7_Qc`RaM6B@7G|T!b
z#o>3&KYy?LC%}a-^AM2ldd60RmjW=Cu@wsO#-wg$j6Q)XWlQ;PT2MpT8$IPNRmLTk
z6(P+Tr9vT6*mpPcwnJXFeK(1HpqpU2_vO;PSLk5hQKsW;E1O?sOwU_I2?Wt|pm$K?
ziPem$xhHBq?{(?<yfOwRGVsX6TWdMXAw$u3D|(!hxkG9Wi8|M(&LMpl>$w_ys^X)b
zWc%w@!&?nR`T+A?mBmLD2!5V-*D2%5(@E5~EI-39YG8>DJQSq-a#kr$Wah$vuEv60
z#+c+Cbghi(e(qpQ*D=i4JSZYRfcGv7?_S142jpUIAI1q0Uqt_lIbO|2jDz7E`ivzU
zznG4faC{jbYw3tLl%PeuMHwKzivCfz5pSgbcX9kOI$qB4E9e;F_!>H{<#;n6(O$zG
zM|nm#zJZUed_@1WiR0JO@jCj?7yRc^v$G5VB{^?CJ%W<-NMAOC|D0**B~5zs4S>k!
z0m^K08b_Dbm3^W_)xK;DDgQas7_H0=C0Vn(GUxs0Qp*)7LyMUIT<UYP2{~n(W9`Yo
zsD5rJNv|HrK3Ae@cs7PqiK^{395p{Tl&CklHXJP@H<UPNCAp!*L5s-^CF#3?>~kfm
zHDzN+m8h0w!_mreLy3bHmm5kPw7%R>;-Dqwh7t#@GB=bsSLT9*l%&53m3_LzQ9W}u
zsOZtEb3=)PR-PM5oa=KzLQ0%i4qie{TA!m|%oKk|ol|9TroH33iLglFs#jHM!D$;B
zqL)-=jQ?HK6!kgx(h~lKnr>xrroC@e(rAvr>A*AXUEPb(xvx+MU0IxI@9Msb@COxr
zroD^A07WW`(d&Cba<ZIE)aTZV-k*}n%Hm9W|2XrVLeRqE8$?X{UD!p0R2H9=#?R!~
z_Z6O*bFc2n2-`&yBrCN!_v#*t@TGLo%2>%l=<o`;xUv{mbT53BkME`z$d$#J{z0x=
zA5r;wi;%193lgs?JkvkmI)t!T*`w|_R9f9bQLKh4z~W+D0lm=9$A2ch3yW_OIPHgZ
z<k-c<i_*BdPofkov8~zo0_AIQadn!Ws*MWW<b=h=??~g4uR&!`O&XVy{)Ez-=}#ml
zKU8v-rRhb^ekG?ijW6fe4XS*jX&m=E2w1jaE0_OJdc}+0H68Sikv|s~<I3&@Y000Z
zq)pEIeef-0@Z#c3e{~hhyO-=)T%75z<X-2YQ-NptD`{U>p<YR2W*IpA!Utck%4JQO
zQsmV8(7#LtvADQ7O)q}_t?CD^Oyg3%?^E`>X`IBW@P1{#cq=o93Vb%dO%dbb;tkC0
z-9sVq31v@f8W($-s9i5Amfj-sF8ev^9~Kqkj>rpA?w=z1g~hiBoUZ4ep?=0@&l1X4
zWpQqP*Hc$z>raSW1r!bL9c4|3iBmOGLC4>z(Nl4$V9KFpn#Of{T@LO&rJtN)dg!~9
z{>2`u&MH7YYK74I;hi42y4_z#agpPvm)xlW^rE&4y_6gD>UK)IH|eE^1g`7V<)C(n
z{n9g=@}<W!<zGy^2*4xsZ?p4c<X;5g6ioTG9-QM(>G?swk^aRVslUL{3Iu-}#Su(;
zsj()#v{&Hk=wIYevrqx}X8IRgu9(2lngrMBaW^8kPOr=N(~ELKfc%^3U*t$z1m6wx
zFG1=9@Jy?BoB$I5-^6ho<jMm4It>^91K*<Ih3J)g7O(}F7jiOJ&uqP!-X=5t1^V|g
zuYLfItCiS6mv<F_x6!}gas<Af{w3)C$@IqAcD_r9>8SfBbM?u#6VIU%biGXi(oxsD
zR>K1vhn*pg<Dl!!TxGKLN*xBhuGg<VNLvPd06!F<cdLqdKe}EWuVosOUe|k-CP&Y2
zi-rd@Ihm_ic7ETZ(d&9I*Kmo#9$ZHx1UQ0rgL4uv_J9B!{}QAQ0F%BN=g`&=fTQh6
z7~lwSxrPI}L&N3T1ZbazOP>tr-!;69<2dMRf#}vC9jZ7p&@0y<oV-NCPft@*UD9yr
z`*C`+hD#p>T-GW=K3%%gVV_1X*C3pHRl}tY0I!As3OLBM80iKLmp%}9M8nSnz@bgU
zGfx?g^BE17YZ+J`&~UkT1OBvzp94Sw7dB2yUB#)hG+eGVz-u%-^OQl?2o29XWl*1~
z;pagBhopwfwF#&8Xt-R9fgjTF^8s)u<w^<r0|L^qO2Zdv_$3;?Si?gaeu0K>*6?Z#
z$69Cv=)F+Iyr0`N{2dyOHQorImuo%JU(j&rbAZzdt4+z^>S&Y}n)L6ag%TZ6wEzN3
zue?QXvX;t!am<Q=-b7u)P~YILzIKw**Zl!n6*fTIRM2WJZ{v#9yy7O$0;iQ~nM-E*
z+H9-8JleunoE2astzp61Gpuw{>tiJ6zUz0C%-X)8o}Q?;FHbtdbCrShf*tYB*icXM
z1Z4yp`{FxE29_dai6|%+!Iee^=CUA8xnX5*KdnKc!f%gm9qR0iC(=gDS=6jmY0lDC
z`B%%l>-4-zwl3c~J2)WMgKD|m94gYPXw+7fqTRg%>*lbI4#upYC8%0;Fv>O~@dWF}
z9IdIFrEbhs)a-R*uF__!8%h=&lv#jCejJP^xo4zqGpN?@MR&w{qCoq0_L^YMibGW&
z@-JaTAx7#}M$?^wQH0G~TQ_W~jpkIk=4RrdUe{T+Ezv(T;2BlGN<`I!XQ_a}6&?L#
z3$KlfH@EKS?VU?6nZH8XH561qXQ^K&BX!oQW*0n{*6!ae*<}~zirI~(ZXwpu)!(kJ
z&OubK>{7MYDX*|a|H<43U}?O%G3f5=h!4}k*FvkNe-Bbu8>Qv8-N|lhgdOq0_C)sp
zt=&Y^NhWrA_cAfMB6cSFd!y}LLw(y{7p+*TuB1gf`)TEEUVU?^82*=mV35iy-3DLx
z7MLSlihTAPApf#C8GC2Hp*$(cv-JA8atrgpT$&xN8rO@_rz5A*wX6rvS?4Y0om8u&
z+ke$6w_+`Mbdc`fo4YeD^JGNVQG@U4-&SXnui8W*OVnq33{baTb<y>ajcb}B(ddR~
zuz@arsz;dn>hgS7!4s31|JrwAa&s^KbGahV-oDn>(QXFnYEY+YhCILdR93pr@Ly7|
zygF+GSsR?2w)BP#vv*9h>cpi;yB1QTr243~9-%!ooBi@Rrw2p2S4`i($&;|Z<N{mr
zY&U7>z`F;d@%Pi#5#mwv!H()$VVd$+Th&><Zu(}si+f!&Hhax~oimm1T2p}gR6kkx
zULC5r`CpSytgo5fXD29g7T@SY@M@UqM1N8=7|TO?St1VepxLMN!BL{%Vb(OQtd-Ws
zm~k?crpS))Fk2e@6DfyGKYonU=|Lac1^#(rw(++zlRlOW$mIVkVunp2oYcZT9we2q
z*e*H;I*}*%TYdDmu`HqIWRCu`ee@r)=!cI)p6HMI=pQIh|BXKSk683Wx2eCL2H{CW
zPWg?netqm4km>*B#BcNeH0!TrIbC$bdj?bg*XZSdP5)lz!#i0$nEC_slETJ+oSF1@
zhk#7}zoVBZHh!5GuD|oN@qgDxzr5$r-<8<--$Dd7{SyEwnC;E9e+fC%#($Xk^ZD;F
zdTC?h4{*c%xMxQC*VO+A@!QJ3hF?ZVJxBSYD>BP}5n(p{`&hsJ4hKe<`X_z(4>P~a
z7XvSX$v;Sy(x(3icd9b4%;V1G?<0O&{zI1hqb-^F$7juK`lUgBRTT5lw7-E~irM%l
zxI@<85kiE?KjK$^m>+XS^kDM8=)+&ZidX2&6gT<L^YMQx^UFLs5o7W{K`%}9_ku##
z%GW(<e_eE<iT<TM$q{=eEB|qQ5&pegQ0)Tn(bWGo;#0B={w<dB$9p&yn|?>=XaCI>
z`_~e`*e%C*Q^aO}1;6ZlUmp7#iC@Vw>>ptJYndPZTSWhb+TX?Y3qAO8(<64v@vo%*
z8~R7se&kILrvLr?H(=3!B?%I}a%?AoHvjEm{rTFDpZ;M>`K`C;@1=a(^zUW;ba~AR
zX8yZ~U**N{-(E}k)sQ4959ycv?7zcezf1h$H#w##VzXcNisIXVbRJCm?;w69%dr12
z+Yg-xUG$InCWYF+$5Q@b;upK+_&uNUKYWtqf49YdS6TG`i%<E>UQ^47M-Qg|?)54E
zDt_tT#?0_vE&Uhjzb{zq$GjWyn;d1Yqj^U8RZzc<AoFCrRBrz-dmX74`a(p<VYYvm
zG1!l5Nul=dv)GUML1MQYzc1Gx!~Ryb|7zAR2h;zDh)&5e_>Z&w@HqnPUq%0g+W#$!
z{g}rjcFXY^>Y!}xZ!g<_74hi7w7-S;ZT1Iva)@q!BMB<h{zDe~uOWW1TaNqW`O)+r
z+fSGGtYF&z_r!0rzm@Hmeh&V>jQ$I?|3?=4Hxa+sEyn}YPuTn~pR36C{PZ2-x7pui
z@&6Tbu>Xj~{_8CEH~CzD@mz(F&;HAZ-)8^a7W>zbyh8o|G}|xqD8DWAFMgNf3v_|B
z`9H+==evGCNz96$Wb2`o`EgDUX8rTKe*WI#e>{td-E!>kssC-PKVSWi`qckJmiq6K
ze(|TY3qSki^CtTJGv?ch-E!RSQ~w9peySc>!Sr9JPyIh)vHxn4RH*%Doaw0*`YuY|
zLjPj79Dhv?w$-1JlPv$UEc)MT(Vz0Ezk67JzWVD|e&?}%z5JpU{q_9(Ut;vXceDNm
z;?aZnQ?TXy{BK^rr@8!wnGpWJhW>>=U;V4G*xyF{Qf_kmC6Aw&_8%_L{{J9;CCkYF
zK!B7{(Cx>3eAE8F68(xg^Hau-H|x9b3+1O+e@Fm69u0VrT28}%nD;OI;=gHr{-<sr
zD^#)mhAcG0FYpV*kNk%O;A7PyFQVrk^T190U-Z%6TA=>F_R+t`q96T_ssApizihW0
z?krIMN4frngprSBi@k`RfAk-w{s{H+=s!&VPZX$sJ@MQ8KVs33_G{`-a{p!OpJx3+
z@8u@LFX?{bx9Oi|{Zh}mh#_XtABBF)_cF6SJR!>H2w&-;n(dc*o<2wAg77)-kp2~Z
zIevxOxx~{%;A4IrL)@gjo%}@DK(Rr%m-*$}D{|WO=Ld-2=D&&yJdO!282GP~{)J!s
z`e(#%>IP>6_kY85eMErW7t_DVuVxfyK9|Yg$PB1p+v_t}7p!YgXA9r!b1&Bg*b%}H
z{jMO3yuFKdPYe}rIpB`3#EI18Q5?J==V=408x9b3Oiu9eTH0L89etX%eEMUDJ63vO
z4dJwrW;N}-^jjr{M7L1<JIK5Mp>XOqv^^E=7p0KYgS1nlckY>?OPf*$iDyYh+NC6I
zsE&4#s-UeiZ#j^9aO#}YgCc(FbP}X^*QNd-8Sr+IQmARK<i{_+e)N)mZ@0`a?U)&&
z|62MFVE4@Oh4bMZT1Q2W@Uk*7^cFGA9ly0kfdqITAr(t?S1W#RZ`9GJX_vKZhtkey
zw^f%NTvuIDB=T<<xpj+^yf`vGSQ8nilh`YeJV`rdDGHn&dT!*l>I&!J+AT#x^QIQy
z=#CMoBFJ)a)le0=IN<Gjnr)sUR@TvaHnnvdTaYXbJ~MST^n}Vk`QT8g63@j!J6>XM
zKXda+-9Kj&J#9u>uy0_3=l@oV|J}*;ZJ_YV0Wkz!--(t7b}AcvnhGGhL@JaQ!l{F9
z>bz<ym@?Wv)2oWRC(3t!nv~N<c5SpRU2+k2vs)ByJUDb7L0f2R#hLOu?gRnt%bHrd
zWhw%KU%8_w&-w^?B%JzHr?<B$wpII$(xgrgJxc{z=Fmo=*jJN^d$4V2!PJ}ev^#cL
zwPMIB--@A&sX(f*e;W4T%PwI~;YFC&NEJUNXs=Of-(00tRwak3>}g|2$`0AS*d4pN
zE%*#Fdj@tn41^mWNzR`-m*PWbA-~B5oL5*J`dZpmsiUe<LzN0?Wz+{;;?7*XB}tng
zN~4)v+Xf<WGi^Fa8v@EnOXo$j>8)eEjpisT?)c>p;<=PI6{c-Zhn7ahF9aAFUy6ga
z7p&TW?pd8U`LsKFsgry&%gNr5&Ydh##lqsa52U^Enr0qPZ;3Zqf-mr;lb$`<a>xjE
zRS00VTc9)6-4pL{67lvS`Vi}mxc8}*Kzn~5eeq+co#vAIk=WUj-MzH>MN`nz-P@fE
z&{tgAyGW1o2H!soMI`IL%<seEnk?hhYE2gHb9B{$GWzv+8o*3J-5L;jHSGk2`}<af
zX4dcFUWPoO!e0Cmt+!9wI@;igHg}>;!{XQ|iuVemZJ(5!yA?-94($0dW2QaOd&r<i
zzW$vt)5hO3E^EplyA0Khg1T~(jibe}1!c_(Dqw##pZgRDyuGbx*ROT7^_jQT+fK2c
zwg96I(bOJbs#hWMI`EJ@*`w?u#XV|kFWMGOz4sbn*+HfoExtwRMV>yx=PtlG3b0e&
zrJHs((7Eq1{i`6>_uzu5yk}YQgV~#K!QL7oFXJ1pZQxCp5f@NYO2=^mbXxXMThFwk
z#k8jw`D%;$rGAC*EiCWrph??e?(0>2L-xjA%?oO2lQ3heFG#Qk+g?(SsWH5Frs?UC
zA|2-Py<RZczRP>%skr}qr+R-68Yvr(o*%T4(1PvzyO*;ZRgOd}Z4GSxdrZ*-q9yo$
ze^**}Hd9H?NTzq*f6pk@;<ANM%6|{2x8=|RC{a6~WuK~NKfH(GCE98KJ)?B5XBbMd
zR!!=7raoj)*n_8t+)$!+Tg%2vOR(n#{csSEoK1sLXsc%E_rXu4cA<ZVm>;d2DXO<N
zIasr-e}|YJ5mhMiksqW7u*za`Du=y%{7WDCSNh2Ls1H5X`P%G6*JHzf<|AiV`7_gA
zBwuTkf5a=^UO&jfW%OTJoOuH*^p`6CWZH#reo^^>9~_BS`ub_5H`6Yp{e6-I+U)Q3
z!4D}rGj9acwSn~fqRcJ_->cF0TvFEsqCcqeCAG=h(~lr$8QE#Gr(5MK(_35sVhUeV
z`O36A$=8RKojd?Zbn4nb$3~xWzg^k62qIP3#>WrRv9egSW%hlzhw@uld?8agj_U6z
z^-n(KzRd>@k(`Ca7p3Kp87d?cUXz1k<H?1^nchO^AENTI)&CzWzvb4q6=aY8eQT*F
zS138T_2iEV&-MR&h3ER8+^+(uSAD$fF(Ne?=kYJN)F{wHn&7$|l&0X4Z_uOE1Q$zy
zqtpanMsWn-)$}iTh~fyqFQk9L<((<;cWC%+6h|=ek9e@cQJNxW597!Oxjc>kFUBE9
z&+lh69HlRE^!)1bb^oArgkJYEdPTwg{H)8@{i(~>{ZGZN0_@lIN{<9wmm@75_;UIe
zd!%Inuhnq5azQ`-g+54e1kme#L)jq!*X>!aP!C7nBXYVlT(>jDxT#ml(bW6rnjF2n
z=4-g_H{DKMub)5l@<QJx_DjzOdvrOds|cq3OFcNpZ+?3JPnDzIelgcT@~fA-UcMjI
z@}-yWeHyO&=ieAN{qswWUawcjG<x)kV$Tac^wS!y*M~9<*YhP;YLug1Pj1%eb^HCw
z3(rUhW_^GS2qrGqN#J_Dx=c~$)}OVEgI@Q~n>G4#DK7re+q+&~db<XV&`bHETy!~l
z`@LMFzlGumCjE8~&dKjC#!dPU`Otqt!*%=rO2hSX`5R5Xp0BTJ^zWv)<Ts$v7jYa1
z-Tx&TzM12&A7vn+izC3LZUFj>hD%=rXrG2lodonf4L^<JI2_?P<Y(?8XfJXNKZD~q
zoWYp^z1))mm%Z45({%rIxLKo@YZgx4q2U#2YRB2D;nGLp^gnC3{_HDr;GtLA8tBge
zKmiA-!$|9U3Q6A!T=qo=J)Q;9A^Ypav^qPP=--w7`QlhInZUYjb*8}8b-|U!XkBK<
zm;xo#1v3(~0lPWN2?kGw+uZJ^K;v_=-+-0w7>z7^*BKuNoPeY(7n}gU=Y$hr%yC0{
zFQCE}+xxg+j#9F+KS$o|EsSPcLK|$L@#qfP<e<Ngb{k1_$F}ywgSE8ZPIu?7Xn)@v
zwk*o=+FbV2@p0K)L}dAEPK;)wrzOgTe9qp-<^s91%vC(I7L#dX-kpPdtjo)nWmjJ6
z0=F@;)v~;@b1D=q=Emk>{_DYg@|>41E6<8rtz=GLPtZi7TNC}Uj`rA~wrfxJRS0{9
zq*>H!8g&WEf|aD5F(S;_zbCScE>*NM!(fs=DNkE~Y>(mvQno<sJc91nK!^G)pn}X@
z9mL|ncu!}x5M?W^D^Knki1TXy^bQKM`kZ!2@pgC{+%=et_eSH1M1P{WyY=dJ2RTZ{
zw$gD|uR3lW99%Y=ut;6|4qEb?muv;O7fXZtdA}q7DiN%Wb<h?A-bJiH4%#k_HW^cw
zy}~$xxJ)Md(=73xSb8bE??wW_Ann3ITdq(q+a7Pe=DOb29j#aH*i;v7p0$qKno>P#
zRP!|(HbsNMp}y|-55<)!VFJ7c+T2XuQWb333W?N7B$&=56<2VXJQJkvwN4=NMY{Rb
z@1sRT2oD()-iyHzE%0q*8i~=M4KR$|=pm#hw77n64)`^?VVsR$o|8m`ey<DcW#Wg-
z5E5G0!h|kkc=km;<(^)i2QeqoroWB(^m}wbrvBH6*`|Ll6N(<_$Mc7&|24vF`UeO{
z(4Se5Hub+um`%U>&L*AH_2W6m)PFHC+w_kREy7;)oB1*Izk~Q~`VTYV6U>VIqbiyD
z6I3WR{Q-a!^5wsm_-*>{;fEhR|9Cz#^<U;w{<W+>U;SI{Q~xGdzpHZLz3)X`GWD+_
z%$EPw0`rePz?T0qe#q1FkLO2I|4Pzh)8EGW^VNU&$)-PG(GQoH`u{gE+w>2xei?Ts
zRu#<p_q<R2*~9!Yj^oGwj8FY(VEgwlBkC{4w@mx*_o+XJS^uX*F&|C)zwJ|hWNnbH
zAJ5yS{sW{3s?7dZCTqfOJ(&72Z_rkLTX-;_mYE?3b;;B}L6}YdKFSvY>Zcw|{r^HI
zZTjzI{lm-*{b-A({&t`GbDZ^G!2EJB^?${u{sag|$X9>9<WqlS0?i&zjGFI(aY57m
z+kEOz8|#0S`Q>2RztgAw?BQ2bPiXoveroF9<x_v!P$(3(d583`sXyscf4X?k$YoBH
z-y-@q^`m@k_2)3_U(ft<F!c}830wWy$NF{uUqG~`{=X)`ra!<J9(ix+r~k9WZ_^**
z!LbGir-1xlNdKn(2G-Bj6{ITsg!MDKz{=Kif+Fwp;m4X6gnaz-eE5G_Apb_Xs6z+x
zr-z?0{|9uC;$n{+e@-_g@CjG<H1%fg&}!0%7vXA=M!%kizcx*2=Rbh^SIgXd(QmM)
z?HBxm;HQMCNBBP{gnX2I%W(<WFL9mp1+zmp_=Ps^@k@6vurtm4dyR?(U+bZb_-*xf
zm<MqWv2iG0<Wcx>EkM9GvJ4dpznh;MWRDGq!L{7vUmk2&70`k=AKwG4bMsf!*L!CR
zpPN6T85mO5g=nn4i09hB@h4+)SMHc|F@fXV3j#McFEPunZEoCRqSxmzi7b>^g+*3)
z7J87QKA}D5dzX_vtTER&06d_D5y067DztGgZ>VTldw*|lyw5VOLu0A&W$QOwyHpMA
z(6cs12hu|;<`4;TdUD|(iQVk?AaR1*+;<G|45!fniUBjbicp#&J7V^os5`UqOFa-N
zW?euRVe32O-dp+zye~sO&9;9#VYa@vnQ&V$^S^_LfT3T~gYf6;d+`p_lnFV%(uHYp
zllBXAj<B4*_bBt2c1iw4B<!>K?;cj9`wzUrFZjKLX<eI$b>zDx!;C;2=uCdv9bQ`%
z70A0TYW3>X+*cRg_qOqKFiZ*IhkonHYu-8`1*jid2GQ#7p7|Hp>XtYELe?N)O$3%I
zGzVYoq_C{~{5ur=QT$?MMCHt3p+)ky#1KgxS8HRM-g`jN;^$a8=0*Nbr)3>dMP?C+
zTGgeyVDz<9o4$iWi<GZ@(VZ-<hUv60i`I3ysh@cs7%Q!Yf366perxy71>_%QrDYPi
ztjQlw6$dBCiZi^mWtT>1HP~t7Kdc6$g)B<V>+e4|^>|hhWF;t@W;#Rv#=c(rU8~V|
z%C%bc*EE+N<tcr{^%Tc^cv%lX-*n%of9rb-&Qp*+8S;7*l8ud6uuodBdo0+uEZAWS
z_A3iEZD7ck%yqzZPG29P)^~iOxcD!#)<<~jJ3`#|>G_oJC+S$1h3+;BCf6dJ_X|vi
zriB1s-e=*JbrU-85rbC=@cFUbYk~CjSa0CT(Px}wjIgaM@aXj!Bs#s;NoQcPQ=bu%
zIpP1!X?|$Pkg8aTnz3Ynlq^ZlzRo^ZqGnKKV@TQ733&LTTw+Ckfe(J64}OskzQhN=
zI0tVaM8B7od$U^!M?Evc|3??*#l=#?y!{J6Q%yHaHhK&z*ziwKy<A*O4`Uoe;xQ%v
zRDsj|$3H6iO#Ko1n~8F<_AO+=&-bzC&lP>9UJ3mHr8iTr1n*PynR+Go*A&i!HWU~9
zaU~~HuLLhwIKQMKdez6!@ovIx{&~&^U!nYv8D$pv-Zy|TV&?_HV~YNKfzx(=U*U^#
z@E;ShSeqX&a+WLmFHF-*U-Yb!lc|S7kM$mlwR!D=zemZ*)I*Vj5?@%nG%cUlRUmQ|
zO6eC~m1i`$ZUKi^1()$#;23`uJVbE>lV0=yucCjUF9gT+(MAt%+wix)PWWOUIXb?U
zXb_OEchJAs69Y)W^v?%9IEVgA8jeyHIl6yPE9Qcuce2s@`3<#2=wUYkjykT}<A*OJ
z9-AB;4-gFk>Yd0$x*k6ifa6~R`X2;f)a9hZ0LOrf&4BLEaA^~O?$&VWg8_Y6!!x}l
zJ#%Zgv>`x0((p_#%FCPS9PH8OgTAWKpU!a{Dme3?*XM(-({TM=o2(NB{Q?N!(4*03
zdR@mE(Qv*0`=o|vdSl0tXH3Yi6ybFImPViHr5#7!XMtY&3b6f3qtEo-bRsk5V^eZ9
zjjZ6)f;3P=AIDmW58dI*WL>eoj-GhJ_|%@yrwFqqMtWZ*)aUqh#9DbKm=oLDpU|fM
z<S<@CA2VrWi|CtO+2={jtmk`LcNpLInw6Zy&4E1k<6*N2?~9qA8k?1RXYZ`1W3!%y
z!;OsOI&M~i+`JhANQ0RlgMyqnJ4LQXawcyL^bd9q<4cX|vu)W5$i!>_xi%pfkxfNf
zb0>qD)47bn#Lh%K?vM>Mbtz}=6`Ivahl{E6)ca2n7~sz2QsX2yV<B^fC<aXLJ8?3E
zA4|~tWSqwPg4y^@xq6=ke%!f0W{Cdva36QVxVJ!9LI22#^x1-cnK~+){#GziP|w?5
zRQ;OzzexNx{j%q+%e>H!>yD{EMapgZ_c5P-tpa4~zk`@<`m6Y2Bl(1WT*plP|LK$e
z38F>Fr~l_Z`LDI;N0FHNaecAn|FF`YUq8NiVava3(U0q_ssB2{Z2FHBsQ*1gXVc$i
z(U0r4sb9vH&3b;kK>Z){(LZd_kNW^qKjxL#@~=Rm&sYBU`IP@2i+<c!nEJa2v+0-n
zpnUq<iQne`do22KpJM9&ijV#PjG~ZF|CflyrhmesANM_`{=+{0uPspjzxw$935$L_
z$C>)EpMcH(A=dwo#G?nZ|0(s+f1LHVF*EufJTIF1my#Zv{^P7apZ{x!&gOsFb5`&F
zZ10uRd&aY!=>z2pA)kKPGd`rKGe2E?Q?Ki{&Fi_zC;t@%>c7q>|FY+*t{=~NrvE2>
z^al#mf4`4@+4EG_zsREh2ZWJ`oco8`0`)&kyteY+XYv097X3>|k4=Aw^^3oVRRy#D
zR}-C0{~?S13rT{=6TciK<u?7T1?K-hiP@(Ah($lf5lsDl^NQOF)c-QcwCSI==*Rej
zssC!yW6S>l>lb=rRl)TCl|*OLU%?O0;%D?f7t_DU6CAqn&*~`Vg<%G8P7h}KPNK8D
zo8Dy#WFaR1hX@B&t1F?n@PE$0g<p=isZGZ<+A7@aT7pUYW{+Roo#qgJ>4)Wn_)pRm
z#BcL|4f}tZ6~g}*BNTq|{|e%_xvGpiUfDAgVlbv{@_QefjP=M1>U{HpR;;S`w(JZP
z{%$%XN=bi+{_$HyUO%SdnV<BYdFjpYGUpI;$5o~d2%4XNYpf$GIgG~I+v9_S!u)z3
z-`KB8)8k0yye9Mo7z;*_>on?>v?VoOrS@WrV7nLf>=Xep1u0U<Xahh&WI$$8Aw1@#
z$za&`@Or$<`zclSB5l>TK8|MFQw+wG&`dR3u)X8M*s1>RN%D<rDg0pu%>CE*oRV=s
zw8;uf<2{pbea|WJ^+yzrr$8@=-mg;9rWfDyt1QmsOZ5H&;R}m1qn$M@ZxPwDus9=0
z@KrwYe@?i~4}Vg4uARs)0{T0gl`(C}hlz`Yz>y1~r!G$gxDMw8*X4s(a9zHR`^gs%
zK%V%XqUkk0!1?wZuoF<f-gQJDbJpePW6sidLk^xPB?LGET*?Yi06!FvU!0Rr&k^AG
zm(a=)VB#x49U3k^0W_@PS<lhY8*>MMH_)hVu+h@7*6-|!CA~?4APLf^sJq*}wU2Tt
zYY3QDC|c!M7b*wq;==>+1nu|PmyGrJ^Qjq%S-O=t1vkcr+v5XR*PX%alG3Yc3sDQ=
z!ZKECqbwj}iVq(Wb~1A+tskoO@o3KAtheyd$uo9pPQ>&wY56#A0ba^1O?}-~R65QK
zH3q$Yb2WC3aOIZ0G6dJ#4zRlj0G3tfDIKDJTR>l<2fwke5EJQb43P8(eA@9F`>JI{
z(obOA0r`}^Nbu!8_DlQM`w-|f^}mz&p(=!vT5wr^Eo0D+yqNmYr`h~Bz<ff_$sGMS
zZ___)$-iyvb%gkB`hg?l^FQW_*!1tQ=*RU+@+1Dg!N>o5pqxTJ|6{(DP5(WtU-v(*
zf2RHx>fn+8Iw;e^Uvpf)?*Rl_1Uc@d2;ycNx=&HjUO9Y}gXov^r-|8S{}XJ#%Y>*u
zxYi24`0p&X-_(DE`SR(<+!UMs02jQjzrvy)dqUctJ<H$}OEBU834WrJauOEd&-d(k
zg!zR}j$bqt@d*?DgU6rq?0F9pN<9?0;(tlw+0^F0F81Fr6QcZVW3Thc|MZs=WbYz*
zc7-|6E&8SWm)F(KX-!J~3jSQg9G*REGPl1@NLd=9`8YH$THii>Qe_xsZaJW6=-Q$n
zNl{wez$J@l!}-fWa*XNZ&{}@4;<#g?{EnXy=#DD}cWfmn-0>@m-2F#O!{1!=rXL3I
z7k=rN?xRn+-S?yP+?Sqk$1j`b&P=+K6GT4ZUQqhG$XMyi&8huOAA0h&nVH+er|x&h
zKQc}>Dmf;1(Q)?_oD4sDEVAN^{Y|4sike<}qUl3NezC9YQ!T+mkyPpL+%aV#ecfWe
zo7(U0KX!WRAvZ{Im7&z33;$uuyU5BT^WET~)cy}WdDkzBNZFI+islfht)vq-hy#uy
zU-W^1J1S`pc-Qmb`>B?E6F+#Xk#<4qad-c-Z+C-_yWNk+Q}cV=qWj&MhY3w3_fNZ*
z!vV=EkOUw12<Uw3to`ojMDf)9EE&r55<B)8atc5R7(37jGDYg9p16t1@&D3iboAl!
zjIL(k(X;gRyw|(j|I7Ru^l>gb1nm_8Z4J+>2v|dky~T@<dK<~(oV0O_ZR4EU{~YmI
z!t3#j4)Jq;7MCZsY~%d*>xM_N1D=)jXIAA?!r+@+YRCB#)y{?5JWal|IdQ`EXL>1v
zT}r;BGJCq=S==W73PqoJR#s(1*hM7YMt`Ocj^|GOSznbWVGBvGEx&jB*#Ao<C)a+-
zH?gVvWqGz1%W)ph#DdFnE$Gn&PvcV&6p%&`T<HC9d7j33+@}jY-i0DSul`K0+llLq
z&|^#m0dkN#!7<koLGas{@NYdh2miJY{)~p}dY@+;cA-2)ZxPxe1<@=1IorU69`Cty
z`eC-SQ^R$=+Zl&m_)6qR$(sHYKZ9N`N4bXuy<Uz1N+SSgRVv+}emxxLBt$p@Ouyf2
z({L#}K(}eQx@>Ve=TW;Z7>$J2tZi+LHmwOqH#D_0Z)$B?+uRV1CI+K41J3fy?ZXnR
zQ#`cSQEaFu+1_)aoYn!1f^_EJ^eoH7{QHGvk!#y{WyTSDy8E`r6HC28@<C&zXyLnP
z@dj11>_nF9-R4zZ8OiQe>#sX8cG@&*I2PSD6iakOX;>s48;sLDu?!Y#fB#T-BF;6(
zcb%y@hEr&X(QLok=&Va)v$Iac;IZW2)XS^H-p*e6b^yy(Qcn(`ZL>~3Tty95Z?7V8
znmZEgldlK8F904Q0N9C+vHSz^&c-j-Z|FiWubKA{hJGbP|9TkUPQ_&q@5Yc7^q~m2
zH$sR~{%!i()LHLZ!clcF_1{SRHvRXpe$fN{fK2^^gxT~DC~cYh3r^<bzmHDX^dGk5
zA4O{FZzRm7e-A5^`xQ>+=*K;(O@9?vhya9BK>lrGEFiP#m-i-ep92{PrvJff)8D}L
zS1*6t7|S%3AADj|bElSY1jyEdna2F0+4yU8W{R8q|BEs(8^7$|BVs_ShactPH|fpv
zM&h@Pkx2e^U5LZqdbkq&1k~yv((J#_8MyGv@uSRdkU2kKeiIiy!9zqx*nmlXm;tHB
zLT~2(QlhifpAoJ<^8AGQi)S_Amv(&(@teA#tBosE1)qf7w)&r-x%>US@^(J|+VK^Q
zE9Sg*{D}54D+J@55RF|HdEd-apKyF3oO&&50d>`j^NN!5+_76Lrb^xMTZ@9;7ciSr
z^L9@RpPM12Z(ddng=m#CKFD~Bx5#;{hCkCsORQym^^2v|MfAnJv1D~c%KPf2JD#jA
z;`mWzlrwh4F)zZu>9yVT?4MDI<=qitE^YcQ3U2Bx^Z~*<6o(Qs)-XC#I@Hp#dnWnL
zu}f*4b|m$RJGmdvChENU$ls5##C>IW$z-_bAW;rIKDMs9)L6THQD*Hn=f~sszTfv<
z45}zV{V4tT_+plw6=PSp<D09`_>OZ;=}2%wQFhXoA<2htA&qCyv2t`e@Qnbmm#;ZQ
zXPz&A=l+Zc@@~b@DP%{L=UK0^&;}nny4&OYDZN0lKhQrA?+ZBDXSeky1I-(+w4kxR
zz)&Avx3wqZ9Ram@=^K9dMEMu(55b)0fWAk@P(BU<8t0I2;HhuO(Kqm#WsNj_7!KcL
z!*!$;v=q3ht3Is5gPgy|QTrC1thN4t$Wh;-t5x?AcQa26$8`$=#Wa9JAFyN8ez1+P
zU|hLKo2P(vc@pNb*4f(&^z`)Fuy?SK`P3&tzQ{$NCSfjPHRn^GrjI!&pOc_J5DveZ
zp`7w%!~fO?f3FYzHXl4i3T<OGVITSpie5_H@yeR8Wj^$HcGkan6r(i4IX?6s^YPC&
zh{tB<G9}Hs4(ZS4n=~BvF7k{o<9(z?U3&!IrqRP@!7*lqfbJ5b)`IT_NWsKE=D`YI
zKyjg$dnC}KJO#(RH3Z<gop}F=0372CLVp)P3a}ryse=C*KnkWk(!M~C`$eJuYY<Z~
z>A&c~3fJvlq~YjGM9wW5uG0q?hh8e`blA)>;NlZNT^bIXBz%S=pwHAgN@PEh(yR)<
zXVMi}efw&fB$4PJ*foa%jBEjO8vDp*%}lK*%vLpqk#EB&*$AAjMScBFcYk}bCwC<n
z4JO2Cx*u&5o-?tby{DhX1Uzr1pZ{mu%&Kk<TX@eVXP_tCuJ)jA?}{a8t8&_udNADH
z+)P-bT9g)}Z{7k>P_S-mY>?*6&=iU8zHQ;n(ap8d&B17MbL-WcRz+#hpfPGxi9%}x
z4J=)AH4MqtP^fLQk8WgF05!aEGOB38X1p(&-itdOdHpx#{tIffdi#|2IKhn&dok!i
zZ{xsmHwug&WdW%W;-h)c+dR&lOAUTD{*N01%xfgxpF?KIpgY9R_V+N3@n2-6jMMUL
zGD>Ni{=-a{)fW+F>i-~NHvI$a5YYquFv-;K5@yqXgm46PkL5+xuc?16p*H<@vVJ}P
z$cw2TWH$YK08)r~hxD(hA7nQDwd}ZB=0yH&&vuym4H<PzCx_p${u>40Bg2XZ&@}zq
zp3Si)z!rpG&OJvFU}C4>!k_QiypfnqnUL{Rf%-Rl{5j9&$C-bh7{o^@KY=keVe@|*
z`@f9|;eWi35`L+de?|N@Q}?2=P^jUP$fK?N67g;E;mo6X-hJJIE9z^#`Spd*oqysI
zWs3R<@$cKo>)6LFg~#&owKJpB6+0{4yJgBjd;N#pqDQ9Y^HXUg_0mx=^6dF=YF<<7
zy%qG(SVoWJ2b4(qL0_had~@-yO@ENSHH>Z2{@C>Ge&UaKvm;tkPfxu$YoD~1)UR81
z|0=m8{OHq>)UVzBzb*}rUACMazm;vfCwBcj{L+tFik=P^Jr^FGteE-%J?xe*EO95-
zs#Yh)H%=zs5*}MEd7>TJPH!r|cYWExlHxnp7SXGIFJCt|-GWWkZb@g4#xkyNx~}Qk
zrp@fOrf;K0Xy%>`b2Izi&Dmbf!tyK&lM90rhE+}FU*A~PdEfBJhhBC@=-u;?)S=Ns
zffx5zm9N`>$G_3f)FbZLl@;!#S5_t8RQ{c^(U;$pJZ1Fd(}vzOIq!VBD<y%cD_ajt
z&U+gr+!>@Q+_Cj#3iV1c&412V+4!G5@r#+6(N~HSr_C;DbfVNE$`e@NZ<9f{#z?O<
z((8<Lvyr~iNUt~2u8|HK>8p(N)kZpEq+5*i1|w}IHyS{zk$#VnzQ#z)Gn~Nk>>%lD
zCBnz+jP&(JdW(_1!AP6el$ddzyUsNFj&#h6Tx6u*X{5IrX?YeESo&Z|w@ZYNc>dJG
zd-Vjx&GfsB^ICVQ&V-Ef9Y(s^NXLzIgOOHqr8I1j7Du$xNUt=~XBg>vBfZQ>Z!^+u
zM*7`Gy30r}&6Dmn&cDw{Z#U9CMjCTy^<buJ^ph07$w*&jq@zZ<*GTsn>C=of-dE}2
z0zE--T%`06)DsjRFwz$qX|sGTHqO7_NMB*37aQq>kv7}Q|1i#*=_ST_8LJQ&?+^8G
zsh*(tY9qbMNH5Qm4jAW?M*37Ey~0T28A1={z3`BJlHz9l*kPQ%%}Aeaq<0$WVIwVL
zVFG_ZB7Ceh(rrdMV5H3(%u?fgC{Ox`abDdGX&B$4rje0!%!}aORS#y`?2nxhotomz
zu(>N9pmzcZT0uz*Xae-rwq&fkkKPZ^+k)=C9kk0&2Z233u_O&$1ZWlpR_X+3%bxf$
zryyP$Ac@fnheV*gCpI`Z2hR9ldu)IV!4Qj*a7my)5r_pa+CsBi$QVUXm>FB?OLKt)
zzIGO;Z;;Kx)7w4R8%wr#k>Z=k2OWW13L~yj#7hbzzEu(bk6DN{@6!<Awm6jqW&PIw
zp_Nr(+-dIxl$=WfgG23If!JW+rmah3w?J%f|6npeUg_^3rw%HqiFjZqk#zSB4s~{R
zw|Aq+Y0Ibn#4fybqB^o8o=66g*;S{zkIuyco%jl1JV0B(({FFAy^CtoGG}97JkZ}6
zc;^)t->O8@_F)04bnWpDa`e_+#OGBtdh{CVi6wHfNqf!@^u&j|le-{>yh9)Hi}w!T
zMOH70D-hd8)s`|6qf$0SkhJ!=(iDTzrS$E;Ku>%}yr+Q7cEqXf_EH`KJG<hP<Aln#
zMMr!8P>&b`&kWLgw(ibuy#faY<MhEgRsWhYtxG*^2DT+)y}gw2F7o@<IK9?OfR;Wp
z*s+YJI0ul|UC3H|IM7Y4h}?&9#+@XdiV*r*H*N}V5iwrf7>FeX$>0uZ!eF3s8yxD5
zd*#-bq^VODUoCU4?c3hhzmrtr>xKdKk;EovjkDHS=QKN4I_qgFa@e`bx!Q?1EzSmK
z!?h7-BfV04k8_Q)$=U2&>s&{hLv3+xaBif5mKg0%mvmyiw8n3cT9Xr_{lhSZ-4%D}
z`;xTqZ*aS_)j{hVr0${1iw(ru<4(KN9!t<yTDQfQCgRDVM4!{%ooFBG?WAg;MVDgr
zH+_tN`lx;)p-&UU)Nee|-W}^%8cWjZ$PV;hiKT<x+xnci6Yt*Em2}9vv7SN3hN*9&
zYD692QYwS(bhFply(8{)_9uFmc2dou*igdh9O~(zPaE_P&_{i!xOT)v_cj`!ro1do
z(uRDV#4e|67v-^!4@;>64GlWo&ikD0wCi+Fyfe9UD|KpdFWNqo=-H)!?eU}sQPEMZ
zy5fV~gB~zQ_EOaamq#=>sOh7cu$1~l+7iv_b7*To74HMkH`Ke8OjCL9clrq#aHufg
zGY`b-%l-~$pl67^@qR~DytFgkKh#fcIh{;632Hi2v6c?@)5U?Zm4HJzKVCdLLmsB*
z$U}@Q4LXDI-fpiP2T4VrLp#kmUbPTagQ{vI9eiSwc0`QFon&`U2mS8srybXZ`Z~z4
z_I{cZxWhpg)lFZW^!$=efpaI#j^E{c!1+Kt(N8s$TtvSET`^~CPpogd(@t+$dYq2#
zZS?I@D(8VN2MsOZ4AAI3efD&yuRZAu4UpfQVUNhTvYuG-|I&2~c+NVHbL`@ny$5?p
z--CS}(_zdQ0poS@Tw4i1tyA#!Bmk}4bAFM}(YyUM3j%8v)T~)h+q9s8UgwX_ziZz3
zDIYKWL<zm>|1&_f>NF7%DQyN{2AjSGehT~W<ING6P0mi69GN>HYry3B^ehs29^Xru
zV;oRt3${4`x0d3T?9EOk9TCp-4(fL<a{$0Fmv{Oez4>&m)RLS9Uc~q<Q8UjCkdkxR
z@BCMs-^*Bx`14W5<^I2g&wq#U1DuxU>%V9GCC25s_-@9lxoiaA&G>r^Ji+(}8JFkp
zZpLL_R~e^iW4w}Y)MY&9RmQh5F8TWz<DX~zX0~^daalki&n^GV_|6iKQ0(`<_xNV#
z3yg~&KF;({FfRTCcZr&X$qM;!7SZW*IaJ%Fb8*VQ`78pK9c1^yVvMbNp@xrmZqnyA
zNZZDEj!h2QpuPu&YWIY}?J{SMqUnIS8TuRy)fdp&KheKU{+OcAJRL$G!UFP7rMBKj
z{By7JL#Ccf8!jUroBXXle#7&p%@1coIRzB^Tj^is9?19`aQq7{;}B%7+QnaR8E*pZ
z+v#7%o8UJD&<E&W=%pM?TyhG0u}1$EiX%Wip6x}BjI)BiTEk_0L+GELM<*$K*gGhD
zboz4{2R+7i^2zTo=%41aToX)tq^#hN^O+V0Tw@S`FH$k@C%|#wQkNN02jHkh7eWyQ
zT|V%O7!Tki1)*QUc&!Jg@rxM`8TeAhTMc|U<81~WWPHHDS1>+e;42y5W8kY9-)rEF
zjPEn>OBtUq@XHxLY~WWge#F3=7(Z^{&5SFD(K+$wdd4dNXn2_MfPr7lc&&lAFdj1S
zjf}S%_<I;{Gw@A}4;c8hjE@-j^^ET^@EaK4Yv4CAzR$pKVSK{Cql_Om@Hpc~47{K5
z;|Bf##${X!r%}&G8JE6Ua9l?b0%*__1pfr%wFdqv#zO}FX~tU(9M^S(HUqzx@c{!r
z#Q2DTKf?GP1OE}@dky@TjPEmW+^--^82E9<4;%RNj2|)ZX~vHmc&T*QeEk-GzL{~%
zDL@eX9L56%ejeks2L2AlLk4~^<E;k1lJPbJU(NV{fv;nH#K5m(e2;-|VSKNFM;YH|
z;602_7<eD!hYeiT0Ua^$1k)ck@Fe5v!ln87cE&5X+{FL?lktFof1YvK>qY3l&Unb6
zKgf8if&YN<HUoc@@c{#WjPVfz|2M|>82Ay!_Zs-qjPEn>XBnR`@aGvnY~a6V{D^@U
z@qNN^121D-O(@d*U&(j{%M*W|#dyHL7c*XK;6cVi2EKyvRs&zlc$<N5WL)Z(*wfDV
zh(SNZ_#OlQ7~^{l{4U1#8Tel?K4IXWVf?Ux?`8amf&VSz#|``+8J9_KlCOVeyn>H{
z-^=NMfq#?JwFW-H>5zdR<aDcnKg{Vi1OFbUWiFc7^ApBL4EmpPdXItsmeYF;{P&#R
zXW%b#dcwfvJHdwy{1r|gG4NM8jlLW~>@S+{r7OHc8lTU2z`)<cc&&k-$#}@X<+|2t
z;O8=Zn}MIt_<(_5$oPnXU(EO(0}nF3*TALz?=x_zhZ6?An&liea4D}N27WoyGwk4U
zn|Uhqo|kYAIG&}rJ4(+b1O6uZ$8#WpJZ}NVGnAw&aFPOWJRM6K<3b3)fk|4PM}TAg
znxxO8I0A4y6H7WkaRlHP6AI8jLbZ2LIAlv&o@GG)X8M=(B^o`RNhMvY;pb3X()Ah+
z8ztSK;drK#w2X5=Fa9MRqBsIDJY$CFA0eQAJsfR7g3A%m^Cem#H*2_*6`)}a=Ppel
z6B@2JIr*j{<m*)=z(xR<GFKvauSA*+j@=JeB!=kCNpF1i{SW=7$OqL69FI3Mq23Uh
zIZ==p+ct#-G1_(?G<FT3S2gXu13A;~jS2VJs~LQ!u4C>!zFfp_ll%Lkc#BMP;M=`v
z=!P3;YCBF9C_K25h2tf&$laRrX&6sh_Ev|qU!|YF>Z0o-8`m^NqR|b}V6e`!JPz@L
z*!U2iw?08xwQFJM27gJLubag#y&j1n*hg~NY-<*RIv05tbNN?#6%ua-ld-<!V6axb
z^^4-Ip9oI$t2{1?P=4v{Nl*NB)>635!9r{nKlrbzsap|^(%ZiFu4t@pS9I%;`j{5p
zn1y#@>x%eryuJAv^3Ligt=OO!djyj&PDXCKT`sK;al9=%mo-YHK_aUq5?m#*bR@V^
zpmZcyFHkxXTp>_85=^hUNJoOS{z9$8S(dX9LvXn!aF=>Qhwo7Ts`uw2<nTpaY@XhE
z6Qo}gK=E_N^u8Q;2tSsfUn6k(9_rX3(~n=SJ0c3#Y&~Gy9x_8ZNbw3>94WM^UvJD7
z`IKu2pLX6!m`(p4<}<RNzK`J3&V>}Q=^tPPqUUWy2U({6FA-+bzn5?X8He{$nfn+?
z{|!ZK`tM}LQb(X4*Hu%04Jo(jpCDR<FM5acuj&5_h}ow9KGxsHoY0T)Yg7MjAN>O`
zio!nckp4CGkND`X;(_fp=7fISXPWxU$attS>tBHC6@t8v@KU+{$9Ra1zm55ug^`b@
z{oO<dezOgtT_DtWhxD)5FF*&;+5A7u`FEKR`Nw^*@JqdXjFj8-%edKb!!f4)j}Ws>
z{{-vr!b=4T(2x6SQ$N-&+w@QHM8@M_)`F@3Ek60LsrHz<Ae;j9<38Qg{|uLZ9f-8B
zkL_Nk-;C0E7MD44`EzllCHx+lrLfLBq<`TnJ-q5;{~mNK6z<mS$MZps{e;=pBsG{F
z2ZT`&`@Ix>=aR8n0r)8VpEGdbmt!eKB(9VGq(J@Wdi(>X|DIs}T0^+xUv!;C=i$?k
z0DP?B>(@P;M)~7CpYTilKS=zhZm^W`gCY6{1ek$mKa+ouW<ka~qO@m}w=~IHZxm3$
zi+jJT>gyG@y0Nj&J6rggq+xkkN%}+dkKYT(BDG{^{cYt7*ALKt8~wM^e~A8T=|4dK
z73B-(A5a|lk^MUY=KdX3ZtAw`vV*j{MbS|Zj*Z?)zqCkbab$e3CNfSZ%g+xvv<fJa
zdM%4$c#3u|eTaxhQez%ZGC(|A6pu##l9EV!e%wBEY~;4;3MYA*J4Rxau&fO>s)kOZ
z)jQa}q$%p{vH^=!xOP)3S)QeT=(I^Cna+>wo(PqH@<IBRiK0jyRf~YMB}q<tja8b5
z7HQpDqsVQaK$)YzF2}yHJ65D!wnxjq=TSwm^XSZkazRR2K6Kht<;;W^pQB53e<<(M
zp0aT9?uW`hwf}O&Lgjz{U?}kY(8!;PhRV`f{5+KQ&zLT4=Fo?pgnLij?-lXzn^ZQ2
z&V=u#%4kX0sTA8{@#25i&xto){cM<H{Y;+Yj@?{cHkDI-^0(SIa{YXRPwP|t9bbZS
z_SeBZ5UxcCe3?_@gK`c3I!<VN<)}S(K2co!`K-NiLTYTX1GE%Y;fLnnHDO|4V3g+V
z4X7!CG*wTHh2Dkp6x3~rnhzLN-zb94d(;`n`AZxvdOu>(`|r%-;+UnkSZx)AIfA%G
z<NgBSYWyg@v~^IKcOM?$bGi@e8Jmj_<Q_4f5B9KZn-9Ls=RONNEj~zDd~k$$^7){Q
zZ%|AhK$Tyx&1D2_iMm_L<toW}0`h1|(sw-BJSA$jP&S5CNqPi6`<(xrMbzfp@OsQ;
zgwzt+ecl#I)Ym<8&y=XU#BBUdx(C$f<Vk&djmodGm~Rk?Mb$Yv;yVYnT-|w!9p6nn
zHhR~G9{VU&7H1yJRJ|n`-=hD@Vrm>5R6V6Qs+mpxJe4ng&><Ste(AWKo@pwJ<xNUv
zkMl>U9#(4Ku~PMs=vNbNlaIMQmD=~M#BYD5?B@q0;upUaD?Bs9R`LZsmBn~#;swdq
zzbHF1<*V8rk({S+egLJkYF~8xkg^|70bUUMU+^hk%x$&VFZ$_p)?Ux+SuSuqzQ|m<
zoj&*{H5|DX`mbs@t^tD2*Kl}G@Fg0q%c1I{f@!Bb`v8acM9w0QT=fvToRi6~F6S>a
z`Gw?5)=t7sU5;PAWNt9%^*Nn-x#)6ECSQ8_{=Zs|AJEE6_uHp5{EbkK0k#L1N%VCR
z>Nx@&{}Q@50*tzfblAf&;HX0qzRVHeQuhEI!4C!CnckSj2-pbV(q=&?bKZexdTDxB
ztI_kY7s#C+4bSw_j`K+kKV4CJKl?O1(|gkxkA~yjxr8%d2n8Hu{;>jPef85oZ>2iA
zvG6FmBSs6s=*?5Gme#R#ckYVP+P67ug4V!;CwOtoLny1fEzn8GY&NV^!z~%wLSIHU
z(wie~ye3N9f5qo6#bS0tGO;V#)8D>*4!O4(b0Tsq=G3z(`F$vqC*whpF`KsFY_*0~
zzs<pKmiz`+c-4kWcMigAg>d51Y^JT0s_{A*cM|e!=Fw*(+qb_?rkS$j)vW)Ee2Yc&
z2Asa{n4i^Fa*B8MYM9&QsLwRa%4Aig=6AqM?IV%KG!6Bhn!HO}Bt|=FaeUqh8#J#2
z>mZj6?&`&HR--Hps(vT!cc@;G2ZKX>-Lza(^+{oRXYTcwwC$nl-%s*qm@b0)byLLM
z%?|<pp<g8FBwv1n%vnO`f$7&woDAW|67*{^PJfty+4wIqWSGw;_)eOQe}MVqc|^pR
z{4WqQYzhehAMfLf@i3<s(-CxXt(W`mwLbdgU57mPu$Y`@t9Se8ujPw=t)?G7Huc|2
zm^J?ZDO~6s(!XZ@|B24n^54e#UFJmoq1)6CW}E)KtY4l(Sxip;|45b3rvDz+-^Ps4
zkNYN5f1LPj`a{JYqu9@4a`d<P=r7}&E8YJv$<%*{^w{+8Vg2%4>Zktz(b@9f!1~4h
z#Uudtb*6r--LdIE!us>IAFSoG@mFxCkgxrGgqUsikFfoE`@wUrY5%K)+4Rd=gM97h
zCE~Z~pSF}Ao_kFF%|7}oAe2JB_7fr+oBkTU3D?UHqaLRIuldzq)-U5A#HxbXelcgk
zrhkC-w=o~;55@;f{b&2=Kf?OOeioC{eir)ZKg{~|_JdIzQ~#}0Pi^I2OV<^IeC-Eo
zW^MVGkAsW-$iMBKaRceGy>q{n^(!N^AK0pg<=`hk@+s$pKi@m|8<=1C<oFizg32dM
z{aBkrSk6250P_dPKY9@V3)W5iHvhT247rsR!hZq!7k;_^jS#<~LWvGB;V{(?1c<TC
zSs6@rc%K&My+HH5b6**(^<KWu;X9`LxG#VmA^gzqxnz;r){-{0^fuv?PkfF}RJf`6
z>Kh#`V>>FQO2RV-WzWoTYSJAaKKCeOgi{YhQVo&RaM@%?waPGkOCmfo8A<)t`!a^2
zilo}hWCu&U1qY`D(eJ9wNVE03yz^**8r{^->02C1V@s;jN28%(>`L17a(&tHnb5Rn
zmii9p*zIMs|0SJStIiys**LxHRCjdps1nW}1od(t_W!s4=IFmS_zO#n10tB;0>K!Z
zysJ!tz<W1F`+PJlsG)5^Mo+n`^y4M;a<T)-fVV#geai!Un?X;Z6F+`@*JbmeRow-8
z3Nq4<erGQL3N`pq?-4uI`%CD-dlQ7Y+V^{pZO-;x!u_LeUx+c&K2~8p_`l<$4%QM%
zvPL5_1h3z|BzytLh*mM%yS#R~0O;@3l<$dp9sR4G(U7sl2gm+|6_$$$+-Z~ZHNy4%
zAXMEV4DWXJ{V$|!)+szQDyzze=*uAAqIXKsXGUcuU&}yG|7Q3E0s8(IVo$e{lkun6
zgKw@>7H8g_i9MInHPhzLV@iIeK8SqGd$Z-&d&ie+|06zje#ys9vGAS5hi5Q(#{@qh
z;Qj$x1b-Jm3c&HqBzPOe5rE^8EV!Ti0MQ_r@-Ok=9QoI1xGtaEse)<0>|p`<u)$`J
z{;uS|BEP!)fU@%S&95%sFTbJ}O@OLEI-s2*0N0zx9))_C_!iI?G#oyaFu@VX$kbkM
z4}P2iJ`WKNGIj!7f9HbsivS#LHXUf+#P)$*G{)A^)5-&mvy9~3xcR!ARc6GiP#X5!
zMqd%}KHNn^cs;a5TJ*-goxOR-`_xLM%ur`xE3JaMJ{s}#U8oh*PG#|UCzctbjpi!=
z!<yJ8d`30*gD6?%_!4EW&m*hz%Mv0r3ThbRebbe{0-I%loXL|LC482ZTshxusilQx
zIUkj&&H1WK&bqj4<Gjzp_^)fr`W_8^Ev8VdzCQY|$fBprs8RUb&Fi19bZb4~2<DXN
z{f!7J!$pb0-x??Nz6|Ga1qP<~HNZpou>`#j!|7Y7<C%?L?hizid5^G#_#rbS1bpn`
zPOgp9xW`3Sq>n=y;VblS(?5Ze6y$!uOXc39e2Grj^dGY5M?Y=q{}?H^>6iXm?rZ$?
zV||cKe+?^=eBua`O#K)ux9OKLiW*VON7MiK=88>!$f6&2iKhNv`{*BmQ55o({}CVk
zTUb$>lH#pb$NiM4KSdZ+ne|s)5DCv${&x_KE&umf^yB`?)Zgxte;ItrSN`wy$$u5!
zlI!J<wrc9fHvw(=-$U&Rp~gF;f6el*^wD2y(U1E<Q$O~EvyBzr$NJNXIRabtfbm~o
zwK_;~;m<c#7-xQi-MQZA_vE~(A9H{Rlj0IGXAARhF&HHOLO4VbTm5m_e-liIay*;<
zg<s0`G?H&~mF$Bfet;PeY4X!e4sD;E`DjqSvBF?*RoyBzT3Gn{oUYD{6GCJIdh6SZ
z@I7Do1`d6Rwx%U@Fq}G03s}~b-+NKhiw}6;^DUd2M}vRvqtAs?Gc8Ld%RhWA<u=^-
zlW^+CE#+&TbH`SMQ@;z3KKWXB<{>cM2PcKgoA<Y*j)j-J94^}5()c?p->HbCN~;Gi
zi4?sQS@N8_WYV3y|5;iB;x4)0ZG5Ht!zCm(^y0yy@;gRIfIGISV(NoPCogr!wpX+?
z{vmlOY2DG-vgEmz@#-1^%0CjNY{9tHBazheM~Th3di=6_`e;xj^&1*FoT_riw-*uR
z(1R_hKZJ{pMrfonL))_C*+>a}U--q6qVnB%<+66Xbk&_D$Bsk)_$K;z(B^6yGK^GL
zg(oMUgQ?&A4gFHM-EBO)^Fp_1(k+^B8z<fJ^(1${JNi($J41)*bDF-3*AkKPwJ*D=
zo2vtn6n{!M^`JX;R<*nPhslL*ihP&k1x5-TKkuEi$OmARWXBylqx!1x(k1TL=IRRa
zRPusI(F-np3AoHHIutI#TB1nmSvU2V$~>s)`^l>4&QeQtj5Am$L2IkFSA<7@P!vgB
z8ZLSyT=aM(HCPrY`oqCy%C`DmQq4_G>F*_l8^1TW1{y2eqN8r(p&cu)9xuHFkqgB0
zPlZ$8Q~D!grPVD(M_Y=1Pp)kaJ~MSjBy~Kp<fvP;pGd;v^)*+GU$!bz^emN4OKMW_
zw4|mZsV9#`X=##5s~_^63R(5D%AK6>D$H?mfBA<OP~od8`+KUHFV3gh8Xj9uU!M+-
zucx9bt&UL1(V%yPd^P!?D!%)q_`;13?7T2i^h?T0wcB{VTYlwXH+9$@Jw)Y4pJsaH
zoNuG}-14<YBV#?)tyEOXEH`zaW%rB8a#c$8q`<3lExVtg;-q5RLfKmpNj>Ee<I~kt
zcB@c!WhlGFC@re}MO5%)UeR&4=%A`&OiyIt(O1tV`D2$=hf_aNa3uB1a4Je)=lXt8
zIJLZ`h^q0ATT=aHYYvuP?9do|l~z`YfnBE#o67H<e@_usveBoY#%`~en&-|;x{p#h
z9(K#u91f=@!b=XjMGuD?4=Epvm!3nIyZfQ!P3ri=BuO|soO+p3SYOxFurPUAcxHdN
zasSW@Q>&Z4iEc&vMpmTp(d2m>$In|BZak2zYA(O`t>N(-i>`dvc_ia!$tR~CXh|KK
z`fen3zq{m>aN`6OC|Z+S-h4mlbj#P>f71co{PepFcl71sgEvzhqWT<8y+j{5BjoIz
zr;nGuwdu}z^eSU25FY(rd6?D#dg}wj^!+P(b5Y!qdPg|*-m-8CFFR;ypnP4t>0s&G
z;XV4|+0EKIJ{kL`K9F9O4828tGb{D~v-c(NQB~Lflgt1CF%u9qDr$hBL|G;qNdz^4
zMBm6nQ*psH!Gt9eNSaItid7&Wj4_t}wAQw^#n%2xYZv-=gVrSx3}8{g6_+Yl7cim$
z6+sdH-*cBYXWqO=CP-+1zaQ_D%zJa*z2|=Kx#ymH?!D)|8K2}$>PbI6#?l9xW+w!i
zZbc#cfkPS&<G||nG!Q!K&Myvq5eW!84+2migl<y@tFjuXMep4YHDa8%lK^x>hVlHv
zA9_vHe4i0|Q7Hy?WJKoB8`M}~aDs)9V>thRV10I@+baD;$4w{}`iZS3($D6L;)IS~
zu+BKJKKvVOX!Qd@bd3$hqPK!W#(SU2Iuq@x8`a+&NIihxX|Lbh-pjvs4XIWjw1o*~
zHLOH^+-m9xQbu9>g6*;wg>u1|?Dsx4Du4I0=r{hRS-^$uGSV?)(+>aIXNAJ1{d0B>
z3^Dy=d>a3aIPX*F{%97tXGK35-v>%z9C*I|1B{|+_;tR22GnDpVGGMNK8%Nc89wy9
zZ1ji`InXo%BQk!B&cA6#ao)Gy1@vqXtde(OF)oaz<BZTI1EVqIW{$?_V67OR0%_X=
zc{}TdPiXEt62qX8)@G=24TEvsSKbAK!D06^aiOZzzQIf}0;l6^uxFsD9CkI(T#hm0
z<3QTi-i5SCJ)t>kEZK9RjoW_%iXjF~jBm=`MhusO#8}yiv68T`u~OUG?b^&jtVRd}
z4jJ0DMiUuYDNtE@Fqww7q(IyO7*n#O7d2<)3J_x8>rK{E_K>CuayrU|@ianb!<6?e
zj{7Lz``DKlkWK3y_az*F`rhN43rDz?xKYp0jD+!Rp5baRj54r-w`{b?_JTPR!%UhS
zpWZ~8;?No>mfT7dLzK}p9-=gw>8A-Xii<G{T4f!c+8WLX#O=cHG}?A}DiAV*djXF|
z4^7X~uPI`@lU@ae4S~~W!XSuIXiy+;PjHYQ4ITO{5ciScz9qFJ;I6=k6SqM+OCmX$
zGydSS^c9{*yPu7I6eS8Hw1>JB9<Rkv=8A9cYcv^2#@c)lU!K1ty{#b5#VxvNj~c&*
zJ!i)J>j+~$#2<P)(tIAGJui{=rKiz!2|5j_-KOnE-p<*_V^9PU1EQM-M5s|{&sCOZ
zxv7OC+IJW;5#M?rJ3oK-T5u_Dst0Qr4gaQ3i}OD8E_ei;$lp{9?Rm~<d=LHbIZ7zJ
zVlmK#o(ZJw3gmrVmwidI=R7eMK4YwHlb%hRk@uQ+!EEZu@EenNw?gt&<Uf8B98}!&
zgQWJ;(K);eY0UulybCu1q`zrq()NFlvNitzT7|Bm6>63Cci^ry3`YOMnCtgm*b>?Q
zOl8_0kSZCWQHi85G|otU3WUa{7B`O_jt(RoRc(8V(>@Fy?~i*o;7&z%MdyP5Exn`N
z^w54V+$+hKOff>!F&vU!L8|bH(G~omA~?0rwompq&jfu}AniT;IB0X$aDTIBWcqp|
zZ}UoO65xlidPkU%xYe*f=SjsSpC1!}ceJf2j@w_byT}z+--ib0f+a<+c29ArUOT$d
z40A_Uun`|rj65(A>Q%721tUR#dr*FiP|9_It8}41Z{zH7M%>r_xINy-;)~MPPxYQo
zs}k4}KF5<7JPr<1Aa8yBF5|#6fxKtx-=a2$kxtu-Z<-G*G&)M8z8N8m`sC~YhPMFi
zO&;znF&}##gOL&17D(IUUGRI-mOMCfuLiv1w)vYzBg(>P{0N%&B4t`d^D$`Ni!c>N
z+Gj@Gi$>nNbt8>t&)MXfr>(<0Oq#9dU~9Y!Xii1*E(3~}9GvKHx+1CldtxGXOmWlH
zB$U)}O#8^<=BYG7&mQW}`zKzgkhYCR1EYEDY4Gli&@+Y5q`pF!g=pKp7_PmGT7YBw
z^Z4*LUjgoz(2(^@5lL-Ej7<%xnBy36Xn8oN7p^lx>r4lIZ`eWCg9ZXuXgCJXk4Q0b
zmSYBN=qU2QlgR@=nMUWh14bNXSx`$FIDl8+gqo%ZPZ|A35D;;qyzY?(Mvi1r5ey&r
zb=eNm{?MBuSs<<5h-)t(cQHY_qnLrf<%EYh5OdQGm`!Ib3wvr13yyI6!yh4kPYwM>
z6NW-<PWZ46h3crIi3rW2BaO&r@FSf$-)NeU)PAl|A3l&P?@?AB17M<bVljE!emk;~
zmx}B59~jLO&{};{4`Ni>&?(`}@<E*&71N$zIF~M~DAY1q`$M0gJT~AE0!T3xrqKE$
zz9N65ybSo=-o}4|2$>m8qtH8y#x3Xs>o7veK7elLE!<?}?eaGMH_{b^b`)&dQPB9o
zZRG3)yhSq-a36D<FHxN@F=qQ4U+{wMiRe~4{dsM{AV$X%>r##8xp9G}x+H(|<*-xo
z=ZbYGRgr5);gYl4FN%z=63!&^qGV1olA<EwHe7*^#5a@*w(uiofHW5>C?_fE=ZkgC
zfgeX$U&vpC%1C|bWzm<G@bIJ5U~WQtpMubf1)DxAX#D6lbXa(GfxKOH855d^=NO@n
zg*vU3V-n2m>)r*u<d9>8(6<Vg6sGnH4ibum0SUh6>i`4R-i5!$1zgmm?G)lERR<Gr
zc;mvvL=8wr-m~c2SjLFZohQ`d$yQS)A$T{Ub8GKLcJAUhj7?%7LVq`h8!QE|ceg;0
z7-}{^rbD1y@OO5!pBcci5LSxtYtw25ANLjcfC=aV=SvrGE|mY<g7A_^l<R})xm+c%
z%ss^b0dL|0VVPTK`jWP>cCaQ>u$_U~16i?guxDta=O#tW@&qgKfmpSd;fi=4J5l)E
zM$;VOw!DtjHzV!E+OuJ~!Q@?aGhc9SAuCCi0zFWgBoWRg6eX-5G{5m<Qc9DXkwW2m
z`DxT8uV|Zsd@FoJ==vUi<AIL4*~Kt=5Zr+i8v2r0)I9qvxFSa5KfKfljL-n-Xw&Ky
zd1yxC>Ue+XwBpdM7|q-K2i8zQ#oj{vhWD#t{!I%%0vP=3^UV1-SM5msrr15x(}KDQ
zxO>ToQ^RlCrrD#VA7(UNBgC=Vh<h{N`xJhF{B;Ogup{k4-%op!es+6roN-c%(R-s<
zX%O<kJ9}u(UK)B;g)CApPcoMlFm~0awx|0;?_$vmOANR16^6A~VK`5%FvxiY8bY=L
zTVfDDJRVsy+2-UAQ=5~qp&{jUkx2MYsKA>5F5WU^4il#TOrF7R>D(R@XquKpAdhJ;
z2{ccOqp9(Q(!aeh0jjrYTcG)78mj}|3-*YgG!M_GsZ*VTX>@QbjFE}lf8a%$y1qxV
z=(Tbdy+@m&$Y@WdUn1HQehRDr)=e;0Z`xMed~4j;6TFLPhp*rXazon3`kNB{6o`o#
zYM^=Yfk56C@1ps*Ln}Pqg}=j9F|DdZ&xqDE4D&Y^rlQ+ojnmE}Fh?9dC(<L1bY8{k
z8my{ZY4nF?2_LjLG!n}MR4h$n{Gp2z+I!F2x_@44e8G~$f+Yic6|@z?`e_MpZ4K9-
z>@SqnAY+&TQ;Ft*ZEzb+$Iwi>@k0zmFOWsh^ME!7L);cf+aJi=U6(Emv0Nu_ll~cO
z$bRpF4<RFDhW|7`+TqiL9UiC{>X|y_-!3F8#&2PS<uo%!Bdn*Gm=(wY+~Q$Dj<PSq
zbFy08a^>8g4aaK$d?xQ>yM$6J6HTU8&$h`XqpLX1wo%*gAvGTBqjEWu)_RU@AF0+f
zp|V4a@WK(TSJFx*OjW^w{M?`y{j0Tp$7*Fd#I!WrekGw-(PVP?Jkx0EMFvC8-pEbS
zJ~TY!opo5igS+({+%4HGFNitY%Rq@<mn|mvnYc;`G|f$-!EsTexaD2+W1OXvwf!z!
z24F&QzkXW#dvZO%WBOR;LbZ|CN)xyB{=669l)Mn>14nB-;;JoP6}b>{qII@q-2>XW
z90T?Yu}W4)D;_xq@w9*!hqgb`(~zwJzXsj}X25Ixn=l%GZKUn;E}$x-Zoz7}Ob6=w
zFOREFrsX5Czv72ic_{>RobX2b(We1dkH}-h8dKgbj6%C+C(}GR?nAMJF2*-u909vH
z?JF>}4A%Rsu444t*}67fW1v<;w)1!$mWQ<8U#anCH6{tP@Q&4iX+kz@{F^>88oxO}
zlf}1T+5O&euh1^gK$(aZB1Diq%&>GQq1j34X!f_gKWSY_HrP8JE>hHb^%WCK0$558
zy{5`DnywUM<TJ*mk41TxpgC$Uf@?=2^<&;F%6`o(J8}`^1%Y3e{Z3Tb*IU*|MEx%>
zxNM?c8iCtvE>Ob-fEYZfs3Lp~7$Cg@Lpl+>9IKJFB}U#GaA@8L<b6(^$~*350+vEK
zifQqVq_ReA=h1A1fkOrc&fEgAz;k`q^&gDR*!;n=EjA8h+lpZlQiOG&#<<=bnnnL$
z_C)wwn8IO3L;I<t3dDjkt=<Yx1sgG|#R~41${zW><J)LB9)a!3+F|~<cl>c!E5>Ro
ztrh*?j6i66F*f?r-YCxdR69Sksv9{wDDXZtJeBXqq<xJ=hu||n9g@>r8rUC3%ZP!I
z_DGdbgGpk_qRVS*zbg>h+5SUOtMCWOBS5|f^eqmp1UI_?_3?|1B`mIOQ=Tj6SMm)f
z%qMo$7Aq|bq_xyufaM%C_vT2A?2nbWKpdPkQxE&4W6kQFU>|WhsikpUoRYh2X#qYA
zkIjeBY~RqD_CgAq#zY!TFq&NalMAr4QJ+dXg|sD8;7#g<ot^DBA{E^Ujw^0zkXsSw
z=_^_j^)8k}>D)MJz%Oo2&4g<5*(}Xex6=wbIx^M*#mJ8pi!B(=J7y0wFc{E;_96_+
zEZ6oOKrhCVXV6gQkRq1>Kf*nlzhV-9xv-TJ{mmEj!}jtS-rL2(U*rA}1y54kaIts%
zr?B$yPJf`i(={l`r`;bp?$T1Yzwz04EanoF_8?hX?P^7N1(@;1IISl`Z!Qz+qU2=O
zGM$guWfpsH+?%qtCYq#+{g38j{R-6dr~n2hfL&cUz|c6%$7m}<C@bb;t<bYT-a1&t
zb=Z@1nvaG1GsQ;~fSH(&1mM+SjvFwSWM~Rv`UrA9f)xT``DtC4hIgX+LpuWA!fjB;
z;<V4O72{pB7L5n}`pmm<1T;rXu4x4~nHI%7w0cLo1SwdSz=ER;K`>ndv`@nsPzdsf
zu}fgHMkZnqu!+5gSSASR(&JrYFs}<HVrp%K%=s8p5Gw$|But9O!kxmh>nM>PzFl%$
z5Zjf~1r(bpG;PF69H6;rP0S+}blYLzfEGX%tASY8B{qIcv%#?_v_>$*x@%Er3)Xrr
zT;dr!zO4{%!-L`RK6VUp*B@Kt+FiILlP-^GKbCY9mq8RT9=km>1&LZogZTI%M?q}c
zUXlP$trnwe{SfjwdI16XH>+tXD7FCV-Z#=-@ILjDu;1_}VGSA*+C099?Fuo!?;}@U
zjizxzpJ-x(MN`rzT97rGE)~<xXRwPN$ZLT<wFE+~G3isX2wr&32z@EEO85)t=0a=8
zUnmZJ<WKv|yWml>DJ<RwGm010`tI^LdIK1(?qYKrYQDvY>!20EVH27MWCha5?20|+
zt^Uw9gyR%kT5yGE1&A_f`vmZ%I?SN?1I5?OKq=na_k$tS6KlD@2XXfG6hVQN(gC#P
z2Mzr;5PD7Uz|y-U#eIf#)IW*4ai98IKZ1RcqY8pRisL>ct2<p<&Grhc2ze+T=f{Z0
z*?tf51oB?5n+6x}fdCehugAq-=wbrO6C6=k05csZAV5gyw4oJ<+adN0kbZ^OM^o`8
zgGpz^((bsmo)rYCeYy-mDQ+IHKyqsK{2tI(0P}JM7DKht&AkB;tAVQP3Il+?9j*?!
zo(L48twK1?Ydw#P%8OM>`*k9^Pe+73!Ft^n#!6aa!*M>=Zvtr_imAjnG>p&<9o5nx
zqFNd}Mkp)QcuH;RobJzqZvnST>>)N}if|U18$X9oj!j}0cs&_9gtPQ`k^*003AP)J
zE&Z_OHv1SUO9Z>n?#s2QC1`FTa6w1cC7V7VECejOWvR6uEH9j@gI$CIP&`ZX09x;p
zaSI|=2`!UBdyff5T5B)^-&9g;?T@`rZrY;hnzNQ7YcpjPRWVzb0%1Hl5Jm+Tg|;H@
z1#3(q5Qf5_;^2ssCKRkK6lK!{{ov9U<B2p8;fR=CcnZ`*ecCZ3<|h<gfr;c)aegUy
zebWhn=Dq^7KlC+-;q{b)y#B#s{Eg3e{MhH&)t*)Gcj}(u`^9;01W%sOJn&=#@i8Yf
zol@Lf=NUI<AXdyi5B{sYtvIx?y;VlX7_DE&+egS0TrZ}sBr|h9W~`*Cs8AzJ7=xBT
z8BarBwVKt~=4l^=#ZZK@w0J29>SA<--x5YRGpgw+aAreXIB-U{tysX5K6t@e&o8NX
z>5H)d8o`3@s6)?>VBk89r@0mJG_z6m0l-E7!a6LL6Fuz(;kx<r);5$BhxYLb6j>`E
z18u}|FXp~59M~fq@T9Pk6f3uzVGb|CYTRMG<l~CXH*-3J0aH3|#^H&#`H!nFO<`5<
zFynE0`Bm=-ud5i)eR`%$tgkfg-4{Gl#p9ebz9}jkXCE!myy0)%7w;63qg6$m4;r8I
zg1H}NolKz*ul8UzrGkF^d9Ths&uAWgHyN?B{jDFw8?Eof`_o=s+Efo`8*^;wq|#id
zuhICd2Tt+6`hT_eG1C5Nw0?^vZ0sd((TbuxRDmySze^}M=XE)~Q*&?a@wMqlfMl}c
zv|ax#GK=|u-oguy+Zdla0%;hu_tXu>pnV=jY}#TMqxR0?&=%|_3+1FemG)7><q(&M
z#+iZPN9>X(V=VhE;lo}gy2DdcTagK7SJAhjUnSJ_2!!^w7t$I{<9mCs0lc&@w6}3<
zuc_Wy&rbE$w77^*lH`*v+V^wsZG}&D;M4OI%p`oOuj@a-bTrsM{Uz_|g)UcU_)?m-
z<ZY_|68r6X3xy4hg~IH^xZCgGh2<&MPoFfc81^Jo6wMdFQw&$qK8glIB6*|QDaM%C
zCWpgpyYLwdhb=T5u2RDxrf1J$LmPod&wCdyMM0KP5If2{g2#t_5wWu@9cewtokejq
z2+s|qmLRwWo6Ua&k0shUSxzGycZuNZdm=Zd%;+S$;Y-^kKobXxxA8>9+l12B%HPO7
z`1tTlLy!mFL=FxaGV<m~jSo)iGXrQ@Oe{@##PHngdE72Mhxt?3--3O3#UJTRhZiP`
z^WaH;3Lze}AMPRNc_{i}j`p1Q7GuJazP{ix?m3g=3ftmc*n|r;4M6uqSQqului<zH
z5gBLt#OQ`kQu85zI(<EMJaimOTOjX4ieo`I`$F{F$5_9W&X_^2wRF7oUU9L_PUX0@
zg@V6hH>1MEf$6a|o<;aSkpV3M3TU|y<Ni;8e6i8GHNLP(gtaWaU<~3}j`ugVdMKb}
zrvXm~F(dU`Xgy3sv>2^><0)dz4D6+-mhchT-wWY;(qa-84Y4apJ4du&daIZKy(kuw
z_aLyuyC4&G6z&<C7t^aP{w8d=VUKbP9yp-25itY8^9CIVBM+qQHR5(+QL%2Qzj?sv
z2q6;fI51T>FVvRBp{=4*6*paw)b1Bkb%eEG>r#ZZWEMAHfEsO_eHK<;gF`W)!sHsA
zc<fKnoDUeSTjEhuijtCZkpKme(0<zu==jUA-U<^7?*Kjv_U@F44ZXoFETUwPt}Tho
zE9|G8eKqplw6m{)w0{NSzOjijS?jrv1S~^MI&px>zrk89wxBy`eT+wyVCdCzNvt^T
zuA>P#MYUtkHHj{V(RN1r8Jo5@ZoLiTj_e;rSeFZ}FJXP7-G^-rPgrZQ>Cz?yZZkNT
z^CtOIDyT$QKT5)GpOM$*UA!B20XfiwJ$uYzM0_hC|4lk}FJj^0Yg+DWd>ZMBLZ1|D
z`lO)o{o82K6@eXiS&g?4LGE8*K?`%HFENLJh1=f)E07->dCz+nhKPIPx1NT6SgP?*
zO#{vKaRraYwU3|+c*`_Q(2C1!bW|~>iAojB`v5vCB!dB2)LVGdMhMRph+r3ytZ3nm
zAf{>R8IZ<rd(<Tqx!x~aGNk=DGui_fn<&$G+lUXrChYHb-h`qviJh5<I1gIop*W90
z78|z*HZGzW3(0pnUvW`;iXN;EJ)xUcx2v5&!jxFNv4jo#a^G0#ANH}Zt)D2k%eV=-
zVT`y5?*a<VQFjnJ0sG$uW7C12-vN*1-U#yzoeJx$(8<|WwH+)PCq<|&oT|gBu&Pmj
zS0A*Oue`yCotU)eYSYoLp>J<Sjch;E6D%3TA()0EI5cN@X8l7rL=?{fn?6!(F6d1b
z>L6I-O55aJK+nd8J5nHTFT}VP(<txaALEX{2`hnO!gVZ7xG2JdCWz-yT!#$v5PksW
zstvPX1Aig<+5x%pF2g<kfhA2H?jeFe8rNXe^4T~)Vm{#dP$3xg;FJy!0~D;Vs2=p=
zDRC=u_d?tYe;`FH@gLc8y;bb0KwDO06drqbROkoIr=!9@q`kow51T&2)~rFvEEuFm
z-GK1)nF1}wY^Qw@84#j8B}nvc&|n<IR1;eOq8>7A`9;j8b&v>|>ChWARMeiUMhV2X
z-Wxeer0@2gJ`e0%pBKROevCc~AA?<Jg9pB=9wzI}U=n%Y-2aZ8lZPWt1P<awhv<J@
zjW?nFJuyzJfD_oeY3P`UHSwtU5E=sgQnAgDlN(jY$u^pQ>3CT3r&Go^1&8m0DxmsO
zNSJ-mRO~%J=3d1VZM-MEp(k<cPl><rlO!H(g2$?8QMTY|($BG;;7~JogVdR}vBnp}
zXF$}6A5pOgZh^~Qk7pFHUxPzD!X(!=FgwE2Xy%LyPDazkNk(%Cl>CZ>(7^d?3+Gc2
zwCs^2hb++_#czIzzz>?MP#nQmfhNT7b?ErRu$Ag440WW65d)h8y$UvcTG066ZANHk
zAZ;f)r|>*!2B@*=Szw38gw5~NxP>j`8>`0%Fx2*4p(l4=xBIa~foKy<?)v_<F!Xif
zdwg;?b_Ja2B$z-mKKb);(5%HBbn-0rH?|}M^4jV@4&?2JenAJJUw;*$YrFXTuJ7n2
z$H=8my~t|Xd7*YBB6TRQ4y$cgkf(5awc2LJZ(&(2JJ381y0Qu3Nv(c(Sp0dKVyMOO
z{$^v}xV&Jmeg4q8`W?c<46T!HC9{VtegpBo5%C+(#;u}u!z#Im-$?U6q34;xk$Dcj
zH8ump((5R=nowlBC=Qw*B4A<>O(Nv_?{?atqhTLoWqnXYabP}*LEM~<Qus!?HGD(P
zLidJep?FX&DUgRX`VHR24}&GFh?ur36M~QqJc|?#pqC*XYK03APvYU*{Ry?_Q(fS5
z!kYY~Ftn39oz#>I!B^Rn$Avw4JZw+k5JcM(6&}(bD?QPx+)i6})IVV@Fd2i3i6LI?
zX@sX?wDv&pArxUu9!4#&AE-YL`!pw!=Y^fDCC6ZxU(r4htuR1rdiEz>rvMQ_rw9@F
z12RJ7MC^`Zf9Vl8=Z~9{C;I>qIOtE%W*gKXycQ7^A`-@bP#0wb*f_W-O=B=e4|ja6
zc<c10pbWe{paXBoqX|8yoU&Bulwn8cUGbE%vPKbpSrJJsUvoQ5j+r?|gzHa>fjZ^^
zYp9O#EJkEJ%c(R9h$s25sJ0fy7s}IxfEF2FaIkom??HWP14;oRqX$ltBM_{NS~M8@
zIEy3@(KMY!w21oicosNV-|7c0Wjsp}*#|s_QH*J-+)X4E4qhEd+gf|MZ8*zNDU+GN
zg@r~KY}vc9Z31I0L@xtwVu)$^uInY?_QmM?jc#8G2cbAcEQiT}c{X6lsa}*@Jw$ZP
zL6L4XaToQW0kVCR=&3MDSdElx=i;8-Jn#{len})g9~A35ggQK?Ou(3epkJ~2D|U4^
znd=VYpP_z|gJGpMBhZ|Bcc6KAlZd8yj~qd$&kqpDjEI^~5K%)TN^#yNX5Q$inx;|8
zAA`N2c$zh+4~wUH6uat?krrauf-f9dWNSMxY;C_&R84$1$J3xvt+Xu_6;Pu_P!Un1
z`#}Kl4MnyQHJHzieH`X-zSgs@1=O(dmGp(;X)d9~m{1319p_O~o>YLihWa7mxxdf^
zJSgp=aGJA_h;9Tg3Lu2tXhNj=g@L9T?C{LNgk!%)ueQ$h$dMG`G!J7G^!Qspgs#v-
z%>plcTH&K@r$;F<3C9{gHX<`AoEARHY%EFCAqZnGf@;k9g`Sq`DaLks{RpjM$dLz8
zxU^s$o(NtUR@gblO7+gZ7JqZ!o(OTkQc!Dc9RT+(crpQeRG5w15D|H_-R94Gw(d&w
z=s%Hz;Xm-K;0AR-@C|mD^`1FB^&;-b2%P8fEP{x@SzCl$5hK#U!(rrppR`X=9oS9Q
zNG*(nJMd02J|e0B>i}!ivWW0Fx6-q~sSq_bj^%0&lvD0FM0Vr})Riufd}x)Eb{?1!
z)78{<#6vu~kEhB#@^b8v7YdJt24C*mA0%EUmBs78p0|>tJHNAt9j32(0ta&ecQDX|
zonx3e8HkOsTP_@Vi(V7sIA3+dlWiUlVIDAx-C(5s!)W~m7US#sGs!K7Vq2yR{?KOa
zo)<UGN@^dmTs-n1^zF^y>6ixpf*P5gi&JxG+A!B!GzFomU$`J1F>R#KF^sf5;STjJ
zavdmIavrYwwD+Y4Dj<IkJ%0!P?tZ(iDJnzHXJsTa)m+Sss5W>3GS*1(C{IV-41Zdi
zcOkvD1~O`b+UQ7Uq%)UOLaoBKr(*f65brR-3<Xas?hLPutDY%lD16qWXDDZj8A=*h
z)_Y|i7gO`l=609^g!90k!{YLa?LPo&^8C=cE78%!9@Vb)ablxZPh)mjrZFq^G-j#&
z{KcQQ+iw1%AMxpXzMQ|1-SDhbPN7(duufkN7XJhNr1feM{{#KRLU{9lJ35O13hSr&
zycPxjga=~P{NzJTH3NYzX&ye--}o&aZ(B~%qUC337bqt*B#U1#b{lKQ)4rWcK7N+o
z(w;?6Z^Gv7z)~jy;OV(w_N)%Jy|9pdHZ3;NV`g{|j-GJDUirI-lcL!Mrb>JKcurCc
za`F*gV4`Q4M4TwOb^4Lu@ok>5%B${V`Po$>tRNwkhxNPZe?dI?*ieA?5ZWL98DG>q
z7rz0Xkg&EewRc^xx)NWGh5G2|HaMzA`DzS=_1S=&pdJHD7KMhni~$$#B6??(m<i;E
z4H5>miqr%VL61l1u0{MY0to+QY--0OFA<aMj@llA7cNg|IE_S~M$vgd<D>eZ%N8!V
zB{iieeRq3Wap+r1L}r_ey~N|()P%kOg7StHg+8Nkl75VQP_ei0D_u5T0o2~ZXbz_K
zW(y_8%5zex>w_uPh(z(6W~{89no>J?*0d@9P~mAk@sP@Ci3p#gr&xOg@PY*2)AR;A
z!+kD6Gn%vM1hq+T5mg9(5M3V=A@>wpxhEsMmBbzgu~$LtJ<#Gh#B=p-*hRUkDfdMp
zWSxxH0|-H<Tw@K-X8s)to+PI5n0JJ;Lrx_qEU6Dl?uU}=r{d!HDi?`-7=gwXfSPYm
z{Jen&gz#P^G`(!5(6dd+s((Y2!!R2O$#?T$gf3_*!V{p^xf=Hj4*F@ob{HO}4qi%Q
zo!cMkDODZ|7idqxEDQ?zQ{r880K%0~0+UPyx^6Wz2y3ch!hUi9k0B?wpTtN5CFvAI
za#M^z^HeC+zK+_HMFA$!D~M^b3V0t-gI{TykE)$d)h?plgNjsNQTl=Q%jl^l@8WeJ
zA1vMWjYvS+tRCKz?D2jLJhMmd8t{?a@&loY)ZBv5+oXqq=8DvGDCIs;9f*Q-orDWH
zQUDmvDvrX`%LyS*PFOD|gbH(dj&Cc>5qjwpdRdX0Z>yK@alPz5n6s)=@Z*3I=B(LM
zYU}VLfdsP`!Squ1=>kk4LTV24h_LT5=yTOkea<K09o6SU>~{Yl`rJ3tKGOhk;!z`g
z)JPxNSkiq;9ciC2O|tbi$j>2fV=C16cxN@fHnpD`MAtM8i*z#ty`agHS`ZqZN*>0g
zriXD&q=#{W@Gw62_S5f6`P`d?ORKl>DY<fuYyLA_jaFFfgSr~)ksuKIK+iqGt_Dpz
zsv=#DPoiCo9^y5X<Ymz7e7eoYIPCZizutCDUn`E7zV0G@l}`39($|Ee`kHc7U-^1H
z&F7r#tDenC@3-RcSlEkA3wvdxg~k3M=5XFLk9>Z`JIs@MR9lZ~D@{AX>*+_=n~ttG
z$)(j;*PF!t_Mt8~6`RKD3Nlu`jMhDP>g4F6)6qpIyEWU0wXujrr%3;>^Yzn%tT!Fi
z=c9|LF|PF<{&|iVjPVhxKF7M=bX2L2D)qlpsU!8-X+G5HdXrM)t}HlRVR{&)(H_Rp
zMW>^SPI^Pw*|~_a$DQe~<N8zg=<m@*D84^?bkP+08sQwrtiLg=M;(F&TbBGI=XggK
zr6QvXj%u%s_FDX5dcSOV<r0AycsA*l)E*?rq(!@L>Pz2xVhf<hh_A41vc*Wla|nBS
z-<FPtLDt84pIqO#b4%s=O$bz--?|g8Z)x3*9LJ+r*O;t38sBgoXf4KbFnQ~4k?#gV
zP&mCTthp++2VQ)H(7cYi27I2-&`*Z*AtVaFtoA{DTKhQx@kFf%Gc&h(#B;17%8Ww&
zkT7^0g)`v|6bK!YTRM1hw4kk*D_kW6)+E)RD1(KfBFO~j2!CoA#v`jp5TNoA1yc>c
z^H@?MaR^)*;U|ggkrFxXw$XTI2ERXpC^r&Hixx^h{E}u^D1k9q&k3nOB;GqehM4Gy
zuGVcS^+|>5kp{f-bo(arMjzwcz41SG)n*#2o_=-5lP~Q55I^+LVSI(>dS3Upem1C3
z#Q-Bx+*s*)|Cr10dw2LXi@&TzIHu8jEWWsmzkU0{<c0kjHasM9B3Aw5lf937zBe`0
z%cy+Dwe`y$Nb9d`+cXzX3%70?<$ZiW!PL-|@s%z4<Gii{ac@;~PZz;d_dJy?NoQiA
zGp((lvTg1FH2b#W)UBQ~S}KU{eY_2YfDvA*+qkw5wnY7*4~j$kb+gZoZ1!?A`?qNJ
z+~{UU6g)k?%$ogM`kgzxW)iQ?(T)B^0lg_PqSaG$t4F=x&0^4xw*S%gzoI}qkSgD|
z9abZ<ht%`Q!YC`$R-Cq97_PanWRXftzY6)0z3sv~DJ)9-k!ic|#Ew?uFU5}ogv;;T
zc%g$^^_PP9!z@q**e_{hj)Ni776Ybu`#Z=@CaiUvwln8*JF`dFnOFR+p9~Ti<qu2X
zi2yR=jct7*EY2Fdsir+40CU{O2yNv?2W;>zYI-{kYzWz&tdgmrbffYmX?tGxSH3Q7
z&&RMmbnpA|l`l!#L-(ZZ`53lG-1AhvByG>@1(mN0+w(DOkGR!y#!Ik0ufz7d4%-7p
z1qs6Fe1$g;QlM=ej1FRKX{^DE!0;rI_!UoKbiTEO6+{{x{B8r@WM~>4^&-MJ`F7~A
zsL@)n7@ec-^*^h<c>FlJQe@x48_4ly)kVAK^de8`So~NSPKj`sjuj4*au2%ZFzvTE
zOc>hDXN%#N9gCmE!dpYUi+7+$!2)?2hR9c((jyPWdHaF^L}b%jY8t;zs4GHu-F^oW
z(r?v@H<Zvj`kwVJeiSt8Ge%^j)O+2fgSD^z5#(<#Gw|pw9stKfZ&`Sv>R3DozJgvh
zBcK1B>dhTgIQCdN1;+NH_j;|wM_?reZF;-c{`z<Df`Q;b^Z9VRPui0jio?qR=?NSF
zuHUg1kw~t{;XAqh6dmEMf7Ot^o|zBf5$z*i=N9ghFn?&Gpzz)1;5|AY$re%$+`Hrw
z371wlaC>8L;KoKdaAZG)11BHHBEu>jIBr-Y95`uMU-P$q3I|R;$!c}r+UQsHq8&J4
zOKlvuwf@SrP7WO1b8_I;7F4dabKvmE$m44x9k~5rE%b*z!f%llr|rYr9=(e{K-1Bi
zH5*QaVa3x~QVqWfUI3y}KzbDp{kkMqK=n|1#6xZo3Rn)S`&IqlNCB@e4AJvC{<K#v
zZXTP8$9k5f?>6;`6wi|-)Gy0J>bHW_Z-sai9k1u9e^<PhKK#B+=wB~VKSZgM`h8XZ
z>334Ui2eSQqxu&$fjFvv^qUObr+*RtMD%>#Z@vJL>>xZ@`MMl<uf=I!;1Oljf$>Wl
zQGIwn@577Ghh_Yw8_yhh19>~Vi&ub#2M|RcHq?Wv($jq&4~OA#RO-X~Wgos8k9N_!
zBm&J@1K>U4L8QJ*#rr_S_>t8^cHrKY4ovT+dB>mkO7Il3zoY;5r2dNsFRB0Tx9z`4
z^#cz!=kL<^@qgESb~5?zb#C&-%Q!41pVZ}`J_j@T*Vvo<LcIC-Ki%FR)fYU&9^oP!
z)fctA;1falcqle<7BNgkzT;<(F^5Di5zn6{Jw-onmj043R^G?37J=ur@zgnfH<W%F
z=~=v-nAU0Ga#OVQ=iaMZ<nC2KZNp(ElGL8G6l)ip2iDEN25aL8VD;lYgjju$;npkS
zL_v#M<{XRpJ$|q<^kr@D_N$i`$L+vN2z2>)dt(6QCxyo|IB0lLMu2`u=7om;!o%hG
z(NFr-Yg#)AZNUqW=@~!z#o^>}ZJuE+!D#zzdfD@1c<Vkr@Qfcaq2E%?+f{oiJ=>k;
zYN5<n(#vwSpM_W1(C-f6{eu58(q5zK6<$*&khUiZ*7O4xc#_nIH!_H|j`2yNh$U`(
z?H3v!=Y1ScTucp(??L1fmyE|#xR?}Rn2HQAA6AbEKD|-cXFhr<Cmei!;gb?RyzO_i
zy-2sar@bgdyBk}pKi+57dH<sD@Nn<)n!W3o_G^*<|9bz5@Lz|)Kt{J%%F|`Agrd{a
z!@|jACKFB~Gl`2NY(R)dhx+B`d;8`4@SlSJByT_0+WZpSlMnMhMZf>b3?aSz0;T{@
zR?|C|p2crp)4o(+7*kKGvZbC>)-@B_&wvXG{{yQa^t(DPKm9s5Hl9A@OyMEprwz4%
zO*Tve%QfIhyfr0|_d#t7Su;HGtT|}Igg4%xet73icpXEmE%uiNDr!T6>KHyE<q3oJ
zZ<S|+1XJn#{{N%omuqK0e39xnjI=OWt7A$`>X>X*$7HRJDO?=~GVvw15A9U{k|XtR
zn9{#U1N4+qzgAK|<lyQzjHYj-e#ut#^VKW$%QeTx>!RMhKw4;h|3-v9=F(3b(2rnP
zjk0(TK?3E+k9x4zFNjW$$!Z~g9FpD^px(Mr(9}1zh#rXCJDA?Eh#!Z+TV;Y{)Z;pd
z=s|sl4g*(XOd!?gU9??3^T_LfcPX4L-bQeO__2i(%<rd&?_GVd!ni13PCbZ@mt-Dj
zFQykOG?X1Q&5VOQ=7<*#32&+*HMsz9q*iZK=x4rB!4PjREBX!`rV9>J@Kb^ia+e>L
zOj0joNa_5A47Me79tPZn5`^wV?vHgz|3rXJR}?VMRKW99faG30f^k#{<;()14RRkJ
zV{RvE{J%~K$*`#d@A90#|9r$&G>n|T--|d3@8XAWt8st1ck%r&Pk1vNUQLfcj{JFT
zzWgP=Rpe~o_t;m5cFo^^V9S?1yo=u@O67Bn@0>E;Xx*MMfB$Xw-Ul|nM9O)sz9k9l
zUgdh)O2wOK)n-EFYvB#mu?Pa06DK!R(_X85&D>5EH{94xO?%DzIR5$~q0wViFAZep
z(^sAN_$Hc}dH?b{Hg!kL-~X%I<AC4?gy0$9k|f-C5zt0duBYAFv==I05X`qDU`K=p
zc^@Bp5fwgTeFc6p?{WO~#dpIke?<kAMHND0KD-<}@=)vbKO5s+Je^ff->Y0tyU4tH
z;k{&CJt2VCjHsHsooe30QuAJ`daIfPY3ug*%Js4`{bp>cn7{ucH#On)8XSoX(pI$;
zwTfGXB%%o`H%Ty|^${r&LQ10Ezw9+yKN|sQ+ze^NSH5VGo)VkKBDS8Z5_AF2$sBm!
z5{Hmr0j~JOTljcZ_0)Ve3Aw(8CYFkW_#P-h5?-EF`I6MTk2Ao9G)QgNV{#rPVzpZz
ztz5KM&y_1-RUcI{!l)vUucDA9Qh!Qr5nEVs;^j+mk<5jag@}XR>E)s~OwmWZ_^eXb
z;xv`$6(U82Yv@$h(7;sJIVo}=Qg8Ed4Xx_~ntV@|d_R`UH59m};-3z>4&YyZCmKJf
zauxXB21TF-T87?2nlKOjmIUp3?q_3kdY{ji?#u9H`m%i4zR|uMU#>4N-It!8o{^rJ
zo|T@RJ~}-oJvTis!<Uhsk&%&^k(H61F*+kBBR3;2)0df^nUR^9nU$HHIXW{ZGdD9Y
z%a@g&m64U1m6es9H99LND>o}I+n1f5ospfHot2%PJvuulJ2yLTv~P6!=#0^sqq9b5
zj~+cbXLRo9yc}OndQL`8W=>X4cFyRWoSfX8yj)*ydTvH;W^Pt)cJAohoZQ^pygWe6
zL-BcFori3BAnE$(Gs%Dsk^>zi3pz+1bdXHwAi2;XWJ4DuA3C&*RG6D<+iZj8bgrb|
zz9I(cWwjS4Q%B9eIqCDOah})q;H}M6NNe@3+lSzM$8~dx%27zg?;d_^3xeaeg*-#n
z-r*{kRZ&}AS&=d<-ItvWspbw(xnXkMl!}z<St+$yxjCqOMOsRE6<&*$q7)(}J!hnE
zWJb!c>A_%4-8rL1O_n@HPOGk-RyC!ry1ur2%E<ESnWKW$)m7!wCs)oIRaG^6=7^fw
z>Kmt&2U9BYrsn2N&8kR;q%$kBed!rfvdeuWzNwivWcsF*Psyyv$Q+%K=5o<|f{wVG
zFLlMuNs2qAZ?6RU0b&ERf#QzKbsu$-g2be8iOJ&<Q^q9@8<*%SNX#uvENkp_XV2yy
zcX@v3zCGUECq6N^Akio8BNfsn6(lAUB$g4c>53PAJ=LC9Nd&JG;_P{qBqRGHiWhD2
z60XMh_`fD5xLmpTO79G#qnbW|Kw>UP90p{KJ?`|}<^ExO{MGbTK^#XAeWHK$l`7&A
zKa}W@H#%$lrIFl<z|G~#!vD33pXhuJ{H8@_7C7!X%sAdx{N@3ZqfBZdfg~a6Kx%g!
zvd6ewSe|hC6m1dRh}MaM#C+b4@zr+CNcu2G@%aN`i{?|97^x47o%Dfttx>$_1&N*W
zihs`zQ$b>hi|U-D>;~CfI!LEd6|Ji}MY>w1@@5h<)U%4z4FwVIThzVXPPilc*UJtv
zC?nkK6t7uS4i4h~wxWF!8~^nO<3G$J*t(>#l>Emknpm)kZbOSMxcfWs&nK))6tAzS
zm`-`czir=!`J&#hC|+}&>K&<D*E!%4wkAbYc)Y?jCo!Rj+K+7GSaq*N-Gd$StL7Cr
zu2uKNkL`9|r=K|0iS%f>;&olPtZTH*TchrMU)_tedD1$^U(fotFv~vIFiKB884mhQ
zc4Zr28XJY3yk6LF7)abAdp2C9y*->3<AKGt&SvExE46Kf%IDBOEqW6Ffs-7F*9ygp
zMp_#^vD%Fyr?#a&vrq9N---_6pG4CT9B10|w_tVmb>N>*cH>&bi=yEi?e4NjdC^!z
z?R}rhYt=jA`-r-C+rjwW7|nMW(s!u54JvOzVluV2`>y!-8|e}QCJa=HYb@>$OrS(A
z*S+*%j$atxX)Nt|XOCt%n%+hZL5dvk)oAJxb+}gLx7xl`u$!aqovC<-aa^Nei1t{f
z(oxWxO?z9~19h-<LGp#Jf1-H(II7I}MqMb?-N1d}>*2gQHa+-_lO9lAE68ueaj?2l
zo8PI@S=*fOELZm)u*YNd#Tp&(h_T`e#jB7&;h?e;lml%o`!d{1Rrfx3Dm%iS#@8iI
z8kbn+Pb_g?>3{+Tlj?Mf;`{xW__`-LaZ3TOb&A(oT$8RspM+Ak3XPWI_$MljZvRL-
zseHq^(fx+(!?0tBvCH)*`Y`)Kr0uiu4QEDj3;Tw16u++ehAR#;4p(2Q5Y~n0!=YYi
zQFQrm4=3B1tMYN*Fra8n#H;i1uHLS%l3v`S_|OkGbk4_}<)9b&#A}P<HPoJ$b-ajo
z;8j9(9*$WZ9ikuOOtv^*(YmTr)aPzdc{6ZL^_-!c2kLY8se5PG<F?wpvP5HCVu?R7
zKYp2=RFND!sSX{AZxGjXkc>Qu;?h-XUzSxympRGE2R0>&*Dr{r)F&EW<Vb;;5~hy+
z#FW{lXF=sJRC!LbFW*|%{Z2K^2d|Bam-w|lCw;ymF?U>IzCY0yUmU5~($5*7l=@}x
zi>gCoR2^u@5dL65<-3&fp*`UbPT>AvmAbz}-Iw;qoKIWpxz4Gcq&q7WuWQ3)U9J7W
zSJb_25#?xGrToE-tme!gOd=)0F`Pau?Z^E=(*3b2?SgPxxjqo-A7Ez5{R7E+j>@|<
zoELH|gkvF9Wj;BUw1fbUg34O1(jOn8BawA-_lk?G6!KBF_f_6&s4N_$b9)r+t_Xfk
zZQ-8fp!34dE9@uOx>nN3N#}mUpeZkj#@~4=@4kcOz01_si=(+nJG4&mnRhTgGoo`3
zLwZkt%H(q0L?6H(_Qm3>xL-s*p--j#nM!NwaAcc{UXo(t6V|Bw8I+&dynKAUQ{8)r
z?m5YEl9t7s$jTrKwd+R3<2B;Z`508=)W=9J1CJvnVgHxOWg(Xf*=s|kT@aH##lL3S
z>-kOyFt&j2GR5}=T!&>6<%5@Lsl<OTvbT|~cwg}-A|8;*&1w!S{J#N2#J)IvbS|$g
zc4(=88j4S0MEx!Ob98k7Bzy~1UMoIo&t>Y~PF&mIvy4sgFWceMYdfDPUSisZx(X9;
zJTX?&V9@e$JwVZdR2NeZrOXQxYuMChIxU1oShs@28dnOkO;S9j;F@rgWs8r$N-c@X
z^~PINn$@&^6)pS1#HDc&i)kzED@V(<V%>1VVdgiGB1CblixJ<Go#3ld{8q%s@8M4P
zJ#m=%^%V>LF4v!9#P`>O;LC^Hu2uZLiykdgJPxKuYgC%U)lLJbQ{p&W{3;Z`=VO%X
zGY64t0Jt7e{2q;wUuXTsL(x?@4i~@66u*aK#P`@i>Pt58LB%gA!nT^eiq!`0uxD2y
z#>WoD>$|Qw6Rxo*lhiPFIN^$M{hD|!QM{fchIY0va*g3<2dm>Niq}K2;acM0+m#Wn
zlv4<h%k^D(<%36+;`LL)6*aDugvS+kU7XFpQbIgdC>~<}<e)q*jd$Yl#dqXEa>*Tt
z4;**{Neu1f?&lz5QKyB9*D&fY2dz`QW1ZF=1|EG+r5d?hEw=4b#@gpWyY?x|N8S>}
zV@0Pt?s4RC&v)cO?Xy|&80XYJk$p4Op?yRjNIeY<ab(2CYrw&H)hJ%+PP}Tk%i})I
zfmaRrZciv)+MlC(Z&b9~oNR9d|M<oBcBDqw%7Ld-t>K@>#_LWeUW9eJ;#KMvEX7uc
z2bVqYPon6B{{(eS%alZ;r7N{uBlcj457B9gqg;9yxqRdX5uJubW!_!X#i>gWokT*#
z)Ab<y4_4QyI1g3Vw5CP()9`<mx~4UN5$bvr&OUXWq0U)2XRGTRoO9LnIXI6|*XQDV
zp1RJ*xj<dhIy22bsLTuSe<A+q@Z<j?{1ctV`eJo`3C<<z`cj-Hs_V;fzCvA3!ucw7
zeGSgns_X03xeVvY>be}~3Uxgd=V|J?66YJ$brsGt)pa$_HR`$+=Q?#=kMnGGJqPET
z)b(7PZ&BB`;!JxrRHym)U!blR;=D**FUEO^y1oNvT0^Du&G^4dT`$G?N9y`+obOTB
z_p0-KIR6y?bo?Cu_v4><{1X4a!ap4k;Q!b7C;Ef<|1JLM_#OV2<Dck%z(38w>H1Ij
z|FgPYf%9M0^~37?D9(?m>y<dKQrCaS`3ZIXlsdQI+^Viu<Ge;)x8b~2U9ZRaId#1O
z=jYY+i#Tt@KOHaO|7H9WzE|=8n!4VM^Bd~=Eu7z0*YDu`uDafe^Ly(0eVji~*B`0#
zcAP&}*Pr0LLtTG{bBDU#h4bg?`b(U5tLr^D?^V~|;Ji;=@5lLox{d?rc>EJ~4?cRR
z>s~k~sB8M6(__^2u{bBHYx4j4sq5o#9-yvI!1+XVeG<+mtLqA!r>N^0I9I9bS?XM)
z&NM&4pKG={&!H~|IovLf?OnI9V$rwUu0GL3P~3X+f!+Nf85NgW#AS54beoYVkvH7J
zB1Y0i=FxXG;g7rpKF3=q@~c}|(8ybVBBSh54rSym@Hxdokzd`y;zr+c3+rn~PmLym
z;x>00B5%8em5!v*H@951jk@7>jf$el^cfCx(FjrZ+%B^6(TCeb7C-uMyU6-SA8uEE
zG!YcHi$;a$!!1ULNcsz->AMk0RNvfU6p6m&79)xs{gP-RC~nuK4)n_%=#w1i*ErCx
zcc7O!&}r0)KHLtGp>7wAX3>Y+MI&4E;g(TzQ8(PK+9(<k+^%{D`Wy%PTnGBC4)pmB
z^o0&|8bzZIx9g5*A}DSd=@)g+?V^!3`f$5w)QvveGD0HihTC;t6fH}1t)E5FiQpEa
zcJwW`7{MdyFXYnqWsyYn%`Hax=v!_v;z!c25cciABZ(#-@(Q94x9||`=;SR#A8r?U
z4$+6(MP5Yo;dVV5O$5a)cUYqCxm|ycq7lLEddh*`;y@>_B>Hf>$U})f+%ED~q7S!=
zJeTOh?IJHG@~9GaY*QpreRB&>C;FCKcs+LX&Cx_q+^)AA=<hhtw>r?tV~Rf9F7lqD
z54VfFsp!M)BF`%NaJ$IMiay*f^0=Z8x9iJjA}DUx9tZk24)pyFbn@1s5BNV0bn@b&
z5BNV0bn@<^54TIK^hMopyU6Q{KHM(y0HY7Li@d?;1AdDG{Zt3~=~49f^T=oXeq5nq
z?_tHj&xuM;x81HG4)mc8bP<KeILk};KMv{7cA$$0RU1B|9MX%`37hnp4(YQU=s6B_
zv1(?+e~d%=a~<gCJJ1Up=;IyeMGo`}9q4`s`UD4hu>)O1_}Iwddk*O*I?yk7pkEn9
z-wT(N^mc?Q)y+zGyRM2#Pq*E!Yoh4qDgF1U{E_;9T~zv^BE5*P5jpy*d~|ZVN~6+C
z`s673DT<HIpA^A|W_-~H{6hyiJ@giRxLq_`j6U3uTQrsMhwG*9KXD4ync~Az5zmm|
zX6S4glcCe;bFX7SkJsPAXDX1_QQx_{mwoz2Fx9k6|GSZd2bt87rD}53@k9^LPqjxf
z_&B0#DXZs6koTHwqI)$P(}TQw6w&*e^fCI1>ZPyQ*@G$5;CK|Sj%IcK2vgR<@yVL(
zny0Sba;Vq$dsBJ{TOAr%wcvA_CX00@`tr-+lzxy&7tded+iC~?7okdn<5SJ_Vxa)v
zj>#bUnI?Uxy1Hi|(bG(NwYq8>Omq~kj!bn<6X_v5b%?zrTrUywM<ME%rOufGe|UZ>
zo^8Or{en+;e%eE&pN@6#!SUhwsU8XT4Iz4Xe)^S4|BgtXufDll;u!*b%R7nEk2mT1
zYL$@B1tz^jT`dQc!SQ~R{<yk&2u(6LK48+XQ&+uUkOs$JV$#2_t`0yngX1qX=~{yO
zgnTYH>9?z^|4yg$lT5m9uk(feUt`kCmHv+xc&<0;8d<f#Q)bfjNc_>s#J}96KdP>d
z6ZEMjUCZYsAEmD}>9h_?$Hxx(cCoM<RWcDi8`RYqLJrj?{a$rdF7&F_q-(vZ6y?^N
zbgijt(B%fl&oSxR^ZwNdM4xNYf2^+F0K>uYx0>|TN^a*0InOugn*Y2LDg8o|uH`Tj
zsysM;u}ObG@p)ay`3{p_sIIPu2^bu&t%A#38Mz(yWN`daGyUg^&oyqM-)+*hrJfHt
z4~`Fy3q4hep8bffr6|{5>DG%_dK(;npUFqd;Y)P6!SO#g>3>pJ7kY^POOrlEUF~&f
z-=AV#ZgBhqW_r!%o+P3_Xwn<i)te4{yu$AN&P?xBR|5r~KbZ6;b#*D^G&o+D=5lGz
z<1HbF6=r(vi9QWM4UT`<r0e#*zAw=qHR)PD2L=&+rAbF~i{o?AUVk^~BAyrDvH^H-
z{8J`9sIET3d2oD-N!KImI#KRwll}{Jb<Yq=-)7Q93@yH8982`|CS8}bLFm;6lm4>0
znkw4;MU$>A&KP0GUNY%B)YSpO|5cNIt-AWVkn?7fzD->{EcE0plRjKs{a(o79h1I5
zU0p5YztyB`jsF}z!r=J#O}dB&#kZdbJS07NT%*oIMEdQT>=N;w_%=`2t4~b2Zn^&!
zcK$PyzE54<jsazG{4SF|PhD+y(9dMi?q8beZ&FupihjDsr2kA^-7oa#8<Vc}=TuSd
zev|%?y86D*+c-#D9<QnMNMXmq^Hbf!>x3QaWu_N#ipaB5@DI;VUr>CKgdGddPm2_N
zP%n~0cz(KD(VK*v!}HTZRZ@rG6P}-HK3}7PgX6>V)18XXZ^6HR{3#|*ZLi!|r|KUc
zo}X%ZYZ}qR^HULP1zz*V+WTF-&$g%kG}WHoFpT&QGVx4NIC~5F5R)!q_;7EhgFZ}l
z;6G8|*H#C9801LDj~vp!FUr-Uv5L_``gsoNuS_BQ;rX(Ny+itB2RW=3>BIAAo&I+Y
z=|>GB{@SZjv2)=6m_z#e&!qI>dADw_OV1#Bc;2n${Qgj)hv(fQCJp?ra;Wb}!9P47
z*XctJ>7N$mhUe)bMh*NM9Mbnco$!R`?;>Ul>H9g<_g0a9jHxF&{W6F2AB*(i`M!uD
z1OGoeq^~%O@PyX^bk7XIwH*|%rHkj6z=Muakmum|@cd54BebKw{o@NvoZ1gB5q!cs
zg3AOKm+KippKYdJr|2|d_KzQL(lwtIq8-EQ3{R@`Wf;Hu$6sise@I>V1)uObgQkxZ
z^_^g*|EaoqRNxP<GwA2be<1ki(LVg#`ON}Pc%4DF=ve|!c%4DSB!S0qf=_szLDS37
zF8$-f>kKU#nL~RW5b3Ydsaz}6)eE9t*F@3J66wS12_l{cSiVAfxH?hCdXYZ7o{*t9
z-Y57^Hu>wGR^y=Ol@9dJU{?pl(+;vc64d!FL9dCT_Zv<6hCyB(&FZ}79HJku$>u!z
z^gcvC#iZ+;Rk=hbt&qp#>ik$X(SNSV^7%Y`s}TGjh@!9SP3eDU(l!4+f`7E1qsK!J
za{Ltk`_$WCzE&KpblPL5gXlE2>-38lo%8txqf;$(`hPGwPyYd<-_O!dP~(ObkBEap
zIxGE$Ed4JSpL-nWO-MtBwO+rL<S72ypQ7}<UfUefA7FG|FCVKf$BAYahZWD|jLzjY
zgV8ykD;S-(*Fr|;d_s)Q`6M&?Z*Z;K5$>}%2<LtH*Yv|x?$wgLkpF)({>Lynm#0(u
z$5?t^Uy4<s!zyR(p%I;@*CU;kei7rt@o0-d>HmO#EuRNidM@YxcA(#mymVM`{!)^o
z^z(TK`ac<+<J`yS9M9p>!%+_W_b@uw&qO8%E`L40BsuVYm+z3igwc6@xtuxw$60z#
z-@)iyKD!*~FS2@ZKH3wrwxb@wiO$nEF#eprgwc7u{=(>7-~Pqu9RD^4x*`j`BA-X=
zt)9nQac*Yy<?Xng(Rq9EcIWuDCr|u2&P9w5mxCT}DLv=2jHTyzo?&#(XCtF?KA$r>
z$MZg;bN>4no%8oHIdeIrFgh<+&o8ZV=K8?#oWsiH?R7q*^Yr5wo#PBJI!|BD=)Ar^
zW^~Ty&y3Fb5H>oj?aT3SJI}`#UhX8xM)2W!K9kXTx&0ZPk6(J;KzROwf34>?u=E@c
zVW5N3b36|Ts-$x{tYUQDzFbc@PTpTQ|2U>6oPU2t=lr!_OgOoGwC8M<zg{u3)=RHk
z5uNkr{g?CCD+X5nw=p?z{C{P1E{Ag%{ZU-&c5%{Yr}pK3$Qs6HF5}P3y_C^;`Z`AE
z=}%&Gu2<EJ&iVWoqjNq^<0F<W#X<7q{D&|)@9*3n;ClNAOV9D#=s>@d(K*f^InWyz
zowx6w9Oylm-f}&s*j_rQzT8e$GdfSt=N&wKGfU6)_HT^N>-Dq)Jr?<M{p5OkAL`JV
z-f};U*Xsik0uGV`m*=;F8cpxZ@bmg!%;=mCpO<ktWHSCw;acP8_2PEYsXs1cd|qOF
z^g4>QULUjc9H(CSv8Ml-L%mix&_82zUSB@%dzs;+zD5U?%iHB?L5-IGRz~M~IEa<Y
z>y^vsyuD^JI>&i2<InMMyTtj&(tmk<xxM22f5pn>{2yd=j`R17&iN-Z`es~fz2f8h
zCPwdWJXbM1Z?SS?nOE}kvl*Xv86PKqK(FkPUU9jRZ0WG-o722?hfID@`@r>Tpo3m<
z{p9V{-TF3?;pcLg#pv8_5H>nUK3oq!71U_@V2Aqhc{FdYe>m{bD}mPbx|*fuIGx79
zKeF_^e>v4_3ro-2QSS#@@$hkzx8r2ShvWPqqjPz3d&tu-cS!#tqw{twWOUA->lIJW
z+l9+#wF4h&J36d#cwdsE=-jX7@;R5K=l%LxM(229DVOu_&-ie=$LAgYLK<xkd3$j@
z(-|MGw^a^wj+5ip`;a6zu2<ZT;_Y$=>qop^^H{mOeYu~>`A`}<s9dgBPX53ikvh74
zo#c5XOaB$FwLEWObdKjTM(6448J(v;iP3pG)-gKgb1$QFK2CPesb1xb50~3*jLzlH
z{eP}Myj?iX8H^97H#0iN|6dODxs1;7IE`PtpYnR~c`Mi30Mo;tqb%LNH!(WLc`KuH
zy*-ZM<n74&5y!KPrRVh;%jn#1DPVMths%fe-#@eTod2zi&eQX9x!rIo_Y}tGH@Mbv
z<NCwp{4h(;<xF*?gZeMW$^8&s-*}Nay8k-S$FTHw<67gqlF_-nqPoyQczC(53#z2^
zdhzj*<JUW$XCWUwpQ_8%?=~mAq#K$(mFZP)mVO4Kb3A<gpQ2DSA0NZX>pPy&d3`4{
zI_GmWqaVxo2N|8#(sj9dXOQH^`BUBLu*&mP2l_3H&gJ|JqjNcbtLRoadz3<0<(#PK
zgon%dI7a7krZ^}%C_Tqh$><!<gNkm&^N^y`iMP9sYp~+^8{^OMJk97`ZLcKA>S%jK
z+L?b>dzF$>;h=Ws{p%({m2_Hz)$R31M(6#D^3p+kxSlx8Q|7buT%Xr6I@jlTrEgY!
z?ycx_;`+?{5$|8gOm8_(9S>sdU$a<xj_3D^ZpEYHt*m%>KjL_JKjL`SuyT3-`W^`x
zhqb*bC0Wo1u=e^Dqx1H1Gdc5elO5=MUxv5WV=O(F&rU_R%4d(FTjitMm+Hmk(~HT0
z<2;ekIi4#Ro#XkDqFeFk=UV7C*PmZAJ{-^Q7@gz!Bcpe<y-t8kbpJZqUNS)E-_>3d
zS%2a7kk2Eik95{vd_Rlp3AHsHRy$eG=v<#4VRWv~dcD`G&pKYus?RQ_pIo1NFgnM1
zJfm|wmoYlWqvMgRc<xo{>BRfjGRBAF`7NV!Jbz$x-oLnCeGkge?ec%Yujcjbs$YE#
zDIpH)IKtNlXiZhi^XRxQ?b5$%+>fQb=-H8@?G@=)|GV0&O!Thk{&h2>Q*4ZGufH-n
z_tSX%1Gk6z2?FalayuI@xZU2s=-h5=|H^8&_59Rox4Hk!?e?k6K69KS7@gy(V|0#3
zyt@~&u;S74Q!5_sKXW|Xf981BvvT=3aw(HPANOx$behZP_Ii-fd3znMb%wt?w3i;=
zt@6?94_5i;_9Z>x^6AUuz~!TVGmg^p_PU0p=k2A(cPpM>sPtAm+<)eHxc|)Y{FRm4
z)%Hp~+FoLO|4(SI%UFNm{fm4;I!NCr_O-MA)syuLt|vU6nbU7(>A5~T#Zi2r(p&ZU
z8%4M3GxwjlKKEgI%kiAd=p4^gjLzFj$Mak9{9L7{6ZfmR|IG1l|C!_Y3oDoRuN$aQ
zaM0~xsJm{L20@kWmB#4*kI{L(-eB~f<686SrQ}KN&hhX#AC705;zM}OX64?Y=){NP
zX>p*xrRc<GIOFqEhKJ*SiqSd#9gNQL?_%`-P5AkKE|>H5OwL?xJf4}$?Gcuq%WV~-
zbGc<OIxm;c$2ncE|6ALa$BA*Ab*#NO&R;V+$N4)(|DTAnT*=eguje?(`9ntMa%*C8
z;PP3@=r1F$?(aWlbS^i&?{DqbJWhkRZ!5#Y>2E8#wcYu8GRJ=-CB$L1Kh=!R@dp|G
ze-nPE{>A0b<wmyGPHsL%=W@$tbS}4a$wtVZx8sctbc*$*!`i-1<2xT`xqhC`+L7Z-
zW%U1vILArx2zm0j)}W$O^+Nd9{gKBb@$?TdJ`}^L)9Za?>MuO~6Ata`gr`FBx8mV(
zhMYgyWICu^j;Dx~%hUgn(Rn-O6B8U({5MFl(5pLft?TQAhkP?SzAGN`=jb3lynpey
z(0C?)y)Qs=y9@ss=NeqoL40`nc0rZ&v5XJ*pLzQ89OTwjoIg_KT5<AmpO^cV1J2!y
z&eM-{z?sI<b9v5Ubk0Y=kA!d%W-U)AoNqEdT%KPtI_E#a0VkD52elWsOXmx!r1SaF
z)r?ND;u_~BM(2F^c+Kg&eYt$*F`S&fn$h`uWWS=5UhsGlJrAP#@%e~XRha7Ao8ce8
z=p5%zM(5?0DY~`XX^KuKUhel9A71WkM(5?uWppRI!Q15;lt%~Ei=NHY?edzSMz=5T
zkG$OROwL^XJYJF0*Rk|mK5m8IDjz)$rQ2LST>e}>Cows2oM$mQFL#PVxmAizCtfa>
zKQEWdpO-t2mCM`ZCM9RO&F67?-_1&&q~vC$f8;>#t;)5g*M6gw{{I}(r@AFjYx;Z#
zdJ3zTf+i>=Lpq3$DoT7`DLy4lu@sb77@c%f9~65-2l41BuH;7<qxWL;`xw19qi<vM
zK8&8Cz|pBMqh~Stv5bBTqbD-De(ww2_A>eaCO7{6jA4x4kEO3*^!|)KkI|1~^bL$Y
zfYG-w`tgiDTnU$Op1|n&jD8}c-^u97jJ}!CPh#}c9`XzEKbg_<8T}MSFJtsm8U2rp
zej1~%WAxJ*-J_I)%1vQ(AEOUq^y!Q~n9(0$^dXF{e`<pGr!x8grF=vm%IIZ`eg>o8
z&**0|`btLEYZr9;3r5#I1JP3w=u`F!vZ4AYWAw8%5$9VNeK?~($mk;&y@Sz5GWtN(
zsi?lA7=1dU>sU&<y_C_@S^7URx}MX~?LCa1$<p^#otDbYV)S8*p3Ug<7=1LOZ(#Hs
zM(<$sTt**$jQm37p2O(3F!~rqe}vJ`Wps}+F2v_NMjy-Q`HWt|=mm^^AES?B^!FKk
zJfr)R@uG4I8NHCvix_<#qhG-2_cQv1jQ$0q8;qWyj3brnXY|V${USzR!srti{S`(J
zFnY2wvc$ib(MuTpVn(lF^b$sYg3-Un=$je+Qbr%3j5w7$k<s%R{W3<sh0!l(^glBC
z6^y=((REA+-QLIOlURB~4IYH&Dn?((=vOoP21eIDA>B?;gAMVymZi^P^y?Ts$mrKI
z`cg(OW%O4Vy^PUQ)L=&CPG<A~qu;>j4>Ec=qi<vM3P$&+L6P`RVe|l_Pi6Eaj6RLg
zA7u3DjNZZMm5lCDgD#bOBcmrX`V2<DmeFT2`aDLT#poLuy_(Te)Syn~)-ZYvqko^#
zTNu5T(dm7RbP%69aV0;>7(K}74>Ec^qpxH1*^Hj7oC)IJ!06K%eGa3qWOVII)9nQ1
zd=Q_TS^7zgK9|v#Gx{xz{sp7|fYI}n6GQxOW%N54{WeD5%;@tNJykh9#AiOE*D(45
zMt_9S8yS5Mqc3Fiu><87;=hQ|moWP6jJ|=<7c+X2a>9tu5=Os_(eGgN`xw26(cfnD
zW=0>ToH^qELq-oW`cg)3Vf6oE^j8@DZbna0P9gEXhtaDT{l|>%nmJ`=dCg6(k+oB*
zCXWnGnG+mYdiBK<gBj_i0spx1B_*W=<NT!;7ZevwEGZaYl<o^wmp0S|Yb$3>D~dT+
z9x`<`Pee&`V#UWwiaAeu#toC}D$5l@f5XKSOViWKr%$de4c1Ps4A%J@ii$wXn_N{@
zT|PNjT}y<boZ2ZhRg=r76wRDDvmsV^hgQ_+%2{<&YJ(`Ly9+8Ut(;Yfg1Wn$$#r#=
z(`I#lIki*jDsM&;b$fkkYNpJp==O5ZDNCo-RyUO1a8v2zSrw&B1)+r{6Rg#o;M|W7
zP3Oz2XVy%vC7q8h>~NPAu3Wd5Wp=RcFG*>BbV1$LR?$Tr=9U^gS!#c`7nE01UpKw<
zhRNkKilFJ8k5z}H<C7;6^B70NLn=XQn;2(GOB-q@*OXQUr_}l(z#<f0dUZur$!rS-
zXZ0YXzz48WbkdpCv;2V@(u;~Re5Iwq>0~mhrp%faoL)Mmwzj&q=&*CIt`C-0Pc5yT
zJZst%a6hOEaY#Zd%<dZ7@~Ba~+&YSbP$bxPYik!~L`gf={ugT<sDy5iczV~^#)_8M
zMo1ju$kkeU!{mz6$+fkUZz`QNMeFRioZ0C)J{-tLo!&M1hU(g&Yb5FUlvzRYVC$yf
zdsXGE8B=OURM!M6t7p}@8pyMqUh5i(5wpHVew|t4Dy1$ktJ>92UWYE>f?G<b(yM1R
z%#4I}v2&L@G&e3MV)V3@7OPTp-93d_>E^<;MI*1EyNgmT>Jca@JXCjgox%esO48%n
z;a0!w+NqWBQKK5@aF>&Hgo-JzuDPkGq+w=vHx5&{Zfu?OOcGn^)XLgA8cB;tzpXVp
z+%1)!A<C?pd<2WkVbz>fedMY-I$YJrV!OG!9f@|7J<hJA!#t?unbS{N^}t~nF=H(*
zMpvP;;$rR(F_xDlO-gxp*K4$CQbbW**1#C66KztWYj(Ir7-dq9K#{g4<p`8(XHvSg
zLDdLeGNJn`r%lRtC@EG)HS85%I$>gVX;kMs+$zf4aQgydwPLYWFuaiU-O7ux+p~q~
z?^a%n^)sFS?^arjwL46u#acHt2RJfSJ1m98Tr;_7cZ6zoI0}ogX4z9}C)d#ub@w_a
zPQ`Sixgx{gy_I6Nqx%apyYdkzig{e!E5Xs`szG<RReDZosVuA%i(*r1XHBlctg*XG
z4KManN!{hTDo-b>GKaf!NjE2|7)K8vt1gJS`K1$Raruyzv5QJ#?!i=6#Stni8)a1;
zsluFv7^4qxScG`^%Q}b<4}W2YrhXZdvAJ(CfHC)}7{_0`G8{XUr5Z8H$*zc)tMMJm
zaIOXqi?IsWF&7I~i8+r&U@^7{#&txH%!XHFX?#a)mU3bg8Y>6;E5YjeD%xNXXYpNq
zt)kr*qMElAMH6r?MLZ66dP~cv&nTTbxw0x|;Jhhf&c&Jnd9Xq_W#okyUp_)Wh_z%|
z)(KWmPR|tku~SOZeWmr88RqU)QAzoYv9gK?eu_C4t3=Fs$Y|A9eaB&@GS+&L=|5tH
zjg~5Qr0OQj{}HPkNwV@tR?R_4Vl)gGvJZojbVFeWQ<82d?jTCi4W&6NNjDT0VY6ax
zY-Y1!&J$76v{-EqD`}dmuAv4Ytih?Sx>@RCsyd6233M8^rpC%U0#VGl7^0~Z#W1sa
z_7qj(l<B2YYbVc~A_vL}38zASt5RQaj)<d(F={vFTnt{!c@EiaFk@-UW3E)>1T034
zHWwXcc6UK)$)VfJQ40>;UXG5X?QXfLV2JLnPiL{T)@mN^`32jCz^YC6Dt+X#UiX$|
zcCc=*6<cbvRH@tA>Il?H$I^DQO0Za3l%&`34)b&nv9#S>4Xtf9v9t*9MBy}!Prd=?
zn`Vl0Y=ONsRsI;q6M8blGU#1adYP~Evh>m-EXPh9U5Xu+yi$vT#wzC+r}vPv*vC1<
zQev#CS<2y$H65R=D$oViF`_nE$LcFZx)m|D!1#<K(E?^ET@X{O6-e*C7B~dfv7%Ob
zGjk^NKdZDWQP5pfA6>!`(W38GSgbWuDys|YKAk#*5@M}`QmsQMp^F;U-TEc@9}(^P
zE=9%KE=sq$EVWo$MYVgE`NxVsf`81dQhH(Fl5qur($b6Z1ZmFXIy_AooHA`nZRzwW
zRW*3Prz+Z6h!Idx$puw#K1)i<EAiCIW#m-k-~)~Z7S`Zv#6I#L0>&5{MPh6yDQVCc
zFP@lDN{&<}KI!S3Y;i8aND~H*b^Z&0zPe&^aPq+)JwBv?Icru;bzRY+6cA&}bfEyf
zL4aqnYN{KsJuo^eHe^v5Gc&rD5ezCSr{P&<dQyybCXhWqzVXOBeUYAR3JLVAky+-A
z4D%|TCrKZPuaZf+k3Ug<NZ0RXxLj_VoGJ7&YaGUTkvAnZO#3t5UqiH>VUoDYw|v)M
zJ^DhO-$Q=&YLJLK36IOK>h&_NTT#e;AnE-2{21O#Aj+o)@7a;BuJ!L$>09b`Ci<)E
zugEWWS@N%VQzoHz_t8P+Q#$o}BA0qCgv$y402}<jM1GB1pC1@$kAI88lcmZh40KrW
z-;exu_*cFq)9ZH{5Po{4Q>^$?6n>qa^8X6?HEw;Li1&dI#GV%UrKkiCOBm*-6~B}G
zhS|t(8Mx?j^?4xPzhYPZ7L|a%ql7?M%RdqMMN$iX<84X}{g)@v{-ldq9-Xy+mJR+M
z$ggqh^X1w0_)91;4*m`c`fkNvg8X*)m)hW`R}008Ki>xbuaRHl*5~F?_V~9b{9_0-
zJFNJZAio{{%?iIy<t6>2SNX(>KVXBO@@m}ryg$z#e~L0_oymVM^4sB0_@@MJF#PB$
zG2@?Pga5ZS__yLcKz91SLgAmM%GW2W{NF}?JNzXIzt(e-KV8Qv{|X!Y^olYqcYU6L
z_paID_mQ!}K|0G1EB>j-Z-;-n4StyVnDN)x;9rjX8n-@II><j?;a|kT<JyY9!a@G?
zZ1B^oXJVEAEjIXnZ-f87;r8<1sPO-R8iyTL{C6Y2o&4`p_*+z7(w{-NjurnB8~hI;
zzm~f`7s4pm>CZgqg*ZCFe?Ict;h*%5%sxl4A^fShjurns3cpTI`TvOg8n-_8fd6HS
zAAS)XL*>c*w94OU{Jh^ret!ZNU9LXgh4(SpmA^ujUu~8wFRbN<kYDh!jGr5o{0x<!
z>Ys*dEe~y1obWHV!T)FE*SPh$Ww1T|6f!nAGUdtqwBr9e^4sB0ephDEI0-*gJ!brm
z*x>&Q@@w4sJj6l%WeUIk9V=Y{EB@0Q<nL4XH>-?<A46@-_*-oBcZCi91rGjK*|D-<
z{_Z%USn)fx|2iA_{ne)Y5l;3?mH!DTH#@B54|A|z30q{Q7L}Lemxb$C_4gGU{QnR6
zb-U~H9*6dC@yddg8>LW0%kOiC_FuO}X5spq15&K`x7gr+82L4BeZJvT`~J64;n(kX
zmuRB#Ux)mHm&JZ;*&=hyQ5i}8=ioY4{GZt1e+2n8ZhhW8#2&w%lzyek*C(s~>_mP$
z{FAoI97|P3!hbHVW5vJ62LGeTuW{@1W(WBTXBp||qFjDh@xSaK|7|w-^T8-q{GOGv
z)V`{4s{doS*0}XK6YoDHh}QYzJlGXF#><oWX~jPh`2{bF{>*t#X7Q<<R6g;F6@QWq
zerghpTc00x@IN*x{3WV<eX`>JvxEP!+y?&zUBExk20u(i6#if5*vmf!ekmPF4doYn
zTJiq^`R(MtS>Z2JIZ6J0T*oT^VK(?zA-|TpKK~X@v7P>GQTVS@<?E9b|1#va!=L*v
znIl<cB>Vwf$BIA82LIoXU*p#2xDodF^J%h(gTFJCzFYC{a~Qu$6n=v;;UN5%;2bOd
zd>j0KM}Cc4pZAWk$KRsx175^o#s3BJ3tpD~d!NGZQ@IKMrMQk2f4~O+6UeV|>+^00
z|D{9WzdZtdwETA>za9Q{Hu`gU7w}KA!T+QU{$=U*@}H;PuPZtStAkbkKSzE${96?M
zGL@I)KMB{d%D=(}|5M1X<*v_p4(p%uPLu_gqg;Mi@n<=#f9Ah0bInni3I8>?jun56
z!mra){-=>&<JRYM9qdm>vMiWv20yI$o&4W9Hu7r$BVDdOS321bjEi)f*@^rrkYDh!
z^uLww%lu{XB<u%WYk8>ZIj(;%w87ts{2I4DZ^e6y38HoUuK}HoN9D=<w94;oq_e}H
z{DI8kQ#q;q%5fbl{-rkfpFw_&Tc3}0!0)5QCLH7C$^5k9PjJ9**x;WEF0taj-v<9`
z<kz_Mc>@GwC;xd0|7|96d11xB7WoA)i~h_}_zjhx<X?&FSn)5n!T&7sYux&50H+;(
z7dbmP8sy3RwBjF+{C4<TY~)`BF0tZ&#0GyG@@w4soZ>Kk&QtjBHId5;EB;d)#?KBL
z`B!%Ve~S(NwKn*#8*DHC6wE8=$do7Z(~5r*^4rNj_d}T_S>+`Csl|1y^50;Ce;x8`
zx$AQ|^w&;*$`t-HRr&g4#eY5W+u<)!_;FhtgufnFvEtusgMU5pYux($6#NuB{7V)7
zO|p3N(~5r;^4sB`XM=xE7x2Gtga0`j{6B@CVu!y5<0>6LmM8PmivJ$ux5K|e;Wt!H
zlK)&>$14908~p!3el2%>ei;gGhd=3bS+M?nI0Ylhe}4h_?eOnW_&2MJg#T7t$BKWS
z4gL+tuW{>hj)VWWB}Eq8nf_-u_>UVulKHv*&j%@1{0TJK!_ilsg#Yn8t~G9bz8QX^
zt^5bcjGc|Y^~f)HS;jBdHkqH}UkFmH_y^eFf58U-v<!RvWeWcTR5^B7_5TLsx5MvK
z_?N1@q(6&s9V`A68~iUKzm~f`Z*uTIlZMEG3sw30WW~S1!T)Sg_>)ye!hZ*@W5qw*
z2LDFn*SPh05(*#@Tm8>6g}*cXnTY&?mqmXzEBro&zqt$eb8YaGE!Vj9c^>u&?C`Hp
z_&=wc?6AszF7n&qPuMOqEmwI-{!4KktNaUX@V|uo8n-@Q?smXGR2KaGPVko?za9P+
zHu&%E0{#+(U)PuF|B4NMS|=umR{ilQ!?{*g!~C?$-)a6g$wq#!+LXUO(Y}1wFj-`0
z<L4UWx0Bzbk7fQcc@p;bK3r>g=zi&hzrqH89`fsU*XPf&?C~#C`2VEJ*C(s|K1O~!
z{3~tn|GW$MYi#hpZiBx7h1<1%Nt#4FMgv!8EB>*_Z-+m*U1sp9e58NB#C5Flzr_as
zSmYOFvGd(%6g&J&75>iTe;4xG;WrfiGL%IJ;eP<<Sn)5h!T%=mTk+oof!g8EKZ{Cr
zxf<ok{ItqH1cDv@<qE&nbHe{1xWtP89vl4UBfk}Y@80(KH!A#I6S=&w;`boG9sU*@
z{J-l0{$)1!|7nB&1PA$VQTUrW!Qan8{+n&^|Dg-`|7e5%9UJ@sw5y%|)SNAWUqUz8
zVU_=dxNj%_4u#)Pc}ah$FU6`qD{b(<i~LsodDUV3X&EjH9@+{1jmU3@Klc-vf2ll)
z{<{L#vEpB&@ayzc|1HRG#lNbjz5F{y$b!`{D!<^<Du1W(XM>IWw%U|G2@?zwk#+n|
z!MZXXosFLpk>5^!>y-S;1Q%)l9>ukmhqfzD_&3|&e-HVs^4mMe9)F9%kLf|gVU^z(
z$Zv;#*bbRZ<D~Xm2~w>1-?zd4FXXr4-*JpRe*Gh_XHes?!-{_!^4sChSNO|RUc&!(
zT*r#P!$yDKM}8~*Q83U1(W*Z_pDZ{iPv)l;zf=3~v5_Aw=~>I)3YuN{D^&Tlbdw#{
z^54ciJNYeB@-tLkl3xq1W0jxhZ!#mghd3xdEooTsKjYB<d`fYDq4MjK75|eC{coGX
zuf!ni*J?0{6@QWq{*P?%-!;Tu{u>qk(>jrV2>I>gpZuw;@f=lgl3!aF@DH@Xzs&~!
z@MG=qcc_Kir&Rg+WR?G!$Zv;#slw0YzrG9jhuPrYZiBxK28u*%?SCsUFQDUPc``q(
z_*;?R4u6Zn&-H%;xWuYISvL4TMt-aQmnGWcUz#l;Uuq(k7gqe&Aio{{gwJGpE`M6T
zi4}jo4gO1z--<sw#~y!&!mqla1cOg2ejoDN;m=k0x&FV@1^fXU{GZt1-|L|NTSiOB
z*UFRmX~qAAgZ{5j_@Q3np#J+Ru40w{BpduBORM}J1z$V;&xc&;*d|ZrrxpJSWVVz4
zI)&d*ISKz}T*r#P!UjKeDJ%XzfnbN<mn#b%uFBUZEB@ukZ-+mrL+0?QjD-I!T*r#P
z#s)u$#ESnnUVHpy3jYFCzCKy;{}TD_@aHT1Tz_c(5-a{&Z159HEB?!z{BMPSsRpjj
zR{WPBza9QbHu$%80sj&k{5x&%@4&jNo&L<rlYoz>o9wXS--i5l_-kzNzYjjK%KsjP
zU#BPi+lBmA`Txkl{wzC3g1&}fr%Nk-C;#z&8~J^X{MPbMb&#J+EnMBziTsis<hMl0
zuZ%$Bp!(DJt>vNh+6n)18~k4&zZL(@C)>CGQd;c7u~MGQPpkaukzepcJ@~Or;rA&b
z;ivH<R{W3H;Qtc&t@xLnWRJh(Tv_lwRlYu1@&6q8?eHg4XTf2}laN2zuUPT7*x=ud
z{8s$)dN|-ePZm5+p3F}x{<+9+hri4QKlPtj@o%ufzX$oP`1?D|KQ}7;H<`%gg%$s?
z4)f3D3P0B$YX4aAZ??g|*9QM9ZU_0(Vk3^9$&>kM#s4Dm+sS{kjr>V|vEqN<2LIQ{
zZ<YVOgY5BlDEt{Fa(Q9J|0CqL!=FORf<xOG>c8LMd#w07Z17WlEB+H5^xv0{#5f+3
zC-c*azrTb2=PLY$%1QY5<2qLS`)u%&EwSRC(a&D~Tk>VWugR17X~jPk`R(LCPvQ5e
zoP<9P|FPmv_`A&5m*xK!*H-+)5dQ(TQS-l+0-5n%m0zE%_=h0B9sU(I^7nKB{{S2O
z)P7d{GcnJ$!(TQ|B3?i@*<r;$9r^9>?@{=dtGp!tUR}VSVuSwxcv<ncJLrGMcv<iZ
z3_D#~@qg%`|I5f(!NK*vPZ#hHx4}<>w&L$|qP_fE3T634@??Hm@%KP}JNa)@_<brT
z$^Y0c;Lo+ePyNS=|CC<#_>&ay-6nE*Va0y}^4sB0CT9x=$Dh;%{Dn67<8AOSg5L#l
zRR2x7KosvPq?_!p;-827cK8j2pWFZAx`4mL2EW?||HlscQ+A;Q-I@M;;GjQcHu68A
z3;3_K!B6(fsy|<3*vo%~!mr!_vjwd3{|x!<<iAwmpQCb;{-0!n|5sXn%@X9r|7Y)8
z;Nz;weJ4q2!^2Km3Km5fO27oLOwtDlFDGr%?tw`Ow1vtmNt0<CNRyaM+9C+Ww4RP3
zS~=?B-0Qjay!jnHo}P0(UXG%s6ln29d8ow~#e-5TXjH5ff!zOp?e)#9S+jO#($;hJ
zchC1rX7Byq-)nvAvDe;v?X`C5ijUjN9J1~I4_$s^Ib68Tu(Jg+^Z)G*`)>r;A1%`U
zkpTM<hy8ar?0>0R$KQ81^Se*mPeH~cJN;jPJmViTnXq4{?T=}k@juI9|9w?%`z=@c
zf=NrSZND4xF8fuw;nB%Z_aA3F?3V@DAJz7EqkfxY+kf+2Zu@=OKA&%qnErDd_L~FZ
zzrER)D`ejbh=1gWFK^oCyV!Cc&Xmg^1*E^N#b?}GApOrm-WC6SyjcL5_W3P{ZU35x
zJO880m3U}p0s9HayX<fNy_Sbf660U(u>a+V+x~%-O01y$2O;mWA7y6|WTyWDhyCia
z-S)Sy^5s8QApMn)ciBI{&K}6L&u^ja_<s`R7jXXkSvM;2P@($&v4HZwU1<%4#(Xs@
z{uepyC(d)*AHB&JEL8uOLf)1B&FrjzJYS8nU*oX<qjTN%qc{741<OC=UH12C`)2&-
zIqX*j#6Q$loc(hG;=hTV1(0cffy4fP1jK*eYTy1h3zWal2gJYXgnauKJM5owmOK7C
zbjJUC0sGS+?~4EasrmNn9riZ`*l%0sr@xT>fdKp4^u%pu{4aIbe<8qr<Tl^_|1OaJ
z=K}24@n!{N+P~ak|CaOJ@jtNMw_o9_@elB8U;o|<c~|@op6m;5*OF|1-{Y|VlS;S!
zu^wNr(EK9@An&rj=@j4osA0dsVgH|To}5!PpKQkZ{Jlc<9{`)nejRVNK%?r{zy2(C
z*#D=1_Ghf$7yPo8myI3&zYl1Cj%fR4|F_9u|Auqi>EAivTl|cl3^AXV|0^NyN`K#U
zUy$)3G5<MMt=vD%^gno;PEI@iZG%2zA^Utx>assOoNqtwuwNBW{wp^6_W#mX;~(JH
zj{i9U<$qM$H_QK34*UO7=}!MnopGBA)c=2iyes`Jy5f#%&l&$_hkYiKNwni1y~7tQ
zWS_;<WxrwuwdR(8j%Bp-KNV2^cYZ*LhuCJDWXHcZp#1OC_RaEtjl+IrK=~iL%ePup
zApU0slz(rg@3>k1mpkmg1!l-;$3JpUarPNcSNz8u_E$RW-*AE3e#?+=f0WJ{WXFFc
z<X!gf=fe(=S^lqg*#BLC{fe!=QMrEkNBQ;d)d2fdv-0h~*I|EeK>Z*6P;vHm2h{%u
z9rkZ@*slyof8RFW{vtmalKi~(=d6JAd-}z*S^jQz*xwyse>ClztSw;wD*^V$9QIos
z_U{Xbe`wgZ&px|JcKI6#i2wb3SOqfE-|ny<^!|69<N4Lo(8sb)lI<NQ>H1@}6R~@J
zKD%Dq{%?T1(q+rP)%Sn4uSQ)zJ01R4Um8$<wf(y-y|(>I$h+$ADsBIM-wkDdjl=#o
z1MKhni0}B80`~U?*dLqi8#e8)bJ!2cztop}`{w%_-v3L!$+lXqKbD_uAM@o~%X9|l
zO<w%;^(SP>Z+n~X|9&mU>+fxo@PD)RpY1z|^6bBg-?Dx2GC%)IE&HP%_vJ+1KgwQz
z<v1vQ+Z^`U7KvTiekj2H-XiT^gbp0khVU3ShxTdt>vK?_mk?!0rv%7XeZoI~roYMj
zir=ygO8<68`l}r2zvpsy{9CmBs*GiS$1XoX_V0JtztCa-ivjjGYx{eT(*6#I{R<rS
zy#V_ypY#pyC}96<Y(Ep@y<ppHvW{ta6XU+*yWn5c?Qc{7y%qUSTe!%}c9yRH7F+0}
ze_<p3vB=5UPx{x-KCAkLwrhDlUogq8j~@%Tezx&t0ccb=V66Xl;$P(Dy6_?@j%}NA
z4@mxL`_y(n{%v{8`H#P3`}(=P7ezo({%G>|{ojT2=PR_fZhrkjwbypi-A#!lr6s<f
zv{@3mA}@c4w_L|xpJHkg3w46C;kxB5Ui#PZ^qU8XdLt)r6HiZV*s~<Y3K~z};)Smt
zZ3xd;(&7z0QhsB@ExXC0so{EP@X}Am(}&~f@mw9#8ul#pb?jN{vDeg`-q;dPx2}SY
zhE`vTl8>jKfV`Lfy|?wL)L9RXkB{H&g}r^vTgOvpCrVyRr0<C0zsgH5uRC;lBK=$6
zO!{Fk3_h1A`Bgmq-9&nz0{^qY7cta_sJ~&wa+rmQXM8KBmtMMT&*B&p<Lz0joJ3;7
zGZwcrZ+$_#k_dYTlq=08uZt^*bcf+eJpG7rrMcwQ=JboED}Kao%1iHegFIn5%JXDA
zb+QTyJUMdcWC=h#y{Eb4x282S;Y<?fztjK!cmAVp{$5vVFFnm0zPrLht$N4s;@HrE
z6NiqJ49@h17q9ZRj;5xJ?>lsYu369B_>y0ILPsf|r$?)^+na{rC9&bFVh!nKvGn3t
ze0YiH4PWKO)5|<Bz1YKX3yx8Fm!Xkb+=Am(I9`S0RXASdXpe@M#vYiGddtv(-^RjU
z_}0jjz3HVfv%T`qPaWD@juYPS(hBn=oE%;ny<llo7F?++&`LHTLvN0!&QwihVz@V&
zxU{z}HKSqM&7t`Cl4$q~hYsCX^U9&?nV_Kqr+gW0*!a+qDT7Ozx4tqsrFpm~5+A;<
zf(dL+zZ|cA=BklXD!ux>UU=zVZ|ma?UuE-{2siysC3)+pm!4IbNROvxkMBd?44$4o
zC@sm&Y)fw5tpc35^uo&2Y4PC=6<&HzBK>2uLq4895Ffq^)_P`p)o&={+^mT<U$CaC
z;qa1JN$Q;VFk-m%@l?5&o>Dpf<e}*-7jNN#pLfGkD!r0N<M>N2sfee0W;dsihLSzl
zR5hpXs%tL!33j6mo0r8(Ui!_O<Kun~d&5`HW?MDx)n8qaihARZGi>3*OJk*j@bc=}
zv28Vn-pZYt(cR&%%xDaM<*|nPeS=d8rN?$t-n;bb2+QU5QLX98foWd)`bhW-CA%Ba
zdmDxhl&AL&9jF+3tu%Gw&}${B6SqD!__o8lW*@3(Oz+zDQdvWKSHrHCrZm<+9{$9x
zL!~v3FHb;iQ_WM&TOSX9;qiv_*PFtP-}8oBqfJ{!8^evydRxEW6mEKY>nQN2y*;~_
zfTk@^rBaFE>m!Nb*1G1c-*1KpE>9=H>R`Az{p_I`4e2N2CBM9V=AmY&NrW4}p19!Z
z3Lu*<hwl~f>ZhCQpS`;#QSvpMPK6WoPbI>OpF%=#k-9zt=v0)yDzE-wFTChsFOA*w
z^|;PGUW45K+KsvhdV3zDGe}%&!{J@!scGKO-LpffTMzH52!DJO2hmVN_!FZI<)aOo
zQJb&D6?9WGQVWkCXYo!9FO9(Sz47W@@%kt4to2IvQ4PF-$BSWUDZE)4fjYW#HQYg&
zT(lRt0e6;0z4UkJ&aW~RLS3)@4udz0Ohc2hY_>NXJLsiPnU)wq^Wyg)AY6ggCc;wn
zPE?8(X>L%!*X1@hDCd5W8`@otYnzw;k-CogEs(N@-bqI7G;gG}FLSiC?-*^4EMU2n
zORATC&allhetL(I%-F%i$b4Am)4~u_>y6wr4W8)Z#5A~a=QN~010Vo*PMcH&3V9>`
zm~DDuWMdKWK#QNr0<`!+S>QW>Fz9wfx>|Nv7z0ISe7un}&G;lnQpLvS_<2{Te3oa6
zPC3fwY$>0fQ9j#_wS2D28d-<(c`P;yl?XHbj`9glGQ|<D+&K-tWB>%<&S{g1Kp}4e
z%4ZSrKnciX0m^4k798*LS!8^UpLeeEiGGORetPWxpy5QBnVl^{XkPEGl5)DrD5rgs
zD5p8~)oxEWWsMoT$LdDm!UCsMJkW%VWnI8-t65?)XLx-<`BitQ2os9$Qk34&RAl&S
zZ|M0GhkjQwcp9!@ZRiZKXEO!88oxuEkSk1KmkQJ;geOyd%zea)RVjNCnRe&2N#$B$
z-<XHG{1|<D1kcDcV>c-OP?$5N2vsep6ctz1yrDf~a<4%DJX|WvHXSq}!vD{xuSm<=
z*~<dSwn(u&wsm=k8@S&$H!fQ@S7CHhVHU+9evN6nL1NqVdD#Z>9dG=2=aZzjke?EN
z*#`0dzlw9Qb|t@L8<dXY9hXo;PiKE`S7)TECc0ojZM3%T!U)$n?TqyHMEd8~U3~HU
zi#w|$9o_9cYa<(y{R3UVYc8G}om(5JT9-=o4P0{3MeV+hxodlS*LEiddI$SEl5;zH
z*I$(C?d|SZ*WT50QFr%-_3!TM@4YqIk&1NIuc@nFGrzND;lhRUIu}H1YLg2(qV@CZ
z7p$4LdR{cyk(}3AJ8xlabtp7T2cqQt*M>?qRg}E_lxgML@wl`SxV)E8w*ZT#S2RqY
z-7q~eRQ8e5_1vpiG`(C+q1UK&T*@u@7WsTrK2rA4()UfDt&nn@s=~jN;~N~jr7c<J
z`8fY6@_^K9R$uR;>5+!%RSnalLnqv;^q1bj!w5|JW@zIXCFRd$Zu?XEUg7lDDw2o6
zleJN&A1QaxmX&7P2H%O2CTrtUMcSAR-Fr1JUUlFiIK5)1bR%-dAKU+eKG&2vcegsn
zJeCLZE4hz!Wb?SRSuz=qUP3a)<TUbuh+U>1>d#b&kF{uQn#MeAJ2iGb{ZQownT0H?
zS~NY{Fukr}dTeOgy;Da{_{fxxmVKzS^n-+=>NJ>`uMN}7!K7@;SnHV9Pd^^f`Xd@+
zJoansXT&x#9;N@rM3etjeQq1ifvWIdUZ!?Ke94oSpY7Q)L*DtC_YM~?s)k<@eZ6g(
zH|^rRBbWDH&HF(YZz`AfLCw3}#rwfr-WN1)F=?ydI}K1VY2&<%q+-&xPV*L%wvTJx
zV$wFMc{xTbFW<Uy<M6WPRl{cNI=d;Cced(97nin1&HD+L4}X@cw@>qqxOnf*^0J(M
zO7osbUJ$XJ8j~>t>O{a#nRC@@u4S#2SaM}*^<xXfVOdB#$URpUIyo26M`a;(50H1R
zEN`V!pQTI|60;=ALZ@1Y@JlO{d%7(2)?7dzm4(g-z~3H#%at$pbXn*fxqv<@3%xS{
zj|AXn2jFu8@N)w2$^iVl0GzE?K9z;e&j*2&sns0wPnCt{=7Wkq8i3m)Cw#UtwOU}l
zNLgrMJ_w{NR2P6>5`bS8fMY<0gUUiN2THq(0`SH>{Eq2ZgSk{UxH!8&bBqCE{k18K
z4%m#+B^h|L-ur9dGfT7eRQ0WJZZ5thpIItb*HB3Hqkx}_2EnDjU-4(_uj+$<|F2L*
zXO?E`Z-=(~6UCpczruftN>^BO>An??z67H)OCh95_%DY)GfT7eSM;})63^CO)n9=u
zHCN!AP5&4Ww?~nrnWfqK-lPS~v32QLg-*)M(ri1hQuDXNe^=bzt<sfkAH?J5Avd!$
z+dfF&=N}ZFZ673uK7oYIEX}qLst*L-3z=Vz^s<ZO^5;pVCxWv+#q_od+nJ@=_9UY5
zU#R?=qmM!%)epi^OzAl%gKyJ&zk=bJrP=nRSL1B~@qZoH(wU{%c1HCVAoF%)`HWI8
zqrXM(y;tE^X7GsK`zT`IO7BBTf403!YyKZ1gJ+gz+p7<1{I3*#p+3rv>HVTgSGK*9
zbe$29t}V)LG^0n-^=V}EjM78~mvsG5;mb03MDH~!J+&EJ{7))Bd3WQJ_<yd#v+dq?
zeg1sJXJ%=(-BbM>oO?1LZl6PwF|#z=9)3vc`3n_)@j4XRr17T}eyu*jI2gS*U+KxV
zpW;9JFEdNC?dK;n|3^<G9@9smkm}#y=rn~d%HTLubdACrGdQY)qRY|lRb<fY&M#SC
zvWJ<y4&<*3=g@K&{?`F|PKQPpe*>CA7oLQ`jM5buKU(zO@6k}qD7`KZuU7b~3@-71
zLg|rKJRAS}6#q>be$oFl8Wxv7Uqw^y!nXwQ_XY4@9>8B6!2k29ZoA(*$&LR*0RMdf
z{N(}sucG|8(tBM1|Dpi>|D@VUGzOX$=<N>zuD|~fa6Nq@;Cgxn+J~8?`Pb7clwCB&
znmY9M7f6)rdfJO}>$;vktLh^Pizd0ABD)l!84A4%|F7%kmT*TAnh$l~EA>u1vH4jq
zNH+gM9}bcK0{n}9@x<06S4>+^dw`zF`m;1Z&wu;l2PP;!sP2mFe2HqD`8W^%lE3u^
z&a0T<lhq?vH0n3?G#L6>#zenao+&H%UmE-@`-1<gf%9r5_^SqPrmIrpb{wt_;J@C$
zP5*B*@J8&5UGbm#m*9Vv=93<&;Bv*S(&ue|mTTP3mm3Y-^k=o9hh>0rq+9)sIyU{3
z{ss9w{EPqSCMXg=#s70GT>PgGB-?+pzMJvy^4XO?rvH5!rykRPxqi}5)Bml89@GEh
z6@Td|(XQ#gT)~N({!4mo|IPH8{=YB4|GNy_tQW^CU)l`)X1dlHxS6hAjoaxm%a56^
zyA3^NzT9izX1Xd3{Z-hP>(sH-$7bk}@@$p|>YSzRne~yllxO-tvdi;wA6Dhoj9W4F
zu?4a$FC?=*ntqz`G~;IGyXn7KA5H(6cO=_?DWCMi^xrI>X1<&C(e&S}kEZ{{)JN0*
z$;SU!>Z9qunO@WXW2uj3x+a@1ZOkl?oiFQrIIo@T)j0FlOqW@H%ydn*K3-_(H|yi|
zhCgQcX*F=O{0tcQO6<GpBXzp!Bk@ixU#YiDFL9}-^nqlT^ILp4FP>`*-1Kw3#;Io&
z{+SP?L4Tu;P5(b=;ATCQc1!$}biG~k3ohw8&%z~L^o>M*Gyca?f6a86_18>SQ2jks
zdE@(I=9gK{&HTE^;+J&A4BSkY#Gi3D%as{_Gr#UM^qA?|qH*dm)Aca}H}lK9E|}>u
z+a)tym4;p7lCGd~c(Y;GOjpvt&2)7e`ptBu41P0R5(lQ&Ojp|AH?OlN7&xz4QXk6$
z@CuEWU|XyAxtXo^i7(Lm+(h&~ajAoZnAarY(pK;|${!H%2DRt^)aiZViwrzw;B5xZ
zw3Eo+uJ-&Nwv8m>tJR+W!`PCD$GD@ZO>c>J=zVV1>3!nw(fi!=>3!mzdY_w3dY`zI
z5kh9%nlukL5xr0TEA>7%F}+VbuJ^ey(|eVH%P#qO-y!zO^$FrEdxD$!OFV{ulAISk
zF@@&h*{7hn{>wF*A|gjU*AUQT`oCO2V@rNsPsI<@f41R*oBk7z;h!YuMNdqjx%hP&
z<0hi_$uE65LNWe;h`(3u`9G%rHyQXky-$9*M<8UD6KNAPtJ;vC?TPqprgyD@o9U%3
z;g>D-5Rc)X6j8sv|LpS!UzLT&^l{X{X_vZ4b^b=hfp|<G%U1jseovnlT=>L3ap?n-
zHNqbd@!Qm%{}a>u#HDQ{Wa^h|2XRw>4*^XPy`>)MI}wWU2Si-*h{vXW=@Sw+_4gCd
z6wzDi8PNOO#PmLKX~PMb`sEr&d>wy4<lmt7{2%d+_(lUa{rOXjXGEu^6kDcENa91B
z|3VT&Vr2qiyF>32=e1C1zuqB!f`Hgg(Z+~RHSo&}e42rCo(B^7%hjI$v%|noH1Ka2
z_(=wS(7>hd!P8Ty7{rbAA$feEfxm@-rkH`_(Q<}X7<f2?qFfocv>`nGc>|we@XH*7
zJU!FEe_-&RYT!o<e3pTqqBDu7Pc!g313%rsI}QA;2EN_ErOfm6Lk2E=HsS{j{A~m@
z&C-Q~{z#vkr(y<vrsn0Q+rZyp;P)H&I}Q9113$~a#|%7T;AiSWNq^2ZaL>T!7<kIS
z&oS^F23~34pEvMx4Lr0yxxS<C_E75$o!u=PxM^3LWy@2wHLZ#GqQxyOtqqIft;-sk
zo0hjUEN-e<fN`u{9j*SS`Kt%l#5<NPZ>_1pc+~#ZRDXL{Y9QXx)YP<Ka7}mb#-<IS
zxvAu))ZEq^CQw<M`P3i!>IZu|ll`{vRlyGBNH6T`=pF1y9fjR_Z~|fzI$C7f>j&2L
zZd~8qb9={eQaFF$_8#h*+n?-iFCw7P-b_RrYbPVubyRZoM<rF0lX1$=iGpA6m%FZB
zlrLwAE2yDneny3wSK_Gk%=7gy$e5nuSk*A*$D*dlLRmOGMJigHSE5#Ih_?3B&TpNd
zikl^}W-=wxD9L$p#n?4Ube{Y~{!S#fVqH(o!U<Aq)Q3Eqg?*k#I@n`NYNDECRXn=b
zdPAW!6<c|<w!$T%$ja#J3r_cO_p7+dUC^z`s3}|~YP7lnZAGzO6`>~QQd5M3W(AKP
zWd+ZZE5@!-QS;;{C^pfF<O)>=qq61MEbQ|{(!m}dos?DA>Fx2W>ss4!tLwhL;1CpB
z*NgV6xJp{kt;wh<Ts(@b>&1FipsrJm>QRRHY1#T@PbxIGyQ}B6WdFN+`%?HUZ6JjH
zNq4db<)){7ebHUeoX#D(3@ul!>z=rCohwmOghY`YmW7)J)+SRuO)VV-JSbM*Kr)3J
zmE)&x(?H)K{ksYd=Cr#LRE6AVF}{UTmn*^e9+SED0>R8T2Z^Ii-6U<nP)~0vId|!@
zmG2%%wRhY$>ATR22a?I#de^LJ+Jt+JI^1-$qR*dHXlGY{)2&CRu&;NZ3Hs)*!A`t>
z{c8A@O17q&sISOdyPUAr_2S!6b*tPpX@~0jRwFQL+Pk`&Agrt>*R`(cZ(pAb%|(?@
zwXeqZ_VsEz$$R*PYx<MP_a~cHPh8`RtZ(xNHn#UQUAuf<>(NDtt<Spd<u$Dndy^B{
z#i$>?%u!{`!q(QVo~{&|2--a=9dz3lFTOKRw~x_e`%y&7mpQ6bO6Eo-N}cVgc50g2
z-;1Y4E3TWM4K(_kO*+Pw^onDWp3ru-|9CXE3rbI5JKGbSyyb$j6WGn|OEyhhn~JR4
z3%b^?9!xe}dlj0+h26a!?cGU9)Fj&+R+l9$8`k4@1L|A>_wp)xj;LRft+KQ@xGWh_
zjpDgLYmpsQN$F7;QcoaSrL)*O;X|a!8>%tumY=4gdbvkq$*2oCmL~4GPTo>pE){iC
z-DEy4Kid7b;$@3|6_KN&N)IA9*L=wV4*hy4!#fo(gNT{$sCY8Q9|!5z44E^7csVqY
zyg7D*Lgu?69``|>I%7OA=*W5gK~!TM*fO2+ZcN_M{7<|La@pUk<u27*+1U0!33-=&
zu2DrY?ekTKZNCaHwOsZ`DGV~-(ev20e-7kb_E%~9l1`?d?+b1F-2wI^bP6==Z!*8O
z{j~x1`?P&eOVU2yKic;H0xu0+>6bMuC})yw|31jO(*K~tKHq2B_MZz%KVNu(3Z?&h
z0qK_kMP~Z>e$=)<HK6><yb^`dUlLIMy(;B?<~=_3@O`Uo|KAZ%SNtPozI>td?}WT7
z{@We)5vn}<7YDQ-JGK2n>92*n%l>|ceZCL2(|-f<*_nPS1@RjWlkD=h67nwlk!oMc
z)51&#-!I$tzluuXvfrld+l{<!|BH}!*<Yvaw;A@?l-u^N#mjS-{hiwWN-ZxN+kP|T
zUH12C`)2#Y_usbtcR``cegzv#koiuY$F}|N19QnowY)htz$L#UK)yxGv&}Tgw*OI7
zDwq8>Eid0!iw;}<!;p8y?|_b<S$_B)-;Uqc1MF|t7vz{2)?3>?%caZzeOf+JK>nqG
z_G?Vb|Ez%gB?0~)(1G7pK>lSo@AAJ-2dcM#{EHBF#h+`Ok=oR+Ki0Am`*!>fL)c~i
zfM&cy%ge@&|1Tl$vcFB+AJu})Cw6IU`(FsK--dR9l=e57U)%n_2H5v5@I^+oB<)w>
z-?sl<0Iu|pY5O14^0Kk*KLvSL`pYl$CH8AU+Gj{?`+pH&fAdMc;C3x98{7VU0rn3#
z>=Ux>e;$c<rN4rm4N#%-_b(83rT@Wq`|@r6Mve8Ii+$VvT><&OS=%pE{%#M*|JgJK
z8dbl3`Hy1Xwtq!{{SdCpq(bGdKEVEdhy7aUv+cJ6aK(SSwqL0H-2i#G5Q^d7r28-O
zkIeEnACPVTtN{BFcJ@Gp%HP`p?DsL)Ak#j_$=miT(f@Fzf2X!@j>V)tyZoO8c~|<q
z8gl2he|0#v?LUC)oXdU`*9Fpt{7vT9w*R+~ciDeH+c(pH3AEVu=LXmx)%FXOzv=+{
zn_1XErhSf+x9#5=V7~>|HPR>iP3G55e=@-Ss(HSMY5xj9w*55PSy%kWwEdBcWq-%E
zzXkHH_(xgTL1X?#wLdZJ+xEi&_BU%oIGsbb{gVRhM;7>Ev$Zta|3&z>?OzpOf4erM
zn*psQzx*!=uwUn}-{`Pks-GW}Wi0qRJGA}H7B2n^{044HT=8$w_FI^_Af|r_{zYEm
zG9B_{vF%5AvjuALH<@3N7vRJI`#ad!fZEirZ{Ned$cz0%fc-vgKceMjBl2>*G{Ao7
zVxOZ;Gcx^G;$P&&{(b1+yVAeC$n=ju-WC5ghy8@Z{=NYF2Z~Jp*8}X2I_xiV*#B@q
z{AEz|Cdim1@e^!oK>Q<hKF4;=$oR7?iM+)Bu>kv<kS<c8^0zC%{!VRw%vYnz|Fzh+
z?XSY%Y*+s8Ez<sS$h-1?N4;;j&9J}1VgKi+x$VzJx=4l6{}SX~_Cvhbf!frsU;nPd
zzMcLv1MIKU_6z0zTLbL3Y5Us^`>P!G9}bBBfg;oY<$(B)InsZF!~WKQ^hePylM2Ou
zb3poA^n>3vrNxgwzoW9_e;O_@uC@3!Yx`O}v(e3Y=J*uK<0zUz{2h`1w1tbjY@bCx
zNA^wDvyd(q*}QM5Q1X4~2If#i%a5XeVv?j^uyV+|%I{7czfEO6C)<y9{ENJ_A7??{
zwoQoxZ{sh%XVMpN`t7>^9k_iUm0aJN?C<aG=W=`n*W!!T)cLFO6~7kWY@HVR6XOql
zuSV3v`W{O`_(_j>>DPA4QHX1CJ&pPG$6K&M((>}~$9G*?hBbg9doybV)!#+5{&a=z
z4rSM_^6q)L98pbw8>@kJdc#xBt%6oBy`_?|K1d5#Os;V_5>Nm1i-gj@NTd%d9Lp=r
z9y&5USk^E+ZRp79;jMoU=7hgCK*Q!MLW5Wv>Ze#fry+f?W>iTurQd~Pwd)NX85`(_
zYV4f8@s!0QQ{J<!EHTnia%fI-`i=O|H^cFf50q&8k6=Zwiull@rHS+fSY{7P0bwP*
z!-@23>ipuzrd$@vx_+te`ruh!dcSwiBTU?l4L3EIi(@G<^~3a$^wJTTh;nVSdtT!$
z%$-+!H3|mBO*gzfWi=Gov$%W?wqgJ2VR%NYBC{J>vnLkm?SCvbCv>P>7R-S+k{J+d
z34cMA_AR5S6SeL4?)FC1BVc6;!F|y@KJ+Z4vNVCemjwEIHsmu-+Wz(j`bw*6ZHe@+
z?|D;&WLDPu^K^zEnwiDU*I0UgBK<3W;lYHTG+Av!gid$kNc?VLJ@g;6f2{G!WGt0|
z)Y^5!OUj2&_lA*0kBwi0^{k8xDs<joYh&nTREzKAR-DGl*~6z}F|dtsl>G1)ran-T
zIvERFm18xM!IKW1<vn?j>yo_H^XthM*&s=sXc&HLe0U?)F2UkiFOIih<+xduhaWCU
zo#G9rDzReJipp}7rzd~rjif3|MCkC8%97McSW=|2LKPg?!eVNRD;mNTQ^PaL{Pj7f
z#`i2iS;lwSnHqj6938}>Zu_x%oL&~ws1Zyb7Pj+-UdF03X1mZ>8B3=s5v&!Jb%#sT
z8i5V4*I0?-UlOjKQhDfx#PIvd6T`Qo!oGR>#_8V3os}i1-V3+kTol+?c<AroNpt$u
z_|P{{%W+y)u02XmeCQF>^Gd97m#Qp}k3W`3zlma`Sg>qVC00^V_J1q^Kn0T)=`hly
zgHfdf?BHZph$#zKG*(8jm}f;!L}G(85Dt&+1(zXJI@FJf2bcOoM6l-Ix9p&JaJG&?
ziFxTKlmr{N@X%vOsWft7)yOqgmM2C!D^EOhp0k}p3jBty8+>VGs-vxA7$OWqoi~Cq
z;SNMZ2O{bR0%kQZ+jmda%2AQ1%Zr3Jcq$^%l4&`OSg;&%W!DMI#+p4-DtR^dgJ)Q|
zpJBK74$?Q0aeY&6KArvzRyNA!H3}@t@oZ*U#9fZxi!zLI+>UZQZj|HqupD0m47tk-
zo}G(aVTjei&&3N-jPGPI#u|*c7Wx+~EC^It#r%VL6k~shJLDotx@1<B&a65gu<E!j
z#&Imgo9@9?_LkY%l%Zb724_hr&b#WV=veW=qM1*i|BxS|7KEsZAwqpOOZB&*1q({5
zOE*h(<u)WZG16T*<IwzccjYNw`iF`1e|ke-4|^kb$VL27h9%++?Jo7wH=#L89~uU0
zBHdYuWd_lyKrR2VO6}su8qa0Xxs&Ca4xo^u8o0t#r^Dn)+$uB>Q9yw>wWv5@$zezD
zK*vcosyyi;?+8@3EJ?ZlL+9|xy4YtH{1i|9?Mu0b>U!sg1j`uOC&AmIPG*Jd{-!Nr
zAEOt!AJPeCaUz|ltU|}8CS1)nwmMN63s<kGYzbH2RM{4;?yT$!SAVv0GuXq`pRe4m
zwhvYAz&2Zo(f`~Bz)K%sS9FxSBU>sDC}>ONgWNtC!7saJ<k-pWh`N#RM($OIU&(Y}
zvue>dq}su9bPVaQ-)O8&_9XkeIzodz1AWPkt~Fg)qDEt_9T=RvwzvQGi0bx-{Cj{L
zPJLToF<ufuCF{AZr*~tIFB&<w69)gA{y-7<6J2Yl0^yKv?AaA05sRw5>{vJ6!!~M6
z-L9&2ZdR$aY{=iH&*?|;AwEA$X{?+#wE1h#ES)}Dp0oJO58aE;jFv;3HXadudP|>J
ziAdM;NBLB`l1}m5tHeO__=9uHxs(kQQC9_h0#P@K{FNG8PQcf74RuxFFs9Gl$#d5F
zB^zYv5G;m7J>8nuWp|rCr#H&3tTjYg-|lrPt~`EFGur2(IQNV`_dUvGd}_p!KK}Ad
zk8!~!y&?|R@Tmh^xz1#jeqY94*Qs%OUuIpWU+1pt)G)nI<$a@;J%x5NvREt#O9nMg
z-&`^@_1+UkeA9=xx)9bFiewgtY5)Vo7|VOLp8K&+J#eyddK=faD%~dQ9yLsFQ)TEu
z&3gugkta$YwCeSXlv#5Dqr>hpq-?WH%34Eb2kF~hl2az%bnDwramI618Gb;2!=H?Q
zNV|%sURCK{Bc5tKr9M>#KdxofjX1=a#}8;sJ<?TWFp;TakLYt#wJnz8{TkC@QhHyu
z^pa0KxWYzkvChl<8(-%6rPB|Tl<s5=Il#2>pRa|v<>Q80y+0q@1^Azcg4e#8;uH&B
z6Gx>qPsX)Y&NXOwN{}O}9e@P=7ILkj!!?G;FC^^%k6ml)3~K$tca8`ue*FU4z_{yL
zbEjMD(L+vhR{e3U#nYkr8Gq6of1`en-x@tEdHEE)c8`8wX^7mQ{am3jT?ExpS>_63
z2w->eYxkI`&*~~uE9Pa7Wv@&<MU|uMwoC@BW+AmV`L%d1vNZUIWva&HpPI~?JD!f`
zDy>GpVpB)KYw_q8IhN_Nypf$gLs^J#+4IS@=FZK?P;+e^X>Tq=6`fg{t=CdxFTnF+
za}6CSF-eSdn^`Jc{y1HFP_6Ln2t?Iq0A7Q7s@gBh&9egV`T#seT%0y^eHkWQ`pb|c
z7ykDF`Z@M-X6cC;&C*W%K*cBf@LbxbZQwN5CQy9^V9y5l^JoD6ywZchqDky>Or*J%
zf$GzM=LPt0u4SP5Gr*hiZ>|j_{&0>gbFCj~S9=wnZ8v1^a|%C0d*ffzcyJTm-OMbN
zQV<HMJ`3<A0rBK(2v>gHjHcFH14#OD--muze*G3><7SjDrVEOy^!6tRl({yL>eJvH
zuWv3rkE`+=(bA#N{d%tj?`&q4X4@szPr<n>mHx^Mzv^$`=nVK{uHExDnuBATW|oR~
z+3WOj;4XjuQq{-vGy3%_;LtQ>_reS=HSJsApHrG`ub@`ZnF{9>-X~;-qVIxXPAQ||
zli>e5pd3DfqCcZF`|`-savZZWqco<EaF49__)y)Iu76kg)s)B2w-qk_?Z}rIrAzbp
zyHz~jn!%;qem9`}oCiN$<zbr2-$+J}<olBW`OYzx=2}jY@3#cx`(G(Pt1|i}&VsOI
zWv<EGurbX^JZj)KX`K1WJQx0cjg$Wz1OI@5Gxvr60Rv~BL-4%@&bC4D*9@GcMey+e
zT;}?tKkP>eKZ>Cu`d^NJ!KGZ2-}FaHIQbD;8G<Q8Y1DgG;-ZJ+Nl4T)7yp9um_$AA
z!oT3sq7pyPz@?qD`QHH^67}&aEP5m#ZT@$Y8ASd|@Gtyk98gp<crkIH&nT9PF4kMx
zB`*4})VLi7(NF$rgJ04`oM{m~j0wq3m$W3r&A2UA+&;gl|0<2!al6*wH|^eN;AVbx
z1n9Zd;5Yr*VDOvqrynFc4rX~U{V~gfnJ$T&oi4LHnEXNIq0x6o`GesjnfPC$aq4Gm
zC0{-ifPd1!sZ;pBW8h|e>@{$+-rZ;5W;^hY2EGXUqW|9ve2IbYHgMCQrvq^5FEC%&
z+Dkc~rW<y~!EArzdQRL-7wbNWxY_Qt5d;x8)4N5XJ|4%uq-%$Po9X?Gft%@l$iN%1
zFM7TifIp*gJH2HA>6QL6{WsHFXXrQml=?`1)6W$Kzv*XZ0DhasZ9hM5@SFaa_0Ej*
zUmE;ox%!-eoBp%^K(hV+nhz`7^k2#k`Az(J&2RfJ{Yvti<?1ve{${$!Ln6OfuGT9w
zzg$T_g8XK=`geohOz)_HoB8#mft%_2aRC03#_jaZHqvFL_Z<dqrZ;BjH~lo*bJI`h
zpD?|qpWTKY6CcpH?dSh8_)UMbn=1ZSgGcI@^rvXo#HSm2OuMv4BEK02Q@_a{g#Ve+
z;$KH9u`m9Z<$R@qo8{R|msX>mXI+N_=>yA__VwrMidC*h#Fs0?|B2{*;tTaYH*!59
zeu06rZ%HC9eJvhKdqP~US;S-f0TGwJhXV8uao+oi-?Akh<o^mS%S}Y@lRtZxk?a5E
znunWX@&7VIkLl+!12^N`V&D<IPd`@~xTz;7z2_VJ5xq}6HyHRIBEL-i#rS!x;ZH>G
z|5x}a*KV2=yR5IYEhOzQajDBZ=V=CFWqO~RPQ6c@bzW$b-XSh+2%)_OK27g)^8*7v
z(ZG)w_{j!7OFK>d(wE`sDg&1`ig=@eOCAyLGw>M%G~H|9GX=zUhk>7J;13!2ECb(f
z;HMe*DRdmfP4+GuaW-(NBjnp|;Aarf^pJtSO+akTxys*e;5X^aqu7}Se!qcB-<zjD
zYvBB*SZJ?-pCur+KQQo!fpZOU678O?_WYkIy3i1xW8kw5{2T+%orNk<H_+49-_?^^
z)6%iB=HkBgfq~ZE)wd=)Qmq4B?@!jO$MkUTx26X#c7mq`*0_L4Ob5Eq9(<rCtXzia
zzia08V`A^F^+|se^8AhK+SN4QIrF9kPZM4{ueH@2#he-4FdwrTCi6U;K+*ixR&i1d
zjL6p{GZzIbsac>!dwV*&ILqS2>yrZm?Q4}IMTkd5yff*N44y1~ey+=tnjO5>j9+#-
zX)9y0CxT{>w|yu$Yi+J!vKLtr12er*O?#PBbOK|BiLC=N+}9%66{w)bPVgj*W6mvO
z=zXyUYg=18ds}sp$_j<rSNHZ~e$SwZK8<OwT5p(W!v6dU-c&OXn!9>n08_Rtz3wPP
zRaU5ZuqL+bXdj9;9VDCJbcdYf)UO-;p}A}Odk6bMt!!y}dX4!{H?E&}(z9BBVtA<P
z>RB6iPE(KB!Rp()In!CHw_mN4u&}+aFWJ+{`8c5-3oBq+#@3E?x3zL^MgSd~+FSbu
z`;)C3y82UtoJ7-}+cKvd2RAx_wV`%iXL3#ZV0X%IT3b7$RpQK$QoMup+U0vfb;s&!
zrn!?zD+~J<T!D{5SxrveG8Ghd#12$VH2J>4t__&;4l7ouDe!>s6C30}XA;5RAlGPK
zh}UDXPhA|=4z~Aqwjz{COiG%AwRb>ce^NJ)*$F*!!XDUC)ka%eQ|tPBH|AU_o4Qam
zi*0gq8!Sx9*X1Y7Y6Dr?3)CgE;lsR^6X+@OYLMp|XX-NpK53s^3i9SoRiU@0_?uvs
z#lTt`FyY-qssgWEqD#tbV2Q|!SwJ=%m%P+vtoT^j6-tsd2@N^dSIA35if`_6YOxNF
z-Mu>+$INTE$cuNy=a*eXCznxq(nnj>0*Z~_HXPMuv)}}uM!zYz`8XyAjy4!}RFBDt
z0+R#hM&Y<xKC0x)%*cM4&DNK`9ZN~D?n7|tp^d<Gtny4n^H;H2wmfS0)=(2we{t?Y
z*;ybv^JQnA?9|Fm4Vt!I)heNHSTmQ8>5rM#;$e?|G?1ffn|_!&A}<d0S^YRA!}|t=
ziA~KQ{!Yv~mP7Ly6|w6J$n&{`N#?U7;tOHeWxquW*?!sb=i;H3OTJCZo6mFz+48M;
zh~|>ttmUon<;kBDAirJ9%X=|>m?!^E$TOxfVbI&1`k~X9KIXGuKJP2n$MS58W5!+n
z?;r>ge*Y*x{bzyCWq*f$xFvRIpU)LVpWxpK$iJQ1KA*XpWXJzW$h+)6sO`6DVcO^O
zOWXbjfw|HzW4HJ&&m`Oa2XNA5f3|*zC;3SGZ^6H9|NFpP_FHtp7k;oQvhDNzx6A$m
z+P=h@_E{E1pWq)3h<}^5Z@z<}1GfFG0r4Nz_S+}~qJ2K!we9~152sz}AJz8nq_9D@
z{bwQXN`FK@ES360`+Qz(+g}RIWk04H#X|YN2=XrbRr;Z<ng4wLY}@}ajJxb_*7kYM
zBs=|G0rIlOrR1~du;m{Jke4}K3&~$M-R=KA?f>`0u-@ACuYtTPeh=#SZPIegKeoko
z{H{l(a>Y;PM3wj8T1{U0y%zE=`_YImv0n?)KARNV{&N6a_DA(g7a7N))#Ta#9^_s2
z%g^>D#<U>qvq;<acL!X*WKPigwY+TX_<sfRF8fEc{q0(i_9OVW?O%zPKd$um@nQp#
z@udDye*4h`d6)fdb9@Oi{)BA%jR0Ksw`)cjzZhiyJ>YZMZ#&1AFymk8uz%`FZu_J9
zCEDMJVZF8EKOOQe`z<sEGUI<9j_vfnv(#<B4|+-FyFVV=_RoO4%l-jve>R0c%>OF<
z+xGt)_1qPInbXsJcSk+8{f|K2W&en_AEgk8_W6F<wqF9kWq*fGKQ2!>WZQo|p#M~L
zt}kY$pW_H@`{yIT=6g#q7S#zCe)`Y%&P*#wwtSDL{6{{Rv{U<U!FlluvR|j|%ez_H
z=e1ny%J%dC`=dpcpBXy;)Qd$U0WnAXc*7#`khli<-{|n4<0-^%**+=d-wM>eBK`jc
z<diN;ewD+2zMHrGXZdoKzXRI-mvP=CyZlj>_G2a!_WQJbPvgu#j(f4~--S*cb<}D;
z+58ndyPz(AlldhtNw$9t<J?C!=1{pVIATvu+Q*-QyvzRw9r3G&5|Nku--CA2Wxqn(
z_r$Q?ioC!NL*8Y7pSJ&iW@P+0?ndOr{tqBb%ufHRBGdma$h-V6R(=lTUH)%kV-FHP
z>Hih@xBb5}AbxE{#&2Ul{I+ZRX8d9f`|Sbod!Wep{S5WQ6+e-$f=!bo{et}j@~-&R
zz02qDG$Z4;82=(KaeW}b{=OpP_qPG|H*5P381|bS_J?%;%`Shld9w%-|NWz^|8jg+
zK>w|(%I7fcF9lSt1ttA65j@wNcx~Fg*pV&s%A^x14?wQda!%wwEr8yNylfvo!I!t#
zLgPi+{}ry^(A8%(-=WZSUt^So!yrk&K(9dFRetvA_{sO%EI$eSi@e0I7xgF4Huzff
z^-Jb<XL`?f$m2y>vb~eD;rUc(PQ03EZS7>|#M`N#g}}VN&crbGu_V;u4ZSBcSh`AP
z{_*GRdXKktJT<FErl=d7jtSc+dE@Q}Psc{jyOrK^kYElO@-x+0%-B`DG-CGEcIZ=*
zHIHMGFE6}o*L!zoO>p{{NOmp~OqDX*8xDJ0AHVBrFTK~>b?`**i_35LpF1vkurcKQ
z_Q&3?pPlS=Jset?e8el+%UO6ZQ5ojh@kVZ{EDxU*!@MWYdFdZ1dz^;vB!91NO6sRs
zBWjkfshBG!a-)PP<IwW#jBO`+!zjoMk~!y`KL?$95|W+8&ObC}syie}Y|*im*db>o
zh&Ddg#~fpfd183u?8NZhk>>h0Q|GQ(GdFzJ7Ug4n_zI;eK73cXzcch$1(*hZni!s!
z7`~(Y(2O;pEdS7B<w{3Z@Ct9w=s0N13-4O0reOP?nkBK~&{N*<9kW?fPV~}u=-GmX
zFC{P?K)IT=?j;oxH4_;3GIM}o&Noc%2G70Wt0Ug<(kich*TAeqx;~M9AEu+)g}IHc
zioEnFL}(<Q{${-TjrguNro=~9mUx&iZr9H*3vb=Y(_f);ps-hc1QRO7cfDK|uYV>H
zUh-q_i(~$&yS@5-iSXi|HgA0)bvh;k^LD*BMMXm;VEC%Yq0*Ys_^zK!xpHJyReaYA
zQ{p9$EK6TjwJe>gDo>Og^oB+&y!zjz-nKnl(J%(@#=<ieVf*kH(7{7WOL{qGqFRiJ
zdpfFA1Tr%s=?Ligk*pGwiHDc|H73_WFv`74udYZT`DegRc|5(W{3Q;YM1I86--uVg
z-kg3hzH7WJKC%>Xco+rz^6=JLFnC||(>i`ubNVOoU9XhJ>mNlB4tftB(LspUKY}3q
zta<Azsnf3<x$G6@hb|mf#D|xaGYD6X%s+x49K14p=8<J1Q;x)kM&ZNP;?=K(w>$v;
z_|U^g;`h9EKXwOBh^HSvbQeN}ZFBYW@uA;EeC*cvuAh~~#~*G^KOG<X&)1iYRQ`~*
z64gKTIj@9bgmkPq{apOF&o$M&kS%|UFsIz}2k@JCer!>A#wpmH(Rg4iKJ>`z&Gj!1
z9%!!rUMgai*Wm{Exa)|QUILYm9f>nPRIC;@r<cI>>nfNVC#ZCedE<*wD&09j5B)g}
zvvWUU;=k~WkeZirMl9l`%Z%A4g@5=gZ|nC{GqROi&kg0Xdc*Hg`R{YHFk8oPZZ4{D
zi>kvHH*Y<h!Zcm}^q#V18#VL@tCLc-+rM61a>=c|T|E(w?MZfq1nW#<)XzFW)gTO9
zTUrPFIhi_I`%?W8jLN~wqrnai7ZlFWpXl5_yavmqO<nFW-^fxuM-I=`>A<UJxN0tv
zThv*e<Gmz__oV)uH8-hq96Q`c48+SF&#k}=CK2pz<1uI}e}Femj}DcV-p&bNFzrZG
z_0>PibD%hXluduu9@^YX40JYsa1N96;Mf07;{{?MC7+oKM^A)vzs!QuWXy=;_eah|
z?I)@4$gDYSjQMPSoI9CKlVf_DXy`KN>DK!0;WkiT*{vnH3YmOA{aXHPI;GOzs^))T
zKJC@#RGz7Gh-{MzpL(uwP@gZSEC`_qy>4Mu#C3;@_v4uNh4b%V<|59&vs$L#Y1;iQ
zzh6lmd_F@pXXAek{wJc~xnI=vJxBB!bR0|6SIIuivLoc0<E0Y`Bfs#e@}&h_bG-1B
zYc3ZbcXyD>@}3Z(Q=;v%|4EW9_seARc^(*4mhsX6v0LWXid<0PEaCZ7rk>inaH+Yu
z=Yr={VeaKqnGt{UZ19{a=bCJpeb-zopFue@=M2%e6sjz-T-n5L>&!Vr<lPb1jdJmS
z2t~?;e?jTNjfp1JMq&Tl0Dcs8*ga9$GdVOrfPW0CXO`**M3CC5C0hghd?^5*5}^O*
z%KvQnRBa(_bOi9f9rqV=O0$uWoW44M{~YL=Qz~43`^h9+7Qlb2%13=e20m${WAHO;
zl^T4yI{+WTX%|1+7ip8U3bpwd9uCgrq9dB*Ti-VsPu+&eIc{qM;`{-XU)k0|wawuF
zkxEy#-bqB>t?=x~1*vJXl|OQny_cP?^k=^=k@oi~<cq8Pe@fx`@qA6;`TpFh@O*#p
z=tL2ct*#yNjiHR0AWkX4+4hqdI;hOx7ZC)JpTi!6UrHcx-gODCA8jc;C^8xR-PkAD
zdZZ>2=W9vPBV!YYGxmbFW1mEP4*mtdhaiafIrtZx$0VkUxh%NEfjHkC3oa41`PH2z
z_^9t(gWrrBOQYzCVxL5Q#zgRo34(09eEvwX?Jo9VrRQDP7d>XW=!4+WQt^DXflCRe
zewGd4H`8V2ZzXt0)N=v;h2PA_3l02c?32h(9^t>2Ac*)}{0sg!1VJ`F?86FY42Azy
z12^@U-@LOe7k;xmn0ok5pJdzpfPtHO%z9+%G0Q)%`C?b%Z0qMSiCfkw;Wu%<XAoS<
zA<vuoBRD1zH{)Q|QxlJn8N__oNmR#|sb3%GIiXd0hnV<AC}rSi>M|txOMa=#Jh@YI
z5SKQO&^HWR$||9Q2A;iohC&hTH1(XKdAKpZZIrwqE@PX>Kb?T4Zy0){?(@{k23{e|
z+){zw@ERmE%fPd(G|sl(usl_tO7^es>cOnM8*tp&-BSE_P&Lk5$~cEyF36rzcb82~
zSXsWcJ;e_Jcn_M~)Rk(2sR_rKUJQwWf!>bRfx*@Mf+dyYcM|K{Z%g7Uh4#+di~nS6
zp>MV}x(=T>Y;4D8FSzgR80_y)_H;~M&3xW$!}x^G*JZwUY2DD?-_^dlJ6RLOH#S{s
zZg0h>It9cRtRKXv?1h6p_@?K!NvCt6f9GGkTupr@zxWYRcPmGgPD0$y?n!+Cn6>Rc
ziD>Ow-!~ZrI&&u@l2<-4uJ;dA?v>^VOG;kw3Vyoij94Kl2~#1y{Me{(Bl(d)!B74C
zkKXi`ZawWiy#w9JWS@M)H_;b-*(8|-unFJSX2d7{1aKk+^37eJZhcsPQG0v%<(>U$
zoc$e~$oN%?^Od7wuL%i!Tk`hS4zxz8+%Kjk@fFoXWn;omr%+o`?W;p`2X0@lw*H5b
zM;BzMDehygywXv-Als<rHSoL?I2yvH7M$>#xZ=M-$!2i2nfNa=Zr9OTT${2NB4@hu
zuU^NP)<3Mtn$)_k0eyL{SJk$4O>e*d0pY?9e7@JyTh}?*-_8fc@lDJ>wI5G(*EHcj
zD%3=hFBCH0Ec_upRS10rH*37_vq{#EyVLB%fywMkQszQ*7KxdCL*g<1ILPc<^7P-M
zUp0}u*_R`KPG1ejJ0MS;G5nh(>)%R$`a+y!Iwd)Rhhf}hzeOvP=S`y9wto_YUH12D
z$2~1b`@Ao<?X%zNvcFx+@t(va+x}+)>_>EG*R;=mx@~_iFqi#(+Nj*uh!3{?-8kV&
z|2l17;>`53-*4Oh8Ju$2AJYc6>aA>S`#*ua%l>9Z`gwn0+voFfm;KEIL2-YR`L*r;
zC-_|U_iFq5wItKe`xV>%DhQkR8Dc1+Z<0<i<oP^-wn(x)4TW0yk9uIzKJEY6CWw98
z{|d+}U6%X~&Df^p=|3Uc|4zs$`<gGa(fU4{0sI}?ek=HBKW6bsP&R3t_IclB+aE^5
z<Fda~+n48qqTaUuA;`PzZ_=6K8TR>{$F{#Qp!|-qu>r|*MgJ&2{`~>vchq5@b<wuJ
zAL(?ZzlDtrs8Iet9T5L=eUod}U+&xX-xXkgv$mgoGOFCkD}QqW>_@cys4u4G8*_cD
zFf$<kcWC?KuU3<1|1AOeFJq0&^fN7@Pw?`9{NGum{jz}kU+0Lw>sy7O_TxfF`%wk|
zrQMJ%p98A$gM2V)RQo^Q1hH?|AI3rHvg9{w|2-|w`pdFt$8S9V+OO4ovUye8Um<|r
zl9wdgZ-I|Gb#+tc_~Rj8Ns><gDF3(%3=_$VzanoRKX8ol4Ul(@6%_x)u52aUa$HAw
z97sJ8T;vOl6+8{`vvpF(i#mRyPqsGioxXgZmHnZETE5OYVaIPH<dK9>ObqC)tY5uO
z8)W(6^H7nO`u7;*EfY#Zoi6{|aGpdpoRiF!Pu<>^?CM$5E29MqjTO9jp>Pzxer}x+
zv>1F~YNyeoKk_jm%2n5onu}qA*^2CGaICv*m&(atEbDfCr~DDEB&N5rF~YAP9`oNW
z;xTnL|A*z%B({OBIvX>YjD6cantWy7uCpRvsLn>TJT^J>T+UJUz_wq9Q?5F5K#NG-
zk~rCQW-!&&-Icmss!T*`L<HpT`@ak4`=e^>YifB4RD7M;Za5uNe#KCC3I1tT8V{b&
zD9x7IO!AJgF3Ic#6FmW|sqgDbb|g1;4X9`K{-d8J71U$?395?~I)Qgs7BcD9IFI>%
zv~@A2<?ZrJoaD0SpYeZ#>T-k0WbE7eg6gu!A8lPeVAwQwZTp4lva~Uj<G)>(F~?PV
ze}8+XG8d}L^XEnVN<E3X%=J)&VrnObd$|&SthF(2S&fpvz#Cp%?$sYjo#v%~=T+~*
zpxtTS(DO&Ul3f_V?2ox#6aK~MufunjHDj>n`xEIS7^Z&t;6@C=eS_K$@&{u}u^jG{
z0W3uPI}GbRv>0o-dP6^by)pf}q36rIky&GF;^Cgh)`a^;8*9ebgwJXWg`jfE5&SeB
zsqlvOOz|+P`{e}2f1esYYcq8w(zO_(T<(oOKKQDaUha>_w#FZmPx8p#=B)p_iK{bX
zrS8`g!xv$=Hb&O&X|Dc7JpEX6_0Pjw5|C8`>(x@U;cd&%jo~Qe>=4#RG0Yds`qp5@
zd4C;hFMZI%I=9h8$!}`DpQ!J~;@6+pjTn@w<pSg3#az{XO8A3(bIxJiLod9(Cfuvu
zp|0`5m(2Nk2#2b-RP(rwM?<)G#WzF0#^$DPR^aUOYr+H1MAn2~{V@)HhJ$bO;H5R;
zXI{p^Z+P%E9DEaJ_W^i{z|%PRPmw!-vydHlm1lP20L%66ni8-7#^9fuGEd^*S+G4#
zw*6rH9u9uZgIzd)T;JZGTl{_dk%=x|FMQYTLvN{hrDl}zjMjYr&}oVK1F4g*3jfPZ
zKMBRhA2~FZ7{+qHaV%CIi4QkoX<wA8Xfqc1jj$M=o>vUxTuN3IGF1*6!go)Fa*SEN
zoC}wuD2BIw8V!A7<ia2NrREok8Ce^L2N?CNGVNzRI5Oo&M5_*!H6bhO$GB#CG`!_v
zDDdD63dq!W`lWdF@8ZK#D&xb6$_k7o$L9enD*Ld5k1tkKu2aa+!x-YeqH;C{oMX8E
zV-@jTze8zZ5gWmfZJcTI;CF>r@)EbJypdC?xP$Li9vx!^*f4tNLVmemjs@p3=$^7U
zyyEdA+>2aUHtYE-(<`1wd3{~^dgbtnCysdI4+DJS$d#9_*n6aZPdtruBr0duJcS|n
zO*P}X{>0NyB}%^L4ZT(p-f|-v>?`*)e!H9@S~h&sw~-aQm!;KqPaGdj#7C|jN8#Xr
z`6J6Nz3Dp#21euf$OQh}iM5%BZ~E>*?nRcBo%tffUPL6G^R_+}-qMM|`5u<HuJTWh
zT=*guy@s|kF{1pt-fuDTdwhEMgR4~i;$qHF(uS7fMaslj5>_==ze=<vQH{?j?yU3@
zmv&=y;QJaY!wD>TA8W3EH5R^a57BiE;rkv*)Tb&v>^v6Ra%W{Yyp?TGQ{>g~)>pAZ
zMRf>598FJr=*8EW{`Av{lHarS`Fg{b*hDl}t5N+ZOi$H3Wyb&4;oj~i$M9SEB<o;m
z-xxP%qG~-ehJRFy-ZxM&zRQa7=9<QE?_+Bk!UOvv*nRa;{5-RV$74MG8|+c&_uqmL
zE32xxhj8#~9DIi?uR`T-aB!FhKfu9{!2UEEJk-yp!&`e1SAeLReP2W6d**A<_?_lZ
zqW-r`V^w&|p*O$~58w6m#`F`_&v_%uOJaxjl%(G74PUn38-GHTBQN|fmpvP={(W=$
z<`CkbB;)l@hPQkU!ivL8zc)M!l3#<+EC@ZVgoan_M*~c3#k1uCV)^cP{j-BlytI~T
zP<>Cu`2J0q4-;;F2~iH^LXKuz)|>vL?_lydB&p>6*M>?qRg}E_lxgMcFY_K*p0|CS
z4EC7!hh)q<hIZq0C;k)oC*8-EALGaK)>7S>v-W9O`w6baPn)LiENOI|Xut_I>iP4^
zitgvB5&HghlJ{0L&5FP=SLPTX9OhA3-V+_HZ9?I^9wg$SarW_Sa*ZV?Pnq%}mwO8i
z=akY@pHytIOZBcXrvm}_slexyGL=3_pZ8%L&Mak5(kGP{*j<T#m+wmg@CClOiV(HQ
zn6gy{&h}RDJqFIlC4w(CaFhQA17|)7|0gugJ~;mc|2qTcosZz(RQcjR_c8r^&A?5&
zVJZbN2TZ%~SG|>dJs&Y}GhJGZ(!(yP_!GfCiRZNo>bOPy`gk_?vHr4wYg0br8vBKL
z?&{RQAk5vm8l$#UZ@aZ8xv>?K%dSnWTXgY;nv4137h`8!<3ljN>_8GzLw9%e+?MQr
zcW)nG9%D*pJrlATfKlYQgF5N#$JaM4>`!tw`KI;jiygJFaP2^MS4UE&351;em`9C%
z$j)qQJ@t`0)sBHw4X5Z^+!C*8#XD_(NA6Q}Xpd?$9hsNC!_KOx(2dF!X6E9wbr_0i
zOzNd*AnqcwOz?a+{$20#Vycsq9mhx>+7Nl!-UW<4O_hR*eNs&QhC<Tr=)=6W;dY!*
zx-9wa`dO%_1!<pr+O5od2=9b(+SiZnH8<KI9jHhK@pq(clI=r)mH!rBRLe`dCZ|PC
zj{gsK=vPbtz1^?<->;A9Kidu4|DgCM9Py`0iMwohFQojp;wSSy+2z9apJtRUOJ3%k
znT_)#`p>I??f*@{T+bCbpP!3#STm=1EhiSuApVZX7kU=)3oUPnhXxsJ2if+yjwAl^
z-UV#Z@_Q{El74~5vE$1Bz50^rX-3A6uh&Ih;(9uaTcKAHt2CoLho|2RsV%R@nD(TK
zey&+t8`Y0Xihr)j_jN)swG%^mD8Uo}>PoU(&hZ=cgFL`}&5bW{hZhg+VQYIw2UevZ
zS~UHU_iBUsw5(&&r#16S%D8H))OU{w^-ZMYZ9tLD376};#IJy(BvUf{`3*&=%+bf>
zxiW)ac-hx8zw;5_R{)=5taUAIE&FbEdqQ1IkE@UQ=fGze-=|fP86?*~)&u@aA4mEr
zEPjlQ;4;37IDHgce4%|amQvRw&N!_oqPN7w7NH1#K=g&@gy!oV;^MP{Tzx3D%1m8;
z1(2m?)Wh%k<fe|K>K!>pG1oZcjRiQeOK&)5g~uv44*C3ES<c|yqwFA|-*lWNB1S+D
z+3{6DMzf-W&hcv|S%;y1oFrynf?}qSv2QeQ3e8+o4Ib{s^s&?neVA7Vc%C|A!l1X?
zSa3j69$8+QB+)1MqriB*uxXo4DDMMElxG^nf7vbrrqZwN;ZRYF-b($|hk5?TaYE^`
z<ag-fs1_9aw*SA!dD^ele6m@sci7IDq?47YYahZ%VmWmT$D6cJmEOum?91^z*m1>w
zpZ4F=jP##<Dv_7?e-4<dPqPEKi^P99M?Z;4oCM#YcMA1sz5za4Cq>`m0v){1`&eF|
zCZ^>j{nSa4^!rEt8gQ=o&DI$r>0<oY7K^;Z@7KVrqN7ybukDYiBR`F7cWwC%SU0S<
zKhvct_^!5Q;ev&eeOFs&6t0-^Cx)?(m<#Ekc1~~f@gI3lB$W9|-+sQvJd(bMY7f!x
zAQsi>6HFgEH?BSh8Ow66n!YI8CbJKr^aI<4f7-RF3xN5pyzoo;VL9Z#T;qfA2zW?5
zuZx*FHm}(tt4`!Te+XWngP&sf1rm=!)XQkBozoLftgdNl%6_KdKNs;=Jj(l`=vbBa
z4yIar*R=Mx_hgrJEBHyy<Q{aWkQ~bo?}Lmgl~GltgU&JQCRvA}FX1FH$$#OE$&R&U
znJ|fR6Up0p?XpN&SDUw2J1T7(%Qw?$w^<zl_FI6H3faE}JTChO9QIvp=03=~u36X7
zxP!FX%$YsdBNojd{*K5Ox@H{!yRDNNe#0LJ*}UWfmUqoMqGe;24vD|OW7u)U?}#=e
z>0<u5o?~##bx!-B70dnic705BuKeGS>|foB=0Porhf7zXF$qU=AAY}alM++@#PFT5
zKPI7J#d7bSmwEBxbZU5qTF3XNF}^PK5_nnLlHeQEEu*PR!qttHZQ<$!-VauPymB)n
z!quOuWctF@e^<FfZ9iMNQ*A$AIjXh~Rqn$!f%nT%^?o)n@=zt8uqE)Wad!M6W=50@
z>CVcEukz8ES9Up$@q}OnUf=4u^?XT6C_WEwYRhvN_-f4`ETJdQt2tcr6qAHklAN?}
zgg2a_uQHozMirj@>F!$Halr+la|iwe23rL^H@FZ9lWR4fOJ(O>YM5TNbo%zvp%d<%
z@{zKSy2>fIbI5hgz6~5D#x+~+k$JyGT#n6lJm?xf#~2r;e1(pm;=cm_HvJs{7yds2
z@P`8MbO8Rr0Q_SCcp?D*ByiIC_-A`9eU85+2x9xf7zzFeK@f3P0l~jT5Ja5!7lMDA
zAc*<Lf5Cr55JY~qO@jZ7Ac(xo6TuG?1d;z_{0q+eE)sFJbAq#BB@ySnt>6*tlc-;_
zsN-VauGHeIeAc_ZKJ<``=8wzqz2E(2DDRb!e)wSZR`9iLckkLzFP5_8wxb(OD|a@u
z5BSRrhc>LyJAOYd^9HBAr?bDe3zOX?Q+``43zy=1+1&4D@dfY_`Cjo4@|j}jJBX%P
zm;B&jE`MeONah3akE}cZxCH;q7rXBe1Lh*FHgk${6Uj@x6#=`BQkFVn!l1X?bfU)e
zG0Pw!)&Y|Am0ra@b=c1V8VQ0})=koIrYzowlde9^GGR1@$!i^7tFfqsi+rIzO}|4Y
zRlQ;x()w-q-+cMJKFyeB^t7C8Bz|)I&)9Lrf0NE=i8JHxdXB+%g>~B|`M#k=`@xN?
zPpSGcQh$o+)6Bbg()Z!=%?Evq@dv+|KFvzMS91X9AFfx^@D+Ag5@o7$p*tR24JGtN
z#wC&d<w0!F_rVx9c6TC)k-yV@ACAELGBb?@EP-*1m{J)19gKIBF3(q4#1m<M4rN~&
zT_p5>6z}ox|Fo~}x+D_v`$E|N6X*^V(-&g?WcxykrdMH>N!1;idhZD%MRbT<eWCN9
z((DWIdP(9nnz$TG8}$v1pH3!_*{-|#NPi0+^Err012Eoa+3hT#(7FJ;H30wD0DNTt
zepdkA7=W|;?(#DcfU{rZ;zxg6(fRl_`%drIINK-wOP}OkjkAek)e`(+12_9rPZ&7!
zO8CbN-0UO0X5h?Y;V)qs1JM`et>E&mf&Q3%C%(5Ok)P*;e~!k9@!6>0?=o<{2Nv8P
z@8#=Y`~;6+pG5syR2~0Ub*t8F?C-+dCdK!zveSs<TsA^$`UX>2?|FjGS7x#ZEO2?;
z*R|yM470BKK@5df>3iu{1kl@@SOeoR|Btp0_E!burCk7<BD)UV50qsorp{)6$_awx
z`9x43jC}z5Z}-9abVARd5`#3HDRXS^Tz#;#FdDMlwPDs7Vo{znNaPFk!QKrSTPM}X
zb45d?+O>I8K!N4;!9?D(6tK-PsTT*X_{VhlDbxr1D&$#*Z4!s%oe2GA858@W_aa&5
z!GFO~_+3cd{JP1$3)y5;keG5bhOsJv??My@fBt`YH^M$jqfWJI2lQBA4LLWiJ_i|H
zeFY!q)iIam;BcnVdPy6^vSPOrl-z;;nW`txqima%#Qx08)153X<&x!_#aXUBlf@&D
zB~i|-fAbaU<D!$0)Hz~C(aWEgP=9Bby|lEpc5G@_LsC212Qa|2qj&xKWRGK{sr5X;
zeA%N^U_!8fv90zcFHe+1I@A}~oq1O^o!(>Juy2<W7p-uo4&pA$fEjb1;@AOVQeKFW
zV(K^lM_)=ZC-@9<B6(Y{T^9Mxx~t8MX#b^cWB-WhwA(yB7j)Tg0ZuAp{}bSG*_ZoX
z(>}|+ZJ&K^m;E;2q(b&@0FTRlizEH4^|t*>fVr-@Yk<3mzM52n17h|ySL6#_bFb9$
zrcUmkU>nj5HarX*m|WsC7t*O2S7i`?N766whp^*{-#Q&XPcyRoun#ZtlCS>(OtWfE
zf77Pzk7|^Mv}4O(R6Bp3zTB!!p?5j+YA@Cwix)qpa+^_zV#=Rb=nO;+YyYS>C;A14
zTw@gnfAFP{9(L)4oA!9a>|cevKP%bIEvVpme0iED<cq3bnH9FHXYHTBo0Q_lJ@9^u
z-wCmuk~*Qnudzmza;#CSx8##DDj53!-TFMsT`}b91B^hh#2Bs4@+&l%z5!(>zgEOd
zF_qcQKqaVfRF+%7!8q8o1^niBKN6p3!H89IGVD^PSm(?&355R(ieHspB_sToD1P3}
z_$0CZOB~KHM#Tv~>o18(;J@@?M1$0C!6m80&F2VG9eJMDB;n_^l*H#3)G4^h50^8z
z$<Nf;{M2LK|Km^*b@1ONVrE|;q8aF?$#3?xOn%Scmsk<H$-sFH6zbDE)GujNkl7Eq
zAyHe`nOu+YDEPu>ZL72y$<}pv{nDN6x2Duh)Yco^gFVSjScxc=?98&;6H*tNU_!q&
zQZt{b{v5we(#CZMjx!n0_4|u?{^hgeJ5}gYq1>k&_VbOLXkj4k0=|zjoNQULVS_a-
zD7fa4E90%3XFhqd?g~?{O7HO-hI<wYmsyUaeC*eS=%3BPhm+P}s7GTtWe8Xd|1L7i
zCeKrjI)mi1Ee*Nz+bYUZXAJ))_31>(b%1>aLeic{AA<GCWxqu$v;DH$%8S6~vcE&y
z7dza#`k;5gxXXT<wlD3dKFn*YZ-=nU{)3M6yZWFv1lZqPr2Ulv_76JjyWU;R53s*O
z+n4KtKFmx1MFI9_>w;#+pY6Jx|2u&}MP3~sP7;3qDF65~IN^%FtV3$r=XFB#3H~%N
zm;DE|LE+bj8F@MW7Is|rJxBUkmqee~|G36<c8S{1sNNHPIbk3FFP(q(b4QUk`#sdb
zw31}|0q!Tpd$HM!{|tR2vzNOga)PF?Lo6zQ-imyod!S!wc}qNWn{7xl*f7VF;V<tV
zNS?cHwiMg(D}}Ht|Jro^ZPN10FFvCcdC5P%Z{RiDrZM28&3elXWo`M3Y8PHSnR}p`
zy6B{zJ8m}$R}4O|wVsZs$vx0PLRk3KK9;std?s5C{gIE>o~50&$7&Oo@n7othWnFd
zd?7}BzLqg@4LLWidk->B<{o1;_|4~!$~G|8X~_fZW{7te=JQA4*F{#9M`pS7iP`Rx
zc;0;eI9dJ(m4H~@b+J~*b?P^JZ=esc7>)X9-Rz^OPUKqjtk!n-u5RxhXkC-@d=U!?
zU||lxWNGj0#E0nkoZbGs-F{AK=nKu&{ZXxF!`#*zZdg`>vE?0`HsMYEh8iq!vNUn^
zqJ~6k>#|m^%b`7K+R#)J#qcJ5Sg2cScSJL3K8BqiK-Q?L8BIHM1M_kQ@psHTAi`t*
z+kK`OFc(Sw%Q@bwOe8PmO!)1xc|A^0XG|FMR_=S{8o}!@(<$wWw57aOx$L)SJ%#ME
zf90|t)A2LyyZVADZQss=Hf=wmx3Urc<#;J}T-Vag!eDKgR+Fl6Kur9UbDQ-}p=;@v
z!Ds8FDDN>`WW!H^30U5>G@=<jONpKSZ{oZw{-RLQ#r${m1z!NJvnt1u%=7wyM(Gai
zh<zzPd}pzC5GxSrPnrrnPduLU)n(^zYx(fBnpd`rhPVD3T;y;nW9jj&fIkbk@x!;3
zG#q}kbnuLtR~k0IQIfj-t6v1HA4Xy}utPTv-!{d<8tZ=(-f}P4KD@Z(fzrY9npZ9>
z8Ju_MiiB?<F>)@>g-)5WZE;B=J)TJa^dOIY=9kEvI+Zq4A8$+#OnGc^N$Hmv$XxdZ
z--emu)cVJI;pUrVf%QYvG^ZXOu6@mYjJi^-t^C-u5=-lX7!nMVHhy00@S{_({&r4?
z2C*17R$$Irmh%BF_(m-qm+e{1A`;Su?PMMo!~RnbRpRi~{rd*H`g0el(O3ja+o<O-
zk^Uss#2V<@kc@Qobfvo5ySv`6*89NtF}*f)B-I-cF||Zh?kQaPlK40(;-50@>od9R
ztNVM~JJlOJlT|%Y`D1_R%)S`O?z?%wr0+JB<rjT7YhJ2`>9L_{_f8!-;UiN%TK1vR
z(ns8rPsKu25MPIX(jb4JOV&1qoTnByR%=a1)cjc=ClBa${^ar|OkSRzh+KWf-y$s~
zXchTRi1c=U6XM#g#FP41@Ln7f7m|3f0VOWS3xxq&SD*9;TEC=??-WTt(fDR{lzsls
zL)ZLRPiubOkCWI(6$*ZSev+`{Y+Y+G{|X#tA6ex+us_FtMUJ$8upt0%4#0!P?VW~n
zN&m$(^EDipeQ;HNfUyta@~2ku^Q=#*3}N>j`k2=}=BD)7=V+Xb82defv;32Y(~jWm
zyOC_1=^{}-`&Yuhl_1Er%XhjY>ftkX;eUuA$mZYW!-}7IF8n{#IQjW6_)iVoyhnM(
zz-e3fU)4CVQw{w08mDgd<%FO2^CX*}X(!qK%X<X!n{lpG-1+?MqmjsOrkC%MNz`w~
z`8^8t`A@^X_<4=S$<Kem`A(Ze%#2TmLVcX2Nce9x@NxrxpT_Mt$h{!-o8?WO^VxA=
z8%eVH-|fSBakxU`<TvB6*x)zgu+reCjHHY2#Yn`=IILA@ejNB5oJ4-MDxznQAjpnG
zM4>*vE;0(~HgNMk>V5;47%IrW$Cc&kxF}_7_Off-`eLccuG^B`x9fK$y4SF}x8E3E
zlcQy0dzWLtjsHf5tK?yk%gicysy~3Y6<p2I0u|(*ZG?B{bDe%kZ=#_8y4U0LWj_vL
zvgCt?ywN*z{e|=<xGS%zU8)`rEXSIpT^(5PG}>BIlTcqkHFMq0rlz{C9xPbe(~-o>
zoug7W&sVn?`E^};f389m<GGxNj(7QU7s$?h*)d1b`aH+|!=`gkC|T}ps?(Ru*(~S=
znPr$TkNIzwVd63VIEeMbr2oXhMDlX|6&c(9k8pxIW5S@fo3ul6PsjF`>15kQl6$!?
zVc%tci8dtlS_x@h+2@w;y<PSX=u5DSk)eHFKWzKw0CU+_v-0AcT)(la$WH$|fx7G;
z)P_v^bjh|q4+@FdWnjL}_bO#I`(x+d2Mfr{y|`$w<xhkiriuL)lf*usHJBvnmu)Lf
zx}JsnQu}Ypa$n>GZ`7FWr^pw27V-}coz!hU3+J(rZU1Bd_>)H$!j_RA%^?1c<e$K-
zAFli#(-#j<GqU`#-y!l+{x5*MD^x8yqhwq)*qn32@L7m{Q9r=PA%&iW%v(@9>GukI
zbzNdoV*J7HY(&i)W{tuow42*d%lLP59}_4v`_qyUs5?kBb9n6X*%$Z{jYt;iz8!bu
zsloo9WM?Qd8lV8*pTZI&a_?u~JM(@)?w#e%k(ksmmPHxA#rj9$dBIk3A7si(f60{H
zthlnW^hfS5MOL!}Zd~`sWOm)d`qv8Ofzl^^bf4cSr0T5y6MRpa@8O@Jl9k|YNc2|a
z=;71Md@575+J$HRl(SvfF~4CG4_*eY;xCMP+Y5ipxqL)pC2-fh>W7v7Y#c=AT!rff
z3HxIA8SD!Wb~Dth><X8Ef5?-|@ISLO8wZhP|9@sFTQ{FX@?jhbkDTLHu65^QpR&@2
zmp%;JL-GhN7TF~7{zY)zM5?i5rXKE-c%HJtZ`x%n1vl+7dV&{Y*VJR$HSZZsyXHMn
z1hz;_FG8N7`Ff8y|ApjQLQK-mbMj1pxN4CJg8KZ8(jjRiw8g;XdPFGr-p6<ocLPUX
z@lBjD`pO!g#*tU#$h5V2=j(${)y$`8w(-uBt%>HG^j|#&ez@S@NBNIM4Ue&2Ij@`<
zH{@!d@vMc+3HPm4vA0520BbNCc(Q+eR}a=Zml0>l?sj#Li8q-DAf|%II-yzqK(`>F
zS`<Dhqq=CQO_eS*pEe68&RB<`Pif37V^k31kAuvz%hMhBr_LaGX-~*YvfC6sL!izW
z{!OyK>*q61rc=ti^ufAd+-1K-E0cCtbldhjA?&g*^HM~$Anm*EL0BJM_WQJ)ZO=Zw
z8+<PNqXa>weYS6Q`m2Ds>~986Dir^7z~iz%rtM3dnSNe{Z2L=L++}||cu9rgzX-xE
z`{lYZG}F(t*!DeOF8e!a98}?NGQalmVw`c=uXEVvHO02ia__P~3Y=6Z{*-muU#IPx
z@ps*WY=;8su<rrCPUE0!{7vSUyd>FvhWn1OWoHV5;?Dlq@ZV@%l25`Z@`dgJ`5ld|
zlRD%cUi8V<=6#zlpLY*9su>>;LA{my6PWJ~T=Czm<1g|o|GfT-yyOeV==0iblYE~e
zeLcG4D!&)i*306GMSfp1`LShQwp*#&*%;D-d%&&ZgC)DOvwYgeHKV(8l2z!u&2Jy)
zYU8W)-G2(VYMJ+R6Wyz+{^Qcz?`lk}QAe^&Z`ls5()%V~w}Wr91Cx6-Q=gPoUG$aT
z@=i$jw5q_(WbWyx#Py!h$EBv^nsTkr<MZ1sr7u^e?lN+9`25nt&plVB?lN+*IXE=m
zOR9JSW1Q^k0VP}TZ@xDae!ed=za5sC{vU;B(<}U((`u$Mvy<@Or}(q!6?_i)OGP@{
zulomuXVXi+NgWF3U6oIwM?7J>Mk{hpG+8|2t5xlr*d$cUJ&yQ7e)ArOJ_+^d9k!pk
zxmCy(12_AX_Zzs;q=i0f;F3l{qXwS6g9aGziH*_GS9cg)Jstf?epB6=nVP<}Ke?u(
zcaWc1+uWVWiMRuAa?}eR|Bhy`r=xvv?K;C823Fc;@H9+)uZ=0+*0=ZHo^{P1$*Esm
zVGK(@9iNyh-=HY5#$$2_W-`?z6Z9|cZXX!H%yu;wx328j*oD_=nNw~BwYX{O8n}9}
zKf^a^6&wbN&wXqK4i_f9vXL$(N54S<Hp{yxl0KyL0R%Ve5;69XiJ4`cc#J;|GV2ge
zpNap8<g+b`ugq@q*ten1n14F+Ykway3ul;4sbkUyx)PYnKHE`JA^T0>aoLaRgo+*7
zXFFlr|1L0>{WjnvJ8$gt|0{T0^3pyP@}KRG%YXa(68cZyZU5g0u)i5NsgVEog2(0m
zb|qa{o_%$f{Ei~!cLd1q)biAAk{$n>1LQ}wP@(kS2|m|7%x=@Dv2XjsdAW#14Ib`_
ze4%@o=e7Tqcxbh4NHf^*VP8J)9!B23?z0q2`4RY+kav~8HeG-AYetqoKHC&|saNG_
zzwnnwGDpM#?JzfdwQb8^G_R&+GT+C{uU|On_gGcg?vHM#{5b*|u5Y*wYc2g6YqWYp
zm#ZYC^sIw7Hr&$C`Vyh=7gYBGGd>TRLr^!@g;Mjr$|xKpm$!8^btRT@PNbt=dKIQv
zR_gpy!&oo(YUr)289j6Xc!t$EJ<L|Iq<1}t6;{W$K0bJI0|wU~`bTxBe30R}iVwq!
zw`>HXuh+Ms^>`z^!_>|g)?Zo*ex3oz_dllTt)qjbtHg**mf*985FHUw78AqK=B<ZQ
z=XvSfYR&BU@DfZ)T^1j{tGr?SbXlG{F+2}kgFiN7@E9VbMjhWG^@1k;Q2GZ_otIpa
znNpXZo1k}vC$3f1G77h=C!!w&ufrKE%!r;;SE{PoPq;3!s$T0*<ZR0Ik!*8Lng@TP
z-%r&c4eS??R2{I^lD%G*l5LtEDZN7u{B>nnBUUL%%q_+(#?h{tUXI^Ts1k=MeQqVU
z&@1C{KT=xStj5?bnqE%6PZhzZS)7~6+>5>i8D3)C`(0{i48BLrxhu#>xW=~f<ng!{
z_4Q=mw`Ghf{q~j7KU=0+ZIjcVJJY<URe1~+KF^NivZ^CiewTKRX?Edn2H>9$z`sk}
zaS{1`fZZJddPV~97XtMEDu7?^ikZXQ|2-RL(An50@zQ9%k5uIx7?WVWN1TUa5^-Mp
z<X)Qfi$p!lO~IEE1QBOk1;3dfh<eO>^3@8>*CS(>$j>%P^laArHojHkw9ESm;eWv3
zH`Ddc2EX~flb^VdsE0O0&n|)>Vmv4KUV<Rvynhk=34$Qv=9u7T6zc0>e?<6MPDtc8
z{X9SrM4RUOS00ndZ^lQSsu1TzU-U~EryRc#7W^I9Cy}51Ou;J&g2>PNBf;q#iTq|h
z$~^-4&GI16<%zRh6+QpAy{iwd>!|L}PXQdr_(P<PA$&Y5Hc=oXlD}d%p?Oa1@E*v-
zZBkdw2a>R4Ta7GfWZAI?3LX*@zdE62nxQVxpc$Y|nU;789o%UKOl?S72na}mOUs}?
zlE!I1FeOdgA)ub$-gEAryZ7vSPq72Z3}>Ww?>&3Y`R$(FyLaz?-PLpsf*oD1u5#Q2
zSKIk@;Udl;y3I20aV0Q`5PyUT-M}Z{<6meepMVEn2u<(__^y#A0lMQO=#9v(4jtP*
z+|y6r$f6F3V7$5R?A0|;S=Tq*w|QX9_~2lCIcnz;t$O7WeBvk=$PW8#sK>^)P<WU+
zX|B*kGplKnk#L?xdmXw$+z7ZfyY>>=g9eF_$+qv@&`8j*(lfYqbSSs3R^~k4G_Z@C
zVVsC$hBPG?E1ohuS!)%{I_~M|-!{VI^2ukL(kaNB#s&roTWQAh$i{SfG<EoFqy2FP
zHx1^u&22oVc$F&_Jrrx%UM9crxK0^ao|G!;f=f1(NwaF4hWVS(n-N-PXA)alaJB<8
zrcd+kzpZqGp?(W#0V*G&xj~@5rxA|l1$ZyCkLqg;^rihmVveM~mg{@z1ocK)7<}yJ
z2u*Q>QC}e`cqV|P{<@jYt@wAaUb~a_KOz1Y1zGqj8A$3k;GrH1@h>Buh2P8gt}RV6
zLLvSo6ky>WH1P4P2=U=23;%GF_z<)3+qns?(+^gNe>NEaFDPb(-$KPt#L-ADjO$Ay
z`ZC8}@WeoP-9|VTzUU)un!;;D9C4KAxyXvXe&0Ztq(_cN2p{KR`nx&(B`7Hh<NpT{
z{hdwfuO~Sx|0X#9<UYX>Wl!*hzmM@5E{*8{W{A85gx9~I0IQE~A~eVb#BXBni_oY4
z4q@<7^c(fj{Rt_DHeurOFhkgGDEmO7pX;M5v;JY$lS7#P`$^yO{~`8&FDt^|XrGF{
z`2Y3fC(~72P^BCp-sma|_0e9?-x6&!*L?YkneUxFDKA}wU#5TjzLC6+KDyQTeo3|V
zP=)r~eD1$SH+0Q9KK6T++Bd7UXREd8O6|VmkgwK`uG{m}`0T4|AGq-3x>--I+cQ1>
zrpliG7=PWm+M}E1zWG)N(MLpnGX4E^v;Ma_{hjSU>#9v%znT}qA8|%3yz7CtLF28S
z{w_NFmROJ_K%SdGt_kp-Xj$9&hym(imi)N%UQ7LMd;WF2RHZMVP>0(Bhy8H1_WY*(
zUA4y$|7TqMWhFoLRUTm*hQEIG@kf5GBL^+7)_zdg^S$x6ch!zmYu~Qco~hP;u?cjM
z$`9Jfz$J-u<td*fl%_O2aLDD(5f3K$?(z%$kr$A&tIz$YddF4M)w%Z^t<JhHV}BaP
ze^Q<P_V%A;Ea&~*L5AV)b_X+Etvy(M?muC+GWVW;A+vMeT&D8l>^<h}8UCkvF5|;$
zvk3GpKlj6~J1#qC+iEh4RIDODtlKwyk`wUMczajv(Fzi<mJ{#|?VsnSzh9m8banax
zl-Fs2yb&GLH$IL;NY=Xq0e>Wm-&H$fk;LI090$soY#bKl<KX&usaH3PzmJS%HjtQ}
z(h&guc8_1V<;ew9ZYkTV7d(Wba9y?b9dx<x8(MU-T6?-{?mf>|XFUwJybGUK<j)q;
zeZ0bb+^1Um5oK+KJVSYKq&n*;mH*Y#KcL&YLJs+#u6?A^MYiTW@tPxRJD+{x6$z*I
z6Z%*XMRP%#<2SCJo`Qp<Lz}z0lh+uk+%T<KdWW$`170QQHLJ9BVC%>jb*Q|=yK<xR
zjL>#`0}@U&f}f->_lh~C<oiFjyi&gXQ|zA8?$`^Q2zA-wc?ta+phx8TZsYnlTKdaK
z?^8~@P*{ays!!iyBnbHw;~=gmP7LmFrN8He;I1Snv>QR|@RQ<(>3)AU+9V3y^{o4c
zb#;qtLuI7*cGj(CbhGK*6{NR|WRJ3*OYc<;_r18*+V^7Zk#BtKfp34O0DEWiLw`Hs
z(b!(MW$y~MhceL5_FR7E?X8)!KC>^!<~g$y<<$uINKv-zFynnT*+0tm(RYP$103qn
zO#1j?C*GGo+k~0<d^5D3@?^~`gH(&zdk#K&RrA!6-sL{*HaeZ<T73zx-3O5!v<9<;
zzDC{m@9G5Nok3;K>Vy9r@%4N*S2juhsIwzIi+pbrZ`jFue~SDUoIH0J(7C%O>G+q9
zFFmh?g1g^{_XPc01>oPEy!W%a$B4Js;rd3T;JzMqxLna`N?&#I9>Lus6uQ^(z5k`|
zT1$M(&Rf_bn$o(@^(MvFeZ8YI<e#hLbszSH5q_GV6pr@4^ci<V<X1=dNDm0ELzxjf
zl2Zsr+=O4Ea}eaoRVnrI8TdLICKR7vgB<6W;!7OBTEIqOL-+MwtN6Nq33J;)koTpu
zP{6ws2z*~k$v#I82Y#)BSV87ugYQc(*-`T16Q`j2o?TBXH!f)6V1M5XdYPB3h<{tf
z=r#`bP~=|Uus0czL0_RvwM%2TaihsKnbc!DynU3rY>jz<J=YEQ#U|3JDT^*H)ctFG
z9<BcV5>}$9`9`}oSRwrmA`(byOX{g1@U(6TehrmBUEW=pp`R1D$%v-7d?r`fdkMTP
z^bZkT*1<31#~^(VAvo5TS7u$QKln0N2Ll^6%Ob$XDZV+Ro_PcDkxseCP#1x)rp$`}
z!6Z1HAHbJ6{7;awg+GsPLcsyP)tCAe;#>IAm+RW70#3(y>Kvz-S7qssf=MLLo#ZO7
zk9pTt{M(KA!*`+o?k1jve}eJlxf;X&^N4<#>oa-&#`Hf*0apCWM*P7F<Ny5#{siO8
z^E`%+y)Mo4vwkE0W6h5h|89=IF286^gz^8U2)^uxFYSm}{4oc@!ryE74`naJ$G#u*
zm%IN@aHS&cl^8zyGA;ZG10SuR5FhOw3t!eeq79@eynhx_poM?P@c-E)8{&VLz=0q3
zrGFYmiQ1Dx`U_c*9B;<Cv1aW))_20{NA!d>41M~Saw2@uZ`7BJ@1TY@VPlhS)QC|!
zhO!vTpub#SvaI<##`l4k5dX>b3R1TGf1Le4n*mXOqU|jDQm<Z5;Q@p*U1mYKk735T
ze_UVk;Mn-~z9F}ZYoos8&Xr4fja&2Igt}WjV9QDDC@y|KbeZND^aZWoJ~mL=k;JXE
ziP|;egCoNw?87zCzp${zH6!}t0)>})7g755SZ^(wyMO838~3f0ap5^vMt-b!@e;|-
zQmt?7nIvTG^YIx9guKWt6k$4A@9wAr^t-IoJ$s06y{oNv^8Q8>dAapbuJJGLG<-|A
z`vvb1!q@UR7k*5>L^2@Q=G)6%FLS>MUlrMOU-js^pGf0=lnQVU7vOxOHfaa<dja#?
zj?Hdt@M7&r0GFVRlJN)o={Q$B|IF8N&^`qZ*Z6;-ZDhP#*VC7BLt>6_uV^}-F049M
z#@Xb)LN5l=8P>7yBA$hh@(XH&zm{Yy{JrcyjgPw_#Q!_u0Y7}k_7D$rd2&d9Aq$ct
z{9!#~?{ZT4AJLN#+-u-TJcTd%jh?ZaSYPzy_>K^W148!u6aCyXw#<TMF~~>ppRjk(
ziRJ%8hW}A#h`u~yKS?|m6_f6`oAHk^7ndmGq5j27<(ZkRtZ4L%UD2^}#%n5O<KfO!
zcE@tze9E;W!sO%Q!8Lz$F%@eRE+1*Ey(&>TUGi>?z<?}DEVxU2k=9@()5;LoH#XL{
z%WZ%&G%&n*d`pnFm*nM3yj6lWKB!)sMD9=2D^e%OQyjcCFhC^t0eIbx<NFH18)BZ8
z+s!<Ac0=w?=4p((nWuH{HFPHfU8L`kK$kD02dgaw;TBh`<keboPr5?kFQ@{UmCj(x
zJ~LWUPi1Xc;~gKM2NdkcGv~ERCBCLXRSp?>csEPi*nS(c1qYWi83#$^^Wz<V%=SCk
zKKjswT9ki;ca%=_UTsqLFo&kKh*~`%DH{m4+M1UVzqROFAX09yUaz$%SH670udPMj
z!z>cm<3_LRmvUOAbj>fmE{P2Nw(}Xr=vs^3{}RtToPF<qv44)Uk2n2<#QtlX{d0w#
z+F#}D%U$c^|6Y=8EqecpeY}s(FUm}LAJ2o1|K^<iWbZoyXM%r0pQC>(UpBb-=jE}c
z#PZw8h@H<w?0nhr^Zvmz*ox0B5j(_ogc5|jmUjk;Il05#-NJ81UcZxQI}6AbcPG=m
zn@~Mm<hkH#JLm(Li5=X#Vn<3E@Uf;u2yp{}?@Mo?Py&+(eDpgAHDkw@uB;t-kA$se
z?D$;H+VQ2mIXk+JDRDxOE`N7;`^a~M2`%Fj@bNEH;S=yAkHES?@#S6zYgF-lEj05z
z0P!vW0<N!}3WdX95`iye1lJGZhX{N>O3MpVneS^SV$iVIP;OZ4-PlSn(;QoN^OnAG
zjC-jep6lL2a;wr7TU2C8ht+tCim!6gm;fXqG-W>*p=8}hGMt5A9}gGeRBT`$?vadD
zB-f1F>dC5+j2j3&jk60jBiu>ua{(%<DbL1QlZJZ$&$D%|G;|y<n{|1IcI2`*<5erz
zj=>sBR3*R#2g`2iji0);802so3Z&H=*KWu~ol9k2&U-qyE++9tUd2ulBc#1EF>Rm9
z{I>i_m(8zWZ+p6{3)fL4rRyp1K%-oV+!+MwIuLR@sR98{*InS3@nev0nI(Z=p+i0W
z5Ko>DVj6R&EdBK?pzB(&LjAd<k2sYPsHhtcZ6bLNzJ<;qC+#KSFDIUb-%EUu$R}5M
z{0<7R@J9`N_*m=-KE@L*{80vMl>R43*}~sz-~&6v$Fsx2-_7_U&zCv>BizEDFz`_%
z#h#@9vPk;(GoZASWB8Xu(tpUn$MZA9e{ZDxO)y|1|Nl{>{7oA8cpiuNw-L|s|3StV
zdA`i~|HBku`Tw|qKaXU^p7?)$#Q%pGu#x}IiuhlE1PAvY+I=DZ(un^j8NZSLFN*ko
z0Rw4#v@b*aZsJ+~pJIHG=gXY`ub}|T{~ZQC+NEMo;<bnBXW%ap06re)<5dA4vLHEL
z#`-}uUyykg?TL8$EBL~=gcPm#S6HyZg2+F-M~J?}|CgM9A$~VUuw8)oDEh+wzexV=
zXTb^!0v~V5qA&R0jNtEX68{?!{9^__-hV>;&qVO=ZW8~l2!83zB;h*!c#9A5Zv(zD
z&ORvxBr%izhU^b={5w*K<V5rvjR8E)`hj|3g!mSP_-{|jZ*B}g7$*ZGl73;gN6POO
z_MeQiqx>wQf6<rn^FGqIqPm3(w9NNFyzzb=>R(JB{FuqUN|!8Mwk(lvew=+26*p7a
z9m|DIssY@-K6|F!HoTR&Ykyp+{rEV7>AR=2Y-;<3v`{0n2FL|sK~?MYq{!m(F;eKN
zok*6OsGWntF@Rt9HP$FyLn~e8^;h<tvACU5TES8lS_<P`aLX^xT>TYfQrFxopRL??
z2J)Q59>Y47+7A;CU}+8c=kjXpG21`qk$+g#eE~L99e?PFV&`Fs#aT%#F6~-0d;6=&
zfAf;Pq#O+I=>vSGQ}th^_Hf2T=7KQ7>s0<_IyQm4L*E!k)`zHljINe_jBtCbaZ<jY
z6ufSOH)Qa38@xLW-rWXI#wMhl0^CVM?va4kLDy2ZeF0&~x*1xVvxXMyobl0?KPwhL
zF{ebybpdXb5Nuz_6{yB58$6k>t>rMM5~O(_FnIf!hua7Q+|L?vhXNkjSKkVBp<j>U
zV=xlSthO~j1rjs)4oxDjd(Aw?Oujdh*wG_3+K%p>)ckY&g*t1=^wRo(mh=m@o`<uR
z^oyq<-}m+Fke0$ieVLxO6wXV}^+`)%vA#^tTWIvzqL%clK0b6CJy_d{{2(Q^%z1s3
z_$X5$q3Brr^%T%n^yNX$KJV=Fiw@}uA7dMB#WPd$!beKmivEp8_*0SiY;f|voQV9b
z4%d&M2_Jn4ZAIS;FZ>;j@5_nsF?QHi^yNhOXnVC4eK~RU1KGg4rsW@u@mTz49Io&E
z7yJ13TwBqPISC(oTeqn(B;kM5@qM`x{>PpDh4h<{@J~2-U#_GcxySJri+Gw}Unfpm
z(U&W+gZ)t2iWj8vVh8mM=nVSDJC%%u$k-$J@SgC?bPfvTDLRh8M=pqbGkkc}lE?GP
z;=|jggO6OW>}dX#Bm+XakP9N;2PRSIpARPNoc!k%e-WLF9qpgC8S>E%x9r6H)~@6c
zZxD`}uj3Qrzm0SRSKHD263Kw5*ro5+xUS%b2z>kt-M}Z{wFr}rqlzzBVBM<tQpUkL
zp!l!ka~$-Tkgw&kV?wi){DXXs`1sl{J0_&ZmY!GgzE-5UAM8-r(PK_)6yMj1)Xq|T
zJ?1o|_`bF*6y)6;_I15=r;_)zXrUnQ(va6<hxaOZU%OKKOYx<ya7lGveroV>t^6oi
zvYad!$I#<KQ2Bifk<m;~x9@v)=Xtjtt!_B!(^y9*Z7a2TxMxS-P|tW>aa!Is1M%UT
zx6VYmZ${ELZ><+oTAo%f7=8<)mK}G5=j#gO(-s&YgfKmU1VPl7phV>25R77tj%*v;
zNt>k6&S;c_SpbS+mVs1<EJPwJg_V7@nf`d+#+!OJZn>#vQ{P~I&$ncBDjlrSyR+eo
z%j13TqtU5dTX8%c^d#MYx}Fo8qg)w0j~i4G--apYGCBiK*Kr6e<HsOfcOrNz*{`QB
z?MpGG>lW~^#uPToxKOl`D@&>8J17k4l)6>=irz)w7XAd=(sepmAwJeNTll*fUvPjA
zTOs~uBk4Z~Frr5IpN^#efPs(aO^6@+j@w~?6E(u`kEH*gfe%)QkN#K7|C0bGYJ?B}
zTK>P^z{m42#9vQ53xA6Epho!bCK(HV%D~4h72-=@ZFv8j060-2{9Td!KWX6Oc^%?k
zOgt<7j@bnMTS>-B|2%G#=<;v%wT?#c=OI!=jnaP;$yoU920q#oVfsH7x&KN{;@=+e
zf7!st`$&lYZ-is{U)pQ(o=B>W=E(^kzfQ_l`nwswm*qO>i1()u|7qe`_)}mKHS+)C
zBxB(pGSY92HDRpJ!ava@{sj^LPa62vSX1m99P(1oDE*iNYNh|Ufp3j9?InFH{qrbY
zphozZGil+wO_E7p-+y?Y4D)|K@htpOllc2c-@;#j%9cpuFQn@b|Gx>`!tY>wk$1-E
zCoKPulCp*0Vc_GvS?o!?{x*VNZZiGoL$&ZL2L56L|Et8a(!ah*eC!);;rAN&=#2@}
ze-`0b_`OZ~|5YSs;qNr?FEH?{z&FM^(XO)yan*DMU4V!BO_S(<S~KZf^yT<9;0H3e
ze3jKGR{EmyaH2mNMt3&rPX)%s|Dyk0QndWHpZzELNZ&>DFZxn`pCSDa8@7+bDA9U8
zA{y57=i;T8ES<?%=c?tMGhS1?MIuXaDAPZFmy*}%`!PTFYm_ScJ~aEp^wlSKomsi%
zzT?LsMgyAH;{n6ejJ%~M`jvg}oP9(t=-7<CUpIce^fVLy-{@0D2jxhLz^VFA?EL2V
zB6;9tI>wFa4t?LCx8jHP1h}QxKW8?bB5WmiL~eeV3mbA_Xxm)tLVUXq@>`f^*}9d(
zEL#&CCT&RA`cgz5VUu;jo~#ol^KrsBz~&-;{#jw=NEm!~LnMr&5j~u~v1jB~o~(6#
zkczM8)4l56-b-mr`nBY1y&lVzGm7d_YCFtVV~Xt@ePoTipZF9}S*HM$;gGP`cdHuf
zb!CBsFt*oP^rIkBPLDah_rJtvhl`J2u_W=qd_%qdPwZpdLa$>J`(JeOK3_zBwd4Cy
z4dJ7W*Q&;Vh2Q7W<wq%m|3=66W5B{ko3vGp0So^Q$M<8p!f$u!#amlKlHQMz{rSa(
z!cNy0UhU-1%kj^ogwHQ7&hhVZ@^~vqNbEo4?4z}w<^R(0-zMx77w-U8`AOCh=JWBd
z$bu#RH<5DK6_F3uFG@N2$B4Y!w^Ger5c%JY;Jzu6uAe&l`E;SrLa$F1`&%ONV-fie
zN91ph$jco>(RFK$WqeQW6v}3IU&>f1#%n>~qfbuwGqocnDzt<56i|q(?c?q^9r0|&
z&Z)!`wLznJ{>DCXyO7Ra3iJI`{PSYx@5|A?JY%UkaQlQg=hF|`TOjaT-C6Qe;&br*
z)5<@q!PjHz+79O82$lE*@_r^$)()PzLfVd;Bdo*%_2Lt=<DZhJW=F4+K9%_R8CT84
zC+25)Uw~_Ld}4l%*^xT`RPE^X-?8`zAI}}+r4Yu1LEz(GsGCo~qozbkLwp84>JFj3
zd;<O}gh|KGD!v{!JEZvXtO4sm#rIEb+Ba75&*XC)&f>%X_tlEuuK3(N=R)-y8hKVA
zpjXNJ)+PnWx@}nj?UroQ_w>dGw+{3SjE#+q$?9qMg*$xq3?iLFBbx^|W(AVf$}0wk
zX^P1pcG=myee1yRxL+sTxol*|z}Tjtk((1m6|#K$aDOCdN&m>!zQN&~%93RB9>veE
zOwJ@k!F7)H4R7Z3nQOK)3G|A7A+YClE*aTA-ZQeP$Jtc;yeHBn)j3c2kenxcP}UQQ
zpYep}FU=<32V|13*eX-~^6(&i5YIU}pHyq@b}rSXP|g9SRMr=^NX9LuNZ=t;CgUty
zLi^2>$QBVNl1%t=^Stt_$2)TlEnF1cMlfb0xZ60_46xASamkF=>xgO3$HlVVkIU&C
zs3WCvA+k(Aoyrtjcb_fmxwZGMian*DH_^jGKX1g?N^T5Yq#rI6sGnt!-9^ga>1Pf2
zW&9YVpJ512zL6c*m-j?5CG9)8M*kXYmW9Db+4s1@*XTDuI^`KBZLU?3_>U?*K6Qr>
ze;Mgp_>=q)>{WK)$`Btt2A2O0vR>f+Tp!Z+BKn6}zmfkQAUP}k9sID?{zKfu`2UO=
z0#^J_FuwHH@MSLkPm{idzmxHMl^wJ<LVR3X_%cVNk^lZa68|!c5;cnd-I4eoGvbeS
zP8k17Blx?U#9tA?U&)QCUL=AD>9FQFO-Aq!H;Iq+$X5OxFz~H8PS;27KWQ8{^8bd&
z{ddy9x8^vV6TvT2x<HNaTO;`0{F2t|tR!~uJ{{)&`y&3|-6Z~v5&s`D@U1ycZap={
zE3Cf{H;Mn@2>t@@D%R<@<~V(s3J;1JxiLd08NWTl_5Ks~Kajpv{&q5cg$0q1)*Pq7
z2!4qp)Cj*nf`8b+$NOiP|K~>VD^246b_9PmKd5y2tvOD&5{~76`R+iY^nZx-DGG%$
z{cBop;4dVBF#T6V(tn`I^uHsL{sRX7c?SOT5&XkV;y)L`pEB?l8~7iK;2&=i|Mm!e
zJ1Scuo&V?4b?E>53CGI+d1M#VDF2U;K19n9Ry1nhTXUR#8o^)LB>s~T{6hvl+FD`y
zzX*I|j#V$?t0cKo_)62~IsP4*N#~;9XpYq}!U=7{)O3^hPbK=fIabmsv@<X+>6hqY
zE)<~3!jNNYa<Y>3QGX(hqA%^|w@?F%t7_47$DRB@na2$<n870{)W3M?su|6(TE3)X
z#(PR1P#scb7rQd86Kr}<=}K&mXv~p04ttR~G~u4qem>U`7Yj9g%U#dZo>QvxlWsn}
zv2WYB-->#C*XY1te;vIU2fa+^qM(YFzGb;hz>|Af-W|YO!%mT+1fKNSiX85VA(nHu
zkDI^JmCj$;%VBa4z{aPTr|lkOp0<0Gd6wNN4ime4X&&NpKu`<h$=U-NQZw1>Ig#fV
zA`L+mhu%wCk88Y`-?mKFl`Kfdhma3K*51wAC{T~dOIi6-I+@Ad&G$JwzNIaBj=2Ey
z)gH&~9GUB!yw6oB54RCt$C<?oSbwVLdT<r)#<lcZ53%^Dv+unw@wuMz#o7b<ubsR{
zmiS<vcxzG6=$s?8+{ydV7{Ps=v+qZTN-RIe*`Wt26J0vOGf3}wE%E$0h3Yv45}$WF
z`Fy&t-oLe&kH6sH4nU}k`Abajd_$U~1Z#PuPUHn2b~ImNQqMldWW<ifMV<0u;=;Dz
zif52MJr*j@dhqcMD^%hW@by@zwxh=+wVl`)qc0V{jKjY85Rlpqzh;45D7oLHJpvt}
zWqg8s#J^C5PrwtOgLQ-A>soPC@g=Xpx?S=8-CZb5D87_^u)d`DdTi}}#n)qNk0`#B
zeaDiqGQBt(qhTwtYcC%9=}=iH(do7>PFe!Ckg}2tNXdX4t^0;v&*1Q;5kI&T3`FGy
zWE5UvE)ydKW^O~Qqw6;!PLt`!hE&x2Fp|bjxv8?>S2%-W4J)NO_D;awE#{bujz;4V
zmlUhcK#TrfQ+^o5`{D(UKBy??#vU$u(LU8QOgE&yAG!Fan>>76-^3KC?{&yxE*p6I
zUIf34AA|Hgj^M5IUr#^8llo3f-x|SR&jPyc04vo05a}aMWdtg!aDt@%Yojp8N!=p+
zuMrP%4Ab9BJW!?%q3aO;UgBB!y#_v5A^x?*v+zfW4{DVDt4YSfmv>4@C(;k>5PuVa
zTll+479{PH<SL*3K2o;u_jCF?SP}Tvm;}0>E&K`Allbyw&i@Fv@DCgQ$Mak4iC=z9
zJPZFI12)S4A4c$x8TfcEhxil3v+xfSAJi!SKS?rH`cD}6D7zs(zPVxHPXe5%QU2dW
z$`<}?G}4H4{=-&?e=+ea{1Z?n68YpRU;Z#=XW_48e932&KeRK&p73SebXbR;WWaVl
z%0cwyI<{_lJ>yqc5cp{KiN4^=n8Fe<$j1_#LZs(U;hNd$@jb<a7skKLf{o&jb(5C=
z4jA#b#w29jXNbRr@k@xbB1ylnV(UJqjPir_uIP*ZFjv~@liVwg5+FW??8l%_VNy;-
zT=X0DNxqf+FM4u3pZFGq_?IX8xjxBu)|dN0Y)Sg%`gcgq%D;ImDEe)rP@;d)7ys=b
UeTEW~?zn(6w1ba`w^e`rKiCYw$p8QV

literal 0
HcmV?d00001

diff --git a/app/src/main/cpp/main.cpp b/app/src/main/cpp/main.cpp
deleted file mode 100644
index 87a7d0b..0000000
--- a/app/src/main/cpp/main.cpp
+++ /dev/null
@@ -1,191 +0,0 @@
-#include <android/log.h>
-#include <sys/system_properties.h>
-#include <unistd.h>
-#include <string_view>
-#include <vector>
-#include <map>
-
-#include "zygisk.hpp"
-#include "shadowhook.h"
-
-#define LOGD(...) __android_log_print(ANDROID_LOG_DEBUG, "PIF/Native", __VA_ARGS__)
-
-#define to_app_id(uid) (uid % 100000)
-
-typedef void (*T_Callback)(void *, const char *, const char *, uint32_t);
-
-static std::map<void *, T_Callback> callbacks;
-
-static void modify_callback(void *cookie, const char *name, const char *value, uint32_t serial) {
-
-    if (cookie == nullptr || name == nullptr || value == nullptr ||
-        !callbacks.contains(cookie))
-        return;
-
-    std::string_view prop(name);
-
-    if (prop.ends_with("api_level")) {
-        value = "23";
-        LOGD("[%s]: %s", name, value);
-    } else if (prop.ends_with("security_patch")) {
-        value = "2018-01-05";
-        LOGD("[%s]: %s", name, value);
-    } else if (prop.ends_with("vndk.version")) {
-        value = "23";
-        LOGD("[%s]: %s", name, value);
-    } else if (prop == "ro.build.id") {
-        value = "NRD90M";
-        LOGD("[%s]: %s", name, value);
-    }
-
-    return callbacks[cookie](cookie, name, value, serial);
-}
-
-static void (*o_system_property_read_callback)(const prop_info *, T_Callback, void *);
-
-static void
-my_system_property_read_callback(const prop_info *pi, T_Callback callback, void *cookie) {
-    if (pi == nullptr || callback == nullptr || cookie == nullptr) {
-        return o_system_property_read_callback(pi, callback, cookie);
-    }
-    callbacks[cookie] = callback;
-    return o_system_property_read_callback(pi, modify_callback, cookie);
-}
-
-static void doHook() {
-    shadowhook_init(SHADOWHOOK_MODE_UNIQUE, false);
-    void *handle = shadowhook_hook_sym_name("libc.so", "__system_property_read_callback",
-                                            reinterpret_cast<void *>(my_system_property_read_callback),
-                                            reinterpret_cast<void **>(&o_system_property_read_callback));
-    if (handle == nullptr) {
-        LOGD("Couldn't find '__system_property_read_callback' handle. Report to @chiteroman");
-        return;
-    }
-    LOGD("Found '__system_property_read_callback' handle at %p", handle);
-}
-
-class PlayIntegrityFix : public zygisk::ModuleBase {
-public:
-    void onLoad(zygisk::Api *api, JNIEnv *env) override {
-        this->api = api;
-        this->env = env;
-    }
-
-    void preAppSpecialize(zygisk::AppSpecializeArgs *args) override {
-
-        if (to_app_id(args->uid) < 10000 || to_app_id(args->uid) > 19999 || // not app process
-            (args->is_child_zygote && *(args->is_child_zygote))) { // app_zygote
-
-            api->setOption(zygisk::DLCLOSE_MODULE_LIBRARY);
-            return;
-        }
-
-        bool isGms = false, isGmsUnstable = false;
-
-        auto process = env->GetStringUTFChars(args->nice_name, nullptr);
-
-        if (process) {
-            isGms = strncmp(process, "com.google.android.gms", 22) == 0;
-            isGmsUnstable = strcmp(process, "com.google.android.gms.unstable") == 0;
-        }
-
-        env->ReleaseStringUTFChars(args->nice_name, process);
-
-        if (isGms) { // GMS processes
-            api->setOption(zygisk::FORCE_DENYLIST_UNMOUNT);
-        }
-
-        if (isGmsUnstable) { // Unstable GMS process, which runs DroidGuard
-            uint32_t size = 0;
-            int fd = api->connectCompanion();
-
-            read(fd, &size, sizeof(uint32_t));
-
-            if (size > 0) {
-                vector.resize(size);
-                read(fd, vector.data(), size);
-            } else {
-                LOGD("Couldn't read classes.dex");
-                api->setOption(zygisk::DLCLOSE_MODULE_LIBRARY);
-            }
-
-            close(fd);
-            return;
-        }
-
-        api->setOption(zygisk::DLCLOSE_MODULE_LIBRARY);
-    }
-
-    void postAppSpecialize(const zygisk::AppSpecializeArgs *args) override {
-        if (vector.empty()) return;
-
-        LOGD("Read %ld bytes of classes.dex!", static_cast<long>(vector.size()));
-
-        doHook();
-
-        inject();
-
-        vector.clear();
-    }
-
-    void preServerSpecialize(zygisk::ServerSpecializeArgs *args) override {
-        api->setOption(zygisk::DLCLOSE_MODULE_LIBRARY);
-    }
-
-private:
-    zygisk::Api *api = nullptr;
-    JNIEnv *env = nullptr;
-    std::vector<uint8_t> vector;
-
-    void inject() {
-        LOGD("get system classloader");
-        auto clClass = env->FindClass("java/lang/ClassLoader");
-        auto getSystemClassLoader = env->GetStaticMethodID(clClass, "getSystemClassLoader",
-                                                           "()Ljava/lang/ClassLoader;");
-        auto systemClassLoader = env->CallStaticObjectMethod(clClass, getSystemClassLoader);
-
-        LOGD("create class loader");
-        auto dexClClass = env->FindClass("dalvik/system/InMemoryDexClassLoader");
-        auto dexClInit = env->GetMethodID(dexClClass, "<init>",
-                                          "(Ljava/nio/ByteBuffer;Ljava/lang/ClassLoader;)V");
-        auto buff = env->NewDirectByteBuffer(vector.data(), vector.size());
-        auto dexCl = env->NewObject(dexClClass, dexClInit, buff, systemClassLoader);
-
-        LOGD("load class");
-        auto loadClass = env->GetMethodID(clClass, "loadClass",
-                                          "(Ljava/lang/String;)Ljava/lang/Class;");
-        auto entryClassName = env->NewStringUTF("es.chiteroman.playintegrityfix.EntryPoint");
-        auto entryClassObj = env->CallObjectMethod(dexCl, loadClass, entryClassName);
-
-        auto entryClass = (jclass) entryClassObj;
-
-        LOGD("call init");
-        auto entryInit = env->GetStaticMethodID(entryClass, "init", "()V");
-        env->CallStaticVoidMethod(entryClass, entryInit);
-    }
-};
-
-static void companion(int fd) {
-    std::vector<uint8_t> vector;
-    uint32_t size = 0;
-
-    FILE *dex = fopen("/data/adb/modules/playintegrityfix/classes.dex", "rb");
-
-    if (dex) {
-        fseek(dex, 0, SEEK_END);
-        size = ftell(dex);
-        fseek(dex, 0, SEEK_SET);
-
-        vector.resize(size);
-        fread(vector.data(), 1, size, dex);
-
-        fclose(dex);
-    }
-
-    write(fd, &size, sizeof(uint32_t));
-    write(fd, vector.data(), size);
-}
-
-REGISTER_ZYGISK_MODULE(PlayIntegrityFix)
-
-REGISTER_ZYGISK_COMPANION(companion)
diff --git a/app/src/main/cpp/module.cpp b/app/src/main/cpp/module.cpp
new file mode 100644
index 0000000..a3ff85f
--- /dev/null
+++ b/app/src/main/cpp/module.cpp
@@ -0,0 +1,264 @@
+#include <android/log.h>
+#include <sys/system_properties.h>
+#include <unistd.h>
+
+#include "zygisk.hpp"
+#include "dobby.h"
+#include "json.hpp"
+
+#define LOGD(...) __android_log_print(ANDROID_LOG_DEBUG, "PIF/Native", __VA_ARGS__)
+
+#define DEF_SECURITY_PATCH "2018-02-05"
+#define DEF_FIRST_API_LEVEL "23"
+#define DEF_VNDK_VERSION "23"
+#define DEF_BUILD_ID "NMF26F"
+
+static std::string SECURITY_PATCH, FIRST_API_LEVEL, VNDK_VERSION, BUILD_ID;
+
+typedef void (*T_Callback)(void *, const char *, const char *, uint32_t);
+
+static std::map<void *, T_Callback> callbacks;
+
+static void modify_callback(void *cookie, const char *name, const char *value, uint32_t serial) {
+
+    if (cookie == nullptr || name == nullptr || value == nullptr ||
+        !callbacks.contains(cookie))
+        return;
+
+    std::string_view prop(name);
+
+    if (prop.ends_with("security_patch")) {
+        if (SECURITY_PATCH.empty()) {
+            value = DEF_SECURITY_PATCH;
+        } else {
+            value = SECURITY_PATCH.c_str();
+        }
+        LOGD("[%s]: %s", name, value);
+    } else if (prop.ends_with("api_level")) {
+        if (FIRST_API_LEVEL.empty()) {
+            value = DEF_FIRST_API_LEVEL;
+        } else {
+            value = FIRST_API_LEVEL.c_str();
+        }
+        LOGD("[%s]: %s", name, value);
+    } else if (prop.ends_with("vndk.version")) {
+        if (VNDK_VERSION.empty()) {
+            value = DEF_VNDK_VERSION;
+        } else {
+            value = VNDK_VERSION.c_str();
+        }
+        LOGD("[%s]: %s", name, value);
+    } else if (prop == "ro.build.id") {
+        if (BUILD_ID.empty()) {
+            value = DEF_BUILD_ID;
+        } else {
+            value = BUILD_ID.c_str();
+        }
+        LOGD("[%s]: %s", name, value);
+    }
+
+    return callbacks[cookie](cookie, name, value, serial);
+}
+
+static void (*o_system_property_read_callback)(const prop_info *, T_Callback, void *);
+
+static void
+my_system_property_read_callback(const prop_info *pi, T_Callback callback, void *cookie) {
+    if (pi == nullptr || callback == nullptr || cookie == nullptr) {
+        return o_system_property_read_callback(pi, callback, cookie);
+    }
+    callbacks[cookie] = callback;
+    return o_system_property_read_callback(pi, modify_callback, cookie);
+}
+
+static void doHook() {
+    void *handle = DobbySymbolResolver(nullptr, "__system_property_read_callback");
+    if (handle == nullptr) {
+        LOGD("Couldn't find '__system_property_read_callback' handle. Report to @chiteroman");
+        return;
+    }
+    LOGD("Found '__system_property_read_callback' handle at %p", handle);
+    DobbyHook(
+            handle,
+            reinterpret_cast<dobby_dummy_func_t>(my_system_property_read_callback),
+            reinterpret_cast<dobby_dummy_func_t *>(&o_system_property_read_callback)
+    );
+}
+
+class PlayIntegrityFix : public zygisk::ModuleBase {
+public:
+    void onLoad(zygisk::Api *api, JNIEnv *env) override {
+        this->api = api;
+        this->env = env;
+    }
+
+    void preAppSpecialize(zygisk::AppSpecializeArgs *args) override {
+
+        auto rawProcess = env->GetStringUTFChars(args->nice_name, nullptr);
+        std::string process(rawProcess);
+        env->ReleaseStringUTFChars(args->nice_name, rawProcess);
+
+        if (process.starts_with("com.google.android.gms")) {
+
+            api->setOption(zygisk::FORCE_DENYLIST_UNMOUNT);
+
+            if (process == "com.google.android.gms.unstable") {
+
+                int fd = api->connectCompanion();
+
+                read(fd, &dexSize, sizeof(dexSize));
+                read(fd, &jsonSize, sizeof(jsonSize));
+
+                auto vectorSize = dexSize + jsonSize;
+
+                if (vectorSize > 0) {
+                    vector.resize(vectorSize);
+                    read(fd, vector.data(), vectorSize);
+                } else {
+                    LOGD("Couldn't read classes.dex");
+                    api->setOption(zygisk::DLCLOSE_MODULE_LIBRARY);
+                }
+
+                close(fd);
+                return;
+            }
+        }
+
+        api->setOption(zygisk::DLCLOSE_MODULE_LIBRARY);
+    }
+
+    void postAppSpecialize(const zygisk::AppSpecializeArgs *args) override {
+        if (vector.empty()) return;
+
+        LOGD("Read %ld bytes of classes.dex!", dexSize);
+        LOGD("Read %ld bytes of pif.json!", jsonSize);
+
+        if (jsonSize > 0) parseJson();
+
+        doHook();
+
+        injectDex();
+
+        vector.clear();
+        json.clear();
+    }
+
+    void preServerSpecialize(zygisk::ServerSpecializeArgs *args) override {
+        api->setOption(zygisk::DLCLOSE_MODULE_LIBRARY);
+    }
+
+private:
+    zygisk::Api *api = nullptr;
+    JNIEnv *env = nullptr;
+    long dexSize = 0, jsonSize = 0;
+    std::vector<char> vector;
+    nlohmann::json json;
+
+    void parseJson() {
+        std::string_view data(vector.cbegin() + dexSize, vector.cend());
+        json = nlohmann::json::parse(data, nullptr, false, true);
+
+        if (json.contains("SECURITY_PATCH")) {
+            if (json["SECURITY_PATCH"].is_null() || json["SECURITY_PATCH"].empty()) {
+                LOGD("SECURITY_PATCH is null or empty");
+            } else {
+                SECURITY_PATCH = json["SECURITY_PATCH"].get<std::string>();
+            }
+        }
+
+        if (json.contains("FIRST_API_LEVEL")) {
+            if (json["FIRST_API_LEVEL"].is_null() || json["FIRST_API_LEVEL"].empty()) {
+                LOGD("FIRST_API_LEVEL is null or empty");
+            } else {
+                FIRST_API_LEVEL = json["FIRST_API_LEVEL"].get<std::string>();
+            }
+            json.erase("FIRST_API_LEVEL");
+        }
+
+        if (json.contains("BUILD_ID")) {
+            if (json["BUILD_ID"].is_null() || json["BUILD_ID"].empty()) {
+                LOGD("BUILD_ID is null or empty");
+            } else {
+                BUILD_ID = json["BUILD_ID"].get<std::string>();
+            }
+            json.erase("BUILD_ID");
+        }
+
+        if (json.contains("VNDK_VERSION")) {
+            if (json["VNDK_VERSION"].is_null() || json["VNDK_VERSION"].empty()) {
+                LOGD("VNDK_VERSION is null or empty");
+            } else {
+                VNDK_VERSION = json["VNDK_VERSION"].get<std::string>();
+            }
+            json.erase("VNDK_VERSION");
+        }
+    }
+
+    void injectDex() {
+        LOGD("get system classloader");
+        auto clClass = env->FindClass("java/lang/ClassLoader");
+        auto getSystemClassLoader = env->GetStaticMethodID(clClass, "getSystemClassLoader",
+                                                           "()Ljava/lang/ClassLoader;");
+        auto systemClassLoader = env->CallStaticObjectMethod(clClass, getSystemClassLoader);
+
+        LOGD("create class loader");
+        auto dexClClass = env->FindClass("dalvik/system/InMemoryDexClassLoader");
+        auto dexClInit = env->GetMethodID(dexClClass, "<init>",
+                                          "(Ljava/nio/ByteBuffer;Ljava/lang/ClassLoader;)V");
+        auto buff = env->NewDirectByteBuffer(vector.data(), dexSize);
+        auto dexCl = env->NewObject(dexClClass, dexClInit, buff, systemClassLoader);
+
+        LOGD("load class");
+        auto loadClass = env->GetMethodID(clClass, "loadClass",
+                                          "(Ljava/lang/String;)Ljava/lang/Class;");
+        auto entryClassName = env->NewStringUTF("es.chiteroman.playintegrityfix.EntryPoint");
+        auto entryClassObj = env->CallObjectMethod(dexCl, loadClass, entryClassName);
+
+        auto entryClass = (jclass) entryClassObj;
+
+        LOGD("call init");
+        auto str = env->NewStringUTF(json.dump().c_str());
+        auto entryInit = env->GetStaticMethodID(entryClass, "init", "(Ljava/lang/String;)V");
+        env->CallStaticVoidMethod(entryClass, entryInit, str);
+    }
+};
+
+static void companion(int fd) {
+    long dexSize = 0, jsonSize = 0;
+    std::vector<char> vector;
+
+    FILE *dex = fopen("/data/adb/modules/playintegrityfix/classes.dex", "rb");
+
+    if (dex) {
+        fseek(dex, 0, SEEK_END);
+        dexSize = ftell(dex);
+        fseek(dex, 0, SEEK_SET);
+
+        vector.resize(dexSize);
+        fread(vector.data(), 1, dexSize, dex);
+
+        fclose(dex);
+    }
+
+    FILE *json = fopen("/data/adb/pif.json", "rb");
+
+    if (json) {
+        fseek(json, 0, SEEK_END);
+        jsonSize = ftell(json);
+        fseek(json, 0, SEEK_SET);
+
+        vector.resize(dexSize + jsonSize);
+        fread(vector.data() + dexSize, 1, jsonSize, json);
+
+        fclose(json);
+    }
+
+    write(fd, &dexSize, sizeof(dexSize));
+    write(fd, &jsonSize, sizeof(jsonSize));
+
+    write(fd, vector.data(), vector.size());
+}
+
+REGISTER_ZYGISK_MODULE(PlayIntegrityFix)
+
+REGISTER_ZYGISK_COMPANION(companion)
diff --git a/app/src/main/cpp/shadowhook/arch/arm/sh_a32.c b/app/src/main/cpp/shadowhook/arch/arm/sh_a32.c
deleted file mode 100644
index d71e4f8..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm/sh_a32.c
+++ /dev/null
@@ -1,446 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_a32.h"
-
-#include <inttypes.h>
-#include <sh_util.h>
-#include <stdint.h>
-
-#include "sh_log.h"
-
-// https://developer.arm.com/documentation/ddi0406/latest
-// https://developer.arm.com/documentation/ddi0597/latest
-
-typedef enum {
-  IGNORED = 0,
-  B_A1,
-  BX_A1,
-  BL_IMM_A1,
-  BLX_IMM_A2,
-  ADD_REG_A1,
-  ADD_REG_PC_A1,
-  SUB_REG_A1,
-  SUB_REG_PC_A1,
-  ADR_A1,
-  ADR_A2,
-  MOV_REG_A1,
-  MOV_REG_PC_A1,
-  LDR_LIT_A1,
-  LDR_LIT_PC_A1,
-  LDRB_LIT_A1,
-  LDRD_LIT_A1,
-  LDRH_LIT_A1,
-  LDRSB_LIT_A1,
-  LDRSH_LIT_A1,
-  LDR_REG_A1,
-  LDR_REG_PC_A1,
-  LDRB_REG_A1,
-  LDRD_REG_A1,
-  LDRH_REG_A1,
-  LDRSB_REG_A1,
-  LDRSH_REG_A1
-} sh_a32_type_t;
-
-static sh_a32_type_t sh_a32_get_type(uint32_t inst) {
-  if (((inst & 0x0F000000u) == 0x0A000000) && ((inst & 0xF0000000) != 0xF0000000))
-    return B_A1;
-  else if (((inst & 0x0FFFFFFFu) == 0x012FFF1F) && ((inst & 0xF0000000) != 0xF0000000))
-    return BX_A1;
-  else if (((inst & 0x0F000000u) == 0x0B000000) && ((inst & 0xF0000000) != 0xF0000000))
-    return BL_IMM_A1;
-  else if ((inst & 0xFE000000) == 0xFA000000)
-    return BLX_IMM_A2;
-  else if (((inst & 0x0FE00010u) == 0x00800000) && ((inst & 0xF0000000) != 0xF0000000) &&
-           ((inst & 0x0010F000u) != 0x0010F000) && ((inst & 0x000F0000u) != 0x000D0000) &&
-           (((inst & 0x000F0000u) == 0x000F0000) || ((inst & 0x0000000Fu) == 0x0000000F)))
-    return ((inst & 0x0000F000u) == 0x0000F000) ? ADD_REG_PC_A1 : ADD_REG_A1;
-  else if (((inst & 0x0FE00010u) == 0x00400000) && ((inst & 0xF0000000) != 0xF0000000) &&
-           ((inst & 0x0010F000u) != 0x0010F000) && ((inst & 0x000F0000u) != 0x000D0000) &&
-           (((inst & 0x000F0000u) == 0x000F0000) || ((inst & 0x0000000Fu) == 0x0000000F)))
-    return ((inst & 0x0000F000u) == 0x0000F000) ? SUB_REG_PC_A1 : SUB_REG_A1;
-  else if (((inst & 0x0FFF0000u) == 0x028F0000) && ((inst & 0xF0000000) != 0xF0000000))
-    return ADR_A1;
-  else if (((inst & 0x0FFF0000u) == 0x024F0000) && ((inst & 0xF0000000) != 0xF0000000))
-    return ADR_A2;
-  else if (((inst & 0x0FEF001Fu) == 0x01A0000F) && ((inst & 0xF0000000) != 0xF0000000) &&
-           ((inst & 0x0010F000u) != 0x0010F000) &&
-           (!(((inst & 0x0000F000u) == 0x0000F000) && ((inst & 0x00000FF0u) != 0x00000000))))
-    return ((inst & 0x0000F000u) == 0x0000F000) ? MOV_REG_PC_A1 : MOV_REG_A1;
-  else if (((inst & 0x0F7F0000u) == 0x051F0000) && ((inst & 0xF0000000) != 0xF0000000))
-    return ((inst & 0x0000F000u) == 0x0000F000) ? LDR_LIT_PC_A1 : LDR_LIT_A1;
-  else if (((inst & 0x0F7F0000u) == 0x055F0000) && ((inst & 0xF0000000) != 0xF0000000))
-    return LDRB_LIT_A1;
-  else if (((inst & 0x0F7F00F0u) == 0x014F00D0) && ((inst & 0xF0000000) != 0xF0000000))
-    return LDRD_LIT_A1;
-  else if (((inst & 0x0F7F00F0u) == 0x015F00B0) && ((inst & 0xF0000000) != 0xF0000000))
-    return LDRH_LIT_A1;
-  else if (((inst & 0x0F7F00F0u) == 0x015F00D0) && ((inst & 0xF0000000) != 0xF0000000))
-    return LDRSB_LIT_A1;
-  else if (((inst & 0x0F7F00F0u) == 0x015F00F0) && ((inst & 0xF0000000) != 0xF0000000))
-    return LDRSH_LIT_A1;
-  else if (((inst & 0x0E5F0010u) == 0x061F0000) && ((inst & 0xF0000000) != 0xF0000000) &&
-           ((inst & 0x01200000u) != 0x00200000))
-    return ((inst & 0x0000F000u) == 0x0000F000) ? LDR_REG_PC_A1 : LDR_REG_A1;
-  else if (((inst & 0x0E5F0010u) == 0x065F0000) && ((inst & 0xF0000000) != 0xF0000000) &&
-           ((inst & 0x01200000u) != 0x00200000))
-    return LDRB_REG_A1;
-  else if (((inst & 0x0E5F0FF0u) == 0x000F00D0) && ((inst & 0xF0000000) != 0xF0000000) &&
-           ((inst & 0x01200000u) != 0x00200000))
-    return LDRD_REG_A1;
-  else if (((inst & 0x0E5F0FF0u) == 0x001F00B0) && ((inst & 0xF0000000) != 0xF0000000) &&
-           ((inst & 0x01200000u) != 0x00200000))
-    return LDRH_REG_A1;
-  else if (((inst & 0x0E5F0FF0u) == 0x001F00D0) && ((inst & 0xF0000000) != 0xF0000000) &&
-           ((inst & 0x01200000u) != 0x00200000))
-    return LDRSB_REG_A1;
-  else if (((inst & 0x0E5F0FF0u) == 0x001F00F0) && ((inst & 0xF0000000) != 0xF0000000) &&
-           ((inst & 0x01200000u) != 0x00200000))
-    return LDRSH_REG_A1;
-  else
-    return IGNORED;
-}
-
-size_t sh_a32_get_rewrite_inst_len(uint32_t inst) {
-  static uint8_t map[] = {
-      4,   // IGNORED
-      12,  // B_A1
-      12,  // BX_A1
-      16,  // BL_IMM_A1
-      16,  // BLX_IMM_A2
-      32,  // ADD_REG_A1
-      32,  // ADD_REG_PC_A1
-      32,  // SUB_REG_A1
-      32,  // SUB_REG_PC_A1
-      12,  // ADR_A1
-      12,  // ADR_A2
-      32,  // MOV_REG_A1
-      12,  // MOV_REG_PC_A1
-      24,  // LDR_LIT_A1
-      36,  // LDR_LIT_PC_A1
-      24,  // LDRB_LIT_A1
-      24,  // LDRD_LIT_A1
-      24,  // LDRH_LIT_A1
-      24,  // LDRSB_LIT_A1
-      24,  // LDRSH_LIT_A1
-      32,  // LDR_REG_A1
-      36,  // LDR_REG_PC_A1
-      32,  // LDRB_REG_A1
-      32,  // LDRD_REG_A1
-      32,  // LDRH_REG_A1
-      32,  // LDRSB_REG_A1
-      32   // LDRSH_REG_A1
-  };
-
-  return (size_t)(map[sh_a32_get_type(inst)]);
-}
-
-static bool sh_a32_is_addr_need_fix(uintptr_t addr, sh_a32_rewrite_info_t *rinfo) {
-  return (rinfo->overwrite_start_addr <= addr && addr < rinfo->overwrite_end_addr);
-}
-
-static uintptr_t sh_a32_fix_addr(uintptr_t addr, sh_a32_rewrite_info_t *rinfo) {
-  if (rinfo->overwrite_start_addr <= addr && addr < rinfo->overwrite_end_addr) {
-    uintptr_t cursor_addr = rinfo->overwrite_start_addr;
-    size_t offset = 0;
-    for (size_t i = 0; i < rinfo->rewrite_inst_lens_cnt; i++) {
-      if (cursor_addr >= addr) break;
-      cursor_addr += 4;
-      offset += rinfo->rewrite_inst_lens[i];
-    }
-    uintptr_t fixed_addr = (uintptr_t)rinfo->rewrite_buf + offset;
-    SH_LOG_INFO("a32 rewrite: fix addr %" PRIxPTR " -> %" PRIxPTR, addr, fixed_addr);
-    return fixed_addr;
-  }
-
-  return addr;
-}
-
-static size_t sh_a32_rewrite_b(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a32_type_t type,
-                               sh_a32_rewrite_info_t *rinfo) {
-  uint32_t cond;
-  if (type == B_A1 || type == BL_IMM_A1 || type == BX_A1)
-    cond = SH_UTIL_GET_BITS_32(inst, 31, 28);
-  else
-    // type == BLX_IMM_A2
-    cond = 0xE;  // 1110 None (AL)
-
-  uint32_t addr;
-  if (type == B_A1 || type == BL_IMM_A1) {
-    uint32_t imm24 = SH_UTIL_GET_BITS_32(inst, 23, 0);
-    uint32_t imm32 = SH_UTIL_SIGN_EXTEND_32(imm24 << 2u, 26u);
-    addr = pc + imm32;  // arm -> arm
-  } else if (type == BLX_IMM_A2) {
-    uint32_t h = SH_UTIL_GET_BIT_32(inst, 24);
-    uint32_t imm24 = SH_UTIL_GET_BITS_32(inst, 23, 0);
-    uint32_t imm32 = SH_UTIL_SIGN_EXTEND_32((imm24 << 2u) | (h << 1u), 26u);
-    addr = SH_UTIL_SET_BIT0(pc + imm32);  // arm -> thumb
-  } else {
-    // type == BX_A1
-    // BX PC
-    // PC must be even, and the "arm" instruction must be at a 4-byte aligned address,
-    // so the instruction set must keep "arm" unchanged.
-    addr = pc;  // arm -> arm
-  }
-  addr = sh_a32_fix_addr(addr, rinfo);
-
-  size_t idx = 0;
-  if (type == BL_IMM_A1 || type == BLX_IMM_A2) {
-    buf[idx++] = 0x028FE008u | (cond << 28u);  // ADD<c> LR, PC, #8
-  }
-  buf[idx++] = 0x059FF000u | (cond << 28u);  // LDR<c> PC, [PC, #0]
-  buf[idx++] = 0xEA000000;                   // B #0
-  buf[idx++] = addr;
-  return idx * 4;  // 12 or 16
-}
-
-static size_t sh_a32_rewrite_add_or_sub(uint32_t *buf, uint32_t inst, uintptr_t pc) {
-  // ADD{S}<c> <Rd>, <Rn>, PC{, <shift>}  or  ADD{S}<c> <Rd>, PC, <Rm>{, <shift>}
-  // SUB{S}<c> <Rd>, <Rn>, PC{, <shift>}  or  SUB{S}<c> <Rd>, PC, <Rm>{, <shift>}
-  uint32_t cond = SH_UTIL_GET_BITS_32(inst, 31, 28);
-  uint32_t rn = SH_UTIL_GET_BITS_32(inst, 19, 16);
-  uint32_t rm = SH_UTIL_GET_BITS_32(inst, 3, 0);
-  uint32_t rd = SH_UTIL_GET_BITS_32(inst, 15, 12);
-
-  uint32_t rx;  // r0 - r3
-  for (rx = 3;; --rx)
-    if (rx != rn && rx != rm && rx != rd) break;
-
-  if (rd == 0xF)  // Rd == PC
-  {
-    uint32_t ry;  // r0 - r4
-    for (ry = 4;; --ry)
-      if (ry != rn && ry != rm && ry != rd && ry != rx) break;
-
-    buf[0] = 0x0A000000u | (cond << 28u);           // B<c> #0
-    buf[1] = 0xEA000005;                            // B #20
-    buf[2] = 0xE92D8000 | (1u << rx) | (1u << ry);  // PUSH {Rx, Ry, PC}
-    buf[3] = 0xE59F0008 | (rx << 12u);              // LDR Rx, [PC, #8]
-    if (rn == 0xF)
-      // Rn == PC
-      buf[4] =
-          (inst & 0x0FF00FFFu) | 0xE0000000 | (ry << 12u) | (rx << 16u);  // ADD/SUB Ry, Rx, Rm{, <shift>}
-    else
-      // Rm == PC
-      buf[4] = (inst & 0x0FFF0FF0u) | 0xE0000000 | (ry << 12u) | rx;  // ADD/SUB Ry, Rn, Rx{, <shift>}
-    buf[5] = 0xE58D0008 | (ry << 12u);                                // STR Ry, [SP, #8]
-    buf[6] = 0xE8BD8000 | (1u << rx) | (1u << ry);                    // POP {Rx, Ry, PC}
-    buf[7] = pc;
-    return 32;
-  } else {
-    buf[0] = 0x0A000000u | (cond << 28u);  // B<c> #0
-    buf[1] = 0xEA000005;                   // B #20
-    buf[2] = 0xE52D0004 | (rx << 12u);     // PUSH {Rx}
-    buf[3] = 0xE59F0008 | (rx << 12u);     // LDR Rx, [PC, #8]
-    if (rn == 0xF)
-      // Rn == PC
-      buf[4] = (inst & 0x0FF0FFFFu) | 0xE0000000 | (rx << 16u);  // ADD/SUB{S} Rd, Rx, Rm{, <shift>}
-    else
-      // Rm == PC
-      buf[4] = (inst & 0x0FFFFFF0u) | 0xE0000000 | rx;  // ADD/SUB{S} Rd, Rn, Rx{, <shift>}
-    buf[5] = 0xE49D0004 | (rx << 12u);                  // POP {Rx}
-    buf[6] = 0xEA000000;                                // B #0
-    buf[7] = pc;
-    return 32;
-  }
-}
-
-static size_t sh_a32_rewrite_adr(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a32_type_t type,
-                                 sh_a32_rewrite_info_t *rinfo) {
-  uint32_t cond = SH_UTIL_GET_BITS_32(inst, 31, 28);
-  uint32_t rd = SH_UTIL_GET_BITS_32(inst, 15, 12);  // r0 - r15
-  uint32_t imm12 = SH_UTIL_GET_BITS_32(inst, 11, 0);
-  uint32_t imm32 = sh_util_arm_expand_imm(imm12);
-  uint32_t addr = (type == ADR_A1 ? (SH_UTIL_ALIGN_4(pc) + imm32) : (SH_UTIL_ALIGN_4(pc) - imm32));
-  if (sh_a32_is_addr_need_fix(addr, rinfo)) return 0;  // rewrite failed
-
-  buf[0] = 0x059F0000u | (cond << 28u) | (rd << 12u);  // LDR<c> Rd, [PC, #0]
-  buf[1] = 0xEA000000;                                 // B #0
-  buf[2] = addr;
-  return 12;
-}
-
-static size_t sh_a32_rewrite_mov(uint32_t *buf, uint32_t inst, uintptr_t pc) {
-  // MOV{S}<c> <Rd>, PC
-  uint32_t cond = SH_UTIL_GET_BITS_32(inst, 31, 28);
-  uint32_t rd = SH_UTIL_GET_BITS_32(inst, 15, 12);
-  uint32_t rx = (rd == 0) ? 1 : 0;
-
-  if (rd == 0xF)  // Rd == PC (MOV PC, PC)
-  {
-    buf[0] = 0x059FF000u | (cond << 28u);  // LDR<c> PC, [PC, #0]
-    buf[1] = 0xEA000000;                   // B #0
-    buf[2] = pc;
-    return 12;
-  } else {
-    buf[0] = 0x0A000000u | (cond << 28u);             // B<c> #0
-    buf[1] = 0xEA000005;                              // B #20
-    buf[2] = 0xE52D0004 | (rx << 12u);                // PUSH {Rx}
-    buf[3] = 0xE59F0008 | (rx << 12u);                // LDR Rx, [PC, #8]
-    buf[4] = (inst & 0x0FFFFFF0u) | 0xE0000000 | rx;  // MOV{S} Rd, Rx{, <shift> #<amount>/RRX}
-    buf[5] = 0xE49D0004 | (rx << 12u);                // POP {Rx}
-    buf[6] = 0xEA000000;                              // B #0
-    buf[7] = pc;
-    return 32;
-  }
-}
-
-static size_t sh_a32_rewrite_ldr_lit(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a32_type_t type,
-                                     sh_a32_rewrite_info_t *rinfo) {
-  uint32_t cond = SH_UTIL_GET_BITS_32(inst, 31, 28);
-  uint32_t u = SH_UTIL_GET_BIT_32(inst, 23);
-  uint32_t rt = SH_UTIL_GET_BITS_16(inst, 15, 12);
-
-  uint32_t imm32;
-  if (type == LDR_LIT_A1 || type == LDR_LIT_PC_A1 || type == LDRB_LIT_A1)
-    imm32 = SH_UTIL_GET_BITS_32(inst, 11, 0);
-  else
-    imm32 = (SH_UTIL_GET_BITS_32(inst, 11, 8) << 4u) + SH_UTIL_GET_BITS_32(inst, 3, 0);
-  uint32_t addr = (u ? (SH_UTIL_ALIGN_4(pc) + imm32) : (SH_UTIL_ALIGN_4(pc) - imm32));
-  if (sh_a32_is_addr_need_fix(addr, rinfo)) return 0;  // rewrite failed
-
-  if (type == LDR_LIT_PC_A1 && rt == 0xF) {
-    // Rt == PC
-    buf[0] = 0x0A000000u | (cond << 28u);  // B<c> #0
-    buf[1] = 0xEA000006;                   // B #24
-    buf[2] = 0xE92D0003;                   // PUSH {R0, R1}
-    buf[3] = 0xE59F0000;                   // LDR R0, [PC, #0]
-    buf[4] = 0xEA000000;                   // B #0
-    buf[5] = addr;                         //
-    buf[6] = 0xE5900000;                   // LDR R0, [R0]
-    buf[7] = 0xE58D0004;                   // STR R0, [SP, #4]
-    buf[8] = 0xE8BD8001;                   // POP {R0, PC}
-    return 36;
-  } else {
-    buf[0] = 0x0A000000u | (cond << 28u);  // B<c> #0
-    buf[1] = 0xEA000003;                   // B #12
-    buf[2] = 0xE59F0000 | (rt << 12u);     // LDR Rt, [PC, #0]
-    buf[3] = 0xEA000000;                   // B #0
-    buf[4] = addr;                         //
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wswitch"
-    switch (type) {
-      case LDR_LIT_A1:
-        buf[5] = 0xE5900000 | (rt << 16u) | (rt << 12u);  // LDR Rt, [Rt]
-        break;
-      case LDRB_LIT_A1:
-        buf[5] = 0xE5D00000 | (rt << 16u) | (rt << 12u);  // LDRB Rt, [Rt]
-        break;
-      case LDRD_LIT_A1:
-        buf[5] = 0xE1C000D0 | (rt << 16u) | (rt << 12u);  // LDRD Rt, [Rt]
-        break;
-      case LDRH_LIT_A1:
-        buf[5] = 0xE1D000B0 | (rt << 16u) | (rt << 12u);  // LDRH Rt, [Rt]
-        break;
-      case LDRSB_LIT_A1:
-        buf[5] = 0xE1D000D0 | (rt << 16u) | (rt << 12u);  // LDRSB Rt, [Rt]
-        break;
-      case LDRSH_LIT_A1:
-        buf[5] = 0xE1D000F0 | (rt << 16u) | (rt << 12u);  // LDRSH Rt, [Rt]
-        break;
-    }
-#pragma clang diagnostic pop
-    return 24;
-  }
-}
-
-static size_t sh_a32_rewrite_ldr_reg(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a32_type_t type) {
-  // LDR<c> <Rt>, [PC,+/-<Rm>{, <shift>}]{!}
-  // ......
-  uint32_t cond = SH_UTIL_GET_BITS_32(inst, 31, 28);
-  uint32_t rt = SH_UTIL_GET_BITS_16(inst, 15, 12);
-  uint32_t rt2 = rt + 1;
-  uint32_t rm = SH_UTIL_GET_BITS_16(inst, 3, 0);
-  uint32_t rx;  // r0 - r3
-  for (rx = 3;; --rx)
-    if (rx != rt && rx != rt2 && rx != rm) break;
-
-  if (type == LDR_REG_PC_A1 && rt == 0xF) {
-    // Rt == PC
-    uint32_t ry;  // r0 - r4
-    for (ry = 4;; --ry)
-      if (ry != rt && ry != rt2 && ry != rm && ry != rx) break;
-
-    buf[0] = 0x0A000000u | (cond << 28u);           // B<c> #0
-    buf[1] = 0xEA000006;                            // B #24
-    buf[2] = 0xE92D8000 | (1u << rx) | (1u << ry);  // PUSH {Rx, Ry, PC}
-    buf[3] = 0xE59F0000 | (rx << 12u);              // LDR Rx, [PC, #8]
-    buf[4] = 0xEA000000;                            // B #0
-    buf[5] = pc;
-    buf[6] =
-        (inst & 0x0FF00FFFu) | 0xE0000000 | (rx << 16u) | (ry << 12u);  // LDRxx Ry, [Rx],+/-Rm{, <shift>}
-    buf[7] = 0xE58D0008 | (ry << 12u);                                  // STR Ry, [SP, #8]
-    buf[8] = 0xE8BD8000 | (1u << rx) | (1u << ry);                      // POP {Rx, Ry, PC}
-    return 36;
-  } else {
-    buf[0] = 0x0A000000u | (cond << 28u);  // B<c> #0
-    buf[1] = 0xEA000005;                   // B #20
-    buf[2] = 0xE52D0004 | (rx << 12u);     // PUSH {Rx}
-    buf[3] = 0xE59F0000 | (rx << 12u);     // LDR Rx, [PC, #0]
-    buf[4] = 0xEA000000;                   // B #0
-    buf[5] = pc;
-    buf[6] = (inst & 0x0FF0FFFFu) | 0xE0000000 | (rx << 16u);  // LDRxx Rt, [Rx],+/-Rm{, <shift>}
-    buf[7] = 0xE49D0004 | (rx << 12u);                         // POP {Rx}
-    return 32;
-  }
-}
-
-size_t sh_a32_rewrite(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a32_rewrite_info_t *rinfo) {
-  sh_a32_type_t type = sh_a32_get_type(inst);
-  SH_LOG_INFO("a32 rewrite: type %d, inst %" PRIx32, type, inst);
-
-  // We will only overwrite 4 to 8 bytes on A32, so PC cannot be in the coverage.
-  // In this case, the add/sub/mov/ldr_reg instruction does not need to consider
-  // the problem of PC in the coverage area when rewriting.
-
-  if (type == B_A1 || type == BX_A1 || type == BL_IMM_A1 || type == BLX_IMM_A2)
-    return sh_a32_rewrite_b(buf, inst, pc, type, rinfo);
-  else if (type == ADD_REG_A1 || type == ADD_REG_PC_A1 || type == SUB_REG_A1 || type == SUB_REG_PC_A1)
-    return sh_a32_rewrite_add_or_sub(buf, inst, pc);
-  else if (type == ADR_A1 || type == ADR_A2)
-    return sh_a32_rewrite_adr(buf, inst, pc, type, rinfo);
-  else if (type == MOV_REG_A1 || type == MOV_REG_PC_A1)
-    return sh_a32_rewrite_mov(buf, inst, pc);
-  else if (type == LDR_LIT_A1 || type == LDR_LIT_PC_A1 || type == LDRB_LIT_A1 || type == LDRD_LIT_A1 ||
-           type == LDRH_LIT_A1 || type == LDRSB_LIT_A1 || type == LDRSH_LIT_A1)
-    return sh_a32_rewrite_ldr_lit(buf, inst, pc, type, rinfo);
-  else if (type == LDR_REG_A1 || type == LDR_REG_PC_A1 || type == LDRB_REG_A1 || type == LDRD_REG_A1 ||
-           type == LDRH_REG_A1 || type == LDRSB_REG_A1 || type == LDRSH_REG_A1)
-    return sh_a32_rewrite_ldr_reg(buf, inst, pc, type);
-  else {
-    // IGNORED
-    buf[0] = inst;
-    return 4;
-  }
-}
-
-size_t sh_a32_absolute_jump(uint32_t *buf, uintptr_t addr) {
-  buf[0] = 0xE51FF004;  // LDR PC, [PC, #-4]
-  buf[1] = addr;
-  return 8;
-}
-
-size_t sh_a32_relative_jump(uint32_t *buf, uintptr_t addr, uintptr_t pc) {
-  buf[0] = 0xEA000000 | (((addr - pc) & 0x03FFFFFFu) >> 2u);  // B <label>
-  return 4;
-}
diff --git a/app/src/main/cpp/shadowhook/arch/arm/sh_a32.h b/app/src/main/cpp/shadowhook/arch/arm/sh_a32.h
deleted file mode 100644
index efe1592..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm/sh_a32.h
+++ /dev/null
@@ -1,41 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stddef.h>
-#include <stdint.h>
-
-typedef struct {
-  uintptr_t overwrite_start_addr;
-  uintptr_t overwrite_end_addr;
-  uint32_t *rewrite_buf;
-  size_t rewrite_buf_offset;
-  size_t rewrite_inst_lens[2];
-  size_t rewrite_inst_lens_cnt;
-} sh_a32_rewrite_info_t;
-
-size_t sh_a32_get_rewrite_inst_len(uint32_t inst);
-size_t sh_a32_rewrite(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a32_rewrite_info_t *rinfo);
-
-size_t sh_a32_absolute_jump(uint32_t *buf, uintptr_t addr);
-size_t sh_a32_relative_jump(uint32_t *buf, uintptr_t addr, uintptr_t pc);
diff --git a/app/src/main/cpp/shadowhook/arch/arm/sh_inst.c b/app/src/main/cpp/shadowhook/arch/arm/sh_inst.c
deleted file mode 100644
index 9ca310f..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm/sh_inst.c
+++ /dev/null
@@ -1,523 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_inst.h"
-
-#include <inttypes.h>
-#include <stdbool.h>
-#include <stdint.h>
-#include <stdlib.h>
-#include <string.h>
-#include <sys/mman.h>
-
-#include "sh_a32.h"
-#include "sh_config.h"
-#include "sh_enter.h"
-#include "sh_exit.h"
-#include "sh_log.h"
-#include "sh_sig.h"
-#include "sh_t16.h"
-#include "sh_t32.h"
-#include "sh_txx.h"
-#include "sh_util.h"
-#include "shadowhook.h"
-
-static void sh_inst_get_thumb_rewrite_info(sh_inst_t *self, uintptr_t target_addr,
-                                           sh_txx_rewrite_info_t *rinfo) {
-  memset(rinfo, 0, sizeof(sh_txx_rewrite_info_t));
-
-  size_t idx = 0;
-  uintptr_t target_addr_offset = 0;
-  uintptr_t pc = target_addr + 4;
-  size_t rewrite_len = 0;
-
-  while (rewrite_len < self->backup_len) {
-    // IT block
-    sh_t16_it_t it;
-    if (sh_t16_parse_it(&it, *((uint16_t *)(target_addr + target_addr_offset)), pc)) {
-      rewrite_len += (2 + it.insts_len);
-
-      size_t it_block_idx = idx++;
-      size_t it_block_len = 4 + 4;  // IT-else + IT-then
-      for (size_t i = 0, j = 0; i < it.insts_cnt; i++) {
-        bool is_thumb32 = sh_util_is_thumb32((uintptr_t)(&(it.insts[j])));
-        if (is_thumb32) {
-          it_block_len += sh_t32_get_rewrite_inst_len(it.insts[j], it.insts[j + 1]);
-          rinfo->inst_lens[idx++] = 0;
-          rinfo->inst_lens[idx++] = 0;
-          j += 2;
-        } else {
-          it_block_len += sh_t16_get_rewrite_inst_len(it.insts[j]);
-          rinfo->inst_lens[idx++] = 0;
-          j += 1;
-        }
-      }
-      rinfo->inst_lens[it_block_idx] = it_block_len;
-
-      target_addr_offset += (2 + it.insts_len);
-      pc += (2 + it.insts_len);
-    }
-    // not IT block
-    else {
-      bool is_thumb32 = sh_util_is_thumb32(target_addr + target_addr_offset);
-      size_t inst_len = (is_thumb32 ? 4 : 2);
-      rewrite_len += inst_len;
-
-      if (is_thumb32) {
-        rinfo->inst_lens[idx++] =
-            sh_t32_get_rewrite_inst_len(*((uint16_t *)(target_addr + target_addr_offset)),
-                                        *((uint16_t *)(target_addr + target_addr_offset + 2)));
-        rinfo->inst_lens[idx++] = 0;
-      } else
-        rinfo->inst_lens[idx++] =
-            sh_t16_get_rewrite_inst_len(*((uint16_t *)(target_addr + target_addr_offset)));
-
-      target_addr_offset += inst_len;
-      pc += inst_len;
-    }
-  }
-
-  rinfo->start_addr = target_addr;
-  rinfo->end_addr = target_addr + rewrite_len;
-  rinfo->buf = (uint16_t *)self->enter_addr;
-  rinfo->buf_offset = 0;
-  rinfo->inst_lens_cnt = idx;
-}
-
-static int sh_inst_hook_thumb_rewrite(sh_inst_t *self, uintptr_t target_addr, uintptr_t *orig_addr,
-                                      uintptr_t *orig_addr2, size_t *rewrite_len) {
-  // backup original instructions (length: 4 or 8 or 10)
-  memcpy((void *)(self->backup), (void *)target_addr, self->backup_len);
-
-  // package the information passed to rewrite
-  sh_txx_rewrite_info_t rinfo;
-  sh_inst_get_thumb_rewrite_info(self, target_addr, &rinfo);
-
-  // backup and rewrite original instructions
-  uintptr_t target_addr_offset = 0;
-  uintptr_t pc = target_addr + 4;
-  *rewrite_len = 0;
-  while (*rewrite_len < self->backup_len) {
-    // IT block
-    sh_t16_it_t it;
-    if (sh_t16_parse_it(&it, *((uint16_t *)(target_addr + target_addr_offset)), pc)) {
-      *rewrite_len += (2 + it.insts_len);
-
-      // save space holder point of IT-else B instruction
-      uintptr_t enter_inst_else_p = self->enter_addr + rinfo.buf_offset;
-      rinfo.buf_offset += 2;  // B<c> <label>
-      rinfo.buf_offset += 2;  // NOP
-
-      // rewrite IT block
-      size_t enter_inst_else_len = 4;  // B<c> + NOP + B + NOP
-      size_t enter_inst_then_len = 0;  // B + NOP
-      uintptr_t enter_inst_then_p = 0;
-      for (size_t i = 0, j = 0; i < it.insts_cnt; i++) {
-        if (i == it.insts_else_cnt) {
-          // save space holder point of IT-then (for B instruction)
-          enter_inst_then_p = self->enter_addr + rinfo.buf_offset;
-          rinfo.buf_offset += 2;  // B <label>
-          rinfo.buf_offset += 2;  // NOP
-
-          // fill IT-else B instruction
-          sh_t16_rewrite_it_else((uint16_t *)enter_inst_else_p, (uint16_t)enter_inst_else_len, &it);
-        }
-
-        // rewrite instructions in IT block
-        bool is_thumb32 = sh_util_is_thumb32((uintptr_t)(&(it.insts[j])));
-        size_t len;
-        if (is_thumb32)
-          len = sh_t32_rewrite((uint16_t *)(self->enter_addr + rinfo.buf_offset), it.insts[j],
-                               it.insts[j + 1], it.pcs[i], &rinfo);
-        else
-          len = sh_t16_rewrite((uint16_t *)(self->enter_addr + rinfo.buf_offset), it.insts[j], it.pcs[i],
-                               &rinfo);
-        if (0 == len) return SHADOWHOOK_ERRNO_HOOK_REWRITE_FAILED;
-        rinfo.buf_offset += len;
-        j += (is_thumb32 ? 2 : 1);
-
-        // save the total offset for ELSE/THEN in enter
-        if (i < it.insts_else_cnt)
-          enter_inst_else_len += len;
-        else
-          enter_inst_then_len += len;
-
-        if (i == it.insts_cnt - 1) {
-          // fill IT-then B instruction
-          sh_t16_rewrite_it_then((uint16_t *)enter_inst_then_p, (uint16_t)enter_inst_then_len);
-        }
-      }
-
-      target_addr_offset += (2 + it.insts_len);
-      pc += (2 + it.insts_len);
-    }
-    // not IT block
-    else {
-      bool is_thumb32 = sh_util_is_thumb32(target_addr + target_addr_offset);
-      size_t inst_len = (is_thumb32 ? 4 : 2);
-      *rewrite_len += inst_len;
-
-      // rewrite original instructions (fill in enter)
-      SH_LOG_INFO("thumb rewrite: offset %zu, pc %" PRIxPTR, rinfo.buf_offset, pc);
-      size_t len;
-      if (is_thumb32)
-        len = sh_t32_rewrite((uint16_t *)(self->enter_addr + rinfo.buf_offset),
-                             *((uint16_t *)(target_addr + target_addr_offset)),
-                             *((uint16_t *)(target_addr + target_addr_offset + 2)), pc, &rinfo);
-      else
-        len = sh_t16_rewrite((uint16_t *)(self->enter_addr + rinfo.buf_offset),
-                             *((uint16_t *)(target_addr + target_addr_offset)), pc, &rinfo);
-      if (0 == len) return SHADOWHOOK_ERRNO_HOOK_REWRITE_FAILED;
-      rinfo.buf_offset += len;
-
-      target_addr_offset += inst_len;
-      pc += inst_len;
-    }
-  }
-  SH_LOG_INFO("thumb rewrite: len %zu to %zu", *rewrite_len, rinfo.buf_offset);
-
-  // absolute jump back to remaining original instructions (fill in enter)
-  rinfo.buf_offset += sh_t32_absolute_jump((uint16_t *)(self->enter_addr + rinfo.buf_offset), true,
-                                           SH_UTIL_SET_BIT0(target_addr + *rewrite_len));
-  sh_util_clear_cache(self->enter_addr, rinfo.buf_offset);
-
-  // save original function address
-  if (NULL != orig_addr) __atomic_store_n(orig_addr, SH_UTIL_SET_BIT0(self->enter_addr), __ATOMIC_SEQ_CST);
-  if (NULL != orig_addr2) __atomic_store_n(orig_addr2, SH_UTIL_SET_BIT0(self->enter_addr), __ATOMIC_SEQ_CST);
-  return 0;
-}
-
-#ifdef SH_CONFIG_DETECT_THUMB_TAIL_ALIGNED
-static bool sh_inst_thumb_is_long_enough(uintptr_t target_addr, size_t overwrite_len, xdl_info_t *dlinfo) {
-  if (overwrite_len <= dlinfo->dli_ssize) return true;
-
-  // check align-4 in the end of symbol
-  if ((overwrite_len == dlinfo->dli_ssize + 2) && ((target_addr + dlinfo->dli_ssize) % 4 == 2)) {
-    uintptr_t sym_end = target_addr + dlinfo->dli_ssize;
-    if (0 != sh_util_mprotect(sym_end, 2, PROT_READ | PROT_WRITE | PROT_EXEC)) return false;
-
-    // should be zero-ed
-    if (0 != *((uint16_t *)sym_end)) return false;
-
-    // should not belong to any symbol
-    void *dlcache = NULL;
-    xdl_info_t dlinfo2;
-    if (sh_util_get_api_level() >= __ANDROID_API_L__) {
-      xdl_addr((void *)SH_UTIL_SET_BIT0(sym_end), &dlinfo2, &dlcache);
-    } else {
-      SH_SIG_TRY(SIGSEGV, SIGBUS) {
-        xdl_addr((void *)SH_UTIL_SET_BIT0(sym_end), &dlinfo2, &dlcache);
-      }
-      SH_SIG_CATCH() {
-        memset(&dlinfo2, 0, sizeof(dlinfo2));
-        SH_LOG_WARN("thumb detect tail aligned: crashed");
-      }
-      SH_SIG_EXIT
-    }
-    xdl_addr_clean(&dlcache);
-    if (NULL != dlinfo2.dli_sname) return false;
-
-    // trust here is useless alignment data
-    return true;
-  }
-
-  return false;
-}
-#endif
-
-#ifdef SH_CONFIG_TRY_WITH_EXIT
-
-// B T4: [-16M, +16M - 2]
-#define SH_INST_T32_B_RANGE_LOW  (16777216)
-#define SH_INST_T32_B_RANGE_HIGH (16777214)
-
-static int sh_inst_hook_thumb_with_exit(sh_inst_t *self, uintptr_t target_addr, xdl_info_t *dlinfo,
-                                        uintptr_t new_addr, uintptr_t *orig_addr, uintptr_t *orig_addr2) {
-  int r;
-  target_addr = SH_UTIL_CLEAR_BIT0(target_addr);
-  uintptr_t pc = target_addr + 4;
-  self->backup_len = 4;
-
-#ifdef SH_CONFIG_DETECT_THUMB_TAIL_ALIGNED
-  if (!sh_inst_thumb_is_long_enough(target_addr, self->backup_len, dlinfo))
-    return SHADOWHOOK_ERRNO_HOOK_SYMSZ;
-#else
-  if (dlinfo->dli_ssize < self->backup_len) return SHADOWHOOK_ERRNO_HOOK_SYMSZ;
-#endif
-
-  // alloc an exit for absolute jump
-  sh_t32_absolute_jump((uint16_t *)self->exit, true, new_addr);
-  if (0 != (r = sh_exit_alloc(&self->exit_addr, &self->exit_type, pc, dlinfo, (uint8_t *)(self->exit),
-                              sizeof(self->exit), SH_INST_T32_B_RANGE_LOW, SH_INST_T32_B_RANGE_HIGH)))
-    return r;
-
-  // rewrite
-  if (0 != sh_util_mprotect(target_addr, dlinfo->dli_ssize, PROT_READ | PROT_WRITE | PROT_EXEC)) {
-    r = SHADOWHOOK_ERRNO_MPROT;
-    goto err;
-  }
-  size_t rewrite_len = 0;
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    r = sh_inst_hook_thumb_rewrite(self, target_addr, orig_addr, orig_addr2, &rewrite_len);
-  }
-  SH_SIG_CATCH() {
-    r = SHADOWHOOK_ERRNO_HOOK_REWRITE_CRASH;
-    goto err;
-  }
-  SH_SIG_EXIT
-  if (0 != r) goto err;
-
-  // relative jump to the exit by overwriting the head of original function
-  sh_t32_relative_jump((uint16_t *)self->trampo, self->exit_addr, pc);
-  __atomic_thread_fence(__ATOMIC_SEQ_CST);
-  if (0 != (r = sh_util_write_inst(target_addr, self->trampo, self->backup_len))) goto err;
-
-  SH_LOG_INFO("thumb: hook (WITH EXIT) OK. target %" PRIxPTR " -> exit %" PRIxPTR " -> new %" PRIxPTR
-              " -> enter %" PRIxPTR " -> remaining %" PRIxPTR,
-              target_addr, self->exit_addr, new_addr, self->enter_addr,
-              SH_UTIL_SET_BIT0(target_addr + rewrite_len));
-  return 0;
-
-err:
-  sh_exit_free(self->exit_addr, self->exit_type, (uint8_t *)(self->exit), sizeof(self->exit));
-  self->exit_addr = 0;  // this is a flag for with-exit or without-exit
-  return r;
-}
-#endif
-
-static int sh_inst_hook_thumb_without_exit(sh_inst_t *self, uintptr_t target_addr, xdl_info_t *dlinfo,
-                                           uintptr_t new_addr, uintptr_t *orig_addr, uintptr_t *orig_addr2) {
-  int r;
-  target_addr = SH_UTIL_CLEAR_BIT0(target_addr);
-  bool is_align4 = (0 == (target_addr % 4));
-  self->backup_len = (is_align4 ? 8 : 10);
-
-#ifdef SH_CONFIG_DETECT_THUMB_TAIL_ALIGNED
-  if (!sh_inst_thumb_is_long_enough(target_addr, self->backup_len, dlinfo))
-    return SHADOWHOOK_ERRNO_HOOK_SYMSZ;
-#else
-  if (dlinfo->dli_ssize < self->backup_len) return SHADOWHOOK_ERRNO_HOOK_SYMSZ;
-#endif
-
-  // rewrite
-  if (0 != sh_util_mprotect(target_addr, dlinfo->dli_ssize, PROT_READ | PROT_WRITE | PROT_EXEC))
-    return SHADOWHOOK_ERRNO_MPROT;
-  size_t rewrite_len = 0;
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    r = sh_inst_hook_thumb_rewrite(self, target_addr, orig_addr, orig_addr2, &rewrite_len);
-  }
-  SH_SIG_CATCH() {
-    return SHADOWHOOK_ERRNO_HOOK_REWRITE_CRASH;
-  }
-  SH_SIG_EXIT
-  if (0 != r) return r;
-
-  // absolute jump to new function address by overwriting the head of original function
-  sh_t32_absolute_jump((uint16_t *)self->trampo, is_align4, new_addr);
-  __atomic_thread_fence(__ATOMIC_SEQ_CST);
-  if (0 != (r = sh_util_write_inst(target_addr, self->trampo, self->backup_len))) return r;
-
-  SH_LOG_INFO("thumb: hook (WITHOUT EXIT) OK. target %" PRIxPTR " -> new %" PRIxPTR " -> enter %" PRIxPTR
-              " -> remaining %" PRIxPTR,
-              target_addr, new_addr, self->enter_addr, SH_UTIL_SET_BIT0(target_addr + rewrite_len));
-  return 0;
-}
-
-static int sh_inst_hook_arm_rewrite(sh_inst_t *self, uintptr_t target_addr, uintptr_t *orig_addr,
-                                    uintptr_t *orig_addr2) {
-  // backup original instructions (length: 4 or 8)
-  memcpy((void *)(self->backup), (void *)target_addr, self->backup_len);
-
-  // package the information passed to rewrite
-  sh_a32_rewrite_info_t rinfo;
-  rinfo.overwrite_start_addr = target_addr;
-  rinfo.overwrite_end_addr = target_addr + self->backup_len;
-  rinfo.rewrite_buf = (uint32_t *)self->enter_addr;
-  rinfo.rewrite_buf_offset = 0;
-  rinfo.rewrite_inst_lens_cnt = self->backup_len / 4;
-  for (uintptr_t i = 0; i < self->backup_len; i += 4)
-    rinfo.rewrite_inst_lens[i / 4] = sh_a32_get_rewrite_inst_len(*((uint32_t *)(target_addr + i)));
-
-  // rewrite original instructions (fill in enter)
-  uintptr_t pc = target_addr + 8;
-  for (uintptr_t i = 0; i < self->backup_len; i += 4, pc += 4) {
-    size_t offset = sh_a32_rewrite((uint32_t *)(self->enter_addr + rinfo.rewrite_buf_offset),
-                                   *((uint32_t *)(target_addr + i)), pc, &rinfo);
-    if (0 == offset) return SHADOWHOOK_ERRNO_HOOK_REWRITE_FAILED;
-    rinfo.rewrite_buf_offset += offset;
-  }
-
-  // absolute jump back to remaining original instructions (fill in enter)
-  rinfo.rewrite_buf_offset += sh_a32_absolute_jump((uint32_t *)(self->enter_addr + rinfo.rewrite_buf_offset),
-                                                   target_addr + self->backup_len);
-  sh_util_clear_cache(self->enter_addr, rinfo.rewrite_buf_offset);
-
-  // save original function address
-  if (NULL != orig_addr) __atomic_store_n(orig_addr, self->enter_addr, __ATOMIC_SEQ_CST);
-  if (NULL != orig_addr2) __atomic_store_n(orig_addr2, self->enter_addr, __ATOMIC_SEQ_CST);
-  return 0;
-}
-
-#ifdef SH_CONFIG_TRY_WITH_EXIT
-
-// B A1: [-32M, +32M - 4]
-#define SH_INST_A32_B_RANGE_LOW  (33554432)
-#define SH_INST_A32_B_RANGE_HIGH (33554428)
-
-static int sh_inst_hook_arm_with_exit(sh_inst_t *self, uintptr_t target_addr, xdl_info_t *dlinfo,
-                                      uintptr_t new_addr, uintptr_t *orig_addr, uintptr_t *orig_addr2) {
-  int r;
-  uintptr_t pc = target_addr + 8;
-  self->backup_len = 4;
-
-  if (dlinfo->dli_ssize < self->backup_len) return SHADOWHOOK_ERRNO_HOOK_SYMSZ;
-
-  // alloc an exit for absolute jump
-  sh_a32_absolute_jump(self->exit, new_addr);
-  if (0 != (r = sh_exit_alloc(&self->exit_addr, &self->exit_type, pc, dlinfo, (uint8_t *)(self->exit),
-                              sizeof(self->exit), SH_INST_A32_B_RANGE_LOW, SH_INST_A32_B_RANGE_HIGH)))
-    return r;
-
-  // rewrite
-  if (0 != sh_util_mprotect(target_addr, self->backup_len, PROT_READ | PROT_WRITE | PROT_EXEC)) {
-    r = SHADOWHOOK_ERRNO_MPROT;
-    goto err;
-  }
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    r = sh_inst_hook_arm_rewrite(self, target_addr, orig_addr, orig_addr2);
-  }
-  SH_SIG_CATCH() {
-    r = SHADOWHOOK_ERRNO_HOOK_REWRITE_CRASH;
-    goto err;
-  }
-  SH_SIG_EXIT
-  if (0 != r) goto err;
-
-  // relative jump to the exit by overwriting the head of original function
-  sh_a32_relative_jump(self->trampo, self->exit_addr, pc);
-  __atomic_thread_fence(__ATOMIC_SEQ_CST);
-  if (0 != (r = sh_util_write_inst(target_addr, self->trampo, self->backup_len))) goto err;
-
-  SH_LOG_INFO("a32: hook (WITH EXIT) OK. target %" PRIxPTR " -> exit %" PRIxPTR " -> new %" PRIxPTR
-              " -> enter %" PRIxPTR " -> remaining %" PRIxPTR,
-              target_addr, self->exit_addr, new_addr, self->enter_addr, target_addr + self->backup_len);
-  return 0;
-
-err:
-  sh_exit_free(self->exit_addr, self->exit_type, (uint8_t *)(self->exit), sizeof(self->exit));
-  self->exit_addr = 0;  // this is a flag for with-exit or without-exit
-  return r;
-}
-
-#endif
-
-static int sh_inst_hook_arm_without_exit(sh_inst_t *self, uintptr_t target_addr, xdl_info_t *dlinfo,
-                                         uintptr_t new_addr, uintptr_t *orig_addr, uintptr_t *orig_addr2) {
-  int r;
-  self->backup_len = 8;
-
-  if (dlinfo->dli_ssize < self->backup_len) return SHADOWHOOK_ERRNO_HOOK_SYMSZ;
-
-  // rewrite
-  if (0 != sh_util_mprotect(target_addr, self->backup_len, PROT_READ | PROT_WRITE | PROT_EXEC))
-    return SHADOWHOOK_ERRNO_MPROT;
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    r = sh_inst_hook_arm_rewrite(self, target_addr, orig_addr, orig_addr2);
-  }
-  SH_SIG_CATCH() {
-    return SHADOWHOOK_ERRNO_HOOK_REWRITE_CRASH;
-  }
-  SH_SIG_EXIT
-  if (0 != r) return r;
-
-  // absolute jump to new function address by overwriting the head of original function
-  sh_a32_absolute_jump(self->trampo, new_addr);
-  __atomic_thread_fence(__ATOMIC_SEQ_CST);
-  if (0 != (r = sh_util_write_inst(target_addr, self->trampo, self->backup_len))) return r;
-
-  SH_LOG_INFO("a32: hook (WITHOUT EXIT) OK. target %" PRIxPTR " -> new %" PRIxPTR " -> enter %" PRIxPTR
-              " -> remaining %" PRIxPTR,
-              target_addr, new_addr, self->enter_addr, target_addr + self->backup_len);
-  return 0;
-}
-
-int sh_inst_hook(sh_inst_t *self, uintptr_t target_addr, xdl_info_t *dlinfo, uintptr_t new_addr,
-                 uintptr_t *orig_addr, uintptr_t *orig_addr2) {
-  self->enter_addr = sh_enter_alloc();
-  if (0 == self->enter_addr) return SHADOWHOOK_ERRNO_HOOK_ENTER;
-
-  int r;
-  if (SH_UTIL_IS_THUMB(target_addr)) {
-#ifdef SH_CONFIG_TRY_WITH_EXIT
-    if (0 == (r = sh_inst_hook_thumb_with_exit(self, target_addr, dlinfo, new_addr, orig_addr, orig_addr2)))
-      return r;
-#endif
-    if (0 ==
-        (r = sh_inst_hook_thumb_without_exit(self, target_addr, dlinfo, new_addr, orig_addr, orig_addr2)))
-      return r;
-  } else {
-#ifdef SH_CONFIG_TRY_WITH_EXIT
-    if (0 == (r = sh_inst_hook_arm_with_exit(self, target_addr, dlinfo, new_addr, orig_addr, orig_addr2)))
-      return r;
-#endif
-    if (0 == (r = sh_inst_hook_arm_without_exit(self, target_addr, dlinfo, new_addr, orig_addr, orig_addr2)))
-      return r;
-  }
-
-  // hook failed
-  if (NULL != orig_addr) *orig_addr = 0;
-  if (NULL != orig_addr2) *orig_addr2 = 0;
-  sh_enter_free(self->enter_addr);
-  return r;
-}
-
-int sh_inst_unhook(sh_inst_t *self, uintptr_t target_addr) {
-  int r;
-  bool is_thumb = SH_UTIL_IS_THUMB(target_addr);
-
-  if (is_thumb) target_addr = SH_UTIL_CLEAR_BIT0(target_addr);
-
-  // restore the instructions at the target address
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    r = memcmp((void *)target_addr, self->trampo, self->backup_len);
-  }
-  SH_SIG_CATCH() {
-    return SHADOWHOOK_ERRNO_UNHOOK_CMP_CRASH;
-  }
-  SH_SIG_EXIT
-  if (0 != r) return SHADOWHOOK_ERRNO_UNHOOK_TRAMPO_MISMATCH;
-  if (0 != (r = sh_util_write_inst(target_addr, self->backup, self->backup_len))) return r;
-  __atomic_thread_fence(__ATOMIC_SEQ_CST);
-
-  // free memory space for exit
-  if (0 != self->exit_addr)
-    if (0 !=
-        (r = sh_exit_free(self->exit_addr, self->exit_type, (uint8_t *)(self->exit), sizeof(self->exit))))
-      return r;
-
-  // free memory space for enter
-  sh_enter_free(self->enter_addr);
-
-  SH_LOG_INFO("%s: unhook OK. target %" PRIxPTR, is_thumb ? "thumb" : "a32", target_addr);
-  return 0;
-}
diff --git a/app/src/main/cpp/shadowhook/arch/arm/sh_inst.h b/app/src/main/cpp/shadowhook/arch/arm/sh_inst.h
deleted file mode 100644
index ed38ab7..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm/sh_inst.h
+++ /dev/null
@@ -1,41 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stdint.h>
-
-#include "xdl.h"
-
-typedef struct {
-  uint32_t trampo[4];   // align 16 // length == backup_len
-  uint8_t backup[16];   // align 16
-  uint16_t backup_len;  // == 4 or 8 or 10
-  uint16_t exit_type;
-  uintptr_t exit_addr;
-  uint32_t exit[2];
-  uintptr_t enter_addr;
-} sh_inst_t;
-
-int sh_inst_hook(sh_inst_t *self, uintptr_t target_addr, xdl_info_t *dlinfo, uintptr_t new_addr,
-                 uintptr_t *orig_addr, uintptr_t *orig_addr2);
-int sh_inst_unhook(sh_inst_t *self, uintptr_t target_addr);
diff --git a/app/src/main/cpp/shadowhook/arch/arm/sh_t16.c b/app/src/main/cpp/shadowhook/arch/arm/sh_t16.c
deleted file mode 100644
index d250526..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm/sh_t16.c
+++ /dev/null
@@ -1,284 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Pengying Xu (xupengying@bytedance.com) on 2021-04-11.
-
-#include "sh_t16.h"
-
-#include <inttypes.h>
-#include <stdbool.h>
-#include <stdint.h>
-#include <string.h>
-
-#include "sh_log.h"
-#include "sh_util.h"
-
-// https://developer.arm.com/documentation/ddi0406/latest
-// https://developer.arm.com/documentation/ddi0597/latest
-
-typedef enum {
-  IGNORED = 0,
-  IT_T1,
-  B_T1,
-  B_T2,
-  BX_T1,
-  ADD_REG_T2,
-  MOV_REG_T1,
-  ADR_T1,
-  LDR_LIT_T1,
-  CBZ_T1,
-  CBNZ_T1
-} sh_t16_type_t;
-
-static sh_t16_type_t sh_t16_get_type(uint16_t inst) {
-  if (((inst & 0xFF00u) == 0xBF00) && ((inst & 0x000Fu) != 0x0000) && ((inst & 0x00F0u) != 0x00F0))
-    return IT_T1;
-  else if (((inst & 0xF000u) == 0xD000) && ((inst & 0x0F00u) != 0x0F00) && ((inst & 0x0F00u) != 0x0E00))
-    return B_T1;
-  else if ((inst & 0xF800u) == 0xE000)
-    return B_T2;
-  else if ((inst & 0xFFF8u) == 0x4778)
-    return BX_T1;
-  else if (((inst & 0xFF78u) == 0x4478) && ((inst & 0x0087u) != 0x0085))
-    return ADD_REG_T2;
-  else if ((inst & 0xFF78u) == 0x4678)
-    return MOV_REG_T1;
-  else if ((inst & 0xF800u) == 0xA000)
-    return ADR_T1;
-  else if ((inst & 0xF800u) == 0x4800)
-    return LDR_LIT_T1;
-  else if ((inst & 0xFD00u) == 0xB100)
-    return CBZ_T1;
-  else if ((inst & 0xFD00u) == 0xB900)
-    return CBNZ_T1;
-  else
-    return IGNORED;
-}
-
-size_t sh_t16_get_rewrite_inst_len(uint16_t inst) {
-  static uint8_t map[] = {
-      4,   // IGNORED
-      0,   // IT_T1
-      12,  // B_T1
-      8,   // B_T2
-      8,   // BX_T1
-      16,  // ADD_REG_T2
-      12,  // MOV_REG_T1
-      8,   // ADR_T1
-      12,  // LDR_LIT_T1
-      12,  // CBZ_T1
-      12   // CBNZ_T1
-  };
-
-  return (size_t)(map[sh_t16_get_type(inst)]);
-}
-
-static size_t sh_t16_rewrite_b(uint16_t *buf, uint16_t inst, uintptr_t pc, sh_t16_type_t type,
-                               sh_txx_rewrite_info_t *rinfo) {
-  uint32_t addr;
-  if (type == B_T1) {
-    uint32_t imm8 = SH_UTIL_GET_BITS_16(inst, 7, 0);
-    addr = pc + SH_UTIL_SIGN_EXTEND_32(imm8 << 1u, 9u);
-    addr = SH_UTIL_SET_BIT0(addr);  // thumb -> thumb
-  } else if (type == B_T2) {
-    uint32_t imm11 = SH_UTIL_GET_BITS_16(inst, 10, 0);
-    addr = pc + SH_UTIL_SIGN_EXTEND_32(imm11 << 1u, 12u);
-    addr = SH_UTIL_SET_BIT0(addr);  // thumb -> thumb
-  } else {
-    // type == BX_T1
-    // BX PC
-    // PC must be even, and the "BX PC" instruction must be at a 4-byte aligned address,
-    // so the instruction set must be exchanged from "thumb" to "arm".
-    addr = pc;  // thumb -> arm
-  }
-  addr = sh_txx_fix_addr(addr, rinfo);
-
-  size_t idx = 0;
-  if (type == B_T1) {
-    buf[idx++] = inst & 0xFF00u;  // B<c> #0
-    buf[idx++] = 0xE003;          // B PC, #6
-  }
-  buf[idx++] = 0xF8DF;  // LDR.W PC, [PC]
-  buf[idx++] = 0xF000;  // ...
-  buf[idx++] = addr & 0xFFFFu;
-  buf[idx++] = addr >> 16u;
-  return idx * 2;  // 8 or 12
-}
-
-static size_t sh_t16_rewrite_add(uint16_t *buf, uint16_t inst, uintptr_t pc) {
-  // ADD<c> <Rdn>, PC
-  uint16_t dn = SH_UTIL_GET_BIT_16(inst, 7);
-  uint16_t rdn = SH_UTIL_GET_BITS_16(inst, 2, 0);
-  uint16_t rd = (uint16_t)(dn << 3u) | rdn;
-  uint16_t rx = (rd == 0) ? 1 : 0;  // r0 - r1
-
-  buf[0] = (uint16_t)(0xB400u | (1u << rx));         // PUSH {Rx}
-  buf[1] = 0x4802u | (uint16_t)(rx << 8u);           // LDR Rx, [PC, #8]
-  buf[2] = (inst & 0xFF87u) | (uint16_t)(rx << 3u);  // ADD Rd, Rx
-  buf[3] = (uint16_t)(0xBC00u | (1u << rx));         // POP {Rx}
-  buf[4] = 0xE002;                                   // B #4
-  buf[5] = 0xBF00;
-  buf[6] = pc & 0xFFFFu;
-  buf[7] = pc >> 16u;
-  return 16;
-}
-
-static size_t sh_t16_rewrite_mov(uint16_t *buf, uint16_t inst, uintptr_t pc) {
-  // MOV<c> <Rd>, PC
-  uint16_t D = SH_UTIL_GET_BIT_16(inst, 7);
-  uint16_t rd = SH_UTIL_GET_BITS_16(inst, 2, 0);
-  uint16_t d = (uint16_t)(D << 3u) | rd;  // r0 - r15
-
-  buf[0] = 0xF8DF;                     // LDR.W Rd, [PC, #4]
-  buf[1] = (uint16_t)(d << 12u) + 4u;  // ...
-  buf[2] = 0xE002;                     // B #4
-  buf[3] = 0xBF00;                     // NOP
-  buf[4] = pc & 0xFFFFu;
-  buf[5] = pc >> 16u;
-  return 12;
-}
-
-static size_t sh_t16_rewrite_adr(uint16_t *buf, uint16_t inst, uintptr_t pc, sh_txx_rewrite_info_t *rinfo) {
-  // ADR<c> <Rd>, <label>
-  uint16_t rd = SH_UTIL_GET_BITS_16(inst, 10, 8);  // r0 - r7
-  uint16_t imm8 = SH_UTIL_GET_BITS_16(inst, 7, 0);
-  uint32_t addr = SH_UTIL_ALIGN_4(pc) + (uint32_t)(imm8 << 2u);
-  if (sh_txx_is_addr_need_fix(addr, rinfo)) return 0;  // rewrite failed
-
-  buf[0] = 0x4800u | (uint16_t)(rd << 8u);  // LDR Rd, [PC]
-  buf[1] = 0xE001;                          // B #2
-  buf[2] = addr & 0xFFFFu;
-  buf[3] = addr >> 16u;
-  return 8;
-}
-
-static size_t sh_t16_rewrite_ldr(uint16_t *buf, uint16_t inst, uintptr_t pc, sh_txx_rewrite_info_t *rinfo) {
-  // LDR<c> <Rt>, <label>
-  uint16_t rt = SH_UTIL_GET_BITS_16(inst, 10, 8);  // r0 - r7
-  uint16_t imm8 = SH_UTIL_GET_BITS_16(inst, 7, 0);
-  uint32_t addr = SH_UTIL_ALIGN_4(pc) + (uint32_t)(imm8 << 2u);
-  if (sh_txx_is_addr_need_fix(addr, rinfo)) return 0;  // rewrite failed
-
-  buf[0] = 0x4800u | (uint16_t)(rt << 8u);  // LDR Rt, [PC]
-  buf[1] = 0xE001;                          // B #2
-  buf[2] = addr & 0xFFFFu;
-  buf[3] = addr >> 16u;
-  buf[4] = 0x6800u | (uint16_t)(rt << 3u) | rt;  // LDR Rt, [Rt]
-  buf[5] = 0xBF00;                               // NOP
-  return 12;
-}
-
-static size_t sh_t16_rewrite_cb(uint16_t *buf, uint16_t inst, uintptr_t pc, sh_txx_rewrite_info_t *rinfo) {
-  // CB{N}Z <Rn>, <label>
-  uint16_t i = SH_UTIL_GET_BIT_16(inst, 9);
-  uint16_t imm5 = SH_UTIL_GET_BITS_16(inst, 7, 3);
-  uint32_t imm32 = (uint32_t)(i << 6u) | (uint32_t)(imm5 << 1u);
-  uint32_t addr = SH_UTIL_SET_BIT0(pc + imm32);  // thumb -> thumb
-  addr = sh_txx_fix_addr(addr, rinfo);
-
-  buf[0] = inst & 0xFD07u;  // CB(N)Z Rn, #0
-  buf[1] = 0xE003;          // B PC, #6
-  buf[2] = 0xF8DF;          // LDR.W PC, [PC]
-  buf[3] = 0xF000;          // ...
-  buf[4] = addr & 0xFFFFu;
-  buf[5] = addr >> 16u;
-  return 12;
-}
-
-size_t sh_t16_rewrite(uint16_t *buf, uint16_t inst, uintptr_t pc, sh_txx_rewrite_info_t *rinfo) {
-  sh_t16_type_t type = sh_t16_get_type(inst);
-  SH_LOG_INFO("t16 rewrite: type %d, inst %" PRIx16, type, inst);
-
-  if (type == B_T1 || type == B_T2 || type == BX_T1)
-    return sh_t16_rewrite_b(buf, inst, pc, type, rinfo);
-  else if (type == ADD_REG_T2)
-    return sh_t16_rewrite_add(buf, inst, pc);
-  else if (type == MOV_REG_T1)
-    return sh_t16_rewrite_mov(buf, inst, pc);
-  else if (type == ADR_T1)
-    return sh_t16_rewrite_adr(buf, inst, pc, rinfo);
-  else if (type == LDR_LIT_T1)
-    return sh_t16_rewrite_ldr(buf, inst, pc, rinfo);
-  else if (type == CBZ_T1 || type == CBNZ_T1)
-    return sh_t16_rewrite_cb(buf, inst, pc, rinfo);
-  else {
-    // IGNORED
-    buf[0] = inst;
-    buf[1] = 0xBF00;  // NOP
-    return 4;
-  }
-}
-
-static size_t sh_t16_get_it_insts_count(uint16_t inst) {
-  if ((inst & 0x1u) != 0) return 4;
-  if ((inst & 0x2u) != 0) return 3;
-  if ((inst & 0x4u) != 0) return 2;
-  return 1;
-}
-
-bool sh_t16_parse_it(sh_t16_it_t *it, uint16_t inst, uintptr_t pc) {
-  if (IT_T1 != sh_t16_get_type(inst)) return false;
-  SH_LOG_INFO("t16 rewrite: type IT, inst %" PRIx16, inst);
-
-  // address of the first inst in the IT block, skip the IT inst itself (2 bytes)
-  uintptr_t target_addr = pc - 4 + 2;
-
-  it->firstcond = (uint8_t)(inst >> 4u);
-  uint8_t firstcond_0 = it->firstcond & 1u;
-
-  memset(it, 0, sizeof(sh_t16_it_t));
-  it->insts_cnt = sh_t16_get_it_insts_count(inst);
-
-  size_t insts_idx = 0, pcs_idx = 0;
-  for (int parse_else = 1; parse_else >= 0; parse_else--)  // round 0: parse ELSE, round 1: THEN
-  {
-    uintptr_t target_offset = 0;
-    for (size_t i = 0; i < it->insts_cnt; i++) {
-      bool is_thumb32 = sh_util_is_thumb32(target_addr + target_offset);
-      uint8_t mask_x = (uint8_t)(inst >> (uint16_t)(4 - i)) & 1u;
-
-      if ((parse_else && mask_x != firstcond_0) ||  // parse ELSE or
-          (!parse_else && mask_x == firstcond_0))   // parse THEN
-      {
-        it->insts[insts_idx++] = *((uint16_t *)(target_addr + target_offset));
-        if (is_thumb32) it->insts[insts_idx++] = *((uint16_t *)(target_addr + target_offset + 2));
-
-        it->pcs[pcs_idx++] = target_addr + target_offset + 4;
-        if (parse_else) it->insts_else_cnt++;
-      }
-
-      target_offset += (is_thumb32 ? 4 : 2);
-    }
-  }
-  it->insts_len = insts_idx * 2;
-
-  return true;
-}
-
-void sh_t16_rewrite_it_else(uint16_t *buf, uint16_t imm9, sh_t16_it_t *it) {
-  buf[0] = 0xD000u | (uint16_t)(it->firstcond << 8u) | (uint16_t)(imm9 >> 1u);  // B<c> <label>
-  buf[1] = 0xBF00;                                                              // NOP
-}
-
-void sh_t16_rewrite_it_then(uint16_t *buf, uint16_t imm12) {
-  buf[0] = 0xE000u | (uint16_t)(imm12 >> 1u);  // B <label>
-  buf[1] = 0xBF00;                             // NOP
-}
diff --git a/app/src/main/cpp/shadowhook/arch/arm/sh_t16.h b/app/src/main/cpp/shadowhook/arch/arm/sh_t16.h
deleted file mode 100644
index 9d68d79..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm/sh_t16.h
+++ /dev/null
@@ -1,46 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Pengying Xu (xupengying@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stdbool.h>
-#include <stddef.h>
-#include <stdint.h>
-
-#include "sh_txx.h"
-
-typedef struct {
-  uint16_t insts[8];
-  size_t insts_len;       // 2 - 16 (bytes)
-  size_t insts_cnt;       // 1 - 4
-  size_t insts_else_cnt;  // 0 - 3
-  uintptr_t pcs[4];
-  uint8_t firstcond;
-  uint8_t padding[3];
-} sh_t16_it_t;
-
-bool sh_t16_parse_it(sh_t16_it_t *it, uint16_t inst, uintptr_t pc);
-void sh_t16_rewrite_it_else(uint16_t *buf, uint16_t imm9, sh_t16_it_t *it);
-void sh_t16_rewrite_it_then(uint16_t *buf, uint16_t imm12);
-
-size_t sh_t16_get_rewrite_inst_len(uint16_t inst);
-size_t sh_t16_rewrite(uint16_t *buf, uint16_t inst, uintptr_t pc, sh_txx_rewrite_info_t *rinfo);
diff --git a/app/src/main/cpp/shadowhook/arch/arm/sh_t32.c b/app/src/main/cpp/shadowhook/arch/arm/sh_t32.c
deleted file mode 100644
index bb9e859..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm/sh_t32.c
+++ /dev/null
@@ -1,408 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_t32.h"
-
-#include <inttypes.h>
-#include <stdint.h>
-
-#include "sh_log.h"
-#include "sh_util.h"
-
-// https://developer.arm.com/documentation/ddi0406/latest
-// https://developer.arm.com/documentation/ddi0597/latest
-
-typedef enum {
-  IGNORED = 0,
-  B_T3,
-  B_T4,
-  BL_IMM_T1,
-  BLX_IMM_T2,
-  ADR_T2,
-  ADR_T3,
-  LDR_LIT_T2,
-  LDR_LIT_PC_T2,
-  LDRB_LIT_T1,
-  LDRD_LIT_T1,
-  LDRH_LIT_T1,
-  LDRSB_LIT_T1,
-  LDRSH_LIT_T1,
-  PLD_LIT_T1,
-  PLI_LIT_T3,
-  TBB_T1,
-  TBH_T1,
-  VLDR_LIT_T1
-} sh_t32_type_t;
-
-static sh_t32_type_t sh_t32_get_type(uint32_t inst) {
-  if (((inst & 0xF800D000) == 0xF0008000) && ((inst & 0x03800000u) != 0x03800000u))
-    return B_T3;
-  else if ((inst & 0xF800D000) == 0xF0009000)
-    return B_T4;
-  else if ((inst & 0xF800D000) == 0xF000D000)
-    return BL_IMM_T1;
-  else if ((inst & 0xF800D000) == 0xF000C000)
-    return BLX_IMM_T2;
-  else if ((inst & 0xFBFF8000) == 0xF2AF0000)
-    return ADR_T2;
-  else if ((inst & 0xFBFF8000) == 0xF20F0000)
-    return ADR_T3;
-  else if ((inst & 0xFF7F0000) == 0xF85F0000)
-    return ((inst & 0x0000F000u) == 0x0000F000) ? LDR_LIT_PC_T2 : LDR_LIT_T2;
-  else if (((inst & 0xFF7F0000) == 0xF81F0000) && ((inst & 0xF000u) != 0xF000u))
-    return LDRB_LIT_T1;
-  else if ((inst & 0xFF7F0000) == 0xE95F0000)
-    return LDRD_LIT_T1;
-  else if (((inst & 0xFF7F0000) == 0xF83F0000) && ((inst & 0xF000u) != 0xF000u))
-    return LDRH_LIT_T1;
-  else if (((inst & 0xFF7F0000) == 0xF91F0000) && ((inst & 0xF000u) != 0xF000u))
-    return LDRSB_LIT_T1;
-  else if (((inst & 0xFF7F0000) == 0xF93F0000) && ((inst & 0xF000u) != 0xF000u))
-    return LDRSH_LIT_T1;
-  else if ((inst & 0xFF7FF000) == 0xF81FF000)
-    return PLD_LIT_T1;
-  else if ((inst & 0xFF7FF000) == 0xF91FF000)
-    return PLI_LIT_T3;
-  else if ((inst & 0xFFF0FFF0) == 0xE8D0F000)
-    return TBB_T1;
-  else if ((inst & 0xFFF0FFF0) == 0xE8D0F010)
-    return TBH_T1;
-  else if ((inst & 0xFF3F0C00) == 0xED1F0800)
-    return VLDR_LIT_T1;
-  else
-    return IGNORED;
-}
-
-size_t sh_t32_get_rewrite_inst_len(uint16_t high_inst, uint16_t low_inst) {
-  static uint8_t map[] = {
-      4,   // IGNORED
-      12,  // B_T3
-      8,   // B_T4
-      12,  // BL_IMM_T1
-      12,  // BLX_IMM_T2
-      12,  // ADR_T2
-      12,  // ADR_T3
-      16,  // LDR_LIT_T2
-      24,  // LDR_LIT_PC_T2
-      16,  // LDRB_LIT_T1
-      16,  // LDRD_LIT_T1
-      16,  // LDRH_LIT_T1
-      16,  // LDRSB_LIT_T1
-      16,  // LDRSH_LIT_T1
-      20,  // PLD_LIT_T1
-      20,  // PLI_LIT_T3
-      32,  // TBB_T1
-      32,  // TBH_T1
-      24   // VLDR_LIT_T1
-  };
-
-  uint32_t inst = (uint32_t)(high_inst << 16u) | low_inst;
-  return (size_t)(map[sh_t32_get_type(inst)]);
-}
-
-static size_t sh_t32_rewrite_b(uint16_t *buf, uint16_t high_inst, uint16_t low_inst, uintptr_t pc,
-                               sh_t32_type_t type, sh_txx_rewrite_info_t *rinfo) {
-  uint32_t j1 = SH_UTIL_GET_BIT_16(low_inst, 13);
-  uint32_t j2 = SH_UTIL_GET_BIT_16(low_inst, 11);
-  uint32_t s = SH_UTIL_GET_BIT_16(high_inst, 10);
-  uint32_t i1 = !(j1 ^ s);
-  uint32_t i2 = !(j2 ^ s);
-
-  uint32_t addr;
-  if (type == B_T3) {
-    uint32_t x =
-        (s << 20u) | (j2 << 19u) | (j1 << 18u) | ((high_inst & 0x3Fu) << 12u) | ((low_inst & 0x7FFu) << 1u);
-    uint32_t imm32 = SH_UTIL_SIGN_EXTEND_32(x, 21u);
-    addr = SH_UTIL_SET_BIT0(pc + imm32);  // thumb -> thumb
-  } else if (type == B_T4) {
-    uint32_t x =
-        (s << 24u) | (i1 << 23u) | (i2 << 22u) | ((high_inst & 0x3FFu) << 12u) | ((low_inst & 0x7FFu) << 1u);
-    uint32_t imm32 = SH_UTIL_SIGN_EXTEND_32(x, 25u);
-    addr = SH_UTIL_SET_BIT0(pc + imm32);  // thumb -> thumb
-  } else if (type == BL_IMM_T1) {
-    uint32_t x =
-        (s << 24u) | (i1 << 23u) | (i2 << 22u) | ((high_inst & 0x3FFu) << 12u) | ((low_inst & 0x7FFu) << 1u);
-    uint32_t imm32 = SH_UTIL_SIGN_EXTEND_32(x, 25u);
-    addr = SH_UTIL_SET_BIT0(pc + imm32);  // thumb -> thumb
-  } else                                  // type == BLX_IMM_T2
-  {
-    uint32_t x =
-        (s << 24u) | (i1 << 23u) | (i2 << 22u) | ((high_inst & 0x3FFu) << 12u) | ((low_inst & 0x7FEu) << 1u);
-    uint32_t imm32 = SH_UTIL_SIGN_EXTEND_32(x, 25u);
-    // In BL and BLX instructions, only when the target instruction set is "arm",
-    // you need to do 4-byte alignment for PC.
-    addr = SH_UTIL_ALIGN_4(pc) + imm32;  // thumb -> arm, align4
-  }
-  addr = sh_txx_fix_addr(addr, rinfo);
-
-  size_t idx = 0;
-  if (type == B_T3) {
-    uint32_t cond = SH_UTIL_GET_BITS_16(high_inst, 9, 6);
-    buf[idx++] = 0xD000u | (uint16_t)(cond << 8u);  // B<c> #0
-    buf[idx++] = 0xE003;                            // B #6
-  } else if (type == BL_IMM_T1 || type == BLX_IMM_T2) {
-    buf[idx++] = 0xF20F;  // ADD LR, PC, #9
-    buf[idx++] = 0x0E09;  // ...
-  }
-  buf[idx++] = 0xF8DF;  // LDR.W PC, [PC]
-  buf[idx++] = 0xF000;  // ...
-  buf[idx++] = addr & 0xFFFFu;
-  buf[idx++] = addr >> 16u;
-  return idx * 2;  // 8 or 12
-}
-
-static size_t sh_t32_rewrite_adr(uint16_t *buf, uint16_t high_inst, uint16_t low_inst, uintptr_t pc,
-                                 sh_t32_type_t type, sh_txx_rewrite_info_t *rinfo) {
-  uint32_t rt = SH_UTIL_GET_BITS_16(low_inst, 11, 8);  // r0 - r14
-  uint32_t i = SH_UTIL_GET_BIT_16(high_inst, 10);
-  uint32_t imm3 = SH_UTIL_GET_BITS_16(low_inst, 14, 12);
-  uint32_t imm8 = SH_UTIL_GET_BITS_16(low_inst, 7, 0);
-  uint32_t imm32 = (i << 11u) | (imm3 << 8u) | imm8;
-  uint32_t addr = (type == ADR_T2 ? (SH_UTIL_ALIGN_4(pc) - imm32) : (SH_UTIL_ALIGN_4(pc) + imm32));
-  if (sh_txx_is_addr_need_fix(addr, rinfo)) return 0;  // rewrite failed
-
-  buf[0] = 0xF8DF;                      // LDR.W Rt, [PC, #4]
-  buf[1] = (uint16_t)(rt << 12u) + 4u;  // ...
-  buf[2] = 0xE002;                      // B #4
-  buf[3] = 0xBF00;                      // NOP
-  buf[4] = addr & 0xFFFFu;
-  buf[5] = addr >> 16u;
-  return 12;
-}
-
-static size_t sh_t32_rewrite_ldr(uint16_t *buf, uint16_t high_inst, uint16_t low_inst, uintptr_t pc,
-                                 sh_t32_type_t type, sh_txx_rewrite_info_t *rinfo) {
-  uint32_t u = SH_UTIL_GET_BIT_16(high_inst, 7);
-  uint32_t rt = SH_UTIL_GET_BITS_16(low_inst, 15, 12);  // r0 - r15
-  uint32_t rt2 = 0;                                     // r0 - r15
-  uint32_t addr;
-
-  if (type == LDRD_LIT_T1) {
-    rt2 = SH_UTIL_GET_BITS_16(low_inst, 11, 8);
-    uint32_t imm8 = SH_UTIL_GET_BITS_16(low_inst, 7, 0);
-    addr = (u ? SH_UTIL_ALIGN_4(pc) + (imm8 << 2u) : SH_UTIL_ALIGN_4(pc) - (imm8 << 2u));
-  } else {
-    uint32_t imm12 = (uint32_t)SH_UTIL_GET_BITS_16(low_inst, 11, 0);
-    addr = (u ? SH_UTIL_ALIGN_4(pc) + imm12 : SH_UTIL_ALIGN_4(pc) - imm12);
-  }
-  if (sh_txx_is_addr_need_fix(addr, rinfo)) return 0;  // rewrite failed
-
-  if (type == LDR_LIT_PC_T2 && rt == 0xF)  // Rt == PC
-  {
-    buf[0] = 0xB403;          // PUSH {R0, R1}
-    buf[1] = 0xBF00;          // NOP
-    buf[2] = 0xF8DF;          // LDR.W R0, [PC, #4]
-    buf[3] = 0x0004;          // ...
-    buf[4] = 0xE002;          // B #4
-    buf[5] = 0xBF00;          // NOP
-    buf[6] = addr & 0xFFFFu;  //
-    buf[7] = addr >> 16u;     //
-    buf[8] = 0xF8D0;          // LDR.W R0, [R0]
-    buf[9] = 0x0000;          // ...
-    buf[10] = 0x9001;         // STR R0, [SP, #4]
-    buf[11] = 0xBD01;         // POP {R0, PC}
-    return 24;
-  } else {
-    buf[0] = 0xF8DF;                      // LDR.W Rt, [PC, #4]
-    buf[1] = (uint16_t)(rt << 12u) | 4u;  // ...
-    buf[2] = 0xE002;                      // B #4
-    buf[3] = 0xBF00;                      // NOP
-    buf[4] = addr & 0xFFFFu;
-    buf[5] = addr >> 16u;
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wswitch"
-    switch (type) {
-      case LDR_LIT_T2:
-        buf[6] = (uint16_t)(0xF8D0 + rt);  // LDR.W Rt, [Rt]
-        buf[7] = (uint16_t)(rt << 12u);    // ...
-        break;
-      case LDRB_LIT_T1:
-        buf[6] = (uint16_t)(0xF890 + rt);  // LDRB.W Rt, [Rt]
-        buf[7] = (uint16_t)(rt << 12u);    // ...
-        break;
-      case LDRD_LIT_T1:
-        buf[6] = (uint16_t)(0xE9D0 + rt);                        // LDRD Rt, Rt2, [Rt]
-        buf[7] = (uint16_t)(rt << 12u) + (uint16_t)(rt2 << 8u);  // ...
-        break;
-      case LDRH_LIT_T1:
-        buf[6] = (uint16_t)(0xF8B0 + rt);  // LDRH.W Rt, [Rt]
-        buf[7] = (uint16_t)(rt << 12u);    // ...
-        break;
-      case LDRSB_LIT_T1:
-        buf[6] = (uint16_t)(0xF990 + rt);  // LDRSB.W Rt, [Rt]
-        buf[7] = (uint16_t)(rt << 12u);    // ...
-        break;
-      case LDRSH_LIT_T1:
-        buf[6] = (uint16_t)(0xF9B0 + rt);  // LDRSH.W Rt, [Rt]
-        buf[7] = (uint16_t)(rt << 12u);    // ...
-        break;
-    }
-#pragma clang diagnostic pop
-    return 16;
-  }
-}
-
-static size_t sh_t32_rewrite_pl(uint16_t *buf, uint16_t high_inst, uint16_t low_inst, uintptr_t pc,
-                                sh_t32_type_t type, sh_txx_rewrite_info_t *rinfo) {
-  uint32_t u = SH_UTIL_GET_BIT_16(high_inst, 7);
-  uint32_t imm12 = SH_UTIL_GET_BITS_16(low_inst, 11, 0);
-  uint32_t addr = (u ? SH_UTIL_ALIGN_4(pc) + imm12 : SH_UTIL_ALIGN_4(pc) - imm12);
-  addr = sh_txx_fix_addr(addr, rinfo);
-
-  buf[0] = 0xB401;  // PUSH {R0}
-  buf[1] = 0xBF00;  // NOP
-  buf[2] = 0xF8DF;  // LDR.W R0, [PC, #8]
-  buf[3] = 0x0008;  // ...
-  if (type == PLD_LIT_T1) {
-    buf[4] = 0xF890;  // PLD [R0]
-    buf[5] = 0xF000;  // ...
-  } else {
-    buf[4] = 0xF990;  // PLI [R0]
-    buf[5] = 0xF000;  // ...
-  }
-  buf[6] = 0xBC01;  // POP {R0}
-  buf[7] = 0xE001;  // B #2
-  buf[8] = addr & 0xFFFFu;
-  buf[9] = addr >> 16u;
-  return 20;
-}
-
-static size_t sh_t32_rewrite_tb(uint16_t *buf, uint16_t high_inst, uint16_t low_inst, uintptr_t pc,
-                                sh_t32_type_t type, sh_txx_rewrite_info_t *rinfo) {
-  // If TBB/TBH is not the last instruction that needs to be rewritten,
-  // the rewriting can NOT be completed.
-  uintptr_t target_addr = SH_UTIL_CLEAR_BIT0(pc - 4);
-  if (target_addr + 4 != rinfo->end_addr) return 0;  // rewrite failed
-
-  uint32_t rn = SH_UTIL_GET_BITS_16(high_inst, 3, 0);
-  uint32_t rm = SH_UTIL_GET_BITS_16(low_inst, 3, 0);
-  uint32_t rx, ry;  // r0 - r7
-  for (rx = 7;; --rx)
-    if (rx != rn && rx != rm) break;
-  for (ry = 7;; --ry)
-    if (ry != rn && ry != rm && ry != rx) break;
-
-  buf[0] = (uint16_t)(0xB500u | (1u << rx) | (1u << ry));  // PUSH {Rx, Ry, LR}
-  buf[1] = 0xBF00;                                         // NOP
-  buf[2] = 0xF8DF;                                         // LDR.W Rx, [PC, #20]
-  buf[3] = (uint16_t)(rx << 12u) | 20u;                    // ...
-  if (type == TBB_T1) {
-    buf[4] = (uint16_t)(0xEB00u | (rn == 0xF ? rx : rn));  // ADD.W Ry, Rx|Rn, Rm
-    buf[5] = (uint16_t)(0x0000u | (ry << 8u) | rm);        // ...
-    buf[6] = (uint16_t)(0x7800u | (ry << 3u) | ry);        // LDRB Ry, [Ry]
-    buf[7] = 0xBF00;                                       // NOP
-  } else {
-    buf[4] = (uint16_t)(0xEB00u | (rn == 0xF ? rx : rn));  // ADD.W Ry, Rx|Rn, Rm, LSL #1
-    buf[5] = (uint16_t)(0x0040u | (ry << 8u) | rm);        // ...
-    buf[6] = (uint16_t)(0x8800u | (ry << 3u) | ry);        // LDRH Ry, [Ry]
-    buf[7] = 0xBF00;                                       // NOP
-  }
-  buf[8] = (uint16_t)(0xEB00u | rx);                        // ADD Rx, Rx, Ry, LSL #1
-  buf[9] = (uint16_t)(0x0040u | (rx << 8u) | ry);           // ...
-  buf[10] = (uint16_t)(0x3001u | (rx << 8u));               // ADD Rx, #1
-  buf[11] = (uint16_t)(0x9002u | (rx << 8u));               // STR Rx, [SP, #8]
-  buf[12] = (uint16_t)(0xBD00u | (1u << rx) | (1u << ry));  // POP {Rx, Ry, PC}
-  buf[13] = 0xBF00;                                         // NOP
-  buf[14] = pc & 0xFFFFu;
-  buf[15] = pc >> 16u;
-  return 32;
-}
-
-static size_t sh_t32_rewrite_vldr(uint16_t *buf, uint16_t high_inst, uint16_t low_inst, uintptr_t pc,
-                                  sh_txx_rewrite_info_t *rinfo) {
-  uint32_t u = SH_UTIL_GET_BIT_16(high_inst, 7);
-  uint32_t D = SH_UTIL_GET_BIT_16(high_inst, 6);
-  uint32_t vd = SH_UTIL_GET_BITS_16(low_inst, 15, 12);
-  uint32_t size = SH_UTIL_GET_BITS_16(low_inst, 9, 8);
-  uint32_t imm8 = SH_UTIL_GET_BITS_16(low_inst, 7, 0);
-  uint32_t esize = (8u << size);
-  uint32_t imm32 = (esize == 16 ? imm8 << 1u : imm8 << 2u);
-  uint32_t addr = (u ? SH_UTIL_ALIGN_4(pc) + imm32 : SH_UTIL_ALIGN_4(pc) - imm32);
-  if (sh_txx_is_addr_need_fix(addr, rinfo)) return 0;  // rewrite failed
-
-  buf[0] = 0xB401;                                       // PUSH {R0}
-  buf[1] = 0xBF00;                                       // NOP
-  buf[2] = 0xF8DF;                                       // LDR.W R0, [PC, #4]
-  buf[3] = 0x0004;                                       // ...
-  buf[4] = 0xE002;                                       // B #4
-  buf[5] = 0xBF00;                                       // NOP
-  buf[6] = addr & 0xFFFFu;                               //
-  buf[7] = addr >> 16u;                                  //
-  buf[8] = (uint16_t)(0xED90u | D << 6u);                // VLDR Sd|Dd, [R0]
-  buf[9] = (uint16_t)(0x800u | vd << 12u | size << 8u);  // ...
-  buf[10] = 0xBC01;                                      // POP {R0}
-  buf[11] = 0xBF00;                                      // NOP
-  return 24;
-}
-
-size_t sh_t32_rewrite(uint16_t *buf, uint16_t high_inst, uint16_t low_inst, uintptr_t pc,
-                      sh_txx_rewrite_info_t *rinfo) {
-  uint32_t inst = (uint32_t)(high_inst << 16u) | low_inst;
-  sh_t32_type_t type = sh_t32_get_type(inst);
-  SH_LOG_INFO("t32 rewrite: type %d, high inst %" PRIx16 ", low inst %" PRIx16, type, high_inst, low_inst);
-
-  if (type == B_T3 || type == B_T4 || type == BL_IMM_T1 || type == BLX_IMM_T2)
-    return sh_t32_rewrite_b(buf, high_inst, low_inst, pc, type, rinfo);
-  else if (type == ADR_T2 || type == ADR_T3)
-    return sh_t32_rewrite_adr(buf, high_inst, low_inst, pc, type, rinfo);
-  else if (type == LDR_LIT_T2 || type == LDR_LIT_PC_T2 || type == LDRB_LIT_T1 || type == LDRD_LIT_T1 ||
-           type == LDRH_LIT_T1 || type == LDRSB_LIT_T1 || type == LDRSH_LIT_T1)
-    return sh_t32_rewrite_ldr(buf, high_inst, low_inst, pc, type, rinfo);
-  else if (type == PLD_LIT_T1 || type == PLI_LIT_T3)
-    return sh_t32_rewrite_pl(buf, high_inst, low_inst, pc, type, rinfo);
-  else if (type == TBB_T1 || type == TBH_T1)
-    return sh_t32_rewrite_tb(buf, high_inst, low_inst, pc, type, rinfo);
-  else if (type == VLDR_LIT_T1)
-    return sh_t32_rewrite_vldr(buf, high_inst, low_inst, pc, rinfo);
-  else {
-    // IGNORED
-    buf[0] = high_inst;
-    buf[1] = low_inst;
-    return 4;
-  }
-}
-
-size_t sh_t32_absolute_jump(uint16_t *buf, bool is_align4, uintptr_t addr) {
-  size_t i = 0;
-  if (!is_align4) buf[i++] = 0xBF00;  // NOP
-  buf[i++] = 0xF8DF;                  // LDR.W PC, [PC]
-  buf[i++] = 0xF000;                  // ...
-  buf[i++] = addr & 0xFFFFu;
-  buf[i++] = addr >> 16u;
-  return i * 2;
-}
-
-size_t sh_t32_relative_jump(uint16_t *buf, uintptr_t addr, uintptr_t pc) {
-  uint32_t imm32 = addr - pc;
-  uint32_t s = SH_UTIL_GET_BIT_32(imm32, 24);
-  uint32_t i1 = SH_UTIL_GET_BIT_32(imm32, 23);
-  uint32_t i2 = SH_UTIL_GET_BIT_32(imm32, 22);
-  uint32_t imm10 = SH_UTIL_GET_BITS_32(imm32, 21, 12);
-  uint32_t imm11 = SH_UTIL_GET_BITS_32(imm32, 11, 1);
-  uint32_t j1 = (!i1) ^ s;
-  uint32_t j2 = (!i2) ^ s;
-
-  buf[0] = (uint16_t)(0xF000u | (s << 10u) | imm10);
-  buf[1] = (uint16_t)(0x9000u | (j1 << 13u) | (j2 << 11u) | imm11);
-  return 4;
-}
diff --git a/app/src/main/cpp/shadowhook/arch/arm/sh_t32.h b/app/src/main/cpp/shadowhook/arch/arm/sh_t32.h
deleted file mode 100644
index 1dc1179..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm/sh_t32.h
+++ /dev/null
@@ -1,36 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stdbool.h>
-#include <stddef.h>
-#include <stdint.h>
-
-#include "sh_txx.h"
-
-size_t sh_t32_get_rewrite_inst_len(uint16_t high_inst, uint16_t low_inst);
-size_t sh_t32_rewrite(uint16_t *buf, uint16_t high_inst, uint16_t low_inst, uintptr_t pc,
-                      sh_txx_rewrite_info_t *rinfo);
-
-size_t sh_t32_absolute_jump(uint16_t *buf, bool is_align4, uintptr_t addr);
-size_t sh_t32_relative_jump(uint16_t *buf, uintptr_t addr, uintptr_t pc);
diff --git a/app/src/main/cpp/shadowhook/arch/arm/sh_txx.c b/app/src/main/cpp/shadowhook/arch/arm/sh_txx.c
deleted file mode 100644
index 79cefdb..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm/sh_txx.c
+++ /dev/null
@@ -1,60 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_txx.h"
-
-#include <inttypes.h>
-#include <stdbool.h>
-#include <stdint.h>
-#include <string.h>
-
-#include "sh_log.h"
-#include "sh_util.h"
-
-bool sh_txx_is_addr_need_fix(uintptr_t addr, sh_txx_rewrite_info_t *rinfo) {
-  return (rinfo->start_addr <= addr && addr < rinfo->end_addr);
-}
-
-uintptr_t sh_txx_fix_addr(uintptr_t addr, sh_txx_rewrite_info_t *rinfo) {
-  bool is_thumb = SH_UTIL_IS_THUMB(addr);
-
-  if (is_thumb) addr = SH_UTIL_CLEAR_BIT0(addr);
-
-  if (rinfo->start_addr <= addr && addr < rinfo->end_addr) {
-    uintptr_t cursor_addr = rinfo->start_addr;
-    size_t offset = 0;
-    for (size_t i = 0; i < rinfo->inst_lens_cnt; i++) {
-      if (cursor_addr >= addr) break;
-      cursor_addr += 2;
-      offset += rinfo->inst_lens[i];
-    }
-    uintptr_t fixed_addr = (uintptr_t)rinfo->buf + offset;
-    if (is_thumb) fixed_addr = SH_UTIL_SET_BIT0(fixed_addr);
-
-    SH_LOG_INFO("txx rewrite: fix addr %" PRIxPTR " -> %" PRIxPTR, addr, fixed_addr);
-    return fixed_addr;
-  }
-
-  if (is_thumb) addr = SH_UTIL_SET_BIT0(addr);
-  return addr;
-}
diff --git a/app/src/main/cpp/shadowhook/arch/arm/sh_txx.h b/app/src/main/cpp/shadowhook/arch/arm/sh_txx.h
deleted file mode 100644
index f5b9fae..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm/sh_txx.h
+++ /dev/null
@@ -1,39 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stdbool.h>
-#include <stddef.h>
-#include <stdint.h>
-
-typedef struct {
-  uintptr_t start_addr;
-  uintptr_t end_addr;
-  uint16_t *buf;
-  size_t buf_offset;
-  size_t inst_lens[13];  // 26 / 2 = 13
-  size_t inst_lens_cnt;
-} sh_txx_rewrite_info_t;
-
-bool sh_txx_is_addr_need_fix(uintptr_t addr, sh_txx_rewrite_info_t *rinfo);
-uintptr_t sh_txx_fix_addr(uintptr_t addr, sh_txx_rewrite_info_t *rinfo);
diff --git a/app/src/main/cpp/shadowhook/arch/arm64/sh_a64.c b/app/src/main/cpp/shadowhook/arch/arm64/sh_a64.c
deleted file mode 100644
index cd9546b..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm64/sh_a64.c
+++ /dev/null
@@ -1,310 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_a64.h"
-
-#include <inttypes.h>
-#include <sh_util.h>
-#include <stdint.h>
-
-#include "sh_log.h"
-
-// https://developer.arm.com/documentation/ddi0487/latest
-// https://developer.arm.com/documentation/ddi0602/latest
-
-typedef enum {
-  IGNORED = 0,
-  B,
-  B_COND,
-  BL,
-  ADR,
-  ADRP,
-  LDR_LIT_32,
-  LDR_LIT_64,
-  LDRSW_LIT,
-  PRFM_LIT,
-  LDR_SIMD_LIT_32,
-  LDR_SIMD_LIT_64,
-  LDR_SIMD_LIT_128,
-  CBZ,
-  CBNZ,
-  TBZ,
-  TBNZ
-} sh_a64_type_t;
-
-static sh_a64_type_t sh_a64_get_type(uint32_t inst) {
-  if ((inst & 0xFC000000) == 0x14000000)
-    return B;
-  else if ((inst & 0xFF000010) == 0x54000000)
-    return B_COND;
-  else if ((inst & 0xFC000000) == 0x94000000)
-    return BL;
-  else if ((inst & 0x9F000000) == 0x10000000)
-    return ADR;
-  else if ((inst & 0x9F000000) == 0x90000000)
-    return ADRP;
-  else if ((inst & 0xFF000000) == 0x18000000)
-    return LDR_LIT_32;
-  else if ((inst & 0xFF000000) == 0x58000000)
-    return LDR_LIT_64;
-  else if ((inst & 0xFF000000) == 0x98000000)
-    return LDRSW_LIT;
-  else if ((inst & 0xFF000000) == 0xD8000000)
-    return PRFM_LIT;
-  else if ((inst & 0xFF000000) == 0x1C000000)
-    return LDR_SIMD_LIT_32;
-  else if ((inst & 0xFF000000) == 0x5C000000)
-    return LDR_SIMD_LIT_64;
-  else if ((inst & 0xFF000000) == 0x9C000000)
-    return LDR_SIMD_LIT_128;
-  else if ((inst & 0x7F000000u) == 0x34000000)
-    return CBZ;
-  else if ((inst & 0x7F000000u) == 0x35000000)
-    return CBNZ;
-  else if ((inst & 0x7F000000u) == 0x36000000)
-    return TBZ;
-  else if ((inst & 0x7F000000u) == 0x37000000)
-    return TBNZ;
-  else
-    return IGNORED;
-}
-
-size_t sh_a64_get_rewrite_inst_len(uint32_t inst) {
-  static uint8_t map[] = {
-      4,   // IGNORED
-      20,  // B
-      28,  // B_COND
-      20,  // BL
-      16,  // ADR
-      16,  // ADRP
-      20,  // LDR_LIT_32
-      20,  // LDR_LIT_64
-      20,  // LDRSW_LIT
-      28,  // PRFM_LIT
-      28,  // LDR_SIMD_LIT_32
-      28,  // LDR_SIMD_LIT_64
-      28,  // LDR_SIMD_LIT_128
-      24,  // CBZ
-      24,  // CBNZ
-      24,  // TBZ
-      24   // TBNZ
-  };
-
-  return (size_t)(map[sh_a64_get_type(inst)]);
-}
-
-static bool sh_a64_is_addr_need_fix(uintptr_t addr, sh_a64_rewrite_info_t *rinfo) {
-  return (rinfo->start_addr <= addr && addr < rinfo->end_addr);
-}
-
-static uintptr_t sh_a64_fix_addr(uintptr_t addr, sh_a64_rewrite_info_t *rinfo) {
-  if (rinfo->start_addr <= addr && addr < rinfo->end_addr) {
-    uintptr_t cursor_addr = rinfo->start_addr;
-    size_t offset = 0;
-    for (size_t i = 0; i < rinfo->inst_lens_cnt; i++) {
-      if (cursor_addr >= addr) break;
-      cursor_addr += 4;
-      offset += rinfo->inst_lens[i];
-    }
-    uintptr_t fixed_addr = (uintptr_t)rinfo->buf + offset;
-    SH_LOG_INFO("a64 rewrite: fix addr %" PRIxPTR " -> %" PRIxPTR, addr, fixed_addr);
-    return fixed_addr;
-  }
-
-  return addr;
-}
-
-static size_t sh_a64_rewrite_b(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a64_type_t type,
-                               sh_a64_rewrite_info_t *rinfo) {
-  uint64_t imm64;
-  if (type == B_COND) {
-    uint64_t imm19 = SH_UTIL_GET_BITS_32(inst, 23, 5);
-    imm64 = SH_UTIL_SIGN_EXTEND_64(imm19 << 2u, 21u);
-  } else {
-    uint64_t imm26 = SH_UTIL_GET_BITS_32(inst, 25, 0);
-    imm64 = SH_UTIL_SIGN_EXTEND_64(imm26 << 2u, 28u);
-  }
-  uint64_t addr = pc + imm64;
-  addr = sh_a64_fix_addr(addr, rinfo);
-
-  size_t idx = 0;
-  if (type == B_COND) {
-    buf[idx++] = (inst & 0xFF00001F) | 0x40u;  // B.<cond> #8
-    buf[idx++] = 0x14000006;                   // B #24
-  }
-  buf[idx++] = 0x58000051;  // LDR X17, #8
-  buf[idx++] = 0x14000003;  // B #12
-  buf[idx++] = addr & 0xFFFFFFFF;
-  buf[idx++] = addr >> 32u;
-  if (type == BL)
-    buf[idx++] = 0xD63F0220;  // BLR X17
-  else
-    buf[idx++] = 0xD61F0220;  // BR X17
-  return idx * 4;             // 20 or 28
-}
-
-static size_t sh_a64_rewrite_adr(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a64_type_t type,
-                                 sh_a64_rewrite_info_t *rinfo) {
-  uint32_t xd = SH_UTIL_GET_BITS_32(inst, 4, 0);
-  uint64_t immlo = SH_UTIL_GET_BITS_32(inst, 30, 29);
-  uint64_t immhi = SH_UTIL_GET_BITS_32(inst, 23, 5);
-  uint64_t addr;
-  if (type == ADR)
-    addr = pc + SH_UTIL_SIGN_EXTEND_64((immhi << 2u) | immlo, 21u);
-  else  // ADRP
-    addr = (pc & 0xFFFFFFFFFFFFF000) + SH_UTIL_SIGN_EXTEND_64((immhi << 14u) | (immlo << 12u), 33u);
-  if (sh_a64_is_addr_need_fix(addr, rinfo)) return 0;  // rewrite failed
-
-  buf[0] = 0x58000040u | xd;  // LDR Xd, #8
-  buf[1] = 0x14000003;        // B #12
-  buf[2] = addr & 0xFFFFFFFF;
-  buf[3] = addr >> 32u;
-  return 16;
-}
-
-static size_t sh_a64_rewrite_ldr(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a64_type_t type,
-                                 sh_a64_rewrite_info_t *rinfo) {
-  uint32_t rt = SH_UTIL_GET_BITS_32(inst, 4, 0);
-  uint64_t imm19 = SH_UTIL_GET_BITS_32(inst, 23, 5);
-  uint64_t offset = SH_UTIL_SIGN_EXTEND_64((imm19 << 2u), 21u);
-  uint64_t addr = pc + offset;
-
-  if (sh_a64_is_addr_need_fix(addr, rinfo)) {
-    if (type != PRFM_LIT) return 0;  // rewrite failed
-    addr = sh_a64_fix_addr(addr, rinfo);
-  }
-
-  if (type == LDR_LIT_32 || type == LDR_LIT_64 || type == LDRSW_LIT) {
-    buf[0] = 0x58000060u | rt;  // LDR Xt, #12
-    if (type == LDR_LIT_32)
-      buf[1] = 0xB9400000 | rt | (rt << 5u);  // LDR Wt, [Xt]
-    else if (type == LDR_LIT_64)
-      buf[1] = 0xF9400000 | rt | (rt << 5u);  // LDR Xt, [Xt]
-    else
-      // LDRSW_LIT
-      buf[1] = 0xB9800000 | rt | (rt << 5u);  // LDRSW Xt, [Xt]
-    buf[2] = 0x14000003;                      // B #12
-    buf[3] = addr & 0xFFFFFFFF;
-    buf[4] = addr >> 32u;
-    return 20;
-  } else {
-    buf[0] = 0xA93F47F0;  // STP X16, X17, [SP, -0x10]
-    buf[1] = 0x58000091;  // LDR X17, #16
-    if (type == PRFM_LIT)
-      buf[2] = 0xF9800220 | rt;  // PRFM Rt, [X17]
-    else if (type == LDR_SIMD_LIT_32)
-      buf[2] = 0xBD400220 | rt;  // LDR St, [X17]
-    else if (type == LDR_SIMD_LIT_64)
-      buf[2] = 0xFD400220 | rt;  // LDR Dt, [X17]
-    else
-      // LDR_SIMD_LIT_128
-      buf[2] = 0x3DC00220u | rt;  // LDR Qt, [X17]
-    buf[3] = 0xF85F83F1;          // LDR X17, [SP, -0x8]
-    buf[4] = 0x14000003;          // B #12
-    buf[5] = addr & 0xFFFFFFFF;
-    buf[6] = addr >> 32u;
-    return 28;
-  }
-}
-
-static size_t sh_a64_rewrite_cb(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a64_rewrite_info_t *rinfo) {
-  uint64_t imm19 = SH_UTIL_GET_BITS_32(inst, 23, 5);
-  uint64_t offset = SH_UTIL_SIGN_EXTEND_64((imm19 << 2u), 21u);
-  uint64_t addr = pc + offset;
-  addr = sh_a64_fix_addr(addr, rinfo);
-
-  buf[0] = (inst & 0xFF00001F) | 0x40u;  // CB(N)Z Rt, #8
-  buf[1] = 0x14000005;                   // B #20
-  buf[2] = 0x58000051;                   // LDR X17, #8
-  buf[3] = 0xd61f0220;                   // BR X17
-  buf[4] = addr & 0xFFFFFFFF;
-  buf[5] = addr >> 32u;
-  return 24;
-}
-
-static size_t sh_a64_rewrite_tb(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a64_rewrite_info_t *rinfo) {
-  uint64_t imm14 = SH_UTIL_GET_BITS_32(inst, 18, 5);
-  uint64_t offset = SH_UTIL_SIGN_EXTEND_64((imm14 << 2u), 16u);
-  uint64_t addr = pc + offset;
-  addr = sh_a64_fix_addr(addr, rinfo);
-
-  buf[0] = (inst & 0xFFF8001F) | 0x40u;  // TB(N)Z Rt, #<imm>, #8
-  buf[1] = 0x14000005;                   // B #20
-  buf[2] = 0x58000051;                   // LDR X17, #8
-  buf[3] = 0xd61f0220;                   // BR X17
-  buf[4] = addr & 0xFFFFFFFF;
-  buf[5] = addr >> 32u;
-  return 24;
-}
-
-size_t sh_a64_rewrite(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a64_rewrite_info_t *rinfo) {
-  sh_a64_type_t type = sh_a64_get_type(inst);
-  SH_LOG_INFO("a64 rewrite: type %d, inst %" PRIx32, type, inst);
-
-  if (type == B || type == B_COND || type == BL)
-    return sh_a64_rewrite_b(buf, inst, pc, type, rinfo);
-  else if (type == ADR || type == ADRP)
-    return sh_a64_rewrite_adr(buf, inst, pc, type, rinfo);
-  else if (type == LDR_LIT_32 || type == LDR_LIT_64 || type == LDRSW_LIT || type == PRFM_LIT ||
-           type == LDR_SIMD_LIT_32 || type == LDR_SIMD_LIT_64 || type == LDR_SIMD_LIT_128)
-    return sh_a64_rewrite_ldr(buf, inst, pc, type, rinfo);
-  else if (type == CBZ || type == CBNZ)
-    return sh_a64_rewrite_cb(buf, inst, pc, rinfo);
-  else if (type == TBZ || type == TBNZ)
-    return sh_a64_rewrite_tb(buf, inst, pc, rinfo);
-  else {
-    // IGNORED
-    buf[0] = inst;
-    return 4;
-  }
-}
-
-size_t sh_a64_absolute_jump_with_br(uint32_t *buf, uintptr_t addr) {
-  buf[0] = 0x58000051;  // LDR X17, #8
-  buf[1] = 0xd61f0220;  // BR X17
-  buf[2] = addr & 0xFFFFFFFF;
-  buf[3] = addr >> 32u;
-  return 16;
-}
-
-// Use RET instead of BR to bypass arm64 BTI.
-//
-// ref:
-// https://developer.arm.com/documentation/102433/0100/Jump-oriented-programming
-// https://developer.arm.com/documentation/ddi0602/2023-06/Base-Instructions/BTI--Branch-Target-Identification-?lang=en
-// https://github.com/torvalds/linux/commit/8ef8f360cf30be12382f89ff48a57fbbd9b31c14
-// https://android-review.googlesource.com/c/platform/bionic/+/1242754
-// https://developer.android.com/ndk/guides/abis#armv9_enabling_pac_and_bti_for_cc
-// https://developer.arm.com/documentation/100067/0612/armclang-Command-line-Options/-mbranch-protection
-size_t sh_a64_absolute_jump_with_ret(uint32_t *buf, uintptr_t addr) {
-  buf[0] = 0x58000051;  // LDR X17, #8
-  buf[1] = 0xd65f0220;  // RET X17
-  buf[2] = addr & 0xFFFFFFFF;
-  buf[3] = addr >> 32u;
-  return 16;
-}
-
-size_t sh_a64_relative_jump(uint32_t *buf, uintptr_t addr, uintptr_t pc) {
-  buf[0] = 0x14000000u | (((addr - pc) & 0x0FFFFFFFu) >> 2u);  // B <label>
-  return 4;
-}
diff --git a/app/src/main/cpp/shadowhook/arch/arm64/sh_a64.h b/app/src/main/cpp/shadowhook/arch/arm64/sh_a64.h
deleted file mode 100644
index a51cd2e..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm64/sh_a64.h
+++ /dev/null
@@ -1,44 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stddef.h>
-#include <stdint.h>
-
-#include "sh_inst.h"
-
-typedef struct {
-  uintptr_t start_addr;
-  uintptr_t end_addr;
-  uint32_t *buf;
-  size_t buf_offset;
-  size_t inst_lens[4];
-  size_t inst_lens_cnt;
-} sh_a64_rewrite_info_t;
-
-size_t sh_a64_get_rewrite_inst_len(uint32_t inst);
-size_t sh_a64_rewrite(uint32_t *buf, uint32_t inst, uintptr_t pc, sh_a64_rewrite_info_t *rinfo);
-
-size_t sh_a64_absolute_jump_with_br(uint32_t *buf, uintptr_t addr);
-size_t sh_a64_absolute_jump_with_ret(uint32_t *buf, uintptr_t addr);
-size_t sh_a64_relative_jump(uint32_t *buf, uintptr_t addr, uintptr_t pc);
diff --git a/app/src/main/cpp/shadowhook/arch/arm64/sh_inst.c b/app/src/main/cpp/shadowhook/arch/arm64/sh_inst.c
deleted file mode 100644
index 7474a6c..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm64/sh_inst.c
+++ /dev/null
@@ -1,203 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_inst.h"
-
-#include <stdio.h>
-#include <string.h>
-#include <sys/mman.h>
-
-#include "sh_a64.h"
-#include "sh_config.h"
-#include "sh_enter.h"
-#include "sh_exit.h"
-#include "sh_log.h"
-#include "sh_sig.h"
-#include "sh_util.h"
-#include "shadowhook.h"
-#include "xdl.h"
-
-static int sh_inst_hook_rewrite(sh_inst_t *self, uintptr_t target_addr, uintptr_t *orig_addr,
-                                uintptr_t *orig_addr2) {
-  // backup original instructions (length: 4 or 16)
-  memcpy((void *)(self->backup), (void *)target_addr, self->backup_len);
-
-  // package the information passed to rewrite
-  sh_a64_rewrite_info_t rinfo;
-  rinfo.start_addr = target_addr;
-  rinfo.end_addr = target_addr + self->backup_len;
-  rinfo.buf = (uint32_t *)self->enter_addr;
-  rinfo.buf_offset = 0;
-  rinfo.inst_lens_cnt = self->backup_len / 4;
-  for (uintptr_t i = 0; i < self->backup_len; i += 4)
-    rinfo.inst_lens[i / 4] = sh_a64_get_rewrite_inst_len(*((uint32_t *)(target_addr + i)));
-
-  // rewrite original instructions (fill in enter)
-  uintptr_t pc = target_addr;
-  for (uintptr_t i = 0; i < self->backup_len; i += 4, pc += 4) {
-    size_t offset = sh_a64_rewrite((uint32_t *)(self->enter_addr + rinfo.buf_offset),
-                                   *((uint32_t *)(target_addr + i)), pc, &rinfo);
-    if (0 == offset) return SHADOWHOOK_ERRNO_HOOK_REWRITE_FAILED;
-    rinfo.buf_offset += offset;
-  }
-
-  // absolute jump back to remaining original instructions (fill in enter)
-  rinfo.buf_offset += sh_a64_absolute_jump_with_ret((uint32_t *)(self->enter_addr + rinfo.buf_offset),
-                                                    target_addr + self->backup_len);
-  sh_util_clear_cache(self->enter_addr, rinfo.buf_offset);
-
-  // save original function address
-  if (NULL != orig_addr) __atomic_store_n(orig_addr, self->enter_addr, __ATOMIC_SEQ_CST);
-  if (NULL != orig_addr2) __atomic_store_n(orig_addr2, self->enter_addr, __ATOMIC_SEQ_CST);
-  return 0;
-}
-
-#ifdef SH_CONFIG_TRY_WITH_EXIT
-
-// B: [-128M, +128M - 4]
-#define SH_INST_A64_B_RANGE_LOW  (134217728)
-#define SH_INST_A64_B_RANGE_HIGH (134217724)
-
-static int sh_inst_hook_with_exit(sh_inst_t *self, uintptr_t target_addr, xdl_info_t *dlinfo,
-                                  uintptr_t new_addr, uintptr_t *orig_addr, uintptr_t *orig_addr2) {
-  int r;
-  uintptr_t pc = target_addr;
-  self->backup_len = 4;
-
-  if (dlinfo->dli_ssize < self->backup_len) return SHADOWHOOK_ERRNO_HOOK_SYMSZ;
-
-  // alloc an exit for absolute jump
-  sh_a64_absolute_jump_with_br(self->exit, new_addr);
-  if (0 !=
-      (r = sh_exit_alloc(&self->exit_addr, (uint16_t *)&self->exit_type, pc, dlinfo, (uint8_t *)(self->exit),
-                         sizeof(self->exit), SH_INST_A64_B_RANGE_LOW, SH_INST_A64_B_RANGE_HIGH)))
-    return r;
-
-  // rewrite
-  if (0 != sh_util_mprotect(target_addr, self->backup_len, PROT_READ | PROT_WRITE | PROT_EXEC)) {
-    r = SHADOWHOOK_ERRNO_MPROT;
-    goto err;
-  }
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    r = sh_inst_hook_rewrite(self, target_addr, orig_addr, orig_addr2);
-  }
-  SH_SIG_CATCH() {
-    r = SHADOWHOOK_ERRNO_HOOK_REWRITE_CRASH;
-    goto err;
-  }
-  SH_SIG_EXIT
-  if (0 != r) goto err;
-
-  // relative jump to the exit by overwriting the head of original function
-  sh_a64_relative_jump(self->trampo, self->exit_addr, pc);
-  __atomic_thread_fence(__ATOMIC_SEQ_CST);
-  if (0 != (r = sh_util_write_inst(target_addr, self->trampo, self->backup_len))) goto err;
-
-  SH_LOG_INFO("a64: hook (WITH EXIT) OK. target %" PRIxPTR " -> exit %" PRIxPTR " -> new %" PRIxPTR
-              " -> enter %" PRIxPTR " -> remaining %" PRIxPTR,
-              target_addr, self->exit_addr, new_addr, self->enter_addr, target_addr + self->backup_len);
-  return 0;
-
-err:
-  sh_exit_free(self->exit_addr, (uint16_t)self->exit_type, (uint8_t *)(self->exit), sizeof(self->exit));
-  self->exit_addr = 0;  // this is a flag for with-exit or without-exit
-  return r;
-}
-#endif
-
-static int sh_inst_hook_without_exit(sh_inst_t *self, uintptr_t target_addr, xdl_info_t *dlinfo,
-                                     uintptr_t new_addr, uintptr_t *orig_addr, uintptr_t *orig_addr2) {
-  int r;
-  self->backup_len = 16;
-
-  if (dlinfo->dli_ssize < self->backup_len) return SHADOWHOOK_ERRNO_HOOK_SYMSZ;
-
-  // rewrite
-  if (0 != sh_util_mprotect(target_addr, self->backup_len, PROT_READ | PROT_WRITE | PROT_EXEC))
-    return SHADOWHOOK_ERRNO_MPROT;
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    r = sh_inst_hook_rewrite(self, target_addr, orig_addr, orig_addr2);
-  }
-  SH_SIG_CATCH() {
-    return SHADOWHOOK_ERRNO_HOOK_REWRITE_CRASH;
-  }
-  SH_SIG_EXIT
-  if (0 != r) return r;
-
-  // absolute jump to new function address by overwriting the head of original function
-  sh_a64_absolute_jump_with_br(self->trampo, new_addr);
-  __atomic_thread_fence(__ATOMIC_SEQ_CST);
-  if (0 != (r = sh_util_write_inst(target_addr, self->trampo, self->backup_len))) return r;
-
-  SH_LOG_INFO("a64: hook (WITHOUT EXIT) OK. target %" PRIxPTR " -> new %" PRIxPTR " -> enter %" PRIxPTR
-              " -> remaining %" PRIxPTR,
-              target_addr, new_addr, self->enter_addr, target_addr + self->backup_len);
-  return 0;
-}
-
-int sh_inst_hook(sh_inst_t *self, uintptr_t target_addr, xdl_info_t *dlinfo, uintptr_t new_addr,
-                 uintptr_t *orig_addr, uintptr_t *orig_addr2) {
-  self->enter_addr = sh_enter_alloc();
-  if (0 == self->enter_addr) return SHADOWHOOK_ERRNO_HOOK_ENTER;
-
-  int r;
-#ifdef SH_CONFIG_TRY_WITH_EXIT
-  if (0 == (r = sh_inst_hook_with_exit(self, target_addr, dlinfo, new_addr, orig_addr, orig_addr2))) return r;
-#endif
-  if (0 == (r = sh_inst_hook_without_exit(self, target_addr, dlinfo, new_addr, orig_addr, orig_addr2)))
-    return r;
-
-  // hook failed
-  if (NULL != orig_addr) *orig_addr = 0;
-  if (NULL != orig_addr2) *orig_addr2 = 0;
-  sh_enter_free(self->enter_addr);
-  return r;
-}
-
-int sh_inst_unhook(sh_inst_t *self, uintptr_t target_addr) {
-  int r;
-
-  // restore the instructions at the target address
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    r = memcmp((void *)target_addr, self->trampo, self->backup_len);
-  }
-  SH_SIG_CATCH() {
-    return SHADOWHOOK_ERRNO_UNHOOK_CMP_CRASH;
-  }
-  SH_SIG_EXIT
-  if (0 != r) return SHADOWHOOK_ERRNO_UNHOOK_TRAMPO_MISMATCH;
-  if (0 != (r = sh_util_write_inst(target_addr, self->backup, self->backup_len))) return r;
-  __atomic_thread_fence(__ATOMIC_SEQ_CST);
-
-  // free memory space for exit
-  if (0 != self->exit_addr)
-    if (0 != (r = sh_exit_free(self->exit_addr, (uint16_t)self->exit_type, (uint8_t *)(self->exit),
-                               sizeof(self->exit))))
-      return r;
-
-  // free memory space for enter
-  sh_enter_free(self->enter_addr);
-
-  SH_LOG_INFO("a64: unhook OK. target %" PRIxPTR, target_addr);
-  return 0;
-}
diff --git a/app/src/main/cpp/shadowhook/arch/arm64/sh_inst.h b/app/src/main/cpp/shadowhook/arch/arm64/sh_inst.h
deleted file mode 100644
index 5988b68..0000000
--- a/app/src/main/cpp/shadowhook/arch/arm64/sh_inst.h
+++ /dev/null
@@ -1,42 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stdbool.h>
-#include <stdint.h>
-
-#include "xdl.h"
-
-typedef struct {
-  uint32_t trampo[4];   // align 16 // length == backup_len
-  uint8_t backup[16];   // align 16
-  uint32_t backup_len;  // == 4 or 16
-  uint32_t exit_type;
-  uintptr_t exit_addr;
-  uint32_t exit[4];
-  uintptr_t enter_addr;
-} sh_inst_t;
-
-int sh_inst_hook(sh_inst_t *self, uintptr_t target_addr, xdl_info_t *dlinfo, uintptr_t new_addr,
-                 uintptr_t *orig_addr, uintptr_t *orig_addr2);
-int sh_inst_unhook(sh_inst_t *self, uintptr_t target_addr);
diff --git a/app/src/main/cpp/shadowhook/common/bytesig.c b/app/src/main/cpp/shadowhook/common/bytesig.c
deleted file mode 100644
index 8568279..0000000
--- a/app/src/main/cpp/shadowhook/common/bytesig.c
+++ /dev/null
@@ -1,291 +0,0 @@
-// Copyright (c) 2021-2023 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-// version 1.0.4
-
-#include "bytesig.h"
-
-#include <dlfcn.h>
-#include <errno.h>
-#include <pthread.h>
-#include <setjmp.h>
-#include <signal.h>
-#include <stdbool.h>
-#include <stddef.h>
-#include <stdlib.h>
-#include <string.h>
-#include <sys/syscall.h>
-#include <unistd.h>
-
-#define BYTESIG_DEBUG 0
-
-#if BYTESIG_DEBUG
-#include <android/log.h>
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wgnu-zero-variadic-macro-arguments"
-#define BYTESIG_LOG(fmt, ...) __android_log_print(ANDROID_LOG_INFO, "bytesig_tag", fmt, ##__VA_ARGS__)
-#pragma clang diagnostic pop
-#else
-#define BYTESIG_LOG(fmt, ...)
-#endif
-
-typedef enum {
-  BYTESIG_STATUS_UNAVAILABLE = 0,
-  BYTESIG_STATUS_SIG32 = 1,  // use sigset_t
-  BYTESIG_STATUS_SIG64 = 2   // use sigset64_t
-} bytesig_status_t;
-static bytesig_status_t bytesig_status = BYTESIG_STATUS_UNAVAILABLE;
-
-extern __attribute((weak)) int sigfillset64(sigset64_t *);
-extern __attribute((weak)) int sigemptyset64(sigset64_t *);
-extern __attribute((weak)) int sigaddset64(sigset64_t *, int);
-extern __attribute((weak)) int sigismember64(const sigset64_t *, int);
-
-typedef int (*bytesig_sigaction64_t)(int, const struct sigaction64 *, struct sigaction64 *);
-typedef int (*bytesig_sigaction_t)(int, const struct sigaction *, struct sigaction *);
-typedef int (*bytesig_sigprocmask64_t)(int, const sigset64_t *, sigset64_t *);
-typedef int (*bytesig_sigprocmask_t)(int, const sigset_t *, sigset_t *);
-
-static void *bytesig_sigaction;    // point to libc's sigaction64() or libc's sigaction()
-static void *bytesig_sigprocmask;  // point to libc's sigprocmask() or libc's sigprocmask64()
-
-__attribute__((constructor)) static void bytesig_ctor(void) {
-  void *libc = dlopen("libc.so", RTLD_LOCAL);
-  if (__predict_false(NULL == libc)) return;
-
-  if (__predict_true(NULL != sigfillset64 && NULL != sigemptyset64 && NULL != sigaddset64 &&
-                     NULL != sigismember64)) {
-    if (__predict_true(NULL != (bytesig_sigaction = dlsym(libc, "sigaction64")) &&
-                       NULL != (bytesig_sigprocmask = dlsym(libc, "sigprocmask64")))) {
-      bytesig_status = BYTESIG_STATUS_SIG64;
-      goto end;
-    }
-  }
-
-  if (__predict_true(NULL != (bytesig_sigaction = dlsym(libc, "sigaction")) &&
-                     NULL != (bytesig_sigprocmask = dlsym(libc, "sigprocmask")))) {
-    bytesig_status = BYTESIG_STATUS_SIG32;
-  }
-
-end:
-  dlclose(libc);
-}
-
-#define BYTESIG_PROTECTED_THREADS_MAX 256
-
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wpadded"
-typedef struct {
-  pid_t tids[BYTESIG_PROTECTED_THREADS_MAX];
-  sigjmp_buf *jbufs[BYTESIG_PROTECTED_THREADS_MAX];
-  union {
-    struct sigaction64 prev_action64;
-    struct sigaction prev_action;
-  };
-} bytesig_signal_t;
-#pragma clang diagnostic pop
-
-// array index is signal number, corresponds to signals 1 to 31, except 9 and 19
-static bytesig_signal_t *bytesig_signal_array[__SIGRTMIN];
-
-static void bytesig_sigorset64(sigset64_t *dest, sigset64_t *left, sigset64_t *right) {
-  sigemptyset64(dest);
-  for (size_t i = 1; i < sizeof(sigset64_t) * CHAR_BIT; i++)
-    if (sigismember64(left, (int)i) == 1 || sigismember64(right, (int)i) == 1) sigaddset64(dest, (int)i);
-}
-
-static void bytesig_sigorset(sigset_t *dest, sigset_t *left, sigset_t *right) {
-  sigemptyset(dest);
-  for (size_t i = 1; i < sizeof(sigset_t) * CHAR_BIT; i++)
-    if (sigismember(left, (int)i) == 1 || sigismember(right, (int)i) == 1) sigaddset(dest, (int)i);
-}
-
-__attribute__((noinline)) static void bytesig_handler_internal(int signum, siginfo_t *siginfo,
-                                                               void *context) {
-  bytesig_signal_t *sig = bytesig_signal_array[signum];
-
-  // check protect info & do siglongjmp
-  pid_t tid = gettid();
-  if (__predict_false(0 == tid)) tid = (pid_t)syscall(SYS_gettid);
-  for (size_t i = 0; i < BYTESIG_PROTECTED_THREADS_MAX; i++) {
-    if (__predict_false(tid == __atomic_load_n(&(sig->tids[i]), __ATOMIC_RELAXED))) {
-      BYTESIG_LOG("siglongjmp signal %d (code %d) at %zu", signum, siginfo->si_code, i);
-
-      unsigned int ret_signum = (((unsigned int)signum & 0xFFU) << 16U);
-      unsigned int ret_code = 0U;
-      if (siginfo->si_code > 0)
-        ret_code = (((unsigned int)(siginfo->si_code) & 0xFFU) << 8U);
-      else if (siginfo->si_code < 0)
-        ret_code = (unsigned int)(-(siginfo->si_code)) & 0xFFU;
-      int ret_val = (int)(ret_signum | ret_code);
-
-      siglongjmp(*(__atomic_load_n(&(sig->jbufs[i]), __ATOMIC_RELAXED)), ret_val);
-    }
-  }
-
-#define SET_THREAD_SIGNAL_MASK(suffix)                                                       \
-  do {                                                                                       \
-    sigset##suffix##_t prev_mask;                                                            \
-    bytesig_sigorset##suffix(&prev_mask, &(((ucontext_t *)context)->uc_sigmask##suffix),     \
-                             &(sig->prev_action##suffix.sa_mask));                           \
-    if (0 == ((unsigned int)(sig->prev_action##suffix.sa_flags) & (unsigned int)SA_NODEFER)) \
-      sigaddset##suffix(&prev_mask, signum);                                                 \
-    sigaddset##suffix(&prev_mask, SIGPIPE);                                                  \
-    sigaddset##suffix(&prev_mask, SIGUSR1);                                                  \
-    sigaddset##suffix(&prev_mask, SIGQUIT);                                                  \
-    ((bytesig_sigprocmask##suffix##_t)bytesig_sigprocmask)(SIG_SETMASK, &prev_mask, NULL);   \
-  } while (0)
-
-  // set thread signal mask
-  if (BYTESIG_STATUS_SIG64 == bytesig_status)
-    SET_THREAD_SIGNAL_MASK(64);
-  else
-    SET_THREAD_SIGNAL_MASK();
-}
-
-// https://llvm.org/docs/CodeGenerator.html#tail-call-optimization
-// https://clang.llvm.org/docs/AttributeReference.html#disable-tail-calls
-//__attribute__((disable_tail_calls))
-static void bytesig_handler(int signum, siginfo_t *siginfo, void *context) {
-  bytesig_handler_internal(signum, siginfo, context);
-
-#define CALL_PREVIOUS_SIGNAL_HANDLER(suffix)                            \
-  do {                                                                  \
-    if (__predict_true(sig->prev_action##suffix.sa_flags & SA_SIGINFO)) \
-      sig->prev_action##suffix.sa_sigaction(signum, siginfo, context);  \
-    else if (SIG_DFL != sig->prev_action##suffix.sa_handler &&          \
-             SIG_IGN != sig->prev_action##suffix.sa_handler)            \
-      sig->prev_action##suffix.sa_handler(signum);                      \
-  } while (0)
-
-  // call previous signal handler
-  bytesig_signal_t *sig = bytesig_signal_array[signum];
-  if (BYTESIG_STATUS_SIG64 == bytesig_status)
-    CALL_PREVIOUS_SIGNAL_HANDLER(64);
-  else
-    CALL_PREVIOUS_SIGNAL_HANDLER();
-}
-
-int bytesig_init(int signum) {
-  if (__predict_false(signum <= 0 || signum >= __SIGRTMIN || signum == SIGKILL || signum == SIGSTOP))
-    return -1;
-  if (__predict_false(BYTESIG_STATUS_UNAVAILABLE == bytesig_status)) return -1;
-  if (__predict_false(NULL != bytesig_signal_array[signum])) return -1;
-
-  static pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER;
-  pthread_mutex_lock(&lock);
-  int ret = -1;
-  if (__predict_false(NULL != bytesig_signal_array[signum])) goto end;
-
-  bytesig_signal_t *sig = calloc(1, sizeof(bytesig_signal_t));
-  if (__predict_false(NULL == sig)) goto end;
-
-#define SA_EXPOSE_TAGBITS 0x00000800
-
-#define REGISTER_SIGNAL_HANDLER(suffix)                                                                     \
-  do {                                                                                                      \
-    struct sigaction##suffix act;                                                                           \
-    memset(&act, 0, sizeof(struct sigaction##suffix));                                                      \
-    sigfillset##suffix(&act.sa_mask);                                                                       \
-    act.sa_sigaction = bytesig_handler;                                                                     \
-    act.sa_flags = SA_SIGINFO | SA_ONSTACK | SA_RESTART | SA_EXPOSE_TAGBITS;                                \
-    if (__predict_false(                                                                                    \
-            0 !=                                                                                            \
-            ((bytesig_sigaction##suffix##_t)bytesig_sigaction)(signum, &act, &sig->prev_action##suffix))) { \
-      free(sig);                                                                                            \
-      goto end;                                                                                             \
-    }                                                                                                       \
-  } while (0)
-
-  // register the signal handler, we start off with all signals blocked
-  if (BYTESIG_STATUS_SIG64 == bytesig_status)
-    REGISTER_SIGNAL_HANDLER(64);
-  else
-    REGISTER_SIGNAL_HANDLER();
-
-  bytesig_signal_array[signum] = sig;
-  ret = 0;  // OK
-
-end:
-  pthread_mutex_unlock(&lock);
-  return ret;
-}
-
-void bytesig_protect(pid_t tid, sigjmp_buf *jbuf, const int signums[], size_t signums_cnt) {
-  for (size_t i = 0; i < signums_cnt; i++) {
-    int signum = signums[i];
-    if (__predict_false(signum <= 0 || signum >= __SIGRTMIN || signum == SIGKILL || signum == SIGSTOP))
-      continue;
-
-    bytesig_signal_t *sig = bytesig_signal_array[signum];
-    if (__predict_false(NULL == sig)) continue;
-
-    // check repeated thread
-    bool repeated = false;
-    for (size_t j = 0; j < BYTESIG_PROTECTED_THREADS_MAX; j++) {
-      if (__predict_false(tid == sig->tids[j])) {
-        repeated = true;
-        break;
-      }
-    }
-    if (__predict_false(repeated)) continue;
-
-    // save thread-ID and jump buffer
-    size_t j = 0;
-    while (1) {
-      if (0 == sig->tids[j]) {
-        pid_t expected = 0;
-        if (__atomic_compare_exchange_n(&sig->tids[j], &expected, tid, false, __ATOMIC_ACQUIRE,
-                                        __ATOMIC_RELAXED)) {
-          sig->jbufs[j] = jbuf;
-          BYTESIG_LOG("protect_start signal %d at %zu", signum, j);
-          break;  // finished
-        }
-      }
-
-      j++;
-      if (__predict_false(BYTESIG_PROTECTED_THREADS_MAX == j)) j = 0;
-    }
-  }
-}
-
-void bytesig_unprotect(pid_t tid, const int signums[], size_t signums_cnt) {
-  for (size_t i = 0; i < signums_cnt; i++) {
-    int signum = signums[i];
-    if (__predict_false(signum <= 0 || signum >= __SIGRTMIN || signum == SIGKILL || signum == SIGSTOP))
-      continue;
-
-    bytesig_signal_t *sig = bytesig_signal_array[signum];
-    if (__predict_false(NULL == sig)) continue;
-
-    // free thread-ID and jump buffer
-    for (size_t j = 0; j < BYTESIG_PROTECTED_THREADS_MAX; j++) {
-      if (tid == sig->tids[j]) {
-        sig->jbufs[j] = NULL;
-        __atomic_store_n(&sig->tids[j], 0, __ATOMIC_RELEASE);
-        BYTESIG_LOG("protect_end signal %d at %zu", signum, j);
-        break;  // finished
-      }
-    }
-  }
-}
diff --git a/app/src/main/cpp/shadowhook/common/bytesig.h b/app/src/main/cpp/shadowhook/common/bytesig.h
deleted file mode 100644
index a7de526..0000000
--- a/app/src/main/cpp/shadowhook/common/bytesig.h
+++ /dev/null
@@ -1,157 +0,0 @@
-// Copyright (c) 2021-2023 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-// version 1.0.4
-
-/*
- * #include "bytesig.h"
- *
- * void init_once(void)
- * {
- *     bytesig_init(SIGSEGV);
- *     bytesig_init(SIGBUS);
- *     bytesig_init(SIGILL);
- *     bytesig_init(SIGABRT);
- *     // ......
- * }
- *
- * void unstable_func(void)
- * {
- *     int *p = NULL;
- *
- *     //
- *     // usage 1
- *     //
- *     BYTESIG_TRY(SIGSEGV, SIGBUS)
- *     {
- *         *p = 1;
- *     }
- *     BYTESIG_CATCH(signum, code)
- *     {
- *         LOG("signum %d (code %d)", signum, code);
- *     }
- *     BYTESIG_EXIT
- *
- *     //
- *     // usage 2
- *     //
- *     BYTESIG_TRY(SIGSEGV, SIGBUS)
- *     {
- *         *p = 2;
- *     }
- *     BYTESIG_CATCH(signum)
- *     {
- *         LOG("signum %d", signum);
- *     }
- *     BYTESIG_EXIT
- *
- *     //
- *     // usage 3
- *     //
- *     BYTESIG_TRY(SIGILL)
- *     {
- *         func_maybe_illed();
- *     }
- *     BYTESIG_CATCH()
- *     {
- *         do_something();
- *     }
- *     BYTESIG_EXIT
- *
- *     //
- *     // usage 4
- *     //
- *     BYTESIG_TRY(SIGABRT)
- *     {
- *         func_maybe_aborted();
- *     }
- *     BYTESIG_EXIT
- * }
- */
-
-#ifndef BYTEDANCE_BYTESIG
-#define BYTEDANCE_BYTESIG
-
-#include <setjmp.h>
-#include <signal.h>
-#include <stddef.h>
-#include <sys/syscall.h>
-#include <unistd.h>
-
-#define BYTESIG_TRY(...)                                                                                   \
-  do {                                                                                                     \
-    pid_t _bytesig_tid_ = gettid();                                                                        \
-    if (0 == _bytesig_tid_) _bytesig_tid_ = (pid_t)syscall(SYS_gettid);                                    \
-    sigjmp_buf _bytesig_jbuf_;                                                                             \
-    int _bytesig_sigs_[] = {__VA_ARGS__};                                                                  \
-    bytesig_protect(_bytesig_tid_, &_bytesig_jbuf_, _bytesig_sigs_, sizeof(_bytesig_sigs_) / sizeof(int)); \
-    int _bytesig_protected_ = 1;                                                                           \
-    int _bytesig_ex_ = sigsetjmp(_bytesig_jbuf_, 1);                                                       \
-    if (0 == _bytesig_ex_) {
-#define BYTESIG_CATCH_2(signum_, code_)                                                     \
-  }                                                                                         \
-  else {                                                                                    \
-    bytesig_unprotect(_bytesig_tid_, _bytesig_sigs_, sizeof(_bytesig_sigs_) / sizeof(int)); \
-    _bytesig_protected_ = 0;                                                                \
-    int signum_ = (int)(((unsigned int)_bytesig_ex_ & 0xFF0000U) >> 16U);                   \
-    int code_ = 0;                                                                          \
-    if (((unsigned int)_bytesig_ex_ & 0xFF00U) > 0)                                         \
-      code_ = (int)(((unsigned int)_bytesig_ex_ & 0xFF00U) >> 8U);                          \
-    else if (((unsigned int)_bytesig_ex_ & 0xFFU) > 0)                                      \
-      code_ = -((int)((unsigned int)_bytesig_ex_ & 0xFFU));                                 \
-    (void)signum_;                                                                          \
-    (void)code_;
-
-#define BYTESIG_CATCH_1(signum_) BYTESIG_CATCH_2(signum_, _bytesig_code_)
-#define BYTESIG_CATCH_0()        BYTESIG_CATCH_1(_bytesig_signum_)
-
-#define FUNC_CHOOSER(_f1, _f2, _f3, ...)     _f3
-#define FUNC_RECOMPOSER(argsWithParentheses) FUNC_CHOOSER argsWithParentheses
-#define CHOOSE_FROM_ARG_COUNT(...)           FUNC_RECOMPOSER((__VA_ARGS__, BYTESIG_CATCH_2, BYTESIG_CATCH_1, ))
-#define NO_ARG_EXPANDER()                    , , BYTESIG_CATCH_0
-#define MACRO_CHOOSER(...)                   CHOOSE_FROM_ARG_COUNT(NO_ARG_EXPANDER __VA_ARGS__())
-
-#define BYTESIG_CATCH(...) MACRO_CHOOSER(__VA_ARGS__)(__VA_ARGS__)
-
-#define BYTESIG_EXIT                                                                        \
-  }                                                                                         \
-  if (1 == _bytesig_protected_)                                                             \
-    bytesig_unprotect(_bytesig_tid_, _bytesig_sigs_, sizeof(_bytesig_sigs_) / sizeof(int)); \
-  }                                                                                         \
-  while (0)                                                                                 \
-    ;
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-int bytesig_init(int signum);
-
-void bytesig_protect(pid_t tid, sigjmp_buf *jbuf, const int signums[], size_t signums_cnt);
-void bytesig_unprotect(pid_t tid, const int signums[], size_t signums_cnt);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/app/src/main/cpp/shadowhook/common/sh_config.h b/app/src/main/cpp/shadowhook/common/sh_config.h
deleted file mode 100644
index 464dea9..0000000
--- a/app/src/main/cpp/shadowhook/common/sh_config.h
+++ /dev/null
@@ -1,55 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-
-// Global debugging.
-//
-// Note that in some cases these logs themselves can cause a crash.
-//
-//#define SH_CONFIG_DEBUG
-
-// Operation record of hook and unhook.
-//
-// Disabling it can reduce hook/unhook latency, memory footprint and file size.
-//
-#define SH_CONFIG_OPERATION_RECORDS
-
-// Crash signal protection.
-//
-// Do not disable it in a production environment.
-//
-#define SH_CONFIG_SIG_PROT
-
-// When hooking, try to find an exit for the relative jump for the dynamic library.
-//
-// Do not disable it in a production environment.
-//
-#define SH_CONFIG_TRY_WITH_EXIT
-
-// When hooking the function of the thumb instruction, if the function is too short,
-// try to use the gap aligned at the end of the function.
-//
-// Do not disable it in a production environment.
-//
-#define SH_CONFIG_DETECT_THUMB_TAIL_ALIGNED
diff --git a/app/src/main/cpp/shadowhook/common/sh_errno.c b/app/src/main/cpp/shadowhook/common/sh_errno.c
deleted file mode 100644
index e55891e..0000000
--- a/app/src/main/cpp/shadowhook/common/sh_errno.c
+++ /dev/null
@@ -1,107 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_errno.h"
-
-#include <pthread.h>
-#include <stdbool.h>
-
-#include "shadowhook.h"
-
-static int sh_errno_global = SHADOWHOOK_ERRNO_UNINIT;
-static pthread_key_t sh_errno_tls_key;
-
-int sh_errno_init(void) {
-  if (__predict_false(0 != pthread_key_create(&sh_errno_tls_key, NULL))) {
-    sh_errno_global = SHADOWHOOK_ERRNO_INIT_ERRNO;
-    return -1;
-  }
-  sh_errno_global = SHADOWHOOK_ERRNO_OK;
-  return 0;
-}
-
-void sh_errno_reset(void) {
-  sh_errno_set(0);
-}
-
-void sh_errno_set(int error_number) {
-  if (sh_errno_global == SHADOWHOOK_ERRNO_UNINIT || sh_errno_global == SHADOWHOOK_ERRNO_INIT_ERRNO) return;
-
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wint-to-void-pointer-cast"
-  pthread_setspecific(sh_errno_tls_key, (void *)error_number);
-#pragma clang diagnostic pop
-}
-
-int sh_errno_get(void) {
-  if (sh_errno_global == SHADOWHOOK_ERRNO_UNINIT || sh_errno_global == SHADOWHOOK_ERRNO_INIT_ERRNO)
-    return sh_errno_global;
-
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wvoid-pointer-to-int-cast"
-  return (int)(pthread_getspecific(sh_errno_tls_key));
-#pragma clang diagnostic pop
-}
-
-const char *sh_errno_to_errmsg(int error_number) {
-  static const char *msg[] = {/* 0  */ "OK",
-                              /* 1  */ "Pending task",
-                              /* 2  */ "Not initialized",
-                              /* 3  */ "Invalid argument",
-                              /* 4  */ "Out of memory",
-                              /* 5  */ "MProtect failed",
-                              /* 6  */ "Write to arbitrary address crashed",
-                              /* 7  */ "Init errno mod failed",
-                              /* 8  */ "Init bytesig SIGSEGV mod failed",
-                              /* 9  */ "Init bytesig SIGBUS mod failed",
-                              /* 10 */ "Init enter mod failed",
-                              /* 11 */ "Init safe mod failed",
-                              /* 12 */ "Init linker mod failed",
-                              /* 13 */ "Init hub mod failed",
-                              /* 14 */ "Create hub failed",
-                              /* 15 */ "Monitor dlopen failed",
-                              /* 16 */ "Create monitor thread failed",
-                              /* 17 */ "Open ELF crashed",
-                              /* 18 */ "Find symbol in ELF failed",
-                              /* 19 */ "Find symbol in ELF crashed",
-                              /* 20 */ "Duplicate hook",
-                              /* 21 */ "Dladdr crashed",
-                              /* 22 */ "Find dlinfo failed",
-                              /* 23 */ "Symbol size too small",
-                              /* 24 */ "Alloc enter failed",
-                              /* 25 */ "Instruction rewrite crashed",
-                              /* 26 */ "Instruction rewrite failed",
-                              /* 27 */ "Switch not found",
-                              /* 28 */ "Verify original instruction crashed",
-                              /* 29 */ "Verify original instruction failed",
-                              /* 30 */ "Exit instruction mismatch",
-                              /* 31 */ "Free exit crashed",
-                              /* 32 */ "Unhook on an error status task",
-                              /* 33 */ "Unhook on an unfinished task",
-                              /* 34 */ "ELF with an unsupported architecture",
-                              /* 35 */ "Linker with an unsupported architecture"};
-
-  if (error_number < 0 || error_number >= (int)(sizeof(msg) / sizeof(msg[0]))) return "Unknown error number";
-
-  return msg[error_number];
-}
diff --git a/app/src/main/cpp/shadowhook/common/sh_errno.h b/app/src/main/cpp/shadowhook/common/sh_errno.h
deleted file mode 100644
index 10f017b..0000000
--- a/app/src/main/cpp/shadowhook/common/sh_errno.h
+++ /dev/null
@@ -1,40 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include "sh_log.h"
-
-#define SH_ERRNO_SET_RET_ERRNUM(errnum) SH_ERRNO_SET_RET((errnum), (errnum))
-#define SH_ERRNO_SET_RET_FAIL(errnum)   SH_ERRNO_SET_RET((errnum), -1)
-#define SH_ERRNO_SET_RET_NULL(errnum)   SH_ERRNO_SET_RET((errnum), NULL)
-#define SH_ERRNO_SET_RET(errnum, ret) \
-  do {                                \
-    sh_errno_set((errnum));           \
-    return (ret);                     \
-  } while (0)
-
-int sh_errno_init(void);
-void sh_errno_reset(void);
-void sh_errno_set(int error_number);
-int sh_errno_get(void);
-const char *sh_errno_to_errmsg(int error_number);
diff --git a/app/src/main/cpp/shadowhook/common/sh_log.c b/app/src/main/cpp/shadowhook/common/sh_log.c
deleted file mode 100644
index 2632723..0000000
--- a/app/src/main/cpp/shadowhook/common/sh_log.c
+++ /dev/null
@@ -1,53 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_log.h"
-
-#include <android/log.h>
-#include <stdbool.h>
-
-#include "sh_config.h"
-
-android_LogPriority sh_log_priority =
-#ifdef SH_CONFIG_DEBUG
-    ANDROID_LOG_INFO
-#else
-    ANDROID_LOG_SILENT
-#endif
-    ;
-
-bool sh_log_get_debuggable(void) {
-  return sh_log_priority <= ANDROID_LOG_INFO;
-}
-
-void sh_log_set_debuggable(bool debuggable) {
-#ifdef SH_CONFIG_DEBUG
-  (void)debuggable;
-  sh_log_priority = ANDROID_LOG_INFO;
-#else
-  if (__predict_false(debuggable))
-    sh_log_priority = ANDROID_LOG_INFO;
-  else
-    sh_log_priority = ANDROID_LOG_SILENT;
-#endif
-}
diff --git a/app/src/main/cpp/shadowhook/common/sh_log.h b/app/src/main/cpp/shadowhook/common/sh_log.h
deleted file mode 100644
index fff786f..0000000
--- a/app/src/main/cpp/shadowhook/common/sh_log.h
+++ /dev/null
@@ -1,70 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <android/log.h>
-#include <inttypes.h>
-#include <stdarg.h>
-#include <stdbool.h>
-#include <stdint.h>
-
-extern android_LogPriority sh_log_priority;
-
-#define SH_LOG_TAG "shadowhook_tag"
-
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wgnu-zero-variadic-macro-arguments"
-
-// Notice:
-// We don't use ANDROID_LOG_DEBUG, because some Android devices will filter out ANDROID_LOG_DEBUG.
-#ifdef SH_CONFIG_DEBUG
-#define SH_LOG_DEBUG(fmt, ...)                                               \
-  do {                                                                       \
-    if (sh_log_priority <= ANDROID_LOG_INFO)                                 \
-      __android_log_print(ANDROID_LOG_INFO, SH_LOG_TAG, fmt, ##__VA_ARGS__); \
-  } while (0)
-#else
-#define SH_LOG_DEBUG(fmt, ...)
-#endif
-
-#define SH_LOG_INFO(fmt, ...)                                                \
-  do {                                                                       \
-    if (__predict_false(sh_log_priority <= ANDROID_LOG_INFO))                \
-      __android_log_print(ANDROID_LOG_INFO, SH_LOG_TAG, fmt, ##__VA_ARGS__); \
-  } while (0)
-#define SH_LOG_WARN(fmt, ...)                                                \
-  do {                                                                       \
-    if (__predict_false(sh_log_priority <= ANDROID_LOG_WARN))                \
-      __android_log_print(ANDROID_LOG_WARN, SH_LOG_TAG, fmt, ##__VA_ARGS__); \
-  } while (0)
-#define SH_LOG_ERROR(fmt, ...)                                                \
-  do {                                                                        \
-    if (__predict_false(sh_log_priority <= ANDROID_LOG_ERROR))                \
-      __android_log_print(ANDROID_LOG_ERROR, SH_LOG_TAG, fmt, ##__VA_ARGS__); \
-  } while (0)
-#define SH_LOG_ALWAYS_SHOW(fmt, ...) __android_log_print(ANDROID_LOG_WARN, SH_LOG_TAG, fmt, ##__VA_ARGS__)
-
-#pragma clang diagnostic pop
-
-bool sh_log_get_debuggable(void);
-void sh_log_set_debuggable(bool debuggable);
diff --git a/app/src/main/cpp/shadowhook/common/sh_sig.h b/app/src/main/cpp/shadowhook/common/sh_sig.h
deleted file mode 100644
index 5b926ae..0000000
--- a/app/src/main/cpp/shadowhook/common/sh_sig.h
+++ /dev/null
@@ -1,49 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-
-#include "sh_config.h"
-
-#ifdef SH_CONFIG_SIG_PROT
-
-#include "bytesig.h"
-#define SH_SIG_TRY   BYTESIG_TRY
-#define SH_SIG_CATCH BYTESIG_CATCH
-#define SH_SIG_EXIT  BYTESIG_EXIT
-
-#else
-
-#define SH_SIG_TRY(...) \
-  do {                  \
-    if (0 == 0) {
-#define SH_SIG_CATCH(...) \
-  }                       \
-  else {
-#define SH_SIG_EXIT \
-  }                 \
-  }                 \
-  while (0)         \
-    ;
-
-#endif
diff --git a/app/src/main/cpp/shadowhook/common/sh_trampo.c b/app/src/main/cpp/shadowhook/common/sh_trampo.c
deleted file mode 100644
index 894273c..0000000
--- a/app/src/main/cpp/shadowhook/common/sh_trampo.c
+++ /dev/null
@@ -1,172 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_trampo.h"
-
-#include <pthread.h>
-#include <stdint.h>
-#include <stdlib.h>
-#include <string.h>
-#include <sys/mman.h>
-#include <sys/prctl.h>
-#include <sys/time.h>
-
-#include "queue.h"
-#include "sh_util.h"
-
-#define SH_TRAMPO_PAGE_SZ 4096
-#define SH_TRAMPO_ALIGN   4
-
-void sh_trampo_init_mgr(sh_trampo_mgr_t *mem_mgr, const char *page_name, size_t trampo_size,
-                        time_t delay_sec) {
-  SLIST_INIT(&mem_mgr->pages);
-  pthread_mutex_init(&mem_mgr->pages_lock, NULL);
-  mem_mgr->page_name = page_name;
-  mem_mgr->trampo_size = SH_UTIL_ALIGN_END(trampo_size, SH_TRAMPO_ALIGN);
-  mem_mgr->delay_sec = delay_sec;
-}
-
-uintptr_t sh_trampo_alloc(sh_trampo_mgr_t *mem_mgr, uintptr_t hint, uintptr_t range_low,
-                          uintptr_t range_high) {
-  uintptr_t mem = 0;
-  uintptr_t new_ptr;
-  uintptr_t new_ptr_prctl = (uintptr_t)MAP_FAILED;
-  size_t count = SH_TRAMPO_PAGE_SZ / mem_mgr->trampo_size;
-
-  if (range_low > hint) range_low = hint;
-  if (range_high > UINTPTR_MAX - hint) range_high = UINTPTR_MAX - hint;
-
-  struct timeval now;
-  if (mem_mgr->delay_sec > 0) gettimeofday(&now, NULL);
-
-  pthread_mutex_lock(&mem_mgr->pages_lock);
-
-  // try to find an unused mem
-  sh_trampo_page_t *page;
-  SLIST_FOREACH(page, &mem_mgr->pages, link) {
-    // check hit range
-    uintptr_t page_trampo_start = page->ptr;
-    uintptr_t page_trampo_end = page->ptr + SH_TRAMPO_PAGE_SZ - mem_mgr->trampo_size;
-    if (hint > 0 && ((page_trampo_end < hint - range_low) || (hint + range_high < page_trampo_start)))
-      continue;
-
-    for (uintptr_t i = 0; i < count; i++) {
-      size_t flags_idx = i / 32;
-      uint32_t mask = (uint32_t)1 << (i % 32);
-      if (0 == (page->flags[flags_idx] & mask))  // check flag
-      {
-        // check timestamp
-        if (mem_mgr->delay_sec > 0 &&
-            (now.tv_sec <= page->timestamps[i] || now.tv_sec - page->timestamps[i] <= mem_mgr->delay_sec))
-          continue;
-
-        // check hit range
-        uintptr_t cur = page->ptr + (mem_mgr->trampo_size * i);
-        if (hint > 0 && ((cur < hint - range_low) || (hint + range_high < cur))) continue;
-
-        // OK
-        page->flags[flags_idx] |= mask;
-        mem = cur;
-        memset((void *)mem, 0, mem_mgr->trampo_size);
-        goto end;
-      }
-    }
-  }
-
-  // alloc a new mem page
-  new_ptr = (uintptr_t)(mmap(hint > 0 ? (void *)(hint - range_low) : NULL, SH_TRAMPO_PAGE_SZ,
-                             PROT_READ | PROT_WRITE | PROT_EXEC, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0));
-  if ((uintptr_t)MAP_FAILED == new_ptr) goto err;
-  new_ptr_prctl = new_ptr;
-
-  // check hit range
-  if (hint > 0 && ((hint - range_low >= new_ptr + SH_TRAMPO_PAGE_SZ - mem_mgr->trampo_size) ||
-                   (hint + range_high < new_ptr)))
-    goto err;
-
-  // create a new trampo-page info
-  if (NULL == (page = calloc(1, sizeof(sh_trampo_page_t)))) goto err;
-  memset((void *)new_ptr, 0, SH_TRAMPO_PAGE_SZ);
-  page->ptr = new_ptr;
-  new_ptr = (uintptr_t)MAP_FAILED;
-  if (NULL == (page->flags = calloc(1, SH_UTIL_ALIGN_END(count, 32) / 8))) goto err;
-  page->timestamps = NULL;
-  if (mem_mgr->delay_sec > 0) {
-    if (NULL == (page->timestamps = calloc(1, count * sizeof(time_t)))) goto err;
-  }
-  SLIST_INSERT_HEAD(&mem_mgr->pages, page, link);
-
-  // alloc mem from the new mem page
-  for (uintptr_t i = 0; i < count; i++) {
-    size_t flags_idx = i / 32;
-    uint32_t mask = (uint32_t)1 << (i % 32);
-
-    // check hit range
-    uintptr_t find = page->ptr + (mem_mgr->trampo_size * i);
-    if (hint > 0 && ((find < hint - range_low) || (hint + range_high < find))) continue;
-
-    // OK
-    page->flags[flags_idx] |= mask;
-    mem = find;
-    break;
-  }
-  if (0 == mem) abort();
-
-end:
-  pthread_mutex_unlock(&mem_mgr->pages_lock);
-  if ((uintptr_t)MAP_FAILED != new_ptr_prctl)
-    prctl(PR_SET_VMA, PR_SET_VMA_ANON_NAME, new_ptr_prctl, SH_TRAMPO_PAGE_SZ, mem_mgr->page_name);
-  return mem;
-
-err:
-  pthread_mutex_unlock(&mem_mgr->pages_lock);
-  if (NULL != page) {
-    if (0 != page->ptr) munmap((void *)page->ptr, SH_TRAMPO_PAGE_SZ);
-    if (NULL != page->flags) free(page->flags);
-    if (NULL != page->timestamps) free(page->timestamps);
-    free(page);
-  }
-  if ((uintptr_t)MAP_FAILED != new_ptr) munmap((void *)new_ptr, SH_TRAMPO_PAGE_SZ);
-  return 0;
-}
-
-void sh_trampo_free(sh_trampo_mgr_t *mem_mgr, uintptr_t mem) {
-  struct timeval now;
-  if (mem_mgr->delay_sec > 0) gettimeofday(&now, NULL);
-
-  pthread_mutex_lock(&mem_mgr->pages_lock);
-
-  sh_trampo_page_t *page;
-  SLIST_FOREACH(page, &mem_mgr->pages, link) {
-    if (page->ptr <= mem && mem < page->ptr + SH_TRAMPO_PAGE_SZ) {
-      uintptr_t i = (mem - page->ptr) / mem_mgr->trampo_size;
-      size_t flags_idx = i / 32;
-      uint32_t mask = (uint32_t)1 << (i % 32);
-      if (mem_mgr->delay_sec > 0) page->timestamps[i] = now.tv_sec;
-      page->flags[flags_idx] &= ~mask;
-      break;
-    }
-  }
-
-  pthread_mutex_unlock(&mem_mgr->pages_lock);
-}
diff --git a/app/src/main/cpp/shadowhook/common/sh_trampo.h b/app/src/main/cpp/shadowhook/common/sh_trampo.h
deleted file mode 100644
index 0a20964..0000000
--- a/app/src/main/cpp/shadowhook/common/sh_trampo.h
+++ /dev/null
@@ -1,52 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stddef.h>
-#include <stdint.h>
-#include <sys/time.h>
-
-#include "queue.h"
-
-typedef struct sh_trampo_page {
-  uintptr_t ptr;
-  uint32_t *flags;
-  time_t *timestamps;
-  SLIST_ENTRY(sh_trampo_page, ) link;
-} sh_trampo_page_t;
-typedef SLIST_HEAD(sh_trampo_page_list, sh_trampo_page, ) sh_trampo_page_list_t;
-
-typedef struct sh_trampo_mgr {
-  sh_trampo_page_list_t pages;
-  pthread_mutex_t pages_lock;
-  const char *page_name;
-  size_t trampo_size;
-  time_t delay_sec;
-} sh_trampo_mgr_t;
-
-void sh_trampo_init_mgr(sh_trampo_mgr_t *mem_mgr, const char *page_name, size_t trampo_size,
-                        time_t delay_sec);
-
-uintptr_t sh_trampo_alloc(sh_trampo_mgr_t *mem_mgr, uintptr_t hint, uintptr_t low_offset,
-                          uintptr_t high_offset);
-void sh_trampo_free(sh_trampo_mgr_t *mem_mgr, uintptr_t mem);
diff --git a/app/src/main/cpp/shadowhook/common/sh_util.c b/app/src/main/cpp/shadowhook/common/sh_util.c
deleted file mode 100644
index b8604c8..0000000
--- a/app/src/main/cpp/shadowhook/common/sh_util.c
+++ /dev/null
@@ -1,538 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_util.h"
-
-#include <stdbool.h>
-#include <stddef.h>
-#include <stdint.h>
-#include <stdlib.h>
-#include <string.h>
-#include <sys/mman.h>
-#include <time.h>
-#include <unistd.h>
-
-#include "sh_log.h"
-#include "sh_sig.h"
-#include "shadowhook.h"
-
-int sh_util_mprotect(uintptr_t addr, size_t len, int prot) {
-  uintptr_t start = SH_UTIL_PAGE_START(addr);
-  uintptr_t end = SH_UTIL_PAGE_END(addr + len - 1);
-
-  return mprotect((void *)start, end - start, prot);
-}
-
-void sh_util_clear_cache(uintptr_t addr, size_t len) {
-  __builtin___clear_cache((char *)addr, (char *)(addr + len));
-}
-
-bool sh_util_is_thumb32(uintptr_t target_addr) {
-  uint16_t opcode = *((uint16_t *)target_addr);
-  int tmp = opcode >> 11u;
-  return (tmp == 0x1d) || (tmp == 0x1e) || (tmp == 0x1f);
-}
-
-static uint32_t sh_util_ror(uint32_t val, uint32_t n, uint32_t shift) {
-  uint32_t m = shift % n;
-  return (val >> m) | (val << (n - m));
-}
-
-uint32_t sh_util_arm_expand_imm(uint32_t opcode) {
-  uint32_t imm = SH_UTIL_GET_BITS_32(opcode, 7, 0);
-  uint32_t amt = 2 * SH_UTIL_GET_BITS_32(opcode, 11, 8);
-
-  return amt == 0 ? imm : sh_util_ror(imm, 32, amt);
-}
-
-int sh_util_write_inst(uintptr_t target_addr, void *inst, size_t inst_len) {
-  if (0 != sh_util_mprotect(target_addr, inst_len, PROT_READ | PROT_WRITE | PROT_EXEC))
-    return SHADOWHOOK_ERRNO_MPROT;
-
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    if ((4 == inst_len) && (0 == target_addr % 4))
-      __atomic_store_n((uint32_t *)target_addr, *((uint32_t *)inst), __ATOMIC_SEQ_CST);
-    else if ((8 == inst_len) && (0 == target_addr % 8))
-      __atomic_store_n((uint64_t *)target_addr, *((uint64_t *)inst), __ATOMIC_SEQ_CST);
-#ifdef __LP64__
-    else if ((16 == inst_len) && (0 == target_addr % 16))
-      __atomic_store_n((__int128 *)target_addr, *((__int128 *)inst), __ATOMIC_SEQ_CST);
-#endif
-    else
-      memcpy((void *)target_addr, inst, inst_len);
-
-    sh_util_clear_cache(target_addr, inst_len);
-  }
-  SH_SIG_CATCH() {
-    return SHADOWHOOK_ERRNO_WRITE_CRASH;
-  }
-  SH_SIG_EXIT
-
-  return 0;  // OK
-}
-
-static bool sh_util_starts_with(const char *str, const char *start) {
-  while (*str && *str == *start) {
-    str++;
-    start++;
-  }
-
-  return '\0' == *start;
-}
-
-static int sh_util_get_api_level_from_build_prop(void) {
-  char buf[128];
-  int api_level = -1;
-
-  FILE *fp = fopen("/system/build.prop", "r");
-  if (__predict_false(NULL == fp)) goto end;
-
-  while (fgets(buf, sizeof(buf), fp)) {
-    if (__predict_false(sh_util_starts_with(buf, "ro.build.version.sdk="))) {
-      api_level = atoi(buf + 21);
-      break;
-    }
-  }
-  fclose(fp);
-
-end:
-  return (api_level > 0) ? api_level : -1;
-}
-
-int sh_util_get_api_level(void) {
-  static int xdl_util_api_level = -1;
-
-  if (__predict_false(xdl_util_api_level < 0)) {
-    int api_level = android_get_device_api_level();
-    if (__predict_false(api_level < 0))
-      api_level = sh_util_get_api_level_from_build_prop();  // compatible with unusual models
-    if (__predict_false(api_level < __ANDROID_API_J__)) api_level = __ANDROID_API_J__;
-
-    __atomic_store_n(&xdl_util_api_level, api_level, __ATOMIC_SEQ_CST);
-  }
-
-  return xdl_util_api_level;
-}
-
-int sh_util_write(int fd, const char *buf, size_t buf_len) {
-  if (fd < 0) return -1;
-
-  const char *ptr = buf;
-  size_t nleft = buf_len;
-
-  while (nleft > 0) {
-    errno = 0;
-    ssize_t nwritten = write(fd, ptr, nleft);
-    if (nwritten <= 0) {
-      if (nwritten < 0 && errno == EINTR)
-        nwritten = 0;  // call write() again
-      else
-        return -1;  // error
-    }
-    nleft -= (size_t)nwritten;
-    ptr += nwritten;
-  }
-
-  return 0;
-}
-
-/* Nonzero if YEAR is a leap year (every 4 years,
-   except every 100th isn't, and every 400th is).  */
-#define SH_UTIL_ISLEAP(year) ((year) % 4 == 0 && ((year) % 100 != 0 || (year) % 400 == 0))
-
-#define SH_UTIL_SECS_PER_HOUR        (60 * 60)
-#define SH_UTIL_SECS_PER_DAY         (SH_UTIL_SECS_PER_HOUR * 24)
-#define SH_UTIL_DIV(a, b)            ((a) / (b) - ((a) % (b) < 0))
-#define SH_UTIL_LEAPS_THRU_END_OF(y) (SH_UTIL_DIV(y, 4) - SH_UTIL_DIV(y, 100) + SH_UTIL_DIV(y, 400))
-
-static const unsigned short int sh_util_mon_yday[2][13] = {
-    /* Normal years.  */
-    {0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365},
-    /* Leap years.  */
-    {0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335, 366}};
-
-/* Compute the `struct tm' representation of *T,
-   offset GMTOFF seconds east of UTC,
-   and store year, yday, mon, mday, wday, hour, min, sec into *RESULT.
-   Return RESULT if successful.  */
-struct tm *sh_util_localtime_r(const time_t *timep, long gmtoff, struct tm *result) {
-  time_t days, rem, y;
-  const unsigned short int *ip;
-
-  if (NULL == result) return NULL;
-
-  result->tm_gmtoff = gmtoff;
-
-  days = ((*timep) / SH_UTIL_SECS_PER_DAY);
-  rem = ((*timep) % SH_UTIL_SECS_PER_DAY);
-  rem += gmtoff;
-  while (rem < 0) {
-    rem += SH_UTIL_SECS_PER_DAY;
-    --days;
-  }
-  while (rem >= SH_UTIL_SECS_PER_DAY) {
-    rem -= SH_UTIL_SECS_PER_DAY;
-    ++days;
-  }
-  result->tm_hour = (int)(rem / SH_UTIL_SECS_PER_HOUR);
-  rem %= SH_UTIL_SECS_PER_HOUR;
-  result->tm_min = (int)(rem / 60L);
-  result->tm_sec = (int)(rem % 60L);
-  /* January 1, 1970 was a Thursday.  */
-  result->tm_wday = (int)(4 + days) % 7;
-  if (result->tm_wday < 0) result->tm_wday += 7;
-  y = 1970;
-
-  while (days < 0 || days >= (SH_UTIL_ISLEAP(y) ? 366 : 365)) {
-    /* Guess a corrected year, assuming 365 days per year.  */
-    time_t yg = y + days / 365 - (days % 365 < 0);
-
-    /* Adjust DAYS and Y to match the guessed year.  */
-    days -= ((yg - y) * 365 + SH_UTIL_LEAPS_THRU_END_OF(yg - 1) - SH_UTIL_LEAPS_THRU_END_OF(y - 1));
-
-    y = yg;
-  }
-  result->tm_year = (int)(y - 1900);
-  if (result->tm_year != y - 1900) {
-    /* The year cannot be represented due to overflow.  */
-    errno = EOVERFLOW;
-    return NULL;
-  }
-  result->tm_yday = (int)days;
-  ip = sh_util_mon_yday[SH_UTIL_ISLEAP(y)];
-  for (y = 11; days < (long int)ip[y]; --y) continue;
-  days -= ip[y];
-  result->tm_mon = (int)y;
-  result->tm_mday = (int)(days + 1);
-  return result;
-}
-
-static unsigned sh_util_parse_decimal(const char *format, int *ppos) {
-  const char *p = format + *ppos;
-  unsigned result = 0;
-  for (;;) {
-    int ch = *p;
-    unsigned d = (unsigned)(ch - '0');
-    if (d >= 10U) {
-      break;
-    }
-    result = result * 10 + d;
-    p++;
-  }
-  *ppos = (int)(p - format);
-  return result;
-}
-
-static void sh_util_format_unsigned(char *buf, size_t buf_size, uint64_t value, int base, int caps) {
-  char *p = buf;
-  char *end = buf + buf_size - 1;
-
-  // Generate digit string in reverse order.
-  while (value) {
-    unsigned d = (unsigned)(value % (uint64_t)base);
-    value /= (uint64_t)base;
-    if (p != end) {
-      char ch;
-      if (d < 10) {
-        ch = '0' + (char)d;
-      } else {
-        ch = (caps ? 'A' : 'a') + (char)(d - 10);
-      }
-      *p++ = ch;
-    }
-  }
-
-  // Special case for 0.
-  if (p == buf) {
-    if (p != end) {
-      *p++ = '0';
-    }
-  }
-  *p = '\0';
-
-  // Reverse digit string in-place.
-  size_t length = (size_t)(p - buf);
-  for (size_t i = 0, j = length - 1; i < j; ++i, --j) {
-    char ch = buf[i];
-    buf[i] = buf[j];
-    buf[j] = ch;
-  }
-}
-
-static void sh_util_format_integer(char *buf, size_t buf_size, uint64_t value, char conversion) {
-  // Decode the conversion specifier.
-  int is_signed = (conversion == 'd' || conversion == 'i' || conversion == 'o');
-  int base = 10;
-  if (conversion == 'x' || conversion == 'X') {
-    base = 16;
-  } else if (conversion == 'o') {
-    base = 8;
-  }
-  int caps = (conversion == 'X');
-  if (is_signed && (int64_t)(value) < 0) {
-    buf[0] = '-';
-    buf += 1;
-    buf_size -= 1;
-    value = (uint64_t)(-(int64_t)(value));
-  }
-  sh_util_format_unsigned(buf, buf_size, value, base, caps);
-}
-
-// format stream
-typedef struct {
-  size_t total;
-  char *pos;
-  size_t avail;
-} sh_util_stream_t;
-
-static void sh_util_stream_init(sh_util_stream_t *self, char *buffer, size_t buffer_size) {
-  self->total = 0;
-  self->pos = buffer;
-  self->avail = buffer_size;
-
-  if (self->avail > 0) self->pos[0] = '\0';
-}
-
-static size_t sh_util_stream_total(sh_util_stream_t *self) {
-  return self->total;
-}
-
-static void sh_util_stream_send(sh_util_stream_t *self, const char *data, int len) {
-  if (len < 0) {
-    len = (int)strlen(data);
-  }
-  self->total += (size_t)len;
-
-  if (self->avail <= 1) {
-    // no space to put anything else
-    return;
-  }
-
-  if ((size_t)len >= self->avail) {
-    len = (int)(self->avail - 1);
-  }
-
-  memcpy(self->pos, data, (size_t)len);
-  self->pos += len;
-  self->pos[0] = '\0';
-  self->avail -= (size_t)len;
-}
-
-static void sh_util_stream_send_repeat(sh_util_stream_t *self, char ch, int count) {
-  char pad[8];
-  memset(pad, ch, sizeof(pad));
-
-  const int pad_size = (int)(sizeof(pad));
-  while (count > 0) {
-    int avail = count;
-    if (avail > pad_size) {
-      avail = pad_size;
-    }
-    sh_util_stream_send(self, pad, avail);
-    count -= avail;
-  }
-}
-
-static void sh_util_stream_vformat(sh_util_stream_t *self, const char *format, va_list args) {
-  int nn = 0;
-
-  for (;;) {
-    int mm;
-    int padZero = 0;
-    int padLeft = 0;
-    char sign = '\0';
-    int width = -1;
-    int prec = -1;
-    size_t bytelen = sizeof(int);
-    int slen;
-    char buffer[32];  // temporary buffer used to format numbers
-    char c;
-
-    // first, find all characters that are not 0 or '%', then send them to the output directly
-    mm = nn;
-    do {
-      c = format[mm];
-      if (c == '\0' || c == '%') break;
-      mm++;
-    } while (1);
-    if (mm > nn) {
-      sh_util_stream_send(self, format + nn, mm - nn);
-      nn = mm;
-    }
-
-    // is this it ? then exit
-    if (c == '\0') break;
-
-    // nope, we are at a '%' modifier
-    nn++;  // skip it
-
-    // parse flags
-    for (;;) {
-      c = format[nn++];
-      if (c == '\0') {
-        // single trailing '%' ?
-        c = '%';
-        sh_util_stream_send(self, &c, 1);
-        return;
-      } else if (c == '0') {
-        padZero = 1;
-        continue;
-      } else if (c == '-') {
-        padLeft = 1;
-        continue;
-      } else if (c == ' ' || c == '+') {
-        sign = c;
-        continue;
-      }
-      break;
-    }
-
-    // parse field width
-    if ((c >= '0' && c <= '9')) {
-      nn--;
-      width = (int)(sh_util_parse_decimal(format, &nn));
-      c = format[nn++];
-    }
-
-    // parse precision
-    if (c == '.') {
-      prec = (int)(sh_util_parse_decimal(format, &nn));
-      c = format[nn++];
-    }
-
-    // length modifier
-    switch (c) {
-      case 'h':
-        bytelen = sizeof(short);
-        if (format[nn] == 'h') {
-          bytelen = sizeof(char);
-          nn += 1;
-        }
-        c = format[nn++];
-        break;
-      case 'l':
-        bytelen = sizeof(long);
-        if (format[nn] == 'l') {
-          bytelen = sizeof(long long);
-          nn += 1;
-        }
-        c = format[nn++];
-        break;
-      case 'z':
-        bytelen = sizeof(size_t);
-        c = format[nn++];
-        break;
-      case 't':
-        bytelen = sizeof(ptrdiff_t);
-        c = format[nn++];
-        break;
-      default:;
-    }
-
-    // conversion specifier
-    const char *str = buffer;
-    if (c == 's') {
-      // string
-      str = va_arg(args, const char *);
-      if (str == NULL) {
-        str = "(null)";
-      }
-    } else if (c == 'c') {
-      // character
-      // NOTE: char is promoted to int when passed through the stack
-      buffer[0] = (char)(va_arg(args, int));
-      buffer[1] = '\0';
-    } else if (c == 'p') {
-      uint64_t value = (uintptr_t)(va_arg(args, void *));
-      buffer[0] = '0';
-      buffer[1] = 'x';
-      sh_util_format_integer(buffer + 2, sizeof(buffer) - 2, value, 'x');
-    } else if (c == 'd' || c == 'i' || c == 'o' || c == 'u' || c == 'x' || c == 'X') {
-      // integers - first read value from stack
-      uint64_t value;
-      int is_signed = (c == 'd' || c == 'i' || c == 'o');
-      // NOTE: int8_t and int16_t are promoted to int when passed through the stack
-      switch (bytelen) {
-        case 1:
-          value = (uint8_t)(va_arg(args, int));
-          break;
-        case 2:
-          value = (uint16_t)(va_arg(args, int));
-          break;
-        case 4:
-          value = va_arg(args, uint32_t);
-          break;
-        case 8:
-          value = va_arg(args, uint64_t);
-          break;
-        default:
-          return;  // should not happen
-      }
-      // sign extension, if needed
-      if (is_signed) {
-        int shift = (int)(64 - 8 * bytelen);
-        value = (uint64_t)(((int64_t)(value << shift)) >> shift);
-      }
-      // format the number properly into our buffer
-      sh_util_format_integer(buffer, sizeof(buffer), value, c);
-    } else if (c == '%') {
-      buffer[0] = '%';
-      buffer[1] = '\0';
-    } else {
-      //__assert(__FILE__, __LINE__, "conversion specifier unsupported");
-      return;
-    }
-
-    // if we are here, 'str' points to the content that must be outputted.
-    // handle padding and alignment now
-    slen = (int)strlen(str);
-    if (sign != '\0' || prec != -1) {
-      //__assert(__FILE__, __LINE__, "sign/precision unsupported");
-      return;
-    }
-    if (slen < width && !padLeft) {
-      char padChar = padZero ? '0' : ' ';
-      sh_util_stream_send_repeat(self, padChar, width - slen);
-    }
-    sh_util_stream_send(self, str, slen);
-    if (slen < width && padLeft) {
-      char padChar = padZero ? '0' : ' ';
-      sh_util_stream_send_repeat(self, padChar, width - slen);
-    }
-  }
-}
-
-size_t sh_util_vsnprintf(char *buffer, size_t buffer_size, const char *format, va_list args) {
-  sh_util_stream_t stream;
-  sh_util_stream_init(&stream, buffer, buffer_size);
-  sh_util_stream_vformat(&stream, format, args);
-  return sh_util_stream_total(&stream);
-}
-
-size_t sh_util_snprintf(char *buffer, size_t buffer_size, const char *format, ...) {
-  va_list args;
-  va_start(args, format);
-  size_t buffer_len = sh_util_vsnprintf(buffer, buffer_size, format, args);
-  va_end(args);
-  return buffer_len;
-}
diff --git a/app/src/main/cpp/shadowhook/common/sh_util.h b/app/src/main/cpp/shadowhook/common/sh_util.h
deleted file mode 100644
index c8d0515..0000000
--- a/app/src/main/cpp/shadowhook/common/sh_util.h
+++ /dev/null
@@ -1,96 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <android/api-level.h>
-#include <errno.h>
-#include <stdarg.h>
-#include <stdbool.h>
-#include <stddef.h>
-#include <stdint.h>
-#include <time.h>
-
-#define SH_UTIL_ALIGN_START(x, align) ((uintptr_t)(x) & ~((uintptr_t)(align)-1))
-#define SH_UTIL_ALIGN_END(x, align)   (((uintptr_t)(x) + (uintptr_t)(align)-1) & ~((uintptr_t)(align)-1))
-
-#define SH_UTIL_PAGE_START(x) SH_UTIL_ALIGN_START(x, 0x1000)
-#define SH_UTIL_PAGE_END(x)   SH_UTIL_ALIGN_END(x, 0x1000)
-
-#define SH_UTIL_IS_THUMB(addr)   ((addr)&1u)
-#define SH_UTIL_CLEAR_BIT0(addr) ((addr)&0xFFFFFFFE)
-#define SH_UTIL_SET_BIT0(addr)   ((addr) | 1u)
-
-#define SH_UTIL_ALIGN_4(pc) ((pc)&0xFFFFFFFC)
-#define SH_UTIL_SIGN_EXTEND_32(n, len) \
-  ((SH_UTIL_GET_BIT_32(n, len - 1) > 0) ? ((n) | (0xFFFFFFFF << (len))) : n)
-#define SH_UTIL_SIGN_EXTEND_64(n, len) \
-  ((SH_UTIL_GET_BIT_64(n, len - 1) > 0) ? ((n) | (0xFFFFFFFFFFFFFFFF << (len))) : n)
-
-#define SH_UTIL_GET_BIT_16(n, idx)        ((uint16_t)((n) << (15u - (idx))) >> 15u)
-#define SH_UTIL_GET_BITS_16(n, high, low) ((uint16_t)((n) << (15u - (high))) >> (15u - (high) + (low)))
-#define SH_UTIL_GET_BIT_32(n, idx)        ((uint32_t)((n) << (31u - (idx))) >> 31u)
-#define SH_UTIL_GET_BITS_32(n, high, low) ((uint32_t)((n) << (31u - (high))) >> (31u - (high) + (low)))
-#define SH_UTIL_GET_BIT_64(n, idx)        ((uint64_t)((n) << (63u - (idx))) >> 63u)
-#define SH_UTIL_GET_BITS_64(n, high, low) ((uint64_t)((n) << (63u - (high))) >> (63u - (high) + (low)))
-
-#define SH_UTIL_TEMP_FAILURE_RETRY(exp)    \
-  ({                                       \
-    __typeof__(exp) _rc;                   \
-    do {                                   \
-      errno = 0;                           \
-      _rc = (exp);                         \
-    } while (_rc == -1 && errno == EINTR); \
-    _rc;                                   \
-  })
-
-#define SH_UTIL_MAX(a, b)   \
-  ({                        \
-    __typeof__(a) _a = (a); \
-    __typeof__(b) _b = (b); \
-    _a > _b ? _a : _b;      \
-  })
-
-#define SH_UTIL_MIN(a, b)   \
-  ({                        \
-    __typeof__(a) _a = (a); \
-    __typeof__(b) _b = (b); \
-    _a < _b ? _a : _b;      \
-  })
-
-int sh_util_mprotect(uintptr_t addr, size_t len, int prot);
-void sh_util_clear_cache(uintptr_t addr, size_t len);
-
-bool sh_util_is_thumb32(uintptr_t target_addr);
-
-uint32_t sh_util_arm_expand_imm(uint32_t opcode);
-
-int sh_util_write_inst(uintptr_t target_addr, void *inst, size_t inst_len);
-
-int sh_util_get_api_level(void);
-
-int sh_util_write(int fd, const char *buf, size_t buf_len);
-
-struct tm *sh_util_localtime_r(const time_t *timep, long gmtoff, struct tm *result);
-
-size_t sh_util_vsnprintf(char *buffer, size_t buffer_size, const char *format, va_list args);
-size_t sh_util_snprintf(char *buffer, size_t buffer_size, const char *format, ...);
diff --git a/app/src/main/cpp/shadowhook/include/shadowhook.h b/app/src/main/cpp/shadowhook/include/shadowhook.h
deleted file mode 100644
index 0aa7f1a..0000000
--- a/app/src/main/cpp/shadowhook/include/shadowhook.h
+++ /dev/null
@@ -1,191 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// shadowhook is now credited to all its contributors.
-//
-// Before shadowhook was open sourced in February 2022, it was developed by
-// the following developers from ByteDance's App Health Team:
-//
-// Kelun Cai (caikelun@bytedance.com)
-// Pengying Xu (xupengying@bytedance.com)
-//
-
-#ifndef BYTEDANCE_SHADOWHOOK_H
-#define BYTEDANCE_SHADOWHOOK_H
-
-#include <stdbool.h>
-#include <stdint.h>
-
-#define SHADOWHOOK_VERSION "1.0.8"
-
-#define SHADOWHOOK_ERRNO_OK                     0
-#define SHADOWHOOK_ERRNO_PENDING                1
-#define SHADOWHOOK_ERRNO_UNINIT                 2
-#define SHADOWHOOK_ERRNO_INVALID_ARG            3
-#define SHADOWHOOK_ERRNO_OOM                    4
-#define SHADOWHOOK_ERRNO_MPROT                  5
-#define SHADOWHOOK_ERRNO_WRITE_CRASH            6
-#define SHADOWHOOK_ERRNO_INIT_ERRNO             7
-#define SHADOWHOOK_ERRNO_INIT_SIGSEGV           8
-#define SHADOWHOOK_ERRNO_INIT_SIGBUS            9
-#define SHADOWHOOK_ERRNO_INIT_ENTER             10
-#define SHADOWHOOK_ERRNO_INIT_SAFE              11
-#define SHADOWHOOK_ERRNO_INIT_LINKER            12
-#define SHADOWHOOK_ERRNO_INIT_HUB               13
-#define SHADOWHOOK_ERRNO_HUB_CREAT              14
-#define SHADOWHOOK_ERRNO_MONITOR_DLOPEN         15
-#define SHADOWHOOK_ERRNO_MONITOR_THREAD         16
-#define SHADOWHOOK_ERRNO_HOOK_DLOPEN_CRASH      17
-#define SHADOWHOOK_ERRNO_HOOK_DLSYM             18
-#define SHADOWHOOK_ERRNO_HOOK_DLSYM_CRASH       19
-#define SHADOWHOOK_ERRNO_HOOK_DUP               20
-#define SHADOWHOOK_ERRNO_HOOK_DLADDR_CRASH      21
-#define SHADOWHOOK_ERRNO_HOOK_DLINFO            22
-#define SHADOWHOOK_ERRNO_HOOK_SYMSZ             23
-#define SHADOWHOOK_ERRNO_HOOK_ENTER             24
-#define SHADOWHOOK_ERRNO_HOOK_REWRITE_CRASH     25
-#define SHADOWHOOK_ERRNO_HOOK_REWRITE_FAILED    26
-#define SHADOWHOOK_ERRNO_UNHOOK_NOTFOUND        27
-#define SHADOWHOOK_ERRNO_UNHOOK_CMP_CRASH       28
-#define SHADOWHOOK_ERRNO_UNHOOK_TRAMPO_MISMATCH 29
-#define SHADOWHOOK_ERRNO_UNHOOK_EXIT_MISMATCH   30
-#define SHADOWHOOK_ERRNO_UNHOOK_EXIT_CRASH      31
-#define SHADOWHOOK_ERRNO_UNHOOK_ON_ERROR        32
-#define SHADOWHOOK_ERRNO_UNHOOK_ON_UNFINISHED   33
-#define SHADOWHOOK_ERRNO_ELF_ARCH_MISMATCH      34
-#define SHADOWHOOK_ERRNO_LINKER_ARCH_MISMATCH   35
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-const char *shadowhook_get_version(void);
-
-// init
-typedef enum {
-  SHADOWHOOK_MODE_SHARED = 0,  // a function can be hooked multiple times
-  SHADOWHOOK_MODE_UNIQUE = 1   // a function can only be hooked once, and hooking again will report an error
-} shadowhook_mode_t;
-int shadowhook_init(shadowhook_mode_t mode, bool debuggable);
-int shadowhook_get_init_errno(void);
-
-// get and set attributes
-#define SHADOWHOOK_IS_SHARED_MODE (SHADOWHOOK_MODE_SHARED == shadowhook_get_mode())
-#define SHADOWHOOK_IS_UNIQUE_MODE (SHADOWHOOK_MODE_UNIQUE == shadowhook_get_mode())
-shadowhook_mode_t shadowhook_get_mode(void);
-bool shadowhook_get_debuggable(void);
-void shadowhook_set_debuggable(bool debuggable);
-bool shadowhook_get_recordable(void);
-void shadowhook_set_recordable(bool recordable);
-
-// get error-number and error message
-int shadowhook_get_errno(void);
-const char *shadowhook_to_errmsg(int error_number);
-
-// hook and unhook
-typedef void (*shadowhook_hooked_t)(int error_number, const char *lib_name, const char *sym_name,
-                                    void *sym_addr, void *new_addr, void *orig_addr, void *arg);
-void *shadowhook_hook_func_addr(void *func_addr, void *new_addr, void **orig_addr);
-void *shadowhook_hook_sym_addr(void *sym_addr, void *new_addr, void **orig_addr);
-void *shadowhook_hook_sym_name(const char *lib_name, const char *sym_name, void *new_addr, void **orig_addr);
-void *shadowhook_hook_sym_name_callback(const char *lib_name, const char *sym_name, void *new_addr,
-                                        void **orig_addr, shadowhook_hooked_t hooked, void *hooked_arg);
-int shadowhook_unhook(void *stub);
-
-// get operation records
-#define SHADOWHOOK_RECORD_ITEM_ALL             0x3FF  // 0b1111111111
-#define SHADOWHOOK_RECORD_ITEM_TIMESTAMP       (1 << 0)
-#define SHADOWHOOK_RECORD_ITEM_CALLER_LIB_NAME (1 << 1)
-#define SHADOWHOOK_RECORD_ITEM_OP              (1 << 2)
-#define SHADOWHOOK_RECORD_ITEM_LIB_NAME        (1 << 3)
-#define SHADOWHOOK_RECORD_ITEM_SYM_NAME        (1 << 4)
-#define SHADOWHOOK_RECORD_ITEM_SYM_ADDR        (1 << 5)
-#define SHADOWHOOK_RECORD_ITEM_NEW_ADDR        (1 << 6)
-#define SHADOWHOOK_RECORD_ITEM_BACKUP_LEN      (1 << 7)
-#define SHADOWHOOK_RECORD_ITEM_ERRNO           (1 << 8)
-#define SHADOWHOOK_RECORD_ITEM_STUB            (1 << 9)
-char *shadowhook_get_records(uint32_t item_flags);
-void shadowhook_dump_records(int fd, uint32_t item_flags);
-
-// helper functions for "get symbol-address from library-name and symbol-name"
-void *shadowhook_dlopen(const char *lib_name);
-void shadowhook_dlclose(void *handle);
-void *shadowhook_dlsym(void *handle, const char *sym_name);
-void *shadowhook_dlsym_dynsym(void *handle, const char *sym_name);
-void *shadowhook_dlsym_symtab(void *handle, const char *sym_name);
-
-// for internal use
-void *shadowhook_get_prev_func(void *func);
-void shadowhook_pop_stack(void *return_address);
-void shadowhook_allow_reentrant(void *return_address);
-void shadowhook_disallow_reentrant(void *return_address);
-void *shadowhook_get_return_address(void);
-
-#ifdef __cplusplus
-}
-#endif
-
-// call previous function in proxy-function
-#ifdef __cplusplus
-#define SHADOWHOOK_CALL_PREV(func, ...) \
-  ((decltype(&(func)))shadowhook_get_prev_func((void *)(func)))(__VA_ARGS__)
-#else
-#define SHADOWHOOK_CALL_PREV(func, func_sig, ...) \
-  ((func_sig)shadowhook_get_prev_func((void *)(func)))(__VA_ARGS__)
-#endif
-// pop stack in proxy-function (for C/C++)
-#define SHADOWHOOK_POP_STACK()                                                        \
-  do {                                                                                \
-    if (SHADOWHOOK_IS_SHARED_MODE) shadowhook_pop_stack(__builtin_return_address(0)); \
-  } while (0)
-
-// pop stack in proxy-function (for C++ only)
-#ifdef __cplusplus
-class ShadowhookStackScope {
- public:
-  ShadowhookStackScope(void *return_address) : return_address_(return_address) {}
-  ~ShadowhookStackScope() {
-    if (SHADOWHOOK_IS_SHARED_MODE) shadowhook_pop_stack(return_address_);
-  }
-
- private:
-  void *return_address_;
-};
-#define SHADOWHOOK_STACK_SCOPE() ShadowhookStackScope shadowhook_stack_scope_obj(__builtin_return_address(0))
-#endif
-
-// allow reentrant of the current proxy-function
-#define SHADOWHOOK_ALLOW_REENTRANT()                                                        \
-  do {                                                                                      \
-    if (SHADOWHOOK_IS_SHARED_MODE) shadowhook_allow_reentrant(__builtin_return_address(0)); \
-  } while (0)
-
-// disallow reentrant of the current proxy-function
-#define SHADOWHOOK_DISALLOW_REENTRANT()                                                        \
-  do {                                                                                         \
-    if (SHADOWHOOK_IS_SHARED_MODE) shadowhook_disallow_reentrant(__builtin_return_address(0)); \
-  } while (0)
-
-// get return address in proxy-function
-#define SHADOWHOOK_RETURN_ADDRESS() \
-  ((void *)(SHADOWHOOK_IS_SHARED_MODE ? shadowhook_get_return_address() : __builtin_return_address(0)))
-
-#endif
diff --git a/app/src/main/cpp/shadowhook/sh_enter.c b/app/src/main/cpp/shadowhook/sh_enter.c
deleted file mode 100644
index f30b811..0000000
--- a/app/src/main/cpp/shadowhook/sh_enter.c
+++ /dev/null
@@ -1,47 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_enter.h"
-
-#include <stdint.h>
-
-#include "sh_trampo.h"
-
-#define SH_ENTER_PAGE_NAME "shadowhook-enter"
-#define SH_ENTER_SZ        256
-#define SH_ENTER_DELAY_SEC 10
-
-static sh_trampo_mgr_t sh_enter_trampo_mgr;
-
-int sh_enter_init(void) {
-  sh_trampo_init_mgr(&sh_enter_trampo_mgr, SH_ENTER_PAGE_NAME, SH_ENTER_SZ, SH_ENTER_DELAY_SEC);
-  return 0;
-}
-
-uintptr_t sh_enter_alloc(void) {
-  return sh_trampo_alloc(&sh_enter_trampo_mgr, 0, 0, 0);
-}
-
-void sh_enter_free(uintptr_t enter) {
-  sh_trampo_free(&sh_enter_trampo_mgr, enter);
-}
diff --git a/app/src/main/cpp/shadowhook/sh_enter.h b/app/src/main/cpp/shadowhook/sh_enter.h
deleted file mode 100644
index 89ba8e5..0000000
--- a/app/src/main/cpp/shadowhook/sh_enter.h
+++ /dev/null
@@ -1,30 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stdint.h>
-
-int sh_enter_init(void);
-
-uintptr_t sh_enter_alloc(void);
-void sh_enter_free(uintptr_t enter);
diff --git a/app/src/main/cpp/shadowhook/sh_exit.c b/app/src/main/cpp/shadowhook/sh_exit.c
deleted file mode 100644
index 2ae905d..0000000
--- a/app/src/main/cpp/shadowhook/sh_exit.c
+++ /dev/null
@@ -1,420 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_exit.h"
-
-#include <pthread.h>
-#include <stdbool.h>
-#include <stdint.h>
-#include <stdio.h>
-#include <string.h>
-#include <sys/mman.h>
-
-#include "sh_config.h"
-#include "sh_log.h"
-#include "sh_sig.h"
-#include "sh_trampo.h"
-#include "sh_util.h"
-#include "shadowhook.h"
-#include "xdl.h"
-
-#define SH_EXIT_PAGE_NAME "shadowhook-exit"
-#if defined(__arm__)
-#define SH_EXIT_SZ 8
-#elif defined(__aarch64__)
-#define SH_EXIT_SZ 16
-#endif
-#define SH_EXIT_DELAY_SEC 2
-#define SH_EXIT_GAPS_CAP  16
-
-// Used to identify whether the ELF gap has been zero-filled,
-// and also serves as a guard instruction.
-#if defined(__arm__)
-#define SH_EXIT_CLEAR_FLAG 0xE1200070BE00BE00  // BKPT #0(thumb) + BKPT #0(thumb) + BKPT #0(arm)
-#elif defined(__aarch64__)
-#define SH_EXIT_CLEAR_FLAG 0xD4200000D4200000  // BRK #0 + BRK #0
-#endif
-
-#define SH_EXIT_TYPE_OUT_LIBRARY 0
-#define SH_EXIT_TYPE_IN_LIBRARY  1
-
-extern __attribute((weak)) unsigned long int getauxval(unsigned long int);
-
-static pthread_mutex_t sh_exit_lock = PTHREAD_MUTEX_INITIALIZER;
-static sh_trampo_mgr_t sh_exit_trampo_mgr;
-
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wpadded"
-typedef struct {
-  uintptr_t load_bias;
-  const ElfW(Phdr) *dlpi_phdr;
-  ElfW(Half) dlpi_phnum;
-} sh_exit_elfinfo_t;
-#pragma clang diagnostic pop
-
-static sh_exit_elfinfo_t sh_exit_app_process_info;
-static sh_exit_elfinfo_t sh_exit_linker_info;
-static sh_exit_elfinfo_t sh_exit_vdso_info;  // vdso may not exist
-
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wgnu-statement-expression"
-
-static void sh_exit_init_elfinfo(unsigned long type, sh_exit_elfinfo_t *info) {
-  if (__predict_false(NULL == getauxval)) goto err;
-
-  uintptr_t val = (uintptr_t)getauxval(type);
-  if (__predict_false(0 == val)) goto err;
-
-  // get base
-  uintptr_t base = (AT_PHDR == type ? (val & (~0xffful)) : val);
-  if (__predict_false(0 != memcmp((void *)base, ELFMAG, SELFMAG))) goto err;
-
-  // ELF info
-  ElfW(Ehdr) *ehdr = (ElfW(Ehdr) *)base;
-  const ElfW(Phdr) *dlpi_phdr = (const ElfW(Phdr) *)(base + ehdr->e_phoff);
-  ElfW(Half) dlpi_phnum = ehdr->e_phnum;
-
-  // get load_bias
-  uintptr_t min_vaddr = UINTPTR_MAX;
-  for (size_t i = 0; i < dlpi_phnum; i++) {
-    const ElfW(Phdr) *phdr = &(dlpi_phdr[i]);
-    if (PT_LOAD == phdr->p_type) {
-      if (min_vaddr > phdr->p_vaddr) min_vaddr = phdr->p_vaddr;
-    }
-  }
-  if (__predict_false(UINTPTR_MAX == min_vaddr || base < min_vaddr)) goto err;
-  uintptr_t load_bias = base - min_vaddr;
-
-  info->load_bias = load_bias;
-  info->dlpi_phdr = dlpi_phdr;
-  info->dlpi_phnum = dlpi_phnum;
-  return;
-
-err:
-  info->load_bias = 0;
-  info->dlpi_phdr = NULL;
-  info->dlpi_phnum = 0;
-}
-
-void sh_exit_init(void) {
-  // init for out-library mode
-  sh_trampo_init_mgr(&sh_exit_trampo_mgr, SH_EXIT_PAGE_NAME, SH_EXIT_SZ, SH_EXIT_DELAY_SEC);
-
-  // init for in-library mode
-  sh_exit_init_elfinfo(AT_PHDR, &sh_exit_app_process_info);
-  sh_exit_init_elfinfo(AT_BASE, &sh_exit_linker_info);
-  sh_exit_init_elfinfo(AT_SYSINFO_EHDR, &sh_exit_vdso_info);
-}
-
-// out-library mode:
-//
-// We store the shellcode for exit in mmaped memory near the PC.
-//
-
-static int sh_exit_alloc_out_library(uintptr_t *exit_addr, uintptr_t pc, xdl_info_t *dlinfo, uint8_t *exit,
-                                     size_t exit_len, size_t range_low, size_t range_high) {
-  (void)dlinfo;
-
-  uintptr_t addr = sh_trampo_alloc(&sh_exit_trampo_mgr, pc, range_low, range_high);
-  if (0 == addr) return -1;
-
-  memcpy((void *)addr, exit, exit_len);
-  sh_util_clear_cache(addr, exit_len);
-  *exit_addr = addr;
-  return 0;
-}
-
-static void sh_exit_free_out_library(uintptr_t exit_addr) {
-  sh_trampo_free(&sh_exit_trampo_mgr, exit_addr);
-}
-
-// in-library mode:
-//
-// We store the shellcode for exit in the memory gaps in the ELF.
-
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wpadded"
-typedef struct {
-  uintptr_t start;
-  uintptr_t end;
-  bool need_fill_zero;
-  bool readable;
-} sh_exit_gap_t;
-#pragma clang diagnostic pop
-
-static size_t sh_exit_get_gaps(xdl_info_t *dlinfo, sh_exit_gap_t *gaps, size_t gaps_cap,
-                               bool elf_loaded_by_kernel) {
-  size_t gaps_used = 0;
-
-  for (size_t i = 0; i < dlinfo->dlpi_phnum; i++) {
-    // current LOAD segment
-    const ElfW(Phdr) *cur_phdr = &(dlinfo->dlpi_phdr[i]);
-    if (PT_LOAD != cur_phdr->p_type) continue;
-
-    // next LOAD segment
-    const ElfW(Phdr) *next_phdr = NULL;
-    if (!elf_loaded_by_kernel) {
-      for (size_t j = i + 1; j < dlinfo->dlpi_phnum; j++) {
-        if (PT_LOAD == dlinfo->dlpi_phdr[j].p_type) {
-          next_phdr = &(dlinfo->dlpi_phdr[j]);
-          break;
-        }
-      }
-    }
-
-    uintptr_t cur_end = (uintptr_t)dlinfo->dli_fbase + cur_phdr->p_vaddr + cur_phdr->p_memsz;
-    uintptr_t cur_page_end = SH_UTIL_PAGE_END(cur_end);
-    uintptr_t cur_file_end = (uintptr_t)dlinfo->dli_fbase + cur_phdr->p_vaddr + cur_phdr->p_filesz;
-    uintptr_t cur_file_page_end = SH_UTIL_PAGE_END(cur_file_end);
-    uintptr_t next_page_start =
-        (NULL == next_phdr ? cur_page_end
-                           : SH_UTIL_PAGE_START((uintptr_t)dlinfo->dli_fbase + next_phdr->p_vaddr));
-
-    sh_exit_gap_t gap = {0, 0, false, false};
-    if (cur_phdr->p_flags & PF_X) {
-      // From: last PF_X page's unused memory tail space.
-      // To: next page start.
-      gap.start = SH_UTIL_ALIGN_END(cur_end, 0x10);
-      gap.end = next_page_start;
-      gap.need_fill_zero = true;
-      gap.readable = (cur_phdr->p_flags & PF_R && cur_page_end == next_page_start);
-    } else if (cur_page_end > cur_file_page_end) {
-      // From: last .bss page(which must NOT be file backend)'s unused memory tail space.
-      // To: next page start.
-      gap.start = SH_UTIL_ALIGN_END(cur_end, 0x10);
-      gap.end = next_page_start;
-      gap.need_fill_zero = false;
-      gap.readable = (cur_phdr->p_flags & PF_R && cur_page_end == next_page_start);
-    } else if (next_page_start > cur_page_end) {
-      // Entire unused memory pages.
-      gap.start = cur_page_end;
-      gap.end = next_page_start;
-      gap.need_fill_zero = true;
-      gap.readable = false;
-    }
-
-    if ((gap.need_fill_zero && gap.end > gap.start + 0x10) || (!gap.need_fill_zero && gap.end > gap.start)) {
-      SH_LOG_INFO("exit: gap, %" PRIxPTR " - %" PRIxPTR " (load_bias %" PRIxPTR ", %" PRIxPTR " - %" PRIxPTR
-                  "), NFZ %d, READABLE %d",
-                  gap.start, gap.end, (uintptr_t)dlinfo->dli_fbase, gap.start - (uintptr_t)dlinfo->dli_fbase,
-                  gap.end - (uintptr_t)dlinfo->dli_fbase, gap.need_fill_zero ? 1 : 0, gap.readable ? 1 : 0);
-      gaps[gaps_used].start = gap.start;
-      gaps[gaps_used].end = gap.end;
-      gaps[gaps_used].need_fill_zero = gap.need_fill_zero;
-      gaps[gaps_used].readable = gap.readable;
-      gaps_used++;
-    }
-
-    if (gaps_used >= gaps_cap) break;
-  }
-
-  return gaps_used;
-}
-
-static bool sh_exit_is_in_elf_range(uintptr_t pc, sh_exit_elfinfo_t *info) {
-  if (pc < info->load_bias) return false;
-
-  uintptr_t vaddr = pc - info->load_bias;
-  for (size_t i = 0; i < info->dlpi_phnum; i++) {
-    const ElfW(Phdr) *phdr = &(info->dlpi_phdr[i]);
-    if (PT_LOAD != phdr->p_type) continue;
-
-    if (phdr->p_vaddr <= vaddr && vaddr < phdr->p_vaddr + phdr->p_memsz) return true;
-  }
-
-  return false;
-}
-
-static bool sh_exit_is_elf_loaded_by_kernel(uintptr_t pc) {
-  if (NULL == sh_exit_app_process_info.dlpi_phdr) return true;
-  if (sh_exit_is_in_elf_range(pc, &sh_exit_app_process_info)) return true;
-
-  if (NULL == sh_exit_linker_info.dlpi_phdr) return true;
-  if (sh_exit_is_in_elf_range(pc, &sh_exit_linker_info)) return true;
-
-  // vdso may not exist
-  if (NULL != sh_exit_vdso_info.dlpi_phdr)
-    if (sh_exit_is_in_elf_range(pc, &sh_exit_vdso_info)) return true;
-
-  return false;
-}
-
-static bool sh_exit_is_zero(uintptr_t buf, size_t buf_len) {
-  for (uintptr_t i = buf; i < buf + buf_len; i += sizeof(uintptr_t))
-    if (*((uintptr_t *)i) != 0) return false;
-
-  return true;
-}
-
-static int sh_exit_fill_zero(uintptr_t start, uintptr_t end, bool readable, xdl_info_t *dlinfo) {
-  size_t size = end - start;
-  bool set_prot_rwx = false;
-
-  if (!readable) {
-    if (0 != sh_util_mprotect(start, size, PROT_READ | PROT_WRITE | PROT_EXEC)) return -1;
-    set_prot_rwx = true;
-  }
-
-  if (*((uint64_t *)start) != SH_EXIT_CLEAR_FLAG) {
-    SH_LOG_INFO("exit: gap fill zero, %" PRIxPTR " - %" PRIxPTR " (load_bias %" PRIxPTR ", %" PRIxPTR
-                " - %" PRIxPTR "), READABLE %d",
-                start, end, (uintptr_t)dlinfo->dli_fbase, start - (uintptr_t)dlinfo->dli_fbase,
-                end - (uintptr_t)dlinfo->dli_fbase, readable ? 1 : 0);
-    if (!set_prot_rwx)
-      if (0 != sh_util_mprotect(start, size, PROT_READ | PROT_WRITE | PROT_EXEC)) return -1;
-    memset((void *)start, 0, size);
-    *((uint64_t *)(start)) = SH_EXIT_CLEAR_FLAG;
-    sh_util_clear_cache(start, size);
-  }
-
-  return 0;
-}
-
-static int sh_exit_try_alloc_in_library(uintptr_t *exit_addr, uintptr_t pc, xdl_info_t *dlinfo, uint8_t *exit,
-                                        size_t exit_len, size_t range_low, size_t range_high, uintptr_t start,
-                                        uintptr_t end) {
-  if (pc >= range_low) start = SH_UTIL_MAX(start, pc - range_low);
-  start = SH_UTIL_ALIGN_END(start, exit_len);
-
-  if (range_high <= UINTPTR_MAX - pc) end = SH_UTIL_MIN(end - exit_len, pc + range_high);
-  end = SH_UTIL_ALIGN_START(end, exit_len);
-
-  if (end < start) return -1;
-  SH_LOG_INFO("exit: gap resize, %" PRIxPTR " - %" PRIxPTR " (load_bias %" PRIxPTR ", %" PRIxPTR
-              " - %" PRIxPTR ")",
-              start, end, (uintptr_t)dlinfo->dli_fbase, start - (uintptr_t)dlinfo->dli_fbase,
-              end - (uintptr_t)dlinfo->dli_fbase);
-
-  for (uintptr_t cur = start; cur <= end; cur += exit_len) {
-    // check if the current space has been used
-    if (!sh_exit_is_zero(cur, exit_len)) continue;
-
-    // write shellcode to the current location
-    if (0 != sh_util_mprotect(cur, exit_len, PROT_READ | PROT_WRITE | PROT_EXEC)) return -1;
-    memcpy((void *)cur, exit, exit_len);
-    sh_util_clear_cache(cur, exit_len);
-    *exit_addr = cur;
-    SH_LOG_INFO("exit: in-library alloc, at %" PRIxPTR " (load_bias %" PRIxPTR ", %" PRIxPTR "), len %zu",
-                cur, (uintptr_t)dlinfo->dli_fbase, cur - (uintptr_t)dlinfo->dli_fbase, exit_len);
-    return 0;
-  }
-  return -1;
-}
-
-static int sh_exit_alloc_in_library(uintptr_t *exit_addr, uintptr_t pc, xdl_info_t *dlinfo, uint8_t *exit,
-                                    size_t exit_len, size_t range_low, size_t range_high) {
-  int r = -1;
-  *exit_addr = 0;
-
-  bool elf_loaded_by_kernel = sh_exit_is_elf_loaded_by_kernel(pc);
-
-  pthread_mutex_lock(&sh_exit_lock);
-
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    sh_exit_gap_t gaps[SH_EXIT_GAPS_CAP];
-    size_t gaps_used = sh_exit_get_gaps(dlinfo, gaps, SH_EXIT_GAPS_CAP, elf_loaded_by_kernel);
-    for (size_t i = 0; i < gaps_used; i++) {
-      // fill zero
-      if (gaps[i].need_fill_zero) {
-        if (0 != sh_exit_fill_zero(gaps[i].start, gaps[i].end, gaps[i].readable, dlinfo)) return -1;
-      }
-
-      if (0 == (r = sh_exit_try_alloc_in_library(exit_addr, pc, dlinfo, exit, exit_len, range_low, range_high,
-                                                 gaps[i].start, gaps[i].end)))
-        break;
-    }
-  }
-  SH_SIG_CATCH() {
-    r = -1;
-    *exit_addr = 0;
-    SH_LOG_WARN("exit: alloc crashed");
-  }
-  SH_SIG_EXIT
-
-  pthread_mutex_unlock(&sh_exit_lock);
-  return r;
-}
-
-static int sh_exit_free_in_library(uintptr_t exit_addr, uint8_t *exit, size_t exit_len) {
-  int r;
-
-  pthread_mutex_lock(&sh_exit_lock);
-
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    if (0 != memcmp((void *)exit_addr, exit, exit_len)) {
-      r = SHADOWHOOK_ERRNO_UNHOOK_EXIT_MISMATCH;
-      goto err;
-    }
-    if (0 != sh_util_mprotect((uintptr_t)exit_addr, exit_len, PROT_READ | PROT_WRITE | PROT_EXEC)) {
-      r = SHADOWHOOK_ERRNO_MPROT;
-      goto err;
-    }
-    memset((void *)exit_addr, 0, exit_len);
-    sh_util_clear_cache((uintptr_t)exit_addr, exit_len);
-    r = 0;
-  err:;
-  }
-  SH_SIG_CATCH() {
-    r = SHADOWHOOK_ERRNO_UNHOOK_EXIT_CRASH;
-    SH_LOG_WARN("exit: free crashed");
-  }
-  SH_SIG_EXIT
-
-  pthread_mutex_unlock(&sh_exit_lock);
-  return r;
-}
-
-int sh_exit_alloc(uintptr_t *exit_addr, uint16_t *exit_type, uintptr_t pc, xdl_info_t *dlinfo, uint8_t *exit,
-                  size_t exit_len, size_t range_low, size_t range_high) {
-  int r;
-
-  // (1) try out-library mode first. Because ELF gaps are a valuable non-renewable resource.
-  *exit_type = SH_EXIT_TYPE_OUT_LIBRARY;
-  r = sh_exit_alloc_out_library(exit_addr, pc, dlinfo, exit, exit_len, range_low, range_high);
-  if (0 == r) goto ok;
-
-  // (2) try in-library mode.
-  *exit_type = SH_EXIT_TYPE_IN_LIBRARY;
-  r = sh_exit_alloc_in_library(exit_addr, pc, dlinfo, exit, exit_len, range_low, range_high);
-  if (0 == r) goto ok;
-
-  return r;
-
-ok:
-  SH_LOG_INFO("exit: alloc %s library, exit %" PRIxPTR ", pc %" PRIxPTR ", distance %" PRIxPTR
-              ", range [-%zx, %zx]",
-              (*exit_type == SH_EXIT_TYPE_OUT_LIBRARY ? "out" : "in"), *exit_addr, pc,
-              (pc > *exit_addr ? pc - *exit_addr : *exit_addr - pc), range_low, range_high);
-  return 0;
-}
-
-int sh_exit_free(uintptr_t exit_addr, uint16_t exit_type, uint8_t *exit, size_t exit_len) {
-  if (SH_EXIT_TYPE_OUT_LIBRARY == exit_type) {
-    (void)exit, (void)exit_len;
-    sh_exit_free_out_library(exit_addr);
-    return 0;
-  } else
-    return sh_exit_free_in_library(exit_addr, exit, exit_len);
-}
-
-#pragma clang diagnostic pop
diff --git a/app/src/main/cpp/shadowhook/sh_exit.h b/app/src/main/cpp/shadowhook/sh_exit.h
deleted file mode 100644
index e0f46b6..0000000
--- a/app/src/main/cpp/shadowhook/sh_exit.h
+++ /dev/null
@@ -1,34 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stddef.h>
-#include <stdint.h>
-
-#include "xdl.h"
-
-void sh_exit_init(void);
-
-int sh_exit_alloc(uintptr_t *exit_addr, uint16_t *exit_type, uintptr_t pc, xdl_info_t *dlinfo, uint8_t *exit,
-                  size_t exit_len, size_t range_low, size_t range_high);
-int sh_exit_free(uintptr_t exit_addr, uint16_t exit_type, uint8_t *exit, size_t exit_len);
diff --git a/app/src/main/cpp/shadowhook/sh_hub.c b/app/src/main/cpp/shadowhook/sh_hub.c
deleted file mode 100644
index eef9a34..0000000
--- a/app/src/main/cpp/shadowhook/sh_hub.c
+++ /dev/null
@@ -1,538 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_hub.h"
-
-#include <pthread.h>
-#include <stdbool.h>
-#include <stdint.h>
-#include <stdlib.h>
-#include <string.h>
-#include <sys/mman.h>
-#include <sys/prctl.h>
-
-#include "queue.h"
-#include "sh_log.h"
-#include "sh_safe.h"
-#include "sh_sig.h"
-#include "sh_trampo.h"
-#include "sh_util.h"
-#include "shadowhook.h"
-#include "tree.h"
-
-#define SH_HUB_TRAMPO_PAGE_NAME "shadowhook-hub-trampo"
-#define SH_HUB_TRAMPO_DELAY_SEC 5
-#define SH_HUB_STACK_NAME       "shadowhook-hub-stack"
-#define SH_HUB_STACK_SIZE       4096
-#define SH_HUB_STACK_FRAME_MAX  127  // keep sizeof(sh_hub_stack_t) < 4K
-#define SH_HUB_THREAD_MAX       1024
-#define SH_HUB_DELAY_SEC        10
-
-#define SH_HUB_FRAME_FLAG_NONE            ((uintptr_t)0)
-#define SH_HUB_FRAME_FLAG_ALLOW_REENTRANT ((uintptr_t)(1 << 0))
-
-// proxy for each hook-task in the same target-address
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wpadded"
-typedef struct sh_hub_proxy {
-  void *func;
-  bool enabled;
-  SLIST_ENTRY(sh_hub_proxy, ) link;
-} sh_hub_proxy_t;
-#pragma clang diagnostic pop
-
-// proxy list for each hub
-typedef SLIST_HEAD(sh_hub_proxy_list, sh_hub_proxy, ) sh_hub_proxy_list_t;
-
-// frame in the stack
-typedef struct {
-  sh_hub_proxy_list_t proxies;
-  uintptr_t orig_addr;
-  void *return_address;
-  uintptr_t flags;
-} sh_hub_frame_t;
-
-// stack for each thread
-typedef struct {
-  size_t frames_cnt;
-  sh_hub_frame_t frames[SH_HUB_STACK_FRAME_MAX];
-} sh_hub_stack_t;
-
-// hub for each target-address
-struct sh_hub {
-  sh_hub_proxy_list_t proxies;
-  pthread_mutex_t proxies_lock;
-  uintptr_t orig_addr;
-  uintptr_t trampo;
-  time_t destroy_ts;
-  LIST_ENTRY(sh_hub, ) link;
-};
-
-// hub list for delayed-destroy staging
-typedef LIST_HEAD(sh_hub_list, sh_hub, ) sh_hub_list_t;
-
-// global data for hub delayed-destroy staging
-static sh_hub_list_t sh_hub_delayed_destroy;
-static pthread_mutex_t sh_hub_delayed_destroy_lock;
-
-// global data for trampo
-static sh_trampo_mgr_t sh_hub_trampo_mgr;
-
-// global data for stack
-static pthread_key_t sh_hub_stack_tls_key;
-static sh_hub_stack_t *sh_hub_stack_cache;
-static uint8_t *sh_hub_stack_cache_used;
-
-// hub trampoline template
-extern void *sh_hub_trampo_template_data __attribute__((visibility("hidden")));
-__attribute__((naked)) static void sh_hub_trampo_template(void) {
-#if defined(__arm__)
-  __asm__(
-      // Save parameter registers, LR
-      "push  { r0 - r3, lr }     \n"
-
-      // Call sh_hub_push_stack()
-      "ldr   r0, hub_ptr         \n"
-      "mov   r1, lr              \n"
-      "ldr   ip, push_stack      \n"
-      "blx   ip                  \n"
-
-      // Save the hook function's address to IP register
-      "mov   ip, r0              \n"
-
-      // Restore parameter registers, LR
-      "pop   { r0 - r3, lr }     \n"
-
-      // Call hook function
-      "bx    ip                  \n"
-
-      "sh_hub_trampo_template_data:"
-      ".global sh_hub_trampo_template_data;"
-      "push_stack:"
-      ".word 0;"
-      "hub_ptr:"
-      ".word 0;");
-#elif defined(__aarch64__)
-  __asm__(
-      // Save parameter registers, XR(X8), LR
-      "stp   x0, x1, [sp, #-0xd0]!    \n"
-      "stp   x2, x3, [sp, #0x10]      \n"
-      "stp   x4, x5, [sp, #0x20]      \n"
-      "stp   x6, x7, [sp, #0x30]      \n"
-      "stp   x8, lr, [sp, #0x40]      \n"
-      "stp   q0, q1, [sp, #0x50]      \n"
-      "stp   q2, q3, [sp, #0x70]      \n"
-      "stp   q4, q5, [sp, #0x90]      \n"
-      "stp   q6, q7, [sp, #0xb0]      \n"
-
-      // Call sh_hub_push_stack()
-      "ldr   x0, hub_ptr              \n"
-      "mov   x1, lr                   \n"
-      "ldr   x16, push_stack          \n"
-      "blr   x16                      \n"
-
-      // Save the hook function's address to IP register
-      "mov   x16, x0                  \n"
-
-      // Restore parameter registers, XR(X8), LR
-      "ldp   q6, q7, [sp, #0xb0]      \n"
-      "ldp   q4, q5, [sp, #0x90]      \n"
-      "ldp   q2, q3, [sp, #0x70]      \n"
-      "ldp   q0, q1, [sp, #0x50]      \n"
-      "ldp   x8, lr, [sp, #0x40]      \n"
-      "ldp   x6, x7, [sp, #0x30]      \n"
-      "ldp   x4, x5, [sp, #0x20]      \n"
-      "ldp   x2, x3, [sp, #0x10]      \n"
-      "ldp   x0, x1, [sp], #0xd0      \n"
-
-      // Call hook function
-      "br    x16                      \n"
-
-      "sh_hub_trampo_template_data:"
-      ".global sh_hub_trampo_template_data;"
-      "push_stack:"
-      ".quad 0;"
-      "hub_ptr:"
-      ".quad 0;");
-#endif
-}
-
-static void *sh_hub_trampo_template_start(void) {
-#if defined(__arm__) && defined(__thumb__)
-  return (void *)((uintptr_t)&sh_hub_trampo_template - 1);
-#else
-  return (void *)&sh_hub_trampo_template;
-#endif
-}
-
-static sh_hub_stack_t *sh_hub_stack_create(void) {
-  // get stack from global cache
-  for (size_t i = 0; i < SH_HUB_THREAD_MAX; i++) {
-    uint8_t *used = &(sh_hub_stack_cache_used[i]);
-    if (0 == *used) {
-      uint8_t expected = 0;
-      if (__atomic_compare_exchange_n(used, &expected, 1, false, __ATOMIC_ACQUIRE, __ATOMIC_RELAXED)) {
-        sh_hub_stack_t *stack = &(sh_hub_stack_cache[i]);
-        stack->frames_cnt = 0;
-        SH_LOG_DEBUG("hub: get stack from global cache[%zu] %p", i, (void *)stack);
-        return stack;  // OK
-      }
-    }
-  }
-
-  // create new stack by mmap
-  int prot = PROT_READ | PROT_WRITE;
-  int flags = MAP_PRIVATE | MAP_ANONYMOUS;
-  void *buf = sh_safe_mmap(NULL, SH_HUB_STACK_SIZE, prot, flags, -1, 0);
-  if (MAP_FAILED == buf) return NULL;  // failed
-  sh_safe_prctl(PR_SET_VMA, PR_SET_VMA_ANON_NAME, (unsigned long)buf, SH_HUB_STACK_SIZE,
-                (unsigned long)SH_HUB_STACK_NAME);
-  sh_hub_stack_t *stack = (sh_hub_stack_t *)buf;
-  stack->frames_cnt = 0;
-  return stack;  // OK
-}
-
-static void sh_hub_stack_destroy(void *buf) {
-  if (NULL == buf) return;
-
-  if ((uintptr_t)sh_hub_stack_cache <= (uintptr_t)buf &&
-      (uintptr_t)buf < ((uintptr_t)sh_hub_stack_cache + SH_HUB_THREAD_MAX * sizeof(sh_hub_stack_t))) {
-    // return stack to global cache
-    size_t i = ((uintptr_t)buf - (uintptr_t)sh_hub_stack_cache) / sizeof(sh_hub_stack_t);
-    uint8_t *used = &(sh_hub_stack_cache_used[i]);
-    if (1 != *used) abort();
-    __atomic_store_n(used, 0, __ATOMIC_RELEASE);
-    SH_LOG_DEBUG("hub: return stack to global cache[%zu] %p", i, buf);
-  } else {
-    // munmap stack
-    munmap(buf, SH_HUB_STACK_SIZE);
-  }
-}
-
-int sh_hub_init(void) {
-  LIST_INIT(&sh_hub_delayed_destroy);
-  pthread_mutex_init(&sh_hub_delayed_destroy_lock, NULL);
-
-  // init TLS key
-  if (__predict_false(0 != pthread_key_create(&sh_hub_stack_tls_key, sh_hub_stack_destroy))) return -1;
-
-  // init hub's stack cache
-  if (__predict_false(NULL == (sh_hub_stack_cache = malloc(SH_HUB_THREAD_MAX * sizeof(sh_hub_stack_t)))))
-    return -1;
-  if (__predict_false(NULL == (sh_hub_stack_cache_used = calloc(SH_HUB_THREAD_MAX, sizeof(uint8_t)))))
-    return -1;
-
-  // init hub's trampoline manager
-  size_t code_size = (uintptr_t)(&sh_hub_trampo_template_data) - (uintptr_t)(sh_hub_trampo_template_start());
-  size_t data_size = sizeof(void *) + sizeof(void *);
-  sh_trampo_init_mgr(&sh_hub_trampo_mgr, SH_HUB_TRAMPO_PAGE_NAME, code_size + data_size,
-                     SH_HUB_TRAMPO_DELAY_SEC);
-
-  return 0;
-}
-
-static void *sh_hub_push_stack(sh_hub_t *self, void *return_address) {
-  sh_hub_stack_t *stack = (sh_hub_stack_t *)sh_safe_pthread_getspecific(sh_hub_stack_tls_key);
-
-  // create stack, only once
-  if (__predict_false(NULL == stack)) {
-    if (__predict_false(NULL == (stack = sh_hub_stack_create()))) goto end;
-    sh_safe_pthread_setspecific(sh_hub_stack_tls_key, (void *)stack);
-  }
-
-  // check whether a recursive call occurred
-  bool recursive = false;
-  for (size_t i = stack->frames_cnt; i > 0; i--) {
-    sh_hub_frame_t *frame = &stack->frames[i - 1];
-    if (0 == (frame->flags & SH_HUB_FRAME_FLAG_ALLOW_REENTRANT) && (frame->orig_addr == self->orig_addr)) {
-      // recursive call found
-      recursive = true;
-      break;
-    }
-  }
-
-  // find and return the first enabled proxy's function in the proxy-list
-  // (does not include the original function)
-  if (!recursive) {
-    sh_hub_proxy_t *proxy;
-    SLIST_FOREACH(proxy, &self->proxies, link) {
-      if (proxy->enabled) {
-        // push a new frame for the current proxy
-        if (stack->frames_cnt >= SH_HUB_STACK_FRAME_MAX) goto end;
-        stack->frames_cnt++;
-        SH_LOG_DEBUG("hub: frames_cnt++ = %zu", stack->frames_cnt);
-        sh_hub_frame_t *frame = &stack->frames[stack->frames_cnt - 1];
-        frame->proxies = self->proxies;
-        frame->orig_addr = self->orig_addr;
-        frame->return_address = return_address;
-        frame->flags = SH_HUB_FRAME_FLAG_NONE;
-
-        // return the first enabled proxy's function
-        SH_LOG_DEBUG("hub: push_stack() return first enabled proxy %p", proxy->func);
-        return proxy->func;
-      }
-    }
-  }
-
-  // if not found enabled proxy in the proxy-list, or recursive call found,
-  // just return the original-function
-end:
-  SH_LOG_DEBUG("hub: push_stack() return orig_addr %p", (void *)self->orig_addr);
-  return (void *)self->orig_addr;
-}
-
-void sh_hub_pop_stack(void *return_address) {
-  sh_hub_stack_t *stack = (sh_hub_stack_t *)sh_safe_pthread_getspecific(sh_hub_stack_tls_key);
-  if (0 == stack->frames_cnt) return;
-  sh_hub_frame_t *frame = &stack->frames[stack->frames_cnt - 1];
-
-  // only the first proxy will actually execute pop-stack()
-  if (frame->return_address == return_address) {
-    stack->frames_cnt--;
-    SH_LOG_DEBUG("hub: frames_cnt-- = %zu", stack->frames_cnt);
-  }
-}
-
-sh_hub_t *sh_hub_create(uintptr_t target_addr, uintptr_t *trampo) {
-  size_t code_size = (uintptr_t)(&sh_hub_trampo_template_data) - (uintptr_t)(sh_hub_trampo_template_start());
-  size_t data_size = sizeof(void *) + sizeof(void *);
-
-  sh_hub_t *self = malloc(sizeof(sh_hub_t));
-  if (NULL == self) return NULL;
-  SLIST_INIT(&self->proxies);
-  pthread_mutex_init(&self->proxies_lock, NULL);
-  self->orig_addr = 0;
-
-  // alloc memory for trampoline
-  if (0 == (self->trampo = sh_trampo_alloc(&sh_hub_trampo_mgr, 0, 0, 0))) {
-    free(self);
-    return NULL;
-  }
-
-  // fill in code
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    memcpy((void *)self->trampo, sh_hub_trampo_template_start(), code_size);
-  }
-  SH_SIG_CATCH() {
-    sh_trampo_free(&sh_hub_trampo_mgr, self->trampo);
-    free(self);
-    SH_LOG_WARN("hub: fill in code crashed");
-    return NULL;
-  }
-  SH_SIG_EXIT
-
-  // file in data
-  void **data = (void **)(self->trampo + code_size);
-  *data++ = (void *)sh_hub_push_stack;
-  *data = (void *)self;
-
-  // clear CPU cache
-  sh_util_clear_cache(self->trampo, code_size + data_size);
-
-#if defined(__arm__) && defined(__thumb__)
-  *trampo = self->trampo + 1;
-#else
-  *trampo = self->trampo;
-#endif
-
-  SH_LOG_INFO("hub: create trampo for target_addr %" PRIxPTR " at %" PRIxPTR ", size %zu + %zu = %zu",
-              target_addr, *trampo, code_size, data_size, code_size + data_size);
-  return self;
-}
-
-static void sh_hub_destroy_inner(sh_hub_t *self) {
-  pthread_mutex_destroy(&self->proxies_lock);
-
-  if (0 != self->trampo) sh_trampo_free(&sh_hub_trampo_mgr, self->trampo);
-
-  while (!SLIST_EMPTY(&self->proxies)) {
-    sh_hub_proxy_t *proxy = SLIST_FIRST(&self->proxies);
-    SLIST_REMOVE_HEAD(&self->proxies, link);
-    free(proxy);
-  }
-
-  free(self);
-}
-
-void sh_hub_destroy(sh_hub_t *self, bool with_delay) {
-  if (SHADOWHOOK_IS_SHARED_MODE) {
-    struct timeval now;
-    gettimeofday(&now, NULL);
-
-    if (!LIST_EMPTY(&sh_hub_delayed_destroy)) {
-      pthread_mutex_lock(&sh_hub_delayed_destroy_lock);
-      sh_hub_t *hub, *hub_tmp;
-      LIST_FOREACH_SAFE(hub, &sh_hub_delayed_destroy, link, hub_tmp)
-      if (now.tv_sec - hub->destroy_ts > SH_HUB_DELAY_SEC) {
-        LIST_REMOVE(hub, link);
-        sh_hub_destroy_inner(hub);
-      }
-      pthread_mutex_unlock(&sh_hub_delayed_destroy_lock);
-    }
-
-    if (with_delay) {
-      self->destroy_ts = now.tv_sec;
-      sh_trampo_free(&sh_hub_trampo_mgr, self->trampo);
-      self->trampo = 0;
-
-      pthread_mutex_lock(&sh_hub_delayed_destroy_lock);
-      LIST_INSERT_HEAD(&sh_hub_delayed_destroy, self, link);
-      pthread_mutex_unlock(&sh_hub_delayed_destroy_lock);
-    } else
-      sh_hub_destroy_inner(self);
-  } else
-    sh_hub_destroy_inner(self);
-}
-
-uintptr_t sh_hub_get_orig_addr(sh_hub_t *self) {
-  return self->orig_addr;
-}
-
-uintptr_t *sh_hub_get_orig_addr_addr(sh_hub_t *self) {
-  return &self->orig_addr;
-}
-
-int sh_hub_add_proxy(sh_hub_t *self, uintptr_t func) {
-  int r = SHADOWHOOK_ERRNO_OK;
-
-  pthread_mutex_lock(&self->proxies_lock);
-
-  // check repeated funcion
-  sh_hub_proxy_t *proxy;
-  SLIST_FOREACH(proxy, &self->proxies, link) {
-    if (proxy->enabled && proxy->func == (void *)func) {
-      r = SHADOWHOOK_ERRNO_HOOK_DUP;
-      goto end;
-    }
-  }
-
-  // try to re-enable an exists item
-  SLIST_FOREACH(proxy, &self->proxies, link) {
-    if (proxy->func == (void *)func) {
-      if (!proxy->enabled) __atomic_store_n((bool *)&proxy->enabled, true, __ATOMIC_SEQ_CST);
-
-      SH_LOG_INFO("hub: add(re-enable) func %" PRIxPTR, func);
-      goto end;
-    }
-  }
-
-  // create new item
-  if (NULL == (proxy = malloc(sizeof(sh_hub_proxy_t)))) {
-    r = SHADOWHOOK_ERRNO_OOM;
-    goto end;
-  }
-  proxy->func = (void *)func;
-  proxy->enabled = true;
-
-  // insert to the head of the proxy-list
-  // equivalent to: SLIST_INSERT_HEAD(&self->proxies, proxy, link);
-  // but: __ATOMIC_RELEASE ensures readers see only fully-constructed item
-  SLIST_NEXT(proxy, link) = SLIST_FIRST(&self->proxies);
-  __atomic_store_n((uintptr_t *)(&SLIST_FIRST(&self->proxies)), (uintptr_t)proxy, __ATOMIC_RELEASE);
-  SH_LOG_INFO("hub: add(new) func %" PRIxPTR, func);
-
-end:
-  pthread_mutex_unlock(&self->proxies_lock);
-  return r;
-}
-
-int sh_hub_del_proxy(sh_hub_t *self, uintptr_t func, bool *have_enabled_proxy) {
-  *have_enabled_proxy = false;
-
-  pthread_mutex_lock(&self->proxies_lock);
-
-  sh_hub_proxy_t *proxy;
-  bool deleted = false;
-  SLIST_FOREACH(proxy, &self->proxies, link) {
-    if (proxy->func == (void *)func) {
-      if (proxy->enabled) __atomic_store_n((bool *)&proxy->enabled, false, __ATOMIC_SEQ_CST);
-
-      deleted = true;
-      SH_LOG_INFO("hub: del func %" PRIxPTR, func);
-    }
-
-    if (proxy->enabled && !*have_enabled_proxy) *have_enabled_proxy = true;
-
-    if (deleted && *have_enabled_proxy) break;
-  }
-
-  pthread_mutex_unlock(&self->proxies_lock);
-
-  return deleted ? 0 : -1;
-}
-
-static sh_hub_frame_t *sh_hub_get_current_frame(void *return_address) {
-  sh_hub_stack_t *stack = (sh_hub_stack_t *)sh_safe_pthread_getspecific(sh_hub_stack_tls_key);
-  if (0 == stack->frames_cnt) return NULL;
-  sh_hub_frame_t *frame = &stack->frames[stack->frames_cnt - 1];
-  return frame->return_address == return_address ? frame : NULL;
-}
-
-void sh_hub_allow_reentrant(void *return_address) {
-  sh_hub_frame_t *frame = sh_hub_get_current_frame(return_address);
-  if (NULL != frame) {
-    frame->flags |= SH_HUB_FRAME_FLAG_ALLOW_REENTRANT;
-    SH_LOG_DEBUG("hub: allow reentrant frame %p", return_address);
-  }
-}
-
-void sh_hub_disallow_reentrant(void *return_address) {
-  sh_hub_frame_t *frame = sh_hub_get_current_frame(return_address);
-  if (NULL != frame) {
-    frame->flags &= ~SH_HUB_FRAME_FLAG_ALLOW_REENTRANT;
-    SH_LOG_DEBUG("hub: disallow reentrant frame %p", return_address);
-  }
-}
-
-void *sh_hub_get_prev_func(void *func) {
-  sh_hub_stack_t *stack = (sh_hub_stack_t *)sh_safe_pthread_getspecific(sh_hub_stack_tls_key);
-  if (0 == stack->frames_cnt) sh_safe_abort();  // called in a non-hook status?
-  sh_hub_frame_t *frame = &stack->frames[stack->frames_cnt - 1];
-
-  // find and return the next enabled hook-function in the hook-chain
-  bool found = false;
-  sh_hub_proxy_t *proxy;
-  SLIST_FOREACH(proxy, &(frame->proxies), link) {
-    if (!found) {
-      if (proxy->func == func) found = true;
-    } else {
-      if (proxy->enabled) break;
-    }
-  }
-  if (NULL != proxy) {
-    SH_LOG_DEBUG("hub: get_prev_func() return next enabled proxy %p", proxy->func);
-    return proxy->func;
-  }
-
-  SH_LOG_DEBUG("hub: get_prev_func() return orig_addr %p", (void *)frame->orig_addr);
-  // did not find, return the original-function
-  return (void *)frame->orig_addr;
-}
-
-void *sh_hub_get_return_address(void) {
-  sh_hub_stack_t *stack = (sh_hub_stack_t *)sh_safe_pthread_getspecific(sh_hub_stack_tls_key);
-  if (0 == stack->frames_cnt) sh_safe_abort();  // called in a non-hook status?
-  sh_hub_frame_t *frame = &stack->frames[stack->frames_cnt - 1];
-
-  return frame->return_address;
-}
diff --git a/app/src/main/cpp/shadowhook/sh_hub.h b/app/src/main/cpp/shadowhook/sh_hub.h
deleted file mode 100644
index accbfb5..0000000
--- a/app/src/main/cpp/shadowhook/sh_hub.h
+++ /dev/null
@@ -1,45 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stdbool.h>
-#include <stdint.h>
-
-int sh_hub_init(void);
-
-typedef struct sh_hub sh_hub_t;
-
-sh_hub_t *sh_hub_create(uintptr_t target_addr, uintptr_t *trampo);
-void sh_hub_destroy(sh_hub_t *self, bool with_delay);
-
-uintptr_t sh_hub_get_orig_addr(sh_hub_t *self);
-uintptr_t *sh_hub_get_orig_addr_addr(sh_hub_t *self);
-
-int sh_hub_add_proxy(sh_hub_t *self, uintptr_t func);
-int sh_hub_del_proxy(sh_hub_t *self, uintptr_t func, bool *have_enabled_proxy);
-
-void *sh_hub_get_prev_func(void *func);
-void sh_hub_pop_stack(void *return_address);
-void sh_hub_allow_reentrant(void *return_address);
-void sh_hub_disallow_reentrant(void *return_address);
-void *sh_hub_get_return_address(void);
diff --git a/app/src/main/cpp/shadowhook/sh_jni.c b/app/src/main/cpp/shadowhook/sh_jni.c
deleted file mode 100644
index 051f6d9..0000000
--- a/app/src/main/cpp/shadowhook/sh_jni.c
+++ /dev/null
@@ -1,139 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include <errno.h>
-#include <jni.h>
-#include <stdlib.h>
-#include <unistd.h>
-
-#include "sh_log.h"
-#include "shadowhook.h"
-
-#define SH_JNI_VERSION    JNI_VERSION_1_6
-#define SH_JNI_CLASS_NAME "com/bytedance/shadowhook/ShadowHook"
-
-static jstring sh_jni_get_version(JNIEnv *env, jobject thiz) {
-  (void)thiz;
-  return (*env)->NewStringUTF(env, shadowhook_get_version());
-}
-
-static jint sh_jni_init(JNIEnv *env, jobject thiz, jint mode, jboolean debuggable) {
-  (void)env, (void)thiz;
-
-  return shadowhook_init(0 == mode ? SHADOWHOOK_MODE_SHARED : SHADOWHOOK_MODE_UNIQUE, (bool)debuggable);
-}
-
-static jint sh_jni_get_init_errno(JNIEnv *env, jobject thiz) {
-  (void)env, (void)thiz;
-
-  return shadowhook_get_init_errno();
-}
-
-static jint sh_jni_get_mode(JNIEnv *env, jobject thiz) {
-  (void)env, (void)thiz;
-
-  return SHADOWHOOK_MODE_SHARED == shadowhook_get_mode() ? 0 : 1;
-}
-
-static jboolean sh_jni_get_debuggable(JNIEnv *env, jobject thiz) {
-  (void)env, (void)thiz;
-
-  return shadowhook_get_debuggable();
-}
-
-static void sh_jni_set_debuggable(JNIEnv *env, jobject thiz, jboolean debuggable) {
-  (void)env, (void)thiz;
-
-  shadowhook_set_debuggable((bool)debuggable);
-}
-
-static jboolean sh_jni_get_recordable(JNIEnv *env, jobject thiz) {
-  (void)env, (void)thiz;
-
-  return shadowhook_get_recordable();
-}
-
-static void sh_jni_set_recordable(JNIEnv *env, jobject thiz, jboolean recordable) {
-  (void)env, (void)thiz;
-
-  shadowhook_set_recordable((bool)recordable);
-}
-
-static jstring sh_jni_to_errmsg(JNIEnv *env, jobject thiz, jint error_number) {
-  (void)thiz;
-
-  return (*env)->NewStringUTF(env, shadowhook_to_errmsg(error_number));
-}
-
-static jstring sh_jni_get_records(JNIEnv *env, jobject thiz, jint item_flags) {
-  (void)thiz;
-
-  char *str = shadowhook_get_records((uint32_t)item_flags);
-  if (NULL == str) return NULL;
-
-  jstring jstr = (*env)->NewStringUTF(env, str);
-  free(str);
-  return jstr;
-}
-
-static jstring sh_jni_get_arch(JNIEnv *env, jobject thiz) {
-  (void)thiz;
-
-#if defined(__arm__)
-  char *arch = "arm";
-#elif defined(__aarch64__)
-  char *arch = "arm64";
-#else
-  char *arch = "unsupported";
-#endif
-
-  return (*env)->NewStringUTF(env, arch);
-}
-
-JNIEXPORT jint JNICALL JNI_OnLoad(JavaVM *vm, void *reserved) {
-  (void)reserved;
-
-  if (__predict_false(NULL == vm)) return JNI_ERR;
-
-  JNIEnv *env;
-  if (__predict_false(JNI_OK != (*vm)->GetEnv(vm, (void **)&env, SH_JNI_VERSION))) return JNI_ERR;
-  if (__predict_false(NULL == env || NULL == *env)) return JNI_ERR;
-
-  jclass cls;
-  if (__predict_false(NULL == (cls = (*env)->FindClass(env, SH_JNI_CLASS_NAME)))) return JNI_ERR;
-
-  JNINativeMethod m[] = {{"nativeGetVersion", "()Ljava/lang/String;", (void *)sh_jni_get_version},
-                         {"nativeInit", "(IZ)I", (void *)sh_jni_init},
-                         {"nativeGetInitErrno", "()I", (void *)sh_jni_get_init_errno},
-                         {"nativeGetMode", "()I", (void *)sh_jni_get_mode},
-                         {"nativeGetDebuggable", "()Z", (void *)sh_jni_get_debuggable},
-                         {"nativeSetDebuggable", "(Z)V", (void *)sh_jni_set_debuggable},
-                         {"nativeGetRecordable", "()Z", (void *)sh_jni_get_recordable},
-                         {"nativeSetRecordable", "(Z)V", (void *)sh_jni_set_recordable},
-                         {"nativeToErrmsg", "(I)Ljava/lang/String;", (void *)sh_jni_to_errmsg},
-                         {"nativeGetRecords", "(I)Ljava/lang/String;", (void *)sh_jni_get_records},
-                         {"nativeGetArch", "()Ljava/lang/String;", (void *)sh_jni_get_arch}};
-  if (__predict_false(0 != (*env)->RegisterNatives(env, cls, m, sizeof(m) / sizeof(m[0])))) return JNI_ERR;
-
-  return SH_JNI_VERSION;
-}
diff --git a/app/src/main/cpp/shadowhook/sh_linker.c b/app/src/main/cpp/shadowhook/sh_linker.c
deleted file mode 100644
index 2cf3a2e..0000000
--- a/app/src/main/cpp/shadowhook/sh_linker.c
+++ /dev/null
@@ -1,409 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_linker.h"
-
-#include <dlfcn.h>
-#include <pthread.h>
-#include <stddef.h>
-#include <stdint.h>
-#include <string.h>
-
-#include "sh_log.h"
-#include "sh_recorder.h"
-#include "sh_sig.h"
-#include "sh_switch.h"
-#include "sh_util.h"
-#include "shadowhook.h"
-#include "xdl.h"
-
-#ifndef __LP64__
-#define SH_LINKER_BASENAME "linker"
-#else
-#define SH_LINKER_BASENAME "linker64"
-#endif
-
-#define SH_LINKER_SYM_G_DL_MUTEX  "__dl__ZL10g_dl_mutex"
-#define SH_LINKER_SYM_DO_DLOPEN_L "__dl__Z9do_dlopenPKciPK17android_dlextinfo"
-#define SH_LINKER_SYM_DO_DLOPEN_N "__dl__Z9do_dlopenPKciPK17android_dlextinfoPv"
-#define SH_LINKER_SYM_DO_DLOPEN_O "__dl__Z9do_dlopenPKciPK17android_dlextinfoPKv"
-
-static bool sh_linker_dlopen_hooked = false;
-
-static sh_linker_post_dlopen_t sh_linker_post_dlopen;
-static void *sh_linker_post_dlopen_arg;
-
-static pthread_mutex_t *sh_linker_g_dl_mutex;
-static uintptr_t sh_linker_dlopen_addr;  // save address of dlopen(==4.x) or do_dlopen(>=5.0)
-static xdl_info_t sh_linker_dlopen_dlinfo;
-
-#if defined(__arm__) && __ANDROID_API__ < __ANDROID_API_L__
-static uintptr_t sh_linker_dlfcn[6];
-static const char *sh_linker_dlfcn_name[6] = {"dlopen", "dlerror", "dlsym",
-                                              "dladdr", "dlclose", "dl_unwind_find_exidx"};
-#endif
-
-__attribute__((constructor)) static void sh_linker_ctor(void) {
-  sh_linker_dlopen_addr = (uintptr_t)dlopen;
-#if defined(__arm__) && __ANDROID_API__ < __ANDROID_API_L__
-  sh_linker_dlfcn[0] = (uintptr_t)dlopen;
-  sh_linker_dlfcn[1] = (uintptr_t)dlerror;
-  sh_linker_dlfcn[2] = (uintptr_t)dlsym;
-  sh_linker_dlfcn[3] = (uintptr_t)dladdr;
-  sh_linker_dlfcn[4] = (uintptr_t)dlclose;
-  sh_linker_dlfcn[5] = (uintptr_t)dl_unwind_find_exidx;
-#endif
-}
-
-static void *sh_linker_get_base_addr(xdl_info_t *dlinfo) {
-  uintptr_t vaddr_min = UINTPTR_MAX;
-  for (size_t i = 0; i < dlinfo->dlpi_phnum; i++) {
-    const ElfW(Phdr) *phdr = &(dlinfo->dlpi_phdr[i]);
-    if (PT_LOAD == phdr->p_type && vaddr_min > phdr->p_vaddr) vaddr_min = phdr->p_vaddr;
-  }
-
-  if (UINTPTR_MAX == vaddr_min)
-    return dlinfo->dli_fbase;  // should not happen
-  else
-    return (void *)((uintptr_t)dlinfo->dli_fbase + SH_UTIL_PAGE_START(vaddr_min));
-}
-
-static bool sh_linker_check_arch(xdl_info_t *dlinfo) {
-  ElfW(Ehdr) *ehdr = (ElfW(Ehdr) *)sh_linker_get_base_addr(dlinfo);
-
-#if defined(__LP64__)
-#define SH_LINKER_ELF_CLASS   ELFCLASS64
-#define SH_LINKER_ELF_MACHINE EM_AARCH64
-#else
-#define SH_LINKER_ELF_CLASS   ELFCLASS32
-#define SH_LINKER_ELF_MACHINE EM_ARM
-#endif
-
-  if (0 != memcmp(ehdr->e_ident, ELFMAG, SELFMAG)) return false;
-  if (SH_LINKER_ELF_CLASS != ehdr->e_ident[EI_CLASS]) return false;
-  if (SH_LINKER_ELF_MACHINE != ehdr->e_machine) return false;
-
-  return true;
-}
-
-int sh_linker_init(void) {
-  memset(&sh_linker_dlopen_dlinfo, 0, sizeof(sh_linker_dlopen_dlinfo));
-
-  int api_level = sh_util_get_api_level();
-  if (__predict_true(api_level >= __ANDROID_API_L__)) {
-    sh_linker_dlopen_addr = 0;
-
-    void *handle = xdl_open(SH_LINKER_BASENAME, XDL_DEFAULT);
-    if (__predict_false(NULL == handle)) return -1;
-    xdl_info(handle, XDL_DI_DLINFO, (void *)&sh_linker_dlopen_dlinfo);
-    sh_linker_dlopen_dlinfo.dli_fname = SH_LINKER_BASENAME;
-
-    // get g_dl_mutex
-    sh_linker_g_dl_mutex = (pthread_mutex_t *)(xdl_dsym(handle, SH_LINKER_SYM_G_DL_MUTEX, NULL));
-
-    // get do_dlopen
-    if (api_level >= __ANDROID_API_O__)
-      sh_linker_dlopen_dlinfo.dli_sname = SH_LINKER_SYM_DO_DLOPEN_O;
-    else if (api_level >= __ANDROID_API_N__)
-      sh_linker_dlopen_dlinfo.dli_sname = SH_LINKER_SYM_DO_DLOPEN_N;
-    else
-      sh_linker_dlopen_dlinfo.dli_sname = SH_LINKER_SYM_DO_DLOPEN_L;
-    sh_linker_dlopen_dlinfo.dli_saddr =
-        xdl_dsym(handle, sh_linker_dlopen_dlinfo.dli_sname, &(sh_linker_dlopen_dlinfo.dli_ssize));
-    sh_linker_dlopen_addr = (uintptr_t)sh_linker_dlopen_dlinfo.dli_saddr;
-
-    xdl_close(handle);
-  }
-
-  return (0 != sh_linker_dlopen_addr && (0 != sh_linker_g_dl_mutex || api_level < __ANDROID_API_L__)) ? 0
-                                                                                                      : -1;
-}
-
-const char *sh_linker_match_dlfcn(uintptr_t target_addr) {
-#if defined(__arm__) && __ANDROID_API__ < __ANDROID_API_L__
-  if (sh_util_get_api_level() < __ANDROID_API_L__)
-    for (size_t i = 0; i < sizeof(sh_linker_dlfcn) / sizeof(sh_linker_dlfcn[0]); i++)
-      if (sh_linker_dlfcn[i] == target_addr) return sh_linker_dlfcn_name[i];
-#else
-  (void)target_addr;
-#endif
-
-  return NULL;
-}
-
-bool sh_linker_need_to_hook_dlopen(uintptr_t target_addr) {
-  return SHADOWHOOK_IS_UNIQUE_MODE && !sh_linker_dlopen_hooked && target_addr == sh_linker_dlopen_addr;
-}
-
-typedef void *(*sh_linker_proxy_dlopen_t)(const char *, int);
-static sh_linker_proxy_dlopen_t sh_linker_orig_dlopen;
-static void *sh_linker_proxy_dlopen(const char *filename, int flag) {
-  void *handle;
-  if (SHADOWHOOK_IS_SHARED_MODE)
-    handle = SHADOWHOOK_CALL_PREV(sh_linker_proxy_dlopen, sh_linker_proxy_dlopen_t, filename, flag);
-  else
-    handle = sh_linker_orig_dlopen(filename, flag);
-
-  if (NULL != handle) sh_linker_post_dlopen(sh_linker_post_dlopen_arg);
-
-  if (SHADOWHOOK_IS_SHARED_MODE) SHADOWHOOK_POP_STACK();
-  return handle;
-}
-
-typedef void *(*sh_linker_proxy_do_dlopen_l_t)(const char *, int, const void *);
-static sh_linker_proxy_do_dlopen_l_t sh_linker_orig_do_dlopen_l;
-static void *sh_linker_proxy_do_dlopen_l(const char *name, int flags, const void *extinfo) {
-  void *handle;
-  if (SHADOWHOOK_IS_SHARED_MODE)
-    handle = SHADOWHOOK_CALL_PREV(sh_linker_proxy_do_dlopen_l, sh_linker_proxy_do_dlopen_l_t, name, flags,
-                                  extinfo);
-  else
-    handle = sh_linker_orig_do_dlopen_l(name, flags, extinfo);
-
-  if (NULL != handle) sh_linker_post_dlopen(sh_linker_post_dlopen_arg);
-
-  if (SHADOWHOOK_IS_SHARED_MODE) SHADOWHOOK_POP_STACK();
-  return handle;
-}
-
-typedef void *(*sh_linker_proxy_do_dlopen_n_t)(const char *, int, const void *, void *);
-static sh_linker_proxy_do_dlopen_n_t sh_linker_orig_do_dlopen_n;
-static void *sh_linker_proxy_do_dlopen_n(const char *name, int flags, const void *extinfo,
-                                         void *caller_addr) {
-  void *handle;
-  if (SHADOWHOOK_IS_SHARED_MODE)
-    handle = SHADOWHOOK_CALL_PREV(sh_linker_proxy_do_dlopen_n, sh_linker_proxy_do_dlopen_n_t, name, flags,
-                                  extinfo, caller_addr);
-  else
-    handle = sh_linker_orig_do_dlopen_n(name, flags, extinfo, caller_addr);
-
-  if (NULL != handle) sh_linker_post_dlopen(sh_linker_post_dlopen_arg);
-
-  if (SHADOWHOOK_IS_SHARED_MODE) SHADOWHOOK_POP_STACK();
-  return handle;
-}
-
-int sh_linker_hook_dlopen(sh_linker_post_dlopen_t post_dlopen, void *post_dlopen_arg) {
-  static pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER;
-  static int result = SHADOWHOOK_ERRNO_MONITOR_DLOPEN;
-
-  if (sh_linker_dlopen_hooked) return result;
-  pthread_mutex_lock(&lock);
-  if (sh_linker_dlopen_hooked) goto end;
-
-  // try hooking-dlopen only once
-  sh_linker_dlopen_hooked = true;
-
-  // do init for SHARED mode
-  if (SHADOWHOOK_IS_SHARED_MODE)
-    if (0 != sh_linker_init()) goto end;
-
-  // save post callback ptr before hooking
-  sh_linker_post_dlopen = post_dlopen;
-  sh_linker_post_dlopen_arg = post_dlopen_arg;
-
-  // hook for dlopen() or do_dlopen()
-  int (*hook)(uintptr_t, uintptr_t, uintptr_t *, size_t *, xdl_info_t *) =
-      SHADOWHOOK_IS_SHARED_MODE ? sh_switch_hook : sh_switch_hook_invisible;
-  int api_level = sh_util_get_api_level();
-  size_t backup_len = 0;
-  int r;
-  if (api_level < __ANDROID_API_L__) {
-    // get & check dlinfo
-    r = sh_linker_get_dlinfo_by_addr((void *)sh_linker_dlopen_addr, &sh_linker_dlopen_dlinfo, NULL, 0, NULL,
-                                     0, false);
-    if (SHADOWHOOK_ERRNO_LINKER_ARCH_MISMATCH == r) result = SHADOWHOOK_ERRNO_LINKER_ARCH_MISMATCH;
-    if (0 != r) goto end;
-
-    // hook
-    r = hook(sh_linker_dlopen_addr, (uintptr_t)sh_linker_proxy_dlopen, (uintptr_t *)&sh_linker_orig_dlopen,
-             &backup_len, &sh_linker_dlopen_dlinfo);
-
-    // record
-    sh_recorder_add_hook(r, true, sh_linker_dlopen_addr, SH_LINKER_BASENAME, "dlopen",
-                         (uintptr_t)sh_linker_proxy_dlopen, backup_len, UINTPTR_MAX,
-                         (uintptr_t)(__builtin_return_address(0)));
-
-    if (0 != r) goto end;
-  } else {
-    // check dlinfo
-    if (!sh_linker_check_arch(&sh_linker_dlopen_dlinfo)) {
-      result = SHADOWHOOK_ERRNO_LINKER_ARCH_MISMATCH;
-      goto end;
-    }
-
-    uintptr_t proxy;
-    uintptr_t *orig;
-    if (api_level >= __ANDROID_API_N__) {
-      proxy = (uintptr_t)sh_linker_proxy_do_dlopen_n;
-      orig = (uintptr_t *)&sh_linker_orig_do_dlopen_n;
-    } else {
-      proxy = (uintptr_t)sh_linker_proxy_do_dlopen_l;
-      orig = (uintptr_t *)&sh_linker_orig_do_dlopen_l;
-    }
-
-    // hook
-    pthread_mutex_lock(sh_linker_g_dl_mutex);
-    r = hook(sh_linker_dlopen_addr, proxy, orig, &backup_len, &sh_linker_dlopen_dlinfo);
-    pthread_mutex_unlock(sh_linker_g_dl_mutex);
-
-    // record
-    sh_recorder_add_hook(r, true, sh_linker_dlopen_addr, SH_LINKER_BASENAME,
-                         sh_linker_dlopen_dlinfo.dli_sname, proxy, backup_len, UINTPTR_MAX,
-                         (uintptr_t)(__builtin_return_address(0)));
-
-    if (0 != r) goto end;
-  }
-
-  // OK
-  result = 0;
-
-end:
-  pthread_mutex_unlock(&lock);
-  SH_LOG_INFO("linker: hook dlopen %s, return: %d", 0 == result ? "OK" : "FAILED", result);
-  return result;
-}
-
-int sh_linker_get_dlinfo_by_addr(void *addr, xdl_info_t *dlinfo, char *lib_name, size_t lib_name_sz,
-                                 char *sym_name, size_t sym_name_sz, bool ignore_symbol_check) {
-  // dladdr()
-  bool crashed = false;
-  void *dlcache = NULL;
-  int r = 0;
-  if (sh_util_get_api_level() >= __ANDROID_API_L__) {
-    r = xdl_addr((void *)addr, dlinfo, &dlcache);
-  } else {
-    SH_SIG_TRY(SIGSEGV, SIGBUS) {
-      r = xdl_addr((void *)addr, dlinfo, &dlcache);
-    }
-    SH_SIG_CATCH() {
-      crashed = true;
-    }
-    SH_SIG_EXIT
-  }
-  SH_LOG_INFO("task: get dlinfo by target addr: target_addr %p, sym_name %s, sym_sz %zu, load_bias %" PRIxPTR
-              ", pathname %s",
-              addr, NULL == dlinfo->dli_sname ? "(NULL)" : dlinfo->dli_sname, dlinfo->dli_ssize,
-              (uintptr_t)dlinfo->dli_fbase, NULL == dlinfo->dli_fname ? "(NULL)" : dlinfo->dli_fname);
-
-  // check error
-  if (crashed) {
-    r = SHADOWHOOK_ERRNO_HOOK_DLADDR_CRASH;
-    goto end;
-  }
-  if (0 == r || NULL == dlinfo->dli_fname) {
-    r = SHADOWHOOK_ERRNO_HOOK_DLINFO;
-    goto end;
-  }
-  if (!sh_linker_check_arch(dlinfo)) {
-    r = SHADOWHOOK_ERRNO_ELF_ARCH_MISMATCH;
-    goto end;
-  }
-
-  if (NULL == dlinfo->dli_sname) {
-    if (ignore_symbol_check) {
-      dlinfo->dli_saddr = addr;
-      dlinfo->dli_sname = "unknown";
-      dlinfo->dli_ssize = 1024;  // big enough
-    } else {
-      const char *matched_dlfcn_name = NULL;
-      if (NULL == (matched_dlfcn_name = sh_linker_match_dlfcn((uintptr_t)addr))) {
-        r = SHADOWHOOK_ERRNO_HOOK_DLINFO;
-        goto end;
-      } else {
-        dlinfo->dli_saddr = addr;
-        dlinfo->dli_sname = matched_dlfcn_name;
-        dlinfo->dli_ssize = 4;  // safe length, only relative jumps are allowed
-        SH_LOG_INFO("task: match dlfcn, target_addr %p, sym_name %s", addr, matched_dlfcn_name);
-      }
-    }
-  }
-  if (0 == dlinfo->dli_ssize) {
-    r = SHADOWHOOK_ERRNO_HOOK_SYMSZ;
-    goto end;
-  }
-
-  if (NULL != lib_name) strlcpy(lib_name, dlinfo->dli_fname, lib_name_sz);
-  if (NULL != sym_name) strlcpy(sym_name, dlinfo->dli_sname, sym_name_sz);
-  r = 0;
-
-end:
-  xdl_addr_clean(&dlcache);
-  return r;
-}
-
-int sh_linker_get_dlinfo_by_sym_name(const char *lib_name, const char *sym_name, xdl_info_t *dlinfo,
-                                     char *real_lib_name, size_t real_lib_name_sz) {
-  // open library
-  bool crashed = false;
-  void *handle = NULL;
-  if (sh_util_get_api_level() >= __ANDROID_API_L__) {
-    handle = xdl_open(lib_name, XDL_DEFAULT);
-  } else {
-    SH_SIG_TRY(SIGSEGV, SIGBUS) {
-      handle = xdl_open(lib_name, XDL_DEFAULT);
-    }
-    SH_SIG_CATCH() {
-      crashed = true;
-    }
-    SH_SIG_EXIT
-  }
-  if (crashed) return SHADOWHOOK_ERRNO_HOOK_DLOPEN_CRASH;
-  if (NULL == handle) return SHADOWHOOK_ERRNO_PENDING;
-
-  // get dlinfo
-  xdl_info(handle, XDL_DI_DLINFO, (void *)dlinfo);
-
-  // check error
-  if (!sh_linker_check_arch(dlinfo)) {
-    xdl_close(handle);
-    return SHADOWHOOK_ERRNO_ELF_ARCH_MISMATCH;
-  }
-
-  // lookup symbol address
-  crashed = false;
-  void *addr = NULL;
-  size_t sym_size = 0;
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    // do xdl_sym() or xdl_dsym() in an dlclosed-ELF will cause a crash
-    addr = xdl_sym(handle, sym_name, &sym_size);
-    if (NULL == addr) addr = xdl_dsym(handle, sym_name, &sym_size);
-  }
-  SH_SIG_CATCH() {
-    crashed = true;
-  }
-  SH_SIG_EXIT
-
-  // close library
-  xdl_close(handle);
-
-  if (crashed) return SHADOWHOOK_ERRNO_HOOK_DLSYM_CRASH;
-  if (NULL == addr) return SHADOWHOOK_ERRNO_HOOK_DLSYM;
-
-  dlinfo->dli_fname = lib_name;
-  dlinfo->dli_sname = sym_name;
-  dlinfo->dli_saddr = addr;
-  dlinfo->dli_ssize = sym_size;
-  if (NULL != real_lib_name) strlcpy(real_lib_name, dlinfo->dli_fname, real_lib_name_sz);
-  return 0;
-}
diff --git a/app/src/main/cpp/shadowhook/sh_linker.h b/app/src/main/cpp/shadowhook/sh_linker.h
deleted file mode 100644
index 749e0a6..0000000
--- a/app/src/main/cpp/shadowhook/sh_linker.h
+++ /dev/null
@@ -1,41 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stdbool.h>
-#include <stdint.h>
-
-#include "xdl.h"
-
-int sh_linker_init(void);
-
-const char *sh_linker_match_dlfcn(uintptr_t target_addr);
-bool sh_linker_need_to_hook_dlopen(uintptr_t target_addr);
-
-typedef void (*sh_linker_post_dlopen_t)(void *arg);
-int sh_linker_hook_dlopen(sh_linker_post_dlopen_t post_dlopen, void *post_dlopen_arg);
-
-int sh_linker_get_dlinfo_by_addr(void *addr, xdl_info_t *dlinfo, char *lib_name, size_t lib_name_sz,
-                                 char *sym_name, size_t sym_name_sz, bool ignore_symbol_check);
-int sh_linker_get_dlinfo_by_sym_name(const char *lib_name, const char *sym_name, xdl_info_t *dlinfo,
-                                     char *real_lib_name, size_t real_lib_name_sz);
diff --git a/app/src/main/cpp/shadowhook/sh_recorder.c b/app/src/main/cpp/shadowhook/sh_recorder.c
deleted file mode 100644
index 22cf39d..0000000
--- a/app/src/main/cpp/shadowhook/sh_recorder.c
+++ /dev/null
@@ -1,517 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_recorder.h"
-
-#include "sh_config.h"
-
-#ifdef SH_CONFIG_OPERATION_RECORDS
-
-#include <inttypes.h>
-#include <pthread.h>
-#include <stdbool.h>
-#include <stdint.h>
-#include <stdlib.h>
-#include <string.h>
-#include <sys/time.h>
-
-#include "sh_sig.h"
-#include "sh_util.h"
-#include "shadowhook.h"
-#include "xdl.h"
-
-#define SH_RECORDER_OP_HOOK_SYM_ADDR 0
-#define SH_RECORDER_OP_HOOK_SYM_NAME 1
-#define SH_RECORDER_OP_UNHOOK        2
-
-#define SH_RECORDER_LIB_NAME_MAX 512
-#define SH_RECORDER_SYM_NAME_MAX 1024
-
-#define SH_RECORDER_STRINGS_BUF_EXPAND_STEP (1024 * 16)
-#define SH_RECORDER_STRINGS_BUF_MAX         (1024 * 128)
-#define SH_RECORDER_RECORDS_BUF_EXPAND_STEP (1024 * 32)
-#define SH_RECORDER_RECORDS_BUF_MAX         (1024 * 384)
-#define SH_RECORDER_OUTPUT_BUF_EXPAND_STEP  (1024 * 128)
-#define SH_RECORDER_OUTPUT_BUF_MAX          (1024 * 1024)
-
-static bool sh_recorder_recordable = false;
-
-bool sh_recorder_get_recordable(void) {
-  return sh_recorder_recordable;
-}
-
-void sh_recorder_set_recordable(bool recordable) {
-  sh_recorder_recordable = recordable;
-}
-
-typedef struct {
-  void *ptr;
-  size_t cap;
-  size_t sz;
-  pthread_mutex_t lock;
-} sh_recorder_buf_t;
-
-static int sh_recorder_buf_append(sh_recorder_buf_t *buf, size_t step, size_t max, const void *header,
-                                  size_t header_sz, const void *body, size_t body_sz) {
-  size_t needs = (header_sz + (NULL != body ? body_sz : 0));
-  if (needs > step) return -1;
-
-  if (buf->cap - buf->sz < needs) {
-    size_t new_cap = buf->cap + step;
-    if (new_cap > max) return -1;
-    void *new_ptr = realloc(buf->ptr, new_cap);
-    if (NULL == new_ptr) return -1;
-    buf->ptr = new_ptr;
-    buf->cap = new_cap;
-  }
-
-  memcpy((void *)((uintptr_t)buf->ptr + buf->sz), header, header_sz);
-  if (NULL != body) memcpy((void *)((uintptr_t)buf->ptr + buf->sz + header_sz), body, body_sz);
-  buf->sz += needs;
-  return 0;
-}
-
-static void sh_recorder_buf_free(sh_recorder_buf_t *buf) {
-  if (NULL != buf->ptr) {
-    free(buf->ptr);
-    buf->ptr = NULL;
-  }
-}
-
-static sh_recorder_buf_t sh_recorder_strings = {NULL, 0, 0, PTHREAD_MUTEX_INITIALIZER};
-static sh_recorder_buf_t sh_recorder_records = {NULL, 0, 0, PTHREAD_MUTEX_INITIALIZER};
-static bool sh_recorder_error = false;
-
-typedef struct {
-  uint16_t str_len;  // body length, in order to speed up the search
-} __attribute__((packed)) sh_recorder_str_header_t;
-// +body: string, including the terminating null byte ('\0')
-
-typedef struct {
-  uint64_t op : 8;
-  uint64_t error_number : 8;
-  uint64_t ts_ms : 48;
-  uintptr_t stub;
-  uint16_t caller_lib_name_idx;
-  uint8_t backup_len;
-  uint16_t lib_name_idx;
-  uint16_t sym_name_idx;
-  uintptr_t sym_addr;
-  uintptr_t new_addr;
-} __attribute__((packed)) sh_recorder_record_hook_header_t;
-// no body
-
-typedef struct {
-  uint64_t op : 8;
-  uint64_t error_number : 8;
-  uint64_t ts_ms : 48;
-  uintptr_t stub;
-  uint16_t caller_lib_name_idx;
-} __attribute__((packed)) sh_recorder_record_unhook_header_t;
-// no body
-
-static int sh_recorder_add_str(const char *str, size_t str_len, uint16_t *str_idx) {
-  uint16_t idx = 0;
-  bool ok = false;
-
-  pthread_mutex_lock(&sh_recorder_strings.lock);
-
-  // find in existing strings
-  size_t i = 0;
-  while (i < sh_recorder_strings.sz) {
-    sh_recorder_str_header_t *header = (sh_recorder_str_header_t *)((uintptr_t)sh_recorder_strings.ptr + i);
-    if (header->str_len == str_len) {
-      void *tmp = (void *)((uintptr_t)sh_recorder_strings.ptr + i + sizeof(header->str_len));
-      if (0 == memcmp(tmp, str, str_len)) {
-        *str_idx = idx;
-        ok = true;
-        break;  // OK
-      }
-    }
-    i += (sizeof(sh_recorder_str_header_t) + header->str_len + 1);
-    idx++;
-    if (idx == UINT16_MAX) break;  // failed
-  }
-
-  // insert a new string
-  if (!ok && idx < UINT16_MAX) {
-    // append new string
-    sh_recorder_str_header_t header = {(uint16_t)str_len};
-    if (0 == sh_recorder_buf_append(&sh_recorder_strings, SH_RECORDER_STRINGS_BUF_EXPAND_STEP,
-                                    SH_RECORDER_STRINGS_BUF_MAX, &header, sizeof(header), str, str_len + 1)) {
-      *str_idx = idx;
-      ok = true;  // OK
-    }
-  }
-
-  pthread_mutex_unlock(&sh_recorder_strings.lock);
-
-  return ok ? 0 : -1;
-}
-
-static char *sh_recorder_find_str(uint16_t idx) {
-  uint16_t cur_idx = 0;
-
-  size_t i = 0;
-  while (i < sh_recorder_strings.sz && cur_idx < idx) {
-    sh_recorder_str_header_t *header = (sh_recorder_str_header_t *)((uintptr_t)sh_recorder_strings.ptr + i);
-    i += (sizeof(sh_recorder_str_header_t) + header->str_len + 1);
-    cur_idx++;
-  }
-  if (cur_idx != idx) return "error";
-
-  sh_recorder_str_header_t *header = (sh_recorder_str_header_t *)((uintptr_t)sh_recorder_strings.ptr + i);
-  return (char *)((uintptr_t)header + sizeof(sh_recorder_str_header_t));
-}
-
-static long sh_recorder_tz = LONG_MAX;
-
-static uint64_t sh_recorder_get_timestamp_ms(void) {
-  struct timeval tv;
-  gettimeofday(&tv, NULL);
-
-  if (LONG_MAX == sh_recorder_tz) {
-    // localtime_r() will call getenv() without lock protection,
-    // and will crash when encountering concurrent setenv() calls.
-    // We really encountered.
-    sh_recorder_tz = 0;
-    //    struct tm tm;
-    //    if (NULL != localtime_r((time_t *)(&(tv.tv_sec)), &tm)) sh_recorder_tz = tm.tm_gmtoff;
-  }
-
-  return (uint64_t)tv.tv_sec * 1000 + (uint64_t)tv.tv_usec / 1000;
-}
-
-static size_t sh_recorder_format_timestamp_ms(uint64_t ts_ms, char *buf, size_t buf_len) {
-  time_t sec = (time_t)(ts_ms / 1000);
-  time_t msec = (time_t)(ts_ms % 1000);
-
-  struct tm tm;
-  sh_util_localtime_r(&sec, sh_recorder_tz, &tm);
-
-  return sh_util_snprintf(buf, buf_len, "%04d-%02d-%02dT%02d:%02d:%02d.%03ld%c%02ld:%02ld,",
-                          tm.tm_year + 1900, tm.tm_mon + 1, tm.tm_mday, tm.tm_hour, tm.tm_min, tm.tm_sec,
-                          msec, sh_recorder_tz < 0 ? '-' : '+', labs(sh_recorder_tz / 3600),
-                          labs(sh_recorder_tz % 3600));
-}
-
-static const char *sh_recorder_get_base_name(const char *lib_name) {
-  const char *p = strrchr(lib_name, '/');
-  if (NULL != p && '\0' != *(p + 1))
-    return p + 1;
-  else
-    return lib_name;
-}
-
-static int sh_recorder_get_base_name_by_addr_iterator(struct dl_phdr_info *info, size_t size, void *arg) {
-  (void)size;
-
-  uintptr_t *pkg = (uintptr_t *)arg;
-  uintptr_t addr = *pkg++;
-  char *base_name = (char *)*pkg++;
-  size_t base_name_sz = (size_t)*pkg;
-
-  for (size_t i = 0; i < info->dlpi_phnum; i++) {
-    const ElfW(Phdr) *phdr = &(info->dlpi_phdr[i]);
-    if (PT_LOAD != phdr->p_type) continue;
-    if (addr < (uintptr_t)(info->dlpi_addr + phdr->p_vaddr) ||
-        addr >= (uintptr_t)(info->dlpi_addr + phdr->p_vaddr + phdr->p_memsz))
-      continue;
-
-    // get lib_name from path_name
-    const char *p;
-    if (NULL == info->dlpi_name || '\0' == info->dlpi_name[0])
-      p = "unknown";
-    else {
-      p = strrchr(info->dlpi_name, '/');
-      if (NULL == p || '\0' == *(p + 1))
-        p = info->dlpi_name;
-      else
-        p++;
-    }
-
-    strlcpy(base_name, p, base_name_sz);
-    return 1;  // OK
-  }
-
-  return 0;  // continue
-}
-
-static void sh_recorder_get_base_name_by_addr(uintptr_t addr, char *base_name, size_t base_name_sz) {
-  base_name[0] = '\0';
-  uintptr_t pkg[3] = {addr, (uintptr_t)base_name, (uintptr_t)base_name_sz};
-
-  if (sh_util_get_api_level() >= __ANDROID_API_L__) {
-    xdl_iterate_phdr(sh_recorder_get_base_name_by_addr_iterator, pkg, XDL_DEFAULT);
-  } else {
-    SH_SIG_TRY(SIGSEGV, SIGBUS) {
-      xdl_iterate_phdr(sh_recorder_get_base_name_by_addr_iterator, pkg, XDL_DEFAULT);
-    }
-    SH_SIG_EXIT
-  }
-
-  if ('\0' == base_name[0]) strlcpy(base_name, "unknown", base_name_sz);
-}
-
-int sh_recorder_add_hook(int error_number, bool is_hook_sym_addr, uintptr_t sym_addr, const char *lib_name,
-                         const char *sym_name, uintptr_t new_addr, size_t backup_len, uintptr_t stub,
-                         uintptr_t caller_addr) {
-  if (!sh_recorder_recordable) return 0;
-  if (sh_recorder_error) return -1;
-
-  // lib_name
-  if (NULL == lib_name) return -1;
-  lib_name = sh_recorder_get_base_name(lib_name);
-  size_t lib_name_len = strlen(lib_name);
-  if (0 == lib_name_len || lib_name_len > SH_RECORDER_LIB_NAME_MAX) return -1;
-
-  // sym_name
-  if (NULL == sym_name) return -1;
-  size_t sym_name_len = strlen(sym_name);
-  if (0 == sym_name_len || sym_name_len > SH_RECORDER_SYM_NAME_MAX) return -1;
-
-  // caller_lib_name
-  char caller_lib_name[SH_RECORDER_LIB_NAME_MAX];
-  sh_recorder_get_base_name_by_addr(caller_addr, caller_lib_name, sizeof(caller_lib_name));
-  size_t caller_lib_name_len = strlen(caller_lib_name);
-
-  // add strings to strings-pool
-  uint16_t lib_name_idx, sym_name_idx, caller_lib_name_idx;
-  if (0 != sh_recorder_add_str(lib_name, lib_name_len, &lib_name_idx)) goto err;
-  if (0 != sh_recorder_add_str(sym_name, sym_name_len, &sym_name_idx)) goto err;
-  if (0 != sh_recorder_add_str(caller_lib_name, caller_lib_name_len, &caller_lib_name_idx)) goto err;
-
-  // append new hook record
-  sh_recorder_record_hook_header_t header = {
-      is_hook_sym_addr ? SH_RECORDER_OP_HOOK_SYM_ADDR : SH_RECORDER_OP_HOOK_SYM_NAME,
-      (uint8_t)error_number,
-      sh_recorder_get_timestamp_ms(),
-      stub,
-      caller_lib_name_idx,
-      (uint8_t)backup_len,
-      lib_name_idx,
-      sym_name_idx,
-      sym_addr,
-      new_addr};
-  pthread_mutex_lock(&sh_recorder_records.lock);
-  int r = sh_recorder_buf_append(&sh_recorder_records, SH_RECORDER_RECORDS_BUF_EXPAND_STEP,
-                                 SH_RECORDER_RECORDS_BUF_MAX, &header, sizeof(header), NULL, 0);
-  pthread_mutex_unlock(&sh_recorder_records.lock);
-  if (0 != r) goto err;
-
-  return 0;
-
-err:
-  sh_recorder_error = true;
-  return -1;
-}
-
-int sh_recorder_add_unhook(int error_number, uintptr_t stub, uintptr_t caller_addr) {
-  if (!sh_recorder_recordable) return 0;
-  if (sh_recorder_error) return -1;
-
-  char caller_lib_name[SH_RECORDER_LIB_NAME_MAX];
-  sh_recorder_get_base_name_by_addr(caller_addr, caller_lib_name, sizeof(caller_lib_name));
-  size_t caller_lib_name_len = strlen(caller_lib_name);
-
-  uint16_t caller_lib_name_idx;
-  if (0 != sh_recorder_add_str(caller_lib_name, caller_lib_name_len, &caller_lib_name_idx)) goto err;
-
-  sh_recorder_record_unhook_header_t header = {SH_RECORDER_OP_UNHOOK, (uint8_t)error_number,
-                                               sh_recorder_get_timestamp_ms(), stub, caller_lib_name_idx};
-  pthread_mutex_lock(&sh_recorder_records.lock);
-  int r = sh_recorder_buf_append(&sh_recorder_records, SH_RECORDER_RECORDS_BUF_EXPAND_STEP,
-                                 SH_RECORDER_RECORDS_BUF_MAX, &header, sizeof(header), NULL, 0);
-  pthread_mutex_unlock(&sh_recorder_records.lock);
-  if (0 != r) goto err;
-
-  return 0;
-
-err:
-  sh_recorder_error = true;
-  return -1;
-}
-
-static const char *sh_recorder_get_op_name(uint8_t op) {
-  switch (op) {
-    case SH_RECORDER_OP_HOOK_SYM_ADDR:
-      return "hook_sym_addr";
-    case SH_RECORDER_OP_HOOK_SYM_NAME:
-      return "hook_sym_name";
-    case SH_RECORDER_OP_UNHOOK:
-      return "unhook";
-    default:
-      return "error";
-  }
-}
-
-static void sh_recorder_output(char **str, int fd, uint32_t item_flags) {
-  if (NULL == sh_recorder_records.ptr || 0 == sh_recorder_records.sz) return;
-
-  sh_recorder_buf_t output = {NULL, 0, 0, PTHREAD_MUTEX_INITIALIZER};
-
-  pthread_mutex_lock(&sh_recorder_records.lock);
-  pthread_mutex_lock(&sh_recorder_strings.lock);
-
-  char line[SH_RECORDER_LIB_NAME_MAX * 2 + SH_RECORDER_SYM_NAME_MAX + 256];
-  size_t line_sz;
-  size_t i = 0;
-  while (i < sh_recorder_records.sz) {
-    line_sz = 0;
-    sh_recorder_record_hook_header_t *header =
-        (sh_recorder_record_hook_header_t *)((uintptr_t)sh_recorder_records.ptr + i);
-
-    if (item_flags & SHADOWHOOK_RECORD_ITEM_TIMESTAMP)
-      line_sz += sh_recorder_format_timestamp_ms(header->ts_ms, line + line_sz, sizeof(line) - line_sz);
-    if (item_flags & SHADOWHOOK_RECORD_ITEM_CALLER_LIB_NAME)
-      line_sz += sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "%s,",
-                                  sh_recorder_find_str(header->caller_lib_name_idx));
-    if (item_flags & SHADOWHOOK_RECORD_ITEM_OP)
-      line_sz += sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "%s,",
-                                  sh_recorder_get_op_name(header->op));
-    if ((item_flags & SHADOWHOOK_RECORD_ITEM_LIB_NAME) && header->op != SH_RECORDER_OP_UNHOOK)
-      line_sz += sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "%s,",
-                                  sh_recorder_find_str(header->lib_name_idx));
-    if ((item_flags & SHADOWHOOK_RECORD_ITEM_SYM_NAME) && header->op != SH_RECORDER_OP_UNHOOK)
-      line_sz += sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "%s,",
-                                  sh_recorder_find_str(header->sym_name_idx));
-    if ((item_flags & SHADOWHOOK_RECORD_ITEM_SYM_ADDR) && header->op != SH_RECORDER_OP_UNHOOK)
-      line_sz += sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "%" PRIxPTR ",", header->sym_addr);
-    if ((item_flags & SHADOWHOOK_RECORD_ITEM_NEW_ADDR) && header->op != SH_RECORDER_OP_UNHOOK)
-      line_sz += sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "%" PRIxPTR ",", header->new_addr);
-    if ((item_flags & SHADOWHOOK_RECORD_ITEM_BACKUP_LEN) && header->op != SH_RECORDER_OP_UNHOOK)
-      line_sz += sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "%" PRIu8 ",", header->backup_len);
-    if (item_flags & SHADOWHOOK_RECORD_ITEM_ERRNO)
-      line_sz +=
-          sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "%" PRIu8 ",", header->error_number);
-    if (item_flags & SHADOWHOOK_RECORD_ITEM_STUB)
-      line_sz += sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "%" PRIxPTR ",", header->stub);
-    line[line_sz - 1] = '\n';
-
-    if (NULL != str) {
-      // append to string
-      if (0 != sh_recorder_buf_append(&output, SH_RECORDER_OUTPUT_BUF_EXPAND_STEP, SH_RECORDER_OUTPUT_BUF_MAX,
-                                      line, line_sz, NULL, 0)) {
-        sh_recorder_buf_free(&output);
-        break;  // failed
-      }
-    } else {
-      // write to FD
-      if (0 != sh_util_write(fd, line, line_sz)) break;  // failed
-    }
-
-    i += (SH_RECORDER_OP_UNHOOK == header->op ? sizeof(sh_recorder_record_unhook_header_t)
-                                              : sizeof(sh_recorder_record_hook_header_t));
-  }
-
-  pthread_mutex_unlock(&sh_recorder_strings.lock);
-  pthread_mutex_unlock(&sh_recorder_records.lock);
-
-  // error message
-  if (sh_recorder_error) {
-    line_sz = 0;
-
-    if (item_flags & SHADOWHOOK_RECORD_ITEM_TIMESTAMP)
-      line_sz += sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "9999-99-99T00:00:00.000+00:00,");
-    if (item_flags & SHADOWHOOK_RECORD_ITEM_CALLER_LIB_NAME)
-      line_sz += sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "error,");
-    if (item_flags & SHADOWHOOK_RECORD_ITEM_OP)
-      line_sz += sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "error,");
-
-    if (0 == line_sz) line_sz = sh_util_snprintf(line + line_sz, sizeof(line) - line_sz, "error,");
-
-    line[line_sz - 1] = '\n';
-
-    if (NULL != str) {
-      // append to string
-      if (0 != sh_recorder_buf_append(&output, SH_RECORDER_OUTPUT_BUF_EXPAND_STEP, SH_RECORDER_OUTPUT_BUF_MAX,
-                                      line, line_sz, NULL, 0)) {
-        sh_recorder_buf_free(&output);
-        return;  // failed
-      }
-    } else {
-      // write to FD
-      if (0 != sh_util_write(fd, line, line_sz)) return;  // failed
-    }
-  }
-
-  // return string
-  if (NULL != str) {
-    if (0 != sh_recorder_buf_append(&output, SH_RECORDER_OUTPUT_BUF_EXPAND_STEP, SH_RECORDER_OUTPUT_BUF_MAX,
-                                    "", 1, NULL, 0)) {
-      sh_recorder_buf_free(&output);
-      return;  // failed
-    }
-    *str = output.ptr;
-  }
-}
-
-char *sh_recorder_get(uint32_t item_flags) {
-  if (!sh_recorder_recordable) return NULL;
-  if (0 == (item_flags & SHADOWHOOK_RECORD_ITEM_ALL)) return NULL;
-
-  char *str = NULL;
-  sh_recorder_output(&str, -1, item_flags);
-  return str;
-}
-
-void sh_recorder_dump(int fd, uint32_t item_flags) {
-  if (!sh_recorder_recordable) return;
-  if (0 == (item_flags & SHADOWHOOK_RECORD_ITEM_ALL)) return;
-  if (fd < 0) return;
-  sh_recorder_output(NULL, fd, item_flags);
-}
-
-#else
-
-bool sh_recorder_get_recordable(void) {
-  return false;
-}
-
-void sh_recorder_set_recordable(bool recordable) {
-  (void)recordable;
-}
-
-int sh_recorder_add_hook(int error_number, bool is_hook_sym_addr, uintptr_t sym_addr, const char *lib_name,
-                         const char *sym_name, uintptr_t new_addr, size_t backup_len, uintptr_t stub,
-                         uintptr_t caller_addr) {
-  (void)error_number, (void)is_hook_sym_addr, (void)sym_addr, (void)lib_name, (void)sym_name, (void)new_addr,
-      (void)backup_len, (void)stub, (void)caller_addr;
-  return 0;
-}
-
-int sh_recorder_add_unhook(int error_number, uintptr_t stub, uintptr_t caller_addr) {
-  (void)error_number, (void)stub, (void)caller_addr;
-  return 0;
-}
-
-char *sh_recorder_get(uint32_t item_flags) {
-  (void)item_flags;
-  return NULL;
-}
-
-void sh_recorder_dump(int fd, uint32_t item_flags) {
-  (void)fd, (void)item_flags;
-}
-
-#endif
diff --git a/app/src/main/cpp/shadowhook/sh_recorder.h b/app/src/main/cpp/shadowhook/sh_recorder.h
deleted file mode 100644
index 91ce843..0000000
--- a/app/src/main/cpp/shadowhook/sh_recorder.h
+++ /dev/null
@@ -1,37 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stdbool.h>
-#include <stdint.h>
-
-bool sh_recorder_get_recordable(void);
-void sh_recorder_set_recordable(bool recordable);
-
-int sh_recorder_add_hook(int error_number, bool is_hook_sym_addr, uintptr_t sym_addr, const char *lib_name,
-                         const char *sym_name, uintptr_t new_addr, size_t backup_len, uintptr_t stub,
-                         uintptr_t caller_addr);
-int sh_recorder_add_unhook(int error_number, uintptr_t stub, uintptr_t caller_addr);
-
-char *sh_recorder_get(uint32_t item_flags);
-void sh_recorder_dump(int fd, uint32_t item_flags);
diff --git a/app/src/main/cpp/shadowhook/sh_safe.c b/app/src/main/cpp/shadowhook/sh_safe.c
deleted file mode 100644
index eacc14d..0000000
--- a/app/src/main/cpp/shadowhook/sh_safe.c
+++ /dev/null
@@ -1,133 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_safe.h"
-
-#include <stddef.h>
-#include <stdint.h>
-#include <sys/types.h>
-
-#include "sh_util.h"
-#include "xdl.h"
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wreserved-id-macro"
-#pragma clang diagnostic ignored "-Wvariadic-macros"
-#pragma clang diagnostic ignored "-Wgnu-zero-variadic-macro-arguments"
-#pragma clang diagnostic ignored "-Wsign-conversion"
-#pragma clang diagnostic ignored "-Wpacked"
-#pragma clang diagnostic ignored "-Wshorten-64-to-32"
-#include "linux_syscall_support.h"
-#pragma clang diagnostic pop
-
-#define SH_SAFE_IDX_PTHREAD_GETSPECIFIC 0
-#define SH_SAFE_IDX_PTHREAD_SETSPECIFIC 1
-#define SH_SAFE_IDX_ABORT               2
-
-#define SH_SAFE_IDX_SZ 3
-typedef struct {
-  uintptr_t target_addr;
-  uintptr_t orig_addr;
-} sh_safe_addr_t;
-static sh_safe_addr_t sh_safe_addrs[SH_SAFE_IDX_SZ];
-static int sh_safe_api_level;
-
-static int sh_safe_init_func(void *handle, const char *symbol, size_t idx) {
-  sh_safe_addrs[idx].target_addr = (uintptr_t)(xdl_sym(handle, symbol, NULL));
-  if (__predict_false(0 == sh_safe_addrs[idx].target_addr)) return -1;
-  sh_safe_addrs[idx].orig_addr = 0;
-  return 0;
-}
-
-int sh_safe_init(void) {
-  sh_safe_api_level = sh_util_get_api_level();
-
-  void *handle = xdl_open("libc.so", XDL_DEFAULT);
-  if (NULL == handle) return -1;
-
-  int r = -1;
-  if (__predict_false(0 != sh_safe_init_func(handle, "pthread_getspecific", SH_SAFE_IDX_PTHREAD_GETSPECIFIC)))
-    goto end;
-  if (__predict_false(0 != sh_safe_init_func(handle, "pthread_setspecific", SH_SAFE_IDX_PTHREAD_SETSPECIFIC)))
-    goto end;
-  if (__predict_false(0 != sh_safe_init_func(handle, "abort", SH_SAFE_IDX_ABORT))) goto end;
-  r = 0;
-
-end:
-  xdl_close(handle);
-  return r;
-}
-
-uintptr_t *sh_safe_get_orig_addr_addr(uintptr_t target_addr) {
-  for (size_t i = 0; i < SH_SAFE_IDX_SZ; i++) {
-    if (sh_safe_addrs[i].target_addr == target_addr) {
-      return &sh_safe_addrs[i].orig_addr;
-    }
-  }
-  return NULL;
-}
-
-static uintptr_t sh_safe_get_orig_addr(size_t idx) {
-  sh_safe_addr_t *addr = &sh_safe_addrs[idx];
-  return 0 != addr->orig_addr ? addr->orig_addr : addr->target_addr;
-}
-
-void *sh_safe_pthread_getspecific(pthread_key_t key) {
-  uintptr_t addr = sh_safe_get_orig_addr(SH_SAFE_IDX_PTHREAD_GETSPECIFIC);
-  return ((void *(*)(pthread_key_t))addr)(key);
-}
-
-int sh_safe_pthread_setspecific(pthread_key_t key, const void *value) {
-  if (sh_safe_api_level >= __ANDROID_API_M__) {
-    uintptr_t addr = sh_safe_get_orig_addr(SH_SAFE_IDX_PTHREAD_SETSPECIFIC);
-    return ((int (*)(pthread_key_t, const void *))addr)(key, value);
-  } else {
-    // Before Android M, pthread_setspecific() will call pthread_mutex_lock() and
-    // pthread_mutex_unlock(). So if we use pthread_setspecific() in hub's trampo,
-    // we will NOT be able to hook pthread_mutex_lock() and pthread_mutex_unlock().
-    void **tls;
-#if defined(__aarch64__)
-    __asm__("mrs %0, tpidr_el0" : "=r"(tls));
-#elif defined(__arm__)
-    __asm__("mrc p15, 0, %0, c13, c0, 3" : "=r"(tls));
-#endif
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wcast-qual"
-    tls[key] = (void *)value;
-#pragma clang diagnostic pop
-    return 0;
-  }
-}
-
-void sh_safe_abort(void) {
-  uintptr_t addr = sh_safe_get_orig_addr(SH_SAFE_IDX_ABORT);
-  ((void (*)(void))addr)();
-}
-
-void *sh_safe_mmap(void *addr, size_t length, int prot, int flags, int fd, off_t offset) {
-  return sys_mmap(addr, length, prot, flags, fd, offset);
-}
-
-int sh_safe_prctl(int option, unsigned long arg2, unsigned long arg3, unsigned long arg4,
-                  unsigned long arg5) {
-  return sys_prctl(option, arg2, arg3, arg4, arg5);
-}
diff --git a/app/src/main/cpp/shadowhook/sh_safe.h b/app/src/main/cpp/shadowhook/sh_safe.h
deleted file mode 100644
index 5f353bd..0000000
--- a/app/src/main/cpp/shadowhook/sh_safe.h
+++ /dev/null
@@ -1,37 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stddef.h>
-#include <stdint.h>
-#include <sys/types.h>
-
-int sh_safe_init(void);
-uintptr_t *sh_safe_get_orig_addr_addr(uintptr_t target_addr);
-
-void *sh_safe_pthread_getspecific(pthread_key_t key);
-int sh_safe_pthread_setspecific(pthread_key_t key, const void *value);
-void sh_safe_abort(void);
-
-void *sh_safe_mmap(void *addr, size_t length, int prot, int flags, int fd, off_t offset);
-int sh_safe_prctl(int option, unsigned long arg2, unsigned long arg3, unsigned long arg4, unsigned long arg5);
diff --git a/app/src/main/cpp/shadowhook/sh_switch.c b/app/src/main/cpp/shadowhook/sh_switch.c
deleted file mode 100644
index 0eb7ba9..0000000
--- a/app/src/main/cpp/shadowhook/sh_switch.c
+++ /dev/null
@@ -1,343 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_switch.h"
-
-#include <inttypes.h>
-#include <pthread.h>
-#include <stdbool.h>
-#include <stdint.h>
-#include <stdlib.h>
-#include <string.h>
-#include <unistd.h>
-
-#include "sh_config.h"
-#include "sh_errno.h"
-#include "sh_hub.h"
-#include "sh_inst.h"
-#include "sh_linker.h"
-#include "sh_log.h"
-#include "sh_safe.h"
-#include "sh_sig.h"
-#include "sh_util.h"
-#include "shadowhook.h"
-#include "tree.h"
-#include "xdl.h"
-
-// switch
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wpadded"
-typedef struct sh_switch {
-  sh_inst_t inst;  // align 16
-  uintptr_t target_addr;
-  sh_hub_t *hub;
-  RB_ENTRY(sh_switch) link;
-} sh_switch_t;
-#pragma clang diagnostic pop
-
-// switch tree
-static __inline__ int sh_switch_cmp(sh_switch_t *a, sh_switch_t *b) {
-  if (a->target_addr == b->target_addr)
-    return 0;
-  else
-    return a->target_addr > b->target_addr ? 1 : -1;
-}
-typedef RB_HEAD(sh_switch_tree, sh_switch) sh_switch_tree_t;
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wunused-function"
-RB_GENERATE_STATIC(sh_switch_tree, sh_switch, link, sh_switch_cmp)
-#pragma clang diagnostic pop
-
-// switch tree object
-static sh_switch_tree_t sh_switches = RB_INITIALIZER(&sh_switches);
-static pthread_rwlock_t sh_switches_lock = PTHREAD_RWLOCK_INITIALIZER;
-
-static sh_switch_t *sh_switch_find(uintptr_t target_addr) {
-  sh_switch_t key = {.target_addr = target_addr};
-
-  pthread_rwlock_rdlock(&sh_switches_lock);
-  sh_switch_t *self = RB_FIND(sh_switch_tree, &sh_switches, &key);
-  pthread_rwlock_unlock(&sh_switches_lock);
-
-  return self;
-}
-
-static int sh_switch_create(sh_switch_t **self, uintptr_t target_addr, uintptr_t *hub_trampo) {
-  *self = memalign(16, sizeof(sh_switch_t));
-  if (NULL == *self) return SHADOWHOOK_ERRNO_OOM;
-
-  memset(&(*self)->inst, 0, sizeof((*self)->inst));
-  (*self)->target_addr = target_addr;
-  (*self)->hub = NULL;
-
-  if (NULL != hub_trampo) {
-    if (NULL == ((*self)->hub = sh_hub_create(target_addr, hub_trampo))) {
-      free(self);
-      return SHADOWHOOK_ERRNO_HUB_CREAT;
-    }
-  }
-
-  return 0;
-}
-
-static void sh_switch_destroy(sh_switch_t *self, bool hub_with_delay) {
-  if (NULL != self->hub) sh_hub_destroy(self->hub, hub_with_delay);
-  free(self);
-}
-
-static void sh_switch_dump_enter(sh_switch_t *self) {
-#ifdef SH_CONFIG_DEBUG
-  char buf[1024];
-  size_t len = 0;
-  size_t zero = 0;
-  for (size_t i = 0; i < 128; i++) {
-    uint16_t inst = ((uint16_t *)(self->inst.enter_addr))[i];
-    zero = (0 == inst ? zero + 1 : 0);
-    if (zero > 4) break;
-    len += (size_t)snprintf(buf + len, sizeof(buf) - len, "%04" PRIx16 " ", inst);
-  }
-  SH_LOG_DEBUG("switch: enter < %s>", buf);
-#else
-  (void)self;
-#endif
-}
-
-static int sh_switch_hook_unique(uintptr_t target_addr, uintptr_t new_addr, uintptr_t *orig_addr,
-                                 size_t *backup_len, xdl_info_t *dlinfo) {
-  sh_switch_t *self = sh_switch_find(target_addr);
-  if (NULL != self) return SHADOWHOOK_ERRNO_HOOK_DUP;
-
-  // alloc new switch
-  int r;
-  if (0 != (r = sh_switch_create(&self, target_addr, NULL))) return r;
-
-  sh_switch_t *useless = NULL;
-  pthread_rwlock_wrlock(&sh_switches_lock);  // SYNC - start
-
-  // insert new switch to switch-tree
-  if (NULL != RB_INSERT(sh_switch_tree, &sh_switches, self)) {
-    useless = self;
-    r = SHADOWHOOK_ERRNO_HOOK_DUP;
-    goto end;
-  }
-
-  // do hook
-  if (0 != (r = sh_inst_hook(&self->inst, target_addr, dlinfo, new_addr, orig_addr, NULL))) {
-    RB_REMOVE(sh_switch_tree, &sh_switches, self);
-    useless = self;
-    goto end;
-  }
-  *backup_len = self->inst.backup_len;
-  sh_switch_dump_enter(self);
-
-end:
-  pthread_rwlock_unlock(&sh_switches_lock);  // SYNC - end
-  if (NULL != useless) sh_switch_destroy(useless, false);
-  return r;
-}
-
-static int sh_switch_hook_shared(uintptr_t target_addr, uintptr_t new_addr, uintptr_t *orig_addr,
-                                 size_t *backup_len, xdl_info_t *dlinfo) {
-  int r;
-
-  pthread_rwlock_rdlock(&sh_switches_lock);  // SYNC(read) - start
-  sh_switch_t key = {.target_addr = target_addr};
-  sh_switch_t *self = RB_FIND(sh_switch_tree, &sh_switches, &key);
-  if (NULL != self)  // already exists
-  {
-    // add an new proxy to hub
-    if (NULL != orig_addr) *orig_addr = sh_hub_get_orig_addr(self->hub);
-    r = sh_hub_add_proxy(self->hub, new_addr);
-    pthread_rwlock_unlock(&sh_switches_lock);  // SYNC(read) - end
-
-    *backup_len = self->inst.backup_len;
-    return r;
-  }
-  pthread_rwlock_unlock(&sh_switches_lock);  // SYNC(read) - end
-
-  // first hook for this target_addr
-
-  // alloc new switch
-  uintptr_t hub_trampo;
-  if (0 != (r = sh_switch_create(&self, target_addr, &hub_trampo))) return r;
-
-  sh_switch_t *useless = NULL;
-  pthread_rwlock_wrlock(&sh_switches_lock);  // SYNC - start
-
-  // insert new switch to switch-tree
-  sh_switch_t *exists;
-  if (NULL != (exists = RB_INSERT(sh_switch_tree, &sh_switches, self))) {
-    // already exists
-    useless = self;
-    if (NULL != orig_addr) *orig_addr = sh_hub_get_orig_addr(exists->hub);
-    r = sh_hub_add_proxy(exists->hub, new_addr);
-    *backup_len = exists->inst.backup_len;
-  } else {
-    // do hook
-    uintptr_t *safe_orig_addr_addr = sh_safe_get_orig_addr_addr(target_addr);
-    if (0 != (r = sh_inst_hook(&self->inst, target_addr, dlinfo, hub_trampo,
-                               sh_hub_get_orig_addr_addr(self->hub), safe_orig_addr_addr))) {
-      RB_REMOVE(sh_switch_tree, &sh_switches, self);
-      useless = self;
-      goto end;
-    }
-    *backup_len = self->inst.backup_len;
-    sh_switch_dump_enter(self);
-
-    // return original-address
-    if (NULL != orig_addr) *orig_addr = sh_hub_get_orig_addr(self->hub);
-
-    // add proxy to hub
-    if (0 != (r = sh_hub_add_proxy(self->hub, new_addr))) {
-      sh_inst_unhook(&self->inst, target_addr);
-      *backup_len = 0;
-      RB_REMOVE(sh_switch_tree, &sh_switches, self);
-      useless = self;
-      goto end;
-    }
-  }
-
-end:
-  pthread_rwlock_unlock(&sh_switches_lock);  // SYNC - end
-  if (NULL != useless) sh_switch_destroy(useless, false);
-
-  return r;
-}
-
-int sh_switch_hook(uintptr_t target_addr, uintptr_t new_addr, uintptr_t *orig_addr, size_t *backup_len,
-                   xdl_info_t *dlinfo) {
-  int r;
-  if (SHADOWHOOK_IS_UNIQUE_MODE)
-    r = sh_switch_hook_unique(target_addr, new_addr, orig_addr, backup_len, dlinfo);
-  else
-    r = sh_switch_hook_shared(target_addr, new_addr, orig_addr, backup_len, dlinfo);
-
-  if (0 == r)
-    SH_LOG_INFO("switch: hook in %s mode OK: target_addr %" PRIxPTR ", new_addr %" PRIxPTR,
-                SHADOWHOOK_IS_UNIQUE_MODE ? "UNIQUE" : "SHARED", target_addr, new_addr);
-
-  return r;
-}
-
-static int sh_switch_hook_unique_invisible(uintptr_t target_addr, uintptr_t new_addr, uintptr_t *orig_addr,
-                                           size_t *backup_len, xdl_info_t *dlinfo) {
-  pthread_rwlock_wrlock(&sh_switches_lock);  // SYNC - start
-
-  // do hook
-  sh_inst_t inst;
-  int r = sh_inst_hook(&inst, target_addr, dlinfo, new_addr, orig_addr, NULL);
-
-  pthread_rwlock_unlock(&sh_switches_lock);  // SYNC - end
-
-  *backup_len = inst.backup_len;
-  return r;
-}
-
-int sh_switch_hook_invisible(uintptr_t target_addr, uintptr_t new_addr, uintptr_t *orig_addr,
-                             size_t *backup_len, xdl_info_t *dlinfo) {
-  int r;
-  if (SHADOWHOOK_IS_UNIQUE_MODE)
-    r = sh_switch_hook_unique_invisible(target_addr, new_addr, orig_addr, backup_len, dlinfo);
-  else
-    r = sh_switch_hook_shared(target_addr, new_addr, orig_addr, backup_len, dlinfo);
-
-  if (0 == r)
-    SH_LOG_INFO("switch: hook(invisible) in %s mode OK: target_addr %" PRIxPTR ", new_addr %" PRIxPTR,
-                SHADOWHOOK_IS_UNIQUE_MODE ? "UNIQUE" : "SHARED", target_addr, new_addr);
-  return r;
-}
-
-static int sh_switch_unhook_unique(uintptr_t target_addr) {
-  int r;
-  sh_switch_t *useless = NULL;
-
-  pthread_rwlock_wrlock(&sh_switches_lock);  // SYNC - start
-
-  sh_switch_t key = {.target_addr = target_addr};
-  sh_switch_t *self = RB_FIND(sh_switch_tree, &sh_switches, &key);
-  if (NULL == self) {
-    r = SHADOWHOOK_ERRNO_UNHOOK_NOTFOUND;
-    goto end;
-  }
-  r = sh_inst_unhook(&self->inst, target_addr);
-  RB_REMOVE(sh_switch_tree, &sh_switches, self);
-  useless = self;
-
-end:
-  pthread_rwlock_unlock(&sh_switches_lock);  // SYNC - end
-  if (NULL != useless) sh_switch_destroy(useless, false);
-  return r;
-}
-
-static int sh_switch_unhook_shared(uintptr_t target_addr, uintptr_t new_addr) {
-  int r;
-  sh_switch_t *useless = NULL;
-
-  pthread_rwlock_wrlock(&sh_switches_lock);  // SYNC - start
-
-  sh_switch_t key = {.target_addr = target_addr};
-  sh_switch_t *self = RB_FIND(sh_switch_tree, &sh_switches, &key);
-  if (NULL == self) {
-    r = SHADOWHOOK_ERRNO_UNHOOK_NOTFOUND;
-    goto end;
-  }
-
-  // delete proxy in hub
-  bool have_enabled_proxy;
-  if (0 != sh_hub_del_proxy(self->hub, new_addr, &have_enabled_proxy)) {
-    r = SHADOWHOOK_ERRNO_UNHOOK_NOTFOUND;
-    goto end;
-  }
-  r = 0;
-
-  // unhook inst, remove current switch from switch-tree
-  if (!have_enabled_proxy) {
-    r = sh_inst_unhook(&self->inst, target_addr);
-
-    uintptr_t *safe_orig_addr_addr = sh_safe_get_orig_addr_addr(target_addr);
-    if (NULL != safe_orig_addr_addr) __atomic_store_n(safe_orig_addr_addr, 0, __ATOMIC_SEQ_CST);
-
-    RB_REMOVE(sh_switch_tree, &sh_switches, self);
-    useless = self;
-  }
-
-end:
-  pthread_rwlock_unlock(&sh_switches_lock);  // SYNC - end
-  if (NULL != useless) sh_switch_destroy(useless, true);
-  return r;
-}
-
-int sh_switch_unhook(uintptr_t target_addr, uintptr_t new_addr) {
-  int r;
-  if (SHADOWHOOK_IS_UNIQUE_MODE) {
-    r = sh_switch_unhook_unique(target_addr);
-    if (0 == r) SH_LOG_INFO("switch: unhook in UNIQUE mode OK: target_addr %" PRIxPTR, target_addr);
-  } else {
-    r = sh_switch_unhook_shared(target_addr, new_addr);
-    if (0 == r)
-      SH_LOG_INFO("switch: unhook in SHARED mode OK: target_addr %" PRIxPTR ", new_addr %" PRIxPTR,
-                  target_addr, new_addr);
-  }
-
-  return r;
-}
diff --git a/app/src/main/cpp/shadowhook/sh_switch.h b/app/src/main/cpp/shadowhook/sh_switch.h
deleted file mode 100644
index 3899a93..0000000
--- a/app/src/main/cpp/shadowhook/sh_switch.h
+++ /dev/null
@@ -1,34 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stdint.h>
-
-#include "xdl.h"
-
-int sh_switch_hook(uintptr_t target_addr, uintptr_t new_addr, uintptr_t *orig_addr, size_t *backup_len,
-                   xdl_info_t *dlinfo);
-int sh_switch_unhook(uintptr_t target_addr, uintptr_t new_addr);
-
-int sh_switch_hook_invisible(uintptr_t target_addr, uintptr_t new_addr, uintptr_t *orig_addr,
-                             size_t *backup_len, xdl_info_t *dlinfo);
diff --git a/app/src/main/cpp/shadowhook/sh_task.c b/app/src/main/cpp/shadowhook/sh_task.c
deleted file mode 100644
index 49ad751..0000000
--- a/app/src/main/cpp/shadowhook/sh_task.c
+++ /dev/null
@@ -1,333 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "sh_task.h"
-
-#include <inttypes.h>
-#include <malloc.h>
-#include <poll.h>
-#include <pthread.h>
-#include <stdbool.h>
-#include <stdint.h>
-#include <stdlib.h>
-#include <string.h>
-#include <sys/eventfd.h>
-#include <unistd.h>
-
-#include "queue.h"
-#include "sh_config.h"
-#include "sh_errno.h"
-#include "sh_linker.h"
-#include "sh_log.h"
-#include "sh_recorder.h"
-#include "sh_sig.h"
-#include "sh_switch.h"
-#include "sh_util.h"
-#include "shadowhook.h"
-#include "xdl.h"
-
-#define SH_TASK_THREAD_NAME "shadowhook-task"
-
-// task
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wpadded"
-struct sh_task {
-  char *lib_name;
-  char *sym_name;
-  uintptr_t target_addr;
-  uintptr_t new_addr;
-  uintptr_t *orig_addr;
-  shadowhook_hooked_t hooked;
-  void *hooked_arg;
-  uintptr_t caller_addr;
-  bool finished;
-  bool error;
-  bool ignore_symbol_check;
-  TAILQ_ENTRY(sh_task, ) link;
-};
-#pragma clang diagnostic pop
-
-// task queue
-typedef TAILQ_HEAD(sh_task_queue, sh_task, ) sh_task_queue_t;
-
-// task queue object
-static sh_task_queue_t sh_tasks = TAILQ_HEAD_INITIALIZER(sh_tasks);
-static pthread_rwlock_t sh_tasks_lock = PTHREAD_RWLOCK_INITIALIZER;
-static int sh_tasks_unfinished_cnt = 0;
-
-static int sh_task_eventfd;
-static int thread_started_result = SHADOWHOOK_ERRNO_MONITOR_THREAD;
-
-sh_task_t *sh_task_create_by_target_addr(uintptr_t target_addr, uintptr_t new_addr, uintptr_t *orig_addr,
-                                         bool ignore_symbol_check, uintptr_t caller_addr) {
-  sh_task_t *self = malloc(sizeof(sh_task_t));
-  if (NULL == self) return NULL;
-  self->lib_name = NULL;
-  self->sym_name = NULL;
-  self->target_addr = target_addr;
-  self->new_addr = new_addr;
-  self->orig_addr = orig_addr;
-  self->hooked = NULL;
-  self->hooked_arg = NULL;
-  self->caller_addr = caller_addr;
-  self->finished = false;
-  self->error = false;
-  self->ignore_symbol_check = ignore_symbol_check;
-
-  return self;
-}
-
-sh_task_t *sh_task_create_by_sym_name(const char *lib_name, const char *sym_name, uintptr_t new_addr,
-                                      uintptr_t *orig_addr, shadowhook_hooked_t hooked, void *hooked_arg,
-                                      uintptr_t caller_addr) {
-  sh_task_t *self = malloc(sizeof(sh_task_t));
-  if (NULL == self) return NULL;
-
-  if (NULL == (self->lib_name = strdup(lib_name))) goto err;
-  if (NULL == (self->sym_name = strdup(sym_name))) goto err;
-  self->target_addr = 0;
-  self->new_addr = new_addr;
-  self->orig_addr = orig_addr;
-  self->hooked = hooked;
-  self->hooked_arg = hooked_arg;
-  self->caller_addr = caller_addr;
-  self->finished = false;
-  self->error = false;
-  self->ignore_symbol_check = false;
-
-  return self;
-
-err:
-  if (NULL != self->lib_name) free(self->lib_name);
-  if (NULL != self->sym_name) free(self->sym_name);
-  free(self);
-  return NULL;
-}
-
-void sh_task_destroy(sh_task_t *self) {
-  if (NULL != self->lib_name) free(self->lib_name);
-  if (NULL != self->sym_name) free(self->sym_name);
-  free(self);
-}
-
-static void sh_task_do_callback(sh_task_t *self, int error_number) {
-  if (NULL != self->hooked)
-    self->hooked(error_number, self->lib_name, self->sym_name, (void *)self->target_addr,
-                 (void *)self->new_addr, self->orig_addr, self->hooked_arg);
-}
-
-static int sh_task_hook_pending(struct dl_phdr_info *info, size_t size, void *arg) {
-  (void)size, (void)arg;
-
-  pthread_rwlock_rdlock(&sh_tasks_lock);
-
-  sh_task_t *task;
-  TAILQ_FOREACH(task, &sh_tasks, link) {
-    if (task->finished) continue;
-    if ('/' == info->dlpi_name[0] && NULL == strstr(info->dlpi_name, task->lib_name)) continue;
-    if ('/' != info->dlpi_name[0] && NULL == strstr(task->lib_name, info->dlpi_name)) continue;
-
-    xdl_info_t dlinfo;
-    char real_lib_name[512];
-    int r = sh_linker_get_dlinfo_by_sym_name(task->lib_name, task->sym_name, &dlinfo, real_lib_name,
-                                             sizeof(real_lib_name));
-    task->target_addr = (uintptr_t)dlinfo.dli_saddr;
-    if (SHADOWHOOK_ERRNO_PENDING != r) {
-      size_t backup_len = 0;
-      if (0 == r) {
-        r = sh_switch_hook(task->target_addr, task->new_addr, task->orig_addr, &backup_len, &dlinfo);
-        if (0 != r) task->error = true;
-      } else {
-        strlcpy(real_lib_name, task->lib_name, sizeof(real_lib_name));
-        task->error = true;
-      }
-      sh_recorder_add_hook(r, false, task->target_addr, real_lib_name, task->sym_name, task->new_addr,
-                           backup_len, (uintptr_t)task, task->caller_addr);
-      task->finished = true;
-      sh_task_do_callback(task, r);
-      if (0 == __atomic_sub_fetch(&sh_tasks_unfinished_cnt, 1, __ATOMIC_SEQ_CST)) break;
-    }
-  }
-
-  pthread_rwlock_unlock(&sh_tasks_lock);
-
-  return __atomic_load_n(&sh_tasks_unfinished_cnt, __ATOMIC_SEQ_CST) > 0 ? 0 : 1;
-}
-
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wgnu-statement-expression"
-
-static void sh_task_post_dlopen_callback(void *arg) {
-  (void)arg;
-
-  if (0 == thread_started_result && __atomic_load_n(&sh_tasks_unfinished_cnt, __ATOMIC_SEQ_CST) > 0) {
-    uint64_t ev_val = 1;
-    SH_UTIL_TEMP_FAILURE_RETRY(write(sh_task_eventfd, &ev_val, sizeof(ev_val)));
-  }
-}
-
-__noreturn static void *sh_task_thread_func(void *arg) {
-  (void)arg;
-  pthread_t thread = pthread_self();
-  pthread_setname_np(thread, SH_TASK_THREAD_NAME);
-  pthread_detach(thread);
-
-  struct pollfd ev = {.fd = sh_task_eventfd, .events = POLLIN, .revents = 0};
-  while (1) {
-    int n = SH_UTIL_TEMP_FAILURE_RETRY(poll(&ev, 1, -1));
-    if (n < 0) {
-      sleep(1);
-      continue;
-    } else if (n > 0) {
-      uint64_t ev_val;
-      SH_UTIL_TEMP_FAILURE_RETRY(read(sh_task_eventfd, &ev_val, sizeof(ev_val)));
-
-      if (sh_util_get_api_level() >= __ANDROID_API_L__) {
-        xdl_iterate_phdr(sh_task_hook_pending, NULL, XDL_DEFAULT);
-      } else {
-        SH_SIG_TRY(SIGSEGV, SIGBUS) {
-          xdl_iterate_phdr(sh_task_hook_pending, NULL, XDL_DEFAULT);
-        }
-        SH_SIG_CATCH() {
-          SH_LOG_WARN("task: dliterate crashed");
-        }
-        SH_SIG_EXIT
-      }
-    }
-  }
-}
-
-#pragma clang diagnostic pop
-
-static int sh_task_start_monitor(bool start_thread) {
-  static bool thread_started = false;
-  static pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER;
-  pthread_t thread;
-  int r;
-
-  // hook linker dlopen()
-  if (0 != (r = sh_linker_hook_dlopen(sh_task_post_dlopen_callback, NULL))) return r;
-
-  if (!start_thread) return 0;
-
-  // start thread
-  if (thread_started) return thread_started_result;
-  pthread_mutex_lock(&lock);
-  if (thread_started) goto end;
-
-  if (0 > (sh_task_eventfd = eventfd(0, EFD_NONBLOCK | EFD_CLOEXEC))) goto end;
-  if (0 != pthread_create(&thread, NULL, &sh_task_thread_func, NULL)) goto end;
-
-  // OK
-  thread_started_result = 0;
-
-end:
-  thread_started = true;
-  pthread_mutex_unlock(&lock);
-  SH_LOG_INFO("task: start monitor %s, return: %d", 0 == thread_started_result ? "OK" : "FAILED",
-              thread_started_result);
-  return thread_started_result;
-}
-
-int sh_task_hook(sh_task_t *self) {
-  int r;
-  bool is_hook_sym_addr = true;
-  char real_lib_name[512] = "unknown";
-  char real_sym_name[1024] = "unknown";
-  size_t backup_len = 0;
-
-  // find target-address by library-name and symbol-name
-  xdl_info_t dlinfo;
-  memset(&dlinfo, 0, sizeof(xdl_info_t));
-  if (0 == self->target_addr) {
-    is_hook_sym_addr = false;
-    strlcpy(real_lib_name, self->lib_name, sizeof(real_lib_name));
-    strlcpy(real_sym_name, self->sym_name, sizeof(real_sym_name));
-    r = sh_linker_get_dlinfo_by_sym_name(self->lib_name, self->sym_name, &dlinfo, real_lib_name,
-                                         sizeof(real_lib_name));
-    if (SHADOWHOOK_ERRNO_PENDING == r) {
-      // we need to start monitor linker dlopen for handle the pending task
-      if (0 != (r = sh_task_start_monitor(true))) goto end;
-      r = SHADOWHOOK_ERRNO_PENDING;
-      goto end;
-    }
-    if (0 != r) goto end;                             // error
-    self->target_addr = (uintptr_t)dlinfo.dli_saddr;  // OK
-  } else {
-    r = sh_linker_get_dlinfo_by_addr((void *)self->target_addr, &dlinfo, real_lib_name, sizeof(real_lib_name),
-                                     real_sym_name, sizeof(real_sym_name), self->ignore_symbol_check);
-    if (0 != r) goto end;  // error
-  }
-
-  // In UNIQUE mode, if external users are hooking the linker dlopen() or do_dlopen(),
-  // we MUST hook this method with invisible for ourself first.
-  if (sh_linker_need_to_hook_dlopen(self->target_addr)) {
-    SH_LOG_INFO("task: hook dlopen/do_dlopen internal. target-address %" PRIxPTR, self->target_addr);
-    if (0 != (r = sh_task_start_monitor(false))) goto end;
-  }
-
-  // hook by target-address
-  r = sh_switch_hook(self->target_addr, self->new_addr, self->orig_addr, &backup_len, &dlinfo);
-  self->finished = true;
-
-end:
-  if (0 == r || SHADOWHOOK_ERRNO_PENDING == r)  // "PENDING" is NOT an error
-  {
-    pthread_rwlock_wrlock(&sh_tasks_lock);
-    TAILQ_INSERT_TAIL(&sh_tasks, self, link);
-    if (!self->finished) __atomic_add_fetch(&sh_tasks_unfinished_cnt, 1, __ATOMIC_SEQ_CST);
-    pthread_rwlock_unlock(&sh_tasks_lock);
-  }
-
-  // record
-  sh_recorder_add_hook(r, is_hook_sym_addr, self->target_addr, real_lib_name, real_sym_name, self->new_addr,
-                       backup_len, (uintptr_t)self, self->caller_addr);
-
-  return r;
-}
-
-int sh_task_unhook(sh_task_t *self, uintptr_t caller_addr) {
-  pthread_rwlock_wrlock(&sh_tasks_lock);
-  TAILQ_REMOVE(&sh_tasks, self, link);
-  if (!self->finished) __atomic_sub_fetch(&sh_tasks_unfinished_cnt, 1, __ATOMIC_SEQ_CST);
-  pthread_rwlock_unlock(&sh_tasks_lock);
-
-  // check task status
-  int r;
-  if (self->error) {
-    r = SHADOWHOOK_ERRNO_UNHOOK_ON_ERROR;
-    goto end;
-  }
-  if (!self->finished) {
-    r = SHADOWHOOK_ERRNO_UNHOOK_ON_UNFINISHED;
-    goto end;
-  }
-
-  // do unhook
-  r = sh_switch_unhook(self->target_addr, self->new_addr);
-
-end:
-  // record
-  sh_recorder_add_unhook(r, (uintptr_t)self, caller_addr);
-  return r;
-}
diff --git a/app/src/main/cpp/shadowhook/sh_task.h b/app/src/main/cpp/shadowhook/sh_task.h
deleted file mode 100644
index e26aef9..0000000
--- a/app/src/main/cpp/shadowhook/sh_task.h
+++ /dev/null
@@ -1,40 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#pragma once
-#include <stdbool.h>
-#include <stdint.h>
-
-#include "shadowhook.h"
-
-typedef struct sh_task sh_task_t;
-
-sh_task_t *sh_task_create_by_target_addr(uintptr_t target_addr, uintptr_t new_addr, uintptr_t *orig_addr,
-                                         bool ignore_symbol_check, uintptr_t caller_addr);
-sh_task_t *sh_task_create_by_sym_name(const char *lib_name, const char *sym_name, uintptr_t new_addr,
-                                      uintptr_t *orig_addr, shadowhook_hooked_t hooked, void *hooked_arg,
-                                      uintptr_t caller_addr);
-void sh_task_destroy(sh_task_t *self);
-
-int sh_task_hook(sh_task_t *self);
-int sh_task_unhook(sh_task_t *self, uintptr_t caller_addr);
diff --git a/app/src/main/cpp/shadowhook/shadowhook.c b/app/src/main/cpp/shadowhook/shadowhook.c
deleted file mode 100644
index 254cda1..0000000
--- a/app/src/main/cpp/shadowhook/shadowhook.c
+++ /dev/null
@@ -1,328 +0,0 @@
-// Copyright (c) 2021-2022 ByteDance Inc.
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by Kelun Cai (caikelun@bytedance.com) on 2021-04-11.
-
-#include "shadowhook.h"
-
-#include <pthread.h>
-#include <stdbool.h>
-#include <stdlib.h>
-
-#include "bytesig.h"
-#include "sh_enter.h"
-#include "sh_errno.h"
-#include "sh_exit.h"
-#include "sh_hub.h"
-#include "sh_linker.h"
-#include "sh_log.h"
-#include "sh_recorder.h"
-#include "sh_safe.h"
-#include "sh_sig.h"
-#include "sh_switch.h"
-#include "sh_task.h"
-#include "sh_util.h"
-#include "xdl.h"
-
-#define GOTO_ERR(errnum) \
-  do {                   \
-    r = errnum;          \
-    goto err;            \
-  } while (0)
-
-static int shadowhook_init_errno = SHADOWHOOK_ERRNO_UNINIT;
-static shadowhook_mode_t shadowhook_mode = SHADOWHOOK_MODE_SHARED;
-
-const char *shadowhook_get_version(void) {
-  return "shadowhook version " SHADOWHOOK_VERSION;
-}
-
-int shadowhook_init(shadowhook_mode_t mode, bool debuggable) {
-  bool do_init = false;
-
-  if (__predict_true(SHADOWHOOK_ERRNO_UNINIT == shadowhook_init_errno)) {
-    static pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER;
-    pthread_mutex_lock(&lock);
-    if (__predict_true(SHADOWHOOK_ERRNO_UNINIT == shadowhook_init_errno)) {
-      do_init = true;
-      shadowhook_mode = mode;
-      sh_log_set_debuggable(debuggable);
-
-#define GOTO_END(errnum)            \
-  do {                              \
-    shadowhook_init_errno = errnum; \
-    goto end;                       \
-  } while (0)
-
-      if (__predict_false(0 != sh_errno_init())) GOTO_END(SHADOWHOOK_ERRNO_INIT_ERRNO);
-      if (__predict_false(0 != bytesig_init(SIGSEGV))) GOTO_END(SHADOWHOOK_ERRNO_INIT_SIGSEGV);
-      if (__predict_false(0 != bytesig_init(SIGBUS))) GOTO_END(SHADOWHOOK_ERRNO_INIT_SIGBUS);
-      if (__predict_false(0 != sh_enter_init())) GOTO_END(SHADOWHOOK_ERRNO_INIT_ENTER);
-      sh_exit_init();
-      if (SHADOWHOOK_MODE_SHARED == shadowhook_mode) {
-        if (__predict_false(0 != sh_safe_init())) GOTO_END(SHADOWHOOK_ERRNO_INIT_SAFE);
-        if (__predict_false(0 != sh_hub_init())) GOTO_END(SHADOWHOOK_ERRNO_INIT_HUB);
-      } else {
-        if (__predict_false(0 != sh_linker_init())) GOTO_END(SHADOWHOOK_ERRNO_INIT_LINKER);
-      }
-
-#undef GOTO_END
-
-      shadowhook_init_errno = SHADOWHOOK_ERRNO_OK;
-    }
-  end:
-    pthread_mutex_unlock(&lock);
-  }
-
-  SH_LOG_ALWAYS_SHOW("%s: shadowhook init(mode: %s, debuggable: %s), return: %d, real-init: %s",
-                     shadowhook_get_version(), SHADOWHOOK_MODE_SHARED == mode ? "SHARED" : "UNIQUE",
-                     debuggable ? "true" : "false", shadowhook_init_errno, do_init ? "yes" : "no");
-  SH_ERRNO_SET_RET_ERRNUM(shadowhook_init_errno);
-}
-
-int shadowhook_get_init_errno(void) {
-  return shadowhook_init_errno;
-}
-
-shadowhook_mode_t shadowhook_get_mode(void) {
-  return shadowhook_mode;
-}
-
-bool shadowhook_get_debuggable(void) {
-  return sh_log_get_debuggable();
-}
-
-void shadowhook_set_debuggable(bool debuggable) {
-  sh_log_set_debuggable(debuggable);
-}
-
-bool shadowhook_get_recordable(void) {
-  return sh_recorder_get_recordable();
-}
-
-void shadowhook_set_recordable(bool recordable) {
-  sh_recorder_set_recordable(recordable);
-}
-
-int shadowhook_get_errno(void) {
-  return sh_errno_get();
-}
-
-const char *shadowhook_to_errmsg(int error_number) {
-  return sh_errno_to_errmsg(error_number);
-}
-
-static void *shadowhook_hook_addr_impl(void *sym_addr, void *new_addr, void **orig_addr,
-                                       bool ignore_symbol_check, uintptr_t caller_addr) {
-  SH_LOG_INFO("shadowhook: hook_%s_addr(%p, %p) ...", ignore_symbol_check ? "func" : "sym", sym_addr,
-              new_addr);
-  sh_errno_reset();
-
-  int r;
-  if (NULL == sym_addr || NULL == new_addr) GOTO_ERR(SHADOWHOOK_ERRNO_INVALID_ARG);
-  if (SHADOWHOOK_ERRNO_OK != shadowhook_init_errno) GOTO_ERR(shadowhook_init_errno);
-
-  // create task
-  sh_task_t *task =
-      sh_task_create_by_target_addr((uintptr_t)sym_addr, (uintptr_t)new_addr, (uintptr_t *)orig_addr,
-                                    ignore_symbol_check, (uintptr_t)caller_addr);
-  if (NULL == task) GOTO_ERR(SHADOWHOOK_ERRNO_OOM);
-
-  // do hook
-  r = sh_task_hook(task);
-  if (0 != r) {
-    sh_task_destroy(task);
-    GOTO_ERR(r);
-  }
-
-  // OK
-  SH_LOG_INFO("shadowhook: hook_%s_addr(%p, %p) OK. return: %p", ignore_symbol_check ? "func" : "sym",
-              sym_addr, new_addr, (void *)task);
-  SH_ERRNO_SET_RET(SHADOWHOOK_ERRNO_OK, (void *)task);
-
-err:
-  SH_LOG_ERROR("shadowhook: hook_%s_addr(%p, %p) FAILED. %d - %s", ignore_symbol_check ? "func" : "sym",
-               sym_addr, new_addr, r, sh_errno_to_errmsg(r));
-  SH_ERRNO_SET_RET_NULL(r);
-}
-
-void *shadowhook_hook_func_addr(void *func_addr, void *new_addr, void **orig_addr) {
-  const void *caller_addr = __builtin_return_address(0);
-  return shadowhook_hook_addr_impl(func_addr, new_addr, orig_addr, true, (uintptr_t)caller_addr);
-}
-
-void *shadowhook_hook_sym_addr(void *sym_addr, void *new_addr, void **orig_addr) {
-  const void *caller_addr = __builtin_return_address(0);
-  return shadowhook_hook_addr_impl(sym_addr, new_addr, orig_addr, false, (uintptr_t)caller_addr);
-}
-
-static void *shadowhook_hook_sym_name_impl(const char *lib_name, const char *sym_name, void *new_addr,
-                                           void **orig_addr, shadowhook_hooked_t hooked, void *hooked_arg,
-                                           uintptr_t caller_addr) {
-  SH_LOG_INFO("shadowhook: hook_sym_name(%s, %s, %p) ...", lib_name, sym_name, new_addr);
-  sh_errno_reset();
-
-  int r;
-  if (NULL == lib_name || NULL == sym_name || NULL == new_addr) GOTO_ERR(SHADOWHOOK_ERRNO_INVALID_ARG);
-  if (SHADOWHOOK_ERRNO_OK != shadowhook_init_errno) GOTO_ERR(shadowhook_init_errno);
-
-  // create task
-  sh_task_t *task =
-      sh_task_create_by_sym_name(lib_name, sym_name, (uintptr_t)new_addr, (uintptr_t *)orig_addr, hooked,
-                                 hooked_arg, (uintptr_t)caller_addr);
-  if (NULL == task) GOTO_ERR(SHADOWHOOK_ERRNO_OOM);
-
-  // do hook
-  r = sh_task_hook(task);
-  if (0 != r && SHADOWHOOK_ERRNO_PENDING != r) {
-    sh_task_destroy(task);
-    GOTO_ERR(r);
-  }
-
-  // OK
-  SH_LOG_INFO("shadowhook: hook_sym_name(%s, %s, %p) OK. return: %p. %d - %s", lib_name, sym_name, new_addr,
-              (void *)task, r, sh_errno_to_errmsg(r));
-  SH_ERRNO_SET_RET(r, (void *)task);
-
-err:
-  SH_LOG_ERROR("shadowhook: hook_sym_name(%s, %s, %p) FAILED. %d - %s", lib_name, sym_name, new_addr, r,
-               sh_errno_to_errmsg(r));
-  SH_ERRNO_SET_RET_NULL(r);
-}
-
-void *shadowhook_hook_sym_name(const char *lib_name, const char *sym_name, void *new_addr, void **orig_addr) {
-  const void *caller_addr = __builtin_return_address(0);
-  return shadowhook_hook_sym_name_impl(lib_name, sym_name, new_addr, orig_addr, NULL, NULL,
-                                       (uintptr_t)caller_addr);
-}
-
-void *shadowhook_hook_sym_name_callback(const char *lib_name, const char *sym_name, void *new_addr,
-                                        void **orig_addr, shadowhook_hooked_t hooked, void *hooked_arg) {
-  const void *caller_addr = __builtin_return_address(0);
-  return shadowhook_hook_sym_name_impl(lib_name, sym_name, new_addr, orig_addr, hooked, hooked_arg,
-                                       (uintptr_t)caller_addr);
-}
-
-int shadowhook_unhook(void *stub) {
-  const void *caller_addr = __builtin_return_address(0);
-  SH_LOG_INFO("shadowhook: unhook(%p) ...", stub);
-  sh_errno_reset();
-
-  int r;
-  if (NULL == stub) GOTO_ERR(SHADOWHOOK_ERRNO_INVALID_ARG);
-  if (SHADOWHOOK_ERRNO_OK != shadowhook_init_errno) GOTO_ERR(shadowhook_init_errno);
-
-  sh_task_t *task = (sh_task_t *)stub;
-  r = sh_task_unhook(task, (uintptr_t)caller_addr);
-  sh_task_destroy(task);
-  if (0 != r) GOTO_ERR(r);
-
-  // OK
-  SH_LOG_INFO("shadowhook: unhook(%p) OK", stub);
-  SH_ERRNO_SET_RET_ERRNUM(SHADOWHOOK_ERRNO_OK);
-
-err:
-  SH_LOG_ERROR("shadowhook: unhook(%p) FAILED. %d - %s", stub, r, sh_errno_to_errmsg(r));
-  SH_ERRNO_SET_RET_FAIL(r);
-}
-
-char *shadowhook_get_records(uint32_t item_flags) {
-  return sh_recorder_get(item_flags);
-}
-
-void shadowhook_dump_records(int fd, uint32_t item_flags) {
-  sh_recorder_dump(fd, item_flags);
-}
-
-void *shadowhook_dlopen(const char *lib_name) {
-  void *handle = NULL;
-  if (sh_util_get_api_level() >= __ANDROID_API_L__) {
-    handle = xdl_open(lib_name, XDL_DEFAULT);
-  } else {
-    SH_SIG_TRY(SIGSEGV, SIGBUS) {
-      handle = xdl_open(lib_name, XDL_DEFAULT);
-    }
-    SH_SIG_CATCH() {
-      SH_LOG_WARN("shadowhook: dlopen crashed - %s", lib_name);
-    }
-    SH_SIG_EXIT
-  }
-  return handle;
-}
-
-void shadowhook_dlclose(void *handle) {
-  xdl_close(handle);
-}
-
-void *shadowhook_dlsym(void *handle, const char *sym_name) {
-  void *addr = shadowhook_dlsym_dynsym(handle, sym_name);
-  if (NULL == addr) addr = shadowhook_dlsym_symtab(handle, sym_name);
-  return addr;
-}
-
-void *shadowhook_dlsym_dynsym(void *handle, const char *sym_name) {
-  void *addr = NULL;
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    addr = xdl_sym(handle, sym_name, NULL);
-  }
-  SH_SIG_CATCH() {
-    SH_LOG_WARN("shadowhook: dlsym_dynsym crashed - %p, %s", handle, sym_name);
-  }
-  SH_SIG_EXIT
-  return addr;
-}
-
-void *shadowhook_dlsym_symtab(void *handle, const char *sym_name) {
-  void *addr = NULL;
-  SH_SIG_TRY(SIGSEGV, SIGBUS) {
-    addr = xdl_dsym(handle, sym_name, NULL);
-  }
-  SH_SIG_CATCH() {
-    SH_LOG_WARN("shadowhook: dlsym_symtab crashed - %p, %s", handle, sym_name);
-  }
-  SH_SIG_EXIT
-  return addr;
-}
-
-void *shadowhook_get_prev_func(void *func) {
-  if (__predict_false(SHADOWHOOK_IS_UNIQUE_MODE)) abort();
-  return sh_hub_get_prev_func(func);
-}
-
-void shadowhook_pop_stack(void *return_address) {
-  if (__predict_false(SHADOWHOOK_IS_UNIQUE_MODE)) abort();
-  sh_hub_pop_stack(return_address);
-}
-
-void shadowhook_allow_reentrant(void *return_address) {
-  if (__predict_false(SHADOWHOOK_IS_UNIQUE_MODE)) abort();
-  sh_hub_allow_reentrant(return_address);
-}
-
-void shadowhook_disallow_reentrant(void *return_address) {
-  if (__predict_false(SHADOWHOOK_IS_UNIQUE_MODE)) abort();
-  sh_hub_disallow_reentrant(return_address);
-}
-
-void *shadowhook_get_return_address(void) {
-  if (__predict_false(SHADOWHOOK_IS_UNIQUE_MODE)) abort();
-  return sh_hub_get_return_address();
-}
diff --git a/app/src/main/cpp/shadowhook/third_party/bsd/queue.h b/app/src/main/cpp/shadowhook/third_party/bsd/queue.h
deleted file mode 100644
index f550f6c..0000000
--- a/app/src/main/cpp/shadowhook/third_party/bsd/queue.h
+++ /dev/null
@@ -1,551 +0,0 @@
-/*-
- * Copyright (c) 1991, 1993
- *      The Regents of the University of California.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. Neither the name of the University nor the names of its contributors
- *    may be used to endorse or promote products derived from this software
- *    without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- */
-
-#ifndef QUEUE_H
-#define QUEUE_H
-
-/* #include <sys/cdefs.h> */
-#define QUEUE_CONTAINER_OF(ptr, type, field) ((type *)((char *)(ptr) - ((char *)&((type *)0)->field)))
-
-/*
- * This file defines four types of data structures: singly-linked lists,
- * singly-linked tail queues, lists and tail queues.
- *
- * A singly-linked list is headed by a single forward pointer. The elements
- * are singly linked for minimum space and pointer manipulation overhead at
- * the expense of O(n) removal for arbitrary elements. New elements can be
- * added to the list after an existing element or at the head of the list.
- * Elements being removed from the head of the list should use the explicit
- * macro for this purpose for optimum efficiency. A singly-linked list may
- * only be traversed in the forward direction.  Singly-linked lists are ideal
- * for applications with large datasets and few or no removals or for
- * implementing a LIFO queue.
- *
- * A singly-linked tail queue is headed by a pair of pointers, one to the
- * head of the list and the other to the tail of the list. The elements are
- * singly linked for minimum space and pointer manipulation overhead at the
- * expense of O(n) removal for arbitrary elements. New elements can be added
- * to the list after an existing element, at the head of the list, or at the
- * end of the list. Elements being removed from the head of the tail queue
- * should use the explicit macro for this purpose for optimum efficiency.
- * A singly-linked tail queue may only be traversed in the forward direction.
- * Singly-linked tail queues are ideal for applications with large datasets
- * and few or no removals or for implementing a FIFO queue.
- *
- * A list is headed by a single forward pointer (or an array of forward
- * pointers for a hash table header). The elements are doubly linked
- * so that an arbitrary element can be removed without a need to
- * traverse the list. New elements can be added to the list before
- * or after an existing element or at the head of the list. A list
- * may be traversed in either direction.
- *
- * A tail queue is headed by a pair of pointers, one to the head of the
- * list and the other to the tail of the list. The elements are doubly
- * linked so that an arbitrary element can be removed without a need to
- * traverse the list. New elements can be added to the list before or
- * after an existing element, at the head of the list, or at the end of
- * the list. A tail queue may be traversed in either direction.
- *
- * For details on the use of these macros, see the queue(3) manual page.
- *
- *                              SLIST   LIST    STAILQ  TAILQ
- * _HEAD                        +       +       +       +
- * _HEAD_INITIALIZER            +       +       +       +
- * _ENTRY                       +       +       +       +
- * _INIT                        +       +       +       +
- * _EMPTY                       +       +       +       +
- * _FIRST                       +       +       +       +
- * _NEXT                        +       +       +       +
- * _PREV                        -       +       -       +
- * _LAST                        -       -       +       +
- * _FOREACH                     +       +       +       +
- * _FOREACH_FROM                +       +       +       +
- * _FOREACH_SAFE                +       +       +       +
- * _FOREACH_FROM_SAFE           +       +       +       +
- * _FOREACH_REVERSE             -       -       -       +
- * _FOREACH_REVERSE_FROM        -       -       -       +
- * _FOREACH_REVERSE_SAFE        -       -       -       +
- * _FOREACH_REVERSE_FROM_SAFE   -       -       -       +
- * _INSERT_HEAD                 +       +       +       +
- * _INSERT_BEFORE               -       +       -       +
- * _INSERT_AFTER                +       +       +       +
- * _INSERT_TAIL                 -       -       +       +
- * _CONCAT                      -       -       +       +
- * _REMOVE_AFTER                +       -       +       -
- * _REMOVE_HEAD                 +       -       +       -
- * _REMOVE                      +       +       +       +
- * _SWAP                        +       +       +       +
- *
- */
-
-/*
- * Singly-linked List declarations.
- */
-#define SLIST_HEAD(name, type, qual)                                    \
-    struct name {                                                       \
-        struct type *qual slh_first; /* first element */                \
-    }
-
-#define SLIST_HEAD_INITIALIZER(head)                                    \
-    { NULL }
-
-#define SLIST_ENTRY(type, qual)                                         \
-    struct {                                                            \
-        struct type *qual sle_next;  /* next element */                 \
-    }
-
-/*
- * Singly-linked List functions.
- */
-#define SLIST_INIT(head) do {                                           \
-        SLIST_FIRST((head)) = NULL;                                     \
-    } while (0)
-
-#define SLIST_EMPTY(head) ((head)->slh_first == NULL)
-
-#define SLIST_FIRST(head) ((head)->slh_first)
-
-#define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
-
-#define SLIST_FOREACH(var, head, field)                                 \
-    for ((var) = SLIST_FIRST((head));                                   \
-         (var);                                                         \
-         (var) = SLIST_NEXT((var), field))
-
-#define SLIST_FOREACH_FROM(var, head, field)                            \
-    for ((var) = ((var) ? (var) : SLIST_FIRST((head)));                 \
-         (var);                                                         \
-         (var) = SLIST_NEXT((var), field))
-
-#define SLIST_FOREACH_SAFE(var, head, field, tvar)                      \
-    for ((var) = SLIST_FIRST((head));                                   \
-         (var) && ((tvar) = SLIST_NEXT((var), field), 1);               \
-         (var) = (tvar))
-
-#define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar)                 \
-    for ((var) = ((var) ? (var) : SLIST_FIRST((head)));                 \
-         (var) && ((tvar) = SLIST_NEXT((var), field), 1);               \
-         (var) = (tvar))
-
-#define SLIST_INSERT_HEAD(head, elm, field) do {                        \
-        SLIST_NEXT((elm), field) = SLIST_FIRST((head));                 \
-        SLIST_FIRST((head)) = (elm);                                    \
-    } while (0)
-
-#define SLIST_INSERT_AFTER(slistelm, elm, field) do {                   \
-        SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field);       \
-        SLIST_NEXT((slistelm), field) = (elm);                          \
-    } while (0)
-
-#define SLIST_REMOVE_AFTER(elm, field) do {                             \
-        SLIST_NEXT(elm, field) =                                        \
-            SLIST_NEXT(SLIST_NEXT(elm, field), field);                  \
-    } while (0)
-
-#define SLIST_REMOVE_HEAD(head, field) do {                             \
-        SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field);   \
-    } while (0)
-
-#define SLIST_REMOVE(head, elm, type, field) do {                       \
-        if (SLIST_FIRST((head)) == (elm)) {                             \
-            SLIST_REMOVE_HEAD((head), field);                           \
-        }                                                               \
-        else {                                                          \
-            struct type *curelm = SLIST_FIRST((head));                  \
-            while (SLIST_NEXT(curelm, field) != (elm))                  \
-                curelm = SLIST_NEXT(curelm, field);                     \
-            SLIST_REMOVE_AFTER(curelm, field);                          \
-        }                                                               \
-    } while (0)
-
-#define SLIST_SWAP(head1, head2, type) do {                             \
-        struct type *swap_first = SLIST_FIRST(head1);                   \
-        SLIST_FIRST(head1) = SLIST_FIRST(head2);                        \
-        SLIST_FIRST(head2) = swap_first;                                \
-    } while (0)
-
-/*
- * List declarations.
- */
-#define LIST_HEAD(name, type, qual)                                     \
-    struct name {                                                       \
-        struct type *qual lh_first;  /* first element */                \
-    }
-
-#define LIST_HEAD_INITIALIZER(head)                                     \
-    { NULL }
-
-#define LIST_ENTRY(type, qual)                                          \
-    struct {                                                            \
-        struct type *qual le_next;   /* next element */                 \
-        struct type *qual *le_prev;  /* address of previous next element */ \
-    }
-
-/*
- * List functions.
- */
-#define LIST_INIT(head) do {                                            \
-        LIST_FIRST((head)) = NULL;                                      \
-    } while (0)
-
-#define LIST_EMPTY(head) ((head)->lh_first == NULL)
-
-#define LIST_FIRST(head) ((head)->lh_first)
-
-#define LIST_NEXT(elm, field) ((elm)->field.le_next)
-
-#define LIST_PREV(elm, head, type, field)                               \
-    ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL :               \
-     QUEUE_CONTAINER_OF((elm)->field.le_prev, struct type, field.le_next))
-
-#define LIST_FOREACH(var, head, field)                                  \
-    for ((var) = LIST_FIRST((head));                                    \
-         (var);                                                         \
-         (var) = LIST_NEXT((var), field))
-
-#define LIST_FOREACH_FROM(var, head, field)                             \
-    for ((var) = ((var) ? (var) : LIST_FIRST((head)));                  \
-         (var);                                                         \
-         (var) = LIST_NEXT((var), field))
-
-#define LIST_FOREACH_SAFE(var, head, field, tvar)                       \
-    for ((var) = LIST_FIRST((head));                                    \
-         (var) && ((tvar) = LIST_NEXT((var), field), 1);                \
-         (var) = (tvar))
-
-#define LIST_FOREACH_FROM_SAFE(var, head, field, tvar)                  \
-    for ((var) = ((var) ? (var) : LIST_FIRST((head)));                  \
-         (var) && ((tvar) = LIST_NEXT((var), field), 1);                \
-         (var) = (tvar))
-
-#define LIST_INSERT_HEAD(head, elm, field) do {                         \
-        if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL)     \
-            LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field); \
-        LIST_FIRST((head)) = (elm);                                     \
-        (elm)->field.le_prev = &LIST_FIRST((head));                     \
-    } while (0)
-
-#define LIST_INSERT_BEFORE(listelm, elm, field) do {                    \
-        (elm)->field.le_prev = (listelm)->field.le_prev;                \
-        LIST_NEXT((elm), field) = (listelm);                            \
-        *(listelm)->field.le_prev = (elm);                              \
-        (listelm)->field.le_prev = &LIST_NEXT((elm), field);            \
-    } while (0)
-
-#define LIST_INSERT_AFTER(listelm, elm, field) do {                     \
-        if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL) \
-            LIST_NEXT((listelm), field)->field.le_prev =                \
-                &LIST_NEXT((elm), field);                               \
-        LIST_NEXT((listelm), field) = (elm);                            \
-        (elm)->field.le_prev = &LIST_NEXT((listelm), field);            \
-    } while (0)
-
-#define LIST_REMOVE(elm, field) do {                                    \
-        if (LIST_NEXT((elm), field) != NULL)                            \
-            LIST_NEXT((elm), field)->field.le_prev =                    \
-                (elm)->field.le_prev;                                   \
-        *(elm)->field.le_prev = LIST_NEXT((elm), field);                \
-    } while (0)
-
-#define LIST_SWAP(head1, head2, type, field) do {                       \
-        struct type *swap_tmp = LIST_FIRST((head1));                    \
-        LIST_FIRST((head1)) = LIST_FIRST((head2));                      \
-        LIST_FIRST((head2)) = swap_tmp;                                 \
-        if ((swap_tmp = LIST_FIRST((head1))) != NULL)                   \
-            swap_tmp->field.le_prev = &LIST_FIRST((head1));             \
-        if ((swap_tmp = LIST_FIRST((head2))) != NULL)                   \
-            swap_tmp->field.le_prev = &LIST_FIRST((head2));             \
-    } while (0)
-
-/*
- * Singly-linked Tail queue declarations.
- */
-#define STAILQ_HEAD(name, type, qual)                                   \
-    struct name {                                                       \
-        struct type *qual stqh_first;/* first element */                \
-        struct type *qual *stqh_last;/* addr of last next element */    \
-    }
-
-#define STAILQ_HEAD_INITIALIZER(head)                                   \
-    { NULL, &(head).stqh_first }
-
-#define STAILQ_ENTRY(type, qual)                                        \
-    struct {                                                            \
-        struct type *qual stqe_next; /* next element */                 \
-    }
-
-/*
- * Singly-linked Tail queue functions.
- */
-#define STAILQ_INIT(head) do {                                          \
-        STAILQ_FIRST((head)) = NULL;                                    \
-        (head)->stqh_last = &STAILQ_FIRST((head));                      \
-    } while (0)
-
-#define STAILQ_EMPTY(head) ((head)->stqh_first == NULL)
-
-#define STAILQ_FIRST(head) ((head)->stqh_first)
-
-#define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next)
-
-#define STAILQ_LAST(head, type, field)                                  \
-    (STAILQ_EMPTY((head)) ? NULL :                                      \
-     QUEUE_CONTAINER_OF((head)->stqh_last, struct type, field.stqe_next))
-
-#define STAILQ_FOREACH(var, head, field)                                \
-    for((var) = STAILQ_FIRST((head));                                   \
-        (var);                                                          \
-        (var) = STAILQ_NEXT((var), field))
-
-#define STAILQ_FOREACH_FROM(var, head, field)                           \
-    for ((var) = ((var) ? (var) : STAILQ_FIRST((head)));                \
-         (var);                                                         \
-         (var) = STAILQ_NEXT((var), field))
-
-#define STAILQ_FOREACH_SAFE(var, head, field, tvar)                     \
-    for ((var) = STAILQ_FIRST((head));                                  \
-         (var) && ((tvar) = STAILQ_NEXT((var), field), 1);              \
-         (var) = (tvar))
-
-#define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar)                \
-    for ((var) = ((var) ? (var) : STAILQ_FIRST((head)));                \
-         (var) && ((tvar) = STAILQ_NEXT((var), field), 1);              \
-         (var) = (tvar))
-
-#define STAILQ_INSERT_HEAD(head, elm, field) do {                       \
-        if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
-            (head)->stqh_last = &STAILQ_NEXT((elm), field);             \
-        STAILQ_FIRST((head)) = (elm);                                   \
-    } while (0)
-
-#define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {               \
-        if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL) \
-            (head)->stqh_last = &STAILQ_NEXT((elm), field);             \
-        STAILQ_NEXT((tqelm), field) = (elm);                            \
-    } while (0)
-
-#define STAILQ_INSERT_TAIL(head, elm, field) do {                       \
-        STAILQ_NEXT((elm), field) = NULL;                               \
-        *(head)->stqh_last = (elm);                                     \
-        (head)->stqh_last = &STAILQ_NEXT((elm), field);                 \
-    } while (0)
-
-#define STAILQ_CONCAT(head1, head2) do {                                \
-        if (!STAILQ_EMPTY((head2))) {                                   \
-            *(head1)->stqh_last = (head2)->stqh_first;                  \
-            (head1)->stqh_last = (head2)->stqh_last;                    \
-            STAILQ_INIT((head2));                                       \
-        }                                                               \
-    } while (0)
-
-#define STAILQ_REMOVE_AFTER(head, elm, field) do {                      \
-        if ((STAILQ_NEXT(elm, field) =                                  \
-             STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL)      \
-            (head)->stqh_last = &STAILQ_NEXT((elm), field);             \
-    } while (0)
-
-#define STAILQ_REMOVE_HEAD(head, field) do {                            \
-        if ((STAILQ_FIRST((head)) =                                     \
-             STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL)         \
-            (head)->stqh_last = &STAILQ_FIRST((head));                  \
-    } while (0)
-
-#define STAILQ_REMOVE(head, elm, type, field) do {                      \
-        if (STAILQ_FIRST((head)) == (elm)) {                            \
-            STAILQ_REMOVE_HEAD((head), field);                          \
-        }                                                               \
-        else {                                                          \
-            struct type *curelm = STAILQ_FIRST((head));                 \
-            while (STAILQ_NEXT(curelm, field) != (elm))                 \
-                curelm = STAILQ_NEXT(curelm, field);                    \
-            STAILQ_REMOVE_AFTER(head, curelm, field);                   \
-        }                                                               \
-    } while (0)
-
-#define STAILQ_SWAP(head1, head2, type) do {                            \
-        struct type *swap_first = STAILQ_FIRST(head1);                  \
-        struct type **swap_last = (head1)->stqh_last;                   \
-        STAILQ_FIRST(head1) = STAILQ_FIRST(head2);                      \
-        (head1)->stqh_last = (head2)->stqh_last;                        \
-        STAILQ_FIRST(head2) = swap_first;                               \
-        (head2)->stqh_last = swap_last;                                 \
-        if (STAILQ_EMPTY(head1))                                        \
-            (head1)->stqh_last = &STAILQ_FIRST(head1);                  \
-        if (STAILQ_EMPTY(head2))                                        \
-            (head2)->stqh_last = &STAILQ_FIRST(head2);                  \
-    } while (0)
-
-/*
- * Tail queue declarations.
- */
-#define TAILQ_HEAD(name, type, qual)                                    \
-    struct name {                                                       \
-        struct type *qual tqh_first; /* first element */                \
-        struct type *qual *tqh_last; /* addr of last next element */    \
-}
-
-#define TAILQ_HEAD_INITIALIZER(head)                                    \
-    { NULL, &(head).tqh_first }
-
-#define TAILQ_ENTRY(type, qual)                                         \
-    struct {                                                            \
-        struct type *qual tqe_next;  /* next element */                 \
-        struct type *qual *tqe_prev; /* address of previous next element */ \
-    }
-
-/*
- * Tail queue functions.
- */
-#define TAILQ_INIT(head) do {                                           \
-        TAILQ_FIRST((head)) = NULL;                                     \
-        (head)->tqh_last = &TAILQ_FIRST((head));                        \
-    } while (0)
-
-#define TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
-
-#define TAILQ_FIRST(head) ((head)->tqh_first)
-
-#define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
-
-#define TAILQ_PREV(elm, headname, field)                                \
-        (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
-
-#define TAILQ_LAST(head, headname)                                      \
-    (*(((struct headname *)((head)->tqh_last))->tqh_last))
-
-#define TAILQ_FOREACH(var, head, field)                                 \
-    for ((var) = TAILQ_FIRST((head));                                   \
-         (var);                                                         \
-         (var) = TAILQ_NEXT((var), field))
-
-#define TAILQ_FOREACH_FROM(var, head, field)                            \
-    for ((var) = ((var) ? (var) : TAILQ_FIRST((head)));                 \
-         (var);                                                         \
-         (var) = TAILQ_NEXT((var), field))
-
-#define TAILQ_FOREACH_SAFE(var, head, field, tvar)                      \
-    for ((var) = TAILQ_FIRST((head));                                   \
-         (var) && ((tvar) = TAILQ_NEXT((var), field), 1);               \
-         (var) = (tvar))
-
-#define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar)                 \
-    for ((var) = ((var) ? (var) : TAILQ_FIRST((head)));                 \
-         (var) && ((tvar) = TAILQ_NEXT((var), field), 1);               \
-         (var) = (tvar))
-
-#define TAILQ_FOREACH_REVERSE(var, head, headname, field)               \
-    for ((var) = TAILQ_LAST((head), headname);                          \
-         (var);                                                         \
-         (var) = TAILQ_PREV((var), headname, field))
-
-#define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field)          \
-    for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname));        \
-         (var);                                                         \
-         (var) = TAILQ_PREV((var), headname, field))
-
-#define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)    \
-    for ((var) = TAILQ_LAST((head), headname);                          \
-         (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1);     \
-         (var) = (tvar))
-
-#define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \
-    for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname));        \
-         (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1);     \
-         (var) = (tvar))
-
-#define TAILQ_INSERT_HEAD(head, elm, field) do {                        \
-        if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL)   \
-            TAILQ_FIRST((head))->field.tqe_prev =                       \
-                &TAILQ_NEXT((elm), field);                              \
-        else                                                            \
-            (head)->tqh_last = &TAILQ_NEXT((elm), field);               \
-        TAILQ_FIRST((head)) = (elm);                                    \
-        (elm)->field.tqe_prev = &TAILQ_FIRST((head));                   \
-    } while (0)
-
-#define TAILQ_INSERT_BEFORE(listelm, elm, field) do {                   \
-        (elm)->field.tqe_prev = (listelm)->field.tqe_prev;              \
-        TAILQ_NEXT((elm), field) = (listelm);                           \
-        *(listelm)->field.tqe_prev = (elm);                             \
-        (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field);          \
-    } while (0)
-
-#define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {              \
-        if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL) \
-            TAILQ_NEXT((elm), field)->field.tqe_prev =                  \
-                &TAILQ_NEXT((elm), field);                              \
-        else                                                            \
-            (head)->tqh_last = &TAILQ_NEXT((elm), field);               \
-        TAILQ_NEXT((listelm), field) = (elm);                           \
-        (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field);          \
-    } while (0)
-
-#define TAILQ_INSERT_TAIL(head, elm, field) do {                        \
-        TAILQ_NEXT((elm), field) = NULL;                                \
-        (elm)->field.tqe_prev = (head)->tqh_last;                       \
-        *(head)->tqh_last = (elm);                                      \
-        (head)->tqh_last = &TAILQ_NEXT((elm), field);                   \
-    } while (0)
-
-#define TAILQ_CONCAT(head1, head2, field) do {                          \
-        if (!TAILQ_EMPTY(head2)) {                                      \
-            *(head1)->tqh_last = (head2)->tqh_first;                    \
-            (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last;     \
-            (head1)->tqh_last = (head2)->tqh_last;                      \
-            TAILQ_INIT((head2));                                        \
-        }                                                               \
-    } while (0)
-
-#define TAILQ_REMOVE(head, elm, field) do {                             \
-        if ((TAILQ_NEXT((elm), field)) != NULL)                         \
-            TAILQ_NEXT((elm), field)->field.tqe_prev =                  \
-                (elm)->field.tqe_prev;                                  \
-        else                                                            \
-            (head)->tqh_last = (elm)->field.tqe_prev;                   \
-        *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field);              \
-    } while (0)
-
-#define TAILQ_SWAP(head1, head2, type, field) do {                      \
-        struct type *swap_first = (head1)->tqh_first;                   \
-        struct type **swap_last = (head1)->tqh_last;                    \
-        (head1)->tqh_first = (head2)->tqh_first;                        \
-        (head1)->tqh_last = (head2)->tqh_last;                          \
-        (head2)->tqh_first = swap_first;                                \
-        (head2)->tqh_last = swap_last;                                  \
-        if ((swap_first = (head1)->tqh_first) != NULL)                  \
-            swap_first->field.tqe_prev = &(head1)->tqh_first;           \
-        else                                                            \
-            (head1)->tqh_last = &(head1)->tqh_first;                    \
-        if ((swap_first = (head2)->tqh_first) != NULL)                  \
-            swap_first->field.tqe_prev = &(head2)->tqh_first;           \
-        else                                                            \
-            (head2)->tqh_last = &(head2)->tqh_first;                    \
-    } while (0)
-
-#endif
diff --git a/app/src/main/cpp/shadowhook/third_party/bsd/tree.h b/app/src/main/cpp/shadowhook/third_party/bsd/tree.h
deleted file mode 100644
index e6db6a9..0000000
--- a/app/src/main/cpp/shadowhook/third_party/bsd/tree.h
+++ /dev/null
@@ -1,759 +0,0 @@
-/*-
- * Copyright 2002 Niels Provos <provos@citi.umich.edu>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef TREE_H
-#define TREE_H
-
-/*
- * This file defines data structures for different types of trees:
- * splay trees and red-black trees.
- *
- * A splay tree is a self-organizing data structure.  Every operation
- * on the tree causes a splay to happen.  The splay moves the requested
- * node to the root of the tree and partly rebalances it.
- *
- * This has the benefit that request locality causes faster lookups as
- * the requested nodes move to the top of the tree.  On the other hand,
- * every lookup causes memory writes.
- *
- * The Balance Theorem bounds the total access time for m operations
- * and n inserts on an initially empty tree as O((m + n)lg n).  The
- * amortized cost for a sequence of m accesses to a splay tree is O(lg n);
- *
- * A red-black tree is a binary search tree with the node color as an
- * extra attribute.  It fulfills a set of conditions:
- *      - every search path from the root to a leaf consists of the
- *        same number of black nodes,
- *      - each red node (except for the root) has a black parent,
- *      - each leaf node is black.
- *
- * Every operation on a red-black tree is bounded as O(lg n).
- * The maximum height of a red-black tree is 2lg (n+1).
- */
-
-#define SPLAY_HEAD(name, type)                                          \
-struct name {                                                           \
-        struct type *sph_root; /* root of the tree */                   \
-}
-
-#define SPLAY_INITIALIZER(root)                                         \
-        { NULL }
-
-#define SPLAY_INIT(root) do {                                           \
-        (root)->sph_root = NULL;                                        \
-} while (/*CONSTCOND*/ 0)
-
-#define SPLAY_ENTRY(type)                                               \
-struct {                                                                \
-        struct type *spe_left; /* left element */                       \
-        struct type *spe_right; /* right element */                     \
-}
-
-#define SPLAY_LEFT(elm, field)          (elm)->field.spe_left
-#define SPLAY_RIGHT(elm, field)         (elm)->field.spe_right
-#define SPLAY_ROOT(head)                (head)->sph_root
-#define SPLAY_EMPTY(head)               (SPLAY_ROOT(head) == NULL)
-
-/* SPLAY_ROTATE_{LEFT,RIGHT} expect that tmp hold SPLAY_{RIGHT,LEFT} */
-#define SPLAY_ROTATE_RIGHT(head, tmp, field) do {                       \
-        SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field);  \
-        SPLAY_RIGHT(tmp, field) = (head)->sph_root;                     \
-        (head)->sph_root = tmp;                                         \
-} while (/*CONSTCOND*/ 0)
-        
-#define SPLAY_ROTATE_LEFT(head, tmp, field) do {                        \
-        SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field);  \
-        SPLAY_LEFT(tmp, field) = (head)->sph_root;                      \
-        (head)->sph_root = tmp;                                         \
-} while (/*CONSTCOND*/ 0)
-
-#define SPLAY_LINKLEFT(head, tmp, field) do {                           \
-        SPLAY_LEFT(tmp, field) = (head)->sph_root;                      \
-        tmp = (head)->sph_root;                                         \
-        (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);         \
-} while (/*CONSTCOND*/ 0)
-
-#define SPLAY_LINKRIGHT(head, tmp, field) do {                          \
-        SPLAY_RIGHT(tmp, field) = (head)->sph_root;                     \
-        tmp = (head)->sph_root;                                         \
-        (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);        \
-} while (/*CONSTCOND*/ 0)
-
-#define SPLAY_ASSEMBLE(head, node, left, right, field) do {             \
-        SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
-        SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
-        SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
-        SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
-} while (/*CONSTCOND*/ 0)
-
-/* Generates prototypes and inline functions */
-
-#define SPLAY_PROTOTYPE(name, type, field, cmp)                         \
-void name##_SPLAY(struct name *, struct type *);                        \
-void name##_SPLAY_MINMAX(struct name *, int);                           \
-struct type *name##_SPLAY_INSERT(struct name *, struct type *);         \
-struct type *name##_SPLAY_REMOVE(struct name *, struct type *);         \
-                                                                        \
-/* Finds the node with the same key as elm */                           \
-static __inline struct type *                                           \
-name##_SPLAY_FIND(struct name *head, struct type *elm)                  \
-{                                                                       \
-        if (SPLAY_EMPTY(head))                                          \
-                return(NULL);                                           \
-        name##_SPLAY(head, elm);                                        \
-        if ((cmp)(elm, (head)->sph_root) == 0)                          \
-                return (head->sph_root);                                \
-        return (NULL);                                                  \
-}                                                                       \
-                                                                        \
-static __inline struct type *                                          \
-name##_SPLAY_NEXT(struct name *head, struct type *elm)                 \
-{                                                                       \
-        name##_SPLAY(head, elm);                                        \
-        if (SPLAY_RIGHT(elm, field) != NULL) {                          \
-                elm = SPLAY_RIGHT(elm, field);                          \
-                while (SPLAY_LEFT(elm, field) != NULL) {                \
-                        elm = SPLAY_LEFT(elm, field);                   \
-                }                                                       \
-        } else                                                          \
-                elm = NULL;                                             \
-        return (elm);                                                   \
-}                                                                       \
-                                                                        \
-static __inline struct type *                                           \
-name##_SPLAY_MIN_MAX(struct name *head, int val)                        \
-{                                                                       \
-        name##_SPLAY_MINMAX(head, val);                                 \
-        return (SPLAY_ROOT(head));                                      \
-}
-
-/* Main splay operation.
- * Moves node close to the key of elm to top
- */
-#define SPLAY_GENERATE(name, type, field, cmp)                          \
-struct type *                                                           \
-name##_SPLAY_INSERT(struct name *head, struct type *elm)                \
-{                                                                       \
-    if (SPLAY_EMPTY(head)) {                                            \
-            SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL;    \
-    } else {                                                            \
-            int __comp;                                                 \
-            name##_SPLAY(head, elm);                                    \
-            __comp = (cmp)(elm, (head)->sph_root);                      \
-            if(__comp < 0) {                                            \
-                    SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
-                    SPLAY_RIGHT(elm, field) = (head)->sph_root;         \
-                    SPLAY_LEFT((head)->sph_root, field) = NULL;         \
-            } else if (__comp > 0) {                                    \
-                    SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
-                    SPLAY_LEFT(elm, field) = (head)->sph_root;          \
-                    SPLAY_RIGHT((head)->sph_root, field) = NULL;        \
-            } else                                                      \
-                    return ((head)->sph_root);                          \
-    }                                                                   \
-    (head)->sph_root = (elm);                                           \
-    return (NULL);                                                      \
-}                                                                       \
-                                                                        \
-struct type *                                                           \
-name##_SPLAY_REMOVE(struct name *head, struct type *elm)                \
-{                                                                       \
-        struct type *__tmp;                                             \
-        if (SPLAY_EMPTY(head))                                          \
-                return (NULL);                                          \
-        name##_SPLAY(head, elm);                                        \
-        if ((cmp)(elm, (head)->sph_root) == 0) {                        \
-                if (SPLAY_LEFT((head)->sph_root, field) == NULL) {      \
-                        (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
-                } else {                                                \
-                        __tmp = SPLAY_RIGHT((head)->sph_root, field);   \
-                        (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
-                        name##_SPLAY(head, elm);                        \
-                        SPLAY_RIGHT((head)->sph_root, field) = __tmp;   \
-                }                                                       \
-                return (elm);                                           \
-        }                                                               \
-        return (NULL);                                                  \
-}                                                                       \
-                                                                        \
-void                                                                    \
-name##_SPLAY(struct name *head, struct type *elm)                       \
-{                                                                       \
-        struct type __node, *__left, *__right, *__tmp;                  \
-        int __comp;                                                     \
-\
-        SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
-        __left = __right = &__node;                                     \
-\
-        while ((__comp = (cmp)(elm, (head)->sph_root)) != 0) {          \
-                if (__comp < 0) {                                       \
-                        __tmp = SPLAY_LEFT((head)->sph_root, field);    \
-                        if (__tmp == NULL)                              \
-                                break;                                  \
-                        if ((cmp)(elm, __tmp) < 0){                     \
-                                SPLAY_ROTATE_RIGHT(head, __tmp, field); \
-                                if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
-                                        break;                          \
-                        }                                               \
-                        SPLAY_LINKLEFT(head, __right, field);           \
-                } else if (__comp > 0) {                                \
-                        __tmp = SPLAY_RIGHT((head)->sph_root, field);   \
-                        if (__tmp == NULL)                              \
-                                break;                                  \
-                        if ((cmp)(elm, __tmp) > 0){                     \
-                                SPLAY_ROTATE_LEFT(head, __tmp, field);  \
-                                if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
-                                        break;                          \
-                        }                                               \
-                        SPLAY_LINKRIGHT(head, __left, field);           \
-                }                                                       \
-        }                                                               \
-        SPLAY_ASSEMBLE(head, &__node, __left, __right, field);          \
-}                                                                       \
-                                                                        \
-/* Splay with either the minimum or the maximum element                 \
- * Used to find minimum or maximum element in tree.                     \
- */                                                                     \
-void name##_SPLAY_MINMAX(struct name *head, int __comp) \
-{                                                                       \
-        struct type __node, *__left, *__right, *__tmp;                  \
-\
-        SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
-        __left = __right = &__node;                                     \
-\
-        while (1) {                                                     \
-                if (__comp < 0) {                                       \
-                        __tmp = SPLAY_LEFT((head)->sph_root, field);    \
-                        if (__tmp == NULL)                              \
-                                break;                                  \
-                        if (__comp < 0){                                \
-                                SPLAY_ROTATE_RIGHT(head, __tmp, field); \
-                                if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
-                                        break;                          \
-                        }                                               \
-                        SPLAY_LINKLEFT(head, __right, field);           \
-                } else if (__comp > 0) {                                \
-                        __tmp = SPLAY_RIGHT((head)->sph_root, field);   \
-                        if (__tmp == NULL)                              \
-                                break;                                  \
-                        if (__comp > 0) {                               \
-                                SPLAY_ROTATE_LEFT(head, __tmp, field);  \
-                                if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
-                                        break;                          \
-                        }                                               \
-                        SPLAY_LINKRIGHT(head, __left, field);           \
-                }                                                       \
-        }                                                               \
-        SPLAY_ASSEMBLE(head, &__node, __left, __right, field);          \
-}
-
-#define SPLAY_NEGINF    -1
-#define SPLAY_INF       1
-
-#define SPLAY_INSERT(name, x, y)        name##_SPLAY_INSERT(x, y)
-#define SPLAY_REMOVE(name, x, y)        name##_SPLAY_REMOVE(x, y)
-#define SPLAY_FIND(name, x, y)          name##_SPLAY_FIND(x, y)
-#define SPLAY_NEXT(name, x, y)          name##_SPLAY_NEXT(x, y)
-#define SPLAY_MIN(name, x)              (SPLAY_EMPTY(x) ? NULL  \
-                                        : name##_SPLAY_MIN_MAX(x, SPLAY_NEGINF))
-#define SPLAY_MAX(name, x)              (SPLAY_EMPTY(x) ? NULL  \
-                                        : name##_SPLAY_MIN_MAX(x, SPLAY_INF))
-
-#define SPLAY_FOREACH(x, name, head)                                    \
-        for ((x) = SPLAY_MIN(name, head);                               \
-             (x) != NULL;                                               \
-             (x) = SPLAY_NEXT(name, head, x))
-
-/* Macros that define a red-black tree */
-#define RB_HEAD(name, type)                                             \
-struct name {                                                           \
-        struct type *rbh_root; /* root of the tree */                   \
-}
-
-#define RB_INITIALIZER(root)                                            \
-        { NULL }
-
-#define RB_INIT(root) do {                                              \
-        (root)->rbh_root = NULL;                                        \
-} while (/*CONSTCOND*/ 0)
-
-#define RB_BLACK        0
-#define RB_RED          1
-#define RB_ENTRY(type)                                                  \
-struct {                                                                \
-        struct type *rbe_left;          /* left element */              \
-        struct type *rbe_right;         /* right element */             \
-        struct type *rbe_parent;        /* parent element */            \
-        int rbe_color;                  /* node color */                \
-}
-
-#define RB_LEFT(elm, field)             (elm)->field.rbe_left
-#define RB_RIGHT(elm, field)            (elm)->field.rbe_right
-#define RB_PARENT(elm, field)           (elm)->field.rbe_parent
-#define RB_COLOR(elm, field)            (elm)->field.rbe_color
-#define RB_ROOT(head)                   (head)->rbh_root
-#define RB_EMPTY(head)                  (RB_ROOT(head) == NULL)
-
-#define RB_SET(elm, parent, field) do {                                 \
-        RB_PARENT(elm, field) = parent;                                 \
-        RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL;              \
-        RB_COLOR(elm, field) = RB_RED;                                  \
-} while (/*CONSTCOND*/ 0)
-
-#define RB_SET_BLACKRED(black, red, field) do {                         \
-        RB_COLOR(black, field) = RB_BLACK;                              \
-        RB_COLOR(red, field) = RB_RED;                                  \
-} while (/*CONSTCOND*/ 0)
-
-#ifndef RB_AUGMENT
-#define RB_AUGMENT(x)   do {} while (0)
-#endif
-
-#define RB_ROTATE_LEFT(head, elm, tmp, field) do {                      \
-        (tmp) = RB_RIGHT(elm, field);                                   \
-        if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field)) != NULL) {     \
-                RB_PARENT(RB_LEFT(tmp, field), field) = (elm);          \
-        }                                                               \
-        RB_AUGMENT(elm);                                                \
-        if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) {  \
-                if ((elm) == RB_LEFT(RB_PARENT(elm, field), field))     \
-                        RB_LEFT(RB_PARENT(elm, field), field) = (tmp);  \
-                else                                                    \
-                        RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
-        } else                                                          \
-                (head)->rbh_root = (tmp);                               \
-        RB_LEFT(tmp, field) = (elm);                                    \
-        RB_PARENT(elm, field) = (tmp);                                  \
-        RB_AUGMENT(tmp);                                                \
-        if ((RB_PARENT(tmp, field)))                                    \
-                RB_AUGMENT(RB_PARENT(tmp, field));                      \
-} while (/*CONSTCOND*/ 0)
-
-#define RB_ROTATE_RIGHT(head, elm, tmp, field) do {                     \
-        (tmp) = RB_LEFT(elm, field);                                    \
-        if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field)) != NULL) {     \
-                RB_PARENT(RB_RIGHT(tmp, field), field) = (elm);         \
-        }                                                               \
-        RB_AUGMENT(elm);                                                \
-        if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) {  \
-                if ((elm) == RB_LEFT(RB_PARENT(elm, field), field))     \
-                        RB_LEFT(RB_PARENT(elm, field), field) = (tmp);  \
-                else                                                    \
-                        RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
-        } else                                                          \
-                (head)->rbh_root = (tmp);                               \
-        RB_RIGHT(tmp, field) = (elm);                                   \
-        RB_PARENT(elm, field) = (tmp);                                  \
-        RB_AUGMENT(tmp);                                                \
-        if ((RB_PARENT(tmp, field)))                                    \
-                RB_AUGMENT(RB_PARENT(tmp, field));                      \
-} while (/*CONSTCOND*/ 0)
-
-/* Generates prototypes and inline functions */
-#define RB_PROTOTYPE(name, type, field, cmp)                            \
-        RB_PROTOTYPE_INTERNAL(name, type, field, cmp,)
-#define RB_PROTOTYPE_STATIC(name, type, field, cmp)                     \
-        RB_PROTOTYPE_INTERNAL(name, type, field, cmp, static)
-#define RB_PROTOTYPE_INTERNAL(name, type, field, cmp, attr)             \
-attr void name##_RB_INSERT_COLOR(struct name *, struct type *);         \
-attr void name##_RB_REMOVE_COLOR(struct name *, struct type *, struct type *);\
-attr struct type *name##_RB_REMOVE(struct name *, struct type *);       \
-attr struct type *name##_RB_INSERT(struct name *, struct type *);       \
-attr struct type *name##_RB_FIND(struct name *, struct type *);         \
-attr struct type *name##_RB_NFIND(struct name *, struct type *);        \
-attr struct type *name##_RB_NEXT(struct type *);                        \
-attr struct type *name##_RB_PREV(struct type *);                        \
-attr struct type *name##_RB_MINMAX(struct name *, int);                 \
-                                                                        \
-
-/* Main rb operation.
- * Moves node close to the key of elm to top
- */
-#define RB_GENERATE(name, type, field, cmp)                             \
-        RB_GENERATE_INTERNAL(name, type, field, cmp,)
-#define RB_GENERATE_STATIC(name, type, field, cmp)                      \
-        RB_GENERATE_INTERNAL(name, type, field, cmp, static)
-#define RB_GENERATE_INTERNAL(name, type, field, cmp, attr)              \
-attr void                                                               \
-name##_RB_INSERT_COLOR(struct name *head, struct type *elm)             \
-{                                                                       \
-        struct type *parent, *gparent, *tmp;                            \
-        while ((parent = RB_PARENT(elm, field)) != NULL &&              \
-            RB_COLOR(parent, field) == RB_RED) {                        \
-                gparent = RB_PARENT(parent, field);                     \
-                if (parent == RB_LEFT(gparent, field)) {                \
-                        tmp = RB_RIGHT(gparent, field);                 \
-                        if (tmp && RB_COLOR(tmp, field) == RB_RED) {    \
-                                RB_COLOR(tmp, field) = RB_BLACK;        \
-                                RB_SET_BLACKRED(parent, gparent, field);\
-                                elm = gparent;                          \
-                                continue;                               \
-                        }                                               \
-                        if (RB_RIGHT(parent, field) == elm) {           \
-                                RB_ROTATE_LEFT(head, parent, tmp, field);\
-                                tmp = parent;                           \
-                                parent = elm;                           \
-                                elm = tmp;                              \
-                        }                                               \
-                        RB_SET_BLACKRED(parent, gparent, field);        \
-                        RB_ROTATE_RIGHT(head, gparent, tmp, field);     \
-                } else {                                                \
-                        tmp = RB_LEFT(gparent, field);                  \
-                        if (tmp && RB_COLOR(tmp, field) == RB_RED) {    \
-                                RB_COLOR(tmp, field) = RB_BLACK;        \
-                                RB_SET_BLACKRED(parent, gparent, field);\
-                                elm = gparent;                          \
-                                continue;                               \
-                        }                                               \
-                        if (RB_LEFT(parent, field) == elm) {            \
-                                RB_ROTATE_RIGHT(head, parent, tmp, field);\
-                                tmp = parent;                           \
-                                parent = elm;                           \
-                                elm = tmp;                              \
-                        }                                               \
-                        RB_SET_BLACKRED(parent, gparent, field);        \
-                        RB_ROTATE_LEFT(head, gparent, tmp, field);      \
-                }                                                       \
-        }                                                               \
-        RB_COLOR(head->rbh_root, field) = RB_BLACK;                     \
-}                                                                       \
-                                                                        \
-attr void                                                               \
-name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \
-{                                                                       \
-        struct type *tmp;                                               \
-        while ((elm == NULL || RB_COLOR(elm, field) == RB_BLACK) &&     \
-            elm != RB_ROOT(head)) {                                     \
-                if (RB_LEFT(parent, field) == elm) {                    \
-                        tmp = RB_RIGHT(parent, field);                  \
-                        if (RB_COLOR(tmp, field) == RB_RED) {           \
-                                RB_SET_BLACKRED(tmp, parent, field);    \
-                                RB_ROTATE_LEFT(head, parent, tmp, field);\
-                                tmp = RB_RIGHT(parent, field);          \
-                        }                                               \
-                        if ((RB_LEFT(tmp, field) == NULL ||             \
-                            RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
-                            (RB_RIGHT(tmp, field) == NULL ||            \
-                            RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
-                                RB_COLOR(tmp, field) = RB_RED;          \
-                                elm = parent;                           \
-                                parent = RB_PARENT(elm, field);         \
-                        } else {                                        \
-                                if (RB_RIGHT(tmp, field) == NULL ||     \
-                                    RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK) {\
-                                        struct type *oleft;             \
-                                        if ((oleft = RB_LEFT(tmp, field)) \
-                                            != NULL)                    \
-                                                RB_COLOR(oleft, field) = RB_BLACK;\
-                                        RB_COLOR(tmp, field) = RB_RED;  \
-                                        RB_ROTATE_RIGHT(head, tmp, oleft, field);\
-                                        tmp = RB_RIGHT(parent, field);  \
-                                }                                       \
-                                RB_COLOR(tmp, field) = RB_COLOR(parent, field);\
-                                RB_COLOR(parent, field) = RB_BLACK;     \
-                                if (RB_RIGHT(tmp, field))               \
-                                        RB_COLOR(RB_RIGHT(tmp, field), field) = RB_BLACK;\
-                                RB_ROTATE_LEFT(head, parent, tmp, field);\
-                                elm = RB_ROOT(head);                    \
-                                break;                                  \
-                        }                                               \
-                } else {                                                \
-                        tmp = RB_LEFT(parent, field);                   \
-                        if (RB_COLOR(tmp, field) == RB_RED) {           \
-                                RB_SET_BLACKRED(tmp, parent, field);    \
-                                RB_ROTATE_RIGHT(head, parent, tmp, field);\
-                                tmp = RB_LEFT(parent, field);           \
-                        }                                               \
-                        if ((RB_LEFT(tmp, field) == NULL ||             \
-                            RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
-                            (RB_RIGHT(tmp, field) == NULL ||            \
-                            RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
-                                RB_COLOR(tmp, field) = RB_RED;          \
-                                elm = parent;                           \
-                                parent = RB_PARENT(elm, field);         \
-                        } else {                                        \
-                                if (RB_LEFT(tmp, field) == NULL ||      \
-                                    RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) {\
-                                        struct type *oright;            \
-                                        if ((oright = RB_RIGHT(tmp, field)) \
-                                            != NULL)                    \
-                                                RB_COLOR(oright, field) = RB_BLACK;\
-                                        RB_COLOR(tmp, field) = RB_RED;  \
-                                        RB_ROTATE_LEFT(head, tmp, oright, field);\
-                                        tmp = RB_LEFT(parent, field);   \
-                                }                                       \
-                                RB_COLOR(tmp, field) = RB_COLOR(parent, field);\
-                                RB_COLOR(parent, field) = RB_BLACK;     \
-                                if (RB_LEFT(tmp, field))                \
-                                        RB_COLOR(RB_LEFT(tmp, field), field) = RB_BLACK;\
-                                RB_ROTATE_RIGHT(head, parent, tmp, field);\
-                                elm = RB_ROOT(head);                    \
-                                break;                                  \
-                        }                                               \
-                }                                                       \
-        }                                                               \
-        if (elm)                                                        \
-                RB_COLOR(elm, field) = RB_BLACK;                        \
-}                                                                       \
-                                                                        \
-attr struct type *                                                      \
-name##_RB_REMOVE(struct name *head, struct type *elm)                   \
-{                                                                       \
-        struct type *child, *parent, *old = elm;                        \
-        int color;                                                      \
-        if (RB_LEFT(elm, field) == NULL)                                \
-                child = RB_RIGHT(elm, field);                           \
-        else if (RB_RIGHT(elm, field) == NULL)                          \
-                child = RB_LEFT(elm, field);                            \
-        else {                                                          \
-                struct type *left;                                      \
-                elm = RB_RIGHT(elm, field);                             \
-                while ((left = RB_LEFT(elm, field)) != NULL)            \
-                        elm = left;                                     \
-                child = RB_RIGHT(elm, field);                           \
-                parent = RB_PARENT(elm, field);                         \
-                color = RB_COLOR(elm, field);                           \
-                if (child)                                              \
-                        RB_PARENT(child, field) = parent;               \
-                if (parent) {                                           \
-                        if (RB_LEFT(parent, field) == elm)              \
-                                RB_LEFT(parent, field) = child;         \
-                        else                                            \
-                                RB_RIGHT(parent, field) = child;        \
-                        RB_AUGMENT(parent);                             \
-                } else                                                  \
-                        RB_ROOT(head) = child;                          \
-                if (RB_PARENT(elm, field) == old)                       \
-                        parent = elm;                                   \
-                (elm)->field = (old)->field;                            \
-                if (RB_PARENT(old, field)) {                            \
-                        if (RB_LEFT(RB_PARENT(old, field), field) == old)\
-                                RB_LEFT(RB_PARENT(old, field), field) = elm;\
-                        else                                            \
-                                RB_RIGHT(RB_PARENT(old, field), field) = elm;\
-                        RB_AUGMENT(RB_PARENT(old, field));              \
-                } else                                                  \
-                        RB_ROOT(head) = elm;                            \
-                RB_PARENT(RB_LEFT(old, field), field) = elm;            \
-                if (RB_RIGHT(old, field))                               \
-                        RB_PARENT(RB_RIGHT(old, field), field) = elm;   \
-                if (parent) {                                           \
-                        left = parent;                                  \
-                        do {                                            \
-                                RB_AUGMENT(left);                       \
-                        } while ((left = RB_PARENT(left, field)) != NULL); \
-                }                                                       \
-                goto color;                                             \
-        }                                                               \
-        parent = RB_PARENT(elm, field);                                 \
-        color = RB_COLOR(elm, field);                                   \
-        if (child)                                                      \
-                RB_PARENT(child, field) = parent;                       \
-        if (parent) {                                                   \
-                if (RB_LEFT(parent, field) == elm)                      \
-                        RB_LEFT(parent, field) = child;                 \
-                else                                                    \
-                        RB_RIGHT(parent, field) = child;                \
-                RB_AUGMENT(parent);                                     \
-        } else                                                          \
-                RB_ROOT(head) = child;                                  \
-color:                                                                  \
-        if (color == RB_BLACK)                                          \
-                name##_RB_REMOVE_COLOR(head, parent, child);            \
-        return (old);                                                   \
-}                                                                       \
-                                                                        \
-/* Inserts a node into the RB tree */                                   \
-attr struct type *                                                      \
-name##_RB_INSERT(struct name *head, struct type *elm)                   \
-{                                                                       \
-        struct type *tmp;                                               \
-        struct type *parent = NULL;                                     \
-        int comp = 0;                                                   \
-        tmp = RB_ROOT(head);                                            \
-        while (tmp) {                                                   \
-                parent = tmp;                                           \
-                comp = (cmp)(elm, parent);                              \
-                if (comp < 0)                                           \
-                        tmp = RB_LEFT(tmp, field);                      \
-                else if (comp > 0)                                      \
-                        tmp = RB_RIGHT(tmp, field);                     \
-                else                                                    \
-                        return (tmp);                                   \
-        }                                                               \
-        RB_SET(elm, parent, field);                                     \
-        if (parent != NULL) {                                           \
-                if (comp < 0)                                           \
-                        RB_LEFT(parent, field) = elm;                   \
-                else                                                    \
-                        RB_RIGHT(parent, field) = elm;                  \
-                RB_AUGMENT(parent);                                     \
-        } else                                                          \
-                RB_ROOT(head) = elm;                                    \
-        name##_RB_INSERT_COLOR(head, elm);                              \
-        return (NULL);                                                  \
-}                                                                       \
-                                                                        \
-/* Finds the node with the same key as elm */                           \
-attr struct type *                                                      \
-name##_RB_FIND(struct name *head, struct type *elm)                     \
-{                                                                       \
-        struct type *tmp = RB_ROOT(head);                               \
-        int comp;                                                       \
-        while (tmp) {                                                   \
-                comp = cmp(elm, tmp);                                   \
-                if (comp < 0)                                           \
-                        tmp = RB_LEFT(tmp, field);                      \
-                else if (comp > 0)                                      \
-                        tmp = RB_RIGHT(tmp, field);                     \
-                else                                                    \
-                        return (tmp);                                   \
-        }                                                               \
-        return (NULL);                                                  \
-}                                                                       \
-                                                                        \
-/* Finds the first node greater than or equal to the search key */      \
-attr struct type *                                                      \
-name##_RB_NFIND(struct name *head, struct type *elm)                    \
-{                                                                       \
-        struct type *tmp = RB_ROOT(head);                               \
-        struct type *res = NULL;                                        \
-        int comp;                                                       \
-        while (tmp) {                                                   \
-                comp = cmp(elm, tmp);                                   \
-                if (comp < 0) {                                         \
-                        res = tmp;                                      \
-                        tmp = RB_LEFT(tmp, field);                      \
-                }                                                       \
-                else if (comp > 0)                                      \
-                        tmp = RB_RIGHT(tmp, field);                     \
-                else                                                    \
-                        return (tmp);                                   \
-        }                                                               \
-        return (res);                                                   \
-}                                                                       \
-                                                                        \
-/* ARGSUSED */                                                          \
-attr struct type *                                                      \
-name##_RB_NEXT(struct type *elm)                                        \
-{                                                                       \
-        if (RB_RIGHT(elm, field)) {                                     \
-                elm = RB_RIGHT(elm, field);                             \
-                while (RB_LEFT(elm, field))                             \
-                        elm = RB_LEFT(elm, field);                      \
-        } else {                                                        \
-                if (RB_PARENT(elm, field) &&                            \
-                    (elm == RB_LEFT(RB_PARENT(elm, field), field)))     \
-                        elm = RB_PARENT(elm, field);                    \
-                else {                                                  \
-                        while (RB_PARENT(elm, field) &&                 \
-                            (elm == RB_RIGHT(RB_PARENT(elm, field), field)))\
-                                elm = RB_PARENT(elm, field);            \
-                        elm = RB_PARENT(elm, field);                    \
-                }                                                       \
-        }                                                               \
-        return (elm);                                                   \
-}                                                                       \
-                                                                        \
-/* ARGSUSED */                                                          \
-attr struct type *                                                      \
-name##_RB_PREV(struct type *elm)                                        \
-{                                                                       \
-        if (RB_LEFT(elm, field)) {                                      \
-                elm = RB_LEFT(elm, field);                              \
-                while (RB_RIGHT(elm, field))                            \
-                        elm = RB_RIGHT(elm, field);                     \
-        } else {                                                        \
-                if (RB_PARENT(elm, field) &&                            \
-                    (elm == RB_RIGHT(RB_PARENT(elm, field), field)))    \
-                        elm = RB_PARENT(elm, field);                    \
-                else {                                                  \
-                        while (RB_PARENT(elm, field) &&                 \
-                            (elm == RB_LEFT(RB_PARENT(elm, field), field)))\
-                                elm = RB_PARENT(elm, field);            \
-                        elm = RB_PARENT(elm, field);                    \
-                }                                                       \
-        }                                                               \
-        return (elm);                                                   \
-}                                                                       \
-                                                                        \
-attr struct type *                                                      \
-name##_RB_MINMAX(struct name *head, int val)                            \
-{                                                                       \
-        struct type *tmp = RB_ROOT(head);                               \
-        struct type *parent = NULL;                                     \
-        while (tmp) {                                                   \
-                parent = tmp;                                           \
-                if (val < 0)                                            \
-                        tmp = RB_LEFT(tmp, field);                      \
-                else                                                    \
-                        tmp = RB_RIGHT(tmp, field);                     \
-        }                                                               \
-        return (parent);                                                \
-}
-
-#define RB_NEGINF       -1
-#define RB_INF  1
-
-#define RB_INSERT(name, x, y)   name##_RB_INSERT(x, y)
-#define RB_REMOVE(name, x, y)   name##_RB_REMOVE(x, y)
-#define RB_FIND(name, x, y)     name##_RB_FIND(x, y)
-#define RB_NFIND(name, x, y)    name##_RB_NFIND(x, y)
-#define RB_NEXT(name, x, y)     name##_RB_NEXT(y)
-#define RB_PREV(name, x, y)     name##_RB_PREV(y)
-#define RB_MIN(name, x)         name##_RB_MINMAX(x, RB_NEGINF)
-#define RB_MAX(name, x)         name##_RB_MINMAX(x, RB_INF)
-
-#define RB_FOREACH(x, name, head)                                       \
-        for ((x) = RB_MIN(name, head);                                  \
-             (x) != NULL;                                               \
-             (x) = name##_RB_NEXT(x))
-
-#define RB_FOREACH_FROM(x, name, y)                                     \
-        for ((x) = (y);                                                 \
-            ((x) != NULL) && ((y) = name##_RB_NEXT(x), (x) != NULL);    \
-             (x) = (y))
-
-#define RB_FOREACH_SAFE(x, name, head, y)                               \
-        for ((x) = RB_MIN(name, head);                                  \
-            ((x) != NULL) && ((y) = name##_RB_NEXT(x), (x) != NULL);    \
-             (x) = (y))
-
-#define RB_FOREACH_REVERSE(x, name, head)                               \
-        for ((x) = RB_MAX(name, head);                                  \
-             (x) != NULL;                                               \
-             (x) = name##_RB_PREV(x))
-
-#define RB_FOREACH_REVERSE_FROM(x, name, y)                             \
-        for ((x) = (y);                                                 \
-            ((x) != NULL) && ((y) = name##_RB_PREV(x), (x) != NULL);    \
-             (x) = (y))
-
-#define RB_FOREACH_REVERSE_SAFE(x, name, head, y)                       \
-        for ((x) = RB_MAX(name, head);                                  \
-            ((x) != NULL) && ((y) = name##_RB_PREV(x), (x) != NULL);    \
-             (x) = (y))
-
-#endif
diff --git a/app/src/main/cpp/shadowhook/third_party/lss/LICENSE b/app/src/main/cpp/shadowhook/third_party/lss/LICENSE
deleted file mode 100644
index 58ab3fb..0000000
--- a/app/src/main/cpp/shadowhook/third_party/lss/LICENSE
+++ /dev/null
@@ -1,28 +0,0 @@
-Copyright (c) 2005-2011, Google Inc.
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are
-met:
-
-   Redistributions of source code must retain the above copyright
-notice, this list of conditions and the following disclaimer.
-   Redistributions in binary form must reproduce the above
-copyright notice, this list of conditions and the following disclaimer
-in the documentation and/or other materials provided with the
-distribution.
-   Neither the name of Google Inc. nor the names of its
-contributors may be used to endorse or promote products derived from
-this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/app/src/main/cpp/shadowhook/third_party/lss/linux_syscall_support.h b/app/src/main/cpp/shadowhook/third_party/lss/linux_syscall_support.h
deleted file mode 100644
index d3791cd..0000000
--- a/app/src/main/cpp/shadowhook/third_party/lss/linux_syscall_support.h
+++ /dev/null
@@ -1,4867 +0,0 @@
-/* Copyright (c) 2005-2011, Google Inc.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *     * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *     * Redistributions in binary form must reproduce the above
- * copyright notice, this list of conditions and the following disclaimer
- * in the documentation and/or other materials provided with the
- * distribution.
- *     * Neither the name of Google Inc. nor the names of its
- * contributors may be used to endorse or promote products derived from
- * this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * ---
- * Author: Markus Gutschke
- */
-
-/* This file includes Linux-specific support functions common to the
- * coredumper and the thread lister; primarily, this is a collection
- * of direct system calls, and a couple of symbols missing from
- * standard header files.
- * There are a few options that the including file can set to control
- * the behavior of this file:
- *
- * SYS_CPLUSPLUS:
- *   The entire header file will normally be wrapped in 'extern "C" { }",
- *   making it suitable for compilation as both C and C++ source. If you
- *   do not want to do this, you can set the SYS_CPLUSPLUS macro to inhibit
- *   the wrapping. N.B. doing so will suppress inclusion of all prerequisite
- *   system header files, too. It is the caller's responsibility to provide
- *   the necessary definitions.
- *
- * SYS_ERRNO:
- *   All system calls will update "errno" unless overriden by setting the
- *   SYS_ERRNO macro prior to including this file. SYS_ERRNO should be
- *   an l-value.
- *
- * SYS_INLINE:
- *   New symbols will be defined "static inline", unless overridden by
- *   the SYS_INLINE macro.
- *
- * SYS_LINUX_SYSCALL_SUPPORT_H
- *   This macro is used to avoid multiple inclusions of this header file.
- *   If you need to include this file more than once, make sure to
- *   unset SYS_LINUX_SYSCALL_SUPPORT_H before each inclusion.
- *
- * SYS_PREFIX:
- *   New system calls will have a prefix of "sys_" unless overridden by
- *   the SYS_PREFIX macro. Valid values for this macro are [0..9] which
- *   results in prefixes "sys[0..9]_". It is also possible to set this
- *   macro to -1, which avoids all prefixes.
- *
- * SYS_SYSCALL_ENTRYPOINT:
- *   Some applications (such as sandboxes that filter system calls), need
- *   to be able to run custom-code each time a system call is made. If this
- *   macro is defined, it expands to the name of a "common" symbol. If
- *   this symbol is assigned a non-NULL pointer value, it is used as the
- *   address of the system call entrypoint.
- *   A pointer to this symbol can be obtained by calling
- *   get_syscall_entrypoint()
- *
- * This file defines a few internal symbols that all start with "LSS_".
- * Do not access these symbols from outside this file. They are not part
- * of the supported API.
- */
-#ifndef SYS_LINUX_SYSCALL_SUPPORT_H
-#define SYS_LINUX_SYSCALL_SUPPORT_H
-
-/* We currently only support x86-32, x86-64, ARM, MIPS, PPC, s390 and s390x
- * on Linux.
- * Porting to other related platforms should not be difficult.
- */
-#if (defined(__i386__) || defined(__x86_64__) || defined(__ARM_ARCH_3__) ||   \
-     defined(__mips__) || defined(__PPC__) || defined(__ARM_EABI__) || \
-     defined(__aarch64__) || defined(__s390__) || defined(__e2k__))  \
-  && (defined(__linux) || defined(__ANDROID__))
-
-#ifndef SYS_CPLUSPLUS
-#ifdef __cplusplus
-/* Some system header files in older versions of gcc neglect to properly
- * handle being included from C++. As it appears to be harmless to have
- * multiple nested 'extern "C"' blocks, just add another one here.
- */
-extern "C" {
-#endif
-
-#include <errno.h>
-#include <fcntl.h>
-#include <sched.h>
-#include <signal.h>
-#include <stdarg.h>
-#include <stddef.h>
-#include <stdint.h>
-#include <string.h>
-#include <sys/ptrace.h>
-#include <sys/resource.h>
-#include <sys/time.h>
-#include <sys/types.h>
-#include <sys/syscall.h>
-#include <unistd.h>
-#include <linux/unistd.h>
-#include <endian.h>
-
-#ifdef __mips__
-/* Include definitions of the ABI currently in use.                          */
-#ifdef __ANDROID__
-/* Android doesn't have sgidefs.h, but does have asm/sgidefs.h,
- * which has the definitions we need.
- */
-#include <asm/sgidefs.h>
-#else
-#include <sgidefs.h>
-#endif
-#endif
-#endif
-
-/* Some libcs, for example Android NDK and musl, #define these
- * macros as aliases to their non-64 counterparts. To avoid naming
- * conflict, remove them.
- *
- * These are restored by the corresponding #pragma pop_macro near
- * the end of this file.
- */
-#pragma push_macro("stat64")
-#pragma push_macro("fstat64")
-#pragma push_macro("lstat64")
-#pragma push_macro("pread64")
-#pragma push_macro("pwrite64")
-#pragma push_macro("getdents64")
-#undef stat64
-#undef fstat64
-#undef lstat64
-#undef pread64
-#undef pwrite64
-#undef getdents64
-
-#if defined(__ANDROID__) && defined(__x86_64__)
-// A number of x86_64 syscalls are blocked by seccomp on recent Android;
-// undefine them so that modern alternatives will be used instead where
-// possible.
-// The alternative syscalls have been sanity checked against linux-3.4+;
-// older versions might not work.
-# undef __NR_getdents
-# undef __NR_dup2
-# undef __NR_fork
-# undef __NR_getpgrp
-# undef __NR_open
-# undef __NR_poll
-# undef __NR_readlink
-# undef __NR_stat
-# undef __NR_unlink
-# undef __NR_pipe
-#endif
-
-#if defined(__ANDROID__)
-// waitpid is blocked by seccomp on all architectures on recent Android.
-# undef __NR_waitpid
-#endif
-
-/* As glibc often provides subtly incompatible data structures (and implicit
- * wrapper functions that convert them), we provide our own kernel data
- * structures for use by the system calls.
- * These structures have been developed by using Linux 2.6.23 headers for
- * reference. Note though, we do not care about exact API compatibility
- * with the kernel, and in fact the kernel often does not have a single
- * API that works across architectures. Instead, we try to mimic the glibc
- * API where reasonable, and only guarantee ABI compatibility with the
- * kernel headers.
- * Most notably, here are a few changes that were made to the structures
- * defined by kernel headers:
- *
- * - we only define structures, but not symbolic names for kernel data
- *   types. For the latter, we directly use the native C datatype
- *   (i.e. "unsigned" instead of "mode_t").
- * - in a few cases, it is possible to define identical structures for
- *   both 32bit (e.g. i386) and 64bit (e.g. x86-64) platforms by
- *   standardizing on the 64bit version of the data types. In particular,
- *   this means that we use "unsigned" where the 32bit headers say
- *   "unsigned long".
- * - overall, we try to minimize the number of cases where we need to
- *   conditionally define different structures.
- * - the "struct kernel_sigaction" class of structures have been
- *   modified to more closely mimic glibc's API by introducing an
- *   anonymous union for the function pointer.
- * - a small number of field names had to have an underscore appended to
- *   them, because glibc defines a global macro by the same name.
- */
-
-/* include/linux/dirent.h                                                    */
-struct kernel_dirent64 {
-  unsigned long long d_ino;
-  long long          d_off;
-  unsigned short     d_reclen;
-  unsigned char      d_type;
-  char               d_name[256];
-};
-
-/* include/linux/dirent.h                                                    */
-#if !defined(__NR_getdents)
-// when getdents is not available, getdents64 is used for both.
-#define kernel_dirent kernel_dirent64
-#else
-struct kernel_dirent {
-  long               d_ino;
-  long               d_off;
-  unsigned short     d_reclen;
-  char               d_name[256];
-};
-#endif
-
-/* include/linux/uio.h                                                       */
-struct kernel_iovec {
-  void               *iov_base;
-  unsigned long      iov_len;
-};
-
-/* include/linux/socket.h                                                    */
-struct kernel_msghdr {
-  void               *msg_name;
-  int                msg_namelen;
-  struct kernel_iovec*msg_iov;
-  unsigned long      msg_iovlen;
-  void               *msg_control;
-  unsigned long      msg_controllen;
-  unsigned           msg_flags;
-};
-
-/* include/asm-generic/poll.h                                                */
-struct kernel_pollfd {
-  int                fd;
-  short              events;
-  short              revents;
-};
-
-/* include/linux/resource.h                                                  */
-struct kernel_rlimit {
-  unsigned long      rlim_cur;
-  unsigned long      rlim_max;
-};
-
-/* include/linux/time.h                                                      */
-struct kernel_timespec {
-  long               tv_sec;
-  long               tv_nsec;
-};
-
-/* include/linux/time.h                                                      */
-struct kernel_timeval {
-  long               tv_sec;
-  long               tv_usec;
-};
-
-/* include/linux/resource.h                                                  */
-struct kernel_rusage {
-  struct kernel_timeval ru_utime;
-  struct kernel_timeval ru_stime;
-  long               ru_maxrss;
-  long               ru_ixrss;
-  long               ru_idrss;
-  long               ru_isrss;
-  long               ru_minflt;
-  long               ru_majflt;
-  long               ru_nswap;
-  long               ru_inblock;
-  long               ru_oublock;
-  long               ru_msgsnd;
-  long               ru_msgrcv;
-  long               ru_nsignals;
-  long               ru_nvcsw;
-  long               ru_nivcsw;
-};
-
-#if defined(__i386__) || defined(__ARM_EABI__) || defined(__ARM_ARCH_3__) \
-  || defined(__PPC__) || (defined(__s390__) && !defined(__s390x__)) \
-  || defined(__e2k__)
-
-/* include/asm-{arm,i386,mips,ppc}/signal.h                                  */
-struct kernel_old_sigaction {
-  union {
-    void             (*sa_handler_)(int);
-    void             (*sa_sigaction_)(int, siginfo_t *, void *);
-  };
-  unsigned long      sa_mask;
-  unsigned long      sa_flags;
-  void               (*sa_restorer)(void);
-} __attribute__((packed,aligned(4)));
-#elif (defined(__mips__) && _MIPS_SIM == _MIPS_SIM_ABI32)
-  #define kernel_old_sigaction kernel_sigaction
-#elif defined(__aarch64__)
-  // No kernel_old_sigaction defined for arm64.
-#endif
-
-/* Some kernel functions (e.g. sigaction() in 2.6.23) require that the
- * exactly match the size of the signal set, even though the API was
- * intended to be extensible. We define our own KERNEL_NSIG to deal with
- * this.
- * Please note that glibc provides signals [1.._NSIG-1], whereas the
- * kernel (and this header) provides the range [1..KERNEL_NSIG]. The
- * actual number of signals is obviously the same, but the constants
- * differ by one.
- */
-#ifdef __mips__
-#define KERNEL_NSIG 128
-#else
-#define KERNEL_NSIG  64
-#endif
-
-/* include/asm-{arm,aarch64,i386,mips,x86_64}/signal.h                       */
-struct kernel_sigset_t {
-  unsigned long sig[(KERNEL_NSIG + 8*sizeof(unsigned long) - 1)/
-                    (8*sizeof(unsigned long))];
-};
-
-/* include/asm-{arm,i386,mips,x86_64,ppc}/signal.h                           */
-struct kernel_sigaction {
-#ifdef __mips__
-  unsigned long      sa_flags;
-  union {
-    void             (*sa_handler_)(int);
-    void             (*sa_sigaction_)(int, siginfo_t *, void *);
-  };
-  struct kernel_sigset_t sa_mask;
-#else
-  union {
-    void             (*sa_handler_)(int);
-    void             (*sa_sigaction_)(int, siginfo_t *, void *);
-  };
-  unsigned long      sa_flags;
-  void               (*sa_restorer)(void);
-  struct kernel_sigset_t sa_mask;
-#endif
-};
-
-/* include/linux/socket.h                                                    */
-struct kernel_sockaddr {
-  unsigned short     sa_family;
-  char               sa_data[14];
-};
-
-/* include/asm-{arm,aarch64,i386,mips,ppc,s390}/stat.h                       */
-#ifdef __mips__
-#if _MIPS_SIM == _MIPS_SIM_ABI64
-struct kernel_stat {
-#else
-struct kernel_stat64 {
-#endif
-  unsigned           st_dev;
-  unsigned           __pad0[3];
-  unsigned long long st_ino;
-  unsigned           st_mode;
-  unsigned           st_nlink;
-  unsigned           st_uid;
-  unsigned           st_gid;
-  unsigned           st_rdev;
-  unsigned           __pad1[3];
-  long long          st_size;
-  unsigned           st_atime_;
-  unsigned           st_atime_nsec_;
-  unsigned           st_mtime_;
-  unsigned           st_mtime_nsec_;
-  unsigned           st_ctime_;
-  unsigned           st_ctime_nsec_;
-  unsigned           st_blksize;
-  unsigned           __pad2;
-  unsigned long long st_blocks;
-};
-#elif defined __PPC__
-struct kernel_stat64 {
-  unsigned long long st_dev;
-  unsigned long long st_ino;
-  unsigned           st_mode;
-  unsigned           st_nlink;
-  unsigned           st_uid;
-  unsigned           st_gid;
-  unsigned long long st_rdev;
-  unsigned short int __pad2;
-  long long          st_size;
-  long               st_blksize;
-  long long          st_blocks;
-  long               st_atime_;
-  unsigned long      st_atime_nsec_;
-  long               st_mtime_;
-  unsigned long      st_mtime_nsec_;
-  long               st_ctime_;
-  unsigned long      st_ctime_nsec_;
-  unsigned long      __unused4;
-  unsigned long      __unused5;
-};
-#elif defined(__e2k__)
-struct kernel_stat64 {
-  unsigned long long st_dev;
-  unsigned long long st_ino;
-  unsigned int       st_mode;
-  unsigned int       st_nlink;
-  unsigned int       st_uid;
-  unsigned int       st_gid;
-  unsigned long long st_rdev;
-  long long          st_size;
-  int                st_blksize;
-  int                __pad2;
-  unsigned long long st_blocks;
-  int                st_atime_;
-  unsigned int       st_atime_nsec_;
-  int                st_mtime_;
-  unsigned int       st_mtime_nsec_;
-  int                st_ctime_;
-  unsigned int       st_ctime_nsec_;
-  unsigned int       __unused4;
-  unsigned int       __unused5;
-};
-#else
-struct kernel_stat64 {
-  unsigned long long st_dev;
-  unsigned char      __pad0[4];
-  unsigned           __st_ino;
-  unsigned           st_mode;
-  unsigned           st_nlink;
-  unsigned           st_uid;
-  unsigned           st_gid;
-  unsigned long long st_rdev;
-  unsigned char      __pad3[4];
-  long long          st_size;
-  unsigned           st_blksize;
-  unsigned long long st_blocks;
-  unsigned           st_atime_;
-  unsigned           st_atime_nsec_;
-  unsigned           st_mtime_;
-  unsigned           st_mtime_nsec_;
-  unsigned           st_ctime_;
-  unsigned           st_ctime_nsec_;
-  unsigned long long st_ino;
-};
-#endif
-
-/* include/asm-{arm,aarch64,i386,mips,x86_64,ppc,s390}/stat.h                */
-#if defined(__i386__) || defined(__ARM_ARCH_3__) || defined(__ARM_EABI__)
-struct kernel_stat {
-  /* The kernel headers suggest that st_dev and st_rdev should be 32bit
-   * quantities encoding 12bit major and 20bit minor numbers in an interleaved
-   * format. In reality, we do not see useful data in the top bits. So,
-   * we'll leave the padding in here, until we find a better solution.
-   */
-  unsigned short     st_dev;
-  short              pad1;
-  unsigned           st_ino;
-  unsigned short     st_mode;
-  unsigned short     st_nlink;
-  unsigned short     st_uid;
-  unsigned short     st_gid;
-  unsigned short     st_rdev;
-  short              pad2;
-  unsigned           st_size;
-  unsigned           st_blksize;
-  unsigned           st_blocks;
-  unsigned           st_atime_;
-  unsigned           st_atime_nsec_;
-  unsigned           st_mtime_;
-  unsigned           st_mtime_nsec_;
-  unsigned           st_ctime_;
-  unsigned           st_ctime_nsec_;
-  unsigned           __unused4;
-  unsigned           __unused5;
-};
-#elif defined(__x86_64__)
-struct kernel_stat {
-  uint64_t           st_dev;
-  uint64_t           st_ino;
-  uint64_t           st_nlink;
-  unsigned           st_mode;
-  unsigned           st_uid;
-  unsigned           st_gid;
-  unsigned           __pad0;
-  uint64_t           st_rdev;
-  int64_t            st_size;
-  int64_t            st_blksize;
-  int64_t            st_blocks;
-  uint64_t           st_atime_;
-  uint64_t           st_atime_nsec_;
-  uint64_t           st_mtime_;
-  uint64_t           st_mtime_nsec_;
-  uint64_t           st_ctime_;
-  uint64_t           st_ctime_nsec_;
-  int64_t            __unused4[3];
-};
-#elif defined(__PPC__)
-struct kernel_stat {
-  unsigned           st_dev;
-  unsigned long      st_ino;      // ino_t
-  unsigned long      st_mode;     // mode_t
-  unsigned short     st_nlink;    // nlink_t
-  unsigned           st_uid;      // uid_t
-  unsigned           st_gid;      // gid_t
-  unsigned           st_rdev;
-  long               st_size;     // off_t
-  unsigned long      st_blksize;
-  unsigned long      st_blocks;
-  unsigned long      st_atime_;
-  unsigned long      st_atime_nsec_;
-  unsigned long      st_mtime_;
-  unsigned long      st_mtime_nsec_;
-  unsigned long      st_ctime_;
-  unsigned long      st_ctime_nsec_;
-  unsigned long      __unused4;
-  unsigned long      __unused5;
-};
-#elif (defined(__mips__) && _MIPS_SIM != _MIPS_SIM_ABI64)
-struct kernel_stat {
-  unsigned           st_dev;
-  int                st_pad1[3];
-  unsigned           st_ino;
-  unsigned           st_mode;
-  unsigned           st_nlink;
-  unsigned           st_uid;
-  unsigned           st_gid;
-  unsigned           st_rdev;
-  int                st_pad2[2];
-  long               st_size;
-  int                st_pad3;
-  long               st_atime_;
-  long               st_atime_nsec_;
-  long               st_mtime_;
-  long               st_mtime_nsec_;
-  long               st_ctime_;
-  long               st_ctime_nsec_;
-  int                st_blksize;
-  int                st_blocks;
-  int                st_pad4[14];
-};
-#elif defined(__aarch64__)
-struct kernel_stat {
-  unsigned long      st_dev;
-  unsigned long      st_ino;
-  unsigned int       st_mode;
-  unsigned int       st_nlink;
-  unsigned int       st_uid;
-  unsigned int       st_gid;
-  unsigned long      st_rdev;
-  unsigned long      __pad1;
-  long               st_size;
-  int                st_blksize;
-  int                __pad2;
-  long               st_blocks;
-  long               st_atime_;
-  unsigned long      st_atime_nsec_;
-  long               st_mtime_;
-  unsigned long      st_mtime_nsec_;
-  long               st_ctime_;
-  unsigned long      st_ctime_nsec_;
-  unsigned int       __unused4;
-  unsigned int       __unused5;
-};
-#elif defined(__s390x__)
-struct kernel_stat {
-  unsigned long      st_dev;
-  unsigned long      st_ino;
-  unsigned long      st_nlink;
-  unsigned int       st_mode;
-  unsigned int       st_uid;
-  unsigned int       st_gid;
-  unsigned int       __pad1;
-  unsigned long      st_rdev;
-  unsigned long      st_size;
-  unsigned long      st_atime_;
-  unsigned long      st_atime_nsec_;
-  unsigned long      st_mtime_;
-  unsigned long      st_mtime_nsec_;
-  unsigned long      st_ctime_;
-  unsigned long      st_ctime_nsec_;
-  unsigned long      st_blksize;
-  long               st_blocks;
-  unsigned long      __unused[3];
-};
-#elif defined(__s390__)
-struct kernel_stat {
-  unsigned short     st_dev;
-  unsigned short     __pad1;
-  unsigned long      st_ino;
-  unsigned short     st_mode;
-  unsigned short     st_nlink;
-  unsigned short     st_uid;
-  unsigned short     st_gid;
-  unsigned short     st_rdev;
-  unsigned short     __pad2;
-  unsigned long      st_size;
-  unsigned long      st_blksize;
-  unsigned long      st_blocks;
-  unsigned long      st_atime_;
-  unsigned long      st_atime_nsec_;
-  unsigned long      st_mtime_;
-  unsigned long      st_mtime_nsec_;
-  unsigned long      st_ctime_;
-  unsigned long      st_ctime_nsec_;
-  unsigned long      __unused4;
-  unsigned long      __unused5;
-};
-#elif defined(__e2k__)
-struct kernel_stat {
-  unsigned long      st_dev;
-  unsigned long      st_ino;
-  unsigned int       st_mode;
-  unsigned long      st_nlink;
-  unsigned int       st_uid;
-  unsigned int       st_gid;
-  unsigned long      st_rdev;
-  unsigned long      st_size;
-  unsigned long      st_blksize;
-  unsigned long      st_blocks;
-  unsigned long      st_atime_;
-  unsigned long      st_atime_nsec_;
-  unsigned long      st_mtime_;
-  unsigned long      st_mtime_nsec_;
-  unsigned long      st_ctime_;
-  unsigned long      st_ctime_nsec_;
-};
-#endif
-
-/* include/asm-{arm,aarch64,i386,mips,x86_64,ppc,s390}/statfs.h              */
-#ifdef __mips__
-#if _MIPS_SIM != _MIPS_SIM_ABI64
-struct kernel_statfs64 {
-  unsigned long      f_type;
-  unsigned long      f_bsize;
-  unsigned long      f_frsize;
-  unsigned long      __pad;
-  unsigned long long f_blocks;
-  unsigned long long f_bfree;
-  unsigned long long f_files;
-  unsigned long long f_ffree;
-  unsigned long long f_bavail;
-  struct { int val[2]; } f_fsid;
-  unsigned long      f_namelen;
-  unsigned long      f_spare[6];
-};
-#endif
-#elif defined(__s390__)
-/* See also arch/s390/include/asm/compat.h                                   */
-struct kernel_statfs64 {
-  unsigned int       f_type;
-  unsigned int       f_bsize;
-  unsigned long long f_blocks;
-  unsigned long long f_bfree;
-  unsigned long long f_bavail;
-  unsigned long long f_files;
-  unsigned long long f_ffree;
-  struct { int val[2]; } f_fsid;
-  unsigned int       f_namelen;
-  unsigned int       f_frsize;
-  unsigned int       f_flags;
-  unsigned int       f_spare[4];
-};
-#elif !defined(__x86_64__)
-struct kernel_statfs64 {
-  unsigned long      f_type;
-  unsigned long      f_bsize;
-  unsigned long long f_blocks;
-  unsigned long long f_bfree;
-  unsigned long long f_bavail;
-  unsigned long long f_files;
-  unsigned long long f_ffree;
-  struct { int val[2]; } f_fsid;
-  unsigned long      f_namelen;
-  unsigned long      f_frsize;
-  unsigned long      f_spare[5];
-};
-#endif
-
-/* include/asm-{arm,i386,mips,x86_64,ppc,generic,s390}/statfs.h              */
-#ifdef __mips__
-struct kernel_statfs {
-  long               f_type;
-  long               f_bsize;
-  long               f_frsize;
-  long               f_blocks;
-  long               f_bfree;
-  long               f_files;
-  long               f_ffree;
-  long               f_bavail;
-  struct { int val[2]; } f_fsid;
-  long               f_namelen;
-  long               f_spare[6];
-};
-#elif defined(__x86_64__)
-struct kernel_statfs {
-  /* x86_64 actually defines all these fields as signed, whereas all other  */
-  /* platforms define them as unsigned. Leaving them at unsigned should not */
-  /* cause any problems. Make sure these are 64-bit even on x32.            */
-  uint64_t           f_type;
-  uint64_t           f_bsize;
-  uint64_t           f_blocks;
-  uint64_t           f_bfree;
-  uint64_t           f_bavail;
-  uint64_t           f_files;
-  uint64_t           f_ffree;
-  struct { int val[2]; } f_fsid;
-  uint64_t           f_namelen;
-  uint64_t           f_frsize;
-  uint64_t           f_spare[5];
-};
-#elif defined(__s390__)
-struct kernel_statfs {
-  unsigned int       f_type;
-  unsigned int       f_bsize;
-  unsigned long      f_blocks;
-  unsigned long      f_bfree;
-  unsigned long      f_bavail;
-  unsigned long      f_files;
-  unsigned long      f_ffree;
-  struct { int val[2]; } f_fsid;
-  unsigned int       f_namelen;
-  unsigned int       f_frsize;
-  unsigned int       f_flags;
-  unsigned int       f_spare[4];
-};
-#else
-struct kernel_statfs {
-  unsigned long      f_type;
-  unsigned long      f_bsize;
-  unsigned long      f_blocks;
-  unsigned long      f_bfree;
-  unsigned long      f_bavail;
-  unsigned long      f_files;
-  unsigned long      f_ffree;
-  struct { int val[2]; } f_fsid;
-  unsigned long      f_namelen;
-  unsigned long      f_frsize;
-  unsigned long      f_spare[5];
-};
-#endif
-
-
-/* Definitions missing from the standard header files                        */
-#ifndef O_DIRECTORY
-#if defined(__ARM_ARCH_3__) || defined(__ARM_EABI__) || defined(__aarch64__)
-#define O_DIRECTORY             0040000
-#else
-#define O_DIRECTORY             0200000
-#endif
-#endif
-#ifndef NT_PRXFPREG
-#define NT_PRXFPREG             0x46e62b7f
-#endif
-#ifndef PTRACE_GETFPXREGS
-#define PTRACE_GETFPXREGS       ((enum __ptrace_request)18)
-#endif
-#ifndef PR_GET_DUMPABLE
-#define PR_GET_DUMPABLE         3
-#endif
-#ifndef PR_SET_DUMPABLE
-#define PR_SET_DUMPABLE         4
-#endif
-#ifndef PR_GET_SECCOMP
-#define PR_GET_SECCOMP          21
-#endif
-#ifndef PR_SET_SECCOMP
-#define PR_SET_SECCOMP          22
-#endif
-#ifndef AT_FDCWD
-#define AT_FDCWD                (-100)
-#endif
-#ifndef AT_SYMLINK_NOFOLLOW
-#define AT_SYMLINK_NOFOLLOW     0x100
-#endif
-#ifndef AT_REMOVEDIR
-#define AT_REMOVEDIR            0x200
-#endif
-#ifndef MREMAP_FIXED
-#define MREMAP_FIXED            2
-#endif
-#ifndef SA_RESTORER
-#define SA_RESTORER             0x04000000
-#endif
-#ifndef CPUCLOCK_PROF
-#define CPUCLOCK_PROF           0
-#endif
-#ifndef CPUCLOCK_VIRT
-#define CPUCLOCK_VIRT           1
-#endif
-#ifndef CPUCLOCK_SCHED
-#define CPUCLOCK_SCHED          2
-#endif
-#ifndef CPUCLOCK_PERTHREAD_MASK
-#define CPUCLOCK_PERTHREAD_MASK 4
-#endif
-#ifndef MAKE_PROCESS_CPUCLOCK
-#define MAKE_PROCESS_CPUCLOCK(pid, clock)                                     \
-        ((int)(~(unsigned)(pid) << 3) | (int)(clock))
-#endif
-#ifndef MAKE_THREAD_CPUCLOCK
-#define MAKE_THREAD_CPUCLOCK(tid, clock)                                      \
-        ((int)(~(unsigned)(tid) << 3) |                                       \
-         (int)((clock) | CPUCLOCK_PERTHREAD_MASK))
-#endif
-
-#ifndef FUTEX_WAIT
-#define FUTEX_WAIT                0
-#endif
-#ifndef FUTEX_WAKE
-#define FUTEX_WAKE                1
-#endif
-#ifndef FUTEX_FD
-#define FUTEX_FD                  2
-#endif
-#ifndef FUTEX_REQUEUE
-#define FUTEX_REQUEUE             3
-#endif
-#ifndef FUTEX_CMP_REQUEUE
-#define FUTEX_CMP_REQUEUE         4
-#endif
-#ifndef FUTEX_WAKE_OP
-#define FUTEX_WAKE_OP             5
-#endif
-#ifndef FUTEX_LOCK_PI
-#define FUTEX_LOCK_PI             6
-#endif
-#ifndef FUTEX_UNLOCK_PI
-#define FUTEX_UNLOCK_PI           7
-#endif
-#ifndef FUTEX_TRYLOCK_PI
-#define FUTEX_TRYLOCK_PI          8
-#endif
-#ifndef FUTEX_PRIVATE_FLAG
-#define FUTEX_PRIVATE_FLAG        128
-#endif
-#ifndef FUTEX_CMD_MASK
-#define FUTEX_CMD_MASK            ~FUTEX_PRIVATE_FLAG
-#endif
-#ifndef FUTEX_WAIT_PRIVATE
-#define FUTEX_WAIT_PRIVATE        (FUTEX_WAIT | FUTEX_PRIVATE_FLAG)
-#endif
-#ifndef FUTEX_WAKE_PRIVATE
-#define FUTEX_WAKE_PRIVATE        (FUTEX_WAKE | FUTEX_PRIVATE_FLAG)
-#endif
-#ifndef FUTEX_REQUEUE_PRIVATE
-#define FUTEX_REQUEUE_PRIVATE     (FUTEX_REQUEUE | FUTEX_PRIVATE_FLAG)
-#endif
-#ifndef FUTEX_CMP_REQUEUE_PRIVATE
-#define FUTEX_CMP_REQUEUE_PRIVATE (FUTEX_CMP_REQUEUE | FUTEX_PRIVATE_FLAG)
-#endif
-#ifndef FUTEX_WAKE_OP_PRIVATE
-#define FUTEX_WAKE_OP_PRIVATE     (FUTEX_WAKE_OP | FUTEX_PRIVATE_FLAG)
-#endif
-#ifndef FUTEX_LOCK_PI_PRIVATE
-#define FUTEX_LOCK_PI_PRIVATE     (FUTEX_LOCK_PI | FUTEX_PRIVATE_FLAG)
-#endif
-#ifndef FUTEX_UNLOCK_PI_PRIVATE
-#define FUTEX_UNLOCK_PI_PRIVATE   (FUTEX_UNLOCK_PI | FUTEX_PRIVATE_FLAG)
-#endif
-#ifndef FUTEX_TRYLOCK_PI_PRIVATE
-#define FUTEX_TRYLOCK_PI_PRIVATE  (FUTEX_TRYLOCK_PI | FUTEX_PRIVATE_FLAG)
-#endif
-
-
-#if defined(__x86_64__)
-#ifndef ARCH_SET_GS
-#define ARCH_SET_GS             0x1001
-#endif
-#ifndef ARCH_GET_GS
-#define ARCH_GET_GS             0x1004
-#endif
-#endif
-
-#if defined(__i386__)
-#ifndef __NR_quotactl
-#define __NR_quotactl           131
-#endif
-#ifndef __NR_setresuid
-#define __NR_setresuid          164
-#define __NR_getresuid          165
-#define __NR_setresgid          170
-#define __NR_getresgid          171
-#endif
-#ifndef __NR_rt_sigaction
-#define __NR_rt_sigreturn       173
-#define __NR_rt_sigaction       174
-#define __NR_rt_sigprocmask     175
-#define __NR_rt_sigpending      176
-#define __NR_rt_sigsuspend      179
-#endif
-#ifndef __NR_pread64
-#define __NR_pread64            180
-#endif
-#ifndef __NR_pwrite64
-#define __NR_pwrite64           181
-#endif
-#ifndef __NR_ugetrlimit
-#define __NR_ugetrlimit         191
-#endif
-#ifndef __NR_stat64
-#define __NR_stat64             195
-#endif
-#ifndef __NR_fstat64
-#define __NR_fstat64            197
-#endif
-#ifndef __NR_setresuid32
-#define __NR_setresuid32        208
-#define __NR_getresuid32        209
-#define __NR_setresgid32        210
-#define __NR_getresgid32        211
-#endif
-#ifndef __NR_setfsuid32
-#define __NR_setfsuid32         215
-#define __NR_setfsgid32         216
-#endif
-#ifndef __NR_getdents64
-#define __NR_getdents64         220
-#endif
-#ifndef __NR_gettid
-#define __NR_gettid             224
-#endif
-#ifndef __NR_readahead
-#define __NR_readahead          225
-#endif
-#ifndef __NR_setxattr
-#define __NR_setxattr           226
-#endif
-#ifndef __NR_lsetxattr
-#define __NR_lsetxattr          227
-#endif
-#ifndef __NR_getxattr
-#define __NR_getxattr           229
-#endif
-#ifndef __NR_lgetxattr
-#define __NR_lgetxattr          230
-#endif
-#ifndef __NR_listxattr
-#define __NR_listxattr          232
-#endif
-#ifndef __NR_llistxattr
-#define __NR_llistxattr         233
-#endif
-#ifndef __NR_tkill
-#define __NR_tkill              238
-#endif
-#ifndef __NR_futex
-#define __NR_futex              240
-#endif
-#ifndef __NR_sched_setaffinity
-#define __NR_sched_setaffinity  241
-#define __NR_sched_getaffinity  242
-#endif
-#ifndef __NR_set_tid_address
-#define __NR_set_tid_address    258
-#endif
-#ifndef __NR_clock_gettime
-#define __NR_clock_gettime      265
-#endif
-#ifndef __NR_clock_getres
-#define __NR_clock_getres       266
-#endif
-#ifndef __NR_statfs64
-#define __NR_statfs64           268
-#endif
-#ifndef __NR_fstatfs64
-#define __NR_fstatfs64          269
-#endif
-#ifndef __NR_fadvise64_64
-#define __NR_fadvise64_64       272
-#endif
-#ifndef __NR_ioprio_set
-#define __NR_ioprio_set         289
-#endif
-#ifndef __NR_ioprio_get
-#define __NR_ioprio_get         290
-#endif
-#ifndef __NR_openat
-#define __NR_openat             295
-#endif
-#ifndef __NR_fstatat64
-#define __NR_fstatat64          300
-#endif
-#ifndef __NR_unlinkat
-#define __NR_unlinkat           301
-#endif
-#ifndef __NR_move_pages
-#define __NR_move_pages         317
-#endif
-#ifndef __NR_getcpu
-#define __NR_getcpu             318
-#endif
-#ifndef __NR_fallocate
-#define __NR_fallocate          324
-#endif
-#ifndef __NR_getrandom
-#define __NR_getrandom          355
-#endif
-/* End of i386 definitions                                                   */
-#elif defined(__ARM_ARCH_3__) || defined(__ARM_EABI__)
-#ifndef __NR_setresuid
-#define __NR_setresuid          (__NR_SYSCALL_BASE + 164)
-#define __NR_getresuid          (__NR_SYSCALL_BASE + 165)
-#define __NR_setresgid          (__NR_SYSCALL_BASE + 170)
-#define __NR_getresgid          (__NR_SYSCALL_BASE + 171)
-#endif
-#ifndef __NR_rt_sigaction
-#define __NR_rt_sigreturn       (__NR_SYSCALL_BASE + 173)
-#define __NR_rt_sigaction       (__NR_SYSCALL_BASE + 174)
-#define __NR_rt_sigprocmask     (__NR_SYSCALL_BASE + 175)
-#define __NR_rt_sigpending      (__NR_SYSCALL_BASE + 176)
-#define __NR_rt_sigsuspend      (__NR_SYSCALL_BASE + 179)
-#endif
-#ifndef __NR_pread64
-#define __NR_pread64            (__NR_SYSCALL_BASE + 180)
-#endif
-#ifndef __NR_pwrite64
-#define __NR_pwrite64           (__NR_SYSCALL_BASE + 181)
-#endif
-#ifndef __NR_ugetrlimit
-#define __NR_ugetrlimit         (__NR_SYSCALL_BASE + 191)
-#endif
-#ifndef __NR_stat64
-#define __NR_stat64             (__NR_SYSCALL_BASE + 195)
-#endif
-#ifndef __NR_fstat64
-#define __NR_fstat64            (__NR_SYSCALL_BASE + 197)
-#endif
-#ifndef __NR_setresuid32
-#define __NR_setresuid32        (__NR_SYSCALL_BASE + 208)
-#define __NR_getresuid32        (__NR_SYSCALL_BASE + 209)
-#define __NR_setresgid32        (__NR_SYSCALL_BASE + 210)
-#define __NR_getresgid32        (__NR_SYSCALL_BASE + 211)
-#endif
-#ifndef __NR_setfsuid32
-#define __NR_setfsuid32         (__NR_SYSCALL_BASE + 215)
-#define __NR_setfsgid32         (__NR_SYSCALL_BASE + 216)
-#endif
-#ifndef __NR_getdents64
-#define __NR_getdents64         (__NR_SYSCALL_BASE + 217)
-#endif
-#ifndef __NR_gettid
-#define __NR_gettid             (__NR_SYSCALL_BASE + 224)
-#endif
-#ifndef __NR_readahead
-#define __NR_readahead          (__NR_SYSCALL_BASE + 225)
-#endif
-#ifndef __NR_setxattr
-#define __NR_setxattr           (__NR_SYSCALL_BASE + 226)
-#endif
-#ifndef __NR_lsetxattr
-#define __NR_lsetxattr          (__NR_SYSCALL_BASE + 227)
-#endif
-#ifndef __NR_getxattr
-#define __NR_getxattr           (__NR_SYSCALL_BASE + 229)
-#endif
-#ifndef __NR_lgetxattr
-#define __NR_lgetxattr          (__NR_SYSCALL_BASE + 230)
-#endif
-#ifndef __NR_listxattr
-#define __NR_listxattr          (__NR_SYSCALL_BASE + 232)
-#endif
-#ifndef __NR_llistxattr
-#define __NR_llistxattr         (__NR_SYSCALL_BASE + 233)
-#endif
-#ifndef __NR_tkill
-#define __NR_tkill              (__NR_SYSCALL_BASE + 238)
-#endif
-#ifndef __NR_futex
-#define __NR_futex              (__NR_SYSCALL_BASE + 240)
-#endif
-#ifndef __NR_sched_setaffinity
-#define __NR_sched_setaffinity  (__NR_SYSCALL_BASE + 241)
-#define __NR_sched_getaffinity  (__NR_SYSCALL_BASE + 242)
-#endif
-#ifndef __NR_set_tid_address
-#define __NR_set_tid_address    (__NR_SYSCALL_BASE + 256)
-#endif
-#ifndef __NR_clock_gettime
-#define __NR_clock_gettime      (__NR_SYSCALL_BASE + 263)
-#endif
-#ifndef __NR_clock_getres
-#define __NR_clock_getres       (__NR_SYSCALL_BASE + 264)
-#endif
-#ifndef __NR_statfs64
-#define __NR_statfs64           (__NR_SYSCALL_BASE + 266)
-#endif
-#ifndef __NR_fstatfs64
-#define __NR_fstatfs64          (__NR_SYSCALL_BASE + 267)
-#endif
-#ifndef __NR_ioprio_set
-#define __NR_ioprio_set         (__NR_SYSCALL_BASE + 314)
-#endif
-#ifndef __NR_ioprio_get
-#define __NR_ioprio_get         (__NR_SYSCALL_BASE + 315)
-#endif
-#ifndef __NR_fstatat64
-#define __NR_fstatat64          (__NR_SYSCALL_BASE + 327)
-#endif
-#ifndef __NR_move_pages
-#define __NR_move_pages         (__NR_SYSCALL_BASE + 344)
-#endif
-#ifndef __NR_getcpu
-#define __NR_getcpu             (__NR_SYSCALL_BASE + 345)
-#endif
-#ifndef __NR_getrandom
-#define __NR_getrandom          (__NR_SYSCALL_BASE + 384)
-#endif
-/* End of ARM 3/EABI definitions                                             */
-#elif defined(__aarch64__)
-#ifndef __NR_setxattr
-#define __NR_setxattr             5
-#endif
-#ifndef __NR_lsetxattr
-#define __NR_lsetxattr            6
-#endif
-#ifndef __NR_getxattr
-#define __NR_getxattr             8
-#endif
-#ifndef __NR_lgetxattr
-#define __NR_lgetxattr            9
-#endif
-#ifndef __NR_listxattr
-#define __NR_listxattr           11
-#endif
-#ifndef __NR_llistxattr
-#define __NR_llistxattr          12
-#endif
-#ifndef __NR_ioprio_set
-#define __NR_ioprio_set          30
-#endif
-#ifndef __NR_ioprio_get
-#define __NR_ioprio_get          31
-#endif
-#ifndef __NR_unlinkat
-#define __NR_unlinkat            35
-#endif
-#ifndef __NR_fallocate
-#define __NR_fallocate           47
-#endif
-#ifndef __NR_openat
-#define __NR_openat              56
-#endif
-#ifndef __NR_quotactl
-#define __NR_quotactl            60
-#endif
-#ifndef __NR_getdents64
-#define __NR_getdents64          61
-#endif
-#ifndef __NR_getdents
-// when getdents is not available, getdents64 is used for both.
-#define __NR_getdents            __NR_getdents64
-#endif
-#ifndef __NR_pread64
-#define __NR_pread64             67
-#endif
-#ifndef __NR_pwrite64
-#define __NR_pwrite64            68
-#endif
-#ifndef __NR_ppoll
-#define __NR_ppoll               73
-#endif
-#ifndef __NR_readlinkat
-#define __NR_readlinkat          78
-#endif
-#ifndef __NR_newfstatat
-#define __NR_newfstatat          79
-#endif
-#ifndef __NR_set_tid_address
-#define __NR_set_tid_address     96
-#endif
-#ifndef __NR_futex
-#define __NR_futex               98
-#endif
-#ifndef __NR_clock_gettime
-#define __NR_clock_gettime      113
-#endif
-#ifndef __NR_clock_getres
-#define __NR_clock_getres       114
-#endif
-#ifndef __NR_sched_setaffinity
-#define __NR_sched_setaffinity  122
-#define __NR_sched_getaffinity  123
-#endif
-#ifndef __NR_tkill
-#define __NR_tkill              130
-#endif
-#ifndef __NR_setresuid
-#define __NR_setresuid          147
-#define __NR_getresuid          148
-#define __NR_setresgid          149
-#define __NR_getresgid          150
-#endif
-#ifndef __NR_gettid
-#define __NR_gettid             178
-#endif
-#ifndef __NR_readahead
-#define __NR_readahead          213
-#endif
-#ifndef __NR_fadvise64
-#define __NR_fadvise64          223
-#endif
-#ifndef __NR_move_pages
-#define __NR_move_pages         239
-#endif
-#ifndef __NR_getrandom
-#define __NR_getrandom          278
-#endif
-/* End of aarch64 definitions                                                */
-#elif defined(__x86_64__)
-#ifndef __NR_pread64
-#define __NR_pread64             17
-#endif
-#ifndef __NR_pwrite64
-#define __NR_pwrite64            18
-#endif
-#ifndef __NR_setresuid
-#define __NR_setresuid          117
-#define __NR_getresuid          118
-#define __NR_setresgid          119
-#define __NR_getresgid          120
-#endif
-#ifndef __NR_quotactl
-#define __NR_quotactl           179
-#endif
-#ifndef __NR_gettid
-#define __NR_gettid             186
-#endif
-#ifndef __NR_readahead
-#define __NR_readahead          187
-#endif
-#ifndef __NR_setxattr
-#define __NR_setxattr           188
-#endif
-#ifndef __NR_lsetxattr
-#define __NR_lsetxattr          189
-#endif
-#ifndef __NR_getxattr
-#define __NR_getxattr           191
-#endif
-#ifndef __NR_lgetxattr
-#define __NR_lgetxattr          192
-#endif
-#ifndef __NR_listxattr
-#define __NR_listxattr          194
-#endif
-#ifndef __NR_llistxattr
-#define __NR_llistxattr         195
-#endif
-#ifndef __NR_tkill
-#define __NR_tkill              200
-#endif
-#ifndef __NR_futex
-#define __NR_futex              202
-#endif
-#ifndef __NR_sched_setaffinity
-#define __NR_sched_setaffinity  203
-#define __NR_sched_getaffinity  204
-#endif
-#ifndef __NR_getdents64
-#define __NR_getdents64         217
-#endif
-#ifndef __NR_getdents
-// when getdents is not available, getdents64 is used for both.
-#define __NR_getdents           __NR_getdents64
-#endif
-#ifndef __NR_set_tid_address
-#define __NR_set_tid_address    218
-#endif
-#ifndef __NR_fadvise64
-#define __NR_fadvise64          221
-#endif
-#ifndef __NR_clock_gettime
-#define __NR_clock_gettime      228
-#endif
-#ifndef __NR_clock_getres
-#define __NR_clock_getres       229
-#endif
-#ifndef __NR_ioprio_set
-#define __NR_ioprio_set         251
-#endif
-#ifndef __NR_ioprio_get
-#define __NR_ioprio_get         252
-#endif
-#ifndef __NR_openat
-#define __NR_openat             257
-#endif
-#ifndef __NR_newfstatat
-#define __NR_newfstatat         262
-#endif
-#ifndef __NR_unlinkat
-#define __NR_unlinkat           263
-#endif
-#ifndef __NR_move_pages
-#define __NR_move_pages         279
-#endif
-#ifndef __NR_fallocate
-#define __NR_fallocate          285
-#endif
-#ifndef __NR_getrandom
-#define __NR_getrandom          318
-#endif
-/* End of x86-64 definitions                                                 */
-#elif defined(__mips__)
-#if _MIPS_SIM == _MIPS_SIM_ABI32
-#ifndef __NR_setresuid
-#define __NR_setresuid          (__NR_Linux + 185)
-#define __NR_getresuid          (__NR_Linux + 186)
-#define __NR_setresgid          (__NR_Linux + 190)
-#define __NR_getresgid          (__NR_Linux + 191)
-#endif
-#ifndef __NR_rt_sigaction
-#define __NR_rt_sigreturn       (__NR_Linux + 193)
-#define __NR_rt_sigaction       (__NR_Linux + 194)
-#define __NR_rt_sigprocmask     (__NR_Linux + 195)
-#define __NR_rt_sigpending      (__NR_Linux + 196)
-#define __NR_rt_sigsuspend      (__NR_Linux + 199)
-#endif
-#ifndef __NR_pread64
-#define __NR_pread64            (__NR_Linux + 200)
-#endif
-#ifndef __NR_pwrite64
-#define __NR_pwrite64           (__NR_Linux + 201)
-#endif
-#ifndef __NR_stat64
-#define __NR_stat64             (__NR_Linux + 213)
-#endif
-#ifndef __NR_fstat64
-#define __NR_fstat64            (__NR_Linux + 215)
-#endif
-#ifndef __NR_getdents64
-#define __NR_getdents64         (__NR_Linux + 219)
-#endif
-#ifndef __NR_gettid
-#define __NR_gettid             (__NR_Linux + 222)
-#endif
-#ifndef __NR_readahead
-#define __NR_readahead          (__NR_Linux + 223)
-#endif
-#ifndef __NR_setxattr
-#define __NR_setxattr           (__NR_Linux + 224)
-#endif
-#ifndef __NR_lsetxattr
-#define __NR_lsetxattr          (__NR_Linux + 225)
-#endif
-#ifndef __NR_getxattr
-#define __NR_getxattr           (__NR_Linux + 227)
-#endif
-#ifndef __NR_lgetxattr
-#define __NR_lgetxattr          (__NR_Linux + 228)
-#endif
-#ifndef __NR_listxattr
-#define __NR_listxattr          (__NR_Linux + 230)
-#endif
-#ifndef __NR_llistxattr
-#define __NR_llistxattr         (__NR_Linux + 231)
-#endif
-#ifndef __NR_tkill
-#define __NR_tkill              (__NR_Linux + 236)
-#endif
-#ifndef __NR_futex
-#define __NR_futex              (__NR_Linux + 238)
-#endif
-#ifndef __NR_sched_setaffinity
-#define __NR_sched_setaffinity  (__NR_Linux + 239)
-#define __NR_sched_getaffinity  (__NR_Linux + 240)
-#endif
-#ifndef __NR_set_tid_address
-#define __NR_set_tid_address    (__NR_Linux + 252)
-#endif
-#ifndef __NR_statfs64
-#define __NR_statfs64           (__NR_Linux + 255)
-#endif
-#ifndef __NR_fstatfs64
-#define __NR_fstatfs64          (__NR_Linux + 256)
-#endif
-#ifndef __NR_clock_gettime
-#define __NR_clock_gettime      (__NR_Linux + 263)
-#endif
-#ifndef __NR_clock_getres
-#define __NR_clock_getres       (__NR_Linux + 264)
-#endif
-#ifndef __NR_openat
-#define __NR_openat             (__NR_Linux + 288)
-#endif
-#ifndef __NR_fstatat
-#define __NR_fstatat            (__NR_Linux + 293)
-#endif
-#ifndef __NR_unlinkat
-#define __NR_unlinkat           (__NR_Linux + 294)
-#endif
-#ifndef __NR_move_pages
-#define __NR_move_pages         (__NR_Linux + 308)
-#endif
-#ifndef __NR_getcpu
-#define __NR_getcpu             (__NR_Linux + 312)
-#endif
-#ifndef __NR_ioprio_set
-#define __NR_ioprio_set         (__NR_Linux + 314)
-#endif
-#ifndef __NR_ioprio_get
-#define __NR_ioprio_get         (__NR_Linux + 315)
-#endif
-#ifndef __NR_getrandom
-#define __NR_getrandom          (__NR_Linux + 353)
-#endif
-/* End of MIPS (old 32bit API) definitions */
-#elif  _MIPS_SIM == _MIPS_SIM_ABI64
-#ifndef __NR_pread64
-#define __NR_pread64            (__NR_Linux +  16)
-#endif
-#ifndef __NR_pwrite64
-#define __NR_pwrite64           (__NR_Linux +  17)
-#endif
-#ifndef __NR_setresuid
-#define __NR_setresuid          (__NR_Linux + 115)
-#define __NR_getresuid          (__NR_Linux + 116)
-#define __NR_setresgid          (__NR_Linux + 117)
-#define __NR_getresgid          (__NR_Linux + 118)
-#endif
-#ifndef __NR_gettid
-#define __NR_gettid             (__NR_Linux + 178)
-#endif
-#ifndef __NR_readahead
-#define __NR_readahead          (__NR_Linux + 179)
-#endif
-#ifndef __NR_setxattr
-#define __NR_setxattr           (__NR_Linux + 180)
-#endif
-#ifndef __NR_lsetxattr
-#define __NR_lsetxattr          (__NR_Linux + 181)
-#endif
-#ifndef __NR_getxattr
-#define __NR_getxattr           (__NR_Linux + 183)
-#endif
-#ifndef __NR_lgetxattr
-#define __NR_lgetxattr          (__NR_Linux + 184)
-#endif
-#ifndef __NR_listxattr
-#define __NR_listxattr          (__NR_Linux + 186)
-#endif
-#ifndef __NR_llistxattr
-#define __NR_llistxattr         (__NR_Linux + 187)
-#endif
-#ifndef __NR_tkill
-#define __NR_tkill              (__NR_Linux + 192)
-#endif
-#ifndef __NR_futex
-#define __NR_futex              (__NR_Linux + 194)
-#endif
-#ifndef __NR_sched_setaffinity
-#define __NR_sched_setaffinity  (__NR_Linux + 195)
-#define __NR_sched_getaffinity  (__NR_Linux + 196)
-#endif
-#ifndef __NR_set_tid_address
-#define __NR_set_tid_address    (__NR_Linux + 212)
-#endif
-#ifndef __NR_clock_gettime
-#define __NR_clock_gettime      (__NR_Linux + 222)
-#endif
-#ifndef __NR_clock_getres
-#define __NR_clock_getres       (__NR_Linux + 223)
-#endif
-#ifndef __NR_openat
-#define __NR_openat             (__NR_Linux + 247)
-#endif
-#ifndef __NR_fstatat
-#define __NR_fstatat            (__NR_Linux + 252)
-#endif
-#ifndef __NR_unlinkat
-#define __NR_unlinkat           (__NR_Linux + 253)
-#endif
-#ifndef __NR_move_pages
-#define __NR_move_pages         (__NR_Linux + 267)
-#endif
-#ifndef __NR_getcpu
-#define __NR_getcpu             (__NR_Linux + 271)
-#endif
-#ifndef __NR_ioprio_set
-#define __NR_ioprio_set         (__NR_Linux + 273)
-#endif
-#ifndef __NR_ioprio_get
-#define __NR_ioprio_get         (__NR_Linux + 274)
-#endif
-#ifndef __NR_getrandom
-#define __NR_getrandom          (__NR_Linux + 313)
-#endif
-/* End of MIPS (64bit API) definitions */
-#else
-#ifndef __NR_setresuid
-#define __NR_setresuid          (__NR_Linux + 115)
-#define __NR_getresuid          (__NR_Linux + 116)
-#define __NR_setresgid          (__NR_Linux + 117)
-#define __NR_getresgid          (__NR_Linux + 118)
-#endif
-#ifndef __NR_gettid
-#define __NR_gettid             (__NR_Linux + 178)
-#endif
-#ifndef __NR_readahead
-#define __NR_readahead          (__NR_Linux + 179)
-#endif
-#ifndef __NR_setxattr
-#define __NR_setxattr           (__NR_Linux + 180)
-#endif
-#ifndef __NR_lsetxattr
-#define __NR_lsetxattr          (__NR_Linux + 181)
-#endif
-#ifndef __NR_getxattr
-#define __NR_getxattr           (__NR_Linux + 183)
-#endif
-#ifndef __NR_lgetxattr
-#define __NR_lgetxattr          (__NR_Linux + 184)
-#endif
-#ifndef __NR_listxattr
-#define __NR_listxattr          (__NR_Linux + 186)
-#endif
-#ifndef __NR_llistxattr
-#define __NR_llistxattr         (__NR_Linux + 187)
-#endif
-#ifndef __NR_tkill
-#define __NR_tkill              (__NR_Linux + 192)
-#endif
-#ifndef __NR_futex
-#define __NR_futex              (__NR_Linux + 194)
-#endif
-#ifndef __NR_sched_setaffinity
-#define __NR_sched_setaffinity  (__NR_Linux + 195)
-#define __NR_sched_getaffinity  (__NR_Linux + 196)
-#endif
-#ifndef __NR_set_tid_address
-#define __NR_set_tid_address    (__NR_Linux + 213)
-#endif
-#ifndef __NR_statfs64
-#define __NR_statfs64           (__NR_Linux + 217)
-#endif
-#ifndef __NR_fstatfs64
-#define __NR_fstatfs64          (__NR_Linux + 218)
-#endif
-#ifndef __NR_clock_gettime
-#define __NR_clock_gettime      (__NR_Linux + 226)
-#endif
-#ifndef __NR_clock_getres
-#define __NR_clock_getres       (__NR_Linux + 227)
-#endif
-#ifndef __NR_openat
-#define __NR_openat             (__NR_Linux + 251)
-#endif
-#ifndef __NR_fstatat
-#define __NR_fstatat            (__NR_Linux + 256)
-#endif
-#ifndef __NR_unlinkat
-#define __NR_unlinkat           (__NR_Linux + 257)
-#endif
-#ifndef __NR_move_pages
-#define __NR_move_pages         (__NR_Linux + 271)
-#endif
-#ifndef __NR_getcpu
-#define __NR_getcpu             (__NR_Linux + 275)
-#endif
-#ifndef __NR_ioprio_set
-#define __NR_ioprio_set         (__NR_Linux + 277)
-#endif
-#ifndef __NR_ioprio_get
-#define __NR_ioprio_get         (__NR_Linux + 278)
-#endif
-/* End of MIPS (new 32bit API) definitions                                   */
-#endif
-/* End of MIPS definitions                                                   */
-#elif defined(__PPC__)
-#ifndef __NR_setfsuid
-#define __NR_setfsuid           138
-#define __NR_setfsgid           139
-#endif
-#ifndef __NR_setresuid
-#define __NR_setresuid          164
-#define __NR_getresuid          165
-#define __NR_setresgid          169
-#define __NR_getresgid          170
-#endif
-#ifndef __NR_rt_sigaction
-#define __NR_rt_sigreturn       172
-#define __NR_rt_sigaction       173
-#define __NR_rt_sigprocmask     174
-#define __NR_rt_sigpending      175
-#define __NR_rt_sigsuspend      178
-#endif
-#ifndef __NR_pread64
-#define __NR_pread64            179
-#endif
-#ifndef __NR_pwrite64
-#define __NR_pwrite64           180
-#endif
-#ifndef __NR_ugetrlimit
-#define __NR_ugetrlimit         190
-#endif
-#ifndef __NR_readahead
-#define __NR_readahead          191
-#endif
-#ifndef __NR_stat64
-#define __NR_stat64             195
-#endif
-#ifndef __NR_fstat64
-#define __NR_fstat64            197
-#endif
-#ifndef __NR_getdents64
-#define __NR_getdents64         202
-#endif
-#ifndef __NR_gettid
-#define __NR_gettid             207
-#endif
-#ifndef __NR_tkill
-#define __NR_tkill              208
-#endif
-#ifndef __NR_setxattr
-#define __NR_setxattr           209
-#endif
-#ifndef __NR_lsetxattr
-#define __NR_lsetxattr          210
-#endif
-#ifndef __NR_getxattr
-#define __NR_getxattr           212
-#endif
-#ifndef __NR_lgetxattr
-#define __NR_lgetxattr          213
-#endif
-#ifndef __NR_listxattr
-#define __NR_listxattr          215
-#endif
-#ifndef __NR_llistxattr
-#define __NR_llistxattr         216
-#endif
-#ifndef __NR_futex
-#define __NR_futex              221
-#endif
-#ifndef __NR_sched_setaffinity
-#define __NR_sched_setaffinity  222
-#define __NR_sched_getaffinity  223
-#endif
-#ifndef __NR_set_tid_address
-#define __NR_set_tid_address    232
-#endif
-#ifndef __NR_clock_gettime
-#define __NR_clock_gettime      246
-#endif
-#ifndef __NR_clock_getres
-#define __NR_clock_getres       247
-#endif
-#ifndef __NR_statfs64
-#define __NR_statfs64           252
-#endif
-#ifndef __NR_fstatfs64
-#define __NR_fstatfs64          253
-#endif
-#ifndef __NR_fadvise64_64
-#define __NR_fadvise64_64       254
-#endif
-#ifndef __NR_ioprio_set
-#define __NR_ioprio_set         273
-#endif
-#ifndef __NR_ioprio_get
-#define __NR_ioprio_get         274
-#endif
-#ifndef __NR_openat
-#define __NR_openat             286
-#endif
-#ifndef __NR_fstatat64
-#define __NR_fstatat64          291
-#endif
-#ifndef __NR_unlinkat
-#define __NR_unlinkat           292
-#endif
-#ifndef __NR_move_pages
-#define __NR_move_pages         301
-#endif
-#ifndef __NR_getcpu
-#define __NR_getcpu             302
-#endif
-/* End of powerpc defininitions                                              */
-#elif defined(__s390__)
-#ifndef __NR_quotactl
-#define __NR_quotactl           131
-#endif
-#ifndef __NR_rt_sigreturn
-#define __NR_rt_sigreturn       173
-#endif
-#ifndef __NR_rt_sigaction
-#define __NR_rt_sigaction       174
-#endif
-#ifndef __NR_rt_sigprocmask
-#define __NR_rt_sigprocmask     175
-#endif
-#ifndef __NR_rt_sigpending
-#define __NR_rt_sigpending      176
-#endif
-#ifndef __NR_rt_sigsuspend
-#define __NR_rt_sigsuspend      179
-#endif
-#ifndef __NR_pread64
-#define __NR_pread64            180
-#endif
-#ifndef __NR_pwrite64
-#define __NR_pwrite64           181
-#endif
-#ifndef __NR_getdents64
-#define __NR_getdents64         220
-#endif
-#ifndef __NR_readahead
-#define __NR_readahead          222
-#endif
-#ifndef __NR_setxattr
-#define __NR_setxattr           224
-#endif
-#ifndef __NR_lsetxattr
-#define __NR_lsetxattr          225
-#endif
-#ifndef __NR_getxattr
-#define __NR_getxattr           227
-#endif
-#ifndef __NR_lgetxattr
-#define __NR_lgetxattr          228
-#endif
-#ifndef __NR_listxattr
-#define __NR_listxattr          230
-#endif
-#ifndef __NR_llistxattr
-#define __NR_llistxattr         231
-#endif
-#ifndef __NR_gettid
-#define __NR_gettid             236
-#endif
-#ifndef __NR_tkill
-#define __NR_tkill              237
-#endif
-#ifndef __NR_futex
-#define __NR_futex              238
-#endif
-#ifndef __NR_sched_setaffinity
-#define __NR_sched_setaffinity  239
-#endif
-#ifndef __NR_sched_getaffinity
-#define __NR_sched_getaffinity  240
-#endif
-#ifndef __NR_set_tid_address
-#define __NR_set_tid_address    252
-#endif
-#ifndef __NR_clock_gettime
-#define __NR_clock_gettime      260
-#endif
-#ifndef __NR_clock_getres
-#define __NR_clock_getres       261
-#endif
-#ifndef __NR_statfs64
-#define __NR_statfs64           265
-#endif
-#ifndef __NR_fstatfs64
-#define __NR_fstatfs64          266
-#endif
-#ifndef __NR_ioprio_set
-#define __NR_ioprio_set         282
-#endif
-#ifndef __NR_ioprio_get
-#define __NR_ioprio_get         283
-#endif
-#ifndef __NR_openat
-#define __NR_openat             288
-#endif
-#ifndef __NR_unlinkat
-#define __NR_unlinkat           294
-#endif
-#ifndef __NR_move_pages
-#define __NR_move_pages         310
-#endif
-#ifndef __NR_getcpu
-#define __NR_getcpu             311
-#endif
-#ifndef __NR_fallocate
-#define __NR_fallocate          314
-#endif
-/* Some syscalls are named/numbered differently between s390 and s390x. */
-#ifdef __s390x__
-# ifndef __NR_getrlimit
-# define __NR_getrlimit          191
-# endif
-# ifndef __NR_setresuid
-# define __NR_setresuid          208
-# endif
-# ifndef __NR_getresuid
-# define __NR_getresuid          209
-# endif
-# ifndef __NR_setresgid
-# define __NR_setresgid          210
-# endif
-# ifndef __NR_getresgid
-# define __NR_getresgid          211
-# endif
-# ifndef __NR_setfsuid
-# define __NR_setfsuid           215
-# endif
-# ifndef __NR_setfsgid
-# define __NR_setfsgid           216
-# endif
-# ifndef __NR_fadvise64
-# define __NR_fadvise64          253
-# endif
-# ifndef __NR_newfstatat
-# define __NR_newfstatat         293
-# endif
-#else /* __s390x__ */
-# ifndef __NR_getrlimit
-# define __NR_getrlimit          76
-# endif
-# ifndef __NR_setfsuid
-# define __NR_setfsuid           138
-# endif
-# ifndef __NR_setfsgid
-# define __NR_setfsgid           139
-# endif
-# ifndef __NR_setresuid
-# define __NR_setresuid          164
-# endif
-# ifndef __NR_getresuid
-# define __NR_getresuid          165
-# endif
-# ifndef __NR_setresgid
-# define __NR_setresgid          170
-# endif
-# ifndef __NR_getresgid
-# define __NR_getresgid          171
-# endif
-# ifndef __NR_ugetrlimit
-# define __NR_ugetrlimit         191
-# endif
-# ifndef __NR_mmap2
-# define __NR_mmap2              192
-# endif
-# ifndef __NR_setresuid32
-# define __NR_setresuid32        208
-# endif
-# ifndef __NR_getresuid32
-# define __NR_getresuid32        209
-# endif
-# ifndef __NR_setresgid32
-# define __NR_setresgid32        210
-# endif
-# ifndef __NR_getresgid32
-# define __NR_getresgid32        211
-# endif
-# ifndef __NR_setfsuid32
-# define __NR_setfsuid32         215
-# endif
-# ifndef __NR_setfsgid32
-# define __NR_setfsgid32         216
-# endif
-# ifndef __NR_fadvise64_64
-# define __NR_fadvise64_64       264
-# endif
-# ifndef __NR_fstatat64
-# define __NR_fstatat64          293
-# endif
-#endif /* __s390__ */
-/* End of s390/s390x definitions                                             */
-#endif
-
-
-/* After forking, we must make sure to only call system calls.               */
-#if defined(__BOUNDED_POINTERS__)
-  #error "Need to port invocations of syscalls for bounded ptrs"
-#else
-  /* The core dumper and the thread lister get executed after threads
-   * have been suspended. As a consequence, we cannot call any functions
-   * that acquire locks. Unfortunately, libc wraps most system calls
-   * (e.g. in order to implement pthread_atfork, and to make calls
-   * cancellable), which means we cannot call these functions. Instead,
-   * we have to call syscall() directly.
-   */
-  #undef LSS_ERRNO
-  #ifdef SYS_ERRNO
-    /* Allow the including file to override the location of errno. This can
-     * be useful when using clone() with the CLONE_VM option.
-     */
-    #define LSS_ERRNO SYS_ERRNO
-  #else
-    #define LSS_ERRNO errno
-  #endif
-
-  #undef LSS_INLINE
-  #ifdef SYS_INLINE
-    #define LSS_INLINE SYS_INLINE
-  #else
-    #define LSS_INLINE static inline
-  #endif
-
-  /* Allow the including file to override the prefix used for all new
-   * system calls. By default, it will be set to "sys_".
-   */
-  #undef LSS_NAME
-  #ifndef SYS_PREFIX
-    #define LSS_NAME(name) sys_##name
-  #elif defined(SYS_PREFIX) && SYS_PREFIX < 0
-    #define LSS_NAME(name) name
-  #elif defined(SYS_PREFIX) && SYS_PREFIX == 0
-    #define LSS_NAME(name) sys0_##name
-  #elif defined(SYS_PREFIX) && SYS_PREFIX == 1
-    #define LSS_NAME(name) sys1_##name
-  #elif defined(SYS_PREFIX) && SYS_PREFIX == 2
-    #define LSS_NAME(name) sys2_##name
-  #elif defined(SYS_PREFIX) && SYS_PREFIX == 3
-    #define LSS_NAME(name) sys3_##name
-  #elif defined(SYS_PREFIX) && SYS_PREFIX == 4
-    #define LSS_NAME(name) sys4_##name
-  #elif defined(SYS_PREFIX) && SYS_PREFIX == 5
-    #define LSS_NAME(name) sys5_##name
-  #elif defined(SYS_PREFIX) && SYS_PREFIX == 6
-    #define LSS_NAME(name) sys6_##name
-  #elif defined(SYS_PREFIX) && SYS_PREFIX == 7
-    #define LSS_NAME(name) sys7_##name
-  #elif defined(SYS_PREFIX) && SYS_PREFIX == 8
-    #define LSS_NAME(name) sys8_##name
-  #elif defined(SYS_PREFIX) && SYS_PREFIX == 9
-    #define LSS_NAME(name) sys9_##name
-  #endif
-
-  #undef  LSS_RETURN
-  #if defined(__i386__) || defined(__x86_64__) || defined(__ARM_ARCH_3__) \
-       || defined(__ARM_EABI__) || defined(__aarch64__) || defined(__s390__) \
-       || defined(__e2k__)
-  /* Failing system calls return a negative result in the range of
-   * -1..-4095. These are "errno" values with the sign inverted.
-   */
-  #define LSS_RETURN(type, res)                                               \
-    do {                                                                      \
-      if ((unsigned long)(res) >= (unsigned long)(-4095)) {                   \
-        LSS_ERRNO = -(res);                                                   \
-        res = -1;                                                             \
-      }                                                                       \
-      return (type) (res);                                                    \
-    } while (0)
-  #elif defined(__mips__)
-  /* On MIPS, failing system calls return -1, and set errno in a
-   * separate CPU register.
-   */
-  #define LSS_RETURN(type, res, err)                                          \
-    do {                                                                      \
-      if (err) {                                                              \
-        unsigned long __errnovalue = (res);                                   \
-        LSS_ERRNO = __errnovalue;                                             \
-        res = -1;                                                             \
-      }                                                                       \
-      return (type) (res);                                                    \
-    } while (0)
-  #elif defined(__PPC__)
-  /* On PPC, failing system calls return -1, and set errno in a
-   * separate CPU register. See linux/unistd.h.
-   */
-  #define LSS_RETURN(type, res, err)                                          \
-   do {                                                                       \
-     if (err & 0x10000000 ) {                                                 \
-       LSS_ERRNO = (res);                                                     \
-       res = -1;                                                              \
-     }                                                                        \
-     return (type) (res);                                                     \
-   } while (0)
-  #endif
-  #if defined(__i386__)
-    /* In PIC mode (e.g. when building shared libraries), gcc for i386
-     * reserves ebx. Unfortunately, most distribution ship with implementations
-     * of _syscallX() which clobber ebx.
-     * Also, most definitions of _syscallX() neglect to mark "memory" as being
-     * clobbered. This causes problems with compilers, that do a better job
-     * at optimizing across __asm__ calls.
-     * So, we just have to redefine all of the _syscallX() macros.
-     */
-    #undef LSS_ENTRYPOINT
-    #ifdef SYS_SYSCALL_ENTRYPOINT
-    static inline void (**LSS_NAME(get_syscall_entrypoint)(void))(void) {
-      void (**entrypoint)(void);
-      asm volatile(".bss\n"
-                   ".align 8\n"
-                   ".globl " SYS_SYSCALL_ENTRYPOINT "\n"
-                   ".common " SYS_SYSCALL_ENTRYPOINT ",8,8\n"
-                   ".previous\n"
-                   /* This logically does 'lea "SYS_SYSCALL_ENTRYPOINT", %0' */
-                   "call 0f\n"
-                 "0:pop  %0\n"
-                   "add  $_GLOBAL_OFFSET_TABLE_+[.-0b], %0\n"
-                   "mov  " SYS_SYSCALL_ENTRYPOINT "@GOT(%0), %0\n"
-                   : "=r"(entrypoint));
-      return entrypoint;
-    }
-
-    #define LSS_ENTRYPOINT ".bss\n"                                           \
-                           ".align 8\n"                                       \
-                           ".globl " SYS_SYSCALL_ENTRYPOINT "\n"              \
-                           ".common " SYS_SYSCALL_ENTRYPOINT ",8,8\n"         \
-                           ".previous\n"                                      \
-                           /* Check the SYS_SYSCALL_ENTRYPOINT vector      */ \
-                           "push %%eax\n"                                     \
-                           "call 10000f\n"                                    \
-                     "10000:pop  %%eax\n"                                     \
-                           "add  $_GLOBAL_OFFSET_TABLE_+[.-10000b], %%eax\n"  \
-                           "mov  " SYS_SYSCALL_ENTRYPOINT                     \
-                                 "@GOT(%%eax), %%eax\n"                       \
-                           "mov  0(%%eax), %%eax\n"                           \
-                           "test %%eax, %%eax\n"                              \
-                           "jz   10002f\n"                                    \
-                           "push %%eax\n"                                     \
-                           "call 10001f\n"                                    \
-                     "10001:pop  %%eax\n"                                     \
-                           "add  $(10003f-10001b), %%eax\n"                   \
-                           "xchg 4(%%esp), %%eax\n"                           \
-                           "ret\n"                                            \
-                     "10002:pop  %%eax\n"                                     \
-                           "int $0x80\n"                                      \
-                     "10003:\n"
-    #else
-    #define LSS_ENTRYPOINT "int $0x80\n"
-    #endif
-    #undef  LSS_BODY
-    #define LSS_BODY(type,args...)                                            \
-      long __res;                                                             \
-      __asm__ __volatile__("push %%ebx\n"                                     \
-                           "movl %2,%%ebx\n"                                  \
-                           LSS_ENTRYPOINT                                     \
-                           "pop %%ebx"                                        \
-                           args                                               \
-                           : "memory");                                       \
-      LSS_RETURN(type,__res)
-    #undef  _syscall0
-    #define _syscall0(type,name)                                              \
-      type LSS_NAME(name)(void) {                                             \
-        long __res;                                                           \
-        __asm__ volatile(LSS_ENTRYPOINT                                       \
-                         : "=a" (__res)                                       \
-                         : "0" (__NR_##name)                                  \
-                         : "memory");                                         \
-        LSS_RETURN(type,__res);                                               \
-      }
-    #undef  _syscall1
-    #define _syscall1(type,name,type1,arg1)                                   \
-      type LSS_NAME(name)(type1 arg1) {                                       \
-        LSS_BODY(type,                                                        \
-             : "=a" (__res)                                                   \
-             : "0" (__NR_##name), "ri" ((long)(arg1)));                       \
-      }
-    #undef  _syscall2
-    #define _syscall2(type,name,type1,arg1,type2,arg2)                        \
-      type LSS_NAME(name)(type1 arg1,type2 arg2) {                            \
-        LSS_BODY(type,                                                        \
-             : "=a" (__res)                                                   \
-             : "0" (__NR_##name),"ri" ((long)(arg1)), "c" ((long)(arg2)));    \
-      }
-    #undef  _syscall3
-    #define _syscall3(type,name,type1,arg1,type2,arg2,type3,arg3)             \
-      type LSS_NAME(name)(type1 arg1,type2 arg2,type3 arg3) {                 \
-        LSS_BODY(type,                                                        \
-             : "=a" (__res)                                                   \
-             : "0" (__NR_##name), "ri" ((long)(arg1)), "c" ((long)(arg2)),    \
-               "d" ((long)(arg3)));                                           \
-      }
-    #undef  _syscall4
-    #define _syscall4(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4)  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4) {   \
-        LSS_BODY(type,                                                        \
-             : "=a" (__res)                                                   \
-             : "0" (__NR_##name), "ri" ((long)(arg1)), "c" ((long)(arg2)),    \
-               "d" ((long)(arg3)),"S" ((long)(arg4)));                        \
-      }
-    #undef  _syscall5
-    #define _syscall5(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5)                                             \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5) {                                       \
-        long __res;                                                           \
-        __asm__ __volatile__("push %%ebx\n"                                   \
-                             "movl %2,%%ebx\n"                                \
-                             "movl %1,%%eax\n"                                \
-                             LSS_ENTRYPOINT                                   \
-                             "pop  %%ebx"                                     \
-                             : "=a" (__res)                                   \
-                             : "i" (__NR_##name), "ri" ((long)(arg1)),        \
-                               "c" ((long)(arg2)), "d" ((long)(arg3)),        \
-                               "S" ((long)(arg4)), "D" ((long)(arg5))         \
-                             : "memory");                                     \
-        LSS_RETURN(type,__res);                                               \
-      }
-    #undef  _syscall6
-    #define _syscall6(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5,type6,arg6)                                  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5, type6 arg6) {                           \
-        long __res;                                                           \
-        struct { long __a1; long __a6; } __s = { (long)arg1, (long) arg6 };   \
-        __asm__ __volatile__("push %%ebp\n"                                   \
-                             "push %%ebx\n"                                   \
-                             "movl 4(%2),%%ebp\n"                             \
-                             "movl 0(%2), %%ebx\n"                            \
-                             "movl %1,%%eax\n"                                \
-                             LSS_ENTRYPOINT                                   \
-                             "pop  %%ebx\n"                                   \
-                             "pop  %%ebp"                                     \
-                             : "=a" (__res)                                   \
-                             : "i" (__NR_##name),  "0" ((long)(&__s)),        \
-                               "c" ((long)(arg2)), "d" ((long)(arg3)),        \
-                               "S" ((long)(arg4)), "D" ((long)(arg5))         \
-                             : "memory");                                     \
-        LSS_RETURN(type,__res);                                               \
-      }
-    LSS_INLINE int LSS_NAME(clone)(int (*fn)(void *), void *child_stack,
-                                   int flags, void *arg, int *parent_tidptr,
-                                   void *newtls, int *child_tidptr) {
-      long __res;
-      __asm__ __volatile__(/* if (fn == NULL)
-                            *   return -EINVAL;
-                            */
-                           "movl   %3,%%ecx\n"
-                           "jecxz  1f\n"
-
-                           /* if (child_stack == NULL)
-                            *   return -EINVAL;
-                            */
-                           "movl   %4,%%ecx\n"
-                           "jecxz  1f\n"
-
-                           /* Set up alignment of the child stack:
-                            * child_stack = (child_stack & ~0xF) - 20;
-                            */
-                           "andl   $-16,%%ecx\n"
-                           "subl   $20,%%ecx\n"
-
-                           /* Push "arg" and "fn" onto the stack that will be
-                            * used by the child.
-                            */
-                           "movl   %6,%%eax\n"
-                           "movl   %%eax,4(%%ecx)\n"
-                           "movl   %3,%%eax\n"
-                           "movl   %%eax,(%%ecx)\n"
-
-                           /* %eax = syscall(%eax = __NR_clone,
-                            *                %ebx = flags,
-                            *                %ecx = child_stack,
-                            *                %edx = parent_tidptr,
-                            *                %esi = newtls,
-                            *                %edi = child_tidptr)
-                            * Also, make sure that %ebx gets preserved as it is
-                            * used in PIC mode.
-                            */
-                           "movl   %8,%%esi\n"
-                           "movl   %7,%%edx\n"
-                           "movl   %5,%%eax\n"
-                           "movl   %9,%%edi\n"
-                           "pushl  %%ebx\n"
-                           "movl   %%eax,%%ebx\n"
-                           "movl   %2,%%eax\n"
-                           LSS_ENTRYPOINT
-
-                           /* In the parent: restore %ebx
-                            * In the child:  move "fn" into %ebx
-                            */
-                           "popl   %%ebx\n"
-
-                           /* if (%eax != 0)
-                            *   return %eax;
-                            */
-                           "test   %%eax,%%eax\n"
-                           "jnz    1f\n"
-
-                           /* In the child, now. Terminate frame pointer chain.
-                            */
-                           "movl   $0,%%ebp\n"
-
-                           /* Call "fn". "arg" is already on the stack.
-                            */
-                           "call   *%%ebx\n"
-
-                           /* Call _exit(%ebx). Unfortunately older versions
-                            * of gcc restrict the number of arguments that can
-                            * be passed to asm(). So, we need to hard-code the
-                            * system call number.
-                            */
-                           "movl   %%eax,%%ebx\n"
-                           "movl   $1,%%eax\n"
-                           LSS_ENTRYPOINT
-
-                           /* Return to parent.
-                            */
-                         "1:\n"
-                           : "=a" (__res)
-                           : "0"(-EINVAL), "i"(__NR_clone),
-                             "m"(fn), "m"(child_stack), "m"(flags), "m"(arg),
-                             "m"(parent_tidptr), "m"(newtls), "m"(child_tidptr)
-                           : "memory", "ecx", "edx", "esi", "edi");
-      LSS_RETURN(int, __res);
-    }
-
-    LSS_INLINE _syscall1(int, set_thread_area, void *, u)
-    LSS_INLINE _syscall1(int, get_thread_area, void *, u)
-
-    LSS_INLINE void (*LSS_NAME(restore_rt)(void))(void) {
-      /* On i386, the kernel does not know how to return from a signal
-       * handler. Instead, it relies on user space to provide a
-       * restorer function that calls the {rt_,}sigreturn() system call.
-       * Unfortunately, we cannot just reference the glibc version of this
-       * function, as glibc goes out of its way to make it inaccessible.
-       */
-      void (*res)(void);
-      __asm__ __volatile__("call   2f\n"
-                         "0:.align 16\n"
-                         "1:movl   %1,%%eax\n"
-                           LSS_ENTRYPOINT
-                         "2:popl   %0\n"
-                           "addl   $(1b-0b),%0\n"
-                           : "=a" (res)
-                           : "i"  (__NR_rt_sigreturn));
-      return res;
-    }
-    LSS_INLINE void (*LSS_NAME(restore)(void))(void) {
-      /* On i386, the kernel does not know how to return from a signal
-       * handler. Instead, it relies on user space to provide a
-       * restorer function that calls the {rt_,}sigreturn() system call.
-       * Unfortunately, we cannot just reference the glibc version of this
-       * function, as glibc goes out of its way to make it inaccessible.
-       */
-      void (*res)(void);
-      __asm__ __volatile__("call   2f\n"
-                         "0:.align 16\n"
-                         "1:pop    %%eax\n"
-                           "movl   %1,%%eax\n"
-                           LSS_ENTRYPOINT
-                         "2:popl   %0\n"
-                           "addl   $(1b-0b),%0\n"
-                           : "=a" (res)
-                           : "i"  (__NR_sigreturn));
-      return res;
-    }
-  #elif defined(__x86_64__)
-    /* There are no known problems with any of the _syscallX() macros
-     * currently shipping for x86_64, but we still need to be able to define
-     * our own version so that we can override the location of the errno
-     * location (e.g. when using the clone() system call with the CLONE_VM
-     * option).
-     */
-    #undef LSS_ENTRYPOINT
-    #ifdef SYS_SYSCALL_ENTRYPOINT
-    static inline void (**LSS_NAME(get_syscall_entrypoint)(void))(void) {
-      void (**entrypoint)(void);
-      asm volatile(".bss\n"
-                   ".align 8\n"
-                   ".globl " SYS_SYSCALL_ENTRYPOINT "\n"
-                   ".common " SYS_SYSCALL_ENTRYPOINT ",8,8\n"
-                   ".previous\n"
-                   "mov " SYS_SYSCALL_ENTRYPOINT "@GOTPCREL(%%rip), %0\n"
-                   : "=r"(entrypoint));
-      return entrypoint;
-    }
-
-    #define LSS_ENTRYPOINT                                                    \
-              ".bss\n"                                                        \
-              ".align 8\n"                                                    \
-              ".globl " SYS_SYSCALL_ENTRYPOINT "\n"                           \
-              ".common " SYS_SYSCALL_ENTRYPOINT ",8,8\n"                      \
-              ".previous\n"                                                   \
-              "mov " SYS_SYSCALL_ENTRYPOINT "@GOTPCREL(%%rip), %%rcx\n"       \
-              "mov  0(%%rcx), %%rcx\n"                                        \
-              "test %%rcx, %%rcx\n"                                           \
-              "jz   10001f\n"                                                 \
-              "call *%%rcx\n"                                                 \
-              "jmp  10002f\n"                                                 \
-        "10001:syscall\n"                                                     \
-        "10002:\n"
-
-    #else
-    #define LSS_ENTRYPOINT "syscall\n"
-    #endif
-
-    /* The x32 ABI has 32 bit longs, but the syscall interface is 64 bit.
-     * We need to explicitly cast to an unsigned 64 bit type to avoid implicit
-     * sign extension.  We can't cast pointers directly because those are
-     * 32 bits, and gcc will dump ugly warnings about casting from a pointer
-     * to an integer of a different size.
-     */
-    #undef  LSS_SYSCALL_ARG
-    #define LSS_SYSCALL_ARG(a) ((uint64_t)(uintptr_t)(a))
-    #undef  _LSS_RETURN
-    #define _LSS_RETURN(type, res, cast)                                      \
-      do {                                                                    \
-        if ((uint64_t)(res) >= (uint64_t)(-4095)) {                           \
-          LSS_ERRNO = -(res);                                                 \
-          res = -1;                                                           \
-        }                                                                     \
-        return (type)(cast)(res);                                             \
-      } while (0)
-    #undef  LSS_RETURN
-    #define LSS_RETURN(type, res) _LSS_RETURN(type, res, uintptr_t)
-
-    #undef  _LSS_BODY
-    #define _LSS_BODY(nr, type, name, cast, ...)                              \
-          long long __res;                                                    \
-          __asm__ __volatile__(LSS_BODY_ASM##nr LSS_ENTRYPOINT                \
-            : "=a" (__res)                                                    \
-            : "0" (__NR_##name) LSS_BODY_ARG##nr(__VA_ARGS__)                 \
-            : LSS_BODY_CLOBBER##nr "r11", "rcx", "memory");                   \
-          _LSS_RETURN(type, __res, cast)
-    #undef  LSS_BODY
-    #define LSS_BODY(nr, type, name, args...) \
-      _LSS_BODY(nr, type, name, uintptr_t, ## args)
-
-    #undef  LSS_BODY_ASM0
-    #undef  LSS_BODY_ASM1
-    #undef  LSS_BODY_ASM2
-    #undef  LSS_BODY_ASM3
-    #undef  LSS_BODY_ASM4
-    #undef  LSS_BODY_ASM5
-    #undef  LSS_BODY_ASM6
-    #define LSS_BODY_ASM0
-    #define LSS_BODY_ASM1 LSS_BODY_ASM0
-    #define LSS_BODY_ASM2 LSS_BODY_ASM1
-    #define LSS_BODY_ASM3 LSS_BODY_ASM2
-    #define LSS_BODY_ASM4 LSS_BODY_ASM3 "movq %5,%%r10;"
-    #define LSS_BODY_ASM5 LSS_BODY_ASM4 "movq %6,%%r8;"
-    #define LSS_BODY_ASM6 LSS_BODY_ASM5 "movq %7,%%r9;"
-
-    #undef  LSS_BODY_CLOBBER0
-    #undef  LSS_BODY_CLOBBER1
-    #undef  LSS_BODY_CLOBBER2
-    #undef  LSS_BODY_CLOBBER3
-    #undef  LSS_BODY_CLOBBER4
-    #undef  LSS_BODY_CLOBBER5
-    #undef  LSS_BODY_CLOBBER6
-    #define LSS_BODY_CLOBBER0
-    #define LSS_BODY_CLOBBER1 LSS_BODY_CLOBBER0
-    #define LSS_BODY_CLOBBER2 LSS_BODY_CLOBBER1
-    #define LSS_BODY_CLOBBER3 LSS_BODY_CLOBBER2
-    #define LSS_BODY_CLOBBER4 LSS_BODY_CLOBBER3 "r10",
-    #define LSS_BODY_CLOBBER5 LSS_BODY_CLOBBER4 "r8",
-    #define LSS_BODY_CLOBBER6 LSS_BODY_CLOBBER5 "r9",
-
-    #undef  LSS_BODY_ARG0
-    #undef  LSS_BODY_ARG1
-    #undef  LSS_BODY_ARG2
-    #undef  LSS_BODY_ARG3
-    #undef  LSS_BODY_ARG4
-    #undef  LSS_BODY_ARG5
-    #undef  LSS_BODY_ARG6
-    #define LSS_BODY_ARG0()
-    #define LSS_BODY_ARG1(arg1) \
-      LSS_BODY_ARG0(), "D" (arg1)
-    #define LSS_BODY_ARG2(arg1, arg2) \
-      LSS_BODY_ARG1(arg1), "S" (arg2)
-    #define LSS_BODY_ARG3(arg1, arg2, arg3) \
-      LSS_BODY_ARG2(arg1, arg2), "d" (arg3)
-    #define LSS_BODY_ARG4(arg1, arg2, arg3, arg4) \
-      LSS_BODY_ARG3(arg1, arg2, arg3), "r" (arg4)
-    #define LSS_BODY_ARG5(arg1, arg2, arg3, arg4, arg5) \
-      LSS_BODY_ARG4(arg1, arg2, arg3, arg4), "r" (arg5)
-    #define LSS_BODY_ARG6(arg1, arg2, arg3, arg4, arg5, arg6) \
-      LSS_BODY_ARG5(arg1, arg2, arg3, arg4, arg5), "r" (arg6)
-
-    #undef _syscall0
-    #define _syscall0(type,name)                                              \
-      type LSS_NAME(name)(void) {                                             \
-        LSS_BODY(0, type, name);                                              \
-      }
-    #undef _syscall1
-    #define _syscall1(type,name,type1,arg1)                                   \
-      type LSS_NAME(name)(type1 arg1) {                                       \
-        LSS_BODY(1, type, name, LSS_SYSCALL_ARG(arg1));                       \
-      }
-    #undef _syscall2
-    #define _syscall2(type,name,type1,arg1,type2,arg2)                        \
-      type LSS_NAME(name)(type1 arg1, type2 arg2) {                           \
-        LSS_BODY(2, type, name, LSS_SYSCALL_ARG(arg1), LSS_SYSCALL_ARG(arg2));\
-      }
-    #undef _syscall3
-    #define _syscall3(type,name,type1,arg1,type2,arg2,type3,arg3)             \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3) {               \
-        LSS_BODY(3, type, name, LSS_SYSCALL_ARG(arg1), LSS_SYSCALL_ARG(arg2), \
-                                LSS_SYSCALL_ARG(arg3));                       \
-      }
-    #undef _syscall4
-    #define _syscall4(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4)  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4) {   \
-        LSS_BODY(4, type, name, LSS_SYSCALL_ARG(arg1), LSS_SYSCALL_ARG(arg2), \
-                                LSS_SYSCALL_ARG(arg3), LSS_SYSCALL_ARG(arg4));\
-      }
-    #undef _syscall5
-    #define _syscall5(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5)                                             \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5) {                                       \
-        LSS_BODY(5, type, name, LSS_SYSCALL_ARG(arg1), LSS_SYSCALL_ARG(arg2), \
-                                LSS_SYSCALL_ARG(arg3), LSS_SYSCALL_ARG(arg4), \
-                                LSS_SYSCALL_ARG(arg5));                       \
-      }
-    #undef _syscall6
-    #define _syscall6(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5,type6,arg6)                                  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5, type6 arg6) {                           \
-        LSS_BODY(6, type, name, LSS_SYSCALL_ARG(arg1), LSS_SYSCALL_ARG(arg2), \
-                                LSS_SYSCALL_ARG(arg3), LSS_SYSCALL_ARG(arg4), \
-                                LSS_SYSCALL_ARG(arg5), LSS_SYSCALL_ARG(arg6));\
-      }
-    LSS_INLINE int LSS_NAME(clone)(int (*fn)(void *), void *child_stack,
-                                   int flags, void *arg, int *parent_tidptr,
-                                   void *newtls, int *child_tidptr) {
-      long long __res;
-      {
-        __asm__ __volatile__(/* if (fn == NULL)
-                              *   return -EINVAL;
-                              */
-                             "testq  %4,%4\n"
-                             "jz     1f\n"
-
-                             /* if (child_stack == NULL)
-                              *   return -EINVAL;
-                              */
-                             "testq  %5,%5\n"
-                             "jz     1f\n"
-
-                             /* childstack -= 2*sizeof(void *);
-                              */
-                             "subq   $16,%5\n"
-
-                             /* Push "arg" and "fn" onto the stack that will be
-                              * used by the child.
-                              */
-                             "movq   %7,8(%5)\n"
-                             "movq   %4,0(%5)\n"
-
-                             /* %rax = syscall(%rax = __NR_clone,
-                              *                %rdi = flags,
-                              *                %rsi = child_stack,
-                              *                %rdx = parent_tidptr,
-                              *                %r8  = new_tls,
-                              *                %r10 = child_tidptr)
-                              */
-                             "movq   %2,%%rax\n"
-                             "movq   %9,%%r8\n"
-                             "movq   %10,%%r10\n"
-                             LSS_ENTRYPOINT
-
-                             /* if (%rax != 0)
-                              *   return;
-                              */
-                             "testq  %%rax,%%rax\n"
-                             "jnz    1f\n"
-
-                             /* In the child. Terminate frame pointer chain.
-                              */
-                             "xorq   %%rbp,%%rbp\n"
-
-                             /* Call "fn(arg)".
-                              */
-                             "popq   %%rax\n"
-                             "popq   %%rdi\n"
-                             "call   *%%rax\n"
-
-                             /* Call _exit(%ebx).
-                              */
-                             "movq   %%rax,%%rdi\n"
-                             "movq   %3,%%rax\n"
-                             LSS_ENTRYPOINT
-
-                             /* Return to parent.
-                              */
-                           "1:\n"
-                             : "=a" (__res)
-                             : "0"(-EINVAL), "i"(__NR_clone), "i"(__NR_exit),
-                               "r"(LSS_SYSCALL_ARG(fn)),
-                               "S"(LSS_SYSCALL_ARG(child_stack)),
-                               "D"(LSS_SYSCALL_ARG(flags)),
-                               "r"(LSS_SYSCALL_ARG(arg)),
-                               "d"(LSS_SYSCALL_ARG(parent_tidptr)),
-                               "r"(LSS_SYSCALL_ARG(newtls)),
-                               "r"(LSS_SYSCALL_ARG(child_tidptr))
-                             : "memory", "r8", "r10", "r11", "rcx");
-      }
-      LSS_RETURN(int, __res);
-    }
-    LSS_INLINE _syscall2(int, arch_prctl, int, c, void *, a)
-
-    LSS_INLINE void (*LSS_NAME(restore_rt)(void))(void) {
-      /* On x86-64, the kernel does not know how to return from
-       * a signal handler. Instead, it relies on user space to provide a
-       * restorer function that calls the rt_sigreturn() system call.
-       * Unfortunately, we cannot just reference the glibc version of this
-       * function, as glibc goes out of its way to make it inaccessible.
-       */
-      long long res;
-      __asm__ __volatile__("jmp    2f\n"
-                           ".align 16\n"
-                         "1:movq   %1,%%rax\n"
-                           LSS_ENTRYPOINT
-                         "2:leaq   1b(%%rip),%0\n"
-                           : "=r" (res)
-                           : "i"  (__NR_rt_sigreturn));
-      return (void (*)(void))(uintptr_t)res;
-    }
-  #elif defined(__ARM_ARCH_3__)
-    /* Most definitions of _syscallX() neglect to mark "memory" as being
-     * clobbered. This causes problems with compilers, that do a better job
-     * at optimizing across __asm__ calls.
-     * So, we just have to redefine all of the _syscallX() macros.
-     */
-    #undef LSS_REG
-    #define LSS_REG(r,a) register long __r##r __asm__("r"#r) = (long)a
-    #undef  LSS_BODY
-    #define LSS_BODY(type,name,args...)                                       \
-          register long __res_r0 __asm__("r0");                               \
-          long __res;                                                         \
-          __asm__ __volatile__ (__syscall(name)                               \
-                                : "=r"(__res_r0) : args : "lr", "memory");    \
-          __res = __res_r0;                                                   \
-          LSS_RETURN(type, __res)
-    #undef _syscall0
-    #define _syscall0(type, name)                                             \
-      type LSS_NAME(name)(void) {                                             \
-        LSS_BODY(type, name);                                                 \
-      }
-    #undef _syscall1
-    #define _syscall1(type, name, type1, arg1)                                \
-      type LSS_NAME(name)(type1 arg1) {                                       \
-        LSS_REG(0, arg1); LSS_BODY(type, name, "r"(__r0));                    \
-      }
-    #undef _syscall2
-    #define _syscall2(type, name, type1, arg1, type2, arg2)                   \
-      type LSS_NAME(name)(type1 arg1, type2 arg2) {                           \
-        LSS_REG(0, arg1); LSS_REG(1, arg2);                                   \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1));                           \
-      }
-    #undef _syscall3
-    #define _syscall3(type, name, type1, arg1, type2, arg2, type3, arg3)      \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3) {               \
-        LSS_REG(0, arg1); LSS_REG(1, arg2); LSS_REG(2, arg3);                 \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1), "r"(__r2));                \
-      }
-    #undef _syscall4
-    #define _syscall4(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4)  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4) {   \
-        LSS_REG(0, arg1); LSS_REG(1, arg2); LSS_REG(2, arg3);                 \
-        LSS_REG(3, arg4);                                                     \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1), "r"(__r2), "r"(__r3));     \
-      }
-    #undef _syscall5
-    #define _syscall5(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5)                                             \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5) {                                       \
-        LSS_REG(0, arg1); LSS_REG(1, arg2); LSS_REG(2, arg3);                 \
-        LSS_REG(3, arg4); LSS_REG(4, arg5);                                   \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1), "r"(__r2), "r"(__r3),      \
-                             "r"(__r4));                                      \
-      }
-    #undef _syscall6
-    #define _syscall6(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5,type6,arg6)                                  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5, type6 arg6) {                           \
-        LSS_REG(0, arg1); LSS_REG(1, arg2); LSS_REG(2, arg3);                 \
-        LSS_REG(3, arg4); LSS_REG(4, arg5); LSS_REG(5, arg6);                 \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1), "r"(__r2), "r"(__r3),      \
-                             "r"(__r4), "r"(__r5));                           \
-      }
-    LSS_INLINE int LSS_NAME(clone)(int (*fn)(void *), void *child_stack,
-                                   int flags, void *arg, int *parent_tidptr,
-                                   void *newtls, int *child_tidptr) {
-      long __res;
-      {
-        register int   __flags __asm__("r0") = flags;
-        register void *__stack __asm__("r1") = child_stack;
-        register void *__ptid  __asm__("r2") = parent_tidptr;
-        register void *__tls   __asm__("r3") = newtls;
-        register int  *__ctid  __asm__("r4") = child_tidptr;
-        __asm__ __volatile__(/* if (fn == NULL || child_stack == NULL)
-                              *   return -EINVAL;
-                              */
-                             "cmp   %2,#0\n"
-                             "cmpne %3,#0\n"
-                             "moveq %0,%1\n"
-                             "beq   1f\n"
-
-                             /* Push "arg" and "fn" onto the stack that will be
-                              * used by the child.
-                              */
-                             "str   %5,[%3,#-4]!\n"
-                             "str   %2,[%3,#-4]!\n"
-
-                             /* %r0 = syscall(%r0 = flags,
-                              *               %r1 = child_stack,
-                              *               %r2 = parent_tidptr,
-                              *               %r3 = newtls,
-                              *               %r4 = child_tidptr)
-                              */
-                             __syscall(clone)"\n"
-
-                             /* if (%r0 != 0)
-                              *   return %r0;
-                              */
-                             "movs  %0,r0\n"
-                             "bne   1f\n"
-
-                             /* In the child, now. Call "fn(arg)".
-                              */
-                             "ldr   r0,[sp, #4]\n"
-                             "mov   lr,pc\n"
-                             "ldr   pc,[sp]\n"
-
-                             /* Call _exit(%r0).
-                              */
-                             __syscall(exit)"\n"
-                           "1:\n"
-                             : "=r" (__res)
-                             : "i"(-EINVAL),
-                               "r"(fn), "r"(__stack), "r"(__flags), "r"(arg),
-                               "r"(__ptid), "r"(__tls), "r"(__ctid)
-                             : "cc", "lr", "memory");
-      }
-      LSS_RETURN(int, __res);
-    }
-  #elif defined(__ARM_EABI__)
-    /* Most definitions of _syscallX() neglect to mark "memory" as being
-     * clobbered. This causes problems with compilers, that do a better job
-     * at optimizing across __asm__ calls.
-     * So, we just have to redefine all fo the _syscallX() macros.
-     */
-    #undef LSS_REG
-    #define LSS_REG(r,a) register long __r##r __asm__("r"#r) = (long)a
-    #undef  LSS_BODY
-    #define LSS_BODY(type,name,args...)                                       \
-          register long __res_r0 __asm__("r0");                               \
-          long __res;                                                         \
-          __asm__ __volatile__ ("push {r7}\n"                                 \
-                                "mov r7, %1\n"                                \
-                                "swi 0x0\n"                                   \
-                                "pop {r7}\n"                                  \
-                                : "=r"(__res_r0)                              \
-                                : "i"(__NR_##name) , ## args                  \
-                                : "lr", "memory");                            \
-          __res = __res_r0;                                                   \
-          LSS_RETURN(type, __res)
-    #undef _syscall0
-    #define _syscall0(type, name)                                             \
-      type LSS_NAME(name)(void) {                                             \
-        LSS_BODY(type, name);                                                 \
-      }
-    #undef _syscall1
-    #define _syscall1(type, name, type1, arg1)                                \
-      type LSS_NAME(name)(type1 arg1) {                                       \
-        LSS_REG(0, arg1); LSS_BODY(type, name, "r"(__r0));                    \
-      }
-    #undef _syscall2
-    #define _syscall2(type, name, type1, arg1, type2, arg2)                   \
-      type LSS_NAME(name)(type1 arg1, type2 arg2) {                           \
-        LSS_REG(0, arg1); LSS_REG(1, arg2);                                   \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1));                           \
-      }
-    #undef _syscall3
-    #define _syscall3(type, name, type1, arg1, type2, arg2, type3, arg3)      \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3) {               \
-        LSS_REG(0, arg1); LSS_REG(1, arg2); LSS_REG(2, arg3);                 \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1), "r"(__r2));                \
-      }
-    #undef _syscall4
-    #define _syscall4(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4)  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4) {   \
-        LSS_REG(0, arg1); LSS_REG(1, arg2); LSS_REG(2, arg3);                 \
-        LSS_REG(3, arg4);                                                     \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1), "r"(__r2), "r"(__r3));     \
-      }
-    #undef _syscall5
-    #define _syscall5(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5)                                             \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5) {                                       \
-        LSS_REG(0, arg1); LSS_REG(1, arg2); LSS_REG(2, arg3);                 \
-        LSS_REG(3, arg4); LSS_REG(4, arg5);                                   \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1), "r"(__r2), "r"(__r3),      \
-                             "r"(__r4));                                      \
-      }
-    #undef _syscall6
-    #define _syscall6(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5,type6,arg6)                                  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5, type6 arg6) {                           \
-        LSS_REG(0, arg1); LSS_REG(1, arg2); LSS_REG(2, arg3);                 \
-        LSS_REG(3, arg4); LSS_REG(4, arg5); LSS_REG(5, arg6);                 \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1), "r"(__r2), "r"(__r3),      \
-                             "r"(__r4), "r"(__r5));                           \
-      }
-    LSS_INLINE int LSS_NAME(clone)(int (*fn)(void *), void *child_stack,
-                                   int flags, void *arg, int *parent_tidptr,
-                                   void *newtls, int *child_tidptr) {
-      long __res;
-      if (fn == NULL || child_stack == NULL) {
-        __res = -EINVAL;
-        LSS_RETURN(int, __res);
-      }
-
-      /* Push "arg" and "fn" onto the stack that will be
-       * used by the child.
-       */
-      {
-        uintptr_t* cstack = (uintptr_t*)child_stack - 2;
-        cstack[0] = (uintptr_t)fn;
-        cstack[1] = (uintptr_t)arg;
-        child_stack = cstack;
-      }
-      {
-        register int   __flags __asm__("r0") = flags;
-        register void *__stack __asm__("r1") = child_stack;
-        register void *__ptid  __asm__("r2") = parent_tidptr;
-        register void *__tls   __asm__("r3") = newtls;
-        register int  *__ctid  __asm__("r4") = child_tidptr;
-        __asm__ __volatile__(
-#ifdef __thumb2__
-            "push {r7}\n"
-#endif
-            /* %r0 = syscall(%r0 = flags,
-             *               %r1 = child_stack,
-             *               %r2 = parent_tidptr,
-             *               %r3 = newtls,
-             *               %r4 = child_tidptr)
-             */
-            "mov r7, %6\n"
-            "swi 0x0\n"
-
-            /* if (%r0 != 0)
-             *   return %r0;
-             */
-            "cmp   r0, #0\n"
-            "bne   1f\n"
-
-            /* In the child, now. Call "fn(arg)".
-             */
-            "ldr   r0,[sp, #4]\n"
-
-            "ldr   lr,[sp]\n"
-            "blx   lr\n"
-
-            /* Call _exit(%r0).
-             */
-            "mov r7, %7\n"
-            "swi 0x0\n"
-            /* Unreachable */
-            "bkpt #0\n"
-         "1:\n"
-#ifdef __thumb2__
-            "pop {r7}\n"
-#endif
-            "movs  %0,r0\n"
-            : "=r"(__res)
-            : "r"(__stack), "r"(__flags), "r"(__ptid), "r"(__tls), "r"(__ctid),
-              "i"(__NR_clone), "i"(__NR_exit)
-            : "cc", "lr", "memory"
-#ifndef __thumb2__
-            , "r7"
-#endif
-            );
-      }
-      LSS_RETURN(int, __res);
-    }
-  #elif defined(__aarch64__)
-    /* Most definitions of _syscallX() neglect to mark "memory" as being
-     * clobbered. This causes problems with compilers, that do a better job
-     * at optimizing across __asm__ calls.
-     * So, we just have to redefine all of the _syscallX() macros.
-     */
-    #undef LSS_REG
-    #define LSS_REG(r,a) register int64_t __r##r __asm__("x"#r) = (int64_t)a
-    #undef  LSS_BODY
-    #define LSS_BODY(type,name,args...)                                       \
-          register int64_t __res_x0 __asm__("x0");                            \
-          int64_t __res;                                                      \
-          __asm__ __volatile__ ("mov x8, %1\n"                                \
-                                "svc 0x0\n"                                   \
-                                : "=r"(__res_x0)                              \
-                                : "i"(__NR_##name) , ## args                  \
-                                : "x8", "memory");                            \
-          __res = __res_x0;                                                   \
-          LSS_RETURN(type, __res)
-    #undef _syscall0
-    #define _syscall0(type, name)                                             \
-      type LSS_NAME(name)(void) {                                             \
-        LSS_BODY(type, name);                                                 \
-      }
-    #undef _syscall1
-    #define _syscall1(type, name, type1, arg1)                                \
-      type LSS_NAME(name)(type1 arg1) {                                       \
-        LSS_REG(0, arg1); LSS_BODY(type, name, "r"(__r0));                    \
-      }
-    #undef _syscall2
-    #define _syscall2(type, name, type1, arg1, type2, arg2)                   \
-      type LSS_NAME(name)(type1 arg1, type2 arg2) {                           \
-        LSS_REG(0, arg1); LSS_REG(1, arg2);                                   \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1));                           \
-      }
-    #undef _syscall3
-    #define _syscall3(type, name, type1, arg1, type2, arg2, type3, arg3)      \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3) {               \
-        LSS_REG(0, arg1); LSS_REG(1, arg2); LSS_REG(2, arg3);                 \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1), "r"(__r2));                \
-      }
-    #undef _syscall4
-    #define _syscall4(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4)  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4) {   \
-        LSS_REG(0, arg1); LSS_REG(1, arg2); LSS_REG(2, arg3);                 \
-        LSS_REG(3, arg4);                                                     \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1), "r"(__r2), "r"(__r3));     \
-      }
-    #undef _syscall5
-    #define _syscall5(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5)                                             \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5) {                                       \
-        LSS_REG(0, arg1); LSS_REG(1, arg2); LSS_REG(2, arg3);                 \
-        LSS_REG(3, arg4); LSS_REG(4, arg5);                                   \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1), "r"(__r2), "r"(__r3),      \
-                             "r"(__r4));                                      \
-      }
-    #undef _syscall6
-    #define _syscall6(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5,type6,arg6)                                  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5, type6 arg6) {                           \
-        LSS_REG(0, arg1); LSS_REG(1, arg2); LSS_REG(2, arg3);                 \
-        LSS_REG(3, arg4); LSS_REG(4, arg5); LSS_REG(5, arg6);                 \
-        LSS_BODY(type, name, "r"(__r0), "r"(__r1), "r"(__r2), "r"(__r3),      \
-                             "r"(__r4), "r"(__r5));                           \
-      }
-
-    LSS_INLINE int LSS_NAME(clone)(int (*fn)(void *), void *child_stack,
-                                   int flags, void *arg, int *parent_tidptr,
-                                   void *newtls, int *child_tidptr) {
-      int64_t __res;
-      {
-        register uint64_t __flags __asm__("x0") = flags;
-        register void *__stack __asm__("x1") = child_stack;
-        register void *__ptid  __asm__("x2") = parent_tidptr;
-        register void *__tls   __asm__("x3") = newtls;
-        register int  *__ctid  __asm__("x4") = child_tidptr;
-        __asm__ __volatile__(/* Push "arg" and "fn" onto the stack that will be
-                              * used by the child.
-                              */
-                             "stp     %1, %4, [%2, #-16]!\n"
-
-                             /* %x0 = syscall(%x0 = flags,
-                              *               %x1 = child_stack,
-                              *               %x2 = parent_tidptr,
-                              *               %x3 = newtls,
-                              *               %x4 = child_tidptr)
-                              */
-                             "mov     x8, %8\n"
-                             "svc     0x0\n"
-
-                             /* if (%r0 != 0)
-                              *   return %r0;
-                              */
-                             "mov     %0, x0\n"
-                             "cbnz    x0, 1f\n"
-
-                             /* In the child, now. Call "fn(arg)".
-                              */
-                             "ldp     x1, x0, [sp], #16\n"
-                             "blr     x1\n"
-
-                             /* Call _exit(%r0).
-                              */
-                             "mov     x8, %9\n"
-                             "svc     0x0\n"
-                           "1:\n"
-                             : "=r" (__res)
-                             : "r"(fn), "r"(__stack), "r"(__flags), "r"(arg),
-                               "r"(__ptid), "r"(__tls), "r"(__ctid),
-                               "i"(__NR_clone), "i"(__NR_exit)
-                             : "cc", "x8", "memory");
-      }
-      LSS_RETURN(int, __res);
-    }
-  #elif defined(__mips__)
-    #undef LSS_REG
-    #define LSS_REG(r,a) register unsigned long __r##r __asm__("$"#r) =       \
-                                 (unsigned long)(a)
-    #undef  LSS_BODY
-    #undef LSS_SYSCALL_CLOBBERS
-    #if _MIPS_SIM == _MIPS_SIM_ABI32
-    #define LSS_SYSCALL_CLOBBERS "$1", "$3", "$8", "$9", "$10",               \
-                                 "$11", "$12", "$13", "$14", "$15",           \
-                                 "$24", "$25", "hi", "lo", "memory"
-    #else
-    #define LSS_SYSCALL_CLOBBERS "$1", "$3", "$10", "$11", "$12",             \
-                                 "$13", "$14", "$15", "$24", "$25",           \
-                                 "hi", "lo", "memory"
-    #endif
-    #define LSS_BODY(type,name,r7,...)                                        \
-          register unsigned long __v0 __asm__("$2") = __NR_##name;            \
-          __asm__ __volatile__ ("syscall\n"                                   \
-                                : "=r"(__v0), r7 (__r7)                       \
-                                : "0"(__v0), ##__VA_ARGS__                    \
-                                : LSS_SYSCALL_CLOBBERS);                      \
-          LSS_RETURN(type, __v0, __r7)
-    #undef _syscall0
-    #define _syscall0(type, name)                                             \
-      type LSS_NAME(name)(void) {                                             \
-        register unsigned long __r7 __asm__("$7");                            \
-        LSS_BODY(type, name, "=r");                                           \
-      }
-    #undef _syscall1
-    #define _syscall1(type, name, type1, arg1)                                \
-      type LSS_NAME(name)(type1 arg1) {                                       \
-        register unsigned long __r7 __asm__("$7");                            \
-        LSS_REG(4, arg1); LSS_BODY(type, name, "=r", "r"(__r4));              \
-      }
-    #undef _syscall2
-    #define _syscall2(type, name, type1, arg1, type2, arg2)                   \
-      type LSS_NAME(name)(type1 arg1, type2 arg2) {                           \
-        register unsigned long __r7 __asm__("$7");                            \
-        LSS_REG(4, arg1); LSS_REG(5, arg2);                                   \
-        LSS_BODY(type, name, "=r", "r"(__r4), "r"(__r5));                     \
-      }
-    #undef _syscall3
-    #define _syscall3(type, name, type1, arg1, type2, arg2, type3, arg3)      \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3) {               \
-        register unsigned long __r7 __asm__("$7");                            \
-        LSS_REG(4, arg1); LSS_REG(5, arg2); LSS_REG(6, arg3);                 \
-        LSS_BODY(type, name, "=r", "r"(__r4), "r"(__r5), "r"(__r6));          \
-      }
-    #undef _syscall4
-    #define _syscall4(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4)  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4) {   \
-        LSS_REG(4, arg1); LSS_REG(5, arg2); LSS_REG(6, arg3);                 \
-        LSS_REG(7, arg4);                                                     \
-        LSS_BODY(type, name, "+r", "r"(__r4), "r"(__r5), "r"(__r6));          \
-      }
-    #undef _syscall5
-    #if _MIPS_SIM == _MIPS_SIM_ABI32
-    /* The old 32bit MIPS system call API passes the fifth and sixth argument
-     * on the stack, whereas the new APIs use registers "r8" and "r9".
-     */
-    #define _syscall5(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5)                                             \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5) {                                       \
-        LSS_REG(4, arg1); LSS_REG(5, arg2); LSS_REG(6, arg3);                 \
-        LSS_REG(7, arg4);                                                     \
-        register unsigned long __v0 __asm__("$2") = __NR_##name;              \
-        __asm__ __volatile__ (".set noreorder\n"                              \
-                              "subu  $29, 32\n"                               \
-                              "sw    %5, 16($29)\n"                           \
-                              "syscall\n"                                     \
-                              "addiu $29, 32\n"                               \
-                              ".set reorder\n"                                \
-                              : "+r"(__v0), "+r" (__r7)                       \
-                              : "r"(__r4), "r"(__r5),                         \
-                                "r"(__r6), "r" ((unsigned long)arg5)          \
-                              : "$8", "$9", "$10", "$11", "$12",              \
-                                "$13", "$14", "$15", "$24", "$25",            \
-                                "memory");                                    \
-        LSS_RETURN(type, __v0, __r7);                                         \
-      }
-    #else
-    #define _syscall5(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5)                                             \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5) {                                       \
-        LSS_REG(4, arg1); LSS_REG(5, arg2); LSS_REG(6, arg3);                 \
-        LSS_REG(7, arg4); LSS_REG(8, arg5);                                   \
-        LSS_BODY(type, name, "+r", "r"(__r4), "r"(__r5), "r"(__r6),           \
-                 "r"(__r8));                                                  \
-      }
-    #endif
-    #undef _syscall6
-    #if _MIPS_SIM == _MIPS_SIM_ABI32
-    /* The old 32bit MIPS system call API passes the fifth and sixth argument
-     * on the stack, whereas the new APIs use registers "r8" and "r9".
-     */
-    #define _syscall6(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5,type6,arg6)                                  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5, type6 arg6) {                           \
-        LSS_REG(4, arg1); LSS_REG(5, arg2); LSS_REG(6, arg3);                 \
-        LSS_REG(7, arg4);                                                     \
-        register unsigned long __v0 __asm__("$2") = __NR_##name;              \
-        __asm__ __volatile__ (".set noreorder\n"                              \
-                              "subu  $29, 32\n"                               \
-                              "sw    %5, 16($29)\n"                           \
-                              "sw    %6, 20($29)\n"                           \
-                              "syscall\n"                                     \
-                              "addiu $29, 32\n"                               \
-                              ".set reorder\n"                                \
-                              : "+r"(__v0), "+r" (__r7)                       \
-                              : "r"(__r4), "r"(__r5),                         \
-                                "r"(__r6), "r" ((unsigned long)arg5),         \
-                                "r" ((unsigned long)arg6)                     \
-                              : "$8", "$9", "$10", "$11", "$12",              \
-                                "$13", "$14", "$15", "$24", "$25",            \
-                                "memory");                                    \
-        LSS_RETURN(type, __v0, __r7);                                         \
-      }
-    #else
-    #define _syscall6(type,name,type1,arg1,type2,arg2,type3,arg3,type4,arg4,  \
-                      type5,arg5,type6,arg6)                                  \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,     \
-                          type5 arg5,type6 arg6) {                            \
-        LSS_REG(4, arg1); LSS_REG(5, arg2); LSS_REG(6, arg3);                 \
-        LSS_REG(7, arg4); LSS_REG(8, arg5); LSS_REG(9, arg6);                 \
-        LSS_BODY(type, name, "+r", "r"(__r4), "r"(__r5), "r"(__r6),           \
-                 "r"(__r8), "r"(__r9));                                       \
-      }
-    #endif
-    LSS_INLINE int LSS_NAME(clone)(int (*fn)(void *), void *child_stack,
-                                   int flags, void *arg, int *parent_tidptr,
-                                   void *newtls, int *child_tidptr) {
-      register unsigned long __v0 __asm__("$2") = -EINVAL;
-      register unsigned long __r7 __asm__("$7") = (unsigned long)newtls;
-      {
-        register int   __flags __asm__("$4") = flags;
-        register void *__stack __asm__("$5") = child_stack;
-        register void *__ptid  __asm__("$6") = parent_tidptr;
-        register int  *__ctid  __asm__("$8") = child_tidptr;
-        __asm__ __volatile__(
-          #if _MIPS_SIM == _MIPS_SIM_ABI32 && _MIPS_SZPTR == 32
-                             "subu  $29,24\n"
-          #elif _MIPS_SIM == _MIPS_SIM_NABI32
-                             "sub   $29,16\n"
-          #else
-                             "dsubu $29,16\n"
-          #endif
-
-                             /* if (fn == NULL || child_stack == NULL)
-                              *   return -EINVAL;
-                              */
-                             "beqz  %4,1f\n"
-                             "beqz  %5,1f\n"
-
-                             /* Push "arg" and "fn" onto the stack that will be
-                              * used by the child.
-                              */
-          #if _MIPS_SIM == _MIPS_SIM_ABI32 && _MIPS_SZPTR == 32
-                             "subu  %5,32\n"
-                             "sw    %4,0(%5)\n"
-                             "sw    %7,4(%5)\n"
-          #elif _MIPS_SIM == _MIPS_SIM_NABI32
-                             "sub   %5,32\n"
-                             "sw    %4,0(%5)\n"
-                             "sw    %7,8(%5)\n"
-          #else
-                             "dsubu %5,32\n"
-                             "sd    %4,0(%5)\n"
-                             "sd    %7,8(%5)\n"
-          #endif
-
-                             /* $7 = syscall($4 = flags,
-                              *              $5 = child_stack,
-                              *              $6 = parent_tidptr,
-                              *              $7 = newtls,
-                              *              $8 = child_tidptr)
-                              */
-                             "li    $2,%2\n"
-                             "syscall\n"
-
-                             /* if ($7 != 0)
-                              *   return $2;
-                              */
-                             "bnez  $7,1f\n"
-                             "bnez  $2,1f\n"
-
-                             /* In the child, now. Call "fn(arg)".
-                              */
-          #if _MIPS_SIM == _MIPS_SIM_ABI32 && _MIPS_SZPTR == 32
-                            "lw    $25,0($29)\n"
-                            "lw    $4,4($29)\n"
-          #elif _MIPS_SIM == _MIPS_SIM_NABI32
-                            "lw    $25,0($29)\n"
-                            "lw    $4,8($29)\n"
-          #else
-                            "ld    $25,0($29)\n"
-                            "ld    $4,8($29)\n"
-          #endif
-                            "jalr  $25\n"
-
-                             /* Call _exit($2)
-                              */
-                            "move  $4,$2\n"
-                            "li    $2,%3\n"
-                            "syscall\n"
-
-                           "1:\n"
-          #if _MIPS_SIM == _MIPS_SIM_ABI32 && _MIPS_SZPTR == 32
-                             "addu  $29, 24\n"
-          #elif _MIPS_SIM == _MIPS_SIM_NABI32
-                             "add   $29, 16\n"
-          #else
-                             "daddu $29,16\n"
-          #endif
-                             : "+r" (__v0), "+r" (__r7)
-                             : "i"(__NR_clone), "i"(__NR_exit), "r"(fn),
-                               "r"(__stack), "r"(__flags), "r"(arg),
-                               "r"(__ptid), "r"(__ctid)
-                             : "$9", "$10", "$11", "$12", "$13", "$14", "$15",
-                               "$24", "$25", "memory");
-      }
-      LSS_RETURN(int, __v0, __r7);
-    }
-  #elif defined (__PPC__)
-    #undef  LSS_LOADARGS_0
-    #define LSS_LOADARGS_0(name, dummy...)                                    \
-        __sc_0 = __NR_##name
-    #undef  LSS_LOADARGS_1
-    #define LSS_LOADARGS_1(name, arg1)                                        \
-            LSS_LOADARGS_0(name);                                             \
-            __sc_3 = (unsigned long) (arg1)
-    #undef  LSS_LOADARGS_2
-    #define LSS_LOADARGS_2(name, arg1, arg2)                                  \
-            LSS_LOADARGS_1(name, arg1);                                       \
-            __sc_4 = (unsigned long) (arg2)
-    #undef  LSS_LOADARGS_3
-    #define LSS_LOADARGS_3(name, arg1, arg2, arg3)                            \
-            LSS_LOADARGS_2(name, arg1, arg2);                                 \
-            __sc_5 = (unsigned long) (arg3)
-    #undef  LSS_LOADARGS_4
-    #define LSS_LOADARGS_4(name, arg1, arg2, arg3, arg4)                      \
-            LSS_LOADARGS_3(name, arg1, arg2, arg3);                           \
-            __sc_6 = (unsigned long) (arg4)
-    #undef  LSS_LOADARGS_5
-    #define LSS_LOADARGS_5(name, arg1, arg2, arg3, arg4, arg5)                \
-            LSS_LOADARGS_4(name, arg1, arg2, arg3, arg4);                     \
-            __sc_7 = (unsigned long) (arg5)
-    #undef  LSS_LOADARGS_6
-    #define LSS_LOADARGS_6(name, arg1, arg2, arg3, arg4, arg5, arg6)          \
-            LSS_LOADARGS_5(name, arg1, arg2, arg3, arg4, arg5);               \
-            __sc_8 = (unsigned long) (arg6)
-    #undef  LSS_ASMINPUT_0
-    #define LSS_ASMINPUT_0 "0" (__sc_0)
-    #undef  LSS_ASMINPUT_1
-    #define LSS_ASMINPUT_1 LSS_ASMINPUT_0, "1" (__sc_3)
-    #undef  LSS_ASMINPUT_2
-    #define LSS_ASMINPUT_2 LSS_ASMINPUT_1, "2" (__sc_4)
-    #undef  LSS_ASMINPUT_3
-    #define LSS_ASMINPUT_3 LSS_ASMINPUT_2, "3" (__sc_5)
-    #undef  LSS_ASMINPUT_4
-    #define LSS_ASMINPUT_4 LSS_ASMINPUT_3, "4" (__sc_6)
-    #undef  LSS_ASMINPUT_5
-    #define LSS_ASMINPUT_5 LSS_ASMINPUT_4, "5" (__sc_7)
-    #undef  LSS_ASMINPUT_6
-    #define LSS_ASMINPUT_6 LSS_ASMINPUT_5, "6" (__sc_8)
-    #undef  LSS_BODY
-    #define LSS_BODY(nr, type, name, args...)                                 \
-        long __sc_ret, __sc_err;                                              \
-        {                                                                     \
-                        register unsigned long __sc_0 __asm__ ("r0");         \
-                        register unsigned long __sc_3 __asm__ ("r3");         \
-                        register unsigned long __sc_4 __asm__ ("r4");         \
-                        register unsigned long __sc_5 __asm__ ("r5");         \
-                        register unsigned long __sc_6 __asm__ ("r6");         \
-                        register unsigned long __sc_7 __asm__ ("r7");         \
-                        register unsigned long __sc_8 __asm__ ("r8");         \
-                                                                              \
-            LSS_LOADARGS_##nr(name, args);                                    \
-            __asm__ __volatile__                                              \
-                ("sc\n\t"                                                     \
-                 "mfcr %0"                                                    \
-                 : "=&r" (__sc_0),                                            \
-                   "=&r" (__sc_3), "=&r" (__sc_4),                            \
-                   "=&r" (__sc_5), "=&r" (__sc_6),                            \
-                   "=&r" (__sc_7), "=&r" (__sc_8)                             \
-                 : LSS_ASMINPUT_##nr                                          \
-                 : "cr0", "ctr", "memory",                                    \
-                   "r9", "r10", "r11", "r12");                                \
-            __sc_ret = __sc_3;                                                \
-            __sc_err = __sc_0;                                                \
-        }                                                                     \
-        LSS_RETURN(type, __sc_ret, __sc_err)
-    #undef _syscall0
-    #define _syscall0(type, name)                                             \
-       type LSS_NAME(name)(void) {                                            \
-          LSS_BODY(0, type, name);                                            \
-       }
-    #undef _syscall1
-    #define _syscall1(type, name, type1, arg1)                                \
-       type LSS_NAME(name)(type1 arg1) {                                      \
-          LSS_BODY(1, type, name, arg1);                                      \
-       }
-    #undef _syscall2
-    #define _syscall2(type, name, type1, arg1, type2, arg2)                   \
-       type LSS_NAME(name)(type1 arg1, type2 arg2) {                          \
-          LSS_BODY(2, type, name, arg1, arg2);                                \
-       }
-    #undef _syscall3
-    #define _syscall3(type, name, type1, arg1, type2, arg2, type3, arg3)      \
-       type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3) {              \
-          LSS_BODY(3, type, name, arg1, arg2, arg3);                          \
-       }
-    #undef _syscall4
-    #define _syscall4(type, name, type1, arg1, type2, arg2, type3, arg3,      \
-                                  type4, arg4)                                \
-       type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4) {  \
-          LSS_BODY(4, type, name, arg1, arg2, arg3, arg4);                    \
-       }
-    #undef _syscall5
-    #define _syscall5(type, name, type1, arg1, type2, arg2, type3, arg3,      \
-                                  type4, arg4, type5, arg5)                   \
-       type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,    \
-                                               type5 arg5) {                  \
-          LSS_BODY(5, type, name, arg1, arg2, arg3, arg4, arg5);              \
-       }
-    #undef _syscall6
-    #define _syscall6(type, name, type1, arg1, type2, arg2, type3, arg3,      \
-                                  type4, arg4, type5, arg5, type6, arg6)      \
-       type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4,    \
-                                               type5 arg5, type6 arg6) {      \
-          LSS_BODY(6, type, name, arg1, arg2, arg3, arg4, arg5, arg6);        \
-       }
-    /* clone function adapted from glibc 2.3.6 clone.S                       */
-    /* TODO(csilvers): consider wrapping some args up in a struct, like we
-     * do for i386's _syscall6, so we can compile successfully on gcc 2.95
-     */
-    LSS_INLINE int LSS_NAME(clone)(int (*fn)(void *), void *child_stack,
-                                   int flags, void *arg, int *parent_tidptr,
-                                   void *newtls, int *child_tidptr) {
-      long __ret, __err;
-      {
-        register int (*__fn)(void *)    __asm__ ("r8")  = fn;
-        register void *__cstack                 __asm__ ("r4")  = child_stack;
-        register int __flags                    __asm__ ("r3")  = flags;
-        register void * __arg                   __asm__ ("r9")  = arg;
-        register int * __ptidptr                __asm__ ("r5")  = parent_tidptr;
-        register void * __newtls                __asm__ ("r6")  = newtls;
-        register int * __ctidptr                __asm__ ("r7")  = child_tidptr;
-        __asm__ __volatile__(
-            /* check for fn == NULL
-             * and child_stack == NULL
-             */
-            "cmpwi cr0, %6, 0\n\t"
-            "cmpwi cr1, %7, 0\n\t"
-            "cror cr0*4+eq, cr1*4+eq, cr0*4+eq\n\t"
-            "beq- cr0, 1f\n\t"
-
-            /* set up stack frame for child                                  */
-            "clrrwi %7, %7, 4\n\t"
-            "li 0, 0\n\t"
-            "stwu 0, -16(%7)\n\t"
-
-            /* fn, arg, child_stack are saved across the syscall: r28-30     */
-            "mr 28, %6\n\t"
-            "mr 29, %7\n\t"
-            "mr 27, %9\n\t"
-
-            /* syscall                                                       */
-            "li 0, %4\n\t"
-            /* flags already in r3
-             * child_stack already in r4
-             * ptidptr already in r5
-             * newtls already in r6
-             * ctidptr already in r7
-             */
-            "sc\n\t"
-
-            /* Test if syscall was successful                                */
-            "cmpwi cr1, 3, 0\n\t"
-            "crandc cr1*4+eq, cr1*4+eq, cr0*4+so\n\t"
-            "bne- cr1, 1f\n\t"
-
-            /* Do the function call                                          */
-            "mtctr 28\n\t"
-            "mr 3, 27\n\t"
-            "bctrl\n\t"
-
-            /* Call _exit(r3)                                                */
-            "li 0, %5\n\t"
-            "sc\n\t"
-
-            /* Return to parent                                              */
-            "1:\n"
-            "mfcr %1\n\t"
-            "mr %0, 3\n\t"
-              : "=r" (__ret), "=r" (__err)
-              : "0" (-1), "1" (EINVAL),
-                "i" (__NR_clone), "i" (__NR_exit),
-                "r" (__fn), "r" (__cstack), "r" (__flags),
-                "r" (__arg), "r" (__ptidptr), "r" (__newtls),
-                "r" (__ctidptr)
-              : "cr0", "cr1", "memory", "ctr",
-                "r0", "r29", "r27", "r28");
-      }
-      LSS_RETURN(int, __ret, __err);
-    }
-  #elif defined(__s390__)
-    #undef  LSS_REG
-    #define LSS_REG(r, a) register unsigned long __r##r __asm__("r"#r) = (unsigned long) a
-    #undef  LSS_BODY
-    #define LSS_BODY(type, name, args...)                                     \
-        register unsigned long __nr __asm__("r1")                             \
-            = (unsigned long)(__NR_##name);                                   \
-        register long __res_r2 __asm__("r2");                                 \
-        long __res;                                                           \
-        __asm__ __volatile__                                                  \
-            ("svc 0\n\t"                                                      \
-             : "=d"(__res_r2)                                                 \
-             : "d"(__nr), ## args                                             \
-             : "memory");                                                     \
-        __res = __res_r2;                                                     \
-        LSS_RETURN(type, __res)
-    #undef _syscall0
-    #define _syscall0(type, name)                                             \
-       type LSS_NAME(name)(void) {                                            \
-          LSS_BODY(type, name);                                               \
-       }
-    #undef _syscall1
-    #define _syscall1(type, name, type1, arg1)                                \
-       type LSS_NAME(name)(type1 arg1) {                                      \
-          LSS_REG(2, arg1);                                                   \
-          LSS_BODY(type, name, "0"(__r2));                                    \
-       }
-    #undef _syscall2
-    #define _syscall2(type, name, type1, arg1, type2, arg2)                   \
-       type LSS_NAME(name)(type1 arg1, type2 arg2) {                          \
-          LSS_REG(2, arg1); LSS_REG(3, arg2);                                 \
-          LSS_BODY(type, name, "0"(__r2), "d"(__r3));                         \
-       }
-    #undef _syscall3
-    #define _syscall3(type, name, type1, arg1, type2, arg2, type3, arg3)      \
-       type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3) {              \
-          LSS_REG(2, arg1); LSS_REG(3, arg2); LSS_REG(4, arg3);               \
-          LSS_BODY(type, name, "0"(__r2), "d"(__r3), "d"(__r4));              \
-       }
-    #undef _syscall4
-    #define _syscall4(type, name, type1, arg1, type2, arg2, type3, arg3,      \
-                                  type4, arg4)                                \
-       type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3,                \
-                           type4 arg4) {                                      \
-          LSS_REG(2, arg1); LSS_REG(3, arg2); LSS_REG(4, arg3);               \
-          LSS_REG(5, arg4);                                                   \
-          LSS_BODY(type, name, "0"(__r2), "d"(__r3), "d"(__r4),               \
-                               "d"(__r5));                                    \
-       }
-    #undef _syscall5
-    #define _syscall5(type, name, type1, arg1, type2, arg2, type3, arg3,      \
-                                  type4, arg4, type5, arg5)                   \
-       type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3,                \
-                           type4 arg4, type5 arg5) {                          \
-          LSS_REG(2, arg1); LSS_REG(3, arg2); LSS_REG(4, arg3);               \
-          LSS_REG(5, arg4); LSS_REG(6, arg5);                                 \
-          LSS_BODY(type, name, "0"(__r2), "d"(__r3), "d"(__r4),               \
-                               "d"(__r5), "d"(__r6));                         \
-       }
-    #undef _syscall6
-    #define _syscall6(type, name, type1, arg1, type2, arg2, type3, arg3,      \
-                                  type4, arg4, type5, arg5, type6, arg6)      \
-       type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3,                \
-                           type4 arg4, type5 arg5, type6 arg6) {              \
-          LSS_REG(2, arg1); LSS_REG(3, arg2); LSS_REG(4, arg3);               \
-          LSS_REG(5, arg4); LSS_REG(6, arg5); LSS_REG(7, arg6);               \
-          LSS_BODY(type, name, "0"(__r2), "d"(__r3), "d"(__r4),               \
-                               "d"(__r5), "d"(__r6), "d"(__r7));              \
-       }
-    LSS_INLINE int LSS_NAME(clone)(int (*fn)(void *), void *child_stack,
-                                   int flags, void *arg, int *parent_tidptr,
-                                   void *newtls, int *child_tidptr) {
-      long __ret;
-      {
-        register int  (*__fn)(void *)    __asm__ ("r1")  = fn;
-        register void  *__cstack         __asm__ ("r2")  = child_stack;
-        register int    __flags          __asm__ ("r3")  = flags;
-        register void  *__arg            __asm__ ("r0")  = arg;
-        register int   *__ptidptr        __asm__ ("r4")  = parent_tidptr;
-        register void  *__newtls         __asm__ ("r6")  = newtls;
-        register int   *__ctidptr        __asm__ ("r5")  = child_tidptr;
-        __asm__ __volatile__ (
-    #ifndef __s390x__
-                                  /* arg already in r0 */
-          "ltr %4, %4\n\t"        /* check fn, which is already in r1 */
-          "jz 1f\n\t"             /* NULL function pointer, return -EINVAL */
-          "ltr %5, %5\n\t"        /* check child_stack, which is already in r2 */
-          "jz 1f\n\t"             /* NULL stack pointer, return -EINVAL */
-                                  /* flags already in r3 */
-                                  /* parent_tidptr already in r4 */
-                                  /* child_tidptr already in r5 */
-                                  /* newtls already in r6 */
-          "svc %2\n\t"            /* invoke clone syscall */
-          "ltr %0,%%r2\n\t"       /* load return code into __ret and test */
-          "jnz 1f\n\t"            /* return to parent if non-zero */
-                                  /* start child thread */
-          "lr %%r2, %7\n\t"       /* set first parameter to void *arg */
-          "ahi %%r15, -96\n\t"    /* make room on the stack for the save area */
-          "xc 0(4,%%r15), 0(%%r15)\n\t"
-          "basr %%r14, %4\n\t"    /* jump to fn */
-          "svc %3\n"              /* invoke exit syscall */
-          "1:\n"
-    #else
-                                  /* arg already in r0 */
-          "ltgr %4, %4\n\t"       /* check fn, which is already in r1 */
-          "jz 1f\n\t"             /* NULL function pointer, return -EINVAL */
-          "ltgr %5, %5\n\t"       /* check child_stack, which is already in r2 */
-          "jz 1f\n\t"             /* NULL stack pointer, return -EINVAL */
-                                  /* flags already in r3 */
-                                  /* parent_tidptr already in r4 */
-                                  /* child_tidptr already in r5 */
-                                  /* newtls already in r6 */
-          "svc %2\n\t"            /* invoke clone syscall */
-          "ltgr %0, %%r2\n\t"     /* load return code into __ret and test */
-          "jnz 1f\n\t"            /* return to parent if non-zero */
-                                  /* start child thread */
-          "lgr %%r2, %7\n\t"      /* set first parameter to void *arg */
-          "aghi %%r15, -160\n\t"  /* make room on the stack for the save area */
-          "xc 0(8,%%r15), 0(%%r15)\n\t"
-          "basr %%r14, %4\n\t"    /* jump to fn */
-          "svc %3\n"              /* invoke exit syscall */
-          "1:\n"
-    #endif
-          : "=r" (__ret)
-          : "0" (-EINVAL), "i" (__NR_clone), "i" (__NR_exit),
-            "d" (__fn), "d" (__cstack), "d" (__flags), "d" (__arg),
-            "d" (__ptidptr), "d" (__newtls), "d" (__ctidptr)
-          : "cc", "r14", "memory"
-        );
-      }
-      LSS_RETURN(int, __ret);
-    }
-  #elif defined(__e2k__)
-
-    #undef _LSS_BODY
-    #define _LSS_BODY(nr, type, name, ...)                                    \
-      register unsigned long long __res;                                      \
-      __asm__ __volatile__                                                    \
-      (                                                                       \
-       "{\n\t"                                                                \
-       "  sdisp %%ctpr1, 0x3\n\t"                                             \
-       "  addd, s 0x0, %[sys_num], %%b[0]\n\t"                                \
-       LSS_BODY_ASM##nr                                                       \
-       "}\n\t"                                                                \
-       "{\n\t"                                                                \
-       "  call %%ctpr1, wbs = %#\n\t"                                         \
-       "}\n\t"                                                                \
-       "{\n\t"                                                                \
-       "  addd, s 0x0, %%b[0], %[res]\n\t"                                    \
-       "}\n\t"                                                                \
-       : [res] "=r" (__res)                                                   \
-       :                                                                      \
-       LSS_BODY_ARG##nr(__VA_ARGS__)                                          \
-       [sys_num] "ri" (__NR_##name)                                           \
-       : "ctpr1", "ctpr2", "ctpr3",                                           \
-       "b[0]", "b[1]", "b[2]", "b[3]",                                        \
-       "b[4]", "b[5]", "b[6]", "b[7]"                                         \
-       );                                                                     \
-       LSS_RETURN(type, __res);
-
-    #undef LSS_BODY
-    #define LSS_BODY(nr, type, name, args...) \
-      _LSS_BODY(nr, type, name, ## args)
-
-    #undef LSS_BODY_ASM0
-    #undef LSS_BODY_ASM1
-    #undef LSS_BODY_ASM2
-    #undef LSS_BODY_ASM3
-    #undef LSS_BODY_ASM4
-    #undef LSS_BODY_ASM5
-    #undef LSS_BODY_ASM6
-
-    #define LSS_BODY_ASM0
-    #define LSS_BODY_ASM1 LSS_BODY_ASM0 \
-      "  addd, s 0x0, %[arg1], %%b[1]\n\t"
-    #define LSS_BODY_ASM2 LSS_BODY_ASM1 \
-      "  addd, s 0x0, %[arg2], %%b[2]\n\t"
-    #define LSS_BODY_ASM3 LSS_BODY_ASM2 \
-      "  addd, s 0x0, %[arg3], %%b[3]\n\t"
-    #define LSS_BODY_ASM4 LSS_BODY_ASM3 \
-      "  addd, s 0x0, %[arg4], %%b[4]\n\t"
-    #define LSS_BODY_ASM5 LSS_BODY_ASM4 \
-      "  addd, s 0x0, %[arg5], %%b[5]\n\t"
-    #define LSS_BODY_ASM6 LSS_BODY_ASM5 \
-      "}\n\t" \
-      "{\n\t" \
-      "  addd, s 0x0, %[arg6], %%b[6]\n\t"
-
-    #undef LSS_SYSCALL_ARG
-    #define LSS_SYSCALL_ARG(a) ((unsigned long long)(uintptr_t)(a))
-
-    #undef LSS_BODY_ARG0
-    #undef LSS_BODY_ARG1
-    #undef LSS_BODY_ARG2
-    #undef LSS_BODY_ARG3
-    #undef LSS_BODY_ARG4
-    #undef LSS_BODY_ARG5
-    #undef LSS_BODY_ARG6
-
-    #define LSS_BODY_ARG0()
-    #define LSS_BODY_ARG1(_arg1) \
-      [arg1] "ri" LSS_SYSCALL_ARG(_arg1),
-    #define LSS_BODY_ARG2(_arg1, _arg2) \
-      LSS_BODY_ARG1(_arg1) \
-      [arg2] "ri" LSS_SYSCALL_ARG(_arg2),
-    #define LSS_BODY_ARG3(_arg1, _arg2, _arg3) \
-      LSS_BODY_ARG2(_arg1, _arg2) \
-      [arg3] "ri" LSS_SYSCALL_ARG(_arg3),
-    #define LSS_BODY_ARG4(_arg1, _arg2, _arg3, _arg4) \
-      LSS_BODY_ARG3(_arg1, _arg2, _arg3) \
-      [arg4] "ri" LSS_SYSCALL_ARG(_arg4),
-    #define LSS_BODY_ARG5(_arg1, _arg2, _arg3, _arg4, _arg5) \
-      LSS_BODY_ARG4(_arg1, _arg2, _arg3, _arg4) \
-      [arg5] "ri" LSS_SYSCALL_ARG(_arg5),
-    #define LSS_BODY_ARG6(_arg1, _arg2, _arg3, _arg4, _arg5, _arg6) \
-      LSS_BODY_ARG5(_arg1, _arg2, _arg3, _arg4, _arg5) \
-      [arg6] "ri" LSS_SYSCALL_ARG(_arg6),
-
-    #undef _syscall0
-    #define _syscall0(type, name) \
-      type LSS_NAME(name)(void) { \
-        LSS_BODY(0, type, name);     \
-      }
-
-    #undef _syscall1
-    #define _syscall1(type, name, type1, arg1) \
-      type LSS_NAME(name)(type1 arg1) { \
-         LSS_BODY(1, type, name, arg1) \
-      }
-
-    #undef _syscall2
-    #define _syscall2(type, name, type1, arg1, type2, arg2) \
-      type LSS_NAME(name)(type1 arg1, type2 arg2) { \
-          LSS_BODY(2, type, name, arg1, arg2) \
-      }
-
-    #undef _syscall3
-    #define _syscall3(type, name, type1, arg1, type2, arg2, type3, arg3) \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3) { \
-          LSS_BODY(3, type, name, arg1, arg2, arg3) \
-      }
-
-    #undef _syscall4
-    #define _syscall4(type, name, type1, arg1, type2, arg2, type3, arg3, \
-                      type4, arg4) \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4) { \
-          LSS_BODY(4, type, name, arg1, arg2, arg3, arg4) \
-      }
-
-    #undef _syscall5
-    #define _syscall5(type, name, type1, arg1, type2, arg2, type3, arg3, \
-                      type4, arg4, type5, arg5) \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4, \
-                          type5 arg5) { \
-          LSS_BODY(5, type, name, arg1, arg2, arg3, arg4, arg5) \
-      }
-
-    #undef _syscall6
-    #define _syscall6(type, name, type1, arg1, type2, arg2, type3, arg3, \
-                      type4, arg4, type5, arg5, type6, arg6) \
-      type LSS_NAME(name)(type1 arg1, type2 arg2, type3 arg3, type4 arg4, \
-                          type5 arg5, type6 arg6) { \
-          LSS_BODY(6, type, name, arg1, arg2, arg3, arg4, arg5, arg6) \
-      }
-
-    LSS_INLINE int LSS_NAME(clone)(int (*fn)(void *), void *child_stack,
-                                   int flags, void *arg, int *parent_tidptr,
-                                   void *newtls, int *child_tidptr) {
-      unsigned long long __res;
-
-      __asm__ __volatile__ (
-                            "{\n\t"
-                            "  addd,s 0x0, %[nr_clone], %%b[0]\n\t"
-                            "  addd,s 0x0, %[flags], %%db[1]\n\t"
-                            "  addd,s 0x0, %[child_stack], %%db[2]\n\t"
-                            "  addd,s 0x0, %[parent_tidptr], %%db[3]\n\t"
-                            "  addd,s 0x0, %[child_tidptr], %%db[4]\n\t"
-                            "  addd,s 0x0, %[newtls], %%db[5]\n\t"
-                            "}\n\t"
-                            /* if (fn == NULL)
-                             *   return -EINVAL;
-                             */
-
-                            "{\n\t"
-                            "  disp %%ctpr1, .L1\n\t"
-                            "}\n\t"
-                            "{\n\t"
-                            "  cmpesb,s 0x0, %[fn], %%pred0\n\t"
-                            "}\n\t"
-                            "{\n\t"
-                            "  ct %%ctpr1 ? %%pred0\n\t"
-                            "}\n\t"
-
-                            /* if (child_stack == NULL)
-                             *   return -EINVAL;
-                             */
-                            "{\n\t"
-                            "  cmpesb,s 0x0, %%db[2], %%pred0\n\t"
-                            "}\n\t"
-                            "{\n\t"
-                            "  ct %%ctpr1 ? %%pred0\n\t"
-                            "}\n\t"
-
-                            /* b[0] = syscall(%b[0] = __NR_clone,
-                             *                %db[1] = flags,
-                             *                %db[2] = child_stack,
-                             *                %db[3] = parent_tidptr,
-                             *                %db[4] = child_tidptr,
-                             *                %db[5] = newtls)
-                             */
-                            "{\n\t"
-                            "  sdisp %%ctpr1, 0x3\n\t"
-                            "}\n\t"
-                            "{\n\t"
-                            "  call %%ctpr1, wbs = %#\n\t"
-                            "}\n\t"
-
-                            /* if (%[b0] != 0)
-                             *   return %b[0];
-                             */
-                            "{\n\t"
-                            "  disp %%ctpr1, .L2\n\t"
-                            "  cmpesb,s 0x0, %%b[0], %%pred0\n\t"
-                            "}\n\t"
-                            "{\n\t"
-                            "  ct %%ctpr1 ? ~%%pred0\n\t"
-                            "}\n\t"
-                            /* In the child, now. Call "fn(arg)".
-                             */
-
-                            "{\n\t"
-                            "  movtd,s %[fn], %%ctpr1\n\t"
-                            "}\n\t"
-                            "{\n\t"
-                            "  addd,s 0x0, %[arg], %%db[0]\n\t"
-                            "}\n\t"
-                            "{\n\t"
-                            "  call %%ctpr1, wbs = %#\n\t"
-                            "}\n\t"
-                            /* Call _exit(%b[0]).
-                             */
-
-                            "{\n\t"
-                            "  sdisp %%ctpr1, 0x3\n\t"
-                            "  addd,s 0x0, %%b[0], %%b[1]\n\t"
-                            "}\n\t"
-                            "{\n\t"
-                            "  addd,s 0x0, %[nr_exit], %%b[0]\n\t"
-                            "}\n\t"
-                            "{\n\t"
-                            "  call %%ctpr1, wbs = %#\n\t"
-                            "}\n\t"
-                            "{\n\t"
-                            "  disp %%ctpr1, .L2\n\t"
-                            "  adds,s 0x0, 0x0, %%b[0]\n\t"
-                            "}\n\t"
-                            "{\n\t"
-                            "  ct %%ctpr1\n\t"
-                            "}\n\t"
-                            ".L1:\n\t"
-                            "{\n\t"
-                            "  addd,s 0x0, %[einval], %%b[0]\n\t"
-                            "}\n\t"
-                            ".L2:\n\t"
-                            "{\n\t"
-                            "  addd,s 0x0, %%b[0], %[res]\n\t"
-                            "}\n\t"
-                            : [res] "=r" LSS_SYSCALL_ARG(__res)
-                            : [nr_clone] "ri" LSS_SYSCALL_ARG(__NR_clone)
-                              [arg] "ri" LSS_SYSCALL_ARG(arg)
-                              [nr_exit] "ri" LSS_SYSCALL_ARG(__NR_exit)
-                              [flags] "ri" LSS_SYSCALL_ARG(flags)
-                              [child_stack] "ri" LSS_SYSCALL_ARG(child_stack)
-                              [parent_tidptr] "ri"
-                              LSS_SYSCALL_ARG(parent_tidptr)
-                              [newtls] "ri" LSS_SYSCALL_ARG(newtls)
-                              [child_tidptr] "ri"
-                              LSS_SYSCALL_ARG(child_tidptr)
-                              [fn] "ri" LSS_SYSCALL_ARG(fn)
-                              [einval] "ri" LSS_SYSCALL_ARG(-EINVAL)
-                            : "ctpr1", "b[0]", "b[1]", "b[2]", "b[3]",
-                              "b[4]", "b[5]", "pred0");
-      LSS_RETURN(int, __res);
-    }
-
-  #endif
-  #define __NR__exit   __NR_exit
-  #define __NR__gettid __NR_gettid
-  #define __NR__mremap __NR_mremap
-  LSS_INLINE _syscall1(void *,  brk,             void *,      e)
-  LSS_INLINE _syscall1(int,     chdir,           const char *,p)
-  LSS_INLINE _syscall1(int,     close,           int,         f)
-  LSS_INLINE _syscall2(int,     clock_getres,    int,         c,
-                       struct kernel_timespec*, t)
-  LSS_INLINE _syscall2(int,     clock_gettime,   int,         c,
-                       struct kernel_timespec*, t)
-  LSS_INLINE _syscall1(int,     dup,             int,         f)
-  #if defined(__NR_dup2)
-    // dup2 is polyfilled below when not available.
-    LSS_INLINE _syscall2(int,     dup2,            int,         s,
-                         int,            d)
-  #endif
-  #if defined(__NR_dup3)
-    LSS_INLINE _syscall3(int, dup3,  int, s, int, d, int, f)
-  #endif
-  LSS_INLINE _syscall3(int,     execve,          const char*, f,
-                       const char*const*,a,const char*const*, e)
-  LSS_INLINE _syscall1(int,     _exit,           int,         e)
-  LSS_INLINE _syscall1(int,     exit_group,      int,         e)
-  LSS_INLINE _syscall3(int,     fcntl,           int,         f,
-                       int,            c, long,   a)
-  #if defined(__NR_fork)
-    // fork is polyfilled below when not available.
-    LSS_INLINE _syscall0(pid_t,   fork)
-  #endif
-  LSS_INLINE _syscall2(int,     fstat,           int,         f,
-                      struct kernel_stat*,   b)
-  LSS_INLINE _syscall2(int,     fstatfs,         int,         f,
-                      struct kernel_statfs*, b)
-  #if defined(__x86_64__)
-    /* Need to make sure off_t isn't truncated to 32-bits under x32.  */
-    LSS_INLINE int LSS_NAME(ftruncate)(int f, off_t l) {
-      LSS_BODY(2, int, ftruncate, LSS_SYSCALL_ARG(f), (uint64_t)(l));
-    }
-  #else
-    LSS_INLINE _syscall2(int, ftruncate,           int,         f,
-                         off_t,          l)
-  #endif
-  LSS_INLINE _syscall6(int,     futex,          int*,        u,
-                       int,     o,              int,         v,
-                       struct kernel_timespec*, t,
-                       int*,    u2,             int,         v2)
-  LSS_INLINE _syscall3(int,     getdents,        int,         f,
-                       struct kernel_dirent*, d, int,    c)
-  LSS_INLINE _syscall3(int,     getdents64,      int,         f,
-                      struct kernel_dirent64*, d, int,    c)
-  LSS_INLINE _syscall0(gid_t,   getegid)
-  LSS_INLINE _syscall0(uid_t,   geteuid)
-  #if defined(__NR_getpgrp)
-    LSS_INLINE _syscall0(pid_t,   getpgrp)
-  #endif
-  LSS_INLINE _syscall0(pid_t,   getpid)
-  LSS_INLINE _syscall0(pid_t,   getppid)
-  LSS_INLINE _syscall2(int,     getpriority,     int,         a,
-                       int,            b)
-  LSS_INLINE _syscall3(int,     getresgid,       gid_t *,     r,
-                       gid_t *,         e,       gid_t *,     s)
-  LSS_INLINE _syscall3(int,     getresuid,       uid_t *,     r,
-                       uid_t *,         e,       uid_t *,     s)
-#if !defined(__ARM_EABI__)
-  LSS_INLINE _syscall2(int,     getrlimit,       int,         r,
-                      struct kernel_rlimit*, l)
-#endif
-  LSS_INLINE _syscall1(pid_t,   getsid,          pid_t,       p)
-  LSS_INLINE _syscall0(pid_t,   _gettid)
-  LSS_INLINE _syscall2(pid_t,   gettimeofday,    struct kernel_timeval*, t,
-                       void*, tz)
-  LSS_INLINE _syscall5(int,     setxattr,        const char *,p,
-                       const char *,   n,        const void *,v,
-                       size_t,         s,        int,         f)
-  LSS_INLINE _syscall5(int,     lsetxattr,       const char *,p,
-                       const char *,   n,        const void *,v,
-                       size_t,         s,        int,         f)
-  LSS_INLINE _syscall4(ssize_t, getxattr,        const char *,p,
-                       const char *,   n,        void *,      v, size_t, s)
-  LSS_INLINE _syscall4(ssize_t, lgetxattr,       const char *,p,
-                       const char *,   n,        void *,      v, size_t, s)
-  LSS_INLINE _syscall3(ssize_t, listxattr,       const char *,p,
-                       char *,   l,              size_t,      s)
-  LSS_INLINE _syscall3(ssize_t, llistxattr,      const char *,p,
-                       char *,   l,              size_t,      s)
-  LSS_INLINE _syscall3(int,     ioctl,           int,         d,
-                       int,     r,               void *,      a)
-  LSS_INLINE _syscall2(int,     ioprio_get,      int,         which,
-                       int,     who)
-  LSS_INLINE _syscall3(int,     ioprio_set,      int,         which,
-                       int,     who,             int,         ioprio)
-  LSS_INLINE _syscall2(int,     kill,            pid_t,       p,
-                       int,            s)
-  #if defined(__x86_64__)
-    /* Need to make sure off_t isn't truncated to 32-bits under x32.  */
-    LSS_INLINE off_t LSS_NAME(lseek)(int f, off_t o, int w) {
-      _LSS_BODY(3, off_t, lseek, off_t, LSS_SYSCALL_ARG(f), (uint64_t)(o),
-                                        LSS_SYSCALL_ARG(w));
-    }
-  #else
-    LSS_INLINE _syscall3(off_t,   lseek,           int,         f,
-                         off_t,          o, int,    w)
-  #endif
-  LSS_INLINE _syscall2(int,     munmap,          void*,       s,
-                       size_t,         l)
-  LSS_INLINE _syscall6(long,    move_pages,      pid_t,       p,
-                       unsigned long,  n, void **,g, int *,   d,
-                       int *,          s, int,    f)
-  LSS_INLINE _syscall3(int,     mprotect,        const void *,a,
-                       size_t,         l,        int,         p)
-  LSS_INLINE _syscall5(void*,   _mremap,         void*,       o,
-                       size_t,         os,       size_t,      ns,
-                       unsigned long,  f, void *, a)
-  #if defined(__NR_open)
-    // open is polyfilled below when not available.
-    LSS_INLINE _syscall3(int,     open,            const char*, p,
-                         int,            f, int,    m)
-  #endif
-  #if defined(__NR_poll)
-    // poll is polyfilled below when not available.
-    LSS_INLINE _syscall3(int,     poll,           struct kernel_pollfd*, u,
-                         unsigned int,   n, int,    t)
-  #endif
-  #if defined(__NR_ppoll)
-    LSS_INLINE _syscall5(int, ppoll, struct kernel_pollfd *, u,
-                         unsigned int, n, const struct kernel_timespec *, t,
-                         const struct kernel_sigset_t *, sigmask, size_t, s)
-  #endif
-  LSS_INLINE _syscall5(int,     prctl,           int,         option,
-                       unsigned long,  arg2,
-                       unsigned long,  arg3,
-                       unsigned long,  arg4,
-                       unsigned long,  arg5)
-  LSS_INLINE _syscall4(long,    ptrace,          int,         r,
-                       pid_t,          p, void *, a, void *, d)
-  #if defined(__NR_quotactl)
-    // Defined on x86_64 / i386 only
-    LSS_INLINE _syscall4(int,  quotactl,  int,  cmd,  const char *, special,
-                         int, id, caddr_t, addr)
-  #endif
-  LSS_INLINE _syscall3(ssize_t, read,            int,         f,
-                       void *,         b, size_t, c)
-  #if defined(__NR_readlink)
-    // readlink is polyfilled below when not available.
-    LSS_INLINE _syscall3(int,     readlink,        const char*, p,
-                         char*,          b, size_t, s)
-  #endif
-  #if defined(__NR_readlinkat)
-    LSS_INLINE _syscall4(int, readlinkat, int, d, const char *, p, char *, b,
-                         size_t, s)
-  #endif
-  LSS_INLINE _syscall4(int,     rt_sigaction,    int,         s,
-                       const struct kernel_sigaction*, a,
-                       struct kernel_sigaction*, o, size_t,   c)
-  LSS_INLINE _syscall2(int, rt_sigpending, struct kernel_sigset_t *, s,
-                       size_t,         c)
-  LSS_INLINE _syscall4(int, rt_sigprocmask,      int,         h,
-                       const struct kernel_sigset_t*,  s,
-                       struct kernel_sigset_t*,        o, size_t, c)
-  LSS_INLINE _syscall2(int, rt_sigsuspend,
-                       const struct kernel_sigset_t*, s,  size_t, c)
-  LSS_INLINE _syscall4(int, rt_sigtimedwait, const struct kernel_sigset_t*, s,
-                       siginfo_t*, i, const struct timespec*, t, size_t, c)
-  LSS_INLINE _syscall3(int,     sched_getaffinity,pid_t,      p,
-                       unsigned int,   l, unsigned long *, m)
-  LSS_INLINE _syscall3(int,     sched_setaffinity,pid_t,      p,
-                       unsigned int,   l, unsigned long *, m)
-  LSS_INLINE _syscall0(int,     sched_yield)
-  LSS_INLINE _syscall1(long,    set_tid_address, int *,       t)
-  LSS_INLINE _syscall1(int,     setfsgid,        gid_t,       g)
-  LSS_INLINE _syscall1(int,     setfsuid,        uid_t,       u)
-  LSS_INLINE _syscall1(int,     setuid,          uid_t,       u)
-  LSS_INLINE _syscall1(int,     setgid,          gid_t,       g)
-  LSS_INLINE _syscall2(int,     setpgid,         pid_t,       p,
-                       pid_t,          g)
-  LSS_INLINE _syscall3(int,     setpriority,     int,         a,
-                       int,            b, int,    p)
-  LSS_INLINE _syscall3(int,     setresgid,       gid_t,       r,
-                       gid_t,          e, gid_t,  s)
-  LSS_INLINE _syscall3(int,     setresuid,       uid_t,       r,
-                       uid_t,          e, uid_t,  s)
-  LSS_INLINE _syscall2(int,     setrlimit,       int,         r,
-                       const struct kernel_rlimit*, l)
-  LSS_INLINE _syscall0(pid_t,    setsid)
-  LSS_INLINE _syscall2(int,     sigaltstack,     const stack_t*, s,
-                       const stack_t*, o)
-  #if defined(__NR_sigreturn)
-    LSS_INLINE _syscall1(int,     sigreturn,       unsigned long, u)
-  #endif
-  #if defined(__NR_stat)
-    // stat and lstat are polyfilled below when not available.
-    LSS_INLINE _syscall2(int,     stat,            const char*, f,
-                        struct kernel_stat*,   b)
-  #endif
-  #if defined(__NR_lstat)
-    LSS_INLINE _syscall2(int,     lstat,           const char*, f,
-                         struct kernel_stat*,   b)
-  #endif
-  LSS_INLINE _syscall2(int,     statfs,          const char*, f,
-                      struct kernel_statfs*, b)
-  LSS_INLINE _syscall3(int,     tgkill,          pid_t,       p,
-                       pid_t,          t, int,            s)
-  LSS_INLINE _syscall2(int,     tkill,           pid_t,       p,
-                       int,            s)
-  #if defined(__NR_unlink)
-    // unlink is polyfilled below when not available.
-    LSS_INLINE _syscall1(int,     unlink,           const char*, f)
-  #endif
-  LSS_INLINE _syscall3(ssize_t, write,            int,        f,
-                       const void *,   b, size_t, c)
-  LSS_INLINE _syscall3(ssize_t, writev,           int,        f,
-                       const struct kernel_iovec*, v, size_t, c)
-  #if defined(__NR_getcpu)
-    LSS_INLINE _syscall3(long, getcpu, unsigned *, cpu,
-                         unsigned *, node, void *, unused)
-  #endif
-  #if defined(__x86_64__) || defined(__e2k__) ||                              \
-     (defined(__mips__) && _MIPS_SIM != _MIPS_SIM_ABI32)
-    LSS_INLINE _syscall3(int, recvmsg,            int,   s,
-                        struct kernel_msghdr*,     m, int, f)
-    LSS_INLINE _syscall3(int, sendmsg,            int,   s,
-                         const struct kernel_msghdr*, m, int, f)
-    LSS_INLINE _syscall6(int, sendto,             int,   s,
-                         const void*,             m, size_t, l,
-                         int,                     f,
-                         const struct kernel_sockaddr*, a, int, t)
-    LSS_INLINE _syscall2(int, shutdown,           int,   s,
-                         int,                     h)
-    LSS_INLINE _syscall3(int, socket,             int,   d,
-                         int,                     t, int,       p)
-    LSS_INLINE _syscall4(int, socketpair,         int,   d,
-                         int,                     t, int,       p, int*, s)
-  #endif
-  #if defined(__NR_fadvise64)
-    #if defined(__x86_64__)
-    /* Need to make sure loff_t isn't truncated to 32-bits under x32.  */
-    LSS_INLINE int LSS_NAME(fadvise64)(int fd, loff_t offset, loff_t len,
-                                       int advice) {
-      LSS_BODY(4, int, fadvise64, LSS_SYSCALL_ARG(fd), (uint64_t)(offset),
-                                  (uint64_t)(len), LSS_SYSCALL_ARG(advice));
-    }
-    #else
-    LSS_INLINE _syscall4(int, fadvise64,
-                         int, fd, loff_t, offset, loff_t, len, int, advice)
-    #endif
-  #elif defined(__i386__)
-    #define __NR__fadvise64_64 __NR_fadvise64_64
-    LSS_INLINE _syscall6(int, _fadvise64_64, int, fd,
-                         unsigned, offset_lo, unsigned, offset_hi,
-                         unsigned, len_lo, unsigned, len_hi,
-                         int, advice)
-
-    LSS_INLINE int LSS_NAME(fadvise64)(int fd, loff_t offset,
-                                       loff_t len, int advice) {
-      return LSS_NAME(_fadvise64_64)(fd,
-                                     (unsigned)offset, (unsigned)(offset >>32),
-                                     (unsigned)len, (unsigned)(len >> 32),
-                                     advice);
-    }
-
-  #elif defined(__s390__) && !defined(__s390x__)
-    #define __NR__fadvise64_64 __NR_fadvise64_64
-    struct kernel_fadvise64_64_args {
-      int fd;
-      long long offset;
-      long long len;
-      int advice;
-    };
-
-    LSS_INLINE _syscall1(int, _fadvise64_64,
-                         struct kernel_fadvise64_64_args *args)
-
-    LSS_INLINE int LSS_NAME(fadvise64)(int fd, loff_t offset,
-                                       loff_t len, int advice) {
-      struct kernel_fadvise64_64_args args = { fd, offset, len, advice };
-      return LSS_NAME(_fadvise64_64)(&args);
-    }
-  #endif
-  #if defined(__NR_fallocate)
-    #if defined(__x86_64__)
-    /* Need to make sure loff_t isn't truncated to 32-bits under x32.  */
-    LSS_INLINE int LSS_NAME(fallocate)(int f, int mode, loff_t offset,
-                                       loff_t len) {
-      LSS_BODY(4, int, fallocate, LSS_SYSCALL_ARG(f), LSS_SYSCALL_ARG(mode),
-                                  (uint64_t)(offset), (uint64_t)(len));
-    }
-    #elif (defined(__i386__) || (defined(__s390__) && !defined(__s390x__)) \
-           || defined(__ARM_ARCH_3__) || defined(__ARM_EABI__) \
-           || (defined(__mips__) && _MIPS_SIM == _MIPS_SIM_ABI32) \
-           || defined(__PPC__))
-    #define __NR__fallocate __NR_fallocate
-    LSS_INLINE _syscall6(int, _fallocate, int, fd,
-                         int, mode,
-                         unsigned, offset_lo, unsigned, offset_hi,
-                         unsigned, len_lo, unsigned, len_hi)
-
-    LSS_INLINE int LSS_NAME(fallocate)(int fd, int mode,
-                                       loff_t offset, loff_t len) {
-      union { loff_t off; unsigned w[2]; } o = { offset }, l = { len };
-      return LSS_NAME(_fallocate)(fd, mode, o.w[0], o.w[1], l.w[0], l.w[1]);
-    }
-    #else
-    LSS_INLINE _syscall4(int, fallocate,
-                         int, f, int, mode, loff_t, offset, loff_t, len)
-    #endif
-  #endif
-  #if defined(__NR_getrandom)
-    LSS_INLINE _syscall3(ssize_t, getrandom, void*, buffer, size_t, length,
-                         unsigned int, flags)
-  #endif
-  #if defined(__NR_newfstatat)
-    LSS_INLINE _syscall4(int, newfstatat,         int,   d,
-                         const char *,            p,
-                         struct kernel_stat*,     b, int, f)
-  #endif
-  #if defined(__x86_64__) || defined(__s390x__)
-    LSS_INLINE int LSS_NAME(getresgid32)(gid_t *rgid,
-                                         gid_t *egid,
-                                         gid_t *sgid) {
-      return LSS_NAME(getresgid)(rgid, egid, sgid);
-    }
-
-    LSS_INLINE int LSS_NAME(getresuid32)(uid_t *ruid,
-                                         uid_t *euid,
-                                         uid_t *suid) {
-      return LSS_NAME(getresuid)(ruid, euid, suid);
-    }
-
-    LSS_INLINE int LSS_NAME(setfsgid32)(gid_t gid) {
-      return LSS_NAME(setfsgid)(gid);
-    }
-
-    LSS_INLINE int LSS_NAME(setfsuid32)(uid_t uid) {
-      return LSS_NAME(setfsuid)(uid);
-    }
-
-    LSS_INLINE int LSS_NAME(setresgid32)(gid_t rgid, gid_t egid, gid_t sgid) {
-      return LSS_NAME(setresgid)(rgid, egid, sgid);
-    }
-
-    LSS_INLINE int LSS_NAME(setresuid32)(uid_t ruid, uid_t euid, uid_t suid) {
-      return LSS_NAME(setresuid)(ruid, euid, suid);
-    }
-
-    LSS_INLINE int LSS_NAME(sigaction)(int signum,
-                                       const struct kernel_sigaction *act,
-                                       struct kernel_sigaction *oldact) {
-      #if defined(__x86_64__)
-      /* On x86_64, the kernel requires us to always set our own
-       * SA_RESTORER in order to be able to return from a signal handler.
-       * This function must have a "magic" signature that the "gdb"
-       * (and maybe the kernel?) can recognize.
-       */
-      if (act != NULL && !(act->sa_flags & SA_RESTORER)) {
-        struct kernel_sigaction a = *act;
-        a.sa_flags   |= SA_RESTORER;
-        a.sa_restorer = LSS_NAME(restore_rt)();
-        return LSS_NAME(rt_sigaction)(signum, &a, oldact,
-                                      (KERNEL_NSIG+7)/8);
-      } else
-      #endif
-        return LSS_NAME(rt_sigaction)(signum, act, oldact,
-                                      (KERNEL_NSIG+7)/8);
-    }
-
-    LSS_INLINE int LSS_NAME(sigpending)(struct kernel_sigset_t *set) {
-      return LSS_NAME(rt_sigpending)(set, (KERNEL_NSIG+7)/8);
-    }
-
-    LSS_INLINE int LSS_NAME(sigsuspend)(const struct kernel_sigset_t *set) {
-      return LSS_NAME(rt_sigsuspend)(set, (KERNEL_NSIG+7)/8);
-    }
-  #endif
-  #if defined(__NR_rt_sigprocmask)
-    LSS_INLINE int LSS_NAME(sigprocmask)(int how,
-                                         const struct kernel_sigset_t *set,
-                                         struct kernel_sigset_t *oldset) {
-      return LSS_NAME(rt_sigprocmask)(how, set, oldset, (KERNEL_NSIG+7)/8);
-    }
-  #endif
-  #if defined(__NR_rt_sigtimedwait)
-    LSS_INLINE int LSS_NAME(sigtimedwait)(const struct kernel_sigset_t *set,
-                                          siginfo_t *info,
-                                          const struct timespec *timeout) {
-      return LSS_NAME(rt_sigtimedwait)(set, info, timeout, (KERNEL_NSIG+7)/8);
-    }
-  #endif
-  #if defined(__NR_wait4)
-    LSS_INLINE _syscall4(pid_t, wait4,            pid_t, p,
-                         int*,                    s, int,       o,
-                        struct kernel_rusage*,     r)
-  #endif
-  #if defined(__NR_openat)
-    LSS_INLINE _syscall4(int, openat, int, d, const char *, p, int, f, int, m)
-  #endif
-  #if defined(__NR_unlinkat)
-    LSS_INLINE _syscall3(int, unlinkat, int, d, const char *, p, int, f)
-  #endif
-  #if defined(__i386__) || defined(__ARM_ARCH_3__) || defined(__ARM_EABI__) || \
-      (defined(__s390__) && !defined(__s390x__))
-    #define __NR__getresgid32 __NR_getresgid32
-    #define __NR__getresuid32 __NR_getresuid32
-    #define __NR__setfsgid32  __NR_setfsgid32
-    #define __NR__setfsuid32  __NR_setfsuid32
-    #define __NR__setresgid32 __NR_setresgid32
-    #define __NR__setresuid32 __NR_setresuid32
-#if defined(__ARM_EABI__)
-    LSS_INLINE _syscall2(int,   ugetrlimit,        int,          r,
-                        struct kernel_rlimit*, l)
-#endif
-    LSS_INLINE _syscall3(int,     _getresgid32,    gid_t *,      r,
-                         gid_t *,            e,    gid_t *,      s)
-    LSS_INLINE _syscall3(int,     _getresuid32,    uid_t *,      r,
-                         uid_t *,            e,    uid_t *,      s)
-    LSS_INLINE _syscall1(int,     _setfsgid32,     gid_t,        f)
-    LSS_INLINE _syscall1(int,     _setfsuid32,     uid_t,        f)
-    LSS_INLINE _syscall3(int,     _setresgid32,    gid_t,        r,
-                         gid_t,              e,    gid_t,        s)
-    LSS_INLINE _syscall3(int,     _setresuid32,    uid_t,        r,
-                         uid_t,              e,    uid_t,        s)
-
-    LSS_INLINE int LSS_NAME(getresgid32)(gid_t *rgid,
-                                         gid_t *egid,
-                                         gid_t *sgid) {
-      int rc;
-      if ((rc = LSS_NAME(_getresgid32)(rgid, egid, sgid)) < 0 &&
-          LSS_ERRNO == ENOSYS) {
-        if ((rgid == NULL) || (egid == NULL) || (sgid == NULL)) {
-          return EFAULT;
-        }
-        // Clear the high bits first, since getresgid only sets 16 bits
-        *rgid = *egid = *sgid = 0;
-        rc = LSS_NAME(getresgid)(rgid, egid, sgid);
-      }
-      return rc;
-    }
-
-    LSS_INLINE int LSS_NAME(getresuid32)(uid_t *ruid,
-                                         uid_t *euid,
-                                         uid_t *suid) {
-      int rc;
-      if ((rc = LSS_NAME(_getresuid32)(ruid, euid, suid)) < 0 &&
-          LSS_ERRNO == ENOSYS) {
-        if ((ruid == NULL) || (euid == NULL) || (suid == NULL)) {
-          return EFAULT;
-        }
-        // Clear the high bits first, since getresuid only sets 16 bits
-        *ruid = *euid = *suid = 0;
-        rc = LSS_NAME(getresuid)(ruid, euid, suid);
-      }
-      return rc;
-    }
-
-    LSS_INLINE int LSS_NAME(setfsgid32)(gid_t gid) {
-      int rc;
-      if ((rc = LSS_NAME(_setfsgid32)(gid)) < 0 &&
-          LSS_ERRNO == ENOSYS) {
-        if ((unsigned int)gid & ~0xFFFFu) {
-          rc = EINVAL;
-        } else {
-          rc = LSS_NAME(setfsgid)(gid);
-        }
-      }
-      return rc;
-    }
-
-    LSS_INLINE int LSS_NAME(setfsuid32)(uid_t uid) {
-      int rc;
-      if ((rc = LSS_NAME(_setfsuid32)(uid)) < 0 &&
-          LSS_ERRNO == ENOSYS) {
-        if ((unsigned int)uid & ~0xFFFFu) {
-          rc = EINVAL;
-        } else {
-          rc = LSS_NAME(setfsuid)(uid);
-        }
-      }
-      return rc;
-    }
-
-    LSS_INLINE int LSS_NAME(setresgid32)(gid_t rgid, gid_t egid, gid_t sgid) {
-      int rc;
-      if ((rc = LSS_NAME(_setresgid32)(rgid, egid, sgid)) < 0 &&
-          LSS_ERRNO == ENOSYS) {
-        if ((unsigned int)rgid & ~0xFFFFu ||
-            (unsigned int)egid & ~0xFFFFu ||
-            (unsigned int)sgid & ~0xFFFFu) {
-          rc = EINVAL;
-        } else {
-          rc = LSS_NAME(setresgid)(rgid, egid, sgid);
-        }
-      }
-      return rc;
-    }
-
-    LSS_INLINE int LSS_NAME(setresuid32)(uid_t ruid, uid_t euid, uid_t suid) {
-      int rc;
-      if ((rc = LSS_NAME(_setresuid32)(ruid, euid, suid)) < 0 &&
-          LSS_ERRNO == ENOSYS) {
-        if ((unsigned int)ruid & ~0xFFFFu ||
-            (unsigned int)euid & ~0xFFFFu ||
-            (unsigned int)suid & ~0xFFFFu) {
-          rc = EINVAL;
-        } else {
-          rc = LSS_NAME(setresuid)(ruid, euid, suid);
-        }
-      }
-      return rc;
-    }
-  #endif
-  LSS_INLINE int LSS_NAME(sigemptyset)(struct kernel_sigset_t *set) {
-    memset(&set->sig, 0, sizeof(set->sig));
-    return 0;
-  }
-
-  LSS_INLINE int LSS_NAME(sigfillset)(struct kernel_sigset_t *set) {
-    memset(&set->sig, -1, sizeof(set->sig));
-    return 0;
-  }
-
-  LSS_INLINE int LSS_NAME(sigaddset)(struct kernel_sigset_t *set,
-                                     int signum) {
-    if (signum < 1 || signum > (int)(8*sizeof(set->sig))) {
-      LSS_ERRNO = EINVAL;
-      return -1;
-    } else {
-      set->sig[(signum - 1)/(8*sizeof(set->sig[0]))]
-          |= 1UL << ((signum - 1) % (8*sizeof(set->sig[0])));
-      return 0;
-    }
-  }
-
-  LSS_INLINE int LSS_NAME(sigdelset)(struct kernel_sigset_t *set,
-                                        int signum) {
-    if (signum < 1 || signum > (int)(8*sizeof(set->sig))) {
-      LSS_ERRNO = EINVAL;
-      return -1;
-    } else {
-      set->sig[(signum - 1)/(8*sizeof(set->sig[0]))]
-          &= ~(1UL << ((signum - 1) % (8*sizeof(set->sig[0]))));
-      return 0;
-    }
-  }
-
-  LSS_INLINE int LSS_NAME(sigismember)(struct kernel_sigset_t *set,
-                                          int signum) {
-    if (signum < 1 || signum > (int)(8*sizeof(set->sig))) {
-      LSS_ERRNO = EINVAL;
-      return -1;
-    } else {
-      return !!(set->sig[(signum - 1)/(8*sizeof(set->sig[0]))] &
-                (1UL << ((signum - 1) % (8*sizeof(set->sig[0])))));
-    }
-  }
-  #if defined(__i386__) ||                                                    \
-      defined(__ARM_ARCH_3__) || defined(__ARM_EABI__) ||                     \
-     (defined(__mips__) && _MIPS_SIM == _MIPS_SIM_ABI32) ||                   \
-      defined(__PPC__) ||                                                     \
-     (defined(__s390__) && !defined(__s390x__)) || defined(__e2k__)
-    #define __NR__sigaction   __NR_sigaction
-    #define __NR__sigpending  __NR_sigpending
-    #define __NR__sigsuspend  __NR_sigsuspend
-    #define __NR__socketcall  __NR_socketcall
-    LSS_INLINE _syscall2(int, fstat64,             int, f,
-                         struct kernel_stat64 *, b)
-    LSS_INLINE _syscall5(int, _llseek,     uint, fd,
-                         unsigned long, hi, unsigned long, lo,
-                         loff_t *, res, uint, wh)
-#if defined(__s390__) && !defined(__s390x__)
-    /* On s390, mmap2() arguments are passed in memory. */
-    LSS_INLINE void* LSS_NAME(_mmap2)(void *s, size_t l, int p, int f, int d,
-                                      off_t o) {
-      unsigned long buf[6] = { (unsigned long) s, (unsigned long) l,
-                               (unsigned long) p, (unsigned long) f,
-                               (unsigned long) d, (unsigned long) o };
-      LSS_REG(2, buf);
-      LSS_BODY(void*, mmap2, "0"(__r2));
-    }
-#else
-    #define __NR__mmap2 __NR_mmap2
-    LSS_INLINE _syscall6(void*, _mmap2,            void*, s,
-                         size_t,                   l, int,               p,
-                         int,                      f, int,               d,
-                         off_t,                    o)
-#endif
-    LSS_INLINE _syscall3(int,   _sigaction,        int,   s,
-                         const struct kernel_old_sigaction*,  a,
-                         struct kernel_old_sigaction*,        o)
-    LSS_INLINE _syscall1(int,   _sigpending, unsigned long*, s)
-    #ifdef __PPC__
-    LSS_INLINE _syscall1(int, _sigsuspend,         unsigned long, s)
-    #else
-    LSS_INLINE _syscall3(int, _sigsuspend,         const void*, a,
-                         int,                      b,
-                         unsigned long,            s)
-    #endif
-    LSS_INLINE _syscall2(int, stat64,              const char *, p,
-                         struct kernel_stat64 *, b)
-
-    LSS_INLINE int LSS_NAME(sigaction)(int signum,
-                                       const struct kernel_sigaction *act,
-                                       struct kernel_sigaction *oldact) {
-      int old_errno = LSS_ERRNO;
-      int rc;
-      struct kernel_sigaction a;
-      if (act != NULL) {
-        a             = *act;
-        #ifdef __i386__
-        /* On i386, the kernel requires us to always set our own
-         * SA_RESTORER when using realtime signals. Otherwise, it does not
-         * know how to return from a signal handler. This function must have
-         * a "magic" signature that the "gdb" (and maybe the kernel?) can
-         * recognize.
-         * Apparently, a SA_RESTORER is implicitly set by the kernel, when
-         * using non-realtime signals.
-         *
-         * TODO: Test whether ARM needs a restorer
-         */
-        if (!(a.sa_flags & SA_RESTORER)) {
-          a.sa_flags   |= SA_RESTORER;
-          a.sa_restorer = (a.sa_flags & SA_SIGINFO)
-                          ? LSS_NAME(restore_rt)() : LSS_NAME(restore)();
-        }
-        #endif
-      }
-      rc = LSS_NAME(rt_sigaction)(signum, act ? &a : act, oldact,
-                                  (KERNEL_NSIG+7)/8);
-      if (rc < 0 && LSS_ERRNO == ENOSYS) {
-        struct kernel_old_sigaction oa, ooa, *ptr_a = &oa, *ptr_oa = &ooa;
-        if (!act) {
-          ptr_a            = NULL;
-        } else {
-          oa.sa_handler_   = act->sa_handler_;
-          memcpy(&oa.sa_mask, &act->sa_mask, sizeof(oa.sa_mask));
-          #ifndef __mips__
-          oa.sa_restorer   = act->sa_restorer;
-          #endif
-          oa.sa_flags      = act->sa_flags;
-        }
-        if (!oldact) {
-          ptr_oa           = NULL;
-        }
-        LSS_ERRNO = old_errno;
-        rc = LSS_NAME(_sigaction)(signum, ptr_a, ptr_oa);
-        if (rc == 0 && oldact) {
-          if (act) {
-            memcpy(oldact, act, sizeof(*act));
-          } else {
-            memset(oldact, 0, sizeof(*oldact));
-          }
-          oldact->sa_handler_    = ptr_oa->sa_handler_;
-          oldact->sa_flags       = ptr_oa->sa_flags;
-          memcpy(&oldact->sa_mask, &ptr_oa->sa_mask, sizeof(ptr_oa->sa_mask));
-          #ifndef __mips__
-          oldact->sa_restorer    = ptr_oa->sa_restorer;
-          #endif
-        }
-      }
-      return rc;
-    }
-
-    LSS_INLINE int LSS_NAME(sigpending)(struct kernel_sigset_t *set) {
-      int old_errno = LSS_ERRNO;
-      int rc = LSS_NAME(rt_sigpending)(set, (KERNEL_NSIG+7)/8);
-      if (rc < 0 && LSS_ERRNO == ENOSYS) {
-        LSS_ERRNO = old_errno;
-        LSS_NAME(sigemptyset)(set);
-        rc = LSS_NAME(_sigpending)(&set->sig[0]);
-      }
-      return rc;
-    }
-
-    LSS_INLINE int LSS_NAME(sigsuspend)(const struct kernel_sigset_t *set) {
-      int olderrno = LSS_ERRNO;
-      int rc = LSS_NAME(rt_sigsuspend)(set, (KERNEL_NSIG+7)/8);
-      if (rc < 0 && LSS_ERRNO == ENOSYS) {
-        LSS_ERRNO = olderrno;
-        rc = LSS_NAME(_sigsuspend)(
-        #ifndef __PPC__
-                                   set, 0,
-        #endif
-                                   set->sig[0]);
-      }
-      return rc;
-    }
-  #endif
-  #if defined(__i386__) ||                                                    \
-      defined(__ARM_ARCH_3__) || defined(__ARM_EABI__) ||                     \
-     (defined(__mips__) && _MIPS_SIM == _MIPS_SIM_ABI32) ||                   \
-      defined(__PPC__) ||                                                     \
-     (defined(__s390__) && !defined(__s390x__))
-    /* On these architectures, implement mmap() with mmap2(). */
-    LSS_INLINE void* LSS_NAME(mmap)(void *s, size_t l, int p, int f, int d,
-                                    int64_t o) {
-      if (o % 4096) {
-        LSS_ERRNO = EINVAL;
-        return (void *) -1;
-      }
-      return LSS_NAME(_mmap2)(s, l, p, f, d, (o / 4096));
-    }
-  #elif defined(__s390x__)
-    /* On s390x, mmap() arguments are passed in memory. */
-    LSS_INLINE void* LSS_NAME(mmap)(void *s, size_t l, int p, int f, int d,
-                                    int64_t o) {
-      unsigned long buf[6] = { (unsigned long) s, (unsigned long) l,
-                               (unsigned long) p, (unsigned long) f,
-                               (unsigned long) d, (unsigned long) o };
-      LSS_REG(2, buf);
-      LSS_BODY(void*, mmap, "0"(__r2));
-    }
-  #elif defined(__x86_64__)
-    /* Need to make sure __off64_t isn't truncated to 32-bits under x32.  */
-    LSS_INLINE void* LSS_NAME(mmap)(void *s, size_t l, int p, int f, int d,
-                                    int64_t o) {
-      LSS_BODY(6, void*, mmap, LSS_SYSCALL_ARG(s), LSS_SYSCALL_ARG(l),
-                               LSS_SYSCALL_ARG(p), LSS_SYSCALL_ARG(f),
-                               LSS_SYSCALL_ARG(d), (uint64_t)(o));
-    }
-  #else
-    /* Remaining 64-bit architectures. */
-    LSS_INLINE _syscall6(void*, mmap, void*, addr, size_t, length, int, prot,
-                         int, flags, int, fd, int64_t, offset)
-  #endif
-  #if defined(__PPC__)
-    #undef LSS_SC_LOADARGS_0
-    #define LSS_SC_LOADARGS_0(dummy...)
-    #undef LSS_SC_LOADARGS_1
-    #define LSS_SC_LOADARGS_1(arg1)                                           \
-        __sc_4  = (unsigned long) (arg1)
-    #undef LSS_SC_LOADARGS_2
-    #define LSS_SC_LOADARGS_2(arg1, arg2)                                     \
-        LSS_SC_LOADARGS_1(arg1);                                              \
-        __sc_5  = (unsigned long) (arg2)
-    #undef LSS_SC_LOADARGS_3
-    #define LSS_SC_LOADARGS_3(arg1, arg2, arg3)                               \
-        LSS_SC_LOADARGS_2(arg1, arg2);                                        \
-        __sc_6  = (unsigned long) (arg3)
-    #undef LSS_SC_LOADARGS_4
-    #define LSS_SC_LOADARGS_4(arg1, arg2, arg3, arg4)                         \
-        LSS_SC_LOADARGS_3(arg1, arg2, arg3);                                  \
-        __sc_7  = (unsigned long) (arg4)
-    #undef LSS_SC_LOADARGS_5
-    #define LSS_SC_LOADARGS_5(arg1, arg2, arg3, arg4, arg5)                   \
-        LSS_SC_LOADARGS_4(arg1, arg2, arg3, arg4);                            \
-        __sc_8  = (unsigned long) (arg5)
-    #undef LSS_SC_BODY
-    #define LSS_SC_BODY(nr, type, opt, args...)                               \
-        long __sc_ret, __sc_err;                                              \
-        {                                                                     \
-          register unsigned long __sc_0 __asm__ ("r0") = __NR_socketcall;     \
-          register unsigned long __sc_3 __asm__ ("r3") = opt;                 \
-          register unsigned long __sc_4 __asm__ ("r4");                       \
-          register unsigned long __sc_5 __asm__ ("r5");                       \
-          register unsigned long __sc_6 __asm__ ("r6");                       \
-          register unsigned long __sc_7 __asm__ ("r7");                       \
-          register unsigned long __sc_8 __asm__ ("r8");                       \
-          LSS_SC_LOADARGS_##nr(args);                                         \
-          __asm__ __volatile__                                                \
-              ("stwu 1, -48(1)\n\t"                                           \
-               "stw 4, 20(1)\n\t"                                             \
-               "stw 5, 24(1)\n\t"                                             \
-               "stw 6, 28(1)\n\t"                                             \
-               "stw 7, 32(1)\n\t"                                             \
-               "stw 8, 36(1)\n\t"                                             \
-               "addi 4, 1, 20\n\t"                                            \
-               "sc\n\t"                                                       \
-               "mfcr %0"                                                      \
-                 : "=&r" (__sc_0),                                            \
-                   "=&r" (__sc_3), "=&r" (__sc_4),                            \
-                   "=&r" (__sc_5), "=&r" (__sc_6),                            \
-                   "=&r" (__sc_7), "=&r" (__sc_8)                             \
-                 : LSS_ASMINPUT_##nr                                          \
-                 : "cr0", "ctr", "memory");                                   \
-          __sc_ret = __sc_3;                                                  \
-          __sc_err = __sc_0;                                                  \
-        }                                                                     \
-        LSS_RETURN(type, __sc_ret, __sc_err)
-
-    LSS_INLINE ssize_t LSS_NAME(recvmsg)(int s,struct kernel_msghdr *msg,
-                                         int flags){
-      LSS_SC_BODY(3, ssize_t, 17, s, msg, flags);
-    }
-
-    LSS_INLINE ssize_t LSS_NAME(sendmsg)(int s,
-                                         const struct kernel_msghdr *msg,
-                                         int flags) {
-      LSS_SC_BODY(3, ssize_t, 16, s, msg, flags);
-    }
-
-    // TODO(csilvers): why is this ifdef'ed out?
-#if 0
-    LSS_INLINE ssize_t LSS_NAME(sendto)(int s, const void *buf, size_t len,
-                                        int flags,
-                                        const struct kernel_sockaddr *to,
-                                        unsigned int tolen) {
-      LSS_BODY(6, ssize_t, 11, s, buf, len, flags, to, tolen);
-    }
-#endif
-
-    LSS_INLINE int LSS_NAME(shutdown)(int s, int how) {
-      LSS_SC_BODY(2, int, 13, s, how);
-    }
-
-    LSS_INLINE int LSS_NAME(socket)(int domain, int type, int protocol) {
-      LSS_SC_BODY(3, int, 1, domain, type, protocol);
-    }
-
-    LSS_INLINE int LSS_NAME(socketpair)(int d, int type, int protocol,
-                                        int sv[2]) {
-      LSS_SC_BODY(4, int, 8, d, type, protocol, sv);
-    }
-  #endif
-  #if defined(__ARM_EABI__) || defined (__aarch64__)
-    LSS_INLINE _syscall3(ssize_t, recvmsg, int, s, struct kernel_msghdr*, msg,
-                         int, flags)
-    LSS_INLINE _syscall3(ssize_t, sendmsg, int, s, const struct kernel_msghdr*,
-                         msg, int, flags)
-    LSS_INLINE _syscall6(ssize_t, sendto, int, s, const void*, buf, size_t,len,
-                         int, flags, const struct kernel_sockaddr*, to,
-                         unsigned int, tolen)
-    LSS_INLINE _syscall2(int, shutdown, int, s, int, how)
-    LSS_INLINE _syscall3(int, socket, int, domain, int, type, int, protocol)
-    LSS_INLINE _syscall4(int, socketpair, int, d, int, type, int, protocol,
-                         int*, sv)
-  #endif
-  #if defined(__i386__) || defined(__ARM_ARCH_3__) ||                         \
-      (defined(__mips__) && _MIPS_SIM == _MIPS_SIM_ABI32) ||                  \
-      defined(__s390__)
-    #define __NR__socketcall  __NR_socketcall
-    LSS_INLINE _syscall2(int,      _socketcall,    int,   c,
-                         va_list,                  a)
-    LSS_INLINE int LSS_NAME(socketcall)(int op, ...) {
-      int rc;
-      va_list ap;
-      va_start(ap, op);
-      rc = LSS_NAME(_socketcall)(op, ap);
-      va_end(ap);
-      return rc;
-    }
-
-    LSS_INLINE ssize_t LSS_NAME(recvmsg)(int s,struct kernel_msghdr *msg,
-                                         int flags){
-      return (ssize_t)LSS_NAME(socketcall)(17, s, msg, flags);
-    }
-
-    LSS_INLINE ssize_t LSS_NAME(sendmsg)(int s,
-                                         const struct kernel_msghdr *msg,
-                                         int flags) {
-      return (ssize_t)LSS_NAME(socketcall)(16, s, msg, flags);
-    }
-
-    LSS_INLINE ssize_t LSS_NAME(sendto)(int s, const void *buf, size_t len,
-                                        int flags,
-                                        const struct kernel_sockaddr *to,
-                                        unsigned int tolen) {
-      return (ssize_t)LSS_NAME(socketcall)(11, s, buf, len, flags, to, tolen);
-    }
-
-    LSS_INLINE int LSS_NAME(shutdown)(int s, int how) {
-      return LSS_NAME(socketcall)(13, s, how);
-    }
-
-    LSS_INLINE int LSS_NAME(socket)(int domain, int type, int protocol) {
-      return LSS_NAME(socketcall)(1, domain, type, protocol);
-    }
-
-    LSS_INLINE int LSS_NAME(socketpair)(int d, int type, int protocol,
-                                        int sv[2]) {
-      return LSS_NAME(socketcall)(8, d, type, protocol, sv);
-    }
-  #endif
-  #if defined(__NR_fstatat64)
-    LSS_INLINE _syscall4(int,   fstatat64,        int,   d,
-                         const char *,      p,
-                         struct kernel_stat64 *,   b,    int,   f)
-  #endif
-  #if defined(__NR_waitpid)
-    // waitpid is polyfilled below when not available.
-    LSS_INLINE _syscall3(pid_t, waitpid,          pid_t, p,
-                         int*,              s,    int,   o)
-  #endif
-  #if defined(__mips__)
-    /* sys_pipe() on MIPS has non-standard calling conventions, as it returns
-     * both file handles through CPU registers.
-     */
-    LSS_INLINE int LSS_NAME(pipe)(int *p) {
-      register unsigned long __v0 __asm__("$2") = __NR_pipe;
-      register unsigned long __v1 __asm__("$3");
-      register unsigned long __r7 __asm__("$7");
-      __asm__ __volatile__ ("syscall\n"
-                            : "=r"(__v0), "=r"(__v1), "=r" (__r7)
-                            : "0"(__v0)
-                            : "$8", "$9", "$10", "$11", "$12",
-                              "$13", "$14", "$15", "$24", "$25", "memory");
-      if (__r7) {
-        unsigned long __errnovalue = __v0;
-        LSS_ERRNO = __errnovalue;
-        return -1;
-      } else {
-        p[0] = __v0;
-        p[1] = __v1;
-        return 0;
-      }
-    }
-  #elif defined(__NR_pipe)
-    // pipe is polyfilled below when not available.
-    LSS_INLINE _syscall1(int,     pipe,           int *, p)
-  #endif
-  #if defined(__NR_pipe2)
-    LSS_INLINE _syscall2(int, pipe2, int *, pipefd, int, flags)
-  #endif
-  /* TODO(csilvers): see if ppc can/should support this as well              */
-  #if defined(__i386__) || defined(__ARM_ARCH_3__) ||                         \
-      defined(__ARM_EABI__) ||                                                \
-     (defined(__mips__) && _MIPS_SIM != _MIPS_SIM_ABI64) ||                   \
-     (defined(__s390__) && !defined(__s390x__))
-    #define __NR__statfs64  __NR_statfs64
-    #define __NR__fstatfs64 __NR_fstatfs64
-    LSS_INLINE _syscall3(int, _statfs64,     const char*, p,
-                         size_t, s,struct kernel_statfs64*, b)
-    LSS_INLINE _syscall3(int, _fstatfs64,          int,   f,
-                         size_t, s,struct kernel_statfs64*, b)
-    LSS_INLINE int LSS_NAME(statfs64)(const char *p,
-                                     struct kernel_statfs64 *b) {
-      return LSS_NAME(_statfs64)(p, sizeof(*b), b);
-    }
-    LSS_INLINE int LSS_NAME(fstatfs64)(int f,struct kernel_statfs64 *b) {
-      return LSS_NAME(_fstatfs64)(f, sizeof(*b), b);
-    }
-  #endif
-
-  LSS_INLINE int LSS_NAME(execv)(const char *path, const char *const argv[]) {
-    extern char **environ;
-    return LSS_NAME(execve)(path, argv, (const char *const *)environ);
-  }
-
-  LSS_INLINE pid_t LSS_NAME(gettid)(void) {
-    pid_t tid = LSS_NAME(_gettid)();
-    if (tid != -1) {
-      return tid;
-    }
-    return LSS_NAME(getpid)();
-  }
-
-  LSS_INLINE void *LSS_NAME(mremap)(void *old_address, size_t old_size,
-                                    size_t new_size, int flags, ...) {
-    va_list ap;
-    void *new_address, *rc;
-    va_start(ap, flags);
-    new_address = va_arg(ap, void *);
-    rc = LSS_NAME(_mremap)(old_address, old_size, new_size,
-                           flags, new_address);
-    va_end(ap);
-    return rc;
-  }
-
-  LSS_INLINE int LSS_NAME(ptrace_detach)(pid_t pid) {
-    /* PTRACE_DETACH can sometimes forget to wake up the tracee and it
-     * then sends job control signals to the real parent, rather than to
-     * the tracer. We reduce the risk of this happening by starting a
-     * whole new time slice, and then quickly sending a SIGCONT signal
-     * right after detaching from the tracee.
-     *
-     * We use tkill to ensure that we only issue a wakeup for the thread being
-     * detached.  Large multi threaded apps can take a long time in the kernel
-     * processing SIGCONT.
-     */
-    int rc, err;
-    LSS_NAME(sched_yield)();
-    rc = LSS_NAME(ptrace)(PTRACE_DETACH, pid, (void *)0, (void *)0);
-    err = LSS_ERRNO;
-    LSS_NAME(tkill)(pid, SIGCONT);
-    /* Old systems don't have tkill */
-    if (LSS_ERRNO == ENOSYS)
-      LSS_NAME(kill)(pid, SIGCONT);
-    LSS_ERRNO = err;
-    return rc;
-  }
-
-  LSS_INLINE int LSS_NAME(raise)(int sig) {
-    return LSS_NAME(kill)(LSS_NAME(getpid)(), sig);
-  }
-
-  LSS_INLINE int LSS_NAME(setpgrp)(void) {
-    return LSS_NAME(setpgid)(0, 0);
-  }
-
-  #if defined(__x86_64__)
-    /* Need to make sure loff_t isn't truncated to 32-bits under x32.  */
-    LSS_INLINE ssize_t LSS_NAME(pread64)(int f, void *b, size_t c, loff_t o) {
-      LSS_BODY(4, ssize_t, pread64, LSS_SYSCALL_ARG(f), LSS_SYSCALL_ARG(b),
-                                    LSS_SYSCALL_ARG(c), (uint64_t)(o));
-    }
-
-    LSS_INLINE ssize_t LSS_NAME(pwrite64)(int f, const void *b, size_t c,
-                                          loff_t o) {
-      LSS_BODY(4, ssize_t, pwrite64, LSS_SYSCALL_ARG(f), LSS_SYSCALL_ARG(b),
-                                     LSS_SYSCALL_ARG(c), (uint64_t)(o));
-    }
-
-    LSS_INLINE int LSS_NAME(readahead)(int f, loff_t o, unsigned c) {
-      LSS_BODY(3, int, readahead, LSS_SYSCALL_ARG(f), (uint64_t)(o),
-                                  LSS_SYSCALL_ARG(c));
-    }
-  #elif defined(__mips__) && _MIPS_SIM == _MIPS_SIM_ABI64
-    LSS_INLINE _syscall4(ssize_t, pread64,        int,         f,
-                         void *,         b, size_t,   c,
-                         loff_t,         o)
-    LSS_INLINE _syscall4(ssize_t, pwrite64,       int,         f,
-                         const void *,   b, size_t,   c,
-                         loff_t,         o)
-    LSS_INLINE _syscall3(int,     readahead,      int,         f,
-                         loff_t,         o, unsigned, c)
-  #else
-    #define __NR__pread64   __NR_pread64
-    #define __NR__pwrite64  __NR_pwrite64
-    #define __NR__readahead __NR_readahead
-    #if defined(__ARM_EABI__) || defined(__mips__)
-      /* On ARM and MIPS, a 64-bit parameter has to be in an even-odd register
-       * pair. Hence these calls ignore their fourth argument (r3) so that their
-       * fifth and sixth make such a pair (r4,r5).
-       */
-      #define LSS_LLARG_PAD 0,
-      LSS_INLINE _syscall6(ssize_t, _pread64,        int,         f,
-                           void *,         b, size_t, c,
-                           unsigned, skip, unsigned, o1, unsigned, o2)
-      LSS_INLINE _syscall6(ssize_t, _pwrite64,       int,         f,
-                           const void *,   b, size_t, c,
-                           unsigned, skip, unsigned, o1, unsigned, o2)
-      LSS_INLINE _syscall5(int, _readahead,          int,         f,
-                           unsigned,     skip,
-                           unsigned,       o1, unsigned, o2, size_t, c)
-    #else
-      #define LSS_LLARG_PAD
-      LSS_INLINE _syscall5(ssize_t, _pread64,        int,         f,
-                           void *,         b, size_t, c, unsigned, o1,
-                           unsigned, o2)
-      LSS_INLINE _syscall5(ssize_t, _pwrite64,       int,         f,
-                           const void *,   b, size_t, c, unsigned, o1,
-                           long, o2)
-      LSS_INLINE _syscall4(int, _readahead,          int,         f,
-                           unsigned,       o1, unsigned, o2, size_t, c)
-    #endif
-    /* We force 64bit-wide parameters onto the stack, then access each
-     * 32-bit component individually. This guarantees that we build the
-     * correct parameters independent of the native byte-order of the
-     * underlying architecture.
-     */
-    LSS_INLINE ssize_t LSS_NAME(pread64)(int fd, void *buf, size_t count,
-                                         loff_t off) {
-      union { loff_t off; unsigned arg[2]; } o = { off };
-      return LSS_NAME(_pread64)(fd, buf, count,
-                                LSS_LLARG_PAD o.arg[0], o.arg[1]);
-    }
-    LSS_INLINE ssize_t LSS_NAME(pwrite64)(int fd, const void *buf,
-                                          size_t count, loff_t off) {
-      union { loff_t off; unsigned arg[2]; } o = { off };
-      return LSS_NAME(_pwrite64)(fd, buf, count,
-                                 LSS_LLARG_PAD o.arg[0], o.arg[1]);
-    }
-    LSS_INLINE int LSS_NAME(readahead)(int fd, loff_t off, int len) {
-      union { loff_t off; unsigned arg[2]; } o = { off };
-      return LSS_NAME(_readahead)(fd, LSS_LLARG_PAD o.arg[0], o.arg[1], len);
-    }
-  #endif
-#endif
-
-/*
- * Polyfills for deprecated syscalls.
- */
-
-#if !defined(__NR_dup2)
-  LSS_INLINE int LSS_NAME(dup2)(int s, int d) {
-    return LSS_NAME(dup3)(s, d, 0);
-  }
-#endif
-
-#if !defined(__NR_open)
-  LSS_INLINE int LSS_NAME(open)(const char *pathname, int flags, int mode) {
-    return LSS_NAME(openat)(AT_FDCWD, pathname, flags, mode);
-  }
-#endif
-
-#if !defined(__NR_unlink)
-  LSS_INLINE int LSS_NAME(unlink)(const char *pathname) {
-    return LSS_NAME(unlinkat)(AT_FDCWD, pathname, 0);
-  }
-#endif
-
-#if !defined(__NR_readlink)
-  LSS_INLINE int LSS_NAME(readlink)(const char *pathname, char *buffer,
-                                    size_t size) {
-    return LSS_NAME(readlinkat)(AT_FDCWD, pathname, buffer, size);
-  }
-#endif
-
-#if !defined(__NR_pipe)
-  LSS_INLINE int LSS_NAME(pipe)(int *pipefd) {
-    return LSS_NAME(pipe2)(pipefd, 0);
-  }
-#endif
-
-#if !defined(__NR_poll)
-  LSS_INLINE int LSS_NAME(poll)(struct kernel_pollfd *fds, unsigned int nfds,
-                                int timeout) {
-   struct kernel_timespec timeout_ts;
-   struct kernel_timespec *timeout_ts_p = NULL;
-
-    if (timeout >= 0) {
-      timeout_ts.tv_sec = timeout / 1000;
-      timeout_ts.tv_nsec = (timeout % 1000) * 1000000;
-      timeout_ts_p = &timeout_ts;
-    }
-    return LSS_NAME(ppoll)(fds, nfds, timeout_ts_p, NULL, 0);
-  }
-#endif
-
-#if !defined(__NR_stat)
-  LSS_INLINE int LSS_NAME(stat)(const char *pathname,
-                                struct kernel_stat *buf) {
-    return LSS_NAME(newfstatat)(AT_FDCWD, pathname, buf, 0);
-  }
-#endif
-#if !defined(__NR_lstat)
-  LSS_INLINE int LSS_NAME(lstat)(const char *pathname,
-                                 struct kernel_stat *buf) {
-    return LSS_NAME(newfstatat)(AT_FDCWD, pathname, buf, AT_SYMLINK_NOFOLLOW);
-  }
-#endif
-
-#if !defined(__NR_waitpid)
-  LSS_INLINE pid_t LSS_NAME(waitpid)(pid_t pid, int *status, int options) {
-    return LSS_NAME(wait4)(pid, status, options, 0);
-  }
-#endif
-
-#if !defined(__NR_fork)
-// TODO: define this in an arch-independant way instead of inlining the clone
-//       syscall body.
-
-# if defined(__aarch64__)
-  LSS_INLINE pid_t LSS_NAME(fork)(void) {
-    // No fork syscall on aarch64 - implement by means of the clone syscall.
-    // Note that this does not reset glibc's cached view of the PID/TID, so
-    // some glibc interfaces might go wrong in the forked subprocess.
-    int flags = SIGCHLD;
-    void *child_stack = NULL;
-    void *parent_tidptr = NULL;
-    void *newtls = NULL;
-    void *child_tidptr = NULL;
-
-    LSS_REG(0, flags);
-    LSS_REG(1, child_stack);
-    LSS_REG(2, parent_tidptr);
-    LSS_REG(3, newtls);
-    LSS_REG(4, child_tidptr);
-    LSS_BODY(pid_t, clone, "r"(__r0), "r"(__r1), "r"(__r2), "r"(__r3),
-             "r"(__r4));
-  }
-# elif defined(__x86_64__)
-  LSS_INLINE pid_t LSS_NAME(fork)(void) {
-    // Android disallows the fork syscall on x86_64 - implement by means of the
-    // clone syscall as above for aarch64.
-    int flags = SIGCHLD;
-    void *child_stack = NULL;
-    void *parent_tidptr = NULL;
-    void *newtls = NULL;
-    void *child_tidptr = NULL;
-
-    LSS_BODY(5, pid_t, clone, LSS_SYSCALL_ARG(flags),
-             LSS_SYSCALL_ARG(child_stack), LSS_SYSCALL_ARG(parent_tidptr),
-             LSS_SYSCALL_ARG(newtls), LSS_SYSCALL_ARG(child_tidptr));
-  }
-# else
-#  error missing fork polyfill for this architecture
-# endif
-#endif
-
-/* These restore the original values of these macros saved by the
- * corresponding #pragma push_macro near the top of this file. */
-#pragma pop_macro("stat64")
-#pragma pop_macro("fstat64")
-#pragma pop_macro("lstat64")
-#pragma pop_macro("pread64")
-#pragma pop_macro("pwrite64")
-#pragma pop_macro("getdents64")
-
-#if defined(__cplusplus) && !defined(SYS_CPLUSPLUS)
-}
-#endif
-
-#endif
-#endif
diff --git a/app/src/main/cpp/shadowhook/third_party/xdl/LICENSE b/app/src/main/cpp/shadowhook/third_party/xdl/LICENSE
deleted file mode 100644
index c20d2c8..0000000
--- a/app/src/main/cpp/shadowhook/third_party/xdl/LICENSE
+++ /dev/null
@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) 2020-2023 HexHacking Team
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
diff --git a/app/src/main/cpp/shadowhook/third_party/xdl/xdl.c b/app/src/main/cpp/shadowhook/third_party/xdl/xdl.c
deleted file mode 100644
index a707961..0000000
--- a/app/src/main/cpp/shadowhook/third_party/xdl/xdl.c
+++ /dev/null
@@ -1,910 +0,0 @@
-// Copyright (c) 2020-2023 HexHacking Team
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by caikelun on 2020-10-04.
-
-#include "xdl.h"
-
-#include <android/api-level.h>
-#include <elf.h>
-#include <fcntl.h>
-#include <inttypes.h>
-#include <link.h>
-#include <pthread.h>
-#include <stdbool.h>
-#include <stddef.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <sys/auxv.h>
-#include <sys/mman.h>
-#include <sys/prctl.h>
-#include <sys/stat.h>
-#include <sys/types.h>
-#include <unistd.h>
-
-#include "xdl_iterate.h"
-#include "xdl_linker.h"
-#include "xdl_lzma.h"
-#include "xdl_util.h"
-
-#ifndef __LP64__
-#define XDL_LIB_PATH "/system/lib"
-#else
-#define XDL_LIB_PATH "/system/lib64"
-#endif
-
-#define XDL_DYNSYM_IS_EXPORT_SYM(shndx) (SHN_UNDEF != (shndx))
-#define XDL_SYMTAB_IS_EXPORT_SYM(shndx) \
-  (SHN_UNDEF != (shndx) && !((shndx) >= SHN_LORESERVE && (shndx) <= SHN_HIRESERVE))
-
-extern __attribute((weak)) unsigned long int getauxval(unsigned long int);
-
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wpadded"
-
-typedef struct xdl {
-  char *pathname;
-  uintptr_t load_bias;
-  const ElfW(Phdr) *dlpi_phdr;
-  ElfW(Half) dlpi_phnum;
-
-  struct xdl *next;     // to next xdl obj for cache in xdl_addr()
-  void *linker_handle;  // hold handle returned by xdl_linker_force_dlopen()
-
-  //
-  // (1) for searching symbols from .dynsym
-  //
-
-  bool dynsym_try_load;
-  ElfW(Sym) *dynsym;   // .dynsym
-  const char *dynstr;  // .dynstr
-
-  // .hash (SYSV hash for .dynstr)
-  struct {
-    const uint32_t *buckets;
-    uint32_t buckets_cnt;
-    const uint32_t *chains;
-    uint32_t chains_cnt;
-  } sysv_hash;
-
-  // .gnu.hash (GNU hash for .dynstr)
-  struct {
-    const uint32_t *buckets;
-    uint32_t buckets_cnt;
-    const uint32_t *chains;
-    uint32_t symoffset;
-    const ElfW(Addr) *bloom;
-    uint32_t bloom_cnt;
-    uint32_t bloom_shift;
-  } gnu_hash;
-
-  //
-  // (2) for searching symbols from .symtab
-  //
-
-  bool symtab_try_load;
-  uintptr_t base;
-
-  ElfW(Sym) *symtab;  // .symtab
-  size_t symtab_cnt;
-  char *strtab;  // .strtab
-  size_t strtab_sz;
-} xdl_t;
-
-#pragma clang diagnostic pop
-
-// load from memory
-static int xdl_dynsym_load(xdl_t *self) {
-  // find the dynamic segment
-  ElfW(Dyn) *dynamic = NULL;
-  for (size_t i = 0; i < self->dlpi_phnum; i++) {
-    const ElfW(Phdr) *phdr = &(self->dlpi_phdr[i]);
-    if (PT_DYNAMIC == phdr->p_type) {
-      dynamic = (ElfW(Dyn) *)(self->load_bias + phdr->p_vaddr);
-      break;
-    }
-  }
-  if (NULL == dynamic) return -1;
-
-  // iterate the dynamic segment
-  for (ElfW(Dyn) *entry = dynamic; entry && entry->d_tag != DT_NULL; entry++) {
-    switch (entry->d_tag) {
-      case DT_SYMTAB:  //.dynsym
-        self->dynsym = (ElfW(Sym) *)(self->load_bias + entry->d_un.d_ptr);
-        break;
-      case DT_STRTAB:  //.dynstr
-        self->dynstr = (const char *)(self->load_bias + entry->d_un.d_ptr);
-        break;
-      case DT_HASH:  //.hash
-        self->sysv_hash.buckets_cnt = ((const uint32_t *)(self->load_bias + entry->d_un.d_ptr))[0];
-        self->sysv_hash.chains_cnt = ((const uint32_t *)(self->load_bias + entry->d_un.d_ptr))[1];
-        self->sysv_hash.buckets = &(((const uint32_t *)(self->load_bias + entry->d_un.d_ptr))[2]);
-        self->sysv_hash.chains = &(self->sysv_hash.buckets[self->sysv_hash.buckets_cnt]);
-        break;
-      case DT_GNU_HASH:  //.gnu.hash
-        self->gnu_hash.buckets_cnt = ((const uint32_t *)(self->load_bias + entry->d_un.d_ptr))[0];
-        self->gnu_hash.symoffset = ((const uint32_t *)(self->load_bias + entry->d_un.d_ptr))[1];
-        self->gnu_hash.bloom_cnt = ((const uint32_t *)(self->load_bias + entry->d_un.d_ptr))[2];
-        self->gnu_hash.bloom_shift = ((const uint32_t *)(self->load_bias + entry->d_un.d_ptr))[3];
-        self->gnu_hash.bloom = (const ElfW(Addr) *)(self->load_bias + entry->d_un.d_ptr + 16);
-        self->gnu_hash.buckets = (const uint32_t *)(&(self->gnu_hash.bloom[self->gnu_hash.bloom_cnt]));
-        self->gnu_hash.chains = (const uint32_t *)(&(self->gnu_hash.buckets[self->gnu_hash.buckets_cnt]));
-        break;
-      default:
-        break;
-    }
-  }
-
-  if (NULL == self->dynsym || NULL == self->dynstr ||
-      (0 == self->sysv_hash.buckets_cnt && 0 == self->gnu_hash.buckets_cnt)) {
-    self->dynsym = NULL;
-    self->dynstr = NULL;
-    self->sysv_hash.buckets_cnt = 0;
-    self->gnu_hash.buckets_cnt = 0;
-    return -1;
-  }
-
-  return 0;
-}
-
-static void *xdl_read_file_to_heap(int file_fd, size_t file_sz, size_t data_offset, size_t data_len) {
-  if (0 == data_len) return NULL;
-  if (data_offset >= file_sz) return NULL;
-  if (data_offset + data_len > file_sz) return NULL;
-
-  if (data_offset != (size_t)lseek(file_fd, (off_t)data_offset, SEEK_SET)) return NULL;
-
-  void *data = malloc(data_len);
-  if (NULL == data) return NULL;
-
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wgnu-statement-expression"
-  if ((ssize_t)data_len != XDL_UTIL_TEMP_FAILURE_RETRY(read(file_fd, data, data_len)))
-#pragma clang diagnostic pop
-  {
-    free(data);
-    return NULL;
-  }
-
-  return data;
-}
-
-static void *xdl_read_file_to_heap_by_section(int file_fd, size_t file_sz, ElfW(Shdr) *shdr) {
-  return xdl_read_file_to_heap(file_fd, file_sz, (size_t)shdr->sh_offset, shdr->sh_size);
-}
-
-static void *xdl_read_memory_to_heap(void *mem, size_t mem_sz, size_t data_offset, size_t data_len) {
-  if (0 == data_len) return NULL;
-  if (data_offset >= mem_sz) return NULL;
-  if (data_offset + data_len > mem_sz) return NULL;
-
-  void *data = malloc(data_len);
-  if (NULL == data) return NULL;
-
-  memcpy(data, (void *)((uintptr_t)mem + data_offset), data_len);
-  return data;
-}
-
-static void *xdl_read_memory_to_heap_by_section(void *mem, size_t mem_sz, ElfW(Shdr) *shdr) {
-  return xdl_read_memory_to_heap(mem, mem_sz, (size_t)shdr->sh_offset, shdr->sh_size);
-}
-
-static void *xdl_get_memory(void *mem, size_t mem_sz, size_t data_offset, size_t data_len) {
-  if (0 == data_len) return NULL;
-  if (data_offset >= mem_sz) return NULL;
-  if (data_offset + data_len > mem_sz) return NULL;
-
-  return (void *)((uintptr_t)mem + data_offset);
-}
-
-static void *xdl_get_memory_by_section(void *mem, size_t mem_sz, ElfW(Shdr) *shdr) {
-  return xdl_get_memory(mem, mem_sz, (size_t)shdr->sh_offset, shdr->sh_size);
-}
-
-// load from disk and memory
-static int xdl_symtab_load_from_debugdata(xdl_t *self, int file_fd, size_t file_sz,
-                                          ElfW(Shdr) *shdr_debugdata) {
-  void *debugdata = NULL;
-  ElfW(Shdr) *shdrs = NULL;
-  int r = -1;
-
-  // get zipped .gnu_debugdata
-  uint8_t *debugdata_zip = (uint8_t *)xdl_read_file_to_heap_by_section(file_fd, file_sz, shdr_debugdata);
-  if (NULL == debugdata_zip) return -1;
-
-  // get unzipped .gnu_debugdata
-  size_t debugdata_sz;
-  if (0 != xdl_lzma_decompress(debugdata_zip, shdr_debugdata->sh_size, (uint8_t **)&debugdata, &debugdata_sz))
-    goto end;
-
-  // get ELF header
-  ElfW(Ehdr) *ehdr = (ElfW(Ehdr) *)debugdata;
-  if (0 == ehdr->e_shnum || ehdr->e_shentsize != sizeof(ElfW(Shdr))) goto end;
-
-  // get section headers
-  shdrs = (ElfW(Shdr) *)xdl_read_memory_to_heap(debugdata, debugdata_sz, (size_t)ehdr->e_shoff,
-                                                ehdr->e_shentsize * ehdr->e_shnum);
-  if (NULL == shdrs) goto end;
-
-  // get .shstrtab
-  if (SHN_UNDEF == ehdr->e_shstrndx || ehdr->e_shstrndx >= ehdr->e_shnum) goto end;
-  char *shstrtab = (char *)xdl_get_memory_by_section(debugdata, debugdata_sz, shdrs + ehdr->e_shstrndx);
-  if (NULL == shstrtab) goto end;
-
-  // find .symtab & .strtab
-  for (ElfW(Shdr) *shdr = shdrs; shdr < shdrs + ehdr->e_shnum; shdr++) {
-    char *shdr_name = shstrtab + shdr->sh_name;
-
-    if (SHT_SYMTAB == shdr->sh_type && 0 == strcmp(".symtab", shdr_name)) {
-      // get & check associated .strtab section
-      if (shdr->sh_link >= ehdr->e_shnum) continue;
-      ElfW(Shdr) *shdr_strtab = shdrs + shdr->sh_link;
-      if (SHT_STRTAB != shdr_strtab->sh_type) continue;
-
-      // get .symtab & .strtab
-      ElfW(Sym) *symtab = (ElfW(Sym) *)xdl_read_memory_to_heap_by_section(debugdata, debugdata_sz, shdr);
-      if (NULL == symtab) continue;
-      char *strtab = (char *)xdl_read_memory_to_heap_by_section(debugdata, debugdata_sz, shdr_strtab);
-      if (NULL == strtab) {
-        free(symtab);
-        continue;
-      }
-
-      // OK
-      self->symtab = symtab;
-      self->symtab_cnt = shdr->sh_size / shdr->sh_entsize;
-      self->strtab = strtab;
-      self->strtab_sz = shdr_strtab->sh_size;
-      r = 0;
-      break;
-    }
-  }
-
-end:
-  free(debugdata_zip);
-  if (NULL != debugdata) free(debugdata);
-  if (NULL != shdrs) free(shdrs);
-  return r;
-}
-
-// load from disk and memory
-static int xdl_symtab_load(xdl_t *self) {
-  if ('[' == self->pathname[0]) return -1;
-
-  int r = -1;
-  ElfW(Shdr) *shdrs = NULL;
-  char *shstrtab = NULL;
-
-  // get base address
-  uintptr_t vaddr_min = UINTPTR_MAX;
-  for (size_t i = 0; i < self->dlpi_phnum; i++) {
-    const ElfW(Phdr) *phdr = &(self->dlpi_phdr[i]);
-    if (PT_LOAD == phdr->p_type) {
-      if (vaddr_min > phdr->p_vaddr) vaddr_min = phdr->p_vaddr;
-    }
-  }
-  if (UINTPTR_MAX == vaddr_min) return -1;
-  self->base = self->load_bias + vaddr_min;
-
-  // open file
-  int flags = O_RDONLY | O_CLOEXEC;
-  int file_fd;
-  if ('/' == self->pathname[0]) {
-    file_fd = open(self->pathname, flags);
-  } else {
-    char full_pathname[1024];
-    // try the fast method
-    snprintf(full_pathname, sizeof(full_pathname), "%s/%s", XDL_LIB_PATH, self->pathname);
-    file_fd = open(full_pathname, flags);
-    if (file_fd < 0) {
-      // try the slow method
-      if (0 != xdl_iterate_get_full_pathname(self->base, full_pathname, sizeof(full_pathname))) return -1;
-      file_fd = open(full_pathname, flags);
-    }
-  }
-  if (file_fd < 0) return -1;
-  struct stat st;
-  if (0 != fstat(file_fd, &st)) goto end;
-  size_t file_sz = (size_t)st.st_size;
-
-  // get ELF header
-  ElfW(Ehdr) *ehdr = (ElfW(Ehdr) *)self->base;
-  if (0 == ehdr->e_shnum || ehdr->e_shentsize != sizeof(ElfW(Shdr))) goto end;
-
-  // get section headers
-  shdrs = (ElfW(Shdr) *)xdl_read_file_to_heap(file_fd, file_sz, (size_t)ehdr->e_shoff,
-                                              ehdr->e_shentsize * ehdr->e_shnum);
-  if (NULL == shdrs) goto end;
-
-  // get .shstrtab
-  if (SHN_UNDEF == ehdr->e_shstrndx || ehdr->e_shstrndx >= ehdr->e_shnum) goto end;
-  shstrtab = (char *)xdl_read_file_to_heap_by_section(file_fd, file_sz, shdrs + ehdr->e_shstrndx);
-  if (NULL == shstrtab) goto end;
-
-  // find .symtab & .strtab
-  for (ElfW(Shdr) *shdr = shdrs; shdr < shdrs + ehdr->e_shnum; shdr++) {
-    char *shdr_name = shstrtab + shdr->sh_name;
-
-    if (SHT_SYMTAB == shdr->sh_type && 0 == strcmp(".symtab", shdr_name)) {
-      // get & check associated .strtab section
-      if (shdr->sh_link >= ehdr->e_shnum) continue;
-      ElfW(Shdr) *shdr_strtab = shdrs + shdr->sh_link;
-      if (SHT_STRTAB != shdr_strtab->sh_type) continue;
-
-      // get .symtab & .strtab
-      ElfW(Sym) *symtab = (ElfW(Sym) *)xdl_read_file_to_heap_by_section(file_fd, file_sz, shdr);
-      if (NULL == symtab) continue;
-      char *strtab = (char *)xdl_read_file_to_heap_by_section(file_fd, file_sz, shdr_strtab);
-      if (NULL == strtab) {
-        free(symtab);
-        continue;
-      }
-
-      // OK
-      self->symtab = symtab;
-      self->symtab_cnt = shdr->sh_size / shdr->sh_entsize;
-      self->strtab = strtab;
-      self->strtab_sz = shdr_strtab->sh_size;
-      r = 0;
-      break;
-    } else if (SHT_PROGBITS == shdr->sh_type && 0 == strcmp(".gnu_debugdata", shdr_name)) {
-      if (0 == xdl_symtab_load_from_debugdata(self, file_fd, file_sz, shdr)) {
-        // OK
-        r = 0;
-        break;
-      }
-    }
-  }
-
-end:
-  close(file_fd);
-  if (NULL != shdrs) free(shdrs);
-  if (NULL != shstrtab) free(shstrtab);
-  return r;
-}
-
-static xdl_t *xdl_find_from_auxv(unsigned long type, const char *pathname) {
-  if (NULL == getauxval) return NULL;  // API level < 18
-
-  uintptr_t val = (uintptr_t)getauxval(type);
-  if (0 == val) return NULL;
-
-  // get base
-  uintptr_t base = (AT_PHDR == type ? (val & (~0xffful)) : val);
-  if (0 != memcmp((void *)base, ELFMAG, SELFMAG)) return NULL;
-
-  // ELF info
-  ElfW(Ehdr) *ehdr = (ElfW(Ehdr) *)base;
-  const ElfW(Phdr) *dlpi_phdr = (const ElfW(Phdr) *)(base + ehdr->e_phoff);
-  ElfW(Half) dlpi_phnum = ehdr->e_phnum;
-
-  // get bias
-  uintptr_t min_vaddr = UINTPTR_MAX;
-  for (size_t i = 0; i < dlpi_phnum; i++) {
-    const ElfW(Phdr) *phdr = &(dlpi_phdr[i]);
-    if (PT_LOAD == phdr->p_type) {
-      if (min_vaddr > phdr->p_vaddr) min_vaddr = phdr->p_vaddr;
-    }
-  }
-  if (UINTPTR_MAX == min_vaddr || base < min_vaddr) return NULL;
-  uintptr_t load_bias = base - min_vaddr;
-
-  // create xDL object
-  xdl_t *self;
-  if (NULL == (self = calloc(1, sizeof(xdl_t)))) return NULL;
-  if (NULL == (self->pathname = strdup(pathname))) {
-    free(self);
-    return NULL;
-  }
-  self->load_bias = load_bias;
-  self->dlpi_phdr = dlpi_phdr;
-  self->dlpi_phnum = dlpi_phnum;
-  self->dynsym_try_load = false;
-  self->symtab_try_load = false;
-  return self;
-}
-
-static int xdl_find_iterate_cb(struct dl_phdr_info *info, size_t size, void *arg) {
-  (void)size;
-
-  uintptr_t *pkg = (uintptr_t *)arg;
-  xdl_t **self = (xdl_t **)*pkg++;
-  const char *filename = (const char *)*pkg;
-
-  // check load_bias
-  if (0 == info->dlpi_addr || NULL == info->dlpi_name) return 0;
-
-  // check pathname
-  if ('[' == filename[0]) {
-    if (0 != strcmp(info->dlpi_name, filename)) return 0;
-  } else if ('/' == filename[0]) {
-    if ('/' == info->dlpi_name[0]) {
-      if (0 != strcmp(info->dlpi_name, filename)) return 0;
-    } else {
-      if (!xdl_util_ends_with(filename, info->dlpi_name)) return 0;
-    }
-  } else {
-    if ('/' == info->dlpi_name[0]) {
-      if (!xdl_util_ends_with(info->dlpi_name, filename)) return 0;
-    } else {
-      if (0 != strcmp(info->dlpi_name, filename)) return 0;
-    }
-  }
-
-  // found the target ELF
-  if (NULL == ((*self) = calloc(1, sizeof(xdl_t)))) return 1;  // return failed
-  if (NULL == ((*self)->pathname = strdup(info->dlpi_name))) {
-    free(*self);
-    *self = NULL;
-    return 1;  // return failed
-  }
-  (*self)->load_bias = info->dlpi_addr;
-  (*self)->dlpi_phdr = info->dlpi_phdr;
-  (*self)->dlpi_phnum = info->dlpi_phnum;
-  (*self)->dynsym_try_load = false;
-  (*self)->symtab_try_load = false;
-  return 1;  // return OK
-}
-
-static xdl_t *xdl_find(const char *filename) {
-  // from auxv (linker, vDSO)
-  xdl_t *self = NULL;
-  if (xdl_util_ends_with(filename, XDL_UTIL_LINKER_BASENAME))
-    self = xdl_find_from_auxv(AT_BASE, XDL_UTIL_LINKER_PATHNAME);
-  else if (xdl_util_ends_with(filename, XDL_UTIL_VDSO_BASENAME))
-    self = xdl_find_from_auxv(AT_SYSINFO_EHDR, XDL_UTIL_VDSO_BASENAME);
-
-  // from auxv (app_process)
-  const char *basename, *pathname;
-#if (defined(__arm__) || defined(__i386__)) && __ANDROID_API__ < __ANDROID_API_L__
-  if (xdl_util_get_api_level() < __ANDROID_API_L__) {
-    basename = XDL_UTIL_APP_PROCESS_BASENAME_K;
-    pathname = XDL_UTIL_APP_PROCESS_PATHNAME_K;
-  } else
-#endif
-  {
-    basename = XDL_UTIL_APP_PROCESS_BASENAME;
-    pathname = XDL_UTIL_APP_PROCESS_PATHNAME;
-  }
-  if (xdl_util_ends_with(filename, basename)) self = xdl_find_from_auxv(AT_PHDR, pathname);
-
-  if (NULL != self) return self;
-
-  // from dl_iterate_phdr
-  uintptr_t pkg[2] = {(uintptr_t)&self, (uintptr_t)filename};
-  xdl_iterate_phdr(xdl_find_iterate_cb, pkg, XDL_DEFAULT);
-  return self;
-}
-
-static void *xdl_open_always_force(const char *filename) {
-  // always force dlopen()
-  void *linker_handle = xdl_linker_force_dlopen(filename);
-  if (NULL == linker_handle) return NULL;
-
-  // find
-  xdl_t *self = xdl_find(filename);
-  if (NULL == self)
-    dlclose(linker_handle);
-  else
-    self->linker_handle = linker_handle;
-
-  return (void *)self;
-}
-
-static void *xdl_open_try_force(const char *filename) {
-  // find
-  xdl_t *self = xdl_find(filename);
-  if (NULL != self) return (void *)self;
-
-  // try force dlopen()
-  void *linker_handle = xdl_linker_force_dlopen(filename);
-  if (NULL == linker_handle) return NULL;
-
-  // find again
-  self = xdl_find(filename);
-  if (NULL == self)
-    dlclose(linker_handle);
-  else
-    self->linker_handle = linker_handle;
-
-  return (void *)self;
-}
-
-void *xdl_open(const char *filename, int flags) {
-  if (NULL == filename) return NULL;
-
-  if (flags & XDL_ALWAYS_FORCE_LOAD)
-    return xdl_open_always_force(filename);
-  else if (flags & XDL_TRY_FORCE_LOAD)
-    return xdl_open_try_force(filename);
-  else
-    return xdl_find(filename);
-}
-
-void *xdl_close(void *handle) {
-  if (NULL == handle) return NULL;
-
-  xdl_t *self = (xdl_t *)handle;
-  if (NULL != self->pathname) free(self->pathname);
-  if (NULL != self->symtab) free(self->symtab);
-  if (NULL != self->strtab) free(self->strtab);
-
-  void *linker_handle = self->linker_handle;
-  free(self);
-  return linker_handle;
-}
-
-static uint32_t xdl_sysv_hash(const uint8_t *name) {
-  uint32_t h = 0, g;
-
-  while (*name) {
-    h = (h << 4) + *name++;
-    g = h & 0xf0000000;
-    h ^= g;
-    h ^= g >> 24;
-  }
-  return h;
-}
-
-static uint32_t xdl_gnu_hash(const uint8_t *name) {
-  uint32_t h = 5381;
-
-  while (*name) {
-    h += (h << 5) + *name++;
-  }
-  return h;
-}
-
-static ElfW(Sym) *xdl_dynsym_find_symbol_use_sysv_hash(xdl_t *self, const char *sym_name) {
-  uint32_t hash = xdl_sysv_hash((const uint8_t *)sym_name);
-
-  for (uint32_t i = self->sysv_hash.buckets[hash % self->sysv_hash.buckets_cnt]; 0 != i;
-       i = self->sysv_hash.chains[i]) {
-    ElfW(Sym) *sym = self->dynsym + i;
-    if (0 != strcmp(self->dynstr + sym->st_name, sym_name)) continue;
-    return sym;
-  }
-
-  return NULL;
-}
-
-static ElfW(Sym) *xdl_dynsym_find_symbol_use_gnu_hash(xdl_t *self, const char *sym_name) {
-  uint32_t hash = xdl_gnu_hash((const uint8_t *)sym_name);
-
-  static uint32_t elfclass_bits = sizeof(ElfW(Addr)) * 8;
-  size_t word = self->gnu_hash.bloom[(hash / elfclass_bits) % self->gnu_hash.bloom_cnt];
-  size_t mask = 0 | (size_t)1 << (hash % elfclass_bits) |
-                (size_t)1 << ((hash >> self->gnu_hash.bloom_shift) % elfclass_bits);
-
-  // if at least one bit is not set, this symbol is surely missing
-  if ((word & mask) != mask) return NULL;
-
-  // ignore STN_UNDEF
-  uint32_t i = self->gnu_hash.buckets[hash % self->gnu_hash.buckets_cnt];
-  if (i < self->gnu_hash.symoffset) return NULL;
-
-  // loop through the chain
-  while (1) {
-    ElfW(Sym) *sym = self->dynsym + i;
-    uint32_t sym_hash = self->gnu_hash.chains[i - self->gnu_hash.symoffset];
-
-    if ((hash | (uint32_t)1) == (sym_hash | (uint32_t)1)) {
-      if (0 == strcmp(self->dynstr + sym->st_name, sym_name)) {
-        return sym;
-      }
-    }
-
-    // chain ends with an element with the lowest bit set to 1
-    if (sym_hash & (uint32_t)1) break;
-
-    i++;
-  }
-
-  return NULL;
-}
-
-void *xdl_sym(void *handle, const char *symbol, size_t *symbol_size) {
-  if (NULL == handle || NULL == symbol) return NULL;
-  if (NULL != symbol_size) *symbol_size = 0;
-
-  xdl_t *self = (xdl_t *)handle;
-
-  // load .dynsym only once
-  if (!self->dynsym_try_load) {
-    self->dynsym_try_load = true;
-    if (0 != xdl_dynsym_load(self)) return NULL;
-  }
-
-  // find symbol
-  if (NULL == self->dynsym) return NULL;
-  ElfW(Sym) *sym = NULL;
-  if (self->gnu_hash.buckets_cnt > 0) {
-    // use GNU hash (.gnu.hash -> .dynsym -> .dynstr), O(x) + O(1) + O(1)
-    sym = xdl_dynsym_find_symbol_use_gnu_hash(self, symbol);
-  }
-  if (NULL == sym && self->sysv_hash.buckets_cnt > 0) {
-    // use SYSV hash (.hash -> .dynsym -> .dynstr), O(x) + O(1) + O(1)
-    sym = xdl_dynsym_find_symbol_use_sysv_hash(self, symbol);
-  }
-  if (NULL == sym || !XDL_DYNSYM_IS_EXPORT_SYM(sym->st_shndx)) return NULL;
-
-  if (NULL != symbol_size) *symbol_size = sym->st_size;
-  return (void *)(self->load_bias + sym->st_value);
-}
-
-// clang-format off
-/*
- * For internal symbols in .symtab, LLVM may add some suffixes (for example for thinLTO).
- * The format of the suffix is: ".xxxx.[hash]". LLVM may add multiple suffixes at once.
- * The symbol name after removing these all suffixes is called canonical name.
- *
- * Because the hash part in the suffix may change when recompiled, so here we only match
- * the canonical name.
- *
- * IN ADDITION: According to C/C++ syntax, it is illegal for a function name to contain
- * dot character('.'), either in the middle or at the end.
- *
- * samples:
- *
- * symbol name in .symtab          lookup                       is match
- * ----------------------          ----------------             --------
- * abcd                            abc                          N
- * abcd                            abcd                         Y
- * abcd.llvm.10190306339727611508  abc                          N
- * abcd.llvm.10190306339727611508  abcd                         Y
- * abcd.llvm.10190306339727611508  abcd.                        N
- * abcd.llvm.10190306339727611508  abcd.llvm                    Y
- * abcd.llvm.10190306339727611508  abcd.llvm.                   N
- * abcd.__uniq.513291356003753     abcd.__uniq.51329            N
- * abcd.__uniq.513291356003753     abcd.__uniq.513291356003753  Y
- */
-// clang-format on
-static inline bool xdl_dsym_is_match(const char *str, const char *sym, size_t str_len) {
-  if (__predict_false(0 == str_len)) return false;
-
-  do {
-    if (*str != *sym) return __predict_false('.' == *str && '\0' == *sym);
-    str++;
-    sym++;
-    if ('\0' == *str) break;
-  } while (0 != --str_len);
-
-  return true;
-}
-
-void *xdl_dsym(void *handle, const char *symbol, size_t *symbol_size) {
-  if (NULL == handle || NULL == symbol) return NULL;
-  if (NULL != symbol_size) *symbol_size = 0;
-
-  xdl_t *self = (xdl_t *)handle;
-
-  // load .symtab only once
-  if (!self->symtab_try_load) {
-    self->symtab_try_load = true;
-    if (0 != xdl_symtab_load(self)) return NULL;
-  }
-
-  // find symbol
-  if (NULL == self->symtab) return NULL;
-  for (size_t i = 0; i < self->symtab_cnt; i++) {
-    ElfW(Sym) *sym = self->symtab + i;
-
-    if (!XDL_SYMTAB_IS_EXPORT_SYM(sym->st_shndx)) continue;
-    // if (0 != strncmp(self->strtab + sym->st_name, symbol, self->strtab_sz - sym->st_name)) continue;
-    if (!xdl_dsym_is_match(self->strtab + sym->st_name, symbol, self->strtab_sz - sym->st_name)) continue;
-
-    if (NULL != symbol_size) *symbol_size = sym->st_size;
-    return (void *)(self->load_bias + sym->st_value);
-  }
-
-  return NULL;
-}
-
-static bool xdl_elf_is_match(uintptr_t load_bias, const ElfW(Phdr) *dlpi_phdr, ElfW(Half) dlpi_phnum,
-                             uintptr_t addr) {
-  if (addr < load_bias) return false;
-
-  uintptr_t vaddr = addr - load_bias;
-  for (size_t i = 0; i < dlpi_phnum; i++) {
-    const ElfW(Phdr) *phdr = &(dlpi_phdr[i]);
-    if (PT_LOAD != phdr->p_type) continue;
-
-    if (phdr->p_vaddr <= vaddr && vaddr < phdr->p_vaddr + phdr->p_memsz) return true;
-  }
-
-  return false;
-}
-
-static int xdl_open_by_addr_iterate_cb(struct dl_phdr_info *info, size_t size, void *arg) {
-  (void)size;
-
-  uintptr_t *pkg = (uintptr_t *)arg;
-  xdl_t **self = (xdl_t **)*pkg++;
-  uintptr_t addr = *pkg;
-
-  if (xdl_elf_is_match(info->dlpi_addr, info->dlpi_phdr, info->dlpi_phnum, addr)) {
-    // found the target ELF
-    if (NULL == ((*self) = calloc(1, sizeof(xdl_t)))) return 1;  // failed
-    if (NULL == ((*self)->pathname = strdup(info->dlpi_name))) {
-      free(*self);
-      *self = NULL;
-      return 1;  // failed
-    }
-    (*self)->load_bias = info->dlpi_addr;
-    (*self)->dlpi_phdr = info->dlpi_phdr;
-    (*self)->dlpi_phnum = info->dlpi_phnum;
-    (*self)->dynsym_try_load = false;
-    (*self)->symtab_try_load = false;
-    return 1;  // OK
-  }
-
-  return 0;  // mismatch
-}
-
-static void *xdl_open_by_addr(void *addr) {
-  if (NULL == addr) return NULL;
-
-  xdl_t *self = NULL;
-  uintptr_t pkg[2] = {(uintptr_t)&self, (uintptr_t)addr};
-  xdl_iterate_phdr(xdl_open_by_addr_iterate_cb, pkg, XDL_DEFAULT);
-
-  return (void *)self;
-}
-
-static bool xdl_sym_is_match(ElfW(Sym) *sym, uintptr_t offset, bool is_symtab) {
-  if (is_symtab) {
-    if (!XDL_SYMTAB_IS_EXPORT_SYM(sym->st_shndx)) false;
-  } else {
-    if (!XDL_DYNSYM_IS_EXPORT_SYM(sym->st_shndx)) false;
-  }
-
-  return ELF_ST_TYPE(sym->st_info) != STT_TLS && offset >= sym->st_value &&
-         offset < sym->st_value + sym->st_size;
-}
-
-static ElfW(Sym) *xdl_sym_by_addr(void *handle, void *addr) {
-  xdl_t *self = (xdl_t *)handle;
-
-  // load .dynsym only once
-  if (!self->dynsym_try_load) {
-    self->dynsym_try_load = true;
-    if (0 != xdl_dynsym_load(self)) return NULL;
-  }
-
-  // find symbol
-  if (NULL == self->dynsym) return NULL;
-  uintptr_t offset = (uintptr_t)addr - self->load_bias;
-  if (self->gnu_hash.buckets_cnt > 0) {
-    const uint32_t *chains_all = self->gnu_hash.chains - self->gnu_hash.symoffset;
-    for (size_t i = 0; i < self->gnu_hash.buckets_cnt; i++) {
-      uint32_t n = self->gnu_hash.buckets[i];
-      if (n < self->gnu_hash.symoffset) continue;
-      do {
-        ElfW(Sym) *sym = self->dynsym + n;
-        if (xdl_sym_is_match(sym, offset, false)) return sym;
-      } while ((chains_all[n++] & 1) == 0);
-    }
-  } else if (self->sysv_hash.chains_cnt > 0) {
-    for (size_t i = 0; i < self->sysv_hash.chains_cnt; i++) {
-      ElfW(Sym) *sym = self->dynsym + i;
-      if (xdl_sym_is_match(sym, offset, false)) return sym;
-    }
-  }
-
-  return NULL;
-}
-
-static ElfW(Sym) *xdl_dsym_by_addr(void *handle, void *addr) {
-  xdl_t *self = (xdl_t *)handle;
-
-  // load .symtab only once
-  if (!self->symtab_try_load) {
-    self->symtab_try_load = true;
-    if (0 != xdl_symtab_load(self)) return NULL;
-  }
-
-  // find symbol
-  if (NULL == self->symtab) return NULL;
-  uintptr_t offset = (uintptr_t)addr - self->load_bias;
-  for (size_t i = 0; i < self->symtab_cnt; i++) {
-    ElfW(Sym) *sym = self->symtab + i;
-    if (xdl_sym_is_match(sym, offset, true)) return sym;
-  }
-
-  return NULL;
-}
-
-int xdl_addr(void *addr, xdl_info_t *info, void **cache) {
-  if (NULL == addr || NULL == info || NULL == cache) return 0;
-
-  memset(info, 0, sizeof(Dl_info));
-
-  // find handle from cache
-  xdl_t *handle = NULL;
-  for (handle = *((xdl_t **)cache); NULL != handle; handle = handle->next)
-    if (xdl_elf_is_match(handle->load_bias, handle->dlpi_phdr, handle->dlpi_phnum, (uintptr_t)addr)) break;
-
-  // create new handle, save handle to cache
-  if (NULL == handle) {
-    handle = (xdl_t *)xdl_open_by_addr(addr);
-    if (NULL == handle) return 0;
-    handle->next = *(xdl_t **)cache;
-    *(xdl_t **)cache = handle;
-  }
-
-  // we have at least: load_bias, pathname, dlpi_phdr, dlpi_phnum
-  info->dli_fbase = (void *)handle->load_bias;
-  info->dli_fname = handle->pathname;
-  info->dli_sname = NULL;
-  info->dli_saddr = 0;
-  info->dli_ssize = 0;
-  info->dlpi_phdr = handle->dlpi_phdr;
-  info->dlpi_phnum = (size_t)handle->dlpi_phnum;
-
-  // keep looking for: symbol name, symbol offset, symbol size
-  ElfW(Sym) *sym;
-  if (NULL != (sym = xdl_sym_by_addr((void *)handle, addr))) {
-    info->dli_sname = handle->dynstr + sym->st_name;
-    info->dli_saddr = (void *)(handle->load_bias + sym->st_value);
-    info->dli_ssize = sym->st_size;
-  } else if (NULL != (sym = xdl_dsym_by_addr((void *)handle, addr))) {
-    info->dli_sname = handle->strtab + sym->st_name;
-    info->dli_saddr = (void *)(handle->load_bias + sym->st_value);
-    info->dli_ssize = sym->st_size;
-  }
-
-  return 1;
-}
-
-void xdl_addr_clean(void **cache) {
-  if (NULL == cache) return;
-
-  xdl_t *handle = *((xdl_t **)cache);
-  while (NULL != handle) {
-    xdl_t *tmp = handle;
-    handle = handle->next;
-    xdl_close(tmp);
-  }
-  *cache = NULL;
-}
-
-int xdl_iterate_phdr(int (*callback)(struct dl_phdr_info *, size_t, void *), void *data, int flags) {
-  if (NULL == callback) return 0;
-
-  return xdl_iterate_phdr_impl(callback, data, flags);
-}
-
-int xdl_info(void *handle, int request, void *info) {
-  if (NULL == handle || XDL_DI_DLINFO != request || NULL == info) return -1;
-
-  xdl_t *self = (xdl_t *)handle;
-  xdl_info_t *dlinfo = (xdl_info_t *)info;
-
-  dlinfo->dli_fbase = (void *)self->load_bias;
-  dlinfo->dli_fname = self->pathname;
-  dlinfo->dli_sname = NULL;
-  dlinfo->dli_saddr = 0;
-  dlinfo->dli_ssize = 0;
-  dlinfo->dlpi_phdr = self->dlpi_phdr;
-  dlinfo->dlpi_phnum = (size_t)self->dlpi_phnum;
-  return 0;
-}
diff --git a/app/src/main/cpp/shadowhook/third_party/xdl/xdl.h b/app/src/main/cpp/shadowhook/third_party/xdl/xdl.h
deleted file mode 100644
index d927c43..0000000
--- a/app/src/main/cpp/shadowhook/third_party/xdl/xdl.h
+++ /dev/null
@@ -1,92 +0,0 @@
-// Copyright (c) 2020-2023 HexHacking Team
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by caikelun on 2020-10-04.
-
-//
-// xDL version: 2.1.0
-//
-// xDL is an enhanced implementation of the Android DL series functions.
-// For more information, documentation, and the latest version please check:
-// https://github.com/hexhacking/xDL
-//
-
-#ifndef IO_GITHUB_HEXHACKING_XDL
-#define IO_GITHUB_HEXHACKING_XDL
-
-#include <dlfcn.h>
-#include <link.h>
-#include <stddef.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef struct {
-  // same as Dl_info:
-  const char *dli_fname;  // Pathname of shared object that contains address.
-  void *dli_fbase;        // Address at which shared object is loaded.
-  const char *dli_sname;  // Name of nearest symbol with address lower than addr.
-  void *dli_saddr;        // Exact address of symbol named in dli_sname.
-  // added by xDL:
-  size_t dli_ssize;             // Symbol size of nearest symbol with address lower than addr.
-  const ElfW(Phdr) *dlpi_phdr;  // Pointer to array of ELF program headers for this object.
-  size_t dlpi_phnum;            // Number of items in dlpi_phdr.
-} xdl_info_t;
-
-//
-// Default value for flags in both xdl_open() and xdl_iterate_phdr().
-//
-#define XDL_DEFAULT 0x00
-
-//
-// Enhanced dlopen() / dlclose() / dlsym().
-//
-#define XDL_TRY_FORCE_LOAD    0x01
-#define XDL_ALWAYS_FORCE_LOAD 0x02
-void *xdl_open(const char *filename, int flags);
-void *xdl_close(void *handle);
-void *xdl_sym(void *handle, const char *symbol, size_t *symbol_size);
-void *xdl_dsym(void *handle, const char *symbol, size_t *symbol_size);
-
-//
-// Enhanced dladdr().
-//
-int xdl_addr(void *addr, xdl_info_t *info, void **cache);
-void xdl_addr_clean(void **cache);
-
-//
-// Enhanced dl_iterate_phdr().
-//
-#define XDL_FULL_PATHNAME 0x01
-int xdl_iterate_phdr(int (*callback)(struct dl_phdr_info *, size_t, void *), void *data, int flags);
-
-//
-// Custom dlinfo().
-//
-#define XDL_DI_DLINFO 1  // type of info: xdl_info_t
-int xdl_info(void *handle, int request, void *info);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_iterate.c b/app/src/main/cpp/shadowhook/third_party/xdl/xdl_iterate.c
deleted file mode 100644
index b89b642..0000000
--- a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_iterate.c
+++ /dev/null
@@ -1,297 +0,0 @@
-// Copyright (c) 2020-2023 HexHacking Team
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by caikelun on 2020-10-04.
-
-#include "xdl_iterate.h"
-
-#include <android/api-level.h>
-#include <ctype.h>
-#include <dlfcn.h>
-#include <elf.h>
-#include <inttypes.h>
-#include <link.h>
-#include <pthread.h>
-#include <stdbool.h>
-#include <stdint.h>
-#include <stdio.h>
-#include <string.h>
-#include <sys/auxv.h>
-
-#include "xdl.h"
-#include "xdl_linker.h"
-#include "xdl_util.h"
-
-/*
- * =========================================================================================================
- * API-LEVEL  ANDROID-VERSION  SOLUTION
- * =========================================================================================================
- * 16         4.1              /proc/self/maps
- * 17         4.2              /proc/self/maps
- * 18         4.3              /proc/self/maps
- * 19         4.4              /proc/self/maps
- * 20         4.4W             /proc/self/maps
- * ---------------------------------------------------------------------------------------------------------
- * 21         5.0              dl_iterate_phdr() + __dl__ZL10g_dl_mutex + linker/linker64 from getauxval(3)
- * 22         5.1              dl_iterate_phdr() + __dl__ZL10g_dl_mutex + linker/linker64 from getauxval(3)
- * ---------------------------------------------------------------------------------------------------------
- * 23         >= 6.0           dl_iterate_phdr() + linker/linker64 from getauxval(3)
- * =========================================================================================================
- */
-
-extern __attribute((weak)) int dl_iterate_phdr(int (*)(struct dl_phdr_info *, size_t, void *), void *);
-extern __attribute((weak)) unsigned long int getauxval(unsigned long int);
-
-static uintptr_t xdl_iterate_get_min_vaddr(struct dl_phdr_info *info) {
-  uintptr_t min_vaddr = UINTPTR_MAX;
-  for (size_t i = 0; i < info->dlpi_phnum; i++) {
-    const ElfW(Phdr) *phdr = &(info->dlpi_phdr[i]);
-    if (PT_LOAD == phdr->p_type) {
-      if (min_vaddr > phdr->p_vaddr) min_vaddr = phdr->p_vaddr;
-    }
-  }
-  return min_vaddr;
-}
-
-static int xdl_iterate_open_or_rewind_maps(FILE **maps) {
-  if (NULL == *maps) {
-    *maps = fopen("/proc/self/maps", "r");
-    if (NULL == *maps) return -1;
-  } else
-    rewind(*maps);
-
-  return 0;
-}
-
-static int xdl_iterate_get_pathname_from_maps(uintptr_t base, char *buf, size_t buf_len, FILE **maps) {
-  // open or rewind maps-file
-  if (0 != xdl_iterate_open_or_rewind_maps(maps)) return -1;  // failed
-
-  char line[1024];
-  while (fgets(line, sizeof(line), *maps)) {
-    // check base address
-    uintptr_t start, end;
-    if (2 != sscanf(line, "%" SCNxPTR "-%" SCNxPTR " r", &start, &end)) continue;
-    if (base < start) break;  // failed
-    if (base >= end) continue;
-
-    // get pathname
-    char *pathname = strchr(line, '/');
-    if (NULL == pathname) break;  // failed
-    xdl_util_trim_ending(pathname);
-
-    // found it
-    strlcpy(buf, pathname, buf_len);
-    return 0;  // OK
-  }
-
-  return -1;  // failed
-}
-
-static int xdl_iterate_by_linker_cb(struct dl_phdr_info *info, size_t size, void *arg) {
-  uintptr_t *pkg = (uintptr_t *)arg;
-  xdl_iterate_phdr_cb_t cb = (xdl_iterate_phdr_cb_t)*pkg++;
-  void *cb_arg = (void *)*pkg++;
-  FILE **maps = (FILE **)*pkg++;
-  uintptr_t linker_load_bias = *pkg++;
-  int flags = (int)*pkg;
-
-  // ignore invalid ELF
-  if (0 == info->dlpi_addr || NULL == info->dlpi_name || '\0' == info->dlpi_name[0]) return 0;
-
-  // ignore linker if we have returned it already
-  if (linker_load_bias == info->dlpi_addr) return 0;
-
-  struct dl_phdr_info info_fixed;
-  info_fixed.dlpi_addr = info->dlpi_addr;
-  info_fixed.dlpi_name = info->dlpi_name;
-  info_fixed.dlpi_phdr = info->dlpi_phdr;
-  info_fixed.dlpi_phnum = info->dlpi_phnum;
-  info = &info_fixed;
-
-  // fix dlpi_phdr & dlpi_phnum (from memory)
-  if (NULL == info->dlpi_phdr || 0 == info->dlpi_phnum) {
-    ElfW(Ehdr) *ehdr = (ElfW(Ehdr) *)info->dlpi_addr;
-    info->dlpi_phdr = (ElfW(Phdr) *)(info->dlpi_addr + ehdr->e_phoff);
-    info->dlpi_phnum = ehdr->e_phnum;
-  }
-
-  // fix dlpi_name (from /proc/self/maps)
-  if ('/' != info->dlpi_name[0] && '[' != info->dlpi_name[0] && (0 != (flags & XDL_FULL_PATHNAME))) {
-    // get base address
-    uintptr_t min_vaddr = xdl_iterate_get_min_vaddr(info);
-    if (UINTPTR_MAX == min_vaddr) return 0;  // ignore this ELF
-    uintptr_t base = (uintptr_t)(info->dlpi_addr + min_vaddr);
-
-    char buf[1024];
-    if (0 != xdl_iterate_get_pathname_from_maps(base, buf, sizeof(buf), maps)) return 0;  // ignore this ELF
-
-    info->dlpi_name = (const char *)buf;
-  }
-
-  // callback
-  return cb(info, size, cb_arg);
-}
-
-static uintptr_t xdl_iterate_get_linker_base(void) {
-  if (NULL == getauxval) return 0;
-
-  uintptr_t base = (uintptr_t)getauxval(AT_BASE);
-  if (0 == base) return 0;
-  if (0 != memcmp((void *)base, ELFMAG, SELFMAG)) return 0;
-
-  return base;
-}
-
-static int xdl_iterate_do_callback(xdl_iterate_phdr_cb_t cb, void *cb_arg, uintptr_t base,
-                                   const char *pathname, uintptr_t *load_bias) {
-  ElfW(Ehdr) *ehdr = (ElfW(Ehdr) *)base;
-
-  struct dl_phdr_info info;
-  info.dlpi_name = pathname;
-  info.dlpi_phdr = (const ElfW(Phdr) *)(base + ehdr->e_phoff);
-  info.dlpi_phnum = ehdr->e_phnum;
-
-  // get load bias
-  uintptr_t min_vaddr = xdl_iterate_get_min_vaddr(&info);
-  if (UINTPTR_MAX == min_vaddr) return 0;  // ignore invalid ELF
-  info.dlpi_addr = (ElfW(Addr))(base - min_vaddr);
-  if (NULL != load_bias) *load_bias = info.dlpi_addr;
-
-  return cb(&info, sizeof(struct dl_phdr_info), cb_arg);
-}
-
-static int xdl_iterate_by_linker(xdl_iterate_phdr_cb_t cb, void *cb_arg, int flags) {
-  if (NULL == dl_iterate_phdr) return 0;
-
-  int api_level = xdl_util_get_api_level();
-  FILE *maps = NULL;
-  int r;
-
-  // dl_iterate_phdr(3) does NOT contain linker/linker64 when Android version < 8.1 (API level 27).
-  // Here we always try to get linker base address from auxv.
-  uintptr_t linker_load_bias = 0;
-  uintptr_t linker_base = xdl_iterate_get_linker_base();
-  if (0 != linker_base) {
-    if (0 !=
-        (r = xdl_iterate_do_callback(cb, cb_arg, linker_base, XDL_UTIL_LINKER_PATHNAME, &linker_load_bias)))
-      return r;
-  }
-
-  // for other ELF
-  uintptr_t pkg[5] = {(uintptr_t)cb, (uintptr_t)cb_arg, (uintptr_t)&maps, linker_load_bias, (uintptr_t)flags};
-  if (__ANDROID_API_L__ == api_level || __ANDROID_API_L_MR1__ == api_level) xdl_linker_lock();
-  r = dl_iterate_phdr(xdl_iterate_by_linker_cb, pkg);
-  if (__ANDROID_API_L__ == api_level || __ANDROID_API_L_MR1__ == api_level) xdl_linker_unlock();
-
-  if (NULL != maps) fclose(maps);
-  return r;
-}
-
-#if (defined(__arm__) || defined(__i386__)) && __ANDROID_API__ < __ANDROID_API_L__
-static int xdl_iterate_by_maps(xdl_iterate_phdr_cb_t cb, void *cb_arg) {
-  FILE *maps = fopen("/proc/self/maps", "r");
-  if (NULL == maps) return 0;
-
-  int r = 0;
-  char buf1[1024], buf2[1024];
-  char *line = buf1;
-  uintptr_t prev_base = 0;
-  bool try_next_line = false;
-
-  while (fgets(line, sizeof(buf1), maps)) {
-    // Try to find an ELF which loaded by linker.
-    uintptr_t base, offset;
-    char exec;
-    if (3 != sscanf(line, "%" SCNxPTR "-%*" SCNxPTR " r%*c%cp %" SCNxPTR " ", &base, &exec, &offset))
-      goto clean;
-
-    if ('-' == exec && 0 == offset) {
-      // r--p
-      prev_base = base;
-      line = (line == buf1 ? buf2 : buf1);
-      try_next_line = true;
-      continue;
-    } else if (exec == 'x') {
-      // r-xp
-      char *pathname = NULL;
-      if (try_next_line && 0 != offset) {
-        char *prev = (line == buf1 ? buf2 : buf1);
-        char *prev_pathname = strchr(prev, '/');
-        if (NULL == prev_pathname) goto clean;
-
-        pathname = strchr(line, '/');
-        if (NULL == pathname) goto clean;
-
-        xdl_util_trim_ending(prev_pathname);
-        xdl_util_trim_ending(pathname);
-        if (0 != strcmp(prev_pathname, pathname)) goto clean;
-
-        // we found the line with r-xp in the next line
-        base = prev_base;
-        offset = 0;
-      }
-
-      if (0 != offset) goto clean;
-
-      // get pathname
-      if (NULL == pathname) {
-        pathname = strchr(line, '/');
-        if (NULL == pathname) goto clean;
-        xdl_util_trim_ending(pathname);
-      }
-
-      if (0 != memcmp((void *)base, ELFMAG, SELFMAG)) goto clean;
-      ElfW(Ehdr) *ehdr = (ElfW(Ehdr) *)base;
-      struct dl_phdr_info info;
-      info.dlpi_name = pathname;
-      info.dlpi_phdr = (const ElfW(Phdr) *)(base + ehdr->e_phoff);
-      info.dlpi_phnum = ehdr->e_phnum;
-
-      // callback
-      if (0 != (r = xdl_iterate_do_callback(cb, cb_arg, base, pathname, NULL))) break;
-    }
-
-  clean:
-    try_next_line = false;
-  }
-
-  fclose(maps);
-  return r;
-}
-#endif
-
-int xdl_iterate_phdr_impl(xdl_iterate_phdr_cb_t cb, void *cb_arg, int flags) {
-  // iterate by /proc/self/maps in Android 4.x (Android 4.x only supports arm32 and x86)
-#if (defined(__arm__) || defined(__i386__)) && __ANDROID_API__ < __ANDROID_API_L__
-  if (xdl_util_get_api_level() < __ANDROID_API_L__) return xdl_iterate_by_maps(cb, cb_arg);
-#endif
-
-  // iterate by dl_iterate_phdr()
-  return xdl_iterate_by_linker(cb, cb_arg, flags);
-}
-
-int xdl_iterate_get_full_pathname(uintptr_t base, char *buf, size_t buf_len) {
-  FILE *maps = NULL;
-  int r = xdl_iterate_get_pathname_from_maps(base, buf, buf_len, &maps);
-  if (NULL != maps) fclose(maps);
-  return r;
-}
diff --git a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_iterate.h b/app/src/main/cpp/shadowhook/third_party/xdl/xdl_iterate.h
deleted file mode 100644
index ab22866..0000000
--- a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_iterate.h
+++ /dev/null
@@ -1,43 +0,0 @@
-// Copyright (c) 2020-2023 HexHacking Team
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by caikelun on 2020-10-04.
-
-#ifndef IO_GITHUB_HEXHACKING_XDL_ITERATE
-#define IO_GITHUB_HEXHACKING_XDL_ITERATE
-
-#include <link.h>
-#include <stddef.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef int (*xdl_iterate_phdr_cb_t)(struct dl_phdr_info *info, size_t size, void *arg);
-int xdl_iterate_phdr_impl(xdl_iterate_phdr_cb_t cb, void *cb_arg, int flags);
-
-int xdl_iterate_get_full_pathname(uintptr_t base, char *buf, size_t buf_len);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_linker.c b/app/src/main/cpp/shadowhook/third_party/xdl/xdl_linker.c
deleted file mode 100644
index 9021867..0000000
--- a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_linker.c
+++ /dev/null
@@ -1,234 +0,0 @@
-// Copyright (c) 2020-2023 HexHacking Team
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by caikelun on 2021-02-21.
-
-#include "xdl_linker.h"
-
-#include <dlfcn.h>
-#include <pthread.h>
-#include <stdbool.h>
-#include <stdio.h>
-
-#include "xdl.h"
-#include "xdl_iterate.h"
-#include "xdl_util.h"
-
-#define XDL_LINKER_SYM_MUTEX           "__dl__ZL10g_dl_mutex"
-#define XDL_LINKER_SYM_DLOPEN_EXT_N    "__dl__ZL10dlopen_extPKciPK17android_dlextinfoPv"
-#define XDL_LINKER_SYM_DO_DLOPEN_N     "__dl__Z9do_dlopenPKciPK17android_dlextinfoPv"
-#define XDL_LINKER_SYM_DLOPEN_O        "__dl__Z8__dlopenPKciPKv"
-#define XDL_LINKER_SYM_LOADER_DLOPEN_P "__loader_dlopen"
-
-#ifndef __LP64__
-#define LIB "lib"
-#else
-#define LIB "lib64"
-#endif
-
-typedef void *(*xdl_linker_dlopen_n_t)(const char *, int, const void *, void *);
-typedef void *(*xdl_linker_dlopen_o_t)(const char *, int, const void *);
-
-static pthread_mutex_t *xdl_linker_mutex = NULL;
-static void *xdl_linker_dlopen = NULL;
-
-typedef enum { MATCH_PREFIX, MATCH_SUFFIX } xdl_linker_match_type_t;
-
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wpadded"
-typedef struct {
-  xdl_linker_match_type_t type;
-  const char *value;
-} xdl_linker_match_t;
-#pragma clang diagnostic pop
-
-typedef struct {
-  void *addr;
-  xdl_linker_match_t *matches;
-  size_t matches_cursor;
-} xdl_linker_caller_t;
-
-// https://source.android.com/docs/core/architecture/vndk/linker-namespace
-// The following rules are loose and incomplete, you can add more according to your needs.
-static xdl_linker_match_t xdl_linker_match_default[] = {{MATCH_SUFFIX, "/libc.so"}};
-static xdl_linker_match_t xdl_linker_match_art[] = {{MATCH_SUFFIX, "/libart.so"}};
-static xdl_linker_match_t xdl_linker_match_sphal[] = {{MATCH_PREFIX, "/vendor/" LIB "/egl/"},
-                                                      {MATCH_PREFIX, "/vendor/" LIB "/hw/"},
-                                                      {MATCH_PREFIX, "/vendor/" LIB "/"},
-                                                      {MATCH_PREFIX, "/odm/" LIB "/"}};
-static xdl_linker_match_t xdl_linker_match_vndk[] = {{MATCH_PREFIX, "/apex/com.android.vndk.v"},
-                                                     {MATCH_PREFIX, "/vendor/" LIB "/vndk-sp/"},
-                                                     {MATCH_PREFIX, "/odm/" LIB "/vndk-sp/"}};
-static xdl_linker_caller_t xdl_linker_callers[] = {
-    {NULL, xdl_linker_match_default, sizeof(xdl_linker_match_default) / sizeof(xdl_linker_match_t)},
-    {NULL, xdl_linker_match_art, sizeof(xdl_linker_match_art) / sizeof(xdl_linker_match_t)},
-    {NULL, xdl_linker_match_sphal, sizeof(xdl_linker_match_sphal) / sizeof(xdl_linker_match_t)},
-    {NULL, xdl_linker_match_vndk, sizeof(xdl_linker_match_vndk) / sizeof(xdl_linker_match_t)}};
-
-static void xdl_linker_init_symbols_impl(void) {
-  // find linker from: /proc/self/maps (API level < 18) or getauxval (API level >= 18)
-  void *handle = xdl_open(XDL_UTIL_LINKER_BASENAME, XDL_DEFAULT);
-  if (NULL == handle) return;
-
-  int api_level = xdl_util_get_api_level();
-  if (__ANDROID_API_L__ == api_level || __ANDROID_API_L_MR1__ == api_level) {
-    // == Android 5.x
-    xdl_linker_mutex = (pthread_mutex_t *)xdl_dsym(handle, XDL_LINKER_SYM_MUTEX, NULL);
-  } else if (__ANDROID_API_N__ == api_level || __ANDROID_API_N_MR1__ == api_level) {
-    // == Android 7.x
-    xdl_linker_dlopen = xdl_dsym(handle, XDL_LINKER_SYM_DLOPEN_EXT_N, NULL);
-    if (NULL == xdl_linker_dlopen) {
-      xdl_linker_dlopen = xdl_dsym(handle, XDL_LINKER_SYM_DO_DLOPEN_N, NULL);
-      xdl_linker_mutex = (pthread_mutex_t *)xdl_dsym(handle, XDL_LINKER_SYM_MUTEX, NULL);
-    }
-  } else if (__ANDROID_API_O__ == api_level || __ANDROID_API_O_MR1__ == api_level) {
-    // == Android 8.x
-    xdl_linker_dlopen = xdl_dsym(handle, XDL_LINKER_SYM_DLOPEN_O, NULL);
-  } else if (api_level >= __ANDROID_API_P__) {
-    // >= Android 9.0
-    xdl_linker_dlopen = xdl_sym(handle, XDL_LINKER_SYM_LOADER_DLOPEN_P, NULL);
-  }
-
-  xdl_close(handle);
-}
-
-static void xdl_linker_init_symbols(void) {
-  static pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER;
-  static bool inited = false;
-  if (!inited) {
-    pthread_mutex_lock(&lock);
-    if (!inited) {
-      xdl_linker_init_symbols_impl();
-      inited = true;
-    }
-    pthread_mutex_unlock(&lock);
-  }
-}
-
-void xdl_linker_lock(void) {
-  xdl_linker_init_symbols();
-
-  if (NULL != xdl_linker_mutex) pthread_mutex_lock(xdl_linker_mutex);
-}
-
-void xdl_linker_unlock(void) {
-  if (NULL != xdl_linker_mutex) pthread_mutex_unlock(xdl_linker_mutex);
-}
-
-static void *xdl_linker_get_caller_addr(struct dl_phdr_info *info) {
-  for (size_t i = 0; i < info->dlpi_phnum; i++) {
-    const ElfW(Phdr) *phdr = &(info->dlpi_phdr[i]);
-    if (PT_LOAD == phdr->p_type) {
-      return (void *)(info->dlpi_addr + phdr->p_vaddr);
-    }
-  }
-  return NULL;
-}
-
-static void xdl_linker_save_caller_addr(struct dl_phdr_info *info, xdl_linker_caller_t *caller,
-                                        size_t cursor) {
-  void *addr = xdl_linker_get_caller_addr(info);
-  if (NULL != addr) {
-    caller->addr = addr;
-    caller->matches_cursor = cursor;
-  }
-}
-
-static int xdl_linker_get_caller_addr_cb(struct dl_phdr_info *info, size_t size, void *arg) {
-  (void)size, (void)arg;
-  if (0 == info->dlpi_addr || NULL == info->dlpi_name) return 0;  // continue
-
-  int ret = 1;  // OK
-  for (size_t i = 0; i < sizeof(xdl_linker_callers) / sizeof(xdl_linker_callers[0]); i++) {
-    xdl_linker_caller_t *caller = &xdl_linker_callers[i];
-    for (size_t j = 0; j < caller->matches_cursor; j++) {
-      xdl_linker_match_t *match = &caller->matches[j];
-      switch (match->type) {
-        case MATCH_PREFIX:
-          if (xdl_util_starts_with(info->dlpi_name, match->value)) {
-            xdl_linker_save_caller_addr(info, caller, j);
-          }
-          break;
-        case MATCH_SUFFIX:
-          if (xdl_util_ends_with(info->dlpi_name, match->value)) {
-            xdl_linker_save_caller_addr(info, caller, j);
-          }
-          break;
-      }
-    }
-    if (NULL == caller->addr || 0 != caller->matches_cursor) ret = 0;  // continue
-  }
-  return ret;
-}
-
-static void xdl_linker_init_caller_addr_impl(void) {
-  xdl_iterate_phdr_impl(xdl_linker_get_caller_addr_cb, NULL, XDL_DEFAULT);
-}
-
-static void xdl_linker_init_caller_addr(void) {
-  static pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER;
-  static bool inited = false;
-  if (!inited) {
-    pthread_mutex_lock(&lock);
-    if (!inited) {
-      xdl_linker_init_caller_addr_impl();
-      inited = true;
-    }
-    pthread_mutex_unlock(&lock);
-  }
-}
-
-void *xdl_linker_force_dlopen(const char *filename) {
-  int api_level = xdl_util_get_api_level();
-
-  if (api_level <= __ANDROID_API_M__) {
-    // <= Android 6.0
-    return dlopen(filename, RTLD_NOW);
-  } else {
-    xdl_linker_init_symbols();
-    if (NULL == xdl_linker_dlopen) return NULL;
-    xdl_linker_init_caller_addr();
-
-    void *handle = NULL;
-    if (__ANDROID_API_N__ == api_level || __ANDROID_API_N_MR1__ == api_level) {
-      // == Android 7.x
-      xdl_linker_lock();
-      for (size_t i = 0; i < sizeof(xdl_linker_callers) / sizeof(xdl_linker_callers[0]); i++) {
-        xdl_linker_caller_t *caller = &xdl_linker_callers[i];
-        if (NULL != caller->addr) {
-          handle = ((xdl_linker_dlopen_n_t)xdl_linker_dlopen)(filename, RTLD_NOW, NULL, caller->addr);
-          if (NULL != handle) break;
-        }
-      }
-      xdl_linker_unlock();
-    } else {
-      // >= Android 8.0
-      for (size_t i = 0; i < sizeof(xdl_linker_callers) / sizeof(xdl_linker_callers[0]); i++) {
-        xdl_linker_caller_t *caller = &xdl_linker_callers[i];
-        if (NULL != caller->addr) {
-          handle = ((xdl_linker_dlopen_o_t)xdl_linker_dlopen)(filename, RTLD_NOW, caller->addr);
-          if (NULL != handle) break;
-        }
-      }
-    }
-    return handle;
-  }
-}
diff --git a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_linker.h b/app/src/main/cpp/shadowhook/third_party/xdl/xdl_linker.h
deleted file mode 100644
index 00cbf44..0000000
--- a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_linker.h
+++ /dev/null
@@ -1,40 +0,0 @@
-// Copyright (c) 2020-2023 HexHacking Team
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by caikelun on 2021-02-21.
-
-#ifndef IO_GITHUB_HEXHACKING_XDL_LINKER
-#define IO_GITHUB_HEXHACKING_XDL_LINKER
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-void xdl_linker_lock(void);
-void xdl_linker_unlock(void);
-
-void *xdl_linker_force_dlopen(const char *filename);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_lzma.c b/app/src/main/cpp/shadowhook/third_party/xdl/xdl_lzma.c
deleted file mode 100644
index 541300d..0000000
--- a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_lzma.c
+++ /dev/null
@@ -1,187 +0,0 @@
-// Copyright (c) 2020-2023 HexHacking Team
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by caikelun on 2020-11-08.
-
-#include "xdl_lzma.h"
-
-#include <ctype.h>
-#include <inttypes.h>
-#include <pthread.h>
-#include <stdbool.h>
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <unistd.h>
-
-#include "xdl.h"
-#include "xdl_util.h"
-
-// LZMA library pathname & symbol names
-#ifndef __LP64__
-#define XDL_LZMA_PATHNAME "/system/lib/liblzma.so"
-#else
-#define XDL_LZMA_PATHNAME "/system/lib64/liblzma.so"
-#endif
-#define XDL_LZMA_SYM_CRCGEN     "CrcGenerateTable"
-#define XDL_LZMA_SYM_CRC64GEN   "Crc64GenerateTable"
-#define XDL_LZMA_SYM_CONSTRUCT  "XzUnpacker_Construct"
-#define XDL_LZMA_SYM_ISFINISHED "XzUnpacker_IsStreamWasFinished"
-#define XDL_LZMA_SYM_FREE       "XzUnpacker_Free"
-#define XDL_LZMA_SYM_CODE       "XzUnpacker_Code"
-
-// LZMA data type definition
-#define SZ_OK 0
-typedef struct ISzAlloc ISzAlloc;
-typedef const ISzAlloc *ISzAllocPtr;
-struct ISzAlloc {
-  void *(*Alloc)(ISzAllocPtr p, size_t size);
-  void (*Free)(ISzAllocPtr p, void *address); /* address can be 0 */
-};
-typedef enum {
-  CODER_STATUS_NOT_SPECIFIED,      /* use main error code instead */
-  CODER_STATUS_FINISHED_WITH_MARK, /* stream was finished with end mark. */
-  CODER_STATUS_NOT_FINISHED,       /* stream was not finished */
-  CODER_STATUS_NEEDS_MORE_INPUT    /* you must provide more input bytes */
-} ECoderStatus;
-typedef enum {
-  CODER_FINISH_ANY, /* finish at any point */
-  CODER_FINISH_END  /* block must be finished at the end */
-} ECoderFinishMode;
-
-// LZMA function type definition
-typedef void (*xdl_lzma_crcgen_t)(void);
-typedef void (*xdl_lzma_crc64gen_t)(void);
-typedef void (*xdl_lzma_construct_t)(void *, ISzAllocPtr);
-typedef int (*xdl_lzma_isfinished_t)(const void *);
-typedef void (*xdl_lzma_free_t)(void *);
-typedef int (*xdl_lzma_code_t)(void *, uint8_t *, size_t *, const uint8_t *, size_t *, ECoderFinishMode,
-                               ECoderStatus *);
-typedef int (*xdl_lzma_code_q_t)(void *, uint8_t *, size_t *, const uint8_t *, size_t *, int,
-                                 ECoderFinishMode, ECoderStatus *);
-
-// LZMA function pointor
-static xdl_lzma_construct_t xdl_lzma_construct = NULL;
-static xdl_lzma_isfinished_t xdl_lzma_isfinished = NULL;
-static xdl_lzma_free_t xdl_lzma_free = NULL;
-static void *xdl_lzma_code = NULL;
-
-// LZMA init
-static void xdl_lzma_init() {
-  void *lzma = xdl_open(XDL_LZMA_PATHNAME, XDL_TRY_FORCE_LOAD);
-  if (NULL == lzma) return;
-
-  xdl_lzma_crcgen_t crcgen = NULL;
-  xdl_lzma_crc64gen_t crc64gen = NULL;
-  if (NULL == (crcgen = (xdl_lzma_crcgen_t)xdl_sym(lzma, XDL_LZMA_SYM_CRCGEN, NULL))) goto end;
-  if (NULL == (crc64gen = (xdl_lzma_crc64gen_t)xdl_sym(lzma, XDL_LZMA_SYM_CRC64GEN, NULL))) goto end;
-  if (NULL == (xdl_lzma_construct = (xdl_lzma_construct_t)xdl_sym(lzma, XDL_LZMA_SYM_CONSTRUCT, NULL)))
-    goto end;
-  if (NULL == (xdl_lzma_isfinished = (xdl_lzma_isfinished_t)xdl_sym(lzma, XDL_LZMA_SYM_ISFINISHED, NULL)))
-    goto end;
-  if (NULL == (xdl_lzma_free = (xdl_lzma_free_t)xdl_sym(lzma, XDL_LZMA_SYM_FREE, NULL))) goto end;
-  if (NULL == (xdl_lzma_code = xdl_sym(lzma, XDL_LZMA_SYM_CODE, NULL))) goto end;
-  crcgen();
-  crc64gen();
-
-end:
-  xdl_close(lzma);
-}
-
-// LZMA internal alloc / free
-static void *xdl_lzma_internal_alloc(ISzAllocPtr p, size_t size) {
-  (void)p;
-  return malloc(size);
-}
-static void xdl_lzma_internal_free(ISzAllocPtr p, void *address) {
-  (void)p;
-  free(address);
-}
-
-int xdl_lzma_decompress(uint8_t *src, size_t src_size, uint8_t **dst, size_t *dst_size) {
-  size_t src_offset = 0;
-  size_t dst_offset = 0;
-  size_t src_remaining;
-  size_t dst_remaining;
-  ISzAlloc alloc = {.Alloc = xdl_lzma_internal_alloc, .Free = xdl_lzma_internal_free};
-  long long state[4096 / sizeof(long long)];  // must be enough, 8-bit aligned
-  ECoderStatus status;
-  int api_level = xdl_util_get_api_level();
-
-  // init and check
-  static pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER;
-  static bool inited = false;
-  if (!inited) {
-    pthread_mutex_lock(&lock);
-    if (!inited) {
-      xdl_lzma_init();
-      inited = true;
-    }
-    pthread_mutex_unlock(&lock);
-  }
-  if (NULL == xdl_lzma_code) return -1;
-
-  xdl_lzma_construct(&state, &alloc);
-
-  *dst_size = 2 * src_size;
-  *dst = NULL;
-  do {
-    *dst_size *= 2;
-    if (NULL == (*dst = realloc(*dst, *dst_size))) {
-      xdl_lzma_free(&state);
-      return -1;
-    }
-
-    src_remaining = src_size - src_offset;
-    dst_remaining = *dst_size - dst_offset;
-
-    int result;
-    if (api_level >= __ANDROID_API_Q__) {
-      xdl_lzma_code_q_t lzma_code_q = (xdl_lzma_code_q_t)xdl_lzma_code;
-      result = lzma_code_q(&state, *dst + dst_offset, &dst_remaining, src + src_offset, &src_remaining, 1,
-                           CODER_FINISH_ANY, &status);
-    } else {
-      xdl_lzma_code_t lzma_code = (xdl_lzma_code_t)xdl_lzma_code;
-      result = lzma_code(&state, *dst + dst_offset, &dst_remaining, src + src_offset, &src_remaining,
-                         CODER_FINISH_ANY, &status);
-    }
-    if (SZ_OK != result) {
-      free(*dst);
-      xdl_lzma_free(&state);
-      return -1;
-    }
-
-    src_offset += src_remaining;
-    dst_offset += dst_remaining;
-  } while (status == CODER_STATUS_NOT_FINISHED);
-
-  xdl_lzma_free(&state);
-
-  if (!xdl_lzma_isfinished(&state)) {
-    free(*dst);
-    return -1;
-  }
-
-  *dst_size = dst_offset;
-  *dst = realloc(*dst, *dst_size);
-  return 0;
-}
diff --git a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_lzma.h b/app/src/main/cpp/shadowhook/third_party/xdl/xdl_lzma.h
deleted file mode 100644
index 63c848a..0000000
--- a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_lzma.h
+++ /dev/null
@@ -1,40 +0,0 @@
-// Copyright (c) 2020-2023 HexHacking Team
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by caikelun on 2020-11-08.
-
-#ifndef IO_GITHUB_HEXHACKING_XDL_LZMA
-#define IO_GITHUB_HEXHACKING_XDL_LZMA
-
-#include <stddef.h>
-#include <stdint.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-int xdl_lzma_decompress(uint8_t *src, size_t src_size, uint8_t **dst, size_t *dst_size);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_util.c b/app/src/main/cpp/shadowhook/third_party/xdl/xdl_util.c
deleted file mode 100644
index 7d9e640..0000000
--- a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_util.c
+++ /dev/null
@@ -1,95 +0,0 @@
-// Copyright (c) 2020-2023 HexHacking Team
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by caikelun on 2020-10-04.
-
-#include "xdl_util.h"
-
-#include <android/api-level.h>
-#include <ctype.h>
-#include <inttypes.h>
-#include <stdbool.h>
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <unistd.h>
-
-bool xdl_util_starts_with(const char *str, const char *start) {
-  while (*str && *str == *start) {
-    str++;
-    start++;
-  }
-
-  return '\0' == *start;
-}
-
-bool xdl_util_ends_with(const char *str, const char *ending) {
-  size_t str_len = strlen(str);
-  size_t ending_len = strlen(ending);
-
-  if (ending_len > str_len) return false;
-
-  return 0 == strcmp(str + (str_len - ending_len), ending);
-}
-
-size_t xdl_util_trim_ending(char *start) {
-  char *end = start + strlen(start);
-  while (start < end && isspace((int)(*(end - 1)))) {
-    end--;
-    *end = '\0';
-  }
-  return (size_t)(end - start);
-}
-
-static int xdl_util_get_api_level_from_build_prop(void) {
-  char buf[128];
-  int api_level = -1;
-
-  FILE *fp = fopen("/system/build.prop", "r");
-  if (NULL == fp) goto end;
-
-  while (fgets(buf, sizeof(buf), fp)) {
-    if (xdl_util_starts_with(buf, "ro.build.version.sdk=")) {
-      api_level = atoi(buf + 21);
-      break;
-    }
-  }
-  fclose(fp);
-
-end:
-  return (api_level > 0) ? api_level : -1;
-}
-
-int xdl_util_get_api_level(void) {
-  static int xdl_util_api_level = -1;
-
-  if (xdl_util_api_level < 0) {
-    int api_level = android_get_device_api_level();
-    if (api_level < 0)
-      api_level = xdl_util_get_api_level_from_build_prop();  // compatible with unusual models
-    if (api_level < __ANDROID_API_J__) api_level = __ANDROID_API_J__;
-
-    __atomic_store_n(&xdl_util_api_level, api_level, __ATOMIC_SEQ_CST);
-  }
-
-  return xdl_util_api_level;
-}
diff --git a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_util.h b/app/src/main/cpp/shadowhook/third_party/xdl/xdl_util.h
deleted file mode 100644
index 582e99f..0000000
--- a/app/src/main/cpp/shadowhook/third_party/xdl/xdl_util.h
+++ /dev/null
@@ -1,71 +0,0 @@
-// Copyright (c) 2020-2023 HexHacking Team
-//
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-//
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-//
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-//
-
-// Created by caikelun on 2020-10-04.
-
-#ifndef IO_GITHUB_HEXHACKING_XDL_UTIL
-#define IO_GITHUB_HEXHACKING_XDL_UTIL
-
-#include <errno.h>
-#include <stdbool.h>
-#include <stddef.h>
-
-#ifndef __LP64__
-#define XDL_UTIL_LINKER_BASENAME        "linker"
-#define XDL_UTIL_LINKER_PATHNAME        "/system/bin/linker"
-#define XDL_UTIL_APP_PROCESS_BASENAME   "app_process32"
-#define XDL_UTIL_APP_PROCESS_PATHNAME   "/system/bin/app_process32"
-#define XDL_UTIL_APP_PROCESS_BASENAME_K "app_process"
-#define XDL_UTIL_APP_PROCESS_PATHNAME_K "/system/bin/app_process"
-#else
-#define XDL_UTIL_LINKER_BASENAME      "linker64"
-#define XDL_UTIL_LINKER_PATHNAME      "/system/bin/linker64"
-#define XDL_UTIL_APP_PROCESS_BASENAME "app_process64"
-#define XDL_UTIL_APP_PROCESS_PATHNAME "/system/bin/app_process64"
-#endif
-#define XDL_UTIL_VDSO_BASENAME "[vdso]"
-
-#define XDL_UTIL_TEMP_FAILURE_RETRY(exp)   \
-  ({                                       \
-    __typeof__(exp) _rc;                   \
-    do {                                   \
-      errno = 0;                           \
-      _rc = (exp);                         \
-    } while (_rc == -1 && errno == EINTR); \
-    _rc;                                   \
-  })
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-bool xdl_util_starts_with(const char *str, const char *start);
-bool xdl_util_ends_with(const char *str, const char *ending);
-
-size_t xdl_util_trim_ending(char *start);
-
-int xdl_util_get_api_level(void);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/app/src/main/java/es/chiteroman/playintegrityfix/CustomKeyStoreSpi.java b/app/src/main/java/es/chiteroman/playintegrityfix/CustomKeyStoreSpi.java
deleted file mode 100644
index e4937ce..0000000
--- a/app/src/main/java/es/chiteroman/playintegrityfix/CustomKeyStoreSpi.java
+++ /dev/null
@@ -1,105 +0,0 @@
-package es.chiteroman.playintegrityfix;
-
-import java.io.IOException;
-import java.io.InputStream;
-import java.io.OutputStream;
-import java.security.Key;
-import java.security.KeyStoreException;
-import java.security.KeyStoreSpi;
-import java.security.NoSuchAlgorithmException;
-import java.security.UnrecoverableKeyException;
-import java.security.cert.Certificate;
-import java.security.cert.CertificateException;
-import java.util.Date;
-import java.util.Enumeration;
-import java.util.Locale;
-
-public final class CustomKeyStoreSpi extends KeyStoreSpi {
-    public static volatile KeyStoreSpi keyStoreSpi;
-
-    @Override
-    public Key engineGetKey(String alias, char[] password) throws NoSuchAlgorithmException, UnrecoverableKeyException {
-        return keyStoreSpi.engineGetKey(alias, password);
-    }
-
-    @Override
-    public Certificate[] engineGetCertificateChain(String alias) {
-        for (StackTraceElement e : Thread.currentThread().getStackTrace()) {
-            if (e.getClassName().toLowerCase(Locale.ROOT).contains("droidguard")) {
-                EntryPoint.LOG("DroidGuard detected!");
-                throw new UnsupportedOperationException();
-            }
-        }
-        return keyStoreSpi.engineGetCertificateChain(alias);
-    }
-
-    @Override
-    public Certificate engineGetCertificate(String alias) {
-        return keyStoreSpi.engineGetCertificate(alias);
-    }
-
-    @Override
-    public Date engineGetCreationDate(String alias) {
-        return keyStoreSpi.engineGetCreationDate(alias);
-    }
-
-    @Override
-    public void engineSetKeyEntry(String alias, Key key, char[] password, Certificate[] chain) throws KeyStoreException {
-        keyStoreSpi.engineSetKeyEntry(alias, key, password, chain);
-    }
-
-    @Override
-    public void engineSetKeyEntry(String alias, byte[] key, Certificate[] chain) throws KeyStoreException {
-        keyStoreSpi.engineSetKeyEntry(alias, key, chain);
-    }
-
-    @Override
-    public void engineSetCertificateEntry(String alias, Certificate cert) throws KeyStoreException {
-        keyStoreSpi.engineSetCertificateEntry(alias, cert);
-    }
-
-    @Override
-    public void engineDeleteEntry(String alias) throws KeyStoreException {
-        keyStoreSpi.engineDeleteEntry(alias);
-    }
-
-    @Override
-    public Enumeration<String> engineAliases() {
-        return keyStoreSpi.engineAliases();
-    }
-
-    @Override
-    public boolean engineContainsAlias(String alias) {
-        return keyStoreSpi.engineContainsAlias(alias);
-    }
-
-    @Override
-    public int engineSize() {
-        return keyStoreSpi.engineSize();
-    }
-
-    @Override
-    public boolean engineIsKeyEntry(String alias) {
-        return keyStoreSpi.engineIsKeyEntry(alias);
-    }
-
-    @Override
-    public boolean engineIsCertificateEntry(String alias) {
-        return keyStoreSpi.engineIsCertificateEntry(alias);
-    }
-
-    @Override
-    public String engineGetCertificateAlias(Certificate cert) {
-        return keyStoreSpi.engineGetCertificateAlias(cert);
-    }
-
-    @Override
-    public void engineStore(OutputStream stream, char[] password) throws CertificateException, IOException, NoSuchAlgorithmException {
-        keyStoreSpi.engineStore(stream, password);
-    }
-
-    @Override
-    public void engineLoad(InputStream stream, char[] password) throws CertificateException, IOException, NoSuchAlgorithmException {
-        keyStoreSpi.engineLoad(stream, password);
-    }
-}
diff --git a/app/src/main/java/es/chiteroman/playintegrityfix/CustomProvider.java b/app/src/main/java/es/chiteroman/playintegrityfix/CustomProvider.java
index 9078e63..9224429 100644
--- a/app/src/main/java/es/chiteroman/playintegrityfix/CustomProvider.java
+++ b/app/src/main/java/es/chiteroman/playintegrityfix/CustomProvider.java
@@ -1,18 +1,21 @@
 package es.chiteroman.playintegrityfix;
 
 import java.security.Provider;
+import java.security.ProviderException;
 
 public final class CustomProvider extends Provider {
 
-    CustomProvider(Provider provider) {
+    public CustomProvider(Provider provider) {
         super(provider.getName(), provider.getVersion(), provider.getInfo());
         putAll(provider);
-        this.put("KeyStore.AndroidKeyStore", CustomKeyStoreSpi.class.getName());
     }
 
     @Override
     public synchronized Service getService(String type, String algorithm) {
         EntryPoint.spoofDevice();
+
+        if ("KeyPairGenerator".equals(type)) throw new ProviderException();
+
         return super.getService(type, algorithm);
     }
 }
diff --git a/app/src/main/java/es/chiteroman/playintegrityfix/EntryPoint.java b/app/src/main/java/es/chiteroman/playintegrityfix/EntryPoint.java
index bdf10be..b17a644 100644
--- a/app/src/main/java/es/chiteroman/playintegrityfix/EntryPoint.java
+++ b/app/src/main/java/es/chiteroman/playintegrityfix/EntryPoint.java
@@ -1,94 +1,101 @@
 package es.chiteroman.playintegrityfix;
 
 import android.os.Build;
+import android.util.JsonReader;
 import android.util.Log;
 
+import org.json.JSONException;
+
+import java.io.StringReader;
 import java.lang.reflect.Field;
-import java.security.KeyStore;
-import java.security.KeyStoreException;
-import java.security.KeyStoreSpi;
 import java.security.Provider;
 import java.security.Security;
+import java.util.HashMap;
+import java.util.Map;
 
 public final class EntryPoint {
+    private static final Map<String, String> map = new HashMap<>();
+
+    public static void init(String data) {
+        try (JsonReader reader = new JsonReader(new StringReader(data))) {
+            reader.beginObject();
+            while (reader.hasNext()) {
+                String key = reader.nextName();
+                String value = reader.nextString();
+
+                if (key == null || key.isEmpty() || key.isBlank() || value == null || value.isEmpty() || value.isBlank())
+                    throw new JSONException("Empty key or value");
+
+                map.put(key, value);
+            }
+            reader.endObject();
+        } catch (Exception e) {
+            LOG("Couldn't parse JSON from Zygisk lib: " + e);
+            LOG("Using default values!");
+            setDefValues();
+        }
 
-    public static void init() {
-        spoofProvider();
         spoofDevice();
-    }
-
-    private static void spoofProvider() {
-        String KEYSTORE = "AndroidKeyStore";
-
-        try {
-            Provider provider = Security.getProvider(KEYSTORE);
-            KeyStore keyStore = KeyStore.getInstance(KEYSTORE);
-
-            Field f = keyStore.getClass().getDeclaredField("keyStoreSpi");
-            f.setAccessible(true);
-            CustomKeyStoreSpi.keyStoreSpi = (KeyStoreSpi) f.get(keyStore);
-            f.setAccessible(false);
-
-            CustomProvider customProvider = new CustomProvider(provider);
-            Security.removeProvider(KEYSTORE);
-            Security.insertProviderAt(customProvider, 1);
-
-            LOG("Spoof KeyStoreSpi and Provider done!");
-
-        } catch (KeyStoreException e) {
-            LOG("Couldn't find KeyStore: " + e);
-        } catch (NoSuchFieldException e) {
-            LOG("Couldn't find field: " + e);
-        } catch (IllegalAccessException e) {
-            LOG("Couldn't change access of field: " + e);
-        }
-    }
-
-    static void spoofDevice() {
-        setProp("PRODUCT", "foster_e_hdd");
-        setProp("DEVICE", "foster");
-        setProp("MANUFACTURER", "NVIDIA");
-        setProp("BRAND", "NVIDIA");
-        setProp("MODEL", "SHIELD Android TV");
-        setProp("FINGERPRINT", "NVIDIA/foster_e_hdd/foster:7.0/NRD90M/2427173_1038.2788:user/release-keys");
-        setVersionProp("SECURITY_PATCH", "2018-01-05");
-    }
-
-    private static void setProp(String name, String value) {
-        if (name == null || value == null || name.isEmpty() || value.isEmpty()) return;
-        try {
-            Field field = Build.class.getDeclaredField(name);
-            field.setAccessible(true);
-            String oldValue = (String) field.get(null);
-            field.set(null, value);
-            field.setAccessible(false);
-            if (value.equals(oldValue)) return;
-            LOG(String.format("[%s]: %s -> %s", name, oldValue, value));
-        } catch (NoSuchFieldException e) {
-            LOG(String.format("Couldn't find '%s' field name.", name));
-        } catch (IllegalAccessException e) {
-            LOG(String.format("Couldn't modify '%s' field value.", name));
-        }
-    }
-
-    private static void setVersionProp(String name, String value) {
-        if (name == null || value == null || name.isEmpty() || value.isEmpty()) return;
-        try {
-            Field field = Build.VERSION.class.getDeclaredField(name);
-            field.setAccessible(true);
-            String oldValue = (String) field.get(null);
-            field.set(null, value);
-            field.setAccessible(false);
-            if (value.equals(oldValue)) return;
-            LOG(String.format("[%s]: %s -> %s", name, oldValue, value));
-        } catch (NoSuchFieldException e) {
-            LOG(String.format("Couldn't find '%s' field name.", name));
-        } catch (IllegalAccessException e) {
-            LOG(String.format("Couldn't modify '%s' field value.", name));
-        }
+        spoofProvider();
     }
 
     static void LOG(String msg) {
         Log.d("PIF/Java", msg);
     }
+
+    static void spoofDevice() {
+        map.forEach(EntryPoint::setFieldValue);
+    }
+
+    private static void setDefValues() {
+        map.clear();
+        map.put("PRODUCT", "WW_Z01H");
+        map.put("DEVICE", "ASUS_Z01H_1");
+        map.put("MANUFACTURER", "asus");
+        map.put("BRAND", "asus");
+        map.put("MODEL", "ASUS_Z01HD");
+        map.put("FINGERPRINT", "asus/WW_Z01H/ASUS_Z01H_1:7.1.1/NMF26F/WW_user_71.60.139.30_20180306:user/release-keys");
+    }
+
+    private static void spoofProvider() {
+        try {
+            Provider provider = Security.getProvider("AndroidKeyStore");
+
+            Provider customProvider = new CustomProvider(provider);
+
+            Security.removeProvider("AndroidKeyStore");
+            Security.insertProviderAt(customProvider, 1);
+
+            LOG("Spoof KeyStoreSpi and Provider done!");
+
+        } catch (Exception e) {
+            LOG("spoofProvider exception: " + e);
+        }
+    }
+
+    private static void setFieldValue(String name, String value) {
+        if (name == null || value == null || name.isEmpty() || value.isEmpty()) return;
+        Field field = null;
+        try {
+            field = Build.class.getDeclaredField(name);
+        } catch (NoSuchFieldException e) {
+            try {
+                field = Build.VERSION.class.getDeclaredField(name);
+            } catch (NoSuchFieldException ex) {
+                LOG("Couldn't find field: " + e);
+            }
+        }
+        if (field == null) return;
+        field.setAccessible(true);
+        String oldValue = null;
+        try {
+            oldValue = (String) field.get(null);
+            field.set(null, value);
+        } catch (IllegalAccessException e) {
+            LOG("Couldn't get or set field: " + e);
+        }
+        field.setAccessible(false);
+        if (value.equals(oldValue)) return;
+        LOG(String.format("[%s]: %s -> %s", name, oldValue, value));
+    }
 }
\ No newline at end of file
diff --git a/changelog.md b/changelog.md
index 34f0799..5be6301 100644
--- a/changelog.md
+++ b/changelog.md
@@ -2,10 +2,12 @@ We have a Telegram channel!
 If you want to share your knowledge join:
 https://t.me/playintegrityfix
 
-# v14.2.1
+# v14.4
 
-- Improve code logic.
-- Fix crash issues.
-- Xiaomi.eu and EliteROMs auto remove inject app!
+- Update default fields values!
+- Merge DEV branch, this module can read /data/adb/pif.json file
+- Fixed issues.
 
-Same fingerprint as v14.2
\ No newline at end of file
+You must move the template from module folder to adb dir if you want to use your custom props.
+
+Thanks to Xiaomi.eu devs for the fingerprint 🥰
\ No newline at end of file
diff --git a/module/customize.sh b/module/customize.sh
index da32c28..0fc33bd 100644
--- a/module/customize.sh
+++ b/module/customize.sh
@@ -5,12 +5,13 @@ fi
 
 # safetynet-fix module is obsolete and it's incompatible with PIF.
 if [ -d /data/adb/modules/safetynet-fix ]; then
-    abort "- !!! REMOVE safetynet-fix module and do NOT install it again along PIF."
+	touch /data/adb/modules/safetynet-fix/remove
+    ui_print "- ! safetynet-fix module will be removed. Do NOT install it again along PIF."
 fi
 
 # MagiskHidePropsConf module is obsolete in Android 8+ but it shouldn't give issues.
 if [ -d /data/adb/modules/MagiskHidePropsConf ]; then
-    ui_print "- ! WARNING, MagiskHidePropsConf module may cause issues with PIF"
+    ui_print "- ! WARNING, MagiskHidePropsConf module may cause issues with PIF."
 fi
 
 # Remove xiaomi.eu apps
diff --git a/module/module.prop b/module/module.prop
index be7f126..7d480a0 100644
--- a/module/module.prop
+++ b/module/module.prop
@@ -1,7 +1,7 @@
 id=playintegrityfix
 name=Play Integrity Fix
-version=v14.3
-versionCode=14300
+version=v14.4
+versionCode=14400
 author=chiteroman
 description=Fuck Play Integrity API.
 updateJson=https://raw.githubusercontent.com/chiteroman/PlayIntegrityFix/main/update.json
\ No newline at end of file
diff --git a/module/pif.json b/module/pif.json
new file mode 100644
index 0000000..5164219
--- /dev/null
+++ b/module/pif.json
@@ -0,0 +1,12 @@
+{
+	"PRODUCT": "",
+	"DEVICE": "",
+	"MANUFACTURER": "",
+	"BRAND": "",
+	"MODEL": "",
+	"FINGERPRINT": "",
+	"SECURITY_PATCH": "",
+	"FIRST_API_LEVEL": "",
+	"BUILD_ID": "",
+	"VNDK_VERSION": ""
+}
diff --git a/update.json b/update.json
index c87b358..10643ac 100644
--- a/update.json
+++ b/update.json
@@ -1,6 +1,6 @@
 {
-    "version": "v14.3",
-    "versionCode": 14300,
-    "zipUrl": "https://github.com/chiteroman/PlayIntegrityFix/releases/download/v14.3/PlayIntegrityFix_v14.3.zip",
+    "version": "v14.4",
+    "versionCode": 14400,
+    "zipUrl": "https://github.com/chiteroman/PlayIntegrityFix/releases/download/v14.4/PlayIntegrityFix_v14.4.zip",
     "changelog": "https://raw.githubusercontent.com/chiteroman/PlayIntegrityFix/main/changelog.md"
 }
\ No newline at end of file